diff -Nrcpad gcc-5.4.0/ChangeLog gcc-5.5.0/ChangeLog
*** gcc-5.4.0/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,19 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-01-09  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backport from mainline
+ 	2016-10-10  Andreas Tobler <andreast@gcc.gnu.org>
+ 
+ 	* configure.ac: Add aarch64-*-freebsd*.
+ 	* configure: Regenerate.
+ 
+ 2016-08-31  Jakub Sejdak  <jakub.sejdak@phoesys.com>
+ 
+ 	* config.sub: Add support for Phoenix-RTOS targets.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/INSTALL/binaries.html gcc-5.5.0/INSTALL/binaries.html
*** gcc-5.4.0/INSTALL/binaries.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/binaries.html	Tue Oct 10 08:13:25 2017
***************
*** 1,111 ****
! <html lang="en">
! <head>
! <title>Installing GCC: Binaries</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Installing GCC: Binaries">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
! <body>
! <h1 class="settitle">Installing GCC: Binaries</h1>
! <a name="index-Binaries-1"></a><a name="index-Installing-GCC_003a-Binaries-2"></a>
! We are often asked about pre-compiled versions of GCC.  While we cannot
! provide these for all platforms, below you'll find links to binaries for
  various platforms where creating them by yourself is not easy due to various
  reasons.
! 
!    <p>Please note that we did not create these binaries, nor do we
  support them.  If you have any problems installing them, please
  contact their makers.
  
!      <ul>
! <li>AIX:
!           <ul>
! <li><a href="http://www.bullfreeware.com">Bull's Freeware and Shareware Archive for AIX</a>;
! 
!           <li><a href="http://pware.hvcc.edu">Hudson Valley Community College Open Source Software for IBM System p</a>;
  
!           <li><a href="http://www.perzl.org/aix/">AIX 5L and 6 Open Source Packages</a>. 
! </ul>
  
!      <li>DOS&mdash;<a href="http://www.delorie.com/djgpp/">DJGPP</a>.
  
!      <li>Renesas H8/300[HS]&mdash;<a href="http://h8300-hms.sourceforge.net/">GNU Development Tools for the Renesas H8/300[HS] Series</a>.
  
!      <li>HP-UX:
!           <ul>
! <li><a href="http://hpux.connect.org.uk/">HP-UX Porting Center</a>;
  
!           <li><a href="ftp://sunsite.informatik.rwth-aachen.de/pub/packages/gcc_hpux/">Binaries for HP-UX 11.00 at Aachen University of Technology</a>. 
! </ul>
  
!      <li><a href="http://www.sco.com/skunkware/devtools/index.html#gcc">SCO OpenServer/Unixware</a>.
  
!      <li>Solaris 2 (SPARC, Intel):
!           <ul>
! <li><a href="http://www.opencsw.org/">OpenCSW</a>
  
!           <li><a href="http://jupiterrise.com/tgcware/">TGCware</a>
! </ul>
  
!      <li>Microsoft Windows:
!           <ul>
! <li>The <a href="http://sourceware.org/cygwin/">Cygwin</a> project;
! <li>The <a href="http://www.mingw.org/">MinGW</a> project. 
! </ul>
  
!      <li><a href="ftp://ftp.thewrittenword.com/packages/by-name/">The Written Word</a> offers binaries for
  AIX 4.3.3, 5.1 and 5.2,
  GNU/Linux (i386),
  HP-UX 10.20, 11.00, and 11.11, and
  Solaris/SPARC 2.5.1, 2.6, 7, 8, 9 and 10.
  
!      <li><a href="http://www.openpkg.org/">OpenPKG</a> offers binaries for quite a
  number of platforms.
  
!      <li>The <a href="http://gcc.gnu.org/wiki/GFortranBinaries">GFortran Wiki</a> has
! links to GNU Fortran binaries for several platforms. 
! </ul>
  
!    <p><hr />
  <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- ***Specific**************************************************************** -->
- <!-- ***Old documentation****************************************************** -->
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 1,164 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
! 
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <a name="index-Binaries"></a>
! <a name="index-Installing-GCC_003a-Binaries"></a>
! 
! <p>We are often asked about pre-compiled versions of GCC.  While we cannot
! provide these for all platforms, below you&rsquo;ll find links to binaries for
  various platforms where creating them by yourself is not easy due to various
  reasons.
! </p>
! <p>Please note that we did not create these binaries, nor do we
  support them.  If you have any problems installing them, please
  contact their makers.
+ </p>
+ <ul>
+ <li> AIX:
+ <ul>
+ <li> <a href="http://www.bullfreeware.com">Bull&rsquo;s Freeware and Shareware Archive for AIX</a>;
  
! </li><li> <a href="http://pware.hvcc.edu">Hudson Valley Community College Open Source Software for IBM System p</a>;
  
! </li><li> <a href="http://www.perzl.org/aix/">AIX 5L and 6 Open Source Packages</a>.
! </li></ul>
  
! </li><li> DOS&mdash;<a href="http://www.delorie.com/djgpp/">DJGPP</a>.
  
! </li><li> Renesas H8/300[HS]&mdash;<a href="http://h8300-hms.sourceforge.net/">GNU
! Development Tools for the Renesas H8/300[HS] Series</a>.
  
! </li><li> HP-UX:
! <ul>
! <li> <a href="http://hpux.connect.org.uk/">HP-UX Porting Center</a>;
  
! </li><li> <a href="ftp://sunsite.informatik.rwth-aachen.de/pub/packages/gcc_hpux/">Binaries for HP-UX 11.00 at Aachen University of Technology</a>.
! </li></ul>
  
! </li><li> <a href="http://www.sco.com/skunkware/devtools/index.html#gcc">SCO
! OpenServer/Unixware</a>.
  
! </li><li> Solaris 2 (SPARC, Intel):
! <ul>
! <li> <a href="http://www.opencsw.org/">OpenCSW</a>
  
! </li><li> <a href="http://jupiterrise.com/tgcware/">TGCware</a>
! </li></ul>
  
! </li><li> Microsoft Windows:
! <ul>
! <li> The <a href="http://sourceware.org/cygwin/">Cygwin</a> project;
! </li><li> The <a href="http://www.mingw.org/">MinGW</a> project.
! </li></ul>
  
! </li><li> <a href="ftp://ftp.thewrittenword.com/packages/by-name/">The
! Written Word</a> offers binaries for
  AIX 4.3.3, 5.1 and 5.2,
  GNU/Linux (i386),
  HP-UX 10.20, 11.00, and 11.11, and
  Solaris/SPARC 2.5.1, 2.6, 7, 8, 9 and 10.
  
! </li><li> <a href="http://www.openpkg.org/">OpenPKG</a> offers binaries for quite a
  number of platforms.
  
! </li><li> The <a href="http://gcc.gnu.org/wiki/GFortranBinaries">GFortran Wiki</a> has
! links to GNU Fortran binaries for several platforms.
! </li></ul>
  
! <hr />
! <p>
  <p><a href="./index.html">Return to the GCC Installation page</a>
+ </p>
+ 
  
  
+ 
+ 
+ 
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/build.html gcc-5.5.0/INSTALL/build.html
*** gcc-5.4.0/INSTALL/build.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/build.html	Tue Oct 10 08:13:24 2017
***************
*** 1,385 ****
! <html lang="en">
! <head>
! <title>Installing GCC: Building</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Installing GCC: Building">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
- <body>
- <h1 class="settitle">Installing GCC: Building</h1>
- <a name="index-Installing-GCC_003a-Building-1"></a>
- Now that GCC is configured, you are ready to build the compiler and
- runtime libraries.
  
!    <p>Some commands executed when making the compiler may fail (return a
! nonzero status) and be ignored by <samp><span class="command">make</span></samp>.  These failures, which
  are often due to files that were not found, are expected, and can safely
  be ignored.
! 
!    <p>It is normal to have compiler warnings when compiling certain files. 
  Unless you are a GCC developer, you can generally ignore these warnings
  unless they cause compilation to fail.  Developers should attempt to fix
  any warnings encountered, however they can temporarily continue past
  warnings-as-errors by specifying the configure flag
! <samp><span class="option">--disable-werror</span></samp>.
! 
!    <p>On certain old systems, defining certain environment variables such as
! <samp><span class="env">CC</span></samp> can interfere with the functioning of <samp><span class="command">make</span></samp>.
! 
!    <p>If you encounter seemingly strange errors when trying to build the
  compiler in a directory other than the source directory, it could be
  because you have previously configured the compiler in the source
  directory.  Make sure you have done all the necessary preparations.
! 
!    <p>If you build GCC on a BSD system using a directory stored in an old System
! V file system, problems may occur in running <samp><span class="command">fixincludes</span></samp> if the
! System V file system doesn't support symbolic links.  These problems
  result in a failure to fix the declaration of <code>size_t</code> in
! <samp><span class="file">sys/types.h</span></samp>.  If you find that <code>size_t</code> is a signed type and
  that type mismatches occur, this could be the cause.
! 
!    <p>The solution is not to use such a directory for building GCC.
! 
!    <p>Similarly, when building from SVN or snapshots, or if you modify
! <samp><span class="file">*.l</span></samp> files, you need the Flex lexical analyzer generator
! installed.  If you do not modify <samp><span class="file">*.l</span></samp> files, releases contain
  the Flex-generated files and you do not need Flex installed to build
  them.  There is still one Flex-based lexical analyzer (part of the
  build machinery, not of GCC itself) that is used even if you only
  build the C front end.
! 
!    <p>When building from SVN or snapshots, or if you modify Texinfo
  documentation, you need version 4.7 or later of Texinfo installed if you
  want Info documentation to be regenerated.  Releases contain Info
  documentation pre-built for the unmodified documentation in the release.
! 
! <h3 class="section"><a name="TOC0"></a>Building a native compiler</h3>
  
  <p>For a native build, the default configuration is to perform
! a 3-stage bootstrap of the compiler when &lsquo;<samp><span class="samp">make</span></samp>&rsquo; is invoked. 
  This will build the entire GCC system and ensure that it compiles
! itself correctly.  It can be disabled with the <samp><span class="option">--disable-bootstrap</span></samp>
! parameter to &lsquo;<samp><span class="samp">configure</span></samp>&rsquo;, but bootstrapping is suggested because
  the compiler will be tested more completely and could also have
  better performance.
  
!    <p>The bootstrapping process will complete the following steps:
! 
!      <ul>
! <li>Build tools necessary to build the compiler.
! 
!      <li>Perform a 3-stage bootstrap of the compiler.  This includes building
  three times the target tools for use by the compiler such as binutils
  (bfd, binutils, gas, gprof, ld, and opcodes) if they have been
  individually linked or moved into the top level GCC source tree before
  configuring.
  
!      <li>Perform a comparison test of the stage2 and stage3 compilers.
  
!      <li>Build runtime libraries using the stage3 compiler from the previous step.
  
!    </ul>
  
!    <p>If you are short on disk space you might consider &lsquo;<samp><span class="samp">make
! bootstrap-lean</span></samp>&rsquo; instead.  The sequence of compilation is the
  same described above, but object files from the stage1 and
  stage2 of the 3-stage bootstrap of the compiler are deleted as
  soon as they are no longer needed.
! 
!    <p>If you wish to use non-default GCC flags when compiling the stage2
  and stage3 compilers, set <code>BOOT_CFLAGS</code> on the command line when
! doing &lsquo;<samp><span class="samp">make</span></samp>&rsquo;.  For example, if you want to save additional space
  during the bootstrap and in the final installation as well, you can
  build the compiler binaries without debugging information as in the
  following example.  This will save roughly 40% of disk space both for
  the bootstrap and the final installation.  (Libraries will still contain
  debugging information.)
  
! <pre class="smallexample">     make BOOT_CFLAGS='-O' bootstrap
! </pre>
!    <p>You can place non-default optimization flags into <code>BOOT_CFLAGS</code>; they
! are less well tested here than the default of &lsquo;<samp><span class="samp">-g -O2</span></samp>&rsquo;, but should
  still work.  In a few cases, you may find that you need to specify special
! flags such as <samp><span class="option">-msoft-float</span></samp> here to complete the bootstrap; or,
  if the native compiler miscompiles the stage1 compiler, you may need
  to work around this, by choosing <code>BOOT_CFLAGS</code> to avoid the parts
! of the stage1 compiler that were miscompiled, or by using &lsquo;<samp><span class="samp">make
! bootstrap4</span></samp>&rsquo; to increase the number of stages of bootstrap.
! 
!    <p><code>BOOT_CFLAGS</code> does not apply to bootstrapped target libraries. 
  Since these are always compiled with the compiler currently being
  bootstrapped, you can use <code>CFLAGS_FOR_TARGET</code> to modify their
! compilation flags, as for non-bootstrapped target libraries. 
  Again, if the native compiler miscompiles the stage1 compiler, you may
  need to work around this by avoiding non-working parts of the stage1
  compiler.  Use <code>STAGE1_TFLAGS</code> to this end.
! 
!    <p>If you used the flag <samp><span class="option">--enable-languages=...</span></samp> to restrict
! the compilers to be built, only those you've actually enabled will be
  built.  This will of course only build those runtime libraries, for
  which the particular compiler has been built.  Please note,
! that re-defining <samp><span class="env">LANGUAGES</span></samp> when calling &lsquo;<samp><span class="samp">make</span></samp>&rsquo;
  <strong>does not</strong> work anymore!
! 
!    <p>If the comparison of stage2 and stage3 fails, this normally indicates
  that the stage2 compiler has compiled GCC incorrectly, and is therefore
  a potentially serious bug which you should investigate and report.  (On
  a few systems, meaningful comparison of object files is impossible; they
  always appear &ldquo;different&rdquo;.  If you encounter this problem, you will
! need to disable comparison in the <samp><span class="file">Makefile</span></samp>.)
! 
!    <p>If you do not want to bootstrap your compiler, you can configure with
! <samp><span class="option">--disable-bootstrap</span></samp>.  In particular cases, you may want to
  bootstrap your compiler even if the target system is not the same as
  the one you are building on: for example, you could build a
  <code>powerpc-unknown-linux-gnu</code> toolchain on a
  <code>powerpc64-unknown-linux-gnu</code> host.  In this case, pass
! <samp><span class="option">--enable-bootstrap</span></samp> to the configure script.
! 
!    <p><code>BUILD_CONFIG</code> can be used to bring in additional customization
! to the build.  It can be set to a whitespace-separated list of names. 
! For each such <code>NAME</code>, top-level <samp><span class="file">config/</span><code>NAME</code><span class="file">.mk</span></samp> will
! be included by the top-level <samp><span class="file">Makefile</span></samp>, bringing in any settings
  it contains.  The default <code>BUILD_CONFIG</code> can be set using the
! configure option <samp><span class="option">--with-build-config=</span><code>NAME</code><span class="option">...</span></samp>.  Some
  examples of supported build configurations are:
! 
!      <dl>
! <dt>&lsquo;<samp><span class="samp">bootstrap-O1</span></samp>&rsquo;<dd>Removes any <samp><span class="option">-O</span></samp>-started option from <code>BOOT_CFLAGS</code>, and adds
! <samp><span class="option">-O1</span></samp> to it.  &lsquo;<samp><span class="samp">BUILD_CONFIG=bootstrap-O1</span></samp>&rsquo; is equivalent to
! &lsquo;<samp><span class="samp">BOOT_CFLAGS='-g -O1'</span></samp>&rsquo;.
! 
!      <br><dt>&lsquo;<samp><span class="samp">bootstrap-O3</span></samp>&rsquo;<dd>Analogous to <code>bootstrap-O1</code>.
! 
!      <br><dt>&lsquo;<samp><span class="samp">bootstrap-lto</span></samp>&rsquo;<dd>Enables Link-Time Optimization for host tools during bootstrapping. 
! &lsquo;<samp><span class="samp">BUILD_CONFIG=bootstrap-lto</span></samp>&rsquo; is equivalent to adding
! <samp><span class="option">-flto</span></samp> to &lsquo;<samp><span class="samp">BOOT_CFLAGS</span></samp>&rsquo;.  This option assumes that the host
  supports the linker plugin (e.g. GNU ld version 2.21 or later or GNU gold
  version 2.21 or later).
! 
!      <br><dt>&lsquo;<samp><span class="samp">bootstrap-lto-noplugin</span></samp>&rsquo;<dd>This option is similar to <code>bootstrap-lto</code>, but is intended for
! hosts that do not support the linker plugin.  Without the linker plugin
! static libraries are not compiled with link-time optimizations.  Since
! the GCC middle end and back end are in <samp><span class="file">libbackend.a</span></samp> this means
  that only the front end is actually LTO optimized.
! 
!      <br><dt>&lsquo;<samp><span class="samp">bootstrap-debug</span></samp>&rsquo;<dd>Verifies that the compiler generates the same executable code, whether
  or not it is asked to emit debug information.  To this end, this
  option builds stage2 host programs without debug information, and uses
! <samp><span class="file">contrib/compare-debug</span></samp> to compare them with the stripped stage3
  object files.  If <code>BOOT_CFLAGS</code> is overridden so as to not enable
! debug information, stage2 will have it, and stage3 won't.  This option
  is enabled by default when GCC bootstrapping is enabled, if
  <code>strip</code> can turn object files compiled with and without debug
  info into identical object files.  In addition to better test
  coverage, this option makes default bootstraps faster and leaner.
! 
!      <br><dt>&lsquo;<samp><span class="samp">bootstrap-debug-big</span></samp>&rsquo;<dd>Rather than comparing stripped object files, as in
  <code>bootstrap-debug</code>, this option saves internal compiler dumps
  during stage2 and stage3 and compares them as well, which helps catch
  additional potential problems, but at a great cost in terms of disk
! space.  It can be specified in addition to &lsquo;<samp><span class="samp">bootstrap-debug</span></samp>&rsquo;.
! 
!      <br><dt>&lsquo;<samp><span class="samp">bootstrap-debug-lean</span></samp>&rsquo;<dd>This option saves disk space compared with <code>bootstrap-debug-big</code>,
  but at the expense of some recompilation.  Instead of saving the dumps
  of stage2 and stage3 until the final compare, it uses
! <samp><span class="option">-fcompare-debug</span></samp> to generate, compare and remove the dumps
  during stage3, repeating the compilation that already took place in
  stage2, whose dumps were not saved.
! 
!      <br><dt>&lsquo;<samp><span class="samp">bootstrap-debug-lib</span></samp>&rsquo;<dd>This option tests executable code invariance over debug information
  generation on target libraries, just like <code>bootstrap-debug-lean</code>
  tests it on host programs.  It builds stage3 libraries with
! <samp><span class="option">-fcompare-debug</span></samp>, and it can be used along with any of the
  <code>bootstrap-debug</code> options above.
! 
!      <p>There aren't <code>-lean</code> or <code>-big</code> counterparts to this option
  because most libraries are only build in stage3, so bootstrap compares
  would not get significant coverage.  Moreover, the few libraries built
! in stage2 are used in stage3 host programs, so we wouldn't want to
  compile stage2 libraries with different options for comparison purposes.
! 
!      <br><dt>&lsquo;<samp><span class="samp">bootstrap-debug-ckovw</span></samp>&rsquo;<dd>Arranges for error messages to be issued if the compiler built on any
! stage is run without the option <samp><span class="option">-fcompare-debug</span></samp>.  This is
! useful to verify the full <samp><span class="option">-fcompare-debug</span></samp> testing coverage.  It
  must be used along with <code>bootstrap-debug-lean</code> and
  <code>bootstrap-debug-lib</code>.
! 
!      <br><dt>&lsquo;<samp><span class="samp">bootstrap-time</span></samp>&rsquo;<dd>Arranges for the run time of each program started by the GCC driver,
! built in any stage, to be logged to <samp><span class="file">time.log</span></samp>, in the top level of
  the build tree.
  
!    </dl>
! 
! <h3 class="section"><a name="TOC1"></a>Building a cross compiler</h3>
  
  <p>When building a cross compiler, it is not generally possible to do a
  3-stage bootstrap of the compiler.  This makes for an interesting problem
  as parts of GCC can only be built with GCC.
! 
!    <p>To build a cross compiler, we recommend first building and installing a
  native compiler.  You can then use the native GCC compiler to build the
  cross compiler.  The installed native compiler needs to be GCC version
  2.95 or later.
! 
!    <p>If the cross compiler is to be built with support for the Java
  programming language and the ability to compile .java source files is
  desired, the installed native compiler used to build the cross
  compiler needs to be the same GCC version as the cross compiler.  In
  addition the cross compiler needs to be configured with
! <samp><span class="option">--with-ecj-jar=...</span></samp>.
! 
!    <p>Assuming you have already installed a native copy of GCC and configured
! your cross compiler, issue the command <samp><span class="command">make</span></samp>, which performs the
  following steps:
  
!      <ul>
! <li>Build host tools necessary to build the compiler.
! 
!      <li>Build target tools for use by the compiler such as binutils (bfd,
  binutils, gas, gprof, ld, and opcodes)
  if they have been individually linked or moved into the top level GCC source
  tree before configuring.
  
!      <li>Build the compiler (single stage only).
! 
!      <li>Build runtime libraries using the compiler from the previous step. 
! </ul>
  
!    <p>Note that if an error occurs in any step the make process will exit.
  
!    <p>If you are not building GNU binutils in the same source tree as GCC,
  you will need a cross-assembler and cross-linker installed before
  configuring GCC.  Put them in the directory
! <samp><var>prefix</var><span class="file">/</span><var>target</var><span class="file">/bin</span></samp>.  Here is a table of the tools
  you should put in this directory:
! 
!      <dl>
! <dt><samp><span class="file">as</span></samp><dd>This should be the cross-assembler.
! 
!      <br><dt><samp><span class="file">ld</span></samp><dd>This should be the cross-linker.
! 
!      <br><dt><samp><span class="file">ar</span></samp><dd>This should be the cross-archiver: a program which can manipulate
! archive files (linker libraries) in the target machine's format.
! 
!      <br><dt><samp><span class="file">ranlib</span></samp><dd>This should be a program to construct a symbol table in an archive file. 
  </dl>
  
!    <p>The installation of GCC will find these programs in that directory,
  and copy or link them to the proper place to for the cross-compiler to
  find them when run later.
! 
!    <p>The easiest way to provide these files is to build the Binutils package. 
! Configure it with the same <samp><span class="option">--host</span></samp> and <samp><span class="option">--target</span></samp>
  options that you use for configuring GCC, then build and install
  them.  They install their executables automatically into the proper
  directory.  Alas, they do not support all the targets that GCC
  supports.
! 
!    <p>If you are not building a C library in the same source tree as GCC,
  you should also provide the target libraries and headers before
  configuring GCC, specifying the directories with
! <samp><span class="option">--with-sysroot</span></samp> or <samp><span class="option">--with-headers</span></samp> and
! <samp><span class="option">--with-libs</span></samp>.  Many targets also require &ldquo;start files&rdquo; such
! as <samp><span class="file">crt0.o</span></samp> and
! <samp><span class="file">crtn.o</span></samp> which are linked into each executable.  There may be several
! alternatives for <samp><span class="file">crt0.o</span></samp>, for use with profiling or other
! compilation options.  Check your target's definition of
  <code>STARTFILE_SPEC</code> to find out what start files it uses.
! 
! <h3 class="section"><a name="TOC2"></a>Building in parallel</h3>
  
  <p>GNU Make 3.80 and above, which is necessary to build GCC, support
! building in parallel.  To activate this, you can use &lsquo;<samp><span class="samp">make -j 2</span></samp>&rsquo;
! instead of &lsquo;<samp><span class="samp">make</span></samp>&rsquo;.  You can also specify a bigger number, and
  in most cases using a value greater than the number of processors in
  your machine will result in fewer and shorter I/O latency hits, thus
  improving overall throughput; this is especially true for slow drives
  and network filesystems.
! 
! <h3 class="section"><a name="TOC3"></a>Building the Ada compiler</h3>
  
  <p>In order to build GNAT, the Ada compiler, you need a working GNAT
! compiler (GCC version 4.0 or later). 
! This includes GNAT tools such as <samp><span class="command">gnatmake</span></samp> and
! <samp><span class="command">gnatlink</span></samp>, since the Ada front end is written in Ada and
  uses some GNAT-specific extensions.
! 
!    <p>In order to build a cross compiler, it is suggested to install
  the new compiler as native first, and then use it to build the cross
  compiler.
! 
!    <p><samp><span class="command">configure</span></samp> does not test whether the GNAT installation works
  and has a sufficiently recent version; if too old a GNAT version is
! installed, the build will fail unless <samp><span class="option">--enable-languages</span></samp> is
  used to disable building the Ada front end.
! 
!    <p><samp><span class="env">ADA_INCLUDE_PATH</span></samp> and <samp><span class="env">ADA_OBJECT_PATH</span></samp> environment variables
  must not be set when building the Ada compiler, the Ada tools, or the
  Ada runtime libraries. You can check that your build environment is clean
! by verifying that &lsquo;<samp><span class="samp">gnatls -v</span></samp>&rsquo; lists only one explicit path in each
  section.
! 
! <h3 class="section"><a name="TOC4"></a>Building with profile feedback</h3>
  
  <p>It is possible to use profile feedback to optimize the compiler itself.  This
  should result in a faster compiler binary.  Experiments done on x86 using gcc
  3.3 showed approximately 7 percent speedup on compiling C programs.  To
  bootstrap the compiler with profile feedback, use <code>make profiledbootstrap</code>.
! 
!    <p>When &lsquo;<samp><span class="samp">make profiledbootstrap</span></samp>&rsquo; is run, it will first build a <code>stage1</code>
  compiler.  This compiler is used to build a <code>stageprofile</code> compiler
  instrumented to collect execution counts of instruction and branch
! probabilities.  Then runtime libraries are compiled with profile collected. 
  Finally a <code>stagefeedback</code> compiler is built using the information collected.
! 
!    <p>Unlike standard bootstrap, several additional restrictions apply.  The
! compiler used to build <code>stage1</code> needs to support a 64-bit integral type. 
  It is recommended to only use GCC for this.
! 
!    <p><hr />
  <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- ***Testing***************************************************************** -->
- <!-- ***Final install*********************************************************** -->
- <!-- ***Binaries**************************************************************** -->
- <!-- ***Specific**************************************************************** -->
- <!-- ***Old documentation****************************************************** -->
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 1,467 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
  
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <a name="index-Installing-GCC_003a-Building"></a>
! 
! <p>Now that GCC is configured, you are ready to build the compiler and
! runtime libraries.
! </p>
! <p>Some commands executed when making the compiler may fail (return a
! nonzero status) and be ignored by <code>make</code>.  These failures, which
  are often due to files that were not found, are expected, and can safely
  be ignored.
! </p>
! <p>It is normal to have compiler warnings when compiling certain files.
  Unless you are a GCC developer, you can generally ignore these warnings
  unless they cause compilation to fail.  Developers should attempt to fix
  any warnings encountered, however they can temporarily continue past
  warnings-as-errors by specifying the configure flag
! <samp>--disable-werror</samp>.
! </p>
! <p>On certain old systems, defining certain environment variables such as
! <code>CC</code> can interfere with the functioning of <code>make</code>.
! </p>
! <p>If you encounter seemingly strange errors when trying to build the
  compiler in a directory other than the source directory, it could be
  because you have previously configured the compiler in the source
  directory.  Make sure you have done all the necessary preparations.
! </p>
! <p>If you build GCC on a BSD system using a directory stored in an old System
! V file system, problems may occur in running <code>fixincludes</code> if the
! System V file system doesn&rsquo;t support symbolic links.  These problems
  result in a failure to fix the declaration of <code>size_t</code> in
! <samp>sys/types.h</samp>.  If you find that <code>size_t</code> is a signed type and
  that type mismatches occur, this could be the cause.
! </p>
! <p>The solution is not to use such a directory for building GCC.
! </p>
! <p>Similarly, when building from SVN or snapshots, or if you modify
! <samp>*.l</samp> files, you need the Flex lexical analyzer generator
! installed.  If you do not modify <samp>*.l</samp> files, releases contain
  the Flex-generated files and you do not need Flex installed to build
  them.  There is still one Flex-based lexical analyzer (part of the
  build machinery, not of GCC itself) that is used even if you only
  build the C front end.
! </p>
! <p>When building from SVN or snapshots, or if you modify Texinfo
  documentation, you need version 4.7 or later of Texinfo installed if you
  want Info documentation to be regenerated.  Releases contain Info
  documentation pre-built for the unmodified documentation in the release.
! </p>
! <a name="Building-a-native-compiler"></a>
! <h3 class="section">Building a native compiler</h3>
  
  <p>For a native build, the default configuration is to perform
! a 3-stage bootstrap of the compiler when &lsquo;<samp>make</samp>&rsquo; is invoked.
  This will build the entire GCC system and ensure that it compiles
! itself correctly.  It can be disabled with the <samp>--disable-bootstrap</samp>
! parameter to &lsquo;<samp>configure</samp>&rsquo;, but bootstrapping is suggested because
  the compiler will be tested more completely and could also have
  better performance.
+ </p>
+ <p>The bootstrapping process will complete the following steps:
+ </p>
+ <ul>
+ <li> Build tools necessary to build the compiler.
  
! </li><li> Perform a 3-stage bootstrap of the compiler.  This includes building
  three times the target tools for use by the compiler such as binutils
  (bfd, binutils, gas, gprof, ld, and opcodes) if they have been
  individually linked or moved into the top level GCC source tree before
  configuring.
  
! </li><li> Perform a comparison test of the stage2 and stage3 compilers.
  
! </li><li> Build runtime libraries using the stage3 compiler from the previous step.
  
! </li></ul>
  
! <p>If you are short on disk space you might consider &lsquo;<samp>make
! bootstrap-lean</samp>&rsquo; instead.  The sequence of compilation is the
  same described above, but object files from the stage1 and
  stage2 of the 3-stage bootstrap of the compiler are deleted as
  soon as they are no longer needed.
! </p>
! <p>If you wish to use non-default GCC flags when compiling the stage2
  and stage3 compilers, set <code>BOOT_CFLAGS</code> on the command line when
! doing &lsquo;<samp>make</samp>&rsquo;.  For example, if you want to save additional space
  during the bootstrap and in the final installation as well, you can
  build the compiler binaries without debugging information as in the
  following example.  This will save roughly 40% of disk space both for
  the bootstrap and the final installation.  (Libraries will still contain
  debugging information.)
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">make BOOT_CFLAGS='-O' bootstrap
+ </pre></div>
  
! <p>You can place non-default optimization flags into <code>BOOT_CFLAGS</code>; they
! are less well tested here than the default of &lsquo;<samp>-g -O2</samp>&rsquo;, but should
  still work.  In a few cases, you may find that you need to specify special
! flags such as <samp>-msoft-float</samp> here to complete the bootstrap; or,
  if the native compiler miscompiles the stage1 compiler, you may need
  to work around this, by choosing <code>BOOT_CFLAGS</code> to avoid the parts
! of the stage1 compiler that were miscompiled, or by using &lsquo;<samp>make
! bootstrap4</samp>&rsquo; to increase the number of stages of bootstrap.
! </p>
! <p><code>BOOT_CFLAGS</code> does not apply to bootstrapped target libraries.
  Since these are always compiled with the compiler currently being
  bootstrapped, you can use <code>CFLAGS_FOR_TARGET</code> to modify their
! compilation flags, as for non-bootstrapped target libraries.
  Again, if the native compiler miscompiles the stage1 compiler, you may
  need to work around this by avoiding non-working parts of the stage1
  compiler.  Use <code>STAGE1_TFLAGS</code> to this end.
! </p>
! <p>If you used the flag <samp>--enable-languages=&hellip;</samp> to restrict
! the compilers to be built, only those you&rsquo;ve actually enabled will be
  built.  This will of course only build those runtime libraries, for
  which the particular compiler has been built.  Please note,
! that re-defining <code>LANGUAGES</code> when calling &lsquo;<samp>make</samp>&rsquo;
  <strong>does not</strong> work anymore!
! </p>
! <p>If the comparison of stage2 and stage3 fails, this normally indicates
  that the stage2 compiler has compiled GCC incorrectly, and is therefore
  a potentially serious bug which you should investigate and report.  (On
  a few systems, meaningful comparison of object files is impossible; they
  always appear &ldquo;different&rdquo;.  If you encounter this problem, you will
! need to disable comparison in the <samp>Makefile</samp>.)
! </p>
! <p>If you do not want to bootstrap your compiler, you can configure with
! <samp>--disable-bootstrap</samp>.  In particular cases, you may want to
  bootstrap your compiler even if the target system is not the same as
  the one you are building on: for example, you could build a
  <code>powerpc-unknown-linux-gnu</code> toolchain on a
  <code>powerpc64-unknown-linux-gnu</code> host.  In this case, pass
! <samp>--enable-bootstrap</samp> to the configure script.
! </p>
! <p><code>BUILD_CONFIG</code> can be used to bring in additional customization
! to the build.  It can be set to a whitespace-separated list of names.
! For each such <code>NAME</code>, top-level <samp>config/<code>NAME</code>.mk</samp> will
! be included by the top-level <samp>Makefile</samp>, bringing in any settings
  it contains.  The default <code>BUILD_CONFIG</code> can be set using the
! configure option <samp>--with-build-config=<code>NAME</code>...</samp>.  Some
  examples of supported build configurations are:
! </p>
! <dl compact="compact">
! <dt>&lsquo;<samp>bootstrap-O1</samp>&rsquo;</dt>
! <dd><p>Removes any <samp>-O</samp>-started option from <code>BOOT_CFLAGS</code>, and adds
! <samp>-O1</samp> to it.  &lsquo;<samp>BUILD_CONFIG=bootstrap-O1</samp>&rsquo; is equivalent to
! &lsquo;<samp>BOOT_CFLAGS='-g -O1'</samp>&rsquo;.
! </p>
! </dd>
! <dt>&lsquo;<samp>bootstrap-O3</samp>&rsquo;</dt>
! <dd><p>Analogous to <code>bootstrap-O1</code>.
! </p>
! </dd>
! <dt>&lsquo;<samp>bootstrap-lto</samp>&rsquo;</dt>
! <dd><p>Enables Link-Time Optimization for host tools during bootstrapping.
! &lsquo;<samp>BUILD_CONFIG=bootstrap-lto</samp>&rsquo; is equivalent to adding
! <samp>-flto</samp> to &lsquo;<samp>BOOT_CFLAGS</samp>&rsquo;.  This option assumes that the host
  supports the linker plugin (e.g. GNU ld version 2.21 or later or GNU gold
  version 2.21 or later).
! </p>
! </dd>
! <dt>&lsquo;<samp>bootstrap-lto-noplugin</samp>&rsquo;</dt>
! <dd><p>This option is similar to <code>bootstrap-lto</code>, but is intended for
! hosts that do not support the linker plugin.  Without the linker plugin 
! static libraries are not compiled with link-time optimizations.  Since 
! the GCC middle end and back end are in <samp>libbackend.a</samp> this means
  that only the front end is actually LTO optimized.
! </p>
! </dd>
! <dt>&lsquo;<samp>bootstrap-debug</samp>&rsquo;</dt>
! <dd><p>Verifies that the compiler generates the same executable code, whether
  or not it is asked to emit debug information.  To this end, this
  option builds stage2 host programs without debug information, and uses
! <samp>contrib/compare-debug</samp> to compare them with the stripped stage3
  object files.  If <code>BOOT_CFLAGS</code> is overridden so as to not enable
! debug information, stage2 will have it, and stage3 won&rsquo;t.  This option
  is enabled by default when GCC bootstrapping is enabled, if
  <code>strip</code> can turn object files compiled with and without debug
  info into identical object files.  In addition to better test
  coverage, this option makes default bootstraps faster and leaner.
! </p>
! </dd>
! <dt>&lsquo;<samp>bootstrap-debug-big</samp>&rsquo;</dt>
! <dd><p>Rather than comparing stripped object files, as in
  <code>bootstrap-debug</code>, this option saves internal compiler dumps
  during stage2 and stage3 and compares them as well, which helps catch
  additional potential problems, but at a great cost in terms of disk
! space.  It can be specified in addition to &lsquo;<samp>bootstrap-debug</samp>&rsquo;.
! </p>
! </dd>
! <dt>&lsquo;<samp>bootstrap-debug-lean</samp>&rsquo;</dt>
! <dd><p>This option saves disk space compared with <code>bootstrap-debug-big</code>,
  but at the expense of some recompilation.  Instead of saving the dumps
  of stage2 and stage3 until the final compare, it uses
! <samp>-fcompare-debug</samp> to generate, compare and remove the dumps
  during stage3, repeating the compilation that already took place in
  stage2, whose dumps were not saved.
! </p>
! </dd>
! <dt>&lsquo;<samp>bootstrap-debug-lib</samp>&rsquo;</dt>
! <dd><p>This option tests executable code invariance over debug information
  generation on target libraries, just like <code>bootstrap-debug-lean</code>
  tests it on host programs.  It builds stage3 libraries with
! <samp>-fcompare-debug</samp>, and it can be used along with any of the
  <code>bootstrap-debug</code> options above.
! </p>
! <p>There aren&rsquo;t <code>-lean</code> or <code>-big</code> counterparts to this option
  because most libraries are only build in stage3, so bootstrap compares
  would not get significant coverage.  Moreover, the few libraries built
! in stage2 are used in stage3 host programs, so we wouldn&rsquo;t want to
  compile stage2 libraries with different options for comparison purposes.
! </p>
! </dd>
! <dt>&lsquo;<samp>bootstrap-debug-ckovw</samp>&rsquo;</dt>
! <dd><p>Arranges for error messages to be issued if the compiler built on any
! stage is run without the option <samp>-fcompare-debug</samp>.  This is
! useful to verify the full <samp>-fcompare-debug</samp> testing coverage.  It
  must be used along with <code>bootstrap-debug-lean</code> and
  <code>bootstrap-debug-lib</code>.
! </p>
! </dd>
! <dt>&lsquo;<samp>bootstrap-time</samp>&rsquo;</dt>
! <dd><p>Arranges for the run time of each program started by the GCC driver,
! built in any stage, to be logged to <samp>time.log</samp>, in the top level of
  the build tree.
+ </p>
+ </dd>
+ </dl>
  
! <a name="Building-a-cross-compiler"></a>
! <h3 class="section">Building a cross compiler</h3>
  
  <p>When building a cross compiler, it is not generally possible to do a
  3-stage bootstrap of the compiler.  This makes for an interesting problem
  as parts of GCC can only be built with GCC.
! </p>
! <p>To build a cross compiler, we recommend first building and installing a
  native compiler.  You can then use the native GCC compiler to build the
  cross compiler.  The installed native compiler needs to be GCC version
  2.95 or later.
! </p>
! <p>If the cross compiler is to be built with support for the Java
  programming language and the ability to compile .java source files is
  desired, the installed native compiler used to build the cross
  compiler needs to be the same GCC version as the cross compiler.  In
  addition the cross compiler needs to be configured with
! <samp>--with-ecj-jar=&hellip;</samp>.
! </p>
! <p>Assuming you have already installed a native copy of GCC and configured
! your cross compiler, issue the command <code>make</code>, which performs the
  following steps:
+ </p>
+ <ul>
+ <li> Build host tools necessary to build the compiler.
  
! </li><li> Build target tools for use by the compiler such as binutils (bfd,
  binutils, gas, gprof, ld, and opcodes)
  if they have been individually linked or moved into the top level GCC source
  tree before configuring.
  
! </li><li> Build the compiler (single stage only).
  
! </li><li> Build runtime libraries using the compiler from the previous step.
! </li></ul>
  
! <p>Note that if an error occurs in any step the make process will exit.
! </p>
! <p>If you are not building GNU binutils in the same source tree as GCC,
  you will need a cross-assembler and cross-linker installed before
  configuring GCC.  Put them in the directory
! <samp><var>prefix</var>/<var>target</var>/bin</samp>.  Here is a table of the tools
  you should put in this directory:
! </p>
! <dl compact="compact">
! <dt><samp>as</samp></dt>
! <dd><p>This should be the cross-assembler.
! </p>
! </dd>
! <dt><samp>ld</samp></dt>
! <dd><p>This should be the cross-linker.
! </p>
! </dd>
! <dt><samp>ar</samp></dt>
! <dd><p>This should be the cross-archiver: a program which can manipulate
! archive files (linker libraries) in the target machine&rsquo;s format.
! </p>
! </dd>
! <dt><samp>ranlib</samp></dt>
! <dd><p>This should be a program to construct a symbol table in an archive file.
! </p></dd>
  </dl>
  
! <p>The installation of GCC will find these programs in that directory,
  and copy or link them to the proper place to for the cross-compiler to
  find them when run later.
! </p>
! <p>The easiest way to provide these files is to build the Binutils package.
! Configure it with the same <samp>--host</samp> and <samp>--target</samp>
  options that you use for configuring GCC, then build and install
  them.  They install their executables automatically into the proper
  directory.  Alas, they do not support all the targets that GCC
  supports.
! </p>
! <p>If you are not building a C library in the same source tree as GCC,
  you should also provide the target libraries and headers before
  configuring GCC, specifying the directories with
! <samp>--with-sysroot</samp> or <samp>--with-headers</samp> and
! <samp>--with-libs</samp>.  Many targets also require &ldquo;start files&rdquo; such
! as <samp>crt0.o</samp> and
! <samp>crtn.o</samp> which are linked into each executable.  There may be several
! alternatives for <samp>crt0.o</samp>, for use with profiling or other
! compilation options.  Check your target&rsquo;s definition of
  <code>STARTFILE_SPEC</code> to find out what start files it uses.
! </p>
! <a name="Building-in-parallel"></a>
! <h3 class="section">Building in parallel</h3>
  
  <p>GNU Make 3.80 and above, which is necessary to build GCC, support
! building in parallel.  To activate this, you can use &lsquo;<samp>make -j 2</samp>&rsquo;
! instead of &lsquo;<samp>make</samp>&rsquo;.  You can also specify a bigger number, and
  in most cases using a value greater than the number of processors in
  your machine will result in fewer and shorter I/O latency hits, thus
  improving overall throughput; this is especially true for slow drives
  and network filesystems.
! </p>
! <a name="Building-the-Ada-compiler"></a>
! <h3 class="section">Building the Ada compiler</h3>
  
  <p>In order to build GNAT, the Ada compiler, you need a working GNAT
! compiler (GCC version 4.0 or later).
! This includes GNAT tools such as <code>gnatmake</code> and
! <code>gnatlink</code>, since the Ada front end is written in Ada and
  uses some GNAT-specific extensions.
! </p>
! <p>In order to build a cross compiler, it is suggested to install
  the new compiler as native first, and then use it to build the cross
  compiler.
! </p>
! <p><code>configure</code> does not test whether the GNAT installation works
  and has a sufficiently recent version; if too old a GNAT version is
! installed, the build will fail unless <samp>--enable-languages</samp> is
  used to disable building the Ada front end.
! </p>
! <p><code>ADA_INCLUDE_PATH</code> and <code>ADA_OBJECT_PATH</code> environment variables
  must not be set when building the Ada compiler, the Ada tools, or the
  Ada runtime libraries. You can check that your build environment is clean
! by verifying that &lsquo;<samp>gnatls -v</samp>&rsquo; lists only one explicit path in each
  section.
! </p>
! <a name="Building-with-profile-feedback"></a>
! <h3 class="section">Building with profile feedback</h3>
  
  <p>It is possible to use profile feedback to optimize the compiler itself.  This
  should result in a faster compiler binary.  Experiments done on x86 using gcc
  3.3 showed approximately 7 percent speedup on compiling C programs.  To
  bootstrap the compiler with profile feedback, use <code>make profiledbootstrap</code>.
! </p>
! <p>When &lsquo;<samp>make profiledbootstrap</samp>&rsquo; is run, it will first build a <code>stage1</code>
  compiler.  This compiler is used to build a <code>stageprofile</code> compiler
  instrumented to collect execution counts of instruction and branch
! probabilities.  Then runtime libraries are compiled with profile collected.
  Finally a <code>stagefeedback</code> compiler is built using the information collected.
! </p>
! <p>Unlike standard bootstrap, several additional restrictions apply.  The
! compiler used to build <code>stage1</code> needs to support a 64-bit integral type.
  It is recommended to only use GCC for this.
! </p>
! <hr />
! <p>
  <p><a href="./index.html">Return to the GCC Installation page</a>
+ </p>
+ 
+ 
+ 
  
  
+ 
+ 
+ <hr>
+ 
+ 
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/configure.html gcc-5.5.0/INSTALL/configure.html
*** gcc-5.4.0/INSTALL/configure.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/configure.html	Tue Oct 10 08:13:24 2017
***************
*** 1,1501 ****
! <html lang="en">
! <head>
! <title>Installing GCC: Configuration</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Installing GCC: Configuration">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
- <body>
- <h1 class="settitle">Installing GCC: Configuration</h1>
- <a name="index-Configuration-1"></a><a name="index-Installing-GCC_003a-Configuration-2"></a>
- Like most GNU software, GCC must be configured before it can be built. 
- This document describes the recommended configuration procedure
- for both native and cross targets.
  
!    <p>We use <var>srcdir</var> to refer to the toplevel source directory for
! GCC; we use <var>objdir</var> to refer to the toplevel build/object directory.
  
-    <p>If you obtained the sources via SVN, <var>srcdir</var> must refer to the top
- <samp><span class="file">gcc</span></samp> directory, the one where the <samp><span class="file">MAINTAINERS</span></samp> file can be
- found, and not its <samp><span class="file">gcc</span></samp> subdirectory, otherwise the build will fail.
  
!    <p>If either <var>srcdir</var> or <var>objdir</var> is located on an automounted NFS
! file system, the shell's built-in <samp><span class="command">pwd</span></samp> command will return
  temporary pathnames.  Using these can lead to various sorts of build
! problems.  To avoid this issue, set the <samp><span class="env">PWDCMD</span></samp> environment
! variable to an automounter-aware <samp><span class="command">pwd</span></samp> command, e.g.,
! <samp><span class="command">pawd</span></samp> or &lsquo;<samp><span class="samp">amq -w</span></samp>&rsquo;, during the configuration and build
  phases.
! 
!    <p>First, we <strong>highly</strong> recommend that GCC be built into a
  separate directory from the sources which does <strong>not</strong> reside
  within the source tree.  This is how we generally build GCC; building
! where <var>srcdir</var> == <var>objdir</var> should still work, but doesn't
  get extensive testing; building where <var>objdir</var> is a subdirectory
  of <var>srcdir</var> is unsupported.
! 
!    <p>If you have previously built GCC in the same directory for a
! different target machine, do &lsquo;<samp><span class="samp">make distclean</span></samp>&rsquo; to delete all files
! that might be invalid.  One of the files this deletes is <samp><span class="file">Makefile</span></samp>;
! if &lsquo;<samp><span class="samp">make distclean</span></samp>&rsquo; complains that <samp><span class="file">Makefile</span></samp> does not exist
! or issues a message like &ldquo;don't know how to make distclean&rdquo; it probably
  means that the directory is already suitably clean.  However, with the
  recommended method of building in a separate <var>objdir</var>, you should
  simply use a different <var>objdir</var> for each target.
! 
!    <p>Second, when configuring a native system, either <samp><span class="command">cc</span></samp> or
! <samp><span class="command">gcc</span></samp> must be in your path or you must set <samp><span class="env">CC</span></samp> in
  your environment before running configure.  Otherwise the configuration
  scripts may fail.
  
!    <p>To configure GCC:
  
! <pre class="smallexample">     % mkdir <var>objdir</var>
!      % cd <var>objdir</var>
!      % <var>srcdir</var>/configure [<var>options</var>] [<var>target</var>]
! </pre>
!    <h3 class="heading"><a name="TOC0"></a>Distributor options</h3>
  
  <p>If you will be distributing binary versions of GCC, with modifications
  to the source code, you should use the options described in this
  section to make clear that your version contains modifications.
! 
!      <dl>
! <dt><code>--with-pkgversion=</code><var>version</var><dd>Specify a string that identifies your package.  You may wish
  to include a build number or build date.  This version string will be
! included in the output of <samp><span class="command">gcc --version</span></samp>.  This suffix does
! not replace the default version string, only the &lsquo;<samp><span class="samp">GCC</span></samp>&rsquo; part.
! 
!      <p>The default value is &lsquo;<samp><span class="samp">GCC</span></samp>&rsquo;.
! 
!      <br><dt><code>--with-bugurl=</code><var>url</var><dd>Specify the URL that users should visit if they wish to report a bug. 
  You are of course welcome to forward bugs reported to you to the FSF,
  if you determine that they are not bugs in your modifications.
  
!      <p>The default value refers to the FSF's GCC bug tracker.
! 
!    </dl>
! 
! <h3 class="heading"><a name="TOC1"></a>Target specification</h3>
! 
!      <ul>
! <li>GCC has code to correctly determine the correct value for <var>target</var>
  for nearly all native systems.  Therefore, we highly recommend you do
  not provide a configure target when configuring a native compiler.
  
!      <li><var>target</var> must be specified as <samp><span class="option">--target=</span><var>target</var></samp>
  when configuring a cross compiler; examples of valid targets would be
  m68k-elf, sh-elf, etc.
  
!      <li>Specifying just <var>target</var> instead of <samp><span class="option">--target=</span><var>target</var></samp>
! implies that the host defaults to <var>target</var>. 
! </ul>
  
! <h3 class="heading"><a name="TOC2"></a>Options specification</h3>
  
  <p>Use <var>options</var> to override several configure time options for
! GCC.  A list of supported <var>options</var> follows; &lsquo;<samp><span class="samp">configure
! --help</span></samp>&rsquo; may list other options, but those not listed below may not
  work and should not normally be used.
! 
!    <p>Note that each <samp><span class="option">--enable</span></samp> option has a corresponding
! <samp><span class="option">--disable</span></samp> option and that each <samp><span class="option">--with</span></samp> option has a
! corresponding <samp><span class="option">--without</span></samp> option.
! 
!      <dl>
! <dt><code>--prefix=</code><var>dirname</var><dd>Specify the toplevel installation
  directory.  This is the recommended way to install the tools into a directory
  other than the default.  The toplevel installation directory defaults to
! <samp><span class="file">/usr/local</span></samp>.
! 
!      <p>We <strong>highly</strong> recommend against <var>dirname</var> being the same or a
  subdirectory of <var>objdir</var> or vice versa.  If specifying a directory
! beneath a user's home directory tree, some shells will not expand
! <var>dirname</var> correctly if it contains the &lsquo;<samp><span class="samp">~</span></samp>&rsquo; metacharacter; use
! <samp><span class="env">$HOME</span></samp> instead.
! 
!      <p>The following standard <samp><span class="command">autoconf</span></samp> options are supported.  Normally you
  should not need to use these options.
!           <dl>
! <dt><code>--exec-prefix=</code><var>dirname</var><dd>Specify the toplevel installation directory for architecture-dependent
  files.  The default is <samp><var>prefix</var></samp>.
! 
!           <br><dt><code>--bindir=</code><var>dirname</var><dd>Specify the installation directory for the executables called by users
! (such as <samp><span class="command">gcc</span></samp> and <samp><span class="command">g++</span></samp>).  The default is
! <samp><var>exec-prefix</var><span class="file">/bin</span></samp>.
! 
!           <br><dt><code>--libdir=</code><var>dirname</var><dd>Specify the installation directory for object code libraries and
! internal data files of GCC.  The default is <samp><var>exec-prefix</var><span class="file">/lib</span></samp>.
! 
!           <br><dt><code>--libexecdir=</code><var>dirname</var><dd>Specify the installation directory for internal executables of GCC. 
! The default is <samp><var>exec-prefix</var><span class="file">/libexec</span></samp>.
! 
!           <br><dt><code>--with-slibdir=</code><var>dirname</var><dd>Specify the installation directory for the shared libgcc library.  The
  default is <samp><var>libdir</var></samp>.
! 
!           <br><dt><code>--datarootdir=</code><var>dirname</var><dd>Specify the root of the directory tree for read-only architecture-independent
! data files referenced by GCC.  The default is <samp><var>prefix</var><span class="file">/share</span></samp>.
! 
!           <br><dt><code>--infodir=</code><var>dirname</var><dd>Specify the installation directory for documentation in info format. 
! The default is <samp><var>datarootdir</var><span class="file">/info</span></samp>.
! 
!           <br><dt><code>--datadir=</code><var>dirname</var><dd>Specify the installation directory for some architecture-independent
  data files referenced by GCC.  The default is <samp><var>datarootdir</var></samp>.
! 
!           <br><dt><code>--docdir=</code><var>dirname</var><dd>Specify the installation directory for documentation files (other
! than Info) for GCC.  The default is <samp><var>datarootdir</var><span class="file">/doc</span></samp>.
! 
!           <br><dt><code>--htmldir=</code><var>dirname</var><dd>Specify the installation directory for HTML documentation files. 
  The default is <samp><var>docdir</var></samp>.
! 
!           <br><dt><code>--pdfdir=</code><var>dirname</var><dd>Specify the installation directory for PDF documentation files. 
  The default is <samp><var>docdir</var></samp>.
! 
!           <br><dt><code>--mandir=</code><var>dirname</var><dd>Specify the installation directory for manual pages.  The default is
! <samp><var>datarootdir</var><span class="file">/man</span></samp>.  (Note that the manual pages are only extracts
  from the full GCC manuals, which are provided in Texinfo format.  The manpages
  are derived by an automatic conversion process from parts of the full
  manual.)
! 
!           <br><dt><code>--with-gxx-include-dir=</code><var>dirname</var><dd>Specify
  the installation directory for G++ header files.  The default depends
  on other configuration options, and differs between cross and native
  configurations.
! 
!           <br><dt><code>--with-specs=</code><var>specs</var><dd>Specify additional command line driver SPECS. 
  This can be useful if you need to turn on a non-standard feature by
! default without modifying the compiler's source code, for instance
! <samp><span class="option">--with-specs=%{!fcommon:%{!fno-common:-fno-common}}</span></samp>. 
  See &ldquo;Spec Files&rdquo; in the main manual
  
!      </dl>
! 
!      <br><dt><code>--program-prefix=</code><var>prefix</var><dd>GCC supports some transformations of the names of its programs when
  installing them.  This option prepends <var>prefix</var> to the names of
  programs to install in <var>bindir</var> (see above).  For example, specifying
! <samp><span class="option">--program-prefix=foo-</span></samp> would result in &lsquo;<samp><span class="samp">gcc</span></samp>&rsquo;
! being installed as <samp><span class="file">/usr/local/bin/foo-gcc</span></samp>.
! 
!      <br><dt><code>--program-suffix=</code><var>suffix</var><dd>Appends <var>suffix</var> to the names of programs to install in <var>bindir</var>
! (see above).  For example, specifying <samp><span class="option">--program-suffix=-3.1</span></samp>
! would result in &lsquo;<samp><span class="samp">gcc</span></samp>&rsquo; being installed as
! <samp><span class="file">/usr/local/bin/gcc-3.1</span></samp>.
! 
!      <br><dt><code>--program-transform-name=</code><var>pattern</var><dd>Applies the &lsquo;<samp><span class="samp">sed</span></samp>&rsquo; script <var>pattern</var> to be applied to the names
  of programs to install in <var>bindir</var> (see above).  <var>pattern</var> has to
! consist of one or more basic &lsquo;<samp><span class="samp">sed</span></samp>&rsquo; editing commands, separated by
! semicolons.  For example, if you want the &lsquo;<samp><span class="samp">gcc</span></samp>&rsquo; program name to be
! transformed to the installed program <samp><span class="file">/usr/local/bin/myowngcc</span></samp> and
! the &lsquo;<samp><span class="samp">g++</span></samp>&rsquo; program name to be transformed to
! <samp><span class="file">/usr/local/bin/gspecial++</span></samp> without changing other program names,
  you could use the pattern
! <samp><span class="option">--program-transform-name='s/^gcc$/myowngcc/; s/^g++$/gspecial++/'</span></samp>
  to achieve this effect.
! 
!      <p>All three options can be combined and used together, resulting in more
  complex conversion patterns.  As a basic rule, <var>prefix</var> (and
  <var>suffix</var>) are prepended (appended) before further transformations
  can happen with a special transformation script <var>pattern</var>.
! 
!      <p>As currently implemented, this option only takes effect for native
! builds; cross compiler binaries' names are not transformed even when a
  transformation is explicitly asked for by one of these options.
! 
!      <p>For native builds, some of the installed programs are also installed
  with the target alias in front of their name, as in
! &lsquo;<samp><span class="samp">i686-pc-linux-gnu-gcc</span></samp>&rsquo;.  All of the above transformations happen
  before the target alias is prepended to the name&mdash;so, specifying
! <samp><span class="option">--program-prefix=foo-</span></samp> and <samp><span class="option">program-suffix=-3.1</span></samp>, the
  resulting binary would be installed as
! <samp><span class="file">/usr/local/bin/i686-pc-linux-gnu-foo-gcc-3.1</span></samp>.
! 
!      <p>As a last shortcoming, none of the installed Ada programs are
  transformed yet, which will be fixed in some time.
! 
!      <br><dt><code>--with-local-prefix=</code><var>dirname</var><dd>Specify the
  installation directory for local include files.  The default is
! <samp><span class="file">/usr/local</span></samp>.  Specify this option if you want the compiler to
! search directory <samp><var>dirname</var><span class="file">/include</span></samp> for locally installed
! header files <em>instead</em> of <samp><span class="file">/usr/local/include</span></samp>.
! 
!      <p>You should specify <samp><span class="option">--with-local-prefix</span></samp> <strong>only</strong> if your
! site has a different convention (not <samp><span class="file">/usr/local</span></samp>) for where to put
  site-specific files.
! 
!      <p>The default value for <samp><span class="option">--with-local-prefix</span></samp> is <samp><span class="file">/usr/local</span></samp>
! regardless of the value of <samp><span class="option">--prefix</span></samp>.  Specifying
! <samp><span class="option">--prefix</span></samp> has no effect on which directory GCC searches for
  local header files.  This may seem counterintuitive, but actually it is
  logical.
! 
!      <p>The purpose of <samp><span class="option">--prefix</span></samp> is to specify where to <em>install
! GCC</em>.  The local header files in <samp><span class="file">/usr/local/include</span></samp>&mdash;if you put
  any in that directory&mdash;are not part of GCC.  They are part of other
  programs&mdash;perhaps many others.  (GCC installs its own header files in
! another directory which is based on the <samp><span class="option">--prefix</span></samp> value.)
! 
!      <p>Both the local-prefix include directory and the GCC-prefix include
! directory are part of GCC's &ldquo;system include&rdquo; directories.  Although these
  two directories are not fixed, they need to be searched in the proper
  order for the correct processing of the include_next directive.  The
  local-prefix include directory is searched before the GCC-prefix
  include directory.  Another characteristic of system include directories
  is that pedantic warnings are turned off for headers in these directories.
! 
!      <p>Some autoconf macros add <samp><span class="option">-I </span><var>directory</var></samp> options to the
  compiler command line, to ensure that directories containing installed
! packages' headers are searched.  When <var>directory</var> is one of GCC's
  system include directories, GCC will ignore the option so that system
  directories continue to be processed in the correct order.  This
  may result in a search order different from what was specified but the
  directory will still be searched.
! 
!      <p>GCC automatically searches for ordinary libraries using
! <samp><span class="env">GCC_EXEC_PREFIX</span></samp>.  Thus, when the same installation prefix is
  used for both GCC and packages, GCC will automatically search for
  both headers and libraries.  This provides a configuration that is
  easy to use.  GCC behaves in a manner similar to that when it is
! installed as a system compiler in <samp><span class="file">/usr</span></samp>.
! 
!      <p>Sites that need to install multiple versions of GCC may not want to
  use the above simple configuration.  It is possible to use the
! <samp><span class="option">--program-prefix</span></samp>, <samp><span class="option">--program-suffix</span></samp> and
! <samp><span class="option">--program-transform-name</span></samp> options to install multiple versions
  into a single directory, but it may be simpler to use different prefixes
! and the <samp><span class="option">--with-local-prefix</span></samp> option to specify the location of the
  site-specific files for each version.  It will then be necessary for
  users to specify explicitly the location of local site libraries
! (e.g., with <samp><span class="env">LIBRARY_PATH</span></samp>).
! 
!      <p>The same value can be used for both <samp><span class="option">--with-local-prefix</span></samp> and
! <samp><span class="option">--prefix</span></samp> provided it is not <samp><span class="file">/usr</span></samp>.  This can be used
! to avoid the default search of <samp><span class="file">/usr/local/include</span></samp>.
! 
!      <p><strong>Do not</strong> specify <samp><span class="file">/usr</span></samp> as the <samp><span class="option">--with-local-prefix</span></samp>! 
! The directory you use for <samp><span class="option">--with-local-prefix</span></samp> <strong>must not</strong>
! contain any of the system's standard header files.  If it did contain
  them, certain programs would be miscompiled (including GNU Emacs, on
  certain targets), because this would override and nullify the header
! file corrections made by the <samp><span class="command">fixincludes</span></samp> script.
! 
!      <p>Indications are that people who use this option use it based on mistaken
  ideas of what it is for.  People use it as if it specified where to
  install part of GCC.  Perhaps they make this assumption because
  installing GCC creates the directory.
! 
!      <br><dt><code>--with-native-system-header-dir=</code><var>dirname</var><dd>Specifies that <var>dirname</var> is the directory that contains native system
! header files, rather than <samp><span class="file">/usr/include</span></samp>.  This option is most useful
  if you are creating a compiler that should be isolated from the system
  as much as possible.  It is most commonly used with the
! <samp><span class="option">--with-sysroot</span></samp> option and will cause GCC to search
  <var>dirname</var> inside the system root specified by that option.
! 
!      <br><dt><code>--enable-shared[=</code><var>package</var><code>[,...]]</code><dd>Build shared versions of libraries, if shared libraries are supported on
  the target platform.  Unlike GCC 2.95.x and earlier, shared libraries
  are enabled by default on all platforms that support shared libraries.
! 
!      <p>If a list of packages is given as an argument, build shared libraries
  only for the listed packages.  For other packages, only static libraries
  will be built.  Package names currently recognized in the GCC tree are
! &lsquo;<samp><span class="samp">libgcc</span></samp>&rsquo; (also known as &lsquo;<samp><span class="samp">gcc</span></samp>&rsquo;), &lsquo;<samp><span class="samp">libstdc++</span></samp>&rsquo; (not
! &lsquo;<samp><span class="samp">libstdc++-v3</span></samp>&rsquo;), &lsquo;<samp><span class="samp">libffi</span></samp>&rsquo;, &lsquo;<samp><span class="samp">zlib</span></samp>&rsquo;, &lsquo;<samp><span class="samp">boehm-gc</span></samp>&rsquo;,
! &lsquo;<samp><span class="samp">ada</span></samp>&rsquo;, &lsquo;<samp><span class="samp">libada</span></samp>&rsquo;, &lsquo;<samp><span class="samp">libjava</span></samp>&rsquo;, &lsquo;<samp><span class="samp">libgo</span></samp>&rsquo;, and &lsquo;<samp><span class="samp">libobjc</span></samp>&rsquo;. 
! Note &lsquo;<samp><span class="samp">libiberty</span></samp>&rsquo; does not support shared libraries at all.
! 
!      <p>Use <samp><span class="option">--disable-shared</span></samp> to build only static libraries.  Note that
! <samp><span class="option">--disable-shared</span></samp> does not accept a list of package names as
! argument, only <samp><span class="option">--enable-shared</span></samp> does.
! 
!      <p>Contrast with <samp><span class="option">--enable-host-shared</span></samp>, which affects <em>host</em>
  code.
! 
!      <br><dt><code>--enable-host-shared</code><dd>Specify that the <em>host</em> code should be built into position-independent
  machine code (with -fPIC), allowing it to be used within shared libraries,
  but yielding a slightly slower compiler.
! 
!      <p>This option is required when building the libgccjit.so library.
! 
!      <p>Contrast with <samp><span class="option">--enable-shared</span></samp>, which affects <em>target</em>
  libraries.
! 
!      <br><dt><code><a name="with_002dgnu_002das"></a>--with-gnu-as</code><dd>Specify that the compiler should assume that the
  assembler it finds is the GNU assembler.  However, this does not modify
  the rules to find an assembler and will result in confusion if the
  assembler found is not actually the GNU assembler.  (Confusion may also
  result if the compiler finds the GNU assembler but has not been
! configured with <samp><span class="option">--with-gnu-as</span></samp>.)  If you have more than one
  assembler installed on your system, you may want to use this option in
! connection with <samp><span class="option">--with-as=</span><var>pathname</var></samp> or
! <samp><span class="option">--with-build-time-tools=</span><var>pathname</var></samp>.
! 
!      <p>The following systems are the only ones where it makes a difference
  whether you use the GNU assembler.  On any other system,
! <samp><span class="option">--with-gnu-as</span></samp> has no effect.
! 
!           <ul>
! <li>&lsquo;<samp><span class="samp">hppa1.0-</span><var>any</var><span class="samp">-</span><var>any</var></samp>&rsquo;
! <li>&lsquo;<samp><span class="samp">hppa1.1-</span><var>any</var><span class="samp">-</span><var>any</var></samp>&rsquo;
! <li>&lsquo;<samp><span class="samp">sparc-sun-solaris2.</span><var>any</var></samp>&rsquo;
! <li>&lsquo;<samp><span class="samp">sparc64-</span><var>any</var><span class="samp">-solaris2.</span><var>any</var></samp>&rsquo;
! </ul>
  
!      <br><dt><code><a name="with_002das"></a>--with-as=</code><var>pathname</var><dd>Specify that the compiler should use the assembler pointed to by
  <var>pathname</var>, rather than the one found by the standard rules to find
  an assembler, which are:
!           <ul>
! <li>Unless GCC is being built with a cross compiler, check the
! <samp><var>libexec</var><span class="file">/gcc/</span><var>target</var><span class="file">/</span><var>version</var></samp> directory. 
! <var>libexec</var> defaults to <samp><var>exec-prefix</var><span class="file">/libexec</span></samp>;
  <var>exec-prefix</var> defaults to <var>prefix</var>, which
! defaults to <samp><span class="file">/usr/local</span></samp> unless overridden by the
! <samp><span class="option">--prefix=</span><var>pathname</var></samp> switch described above.  <var>target</var>
! is the target system triple, such as &lsquo;<samp><span class="samp">sparc-sun-solaris2.7</span></samp>&rsquo;, and
  <var>version</var> denotes the GCC version, such as 3.0.
  
!           <li>If the target system is the same that you are building on, check
! operating system specific directories (e.g. <samp><span class="file">/usr/ccs/bin</span></samp> on
  Sun Solaris 2).
  
!           <li>Check in the <samp><span class="env">PATH</span></samp> for a tool whose name is prefixed by the
  target system triple.
  
!           <li>Check in the <samp><span class="env">PATH</span></samp> for a tool whose name is not prefixed by the
  target system triple, if the host and target system triple are
  the same (in other words, we use a host tool if it can be used for
! the target as well). 
! </ul>
  
!      <p>You may want to use <samp><span class="option">--with-as</span></samp> if no assembler
  is installed in the directories listed above, or if you have multiple
  assemblers installed and want to choose one that is not found by the
  above rules.
! 
!      <br><dt><code><a name="with_002dgnu_002dld"></a>--with-gnu-ld</code><dd>Same as <a href="#with-gnu-as"><samp><span class="option">--with-gnu-as</span></samp></a>
  but for the linker.
! 
!      <br><dt><code>--with-ld=</code><var>pathname</var><dd>Same as <a href="#with-as"><samp><span class="option">--with-as</span></samp></a>
  but for the linker.
! 
!      <br><dt><code>--with-stabs</code><dd>Specify that stabs debugging
  information should be used instead of whatever format the host normally
  uses.  Normally GCC uses the same debug format as the host system.
! 
!      <p>On MIPS based systems and on Alphas, you must specify whether you want
  GCC to create the normal ECOFF debugging format, or to use BSD-style
  stabs passed through the ECOFF symbol table.  The normal ECOFF debug
  format cannot fully handle languages other than C.  BSD stabs format can
  handle other languages, but it only works with the GNU debugger GDB.
! 
!      <p>Normally, GCC uses the ECOFF debugging format by default; if you
! prefer BSD stabs, specify <samp><span class="option">--with-stabs</span></samp> when you configure GCC.
! 
!      <p>No matter which default you choose when you configure GCC, the user
! can use the <samp><span class="option">-gcoff</span></samp> and <samp><span class="option">-gstabs+</span></samp> options to specify explicitly
  the debug format for a particular compilation.
! 
!      <p><samp><span class="option">--with-stabs</span></samp> is meaningful on the ISC system on the 386, also, if
! <samp><span class="option">--with-gas</span></samp> is used.  It selects use of stabs debugging
  information embedded in COFF output.  This kind of debugging information
  supports C++ well; ordinary COFF debugging information does not.
! 
!      <p><samp><span class="option">--with-stabs</span></samp> is also meaningful on 386 systems running SVR4.  It
  selects use of stabs debugging information embedded in ELF output.  The
  C++ compiler currently (2.6.0) does not support the DWARF debugging
  information normally used on 386 SVR4 platforms; stabs provide a
  workable alternative.  This requires gas and gdb, as the normal SVR4
  tools can not generate or interpret stabs.
! 
!      <br><dt><code>--with-tls=</code><var>dialect</var><dd>Specify the default TLS dialect, for systems were there is a choice. 
  For ARM targets, possible values for <var>dialect</var> are <code>gnu</code> or
  <code>gnu2</code>, which select between the original GNU dialect and the GNU TLS
  descriptor-based dialect.
! 
!      <br><dt><code>--enable-multiarch</code><dd>Specify whether to enable or disable multiarch support.  The default is
  to check for glibc start files in a multiarch location, and enable it
  if the files are found.  The auto detection is enabled for native builds,
! and for cross builds configured with <samp><span class="option">--with-sysroot</span></samp>, and without
! <samp><span class="option">--with-native-system-header-dir</span></samp>. 
  More documentation about multiarch can be found at
  <a href="http://wiki.debian.org/Multiarch">http://wiki.debian.org/Multiarch</a>.
! 
!      <br><dt><code>--enable-vtable-verify</code><dd>Specify whether to enable or disable the vtable verification feature. 
  Enabling this feature causes libstdc++ to be built with its virtual calls
  in verifiable mode.  This means that, when linked with libvtv, every
  virtual call in libstdc++ will verify the vtable pointer through which the
  call will be made before actually making the call.  If not linked with libvtv,
! the verifier will call stub functions (in libstdc++ itself) and do nothing. 
  If vtable verification is disabled, then libstdc++ is not built with its
  virtual calls in verifiable mode at all.  However the libvtv library will
! still be built (see <samp><span class="option">--disable-libvtv</span></samp> to turn off building libvtv). 
! <samp><span class="option">--disable-vtable-verify</span></samp> is the default.
! 
!      <br><dt><code>--disable-multilib</code><dd>Specify that multiple target
  libraries to support different target variants, calling
  conventions, etc. should not be built.  The default is to build a
  predefined set of them.
! 
!      <p>Some targets provide finer-grained control over which multilibs are built
! (e.g., <samp><span class="option">--disable-softfloat</span></samp>):
!           <dl>
! <dt><code>arm-*-*</code><dd>fpu, 26bit, underscore, interwork, biendian, nofmult.
! 
!           <br><dt><code>m68*-*-*</code><dd>softfloat, m68881, m68000, m68020.
! 
!           <br><dt><code>mips*-*-*</code><dd>single-float, biendian, softfloat.
! 
!           <br><dt><code>powerpc*-*-*, rs6000*-*-*</code><dd>aix64, pthread, softfloat, powercpu, powerpccpu, powerpcos, biendian,
  sysv, aix.
  
!      </dl>
! 
!      <br><dt><code>--with-multilib-list=</code><var>list</var><dt><code>--without-multilib-list</code><dd>Specify what multilibs to build. 
  Currently only implemented for sh*-*-* and x86-64-*-linux*.
! 
!           <dl>
! <dt><code>sh*-*-*</code><dd><var>list</var> is a comma separated list of CPU names.  These must be of the
  form <code>sh*</code> or <code>m*</code> (in which case they match the compiler option
  for that processor).  The list should not contain any endian options -
! these are handled by <samp><span class="option">--with-endian</span></samp>.
! 
!           <p>If <var>list</var> is empty, then there will be no multilibs for extra
  processors.  The multilib for the secondary endian remains enabled.
! 
!           <p>As a special case, if an entry in the list starts with a <code>!</code>
! (exclamation point), then it is added to the list of excluded multilibs. 
! Entries of this sort should be compatible with &lsquo;<samp><span class="samp">MULTILIB_EXCLUDES</span></samp>&rsquo;
  (once the leading <code>!</code> has been stripped).
! 
!           <p>If <samp><span class="option">--with-multilib-list</span></samp> is not given, then a default set of
! multilibs is selected based on the value of <samp><span class="option">--target</span></samp>.  This is
  usually the complete set of libraries, but some targets imply a more
  specialized subset.
! 
!           <p>Example 1: to configure a compiler for SH4A only, but supporting both
  endians, with little endian being the default:
!           <pre class="smallexample">               --with-cpu=sh4a --with-endian=little,big --with-multilib-list=
! </pre>
!           <p>Example 2: to configure a compiler for both SH4A and SH4AL-DSP, but with
  only little endian SH4AL:
!           <pre class="smallexample">               --with-cpu=sh4a --with-endian=little,big \
!                --with-multilib-list=sh4al,!mb/m4al
! </pre>
!           <br><dt><code>x86-64-*-linux*</code><dd><var>list</var> is a comma separated list of <code>m32</code>, <code>m64</code> and
  <code>mx32</code> to enable 32-bit, 64-bit and x32 run-time libraries,
  respectively.  If <var>list</var> is empty, then there will be no multilibs
  and only the default run-time library will be enabled.
! 
!           <p>If <samp><span class="option">--with-multilib-list</span></samp> is not given, then only 32-bit and
! 64-bit run-time libraries will be enabled. 
  </dl>
  
!      <br><dt><code>--with-endian=</code><var>endians</var><dd>Specify what endians to use. 
  Currently only implemented for sh*-*-*.
! 
!      <p><var>endians</var> may be one of the following:
!           <dl>
! <dt><code>big</code><dd>Use big endian exclusively. 
! <br><dt><code>little</code><dd>Use little endian exclusively. 
! <br><dt><code>big,little</code><dd>Use big endian by default.  Provide a multilib for little endian. 
! <br><dt><code>little,big</code><dd>Use little endian by default.  Provide a multilib for big endian. 
  </dl>
  
!      <br><dt><code>--enable-threads</code><dd>Specify that the target
  supports threads.  This affects the Objective-C compiler and runtime
! library, and exception handling for other languages like C++ and Java. 
  On some systems, this is the default.
! 
!      <p>In general, the best (and, in many cases, the only known) threading
  model available will be configured for use.  Beware that on some
  systems, GCC has not been taught what threading models are generally
! available for the system.  In this case, <samp><span class="option">--enable-threads</span></samp> is an
! alias for <samp><span class="option">--enable-threads=single</span></samp>.
! 
!      <br><dt><code>--disable-threads</code><dd>Specify that threading support should be disabled for the system. 
! This is an alias for <samp><span class="option">--enable-threads=single</span></samp>.
! 
!      <br><dt><code>--enable-threads=</code><var>lib</var><dd>Specify that
  <var>lib</var> is the thread support library.  This affects the Objective-C
  compiler and runtime library, and exception handling for other languages
  like C++ and Java.  The possibilities for <var>lib</var> are:
! 
!           <dl>
! <dt><code>aix</code><dd>AIX thread support. 
! <br><dt><code>dce</code><dd>DCE thread support. 
! <br><dt><code>lynx</code><dd>LynxOS thread support. 
! <br><dt><code>mipssde</code><dd>MIPS SDE thread support. 
! <br><dt><code>no</code><dd>This is an alias for &lsquo;<samp><span class="samp">single</span></samp>&rsquo;. 
! <br><dt><code>posix</code><dd>Generic POSIX/Unix98 thread support. 
! <br><dt><code>rtems</code><dd>RTEMS thread support. 
! <br><dt><code>single</code><dd>Disable thread support, should work for all platforms. 
! <br><dt><code>tpf</code><dd>TPF thread support. 
! <br><dt><code>vxworks</code><dd>VxWorks thread support. 
! <br><dt><code>win32</code><dd>Microsoft Win32 API thread support. 
  </dl>
  
!      <br><dt><code>--enable-tls</code><dd>Specify that the target supports TLS (Thread Local Storage).  Usually
  configure can correctly determine if TLS is supported.  In cases where
  it guesses incorrectly, TLS can be explicitly enabled or disabled with
! <samp><span class="option">--enable-tls</span></samp> or <samp><span class="option">--disable-tls</span></samp>.  This can happen if
  the assembler supports TLS but the C library does not, or if the
  assumptions made by the configure test are incorrect.
! 
!      <br><dt><code>--disable-tls</code><dd>Specify that the target does not support TLS. 
! This is an alias for <samp><span class="option">--enable-tls=no</span></samp>.
! 
!      <br><dt><code>--with-cpu=</code><var>cpu</var><dt><code>--with-cpu-32=</code><var>cpu</var><dt><code>--with-cpu-64=</code><var>cpu</var><dd>Specify which cpu variant the compiler should generate code for by default. 
! <var>cpu</var> will be used as the default value of the <samp><span class="option">-mcpu=</span></samp> switch. 
  This option is only supported on some targets, including ARC, ARM, i386, M68k,
! PowerPC, and SPARC.  It is mandatory for ARC.  The <samp><span class="option">--with-cpu-32</span></samp> and
! <samp><span class="option">--with-cpu-64</span></samp> options specify separate default CPUs for
  32-bit and 64-bit modes; these options are only supported for i386,
  x86-64 and PowerPC.
! 
!      <br><dt><code>--with-schedule=</code><var>cpu</var><dt><code>--with-arch=</code><var>cpu</var><dt><code>--with-arch-32=</code><var>cpu</var><dt><code>--with-arch-64=</code><var>cpu</var><dt><code>--with-tune=</code><var>cpu</var><dt><code>--with-tune-32=</code><var>cpu</var><dt><code>--with-tune-64=</code><var>cpu</var><dt><code>--with-abi=</code><var>abi</var><dt><code>--with-fpu=</code><var>type</var><dt><code>--with-float=</code><var>type</var><dd>These configure options provide default values for the <samp><span class="option">-mschedule=</span></samp>,
! <samp><span class="option">-march=</span></samp>, <samp><span class="option">-mtune=</span></samp>, <samp><span class="option">-mabi=</span></samp>, and <samp><span class="option">-mfpu=</span></samp>
! options and for <samp><span class="option">-mhard-float</span></samp> or <samp><span class="option">-msoft-float</span></samp>.  As with
! <samp><span class="option">--with-cpu</span></samp>, which switches will be accepted and acceptable values
  of the arguments depend on the target.
! 
!      <br><dt><code>--with-mode=</code><var>mode</var><dd>Specify if the compiler should default to <samp><span class="option">-marm</span></samp> or <samp><span class="option">-mthumb</span></samp>. 
  This option is only supported on ARM targets.
! 
!      <br><dt><code>--with-stack-offset=</code><var>num</var><dd>This option sets the default for the -mstack-offset=<var>num</var> option,
  and will thus generally also control the setting of this option for
  libraries.  This option is only supported on Epiphany targets.
! 
!      <br><dt><code>--with-fpmath=</code><var>isa</var><dd>This options sets <samp><span class="option">-mfpmath=sse</span></samp> by default and specifies the default
! ISA for floating-point arithmetics.  You can select either &lsquo;<samp><span class="samp">sse</span></samp>&rsquo; which
! enables <samp><span class="option">-msse2</span></samp> or &lsquo;<samp><span class="samp">avx</span></samp>&rsquo; which enables <samp><span class="option">-mavx</span></samp> by default. 
  This option is only supported on i386 and x86-64 targets.
! 
!      <br><dt><code>--with-fp-32=</code><var>mode</var><dd>On MIPS targets, set the default value for the <samp><span class="option">-mfp</span></samp> option when using
  the o32 ABI.  The possibilities for <var>mode</var> are:
!           <dl>
! <dt><code>32</code><dd>Use the o32 FP32 ABI extension, as with the <samp><span class="option">-mfp32</span></samp> command-line
! option. 
! <br><dt><code>xx</code><dd>Use the o32 FPXX ABI extension, as with the <samp><span class="option">-mfpxx</span></samp> command-line
! option. 
! <br><dt><code>64</code><dd>Use the o32 FP64 ABI extension, as with the <samp><span class="option">-mfp64</span></samp> command-line
! option. 
  </dl>
!      In the absence of this configuration option the default is to use the o32
  FP32 ABI extension.
! 
!      <br><dt><code>--with-odd-spreg-32</code><dd>On MIPS targets, set the <samp><span class="option">-modd-spreg</span></samp> option by default when using
  the o32 ABI.
! 
!      <br><dt><code>--without-odd-spreg-32</code><dd>On MIPS targets, set the <samp><span class="option">-mno-odd-spreg</span></samp> option by default when using
  the o32 ABI.  This is normally used in conjunction with
! <samp><span class="option">--with-fp-32=64</span></samp> in order to target the o32 FP64A ABI extension.
! 
!      <br><dt><code>--with-nan=</code><var>encoding</var><dd>On MIPS targets, set the default encoding convention to use for the
  special not-a-number (NaN) IEEE 754 floating-point data.  The
  possibilities for <var>encoding</var> are:
!           <dl>
! <dt><code>legacy</code><dd>Use the legacy encoding, as with the <samp><span class="option">-mnan=legacy</span></samp> command-line
! option. 
! <br><dt><code>2008</code><dd>Use the 754-2008 encoding, as with the <samp><span class="option">-mnan=2008</span></samp> command-line
! option. 
  </dl>
!      To use this configuration option you must have an assembler version
! installed that supports the <samp><span class="option">-mnan=</span></samp> command-line option too. 
  In the absence of this configuration option the default convention is
! the legacy encoding, as when neither of the <samp><span class="option">-mnan=2008</span></samp> and
! <samp><span class="option">-mnan=legacy</span></samp> command-line options has been used.
! 
!      <br><dt><code>--with-divide=</code><var>type</var><dd>Specify how the compiler should generate code for checking for
! division by zero.  This option is only supported on the MIPS target. 
  The possibilities for <var>type</var> are:
!           <dl>
! <dt><code>traps</code><dd>Division by zero checks use conditional traps (this is the default on
! systems that support conditional traps). 
! <br><dt><code>breaks</code><dd>Division by zero checks use the break instruction. 
  </dl>
  
!      <!-- If you make -with-llsc the default for additional targets, -->
!      <!-- update the -with-llsc description in the MIPS section below. -->
!      <br><dt><code>--with-llsc</code><dd>On MIPS targets, make <samp><span class="option">-mllsc</span></samp> the default when no
! <samp><span class="option">-mno-llsc</span></samp> option is passed.  This is the default for
  Linux-based targets, as the kernel will emulate them if the ISA does
  not provide them.
! 
!      <br><dt><code>--without-llsc</code><dd>On MIPS targets, make <samp><span class="option">-mno-llsc</span></samp> the default when no
! <samp><span class="option">-mllsc</span></samp> option is passed.
! 
!      <br><dt><code>--with-synci</code><dd>On MIPS targets, make <samp><span class="option">-msynci</span></samp> the default when no
! <samp><span class="option">-mno-synci</span></samp> option is passed.
! 
!      <br><dt><code>--without-synci</code><dd>On MIPS targets, make <samp><span class="option">-mno-synci</span></samp> the default when no
! <samp><span class="option">-msynci</span></samp> option is passed.  This is the default.
! 
!      <br><dt><code>--with-mips-plt</code><dd>On MIPS targets, make use of copy relocations and PLTs. 
  These features are extensions to the traditional
  SVR4-based MIPS ABIs and require support from GNU binutils
  and the runtime C library.
! 
!      <br><dt><code>--enable-__cxa_atexit</code><dd>Define if you want to use __cxa_atexit, rather than atexit, to
! register C++ destructors for local statics and global objects. 
  This is essential for fully standards-compliant handling of
  destructors, but requires __cxa_atexit in libc.  This option is currently
  only available on systems with GNU libc.  When enabled, this will cause
! <samp><span class="option">-fuse-cxa-atexit</span></samp> to be passed by default.
! 
!      <br><dt><code>--enable-gnu-indirect-function</code><dd>Define if you want to enable the <code>ifunc</code> attribute.  This option is
  currently only available on systems with GNU libc on certain targets.
! 
!      <br><dt><code>--enable-target-optspace</code><dd>Specify that target
! libraries should be optimized for code space instead of code speed. 
  This is the default for the m32r platform.
! 
!      <br><dt><code>--with-cpp-install-dir=</code><var>dirname</var><dd>Specify that the user visible <samp><span class="command">cpp</span></samp> program should be installed
! in <samp><var>prefix</var><span class="file">/</span><var>dirname</var><span class="file">/cpp</span></samp>, in addition to <var>bindir</var>.
! 
!      <br><dt><code>--enable-comdat</code><dd>Enable COMDAT group support.  This is primarily used to override the
  automatically detected value.
! 
!      <br><dt><code>--enable-initfini-array</code><dd>Force the use of sections <code>.init_array</code> and <code>.fini_array</code>
  (instead of <code>.init</code> and <code>.fini</code>) for constructors and
! destructors.  Option <samp><span class="option">--disable-initfini-array</span></samp> has the
  opposite effect.  If neither option is specified, the configure script
  will try to guess whether the <code>.init_array</code> and
  <code>.fini_array</code> sections are supported and, if they are, use them.
! 
!      <br><dt><code>--enable-link-mutex</code><dd>When building GCC, use a mutex to avoid linking the compilers for
  multiple languages at the same time, to avoid thrashing on build
  systems with limited free memory.  The default is not to use such a mutex.
! 
!      <br><dt><code>--enable-maintainer-mode</code><dd>The build rules that regenerate the Autoconf and Automake output files as
! well as the GCC master message catalog <samp><span class="file">gcc.pot</span></samp> are normally
  disabled.  This is because it can only be rebuilt if the complete source
  tree is present.  If you have changed the sources and want to rebuild the
! catalog, configuring with <samp><span class="option">--enable-maintainer-mode</span></samp> will enable
  this.  Note that you need a recent version of the <code>gettext</code> tools
  to do so.
! 
!      <br><dt><code>--disable-bootstrap</code><dd>For a native build, the default configuration is to perform
! a 3-stage bootstrap of the compiler when &lsquo;<samp><span class="samp">make</span></samp>&rsquo; is invoked,
  testing that GCC can compile itself correctly.  If you want to disable
! this process, you can configure with <samp><span class="option">--disable-bootstrap</span></samp>.
! 
!      <br><dt><code>--enable-bootstrap</code><dd>In special cases, you may want to perform a 3-stage build
! even if the target and host triplets are different. 
  This is possible when the host can run code compiled for
! the target (e.g. host is i686-linux, target is i486-linux). 
  Starting from GCC 4.2, to do this you have to configure explicitly
! with <samp><span class="option">--enable-bootstrap</span></samp>.
! 
!      <br><dt><code>--enable-generated-files-in-srcdir</code><dd>Neither the .c and .h files that are generated from Bison and flex nor the
  info manuals and man pages that are built from the .texi files are present
  in the SVN development tree.  When building GCC from that development tree,
  or from one of our snapshots, those generated files are placed in your
  build directory, which allows for the source to be in a readonly
  directory.
! 
!      <p>If you configure with <samp><span class="option">--enable-generated-files-in-srcdir</span></samp> then those
  generated files will go into the source directory.  This is mainly intended
  for generating release or prerelease tarballs of the GCC sources, since it
  is not a requirement that the users of source releases to have flex, Bison,
  or makeinfo.
! 
!      <br><dt><code>--enable-version-specific-runtime-libs</code><dd>Specify
  that runtime libraries should be installed in the compiler specific
! subdirectory (<samp><var>libdir</var><span class="file">/gcc</span></samp>) rather than the usual places.  In
! addition, &lsquo;<samp><span class="samp">libstdc++</span></samp>&rsquo;'s include files will be installed into
  <samp><var>libdir</var></samp> unless you overruled it by using
! <samp><span class="option">--with-gxx-include-dir=</span><var>dirname</var></samp>.  Using this option is
  particularly useful if you intend to use several versions of GCC in
! parallel.  This is currently supported by &lsquo;<samp><span class="samp">libgfortran</span></samp>&rsquo;,
! &lsquo;<samp><span class="samp">libjava</span></samp>&rsquo;, &lsquo;<samp><span class="samp">libstdc++</span></samp>&rsquo;, and &lsquo;<samp><span class="samp">libobjc</span></samp>&rsquo;.
! 
!      <br><dt><code><a name="WithAixSoname"></a>--with-aix-soname=&lsquo;</code><samp><span class="samp">aix</span></samp><code>&rsquo;, &lsquo;</code><samp><span class="samp">svr4</span></samp><code>&rsquo; or &lsquo;</code><samp><span class="samp">both</span></samp><code>&rsquo;</code><dd>Traditional AIX shared library versioning (versioned <code>Shared Object</code>
  files as members of unversioned <code>Archive Library</code> files named
! &lsquo;<samp><span class="samp">lib.a</span></samp>&rsquo;) causes numerous headaches for package managers. However,
  <code>Import Files</code> as members of <code>Archive Library</code> files allow for
  <strong>filename-based versioning</strong> of shared libraries as seen on Linux/SVR4,
! where this is called the "SONAME". But as they prevent static linking,
  <code>Import Files</code> may be used with <code>Runtime Linking</code> only, where the
! linker does search for &lsquo;<samp><span class="samp">libNAME.so</span></samp>&rsquo; before &lsquo;<samp><span class="samp">libNAME.a</span></samp>&rsquo; library
! filenames with the &lsquo;<samp><span class="samp">-lNAME</span></samp>&rsquo; linker flag.
! 
!      <p><a name="AixLdCommand"></a>For detailed information please refer to the AIX
! <a href="http://www-01.ibm.com/support/knowledgecenter/search/%22the%20ld%20command%2C%20also%20called%20the%20linkage%20editor%20or%20binder%22">ld Command</a> reference.
! 
!      <p>As long as shared library creation is enabled, upon:
!           <dl>
! <dt><code>--with-aix-soname=aix</code><br><dt><code>--with-aix-soname=both</code><dd> A (traditional AIX) <code>Shared Archive Library</code> file is created:
!                <ul>
!   <li>using the &lsquo;<samp><span class="samp">libNAME.a</span></samp>&rsquo; filename scheme
!   <li>with the <code>Shared Object</code> file as archive member named
!   &lsquo;<samp><span class="samp">libNAME.so.V</span></samp>&rsquo; (except for &lsquo;<samp><span class="samp">libgcc_s</span></samp>&rsquo;, where the <code>Shared
!   Object</code> file is named &lsquo;<samp><span class="samp">shr.o</span></samp>&rsquo; for backwards compatibility), which
!                     <ul>
!    <li>is used for runtime loading from inside the &lsquo;<samp><span class="samp">libNAME.a</span></samp>&rsquo; file
!    <li>is used for dynamic loading via
!    <code>dlopen("libNAME.a(libNAME.so.V)", RTLD_MEMBER)</code>
!    <li>is used for shared linking
!    <li>is used for static linking, so no separate <code>Static Archive
     Library</code> file is needed
!   </ul>
!                 </ul>
!           <br><dt><code>--with-aix-soname=both</code><br><dt><code>--with-aix-soname=svr4</code><dd> A (second) <code>Shared Archive Library</code> file is created:
!                <ul>
!  <li>using the &lsquo;<samp><span class="samp">libNAME.so.V</span></samp>&rsquo; filename scheme
!  <li>with the <code>Shared Object</code> file as archive member named
!  &lsquo;<samp><span class="samp">shr.o</span></samp>&rsquo;, which
!                     <ul>
!    <li>is created with the <code>-G linker flag</code>
!    <li>has the <code>F_LOADONLY</code> flag set
!    <li>is used for runtime loading from inside the &lsquo;<samp><span class="samp">libNAME.so.V</span></samp>&rsquo; file
!    <li>is used for dynamic loading via <code>dlopen("libNAME.so.V(shr.o)",
     RTLD_MEMBER)</code>
!   </ul>
!                 <li>with the <code>Import File</code> as archive member named &lsquo;<samp><span class="samp">shr.imp</span></samp>&rsquo;,
   which
!                     <ul>
!    <li>refers to &lsquo;<samp><span class="samp">libNAME.so.V(shr.o)</span></samp>&rsquo; as the "SONAME", to be recorded
     in the <code>Loader Section</code> of subsequent binaries
!    <li>indicates whether &lsquo;<samp><span class="samp">libNAME.so.V(shr.o)</span></samp>&rsquo; is 32 or 64 bit
!    <li>lists all the public symbols exported by &lsquo;<samp><span class="samp">lib.so.V(shr.o)</span></samp>&rsquo;,
!    eventually decorated with the <code>&lsquo;</code><samp><span class="samp">weak</span></samp><code>&rsquo; Keyword</code>
!    <li>is necessary for shared linking against &lsquo;<samp><span class="samp">lib.so.V(shr.o)</span></samp>&rsquo;
!    </ul>
!                  </ul>
!             A symbolic link using the &lsquo;<samp><span class="samp">libNAME.so</span></samp>&rsquo; filename scheme is created:
!                <ul>
!   <li>pointing to the &lsquo;<samp><span class="samp">libNAME.so.V</span></samp>&rsquo; <code>Shared Archive Library</code> file
!   <li>to permit the <code>ld Command</code> to find &lsquo;<samp><span class="samp">lib.so.V(shr.imp)</span></samp>&rsquo; via
!   the &lsquo;<samp><span class="samp">-lNAME</span></samp>&rsquo; argument (requires <code>Runtime Linking</code> to be enabled)
!   <li>to permit dynamic loading of &lsquo;<samp><span class="samp">lib.so.V(shr.o)</span></samp>&rsquo; without the need
!   to specify the version number via <code>dlopen("libNAME.so(shr.o)",
    RTLD_MEMBER)</code>
!   </ul>
!           </dl>
  
!      <p>As long as static library creation is enabled, upon:
!           <dl>
! <dt><code>--with-aix-soname=svr4</code><dd> A <code>Static Archive Library</code> is created:
!                <ul>
!  <li>using the &lsquo;<samp><span class="samp">libNAME.a</span></samp>&rsquo; filename scheme
!  <li>with all the <code>Static Object</code> files as archive members, which
!                     <ul>
!    <li>are used for static linking
!   </ul>
!                 </ul>
!           </dl>
  
!      <p>While the aix-soname=&lsquo;<samp><span class="samp">svr4</span></samp>&rsquo; option does not create <code>Shared Object</code>
  files as members of unversioned <code>Archive Library</code> files any more, package
  managers still are responsible to
  <a href="./specific.html#TransferAixShobj">transfer</a> <code>Shared Object</code> files
  found as member of a previously installed unversioned <code>Archive Library</code>
  file into the newly installed <code>Archive Library</code> file with the same
  filename.
! 
!      <p><em>WARNING:</em> Creating <code>Shared Object</code> files with <code>Runtime Linking</code>
  enabled may bloat the TOC, eventually leading to <code>TOC overflow</code> errors,
! requiring the use of either the <samp><span class="option">-Wl,-bbigtoc</span></samp> linker flag (seen to
  break with the <code>GDB</code> debugger) or some of the TOC-related compiler flags,
  see &ldquo;RS/6000 and PowerPC Options&rdquo; in the main manual.
! 
!      <p><samp><span class="option">--with-aix-soname</span></samp> is currently supported by &lsquo;<samp><span class="samp">libgcc_s</span></samp>&rsquo; only, so
  this option is still experimental and not for normal use yet.
! 
!      <p>Default is the traditional behaviour <samp><span class="option">--with-aix-soname=&lsquo;</span><samp><span class="samp">aix</span></samp><span class="option">&rsquo;</span></samp>.
! 
!      <br><dt><code>--enable-languages=</code><var>lang1</var><code>,</code><var>lang2</var><code>,...</code><dd>Specify that only a particular subset of compilers and
  their runtime libraries should be built.  For a list of valid values for
  <var>langN</var> you can issue the following command in the
! <samp><span class="file">gcc</span></samp> directory of your GCC source tree:<br>
!      <pre class="smallexample">          grep language= */config-lang.in
! </pre>
!      <p>Currently, you can use any of the following:
  <code>all</code>, <code>ada</code>, <code>c</code>, <code>c++</code>, <code>fortran</code>,
! <code>go</code>, <code>java</code>, <code>objc</code>, <code>obj-c++</code>. 
! Building the Ada compiler has special requirements, see below. 
  If you do not pass this flag, or specify the option <code>all</code>, then all
! default languages available in the <samp><span class="file">gcc</span></samp> sub-tree will be configured. 
  Ada, Go and Objective-C++ are not default languages; the rest are.
! 
!      <br><dt><code>--enable-stage1-languages=</code><var>lang1</var><code>,</code><var>lang2</var><code>,...</code><dd>Specify that a particular subset of compilers and their runtime
  libraries should be built with the system C compiler during stage 1 of
  the bootstrap process, rather than only in later stages with the
  bootstrapped C compiler.  The list of valid values is the same as for
! <samp><span class="option">--enable-languages</span></samp>, and the option <code>all</code> will select all
! of the languages enabled by <samp><span class="option">--enable-languages</span></samp>.  This option is
  primarily useful for GCC development; for instance, when a development
  version of the compiler cannot bootstrap due to compiler bugs, or when
  one is debugging front ends other than the C front end.  When this
  option is used, one can then build the target libraries for the
! specified languages with the stage-1 compiler by using <samp><span class="command">make
! stage1-bubble all-target</span></samp>, or run the testsuite on the stage-1 compiler
! for the specified languages using <samp><span class="command">make stage1-start check-gcc</span></samp>.
! 
!      <br><dt><code>--disable-libada</code><dd>Specify that the run-time libraries and tools used by GNAT should not
  be built.  This can be useful for debugging, or for compatibility with
  previous Ada build procedures, when it was required to explicitly
! do a &lsquo;<samp><span class="samp">make -C gcc gnatlib_and_tools</span></samp>&rsquo;.
! 
!      <br><dt><code>--disable-libsanitizer</code><dd>Specify that the run-time libraries for the various sanitizers should
  not be built.
! 
!      <br><dt><code>--disable-libssp</code><dd>Specify that the run-time libraries for stack smashing protection
  should not be built.
! 
!      <br><dt><code>--disable-libquadmath</code><dd>Specify that the GCC quad-precision math library should not be built. 
  On some systems, the library is required to be linkable when building
! the Fortran front end, unless <samp><span class="option">--disable-libquadmath-support</span></samp>
  is used.
! 
!      <br><dt><code>--disable-libquadmath-support</code><dd>Specify that the Fortran front end and <code>libgfortran</code> do not add
  support for <code>libquadmath</code> on systems supporting it.
! 
!      <br><dt><code>--disable-libgomp</code><dd>Specify that the GNU Offloading and Multi Processing Runtime Library
  should not be built.
! 
!      <br><dt><code>--disable-libvtv</code><dd>Specify that the run-time libraries used by vtable verification
  should not be built.
! 
!      <br><dt><code>--with-dwarf2</code><dd>Specify that the compiler should
  use DWARF 2 debugging information as the default.
! 
!      <br><dt><code>--enable-targets=all</code><dt><code>--enable-targets=</code><var>target_list</var><dd>Some GCC targets, e.g. powerpc64-linux, build bi-arch compilers. 
  These are compilers that are able to generate either 64-bit or 32-bit
! code.  Typically, the corresponding 32-bit target, e.g. 
  powerpc-linux for powerpc64-linux, only generates 32-bit code.  This
  option enables the 32-bit target to be a bi-arch compiler, which is
  useful when you want a bi-arch compiler that defaults to 32-bit, and
! you are building a bi-arch or multi-arch binutils in a combined tree. 
  On mips-linux, this will build a tri-arch compiler (ABI o32/n32/64),
! defaulted to o32. 
  Currently, this option only affects sparc-linux, powerpc-linux, x86-linux,
  mips-linux and s390-linux.
! 
!      <br><dt><code>--enable-secureplt</code><dd>This option enables <samp><span class="option">-msecure-plt</span></samp> by default for powerpc-linux. 
  See &ldquo;RS/6000 and PowerPC Options&rdquo; in the main manual
! 
!      <br><dt><code>--enable-cld</code><dd>This option enables <samp><span class="option">-mcld</span></samp> by default for 32-bit x86 targets. 
  See &ldquo;i386 and x86-64 Options&rdquo; in the main manual
! 
!      <br><dt><code>--enable-win32-registry</code><dt><code>--enable-win32-registry=</code><var>key</var><dt><code>--disable-win32-registry</code><dd>The <samp><span class="option">--enable-win32-registry</span></samp> option enables Microsoft Windows-hosted GCC
  to look up installations paths in the registry using the following key:
  
!      <pre class="smallexample">          <code>HKEY_LOCAL_MACHINE\SOFTWARE\Free Software Foundation\</code><var>key</var>
! </pre>
!      <p><var>key</var> defaults to GCC version number, and can be overridden by the
! <samp><span class="option">--enable-win32-registry=</span><var>key</var></samp> option.  Vendors and distributors
  who use custom installers are encouraged to provide a different key,
  perhaps one comprised of vendor name and GCC version number, to
  avoid conflict with existing installations.  This feature is enabled
! by default, and can be disabled by <samp><span class="option">--disable-win32-registry</span></samp>
  option.  This option has no effect on the other hosts.
! 
!      <br><dt><code>--nfp</code><dd>Specify that the machine does not have a floating point unit.  This
! option only applies to &lsquo;<samp><span class="samp">m68k-sun-sunos</span><var>n</var></samp>&rsquo;.  On any other
! system, <samp><span class="option">--nfp</span></samp> has no effect.
! 
!      <br><dt><code>--enable-werror</code><dt><code>--disable-werror</code><dt><code>--enable-werror=yes</code><dt><code>--enable-werror=no</code><dd>When you specify this option, it controls whether certain files in the
! compiler are built with <samp><span class="option">-Werror</span></samp> in bootstrap stage2 and later. 
! If you don't specify it, <samp><span class="option">-Werror</span></samp> is turned on for the main
  development trunk.  However it defaults to off for release branches and
! final releases.  The specific files which get <samp><span class="option">-Werror</span></samp> are
  controlled by the Makefiles.
! 
!      <br><dt><code>--enable-checking</code><dt><code>--enable-checking=</code><var>list</var><dd>When you specify this option, the compiler is built to perform internal
  consistency checks of the requested complexity.  This does not change the
  generated code, but adds error checking within the compiler.  This will
  slow down the compiler and may only work properly if you are building
! the compiler with GCC.  This is &lsquo;<samp><span class="samp">yes</span></samp>&rsquo; by default when building
! from SVN or snapshots, but &lsquo;<samp><span class="samp">release</span></samp>&rsquo; for releases.  The default
! for building the stage1 compiler is &lsquo;<samp><span class="samp">yes</span></samp>&rsquo;.  More control
  over the checks may be had by specifying <var>list</var>.  The categories of
! checks available are &lsquo;<samp><span class="samp">yes</span></samp>&rsquo; (most common checks
! &lsquo;<samp><span class="samp">assert,misc,tree,gc,rtlflag,runtime</span></samp>&rsquo;), &lsquo;<samp><span class="samp">no</span></samp>&rsquo; (no checks at
! all), &lsquo;<samp><span class="samp">all</span></samp>&rsquo; (all but &lsquo;<samp><span class="samp">valgrind</span></samp>&rsquo;), &lsquo;<samp><span class="samp">release</span></samp>&rsquo; (cheapest
! checks &lsquo;<samp><span class="samp">assert,runtime</span></samp>&rsquo;) or &lsquo;<samp><span class="samp">none</span></samp>&rsquo; (same as &lsquo;<samp><span class="samp">no</span></samp>&rsquo;). 
! Individual checks can be enabled with these flags &lsquo;<samp><span class="samp">assert</span></samp>&rsquo;,
! &lsquo;<samp><span class="samp">df</span></samp>&rsquo;, &lsquo;<samp><span class="samp">fold</span></samp>&rsquo;, &lsquo;<samp><span class="samp">gc</span></samp>&rsquo;, &lsquo;<samp><span class="samp">gcac</span></samp>&rsquo; &lsquo;<samp><span class="samp">misc</span></samp>&rsquo;, &lsquo;<samp><span class="samp">rtl</span></samp>&rsquo;,
! &lsquo;<samp><span class="samp">rtlflag</span></samp>&rsquo;, &lsquo;<samp><span class="samp">runtime</span></samp>&rsquo;, &lsquo;<samp><span class="samp">tree</span></samp>&rsquo;, and &lsquo;<samp><span class="samp">valgrind</span></samp>&rsquo;.
! 
!      <p>The &lsquo;<samp><span class="samp">valgrind</span></samp>&rsquo; check requires the external <samp><span class="command">valgrind</span></samp>
  simulator, available from <a href="http://valgrind.org/">http://valgrind.org/</a>.  The
! &lsquo;<samp><span class="samp">df</span></samp>&rsquo;, &lsquo;<samp><span class="samp">rtl</span></samp>&rsquo;, &lsquo;<samp><span class="samp">gcac</span></samp>&rsquo; and &lsquo;<samp><span class="samp">valgrind</span></samp>&rsquo; checks are very expensive. 
! To disable all checking, &lsquo;<samp><span class="samp">--disable-checking</span></samp>&rsquo; or
! &lsquo;<samp><span class="samp">--enable-checking=none</span></samp>&rsquo; must be explicitly requested.  Disabling
  assertions will make the compiler and runtime slightly faster but
  increase the risk of undetected internal errors causing wrong code to be
  generated.
! 
!      <br><dt><code>--disable-stage1-checking</code><dt><code>--enable-stage1-checking</code><dt><code>--enable-stage1-checking=</code><var>list</var><dd>If no <samp><span class="option">--enable-checking</span></samp> option is specified the stage1
! compiler will be built with &lsquo;<samp><span class="samp">yes</span></samp>&rsquo; checking enabled, otherwise
  the stage1 checking flags are the same as specified by
! <samp><span class="option">--enable-checking</span></samp>.  To build the stage1 compiler with
! different checking options use <samp><span class="option">--enable-stage1-checking</span></samp>. 
! The list of checking options is the same as for <samp><span class="option">--enable-checking</span></samp>. 
  If your system is too slow or too small to bootstrap a released compiler
! with checking for stage1 enabled, you can use &lsquo;<samp><span class="samp">--disable-stage1-checking</span></samp>&rsquo;
  to disable checking for the stage1 compiler.
! 
!      <br><dt><code>--enable-coverage</code><dt><code>--enable-coverage=</code><var>level</var><dd>With this option, the compiler is built to collect self coverage
  information, every time it is run.  This is for internal development
  purposes, and only works when the compiler is being built with gcc.  The
  <var>level</var> argument controls whether the compiler is built optimized or
! not, values are &lsquo;<samp><span class="samp">opt</span></samp>&rsquo; and &lsquo;<samp><span class="samp">noopt</span></samp>&rsquo;.  For coverage analysis you
  want to disable optimization, for performance analysis you want to
  enable optimization.  When coverage is enabled, the default level is
  without optimization.
! 
!      <br><dt><code>--enable-gather-detailed-mem-stats</code><dd>When this option is specified more detailed information on memory
  allocation is gathered.  This information is printed when using
! <samp><span class="option">-fmem-report</span></samp>.
! 
!      <br><dt><code>--enable-nls</code><dt><code>--disable-nls</code><dd>The <samp><span class="option">--enable-nls</span></samp> option enables Native Language Support (NLS),
  which lets GCC output diagnostics in languages other than American
  English.  Native Language Support is enabled by default if not doing a
! canadian cross build.  The <samp><span class="option">--disable-nls</span></samp> option disables NLS.
! 
!      <br><dt><code>--with-included-gettext</code><dd>If NLS is enabled, the <samp><span class="option">--with-included-gettext</span></samp> option causes the build
! procedure to prefer its copy of GNU <samp><span class="command">gettext</span></samp>.
! 
!      <br><dt><code>--with-catgets</code><dd>If NLS is enabled, and if the host lacks <code>gettext</code> but has the
  inferior <code>catgets</code> interface, the GCC build procedure normally
! ignores <code>catgets</code> and instead uses GCC's copy of the GNU
! <code>gettext</code> library.  The <samp><span class="option">--with-catgets</span></samp> option causes the
! build procedure to use the host's <code>catgets</code> in this situation.
! 
!      <br><dt><code>--with-libiconv-prefix=</code><var>dir</var><dd>Search for libiconv header files in <samp><var>dir</var><span class="file">/include</span></samp> and
! libiconv library files in <samp><var>dir</var><span class="file">/lib</span></samp>.
! 
!      <br><dt><code>--enable-obsolete</code><dd>Enable configuration for an obsoleted system.  If you attempt to
  configure GCC for a system (build, host, or target) which has been
  obsoleted, and you do not specify this flag, configure will halt with an
  error message.
! 
!      <p>All support for systems which have been obsoleted in one release of GCC
  is removed entirely in the next major release, unless someone steps
  forward to maintain the port.
! 
!      <br><dt><code>--enable-decimal-float</code><dt><code>--enable-decimal-float=yes</code><dt><code>--enable-decimal-float=no</code><dt><code>--enable-decimal-float=bid</code><dt><code>--enable-decimal-float=dpd</code><dt><code>--disable-decimal-float</code><dd>Enable (or disable) support for the C decimal floating point extension
  that is in the IEEE 754-2008 standard.  This is enabled by default only
  on PowerPC, i386, and x86_64 GNU/Linux systems.  Other systems may also
  support it, but require the user to specifically enable it.  You can
  optionally control which decimal floating point format is used (either
! &lsquo;<samp><span class="samp">bid</span></samp>&rsquo; or &lsquo;<samp><span class="samp">dpd</span></samp>&rsquo;).  The &lsquo;<samp><span class="samp">bid</span></samp>&rsquo; (binary integer decimal)
! format is default on i386 and x86_64 systems, and the &lsquo;<samp><span class="samp">dpd</span></samp>&rsquo;
  (densely packed decimal) format is default on PowerPC systems.
! 
!      <br><dt><code>--enable-fixed-point</code><dt><code>--disable-fixed-point</code><dd>Enable (or disable) support for C fixed-point arithmetic. 
  This option is enabled by default for some targets (such as MIPS) which
  have hardware-support for fixed-point operations.  On other targets, you
  may enable this option manually.
! 
!      <br><dt><code>--with-long-double-128</code><dd>Specify if <code>long double</code> type should be 128-bit by default on selected
  GNU/Linux architectures.  If using <code>--without-long-double-128</code>,
! <code>long double</code> will be by default 64-bit, the same as <code>double</code> type. 
  When neither of these configure options are used, the default will be
  128-bit <code>long double</code> when built against GNU C Library 2.4 and later,
  64-bit <code>long double</code> otherwise.
! 
!      <br><dt><code>--with-gmp=</code><var>pathname</var><dt><code>--with-gmp-include=</code><var>pathname</var><dt><code>--with-gmp-lib=</code><var>pathname</var><dt><code>--with-mpfr=</code><var>pathname</var><dt><code>--with-mpfr-include=</code><var>pathname</var><dt><code>--with-mpfr-lib=</code><var>pathname</var><dt><code>--with-mpc=</code><var>pathname</var><dt><code>--with-mpc-include=</code><var>pathname</var><dt><code>--with-mpc-lib=</code><var>pathname</var><dd>If you want to build GCC but do not have the GMP library, the MPFR
  library and/or the MPC library installed in a standard location and
  do not have their sources present in the GCC source tree then you
  can explicitly specify the directory where they are installed
! (&lsquo;<samp><span class="samp">--with-gmp=</span><var>gmpinstalldir</var></samp>&rsquo;,
! &lsquo;<samp><span class="samp">--with-mpfr=</span><var>mpfrinstalldir</var></samp>&rsquo;,
! &lsquo;<samp><span class="samp">--with-mpc=</span><var>mpcinstalldir</var></samp>&rsquo;).  The
! <samp><span class="option">--with-gmp=</span><var>gmpinstalldir</var></samp> option is shorthand for
! <samp><span class="option">--with-gmp-lib=</span><var>gmpinstalldir</var><span class="option">/lib</span></samp> and
! <samp><span class="option">--with-gmp-include=</span><var>gmpinstalldir</var><span class="option">/include</span></samp>.  Likewise the
! <samp><span class="option">--with-mpfr=</span><var>mpfrinstalldir</var></samp> option is shorthand for
! <samp><span class="option">--with-mpfr-lib=</span><var>mpfrinstalldir</var><span class="option">/lib</span></samp> and
! <samp><span class="option">--with-mpfr-include=</span><var>mpfrinstalldir</var><span class="option">/include</span></samp>, also the
! <samp><span class="option">--with-mpc=</span><var>mpcinstalldir</var></samp> option is shorthand for
! <samp><span class="option">--with-mpc-lib=</span><var>mpcinstalldir</var><span class="option">/lib</span></samp> and
! <samp><span class="option">--with-mpc-include=</span><var>mpcinstalldir</var><span class="option">/include</span></samp>.  If these
  shorthand assumptions are not correct, you can use the explicit
  include and lib options directly.  You might also need to ensure the
  shared libraries can be found by the dynamic linker when building and
  using GCC, for example by setting the runtime shared library path
! variable (<samp><span class="env">LD_LIBRARY_PATH</span></samp> on GNU/Linux and Solaris systems).
! 
!      <p>These flags are applicable to the host platform only.  When building
  a cross compiler, they will not be used to configure target libraries.
! 
!      <br><dt><code>--with-isl=</code><var>pathname</var><dt><code>--with-isl-include=</code><var>pathname</var><dt><code>--with-isl-lib=</code><var>pathname</var><dd>If you do not have the ISL library installed in a standard location and you
  want to build GCC, you can explicitly specify the directory where it is
! installed (&lsquo;<samp><span class="samp">--with-isl=</span><var>islinstalldir</var></samp>&rsquo;). The
! <samp><span class="option">--with-isl=</span><var>islinstalldir</var></samp> option is shorthand for
! <samp><span class="option">--with-isl-lib=</span><var>islinstalldir</var><span class="option">/lib</span></samp> and
! <samp><span class="option">--with-isl-include=</span><var>islinstalldir</var><span class="option">/include</span></samp>. If this
  shorthand assumption is not correct, you can use the explicit
  include and lib options directly.
! 
!      <p>These flags are applicable to the host platform only.  When building
  a cross compiler, they will not be used to configure target libraries.
! 
!      <br><dt><code>--with-host-libstdcxx=</code><var>linker-args</var><dd>If you are linking with a static copy of PPL, you can use this option
  to specify how the linker should find the standard C++ library used
  internally by PPL.  Typical values of <var>linker-args</var> might be
! &lsquo;<samp><span class="samp">-lstdc++</span></samp>&rsquo; or &lsquo;<samp><span class="samp">-Wl,-Bstatic,-lstdc++,-Bdynamic -lm</span></samp>&rsquo;.  If you are
  linking with a shared copy of PPL, you probably do not need this
  option; shared library dependencies will cause the linker to search
  for the standard C++ library automatically.
! 
!      <br><dt><code>--with-stage1-ldflags=</code><var>flags</var><dd>This option may be used to set linker flags to be used when linking
  stage 1 of GCC.  These are also used when linking GCC if configured with
! <samp><span class="option">--disable-bootstrap</span></samp>.  By default no special flags are used.
! 
!      <br><dt><code>--with-stage1-libs=</code><var>libs</var><dd>This option may be used to set libraries to be used when linking stage 1
  of GCC.  These are also used when linking GCC if configured with
! <samp><span class="option">--disable-bootstrap</span></samp>.  The default is the argument to
! <samp><span class="option">--with-host-libstdcxx</span></samp>, if specified.
! 
!      <br><dt><code>--with-boot-ldflags=</code><var>flags</var><dd>This option may be used to set linker flags to be used when linking
  stage 2 and later when bootstrapping GCC.  If neither &ndash;with-boot-libs
  nor &ndash;with-host-libstdcxx is set to a value, then the default is
! &lsquo;<samp><span class="samp">-static-libstdc++ -static-libgcc</span></samp>&rsquo;.
! 
!      <br><dt><code>--with-boot-libs=</code><var>libs</var><dd>This option may be used to set libraries to be used when linking stage 2
  and later when bootstrapping GCC.  The default is the argument to
! <samp><span class="option">--with-host-libstdcxx</span></samp>, if specified.
! 
!      <br><dt><code>--with-debug-prefix-map=</code><var>map</var><dd>Convert source directory names using <samp><span class="option">-fdebug-prefix-map</span></samp> when
  building runtime libraries.  &lsquo;<samp><var>map</var></samp>&rsquo; is a space-separated
! list of maps of the form &lsquo;<samp><var>old</var><span class="samp">=</span><var>new</var></samp>&rsquo;.
! 
!      <br><dt><code>--enable-linker-build-id</code><dd>Tells GCC to pass <samp><span class="option">--build-id</span></samp> option to the linker for all final
! links (links performed without the <samp><span class="option">-r</span></samp> or <samp><span class="option">--relocatable</span></samp>
  option), if the linker supports it.  If you specify
! <samp><span class="option">--enable-linker-build-id</span></samp>, but your linker does not
! support <samp><span class="option">--build-id</span></samp> option, a warning is issued and the
! <samp><span class="option">--enable-linker-build-id</span></samp> option is ignored.  The default is off.
! 
!      <br><dt><code>--with-linker-hash-style=</code><var>choice</var><dd>Tells GCC to pass <samp><span class="option">--hash-style=</span><var>choice</var></samp> option to the
  linker for all final links. <var>choice</var> can be one of
! &lsquo;<samp><span class="samp">sysv</span></samp>&rsquo;, &lsquo;<samp><span class="samp">gnu</span></samp>&rsquo;, and &lsquo;<samp><span class="samp">both</span></samp>&rsquo; where &lsquo;<samp><span class="samp">sysv</span></samp>&rsquo; is the default.
! 
!      <br><dt><code>--enable-gnu-unique-object</code><dt><code>--disable-gnu-unique-object</code><dd>Tells GCC to use the gnu_unique_object relocation for C++ template
  static data members and inline function local statics.  Enabled by
  default for a toolchain with an assembler that accepts it and
  GLIBC 2.11 or above, otherwise disabled.
! 
!      <br><dt><code>--with-diagnostics-color=</code><var>choice</var><dd>Tells GCC to use <var>choice</var> as the default for <samp><span class="option">-fdiagnostics-color=</span></samp>
  option (if not used explicitly on the command line).  <var>choice</var>
! can be one of &lsquo;<samp><span class="samp">never</span></samp>&rsquo;, &lsquo;<samp><span class="samp">auto</span></samp>&rsquo;, &lsquo;<samp><span class="samp">always</span></samp>&rsquo;, and &lsquo;<samp><span class="samp">auto-if-env</span></samp>&rsquo;
! where &lsquo;<samp><span class="samp">auto</span></samp>&rsquo; is the default.  &lsquo;<samp><span class="samp">auto-if-env</span></samp>&rsquo; means that
! <samp><span class="option">-fdiagnostics-color=auto</span></samp> will be the default if <code>GCC_COLORS</code>
  is present and non-empty in the environment, and
! <samp><span class="option">-fdiagnostics-color=never</span></samp> otherwise.
! 
!      <br><dt><code>--enable-lto</code><dt><code>--disable-lto</code><dd>Enable support for link-time optimization (LTO).  This is enabled by
! default, and may be disabled using <samp><span class="option">--disable-lto</span></samp>.
! 
!      <br><dt><code>--enable-linker-plugin-configure-flags=FLAGS</code><dt><code>--enable-linker-plugin-flags=FLAGS</code><dd>By default, linker plugins (such as the LTO plugin) are built for the
  host system architecture.  For the case that the linker has a
  different (but run-time compatible) architecture, these flags can be
  specified to build plugins that are compatible to the linker.  For
  example, if you are building GCC for a 64-bit x86_64
! (&lsquo;<samp><span class="samp">x86_64-unknown-linux-gnu</span></samp>&rsquo;) host system, but have a 32-bit x86
! GNU/Linux (&lsquo;<samp><span class="samp">i686-pc-linux-gnu</span></samp>&rsquo;) linker executable (which is
  executable on the former system), you can configure GCC as follows for
  getting compatible linker plugins:
  
!      <pre class="smallexample">          % <var>srcdir</var>/configure \
!               --host=x86_64-unknown-linux-gnu \
!               --enable-linker-plugin-configure-flags=--host=i686-pc-linux-gnu \
!               --enable-linker-plugin-flags='CC=gcc\ -m32\ -Wl,-rpath,[...]/i686-pc-linux-gnu/lib'
! </pre>
!      <br><dt><code>--with-plugin-ld=</code><var>pathname</var><dd>Enable an alternate linker to be used at link-time optimization (LTO)
! link time when <samp><span class="option">-fuse-linker-plugin</span></samp> is enabled. 
  This linker should have plugin support such as gold starting with
! version 2.20 or GNU ld starting with version 2.21. 
! See <samp><span class="option">-fuse-linker-plugin</span></samp> for details.
! 
!      <br><dt><code>--enable-canonical-system-headers</code><dt><code>--disable-canonical-system-headers</code><dd>Enable system header path canonicalization for <samp><span class="file">libcpp</span></samp>.  This can
  produce shorter header file paths in diagnostics and dependency output
  files, but these changed header paths may conflict with some compilation
  environments.  Enabled by default, and may be disabled using
! <samp><span class="option">--disable-canonical-system-headers</span></samp>.
! 
!      <br><dt><code>--with-glibc-version=</code><var>major</var><code>.</code><var>minor</var><dd>Tell GCC that when the GNU C Library (glibc) is used on the target it
  will be version <var>major</var>.<var>minor</var> or later.  Normally this can
! be detected from the C library's header files, but this option may be
  needed when bootstrapping a cross toolchain without the header files
  available for building the initial bootstrap compiler.
! 
!      <p>If GCC is configured with some multilibs that use glibc and some that
! do not, this option applies only to the multilibs that use glibc. 
  However, such configurations may not work well as not all the relevant
  configuration in GCC is on a per-multilib basis.
! 
!      <br><dt><code>--enable-as-accelerator-for=</code><var>target</var><dd>Build as offload target compiler. Specify offload host triple by <var>target</var>.
! 
!      <br><dt><code>--enable-offload-targets=</code><var>target1</var><code>[=</code><var>path1</var><code>],...,</code><var>targetN</var><code>[=</code><var>pathN</var><code>]</code><dd>Enable offloading to targets <var>target1</var>, <small class="dots">...</small>, <var>targetN</var>. 
  Offload compilers are expected to be already installed.  Default search
  path for them is <samp><var>exec-prefix</var></samp>, but it can be changed by
! specifying paths <var>path1</var>, <small class="dots">...</small>, <var>pathN</var>.
! 
!      <pre class="smallexample">          % <var>srcdir</var>/configure \
!               --enable-offload-target=i686-unknown-linux-gnu=/path/to/i686/compiler,x86_64-pc-linux-gnu
! </pre>
!      </dl>
! 
! <h4 class="subheading"><a name="TOC3"></a>Cross-Compiler-Specific Options</h4>
  
  <p>The following options only apply to building cross compilers.
! 
!      <dl>
! <dt><code>--with-sysroot</code><dt><code>--with-sysroot=</code><var>dir</var><dd>Tells GCC to consider <var>dir</var> as the root of a tree that contains
! (a subset of) the root filesystem of the target operating system. 
  Target system headers, libraries and run-time object files will be
  searched for in there.  More specifically, this acts as if
! <samp><span class="option">--sysroot=</span><var>dir</var></samp> was added to the default options of the built
  compiler.  The specified directory is not copied into the
! install tree, unlike the options <samp><span class="option">--with-headers</span></samp> and
! <samp><span class="option">--with-libs</span></samp> that this option obsoletes.  The default value,
! in case <samp><span class="option">--with-sysroot</span></samp> is not given an argument, is
! <samp><span class="option">${gcc_tooldir}/sys-root</span></samp>.  If the specified directory is a
! subdirectory of <samp><span class="option">${exec_prefix}</span></samp>, then it will be found relative to
  the GCC binaries if the installation tree is moved.
! 
!      <p>This option affects the system root for the compiler used to build
  target libraries (which runs on the build system) and the compiler newly
  installed with <code>make install</code>; it does not affect the compiler which is
  used to build GCC itself.
! 
!      <p>If you specify the <samp><span class="option">--with-native-system-header-dir=</span><var>dirname</var></samp>
  option then the compiler will search that directory within <var>dirname</var> for
! native system headers rather than the default <samp><span class="file">/usr/include</span></samp>.
! 
!      <br><dt><code>--with-build-sysroot</code><dt><code>--with-build-sysroot=</code><var>dir</var><dd>Tells GCC to consider <var>dir</var> as the system root (see
! <samp><span class="option">--with-sysroot</span></samp>) while building target libraries, instead of
! the directory specified with <samp><span class="option">--with-sysroot</span></samp>.  This option is
! only useful when you are already using <samp><span class="option">--with-sysroot</span></samp>.  You
! can use <samp><span class="option">--with-build-sysroot</span></samp> when you are configuring with
! <samp><span class="option">--prefix</span></samp> set to a directory that is different from the one in
  which you are installing GCC and your target libraries.
! 
!      <p>This option affects the system root for the compiler used to build
  target libraries (which runs on the build system); it does not affect
  the compiler which is used to build GCC itself.
! 
!      <p>If you specify the <samp><span class="option">--with-native-system-header-dir=</span><var>dirname</var></samp>
  option then the compiler will search that directory within <var>dirname</var> for
! native system headers rather than the default <samp><span class="file">/usr/include</span></samp>.
! 
!      <br><dt><code>--with-headers</code><dt><code>--with-headers=</code><var>dir</var><dd>Deprecated in favor of <samp><span class="option">--with-sysroot</span></samp>. 
! Specifies that target headers are available when building a cross compiler. 
  The <var>dir</var> argument specifies a directory which has the target include
! files.  These include files will be copied into the <samp><span class="file">gcc</span></samp> install
! directory.  <em>This option with the </em><var>dir</var><em> argument is required</em> when
! building a cross compiler, if <samp><var>prefix</var><span class="file">/</span><var>target</var><span class="file">/sys-include</span></samp>
! doesn't pre-exist.  If <samp><var>prefix</var><span class="file">/</span><var>target</var><span class="file">/sys-include</span></samp> does
! pre-exist, the <var>dir</var> argument may be omitted.  <samp><span class="command">fixincludes</span></samp>
  will be run on these files to make them compatible with GCC.
! 
!      <br><dt><code>--without-headers</code><dd>Tells GCC not use any target headers from a libc when building a cross
  compiler.  When crossing to GNU/Linux, you need the headers so GCC
  can build the exception handling for libgcc.
! 
!      <br><dt><code>--with-libs</code><dt><code>--with-libs="</code><var>dir1</var> <var>dir2</var><code> ... </code><var>dirN</var><code>"</code><dd>Deprecated in favor of <samp><span class="option">--with-sysroot</span></samp>. 
  Specifies a list of directories which contain the target runtime
! libraries.  These libraries will be copied into the <samp><span class="file">gcc</span></samp> install
  directory.  If the directory list is omitted, this option has no
  effect.
! 
!      <br><dt><code>--with-newlib</code><dd>Specifies that &lsquo;<samp><span class="samp">newlib</span></samp>&rsquo; is
  being used as the target C library.  This causes <code>__eprintf</code> to be
! omitted from <samp><span class="file">libgcc.a</span></samp> on the assumption that it will be provided by
! &lsquo;<samp><span class="samp">newlib</span></samp>&rsquo;.
! 
!      <br><dt><code>--with-avrlibc</code><dd>Specifies that &lsquo;<samp><span class="samp">AVR-Libc</span></samp>&rsquo; is
  being used as the target C library.  This causes float support
! functions like <code>__addsf3</code> to be omitted from <samp><span class="file">libgcc.a</span></samp> on
! the assumption that it will be provided by <samp><span class="file">libm.a</span></samp>.  For more
! technical details, cf. <a href="http://gcc.gnu.org/PR54461">PR54461</a>. 
  This option is only supported for the AVR target.  It is not supported for
  RTEMS configurations, which currently use newlib.  The option is
  supported since version 4.7.2 and is the default in 4.8.0 and newer.
! 
!      <br><dt><code>--with-nds32-lib=</code><var>library</var><dd>Specifies that <var>library</var> setting is used for building <samp><span class="file">libgcc.a</span></samp>. 
! Currently, the valid <var>library</var> is &lsquo;<samp><span class="samp">newlib</span></samp>&rsquo; or &lsquo;<samp><span class="samp">mculib</span></samp>&rsquo;. 
  This option is only supported for the NDS32 target.
! 
!      <br><dt><code>--with-build-time-tools=</code><var>dir</var><dd>Specifies where to find the set of target tools (assembler, linker, etc.) 
  that will be used while building GCC itself.  This option can be useful
  if the directory layouts are different between the system you are building
  GCC on, and the system where you will deploy it.
! 
!      <p>For example, on an &lsquo;<samp><span class="samp">ia64-hp-hpux</span></samp>&rsquo; system, you may have the GNU
! assembler and linker in <samp><span class="file">/usr/bin</span></samp>, and the native tools in a
  different path, and build a toolchain that expects to find the
! native tools in <samp><span class="file">/usr/bin</span></samp>.
  
!      <p>When you use this option, you should ensure that <var>dir</var> includes
! <samp><span class="command">ar</span></samp>, <samp><span class="command">as</span></samp>, <samp><span class="command">ld</span></samp>, <samp><span class="command">nm</span></samp>,
! <samp><span class="command">ranlib</span></samp> and <samp><span class="command">strip</span></samp> if necessary, and possibly
! <samp><span class="command">objdump</span></samp>.  Otherwise, GCC may use an inconsistent set of
! tools. 
  </dl>
  
! <h4 class="subheading"><a name="TOC4"></a>Java-Specific Options</h4>
  
  <p>The following option applies to the build of the Java front end.
! 
!      <dl>
! <dt><code>--disable-libgcj</code><dd>Specify that the run-time libraries
  used by GCJ should not be built.  This is useful in case you intend
! to use GCJ with some other run-time, or you're going to install it
  separately, or it just happens not to build on your particular
  machine.  In general, if the Java front end is enabled, the GCJ
! libraries will be enabled too, unless they're known to not work on
! the target platform.  If GCJ is enabled but &lsquo;<samp><span class="samp">libgcj</span></samp>&rsquo; isn't built, you
  may need to port it; in this case, before modifying the top-level
! <samp><span class="file">configure.in</span></samp> so that &lsquo;<samp><span class="samp">libgcj</span></samp>&rsquo; is enabled by default on this platform,
! you may use <samp><span class="option">--enable-libgcj</span></samp> to override the default.
! 
!    </dl>
! 
!    <p>The following options apply to building &lsquo;<samp><span class="samp">libgcj</span></samp>&rsquo;.
  
! <h5 class="subsubheading"><a name="TOC5"></a>General Options</h5>
  
!      <dl>
! <dt><code>--enable-java-maintainer-mode</code><dd>By default the &lsquo;<samp><span class="samp">libjava</span></samp>&rsquo; build will not attempt to compile the
! <samp><span class="file">.java</span></samp> source files to <samp><span class="file">.class</span></samp>.  Instead, it will use the
! <samp><span class="file">.class</span></samp> files from the source tree.  If you use this option you
! must have executables named <samp><span class="command">ecj1</span></samp> and <samp><span class="command">gjavah</span></samp> in your path
  for use by the build.  You must use this option if you intend to
! modify any <samp><span class="file">.java</span></samp> files in <samp><span class="file">libjava</span></samp>.
! 
!      <br><dt><code>--with-java-home=</code><var>dirname</var><dd>This &lsquo;<samp><span class="samp">libjava</span></samp>&rsquo; option overrides the default value of the
! &lsquo;<samp><span class="samp">java.home</span></samp>&rsquo; system property.  It is also used to set
! &lsquo;<samp><span class="samp">sun.boot.class.path</span></samp>&rsquo; to <samp><var>dirname</var><span class="file">/lib/rt.jar</span></samp>.  By
! default &lsquo;<samp><span class="samp">java.home</span></samp>&rsquo; is set to <samp><var>prefix</var></samp> and
! &lsquo;<samp><span class="samp">sun.boot.class.path</span></samp>&rsquo; to
! <samp><var>datadir</var><span class="file">/java/libgcj-</span><var>version</var><span class="file">.jar</span></samp>.
! 
!      <br><dt><code>--with-ecj-jar=</code><var>filename</var><dd>This option can be used to specify the location of an external jar
  file containing the Eclipse Java compiler.  A specially modified
! version of this compiler is used by <samp><span class="command">gcj</span></samp> to parse
! <samp><span class="file">.java</span></samp> source files.  If this option is given, the
! &lsquo;<samp><span class="samp">libjava</span></samp>&rsquo; build will create and install an <samp><span class="file">ecj1</span></samp> executable
  which uses this jar file at runtime.
! 
!      <p>If this option is not given, but an <samp><span class="file">ecj.jar</span></samp> file is found in
! the topmost source tree at configure time, then the &lsquo;<samp><span class="samp">libgcj</span></samp>&rsquo;
! build will create and install <samp><span class="file">ecj1</span></samp>, and will also install the
! discovered <samp><span class="file">ecj.jar</span></samp> into a suitable place in the install tree.
! 
!      <p>If <samp><span class="file">ecj1</span></samp> is not installed, then the user will have to supply one
! on his path in order for <samp><span class="command">gcj</span></samp> to properly parse <samp><span class="file">.java</span></samp>
  source files.  A suitable jar is available from
  <a href="ftp://sourceware.org/pub/java/">ftp://sourceware.org/pub/java/</a>.
! 
!      <br><dt><code>--disable-getenv-properties</code><dd>Don't set system properties from <samp><span class="env">GCJ_PROPERTIES</span></samp>.
! 
!      <br><dt><code>--enable-hash-synchronization</code><dd>Use a global hash table for monitor locks.  Ordinarily,
! &lsquo;<samp><span class="samp">libgcj</span></samp>&rsquo;'s &lsquo;<samp><span class="samp">configure</span></samp>&rsquo; script automatically makes
  the correct choice for this option for your platform.  Only use
  this if you know you need the library to be configured differently.
! 
!      <br><dt><code>--enable-interpreter</code><dd>Enable the Java interpreter.  The interpreter is automatically
  enabled by default on all platforms that support it.  This option
  is really only useful if you want to disable the interpreter
! (using <samp><span class="option">--disable-interpreter</span></samp>).
! 
!      <br><dt><code>--disable-java-net</code><dd>Disable java.net.  This disables the native part of java.net only,
  using non-functional stubs for native method implementations.
! 
!      <br><dt><code>--disable-jvmpi</code><dd>Disable JVMPI support.
! 
!      <br><dt><code>--disable-libgcj-bc</code><dd>Disable BC ABI compilation of certain parts of libgcj.  By default,
! some portions of libgcj are compiled with <samp><span class="option">-findirect-dispatch</span></samp>
! and <samp><span class="option">-fno-indirect-classes</span></samp>, allowing them to be overridden at
  run-time.
! 
!      <p>If <samp><span class="option">--disable-libgcj-bc</span></samp> is specified, libgcj is built without
  these options.  This allows the compile-time linker to resolve
  dependencies when statically linking to libgcj.  However it makes it
  impossible to override the affected portions of libgcj at run-time.
! 
!      <br><dt><code>--enable-reduced-reflection</code><dd>Build most of libgcj with <samp><span class="option">-freduced-reflection</span></samp>.  This reduces
  the size of libgcj at the expense of not being able to do accurate
  reflection on the classes it contains.  This option is safe if you
  know that code using libgcj will never use reflection on the standard
  runtime classes in libgcj (including using serialization, RMI or CORBA).
! 
!      <br><dt><code>--with-ecos</code><dd>Enable runtime eCos target support.
! 
!      <br><dt><code>--without-libffi</code><dd>Don't use &lsquo;<samp><span class="samp">libffi</span></samp>&rsquo;.  This will disable the interpreter and JNI
! support as well, as these require &lsquo;<samp><span class="samp">libffi</span></samp>&rsquo; to work.
! 
!      <br><dt><code>--enable-libgcj-debug</code><dd>Enable runtime debugging code.
! 
!      <br><dt><code>--enable-libgcj-multifile</code><dd>If specified, causes all <samp><span class="file">.java</span></samp> source files to be
! compiled into <samp><span class="file">.class</span></samp> files in one invocation of
! &lsquo;<samp><span class="samp">gcj</span></samp>&rsquo;.  This can speed up build time, but is more
  resource-intensive.  If this option is unspecified or
! disabled, &lsquo;<samp><span class="samp">gcj</span></samp>&rsquo; is invoked once for each <samp><span class="file">.java</span></samp>
! file to compile into a <samp><span class="file">.class</span></samp> file.
! 
!      <br><dt><code>--with-libiconv-prefix=DIR</code><dd>Search for libiconv in <samp><span class="file">DIR/include</span></samp> and <samp><span class="file">DIR/lib</span></samp>.
! 
!      <br><dt><code>--enable-sjlj-exceptions</code><dd>Force use of the <code>setjmp</code>/<code>longjmp</code>-based scheme for exceptions. 
! &lsquo;<samp><span class="samp">configure</span></samp>&rsquo; ordinarily picks the correct value based on the platform. 
! Only use this option if you are sure you need a different setting.
! 
!      <br><dt><code>--with-system-zlib</code><dd>Use installed &lsquo;<samp><span class="samp">zlib</span></samp>&rsquo; rather than that included with GCC.
! 
!      <br><dt><code>--with-win32-nlsapi=ansi, unicows or unicode</code><dd>Indicates how MinGW &lsquo;<samp><span class="samp">libgcj</span></samp>&rsquo; translates between UNICODE
  characters and the Win32 API.
! 
!      <br><dt><code>--enable-java-home</code><dd>If enabled, this creates a JPackage compatible SDK environment during install. 
  Note that if &ndash;enable-java-home is used, &ndash;with-arch-directory=ARCH must also
  be specified.
! 
!      <br><dt><code>--with-arch-directory=ARCH</code><dd>Specifies the name to use for the <samp><span class="file">jre/lib/ARCH</span></samp> directory in the SDK
  environment created when &ndash;enable-java-home is passed. Typical names for this
  directory include i386, amd64, ia64, etc.
! 
!      <br><dt><code>--with-os-directory=DIR</code><dd>Specifies the OS directory for the SDK include directory. This is set to auto
! detect, and is typically 'linux'.
! 
!      <br><dt><code>--with-origin-name=NAME</code><dd>Specifies the JPackage origin name. This defaults to the 'gcj' in
  java-1.5.0-gcj.
! 
!      <br><dt><code>--with-arch-suffix=SUFFIX</code><dd>Specifies the suffix for the sdk directory. Defaults to the empty string. 
! Examples include '.x86_64' in 'java-1.5.0-gcj-1.5.0.0.x86_64'.
! 
!      <br><dt><code>--with-jvm-root-dir=DIR</code><dd>Specifies where to install the SDK. Default is $(prefix)/lib/jvm.
! 
!      <br><dt><code>--with-jvm-jar-dir=DIR</code><dd>Specifies where to install jars. Default is $(prefix)/lib/jvm-exports.
! 
!      <br><dt><code>--with-python-dir=DIR</code><dd>Specifies where to install the Python modules used for aot-compile. DIR should
  not include the prefix used in installation. For example, if the Python modules
  are to be installed in /usr/lib/python2.5/site-packages, then
  &ndash;with-python-dir=/lib/python2.5/site-packages should be passed. If this is
  not specified, then the Python modules are installed in $(prefix)/share/python.
! 
!      <br><dt><code>--enable-aot-compile-rpm</code><dd>Adds aot-compile-rpm to the list of installed scripts.
! 
!      <br><dt><code>--enable-browser-plugin</code><dd>Build the gcjwebplugin web browser plugin.
! 
!      <br><dt><code>--enable-static-libjava</code><dd>Build static libraries in libjava. The default is to only build shared
  libraries.
! 
!           <dl>
! <dt><code>ansi</code><dd>Use the single-byte <code>char</code> and the Win32 A functions natively,
  translating to and from UNICODE when using these functions.  If
  unspecified, this is the default.
! 
!           <br><dt><code>unicows</code><dd>Use the <code>WCHAR</code> and Win32 W functions natively.  Adds
! <code>-lunicows</code> to <samp><span class="file">libgcj.spec</span></samp> to link with &lsquo;<samp><span class="samp">libunicows</span></samp>&rsquo;. 
! <samp><span class="file">unicows.dll</span></samp> needs to be deployed on Microsoft Windows 9X machines
! running built executables.  <samp><span class="file">libunicows.a</span></samp>, an open-source
! import library around Microsoft's <code>unicows.dll</code>, is obtained from
  <a href="http://libunicows.sourceforge.net/">http://libunicows.sourceforge.net/</a>, which also gives details
! on getting <samp><span class="file">unicows.dll</span></samp> from Microsoft.
! 
!           <br><dt><code>unicode</code><dd>Use the <code>WCHAR</code> and Win32 W functions natively.  Does <em>not</em>
! add <code>-lunicows</code> to <samp><span class="file">libgcj.spec</span></samp>.  The built executables will
! only run on Microsoft Windows NT and above. 
  </dl>
-      </dl>
- 
- <h5 class="subsubheading"><a name="TOC6"></a>AWT-Specific Options</h5>
- 
-      <dl>
- <dt><code>--with-x</code><dd>Use the X Window System.
- 
-      <br><dt><code>--enable-java-awt=PEER(S)</code><dd>Specifies the AWT peer library or libraries to build alongside
- &lsquo;<samp><span class="samp">libgcj</span></samp>&rsquo;.  If this option is unspecified or disabled, AWT
- will be non-functional.  Current valid values are <samp><span class="option">gtk</span></samp> and
- <samp><span class="option">xlib</span></samp>.  Multiple libraries should be separated by a
- comma (i.e. <samp><span class="option">--enable-java-awt=gtk,xlib</span></samp>).
- 
-      <br><dt><code>--enable-gtk-cairo</code><dd>Build the cairo Graphics2D implementation on GTK.
- 
-      <br><dt><code>--enable-java-gc=TYPE</code><dd>Choose garbage collector.  Defaults to <samp><span class="option">boehm</span></samp> if unspecified.
- 
-      <br><dt><code>--disable-gtktest</code><dd>Do not try to compile and run a test GTK+ program.
  
!      <br><dt><code>--disable-glibtest</code><dd>Do not try to compile and run a test GLIB program.
  
!      <br><dt><code>--with-libart-prefix=PFX</code><dd>Prefix where libart is installed (optional).
  
-      <br><dt><code>--with-libart-exec-prefix=PFX</code><dd>Exec prefix where libart is installed (optional).
  
!      <br><dt><code>--disable-libarttest</code><dd>Do not try to compile and run a test libart program.
  
- </dl>
  
- <h5 class="subsubheading"><a name="TOC7"></a>Overriding <samp><span class="command">configure</span></samp> test results</h5>
  
- <p>Sometimes, it might be necessary to override the result of some
- <samp><span class="command">configure</span></samp> test, for example in order to ease porting to a new
- system or work around a bug in a test.  The toplevel <samp><span class="command">configure</span></samp>
- script provides three variables for this:
  
-      <dl>
- <dt><code>build_configargs</code><dd><a name="index-g_t_0040code_007bbuild_005fconfigargs_007d-3"></a>The contents of this variable is passed to all build <samp><span class="command">configure</span></samp>
- scripts.
  
-      <br><dt><code>host_configargs</code><dd><a name="index-g_t_0040code_007bhost_005fconfigargs_007d-4"></a>The contents of this variable is passed to all host <samp><span class="command">configure</span></samp>
- scripts.
  
-      <br><dt><code>target_configargs</code><dd><a name="index-g_t_0040code_007btarget_005fconfigargs_007d-5"></a>The contents of this variable is passed to all target <samp><span class="command">configure</span></samp>
- scripts.
  
-    </dl>
  
-    <p>In order to avoid shell and <samp><span class="command">make</span></samp> quoting issues for complex
- overrides, you can pass a setting for <samp><span class="env">CONFIG_SITE</span></samp> and set
- variables in the site file.
  
-    <p><hr />
- <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- ***Building**************************************************************** -->
- <!-- ***Testing***************************************************************** -->
- <!-- ***Final install*********************************************************** -->
- <!-- ***Binaries**************************************************************** -->
- <!-- ***Specific**************************************************************** -->
- <!-- ***Old documentation****************************************************** -->
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 1,2020 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
  
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
  
  
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <a name="index-Configuration"></a>
! <a name="index-Installing-GCC_003a-Configuration"></a>
! 
! <p>Like most GNU software, GCC must be configured before it can be built.
! This document describes the recommended configuration procedure
! for both native and cross targets.
! </p>
! <p>We use <var>srcdir</var> to refer to the toplevel source directory for
! GCC; we use <var>objdir</var> to refer to the toplevel build/object directory.
! </p>
! <p>If you obtained the sources via SVN, <var>srcdir</var> must refer to the top
! <samp>gcc</samp> directory, the one where the <samp>MAINTAINERS</samp> file can be
! found, and not its <samp>gcc</samp> subdirectory, otherwise the build will fail.
! </p>
! <p>If either <var>srcdir</var> or <var>objdir</var> is located on an automounted NFS
! file system, the shell&rsquo;s built-in <code>pwd</code> command will return
  temporary pathnames.  Using these can lead to various sorts of build
! problems.  To avoid this issue, set the <code>PWDCMD</code> environment
! variable to an automounter-aware <code>pwd</code> command, e.g.,
! <code>pawd</code> or &lsquo;<samp>amq -w</samp>&rsquo;, during the configuration and build
  phases.
! </p>
! <p>First, we <strong>highly</strong> recommend that GCC be built into a
  separate directory from the sources which does <strong>not</strong> reside
  within the source tree.  This is how we generally build GCC; building
! where <var>srcdir</var> == <var>objdir</var> should still work, but doesn&rsquo;t
  get extensive testing; building where <var>objdir</var> is a subdirectory
  of <var>srcdir</var> is unsupported.
! </p>
! <p>If you have previously built GCC in the same directory for a
! different target machine, do &lsquo;<samp>make distclean</samp>&rsquo; to delete all files
! that might be invalid.  One of the files this deletes is <samp>Makefile</samp>;
! if &lsquo;<samp>make distclean</samp>&rsquo; complains that <samp>Makefile</samp> does not exist
! or issues a message like &ldquo;don&rsquo;t know how to make distclean&rdquo; it probably
  means that the directory is already suitably clean.  However, with the
  recommended method of building in a separate <var>objdir</var>, you should
  simply use a different <var>objdir</var> for each target.
! </p>
! <p>Second, when configuring a native system, either <code>cc</code> or
! <code>gcc</code> must be in your path or you must set <code>CC</code> in
  your environment before running configure.  Otherwise the configuration
  scripts may fail.
+ </p>
  
! <p>To configure GCC:
! </p>
! <div class="smallexample">
! <pre class="smallexample">% mkdir <var>objdir</var>
! % cd <var>objdir</var>
! % <var>srcdir</var>/configure [<var>options</var>] [<var>target</var>]
! </pre></div>
  
! <a name="Distributor-options"></a>
! <h3 class="heading">Distributor options</h3>
  
  <p>If you will be distributing binary versions of GCC, with modifications
  to the source code, you should use the options described in this
  section to make clear that your version contains modifications.
! </p>
! <dl compact="compact">
! <dt><code>--with-pkgversion=<var>version</var></code></dt>
! <dd><p>Specify a string that identifies your package.  You may wish
  to include a build number or build date.  This version string will be
! included in the output of <code>gcc --version</code>.  This suffix does
! not replace the default version string, only the &lsquo;<samp>GCC</samp>&rsquo; part.
! </p>
! <p>The default value is &lsquo;<samp>GCC</samp>&rsquo;.
! </p>
! </dd>
! <dt><code>--with-bugurl=<var>url</var></code></dt>
! <dd><p>Specify the URL that users should visit if they wish to report a bug.
  You are of course welcome to forward bugs reported to you to the FSF,
  if you determine that they are not bugs in your modifications.
+ </p>
+ <p>The default value refers to the FSF&rsquo;s GCC bug tracker.
+ </p>
+ </dd>
+ </dl>
  
! <a name="Target-specification"></a>
! <h3 class="heading">Target specification</h3>
! <ul>
! <li> GCC has code to correctly determine the correct value for <var>target</var>
  for nearly all native systems.  Therefore, we highly recommend you do
  not provide a configure target when configuring a native compiler.
  
! </li><li> <var>target</var> must be specified as <samp>--target=<var>target</var></samp>
  when configuring a cross compiler; examples of valid targets would be
  m68k-elf, sh-elf, etc.
  
! </li><li> Specifying just <var>target</var> instead of <samp>--target=<var>target</var></samp>
! implies that the host defaults to <var>target</var>.
! </li></ul>
  
! 
! <a name="Options-specification"></a>
! <h3 class="heading">Options specification</h3>
  
  <p>Use <var>options</var> to override several configure time options for
! GCC.  A list of supported <var>options</var> follows; &lsquo;<samp>configure
! --help</samp>&rsquo; may list other options, but those not listed below may not
  work and should not normally be used.
! </p>
! <p>Note that each <samp>--enable</samp> option has a corresponding
! <samp>--disable</samp> option and that each <samp>--with</samp> option has a
! corresponding <samp>--without</samp> option.
! </p>
! <dl compact="compact">
! <dt><code>--prefix=<var>dirname</var></code></dt>
! <dd><p>Specify the toplevel installation
  directory.  This is the recommended way to install the tools into a directory
  other than the default.  The toplevel installation directory defaults to
! <samp>/usr/local</samp>.
! </p>
! <p>We <strong>highly</strong> recommend against <var>dirname</var> being the same or a
  subdirectory of <var>objdir</var> or vice versa.  If specifying a directory
! beneath a user&rsquo;s home directory tree, some shells will not expand
! <var>dirname</var> correctly if it contains the &lsquo;<samp>~</samp>&rsquo; metacharacter; use
! <code>$HOME</code> instead.
! </p>
! <p>The following standard <code>autoconf</code> options are supported.  Normally you
  should not need to use these options.
! </p><dl compact="compact">
! <dt><code>--exec-prefix=<var>dirname</var></code></dt>
! <dd><p>Specify the toplevel installation directory for architecture-dependent
  files.  The default is <samp><var>prefix</var></samp>.
! </p>
! </dd>
! <dt><code>--bindir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for the executables called by users
! (such as <code>gcc</code> and <code>g++</code>).  The default is
! <samp><var>exec-prefix</var>/bin</samp>.
! </p>
! </dd>
! <dt><code>--libdir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for object code libraries and
! internal data files of GCC.  The default is <samp><var>exec-prefix</var>/lib</samp>.
! </p>
! </dd>
! <dt><code>--libexecdir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for internal executables of GCC.
! The default is <samp><var>exec-prefix</var>/libexec</samp>.
! </p>
! </dd>
! <dt><code>--with-slibdir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for the shared libgcc library.  The
  default is <samp><var>libdir</var></samp>.
! </p>
! </dd>
! <dt><code>--datarootdir=<var>dirname</var></code></dt>
! <dd><p>Specify the root of the directory tree for read-only architecture-independent
! data files referenced by GCC.  The default is <samp><var>prefix</var>/share</samp>.
! </p>
! </dd>
! <dt><code>--infodir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for documentation in info format.
! The default is <samp><var>datarootdir</var>/info</samp>.
! </p>
! </dd>
! <dt><code>--datadir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for some architecture-independent
  data files referenced by GCC.  The default is <samp><var>datarootdir</var></samp>.
! </p>
! </dd>
! <dt><code>--docdir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for documentation files (other
! than Info) for GCC.  The default is <samp><var>datarootdir</var>/doc</samp>.
! </p>
! </dd>
! <dt><code>--htmldir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for HTML documentation files.
  The default is <samp><var>docdir</var></samp>.
! </p>
! </dd>
! <dt><code>--pdfdir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for PDF documentation files.
  The default is <samp><var>docdir</var></samp>.
! </p>
! </dd>
! <dt><code>--mandir=<var>dirname</var></code></dt>
! <dd><p>Specify the installation directory for manual pages.  The default is
! <samp><var>datarootdir</var>/man</samp>.  (Note that the manual pages are only extracts
  from the full GCC manuals, which are provided in Texinfo format.  The manpages
  are derived by an automatic conversion process from parts of the full
  manual.)
! </p>
! </dd>
! <dt><code>--with-gxx-include-dir=<var>dirname</var></code></dt>
! <dd><p>Specify
  the installation directory for G++ header files.  The default depends
  on other configuration options, and differs between cross and native
  configurations.
! </p>
! </dd>
! <dt><code>--with-specs=<var>specs</var></code></dt>
! <dd><p>Specify additional command line driver SPECS.
  This can be useful if you need to turn on a non-standard feature by
! default without modifying the compiler&rsquo;s source code, for instance
! <samp>--with-specs=%{!fcommon:%{!fno-common:-fno-common}}</samp>.
  See &ldquo;Spec Files&rdquo; in the main manual
+ </p>
+ </dd>
+ </dl>
  
! </dd>
! <dt><code>--program-prefix=<var>prefix</var></code></dt>
! <dd><p>GCC supports some transformations of the names of its programs when
  installing them.  This option prepends <var>prefix</var> to the names of
  programs to install in <var>bindir</var> (see above).  For example, specifying
! <samp>--program-prefix=foo-</samp> would result in &lsquo;<samp>gcc</samp>&rsquo;
! being installed as <samp>/usr/local/bin/foo-gcc</samp>.
! </p>
! </dd>
! <dt><code>--program-suffix=<var>suffix</var></code></dt>
! <dd><p>Appends <var>suffix</var> to the names of programs to install in <var>bindir</var>
! (see above).  For example, specifying <samp>--program-suffix=-3.1</samp>
! would result in &lsquo;<samp>gcc</samp>&rsquo; being installed as
! <samp>/usr/local/bin/gcc-3.1</samp>.
! </p>
! </dd>
! <dt><code>--program-transform-name=<var>pattern</var></code></dt>
! <dd><p>Applies the &lsquo;<samp>sed</samp>&rsquo; script <var>pattern</var> to be applied to the names
  of programs to install in <var>bindir</var> (see above).  <var>pattern</var> has to
! consist of one or more basic &lsquo;<samp>sed</samp>&rsquo; editing commands, separated by
! semicolons.  For example, if you want the &lsquo;<samp>gcc</samp>&rsquo; program name to be
! transformed to the installed program <samp>/usr/local/bin/myowngcc</samp> and
! the &lsquo;<samp>g++</samp>&rsquo; program name to be transformed to
! <samp>/usr/local/bin/gspecial++</samp> without changing other program names,
  you could use the pattern
! <samp>--program-transform-name='s/^gcc$/myowngcc/; s/^g++$/gspecial++/'</samp>
  to achieve this effect.
! </p>
! <p>All three options can be combined and used together, resulting in more
  complex conversion patterns.  As a basic rule, <var>prefix</var> (and
  <var>suffix</var>) are prepended (appended) before further transformations
  can happen with a special transformation script <var>pattern</var>.
! </p>
! <p>As currently implemented, this option only takes effect for native
! builds; cross compiler binaries&rsquo; names are not transformed even when a
  transformation is explicitly asked for by one of these options.
! </p>
! <p>For native builds, some of the installed programs are also installed
  with the target alias in front of their name, as in
! &lsquo;<samp>i686-pc-linux-gnu-gcc</samp>&rsquo;.  All of the above transformations happen
  before the target alias is prepended to the name&mdash;so, specifying
! <samp>--program-prefix=foo-</samp> and <samp>program-suffix=-3.1</samp>, the
  resulting binary would be installed as
! <samp>/usr/local/bin/i686-pc-linux-gnu-foo-gcc-3.1</samp>.
! </p>
! <p>As a last shortcoming, none of the installed Ada programs are
  transformed yet, which will be fixed in some time.
! </p>
! </dd>
! <dt><code>--with-local-prefix=<var>dirname</var></code></dt>
! <dd><p>Specify the
  installation directory for local include files.  The default is
! <samp>/usr/local</samp>.  Specify this option if you want the compiler to
! search directory <samp><var>dirname</var>/include</samp> for locally installed
! header files <em>instead</em> of <samp>/usr/local/include</samp>.
! </p>
! <p>You should specify <samp>--with-local-prefix</samp> <strong>only</strong> if your
! site has a different convention (not <samp>/usr/local</samp>) for where to put
  site-specific files.
! </p>
! <p>The default value for <samp>--with-local-prefix</samp> is <samp>/usr/local</samp>
! regardless of the value of <samp>--prefix</samp>.  Specifying
! <samp>--prefix</samp> has no effect on which directory GCC searches for
  local header files.  This may seem counterintuitive, but actually it is
  logical.
! </p>
! <p>The purpose of <samp>--prefix</samp> is to specify where to <em>install
! GCC</em>.  The local header files in <samp>/usr/local/include</samp>&mdash;if you put
  any in that directory&mdash;are not part of GCC.  They are part of other
  programs&mdash;perhaps many others.  (GCC installs its own header files in
! another directory which is based on the <samp>--prefix</samp> value.)
! </p>
! <p>Both the local-prefix include directory and the GCC-prefix include
! directory are part of GCC&rsquo;s &ldquo;system include&rdquo; directories.  Although these
  two directories are not fixed, they need to be searched in the proper
  order for the correct processing of the include_next directive.  The
  local-prefix include directory is searched before the GCC-prefix
  include directory.  Another characteristic of system include directories
  is that pedantic warnings are turned off for headers in these directories.
! </p>
! <p>Some autoconf macros add <samp>-I <var>directory</var></samp> options to the
  compiler command line, to ensure that directories containing installed
! packages&rsquo; headers are searched.  When <var>directory</var> is one of GCC&rsquo;s
  system include directories, GCC will ignore the option so that system
  directories continue to be processed in the correct order.  This
  may result in a search order different from what was specified but the
  directory will still be searched.
! </p>
! <p>GCC automatically searches for ordinary libraries using
! <code>GCC_EXEC_PREFIX</code>.  Thus, when the same installation prefix is
  used for both GCC and packages, GCC will automatically search for
  both headers and libraries.  This provides a configuration that is
  easy to use.  GCC behaves in a manner similar to that when it is
! installed as a system compiler in <samp>/usr</samp>.
! </p>
! <p>Sites that need to install multiple versions of GCC may not want to
  use the above simple configuration.  It is possible to use the
! <samp>--program-prefix</samp>, <samp>--program-suffix</samp> and
! <samp>--program-transform-name</samp> options to install multiple versions
  into a single directory, but it may be simpler to use different prefixes
! and the <samp>--with-local-prefix</samp> option to specify the location of the
  site-specific files for each version.  It will then be necessary for
  users to specify explicitly the location of local site libraries
! (e.g., with <code>LIBRARY_PATH</code>).
! </p>
! <p>The same value can be used for both <samp>--with-local-prefix</samp> and
! <samp>--prefix</samp> provided it is not <samp>/usr</samp>.  This can be used
! to avoid the default search of <samp>/usr/local/include</samp>.
! </p>
! <p><strong>Do not</strong> specify <samp>/usr</samp> as the <samp>--with-local-prefix</samp>!
! The directory you use for <samp>--with-local-prefix</samp> <strong>must not</strong>
! contain any of the system&rsquo;s standard header files.  If it did contain
  them, certain programs would be miscompiled (including GNU Emacs, on
  certain targets), because this would override and nullify the header
! file corrections made by the <code>fixincludes</code> script.
! </p>
! <p>Indications are that people who use this option use it based on mistaken
  ideas of what it is for.  People use it as if it specified where to
  install part of GCC.  Perhaps they make this assumption because
  installing GCC creates the directory.
! </p>
! </dd>
! <dt><code>--with-native-system-header-dir=<var>dirname</var></code></dt>
! <dd><p>Specifies that <var>dirname</var> is the directory that contains native system
! header files, rather than <samp>/usr/include</samp>.  This option is most useful
  if you are creating a compiler that should be isolated from the system
  as much as possible.  It is most commonly used with the
! <samp>--with-sysroot</samp> option and will cause GCC to search
  <var>dirname</var> inside the system root specified by that option.
! </p>
! </dd>
! <dt><code>--enable-shared[=<var>package</var>[,&hellip;]]</code></dt>
! <dd><p>Build shared versions of libraries, if shared libraries are supported on
  the target platform.  Unlike GCC 2.95.x and earlier, shared libraries
  are enabled by default on all platforms that support shared libraries.
! </p>
! <p>If a list of packages is given as an argument, build shared libraries
  only for the listed packages.  For other packages, only static libraries
  will be built.  Package names currently recognized in the GCC tree are
! &lsquo;<samp>libgcc</samp>&rsquo; (also known as &lsquo;<samp>gcc</samp>&rsquo;), &lsquo;<samp>libstdc++</samp>&rsquo; (not
! &lsquo;<samp>libstdc++-v3</samp>&rsquo;), &lsquo;<samp>libffi</samp>&rsquo;, &lsquo;<samp>zlib</samp>&rsquo;, &lsquo;<samp>boehm-gc</samp>&rsquo;,
! &lsquo;<samp>ada</samp>&rsquo;, &lsquo;<samp>libada</samp>&rsquo;, &lsquo;<samp>libjava</samp>&rsquo;, &lsquo;<samp>libgo</samp>&rsquo;, and &lsquo;<samp>libobjc</samp>&rsquo;.
! Note &lsquo;<samp>libiberty</samp>&rsquo; does not support shared libraries at all.
! </p>
! <p>Use <samp>--disable-shared</samp> to build only static libraries.  Note that
! <samp>--disable-shared</samp> does not accept a list of package names as
! argument, only <samp>--enable-shared</samp> does.
! </p>
! <p>Contrast with <samp>--enable-host-shared</samp>, which affects <em>host</em>
  code.
! </p>
! </dd>
! <dt><code>--enable-host-shared</code></dt>
! <dd><p>Specify that the <em>host</em> code should be built into position-independent
  machine code (with -fPIC), allowing it to be used within shared libraries,
  but yielding a slightly slower compiler.
! </p>
! <p>This option is required when building the libgccjit.so library.
! </p>
! <p>Contrast with <samp>--enable-shared</samp>, which affects <em>target</em>
  libraries.
! </p>
! </dd>
! <dt><code><a name="with_002dgnu_002das"></a>--with-gnu-as</code></dt>
! <dd><p>Specify that the compiler should assume that the
  assembler it finds is the GNU assembler.  However, this does not modify
  the rules to find an assembler and will result in confusion if the
  assembler found is not actually the GNU assembler.  (Confusion may also
  result if the compiler finds the GNU assembler but has not been
! configured with <samp>--with-gnu-as</samp>.)  If you have more than one
  assembler installed on your system, you may want to use this option in
! connection with <samp>--with-as=<var>pathname</var></samp> or
! <samp>--with-build-time-tools=<var>pathname</var></samp>.
! </p>
! <p>The following systems are the only ones where it makes a difference
  whether you use the GNU assembler.  On any other system,
! <samp>--with-gnu-as</samp> has no effect.
! </p>
! <ul>
! <li> &lsquo;<samp>hppa1.0-<var>any</var>-<var>any</var></samp>&rsquo;
! </li><li> &lsquo;<samp>hppa1.1-<var>any</var>-<var>any</var></samp>&rsquo;
! </li><li> &lsquo;<samp>sparc-sun-solaris2.<var>any</var></samp>&rsquo;
! </li><li> &lsquo;<samp>sparc64-<var>any</var>-solaris2.<var>any</var></samp>&rsquo;
! </li></ul>
  
! </dd>
! <dt><code><a name="with_002das"></a>--with-as=<var>pathname</var></code></dt>
! <dd><p>Specify that the compiler should use the assembler pointed to by
  <var>pathname</var>, rather than the one found by the standard rules to find
  an assembler, which are:
! </p><ul>
! <li> Unless GCC is being built with a cross compiler, check the
! <samp><var>libexec</var>/gcc/<var>target</var>/<var>version</var></samp> directory.
! <var>libexec</var> defaults to <samp><var>exec-prefix</var>/libexec</samp>;
  <var>exec-prefix</var> defaults to <var>prefix</var>, which
! defaults to <samp>/usr/local</samp> unless overridden by the
! <samp>--prefix=<var>pathname</var></samp> switch described above.  <var>target</var>
! is the target system triple, such as &lsquo;<samp>sparc-sun-solaris2.7</samp>&rsquo;, and
  <var>version</var> denotes the GCC version, such as 3.0.
  
! </li><li> If the target system is the same that you are building on, check
! operating system specific directories (e.g. <samp>/usr/ccs/bin</samp> on
  Sun Solaris 2).
  
! </li><li> Check in the <code>PATH</code> for a tool whose name is prefixed by the
  target system triple.
  
! </li><li> Check in the <code>PATH</code> for a tool whose name is not prefixed by the
  target system triple, if the host and target system triple are
  the same (in other words, we use a host tool if it can be used for
! the target as well).
! </li></ul>
  
! <p>You may want to use <samp>--with-as</samp> if no assembler
  is installed in the directories listed above, or if you have multiple
  assemblers installed and want to choose one that is not found by the
  above rules.
! </p>
! </dd>
! <dt><code><a name="with_002dgnu_002dld"></a>--with-gnu-ld</code></dt>
! <dd><p>Same as <a href="#with-gnu-as"><samp>--with-gnu-as</samp></a>
  but for the linker.
! </p>
! </dd>
! <dt><code>--with-ld=<var>pathname</var></code></dt>
! <dd><p>Same as <a href="#with-as"><samp>--with-as</samp></a>
  but for the linker.
! </p>
! </dd>
! <dt><code>--with-stabs</code></dt>
! <dd><p>Specify that stabs debugging
  information should be used instead of whatever format the host normally
  uses.  Normally GCC uses the same debug format as the host system.
! </p>
! <p>On MIPS based systems and on Alphas, you must specify whether you want
  GCC to create the normal ECOFF debugging format, or to use BSD-style
  stabs passed through the ECOFF symbol table.  The normal ECOFF debug
  format cannot fully handle languages other than C.  BSD stabs format can
  handle other languages, but it only works with the GNU debugger GDB.
! </p>
! <p>Normally, GCC uses the ECOFF debugging format by default; if you
! prefer BSD stabs, specify <samp>--with-stabs</samp> when you configure GCC.
! </p>
! <p>No matter which default you choose when you configure GCC, the user
! can use the <samp>-gcoff</samp> and <samp>-gstabs+</samp> options to specify explicitly
  the debug format for a particular compilation.
! </p>
! <p><samp>--with-stabs</samp> is meaningful on the ISC system on the 386, also, if
! <samp>--with-gas</samp> is used.  It selects use of stabs debugging
  information embedded in COFF output.  This kind of debugging information
  supports C++ well; ordinary COFF debugging information does not.
! </p>
! <p><samp>--with-stabs</samp> is also meaningful on 386 systems running SVR4.  It
  selects use of stabs debugging information embedded in ELF output.  The
  C++ compiler currently (2.6.0) does not support the DWARF debugging
  information normally used on 386 SVR4 platforms; stabs provide a
  workable alternative.  This requires gas and gdb, as the normal SVR4
  tools can not generate or interpret stabs.
! </p>
! </dd>
! <dt><code>--with-tls=<var>dialect</var></code></dt>
! <dd><p>Specify the default TLS dialect, for systems were there is a choice.
  For ARM targets, possible values for <var>dialect</var> are <code>gnu</code> or
  <code>gnu2</code>, which select between the original GNU dialect and the GNU TLS
  descriptor-based dialect.
! </p>
! </dd>
! <dt><code>--enable-multiarch</code></dt>
! <dd><p>Specify whether to enable or disable multiarch support.  The default is
  to check for glibc start files in a multiarch location, and enable it
  if the files are found.  The auto detection is enabled for native builds,
! and for cross builds configured with <samp>--with-sysroot</samp>, and without
! <samp>--with-native-system-header-dir</samp>.
  More documentation about multiarch can be found at
  <a href="http://wiki.debian.org/Multiarch">http://wiki.debian.org/Multiarch</a>.
! </p>
! </dd>
! <dt><code>--enable-sjlj-exceptions</code></dt>
! <dd><p>Force use of the <code>setjmp</code>/<code>longjmp</code>-based scheme for exceptions.
! &lsquo;<samp>configure</samp>&rsquo; ordinarily picks the correct value based on the platform.
! Only use this option if you are sure you need a different setting.
! </p>
! </dd>
! <dt><code>--enable-vtable-verify</code></dt>
! <dd><p>Specify whether to enable or disable the vtable verification feature.
  Enabling this feature causes libstdc++ to be built with its virtual calls
  in verifiable mode.  This means that, when linked with libvtv, every
  virtual call in libstdc++ will verify the vtable pointer through which the
  call will be made before actually making the call.  If not linked with libvtv,
! the verifier will call stub functions (in libstdc++ itself) and do nothing.
  If vtable verification is disabled, then libstdc++ is not built with its
  virtual calls in verifiable mode at all.  However the libvtv library will
! still be built (see <samp>--disable-libvtv</samp> to turn off building libvtv).
! <samp>--disable-vtable-verify</samp> is the default.
! </p>
! </dd>
! <dt><code>--disable-multilib</code></dt>
! <dd><p>Specify that multiple target
  libraries to support different target variants, calling
  conventions, etc. should not be built.  The default is to build a
  predefined set of them.
! </p>
! <p>Some targets provide finer-grained control over which multilibs are built
! (e.g., <samp>--disable-softfloat</samp>):
! </p><dl compact="compact">
! <dt><code>arm-*-*</code></dt>
! <dd><p>fpu, 26bit, underscore, interwork, biendian, nofmult.
! </p>
! </dd>
! <dt><code>m68*-*-*</code></dt>
! <dd><p>softfloat, m68881, m68000, m68020.
! </p>
! </dd>
! <dt><code>mips*-*-*</code></dt>
! <dd><p>single-float, biendian, softfloat.
! </p>
! </dd>
! <dt><code>powerpc*-*-*, rs6000*-*-*</code></dt>
! <dd><p>aix64, pthread, softfloat, powercpu, powerpccpu, powerpcos, biendian,
  sysv, aix.
+ </p>
+ </dd>
+ </dl>
  
! </dd>
! <dt><code>--with-multilib-list=<var>list</var></code></dt>
! <dt><code>--without-multilib-list</code></dt>
! <dd><p>Specify what multilibs to build.
  Currently only implemented for sh*-*-* and x86-64-*-linux*.
! </p>
! <dl compact="compact">
! <dt><code>sh*-*-*</code></dt>
! <dd><p><var>list</var> is a comma separated list of CPU names.  These must be of the
  form <code>sh*</code> or <code>m*</code> (in which case they match the compiler option
  for that processor).  The list should not contain any endian options -
! these are handled by <samp>--with-endian</samp>.
! </p>
! <p>If <var>list</var> is empty, then there will be no multilibs for extra
  processors.  The multilib for the secondary endian remains enabled.
! </p>
! <p>As a special case, if an entry in the list starts with a <code>!</code>
! (exclamation point), then it is added to the list of excluded multilibs.
! Entries of this sort should be compatible with &lsquo;<samp>MULTILIB_EXCLUDES</samp>&rsquo;
  (once the leading <code>!</code> has been stripped).
! </p>
! <p>If <samp>--with-multilib-list</samp> is not given, then a default set of
! multilibs is selected based on the value of <samp>--target</samp>.  This is
  usually the complete set of libraries, but some targets imply a more
  specialized subset.
! </p>
! <p>Example 1: to configure a compiler for SH4A only, but supporting both
  endians, with little endian being the default:
! </p><div class="smallexample">
! <pre class="smallexample">--with-cpu=sh4a --with-endian=little,big --with-multilib-list=
! </pre></div>
! 
! <p>Example 2: to configure a compiler for both SH4A and SH4AL-DSP, but with
  only little endian SH4AL:
! </p><div class="smallexample">
! <pre class="smallexample">--with-cpu=sh4a --with-endian=little,big \
! --with-multilib-list=sh4al,!mb/m4al
! </pre></div>
! 
! </dd>
! <dt><code>x86-64-*-linux*</code></dt>
! <dd><p><var>list</var> is a comma separated list of <code>m32</code>, <code>m64</code> and
  <code>mx32</code> to enable 32-bit, 64-bit and x32 run-time libraries,
  respectively.  If <var>list</var> is empty, then there will be no multilibs
  and only the default run-time library will be enabled.
! </p>
! <p>If <samp>--with-multilib-list</samp> is not given, then only 32-bit and
! 64-bit run-time libraries will be enabled.
! </p></dd>
  </dl>
  
! </dd>
! <dt><code>--with-endian=<var>endians</var></code></dt>
! <dd><p>Specify what endians to use.
  Currently only implemented for sh*-*-*.
! </p>
! <p><var>endians</var> may be one of the following:
! </p><dl compact="compact">
! <dt><code>big</code></dt>
! <dd><p>Use big endian exclusively.
! </p></dd>
! <dt><code>little</code></dt>
! <dd><p>Use little endian exclusively.
! </p></dd>
! <dt><code>big,little</code></dt>
! <dd><p>Use big endian by default.  Provide a multilib for little endian.
! </p></dd>
! <dt><code>little,big</code></dt>
! <dd><p>Use little endian by default.  Provide a multilib for big endian.
! </p></dd>
  </dl>
  
! </dd>
! <dt><code>--enable-threads</code></dt>
! <dd><p>Specify that the target
  supports threads.  This affects the Objective-C compiler and runtime
! library, and exception handling for other languages like C++ and Java.
  On some systems, this is the default.
! </p>
! <p>In general, the best (and, in many cases, the only known) threading
  model available will be configured for use.  Beware that on some
  systems, GCC has not been taught what threading models are generally
! available for the system.  In this case, <samp>--enable-threads</samp> is an
! alias for <samp>--enable-threads=single</samp>.
! </p>
! </dd>
! <dt><code>--disable-threads</code></dt>
! <dd><p>Specify that threading support should be disabled for the system.
! This is an alias for <samp>--enable-threads=single</samp>.
! </p>
! </dd>
! <dt><code>--enable-threads=<var>lib</var></code></dt>
! <dd><p>Specify that
  <var>lib</var> is the thread support library.  This affects the Objective-C
  compiler and runtime library, and exception handling for other languages
  like C++ and Java.  The possibilities for <var>lib</var> are:
! </p>
! <dl compact="compact">
! <dt><code>aix</code></dt>
! <dd><p>AIX thread support.
! </p></dd>
! <dt><code>dce</code></dt>
! <dd><p>DCE thread support.
! </p></dd>
! <dt><code>lynx</code></dt>
! <dd><p>LynxOS thread support.
! </p></dd>
! <dt><code>mipssde</code></dt>
! <dd><p>MIPS SDE thread support.
! </p></dd>
! <dt><code>no</code></dt>
! <dd><p>This is an alias for &lsquo;<samp>single</samp>&rsquo;.
! </p></dd>
! <dt><code>posix</code></dt>
! <dd><p>Generic POSIX/Unix98 thread support.
! </p></dd>
! <dt><code>rtems</code></dt>
! <dd><p>RTEMS thread support.
! </p></dd>
! <dt><code>single</code></dt>
! <dd><p>Disable thread support, should work for all platforms.
! </p></dd>
! <dt><code>tpf</code></dt>
! <dd><p>TPF thread support.
! </p></dd>
! <dt><code>vxworks</code></dt>
! <dd><p>VxWorks thread support.
! </p></dd>
! <dt><code>win32</code></dt>
! <dd><p>Microsoft Win32 API thread support.
! </p></dd>
  </dl>
  
! </dd>
! <dt><code>--enable-tls</code></dt>
! <dd><p>Specify that the target supports TLS (Thread Local Storage).  Usually
  configure can correctly determine if TLS is supported.  In cases where
  it guesses incorrectly, TLS can be explicitly enabled or disabled with
! <samp>--enable-tls</samp> or <samp>--disable-tls</samp>.  This can happen if
  the assembler supports TLS but the C library does not, or if the
  assumptions made by the configure test are incorrect.
! </p>
! </dd>
! <dt><code>--disable-tls</code></dt>
! <dd><p>Specify that the target does not support TLS.
! This is an alias for <samp>--enable-tls=no</samp>.
! </p>
! </dd>
! <dt><code>--with-cpu=<var>cpu</var></code></dt>
! <dt><code>--with-cpu-32=<var>cpu</var></code></dt>
! <dt><code>--with-cpu-64=<var>cpu</var></code></dt>
! <dd><p>Specify which cpu variant the compiler should generate code for by default.
! <var>cpu</var> will be used as the default value of the <samp>-mcpu=</samp> switch.
  This option is only supported on some targets, including ARC, ARM, i386, M68k,
! PowerPC, and SPARC.  It is mandatory for ARC.  The <samp>--with-cpu-32</samp> and
! <samp>--with-cpu-64</samp> options specify separate default CPUs for
  32-bit and 64-bit modes; these options are only supported for i386,
  x86-64 and PowerPC.
! </p>
! </dd>
! <dt><code>--with-schedule=<var>cpu</var></code></dt>
! <dt><code>--with-arch=<var>cpu</var></code></dt>
! <dt><code>--with-arch-32=<var>cpu</var></code></dt>
! <dt><code>--with-arch-64=<var>cpu</var></code></dt>
! <dt><code>--with-tune=<var>cpu</var></code></dt>
! <dt><code>--with-tune-32=<var>cpu</var></code></dt>
! <dt><code>--with-tune-64=<var>cpu</var></code></dt>
! <dt><code>--with-abi=<var>abi</var></code></dt>
! <dt><code>--with-fpu=<var>type</var></code></dt>
! <dt><code>--with-float=<var>type</var></code></dt>
! <dd><p>These configure options provide default values for the <samp>-mschedule=</samp>,
! <samp>-march=</samp>, <samp>-mtune=</samp>, <samp>-mabi=</samp>, and <samp>-mfpu=</samp>
! options and for <samp>-mhard-float</samp> or <samp>-msoft-float</samp>.  As with
! <samp>--with-cpu</samp>, which switches will be accepted and acceptable values
  of the arguments depend on the target.
! </p>
! </dd>
! <dt><code>--with-mode=<var>mode</var></code></dt>
! <dd><p>Specify if the compiler should default to <samp>-marm</samp> or <samp>-mthumb</samp>.
  This option is only supported on ARM targets.
! </p>
! </dd>
! <dt><code>--with-stack-offset=<var>num</var></code></dt>
! <dd><p>This option sets the default for the -mstack-offset=<var>num</var> option,
  and will thus generally also control the setting of this option for
  libraries.  This option is only supported on Epiphany targets.
! </p>
! </dd>
! <dt><code>--with-fpmath=<var>isa</var></code></dt>
! <dd><p>This options sets <samp>-mfpmath=sse</samp> by default and specifies the default
! ISA for floating-point arithmetics.  You can select either &lsquo;<samp>sse</samp>&rsquo; which
! enables <samp>-msse2</samp> or &lsquo;<samp>avx</samp>&rsquo; which enables <samp>-mavx</samp> by default.
  This option is only supported on i386 and x86-64 targets.
! </p>
! </dd>
! <dt><code>--with-fp-32=<var>mode</var></code></dt>
! <dd><p>On MIPS targets, set the default value for the <samp>-mfp</samp> option when using
  the o32 ABI.  The possibilities for <var>mode</var> are:
! </p><dl compact="compact">
! <dt><code>32</code></dt>
! <dd><p>Use the o32 FP32 ABI extension, as with the <samp>-mfp32</samp> command-line
! option.
! </p></dd>
! <dt><code>xx</code></dt>
! <dd><p>Use the o32 FPXX ABI extension, as with the <samp>-mfpxx</samp> command-line
! option.
! </p></dd>
! <dt><code>64</code></dt>
! <dd><p>Use the o32 FP64 ABI extension, as with the <samp>-mfp64</samp> command-line
! option.
! </p></dd>
  </dl>
! <p>In the absence of this configuration option the default is to use the o32
  FP32 ABI extension.
! </p>
! </dd>
! <dt><code>--with-odd-spreg-32</code></dt>
! <dd><p>On MIPS targets, set the <samp>-modd-spreg</samp> option by default when using
  the o32 ABI.
! </p>
! </dd>
! <dt><code>--without-odd-spreg-32</code></dt>
! <dd><p>On MIPS targets, set the <samp>-mno-odd-spreg</samp> option by default when using
  the o32 ABI.  This is normally used in conjunction with
! <samp>--with-fp-32=64</samp> in order to target the o32 FP64A ABI extension.
! </p>
! </dd>
! <dt><code>--with-nan=<var>encoding</var></code></dt>
! <dd><p>On MIPS targets, set the default encoding convention to use for the
  special not-a-number (NaN) IEEE 754 floating-point data.  The
  possibilities for <var>encoding</var> are:
! </p><dl compact="compact">
! <dt><code>legacy</code></dt>
! <dd><p>Use the legacy encoding, as with the <samp>-mnan=legacy</samp> command-line
! option.
! </p></dd>
! <dt><code>2008</code></dt>
! <dd><p>Use the 754-2008 encoding, as with the <samp>-mnan=2008</samp> command-line
! option.
! </p></dd>
  </dl>
! <p>To use this configuration option you must have an assembler version
! installed that supports the <samp>-mnan=</samp> command-line option too.
  In the absence of this configuration option the default convention is
! the legacy encoding, as when neither of the <samp>-mnan=2008</samp> and
! <samp>-mnan=legacy</samp> command-line options has been used.
! </p>
! </dd>
! <dt><code>--with-divide=<var>type</var></code></dt>
! <dd><p>Specify how the compiler should generate code for checking for
! division by zero.  This option is only supported on the MIPS target.
  The possibilities for <var>type</var> are:
! </p><dl compact="compact">
! <dt><code>traps</code></dt>
! <dd><p>Division by zero checks use conditional traps (this is the default on
! systems that support conditional traps).
! </p></dd>
! <dt><code>breaks</code></dt>
! <dd><p>Division by zero checks use the break instruction.
! </p></dd>
  </dl>
  
! 
! </dd>
! <dt><code>--with-llsc</code></dt>
! <dd><p>On MIPS targets, make <samp>-mllsc</samp> the default when no
! <samp>-mno-llsc</samp> option is passed.  This is the default for
  Linux-based targets, as the kernel will emulate them if the ISA does
  not provide them.
! </p>
! </dd>
! <dt><code>--without-llsc</code></dt>
! <dd><p>On MIPS targets, make <samp>-mno-llsc</samp> the default when no
! <samp>-mllsc</samp> option is passed.
! </p>
! </dd>
! <dt><code>--with-synci</code></dt>
! <dd><p>On MIPS targets, make <samp>-msynci</samp> the default when no
! <samp>-mno-synci</samp> option is passed.
! </p>
! </dd>
! <dt><code>--without-synci</code></dt>
! <dd><p>On MIPS targets, make <samp>-mno-synci</samp> the default when no
! <samp>-msynci</samp> option is passed.  This is the default.
! </p>
! </dd>
! <dt><code>--with-mips-plt</code></dt>
! <dd><p>On MIPS targets, make use of copy relocations and PLTs.
  These features are extensions to the traditional
  SVR4-based MIPS ABIs and require support from GNU binutils
  and the runtime C library.
! </p>
! </dd>
! <dt><code>--enable-__cxa_atexit</code></dt>
! <dd><p>Define if you want to use __cxa_atexit, rather than atexit, to
! register C++ destructors for local statics and global objects.
  This is essential for fully standards-compliant handling of
  destructors, but requires __cxa_atexit in libc.  This option is currently
  only available on systems with GNU libc.  When enabled, this will cause
! <samp>-fuse-cxa-atexit</samp> to be passed by default.
! </p>
! </dd>
! <dt><code>--enable-gnu-indirect-function</code></dt>
! <dd><p>Define if you want to enable the <code>ifunc</code> attribute.  This option is
  currently only available on systems with GNU libc on certain targets.
! </p>
! </dd>
! <dt><code>--enable-target-optspace</code></dt>
! <dd><p>Specify that target
! libraries should be optimized for code space instead of code speed.
  This is the default for the m32r platform.
! </p>
! </dd>
! <dt><code>--with-cpp-install-dir=<var>dirname</var></code></dt>
! <dd><p>Specify that the user visible <code>cpp</code> program should be installed
! in <samp><var>prefix</var>/<var>dirname</var>/cpp</samp>, in addition to <var>bindir</var>.
! </p>
! </dd>
! <dt><code>--enable-comdat</code></dt>
! <dd><p>Enable COMDAT group support.  This is primarily used to override the
  automatically detected value.
! </p>
! </dd>
! <dt><code>--enable-initfini-array</code></dt>
! <dd><p>Force the use of sections <code>.init_array</code> and <code>.fini_array</code>
  (instead of <code>.init</code> and <code>.fini</code>) for constructors and
! destructors.  Option <samp>--disable-initfini-array</samp> has the
  opposite effect.  If neither option is specified, the configure script
  will try to guess whether the <code>.init_array</code> and
  <code>.fini_array</code> sections are supported and, if they are, use them.
! </p>
! </dd>
! <dt><code>--enable-link-mutex</code></dt>
! <dd><p>When building GCC, use a mutex to avoid linking the compilers for
  multiple languages at the same time, to avoid thrashing on build
  systems with limited free memory.  The default is not to use such a mutex.
! </p>
! </dd>
! <dt><code>--enable-maintainer-mode</code></dt>
! <dd><p>The build rules that regenerate the Autoconf and Automake output files as
! well as the GCC master message catalog <samp>gcc.pot</samp> are normally
  disabled.  This is because it can only be rebuilt if the complete source
  tree is present.  If you have changed the sources and want to rebuild the
! catalog, configuring with <samp>--enable-maintainer-mode</samp> will enable
  this.  Note that you need a recent version of the <code>gettext</code> tools
  to do so.
! </p>
! </dd>
! <dt><code>--disable-bootstrap</code></dt>
! <dd><p>For a native build, the default configuration is to perform
! a 3-stage bootstrap of the compiler when &lsquo;<samp>make</samp>&rsquo; is invoked,
  testing that GCC can compile itself correctly.  If you want to disable
! this process, you can configure with <samp>--disable-bootstrap</samp>.
! </p>
! </dd>
! <dt><code>--enable-bootstrap</code></dt>
! <dd><p>In special cases, you may want to perform a 3-stage build
! even if the target and host triplets are different.
  This is possible when the host can run code compiled for
! the target (e.g. host is i686-linux, target is i486-linux).
  Starting from GCC 4.2, to do this you have to configure explicitly
! with <samp>--enable-bootstrap</samp>.
! </p>
! </dd>
! <dt><code>--enable-generated-files-in-srcdir</code></dt>
! <dd><p>Neither the .c and .h files that are generated from Bison and flex nor the
  info manuals and man pages that are built from the .texi files are present
  in the SVN development tree.  When building GCC from that development tree,
  or from one of our snapshots, those generated files are placed in your
  build directory, which allows for the source to be in a readonly
  directory.
! </p>
! <p>If you configure with <samp>--enable-generated-files-in-srcdir</samp> then those
  generated files will go into the source directory.  This is mainly intended
  for generating release or prerelease tarballs of the GCC sources, since it
  is not a requirement that the users of source releases to have flex, Bison,
  or makeinfo.
! </p>
! </dd>
! <dt><code>--enable-version-specific-runtime-libs</code></dt>
! <dd><p>Specify
  that runtime libraries should be installed in the compiler specific
! subdirectory (<samp><var>libdir</var>/gcc</samp>) rather than the usual places.  In
! addition, &lsquo;<samp>libstdc++</samp>&rsquo;&rsquo;s include files will be installed into
  <samp><var>libdir</var></samp> unless you overruled it by using
! <samp>--with-gxx-include-dir=<var>dirname</var></samp>.  Using this option is
  particularly useful if you intend to use several versions of GCC in
! parallel.  This is currently supported by &lsquo;<samp>libgfortran</samp>&rsquo;,
! &lsquo;<samp>libjava</samp>&rsquo;, &lsquo;<samp>libstdc++</samp>&rsquo;, and &lsquo;<samp>libobjc</samp>&rsquo;.
! </p>
! </dd>
! <dt><code><a name="WithAixSoname"></a>--with-aix-soname=&lsquo;<samp>aix</samp>&rsquo;, &lsquo;<samp>svr4</samp>&rsquo; or &lsquo;<samp>both</samp>&rsquo;</code></dt>
! <dd><p>Traditional AIX shared library versioning (versioned <code>Shared Object</code>
  files as members of unversioned <code>Archive Library</code> files named
! &lsquo;<samp>lib.a</samp>&rsquo;) causes numerous headaches for package managers. However,
  <code>Import Files</code> as members of <code>Archive Library</code> files allow for
  <strong>filename-based versioning</strong> of shared libraries as seen on Linux/SVR4,
! where this is called the &quot;SONAME&quot;. But as they prevent static linking,
  <code>Import Files</code> may be used with <code>Runtime Linking</code> only, where the
! linker does search for &lsquo;<samp>libNAME.so</samp>&rsquo; before &lsquo;<samp>libNAME.a</samp>&rsquo; library
! filenames with the &lsquo;<samp>-lNAME</samp>&rsquo; linker flag.
! </p>
! <a name="AixLdCommand"></a><p>For detailed information please refer to the AIX
! <a href="http://www-01.ibm.com/support/knowledgecenter/search/%22the%20ld%20command%2C%20also%20called%20the%20linkage%20editor%20or%20binder%22">ld
! Command</a> reference.
! </p>
! <p>As long as shared library creation is enabled, upon:
! </p><dl compact="compact">
! <dt><code>--with-aix-soname=aix</code></dt>
! <dt><code>--with-aix-soname=both</code></dt>
! <dd><p>A (traditional AIX) <code>Shared Archive Library</code> file is created:
!  </p><ul>
! <li> using the &lsquo;<samp>libNAME.a</samp>&rsquo; filename scheme
!   </li><li> with the <code>Shared Object</code> file as archive member named
!   &lsquo;<samp>libNAME.so.V</samp>&rsquo; (except for &lsquo;<samp>libgcc_s</samp>&rsquo;, where the <code>Shared
!   Object</code> file is named &lsquo;<samp>shr.o</samp>&rsquo; for backwards compatibility), which
!   <ul class="no-bullet">
! <li>- is used for runtime loading from inside the &lsquo;<samp>libNAME.a</samp>&rsquo; file
!    </li><li>- is used for dynamic loading via
!    <code>dlopen(&quot;libNAME.a(libNAME.so.V)&quot;, RTLD_MEMBER)</code>
!    </li><li>- is used for shared linking
!    </li><li>- is used for static linking, so no separate <code>Static Archive
     Library</code> file is needed
!   </li></ul>
! </li></ul>
! </dd>
! <dt><code>--with-aix-soname=both</code></dt>
! <dt><code>--with-aix-soname=svr4</code></dt>
! <dd><p>A (second) <code>Shared Archive Library</code> file is created:
!  </p><ul>
! <li> using the &lsquo;<samp>libNAME.so.V</samp>&rsquo; filename scheme
!  </li><li> with the <code>Shared Object</code> file as archive member named
!  &lsquo;<samp>shr.o</samp>&rsquo;, which
!   <ul class="no-bullet">
! <li>- is created with the <code>-G linker flag</code>
!    </li><li>- has the <code>F_LOADONLY</code> flag set
!    </li><li>- is used for runtime loading from inside the &lsquo;<samp>libNAME.so.V</samp>&rsquo; file
!    </li><li>- is used for dynamic loading via <code>dlopen(&quot;libNAME.so.V(shr.o)&quot;,
     RTLD_MEMBER)</code>
!   </li></ul>
! </li><li> with the <code>Import File</code> as archive member named &lsquo;<samp>shr.imp</samp>&rsquo;,
   which
!   <ul class="no-bullet">
! <li>- refers to &lsquo;<samp>libNAME.so.V(shr.o)</samp>&rsquo; as the &quot;SONAME&quot;, to be recorded
     in the <code>Loader Section</code> of subsequent binaries
!    </li><li>- indicates whether &lsquo;<samp>libNAME.so.V(shr.o)</samp>&rsquo; is 32 or 64 bit
!    </li><li>- lists all the public symbols exported by &lsquo;<samp>lib.so.V(shr.o)</samp>&rsquo;,
!    eventually decorated with the <code>&lsquo;<samp>weak</samp>&rsquo; Keyword</code>
!    </li><li>- is necessary for shared linking against &lsquo;<samp>lib.so.V(shr.o)</samp>&rsquo;
!    </li></ul>
! </li></ul>
! <p>A symbolic link using the &lsquo;<samp>libNAME.so</samp>&rsquo; filename scheme is created:
!   </p><ul>
! <li> pointing to the &lsquo;<samp>libNAME.so.V</samp>&rsquo; <code>Shared Archive Library</code> file
!   </li><li> to permit the <code>ld Command</code> to find &lsquo;<samp>lib.so.V(shr.imp)</samp>&rsquo; via
!   the &lsquo;<samp>-lNAME</samp>&rsquo; argument (requires <code>Runtime Linking</code> to be enabled)
!   </li><li> to permit dynamic loading of &lsquo;<samp>lib.so.V(shr.o)</samp>&rsquo; without the need
!   to specify the version number via <code>dlopen(&quot;libNAME.so(shr.o)&quot;,
    RTLD_MEMBER)</code>
!   </li></ul>
! </dd>
! </dl>
  
! <p>As long as static library creation is enabled, upon:
! </p><dl compact="compact">
! <dt><code>--with-aix-soname=svr4</code></dt>
! <dd><p>A <code>Static Archive Library</code> is created:
!  </p><ul>
! <li> using the &lsquo;<samp>libNAME.a</samp>&rsquo; filename scheme
!  </li><li> with all the <code>Static Object</code> files as archive members, which
!   <ul class="no-bullet">
! <li>- are used for static linking
!   </li></ul>
! </li></ul>
! </dd>
! </dl>
  
! <p>While the aix-soname=&lsquo;<samp>svr4</samp>&rsquo; option does not create <code>Shared Object</code>
  files as members of unversioned <code>Archive Library</code> files any more, package
  managers still are responsible to
  <a href="./specific.html#TransferAixShobj">transfer</a> <code>Shared Object</code> files
  found as member of a previously installed unversioned <code>Archive Library</code>
  file into the newly installed <code>Archive Library</code> file with the same
  filename.
! </p>
! <p><em>WARNING:</em> Creating <code>Shared Object</code> files with <code>Runtime Linking</code>
  enabled may bloat the TOC, eventually leading to <code>TOC overflow</code> errors,
! requiring the use of either the <samp>-Wl,-bbigtoc</samp> linker flag (seen to
  break with the <code>GDB</code> debugger) or some of the TOC-related compiler flags,
  see &ldquo;RS/6000 and PowerPC Options&rdquo; in the main manual.
! </p>
! <p><samp>--with-aix-soname</samp> is currently supported by &lsquo;<samp>libgcc_s</samp>&rsquo; only, so
  this option is still experimental and not for normal use yet.
! </p>
! <p>Default is the traditional behaviour <samp>--with-aix-soname=&lsquo;<samp>aix</samp>&rsquo;</samp>.
! </p>
! </dd>
! <dt><code>--enable-languages=<var>lang1</var>,<var>lang2</var>,&hellip;</code></dt>
! <dd><p>Specify that only a particular subset of compilers and
  their runtime libraries should be built.  For a list of valid values for
  <var>langN</var> you can issue the following command in the
! <samp>gcc</samp> directory of your GCC source tree:<br>
! </p><div class="smallexample">
! <pre class="smallexample">grep language= */config-lang.in
! </pre></div>
! <p>Currently, you can use any of the following:
  <code>all</code>, <code>ada</code>, <code>c</code>, <code>c++</code>, <code>fortran</code>,
! <code>go</code>, <code>java</code>, <code>objc</code>, <code>obj-c++</code>.
! Building the Ada compiler has special requirements, see below.
  If you do not pass this flag, or specify the option <code>all</code>, then all
! default languages available in the <samp>gcc</samp> sub-tree will be configured.
  Ada, Go and Objective-C++ are not default languages; the rest are.
! </p>
! </dd>
! <dt><code>--enable-stage1-languages=<var>lang1</var>,<var>lang2</var>,&hellip;</code></dt>
! <dd><p>Specify that a particular subset of compilers and their runtime
  libraries should be built with the system C compiler during stage 1 of
  the bootstrap process, rather than only in later stages with the
  bootstrapped C compiler.  The list of valid values is the same as for
! <samp>--enable-languages</samp>, and the option <code>all</code> will select all
! of the languages enabled by <samp>--enable-languages</samp>.  This option is
  primarily useful for GCC development; for instance, when a development
  version of the compiler cannot bootstrap due to compiler bugs, or when
  one is debugging front ends other than the C front end.  When this
  option is used, one can then build the target libraries for the
! specified languages with the stage-1 compiler by using <code>make
! stage1-bubble all-target</code>, or run the testsuite on the stage-1 compiler
! for the specified languages using <code>make stage1-start check-gcc</code>.
! </p>
! </dd>
! <dt><code>--disable-libada</code></dt>
! <dd><p>Specify that the run-time libraries and tools used by GNAT should not
  be built.  This can be useful for debugging, or for compatibility with
  previous Ada build procedures, when it was required to explicitly
! do a &lsquo;<samp>make -C gcc gnatlib_and_tools</samp>&rsquo;.
! </p>
! </dd>
! <dt><code>--disable-libsanitizer</code></dt>
! <dd><p>Specify that the run-time libraries for the various sanitizers should
  not be built.
! </p>
! </dd>
! <dt><code>--disable-libssp</code></dt>
! <dd><p>Specify that the run-time libraries for stack smashing protection
  should not be built.
! </p>
! </dd>
! <dt><code>--disable-libquadmath</code></dt>
! <dd><p>Specify that the GCC quad-precision math library should not be built.
  On some systems, the library is required to be linkable when building
! the Fortran front end, unless <samp>--disable-libquadmath-support</samp>
  is used.
! </p>
! </dd>
! <dt><code>--disable-libquadmath-support</code></dt>
! <dd><p>Specify that the Fortran front end and <code>libgfortran</code> do not add
  support for <code>libquadmath</code> on systems supporting it.
! </p>
! </dd>
! <dt><code>--disable-libgomp</code></dt>
! <dd><p>Specify that the GNU Offloading and Multi Processing Runtime Library
  should not be built.
! </p>
! </dd>
! <dt><code>--disable-libvtv</code></dt>
! <dd><p>Specify that the run-time libraries used by vtable verification
  should not be built.
! </p>
! </dd>
! <dt><code>--with-dwarf2</code></dt>
! <dd><p>Specify that the compiler should
  use DWARF 2 debugging information as the default.
! </p>
! </dd>
! <dt><code>--enable-targets=all</code></dt>
! <dt><code>--enable-targets=<var>target_list</var></code></dt>
! <dd><p>Some GCC targets, e.g. powerpc64-linux, build bi-arch compilers.
  These are compilers that are able to generate either 64-bit or 32-bit
! code.  Typically, the corresponding 32-bit target, e.g.
  powerpc-linux for powerpc64-linux, only generates 32-bit code.  This
  option enables the 32-bit target to be a bi-arch compiler, which is
  useful when you want a bi-arch compiler that defaults to 32-bit, and
! you are building a bi-arch or multi-arch binutils in a combined tree.
  On mips-linux, this will build a tri-arch compiler (ABI o32/n32/64),
! defaulted to o32.
  Currently, this option only affects sparc-linux, powerpc-linux, x86-linux,
  mips-linux and s390-linux.
! </p>
! </dd>
! <dt><code>--enable-secureplt</code></dt>
! <dd><p>This option enables <samp>-msecure-plt</samp> by default for powerpc-linux.
  See &ldquo;RS/6000 and PowerPC Options&rdquo; in the main manual
! </p>
! </dd>
! <dt><code>--enable-cld</code></dt>
! <dd><p>This option enables <samp>-mcld</samp> by default for 32-bit x86 targets.
  See &ldquo;i386 and x86-64 Options&rdquo; in the main manual
! </p>
! </dd>
! <dt><code>--enable-win32-registry</code></dt>
! <dt><code>--enable-win32-registry=<var>key</var></code></dt>
! <dt><code>--disable-win32-registry</code></dt>
! <dd><p>The <samp>--enable-win32-registry</samp> option enables Microsoft Windows-hosted GCC
  to look up installations paths in the registry using the following key:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample"><code>HKEY_LOCAL_MACHINE\SOFTWARE\Free Software Foundation\<var>key</var></code>
+ </pre></div>
  
! <p><var>key</var> defaults to GCC version number, and can be overridden by the
! <samp>--enable-win32-registry=<var>key</var></samp> option.  Vendors and distributors
  who use custom installers are encouraged to provide a different key,
  perhaps one comprised of vendor name and GCC version number, to
  avoid conflict with existing installations.  This feature is enabled
! by default, and can be disabled by <samp>--disable-win32-registry</samp>
  option.  This option has no effect on the other hosts.
! </p>
! </dd>
! <dt><code>--nfp</code></dt>
! <dd><p>Specify that the machine does not have a floating point unit.  This
! option only applies to &lsquo;<samp>m68k-sun-sunos<var>n</var></samp>&rsquo;.  On any other
! system, <samp>--nfp</samp> has no effect.
! </p>
! </dd>
! <dt><code>--enable-werror</code></dt>
! <dt><code>--disable-werror</code></dt>
! <dt><code>--enable-werror=yes</code></dt>
! <dt><code>--enable-werror=no</code></dt>
! <dd><p>When you specify this option, it controls whether certain files in the
! compiler are built with <samp>-Werror</samp> in bootstrap stage2 and later.
! If you don&rsquo;t specify it, <samp>-Werror</samp> is turned on for the main
  development trunk.  However it defaults to off for release branches and
! final releases.  The specific files which get <samp>-Werror</samp> are
  controlled by the Makefiles.
! </p>
! </dd>
! <dt><code>--enable-checking</code></dt>
! <dt><code>--enable-checking=<var>list</var></code></dt>
! <dd><p>When you specify this option, the compiler is built to perform internal
  consistency checks of the requested complexity.  This does not change the
  generated code, but adds error checking within the compiler.  This will
  slow down the compiler and may only work properly if you are building
! the compiler with GCC.  This is &lsquo;<samp>yes</samp>&rsquo; by default when building
! from SVN or snapshots, but &lsquo;<samp>release</samp>&rsquo; for releases.  The default
! for building the stage1 compiler is &lsquo;<samp>yes</samp>&rsquo;.  More control
  over the checks may be had by specifying <var>list</var>.  The categories of
! checks available are &lsquo;<samp>yes</samp>&rsquo; (most common checks
! &lsquo;<samp>assert,misc,tree,gc,rtlflag,runtime</samp>&rsquo;), &lsquo;<samp>no</samp>&rsquo; (no checks at
! all), &lsquo;<samp>all</samp>&rsquo; (all but &lsquo;<samp>valgrind</samp>&rsquo;), &lsquo;<samp>release</samp>&rsquo; (cheapest
! checks &lsquo;<samp>assert,runtime</samp>&rsquo;) or &lsquo;<samp>none</samp>&rsquo; (same as &lsquo;<samp>no</samp>&rsquo;).
! Individual checks can be enabled with these flags &lsquo;<samp>assert</samp>&rsquo;,
! &lsquo;<samp>df</samp>&rsquo;, &lsquo;<samp>fold</samp>&rsquo;, &lsquo;<samp>gc</samp>&rsquo;, &lsquo;<samp>gcac</samp>&rsquo; &lsquo;<samp>misc</samp>&rsquo;, &lsquo;<samp>rtl</samp>&rsquo;,
! &lsquo;<samp>rtlflag</samp>&rsquo;, &lsquo;<samp>runtime</samp>&rsquo;, &lsquo;<samp>tree</samp>&rsquo;, and &lsquo;<samp>valgrind</samp>&rsquo;.
! </p>
! <p>The &lsquo;<samp>valgrind</samp>&rsquo; check requires the external <code>valgrind</code>
  simulator, available from <a href="http://valgrind.org/">http://valgrind.org/</a>.  The
! &lsquo;<samp>df</samp>&rsquo;, &lsquo;<samp>rtl</samp>&rsquo;, &lsquo;<samp>gcac</samp>&rsquo; and &lsquo;<samp>valgrind</samp>&rsquo; checks are very expensive.
! To disable all checking, &lsquo;<samp>--disable-checking</samp>&rsquo; or
! &lsquo;<samp>--enable-checking=none</samp>&rsquo; must be explicitly requested.  Disabling
  assertions will make the compiler and runtime slightly faster but
  increase the risk of undetected internal errors causing wrong code to be
  generated.
! </p>
! </dd>
! <dt><code>--disable-stage1-checking</code></dt>
! <dt><code>--enable-stage1-checking</code></dt>
! <dt><code>--enable-stage1-checking=<var>list</var></code></dt>
! <dd><p>If no <samp>--enable-checking</samp> option is specified the stage1
! compiler will be built with &lsquo;<samp>yes</samp>&rsquo; checking enabled, otherwise
  the stage1 checking flags are the same as specified by
! <samp>--enable-checking</samp>.  To build the stage1 compiler with
! different checking options use <samp>--enable-stage1-checking</samp>.
! The list of checking options is the same as for <samp>--enable-checking</samp>.
  If your system is too slow or too small to bootstrap a released compiler
! with checking for stage1 enabled, you can use &lsquo;<samp>--disable-stage1-checking</samp>&rsquo;
  to disable checking for the stage1 compiler.
! </p>
! </dd>
! <dt><code>--enable-coverage</code></dt>
! <dt><code>--enable-coverage=<var>level</var></code></dt>
! <dd><p>With this option, the compiler is built to collect self coverage
  information, every time it is run.  This is for internal development
  purposes, and only works when the compiler is being built with gcc.  The
  <var>level</var> argument controls whether the compiler is built optimized or
! not, values are &lsquo;<samp>opt</samp>&rsquo; and &lsquo;<samp>noopt</samp>&rsquo;.  For coverage analysis you
  want to disable optimization, for performance analysis you want to
  enable optimization.  When coverage is enabled, the default level is
  without optimization.
! </p>
! </dd>
! <dt><code>--enable-gather-detailed-mem-stats</code></dt>
! <dd><p>When this option is specified more detailed information on memory
  allocation is gathered.  This information is printed when using
! <samp>-fmem-report</samp>.
! </p>
! </dd>
! <dt><code>--enable-nls</code></dt>
! <dt><code>--disable-nls</code></dt>
! <dd><p>The <samp>--enable-nls</samp> option enables Native Language Support (NLS),
  which lets GCC output diagnostics in languages other than American
  English.  Native Language Support is enabled by default if not doing a
! canadian cross build.  The <samp>--disable-nls</samp> option disables NLS.
! </p>
! </dd>
! <dt><code>--with-included-gettext</code></dt>
! <dd><p>If NLS is enabled, the <samp>--with-included-gettext</samp> option causes the build
! procedure to prefer its copy of GNU <code>gettext</code>.
! </p>
! </dd>
! <dt><code>--with-catgets</code></dt>
! <dd><p>If NLS is enabled, and if the host lacks <code>gettext</code> but has the
  inferior <code>catgets</code> interface, the GCC build procedure normally
! ignores <code>catgets</code> and instead uses GCC&rsquo;s copy of the GNU
! <code>gettext</code> library.  The <samp>--with-catgets</samp> option causes the
! build procedure to use the host&rsquo;s <code>catgets</code> in this situation.
! </p>
! </dd>
! <dt><code>--with-libiconv-prefix=<var>dir</var></code></dt>
! <dd><p>Search for libiconv header files in <samp><var>dir</var>/include</samp> and
! libiconv library files in <samp><var>dir</var>/lib</samp>.
! </p>
! </dd>
! <dt><code>--enable-obsolete</code></dt>
! <dd><p>Enable configuration for an obsoleted system.  If you attempt to
  configure GCC for a system (build, host, or target) which has been
  obsoleted, and you do not specify this flag, configure will halt with an
  error message.
! </p>
! <p>All support for systems which have been obsoleted in one release of GCC
  is removed entirely in the next major release, unless someone steps
  forward to maintain the port.
! </p>
! </dd>
! <dt><code>--enable-decimal-float</code></dt>
! <dt><code>--enable-decimal-float=yes</code></dt>
! <dt><code>--enable-decimal-float=no</code></dt>
! <dt><code>--enable-decimal-float=bid</code></dt>
! <dt><code>--enable-decimal-float=dpd</code></dt>
! <dt><code>--disable-decimal-float</code></dt>
! <dd><p>Enable (or disable) support for the C decimal floating point extension
  that is in the IEEE 754-2008 standard.  This is enabled by default only
  on PowerPC, i386, and x86_64 GNU/Linux systems.  Other systems may also
  support it, but require the user to specifically enable it.  You can
  optionally control which decimal floating point format is used (either
! &lsquo;<samp>bid</samp>&rsquo; or &lsquo;<samp>dpd</samp>&rsquo;).  The &lsquo;<samp>bid</samp>&rsquo; (binary integer decimal)
! format is default on i386 and x86_64 systems, and the &lsquo;<samp>dpd</samp>&rsquo;
  (densely packed decimal) format is default on PowerPC systems.
! </p>
! </dd>
! <dt><code>--enable-fixed-point</code></dt>
! <dt><code>--disable-fixed-point</code></dt>
! <dd><p>Enable (or disable) support for C fixed-point arithmetic.
  This option is enabled by default for some targets (such as MIPS) which
  have hardware-support for fixed-point operations.  On other targets, you
  may enable this option manually.
! </p>
! </dd>
! <dt><code>--with-long-double-128</code></dt>
! <dd><p>Specify if <code>long double</code> type should be 128-bit by default on selected
  GNU/Linux architectures.  If using <code>--without-long-double-128</code>,
! <code>long double</code> will be by default 64-bit, the same as <code>double</code> type.
  When neither of these configure options are used, the default will be
  128-bit <code>long double</code> when built against GNU C Library 2.4 and later,
  64-bit <code>long double</code> otherwise.
! </p>
! </dd>
! <dt><code>--with-gmp=<var>pathname</var></code></dt>
! <dt><code>--with-gmp-include=<var>pathname</var></code></dt>
! <dt><code>--with-gmp-lib=<var>pathname</var></code></dt>
! <dt><code>--with-mpfr=<var>pathname</var></code></dt>
! <dt><code>--with-mpfr-include=<var>pathname</var></code></dt>
! <dt><code>--with-mpfr-lib=<var>pathname</var></code></dt>
! <dt><code>--with-mpc=<var>pathname</var></code></dt>
! <dt><code>--with-mpc-include=<var>pathname</var></code></dt>
! <dt><code>--with-mpc-lib=<var>pathname</var></code></dt>
! <dd><p>If you want to build GCC but do not have the GMP library, the MPFR
  library and/or the MPC library installed in a standard location and
  do not have their sources present in the GCC source tree then you
  can explicitly specify the directory where they are installed
! (&lsquo;<samp>--with-gmp=<var>gmpinstalldir</var></samp>&rsquo;,
! &lsquo;<samp>--with-mpfr=<var>mpfrinstalldir</var></samp>&rsquo;,
! &lsquo;<samp>--with-mpc=<var>mpcinstalldir</var></samp>&rsquo;).  The
! <samp>--with-gmp=<var>gmpinstalldir</var></samp> option is shorthand for
! <samp>--with-gmp-lib=<var>gmpinstalldir</var>/lib</samp> and
! <samp>--with-gmp-include=<var>gmpinstalldir</var>/include</samp>.  Likewise the
! <samp>--with-mpfr=<var>mpfrinstalldir</var></samp> option is shorthand for
! <samp>--with-mpfr-lib=<var>mpfrinstalldir</var>/lib</samp> and
! <samp>--with-mpfr-include=<var>mpfrinstalldir</var>/include</samp>, also the
! <samp>--with-mpc=<var>mpcinstalldir</var></samp> option is shorthand for
! <samp>--with-mpc-lib=<var>mpcinstalldir</var>/lib</samp> and
! <samp>--with-mpc-include=<var>mpcinstalldir</var>/include</samp>.  If these
  shorthand assumptions are not correct, you can use the explicit
  include and lib options directly.  You might also need to ensure the
  shared libraries can be found by the dynamic linker when building and
  using GCC, for example by setting the runtime shared library path
! variable (<code>LD_LIBRARY_PATH</code> on GNU/Linux and Solaris systems).
! </p>
! <p>These flags are applicable to the host platform only.  When building
  a cross compiler, they will not be used to configure target libraries.
! </p>
! </dd>
! <dt><code>--with-isl=<var>pathname</var></code></dt>
! <dt><code>--with-isl-include=<var>pathname</var></code></dt>
! <dt><code>--with-isl-lib=<var>pathname</var></code></dt>
! <dd><p>If you do not have the ISL library installed in a standard location and you
  want to build GCC, you can explicitly specify the directory where it is
! installed (&lsquo;<samp>--with-isl=<var>islinstalldir</var></samp>&rsquo;). The
! <samp>--with-isl=<var>islinstalldir</var></samp> option is shorthand for
! <samp>--with-isl-lib=<var>islinstalldir</var>/lib</samp> and
! <samp>--with-isl-include=<var>islinstalldir</var>/include</samp>. If this
  shorthand assumption is not correct, you can use the explicit
  include and lib options directly.
! </p>
! <p>These flags are applicable to the host platform only.  When building
  a cross compiler, they will not be used to configure target libraries.
! </p>
! </dd>
! <dt><code>--with-host-libstdcxx=<var>linker-args</var></code></dt>
! <dd><p>If you are linking with a static copy of PPL, you can use this option
  to specify how the linker should find the standard C++ library used
  internally by PPL.  Typical values of <var>linker-args</var> might be
! &lsquo;<samp>-lstdc++</samp>&rsquo; or &lsquo;<samp>-Wl,-Bstatic,-lstdc++,-Bdynamic -lm</samp>&rsquo;.  If you are
  linking with a shared copy of PPL, you probably do not need this
  option; shared library dependencies will cause the linker to search
  for the standard C++ library automatically.
! </p>
! </dd>
! <dt><code>--with-stage1-ldflags=<var>flags</var></code></dt>
! <dd><p>This option may be used to set linker flags to be used when linking
  stage 1 of GCC.  These are also used when linking GCC if configured with
! <samp>--disable-bootstrap</samp>.  By default no special flags are used.
! </p>
! </dd>
! <dt><code>--with-stage1-libs=<var>libs</var></code></dt>
! <dd><p>This option may be used to set libraries to be used when linking stage 1
  of GCC.  These are also used when linking GCC if configured with
! <samp>--disable-bootstrap</samp>.  The default is the argument to
! <samp>--with-host-libstdcxx</samp>, if specified.
! </p>
! </dd>
! <dt><code>--with-boot-ldflags=<var>flags</var></code></dt>
! <dd><p>This option may be used to set linker flags to be used when linking
  stage 2 and later when bootstrapping GCC.  If neither &ndash;with-boot-libs
  nor &ndash;with-host-libstdcxx is set to a value, then the default is
! &lsquo;<samp>-static-libstdc++ -static-libgcc</samp>&rsquo;.
! </p>
! </dd>
! <dt><code>--with-boot-libs=<var>libs</var></code></dt>
! <dd><p>This option may be used to set libraries to be used when linking stage 2
  and later when bootstrapping GCC.  The default is the argument to
! <samp>--with-host-libstdcxx</samp>, if specified.
! </p>
! </dd>
! <dt><code>--with-debug-prefix-map=<var>map</var></code></dt>
! <dd><p>Convert source directory names using <samp>-fdebug-prefix-map</samp> when
  building runtime libraries.  &lsquo;<samp><var>map</var></samp>&rsquo; is a space-separated
! list of maps of the form &lsquo;<samp><var>old</var>=<var>new</var></samp>&rsquo;.
! </p>
! </dd>
! <dt><code>--enable-linker-build-id</code></dt>
! <dd><p>Tells GCC to pass <samp>--build-id</samp> option to the linker for all final
! links (links performed without the <samp>-r</samp> or <samp>--relocatable</samp>
  option), if the linker supports it.  If you specify
! <samp>--enable-linker-build-id</samp>, but your linker does not
! support <samp>--build-id</samp> option, a warning is issued and the
! <samp>--enable-linker-build-id</samp> option is ignored.  The default is off.
! </p>
! </dd>
! <dt><code>--with-linker-hash-style=<var>choice</var></code></dt>
! <dd><p>Tells GCC to pass <samp>--hash-style=<var>choice</var></samp> option to the
  linker for all final links. <var>choice</var> can be one of
! &lsquo;<samp>sysv</samp>&rsquo;, &lsquo;<samp>gnu</samp>&rsquo;, and &lsquo;<samp>both</samp>&rsquo; where &lsquo;<samp>sysv</samp>&rsquo; is the default.
! </p>
! </dd>
! <dt><code>--enable-gnu-unique-object</code></dt>
! <dt><code>--disable-gnu-unique-object</code></dt>
! <dd><p>Tells GCC to use the gnu_unique_object relocation for C++ template
  static data members and inline function local statics.  Enabled by
  default for a toolchain with an assembler that accepts it and
  GLIBC 2.11 or above, otherwise disabled.
! </p>
! </dd>
! <dt><code>--with-diagnostics-color=<var>choice</var></code></dt>
! <dd><p>Tells GCC to use <var>choice</var> as the default for <samp>-fdiagnostics-color=</samp>
  option (if not used explicitly on the command line).  <var>choice</var>
! can be one of &lsquo;<samp>never</samp>&rsquo;, &lsquo;<samp>auto</samp>&rsquo;, &lsquo;<samp>always</samp>&rsquo;, and &lsquo;<samp>auto-if-env</samp>&rsquo;
! where &lsquo;<samp>auto</samp>&rsquo; is the default.  &lsquo;<samp>auto-if-env</samp>&rsquo; means that
! <samp>-fdiagnostics-color=auto</samp> will be the default if <code>GCC_COLORS</code>
  is present and non-empty in the environment, and
! <samp>-fdiagnostics-color=never</samp> otherwise.
! </p>
! </dd>
! <dt><code>--enable-lto</code></dt>
! <dt><code>--disable-lto</code></dt>
! <dd><p>Enable support for link-time optimization (LTO).  This is enabled by
! default, and may be disabled using <samp>--disable-lto</samp>.
! </p>
! </dd>
! <dt><code>--enable-linker-plugin-configure-flags=FLAGS</code></dt>
! <dt><code>--enable-linker-plugin-flags=FLAGS</code></dt>
! <dd><p>By default, linker plugins (such as the LTO plugin) are built for the
  host system architecture.  For the case that the linker has a
  different (but run-time compatible) architecture, these flags can be
  specified to build plugins that are compatible to the linker.  For
  example, if you are building GCC for a 64-bit x86_64
! (&lsquo;<samp>x86_64-unknown-linux-gnu</samp>&rsquo;) host system, but have a 32-bit x86
! GNU/Linux (&lsquo;<samp>i686-pc-linux-gnu</samp>&rsquo;) linker executable (which is
  executable on the former system), you can configure GCC as follows for
  getting compatible linker plugins:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">% <var>srcdir</var>/configure \
+     --host=x86_64-unknown-linux-gnu \
+     --enable-linker-plugin-configure-flags=--host=i686-pc-linux-gnu \
+     --enable-linker-plugin-flags='CC=gcc\ -m32\ -Wl,-rpath,[...]/i686-pc-linux-gnu/lib'
+ </pre></div>
  
! </dd>
! <dt><code>--with-plugin-ld=<var>pathname</var></code></dt>
! <dd><p>Enable an alternate linker to be used at link-time optimization (LTO)
! link time when <samp>-fuse-linker-plugin</samp> is enabled.
  This linker should have plugin support such as gold starting with
! version 2.20 or GNU ld starting with version 2.21.
! See <samp>-fuse-linker-plugin</samp> for details.
! </p>
! </dd>
! <dt><code>--enable-canonical-system-headers</code></dt>
! <dt><code>--disable-canonical-system-headers</code></dt>
! <dd><p>Enable system header path canonicalization for <samp>libcpp</samp>.  This can
  produce shorter header file paths in diagnostics and dependency output
  files, but these changed header paths may conflict with some compilation
  environments.  Enabled by default, and may be disabled using
! <samp>--disable-canonical-system-headers</samp>.
! </p>
! </dd>
! <dt><code>--with-glibc-version=<var>major</var>.<var>minor</var></code></dt>
! <dd><p>Tell GCC that when the GNU C Library (glibc) is used on the target it
  will be version <var>major</var>.<var>minor</var> or later.  Normally this can
! be detected from the C library&rsquo;s header files, but this option may be
  needed when bootstrapping a cross toolchain without the header files
  available for building the initial bootstrap compiler.
! </p>
! <p>If GCC is configured with some multilibs that use glibc and some that
! do not, this option applies only to the multilibs that use glibc.
  However, such configurations may not work well as not all the relevant
  configuration in GCC is on a per-multilib basis.
! </p>
! </dd>
! <dt><code>--enable-as-accelerator-for=<var>target</var></code></dt>
! <dd><p>Build as offload target compiler. Specify offload host triple by <var>target</var>.
! </p>
! </dd>
! <dt><code>--enable-offload-targets=<var>target1</var>[=<var>path1</var>],&hellip;,<var>targetN</var>[=<var>pathN</var>]</code></dt>
! <dd><p>Enable offloading to targets <var>target1</var>, &hellip;, <var>targetN</var>.
  Offload compilers are expected to be already installed.  Default search
  path for them is <samp><var>exec-prefix</var></samp>, but it can be changed by
! specifying paths <var>path1</var>, &hellip;, <var>pathN</var>.
! </p>
! <div class="smallexample">
! <pre class="smallexample">% <var>srcdir</var>/configure \
!     --enable-offload-target=i686-unknown-linux-gnu=/path/to/i686/compiler,x86_64-pc-linux-gnu
! </pre></div>
! </dd>
! </dl>
  
+ <a name="Cross_002dCompiler_002dSpecific-Options"></a>
+ <h4 class="subheading">Cross-Compiler-Specific Options</h4>
  <p>The following options only apply to building cross compilers.
! </p>
! <dl compact="compact">
! <dt><code>--with-sysroot</code></dt>
! <dt><code>--with-sysroot=<var>dir</var></code></dt>
! <dd><p>Tells GCC to consider <var>dir</var> as the root of a tree that contains
! (a subset of) the root filesystem of the target operating system.
  Target system headers, libraries and run-time object files will be
  searched for in there.  More specifically, this acts as if
! <samp>--sysroot=<var>dir</var></samp> was added to the default options of the built
  compiler.  The specified directory is not copied into the
! install tree, unlike the options <samp>--with-headers</samp> and
! <samp>--with-libs</samp> that this option obsoletes.  The default value,
! in case <samp>--with-sysroot</samp> is not given an argument, is
! <samp>${gcc_tooldir}/sys-root</samp>.  If the specified directory is a
! subdirectory of <samp>${exec_prefix}</samp>, then it will be found relative to
  the GCC binaries if the installation tree is moved.
! </p>
! <p>This option affects the system root for the compiler used to build
  target libraries (which runs on the build system) and the compiler newly
  installed with <code>make install</code>; it does not affect the compiler which is
  used to build GCC itself.
! </p>
! <p>If you specify the <samp>--with-native-system-header-dir=<var>dirname</var></samp>
  option then the compiler will search that directory within <var>dirname</var> for
! native system headers rather than the default <samp>/usr/include</samp>.
! </p>
! </dd>
! <dt><code>--with-build-sysroot</code></dt>
! <dt><code>--with-build-sysroot=<var>dir</var></code></dt>
! <dd><p>Tells GCC to consider <var>dir</var> as the system root (see
! <samp>--with-sysroot</samp>) while building target libraries, instead of
! the directory specified with <samp>--with-sysroot</samp>.  This option is
! only useful when you are already using <samp>--with-sysroot</samp>.  You
! can use <samp>--with-build-sysroot</samp> when you are configuring with
! <samp>--prefix</samp> set to a directory that is different from the one in
  which you are installing GCC and your target libraries.
! </p>
! <p>This option affects the system root for the compiler used to build
  target libraries (which runs on the build system); it does not affect
  the compiler which is used to build GCC itself.
! </p>
! <p>If you specify the <samp>--with-native-system-header-dir=<var>dirname</var></samp>
  option then the compiler will search that directory within <var>dirname</var> for
! native system headers rather than the default <samp>/usr/include</samp>.
! </p>
! </dd>
! <dt><code>--with-headers</code></dt>
! <dt><code>--with-headers=<var>dir</var></code></dt>
! <dd><p>Deprecated in favor of <samp>--with-sysroot</samp>.
! Specifies that target headers are available when building a cross compiler.
  The <var>dir</var> argument specifies a directory which has the target include
! files.  These include files will be copied into the <samp>gcc</samp> install
! directory.  <em>This option with the <var>dir</var> argument is required</em> when
! building a cross compiler, if <samp><var>prefix</var>/<var>target</var>/sys-include</samp>
! doesn&rsquo;t pre-exist.  If <samp><var>prefix</var>/<var>target</var>/sys-include</samp> does
! pre-exist, the <var>dir</var> argument may be omitted.  <code>fixincludes</code>
  will be run on these files to make them compatible with GCC.
! </p>
! </dd>
! <dt><code>--without-headers</code></dt>
! <dd><p>Tells GCC not use any target headers from a libc when building a cross
  compiler.  When crossing to GNU/Linux, you need the headers so GCC
  can build the exception handling for libgcc.
! </p>
! </dd>
! <dt><code>--with-libs</code></dt>
! <dt><code>--with-libs=&quot;<var>dir1</var> <var>dir2</var> &hellip; <var>dirN</var>&quot;</code></dt>
! <dd><p>Deprecated in favor of <samp>--with-sysroot</samp>.
  Specifies a list of directories which contain the target runtime
! libraries.  These libraries will be copied into the <samp>gcc</samp> install
  directory.  If the directory list is omitted, this option has no
  effect.
! </p>
! </dd>
! <dt><code>--with-newlib</code></dt>
! <dd><p>Specifies that &lsquo;<samp>newlib</samp>&rsquo; is
  being used as the target C library.  This causes <code>__eprintf</code> to be
! omitted from <samp>libgcc.a</samp> on the assumption that it will be provided by
! &lsquo;<samp>newlib</samp>&rsquo;.
! </p>
! </dd>
! <dt><code>--with-avrlibc</code></dt>
! <dd><p>Specifies that &lsquo;<samp>AVR-Libc</samp>&rsquo; is
  being used as the target C library.  This causes float support
! functions like <code>__addsf3</code> to be omitted from <samp>libgcc.a</samp> on
! the assumption that it will be provided by <samp>libm.a</samp>.  For more
! technical details, cf. <a href="http://gcc.gnu.org/PR54461">PR54461</a>.
  This option is only supported for the AVR target.  It is not supported for
  RTEMS configurations, which currently use newlib.  The option is
  supported since version 4.7.2 and is the default in 4.8.0 and newer.
! </p>
! </dd>
! <dt><code>--with-nds32-lib=<var>library</var></code></dt>
! <dd><p>Specifies that <var>library</var> setting is used for building <samp>libgcc.a</samp>.
! Currently, the valid <var>library</var> is &lsquo;<samp>newlib</samp>&rsquo; or &lsquo;<samp>mculib</samp>&rsquo;.
  This option is only supported for the NDS32 target.
! </p>
! </dd>
! <dt><code>--with-build-time-tools=<var>dir</var></code></dt>
! <dd><p>Specifies where to find the set of target tools (assembler, linker, etc.)
  that will be used while building GCC itself.  This option can be useful
  if the directory layouts are different between the system you are building
  GCC on, and the system where you will deploy it.
! </p>
! <p>For example, on an &lsquo;<samp>ia64-hp-hpux</samp>&rsquo; system, you may have the GNU
! assembler and linker in <samp>/usr/bin</samp>, and the native tools in a
  different path, and build a toolchain that expects to find the
! native tools in <samp>/usr/bin</samp>.
! </p>
! <p>When you use this option, you should ensure that <var>dir</var> includes
! <code>ar</code>, <code>as</code>, <code>ld</code>, <code>nm</code>,
! <code>ranlib</code> and <code>strip</code> if necessary, and possibly
! <code>objdump</code>.  Otherwise, GCC may use an inconsistent set of
! tools.
! </p></dd>
! </dl>
  
! <a name="Overriding-configure-test-results"></a>
! <h4 class="subsubheading">Overriding <code>configure</code> test results</h4>
! 
! <p>Sometimes, it might be necessary to override the result of some
! <code>configure</code> test, for example in order to ease porting to a new
! system or work around a bug in a test.  The toplevel <code>configure</code>
! script provides three variables for this:
! </p>
! <dl compact="compact">
! <dt><code>build_configargs</code></dt>
! <dd><a name="index-build_005fconfigargs"></a>
! <p>The contents of this variable is passed to all build <code>configure</code>
! scripts.
! </p>
! </dd>
! <dt><code>host_configargs</code></dt>
! <dd><a name="index-host_005fconfigargs"></a>
! <p>The contents of this variable is passed to all host <code>configure</code>
! scripts.
! </p>
! </dd>
! <dt><code>target_configargs</code></dt>
! <dd><a name="index-target_005fconfigargs"></a>
! <p>The contents of this variable is passed to all target <code>configure</code>
! scripts.
! </p>
! </dd>
  </dl>
  
! <p>In order to avoid shell and <code>make</code> quoting issues for complex
! overrides, you can pass a setting for <code>CONFIG_SITE</code> and set
! variables in the site file.
! </p>
! <a name="Java_002dSpecific-Options"></a>
! <h4 class="subheading">Java-Specific Options</h4>
  
  <p>The following option applies to the build of the Java front end.
! </p>
! <dl compact="compact">
! <dt><code>--disable-libgcj</code></dt>
! <dd><p>Specify that the run-time libraries
  used by GCJ should not be built.  This is useful in case you intend
! to use GCJ with some other run-time, or you&rsquo;re going to install it
  separately, or it just happens not to build on your particular
  machine.  In general, if the Java front end is enabled, the GCJ
! libraries will be enabled too, unless they&rsquo;re known to not work on
! the target platform.  If GCJ is enabled but &lsquo;<samp>libgcj</samp>&rsquo; isn&rsquo;t built, you
  may need to port it; in this case, before modifying the top-level
! <samp>configure.in</samp> so that &lsquo;<samp>libgcj</samp>&rsquo; is enabled by default on this platform,
! you may use <samp>--enable-libgcj</samp> to override the default.
! </p>
! </dd>
! </dl>
  
! <p>The following options apply to building &lsquo;<samp>libgcj</samp>&rsquo;.
! </p>
! <a name="General-Options"></a>
! <h4 class="subsubheading">General Options</h4>
  
! <dl compact="compact">
! <dt><code>--enable-java-maintainer-mode</code></dt>
! <dd><p>By default the &lsquo;<samp>libjava</samp>&rsquo; build will not attempt to compile the
! <samp>.java</samp> source files to <samp>.class</samp>.  Instead, it will use the
! <samp>.class</samp> files from the source tree.  If you use this option you
! must have executables named <code>ecj1</code> and <code>gjavah</code> in your path
  for use by the build.  You must use this option if you intend to
! modify any <samp>.java</samp> files in <samp>libjava</samp>.
! </p>
! </dd>
! <dt><code>--with-java-home=<var>dirname</var></code></dt>
! <dd><p>This &lsquo;<samp>libjava</samp>&rsquo; option overrides the default value of the
! &lsquo;<samp>java.home</samp>&rsquo; system property.  It is also used to set
! &lsquo;<samp>sun.boot.class.path</samp>&rsquo; to <samp><var>dirname</var>/lib/rt.jar</samp>.  By
! default &lsquo;<samp>java.home</samp>&rsquo; is set to <samp><var>prefix</var></samp> and
! &lsquo;<samp>sun.boot.class.path</samp>&rsquo; to
! <samp><var>datadir</var>/java/libgcj-<var>version</var>.jar</samp>.
! </p>
! </dd>
! <dt><code>--with-ecj-jar=<var>filename</var></code></dt>
! <dd><p>This option can be used to specify the location of an external jar
  file containing the Eclipse Java compiler.  A specially modified
! version of this compiler is used by <code>gcj</code> to parse
! <samp>.java</samp> source files.  If this option is given, the
! &lsquo;<samp>libjava</samp>&rsquo; build will create and install an <samp>ecj1</samp> executable
  which uses this jar file at runtime.
! </p>
! <p>If this option is not given, but an <samp>ecj.jar</samp> file is found in
! the topmost source tree at configure time, then the &lsquo;<samp>libgcj</samp>&rsquo;
! build will create and install <samp>ecj1</samp>, and will also install the
! discovered <samp>ecj.jar</samp> into a suitable place in the install tree.
! </p>
! <p>If <samp>ecj1</samp> is not installed, then the user will have to supply one
! on his path in order for <code>gcj</code> to properly parse <samp>.java</samp>
  source files.  A suitable jar is available from
  <a href="ftp://sourceware.org/pub/java/">ftp://sourceware.org/pub/java/</a>.
! </p>
! </dd>
! <dt><code>--disable-getenv-properties</code></dt>
! <dd><p>Don&rsquo;t set system properties from <code>GCJ_PROPERTIES</code>.
! </p>
! </dd>
! <dt><code>--enable-hash-synchronization</code></dt>
! <dd><p>Use a global hash table for monitor locks.  Ordinarily,
! &lsquo;<samp>libgcj</samp>&rsquo;&rsquo;s &lsquo;<samp>configure</samp>&rsquo; script automatically makes
  the correct choice for this option for your platform.  Only use
  this if you know you need the library to be configured differently.
! </p>
! </dd>
! <dt><code>--enable-interpreter</code></dt>
! <dd><p>Enable the Java interpreter.  The interpreter is automatically
  enabled by default on all platforms that support it.  This option
  is really only useful if you want to disable the interpreter
! (using <samp>--disable-interpreter</samp>).
! </p>
! </dd>
! <dt><code>--disable-java-net</code></dt>
! <dd><p>Disable java.net.  This disables the native part of java.net only,
  using non-functional stubs for native method implementations.
! </p>
! </dd>
! <dt><code>--disable-jvmpi</code></dt>
! <dd><p>Disable JVMPI support.
! </p>
! </dd>
! <dt><code>--disable-libgcj-bc</code></dt>
! <dd><p>Disable BC ABI compilation of certain parts of libgcj.  By default,
! some portions of libgcj are compiled with <samp>-findirect-dispatch</samp>
! and <samp>-fno-indirect-classes</samp>, allowing them to be overridden at
  run-time.
! </p>
! <p>If <samp>--disable-libgcj-bc</samp> is specified, libgcj is built without
  these options.  This allows the compile-time linker to resolve
  dependencies when statically linking to libgcj.  However it makes it
  impossible to override the affected portions of libgcj at run-time.
! </p>
! </dd>
! <dt><code>--enable-reduced-reflection</code></dt>
! <dd><p>Build most of libgcj with <samp>-freduced-reflection</samp>.  This reduces
  the size of libgcj at the expense of not being able to do accurate
  reflection on the classes it contains.  This option is safe if you
  know that code using libgcj will never use reflection on the standard
  runtime classes in libgcj (including using serialization, RMI or CORBA).
! </p>
! </dd>
! <dt><code>--with-ecos</code></dt>
! <dd><p>Enable runtime eCos target support.
! </p>
! </dd>
! <dt><code>--without-libffi</code></dt>
! <dd><p>Don&rsquo;t use &lsquo;<samp>libffi</samp>&rsquo;.  This will disable the interpreter and JNI
! support as well, as these require &lsquo;<samp>libffi</samp>&rsquo; to work.
! </p>
! </dd>
! <dt><code>--enable-libgcj-debug</code></dt>
! <dd><p>Enable runtime debugging code.
! </p>
! </dd>
! <dt><code>--enable-libgcj-multifile</code></dt>
! <dd><p>If specified, causes all <samp>.java</samp> source files to be
! compiled into <samp>.class</samp> files in one invocation of
! &lsquo;<samp>gcj</samp>&rsquo;.  This can speed up build time, but is more
  resource-intensive.  If this option is unspecified or
! disabled, &lsquo;<samp>gcj</samp>&rsquo; is invoked once for each <samp>.java</samp>
! file to compile into a <samp>.class</samp> file.
! </p>
! </dd>
! <dt><code>--with-libiconv-prefix=DIR</code></dt>
! <dd><p>Search for libiconv in <samp>DIR/include</samp> and <samp>DIR/lib</samp>.
! </p>
! </dd>
! <dt><code>--with-system-zlib</code></dt>
! <dd><p>Use installed &lsquo;<samp>zlib</samp>&rsquo; rather than that included with GCC.
! </p>
! </dd>
! <dt><code>--with-win32-nlsapi=ansi, unicows or unicode</code></dt>
! <dd><p>Indicates how MinGW &lsquo;<samp>libgcj</samp>&rsquo; translates between UNICODE
  characters and the Win32 API.
! </p>
! </dd>
! <dt><code>--enable-java-home</code></dt>
! <dd><p>If enabled, this creates a JPackage compatible SDK environment during install.
  Note that if &ndash;enable-java-home is used, &ndash;with-arch-directory=ARCH must also
  be specified.
! </p>
! </dd>
! <dt><code>--with-arch-directory=ARCH</code></dt>
! <dd><p>Specifies the name to use for the <samp>jre/lib/ARCH</samp> directory in the SDK
  environment created when &ndash;enable-java-home is passed. Typical names for this
  directory include i386, amd64, ia64, etc.
! </p>
! </dd>
! <dt><code>--with-os-directory=DIR</code></dt>
! <dd><p>Specifies the OS directory for the SDK include directory. This is set to auto
! detect, and is typically &rsquo;linux&rsquo;.
! </p>
! </dd>
! <dt><code>--with-origin-name=NAME</code></dt>
! <dd><p>Specifies the JPackage origin name. This defaults to the &rsquo;gcj&rsquo; in
  java-1.5.0-gcj.
! </p>
! </dd>
! <dt><code>--with-arch-suffix=SUFFIX</code></dt>
! <dd><p>Specifies the suffix for the sdk directory. Defaults to the empty string.
! Examples include &rsquo;.x86_64&rsquo; in &rsquo;java-1.5.0-gcj-1.5.0.0.x86_64&rsquo;.
! </p>
! </dd>
! <dt><code>--with-jvm-root-dir=DIR</code></dt>
! <dd><p>Specifies where to install the SDK. Default is $(prefix)/lib/jvm.
! </p>
! </dd>
! <dt><code>--with-jvm-jar-dir=DIR</code></dt>
! <dd><p>Specifies where to install jars. Default is $(prefix)/lib/jvm-exports.
! </p>
! </dd>
! <dt><code>--with-python-dir=DIR</code></dt>
! <dd><p>Specifies where to install the Python modules used for aot-compile. DIR should
  not include the prefix used in installation. For example, if the Python modules
  are to be installed in /usr/lib/python2.5/site-packages, then
  &ndash;with-python-dir=/lib/python2.5/site-packages should be passed. If this is
  not specified, then the Python modules are installed in $(prefix)/share/python.
! </p>
! </dd>
! <dt><code>--enable-aot-compile-rpm</code></dt>
! <dd><p>Adds aot-compile-rpm to the list of installed scripts.
! </p>
! </dd>
! <dt><code>--enable-browser-plugin</code></dt>
! <dd><p>Build the gcjwebplugin web browser plugin.
! </p>
! </dd>
! <dt><code>--enable-static-libjava</code></dt>
! <dd><p>Build static libraries in libjava. The default is to only build shared
  libraries.
! </p>
! <dl compact="compact">
! <dt><code>ansi</code></dt>
! <dd><p>Use the single-byte <code>char</code> and the Win32 A functions natively,
  translating to and from UNICODE when using these functions.  If
  unspecified, this is the default.
! </p>
! </dd>
! <dt><code>unicows</code></dt>
! <dd><p>Use the <code>WCHAR</code> and Win32 W functions natively.  Adds
! <code>-lunicows</code> to <samp>libgcj.spec</samp> to link with &lsquo;<samp>libunicows</samp>&rsquo;.
! <samp>unicows.dll</samp> needs to be deployed on Microsoft Windows 9X machines
! running built executables.  <samp>libunicows.a</samp>, an open-source
! import library around Microsoft&rsquo;s <code>unicows.dll</code>, is obtained from
  <a href="http://libunicows.sourceforge.net/">http://libunicows.sourceforge.net/</a>, which also gives details
! on getting <samp>unicows.dll</samp> from Microsoft.
! </p>
! </dd>
! <dt><code>unicode</code></dt>
! <dd><p>Use the <code>WCHAR</code> and Win32 W functions natively.  Does <em>not</em>
! add <code>-lunicows</code> to <samp>libgcj.spec</samp>.  The built executables will
! only run on Microsoft Windows NT and above.
! </p></dd>
! </dl>
! </dd>
  </dl>
  
! <a name="AWT_002dSpecific-Options"></a>
! <h4 class="subsubheading">AWT-Specific Options</h4>
  
! <dl compact="compact">
! <dt><code>--with-x</code></dt>
! <dd><p>Use the X Window System.
! </p>
! </dd>
! <dt><code>--enable-java-awt=PEER(S)</code></dt>
! <dd><p>Specifies the AWT peer library or libraries to build alongside
! &lsquo;<samp>libgcj</samp>&rsquo;.  If this option is unspecified or disabled, AWT
! will be non-functional.  Current valid values are <samp>gtk</samp> and
! <samp>xlib</samp>.  Multiple libraries should be separated by a
! comma (i.e. <samp>--enable-java-awt=gtk,xlib</samp>).
! </p>
! </dd>
! <dt><code>--enable-gtk-cairo</code></dt>
! <dd><p>Build the cairo Graphics2D implementation on GTK.
! </p>
! </dd>
! <dt><code>--enable-java-gc=TYPE</code></dt>
! <dd><p>Choose garbage collector.  Defaults to <samp>boehm</samp> if unspecified.
! </p>
! </dd>
! <dt><code>--disable-gtktest</code></dt>
! <dd><p>Do not try to compile and run a test GTK+ program.
! </p>
! </dd>
! <dt><code>--disable-glibtest</code></dt>
! <dd><p>Do not try to compile and run a test GLIB program.
! </p>
! </dd>
! <dt><code>--with-libart-prefix=PFX</code></dt>
! <dd><p>Prefix where libart is installed (optional).
! </p>
! </dd>
! <dt><code>--with-libart-exec-prefix=PFX</code></dt>
! <dd><p>Exec prefix where libart is installed (optional).
! </p>
! </dd>
! <dt><code>--disable-libarttest</code></dt>
! <dd><p>Do not try to compile and run a test libart program.
! </p>
! </dd>
! </dl>
  
  
! <hr />
! <p>
! <p><a href="./index.html">Return to the GCC Installation page</a>
! </p>
  
  
  
  
  
  
  
  
  
  
  
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/download.html gcc-5.5.0/INSTALL/download.html
*** gcc-5.4.0/INSTALL/download.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/download.html	Tue Oct 10 08:13:23 2017
***************
*** 1,87 ****
! <html lang="en">
! <head>
! <title>Downloading GCC</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Downloading GCC">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
- <body>
- <h1 class="settitle">Downloading GCC</h1>
- <a name="index-Downloading-GCC-1"></a><a name="index-Downloading-the-Source-2"></a>
- GCC is distributed via <a href="http://gcc.gnu.org/svn.html">SVN</a> and FTP
- tarballs compressed with <samp><span class="command">gzip</span></samp> or
- <samp><span class="command">bzip2</span></samp>.
  
!    <p>Please refer to the <a href="http://gcc.gnu.org/releases.html">releases web page</a>
! for information on how to obtain GCC.
  
!    <p>The source distribution includes the C, C++, Objective-C, Fortran, Java,
  and Ada (in the case of GCC 3.1 and later) compilers, as well as
! runtime libraries for C++, Objective-C, Fortran, and Java. 
  For previous versions these were downloadable as separate components such
  as the core GCC distribution, which included the C language front end and
  shared components, and language-specific distributions including the
  language front end and the language runtime (where appropriate).
! 
!    <p>If you also intend to build binutils (either to upgrade an existing
  installation or for use in place of the corresponding tools of your
  OS), unpack the binutils distribution either in the same directory or
  a separate one.  In the latter case, add symbolic links to any
  components of the binutils you intend to build alongside the compiler
! (<samp><span class="file">bfd</span></samp>, <samp><span class="file">binutils</span></samp>, <samp><span class="file">gas</span></samp>, <samp><span class="file">gprof</span></samp>, <samp><span class="file">ld</span></samp>,
! <samp><span class="file">opcodes</span></samp>, <small class="dots">...</small>) to the directory containing the GCC sources.
! 
!    <p>Likewise the GMP, MPFR and MPC libraries can be automatically built
  together with GCC.  Unpack the GMP, MPFR and/or MPC source
  distributions in the directory containing the GCC sources and rename
! their directories to <samp><span class="file">gmp</span></samp>, <samp><span class="file">mpfr</span></samp> and <samp><span class="file">mpc</span></samp>,
  respectively (or use symbolic links with the same name).
! 
!    <p><hr />
  <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- ***Configuration*********************************************************** -->
- <!-- ***Building**************************************************************** -->
- <!-- ***Testing***************************************************************** -->
- <!-- ***Final install*********************************************************** -->
- <!-- ***Binaries**************************************************************** -->
- <!-- ***Specific**************************************************************** -->
- <!-- ***Old documentation****************************************************** -->
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 1,132 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
  
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
  
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <a name="index-Downloading-GCC"></a>
! <a name="index-Downloading-the-Source"></a>
! 
! <p>GCC is distributed via <a href="http://gcc.gnu.org/svn.html">SVN</a> and FTP
! tarballs compressed with <code>gzip</code> or
! <code>bzip2</code>.
! </p>
! <p>Please refer to the <a href="http://gcc.gnu.org/releases.html">releases web page</a>
! for information on how to obtain GCC.
! </p>
! <p>The source distribution includes the C, C++, Objective-C, Fortran, Java,
  and Ada (in the case of GCC 3.1 and later) compilers, as well as
! runtime libraries for C++, Objective-C, Fortran, and Java.
  For previous versions these were downloadable as separate components such
  as the core GCC distribution, which included the C language front end and
  shared components, and language-specific distributions including the
  language front end and the language runtime (where appropriate).
! </p>
! <p>If you also intend to build binutils (either to upgrade an existing
  installation or for use in place of the corresponding tools of your
  OS), unpack the binutils distribution either in the same directory or
  a separate one.  In the latter case, add symbolic links to any
  components of the binutils you intend to build alongside the compiler
! (<samp>bfd</samp>, <samp>binutils</samp>, <samp>gas</samp>, <samp>gprof</samp>, <samp>ld</samp>,
! <samp>opcodes</samp>, &hellip;) to the directory containing the GCC sources.
! </p>
! <p>Likewise the GMP, MPFR and MPC libraries can be automatically built
  together with GCC.  Unpack the GMP, MPFR and/or MPC source
  distributions in the directory containing the GCC sources and rename
! their directories to <samp>gmp</samp>, <samp>mpfr</samp> and <samp>mpc</samp>,
  respectively (or use symbolic links with the same name).
! </p>
! <hr />
! <p>
  <p><a href="./index.html">Return to the GCC Installation page</a>
+ </p>
+ 
+ 
+ 
  
  
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/finalinstall.html gcc-5.5.0/INSTALL/finalinstall.html
*** gcc-5.4.0/INSTALL/finalinstall.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/finalinstall.html	Tue Oct 10 08:13:24 2017
***************
*** 1,172 ****
! <html lang="en">
! <head>
! <title>Installing GCC: Final installation</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Installing GCC: Final installation">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
! <body>
! <h1 class="settitle">Installing GCC: Final installation</h1>
! Now that GCC has been built (and optionally tested), you can install it with
! <pre class="smallexample">     cd <var>objdir</var> &amp;&amp; make install
! </pre>
!    <p>We strongly recommend to install into a target directory where there is
  no previous version of GCC present.  Also, the GNAT runtime should not
  be stripped, as this would break certain features of the debugger that
  depend on this debugging information (catching Ada exceptions for
  instance).
! 
!    <p>That step completes the installation of GCC; user level binaries can
! be found in <samp><var>prefix</var><span class="file">/bin</span></samp> where <var>prefix</var> is the value
! you specified with the <samp><span class="option">--prefix</span></samp> to configure (or
! <samp><span class="file">/usr/local</span></samp> by default).  (If you specified <samp><span class="option">--bindir</span></samp>,
  that directory will be used instead; otherwise, if you specified
! <samp><span class="option">--exec-prefix</span></samp>, <samp><var>exec-prefix</var><span class="file">/bin</span></samp> will be used.) 
  Headers for the C++ and Java libraries are installed in
! <samp><var>prefix</var><span class="file">/include</span></samp>; libraries in <samp><var>libdir</var></samp>
! (normally <samp><var>prefix</var><span class="file">/lib</span></samp>); internal parts of the compiler in
! <samp><var>libdir</var><span class="file">/gcc</span></samp> and <samp><var>libexecdir</var><span class="file">/gcc</span></samp>; documentation
  in info format in <samp><var>infodir</var></samp> (normally
! <samp><var>prefix</var><span class="file">/info</span></samp>).
! 
!    <p>When installing cross-compilers, GCC's executables
  are not only installed into <samp><var>bindir</var></samp>, that
! is, <samp><var>exec-prefix</var><span class="file">/bin</span></samp>, but additionally into
! <samp><var>exec-prefix</var><span class="file">/</span><var>target-alias</var><span class="file">/bin</span></samp>, if that directory
! exists.  Typically, such <dfn>tooldirs</dfn> hold target-specific
  binutils, including assembler and linker.
! 
!    <p>Installation into a temporary staging area or into a <samp><span class="command">chroot</span></samp>
  jail can be achieved with the command
  
! <pre class="smallexample">     make DESTDIR=<var>path-to-rootdir</var> install
! </pre>
!    <p class="noindent">where <var>path-to-rootdir</var> is the absolute path of
  a directory relative to which all installation paths will be
  interpreted.  Note that the directory specified by <code>DESTDIR</code>
  need not exist yet; it will be created if necessary.
! 
!    <p>There is a subtle point with tooldirs and <code>DESTDIR</code>:
  If you relocate a cross-compiler installation with
! e.g. &lsquo;<samp><span class="samp">DESTDIR=</span><var>rootdir</var></samp>&rsquo;, then the directory
! <samp><var>rootdir</var><span class="file">/</span><var>exec-prefix</var><span class="file">/</span><var>target-alias</var><span class="file">/bin</span></samp> will
  be filled with duplicated GCC executables only if it already exists,
  it will not be created otherwise.  This is regarded as a feature,
  not as a bug, because it gives slightly more control to the packagers
  using the <code>DESTDIR</code> feature.
  
!    <p>You can install stripped programs and libraries with
! 
! <pre class="smallexample">     make install-strip
! </pre>
!    <p>If you are bootstrapping a released version of GCC then please
  quickly review the build status page for your release, available from
! <a href="http://gcc.gnu.org/buildstat.html">http://gcc.gnu.org/buildstat.html</a>. 
  If your system is not listed for the version of GCC that you built,
  send a note to
  <a href="mailto:gcc@gcc.gnu.org">gcc@gcc.gnu.org</a> indicating
! that you successfully built and installed GCC. 
  Include the following information:
! 
!      <ul>
! <li>Output from running <samp><var>srcdir</var><span class="file">/config.guess</span></samp>.  Do not send
  that file itself, just the one-line output from running it.
  
!      <li>The output of &lsquo;<samp><span class="samp">gcc -v</span></samp>&rsquo; for your newly installed <samp><span class="command">gcc</span></samp>. 
  This tells us which version of GCC you built and the options you passed to
  configure.
  
!      <li>Whether you enabled all languages or a subset of them.  If you used a
  full distribution then this information is part of the configure
! options in the output of &lsquo;<samp><span class="samp">gcc -v</span></samp>&rsquo;, but if you downloaded the
! &ldquo;core&rdquo; compiler plus additional front ends then it isn't apparent
  which ones you built unless you tell us about it.
  
!      <li>If the build was for GNU/Linux, also include:
!           <ul>
! <li>The distribution name and version (e.g., Red Hat 7.1 or Debian 2.2.3);
! this information should be available from <samp><span class="file">/etc/issue</span></samp>.
  
!           <li>The version of the Linux kernel, available from &lsquo;<samp><span class="samp">uname --version</span></samp>&rsquo;
! or &lsquo;<samp><span class="samp">uname -a</span></samp>&rsquo;.
  
!           <li>The version of glibc you used; for RPM-based systems like Red Hat,
! Mandrake, and SuSE type &lsquo;<samp><span class="samp">rpm -q glibc</span></samp>&rsquo; to get the glibc version,
! and on systems like Debian and Progeny use &lsquo;<samp><span class="samp">dpkg -l libc6</span></samp>&rsquo;. 
! </ul>
!      For other systems, you can include similar information if you think it is
  relevant.
! 
!      <li>Any other information that you think would be useful to people building
  GCC on the same configuration.  The new entry in the build status list
! will include a link to the archived copy of your message. 
! </ul>
  
!    <p>We'd also like to know if the
  <a href="specific.html">host/target specific installation notes</a>
! didn't include your host/target information or if that information is
  incomplete or out of date.  Send a note to
  <a href="mailto:gcc@gcc.gnu.org">gcc@gcc.gnu.org</a> detailing how the information should be changed.
! 
!    <p>If you find a bug, please report it following the
  <a href="../bugs/">bug reporting guidelines</a>.
! 
!    <p>If you want to print the GCC manuals, do &lsquo;<samp><span class="samp">cd </span><var>objdir</var><span class="samp">; make
! dvi</span></samp>&rsquo;.  You will need to have <samp><span class="command">texi2dvi</span></samp> (version at least 4.7)
! and TeX installed.  This creates a number of <samp><span class="file">.dvi</span></samp> files in
  subdirectories of <samp><var>objdir</var></samp>; these may be converted for
! printing with programs such as <samp><span class="command">dvips</span></samp>.  Alternately, by using
! &lsquo;<samp><span class="samp">make pdf</span></samp>&rsquo; in place of &lsquo;<samp><span class="samp">make dvi</span></samp>&rsquo;, you can create documentation
! in the form of <samp><span class="file">.pdf</span></samp> files; this requires <samp><span class="command">texi2pdf</span></samp>, which
  is included with Texinfo version 4.8 and later.  You can also
! <a href="http://shop.fsf.org/">buy printed manuals from the Free Software Foundation</a>, though such manuals may not be for the most
  recent version of GCC.
  
-    <p>If you would like to generate online HTML documentation, do &lsquo;<samp><span class="samp">cd
- </span><var>objdir</var><span class="samp">; make html</span></samp>&rsquo; and HTML will be generated for the gcc manuals in
- <samp><var>objdir</var><span class="file">/gcc/HTML</span></samp>.
  
-    <p><hr />
- <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- ***Binaries**************************************************************** -->
- <!-- ***Specific**************************************************************** -->
- <!-- ***Old documentation****************************************************** -->
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 1,227 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
! 
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <p>Now that GCC has been built (and optionally tested), you can install it with
! </p><div class="smallexample">
! <pre class="smallexample">cd <var>objdir</var> &amp;&amp; make install
! </pre></div>
! 
! <p>We strongly recommend to install into a target directory where there is
  no previous version of GCC present.  Also, the GNAT runtime should not
  be stripped, as this would break certain features of the debugger that
  depend on this debugging information (catching Ada exceptions for
  instance).
! </p>
! <p>That step completes the installation of GCC; user level binaries can
! be found in <samp><var>prefix</var>/bin</samp> where <var>prefix</var> is the value
! you specified with the <samp>--prefix</samp> to configure (or
! <samp>/usr/local</samp> by default).  (If you specified <samp>--bindir</samp>,
  that directory will be used instead; otherwise, if you specified
! <samp>--exec-prefix</samp>, <samp><var>exec-prefix</var>/bin</samp> will be used.)
  Headers for the C++ and Java libraries are installed in
! <samp><var>prefix</var>/include</samp>; libraries in <samp><var>libdir</var></samp>
! (normally <samp><var>prefix</var>/lib</samp>); internal parts of the compiler in
! <samp><var>libdir</var>/gcc</samp> and <samp><var>libexecdir</var>/gcc</samp>; documentation
  in info format in <samp><var>infodir</var></samp> (normally
! <samp><var>prefix</var>/info</samp>).
! </p>
! <p>When installing cross-compilers, GCC&rsquo;s executables
  are not only installed into <samp><var>bindir</var></samp>, that
! is, <samp><var>exec-prefix</var>/bin</samp>, but additionally into
! <samp><var>exec-prefix</var>/<var>target-alias</var>/bin</samp>, if that directory
! exists.  Typically, such <em>tooldirs</em> hold target-specific
  binutils, including assembler and linker.
! </p>
! <p>Installation into a temporary staging area or into a <code>chroot</code>
  jail can be achieved with the command
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">make DESTDIR=<var>path-to-rootdir</var> install
+ </pre></div>
  
! <p>where <var>path-to-rootdir</var> is the absolute path of
  a directory relative to which all installation paths will be
  interpreted.  Note that the directory specified by <code>DESTDIR</code>
  need not exist yet; it will be created if necessary.
! </p>
! <p>There is a subtle point with tooldirs and <code>DESTDIR</code>:
  If you relocate a cross-compiler installation with
! e.g. &lsquo;<samp>DESTDIR=<var>rootdir</var></samp>&rsquo;, then the directory
! <samp><var>rootdir</var>/<var>exec-prefix</var>/<var>target-alias</var>/bin</samp> will
  be filled with duplicated GCC executables only if it already exists,
  it will not be created otherwise.  This is regarded as a feature,
  not as a bug, because it gives slightly more control to the packagers
  using the <code>DESTDIR</code> feature.
+ </p>
+ <p>You can install stripped programs and libraries with
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">make install-strip
+ </pre></div>
  
! <p>If you are bootstrapping a released version of GCC then please
  quickly review the build status page for your release, available from
! <a href="http://gcc.gnu.org/buildstat.html">http://gcc.gnu.org/buildstat.html</a>.
  If your system is not listed for the version of GCC that you built,
  send a note to
  <a href="mailto:gcc@gcc.gnu.org">gcc@gcc.gnu.org</a> indicating
! that you successfully built and installed GCC.
  Include the following information:
! </p>
! <ul>
! <li> Output from running <samp><var>srcdir</var>/config.guess</samp>.  Do not send
  that file itself, just the one-line output from running it.
  
! </li><li> The output of &lsquo;<samp>gcc -v</samp>&rsquo; for your newly installed <code>gcc</code>.
  This tells us which version of GCC you built and the options you passed to
  configure.
  
! </li><li> Whether you enabled all languages or a subset of them.  If you used a
  full distribution then this information is part of the configure
! options in the output of &lsquo;<samp>gcc -v</samp>&rsquo;, but if you downloaded the
! &ldquo;core&rdquo; compiler plus additional front ends then it isn&rsquo;t apparent
  which ones you built unless you tell us about it.
  
! </li><li> If the build was for GNU/Linux, also include:
! <ul>
! <li> The distribution name and version (e.g., Red Hat 7.1 or Debian 2.2.3);
! this information should be available from <samp>/etc/issue</samp>.
  
! </li><li> The version of the Linux kernel, available from &lsquo;<samp>uname --version</samp>&rsquo;
! or &lsquo;<samp>uname -a</samp>&rsquo;.
  
! </li><li> The version of glibc you used; for RPM-based systems like Red Hat,
! Mandrake, and SuSE type &lsquo;<samp>rpm -q glibc</samp>&rsquo; to get the glibc version,
! and on systems like Debian and Progeny use &lsquo;<samp>dpkg -l libc6</samp>&rsquo;.
! </li></ul>
! <p>For other systems, you can include similar information if you think it is
  relevant.
! </p>
! </li><li> Any other information that you think would be useful to people building
  GCC on the same configuration.  The new entry in the build status list
! will include a link to the archived copy of your message.
! </li></ul>
  
! <p>We&rsquo;d also like to know if the
  <a href="specific.html">host/target specific installation notes</a>
! didn&rsquo;t include your host/target information or if that information is
  incomplete or out of date.  Send a note to
  <a href="mailto:gcc@gcc.gnu.org">gcc@gcc.gnu.org</a> detailing how the information should be changed.
! </p>
! <p>If you find a bug, please report it following the
  <a href="../bugs/">bug reporting guidelines</a>.
! </p>
! <p>If you want to print the GCC manuals, do &lsquo;<samp>cd <var>objdir</var>; make
! dvi</samp>&rsquo;.  You will need to have <code>texi2dvi</code> (version at least 4.7)
! and TeX installed.  This creates a number of <samp>.dvi</samp> files in
  subdirectories of <samp><var>objdir</var></samp>; these may be converted for
! printing with programs such as <code>dvips</code>.  Alternately, by using
! &lsquo;<samp>make pdf</samp>&rsquo; in place of &lsquo;<samp>make dvi</samp>&rsquo;, you can create documentation
! in the form of <samp>.pdf</samp> files; this requires <code>texi2pdf</code>, which
  is included with Texinfo version 4.8 and later.  You can also
! <a href="http://shop.fsf.org/">buy printed manuals from the
! Free Software Foundation</a>, though such manuals may not be for the most
  recent version of GCC.
+ </p>
+ <p>If you would like to generate online HTML documentation, do &lsquo;<samp>cd
+ <var>objdir</var>; make html</samp>&rsquo; and HTML will be generated for the gcc manuals in
+ <samp><var>objdir</var>/gcc/HTML</samp>.
+ </p>
+ <hr />
+ <p>
+ <p><a href="./index.html">Return to the GCC Installation page</a>
+ </p>
+ 
+ 
  
  
  
  
+ 
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/gfdl.html gcc-5.5.0/INSTALL/gfdl.html
*** gcc-5.4.0/INSTALL/gfdl.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/gfdl.html	Tue Oct 10 08:13:25 2017
***************
*** 1,82 ****
! <html lang="en">
! <head>
! <title>Installing GCC: GNU Free Documentation License</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Installing GCC: GNU Free Documentation License">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
- <body>
- <h1 class="settitle">Installing GCC: GNU Free Documentation License</h1>
- <h1 align="center">Installing GCC: GNU Free Documentation License</h1><!-- man begin DESCRIPTION -->
  
!    <p><a name="index-FDL_002c-GNU-Free-Documentation-License-1"></a><div align="center">Version 1.3, 3 November 2008</div>
  
- <pre class="display">     Copyright &copy; 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
-      <a href="http://fsf.org/">http://fsf.org/</a>
-      
-      Everyone is permitted to copy and distribute verbatim copies
-      of this license document, but changing it is not allowed.
- </pre>
-      <ol type=1 start=0>
- <li>PREAMBLE
  
!      <p>The purpose of this License is to make a manual, textbook, or other
! functional and useful document <dfn>free</dfn> in the sense of freedom: to
  assure everyone the effective freedom to copy and redistribute it,
! with or without modifying it, either commercially or noncommercially. 
  Secondarily, this License preserves for the author and publisher a way
  to get credit for their work, while not being considered responsible
  for modifications made by others.
! 
!      <p>This License is a kind of &ldquo;copyleft&rdquo;, which means that derivative
  works of the document must themselves be free in the same sense.  It
  complements the GNU General Public License, which is a copyleft
  license designed for free software.
! 
!      <p>We have designed this License in order to use it for manuals for free
  software, because free software needs free documentation: a free
  program should come with manuals providing the same freedoms that the
  software does.  But this License is not limited to software manuals;
  it can be used for any textual work, regardless of subject matter or
  whether it is published as a printed book.  We recommend this License
  principally for works whose purpose is instruction or reference.
  
!      <li>APPLICABILITY AND DEFINITIONS
! 
!      <p>This License applies to any manual or other work, in any medium, that
  contains a notice placed by the copyright holder saying it can be
  distributed under the terms of this License.  Such a notice grants a
  world-wide, royalty-free license, unlimited in duration, to use that
--- 1,133 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
  
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
  
  
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <h1 align="center">Installing GCC: GNU Free Documentation License</h1>
! 
! <a name="index-FDL_002c-GNU-Free-Documentation-License"></a>
! <div align="center">Version 1.3, 3 November 2008
! </div>
! <div class="display">
! <pre class="display">Copyright &copy; 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
! <a href="http://fsf.org/">http://fsf.org/</a>
! 
! Everyone is permitted to copy and distribute verbatim copies
! of this license document, but changing it is not allowed.
! </pre></div>
! 
! <ol>
! <li> PREAMBLE
! 
! <p>The purpose of this License is to make a manual, textbook, or other
! functional and useful document <em>free</em> in the sense of freedom: to
  assure everyone the effective freedom to copy and redistribute it,
! with or without modifying it, either commercially or noncommercially.
  Secondarily, this License preserves for the author and publisher a way
  to get credit for their work, while not being considered responsible
  for modifications made by others.
! </p>
! <p>This License is a kind of &ldquo;copyleft&rdquo;, which means that derivative
  works of the document must themselves be free in the same sense.  It
  complements the GNU General Public License, which is a copyleft
  license designed for free software.
! </p>
! <p>We have designed this License in order to use it for manuals for free
  software, because free software needs free documentation: a free
  program should come with manuals providing the same freedoms that the
  software does.  But this License is not limited to software manuals;
  it can be used for any textual work, regardless of subject matter or
  whether it is published as a printed book.  We recommend this License
  principally for works whose purpose is instruction or reference.
+ </p>
+ </li><li> APPLICABILITY AND DEFINITIONS
  
! <p>This License applies to any manual or other work, in any medium, that
  contains a notice placed by the copyright holder saying it can be
  distributed under the terms of this License.  Such a notice grants a
  world-wide, royalty-free license, unlimited in duration, to use that
*************** refers to any such manual or work.  Any
*** 85,98 ****
  licensee, and is addressed as &ldquo;you&rdquo;.  You accept the license if you
  copy, modify or distribute the work in a way requiring permission
  under copyright law.
! 
!      <p>A &ldquo;Modified Version&rdquo; of the Document means any work containing the
  Document or a portion of it, either copied verbatim, or with
  modifications and/or translated into another language.
! 
!      <p>A &ldquo;Secondary Section&rdquo; is a named appendix or a front-matter section
  of the Document that deals exclusively with the relationship of the
! publishers or authors of the Document to the Document's overall
  subject (or to related matters) and contains nothing that could fall
  directly within that overall subject.  (Thus, if the Document is in
  part a textbook of mathematics, a Secondary Section may not explain
--- 136,149 ----
  licensee, and is addressed as &ldquo;you&rdquo;.  You accept the license if you
  copy, modify or distribute the work in a way requiring permission
  under copyright law.
! </p>
! <p>A &ldquo;Modified Version&rdquo; of the Document means any work containing the
  Document or a portion of it, either copied verbatim, or with
  modifications and/or translated into another language.
! </p>
! <p>A &ldquo;Secondary Section&rdquo; is a named appendix or a front-matter section
  of the Document that deals exclusively with the relationship of the
! publishers or authors of the Document to the Document&rsquo;s overall
  subject (or to related matters) and contains nothing that could fall
  directly within that overall subject.  (Thus, if the Document is in
  part a textbook of mathematics, a Secondary Section may not explain
*************** any mathematics.)  The relationship coul
*** 100,120 ****
  connection with the subject or with related matters, or of legal,
  commercial, philosophical, ethical or political position regarding
  them.
! 
!      <p>The &ldquo;Invariant Sections&rdquo; are certain Secondary Sections whose titles
  are designated, as being those of Invariant Sections, in the notice
  that says that the Document is released under this License.  If a
  section does not fit the above definition of Secondary then it is not
  allowed to be designated as Invariant.  The Document may contain zero
  Invariant Sections.  If the Document does not identify any Invariant
  Sections then there are none.
! 
!      <p>The &ldquo;Cover Texts&rdquo; are certain short passages of text that are listed,
  as Front-Cover Texts or Back-Cover Texts, in the notice that says that
  the Document is released under this License.  A Front-Cover Text may
  be at most 5 words, and a Back-Cover Text may be at most 25 words.
! 
!      <p>A &ldquo;Transparent&rdquo; copy of the Document means a machine-readable copy,
  represented in a format whose specification is available to the
  general public, that is suitable for revising the document
  straightforwardly with generic text editors or (for images composed of
--- 151,171 ----
  connection with the subject or with related matters, or of legal,
  commercial, philosophical, ethical or political position regarding
  them.
! </p>
! <p>The &ldquo;Invariant Sections&rdquo; are certain Secondary Sections whose titles
  are designated, as being those of Invariant Sections, in the notice
  that says that the Document is released under this License.  If a
  section does not fit the above definition of Secondary then it is not
  allowed to be designated as Invariant.  The Document may contain zero
  Invariant Sections.  If the Document does not identify any Invariant
  Sections then there are none.
! </p>
! <p>The &ldquo;Cover Texts&rdquo; are certain short passages of text that are listed,
  as Front-Cover Texts or Back-Cover Texts, in the notice that says that
  the Document is released under this License.  A Front-Cover Text may
  be at most 5 words, and a Back-Cover Text may be at most 25 words.
! </p>
! <p>A &ldquo;Transparent&rdquo; copy of the Document means a machine-readable copy,
  represented in a format whose specification is available to the
  general public, that is suitable for revising the document
  straightforwardly with generic text editors or (for images composed of
*************** drawing editor, and that is suitable for
*** 123,134 ****
  for automatic translation to a variety of formats suitable for input
  to text formatters.  A copy made in an otherwise Transparent file
  format whose markup, or absence of markup, has been arranged to thwart
! or discourage subsequent modification by readers is not Transparent. 
  An image format is not Transparent if used for any substantial amount
  of text.  A copy that is not &ldquo;Transparent&rdquo; is called &ldquo;Opaque&rdquo;.
! 
!      <p>Examples of suitable formats for Transparent copies include plain
! <span class="sc">ascii</span> without markup, Texinfo input format, LaTeX input
  format, <acronym>SGML</acronym> or <acronym>XML</acronym> using a publicly available
  <acronym>DTD</acronym>, and standard-conforming simple <acronym>HTML</acronym>,
  PostScript or <acronym>PDF</acronym> designed for human modification.  Examples
--- 174,185 ----
  for automatic translation to a variety of formats suitable for input
  to text formatters.  A copy made in an otherwise Transparent file
  format whose markup, or absence of markup, has been arranged to thwart
! or discourage subsequent modification by readers is not Transparent.
  An image format is not Transparent if used for any substantial amount
  of text.  A copy that is not &ldquo;Transparent&rdquo; is called &ldquo;Opaque&rdquo;.
! </p>
! <p>Examples of suitable formats for Transparent copies include plain
! <small>ASCII</small> without markup, Texinfo input format, LaTeX input
  format, <acronym>SGML</acronym> or <acronym>XML</acronym> using a publicly available
  <acronym>DTD</acronym>, and standard-conforming simple <acronym>HTML</acronym>,
  PostScript or <acronym>PDF</acronym> designed for human modification.  Examples
*************** read and edited only by proprietary word
*** 139,173 ****
  not generally available, and the machine-generated <acronym>HTML</acronym>,
  PostScript or <acronym>PDF</acronym> produced by some word processors for
  output purposes only.
! 
!      <p>The &ldquo;Title Page&rdquo; means, for a printed book, the title page itself,
  plus such following pages as are needed to hold, legibly, the material
  this License requires to appear in the title page.  For works in
  formats which do not have any title page as such, &ldquo;Title Page&rdquo; means
! the text near the most prominent appearance of the work's title,
  preceding the beginning of the body of the text.
! 
!      <p>The &ldquo;publisher&rdquo; means any person or entity that distributes copies
  of the Document to the public.
! 
!      <p>A section &ldquo;Entitled XYZ&rdquo; means a named subunit of the Document whose
  title either is precisely XYZ or contains XYZ in parentheses following
  text that translates XYZ in another language.  (Here XYZ stands for a
  specific section name mentioned below, such as &ldquo;Acknowledgements&rdquo;,
  &ldquo;Dedications&rdquo;, &ldquo;Endorsements&rdquo;, or &ldquo;History&rdquo;.)  To &ldquo;Preserve the Title&rdquo;
  of such a section when you modify the Document means that it remains a
  section &ldquo;Entitled XYZ&rdquo; according to this definition.
! 
!      <p>The Document may include Warranty Disclaimers next to the notice which
  states that this License applies to the Document.  These Warranty
  Disclaimers are considered to be included by reference in this
  License, but only as regards disclaiming warranties: any other
  implication that these Warranty Disclaimers may have is void and has
  no effect on the meaning of this License.
  
!      <li>VERBATIM COPYING
! 
!      <p>You may copy and distribute the Document in any medium, either
  commercially or noncommercially, provided that this License, the
  copyright notices, and the license notice saying this License applies
  to the Document are reproduced in all copies, and that you add no other
--- 190,224 ----
  not generally available, and the machine-generated <acronym>HTML</acronym>,
  PostScript or <acronym>PDF</acronym> produced by some word processors for
  output purposes only.
! </p>
! <p>The &ldquo;Title Page&rdquo; means, for a printed book, the title page itself,
  plus such following pages as are needed to hold, legibly, the material
  this License requires to appear in the title page.  For works in
  formats which do not have any title page as such, &ldquo;Title Page&rdquo; means
! the text near the most prominent appearance of the work&rsquo;s title,
  preceding the beginning of the body of the text.
! </p>
! <p>The &ldquo;publisher&rdquo; means any person or entity that distributes copies
  of the Document to the public.
! </p>
! <p>A section &ldquo;Entitled XYZ&rdquo; means a named subunit of the Document whose
  title either is precisely XYZ or contains XYZ in parentheses following
  text that translates XYZ in another language.  (Here XYZ stands for a
  specific section name mentioned below, such as &ldquo;Acknowledgements&rdquo;,
  &ldquo;Dedications&rdquo;, &ldquo;Endorsements&rdquo;, or &ldquo;History&rdquo;.)  To &ldquo;Preserve the Title&rdquo;
  of such a section when you modify the Document means that it remains a
  section &ldquo;Entitled XYZ&rdquo; according to this definition.
! </p>
! <p>The Document may include Warranty Disclaimers next to the notice which
  states that this License applies to the Document.  These Warranty
  Disclaimers are considered to be included by reference in this
  License, but only as regards disclaiming warranties: any other
  implication that these Warranty Disclaimers may have is void and has
  no effect on the meaning of this License.
+ </p>
+ </li><li> VERBATIM COPYING
  
! <p>You may copy and distribute the Document in any medium, either
  commercially or noncommercially, provided that this License, the
  copyright notices, and the license notice saying this License applies
  to the Document are reproduced in all copies, and that you add no other
*************** technical measures to obstruct or contro
*** 176,262 ****
  copying of the copies you make or distribute.  However, you may accept
  compensation in exchange for copies.  If you distribute a large enough
  number of copies you must also follow the conditions in section 3.
! 
!      <p>You may also lend copies, under the same conditions stated above, and
  you may publicly display copies.
  
!      <li>COPYING IN QUANTITY
! 
!      <p>If you publish printed copies (or copies in media that commonly have
  printed covers) of the Document, numbering more than 100, and the
! Document's license notice requires Cover Texts, you must enclose the
  copies in covers that carry, clearly and legibly, all these Cover
  Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
  the back cover.  Both covers must also clearly and legibly identify
  you as the publisher of these copies.  The front cover must present
  the full title with all words of the title equally prominent and
! visible.  You may add other material on the covers in addition. 
  Copying with changes limited to the covers, as long as they preserve
  the title of the Document and satisfy these conditions, can be treated
  as verbatim copying in other respects.
! 
!      <p>If the required texts for either cover are too voluminous to fit
  legibly, you should put the first ones listed (as many as fit
  reasonably) on the actual cover, and continue the rest onto adjacent
  pages.
! 
!      <p>If you publish or distribute Opaque copies of the Document numbering
  more than 100, you must either include a machine-readable Transparent
  copy along with each Opaque copy, or state in or with each Opaque copy
  a computer-network location from which the general network-using
  public has access to download using public-standard network protocols
! a complete Transparent copy of the Document, free of added material. 
  If you use the latter option, you must take reasonably prudent steps,
  when you begin distribution of Opaque copies in quantity, to ensure
  that this Transparent copy will remain thus accessible at the stated
  location until at least one year after the last time you distribute an
  Opaque copy (directly or through your agents or retailers) of that
  edition to the public.
! 
!      <p>It is requested, but not required, that you contact the authors of the
  Document well before redistributing any large number of copies, to give
  them a chance to provide you with an updated version of the Document.
  
!      <li>MODIFICATIONS
! 
!      <p>You may copy and distribute a Modified Version of the Document under
  the conditions of sections 2 and 3 above, provided that you release
  the Modified Version under precisely this License, with the Modified
  Version filling the role of the Document, thus licensing distribution
  and modification of the Modified Version to whoever possesses a copy
  of it.  In addition, you must do these things in the Modified Version:
! 
!           <ol type=A start=1>
! <li>Use in the Title Page (and on the covers, if any) a title distinct
  from that of the Document, and from those of previous versions
  (which should, if there were any, be listed in the History section
  of the Document).  You may use the same title as a previous version
  if the original publisher of that version gives permission.
  
!           <li>List on the Title Page, as authors, one or more persons or entities
  responsible for authorship of the modifications in the Modified
  Version, together with at least five of the principal authors of the
  Document (all of its principal authors, if it has fewer than five),
  unless they release you from this requirement.
  
!           <li>State on the Title page the name of the publisher of the
  Modified Version, as the publisher.
  
!           <li>Preserve all the copyright notices of the Document.
  
!           <li>Add an appropriate copyright notice for your modifications
  adjacent to the other copyright notices.
  
!           <li>Include, immediately after the copyright notices, a license notice
  giving the public permission to use the Modified Version under the
  terms of this License, in the form shown in the Addendum below.
  
!           <li>Preserve in that license notice the full lists of Invariant Sections
! and required Cover Texts given in the Document's license notice.
  
!           <li>Include an unaltered copy of this License.
  
!           <li>Preserve the section Entitled &ldquo;History&rdquo;, Preserve its Title, and add
  to it an item stating at least the title, year, new authors, and
  publisher of the Modified Version as given on the Title Page.  If
  there is no section Entitled &ldquo;History&rdquo; in the Document, create one
--- 227,313 ----
  copying of the copies you make or distribute.  However, you may accept
  compensation in exchange for copies.  If you distribute a large enough
  number of copies you must also follow the conditions in section 3.
! </p>
! <p>You may also lend copies, under the same conditions stated above, and
  you may publicly display copies.
+ </p>
+ </li><li> COPYING IN QUANTITY
  
! <p>If you publish printed copies (or copies in media that commonly have
  printed covers) of the Document, numbering more than 100, and the
! Document&rsquo;s license notice requires Cover Texts, you must enclose the
  copies in covers that carry, clearly and legibly, all these Cover
  Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
  the back cover.  Both covers must also clearly and legibly identify
  you as the publisher of these copies.  The front cover must present
  the full title with all words of the title equally prominent and
! visible.  You may add other material on the covers in addition.
  Copying with changes limited to the covers, as long as they preserve
  the title of the Document and satisfy these conditions, can be treated
  as verbatim copying in other respects.
! </p>
! <p>If the required texts for either cover are too voluminous to fit
  legibly, you should put the first ones listed (as many as fit
  reasonably) on the actual cover, and continue the rest onto adjacent
  pages.
! </p>
! <p>If you publish or distribute Opaque copies of the Document numbering
  more than 100, you must either include a machine-readable Transparent
  copy along with each Opaque copy, or state in or with each Opaque copy
  a computer-network location from which the general network-using
  public has access to download using public-standard network protocols
! a complete Transparent copy of the Document, free of added material.
  If you use the latter option, you must take reasonably prudent steps,
  when you begin distribution of Opaque copies in quantity, to ensure
  that this Transparent copy will remain thus accessible at the stated
  location until at least one year after the last time you distribute an
  Opaque copy (directly or through your agents or retailers) of that
  edition to the public.
! </p>
! <p>It is requested, but not required, that you contact the authors of the
  Document well before redistributing any large number of copies, to give
  them a chance to provide you with an updated version of the Document.
+ </p>
+ </li><li> MODIFICATIONS
  
! <p>You may copy and distribute a Modified Version of the Document under
  the conditions of sections 2 and 3 above, provided that you release
  the Modified Version under precisely this License, with the Modified
  Version filling the role of the Document, thus licensing distribution
  and modification of the Modified Version to whoever possesses a copy
  of it.  In addition, you must do these things in the Modified Version:
! </p>
! <ol>
! <li> Use in the Title Page (and on the covers, if any) a title distinct
  from that of the Document, and from those of previous versions
  (which should, if there were any, be listed in the History section
  of the Document).  You may use the same title as a previous version
  if the original publisher of that version gives permission.
  
! </li><li> List on the Title Page, as authors, one or more persons or entities
  responsible for authorship of the modifications in the Modified
  Version, together with at least five of the principal authors of the
  Document (all of its principal authors, if it has fewer than five),
  unless they release you from this requirement.
  
! </li><li> State on the Title page the name of the publisher of the
  Modified Version, as the publisher.
  
! </li><li> Preserve all the copyright notices of the Document.
  
! </li><li> Add an appropriate copyright notice for your modifications
  adjacent to the other copyright notices.
  
! </li><li> Include, immediately after the copyright notices, a license notice
  giving the public permission to use the Modified Version under the
  terms of this License, in the form shown in the Addendum below.
  
! </li><li> Preserve in that license notice the full lists of Invariant Sections
! and required Cover Texts given in the Document&rsquo;s license notice.
  
! </li><li> Include an unaltered copy of this License.
  
! </li><li> Preserve the section Entitled &ldquo;History&rdquo;, Preserve its Title, and add
  to it an item stating at least the title, year, new authors, and
  publisher of the Modified Version as given on the Title Page.  If
  there is no section Entitled &ldquo;History&rdquo; in the Document, create one
*************** stating the title, year, authors, and pu
*** 264,309 ****
  given on its Title Page, then add an item describing the Modified
  Version as stated in the previous sentence.
  
!           <li>Preserve the network location, if any, given in the Document for
  public access to a Transparent copy of the Document, and likewise
  the network locations given in the Document for previous versions
! it was based on.  These may be placed in the &ldquo;History&rdquo; section. 
  You may omit a network location for a work that was published at
  least four years before the Document itself, or if the original
  publisher of the version it refers to gives permission.
  
!           <li>For any section Entitled &ldquo;Acknowledgements&rdquo; or &ldquo;Dedications&rdquo;, Preserve
  the Title of the section, and preserve in the section all the
  substance and tone of each of the contributor acknowledgements and/or
  dedications given therein.
  
!           <li>Preserve all the Invariant Sections of the Document,
  unaltered in their text and in their titles.  Section numbers
  or the equivalent are not considered part of the section titles.
  
!           <li>Delete any section Entitled &ldquo;Endorsements&rdquo;.  Such a section
  may not be included in the Modified Version.
  
!           <li>Do not retitle any existing section to be Entitled &ldquo;Endorsements&rdquo; or
  to conflict in title with any Invariant Section.
  
!           <li>Preserve any Warranty Disclaimers.
!           </ol>
  
!      <p>If the Modified Version includes new front-matter sections or
  appendices that qualify as Secondary Sections and contain no material
  copied from the Document, you may at your option designate some or all
  of these sections as invariant.  To do this, add their titles to the
! list of Invariant Sections in the Modified Version's license notice. 
  These titles must be distinct from any other section titles.
! 
!      <p>You may add a section Entitled &ldquo;Endorsements&rdquo;, provided it contains
  nothing but endorsements of your Modified Version by various
  parties&mdash;for example, statements of peer review or that the text has
  been approved by an organization as the authoritative definition of a
  standard.
! 
!      <p>You may add a passage of up to five words as a Front-Cover Text, and a
  passage of up to 25 words as a Back-Cover Text, to the end of the list
  of Cover Texts in the Modified Version.  Only one passage of
  Front-Cover Text and one of Back-Cover Text may be added by (or
--- 315,360 ----
  given on its Title Page, then add an item describing the Modified
  Version as stated in the previous sentence.
  
! </li><li> Preserve the network location, if any, given in the Document for
  public access to a Transparent copy of the Document, and likewise
  the network locations given in the Document for previous versions
! it was based on.  These may be placed in the &ldquo;History&rdquo; section.
  You may omit a network location for a work that was published at
  least four years before the Document itself, or if the original
  publisher of the version it refers to gives permission.
  
! </li><li> For any section Entitled &ldquo;Acknowledgements&rdquo; or &ldquo;Dedications&rdquo;, Preserve
  the Title of the section, and preserve in the section all the
  substance and tone of each of the contributor acknowledgements and/or
  dedications given therein.
  
! </li><li> Preserve all the Invariant Sections of the Document,
  unaltered in their text and in their titles.  Section numbers
  or the equivalent are not considered part of the section titles.
  
! </li><li> Delete any section Entitled &ldquo;Endorsements&rdquo;.  Such a section
  may not be included in the Modified Version.
  
! </li><li> Do not retitle any existing section to be Entitled &ldquo;Endorsements&rdquo; or
  to conflict in title with any Invariant Section.
  
! </li><li> Preserve any Warranty Disclaimers.
! </li></ol>
  
! <p>If the Modified Version includes new front-matter sections or
  appendices that qualify as Secondary Sections and contain no material
  copied from the Document, you may at your option designate some or all
  of these sections as invariant.  To do this, add their titles to the
! list of Invariant Sections in the Modified Version&rsquo;s license notice.
  These titles must be distinct from any other section titles.
! </p>
! <p>You may add a section Entitled &ldquo;Endorsements&rdquo;, provided it contains
  nothing but endorsements of your Modified Version by various
  parties&mdash;for example, statements of peer review or that the text has
  been approved by an organization as the authoritative definition of a
  standard.
! </p>
! <p>You may add a passage of up to five words as a Front-Cover Text, and a
  passage of up to 25 words as a Back-Cover Text, to the end of the list
  of Cover Texts in the Modified Version.  Only one passage of
  Front-Cover Text and one of Back-Cover Text may be added by (or
*************** includes a cover text for the same cover
*** 312,382 ****
  by arrangement made by the same entity you are acting on behalf of,
  you may not add another; but you may replace the old one, on explicit
  permission from the previous publisher that added the old one.
! 
!      <p>The author(s) and publisher(s) of the Document do not by this License
  give permission to use their names for publicity for or to assert or
  imply endorsement of any Modified Version.
  
!      <li>COMBINING DOCUMENTS
! 
!      <p>You may combine the Document with other documents released under this
  License, under the terms defined in section 4 above for modified
  versions, provided that you include in the combination all of the
  Invariant Sections of all of the original documents, unmodified, and
  list them all as Invariant Sections of your combined work in its
  license notice, and that you preserve all their Warranty Disclaimers.
! 
!      <p>The combined work need only contain one copy of this License, and
  multiple identical Invariant Sections may be replaced with a single
  copy.  If there are multiple Invariant Sections with the same name but
  different contents, make the title of each such section unique by
  adding at the end of it, in parentheses, the name of the original
! author or publisher of that section if known, or else a unique number. 
  Make the same adjustment to the section titles in the list of
  Invariant Sections in the license notice of the combined work.
! 
!      <p>In the combination, you must combine any sections Entitled &ldquo;History&rdquo;
  in the various original documents, forming one section Entitled
  &ldquo;History&rdquo;; likewise combine any sections Entitled &ldquo;Acknowledgements&rdquo;,
  and any sections Entitled &ldquo;Dedications&rdquo;.  You must delete all
  sections Entitled &ldquo;Endorsements.&rdquo;
  
!      <li>COLLECTIONS OF DOCUMENTS
! 
!      <p>You may make a collection consisting of the Document and other documents
  released under this License, and replace the individual copies of this
  License in the various documents with a single copy that is included in
  the collection, provided that you follow the rules of this License for
  verbatim copying of each of the documents in all other respects.
! 
!      <p>You may extract a single document from such a collection, and distribute
  it individually under this License, provided you insert a copy of this
  License into the extracted document, and follow this License in all
  other respects regarding verbatim copying of that document.
  
!      <li>AGGREGATION WITH INDEPENDENT WORKS
! 
!      <p>A compilation of the Document or its derivatives with other separate
  and independent documents or works, in or on a volume of a storage or
  distribution medium, is called an &ldquo;aggregate&rdquo; if the copyright
  resulting from the compilation is not used to limit the legal rights
! of the compilation's users beyond what the individual works permit. 
  When the Document is included in an aggregate, this License does not
  apply to the other works in the aggregate which are not themselves
  derivative works of the Document.
! 
!      <p>If the Cover Text requirement of section 3 is applicable to these
  copies of the Document, then if the Document is less than one half of
! the entire aggregate, the Document's Cover Texts may be placed on
  covers that bracket the Document within the aggregate, or the
! electronic equivalent of covers if the Document is in electronic form. 
  Otherwise they must appear on printed covers that bracket the whole
  aggregate.
  
!      <li>TRANSLATION
! 
!      <p>Translation is considered a kind of modification, so you may
! distribute translations of the Document under the terms of section 4. 
  Replacing Invariant Sections with translations requires special
  permission from their copyright holders, but you may include
  translations of some or all Invariant Sections in addition to the
--- 363,433 ----
  by arrangement made by the same entity you are acting on behalf of,
  you may not add another; but you may replace the old one, on explicit
  permission from the previous publisher that added the old one.
! </p>
! <p>The author(s) and publisher(s) of the Document do not by this License
  give permission to use their names for publicity for or to assert or
  imply endorsement of any Modified Version.
+ </p>
+ </li><li> COMBINING DOCUMENTS
  
! <p>You may combine the Document with other documents released under this
  License, under the terms defined in section 4 above for modified
  versions, provided that you include in the combination all of the
  Invariant Sections of all of the original documents, unmodified, and
  list them all as Invariant Sections of your combined work in its
  license notice, and that you preserve all their Warranty Disclaimers.
! </p>
! <p>The combined work need only contain one copy of this License, and
  multiple identical Invariant Sections may be replaced with a single
  copy.  If there are multiple Invariant Sections with the same name but
  different contents, make the title of each such section unique by
  adding at the end of it, in parentheses, the name of the original
! author or publisher of that section if known, or else a unique number.
  Make the same adjustment to the section titles in the list of
  Invariant Sections in the license notice of the combined work.
! </p>
! <p>In the combination, you must combine any sections Entitled &ldquo;History&rdquo;
  in the various original documents, forming one section Entitled
  &ldquo;History&rdquo;; likewise combine any sections Entitled &ldquo;Acknowledgements&rdquo;,
  and any sections Entitled &ldquo;Dedications&rdquo;.  You must delete all
  sections Entitled &ldquo;Endorsements.&rdquo;
+ </p>
+ </li><li> COLLECTIONS OF DOCUMENTS
  
! <p>You may make a collection consisting of the Document and other documents
  released under this License, and replace the individual copies of this
  License in the various documents with a single copy that is included in
  the collection, provided that you follow the rules of this License for
  verbatim copying of each of the documents in all other respects.
! </p>
! <p>You may extract a single document from such a collection, and distribute
  it individually under this License, provided you insert a copy of this
  License into the extracted document, and follow this License in all
  other respects regarding verbatim copying of that document.
+ </p>
+ </li><li> AGGREGATION WITH INDEPENDENT WORKS
  
! <p>A compilation of the Document or its derivatives with other separate
  and independent documents or works, in or on a volume of a storage or
  distribution medium, is called an &ldquo;aggregate&rdquo; if the copyright
  resulting from the compilation is not used to limit the legal rights
! of the compilation&rsquo;s users beyond what the individual works permit.
  When the Document is included in an aggregate, this License does not
  apply to the other works in the aggregate which are not themselves
  derivative works of the Document.
! </p>
! <p>If the Cover Text requirement of section 3 is applicable to these
  copies of the Document, then if the Document is less than one half of
! the entire aggregate, the Document&rsquo;s Cover Texts may be placed on
  covers that bracket the Document within the aggregate, or the
! electronic equivalent of covers if the Document is in electronic form.
  Otherwise they must appear on printed covers that bracket the whole
  aggregate.
+ </p>
+ </li><li> TRANSLATION
  
! <p>Translation is considered a kind of modification, so you may
! distribute translations of the Document under the terms of section 4.
  Replacing Invariant Sections with translations requires special
  permission from their copyright holders, but you may include
  translations of some or all Invariant Sections in addition to the
*************** the original English version of this Lic
*** 387,434 ****
  of those notices and disclaimers.  In case of a disagreement between
  the translation and the original version of this License or a notice
  or disclaimer, the original version will prevail.
! 
!      <p>If a section in the Document is Entitled &ldquo;Acknowledgements&rdquo;,
  &ldquo;Dedications&rdquo;, or &ldquo;History&rdquo;, the requirement (section 4) to Preserve
  its Title (section 1) will typically require changing the actual
  title.
  
!      <li>TERMINATION
! 
!      <p>You may not copy, modify, sublicense, or distribute the Document
  except as expressly provided under this License.  Any attempt
  otherwise to copy, modify, sublicense, or distribute it is void, and
  will automatically terminate your rights under this License.
! 
!      <p>However, if you cease all violation of this License, then your license
  from a particular copyright holder is reinstated (a) provisionally,
  unless and until the copyright holder explicitly and finally
  terminates your license, and (b) permanently, if the copyright holder
  fails to notify you of the violation by some reasonable means prior to
  60 days after the cessation.
! 
!      <p>Moreover, your license from a particular copyright holder is
  reinstated permanently if the copyright holder notifies you of the
  violation by some reasonable means, this is the first time you have
  received notice of violation of this License (for any work) from that
  copyright holder, and you cure the violation prior to 30 days after
  your receipt of the notice.
! 
!      <p>Termination of your rights under this section does not terminate the
  licenses of parties who have received copies or rights from you under
  this License.  If your rights have been terminated and not permanently
  reinstated, receipt of a copy of some or all of the same material does
  not give you any rights to use it.
  
!      <li>FUTURE REVISIONS OF THIS LICENSE
! 
!      <p>The Free Software Foundation may publish new, revised versions
  of the GNU Free Documentation License from time to time.  Such new
  versions will be similar in spirit to the present version, but may
  differ in detail to address new problems or concerns.  See
  <a href="http://www.gnu.org/copyleft/">http://www.gnu.org/copyleft/</a>.
! 
!      <p>Each version of the License is given a distinguishing version number. 
  If the Document specifies that a particular numbered version of this
  License &ldquo;or any later version&rdquo; applies to it, you have the option of
  following the terms and conditions either of that specified version or
--- 438,485 ----
  of those notices and disclaimers.  In case of a disagreement between
  the translation and the original version of this License or a notice
  or disclaimer, the original version will prevail.
! </p>
! <p>If a section in the Document is Entitled &ldquo;Acknowledgements&rdquo;,
  &ldquo;Dedications&rdquo;, or &ldquo;History&rdquo;, the requirement (section 4) to Preserve
  its Title (section 1) will typically require changing the actual
  title.
+ </p>
+ </li><li> TERMINATION
  
! <p>You may not copy, modify, sublicense, or distribute the Document
  except as expressly provided under this License.  Any attempt
  otherwise to copy, modify, sublicense, or distribute it is void, and
  will automatically terminate your rights under this License.
! </p>
! <p>However, if you cease all violation of this License, then your license
  from a particular copyright holder is reinstated (a) provisionally,
  unless and until the copyright holder explicitly and finally
  terminates your license, and (b) permanently, if the copyright holder
  fails to notify you of the violation by some reasonable means prior to
  60 days after the cessation.
! </p>
! <p>Moreover, your license from a particular copyright holder is
  reinstated permanently if the copyright holder notifies you of the
  violation by some reasonable means, this is the first time you have
  received notice of violation of this License (for any work) from that
  copyright holder, and you cure the violation prior to 30 days after
  your receipt of the notice.
! </p>
! <p>Termination of your rights under this section does not terminate the
  licenses of parties who have received copies or rights from you under
  this License.  If your rights have been terminated and not permanently
  reinstated, receipt of a copy of some or all of the same material does
  not give you any rights to use it.
+ </p>
+ </li><li> FUTURE REVISIONS OF THIS LICENSE
  
! <p>The Free Software Foundation may publish new, revised versions
  of the GNU Free Documentation License from time to time.  Such new
  versions will be similar in spirit to the present version, but may
  differ in detail to address new problems or concerns.  See
  <a href="http://www.gnu.org/copyleft/">http://www.gnu.org/copyleft/</a>.
! </p>
! <p>Each version of the License is given a distinguishing version number.
  If the Document specifies that a particular numbered version of this
  License &ldquo;or any later version&rdquo; applies to it, you have the option of
  following the terms and conditions either of that specified version or
*************** Free Software Foundation.  If the Docume
*** 437,515 ****
  number of this License, you may choose any version ever published (not
  as a draft) by the Free Software Foundation.  If the Document
  specifies that a proxy can decide which future versions of this
! License can be used, that proxy's public statement of acceptance of a
  version permanently authorizes you to choose that version for the
  Document.
  
!      <li>RELICENSING
! 
!      <p>&ldquo;Massive Multiauthor Collaboration Site&rdquo; (or &ldquo;MMC Site&rdquo;) means any
  World Wide Web server that publishes copyrightable works and also
  provides prominent facilities for anybody to edit those works.  A
  public wiki that anybody can edit is an example of such a server.  A
  &ldquo;Massive Multiauthor Collaboration&rdquo; (or &ldquo;MMC&rdquo;) contained in the
  site means any set of copyrightable works thus published on the MMC
  site.
! 
!      <p>&ldquo;CC-BY-SA&rdquo; means the Creative Commons Attribution-Share Alike 3.0
  license published by Creative Commons Corporation, a not-for-profit
  corporation with a principal place of business in San Francisco,
  California, as well as future copyleft versions of that license
  published by that same organization.
! 
!      <p>&ldquo;Incorporate&rdquo; means to publish or republish a Document, in whole or
  in part, as part of another Document.
! 
!      <p>An MMC is &ldquo;eligible for relicensing&rdquo; if it is licensed under this
  License, and if all works that were first published under this License
  somewhere other than this MMC, and subsequently incorporated in whole
  or in part into the MMC, (1) had no cover texts or invariant sections,
  and (2) were thus incorporated prior to November 1, 2008.
! 
!      <p>The operator of an MMC Site may republish an MMC contained in the site
  under CC-BY-SA on the same site at any time before August 1, 2009,
  provided the MMC is eligible for relicensing.
  
!         </ol>
! 
! <h3 class="unnumberedsec"><a name="TOC0"></a>ADDENDUM: How to use this License for your documents</h3>
  
  <p>To use this License in a document you have written, include a copy of
  the License in the document and put the following copyright and
  license notices just after the title page:
  
! <pre class="smallexample">       Copyright (C)  <var>year</var>  <var>your name</var>.
!        Permission is granted to copy, distribute and/or modify this document
!        under the terms of the GNU Free Documentation License, Version 1.3
!        or any later version published by the Free Software Foundation;
!        with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
!        Texts.  A copy of the license is included in the section entitled ``GNU
!        Free Documentation License''.
! </pre>
!    <p>If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
  replace the &ldquo;with...Texts.&rdquo; line with this:
  
! <pre class="smallexample">         with the Invariant Sections being <var>list their titles</var>, with
!          the Front-Cover Texts being <var>list</var>, and with the Back-Cover Texts
!          being <var>list</var>.
! </pre>
!    <p>If you have Invariant Sections without Cover Texts, or some other
  combination of the three, merge those two alternatives to suit the
  situation.
! 
!    <p>If your document contains nontrivial examples of program code, we
  recommend releasing these examples in parallel under your choice of
  free software license, such as the GNU General Public License,
  to permit their use in free software.
  
! <!-- Local Variables: -->
! <!-- ispell-local-pdict: "ispell-dict" -->
! <!-- End: -->
! <!-- man end -->
!    <p><hr />
  <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 488,572 ----
  number of this License, you may choose any version ever published (not
  as a draft) by the Free Software Foundation.  If the Document
  specifies that a proxy can decide which future versions of this
! License can be used, that proxy&rsquo;s public statement of acceptance of a
  version permanently authorizes you to choose that version for the
  Document.
+ </p>
+ </li><li> RELICENSING
  
! <p>&ldquo;Massive Multiauthor Collaboration Site&rdquo; (or &ldquo;MMC Site&rdquo;) means any
  World Wide Web server that publishes copyrightable works and also
  provides prominent facilities for anybody to edit those works.  A
  public wiki that anybody can edit is an example of such a server.  A
  &ldquo;Massive Multiauthor Collaboration&rdquo; (or &ldquo;MMC&rdquo;) contained in the
  site means any set of copyrightable works thus published on the MMC
  site.
! </p>
! <p>&ldquo;CC-BY-SA&rdquo; means the Creative Commons Attribution-Share Alike 3.0
  license published by Creative Commons Corporation, a not-for-profit
  corporation with a principal place of business in San Francisco,
  California, as well as future copyleft versions of that license
  published by that same organization.
! </p>
! <p>&ldquo;Incorporate&rdquo; means to publish or republish a Document, in whole or
  in part, as part of another Document.
! </p>
! <p>An MMC is &ldquo;eligible for relicensing&rdquo; if it is licensed under this
  License, and if all works that were first published under this License
  somewhere other than this MMC, and subsequently incorporated in whole
  or in part into the MMC, (1) had no cover texts or invariant sections,
  and (2) were thus incorporated prior to November 1, 2008.
! </p>
! <p>The operator of an MMC Site may republish an MMC contained in the site
  under CC-BY-SA on the same site at any time before August 1, 2009,
  provided the MMC is eligible for relicensing.
+ </p>
+ </li></ol>
  
! <a name="ADDENDUM_003a-How-to-use-this-License-for-your-documents"></a>
! <h3 class="unnumberedsec">ADDENDUM: How to use this License for your documents</h3>
  
  <p>To use this License in a document you have written, include a copy of
  the License in the document and put the following copyright and
  license notices just after the title page:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">  Copyright (C)  <var>year</var>  <var>your name</var>.
+   Permission is granted to copy, distribute and/or modify this document
+   under the terms of the GNU Free Documentation License, Version 1.3
+   or any later version published by the Free Software Foundation;
+   with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
+   Texts.  A copy of the license is included in the section entitled ``GNU
+   Free Documentation License''.
+ </pre></div>
  
! <p>If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
  replace the &ldquo;with...Texts.&rdquo; line with this:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">    with the Invariant Sections being <var>list their titles</var>, with
+     the Front-Cover Texts being <var>list</var>, and with the Back-Cover Texts
+     being <var>list</var>.
+ </pre></div>
  
! <p>If you have Invariant Sections without Cover Texts, or some other
  combination of the three, merge those two alternatives to suit the
  situation.
! </p>
! <p>If your document contains nontrivial examples of program code, we
  recommend releasing these examples in parallel under your choice of
  free software license, such as the GNU General Public License,
  to permit their use in free software.
+ </p>
  
! <hr />
! <p>
  <p><a href="./index.html">Return to the GCC Installation page</a>
+ </p>
+ 
+ <hr>
  
  
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/index.html gcc-5.5.0/INSTALL/index.html
*** gcc-5.4.0/INSTALL/index.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/index.html	Tue Oct 10 08:13:22 2017
***************
*** 1,123 ****
! <html lang="en">
! <head>
! <title>Installing GCC</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Installing GCC">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
! <body>
! <h1 class="settitle">Installing GCC</h1>
! The latest version of this document is always available at
! <a href="http://gcc.gnu.org/install/">http://gcc.gnu.org/install/</a>. 
  It refers to the current development sources, instructions for
  specific released versions are included with the sources.
! 
!    <p>This document describes the generic installation procedure for GCC as well
  as detailing some target specific installation instructions.
! 
!    <p>GCC includes several components that previously were separate distributions
  with their own installation instructions.  This document supersedes all
  package-specific installation instructions.
! 
!    <p><em>Before</em> starting the build/install procedure please check the
! <a href="specific.html">host/target specific installation notes</a>. 
  We recommend you browse the entire generic installation instructions before
  you proceed.
! 
!    <p>Lists of successful builds for released versions of GCC are
! available at <a href="http://gcc.gnu.org/buildstat.html">http://gcc.gnu.org/buildstat.html</a>. 
  These lists are updated as new information becomes available.
  
!    <p>The installation procedure itself is broken into five steps.
! 
!      <ol type=1 start=1>
! <li><a href="prerequisites.html">Prerequisites</a>
! <li><a href="download.html">Downloading the source</a>
! <li><a href="configure.html">Configuration</a>
! <li><a href="build.html">Building</a>
! <li><a href="test.html">Testing</a> (optional)
! <li><a href="finalinstall.html">Final install</a>
!         </ol>
! 
!    <p>Please note that GCC does not support &lsquo;<samp><span class="samp">make uninstall</span></samp>&rsquo; and probably
! won't do so in the near future as this would open a can of worms.  Instead,
  we suggest that you install GCC into a directory of its own and simply
  remove that directory when you do not need that specific version of GCC
  any longer, and, if shared libraries are installed there as well, no
  more binaries exist that use them.
! 
!    <p>There are also some <a href="old.html">old installation instructions</a>,
  which are mostly obsolete but still contain some information which has
  not yet been merged into the main part of this manual.
! 
!    <p><hr />
  <p><a href="./index.html">Return to the GCC Installation page</a>
! 
!    <p>Copyright &copy; 1988-2015 Free Software Foundation, Inc.
!    <pre class="sp">
! 
! </pre>
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled &ldquo;<a href="./gfdl.html">GNU Free Documentation License</a>&rdquo;.
  
-    <p>(a) The FSF's Front-Cover Text is:
  
-    <p>A GNU Manual
  
-    <p>(b) The FSF's Back-Cover Text is:
  
-    <p>You have freedom to copy and modify this GNU Manual, like GNU
-      software.  Copies published by the Free Software Foundation raise
-      funds for GNU development.
  
- <!-- ***Prerequisites************************************************** -->
- <!-- ***Downloading the source************************************************** -->
- <!-- ***Configuration*********************************************************** -->
- <!-- ***Building**************************************************************** -->
- <!-- ***Testing***************************************************************** -->
- <!-- ***Final install*********************************************************** -->
- <!-- ***Binaries**************************************************************** -->
- <!-- ***Specific**************************************************************** -->
- <!-- ***Old documentation****************************************************** -->
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 1,165 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
! 
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <p>The latest version of this document is always available at
! <a href="http://gcc.gnu.org/install/">http://gcc.gnu.org/install/</a>.
  It refers to the current development sources, instructions for
  specific released versions are included with the sources.
! </p>
! <p>This document describes the generic installation procedure for GCC as well
  as detailing some target specific installation instructions.
! </p>
! <p>GCC includes several components that previously were separate distributions
  with their own installation instructions.  This document supersedes all
  package-specific installation instructions.
! </p>
! <p><em>Before</em> starting the build/install procedure please check the
! <a href="specific.html">host/target specific installation notes</a>.
  We recommend you browse the entire generic installation instructions before
  you proceed.
! </p>
! <p>Lists of successful builds for released versions of GCC are
! available at <a href="http://gcc.gnu.org/buildstat.html">http://gcc.gnu.org/buildstat.html</a>.
  These lists are updated as new information becomes available.
+ </p>
+ <p>The installation procedure itself is broken into five steps.
+ </p>
+ <ol>
+ <li> <a href="prerequisites.html">Prerequisites</a>
+ </li><li> <a href="download.html">Downloading the source</a>
+ </li><li> <a href="configure.html">Configuration</a>
+ </li><li> <a href="build.html">Building</a>
+ </li><li> <a href="test.html">Testing</a> (optional)
+ </li><li> <a href="finalinstall.html">Final install</a>
+ </li></ol>
  
! <p>Please note that GCC does not support &lsquo;<samp>make uninstall</samp>&rsquo; and probably
! won&rsquo;t do so in the near future as this would open a can of worms.  Instead,
  we suggest that you install GCC into a directory of its own and simply
  remove that directory when you do not need that specific version of GCC
  any longer, and, if shared libraries are installed there as well, no
  more binaries exist that use them.
! </p>
! <p>There are also some <a href="old.html">old installation instructions</a>,
  which are mostly obsolete but still contain some information which has
  not yet been merged into the main part of this manual.
! </p>
! <hr />
! <p>
  <p><a href="./index.html">Return to the GCC Installation page</a>
! </p>
! <p>Copyright &copy; 1988-2015 Free Software Foundation, Inc.
! </p><br>
! <p>Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled &ldquo;<a href="./gfdl.html">GNU
! Free Documentation License</a>&rdquo;.
! </p>
! <p>(a) The FSF&rsquo;s Front-Cover Text is:
! </p>
! <p>A GNU Manual
! </p>
! <p>(b) The FSF&rsquo;s Back-Cover Text is:
! </p>
! <p>You have freedom to copy and modify this GNU Manual, like GNU
!      software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.
! </p>
! 
! 
! 
! 
! 
  
  
  
  
  
  
+ 
+ 
+ 
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/old.html gcc-5.5.0/INSTALL/old.html
*** gcc-5.4.0/INSTALL/old.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/old.html	Tue Oct 10 08:13:25 2017
***************
*** 1,181 ****
! <html lang="en">
! <head>
! <title>Installing GCC: Old documentation</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Installing GCC: Old documentation">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
! <body>
! <h1 class="settitle">Installing GCC: Old documentation</h1>
  <h1 align="center">Old installation documentation</h1>
  
!    <p>Note most of this information is out of date and superseded by the
  previous chapters of this manual.  It is provided for historical
  reference only, because of a lack of volunteers to merge it into the
  main manual.
  
!    <p>Here is the procedure for installing GCC on a GNU or Unix system.
! 
!      <ol type=1 start=1>
! <li>If you have chosen a configuration for GCC which requires other GNU
  tools (such as GAS or the GNU linker) instead of the standard system
  tools, install the required tools in the build directory under the names
! <samp><span class="file">as</span></samp>, <samp><span class="file">ld</span></samp> or whatever is appropriate.
  
!      <p>Alternatively, you can do subsequent compilation using a value of the
  <code>PATH</code> environment variable such that the necessary GNU tools come
  before the standard system tools.
  
!      <li>Specify the host, build and target machine configurations.  You do this
! when you run the <samp><span class="file">configure</span></samp> script.
! 
!      <p>The <dfn>build</dfn> machine is the system which you are using, the
! <dfn>host</dfn> machine is the system where you want to run the resulting
! compiler (normally the build machine), and the <dfn>target</dfn> machine is
  the system for which you want the compiler to generate code.
! 
!      <p>If you are building a compiler to produce code for the machine it runs
  on (a native compiler), you normally do not need to specify any operands
! to <samp><span class="file">configure</span></samp>; it will try to guess the type of machine you are on
! and use that as the build, host and target machines.  So you don't need
  to specify a configuration when building a native compiler unless
! <samp><span class="file">configure</span></samp> cannot figure out what your configuration is or guesses
  wrong.
! 
!      <p>In those cases, specify the build machine's <dfn>configuration name</dfn>
! with the <samp><span class="option">--host</span></samp> option; the host and target will default to be
  the same as the host machine.
  
!      <p>Here is an example:
! 
!      <pre class="smallexample">          ./configure --host=sparc-sun-sunos4.1
! </pre>
!      <p>A configuration name may be canonical or it may be more or less
  abbreviated.
! 
!      <p>A canonical configuration name has three parts, separated by dashes. 
! It looks like this: &lsquo;<samp><var>cpu</var><span class="samp">-</span><var>company</var><span class="samp">-</span><var>system</var></samp>&rsquo;. 
! (The three parts may themselves contain dashes; <samp><span class="file">configure</span></samp>
  can figure out which dashes serve which purpose.)  For example,
! &lsquo;<samp><span class="samp">m68k-sun-sunos4.1</span></samp>&rsquo; specifies a Sun 3.
! 
!      <p>You can also replace parts of the configuration by nicknames or aliases. 
! For example, &lsquo;<samp><span class="samp">sun3</span></samp>&rsquo; stands for &lsquo;<samp><span class="samp">m68k-sun</span></samp>&rsquo;, so
! &lsquo;<samp><span class="samp">sun3-sunos4.1</span></samp>&rsquo; is another way to specify a Sun 3.
! 
!      <p>You can specify a version number after any of the system types, and some
  of the CPU types.  In most cases, the version is irrelevant, and will be
  ignored.  So you might as well specify the version if you know it.
! 
!      <p>See <a href="#Configurations">Configurations</a>, for a list of supported configuration names and
  notes on many of the configurations.  You should check the notes in that
  section before proceeding any further with the installation of GCC.
  
!         </ol>
! 
!    <p><h2><a name="Configurations"></a>Configurations Supported by GCC</h2><a name="index-configurations-supported-by-GCC-1"></a>
! Here are the possible CPU types:
  
!    <blockquote>
! <!-- gmicro, fx80, spur and tahoe omitted since they don't work. -->
! 1750a, a29k, alpha, arm, avr, c<var>n</var>, clipper, dsp16xx, elxsi, fr30, h8300,
  hppa1.0, hppa1.1, i370, i386, i486, i586, i686, i786, i860, i960, ip2k, m32r,
  m68000, m68k, m88k, mcore, mips, mipsel, mips64, mips64el,
  mn10200, mn10300, ns32k, pdp11, powerpc, powerpcle, romp, rs6000, sh, sparc,
! sparclite, sparc64, v850, vax, we32k. 
! </blockquote>
  
!    <p>Here are the recognized company names.  As you can see, customary
  abbreviations are used rather than the longer official names.
! 
! <!-- What should be done about merlin, tek*, dolphin? -->
!    <blockquote>
! acorn, alliant, altos, apollo, apple, att, bull,
  cbm, convergent, convex, crds, dec, dg, dolphin,
  elxsi, encore, harris, hitachi, hp, ibm, intergraph, isi,
  mips, motorola, ncr, next, ns, omron, plexus,
! sequent, sgi, sony, sun, tti, unicom, wrs. 
! </blockquote>
  
!    <p>The company name is meaningful only to disambiguate when the rest of
  the information supplied is insufficient.  You can omit it, writing
! just &lsquo;<samp><var>cpu</var><span class="samp">-</span><var>system</var></samp>&rsquo;, if it is not needed.  For example,
! &lsquo;<samp><span class="samp">vax-ultrix4.2</span></samp>&rsquo; is equivalent to &lsquo;<samp><span class="samp">vax-dec-ultrix4.2</span></samp>&rsquo;.
! 
!    <p>Here is a list of system types:
! 
!    <blockquote>
! 386bsd, aix, acis, amigaos, aos, aout, aux, bosx, bsd, clix, coff, ctix, cxux,
  dgux, dynix, ebmon, ecoff, elf, esix, freebsd, hms, genix, gnu, linux,
  linux-gnu, hiux, hpux, iris, irix, isc, luna, lynxos, mach, minix, msdos, mvs,
  netbsd, newsos, nindy, ns, osf, osfrose, ptx, riscix, riscos, rtu, sco, sim,
  solaris, sunos, sym, sysv, udi, ultrix, unicos, uniplus, unos, vms, vsta,
! vxworks, winnt, xenix. 
! </blockquote>
  
! <p class="noindent">You can omit the system type; then <samp><span class="file">configure</span></samp> guesses the
  operating system from the CPU and company.
! 
!    <p>You can add a version number to the system type; this may or may not
! make a difference.  For example, you can write &lsquo;<samp><span class="samp">bsd4.3</span></samp>&rsquo; or
! &lsquo;<samp><span class="samp">bsd4.4</span></samp>&rsquo; to distinguish versions of BSD.  In practice, the version
! number is most needed for &lsquo;<samp><span class="samp">sysv3</span></samp>&rsquo; and &lsquo;<samp><span class="samp">sysv4</span></samp>&rsquo;, which are often
  treated differently.
! 
!    <p>&lsquo;<samp><span class="samp">linux-gnu</span></samp>&rsquo; is the canonical name for the GNU/Linux target; however
! GCC will also accept &lsquo;<samp><span class="samp">linux</span></samp>&rsquo;.  The version of the kernel in use is
! not relevant on these systems.  A suffix such as &lsquo;<samp><span class="samp">libc1</span></samp>&rsquo; or &lsquo;<samp><span class="samp">aout</span></samp>&rsquo;
  distinguishes major versions of the C library; all of the suffixed versions
  are obsolete.
! 
!    <p>If you specify an impossible combination such as &lsquo;<samp><span class="samp">i860-dg-vms</span></samp>&rsquo;,
! then you may get an error message from <samp><span class="file">configure</span></samp>, or it may
! ignore part of the information and do the best it can with the rest. 
! <samp><span class="file">configure</span></samp> always prints the canonical name for the alternative
  that it used.  GCC does not support all possible alternatives.
! 
!    <p>Often a particular model of machine has a name.  Many machine names are
  recognized as aliases for CPU/company combinations.  Thus, the machine
! name &lsquo;<samp><span class="samp">sun3</span></samp>&rsquo;, mentioned above, is an alias for &lsquo;<samp><span class="samp">m68k-sun</span></samp>&rsquo;. 
  Sometimes we accept a company name as a machine name, when the name is
  popularly used for a particular machine.  Here is a table of the known
  machine names:
! 
!    <blockquote>
! 3300, 3b1, 3b<var>n</var>, 7300, altos3068, altos,
  apollo68, att-7300, balance,
  convex-c<var>n</var>, crds, decstation-3100,
  decstation, delta, encore,
--- 1,232 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
! 
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
  <h1 align="center">Old installation documentation</h1>
  
! <p>Note most of this information is out of date and superseded by the
  previous chapters of this manual.  It is provided for historical
  reference only, because of a lack of volunteers to merge it into the
  main manual.
+ </p>
  
! <p>Here is the procedure for installing GCC on a GNU or Unix system.
! </p>
! <ol>
! <li> If you have chosen a configuration for GCC which requires other GNU
  tools (such as GAS or the GNU linker) instead of the standard system
  tools, install the required tools in the build directory under the names
! <samp>as</samp>, <samp>ld</samp> or whatever is appropriate.
  
! <p>Alternatively, you can do subsequent compilation using a value of the
  <code>PATH</code> environment variable such that the necessary GNU tools come
  before the standard system tools.
+ </p>
+ </li><li> Specify the host, build and target machine configurations.  You do this
+ when you run the <samp>configure</samp> script.
  
! <p>The <em>build</em> machine is the system which you are using, the
! <em>host</em> machine is the system where you want to run the resulting
! compiler (normally the build machine), and the <em>target</em> machine is
  the system for which you want the compiler to generate code.
! </p>
! <p>If you are building a compiler to produce code for the machine it runs
  on (a native compiler), you normally do not need to specify any operands
! to <samp>configure</samp>; it will try to guess the type of machine you are on
! and use that as the build, host and target machines.  So you don&rsquo;t need
  to specify a configuration when building a native compiler unless
! <samp>configure</samp> cannot figure out what your configuration is or guesses
  wrong.
! </p>
! <p>In those cases, specify the build machine&rsquo;s <em>configuration name</em>
! with the <samp>--host</samp> option; the host and target will default to be
  the same as the host machine.
+ </p>
+ <p>Here is an example:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">./configure --host=sparc-sun-sunos4.1
+ </pre></div>
  
! <p>A configuration name may be canonical or it may be more or less
  abbreviated.
! </p>
! <p>A canonical configuration name has three parts, separated by dashes.
! It looks like this: &lsquo;<samp><var>cpu</var>-<var>company</var>-<var>system</var></samp>&rsquo;.
! (The three parts may themselves contain dashes; <samp>configure</samp>
  can figure out which dashes serve which purpose.)  For example,
! &lsquo;<samp>m68k-sun-sunos4.1</samp>&rsquo; specifies a Sun 3.
! </p>
! <p>You can also replace parts of the configuration by nicknames or aliases.
! For example, &lsquo;<samp>sun3</samp>&rsquo; stands for &lsquo;<samp>m68k-sun</samp>&rsquo;, so
! &lsquo;<samp>sun3-sunos4.1</samp>&rsquo; is another way to specify a Sun 3.
! </p>
! <p>You can specify a version number after any of the system types, and some
  of the CPU types.  In most cases, the version is irrelevant, and will be
  ignored.  So you might as well specify the version if you know it.
! </p>
! <p>See <a href="#Configurations">Configurations</a>, for a list of supported configuration names and
  notes on many of the configurations.  You should check the notes in that
  section before proceeding any further with the installation of GCC.
+ </p>
+ </li></ol>
  
! <h2><a name="Configurations"></a>Configurations Supported by GCC</h2>
! <a name="index-configurations-supported-by-GCC"></a>
  
! <p>Here are the possible CPU types:
! </p>
! <blockquote>
! <p>1750a, a29k, alpha, arm, avr, c<var>n</var>, clipper, dsp16xx, elxsi, fr30, h8300,
  hppa1.0, hppa1.1, i370, i386, i486, i586, i686, i786, i860, i960, ip2k, m32r,
  m68000, m68k, m88k, mcore, mips, mipsel, mips64, mips64el,
  mn10200, mn10300, ns32k, pdp11, powerpc, powerpcle, romp, rs6000, sh, sparc,
! sparclite, sparc64, v850, vax, we32k.
! </p></blockquote>
  
! <p>Here are the recognized company names.  As you can see, customary
  abbreviations are used rather than the longer official names.
! </p>
! <blockquote>
! <p>acorn, alliant, altos, apollo, apple, att, bull,
  cbm, convergent, convex, crds, dec, dg, dolphin,
  elxsi, encore, harris, hitachi, hp, ibm, intergraph, isi,
  mips, motorola, ncr, next, ns, omron, plexus,
! sequent, sgi, sony, sun, tti, unicom, wrs.
! </p></blockquote>
  
! <p>The company name is meaningful only to disambiguate when the rest of
  the information supplied is insufficient.  You can omit it, writing
! just &lsquo;<samp><var>cpu</var>-<var>system</var></samp>&rsquo;, if it is not needed.  For example,
! &lsquo;<samp>vax-ultrix4.2</samp>&rsquo; is equivalent to &lsquo;<samp>vax-dec-ultrix4.2</samp>&rsquo;.
! </p>
! <p>Here is a list of system types:
! </p>
! <blockquote>
! <p>386bsd, aix, acis, amigaos, aos, aout, aux, bosx, bsd, clix, coff, ctix, cxux,
  dgux, dynix, ebmon, ecoff, elf, esix, freebsd, hms, genix, gnu, linux,
  linux-gnu, hiux, hpux, iris, irix, isc, luna, lynxos, mach, minix, msdos, mvs,
  netbsd, newsos, nindy, ns, osf, osfrose, ptx, riscix, riscos, rtu, sco, sim,
  solaris, sunos, sym, sysv, udi, ultrix, unicos, uniplus, unos, vms, vsta,
! vxworks, winnt, xenix.
! </p></blockquote>
  
! <p>You can omit the system type; then <samp>configure</samp> guesses the
  operating system from the CPU and company.
! </p>
! <p>You can add a version number to the system type; this may or may not
! make a difference.  For example, you can write &lsquo;<samp>bsd4.3</samp>&rsquo; or
! &lsquo;<samp>bsd4.4</samp>&rsquo; to distinguish versions of BSD.  In practice, the version
! number is most needed for &lsquo;<samp>sysv3</samp>&rsquo; and &lsquo;<samp>sysv4</samp>&rsquo;, which are often
  treated differently.
! </p>
! <p>&lsquo;<samp>linux-gnu</samp>&rsquo; is the canonical name for the GNU/Linux target; however
! GCC will also accept &lsquo;<samp>linux</samp>&rsquo;.  The version of the kernel in use is
! not relevant on these systems.  A suffix such as &lsquo;<samp>libc1</samp>&rsquo; or &lsquo;<samp>aout</samp>&rsquo;
  distinguishes major versions of the C library; all of the suffixed versions
  are obsolete.
! </p>
! <p>If you specify an impossible combination such as &lsquo;<samp>i860-dg-vms</samp>&rsquo;,
! then you may get an error message from <samp>configure</samp>, or it may
! ignore part of the information and do the best it can with the rest.
! <samp>configure</samp> always prints the canonical name for the alternative
  that it used.  GCC does not support all possible alternatives.
! </p>
! <p>Often a particular model of machine has a name.  Many machine names are
  recognized as aliases for CPU/company combinations.  Thus, the machine
! name &lsquo;<samp>sun3</samp>&rsquo;, mentioned above, is an alias for &lsquo;<samp>m68k-sun</samp>&rsquo;.
  Sometimes we accept a company name as a machine name, when the name is
  popularly used for a particular machine.  Here is a table of the known
  machine names:
! </p>
! <blockquote>
! <p>3300, 3b1, 3b<var>n</var>, 7300, altos3068, altos,
  apollo68, att-7300, balance,
  convex-c<var>n</var>, crds, decstation-3100,
  decstation, delta, encore,
*************** m3230, magnum, merlin, miniframe,
*** 186,201 ****
  mmax, news-3600, news800, news, next,
  pbd, pc532, pmax, powerpc, powerpcle, ps2, risc-news,
  rtpc, sun2, sun386i, sun386, sun3,
! sun4, symmetry, tower-32, tower. 
! </blockquote>
  
! <p class="noindent">Remember that a machine name specifies both the cpu type and the company
! name. 
  <hr />
! <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 237,255 ----
  mmax, news-3600, news800, news, next,
  pbd, pc532, pmax, powerpc, powerpcle, ps2, risc-news,
  rtpc, sun2, sun386i, sun386, sun3,
! sun4, symmetry, tower-32, tower.
! </p></blockquote>
  
! <p>Remember that a machine name specifies both the cpu type and the company
! name.
  <hr />
! <p>
! <a href="./index.html">Return to the GCC Installation page</a>
! </p>
! 
  
  
+ 
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/prerequisites.html gcc-5.5.0/INSTALL/prerequisites.html
*** gcc-5.4.0/INSTALL/prerequisites.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/prerequisites.html	Tue Oct 10 08:13:23 2017
***************
*** 1,310 ****
! <html lang="en">
! <head>
! <title>Prerequisites for GCC</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Prerequisites for GCC">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
- <body>
- <h1 class="settitle">Prerequisites for GCC</h1>
- <a name="index-Prerequisites-1"></a>
- GCC requires that various tools and packages be available for use in the
- build procedure.  Modifying GCC sources requires additional tools
- described below.
  
! <h3 class="heading"><a name="TOC0"></a>Tools/packages necessary for building GCC</h3>
  
!      <dl>
! <dt>ISO C++98 compiler<dd>Necessary to bootstrap GCC, although versions of GCC prior
  to 4.8 also allow bootstrapping with a ISO C89 compiler and versions
  of GCC prior to 3.4 also allow bootstrapping with a traditional
  (K&amp;R) C compiler.
! 
!      <p>To build all languages in a cross-compiler or other configuration where
  3-stage bootstrap is not performed, you need to start with an existing
  GCC binary (version 3.4 or later) because source code for language
  frontends other than C might use GCC extensions.
! 
!      <p>Note that to bootstrap GCC with versions of GCC earlier than 3.4, you
! may need to use <samp><span class="option">--disable-stage1-checking</span></samp>, though
  bootstrapping the compiler with such earlier compilers is strongly
  discouraged.
! 
!      <br><dt>C standard library and headers<dd>
! In order to build GCC, the C standard library and headers must be present
  for all target variants for which target libraries will be built (and not
  only the variant of the host C++ compiler).
! 
!      <p>This affects the popular &lsquo;<samp><span class="samp">x86_64-unknown-linux-gnu</span></samp>&rsquo; platform (among
! other multilib targets), for which 64-bit (&lsquo;<samp><span class="samp">x86_64</span></samp>&rsquo;) and 32-bit
! (&lsquo;<samp><span class="samp">i386</span></samp>&rsquo;) libc headers are usually packaged separately. If you do a
! build of a native compiler on &lsquo;<samp><span class="samp">x86_64-unknown-linux-gnu</span></samp>&rsquo;, make sure you
  either have the 32-bit libc developer package properly installed (the exact
  name of the package depends on your distro) or you must build GCC as a
  64-bit only compiler by configuring with the option
! <samp><span class="option">--disable-multilib</span></samp>.  Otherwise, you may encounter an error such as
! &lsquo;<samp><span class="samp">fatal error: gnu/stubs-32.h: No such file</span></samp>&rsquo;
! 
!      <br><dt>GNAT<dd>
! In order to build the Ada compiler (GNAT) you must already have GNAT
  installed because portions of the Ada frontend are written in Ada (with
  GNAT extensions.)  Refer to the Ada installation instructions for more
  specific information.
! 
!      <br><dt>A &ldquo;working&rdquo; POSIX compatible shell, or GNU bash<dd>
! Necessary when running <samp><span class="command">configure</span></samp> because some
! <samp><span class="command">/bin/sh</span></samp> shells have bugs and may crash when configuring the
! target libraries.  In other cases, <samp><span class="command">/bin/sh</span></samp> or <samp><span class="command">ksh</span></samp>
  have disastrous corner-case performance problems.  This
! can cause target <samp><span class="command">configure</span></samp> runs to literally take days to
  complete in some cases.
! 
!      <p>So on some platforms <samp><span class="command">/bin/ksh</span></samp> is sufficient, on others it
! isn't.  See the host/target specific instructions for your platform, or
! use <samp><span class="command">bash</span></samp> to be sure.  Then set <samp><span class="env">CONFIG_SHELL</span></samp> in your
  environment to your &ldquo;good&rdquo; shell prior to running
! <samp><span class="command">configure</span></samp>/<samp><span class="command">make</span></samp>.
! 
!      <p><samp><span class="command">zsh</span></samp> is not a fully compliant POSIX shell and will not
  work when configuring GCC.
! 
!      <br><dt>A POSIX or SVR4 awk<dd>
! Necessary for creating some of the generated source files for GCC. 
  If in doubt, use a recent GNU awk version, as some of the older ones
  are broken.  GNU awk version 3.1.5 is known to work.
! 
!      <br><dt>GNU binutils<dd>
! Necessary in some circumstances, optional in others.  See the
  host/target specific instructions for your platform for the exact
  requirements.
! 
!      <br><dt>gzip version 1.2.4 (or later) or<dt>bzip2 version 1.0.2 (or later)<dd>
! Necessary to uncompress GCC <samp><span class="command">tar</span></samp> files when source code is
  obtained via FTP mirror sites.
! 
!      <br><dt>GNU make version 3.80 (or later)<dd>
! You must have GNU make installed to build GCC.
! 
!      <br><dt>GNU tar version 1.14 (or later)<dd>
! Necessary (only on some platforms) to untar the source code.  Many
! systems' <samp><span class="command">tar</span></samp> programs will also work, only try GNU
! <samp><span class="command">tar</span></samp> if you have problems.
! 
!      <br><dt>Perl version 5.6.1 (or later)<dd>
! Necessary when targeting Darwin, building &lsquo;<samp><span class="samp">libstdc++</span></samp>&rsquo;,
! and not using <samp><span class="option">--disable-symvers</span></samp>. 
! Necessary when targeting Solaris 2 with Sun <samp><span class="command">ld</span></samp> and not using
! <samp><span class="option">--disable-symvers</span></samp>.  The bundled <samp><span class="command">perl</span></samp> in Solaris&nbsp;8
  and up works.
! 
!      <p>Necessary when regenerating <samp><span class="file">Makefile</span></samp> dependencies in libiberty. 
! Necessary when regenerating <samp><span class="file">libiberty/functions.texi</span></samp>. 
! Necessary when generating manpages from Texinfo manuals. 
  Used by various scripts to generate some files included in SVN (mainly
  Unicode-related and rarely changing) from source tables.
! 
!      <br><dt><samp><span class="command">jar</span></samp>, or InfoZIP (<samp><span class="command">zip</span></samp> and <samp><span class="command">unzip</span></samp>)<dd>
! Necessary to build libgcj, the GCJ runtime.
! 
  </dl>
  
!    <p>Several support libraries are necessary to build GCC, some are required,
  others optional.  While any sufficiently new version of required tools
  usually work, library requirements are generally stricter.  Newer
! versions may work in some cases, but it's safer to use the exact
  versions documented.  We appreciate bug reports about problems with
  newer versions, though.  If your OS vendor provides packages for the
  support libraries then using those packages may be the simplest way to
  install the libraries.
! 
!      <dl>
! <dt>GNU Multiple Precision Library (GMP) version 4.3.2 (or later)<dd>
! Necessary to build GCC.  If a GMP source distribution is found in a
! subdirectory of your GCC sources named <samp><span class="file">gmp</span></samp>, it will be built
  together with GCC.  Alternatively, if GMP is already installed but it
  is not in your library search path, you will have to configure with the
! <samp><span class="option">--with-gmp</span></samp> configure option.  See also <samp><span class="option">--with-gmp-lib</span></samp>
! and <samp><span class="option">--with-gmp-include</span></samp>.
! 
!      <br><dt>MPFR Library version 2.4.2 (or later)<dd>
! Necessary to build GCC.  It can be downloaded from
  <a href="http://www.mpfr.org/">http://www.mpfr.org/</a>.  If an MPFR source distribution is found
! in a subdirectory of your GCC sources named <samp><span class="file">mpfr</span></samp>, it will be
  built together with GCC.  Alternatively, if MPFR is already installed
  but it is not in your default library search path, the
! <samp><span class="option">--with-mpfr</span></samp> configure option should be used.  See also
! <samp><span class="option">--with-mpfr-lib</span></samp> and <samp><span class="option">--with-mpfr-include</span></samp>.
! 
!      <br><dt>MPC Library version 0.8.1 (or later)<dd>
! Necessary to build GCC.  It can be downloaded from
  <a href="http://www.multiprecision.org/">http://www.multiprecision.org/</a>.  If an MPC source distribution
! is found in a subdirectory of your GCC sources named <samp><span class="file">mpc</span></samp>, it
  will be built together with GCC.  Alternatively, if MPC is already
  installed but it is not in your default library search path, the
! <samp><span class="option">--with-mpc</span></samp> configure option should be used.  See also
! <samp><span class="option">--with-mpc-lib</span></samp> and <samp><span class="option">--with-mpc-include</span></samp>.
! 
!      <br><dt>ISL Library version 0.14 (or 0.12.2)<dd>
! Necessary to build GCC with the Graphite loop optimizations. 
  It can be downloaded from <a href="ftp://gcc.gnu.org/pub/gcc/infrastructure/">ftp://gcc.gnu.org/pub/gcc/infrastructure/</a>
! as <samp><span class="file">isl-0.12.2.tar.bz2</span></samp>.  If an ISL source distribution is found
! in a subdirectory of your GCC sources named <samp><span class="file">isl</span></samp>, it will be
! built together with GCC.  Alternatively, the <samp><span class="option">--with-isl</span></samp> configure
  option should be used if ISL is not installed in your default library
  search path.
  
!    </dl>
! 
! <h3 class="heading"><a name="TOC1"></a>Tools/packages necessary for modifying GCC</h3>
! 
!      <dl>
! <dt>autoconf version 2.64<dt>GNU m4 version 1.4.6 (or later)<dd>
! Necessary when modifying <samp><span class="file">configure.ac</span></samp>, <samp><span class="file">aclocal.m4</span></samp>, etc. 
! to regenerate <samp><span class="file">configure</span></samp> and <samp><span class="file">config.in</span></samp> files.
! 
!      <br><dt>automake version 1.11.1<dd>
! Necessary when modifying a <samp><span class="file">Makefile.am</span></samp> file to regenerate its
! associated <samp><span class="file">Makefile.in</span></samp>.
! 
!      <p>Much of GCC does not use automake, so directly edit the <samp><span class="file">Makefile.in</span></samp>
! file.  Specifically this applies to the <samp><span class="file">gcc</span></samp>, <samp><span class="file">intl</span></samp>,
! <samp><span class="file">libcpp</span></samp>, <samp><span class="file">libiberty</span></samp>, <samp><span class="file">libobjc</span></samp> directories as well
  as any of their subdirectories.
! 
!      <p>For directories that use automake, GCC requires the latest release in
  the 1.11 series, which is currently 1.11.1.  When regenerating a directory
  to a newer version, please update all the directories using an older 1.11
  to the latest released version.
! 
!      <br><dt>gettext version 0.14.5 (or later)<dd>
! Needed to regenerate <samp><span class="file">gcc.pot</span></samp>.
! 
!      <br><dt>gperf version 2.7.2 (or later)<dd>
! Necessary when modifying <samp><span class="command">gperf</span></samp> input files, e.g. 
! <samp><span class="file">gcc/cp/cfns.gperf</span></samp> to regenerate its associated header file, e.g. 
! <samp><span class="file">gcc/cp/cfns.h</span></samp>.
! 
!      <br><dt>DejaGnu 1.4.4<dt>Expect<dt>Tcl<dd>
! Necessary to run the GCC testsuite; see the section on testing for
  details.  Tcl 8.6 has a known regression in RE pattern handling that
  make parts of the testsuite fail.  See
  <a href="http://core.tcl.tk/tcl/tktview/267b7e2334ee2e9de34c4b00d6e72e2f1997085f">http://core.tcl.tk/tcl/tktview/267b7e2334ee2e9de34c4b00d6e72e2f1997085f</a>
  for more information.  This bug has been fixed in 8.6.1.
! 
!      <br><dt>autogen version 5.5.4 (or later) and<dt>guile version 1.4.1 (or later)<dd>
! Necessary to regenerate <samp><span class="file">fixinc/fixincl.x</span></samp> from
! <samp><span class="file">fixinc/inclhack.def</span></samp> and <samp><span class="file">fixinc/*.tpl</span></samp>.
! 
!      <p>Necessary to run &lsquo;<samp><span class="samp">make check</span></samp>&rsquo; for <samp><span class="file">fixinc</span></samp>.
! 
!      <p>Necessary to regenerate the top level <samp><span class="file">Makefile.in</span></samp> file from
! <samp><span class="file">Makefile.tpl</span></samp> and <samp><span class="file">Makefile.def</span></samp>.
! 
!      <br><dt>Flex version 2.5.4 (or later)<dd>
! Necessary when modifying <samp><span class="file">*.l</span></samp> files.
! 
!      <p>Necessary to build GCC during development because the generated output
  files are not included in the SVN repository.  They are included in
  releases.
! 
!      <br><dt>Texinfo version 4.7 (or later)<dd>
! Necessary for running <samp><span class="command">makeinfo</span></samp> when modifying <samp><span class="file">*.texi</span></samp>
  files to test your changes.
! 
!      <p>Necessary for running <samp><span class="command">make dvi</span></samp> or <samp><span class="command">make pdf</span></samp> to
  create printable documentation in DVI or PDF format.  Texinfo version
! 4.8 or later is required for <samp><span class="command">make pdf</span></samp>.
! 
!      <p>Necessary to build GCC documentation during development because the
  generated output files are not included in the SVN repository.  They are
  included in releases.
! 
!      <br><dt>TeX (any working version)<dd>
! Necessary for running <samp><span class="command">texi2dvi</span></samp> and <samp><span class="command">texi2pdf</span></samp>, which
! are used when running <samp><span class="command">make dvi</span></samp> or <samp><span class="command">make pdf</span></samp> to create
  DVI or PDF files, respectively.
! 
!      <br><dt>Sphinx version 1.0 (or later)<dd>
! Necessary to regenerate <samp><span class="file">jit/docs/_build/texinfo</span></samp> from the <samp><span class="file">.rst</span></samp>
! files in the directories below <samp><span class="file">jit/docs</span></samp>.
! 
!      <br><dt>SVN (any version)<dt>SSH (any version)<dd>
! Necessary to access the SVN repository.  Public releases and weekly
  snapshots of the development sources are also available via FTP.
! 
!      <br><dt>GNU diffutils version 2.7 (or later)<dd>
! Useful when submitting patches for the GCC source code.
! 
!      <br><dt>patch version 2.5.4 (or later)<dd>
! Necessary when applying patches, created with <samp><span class="command">diff</span></samp>, to one's
  own sources.
! 
!      <br><dt>ecj1<dt>gjavah<dd>
! If you wish to modify <samp><span class="file">.java</span></samp> files in libjava, you will need to
! configure with <samp><span class="option">--enable-java-maintainer-mode</span></samp>, and you will need
! to have executables named <samp><span class="command">ecj1</span></samp> and <samp><span class="command">gjavah</span></samp> in your path. 
! The <samp><span class="command">ecj1</span></samp> executable should run the Eclipse Java compiler via
  the GCC-specific entry point.  You can download a suitable jar from
  <a href="ftp://sourceware.org/pub/java/">ftp://sourceware.org/pub/java/</a>, or by running the script
! <samp><span class="command">contrib/download_ecj</span></samp>.
! 
!      <br><dt>antlr.jar version 2.7.1 (or later)<dt>antlr binary<dd>
! If you wish to build the <samp><span class="command">gjdoc</span></samp> binary in libjava, you will
! need to have an <samp><span class="file">antlr.jar</span></samp> library available. The library is
  searched for in system locations but can be specified with
! <samp><span class="option">--with-antlr-jar=</span></samp> instead.  When configuring with
! <samp><span class="option">--enable-java-maintainer-mode</span></samp>, you will need to have one of
! the executables named <samp><span class="command">cantlr</span></samp>, <samp><span class="command">runantlr</span></samp> or
! <samp><span class="command">antlr</span></samp> in your path.
! 
  </dl>
  
!    <p><hr />
  <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- ***Downloading the source************************************************** -->
- <!-- ***Configuration*********************************************************** -->
- <!-- ***Building**************************************************************** -->
- <!-- ***Testing***************************************************************** -->
- <!-- ***Final install*********************************************************** -->
- <!-- ***Binaries**************************************************************** -->
- <!-- ***Specific**************************************************************** -->
- <!-- ***Old documentation****************************************************** -->
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 1,421 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
  
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
  
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <a name="index-Prerequisites"></a>
! 
! <p>GCC requires that various tools and packages be available for use in the
! build procedure.  Modifying GCC sources requires additional tools
! described below.
! </p>
! <a name="Tools_002fpackages-necessary-for-building-GCC"></a>
! <h3 class="heading">Tools/packages necessary for building GCC</h3>
! <dl compact="compact">
! <dt>ISO C++98 compiler</dt>
! <dd><p>Necessary to bootstrap GCC, although versions of GCC prior
  to 4.8 also allow bootstrapping with a ISO C89 compiler and versions
  of GCC prior to 3.4 also allow bootstrapping with a traditional
  (K&amp;R) C compiler.
! </p>
! <p>To build all languages in a cross-compiler or other configuration where
  3-stage bootstrap is not performed, you need to start with an existing
  GCC binary (version 3.4 or later) because source code for language
  frontends other than C might use GCC extensions.
! </p>
! <p>Note that to bootstrap GCC with versions of GCC earlier than 3.4, you
! may need to use <samp>--disable-stage1-checking</samp>, though
  bootstrapping the compiler with such earlier compilers is strongly
  discouraged.
! </p>
! </dd>
! <dt>C standard library and headers</dt>
! <dd>
! <p>In order to build GCC, the C standard library and headers must be present
  for all target variants for which target libraries will be built (and not
  only the variant of the host C++ compiler).
! </p>
! <p>This affects the popular &lsquo;<samp>x86_64-unknown-linux-gnu</samp>&rsquo; platform (among
! other multilib targets), for which 64-bit (&lsquo;<samp>x86_64</samp>&rsquo;) and 32-bit
! (&lsquo;<samp>i386</samp>&rsquo;) libc headers are usually packaged separately. If you do a
! build of a native compiler on &lsquo;<samp>x86_64-unknown-linux-gnu</samp>&rsquo;, make sure you
  either have the 32-bit libc developer package properly installed (the exact
  name of the package depends on your distro) or you must build GCC as a
  64-bit only compiler by configuring with the option
! <samp>--disable-multilib</samp>.  Otherwise, you may encounter an error such as
! &lsquo;<samp>fatal error: gnu/stubs-32.h: No such file</samp>&rsquo;
! </p>
! </dd>
! <dt>GNAT</dt>
! <dd>
! <p>In order to build the Ada compiler (GNAT) you must already have GNAT
  installed because portions of the Ada frontend are written in Ada (with
  GNAT extensions.)  Refer to the Ada installation instructions for more
  specific information.
! </p>
! </dd>
! <dt>A &ldquo;working&rdquo; POSIX compatible shell, or GNU bash</dt>
! <dd>
! <p>Necessary when running <code>configure</code> because some
! <code>/bin/sh</code> shells have bugs and may crash when configuring the
! target libraries.  In other cases, <code>/bin/sh</code> or <code>ksh</code>
  have disastrous corner-case performance problems.  This
! can cause target <code>configure</code> runs to literally take days to
  complete in some cases.
! </p>
! <p>So on some platforms <code>/bin/ksh</code> is sufficient, on others it
! isn&rsquo;t.  See the host/target specific instructions for your platform, or
! use <code>bash</code> to be sure.  Then set <code>CONFIG_SHELL</code> in your
  environment to your &ldquo;good&rdquo; shell prior to running
! <code>configure</code>/<code>make</code>.
! </p>
! <p><code>zsh</code> is not a fully compliant POSIX shell and will not
  work when configuring GCC.
! </p>
! </dd>
! <dt>A POSIX or SVR4 awk</dt>
! <dd>
! <p>Necessary for creating some of the generated source files for GCC.
  If in doubt, use a recent GNU awk version, as some of the older ones
  are broken.  GNU awk version 3.1.5 is known to work.
! </p>
! </dd>
! <dt>GNU binutils</dt>
! <dd>
! <p>Necessary in some circumstances, optional in others.  See the
  host/target specific instructions for your platform for the exact
  requirements.
! </p>
! </dd>
! <dt>gzip version 1.2.4 (or later) or</dt>
! <dt>bzip2 version 1.0.2 (or later)</dt>
! <dd>
! <p>Necessary to uncompress GCC <code>tar</code> files when source code is
  obtained via FTP mirror sites.
! </p>
! </dd>
! <dt>GNU make version 3.80 (or later)</dt>
! <dd>
! <p>You must have GNU make installed to build GCC.
! </p>
! </dd>
! <dt>GNU tar version 1.14 (or later)</dt>
! <dd>
! <p>Necessary (only on some platforms) to untar the source code.  Many
! systems&rsquo; <code>tar</code> programs will also work, only try GNU
! <code>tar</code> if you have problems.
! </p>
! </dd>
! <dt>Perl version 5.6.1 (or later)</dt>
! <dd>
! <p>Necessary when targeting Darwin, building &lsquo;<samp>libstdc++</samp>&rsquo;,
! and not using <samp>--disable-symvers</samp>.
! Necessary when targeting Solaris 2 with Sun <code>ld</code> and not using
! <samp>--disable-symvers</samp>.  The bundled <code>perl</code> in Solaris&nbsp;8
  and up works.
! </p>
! <p>Necessary when regenerating <samp>Makefile</samp> dependencies in libiberty.
! Necessary when regenerating <samp>libiberty/functions.texi</samp>.
! Necessary when generating manpages from Texinfo manuals.
  Used by various scripts to generate some files included in SVN (mainly
  Unicode-related and rarely changing) from source tables.
! </p>
! </dd>
! <dt><code>jar</code>, or InfoZIP (<code>zip</code> and <code>unzip</code>)</dt>
! <dd>
! <p>Necessary to build libgcj, the GCJ runtime.
! </p>
! </dd>
  </dl>
  
! <p>Several support libraries are necessary to build GCC, some are required,
  others optional.  While any sufficiently new version of required tools
  usually work, library requirements are generally stricter.  Newer
! versions may work in some cases, but it&rsquo;s safer to use the exact
  versions documented.  We appreciate bug reports about problems with
  newer versions, though.  If your OS vendor provides packages for the
  support libraries then using those packages may be the simplest way to
  install the libraries.
! </p>
! <dl compact="compact">
! <dt>GNU Multiple Precision Library (GMP) version 4.3.2 (or later)</dt>
! <dd>
! <p>Necessary to build GCC.  If a GMP source distribution is found in a
! subdirectory of your GCC sources named <samp>gmp</samp>, it will be built
  together with GCC.  Alternatively, if GMP is already installed but it
  is not in your library search path, you will have to configure with the
! <samp>--with-gmp</samp> configure option.  See also <samp>--with-gmp-lib</samp>
! and <samp>--with-gmp-include</samp>.
! </p>
! </dd>
! <dt>MPFR Library version 2.4.2 (or later)</dt>
! <dd>
! <p>Necessary to build GCC.  It can be downloaded from
  <a href="http://www.mpfr.org/">http://www.mpfr.org/</a>.  If an MPFR source distribution is found
! in a subdirectory of your GCC sources named <samp>mpfr</samp>, it will be
  built together with GCC.  Alternatively, if MPFR is already installed
  but it is not in your default library search path, the
! <samp>--with-mpfr</samp> configure option should be used.  See also
! <samp>--with-mpfr-lib</samp> and <samp>--with-mpfr-include</samp>.
! </p>
! </dd>
! <dt>MPC Library version 0.8.1 (or later)</dt>
! <dd>
! <p>Necessary to build GCC.  It can be downloaded from
  <a href="http://www.multiprecision.org/">http://www.multiprecision.org/</a>.  If an MPC source distribution
! is found in a subdirectory of your GCC sources named <samp>mpc</samp>, it
  will be built together with GCC.  Alternatively, if MPC is already
  installed but it is not in your default library search path, the
! <samp>--with-mpc</samp> configure option should be used.  See also
! <samp>--with-mpc-lib</samp> and <samp>--with-mpc-include</samp>.
! </p>
! </dd>
! <dt>ISL Library version 0.14 (or 0.12.2)</dt>
! <dd>
! <p>Necessary to build GCC with the Graphite loop optimizations.
  It can be downloaded from <a href="ftp://gcc.gnu.org/pub/gcc/infrastructure/">ftp://gcc.gnu.org/pub/gcc/infrastructure/</a>
! as <samp>isl-0.12.2.tar.bz2</samp>.  If an ISL source distribution is found
! in a subdirectory of your GCC sources named <samp>isl</samp>, it will be
! built together with GCC.  Alternatively, the <samp>--with-isl</samp> configure
  option should be used if ISL is not installed in your default library
  search path.
+ </p>
+ </dd>
+ </dl>
  
! <a name="Tools_002fpackages-necessary-for-modifying-GCC"></a>
! <h3 class="heading">Tools/packages necessary for modifying GCC</h3>
! <dl compact="compact">
! <dt>autoconf version 2.64</dt>
! <dt>GNU m4 version 1.4.6 (or later)</dt>
! <dd>
! <p>Necessary when modifying <samp>configure.ac</samp>, <samp>aclocal.m4</samp>, etc.
! to regenerate <samp>configure</samp> and <samp>config.in</samp> files.
! </p>
! </dd>
! <dt>automake version 1.11.1</dt>
! <dd>
! <p>Necessary when modifying a <samp>Makefile.am</samp> file to regenerate its
! associated <samp>Makefile.in</samp>.
! </p>
! <p>Much of GCC does not use automake, so directly edit the <samp>Makefile.in</samp>
! file.  Specifically this applies to the <samp>gcc</samp>, <samp>intl</samp>,
! <samp>libcpp</samp>, <samp>libiberty</samp>, <samp>libobjc</samp> directories as well
  as any of their subdirectories.
! </p>
! <p>For directories that use automake, GCC requires the latest release in
  the 1.11 series, which is currently 1.11.1.  When regenerating a directory
  to a newer version, please update all the directories using an older 1.11
  to the latest released version.
! </p>
! </dd>
! <dt>gettext version 0.14.5 (or later)</dt>
! <dd>
! <p>Needed to regenerate <samp>gcc.pot</samp>.
! </p>
! </dd>
! <dt>gperf version 2.7.2 (or later)</dt>
! <dd>
! <p>Necessary when modifying <code>gperf</code> input files, e.g.
! <samp>gcc/cp/cfns.gperf</samp> to regenerate its associated header file, e.g.
! <samp>gcc/cp/cfns.h</samp>.
! </p>
! </dd>
! <dt>DejaGnu 1.4.4</dt>
! <dt>Expect</dt>
! <dt>Tcl</dt>
! <dd>
! <p>Necessary to run the GCC testsuite; see the section on testing for
  details.  Tcl 8.6 has a known regression in RE pattern handling that
  make parts of the testsuite fail.  See
  <a href="http://core.tcl.tk/tcl/tktview/267b7e2334ee2e9de34c4b00d6e72e2f1997085f">http://core.tcl.tk/tcl/tktview/267b7e2334ee2e9de34c4b00d6e72e2f1997085f</a>
  for more information.  This bug has been fixed in 8.6.1.
! </p>
! </dd>
! <dt>autogen version 5.5.4 (or later) and</dt>
! <dt>guile version 1.4.1 (or later)</dt>
! <dd>
! <p>Necessary to regenerate <samp>fixinc/fixincl.x</samp> from
! <samp>fixinc/inclhack.def</samp> and <samp>fixinc/*.tpl</samp>.
! </p>
! <p>Necessary to run &lsquo;<samp>make check</samp>&rsquo; for <samp>fixinc</samp>.
! </p>
! <p>Necessary to regenerate the top level <samp>Makefile.in</samp> file from
! <samp>Makefile.tpl</samp> and <samp>Makefile.def</samp>.
! </p>
! </dd>
! <dt>Flex version 2.5.4 (or later)</dt>
! <dd>
! <p>Necessary when modifying <samp>*.l</samp> files.
! </p>
! <p>Necessary to build GCC during development because the generated output
  files are not included in the SVN repository.  They are included in
  releases.
! </p>
! </dd>
! <dt>Texinfo version 4.7 (or later)</dt>
! <dd>
! <p>Necessary for running <code>makeinfo</code> when modifying <samp>*.texi</samp>
  files to test your changes.
! </p>
! <p>Necessary for running <code>make dvi</code> or <code>make pdf</code> to
  create printable documentation in DVI or PDF format.  Texinfo version
! 4.8 or later is required for <code>make pdf</code>.
! </p>
! <p>Necessary to build GCC documentation during development because the
  generated output files are not included in the SVN repository.  They are
  included in releases.
! </p>
! </dd>
! <dt>TeX (any working version)</dt>
! <dd>
! <p>Necessary for running <code>texi2dvi</code> and <code>texi2pdf</code>, which
! are used when running <code>make dvi</code> or <code>make pdf</code> to create
  DVI or PDF files, respectively.
! </p>
! </dd>
! <dt>Sphinx version 1.0 (or later)</dt>
! <dd>
! <p>Necessary to regenerate <samp>jit/docs/_build/texinfo</samp> from the <samp>.rst</samp>
! files in the directories below <samp>jit/docs</samp>.
! </p>
! </dd>
! <dt>SVN (any version)</dt>
! <dt>SSH (any version)</dt>
! <dd>
! <p>Necessary to access the SVN repository.  Public releases and weekly
  snapshots of the development sources are also available via FTP.
! </p>
! </dd>
! <dt>GNU diffutils version 2.7 (or later)</dt>
! <dd>
! <p>Useful when submitting patches for the GCC source code.
! </p>
! </dd>
! <dt>patch version 2.5.4 (or later)</dt>
! <dd>
! <p>Necessary when applying patches, created with <code>diff</code>, to one&rsquo;s
  own sources.
! </p>
! </dd>
! <dt>ecj1</dt>
! <dt>gjavah</dt>
! <dd>
! <p>If you wish to modify <samp>.java</samp> files in libjava, you will need to
! configure with <samp>--enable-java-maintainer-mode</samp>, and you will need
! to have executables named <code>ecj1</code> and <code>gjavah</code> in your path.
! The <code>ecj1</code> executable should run the Eclipse Java compiler via
  the GCC-specific entry point.  You can download a suitable jar from
  <a href="ftp://sourceware.org/pub/java/">ftp://sourceware.org/pub/java/</a>, or by running the script
! <code>contrib/download_ecj</code>.
! </p>
! </dd>
! <dt>antlr.jar version 2.7.1 (or later)</dt>
! <dt>antlr binary</dt>
! <dd>
! <p>If you wish to build the <code>gjdoc</code> binary in libjava, you will
! need to have an <samp>antlr.jar</samp> library available. The library is
  searched for in system locations but can be specified with
! <samp>--with-antlr-jar=</samp> instead.  When configuring with
! <samp>--enable-java-maintainer-mode</samp>, you will need to have one of
! the executables named <code>cantlr</code>, <code>runantlr</code> or
! <code>antlr</code> in your path.
! </p>
! </dd>
  </dl>
  
! <hr />
! <p>
  <p><a href="./index.html">Return to the GCC Installation page</a>
+ </p>
+ 
+ 
+ 
+ 
+ 
  
  
+ 
+ 
+ 
+ 
+ 
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/specific.html gcc-5.5.0/INSTALL/specific.html
*** gcc-5.4.0/INSTALL/specific.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/specific.html	Tue Oct 10 08:13:23 2017
***************
*** 1,673 ****
! <html lang="en">
! <head>
! <title>Host/Target specific installation notes for GCC</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Host/Target specific installation notes for GCC">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
- <body>
- <h1 class="settitle">Host/Target specific installation notes for GCC</h1>
- <a name="index-Specific-1"></a><a name="index-Specific-installation-notes-2"></a><a name="index-Target-specific-installation-3"></a><a name="index-Host-specific-installation-4"></a><a name="index-Target-specific-installation-notes-5"></a>
- Please read this document carefully <em>before</em> installing the
- GNU Compiler Collection on your machine.
  
!    <p>Note that this list of install notes is <em>not</em> a list of supported
! hosts or targets.  Not all supported hosts and targets are listed
! here, only the ones that require host-specific or target-specific
! information have to.
  
-      <ul>
- <li><a href="#aarch64-x-x">aarch64*-*-*</a>
- <li><a href="#alpha-x-x">alpha*-*-*</a>
- <li><a href="#alpha-dec-osf51">alpha*-dec-osf5.1</a>
- <li><a href="#amd64-x-solaris210">amd64-*-solaris2.10</a>
- <li><a href="#arm-x-eabi">arm-*-eabi</a>
- <li><a href="#avr">avr</a>
- <li><a href="#bfin">Blackfin</a>
- <li><a href="#dos">DOS</a>
- <li><a href="#x-x-freebsd">*-*-freebsd*</a>
- <li><a href="#h8300-hms">h8300-hms</a>
- <li><a href="#hppa-hp-hpux">hppa*-hp-hpux*</a>
- <li><a href="#hppa-hp-hpux10">hppa*-hp-hpux10</a>
- <li><a href="#hppa-hp-hpux11">hppa*-hp-hpux11</a>
- <li><a href="#x-x-linux-gnu">*-*-linux-gnu</a>
- <li><a href="#ix86-x-linux">i?86-*-linux*</a>
- <li><a href="#ix86-x-solaris210">i?86-*-solaris2.10</a>
- <li><a href="#ia64-x-linux">ia64-*-linux</a>
- <li><a href="#ia64-x-hpux">ia64-*-hpux*</a>
- <li><a href="#x-ibm-aix">*-ibm-aix*</a>
- <li><a href="#iq2000-x-elf">iq2000-*-elf</a>
- <li><a href="#lm32-x-elf">lm32-*-elf</a>
- <li><a href="#lm32-x-uclinux">lm32-*-uclinux</a>
- <li><a href="#m32c-x-elf">m32c-*-elf</a>
- <li><a href="#m32r-x-elf">m32r-*-elf</a>
- <li><a href="#m68k-x-x">m68k-*-*</a>
- <li><a href="#m68k-uclinux">m68k-uclinux</a>
- <li><a href="#mep-x-elf">mep-*-elf</a>
- <li><a href="#microblaze-x-elf">microblaze-*-elf</a>
- <li><a href="#mips-x-x">mips-*-*</a>
- <li><a href="#mips-sgi-irix5">mips-sgi-irix5</a>
- <li><a href="#mips-sgi-irix6">mips-sgi-irix6</a>
- <li><a href="#nds32le-x-elf">nds32le-*-elf</a>
- <li><a href="#nds32be-x-elf">nds32be-*-elf</a>
- <li><a href="#nvptx-x-none">nvptx-*-none</a>
- <li><a href="#powerpc-x-x">powerpc*-*-*</a>
- <li><a href="#powerpc-x-darwin">powerpc-*-darwin*</a>
- <li><a href="#powerpc-x-elf">powerpc-*-elf</a>
- <li><a href="#powerpc-x-linux-gnu">powerpc*-*-linux-gnu*</a>
- <li><a href="#powerpc-x-netbsd">powerpc-*-netbsd*</a>
- <li><a href="#powerpc-x-eabisim">powerpc-*-eabisim</a>
- <li><a href="#powerpc-x-eabi">powerpc-*-eabi</a>
- <li><a href="#powerpcle-x-elf">powerpcle-*-elf</a>
- <li><a href="#powerpcle-x-eabisim">powerpcle-*-eabisim</a>
- <li><a href="#powerpcle-x-eabi">powerpcle-*-eabi</a>
- <li><a href="#s390-x-linux">s390-*-linux*</a>
- <li><a href="#s390x-x-linux">s390x-*-linux*</a>
- <li><a href="#s390x-ibm-tpf">s390x-ibm-tpf*</a>
- <li><a href="#x-x-solaris2">*-*-solaris2*</a>
- <li><a href="#sparc-x-x">sparc*-*-*</a>
- <li><a href="#sparc-sun-solaris2">sparc-sun-solaris2*</a>
- <li><a href="#sparc-sun-solaris210">sparc-sun-solaris2.10</a>
- <li><a href="#sparc-x-linux">sparc-*-linux*</a>
- <li><a href="#sparc64-x-solaris2">sparc64-*-solaris2*</a>
- <li><a href="#sparcv9-x-solaris2">sparcv9-*-solaris2*</a>
- <li><a href="#c6x-x-x">c6x-*-*</a>
- <li><a href="#tilegx-x-linux">tilegx-*-linux*</a>
- <li><a href="#tilegxbe-x-linux">tilegxbe-*-linux*</a>
- <li><a href="#tilepro-x-linux">tilepro-*-linux*</a>
- <li><a href="#visium-x-elf">visium-*-elf</a>
- <li><a href="#x-x-vxworks">*-*-vxworks*</a>
- <li><a href="#x86-64-x-x">x86_64-*-*</a> amd64-*-*
- <li><a href="#x86-64-x-solaris210">x86_64-*-solaris2.1[0-9]*</a>
- <li><a href="#xtensa-x-elf">xtensa*-*-elf</a>
- <li><a href="#xtensa-x-linux">xtensa*-*-linux*</a>
- <li><a href="#windows">Microsoft Windows</a>
- <li><a href="#x-x-cygwin">*-*-cygwin</a>
- <li><a href="#x-x-interix">*-*-interix</a>
- <li><a href="#x-x-mingw32">*-*-mingw32</a>
- <li><a href="#os2">OS/2</a>
- <li><a href="#older">Older systems</a>
- </ul>
  
-      <ul>
- <li><a href="#elf">all ELF targets</a> (SVR4, Solaris 2, etc.) 
- </ul>
  
-    <p><!-- -------- host/target specific issues start here ---------------- -->
- <hr /><a name="aarch64_002dx_002dx"></a>
  
- <h3 class="heading"><a name="TOC0"></a>aarch64*-*-*</h3>
  
- <p>Binutils pre 2.24 does not have support for selecting <samp><span class="option">-mabi</span></samp> and
- does not support ILP32.  If it is used to build GCC 4.9 or later, GCC will
- not support option <samp><span class="option">-mabi=ilp32</span></samp>.
  
!    <p>To enable a workaround for the Cortex-A53 erratum number 835769 by default
  (for all CPUs regardless of -mcpu option given) at configure time use the
! <samp><span class="option">--enable-fix-cortex-a53-835769</span></samp> option.  This will enable the fix by
  default and can be explicitly disabled during compilation by passing the
! <samp><span class="option">-mno-fix-cortex-a53-835769</span></samp> option.  Conversely,
! <samp><span class="option">--disable-fix-cortex-a53-835769</span></samp> will disable the workaround by
  default.  The workaround is disabled by default if neither of
! <samp><span class="option">--enable-fix-cortex-a53-835769</span></samp> or
! <samp><span class="option">--disable-fix-cortex-a53-835769</span></samp> is given at configure time.
! 
!    <p>To enable a workaround for the Cortex-A53 erratum number 843419 by default
  (for all CPUs regardless of -mcpu option given) at configure time use the
! <samp><span class="option">--enable-fix-cortex-a53-843419</span></samp> option.  This workaround is applied at
  link time.  Enabling the workaround will cause GCC to pass the relevant option
  to the linker.  It can be explicitly disabled during compilation by passing the
! <samp><span class="option">-mno-fix-cortex-a53-843419</span></samp> option.  Conversely,
! <samp><span class="option">--disable-fix-cortex-a53-843419</span></samp> will disable the workaround by default. 
  The workaround is disabled by default if neither of
! <samp><span class="option">--enable-fix-cortex-a53-843419</span></samp> or
! <samp><span class="option">--disable-fix-cortex-a53-843419</span></samp> is given at configure time.
! 
!    <p><hr /><a name="alpha_002dx_002dx"></a>
! 
! <h3 class="heading"><a name="TOC1"></a>alpha*-*-*</h3>
! 
  <p>This section contains general configuration information for all
  alpha-based platforms using ELF (in particular, ignore this section for
  DEC OSF/1, Digital UNIX and Tru64 UNIX).  In addition to reading this
  section, please read all other sections that match your target.
! 
!    <p>We require binutils 2.11.2 or newer. 
  Previous binutils releases had a number of problems with DWARF 2
  debugging information, not the least of which is incorrect linking of
  shared libraries.
! 
!    <p><hr /><a name="alpha_002ddec_002dosf51"></a>
! 
! <h3 class="heading"><a name="TOC2"></a>alpha*-dec-osf5.1</h3>
! 
  <p>Systems using processors that implement the DEC Alpha architecture and
  are running the DEC/Compaq/HP Unix (DEC OSF/1, Digital UNIX, or Compaq/HP
  Tru64 UNIX) operating system, for example the DEC Alpha AXP systems.
! 
!    <p>Support for Tru64 UNIX V5.1 has been removed in GCC 4.8.  As of GCC 4.6,
  support for Tru64 UNIX V4.0 and V5.0 has been removed.  As of GCC 3.2,
  versions before <code>alpha*-dec-osf4</code> are no longer supported.  (These
  are the versions which identify themselves as DEC OSF/1.)
  
!    <p><hr /><a name="amd64_002dx_002dsolaris210"></a>
! 
! <h3 class="heading"><a name="TOC3"></a>amd64-*-solaris2.1[0-9]*</h3>
! 
! <p>This is a synonym for &lsquo;<samp><span class="samp">x86_64-*-solaris2.1[0-9]*</span></samp>&rsquo;.
! 
!    <p><hr /><a name="arc_002dx_002delf32"></a>
! 
! <h3 class="heading"><a name="TOC4"></a>arc-*-elf32</h3>
! 
! <p>Use &lsquo;<samp><span class="samp">configure --target=arc-elf32 --with-cpu=</span><var>cpu</var><span class="samp"> --enable-languages="c,c++"</span></samp>&rsquo;
! to configure GCC, with <var>cpu</var> being one of &lsquo;<samp><span class="samp">arc600</span></samp>&rsquo;, &lsquo;<samp><span class="samp">arc601</span></samp>&rsquo;,
! or &lsquo;<samp><span class="samp">arc700</span></samp>&rsquo;.
! 
!    <p><hr /><a name="arc_002dlinux_002duclibc"></a>
! 
! <h3 class="heading"><a name="TOC5"></a>arc-linux-uclibc</h3>
! 
! <p>Use &lsquo;<samp><span class="samp">configure --target=arc-linux-uclibc --with-cpu=arc700 --enable-languages="c,c++"</span></samp>&rsquo; to configure GCC.
! 
!    <p><hr /><a name="arm_002dx_002deabi"></a>
! 
! <h3 class="heading"><a name="TOC6"></a>arm-*-eabi</h3>
  
  <p>ARM-family processors.  Subtargets that use the ELF object format
  require GNU binutils 2.13 or newer.  Such subtargets include:
  <code>arm-*-netbsdelf</code>, <code>arm-*-*linux-*</code>
  and <code>arm-*-rtemseabi</code>.
! 
!    <p><hr /><a name="avr"></a>
! 
! <h3 class="heading"><a name="TOC7"></a>avr</h3>
! 
  <p>ATMEL AVR-family micro controllers.  These are used in embedded
! applications.  There are no standard Unix configurations. 
  See &ldquo;AVR Options&rdquo; in the main manual
  for the list of supported MCU types.
! 
!    <p>Use &lsquo;<samp><span class="samp">configure --target=avr --enable-languages="c"</span></samp>&rsquo; to configure GCC.
! 
!    <p>Further installation notes and other useful information about AVR tools
  can also be obtained from:
  
!      <ul>
! <li><a href="http://www.nongnu.org/avr/">http://www.nongnu.org/avr/</a>
! <li><a href="http://www.amelek.gda.pl/avr/">http://www.amelek.gda.pl/avr/</a>
! </ul>
! 
!    <p>We <em>strongly</em> recommend using binutils 2.13 or newer.
! 
!    <p>The following error:
! <pre class="smallexample">     Error: register required
! </pre>
!    <p>indicates that you should upgrade to a newer version of the binutils.
! 
!    <p><hr /><a name="bfin"></a>
! 
! <h3 class="heading"><a name="TOC8"></a>Blackfin</h3>
  
! <p>The Blackfin processor, an Analog Devices DSP. 
  See &ldquo;Blackfin Options&rdquo; in the main manual
! 
!    <p>More information, and a version of binutils with support for this processor,
  is available at <a href="http://blackfin.uclinux.org">http://blackfin.uclinux.org</a>
! 
!    <p><hr /><a name="cr16"></a>
! 
! <h3 class="heading"><a name="TOC9"></a>CR16</h3>
! 
  <p>The CR16 CompactRISC architecture is a 16-bit architecture. This
  architecture is used in embedded applications.
  
!    <p>See &ldquo;CR16 Options&rdquo; in the main manual for a list of CR16-specific options.
! 
!    <p>Use &lsquo;<samp><span class="samp">configure --target=cr16-elf --enable-languages=c,c++</span></samp>&rsquo; to configure
! GCC for building a CR16 elf cross-compiler.
! 
!    <p>Use &lsquo;<samp><span class="samp">configure --target=cr16-uclinux --enable-languages=c,c++</span></samp>&rsquo; to
! configure GCC for building a CR16 uclinux cross-compiler.
! 
!    <p><hr /><a name="cris"></a>
! 
! <h3 class="heading"><a name="TOC10"></a>CRIS</h3>
! 
  <p>CRIS is the CPU architecture in Axis Communications ETRAX system-on-a-chip
  series.  These are used in embedded applications.
! 
!    <p>See &ldquo;CRIS Options&rdquo; in the main manual
  for a list of CRIS-specific options.
! 
!    <p>There are a few different CRIS targets:
!      <dl>
! <dt><code>cris-axis-elf</code><dd>Mainly for monolithic embedded systems.  Includes a multilib for the
! &lsquo;<samp><span class="samp">v10</span></samp>&rsquo; core used in &lsquo;<samp><span class="samp">ETRAX 100 LX</span></samp>&rsquo;. 
! <br><dt><code>cris-axis-linux-gnu</code><dd>A GNU/Linux port for the CRIS architecture, currently targeting
! &lsquo;<samp><span class="samp">ETRAX 100 LX</span></samp>&rsquo; by default. 
  </dl>
  
!    <p>For <code>cris-axis-elf</code> you need binutils 2.11
  or newer.  For <code>cris-axis-linux-gnu</code> you need binutils 2.12 or newer.
! 
!    <p>Pre-packaged tools can be obtained from
  <a href="ftp://ftp.axis.com/pub/axis/tools/cris/compiler-kit/">ftp://ftp.axis.com/pub/axis/tools/cris/compiler-kit/</a>.  More
  information about this platform is available at
  <a href="http://developer.axis.com/">http://developer.axis.com/</a>.
! 
!    <p><hr /><a name="dos"></a>
! 
! <h3 class="heading"><a name="TOC11"></a>DOS</h3>
! 
  <p>Please have a look at the <a href="binaries.html">binaries page</a>.
! 
!    <p>You cannot install GCC by itself on MSDOS; it will not compile under
  any MSDOS compiler except itself.  You need to get the complete
  compilation package DJGPP, which includes binaries as well as sources,
  and includes all the necessary compilation tools and libraries.
! 
!    <p><hr /><a name="epiphany_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC12"></a>epiphany-*-elf</h3>
! 
! <p>Adapteva Epiphany. 
  This configuration is intended for embedded systems.
! 
!    <p><hr /><a name="x_002dx_002dfreebsd"></a>
! 
! <h3 class="heading"><a name="TOC13"></a>*-*-freebsd*</h3>
! 
  <p>Support for FreeBSD 1 was discontinued in GCC 3.2.  Support for
  FreeBSD 2 (and any mutant a.out variants of FreeBSD 3) was
  discontinued in GCC 4.0.
! 
!    <p>In order to better utilize FreeBSD base system functionality and match
  the configuration of the system compiler, GCC 4.5 and above as well as
  GCC 4.4 past 2010-06-20 leverage SSP support in libc (which is present
  on FreeBSD 7 or later) and the use of <code>__cxa_atexit</code> by default
  (on FreeBSD 6 or later).  The use of <code>dl_iterate_phdr</code> inside
! <samp><span class="file">libgcc_s.so.1</span></samp> and boehm-gc (on FreeBSD 7 or later) is enabled
  by GCC 4.5 and above.
! 
!    <p>We support FreeBSD using the ELF file format with DWARF 2 debugging
! for all CPU architectures.  You may use <samp><span class="option">-gstabs</span></samp> instead of
! <samp><span class="option">-g</span></samp>, if you really want the old debugging format.  There are
  no known issues with mixing object files and libraries with different
  debugging formats.  Otherwise, this release of GCC should now match
  more of the configuration used in the stock FreeBSD configuration of
! GCC.  In particular, <samp><span class="option">--enable-threads</span></samp> is now configured by
  default.  However, as a general user, do not attempt to replace the
  system compiler with this release.  Known to bootstrap and check with
  good results on FreeBSD 7.2-STABLE.  In the past, known to bootstrap
  and check with good results on FreeBSD 3.0, 3.4, 4.0, 4.2, 4.3, 4.4,
  4.5, 4.8, 4.9 and 5-CURRENT.
! 
!    <p>The version of binutils installed in <samp><span class="file">/usr/bin</span></samp> probably works
  with this release of GCC.  Bootstrapping against the latest GNU
! binutils and/or the version found in <samp><span class="file">/usr/ports/devel/binutils</span></samp> has
  been known to enable additional features and improve overall testsuite
  results.  However, it is currently known that boehm-gc (which itself
  is required for java) may not configure properly on FreeBSD prior to
  the FreeBSD 7.0 release with GNU binutils after 2.16.1.
! 
!    <p><hr /><a name="h8300_002dhms"></a>
! 
! <h3 class="heading"><a name="TOC14"></a>h8300-hms</h3>
! 
  <p>Renesas H8/300 series of processors.
! 
!    <p>Please have a look at the <a href="binaries.html">binaries page</a>.
! 
!    <p>The calling convention and structure layout has changed in release 2.6. 
  All code must be recompiled.  The calling convention now passes the
  first three arguments in function calls in registers.  Structures are no
  longer a multiple of 2 bytes.
! 
!    <p><hr /><a name="hppa_002dhp_002dhpux"></a>
! 
! <h3 class="heading"><a name="TOC15"></a>hppa*-hp-hpux*</h3>
! 
  <p>Support for HP-UX version 9 and older was discontinued in GCC 3.4.
! 
!    <p>We require using gas/binutils on all hppa platforms.  Version 2.19 or
  later is recommended.
! 
!    <p>It may be helpful to configure GCC with the
! <a href="./configure.html#with-gnu-as"><samp><span class="option">--with-gnu-as</span></samp></a> and
! <samp><span class="option">--with-as=...</span></samp> options to ensure that GCC can find GAS.
! 
!    <p>The HP assembler should not be used with GCC.  It is rarely tested and may
! not work.  It shouldn't be used with any languages other than C due to its
  many limitations.
! 
!    <p>Specifically, <samp><span class="option">-g</span></samp> does not work (HP-UX uses a peculiar debugging
  format which GCC does not know about).  It also inserts timestamps
  into each object file it creates, causing the 3-stage comparison test to
  fail during a bootstrap.  You should be able to continue by saying
! &lsquo;<samp><span class="samp">make all-host all-target</span></samp>&rsquo; after getting the failure from &lsquo;<samp><span class="samp">make</span></samp>&rsquo;.
! 
!    <p>Various GCC features are not supported.  For example, it does not support weak
  symbols or alias definitions.  As a result, explicit template instantiations
  are required when using C++.  This makes it difficult if not impossible to
  build many C++ applications.
! 
!    <p>There are two default scheduling models for instructions.  These are
  PROCESSOR_7100LC and PROCESSOR_8000.  They are selected from the pa-risc
! architecture specified for the target machine when configuring. 
  PROCESSOR_8000 is the default.  PROCESSOR_7100LC is selected when
! the target is a &lsquo;<samp><span class="samp">hppa1*</span></samp>&rsquo; machine.
! 
!    <p>The PROCESSOR_8000 model is not well suited to older processors.  Thus,
  it is important to completely specify the machine architecture when
  configuring if you want a model other than PROCESSOR_8000.  The macro
  TARGET_SCHED_DEFAULT can be defined in BOOT_CFLAGS if a different
  default scheduling model is desired.
! 
!    <p>As of GCC 4.0, GCC uses the UNIX 95 namespace for HP-UX 10.10
! through 11.00, and the UNIX 98 namespace for HP-UX 11.11 and later. 
  This namespace change might cause problems when bootstrapping with
  an earlier version of GCC or the HP compiler as essentially the same
  namespace is required for an entire build.  This problem can be avoided
! in a number of ways.  With HP cc, <samp><span class="env">UNIX_STD</span></samp> can be set to &lsquo;<samp><span class="samp">95</span></samp>&rsquo;
! or &lsquo;<samp><span class="samp">98</span></samp>&rsquo;.  Another way is to add an appropriate set of predefines
! to <samp><span class="env">CC</span></samp>.  The description for the <samp><span class="option">munix=</span></samp> option contains
  a list of the predefines used with each standard.
! 
!    <p>More specific information to &lsquo;<samp><span class="samp">hppa*-hp-hpux*</span></samp>&rsquo; targets follows.
! 
!    <p><hr /><a name="hppa_002dhp_002dhpux10"></a>
! 
! <h3 class="heading"><a name="TOC16"></a>hppa*-hp-hpux10</h3>
! 
  <p>For hpux10.20, we <em>highly</em> recommend you pick up the latest sed patch
  <code>PHCO_19798</code> from HP.
! 
!    <p>The C++ ABI has changed incompatibly in GCC 4.0.  COMDAT subspaces are
  used for one-only code and data.  This resolves many of the previous
  problems in using C++ on this target.  However, the ABI is not compatible
  with the one implemented under HP-UX 11 using secondary definitions.
! 
!    <p><hr /><a name="hppa_002dhp_002dhpux11"></a>
! 
! <h3 class="heading"><a name="TOC17"></a>hppa*-hp-hpux11</h3>
! 
  <p>GCC 3.0 and up support HP-UX 11.  GCC 2.95.x is not supported and cannot
  be used to compile GCC 3.0 and up.
! 
!    <p>The libffi and libjava libraries haven't been ported to 64-bit HP-UX and don't build.
! 
!    <p>Refer to <a href="binaries.html">binaries</a> for information about obtaining
  precompiled GCC binaries for HP-UX.  Precompiled binaries must be obtained
! to build the Ada language as it can't be bootstrapped using C.  Ada is
  only available for the 32-bit PA-RISC runtime.
! 
!    <p>Starting with GCC 3.4 an ISO C compiler is required to bootstrap.  The
! bundled compiler supports only traditional C; you will need either HP's
  unbundled compiler, or a binary distribution of GCC.
! 
!    <p>It is possible to build GCC 3.3 starting with the bundled HP compiler,
  but the process requires several steps.  GCC 3.3 can then be used to
  build later versions.  The fastjar program contains ISO C code and
! can't be built with the HP bundled compiler.  This problem can be
  avoided by not building the Java language.  For example, use the
! <samp><span class="option">--enable-languages="c,c++,f77,objc"</span></samp> option in your configure
  command.
! 
!    <p>There are several possible approaches to building the distribution. 
  Binutils can be built first using the HP tools.  Then, the GCC
  distribution can be built.  The second approach is to build GCC
! first using the HP tools, then build binutils, then rebuild GCC. 
  There have been problems with various binary distributions, so it
  is best not to start from a binary distribution.
! 
!    <p>On 64-bit capable systems, there are two distinct targets.  Different
  installation prefixes must be used if both are to be installed on
! the same system.  The &lsquo;<samp><span class="samp">hppa[1-2]*-hp-hpux11*</span></samp>&rsquo; target generates code
! for the 32-bit PA-RISC runtime architecture and uses the HP linker. 
! The &lsquo;<samp><span class="samp">hppa64-hp-hpux11*</span></samp>&rsquo; target generates 64-bit code for the
  PA-RISC 2.0 architecture.
! 
!    <p>The script config.guess now selects the target type based on the compiler
! detected during configuration.  You must define <samp><span class="env">PATH</span></samp> or <samp><span class="env">CC</span></samp> so
! that configure finds an appropriate compiler for the initial bootstrap. 
! When <samp><span class="env">CC</span></samp> is used, the definition should contain the options that are
! needed whenever <samp><span class="env">CC</span></samp> is used.
! 
!    <p>Specifically, options that determine the runtime architecture must be
! in <samp><span class="env">CC</span></samp> to correctly select the target for the build.  It is also
! convenient to place many other compiler options in <samp><span class="env">CC</span></samp>.  For example,
! <samp><span class="env">CC="cc -Ac +DA2.0W -Wp,-H16376 -D_CLASSIC_TYPES -D_HPUX_SOURCE"</span></samp>
  can be used to bootstrap the GCC 3.3 branch with the HP compiler in
! 64-bit K&amp;R/bundled mode.  The <samp><span class="option">+DA2.0W</span></samp> option will result in
! the automatic selection of the &lsquo;<samp><span class="samp">hppa64-hp-hpux11*</span></samp>&rsquo; target.  The
  macro definition table of cpp needs to be increased for a successful
  build with the HP compiler.  _CLASSIC_TYPES and _HPUX_SOURCE need to
  be defined when building with the bundled compiler, or when using the
! <samp><span class="option">-Ac</span></samp> option.  These defines aren't necessary with <samp><span class="option">-Ae</span></samp>.
! 
!    <p>It is best to explicitly configure the &lsquo;<samp><span class="samp">hppa64-hp-hpux11*</span></samp>&rsquo; target
! with the <samp><span class="option">--with-ld=...</span></samp> option.  This overrides the standard
  search for ld.  The two linkers supported on this target require different
  commands.  The default linker is determined during configuration.  As a
! result, it's not possible to switch linkers in the middle of a GCC build. 
  This has been reported to sometimes occur in unified builds of binutils
  and GCC.
! 
!    <p>A recent linker patch must be installed for the correct operation of
  GCC 3.3 and later.  <code>PHSS_26559</code> and <code>PHSS_24304</code> are the
  oldest linker patches that are known to work.  They are for HP-UX
  11.00 and 11.11, respectively.  <code>PHSS_24303</code>, the companion to
! <code>PHSS_24304</code>, might be usable but it hasn't been tested.  These
  patches have been superseded.  Consult the HP patch database to obtain
  the currently recommended linker patch for your system.
! 
!    <p>The patches are necessary for the support of weak symbols on the
  32-bit port, and for the running of initializers and finalizers.  Weak
  symbols are implemented using SOM secondary definition symbols.  Prior
! to HP-UX 11, there are bugs in the linker support for secondary symbols. 
  The patches correct a problem of linker core dumps creating shared
  libraries containing secondary symbols, as well as various other
  linking issues involving secondary symbols.
! 
!    <p>GCC 3.3 uses the ELF DT_INIT_ARRAY and DT_FINI_ARRAY capabilities to
  run initializers and finalizers on the 64-bit port.  The 32-bit port
! uses the linker <samp><span class="option">+init</span></samp> and <samp><span class="option">+fini</span></samp> options for the same
  purpose.  The patches correct various problems with the +init/+fini
  options, including program core dumps.  Binutils 2.14 corrects a
! problem on the 64-bit port resulting from HP's non-standard use of
  the .init and .fini sections for array initializers and finalizers.
! 
!    <p>Although the HP and GNU linkers are both supported for the
! &lsquo;<samp><span class="samp">hppa64-hp-hpux11*</span></samp>&rsquo; target, it is strongly recommended that the
  HP linker be used for link editing on this target.
! 
!    <p>At this time, the GNU linker does not support the creation of long
! branch stubs.  As a result, it can't successfully link binaries
  containing branch offsets larger than 8 megabytes.  In addition,
  there are problems linking shared libraries, linking executables
! with <samp><span class="option">-static</span></samp>, and with dwarf2 unwind and exception support. 
! It also doesn't provide stubs for internal calls to global functions
! in shared libraries, so these calls can't be overloaded.
! 
!    <p>The HP dynamic loader does not support GNU symbol versioning, so symbol
  versioning is not supported.  It may be necessary to disable symbol
! versioning with <samp><span class="option">--disable-symvers</span></samp> when using GNU ld.
! 
!    <p>POSIX threads are the default.  The optional DCE thread library is not
! supported, so <samp><span class="option">--enable-threads=dce</span></samp> does not work.
! 
!    <p><hr /><a name="x_002dx_002dlinux_002dgnu"></a>
! 
! <h3 class="heading"><a name="TOC18"></a>*-*-linux-gnu</h3>
! 
  <p>Versions of libstdc++-v3 starting with 3.2.1 require bug fixes present
  in glibc 2.2.5 and later.  More information is available in the
  libstdc++-v3 documentation.
! 
!    <p><hr /><a name="ix86_002dx_002dlinux"></a>
! 
! <h3 class="heading"><a name="TOC19"></a>i?86-*-linux*</h3>
! 
! <p>As of GCC 3.3, binutils 2.13.1 or later is required for this platform. 
  See <a href="http://gcc.gnu.org/PR10877">bug 10877</a> for more information.
! 
!    <p>If you receive Signal 11 errors when building on GNU/Linux, then it is
  possible you have a hardware problem.  Further information on this can be
  found on <a href="http://www.bitwizard.nl/sig11/">www.bitwizard.nl</a>.
! 
!    <p><hr /><a name="ix86_002dx_002dsolaris210"></a>
! 
! <h3 class="heading"><a name="TOC20"></a>i?86-*-solaris2.10</h3>
! 
  <p>Use this for Solaris 10 or later on x86 and x86-64 systems.  Starting
! with GCC 4.7, there is also a 64-bit &lsquo;<samp><span class="samp">amd64-*-solaris2.1[0-9]*</span></samp>&rsquo; or
! &lsquo;<samp><span class="samp">x86_64-*-solaris2.1[0-9]*</span></samp>&rsquo; configuration that corresponds to
! &lsquo;<samp><span class="samp">sparcv9-sun-solaris2*</span></samp>&rsquo;.
! 
!    <p>It is recommended that you configure GCC to use the GNU assembler, in
! <samp><span class="file">/usr/sfw/bin/gas</span></samp>.  The versions included in Solaris 10, from GNU
  binutils 2.15, and Solaris 11, from GNU binutils 2.19, work fine,
  although the current version, from GNU binutils
  2.22, is known to work, too.  Recent versions of the Sun assembler in
! <samp><span class="file">/usr/ccs/bin/as</span></samp> work almost as well, though. 
! <!-- FIXME: as patch requirements? -->
! 
!    <p>For linking, the Sun linker, is preferred.  If you want to use the GNU
! linker instead, which is available in <samp><span class="file">/usr/sfw/bin/gld</span></samp>, note that
  due to a packaging bug the version in Solaris 10, from GNU binutils
  2.15, cannot be used, while the version in Solaris 11, from GNU binutils
  2.19, works, as does the latest version, from GNU binutils 2.22.
! 
!    <p>To use GNU <samp><span class="command">as</span></samp>, configure with the options
! <samp><span class="option">--with-gnu-as --with-as=/usr/sfw/bin/gas</span></samp>.  It may be necessary
! to configure with <samp><span class="option">--without-gnu-ld --with-ld=/usr/ccs/bin/ld</span></samp> to
! guarantee use of Sun <samp><span class="command">ld</span></samp>. 
! <!-- FIXME: why -without-gnu-ld -with-ld? -->
! 
!    <p><hr /><a name="ia64_002dx_002dlinux"></a>
! 
! <h3 class="heading"><a name="TOC21"></a>ia64-*-linux</h3>
! 
  <p>IA-64 processor (also known as IPF, or Itanium Processor Family)
  running GNU/Linux.
! 
!    <p>If you are using the installed system libunwind library with
! <samp><span class="option">--with-system-libunwind</span></samp>, then you must use libunwind 0.98 or
  later.
! 
!    <p>None of the following versions of GCC has an ABI that is compatible
  with any of the other versions in this list, with the exception that
  Red Hat 2.96 and Trillian 000171 are compatible with each other:
! 3.1, 3.0.2, 3.0.1, 3.0, Red Hat 2.96, and Trillian 000717. 
! This primarily affects C++ programs and programs that create shared libraries. 
! GCC 3.1 or later is recommended for compiling linux, the kernel. 
  As of version 3.1 GCC is believed to be fully ABI compliant, and hence no
  more major ABI changes are expected.
! 
!    <p><hr /><a name="ia64_002dx_002dhpux"></a>
! 
! <h3 class="heading"><a name="TOC22"></a>ia64-*-hpux*</h3>
! 
  <p>Building GCC on this target requires the GNU Assembler.  The bundled HP
  assembler will not work.  To prevent GCC from using the wrong assembler,
! the option <samp><span class="option">--with-gnu-as</span></samp> may be necessary.
! 
!    <p>The GCC libunwind library has not been ported to HPUX.  This means that for
! GCC versions 3.2.3 and earlier, <samp><span class="option">--enable-libunwind-exceptions</span></samp>
! is required to build GCC.  For GCC 3.3 and later, this is the default. 
! For gcc 3.4.3 and later, <samp><span class="option">--enable-libunwind-exceptions</span></samp> is
  removed and the system libunwind library will always be used.
! 
!    <p><hr />
! <!-- rs6000-ibm-aix*, powerpc-ibm-aix* --><a name="x_002dibm_002daix"></a>
! 
! <h3 class="heading"><a name="TOC23"></a>*-ibm-aix*</h3>
! 
! <p>Support for AIX version 3 and older was discontinued in GCC 3.4. 
  Support for AIX version 4.2 and older was discontinued in GCC 4.5.
! 
!    <p>&ldquo;out of memory&rdquo; bootstrap failures may indicate a problem with
  process resource limits (ulimit).  Hard limits are configured in the
! <samp><span class="file">/etc/security/limits</span></samp> system configuration file.
! 
!    <p>GCC can bootstrap with recent versions of IBM XLC, but bootstrapping
  with an earlier release of GCC is recommended.  Bootstrapping with XLC
  requires a larger data segment, which can be enabled through the
  <var>LDR_CNTRL</var> environment variable, e.g.,
  
! <pre class="smallexample">     % LDR_CNTRL=MAXDATA=0x50000000
!      % export LDR_CNTRL
! </pre>
!    <p>One can start with a pre-compiled version of GCC to build from
! sources.  One may delete GCC's &ldquo;fixed&rdquo; header files when starting
  with a version of GCC built for an earlier release of AIX.
  
!    <p>To speed up the configuration phases of bootstrapping and installing GCC,
! one may use GNU Bash instead of AIX <samp><span class="command">/bin/sh</span></samp>, e.g.,
! 
! <pre class="smallexample">     % CONFIG_SHELL=/opt/freeware/bin/bash
!      % export CONFIG_SHELL
! </pre>
!    <p>and then proceed as described in <a href="build.html">the build instructions</a>, where we strongly recommend specifying an absolute path
  to invoke <var>srcdir</var>/configure.
! 
!    <p>Because GCC on AIX is built as a 32-bit executable by default,
  (although it can generate 64-bit programs) the GMP and MPFR libraries
  required by gfortran must be 32-bit libraries.  Building GMP and MPFR
  as static archive libraries works better than shared libraries.
! 
!    <p>Errors involving <code>alloca</code> when building GCC generally are due
  to an incorrect definition of <code>CC</code> in the Makefile or mixing files
  compiled with the native C compiler and GCC.  During the stage1 phase of
! the build, the native AIX compiler <strong>must</strong> be invoked as <samp><span class="command">cc</span></samp>
! (not <samp><span class="command">xlc</span></samp>).  Once <samp><span class="command">configure</span></samp> has been informed of
! <samp><span class="command">xlc</span></samp>, one needs to use &lsquo;<samp><span class="samp">make distclean</span></samp>&rsquo; to remove the
! configure cache files and ensure that <samp><span class="env">CC</span></samp> environment variable
! does not provide a definition that will confuse <samp><span class="command">configure</span></samp>. 
  If this error occurs during stage2 or later, then the problem most likely
  is the version of Make (see above).
! 
!    <p>The native <samp><span class="command">as</span></samp> and <samp><span class="command">ld</span></samp> are recommended for
  bootstrapping on AIX.  The GNU Assembler, GNU Linker, and GNU
  Binutils version 2.20 is the minimum level that supports bootstrap on
! AIX 5.  The GNU Assembler has not been updated to support AIX 6 or
  AIX 7.  The native AIX tools do interoperate with GCC.
! 
!    <p>AIX 5.3 TL10, AIX 6.1 TL05 and AIX 7.1 TL00 introduced an AIX
  assembler change that sometimes produces corrupt assembly files
  causing AIX linker errors.  The bug breaks GCC bootstrap on AIX and
  can cause compilation failures with existing GCC installations.  An
--- 1,713 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
  
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
  
  
  
  
  
  
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <a name="index-Specific"></a>
! <a name="index-Specific-installation-notes"></a>
! <a name="index-Target-specific-installation"></a>
! <a name="index-Host-specific-installation"></a>
! <a name="index-Target-specific-installation-notes"></a>
! 
! <p>Please read this document carefully <em>before</em> installing the
! GNU Compiler Collection on your machine.
! </p>
! <p>Note that this list of install notes is <em>not</em> a list of supported
! hosts or targets.  Not all supported hosts and targets are listed
! here, only the ones that require host-specific or target-specific
! information have to. 
! </p>
! <ul>
! <li> <a href="#aarch64-x-x">aarch64*-*-*</a>
! </li><li> <a href="#alpha-x-x">alpha*-*-*</a>
! </li><li> <a href="#alpha-dec-osf51">alpha*-dec-osf5.1</a>
! </li><li> <a href="#amd64-x-solaris210">amd64-*-solaris2.10</a>
! </li><li> <a href="#arm-x-eabi">arm-*-eabi</a>
! </li><li> <a href="#avr">avr</a>
! </li><li> <a href="#bfin">Blackfin</a>
! </li><li> <a href="#dos">DOS</a>
! </li><li> <a href="#x-x-freebsd">*-*-freebsd*</a>
! </li><li> <a href="#h8300-hms">h8300-hms</a>
! </li><li> <a href="#hppa-hp-hpux">hppa*-hp-hpux*</a>
! </li><li> <a href="#hppa-hp-hpux10">hppa*-hp-hpux10</a>
! </li><li> <a href="#hppa-hp-hpux11">hppa*-hp-hpux11</a>
! </li><li> <a href="#x-x-linux-gnu">*-*-linux-gnu</a>
! </li><li> <a href="#ix86-x-linux">i?86-*-linux*</a>
! </li><li> <a href="#ix86-x-solaris210">i?86-*-solaris2.10</a>
! </li><li> <a href="#ia64-x-linux">ia64-*-linux</a>
! </li><li> <a href="#ia64-x-hpux">ia64-*-hpux*</a>
! </li><li> <a href="#x-ibm-aix">*-ibm-aix*</a>
! </li><li> <a href="#iq2000-x-elf">iq2000-*-elf</a>
! </li><li> <a href="#lm32-x-elf">lm32-*-elf</a>
! </li><li> <a href="#lm32-x-uclinux">lm32-*-uclinux</a>
! </li><li> <a href="#m32c-x-elf">m32c-*-elf</a>
! </li><li> <a href="#m32r-x-elf">m32r-*-elf</a>
! </li><li> <a href="#m68k-x-x">m68k-*-*</a>
! </li><li> <a href="#m68k-uclinux">m68k-uclinux</a>
! </li><li> <a href="#mep-x-elf">mep-*-elf</a>
! </li><li> <a href="#microblaze-x-elf">microblaze-*-elf</a>
! </li><li> <a href="#mips-x-x">mips-*-*</a>
! </li><li> <a href="#mips-sgi-irix5">mips-sgi-irix5</a>
! </li><li> <a href="#mips-sgi-irix6">mips-sgi-irix6</a>
! </li><li> <a href="#nds32le-x-elf">nds32le-*-elf</a>
! </li><li> <a href="#nds32be-x-elf">nds32be-*-elf</a>
! </li><li> <a href="#nvptx-x-none">nvptx-*-none</a>
! </li><li> <a href="#powerpc-x-x">powerpc*-*-*</a>
! </li><li> <a href="#powerpc-x-darwin">powerpc-*-darwin*</a>
! </li><li> <a href="#powerpc-x-elf">powerpc-*-elf</a>
! </li><li> <a href="#powerpc-x-linux-gnu">powerpc*-*-linux-gnu*</a>
! </li><li> <a href="#powerpc-x-netbsd">powerpc-*-netbsd*</a>
! </li><li> <a href="#powerpc-x-eabisim">powerpc-*-eabisim</a>
! </li><li> <a href="#powerpc-x-eabi">powerpc-*-eabi</a>
! </li><li> <a href="#powerpcle-x-elf">powerpcle-*-elf</a>
! </li><li> <a href="#powerpcle-x-eabisim">powerpcle-*-eabisim</a>
! </li><li> <a href="#powerpcle-x-eabi">powerpcle-*-eabi</a>
! </li><li> <a href="#s390-x-linux">s390-*-linux*</a>
! </li><li> <a href="#s390x-x-linux">s390x-*-linux*</a>
! </li><li> <a href="#s390x-ibm-tpf">s390x-ibm-tpf*</a>
! </li><li> <a href="#x-x-solaris2">*-*-solaris2*</a>
! </li><li> <a href="#sparc-x-x">sparc*-*-*</a>
! </li><li> <a href="#sparc-sun-solaris2">sparc-sun-solaris2*</a>
! </li><li> <a href="#sparc-sun-solaris210">sparc-sun-solaris2.10</a>
! </li><li> <a href="#sparc-x-linux">sparc-*-linux*</a>
! </li><li> <a href="#sparc64-x-solaris2">sparc64-*-solaris2*</a>
! </li><li> <a href="#sparcv9-x-solaris2">sparcv9-*-solaris2*</a>
! </li><li> <a href="#c6x-x-x">c6x-*-*</a>
! </li><li> <a href="#tilegx-x-linux">tilegx-*-linux*</a>
! </li><li> <a href="#tilegxbe-x-linux">tilegxbe-*-linux*</a>
! </li><li> <a href="#tilepro-x-linux">tilepro-*-linux*</a>
! </li><li> <a href="#visium-x-elf">visium-*-elf</a>
! </li><li> <a href="#x-x-vxworks">*-*-vxworks*</a>
! </li><li> <a href="#x86-64-x-x">x86_64-*-*, amd64-*-*</a>
! </li><li> <a href="#x86-64-x-solaris210">x86_64-*-solaris2.1[0-9]*</a>
! </li><li> <a href="#xtensa-x-elf">xtensa*-*-elf</a>
! </li><li> <a href="#xtensa-x-linux">xtensa*-*-linux*</a>
! </li><li> <a href="#windows">Microsoft Windows</a>
! </li><li> <a href="#x-x-cygwin">*-*-cygwin</a>
! </li><li> <a href="#x-x-interix">*-*-interix</a>
! </li><li> <a href="#x-x-mingw32">*-*-mingw32</a>
! </li><li> <a href="#os2">OS/2</a>
! </li><li> <a href="#older">Older systems</a>
! </li></ul>
! 
! <ul>
! <li> <a href="#elf">all ELF targets</a> (SVR4, Solaris 2, etc.)
! </li></ul>
! 
! 
! <!-- -------- host/target specific issues start here ---------------- -->
! <hr />
! <a name="aarch64_002dx_002dx"></a><a name="aarch64_002a_002d_002a_002d_002a"></a>
! <h3 class="heading">aarch64*-*-*</h3>
! <p>Binutils pre 2.24 does not have support for selecting <samp>-mabi</samp> and
! does not support ILP32.  If it is used to build GCC 4.9 or later, GCC will
! not support option <samp>-mabi=ilp32</samp>.
! </p>
! <p>To enable a workaround for the Cortex-A53 erratum number 835769 by default
  (for all CPUs regardless of -mcpu option given) at configure time use the
! <samp>--enable-fix-cortex-a53-835769</samp> option.  This will enable the fix by
  default and can be explicitly disabled during compilation by passing the
! <samp>-mno-fix-cortex-a53-835769</samp> option.  Conversely,
! <samp>--disable-fix-cortex-a53-835769</samp> will disable the workaround by
  default.  The workaround is disabled by default if neither of
! <samp>--enable-fix-cortex-a53-835769</samp> or
! <samp>--disable-fix-cortex-a53-835769</samp> is given at configure time.
! </p>
! <p>To enable a workaround for the Cortex-A53 erratum number 843419 by default
  (for all CPUs regardless of -mcpu option given) at configure time use the
! <samp>--enable-fix-cortex-a53-843419</samp> option.  This workaround is applied at
  link time.  Enabling the workaround will cause GCC to pass the relevant option
  to the linker.  It can be explicitly disabled during compilation by passing the
! <samp>-mno-fix-cortex-a53-843419</samp> option.  Conversely,
! <samp>--disable-fix-cortex-a53-843419</samp> will disable the workaround by default.
  The workaround is disabled by default if neither of
! <samp>--enable-fix-cortex-a53-843419</samp> or
! <samp>--disable-fix-cortex-a53-843419</samp> is given at configure time.
! </p>
! <hr />
! <a name="alpha_002dx_002dx"></a><a name="alpha_002a_002d_002a_002d_002a"></a>
! <h3 class="heading">alpha*-*-*</h3>
  <p>This section contains general configuration information for all
  alpha-based platforms using ELF (in particular, ignore this section for
  DEC OSF/1, Digital UNIX and Tru64 UNIX).  In addition to reading this
  section, please read all other sections that match your target.
! </p>
! <p>We require binutils 2.11.2 or newer.
  Previous binutils releases had a number of problems with DWARF 2
  debugging information, not the least of which is incorrect linking of
  shared libraries.
! </p>
! <hr />
! <a name="alpha_002ddec_002dosf51"></a><a name="alpha_002a_002ddec_002dosf5_002e1"></a>
! <h3 class="heading">alpha*-dec-osf5.1</h3>
  <p>Systems using processors that implement the DEC Alpha architecture and
  are running the DEC/Compaq/HP Unix (DEC OSF/1, Digital UNIX, or Compaq/HP
  Tru64 UNIX) operating system, for example the DEC Alpha AXP systems.
! </p>
! <p>Support for Tru64 UNIX V5.1 has been removed in GCC 4.8.  As of GCC 4.6,
  support for Tru64 UNIX V4.0 and V5.0 has been removed.  As of GCC 3.2,
  versions before <code>alpha*-dec-osf4</code> are no longer supported.  (These
  are the versions which identify themselves as DEC OSF/1.)
+ </p>
+ <hr />
+ <a name="amd64_002dx_002dsolaris210"></a><a name="amd64_002d_002a_002dsolaris2_002e1_005b0_002d9_005d_002a"></a>
+ <h3 class="heading">amd64-*-solaris2.1[0-9]*</h3>
+ <p>This is a synonym for &lsquo;<samp>x86_64-*-solaris2.1[0-9]*</samp>&rsquo;.
+ </p>
+ <hr />
+ <a name="arc_002dx_002delf32"></a><a name="arc_002d_002a_002delf32"></a>
+ <h3 class="heading">arc-*-elf32</h3>
  
! <p>Use &lsquo;<samp>configure --target=arc-elf32 --with-cpu=<var>cpu</var> --enable-languages=&quot;c,c++&quot;</samp>&rsquo;
! to configure GCC, with <var>cpu</var> being one of &lsquo;<samp>arc600</samp>&rsquo;, &lsquo;<samp>arc601</samp>&rsquo;,
! or &lsquo;<samp>arc700</samp>&rsquo;.
! </p>
! <hr />
! <a name="arc_002dlinux_002duclibc"></a><a name="arc_002dlinux_002duclibc-1"></a>
! <h3 class="heading">arc-linux-uclibc</h3>
  
+ <p>Use &lsquo;<samp>configure --target=arc-linux-uclibc --with-cpu=arc700 --enable-languages=&quot;c,c++&quot;</samp>&rsquo; to configure GCC.
+ </p>
+ <hr />
+ <a name="arm_002dx_002deabi"></a><a name="arm_002d_002a_002deabi"></a>
+ <h3 class="heading">arm-*-eabi</h3>
  <p>ARM-family processors.  Subtargets that use the ELF object format
  require GNU binutils 2.13 or newer.  Such subtargets include:
  <code>arm-*-netbsdelf</code>, <code>arm-*-*linux-*</code>
  and <code>arm-*-rtemseabi</code>.
! </p>
! <hr />
! <a name="avr"></a><a name="avr-1"></a>
! <h3 class="heading">avr</h3>
  <p>ATMEL AVR-family micro controllers.  These are used in embedded
! applications.  There are no standard Unix configurations.
  See &ldquo;AVR Options&rdquo; in the main manual
  for the list of supported MCU types.
! </p>
! <p>Use &lsquo;<samp>configure --target=avr --enable-languages=&quot;c&quot;</samp>&rsquo; to configure GCC.
! </p>
! <p>Further installation notes and other useful information about AVR tools
  can also be obtained from:
+ </p>
+ <ul>
+ <li> <a href="http://www.nongnu.org/avr/">http://www.nongnu.org/avr/</a>
+ </li><li> <a href="http://www.amelek.gda.pl/avr/">http://www.amelek.gda.pl/avr/</a>
+ </li></ul>
  
! <p>We <em>strongly</em> recommend using binutils 2.13 or newer.
! </p>
! <p>The following error:
! </p><div class="smallexample">
! <pre class="smallexample">Error: register required
! </pre></div>
  
! <p>indicates that you should upgrade to a newer version of the binutils.
! </p>
! <hr />
! <a name="bfin"></a><a name="Blackfin"></a>
! <h3 class="heading">Blackfin</h3>
! <p>The Blackfin processor, an Analog Devices DSP.
  See &ldquo;Blackfin Options&rdquo; in the main manual
! </p>
! <p>More information, and a version of binutils with support for this processor,
  is available at <a href="http://blackfin.uclinux.org">http://blackfin.uclinux.org</a>
! </p>
! <hr />
! <a name="cr16"></a><a name="CR16"></a>
! <h3 class="heading">CR16</h3>
  <p>The CR16 CompactRISC architecture is a 16-bit architecture. This
  architecture is used in embedded applications.
+ </p>
  
! <p>See &ldquo;CR16 Options&rdquo; in the main manual for a list of CR16-specific options.
! </p>
! <p>Use &lsquo;<samp>configure --target=cr16-elf --enable-languages=c,c++</samp>&rsquo; to configure
! GCC&nbsp;for building a CR16 elf cross-compiler.
! </p>
! <p>Use &lsquo;<samp>configure --target=cr16-uclinux --enable-languages=c,c++</samp>&rsquo; to
! configure GCC&nbsp;for building a CR16 uclinux cross-compiler.
! </p>
! <hr />
! <a name="cris"></a><a name="CRIS"></a>
! <h3 class="heading">CRIS</h3>
  <p>CRIS is the CPU architecture in Axis Communications ETRAX system-on-a-chip
  series.  These are used in embedded applications.
! </p>
! <p>See &ldquo;CRIS Options&rdquo; in the main manual
  for a list of CRIS-specific options.
! </p>
! <p>There are a few different CRIS targets:
! </p><dl compact="compact">
! <dt><code>cris-axis-elf</code></dt>
! <dd><p>Mainly for monolithic embedded systems.  Includes a multilib for the
! &lsquo;<samp>v10</samp>&rsquo; core used in &lsquo;<samp>ETRAX 100 LX</samp>&rsquo;.
! </p></dd>
! <dt><code>cris-axis-linux-gnu</code></dt>
! <dd><p>A GNU/Linux port for the CRIS architecture, currently targeting
! &lsquo;<samp>ETRAX 100 LX</samp>&rsquo; by default.
! </p></dd>
  </dl>
  
! <p>For <code>cris-axis-elf</code> you need binutils 2.11
  or newer.  For <code>cris-axis-linux-gnu</code> you need binutils 2.12 or newer.
! </p>
! <p>Pre-packaged tools can be obtained from
  <a href="ftp://ftp.axis.com/pub/axis/tools/cris/compiler-kit/">ftp://ftp.axis.com/pub/axis/tools/cris/compiler-kit/</a>.  More
  information about this platform is available at
  <a href="http://developer.axis.com/">http://developer.axis.com/</a>.
! </p>
! <hr />
! <a name="dos"></a><a name="DOS"></a>
! <h3 class="heading">DOS</h3>
  <p>Please have a look at the <a href="binaries.html">binaries page</a>.
! </p>
! <p>You cannot install GCC by itself on MSDOS; it will not compile under
  any MSDOS compiler except itself.  You need to get the complete
  compilation package DJGPP, which includes binaries as well as sources,
  and includes all the necessary compilation tools and libraries.
! </p>
! <hr />
! <a name="epiphany_002dx_002delf"></a><a name="epiphany_002d_002a_002delf"></a>
! <h3 class="heading">epiphany-*-elf</h3>
! <p>Adapteva Epiphany.
  This configuration is intended for embedded systems.
! </p>
! <hr />
! <a name="x_002dx_002dfreebsd"></a><a name="g_t_002a_002d_002a_002dfreebsd_002a"></a>
! <h3 class="heading">*-*-freebsd*</h3>
  <p>Support for FreeBSD 1 was discontinued in GCC 3.2.  Support for
  FreeBSD 2 (and any mutant a.out variants of FreeBSD 3) was
  discontinued in GCC 4.0.
! </p>
! <p>In order to better utilize FreeBSD base system functionality and match
  the configuration of the system compiler, GCC 4.5 and above as well as
  GCC 4.4 past 2010-06-20 leverage SSP support in libc (which is present
  on FreeBSD 7 or later) and the use of <code>__cxa_atexit</code> by default
  (on FreeBSD 6 or later).  The use of <code>dl_iterate_phdr</code> inside
! <samp>libgcc_s.so.1</samp> and boehm-gc (on FreeBSD 7 or later) is enabled
  by GCC 4.5 and above.
! </p>
! <p>We support FreeBSD using the ELF file format with DWARF 2 debugging
! for all CPU architectures.  You may use <samp>-gstabs</samp> instead of
! <samp>-g</samp>, if you really want the old debugging format.  There are
  no known issues with mixing object files and libraries with different
  debugging formats.  Otherwise, this release of GCC should now match
  more of the configuration used in the stock FreeBSD configuration of
! GCC.  In particular, <samp>--enable-threads</samp> is now configured by
  default.  However, as a general user, do not attempt to replace the
  system compiler with this release.  Known to bootstrap and check with
  good results on FreeBSD 7.2-STABLE.  In the past, known to bootstrap
  and check with good results on FreeBSD 3.0, 3.4, 4.0, 4.2, 4.3, 4.4,
  4.5, 4.8, 4.9 and 5-CURRENT.
! </p>
! <p>The version of binutils installed in <samp>/usr/bin</samp> probably works
  with this release of GCC.  Bootstrapping against the latest GNU
! binutils and/or the version found in <samp>/usr/ports/devel/binutils</samp> has
  been known to enable additional features and improve overall testsuite
  results.  However, it is currently known that boehm-gc (which itself
  is required for java) may not configure properly on FreeBSD prior to
  the FreeBSD 7.0 release with GNU binutils after 2.16.1.
! </p>
! <hr />
! <a name="h8300_002dhms"></a><a name="h8300_002dhms-1"></a>
! <h3 class="heading">h8300-hms</h3>
  <p>Renesas H8/300 series of processors.
! </p>
! <p>Please have a look at the <a href="binaries.html">binaries page</a>.
! </p>
! <p>The calling convention and structure layout has changed in release 2.6.
  All code must be recompiled.  The calling convention now passes the
  first three arguments in function calls in registers.  Structures are no
  longer a multiple of 2 bytes.
! </p>
! <hr />
! <a name="hppa_002dhp_002dhpux"></a><a name="hppa_002a_002dhp_002dhpux_002a"></a>
! <h3 class="heading">hppa*-hp-hpux*</h3>
  <p>Support for HP-UX version 9 and older was discontinued in GCC 3.4.
! </p>
! <p>We require using gas/binutils on all hppa platforms.  Version 2.19 or
  later is recommended.
! </p>
! <p>It may be helpful to configure GCC with the
! <a href="./configure.html#with-gnu-as"><samp>--with-gnu-as</samp></a> and
! <samp>--with-as=&hellip;</samp> options to ensure that GCC can find GAS.
! </p>
! <p>The HP assembler should not be used with GCC.  It is rarely tested and may
! not work.  It shouldn&rsquo;t be used with any languages other than C due to its
  many limitations.
! </p>
! <p>Specifically, <samp>-g</samp> does not work (HP-UX uses a peculiar debugging
  format which GCC does not know about).  It also inserts timestamps
  into each object file it creates, causing the 3-stage comparison test to
  fail during a bootstrap.  You should be able to continue by saying
! &lsquo;<samp>make all-host all-target</samp>&rsquo; after getting the failure from &lsquo;<samp>make</samp>&rsquo;.
! </p>
! <p>Various GCC features are not supported.  For example, it does not support weak
  symbols or alias definitions.  As a result, explicit template instantiations
  are required when using C++.  This makes it difficult if not impossible to
  build many C++ applications.
! </p>
! <p>There are two default scheduling models for instructions.  These are
  PROCESSOR_7100LC and PROCESSOR_8000.  They are selected from the pa-risc
! architecture specified for the target machine when configuring.
  PROCESSOR_8000 is the default.  PROCESSOR_7100LC is selected when
! the target is a &lsquo;<samp>hppa1*</samp>&rsquo; machine.
! </p>
! <p>The PROCESSOR_8000 model is not well suited to older processors.  Thus,
  it is important to completely specify the machine architecture when
  configuring if you want a model other than PROCESSOR_8000.  The macro
  TARGET_SCHED_DEFAULT can be defined in BOOT_CFLAGS if a different
  default scheduling model is desired.
! </p>
! <p>As of GCC 4.0, GCC uses the UNIX 95 namespace for HP-UX 10.10
! through 11.00, and the UNIX 98 namespace for HP-UX 11.11 and later.
  This namespace change might cause problems when bootstrapping with
  an earlier version of GCC or the HP compiler as essentially the same
  namespace is required for an entire build.  This problem can be avoided
! in a number of ways.  With HP cc, <code>UNIX_STD</code> can be set to &lsquo;<samp>95</samp>&rsquo;
! or &lsquo;<samp>98</samp>&rsquo;.  Another way is to add an appropriate set of predefines
! to <code>CC</code>.  The description for the <samp>munix=</samp> option contains
  a list of the predefines used with each standard.
! </p>
! <p>More specific information to &lsquo;<samp>hppa*-hp-hpux*</samp>&rsquo; targets follows.
! </p>
! <hr />
! <a name="hppa_002dhp_002dhpux10"></a><a name="hppa_002a_002dhp_002dhpux10"></a>
! <h3 class="heading">hppa*-hp-hpux10</h3>
  <p>For hpux10.20, we <em>highly</em> recommend you pick up the latest sed patch
  <code>PHCO_19798</code> from HP.
! </p>
! <p>The C++ ABI has changed incompatibly in GCC 4.0.  COMDAT subspaces are
  used for one-only code and data.  This resolves many of the previous
  problems in using C++ on this target.  However, the ABI is not compatible
  with the one implemented under HP-UX 11 using secondary definitions.
! </p>
! <hr />
! <a name="hppa_002dhp_002dhpux11"></a><a name="hppa_002a_002dhp_002dhpux11"></a>
! <h3 class="heading">hppa*-hp-hpux11</h3>
  <p>GCC 3.0 and up support HP-UX 11.  GCC 2.95.x is not supported and cannot
  be used to compile GCC 3.0 and up.
! </p>
! <p>The libffi and libjava libraries haven&rsquo;t been ported to 64-bit HP-UX&nbsp;and don&rsquo;t build.
! </p>
! <p>Refer to <a href="binaries.html">binaries</a> for information about obtaining
  precompiled GCC binaries for HP-UX.  Precompiled binaries must be obtained
! to build the Ada language as it can&rsquo;t be bootstrapped using C.  Ada is
  only available for the 32-bit PA-RISC runtime.
! </p>
! <p>Starting with GCC 3.4 an ISO C compiler is required to bootstrap.  The
! bundled compiler supports only traditional C; you will need either HP&rsquo;s
  unbundled compiler, or a binary distribution of GCC.
! </p>
! <p>It is possible to build GCC 3.3 starting with the bundled HP compiler,
  but the process requires several steps.  GCC 3.3 can then be used to
  build later versions.  The fastjar program contains ISO C code and
! can&rsquo;t be built with the HP bundled compiler.  This problem can be
  avoided by not building the Java language.  For example, use the
! <samp>--enable-languages=&quot;c,c++,f77,objc&quot;</samp> option in your configure
  command.
! </p>
! <p>There are several possible approaches to building the distribution.
  Binutils can be built first using the HP tools.  Then, the GCC
  distribution can be built.  The second approach is to build GCC
! first using the HP tools, then build binutils, then rebuild GCC.
  There have been problems with various binary distributions, so it
  is best not to start from a binary distribution.
! </p>
! <p>On 64-bit capable systems, there are two distinct targets.  Different
  installation prefixes must be used if both are to be installed on
! the same system.  The &lsquo;<samp>hppa[1-2]*-hp-hpux11*</samp>&rsquo; target generates code
! for the 32-bit PA-RISC runtime architecture and uses the HP linker.
! The &lsquo;<samp>hppa64-hp-hpux11*</samp>&rsquo; target generates 64-bit code for the
  PA-RISC 2.0 architecture.
! </p>
! <p>The script config.guess now selects the target type based on the compiler
! detected during configuration.  You must define <code>PATH</code> or <code>CC</code> so
! that configure finds an appropriate compiler for the initial bootstrap.
! When <code>CC</code> is used, the definition should contain the options that are
! needed whenever <code>CC</code> is used.
! </p>
! <p>Specifically, options that determine the runtime architecture must be
! in <code>CC</code> to correctly select the target for the build.  It is also
! convenient to place many other compiler options in <code>CC</code>.  For example,
! <code>CC=&quot;cc -Ac +DA2.0W -Wp,-H16376 -D_CLASSIC_TYPES -D_HPUX_SOURCE&quot;</code>
  can be used to bootstrap the GCC 3.3 branch with the HP compiler in
! 64-bit K&amp;R/bundled mode.  The <samp>+DA2.0W</samp> option will result in
! the automatic selection of the &lsquo;<samp>hppa64-hp-hpux11*</samp>&rsquo; target.  The
  macro definition table of cpp needs to be increased for a successful
  build with the HP compiler.  _CLASSIC_TYPES and _HPUX_SOURCE need to
  be defined when building with the bundled compiler, or when using the
! <samp>-Ac</samp> option.  These defines aren&rsquo;t necessary with <samp>-Ae</samp>.
! </p>
! <p>It is best to explicitly configure the &lsquo;<samp>hppa64-hp-hpux11*</samp>&rsquo; target
! with the <samp>--with-ld=&hellip;</samp> option.  This overrides the standard
  search for ld.  The two linkers supported on this target require different
  commands.  The default linker is determined during configuration.  As a
! result, it&rsquo;s not possible to switch linkers in the middle of a GCC build.
  This has been reported to sometimes occur in unified builds of binutils
  and GCC.
! </p>
! <p>A recent linker patch must be installed for the correct operation of
  GCC 3.3 and later.  <code>PHSS_26559</code> and <code>PHSS_24304</code> are the
  oldest linker patches that are known to work.  They are for HP-UX
  11.00 and 11.11, respectively.  <code>PHSS_24303</code>, the companion to
! <code>PHSS_24304</code>, might be usable but it hasn&rsquo;t been tested.  These
  patches have been superseded.  Consult the HP patch database to obtain
  the currently recommended linker patch for your system.
! </p>
! <p>The patches are necessary for the support of weak symbols on the
  32-bit port, and for the running of initializers and finalizers.  Weak
  symbols are implemented using SOM secondary definition symbols.  Prior
! to HP-UX 11, there are bugs in the linker support for secondary symbols.
  The patches correct a problem of linker core dumps creating shared
  libraries containing secondary symbols, as well as various other
  linking issues involving secondary symbols.
! </p>
! <p>GCC 3.3 uses the ELF DT_INIT_ARRAY and DT_FINI_ARRAY capabilities to
  run initializers and finalizers on the 64-bit port.  The 32-bit port
! uses the linker <samp>+init</samp> and <samp>+fini</samp> options for the same
  purpose.  The patches correct various problems with the +init/+fini
  options, including program core dumps.  Binutils 2.14 corrects a
! problem on the 64-bit port resulting from HP&rsquo;s non-standard use of
  the .init and .fini sections for array initializers and finalizers.
! </p>
! <p>Although the HP and GNU linkers are both supported for the
! &lsquo;<samp>hppa64-hp-hpux11*</samp>&rsquo; target, it is strongly recommended that the
  HP linker be used for link editing on this target.
! </p>
! <p>At this time, the GNU linker does not support the creation of long
! branch stubs.  As a result, it can&rsquo;t successfully link binaries
  containing branch offsets larger than 8 megabytes.  In addition,
  there are problems linking shared libraries, linking executables
! with <samp>-static</samp>, and with dwarf2 unwind and exception support.
! It also doesn&rsquo;t provide stubs for internal calls to global functions
! in shared libraries, so these calls can&rsquo;t be overloaded.
! </p>
! <p>The HP dynamic loader does not support GNU symbol versioning, so symbol
  versioning is not supported.  It may be necessary to disable symbol
! versioning with <samp>--disable-symvers</samp> when using GNU ld.
! </p>
! <p>POSIX threads are the default.  The optional DCE thread library is not
! supported, so <samp>--enable-threads=dce</samp> does not work.
! </p>
! <hr />
! <a name="x_002dx_002dlinux_002dgnu"></a><a name="g_t_002a_002d_002a_002dlinux_002dgnu"></a>
! <h3 class="heading">*-*-linux-gnu</h3>
  <p>Versions of libstdc++-v3 starting with 3.2.1 require bug fixes present
  in glibc 2.2.5 and later.  More information is available in the
  libstdc++-v3 documentation.
! </p>
! <hr />
! <a name="ix86_002dx_002dlinux"></a><a name="i_003f86_002d_002a_002dlinux_002a"></a>
! <h3 class="heading">i?86-*-linux*</h3>
! <p>As of GCC 3.3, binutils 2.13.1 or later is required for this platform.
  See <a href="http://gcc.gnu.org/PR10877">bug 10877</a> for more information.
! </p>
! <p>If you receive Signal 11 errors when building on GNU/Linux, then it is
  possible you have a hardware problem.  Further information on this can be
  found on <a href="http://www.bitwizard.nl/sig11/">www.bitwizard.nl</a>.
! </p>
! <hr />
! <a name="ix86_002dx_002dsolaris210"></a><a name="i_003f86_002d_002a_002dsolaris2_002e10"></a>
! <h3 class="heading">i?86-*-solaris2.10</h3>
  <p>Use this for Solaris 10 or later on x86 and x86-64 systems.  Starting
! with GCC 4.7, there is also a 64-bit &lsquo;<samp>amd64-*-solaris2.1[0-9]*</samp>&rsquo; or
! &lsquo;<samp>x86_64-*-solaris2.1[0-9]*</samp>&rsquo; configuration that corresponds to
! &lsquo;<samp>sparcv9-sun-solaris2*</samp>&rsquo;.
! </p>
! <p>It is recommended that you configure GCC to use the GNU assembler, in
! <samp>/usr/sfw/bin/gas</samp>.  The versions included in Solaris 10, from GNU
  binutils 2.15, and Solaris 11, from GNU binutils 2.19, work fine,
  although the current version, from GNU binutils
  2.22, is known to work, too.  Recent versions of the Sun assembler in
! <samp>/usr/ccs/bin/as</samp> work almost as well, though.
! </p>
! <p>For linking, the Sun linker, is preferred.  If you want to use the GNU
! linker instead, which is available in <samp>/usr/sfw/bin/gld</samp>, note that
  due to a packaging bug the version in Solaris 10, from GNU binutils
  2.15, cannot be used, while the version in Solaris 11, from GNU binutils
  2.19, works, as does the latest version, from GNU binutils 2.22.
! </p>
! <p>To use GNU <code>as</code>, configure with the options
! <samp>--with-gnu-as --with-as=/usr/sfw/bin/gas</samp>.  It may be necessary
! to configure with <samp>--without-gnu-ld --with-ld=/usr/ccs/bin/ld</samp> to
! guarantee use of Sun <code>ld</code>.
! </p>
! <hr />
! <a name="ia64_002dx_002dlinux"></a><a name="ia64_002d_002a_002dlinux"></a>
! <h3 class="heading">ia64-*-linux</h3>
  <p>IA-64 processor (also known as IPF, or Itanium Processor Family)
  running GNU/Linux.
! </p>
! <p>If you are using the installed system libunwind library with
! <samp>--with-system-libunwind</samp>, then you must use libunwind 0.98 or
  later.
! </p>
! <p>None of the following versions of GCC has an ABI that is compatible
  with any of the other versions in this list, with the exception that
  Red Hat 2.96 and Trillian 000171 are compatible with each other:
! 3.1, 3.0.2, 3.0.1, 3.0, Red Hat 2.96, and Trillian 000717.
! This primarily affects C++ programs and programs that create shared libraries.
! GCC 3.1 or later is recommended for compiling linux, the kernel.
  As of version 3.1 GCC is believed to be fully ABI compliant, and hence no
  more major ABI changes are expected.
! </p>
! <hr />
! <a name="ia64_002dx_002dhpux"></a><a name="ia64_002d_002a_002dhpux_002a"></a>
! <h3 class="heading">ia64-*-hpux*</h3>
  <p>Building GCC on this target requires the GNU Assembler.  The bundled HP
  assembler will not work.  To prevent GCC from using the wrong assembler,
! the option <samp>--with-gnu-as</samp> may be necessary.
! </p>
! <p>The GCC libunwind library has not been ported to HPUX.  This means that for
! GCC versions 3.2.3 and earlier, <samp>--enable-libunwind-exceptions</samp>
! is required to build GCC.  For GCC 3.3 and later, this is the default.
! For gcc 3.4.3 and later, <samp>--enable-libunwind-exceptions</samp> is
  removed and the system libunwind library will always be used.
! </p>
! <hr />
! <!-- rs6000-ibm-aix*, powerpc-ibm-aix* -->
! <a name="x_002dibm_002daix"></a><a name="g_t_002a_002dibm_002daix_002a"></a>
! <h3 class="heading">*-ibm-aix*</h3>
! <p>Support for AIX version 3 and older was discontinued in GCC 3.4.
  Support for AIX version 4.2 and older was discontinued in GCC 4.5.
! </p>
! <p>&ldquo;out of memory&rdquo; bootstrap failures may indicate a problem with
  process resource limits (ulimit).  Hard limits are configured in the
! <samp>/etc/security/limits</samp> system configuration file.
! </p>
! <p>GCC can bootstrap with recent versions of IBM XLC, but bootstrapping
  with an earlier release of GCC is recommended.  Bootstrapping with XLC
  requires a larger data segment, which can be enabled through the
  <var>LDR_CNTRL</var> environment variable, e.g.,
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">% LDR_CNTRL=MAXDATA=0x50000000
+ % export LDR_CNTRL
+ </pre></div>
  
! <p>One can start with a pre-compiled version of GCC to build from
! sources.  One may delete GCC&rsquo;s &ldquo;fixed&rdquo; header files when starting
  with a version of GCC built for an earlier release of AIX.
+ </p>
+ <p>To speed up the configuration phases of bootstrapping and installing GCC,
+ one may use GNU Bash instead of AIX <code>/bin/sh</code>, e.g.,
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">% CONFIG_SHELL=/opt/freeware/bin/bash
+ % export CONFIG_SHELL
+ </pre></div>
  
! <p>and then proceed as described in <a href="build.html">the build
! instructions</a>, where we strongly recommend specifying an absolute path
  to invoke <var>srcdir</var>/configure.
! </p>
! <p>Because GCC on AIX is built as a 32-bit executable by default,
  (although it can generate 64-bit programs) the GMP and MPFR libraries
  required by gfortran must be 32-bit libraries.  Building GMP and MPFR
  as static archive libraries works better than shared libraries.
! </p>
! <p>Errors involving <code>alloca</code> when building GCC generally are due
  to an incorrect definition of <code>CC</code> in the Makefile or mixing files
  compiled with the native C compiler and GCC.  During the stage1 phase of
! the build, the native AIX compiler <strong>must</strong> be invoked as <code>cc</code>
! (not <code>xlc</code>).  Once <code>configure</code> has been informed of
! <code>xlc</code>, one needs to use &lsquo;<samp>make distclean</samp>&rsquo; to remove the
! configure cache files and ensure that <code>CC</code> environment variable
! does not provide a definition that will confuse <code>configure</code>.
  If this error occurs during stage2 or later, then the problem most likely
  is the version of Make (see above).
! </p>
! <p>The native <code>as</code> and <code>ld</code> are recommended for
  bootstrapping on AIX.  The GNU Assembler, GNU Linker, and GNU
  Binutils version 2.20 is the minimum level that supports bootstrap on
! AIX 5.  The GNU Assembler has not been updated to support AIX 6&nbsp;or
  AIX 7.  The native AIX tools do interoperate with GCC.
! </p>
! <p>AIX 5.3 TL10, AIX 6.1 TL05 and AIX 7.1 TL00 introduced an AIX
  assembler change that sometimes produces corrupt assembly files
  causing AIX linker errors.  The bug breaks GCC bootstrap on AIX and
  can cause compilation failures with existing GCC installations.  An
*************** AIX iFix for AIX 5.3 is available (APAR
*** 675,1510 ****
  IZ98477 for AIX 5.3 TL11 and IZ98134 for AIX 5.3 TL12). AIX 5.3 TL11 SP8,
  AIX 5.3 TL12 SP5, AIX 6.1 TL04 SP11, AIX 6.1 TL05 SP7, AIX 6.1 TL06 SP6,
  AIX 6.1 TL07 and AIX 7.1 TL01 should include the fix.
! 
!    <p>Building <samp><span class="file">libstdc++.a</span></samp> requires a fix for an AIX Assembler bug
  APAR IY26685 (AIX 4.3) or APAR IY25528 (AIX 5.1).  It also requires a
  fix for another AIX Assembler bug and a co-dependent AIX Archiver fix
  referenced as APAR IY53606 (AIX 5.2) or as APAR IY54774 (AIX 5.1)
! 
!    <p><a name="TransferAixShobj"></a>&lsquo;<samp><span class="samp">libstdc++</span></samp>&rsquo; in GCC 3.4 increments the major version number of the
! shared object and GCC installation places the <samp><span class="file">libstdc++.a</span></samp>
  shared library in a common location which will overwrite the and GCC
  3.3 version of the shared library.  Applications either need to be
  re-linked against the new shared library or the GCC 3.1 and GCC 3.3
! versions of the &lsquo;<samp><span class="samp">libstdc++</span></samp>&rsquo; shared object needs to be available
! to the AIX runtime loader.  The GCC 3.1 &lsquo;<samp><span class="samp">libstdc++.so.4</span></samp>&rsquo;, if
! present, and GCC 3.3 &lsquo;<samp><span class="samp">libstdc++.so.5</span></samp>&rsquo; shared objects can be
  installed for runtime dynamic loading using the following steps to set
! the &lsquo;<samp><span class="samp">F_LOADONLY</span></samp>&rsquo; flag in the shared object for <em>each</em>
! multilib <samp><span class="file">libstdc++.a</span></samp> installed:
  
!    <p>Extract the shared objects from the currently installed
! <samp><span class="file">libstdc++.a</span></samp> archive:
! <pre class="smallexample">     % ar -x libstdc++.a libstdc++.so.4 libstdc++.so.5
! </pre>
!    <p>Enable the &lsquo;<samp><span class="samp">F_LOADONLY</span></samp>&rsquo; flag so that the shared object will be
  available for runtime dynamic loading, but not linking:
! <pre class="smallexample">     % strip -e libstdc++.so.4 libstdc++.so.5
! </pre>
!    <p>Archive the runtime-only shared object in the GCC 3.4
! <samp><span class="file">libstdc++.a</span></samp> archive:
! <pre class="smallexample">     % ar -q libstdc++.a libstdc++.so.4 libstdc++.so.5
! </pre>
!    <p>Eventually, the
! <a href="./configure.html#WithAixSoname"><samp><span class="option">--with-aix-soname=svr4</span></samp></a>
  configure option may drop the need for this procedure for libraries that
  support it.
! 
!    <p>Linking executables and shared libraries may produce warnings of
  duplicate symbols.  The assembly files generated by GCC for AIX always
  have included multiple symbol definitions for certain global variable
  and function declarations in the original program.  The warnings should
  not prevent the linker from producing a correct library or runnable
  executable.
! 
!    <p>AIX 4.3 utilizes a &ldquo;large format&rdquo; archive to support both 32-bit and
  64-bit object modules.  The routines provided in AIX 4.3.0 and AIX 4.3.1
! to parse archive libraries did not handle the new format correctly. 
  These routines are used by GCC and result in error messages during
  linking such as &ldquo;not a COFF file&rdquo;.  The version of the routines shipped
! with AIX 4.3.1 should work for a 32-bit environment.  The <samp><span class="option">-g</span></samp>
  option of the archive command may be used to create archives of 32-bit
  objects using the original &ldquo;small format&rdquo;.  A correct version of the
  routines is shipped with AIX 4.3.2 and above.
! 
!    <p>Some versions of the AIX binder (linker) can fail with a relocation
! overflow severe error when the <samp><span class="option">-bbigtoc</span></samp> option is used to link
  GCC-produced object files into an executable that overflows the TOC.  A fix
  for APAR IX75823 (OVERFLOW DURING LINK WHEN USING GCC AND -BBIGTOC) is
  available from IBM Customer Support and from its
  <a href="http://techsupport.services.ibm.com/">techsupport.services.ibm.com</a>
  website as PTF U455193.
! 
!    <p>The AIX 4.3.2.1 linker (bos.rte.bind_cmds Level 4.3.2.1) will dump core
  with a segmentation fault when invoked by any version of GCC.  A fix for
  APAR IX87327 is available from IBM Customer Support and from its
  <a href="http://techsupport.services.ibm.com/">techsupport.services.ibm.com</a>
  website as PTF U461879.  This fix is incorporated in AIX 4.3.3 and above.
! 
!    <p>The initial assembler shipped with AIX 4.3.0 generates incorrect object
  files.  A fix for APAR IX74254 (64BIT DISASSEMBLED OUTPUT FROM COMPILER FAILS
  TO ASSEMBLE/BIND) is available from IBM Customer Support and from its
  <a href="http://techsupport.services.ibm.com/">techsupport.services.ibm.com</a>
  website as PTF U453956.  This fix is incorporated in AIX 4.3.1 and above.
! 
!    <p>AIX provides National Language Support (NLS).  Compilers and assemblers
  use NLS to support locale-specific representations of various data
! formats including floating-point numbers (e.g., &lsquo;<samp><span class="samp">.</span></samp>&rsquo;  vs &lsquo;<samp><span class="samp">,</span></samp>&rsquo; for
  separating decimal fractions).  There have been problems reported where
  GCC does not produce the same floating-point formats that the assembler
! expects.  If one encounters this problem, set the <samp><span class="env">LANG</span></samp>
! environment variable to &lsquo;<samp><span class="samp">C</span></samp>&rsquo; or &lsquo;<samp><span class="samp">En_US</span></samp>&rsquo;.
! 
!    <p>A default can be specified with the <samp><span class="option">-mcpu=</span><var>cpu_type</var></samp>
! switch and using the configure option <samp><span class="option">--with-cpu-</span><var>cpu_type</var></samp>.
! 
!    <p><hr /><a name="iq2000_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC24"></a>iq2000-*-elf</h3>
! 
  <p>Vitesse IQ2000 processors.  These are used in embedded
  applications.  There are no standard Unix configurations.
! 
!    <p><hr /><a name="lm32_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC25"></a>lm32-*-elf</h3>
! 
! <p>Lattice Mico32 processor. 
  This configuration is intended for embedded systems.
! 
!    <p><hr /><a name="lm32_002dx_002duclinux"></a>
! 
! <h3 class="heading"><a name="TOC26"></a>lm32-*-uclinux</h3>
! 
! <p>Lattice Mico32 processor. 
  This configuration is intended for embedded systems running uClinux.
! 
!    <p><hr /><a name="m32c_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC27"></a>m32c-*-elf</h3>
! 
! <p>Renesas M32C processor. 
  This configuration is intended for embedded systems.
! 
!    <p><hr /><a name="m32r_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC28"></a>m32r-*-elf</h3>
! 
! <p>Renesas M32R processor. 
  This configuration is intended for embedded systems.
! 
!    <p><hr /><a name="m68k_002dx_002dx"></a>
! 
! <h3 class="heading"><a name="TOC29"></a>m68k-*-*</h3>
! 
  <p>By default,
! &lsquo;<samp><span class="samp">m68k-*-elf*</span></samp>&rsquo;, &lsquo;<samp><span class="samp">m68k-*-rtems</span></samp>&rsquo;,  &lsquo;<samp><span class="samp">m68k-*-uclinux</span></samp>&rsquo; and
! &lsquo;<samp><span class="samp">m68k-*-linux</span></samp>&rsquo;
  build libraries for both M680x0 and ColdFire processors.  If you only
  need the M680x0 libraries, you can omit the ColdFire ones by passing
! <samp><span class="option">--with-arch=m68k</span></samp> to <samp><span class="command">configure</span></samp>.  Alternatively, you
! can omit the M680x0 libraries by passing <samp><span class="option">--with-arch=cf</span></samp> to
! <samp><span class="command">configure</span></samp>.  These targets default to 5206 or 5475 code as
  appropriate for the target system when
! configured with <samp><span class="option">--with-arch=cf</span></samp> and 68020 code otherwise.
! 
!    <p>The &lsquo;<samp><span class="samp">m68k-*-netbsd</span></samp>&rsquo; and
! &lsquo;<samp><span class="samp">m68k-*-openbsd</span></samp>&rsquo; targets also support the <samp><span class="option">--with-arch</span></samp>
  option.  They will generate ColdFire CFV4e code when configured with
! <samp><span class="option">--with-arch=cf</span></samp> and 68020 code otherwise.
! 
!    <p>You can override the default processors listed above by configuring
! with <samp><span class="option">--with-cpu=</span><var>target</var></samp>.  This <var>target</var> can either
! be a <samp><span class="option">-mcpu</span></samp> argument or one of the following values:
! &lsquo;<samp><span class="samp">m68000</span></samp>&rsquo;, &lsquo;<samp><span class="samp">m68010</span></samp>&rsquo;, &lsquo;<samp><span class="samp">m68020</span></samp>&rsquo;, &lsquo;<samp><span class="samp">m68030</span></samp>&rsquo;,
! &lsquo;<samp><span class="samp">m68040</span></samp>&rsquo;, &lsquo;<samp><span class="samp">m68060</span></samp>&rsquo;, &lsquo;<samp><span class="samp">m68020-40</span></samp>&rsquo; and &lsquo;<samp><span class="samp">m68020-60</span></samp>&rsquo;.
! 
!    <p>GCC requires at least binutils version 2.17 on these targets.
! 
!    <p><hr /><a name="m68k_002dx_002duclinux"></a>
! 
! <h3 class="heading"><a name="TOC30"></a>m68k-*-uclinux</h3>
! 
  <p>GCC 4.3 changed the uClinux configuration so that it uses the
! &lsquo;<samp><span class="samp">m68k-linux-gnu</span></samp>&rsquo; ABI rather than the &lsquo;<samp><span class="samp">m68k-elf</span></samp>&rsquo; ABI. 
  It also added improved support for C++ and flat shared libraries,
  both of which were ABI changes.
! 
!    <p><hr /><a name="mep_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC31"></a>mep-*-elf</h3>
! 
! <p>Toshiba Media embedded Processor. 
  This configuration is intended for embedded systems.
! 
!    <p><hr /><a name="microblaze_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC32"></a>microblaze-*-elf</h3>
! 
! <p>Xilinx MicroBlaze processor. 
  This configuration is intended for embedded systems.
! 
!    <p><hr /><a name="mips_002dx_002dx"></a>
! 
! <h3 class="heading"><a name="TOC33"></a>mips-*-*</h3>
! 
  <p>If on a MIPS system you get an error message saying &ldquo;does not have gp
! sections for all it's [sic] sectons [sic]&rdquo;, don't worry about it.  This
  happens whenever you use GAS with the MIPS linker, but there is not
  really anything wrong, and it is okay to use the output file.  You can
  stop such warnings by installing the GNU linker.
! 
!    <p>It would be nice to extend GAS to produce the gp tables, but they are
  optional, and there should not be a warning about their absence.
! 
!    <p>The libstdc++ atomic locking routines for MIPS targets requires MIPS II
  and later.  A patch went in just after the GCC 3.3 release to
! make &lsquo;<samp><span class="samp">mips*-*-*</span></samp>&rsquo; use the generic implementation instead.  You can also
! configure for &lsquo;<samp><span class="samp">mipsel-elf</span></samp>&rsquo; as a workaround.  The
! &lsquo;<samp><span class="samp">mips*-*-linux*</span></samp>&rsquo; target continues to use the MIPS II routines.  More
  work on this is expected in future releases.
  
! <!-- If you make -with-llsc the default for another target, please also -->
! <!-- update the description of the -with-llsc option. -->
!    <p>The built-in <code>__sync_*</code> functions are available on MIPS II and
! later systems and others that support the &lsquo;<samp><span class="samp">ll</span></samp>&rsquo;, &lsquo;<samp><span class="samp">sc</span></samp>&rsquo; and
! &lsquo;<samp><span class="samp">sync</span></samp>&rsquo; instructions.  This can be overridden by passing
! <samp><span class="option">--with-llsc</span></samp> or <samp><span class="option">--without-llsc</span></samp> when configuring GCC. 
  Since the Linux kernel emulates these instructions if they are
! missing, the default for &lsquo;<samp><span class="samp">mips*-*-linux*</span></samp>&rsquo; targets is
! <samp><span class="option">--with-llsc</span></samp>.  The <samp><span class="option">--with-llsc</span></samp> and
! <samp><span class="option">--without-llsc</span></samp> configure options may be overridden at compile
! time by passing the <samp><span class="option">-mllsc</span></samp> or <samp><span class="option">-mno-llsc</span></samp> options to
  the compiler.
! 
!    <p>MIPS systems check for division by zero (unless
! <samp><span class="option">-mno-check-zero-division</span></samp> is passed to the compiler) by
  generating either a conditional trap or a break instruction.  Using
  trap results in smaller code, but is only supported on MIPS II and
  later.  Also, some versions of the Linux kernel have a bug that
  prevents trap from generating the proper signal (<code>SIGFPE</code>).  To enable
! the use of break, use the <samp><span class="option">--with-divide=breaks</span></samp>
! <samp><span class="command">configure</span></samp> option when configuring GCC.  The default is to
  use traps on systems that support them.
! 
!    <p>The assembler from GNU binutils 2.17 and earlier has a bug in the way
  it sorts relocations for REL targets (o32, o64, EABI).  This can cause
  bad code to be generated for simple C++ programs.  Also the linker
  from GNU binutils versions prior to 2.17 has a bug which causes the
! runtime linker stubs in very large programs, like <samp><span class="file">libgcj.so</span></samp>, to
  be incorrectly generated.  GNU Binutils 2.18 and later (and snapshots
  made after Nov. 9, 2006) should be free from both of these problems.
! 
!    <p><hr /><a name="mips_002dsgi_002dirix5"></a>
! 
! <h3 class="heading"><a name="TOC34"></a>mips-sgi-irix5</h3>
! 
  <p>Support for IRIX 5 has been removed in GCC 4.6.
! 
!    <p><hr /><a name="mips_002dsgi_002dirix6"></a>
! 
! <h3 class="heading"><a name="TOC35"></a>mips-sgi-irix6</h3>
! 
  <p>Support for IRIX 6.5 has been removed in GCC 4.8.  Support for IRIX 6
  releases before 6.5 has been removed in GCC 4.6, as well as support for
  the O32 ABI.
! 
!    <p><hr /><a name="moxie_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC36"></a>moxie-*-elf</h3>
! 
  <p>The moxie processor.
! 
!    <p><hr /><a name="msp430_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC37"></a>msp430-*-elf</h3>
! 
! <p>TI MSP430 processor. 
  This configuration is intended for embedded systems.
! 
!    <p><hr /><a name="nds32le_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC38"></a>nds32le-*-elf</h3>
! 
  <p>Andes NDS32 target in little endian mode.
! 
!    <p><hr /><a name="nds32be_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC39"></a>nds32be-*-elf</h3>
! 
  <p>Andes NDS32 target in big endian mode.
! 
!    <p><hr /><a name="nvptx_002dx_002dnone"></a>
! 
! <h3 class="heading"><a name="TOC40"></a>nvptx-*-none</h3>
! 
  <p>Nvidia PTX target.
! 
!    <p>Instead of GNU binutils, you will need to install
! <a href="https://github.com/MentorEmbedded/nvptx-tools/">nvptx-tools</a>. 
  Tell GCC where to find it:
! <samp><span class="option">--with-build-time-tools=[install-nvptx-tools]/nvptx-none/bin</span></samp>.
! 
!    <p>A nvptx port of newlib is available at
! <a href="https://github.com/MentorEmbedded/nvptx-newlib/">nvptx-newlib</a>. 
  It can be automatically built together with GCC.  For this, add a
! symbolic link to nvptx-newlib's <samp><span class="file">newlib</span></samp> directory to the
  directory containing the GCC sources.
! 
!    <p>Use the <samp><span class="option">--disable-sjlj-exceptions</span></samp> and
! <samp><span class="option">--enable-newlib-io-long-long</span></samp> options when configuring.
! 
!    <p><hr /><a name="powerpc_002dx_002dx"></a>
! 
! <h3 class="heading"><a name="TOC41"></a>powerpc-*-*</h3>
! 
! <p>You can specify a default version for the <samp><span class="option">-mcpu=</span><var>cpu_type</var></samp>
! switch by using the configure option <samp><span class="option">--with-cpu-</span><var>cpu_type</var></samp>.
! 
!    <p>You will need
  <a href="ftp://ftp.kernel.org/pub/linux/devel/binutils">binutils 2.15</a>
  or newer for a working GCC.
! 
!    <p><hr /><a name="powerpc_002dx_002ddarwin"></a>
! 
! <h3 class="heading"><a name="TOC42"></a>powerpc-*-darwin*</h3>
! 
  <p>PowerPC running Darwin (Mac OS X kernel).
! 
!    <p>Pre-installed versions of Mac OS X may not include any developer tools,
  meaning that you will not be able to build GCC from source.  Tool
  binaries are available at
  <a href="http://opensource.apple.com/">http://opensource.apple.com/</a>.
! 
!    <p>This version of GCC requires at least cctools-590.36.  The
  cctools-590.36 package referenced from
  <a href="http://gcc.gnu.org/ml/gcc/2006-03/msg00507.html">http://gcc.gnu.org/ml/gcc/2006-03/msg00507.html</a> will not work
  on systems older than 10.3.9 (aka darwin7.9.0).
! 
!    <p><hr /><a name="powerpc_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC43"></a>powerpc-*-elf</h3>
! 
  <p>PowerPC system in big endian mode, running System V.4.
! 
!    <p><hr /><a name="powerpc_002dx_002dlinux_002dgnu"></a>
! 
! <h3 class="heading"><a name="TOC44"></a>powerpc*-*-linux-gnu*</h3>
! 
  <p>PowerPC system in big endian mode running Linux.
! 
!    <p><hr /><a name="powerpc_002dx_002dnetbsd"></a>
! 
! <h3 class="heading"><a name="TOC45"></a>powerpc-*-netbsd*</h3>
! 
  <p>PowerPC system in big endian mode running NetBSD.
! 
!    <p><hr /><a name="powerpc_002dx_002deabisim"></a>
! 
! <h3 class="heading"><a name="TOC46"></a>powerpc-*-eabisim</h3>
! 
  <p>Embedded PowerPC system in big endian mode for use in running under the
  PSIM simulator.
! 
!    <p><hr /><a name="powerpc_002dx_002deabi"></a>
! 
! <h3 class="heading"><a name="TOC47"></a>powerpc-*-eabi</h3>
! 
  <p>Embedded PowerPC system in big endian mode.
! 
!    <p><hr /><a name="powerpcle_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC48"></a>powerpcle-*-elf</h3>
! 
  <p>PowerPC system in little endian mode, running System V.4.
! 
!    <p><hr /><a name="powerpcle_002dx_002deabisim"></a>
! 
! <h3 class="heading"><a name="TOC49"></a>powerpcle-*-eabisim</h3>
! 
  <p>Embedded PowerPC system in little endian mode for use in running under
  the PSIM simulator.
! 
!    <p><hr /><a name="powerpcle_002dx_002deabi"></a>
! 
! <h3 class="heading"><a name="TOC50"></a>powerpcle-*-eabi</h3>
! 
  <p>Embedded PowerPC system in little endian mode.
! 
!    <p><hr /><a name="rl78_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC51"></a>rl78-*-elf</h3>
! 
! <p>The Renesas RL78 processor. 
  This configuration is intended for embedded systems.
! 
!    <p><hr /><a name="rx_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC52"></a>rx-*-elf</h3>
! 
  <p>The Renesas RX processor.  See
  <a href="http://eu.renesas.com/fmwk.jsp?cnt=rx600_series_landing.jsp&amp;fp=/products/mpumcu/rx_family/rx600_series">http://eu.renesas.com/fmwk.jsp?cnt=rx600_series_landing.jsp&amp;fp=/products/mpumcu/rx_family/rx600_series</a>
  for more information about this processor.
! 
!    <p><hr /><a name="s390_002dx_002dlinux"></a>
! 
! <h3 class="heading"><a name="TOC53"></a>s390-*-linux*</h3>
! 
  <p>S/390 system running GNU/Linux for S/390.
! 
!    <p><hr /><a name="s390x_002dx_002dlinux"></a>
! 
! <h3 class="heading"><a name="TOC54"></a>s390x-*-linux*</h3>
! 
  <p>zSeries system (64-bit) running GNU/Linux for zSeries.
! 
!    <p><hr /><a name="s390x_002dibm_002dtpf"></a>
! 
! <h3 class="heading"><a name="TOC55"></a>s390x-ibm-tpf*</h3>
! 
  <p>zSeries system (64-bit) running TPF.  This platform is
  supported as cross-compilation target only.
! 
!    <p><hr /><!-- Please use Solaris 2 to refer to all release of Solaris, starting -->
! <!-- with 2.0 until 2.6, 7, 8, etc.  Solaris 1 was a marketing name for -->
! <!-- SunOS 4 releases which we don't use to avoid confusion.  Solaris -->
! <!-- alone is too unspecific and must be avoided. -->
! <a name="x_002dx_002dsolaris2"></a>
! 
! <h3 class="heading"><a name="TOC56"></a>*-*-solaris2*</h3>
! 
! <p>Support for Solaris 9 has been removed in GCC 4.10.  Support for Solaris
  8 has been removed in GCC 4.8.  Support for Solaris 7 has been removed
  in GCC 4.6.
! 
!    <p>Sun does not ship a C compiler with Solaris 2 before Solaris 10, though
  you can download the Sun Studio compilers for free.  In Solaris 10 and
! 11, GCC 3.4.3 is available as <samp><span class="command">/usr/sfw/bin/gcc</span></samp>.  Solaris 11
! also provides GCC 4.5.2 as <samp><span class="command">/usr/gcc/4.5/bin/gcc</span></samp>.  Alternatively,
  you can install a pre-built GCC to bootstrap and install GCC.  See the
  <a href="binaries.html">binaries page</a> for details.
! 
!    <p>The Solaris 2 <samp><span class="command">/bin/sh</span></samp> will often fail to configure
! &lsquo;<samp><span class="samp">libstdc++-v3</span></samp>&rsquo;, &lsquo;<samp><span class="samp">boehm-gc</span></samp>&rsquo; or &lsquo;<samp><span class="samp">libjava</span></samp>&rsquo;.  We therefore
  recommend using the following initial sequence of commands
  
! <pre class="smallexample">     % CONFIG_SHELL=/bin/ksh
!      % export CONFIG_SHELL
! </pre>
!    <p class="noindent">and proceed as described in <a href="configure.html">the configure instructions</a>. 
  In addition we strongly recommend specifying an absolute path to invoke
! <samp><var>srcdir</var><span class="command">/configure</span></samp>.
! 
!    <p>Solaris 2 comes with a number of optional OS packages.  Some of these
  are needed to use GCC fully, namely <code>SUNWarc</code>,
  <code>SUNWbtool</code>, <code>SUNWesu</code>, <code>SUNWhea</code>, <code>SUNWlibm</code>,
  <code>SUNWsprot</code>, and <code>SUNWtoo</code>.  If you did not install all
  optional packages when installing Solaris 2, you will need to verify that
  the packages that GCC needs are installed.
! 
!    <p>To check whether an optional package is installed, use
! the <samp><span class="command">pkginfo</span></samp> command.  To add an optional package, use the
! <samp><span class="command">pkgadd</span></samp> command.  For further details, see the Solaris 2
  documentation.
! 
!    <p>Trying to use the linker and other tools in
! <samp><span class="file">/usr/ucb</span></samp> to install GCC has been observed to cause trouble. 
  For example, the linker may hang indefinitely.  The fix is to remove
! <samp><span class="file">/usr/ucb</span></samp> from your <samp><span class="env">PATH</span></samp>.
! 
!    <p>The build process works more smoothly with the legacy Sun tools so, if you
! have <samp><span class="file">/usr/xpg4/bin</span></samp> in your <samp><span class="env">PATH</span></samp>, we recommend that you place
! <samp><span class="file">/usr/bin</span></samp> before <samp><span class="file">/usr/xpg4/bin</span></samp> for the duration of the build.
! 
!    <p>We recommend the use of the Sun assembler or the GNU assembler, in
! conjunction with the Sun linker.  The GNU <samp><span class="command">as</span></samp>
  versions included in Solaris 10, from GNU binutils 2.15, and Solaris 11,
  from GNU binutils 2.19, are known to work.  They can be found in
! <samp><span class="file">/usr/sfw/bin/gas</span></samp>.  Current versions of GNU binutils (2.22)
  are known to work as well.  Note that your mileage may vary
  if you use a combination of the GNU tools and the Sun tools: while the
! combination GNU <samp><span class="command">as</span></samp> + Sun <samp><span class="command">ld</span></samp> should reasonably work,
! the reverse combination Sun <samp><span class="command">as</span></samp> + GNU <samp><span class="command">ld</span></samp> may fail to
! build or cause memory corruption at runtime in some cases for C++ programs. 
! <!-- FIXME: still? -->
! GNU <samp><span class="command">ld</span></samp> usually works as well, although the version included in
  Solaris 10 cannot be used due to several bugs.  Again, the current
  version (2.22) is known to work, but generally lacks platform specific
! features, so better stay with Sun <samp><span class="command">ld</span></samp>.  To use the LTO linker
! plugin (<samp><span class="option">-fuse-linker-plugin</span></samp>) with GNU <samp><span class="command">ld</span></samp>, GNU
! binutils <em>must</em> be configured with <samp><span class="option">--enable-largefile</span></samp>.
! 
!    <p>To enable symbol versioning in &lsquo;<samp><span class="samp">libstdc++</span></samp>&rsquo; with Sun <samp><span class="command">ld</span></samp>,
! you need to have any version of GNU <samp><span class="command">c++filt</span></samp>, which is part of
! GNU binutils.  &lsquo;<samp><span class="samp">libstdc++</span></samp>&rsquo; symbol versioning will be disabled if no
! appropriate version is found.  Sun <samp><span class="command">c++filt</span></samp> from the Sun Studio
  compilers does <em>not</em> work.
! 
!    <p>Sun bug 4296832 turns up when compiling X11 headers with GCC 2.95 or
! newer: <samp><span class="command">g++</span></samp> will complain that types are missing.  These headers
  assume that omitting the type means <code>int</code>; this assumption worked for
  C90 but is wrong for C++, and is now wrong for C99 also.
! 
!    <p>Sun bug 4927647 sometimes causes random spurious testsuite failures
! related to missing diagnostic output.  This bug doesn't affect GCC
! itself, rather it is a kernel bug triggered by the <samp><span class="command">expect</span></samp>
  program which is used only by the GCC testsuite driver.  When the bug
! causes the <samp><span class="command">expect</span></samp> program to miss anticipated output, extra
  testsuite failures appear.
! 
!    <p><hr /><a name="sparc_002dx_002dx"></a>
! 
! <h3 class="heading"><a name="TOC57"></a>sparc*-*-*</h3>
! 
  <p>This section contains general configuration information for all
  SPARC-based platforms.  In addition to reading this section, please
  read all other sections that match your target.
! 
!    <p>Newer versions of the GNU Multiple Precision Library (GMP), the MPFR
  library and the MPC library are known to be miscompiled by earlier
  versions of GCC on these platforms.  We therefore recommend the use
  of the exact versions of these libraries listed as minimal versions
  in <a href="prerequisites.html">the prerequisites</a>.
! 
!    <p><hr /><a name="sparc_002dsun_002dsolaris2"></a>
! 
! <h3 class="heading"><a name="TOC58"></a>sparc-sun-solaris2*</h3>
! 
  <p>When GCC is configured to use GNU binutils 2.14 or later, the binaries
! produced are smaller than the ones produced using Sun's native tools;
  this difference is quite significant for binaries containing debugging
  information.
! 
!    <p>Starting with Solaris 7, the operating system is capable of executing
  64-bit SPARC V9 binaries.  GCC 3.1 and later properly supports
! this; the <samp><span class="option">-m64</span></samp> option enables 64-bit code generation. 
  However, if all you want is code tuned for the UltraSPARC CPU, you
! should try the <samp><span class="option">-mtune=ultrasparc</span></samp> option instead, which produces
  code that, unlike full 64-bit code, can still run on non-UltraSPARC
  machines.
! 
!    <p>When configuring on a Solaris 7 or later system that is running a kernel
  that supports only 32-bit binaries, one must configure with
! <samp><span class="option">--disable-multilib</span></samp>, since we will not be able to build the
  64-bit target libraries.
! 
!    <p>GCC 3.3 and GCC 3.4 trigger code generation bugs in earlier versions of
  the GNU compiler (especially GCC 3.0.x versions), which lead to the
  miscompilation of the stage1 compiler and the subsequent failure of the
  bootstrap process.  A workaround is to use GCC 3.2.3 as an intermediary
  stage, i.e. to bootstrap that compiler with the base compiler and then
  use it to bootstrap the final compiler.
! 
!    <p>GCC 3.4 triggers a code generation bug in versions 5.4 (Sun ONE Studio 7)
  and 5.5 (Sun ONE Studio 8) of the Sun compiler, which causes a bootstrap
  failure in form of a miscompilation of the stage1 compiler by the Sun
  compiler.  This is Sun bug 4974440.  This is fixed with patch 112760-07.
! 
!    <p>GCC 3.4 changed the default debugging format from Stabs to DWARF-2 for
  32-bit code on Solaris 7 and later.  If you use the Sun assembler, this
  change apparently runs afoul of Sun bug 4910101 (which is referenced as
! an x86-only problem by Sun, probably because they do not use DWARF-2). 
  A symptom of the problem is that you cannot compile C++ programs like
! <samp><span class="command">groff</span></samp> 1.19.1 without getting messages similar to the following:
! 
! <pre class="smallexample">     ld: warning: relocation error: R_SPARC_UA32: ...
!        external symbolic relocation against non-allocatable section
!        .debug_info cannot be processed at runtime: relocation ignored.
! </pre>
!    <p class="noindent">To work around this problem, compile with <samp><span class="option">-gstabs+</span></samp> instead of
! plain <samp><span class="option">-g</span></samp>.
  
!    <p>When configuring the GNU Multiple Precision Library (GMP), the MPFR
  library or the MPC library on a Solaris 7 or later system, the canonical
! target triplet must be specified as the <samp><span class="command">build</span></samp> parameter on the
! configure line.  This target triplet can be obtained by invoking <samp><span class="command">./config.guess</span></samp> in the toplevel source directory of GCC (and
  not that of GMP or MPFR or MPC).  For example on a Solaris 9 system:
  
! <pre class="smallexample">     % ./configure --build=sparc-sun-solaris2.9 --prefix=xxx
! </pre>
!    <p><hr /><a name="sparc_002dsun_002dsolaris210"></a>
! 
! <h3 class="heading"><a name="TOC59"></a>sparc-sun-solaris2.10</h3>
! 
  <p>There is a bug in older versions of the Sun assembler which breaks
  thread-local storage (TLS).  A typical error message is
  
! <pre class="smallexample">     ld: fatal: relocation error: R_SPARC_TLS_LE_HIX22: file /var/tmp//ccamPA1v.o:
!        symbol &lt;unknown&gt;: bad symbol type SECT: symbol type must be TLS
! </pre>
!    <p class="noindent">This bug is fixed in Sun patch 118683-03 or later.
! 
!    <p><hr /><a name="sparc_002dx_002dlinux"></a>
! 
! <h3 class="heading"><a name="TOC60"></a>sparc-*-linux*</h3>
  
  <p>GCC versions 3.0 and higher require binutils 2.11.2 and glibc 2.2.4
  or newer on this platform.  All earlier binutils and glibc
  releases mishandled unaligned relocations on <code>sparc-*-*</code> targets.
  
!    <p><hr /><a name="sparc64_002dx_002dsolaris2"></a>
! 
! <h3 class="heading"><a name="TOC61"></a>sparc64-*-solaris2*</h3>
! 
  <p>When configuring the GNU Multiple Precision Library (GMP), the MPFR
  library or the MPC library, the canonical target triplet must be specified
! as the <samp><span class="command">build</span></samp> parameter on the configure line.  For example
  on a Solaris 9 system:
  
! <pre class="smallexample">     % ./configure --build=sparc64-sun-solaris2.9 --prefix=xxx
! </pre>
!    <p>The following compiler flags must be specified in the configure
  step in order to bootstrap this target with the Sun compiler:
  
! <pre class="smallexample">     % CC="cc -xarch=v9 -xildoff" <var>srcdir</var>/configure [<var>options</var>] [<var>target</var>]
! </pre>
!    <p class="noindent"><samp><span class="option">-xarch=v9</span></samp> specifies the SPARC-V9 architecture to the Sun toolchain
! and <samp><span class="option">-xildoff</span></samp> turns off the incremental linker.
! 
!    <p><hr /><a name="sparcv9_002dx_002dsolaris2"></a>
! 
! <h3 class="heading"><a name="TOC62"></a>sparcv9-*-solaris2*</h3>
! 
! <p>This is a synonym for &lsquo;<samp><span class="samp">sparc64-*-solaris2*</span></samp>&rsquo;.
! 
!    <p><hr /><a name="c6x_002dx_002dx"></a>
! 
! <h3 class="heading"><a name="TOC63"></a>c6x-*-*</h3>
! 
  <p>The C6X family of processors. This port requires binutils-2.22 or newer.
! 
!    <p><hr /><a name="tilegx_002d_002a_002dlinux"></a>
! 
! <h3 class="heading"><a name="TOC64"></a>tilegx-*-linux*</h3>
! 
  <p>The TILE-Gx processor in little endian mode, running GNU/Linux.  This
  port requires binutils-2.22 or newer.
! 
!    <p><hr /><a name="tilegxbe_002d_002a_002dlinux"></a>
! 
! <h3 class="heading"><a name="TOC65"></a>tilegxbe-*-linux*</h3>
! 
  <p>The TILE-Gx processor in big endian mode, running GNU/Linux.  This
  port requires binutils-2.23 or newer.
! 
!    <p><hr /><a name="tilepro_002d_002a_002dlinux"></a>
! 
! <h3 class="heading"><a name="TOC66"></a>tilepro-*-linux*</h3>
! 
  <p>The TILEPro processor running GNU/Linux.  This port requires
  binutils-2.22 or newer.
! 
!    <p><hr /><a name="visium_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC67"></a>visium-*-elf</h3>
! 
! <p>CDS VISIUMcore processor. 
  This configuration is intended for embedded systems.
! 
!    <p><hr /><a name="x_002dx_002dvxworks"></a>
! 
! <h3 class="heading"><a name="TOC68"></a>*-*-vxworks*</h3>
! 
  <p>Support for VxWorks is in flux.  At present GCC supports <em>only</em> the
! very recent VxWorks 5.5 (aka Tornado 2.2) release, and only on PowerPC. 
! We welcome patches for other architectures supported by VxWorks 5.5. 
  Support for VxWorks AE would also be welcome; we believe this is merely
  a matter of writing an appropriate &ldquo;configlette&rdquo; (see below).  We are
  not interested in supporting older, a.out or COFF-based, versions of
  VxWorks in GCC 3.
! 
!    <p>VxWorks comes with an older version of GCC installed in
! <samp><var>$WIND_BASE</var><span class="file">/host</span></samp>; we recommend you do not overwrite it. 
! Choose an installation <var>prefix</var> entirely outside <var>$WIND_BASE</var>. 
! Before running <samp><span class="command">configure</span></samp>, create the directories <samp><var>prefix</var></samp>
! and <samp><var>prefix</var><span class="file">/bin</span></samp>.  Link or copy the appropriate assembler,
! linker, etc. into <samp><var>prefix</var><span class="file">/bin</span></samp>, and set your <var>PATH</var> to
! include that directory while running both <samp><span class="command">configure</span></samp> and
! <samp><span class="command">make</span></samp>.
! 
!    <p>You must give <samp><span class="command">configure</span></samp> the
! <samp><span class="option">--with-headers=</span><var>$WIND_BASE</var><span class="option">/target/h</span></samp> switch so that it can
  find the VxWorks system headers.  Since VxWorks is a cross compilation
! target only, you must also specify <samp><span class="option">--target=</span><var>target</var></samp>. 
! <samp><span class="command">configure</span></samp> will attempt to create the directory
! <samp><var>prefix</var><span class="file">/</span><var>target</var><span class="file">/sys-include</span></samp> and copy files into it;
! make sure the user running <samp><span class="command">configure</span></samp> has sufficient privilege
  to do so.
! 
!    <p>GCC's exception handling runtime requires a special &ldquo;configlette&rdquo;
! module, <samp><span class="file">contrib/gthr_supp_vxw_5x.c</span></samp>.  Follow the instructions in
  that file to add the module to your kernel build.  (Future versions of
  VxWorks will incorporate this module.)
! 
!    <p><hr /><a name="x86_002d64_002dx_002dx"></a>
! 
! <h3 class="heading"><a name="TOC69"></a>x86_64-*-*, amd64-*-*</h3>
! 
  <p>GCC supports the x86-64 architecture implemented by the AMD64 processor
! (amd64-*-* is an alias for x86_64-*-*) on GNU/Linux, FreeBSD and NetBSD. 
  On GNU/Linux the default is a bi-arch compiler which is able to generate
! both 64-bit x86-64 and 32-bit x86 code (via the <samp><span class="option">-m32</span></samp> switch).
! 
!    <p><hr /><a name="x86_002d64_002dx_002dsolaris210"></a>
! 
! <h3 class="heading"><a name="TOC70"></a>x86_64-*-solaris2.1[0-9]*</h3>
! 
  <p>GCC also supports the x86-64 architecture implemented by the AMD64
! processor (&lsquo;<samp><span class="samp">amd64-*-*</span></samp>&rsquo; is an alias for &lsquo;<samp><span class="samp">x86_64-*-*</span></samp>&rsquo;) on
  Solaris 10 or later.  Unlike other systems, without special options a
  bi-arch compiler is built which generates 32-bit code by default, but
! can generate 64-bit x86-64 code with the <samp><span class="option">-m64</span></samp> switch.  Since
  GCC 4.7, there is also configuration that defaults to 64-bit code, but
! can generate 32-bit code with <samp><span class="option">-m32</span></samp>.  To configure and build
! this way, you have to provide all support libraries like <samp><span class="file">libgmp</span></samp>
! as 64-bit code, configure with <samp><span class="option">--target=x86_64-pc-solaris2.1x</span></samp>
! and &lsquo;<samp><span class="samp">CC=gcc -m64</span></samp>&rsquo;.
! 
!    <p><hr /><a name="xtensa_002dx_002delf"></a>
! 
! <h3 class="heading"><a name="TOC71"></a>xtensa*-*-elf</h3>
! 
  <p>This target is intended for embedded Xtensa systems using the
! &lsquo;<samp><span class="samp">newlib</span></samp>&rsquo; C library.  It uses ELF but does not support shared
  objects.  Designed-defined instructions specified via the
  Tensilica Instruction Extension (TIE) language are only supported
  through inline assembly.
! 
!    <p>The Xtensa configuration information must be specified prior to
! building GCC.  The <samp><span class="file">include/xtensa-config.h</span></samp> header
  file contains the configuration information.  If you created your
  own Xtensa configuration with the Xtensa Processor Generator, the
  downloaded files include a customized copy of this header file,
  which you can use to replace the default header file.
! 
!    <p><hr /><a name="xtensa_002dx_002dlinux"></a>
! 
! <h3 class="heading"><a name="TOC72"></a>xtensa*-*-linux*</h3>
! 
  <p>This target is for Xtensa systems running GNU/Linux.  It supports ELF
  shared objects and the GNU C library (glibc).  It also generates
  position-independent code (PIC) regardless of whether the
! <samp><span class="option">-fpic</span></samp> or <samp><span class="option">-fPIC</span></samp> options are used.  In other
  respects, this target is the same as the
! <a href="#xtensa*-*-elf">&lsquo;<samp><span class="samp">xtensa*-*-elf</span></samp>&rsquo;</a> target.
! 
!    <p><hr /><a name="windows"></a>
! 
! <h3 class="heading"><a name="TOC73"></a>Microsoft Windows</h3>
! 
! <h4 class="subheading"><a name="TOC74"></a>Intel 16-bit versions</h4>
  
  <p>The 16-bit versions of Microsoft Windows, such as Windows 3.1, are not
  supported.
! 
!    <p>However, the 32-bit port has limited support for Microsoft
  Windows 3.11 in the Win32s environment, as a target only.  See below.
! 
! <h4 class="subheading"><a name="TOC75"></a>Intel 32-bit versions</h4>
! 
  <p>The 32-bit versions of Windows, including Windows 95, Windows NT, Windows
  XP, and Windows Vista, are supported by several different target
  platforms.  These targets differ in which Windows subsystem they target
  and which C libraries are used.
  
!      <ul>
! <li>Cygwin <a href="#x-x-cygwin">*-*-cygwin</a>: Cygwin provides a user-space
! Linux API emulation layer in the Win32 subsystem. 
! <li>Interix <a href="#x-x-interix">*-*-interix</a>: The Interix subsystem
! provides native support for POSIX. 
! <li>MinGW <a href="#x-x-mingw32">*-*-mingw32</a>: MinGW is a native GCC port for
! the Win32 subsystem that provides a subset of POSIX. 
! <li>MKS i386-pc-mks: NuTCracker from MKS.  See
! <a href="http://www.mkssoftware.com/">http://www.mkssoftware.com/</a> for more information. 
! </ul>
! 
! <h4 class="subheading"><a name="TOC76"></a>Intel 64-bit versions</h4>
! 
  <p>GCC contains support for x86-64 using the mingw-w64
! runtime library, available from <a href="http://mingw-w64.sourceforge.net/">http://mingw-w64.sourceforge.net/</a>. 
  This library should be used with the target triple x86_64-pc-mingw32.
! 
!    <p>Presently Windows for Itanium is not supported.
! 
! <h4 class="subheading"><a name="TOC77"></a>Windows CE</h4>
! 
  <p>Windows CE is supported as a target only on Hitachi
  SuperH (sh-wince-pe), and MIPS (mips-wince-pe).
! 
! <h4 class="subheading"><a name="TOC78"></a>Other Windows Platforms</h4>
! 
  <p>GCC no longer supports Windows NT on the Alpha or PowerPC.
! 
!    <p>GCC no longer supports the Windows POSIX subsystem.  However, it does
  support the Interix subsystem.  See above.
! 
!    <p>Old target names including *-*-winnt and *-*-windowsnt are no longer used.
! 
!    <p>PW32 (i386-pc-pw32) support was never completed, and the project seems to
  be inactive.  See <a href="http://pw32.sourceforge.net/">http://pw32.sourceforge.net/</a> for more information.
! 
!    <p>UWIN support has been removed due to a lack of maintenance.
! 
!    <p><hr /><a name="x_002dx_002dcygwin"></a>
! 
! <h3 class="heading"><a name="TOC79"></a>*-*-cygwin</h3>
! 
  <p>Ports of GCC are included with the
  <a href="http://www.cygwin.com/">Cygwin environment</a>.
! 
!    <p>GCC will build under Cygwin without modification; it does not build
! with Microsoft's C++ compiler and there are no plans to make it do so.
! 
!    <p>The Cygwin native compiler can be configured to target any 32-bit x86
  cpu architecture desired; the default is i686-pc-cygwin.  It should be
  used with as up-to-date a version of binutils as possible; use either
  the latest official GNU binutils release in the Cygwin distribution,
  or version 2.20 or above if building your own.
! 
!    <p><hr /><a name="x_002dx_002dinterix"></a>
! 
! <h3 class="heading"><a name="TOC80"></a>*-*-interix</h3>
! 
  <p>The Interix target is used by OpenNT, Interix, Services For UNIX (SFU),
  and Subsystem for UNIX-based Applications (SUA).  Applications compiled
  with this target run in the Interix subsystem, which is separate from
  the Win32 subsystem.  This target was last known to work in GCC 3.3.
! 
!    <p><hr /><a name="x_002dx_002dmingw32"></a>
! 
! <h3 class="heading"><a name="TOC81"></a>*-*-mingw32</h3>
! 
! <p>GCC will build with and support only MinGW runtime 3.12 and later. 
  Earlier versions of headers are incompatible with the new default semantics
  of <code>extern inline</code> in <code>-std=c99</code> and <code>-std=gnu99</code> modes.
! 
!    <p><hr /><a name="older"></a>
! 
! <h3 class="heading"><a name="TOC82"></a>Older systems</h3>
! 
  <p>GCC contains support files for many older (1980s and early
  1990s) Unix variants.  For the most part, support for these systems
  has not been deliberately removed, but it has not been maintained for
  several years and may suffer from bitrot.
! 
!    <p>Starting with GCC 3.1, each release has a list of &ldquo;obsoleted&rdquo; systems. 
  Support for these systems is still present in that release, but
! <samp><span class="command">configure</span></samp> will fail unless the <samp><span class="option">--enable-obsolete</span></samp>
  option is given.  Unless a maintainer steps forward, support for these
  systems will be removed from the next release of GCC.
! 
!    <p>Support for old systems as hosts for GCC can cause problems if the
  workarounds for compiler, library and operating system bugs affect the
  cleanliness or maintainability of the rest of GCC.  In some cases, to
  bring GCC up on such a system, if still possible with current GCC, may
  require first installing an old version of GCC which did work on that
  system, and using it to compile a more recent GCC, to avoid bugs in the
  vendor compiler.  Old releases of GCC 1 and GCC 2 are available in the
! <samp><span class="file">old-releases</span></samp> directory on the <a href="../mirrors.html">GCC mirror sites</a>.  Header bugs may generally be avoided using
! <samp><span class="command">fixincludes</span></samp>, but bugs or deficiencies in libraries and the
  operating system may still cause problems.
! 
!    <p>Support for older systems as targets for cross-compilation is less
  problematic than support for them as hosts for GCC; if an enthusiast
  wishes to make such a target work again (including resurrecting any of
  the targets that never worked with GCC 2, starting from the last
--- 715,1515 ----
  IZ98477 for AIX 5.3 TL11 and IZ98134 for AIX 5.3 TL12). AIX 5.3 TL11 SP8,
  AIX 5.3 TL12 SP5, AIX 6.1 TL04 SP11, AIX 6.1 TL05 SP7, AIX 6.1 TL06 SP6,
  AIX 6.1 TL07 and AIX 7.1 TL01 should include the fix.
! </p>
! <p>Building <samp>libstdc++.a</samp> requires a fix for an AIX Assembler bug
  APAR IY26685 (AIX 4.3) or APAR IY25528 (AIX 5.1).  It also requires a
  fix for another AIX Assembler bug and a co-dependent AIX Archiver fix
  referenced as APAR IY53606 (AIX 5.2) or as APAR IY54774 (AIX 5.1)
! </p>
! <a name="TransferAixShobj"></a><p>&lsquo;<samp>libstdc++</samp>&rsquo; in GCC 3.4 increments the major version number of the
! shared object and GCC installation places the <samp>libstdc++.a</samp>
  shared library in a common location which will overwrite the and GCC
  3.3 version of the shared library.  Applications either need to be
  re-linked against the new shared library or the GCC 3.1 and GCC 3.3
! versions of the &lsquo;<samp>libstdc++</samp>&rsquo; shared object needs to be available
! to the AIX runtime loader.  The GCC 3.1 &lsquo;<samp>libstdc++.so.4</samp>&rsquo;, if
! present, and GCC 3.3 &lsquo;<samp>libstdc++.so.5</samp>&rsquo; shared objects can be
  installed for runtime dynamic loading using the following steps to set
! the &lsquo;<samp>F_LOADONLY</samp>&rsquo; flag in the shared object for <em>each</em>
! multilib <samp>libstdc++.a</samp> installed:
! </p>
! <p>Extract the shared objects from the currently installed
! <samp>libstdc++.a</samp> archive:
! </p><div class="smallexample">
! <pre class="smallexample">% ar -x libstdc++.a libstdc++.so.4 libstdc++.so.5
! </pre></div>
  
! <p>Enable the &lsquo;<samp>F_LOADONLY</samp>&rsquo; flag so that the shared object will be
  available for runtime dynamic loading, but not linking:
! </p><div class="smallexample">
! <pre class="smallexample">% strip -e libstdc++.so.4 libstdc++.so.5
! </pre></div>
! 
! <p>Archive the runtime-only shared object in the GCC 3.4
! <samp>libstdc++.a</samp> archive:
! </p><div class="smallexample">
! <pre class="smallexample">% ar -q libstdc++.a libstdc++.so.4 libstdc++.so.5
! </pre></div>
! 
! <p>Eventually, the
! <a href="./configure.html#WithAixSoname"><samp>--with-aix-soname=svr4</samp></a>
  configure option may drop the need for this procedure for libraries that
  support it.
! </p>
! <p>Linking executables and shared libraries may produce warnings of
  duplicate symbols.  The assembly files generated by GCC for AIX always
  have included multiple symbol definitions for certain global variable
  and function declarations in the original program.  The warnings should
  not prevent the linker from producing a correct library or runnable
  executable.
! </p>
! <p>AIX 4.3 utilizes a &ldquo;large format&rdquo; archive to support both 32-bit and
  64-bit object modules.  The routines provided in AIX 4.3.0 and AIX 4.3.1
! to parse archive libraries did not handle the new format correctly.
  These routines are used by GCC and result in error messages during
  linking such as &ldquo;not a COFF file&rdquo;.  The version of the routines shipped
! with AIX 4.3.1 should work for a 32-bit environment.  The <samp>-g</samp>
  option of the archive command may be used to create archives of 32-bit
  objects using the original &ldquo;small format&rdquo;.  A correct version of the
  routines is shipped with AIX 4.3.2 and above.
! </p>
! <p>Some versions of the AIX binder (linker) can fail with a relocation
! overflow severe error when the <samp>-bbigtoc</samp> option is used to link
  GCC-produced object files into an executable that overflows the TOC.  A fix
  for APAR IX75823 (OVERFLOW DURING LINK WHEN USING GCC AND -BBIGTOC) is
  available from IBM Customer Support and from its
  <a href="http://techsupport.services.ibm.com/">techsupport.services.ibm.com</a>
  website as PTF U455193.
! </p>
! <p>The AIX 4.3.2.1 linker (bos.rte.bind_cmds Level 4.3.2.1) will dump core
  with a segmentation fault when invoked by any version of GCC.  A fix for
  APAR IX87327 is available from IBM Customer Support and from its
  <a href="http://techsupport.services.ibm.com/">techsupport.services.ibm.com</a>
  website as PTF U461879.  This fix is incorporated in AIX 4.3.3 and above.
! </p>
! <p>The initial assembler shipped with AIX 4.3.0 generates incorrect object
  files.  A fix for APAR IX74254 (64BIT DISASSEMBLED OUTPUT FROM COMPILER FAILS
  TO ASSEMBLE/BIND) is available from IBM Customer Support and from its
  <a href="http://techsupport.services.ibm.com/">techsupport.services.ibm.com</a>
  website as PTF U453956.  This fix is incorporated in AIX 4.3.1 and above.
! </p>
! <p>AIX provides National Language Support (NLS).  Compilers and assemblers
  use NLS to support locale-specific representations of various data
! formats including floating-point numbers (e.g., &lsquo;<samp>.</samp>&rsquo;  vs &lsquo;<samp>,</samp>&rsquo; for
  separating decimal fractions).  There have been problems reported where
  GCC does not produce the same floating-point formats that the assembler
! expects.  If one encounters this problem, set the <code>LANG</code>
! environment variable to &lsquo;<samp>C</samp>&rsquo; or &lsquo;<samp>En_US</samp>&rsquo;.
! </p>
! <p>A default can be specified with the <samp>-mcpu=<var>cpu_type</var></samp>
! switch and using the configure option <samp>--with-cpu-<var>cpu_type</var></samp>.
! </p>
! <hr />
! <a name="iq2000_002dx_002delf"></a><a name="iq2000_002d_002a_002delf"></a>
! <h3 class="heading">iq2000-*-elf</h3>
  <p>Vitesse IQ2000 processors.  These are used in embedded
  applications.  There are no standard Unix configurations.
! </p>
! <hr />
! <a name="lm32_002dx_002delf"></a><a name="lm32_002d_002a_002delf"></a>
! <h3 class="heading">lm32-*-elf</h3>
! <p>Lattice Mico32 processor.
  This configuration is intended for embedded systems.
! </p>
! <hr />
! <a name="lm32_002dx_002duclinux"></a><a name="lm32_002d_002a_002duclinux"></a>
! <h3 class="heading">lm32-*-uclinux</h3>
! <p>Lattice Mico32 processor.
  This configuration is intended for embedded systems running uClinux.
! </p>
! <hr />
! <a name="m32c_002dx_002delf"></a><a name="m32c_002d_002a_002delf"></a>
! <h3 class="heading">m32c-*-elf</h3>
! <p>Renesas M32C processor.
  This configuration is intended for embedded systems.
! </p>
! <hr />
! <a name="m32r_002dx_002delf"></a><a name="m32r_002d_002a_002delf"></a>
! <h3 class="heading">m32r-*-elf</h3>
! <p>Renesas M32R processor.
  This configuration is intended for embedded systems.
! </p>
! <hr />
! <a name="m68k_002dx_002dx"></a><a name="m68k_002d_002a_002d_002a"></a>
! <h3 class="heading">m68k-*-*</h3>
  <p>By default,
! &lsquo;<samp>m68k-*-elf*</samp>&rsquo;, &lsquo;<samp>m68k-*-rtems</samp>&rsquo;,  &lsquo;<samp>m68k-*-uclinux</samp>&rsquo; and
! &lsquo;<samp>m68k-*-linux</samp>&rsquo;
  build libraries for both M680x0 and ColdFire processors.  If you only
  need the M680x0 libraries, you can omit the ColdFire ones by passing
! <samp>--with-arch=m68k</samp> to <code>configure</code>.  Alternatively, you
! can omit the M680x0 libraries by passing <samp>--with-arch=cf</samp> to
! <code>configure</code>.  These targets default to 5206 or 5475 code as
  appropriate for the target system when
! configured with <samp>--with-arch=cf</samp> and 68020 code otherwise.
! </p>
! <p>The &lsquo;<samp>m68k-*-netbsd</samp>&rsquo; and
! &lsquo;<samp>m68k-*-openbsd</samp>&rsquo; targets also support the <samp>--with-arch</samp>
  option.  They will generate ColdFire CFV4e code when configured with
! <samp>--with-arch=cf</samp> and 68020 code otherwise.
! </p>
! <p>You can override the default processors listed above by configuring
! with <samp>--with-cpu=<var>target</var></samp>.  This <var>target</var> can either
! be a <samp>-mcpu</samp> argument or one of the following values:
! &lsquo;<samp>m68000</samp>&rsquo;, &lsquo;<samp>m68010</samp>&rsquo;, &lsquo;<samp>m68020</samp>&rsquo;, &lsquo;<samp>m68030</samp>&rsquo;,
! &lsquo;<samp>m68040</samp>&rsquo;, &lsquo;<samp>m68060</samp>&rsquo;, &lsquo;<samp>m68020-40</samp>&rsquo; and &lsquo;<samp>m68020-60</samp>&rsquo;.
! </p>
! <p>GCC requires at least binutils version 2.17 on these targets.
! </p>
! <hr />
! <a name="m68k_002dx_002duclinux"></a><a name="m68k_002d_002a_002duclinux"></a>
! <h3 class="heading">m68k-*-uclinux</h3>
  <p>GCC 4.3 changed the uClinux configuration so that it uses the
! &lsquo;<samp>m68k-linux-gnu</samp>&rsquo; ABI rather than the &lsquo;<samp>m68k-elf</samp>&rsquo; ABI.
  It also added improved support for C++ and flat shared libraries,
  both of which were ABI changes.
! </p>
! <hr />
! <a name="mep_002dx_002delf"></a><a name="mep_002d_002a_002delf"></a>
! <h3 class="heading">mep-*-elf</h3>
! <p>Toshiba Media embedded Processor.
  This configuration is intended for embedded systems.
! </p>
! <hr />
! <a name="microblaze_002dx_002delf"></a><a name="microblaze_002d_002a_002delf"></a>
! <h3 class="heading">microblaze-*-elf</h3>
! <p>Xilinx MicroBlaze processor.
  This configuration is intended for embedded systems.
! </p>
! <hr />
! <a name="mips_002dx_002dx"></a><a name="mips_002d_002a_002d_002a"></a>
! <h3 class="heading">mips-*-*</h3>
  <p>If on a MIPS system you get an error message saying &ldquo;does not have gp
! sections for all it&rsquo;s [sic] sectons [sic]&rdquo;, don&rsquo;t worry about it.  This
  happens whenever you use GAS with the MIPS linker, but there is not
  really anything wrong, and it is okay to use the output file.  You can
  stop such warnings by installing the GNU linker.
! </p>
! <p>It would be nice to extend GAS to produce the gp tables, but they are
  optional, and there should not be a warning about their absence.
! </p>
! <p>The libstdc++ atomic locking routines for MIPS targets requires MIPS II
  and later.  A patch went in just after the GCC 3.3 release to
! make &lsquo;<samp>mips*-*-*</samp>&rsquo; use the generic implementation instead.  You can also
! configure for &lsquo;<samp>mipsel-elf</samp>&rsquo; as a workaround.  The
! &lsquo;<samp>mips*-*-linux*</samp>&rsquo; target continues to use the MIPS II routines.  More
  work on this is expected in future releases.
+ </p>
  
! <p>The built-in <code>__sync_*</code> functions are available on MIPS II and
! later systems and others that support the &lsquo;<samp>ll</samp>&rsquo;, &lsquo;<samp>sc</samp>&rsquo; and
! &lsquo;<samp>sync</samp>&rsquo; instructions.  This can be overridden by passing
! <samp>--with-llsc</samp> or <samp>--without-llsc</samp> when configuring GCC.
  Since the Linux kernel emulates these instructions if they are
! missing, the default for &lsquo;<samp>mips*-*-linux*</samp>&rsquo; targets is
! <samp>--with-llsc</samp>.  The <samp>--with-llsc</samp> and
! <samp>--without-llsc</samp> configure options may be overridden at compile
! time by passing the <samp>-mllsc</samp> or <samp>-mno-llsc</samp> options to
  the compiler.
! </p>
! <p>MIPS systems check for division by zero (unless
! <samp>-mno-check-zero-division</samp> is passed to the compiler) by
  generating either a conditional trap or a break instruction.  Using
  trap results in smaller code, but is only supported on MIPS II and
  later.  Also, some versions of the Linux kernel have a bug that
  prevents trap from generating the proper signal (<code>SIGFPE</code>).  To enable
! the use of break, use the <samp>--with-divide=breaks</samp>
! <code>configure</code> option when configuring GCC.  The default is to
  use traps on systems that support them.
! </p>
! <p>The assembler from GNU binutils 2.17 and earlier has a bug in the way
  it sorts relocations for REL targets (o32, o64, EABI).  This can cause
  bad code to be generated for simple C++ programs.  Also the linker
  from GNU binutils versions prior to 2.17 has a bug which causes the
! runtime linker stubs in very large programs, like <samp>libgcj.so</samp>, to
  be incorrectly generated.  GNU Binutils 2.18 and later (and snapshots
  made after Nov. 9, 2006) should be free from both of these problems.
! </p>
! <hr />
! <a name="mips_002dsgi_002dirix5"></a><a name="mips_002dsgi_002dirix5-1"></a>
! <h3 class="heading">mips-sgi-irix5</h3>
  <p>Support for IRIX 5 has been removed in GCC 4.6.
! </p>
! <hr />
! <a name="mips_002dsgi_002dirix6"></a><a name="mips_002dsgi_002dirix6-1"></a>
! <h3 class="heading">mips-sgi-irix6</h3>
  <p>Support for IRIX 6.5 has been removed in GCC 4.8.  Support for IRIX 6
  releases before 6.5 has been removed in GCC 4.6, as well as support for
  the O32 ABI.
! </p>
! <hr />
! <a name="moxie_002dx_002delf"></a><a name="moxie_002d_002a_002delf"></a>
! <h3 class="heading">moxie-*-elf</h3>
  <p>The moxie processor.
! </p>
! <hr />
! <a name="msp430_002dx_002delf"></a><a name="msp430_002d_002a_002delf"></a>
! <h3 class="heading">msp430-*-elf</h3>
! <p>TI MSP430 processor.
  This configuration is intended for embedded systems.
! </p>
! <hr />
! <a name="nds32le_002dx_002delf"></a><a name="nds32le_002d_002a_002delf"></a>
! <h3 class="heading">nds32le-*-elf</h3>
  <p>Andes NDS32 target in little endian mode.
! </p>
! <hr />
! <a name="nds32be_002dx_002delf"></a><a name="nds32be_002d_002a_002delf"></a>
! <h3 class="heading">nds32be-*-elf</h3>
  <p>Andes NDS32 target in big endian mode.
! </p>
! <hr />
! <a name="nvptx_002dx_002dnone"></a><a name="nvptx_002d_002a_002dnone"></a>
! <h3 class="heading">nvptx-*-none</h3>
  <p>Nvidia PTX target.
! </p>
! <p>Instead of GNU binutils, you will need to install
! <a href="https://github.com/MentorEmbedded/nvptx-tools/">nvptx-tools</a>.
  Tell GCC where to find it:
! <samp>--with-build-time-tools=[install-nvptx-tools]/nvptx-none/bin</samp>.
! </p>
! <p>A nvptx port of newlib is available at
! <a href="https://github.com/MentorEmbedded/nvptx-newlib/">nvptx-newlib</a>.
  It can be automatically built together with GCC.  For this, add a
! symbolic link to nvptx-newlib&rsquo;s <samp>newlib</samp> directory to the
  directory containing the GCC sources.
! </p>
! <p>Use the <samp>--disable-sjlj-exceptions</samp> and
! <samp>--enable-newlib-io-long-long</samp> options when configuring.
! </p>
! <hr />
! <a name="powerpc_002dx_002dx"></a><a name="powerpc_002d_002a_002d_002a"></a>
! <h3 class="heading">powerpc-*-*</h3>
! <p>You can specify a default version for the <samp>-mcpu=<var>cpu_type</var></samp>
! switch by using the configure option <samp>--with-cpu-<var>cpu_type</var></samp>.
! </p>
! <p>You will need
  <a href="ftp://ftp.kernel.org/pub/linux/devel/binutils">binutils 2.15</a>
  or newer for a working GCC.
! </p>
! <hr />
! <a name="powerpc_002dx_002ddarwin"></a><a name="powerpc_002d_002a_002ddarwin_002a"></a>
! <h3 class="heading">powerpc-*-darwin*</h3>
  <p>PowerPC running Darwin (Mac OS X kernel).
! </p>
! <p>Pre-installed versions of Mac OS X may not include any developer tools,
  meaning that you will not be able to build GCC from source.  Tool
  binaries are available at
  <a href="http://opensource.apple.com/">http://opensource.apple.com/</a>.
! </p>
! <p>This version of GCC requires at least cctools-590.36.  The
  cctools-590.36 package referenced from
  <a href="http://gcc.gnu.org/ml/gcc/2006-03/msg00507.html">http://gcc.gnu.org/ml/gcc/2006-03/msg00507.html</a> will not work
  on systems older than 10.3.9 (aka darwin7.9.0).
! </p>
! <hr />
! <a name="powerpc_002dx_002delf"></a><a name="powerpc_002d_002a_002delf"></a>
! <h3 class="heading">powerpc-*-elf</h3>
  <p>PowerPC system in big endian mode, running System V.4.
! </p>
! <hr />
! <a name="powerpc_002dx_002dlinux_002dgnu"></a><a name="powerpc_002a_002d_002a_002dlinux_002dgnu_002a"></a>
! <h3 class="heading">powerpc*-*-linux-gnu*</h3>
  <p>PowerPC system in big endian mode running Linux.
! </p>
! <hr />
! <a name="powerpc_002dx_002dnetbsd"></a><a name="powerpc_002d_002a_002dnetbsd_002a"></a>
! <h3 class="heading">powerpc-*-netbsd*</h3>
  <p>PowerPC system in big endian mode running NetBSD.
! </p>
! <hr />
! <a name="powerpc_002dx_002deabisim"></a><a name="powerpc_002d_002a_002deabisim"></a>
! <h3 class="heading">powerpc-*-eabisim</h3>
  <p>Embedded PowerPC system in big endian mode for use in running under the
  PSIM simulator.
! </p>
! <hr />
! <a name="powerpc_002dx_002deabi"></a><a name="powerpc_002d_002a_002deabi"></a>
! <h3 class="heading">powerpc-*-eabi</h3>
  <p>Embedded PowerPC system in big endian mode.
! </p>
! <hr />
! <a name="powerpcle_002dx_002delf"></a><a name="powerpcle_002d_002a_002delf"></a>
! <h3 class="heading">powerpcle-*-elf</h3>
  <p>PowerPC system in little endian mode, running System V.4.
! </p>
! <hr />
! <a name="powerpcle_002dx_002deabisim"></a><a name="powerpcle_002d_002a_002deabisim"></a>
! <h3 class="heading">powerpcle-*-eabisim</h3>
  <p>Embedded PowerPC system in little endian mode for use in running under
  the PSIM simulator.
! </p>
! <hr />
! <a name="powerpcle_002dx_002deabi"></a><a name="powerpcle_002d_002a_002deabi"></a>
! <h3 class="heading">powerpcle-*-eabi</h3>
  <p>Embedded PowerPC system in little endian mode.
! </p>
! <hr />
! <a name="rl78_002dx_002delf"></a><a name="rl78_002d_002a_002delf"></a>
! <h3 class="heading">rl78-*-elf</h3>
! <p>The Renesas RL78 processor.
  This configuration is intended for embedded systems.
! </p>
! <hr />
! <a name="rx_002dx_002delf"></a><a name="rx_002d_002a_002delf"></a>
! <h3 class="heading">rx-*-elf</h3>
  <p>The Renesas RX processor.  See
  <a href="http://eu.renesas.com/fmwk.jsp?cnt=rx600_series_landing.jsp&amp;fp=/products/mpumcu/rx_family/rx600_series">http://eu.renesas.com/fmwk.jsp?cnt=rx600_series_landing.jsp&amp;fp=/products/mpumcu/rx_family/rx600_series</a>
  for more information about this processor.
! </p>
! <hr />
! <a name="s390_002dx_002dlinux"></a><a name="s390_002d_002a_002dlinux_002a"></a>
! <h3 class="heading">s390-*-linux*</h3>
  <p>S/390 system running GNU/Linux for S/390.
! </p>
! <hr />
! <a name="s390x_002dx_002dlinux"></a><a name="s390x_002d_002a_002dlinux_002a"></a>
! <h3 class="heading">s390x-*-linux*</h3>
  <p>zSeries system (64-bit) running GNU/Linux for zSeries.
! </p>
! <hr />
! <a name="s390x_002dibm_002dtpf"></a><a name="s390x_002dibm_002dtpf_002a"></a>
! <h3 class="heading">s390x-ibm-tpf*</h3>
  <p>zSeries system (64-bit) running TPF.  This platform is
  supported as cross-compilation target only.
! </p>
! <hr />
! <a name="x_002dx_002dsolaris2"></a><a name="g_t_002a_002d_002a_002dsolaris2_002a"></a>
! <h3 class="heading">*-*-solaris2*</h3>
! <p>Support for Solaris 9 has been removed in GCC 5.  Support for Solaris
  8 has been removed in GCC 4.8.  Support for Solaris 7 has been removed
  in GCC 4.6.
! </p>
! <p>Sun does not ship a C compiler with Solaris 2 before Solaris 10, though
  you can download the Sun Studio compilers for free.  In Solaris 10 and
! 11, GCC 3.4.3 is available as <code>/usr/sfw/bin/gcc</code>.  Solaris 11
! also provides GCC 4.5.2 as <code>/usr/gcc/4.5/bin/gcc</code>.  Alternatively,
  you can install a pre-built GCC to bootstrap and install GCC.  See the
  <a href="binaries.html">binaries page</a> for details.
! </p>
! <p>The Solaris 2 <code>/bin/sh</code> will often fail to configure
! &lsquo;<samp>libstdc++-v3</samp>&rsquo;, &lsquo;<samp>boehm-gc</samp>&rsquo; or &lsquo;<samp>libjava</samp>&rsquo;.  We therefore
  recommend using the following initial sequence of commands
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">% CONFIG_SHELL=/bin/ksh
+ % export CONFIG_SHELL
+ </pre></div>
  
! <p>and proceed as described in <a href="configure.html">the configure instructions</a>.
  In addition we strongly recommend specifying an absolute path to invoke
! <code><var>srcdir</var>/configure</code>.
! </p>
! <p>Solaris 2 comes with a number of optional OS packages.  Some of these
  are needed to use GCC fully, namely <code>SUNWarc</code>,
  <code>SUNWbtool</code>, <code>SUNWesu</code>, <code>SUNWhea</code>, <code>SUNWlibm</code>,
  <code>SUNWsprot</code>, and <code>SUNWtoo</code>.  If you did not install all
  optional packages when installing Solaris 2, you will need to verify that
  the packages that GCC needs are installed.
! </p>
! <p>To check whether an optional package is installed, use
! the <code>pkginfo</code> command.  To add an optional package, use the
! <code>pkgadd</code> command.  For further details, see the Solaris 2
  documentation.
! </p>
! <p>Trying to use the linker and other tools in
! <samp>/usr/ucb</samp> to install GCC has been observed to cause trouble.
  For example, the linker may hang indefinitely.  The fix is to remove
! <samp>/usr/ucb</samp> from your <code>PATH</code>.
! </p>
! <p>The build process works more smoothly with the legacy Sun tools so, if you
! have <samp>/usr/xpg4/bin</samp> in your <code>PATH</code>, we recommend that you place
! <samp>/usr/bin</samp> before <samp>/usr/xpg4/bin</samp> for the duration of the build.
! </p>
! <p>We recommend the use of the Sun assembler or the GNU assembler, in
! conjunction with the Sun linker.  The GNU <code>as</code>
  versions included in Solaris 10, from GNU binutils 2.15, and Solaris 11,
  from GNU binutils 2.19, are known to work.  They can be found in
! <samp>/usr/sfw/bin/gas</samp>.  Current versions of GNU binutils (2.22)
  are known to work as well.  Note that your mileage may vary
  if you use a combination of the GNU tools and the Sun tools: while the
! combination GNU <code>as</code> + Sun <code>ld</code> should reasonably work,
! the reverse combination Sun <code>as</code> + GNU <code>ld</code> may fail to
! build or cause memory corruption at runtime in some cases for C++ programs.
! GNU <code>ld</code> usually works as well, although the version included in
  Solaris 10 cannot be used due to several bugs.  Again, the current
  version (2.22) is known to work, but generally lacks platform specific
! features, so better stay with Sun <code>ld</code>.  To use the LTO linker
! plugin (<samp>-fuse-linker-plugin</samp>) with GNU <code>ld</code>, GNU
! binutils <em>must</em> be configured with <samp>--enable-largefile</samp>.
! </p>
! <p>To enable symbol versioning in &lsquo;<samp>libstdc++</samp>&rsquo; with the Sun linker,
! you need to have any version of GNU <code>c++filt</code>, which is part of
! GNU binutils.  &lsquo;<samp>libstdc++</samp>&rsquo; symbol versioning will be disabled if no
! appropriate version is found.  Sun <code>c++filt</code> from the Sun Studio
  compilers does <em>not</em> work.
! </p>
! <p>GNU <code>make</code> version 3.81 or later is required to build libjava
! with the Sun linker.
! </p>
! <p>Sun bug 4296832 turns up when compiling X11 headers with GCC 2.95 or
! newer: <code>g++</code> will complain that types are missing.  These headers
  assume that omitting the type means <code>int</code>; this assumption worked for
  C90 but is wrong for C++, and is now wrong for C99 also.
! </p>
! <p>Sun bug 4927647 sometimes causes random spurious testsuite failures
! related to missing diagnostic output.  This bug doesn&rsquo;t affect GCC
! itself, rather it is a kernel bug triggered by the <code>expect</code>
  program which is used only by the GCC testsuite driver.  When the bug
! causes the <code>expect</code> program to miss anticipated output, extra
  testsuite failures appear.
! </p>
! <hr />
! <a name="sparc_002dx_002dx"></a><a name="sparc_002a_002d_002a_002d_002a"></a>
! <h3 class="heading">sparc*-*-*</h3>
  <p>This section contains general configuration information for all
  SPARC-based platforms.  In addition to reading this section, please
  read all other sections that match your target.
! </p>
! <p>Newer versions of the GNU Multiple Precision Library (GMP), the MPFR
  library and the MPC library are known to be miscompiled by earlier
  versions of GCC on these platforms.  We therefore recommend the use
  of the exact versions of these libraries listed as minimal versions
  in <a href="prerequisites.html">the prerequisites</a>.
! </p>
! <hr />
! <a name="sparc_002dsun_002dsolaris2"></a><a name="sparc_002dsun_002dsolaris2_002a"></a>
! <h3 class="heading">sparc-sun-solaris2*</h3>
  <p>When GCC is configured to use GNU binutils 2.14 or later, the binaries
! produced are smaller than the ones produced using Sun&rsquo;s native tools;
  this difference is quite significant for binaries containing debugging
  information.
! </p>
! <p>Starting with Solaris 7, the operating system is capable of executing
  64-bit SPARC V9 binaries.  GCC 3.1 and later properly supports
! this; the <samp>-m64</samp> option enables 64-bit code generation.
  However, if all you want is code tuned for the UltraSPARC CPU, you
! should try the <samp>-mtune=ultrasparc</samp> option instead, which produces
  code that, unlike full 64-bit code, can still run on non-UltraSPARC
  machines.
! </p>
! <p>When configuring on a Solaris 7 or later system that is running a kernel
  that supports only 32-bit binaries, one must configure with
! <samp>--disable-multilib</samp>, since we will not be able to build the
  64-bit target libraries.
! </p>
! <p>GCC 3.3 and GCC 3.4 trigger code generation bugs in earlier versions of
  the GNU compiler (especially GCC 3.0.x versions), which lead to the
  miscompilation of the stage1 compiler and the subsequent failure of the
  bootstrap process.  A workaround is to use GCC 3.2.3 as an intermediary
  stage, i.e. to bootstrap that compiler with the base compiler and then
  use it to bootstrap the final compiler.
! </p>
! <p>GCC 3.4 triggers a code generation bug in versions 5.4 (Sun ONE Studio 7)
  and 5.5 (Sun ONE Studio 8) of the Sun compiler, which causes a bootstrap
  failure in form of a miscompilation of the stage1 compiler by the Sun
  compiler.  This is Sun bug 4974440.  This is fixed with patch 112760-07.
! </p>
! <p>GCC 3.4 changed the default debugging format from Stabs to DWARF-2 for
  32-bit code on Solaris 7 and later.  If you use the Sun assembler, this
  change apparently runs afoul of Sun bug 4910101 (which is referenced as
! an x86-only problem by Sun, probably because they do not use DWARF-2).
  A symptom of the problem is that you cannot compile C++ programs like
! <code>groff</code> 1.19.1 without getting messages similar to the following:
! </p>
! <div class="smallexample">
! <pre class="smallexample">ld: warning: relocation error: R_SPARC_UA32: &hellip;
!   external symbolic relocation against non-allocatable section
!   .debug_info cannot be processed at runtime: relocation ignored.
! </pre></div>
  
! <p>To work around this problem, compile with <samp>-gstabs+</samp> instead of
! plain <samp>-g</samp>.
! </p>
! <p>When configuring the GNU Multiple Precision Library (GMP), the MPFR
  library or the MPC library on a Solaris 7 or later system, the canonical
! target triplet must be specified as the <code>build</code> parameter on the
! configure line.  This target triplet can be obtained by invoking <code>./config.guess</code> in the toplevel source directory of GCC (and
  not that of GMP or MPFR or MPC).  For example on a Solaris 9 system:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">% ./configure --build=sparc-sun-solaris2.9 --prefix=xxx
+ </pre></div>
  
! <hr />
! <a name="sparc_002dsun_002dsolaris210"></a><a name="sparc_002dsun_002dsolaris2_002e10"></a>
! <h3 class="heading">sparc-sun-solaris2.10</h3>
  <p>There is a bug in older versions of the Sun assembler which breaks
  thread-local storage (TLS).  A typical error message is
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">ld: fatal: relocation error: R_SPARC_TLS_LE_HIX22: file /var/tmp//ccamPA1v.o:
+   symbol &lt;unknown&gt;: bad symbol type SECT: symbol type must be TLS
+ </pre></div>
  
! <p>This bug is fixed in Sun patch 118683-03 or later.
! </p>
! <hr />
! <a name="sparc_002dx_002dlinux"></a><a name="sparc_002d_002a_002dlinux_002a"></a>
! <h3 class="heading">sparc-*-linux*</h3>
  
  <p>GCC versions 3.0 and higher require binutils 2.11.2 and glibc 2.2.4
  or newer on this platform.  All earlier binutils and glibc
  releases mishandled unaligned relocations on <code>sparc-*-*</code> targets.
+ </p>
  
! <hr />
! <a name="sparc64_002dx_002dsolaris2"></a><a name="sparc64_002d_002a_002dsolaris2_002a"></a>
! <h3 class="heading">sparc64-*-solaris2*</h3>
  <p>When configuring the GNU Multiple Precision Library (GMP), the MPFR
  library or the MPC library, the canonical target triplet must be specified
! as the <code>build</code> parameter on the configure line.  For example
  on a Solaris 9 system:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">% ./configure --build=sparc64-sun-solaris2.9 --prefix=xxx
+ </pre></div>
  
! <p>The following compiler flags must be specified in the configure
  step in order to bootstrap this target with the Sun compiler:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">% CC=&quot;cc -xarch=v9 -xildoff&quot; <var>srcdir</var>/configure [<var>options</var>] [<var>target</var>]
+ </pre></div>
  
! <p><samp>-xarch=v9</samp> specifies the SPARC-V9 architecture to the Sun toolchain
! and <samp>-xildoff</samp> turns off the incremental linker.
! </p>
! <hr />
! <a name="sparcv9_002dx_002dsolaris2"></a><a name="sparcv9_002d_002a_002dsolaris2_002a"></a>
! <h3 class="heading">sparcv9-*-solaris2*</h3>
! <p>This is a synonym for &lsquo;<samp>sparc64-*-solaris2*</samp>&rsquo;.
! </p>
! <hr />
! <a name="c6x_002dx_002dx"></a><a name="c6x_002d_002a_002d_002a"></a>
! <h3 class="heading">c6x-*-*</h3>
  <p>The C6X family of processors. This port requires binutils-2.22 or newer.
! </p>
! <hr />
! <a name="tilegx_002d_002a_002dlinux"></a><a name="tilegx_002d_002a_002dlinux_002a"></a>
! <h3 class="heading">tilegx-*-linux*</h3>
  <p>The TILE-Gx processor in little endian mode, running GNU/Linux.  This
  port requires binutils-2.22 or newer.
! </p>
! <hr />
! <a name="tilegxbe_002d_002a_002dlinux"></a><a name="tilegxbe_002d_002a_002dlinux_002a"></a>
! <h3 class="heading">tilegxbe-*-linux*</h3>
  <p>The TILE-Gx processor in big endian mode, running GNU/Linux.  This
  port requires binutils-2.23 or newer.
! </p>
! <hr />
! <a name="tilepro_002d_002a_002dlinux"></a><a name="tilepro_002d_002a_002dlinux_002a"></a>
! <h3 class="heading">tilepro-*-linux*</h3>
  <p>The TILEPro processor running GNU/Linux.  This port requires
  binutils-2.22 or newer.
! </p>
! <hr />
! <a name="visium_002dx_002delf"></a><a name="visium_002d_002a_002delf"></a>
! <h3 class="heading">visium-*-elf</h3>
! <p>CDS VISIUMcore processor.
  This configuration is intended for embedded systems.
! </p>
! <hr />
! <a name="x_002dx_002dvxworks"></a><a name="g_t_002a_002d_002a_002dvxworks_002a"></a>
! <h3 class="heading">*-*-vxworks*</h3>
  <p>Support for VxWorks is in flux.  At present GCC supports <em>only</em> the
! very recent VxWorks 5.5 (aka Tornado 2.2) release, and only on PowerPC.
! We welcome patches for other architectures supported by VxWorks 5.5.
  Support for VxWorks AE would also be welcome; we believe this is merely
  a matter of writing an appropriate &ldquo;configlette&rdquo; (see below).  We are
  not interested in supporting older, a.out or COFF-based, versions of
  VxWorks in GCC 3.
! </p>
! <p>VxWorks comes with an older version of GCC installed in
! <samp><var>$WIND_BASE</var>/host</samp>; we recommend you do not overwrite it.
! Choose an installation <var>prefix</var> entirely outside <var>$WIND_BASE</var>.
! Before running <code>configure</code>, create the directories <samp><var>prefix</var></samp>
! and <samp><var>prefix</var>/bin</samp>.  Link or copy the appropriate assembler,
! linker, etc. into <samp><var>prefix</var>/bin</samp>, and set your <var>PATH</var> to
! include that directory while running both <code>configure</code> and
! <code>make</code>.
! </p>
! <p>You must give <code>configure</code> the
! <samp>--with-headers=<var>$WIND_BASE</var>/target/h</samp> switch so that it can
  find the VxWorks system headers.  Since VxWorks is a cross compilation
! target only, you must also specify <samp>--target=<var>target</var></samp>.
! <code>configure</code> will attempt to create the directory
! <samp><var>prefix</var>/<var>target</var>/sys-include</samp> and copy files into it;
! make sure the user running <code>configure</code> has sufficient privilege
  to do so.
! </p>
! <p>GCC&rsquo;s exception handling runtime requires a special &ldquo;configlette&rdquo;
! module, <samp>contrib/gthr_supp_vxw_5x.c</samp>.  Follow the instructions in
  that file to add the module to your kernel build.  (Future versions of
  VxWorks will incorporate this module.)
! </p>
! <hr />
! <a name="x86_002d64_002dx_002dx"></a><a name="x86_005f64_002d_002a_002d_002a_002c-amd64_002d_002a_002d_002a"></a>
! <h3 class="heading">x86_64-*-*, amd64-*-*</h3>
  <p>GCC supports the x86-64 architecture implemented by the AMD64 processor
! (amd64-*-* is an alias for x86_64-*-*) on GNU/Linux, FreeBSD and NetBSD.
  On GNU/Linux the default is a bi-arch compiler which is able to generate
! both 64-bit x86-64 and 32-bit x86 code (via the <samp>-m32</samp> switch).
! </p>
! <hr />
! <a name="x86_002d64_002dx_002dsolaris210"></a><a name="x86_005f64_002d_002a_002dsolaris2_002e1_005b0_002d9_005d_002a"></a>
! <h3 class="heading">x86_64-*-solaris2.1[0-9]*</h3>
  <p>GCC also supports the x86-64 architecture implemented by the AMD64
! processor (&lsquo;<samp>amd64-*-*</samp>&rsquo; is an alias for &lsquo;<samp>x86_64-*-*</samp>&rsquo;) on
  Solaris 10 or later.  Unlike other systems, without special options a
  bi-arch compiler is built which generates 32-bit code by default, but
! can generate 64-bit x86-64 code with the <samp>-m64</samp> switch.  Since
  GCC 4.7, there is also configuration that defaults to 64-bit code, but
! can generate 32-bit code with <samp>-m32</samp>.  To configure and build
! this way, you have to provide all support libraries like <samp>libgmp</samp>
! as 64-bit code, configure with <samp>--target=x86_64-pc-solaris2.1x</samp>
! and &lsquo;<samp>CC=gcc -m64</samp>&rsquo;.
! </p>
! <hr />
! <a name="xtensa_002dx_002delf"></a><a name="xtensa_002a_002d_002a_002delf"></a>
! <h3 class="heading">xtensa*-*-elf</h3>
  <p>This target is intended for embedded Xtensa systems using the
! &lsquo;<samp>newlib</samp>&rsquo; C library.  It uses ELF but does not support shared
  objects.  Designed-defined instructions specified via the
  Tensilica Instruction Extension (TIE) language are only supported
  through inline assembly.
! </p>
! <p>The Xtensa configuration information must be specified prior to
! building GCC.  The <samp>include/xtensa-config.h</samp> header
  file contains the configuration information.  If you created your
  own Xtensa configuration with the Xtensa Processor Generator, the
  downloaded files include a customized copy of this header file,
  which you can use to replace the default header file.
! </p>
! <hr />
! <a name="xtensa_002dx_002dlinux"></a><a name="xtensa_002a_002d_002a_002dlinux_002a"></a>
! <h3 class="heading">xtensa*-*-linux*</h3>
  <p>This target is for Xtensa systems running GNU/Linux.  It supports ELF
  shared objects and the GNU C library (glibc).  It also generates
  position-independent code (PIC) regardless of whether the
! <samp>-fpic</samp> or <samp>-fPIC</samp> options are used.  In other
  respects, this target is the same as the
! <a href="#xtensa*-*-elf">&lsquo;<samp>xtensa*-*-elf</samp>&rsquo;</a> target.
! </p>
! <hr />
! <a name="windows"></a><a name="Microsoft-Windows"></a>
! <h3 class="heading">Microsoft Windows</h3>
  
+ <a name="Intel-16_002dbit-versions"></a>
+ <h4 class="subheading">Intel 16-bit versions</h4>
  <p>The 16-bit versions of Microsoft Windows, such as Windows 3.1, are not
  supported.
! </p>
! <p>However, the 32-bit port has limited support for Microsoft
  Windows 3.11 in the Win32s environment, as a target only.  See below.
! </p>
! <a name="Intel-32_002dbit-versions"></a>
! <h4 class="subheading">Intel 32-bit versions</h4>
  <p>The 32-bit versions of Windows, including Windows 95, Windows NT, Windows
  XP, and Windows Vista, are supported by several different target
  platforms.  These targets differ in which Windows subsystem they target
  and which C libraries are used.
+ </p>
+ <ul>
+ <li> Cygwin <a href="#x-x-cygwin">*-*-cygwin</a>: Cygwin provides a user-space
+ Linux API emulation layer in the Win32 subsystem.
+ </li><li> Interix <a href="#x-x-interix">*-*-interix</a>: The Interix subsystem
+ provides native support for POSIX.
+ </li><li> MinGW <a href="#x-x-mingw32">*-*-mingw32</a>: MinGW is a native GCC port for
+ the Win32 subsystem that provides a subset of POSIX.
+ </li><li> MKS i386-pc-mks: NuTCracker from MKS.  See
+ <a href="http://www.mkssoftware.com/">http://www.mkssoftware.com/</a> for more information.
+ </li></ul>
  
! <a name="Intel-64_002dbit-versions"></a>
! <h4 class="subheading">Intel 64-bit versions</h4>
  <p>GCC contains support for x86-64 using the mingw-w64
! runtime library, available from <a href="http://mingw-w64.sourceforge.net/">http://mingw-w64.sourceforge.net/</a>.
  This library should be used with the target triple x86_64-pc-mingw32.
! </p>
! <p>Presently Windows for Itanium is not supported.
! </p>
! <a name="Windows-CE"></a>
! <h4 class="subheading">Windows CE</h4>
  <p>Windows CE is supported as a target only on Hitachi
  SuperH (sh-wince-pe), and MIPS (mips-wince-pe).
! </p>
! <a name="Other-Windows-Platforms"></a>
! <h4 class="subheading">Other Windows Platforms</h4>
  <p>GCC no longer supports Windows NT on the Alpha or PowerPC.
! </p>
! <p>GCC no longer supports the Windows POSIX subsystem.  However, it does
  support the Interix subsystem.  See above.
! </p>
! <p>Old target names including *-*-winnt and *-*-windowsnt are no longer used.
! </p>
! <p>PW32 (i386-pc-pw32) support was never completed, and the project seems to
  be inactive.  See <a href="http://pw32.sourceforge.net/">http://pw32.sourceforge.net/</a> for more information.
! </p>
! <p>UWIN support has been removed due to a lack of maintenance.
! </p>
! <hr />
! <a name="x_002dx_002dcygwin"></a><a name="g_t_002a_002d_002a_002dcygwin"></a>
! <h3 class="heading">*-*-cygwin</h3>
  <p>Ports of GCC are included with the
  <a href="http://www.cygwin.com/">Cygwin environment</a>.
! </p>
! <p>GCC will build under Cygwin without modification; it does not build
! with Microsoft&rsquo;s C++ compiler and there are no plans to make it do so.
! </p>
! <p>The Cygwin native compiler can be configured to target any 32-bit x86
  cpu architecture desired; the default is i686-pc-cygwin.  It should be
  used with as up-to-date a version of binutils as possible; use either
  the latest official GNU binutils release in the Cygwin distribution,
  or version 2.20 or above if building your own.
! </p>
! <hr />
! <a name="x_002dx_002dinterix"></a><a name="g_t_002a_002d_002a_002dinterix"></a>
! <h3 class="heading">*-*-interix</h3>
  <p>The Interix target is used by OpenNT, Interix, Services For UNIX (SFU),
  and Subsystem for UNIX-based Applications (SUA).  Applications compiled
  with this target run in the Interix subsystem, which is separate from
  the Win32 subsystem.  This target was last known to work in GCC 3.3.
! </p>
! <hr />
! <a name="x_002dx_002dmingw32"></a><a name="g_t_002a_002d_002a_002dmingw32"></a>
! <h3 class="heading">*-*-mingw32</h3>
! <p>GCC will build with and support only MinGW runtime 3.12 and later.
  Earlier versions of headers are incompatible with the new default semantics
  of <code>extern inline</code> in <code>-std=c99</code> and <code>-std=gnu99</code> modes.
! </p>
! <hr />
! <a name="older"></a><a name="Older-systems"></a>
! <h3 class="heading">Older systems</h3>
  <p>GCC contains support files for many older (1980s and early
  1990s) Unix variants.  For the most part, support for these systems
  has not been deliberately removed, but it has not been maintained for
  several years and may suffer from bitrot.
! </p>
! <p>Starting with GCC 3.1, each release has a list of &ldquo;obsoleted&rdquo; systems.
  Support for these systems is still present in that release, but
! <code>configure</code> will fail unless the <samp>--enable-obsolete</samp>
  option is given.  Unless a maintainer steps forward, support for these
  systems will be removed from the next release of GCC.
! </p>
! <p>Support for old systems as hosts for GCC can cause problems if the
  workarounds for compiler, library and operating system bugs affect the
  cleanliness or maintainability of the rest of GCC.  In some cases, to
  bring GCC up on such a system, if still possible with current GCC, may
  require first installing an old version of GCC which did work on that
  system, and using it to compile a more recent GCC, to avoid bugs in the
  vendor compiler.  Old releases of GCC 1 and GCC 2 are available in the
! <samp>old-releases</samp> directory on the <a href="../mirrors.html">GCC mirror
! sites</a>.  Header bugs may generally be avoided using
! <code>fixincludes</code>, but bugs or deficiencies in libraries and the
  operating system may still cause problems.
! </p>
! <p>Support for older systems as targets for cross-compilation is less
  problematic than support for them as hosts for GCC; if an enthusiast
  wishes to make such a target work again (including resurrecting any of
  the targets that never worked with GCC 2, starting from the last
*************** version before they were removed), patch
*** 1512,1542 ****
  <a href="../contribute.html">following the usual requirements</a> would be
  likely to be accepted, since they should not affect the support for more
  modern targets.
! 
!    <p>For some systems, old versions of GNU binutils may also be useful,
! and are available from <samp><span class="file">pub/binutils/old-releases</span></samp> on
  <a href="http://sourceware.org/mirrors.html">sourceware.org mirror sites</a>.
! 
!    <p>Some of the information on specific systems above relates to
  such older systems, but much of the information
  about GCC on such systems (which may no longer be applicable to
  current GCC) is to be found in the GCC texinfo manual.
! 
!    <p><hr /><a name="elf"></a>
! 
! <h3 class="heading"><a name="TOC83"></a>all ELF targets (SVR4, Solaris 2, etc.)</h3>
! 
  <p>C++ support is significantly better on ELF targets if you use the
  <a href="./configure.html#with-gnu-ld">GNU linker</a>; duplicate copies of
  inlines, vtables and template instantiations will be discarded
  automatically.
  
!    <p><hr />
  <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- ***Old documentation****************************************************** -->
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 1517,1550 ----
  <a href="../contribute.html">following the usual requirements</a> would be
  likely to be accepted, since they should not affect the support for more
  modern targets.
! </p>
! <p>For some systems, old versions of GNU binutils may also be useful,
! and are available from <samp>pub/binutils/old-releases</samp> on
  <a href="http://sourceware.org/mirrors.html">sourceware.org mirror sites</a>.
! </p>
! <p>Some of the information on specific systems above relates to
  such older systems, but much of the information
  about GCC on such systems (which may no longer be applicable to
  current GCC) is to be found in the GCC texinfo manual.
! </p>
! <hr />
! <a name="elf"></a><a name="all-ELF-targets-_0028SVR4_002c-Solaris-2_002c-etc_002e_0029"></a>
! <h3 class="heading">all ELF targets (SVR4, Solaris 2, etc.)</h3>
  <p>C++ support is significantly better on ELF targets if you use the
  <a href="./configure.html#with-gnu-ld">GNU linker</a>; duplicate copies of
  inlines, vtables and template instantiations will be discarded
  automatically.
+ </p>
  
! <hr />
! <p>
  <p><a href="./index.html">Return to the GCC Installation page</a>
+ </p>
+ 
+ 
  
  
+ 
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/INSTALL/test.html gcc-5.5.0/INSTALL/test.html
*** gcc-5.4.0/INSTALL/test.html	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/INSTALL/test.html	Tue Oct 10 08:13:24 2017
***************
*** 1,234 ****
! <html lang="en">
! <head>
! <title>Installing GCC: Testing</title>
! <meta http-equiv="Content-Type" content="text/html">
! <meta name="description" content="Installing GCC: Testing">
! <meta name="generator" content="makeinfo 4.12">
! <link title="Top" rel="top" href="#Top">
! <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
! <!--
! Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
!    Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
!      A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
!      You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development.-->
! <meta http-equiv="Content-Style-Type" content="text/css">
! <style type="text/css"><!--
!   pre.display { font-family:inherit }
!   pre.format  { font-family:inherit }
!   pre.smalldisplay { font-family:inherit; font-size:smaller }
!   pre.smallformat  { font-family:inherit; font-size:smaller }
!   pre.smallexample { font-size:smaller }
!   pre.smalllisp    { font-size:smaller }
!   span.sc    { font-variant:small-caps }
!   span.roman { font-family:serif; font-weight:normal; } 
!   span.sansserif { font-family:sans-serif; font-weight:normal; } 
! --></style>
  </head>
! <body>
! <h1 class="settitle">Installing GCC: Testing</h1>
! <a name="index-Testing-1"></a><a name="index-Installing-GCC_003a-Testing-2"></a><a name="index-Testsuite-3"></a>
! Before you install GCC, we encourage you to run the testsuites and to
  compare your results with results from a similar configuration that have
  been submitted to the
! <a href="http://gcc.gnu.org/ml/gcc-testresults/">gcc-testresults mailing list</a>. 
  Some of these archived results are linked from the build status lists
  at <a href="http://gcc.gnu.org/buildstat.html">http://gcc.gnu.org/buildstat.html</a>, although not everyone who
! reports a successful build runs the testsuites and submits the results. 
  This step is optional and may require you to download additional software,
  but it can give you confidence in your new GCC installation or point out
  problems before you install and start using your new GCC.
! 
!    <p>First, you must have <a href="download.html">downloaded the testsuites</a>. 
  These are part of the full distribution, but if you downloaded the
  &ldquo;core&rdquo; compiler plus any front ends, you must download the testsuites
  separately.
! 
!    <p>Second, you must have the testing tools installed.  This includes
  <a href="http://www.gnu.org/software/dejagnu/">DejaGnu</a>, Tcl, and Expect;
  the DejaGnu site has links to these.
! 
!    <p>If the directories where <samp><span class="command">runtest</span></samp> and <samp><span class="command">expect</span></samp> were
! installed are not in the <samp><span class="env">PATH</span></samp>, you may need to set the following
  environment variables appropriately, as in the following example (which
! assumes that DejaGnu has been installed under <samp><span class="file">/usr/local</span></samp>):
  
! <pre class="smallexample">     TCL_LIBRARY = /usr/local/share/tcl8.0
!      DEJAGNULIBS = /usr/local/share/dejagnu
! </pre>
!    <p>(On systems such as Cygwin, these paths are required to be actual
  paths, not mounts or links; presumably this is due to some lack of
  portability in the DejaGnu code.)
  
!    <p>Finally, you can run the testsuite (which may take a long time):
! <pre class="smallexample">     cd <var>objdir</var>; make -k check
! </pre>
!    <p>This will test various components of GCC, such as compiler
  front ends and runtime libraries.  While running the testsuite, DejaGnu
  might emit some harmless messages resembling
! &lsquo;<samp><span class="samp">WARNING: Couldn't find the global config file.</span></samp>&rsquo; or
! &lsquo;<samp><span class="samp">WARNING: Couldn't find tool init file</span></samp>&rsquo; that can be ignored.
! 
!    <p>If you are testing a cross-compiler, you may want to run the testsuite
  on a simulator as described at <a href="http://gcc.gnu.org/simtest-howto.html">http://gcc.gnu.org/simtest-howto.html</a>.
! 
! <h3 class="section"><a name="TOC0"></a>How can you run the testsuite on selected tests?</h3>
  
  <p>In order to run sets of tests selectively, there are targets
! &lsquo;<samp><span class="samp">make check-gcc</span></samp>&rsquo; and language specific &lsquo;<samp><span class="samp">make check-c</span></samp>&rsquo;,
! &lsquo;<samp><span class="samp">make check-c++</span></samp>&rsquo;, &lsquo;<samp><span class="samp">make check-fortran</span></samp>&rsquo;, &lsquo;<samp><span class="samp">make check-java</span></samp>&rsquo;,
! &lsquo;<samp><span class="samp">make check-ada</span></samp>&rsquo;, &lsquo;<samp><span class="samp">make check-objc</span></samp>&rsquo;, &lsquo;<samp><span class="samp">make check-obj-c++</span></samp>&rsquo;,
! &lsquo;<samp><span class="samp">make check-lto</span></samp>&rsquo;
! in the <samp><span class="file">gcc</span></samp> subdirectory of the object directory.  You can also
! just run &lsquo;<samp><span class="samp">make check</span></samp>&rsquo; in a subdirectory of the object directory.
  
!    <p>A more selective way to just run all <samp><span class="command">gcc</span></samp> execute tests in the
  testsuite is to use
  
! <pre class="smallexample">     make check-gcc RUNTESTFLAGS="execute.exp <var>other-options</var>"
! </pre>
!    <p>Likewise, in order to run only the <samp><span class="command">g++</span></samp> &ldquo;old-deja&rdquo; tests in
! the testsuite with filenames matching &lsquo;<samp><span class="samp">9805*</span></samp>&rsquo;, you would use
! 
! <pre class="smallexample">     make check-g++ RUNTESTFLAGS="old-deja.exp=9805* <var>other-options</var>"
! </pre>
!    <p>The <samp><span class="file">*.exp</span></samp> files are located in the testsuite directories of the GCC
! source, the most important ones being <samp><span class="file">compile.exp</span></samp>,
! <samp><span class="file">execute.exp</span></samp>, <samp><span class="file">dg.exp</span></samp> and <samp><span class="file">old-deja.exp</span></samp>. 
! To get a list of the possible <samp><span class="file">*.exp</span></samp> files, pipe the
! output of &lsquo;<samp><span class="samp">make check</span></samp>&rsquo; into a file and look at the
! &lsquo;<samp><span class="samp">Running ...  .exp</span></samp>&rsquo; lines.
  
! <h3 class="section"><a name="TOC1"></a>Passing options and running multiple testsuites</h3>
  
  <p>You can pass multiple options to the testsuite using the
! &lsquo;<samp><span class="samp">--target_board</span></samp>&rsquo; option of DejaGNU, either passed as part of
! &lsquo;<samp><span class="samp">RUNTESTFLAGS</span></samp>&rsquo;, or directly to <samp><span class="command">runtest</span></samp> if you prefer to
  work outside the makefiles.  For example,
  
! <pre class="smallexample">     make check-g++ RUNTESTFLAGS="--target_board=unix/-O3/-fmerge-constants"
! </pre>
!    <p>will run the standard <samp><span class="command">g++</span></samp> testsuites (&ldquo;unix&rdquo; is the target name
  for a standard native testsuite situation), passing
! &lsquo;<samp><span class="samp">-O3 -fmerge-constants</span></samp>&rsquo; to the compiler on every test, i.e.,
  slashes separate options.
! 
!    <p>You can run the testsuites multiple times using combinations of options
  with a syntax similar to the brace expansion of popular shells:
  
! <pre class="smallexample">     ..."--target_board=arm-sim\{-mhard-float,-msoft-float\}\{-O1,-O2,-O3,\}"
! </pre>
!    <p>(Note the empty option caused by the trailing comma in the final group.) 
! The following will run each testsuite eight times using the &lsquo;<samp><span class="samp">arm-sim</span></samp>&rsquo;
  target, as if you had specified all possible combinations yourself:
  
! <pre class="smallexample">     --target_board='arm-sim/-mhard-float/-O1 \
!                      arm-sim/-mhard-float/-O2 \
!                      arm-sim/-mhard-float/-O3 \
!                      arm-sim/-mhard-float \
!                      arm-sim/-msoft-float/-O1 \
!                      arm-sim/-msoft-float/-O2 \
!                      arm-sim/-msoft-float/-O3 \
!                      arm-sim/-msoft-float'
! </pre>
!    <p>They can be combined as many times as you wish, in arbitrary ways.  This
  list:
  
! <pre class="smallexample">     ..."--target_board=unix/-Wextra\{-O3,-fno-strength\}\{-fomit-frame,\}"
! </pre>
!    <p>will generate four combinations, all involving &lsquo;<samp><span class="samp">-Wextra</span></samp>&rsquo;.
! 
!    <p>The disadvantage to this method is that the testsuites are run in serial,
  which is a waste on multiprocessor systems.  For users with GNU Make and
  a shell which performs brace expansion, you can run the testsuites in
! parallel by having the shell perform the combinations and <samp><span class="command">make</span></samp>
! do the parallel runs.  Instead of using &lsquo;<samp><span class="samp">--target_board</span></samp>&rsquo;, use a
  special makefile target:
  
! <pre class="smallexample">     make -j<var>N</var> check-<var>testsuite</var>//<var>test-target</var>/<var>option1</var>/<var>option2</var>/...
! </pre>
!    <p>For example,
  
! <pre class="smallexample">     make -j3 check-gcc//sh-hms-sim/{-m1,-m2,-m3,-m3e,-m4}/{,-nofpu}
! </pre>
!    <p>will run three concurrent &ldquo;make-gcc&rdquo; testsuites, eventually testing all
  ten combinations as described above.  Note that this is currently only
! supported in the <samp><span class="file">gcc</span></samp> subdirectory.  (To see how this works, try
! typing <samp><span class="command">echo</span></samp> before the example given here.)
  
! <h3 class="section"><a name="TOC2"></a>Additional testing for Java Class Libraries</h3>
  
! <p>The Java runtime tests can be executed via &lsquo;<samp><span class="samp">make check</span></samp>&rsquo;
! in the <samp><var>target</var><span class="file">/libjava/testsuite</span></samp> directory in
  the build tree.
! 
!    <p>The <a href="http://sourceware.org/mauve/">Mauve Project</a> provides
  a suite of tests for the Java Class Libraries.  This suite can be run
  as part of libgcj testing by placing the Mauve tree within the libjava
! testsuite at <samp><span class="file">libjava/testsuite/libjava.mauve/mauve</span></samp>, or by
! specifying the location of that tree when invoking &lsquo;<samp><span class="samp">make</span></samp>&rsquo;, as in
! &lsquo;<samp><span class="samp">make MAUVEDIR=~/mauve check</span></samp>&rsquo;.
! 
! <h3 class="section"><a name="TOC3"></a>How to interpret test results</h3>
  
! <p>The result of running the testsuite are various <samp><span class="file">*.sum</span></samp> and <samp><span class="file">*.log</span></samp>
! files in the testsuite subdirectories.  The <samp><span class="file">*.log</span></samp> files contain a
  detailed log of the compiler invocations and the corresponding
! results, the <samp><span class="file">*.sum</span></samp> files summarize the results.  These summaries
  contain status codes for all tests:
  
!      <ul>
! <li>PASS: the test passed as expected
! <li>XPASS: the test unexpectedly passed
! <li>FAIL: the test unexpectedly failed
! <li>XFAIL: the test failed as expected
! <li>UNSUPPORTED: the test is not supported on this platform
! <li>ERROR: the testsuite detected an error
! <li>WARNING: the testsuite detected a possible problem
! </ul>
! 
!    <p>It is normal for some tests to report unexpected failures.  At the
  current time the testing harness does not allow fine grained control
  over whether or not a test is expected to fail.  This problem should
  be fixed in future releases.
  
! <h3 class="section"><a name="TOC4"></a>Submitting test results</h3>
  
  <p>If you want to report the results to the GCC project, use the
! <samp><span class="file">contrib/test_summary</span></samp> shell script.  Start it in the <var>objdir</var> with
  
! <pre class="smallexample">     <var>srcdir</var>/contrib/test_summary -p your_commentary.txt \
!          -m gcc-testresults@gcc.gnu.org |sh
! </pre>
!    <p>This script uses the <samp><span class="command">Mail</span></samp> program to send the results, so
! make sure it is in your <samp><span class="env">PATH</span></samp>.  The file <samp><span class="file">your_commentary.txt</span></samp> is
  prepended to the testsuite summary and should contain any special
  remarks you have on your results or your build environment.  Please
  do not edit the testsuite result block or the subject line, as these
  messages may be automatically processed.
! 
!    <p><hr />
  <p><a href="./index.html">Return to the GCC Installation page</a>
  
- <!-- ***Final install*********************************************************** -->
- <!-- ***Binaries**************************************************************** -->
- <!-- ***Specific**************************************************************** -->
- <!-- ***Old documentation****************************************************** -->
- <!-- ***GFDL******************************************************************** -->
- <!-- *************************************************************************** -->
- <!-- Part 6 The End of the Document -->
- </body></html>
  
--- 1,315 ----
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
! <html>
! <!-- Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
! Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.3 or
  any later version published by the Free Software Foundation; with no
  Invariant Sections, the Front-Cover texts being (a) (see below), and
  with the Back-Cover Texts being (b) (see below).  A copy of the
! license is included in the section entitled "GNU
! Free Documentation License".
  
  (a) The FSF's Front-Cover Text is:
  
! A GNU Manual
  
  (b) The FSF's Back-Cover Text is:
  
! You have freedom to copy and modify this GNU Manual, like GNU
       software.  Copies published by the Free Software Foundation raise
!      funds for GNU development. -->
! <!-- Created by GNU Texinfo 6.1, http://www.gnu.org/software/texinfo/ -->
! <head>
! <title>Installing GCC</title>
! 
! <meta name="description" content="Installing GCC">
! <meta name="keywords" content="Installing GCC">
! <meta name="resource-type" content="document">
! <meta name="distribution" content="global">
! <meta name="Generator" content="makeinfo">
! <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
! <style type="text/css">
! <!--
! a.summary-letter {text-decoration: none}
! blockquote.indentedblock {margin-right: 0em}
! blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
! blockquote.smallquotation {font-size: smaller}
! div.display {margin-left: 3.2em}
! div.example {margin-left: 3.2em}
! div.lisp {margin-left: 3.2em}
! div.smalldisplay {margin-left: 3.2em}
! div.smallexample {margin-left: 3.2em}
! div.smalllisp {margin-left: 3.2em}
! kbd {font-style: oblique}
! pre.display {font-family: inherit}
! pre.format {font-family: inherit}
! pre.menu-comment {font-family: serif}
! pre.menu-preformatted {font-family: serif}
! pre.smalldisplay {font-family: inherit; font-size: smaller}
! pre.smallexample {font-size: smaller}
! pre.smallformat {font-family: inherit; font-size: smaller}
! pre.smalllisp {font-size: smaller}
! span.nolinebreak {white-space: nowrap}
! span.roman {font-family: initial; font-weight: normal}
! span.sansserif {font-family: sans-serif; font-weight: normal}
! ul.no-bullet {list-style: none}
! -->
! </style>
! 
! 
  </head>
! 
! <body lang="en">
! <h1 class="settitle" align="center">Installing GCC</h1>
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! 
! <a name="index-Testing"></a>
! <a name="index-Installing-GCC_003a-Testing"></a>
! <a name="index-Testsuite"></a>
! 
! <p>Before you install GCC, we encourage you to run the testsuites and to
  compare your results with results from a similar configuration that have
  been submitted to the
! <a href="http://gcc.gnu.org/ml/gcc-testresults/">gcc-testresults mailing list</a>.
  Some of these archived results are linked from the build status lists
  at <a href="http://gcc.gnu.org/buildstat.html">http://gcc.gnu.org/buildstat.html</a>, although not everyone who
! reports a successful build runs the testsuites and submits the results.
  This step is optional and may require you to download additional software,
  but it can give you confidence in your new GCC installation or point out
  problems before you install and start using your new GCC.
! </p>
! <p>First, you must have <a href="download.html">downloaded the testsuites</a>.
  These are part of the full distribution, but if you downloaded the
  &ldquo;core&rdquo; compiler plus any front ends, you must download the testsuites
  separately.
! </p>
! <p>Second, you must have the testing tools installed.  This includes
  <a href="http://www.gnu.org/software/dejagnu/">DejaGnu</a>, Tcl, and Expect;
  the DejaGnu site has links to these.
! </p>
! <p>If the directories where <code>runtest</code> and <code>expect</code> were
! installed are not in the <code>PATH</code>, you may need to set the following
  environment variables appropriately, as in the following example (which
! assumes that DejaGnu has been installed under <samp>/usr/local</samp>):
! </p>
! <div class="smallexample">
! <pre class="smallexample">TCL_LIBRARY = /usr/local/share/tcl8.0
! DEJAGNULIBS = /usr/local/share/dejagnu
! </pre></div>
  
! <p>(On systems such as Cygwin, these paths are required to be actual
  paths, not mounts or links; presumably this is due to some lack of
  portability in the DejaGnu code.)
+ </p>
  
! <p>Finally, you can run the testsuite (which may take a long time):
! </p><div class="smallexample">
! <pre class="smallexample">cd <var>objdir</var>; make -k check
! </pre></div>
! 
! <p>This will test various components of GCC, such as compiler
  front ends and runtime libraries.  While running the testsuite, DejaGnu
  might emit some harmless messages resembling
! &lsquo;<samp>WARNING: Couldn't find the global config file.</samp>&rsquo; or
! &lsquo;<samp>WARNING: Couldn't find tool init file</samp>&rsquo; that can be ignored.
! </p>
! <p>If you are testing a cross-compiler, you may want to run the testsuite
  on a simulator as described at <a href="http://gcc.gnu.org/simtest-howto.html">http://gcc.gnu.org/simtest-howto.html</a>.
! </p>
! <a name="How-can-you-run-the-testsuite-on-selected-tests_003f"></a>
! <h3 class="section">How can you run the testsuite on selected tests?</h3>
  
  <p>In order to run sets of tests selectively, there are targets
! &lsquo;<samp>make check-gcc</samp>&rsquo; and language specific &lsquo;<samp>make check-c</samp>&rsquo;,
! &lsquo;<samp>make check-c++</samp>&rsquo;, &lsquo;<samp>make check-fortran</samp>&rsquo;, &lsquo;<samp>make check-java</samp>&rsquo;,
! &lsquo;<samp>make check-ada</samp>&rsquo;, &lsquo;<samp>make check-objc</samp>&rsquo;, &lsquo;<samp>make check-obj-c++</samp>&rsquo;,
! &lsquo;<samp>make check-lto</samp>&rsquo;
! in the <samp>gcc</samp> subdirectory of the object directory.  You can also
! just run &lsquo;<samp>make check</samp>&rsquo; in a subdirectory of the object directory.
! </p>
  
! <p>A more selective way to just run all <code>gcc</code> execute tests in the
  testsuite is to use
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">make check-gcc RUNTESTFLAGS=&quot;execute.exp <var>other-options</var>&quot;
+ </pre></div>
  
! <p>Likewise, in order to run only the <code>g++</code> &ldquo;old-deja&rdquo; tests in
! the testsuite with filenames matching &lsquo;<samp>9805*</samp>&rsquo;, you would use
! </p>
! <div class="smallexample">
! <pre class="smallexample">make check-g++ RUNTESTFLAGS=&quot;old-deja.exp=9805* <var>other-options</var>&quot;
! </pre></div>
  
! <p>The <samp>*.exp</samp> files are located in the testsuite directories of the GCC
! source, the most important ones being <samp>compile.exp</samp>,
! <samp>execute.exp</samp>, <samp>dg.exp</samp> and <samp>old-deja.exp</samp>.
! To get a list of the possible <samp>*.exp</samp> files, pipe the
! output of &lsquo;<samp>make check</samp>&rsquo; into a file and look at the
! &lsquo;<samp>Running &hellip;  .exp</samp>&rsquo; lines.
! </p>
! <a name="Passing-options-and-running-multiple-testsuites"></a>
! <h3 class="section">Passing options and running multiple testsuites</h3>
  
  <p>You can pass multiple options to the testsuite using the
! &lsquo;<samp>--target_board</samp>&rsquo; option of DejaGNU, either passed as part of
! &lsquo;<samp>RUNTESTFLAGS</samp>&rsquo;, or directly to <code>runtest</code> if you prefer to
  work outside the makefiles.  For example,
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">make check-g++ RUNTESTFLAGS=&quot;--target_board=unix/-O3/-fmerge-constants&quot;
+ </pre></div>
  
! <p>will run the standard <code>g++</code> testsuites (&ldquo;unix&rdquo; is the target name
  for a standard native testsuite situation), passing
! &lsquo;<samp>-O3 -fmerge-constants</samp>&rsquo; to the compiler on every test, i.e.,
  slashes separate options.
! </p>
! <p>You can run the testsuites multiple times using combinations of options
  with a syntax similar to the brace expansion of popular shells:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">&hellip;&quot;--target_board=arm-sim\{-mhard-float,-msoft-float\}\{-O1,-O2,-O3,\}&quot;
+ </pre></div>
  
! <p>(Note the empty option caused by the trailing comma in the final group.)
! The following will run each testsuite eight times using the &lsquo;<samp>arm-sim</samp>&rsquo;
  target, as if you had specified all possible combinations yourself:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">--target_board='arm-sim/-mhard-float/-O1 \
+                 arm-sim/-mhard-float/-O2 \
+                 arm-sim/-mhard-float/-O3 \
+                 arm-sim/-mhard-float \
+                 arm-sim/-msoft-float/-O1 \
+                 arm-sim/-msoft-float/-O2 \
+                 arm-sim/-msoft-float/-O3 \
+                 arm-sim/-msoft-float'
+ </pre></div>
  
! <p>They can be combined as many times as you wish, in arbitrary ways.  This
  list:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">&hellip;&quot;--target_board=unix/-Wextra\{-O3,-fno-strength\}\{-fomit-frame,\}&quot;
+ </pre></div>
  
! <p>will generate four combinations, all involving &lsquo;<samp>-Wextra</samp>&rsquo;.
! </p>
! <p>The disadvantage to this method is that the testsuites are run in serial,
  which is a waste on multiprocessor systems.  For users with GNU Make and
  a shell which performs brace expansion, you can run the testsuites in
! parallel by having the shell perform the combinations and <code>make</code>
! do the parallel runs.  Instead of using &lsquo;<samp>--target_board</samp>&rsquo;, use a
  special makefile target:
+ </p>
+ <div class="smallexample">
+ <pre class="smallexample">make -j<var>N</var> check-<var>testsuite</var>//<var>test-target</var>/<var>option1</var>/<var>option2</var>/&hellip;
+ </pre></div>
  
! <p>For example,
! </p>
! <div class="smallexample">
! <pre class="smallexample">make -j3 check-gcc//sh-hms-sim/{-m1,-m2,-m3,-m3e,-m4}/{,-nofpu}
! </pre></div>
  
! <p>will run three concurrent &ldquo;make-gcc&rdquo; testsuites, eventually testing all
  ten combinations as described above.  Note that this is currently only
! supported in the <samp>gcc</samp> subdirectory.  (To see how this works, try
! typing <code>echo</code> before the example given here.)
! </p>
  
! <a name="Additional-testing-for-Java-Class-Libraries"></a>
! <h3 class="section">Additional testing for Java Class Libraries</h3>
  
! <p>The Java runtime tests can be executed via &lsquo;<samp>make check</samp>&rsquo;
! in the <samp><var>target</var>/libjava/testsuite</samp> directory in
  the build tree.
! </p>
! <p>The <a href="http://sourceware.org/mauve/">Mauve Project</a> provides
  a suite of tests for the Java Class Libraries.  This suite can be run
  as part of libgcj testing by placing the Mauve tree within the libjava
! testsuite at <samp>libjava/testsuite/libjava.mauve/mauve</samp>, or by
! specifying the location of that tree when invoking &lsquo;<samp>make</samp>&rsquo;, as in
! &lsquo;<samp>make MAUVEDIR=~/mauve check</samp>&rsquo;.
! </p>
! <a name="How-to-interpret-test-results"></a>
! <h3 class="section">How to interpret test results</h3>
  
! <p>The result of running the testsuite are various <samp>*.sum</samp> and <samp>*.log</samp>
! files in the testsuite subdirectories.  The <samp>*.log</samp> files contain a
  detailed log of the compiler invocations and the corresponding
! results, the <samp>*.sum</samp> files summarize the results.  These summaries
  contain status codes for all tests:
+ </p>
+ <ul>
+ <li> PASS: the test passed as expected
+ </li><li> XPASS: the test unexpectedly passed
+ </li><li> FAIL: the test unexpectedly failed
+ </li><li> XFAIL: the test failed as expected
+ </li><li> UNSUPPORTED: the test is not supported on this platform
+ </li><li> ERROR: the testsuite detected an error
+ </li><li> WARNING: the testsuite detected a possible problem
+ </li></ul>
  
! <p>It is normal for some tests to report unexpected failures.  At the
  current time the testing harness does not allow fine grained control
  over whether or not a test is expected to fail.  This problem should
  be fixed in future releases.
+ </p>
  
! <a name="Submitting-test-results"></a>
! <h3 class="section">Submitting test results</h3>
  
  <p>If you want to report the results to the GCC project, use the
! <samp>contrib/test_summary</samp> shell script.  Start it in the <var>objdir</var> with
! </p>
! <div class="smallexample">
! <pre class="smallexample"><var>srcdir</var>/contrib/test_summary -p your_commentary.txt \
!     -m gcc-testresults@gcc.gnu.org |sh
! </pre></div>
  
! <p>This script uses the <code>Mail</code> program to send the results, so
! make sure it is in your <code>PATH</code>.  The file <samp>your_commentary.txt</samp> is
  prepended to the testsuite summary and should contain any special
  remarks you have on your results or your build environment.  Please
  do not edit the testsuite result block or the subject line, as these
  messages may be automatically processed.
! </p>
! <hr />
! <p>
  <p><a href="./index.html">Return to the GCC Installation page</a>
+ </p>
+ 
+ 
+ 
+ 
  
  
+ <hr>
+ 
+ 
+ 
+ </body>
+ </html>
diff -Nrcpad gcc-5.4.0/LAST_UPDATED gcc-5.5.0/LAST_UPDATED
*** gcc-5.4.0/LAST_UPDATED	Fri Jun  3 08:45:08 2016
--- gcc-5.5.0/LAST_UPDATED	Tue Oct 10 08:13:22 2017
***************
*** 1 ****
! Obtained from SVN: tags/gcc_5_4_0_release revision 237057
--- 1 ----
! Obtained from SVN: tags/gcc_5_5_0_release revision 253577
diff -Nrcpad gcc-5.4.0/MD5SUMS gcc-5.5.0/MD5SUMS
*** gcc-5.4.0/MD5SUMS	Fri Jun  3 10:51:57 2016
--- gcc-5.5.0/MD5SUMS	Tue Oct 10 10:01:12 2017
***************
*** 1,5 ****
  # This file contains the MD5 checksums of the files in the 
! # gcc-5.4.0.tar.bz2 tarball.
  #
  # Besides verifying that all files in the tarball were correctly expanded,
  # it also can be used to determine if any files have changed since the
--- 1,5 ----
  # This file contains the MD5 checksums of the files in the 
! # gcc-5.5.0.tar.xz tarball.
  #
  # Besides verifying that all files in the tarball were correctly expanded,
  # it also can be used to determine if any files have changed since the
*************** bda40697a9e2e23c4a52125fc1cc713d  .dir-l
*** 16,46 ****
  fe60d87048567d4fe8c8a0ed2448bcc8  COPYING.RUNTIME
  d32239bcb673463ab874e80d47fae504  COPYING3
  6a6a8e020838b23406c81b19c1d46df6  COPYING3.LIB
! 5d092149768913a01ead163a22e606a6  ChangeLog
  fd4ecdf5d672efe2b0e409aca9cf9446  ChangeLog.jit
  09538b708302f1735f6fa05b622ecf5e  ChangeLog.tree-ssa
  24ab760126489e69436a43185dc3d202  INSTALL/README
! 3c47fb6f8e8f7a7dcf0197d643772f00  INSTALL/binaries.html
! 83d5eec96b888bb6d9662eddaaa0af87  INSTALL/build.html
! deed6c23647cd0c6658f5559e81f7228  INSTALL/configure.html
! 1c35df4887f1a4748bd58d863af32714  INSTALL/download.html
! 182f3ca1425d1ccf637dd048e670c1f6  INSTALL/finalinstall.html
! f24b4999e0b38760db90dbb5acf5a2d4  INSTALL/gfdl.html
! 7bd1f7ee719ca2fc0abb6c5965935367  INSTALL/index.html
! 620f6dbef9699a9bde5d78980fbfaaa0  INSTALL/old.html
! 1a6f4f0588c3cf170269287338f18dea  INSTALL/prerequisites.html
! 36d70b7c38be6c8d6753987febe8d485  INSTALL/specific.html
! 0d630039c49eda6f5ade37d8aecbf88b  INSTALL/test.html
! f6873d0d2abe39a0d1aa67d2a1786f32  LAST_UPDATED
  cd5f112e9356a1c67c34f8b5d26f7370  MAINTAINERS
  970024246430a5feb4c2c064745219ef  Makefile.def
  1b3f7a8b563f58c5a7c6278e58be1c72  Makefile.in
  7b9a0ae00e8eb0afe268caaf603a9e4d  Makefile.tpl
! 0255fa2580776af4ceef3ea869535c9d  NEWS
  80d26bc3b1ad4f6969a96a24c9181bf5  README
  b510a5285eb05298b5f3d9f5ae920588  boehm-gc/AmigaOS.c
  2caafacabf758bb76a9dfce1fc544b97  boehm-gc/BCC_MAKEFILE
! cf9548348750e17ea0083dbc732a79d1  boehm-gc/ChangeLog
  c18075e3729cd116028480307a8e845d  boehm-gc/EMX_MAKEFILE
  3b7cc3be9ed3c2135bbda990e8a69303  boehm-gc/MacOS.c
  5cf7764626b7dd7272b2fe11403d1b6a  boehm-gc/MacProjects.sit.hqx
--- 16,46 ----
  fe60d87048567d4fe8c8a0ed2448bcc8  COPYING.RUNTIME
  d32239bcb673463ab874e80d47fae504  COPYING3
  6a6a8e020838b23406c81b19c1d46df6  COPYING3.LIB
! 0da82d838d522e4076f0af89e2e8aa9b  ChangeLog
  fd4ecdf5d672efe2b0e409aca9cf9446  ChangeLog.jit
  09538b708302f1735f6fa05b622ecf5e  ChangeLog.tree-ssa
  24ab760126489e69436a43185dc3d202  INSTALL/README
! e6b4c8634cf482e7e607329110feab48  INSTALL/binaries.html
! 0179491ead3dacd381d82397f8442459  INSTALL/build.html
! b42d0884ad05dd5e2204191fb9fdd40a  INSTALL/configure.html
! 1ca0e2d33dcae6c5fb099d939810a1bb  INSTALL/download.html
! 9edb5dca75f3e2a67e51d65f97885857  INSTALL/finalinstall.html
! 03e5990246402f1d69b80a1422da7817  INSTALL/gfdl.html
! c8ae4ea43a19223131e237d0e914d709  INSTALL/index.html
! ca4bd237667ffa3df845eb057ada2c00  INSTALL/old.html
! 9783a0d0db4ce14973d450b01d990398  INSTALL/prerequisites.html
! b73d08ccd5ccbb77c62f7ef9a4f0f8ab  INSTALL/specific.html
! 34ea2c01b45e92c8f903f14736b26af7  INSTALL/test.html
! 075b40a77cf8c35ecdda8bb5ba827891  LAST_UPDATED
  cd5f112e9356a1c67c34f8b5d26f7370  MAINTAINERS
  970024246430a5feb4c2c064745219ef  Makefile.def
  1b3f7a8b563f58c5a7c6278e58be1c72  Makefile.in
  7b9a0ae00e8eb0afe268caaf603a9e4d  Makefile.tpl
! 3d20b44987649ffc8e00044c5905e64c  NEWS
  80d26bc3b1ad4f6969a96a24c9181bf5  README
  b510a5285eb05298b5f3d9f5ae920588  boehm-gc/AmigaOS.c
  2caafacabf758bb76a9dfce1fc544b97  boehm-gc/BCC_MAKEFILE
! a7b3d81f0c83735f8fb7631a81f1cc63  boehm-gc/ChangeLog
  c18075e3729cd116028480307a8e845d  boehm-gc/EMX_MAKEFILE
  3b7cc3be9ed3c2135bbda990e8a69303  boehm-gc/MacOS.c
  5cf7764626b7dd7272b2fe11403d1b6a  boehm-gc/MacProjects.sit.hqx
*************** b04a1232318128ebd7c630fca10d02e5  boehm-
*** 218,225 ****
  6659351ae2c4d772f3ebf8986f000187  config-ml.in
  c53118f6682ac1db40935d5705145d5a  config.guess
  040359150cf11493f973a46d8a25b06b  config.rpath
! e768d6a5b46753aeb6800eefb4b2540e  config.sub
! 43e84e9f43f28f61ac9f23451e361927  config/ChangeLog
  0fcd4badfe2a2191778bdf5ab94aa40c  config/acinclude.m4
  9238d23c68259d195b332db71892d242  config/acx.m4
  6b030f5cf640bdd401ea739f54a667f8  config/asmcfi.m4
--- 218,225 ----
  6659351ae2c4d772f3ebf8986f000187  config-ml.in
  c53118f6682ac1db40935d5705145d5a  config.guess
  040359150cf11493f973a46d8a25b06b  config.rpath
! 0640fa7bb2c9e2a129023b2d4146a6ea  config.sub
! 67a320561054bfb55749919497d60eeb  config/ChangeLog
  0fcd4badfe2a2191778bdf5ab94aa40c  config/acinclude.m4
  9238d23c68259d195b332db71892d242  config/acx.m4
  6b030f5cf640bdd401ea739f54a667f8  config/asmcfi.m4
*************** b0d2f2e937c16091b330451e6883c4b6  config
*** 304,312 ****
  b6afa5c33fb98edfaf591dd38d198b0d  config/warnings.m4
  7ef51b0adb98e5c5f7aba46d2c7293f1  config/weakref.m4
  e249d18c447a8372fd1ed5f084284d6b  config/zlib.m4
! 5874952f5a7f208ffd14773543ff9370  configure
! 58f9366f520e563310c08ba7db984a36  configure.ac
! 2b6f3f86ab4b35b8037b8293305177b3  contrib/ChangeLog
  5fc435c7928f858246df931ea3f3ece7  contrib/ChangeLog.jit
  7af8d2979bf1a7cfa88e30d05fa22be2  contrib/ChangeLog.tree-ssa
  e0ea80d7094bf66610f2f60db444f9a1  contrib/analyze_brprob
--- 304,312 ----
  b6afa5c33fb98edfaf591dd38d198b0d  config/warnings.m4
  7ef51b0adb98e5c5f7aba46d2c7293f1  config/weakref.m4
  e249d18c447a8372fd1ed5f084284d6b  config/zlib.m4
! dc2767a18742156ece13aaff9ab34e1d  configure
! e046523f3946ed86d9971864a4d7f76b  configure.ac
! c283b02eb93787925d9f34bf50db74a9  contrib/ChangeLog
  5fc435c7928f858246df931ea3f3ece7  contrib/ChangeLog.jit
  7af8d2979bf1a7cfa88e30d05fa22be2  contrib/ChangeLog.tree-ssa
  e0ea80d7094bf66610f2f60db444f9a1  contrib/analyze_brprob
*************** db03e57377f9eb202b7b783eb81fe40d  contri
*** 330,336 ****
  2e831f673656f3052f95930c3203cce9  contrib/filter_params.pl
  480dbaa133b74e68d41762d6596bd034  contrib/gcc.doxy
  55236e85d8087042189b701cd05d84be  contrib/gcc_build
! 68189b08923cd7e2ae6b2d16331211a3  contrib/gcc_update
  943aca0ab8b0e1d785c8cf39ac71e8fb  contrib/gennews
  59304fc08afa489baa6b920cc76dc625  contrib/gthr_supp_vxw_5x.c
  fa945bac89ee68b410027dcfe1312f4b  contrib/index-prop
--- 330,336 ----
  2e831f673656f3052f95930c3203cce9  contrib/filter_params.pl
  480dbaa133b74e68d41762d6596bd034  contrib/gcc.doxy
  55236e85d8087042189b701cd05d84be  contrib/gcc_build
! a3ab34d76188a280d9b03da3d054d6f2  contrib/gcc_update
  943aca0ab8b0e1d785c8cf39ac71e8fb  contrib/gennews
  59304fc08afa489baa6b920cc76dc625  contrib/gthr_supp_vxw_5x.c
  fa945bac89ee68b410027dcfe1312f4b  contrib/index-prop
*************** a7318fa2f0580c3a0d5dd4b14e4d0e0d  contri
*** 341,347 ****
  0fb5c8c3cd465d8bd57b55b2548c683a  contrib/paranoia.cc
  9083c56c1c89c5bec355a27f78e49807  contrib/patch_tester.sh
  87a19b40fbd220938cf6c23c42c255e2  contrib/prepare_patch.sh
! cd349550b43bea3c23bd5e2742f12768  contrib/reghunt/ChangeLog
  cf247a580e49d212518de409793db0a8  contrib/reghunt/bin/gcc-build-full
  724e70ea3e80f87f2a201bbe2f1eef37  contrib/reghunt/bin/gcc-build-simple
  3f2318bae7562a4ad1639e686916a545  contrib/reghunt/bin/gcc-cleanup
--- 341,347 ----
  0fb5c8c3cd465d8bd57b55b2548c683a  contrib/paranoia.cc
  9083c56c1c89c5bec355a27f78e49807  contrib/patch_tester.sh
  87a19b40fbd220938cf6c23c42c255e2  contrib/prepare_patch.sh
! 4a33979c9b24048f08547df9bbd79c19  contrib/reghunt/ChangeLog
  cf247a580e49d212518de409793db0a8  contrib/reghunt/bin/gcc-build-full
  724e70ea3e80f87f2a201bbe2f1eef37  contrib/reghunt/bin/gcc-build-simple
  3f2318bae7562a4ad1639e686916a545  contrib/reghunt/bin/gcc-cleanup
*************** f251d49dd87647250fcd74dd50b7835f  contri
*** 400,406 ****
  e2829fc4af4f433a6a328a62d5ce8066  contrib/reghunt/examples/reg-watch
  afd863c2ec84c906e20f9b9787b1f0fe  contrib/reghunt/examples/reg-watch.awk
  8955535523d4b5f48006bcb851ba9b4b  contrib/reghunt/examples/testall
! 5eb0eeb506cbb72d80ec7270fd5cfcc0  contrib/regression/ChangeLog
  30553bfced1b2b46bf7ca01ef6ba69d1  contrib/regression/GCC_Regression_Tester.wdgt/Default.png
  ad38ddd771df222eb9d413e3c7f6a751  contrib/regression/GCC_Regression_Tester.wdgt/Icon.png
  777bd286c147cc02861811f66b9a4440  contrib/regression/GCC_Regression_Tester.wdgt/Info.plist
--- 400,406 ----
  e2829fc4af4f433a6a328a62d5ce8066  contrib/reghunt/examples/reg-watch
  afd863c2ec84c906e20f9b9787b1f0fe  contrib/reghunt/examples/reg-watch.awk
  8955535523d4b5f48006bcb851ba9b4b  contrib/reghunt/examples/testall
! 3eb1badfc587312580c3fab507818c54  contrib/regression/ChangeLog
  30553bfced1b2b46bf7ca01ef6ba69d1  contrib/regression/GCC_Regression_Tester.wdgt/Default.png
  ad38ddd771df222eb9d413e3c7f6a751  contrib/regression/GCC_Regression_Tester.wdgt/Icon.png
  777bd286c147cc02861811f66b9a4440  contrib/regression/GCC_Regression_Tester.wdgt/Info.plist
*************** e00fa8f7dd72b80ca5a64130e85fe4f4  contri
*** 425,431 ****
  d25174fd04b32bbeab5f3cc783277ec1  contrib/vimrc
  7cb42cbdf8becd280d1e16191416fb62  contrib/warn_summary
  8b59f0d0a2dcdced14765c514fbad719  depcomp
! 7f5ef79d39498d120755072c347466f8  fixincludes/ChangeLog
  c23ba4c4f4ca4dfcdd9b4155e4626da7  fixincludes/Makefile.in
  b6e3f4950abc6e254b467063381f6473  fixincludes/README
  455903ad4ff71fa5c5340ef7ae41a0e6  fixincludes/README-fixinc
--- 425,431 ----
  d25174fd04b32bbeab5f3cc783277ec1  contrib/vimrc
  7cb42cbdf8becd280d1e16191416fb62  contrib/warn_summary
  8b59f0d0a2dcdced14765c514fbad719  depcomp
! 8dcef2c8409fdecfeef7104c45499620  fixincludes/ChangeLog
  c23ba4c4f4ca4dfcdd9b4155e4626da7  fixincludes/Makefile.in
  b6e3f4950abc6e254b467063381f6473  fixincludes/README
  455903ad4ff71fa5c5340ef7ae41a0e6  fixincludes/README-fixinc
*************** e06760e2aaa65a20f4f201cf50e62a16  fixinc
*** 438,450 ****
  497da58c4b47627a33f754b61f6eb051  fixincludes/fixinc.in
  9662d8ad173553c438e3ad3fc9db8352  fixincludes/fixincl.c
  e1cd70e73f3c2d2319fd9d210ad6a5ff  fixincludes/fixincl.tpl
! d33530ec7e9f3e90e5d05664f08458d7  fixincludes/fixincl.x
  47da6e634225e1667c26a71bcf234bfa  fixincludes/fixlib.c
  d8aac376a7311e465eb0a98d341103a1  fixincludes/fixlib.h
  5b2c1fd3ef9d44fb6beb1a0d45ddd533  fixincludes/fixopts.c
  ed1415e9dbc8f421fd9288bde0d90ad1  fixincludes/fixtests.c
  6df145c7cea1e2099cf97a0d83564aca  fixincludes/genfixes
! 052121f87ed1928d7b0b7be1850ce33b  fixincludes/inclhack.def
  6e093a147c4e377aa751d74c82d0bd87  fixincludes/mkfixinc.sh
  5f9960cfe65b2e6bef658f770e52dfef  fixincludes/mkheaders.in
  3aa0563cd682ee61ecd9eb6eea0b0bce  fixincludes/procopen.c
--- 438,450 ----
  497da58c4b47627a33f754b61f6eb051  fixincludes/fixinc.in
  9662d8ad173553c438e3ad3fc9db8352  fixincludes/fixincl.c
  e1cd70e73f3c2d2319fd9d210ad6a5ff  fixincludes/fixincl.tpl
! 83114f967cd54b5b60c832c757e01ba5  fixincludes/fixincl.x
  47da6e634225e1667c26a71bcf234bfa  fixincludes/fixlib.c
  d8aac376a7311e465eb0a98d341103a1  fixincludes/fixlib.h
  5b2c1fd3ef9d44fb6beb1a0d45ddd533  fixincludes/fixopts.c
  ed1415e9dbc8f421fd9288bde0d90ad1  fixincludes/fixtests.c
  6df145c7cea1e2099cf97a0d83564aca  fixincludes/genfixes
! 82ed4f7738ae28aefeb366ab5ce195a7  fixincludes/inclhack.def
  6e093a147c4e377aa751d74c82d0bd87  fixincludes/mkfixinc.sh
  5f9960cfe65b2e6bef658f770e52dfef  fixincludes/mkheaders.in
  3aa0563cd682ee61ecd9eb6eea0b0bce  fixincludes/procopen.c
*************** bfb58e3983fc133c965e434e57aed732  fixinc
*** 482,495 ****
  a11561f51aa57e84e571f2073fb6bf60  fixincludes/tests/base/ioLib.h
  c8dd71b57c3a35b0c6760f7d38af6f42  fixincludes/tests/base/iso/math_c99.h
  56aa16fdf3be46d7dc2b462246495f82  fixincludes/tests/base/iso/math_iso.h
! 5b48936adb644e9aa4b78d21297cc193  fixincludes/tests/base/iso/stdio_iso.h
  e1bd28539aceeab13a3028da02f8c4ae  fixincludes/tests/base/iso/stdlib_iso.h
  1ac942b363960bf8a865ffd9e3bf28be  fixincludes/tests/base/linux/vt.h
  8183eabf96be2918f3259a587329a813  fixincludes/tests/base/locale.h
  8ac97a3367b9a99503c5b21430993cd4  fixincludes/tests/base/mach-o/dyld.h
  dbbbc9ead412bbd125f56bc509994066  fixincludes/tests/base/mach-o/swap.h
  8d51a42a0868b670ec996069f42cae57  fixincludes/tests/base/malloc.h
! 1af0b5352f93a74d46e55cee6e40773c  fixincludes/tests/base/math.h
  d2cbc665e9046f8acb42c1271592be47  fixincludes/tests/base/net/if.h
  98099ff70c675f84c19b58da050f3712  fixincludes/tests/base/net/if_arp.h
  a911f5fbb127353024e77149fcf90596  fixincludes/tests/base/netdnet/dnetdb.h
--- 482,496 ----
  a11561f51aa57e84e571f2073fb6bf60  fixincludes/tests/base/ioLib.h
  c8dd71b57c3a35b0c6760f7d38af6f42  fixincludes/tests/base/iso/math_c99.h
  56aa16fdf3be46d7dc2b462246495f82  fixincludes/tests/base/iso/math_iso.h
! cb3e756a4d569b97af1ed7a9d48ff57b  fixincludes/tests/base/iso/stdio_iso.h
! 1c72f8feabf8899114770389de731d90  fixincludes/tests/base/iso/stdlib_c99.h
  e1bd28539aceeab13a3028da02f8c4ae  fixincludes/tests/base/iso/stdlib_iso.h
  1ac942b363960bf8a865ffd9e3bf28be  fixincludes/tests/base/linux/vt.h
  8183eabf96be2918f3259a587329a813  fixincludes/tests/base/locale.h
  8ac97a3367b9a99503c5b21430993cd4  fixincludes/tests/base/mach-o/dyld.h
  dbbbc9ead412bbd125f56bc509994066  fixincludes/tests/base/mach-o/swap.h
  8d51a42a0868b670ec996069f42cae57  fixincludes/tests/base/malloc.h
! 72c7a983f178e7690e3642c6e8408d67  fixincludes/tests/base/math.h
  d2cbc665e9046f8acb42c1271592be47  fixincludes/tests/base/net/if.h
  98099ff70c675f84c19b58da050f3712  fixincludes/tests/base/net/if_arp.h
  a911f5fbb127353024e77149fcf90596  fixincludes/tests/base/netdnet/dnetdb.h
*************** d2f1ddef1ca3edae298e37f7bc892941  fixinc
*** 523,531 ****
  563eddf934e21ec7f85628e18fb1c641  fixincludes/tests/base/stdint-hpux11.h
  cc3783f241fa992a305aced8e1195ee9  fixincludes/tests/base/stdint-newlib.h
  1ee4e2b61ae5781d35271f3181927037  fixincludes/tests/base/stdint.h
! bd72848710b6f098f5e44218bfe3202e  fixincludes/tests/base/stdio.h
  1887d8bc1711dae9922852cda6027877  fixincludes/tests/base/stdio_tag.h
! a35ebd909f0105b249e3af1c1b5826ab  fixincludes/tests/base/stdlib.h
  42a7de17fb8f2ac74bc30c7029199637  fixincludes/tests/base/string.h
  6931e261dc1cecb7983279cf909bd784  fixincludes/tests/base/strings.h
  127183621f8b29d6912c683be6102135  fixincludes/tests/base/sundev/vuid_event.h
--- 524,532 ----
  563eddf934e21ec7f85628e18fb1c641  fixincludes/tests/base/stdint-hpux11.h
  cc3783f241fa992a305aced8e1195ee9  fixincludes/tests/base/stdint-newlib.h
  1ee4e2b61ae5781d35271f3181927037  fixincludes/tests/base/stdint.h
! d47412644cdea4f030ba2744eca6d8ad  fixincludes/tests/base/stdio.h
  1887d8bc1711dae9922852cda6027877  fixincludes/tests/base/stdio_tag.h
! 6b842aa18e09c73db745cbffa3cb34cf  fixincludes/tests/base/stdlib.h
  42a7de17fb8f2ac74bc30c7029199637  fixincludes/tests/base/string.h
  6931e261dc1cecb7983279cf909bd784  fixincludes/tests/base/strings.h
  127183621f8b29d6912c683be6102135  fixincludes/tests/base/sundev/vuid_event.h
*************** a5e817d35ded04a0fb03999b50c0e89e  fixinc
*** 556,567 ****
  955462b555900ecd3934223c64e21fa7  fixincludes/tests/base/types/vxTypesBase.h
  c78e762f2c91f2af991feda7d3d7f4b2  fixincludes/tests/base/unistd.h
  587149fa20a733d9e098696d686977c6  gcc/ABOUT-GCC-NLS
! 6741b8327f57554228448c0c595455be  gcc/BASE-VER
  59530bdf33659b29e73d4adb9f9f6552  gcc/COPYING
  a916467b91076e631dd8edb7424769c7  gcc/COPYING.LIB
  d32239bcb673463ab874e80d47fae504  gcc/COPYING3
  6a6a8e020838b23406c81b19c1d46df6  gcc/COPYING3.LIB
! a9d50c57fe142855dc32e8084d1094ee  gcc/ChangeLog
  a3b63c675afa7a655cc2bfa8a907af79  gcc/ChangeLog-1997
  d9a88529352a010253c2e8fb1ed6023b  gcc/ChangeLog-1998
  240f08f81cb4699e8b49347db38233db  gcc/ChangeLog-1999
--- 557,568 ----
  955462b555900ecd3934223c64e21fa7  fixincludes/tests/base/types/vxTypesBase.h
  c78e762f2c91f2af991feda7d3d7f4b2  fixincludes/tests/base/unistd.h
  587149fa20a733d9e098696d686977c6  gcc/ABOUT-GCC-NLS
! 2a3694a12faeea6cb2e2a93d24763524  gcc/BASE-VER
  59530bdf33659b29e73d4adb9f9f6552  gcc/COPYING
  a916467b91076e631dd8edb7424769c7  gcc/COPYING.LIB
  d32239bcb673463ab874e80d47fae504  gcc/COPYING3
  6a6a8e020838b23406c81b19c1d46df6  gcc/COPYING3.LIB
! 0dc353794d6870ab8bb3f9dc259f3380  gcc/ChangeLog
  a3b63c675afa7a655cc2bfa8a907af79  gcc/ChangeLog-1997
  d9a88529352a010253c2e8fb1ed6023b  gcc/ChangeLog-1998
  240f08f81cb4699e8b49347db38233db  gcc/ChangeLog-1999
*************** fb3fadb88e1d2b3b640cfaaa5ff11780  gcc/Ch
*** 588,606 ****
  3eb07e0b2e542409bf73d359f7f65609  gcc/ChangeLog.ptr
  e13638e26743ba41e6011b76cc00d9a9  gcc/ChangeLog.tree-ssa
  739ab47f6425bcea1d05e4fc0542de54  gcc/ChangeLog.tuples
! b052afbc7c95abf8caf1fac822be8435  gcc/DATESTAMP
  d41d8cd98f00b204e9800998ecf8427e  gcc/DEV-PHASE
  eb92e1ff5e982ca07e173e0eb286d243  gcc/FSFChangeLog
  30e1e33411566388b3164558482dc5e6  gcc/FSFChangeLog.10
  36698274bb69e2ada20f5cc434f3caa5  gcc/FSFChangeLog.11
  2e751e6a73ca8d8a30485ca6692e2c84  gcc/LANGUAGES
! 6ee67b347506f839bbf836f6cde921de  gcc/Makefile.in
  ec6799501b2eb2923d5de6a66169dbd2  gcc/ONEWS
  120659b070a9b2c969a4b75b395264a3  gcc/README.Portability
  7c2ba8bf83836f2b614b714910a10374  gcc/acinclude.m4
  ae65aa6c66dde3e0d058e94edef41159  gcc/aclocal.m4
  9063d23e571fcde20283b9f34d5e3422  gcc/ada/9drpc.adb
! c49f99b2fd36006d2e53acc3c1605e8a  gcc/ada/ChangeLog
  683be0b07dc4f64f118fd5e8ae9cb30d  gcc/ada/ChangeLog-2001
  7aff25efb203be4136b8776cdc812956  gcc/ada/ChangeLog-2002
  cd2379152000f40157d349018fb9364d  gcc/ada/ChangeLog-2003
--- 589,607 ----
  3eb07e0b2e542409bf73d359f7f65609  gcc/ChangeLog.ptr
  e13638e26743ba41e6011b76cc00d9a9  gcc/ChangeLog.tree-ssa
  739ab47f6425bcea1d05e4fc0542de54  gcc/ChangeLog.tuples
! 2bd49d1a54a9dcc97dc57e3f2dd7913f  gcc/DATESTAMP
  d41d8cd98f00b204e9800998ecf8427e  gcc/DEV-PHASE
  eb92e1ff5e982ca07e173e0eb286d243  gcc/FSFChangeLog
  30e1e33411566388b3164558482dc5e6  gcc/FSFChangeLog.10
  36698274bb69e2ada20f5cc434f3caa5  gcc/FSFChangeLog.11
  2e751e6a73ca8d8a30485ca6692e2c84  gcc/LANGUAGES
! 760f59329fa3429abb9ba9a4f3531866  gcc/Makefile.in
  ec6799501b2eb2923d5de6a66169dbd2  gcc/ONEWS
  120659b070a9b2c969a4b75b395264a3  gcc/README.Portability
  7c2ba8bf83836f2b614b714910a10374  gcc/acinclude.m4
  ae65aa6c66dde3e0d058e94edef41159  gcc/aclocal.m4
  9063d23e571fcde20283b9f34d5e3422  gcc/ada/9drpc.adb
! 9d341465f2f8769b221d072f81309b81  gcc/ada/ChangeLog
  683be0b07dc4f64f118fd5e8ae9cb30d  gcc/ada/ChangeLog-2001
  7aff25efb203be4136b8776cdc812956  gcc/ada/ChangeLog-2002
  cd2379152000f40157d349018fb9364d  gcc/ada/ChangeLog-2003
*************** b2c8517ffdfa5ed42812bba69004f6f2  gcc/ad
*** 1604,1625 ****
  d7eca93022b3adc8f4a61dbe910e95d2  gcc/ada/g-zspche.adb
  b45654446bc74bb68ae4adef78906e9b  gcc/ada/g-zspche.ads
  c97edf7ce39a908dcaec55eb49d0abee  gcc/ada/g-zstspl.ads
! 33d32de74caf3d86db4b781e675dd2aa  gcc/ada/gcc-interface/Make-lang.in
! c3a36a4f67d6315f71676376371ac522  gcc/ada/gcc-interface/Makefile.in
  d47cdfac076a7e474979da4139393b39  gcc/ada/gcc-interface/ada-tree.def
  d47dc0c31f258f672bcecc576e71a514  gcc/ada/gcc-interface/ada-tree.h
  51c95420b5900990141d2e5705582197  gcc/ada/gcc-interface/ada.h
  4cbfd794461da0feb1b8661ec623b6c6  gcc/ada/gcc-interface/config-lang.in
  66402a51fb406b0ffee8ab719c87e33a  gcc/ada/gcc-interface/cuintp.c
! 1c72cc459da519f66d71bf281c490d50  gcc/ada/gcc-interface/decl.c
  c413d4d50e9563859f4d751a4404b705  gcc/ada/gcc-interface/gadaint.h
  b5f692cb8a996200b0b74368d2ea8767  gcc/ada/gcc-interface/gigi.h
  551c6c4d04e4f9c63340554e826c7bed  gcc/ada/gcc-interface/lang-specs.h
  f4ffb206fe0e51f054ea66a5daaa32ff  gcc/ada/gcc-interface/lang.opt
  4f4f9150d2ee818c9bfeb1525b8bc214  gcc/ada/gcc-interface/misc.c
  5ff1273ef9fbbe42050bdee94a4c59b5  gcc/ada/gcc-interface/targtyps.c
! 21af3add320aaf7c84678d5c1fdca626  gcc/ada/gcc-interface/trans.c
! 4c50a86cef4642b81a6362663f241efb  gcc/ada/gcc-interface/utils.c
  9040b9059d947fab18e31e45917c903f  gcc/ada/gcc-interface/utils2.c
  68b13816c95338a03ea3b161c2099ea1  gcc/ada/get_scos.adb
  baa8fdaf8d693eb6c5a7e42944887584  gcc/ada/get_scos.ads
--- 1605,1626 ----
  d7eca93022b3adc8f4a61dbe910e95d2  gcc/ada/g-zspche.adb
  b45654446bc74bb68ae4adef78906e9b  gcc/ada/g-zspche.ads
  c97edf7ce39a908dcaec55eb49d0abee  gcc/ada/g-zstspl.ads
! 7da1eddb6818aab1e96c9ef9f698372a  gcc/ada/gcc-interface/Make-lang.in
! a527b75e1a7bffd7532a43e2fc85b74a  gcc/ada/gcc-interface/Makefile.in
  d47cdfac076a7e474979da4139393b39  gcc/ada/gcc-interface/ada-tree.def
  d47dc0c31f258f672bcecc576e71a514  gcc/ada/gcc-interface/ada-tree.h
  51c95420b5900990141d2e5705582197  gcc/ada/gcc-interface/ada.h
  4cbfd794461da0feb1b8661ec623b6c6  gcc/ada/gcc-interface/config-lang.in
  66402a51fb406b0ffee8ab719c87e33a  gcc/ada/gcc-interface/cuintp.c
! 1c5be3f286ea70975ab0dcabf83e082a  gcc/ada/gcc-interface/decl.c
  c413d4d50e9563859f4d751a4404b705  gcc/ada/gcc-interface/gadaint.h
  b5f692cb8a996200b0b74368d2ea8767  gcc/ada/gcc-interface/gigi.h
  551c6c4d04e4f9c63340554e826c7bed  gcc/ada/gcc-interface/lang-specs.h
  f4ffb206fe0e51f054ea66a5daaa32ff  gcc/ada/gcc-interface/lang.opt
  4f4f9150d2ee818c9bfeb1525b8bc214  gcc/ada/gcc-interface/misc.c
  5ff1273ef9fbbe42050bdee94a4c59b5  gcc/ada/gcc-interface/targtyps.c
! e67f1bfaa7b0ac202794040f0db1a104  gcc/ada/gcc-interface/trans.c
! 848028df3bc90b31b64af1ad23e1cb3a  gcc/ada/gcc-interface/utils.c
  9040b9059d947fab18e31e45917c903f  gcc/ada/gcc-interface/utils2.c
  68b13816c95338a03ea3b161c2099ea1  gcc/ada/get_scos.adb
  baa8fdaf8d693eb6c5a7e42944887584  gcc/ada/get_scos.ads
*************** eb4c8837635c9eb468f723f079536a7c  gcc/ad
*** 2597,2632 ****
  d36e0605a7f68f541648e49af4e5d6ef  gcc/ada/symbols.adb
  28a22b1808efb5a1733162bd32c60ad3  gcc/ada/symbols.ads
  e26b70f48ee4c94add7aaf357194e4e2  gcc/ada/sysdep.c
! 2c55aa57650eb30a3706ca849b877bd5  gcc/ada/system-aix.ads
! 846096ddc8a78e9ca82332076253fab8  gcc/ada/system-aix64.ads
  82c74a2538796d1beeca8da504a6d7e4  gcc/ada/system-darwin-ppc.ads
! 1e1ff18fe6ca56610e9441eb07bf857c  gcc/ada/system-darwin-ppc64.ads
  c66a9b1480366153de25dd6bfaaf7667  gcc/ada/system-darwin-x86.ads
  4812519f69754a96fd52969c31dc2f22  gcc/ada/system-darwin-x86_64.ads
  3862b6839d964129c4af05da88d94e00  gcc/ada/system-freebsd-x86.ads
  8d88642b253a265dbb4dc0ca120b8893  gcc/ada/system-freebsd-x86_64.ads
! 38ab27e275dcb6e5e236ba7fc92143ec  gcc/ada/system-hpux-ia64.ads
! ce52ac32fcc58c55a854adcd8ed6ad21  gcc/ada/system-hpux.ads
! c922e708900b8f3272f42cebafe7e309  gcc/ada/system-linux-alpha.ads
! ee9d5ebb7e4c499c0cf83a2c365eaefe  gcc/ada/system-linux-armeb.ads
  cce6f082de2921a93f6df9f5cfc8bf27  gcc/ada/system-linux-armel.ads
! d55a5e20cf1ab4923e03b0a1cc388adb  gcc/ada/system-linux-hppa.ads
! 1db83d650d7ee4be0c13b7e48dad3ac4  gcc/ada/system-linux-ia64.ads
! da3ec01413885aa0914988b820af2f01  gcc/ada/system-linux-mips.ads
! d1752a99af1eede6644030235c70c15f  gcc/ada/system-linux-mips64el.ads
! d46860c67f7a1cb1133c0ee41f8ca418  gcc/ada/system-linux-mipsel.ads
! 7faee0bcd9961b0b9fe8366a372a656b  gcc/ada/system-linux-ppc.ads
! 62d514d6c90ba5d68cdbb05552c5c38e  gcc/ada/system-linux-ppc64.ads
! 7d21f556610d530f88fffd1ab083b996  gcc/ada/system-linux-s390.ads
! 4cf1d83ecef88dd9c32572e00758fe43  gcc/ada/system-linux-s390x.ads
! 10397052685e8154464d29d0be7459a5  gcc/ada/system-linux-sh4.ads
! c19b626467201069ad26262087877992  gcc/ada/system-linux-sparc.ads
! 994d483a54cc88b7fec882095ca2d111  gcc/ada/system-linux-sparcv9.ads
  ef58ee3a78c178181723c67ac440b9e5  gcc/ada/system-linux-x86.ads
  ceaf32efe91b246df0f99e4cef635b6b  gcc/ada/system-linux-x86_64.ads
  9d9a1fdc49600dcf4517d23cc7831ef9  gcc/ada/system-mingw-x86_64.ads
  f8c8f6aa08c1e089ecf805eefdf14d56  gcc/ada/system-mingw.ads
! 3dbc2559414a97bc117a70ffc35c316d  gcc/ada/system-rtems.ads
  79b2cde4b268335c42e8ba5a6bdcd106  gcc/ada/system-solaris-sparc.ads
  7162270cd0dcdd61d004164395ee081f  gcc/ada/system-solaris-sparcv9.ads
  8b041f399d0b1f2dea8a823d8d969edb  gcc/ada/system-solaris-x86.ads
--- 2598,2632 ----
  d36e0605a7f68f541648e49af4e5d6ef  gcc/ada/symbols.adb
  28a22b1808efb5a1733162bd32c60ad3  gcc/ada/symbols.ads
  e26b70f48ee4c94add7aaf357194e4e2  gcc/ada/sysdep.c
! 803bb7ee83aec5b269e307a19c482d2e  gcc/ada/system-aix.ads
! 48bb56164417b8d0de6651e1e3b20250  gcc/ada/system-aix64.ads
  82c74a2538796d1beeca8da504a6d7e4  gcc/ada/system-darwin-ppc.ads
! 6c07c3c5c9702bc81db73c99ebd78dcc  gcc/ada/system-darwin-ppc64.ads
  c66a9b1480366153de25dd6bfaaf7667  gcc/ada/system-darwin-x86.ads
  4812519f69754a96fd52969c31dc2f22  gcc/ada/system-darwin-x86_64.ads
  3862b6839d964129c4af05da88d94e00  gcc/ada/system-freebsd-x86.ads
  8d88642b253a265dbb4dc0ca120b8893  gcc/ada/system-freebsd-x86_64.ads
! 53b570f72d92b70df5f8de1033ed819f  gcc/ada/system-hpux-ia64.ads
! 9ac68a88d141ac8fd8caa58f085099cb  gcc/ada/system-hpux.ads
! a79e95b80050e9e7fc7be8ce97c08812  gcc/ada/system-linux-alpha.ads
! e5b1c5268135264c234b67bc7b71c246  gcc/ada/system-linux-armeb.ads
  cce6f082de2921a93f6df9f5cfc8bf27  gcc/ada/system-linux-armel.ads
! 86aa5d70fecffa5be77914308607e022  gcc/ada/system-linux-hppa.ads
! c96edc9655e04bdab50e20e8dbdfb754  gcc/ada/system-linux-ia64.ads
! 64f78a23b4425bf3d70300fd6ba6d9b2  gcc/ada/system-linux-mips.ads
! 3789df318ce14888f67457d08f9d18f9  gcc/ada/system-linux-mips64el.ads
! 9bd69b92554dc16aa7b2c9d99afe3c40  gcc/ada/system-linux-mipsel.ads
! 0098fc2fb20b4183d936da8a8c15fa02  gcc/ada/system-linux-ppc.ads
! b32a419ea6940429578daa01bb39f25e  gcc/ada/system-linux-s390.ads
! 4c4bab32e2e40d9b416f81b12b8b011a  gcc/ada/system-linux-s390x.ads
! 223c89f7f382c0185a56ab39e7f33ac6  gcc/ada/system-linux-sh4.ads
! cb91bf2a390169cf35e38a5a1c18950e  gcc/ada/system-linux-sparc.ads
! cbab47b3cab3e91194f83a2c215b2b96  gcc/ada/system-linux-sparcv9.ads
  ef58ee3a78c178181723c67ac440b9e5  gcc/ada/system-linux-x86.ads
  ceaf32efe91b246df0f99e4cef635b6b  gcc/ada/system-linux-x86_64.ads
  9d9a1fdc49600dcf4517d23cc7831ef9  gcc/ada/system-mingw-x86_64.ads
  f8c8f6aa08c1e089ecf805eefdf14d56  gcc/ada/system-mingw.ads
! 70d05d208c326927e2b53500f9b4a187  gcc/ada/system-rtems.ads
  79b2cde4b268335c42e8ba5a6bdcd106  gcc/ada/system-solaris-sparc.ads
  7162270cd0dcdd61d004164395ee081f  gcc/ada/system-solaris-sparcv9.ads
  8b041f399d0b1f2dea8a823d8d969edb  gcc/ada/system-solaris-x86.ads
*************** e5c3b54925e6e404c11e8a92570e0365  gcc/al
*** 2705,2746 ****
  a1a14d07c1b6896b6db92c4e57e0b0ba  gcc/alias.h
  011484fc6e4e8c092886ac831906a2f9  gcc/alloc-pool.c
  9d9d811126a83d79287b250b5d8704c7  gcc/alloc-pool.h
! d3a26129abf7137488d3dcbcfd2a0dc4  gcc/asan.c
  6dfcd79551ac61c32d93cb16351d316f  gcc/asan.h
  089b62ecd1f12197e1aa878b0b1a2274  gcc/attribs.c
  4fa0ea38782a314a45a330ae2179368a  gcc/attribs.h
  08da392176c469f2c84c866f7e4d53a2  gcc/auto-inc-dec.c
! 9f7fd4b771b193fbc230f99bcb27e72d  gcc/auto-profile.c
  bbadc045f31bde62eb1120371e19cd07  gcc/auto-profile.h
  f4dab966eeae6075d17599cf784732e4  gcc/basic-block.h
! 0549a751641685ef1da0b43b20e42165  gcc/bb-reorder.c
  2d1e763819e8d86829f561a172a35265  gcc/bb-reorder.h
  578799339be1d4cd368d48b3d2c019c1  gcc/bitmap.c
  44b25165542343bfd30f90f8912dcf63  gcc/bitmap.h
  4845dc480ec80ff08fd9b0a858efa5b7  gcc/bt-load.c
  db081d76b372e7afd7004ad52bbe9964  gcc/builtin-attrs.def
  83a12810cfce380668149ac53d6fe02e  gcc/builtin-types.def
! 1f5ed5f4e9f1ac44baeff8d1ecf276d2  gcc/builtins.c
  bcc91aadefbc7406d6ff24e7ecd29219  gcc/builtins.def
  63ec5d056e40b5cb35c77479668696ca  gcc/builtins.h
! 26fb3c032ac53a37c6bd2a9dbfa88766  gcc/c-family/ChangeLog
  ea3fa1f4d7390a105fa3caab4f79aaf7  gcc/c-family/ChangeLog.gimple-classes
  bf722634f60d54d84b1483c15c649ee0  gcc/c-family/array-notation-common.c
! 17dd72cbe914028d76749ed5cc130403  gcc/c-family/c-ada-spec.c
  150f75f19875f57820f377ad8834821d  gcc/c-family/c-ada-spec.h
  173ec359583c26887ac3a0b6122befe4  gcc/c-family/c-cilkplus.c
! ecc651c0782e4c87b6cbf19e9ed8740d  gcc/c-family/c-common.c
  001d3042c2fd38b697f88747e2a39442  gcc/c-family/c-common.def
  6abd8e92e44e130c23a1d654a054ce68  gcc/c-family/c-common.h
! 43ebca50428e5e5e338d751c35ec6787  gcc/c-family/c-cppbuiltin.c
  c927eff529e8683eb3b6643cf576c4a5  gcc/c-family/c-dump.c
  fda8d88ee72923ee531c2df5b2d75b86  gcc/c-family/c-format.c
  bc77fba0203f22724ffc1c5c56a12009  gcc/c-family/c-format.h
! 0e6b978147c2895b8308ff8e19e96d69  gcc/c-family/c-gimplify.c
  50bd4d7bb76e4f0d32c18f64f72e6fe1  gcc/c-family/c-lex.c
  b6da13c351a98f2b2aaec6ec0c24f111  gcc/c-family/c-objc.h
! 4e452aa651fcb15d72d456b0be512b38  gcc/c-family/c-omp.c
! 329b885cb62b39fe9ed30f4f77372795  gcc/c-family/c-opts.c
  653c6ae1500794ccc5aada718a0438be  gcc/c-family/c-pch.c
  dd702304e1aace6e7dad540b90e7ab45  gcc/c-family/c-ppoutput.c
  0227e10d7eebbb1805755e5e7d30cff3  gcc/c-family/c-pragma.c
--- 2705,2746 ----
  a1a14d07c1b6896b6db92c4e57e0b0ba  gcc/alias.h
  011484fc6e4e8c092886ac831906a2f9  gcc/alloc-pool.c
  9d9d811126a83d79287b250b5d8704c7  gcc/alloc-pool.h
! c31339f70858d9e55fbebf5ec6976b13  gcc/asan.c
  6dfcd79551ac61c32d93cb16351d316f  gcc/asan.h
  089b62ecd1f12197e1aa878b0b1a2274  gcc/attribs.c
  4fa0ea38782a314a45a330ae2179368a  gcc/attribs.h
  08da392176c469f2c84c866f7e4d53a2  gcc/auto-inc-dec.c
! 282594844601e41e52b94907b944b428  gcc/auto-profile.c
  bbadc045f31bde62eb1120371e19cd07  gcc/auto-profile.h
  f4dab966eeae6075d17599cf784732e4  gcc/basic-block.h
! 07eb4121fe5cb29a05468019fe312f10  gcc/bb-reorder.c
  2d1e763819e8d86829f561a172a35265  gcc/bb-reorder.h
  578799339be1d4cd368d48b3d2c019c1  gcc/bitmap.c
  44b25165542343bfd30f90f8912dcf63  gcc/bitmap.h
  4845dc480ec80ff08fd9b0a858efa5b7  gcc/bt-load.c
  db081d76b372e7afd7004ad52bbe9964  gcc/builtin-attrs.def
  83a12810cfce380668149ac53d6fe02e  gcc/builtin-types.def
! 74a7696dc7cf5847172cbd2af7d1373b  gcc/builtins.c
  bcc91aadefbc7406d6ff24e7ecd29219  gcc/builtins.def
  63ec5d056e40b5cb35c77479668696ca  gcc/builtins.h
! 2dd6a1af47b456d61a6f15ce75ecd49a  gcc/c-family/ChangeLog
  ea3fa1f4d7390a105fa3caab4f79aaf7  gcc/c-family/ChangeLog.gimple-classes
  bf722634f60d54d84b1483c15c649ee0  gcc/c-family/array-notation-common.c
! c600bbdc1c796118d52414c55c2db688  gcc/c-family/c-ada-spec.c
  150f75f19875f57820f377ad8834821d  gcc/c-family/c-ada-spec.h
  173ec359583c26887ac3a0b6122befe4  gcc/c-family/c-cilkplus.c
! ad2ee4494fef751bee99130bd6439067  gcc/c-family/c-common.c
  001d3042c2fd38b697f88747e2a39442  gcc/c-family/c-common.def
  6abd8e92e44e130c23a1d654a054ce68  gcc/c-family/c-common.h
! 713e29bb56842a22cb36c18b2a52cce2  gcc/c-family/c-cppbuiltin.c
  c927eff529e8683eb3b6643cf576c4a5  gcc/c-family/c-dump.c
  fda8d88ee72923ee531c2df5b2d75b86  gcc/c-family/c-format.c
  bc77fba0203f22724ffc1c5c56a12009  gcc/c-family/c-format.h
! 2db72c636b5adc6243fde93faf7e6a53  gcc/c-family/c-gimplify.c
  50bd4d7bb76e4f0d32c18f64f72e6fe1  gcc/c-family/c-lex.c
  b6da13c351a98f2b2aaec6ec0c24f111  gcc/c-family/c-objc.h
! 079f7b06ddc8eeee4f8f21790c27f42a  gcc/c-family/c-omp.c
! 2adc45deab71e1d17c690b8994ba2f6d  gcc/c-family/c-opts.c
  653c6ae1500794ccc5aada718a0438be  gcc/c-family/c-pch.c
  dd702304e1aace6e7dad540b90e7ab45  gcc/c-family/c-ppoutput.c
  0227e10d7eebbb1805755e5e7d30cff3  gcc/c-family/c-pragma.c
*************** e33ae94e0bed0bc72db4a86cb15b9d9d  gcc/c-
*** 2757,2780 ****
  8a8f0a0d5698aeedf6f8fa5b35377db3  gcc/c-family/cilk.c
  1972187c057ea69a7cfcc47f24a1172d  gcc/c-family/cppspec.c
  fad79055080372de2027c186978488a5  gcc/c-family/stub-objc.c
! 4541d2759a7ade06e6787788eaa5be51  gcc/c/ChangeLog
  b615986ca13fc7c58bc8761b9dbc16ac  gcc/c/Make-lang.in
  7719d892de262867ca62f7fb2733fa91  gcc/c/c-array-notation.c
  a6775531320fcc3d086198f057180920  gcc/c/c-aux-info.c
  3d993a5faaabf6694f64cf4dba56a6b3  gcc/c/c-convert.c
! a05e07d95ce8484cef5c788ec949ed6d  gcc/c/c-decl.c
  03ac4d15416ac9293584217af261c4ad  gcc/c/c-errors.c
  1876a953660c55f216e3ab95a07053b6  gcc/c/c-lang.c
  fb4bf29fb3a70020f0071cae1b59d44a  gcc/c/c-lang.h
! ee7a01239c662b2ebad879087194105a  gcc/c/c-objc-common.c
  4dd9b52f4d06e68ead6c804dda10ed3e  gcc/c/c-objc-common.h
! acd5d2b9db6c69827b70671286cb9723  gcc/c/c-parser.c
  f473d33183ef7239386574b7d0d5f1e4  gcc/c/c-tree.h
! 5c4c60e471c64b4e1b20dcb2229639a6  gcc/c/c-typeck.c
  cf549ade4766d868f24388f42f6f2ad3  gcc/c/config-lang.in
  88cc221f8de100197c5e367a941abb72  gcc/c/gccspec.c
  ae949ec05897086935463455df7d1b7f  gcc/caller-save.c
! 02dfa7e6122f8cc2ebdb7708e8fd75c4  gcc/calls.c
  33274dc1f95e6ba10dbc6032c5b16e26  gcc/calls.h
  a78bbf9a5609b4d3012ee024d26497e6  gcc/ccmp.c
  12bee97b0c70f2098bfbb9a0286a8d07  gcc/ccmp.h
--- 2757,2780 ----
  8a8f0a0d5698aeedf6f8fa5b35377db3  gcc/c-family/cilk.c
  1972187c057ea69a7cfcc47f24a1172d  gcc/c-family/cppspec.c
  fad79055080372de2027c186978488a5  gcc/c-family/stub-objc.c
! 185bfc0470feb6f27413e988100fc969  gcc/c/ChangeLog
  b615986ca13fc7c58bc8761b9dbc16ac  gcc/c/Make-lang.in
  7719d892de262867ca62f7fb2733fa91  gcc/c/c-array-notation.c
  a6775531320fcc3d086198f057180920  gcc/c/c-aux-info.c
  3d993a5faaabf6694f64cf4dba56a6b3  gcc/c/c-convert.c
! 1fbc0b7401ae293ea7a3a2e568290fb4  gcc/c/c-decl.c
  03ac4d15416ac9293584217af261c4ad  gcc/c/c-errors.c
  1876a953660c55f216e3ab95a07053b6  gcc/c/c-lang.c
  fb4bf29fb3a70020f0071cae1b59d44a  gcc/c/c-lang.h
! 8e0d737d72ccd26b18b38a7f63ad0fd6  gcc/c/c-objc-common.c
  4dd9b52f4d06e68ead6c804dda10ed3e  gcc/c/c-objc-common.h
! 443162359bfa964fbf454a5b15c4f283  gcc/c/c-parser.c
  f473d33183ef7239386574b7d0d5f1e4  gcc/c/c-tree.h
! 7397c10a4b50b49a1b16fc7a8a52d04b  gcc/c/c-typeck.c
  cf549ade4766d868f24388f42f6f2ad3  gcc/c/config-lang.in
  88cc221f8de100197c5e367a941abb72  gcc/c/gccspec.c
  ae949ec05897086935463455df7d1b7f  gcc/caller-save.c
! c0acd9873634622516fe4ada5fec3edb  gcc/calls.c
  33274dc1f95e6ba10dbc6032c5b16e26  gcc/calls.h
  a78bbf9a5609b4d3012ee024d26497e6  gcc/ccmp.c
  12bee97b0c70f2098bfbb9a0286a8d07  gcc/ccmp.h
*************** eb3091c13cdb698ee42716904d5d8d1b  gcc/cf
*** 2798,2808 ****
  e47507dd18b9e85279ee24e83bc8330b  gcc/cfgloopmanip.h
  cd67618d45d91ba55c0a5e25b3c94c53  gcc/cfgrtl.c
  ef270e91bc468cbc2129060ad03ac5b4  gcc/cfgrtl.h
! 79bddd97aa4e91b10dfcb0c2189d265d  gcc/cgraph.c
! 3296a4cdd85e40ada93f8bc1d6f94d35  gcc/cgraph.h
  e7c4c02bfa4af237094af1db95864490  gcc/cgraphbuild.c
! 6ed7977b27168c8c0ddbfa8204c41ab9  gcc/cgraphclones.c
! 9c80b78e5d9f44ffc1e2542f78bf662d  gcc/cgraphunit.c
  7199031ce3bff9e1850cac1186ba73d3  gcc/chkp-builtins.def
  435e1ecafd228ed77006349b38348f08  gcc/cif-code.def
  e744cfbcfc6ebe3a0beec02a77db2277  gcc/cilk-builtins.def
--- 2798,2808 ----
  e47507dd18b9e85279ee24e83bc8330b  gcc/cfgloopmanip.h
  cd67618d45d91ba55c0a5e25b3c94c53  gcc/cfgrtl.c
  ef270e91bc468cbc2129060ad03ac5b4  gcc/cfgrtl.h
! 7cad47405de675be0c534569703df4eb  gcc/cgraph.c
! 3d18eeac9a51c4da349b1c80d896bd10  gcc/cgraph.h
  e7c4c02bfa4af237094af1db95864490  gcc/cgraphbuild.c
! c81bf13900a00e0f81f77cc826f73da8  gcc/cgraphclones.c
! baec1e20e5abfbb7c7c3f22c91b9f7e6  gcc/cgraphunit.c
  7199031ce3bff9e1850cac1186ba73d3  gcc/chkp-builtins.def
  435e1ecafd228ed77006349b38348f08  gcc/cif-code.def
  e744cfbcfc6ebe3a0beec02a77db2277  gcc/cilk-builtins.def
*************** a9cd540469e955beccf9632d0e310a9a  gcc/co
*** 2816,2824 ****
  84cb63ea4646d658deba146c8d351bd3  gcc/collect2.c
  488ba67f95318d2251aa33ef1924beac  gcc/collect2.h
  217a4fcc8df81d92ef7132e9139c1a09  gcc/combine-stack-adj.c
! c369a8e8bc8366ed352c8198cfdf7e9c  gcc/combine.c
  4fa636ffb9d6ed2c292cece53b4eae94  gcc/common.md
! fd3097a8127cc7dd2bb42824c1b371fe  gcc/common.opt
  5230030789eabcc9ad9468a26ad03fed  gcc/common/common-target-def.h
  51bba2c2fc28ab5f539fdce790ce2778  gcc/common/common-target.def
  292fc88bf83fdd6b897b311e56c68772  gcc/common/common-target.h
--- 2816,2824 ----
  84cb63ea4646d658deba146c8d351bd3  gcc/collect2.c
  488ba67f95318d2251aa33ef1924beac  gcc/collect2.h
  217a4fcc8df81d92ef7132e9139c1a09  gcc/combine-stack-adj.c
! 9092e89af938ffece2b347324468f9d5  gcc/combine.c
  4fa636ffb9d6ed2c292cece53b4eae94  gcc/common.md
! 9507ddc99aa3b216462a529cb99b166a  gcc/common.opt
  5230030789eabcc9ad9468a26ad03fed  gcc/common/common-target-def.h
  51bba2c2fc28ab5f539fdce790ce2778  gcc/common/common-target.def
  292fc88bf83fdd6b897b311e56c68772  gcc/common/common-target.h
*************** c6bc993ffca29ad40199ac725e4129ba  gcc/co
*** 2838,2844 ****
  de21aba184d6fe01b1425fafbf9b42f4  gcc/common/config/fr30/fr30-common.c
  a99802d2cdaf1f0d7b772a0939cc400c  gcc/common/config/frv/frv-common.c
  a5a291896bad4cba1613699bb74d540d  gcc/common/config/h8300/h8300-common.c
! a9399bfb1c1169e4f02c4bd4bedf4969  gcc/common/config/i386/i386-common.c
  8b574363ccc35dfa73506df1ce7f1623  gcc/common/config/ia64/ia64-common.c
  9f8fc63eb5bcb2ad5c5d8fff15be387d  gcc/common/config/iq2000/iq2000-common.c
  1faf97bdbb08d4d70d2f83f62574310d  gcc/common/config/lm32/lm32-common.c
--- 2838,2844 ----
  de21aba184d6fe01b1425fafbf9b42f4  gcc/common/config/fr30/fr30-common.c
  a99802d2cdaf1f0d7b772a0939cc400c  gcc/common/config/frv/frv-common.c
  a5a291896bad4cba1613699bb74d540d  gcc/common/config/h8300/h8300-common.c
! aa7756ad72e0a0d66b577afc1da83a92  gcc/common/config/i386/i386-common.c
  8b574363ccc35dfa73506df1ce7f1623  gcc/common/config/ia64/ia64-common.c
  9f8fc63eb5bcb2ad5c5d8fff15be387d  gcc/common/config/iq2000/iq2000-common.c
  1faf97bdbb08d4d70d2f83f62574310d  gcc/common/config/lm32/lm32-common.c
*************** c9565e02aca3c43309d43922da62003e  gcc/co
*** 2872,2878 ****
  5d43e788e01591619ace3348388982da  gcc/compare-elim.c
  cc8d9057e6fbfadc93614758de30ffad  gcc/conditions.h
  80a8f1f74c1dd616eebe2da89060b9dc  gcc/config.build
! 5f5a65c28526062108150256f53af228  gcc/config.gcc
  244bdab0d1156cd2f747825fba6d5dac  gcc/config.host
  f5ceb6c214b586e3918824b4dfb538bf  gcc/config.in
  8e697813dc96ca90f5d0f4c196efe2cc  gcc/config/README
--- 2872,2878 ----
  5d43e788e01591619ace3348388982da  gcc/compare-elim.c
  cc8d9057e6fbfadc93614758de30ffad  gcc/conditions.h
  80a8f1f74c1dd616eebe2da89060b9dc  gcc/config.build
! 0765d96472d29b512cd1c413424399b9  gcc/config.gcc
  244bdab0d1156cd2f747825fba6d5dac  gcc/config.host
  f5ceb6c214b586e3918824b4dfb538bf  gcc/config.in
  8e697813dc96ca90f5d0f4c196efe2cc  gcc/config/README
*************** f8c1a9fcf6adf497749d8607a7a58e7c  gcc/co
*** 2882,2887 ****
--- 2882,2888 ----
  93452463f3c41e0d9d4e48324afb3a73  gcc/config/aarch64/aarch64-cost-tables.h
  6d02227df25c9075c02d051af3dc7359  gcc/config/aarch64/aarch64-elf-raw.h
  bfcf3f8c0dd400dfd0f15978ce7e7244  gcc/config/aarch64/aarch64-elf.h
+ c107fe312939ec6f04e3e951ef5d6d43  gcc/config/aarch64/aarch64-freebsd.h
  2b6a1351ae1b75c9c9a7861cc7cf6a2d  gcc/config/aarch64/aarch64-ldpstp.md
  d44e5d845e0f5770fd1660e697731bbf  gcc/config/aarch64/aarch64-linux.h
  39c4ec77ec9e285a5ee6e1e116228c27  gcc/config/aarch64/aarch64-modes.def
*************** f887ce56cadae0b7a8909f2573c4002a  gcc/co
*** 2890,2900 ****
  61a8b9b2c10a7c456b0e9a52148db81e  gcc/config/aarch64/aarch64-protos.h
  73a59990442b890656eb4f57e77b2f8f  gcc/config/aarch64/aarch64-simd-builtin-types.def
  29dab6eef8258c75ae00b6122cd18d2d  gcc/config/aarch64/aarch64-simd-builtins.def
! e5c2aff63546bca5363564fef497a57d  gcc/config/aarch64/aarch64-simd.md
  0f6f9335f7a3655e0e98df770d4e2ade  gcc/config/aarch64/aarch64-tune.md
! 03ff67c9c14256570f4f6b7094b0f3bb  gcc/config/aarch64/aarch64.c
  376ede8fe91e59b9ed7b53d9c6ededf2  gcc/config/aarch64/aarch64.h
! 822e1837a2831dd72411898b543003cf  gcc/config/aarch64/aarch64.md
  cd2f55e144d635b9e23062d3cbbf59ab  gcc/config/aarch64/aarch64.opt
  033496378429ba8283ed14924bb56fca  gcc/config/aarch64/arm_acle.h
  6b19b41154a79cb85313ca10c6a26dd5  gcc/config/aarch64/arm_neon.h
--- 2891,2901 ----
  61a8b9b2c10a7c456b0e9a52148db81e  gcc/config/aarch64/aarch64-protos.h
  73a59990442b890656eb4f57e77b2f8f  gcc/config/aarch64/aarch64-simd-builtin-types.def
  29dab6eef8258c75ae00b6122cd18d2d  gcc/config/aarch64/aarch64-simd-builtins.def
! fc4e1dbfd07bf450d0c9175984c111f0  gcc/config/aarch64/aarch64-simd.md
  0f6f9335f7a3655e0e98df770d4e2ade  gcc/config/aarch64/aarch64-tune.md
! b58fc07197bb197aa74fef4126b65895  gcc/config/aarch64/aarch64.c
  376ede8fe91e59b9ed7b53d9c6ededf2  gcc/config/aarch64/aarch64.h
! 63f0810dde26bfce519cb7b305e03b18  gcc/config/aarch64/aarch64.md
  cd2f55e144d635b9e23062d3cbbf59ab  gcc/config/aarch64/aarch64.opt
  033496378429ba8283ed14924bb56fca  gcc/config/aarch64/arm_acle.h
  6b19b41154a79cb85313ca10c6a26dd5  gcc/config/aarch64/arm_neon.h
*************** d6c2521a147e4423ebabfc83e83517e9  gcc/co
*** 2907,2912 ****
--- 2908,2914 ----
  fdc2e634ca267aa2006c7d036015d75d  gcc/config/aarch64/iterators.md
  980328b815546bd66741288840da6308  gcc/config/aarch64/predicates.md
  1025673e1623cb34c00dd1b9ccb32e2d  gcc/config/aarch64/t-aarch64
+ 0009b53648df6aa7d54ca692f1ee21e7  gcc/config/aarch64/t-aarch64-freebsd
  ca75ca8f7ebc7d5e2e82afceb4c64566  gcc/config/aarch64/t-aarch64-linux
  12431958587d480e944b7caac5ab6704  gcc/config/aarch64/thunderx.md
  488f4d4a08586e03ef8770eb887f159f  gcc/config/alpha/alpha-modes.def
*************** fde6fc7bb4c6ccbd7f4cf863a1c9312a  gcc/co
*** 2955,2961 ****
  b4462319c9c2a304483d6ff2ece72cb0  gcc/config/arm/aarch-cost-tables.h
  5a16d60153c314e0887fbdb81904f47c  gcc/config/arm/aout.h
  3d5875fc1a3934e3a2bc9b5ff1e0c7bc  gcc/config/arm/arm-arches.def
! a5d1af6eb86c00c81345196ba782a3b2  gcc/config/arm/arm-builtins.c
  87927edaa3cae9dd7124803ab8cbbcbb  gcc/config/arm/arm-c.c
  2efc63fb617b7d4dfb77f844de77abc5  gcc/config/arm/arm-cores.def
  cd617b1a4d195f4d1303e1beebea9d32  gcc/config/arm/arm-fixed.md
--- 2957,2963 ----
  b4462319c9c2a304483d6ff2ece72cb0  gcc/config/arm/aarch-cost-tables.h
  5a16d60153c314e0887fbdb81904f47c  gcc/config/arm/aout.h
  3d5875fc1a3934e3a2bc9b5ff1e0c7bc  gcc/config/arm/arm-arches.def
! 8e528886bfab6022c0cfb8c752323f38  gcc/config/arm/arm-builtins.c
  87927edaa3cae9dd7124803ab8cbbcbb  gcc/config/arm/arm-c.c
  2efc63fb617b7d4dfb77f844de77abc5  gcc/config/arm/arm-cores.def
  cd617b1a4d195f4d1303e1beebea9d32  gcc/config/arm/arm-fixed.md
*************** b87c2c6f28fe7a1df71d6e1eb48c8931  gcc/co
*** 2964,2976 ****
  8980ae9359dfd89b544d5e5359183988  gcc/config/arm/arm-ldmstm.ml
  07e0ad1fdbbfe2dd74ae8eb788bb3130  gcc/config/arm/arm-modes.def
  349b15c3cfbf77a6cb24dadbbe38150c  gcc/config/arm/arm-opts.h
! d16c2d9d64b09775ea09de63dded7f97  gcc/config/arm/arm-protos.h
  ce7f93ea6d26ec3cf358766a81ef98ab  gcc/config/arm/arm-simd-builtin-types.def
  b3f125f2bc310c71edd705913e37b06a  gcc/config/arm/arm-tables.opt
  d96960ce9f407c23b00dc2b31c687d3f  gcc/config/arm/arm-tune.md
! d7d8f5c9e046bacce7ee18fde06a833e  gcc/config/arm/arm.c
! 382914dbe5b616efa7aa2c91b7690299  gcc/config/arm/arm.h
! 7558724f4197dac9e1befd5c0c29b18d  gcc/config/arm/arm.md
  af6244d4ae410a1d45df7bd94c8fdc1d  gcc/config/arm/arm.opt
  b7485fbe126aa58857466e2af82aff49  gcc/config/arm/arm1020e.md
  bcd69f56bb87d2a82ef61b5fee4a7448  gcc/config/arm/arm1026ejs.md
--- 2966,2978 ----
  8980ae9359dfd89b544d5e5359183988  gcc/config/arm/arm-ldmstm.ml
  07e0ad1fdbbfe2dd74ae8eb788bb3130  gcc/config/arm/arm-modes.def
  349b15c3cfbf77a6cb24dadbbe38150c  gcc/config/arm/arm-opts.h
! f16a90727368ea8538141f6d9ab8cd12  gcc/config/arm/arm-protos.h
  ce7f93ea6d26ec3cf358766a81ef98ab  gcc/config/arm/arm-simd-builtin-types.def
  b3f125f2bc310c71edd705913e37b06a  gcc/config/arm/arm-tables.opt
  d96960ce9f407c23b00dc2b31c687d3f  gcc/config/arm/arm-tune.md
! 011e8a8c3ff2fd205a80adae3f0adfc1  gcc/config/arm/arm.c
! 9b0e54dd38f8a5e900571d1c920cfe2d  gcc/config/arm/arm.h
! ddf6c620d6a0e6d3e0a9b8a2ea0f9658  gcc/config/arm/arm.md
  af6244d4ae410a1d45df7bd94c8fdc1d  gcc/config/arm/arm.opt
  b7485fbe126aa58857466e2af82aff49  gcc/config/arm/arm1020e.md
  bcd69f56bb87d2a82ef61b5fee4a7448  gcc/config/arm/arm1026ejs.md
*************** bb55086df48ee74578a9a8063456da02  gcc/co
*** 3008,3014 ****
  27111cc3e08d3b555198f7925404d7b7  gcc/config/arm/fa626te.md
  36f93e532e19bd758c65dcaaba81d056  gcc/config/arm/fa726te.md
  7e1f1764135a8855c53c0949a5b7a0f3  gcc/config/arm/fmp626.md
! 12e29df9e65b8f087eb9d12c68852f7e  gcc/config/arm/freebsd.h
  9430e602a820b0ce8ed47fdf5dc4f0a1  gcc/config/arm/genopt.sh
  52e6a4bafd72aad7af6ebe0c6d003751  gcc/config/arm/gentune.sh
  c928ed03c754bda125ad3293867b95a1  gcc/config/arm/iterators.md
--- 3010,3016 ----
  27111cc3e08d3b555198f7925404d7b7  gcc/config/arm/fa626te.md
  36f93e532e19bd758c65dcaaba81d056  gcc/config/arm/fa726te.md
  7e1f1764135a8855c53c0949a5b7a0f3  gcc/config/arm/fmp626.md
! 790ea112222087ccd2731eaa12f00d20  gcc/config/arm/freebsd.h
  9430e602a820b0ce8ed47fdf5dc4f0a1  gcc/config/arm/genopt.sh
  52e6a4bafd72aad7af6ebe0c6d003751  gcc/config/arm/gentune.sh
  c928ed03c754bda125ad3293867b95a1  gcc/config/arm/iterators.md
*************** a8147ef196117c8d7c0ce5ef4305132d  gcc/co
*** 3023,3029 ****
  4930ae39030567dac4a8171a786cb0a4  gcc/config/arm/marvell-pj4.md
  f04d431b6b538cc133807349f2db244e  gcc/config/arm/mmintrin.h
  b9b8452f432845d30b79416c3ca60580  gcc/config/arm/neon-testgen.ml
! 9d733533a20887ba9755ca329fb3d515  gcc/config/arm/neon.md
  7fdfb5a447d98a6dafc5bbcd720a1c3a  gcc/config/arm/neon.ml
  375686adb229df741752e6a11390ba19  gcc/config/arm/netbsd-elf.h
  da4e5f82a7381cc3316efac9910f6178  gcc/config/arm/predicates.md
--- 3025,3031 ----
  4930ae39030567dac4a8171a786cb0a4  gcc/config/arm/marvell-pj4.md
  f04d431b6b538cc133807349f2db244e  gcc/config/arm/mmintrin.h
  b9b8452f432845d30b79416c3ca60580  gcc/config/arm/neon-testgen.ml
! 48d80e26266d99c4068c053de9264985  gcc/config/arm/neon.md
  7fdfb5a447d98a6dafc5bbcd720a1c3a  gcc/config/arm/neon.ml
  375686adb229df741752e6a11390ba19  gcc/config/arm/netbsd-elf.h
  da4e5f82a7381cc3316efac9910f6178  gcc/config/arm/predicates.md
*************** d5cb775684bcd3804b1ff9859c0cebb8  gcc/co
*** 3037,3042 ****
--- 3039,3045 ----
  4dc427c456af5e56b1ac39bda8969af6  gcc/config/arm/t-bpabi
  e3950ec6bd159734835f8f8fb143efc6  gcc/config/arm/t-linux-androideabi
  e9bcd09a4bac438d7ae4cdcccd3e106e  gcc/config/arm/t-linux-eabi
+ c7e2c969d3355e132c146d53fc626607  gcc/config/arm/t-phoenix
  239b0dd4d6670e8f3412c02a263baaae  gcc/config/arm/t-rtems
  8b5587b33cd65efc93c934350383a82b  gcc/config/arm/t-symbian
  6d661187b1e44b2c4db3c996bc179701  gcc/config/arm/t-vxworks
*************** da9960db3d462499465cb5c5b83f22f8  gcc/co
*** 3064,3080 ****
  ec90779779d175a79a879e0eef23c779  gcc/config/avr/avr-modes.def
  2dee5a162cf1fea5e6939416117cc3a3  gcc/config/avr/avr-protos.h
  dfc1c8b9319fafe9915263132fa31de5  gcc/config/avr/avr-stdint.h
! 802d59673206dbb74de020a7066b4733  gcc/config/avr/avr.c
  6245549eebfed524b80bd507a24893be  gcc/config/avr/avr.h
! 8a50c3a4983b693c2b69fa3453a41b7f  gcc/config/avr/avr.md
! d5fbd96597aa92a0a874328fb09583fe  gcc/config/avr/avr.opt
  8ce9c1fd23a80ba5b6722768e912407e  gcc/config/avr/avrlibc.h
  8b3840ee12e663b96a02a967362a70c0  gcc/config/avr/builtins.def
  b17d04f782af6e66382c2e95d411ce17  gcc/config/avr/constraints.md
  963255a736af80590e736a5141501680  gcc/config/avr/driver-avr.c
  a37eebf7912767a83140fd9a8034429b  gcc/config/avr/elf.h
! 0ee9b55a70abe66f70fc7fbd3ee11d25  gcc/config/avr/gen-avr-mmcu-specs.c
! 15f1a2cf57d799f58d87f34bc640a03a  gcc/config/avr/gen-avr-mmcu-texi.c
  6eee6fdb7a0b5d17f13391706b99bd44  gcc/config/avr/genmultilib.awk
  1df98fd54de326af1376b8364d0f1df6  gcc/config/avr/predicates.md
  257139b0180c4e38f55b47492ca72ac4  gcc/config/avr/rtems.h
--- 3067,3083 ----
  ec90779779d175a79a879e0eef23c779  gcc/config/avr/avr-modes.def
  2dee5a162cf1fea5e6939416117cc3a3  gcc/config/avr/avr-protos.h
  dfc1c8b9319fafe9915263132fa31de5  gcc/config/avr/avr-stdint.h
! 302727e68feabf53e90fd0d9c4bd8e25  gcc/config/avr/avr.c
  6245549eebfed524b80bd507a24893be  gcc/config/avr/avr.h
! b8664378d5f092e0a7214745ffff4a3a  gcc/config/avr/avr.md
! 6db95776955870f2c2d278458363266d  gcc/config/avr/avr.opt
  8ce9c1fd23a80ba5b6722768e912407e  gcc/config/avr/avrlibc.h
  8b3840ee12e663b96a02a967362a70c0  gcc/config/avr/builtins.def
  b17d04f782af6e66382c2e95d411ce17  gcc/config/avr/constraints.md
  963255a736af80590e736a5141501680  gcc/config/avr/driver-avr.c
  a37eebf7912767a83140fd9a8034429b  gcc/config/avr/elf.h
! adbb86ec1234ef91fc052dccef4260ba  gcc/config/avr/gen-avr-mmcu-specs.c
! 74514f79c6664cf8ec07641b5c8a5ea7  gcc/config/avr/gen-avr-mmcu-texi.c
  6eee6fdb7a0b5d17f13391706b99bd44  gcc/config/avr/genmultilib.awk
  1df98fd54de326af1376b8364d0f1df6  gcc/config/avr/predicates.md
  257139b0180c4e38f55b47492ca72ac4  gcc/config/avr/rtems.h
*************** b0260f0cd056773dca07771a2bd090c9  gcc/co
*** 3241,3260 ****
  00f5f50fe98f7d529b7f5c443feb74d9  gcc/config/i386/athlon.md
  10ba948d9390ba7a11bb628d8928d747  gcc/config/i386/atom.md
  0951f51e6fda98a470f64ebe10b43cbf  gcc/config/i386/att.h
! e72f542bcc10f631fba5816f68f8073c  gcc/config/i386/avx2intrin.h
! 0bb80525a2c91a271003f8b0b79db58f  gcc/config/i386/avx512bwintrin.h
  4936c05e70cd1d20379dc5f2ce416c29  gcc/config/i386/avx512cdintrin.h
! ebe3fc6dea2a58353ff9a1d45dc1a717  gcc/config/i386/avx512dqintrin.h
  b7dc55ef9e455c09d7a6a29cc7deb0b4  gcc/config/i386/avx512erintrin.h
! ee92244e10e036c45c2015ab0ad17fd2  gcc/config/i386/avx512fintrin.h
! f2f4bce727e69a6be5787830728b778e  gcc/config/i386/avx512ifmaintrin.h
! b6eb219a4c14634fe36422f54fef8499  gcc/config/i386/avx512ifmavlintrin.h
! 43894f67eed7550cb72907d87e29e641  gcc/config/i386/avx512pfintrin.h
! 0a552f8ce6b17be0c3a9e972071912d3  gcc/config/i386/avx512vbmiintrin.h
! 90894debb86724acb98df668f588777a  gcc/config/i386/avx512vbmivlintrin.h
! 858c8c8c328514838bf9ef2630c300c8  gcc/config/i386/avx512vlbwintrin.h
! b8e6b0410552170a66ac6f7041679d64  gcc/config/i386/avx512vldqintrin.h
! 096c9b11f8873078c8463b70610cb24e  gcc/config/i386/avx512vlintrin.h
  4deaddc5cb7151363925bddc788fd6fa  gcc/config/i386/avxintrin.h
  e7b014f55eaf1884f45368d2a1e8ef24  gcc/config/i386/avxmath.h
  9a2527c55dea3cdd1caf5e2044d206f8  gcc/config/i386/bdver1.md
--- 3244,3263 ----
  00f5f50fe98f7d529b7f5c443feb74d9  gcc/config/i386/athlon.md
  10ba948d9390ba7a11bb628d8928d747  gcc/config/i386/atom.md
  0951f51e6fda98a470f64ebe10b43cbf  gcc/config/i386/att.h
! aab762ff8b934af2ebb3c56ff41de92b  gcc/config/i386/avx2intrin.h
! 1cd1ec2f53f3c03875599fca18913d30  gcc/config/i386/avx512bwintrin.h
  4936c05e70cd1d20379dc5f2ce416c29  gcc/config/i386/avx512cdintrin.h
! 32f98b9c8e1cebbcb3dd2e372fa0c1bf  gcc/config/i386/avx512dqintrin.h
  b7dc55ef9e455c09d7a6a29cc7deb0b4  gcc/config/i386/avx512erintrin.h
! beeeecd47beb939130343fa6afeb1a50  gcc/config/i386/avx512fintrin.h
! ad0b9d11e334f1a25eba721f27ea0df9  gcc/config/i386/avx512ifmaintrin.h
! eb324ab84dab73ffbbfcc51902811950  gcc/config/i386/avx512ifmavlintrin.h
! 004d37922430eeba8789678248c2d8cf  gcc/config/i386/avx512pfintrin.h
! 588eaa2fd0cd743d0a2fad62a92db6be  gcc/config/i386/avx512vbmiintrin.h
! 1ecf6722edfed2f350c4fdbb8d06e07b  gcc/config/i386/avx512vbmivlintrin.h
! eefe8d723c2e9d60d2535065bbd2f351  gcc/config/i386/avx512vlbwintrin.h
! 9e9563538f4cf8ba80978238c8c56de3  gcc/config/i386/avx512vldqintrin.h
! a990e5ab8fcf0b16d1c0c3378be7b01f  gcc/config/i386/avx512vlintrin.h
  4deaddc5cb7151363925bddc788fd6fa  gcc/config/i386/avxintrin.h
  e7b014f55eaf1884f45368d2a1e8ef24  gcc/config/i386/avxmath.h
  9a2527c55dea3cdd1caf5e2044d206f8  gcc/config/i386/bdver1.md
*************** e3501309690598fe16f5f852260fe78b  gcc/co
*** 3270,3276 ****
  8710f59dc0b3d3fc9352b6084eb1cb21  gcc/config/i386/clwbintrin.h
  01c65a5fecd17da6e227efc1fb9098ef  gcc/config/i386/constraints.md
  fca9260052870589f4127f3328ee116a  gcc/config/i386/core2.md
! 9ebab82b173d5474669d36dba7c14e32  gcc/config/i386/cpuid.h
  12a2a897a7dab501fbb6f5414a4f2737  gcc/config/i386/cross-stdarg.h
  60aa44c1384599ceac7c971e49cc7648  gcc/config/i386/crtdll.h
  34fa05333fd81f0991bdb2b762bae89e  gcc/config/i386/cygming.h
--- 3273,3279 ----
  8710f59dc0b3d3fc9352b6084eb1cb21  gcc/config/i386/clwbintrin.h
  01c65a5fecd17da6e227efc1fb9098ef  gcc/config/i386/constraints.md
  fca9260052870589f4127f3328ee116a  gcc/config/i386/core2.md
! ad77c30b4d6d584f5ea0a8ca0070025c  gcc/config/i386/cpuid.h
  12a2a897a7dab501fbb6f5414a4f2737  gcc/config/i386/cross-stdarg.h
  60aa44c1384599ceac7c971e49cc7648  gcc/config/i386/crtdll.h
  34fa05333fd81f0991bdb2b762bae89e  gcc/config/i386/cygming.h
*************** fea2485c46acea8b373670fe25787a28  gcc/co
*** 3285,3291 ****
  f8f286d859f8d73d76a735c97eb3d2ec  gcc/config/i386/djgpp.h
  a0c0c141031d5cd5396695edcf5121cc  gcc/config/i386/djgpp.opt
  edccd8464a3b27bea1396b0a5b751095  gcc/config/i386/dragonfly.h
! 16929306bf5cd13599e4a1818e75d4db  gcc/config/i386/driver-i386.c
  80a9694c4eb1d7e135e09025acbd1641  gcc/config/i386/emmintrin.h
  fe2a761ddd30c85e4c03dac3f68f9266  gcc/config/i386/f16cintrin.h
  d7f8b633706b9312ab9188509aa49c91  gcc/config/i386/fma4intrin.h
--- 3288,3294 ----
  f8f286d859f8d73d76a735c97eb3d2ec  gcc/config/i386/djgpp.h
  a0c0c141031d5cd5396695edcf5121cc  gcc/config/i386/djgpp.opt
  edccd8464a3b27bea1396b0a5b751095  gcc/config/i386/dragonfly.h
! 8175105dd20f0b16fb48b8223a821375  gcc/config/i386/driver-i386.c
  80a9694c4eb1d7e135e09025acbd1641  gcc/config/i386/emmintrin.h
  fe2a761ddd30c85e4c03dac3f68f9266  gcc/config/i386/f16cintrin.h
  d7f8b633706b9312ab9188509aa49c91  gcc/config/i386/fma4intrin.h
*************** ae0fd559369affbf3aab054ecc19e6d3  gcc/co
*** 3295,3301 ****
  3f42bf98424664d638c47224e45b8bad  gcc/config/i386/fxsrintrin.h
  0342b60c3e348600fd59717bf42accce  gcc/config/i386/gas.h
  b5cab3ad22f3bba0d860a4491e1d9cfe  gcc/config/i386/geode.md
! 830e24da9ae6357a3bfb6294d2765957  gcc/config/i386/gmm_malloc.h
  a682d269753876b5847eaeb9b25340d5  gcc/config/i386/gnu-user-common.h
  b7c38e5d2566fb5a72ee8b486239a383  gcc/config/i386/gnu-user.h
  eea5495df289538e9844b565dc53d837  gcc/config/i386/gnu-user64.h
--- 3298,3304 ----
  3f42bf98424664d638c47224e45b8bad  gcc/config/i386/fxsrintrin.h
  0342b60c3e348600fd59717bf42accce  gcc/config/i386/gas.h
  b5cab3ad22f3bba0d860a4491e1d9cfe  gcc/config/i386/geode.md
! e0ed8d7ce2598959b9278c8264b75ea9  gcc/config/i386/gmm_malloc.h
  a682d269753876b5847eaeb9b25340d5  gcc/config/i386/gnu-user-common.h
  b7c38e5d2566fb5a72ee8b486239a383  gcc/config/i386/gnu-user.h
  eea5495df289538e9844b565dc53d837  gcc/config/i386/gnu-user64.h
*************** b59c7bcbecb519bf3e7bb32a70182c32  gcc/co
*** 3305,3322 ****
  3d45d9fbdfd9bf14da3b7ee2c4fe88b5  gcc/config/i386/host-i386-darwin.c
  8c13e46f3eb24fd5bdc30f8cb633fddb  gcc/config/i386/host-mingw32.c
  5aa6a668e89002b5abc3164dd6b3e1f3  gcc/config/i386/i386-builtin-types.awk
! 469ab764c33565da6bf7b1dba6663f5b  gcc/config/i386/i386-builtin-types.def
! b2f20584abf29c23881e9da73008263f  gcc/config/i386/i386-c.c
  0595e51f213632c7f50bb959df2d3e96  gcc/config/i386/i386-interix.h
  0536004db2ddeee0a4b62a9ee9bd1c57  gcc/config/i386/i386-modes.def
  fcde3a61941b8ab3f8855e592b6e695f  gcc/config/i386/i386-opts.h
  c3d4e075f6dac54c6f6bcd547011cc4e  gcc/config/i386/i386-protos.h
! 24ce00a9807db6ee7fc3e5396ff18714  gcc/config/i386/i386.c
! 00a8bfef99e94da77367ea48b7cd83b2  gcc/config/i386/i386.h
! 29043b8541a7bedbef92006cf24e4f92  gcc/config/i386/i386.md
! bfbaa969df039e91077f14916737c8b6  gcc/config/i386/i386.opt
  daedf27864f22a5722370a6beaba946b  gcc/config/i386/i386elf.h
! 61acb48cae5be4a22d2819eee9b145df  gcc/config/i386/ia32intrin.h
  d666ef5a14826040889f7b201554a148  gcc/config/i386/immintrin.h
  e0460dedf05e208d3b31473e8679003f  gcc/config/i386/intelmic-mkoffload.c
  8d5c3fff8280830c19ee4e50bb6fb4ed  gcc/config/i386/intelmic-offload.h
--- 3308,3325 ----
  3d45d9fbdfd9bf14da3b7ee2c4fe88b5  gcc/config/i386/host-i386-darwin.c
  8c13e46f3eb24fd5bdc30f8cb633fddb  gcc/config/i386/host-mingw32.c
  5aa6a668e89002b5abc3164dd6b3e1f3  gcc/config/i386/i386-builtin-types.awk
! faac37fcd29318260dbbdeda565e3282  gcc/config/i386/i386-builtin-types.def
! 85175fcfbdfa3769541c8343af2ee09c  gcc/config/i386/i386-c.c
  0595e51f213632c7f50bb959df2d3e96  gcc/config/i386/i386-interix.h
  0536004db2ddeee0a4b62a9ee9bd1c57  gcc/config/i386/i386-modes.def
  fcde3a61941b8ab3f8855e592b6e695f  gcc/config/i386/i386-opts.h
  c3d4e075f6dac54c6f6bcd547011cc4e  gcc/config/i386/i386-protos.h
! d95535280c9d864b7e1ebf5a96db6980  gcc/config/i386/i386.c
! 07020b5906b070812efc1b09e6264802  gcc/config/i386/i386.h
! 773ec35a3034943850b2a356b9a64bcd  gcc/config/i386/i386.md
! 6fe4a20a4225237c4396f142735f1f94  gcc/config/i386/i386.opt
  daedf27864f22a5722370a6beaba946b  gcc/config/i386/i386elf.h
! 62d42e6f12e89b4c2be53c704cbf13db  gcc/config/i386/ia32intrin.h
  d666ef5a14826040889f7b201554a148  gcc/config/i386/immintrin.h
  e0460dedf05e208d3b31473e8679003f  gcc/config/i386/intelmic-mkoffload.c
  8d5c3fff8280830c19ee4e50bb6fb4ed  gcc/config/i386/intelmic-offload.h
*************** b5df27f7caa40218efb4eb7850be5b6b  gcc/co
*** 3329,3335 ****
  301cb765672f86cb574af3aa8cc15339  gcc/config/i386/linux-common.h
  a0575c83924f631babb6282dae94fdfa  gcc/config/i386/linux.h
  3f1bbd7d0fab28481f4d13252f8489ec  gcc/config/i386/linux64.h
! 3b5358f68ed15171ea28e232535b2d23  gcc/config/i386/lwpintrin.h
  0f5428b87f33c6c9030c140a3812f394  gcc/config/i386/lynx.h
  8db7d3ff4ebee9d25a1a90fb6b148fa5  gcc/config/i386/lzcntintrin.h
  d94057995c5671c18dcbfa2ddabda006  gcc/config/i386/mingw-pthread.h
--- 3332,3338 ----
  301cb765672f86cb574af3aa8cc15339  gcc/config/i386/linux-common.h
  a0575c83924f631babb6282dae94fdfa  gcc/config/i386/linux.h
  3f1bbd7d0fab28481f4d13252f8489ec  gcc/config/i386/linux64.h
! 30d6de5c7c89277495398dfe703a643d  gcc/config/i386/lwpintrin.h
  0f5428b87f33c6c9030c140a3812f394  gcc/config/i386/lynx.h
  8db7d3ff4ebee9d25a1a90fb6b148fa5  gcc/config/i386/lzcntintrin.h
  d94057995c5671c18dcbfa2ddabda006  gcc/config/i386/mingw-pthread.h
*************** d94057995c5671c18dcbfa2ddabda006  gcc/co
*** 3340,3346 ****
  c08ff42f0a63ec3bc47e8f0c5338dfc0  gcc/config/i386/mingw32.h
  8e4410429bcce0983d35abcff6c53ce8  gcc/config/i386/mm3dnow.h
  8a2071b669fa5d3504f80288ea4210ed  gcc/config/i386/mmintrin.h
! 2a412a464e506eca92b93fb38d1c6031  gcc/config/i386/mmx.md
  a38581c639fdbe461a422d129ecacae8  gcc/config/i386/msformat-c.c
  ab7db06dca141a7b17fcb6c858941f14  gcc/config/i386/mwaitxintrin.h
  afc2499b56627c0cf4c0e77b0a3b5393  gcc/config/i386/netbsd-elf.h
--- 3343,3349 ----
  c08ff42f0a63ec3bc47e8f0c5338dfc0  gcc/config/i386/mingw32.h
  8e4410429bcce0983d35abcff6c53ce8  gcc/config/i386/mm3dnow.h
  8a2071b669fa5d3504f80288ea4210ed  gcc/config/i386/mmintrin.h
! d6718600f477cba5b9aa6fadc71c4bbb  gcc/config/i386/mmx.md
  a38581c639fdbe461a422d129ecacae8  gcc/config/i386/msformat-c.c
  ab7db06dca141a7b17fcb6c858941f14  gcc/config/i386/mwaitxintrin.h
  afc2499b56627c0cf4c0e77b0a3b5393  gcc/config/i386/netbsd-elf.h
*************** b4b34805ca26801fbfee48ffd2629b48  gcc/co
*** 3350,3358 ****
  7a3519417d5a1d75bf867aec8c0b046c  gcc/config/i386/nto.opt
  865ca3a1801a741ddbbf9bf3c22cfc8d  gcc/config/i386/openbsd.h
  a578d1bf36b5a746c9980b387984d957  gcc/config/i386/openbsdelf.h
- 47005d6f526e35f61502cee8a32e5fc8  gcc/config/i386/pcommitintrin.h
  6d0ffa971387d50b702d83ebbb175da4  gcc/config/i386/pentium.md
! 2ba65de49cc4c8ec36c0a8a02a9449f0  gcc/config/i386/pmm_malloc.h
  c7727d255f52a991603d7ab9bf382999  gcc/config/i386/pmmintrin.h
  c0f25640cfe6e819cda04d103e8b0d8e  gcc/config/i386/popcntintrin.h
  8dd75ae9d4073a8e5cb0dff4c80060ed  gcc/config/i386/ppro.md
--- 3353,3360 ----
  7a3519417d5a1d75bf867aec8c0b046c  gcc/config/i386/nto.opt
  865ca3a1801a741ddbbf9bf3c22cfc8d  gcc/config/i386/openbsd.h
  a578d1bf36b5a746c9980b387984d957  gcc/config/i386/openbsdelf.h
  6d0ffa971387d50b702d83ebbb175da4  gcc/config/i386/pentium.md
! b8328b3e0ad79b78abb04ab8e6e6f868  gcc/config/i386/pmm_malloc.h
  c7727d255f52a991603d7ab9bf382999  gcc/config/i386/pmmintrin.h
  c0f25640cfe6e819cda04d103e8b0d8e  gcc/config/i386/popcntintrin.h
  8dd75ae9d4073a8e5cb0dff4c80060ed  gcc/config/i386/ppro.md
*************** ba072d293e2d481f243934e2af557d25  gcc/co
*** 3360,3376 ****
  733892781931e1733a7a1dca931ae5c9  gcc/config/i386/prfchwintrin.h
  58605cbefcb96eef2d8a3bd82efbfffb  gcc/config/i386/rdos.h
  042ea5c9468f82955a18a6d4839a4cf0  gcc/config/i386/rdos64.h
! 3a97ea9d896684a58d2ebb51b89492f6  gcc/config/i386/rdseedintrin.h
  463e85bab8ec5803bb1dceb21c0122ad  gcc/config/i386/rtemself.h
! 5e13ac324c3df68f29da62535b6cbbba  gcc/config/i386/rtmintrin.h
  0a16c415d3bbf69d5f37bc8cc627ecce  gcc/config/i386/shaintrin.h
  e105dc3e1f37e3678bc591dfe5337ab1  gcc/config/i386/slm.md
  1d3ad3d2ecb926183e5ae934cff59f4d  gcc/config/i386/smmintrin.h
  017f3647ba917bb1344c7023eb7f39ed  gcc/config/i386/sol2.h
! 2299225d2775726e5c9af6642261046a  gcc/config/i386/sse.md
  3ede7749b4c8d7ada5a2bad4c09bd03f  gcc/config/i386/ssemath.h
  e6cd31e6a4e2c0b685f785e6a5f6e39e  gcc/config/i386/stringop.def
- a4b1fd10e33ee771b89d4761b8f8d327  gcc/config/i386/stringop.opt
  ec280d74eadf8b72a16316dd63a7a7c3  gcc/config/i386/subst.md
  04a444b18c29f930b94f85cd34c697fb  gcc/config/i386/sync.md
  653c2c63c0873ea9ca4c7603d8ed9ec8  gcc/config/i386/sysv4.h
--- 3362,3377 ----
  733892781931e1733a7a1dca931ae5c9  gcc/config/i386/prfchwintrin.h
  58605cbefcb96eef2d8a3bd82efbfffb  gcc/config/i386/rdos.h
  042ea5c9468f82955a18a6d4839a4cf0  gcc/config/i386/rdos64.h
! dc3cb9f9abfd4975be38e3236cfe91ce  gcc/config/i386/rdseedintrin.h
  463e85bab8ec5803bb1dceb21c0122ad  gcc/config/i386/rtemself.h
! d32763cd36baf017dd5faedb938092a3  gcc/config/i386/rtmintrin.h
  0a16c415d3bbf69d5f37bc8cc627ecce  gcc/config/i386/shaintrin.h
  e105dc3e1f37e3678bc591dfe5337ab1  gcc/config/i386/slm.md
  1d3ad3d2ecb926183e5ae934cff59f4d  gcc/config/i386/smmintrin.h
  017f3647ba917bb1344c7023eb7f39ed  gcc/config/i386/sol2.h
! d0960a5111f1c3bda8971ee55c32068b  gcc/config/i386/sse.md
  3ede7749b4c8d7ada5a2bad4c09bd03f  gcc/config/i386/ssemath.h
  e6cd31e6a4e2c0b685f785e6a5f6e39e  gcc/config/i386/stringop.def
  ec280d74eadf8b72a16316dd63a7a7c3  gcc/config/i386/subst.md
  04a444b18c29f930b94f85cd34c697fb  gcc/config/i386/sync.md
  653c2c63c0873ea9ca4c7603d8ed9ec8  gcc/config/i386/sysv4.h
*************** a6110be74ddfc65049872be187c866ce  gcc/co
*** 3407,3415 ****
  bae69273c5e47d61e99558ca73c4fabd  gcc/config/i386/x-darwin
  12e09c6fa27c603c6db59fbfc2a6b089  gcc/config/i386/x-i386
  7757edcd71447a5104d696e12c4b4c81  gcc/config/i386/x-mingw32
! 959abaa4c3bd9ff2b54409dcd184c5c6  gcc/config/i386/x86-64.h
  db708f4de1408a87622f1a4d951fb1ca  gcc/config/i386/x86-tune.def
! 7ad5c5eca2001da715e96cc38a8074cf  gcc/config/i386/x86intrin.h
  a25b8f30d6d2c9d3556892edd0930cd5  gcc/config/i386/xm-cygwin.h
  fedb4cb8da98643a4822ea1d3987b454  gcc/config/i386/xm-djgpp.h
  d3b975882353c4539540ad8cf626e2ce  gcc/config/i386/xm-mingw32.h
--- 3408,3416 ----
  bae69273c5e47d61e99558ca73c4fabd  gcc/config/i386/x-darwin
  12e09c6fa27c603c6db59fbfc2a6b089  gcc/config/i386/x-i386
  7757edcd71447a5104d696e12c4b4c81  gcc/config/i386/x-mingw32
! 5422a9338fee82242008769625b5c238  gcc/config/i386/x86-64.h
  db708f4de1408a87622f1a4d951fb1ca  gcc/config/i386/x86-tune.def
! 396ce8f3c4310884c5262d7087709d2a  gcc/config/i386/x86intrin.h
  a25b8f30d6d2c9d3556892edd0930cd5  gcc/config/i386/xm-cygwin.h
  fedb4cb8da98643a4822ea1d3987b454  gcc/config/i386/xm-djgpp.h
  d3b975882353c4539540ad8cf626e2ce  gcc/config/i386/xm-mingw32.h
*************** efcb4ce0481e92bd74083ca1e139edf6  gcc/co
*** 3744,3750 ****
  a14aeb7d18a40ea2c9569d8858b0cb86  gcc/config/nds32/nds32-protos.h
  bc5d70d2b626a5f71bd4d4ed5f4319e9  gcc/config/nds32/nds32.c
  d585e70fd2d82d33d108ce3a5c103b34  gcc/config/nds32/nds32.h
! bb38427d2cfecb11da3cdffc6d468f7a  gcc/config/nds32/nds32.md
  06fb413ae15afb7248236fe06e91ca0c  gcc/config/nds32/nds32.opt
  e54b605a7dbb08c68b092077ecc4ef6e  gcc/config/nds32/nds32_intrinsic.h
  2cc04688f7b247c63c935d078beb8e6f  gcc/config/nds32/pipelines.md
--- 3745,3751 ----
  a14aeb7d18a40ea2c9569d8858b0cb86  gcc/config/nds32/nds32-protos.h
  bc5d70d2b626a5f71bd4d4ed5f4319e9  gcc/config/nds32/nds32.c
  d585e70fd2d82d33d108ce3a5c103b34  gcc/config/nds32/nds32.h
! b70bf45dc7e4931ecdb62430013ec4b3  gcc/config/nds32/nds32.md
  06fb413ae15afb7248236fe06e91ca0c  gcc/config/nds32/nds32.opt
  e54b605a7dbb08c68b092077ecc4ef6e  gcc/config/nds32/nds32_intrinsic.h
  2cc04688f7b247c63c935d078beb8e6f  gcc/config/nds32/pipelines.md
*************** f2f82ddd29bb854d065d82aa62b0a021  gcc/co
*** 3785,3791 ****
  6b26d5d3ff3a79dd827a88f892e0b2b6  gcc/config/openbsd.opt
  7d69f6873c16b8c3223922031031eb0f  gcc/config/pa/constraints.md
  8ab8f3e04923ea640a65e3b19b67da1f  gcc/config/pa/elf.h
! 1325280e4f80c08b7024e8cdccb553d1  gcc/config/pa/pa-64.h
  4957e7e4320aab5af1a8cde6eb37814b  gcc/config/pa/pa-hpux.h
  8fadce90969f5865338d7ac1cb63f9ba  gcc/config/pa/pa-hpux.opt
  e7d4eb2e8de5d84d28b97fb106c2971a  gcc/config/pa/pa-hpux10.h
--- 3786,3792 ----
  6b26d5d3ff3a79dd827a88f892e0b2b6  gcc/config/openbsd.opt
  7d69f6873c16b8c3223922031031eb0f  gcc/config/pa/constraints.md
  8ab8f3e04923ea640a65e3b19b67da1f  gcc/config/pa/elf.h
! 5162998eb9898f006d5e73141a0f190b  gcc/config/pa/pa-64.h
  4957e7e4320aab5af1a8cde6eb37814b  gcc/config/pa/pa-hpux.h
  8fadce90969f5865338d7ac1cb63f9ba  gcc/config/pa/pa-hpux.opt
  e7d4eb2e8de5d84d28b97fb106c2971a  gcc/config/pa/pa-hpux10.h
*************** dbd19b8d99a7394dd85a52eeade6ecbc  gcc/co
*** 3803,3809 ****
  c68d02fd5106c675bddc293ac697311d  gcc/config/pa/pa-opts.h
  2e2d21b45ee74f94060493cde2d83ac8  gcc/config/pa/pa-protos.h
  b6b8fa1a99a367bf57672bd84f74f9a2  gcc/config/pa/pa.c
! 2448916772a338b27908d6a8c8c08483  gcc/config/pa/pa.h
  54e4d58e22cb34811a632243df5ce9c7  gcc/config/pa/pa.md
  9d249d72c9096863936e136d45fabf64  gcc/config/pa/pa.opt
  222ae0649ede14febec61a70255326de  gcc/config/pa/pa32-linux.h
--- 3804,3810 ----
  c68d02fd5106c675bddc293ac697311d  gcc/config/pa/pa-opts.h
  2e2d21b45ee74f94060493cde2d83ac8  gcc/config/pa/pa-protos.h
  b6b8fa1a99a367bf57672bd84f74f9a2  gcc/config/pa/pa.c
! 53be487f5fac638d670c2ccaf704363e  gcc/config/pa/pa.h
  54e4d58e22cb34811a632243df5ce9c7  gcc/config/pa/pa.md
  9d249d72c9096863936e136d45fabf64  gcc/config/pa/pa.opt
  222ae0649ede14febec61a70255326de  gcc/config/pa/pa32-linux.h
*************** e09f6c3bf726f2bfd6de8b0e9c86c64a  gcc/co
*** 3827,3841 ****
  b966c76e059535d68fd33aee5ec3b3c4  gcc/config/pdp11/pdp11.opt
  77785f3c0e28619b7492de88602b8d9a  gcc/config/pdp11/predicates.md
  158b6c7188210226d224bc14a0870620  gcc/config/pdp11/t-pdp11
  6e63ccd3726ddf197b6f101db1742249  gcc/config/print-sysroot-suffix.sh
  19a920b237b4d7c5c75574e44f50c9a4  gcc/config/rl78/constraints.md
  00ba3d9b723fd3d0550a89585db3e926  gcc/config/rl78/predicates.md
  4b1fd223f86f7d784d489fd9fcc03945  gcc/config/rl78/rl78-c.c
! 4420152dd94121c743e5d797e7ef4319  gcc/config/rl78/rl78-expand.md
  f4128845cbfea71c6559842238dbe5d1  gcc/config/rl78/rl78-opts.h
  34ad90b30fdf56b4d3726b904cf11f1f  gcc/config/rl78/rl78-protos.h
! c111eb9cd5b8e19cc8987389e4064f77  gcc/config/rl78/rl78-real.md
! 4ceb455f76dad299c4ba022234f1c981  gcc/config/rl78/rl78-virt.md
  0cfcc0de7260e55936a4ed294500f33a  gcc/config/rl78/rl78.c
  514aa983f65c50c065bb4c39caca0498  gcc/config/rl78/rl78.h
  fc6268b9639f6b659ceefb24a0a25c94  gcc/config/rl78/rl78.md
--- 3828,3843 ----
  b966c76e059535d68fd33aee5ec3b3c4  gcc/config/pdp11/pdp11.opt
  77785f3c0e28619b7492de88602b8d9a  gcc/config/pdp11/predicates.md
  158b6c7188210226d224bc14a0870620  gcc/config/pdp11/t-pdp11
+ 3d4953a89b7bc3a9a40717a59ddabe7b  gcc/config/phoenix.h
  6e63ccd3726ddf197b6f101db1742249  gcc/config/print-sysroot-suffix.sh
  19a920b237b4d7c5c75574e44f50c9a4  gcc/config/rl78/constraints.md
  00ba3d9b723fd3d0550a89585db3e926  gcc/config/rl78/predicates.md
  4b1fd223f86f7d784d489fd9fcc03945  gcc/config/rl78/rl78-c.c
! 4b54162336b3e80831d877672c2541bb  gcc/config/rl78/rl78-expand.md
  f4128845cbfea71c6559842238dbe5d1  gcc/config/rl78/rl78-opts.h
  34ad90b30fdf56b4d3726b904cf11f1f  gcc/config/rl78/rl78-protos.h
! 0c8e34a518717cea7b4a4f1a938bebd1  gcc/config/rl78/rl78-real.md
! b660d56bc0324fca64493359aed62c16  gcc/config/rl78/rl78-virt.md
  0cfcc0de7260e55936a4ed294500f33a  gcc/config/rl78/rl78.c
  514aa983f65c50c065bb4c39caca0498  gcc/config/rl78/rl78.h
  fc6268b9639f6b659ceefb24a0a25c94  gcc/config/rl78/rl78.md
*************** bf1281e85188416fb3c536e3dd09a329  gcc/co
*** 3864,3870 ****
  b648f4e9a3ac8fa18b30372e9c64a281  gcc/config/rs6000/aix61.h
  8b6cda1854bf876da30deebc9bd2e1ae  gcc/config/rs6000/aix64.opt
  41d29ed56192ef27453dee7ce89ee7f7  gcc/config/rs6000/altivec.h
! 56b94927d02598af4f6c218ac57ceb4c  gcc/config/rs6000/altivec.md
  5952cf6449f03e6fd89ecea89d5a3f57  gcc/config/rs6000/biarch64.h
  46d4506973bee3c7ae5988723d24695c  gcc/config/rs6000/cell.md
  2f33b542dec1e0b08fa3d56649f42299  gcc/config/rs6000/constraints.md
--- 3866,3872 ----
  b648f4e9a3ac8fa18b30372e9c64a281  gcc/config/rs6000/aix61.h
  8b6cda1854bf876da30deebc9bd2e1ae  gcc/config/rs6000/aix64.opt
  41d29ed56192ef27453dee7ce89ee7f7  gcc/config/rs6000/altivec.h
! f6bf4110294956afe8780507e9a68f0e  gcc/config/rs6000/altivec.md
  5952cf6449f03e6fd89ecea89d5a3f57  gcc/config/rs6000/biarch64.h
  46d4506973bee3c7ae5988723d24695c  gcc/config/rs6000/cell.md
  2f33b542dec1e0b08fa3d56649f42299  gcc/config/rs6000/constraints.md
*************** d3d79029594a6aca5ec3a4d1c887fdf3  gcc/co
*** 3876,3882 ****
  6eaf34684f54fe653cabe59ef4deca36  gcc/config/rs6000/darwin7.h
  84b7ba46e65bc9abb5617a1016d1ec4d  gcc/config/rs6000/darwin8.h
  f52ff97bc4fac70d3899553b99647de8  gcc/config/rs6000/default64.h
! f8b86b5eed3c097f1bb39511768ea322  gcc/config/rs6000/dfp.md
  6a61b13e7ef97ec4ed09217709819256  gcc/config/rs6000/driver-rs6000.c
  b1a606e933e9a6831fdd32e091f13165  gcc/config/rs6000/e300c2c3.md
  3c0a49ad14740b7724827fe0b2b879fa  gcc/config/rs6000/e500.h
--- 3878,3884 ----
  6eaf34684f54fe653cabe59ef4deca36  gcc/config/rs6000/darwin7.h
  84b7ba46e65bc9abb5617a1016d1ec4d  gcc/config/rs6000/darwin8.h
  f52ff97bc4fac70d3899553b99647de8  gcc/config/rs6000/default64.h
! e42b78e3645340c28b2d55960e379f8f  gcc/config/rs6000/dfp.md
  6a61b13e7ef97ec4ed09217709819256  gcc/config/rs6000/driver-rs6000.c
  b1a606e933e9a6831fdd32e091f13165  gcc/config/rs6000/e300c2c3.md
  3c0a49ad14740b7724827fe0b2b879fa  gcc/config/rs6000/e500.h
*************** ecd74625764a2b4718ac37837e8442e5  gcc/co
*** 3915,3933 ****
  cd55670102b2a9ef3ea856c4c0fb2ba6  gcc/config/rs6000/power8.md
  b409b61409844cab129e5a77eaf163d7  gcc/config/rs6000/ppc-asm.h
  cfd7414742451c6f011957f9f2e1b3f9  gcc/config/rs6000/ppu_intrinsics.h
! 0f93d61cd6bffe78b903bc70bf86dff0  gcc/config/rs6000/predicates.md
  e385a2129c0978046deffd1496417c78  gcc/config/rs6000/rs6000-builtin.def
! e6328ce034cf87ad14cf70a765a79b29  gcc/config/rs6000/rs6000-c.c
  02659e20870aef2cb61ee694d4ceca1c  gcc/config/rs6000/rs6000-cpus.def
  ca9cce7eceaae7905883313d424a065a  gcc/config/rs6000/rs6000-linux.c
  47e3c5fbc504bfe4dfbc11909e098db4  gcc/config/rs6000/rs6000-modes.def
  149c241d531b4183fe25223e6d6dba59  gcc/config/rs6000/rs6000-opts.h
  695a92733d70b8b317df1b06b34c3d38  gcc/config/rs6000/rs6000-protos.h
  db5cdcfe6297550b83dca0939d147757  gcc/config/rs6000/rs6000-tables.opt
! 4f60aa9002665674df115f423aca8e10  gcc/config/rs6000/rs6000.c
  8d5a724208a1ecc4f4058cf625847dfc  gcc/config/rs6000/rs6000.h
! 3f36907078b5581e548939c1b297fb60  gcc/config/rs6000/rs6000.md
! 4607c6002dd083a4d7f1e2eb909c9c10  gcc/config/rs6000/rs6000.opt
  afe511915e25cc2df8d24f22a4dacf59  gcc/config/rs6000/rs64.md
  6d67852323b959ae3981f79cbe95d969  gcc/config/rs6000/rtems.h
  350faafa367b016d44e959968d98482e  gcc/config/rs6000/secureplt.h
--- 3917,3935 ----
  cd55670102b2a9ef3ea856c4c0fb2ba6  gcc/config/rs6000/power8.md
  b409b61409844cab129e5a77eaf163d7  gcc/config/rs6000/ppc-asm.h
  cfd7414742451c6f011957f9f2e1b3f9  gcc/config/rs6000/ppu_intrinsics.h
! d525dee92cb5ac8a3b931d538d71d10a  gcc/config/rs6000/predicates.md
  e385a2129c0978046deffd1496417c78  gcc/config/rs6000/rs6000-builtin.def
! d01fe3eeefc5bcb9bd54fd57d0b0d9a4  gcc/config/rs6000/rs6000-c.c
  02659e20870aef2cb61ee694d4ceca1c  gcc/config/rs6000/rs6000-cpus.def
  ca9cce7eceaae7905883313d424a065a  gcc/config/rs6000/rs6000-linux.c
  47e3c5fbc504bfe4dfbc11909e098db4  gcc/config/rs6000/rs6000-modes.def
  149c241d531b4183fe25223e6d6dba59  gcc/config/rs6000/rs6000-opts.h
  695a92733d70b8b317df1b06b34c3d38  gcc/config/rs6000/rs6000-protos.h
  db5cdcfe6297550b83dca0939d147757  gcc/config/rs6000/rs6000-tables.opt
! 8124edc93f06a297b46aa2f54a1c48c1  gcc/config/rs6000/rs6000.c
  8d5a724208a1ecc4f4058cf625847dfc  gcc/config/rs6000/rs6000.h
! a4bf28479ce1edca42e816c8fdb98527  gcc/config/rs6000/rs6000.md
! 8323a2213a3c258aa620ed863769a2be  gcc/config/rs6000/rs6000.opt
  afe511915e25cc2df8d24f22a4dacf59  gcc/config/rs6000/rs64.md
  6d67852323b959ae3981f79cbe95d969  gcc/config/rs6000/rtems.h
  350faafa367b016d44e959968d98482e  gcc/config/rs6000/secureplt.h
*************** f11925c88524d2fd457bf77944da1302  gcc/co
*** 3966,3973 ****
  2ab98352654d265da592306ab6e439fd  gcc/config/rs6000/t-xilinx
  72067f4046e2d66876186dfa091b2636  gcc/config/rs6000/titan.md
  42504c2ef22746e861059312c3492c00  gcc/config/rs6000/vec_types.h
! 09f69e2fcb69bc7cc10ce77e8df86c18  gcc/config/rs6000/vector.md
! dd0ed2e45d3b3ea97a664cb92a00f82a  gcc/config/rs6000/vsx.md
  0c7d72b259870d8be6012f350136854c  gcc/config/rs6000/vxworks.h
  1ae3a28589baa5fb1f1efe7e75c1107b  gcc/config/rs6000/vxworksae.h
  cb78b51b1406240d997249e705591527  gcc/config/rs6000/vxworksmils.h
--- 3968,3975 ----
  2ab98352654d265da592306ab6e439fd  gcc/config/rs6000/t-xilinx
  72067f4046e2d66876186dfa091b2636  gcc/config/rs6000/titan.md
  42504c2ef22746e861059312c3492c00  gcc/config/rs6000/vec_types.h
! 781267551a7657b797686f9a0d3dc20b  gcc/config/rs6000/vector.md
! 69c523d0f8389b5875358760e6c62167  gcc/config/rs6000/vsx.md
  0c7d72b259870d8be6012f350136854c  gcc/config/rs6000/vxworks.h
  1ae3a28589baa5fb1f1efe7e75c1107b  gcc/config/rs6000/vxworksae.h
  cb78b51b1406240d997249e705591527  gcc/config/rs6000/vxworksmils.h
*************** cfb3b7da071260e3d0eadb52c0335762  gcc/co
*** 4008,4019 ****
  060bacb82e02c9d7e6ebd34357df49f4  gcc/config/s390/s390-builtins.def
  892ffdc8d427ae0fa334e6416bd74307  gcc/config/s390/s390-builtins.h
  b8c55f8000968a13283554455e8aae27  gcc/config/s390/s390-c.c
! 4efe80ced85e6d5ded1a54bca70824dd  gcc/config/s390/s390-modes.def
  af851b7231b43cfc7ea2a5cc69b945f7  gcc/config/s390/s390-opts.h
  5047b00d5b6ebe9b578f6b442c28255c  gcc/config/s390/s390-protos.h
! 5c08ac1d49f9a668a11e0b0540da6097  gcc/config/s390/s390.c
  108ef364e95bf7060e670f50c8fd38fa  gcc/config/s390/s390.h
! 24c673dd68d9281d7f43f561e4c6df91  gcc/config/s390/s390.md
  013a72cc3bada0279bb8e2a03231465e  gcc/config/s390/s390.opt
  1df5b0729d0722c9a4174d7d83d0dc21  gcc/config/s390/s390intrin.h
  816c30c9d2dc91264478fe08d3dd2650  gcc/config/s390/s390x.h
--- 4010,4021 ----
  060bacb82e02c9d7e6ebd34357df49f4  gcc/config/s390/s390-builtins.def
  892ffdc8d427ae0fa334e6416bd74307  gcc/config/s390/s390-builtins.h
  b8c55f8000968a13283554455e8aae27  gcc/config/s390/s390-c.c
! 0577b906af4351c385aab7622b211375  gcc/config/s390/s390-modes.def
  af851b7231b43cfc7ea2a5cc69b945f7  gcc/config/s390/s390-opts.h
  5047b00d5b6ebe9b578f6b442c28255c  gcc/config/s390/s390-protos.h
! 0c2a34e1f2cec1881a03195a001c9093  gcc/config/s390/s390.c
  108ef364e95bf7060e670f50c8fd38fa  gcc/config/s390/s390.h
! 775bf41bdc4bb6f423cd277ec7001712  gcc/config/s390/s390.md
  013a72cc3bada0279bb8e2a03231465e  gcc/config/s390/s390.opt
  1df5b0729d0722c9a4174d7d83d0dc21  gcc/config/s390/s390intrin.h
  816c30c9d2dc91264478fe08d3dd2650  gcc/config/s390/s390x.h
*************** a22fdd36012b46039c6d3753876aedee  gcc/co
*** 4024,4030 ****
  b781130f84559c48a529a31501aa4f36  gcc/config/s390/tpf.opt
  35e32703631204cb3efd823e3cb23401  gcc/config/s390/vecintrin.h
  6f457d5f18623f6f6b5d95ee34d179f2  gcc/config/s390/vector.md
! af7493c7d7faec01800d1dce594d06c6  gcc/config/s390/vx-builtins.md
  19ca86f8a1c4aabdac3693f3185a58d9  gcc/config/sh/constraints.md
  e634bc0a7498a9646068a25e19f266fe  gcc/config/sh/divcost-analysis
  f9ecb7ed332092641193742f392240b7  gcc/config/sh/divtab-sh4-300.c
--- 4026,4032 ----
  b781130f84559c48a529a31501aa4f36  gcc/config/s390/tpf.opt
  35e32703631204cb3efd823e3cb23401  gcc/config/s390/vecintrin.h
  6f457d5f18623f6f6b5d95ee34d179f2  gcc/config/s390/vector.md
! 5c1f91cf1b3aa105fb5ff1c42b03095b  gcc/config/s390/vx-builtins.md
  19ca86f8a1c4aabdac3693f3185a58d9  gcc/config/sh/constraints.md
  e634bc0a7498a9646068a25e19f266fe  gcc/config/sh/divcost-analysis
  f9ecb7ed332092641193742f392240b7  gcc/config/sh/divtab-sh4-300.c
*************** b26d21e9f6e46519916ee1762fcb2bdb  gcc/co
*** 4041,4050 ****
  6f06183109e4cecafda2d0172a99d2b5  gcc/config/sh/rtems.h
  e90cf3deb43456727d13d98e4373de8a  gcc/config/sh/rtemself.h
  a1f2be25e7def1af3303f4db38e19b73  gcc/config/sh/sh-c.c
! 836e7d7561de75df2fbbfcf292915268  gcc/config/sh/sh-mem.cc
  1a8a0f1811d317a447dad6e06f768f43  gcc/config/sh/sh-modes.def
  a9ed91e97940274b262c401fbb92af1f  gcc/config/sh/sh-protos.h
! 87ef37179195dcea104bdb7924ba7c4f  gcc/config/sh/sh.c
  8acdb096d4738a7fe759cf65c5846668  gcc/config/sh/sh.h
  e434fd5ded379df9515ac9289255838a  gcc/config/sh/sh.md
  e51857b4a25d0efe072817569a945917  gcc/config/sh/sh.opt
--- 4043,4052 ----
  6f06183109e4cecafda2d0172a99d2b5  gcc/config/sh/rtems.h
  e90cf3deb43456727d13d98e4373de8a  gcc/config/sh/rtemself.h
  a1f2be25e7def1af3303f4db38e19b73  gcc/config/sh/sh-c.c
! 12ab8bf62cb7178a681d2a16d26b9af2  gcc/config/sh/sh-mem.cc
  1a8a0f1811d317a447dad6e06f768f43  gcc/config/sh/sh-modes.def
  a9ed91e97940274b262c401fbb92af1f  gcc/config/sh/sh-protos.h
! 5508ab8a6ad6d2e9e9c18fac277b8664  gcc/config/sh/sh.c
  8acdb096d4738a7fe759cf65c5846668  gcc/config/sh/sh.h
  e434fd5ded379df9515ac9289255838a  gcc/config/sh/sh.md
  e51857b4a25d0efe072817569a945917  gcc/config/sh/sh.opt
*************** dffaad383271c87c9971daaa72a7ddbe  gcc/co
*** 4054,4060 ****
  6e0433e452d1ded0f054f4f53a7cd636  gcc/config/sh/sh4a.md
  6575bd755bced7ac56fbd35f95a56481  gcc/config/sh/sh64.h
  60c7f5059ba69e47a1a128fb2f132b47  gcc/config/sh/sh_optimize_sett_clrt.cc
! be474c7653a11337c844fb6187a5034f  gcc/config/sh/sh_treg_combine.cc
  47368903c836483f38b16bfea6a49e0d  gcc/config/sh/shmedia.h
  98d86b24c78f1325dfd3687e283cfb13  gcc/config/sh/shmedia.md
  dd6af26779e40dcce2c1288d77d7945a  gcc/config/sh/sshmedia.h
--- 4056,4062 ----
  6e0433e452d1ded0f054f4f53a7cd636  gcc/config/sh/sh4a.md
  6575bd755bced7ac56fbd35f95a56481  gcc/config/sh/sh64.h
  60c7f5059ba69e47a1a128fb2f132b47  gcc/config/sh/sh_optimize_sett_clrt.cc
! 81959f1b36f45ec9c776b3b1a142bc26  gcc/config/sh/sh_treg_combine.cc
  47368903c836483f38b16bfea6a49e0d  gcc/config/sh/shmedia.h
  98d86b24c78f1325dfd3687e283cfb13  gcc/config/sh/shmedia.md
  dd6af26779e40dcce2c1288d77d7945a  gcc/config/sh/sshmedia.h
*************** c2e93efa41c288ae579502de444c6a65  gcc/co
*** 4104,4112 ****
  3fb56d730dc139eab2e9e90475e4fe36  gcc/config/sparc/sparc-modes.def
  93f942a0f107322f75b9616e76070cfe  gcc/config/sparc/sparc-opts.h
  828b560b0d6b8c4dd5c06a3ee9afe4ec  gcc/config/sparc/sparc-protos.h
! 5f5d36b54027cd47587a5eb5b471139a  gcc/config/sparc/sparc.c
  937f7a829a27ca3a3e3e3a784449436d  gcc/config/sparc/sparc.h
! a7896aabe77bd6f41a510e51cee629c1  gcc/config/sparc/sparc.md
  346a2335f5deaaa18572faa44a26ca47  gcc/config/sparc/sparc.opt
  b31b0ff0a45f969d6e5dc6b7eac92b96  gcc/config/sparc/sparclet.md
  92cd12eccf668b5fbb3158e3c1999085  gcc/config/sparc/supersparc.md
--- 4106,4114 ----
  3fb56d730dc139eab2e9e90475e4fe36  gcc/config/sparc/sparc-modes.def
  93f942a0f107322f75b9616e76070cfe  gcc/config/sparc/sparc-opts.h
  828b560b0d6b8c4dd5c06a3ee9afe4ec  gcc/config/sparc/sparc-protos.h
! 4cc8a8d8396d82150e99ac2d0bb3561c  gcc/config/sparc/sparc.c
  937f7a829a27ca3a3e3e3a784449436d  gcc/config/sparc/sparc.h
! 3432fc32324e60965d1065a8476caca2  gcc/config/sparc/sparc.md
  346a2335f5deaaa18572faa44a26ca47  gcc/config/sparc/sparc.opt
  b31b0ff0a45f969d6e5dc6b7eac92b96  gcc/config/sparc/sparclet.md
  92cd12eccf668b5fbb3158e3c1999085  gcc/config/sparc/supersparc.md
*************** cfd064ab987fb08662de0902cbc81306  gcc/co
*** 4284,4292 ****
  c5ee6a235e6e0f65fe5ef344d7420beb  gcc/config/xtensa/predicates.md
  13c1600e0881a65f5ab4ca414e83d67f  gcc/config/xtensa/t-xtensa
  9cb475642d319b89cf7c565c149e79d8  gcc/config/xtensa/xtensa-protos.h
! cc6fb209fa143d18893dea5600b4999f  gcc/config/xtensa/xtensa.c
! a755f15366530860e5142ee78d6d468b  gcc/config/xtensa/xtensa.h
! e122336e286a995fa6bb129b6b042d4f  gcc/config/xtensa/xtensa.md
  74a14a35ae97d7c3c9b692999e1c30a5  gcc/config/xtensa/xtensa.opt
  41dc38f39a10ef48995c6e74e44ecdf3  gcc/configure
  5dc1c46ffd4f1346be87506c9ab6ae34  gcc/configure.ac
--- 4286,4294 ----
  c5ee6a235e6e0f65fe5ef344d7420beb  gcc/config/xtensa/predicates.md
  13c1600e0881a65f5ab4ca414e83d67f  gcc/config/xtensa/t-xtensa
  9cb475642d319b89cf7c565c149e79d8  gcc/config/xtensa/xtensa-protos.h
! 369d50bf12e338733aa4029b562f7118  gcc/config/xtensa/xtensa.c
! 0daf622a732b2f603432f36ecd8bc912  gcc/config/xtensa/xtensa.h
! 9f52f0028e69eb8461d3db3d80e6c579  gcc/config/xtensa/xtensa.md
  74a14a35ae97d7c3c9b692999e1c30a5  gcc/config/xtensa/xtensa.opt
  41dc38f39a10ef48995c6e74e44ecdf3  gcc/configure
  5dc1c46ffd4f1346be87506c9ab6ae34  gcc/configure.ac
*************** b69f872a79a3f8e718ec4f1c6b8599fc  gcc/co
*** 4295,4303 ****
  47496161de9c7fcd9fb836e6bdfd84f3  gcc/convert.c
  560935e4d05616b019e3aabc3eb3e249  gcc/convert.h
  55158952f4f6a088c5161bf605a95ad8  gcc/coretypes.h
! 31450b12de7205cd1cb0865cda6e4b52  gcc/coverage.c
! b01856dfc25f61629dfe6c74589c750b  gcc/coverage.h
! 4483ced400311387e08104b90d91c731  gcc/cp/ChangeLog
  d271e3663538ba1f3281cab3838e92cd  gcc/cp/ChangeLog-1993
  f5a44adbc05521162350ca409d1d95ce  gcc/cp/ChangeLog-1994
  ac55db48d964cb5469ff03c1cd3ee04d  gcc/cp/ChangeLog-1995
--- 4297,4305 ----
  47496161de9c7fcd9fb836e6bdfd84f3  gcc/convert.c
  560935e4d05616b019e3aabc3eb3e249  gcc/convert.h
  55158952f4f6a088c5161bf605a95ad8  gcc/coretypes.h
! 2191d9522bf81246d317765d4a290433  gcc/coverage.c
! 3a0647130234c9e76d38e07967e0f63c  gcc/coverage.h
! f43be459488ec149d47c785d3398064d  gcc/cp/ChangeLog
  d271e3663538ba1f3281cab3838e92cd  gcc/cp/ChangeLog-1993
  f5a44adbc05521162350ca409d1d95ce  gcc/cp/ChangeLog-1994
  ac55db48d964cb5469ff03c1cd3ee04d  gcc/cp/ChangeLog-1995
*************** c1c7801b9b0f379e702a4f6cb83972e7  gcc/cp
*** 4324,4338 ****
  9aa3cd9f75c785de9f51446e3f295515  gcc/cp/ChangeLog.tree-ssa
  a35afb6f28485d83b11acc636ce0379c  gcc/cp/Make-lang.in
  5f11793a1e6386d649740ef916b77c05  gcc/cp/NEWS
! 548ccbb407885b7cc52ebabc0cc79a84  gcc/cp/call.c
  352c265b6d2007069d76ce309f20515d  gcc/cp/cfns.gperf
  0bcfb2ea91871c488b2040f78c3be957  gcc/cp/cfns.h
! a88cd1d133409093083900d429a57da7  gcc/cp/class.c
  dad5f05a7295bc94cfa76b77f4511a37  gcc/cp/config-lang.in
! 5f0c95122f904ea9a7e4ade74772e214  gcc/cp/constexpr.c
  2d638c0370427eddd5d4c840c6a0f321  gcc/cp/cp-array-notation.c
  6baea5a04ad796017eff7b170ee38ba7  gcc/cp/cp-cilkplus.c
! 220d44f54f7cd405ab9b803c018655ca  gcc/cp/cp-gimplify.c
  8262f495460c80092155872364535d99  gcc/cp/cp-lang.c
  23cc08261a09f111af34b468b718b52b  gcc/cp/cp-objcp-common.c
  d7e0e1f83044eba73c84c0d35e56763a  gcc/cp/cp-objcp-common.h
--- 4326,4340 ----
  9aa3cd9f75c785de9f51446e3f295515  gcc/cp/ChangeLog.tree-ssa
  a35afb6f28485d83b11acc636ce0379c  gcc/cp/Make-lang.in
  5f11793a1e6386d649740ef916b77c05  gcc/cp/NEWS
! 290bcbd3d2ebbb9a7f64351ba512fb30  gcc/cp/call.c
  352c265b6d2007069d76ce309f20515d  gcc/cp/cfns.gperf
  0bcfb2ea91871c488b2040f78c3be957  gcc/cp/cfns.h
! 98c3a36e80e713db2cc0c36fb438c987  gcc/cp/class.c
  dad5f05a7295bc94cfa76b77f4511a37  gcc/cp/config-lang.in
! 03ae2c99615baa9e637c91c76fa34dd2  gcc/cp/constexpr.c
  2d638c0370427eddd5d4c840c6a0f321  gcc/cp/cp-array-notation.c
  6baea5a04ad796017eff7b170ee38ba7  gcc/cp/cp-cilkplus.c
! 9674bf46b13e615d3754b60bff36f6a1  gcc/cp/cp-gimplify.c
  8262f495460c80092155872364535d99  gcc/cp/cp-lang.c
  23cc08261a09f111af34b468b718b52b  gcc/cp/cp-objcp-common.c
  d7e0e1f83044eba73c84c0d35e56763a  gcc/cp/cp-objcp-common.h
*************** d7e0e1f83044eba73c84c0d35e56763a  gcc/cp
*** 4342,4377 ****
  1e3a65ca8e2459379ff5090c6ec456a0  gcc/cp/cvt.c
  6da130fdedbec68dc9e0d046433d14f4  gcc/cp/cxx-pretty-print.c
  20a57d655e4d2d3183849af2faede75b  gcc/cp/cxx-pretty-print.h
! 0bd59bd741816d205e5b9016d15640da  gcc/cp/decl.c
  1668d1f49273e2e676d9b5f1234568ca  gcc/cp/decl.h
  58fcafabfd995738d5f31a58afc07cd0  gcc/cp/decl2.c
  556e8982c998ffa19d4f15920516a53c  gcc/cp/dump.c
! 209c351bdb14a02156fc95ca33a18bd3  gcc/cp/error.c
  d9306d2dcd7aa71b259b6a1b49ae9e3a  gcc/cp/except.c
  a19b5642a6fa5947c562b382923ed923  gcc/cp/expr.c
  a342cbf63ac4fe18b1b86c6ff3548dd8  gcc/cp/friend.c
  42e59479800fef67acec53d0631e2bde  gcc/cp/g++spec.c
! 466a3e249c420a7600f3503fbf7761bc  gcc/cp/init.c
  8d9a9f4d9ca662ec21a80540015e9d1b  gcc/cp/lambda.c
  dfde77f68151e87026af48b761aca689  gcc/cp/lang-specs.h
  4dfedff05d91465160b7c3f098971188  gcc/cp/lex.c
! 6b16dbdfb02a80f5002597e38c53b037  gcc/cp/mangle.c
  f1b9736aa9f12ebfb99f1d868a0abe86  gcc/cp/method.c
! 9bae650ba882bcfa7a9864b54bc967c4  gcc/cp/name-lookup.c
  0e08e75ed3219873fa76700070ae4abe  gcc/cp/name-lookup.h
  c942b0cde1e9b504e5b7765387c9fc46  gcc/cp/operators.def
  c241dc64f510e67d41a06e0c05e9331d  gcc/cp/optimize.c
! ab6cd6a6816d190444b6fa0123eee02a  gcc/cp/parser.c
  6237b196d1cc139d803af821f62682d3  gcc/cp/parser.h
! f105d053c30b6e5227056e2f849f3134  gcc/cp/pt.c
  3b45a396f99a5effe46a093aef55a1e1  gcc/cp/ptree.c
  9b9c6628cd989728622afbd5b1535c6b  gcc/cp/repo.c
  de20aee2e1cc629d6436a2c8496bb598  gcc/cp/rtti.c
  25f26bbe516fc5327993de6152d67af4  gcc/cp/search.c
! f65b100dc3a8a1da9bee207706611e4a  gcc/cp/semantics.c
! 9c65c9064bb715902f00e804f68d0de6  gcc/cp/tree.c
  8b05dc6f4c2e308039c086564649d3ba  gcc/cp/type-utils.h
! 1d3c42933b6c792e690279ce05dff100  gcc/cp/typeck.c
  130e41e91946a3e13931f30f881c6dbb  gcc/cp/typeck2.c
  5193c6e43c9b47293bb84da8b33597ca  gcc/cp/vtable-class-hierarchy.c
  4871eb4df13d7d829c2d51708f5ead75  gcc/cppbuiltin.c
--- 4344,4379 ----
  1e3a65ca8e2459379ff5090c6ec456a0  gcc/cp/cvt.c
  6da130fdedbec68dc9e0d046433d14f4  gcc/cp/cxx-pretty-print.c
  20a57d655e4d2d3183849af2faede75b  gcc/cp/cxx-pretty-print.h
! 5897b4b550743266d3848dba396bdfa8  gcc/cp/decl.c
  1668d1f49273e2e676d9b5f1234568ca  gcc/cp/decl.h
  58fcafabfd995738d5f31a58afc07cd0  gcc/cp/decl2.c
  556e8982c998ffa19d4f15920516a53c  gcc/cp/dump.c
! e9229d46cb36c2c6833818bb68454901  gcc/cp/error.c
  d9306d2dcd7aa71b259b6a1b49ae9e3a  gcc/cp/except.c
  a19b5642a6fa5947c562b382923ed923  gcc/cp/expr.c
  a342cbf63ac4fe18b1b86c6ff3548dd8  gcc/cp/friend.c
  42e59479800fef67acec53d0631e2bde  gcc/cp/g++spec.c
! b5e39318ef37f628711be0f94e46f2c7  gcc/cp/init.c
  8d9a9f4d9ca662ec21a80540015e9d1b  gcc/cp/lambda.c
  dfde77f68151e87026af48b761aca689  gcc/cp/lang-specs.h
  4dfedff05d91465160b7c3f098971188  gcc/cp/lex.c
! e2d445431f15b7641f9d98dbd9becd13  gcc/cp/mangle.c
  f1b9736aa9f12ebfb99f1d868a0abe86  gcc/cp/method.c
! ae7f5569dc9edf185ca90e3a1d4f66b7  gcc/cp/name-lookup.c
  0e08e75ed3219873fa76700070ae4abe  gcc/cp/name-lookup.h
  c942b0cde1e9b504e5b7765387c9fc46  gcc/cp/operators.def
  c241dc64f510e67d41a06e0c05e9331d  gcc/cp/optimize.c
! 60ffd15663bdf876c32c3339f80117de  gcc/cp/parser.c
  6237b196d1cc139d803af821f62682d3  gcc/cp/parser.h
! c7534ccc1ec4ff19527ba1c6abada758  gcc/cp/pt.c
  3b45a396f99a5effe46a093aef55a1e1  gcc/cp/ptree.c
  9b9c6628cd989728622afbd5b1535c6b  gcc/cp/repo.c
  de20aee2e1cc629d6436a2c8496bb598  gcc/cp/rtti.c
  25f26bbe516fc5327993de6152d67af4  gcc/cp/search.c
! e32d731619b85159251d989aa3c3404c  gcc/cp/semantics.c
! 5bda0bb9c2b975d8971f424a9dc1c466  gcc/cp/tree.c
  8b05dc6f4c2e308039c086564649d3ba  gcc/cp/type-utils.h
! d3d5b038b027d60f614657a0d3eed416  gcc/cp/typeck.c
  130e41e91946a3e13931f30f881c6dbb  gcc/cp/typeck2.c
  5193c6e43c9b47293bb84da8b33597ca  gcc/cp/vtable-class-hierarchy.c
  4871eb4df13d7d829c2d51708f5ead75  gcc/cppbuiltin.c
*************** b51bd14f795b60d37179a504a23bffdb  gcc/cp
*** 4380,4390 ****
  b747029f386b6e45beb42096b365930b  gcc/cppdefault.h
  8d31cc983db2a45e9de8efcd1fb92e5c  gcc/cprop.c
  a89ef7e7b0cfb3017e85f60858f46e9a  gcc/cse.c
! cf7835be85d7d4c8a60e88c5fe74c0a2  gcc/cselib.c
  01e16506b0d09fd5e45580729e60fa17  gcc/cselib.h
  1ded054093de910d9786c62bc4fe8cc6  gcc/cstamp-h.in
! 356e890d657af55873d01731b58f104d  gcc/data-streamer-in.c
! af36f021b621e0a92ef79b975da08301  gcc/data-streamer-out.c
  13769a7879f5a79afd282dac0147be84  gcc/data-streamer.c
  101a4e32486e78e4840a6565b185783c  gcc/data-streamer.h
  bfb65567701868d8a65af35d18c56d43  gcc/dbgcnt.c
--- 4382,4392 ----
  b747029f386b6e45beb42096b365930b  gcc/cppdefault.h
  8d31cc983db2a45e9de8efcd1fb92e5c  gcc/cprop.c
  a89ef7e7b0cfb3017e85f60858f46e9a  gcc/cse.c
! 70102126363e224214d10f289b721fd8  gcc/cselib.c
  01e16506b0d09fd5e45580729e60fa17  gcc/cselib.h
  1ded054093de910d9786c62bc4fe8cc6  gcc/cstamp-h.in
! 31a7538e243bc920e621bf109ce718d4  gcc/data-streamer-in.c
! 680d1e5df139a36f25073ea469d16d94  gcc/data-streamer-out.c
  13769a7879f5a79afd282dac0147be84  gcc/data-streamer.c
  101a4e32486e78e4840a6565b185783c  gcc/data-streamer.h
  bfb65567701868d8a65af35d18c56d43  gcc/dbgcnt.c
*************** a1b544e6774f10bdfc2440052daf0c8a  gcc/df
*** 4408,4417 ****
  6331114b9e736f95bdfc9005bacf214f  gcc/diagnostic-color.c
  46cb891ca5a35344946f12490dc2eb61  gcc/diagnostic-color.h
  8a4857f6557756cfcdc4537f8fba0d5a  gcc/diagnostic-core.h
! 34b3cf16b32816f7a6b87124518c5c36  gcc/diagnostic.c
  b0ab0f79edb20523f7d1502fbb3e67fe  gcc/diagnostic.def
  d0c066e7c7f55d0e632d6b9c5b079e75  gcc/diagnostic.h
! c4c525e50383ecf22697ade0e30c511f  gcc/doc/aot-compile.1
  88d1fbe4975d0d30ee814dc6ac3fcce4  gcc/doc/avr-mmcu.texi
  bf34f154574511ea73ca5662f2f7f5ef  gcc/doc/bugreport.texi
  9fca288b41d5e44fd8b8a66184e3465e  gcc/doc/cfg.texi
--- 4410,4419 ----
  6331114b9e736f95bdfc9005bacf214f  gcc/diagnostic-color.c
  46cb891ca5a35344946f12490dc2eb61  gcc/diagnostic-color.h
  8a4857f6557756cfcdc4537f8fba0d5a  gcc/diagnostic-core.h
! ff4f87c381d6b2006af6b19055ce439d  gcc/diagnostic.c
  b0ab0f79edb20523f7d1502fbb3e67fe  gcc/diagnostic.def
  d0c066e7c7f55d0e632d6b9c5b079e75  gcc/diagnostic.h
! d40b196ba99429edecb0aaa46eb99ee3  gcc/doc/aot-compile.1
  88d1fbe4975d0d30ee814dc6ac3fcce4  gcc/doc/avr-mmcu.texi
  bf34f154574511ea73ca5662f2f7f5ef  gcc/doc/bugreport.texi
  9fca288b41d5e44fd8b8a66184e3465e  gcc/doc/cfg.texi
*************** e88587ef3e9b9ec8b225f91d251ba635  gcc/do
*** 4421,4460 ****
  eaf48a30b0911d6d00e0d7597a827dd6  gcc/doc/configterms.texi
  cd13f7cd1727d7e2f2b18240ce05199e  gcc/doc/contrib.texi
  9904428ed8794257df66ee09fb377c5c  gcc/doc/contribute.texi
! 17bd45107288e4b84981a647326738ad  gcc/doc/cpp.1
! 3dddde5fcd99b38107f18532984831ed  gcc/doc/cpp.info
  a79445765ec2d5c7c1cacf6f1fb87511  gcc/doc/cpp.texi
  86ee372f49b7f7ad9ff8ae436c43822d  gcc/doc/cppenv.texi
! f5efaa46c27ef3a6fa551fdc0061a3f2  gcc/doc/cppinternals.info
  76eda89efeb575bff228598230bd3c50  gcc/doc/cppinternals.texi
  f4b406eb44b3d589d1c7cb6cf6ee1875  gcc/doc/cppopts.texi
! cbe5a154cd266c567dc17efd8b18c4da  gcc/doc/extend.texi
  c6f99f2a7e803ce78a7ebd60090796c1  gcc/doc/fragments.texi
  ff8fba090979c42e8bfa096c201fe690  gcc/doc/frontends.texi
! a87dc5da0bbf6c3f59fd68dd08fb2aae  gcc/doc/fsf-funding.7
! b1f848ac18ff25f81231b898eae950e1  gcc/doc/g++.1
! c2863940e46c95afb3ca302e9e6084ff  gcc/doc/gc-analyze.1
! b1f848ac18ff25f81231b898eae950e1  gcc/doc/gcc.1
! 1426b7e06b3699ad881f236cc6909e6e  gcc/doc/gcc.info
! c7513d9fe3a5c9210dce80ddcb3b91ca  gcc/doc/gcc.texi
! d4a0020a7ba788ff82312cf8a341bdf0  gcc/doc/gccinstall.info
! 8234c184e04afea06867bb69cf43dadd  gcc/doc/gccint.info
  0abc012a09431283fb19c72cb3cf154b  gcc/doc/gccint.texi
! f7f3175767fab2be353c1a780c71b884  gcc/doc/gcj-dbtool.1
! 1c13c11e10a03bfe6627e7e5753d029d  gcc/doc/gcj.1
! fc78df077f8a2d31afbbb0ef81377dac  gcc/doc/gcj.info
! 9346ede445bcb208edf2343e0b614ab7  gcc/doc/gcov-tool.1
! 7267d040dd993d9ef5c693fcca9ab3c0  gcc/doc/gcov-tool.texi
! e993d871eff6de467e5c41782b71472b  gcc/doc/gcov.1
! 5eb59aec14f1cf96a5ce09adf224e31a  gcc/doc/gcov.texi
! 3434cdeceebda6513daa10be4064ac16  gcc/doc/generic.texi
! b2ab95e0c3e4cd64e5f9569633cba558  gcc/doc/gfdl.7
! f0ec84a8bfa56bc66c6c6c819ed86cca  gcc/doc/gfortran.1
! 1b4dc9c26991661f9f06d4d06eae1a50  gcc/doc/gij.1
  44cdd59b0e0c4a87198b6d6f93edf821  gcc/doc/gimple.texi
  290370669f02bef1502ada9273e5261f  gcc/doc/gnu.texi
! 8a502062cf0c476e44abe5f9a09ca87a  gcc/doc/gpl.7
! 369ec6ecc2f72bbd5601de36bc1ef275  gcc/doc/grmic.1
  0251c812052968400140d79e7637b960  gcc/doc/gty.texi
  bac4b1a76f9bea1142ad8521de456487  gcc/doc/headerdirs.texi
  979912689a9ae22bb140d994b0574e87  gcc/doc/hostconfig.texi
--- 4423,4464 ----
  eaf48a30b0911d6d00e0d7597a827dd6  gcc/doc/configterms.texi
  cd13f7cd1727d7e2f2b18240ce05199e  gcc/doc/contrib.texi
  9904428ed8794257df66ee09fb377c5c  gcc/doc/contribute.texi
! 25f78ecbfeb25aba25cf10268acb679b  gcc/doc/cpp.1
! 7d261ae190373bd385e14625a85c4d29  gcc/doc/cpp.info
  a79445765ec2d5c7c1cacf6f1fb87511  gcc/doc/cpp.texi
  86ee372f49b7f7ad9ff8ae436c43822d  gcc/doc/cppenv.texi
! 03fb56d6722e1f1b7d7775aff50e72f7  gcc/doc/cppinternals.info
  76eda89efeb575bff228598230bd3c50  gcc/doc/cppinternals.texi
  f4b406eb44b3d589d1c7cb6cf6ee1875  gcc/doc/cppopts.texi
! 8297410df6187b774ed2de33f5e6464d  gcc/doc/extend.texi
  c6f99f2a7e803ce78a7ebd60090796c1  gcc/doc/fragments.texi
  ff8fba090979c42e8bfa096c201fe690  gcc/doc/frontends.texi
! 6f015b0730f755d8088c01bcd703d27e  gcc/doc/fsf-funding.7
! 77adc0c2e629784f3ffd1790d9916451  gcc/doc/g++.1
! f8058660167aaf9581f067b9a9aa5759  gcc/doc/gc-analyze.1
! 77adc0c2e629784f3ffd1790d9916451  gcc/doc/gcc.1
! dfa9b3c7ecd1d8bf4a0f5c7cd3537a8d  gcc/doc/gcc.info
! 32f07983b5583ce937d63c9eb394205e  gcc/doc/gcc.texi
! 8a2df6f72583c9112d3c981d92ea6374  gcc/doc/gccinstall.info
! ec17bc54e1f940c719f5e808a9b6139e  gcc/doc/gccint.info
  0abc012a09431283fb19c72cb3cf154b  gcc/doc/gccint.texi
! bec8d0d14bd287602782513b15823165  gcc/doc/gcj-dbtool.1
! 3cc09827c2498b3ee1e7950651f30dde  gcc/doc/gcj.1
! 48a7e1f30e7cb96d228c6eaf97a6e26a  gcc/doc/gcj.info
! 2fe781401a9348f191ee0ca52cd2e58c  gcc/doc/gcov-dump.1
! b8d24f76649917a88a4a7b21cd032a0f  gcc/doc/gcov-dump.texi
! ce74da748c6a4f9076533a5cbf3364e1  gcc/doc/gcov-tool.1
! 9b573d01d9280d5c9c8506a81efb52d7  gcc/doc/gcov-tool.texi
! 1c35de6ef766d4041efaf97c07246495  gcc/doc/gcov.1
! 70cc30e3f013e2df22bacadfe755c1c6  gcc/doc/gcov.texi
! 1db7ad64406ce40ec453c35aa3f2c8ce  gcc/doc/generic.texi
! c71564402e41927f8086685eea7c883c  gcc/doc/gfdl.7
! b251f1b9554d1b6ef158cfd3cfdbdc1f  gcc/doc/gfortran.1
! 691341ea07cc4ec4ce1574d3ee8a915c  gcc/doc/gij.1
  44cdd59b0e0c4a87198b6d6f93edf821  gcc/doc/gimple.texi
  290370669f02bef1502ada9273e5261f  gcc/doc/gnu.texi
! d31ed1ff05a82baba17a635e947467a5  gcc/doc/gpl.7
! 6468ecadf48dc6501422c4b3892cac1b  gcc/doc/grmic.1
  0251c812052968400140d79e7637b960  gcc/doc/gty.texi
  bac4b1a76f9bea1142ad8521de456487  gcc/doc/headerdirs.texi
  979912689a9ae22bb140d994b0574e87  gcc/doc/hostconfig.texi
*************** c9c72c6be45fb9d057a5590dab9dc5b2  gcc/do
*** 4466,4492 ****
  5f5adc2c6c4ebdcf03cc0125250f5995  gcc/doc/include/gpl_v3.texi
  73819b3930a3d4be5d6234070d02386a  gcc/doc/include/texinfo.tex
  4faa6ab8fe567d8d0d507ea19e67f29a  gcc/doc/install-old.texi
! 80f1f1a688001979e74c91a51b1301bb  gcc/doc/install.texi
  99f35a855dbf0965fa02f5bef2906438  gcc/doc/install.texi2html
  43f58ec2628882183fa99d21d88fe88a  gcc/doc/interface.texi
! bb6d48282c1f451ce621c28ae2dd9221  gcc/doc/invoke.texi
! 08ffbdc982b3c79b361a166eb8d78936  gcc/doc/jcf-dump.1
! baae97cf8cc7b7e2af2d5d223e102a4c  gcc/doc/jv-convert.1
  11c51d2537db173b7307e16ea7cf7cc6  gcc/doc/languages.texi
  d997673d3e4c06a709d047334aa94df8  gcc/doc/libgcc.texi
  9663e09eea24ef9b50099b8ca3742d93  gcc/doc/loop.texi
! d6b979f19e13113545769e1e02a0fa4d  gcc/doc/lto.texi
  82c62c184d1417e060e2ae8ac57133eb  gcc/doc/makefile.texi
  841256364b0381bcac67d20b24623252  gcc/doc/match-and-simplify.texi
  ccf4c2a936bf0cf2efe932053549f2e7  gcc/doc/md.texi
  997652fc575562dd8ad133ccd0d3f9c2  gcc/doc/objc.texi
  1671187450d30de26d135bbc698b54e3  gcc/doc/optinfo.texi
  2135610f8f2cc9fb9b459648f499083b  gcc/doc/options.texi
! 2aee64ab43736c913c78244d594a66c6  gcc/doc/passes.texi
  e58e11ee7bf1e2b8b658f8469742dc7f  gcc/doc/plugins.texi
  f8e897dc6797fcc5fd394597b96aa940  gcc/doc/portability.texi
! b41fdebb7eb0f2f9361de60188f85a82  gcc/doc/rebuild-gcj-db.1
! 61b62a72c4d70d85e58c35ef9e6a6ad3  gcc/doc/rtl.texi
  7845a3cb7d3e8ee595dbda48b0f8843e  gcc/doc/service.texi
  bbc50150835279e540169136a82f4925  gcc/doc/sourcebuild.texi
  41d15466d0968130ad475309d86a2a33  gcc/doc/standards.texi
--- 4470,4496 ----
  5f5adc2c6c4ebdcf03cc0125250f5995  gcc/doc/include/gpl_v3.texi
  73819b3930a3d4be5d6234070d02386a  gcc/doc/include/texinfo.tex
  4faa6ab8fe567d8d0d507ea19e67f29a  gcc/doc/install-old.texi
! 3bea0e9e86bb3034d1e7c777da454099  gcc/doc/install.texi
  99f35a855dbf0965fa02f5bef2906438  gcc/doc/install.texi2html
  43f58ec2628882183fa99d21d88fe88a  gcc/doc/interface.texi
! 28df8b560884a67223bab23e4499ec7d  gcc/doc/invoke.texi
! c2013c3e8cc465ee1b1b193466231a65  gcc/doc/jcf-dump.1
! ee9462295b7d3928ed5e4ac43322c04e  gcc/doc/jv-convert.1
  11c51d2537db173b7307e16ea7cf7cc6  gcc/doc/languages.texi
  d997673d3e4c06a709d047334aa94df8  gcc/doc/libgcc.texi
  9663e09eea24ef9b50099b8ca3742d93  gcc/doc/loop.texi
! f77b255838145aae4f4bd4a8e09e922c  gcc/doc/lto.texi
  82c62c184d1417e060e2ae8ac57133eb  gcc/doc/makefile.texi
  841256364b0381bcac67d20b24623252  gcc/doc/match-and-simplify.texi
  ccf4c2a936bf0cf2efe932053549f2e7  gcc/doc/md.texi
  997652fc575562dd8ad133ccd0d3f9c2  gcc/doc/objc.texi
  1671187450d30de26d135bbc698b54e3  gcc/doc/optinfo.texi
  2135610f8f2cc9fb9b459648f499083b  gcc/doc/options.texi
! 2b4a9f26ae5ccd6c22387702b9b23e69  gcc/doc/passes.texi
  e58e11ee7bf1e2b8b658f8469742dc7f  gcc/doc/plugins.texi
  f8e897dc6797fcc5fd394597b96aa940  gcc/doc/portability.texi
! 2da9487a9b57584aab999c786db6dd19  gcc/doc/rebuild-gcj-db.1
! 7a36babc85d55d92710499c07b1bce2b  gcc/doc/rtl.texi
  7845a3cb7d3e8ee595dbda48b0f8843e  gcc/doc/service.texi
  bbc50150835279e540169136a82f4925  gcc/doc/sourcebuild.texi
  41d15466d0968130ad475309d86a2a33  gcc/doc/standards.texi
*************** fb5965cea97ed7bcc888b5ccf9ba0168  gcc/do
*** 4508,4514 ****
  1faf84d9fd8b6f0d5dbe9b4a2d08839c  gcc/dwarf2asm.c
  1d56aa18bfae871fee1e89a9fc43810e  gcc/dwarf2asm.h
  bc2f75db33a70f598fd891a9f4ba6271  gcc/dwarf2cfi.c
! fa605db0496887d03c5cf1b61737207c  gcc/dwarf2out.c
  c48a1e9cecbef090c903e39f2e0ff6e8  gcc/dwarf2out.h
  a5a18bc2c53951edffeed5feb6f89231  gcc/emit-rtl.c
  f3feb98669c7b31a7b10819ae3ac6d42  gcc/emit-rtl.h
--- 4512,4518 ----
  1faf84d9fd8b6f0d5dbe9b4a2d08839c  gcc/dwarf2asm.c
  1d56aa18bfae871fee1e89a9fc43810e  gcc/dwarf2asm.h
  bc2f75db33a70f598fd891a9f4ba6271  gcc/dwarf2cfi.c
! 76e76c41b870f31fde0e8d84fc3d2eec  gcc/dwarf2out.c
  c48a1e9cecbef090c903e39f2e0ff6e8  gcc/dwarf2out.h
  a5a18bc2c53951edffeed5feb6f89231  gcc/emit-rtl.c
  f3feb98669c7b31a7b10819ae3ac6d42  gcc/emit-rtl.h
*************** e69b3300b128c199ca5fb650e906dd51  gcc/et
*** 4519,4529 ****
  8c8b6673091d00aab27649ac95210796  gcc/except.c
  c1198c43d505483879ed93342a77f47e  gcc/except.h
  899cd36cc661113fa4f4ba4ba938c30b  gcc/exec-tool.in
! 15e465d076499e6cc3091fd6bf2c2931  gcc/explow.c
  a0286bd1624b7c0bc1cf22d14669a662  gcc/explow.h
! 7e898c18b993546a2b8c96127bfdf2c1  gcc/expmed.c
  a9df0692feedff51a91675a97d3ff6cf  gcc/expmed.h
! 8770c9d36bc090c69095ac886ac0b9b0  gcc/expr.c
  616e18f69b9972ba3bd219003f9a0e0d  gcc/expr.h
  ccff67dc94ba4ddd17c455df3c72ac43  gcc/fibonacci_heap.h
  e05bb84d8208ac2c70c0591c8b1ff568  gcc/file-find.c
--- 4523,4533 ----
  8c8b6673091d00aab27649ac95210796  gcc/except.c
  c1198c43d505483879ed93342a77f47e  gcc/except.h
  899cd36cc661113fa4f4ba4ba938c30b  gcc/exec-tool.in
! 92fb2121f945cff14788e19e52b61e26  gcc/explow.c
  a0286bd1624b7c0bc1cf22d14669a662  gcc/explow.h
! b0b6f40409fda0c6d6c3ce12d506e9c4  gcc/expmed.c
  a9df0692feedff51a91675a97d3ff6cf  gcc/expmed.h
! 8e1d5d3752fc0a648427af58d5ac95b6  gcc/expr.c
  616e18f69b9972ba3bd219003f9a0e0d  gcc/expr.h
  ccff67dc94ba4ddd17c455df3c72ac43  gcc/fibonacci_heap.h
  e05bb84d8208ac2c70c0591c8b1ff568  gcc/file-find.c
*************** e05bb84d8208ac2c70c0591c8b1ff568  gcc/fi
*** 4533,4541 ****
  a8d3b9ef43e6ad1608f39e9bfdd0b657  gcc/fixed-value.h
  10e013b0dd31da256d98f6bf5ddef356  gcc/flag-types.h
  46a3f21086c978417d1f4d6be66ffb19  gcc/flags.h
! a3c28dbbf748886e3b0521554e33e155  gcc/fold-const.c
  15a6e905a85ed9904bc2235dfd7ddc72  gcc/fold-const.h
! b81ae300f54487ff5fec563984d02930  gcc/fortran/ChangeLog
  3330102ad3a0217cba963be6b5eefd58  gcc/fortran/ChangeLog-2002
  d000ab985b1eeb1ad5749f98b8fef99f  gcc/fortran/ChangeLog-2003
  bf42f94f0c51dcc7d8051cc7fda1efdc  gcc/fortran/ChangeLog-2004
--- 4537,4545 ----
  a8d3b9ef43e6ad1608f39e9bfdd0b657  gcc/fixed-value.h
  10e013b0dd31da256d98f6bf5ddef356  gcc/flag-types.h
  46a3f21086c978417d1f4d6be66ffb19  gcc/flags.h
! 97c4254205d4f6219b3ec89cf814ffec  gcc/fold-const.c
  15a6e905a85ed9904bc2235dfd7ddc72  gcc/fold-const.h
! a905059f458e6a40933cca7ee7889e2b  gcc/fortran/ChangeLog
  3330102ad3a0217cba963be6b5eefd58  gcc/fortran/ChangeLog-2002
  d000ab985b1eeb1ad5749f98b8fef99f  gcc/fortran/ChangeLog-2003
  bf42f94f0c51dcc7d8051cc7fda1efdc  gcc/fortran/ChangeLog-2004
*************** b378eb9df97ed252ce2624646d05df15  gcc/fo
*** 4554,4563 ****
  707d6368c4e2671ef5213990fb75af4c  gcc/fortran/Make-lang.in
  f6aaeeb78eacb37261b2129241b19e98  gcc/fortran/arith.c
  5189b078b2d7dc66ef8f2f1e457331de  gcc/fortran/arith.h
! f005af7bda74f7cf18fcbdf2341d05ad  gcc/fortran/array.c
  a99bf29297bf90bf395dcc0dfb6b7ad5  gcc/fortran/bbt.c
! bf806c8dc624d75a3774c4fdb49afbbe  gcc/fortran/check.c
! 31179be526b51fa65c09cc69b90e3be6  gcc/fortran/class.c
  e421bdeae153aca94e0847ee6a53e1ea  gcc/fortran/config-lang.in
  27e63ed98e0093daefcf1f87d81db9ce  gcc/fortran/constructor.c
  bada936bc50d5ad0825eb77399887be9  gcc/fortran/constructor.h
--- 4558,4567 ----
  707d6368c4e2671ef5213990fb75af4c  gcc/fortran/Make-lang.in
  f6aaeeb78eacb37261b2129241b19e98  gcc/fortran/arith.c
  5189b078b2d7dc66ef8f2f1e457331de  gcc/fortran/arith.h
! 54d46590dc04cadc5f1afbd7e298ab0c  gcc/fortran/array.c
  a99bf29297bf90bf395dcc0dfb6b7ad5  gcc/fortran/bbt.c
! 9c09ef2f4faf4ca45fd2a4f1ed883cb2  gcc/fortran/check.c
! 91d7e056cec92ab162ad488f367bfbef  gcc/fortran/class.c
  e421bdeae153aca94e0847ee6a53e1ea  gcc/fortran/config-lang.in
  27e63ed98e0093daefcf1f87d81db9ce  gcc/fortran/constructor.c
  bada936bc50d5ad0825eb77399887be9  gcc/fortran/constructor.h
*************** fe38d7fbbaed2ab44aef6fb292c489a2  gcc/fo
*** 4566,4591 ****
  8763ad6a1d5aa2d543336f4e1ba1260e  gcc/fortran/cpp.h
  06f041b03fbe84fc3d6ce0be9765d3a9  gcc/fortran/data.c
  69bbc808281a960d3cffae3e480eb7e6  gcc/fortran/data.h
! f79aa0a90d1a43348d327615cb470a2e  gcc/fortran/decl.c
! 6a01fc4dd0263dbf84cc0bbef2374179  gcc/fortran/dependency.c
  4d73c9b2b8490470e36c64e8aada5f1d  gcc/fortran/dependency.h
  638656d011f7de9d4a0a0119cd6ac2e0  gcc/fortran/dump-parse-tree.c
! c9882dfc9a51f522790b02bcac6cb836  gcc/fortran/error.c
! 976e7326f777a5360389866adbd74c97  gcc/fortran/expr.c
  dd469a8c91ba1c92fea6dc05c06cd574  gcc/fortran/f95-lang.c
! c42f7a4190ef1faf39b5054bc5259d4c  gcc/fortran/frontend-passes.c
  a841f849e997b8d8e5bb6511e73f703d  gcc/fortran/gfc-diagnostic.def
  c9dcfa65fbec35139bcd58589be4c812  gcc/fortran/gfc-internals.texi
  54c6965728905703da9b9c3d973f3903  gcc/fortran/gfortran.h
! 927f289074b2b7ec3b5d0617a1571c7d  gcc/fortran/gfortran.info
  e17478537d627c542253b2373f18336d  gcc/fortran/gfortran.texi
  6a333b640eafa453c9de0a7d8d07dd98  gcc/fortran/gfortranspec.c
! c1de9b03a6f596705e39fe08713f3f06  gcc/fortran/interface.c
! 44657590a43314f103fbc7432cc1ce6f  gcc/fortran/intrinsic.c
  5edacdcc5ae162a67f749a711c85400d  gcc/fortran/intrinsic.h
  eace1b3ffdb87374fe9cca47c88aea10  gcc/fortran/intrinsic.texi
  9f7ad9d17089981567ac7c4c5352321b  gcc/fortran/invoke.texi
! 5ac1292e8970f30c2207697ca25d5659  gcc/fortran/io.c
  98caff6efc3f39fd40786f5bcd525279  gcc/fortran/ioparm.def
  14fe463db076b809f45fc070aa7436f0  gcc/fortran/iresolve.c
  b4e941705acf5cc559b5978c387564b5  gcc/fortran/iso-c-binding.def
--- 4570,4595 ----
  8763ad6a1d5aa2d543336f4e1ba1260e  gcc/fortran/cpp.h
  06f041b03fbe84fc3d6ce0be9765d3a9  gcc/fortran/data.c
  69bbc808281a960d3cffae3e480eb7e6  gcc/fortran/data.h
! 9678d07e78649d57899137c53f5f9a9b  gcc/fortran/decl.c
! b6083174a53489f69e4058a4146c4688  gcc/fortran/dependency.c
  4d73c9b2b8490470e36c64e8aada5f1d  gcc/fortran/dependency.h
  638656d011f7de9d4a0a0119cd6ac2e0  gcc/fortran/dump-parse-tree.c
! e643f82944f3984750b915048e0ace29  gcc/fortran/error.c
! a2c66602dc848422d7963db4b7caa7e8  gcc/fortran/expr.c
  dd469a8c91ba1c92fea6dc05c06cd574  gcc/fortran/f95-lang.c
! 48c15ec8b04aafbd12e193a21558f740  gcc/fortran/frontend-passes.c
  a841f849e997b8d8e5bb6511e73f703d  gcc/fortran/gfc-diagnostic.def
  c9dcfa65fbec35139bcd58589be4c812  gcc/fortran/gfc-internals.texi
  54c6965728905703da9b9c3d973f3903  gcc/fortran/gfortran.h
! b903f0d670b680981a099022ec85d6fa  gcc/fortran/gfortran.info
  e17478537d627c542253b2373f18336d  gcc/fortran/gfortran.texi
  6a333b640eafa453c9de0a7d8d07dd98  gcc/fortran/gfortranspec.c
! 46382303134e1ee4f7ce54c647e71495  gcc/fortran/interface.c
! f70f5df86fd6c3f5d4da85cb1b8ed6cf  gcc/fortran/intrinsic.c
  5edacdcc5ae162a67f749a711c85400d  gcc/fortran/intrinsic.h
  eace1b3ffdb87374fe9cca47c88aea10  gcc/fortran/intrinsic.texi
  9f7ad9d17089981567ac7c4c5352321b  gcc/fortran/invoke.texi
! 07f0aaca0740b792656d54ccbb9d54c6  gcc/fortran/io.c
  98caff6efc3f39fd40786f5bcd525279  gcc/fortran/ioparm.def
  14fe463db076b809f45fc070aa7436f0  gcc/fortran/iresolve.c
  b4e941705acf5cc559b5978c387564b5  gcc/fortran/iso-c-binding.def
*************** b4e941705acf5cc559b5978c387564b5  gcc/fo
*** 4593,4654 ****
  24e1ba51ab3274e4e9ca36029db14e02  gcc/fortran/lang-specs.h
  6c887d2b29b51d76b9567596be7b9844  gcc/fortran/lang.opt
  0347367fec2f9b47ddff4095949d334b  gcc/fortran/libgfortran.h
! acbdc434ff243f76b7312898c752724b  gcc/fortran/match.c
  da511ad5acad197246d4b3b36a3a2f57  gcc/fortran/match.h
  34cb2899bc9672ee1ddf5f753414d6b6  gcc/fortran/matchexp.c
  1d4d366df890396ef57a25a8532fb71d  gcc/fortran/mathbuiltins.def
  31cffc891bc7b4adb06625f9a1c31979  gcc/fortran/misc.c
  ade8b150ad55a1b617adf805d0941e3a  gcc/fortran/module.c
! 022c347a9fe2b8a158e7f2bccc603204  gcc/fortran/openmp.c
  2a30cedf97877dcb3afd459cd71284bf  gcc/fortran/options.c
! 06d0acc33c0cecaa9e8bfc8a863c6f79  gcc/fortran/parse.c
  00ec0502c7f65c7f3140d21f1d31d72a  gcc/fortran/parse.h
! 76bae553feffd50d943788e96d55219a  gcc/fortran/primary.c
! a1e584f481913482f050c5ba4440b24e  gcc/fortran/resolve.c
  fe35e2377e5060db8f1b9c32d497d6ac  gcc/fortran/scanner.c
  d2bdefff04430dfbd955eea579f2aebf  gcc/fortran/scanner.h
! c1d3cc0adafc74a4a3fddbc29a338e7d  gcc/fortran/simplify.c
  c0ccd4291ed4987b75954b0ce476f93c  gcc/fortran/st.c
  f6085d74a92bc3d00960fd831ae638da  gcc/fortran/symbol.c
  397dd1e19eab6bf5bba96e8217c4f217  gcc/fortran/target-memory.c
  cea1e76491020b81ced1061cb7ace527  gcc/fortran/target-memory.h
! f20d66c66530f45422a51ef8b6236114  gcc/fortran/trans-array.c
  5b4013bb799145dc921412dc4a0f572b  gcc/fortran/trans-array.h
! 01e21b9accc441765071ede0e774e121  gcc/fortran/trans-common.c
  38bb2b9633ffd93d5f4f6baa01767760  gcc/fortran/trans-const.c
  eb8fb89c9709d453357eb914042d3ff6  gcc/fortran/trans-const.h
! 9de328ceb1cbe91c46fb0ded56efd1cf  gcc/fortran/trans-decl.c
! c30d7862fde5c2b65435e01635d9f9a0  gcc/fortran/trans-expr.c
  9a77208e61e8a970c47f607791f74a73  gcc/fortran/trans-intrinsic.c
  157a295cd74c7802cc669e8ce6628afd  gcc/fortran/trans-io.c
! 12477674f4d7417f1aacf41512f75767  gcc/fortran/trans-openmp.c
! bb17fabcdb5c0dfd9b33c5b32763982f  gcc/fortran/trans-stmt.c
  4a3bd2067a8a4a1b4b7ba2b073e18efd  gcc/fortran/trans-stmt.h
! f11b8bd89fa05a461d24672a8107988e  gcc/fortran/trans-types.c
  d949f532000ada14f557c83725d95468  gcc/fortran/trans-types.h
! ad7fbdf36e4a48e57252e3c8887cb96c  gcc/fortran/trans.c
  0bf400338646f9bab6cd6ae528dbf437  gcc/fortran/trans.h
  ff424893feafa5624090143937d4c009  gcc/fortran/types.def
  a54523b4e94919066a3c5647ff40dac2  gcc/fp-test.c
! b0fecab2fc35903a25fd832eb8a55f50  gcc/function.c
! 870da7fc1f70ac8417ef4a953257f559  gcc/function.h
! 5557858dbb5827ed2a7053623414a5ba  gcc/fwprop.c
  6efb9ef2e73dbc17d27ded1d96367049  gcc/gcc-ar.c
  a8f56c226f8847a3d66f53ad0c434cc9  gcc/gcc-main.c
  fb9613e93d16c2bf39e651c0757a75f1  gcc/gcc-plugin.h
  d7685ab8bad221ca4814fe9968503d08  gcc/gcc-symtab.h
! be90413802f0b1b9222513bb5a32f776  gcc/gcc.c
  92bd4d323915b3edb403eb79ea9e8a1c  gcc/gcc.h
  f6f03cb16050a9a212a6258a32b233f0  gcc/gcov-counter.def
! 49874a0a517511e6e8f4dc3db7cfb24b  gcc/gcov-dump.c
! 04ea0fa8efdde9a01bf69310027c4432  gcc/gcov-io.c
  90a324921f2a4eb0eec1e0e8d73ab527  gcc/gcov-io.h
  71e1c13af4a426f1dff37d627c47914c  gcc/gcov-iov.c
! 3cbfcc7daf15b0a2c9cd20de4cc15135  gcc/gcov-tool.c
! 36ad745ce60964b283d20071dcf4fb43  gcc/gcov.c
  195e0f4a65c4c05837066cc207e69fa9  gcc/gcse-common.c
  3988c5c9badaab6144419427c15b5de6  gcc/gcse-common.h
! d92a6713e8a3a1054fe4abcb0f48317a  gcc/gcse.c
  2df943f1b5c908074da3c7ad26a620d0  gcc/gcse.h
  af83e4b4719ee065872080b713d24c2f  gcc/gdbasan.in
  35c6faff742cf9dab522c94fa7287ba0  gcc/gdbhooks.py
--- 4597,4658 ----
  24e1ba51ab3274e4e9ca36029db14e02  gcc/fortran/lang-specs.h
  6c887d2b29b51d76b9567596be7b9844  gcc/fortran/lang.opt
  0347367fec2f9b47ddff4095949d334b  gcc/fortran/libgfortran.h
! de9e0fbb458b564b826002f557e47311  gcc/fortran/match.c
  da511ad5acad197246d4b3b36a3a2f57  gcc/fortran/match.h
  34cb2899bc9672ee1ddf5f753414d6b6  gcc/fortran/matchexp.c
  1d4d366df890396ef57a25a8532fb71d  gcc/fortran/mathbuiltins.def
  31cffc891bc7b4adb06625f9a1c31979  gcc/fortran/misc.c
  ade8b150ad55a1b617adf805d0941e3a  gcc/fortran/module.c
! 33771d59322f641d630949183831d48d  gcc/fortran/openmp.c
  2a30cedf97877dcb3afd459cd71284bf  gcc/fortran/options.c
! ee100b7b822f626e32dc39efb5b51c46  gcc/fortran/parse.c
  00ec0502c7f65c7f3140d21f1d31d72a  gcc/fortran/parse.h
! 427654d65f7e65ec2ef1156ffa0cda1a  gcc/fortran/primary.c
! d6e5a3c645a4d6911bd2df3ff536b4d0  gcc/fortran/resolve.c
  fe35e2377e5060db8f1b9c32d497d6ac  gcc/fortran/scanner.c
  d2bdefff04430dfbd955eea579f2aebf  gcc/fortran/scanner.h
! 28dfe7543d56a15a7419d127623376a6  gcc/fortran/simplify.c
  c0ccd4291ed4987b75954b0ce476f93c  gcc/fortran/st.c
  f6085d74a92bc3d00960fd831ae638da  gcc/fortran/symbol.c
  397dd1e19eab6bf5bba96e8217c4f217  gcc/fortran/target-memory.c
  cea1e76491020b81ced1061cb7ace527  gcc/fortran/target-memory.h
! da32ae6ce5c84657e6d1664cfd420945  gcc/fortran/trans-array.c
  5b4013bb799145dc921412dc4a0f572b  gcc/fortran/trans-array.h
! cd99036021266498cd911a35e933e234  gcc/fortran/trans-common.c
  38bb2b9633ffd93d5f4f6baa01767760  gcc/fortran/trans-const.c
  eb8fb89c9709d453357eb914042d3ff6  gcc/fortran/trans-const.h
! fded624204486885e95684efd0e2b905  gcc/fortran/trans-decl.c
! 127ee4788b8a75c554caae210d48d2b5  gcc/fortran/trans-expr.c
  9a77208e61e8a970c47f607791f74a73  gcc/fortran/trans-intrinsic.c
  157a295cd74c7802cc669e8ce6628afd  gcc/fortran/trans-io.c
! b4773edb51843fc2cc95e50ad2006f06  gcc/fortran/trans-openmp.c
! 7d154d20b68f402bda2a42d36ef78618  gcc/fortran/trans-stmt.c
  4a3bd2067a8a4a1b4b7ba2b073e18efd  gcc/fortran/trans-stmt.h
! 5f67ff15f4d87853a7b391310d90654e  gcc/fortran/trans-types.c
  d949f532000ada14f557c83725d95468  gcc/fortran/trans-types.h
! ab9271eec95d00531eb650ee31ad47d4  gcc/fortran/trans.c
  0bf400338646f9bab6cd6ae528dbf437  gcc/fortran/trans.h
  ff424893feafa5624090143937d4c009  gcc/fortran/types.def
  a54523b4e94919066a3c5647ff40dac2  gcc/fp-test.c
! 1ad76fa6ffb3813ffc7fa1c4f02c3700  gcc/function.c
! 49860d6a27a9809bd464ec2269e3ba81  gcc/function.h
! 549b7b86a49ff8989176f48d57e489d7  gcc/fwprop.c
  6efb9ef2e73dbc17d27ded1d96367049  gcc/gcc-ar.c
  a8f56c226f8847a3d66f53ad0c434cc9  gcc/gcc-main.c
  fb9613e93d16c2bf39e651c0757a75f1  gcc/gcc-plugin.h
  d7685ab8bad221ca4814fe9968503d08  gcc/gcc-symtab.h
! 062c49e64d80133bfde966585734b58d  gcc/gcc.c
  92bd4d323915b3edb403eb79ea9e8a1c  gcc/gcc.h
  f6f03cb16050a9a212a6258a32b233f0  gcc/gcov-counter.def
! 6aeedacbfe16951d5ad6afc54d5d4d74  gcc/gcov-dump.c
! 60941b249d61a4348b7baf63a41f2cb7  gcc/gcov-io.c
  90a324921f2a4eb0eec1e0e8d73ab527  gcc/gcov-io.h
  71e1c13af4a426f1dff37d627c47914c  gcc/gcov-iov.c
! 9bb512fc23f17942f8dfcba98f36844f  gcc/gcov-tool.c
! 95c538651d0d111a53bff88582f67d75  gcc/gcov.c
  195e0f4a65c4c05837066cc207e69fa9  gcc/gcse-common.c
  3988c5c9badaab6144419427c15b5de6  gcc/gcse-common.h
! 4a1cb4a32e56fa108638e0fb0fb3c645  gcc/gcse.c
  2df943f1b5c908074da3c7ad26a620d0  gcc/gcse.h
  af83e4b4719ee065872080b713d24c2f  gcc/gdbasan.in
  35c6faff742cf9dab522c94fa7287ba0  gcc/gdbhooks.py
*************** cb3bafc39aa5fb67e8df965fa430db00  gcc/ge
*** 4671,4684 ****
  7775bb2873d3d6cb71856f44a90463bd  gcc/genextract.c
  8801d78e17e4713ebb78f8aaed80fd07  gcc/genflags.c
  ff8b894150f34792acf058e52e1f1351  gcc/gengenrtl.c
! 19884ac695063c6ebe772e83f1e99f3d  gcc/gengtype-lex.c
  6ed8ef9e8b2317c06bf5758b667ed378  gcc/gengtype-lex.l
  68515aae193974108335815cffd2ed24  gcc/gengtype-parse.c
  4f8707ada1ecd9957c3baec21cdad10d  gcc/gengtype-state.c
  2f73706db465c5ae7c757cbe2a9f1e72  gcc/gengtype.c
  d7e0e06e3137f430200ddde998c7300a  gcc/gengtype.h
  25013196ddfe6ad93e3d289915c5c421  gcc/genhooks.c
! 0753e30ec3fb0dff1f233405f016e028  gcc/genmatch.c
  ab9053bd5a0d9c0de13c539e452e6e38  gcc/genmddeps.c
  8ef494e82527975d9e774d8601f30cda  gcc/genmddump.c
  8025e346a698d2a1b82e2c40249bfd07  gcc/genmodes.c
--- 4675,4688 ----
  7775bb2873d3d6cb71856f44a90463bd  gcc/genextract.c
  8801d78e17e4713ebb78f8aaed80fd07  gcc/genflags.c
  ff8b894150f34792acf058e52e1f1351  gcc/gengenrtl.c
! 068cb19fd083af1f258cb186b1a3a76e  gcc/gengtype-lex.c
  6ed8ef9e8b2317c06bf5758b667ed378  gcc/gengtype-lex.l
  68515aae193974108335815cffd2ed24  gcc/gengtype-parse.c
  4f8707ada1ecd9957c3baec21cdad10d  gcc/gengtype-state.c
  2f73706db465c5ae7c757cbe2a9f1e72  gcc/gengtype.c
  d7e0e06e3137f430200ddde998c7300a  gcc/gengtype.h
  25013196ddfe6ad93e3d289915c5c421  gcc/genhooks.c
! 0057a83098e753f261c55d13207ba05a  gcc/genmatch.c
  ab9053bd5a0d9c0de13c539e452e6e38  gcc/genmddeps.c
  8ef494e82527975d9e774d8601f30cda  gcc/genmddump.c
  8025e346a698d2a1b82e2c40249bfd07  gcc/genmodes.c
*************** f4dae6d4f9332841dee97b1ea57b84a4  gcc/gi
*** 4699,4705 ****
  43d573d208affa2be1a6c2473dbda3c5  gcc/gimple-builder.h
  f5cdf56d550816b2a0e665865185684c  gcc/gimple-expr.c
  6f9caabc1dc67885b0c144695e87da5e  gcc/gimple-expr.h
! 5ef9c3692ada9532a791fb9c48a6cd7b  gcc/gimple-fold.c
  f2ee481c75a3a949d80febfe809b4b21  gcc/gimple-fold.h
  a1160fdfad8e89bd3b3566303f25a39a  gcc/gimple-iterator.c
  8d8801f018e326a45e5e71a5a13c6111  gcc/gimple-iterator.h
--- 4703,4709 ----
  43d573d208affa2be1a6c2473dbda3c5  gcc/gimple-builder.h
  f5cdf56d550816b2a0e665865185684c  gcc/gimple-expr.c
  6f9caabc1dc67885b0c144695e87da5e  gcc/gimple-expr.h
! 328f68fcb668ddaa0ac3343110356177  gcc/gimple-fold.c
  f2ee481c75a3a949d80febfe809b4b21  gcc/gimple-fold.h
  a1160fdfad8e89bd3b3566303f25a39a  gcc/gimple-iterator.c
  8d8801f018e326a45e5e71a5a13c6111  gcc/gimple-iterator.h
*************** e520982aa39dfc477fdb4018bf7e2df6  gcc/gi
*** 4710,4716 ****
  e95f8b4b386a00ef73f7f186a763db17  gcc/gimple-pretty-print.c
  cd4af2945d35b35f4f3193582c8fbb6a  gcc/gimple-pretty-print.h
  6e65a99b873cb4817482654ff39f83c9  gcc/gimple-ssa-isolate-paths.c
! 7b9a6a7d0e884ad04fc23dc973ec38cd  gcc/gimple-ssa-strength-reduction.c
  247236c61b3cf32ee3738dbdc4d10ae8  gcc/gimple-ssa.h
  461931e9c88aa766f4221b6159c69790  gcc/gimple-streamer-in.c
  2bf088b89ed3f18752d8277b81d88a44  gcc/gimple-streamer-out.c
--- 4714,4720 ----
  e95f8b4b386a00ef73f7f186a763db17  gcc/gimple-pretty-print.c
  cd4af2945d35b35f4f3193582c8fbb6a  gcc/gimple-pretty-print.h
  6e65a99b873cb4817482654ff39f83c9  gcc/gimple-ssa-isolate-paths.c
! fae21e78d56c380e72a84defdff3c51f  gcc/gimple-ssa-strength-reduction.c
  247236c61b3cf32ee3738dbdc4d10ae8  gcc/gimple-ssa.h
  461931e9c88aa766f4221b6159c69790  gcc/gimple-streamer-in.c
  2bf088b89ed3f18752d8277b81d88a44  gcc/gimple-streamer-out.c
*************** c1027a1891566efdd0788f86c779f714  gcc/gi
*** 4722,4728 ****
  824d2a0d0a80a10aded776d1eab310df  gcc/gimple.h
  a3a5adb69470aa29be21310f5df8dae1  gcc/gimplify-me.c
  63a9df09103c7a0a95a977dcabe06681  gcc/gimplify-me.h
! 92802023fbbdbf1e66099b0d87ee8f45  gcc/gimplify.c
  657aa310665a750e4e6640076ff198d8  gcc/gimplify.h
  06e1d5bf49d283a8370e6823323ed83d  gcc/ginclude/float.h
  dce53594becd3e542adcf44d41af1843  gcc/ginclude/iso646.h
--- 4726,4732 ----
  824d2a0d0a80a10aded776d1eab310df  gcc/gimple.h
  a3a5adb69470aa29be21310f5df8dae1  gcc/gimplify-me.c
  63a9df09103c7a0a95a977dcabe06681  gcc/gimplify-me.h
! 1e723d48bbf81168417cbede1318167d  gcc/gimplify.c
  657aa310665a750e4e6640076ff198d8  gcc/gimplify.h
  06e1d5bf49d283a8370e6823323ed83d  gcc/ginclude/float.h
  dce53594becd3e542adcf44d41af1843  gcc/ginclude/iso646.h
*************** de316d2a98d1c9dcd6ed49312f273723  gcc/gi
*** 4739,4745 ****
  e8c9554b282a6d176cb89489786dc8e9  gcc/ginclude/unwind-arm-common.h
  8d9ecf0d6ef93c79623ce1d27a32a2cb  gcc/ginclude/varargs.h
  3d14b3be9a65d32c111c8922f3a3bd81  gcc/glimits.h
! 05d3e2d0a3b9ef4e95cb35c8841c4e5b  gcc/go/ChangeLog
  cd53341961f61a151fd5e6b08d2a32ca  gcc/go/Make-lang.in
  60ea054548c83c7f66170073f9f3e74c  gcc/go/README.gcc
  98a92a4eb98cb3c34e78e760835d003a  gcc/go/config-lang.in
--- 4743,4749 ----
  e8c9554b282a6d176cb89489786dc8e9  gcc/ginclude/unwind-arm-common.h
  8d9ecf0d6ef93c79623ce1d27a32a2cb  gcc/ginclude/varargs.h
  3d14b3be9a65d32c111c8922f3a3bd81  gcc/glimits.h
! 994d5735097f7f759e125b58a47ef482  gcc/go/ChangeLog
  cd53341961f61a151fd5e6b08d2a32ca  gcc/go/Make-lang.in
  60ea054548c83c7f66170073f9f3e74c  gcc/go/README.gcc
  98a92a4eb98cb3c34e78e760835d003a  gcc/go/config-lang.in
*************** df5fccf403e608bac420d9d773cc81aa  gcc/gr
*** 4799,4805 ****
  33186ad9405ef9915154f2cbb6b0c959  gcc/graphite-blocking.c
  4b91852121275027483c0250c7bf53c1  gcc/graphite-dependences.c
  cabaf994a022e558b99682faca59883c  gcc/graphite-interchange.c
! 28755788f93fffb99579281f12dab331  gcc/graphite-isl-ast-to-gimple.c
  2d103b13b3ef14b7724520ae9294494f  gcc/graphite-isl-ast-to-gimple.h
  3fe8fa2aeb07d0c7d1d203b887d216b1  gcc/graphite-optimize-isl.c
  7ec4425c66c19929fcffabd7b9901d83  gcc/graphite-poly.c
--- 4803,4809 ----
  33186ad9405ef9915154f2cbb6b0c959  gcc/graphite-blocking.c
  4b91852121275027483c0250c7bf53c1  gcc/graphite-dependences.c
  cabaf994a022e558b99682faca59883c  gcc/graphite-interchange.c
! e35072572d358d85faf0f61ab515d3a1  gcc/graphite-isl-ast-to-gimple.c
  2d103b13b3ef14b7724520ae9294494f  gcc/graphite-isl-ast-to-gimple.h
  3fe8fa2aeb07d0c7d1d203b887d216b1  gcc/graphite-optimize-isl.c
  7ec4425c66c19929fcffabd7b9901d83  gcc/graphite-poly.c
*************** f425e365ba34b26c2c48a0b2f25392b1  gcc/hw
*** 4834,4889 ****
  1523b8d28fff01888d17f174fe20011c  gcc/ifcvt.h
  f933d194c4b3ac582e0ef8e88be285a5  gcc/inchash.c
  b204cad2fb3671fa87af8561f5be3f90  gcc/inchash.h
! 1a7e6636a0b737d39c8c19b3f077fc16  gcc/incpath.c
  9cf6fd175b70565987f279bc6640d9c9  gcc/incpath.h
  fe17c78b27ae9ee21279fc893511871c  gcc/init-regs.c
  dc217d9b1929e4e7a0f12c626df3a276  gcc/input.c
  69b0d5c7ea3266626a8fd1abc5d21809  gcc/input.h
  0f9a6404b0716dcd2273bcee5471a927  gcc/insn-addr.h
  a546259fb239feafd26288da3bd62101  gcc/insn-notes.def
! 8bed174953c395e2d3e78d6bbe6931b6  gcc/internal-fn.c
  6594b8ee3ed58306616248dfab3a856c  gcc/internal-fn.def
  a26e14c5103380e096d09c7f9c2d1518  gcc/internal-fn.h
  d59a6fb8775c3c59e37525da056a4e93  gcc/intl.c
  8ecacc88fa34f1b1759a956f9114da6d  gcc/intl.h
  6a04a4c4c045e89b1e214fcc50968993  gcc/ipa-chkp.c
  b0887d48f65d3f64dc7dc9d69a6e8495  gcc/ipa-chkp.h
! b5384914be9df84a8c6bded1c683e42b  gcc/ipa-comdats.c
! b781b3a1eb3f47e38ff8d32aebd7b405  gcc/ipa-cp.c
! e6b97a54f48e93606aa8b56b43079bba  gcc/ipa-devirt.c
! 2c6eb0e33e5711f500a077ebe8e8840b  gcc/ipa-icf-gimple.c
! 04e3ffaf0f32f0dbd7f9cfc16aa7aad2  gcc/ipa-icf-gimple.h
! 116c88a30c94408609f84a7b1e839f42  gcc/ipa-icf.c
! 42742975b2cd251c090bb5c09b66cb58  gcc/ipa-icf.h
  39329a5aa8d2a2c2538cc100d7e4584d  gcc/ipa-inline-analysis.c
! b0226bf864df6fa6550b450be4cdd2f0  gcc/ipa-inline-transform.c
  39c6670b02fd6ec3e053b1515ded41c9  gcc/ipa-inline.c
  bfc4b2e5277e500157ea9170486883a6  gcc/ipa-inline.h
! 32839e1f99db3b81577bf8bd70e6063d  gcc/ipa-polymorphic-call.c
  f7aebde2da66180189ddee43f00d4cbd  gcc/ipa-profile.c
! d38d619ae9c4d5cb2ba1d2f6c7f0bbd6  gcc/ipa-prop.c
  f67c6ffdd02d46b616a84da86443b9e9  gcc/ipa-prop.h
! 910a00207676a8e3463abc2cb1a47612  gcc/ipa-pure-const.c
  23bf4b1c06616e79ee61985da15a3302  gcc/ipa-ref.c
  3595926385361b6de3a2b3c37fe83d0c  gcc/ipa-ref.h
  79df2ef5a960075d6ffaf053654ccfd1  gcc/ipa-reference.c
  856043eb3d9f133e07b32665a5ecfe35  gcc/ipa-reference.h
! 900a3e264d5af4a42ec7fcc7b8e38f6b  gcc/ipa-split.c
  9053da93e399b146bd50fe8704f1666d  gcc/ipa-utils.c
  e58d0e497af408fa0e8cba93df83406b  gcc/ipa-utils.h
! a0962e386e9c161dab905e4f6f3ce489  gcc/ipa-visibility.c
  19ca0f2cf8d512ff6924e42eba32a933  gcc/ipa.c
! 29d3a4f9af7d55ebd868c9c83efbd9ff  gcc/ira-build.c
  e4e886635ec297de8005acf5e194531d  gcc/ira-color.c
  e81226cec09eafb085efa7518e8009ea  gcc/ira-conflicts.c
! 4c5b2a8da4a0ce491ac28d73c2462397  gcc/ira-costs.c
  c9181164bc346614433368b8485fb29e  gcc/ira-emit.c
! 348db6c35b96f4b63b2272622cb4c740  gcc/ira-int.h
! 44ca309cb2f694a0211995d530b1b076  gcc/ira-lives.c
  95cf1abe96c65b0acb4ad129db973e5f  gcc/ira.c
  e34ddccf14d87b7a61f2a272bbb8262d  gcc/ira.h
  e60d20de39e509fae6596f747effffb5  gcc/is-a.h
! 88b743a2f6fc089425c0b3ddae0342c6  gcc/java/ChangeLog
  507793f7d137759eaebce11bb6904781  gcc/java/ChangeLog.gimple-classes
  c52fb3faa0748d26588a8c62e7a032e3  gcc/java/ChangeLog.jit
  3becfaac793f49e1f52cd74e78172b48  gcc/java/ChangeLog.ptr
--- 4838,4893 ----
  1523b8d28fff01888d17f174fe20011c  gcc/ifcvt.h
  f933d194c4b3ac582e0ef8e88be285a5  gcc/inchash.c
  b204cad2fb3671fa87af8561f5be3f90  gcc/inchash.h
! 8277cefec288a827ddd34cb62bf04565  gcc/incpath.c
  9cf6fd175b70565987f279bc6640d9c9  gcc/incpath.h
  fe17c78b27ae9ee21279fc893511871c  gcc/init-regs.c
  dc217d9b1929e4e7a0f12c626df3a276  gcc/input.c
  69b0d5c7ea3266626a8fd1abc5d21809  gcc/input.h
  0f9a6404b0716dcd2273bcee5471a927  gcc/insn-addr.h
  a546259fb239feafd26288da3bd62101  gcc/insn-notes.def
! 8926b60753c895787b7707c4e599297e  gcc/internal-fn.c
  6594b8ee3ed58306616248dfab3a856c  gcc/internal-fn.def
  a26e14c5103380e096d09c7f9c2d1518  gcc/internal-fn.h
  d59a6fb8775c3c59e37525da056a4e93  gcc/intl.c
  8ecacc88fa34f1b1759a956f9114da6d  gcc/intl.h
  6a04a4c4c045e89b1e214fcc50968993  gcc/ipa-chkp.c
  b0887d48f65d3f64dc7dc9d69a6e8495  gcc/ipa-chkp.h
! 3b26e13b00ced1877be62ff341a343e8  gcc/ipa-comdats.c
! ea1cb676d510d22318b1e9b780bd1bd9  gcc/ipa-cp.c
! df1bbbdaa1ff5df5c3ad34b26f7f2807  gcc/ipa-devirt.c
! 4521a51cb8076a672ce0ed6ce06adc9a  gcc/ipa-icf-gimple.c
! 5a1a7b5c1097bab51b4cf465adda2d9a  gcc/ipa-icf-gimple.h
! b3282fc5dd4e5f594db085ad9227d68a  gcc/ipa-icf.c
! 1d0167a94867dc626b57893078e6f471  gcc/ipa-icf.h
  39329a5aa8d2a2c2538cc100d7e4584d  gcc/ipa-inline-analysis.c
! 48ec3afe3793fdd6730e461d8d9619cb  gcc/ipa-inline-transform.c
  39c6670b02fd6ec3e053b1515ded41c9  gcc/ipa-inline.c
  bfc4b2e5277e500157ea9170486883a6  gcc/ipa-inline.h
! 020e6c48afdc639af066946b518b5aa1  gcc/ipa-polymorphic-call.c
  f7aebde2da66180189ddee43f00d4cbd  gcc/ipa-profile.c
! 6ddf168d584b2ef5f39acfc9f41896fd  gcc/ipa-prop.c
  f67c6ffdd02d46b616a84da86443b9e9  gcc/ipa-prop.h
! 74335c370fa94cae0775ecaf6644e3b0  gcc/ipa-pure-const.c
  23bf4b1c06616e79ee61985da15a3302  gcc/ipa-ref.c
  3595926385361b6de3a2b3c37fe83d0c  gcc/ipa-ref.h
  79df2ef5a960075d6ffaf053654ccfd1  gcc/ipa-reference.c
  856043eb3d9f133e07b32665a5ecfe35  gcc/ipa-reference.h
! 0bf106b273d61ebc36050b9dab96bc42  gcc/ipa-split.c
  9053da93e399b146bd50fe8704f1666d  gcc/ipa-utils.c
  e58d0e497af408fa0e8cba93df83406b  gcc/ipa-utils.h
! eaff1a7d2230022660ac0aeec2877f51  gcc/ipa-visibility.c
  19ca0f2cf8d512ff6924e42eba32a933  gcc/ipa.c
! 7acfb95df19a0e596367c72077924ea9  gcc/ira-build.c
  e4e886635ec297de8005acf5e194531d  gcc/ira-color.c
  e81226cec09eafb085efa7518e8009ea  gcc/ira-conflicts.c
! e3cd76066abb8ba7aa5ba02a864c48aa  gcc/ira-costs.c
  c9181164bc346614433368b8485fb29e  gcc/ira-emit.c
! d125c66bec1f425e441321fc117b288c  gcc/ira-int.h
! 3747938b69876e1f7725a4f97638ac2e  gcc/ira-lives.c
  95cf1abe96c65b0acb4ad129db973e5f  gcc/ira.c
  e34ddccf14d87b7a61f2a272bbb8262d  gcc/ira.h
  e60d20de39e509fae6596f747effffb5  gcc/is-a.h
! 6693994932d700b7395384cc1f2ebc92  gcc/java/ChangeLog
  507793f7d137759eaebce11bb6904781  gcc/java/ChangeLog.gimple-classes
  c52fb3faa0748d26588a8c62e7a032e3  gcc/java/ChangeLog.jit
  3becfaac793f49e1f52cd74e78172b48  gcc/java/ChangeLog.ptr
*************** b4b149d7d7e53bcbb00d5852b7882509  gcc/ja
*** 4928,4934 ****
  08e8d232e5fcded6e3949cfd4c902663  gcc/java/win32-host.c
  65ea443b3147ee21cab24cb9875d64a8  gcc/java/zextract.c
  f8e1a3a1f14f5623c8747bfcb0be82b2  gcc/java/zipfile.h
! 7e74a5cd58fec567076f2ac48f621945  gcc/jit/ChangeLog
  6071bdf04fb356c5ac99a99ec00c9a12  gcc/jit/ChangeLog.jit
  6e0782f176adb9efa079d6f0847a7fd4  gcc/jit/Make-lang.in
  fd0d76b6467c987f813d430a35d4760a  gcc/jit/TODO.rst
--- 4932,4938 ----
  08e8d232e5fcded6e3949cfd4c902663  gcc/java/win32-host.c
  65ea443b3147ee21cab24cb9875d64a8  gcc/java/zextract.c
  f8e1a3a1f14f5623c8747bfcb0be82b2  gcc/java/zipfile.h
! e28f1238b76f74215c45b0090a8935aa  gcc/jit/ChangeLog
  6071bdf04fb356c5ac99a99ec00c9a12  gcc/jit/ChangeLog.jit
  6e0782f176adb9efa079d6f0847a7fd4  gcc/jit/Make-lang.in
  fd0d76b6467c987f813d430a35d4760a  gcc/jit/TODO.rst
*************** d4c5f051c30b621f3b8d02812e5aa08e  gcc/la
*** 5019,5027 ****
  83de5c6450456e215a5484083afcd32a  gcc/limity.h
  fda2af877f444efda1bdbe126599fa73  gcc/lists.c
  16086d64468975aa4ba54f78d2a7b542  gcc/lock-and-run.sh
! c623bd250dfc88ff9ce6e23df81dbde0  gcc/loop-doloop.c
  d5693c7b25c48b340a03d9560a656315  gcc/loop-init.c
! 4c60fadaaa7a541886b6d3c008edeb62  gcc/loop-invariant.c
  560d16a3d24598e0bbfacce458a7bffa  gcc/loop-iv.c
  20d276b6c214fab0292ee0cf2715eae3  gcc/loop-unroll.c
  a1e24a43b379e444b43e7c1b6f057e19  gcc/loop-unroll.h
--- 5023,5031 ----
  83de5c6450456e215a5484083afcd32a  gcc/limity.h
  fda2af877f444efda1bdbe126599fa73  gcc/lists.c
  16086d64468975aa4ba54f78d2a7b542  gcc/lock-and-run.sh
! d3f29156a39f22f033348387e98e18aa  gcc/loop-doloop.c
  d5693c7b25c48b340a03d9560a656315  gcc/loop-init.c
! 83a00b48e313714d61e5b8fce1409ebe  gcc/loop-invariant.c
  560d16a3d24598e0bbfacce458a7bffa  gcc/loop-iv.c
  20d276b6c214fab0292ee0cf2715eae3  gcc/loop-unroll.c
  a1e24a43b379e444b43e7c1b6f057e19  gcc/loop-unroll.h
*************** d4fb1f72af6ec7ec0cbd43b9b6515c6c  gcc/lo
*** 5029,5043 ****
  0ab893dbb9d43888870be388de205291  gcc/lower-subreg.h
  6c1d564997725e80cedeff2141e592b9  gcc/lra-assigns.c
  dc71edd55837d2d00cc6e82b7a92ad5e  gcc/lra-coalesce.c
! 260b5704ddac58a611fd4a56987102ab  gcc/lra-constraints.c
  15ac225970eb30ea8c5fc93f9965a836  gcc/lra-eliminations.c
  e759e8f21defccbbe41bf7091b54c5c6  gcc/lra-int.h
  b785d9ad8fb335ca8eb01f15567e33d4  gcc/lra-lives.c
! 3db672b53c7a7a17b70a1e02e053bdd6  gcc/lra-remat.c
  fffe3d3a5e547a6a8c53991f17ad5e3a  gcc/lra-spills.c
  59ccff36582362bd7b314d65fabb20bd  gcc/lra.c
  85cddb1436a037afee85188e8d7e3827  gcc/lra.h
! 93b2df951953be6a8a51fbef03298132  gcc/lto-cgraph.c
  d9002c560058f527e232b70690c0c3fa  gcc/lto-compress.c
  029473d133948fb5843e83ae6e546d77  gcc/lto-compress.h
  1de0b585bf600e31ee8375af45f4bb7f  gcc/lto-opts.c
--- 5033,5047 ----
  0ab893dbb9d43888870be388de205291  gcc/lower-subreg.h
  6c1d564997725e80cedeff2141e592b9  gcc/lra-assigns.c
  dc71edd55837d2d00cc6e82b7a92ad5e  gcc/lra-coalesce.c
! ca21bda665e913cc80711c857734b278  gcc/lra-constraints.c
  15ac225970eb30ea8c5fc93f9965a836  gcc/lra-eliminations.c
  e759e8f21defccbbe41bf7091b54c5c6  gcc/lra-int.h
  b785d9ad8fb335ca8eb01f15567e33d4  gcc/lra-lives.c
! 2c5156a7e38f443942a60dff06eded60  gcc/lra-remat.c
  fffe3d3a5e547a6a8c53991f17ad5e3a  gcc/lra-spills.c
  59ccff36582362bd7b314d65fabb20bd  gcc/lra.c
  85cddb1436a037afee85188e8d7e3827  gcc/lra.h
! ebb524429f17fc468503fc255ce09041  gcc/lto-cgraph.c
  d9002c560058f527e232b70690c0c3fa  gcc/lto-compress.c
  029473d133948fb5843e83ae6e546d77  gcc/lto-compress.h
  1de0b585bf600e31ee8375af45f4bb7f  gcc/lto-opts.c
*************** d9002c560058f527e232b70690c0c3fa  gcc/lt
*** 5047,5062 ****
  0fd79fbbb87f675c868496ec56eb2464  gcc/lto-streamer-in.c
  c002c649a0c0f0bb433ed63351e9d0c9  gcc/lto-streamer-out.c
  11ffe5264c72c7306e0fe341ecf592f3  gcc/lto-streamer.c
! 6a166d540f27a847aeb132fe66cbc171  gcc/lto-streamer.h
  b6075bf1268a61c1f26d7c1b31bb2469  gcc/lto-wrapper.c
! 9bfe3f2f9cd9192f5f256e427a425665  gcc/lto/ChangeLog
  7fe3fe76aea6d1b48ffc76363c865d97  gcc/lto/Make-lang.in
  ee021832005b23fd5ecb90bf3db3e01d  gcc/lto/common.c
  e0b7396a801f9facb0387b0a80085c06  gcc/lto/common.h
  c3b5fca213cfc77879bd63105f11ac96  gcc/lto/config-lang.in
  af2109b68ffeb6f759219d61dac47473  gcc/lto/lang-specs.h
  36f7f8f251a80790e991707ed03bbb10  gcc/lto/lang.opt
! ab6c518f11be5961f6199141903c3b7f  gcc/lto/lto-lang.c
  b4c89b44738c3b08be9bc1236e731375  gcc/lto/lto-object.c
  1c544c11eb71bef3c88a678397042f13  gcc/lto/lto-partition.c
  4c6f467120d3693159167bb7ceac64bb  gcc/lto/lto-partition.h
--- 5051,5066 ----
  0fd79fbbb87f675c868496ec56eb2464  gcc/lto-streamer-in.c
  c002c649a0c0f0bb433ed63351e9d0c9  gcc/lto-streamer-out.c
  11ffe5264c72c7306e0fe341ecf592f3  gcc/lto-streamer.c
! 184f1c20154d0f212fa58ac8d13ca917  gcc/lto-streamer.h
  b6075bf1268a61c1f26d7c1b31bb2469  gcc/lto-wrapper.c
! 1da49bc8e48ab89c89f71cbb598d1b0e  gcc/lto/ChangeLog
  7fe3fe76aea6d1b48ffc76363c865d97  gcc/lto/Make-lang.in
  ee021832005b23fd5ecb90bf3db3e01d  gcc/lto/common.c
  e0b7396a801f9facb0387b0a80085c06  gcc/lto/common.h
  c3b5fca213cfc77879bd63105f11ac96  gcc/lto/config-lang.in
  af2109b68ffeb6f759219d61dac47473  gcc/lto/lang-specs.h
  36f7f8f251a80790e991707ed03bbb10  gcc/lto/lang.opt
! 038349ac0d276d897ef7a6063325f17f  gcc/lto/lto-lang.c
  b4c89b44738c3b08be9bc1236e731375  gcc/lto/lto-object.c
  1c544c11eb71bef3c88a678397042f13  gcc/lto/lto-partition.c
  4c6f467120d3693159167bb7ceac64bb  gcc/lto/lto-partition.h
*************** ef201965affcc6b74d29e1ea6105b070  gcc/lt
*** 5067,5079 ****
  6a20a37f7aceadbd054c67522e57fd1b  gcc/machmode.def
  89aa6d8f3209ccf7ec9dd69897a8063f  gcc/machmode.h
  898e96de756ae0ccc83f01ba5a426f5d  gcc/main.c
! e134e6365e1eb8987701b988dccca6dd  gcc/match.pd
  947ba21423006c901f25943a744f2d9e  gcc/mcf.c
  d52335c26579ab1f3fc13b7b18d505b0  gcc/mkconfig.sh
  2b9b46e97d3e14352f599686f0d91b48  gcc/mode-classes.def
  ef14a108aa69a87062b7c18a11716ff8  gcc/mode-switching.c
  ce508eb66e3b05228233b1de1d583e3f  gcc/modulo-sched.c
! fabe777608385611fa5c604f639acad4  gcc/objc/ChangeLog
  1467c556ec4e053e2361586f54a9427b  gcc/objc/Make-lang.in
  8c9cfeb579f17a1b0cd5a4c3aa9c87f9  gcc/objc/config-lang.in
  d2fea098d2345e086d9552320b97bf70  gcc/objc/lang-specs.h
--- 5071,5083 ----
  6a20a37f7aceadbd054c67522e57fd1b  gcc/machmode.def
  89aa6d8f3209ccf7ec9dd69897a8063f  gcc/machmode.h
  898e96de756ae0ccc83f01ba5a426f5d  gcc/main.c
! 11781c9d3eeeadc970201c7bee29a3de  gcc/match.pd
  947ba21423006c901f25943a744f2d9e  gcc/mcf.c
  d52335c26579ab1f3fc13b7b18d505b0  gcc/mkconfig.sh
  2b9b46e97d3e14352f599686f0d91b48  gcc/mode-classes.def
  ef14a108aa69a87062b7c18a11716ff8  gcc/mode-switching.c
  ce508eb66e3b05228233b1de1d583e3f  gcc/modulo-sched.c
! 333d922691950355dc85af8f5aa5e918  gcc/objc/ChangeLog
  1467c556ec4e053e2361586f54a9427b  gcc/objc/Make-lang.in
  8c9cfeb579f17a1b0cd5a4c3aa9c87f9  gcc/objc/config-lang.in
  d2fea098d2345e086d9552320b97bf70  gcc/objc/lang-specs.h
*************** c121eaad475029c76161c850fe904332  gcc/ob
*** 5092,5098 ****
  ef6bc5810d2f1463e4f246f04ee10ad3  gcc/objc/objc-runtime-shared-support.c
  6bbbb36e7906ba58ad348d23f81c65d1  gcc/objc/objc-runtime-shared-support.h
  49184ed37a18e364382ab3d427160ae3  gcc/objc/objc-tree.def
! db01f782ccefe5c2b5e40e1b59ecb239  gcc/objcp/ChangeLog
  a1b9aa61b7cb7b3df974d6c6d567fc6a  gcc/objcp/Make-lang.in
  0dc3f5bf41dd77ca6f950b9b0959a881  gcc/objcp/config-lang.in
  4bd28419f45a1369fd9b3a53e7ddb458  gcc/objcp/lang-specs.h
--- 5096,5102 ----
  ef6bc5810d2f1463e4f246f04ee10ad3  gcc/objc/objc-runtime-shared-support.c
  6bbbb36e7906ba58ad348d23f81c65d1  gcc/objc/objc-runtime-shared-support.h
  49184ed37a18e364382ab3d427160ae3  gcc/objc/objc-tree.def
! 7d105671c732ad7cf884a0b19c791449  gcc/objcp/ChangeLog
  a1b9aa61b7cb7b3df974d6c6d567fc6a  gcc/objcp/Make-lang.in
  0dc3f5bf41dd77ca6f950b9b0959a881  gcc/objcp/config-lang.in
  4bd28419f45a1369fd9b3a53e7ddb458  gcc/objcp/lang-specs.h
*************** eb0ac940c858617b72ddf7bb9d1fa1ff  gcc/ob
*** 5102,5108 ****
  ef525ad472805942e97966c81b2cf98c  gcc/omega.c
  9ba04ab87d1f2b7bd95c37f481d91719  gcc/omega.h
  937086ff8c81246b55c72f0a5940d3fa  gcc/omp-builtins.def
! afa25545788bbf7222fd251f45fef098  gcc/omp-low.c
  cdad0b8e8f0acb46eba142b7349eb105  gcc/omp-low.h
  b43078b5e309d8ec060ac9c1d2262046  gcc/opt-functions.awk
  531f6ab0535206ae8f88cfc583047c74  gcc/opt-gather.awk
--- 5106,5112 ----
  ef525ad472805942e97966c81b2cf98c  gcc/omega.c
  9ba04ab87d1f2b7bd95c37f481d91719  gcc/omega.h
  937086ff8c81246b55c72f0a5940d3fa  gcc/omp-builtins.def
! 7e0509efc86e1619c834f3e1ddfb5108  gcc/omp-low.c
  cdad0b8e8f0acb46eba142b7349eb105  gcc/omp-low.h
  b43078b5e309d8ec060ac9c1d2262046  gcc/opt-functions.awk
  531f6ab0535206ae8f88cfc583047c74  gcc/opt-gather.awk
*************** c27b895c4dcc99c11261c54c56474ddf  gcc/op
*** 5121,5127 ****
  667562fe457e93a68c3fdb017d7785f0  gcc/opts.h
  48611d87a9c47d84d67a4d63c7820030  gcc/output.h
  6094d598ea4879f93365d96663822e74  gcc/params.c
! 4e861751cfff7fa77f622659361dc360  gcc/params.def
  df3d2de1b60c9b25357fc8e3441ce5de  gcc/params.h
  7d06dc033a03de27413e72dc19f1f9bb  gcc/pass_manager.h
  bb60fec484b549273d526c63a6ff87dc  gcc/passes.c
--- 5125,5131 ----
  667562fe457e93a68c3fdb017d7785f0  gcc/opts.h
  48611d87a9c47d84d67a4d63c7820030  gcc/output.h
  6094d598ea4879f93365d96663822e74  gcc/params.c
! b1c8fa43c4d19f845f1d42e17fac7e75  gcc/params.def
  df3d2de1b60c9b25357fc8e3441ce5de  gcc/params.h
  7d06dc033a03de27413e72dc19f1f9bb  gcc/pass_manager.h
  bb60fec484b549273d526c63a6ff87dc  gcc/passes.c
*************** bb60fec484b549273d526c63a6ff87dc  gcc/pa
*** 5129,5135 ****
  9d5e6e250abd1b626d9a8afd3090a00d  gcc/plugin.c
  0735a1285e9a433a8e80730829d7f2b6  gcc/plugin.def
  e5b16a08af067e51b4068cd59f09dd96  gcc/plugin.h
! 602e325a3a0ab0ccf43cfb3b216bb7e8  gcc/po/ChangeLog
  fa5d07665ec5d78cd3f885027f0e75e6  gcc/po/EXCLUDES
  4b862181f660d1e76646078a7cce491c  gcc/po/be.gmo
  cbb8879ea83c2a58585341e7db66c1c3  gcc/po/be.po
--- 5133,5139 ----
  9d5e6e250abd1b626d9a8afd3090a00d  gcc/plugin.c
  0735a1285e9a433a8e80730829d7f2b6  gcc/plugin.def
  e5b16a08af067e51b4068cd59f09dd96  gcc/plugin.h
! c94a1c2423342e7e62ca2777b030acc6  gcc/po/ChangeLog
  fa5d07665ec5d78cd3f885027f0e75e6  gcc/po/EXCLUDES
  4b862181f660d1e76646078a7cce491c  gcc/po/be.gmo
  cbb8879ea83c2a58585341e7db66c1c3  gcc/po/be.po
*************** c35c2dc1bf80c9251f8795761ef92904  gcc/po
*** 5141,5152 ****
  b382dc0228f67c34380c0dfb2a949cc8  gcc/po/el.po
  1e8383b39038653a224bd77e57da7ce0  gcc/po/es.gmo
  ce1e6954f2164d9f21d16089deb11753  gcc/po/es.po
! 35fef64203930478b0a992d732f90728  gcc/po/exgettext
  ec05fb40e059ccb77494afe8b158837d  gcc/po/fi.gmo
  4fe96dcef025b4715ba668a39b9def94  gcc/po/fi.po
  c556290d184ee5eba9873b64b53a34b6  gcc/po/fr.gmo
  29c3946e69b8dc1f0c1b6b140d2e46c8  gcc/po/fr.po
! 80b7c77b2ec43eeedc37a179eed76569  gcc/po/gcc.pot
  04a69fc3fa81570a6d6672add9513f69  gcc/po/hr.gmo
  7148f8ccc1a9fa124d41c9021be179c2  gcc/po/hr.po
  61ff4405f5b1750e810013a3beb17805  gcc/po/id.gmo
--- 5145,5156 ----
  b382dc0228f67c34380c0dfb2a949cc8  gcc/po/el.po
  1e8383b39038653a224bd77e57da7ce0  gcc/po/es.gmo
  ce1e6954f2164d9f21d16089deb11753  gcc/po/es.po
! 51a9a1416caa32b625e9023f15e8b0c8  gcc/po/exgettext
  ec05fb40e059ccb77494afe8b158837d  gcc/po/fi.gmo
  4fe96dcef025b4715ba668a39b9def94  gcc/po/fi.po
  c556290d184ee5eba9873b64b53a34b6  gcc/po/fr.gmo
  29c3946e69b8dc1f0c1b6b140d2e46c8  gcc/po/fr.po
! 6b3c295a93d24e29a6d8658c55b000b8  gcc/po/gcc.pot
  04a69fc3fa81570a6d6672add9513f69  gcc/po/hr.gmo
  7148f8ccc1a9fa124d41c9021be179c2  gcc/po/hr.po
  61ff4405f5b1750e810013a3beb17805  gcc/po/id.gmo
*************** b9a3e2c3d2f8acd98d9fa4941fc9520f  gcc/po
*** 5172,5184 ****
  942da546487579bede1fc9fcde51a84d  gcc/po/zh_TW.gmo
  13b738a3353f614dc55a82853e18a427  gcc/po/zh_TW.po
  694919e21f23219f50834f9f2af6cfd9  gcc/postreload-gcse.c
! 2a3b5b1129de159da4ede9aff0c197b4  gcc/postreload.c
  c57ff0badb528e99fd8dc7b847fb5a26  gcc/predict.c
  873f4671c1896c9ac3475f6140ff06b2  gcc/predict.def
  95fbd1ad395d8804878b3e717df8f000  gcc/predict.h
  648f7651124f5679e42bd33ebf6b122c  gcc/prefix.c
  ee46d16ac187739a468d1dbb63790e1f  gcc/prefix.h
! 4b5aa1dc5140d6642cdc50cd740af5fb  gcc/pretty-print.c
  79e9e788b154c4b7384707751d23aafe  gcc/pretty-print.h
  165e0c8986c8a45b7cac01647ae704cb  gcc/print-rtl.c
  a3aa88f0317794a1339678dd6fd285d4  gcc/print-rtl.h
--- 5176,5188 ----
  942da546487579bede1fc9fcde51a84d  gcc/po/zh_TW.gmo
  13b738a3353f614dc55a82853e18a427  gcc/po/zh_TW.po
  694919e21f23219f50834f9f2af6cfd9  gcc/postreload-gcse.c
! f5f9f9fad922b860879ab58ac717e712  gcc/postreload.c
  c57ff0badb528e99fd8dc7b847fb5a26  gcc/predict.c
  873f4671c1896c9ac3475f6140ff06b2  gcc/predict.def
  95fbd1ad395d8804878b3e717df8f000  gcc/predict.h
  648f7651124f5679e42bd33ebf6b122c  gcc/prefix.c
  ee46d16ac187739a468d1dbb63790e1f  gcc/prefix.h
! 7c22f3a03227890e475e189ac301c779  gcc/pretty-print.c
  79e9e788b154c4b7384707751d23aafe  gcc/pretty-print.h
  165e0c8986c8a45b7cac01647ae704cb  gcc/print-rtl.c
  a3aa88f0317794a1339678dd6fd285d4  gcc/print-rtl.h
*************** fd77568487c1fe402eca97688f752947  gcc/pr
*** 5189,5201 ****
  dc76f46d2eeced8f38682f36be741064  gcc/read-md.c
  04c30a58131d2ebea861021fcf0d50f2  gcc/read-md.h
  5e462cb7924857e24efd2c8590300935  gcc/read-rtl.c
! 04e063ee25989a1c9d882aac5dcdda42  gcc/real.c
  4f3223b1ab82b5189bf8c430cf63c34a  gcc/real.h
  3c8f7d610939ae09062b0ed80e244a0b  gcc/realmpfr.c
  bc7c71d90fb820eced6c6a523c975fa2  gcc/realmpfr.h
  d0261a6e21bf53d52f47b58a9cfe6d15  gcc/recog.c
  976787b7cace175fee5d080a3e8f0cae  gcc/recog.h
! 909d9ba1f886c3cc281c6737248e92b6  gcc/ree.c
  11fefb6b381e6c6f9741dea0e80b30b2  gcc/reg-notes.def
  0bb03a2ed33b12e22c34eacb6ff7607e  gcc/reg-stack.c
  34ccb4ab602436370d790ea91d9f9c6c  gcc/regcprop.c
--- 5193,5205 ----
  dc76f46d2eeced8f38682f36be741064  gcc/read-md.c
  04c30a58131d2ebea861021fcf0d50f2  gcc/read-md.h
  5e462cb7924857e24efd2c8590300935  gcc/read-rtl.c
! 8dbc50aa9ec9911826b9548e2ac69848  gcc/real.c
  4f3223b1ab82b5189bf8c430cf63c34a  gcc/real.h
  3c8f7d610939ae09062b0ed80e244a0b  gcc/realmpfr.c
  bc7c71d90fb820eced6c6a523c975fa2  gcc/realmpfr.h
  d0261a6e21bf53d52f47b58a9cfe6d15  gcc/recog.c
  976787b7cace175fee5d080a3e8f0cae  gcc/recog.h
! b93e255b554267b593f9b2f56933db97  gcc/ree.c
  11fefb6b381e6c6f9741dea0e80b30b2  gcc/reg-notes.def
  0bb03a2ed33b12e22c34eacb6ff7607e  gcc/reg-stack.c
  34ccb4ab602436370d790ea91d9f9c6c  gcc/regcprop.c
*************** d2b5ad4ca4df71fa3ff7c30698e960c8  gcc/rt
*** 5219,5225 ****
  4992e1340dee083241ee6b9865a725e4  gcc/rtl-iter.h
  f5a76969d35052ffbe458cf48fd400aa  gcc/rtl.c
  59570b63c033e3dad5297bdef455c9a1  gcc/rtl.def
! e15e7203a3f256e05fbb30e9a33adc98  gcc/rtl.h
  46d83f8e19f75939527d9176be6248ec  gcc/rtlanal.c
  3c249e111fe25fd056c1ebbb92316bec  gcc/rtlhash.c
  7fa64a734faee469be2d12b982bec9b5  gcc/rtlhash.h
--- 5223,5229 ----
  4992e1340dee083241ee6b9865a725e4  gcc/rtl-iter.h
  f5a76969d35052ffbe458cf48fd400aa  gcc/rtl.c
  59570b63c033e3dad5297bdef455c9a1  gcc/rtl.def
! 5e227b9833168924aca7b75ac809eb8b  gcc/rtl.h
  46d83f8e19f75939527d9176be6248ec  gcc/rtlanal.c
  3c249e111fe25fd056c1ebbb92316bec  gcc/rtlhash.c
  7fa64a734faee469be2d12b982bec9b5  gcc/rtlhash.h
*************** aa85b29363ddccfea8598c2a9bb1beae  gcc/sd
*** 5240,5253 ****
  fe53b4099b1c74eec5a9462ee02557cf  gcc/sel-sched-dump.h
  8594969001452b444410fa47547f806c  gcc/sel-sched-ir.c
  f05e66bd3c548fe69a30f8758feeb4d3  gcc/sel-sched-ir.h
! 49db95bb2de47390cb531104e079b454  gcc/sel-sched.c
  00ee6e2727025221b5e4e5e700d59750  gcc/sel-sched.h
  5d5a59cc76c759e2435ab3490ec03e95  gcc/sese.c
  6cd9f1fd8ca10ea22532e4369881922c  gcc/sese.h
  6dbc2839dc1e1e5da92e34c8b0505340  gcc/shrink-wrap.c
  ae63ea15babd7306125f65e8b78f57d0  gcc/shrink-wrap.h
  13e62d00728279500588319d2e1f7c2e  gcc/signop.h
! 929717dbda122c6b6fd9a4a60ada37bc  gcc/simplify-rtx.c
  2450c48517f9299f947fa2f52d1c9f17  gcc/sparseset.c
  8aae43b08378c4b4b8bab0c26e2ef7e6  gcc/sparseset.h
  621d73e82722f13246ecdaae3f16fb7f  gcc/sreal.c
--- 5244,5257 ----
  fe53b4099b1c74eec5a9462ee02557cf  gcc/sel-sched-dump.h
  8594969001452b444410fa47547f806c  gcc/sel-sched-ir.c
  f05e66bd3c548fe69a30f8758feeb4d3  gcc/sel-sched-ir.h
! f0f43bb4606af7d309b5a879fe5ab44b  gcc/sel-sched.c
  00ee6e2727025221b5e4e5e700d59750  gcc/sel-sched.h
  5d5a59cc76c759e2435ab3490ec03e95  gcc/sese.c
  6cd9f1fd8ca10ea22532e4369881922c  gcc/sese.h
  6dbc2839dc1e1e5da92e34c8b0505340  gcc/shrink-wrap.c
  ae63ea15babd7306125f65e8b78f57d0  gcc/shrink-wrap.h
  13e62d00728279500588319d2e1f7c2e  gcc/signop.h
! 8875ddbc331dcd001f05e8ccd04ccdcd  gcc/simplify-rtx.c
  2450c48517f9299f947fa2f52d1c9f17  gcc/sparseset.c
  8aae43b08378c4b4b8bab0c26e2ef7e6  gcc/sparseset.h
  621d73e82722f13246ecdaae3f16fb7f  gcc/sreal.c
*************** fdf36d022d9280a7ede14deb4cbe938a  gcc/st
*** 5269,5275 ****
  245170483ff4eafae29d285ae8e77664  gcc/symbol-summary.h
  9363183ddca846c9d522bc3387a6207d  gcc/symtab.c
  8b3da6264f47d4c01dff953566a56308  gcc/sync-builtins.def
! 5bf9b81c9e308e967a7976cc0b642c47  gcc/system.h
  c9e80e7930ba1a3233936e81faeec627  gcc/target-def.h
  9f9c433b34da50be43735c4dafdc7174  gcc/target-globals.c
  3797eb8598e0134c86b76b90fe0e6c48  gcc/target-globals.h
--- 5273,5279 ----
  245170483ff4eafae29d285ae8e77664  gcc/symbol-summary.h
  9363183ddca846c9d522bc3387a6207d  gcc/symtab.c
  8b3da6264f47d4c01dff953566a56308  gcc/sync-builtins.def
! 2f9b9aa61c26fafe83857e5c65c9c613  gcc/system.h
  c9e80e7930ba1a3233936e81faeec627  gcc/target-def.h
  9f9c433b34da50be43735c4dafdc7174  gcc/target-globals.c
  3797eb8598e0134c86b76b90fe0e6c48  gcc/target-globals.h
*************** c9e80e7930ba1a3233936e81faeec627  gcc/ta
*** 5278,5284 ****
  81c28a0c9e11f47ae7bb9f605a04605d  gcc/target.h
  6f061e32f1df5951fadbe6697a0ac4c0  gcc/targhooks.c
  b87f0f1fa2618e2c9ecb005ac9659869  gcc/targhooks.h
! 8ffb152b1a3da92d2e40a2947946c177  gcc/testsuite/ChangeLog
  862f04afbd87da2cc6bc432c3f28430f  gcc/testsuite/ChangeLog-1993-2007
  029a5d8dacd25eb5d4711452ac448e5b  gcc/testsuite/ChangeLog-2008
  13ac28c41d51b66b4ec40dba6bd50f39  gcc/testsuite/ChangeLog-2009
--- 5282,5288 ----
  81c28a0c9e11f47ae7bb9f605a04605d  gcc/target.h
  6f061e32f1df5951fadbe6697a0ac4c0  gcc/targhooks.c
  b87f0f1fa2618e2c9ecb005ac9659869  gcc/targhooks.h
! c57b691977d2367879c2363abb99350d  gcc/testsuite/ChangeLog
  862f04afbd87da2cc6bc432c3f28430f  gcc/testsuite/ChangeLog-1993-2007
  029a5d8dacd25eb5d4711452ac448e5b  gcc/testsuite/ChangeLog-2008
  13ac28c41d51b66b4ec40dba6bd50f39  gcc/testsuite/ChangeLog-2009
*************** f79bc4a80b6890a56ed93a450311aa3f  gcc/te
*** 7914,7919 ****
--- 7918,7924 ----
  42fc3aa54365f66ed90d26e70e157cc5  gcc/testsuite/c-c++-common/Wunused-var-12.c
  c44ec4615d5347ff4cb4bb8dd31541a4  gcc/testsuite/c-c++-common/Wunused-var-13.c
  80c4ecb8009d5febfdba9eeaee769526  gcc/testsuite/c-c++-common/Wunused-var-14.c
+ 38f41715a5590e9152263fa65a5fd464  gcc/testsuite/c-c++-common/Wunused-var-16.c
  5f69d6398e9b0fc829351a16f994916d  gcc/testsuite/c-c++-common/Wunused-var-2.c
  8504217c544401c14012c8e1a1c18970  gcc/testsuite/c-c++-common/Wunused-var-3.c
  43839f1fa5726ea0a0d6e063d7980642  gcc/testsuite/c-c++-common/Wunused-var-4.c
*************** d96e86e0b770414e72de009b6c7afadd  gcc/te
*** 7980,7985 ****
--- 7985,7991 ----
  ae5400233bb23dafe56f543cc5bb1ba6  gcc/testsuite/c-c++-common/asan/pr63638.c
  0a221c339accacadef51e91e2f07b9ba  gcc/testsuite/c-c++-common/asan/pr63888.c
  2a794af8b446f3413fe5b973ea309b7b  gcc/testsuite/c-c++-common/asan/pr64820.c
+ d4cafd1e2a02428237d07dbd1a042e54  gcc/testsuite/c-c++-common/asan/pr79944.c
  e462ece8a21c17b73bf0f22d3042394c  gcc/testsuite/c-c++-common/asan/red-align-1.c
  25cb116750b1ce1623648a68019a3596  gcc/testsuite/c-c++-common/asan/red-align-2.c
  8940936501084c6e4d7f6d110ba612d8  gcc/testsuite/c-c++-common/asan/rlimit-mmap-test-1.c
*************** e123297fccae243c537f91e155c74a71  gcc/te
*** 8005,8010 ****
--- 8011,8017 ----
  6d7e356a55667553550e9cd33323e1f5  gcc/testsuite/c-c++-common/attributes-2.c
  9efe1db0eb6555094b02b42cc038c835  gcc/testsuite/c-c++-common/builtin-arith-overflow-1.c
  41df51bc4faa62cf4b0a5b0f48fd7eda  gcc/testsuite/c-c++-common/builtin-offsetof.c
+ baf6186d676fd9615e78346321a90ff8  gcc/testsuite/c-c++-common/builtin-shuffle-1.c
  1c5ba2eafe48e60b5503b568a5d0c9ac  gcc/testsuite/c-c++-common/cilk-plus/AN/an-if.c
  a888b5e17123e676b54fca597cbc0a44  gcc/testsuite/c-c++-common/cilk-plus/AN/array_test1.c
  08ef5fb4ef025ebba5f7a5d3f5d23e36  gcc/testsuite/c-c++-common/cilk-plus/AN/array_test2.c
*************** a1366bea9fa68e41aa711cae8e7ea133  gcc/te
*** 8316,8321 ****
--- 8323,8331 ----
  18a1208abfd097e948c6551f3813c293  gcc/testsuite/c-c++-common/gomp/pr67502.c
  e403fd2da7ac85d61ff83e1ef894ef8d  gcc/testsuite/c-c++-common/gomp/pr67517.c
  2e19a3386e433bba3b72ff1ec3df2cee  gcc/testsuite/c-c++-common/gomp/pr67521.c
+ 8d4187a1bda8777b2ff9ff3a8693ac86  gcc/testsuite/c-c++-common/gomp/pr71758.c
+ a1d1201800784f60e84899ae25155f9b  gcc/testsuite/c-c++-common/gomp/pr79512.c
+ b966b032e9791b6b1d299eec70706856  gcc/testsuite/c-c++-common/gomp/pr81006.c
  328147f679f9eac26be960bf85acb2e8  gcc/testsuite/c-c++-common/gomp/sections1.c
  c7cb982e272572b3d42948b23c3c6229  gcc/testsuite/c-c++-common/gomp/simd1.c
  3ffb158d7db65691583ca6ff7330457a  gcc/testsuite/c-c++-common/gomp/simd2.c
*************** e827ebe372e4239bd1ec76051f4882f1  gcc/te
*** 8406,8411 ****
--- 8416,8429 ----
  dc7d9d40dac973e012fc8b7b6f54d784  gcc/testsuite/c-c++-common/pr69764.c
  f4386df5fa5c32d56388c75bdf15c9d4  gcc/testsuite/c-c++-common/pr69797.c
  25c6ea4844eb15010d49a3780fb6bb37  gcc/testsuite/c-c++-common/pr70297.c
+ ccc164356d4817396e516749bf924ce8  gcc/testsuite/c-c++-common/pr70336.c
+ 787c05b57b9d12074e10b8dd90f2e31f  gcc/testsuite/c-c++-common/pr72747-1.c
+ e0a81999221bcfcb3f37370ca022637f  gcc/testsuite/c-c++-common/pr72747-2.c
+ aa9180dd8f8db71eedda52c54d5dcfe1  gcc/testsuite/c-c++-common/pr77624-1.c
+ 6d950c28409779b8786e764dbfa04ed7  gcc/testsuite/c-c++-common/pr77624-2.c
+ ce91ea7c46f421a0b712ff52ee4f9985  gcc/testsuite/c-c++-common/pr79641.c
+ 23a387907d550f4d99b8e38b9154c710  gcc/testsuite/c-c++-common/pr81052.c
+ 29c7ff6eb5caca1dd6391410ce6c69e4  gcc/testsuite/c-c++-common/pr82112.c
  b0ba836310044e7b419ef679f0b48d6f  gcc/testsuite/c-c++-common/raw-string-1.c
  554e7071d2525351de28445762633866  gcc/testsuite/c-c++-common/raw-string-10.c
  1183cc89c3223291d7813cf8d78ef4d6  gcc/testsuite/c-c++-common/raw-string-11.c
*************** da953592b5918925210396862fda7319  gcc/te
*** 8550,8555 ****
--- 8568,8574 ----
  52d73498f49b7b249b4b5a5652826619  gcc/testsuite/c-c++-common/tsan/pr65400-1.c
  695efb40d461078d61105c562aeff7de  gcc/testsuite/c-c++-common/tsan/pr65400-2.c
  5a0d8871e2454b025935b73f908b9ea9  gcc/testsuite/c-c++-common/tsan/pr65400-3.c
+ 94a3ce6b0420494c8401106bec4aeff5  gcc/testsuite/c-c++-common/tsan/pr68260.c
  9651a827618e2399b209ed88d7c818cb  gcc/testsuite/c-c++-common/tsan/race_on_barrier.c
  c17ef9001f4d2a242d6818763dfa63ff  gcc/testsuite/c-c++-common/tsan/race_on_barrier2.c
  e67a39a2873754e03375bb55c452b32a  gcc/testsuite/c-c++-common/tsan/race_on_mutex.c
*************** bf3eafbf8ab8751240e00f5411cf7d52  gcc/te
*** 8579,8584 ****
--- 8598,8604 ----
  3887eb3b39d6bb827c5b762941936069  gcc/testsuite/c-c++-common/ubsan/attrib-3.c
  572cbd8ec273eb277857a0fdb277eb0b  gcc/testsuite/c-c++-common/ubsan/attrib-4.c
  5faaf84c5345dab6d3aa98bf476cc4dc  gcc/testsuite/c-c++-common/ubsan/bounds-1.c
+ e41a9c9640280bfabdc970ff41f1e444  gcc/testsuite/c-c++-common/ubsan/bounds-13.c
  5ce7dbfd4301c9cde8b861eef45a151b  gcc/testsuite/c-c++-common/ubsan/bounds-2.c
  e7f60e0642d24587e57ad55271053c36  gcc/testsuite/c-c++-common/ubsan/bounds-3.c
  6f33417e60ac28a7874676d1ea062d3a  gcc/testsuite/c-c++-common/ubsan/bounds-4.c
*************** e421ddf2d69b41e79c4238d86ca23e02  gcc/te
*** 8596,8602 ****
  701ee447bdcb3bdd63f4e19e0aa275c7  gcc/testsuite/c-c++-common/ubsan/div-by-zero-5.c
  f1d5ba00cab5b6e91752dc500c497bad  gcc/testsuite/c-c++-common/ubsan/div-by-zero-6.c
  be42c7c0119ada6c8b75859883b7947d  gcc/testsuite/c-c++-common/ubsan/div-by-zero-7.c
! eb238d1dcc8f0f542f985153d56ddefa  gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-1.c
  4051451bd6cecbd812bae83ec9c07afd  gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-10.c
  b089faa4c8cfdb57b56ef700c240d0a9  gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-2.c
  32890d6e68882ccf1b8ee07e61d91f10  gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-3.c
--- 8616,8622 ----
  701ee447bdcb3bdd63f4e19e0aa275c7  gcc/testsuite/c-c++-common/ubsan/div-by-zero-5.c
  f1d5ba00cab5b6e91752dc500c497bad  gcc/testsuite/c-c++-common/ubsan/div-by-zero-6.c
  be42c7c0119ada6c8b75859883b7947d  gcc/testsuite/c-c++-common/ubsan/div-by-zero-7.c
! 6726dc6b32348d286beda628454d50b9  gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-1.c
  4051451bd6cecbd812bae83ec9c07afd  gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-10.c
  b089faa4c8cfdb57b56ef700c240d0a9  gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-2.c
  32890d6e68882ccf1b8ee07e61d91f10  gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-3.c
*************** a9f3dd0d1bd6ea12b3ec1926c0ec043d  gcc/te
*** 8627,8633 ****
  76d40946b1ad5e4265503cdfd4a64388  gcc/testsuite/c-c++-common/ubsan/null-8.c
  effe9084cb4356fb8ac72c7ca46102b0  gcc/testsuite/c-c++-common/ubsan/null-9.c
  e57e483ed447f5dac34abe7e805f8853  gcc/testsuite/c-c++-common/ubsan/object-size-1.c
! 2aa3a2a7838e282f2118621d0f4258bc  gcc/testsuite/c-c++-common/ubsan/object-size-10.c
  702485ed4844237ef8004854e7eb54c1  gcc/testsuite/c-c++-common/ubsan/object-size-2.c
  9da79940216d11d0776c0614205c2ffd  gcc/testsuite/c-c++-common/ubsan/object-size-3.c
  585d2490d604dfc496c6a3e2c197c955  gcc/testsuite/c-c++-common/ubsan/object-size-4.c
--- 8647,8653 ----
  76d40946b1ad5e4265503cdfd4a64388  gcc/testsuite/c-c++-common/ubsan/null-8.c
  effe9084cb4356fb8ac72c7ca46102b0  gcc/testsuite/c-c++-common/ubsan/null-9.c
  e57e483ed447f5dac34abe7e805f8853  gcc/testsuite/c-c++-common/ubsan/object-size-1.c
! 780d9ac0beb072d3908d458ec96fddb5  gcc/testsuite/c-c++-common/ubsan/object-size-10.c
  702485ed4844237ef8004854e7eb54c1  gcc/testsuite/c-c++-common/ubsan/object-size-2.c
  9da79940216d11d0776c0614205c2ffd  gcc/testsuite/c-c++-common/ubsan/object-size-3.c
  585d2490d604dfc496c6a3e2c197c955  gcc/testsuite/c-c++-common/ubsan/object-size-4.c
*************** e57e483ed447f5dac34abe7e805f8853  gcc/te
*** 8635,8641 ****
  dd5de113b9d39840cc410d98a0688b16  gcc/testsuite/c-c++-common/ubsan/object-size-6.c
  96b49a07fd85e59fcedf960d1be8613f  gcc/testsuite/c-c++-common/ubsan/object-size-7.c
  dbd64d943b2a43cb0a2ae830e616a9f1  gcc/testsuite/c-c++-common/ubsan/object-size-8.c
! ef97140b52ae32ddc551379745102a76  gcc/testsuite/c-c++-common/ubsan/object-size-9.c
  0cec8e20d85727de45815056e293d32a  gcc/testsuite/c-c++-common/ubsan/overflow-1.c
  20327c28f0f8a29693dcdbef9d007593  gcc/testsuite/c-c++-common/ubsan/overflow-2.c
  2f624f3189625b04a455b2b21845fd79  gcc/testsuite/c-c++-common/ubsan/overflow-add-1.c
--- 8655,8661 ----
  dd5de113b9d39840cc410d98a0688b16  gcc/testsuite/c-c++-common/ubsan/object-size-6.c
  96b49a07fd85e59fcedf960d1be8613f  gcc/testsuite/c-c++-common/ubsan/object-size-7.c
  dbd64d943b2a43cb0a2ae830e616a9f1  gcc/testsuite/c-c++-common/ubsan/object-size-8.c
! f03206b2f305dec8599da7323774aba8  gcc/testsuite/c-c++-common/ubsan/object-size-9.c
  0cec8e20d85727de45815056e293d32a  gcc/testsuite/c-c++-common/ubsan/overflow-1.c
  20327c28f0f8a29693dcdbef9d007593  gcc/testsuite/c-c++-common/ubsan/overflow-2.c
  2f624f3189625b04a455b2b21845fd79  gcc/testsuite/c-c++-common/ubsan/overflow-add-1.c
*************** e448ddddec48e19348734e1bc0fa2581  gcc/te
*** 8683,8688 ****
--- 8703,8709 ----
  a8aa1b8550acd5ba45ee24145333c990  gcc/testsuite/c-c++-common/ubsan/pr66908.c
  ffc7c68789ff080a9c2dc0100772c9ea  gcc/testsuite/c-c++-common/ubsan/pr67921.c
  9bd2c80828bcc0260a30db4f41b6dd8f  gcc/testsuite/c-c++-common/ubsan/pr68142.c
+ 02f7c7e113837b0933f7c0a1178985ca  gcc/testsuite/c-c++-common/ubsan/pr81604.c
  fad43f861feeb312ec336937b2ad2443  gcc/testsuite/c-c++-common/ubsan/recovery-1.c
  5bb4d0c13ed60e4d8054523bc5e48304  gcc/testsuite/c-c++-common/ubsan/recovery-2.c
  898ddf0e3a5900b4cbaf5c487db29199  gcc/testsuite/c-c++-common/ubsan/recovery-3.c
*************** a762b6bd97faadf1c7c4e9c8168ef73a  gcc/te
*** 8728,8734 ****
  6ecac8feb023aa9a744a4ae8793c2e21  gcc/testsuite/c-c++-common/vector-compare-1.c
  f8659571f3f421873f7c60e1570d92dd  gcc/testsuite/c-c++-common/vector-compare-2.c
  0b88b6a257d580d32e1a5b0e87ac7c64  gcc/testsuite/c-c++-common/vector-compare-3.c
! cc521269ae5296ce5a1f014d7eff58fb  gcc/testsuite/c-c++-common/vector-compare-4.c
  1e47ef8c1dfa5108f30fd869de0fe86c  gcc/testsuite/c-c++-common/vector-init-1.c
  352717900a7e0ec3677f617f1400c58a  gcc/testsuite/c-c++-common/vector-init-2.c
  24c50d3f930b42bd586d90e6dd9c9dac  gcc/testsuite/c-c++-common/vector-scalar-2.c
--- 8749,8755 ----
  6ecac8feb023aa9a744a4ae8793c2e21  gcc/testsuite/c-c++-common/vector-compare-1.c
  f8659571f3f421873f7c60e1570d92dd  gcc/testsuite/c-c++-common/vector-compare-2.c
  0b88b6a257d580d32e1a5b0e87ac7c64  gcc/testsuite/c-c++-common/vector-compare-3.c
! ade6a1419310a6c8a93a2c42d7981a22  gcc/testsuite/c-c++-common/vector-compare-4.c
  1e47ef8c1dfa5108f30fd869de0fe86c  gcc/testsuite/c-c++-common/vector-init-1.c
  352717900a7e0ec3677f617f1400c58a  gcc/testsuite/c-c++-common/vector-init-2.c
  24c50d3f930b42bd586d90e6dd9c9dac  gcc/testsuite/c-c++-common/vector-scalar-2.c
*************** e472f2ce37f2b55b1358ec08717d9f08  gcc/te
*** 8954,8959 ****
--- 8975,8982 ----
  74a04a20e12a8acd0fd7d05742cf8d63  gcc/testsuite/g++.dg/asan/pr62017.C
  505943436d80a41b5e95bf0b67db97cd  gcc/testsuite/g++.dg/asan/pr64937.C
  461bc5f4392764dda9dd67ad1c3ab6a0  gcc/testsuite/g++.dg/asan/pr65004.C
+ 86c19e1b42266f9002fd92e21d16f1d7  gcc/testsuite/g++.dg/asan/pr77396-2.C
+ 68963853257ccf17297ec53bb77fa2bf  gcc/testsuite/g++.dg/asan/pr77396.C
  9c127ef1a489fa3066b519905bbcd4df  gcc/testsuite/g++.dg/asan/sanitizer_pthread_wrappers.h
  ec57ce9e20b59de0ebec29f657a688f0  gcc/testsuite/g++.dg/asan/sanitizer_test_config.h
  55a37a27a50226341bc745f47d1908c5  gcc/testsuite/g++.dg/asan/sanitizer_test_utils.h
*************** e17f4f7218a49c4d8a14211f32d8e747  gcc/te
*** 9256,9261 ****
--- 9279,9285 ----
  74bb2cd707774dcc79b45b939b21d2a8  gcc/testsuite/g++.dg/cpp0x/Wnarrowing3.C
  98f5997ac53fff61b85f99bfe358a506  gcc/testsuite/g++.dg/cpp0x/Wnarrowing4.C
  6ae3451e0c7b222e73c985a0c76a4253  gcc/testsuite/g++.dg/cpp0x/Wunused-parm.C
+ c9c65f2ce729014de1f8d5a02bf08a2a  gcc/testsuite/g++.dg/cpp0x/Wunused-variable-1.C
  948a776d6405969529e65e69911b6f98  gcc/testsuite/g++.dg/cpp0x/Wzero-as-null-pointer-constant-1.C
  1821a76c969bbe9fe98225106370d360  gcc/testsuite/g++.dg/cpp0x/Wzero-as-null-pointer-constant-2.C
  1388db9b52c8fb258faed2c95049bb99  gcc/testsuite/g++.dg/cpp0x/__func__.C
*************** ad96b3db3327ae43c2490e49c0c6271b  gcc/te
*** 9572,9577 ****
--- 9596,9602 ----
  42b085cfa5a3a60f9db66f7cc0e24a06  gcc/testsuite/g++.dg/cpp0x/constexpr-initlist9.C
  683db5db98fc74d6eadc7aa9954bdb28  gcc/testsuite/g++.dg/cpp0x/constexpr-invisiref1.C
  37f592a6d675c9e237fe68fa9fdf71ca  gcc/testsuite/g++.dg/cpp0x/constexpr-is_literal.C
+ 78f36282c1b77dbf3aea60391389914d  gcc/testsuite/g++.dg/cpp0x/constexpr-list1.C
  25358bf087f99e99f8fbfc8bcd9f01be  gcc/testsuite/g++.dg/cpp0x/constexpr-main.C
  f6a2053c56fbea1b283c4494a5d9c1c9  gcc/testsuite/g++.dg/cpp0x/constexpr-memfn1.C
  211c953e7e3e1153239acc0f3fee4960  gcc/testsuite/g++.dg/cpp0x/constexpr-missing.C
*************** f48062e4d0290e1ca4859c283ed90e0f  gcc/te
*** 9967,9972 ****
--- 9992,9998 ----
  21ffb7b66577a1e363c063bd539c7530  gcc/testsuite/g++.dg/cpp0x/gen-attrs-58.C
  8b1eab7dca23abfa68d79475abe6ca6d  gcc/testsuite/g++.dg/cpp0x/gen-attrs-59.C
  d1722efa262e03d4b29a04648feeaa80  gcc/testsuite/g++.dg/cpp0x/gen-attrs-6.C
+ b151953ee723cc3bd3afc60e2ad0e6ad  gcc/testsuite/g++.dg/cpp0x/gen-attrs-62.C
  f55fa66c82d267feca5db82dc835210a  gcc/testsuite/g++.dg/cpp0x/gen-attrs-7.C
  e0b4f953ad274eb8ec84b8e630f87d3a  gcc/testsuite/g++.dg/cpp0x/gen-attrs-8.C
  5dd92815927177080853d47a890f5439  gcc/testsuite/g++.dg/cpp0x/gen-attrs-9.C
*************** ec9b8f74c4220a07771e91a84c8311aa  gcc/te
*** 10011,10016 ****
--- 10037,10044 ----
  2689261b6dbe2bf5875e915ce8a31a53  gcc/testsuite/g++.dg/cpp0x/initlist-array3.C
  6c1907913d332611dd16d03002d759f9  gcc/testsuite/g++.dg/cpp0x/initlist-array4.C
  75dbdd73972da9a369980925ff477d9d  gcc/testsuite/g++.dg/cpp0x/initlist-arrray1.C
+ 56c081b4510fd319fae6d0ce40b10398  gcc/testsuite/g++.dg/cpp0x/initlist-base2.C
+ a62ceba6ce31c192d902228d8b740b06  gcc/testsuite/g++.dg/cpp0x/initlist-base3.C
  994605127bf908d7a5b9745b9991101e  gcc/testsuite/g++.dg/cpp0x/initlist-ctor1.C
  8642aa67406b008384f59447a05a884c  gcc/testsuite/g++.dg/cpp0x/initlist-deduce.C
  164cef62ad37c1cf80ca6128f56094b2  gcc/testsuite/g++.dg/cpp0x/initlist-defarg1.C
*************** e0fcc12ea86ca07e002f0dd4599d71b4  gcc/te
*** 10173,10178 ****
--- 10201,10207 ----
  9edc8f5532794fc604ffd377c6d84b82  gcc/testsuite/g++.dg/cpp0x/lambda/lambda-deduce-neg.C
  09786f33b21f73e03794802f7bd62377  gcc/testsuite/g++.dg/cpp0x/lambda/lambda-deduce.C
  4c785ed910596fbd5f6219990b7e64e7  gcc/testsuite/g++.dg/cpp0x/lambda/lambda-deduce2.C
+ d6d48de10340b22d46f7610d0d311ac9  gcc/testsuite/g++.dg/cpp0x/lambda/lambda-deduce3.C
  ed0e57a851ca002b92664b37ce17502b  gcc/testsuite/g++.dg/cpp0x/lambda/lambda-defarg.C
  be7d5784718fa8841e1936204f404bd8  gcc/testsuite/g++.dg/cpp0x/lambda/lambda-defarg2.C
  665983bbedede39286c33bef3b65d920  gcc/testsuite/g++.dg/cpp0x/lambda/lambda-defarg3.C
*************** ceadcf043cb7e277e03b4160aab8102e  gcc/te
*** 10301,10306 ****
--- 10330,10336 ----
  2fc41c677c8e84c030121c0ae006b699  gcc/testsuite/g++.dg/cpp0x/local-type1.C
  41600003230a22f3cbcc4e6fac3dde3d  gcc/testsuite/g++.dg/cpp0x/long_long.C
  c1feee422fd37f5c7d79276a96c23d07  gcc/testsuite/g++.dg/cpp0x/move1.C
+ 9ae0ac924c5c1dafc246af2360f9164a  gcc/testsuite/g++.dg/cpp0x/mutable1.C
  e2a2d13a6043d589d665cbb45ea56db8  gcc/testsuite/g++.dg/cpp0x/named.C
  5ccbd38ed47b195447b9e41d8df03bb9  gcc/testsuite/g++.dg/cpp0x/named_refs.C
  4c9fa986dc7f6deef6a257359aa5e2ca  gcc/testsuite/g++.dg/cpp0x/new1.C
*************** fd66664e3961b825af4b8173b52086bb  gcc/te
*** 10526,10531 ****
--- 10556,10564 ----
  160058bb6f5ebfd48ad7cd413243f751  gcc/testsuite/g++.dg/cpp0x/pr65558.C
  ddca64f77cad71506384979bf848526b  gcc/testsuite/g++.dg/cpp0x/pr65736.C
  e85408993e6b3f61f5073e187d03547d  gcc/testsuite/g++.dg/cpp0x/pr67767.C
+ e512f6703be7d9559d02caf34601fba6  gcc/testsuite/g++.dg/cpp0x/pr68724.C
+ 785e97f705ee538cb0d469f646b74caa  gcc/testsuite/g++.dg/cpp0x/pr78341.C
+ 7f20ecc1d0425b01c320b4d638d5dc4c  gcc/testsuite/g++.dg/cpp0x/pr78649.C
  53428f69a6d0153074c9b06ee9fbe9e7  gcc/testsuite/g++.dg/cpp0x/ptrmem-cst-arg1.C
  6e8e648c26d9bf237cc152180e88c2c2  gcc/testsuite/g++.dg/cpp0x/range-for1.C
  5c7a98d8ca2f0f427c081bf6902aa831  gcc/testsuite/g++.dg/cpp0x/range-for10.C
*************** aaa90c1c2261698f9319415498163db1  gcc/te
*** 10805,10810 ****
--- 10838,10844 ----
  fb23a824547af5cbc2d6ee6a52d5e3c0  gcc/testsuite/g++.dg/cpp0x/variadic-init.C
  f64443a27f946984ec474714387b99a8  gcc/testsuite/g++.dg/cpp0x/variadic-lambda.C
  6c67e276177a53a05508b5e974504d12  gcc/testsuite/g++.dg/cpp0x/variadic-mem_fn.C
+ 08d2bff6abb7f96f072898cb08f80fbc  gcc/testsuite/g++.dg/cpp0x/variadic-nested1.C
  7d2b8191fa109fd1786f979fbfa18b4e  gcc/testsuite/g++.dg/cpp0x/variadic-new.C
  5ad1db01bdd9d87f2a8276b08cff8db7  gcc/testsuite/g++.dg/cpp0x/variadic-new2.C
  9965da4f62ae847ce666120789b29c79  gcc/testsuite/g++.dg/cpp0x/variadic-nondeduce1.C
*************** d67958b896eb1dae6f8862fd59b01c62  gcc/te
*** 11058,11063 ****
--- 11092,11098 ----
  252d5e23574d814692eda27da0d3490e  gcc/testsuite/g++.dg/cpp1y/auto-mangle1.C
  74303a8348f1ee9cdd9f827d5ae03cee  gcc/testsuite/g++.dg/cpp1y/auto-neg1.C
  f3e3d98fcbe616df26f26eb779c66c1f  gcc/testsuite/g++.dg/cpp1y/complex_literals.h
+ ff3e876f73b9e207bc74cebb8f681b24  gcc/testsuite/g++.dg/cpp1y/constexpr-77467.C
  8ca7fb9e44e526f77542eaa59593c544  gcc/testsuite/g++.dg/cpp1y/constexpr-array1.C
  10c765e5671de39fd3d751b2e3a5408b  gcc/testsuite/g++.dg/cpp1y/constexpr-array2.C
  192478e53d1e7dc7ab67b7b22a9678c1  gcc/testsuite/g++.dg/cpp1y/constexpr-array3.C
*************** ce3d96795da2089956df925a1a9c9815  gcc/te
*** 11070,11075 ****
--- 11105,11111 ----
  e6815ab618d6af99025ddeacf6ab0545  gcc/testsuite/g++.dg/cpp1y/constexpr-copy3.C
  9b6ce1c2202c1ce9ea82fda5f060499b  gcc/testsuite/g++.dg/cpp1y/constexpr-empty1.C
  9e871814c326197a59b4ae1738313788  gcc/testsuite/g++.dg/cpp1y/constexpr-empty2.C
+ d4fc72d059e047077b1d6033d4c13026  gcc/testsuite/g++.dg/cpp1y/constexpr-empty3.C
  f4f6c3d1cdaf2aa67bfa2b8c851853d5  gcc/testsuite/g++.dg/cpp1y/constexpr-incr1.C
  3e9dd485a2a6d99132c92a6d04b96ee9  gcc/testsuite/g++.dg/cpp1y/constexpr-initlist1.C
  14b35cb8a87b121f413f22b600d19592  gcc/testsuite/g++.dg/cpp1y/constexpr-local-compound1.C
*************** f242782c248016f2816bbc2f83f9233a  gcc/te
*** 11088,11093 ****
--- 11124,11130 ----
  f705c3231fd3394bbd8e1f6d3c18f870  gcc/testsuite/g++.dg/cpp1y/constexpr-switch1.C
  469cd1fc4d897d90592a00ce78be9201  gcc/testsuite/g++.dg/cpp1y/constexpr-switch2.C
  c1e1359ff4463d37602a3a97e87c775f  gcc/testsuite/g++.dg/cpp1y/constexpr-switch3.C
+ 2cf598a0cfa5187e173eb042b77aa4a7  gcc/testsuite/g++.dg/cpp1y/constexpr-switch4.C
  0338099a8b7545e92dbe09d98b8c671d  gcc/testsuite/g++.dg/cpp1y/constexpr-type-def-compound1.C
  f869695e4081f7115b13ec5e36fddb37  gcc/testsuite/g++.dg/cpp1y/constexpr-type-def1.C
  d05362a8ea33190463d383e8c676b147  gcc/testsuite/g++.dg/cpp1y/constexpr-void1.C
*************** f8cacc42b6d0ee02c4ec28b4871b946c  gcc/te
*** 11099,11109 ****
  09caaa1deeab3c105c541435337c045c  gcc/testsuite/g++.dg/cpp1y/digit-sep-neg.C
  2ccf049767734b973a90dea30576d8a8  gcc/testsuite/g++.dg/cpp1y/digit-sep.C
  8e9abe7daf174f89220e3b40a7d9e655  gcc/testsuite/g++.dg/cpp1y/feat-cxx11-neg.C
! d96fb9f48518ca695b170a52f17a96df  gcc/testsuite/g++.dg/cpp1y/feat-cxx11.C
! c18d5f73c72222002ced3bd9784cce38  gcc/testsuite/g++.dg/cpp1y/feat-cxx14.C
! 1eed10c6b0ada8d0bf6a7e6bf68aae17  gcc/testsuite/g++.dg/cpp1y/feat-cxx98-neg.C
! d9680a99825535ba499a795339ce02c2  gcc/testsuite/g++.dg/cpp1y/feat-cxx98.C
! 01260d1a223a8398c967796299932d12  gcc/testsuite/g++.dg/cpp1y/feat-neg.C
  018149928d964ce66689bf4960400c07  gcc/testsuite/g++.dg/cpp1y/feat-sized-dealloc-neg.C
  b7edad357bb503949f49802295729019  gcc/testsuite/g++.dg/cpp1y/feat-sized-dealloc.C
  fc5875e8af08d0f9488344e80bf6f764  gcc/testsuite/g++.dg/cpp1y/feat-vla.C
--- 11136,11146 ----
  09caaa1deeab3c105c541435337c045c  gcc/testsuite/g++.dg/cpp1y/digit-sep-neg.C
  2ccf049767734b973a90dea30576d8a8  gcc/testsuite/g++.dg/cpp1y/digit-sep.C
  8e9abe7daf174f89220e3b40a7d9e655  gcc/testsuite/g++.dg/cpp1y/feat-cxx11-neg.C
! b52fc8eef286a926f7ed5743cc352c77  gcc/testsuite/g++.dg/cpp1y/feat-cxx11.C
! 1c9c826854df15ad6e083cdb142cc8ec  gcc/testsuite/g++.dg/cpp1y/feat-cxx14.C
! 920d543a24ce272a29391f1d17e89c7d  gcc/testsuite/g++.dg/cpp1y/feat-cxx98-neg.C
! 6c845bae306091a0871d09eb650f7346  gcc/testsuite/g++.dg/cpp1y/feat-cxx98.C
! 8a8b78afcad658910cf21c4e9f8c087b  gcc/testsuite/g++.dg/cpp1y/feat-neg.C
  018149928d964ce66689bf4960400c07  gcc/testsuite/g++.dg/cpp1y/feat-sized-dealloc-neg.C
  b7edad357bb503949f49802295729019  gcc/testsuite/g++.dg/cpp1y/feat-sized-dealloc.C
  fc5875e8af08d0f9488344e80bf6f764  gcc/testsuite/g++.dg/cpp1y/feat-vla.C
*************** ccdf243ad72b9b0a028429d373468fef  gcc/te
*** 11194,11199 ****
--- 11231,11238 ----
  b82fb5e4a473d7355f2d603a5f9c0809  gcc/testsuite/g++.dg/cpp1y/pr64626-2.C
  70418b269a270e6b88690c1eade8c25b  gcc/testsuite/g++.dg/cpp1y/pr65202.C
  d5c5f62de8cf97d34f282f05a28fd8c3  gcc/testsuite/g++.dg/cpp1y/pr65340.C
+ 3659f5cca5d2a047549f78c4735d3374  gcc/testsuite/g++.dg/cpp1y/pr77739.C
+ 94c88f192b02f065413ec82735d9e520  gcc/testsuite/g++.dg/cpp1y/pr78551.C
  ac3a3cc471361b1fc9f3e55ad12dd7a8  gcc/testsuite/g++.dg/cpp1y/regress1.C
  9a759de4b7ac375d3c274acdf73c4fbe  gcc/testsuite/g++.dg/cpp1y/sized-dealloc1.C
  88b1f9c319ca6b8551218276dff9f0e6  gcc/testsuite/g++.dg/cpp1y/sized-dealloc2.C
*************** ced2cfc9e16cac7b5bf507f1a63b428b  gcc/te
*** 11247,11252 ****
--- 11286,11292 ----
  ffde32febe1810ce3df7e034c7d427c5  gcc/testsuite/g++.dg/cpp1y/var-templ47.C
  34e14d27e3c00f201eeb1fb1d4d286c1  gcc/testsuite/g++.dg/cpp1y/var-templ5.C
  5160d45ceedf6faed4671f12ca9eae37  gcc/testsuite/g++.dg/cpp1y/var-templ50.C
+ 8bf64fa25ea751fc3a077004fefa3e3b  gcc/testsuite/g++.dg/cpp1y/var-templ53.C
  46f96806c3f041172407dd6ff7943dc8  gcc/testsuite/g++.dg/cpp1y/var-templ6.C
  3c670164f1a7f8f91ef1db2f80526182  gcc/testsuite/g++.dg/cpp1y/var-templ7.C
  7490ba7f2bf9511118a48f52e8c4ceed  gcc/testsuite/g++.dg/cpp1y/var-templ8.C
*************** a26a24dcac8fa1d56d36002c9551d274  gcc/te
*** 11313,11319 ****
  09b1f81116f03c2c68f057d9f2799605  gcc/testsuite/g++.dg/debug/dwarf2/global-used-types-1.C
  5f527b1d5db3338320735cddde309293  gcc/testsuite/g++.dg/debug/dwarf2/icf.C
  94ab24c4c92e0025c8c21c00e7088ab9  gcc/testsuite/g++.dg/debug/dwarf2/imported-decl-1.C
! aeaf229ff1bb7dd4ac9bc56468134190  gcc/testsuite/g++.dg/debug/dwarf2/imported-decl-2.C
  cd2f8eb018e0f3274a839788f6516dbd  gcc/testsuite/g++.dg/debug/dwarf2/imported-module-2.C
  00073dddfb84caf2285834b264334fb6  gcc/testsuite/g++.dg/debug/dwarf2/imported-module-3.C
  f328f5fd374ff3e1abef9c5c385bb657  gcc/testsuite/g++.dg/debug/dwarf2/imported-module-4.C
--- 11353,11359 ----
  09b1f81116f03c2c68f057d9f2799605  gcc/testsuite/g++.dg/debug/dwarf2/global-used-types-1.C
  5f527b1d5db3338320735cddde309293  gcc/testsuite/g++.dg/debug/dwarf2/icf.C
  94ab24c4c92e0025c8c21c00e7088ab9  gcc/testsuite/g++.dg/debug/dwarf2/imported-decl-1.C
! 4fb937ceb6d323fef5d0c1b650e50c3d  gcc/testsuite/g++.dg/debug/dwarf2/imported-decl-2.C
  cd2f8eb018e0f3274a839788f6516dbd  gcc/testsuite/g++.dg/debug/dwarf2/imported-module-2.C
  00073dddfb84caf2285834b264334fb6  gcc/testsuite/g++.dg/debug/dwarf2/imported-module-3.C
  f328f5fd374ff3e1abef9c5c385bb657  gcc/testsuite/g++.dg/debug/dwarf2/imported-module-4.C
*************** b3cbbd79d5ff077a6732280d76b2284e  gcc/te
*** 11348,11353 ****
--- 11388,11394 ----
  77d7e1ad341ac6addc71df4dbb8ec2e2  gcc/testsuite/g++.dg/debug/dwarf2/pr52260.C
  ba3a14694481b03351ebef6174059c0f  gcc/testsuite/g++.dg/debug/dwarf2/pr54508.C
  97f5ea2ec0d8ed4da158c8c51e4f395d  gcc/testsuite/g++.dg/debug/dwarf2/pr61433.C
+ 402705af4ba2631ab3fdcbf9221d957e  gcc/testsuite/g++.dg/debug/dwarf2/pr77363.C
  6a221e4796f80705722794e4cb854118  gcc/testsuite/g++.dg/debug/dwarf2/pubnames-1.C
  61c15278662fb88f21f9d3f56b288d93  gcc/testsuite/g++.dg/debug/dwarf2/pubnames-2.C
  1c216c5d6dbf7b013153d4ca504eeebc  gcc/testsuite/g++.dg/debug/dwarf2/pubnames-3.C
*************** ce4ff2095f5aadd1429d75f9964e3068  gcc/te
*** 11702,11707 ****
--- 11743,11749 ----
  05aa93a27032c47400c1728d165f6aeb  gcc/testsuite/g++.dg/ext/altivec-15.C
  1f347fa1c57370132e750e4fb8b77f9d  gcc/testsuite/g++.dg/ext/altivec-16.C
  e7b8730e35adae22637664edfdba084d  gcc/testsuite/g++.dg/ext/altivec-17.C
+ 4c612ecdb73822d456d417a307c5969e  gcc/testsuite/g++.dg/ext/altivec-18.C
  0d2b8f9e1b8506c8de6da887d8b08add  gcc/testsuite/g++.dg/ext/altivec-2.C
  d3261ef497bef041056bc7661e3a3686  gcc/testsuite/g++.dg/ext/altivec-3.C
  4f6acab6c14678a58ab3251c4c5a0ce1  gcc/testsuite/g++.dg/ext/altivec-4.C
*************** f2cf0baaaf489aa15f22210e07d052d1  gcc/te
*** 11980,11985 ****
--- 12022,12028 ----
  61fa88a10a461afa5233ba52ee25455d  gcc/testsuite/g++.dg/ext/int128-2.h
  8313f3d030293501382bb11536a8919a  gcc/testsuite/g++.dg/ext/int128-3.C
  3b33306d69b3ca18d4baf8c0846a03a3  gcc/testsuite/g++.dg/ext/int128-4.C
+ 754d9cd2dfd66632200e26d330e6b4a6  gcc/testsuite/g++.dg/ext/int128-5.C
  3a16bb49d1e751989bc6c5980e68cc41  gcc/testsuite/g++.dg/ext/interface1.C
  a6025f300298ca27e5d4454172592895  gcc/testsuite/g++.dg/ext/interface1.h
  0530572db926ff489aea49718a5eabe8  gcc/testsuite/g++.dg/ext/interface1a.cc
*************** f89de69b7a2471dd13bdfa3f538026f3  gcc/te
*** 12057,12063 ****
  0b7e6be63f874371a065af141e94dc40  gcc/testsuite/g++.dg/ext/mv5.C
  5fa5e6eec310c2baca6e675f51db6f5b  gcc/testsuite/g++.dg/ext/mv6.C
  d7e6a6acfdeef8fa4231626fa3e68f99  gcc/testsuite/g++.dg/ext/mv7.C
! 71756d5a370200272e4677b59eccf9c5  gcc/testsuite/g++.dg/ext/mv8.C
  7610da3ac7479053e5453edaa297546d  gcc/testsuite/g++.dg/ext/mv9.C
  fdf69832bb7a9ef593c8792a2660355e  gcc/testsuite/g++.dg/ext/no-asm-1.C
  74e645db0d8a1393088286f041e696d6  gcc/testsuite/g++.dg/ext/no-asm-2.C
--- 12100,12106 ----
  0b7e6be63f874371a065af141e94dc40  gcc/testsuite/g++.dg/ext/mv5.C
  5fa5e6eec310c2baca6e675f51db6f5b  gcc/testsuite/g++.dg/ext/mv6.C
  d7e6a6acfdeef8fa4231626fa3e68f99  gcc/testsuite/g++.dg/ext/mv7.C
! fde70aca439cf147f99652ebf4e2e324  gcc/testsuite/g++.dg/ext/mv8.C
  7610da3ac7479053e5453edaa297546d  gcc/testsuite/g++.dg/ext/mv9.C
  fdf69832bb7a9ef593c8792a2660355e  gcc/testsuite/g++.dg/ext/no-asm-1.C
  74e645db0d8a1393088286f041e696d6  gcc/testsuite/g++.dg/ext/no-asm-2.C
*************** da9f4d40914a62f10cfc08d681f84fe6  gcc/te
*** 12089,12094 ****
--- 12132,12138 ----
  4775bf0d01f776786eed6bd280ef69e1  gcc/testsuite/g++.dg/ext/pr58834.C
  866a91381ea9110f2679a3242dd39d16  gcc/testsuite/g++.dg/ext/pr59378.C
  8a247c6260aa77bd5f5f10a05e13a5eb  gcc/testsuite/g++.dg/ext/pr59706.C
+ e7effb51effd21039f6a2279ef9eceb0  gcc/testsuite/g++.dg/ext/pr80363.C
  ad117686eb16e680b29f2f5e45ebe0df  gcc/testsuite/g++.dg/ext/pragmaweak1.C
  ae2794e104309a224e228d70e4cede48  gcc/testsuite/g++.dg/ext/pretty1.C
  faa8333681bedde3ba84daa60ec26ff8  gcc/testsuite/g++.dg/ext/pretty2.C
*************** f006e9fbc60cef8755f4653f8255d665  gcc/te
*** 12221,12226 ****
--- 12265,12271 ----
  abdeb34b11f4d994523c72c30c39e053  gcc/testsuite/g++.dg/ext/vector28.C
  06e44a4208434952189cfd9cd55ae2d8  gcc/testsuite/g++.dg/ext/vector3.C
  6ca255361ad69ad75b523ad0b133b0fb  gcc/testsuite/g++.dg/ext/vector30.C
+ c3b38049951f0b2eddec58e423441ed3  gcc/testsuite/g++.dg/ext/vector31.C
  1d6b45dce331a414b31b64c5104ab383  gcc/testsuite/g++.dg/ext/vector4.C
  3231264b4b96091ab8a2351e76707e8d  gcc/testsuite/g++.dg/ext/vector5.C
  9dca9632e59d179ee1b85a181a34cae7  gcc/testsuite/g++.dg/ext/vector6.C
*************** ed8a6c94f1bc2e70a324d73a77190040  gcc/te
*** 12330,12335 ****
--- 12375,12381 ----
  7a1698611acb707485b8f5e55a748337  gcc/testsuite/g++.dg/gcov/gcov-13.C
  be0288522b31602de2c7b3eeb2fb4b18  gcc/testsuite/g++.dg/gcov/gcov-14.C
  56dbe86604b8680b3d2c3f63fd217d0a  gcc/testsuite/g++.dg/gcov/gcov-15.C
+ 1a43a673011a87c94649d32b935958ea  gcc/testsuite/g++.dg/gcov/gcov-16.C
  8a878271fda0c051fbf0d23ab78d7afe  gcc/testsuite/g++.dg/gcov/gcov-2.C
  0e241a16c3faf2f0c387bd2978d2b824  gcc/testsuite/g++.dg/gcov/gcov-3.C
  2c83bff9a3f14aa6fc5d7755bf82c9b6  gcc/testsuite/g++.dg/gcov/gcov-3.h
*************** db5e63430cf735cd3170687490d57932  gcc/te
*** 12498,12503 ****
--- 12544,12553 ----
  69587a534832b53372f1e04087c04986  gcc/testsuite/g++.dg/gomp/pr67514.C
  b5c07fed6b935bad79477d82daaa1e4f  gcc/testsuite/g++.dg/gomp/pr67522.C
  1c935120e3c1e7d165ea068f57519a6e  gcc/testsuite/g++.dg/gomp/pr67523.C
+ 1e46e97dc4fca9257e078353e30f0add  gcc/testsuite/g++.dg/gomp/pr71910.C
+ 726847bc91dc583a144c177ebc3d58d1  gcc/testsuite/g++.dg/gomp/pr79664.C
+ 61f6175348fda4d4917305d233417a28  gcc/testsuite/g++.dg/gomp/pr80141.C
+ 263ba04c887a9adb80a0de472bd2c765  gcc/testsuite/g++.dg/gomp/pr81154.C
  d2c2484d4d1236326efc32a01fddaa03  gcc/testsuite/g++.dg/gomp/predetermined-1.C
  edac71d2b358ecd6e646fece69c5426d  gcc/testsuite/g++.dg/gomp/private-1.C
  536359d59fc418a1570a6d8574a66ca1  gcc/testsuite/g++.dg/gomp/sections-1.C
*************** fb8a48266ab2a995a88943828c7a824f  gcc/te
*** 12772,12777 ****
--- 12822,12828 ----
  e657849b9797c7df684fd4fafe1341d1  gcc/testsuite/g++.dg/init/elide2.C
  6cdb74bfb12dbada158562b31f755075  gcc/testsuite/g++.dg/init/elide3.C
  074911fc1326d50c75879cb3d5b7a7c7  gcc/testsuite/g++.dg/init/elide4.C
+ c3504b39a6dc15f7e9a22986743ea38c  gcc/testsuite/g++.dg/init/elide5.C
  d2ea13322f402d3ce506a9a1106ee836  gcc/testsuite/g++.dg/init/empty1.C
  0fab5264214dd4964a69af401f3e7e7c  gcc/testsuite/g++.dg/init/enum1.C
  ca9a6dc8d27f3cf82314cfcd92133441  gcc/testsuite/g++.dg/init/enum2.C
*************** f660de16a9cf160558064bb92eb21901  gcc/te
*** 12866,12871 ****
--- 12917,12923 ----
  c835d50eaf5fe1a2b052a1579b5ce77f  gcc/testsuite/g++.dg/init/pr58811.C
  f25ce72283c3004e08c0df4685ca2469  gcc/testsuite/g++.dg/init/pr60572.C
  a5a0c6bb188e4c01d4db2d84a5014752  gcc/testsuite/g++.dg/init/pr66857.C
+ effadbfc637d03ffccebf5ad6b37c6c0  gcc/testsuite/g++.dg/init/pr71516.C
  697d82f637fb8839d98efadd58ededf5  gcc/testsuite/g++.dg/init/ptrfn1.C
  c3eaccdcf8e35f944dee4d4b3d720336  gcc/testsuite/g++.dg/init/ptrfn2.C
  111716aa5bd4c456321772f776bd97d1  gcc/testsuite/g++.dg/init/ptrfn3.C
*************** f44963a0cd9c1736b28dd8d5a81a4a94  gcc/te
*** 12887,12892 ****
--- 12939,12945 ----
  753ffddceb5ce125cebb945a65a73cdf  gcc/testsuite/g++.dg/init/ref2.C
  559e18af649d0930e65e2663f043609b  gcc/testsuite/g++.dg/init/ref20.C
  9a5faac941462bf7541a81ebb5668997  gcc/testsuite/g++.dg/init/ref21.C
+ ef89ae0c3b4a590a94233819b506141f  gcc/testsuite/g++.dg/init/ref23.C
  e21984c05c21d067e3b20b37c68bec76  gcc/testsuite/g++.dg/init/ref3.C
  f21f65304dbc9a97b63efafb7bb1a6df  gcc/testsuite/g++.dg/init/ref4.C
  e7fdc3fa73fd7411222a32862636796b  gcc/testsuite/g++.dg/init/ref5.C
*************** ec5260e7b67781daba88554aafd3131a  gcc/te
*** 13092,13097 ****
--- 13145,13156 ----
  a2e5380c8516c008132d478e44ece9b7  gcc/testsuite/g++.dg/ipa/pr68672-3.C
  c021f783947adb9a54cc7d7fd34e136d  gcc/testsuite/g++.dg/ipa/pr68851.C
  a00d85b4d37eb396d6f750fbe8c65031  gcc/testsuite/g++.dg/ipa/pr69239.C
+ cad676606f867ff6d3c0c30870ad11a0  gcc/testsuite/g++.dg/ipa/pr71207.C
+ 3a8004c0e4c3f3ec713f3674c6464c08  gcc/testsuite/g++.dg/ipa/pr77333.C
+ d53e2610da5ee135ff2297e91a0715be  gcc/testsuite/g++.dg/ipa/pr77905.C
+ 0d66afc3b6be386c8e29a4e0bbb7485d  gcc/testsuite/g++.dg/ipa/pr78188.C
+ c5be5b54243f6264bf84d49d4a16947c  gcc/testsuite/g++.dg/ipa/pr79931.C
+ 89f95e75e402e5135147f26252be06e5  gcc/testsuite/g++.dg/ipa/pr80205.C
  65b30ac9d2b3a2244e49849aaad7dd78  gcc/testsuite/g++.dg/ipa/remref-1.C
  d26e3f0899c708e0f4b2ec8427502236  gcc/testsuite/g++.dg/ipa/remref-2.C
  8a469d09a1c8b835acf9b3b8f7d8078d  gcc/testsuite/g++.dg/ipa/type-inheritance-1.C
*************** f527f51fa4c8b92a4d9374e96752d73a  gcc/te
*** 13635,13640 ****
--- 13694,13700 ----
  4ed264b192fadaa6f3076ca27b4fc086  gcc/testsuite/g++.dg/opt/nrv15.C
  e94377182a1dedb230f53db874897364  gcc/testsuite/g++.dg/opt/nrv16.C
  3bf30be38f5aa46b2a1c3f22d55000d4  gcc/testsuite/g++.dg/opt/nrv17.C
+ 3a570f71e0d06b55d991f8cab4b017d2  gcc/testsuite/g++.dg/opt/nrv18.C
  360692bdb55de35cb68717ceb6c51fd7  gcc/testsuite/g++.dg/opt/nrv2.C
  42adcc800d5d2029a2b831e1453e8f32  gcc/testsuite/g++.dg/opt/nrv3.C
  b2773b15109a2fc43572a97edf29b236  gcc/testsuite/g++.dg/opt/nrv4.C
*************** e708379bf11fe954ea2bc5e1022d2001  gcc/te
*** 13776,13782 ****
--- 13836,13846 ----
  ac2356162f00cd5e8804482480f1795a  gcc/testsuite/g++.dg/opt/pr6713.C
  ddd0cdc94ae2b3fb5f1da01082f09677  gcc/testsuite/g++.dg/opt/pr68157.C
  e29a55caf33aeb69133015d020a5b160  gcc/testsuite/g++.dg/opt/pr69432.C
+ 4c279781e65c3062bc3ebe4f9a883ad8  gcc/testsuite/g++.dg/opt/pr70641.C
+ a380c45913d5ec3d5feed82fd2ba5c78  gcc/testsuite/g++.dg/opt/pr71528.C
  90bdbfd9313461944756a9e9f01ce788  gcc/testsuite/g++.dg/opt/pr7503-1.C
+ 23fbbe3312a22eb4c300b6e8552085cc  gcc/testsuite/g++.dg/opt/pr79396.C
+ 3793c7fdebffcc14d6e627f6ab5cdb04  gcc/testsuite/g++.dg/opt/pr80385.C
  1451eba24eea82cbd0c1ab87885c0f77  gcc/testsuite/g++.dg/opt/preinc1.C
  0841088f825be785d32663d712ecf675  gcc/testsuite/g++.dg/opt/ptrintsum1.C
  8ceccf2f02b3f64f372600e32148e146  gcc/testsuite/g++.dg/opt/ptrmem1.C
*************** c1daf3585c63314a131cec4afb411556  gcc/te
*** 13848,13854 ****
  25bec11b40119085408d52eaa5b86f6e  gcc/testsuite/g++.dg/other/anon2.C
  8cf9ebc3f83dbe1add9e2345ef4acb59  gcc/testsuite/g++.dg/other/anon3.C
  735bc52cab8eca56a711c2c10845c981  gcc/testsuite/g++.dg/other/anon4.C
! 200c6c777ac3583fd62d1de16dc4abb5  gcc/testsuite/g++.dg/other/anon5.C
  1c68df289b2577a8e2753eaf82704fed  gcc/testsuite/g++.dg/other/anon6.C
  6bdea0a90642ef923b08522ad0f6f67b  gcc/testsuite/g++.dg/other/anon7.C
  f282d7d63120a2f2e0ee707e7dd2fe1e  gcc/testsuite/g++.dg/other/anon8.C
--- 13912,13918 ----
  25bec11b40119085408d52eaa5b86f6e  gcc/testsuite/g++.dg/other/anon2.C
  8cf9ebc3f83dbe1add9e2345ef4acb59  gcc/testsuite/g++.dg/other/anon3.C
  735bc52cab8eca56a711c2c10845c981  gcc/testsuite/g++.dg/other/anon4.C
! 6d368030a15296375251b49a071901f4  gcc/testsuite/g++.dg/other/anon5.C
  1c68df289b2577a8e2753eaf82704fed  gcc/testsuite/g++.dg/other/anon6.C
  6bdea0a90642ef923b08522ad0f6f67b  gcc/testsuite/g++.dg/other/anon7.C
  f282d7d63120a2f2e0ee707e7dd2fe1e  gcc/testsuite/g++.dg/other/anon8.C
*************** bc5371eb8e8dcf79efb0889828991560  gcc/te
*** 13978,13985 ****
  88d3ce293bea84b74d7f26a42a8538fb  gcc/testsuite/g++.dg/other/gc4.C
  47195a1b7ad4c24c5ccc7cbf50e26bb0  gcc/testsuite/g++.dg/other/gc5.C
  3ca5017faf45f39326ff4e30a1ec1ba8  gcc/testsuite/g++.dg/other/i386-1.C
! 0a55dab063303f02a6851fd26153ba80  gcc/testsuite/g++.dg/other/i386-2.C
! 5ba310fbb0947dcf973b988c09e27e00  gcc/testsuite/g++.dg/other/i386-3.C
  a4ad4c2cb3c1448496351241a77aedb7  gcc/testsuite/g++.dg/other/i386-4.C
  a32a5af1b4c57aabcbdaa817835a698d  gcc/testsuite/g++.dg/other/i386-7.C
  6185c7fefa3b45be6654d24324c94f7d  gcc/testsuite/g++.dg/other/i386-8.C
--- 14042,14050 ----
  88d3ce293bea84b74d7f26a42a8538fb  gcc/testsuite/g++.dg/other/gc4.C
  47195a1b7ad4c24c5ccc7cbf50e26bb0  gcc/testsuite/g++.dg/other/gc5.C
  3ca5017faf45f39326ff4e30a1ec1ba8  gcc/testsuite/g++.dg/other/i386-1.C
! 8925c3efd781e76570846cfd6f817fd2  gcc/testsuite/g++.dg/other/i386-11.C
! 88ad49902c671e4fc483d6531c8d4fae  gcc/testsuite/g++.dg/other/i386-2.C
! 6184cce0e40d3c04921628aee3cf9d15  gcc/testsuite/g++.dg/other/i386-3.C
  a4ad4c2cb3c1448496351241a77aedb7  gcc/testsuite/g++.dg/other/i386-4.C
  a32a5af1b4c57aabcbdaa817835a698d  gcc/testsuite/g++.dg/other/i386-7.C
  6185c7fefa3b45be6654d24324c94f7d  gcc/testsuite/g++.dg/other/i386-8.C
*************** d2e5ab6ef2b2e82037e93dcbedcca8bc  gcc/te
*** 14584,14589 ****
--- 14649,14655 ----
  b89fc0d62ee0e3196c61129ecd005612  gcc/testsuite/g++.dg/parse/pr58898.C
  e15eb2cabfff226dbddb78a9de3a8892  gcc/testsuite/g++.dg/parse/pr61804.C
  1e79347577849ae03e3a20e2fc6247ff  gcc/testsuite/g++.dg/parse/pr70635.C
+ 5eb3f5d17e121a7a8f7884b589a7a7ce  gcc/testsuite/g++.dg/parse/pr71909.C
  5a9d33aff7826f90760a0154af35d9f0  gcc/testsuite/g++.dg/parse/pragma1.C
  b8553036b01aadac9e932e75221336ae  gcc/testsuite/g++.dg/parse/pragma2.C
  d516a5d017b9be02cd665abb61b0fbaf  gcc/testsuite/g++.dg/parse/pragma3.C
*************** c014278b0e7c6cf72bd8834b1b9d6631  gcc/te
*** 14808,14813 ****
--- 14874,14883 ----
  0316a6aee06db21c7aa95471b572af5c  gcc/testsuite/g++.dg/pr67989.C
  daea4abf04b6790441bb5b87a622a604  gcc/testsuite/g++.dg/pr68449.C
  514f19a372e6da2045ad3ac8a01eff0a  gcc/testsuite/g++.dg/pr70098.C
+ dd5b895f9e8e377b3fc861eecf9bdbf7  gcc/testsuite/g++.dg/pr71389.C
+ ea5dbf59cf2609041141d1523d1f4409  gcc/testsuite/g++.dg/pr77812.C
+ f66afb99493b92c63a8b1e5a2bd2ca5c  gcc/testsuite/g++.dg/pr79761.C
+ bfc1d08789ff600f77190c59b402a8ec  gcc/testsuite/g++.dg/pr79769.C
  ae8863cdd596655bd9501c7a7e546fc7  gcc/testsuite/g++.dg/predict-loop-exit-1.C
  112161f9cc2e99ed1a64b608b234d230  gcc/testsuite/g++.dg/predict-loop-exit-2.C
  9fdf45388f73e8c9a46342cf4ec52cb6  gcc/testsuite/g++.dg/predict-loop-exit-3.C
*************** af2fdbfedc537d2eafde78a5b6afc170  gcc/te
*** 15405,15410 ****
--- 15475,15481 ----
  9783cba5cd0e48e50ecc5c42ed1dd282  gcc/testsuite/g++.dg/template/init-list.C
  f30fe425de51d4cb2ab5ff05b71d616a  gcc/testsuite/g++.dg/template/init1.C
  7c6a96d0550437ed561f8825ad2bc25e  gcc/testsuite/g++.dg/template/init10.C
+ ac6c40bfa874333f4cc3f13523df5556  gcc/testsuite/g++.dg/template/init11.C
  76f88c13708d18ca711ab8287d1caac9  gcc/testsuite/g++.dg/template/init2.C
  64314d0aa5b3600547adc69b42ab8e3c  gcc/testsuite/g++.dg/template/init3.C
  e920cba477d63f2866ea0710ce55a2ce  gcc/testsuite/g++.dg/template/init4.C
*************** f4bf79515fd3464e428da5958531f5d6  gcc/te
*** 16054,16059 ****
--- 16125,16132 ----
  11481d47864021d1e3af511c6b632c29  gcc/testsuite/g++.dg/tls/diag-5.C
  e425d7fc584cf8535f3eee565f58f091  gcc/testsuite/g++.dg/tls/init-1.C
  ec6c7e65d57e2a70cb1a6852131a0f16  gcc/testsuite/g++.dg/tls/init-2.C
+ d91e55faf19d18899361ba64d14aa68f  gcc/testsuite/g++.dg/tls/pr77285-1.C
+ e0fc234d5008e949006f7c1d2462ab2d  gcc/testsuite/g++.dg/tls/pr77285-2.C
  a9720fe58f11ddd0e2a21ab5df5a77bf  gcc/testsuite/g++.dg/tls/static-1.C
  29ba155db4cb83d5330b9a806c2cd296  gcc/testsuite/g++.dg/tls/static-1a.cc
  40f776e4d949ac2761cee0de2064d991  gcc/testsuite/g++.dg/tls/static2.C
*************** e204cc8a88c59f1e5cbc72ccfd8cb390  gcc/te
*** 16134,16139 ****
--- 16207,16213 ----
  9e8bbd658850a80ba74ec4326abdd8a4  gcc/testsuite/g++.dg/tm/pr58635-1.C
  2023e08d493ba5b9b6b027ead9dbcdfb  gcc/testsuite/g++.dg/tm/pr58635-2.C
  c9e5bbfe98ec7fbaa16a15a1f925bb18  gcc/testsuite/g++.dg/tm/pr60004.C
+ f20200faa0befb0bfc51cc6eb591119c  gcc/testsuite/g++.dg/tm/pr71909.C
  d1d8828bb1842a1f639c2d50c70a554a  gcc/testsuite/g++.dg/tm/template-1.C
  20616904918cb66e65ad72fb06c6dedc  gcc/testsuite/g++.dg/tm/template-2.C
  4a43b7b85ee426b2cb3825bb45d844ab  gcc/testsuite/g++.dg/tm/tm.exp
*************** e06907cfe2759b33272f3b47a2cad143  gcc/te
*** 16441,16446 ****
--- 16515,16532 ----
  346f676cb6eadd42bf541771cf8eea46  gcc/testsuite/g++.dg/torture/pr68184.C
  31f966a522da78b2232ef319262f8c1e  gcc/testsuite/g++.dg/torture/pr68220.C
  742e71bf561b5af56ed84fc963a0fe07  gcc/testsuite/g++.dg/torture/pr70526.C
+ 411a467861248626a89023d9cd86be57  gcc/testsuite/g++.dg/torture/pr71452.C
+ 6d87997ae70f613b7ae47faba21523d9  gcc/testsuite/g++.dg/torture/pr71874.C
+ 3b4e8c3ab4ddf55d1bcd36173f1a5f02  gcc/testsuite/g++.dg/torture/pr77745.C
+ ea126398515e20d945d8e298598ba010  gcc/testsuite/g++.dg/torture/pr77919-2.C
+ 8fcdf2e7c90f945065444414bbe585b8  gcc/testsuite/g++.dg/torture/pr77919.C
+ fff85caa269f4d672ff9fa1e8ed455a5  gcc/testsuite/g++.dg/torture/pr78224.C
+ e7b6b1b081a787e4e53586f0eb586432  gcc/testsuite/g++.dg/torture/pr79034.C
+ 7ca5ee7afef7aee7488a8e0511740522  gcc/testsuite/g++.dg/torture/pr80129.C
+ 8e8f6b256dc319894874859cc9e0e585  gcc/testsuite/g++.dg/torture/pr80171.C
+ fd760347ef5485cc63415d3c201a40fe  gcc/testsuite/g++.dg/torture/pr80334.C
+ 153bbff97336be3231696c3c16a64e29  gcc/testsuite/g++.dg/torture/pr81354.C
+ 22414dc3cabbf804f8f8f89b0d5c45b5  gcc/testsuite/g++.dg/torture/pr81987.C
  389892c1f2e87d69449479d1b053c70c  gcc/testsuite/g++.dg/torture/predcom-1.C
  d28910105d9c9253d94d70eacd5e19d4  gcc/testsuite/g++.dg/torture/pushpop_macro.C
  a1b47b9c3e69d79d1895ebc4fd11032b  gcc/testsuite/g++.dg/torture/stackalign/check.h
*************** bb17cbedcbb5bcabb9ee8299f30c3ae9  gcc/te
*** 16647,16652 ****
--- 16733,16739 ----
  22dc7006f5ec66c9a231712242810915  gcc/testsuite/g++.dg/tree-ssa/pr61009.C
  e17706fcf799b90e57875597cca38f82  gcc/testsuite/g++.dg/tree-ssa/pr61034.C
  3ab3bdd688450569b259541fd67518e3  gcc/testsuite/g++.dg/tree-ssa/pr63841.C
+ 815c193d3fa9c0ad974dcb886f636cf1  gcc/testsuite/g++.dg/tree-ssa/pr77943.C
  49b07e11de6d1cb74cb9d8c20b9da27e  gcc/testsuite/g++.dg/tree-ssa/pr8781.C
  1774a3db4e8c1c639d06cfd8ba95990d  gcc/testsuite/g++.dg/tree-ssa/ptrmemfield.C
  fe0c4f92b4591334dd40df6bbeb06f32  gcc/testsuite/g++.dg/tree-ssa/restrict1.C
*************** ce9a3608f9ea7f32723d27471f56a902  gcc/te
*** 16711,16716 ****
--- 16798,16806 ----
  23b03c04f7b3df05a2e3c261dbfbc91d  gcc/testsuite/g++.dg/ubsan/return-1.C
  c729687b59770dc8f9e0991370cb1879  gcc/testsuite/g++.dg/ubsan/return-2.C
  40257a16173db28137a5538f88bfea0e  gcc/testsuite/g++.dg/ubsan/return-3.C
+ 496806c2186ed7c6789ad05301dec8f8  gcc/testsuite/g++.dg/ubsan/return-4.C
+ 97027d455c8b2512011502382e6c1745  gcc/testsuite/g++.dg/ubsan/return-5.C
+ ce973542ab3756eba13870ee1f67fdef  gcc/testsuite/g++.dg/ubsan/return-6.C
  c442c055f190ccdaf3b2321ecbc1d910  gcc/testsuite/g++.dg/ubsan/shift-1.C
  a512113af0ac3172f2466ee3a8c93259  gcc/testsuite/g++.dg/ubsan/static-init-1.C
  b1a38b150fef25f02239b481561ad148  gcc/testsuite/g++.dg/ubsan/static-init-2.C
*************** dd4588dbed2d0bda4190508e80775873  gcc/te
*** 16753,16759 ****
  19fbd3a5209805faae720e4cc71893f5  gcc/testsuite/g++.dg/vect/pr33835.cc
  53f16b6b18970118d62936a60300f487  gcc/testsuite/g++.dg/vect/pr33860.cc
  3ade1d2e4dad5a418f0786af8875a9a4  gcc/testsuite/g++.dg/vect/pr33860a.cc
! 8b73ed567529286487cab6a112ce46e8  gcc/testsuite/g++.dg/vect/pr36648.cc
  bb02984184613c4e23cd3b598fd11bf4  gcc/testsuite/g++.dg/vect/pr37143.C
  2dff334c9a92b9aeb51b6a2dec8696ab  gcc/testsuite/g++.dg/vect/pr37174.cc
  9f2e7f6f898f51a14fd95fcb8729c8d4  gcc/testsuite/g++.dg/vect/pr43771.cc
--- 16843,16849 ----
  19fbd3a5209805faae720e4cc71893f5  gcc/testsuite/g++.dg/vect/pr33835.cc
  53f16b6b18970118d62936a60300f487  gcc/testsuite/g++.dg/vect/pr33860.cc
  3ade1d2e4dad5a418f0786af8875a9a4  gcc/testsuite/g++.dg/vect/pr33860a.cc
! 35dce0b7872b86e27b61b85bd81ed8b5  gcc/testsuite/g++.dg/vect/pr36648.cc
  bb02984184613c4e23cd3b598fd11bf4  gcc/testsuite/g++.dg/vect/pr37143.C
  2dff334c9a92b9aeb51b6a2dec8696ab  gcc/testsuite/g++.dg/vect/pr37174.cc
  9f2e7f6f898f51a14fd95fcb8729c8d4  gcc/testsuite/g++.dg/vect/pr43771.cc
*************** add1cfbf96f3e44641caf48f126f9c38  gcc/te
*** 16771,16776 ****
--- 16861,16867 ----
  6b28f1389244b3e3813a64c756bf8ba0  gcc/testsuite/g++.dg/vect/pr60896.cc
  7dc8c4636864580a356ae6253d11960b  gcc/testsuite/g++.dg/vect/pr64410.cc
  60c78be6738c5a1041dce7fc1657bcf0  gcc/testsuite/g++.dg/vect/simd-clone-1.cc
+ 781254f2b1a514c9ba0f4e29b2e8d1a3  gcc/testsuite/g++.dg/vect/simd-clone-7.cc
  f8d0a0b7b0199b08536cbcc9a2d2cf3e  gcc/testsuite/g++.dg/vect/slp-pr50413.cc
  a21f3b56b920c71151d9d6b62dea494f  gcc/testsuite/g++.dg/vect/slp-pr50819.cc
  a8d10fc816e215c5b11e789e5999bc39  gcc/testsuite/g++.dg/vect/slp-pr56812.cc
*************** e7274165f26fc70eff73fddbd77e3811  gcc/te
*** 17011,17016 ****
--- 17102,17108 ----
  0c5df293cc7c104d4640b26ebae4ed15  gcc/testsuite/g++.dg/warn/Wunused-var-21.C
  5d6aae3538559dce1f197ff269ee52f8  gcc/testsuite/g++.dg/warn/Wunused-var-22.C
  2a0d783bf451e934bdfdc826cdaf5930  gcc/testsuite/g++.dg/warn/Wunused-var-23.C
+ 715f4e85764653a44e74c60a6624ff13  gcc/testsuite/g++.dg/warn/Wunused-var-26.C
  dd0f2a1889a83658587b5f12c08c0c1c  gcc/testsuite/g++.dg/warn/Wunused-var-3.C
  62e5565091b4ee3f018515196f818bf3  gcc/testsuite/g++.dg/warn/Wunused-var-4.C
  d9191ea69f8ac18b1043d3d093b1f0d4  gcc/testsuite/g++.dg/warn/Wunused-var-5.C
*************** eaf8056eb8e9f2c09750d1950b336f96  gcc/te
*** 21624,21629 ****
--- 21716,21722 ----
  36b076ea7c9ca905653c3d3f7b5043c1  gcc/testsuite/gcc.c-torture/compile/pr37418-3.c
  642b163a8696cf184f1ebd495e0b3b4f  gcc/testsuite/gcc.c-torture/compile/pr37418-4.c
  f3c01c8a2795d9e97e58a46eff2aa182  gcc/testsuite/gcc.c-torture/compile/pr37432.c
+ d65fea3f66310e27a09a0c3bb6db7914  gcc/testsuite/gcc.c-torture/compile/pr37433-1.c
  37691d89afee16b2664e6f7d5407b7bc  gcc/testsuite/gcc.c-torture/compile/pr37433.c
  552e92307cc2eaed3fe9af2587149864  gcc/testsuite/gcc.c-torture/compile/pr37483.c
  a6b7f09c9007aef1df668f8b216aff24  gcc/testsuite/gcc.c-torture/compile/pr37617.c
*************** d640ae90bbde8cc412262d4b7f5b33c2  gcc/te
*** 21972,21977 ****
--- 22065,22076 ----
  0cef5221b3768444f893ae318f49f1c7  gcc/testsuite/gcc.c-torture/compile/pr67506.c
  df19660e1610b52f0b165eb9d4d3e52b  gcc/testsuite/gcc.c-torture/compile/pr69102.c
  aac9fa1e0a8f32d26d0b91a6ce4f86c0  gcc/testsuite/gcc.c-torture/compile/pr69214.c
+ 86500b6aaf9f75325f0cad332855ed1b  gcc/testsuite/gcc.c-torture/compile/pr70633.c
+ 97df20a3b66d4cb718ca2f94a7c64ec5  gcc/testsuite/gcc.c-torture/compile/pr71693.c
+ 4bdafe7a5c32e03db39dc28806b6e3a0  gcc/testsuite/gcc.c-torture/compile/pr79197.c
+ 8d2b886d2a6084528abb808154bd0d6b  gcc/testsuite/gcc.c-torture/compile/pr79411.c
+ 9c43ac49378a3098c7640140b957175d  gcc/testsuite/gcc.c-torture/compile/pr80345.c
+ 196daa7de18c0a8ecd7788d3e482cc7b  gcc/testsuite/gcc.c-torture/compile/pr82337.c
  9611ffa8936d9c80d0a9ccde8dd093b2  gcc/testsuite/gcc.c-torture/compile/pret-arg.c
  b9e6ce52b90320c1c3803c25113844c5  gcc/testsuite/gcc.c-torture/compile/pta-1.c
  ed716c1d1727fc2c748162e0cbc4ee47  gcc/testsuite/gcc.c-torture/compile/ptr-conv-1.c
*************** ea5cc37862d9328e904262478ea2dfb1  gcc/te
*** 22828,22833 ****
--- 22927,22933 ----
  1f049cb48a0c18f9ccacbb678bd1772c  gcc/testsuite/gcc.c-torture/execute/991221-1.c
  ee18345ed511ceff311552d973c6426f  gcc/testsuite/gcc.c-torture/execute/991227-1.c
  220ea595eb4fba31918096db7ae47ada  gcc/testsuite/gcc.c-torture/execute/991228-1.c
+ 50b7b403a3dd7a84e4b0576329f37247  gcc/testsuite/gcc.c-torture/execute/alias-1.c
  fc721cce5be8ce64fe33e6dc0642bb99  gcc/testsuite/gcc.c-torture/execute/align-1.c
  7ca7bc1736d76c2e0dfe538487304db7  gcc/testsuite/gcc.c-torture/execute/align-2.c
  093b1730a1dfc73a609c5e5c6c14390c  gcc/testsuite/gcc.c-torture/execute/align-3.c
*************** b2ab2df25ae61fdb2695a27e3847bca4  gcc/te
*** 23138,23143 ****
--- 23238,23245 ----
  4e1de3c87ba597088523b25a7f2b504e  gcc/testsuite/gcc.c-torture/execute/ieee/pr38016.c
  b78c79b50407f5479e1a352d840b0d41  gcc/testsuite/gcc.c-torture/execute/ieee/pr38016.x
  519a3cdfc7a62c1a0c081c97039159d2  gcc/testsuite/gcc.c-torture/execute/ieee/pr50310.c
+ 6b57d671d14f682212679d0df178da53  gcc/testsuite/gcc.c-torture/execute/ieee/pr72824-2.c
+ 69fc297e7bf7f2a44efa07b90f5297e3  gcc/testsuite/gcc.c-torture/execute/ieee/pr72824.c
  de8e51d9a0744b986e2e1c4d205cb1f4  gcc/testsuite/gcc.c-torture/execute/ieee/rbug.c
  7116b2d7f2d33fbc73903c620f3bca16  gcc/testsuite/gcc.c-torture/execute/ieee/rbug.x
  205da00dccd6dcf1575a79b20ce968a4  gcc/testsuite/gcc.c-torture/execute/ieee/unsafe-fp-assoc-1.c
*************** f20b6c8891260e3275a695dd6aeeafa1  gcc/te
*** 23575,23580 ****
--- 23677,23683 ----
  4c0a9e8628c0e6b0b75abe913a7eccfc  gcc/testsuite/gcc.c-torture/execute/pr68328.c
  136f5d965d2da4274b6751d6d1ca11ad  gcc/testsuite/gcc.c-torture/execute/pr68376-1.c
  51c67c4e32c12018d279ef080e5d4512  gcc/testsuite/gcc.c-torture/execute/pr68376-2.c
+ 4b3b34c6bbca5e781620455ecb27ef4a  gcc/testsuite/gcc.c-torture/execute/pr68390.c
  b8674eea2d87def45b3a61c798e11712  gcc/testsuite/gcc.c-torture/execute/pr68648.c
  014d15d1eb4dd2bf07bd8b57292416e0  gcc/testsuite/gcc.c-torture/execute/pr69403.c
  7930093b82c953726ca1ad7cfca1228f  gcc/testsuite/gcc.c-torture/execute/pr69447.c
*************** b8674eea2d87def45b3a61c798e11712  gcc/te
*** 23583,23589 ****
--- 23686,23706 ----
  d980d67f1eb958e90351c3eb7cfd1297  gcc/testsuite/gcc.c-torture/execute/pr70429.c
  60303592b1e72b08743fe18c5007dd64  gcc/testsuite/gcc.c-torture/execute/pr70460.c
  58bb262f9c1fe471c7bd11fc8440aac8  gcc/testsuite/gcc.c-torture/execute/pr70566.c
+ 3ae49b918c185acaecb28ec8cd05fdb1  gcc/testsuite/gcc.c-torture/execute/pr71083.c
+ 0a9fc76972569359d91049d017cdf51e  gcc/testsuite/gcc.c-torture/execute/pr71494.c
+ 94c81d0c20f6b48a221fefb5a7c9f0f7  gcc/testsuite/gcc.c-torture/execute/pr71554.c
+ 1f4a197e0d6f4357f1917d680858eacb  gcc/testsuite/gcc.c-torture/execute/pr71626-1.c
+ 2b843741017aa652b5af0855cf7945c3  gcc/testsuite/gcc.c-torture/execute/pr71626-2.c
+ 5226a45800ff3eb3550e4309d902aa9c  gcc/testsuite/gcc.c-torture/execute/pr71700.c
  3a2dbae8c6dae23b46868ca068ba47d6  gcc/testsuite/gcc.c-torture/execute/pr7284-1.c
+ 9bca5db87705467ddabeaa32b5223dba  gcc/testsuite/gcc.c-torture/execute/pr77767.c
+ 21b89420d9abfafd5252eafe2c1f8483  gcc/testsuite/gcc.c-torture/execute/pr78378.c
+ e378b6043986bf34c640d3c898b04895  gcc/testsuite/gcc.c-torture/execute/pr78617.c
+ 50dd995fe049f6e3600af9d40a5053f7  gcc/testsuite/gcc.c-torture/execute/pr79043.c
+ 0ec1bcb863c85b3589a1923d51468ba2  gcc/testsuite/gcc.c-torture/execute/pr80692.c
+ 5275aec3ca25a210e00c7aadb2e366c4  gcc/testsuite/gcc.c-torture/execute/pr81503.c
+ 60fc747dbd1d50baf95c6269175ad273  gcc/testsuite/gcc.c-torture/execute/pr81555.c
+ a3668023bbf40452e1d0a33bfb6710f1  gcc/testsuite/gcc.c-torture/execute/pr81556.c
  f4610e3bba97324f7005c428fe41e597  gcc/testsuite/gcc.c-torture/execute/printf-1.c
  75ef5098d0758219fe59601f8545c342  gcc/testsuite/gcc.c-torture/execute/printf-chk-1.c
  f397d221ccf3a7ce631cf42078dfadb5  gcc/testsuite/gcc.c-torture/execute/pta-field-1.c
*************** f30bf0095addeef700a83f36c598deab  gcc/te
*** 23680,23686 ****
  540bc182381f68374a6cb9c7f45dd001  gcc/testsuite/gcc.c-torture/execute/zerolen-1.c
  47b383f4da2b2ea2ce19f91de8dcf5a2  gcc/testsuite/gcc.c-torture/execute/zerolen-2.c
  44c6ad090d3f06206aa54f59582ae32c  gcc/testsuite/gcc.c-torture/unsorted/dump-noaddr.c
! 17de8997fdc63fa702c8d0159e3cc447  gcc/testsuite/gcc.c-torture/unsorted/dump-noaddr.x
  1165050faa87dc30c85c6c0dfae03875  gcc/testsuite/gcc.c-torture/unsorted/unsorted.exp
  d0289bfc068c575e2168df7bc156b45a  gcc/testsuite/gcc.dg/20000108-1.c
  586ef49702317acb226ba076aeea11ee  gcc/testsuite/gcc.dg/20000111-1.c
--- 23797,23803 ----
  540bc182381f68374a6cb9c7f45dd001  gcc/testsuite/gcc.c-torture/execute/zerolen-1.c
  47b383f4da2b2ea2ce19f91de8dcf5a2  gcc/testsuite/gcc.c-torture/execute/zerolen-2.c
  44c6ad090d3f06206aa54f59582ae32c  gcc/testsuite/gcc.c-torture/unsorted/dump-noaddr.c
! c5c6c60d723e3afbc0cc51e204a92079  gcc/testsuite/gcc.c-torture/unsorted/dump-noaddr.x
  1165050faa87dc30c85c6c0dfae03875  gcc/testsuite/gcc.c-torture/unsorted/unsorted.exp
  d0289bfc068c575e2168df7bc156b45a  gcc/testsuite/gcc.dg/20000108-1.c
  586ef49702317acb226ba076aeea11ee  gcc/testsuite/gcc.dg/20000111-1.c
*************** a8de438fb9333367aa275a3535869de9  gcc/te
*** 24031,24038 ****
  df9bdd00a7e05bef67d05587e6cdb073  gcc/testsuite/gcc.dg/Woverlength-strings-pedantic-c99-no.c
  5b7344bd8ae9b590871ad2cb5ff5cb56  gcc/testsuite/gcc.dg/Woverlength-strings-pedantic-c99.c
  442e44f887af52dada948db15878c3ae  gcc/testsuite/gcc.dg/Woverlength-strings.c
! 601daff94d9d4f6081f3ec93d9d5ad90  gcc/testsuite/gcc.dg/Woverride-init-1.c
! 86573bdf4ec57f27887e18a33f6f8c7e  gcc/testsuite/gcc.dg/Woverride-init-2.c
  a325dd759fae54feaae3395258941fa1  gcc/testsuite/gcc.dg/Woverride-init-3.c
  57c517b5d9ac205300b5fdee49f4fc79  gcc/testsuite/gcc.dg/Wpadded.c
  06162d89f7d3c7f1c3938ea7cc7c0c0a  gcc/testsuite/gcc.dg/Wparentheses-1.c
--- 24148,24155 ----
  df9bdd00a7e05bef67d05587e6cdb073  gcc/testsuite/gcc.dg/Woverlength-strings-pedantic-c99-no.c
  5b7344bd8ae9b590871ad2cb5ff5cb56  gcc/testsuite/gcc.dg/Woverlength-strings-pedantic-c99.c
  442e44f887af52dada948db15878c3ae  gcc/testsuite/gcc.dg/Woverlength-strings.c
! 0c5f8be5b670c6b7648c36db42a6eeac  gcc/testsuite/gcc.dg/Woverride-init-1.c
! 6704aa1f1a08ee0d4b039b4222eb9c67  gcc/testsuite/gcc.dg/Woverride-init-2.c
  a325dd759fae54feaae3395258941fa1  gcc/testsuite/gcc.dg/Woverride-init-3.c
  57c517b5d9ac205300b5fdee49f4fc79  gcc/testsuite/gcc.dg/Wpadded.c
  06162d89f7d3c7f1c3938ea7cc7c0c0a  gcc/testsuite/gcc.dg/Wparentheses-1.c
*************** fd1dd764e3b54f44dcb460a959f131a1  gcc/te
*** 24150,24155 ****
--- 24267,24273 ----
  ab3955f55aa596a98faf0528f22b1d0c  gcc/testsuite/gcc.dg/alias-9.c
  b87d726d798335bcf014c51ea61e9a4c  gcc/testsuite/gcc.dg/align-1.c
  ecaba7c928af85c280e63fa96b9b5e1b  gcc/testsuite/gcc.dg/align-2.c
+ 6583b4f8147fde31faab62b525508999  gcc/testsuite/gcc.dg/align-3.c
  b3869c9bd68bb9659f230f48bf56f83c  gcc/testsuite/gcc.dg/always_inline.c
  f8e56304de540053717fae4af2defaef  gcc/testsuite/gcc.dg/always_inline2.c
  495c171bd090a11c393fd33a225bf9c6  gcc/testsuite/gcc.dg/always_inline3.c
*************** a5e988481cd66b8acf6c610b847cb713  gcc/te
*** 24197,24202 ****
--- 24315,24322 ----
  0c13e4008bb665f05b030eb42e43183f  gcc/testsuite/gcc.dg/asan/pr63845.c
  9a45b4bebab3901180dbe2a44efcd070  gcc/testsuite/gcc.dg/asan/pr64170.c
  73f04617a7b0ee3bd0e6f41d954ea876  gcc/testsuite/gcc.dg/asan/pr64981.c
+ 97de4b173eeead7faba61cc66980de6f  gcc/testsuite/gcc.dg/asan/pr80166.c
+ 44651454ed7fd7d367ecc8dbce7be369  gcc/testsuite/gcc.dg/asan/pr80168.c
  5ff39290aee620ff2495e8cb5a3905ee  gcc/testsuite/gcc.dg/asm-1.c
  b8a6dfeb58832a8b8624357eed99557a  gcc/testsuite/gcc.dg/asm-2.c
  b911cf51d486403e3ca1c067a8a15675  gcc/testsuite/gcc.dg/asm-3.c
*************** efed4766878640e3953cf4a8272fe4bf  gcc/te
*** 26834,26839 ****
--- 26954,26960 ----
  31b1615453a71d015e9bcb61c74ac7eb  gcc/testsuite/gcc.dg/init-empty-2.c
  90817e9557235af860d367897aafa042  gcc/testsuite/gcc.dg/init-empty-3.c
  22b16e07a96d1fc14440515466c26af1  gcc/testsuite/gcc.dg/init-excess-1.c
+ e469f076692f924b2e1d46714a1056b3  gcc/testsuite/gcc.dg/init-excess-2.c
  396553d7240f36b87ed115ff6f7e069c  gcc/testsuite/gcc.dg/init-string-1.c
  82229a54386faefae6a5da00d0dc0e97  gcc/testsuite/gcc.dg/init-string-2.c
  09d7ab46368a3c67e84d62f415b75a88  gcc/testsuite/gcc.dg/init-undef-1.c
*************** ff181124e0dfb10498217ce4f497a743  gcc/te
*** 27008,27014 ****
  8f25b749b3343bbe5e9448d44019f76c  gcc/testsuite/gcc.dg/ipa/noclone-1.c
  40bd41302666d56c4edf7330db97920e  gcc/testsuite/gcc.dg/ipa/pr42706.c
  e4887053c792f4f78b03804c148839ce  gcc/testsuite/gcc.dg/ipa/pr45644.c
! 5c428c219954576c308c245d9256f052  gcc/testsuite/gcc.dg/ipa/pr48195.c
  cdec1b240b89ad7bf971aa799a1ea4a0  gcc/testsuite/gcc.dg/ipa/pr50744.c
  ca6dd47eed2470f390bd2cdca32f96fb  gcc/testsuite/gcc.dg/ipa/pr51362.c
  ef3f699c90a5350ceb595934cf210763  gcc/testsuite/gcc.dg/ipa/pr55260.c
--- 27129,27135 ----
  8f25b749b3343bbe5e9448d44019f76c  gcc/testsuite/gcc.dg/ipa/noclone-1.c
  40bd41302666d56c4edf7330db97920e  gcc/testsuite/gcc.dg/ipa/pr42706.c
  e4887053c792f4f78b03804c148839ce  gcc/testsuite/gcc.dg/ipa/pr45644.c
! 6e1b4f2c5d0c0d768778da8e3b7df828  gcc/testsuite/gcc.dg/ipa/pr48195.c
  cdec1b240b89ad7bf971aa799a1ea4a0  gcc/testsuite/gcc.dg/ipa/pr50744.c
  ca6dd47eed2470f390bd2cdca32f96fb  gcc/testsuite/gcc.dg/ipa/pr51362.c
  ef3f699c90a5350ceb595934cf210763  gcc/testsuite/gcc.dg/ipa/pr55260.c
*************** b79f1ceb546081b64c4d92d23a7a815a  gcc/te
*** 27034,27039 ****
--- 27155,27163 ----
  e96671ff735d92fb197623c0c635db8b  gcc/testsuite/gcc.dg/ipa/pr68790.c
  47f323ada98e8576e87b3d61e280cf39  gcc/testsuite/gcc.dg/ipa/pr70306.c
  9e20144eec96000223a2e983ffcba9fa  gcc/testsuite/gcc.dg/ipa/pr70646.c
+ fa8ddbcc7285d68bc45e806fa10c5aa5  gcc/testsuite/gcc.dg/ipa/pr80104.c
+ e7fc4be7576352c4cd0c02e049c49640  gcc/testsuite/gcc.dg/ipa/pr81696.c
+ e69e8e71bc18aee250eb3863dee58b57  gcc/testsuite/gcc.dg/ipa/pr82001.c
  3711549f043138241351fb1c94572f85  gcc/testsuite/gcc.dg/ipa/propalign-1.c
  08fac1cc332d4245f6524087de6e356f  gcc/testsuite/gcc.dg/ipa/propalign-2.c
  9b8d6608d230920de2838adb7960ab1c  gcc/testsuite/gcc.dg/ipa/propalign-3.c
*************** c5d3ad9a0b06bb1d77cc89309b8629ab  gcc/te
*** 27273,27278 ****
--- 27397,27403 ----
  957e327f63b137847986d2f4b832588e  gcc/testsuite/gcc.dg/lto/pr47259_1.c
  54e551daabafef19dff2d27e471c5a39  gcc/testsuite/gcc.dg/lto/pr47924_0.c
  783b00cf61b59ac61283d1315751dc5c  gcc/testsuite/gcc.dg/lto/pr48622_0.c
+ 2fa784dc45cba9ef34bcc21e141f0a25  gcc/testsuite/gcc.dg/lto/pr50199_0.c
  626442299a26bfdc323c3151d4aa1295  gcc/testsuite/gcc.dg/lto/pr51572-1_0.c
  383ec2ed7babb4bc10b561c2686f11cf  gcc/testsuite/gcc.dg/lto/pr52097_0.c
  d27dcd8e1afb81501ed01884f9b048f3  gcc/testsuite/gcc.dg/lto/pr52634_0.c
*************** e2a69fb19a42b9e9d0fb60b574fc8294  gcc/te
*** 27327,27332 ****
--- 27452,27459 ----
  e79a03eaf2b833f7a45b0112c6e05b26  gcc/testsuite/gcc.dg/lto/pr66221_0.c
  e4c1f7966a0b687ade65605b5ef05172  gcc/testsuite/gcc.dg/lto/pr66221_1.c
  513bc0d418851a55f4d310c4bd07a90b  gcc/testsuite/gcc.dg/lto/pr67452_0.c
+ d042436d2f4ca534a8b4d81610559ebd  gcc/testsuite/gcc.dg/lto/pr69188_0.c
+ 3b4bd973fa6b96913327e429117c532a  gcc/testsuite/gcc.dg/lto/pr69188_1.c
  260506c568e35bc49112021166edf8f2  gcc/testsuite/gcc.dg/lto/resolutions_0.c
  1084184a9b11a84eee39ef130211f70b  gcc/testsuite/gcc.dg/lto/save-temps_0.c
  9789216c84be63ef866b406d3dc749d8  gcc/testsuite/gcc.dg/lto/simd-function_0.c
*************** b01e42858e0423266a42ce48f5963765  gcc/te
*** 27616,27621 ****
--- 27743,27752 ----
  98eb40fd35afc99b8d7a0d9037913d4a  gcc/testsuite/gcc.dg/pch/macro-4.c
  9dfd3f4bded8093e1bd9fe58412b43c6  gcc/testsuite/gcc.dg/pch/macro-4.hs
  6724598515b138f7d2ec52c989a7c8aa  gcc/testsuite/gcc.dg/pch/pch.exp
+ d4141b7ac70c28b7c83f42cea80032d1  gcc/testsuite/gcc.dg/pch/pr66343-1.c
+ fecd32092f1271edbd03eb98de866244  gcc/testsuite/gcc.dg/pch/pr66343-1.hs
+ 140e74992c61983f49deebe0a5a98c95  gcc/testsuite/gcc.dg/pch/pr66343-2.c
+ fecd32092f1271edbd03eb98de866244  gcc/testsuite/gcc.dg/pch/pr66343-2.hs
  10e7aa3c9c88169c37fec51ab85d804b  gcc/testsuite/gcc.dg/pch/pushpop-1.c
  8dd7fa6bfb17e08908378d5179a15dcd  gcc/testsuite/gcc.dg/pch/pushpop-1.hs
  046fa096e19252044dc223b9025b6b66  gcc/testsuite/gcc.dg/pch/save-temps-1.c
*************** e8ab6748304462c991d39c13563cbf48  gcc/te
*** 28768,28773 ****
--- 28899,28905 ----
  9b83e97ecb4b549b8c90122cd4fbd1f8  gcc/testsuite/gcc.dg/pr67028.c
  22b215a01a6d868774c721c1885d3cb4  gcc/testsuite/gcc.dg/pr67029.c
  83d2ba40db3f581a1ffc833a152e4d49  gcc/testsuite/gcc.dg/pr67271.c
+ c7c4b7705622efa27fdc0b569d8c2977  gcc/testsuite/gcc.dg/pr67410.c
  26420e282f9c8903f34baea4ce4e2835  gcc/testsuite/gcc.dg/pr67512.c
  fb456e8c2f8f230de46a56453b2c02b6  gcc/testsuite/gcc.dg/pr67563.c
  b501c41d88536640ee6fb443cdfed70b  gcc/testsuite/gcc.dg/pr67730-1.c
*************** c32e69e0b15af869a3408b989cf2a673  gcc/te
*** 28800,28805 ****
--- 28932,28956 ----
  5e379016acbc1d2eae8b26f5aa49b810  gcc/testsuite/gcc.dg/pr70169.c
  5a875c740aedd4dc64ede0baa88152db  gcc/testsuite/gcc.dg/pr70177.c
  c67417bef7b2de68b948a03f52093a75  gcc/testsuite/gcc.dg/pr70269.c
+ 79f760cb1168bdcad7ceef62cd0034c3  gcc/testsuite/gcc.dg/pr71558.c
+ 2d57cd18f3b5a4ce14ac9f867103994d  gcc/testsuite/gcc.dg/pr71581.c
+ c9312ef03c2b6660d66f7f253edd0a95  gcc/testsuite/gcc.dg/pr72816.c
+ c8b6cd5a10630b96dc3a5624216b7302  gcc/testsuite/gcc.dg/pr77450.c
+ 29614a746c17b223321a0d7ef3514fa6  gcc/testsuite/gcc.dg/pr77587.c
+ 69b6daef9d67d24c3fe0b63b8952814d  gcc/testsuite/gcc.dg/pr77587a.c
+ 7a2e92e436f35dd60a04e2f596e8502f  gcc/testsuite/gcc.dg/pr77673.c
+ 036b89fa8e150cf11fc1400568acc2d2  gcc/testsuite/gcc.dg/pr78185.c
+ 7bfaca350ee545dbe10363c435dfa736  gcc/testsuite/gcc.dg/pr78333.c
+ 9c25129a5f3400435bb046e327b76463  gcc/testsuite/gcc.dg/pr79494.c
+ 9ec3e8f462eef4a5f6494d9a88865b8c  gcc/testsuite/gcc.dg/pr79499.c
+ ef954bb1fb7a47316e8ab7a4574c5cfc  gcc/testsuite/gcc.dg/pr79570.c
+ 28988c41c40042f95506d21ea70f33cb  gcc/testsuite/gcc.dg/pr79574-2.c
+ 8757e7055d5c4d752bee007011bd64a9  gcc/testsuite/gcc.dg/pr79574.c
+ c61145f66ad86d5750f921ee12a6d3ea  gcc/testsuite/gcc.dg/pr80112.c
+ 84b0e8e3e377514aaf1b169b00c28bee  gcc/testsuite/gcc.dg/pr80286.c
+ 2d3008b06f6add111e8e825b9d93b0a7  gcc/testsuite/gcc.dg/pr81192.c
+ 25643ed86459e72b894b58fd0ca23c45  gcc/testsuite/gcc.dg/pr81621.c
+ 6ab73da237e4b1f4a00a90b19e6d538b  gcc/testsuite/gcc.dg/pr82112.c
  8b7d73da2d5d78000716492365a85d5a  gcc/testsuite/gcc.dg/pr8715.c
  3d08410b2dd57259aa63f0e1c64b376e  gcc/testsuite/gcc.dg/pr8788-1.c
  be04382a35ebb1cfae1b2168f1693a94  gcc/testsuite/gcc.dg/pr8835-1.c
*************** a831de49f2d41703b35fb1187a5eaacf  gcc/te
*** 29123,29128 ****
--- 29274,29280 ----
  3fb5ccff70fc82da2e2aac8594fb9457  gcc/testsuite/gcc.dg/tls/pr47715-5.c
  7193b5d66103274fe5171afd9347d3b2  gcc/testsuite/gcc.dg/tls/pr58595.c
  f12db64d724ba7ee8005f9b84bbac338  gcc/testsuite/gcc.dg/tls/pr66470.c
+ 983d38f0205472294f9a0d21db0b4c6b  gcc/testsuite/gcc.dg/tls/pr78796.c
  796d5642fd9a5bf2871955a7f51a2b2c  gcc/testsuite/gcc.dg/tls/section-1.c
  8a7ac847cc234a02986b204d9590a7fa  gcc/testsuite/gcc.dg/tls/section-2.c
  bd750cfcc2981be8695d1ba87cf4e02d  gcc/testsuite/gcc.dg/tls/struct-1.c
*************** dfb471a397851bdb52f7df883b650b86  gcc/te
*** 29255,29261 ****
  21ae8e4c97f9712921eba7fc818f95ac  gcc/testsuite/gcc.dg/torture/builtin-explog-1.c
  78fe887c5b4e40b6979a21f42cf88715  gcc/testsuite/gcc.dg/torture/builtin-frexp-1.c
  ee8bd79edc0ad4bc126961e887ebfba4  gcc/testsuite/gcc.dg/torture/builtin-integral-1.c
! d03ae4d66084fa9943ede3ebc5834bf4  gcc/testsuite/gcc.dg/torture/builtin-isinf_sign-1.c
  83118765f0b187110c56a43bc55e625d  gcc/testsuite/gcc.dg/torture/builtin-ldexp-1.c
  4af299d669d5105372a113668f341c2d  gcc/testsuite/gcc.dg/torture/builtin-logb-1.c
  5e784903b5dc50b9d24bee1bc3d1a59e  gcc/testsuite/gcc.dg/torture/builtin-math-1.c
--- 29407,29413 ----
  21ae8e4c97f9712921eba7fc818f95ac  gcc/testsuite/gcc.dg/torture/builtin-explog-1.c
  78fe887c5b4e40b6979a21f42cf88715  gcc/testsuite/gcc.dg/torture/builtin-frexp-1.c
  ee8bd79edc0ad4bc126961e887ebfba4  gcc/testsuite/gcc.dg/torture/builtin-integral-1.c
! c08b043a9d6b664b2a28e52b43d2d57b  gcc/testsuite/gcc.dg/torture/builtin-isinf_sign-1.c
  83118765f0b187110c56a43bc55e625d  gcc/testsuite/gcc.dg/torture/builtin-ldexp-1.c
  4af299d669d5105372a113668f341c2d  gcc/testsuite/gcc.dg/torture/builtin-logb-1.c
  5e784903b5dc50b9d24bee1bc3d1a59e  gcc/testsuite/gcc.dg/torture/builtin-math-1.c
*************** c086cf125214d765f1c5a72c38be056f  gcc/te
*** 29846,29851 ****
--- 29998,30004 ----
  47ff79c68173fd64e216bdb58e6b86e4  gcc/testsuite/gcc.dg/torture/pr68017.c
  0aed8d710722c86c135d00c92adb42f9  gcc/testsuite/gcc.dg/torture/pr68067-1.c
  b5b9ccaf68338894bc8598bb94bd624f  gcc/testsuite/gcc.dg/torture/pr68067-2.c
+ d97bda1e2b9d4a1a15d587e807ffaba1  gcc/testsuite/gcc.dg/torture/pr68528.c
  15674311a236d345e5ccc22c50bd2032  gcc/testsuite/gcc.dg/torture/pr68955.c
  d0e72257e28bdee76e42175b2609453f  gcc/testsuite/gcc.dg/torture/pr68963.c
  d41d8cd98f00b204e9800998ecf8427e  gcc/testsuite/gcc.dg/torture/pr69166.c
*************** ff3c2aee40e9c9844deb96dd9600b613  gcc/te
*** 29875,29882 ****
--- 30028,30061 ----
  b64fc3513d09279239f96771a7af996c  gcc/testsuite/gcc.dg/torture/pr70484.c
  afe02f85eea1b350f51277401b3e0d48  gcc/testsuite/gcc.dg/torture/pr70623-2.c
  ae5459727bedcc45a1feee9f56e5974c  gcc/testsuite/gcc.dg/torture/pr70623.c
+ da4037959e336e19cb95c25f91f8eb52  gcc/testsuite/gcc.dg/torture/pr70628.c
  058fe139380690d2ec38aa882c1f7908  gcc/testsuite/gcc.dg/torture/pr70780.c
  b6bb0c63d9e968f4f16f282365518a50  gcc/testsuite/gcc.dg/torture/pr70941.c
+ 08b15e14c6c9f4cc6291f19fc8ba963b  gcc/testsuite/gcc.dg/torture/pr71423.c
+ 0c398d952cf20fc83aec050f85d8a44b  gcc/testsuite/gcc.dg/torture/pr71452.c
+ d7822d9246b54abacbdc7d6230ab041d  gcc/testsuite/gcc.dg/torture/pr71522.c
+ b0020481b01ba2fea155b7e666817dc3  gcc/testsuite/gcc.dg/torture/pr71606.c
+ 84d2efbfb6770d353f4734e7a4b8472e  gcc/testsuite/gcc.dg/torture/pr75964.c
+ a60b7965903cb9c959e40c476b74eee8  gcc/testsuite/gcc.dg/torture/pr77309.c
+ b2079f895bb4a53a9fb50a4f7f4dad38  gcc/testsuite/gcc.dg/torture/pr77436.c
+ 3738145bdfb921ff6fde7c38cba0ffc4  gcc/testsuite/gcc.dg/torture/pr77478.c
+ 3bb780f180e0ee73008ad02127a056f8  gcc/testsuite/gcc.dg/torture/pr77605.c
+ 57be2089dac1fb2e85cd58323205f9a6  gcc/testsuite/gcc.dg/torture/pr77646.c
+ 865946206183cafa8a5643538e8b0fbb  gcc/testsuite/gcc.dg/torture/pr77648-1.c
+ c945e3dac4b0d4098ff940d231eba713  gcc/testsuite/gcc.dg/torture/pr77648-2.c
+ 114db937484a8170c1da6ce7c65177ca  gcc/testsuite/gcc.dg/torture/pr77768.c
+ 853e8eecbb93209860176f0749d7795f  gcc/testsuite/gcc.dg/torture/pr77855.c
+ a878d4452d87793c8c44834bb0002252  gcc/testsuite/gcc.dg/torture/pr77916.c
+ 11ecd2bf13f49659549b909ba5e89a22  gcc/testsuite/gcc.dg/torture/pr77937-1.c
+ 93456a1afa9bdb206d19c956fc09d572  gcc/testsuite/gcc.dg/torture/pr77937-2.c
+ 97a06daa72abd05b50e081d28e95b4ab  gcc/testsuite/gcc.dg/torture/pr78416.c
+ 993a3dda89ab325c2c0104a20a2b3aa2  gcc/testsuite/gcc.dg/torture/pr78731.c
+ 454f620b10b777ffe98a6272450350e7  gcc/testsuite/gcc.dg/torture/pr79666.c
+ f32c1c2791d7c91b2c9f4e051cb74457  gcc/testsuite/gcc.dg/torture/pr79732.c
+ 028eb97756cfe96f0e2005402ce583df  gcc/testsuite/gcc.dg/torture/pr80025.c
+ 836cdc8e8c71c2a740d491e170406a0c  gcc/testsuite/gcc.dg/torture/pr80122.c
+ 18bcc1e2a028a46b70391f66f2fe3019  gcc/testsuite/gcc.dg/torture/pr80362.c
+ 87d263c15a5b5f49fa4a5414786fd90b  gcc/testsuite/gcc.dg/torture/pr80539.c
  62b28db4200d0c4e51bde8d1e5693886  gcc/testsuite/gcc.dg/torture/pr8081.c
  b3a9e4f2af6462183da8d6c5cb13bf1f  gcc/testsuite/gcc.dg/torture/pta-callused-1.c
  98fde0e59e55c1ed923ee9d9f034d7f2  gcc/testsuite/gcc.dg/torture/pta-escape-1.c
*************** fa7217b4e402db46b1d64ca38eb6f212  gcc/te
*** 30018,30023 ****
--- 30197,30203 ----
  504f32de54a5ad49b342a10f337e5dab  gcc/testsuite/gcc.dg/tree-prof/pr52027.c
  345c39022fa99a5e40eae744b8bcc403  gcc/testsuite/gcc.dg/tree-prof/pr52150.c
  3f27342de254e8240c99bdedc574ddfe  gcc/testsuite/gcc.dg/tree-prof/pr59003.c
+ 41f2b0f1caac2c21616dfe0830cd87fe  gcc/testsuite/gcc.dg/tree-prof/pr79587.c
  6326a041bce19e077fb8352676c53447  gcc/testsuite/gcc.dg/tree-prof/prof-robust-1.c
  c5f69c00bf64730ff83c8cc52b120cc7  gcc/testsuite/gcc.dg/tree-prof/stringop-1.c
  e55a1b3e5811e1e818cfe423498ef259  gcc/testsuite/gcc.dg/tree-prof/stringop-2.c
*************** a58f4de98c197990fcf2e4713881d8ca  gcc/te
*** 30681,30690 ****
--- 30861,30874 ----
  1d0372f8ae37d080e68785ebbe3c78fa  gcc/testsuite/gcc.dg/tree-ssa/pr64801.c
  0490327703b674d0b535db002e92f1b3  gcc/testsuite/gcc.dg/tree-ssa/pr65136.c
  bb8857e07a5b85d146bcc9aec96d0c1b  gcc/testsuite/gcc.dg/tree-ssa/pr67755.c
+ 9d94b8736a8137db631f83d5452e4332  gcc/testsuite/gcc.dg/tree-ssa/pr68021.c
  4c8881edc71005a1d85370d1a8358a54  gcc/testsuite/gcc.dg/tree-ssa/pr69355.c
  da374335b5ce20d724b67b01ce0e71d3  gcc/testsuite/gcc.dg/tree-ssa/pr69666.c
  f7a3fabc9425270a4d8e40f8a991ca09  gcc/testsuite/gcc.dg/tree-ssa/pr69845-1.c
  885c1be5e32bb9fbd61002b21649165d  gcc/testsuite/gcc.dg/tree-ssa/pr69845-2.c
+ 54361b5a6c79884df71815f5ccc04ff8  gcc/testsuite/gcc.dg/tree-ssa/pr78428.c
+ bbf1c06c2256a14579c491f2da36264f  gcc/testsuite/gcc.dg/tree-ssa/pr78886.c
+ 4ac3ddbb068bcfee51e3aaeaaa518512  gcc/testsuite/gcc.dg/tree-ssa/pr79803.c
  cfcca8eb5b4b49640309e8c296b2f651  gcc/testsuite/gcc.dg/tree-ssa/predcom-1.c
  e69a11968c8d3bd61d110c2fbc09a63f  gcc/testsuite/gcc.dg/tree-ssa/predcom-2.c
  d2bb80f7dc1eb91f7fc51b7e83fa8b73  gcc/testsuite/gcc.dg/tree-ssa/predcom-3.c
*************** a8a75b36b3cbde1b2efc3f3da0ae398d  gcc/te
*** 31179,31184 ****
--- 31363,31371 ----
  27953860ae581b218a25877813bf7792  gcc/testsuite/gcc.dg/ubsan/object-size-9.c
  8b53119c2975ba4eb7e0a8a3f21049bc  gcc/testsuite/gcc.dg/ubsan/pr63690.c
  c9a455b03d901e306e1836d50e9e37d6  gcc/testsuite/gcc.dg/ubsan/pr67662.c
+ 796829af36eae05fda4a4c261de44807  gcc/testsuite/gcc.dg/ubsan/pr70878.c
+ 3037e107357a95ddd6b61dbb90af7fde  gcc/testsuite/gcc.dg/ubsan/pr80097.c
+ 6dd5a7b8f1dd237a95a0f42766ee64d9  gcc/testsuite/gcc.dg/ubsan/pr81162.c
  b8151850777ff6cf7e08f49727bb9591  gcc/testsuite/gcc.dg/ubsan/ubsan.exp
  b749062a1214fdf6ba947d30bdf90f30  gcc/testsuite/gcc.dg/ucnid-1.c
  deec75fcb663af9b8c0ad9b43a81dd3b  gcc/testsuite/gcc.dg/ucnid-10.c
*************** c1a258213052c3dfbc9b6a8c1c0d6d6c  gcc/te
*** 32237,32242 ****
--- 32424,32430 ----
  1e23759ae2d20580a48c9849cfca511f  gcc/testsuite/gcc.dg/vect/wrapv-vect-reduc-2short.c
  3d5e5f3957e344192acd9a441f82efd1  gcc/testsuite/gcc.dg/vect/wrapv-vect-reduc-dot-s8b.c
  8fa0c79d0870b4c3bfed6efe4bdb678f  gcc/testsuite/gcc.dg/vect/wrapv-vect-reduc-pattern-2c.c
+ deacf2b346fc9032e20669526a1ad31d  gcc/testsuite/gcc.dg/vector-1.c
  94848eb0772411f3b0653cf4ece16fb2  gcc/testsuite/gcc.dg/vector-shift-2.c
  86f897d771475ca631b3e92b126d1939  gcc/testsuite/gcc.dg/vector-shift.c
  682b52464ba3c1efc4293e4f2d4ba5b7  gcc/testsuite/gcc.dg/verbose-asm.c
*************** d8fe1df6bd60ee66e08bb71c04737d68  gcc/te
*** 32949,32954 ****
--- 33137,33144 ----
  b8f90423eef94b7a240f40a79251eabf  gcc/testsuite/gcc.target/aarch64/pr68363_1.c
  c78c0b4bf1f9d71f6874b0be55f3f7b8  gcc/testsuite/gcc.target/aarch64/pr70044.c
  e7efe396ef16dbc7526785247ead6d84  gcc/testsuite/gcc.target/aarch64/pr70809_1.c
+ c8c052e3ffb361fbe4b0043b1414c58b  gcc/testsuite/gcc.target/aarch64/pr78038.c
+ ed6579d962ab6988afc3e526e6c51275  gcc/testsuite/gcc.target/aarch64/pr78255.c
  1f95766b4ed5bfb5f2cf1f168a607a8d  gcc/testsuite/gcc.target/aarch64/predefine_large.c
  d38e476730748c653068e7cb2d8d6ca6  gcc/testsuite/gcc.target/aarch64/predefine_small.c
  29e7dbfba15c0f945488b33400b908b4  gcc/testsuite/gcc.target/aarch64/predefine_tiny.c
*************** aa8e6314969635296b924c21de596181  gcc/te
*** 33640,33645 ****
--- 33830,33837 ----
  b80315a2e089ca4c3248a4d827eb49ef  gcc/testsuite/gcc.target/arm/atomic-op-seq_cst.c
  d6a110ab8373cfe1039d83e073de1dee  gcc/testsuite/gcc.target/arm/atomic-op-short.c
  6888ada4c21cda37da2310c44f94d92a  gcc/testsuite/gcc.target/arm/atomic_loaddi_1.c
+ 5859020e19de924a786d03d4bd1ea91f  gcc/testsuite/gcc.target/arm/atomic_loaddi_10.c
+ 342a363b77439a8d8d3d8a12284842d1  gcc/testsuite/gcc.target/arm/atomic_loaddi_11.c
  748d8b48dbda98ef62ce99a5203312e7  gcc/testsuite/gcc.target/arm/atomic_loaddi_2.c
  3fe801d58f3b70880715055726fee231  gcc/testsuite/gcc.target/arm/atomic_loaddi_3.c
  b7ab6cc044af1bed0ca099a7f8685f4e  gcc/testsuite/gcc.target/arm/atomic_loaddi_4.c
*************** d721a88ae72a8be261b58663490fc7ee  gcc/te
*** 33688,33693 ****
--- 33880,33886 ----
  aac420c0b357d3ff45f93061cf99e491  gcc/testsuite/gcc.target/arm/divzero.c
  3a4cc77eebab8f993d561b9747c869c2  gcc/testsuite/gcc.target/arm/eabi1.c
  14c1154266333682f985fe7c6c6e3911  gcc/testsuite/gcc.target/arm/eliminate.c
+ 35daa2bef7020b26f98b70184aa411d4  gcc/testsuite/gcc.target/arm/empty_fiq_handler.c
  78487646e9710e62b0d506909e9588a8  gcc/testsuite/gcc.target/arm/epilog-1.c
  af1ccf2d19987a11d4e08cd9cccf8a69  gcc/testsuite/gcc.target/arm/fixed-point-exec.c
  8c44444b0855c804bcef7d0e74866430  gcc/testsuite/gcc.target/arm/fixed_float_conversion.c
*************** ef3b417cb5557b3d4caf7046dd71a0f6  gcc/te
*** 33730,33735 ****
--- 33923,33929 ----
  59b43d7fa573aec56d37e8d3ee175b75  gcc/testsuite/gcc.target/arm/fp16-unprototyped-1.c
  a60c72361842412ed806a9caeafedd5b  gcc/testsuite/gcc.target/arm/fp16-unprototyped-2.c
  b627f1fc53dc3aa6e38826de78cc3f9d  gcc/testsuite/gcc.target/arm/fp16-variadic-1.c
+ e8ad8b3e7c27f53eca5540f75a6dc2be  gcc/testsuite/gcc.target/arm/fpscr.c
  becd73a8b67b5a5ea5ac098897654766  gcc/testsuite/gcc.target/arm/frame-pointer-1.c
  d197c58c217da8cdebc4b5d30cce8a52  gcc/testsuite/gcc.target/arm/ftest-armv4-arm.c
  f8c88e22189f7cae3d54e35f7511abc6  gcc/testsuite/gcc.target/arm/ftest-armv4t-arm.c
*************** a38ba5635fcb15a6a5c3bd66dca37b1c  gcc/te
*** 35995,36000 ****
--- 36189,36199 ----
  51f46e9158ad549a6f9079f849c4c10d  gcc/testsuite/gcc.target/arm/pr69187.c
  b1f1919dcfa1287f837de2b937769050  gcc/testsuite/gcc.target/arm/pr69194.c
  e5aafcaef63ec87ca861c2c3df04f753  gcc/testsuite/gcc.target/arm/pr69614.c
+ 4c5ae74514e166984fa2a6889c2e475e  gcc/testsuite/gcc.target/arm/pr77933-1.c
+ 5569dab63bab16df7a85b99d44757d38  gcc/testsuite/gcc.target/arm/pr77933-2.c
+ 68c26348d2a6791f295710024aba5c21  gcc/testsuite/gcc.target/arm/pr78041.c
+ 7ff23bd8b3754acf52c8f22104b1f9b6  gcc/testsuite/gcc.target/arm/pr78255-1.c
+ 4fffc267d9c8775478c72209db83f52e  gcc/testsuite/gcc.target/arm/pr78255-2.c
  3143560976572191d8bba6ba78a45aa6  gcc/testsuite/gcc.target/arm/register-variables.c
  9891ac3dc9739983de683e418f98f801  gcc/testsuite/gcc.target/arm/require-pic-register-loc.c
  7488cdc20f835bda2359993c0ec74d15  gcc/testsuite/gcc.target/arm/rev16.c
*************** f1148ddb95a6320ace4c79914eafc0a3  gcc/te
*** 36272,36282 ****
--- 36471,36484 ----
  d31812204be066c0a4bf4f23121c0961  gcc/testsuite/gcc.target/avr/avr.exp
  a6701935d18c8ed062555c8a48454bc9  gcc/testsuite/gcc.target/avr/dev-specific-rmw.c
  2028ceccf9f97e5e84e9adf6beb7597e  gcc/testsuite/gcc.target/avr/exit-abort.h
+ 17f2d31ca17ff746ab26fee309e56e95  gcc/testsuite/gcc.target/avr/isr-test.h
  2931177f4aeff49d531d5474224448f6  gcc/testsuite/gcc.target/avr/pr46779-1.c
  572dc228e08385a1db0fcbab66dbaa4e  gcc/testsuite/gcc.target/avr/pr46779-2.c
  fc917fcfe7cfe97b5f27265d5960f0e6  gcc/testsuite/gcc.target/avr/pr52472.c
  421d2b9b36fa2496dce05d129d2c352b  gcc/testsuite/gcc.target/avr/pr58545.c
  9e82df166e8b559cb56d2c4f48cbaf30  gcc/testsuite/gcc.target/avr/pr60991.c
+ 94f026369213dad7565383028ef6afcf  gcc/testsuite/gcc.target/avr/pr65210.c
+ 292bf2dc33b5cfededd107fe1c0ebc88  gcc/testsuite/gcc.target/avr/pr71103.c
  881cb1836ddfc3105e0aacacc481aa09  gcc/testsuite/gcc.target/avr/progmem-error-1.c
  2eb3f167ae58b534e25afc1b94617746  gcc/testsuite/gcc.target/avr/progmem-error-1.cpp
  56de611fd29076ce9da389a853476819  gcc/testsuite/gcc.target/avr/progmem-warning-1.c
*************** b886957d93603d104ce113c5f6f5b702  gcc/te
*** 36304,36309 ****
--- 36506,36514 ----
  4a5987f17a5b1c68712021003150be18  gcc/testsuite/gcc.target/avr/torture/builtins-error.c
  c458c2462e23a4c58a7e4d05b6200907  gcc/testsuite/gcc.target/avr/torture/fix-types.h
  9c259c4f72a85d057a7f86dee19660cc  gcc/testsuite/gcc.target/avr/torture/int24-mul.c
+ f07474ce14e61da44f73f5bc38af0fa5  gcc/testsuite/gcc.target/avr/torture/isr-01-simple.c
+ fcfc22b5becf29a31bc290457133738d  gcc/testsuite/gcc.target/avr/torture/isr-02-call.c
+ 9cae7dcbc57747c7d869b4d66a99221f  gcc/testsuite/gcc.target/avr/torture/isr-03-fixed.c
  0844a939ea2464d30cc8892c85b4aecc  gcc/testsuite/gcc.target/avr/torture/pr39633.c
  8fb17af722ee890b7fa08b5610cdb80e  gcc/testsuite/gcc.target/avr/torture/pr41885.c
  70b849f57ecf42299230b99b7734dd2d  gcc/testsuite/gcc.target/avr/torture/pr51374-1.c
*************** fea352b16ae79edc9965b1f39680a709  gcc/te
*** 36314,36319 ****
--- 36519,36526 ----
  7f56c1b750dfe8d7e4128f15aa3eaffe  gcc/testsuite/gcc.target/avr/torture/pr63633-ice-mult.c
  44584f49cd0975073be7b86102774077  gcc/testsuite/gcc.target/avr/torture/pr64331.c
  dcabffeb42e88a442661b9e47e43a9c1  gcc/testsuite/gcc.target/avr/torture/pr64452.c
+ ab53af0eb6dbfe2791a8ac1bbaf0c11f  gcc/testsuite/gcc.target/avr/torture/pr71103-2.c
+ 5f3be2dbb82f715c14a1a41fff447a60  gcc/testsuite/gcc.target/avr/torture/pr77326.c
  21a45d34960ba9567b9f2483d22c843f  gcc/testsuite/gcc.target/avr/torture/progmem-1.c
  564c71a894aff68e98d5c4a6db2b47ae  gcc/testsuite/gcc.target/avr/torture/progmem-1.cpp
  e3e1c41865f5287c9ff7e200745758fd  gcc/testsuite/gcc.target/avr/torture/sat-hr-plus-minus.c
*************** c437ae63e2540199d8c765547fc407d6  gcc/te
*** 36819,36824 ****
--- 37026,37032 ----
  b6e744a5c521873cc8be2dbb5f25790d  gcc/testsuite/gcc.target/i386/avx-pr57233.c
  ab15d222e706bd85c87c037d1e9b6f51  gcc/testsuite/gcc.target/i386/avx-pr63594-1.c
  7e490de1d2a70d21844cdc70c1546f49  gcc/testsuite/gcc.target/i386/avx-pr63594-2.c
+ 15722fba52fd43dd64c47b080c1c307c  gcc/testsuite/gcc.target/i386/avx-pr80286.c
  4e3d37bb04b99394790fa9e8caddf790  gcc/testsuite/gcc.target/i386/avx-recip-vec.c
  02ae18a66bd7b76f7a651b896f066b70  gcc/testsuite/gcc.target/i386/avx-reduc-1.c
  772f703b19bb27d5947d136a2f72221e  gcc/testsuite/gcc.target/i386/avx-rint-sfix-2-vec.c
*************** adf63582badc02467af57f768108628f  gcc/te
*** 37395,37400 ****
--- 37603,37609 ----
  23119c1a19029b030f8d77ec9d58b970  gcc/testsuite/gcc.target/i386/avx2-pr63594-2.c
  adb7b1598c20430c16f98c7ec509cbbc  gcc/testsuite/gcc.target/i386/avx2-pr64252.c
  ba17e5440f855d5b86affe06cb486090  gcc/testsuite/gcc.target/i386/avx2-pr64286.c
+ 757f2803cb524594784445d322b67fa5  gcc/testsuite/gcc.target/i386/avx2-pr70574.c
  2b83554762241a146df7ccc1617e1bfa  gcc/testsuite/gcc.target/i386/avx2-vbroadcastsd_pd-1.c
  193f0a7d029b84ce4e3b2e58eac8240a  gcc/testsuite/gcc.target/i386/avx2-vbroadcastsd_pd-2.c
  84a46e7f4338347591f1c8fe0aaceda5  gcc/testsuite/gcc.target/i386/avx2-vbroadcastsi128-1.c
*************** e77e7a8b9ae50a450a04aced77a9cbd0  gcc/te
*** 40068,40073 ****
--- 40277,40287 ----
  d961249337eb5f0487f3f532312e3199  gcc/testsuite/gcc.target/i386/mpx/pr68337-1.c
  e64de766303ab8d2b507adb2517650f5  gcc/testsuite/gcc.target/i386/mpx/pr68337-2.c
  dedcdece98d6722cf60573a8409aaa81  gcc/testsuite/gcc.target/i386/mpx/pr68416.c
+ 51d453987274aa6444003b6ad207c139  gcc/testsuite/gcc.target/i386/mpx/pr78339.c
+ 07d6ed7d973e170542d15b433c8db44e  gcc/testsuite/gcc.target/i386/mpx/pr79631.c
+ d637fa6066a7da620fed27559d7da1b7  gcc/testsuite/gcc.target/i386/mpx/pr79753.c
+ e96704aac9ccfcbb20830047695ce956  gcc/testsuite/gcc.target/i386/mpx/pr79770.c
+ 1ef078c4aeea1e1432f65bde3abbd4a3  gcc/testsuite/gcc.target/i386/mpx/pr79987.c
  cb8a04ee24250678af3e3e0db64ccfa6  gcc/testsuite/gcc.target/i386/mpx/realloc-1-lbv.c
  16d5e4ac393ac4db6f87f25b4aab5ba2  gcc/testsuite/gcc.target/i386/mpx/realloc-1-nov.c
  967cd8d609c7360939caec43d90b8813  gcc/testsuite/gcc.target/i386/mpx/realloc-1-ubv.c
*************** bccc40fa95a11c992c5319581f1c269f  gcc/te
*** 40237,40243 ****
  b6587e8091b873e052b86981b4c6dd26  gcc/testsuite/gcc.target/i386/pclmul-avx-check.h
  56f7ac50c182627b5551065184b25a3b  gcc/testsuite/gcc.target/i386/pclmul-check.h
  15dd7e15fc38c0bad00692ec554b7cd1  gcc/testsuite/gcc.target/i386/pclmulqdq.c
- 7cba7c855889c19a09d531a2facd7ecd  gcc/testsuite/gcc.target/i386/pcommit-1.c
  9679e778097966e5b39d1c4130b0ee74  gcc/testsuite/gcc.target/i386/pentium4-not-mull.c
  51cadc9814c437e72abf8293afd36241  gcc/testsuite/gcc.target/i386/perm-concat.c
  d5d456417fd703ff892cd508c42e4f32  gcc/testsuite/gcc.target/i386/pic-1.c
--- 40451,40456 ----
*************** fcdb8a2e469f382466d55620e63345f4  gcc/te
*** 40820,40826 ****
  10edafa5d28fec2dd9bc1ecab31a24f3  gcc/testsuite/gcc.target/i386/pr64617.c
  564104a134a0332a3502e02b96c94cb3  gcc/testsuite/gcc.target/i386/pr64805.c
  1373d22a1c11a77bbd5c3b0ae7ab163b  gcc/testsuite/gcc.target/i386/pr64905.c
! c134506d0c4ff040cc182846148e7f4c  gcc/testsuite/gcc.target/i386/pr65044.c
  3f9f04c2528a876d6e1d568bacdc4432  gcc/testsuite/gcc.target/i386/pr65078-1.c
  eb5c42e7434196907a6b147b87ede739  gcc/testsuite/gcc.target/i386/pr65078-2.c
  0135600497644144bf44c86c6019c038  gcc/testsuite/gcc.target/i386/pr65078-3.c
--- 41033,41039 ----
  10edafa5d28fec2dd9bc1ecab31a24f3  gcc/testsuite/gcc.target/i386/pr64617.c
  564104a134a0332a3502e02b96c94cb3  gcc/testsuite/gcc.target/i386/pr64805.c
  1373d22a1c11a77bbd5c3b0ae7ab163b  gcc/testsuite/gcc.target/i386/pr64905.c
! acc9972da84530cb5b60a756f1263cf4  gcc/testsuite/gcc.target/i386/pr65044.c
  3f9f04c2528a876d6e1d568bacdc4432  gcc/testsuite/gcc.target/i386/pr65078-1.c
  eb5c42e7434196907a6b147b87ede739  gcc/testsuite/gcc.target/i386/pr65078-2.c
  0135600497644144bf44c86c6019c038  gcc/testsuite/gcc.target/i386/pr65078-3.c
*************** a7ae171348479a97f8436614b36fd410  gcc/te
*** 40893,40898 ****
--- 41106,41139 ----
  9a6009bd978dadd47bb2a756be9c41cb  gcc/testsuite/gcc.target/i386/pr70525.c
  63614f4a8e03a5baed97479f04e87900  gcc/testsuite/gcc.target/i386/pr70662.c
  1003b2af30448864252327bd08ddb57b  gcc/testsuite/gcc.target/i386/pr70858.c
+ 27e030b5f9e35d267c9bd37d4e1e4a68  gcc/testsuite/gcc.target/i386/pr71458.c
+ 4e5dce84b234a32706534e5c74192ab3  gcc/testsuite/gcc.target/i386/pr76342.c
+ bb7f521a5508d5630cc282c2daf09320  gcc/testsuite/gcc.target/i386/pr77377.c
+ e600788d6e924c2ec9337867af173298  gcc/testsuite/gcc.target/i386/pr77403.c
+ 8778824d1f460735e2e28b66438ebdc3  gcc/testsuite/gcc.target/i386/pr77594.c
+ ebdf78610e5253029e5305e68875b6c9  gcc/testsuite/gcc.target/i386/pr77991.c
+ 49ae150fd045d15f422427bbe3805a0d  gcc/testsuite/gcc.target/i386/pr78227-1.c
+ 4730916a53a530c342916eb3f8c600f0  gcc/testsuite/gcc.target/i386/pr78227-2.c
+ 65244d7660e21de57b2f5bdf3df24107  gcc/testsuite/gcc.target/i386/pr78262.c
+ deb27ae8ba4b14e7c0102c71de9b30e7  gcc/testsuite/gcc.target/i386/pr78310.c
+ bc00dfd68405a008b750f094120fac4f  gcc/testsuite/gcc.target/i386/pr79514.c
+ e24bb155bc16036a1f39902f9cda1133  gcc/testsuite/gcc.target/i386/pr79559.c
+ 7dda7ba5d0bc563d983cbcd61cf05cc8  gcc/testsuite/gcc.target/i386/pr79568-1.c
+ a11495811689152262f1a40e2f796ce9  gcc/testsuite/gcc.target/i386/pr79568-2.c
+ 18b2847f138512a15d9b786fc39ff5df  gcc/testsuite/gcc.target/i386/pr79568-3.c
+ 775e7fe3e5625b784949e1922efab9ea  gcc/testsuite/gcc.target/i386/pr79729.c
+ b3b6f5c8ba17ba3296bdffadca2efac2  gcc/testsuite/gcc.target/i386/pr79733.c
+ d6a597f0fbd3fbabaff69609d7a1c3b9  gcc/testsuite/gcc.target/i386/pr79807.c
+ 79f33466eabfc2e257a8fa0ed96c57ab  gcc/testsuite/gcc.target/i386/pr79901.c
+ d8519fa7ee590fbd3c0a85e2b8653841  gcc/testsuite/gcc.target/i386/pr79932-1.c
+ f971fc2176ce03b9a33ca253f2499ca0  gcc/testsuite/gcc.target/i386/pr79932-2.c
+ e4e5537356578134ed01182ab2552b70  gcc/testsuite/gcc.target/i386/pr80019.c
+ ccd1c247864f05916416dc77c0aee2d4  gcc/testsuite/gcc.target/i386/pr80569.c
+ 4aa131c4fd40500edf612c2566a0a1b2  gcc/testsuite/gcc.target/i386/pr81128.c
+ 80d88d513f3bb1b8ed658fe8c37fb6b0  gcc/testsuite/gcc.target/i386/pr81300.c
+ 245854ca702959ab30c393829f2b36d0  gcc/testsuite/gcc.target/i386/pr81375.c
+ 4a3389f7f2146d2198f9c46d5209ba9f  gcc/testsuite/gcc.target/i386/pr81471.c
+ 056554173d9ac80e5694f760fcde429f  gcc/testsuite/gcc.target/i386/pr81766.c
  849234c7a569c1e86023244bc5561263  gcc/testsuite/gcc.target/i386/pr9771-1.c
  24ceb6d5f3f5cde4b9d852839bdb98ae  gcc/testsuite/gcc.target/i386/prefetchw-1.c
  f11f4731c396f099373c033ab016a64f  gcc/testsuite/gcc.target/i386/prefetchwt1-1.c
*************** b5540c2e6c4aa6f5730ae17876c12e1f  gcc/te
*** 40967,40975 ****
  adcdec8ed0466d3411f5313513271763  gcc/testsuite/gcc.target/i386/sse-1.c
  9bad27158ce36a5ce8a320dbc944e434  gcc/testsuite/gcc.target/i386/sse-10.c
  49bde97b271274cb2bc26697ce2b19be  gcc/testsuite/gcc.target/i386/sse-11.c
! b1922e4b811b524fb9a72b3667d4205a  gcc/testsuite/gcc.target/i386/sse-12.c
! 5bd97335c84a4012a534aa711724e3e3  gcc/testsuite/gcc.target/i386/sse-13.c
! 59f65127e4306b04c4edd395175d17d4  gcc/testsuite/gcc.target/i386/sse-14.c
  92ad37b5ad7426d489b1b6f1ba0f41ea  gcc/testsuite/gcc.target/i386/sse-15.c
  2e7b115c4bd7984925f1a8d17a5faf67  gcc/testsuite/gcc.target/i386/sse-16.c
  f660e67b22cb44e6a6b38a247b1d78c3  gcc/testsuite/gcc.target/i386/sse-17.c
--- 41208,41216 ----
  adcdec8ed0466d3411f5313513271763  gcc/testsuite/gcc.target/i386/sse-1.c
  9bad27158ce36a5ce8a320dbc944e434  gcc/testsuite/gcc.target/i386/sse-10.c
  49bde97b271274cb2bc26697ce2b19be  gcc/testsuite/gcc.target/i386/sse-11.c
! a613331cf0e550f53937d03f9ba82ce8  gcc/testsuite/gcc.target/i386/sse-12.c
! bbb64420b015cf302f12ba0ad4bc78bd  gcc/testsuite/gcc.target/i386/sse-13.c
! 017ebf9358d6b45c149825a404799798  gcc/testsuite/gcc.target/i386/sse-14.c
  92ad37b5ad7426d489b1b6f1ba0f41ea  gcc/testsuite/gcc.target/i386/sse-15.c
  2e7b115c4bd7984925f1a8d17a5faf67  gcc/testsuite/gcc.target/i386/sse-16.c
  f660e67b22cb44e6a6b38a247b1d78c3  gcc/testsuite/gcc.target/i386/sse-17.c
*************** f660e67b22cb44e6a6b38a247b1d78c3  gcc/te
*** 40978,40986 ****
  bb148b6e9dd40de90aed723794e38216  gcc/testsuite/gcc.target/i386/sse-2.c
  d7a71bae6a12771a9057e2d3a60c39f1  gcc/testsuite/gcc.target/i386/sse-20.c
  d5e7e4c7d488a953399d853e48aa484e  gcc/testsuite/gcc.target/i386/sse-21.c
! 92ad47a6f70deff310c4e461938aa1a8  gcc/testsuite/gcc.target/i386/sse-22.c
  1c2df57cb3d7d6a3daf4084135ba9b1b  gcc/testsuite/gcc.target/i386/sse-22a.c
! e1e366d9dd70dd006735a11cc450b1f1  gcc/testsuite/gcc.target/i386/sse-23.c
  3fe1d48ff9d52631da56f04cc922a9cb  gcc/testsuite/gcc.target/i386/sse-24.c
  f839ec28fa786a06dabe541954c1b1ae  gcc/testsuite/gcc.target/i386/sse-25.c
  9dfe2cc74e998cef475e202f64ff8322  gcc/testsuite/gcc.target/i386/sse-3.c
--- 41219,41227 ----
  bb148b6e9dd40de90aed723794e38216  gcc/testsuite/gcc.target/i386/sse-2.c
  d7a71bae6a12771a9057e2d3a60c39f1  gcc/testsuite/gcc.target/i386/sse-20.c
  d5e7e4c7d488a953399d853e48aa484e  gcc/testsuite/gcc.target/i386/sse-21.c
! 9b7f6a37430a3c027acf0ac92511dc70  gcc/testsuite/gcc.target/i386/sse-22.c
  1c2df57cb3d7d6a3daf4084135ba9b1b  gcc/testsuite/gcc.target/i386/sse-22a.c
! 2adcc515214e42e9744582c3b0d4c596  gcc/testsuite/gcc.target/i386/sse-23.c
  3fe1d48ff9d52631da56f04cc922a9cb  gcc/testsuite/gcc.target/i386/sse-24.c
  f839ec28fa786a06dabe541954c1b1ae  gcc/testsuite/gcc.target/i386/sse-25.c
  9dfe2cc74e998cef475e202f64ff8322  gcc/testsuite/gcc.target/i386/sse-3.c
*************** caf01994c96172dac156c3da29317823  gcc/te
*** 42411,42416 ****
--- 42652,42658 ----
  37c12fff6f77333d7cb7d787bbb7f908  gcc/testsuite/gcc.target/powerpc/bswap64-4.c
  1bdcd38f4043a35aa4799e5b7e1fd590  gcc/testsuite/gcc.target/powerpc/builtins-1.c
  fc8793b521e1298ab0e99e4fb318b34b  gcc/testsuite/gcc.target/powerpc/builtins-2.c
+ 456232eb27e86ab509433f0e3c8f547d  gcc/testsuite/gcc.target/powerpc/builtins-3-p8.c
  aa7f028ee43d6de435ef9e96d16926a5  gcc/testsuite/gcc.target/powerpc/cell_builtin-1.c
  4d701030026d89cdc9d316ac4b013baa  gcc/testsuite/gcc.target/powerpc/cell_builtin-2.c
  49e4d6ccb42c80379975f32fce0efd5b  gcc/testsuite/gcc.target/powerpc/cell_builtin-3.c
*************** e5a3f954e535f339c4a0f35fc50c6302  gcc/te
*** 42447,42454 ****
  a034d7a8bf265623a75800f01113e836  gcc/testsuite/gcc.target/powerpc/darwin-split-ld-stret.c
  548fc585bcbf766f23bef7319f0b0a18  gcc/testsuite/gcc.target/powerpc/darwin64-abi.c
  b4bba5410c6e6f914897ce86ffaca508  gcc/testsuite/gcc.target/powerpc/dfmode_off.c
! f2e8694ab86e1d671840cc1b4d010431  gcc/testsuite/gcc.target/powerpc/dfp-builtin-1.c
! 70b901aef4fec169c6e0277e173417fe  gcc/testsuite/gcc.target/powerpc/dfp-builtin-2.c
  edc590c61b2a5fd6c1f8da5e10b52099  gcc/testsuite/gcc.target/powerpc/dfp-dd-2.c
  127103864713219a50dac28ee38910e0  gcc/testsuite/gcc.target/powerpc/dfp-dd.c
  918f43d2707c381ec6a3c8f95d06ba7a  gcc/testsuite/gcc.target/powerpc/dfp-td-2.c
--- 42689,42696 ----
  a034d7a8bf265623a75800f01113e836  gcc/testsuite/gcc.target/powerpc/darwin-split-ld-stret.c
  548fc585bcbf766f23bef7319f0b0a18  gcc/testsuite/gcc.target/powerpc/darwin64-abi.c
  b4bba5410c6e6f914897ce86ffaca508  gcc/testsuite/gcc.target/powerpc/dfmode_off.c
! e861a888f1deb9e37547f0da1a5f7f2d  gcc/testsuite/gcc.target/powerpc/dfp-builtin-1.c
! e5999c82fe083b7c9a7cd976f61a514b  gcc/testsuite/gcc.target/powerpc/dfp-builtin-2.c
  edc590c61b2a5fd6c1f8da5e10b52099  gcc/testsuite/gcc.target/powerpc/dfp-dd-2.c
  127103864713219a50dac28ee38910e0  gcc/testsuite/gcc.target/powerpc/dfp-dd.c
  918f43d2707c381ec6a3c8f95d06ba7a  gcc/testsuite/gcc.target/powerpc/dfp-td-2.c
*************** faf2ed46677346059dd2b7fd42254985  gcc/te
*** 42688,42693 ****
--- 42930,42946 ----
  03eb7b91e6fcf641d03ca949346d2dc9  gcc/testsuite/gcc.target/powerpc/pr69969.c
  a31fef5f59c5f12ea342e66137c45ae7  gcc/testsuite/gcc.target/powerpc/pr70117.c
  d3a79432800e585b3905439b686d873b  gcc/testsuite/gcc.target/powerpc/pr70963.c
+ 3228b8ac65fb541db916e5ebac3f487e  gcc/testsuite/gcc.target/powerpc/pr71763.c
+ d13df2d4752807dad63a970f45225730  gcc/testsuite/gcc.target/powerpc/pr72863.c
+ fb524be9fd12ca8094bde96a06f3bdd5  gcc/testsuite/gcc.target/powerpc/pr79197.c
+ 0f9344c270baf27d9a4762d111adbc5e  gcc/testsuite/gcc.target/powerpc/pr79439.c
+ 8c1e3ce96b0244e674ef5e0620a4b88e  gcc/testsuite/gcc.target/powerpc/pr79544.c
+ 8fe70e669118bfd74ac64bf553741d89  gcc/testsuite/gcc.target/powerpc/pr79951.c
+ 32dc6ec7c4a1a3cefe2efbb3b602ef2c  gcc/testsuite/gcc.target/powerpc/pr80210.c
+ c74100b0e24e645cbd51ff8d93f11730  gcc/testsuite/gcc.target/powerpc/pr80246.c
+ 91aa94bfbc5294b4a595ae532afc83cc  gcc/testsuite/gcc.target/powerpc/pr81833-1.c
+ 19cfa2a5c1f2939acd4ac7362754d9b0  gcc/testsuite/gcc.target/powerpc/pr81833-2.c
+ 118dd26456facc5560611716506ec4a3  gcc/testsuite/gcc.target/powerpc/pr82112.c
  742150395e718873f58ee06d0f2e2f7a  gcc/testsuite/gcc.target/powerpc/quad-atomic.c
  cb3bd735d825c9be9fe7e29ef8447b76  gcc/testsuite/gcc.target/powerpc/recip-1.c
  b92b990991453f4ef11c93b9c58b05be  gcc/testsuite/gcc.target/powerpc/recip-2.c
*************** b7b97cacccde5659943f0834decbd080  gcc/te
*** 42728,42733 ****
--- 42981,42989 ----
  965d7565d6b0810f8220d916ba958565  gcc/testsuite/gcc.target/powerpc/swaps-p8-17.c
  88eda95ce377e04d1b34e1304ee82ffa  gcc/testsuite/gcc.target/powerpc/swaps-p8-18.c
  89b4a8bdc073fb0fe5966edfd7443dd9  gcc/testsuite/gcc.target/powerpc/swaps-p8-2.c
+ c891211b25d5266010cad8266c02fe3c  gcc/testsuite/gcc.target/powerpc/swaps-p8-20.c
+ 8cb758ec48a4fd3447970d6f85159dea  gcc/testsuite/gcc.target/powerpc/swaps-p8-23.c
+ 99bc5494b60bcbe35a2499e7bc74a125  gcc/testsuite/gcc.target/powerpc/swaps-p8-24.c
  84237fc0555dd56c639a0274a8f4dbde  gcc/testsuite/gcc.target/powerpc/swaps-p8-3.c
  0df14a19fd6ee081105fc2b90003a0b4  gcc/testsuite/gcc.target/powerpc/swaps-p8-4.c
  26517c689d143f1397c457beaff12ae6  gcc/testsuite/gcc.target/powerpc/swaps-p8-5.c
*************** b8cea10d187ee0ff03310bf53b54d85e  gcc/te
*** 42736,42751 ****
  ce6b26ef67ffe555b789e4205dc2e809  gcc/testsuite/gcc.target/powerpc/swaps-p8-8.c
  8abb62ec1d013c705390c6c55084378d  gcc/testsuite/gcc.target/powerpc/swaps-p8-9.c
  18366289600f6f5c0ed1255bd8c267db  gcc/testsuite/gcc.target/powerpc/tfmode_off.c
! c2edbb1afba546ea3ac8a5efcaca9c38  gcc/testsuite/gcc.target/powerpc/ti_math1.c
  c3d0d51284479d220a6166a0f362536c  gcc/testsuite/gcc.target/powerpc/ti_math2.c
  fd114dcd0b2119a748387046e861a6dd  gcc/testsuite/gcc.target/powerpc/timode_off.c
  fe21d9465e0313b29a24703b2cef2b7e  gcc/testsuite/gcc.target/powerpc/upper-regs-df.c
  7f45b205e570d7d45266076bd4fd4f4c  gcc/testsuite/gcc.target/powerpc/upper-regs-sf.c
  6359ddccab89d64974aacae92509fc9e  gcc/testsuite/gcc.target/powerpc/vec-cg.c
  8ee50015e788404267646adf1ac95972  gcc/testsuite/gcc.target/powerpc/vec-shr.c
  4ceb6855c2485b8644bf41d0692dce88  gcc/testsuite/gcc.target/powerpc/vsx-builtin-1.c
  6281c614296bfbf072b62d6fba22f72a  gcc/testsuite/gcc.target/powerpc/vsx-builtin-2.c
! 2cbc6ebb458b1e9d41b7cd611b4dbd55  gcc/testsuite/gcc.target/powerpc/vsx-builtin-3.c
  6246ea29025c11b1b9f4c6b8d036cbc3  gcc/testsuite/gcc.target/powerpc/vsx-builtin-4.c
  acf95bd1a1e2b9b14c0640b45f2e75f5  gcc/testsuite/gcc.target/powerpc/vsx-builtin-5.c
  0b61a376e7164778a523a0766df4ce6e  gcc/testsuite/gcc.target/powerpc/vsx-builtin-6.c
--- 42992,43008 ----
  ce6b26ef67ffe555b789e4205dc2e809  gcc/testsuite/gcc.target/powerpc/swaps-p8-8.c
  8abb62ec1d013c705390c6c55084378d  gcc/testsuite/gcc.target/powerpc/swaps-p8-9.c
  18366289600f6f5c0ed1255bd8c267db  gcc/testsuite/gcc.target/powerpc/tfmode_off.c
! 2669e2fc765583ed6aa74dabc19e373c  gcc/testsuite/gcc.target/powerpc/ti_math1.c
  c3d0d51284479d220a6166a0f362536c  gcc/testsuite/gcc.target/powerpc/ti_math2.c
  fd114dcd0b2119a748387046e861a6dd  gcc/testsuite/gcc.target/powerpc/timode_off.c
  fe21d9465e0313b29a24703b2cef2b7e  gcc/testsuite/gcc.target/powerpc/upper-regs-df.c
  7f45b205e570d7d45266076bd4fd4f4c  gcc/testsuite/gcc.target/powerpc/upper-regs-sf.c
  6359ddccab89d64974aacae92509fc9e  gcc/testsuite/gcc.target/powerpc/vec-cg.c
  8ee50015e788404267646adf1ac95972  gcc/testsuite/gcc.target/powerpc/vec-shr.c
+ 2f7d0faae17249a4c0239bf8d90e399a  gcc/testsuite/gcc.target/powerpc/vec-xxpermdi.c
  4ceb6855c2485b8644bf41d0692dce88  gcc/testsuite/gcc.target/powerpc/vsx-builtin-1.c
  6281c614296bfbf072b62d6fba22f72a  gcc/testsuite/gcc.target/powerpc/vsx-builtin-2.c
! d6aef2cc5b6d426a696fad3f9bd0cf2c  gcc/testsuite/gcc.target/powerpc/vsx-builtin-3.c
  6246ea29025c11b1b9f4c6b8d036cbc3  gcc/testsuite/gcc.target/powerpc/vsx-builtin-4.c
  acf95bd1a1e2b9b14c0640b45f2e75f5  gcc/testsuite/gcc.target/powerpc/vsx-builtin-5.c
  0b61a376e7164778a523a0766df4ce6e  gcc/testsuite/gcc.target/powerpc/vsx-builtin-6.c
*************** ac1eca0e08377612e3d778bc122efa1c  gcc/te
*** 42903,42913 ****
  283b6978739165f436839fd30df4e9a4  gcc/testsuite/gcc.target/s390/vector/vec-genmask-2.c
  1afa4a6190a988fb5a4fad356fbdd30d  gcc/testsuite/gcc.target/s390/vector/vec-init-1.c
  03cc140b84b037d2fe9c9c0be079e135  gcc/testsuite/gcc.target/s390/vector/vec-int-math-compile-1.c
! 939d61e5473a534f524e495e1799f4ac  gcc/testsuite/gcc.target/s390/vector/vec-scalar-cmp-1.c
  8de36944e18edbbcc735c9baad533f52  gcc/testsuite/gcc.target/s390/vector/vec-shift-1.c
  cea49877a5895e80cb13491b6cdfa2a2  gcc/testsuite/gcc.target/s390/vector/vec-sub-1.c
  db4e2b1f6b0441e2f2f64b6e141245cd  gcc/testsuite/gcc.target/s390/vector/vec-vcond-1.c
  fea8a607b23a38dcc79782200801aa4a  gcc/testsuite/gcc.target/s390/vector/vec-vrepi-1.c
  911df970b217779536d2fbc571abe9e4  gcc/testsuite/gcc.target/s390/zvector/vec-dbl-math-compile-1.c
  f42e228f92a8dfb9e1ded9cb20bc6622  gcc/testsuite/gcc.target/s390/zvector/vec-elem-1.c
  a7f2bd9fee8c03add8265ce21e47cb8f  gcc/testsuite/gcc.target/s390/zvector/vec-genbytemask-1.c
--- 43160,43171 ----
  283b6978739165f436839fd30df4e9a4  gcc/testsuite/gcc.target/s390/vector/vec-genmask-2.c
  1afa4a6190a988fb5a4fad356fbdd30d  gcc/testsuite/gcc.target/s390/vector/vec-init-1.c
  03cc140b84b037d2fe9c9c0be079e135  gcc/testsuite/gcc.target/s390/vector/vec-int-math-compile-1.c
! b66b681f30cd927a8eb9e75f64dccd1f  gcc/testsuite/gcc.target/s390/vector/vec-scalar-cmp-1.c
  8de36944e18edbbcc735c9baad533f52  gcc/testsuite/gcc.target/s390/vector/vec-shift-1.c
  cea49877a5895e80cb13491b6cdfa2a2  gcc/testsuite/gcc.target/s390/vector/vec-sub-1.c
  db4e2b1f6b0441e2f2f64b6e141245cd  gcc/testsuite/gcc.target/s390/vector/vec-vcond-1.c
  fea8a607b23a38dcc79782200801aa4a  gcc/testsuite/gcc.target/s390/vector/vec-vrepi-1.c
+ 0c165e95e0c22e3574ecd2aa4b395cb1  gcc/testsuite/gcc.target/s390/zvector/vec-cmp-1.c
  911df970b217779536d2fbc571abe9e4  gcc/testsuite/gcc.target/s390/zvector/vec-dbl-math-compile-1.c
  f42e228f92a8dfb9e1ded9cb20bc6622  gcc/testsuite/gcc.target/s390/zvector/vec-elem-1.c
  a7f2bd9fee8c03add8265ce21e47cb8f  gcc/testsuite/gcc.target/s390/zvector/vec-genbytemask-1.c
*************** c0fe12b65277b653de804b8be0683e07  gcc/te
*** 43144,43152 ****
  82c2e387bd540b74637065450948138c  gcc/testsuite/gcc.target/sparc/20020416-1.c
  c538bfaba12da814b09545c9ac7fb347  gcc/testsuite/gcc.target/sparc/20111102-1.c
  ffba4a644f6c776dd608a5285349bff8  gcc/testsuite/gcc.target/sparc/20151219-1.c
  44373c57181608413fc07f3ec0e2ad6e  gcc/testsuite/gcc.target/sparc/align.c
  667a877a2fb02d919c4eaaea6fbccbad  gcc/testsuite/gcc.target/sparc/array.c
! 51da71a9631e2769588765c1734024be  gcc/testsuite/gcc.target/sparc/bmaskbshuf.c
  019da970597edf6187323a8e6d8d3fd7  gcc/testsuite/gcc.target/sparc/cas64.c
  8b7e178ec9569253b3b34020d323079f  gcc/testsuite/gcc.target/sparc/cmask.c
  61fdcc3e39deca7e4f123378b814dd0f  gcc/testsuite/gcc.target/sparc/combined-1.c
--- 43402,43412 ----
  82c2e387bd540b74637065450948138c  gcc/testsuite/gcc.target/sparc/20020416-1.c
  c538bfaba12da814b09545c9ac7fb347  gcc/testsuite/gcc.target/sparc/20111102-1.c
  ffba4a644f6c776dd608a5285349bff8  gcc/testsuite/gcc.target/sparc/20151219-1.c
+ e470b0a0d1a056b60c3915a6dfcfd4ae  gcc/testsuite/gcc.target/sparc/20170228-1.c
  44373c57181608413fc07f3ec0e2ad6e  gcc/testsuite/gcc.target/sparc/align.c
  667a877a2fb02d919c4eaaea6fbccbad  gcc/testsuite/gcc.target/sparc/array.c
! 51da71a9631e2769588765c1734024be  gcc/testsuite/gcc.target/sparc/bmaskbshuf-1.c
! 2fde479e25184fdcc6f9e94d0b5c15ad  gcc/testsuite/gcc.target/sparc/bmaskbshuf-2.c
  019da970597edf6187323a8e6d8d3fd7  gcc/testsuite/gcc.target/sparc/cas64.c
  8b7e178ec9569253b3b34020d323079f  gcc/testsuite/gcc.target/sparc/cmask.c
  61fdcc3e39deca7e4f123378b814dd0f  gcc/testsuite/gcc.target/sparc/combined-1.c
*************** eb9fea9eb3ccdd5fb4d85ac011c10dc5  gcc/te
*** 43221,43226 ****
--- 43481,43487 ----
  632f93e6b0314e25ec1b43c771cb405c  gcc/testsuite/gcc.target/sparc/sparc-reg-1.c
  49d4346a32402759d7a9329d2375c502  gcc/testsuite/gcc.target/sparc/sparc-ret-1.c
  111c6ff31ffc23f4b402354941b88338  gcc/testsuite/gcc.target/sparc/sparc-ret-2.c
+ 96ac755e92338efd01e188e2e94bbf8f  gcc/testsuite/gcc.target/sparc/sparc-ret-3.c
  1943f3e1f1253e644f6fe445637c2dec  gcc/testsuite/gcc.target/sparc/sparc-trap-1.c
  ec2f5c33e342e497e03a9918860ce2f7  gcc/testsuite/gcc.target/sparc/sparc.exp
  9d0e2b5fe42dfe4e33a910954d24877b  gcc/testsuite/gcc.target/sparc/struct-ret-check.c
*************** aa0e2acc5bfe4a7ddc3c5e96cc91be7e  gcc/te
*** 43831,43836 ****
--- 44092,44098 ----
  d67e73274a9e1605edc8f7d9ca4781a6  gcc/testsuite/gfortran.dg/allocate_with_source_16.f90
  64f8c5ad89b6221999b048eb2ce143f1  gcc/testsuite/gfortran.dg/allocate_with_source_18.f03
  f4a7a7cae5d96eb1020cfcf8e519b49b  gcc/testsuite/gfortran.dg/allocate_with_source_2.f90
+ 8c1d244f6031789916017b9201b706b1  gcc/testsuite/gfortran.dg/allocate_with_source_20.f03
  a5e1f5792644ea510ff26752c63c0de0  gcc/testsuite/gfortran.dg/allocate_with_source_3.f90
  6e6cc1fe5ed4f0f5c650bc8b6e0634b0  gcc/testsuite/gfortran.dg/allocate_with_source_4.f90
  113541ed2576712921a648846cb830f4  gcc/testsuite/gfortran.dg/allocate_with_source_5.f90
*************** a6bd048866027ea6bf597acb23ef25d0  gcc/te
*** 43911,43918 ****
  02d67df422b75276f6a95d5a60796b9b  gcc/testsuite/gfortran.dg/array_constructor_23.f
  3da281b068891ab68547f22bcc2f9943  gcc/testsuite/gfortran.dg/array_constructor_24.f
  e1c301e198e52e75cc41d51cb75f5d30  gcc/testsuite/gfortran.dg/array_constructor_25.f03
! d6c2c3288acb90c26cdc335883518c00  gcc/testsuite/gfortran.dg/array_constructor_26.f03
! 47dc9e56356c3381bf8e1688acb22722  gcc/testsuite/gfortran.dg/array_constructor_27.f03
  21daf278376911ce8154964d3e92e438  gcc/testsuite/gfortran.dg/array_constructor_28.f03
  d75b0075c8c6384eac9f0e38dc4e226f  gcc/testsuite/gfortran.dg/array_constructor_29.f03
  1f97b4f0dca764838294052acc156f85  gcc/testsuite/gfortran.dg/array_constructor_3.f90
--- 44173,44180 ----
  02d67df422b75276f6a95d5a60796b9b  gcc/testsuite/gfortran.dg/array_constructor_23.f
  3da281b068891ab68547f22bcc2f9943  gcc/testsuite/gfortran.dg/array_constructor_24.f
  e1c301e198e52e75cc41d51cb75f5d30  gcc/testsuite/gfortran.dg/array_constructor_25.f03
! 8ce528e13a8cd6b6ce743c2f0874ad48  gcc/testsuite/gfortran.dg/array_constructor_26.f03
! 5ca9cc7c393792c1c73cb103841df1e1  gcc/testsuite/gfortran.dg/array_constructor_27.f03
  21daf278376911ce8154964d3e92e438  gcc/testsuite/gfortran.dg/array_constructor_28.f03
  d75b0075c8c6384eac9f0e38dc4e226f  gcc/testsuite/gfortran.dg/array_constructor_29.f03
  1f97b4f0dca764838294052acc156f85  gcc/testsuite/gfortran.dg/array_constructor_3.f90
*************** e6b75f0001c9601e03995e3536377638  gcc/te
*** 43936,43943 ****
  e60167e5bb1be4ddb5c51310faf2e72a  gcc/testsuite/gfortran.dg/array_constructor_46.f90
  64814f1455379ac75272891a122c068e  gcc/testsuite/gfortran.dg/array_constructor_47.f90
  71b1b67746cb3b141002319b6af5c534  gcc/testsuite/gfortran.dg/array_constructor_48.f90
! e661acbbbb83a6c7a9d1ef58b171eeb5  gcc/testsuite/gfortran.dg/array_constructor_49.f90
  9918ac77cf760a3800e94da773f0a74b  gcc/testsuite/gfortran.dg/array_constructor_5.f90
  6dc05669b848d267b25c38806e59d51f  gcc/testsuite/gfortran.dg/array_constructor_6.f90
  0965c3437a2116ac32e573441184fdee  gcc/testsuite/gfortran.dg/array_constructor_7.f90
  b4019b0f6faabbc51d698bec4f4094ee  gcc/testsuite/gfortran.dg/array_constructor_8.f90
--- 44198,44206 ----
  e60167e5bb1be4ddb5c51310faf2e72a  gcc/testsuite/gfortran.dg/array_constructor_46.f90
  64814f1455379ac75272891a122c068e  gcc/testsuite/gfortran.dg/array_constructor_47.f90
  71b1b67746cb3b141002319b6af5c534  gcc/testsuite/gfortran.dg/array_constructor_48.f90
! 25a689cddf3ad19f4b612318a3a8e6e3  gcc/testsuite/gfortran.dg/array_constructor_49.f90
  9918ac77cf760a3800e94da773f0a74b  gcc/testsuite/gfortran.dg/array_constructor_5.f90
+ 7b8fbbe044e7a6ab2be8274984852be8  gcc/testsuite/gfortran.dg/array_constructor_50.f90
  6dc05669b848d267b25c38806e59d51f  gcc/testsuite/gfortran.dg/array_constructor_6.f90
  0965c3437a2116ac32e573441184fdee  gcc/testsuite/gfortran.dg/array_constructor_7.f90
  b4019b0f6faabbc51d698bec4f4094ee  gcc/testsuite/gfortran.dg/array_constructor_8.f90
*************** cf4d952c77026c12dcef405f6e7f2e49  gcc/te
*** 44034,44039 ****
--- 44297,44304 ----
  0ed1ec5c859d3837356536ddd0e6f9ac  gcc/testsuite/gfortran.dg/associate_16.f90
  d8912284402d7f10695694e5d787c65c  gcc/testsuite/gfortran.dg/associate_17.f90
  c066328da870ad9b313bf9491c5b72d6  gcc/testsuite/gfortran.dg/associate_2.f95
+ 79c66e6ef8d2160f4b4fcb4c44322791  gcc/testsuite/gfortran.dg/associate_21.f90
+ 8af1b6b8d72f3c807df4def38ed13d8c  gcc/testsuite/gfortran.dg/associate_22.f90
  ada9a3758cef9c8c02a55f1139c4f13b  gcc/testsuite/gfortran.dg/associate_3.f03
  a1f5f0d8423367d45fe9382b407ce7e9  gcc/testsuite/gfortran.dg/associate_4.f08
  5dfaf5e9c3d8b8b8f835046ca42ccbf4  gcc/testsuite/gfortran.dg/associate_5.f03
*************** d8f73ab42d904ef5f062bf0a25a370e5  gcc/te
*** 44311,44317 ****
  283d675eb1076656e705ce94dd65baa2  gcc/testsuite/gfortran.dg/bounds_check_fail_3.f90
  e2fa324bd643dad4595427c0cf6e27fd  gcc/testsuite/gfortran.dg/bounds_check_fail_4.f90
  47cd7c4192bcfdf1b9792fc175c39955  gcc/testsuite/gfortran.dg/bounds_check_strlen_1.f90
! 1927337e410ca88c64bac6ed1c490e09  gcc/testsuite/gfortran.dg/bounds_check_strlen_2.f90
  f145202f2e2e4fd5f13808086de4de58  gcc/testsuite/gfortran.dg/bounds_check_strlen_3.f90
  8d10f29783ca2636d630f6e16779efcd  gcc/testsuite/gfortran.dg/bounds_check_strlen_4.f90
  1aa5b9216e33e8838fd724d3e1bed124  gcc/testsuite/gfortran.dg/bounds_check_strlen_5.f90
--- 44576,44582 ----
  283d675eb1076656e705ce94dd65baa2  gcc/testsuite/gfortran.dg/bounds_check_fail_3.f90
  e2fa324bd643dad4595427c0cf6e27fd  gcc/testsuite/gfortran.dg/bounds_check_fail_4.f90
  47cd7c4192bcfdf1b9792fc175c39955  gcc/testsuite/gfortran.dg/bounds_check_strlen_1.f90
! f33baaa73ebbc0a23938401a171f0b68  gcc/testsuite/gfortran.dg/bounds_check_strlen_2.f90
  f145202f2e2e4fd5f13808086de4de58  gcc/testsuite/gfortran.dg/bounds_check_strlen_3.f90
  8d10f29783ca2636d630f6e16779efcd  gcc/testsuite/gfortran.dg/bounds_check_strlen_4.f90
  1aa5b9216e33e8838fd724d3e1bed124  gcc/testsuite/gfortran.dg/bounds_check_strlen_5.f90
*************** d24202e03865bc6c7b065012f5b50aa9  gcc/te
*** 44338,44349 ****
  dbab7052c49d479a8d2e25e0b571b1d8  gcc/testsuite/gfortran.dg/byte_1.f90
  d04db9714722a890fe3f299c043d6607  gcc/testsuite/gfortran.dg/byte_2.f90
  4f9563018c9cc84eb08854d1cad6dbdb  gcc/testsuite/gfortran.dg/c_assoc.f90
! cf6662e8969a47673112bad7c51f6cbd  gcc/testsuite/gfortran.dg/c_assoc_2.f03
  2b97f1cb4868fd97cb12455cd6c2a56e  gcc/testsuite/gfortran.dg/c_assoc_3.f90
! 17251f7d69b81c543e8bd11bce31202f  gcc/testsuite/gfortran.dg/c_assoc_4.f90
  85765b6794108949ee955541b1efb540  gcc/testsuite/gfortran.dg/c_assoc_5.f90
  1e7649b256bbeeebbd2063422e65deb7  gcc/testsuite/gfortran.dg/c_by_val.c
! 0eab6a68f39b8a389cf7b5acfbeb63e0  gcc/testsuite/gfortran.dg/c_by_val_1.f
  2e01e4009d12269c05b8f480e81cd06d  gcc/testsuite/gfortran.dg/c_by_val_2.f90
  813d55579374e020bb56ba96bcaca976  gcc/testsuite/gfortran.dg/c_by_val_3.f90
  c976bb6d4dfaa0c0883ce8e498e42afc  gcc/testsuite/gfortran.dg/c_by_val_4.f
--- 44603,44614 ----
  dbab7052c49d479a8d2e25e0b571b1d8  gcc/testsuite/gfortran.dg/byte_1.f90
  d04db9714722a890fe3f299c043d6607  gcc/testsuite/gfortran.dg/byte_2.f90
  4f9563018c9cc84eb08854d1cad6dbdb  gcc/testsuite/gfortran.dg/c_assoc.f90
! e14363ef7ec116f69833dd73d5b857ce  gcc/testsuite/gfortran.dg/c_assoc_2.f03
  2b97f1cb4868fd97cb12455cd6c2a56e  gcc/testsuite/gfortran.dg/c_assoc_3.f90
! 02f524bf53c504b18b887bbe53c78952  gcc/testsuite/gfortran.dg/c_assoc_4.f90
  85765b6794108949ee955541b1efb540  gcc/testsuite/gfortran.dg/c_assoc_5.f90
  1e7649b256bbeeebbd2063422e65deb7  gcc/testsuite/gfortran.dg/c_by_val.c
! a7dfa88a3db218310d3d606d8f2632fc  gcc/testsuite/gfortran.dg/c_by_val_1.f
  2e01e4009d12269c05b8f480e81cd06d  gcc/testsuite/gfortran.dg/c_by_val_2.f90
  813d55579374e020bb56ba96bcaca976  gcc/testsuite/gfortran.dg/c_by_val_3.f90
  c976bb6d4dfaa0c0883ce8e498e42afc  gcc/testsuite/gfortran.dg/c_by_val_4.f
*************** da95c5400735f4c2f4fc34487feb21f8  gcc/te
*** 44592,44597 ****
--- 44857,44863 ----
  081b7861449ee503eb0eafc38aa74102  gcc/testsuite/gfortran.dg/class_56.f90
  e656331cc901eecd1321f4812180dc51  gcc/testsuite/gfortran.dg/class_57.f90
  58bc4a716942caffe0323c7d0b20a63e  gcc/testsuite/gfortran.dg/class_6.f03
+ 28b51cf2f3868e0d992356221459b6b8  gcc/testsuite/gfortran.dg/class_62.f90
  cc0c048415b8d0593fe7e5b164763dc7  gcc/testsuite/gfortran.dg/class_7.f03
  765b5ae237d318aee8909def266c457e  gcc/testsuite/gfortran.dg/class_8.f03
  dac9a57a157d95214c44d80cc02bd042  gcc/testsuite/gfortran.dg/class_9.f03
*************** dbc20d52e3c86639db916ad3c6392de8  gcc/te
*** 44646,44651 ****
--- 44912,44918 ----
  9d2e1be7c7b774543dde26355644bb63  gcc/testsuite/gfortran.dg/class_optional_2.f90
  7c2579227e2041f067b68fc6f25175f5  gcc/testsuite/gfortran.dg/class_result_1.f03
  3b8f230b7e31089a91042ffa36e727e5  gcc/testsuite/gfortran.dg/class_result_2.f90
+ 6b5e22364a04ac278db525f084255294  gcc/testsuite/gfortran.dg/class_result_4.f90
  5d07b7c2ecf498e131ae5188ddbe6b92  gcc/testsuite/gfortran.dg/class_to_type_1.f03
  21073ee635adb08a389a867157f17f96  gcc/testsuite/gfortran.dg/class_to_type_2.f90
  c9fdcdd06c1c6e20c522e1369363b98c  gcc/testsuite/gfortran.dg/class_to_type_3.f03
*************** c567396424187bd0948b83e9c61b5979  gcc/te
*** 44749,44755 ****
  81fd1e6351c645ebf88041e29cf3bf54  gcc/testsuite/gfortran.dg/coarray_atomic_5.f90
  53606f253145ffe43df39cc61fe5aef2  gcc/testsuite/gfortran.dg/coarray_atomic_6.f90
  47af4614d0edd5061b2696b16ddcf85a  gcc/testsuite/gfortran.dg/coarray_class_1.f90
! 6fa0a1006cd787f89c84f44f3ec35a09  gcc/testsuite/gfortran.dg/coarray_collectives_1.f90
  c7ab539006f03be6ad432509119b0289  gcc/testsuite/gfortran.dg/coarray_collectives_10.f90
  a30a873aff97aee8d07f4441b69ea970  gcc/testsuite/gfortran.dg/coarray_collectives_11.f90
  a75d71135318aec398606a593707099a  gcc/testsuite/gfortran.dg/coarray_collectives_12.f90
--- 45016,45022 ----
  81fd1e6351c645ebf88041e29cf3bf54  gcc/testsuite/gfortran.dg/coarray_atomic_5.f90
  53606f253145ffe43df39cc61fe5aef2  gcc/testsuite/gfortran.dg/coarray_atomic_6.f90
  47af4614d0edd5061b2696b16ddcf85a  gcc/testsuite/gfortran.dg/coarray_class_1.f90
! 6de791f875807c75d853f11a61b02a94  gcc/testsuite/gfortran.dg/coarray_collectives_1.f90
  c7ab539006f03be6ad432509119b0289  gcc/testsuite/gfortran.dg/coarray_collectives_10.f90
  a30a873aff97aee8d07f4441b69ea970  gcc/testsuite/gfortran.dg/coarray_collectives_11.f90
  a75d71135318aec398606a593707099a  gcc/testsuite/gfortran.dg/coarray_collectives_12.f90
*************** f733c7f025390aaf3d27f0e9c2725809  gcc/te
*** 44799,44804 ****
--- 45066,45073 ----
  b2dba23fc22128a647db42769be9f272  gcc/testsuite/gfortran.dg/coindexed_1.f90
  f921a7c5a0e4098dd6b6edf4e317a4e1  gcc/testsuite/gfortran.dg/com_block_driver.f90
  2595b7b0d8e86ae62cf503bd5080ee45  gcc/testsuite/gfortran.dg/comma.f
+ ca9b384b7523fa630f1d4edff3cd4267  gcc/testsuite/gfortran.dg/comma_IO_extension_1.f90
+ 7b4fe3be18cf5d3e2bcac0b98a2191d6  gcc/testsuite/gfortran.dg/comma_IO_extension_2.f90
  b68510025102f4e42c5ab3a0ebf1b5aa  gcc/testsuite/gfortran.dg/comma_format_extension_1.f
  e9f174aaa655ec093b7c3dc075581e89  gcc/testsuite/gfortran.dg/comma_format_extension_2.f
  e38edb0e607a003fddf67b7597b40626  gcc/testsuite/gfortran.dg/comma_format_extension_3.f
*************** c26c871bf08605ce024253a49da3b53a  gcc/te
*** 44979,44984 ****
--- 45248,45254 ----
  1c4f05212f5447da65bd477a1f755ce9  gcc/testsuite/gfortran.dg/deferred_character_15.f90
  59d41c7b1a9540c60dceedddcfb4c674  gcc/testsuite/gfortran.dg/deferred_character_16.f90
  bcdb84ffa3c50231ecd967d3114134ae  gcc/testsuite/gfortran.dg/deferred_character_17.f90
+ c2d3fe3d7d640f7941cc2bc632a62dae  gcc/testsuite/gfortran.dg/deferred_character_18.f90
  4a4c8c394c686eaf43c4ce53d6803cbc  gcc/testsuite/gfortran.dg/deferred_character_2.f90
  496fec17b89042f5546165ec11d36f09  gcc/testsuite/gfortran.dg/deferred_character_3.f90
  1d0633419cdd140f8ca51872f6219b2d  gcc/testsuite/gfortran.dg/deferred_character_4.f90
*************** b697022c211753c6e3f026bc337e8683  gcc/te
*** 45053,45058 ****
--- 45323,45332 ----
  dca63cf93efe22616e44d9f46b5b1933  gcc/testsuite/gfortran.dg/dependency_43.f90
  52a475961b0e9c97d571fa626e1754b5  gcc/testsuite/gfortran.dg/dependency_44.f90
  9908775fdc0125fcca5e0250d562cdb1  gcc/testsuite/gfortran.dg/dependency_45.f90
+ 18bd6a173b22bb353c669d8ab0cbe6df  gcc/testsuite/gfortran.dg/dependency_46.f90
+ 83ed09b1543e3059e9067be926a73b31  gcc/testsuite/gfortran.dg/dependency_47.f90
+ 0b500dcd3858e049021939919e789ac4  gcc/testsuite/gfortran.dg/dependency_48.f90
+ b708a831578a6c876ea16b95695f6103  gcc/testsuite/gfortran.dg/dependency_49.f90
  bbca43e474853e196b5ef3cebb69a8c3  gcc/testsuite/gfortran.dg/dependency_5.f90
  0ac149b1aeb883fd64f93f0129019639  gcc/testsuite/gfortran.dg/dependency_6.f90
  00f6d5a2a991eed5c94bfa092755e91f  gcc/testsuite/gfortran.dg/dependency_7.f90
*************** b548bb0b7feaba31a7b00bfc777f13ec  gcc/te
*** 45355,45361 ****
  8226a4361c480063e7d5f12e2c912654  gcc/testsuite/gfortran.dg/extends_9.f03
  2e24b5c52856c87eaacc1ab507836e95  gcc/testsuite/gfortran.dg/extends_type_of_1.f03
  e2f900b7d3f108cf2755f6050abacbb5  gcc/testsuite/gfortran.dg/extends_type_of_2.f03
! 16282ed6a6dfaa23ec630501c664016c  gcc/testsuite/gfortran.dg/extends_type_of_3.f90
  df764dd66e24cfa5a1af1a03b983104b  gcc/testsuite/gfortran.dg/external_implicit_none.f90
  4eca303332980555d4132fbdc52d774a  gcc/testsuite/gfortran.dg/external_initializer.f90
  e858d42afb6c6feb41d75f84594d0e1f  gcc/testsuite/gfortran.dg/external_procedures_1.f90
--- 45629,45635 ----
  8226a4361c480063e7d5f12e2c912654  gcc/testsuite/gfortran.dg/extends_9.f03
  2e24b5c52856c87eaacc1ab507836e95  gcc/testsuite/gfortran.dg/extends_type_of_1.f03
  e2f900b7d3f108cf2755f6050abacbb5  gcc/testsuite/gfortran.dg/extends_type_of_2.f03
! 2b2e0c519730f74c1bda60dc62dc4e70  gcc/testsuite/gfortran.dg/extends_type_of_3.f90
  df764dd66e24cfa5a1af1a03b983104b  gcc/testsuite/gfortran.dg/external_implicit_none.f90
  4eca303332980555d4132fbdc52d774a  gcc/testsuite/gfortran.dg/external_initializer.f90
  e858d42afb6c6feb41d75f84594d0e1f  gcc/testsuite/gfortran.dg/external_procedures_1.f90
*************** c97065b51ddecb2dd0bed020f4e461ed  gcc/te
*** 45385,45390 ****
--- 45659,45666 ----
  8d8068df6ac24ffed1c07629391baa04  gcc/testsuite/gfortran.dg/fgetc_2.f90
  a5092dd9571c4f2b5be00428c0f86f5a  gcc/testsuite/gfortran.dg/filename_null.f90
  5131e5c566230f78ec144630a732c7a7  gcc/testsuite/gfortran.dg/filepos1.f90
+ 18131393256651d0bd551639eab3e10e  gcc/testsuite/gfortran.dg/fimplicit_none_1.f90
+ c77a0a5fc1106230319c2398b807df5c  gcc/testsuite/gfortran.dg/fimplicit_none_2.f90
  c031807c998e0243776199536a506418  gcc/testsuite/gfortran.dg/finalize_1.f08
  47d98b4d6bf4d568243f0e04b8f960e6  gcc/testsuite/gfortran.dg/finalize_10.f90
  784234f297364a91d0841e02c618213b  gcc/testsuite/gfortran.dg/finalize_11.f90
*************** eaf23174c6029667231249368fe23589  gcc/te
*** 45464,45469 ****
--- 45740,45746 ----
  5b794289929a15d260c59f382cfe8811  gcc/testsuite/gfortran.dg/fmt_t_5.f90
  9c6bd875f3fd65a51cdb51c78adfb02e  gcc/testsuite/gfortran.dg/fmt_t_6.f
  4fa11e7dddaa11d12a44f35882072dbc  gcc/testsuite/gfortran.dg/fmt_t_7.f
+ 3f87ad026e8e229565569c7c330e0a69  gcc/testsuite/gfortran.dg/fmt_t_9.f
  625bb67e826b6523c78dac865313c537  gcc/testsuite/gfortran.dg/fmt_tab_1.f90
  0b53a934fb8ae81a4e9e95e9513f6a8c  gcc/testsuite/gfortran.dg/fmt_tab_2.f90
  8ba0d4541559e2d3061e83bbc985d7bb  gcc/testsuite/gfortran.dg/fmt_tl.f
*************** f5e676182c3ece6f6ba4e0ce914c5292  gcc/te
*** 45482,45487 ****
--- 45759,45765 ----
  c285395065c37858799b8d8ab104b3d1  gcc/testsuite/gfortran.dg/forall_15.f90
  674de0e9b0693fe66b62c929b5455f39  gcc/testsuite/gfortran.dg/forall_16.f90
  8e8eb52d04f70625b3d219d75404ef60  gcc/testsuite/gfortran.dg/forall_17.f90
+ d0fbcfc827c29dc44f64559d48817278  gcc/testsuite/gfortran.dg/forall_18.f90
  52a3f13b979b92e74930c12598ca953e  gcc/testsuite/gfortran.dg/forall_2.f90
  2a37c865afb27d8a80cb1bb50744c3ac  gcc/testsuite/gfortran.dg/forall_3.f90
  bee539d260330f8ac4ac6e60f403dcc8  gcc/testsuite/gfortran.dg/forall_4.f90
*************** cafc37a00e5afe68a6324ac000be3d97  gcc/te
*** 45765,45770 ****
--- 46043,46049 ----
  70ae710349adcc430545a7b417cf2abd  gcc/testsuite/gfortran.dg/goacc/parallel-kernels-regions.f95
  90484f6fe5760420b49de86f5a625616  gcc/testsuite/gfortran.dg/goacc/parallel-tree.f95
  0137033259c36b89d8a2645a08e759e5  gcc/testsuite/gfortran.dg/goacc/parameter.f95
+ 1d8a1a9a5f7a28b0895a29c53bdd9bf9  gcc/testsuite/gfortran.dg/goacc/pr71704.f90
  7753b890b709c0e25711d5d71f9690c1  gcc/testsuite/gfortran.dg/goacc/private-1.f95
  24e251dd88a9ea6377e535f5ee5f31ed  gcc/testsuite/gfortran.dg/goacc/private-2.f95
  3dbf6ee3e166ab37549a376045135194  gcc/testsuite/gfortran.dg/goacc/private-3.f95
*************** a467591fa5a7397d62aff928d63eb0ad  gcc/te
*** 45849,45855 ****
  b7bb651884d39c2e5dce7d57d46f40a5  gcc/testsuite/gfortran.dg/gomp/free-2.f90
  76bbc2b9dfa2c387c9d8d642c2e8f1eb  gcc/testsuite/gfortran.dg/gomp/gomp.exp
  0cfd422be152bb21744cc7cfe5baf808  gcc/testsuite/gfortran.dg/gomp/intentin1.f90
! b1673181b9c53873249af351f2b5c845  gcc/testsuite/gfortran.dg/gomp/map-1.f90
  52223211c34f4dbace5e033f8243ae1f  gcc/testsuite/gfortran.dg/gomp/omp_atomic1.f90
  0e5454ac80bc199d6cf3e96e9750c33f  gcc/testsuite/gfortran.dg/gomp/omp_atomic2.f90
  5d43e477ab60e438b8824d612b24022d  gcc/testsuite/gfortran.dg/gomp/omp_clauses1.f90
--- 46128,46134 ----
  b7bb651884d39c2e5dce7d57d46f40a5  gcc/testsuite/gfortran.dg/gomp/free-2.f90
  76bbc2b9dfa2c387c9d8d642c2e8f1eb  gcc/testsuite/gfortran.dg/gomp/gomp.exp
  0cfd422be152bb21744cc7cfe5baf808  gcc/testsuite/gfortran.dg/gomp/intentin1.f90
! be152538cccb659bb8dac0eda81355e5  gcc/testsuite/gfortran.dg/gomp/map-1.f90
  52223211c34f4dbace5e033f8243ae1f  gcc/testsuite/gfortran.dg/gomp/omp_atomic1.f90
  0e5454ac80bc199d6cf3e96e9750c33f  gcc/testsuite/gfortran.dg/gomp/omp_atomic2.f90
  5d43e477ab60e438b8824d612b24022d  gcc/testsuite/gfortran.dg/gomp/omp_clauses1.f90
*************** bcd9a8c5acf05494271659304f0f0a60  gcc/te
*** 45902,45907 ****
--- 46181,46197 ----
  624512980f4f3b39deb857cfdd5fdeba  gcc/testsuite/gfortran.dg/gomp/pr62131.f90
  5d7b04ab3b84314d89ea68a7f054ea17  gcc/testsuite/gfortran.dg/gomp/pr66633.f90
  008d934abb38a4acedd9f90092aa4b6d  gcc/testsuite/gfortran.dg/gomp/pr69128.f90
+ 5a8d2190eb640c3738f51f5cbe21a0b5  gcc/testsuite/gfortran.dg/gomp/pr69183.f90
+ 1724cefc87db9a0a62b6387ee74cffc2  gcc/testsuite/gfortran.dg/gomp/pr71704.f90
+ 7d3f1abdbdd106580173760b443a9b40  gcc/testsuite/gfortran.dg/gomp/pr71705.f90
+ d07d71ded0663c9dc2e67b06e6231cfc  gcc/testsuite/gfortran.dg/gomp/pr71758.f90
+ bb35c5bd7245c0d5e4e5f3ed549e7fef  gcc/testsuite/gfortran.dg/gomp/pr77500.f90
+ 722f7db78e9c772f54ff8a774026a2f1  gcc/testsuite/gfortran.dg/gomp/pr77516.f90
+ 8688817c97ff87e4020efce6973a3d5b  gcc/testsuite/gfortran.dg/gomp/pr77665.f90
+ e5f0ff2c94fb41e447563955917d04b7  gcc/testsuite/gfortran.dg/gomp/pr77666.f90
+ 597f76dd386ee781839ef6d3ac92cd38  gcc/testsuite/gfortran.dg/gomp/pr78298.f90
+ 6ac88ac18616a41dfc1d4490ac0180ca  gcc/testsuite/gfortran.dg/gomp/pr78866-1.f90
+ 7be086a304cd4d607913bd32ad2448ca  gcc/testsuite/gfortran.dg/gomp/pr78866-2.f90
  b4be3f9de7631846875a711ae9b67293  gcc/testsuite/gfortran.dg/gomp/proc_ptr_1.f90
  87885556568e657ef4c936c53e1c7305  gcc/testsuite/gfortran.dg/gomp/proc_ptr_2.f90
  59e444df8ec8f5ea9859b5aef4d75865  gcc/testsuite/gfortran.dg/gomp/reduction1.f90
*************** cec7b350b054a17b7f0b5726d4a21711  gcc/te
*** 45981,45987 ****
  5754b3cf46378cb45f6e5a1d41b0cd4a  gcc/testsuite/gfortran.dg/graphite/pr37852.f90
  d056a2044b7a3f7f763fe76fad38958d  gcc/testsuite/gfortran.dg/graphite/pr37857.f90
  39980079ddf92937d334ad4fa7d63b74  gcc/testsuite/gfortran.dg/graphite/pr37980.f90
! 9fd92c1b4b047e3ecad9e87cacd557e5  gcc/testsuite/gfortran.dg/graphite/pr38083.f90
  2f361e4dc036f2a777b5340709d7cbad  gcc/testsuite/gfortran.dg/graphite/pr38459.f90
  68989e2f56ab16cebeffc96df65b3c7d  gcc/testsuite/gfortran.dg/graphite/pr38953.f90
  c5c4a63aba69d822a86d91f0242eb7c9  gcc/testsuite/gfortran.dg/graphite/pr39516.f
--- 46271,46277 ----
  5754b3cf46378cb45f6e5a1d41b0cd4a  gcc/testsuite/gfortran.dg/graphite/pr37852.f90
  d056a2044b7a3f7f763fe76fad38958d  gcc/testsuite/gfortran.dg/graphite/pr37857.f90
  39980079ddf92937d334ad4fa7d63b74  gcc/testsuite/gfortran.dg/graphite/pr37980.f90
! 5d9ba2a3b15bd5a5d3fec321b23e780b  gcc/testsuite/gfortran.dg/graphite/pr38083.f90
  2f361e4dc036f2a777b5340709d7cbad  gcc/testsuite/gfortran.dg/graphite/pr38459.f90
  68989e2f56ab16cebeffc96df65b3c7d  gcc/testsuite/gfortran.dg/graphite/pr38953.f90
  c5c4a63aba69d822a86d91f0242eb7c9  gcc/testsuite/gfortran.dg/graphite/pr39516.f
*************** a9d76d71bfd312f4638121eef4a5b755  gcc/te
*** 46012,46018 ****
  f49e90e6478af8a81f9217414f29fd9c  gcc/testsuite/gfortran.dg/graphite/vect-pr40979.f90
  f9932e22f4bc6baa989154035dbac7c1  gcc/testsuite/gfortran.dg/guality/arg1.f90
  49b421794f66b18bf7f66026f68f035f  gcc/testsuite/gfortran.dg/guality/guality.exp
! 34aa3a6f198ba5d265275076a07dbf9a  gcc/testsuite/gfortran.dg/guality/pr41558.f90
  85b827d8051a3d9581ba2a6e6709d5c9  gcc/testsuite/gfortran.dg/hollerith.f90
  855af7807ad9d75aef7ff85c2859a0c2  gcc/testsuite/gfortran.dg/hollerith2.f90
  ac7abff09db32e7d44719f0d0472dc64  gcc/testsuite/gfortran.dg/hollerith3.f90
--- 46302,46308 ----
  f49e90e6478af8a81f9217414f29fd9c  gcc/testsuite/gfortran.dg/graphite/vect-pr40979.f90
  f9932e22f4bc6baa989154035dbac7c1  gcc/testsuite/gfortran.dg/guality/arg1.f90
  49b421794f66b18bf7f66026f68f035f  gcc/testsuite/gfortran.dg/guality/guality.exp
! d4523e218e3a6d976774e7e026bca339  gcc/testsuite/gfortran.dg/guality/pr41558.f90
  85b827d8051a3d9581ba2a6e6709d5c9  gcc/testsuite/gfortran.dg/hollerith.f90
  855af7807ad9d75aef7ff85c2859a0c2  gcc/testsuite/gfortran.dg/hollerith2.f90
  ac7abff09db32e7d44719f0d0472dc64  gcc/testsuite/gfortran.dg/hollerith3.f90
*************** d7dcbbbf51853a9d7416a34ec7d5e19b  gcc/te
*** 46066,46071 ****
--- 46356,46362 ----
  ff6483fe1d08d736f63b71ce2d35d964  gcc/testsuite/gfortran.dg/ieee/ieee_7.f90
  bfd28208c7b1f6a5bf27d778e77b30a1  gcc/testsuite/gfortran.dg/ieee/intrinsics_1.f90
  5b4c9cca5fe34ca3db33f17cc3b0ae09  gcc/testsuite/gfortran.dg/ieee/intrinsics_2.F90
+ d19c8b732b5cf70aa6edcc4165fe30b3  gcc/testsuite/gfortran.dg/ieee/pr77507.f90
  817bcd68ef086363a121829f06905660  gcc/testsuite/gfortran.dg/ieee/rounding_1.f90
  7dc8b356113d0ea92e104407ded23209  gcc/testsuite/gfortran.dg/ieee/underflow_1.f90
  d827b941652feab002a335b27a4dd9f2  gcc/testsuite/gfortran.dg/imag_1.f
*************** fe4f5eeb546eda9f57d05796db3291be  gcc/te
*** 46188,46193 ****
--- 46479,46485 ----
  a85d9b173509ec81f0e8eea4f903aedf  gcc/testsuite/gfortran.dg/inquire_14.f90
  83afca5041b4e1bc04aa54f0efed9e5a  gcc/testsuite/gfortran.dg/inquire_15.f90
  44cdb6f6eed5f646190e5ec3eb4b5886  gcc/testsuite/gfortran.dg/inquire_16.f90
+ 709b7d5db0659cf45b4d7a89c9c7e176  gcc/testsuite/gfortran.dg/inquire_17.f90
  46381b0ac618fd43b13d9fe6a0683198  gcc/testsuite/gfortran.dg/inquire_5.f90
  416611b673267dc72f7c7b52abfa5158  gcc/testsuite/gfortran.dg/inquire_6.f90
  8283bb4be36f05c63ad546fdd62f3531  gcc/testsuite/gfortran.dg/inquire_7.f90
*************** ba5ca4bc88cb0228b15a134fc77b011f  gcc/te
*** 46207,46213 ****
  fa2faf183145bf87d1497a8e18cf67c2  gcc/testsuite/gfortran.dg/integer_exponentiation_3.F90
  901fdf8ccfce7240b5e2cfa3f7fcb07c  gcc/testsuite/gfortran.dg/integer_exponentiation_4.f90
  ebd2c7181d1d1a74fb8d92fa4d5dcadf  gcc/testsuite/gfortran.dg/integer_exponentiation_5.F90
! fcfb49c9fc1a86ba81cd5f03602cd781  gcc/testsuite/gfortran.dg/integer_exponentiation_6.F90
  f12f73c690278c3c3bdcebfa2a843dfa  gcc/testsuite/gfortran.dg/intent_optimize_1.f90
  6ad3133cfe62e722e018d386dbfd3404  gcc/testsuite/gfortran.dg/intent_out_1.f90
  56f012500f1600964f96a00b144bd1bb  gcc/testsuite/gfortran.dg/intent_out_2.f90
--- 46499,46505 ----
  fa2faf183145bf87d1497a8e18cf67c2  gcc/testsuite/gfortran.dg/integer_exponentiation_3.F90
  901fdf8ccfce7240b5e2cfa3f7fcb07c  gcc/testsuite/gfortran.dg/integer_exponentiation_4.f90
  ebd2c7181d1d1a74fb8d92fa4d5dcadf  gcc/testsuite/gfortran.dg/integer_exponentiation_5.F90
! 5436c9710c4dbacc08026642a5d88b2d  gcc/testsuite/gfortran.dg/integer_exponentiation_6.F90
  f12f73c690278c3c3bdcebfa2a843dfa  gcc/testsuite/gfortran.dg/intent_optimize_1.f90
  6ad3133cfe62e722e018d386dbfd3404  gcc/testsuite/gfortran.dg/intent_out_1.f90
  56f012500f1600964f96a00b144bd1bb  gcc/testsuite/gfortran.dg/intent_out_2.f90
*************** cda7326b348930cf4a6bae1122ef6b01  gcc/te
*** 46317,46323 ****
  d45379bc70cd62e1018f6a89d6d3dc32  gcc/testsuite/gfortran.dg/intrinsic_intent_1.f03
  fa319bdd335ad2c9c2a50fa4627455cd  gcc/testsuite/gfortran.dg/intrinsic_intkinds_1.f90
  90b3155638c5685439fb666f6912408c  gcc/testsuite/gfortran.dg/intrinsic_modulo_1.f90
! 2e668f5f8ed611e1726a4f7dc6a6609b  gcc/testsuite/gfortran.dg/intrinsic_numeric_arg.f
  bbe577fd068c3156ebf6e56c01cf4a83  gcc/testsuite/gfortran.dg/intrinsic_optional_char_arg_1.f90
  09e46ae239bc513dd67f9fa8c76e39ad  gcc/testsuite/gfortran.dg/intrinsic_pack_1.f90
  fe865725bfa3323563a596d77f333f3f  gcc/testsuite/gfortran.dg/intrinsic_pack_2.f90
--- 46609,46615 ----
  d45379bc70cd62e1018f6a89d6d3dc32  gcc/testsuite/gfortran.dg/intrinsic_intent_1.f03
  fa319bdd335ad2c9c2a50fa4627455cd  gcc/testsuite/gfortran.dg/intrinsic_intkinds_1.f90
  90b3155638c5685439fb666f6912408c  gcc/testsuite/gfortran.dg/intrinsic_modulo_1.f90
! 9ecac424cdaf840622239656867130dd  gcc/testsuite/gfortran.dg/intrinsic_numeric_arg.f
  bbe577fd068c3156ebf6e56c01cf4a83  gcc/testsuite/gfortran.dg/intrinsic_optional_char_arg_1.f90
  09e46ae239bc513dd67f9fa8c76e39ad  gcc/testsuite/gfortran.dg/intrinsic_pack_1.f90
  fe865725bfa3323563a596d77f333f3f  gcc/testsuite/gfortran.dg/intrinsic_pack_2.f90
*************** f7a6d95010c982f683429c683e7cf5f0  gcc/te
*** 46753,46758 ****
--- 47045,47051 ----
  e1d9529615ee393bcd26c894368a6218  gcc/testsuite/gfortran.dg/namelist_86.f90
  fec7274f12ad58ba111ee97c209eab90  gcc/testsuite/gfortran.dg/namelist_87.f90
  ca386a76e9a345aefe2a4fb9e5c66ed8  gcc/testsuite/gfortran.dg/namelist_88.f90
+ 5aaf8fc3255579614c27bdf43512d3fc  gcc/testsuite/gfortran.dg/namelist_90.f
  b8f12d194aa9b2cfb5214297f897456c  gcc/testsuite/gfortran.dg/namelist_assumed_char.f90
  73de646ecd69b0bf965fecc1ccd64052  gcc/testsuite/gfortran.dg/namelist_blockdata.f
  069dbff7c2c727c922c2a492f0feb75e  gcc/testsuite/gfortran.dg/namelist_char_only.f90
*************** e5fa40276b7e0de18f35bf0ad1ffb8bc  gcc/te
*** 46830,46835 ****
--- 47123,47129 ----
  e67abf33c2578358a5d5bab3e11f00e9  gcc/testsuite/gfortran.dg/null_6.f90
  4f1c65ac34bcf6b5e6d3fa579b4e5be7  gcc/testsuite/gfortran.dg/null_7.f90
  a268bf435ff3e542009031168b6619a0  gcc/testsuite/gfortran.dg/null_8.f90
+ ec5957a6e0e29cbef74656afc663b247  gcc/testsuite/gfortran.dg/null_9.f90
  fb9d6abbd9b9049c00ee6e992d1a8859  gcc/testsuite/gfortran.dg/null_actual.f90
  eb6af590881f3e995fc6b2c78089f277  gcc/testsuite/gfortran.dg/nullify_1.f
  f202e3843710f9492560538fa53c3847  gcc/testsuite/gfortran.dg/nullify_2.f90
*************** ef168d64f89feac76b2e6a32df0ca37b  gcc/te
*** 47187,47194 ****
--- 47481,47490 ----
  f5878abe544570f500d4148c17a74cc4  gcc/testsuite/gfortran.dg/pr59440-3.f90
  4d2d4770d539b54391d7391e2ff84899  gcc/testsuite/gfortran.dg/pr59700.f90
  896a650820f1e92f30e2b2e4435e6335  gcc/testsuite/gfortran.dg/pr59706.f90
+ 31f41b11c36de9a6e9353abe63042a24  gcc/testsuite/gfortran.dg/pr59910.f90
  649ea9d3e6b33e6ac70422c5becd7c00  gcc/testsuite/gfortran.dg/pr60126.f90
  d03f1dd77bd6dee9a89da7373579df73  gcc/testsuite/gfortran.dg/pr61209.f90
+ 42d2f6829d59339ccc9ed3c123a5fc25  gcc/testsuite/gfortran.dg/pr61318.f90
  fce6bb3e21f230d6e3cee74cb2b4e71d  gcc/testsuite/gfortran.dg/pr61335.f90
  6dedb63c784b5018b208a0535bbce9a1  gcc/testsuite/gfortran.dg/pr61454.f90
  2c95c461b017b811d75f842a5f254b83  gcc/testsuite/gfortran.dg/pr61669.f90
*************** c0ada255b8d4b02a2bf3f62ec3fd9223  gcc/te
*** 47243,47252 ****
--- 47539,47583 ----
  53367d2d1c3060e4cca1dbeebef89967  gcc/testsuite/gfortran.dg/pr68318_1.f90
  b3ef2aaf4796b96c50079acc822669c9  gcc/testsuite/gfortran.dg/pr68318_2.f90
  94426d6f9de03e56102a32084142c32c  gcc/testsuite/gfortran.dg/pr68319.f90
+ 2f9568ad37c56b0f20f67f32b2afa76c  gcc/testsuite/gfortran.dg/pr68566.f90
  b9749045f7e8d01ce770bef143077398  gcc/testsuite/gfortran.dg/pr69055.f90
+ af40f4dedd6541b74e692dc2ab3d113d  gcc/testsuite/gfortran.dg/pr69514_1.f90
+ a76232d35f35517cbd958d99d1ca3975  gcc/testsuite/gfortran.dg/pr69514_2.f90
  68938073de3c2383615f40d0ec615519  gcc/testsuite/gfortran.dg/pr69603.f90
+ ad1c20f5706de185c8d1a0e845e5710d  gcc/testsuite/gfortran.dg/pr69867.f90
+ 29610fdfa7dcc34c2dbc61b21af1103e  gcc/testsuite/gfortran.dg/pr69962.f90
+ 5a944c3b5c5553f279b49a5886af1f27  gcc/testsuite/gfortran.dg/pr70006.f90
+ 7f656e5a6d13d6ab788f5c3e8fb90572  gcc/testsuite/gfortran.dg/pr70040.f90
+ 23dc11b0707086a8168e76c17d13d620  gcc/testsuite/gfortran.dg/pr70673.f90
  0e424f05f2fdeb786b877ace2617112d  gcc/testsuite/gfortran.dg/pr70931.f90
+ 2adcf4116aa4365895bb3d287e182ddd  gcc/testsuite/gfortran.dg/pr71067_1.f90
+ 17102b0b3177b5b5beb36730bd460100  gcc/testsuite/gfortran.dg/pr71067_2.f90
  75b8abd1f0f9d2e236605ecc6792b9fb  gcc/testsuite/gfortran.dg/pr71204.f90
+ dffe49f90e191f0e0d1a1c6f8d53f854  gcc/testsuite/gfortran.dg/pr71688.f90
+ 1aa045033f7cb52ec480e9dcc3daf999  gcc/testsuite/gfortran.dg/pr71730.f90
+ ea322d8eb84f224e47f5c54a96e8cd2d  gcc/testsuite/gfortran.dg/pr71764.f90
+ 71aa02c8e336e26a15cc65118a5c7776  gcc/testsuite/gfortran.dg/pr71799.f90
+ 47c2b1d1e6313ea63cccc86bf3e3641a  gcc/testsuite/gfortran.dg/pr71859.f90
+ a5f4703aabb6d4a57c3b221a398aae60  gcc/testsuite/gfortran.dg/pr71883.f90
+ ea6f420ce4d3bbc8e6c948a8f185ace7  gcc/testsuite/gfortran.dg/pr71895.f90
+ 000ce2c7042160052125874cc82a4790  gcc/testsuite/gfortran.dg/pr77260_1.f90
+ e0d908d5f885bc381038df323bdf79ed  gcc/testsuite/gfortran.dg/pr77260_2.f90
+ ab680d2f6cc0648921a054114a485973  gcc/testsuite/gfortran.dg/pr77351.f90
+ 0e6eddcfc83690ffde7c6675dbaf7f56  gcc/testsuite/gfortran.dg/pr77380.f90
+ c80f60155bcb84d08e36147df56ee2a7  gcc/testsuite/gfortran.dg/pr77391.f90
+ 273708f3f44a1085948126b236c9f875  gcc/testsuite/gfortran.dg/pr77420_1.f90
+ 85915b4b10039334da3368e57192ff34  gcc/testsuite/gfortran.dg/pr77420_2.f90
+ e88169f0671cbd27372fc637327b8b76  gcc/testsuite/gfortran.dg/pr77420_3.f90
+ 260e188355d107cc59e00853573d2426  gcc/testsuite/gfortran.dg/pr77420_4.f90
+ b41dce20e2213fb234886325f924905e  gcc/testsuite/gfortran.dg/pr77460.f90
+ 7ac13d0d1a6ccb282debcd0ac4bf69fd  gcc/testsuite/gfortran.dg/pr77506.f90
+ a99d6d5592ea6b962b6a45223a22a17f  gcc/testsuite/gfortran.dg/pr77612.f90
+ a0e0cbaff470d13a9247b4f6f66572d6  gcc/testsuite/gfortran.dg/pr77694.f90
+ 4fd680a925c1f4e38d7234b314567aa4  gcc/testsuite/gfortran.dg/pr77978_1.f90
+ 6c1eb527a1773bb547e0372dd833482b  gcc/testsuite/gfortran.dg/pr77978_2.f90
+ a997ec96c9e5b5703664c90f0b844fe1  gcc/testsuite/gfortran.dg/pr77978_3.f90
+ 38417bf1cb92bb7d70724f9be2c325ca  gcc/testsuite/gfortran.dg/pr78279.f90
+ c8893a59741e05d503a560b19c9684a9  gcc/testsuite/gfortran.dg/pr78297.f90
  6ff99f4b0021f30bee039a61db7cba9d  gcc/testsuite/gfortran.dg/predcom-1.f
  20a411a7e5a57891297c4c6a96d92009  gcc/testsuite/gfortran.dg/predcom-2.f
  80cf60710448ac2378aecda5fc4a57b6  gcc/testsuite/gfortran.dg/present_1.f90
*************** b56e9f2b05e65e28487a8445ef02657c  gcc/te
*** 47346,47351 ****
--- 47677,47683 ----
  3112dbb40c03404d9c8244c53b09b776  gcc/testsuite/gfortran.dg/proc_ptr_45.f90
  fbfcfdd0751320bb90e2488052dfe7de  gcc/testsuite/gfortran.dg/proc_ptr_46.f90
  81e72e4ab4eb9b9c94a4c6b8c55d5ea5  gcc/testsuite/gfortran.dg/proc_ptr_47.f90
+ a50ed014f3fd628f8e8e8e09f44f8c0f  gcc/testsuite/gfortran.dg/proc_ptr_49.f90
  8315cc72db332168e57edf018a4b8f1f  gcc/testsuite/gfortran.dg/proc_ptr_5.f90
  2e1358865c3ec02c3c45568f5eebb128  gcc/testsuite/gfortran.dg/proc_ptr_6.f90
  3648c097522ae5858550c7d7776afd28  gcc/testsuite/gfortran.dg/proc_ptr_7.c
*************** d93a9e353ffa27762f707c539093d6ce  gcc/te
*** 47395,47401 ****
--- 47727,47735 ----
  7e0250e09f1d6fd62c3c197b85915c43  gcc/testsuite/gfortran.dg/proc_ptr_comp_43.f90
  72f01172bd92b8cb8853693a0a79310d  gcc/testsuite/gfortran.dg/proc_ptr_comp_44.f90
  c7c6f9039ee8a7d60608874366e1f0e6  gcc/testsuite/gfortran.dg/proc_ptr_comp_45.f90
+ c75d4858dc637cf3362d7fd34a2b2c12  gcc/testsuite/gfortran.dg/proc_ptr_comp_49.f90
  9440b7a38d0f8e2941673b44554c91fe  gcc/testsuite/gfortran.dg/proc_ptr_comp_5.f90
+ 301350ead67fb8e45886f0d873e81b06  gcc/testsuite/gfortran.dg/proc_ptr_comp_50.f90
  6347d321213f9347afa49d4354eb67f7  gcc/testsuite/gfortran.dg/proc_ptr_comp_6.f90
  f41c3a8af3a63f5aef54c294fa8cd9c5  gcc/testsuite/gfortran.dg/proc_ptr_comp_7.f90
  a43898fbcd332118da14c8be5eec75b3  gcc/testsuite/gfortran.dg/proc_ptr_comp_8.f90
*************** e7c2d02458f702cc0b7a63dc66256cd9  gcc/te
*** 47529,47534 ****
--- 47863,47869 ----
  c4ab590e1a84db0ed7c686c504deea8d  gcc/testsuite/gfortran.dg/realloc_on_assign_23.f90
  7c2988bf2d788d39fc96e4716d3fa82e  gcc/testsuite/gfortran.dg/realloc_on_assign_24.f90
  6da090aaff0dee1f6b557a0ebdf387d1  gcc/testsuite/gfortran.dg/realloc_on_assign_25.f90
+ 77311ad18cfec3fcffefaedf658436db  gcc/testsuite/gfortran.dg/realloc_on_assign_26.f90
  10876d611fdffc7b6cf97c8e1abf90b2  gcc/testsuite/gfortran.dg/realloc_on_assign_3.f03
  f49b54ba1324c9645d5ab321e82b6873  gcc/testsuite/gfortran.dg/realloc_on_assign_4.f03
  600455d0e569cd93d229832b42ef84a2  gcc/testsuite/gfortran.dg/realloc_on_assign_5.f03
*************** e4078fcf84bae622e034eda4e4a7bd1b  gcc/te
*** 47689,47694 ****
--- 48024,48030 ----
  0fa3636ab8c629eaf962c9d4116c05fb  gcc/testsuite/gfortran.dg/select_type_32.f90
  65d1bc4754dda94ab063cc52f230bad4  gcc/testsuite/gfortran.dg/select_type_33.f03
  8400e196604f257ef8d8e9269bae6945  gcc/testsuite/gfortran.dg/select_type_34.f90
+ d0d3f92f35bb90787623ca24c03d4429  gcc/testsuite/gfortran.dg/select_type_35.f03
  402dd7c959e0269e964ee68c701dfb67  gcc/testsuite/gfortran.dg/select_type_4.f90
  3ab901522e5a6c2930daa42a08c5a4c3  gcc/testsuite/gfortran.dg/select_type_5.f03
  08871f191c3a23bf7de4d00e2c1959a3  gcc/testsuite/gfortran.dg/select_type_6.f03
*************** c82e3d4ced9692fe4990fecf9df45032  gcc/te
*** 47808,47813 ****
--- 48144,48150 ----
  1c47ac1ad9850bdd467c47a14971211e  gcc/testsuite/gfortran.dg/string_ctor_1.f90
  b1f748dc53cd2b4d995595954b8f1b1c  gcc/testsuite/gfortran.dg/string_length_1.f90
  787d84b84ac7cdaa67b10d6cbb2c2b69  gcc/testsuite/gfortran.dg/string_length_2.f90
+ 99908b0af6994996f1c93547721b5740  gcc/testsuite/gfortran.dg/string_length_3.f90
  f664c3c8552e12e2a8d7f4d3566f9877  gcc/testsuite/gfortran.dg/string_null_compare_1.f
  230f3ac65d829fdd4d14a340c2dcc070  gcc/testsuite/gfortran.dg/string_pad_trunc.f90
  4682a1485627795a4c59238a19670fbb  gcc/testsuite/gfortran.dg/structure_constructor_1.f03
*************** d2dc7256f9f6b0f1b0f453193aa85a1e  gcc/te
*** 47912,47917 ****
--- 48249,48255 ----
  6506a123d51822842dbe5e02506d47b2  gcc/testsuite/gfortran.dg/type_decl_1.f90
  c0cc1239e52334af5a04ed643213a49a  gcc/testsuite/gfortran.dg/type_decl_2.f90
  2c63f395713929a496928e4aff896804  gcc/testsuite/gfortran.dg/type_decl_3.f90
+ c914c554b6efc28d2508d046a68ecb4e  gcc/testsuite/gfortran.dg/type_decl_4.f90
  ff2f764b4ce4d63b5d7f275525c26c9f  gcc/testsuite/gfortran.dg/type_is_1.f90
  b6b351a9a6361cfeabc7ee30143ed4ad  gcc/testsuite/gfortran.dg/type_to_class_1.f03
  37644b30f4d8b85311b58a66b1a032ca  gcc/testsuite/gfortran.dg/type_to_class_2.f03
*************** e037876e10ff67588872661e14eb5fe3  gcc/te
*** 48020,48025 ****
--- 48358,48364 ----
  a0d15cb58d5be89e3ac3346c05d54cde  gcc/testsuite/gfortran.dg/typebound_proc_31.f90
  535243935a3e86462ce476cfcbe5e3cf  gcc/testsuite/gfortran.dg/typebound_proc_32.f90
  4b72996d3d40cfba872c79978844e194  gcc/testsuite/gfortran.dg/typebound_proc_33.f90
+ e97979b0f8627009589defb1d5445a99  gcc/testsuite/gfortran.dg/typebound_proc_35.f90
  5a85f8e544f2db7331aec686a5caf7ee  gcc/testsuite/gfortran.dg/typebound_proc_4.f03
  a7d68db5c429562164ea47edc8677d14  gcc/testsuite/gfortran.dg/typebound_proc_5.f03
  2bba47d31700cbba32684f0f2e15c7bc  gcc/testsuite/gfortran.dg/typebound_proc_6.f03
*************** c3ddd813e72b606d44cdfd47616fff95  gcc/te
*** 48262,48268 ****
  34c261a55c7392e9ef695c645bb69cdc  gcc/testsuite/gfortran.dg/warn_std_3.f90
  236f4177fe831ff31ad3388fde56d3a7  gcc/testsuite/gfortran.dg/warn_target_lifetime_1.f90
  10c0140b52dfb08b0d4c05279aec231b  gcc/testsuite/gfortran.dg/warn_target_lifetime_2.f90
! 800aafcb3c3ed159b7bce10c0bd7cb2b  gcc/testsuite/gfortran.dg/warn_target_lifetime_3.f90
  faef1baec47674d096569b4803422d64  gcc/testsuite/gfortran.dg/warn_unused_dummy_argument_1.f90
  9cdfca84c19b8b4bfd5f9be4a921f068  gcc/testsuite/gfortran.dg/warn_unused_dummy_argument_2.f90
  62c8995bb923620e3509b9bd179b618c  gcc/testsuite/gfortran.dg/warn_unused_dummy_argument_3.f90
--- 48601,48608 ----
  34c261a55c7392e9ef695c645bb69cdc  gcc/testsuite/gfortran.dg/warn_std_3.f90
  236f4177fe831ff31ad3388fde56d3a7  gcc/testsuite/gfortran.dg/warn_target_lifetime_1.f90
  10c0140b52dfb08b0d4c05279aec231b  gcc/testsuite/gfortran.dg/warn_target_lifetime_2.f90
! e6acf6c0973fa26724b28e6ea1651bdb  gcc/testsuite/gfortran.dg/warn_target_lifetime_3.f90
! 2ece2210488f4ed099be674644f83ed0  gcc/testsuite/gfortran.dg/warn_target_lifetime_4.f90
  faef1baec47674d096569b4803422d64  gcc/testsuite/gfortran.dg/warn_unused_dummy_argument_1.f90
  9cdfca84c19b8b4bfd5f9be4a921f068  gcc/testsuite/gfortran.dg/warn_unused_dummy_argument_2.f90
  62c8995bb923620e3509b9bd179b618c  gcc/testsuite/gfortran.dg/warn_unused_dummy_argument_3.f90
*************** e82dfc5497ff6edd4197a823d1a6ed2f  gcc/te
*** 48284,48289 ****
--- 48624,48631 ----
  e2dd8115622860575ce72139d603a847  gcc/testsuite/gfortran.dg/where_2.f90
  3516e7a52673173d6551f02dca2c1f39  gcc/testsuite/gfortran.dg/where_3.f90
  4179a357d57c03402f3b139d65faa997  gcc/testsuite/gfortran.dg/where_4.f90
+ 182a4bf9b505e389529f505ad87bcede  gcc/testsuite/gfortran.dg/where_5.f90
+ 1d287cc9e958f47ab705383330836258  gcc/testsuite/gfortran.dg/where_6.f90
  355f71857e4d70eec2b706ae1ab82a95  gcc/testsuite/gfortran.dg/where_nested_1.f90
  9ed3fb7c28651e33f2d22957e7ad8da6  gcc/testsuite/gfortran.dg/where_operator_assign_1.f90
  e065fb63b7634d2874e6ce1fb7f3c610  gcc/testsuite/gfortran.dg/where_operator_assign_2.f90
*************** c27c40295b5b2f36efed49db8c2db03d  gcc/te
*** 48854,48859 ****
--- 49196,49202 ----
  3a730714e4c3a60b9772fac2b31dd88a  gcc/testsuite/gnat.dg/atomic6_pkg.ads
  16c10ef2b56763079ce902fa8a6be517  gcc/testsuite/gnat.dg/atomic8.adb
  3a29826c9a71b419b0c2323869c82f42  gcc/testsuite/gnat.dg/bad_array.adb
+ aae39b549f5bb7a2b837495c637aaa94  gcc/testsuite/gnat.dg/biased_subtype.adb
  9bbc182ee19d36c4abbd7d6046ac5664  gcc/testsuite/gnat.dg/biased_uc.adb
  faf4a0c852ea85d2eab4ec4413be5fba  gcc/testsuite/gnat.dg/bip_aggregate_bug.adb
  6044ac207f7472a4725aeb0f351b7051  gcc/testsuite/gnat.dg/bip_prim_func.adb
*************** fd22c732c21e91285f5ea42a557f1f49  gcc/te
*** 49248,49253 ****
--- 49591,49599 ----
  1b643fb3739678632ebe4630a04230df  gcc/testsuite/gnat.dg/loop_optimization18_pkg.ads
  f541e6bfbb5ebc32c8c88b9475f024d2  gcc/testsuite/gnat.dg/loop_optimization2.adb
  c127785f315390b699c7fa039c495c81  gcc/testsuite/gnat.dg/loop_optimization2.ads
+ 5ca0d17cca59c53807e5c7d2a3068310  gcc/testsuite/gnat.dg/loop_optimization23.adb
+ df5553454da09f33ff8096bbd9239d7f  gcc/testsuite/gnat.dg/loop_optimization23_pkg.adb
+ cf019b8f607e5bc1ba11cbef1df535c9  gcc/testsuite/gnat.dg/loop_optimization23_pkg.ads
  5e481abfdb92dddf7569d6c4d76c865f  gcc/testsuite/gnat.dg/loop_optimization3.adb
  578b49122b45d68bcca85ccfda38435f  gcc/testsuite/gnat.dg/loop_optimization3_pkg.adb
  2daefc09b2855fc2ec65dad098246f1f  gcc/testsuite/gnat.dg/loop_optimization3_pkg.ads
*************** db1f6b82d662e78fa1b88b4ed3fb6ee4  gcc/te
*** 49473,49478 ****
--- 49819,49825 ----
  3d44b5cac38d62a85266069665682f5d  gcc/testsuite/gnat.dg/opt5.adb
  e5e7ff61479fbeb7973786d07f72ba84  gcc/testsuite/gnat.dg/opt6.adb
  87097de987361854f4c5179a6de42c2c  gcc/testsuite/gnat.dg/opt6.ads
+ 05b2d9ff3364801eae257251792ddd49  gcc/testsuite/gnat.dg/opt63.adb
  a441d166cc0d4b34342468308b350060  gcc/testsuite/gnat.dg/opt7.adb
  8ea613067c21d3bbf860fb8bb4013c79  gcc/testsuite/gnat.dg/opt7.ads
  81951fc84d3d36131be8aca4f80c113b  gcc/testsuite/gnat.dg/opt7_pkg.ads
*************** e06de9a11cbeb2ddc0612001c1933fdd  gcc/te
*** 51250,51256 ****
  6e643feacf8db3458a4d6e8e64dc79a2  gcc/testsuite/lib/gcc-gdb-test.exp
  ad7d745c5dbf5092c97d72e0e4fe30fa  gcc/testsuite/lib/gcc-simulate-thread.exp
  64b7d9e1e766ac7334d0a3b7fdf42d43  gcc/testsuite/lib/gcc.exp
! 0116fd37fb9d84a3bbedcbaecf4b44fb  gcc/testsuite/lib/gcov.exp
  3004916b628274ad3e5d83b5d49ab697  gcc/testsuite/lib/gfortran-dg.exp
  0bf1be2e7b4255e1f5dee134c8c0827e  gcc/testsuite/lib/gfortran.exp
  6ca9dc2d5d074129cdee174b3aebda49  gcc/testsuite/lib/gnat-dg.exp
--- 51597,51603 ----
  6e643feacf8db3458a4d6e8e64dc79a2  gcc/testsuite/lib/gcc-gdb-test.exp
  ad7d745c5dbf5092c97d72e0e4fe30fa  gcc/testsuite/lib/gcc-simulate-thread.exp
  64b7d9e1e766ac7334d0a3b7fdf42d43  gcc/testsuite/lib/gcc.exp
! 8fdb38890fceb66b6363d8808abebb30  gcc/testsuite/lib/gcov.exp
  3004916b628274ad3e5d83b5d49ab697  gcc/testsuite/lib/gfortran-dg.exp
  0bf1be2e7b4255e1f5dee134c8c0827e  gcc/testsuite/lib/gfortran.exp
  6ca9dc2d5d074129cdee174b3aebda49  gcc/testsuite/lib/gnat-dg.exp
*************** c54ca31ae71a78f54aedce70fdefdb94  gcc/te
*** 51278,51284 ****
  3326d5b2fe3470fc2f28624e149b110d  gcc/testsuite/lib/scantree.exp
  d48e7bf65e56a3ceb35bc0375451b088  gcc/testsuite/lib/target-libpath.exp
  f65311b4bdf7a8c2a72c6444d35a9a03  gcc/testsuite/lib/target-supports-dg.exp
! b630987467fdf586142ff4aeb8d08248  gcc/testsuite/lib/target-supports.exp
  f417379063d9ca3e2d5de200bdbaea83  gcc/testsuite/lib/target-utils.exp
  1cd569154317cc35dbb2d75d36e0d897  gcc/testsuite/lib/timeout-dg.exp
  9603570719708c5c2e637053a9efa25d  gcc/testsuite/lib/timeout.exp
--- 51625,51631 ----
  3326d5b2fe3470fc2f28624e149b110d  gcc/testsuite/lib/scantree.exp
  d48e7bf65e56a3ceb35bc0375451b088  gcc/testsuite/lib/target-libpath.exp
  f65311b4bdf7a8c2a72c6444d35a9a03  gcc/testsuite/lib/target-supports-dg.exp
! e7ddc1d1b301a640284878360a3d371e  gcc/testsuite/lib/target-supports.exp
  f417379063d9ca3e2d5de200bdbaea83  gcc/testsuite/lib/target-utils.exp
  1cd569154317cc35dbb2d75d36e0d897  gcc/testsuite/lib/timeout-dg.exp
  9603570719708c5c2e637053a9efa25d  gcc/testsuite/lib/timeout.exp
*************** a57e521085412bbde60e78229ace4fd5  gcc/te
*** 52226,52232 ****
  02def33a82a56a833dbb9c81b36b4fe6  gcc/timevar.def
  39583dacf15fae594898b65a054da27f  gcc/timevar.h
  610597527691a71e6efbabe2eb667519  gcc/tlink.c
! d35abdc27940e320bb4ab78e72e993a0  gcc/toplev.c
  c3e9cb4d79158c9d4373bf9f04b642a2  gcc/toplev.h
  88d47eb6984b1c342e82e3a075dee56e  gcc/tracer.c
  beeb838b6a8b1de3d650f8a6473c851f  gcc/trans-mem.c
--- 52573,52579 ----
  02def33a82a56a833dbb9c81b36b4fe6  gcc/timevar.def
  39583dacf15fae594898b65a054da27f  gcc/timevar.h
  610597527691a71e6efbabe2eb667519  gcc/tlink.c
! f1b9c7911ab550bce8c9323183428d6b  gcc/toplev.c
  c3e9cb4d79158c9d4373bf9f04b642a2  gcc/toplev.h
  88d47eb6984b1c342e82e3a075dee56e  gcc/tracer.c
  beeb838b6a8b1de3d650f8a6473c851f  gcc/trans-mem.c
*************** f242bcc9e019bd65499ed02bbdc04207  gcc/tr
*** 52235,52253 ****
  6dfe265c99c28bf824e45cc0e928d6d4  gcc/tree-affine.h
  60574cf7cbc2685ed641d917a92bbeba  gcc/tree-browser.c
  7d9e5c2c159dab95b024e66b72fafade  gcc/tree-browser.def
! 52e81cece35aca1c5386e2717c3043d4  gcc/tree-call-cdce.c
! 8781caef5599ff0627495265c6d5a894  gcc/tree-cfg.c
  e2fb6ab59dfa38cf567381d5de6cebbd  gcc/tree-cfg.h
  2c018fcde361a9be2fb71797b3d21cf4  gcc/tree-cfgcleanup.c
  cd8285c7fa2dff58a664c24cb7d72452  gcc/tree-cfgcleanup.h
! 7f09aea3497ab36d0a995d1c8c81d973  gcc/tree-chkp-opt.c
! 454f72a54338fe7e3cbefd99722adeb8  gcc/tree-chkp.c
  afca43a41fd6e7920fa4404477919548  gcc/tree-chkp.h
! 6e6794f1c9717a7f7edee1c50ce238c8  gcc/tree-chrec.c
  f1271a4c583fb31ffb253b63bf223aec  gcc/tree-chrec.h
  52b5381f503bfc832d09b2266b7a0054  gcc/tree-complex.c
  7a92432a403654536cafe1143f0dabb1  gcc/tree-core.h
! 69a33c580e226e4da71164ff771f8852  gcc/tree-data-ref.c
  965a1a11be8d3a6abe6e477c44ebf1d7  gcc/tree-data-ref.h
  126503575134c87d19540481bb5f0726  gcc/tree-dfa.c
  40c0fde0870f0a9908bf3d9e09175d39  gcc/tree-dfa.h
--- 52582,52600 ----
  6dfe265c99c28bf824e45cc0e928d6d4  gcc/tree-affine.h
  60574cf7cbc2685ed641d917a92bbeba  gcc/tree-browser.c
  7d9e5c2c159dab95b024e66b72fafade  gcc/tree-browser.def
! e78adc565fb9476663e496d881567ec7  gcc/tree-call-cdce.c
! 03bb5d5fe7113ef086e3c3cd1157c4e0  gcc/tree-cfg.c
  e2fb6ab59dfa38cf567381d5de6cebbd  gcc/tree-cfg.h
  2c018fcde361a9be2fb71797b3d21cf4  gcc/tree-cfgcleanup.c
  cd8285c7fa2dff58a664c24cb7d72452  gcc/tree-cfgcleanup.h
! 5a32d3ef4ca145648448b11f489c8ddc  gcc/tree-chkp-opt.c
! 25e1351697744dfe21edf90de2cd0c81  gcc/tree-chkp.c
  afca43a41fd6e7920fa4404477919548  gcc/tree-chkp.h
! f215eae8be0aafafaf718174ae72e99e  gcc/tree-chrec.c
  f1271a4c583fb31ffb253b63bf223aec  gcc/tree-chrec.h
  52b5381f503bfc832d09b2266b7a0054  gcc/tree-complex.c
  7a92432a403654536cafe1143f0dabb1  gcc/tree-core.h
! d2170997fe7d554e9f2d1953fd5703d2  gcc/tree-data-ref.c
  965a1a11be8d3a6abe6e477c44ebf1d7  gcc/tree-data-ref.h
  126503575134c87d19540481bb5f0726  gcc/tree-dfa.c
  40c0fde0870f0a9908bf3d9e09175d39  gcc/tree-dfa.h
*************** f1271a4c583fb31ffb253b63bf223aec  gcc/tr
*** 52255,52273 ****
  8f214d77d1ea8631ae83aabe1246b99c  gcc/tree-diagnostic.h
  1f32c65edbf5fb5abc6da7355a5ce802  gcc/tree-dump.c
  b5a85421dc2e95629798fea9169c034a  gcc/tree-dump.h
! 7baecd2aac9f0b63a7824add0e65644a  gcc/tree-eh.c
  e7357477d6dd5ecc872096025db0c187  gcc/tree-eh.h
  f20097df896a6b83fa1afb7b50fed939  gcc/tree-emutls.c
  dffdefd7e0250ee886f32492046f4844  gcc/tree-hasher.h
  4b804f75b87cd984a01836701a30dc12  gcc/tree-if-conv.c
! 9ad2aa103361743dc3d31264127be043  gcc/tree-inline.c
! c60d96a93cf29457f9e34476e0d12d79  gcc/tree-inline.h
  98b8ebbf5a13f5d83c72a0c936a4b401  gcc/tree-into-ssa.c
  8b617746a33769bcf7601a0ad81cf23e  gcc/tree-into-ssa.h
  f8f490a2171e0556bd6bbfbf77417e19  gcc/tree-iterator.c
  0ccb05b6605cb7d2376b2e5f19041f22  gcc/tree-iterator.h
! 0a64502f3bd845d490c5e574edd6690d  gcc/tree-loop-distribution.c
! 6aefa028c358d3bb194613635a50a54a  gcc/tree-nested.c
  520ed1c82085e4c3f5e637bc176592de  gcc/tree-nested.h
  ff78a2b956781bfa246f936b136a7d93  gcc/tree-nrv.c
  c7cb82b9acdf5a01359dfdde7b1d589a  gcc/tree-object-size.c
--- 52602,52620 ----
  8f214d77d1ea8631ae83aabe1246b99c  gcc/tree-diagnostic.h
  1f32c65edbf5fb5abc6da7355a5ce802  gcc/tree-dump.c
  b5a85421dc2e95629798fea9169c034a  gcc/tree-dump.h
! 866b98116a1e6419c9c87e9a59bb3108  gcc/tree-eh.c
  e7357477d6dd5ecc872096025db0c187  gcc/tree-eh.h
  f20097df896a6b83fa1afb7b50fed939  gcc/tree-emutls.c
  dffdefd7e0250ee886f32492046f4844  gcc/tree-hasher.h
  4b804f75b87cd984a01836701a30dc12  gcc/tree-if-conv.c
! 6fa4e7f18648019c793254e0d563988a  gcc/tree-inline.c
! 4e18705e50dfac9c68b59bc4594ae166  gcc/tree-inline.h
  98b8ebbf5a13f5d83c72a0c936a4b401  gcc/tree-into-ssa.c
  8b617746a33769bcf7601a0ad81cf23e  gcc/tree-into-ssa.h
  f8f490a2171e0556bd6bbfbf77417e19  gcc/tree-iterator.c
  0ccb05b6605cb7d2376b2e5f19041f22  gcc/tree-iterator.h
! bab095d213ce12330715eda187dc6550  gcc/tree-loop-distribution.c
! 0eadf82f91b10f15f85b8967efd22517  gcc/tree-nested.c
  520ed1c82085e4c3f5e637bc176592de  gcc/tree-nested.h
  ff78a2b956781bfa246f936b136a7d93  gcc/tree-nrv.c
  c7cb82b9acdf5a01359dfdde7b1d589a  gcc/tree-object-size.c
*************** df676b935cd9953017cf760735cb6bed  gcc/tr
*** 52279,52288 ****
  f7740ed423524819a13383b22733aa44  gcc/tree-pass.h
  847ae30a26b2e24e4a4d15080627c866  gcc/tree-phinodes.c
  a2b8be62c65245fe4dbdbf48fb94b4b8  gcc/tree-phinodes.h
! e8dc2ef08537c036bcbc6e19cd546a92  gcc/tree-predcom.c
  23063fd6d1165991824e519f53c6b978  gcc/tree-pretty-print.c
  012a08b509af2af89d176f9afd91d742  gcc/tree-pretty-print.h
! 6ab10b5cdfe7c6e3d23fb446c019158b  gcc/tree-profile.c
  7950dc9efe213a11698aa568b68dba72  gcc/tree-scalar-evolution.c
  0a30d2f901eedbf84f6fc4aa167cc770  gcc/tree-scalar-evolution.h
  63cd9e795495c7ea303a2a59c82c4a45  gcc/tree-sra.c
--- 52626,52635 ----
  f7740ed423524819a13383b22733aa44  gcc/tree-pass.h
  847ae30a26b2e24e4a4d15080627c866  gcc/tree-phinodes.c
  a2b8be62c65245fe4dbdbf48fb94b4b8  gcc/tree-phinodes.h
! b38a2e4e500303be334be9c605e2cabd  gcc/tree-predcom.c
  23063fd6d1165991824e519f53c6b978  gcc/tree-pretty-print.c
  012a08b509af2af89d176f9afd91d742  gcc/tree-pretty-print.h
! a1a6a38f885419a6775f74d432b65f02  gcc/tree-profile.c
  7950dc9efe213a11698aa568b68dba72  gcc/tree-scalar-evolution.c
  0a30d2f901eedbf84f6fc4aa167cc770  gcc/tree-scalar-evolution.h
  63cd9e795495c7ea303a2a59c82c4a45  gcc/tree-sra.c
*************** ef11cb4378e75d19b41ddf0e0147781d  gcc/tr
*** 52304,52345 ****
  1630fe605b5b6bf0cbb4b22860930d8d  gcc/tree-ssa-live.c
  785a288e802c81d0d93faaab5b8ed23d  gcc/tree-ssa-live.h
  233ef46708a1fd344ff5e9af4eed2fd8  gcc/tree-ssa-loop-ch.c
! b96f336f2d2a4969cac141f76107fa85  gcc/tree-ssa-loop-im.c
  9a0cfa106d91a1d71984addd8ae1849c  gcc/tree-ssa-loop-ivcanon.c
! c39ee9c000b27e6489e6846a4aeac3d3  gcc/tree-ssa-loop-ivopts.c
  d1c21aa39a8915a8534cbb56bd874120  gcc/tree-ssa-loop-ivopts.h
  39ad6122d8a13b09c5aaa8048171c0d0  gcc/tree-ssa-loop-manip.c
  f8c807fd578b0d10eeaa9c42dda96141  gcc/tree-ssa-loop-manip.h
  0ac21478f3b232984a23f449922ea043  gcc/tree-ssa-loop-niter.c
  2c11b23b57c3a2806a4a9646518324f4  gcc/tree-ssa-loop-niter.h
! 112f81a5b979a334e76d3c8b1189fbc7  gcc/tree-ssa-loop-prefetch.c
  9aa4e084725ec91fd63e0dd510d9af9a  gcc/tree-ssa-loop-unswitch.c
  322dd4e0c5d4a6db9fc15baf24e6e3e2  gcc/tree-ssa-loop.c
  3a30d070906d5f236060d468d5a8035b  gcc/tree-ssa-loop.h
! 88123d8155bff2ab85c6ef8b6573c1c7  gcc/tree-ssa-math-opts.c
  d96698e3cacb09616d77632a6a67cdad  gcc/tree-ssa-operands.c
  a59f49560dfcdb9638878f1a8fee0ae1  gcc/tree-ssa-operands.h
  76d2e3c18c163a49c75e0593647e4449  gcc/tree-ssa-phiopt.c
  da848edf835c88b1fbfc7394660f0b25  gcc/tree-ssa-phiprop.c
! 1672b2db13dcefdea0d64cda9ced203f  gcc/tree-ssa-pre.c
  04a19ca6a46fb743663742a6d09d70d9  gcc/tree-ssa-propagate.c
  1d4916d6a91480afb813bd74af4bbe92  gcc/tree-ssa-propagate.h
! 853e7a7e6df02e052e24c85760247dc7  gcc/tree-ssa-reassoc.c
! a0c698babed931f788852f483e46223b  gcc/tree-ssa-sccvn.c
  b42a1186d296df90103546ced447f858  gcc/tree-ssa-sccvn.h
  6663d9bf83807058be78203635c0de96  gcc/tree-ssa-sink.c
! 65409ab9527b3299a8b572e89748d5db  gcc/tree-ssa-strlen.c
! e41b02404b08195b4c981422c8711892  gcc/tree-ssa-structalias.c
! 01e014783f365a87eccc3d505534ac3d  gcc/tree-ssa-tail-merge.c
  6a77691d1fb2a5b12cf503b3bf58439c  gcc/tree-ssa-ter.c
  13dbd5bf9605e518725670d8eb521194  gcc/tree-ssa-ter.h
! 161dc0f109259dad1b338f00b60f9bf5  gcc/tree-ssa-threadedge.c
  49a3b60521278d0c45b9be3e06e3c920  gcc/tree-ssa-threadedge.h
  6b0fe7b7bec125be10ab0c25d17fb3cf  gcc/tree-ssa-threadupdate.c
  ff24dbb48d4e2449fa9bee2136643f54  gcc/tree-ssa-threadupdate.h
  c217d2d5d8998a91987448aeb5ed9a82  gcc/tree-ssa-uncprop.c
! 4048e90db6282ef3feb696a6fce82056  gcc/tree-ssa-uninit.c
! 09cd8dee84f6553a1f6fe67f22f37958  gcc/tree-ssa.c
  39d9c89c9806851ec6d163f79092e19a  gcc/tree-ssa.h
  f6de1ad5ebb4114fbeb91658b375e94f  gcc/tree-ssanames.c
  381300f399c718dcfeabfe039cc2eac6  gcc/tree-ssanames.h
--- 52651,52692 ----
  1630fe605b5b6bf0cbb4b22860930d8d  gcc/tree-ssa-live.c
  785a288e802c81d0d93faaab5b8ed23d  gcc/tree-ssa-live.h
  233ef46708a1fd344ff5e9af4eed2fd8  gcc/tree-ssa-loop-ch.c
! d06868e7de992ca04f09ac6b73e0788c  gcc/tree-ssa-loop-im.c
  9a0cfa106d91a1d71984addd8ae1849c  gcc/tree-ssa-loop-ivcanon.c
! 82c4c96c63c28c54161392caa63652fb  gcc/tree-ssa-loop-ivopts.c
  d1c21aa39a8915a8534cbb56bd874120  gcc/tree-ssa-loop-ivopts.h
  39ad6122d8a13b09c5aaa8048171c0d0  gcc/tree-ssa-loop-manip.c
  f8c807fd578b0d10eeaa9c42dda96141  gcc/tree-ssa-loop-manip.h
  0ac21478f3b232984a23f449922ea043  gcc/tree-ssa-loop-niter.c
  2c11b23b57c3a2806a4a9646518324f4  gcc/tree-ssa-loop-niter.h
! 92e7b8886ac7087ea2f2ede1ff141c6d  gcc/tree-ssa-loop-prefetch.c
  9aa4e084725ec91fd63e0dd510d9af9a  gcc/tree-ssa-loop-unswitch.c
  322dd4e0c5d4a6db9fc15baf24e6e3e2  gcc/tree-ssa-loop.c
  3a30d070906d5f236060d468d5a8035b  gcc/tree-ssa-loop.h
! 768b7334b5acc595dad955400edd5c24  gcc/tree-ssa-math-opts.c
  d96698e3cacb09616d77632a6a67cdad  gcc/tree-ssa-operands.c
  a59f49560dfcdb9638878f1a8fee0ae1  gcc/tree-ssa-operands.h
  76d2e3c18c163a49c75e0593647e4449  gcc/tree-ssa-phiopt.c
  da848edf835c88b1fbfc7394660f0b25  gcc/tree-ssa-phiprop.c
! 785002446b6717c8b0b6ad2420eaebe9  gcc/tree-ssa-pre.c
  04a19ca6a46fb743663742a6d09d70d9  gcc/tree-ssa-propagate.c
  1d4916d6a91480afb813bd74af4bbe92  gcc/tree-ssa-propagate.h
! 6603222e5bfa9a45146845f48b52fffe  gcc/tree-ssa-reassoc.c
! 426e1e72dc5c9e7aa041052bb24d28a9  gcc/tree-ssa-sccvn.c
  b42a1186d296df90103546ced447f858  gcc/tree-ssa-sccvn.h
  6663d9bf83807058be78203635c0de96  gcc/tree-ssa-sink.c
! d712da5e07a6b32dd6adc8c97f1ee0d0  gcc/tree-ssa-strlen.c
! 4fe1be29549d3098f69fcaa6fa10bc15  gcc/tree-ssa-structalias.c
! a521b391a7009282d5346ecb2454db9e  gcc/tree-ssa-tail-merge.c
  6a77691d1fb2a5b12cf503b3bf58439c  gcc/tree-ssa-ter.c
  13dbd5bf9605e518725670d8eb521194  gcc/tree-ssa-ter.h
! 7338662856d7362cf91f7fca33e008ff  gcc/tree-ssa-threadedge.c
  49a3b60521278d0c45b9be3e06e3c920  gcc/tree-ssa-threadedge.h
  6b0fe7b7bec125be10ab0c25d17fb3cf  gcc/tree-ssa-threadupdate.c
  ff24dbb48d4e2449fa9bee2136643f54  gcc/tree-ssa-threadupdate.h
  c217d2d5d8998a91987448aeb5ed9a82  gcc/tree-ssa-uncprop.c
! de60049ad2b83be4b1e2b5c299f73cef  gcc/tree-ssa-uninit.c
! deadb068751a58ed6e6f0b5470e1a153  gcc/tree-ssa.c
  39d9c89c9806851ec6d163f79092e19a  gcc/tree-ssa.h
  f6de1ad5ebb4114fbeb91658b375e94f  gcc/tree-ssanames.c
  381300f399c718dcfeabfe039cc2eac6  gcc/tree-ssanames.h
*************** b4fb036bbd93781343e1ccd5a3ddf61c  gcc/tr
*** 52351,52380 ****
  483d95927517fbe03e0f08e632717a48  gcc/tree-streamer.h
  33cdc129e6789ba93a67254346d6a71f  gcc/tree-switch-conversion.c
  9b958bc38f56d1a0d82986d5203e53cf  gcc/tree-tailcall.c
! d6e6d4988bc01b2a441218e918cefe5f  gcc/tree-vect-data-refs.c
  4dc1bc83ace380b24de4d2211762ab95  gcc/tree-vect-generic.c
! 397c9113ec9062fcbae4f5034a83354f  gcc/tree-vect-loop-manip.c
  d46a16ac67ad3c8071dea8b16226d941  gcc/tree-vect-loop.c
  052e18d386adf0c55d60a4bf881c7b8d  gcc/tree-vect-patterns.c
  464f5e5e5b0be806fbc23d637e74db98  gcc/tree-vect-slp.c
  96fd3e7bbcae78c3667155ea2833dc70  gcc/tree-vect-stmts.c
  7386b843e36e5386b183ded60d6b68bd  gcc/tree-vectorizer.c
  0eac16b82bdef4054b71d4123dab2ccd  gcc/tree-vectorizer.h
! 58e4dd91abd5c1a884887b62b4fb1d30  gcc/tree-vrp.c
  cfc61c839a405d7b71e5b625c972bd21  gcc/tree.c
  f7de16c46209940608cbed33a0a06376  gcc/tree.def
  c3e3c038371e526c67ccba883e4123ae  gcc/tree.h
  cace18a7ab81cbeabc9c78b632d4dc16  gcc/treestruct.def
! 0fd44a0608f48a6b0a9e513c3ee75421  gcc/tsan.c
  b0f430e5be31fdcd3b3bcaa650a66c57  gcc/tsan.h
  ce33c51b11fa0bcf28a6fef0b45e6a6b  gcc/tsystem.h
  de2daf58e365fe2a48e98494585c4534  gcc/typeclass.h
  10732b9b25f2b33cf6915f230032c60f  gcc/typed-splay-tree.h
! 1b828541ce5ca869f602b86d8cfc6639  gcc/ubsan.c
  10800b6daf82b55573af5d0038a35f16  gcc/ubsan.h
  05e35041a6a3becd9bfa121294260ba8  gcc/valtrack.c
  2903bf55b0ed8c4c030b8a33ae7f7137  gcc/valtrack.h
! 55edc710428f9b3989e8bfe07ebe4daf  gcc/value-prof.c
  00f6b8a1bacc500a9b58d35b172bd3d4  gcc/value-prof.h
  1d2f7eb1753d6c80eaa87ea0e0757d13  gcc/var-tracking.c
  313e03a54bd7b093045135301b2c8303  gcc/varasm.c
--- 52698,52727 ----
  483d95927517fbe03e0f08e632717a48  gcc/tree-streamer.h
  33cdc129e6789ba93a67254346d6a71f  gcc/tree-switch-conversion.c
  9b958bc38f56d1a0d82986d5203e53cf  gcc/tree-tailcall.c
! 6967f5dae4c9ac671ac65c7a752a0d83  gcc/tree-vect-data-refs.c
  4dc1bc83ace380b24de4d2211762ab95  gcc/tree-vect-generic.c
! 70e32aed464b3eedbafc3ddf0e40f53e  gcc/tree-vect-loop-manip.c
  d46a16ac67ad3c8071dea8b16226d941  gcc/tree-vect-loop.c
  052e18d386adf0c55d60a4bf881c7b8d  gcc/tree-vect-patterns.c
  464f5e5e5b0be806fbc23d637e74db98  gcc/tree-vect-slp.c
  96fd3e7bbcae78c3667155ea2833dc70  gcc/tree-vect-stmts.c
  7386b843e36e5386b183ded60d6b68bd  gcc/tree-vectorizer.c
  0eac16b82bdef4054b71d4123dab2ccd  gcc/tree-vectorizer.h
! 72887466225c9ce09ee5ec7bb37fa619  gcc/tree-vrp.c
  cfc61c839a405d7b71e5b625c972bd21  gcc/tree.c
  f7de16c46209940608cbed33a0a06376  gcc/tree.def
  c3e3c038371e526c67ccba883e4123ae  gcc/tree.h
  cace18a7ab81cbeabc9c78b632d4dc16  gcc/treestruct.def
! 638e4f5384b73114384b940b265b2015  gcc/tsan.c
  b0f430e5be31fdcd3b3bcaa650a66c57  gcc/tsan.h
  ce33c51b11fa0bcf28a6fef0b45e6a6b  gcc/tsystem.h
  de2daf58e365fe2a48e98494585c4534  gcc/typeclass.h
  10732b9b25f2b33cf6915f230032c60f  gcc/typed-splay-tree.h
! f7893ef8cc319b88f5c84d6fb3929666  gcc/ubsan.c
  10800b6daf82b55573af5d0038a35f16  gcc/ubsan.h
  05e35041a6a3becd9bfa121294260ba8  gcc/valtrack.c
  2903bf55b0ed8c4c030b8a33ae7f7137  gcc/valtrack.h
! 2f75f47fe51d91f71ec109f5e71ce5cb  gcc/value-prof.c
  00f6b8a1bacc500a9b58d35b172bd3d4  gcc/value-prof.h
  1d2f7eb1753d6c80eaa87ea0e0757d13  gcc/var-tracking.c
  313e03a54bd7b093045135301b2c8303  gcc/varasm.c
*************** a6ba50a06d56ab1547b581447627c124  gcc/wi
*** 52396,52406 ****
  e4debe67922b4d5dfaebcffc93db4c88  gcc/xcoff.h
  ae782b20e65b91b020560956bee4480b  gcc/xcoffout.c
  7913404fae11483f78d1e14688f4592c  gcc/xcoffout.h
! e55eb058df316f44e09de56b6c57eab1  gnattools/ChangeLog
  692322cbac4dbf19144764e4486b9f54  gnattools/Makefile.in
  41b96b7921d11e52b1d8465ea57136ad  gnattools/configure
  a73c18d8f44ab8bc3e71c3d530fa603e  gnattools/configure.ac
! 78b6c28e960008919df6178357e7dda0  gotools/ChangeLog
  f94b48bc3593ed09d6e2588fea0c47e0  gotools/Makefile.am
  2ff781c9acd2d56facfcd0d537b17141  gotools/Makefile.in
  7e23031e2e274aaa07b61c1e8f18dc99  gotools/README
--- 52743,52753 ----
  e4debe67922b4d5dfaebcffc93db4c88  gcc/xcoff.h
  ae782b20e65b91b020560956bee4480b  gcc/xcoffout.c
  7913404fae11483f78d1e14688f4592c  gcc/xcoffout.h
! fc72338ba22300c12892cd3747874c54  gnattools/ChangeLog
  692322cbac4dbf19144764e4486b9f54  gnattools/Makefile.in
  41b96b7921d11e52b1d8465ea57136ad  gnattools/configure
  a73c18d8f44ab8bc3e71c3d530fa603e  gnattools/configure.ac
! 9ef15743b0d4be306e22532cdccd3bea  gotools/ChangeLog
  f94b48bc3593ed09d6e2588fea0c47e0  gotools/Makefile.am
  2ff781c9acd2d56facfcd0d537b17141  gotools/Makefile.in
  7e23031e2e274aaa07b61c1e8f18dc99  gotools/README
*************** c4e8176c1964a5ebe0a55900f2141299  gotool
*** 52412,52418 ****
  eb2aeb3a6cffe7b26a8f1c8a2da23dcd  gotools/gofmt.1
  59530bdf33659b29e73d4adb9f9f6552  include/COPYING
  d32239bcb673463ab874e80d47fae504  include/COPYING3
! fa7377a2f7845d30f7e40c62ec9f3352  include/ChangeLog
  4263432a72ff47ed8bf420208ee7eea5  include/ChangeLog-9103
  a43d76108493b20da790f953f829c6a5  include/ChangeLog.jit
  171a864be3edfa751919fdfd5a2b2f30  include/ansidecl.h
--- 52759,52765 ----
  eb2aeb3a6cffe7b26a8f1c8a2da23dcd  gotools/gofmt.1
  59530bdf33659b29e73d4adb9f9f6552  include/COPYING
  d32239bcb673463ab874e80d47fae504  include/COPYING3
! f3dd18aa32aeecf126e534c1fe5b8971  include/ChangeLog
  4263432a72ff47ed8bf420208ee7eea5  include/ChangeLog-9103
  a43d76108493b20da790f953f829c6a5  include/ChangeLog.jit
  171a864be3edfa751919fdfd5a2b2f30  include/ansidecl.h
*************** e34d525d7faceda0dd5cb3eae49c1548  includ
*** 52452,52458 ****
  0294cecbb1f66d640ccba3a5d862d05b  include/xregex2.h
  f648a66ed08e079e26a24c4346a3ba03  include/xtensa-config.h
  361482dd6b5b5eb7090fff3986fba68a  install-sh
! 6709b7c9549223f3ce30a176464803e5  intl/ChangeLog
  cad1d6fab2274517783de7433c0faa74  intl/Makefile.in
  6ec998bb4716c744bf8185e607f69301  intl/README
  76ca170a525d5b84d90f0478fe788931  intl/VERSION
--- 52799,52805 ----
  0294cecbb1f66d640ccba3a5d862d05b  include/xregex2.h
  f648a66ed08e079e26a24c4346a3ba03  include/xtensa-config.h
  361482dd6b5b5eb7090fff3986fba68a  install-sh
! 70a03dbded73db4d85df617a8f0779f2  intl/ChangeLog
  cad1d6fab2274517783de7433c0faa74  intl/Makefile.in
  6ec998bb4716c744bf8185e607f69301  intl/README
  76ca170a525d5b84d90f0478fe788931  intl/VERSION
*************** d50a8c6c5b41089930accbdce767d3c0  intl/p
*** 52494,52505 ****
  b4758a0194e3e41362b939911472ce62  intl/relocatable.c
  bedade7bcfc3bc5eb09a2c6844f637f3  intl/relocatable.h
  43f287d082528203fc85c1d2d81bf30d  intl/textdomain.c
! d68481f398bfa51e73ea43565a8528d1  libada/ChangeLog
  23431a8157594a82b6d6e6ba4f2ee7ba  libada/Makefile.in
  68395a53adb86132c753b865a97f49e5  libada/configure
  e05623ca0be117eb9a5d4bb2008fb09c  libada/configure.ac
  46d3fe6da7a771cc2d5420c4137a6861  libatomic/.gitignore
! 082378bb99fec2c2e8dd8dffccce2ce0  libatomic/ChangeLog
  8996f665152f36a53464c30cbff03a9e  libatomic/Makefile.am
  f2aab8f3131149baace703d7539dd126  libatomic/Makefile.in
  f7853b06953072a9987a45a5b00782d6  libatomic/acinclude.m4
--- 52841,52852 ----
  b4758a0194e3e41362b939911472ce62  intl/relocatable.c
  bedade7bcfc3bc5eb09a2c6844f637f3  intl/relocatable.h
  43f287d082528203fc85c1d2d81bf30d  intl/textdomain.c
! e53e5fa85fab8e4f8291f3d0841f625a  libada/ChangeLog
  23431a8157594a82b6d6e6ba4f2ee7ba  libada/Makefile.in
  68395a53adb86132c753b865a97f49e5  libada/configure
  e05623ca0be117eb9a5d4bb2008fb09c  libada/configure.ac
  46d3fe6da7a771cc2d5420c4137a6861  libatomic/.gitignore
! ac7c579336e1937d03feb92dfc5bd22e  libatomic/ChangeLog
  8996f665152f36a53464c30cbff03a9e  libatomic/Makefile.am
  f2aab8f3131149baace703d7539dd126  libatomic/Makefile.in
  f7853b06953072a9987a45a5b00782d6  libatomic/acinclude.m4
*************** cbeb120f3cb8c120de8a74a3dee23e10  libato
*** 52507,52513 ****
  e143acd5b2c5b05cc850e294c26cb1c6  libatomic/auto-config.h.in
  c77a380c7c7be939a4e5ac6c3d020cf6  libatomic/cas_n.c
  100355d478e4b048b44e1a3566fae65c  libatomic/config/arm/arm-config.h
! 245315155acf6ade4342e6e157df386e  libatomic/config/arm/exch_n.c
  6b272347b6495b829ff036ddf4d65e93  libatomic/config/arm/host-config.h
  db43cf5a187a91251ef3198570679f95  libatomic/config/ia64/host-config.h
  c582fae44e9352139df88c3e869ecbc3  libatomic/config/linux/arm/host-config.h
--- 52854,52860 ----
  e143acd5b2c5b05cc850e294c26cb1c6  libatomic/auto-config.h.in
  c77a380c7c7be939a4e5ac6c3d020cf6  libatomic/cas_n.c
  100355d478e4b048b44e1a3566fae65c  libatomic/config/arm/arm-config.h
! 551413876a4336e62a07b4e6f83a5e3c  libatomic/config/arm/exch_n.c
  6b272347b6495b829ff036ddf4d65e93  libatomic/config/arm/host-config.h
  db43cf5a187a91251ef3198570679f95  libatomic/config/ia64/host-config.h
  c582fae44e9352139df88c3e869ecbc3  libatomic/config/linux/arm/host-config.h
*************** c03a072efac9b30f8f8429ac52fd246b  libato
*** 52581,52587 ****
  8a7308fda7ed1543cb9e3be0f8e47bce  libatomic/testsuite/libatomic.c/atomic-store-5.c
  40618200985a15bcba64f871863da498  libatomic/testsuite/libatomic.c/c.exp
  97b0c9cdfcb733664bdf4efe0f5dc449  libatomic/testsuite/libatomic.c/generic-2.c
! a3f52f84b280cb83d387f44053a32875  libbacktrace/ChangeLog
  eb3a88b53140eb234a99a4b3a55e56bf  libbacktrace/ChangeLog.jit
  c794c48bf2fbd5ee29733ac698f1838b  libbacktrace/Makefile.am
  10502b510e3bb652e63f65eab6326c9d  libbacktrace/Makefile.in
--- 52928,52934 ----
  8a7308fda7ed1543cb9e3be0f8e47bce  libatomic/testsuite/libatomic.c/atomic-store-5.c
  40618200985a15bcba64f871863da498  libatomic/testsuite/libatomic.c/c.exp
  97b0c9cdfcb733664bdf4efe0f5dc449  libatomic/testsuite/libatomic.c/generic-2.c
! 6ca11ac387c73c315670752f16559a4e  libbacktrace/ChangeLog
  eb3a88b53140eb234a99a4b3a55e56bf  libbacktrace/ChangeLog.jit
  c794c48bf2fbd5ee29733ac698f1838b  libbacktrace/Makefile.am
  10502b510e3bb652e63f65eab6326c9d  libbacktrace/Makefile.in
*************** ad498528fecdbff6d6f48133f2ea65aa  libbac
*** 52612,52618 ****
  c74edc0237b059b4e285bd8e28a7ea98  libbacktrace/state.c
  32208a7e36d7fdfa5f56cefc0efc03b2  libbacktrace/stest.c
  6414d319baa03d40347ac5d0d4928f24  libbacktrace/unknown.c
! ea714ce94383bd8d3aa47ba867222f95  libcc1/ChangeLog
  42436e3dc549d6555a58651626425bf1  libcc1/Makefile.am
  9b1c517416247bed077f6542eb58fb63  libcc1/Makefile.in
  88f6ca6808c90ecedbfd1dac80714d9e  libcc1/aclocal.m4
--- 52959,52965 ----
  c74edc0237b059b4e285bd8e28a7ea98  libbacktrace/state.c
  32208a7e36d7fdfa5f56cefc0efc03b2  libbacktrace/stest.c
  6414d319baa03d40347ac5d0d4928f24  libbacktrace/unknown.c
! e9bc7e029dc6fb8320ee9ce770647d34  libcc1/ChangeLog
  42436e3dc549d6555a58651626425bf1  libcc1/Makefile.am
  9b1c517416247bed077f6542eb58fb63  libcc1/Makefile.in
  88f6ca6808c90ecedbfd1dac80714d9e  libcc1/aclocal.m4
*************** ec29c212d8342e282234e53f69b3f8e6  libcc1
*** 52635,52641 ****
  559bc993c28302af171c959deb0cce45  libcc1/plugin.cc
  595b9a542a8f80367ebbeecbc51b1ac7  libcc1/rpc.hh
  14f215429d450a743fce24b101552f3e  libcc1/status.hh
! 77c93ab0fcaad6b8b341b8ee292cac5c  libcilkrts/ChangeLog
  df0ff198f37089171b490f87912f9602  libcilkrts/Makefile.am
  ed1f9b951d32febb494035c07d5da44c  libcilkrts/Makefile.in
  4a307b1474cad63768b2ae0c183b6259  libcilkrts/README
--- 52982,52988 ----
  559bc993c28302af171c959deb0cce45  libcc1/plugin.cc
  595b9a542a8f80367ebbeecbc51b1ac7  libcc1/rpc.hh
  14f215429d450a743fce24b101552f3e  libcc1/status.hh
! 05be436c14129a36a087eab030d6ac3b  libcilkrts/ChangeLog
  df0ff198f37089171b490f87912f9602  libcilkrts/Makefile.am
  ed1f9b951d32febb494035c07d5da44c  libcilkrts/Makefile.in
  4a307b1474cad63768b2ae0c183b6259  libcilkrts/README
*************** d4a2c447aba3e1afe4e9522d132a2e62  libcil
*** 52743,52749 ****
  94c538f9a3100a27649a9dc4d63d1677  libcilkrts/runtime/sysdep.h
  ffd8820979e88b4845e4b6ae604d2fdf  libcilkrts/runtime/worker_mutex.c
  9af2df6acad19a2001c2b1f68f5f59be  libcilkrts/runtime/worker_mutex.h
! 4c40031248c45266a01684029e71b1fb  libcpp/ChangeLog
  2bd831b17997584e38305782cebe6948  libcpp/ChangeLog.jit
  d6bac27ed901db3b33a0f3a3c7a24ecc  libcpp/Makefile.in
  7307c791a8de641ef6dada9a179ece57  libcpp/aclocal.m4
--- 53090,53096 ----
  94c538f9a3100a27649a9dc4d63d1677  libcilkrts/runtime/sysdep.h
  ffd8820979e88b4845e4b6ae604d2fdf  libcilkrts/runtime/worker_mutex.c
  9af2df6acad19a2001c2b1f68f5f59be  libcilkrts/runtime/worker_mutex.h
! edb6c9f04d9d6eb042868a8b683ff5aa  libcpp/ChangeLog
  2bd831b17997584e38305782cebe6948  libcpp/ChangeLog.jit
  d6bac27ed901db3b33a0f3a3c7a24ecc  libcpp/Makefile.in
  7307c791a8de641ef6dada9a179ece57  libcpp/aclocal.m4
*************** e48415cf03d09cea7adee0f3511f26b9  libcpp
*** 52765,52776 ****
  03386d55bf76adddaf87568de3091e89  libcpp/init.c
  2a37d5645af605a7c199c2019fc8e7ac  libcpp/internal.h
  204b2ce1dce9e3e9b8d73e06e8afe4d6  libcpp/lex.c
! 131c0bc663ea3ae4b1dc51b3d346dfe2  libcpp/line-map.c
  9165063770fb3cf0a84aabfd9af700c4  libcpp/macro.c
  1d651323454588d5ac3192c963d238b9  libcpp/makeucnid.c
  49c53ce2919b867b1b9d35fe5c26c6dd  libcpp/mkdeps.c
  6487368e1472b8cb5f645a9e97ef5cf6  libcpp/pch.c
! 889b52115db4e1501bb9060e1f929fdc  libcpp/po/ChangeLog
  101efbaa2450173d329333a67141a247  libcpp/po/be.gmo
  c2be8180550596c4811c937d293aca92  libcpp/po/be.po
  db5b3af91d18380e7a9ecbc08056e193  libcpp/po/ca.gmo
--- 53112,53123 ----
  03386d55bf76adddaf87568de3091e89  libcpp/init.c
  2a37d5645af605a7c199c2019fc8e7ac  libcpp/internal.h
  204b2ce1dce9e3e9b8d73e06e8afe4d6  libcpp/lex.c
! a274d691bf526941838fb42bd995371f  libcpp/line-map.c
  9165063770fb3cf0a84aabfd9af700c4  libcpp/macro.c
  1d651323454588d5ac3192c963d238b9  libcpp/makeucnid.c
  49c53ce2919b867b1b9d35fe5c26c6dd  libcpp/mkdeps.c
  6487368e1472b8cb5f645a9e97ef5cf6  libcpp/pch.c
! 60dc662b6f723bdce9e3b03cd41fe362  libcpp/po/ChangeLog
  101efbaa2450173d329333a67141a247  libcpp/po/be.gmo
  c2be8180550596c4811c937d293aca92  libcpp/po/be.po
  db5b3af91d18380e7a9ecbc08056e193  libcpp/po/ca.gmo
*************** c18e29874a5ea89f5716b740bd1be354  libcpp
*** 52820,52826 ****
  cba4c6c6128f95fc36dbe86aaca44f0b  libcpp/ucnid.h
  c9110040e0f379fdd157cf4f47d49dd9  libcpp/ucnid.tab
  a6c2b3de06c7424706b16f4c206396a1  libdecnumber/.gitignore
! 80601d6e2f5771774d21b54c65a9d9c3  libdecnumber/ChangeLog
  2bd831b17997584e38305782cebe6948  libdecnumber/ChangeLog.jit
  6486a184d61fdeeaa63ff335e5ed0491  libdecnumber/Makefile.in
  2746a1155d319a2cda823ee5b58921ce  libdecnumber/aclocal.m4
--- 53167,53173 ----
  cba4c6c6128f95fc36dbe86aaca44f0b  libcpp/ucnid.h
  c9110040e0f379fdd157cf4f47d49dd9  libcpp/ucnid.tab
  a6c2b3de06c7424706b16f4c206396a1  libdecnumber/.gitignore
! a530513989f84079f40546f9299706eb  libdecnumber/ChangeLog
  2bd831b17997584e38305782cebe6948  libdecnumber/ChangeLog.jit
  6486a184d61fdeeaa63ff335e5ed0491  libdecnumber/Makefile.in
  2746a1155d319a2cda823ee5b58921ce  libdecnumber/aclocal.m4
*************** a97c47969dfc92a7666dfe3c2e1e1448  libdec
*** 52883,52889 ****
  794b407db90b31cc93f5a7a7570e62de  libdecnumber/dpd/decimal64.c
  9ac3897c9a40e31bff405af880fafb97  libdecnumber/dpd/decimal64.h
  0f6db29710e7075c2fd62bc4478b3b8d  libdecnumber/dpd/decimal64Symbols.h
! 54a9f53ea3864c8367b7659c4e6e2097  libffi/ChangeLog
  ba66fc19311348d373ec271be939a659  libffi/ChangeLog.libffi
  fbbc216bc25d759a72ea3e6d734af56b  libffi/ChangeLog.libgcj
  d946d2b97454ad50a1dbfbf48923c5be  libffi/ChangeLog.v1
--- 53230,53236 ----
  794b407db90b31cc93f5a7a7570e62de  libdecnumber/dpd/decimal64.c
  9ac3897c9a40e31bff405af880fafb97  libdecnumber/dpd/decimal64.h
  0f6db29710e7075c2fd62bc4478b3b8d  libdecnumber/dpd/decimal64Symbols.h
! 5c6513be7c11959fc5d1f2e3d99b7635  libffi/ChangeLog
  ba66fc19311348d373ec271be939a659  libffi/ChangeLog.libffi
  fbbc216bc25d759a72ea3e6d734af56b  libffi/ChangeLog.libgcj
  d946d2b97454ad50a1dbfbf48923c5be  libffi/ChangeLog.v1
*************** f0aff67c9a90cc128022ee5b0055b968  libffi
*** 52896,52902 ****
  7e596b9d2421204d33c50e2a7d0f8e01  libffi/configure
  1c8febbea269e3325e750f3f577a85be  libffi/configure.ac
  84d2d9f2ebfac28a1697db5dc956a25b  libffi/configure.host
! 8d63ade0eae2a7dafb079aae822b9fb8  libffi/doc/libffi.info
  cfec4a5a1bb5d36550e15ac051c14148  libffi/doc/libffi.texi
  2969ffc23f66d73392207633f25ab252  libffi/doc/version.texi
  0323e665fa56b34846890cfcb17772c4  libffi/fficonfig.h.in
--- 53243,53249 ----
  7e596b9d2421204d33c50e2a7d0f8e01  libffi/configure
  1c8febbea269e3325e750f3f577a85be  libffi/configure.ac
  84d2d9f2ebfac28a1697db5dc956a25b  libffi/configure.host
! 06de21005f93a51347da09be8022b83b  libffi/doc/libffi.info
  cfec4a5a1bb5d36550e15ac051c14148  libffi/doc/libffi.texi
  2969ffc23f66d73392207633f25ab252  libffi/doc/version.texi
  0323e665fa56b34846890cfcb17772c4  libffi/fficonfig.h.in
*************** d47c79b281339983862a8e52d8c73f0f  libffi
*** 53240,53253 ****
  291be426192f460f6a07dfe1c96ab094  libffi/testsuite/libffi.special/special.exp
  93fc3ea311b79f64004992807ce75d1e  libffi/testsuite/libffi.special/unwindtest.cc
  185d0795017fbbe253a13db8e34085f9  libffi/testsuite/libffi.special/unwindtest_ffi_call.cc
! 6c4e461e4a6cdf3c38e04eab5ae4b30a  libgcc/ChangeLog
  fa9c74c0d1f3786facb86727d431c379  libgcc/Makefile.in
! f580acd5ef1774fa862f4470591082ec  libgcc/config.host
  f26ec212e3b17b397edd026932e4c2c2  libgcc/config.in
  27a91555b8c627d5253eead06d4023eb  libgcc/config/aarch64/crtfastmath.c
  7596c4be37d2d43c1924d6486ec8b1a7  libgcc/config/aarch64/crti.S
  809a55f6e2830e69542894706007e9db  libgcc/config/aarch64/crtn.S
! 366583c80921a43b8b709b7347e74c69  libgcc/config/aarch64/linux-unwind.h
  b380a668ce574366e5d8aafef91d0da4  libgcc/config/aarch64/sfp-exceptions.c
  9f74c1699a1012af21199e1be382eb3f  libgcc/config/aarch64/sfp-machine.h
  1cf73af9ac0962d82496fa8272f0a802  libgcc/config/aarch64/sync-cache.c
--- 53587,53600 ----
  291be426192f460f6a07dfe1c96ab094  libffi/testsuite/libffi.special/special.exp
  93fc3ea311b79f64004992807ce75d1e  libffi/testsuite/libffi.special/unwindtest.cc
  185d0795017fbbe253a13db8e34085f9  libffi/testsuite/libffi.special/unwindtest_ffi_call.cc
! 4900fd9c95ccd0bc8087b58a22b0a189  libgcc/ChangeLog
  fa9c74c0d1f3786facb86727d431c379  libgcc/Makefile.in
! e28d2e8d96ac31294b3d94dacfab0a23  libgcc/config.host
  f26ec212e3b17b397edd026932e4c2c2  libgcc/config.in
  27a91555b8c627d5253eead06d4023eb  libgcc/config/aarch64/crtfastmath.c
  7596c4be37d2d43c1924d6486ec8b1a7  libgcc/config/aarch64/crti.S
  809a55f6e2830e69542894706007e9db  libgcc/config/aarch64/crtn.S
! 5ebc575954415cf03038dbfc8d48f63c  libgcc/config/aarch64/linux-unwind.h
  b380a668ce574366e5d8aafef91d0da4  libgcc/config/aarch64/sfp-exceptions.c
  9f74c1699a1012af21199e1be382eb3f  libgcc/config/aarch64/sfp-machine.h
  1cf73af9ac0962d82496fa8272f0a802  libgcc/config/aarch64/sync-cache.c
*************** b380a668ce574366e5d8aafef91d0da4  libgcc
*** 53255,53261 ****
  a0a46a9affff177d894176604c30c40d  libgcc/config/aarch64/t-softfp
  504fab0d95b6283a5dc901d6866ee443  libgcc/config/alpha/crtfastmath.c
  668a3dd9aa0d1b92c594b14d2b97721f  libgcc/config/alpha/libgcc-alpha-ldbl.ver
! d4343beb8927e8a949db68ce2ba3f7c0  libgcc/config/alpha/linux-unwind.h
  8c0c1de20f8a59685053b4cb27e0b8b5  libgcc/config/alpha/qrnnd.S
  c45798ce39178e619ff48bf689b549be  libgcc/config/alpha/t-alpha
  95db551210150c5b18529c72cfdaeabf  libgcc/config/alpha/t-ieee
--- 53602,53608 ----
  a0a46a9affff177d894176604c30c40d  libgcc/config/aarch64/t-softfp
  504fab0d95b6283a5dc901d6866ee443  libgcc/config/alpha/crtfastmath.c
  668a3dd9aa0d1b92c594b14d2b97721f  libgcc/config/alpha/libgcc-alpha-ldbl.ver
! a885b8c29a30dc99788f812adfa79d7b  libgcc/config/alpha/linux-unwind.h
  8c0c1de20f8a59685053b4cb27e0b8b5  libgcc/config/alpha/qrnnd.S
  c45798ce39178e619ff48bf689b549be  libgcc/config/alpha/t-alpha
  95db551210150c5b18529c72cfdaeabf  libgcc/config/alpha/t-ieee
*************** f1b505a32bcf62e674988eec0748c12b  libgcc
*** 53358,53365 ****
  fc87e45e073829d21e9427a38f435e3b  libgcc/config/arm/t-symbian
  0b61332cccc4af9b144b6db99e213dcb  libgcc/config/arm/t-wince-pe
  4e5ac5c12ce4484d441f6f83d315e904  libgcc/config/arm/unaligned-funcs.c
! 83f11050d23d46dcd9f49fc7aad6bccd  libgcc/config/arm/unwind-arm.c
! 9abe4fe6419091486af728e326f90c7d  libgcc/config/arm/unwind-arm.h
  99b1199b2f3a4d60f3d06b690dac689b  libgcc/config/avr/avr-lib.h
  cb7548edc8c43dec14bd8b81d06c315a  libgcc/config/avr/lib1funcs-fixed.S
  3a05ff6a03be5dda31dd9062c5911d03  libgcc/config/avr/lib1funcs.S
--- 53705,53712 ----
  fc87e45e073829d21e9427a38f435e3b  libgcc/config/arm/t-symbian
  0b61332cccc4af9b144b6db99e213dcb  libgcc/config/arm/t-wince-pe
  4e5ac5c12ce4484d441f6f83d315e904  libgcc/config/arm/unaligned-funcs.c
! d00fffd88dd548ef2d4dc1126c27b46d  libgcc/config/arm/unwind-arm.c
! 7021d5ba9e7075ec052e84a8f9f5b7ff  libgcc/config/arm/unwind-arm.h
  99b1199b2f3a4d60f3d06b690dac689b  libgcc/config/avr/avr-lib.h
  cb7548edc8c43dec14bd8b81d06c315a  libgcc/config/avr/lib1funcs-fixed.S
  3a05ff6a03be5dda31dd9062c5911d03  libgcc/config/avr/lib1funcs.S
*************** bd5f5675c223510438dddeb748195268  libgcc
*** 53373,53379 ****
  e966c71e9124b9fa225b22b8a9020247  libgcc/config/bfin/crtn.S
  5dbdd36f3f3a8a56f9ae0dc30e4c0def  libgcc/config/bfin/lib1funcs.S
  bdc1a1385c50e86e8722df3970c25fe8  libgcc/config/bfin/libgcc-glibc.ver
! 36b6607380727389b09237f263026cd5  libgcc/config/bfin/linux-unwind.h
  4e54ca63fc628fdd56df2687a2bf457e  libgcc/config/bfin/t-bfin
  a5e909e203a6fbf202b2eaad6bff3601  libgcc/config/bfin/t-crtlibid
  17298642a82c8a2809260d1eb08f7e4e  libgcc/config/bfin/t-crtstuff
--- 53720,53726 ----
  e966c71e9124b9fa225b22b8a9020247  libgcc/config/bfin/crtn.S
  5dbdd36f3f3a8a56f9ae0dc30e4c0def  libgcc/config/bfin/lib1funcs.S
  bdc1a1385c50e86e8722df3970c25fe8  libgcc/config/bfin/libgcc-glibc.ver
! d5ad57ce8ba94c63fe6c503a36b238be  libgcc/config/bfin/linux-unwind.h
  4e54ca63fc628fdd56df2687a2bf457e  libgcc/config/bfin/t-bfin
  a5e909e203a6fbf202b2eaad6bff3601  libgcc/config/bfin/t-crtlibid
  17298642a82c8a2809260d1eb08f7e4e  libgcc/config/bfin/t-crtstuff
*************** ea294adb57574d1278b7ed059fa92328  libgcc
*** 53514,53520 ****
  b84f8adaa9192724e9602d8043fa6995  libgcc/config/i386/libgcc-darwin.10.5.ver
  68385e16ef1f822854d80574b5f5a5cd  libgcc/config/i386/libgcc-glibc.ver
  52bb88a77e0264994e91a324aed3d6f4  libgcc/config/i386/libgcc-sol2.ver
! 088bfba1b2542f1ba56faec49f49be9f  libgcc/config/i386/linux-unwind.h
  6b286ecb6560ddaadc541445acaadcb9  libgcc/config/i386/morestack.S
  cf9b2a6560ec15afc38524c29c065650  libgcc/config/i386/sfp-exceptions.c
  eff2f552940053c3c5d9d09dee943b13  libgcc/config/i386/sfp-machine.h
--- 53861,53867 ----
  b84f8adaa9192724e9602d8043fa6995  libgcc/config/i386/libgcc-darwin.10.5.ver
  68385e16ef1f822854d80574b5f5a5cd  libgcc/config/i386/libgcc-glibc.ver
  52bb88a77e0264994e91a324aed3d6f4  libgcc/config/i386/libgcc-sol2.ver
! 88123c29856ae3f609556e7c697cc8b0  libgcc/config/i386/linux-unwind.h
  6b286ecb6560ddaadc541445acaadcb9  libgcc/config/i386/morestack.S
  cf9b2a6560ec15afc38524c29c065650  libgcc/config/i386/sfp-exceptions.c
  eff2f552940053c3c5d9d09dee943b13  libgcc/config/i386/sfp-machine.h
*************** fa106cf68223eee5c0736fc8695286c5  libgcc
*** 53581,53587 ****
  7f77dab3bda1d10e1fca3644a2f0c9e7  libgcc/config/ia64/vms-unwind.h
  42f35408894b4409e1fb74a1dd0bff67  libgcc/config/iq2000/lib2funcs.c
  102f7dad8ad6b54434a1b8313d1e42c4  libgcc/config/iq2000/t-iq2000
! dad03eeea2a7ea0febd9bcae4512931c  libgcc/config/libbid/ChangeLog
  5b0036af46340c5fe5032ef6b4c1119c  libgcc/config/libbid/_addsub_dd.c
  077c04069b63155c517eeeb2d18211fe  libgcc/config/libbid/_addsub_sd.c
  c01e504740630774a0506de159528572  libgcc/config/libbid/_addsub_td.c
--- 53928,53934 ----
  7f77dab3bda1d10e1fca3644a2f0c9e7  libgcc/config/ia64/vms-unwind.h
  42f35408894b4409e1fb74a1dd0bff67  libgcc/config/iq2000/lib2funcs.c
  102f7dad8ad6b54434a1b8313d1e42c4  libgcc/config/iq2000/t-iq2000
! 2ed4fc67be0e7f8fe20a19758ed80bd7  libgcc/config/libbid/ChangeLog
  5b0036af46340c5fe5032ef6b4c1119c  libgcc/config/libbid/_addsub_dd.c
  077c04069b63155c517eeeb2d18211fe  libgcc/config/libbid/_addsub_sd.c
  c01e504740630774a0506de159528572  libgcc/config/libbid/_addsub_td.c
*************** e252c161ec4eb09d3b5a62d902b3d00f  libgcc
*** 53769,53775 ****
  c88d87907a20077db176016165428d4b  libgcc/config/m68k/fpgnulib.c
  697242b8a56fe4b72e0d74e8270071b0  libgcc/config/m68k/lb1sf68.S
  30b98e516245b6deb39a9ea14b24805f  libgcc/config/m68k/linux-atomic.c
! 208765e1c40d461897c01cf8b908c62e  libgcc/config/m68k/linux-unwind.h
  2e4fd3e401c9159da9f32d5965b5afa1  libgcc/config/m68k/t-floatlib
  de217c41c217f4341d6d546afa9a79f2  libgcc/config/m68k/t-linux
  4e281c631e54b8912258f84196fec9e6  libgcc/config/m68k/t-slibgcc-elf-ver
--- 54116,54122 ----
  c88d87907a20077db176016165428d4b  libgcc/config/m68k/fpgnulib.c
  697242b8a56fe4b72e0d74e8270071b0  libgcc/config/m68k/lb1sf68.S
  30b98e516245b6deb39a9ea14b24805f  libgcc/config/m68k/linux-atomic.c
! 8dcb553d1cb10a7a3acbd27407eaa4b1  libgcc/config/m68k/linux-unwind.h
  2e4fd3e401c9159da9f32d5965b5afa1  libgcc/config/m68k/t-floatlib
  de217c41c217f4341d6d546afa9a79f2  libgcc/config/m68k/t-linux
  4e281c631e54b8912258f84196fec9e6  libgcc/config/m68k/t-slibgcc-elf-ver
*************** e473b916bf4eba0c3f06374951aa45b1  libgcc
*** 54101,54107 ****
  6365520c0b10dc8772b4fd7d0eb02d0e  libgcc/config/nios2/lib2-mul.c
  eeb9b60d7a5032f9a09e4969fa381711  libgcc/config/nios2/lib2-nios2.h
  8e53f1c11a1b88e28645e5f75f51dd94  libgcc/config/nios2/linux-atomic.c
! 22d078f1dd0ffbf2f750e53798f8b773  libgcc/config/nios2/linux-unwind.h
  7b87568ecb5f5b73d0f10071fbdded48  libgcc/config/nios2/sfp-machine.h
  598bde069aeebadde9b08f8703ab2c77  libgcc/config/nios2/t-linux
  058cf7bee1e8fb40a62590a2558c7f76  libgcc/config/nios2/t-nios2
--- 54448,54454 ----
  6365520c0b10dc8772b4fd7d0eb02d0e  libgcc/config/nios2/lib2-mul.c
  eeb9b60d7a5032f9a09e4969fa381711  libgcc/config/nios2/lib2-nios2.h
  8e53f1c11a1b88e28645e5f75f51dd94  libgcc/config/nios2/linux-atomic.c
! 668a7b1867b6d43472152f82e2b41f95  libgcc/config/nios2/linux-unwind.h
  7b87568ecb5f5b73d0f10071fbdded48  libgcc/config/nios2/sfp-machine.h
  598bde069aeebadde9b08f8703ab2c77  libgcc/config/nios2/t-linux
  058cf7bee1e8fb40a62590a2558c7f76  libgcc/config/nios2/t-nios2
*************** f1911fa90d1dbeedf24a45afc7eaa66c  libgcc
*** 54119,54125 ****
  e7cd27121719c5c0f97dd3cb6c993ba5  libgcc/config/pa/hpux-unwind.h
  fdcb024d03346a72d12527a07bd3e112  libgcc/config/pa/lib2funcs.S
  0525896e0b34e5590c692f93c7a9ff03  libgcc/config/pa/linux-atomic.c
! a2889893933024e197b11f35c3692031  libgcc/config/pa/linux-unwind.h
  f81c78716ab9e3581190cba4008c50da  libgcc/config/pa/milli64.S
  667012433b09718593e94815435ae02d  libgcc/config/pa/quadlib.c
  f75c5d95e81be9574fc982b4aeed834f  libgcc/config/pa/stublib.c
--- 54466,54472 ----
  e7cd27121719c5c0f97dd3cb6c993ba5  libgcc/config/pa/hpux-unwind.h
  fdcb024d03346a72d12527a07bd3e112  libgcc/config/pa/lib2funcs.S
  0525896e0b34e5590c692f93c7a9ff03  libgcc/config/pa/linux-atomic.c
! f09b40f5b492d766dcbf161116a094a0  libgcc/config/pa/linux-unwind.h
  f81c78716ab9e3581190cba4008c50da  libgcc/config/pa/milli64.S
  667012433b09718593e94815435ae02d  libgcc/config/pa/quadlib.c
  f75c5d95e81be9574fc982b4aeed834f  libgcc/config/pa/stublib.c
*************** d1a44bea9afe07a73e74d110894939ac  libgcc
*** 54208,54214 ****
  8ba6ca63cf5db4f6e3881c48873a03fe  libgcc/config/rs6000/sol-ci.S
  2af7041d2c8c7272269907642834518a  libgcc/config/rs6000/sol-cn.S
  747501e3b907679cc3a99a2f174f7b9a  libgcc/config/rs6000/t-aix-cxa
! fb6501d77928a3ea4f485c0f80eedf94  libgcc/config/rs6000/t-crtstuff
  fbf232aa523ca2f4bcf139e827eba2da  libgcc/config/rs6000/t-darwin
  d7cdc73d7a8e658f872ea07474837bc2  libgcc/config/rs6000/t-darwin64
  ace5f56499cdd939ed67a5642d78228c  libgcc/config/rs6000/t-e500v1-fp
--- 54555,54561 ----
  8ba6ca63cf5db4f6e3881c48873a03fe  libgcc/config/rs6000/sol-ci.S
  2af7041d2c8c7272269907642834518a  libgcc/config/rs6000/sol-cn.S
  747501e3b907679cc3a99a2f174f7b9a  libgcc/config/rs6000/t-aix-cxa
! 3c3fc29e8ce89e9bbebf4cfbd71a6b54  libgcc/config/rs6000/t-crtstuff
  fbf232aa523ca2f4bcf139e827eba2da  libgcc/config/rs6000/t-darwin
  d7cdc73d7a8e658f872ea07474837bc2  libgcc/config/rs6000/t-darwin64
  ace5f56499cdd939ed67a5642d78228c  libgcc/config/rs6000/t-e500v1-fp
*************** ed1589158c77b2b1cfdfec3126cda47e  libgcc
*** 54255,54261 ****
  68ddef94ef228a2e500c6f84ca5c5f73  libgcc/config/sh/libgcc-excl.ver
  68ce5b0550cbda6ce3e05ae32030c808  libgcc/config/sh/libgcc-glibc.ver
  c8865b8f3af32ca36595aed493463639  libgcc/config/sh/linux-atomic.c
! bf9193e9bfc89e17b6b21659e4604367  libgcc/config/sh/linux-unwind.h
  d915cb58faa1ad2108733b662853057e  libgcc/config/sh/t-linux
  be1b06de574a22c34d2cf93d2d68a4f1  libgcc/config/sh/t-netbsd
  92ac25ad46b71eaf515c11d353eefac9  libgcc/config/sh/t-sh
--- 54602,54608 ----
  68ddef94ef228a2e500c6f84ca5c5f73  libgcc/config/sh/libgcc-excl.ver
  68ce5b0550cbda6ce3e05ae32030c808  libgcc/config/sh/libgcc-glibc.ver
  c8865b8f3af32ca36595aed493463639  libgcc/config/sh/linux-atomic.c
! 0fb5657ccfcc5cccee919f055838b3b0  libgcc/config/sh/linux-unwind.h
  d915cb58faa1ad2108733b662853057e  libgcc/config/sh/t-linux
  be1b06de574a22c34d2cf93d2d68a4f1  libgcc/config/sh/t-netbsd
  92ac25ad46b71eaf515c11d353eefac9  libgcc/config/sh/t-sh
*************** aed518ef82f08076b9d35fdd1631206d  libgcc
*** 54268,54274 ****
  7a55a011207a8ba0c1802aedf0535a6a  libgcc/config/sparc/crtfastmath.c
  3d47a4803792c5a95be72909f5cf5bde  libgcc/config/sparc/crti.S
  df3012bda81921398abdade5b3def646  libgcc/config/sparc/crtn.S
! 38890399560283d3053d6c66c5bfb517  libgcc/config/sparc/lb1spc.S
  e982c97b235f0aeda25b6571e8a0c6bf  libgcc/config/sparc/libgcc-glibc.ver
  ed43e5fb300afb636d2cf5b80ae28f85  libgcc/config/sparc/linux-unwind.h
  90812dbeebbffb6085ceb6df2bbddcb3  libgcc/config/sparc/sol2-c1.S
--- 54615,54621 ----
  7a55a011207a8ba0c1802aedf0535a6a  libgcc/config/sparc/crtfastmath.c
  3d47a4803792c5a95be72909f5cf5bde  libgcc/config/sparc/crti.S
  df3012bda81921398abdade5b3def646  libgcc/config/sparc/crtn.S
! b2a26791cd6002e4af29a7fa32510b3b  libgcc/config/sparc/lb1spc.S
  e982c97b235f0aeda25b6571e8a0c6bf  libgcc/config/sparc/libgcc-glibc.ver
  ed43e5fb300afb636d2cf5b80ae28f85  libgcc/config/sparc/linux-unwind.h
  90812dbeebbffb6085ceb6df2bbddcb3  libgcc/config/sparc/sol2-c1.S
*************** b5d3fe85dff400a82befa6b901b438ec  libgcc
*** 54354,54360 ****
  94fecaba2fa3fca31d038d5739e45e51  libgcc/config/tilegx/t-tilegx
  58bf6e761613be6f89144592c3eba6de  libgcc/config/tilepro/atomic.c
  95089b073951187f34d92f631cf89095  libgcc/config/tilepro/atomic.h
! 3521538f8f8ebbdb25220100364ae0b9  libgcc/config/tilepro/linux-unwind.h
  c319c87cee2bc57b33cd850fb03731b5  libgcc/config/tilepro/sfp-machine.h
  acec84ef1d38dfdbf841d9e451e2cf6d  libgcc/config/tilepro/softdivide.c
  089e8702032c4fc69431f9f3ef745fbd  libgcc/config/tilepro/softmpy.S
--- 54701,54707 ----
  94fecaba2fa3fca31d038d5739e45e51  libgcc/config/tilegx/t-tilegx
  58bf6e761613be6f89144592c3eba6de  libgcc/config/tilepro/atomic.c
  95089b073951187f34d92f631cf89095  libgcc/config/tilepro/atomic.h
! 579b43292dcaca2ca80c81204bc2007b  libgcc/config/tilepro/linux-unwind.h
  c319c87cee2bc57b33cd850fb03731b5  libgcc/config/tilepro/sfp-machine.h
  acec84ef1d38dfdbf841d9e451e2cf6d  libgcc/config/tilepro/softdivide.c
  089e8702032c4fc69431f9f3ef745fbd  libgcc/config/tilepro/softmpy.S
*************** db1b100b48f69095675a1743f74a2008  libgcc
*** 54385,54401 ****
  d61692948565eb2f45431822f32976c6  libgcc/config/vxlib.c
  bfb0a542d9f791472ed94d4e2bec0fca  libgcc/config/xtensa/crti.S
  c22cab21cfb2986a8bf34cfd20f384d6  libgcc/config/xtensa/crtn.S
! 7ffe56d4c9102572edce3ccb370f2ac9  libgcc/config/xtensa/ieee754-df.S
! 683cda5faf2bdee3a5f3b21f3f0420c8  libgcc/config/xtensa/ieee754-sf.S
  4465fbd2e91309c6ae267846b72453b3  libgcc/config/xtensa/lib1funcs.S
  1b013196465687a45ec46ef51ef9db73  libgcc/config/xtensa/lib2funcs.S
  8074695f5eea7b961c59ee9608973dac  libgcc/config/xtensa/libgcc-glibc.ver
! a79f3fd3760a0ec393340c60be1414f4  libgcc/config/xtensa/linux-unwind.h
! abaf6fc399453837c4d7bb2c36921c93  libgcc/config/xtensa/t-elf
! 726bfd6509f7943384215f04c9cf18a6  libgcc/config/xtensa/t-linux
! 1cda4d5f139437b4145f2b602cea77e5  libgcc/config/xtensa/t-windowed
  bf2471ce5bf90eaf3dd7074026fd33f5  libgcc/config/xtensa/t-xtensa
! 247fa85a7d363e4d6421ce67c28bb238  libgcc/config/xtensa/unwind-dw2-xtensa.c
  1a971e7ddcdd0754fe45c1228fb494e2  libgcc/config/xtensa/unwind-dw2-xtensa.h
  741285320df421c73e2df1c0dda52794  libgcc/configure
  eda07878c0b1804de9b4cb818dbceb00  libgcc/configure.ac
--- 54732,54748 ----
  d61692948565eb2f45431822f32976c6  libgcc/config/vxlib.c
  bfb0a542d9f791472ed94d4e2bec0fca  libgcc/config/xtensa/crti.S
  c22cab21cfb2986a8bf34cfd20f384d6  libgcc/config/xtensa/crtn.S
! ac4ede20623569e001902a17d18d7aa8  libgcc/config/xtensa/ieee754-df.S
! be24459f136e634025447fcc59acf5cb  libgcc/config/xtensa/ieee754-sf.S
  4465fbd2e91309c6ae267846b72453b3  libgcc/config/xtensa/lib1funcs.S
  1b013196465687a45ec46ef51ef9db73  libgcc/config/xtensa/lib2funcs.S
  8074695f5eea7b961c59ee9608973dac  libgcc/config/xtensa/libgcc-glibc.ver
! b706cd534bccd296c4b11d2331883741  libgcc/config/xtensa/linux-unwind.h
! d437dc5394da39dbe1ece64723e90a76  libgcc/config/xtensa/t-elf
! 4f2c91d0f57a675cc91b287ce2ad76aa  libgcc/config/xtensa/t-linux
! ce614fa17d52c2d7121d7e2d6f80b02d  libgcc/config/xtensa/t-windowed
  bf2471ce5bf90eaf3dd7074026fd33f5  libgcc/config/xtensa/t-xtensa
! cb7920df63772522715bfa3b06213de6  libgcc/config/xtensa/unwind-dw2-xtensa.c
  1a971e7ddcdd0754fe45c1228fb494e2  libgcc/config/xtensa/unwind-dw2-xtensa.h
  741285320df421c73e2df1c0dda52794  libgcc/configure
  eda07878c0b1804de9b4cb818dbceb00  libgcc/configure.ac
*************** d6906c1cc1b61239da407a8e570fa0a3  libgcc
*** 54427,54436 ****
  6f4e50f38d490dd9dbb4c73ce7ecb592  libgcc/gthr-single.h
  22381c51f6d486a76e00870d4559bbd9  libgcc/gthr.h
  8ccf272badda4e7ecbdfc22151a578f3  libgcc/libgcc-std.ver.in
! 9af94c33dfb595f55c4caa423b5cb1df  libgcc/libgcc2.c
  aaee41d7a8cd4c16697aa2ed5e5c58db  libgcc/libgcc2.h
  659b631c237f90a8cae73a3f4bfcd70c  libgcc/libgcov-driver-system.c
! 70e549793b0d6a6869a986fc0126268f  libgcc/libgcov-driver.c
  c9bc312eab1eb6b97ff6d9b7f1c47fb3  libgcc/libgcov-interface.c
  27ede605a2e19d0861cdd3d6e97f0287  libgcc/libgcov-merge.c
  7b1cf4042d5f90a327cb1448f26bea29  libgcc/libgcov-profiler.c
--- 54774,54783 ----
  6f4e50f38d490dd9dbb4c73ce7ecb592  libgcc/gthr-single.h
  22381c51f6d486a76e00870d4559bbd9  libgcc/gthr.h
  8ccf272badda4e7ecbdfc22151a578f3  libgcc/libgcc-std.ver.in
! 36909dcd406b4dcd28d9cff37a5ac2f3  libgcc/libgcc2.c
  aaee41d7a8cd4c16697aa2ed5e5c58db  libgcc/libgcc2.h
  659b631c237f90a8cae73a3f4bfcd70c  libgcc/libgcov-driver-system.c
! 919de655ab18de9574eb291268a81930  libgcc/libgcov-driver.c
  c9bc312eab1eb6b97ff6d9b7f1c47fb3  libgcc/libgcov-interface.c
  27ede605a2e19d0861cdd3d6e97f0287  libgcc/libgcov-merge.c
  7b1cf4042d5f90a327cb1448f26bea29  libgcc/libgcov-profiler.c
*************** abe68a87a5391f933e354627759e3954  libgcc
*** 54533,54539 ****
  2501892c5883bcb26b286080c3bca3a6  libgcc/udivmod.c
  6d5cf00291c708162ba5ab6307175d38  libgcc/udivmodsi4.c
  679862bb484cbe8a52a3fc6bb0f1aff7  libgcc/unwind-arm-common.inc
! cd2fd8a976dd56113198fb101beecd32  libgcc/unwind-c.c
  c27d94cd04244c47c9af02c2c87a9584  libgcc/unwind-compat.c
  fac9640de446665519205dd667daf658  libgcc/unwind-compat.h
  eaef2cd4b01be678c29699d89667d55b  libgcc/unwind-dw2-fde-compat.c
--- 54880,54886 ----
  2501892c5883bcb26b286080c3bca3a6  libgcc/udivmod.c
  6d5cf00291c708162ba5ab6307175d38  libgcc/udivmodsi4.c
  679862bb484cbe8a52a3fc6bb0f1aff7  libgcc/unwind-arm-common.inc
! 97c075f87c5886aabb75902eeddac7b5  libgcc/unwind-c.c
  c27d94cd04244c47c9af02c2c87a9584  libgcc/unwind-compat.c
  fac9640de446665519205dd667daf658  libgcc/unwind-compat.h
  eaef2cd4b01be678c29699d89667d55b  libgcc/unwind-dw2-fde-compat.c
*************** f67877c8616b3917c19d20a42055cb16  libgcc
*** 54551,54557 ****
  d2ba441a933d70bc2f27734e4a9c8a43  libgcc/vtv_end_preinit.c
  a0b3ddfb7e98922fa38ec7232aa48e9f  libgcc/vtv_start.c
  05dc8eaf45476dade83c4c5221c3d4c6  libgcc/vtv_start_preinit.c
! abe97e3b5a638773960f02eaa14340bd  libgfortran/ChangeLog
  9aca36338382e5b4b730e7779170b24d  libgfortran/ChangeLog-2002
  80d3edc880c2da0b7a2beec2e2c4f774  libgfortran/ChangeLog-2003
  9f0239429993a5e64ed793eb6c55a5c1  libgfortran/ChangeLog-2004
--- 54898,54904 ----
  d2ba441a933d70bc2f27734e4a9c8a43  libgcc/vtv_end_preinit.c
  a0b3ddfb7e98922fa38ec7232aa48e9f  libgcc/vtv_start.c
  05dc8eaf45476dade83c4c5221c3d4c6  libgcc/vtv_start_preinit.c
! 553163c3e854af1ea3659af816e81300  libgfortran/ChangeLog
  9aca36338382e5b4b730e7779170b24d  libgfortran/ChangeLog-2002
  80d3edc880c2da0b7a2beec2e2c4f774  libgfortran/ChangeLog-2003
  9f0239429993a5e64ed793eb6c55a5c1  libgfortran/ChangeLog-2004
*************** fad6b52ce32fb79dc045d7e451645702  libgfo
*** 54569,54575 ****
  ba32f835ee3c96fa1ba7713ea3e92b26  libgfortran/Makefile.in
  cea1223bd8bc96b49f77851f0f65c88e  libgfortran/acinclude.m4
  689a370d413461df77ffe8d335768161  libgfortran/aclocal.m4
! 9f138187b50acf94f826a0a9fefaf6b6  libgfortran/c99_protos.h
  f7868487f71910e7a2685c034f175c38  libgfortran/caf/libcaf.h
  c1e3cafce5c1e49156663866ff4a0bc4  libgfortran/caf/mpi.c
  86a83d8fb7123426637dde14b4545e5e  libgfortran/caf/single.c
--- 54916,54922 ----
  ba32f835ee3c96fa1ba7713ea3e92b26  libgfortran/Makefile.in
  cea1223bd8bc96b49f77851f0f65c88e  libgfortran/acinclude.m4
  689a370d413461df77ffe8d335768161  libgfortran/aclocal.m4
! 900ae3d8d8f33a29461526e22deeaa08  libgfortran/c99_protos.h
  f7868487f71910e7a2685c034f175c38  libgfortran/caf/libcaf.h
  c1e3cafce5c1e49156663866ff4a0bc4  libgfortran/caf/mpi.c
  86a83d8fb7123426637dde14b4545e5e  libgfortran/caf/single.c
*************** bfc10ca98e919be09b0c9a33d04754b5  libgfo
*** 55098,55104 ****
  2192f08e1f477387d0e81ecec74ced3f  libgfortran/generated/unpack_r4.c
  cfe57d38bc93283fbbc6df85c8828795  libgfortran/generated/unpack_r8.c
  e5c9f166acfae008469fa9039800c819  libgfortran/gfortran.map
! eecb854afbc1b770027e238023b0f645  libgfortran/ieee/ieee_arithmetic.F90
  ce48e1f712a08924e710c61c26a531be  libgfortran/ieee/ieee_exceptions.F90
  3cee9e5c77be733265f2ad5224673c5b  libgfortran/ieee/ieee_features.F90
  a2ef5d13d5322a141ff6fe289836a43c  libgfortran/ieee/ieee_helper.c
--- 55445,55451 ----
  2192f08e1f477387d0e81ecec74ced3f  libgfortran/generated/unpack_r4.c
  cfe57d38bc93283fbbc6df85c8828795  libgfortran/generated/unpack_r8.c
  e5c9f166acfae008469fa9039800c819  libgfortran/gfortran.map
! 33b158ef0605a864fb2f1952823d55ed  libgfortran/ieee/ieee_arithmetic.F90
  ce48e1f712a08924e710c61c26a531be  libgfortran/ieee/ieee_exceptions.F90
  3cee9e5c77be733265f2ad5224673c5b  libgfortran/ieee/ieee_features.F90
  a2ef5d13d5322a141ff6fe289836a43c  libgfortran/ieee/ieee_helper.c
*************** a2ef5d13d5322a141ff6fe289836a43c  libgfo
*** 55107,55113 ****
  a4b7a3a68f1ab0be736604d60c751a91  libgfortran/intrinsics/args.c
  7c320849a0df4d2c53988876a67bf760  libgfortran/intrinsics/associated.c
  cd95d0992270d012ccfdcffa52824a46  libgfortran/intrinsics/bit_intrinsics.c
! cd4bf9842de8650ea76a6efd93b82657  libgfortran/intrinsics/c99_functions.c
  1f557f346c1dae1f02a5d9b2f12a8bc8  libgfortran/intrinsics/chdir.c
  a3e204f10d9551a604089d05c7b03b58  libgfortran/intrinsics/chmod.c
  4427b8076220da7e4157a3442416ee38  libgfortran/intrinsics/clock.c
--- 55454,55460 ----
  a4b7a3a68f1ab0be736604d60c751a91  libgfortran/intrinsics/args.c
  7c320849a0df4d2c53988876a67bf760  libgfortran/intrinsics/associated.c
  cd95d0992270d012ccfdcffa52824a46  libgfortran/intrinsics/bit_intrinsics.c
! 31824e7e991b00f5fb1142daf59109a1  libgfortran/intrinsics/c99_functions.c
  1f557f346c1dae1f02a5d9b2f12a8bc8  libgfortran/intrinsics/chdir.c
  a3e204f10d9551a604089d05c7b03b58  libgfortran/intrinsics/chmod.c
  4427b8076220da7e4157a3442416ee38  libgfortran/intrinsics/clock.c
*************** ff33917c2771db5382b30eb2d114a001  libgfo
*** 55178,55189 ****
  2efe9743c87d956969e516cf20a4a1b1  libgfortran/io/inquire.c
  72be91df91a4f7d395decb84b80de5cb  libgfortran/io/intrinsics.c
  5e98bf6d23d38b339fa46c56485c3670  libgfortran/io/io.h
! 022f67685b330124b0f29322771a446d  libgfortran/io/list_read.c
  463d798afd3917601a38f9573cb793c2  libgfortran/io/lock.c
  75429c61134d964b070eb3147fbeb204  libgfortran/io/open.c
  905dc4ddeddf25b54145625c7b2f0b4c  libgfortran/io/read.c
  90b971a1292b9b7ce5e96e700533488f  libgfortran/io/size_from_kind.c
! 02e7353015b855efa739e1b2f441333e  libgfortran/io/transfer.c
  8920e89257b2eed4c226a979a166f1fb  libgfortran/io/transfer128.c
  6928f278ea2a50226492dd9a4b23bbe1  libgfortran/io/unit.c
  2699920bc126e04a6d6ca2dc50ba529b  libgfortran/io/unix.c
--- 55525,55536 ----
  2efe9743c87d956969e516cf20a4a1b1  libgfortran/io/inquire.c
  72be91df91a4f7d395decb84b80de5cb  libgfortran/io/intrinsics.c
  5e98bf6d23d38b339fa46c56485c3670  libgfortran/io/io.h
! cc57abf525a7bc2687ae4e0162e545da  libgfortran/io/list_read.c
  463d798afd3917601a38f9573cb793c2  libgfortran/io/lock.c
  75429c61134d964b070eb3147fbeb204  libgfortran/io/open.c
  905dc4ddeddf25b54145625c7b2f0b4c  libgfortran/io/read.c
  90b971a1292b9b7ce5e96e700533488f  libgfortran/io/size_from_kind.c
! 0a625d20ce224b573c703963f1132652  libgfortran/io/transfer.c
  8920e89257b2eed4c226a979a166f1fb  libgfortran/io/transfer128.c
  6928f278ea2a50226492dd9a4b23bbe1  libgfortran/io/unit.c
  2699920bc126e04a6d6ca2dc50ba529b  libgfortran/io/unix.c
*************** ff33917c2771db5382b30eb2d114a001  libgfo
*** 55191,55197 ****
  607ec93d3784c61c00ac43df5973f519  libgfortran/io/write.c
  be7a080992727366616156dc4815a116  libgfortran/io/write_float.def
  f72d99352db844c4ed062f4529ca9a3f  libgfortran/kinds-override.h
! 925eb21bc04828bc484ec3bc0c247daf  libgfortran/libgfortran.h
  2527bb19b82f08b34038b07b172d029d  libgfortran/libgfortran.spec.in
  25a776e70521ce48fb1bfdd7bfa1a646  libgfortran/libtool-version
  6de6599b2a243993bd602f0a7dd7b378  libgfortran/m4/all.m4
--- 55538,55544 ----
  607ec93d3784c61c00ac43df5973f519  libgfortran/io/write.c
  be7a080992727366616156dc4815a116  libgfortran/io/write_float.def
  f72d99352db844c4ed062f4529ca9a3f  libgfortran/kinds-override.h
! 01ebb72bcf10471ed57d5cf2974738a5  libgfortran/libgfortran.h
  2527bb19b82f08b34038b07b172d029d  libgfortran/libgfortran.spec.in
  25a776e70521ce48fb1bfdd7bfa1a646  libgfortran/libtool-version
  6de6599b2a243993bd602f0a7dd7b378  libgfortran/m4/all.m4
*************** f81db480cbfdc2b1d2291623c6cadb5f  libgfo
*** 55249,55255 ****
  9037c8f0b8536434f0736f24c4af10f8  libgfortran/runtime/bounds.c
  af517361da824148ae348605ab62669d  libgfortran/runtime/compile_options.c
  776d45522372ed95f18b7e438f0f4f7b  libgfortran/runtime/convert_char.c
! e410976f7805abb6a6066543fc860996  libgfortran/runtime/environ.c
  df170391f8936eb1fbd5ce392c36765b  libgfortran/runtime/error.c
  e59839ecf9a9edec396d9260d4ab9cf0  libgfortran/runtime/fpu.c
  6e9c7c07ee7fc73a862b1474ad52f157  libgfortran/runtime/in_pack_generic.c
--- 55596,55602 ----
  9037c8f0b8536434f0736f24c4af10f8  libgfortran/runtime/bounds.c
  af517361da824148ae348605ab62669d  libgfortran/runtime/compile_options.c
  776d45522372ed95f18b7e438f0f4f7b  libgfortran/runtime/convert_char.c
! 49782c2e96c23cba407f3aa52e8d6f00  libgfortran/runtime/environ.c
  df170391f8936eb1fbd5ce392c36765b  libgfortran/runtime/error.c
  e59839ecf9a9edec396d9260d4ab9cf0  libgfortran/runtime/fpu.c
  6e9c7c07ee7fc73a862b1474ad52f157  libgfortran/runtime/in_pack_generic.c
*************** e4986413e9b80693d19f2485271e5c9d  libgo/
*** 56862,56869 ****
  a0090b126833084a9f2908291f50e6a0  libgo/go/syscall/syscall_linux_386.go
  7c5e270210553412c724bf6ab06e1854  libgo/go/syscall/syscall_linux_alpha.go
  6369db28775124d9386571ec81d3df7d  libgo/go/syscall/syscall_linux_amd64.go
! 29b5e7751adb70e11a58249aa085a1b9  libgo/go/syscall/syscall_linux_s390.go
! 38d337b4bd230ec911f750e4ef3f7cfd  libgo/go/syscall/syscall_linux_s390x.go
  94cd606be2946b33b3dbc7e59ed4341b  libgo/go/syscall/syscall_solaris.go
  aa19419240f5a247f0338eb695ceac57  libgo/go/syscall/syscall_stubs.go
  bc1d1901353d1aca3db7b32646999f6f  libgo/go/syscall/syscall_test.go
--- 57209,57216 ----
  a0090b126833084a9f2908291f50e6a0  libgo/go/syscall/syscall_linux_386.go
  7c5e270210553412c724bf6ab06e1854  libgo/go/syscall/syscall_linux_alpha.go
  6369db28775124d9386571ec81d3df7d  libgo/go/syscall/syscall_linux_amd64.go
! a7dae55ec943433fbe77493b95969e4c  libgo/go/syscall/syscall_linux_s390.go
! f34c9b630bff593e3a17c53851e92866  libgo/go/syscall/syscall_linux_s390x.go
  94cd606be2946b33b3dbc7e59ed4341b  libgo/go/syscall/syscall_solaris.go
  aa19419240f5a247f0338eb695ceac57  libgo/go/syscall/syscall_stubs.go
  bc1d1901353d1aca3db7b32646999f6f  libgo/go/syscall/syscall_test.go
*************** b5d61948754559678ede86a4e91cabb0  libgo/
*** 57086,57092 ****
  745d4f905f042374994ab7e1511af7d6  libgo/testsuite/gotest
  26b56a55b181d3ef0337842a31e79ae0  libgo/testsuite/lib/libgo.exp
  6df485581d2f02246f41b5ca46f5bb5d  libgo/testsuite/libgo.testmain/testmain.exp
! d684bf6c9918739718c54ce2549d0160  libgomp/ChangeLog
  0d55aa862aee66efdc5f8d62c94ff8fb  libgomp/ChangeLog.graphite
  d7be87f0c7f71dc789da8bfed0deb4b8  libgomp/Makefile.am
  68de659ea379402fca8523ab4c607bf0  libgomp/Makefile.in
--- 57433,57439 ----
  745d4f905f042374994ab7e1511af7d6  libgo/testsuite/gotest
  26b56a55b181d3ef0337842a31e79ae0  libgo/testsuite/lib/libgo.exp
  6df485581d2f02246f41b5ca46f5bb5d  libgo/testsuite/libgo.testmain/testmain.exp
! 2dabc41514950d7dee5a40abbf6386ec  libgomp/ChangeLog
  0d55aa862aee66efdc5f8d62c94ff8fb  libgomp/ChangeLog.graphite
  d7be87f0c7f71dc789da8bfed0deb4b8  libgomp/Makefile.am
  68de659ea379402fca8523ab4c607bf0  libgomp/Makefile.in
*************** c4e305e7108255d4aead897b74d5ed2e  libgom
*** 57141,57156 ****
  5fbaead8f640ce179edd07b6072e8907  libgomp/configure.ac
  08da9f7e83547768af5434c462153e20  libgomp/configure.tgt
  b5c71666b3dd1c1ab312405ea83ddf88  libgomp/critical.c
! 6f05ca2bf6bb26cb22cb3fc74f6c7437  libgomp/env.c
  3cb5086c9b2708150a14ac1ae9a8e387  libgomp/error.c
  7c71bd1d2d30acdc9be8b817e539e3b8  libgomp/fortran.c
! f097bc381cd79c8c027e22e773c3d0b2  libgomp/hashtab.h
  b8e928e9cd651c87d8105f391a8f3b2e  libgomp/iter.c
  38af8bd105c1c5061691bad322b3eb3b  libgomp/iter_ull.c
  6a1d448abc97ac5c7a688b5598880e66  libgomp/libgomp-plugin.c
  016174d02e1316d747ce957bf910f221  libgomp/libgomp-plugin.h
  95096d392212dba43215200e3e688299  libgomp/libgomp.h
! ef903935fe871269d3ea984508542e0b  libgomp/libgomp.info
  a80fef0fb8cafe3cff18a5a76142d027  libgomp/libgomp.map
  8b2aa50aecad82171348a6918309afd6  libgomp/libgomp.spec.in
  421b0332bd9845c4ed6a37e2bc137a27  libgomp/libgomp.texi
--- 57488,57503 ----
  5fbaead8f640ce179edd07b6072e8907  libgomp/configure.ac
  08da9f7e83547768af5434c462153e20  libgomp/configure.tgt
  b5c71666b3dd1c1ab312405ea83ddf88  libgomp/critical.c
! d508593cc0e0ff860b11f8e465818427  libgomp/env.c
  3cb5086c9b2708150a14ac1ae9a8e387  libgomp/error.c
  7c71bd1d2d30acdc9be8b817e539e3b8  libgomp/fortran.c
! 14d2bb41907ce919e42f6e546d02003d  libgomp/hashtab.h
  b8e928e9cd651c87d8105f391a8f3b2e  libgomp/iter.c
  38af8bd105c1c5061691bad322b3eb3b  libgomp/iter_ull.c
  6a1d448abc97ac5c7a688b5598880e66  libgomp/libgomp-plugin.c
  016174d02e1316d747ce957bf910f221  libgomp/libgomp-plugin.h
  95096d392212dba43215200e3e688299  libgomp/libgomp.h
! 3b1c2371492bd7a29857ad523a7bf006  libgomp/libgomp.info
  a80fef0fb8cafe3cff18a5a76142d027  libgomp/libgomp.map
  8b2aa50aecad82171348a6918309afd6  libgomp/libgomp.spec.in
  421b0332bd9845c4ed6a37e2bc137a27  libgomp/libgomp.texi
*************** f288ebef02de5e114b5c8526bad9dc19  libgom
*** 57280,57285 ****
--- 57627,57633 ----
  d65773670d221b74aa6b327a1de57dff  libgomp/testsuite/libgomp.c++/pr38650.C
  32eed8fe7a118de6fa22a9b1ffec6c53  libgomp/testsuite/libgomp.c++/pr39573.C
  467dc8995782492f741eb1d9548a272b  libgomp/testsuite/libgomp.c++/pr43893.C
+ f8a4ee60b8dc15123330632ae37c9ef4  libgomp/testsuite/libgomp.c++/pr45784.C
  6bc7a2a67f411f00aa39c8b72e8a287d  libgomp/testsuite/libgomp.c++/pr48869.C
  d566c37edb50b4aac9c2b4fa4d381670  libgomp/testsuite/libgomp.c++/pr49043.C
  d2e531409ec3708a503019e5aec4cfd8  libgomp/testsuite/libgomp.c++/pr56217.C
*************** bc3be9337646882bc8533bbbc9f01dd6  libgom
*** 57526,57531 ****
--- 57874,57880 ----
  006c9241a06131d8b1ad87c0a7a58349  libgomp/testsuite/libgomp.c/pr42029.c
  965ea816877f4bf791f4bf1a1aeef3cf  libgomp/testsuite/libgomp.c/pr42942.c
  3b6d62c4c9f8e8ce4656f6342157558e  libgomp/testsuite/libgomp.c/pr43893.c
+ 67c38424bb3c5c571b180f7bdadaa4f8  libgomp/testsuite/libgomp.c/pr45784.c
  dc156ed1b463ca0cf6f8e76c9ee9274b  libgomp/testsuite/libgomp.c/pr46886.c
  4b584bd7dc56381e7186080fc70dbd23  libgomp/testsuite/libgomp.c/pr48591.c
  b4c78e2e0b669ed68f5694694da3f225  libgomp/testsuite/libgomp.c/pr49897-1.c
*************** b9f3adf54414b3cb98d10f86ee7032dd  libgom
*** 57544,57549 ****
--- 57893,57901 ----
  5ee0d2e1cdf5ea9081e9ed1de58a5343  libgomp/testsuite/libgomp.c/pr66199-2.c
  37da387849a1a7da3f75e528c47ee2cb  libgomp/testsuite/libgomp.c/pr68960.c
  9995ebc7d239ebe751419090068c6f33  libgomp/testsuite/libgomp.c/pr69110.c
+ b39ac1676fce227eca227a5a7c39c784  libgomp/testsuite/libgomp.c/pr80394.c
+ 9116b9dc2c0c3c11fdab95ea2ca66a18  libgomp/testsuite/libgomp.c/pr81687-1.c
+ 5996dc15da52a000b77c153bb70588f6  libgomp/testsuite/libgomp.c/pr81687-2.c
  ea7c9e74bda402b1663a903b26400fab  libgomp/testsuite/libgomp.c/private-1.c
  a594cebdf052900dd0c8792068e14d85  libgomp/testsuite/libgomp.c/reduction-1.c
  6a724210e4cb30df7ade4ef7ee0aa83e  libgomp/testsuite/libgomp.c/reduction-2.c
*************** f34e0c37442a4a7019dadca0b34ac11d  libgom
*** 57642,57647 ****
--- 57994,58000 ----
  6116086a89b906c26bd9afe26e57a07a  libgomp/testsuite/libgomp.fortran/appendix-a/a10.1.f90
  ba05d0e1b584ec6c750d14a486ac83b2  libgomp/testsuite/libgomp.fortran/associate1.f90
  41cd3ed9183e6bc7b20ef8836663fbdd  libgomp/testsuite/libgomp.fortran/associate2.f90
+ aa03f95280189c0147b6c2ec288164ba  libgomp/testsuite/libgomp.fortran/associate3.f90
  cb0b79f7bddc47118981784eb7ba6f75  libgomp/testsuite/libgomp.fortran/cancel-do-1.f90
  2a5fe3d97ff9f23e08df5e015a45e3bc  libgomp/testsuite/libgomp.fortran/cancel-do-2.f90
  a110324b7cb72dc5755c1ad39c5230fd  libgomp/testsuite/libgomp.fortran/cancel-parallel-1.f90
*************** d3f9f8b453576b8a24f3f2db4ad0cbe2  libgom
*** 58052,58058 ****
  dfb2dc36e79cf123d81e8a34990df589  libgomp/work.c
  99c2e5e712b990ee07be10f53e41f3fb  libiberty/.gitignore
  a916467b91076e631dd8edb7424769c7  libiberty/COPYING.LIB
! 9d983487af00528b77b9081f64c75723  libiberty/ChangeLog
  347c31392973de6a4872d540c1718dc1  libiberty/ChangeLog.jit
  88d7a06b638cf8f45b3e776983f10524  libiberty/Makefile.in
  c68dbf7834af4281ebd84caa3fd54680  libiberty/README
--- 58405,58411 ----
  dfb2dc36e79cf123d81e8a34990df589  libgomp/work.c
  99c2e5e712b990ee07be10f53e41f3fb  libiberty/.gitignore
  a916467b91076e631dd8edb7424769c7  libiberty/COPYING.LIB
! 982788daaa1cb2d3d919976cbc8219d4  libiberty/ChangeLog
  347c31392973de6a4872d540c1718dc1  libiberty/ChangeLog.jit
  88d7a06b638cf8f45b3e776983f10524  libiberty/Makefile.in
  c68dbf7834af4281ebd84caa3fd54680  libiberty/README
*************** a8391a5d7431a4e11f61be41386a3356  libibe
*** 58084,58090 ****
  5824bd0f9be9f4fa74bb3bdc7fd9431c  libiberty/configure.com
  32149e9d61d873be9c2950bee2ae7137  libiberty/copying-lib.texi
  fe053283d3559af3ec5cac45f8ead009  libiberty/copysign.c
! 7a33fe7d4ac66d711f13dcf27e7f425f  libiberty/cp-demangle.c
  ef31ef103e276b9741c453bba5660e20  libiberty/cp-demangle.h
  5868438b5b6c384018d526ccee754b8f  libiberty/cp-demint.c
  93007574a947e87f0a09933f28203e4a  libiberty/cplus-dem.c
--- 58437,58443 ----
  5824bd0f9be9f4fa74bb3bdc7fd9431c  libiberty/configure.com
  32149e9d61d873be9c2950bee2ae7137  libiberty/copying-lib.texi
  fe053283d3559af3ec5cac45f8ead009  libiberty/copysign.c
! 8015af19e299ce7a30a0934f625624cc  libiberty/cp-demangle.c
  ef31ef103e276b9741c453bba5660e20  libiberty/cp-demangle.h
  5868438b5b6c384018d526ccee754b8f  libiberty/cp-demint.c
  93007574a947e87f0a09933f28203e4a  libiberty/cplus-dem.c
*************** d132d24f15fe05fe3614e69d6dbc65aa  libibe
*** 58187,58193 ****
  9e1bb6fe95ebb6415672ddf1da29ec65  libiberty/strverscmp.c
  bf4ea5614ec32141d1820716bd8709c5  libiberty/testsuite/Makefile.in
  9e858e1d84edd7cc5e1877f46bc3be65  libiberty/testsuite/d-demangle-expected
! 30a4da0ae59873d80c13da1ad3be4b46  libiberty/testsuite/demangle-expected
  10ce55269f247e57d2901ee11e88d8bd  libiberty/testsuite/demangler-fuzzer.c
  8b476ce26e8583eea8df7d77fe287a5a  libiberty/testsuite/test-demangle.c
  d629c8f2adde10d53657e437416cf27f  libiberty/testsuite/test-expandargv.c
--- 58540,58546 ----
  9e1bb6fe95ebb6415672ddf1da29ec65  libiberty/strverscmp.c
  bf4ea5614ec32141d1820716bd8709c5  libiberty/testsuite/Makefile.in
  9e858e1d84edd7cc5e1877f46bc3be65  libiberty/testsuite/d-demangle-expected
! 929dcca528168b741abb80a17625491e  libiberty/testsuite/demangle-expected
  10ce55269f247e57d2901ee11e88d8bd  libiberty/testsuite/demangler-fuzzer.c
  8b476ce26e8583eea8df7d77fe287a5a  libiberty/testsuite/test-demangle.c
  d629c8f2adde10d53657e437416cf27f  libiberty/testsuite/test-expandargv.c
*************** cdc140ce93944c5bb2ac62cd3dfd86d6  libibe
*** 58214,58220 ****
  6f774a92661ca4a067f1691a7925524b  libiberty/xstrerror.c
  c6e7ef53b4ff115a136d917511222656  libiberty/xstrndup.c
  2f875f0d4ecdb15ca4d5a65ba2d56a93  libiberty/xvasprintf.c
! be81059d0e804fd0f28250818bf63fb4  libitm/ChangeLog
  800745ad84882bc445410a58c2fddd51  libitm/Makefile.am
  232e2b039eaa7ea7006437397392ae64  libitm/Makefile.in
  12dd21dc261b9f7121f33bfedd52eadf  libitm/aatree.cc
--- 58567,58573 ----
  6f774a92661ca4a067f1691a7925524b  libiberty/xstrerror.c
  c6e7ef53b4ff115a136d917511222656  libiberty/xstrndup.c
  2f875f0d4ecdb15ca4d5a65ba2d56a93  libiberty/xvasprintf.c
! 58054218a0177bd2ee8ec5b6acc33ce7  libitm/ChangeLog
  800745ad84882bc445410a58c2fddd51  libitm/Makefile.am
  232e2b039eaa7ea7006437397392ae64  libitm/Makefile.in
  12dd21dc261b9f7121f33bfedd52eadf  libitm/aatree.cc
*************** f0d748e975d38acc54f3f20ddb101131  libitm
*** 58277,58283 ****
  cc44720eed2095c2e33a9822c78d4bad  libitm/dispatch.h
  6a193dcdf5055d468fe60a28bde299d9  libitm/eh_cpp.cc
  f78baec1d1eab254abc8070e717d0eaf  libitm/libitm.h
! e16c5b656f17d822f043142291d2e2c3  libitm/libitm.info
  8d44f8cc119e5c7cbc20c558b551475b  libitm/libitm.map
  ea467d7117853d139bb288ab75261139  libitm/libitm.spec.in
  3edc18f025f6fca2c5f78561df6d6fb1  libitm/libitm.texi
--- 58630,58636 ----
  cc44720eed2095c2e33a9822c78d4bad  libitm/dispatch.h
  6a193dcdf5055d468fe60a28bde299d9  libitm/eh_cpp.cc
  f78baec1d1eab254abc8070e717d0eaf  libitm/libitm.h
! e497b45a59c2875f45495c94e2b8a1b1  libitm/libitm.info
  8d44f8cc119e5c7cbc20c558b551475b  libitm/libitm.map
  ea467d7117853d139bb288ab75261139  libitm/libitm.spec.in
  3edc18f025f6fca2c5f78561df6d6fb1  libitm/libitm.texi
*************** ef24198422c19f99b0c41be6a16f7081  libitm
*** 58317,58323 ****
  51dca9f5bac1a7401ef8fe2e8a1bc266  libitm/useraction.cc
  a73f47caf40af3aa9d99fd40be255e9f  libitm/util.cc
  94d55d512a9ba36caa9b7df079bae19f  libjava/COPYING
! 3dfa41158145ebed68378a997271055e  libjava/ChangeLog
  03e1f38b916604fdf1470238201325f3  libjava/ChangeLog-1998
  691acb61fbd6a2235826ff55db5578be  libjava/ChangeLog-1999
  b58c6701706771a02bf00a77666941ef  libjava/ChangeLog-2000
--- 58670,58676 ----
  51dca9f5bac1a7401ef8fe2e8a1bc266  libitm/useraction.cc
  a73f47caf40af3aa9d99fd40be255e9f  libitm/util.cc
  94d55d512a9ba36caa9b7df079bae19f  libjava/COPYING
! d760cfbfe2dbb3b80288be4690fc1a06  libjava/ChangeLog
  03e1f38b916604fdf1470238201325f3  libjava/ChangeLog-1998
  691acb61fbd6a2235826ff55db5578be  libjava/ChangeLog-1999
  b58c6701706771a02bf00a77666941ef  libjava/ChangeLog-2000
*************** de54f80484e640306e109e785e4611c8  libjav
*** 58359,58365 ****
  880a25226e4e4e4c241663041d24f8dd  libjava/classpath/AUTHORS
  efd97e0bb913655e0c8b16fa78bdded4  libjava/classpath/BUGS
  af0004801732bc4b20d90f351cf80510  libjava/classpath/COPYING
! 6fb5de6f5688430ac05d9c073859ca21  libjava/classpath/ChangeLog
  3418fae58de967afe26d915a4b18d82c  libjava/classpath/ChangeLog-2003
  a5b72adb94a3c362738b0f52e57a82af  libjava/classpath/ChangeLog-2004
  61159c6e0802d0d2a92b3051003db5c5  libjava/classpath/ChangeLog-2005
--- 58712,58718 ----
  880a25226e4e4e4c241663041d24f8dd  libjava/classpath/AUTHORS
  efd97e0bb913655e0c8b16fa78bdded4  libjava/classpath/BUGS
  af0004801732bc4b20d90f351cf80510  libjava/classpath/COPYING
! ed84fd2a9d4853ca696f8321cde9b928  libjava/classpath/ChangeLog
  3418fae58de967afe26d915a4b18d82c  libjava/classpath/ChangeLog-2003
  a5b72adb94a3c362738b0f52e57a82af  libjava/classpath/ChangeLog-2004
  61159c6e0802d0d2a92b3051003db5c5  libjava/classpath/ChangeLog-2005
*************** a6cedb4991503f803e9f0870daf59c13  libjav
*** 58397,58417 ****
  b343eec566430e85d1f95c21438aa4ee  libjava/classpath/doc/api/Makefile.am
  8f716e277c4626f1f81544c6291101b3  libjava/classpath/doc/api/Makefile.in
  5ddd829b35fc94b0cdb119084089edb8  libjava/classpath/doc/cp-hacking.texinfo
! f9b69945c494e97650bbd895e445761d  libjava/classpath/doc/cp-tools.info
  0349e5c38c548584225423ef4bafd20b  libjava/classpath/doc/cp-tools.texinfo
  3155d9bd9a7bf4aff2ff0dfe4a2cb878  libjava/classpath/doc/cp-vmintegration.texinfo
! 2f0951df13268b63036fe5f1f7cc6859  libjava/classpath/doc/gappletviewer.1
! c142f978a30ba30a9c2eaefd681ba55b  libjava/classpath/doc/gjar.1
! b08f162d774835947486befbfb604e6b  libjava/classpath/doc/gjarsigner.1
! dc49c511b75ca74113a8590542490fd1  libjava/classpath/doc/gjavah.1
! 38d0b1743293573cb72dba69d25301db  libjava/classpath/doc/gjdoc.1
! 0e06efea38cccc559dfbc603eb320dd1  libjava/classpath/doc/gkeytool.1
! fc480e1785ebbb6a594757ccf5dc5cd0  libjava/classpath/doc/gnative2ascii.1
! 5c4d6b3f673e5cd09e3c93657ca2905e  libjava/classpath/doc/gorbd.1
! f288a8e43118d109cea87e9eb9e4668d  libjava/classpath/doc/grmid.1
! cb7926120ae2166df02d39b2fac1949d  libjava/classpath/doc/grmiregistry.1
! ea6483b026507cabc8fe3a5762d157c8  libjava/classpath/doc/gserialver.1
! 4be1cd763ad810fc2962bfe706d23b43  libjava/classpath/doc/gtnameserv.1
  7e4e31659df1c7e815f9151958dceef2  libjava/classpath/doc/texi2pod.pl
  01b23c87dcf82048a5958c8224653305  libjava/classpath/doc/texinfo.tex
  b1e0c0c30547d57d7a09b04d47c70b06  libjava/classpath/examples/.cvsignore
--- 58750,58770 ----
  b343eec566430e85d1f95c21438aa4ee  libjava/classpath/doc/api/Makefile.am
  8f716e277c4626f1f81544c6291101b3  libjava/classpath/doc/api/Makefile.in
  5ddd829b35fc94b0cdb119084089edb8  libjava/classpath/doc/cp-hacking.texinfo
! 4462ed34d5cb7ce2d72cf955dd003c93  libjava/classpath/doc/cp-tools.info
  0349e5c38c548584225423ef4bafd20b  libjava/classpath/doc/cp-tools.texinfo
  3155d9bd9a7bf4aff2ff0dfe4a2cb878  libjava/classpath/doc/cp-vmintegration.texinfo
! 88b4d6d549e283b09d11ccb47b2429ae  libjava/classpath/doc/gappletviewer.1
! eaabad7447280c868bf9c119680555c7  libjava/classpath/doc/gjar.1
! 6cebc72906660db45ee06ff98796ac67  libjava/classpath/doc/gjarsigner.1
! b97455338ed452b0ccc2e06902245546  libjava/classpath/doc/gjavah.1
! bd8601fff3dcd9e0dc012e3ab07c527a  libjava/classpath/doc/gjdoc.1
! d11abc9fdc9e77dd73a4936823379a81  libjava/classpath/doc/gkeytool.1
! eb3132fbd57b03841838c52c50071937  libjava/classpath/doc/gnative2ascii.1
! 4cd949899338cdd73a8bf39322905eaf  libjava/classpath/doc/gorbd.1
! e97aa261b619e5b0ddceeacdab811ad7  libjava/classpath/doc/grmid.1
! e41c6856156b2461c929cc7ee1544c6b  libjava/classpath/doc/grmiregistry.1
! 8f1c7d13acda63b445dbbdfe42ce2f8d  libjava/classpath/doc/gserialver.1
! 07887368609e04a04c056ea0c5a987a6  libjava/classpath/doc/gtnameserv.1
  7e4e31659df1c7e815f9151958dceef2  libjava/classpath/doc/texi2pod.pl
  01b23c87dcf82048a5958c8224653305  libjava/classpath/doc/texinfo.tex
  b1e0c0c30547d57d7a09b04d47c70b06  libjava/classpath/examples/.cvsignore
*************** c4f13c76610deabfbf13fce4ed092a52  libjav
*** 76669,76675 ****
  1faaf0b92549ee71e16eb962081a1872  libjava/include/execution.h
  ed8221ad16d866991c87f374d0d6f8ac  libjava/include/freebsd-signal.h
  09a868e3190a355e45b5c4cee892bb03  libjava/include/hppa-signal.h
! 91ff4b6a8a20f1f33d47756e0dbbba33  libjava/include/i386-signal.h
  7d0076c1f7f281bd8d753319bf454030  libjava/include/java-assert.h
  d66bf0f1a1d12efd11fc047959c52eab  libjava/include/java-chardecomp.h
  201317d1f75ba272abb6263909ed4427  libjava/include/java-chartables.h
--- 77022,77028 ----
  1faaf0b92549ee71e16eb962081a1872  libjava/include/execution.h
  ed8221ad16d866991c87f374d0d6f8ac  libjava/include/freebsd-signal.h
  09a868e3190a355e45b5c4cee892bb03  libjava/include/hppa-signal.h
! ab457bf4271dd7bdd234922138b6e3b0  libjava/include/i386-signal.h
  7d0076c1f7f281bd8d753319bf454030  libjava/include/java-assert.h
  d66bf0f1a1d12efd11fc047959c52eab  libjava/include/java-chardecomp.h
  201317d1f75ba272abb6263909ed4427  libjava/include/java-chartables.h
*************** c90f18ac05fb055c54f64951e7cfe38c  libjav
*** 76691,76703 ****
  fe798ea9b01475cd5aef25ba976d5c6c  libjava/include/posix-threads.h
  35f6b405f2474f5bfd7542ffb405e6ea  libjava/include/posix.h
  39567a786a96e4caf11e79958c9c6478  libjava/include/powerpc-signal.h
! a7e7d0e74aa09f4b1dbeb93b11fbccd3  libjava/include/s390-signal.h
  3b6efcc23c74f59be6eb053a871e0054  libjava/include/sh-signal.h
  1ded054093de910d9786c62bc4fe8cc6  libjava/include/stamp-h.in
  fcc68eea0e37ca05d241fcd08098f4d2  libjava/include/win32-signal.h
  cff451012603b0e968c4a532b81ce111  libjava/include/win32-threads.h
  a35cc4de347a79bb1f0d6e07524673ea  libjava/include/win32.h
! bba824e7dbbb44e45c1f3c12d5e48b91  libjava/include/x86_64-signal.h
  dc82ab7a9f0adeb2ce23d76a54149cce  libjava/interpret-run.cc
  cf9d946fce6b09d9a87ce52af038120d  libjava/interpret.cc
  47bcf8aa4e9faeac1d3f56fe68104ed4  libjava/java/applet/Applet$AccessibleApplet.h
--- 77044,77056 ----
  fe798ea9b01475cd5aef25ba976d5c6c  libjava/include/posix-threads.h
  35f6b405f2474f5bfd7542ffb405e6ea  libjava/include/posix.h
  39567a786a96e4caf11e79958c9c6478  libjava/include/powerpc-signal.h
! 7fd65fb6417fc8c18aabaa020f06f061  libjava/include/s390-signal.h
  3b6efcc23c74f59be6eb053a871e0054  libjava/include/sh-signal.h
  1ded054093de910d9786c62bc4fe8cc6  libjava/include/stamp-h.in
  fcc68eea0e37ca05d241fcd08098f4d2  libjava/include/win32-signal.h
  cff451012603b0e968c4a532b81ce111  libjava/include/win32-threads.h
  a35cc4de347a79bb1f0d6e07524673ea  libjava/include/win32.h
! 668be378f580dd3e51e79ec3e891b4cb  libjava/include/x86_64-signal.h
  dc82ab7a9f0adeb2ce23d76a54149cce  libjava/interpret-run.cc
  cf9d946fce6b09d9a87ce52af038120d  libjava/interpret.cc
  47bcf8aa4e9faeac1d3f56fe68104ed4  libjava/java/applet/Applet$AccessibleApplet.h
*************** a40a8f1527e2703fe2f08bf7276d8591  libjav
*** 80629,80635 ****
  697ca1de35069bd86456a5a19b9c4f11  libjava/libgcj.ver
  184718636f014ef2ca46d62ba8d6c3bf  libjava/libgcj_bc.c
  e3eda01d9815f8d24aae2dbd89b68b06  libjava/libltdl/COPYING.LIB
! cdc964ea5d8afe276afd4019730755dc  libjava/libltdl/ChangeLog
  349267319e3d55dcf180a20f85394144  libjava/libltdl/Makefile.am
  930c6383a37e6cc8e0625c9a281eda95  libjava/libltdl/Makefile.in
  36da24f9facf00b349ea10dba3789d92  libjava/libltdl/README
--- 80982,80988 ----
  697ca1de35069bd86456a5a19b9c4f11  libjava/libgcj.ver
  184718636f014ef2ca46d62ba8d6c3bf  libjava/libgcj_bc.c
  e3eda01d9815f8d24aae2dbd89b68b06  libjava/libltdl/COPYING.LIB
! 1f641d4d380725a7081310325db7e0f3  libjava/libltdl/ChangeLog
  349267319e3d55dcf180a20f85394144  libjava/libltdl/Makefile.am
  930c6383a37e6cc8e0625c9a281eda95  libjava/libltdl/Makefile.in
  36da24f9facf00b349ea10dba3789d92  libjava/libltdl/README
*************** d41d8cd98f00b204e9800998ecf8427e  libjav
*** 82327,82333 ****
  434ac04eb066f5075299583492846410  libjava/verify.cc
  355440a0c2fb5e16259d7ae381b37ed5  libjava/win32-threads.cc
  434d5e5e91727dec004f0d1d1fab47ec  libjava/win32.cc
! cc463ee15c3677603c4b4546f7cc00f8  libmpx/ChangeLog
  38b5a5961bf81cf96b7905974a000dc2  libmpx/Makefile.am
  c06ae006bd8b424e4f061799aef2cdda  libmpx/Makefile.in
  9883ed42b491d8aea83fdde90561cf2a  libmpx/acinclude.m4
--- 82680,82686 ----
  434ac04eb066f5075299583492846410  libjava/verify.cc
  355440a0c2fb5e16259d7ae381b37ed5  libjava/win32-threads.cc
  434d5e5e91727dec004f0d1d1fab47ec  libjava/win32.cc
! 0bd71d70ec31ccadcafcbf59576243ec  libmpx/ChangeLog
  38b5a5961bf81cf96b7905974a000dc2  libmpx/Makefile.am
  c06ae006bd8b424e4f061799aef2cdda  libmpx/Makefile.in
  9883ed42b491d8aea83fdde90561cf2a  libmpx/acinclude.m4
*************** b8cda9498fe438be172ab60c127bcab9  libmpx
*** 82350,82356 ****
  e7c62aca341ea472234d7cb0bc4af328  libmpx/mpxwrap/libmpxwrappers.map
  145eb76d9c7fdca67f6c135e1cefee8c  libmpx/mpxwrap/libtool-version
  9c96cc2c84e2e0726087f88be3ab89df  libmpx/mpxwrap/mpx_wrappers.c
! 8d9f6a08be9dfc9ea42d82fc026c2081  libobjc/ChangeLog
  763220a9cda9d9f00753d8a6c0fe39be  libobjc/Makefile.in
  d0e1ce0d22f4a70cc281a309ea68b3ed  libobjc/NXConstStr.m
  5ba66867b28782599f757e4f75abede5  libobjc/Object.m
--- 82703,82709 ----
  e7c62aca341ea472234d7cb0bc4af328  libmpx/mpxwrap/libmpxwrappers.map
  145eb76d9c7fdca67f6c135e1cefee8c  libmpx/mpxwrap/libtool-version
  9c96cc2c84e2e0726087f88be3ab89df  libmpx/mpxwrap/mpx_wrappers.c
! 8878808d2ce038a2b5b299f9c1b249a0  libobjc/ChangeLog
  763220a9cda9d9f00753d8a6c0fe39be  libobjc/Makefile.in
  d0e1ce0d22f4a70cc281a309ea68b3ed  libobjc/NXConstStr.m
  5ba66867b28782599f757e4f75abede5  libobjc/Object.m
*************** c82e20b14bd8b45d9be26b4a4cc63a7c  libobj
*** 82407,82413 ****
  f16af417a86429e829800ada9bca9a38  libobjc/selector.c
  8dc0dccd7fc33f25c2112f5b316edee4  libobjc/sendmsg.c
  9eddfa400f3da7d2b87c28df3fdbfbff  libobjc/thr.c
! 38c5e649641ad793b38610fed85bd8ce  liboffloadmic/ChangeLog
  d9379a7f4b270d8037af9b022d97162a  liboffloadmic/Makefile.am
  db648fbd37bdf650ef8973a828df451c  liboffloadmic/Makefile.in
  bef8d5fd63eb08613df8c899248a1b52  liboffloadmic/aclocal.m4
--- 82760,82766 ----
  f16af417a86429e829800ada9bca9a38  libobjc/selector.c
  8dc0dccd7fc33f25c2112f5b316edee4  libobjc/sendmsg.c
  9eddfa400f3da7d2b87c28df3fdbfbff  libobjc/thr.c
! 803e5faabe9fc8e62d2325e7adc6d10b  liboffloadmic/ChangeLog
  d9379a7f4b270d8037af9b022d97162a  liboffloadmic/Makefile.am
  db648fbd37bdf650ef8973a828df451c  liboffloadmic/Makefile.in
  bef8d5fd63eb08613df8c899248a1b52  liboffloadmic/aclocal.m4
*************** c7f927dc439cfa088672cf6f24109c7a  liboff
*** 82506,82512 ****
  dff5c8575c49d6aa71e549b0fa021479  liboffloadmic/runtime/orsl-lite/version.txt
  ea59b10dc6472b3058f3f2ca1e7eab73  liboffloadmic/runtime/use_mpss2.txt
  a916467b91076e631dd8edb7424769c7  libquadmath/COPYING.LIB
! de73725f849dafb8a296e0270408b317  libquadmath/ChangeLog
  1448bac7c8ec1dcb91ad8ed1d924987e  libquadmath/Makefile.am
  bab466a846444e7cdc4b4f158b498546  libquadmath/Makefile.in
  4c8b4478a1031d129e7cc6b341876b99  libquadmath/acinclude.m4
--- 82859,82865 ----
  dff5c8575c49d6aa71e549b0fa021479  liboffloadmic/runtime/orsl-lite/version.txt
  ea59b10dc6472b3058f3f2ca1e7eab73  liboffloadmic/runtime/use_mpss2.txt
  a916467b91076e631dd8edb7424769c7  libquadmath/COPYING.LIB
! a009a6a5d70d7c48923fedf6f893b479  libquadmath/ChangeLog
  1448bac7c8ec1dcb91ad8ed1d924987e  libquadmath/Makefile.am
  bab466a846444e7cdc4b4f158b498546  libquadmath/Makefile.in
  4c8b4478a1031d129e7cc6b341876b99  libquadmath/acinclude.m4
*************** aece970dd74d47d051257c4d4d1e91fa  libqua
*** 82514,82520 ****
  bf09ede5c6d78e3d132bde0f933590d8  libquadmath/config.h.in
  0caf55cff821abd477a577911f10bb88  libquadmath/configure
  29e66c9d2ef7b7621276c63bee20d622  libquadmath/configure.ac
! 80f130f61181e92a55cb6fad08c8215d  libquadmath/libquadmath.info
  508b832d29d5c4de0127dd1e89426d56  libquadmath/libquadmath.texi
  77280bb7ee423875e03d9c0d34527df6  libquadmath/libtool-version
  f44065462735b4699d44588271a5f09a  libquadmath/math/acoshq.c
--- 82867,82873 ----
  bf09ede5c6d78e3d132bde0f933590d8  libquadmath/config.h.in
  0caf55cff821abd477a577911f10bb88  libquadmath/configure
  29e66c9d2ef7b7621276c63bee20d622  libquadmath/configure.ac
! ea33a867263cfd24bbedead786520e25  libquadmath/libquadmath.info
  508b832d29d5c4de0127dd1e89426d56  libquadmath/libquadmath.texi
  77280bb7ee423875e03d9c0d34527df6  libquadmath/libtool-version
  f44065462735b4699d44588271a5f09a  libquadmath/math/acoshq.c
*************** faf9f5ae44363f9f6507c0011d46db13  libqua
*** 82589,82595 ****
  d2a9f3ef6892596a69d2b49807b7ec84  libquadmath/math/remainderq.c
  7e5da1ab7b5e81c6b3b2a1a459e75533  libquadmath/math/remquoq.c
  0c856dcd115d0745afdd5e2cf93d7af5  libquadmath/math/rintq.c
! 5e6d299d4271aedb52f70a52b43d0297  libquadmath/math/roundq.c
  9432aa412a476bd039bef505158b67bb  libquadmath/math/scalblnq.c
  e0a518547cd1a798af59f2b2a71f9516  libquadmath/math/scalbnq.c
  95483c7c7403c55b0257b2f7613f144c  libquadmath/math/signbitq.c
--- 82942,82948 ----
  d2a9f3ef6892596a69d2b49807b7ec84  libquadmath/math/remainderq.c
  7e5da1ab7b5e81c6b3b2a1a459e75533  libquadmath/math/remquoq.c
  0c856dcd115d0745afdd5e2cf93d7af5  libquadmath/math/rintq.c
! f9ba4d7c854e3e920e53f280c53554ba  libquadmath/math/roundq.c
  9432aa412a476bd039bef505158b67bb  libquadmath/math/scalblnq.c
  e0a518547cd1a798af59f2b2a71f9516  libquadmath/math/scalbnq.c
  95483c7c7403c55b0257b2f7613f144c  libquadmath/math/signbitq.c
*************** e766022f8615b72cbc38335d262e9d3d  libqua
*** 82637,82643 ****
  a81cc82679e80c86cfbd5575867450d0  libquadmath/strtod/strtod_l.c
  da808e110fc09ebd41ebd405790a70df  libquadmath/strtod/strtoflt128.c
  d15a18f7c46ba2add6148edc5b7563c0  libquadmath/strtod/tens_in_limb.c
! e456c86a1637b73152682035f97cada0  libsanitizer/ChangeLog
  0249c37748936faf5b1efd5789587909  libsanitizer/LICENSE.TXT
  7e6fd996e5c8c788163f86d752c1f4d4  libsanitizer/MERGE
  cd6c39551a9d69f3b38689389e5513be  libsanitizer/Makefile.am
--- 82990,82996 ----
  a81cc82679e80c86cfbd5575867450d0  libquadmath/strtod/strtod_l.c
  da808e110fc09ebd41ebd405790a70df  libquadmath/strtod/strtoflt128.c
  d15a18f7c46ba2add6148edc5b7563c0  libquadmath/strtod/tens_in_limb.c
! 3a323f01b6afb56de0f3f8706ffd8e30  libsanitizer/ChangeLog
  0249c37748936faf5b1efd5789587909  libsanitizer/LICENSE.TXT
  7e6fd996e5c8c788163f86d752c1f4d4  libsanitizer/MERGE
  cd6c39551a9d69f3b38689389e5513be  libsanitizer/Makefile.am
*************** e2e43e7a8f91470f12e62cdbd16a6b7b  libsan
*** 82655,82667 ****
  9e25e6ed0878262abbb32af400b51332  libsanitizer/asan/asan_fake_stack.cc
  3f2e6efe438573ebc727d40bd73600b2  libsanitizer/asan/asan_fake_stack.h
  bff9fcd61a3b7308ef806ba79cae807a  libsanitizer/asan/asan_flags.h
! 318c1e07c69370e1160e7b8038766aa3  libsanitizer/asan/asan_globals.cc
  c9e3e373cdea9a94369f083d3dd574a3  libsanitizer/asan/asan_init_version.h
  c589debb984a2a2e9e8310f0189ca278  libsanitizer/asan/asan_interceptors.cc
  0cf374ded3eec9201dcb25743e6b1343  libsanitizer/asan/asan_interceptors.h
  3f228ea8e201536005c8ee73f01f1554  libsanitizer/asan/asan_interface_internal.h
  ceeca9aa72576616cd62326dae394ace  libsanitizer/asan/asan_internal.h
! 7f8025c84cc15bcad8696ac479b00f6b  libsanitizer/asan/asan_linux.cc
  68b329da9893e34099c7d8ad5cb9c940  libsanitizer/asan/asan_lock.h
  ebb6b1529cb179cba650758f6ca55c42  libsanitizer/asan/asan_mac.cc
  7f4eda2466f1bea4ffea043b3ad74fb1  libsanitizer/asan/asan_malloc_linux.cc
--- 83008,83020 ----
  9e25e6ed0878262abbb32af400b51332  libsanitizer/asan/asan_fake_stack.cc
  3f2e6efe438573ebc727d40bd73600b2  libsanitizer/asan/asan_fake_stack.h
  bff9fcd61a3b7308ef806ba79cae807a  libsanitizer/asan/asan_flags.h
! d4a37c1da7781d76a53dde1c7af5e9ac  libsanitizer/asan/asan_globals.cc
  c9e3e373cdea9a94369f083d3dd574a3  libsanitizer/asan/asan_init_version.h
  c589debb984a2a2e9e8310f0189ca278  libsanitizer/asan/asan_interceptors.cc
  0cf374ded3eec9201dcb25743e6b1343  libsanitizer/asan/asan_interceptors.h
  3f228ea8e201536005c8ee73f01f1554  libsanitizer/asan/asan_interface_internal.h
  ceeca9aa72576616cd62326dae394ace  libsanitizer/asan/asan_internal.h
! fc8dad21adc13a03103e1a84e73b8ee3  libsanitizer/asan/asan_linux.cc
  68b329da9893e34099c7d8ad5cb9c940  libsanitizer/asan/asan_lock.h
  ebb6b1529cb179cba650758f6ca55c42  libsanitizer/asan/asan_mac.cc
  7f4eda2466f1bea4ffea043b3ad74fb1  libsanitizer/asan/asan_malloc_linux.cc
*************** f9cbdce21b8eb550bf817e5a78bbb60b  libsan
*** 82752,82758 ****
  40f1f8c70306b4bd87eaf2b49f038521  libsanitizer/sanitizer_common/sanitizer_bvgraph.h
  e0ee5aa3d212e79d046854b727eb7856  libsanitizer/sanitizer_common/sanitizer_common.cc
  260b73a1e54c66318253ccb35531e49d  libsanitizer/sanitizer_common/sanitizer_common.h
! 6849277da117396550752c1cbabff154  libsanitizer/sanitizer_common/sanitizer_common_interceptors.inc
  a277e925307182488fdcefc55d6b5fdf  libsanitizer/sanitizer_common/sanitizer_common_interceptors_format.inc
  61354e278f0f8ebb246a86aa16206f57  libsanitizer/sanitizer_common/sanitizer_common_interceptors_ioctl.inc
  788f997999819721343cc44c2cd77078  libsanitizer/sanitizer_common/sanitizer_common_libcdep.cc
--- 83105,83111 ----
  40f1f8c70306b4bd87eaf2b49f038521  libsanitizer/sanitizer_common/sanitizer_bvgraph.h
  e0ee5aa3d212e79d046854b727eb7856  libsanitizer/sanitizer_common/sanitizer_common.cc
  260b73a1e54c66318253ccb35531e49d  libsanitizer/sanitizer_common/sanitizer_common.h
! 1e849be95c55a86f4bc92c8870058939  libsanitizer/sanitizer_common/sanitizer_common_interceptors.inc
  a277e925307182488fdcefc55d6b5fdf  libsanitizer/sanitizer_common/sanitizer_common_interceptors_format.inc
  61354e278f0f8ebb246a86aa16206f57  libsanitizer/sanitizer_common/sanitizer_common_interceptors_ioctl.inc
  788f997999819721343cc44c2cd77078  libsanitizer/sanitizer_common/sanitizer_common_libcdep.cc
*************** fb5a0dd8bbbe6d8f4c17b5a334efb363  libsan
*** 82773,82780 ****
  b8cf91a8004063e818ddc3b974684dd0  libsanitizer/sanitizer_common/sanitizer_libc.h
  87431ff0083dce8922163f8d02ab2d57  libsanitizer/sanitizer_common/sanitizer_libignore.cc
  7084d1167f0373c4c33ac55278b52d12  libsanitizer/sanitizer_common/sanitizer_libignore.h
! d8d695171c2d3b30da0688ae6152387f  libsanitizer/sanitizer_common/sanitizer_linux.cc
! f64151b252ebb4dfbc03161aa08c0629  libsanitizer/sanitizer_common/sanitizer_linux.h
  0afc9fdb4e7311045444aad3ba62ed9d  libsanitizer/sanitizer_common/sanitizer_linux_libcdep.cc
  101b68cc2e80c2e6adaff9bb138dbdff  libsanitizer/sanitizer_common/sanitizer_list.h
  8ac36428f3417827bce4e4c65628842b  libsanitizer/sanitizer_common/sanitizer_mac.cc
--- 83126,83133 ----
  b8cf91a8004063e818ddc3b974684dd0  libsanitizer/sanitizer_common/sanitizer_libc.h
  87431ff0083dce8922163f8d02ab2d57  libsanitizer/sanitizer_common/sanitizer_libignore.cc
  7084d1167f0373c4c33ac55278b52d12  libsanitizer/sanitizer_common/sanitizer_libignore.h
! a7257e086c40925ffc08b3207dfa32b6  libsanitizer/sanitizer_common/sanitizer_linux.cc
! 748a548f324019f73a2f57c544d64003  libsanitizer/sanitizer_common/sanitizer_linux.h
  0afc9fdb4e7311045444aad3ba62ed9d  libsanitizer/sanitizer_common/sanitizer_linux_libcdep.cc
  101b68cc2e80c2e6adaff9bb138dbdff  libsanitizer/sanitizer_common/sanitizer_list.h
  8ac36428f3417827bce4e4c65628842b  libsanitizer/sanitizer_common/sanitizer_mac.cc
*************** f64151b252ebb4dfbc03161aa08c0629  libsan
*** 82786,82793 ****
  dde8b3295dbc6c33f147dca267d0a33d  libsanitizer/sanitizer_common/sanitizer_platform.h
  6c38f939b0010f3c042dec9895324f02  libsanitizer/sanitizer_common/sanitizer_platform_interceptors.h
  3af384999d9dcbaba93afe259ebfc361  libsanitizer/sanitizer_common/sanitizer_platform_limits_linux.cc
! da589ca043b230c90f0d0dce66da1951  libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.cc
! bc5b5f6488dbd05b55e941a5aa3ca27a  libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.h
  ea014a2fe636d7ffd148250edccf011b  libsanitizer/sanitizer_common/sanitizer_posix.cc
  204afcb2b1e92a8218f9b5ea218e4d7d  libsanitizer/sanitizer_common/sanitizer_posix_libcdep.cc
  f43416744951b051f261bb2641ea69ff  libsanitizer/sanitizer_common/sanitizer_printf.cc
--- 83139,83146 ----
  dde8b3295dbc6c33f147dca267d0a33d  libsanitizer/sanitizer_common/sanitizer_platform.h
  6c38f939b0010f3c042dec9895324f02  libsanitizer/sanitizer_common/sanitizer_platform_interceptors.h
  3af384999d9dcbaba93afe259ebfc361  libsanitizer/sanitizer_common/sanitizer_platform_limits_linux.cc
! ce301ed58db3dd93eb0998e92fe42c3a  libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.cc
! 63b5c193fcc43ef0bec93f366fbb9270  libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.h
  ea014a2fe636d7ffd148250edccf011b  libsanitizer/sanitizer_common/sanitizer_posix.cc
  204afcb2b1e92a8218f9b5ea218e4d7d  libsanitizer/sanitizer_common/sanitizer_posix_libcdep.cc
  f43416744951b051f261bb2641ea69ff  libsanitizer/sanitizer_common/sanitizer_printf.cc
*************** ff09e59b621101f99f926e70b40f72a9  libsan
*** 82807,82813 ****
  1cd47ca2eb36c598a4a004a560b57269  libsanitizer/sanitizer_common/sanitizer_stacktrace_printer.cc
  50aa19a1c254c05b1a1827518c8be028  libsanitizer/sanitizer_common/sanitizer_stacktrace_printer.h
  71553695c0220a372f8f1017f387f1d4  libsanitizer/sanitizer_common/sanitizer_stoptheworld.h
! eee1bc8602e20727f8152fde0d1e31d9  libsanitizer/sanitizer_common/sanitizer_stoptheworld_linux_libcdep.cc
  2d0f12de58f74668f495bfd2e80338be  libsanitizer/sanitizer_common/sanitizer_suppressions.cc
  b97fe46f19659c5565f886fd9cc2f7a7  libsanitizer/sanitizer_common/sanitizer_suppressions.h
  a52600751ce2629ad4ed7621eed96f13  libsanitizer/sanitizer_common/sanitizer_symbolizer.cc
--- 83160,83166 ----
  1cd47ca2eb36c598a4a004a560b57269  libsanitizer/sanitizer_common/sanitizer_stacktrace_printer.cc
  50aa19a1c254c05b1a1827518c8be028  libsanitizer/sanitizer_common/sanitizer_stacktrace_printer.h
  71553695c0220a372f8f1017f387f1d4  libsanitizer/sanitizer_common/sanitizer_stoptheworld.h
! 0d9c3a2ce3e2f33c455a7cb17fea4f11  libsanitizer/sanitizer_common/sanitizer_stoptheworld_linux_libcdep.cc
  2d0f12de58f74668f495bfd2e80338be  libsanitizer/sanitizer_common/sanitizer_suppressions.cc
  b97fe46f19659c5565f886fd9cc2f7a7  libsanitizer/sanitizer_common/sanitizer_suppressions.h
  a52600751ce2629ad4ed7621eed96f13  libsanitizer/sanitizer_common/sanitizer_symbolizer.cc
*************** fb0d314e8f79beda3e4f5e9d34e6e037  libsan
*** 82855,82866 ****
  3f67a27ad5aa85607f89d53dfc8f8bb7  libsanitizer/tsan/tsan_mutexset.cc
  c9066a77a2c96f050e7b42febcff4b40  libsanitizer/tsan/tsan_mutexset.h
  56fa54c1092ac15d76e2e78ca29f05a4  libsanitizer/tsan/tsan_platform.h
! 155e69915833d86f8661bbbbc2a832c4  libsanitizer/tsan/tsan_platform_linux.cc
  9d6da11192fb1ea93028c51474f387a2  libsanitizer/tsan/tsan_platform_mac.cc
  cfd3c5f894450c981d3355a570520309  libsanitizer/tsan/tsan_platform_windows.cc
  8b422a5c4555affacc536e07011380c7  libsanitizer/tsan/tsan_report.cc
  f6b5c5f5344c28ee744c27f55001bd0f  libsanitizer/tsan/tsan_report.h
! df4e10595815f681c1de02ec7ec264a5  libsanitizer/tsan/tsan_rtl.cc
  740532c6728d8419d79218a4ffd6ecc1  libsanitizer/tsan/tsan_rtl.h
  b0666e41ed119190dc36403e13d64a8f  libsanitizer/tsan/tsan_rtl_amd64.S
  347eb27d3ef088c0917d89530c7918d6  libsanitizer/tsan/tsan_rtl_mutex.cc
--- 83208,83219 ----
  3f67a27ad5aa85607f89d53dfc8f8bb7  libsanitizer/tsan/tsan_mutexset.cc
  c9066a77a2c96f050e7b42febcff4b40  libsanitizer/tsan/tsan_mutexset.h
  56fa54c1092ac15d76e2e78ca29f05a4  libsanitizer/tsan/tsan_platform.h
! c3f9f18331dc3c3c4595be7b0980791e  libsanitizer/tsan/tsan_platform_linux.cc
  9d6da11192fb1ea93028c51474f387a2  libsanitizer/tsan/tsan_platform_mac.cc
  cfd3c5f894450c981d3355a570520309  libsanitizer/tsan/tsan_platform_windows.cc
  8b422a5c4555affacc536e07011380c7  libsanitizer/tsan/tsan_report.cc
  f6b5c5f5344c28ee744c27f55001bd0f  libsanitizer/tsan/tsan_report.h
! 87f97be1e31b2ce722540a6c09d9dcaf  libsanitizer/tsan/tsan_rtl.cc
  740532c6728d8419d79218a4ffd6ecc1  libsanitizer/tsan/tsan_rtl.h
  b0666e41ed119190dc36403e13d64a8f  libsanitizer/tsan/tsan_rtl_amd64.S
  347eb27d3ef088c0917d89530c7918d6  libsanitizer/tsan/tsan_rtl_mutex.cc
*************** cf771d340a7607a12d384bb5d20c4dd1  libsan
*** 82896,82902 ****
  2219f17a5c8740755ef8e9831cbaa8fe  libsanitizer/ubsan/ubsan_type_hash.h
  ca39ca0c05ea0a6b9d3038da3653ab4d  libsanitizer/ubsan/ubsan_value.cc
  324234cf794b69cb2bff3c3e5f4ad947  libsanitizer/ubsan/ubsan_value.h
! 68764d77398b1bc14d7d74d0b18c64f2  libssp/ChangeLog
  01d9954c400db04da1b8705029e6d9d9  libssp/Makefile.am
  6f9651cc4e77f9e7629b0142b05a90e0  libssp/Makefile.in
  8b0dd0c2a8b446bf5577a8562ad19885  libssp/aclocal.m4
--- 83249,83255 ----
  2219f17a5c8740755ef8e9831cbaa8fe  libsanitizer/ubsan/ubsan_type_hash.h
  ca39ca0c05ea0a6b9d3038da3653ab4d  libsanitizer/ubsan/ubsan_value.cc
  324234cf794b69cb2bff3c3e5f4ad947  libsanitizer/ubsan/ubsan_value.h
! 2496c2dfa54fe93ca7d88cce41b23ccd  libssp/ChangeLog
  01d9954c400db04da1b8705029e6d9d9  libssp/Makefile.am
  6f9651cc4e77f9e7629b0142b05a90e0  libssp/Makefile.in
  8b0dd0c2a8b446bf5577a8562ad19885  libssp/aclocal.m4
*************** aeb2f84c5e8ba3215469d507bd2efe57  libssp
*** 82925,82931 ****
  e9ab923d2562bf5f5be6883dfb9f0184  libssp/strncpy-chk.c
  5e0d8b8a766c31b12354baec1b7a159c  libssp/vsnprintf-chk.c
  f56ab1f8922a16f7e9e4f5270ae1e34e  libssp/vsprintf-chk.c
! 55ccb0fa9cd0b01a6baf4d7ede1f459e  libstdc++-v3/ChangeLog
  7aa6c40440a44fcf5ec94c066160c2f8  libstdc++-v3/ChangeLog-1998
  7aff86600b6a1ed3fa87305075a92db0  libstdc++-v3/ChangeLog-1999
  a6f28e8fc9bb07696a9e068b439a3a87  libstdc++-v3/ChangeLog-2000
--- 83278,83284 ----
  e9ab923d2562bf5f5be6883dfb9f0184  libssp/strncpy-chk.c
  5e0d8b8a766c31b12354baec1b7a159c  libssp/vsnprintf-chk.c
  f56ab1f8922a16f7e9e4f5270ae1e34e  libssp/vsprintf-chk.c
! 7b42a680e93801338e3ce63cc2024a68  libstdc++-v3/ChangeLog
  7aa6c40440a44fcf5ec94c066160c2f8  libstdc++-v3/ChangeLog-1998
  7aff86600b6a1ed3fa87305075a92db0  libstdc++-v3/ChangeLog-1999
  a6f28e8fc9bb07696a9e068b439a3a87  libstdc++-v3/ChangeLog-2000
*************** b331fae97e334afde1bd5fa125610458  libstd
*** 82946,82954 ****
  2f5e909eec2c4f92b279c38a7cb69519  libstdc++-v3/Makefile.am
  fdf3f57800ae00249d53fb959b9dbd66  libstdc++-v3/Makefile.in
  f372af73db4ac0ad88e43199e1f29e08  libstdc++-v3/README
! 0160f7988fd25808129a9f9accc570b7  libstdc++-v3/acinclude.m4
  591861c10ebb94a293dd2f26c209cb0d  libstdc++-v3/aclocal.m4
! 67fc7566dc2ccd21cc1bcf14e604f0ae  libstdc++-v3/config.h.in
  fa83f308985ab4315aa21b8ee20397d0  libstdc++-v3/config/abi/compatibility.h
  8f8278bf985edc5efd46151ae918c5a5  libstdc++-v3/config/abi/post/aarch64-linux-gnu/baseline_symbols.txt
  c6d782dd53461a39b45d87d5854d8558  libstdc++-v3/config/abi/post/alpha-linux-gnu/baseline_symbols.txt
--- 83299,83307 ----
  2f5e909eec2c4f92b279c38a7cb69519  libstdc++-v3/Makefile.am
  fdf3f57800ae00249d53fb959b9dbd66  libstdc++-v3/Makefile.in
  f372af73db4ac0ad88e43199e1f29e08  libstdc++-v3/README
! 9070fb014373005bbf4f03c42509aee1  libstdc++-v3/acinclude.m4
  591861c10ebb94a293dd2f26c209cb0d  libstdc++-v3/aclocal.m4
! 504f3be081306040bd943fb6aff48ab7  libstdc++-v3/config.h.in
  fa83f308985ab4315aa21b8ee20397d0  libstdc++-v3/config/abi/compatibility.h
  8f8278bf985edc5efd46151ae918c5a5  libstdc++-v3/config/abi/post/aarch64-linux-gnu/baseline_symbols.txt
  c6d782dd53461a39b45d87d5854d8558  libstdc++-v3/config/abi/post/alpha-linux-gnu/baseline_symbols.txt
*************** c09fac9d2bc106535f90bf9019d32ee2  libstd
*** 82974,82980 ****
  c2bec88149705d7d29259bc1aecf3def  libstdc++-v3/config/abi/post/x86_64-linux-gnu/baseline_symbols.txt
  723884d82c93b73bcdc5d6e308ff20f6  libstdc++-v3/config/abi/post/x86_64-linux-gnu/x32/baseline_symbols.txt
  5c4c38aeca254313c616b84337c937c3  libstdc++-v3/config/abi/pre/float128.ver
! 654a95ec5a0e2e9eb2011fc25e721f14  libstdc++-v3/config/abi/pre/gnu-versioned-namespace.ver
  3f42238ca23c358fc7e2937d955273e1  libstdc++-v3/config/abi/pre/gnu.ver
  6f099054f1d75e3e178e42c4d8e4c6e1  libstdc++-v3/config/abi/pre/none.ver
  4485e3f79adea2a511a0f612be028ab7  libstdc++-v3/config/allocator/bitmap_allocator_base.h
--- 83327,83333 ----
  c2bec88149705d7d29259bc1aecf3def  libstdc++-v3/config/abi/post/x86_64-linux-gnu/baseline_symbols.txt
  723884d82c93b73bcdc5d6e308ff20f6  libstdc++-v3/config/abi/post/x86_64-linux-gnu/x32/baseline_symbols.txt
  5c4c38aeca254313c616b84337c937c3  libstdc++-v3/config/abi/pre/float128.ver
! 9c48801f1e2365da09ab84351e72d836  libstdc++-v3/config/abi/pre/gnu-versioned-namespace.ver
  3f42238ca23c358fc7e2937d955273e1  libstdc++-v3/config/abi/pre/gnu.ver
  6f099054f1d75e3e178e42c4d8e4c6e1  libstdc++-v3/config/abi/pre/none.ver
  4485e3f79adea2a511a0f612be028ab7  libstdc++-v3/config/allocator/bitmap_allocator_base.h
*************** eca745fffa95b78067b4f5d117df2fcf  libstd
*** 83007,83013 ****
  4813dc2422aa2baa113d3987cd05d616  libstdc++-v3/config/cpu/sh/atomicity.h
  6d4cc4b67b84728431c32ffd30a44ca8  libstdc++-v3/config/cpu/sparc/atomic_word.h
  7efc9fc19e31640aa1d995fca8eb028d  libstdc++-v3/config/cpu/sparc/atomicity.h
! be22d2bbc7347b6919cc0082a0612072  libstdc++-v3/config/io/basic_file_stdio.cc
  6b29d07c8f9c4e6f73deb24dcb8efefd  libstdc++-v3/config/io/basic_file_stdio.h
  7478fd46710190cc668052049b87a562  libstdc++-v3/config/io/c_io_stdio.h
  06abcab50dea90d6c1d3a00cd3528790  libstdc++-v3/config/locale/darwin/ctype_members.cc
--- 83360,83366 ----
  4813dc2422aa2baa113d3987cd05d616  libstdc++-v3/config/cpu/sh/atomicity.h
  6d4cc4b67b84728431c32ffd30a44ca8  libstdc++-v3/config/cpu/sparc/atomic_word.h
  7efc9fc19e31640aa1d995fca8eb028d  libstdc++-v3/config/cpu/sparc/atomicity.h
! 89d99c991b9f8087088c85d23effd151  libstdc++-v3/config/io/basic_file_stdio.cc
  6b29d07c8f9c4e6f73deb24dcb8efefd  libstdc++-v3/config/io/basic_file_stdio.h
  7478fd46710190cc668052049b87a562  libstdc++-v3/config/io/c_io_stdio.h
  06abcab50dea90d6c1d3a00cd3528790  libstdc++-v3/config/locale/darwin/ctype_members.cc
*************** dae95b7d433ad7dffdc472fae36f2be7  libstd
*** 83096,83102 ****
  5ce97ddf0fa0ce05705a1d612dc8a4d4  libstdc++-v3/config/os/mingw32-w64/ctype_base.h
  7fa6f93a45c5f6b320df7db9e198ac3c  libstdc++-v3/config/os/mingw32-w64/ctype_configure_char.cc
  dff14ea49c2ab67ec07f27cec5225575  libstdc++-v3/config/os/mingw32-w64/ctype_inline.h
! c5c5b2168119e8492fb7245eaf1d9dd1  libstdc++-v3/config/os/mingw32-w64/error_constants.h
  6f852469a6af2eab03c7e7ee52d70d97  libstdc++-v3/config/os/mingw32-w64/os_defines.h
  5ce97ddf0fa0ce05705a1d612dc8a4d4  libstdc++-v3/config/os/mingw32/ctype_base.h
  7fa6f93a45c5f6b320df7db9e198ac3c  libstdc++-v3/config/os/mingw32/ctype_configure_char.cc
--- 83449,83455 ----
  5ce97ddf0fa0ce05705a1d612dc8a4d4  libstdc++-v3/config/os/mingw32-w64/ctype_base.h
  7fa6f93a45c5f6b320df7db9e198ac3c  libstdc++-v3/config/os/mingw32-w64/ctype_configure_char.cc
  dff14ea49c2ab67ec07f27cec5225575  libstdc++-v3/config/os/mingw32-w64/ctype_inline.h
! 67349358d04f533cdea3e22ebf3748ea  libstdc++-v3/config/os/mingw32-w64/error_constants.h
  6f852469a6af2eab03c7e7ee52d70d97  libstdc++-v3/config/os/mingw32-w64/os_defines.h
  5ce97ddf0fa0ce05705a1d612dc8a4d4  libstdc++-v3/config/os/mingw32/ctype_base.h
  7fa6f93a45c5f6b320df7db9e198ac3c  libstdc++-v3/config/os/mingw32/ctype_configure_char.cc
*************** ca47e264a7d2f7ab036c1b15f4fca8d5  libstd
*** 83127,83133 ****
  44ebf3566a9eb2c0bd6b70211dbd52ee  libstdc++-v3/config/os/vxworks/ctype_configure_char.cc
  6871ffb6cc72cc728f8f2181fa2fba10  libstdc++-v3/config/os/vxworks/ctype_inline.h
  263f49a737d013c791b3f8314c98ee14  libstdc++-v3/config/os/vxworks/os_defines.h
! 1244a63d5ad6b3ea2cd38db1197ce84c  libstdc++-v3/configure
  c50f3d1c1d97f0a755f473acbacd1145  libstdc++-v3/configure.ac
  665f0246f72768c0e65148e8fe68653e  libstdc++-v3/configure.host
  bf33c59a811ffe0d9bb076bf712dce55  libstdc++-v3/crossconfig.m4
--- 83480,83486 ----
  44ebf3566a9eb2c0bd6b70211dbd52ee  libstdc++-v3/config/os/vxworks/ctype_configure_char.cc
  6871ffb6cc72cc728f8f2181fa2fba10  libstdc++-v3/config/os/vxworks/ctype_inline.h
  263f49a737d013c791b3f8314c98ee14  libstdc++-v3/config/os/vxworks/os_defines.h
! fc24311874da51397bbe2aab7c9580ae  libstdc++-v3/configure
  c50f3d1c1d97f0a755f473acbacd1145  libstdc++-v3/configure.ac
  665f0246f72768c0e65148e8fe68653e  libstdc++-v3/configure.host
  bf33c59a811ffe0d9bb076bf712dce55  libstdc++-v3/crossconfig.m4
*************** bf33c59a811ffe0d9bb076bf712dce55  libstd
*** 83135,83152 ****
  b113f58ebb3a9196654d24fe999168b9  libstdc++-v3/doc/Makefile.in
  3f7ff07f68cc7610addc1921bc125548  libstdc++-v3/doc/doxygen/Intro.3
  8aeca9e72a6f3f90f4a150d1a0ac5959  libstdc++-v3/doc/doxygen/doxygroups.cc
! 6b4dbb148dedb8af46a53ccf42399cae  libstdc++-v3/doc/doxygen/mainpage.html
  3486d64b0aaa601908006a0e78395ca3  libstdc++-v3/doc/doxygen/stdheader.cc
  1273764cd133c402d2d3f22cf2913af5  libstdc++-v3/doc/doxygen/tables.html
  36624003c7160fa0f78acf3cd51e04b0  libstdc++-v3/doc/doxygen/user.cfg.in
  66e139590a163a3e9d632f33fbe1d1b3  libstdc++-v3/doc/html/README
! d706e86b296c9dee28855272900ff8aa  libstdc++-v3/doc/html/api.html
  e24504647642dbafa49db140acc95c21  libstdc++-v3/doc/html/bk02.html
  58ad49058a87b197aaddb99f389eacfa  libstdc++-v3/doc/html/bk03.html
! 1d3eb837e8c17cf0d0ad6d151e8d1777  libstdc++-v3/doc/html/ext/lwg-active.html
! 68372fa89a0decb4aa5f941df5484129  libstdc++-v3/doc/html/ext/lwg-closed.html
! 2defa75c6dc8ce9a6f6b775439df3b7c  libstdc++-v3/doc/html/ext/lwg-defects.html
! 666dcd5dffd013b5063b3349b3167e6a  libstdc++-v3/doc/html/faq.html
  1ae70f0bf94464b036515d333fff8ab2  libstdc++-v3/doc/html/images/confdeps.png
  d7f63b43e9f4c39cf71de7585de522ee  libstdc++-v3/doc/html/images/pbds_balls_and_bins.png
  22eedc841676a98f8ae8b95131ac4d7e  libstdc++-v3/doc/html/images/pbds_binary_priority_queue_int_push.png
--- 83488,83505 ----
  b113f58ebb3a9196654d24fe999168b9  libstdc++-v3/doc/Makefile.in
  3f7ff07f68cc7610addc1921bc125548  libstdc++-v3/doc/doxygen/Intro.3
  8aeca9e72a6f3f90f4a150d1a0ac5959  libstdc++-v3/doc/doxygen/doxygroups.cc
! 520db39aef0e2a59418132af88b897ed  libstdc++-v3/doc/doxygen/mainpage.html
  3486d64b0aaa601908006a0e78395ca3  libstdc++-v3/doc/doxygen/stdheader.cc
  1273764cd133c402d2d3f22cf2913af5  libstdc++-v3/doc/doxygen/tables.html
  36624003c7160fa0f78acf3cd51e04b0  libstdc++-v3/doc/doxygen/user.cfg.in
  66e139590a163a3e9d632f33fbe1d1b3  libstdc++-v3/doc/html/README
! 12cfb60becc3f2e9defd8d75a1a21e7d  libstdc++-v3/doc/html/api.html
  e24504647642dbafa49db140acc95c21  libstdc++-v3/doc/html/bk02.html
  58ad49058a87b197aaddb99f389eacfa  libstdc++-v3/doc/html/bk03.html
! ced96a2fc57fb523e0a3343ba30832e8  libstdc++-v3/doc/html/ext/lwg-active.html
! 5ad4221cbae2df0098935da3d17182b1  libstdc++-v3/doc/html/ext/lwg-closed.html
! bc6aa1ba9307f4270c7741da9c16bd85  libstdc++-v3/doc/html/ext/lwg-defects.html
! 5b0be36aa288e29d23b619d172e87fae  libstdc++-v3/doc/html/faq.html
  1ae70f0bf94464b036515d333fff8ab2  libstdc++-v3/doc/html/images/confdeps.png
  d7f63b43e9f4c39cf71de7585de522ee  libstdc++-v3/doc/html/images/pbds_balls_and_bins.png
  22eedc841676a98f8ae8b95131ac4d7e  libstdc++-v3/doc/html/images/pbds_binary_priority_queue_int_push.png
*************** d7249eb4d31bd107d0b09ea3c80cb723  libstd
*** 83227,83233 ****
  33bc39e8f2d47f3d490d7ca7d4832b43  libstdc++-v3/doc/html/images/pbds_trie_node_updator_policy_cd.png
  df705f3839120dcb896e9839cf3404d0  libstdc++-v3/doc/html/images/pbds_update_seq_diagram.png
  8addfbb9a182e8be15eaed9c9dd8720e  libstdc++-v3/doc/html/index.html
! d8c3162bcbf2f79d7602249b6735d199  libstdc++-v3/doc/html/manual/abi.html
  c50671050ff8de94cc275131201e5bd7  libstdc++-v3/doc/html/manual/algorithms.html
  15818058c9d4057decee4a010f50ee09  libstdc++-v3/doc/html/manual/api.html
  0054faf038f602ca985fe4da97553291  libstdc++-v3/doc/html/manual/appendix.html
--- 83580,83586 ----
  33bc39e8f2d47f3d490d7ca7d4832b43  libstdc++-v3/doc/html/images/pbds_trie_node_updator_policy_cd.png
  df705f3839120dcb896e9839cf3404d0  libstdc++-v3/doc/html/images/pbds_update_seq_diagram.png
  8addfbb9a182e8be15eaed9c9dd8720e  libstdc++-v3/doc/html/index.html
! 4480196c372ed9a6ab1ddaa66eaea382  libstdc++-v3/doc/html/manual/abi.html
  c50671050ff8de94cc275131201e5bd7  libstdc++-v3/doc/html/manual/algorithms.html
  15818058c9d4057decee4a010f50ee09  libstdc++-v3/doc/html/manual/api.html
  0054faf038f602ca985fe4da97553291  libstdc++-v3/doc/html/manual/appendix.html
*************** b334fafd6083bd0be8aa5ac1ff912f2c  libstd
*** 83241,83247 ****
  874c1b17a7b9b226aff1d793c2f23f64  libstdc++-v3/doc/html/manual/backwards.html
  4bc46b36e9636b2f61911bec8741819b  libstdc++-v3/doc/html/manual/bitmap_allocator.html
  b102b16060eb66b508228d886bb789eb  libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html
! 671e15ea5eaf9e17b1fb657034885f7a  libstdc++-v3/doc/html/manual/bugs.html
  c6ead46ffe76f27dd700d07857f7d633  libstdc++-v3/doc/html/manual/concept_checking.html
  ff8a760ba1cd40de947c0cb4ef121860  libstdc++-v3/doc/html/manual/concurrency.html
  5135186872bf89d21a0f1cdca6e33f1e  libstdc++-v3/doc/html/manual/configure.html
--- 83594,83600 ----
  874c1b17a7b9b226aff1d793c2f23f64  libstdc++-v3/doc/html/manual/backwards.html
  4bc46b36e9636b2f61911bec8741819b  libstdc++-v3/doc/html/manual/bitmap_allocator.html
  b102b16060eb66b508228d886bb789eb  libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html
! b7190f0fde0756ec49a06a4f4c3ad829  libstdc++-v3/doc/html/manual/bugs.html
  c6ead46ffe76f27dd700d07857f7d633  libstdc++-v3/doc/html/manual/concept_checking.html
  ff8a760ba1cd40de947c0cb4ef121860  libstdc++-v3/doc/html/manual/concurrency.html
  5135186872bf89d21a0f1cdca6e33f1e  libstdc++-v3/doc/html/manual/configure.html
*************** d3228526ee93719e75cc636f26c0f7ff  libstd
*** 83261,83267 ****
  99b0a38fd9e316e076d95029052e11a0  libstdc++-v3/doc/html/manual/ext_concurrency_impl.html
  2b9b33938584e17f401bf21c285af30a  libstdc++-v3/doc/html/manual/ext_concurrency_use.html
  8fc51fc67d0794cfe349294f28d8e187  libstdc++-v3/doc/html/manual/ext_containers.html
! b83e2280a694b73feedb098666fdcd42  libstdc++-v3/doc/html/manual/ext_demangling.html
  7969471d93a397921bf15645722db9d4  libstdc++-v3/doc/html/manual/ext_io.html
  24abb74f520b2cc64329af7b0eabedd6  libstdc++-v3/doc/html/manual/ext_iterators.html
  549d43cb9c55ed8abf3eb93c27ed9716  libstdc++-v3/doc/html/manual/ext_numerics.html
--- 83614,83620 ----
  99b0a38fd9e316e076d95029052e11a0  libstdc++-v3/doc/html/manual/ext_concurrency_impl.html
  2b9b33938584e17f401bf21c285af30a  libstdc++-v3/doc/html/manual/ext_concurrency_use.html
  8fc51fc67d0794cfe349294f28d8e187  libstdc++-v3/doc/html/manual/ext_containers.html
! b74136e4a01e5df567cabcefc736ae48  libstdc++-v3/doc/html/manual/ext_demangling.html
  7969471d93a397921bf15645722db9d4  libstdc++-v3/doc/html/manual/ext_io.html
  24abb74f520b2cc64329af7b0eabedd6  libstdc++-v3/doc/html/manual/ext_iterators.html
  549d43cb9c55ed8abf3eb93c27ed9716  libstdc++-v3/doc/html/manual/ext_numerics.html
*************** c41dc87f8be3a367ba747353fbab2353  libstd
*** 83281,83292 ****
  f2cbe7a16c1459eb9d661c4f59148c85  libstdc++-v3/doc/html/manual/license.html
  756b894a64f9e63ec962a6742ba34bc8  libstdc++-v3/doc/html/manual/localization.html
  518c609918662df90ec372996b1cee25  libstdc++-v3/doc/html/manual/make.html
! 250aa8325a3c9cb355bf01dc20b6996f  libstdc++-v3/doc/html/manual/memory.html
  2f0038d7682f075686ddeb6eb5700181  libstdc++-v3/doc/html/manual/mt_allocator.html
  90aab30425d9f81569fd7f122545388f  libstdc++-v3/doc/html/manual/mt_allocator_design.html
  769263e7fac4c4320ed9890622a2691d  libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html
  b477b181b88903e87cafffc02f82c26f  libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html
! 18a4f55ae43a71769f8b57d6318fe429  libstdc++-v3/doc/html/manual/mt_allocator_impl.html
  961b1986cc712df4011f8f956904e08f  libstdc++-v3/doc/html/manual/numerics.html
  1e7bda9b7468a80644d426c5ec6d9956  libstdc++-v3/doc/html/manual/numerics_and_c.html
  73a67e9f3ea3de4053702d5d42bc5dd5  libstdc++-v3/doc/html/manual/pairs.html
--- 83634,83645 ----
  f2cbe7a16c1459eb9d661c4f59148c85  libstdc++-v3/doc/html/manual/license.html
  756b894a64f9e63ec962a6742ba34bc8  libstdc++-v3/doc/html/manual/localization.html
  518c609918662df90ec372996b1cee25  libstdc++-v3/doc/html/manual/make.html
! 5b3b09bfb3538a873d8d2d07d7c81c68  libstdc++-v3/doc/html/manual/memory.html
  2f0038d7682f075686ddeb6eb5700181  libstdc++-v3/doc/html/manual/mt_allocator.html
  90aab30425d9f81569fd7f122545388f  libstdc++-v3/doc/html/manual/mt_allocator_design.html
  769263e7fac4c4320ed9890622a2691d  libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html
  b477b181b88903e87cafffc02f82c26f  libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html
! 8e5ff1c36db70228ad85f9412c2d7e0d  libstdc++-v3/doc/html/manual/mt_allocator_impl.html
  961b1986cc712df4011f8f956904e08f  libstdc++-v3/doc/html/manual/numerics.html
  1e7bda9b7468a80644d426c5ec6d9956  libstdc++-v3/doc/html/manual/numerics_and_c.html
  73a67e9f3ea3de4053702d5d42bc5dd5  libstdc++-v3/doc/html/manual/pairs.html
*************** a4da9233e97dfbc6975e64682370e552  libstd
*** 83308,83317 ****
  119fba66274e9729e112f18c0a62af95  libstdc++-v3/doc/html/manual/profile_mode_diagnostics.html
  959142a01bcfe51b5975541a3f0b6dc6  libstdc++-v3/doc/html/manual/profile_mode_impl.html
  07a221c9bf5f7e46ea33f7c4a43cc754  libstdc++-v3/doc/html/manual/setup.html
! 6797250ede211d0c027dd4803fb15940  libstdc++-v3/doc/html/manual/source_code_style.html
  0576cfcb1c478a91ea55484a0ff9a3ec  libstdc++-v3/doc/html/manual/source_design_notes.html
! 658403718395ded5ff484457bf844421  libstdc++-v3/doc/html/manual/source_organization.html
! 2e64ca7b25a4f5de251096fb42317d25  libstdc++-v3/doc/html/manual/status.html
  5fe64acc29e86cd3ed7f78552632eb74  libstdc++-v3/doc/html/manual/std_contents.html
  9bb7d8baedf0c99049a912bf241462f1  libstdc++-v3/doc/html/manual/streambufs.html
  0aad91af2fbe9bc6363598d5a79f7d36  libstdc++-v3/doc/html/manual/strings.html
--- 83661,83670 ----
  119fba66274e9729e112f18c0a62af95  libstdc++-v3/doc/html/manual/profile_mode_diagnostics.html
  959142a01bcfe51b5975541a3f0b6dc6  libstdc++-v3/doc/html/manual/profile_mode_impl.html
  07a221c9bf5f7e46ea33f7c4a43cc754  libstdc++-v3/doc/html/manual/setup.html
! 6b6cefa7f9267ae701ee527c0cbe7f1e  libstdc++-v3/doc/html/manual/source_code_style.html
  0576cfcb1c478a91ea55484a0ff9a3ec  libstdc++-v3/doc/html/manual/source_design_notes.html
! 59a1459c8a857cf19103c3f2911e691e  libstdc++-v3/doc/html/manual/source_organization.html
! d81323c827926fa3dbaf153de8c6b7ed  libstdc++-v3/doc/html/manual/status.html
  5fe64acc29e86cd3ed7f78552632eb74  libstdc++-v3/doc/html/manual/std_contents.html
  9bb7d8baedf0c99049a912bf241462f1  libstdc++-v3/doc/html/manual/streambufs.html
  0aad91af2fbe9bc6363598d5a79f7d36  libstdc++-v3/doc/html/manual/strings.html
*************** b806eb79ce2b8df24b58ffdd8e431755  libstd
*** 83330,83341 ****
  1c82e434fcb983a5c34a00eed637f663  libstdc++-v3/doc/html/manual/using_macros.html
  5a9981980034ebcb698957f7baeac265  libstdc++-v3/doc/html/manual/using_namespaces.html
  8c824a54ff9dd7a513a19ca3a058202a  libstdc++-v3/doc/html/manual/utilities.html
! 5beb744711838d5fe53281b0c0e716d5  libstdc++-v3/doc/xml/api.xml
  0b177c199fb448ad3630d15bdc3cbb19  libstdc++-v3/doc/xml/authors.xml
  f5a41d4f7585b850b3182fc5f4888f93  libstdc++-v3/doc/xml/book.txml
  95d1335e76860d53246f3e400231ec38  libstdc++-v3/doc/xml/chapter.txml
  7f8c520dc83013026c671c5c342f73e2  libstdc++-v3/doc/xml/class.txml
! cd598b0808ddfc0415f9b66d9fdf1bbc  libstdc++-v3/doc/xml/faq.xml
  0408e04957d20fcb2a1048c482230ec0  libstdc++-v3/doc/xml/gnu/fdl-1.3.xml
  df4574d04d7f029398ab0183832017b6  libstdc++-v3/doc/xml/gnu/gpl-3.0.xml
  18a6390297702ec8fd75cbcc525d2005  libstdc++-v3/doc/xml/images/confdeps.dot
--- 83683,83694 ----
  1c82e434fcb983a5c34a00eed637f663  libstdc++-v3/doc/html/manual/using_macros.html
  5a9981980034ebcb698957f7baeac265  libstdc++-v3/doc/html/manual/using_namespaces.html
  8c824a54ff9dd7a513a19ca3a058202a  libstdc++-v3/doc/html/manual/utilities.html
! 449dbbf51240d77a37d2437eff256924  libstdc++-v3/doc/xml/api.xml
  0b177c199fb448ad3630d15bdc3cbb19  libstdc++-v3/doc/xml/authors.xml
  f5a41d4f7585b850b3182fc5f4888f93  libstdc++-v3/doc/xml/book.txml
  95d1335e76860d53246f3e400231ec38  libstdc++-v3/doc/xml/chapter.txml
  7f8c520dc83013026c671c5c342f73e2  libstdc++-v3/doc/xml/class.txml
! c51fa440e8e6a3e232681b69829ab391  libstdc++-v3/doc/xml/faq.xml
  0408e04957d20fcb2a1048c482230ec0  libstdc++-v3/doc/xml/gnu/fdl-1.3.xml
  df4574d04d7f029398ab0183832017b6  libstdc++-v3/doc/xml/gnu/gpl-3.0.xml
  18a6390297702ec8fd75cbcc525d2005  libstdc++-v3/doc/xml/images/confdeps.dot
*************** cc132f90a00a3ca05f64b578f9e332aa  libstd
*** 83515,83524 ****
  f63bfdc03ba2b82c74864f02206d7c52  libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find.svg
  33bc39e8f2d47f3d490d7ca7d4832b43  libstdc++-v3/doc/xml/images/pbds_trie_node_updator_policy_cd.png
  df705f3839120dcb896e9839cf3404d0  libstdc++-v3/doc/xml/images/pbds_update_seq_diagram.png
! 7c9216356090c2d3b5f77d35e8f8f6a2  libstdc++-v3/doc/xml/manual/abi.xml
  6a68f07a8b8abd9e65846432ed52d646  libstdc++-v3/doc/xml/manual/algorithms.xml
! fd2185821a70453792b0c373704f219b  libstdc++-v3/doc/xml/manual/allocator.xml
! f2cfee5263eecfcb91850c1356469d63  libstdc++-v3/doc/xml/manual/appendix_contributing.xml
  074e722c08588c6474b7eb1dc527bd89  libstdc++-v3/doc/xml/manual/appendix_free.xml
  fddfbac311009ebd3056c4edd7ee522a  libstdc++-v3/doc/xml/manual/appendix_porting.xml
  e0b6ea09e982758f8a79d0d165939943  libstdc++-v3/doc/xml/manual/atomics.xml
--- 83868,83877 ----
  f63bfdc03ba2b82c74864f02206d7c52  libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find.svg
  33bc39e8f2d47f3d490d7ca7d4832b43  libstdc++-v3/doc/xml/images/pbds_trie_node_updator_policy_cd.png
  df705f3839120dcb896e9839cf3404d0  libstdc++-v3/doc/xml/images/pbds_update_seq_diagram.png
! 66c1faeb37ec3755c1e2ddae0f073e89  libstdc++-v3/doc/xml/manual/abi.xml
  6a68f07a8b8abd9e65846432ed52d646  libstdc++-v3/doc/xml/manual/algorithms.xml
! 832fb85e9dd8e40662f3abe5b0f7b070  libstdc++-v3/doc/xml/manual/allocator.xml
! 444015e6d7de5bf56b28a3e88c753395  libstdc++-v3/doc/xml/manual/appendix_contributing.xml
  074e722c08588c6474b7eb1dc527bd89  libstdc++-v3/doc/xml/manual/appendix_free.xml
  fddfbac311009ebd3056c4edd7ee522a  libstdc++-v3/doc/xml/manual/appendix_porting.xml
  e0b6ea09e982758f8a79d0d165939943  libstdc++-v3/doc/xml/manual/atomics.xml
*************** f5a287dcee5fb300ea0b6c216bf0a707  libstd
*** 83537,83551 ****
  572f736b5fd9cd199290f20b155caeca  libstdc++-v3/doc/xml/manual/diagnostics.xml
  95feeda9bc28bdf9ace5774f71f27bad  libstdc++-v3/doc/xml/manual/documentation_hacking.xml
  beaf7f0a49ee4f9a868913839fb3e8b4  libstdc++-v3/doc/xml/manual/evolution.xml
! a182c59139e44d5258054047a0f0ffb6  libstdc++-v3/doc/xml/manual/extensions.xml
  b4dcd406dd4cdb85c102eee09463aa1f  libstdc++-v3/doc/xml/manual/internals.xml
! e890061b1d03be36691a60c849c47e90  libstdc++-v3/doc/xml/manual/intro.xml
  09a176ae4f25d6877dd6af733098ab53  libstdc++-v3/doc/xml/manual/io.xml
  bab548248426e0e90cdc1436ff5b87de  libstdc++-v3/doc/xml/manual/iterators.xml
  5d3e282d89ac0af0f7752f88466a9d39  libstdc++-v3/doc/xml/manual/locale.xml
  8d6a4daabfdaa26ed8c3bd68f6cb0930  libstdc++-v3/doc/xml/manual/localization.xml
  d1f75977cf17da71ede22a4884f5771f  libstdc++-v3/doc/xml/manual/messages.xml
! 358c6c2b091982dafcd133cc65380653  libstdc++-v3/doc/xml/manual/mt_allocator.xml
  0093c0e2ef4c460d644a7c3d3e90c7b4  libstdc++-v3/doc/xml/manual/numerics.xml
  e2b6426957c60c385c84e7b5143089ce  libstdc++-v3/doc/xml/manual/parallel_mode.xml
  877b32ce48c44db2c2ef8a7901d6157d  libstdc++-v3/doc/xml/manual/policy_data_structures.xml
--- 83890,83904 ----
  572f736b5fd9cd199290f20b155caeca  libstdc++-v3/doc/xml/manual/diagnostics.xml
  95feeda9bc28bdf9ace5774f71f27bad  libstdc++-v3/doc/xml/manual/documentation_hacking.xml
  beaf7f0a49ee4f9a868913839fb3e8b4  libstdc++-v3/doc/xml/manual/evolution.xml
! d700263acf88b675c68d1cbe9dadea6b  libstdc++-v3/doc/xml/manual/extensions.xml
  b4dcd406dd4cdb85c102eee09463aa1f  libstdc++-v3/doc/xml/manual/internals.xml
! d167d21ee291ada55b5a50a238c60be9  libstdc++-v3/doc/xml/manual/intro.xml
  09a176ae4f25d6877dd6af733098ab53  libstdc++-v3/doc/xml/manual/io.xml
  bab548248426e0e90cdc1436ff5b87de  libstdc++-v3/doc/xml/manual/iterators.xml
  5d3e282d89ac0af0f7752f88466a9d39  libstdc++-v3/doc/xml/manual/locale.xml
  8d6a4daabfdaa26ed8c3bd68f6cb0930  libstdc++-v3/doc/xml/manual/localization.xml
  d1f75977cf17da71ede22a4884f5771f  libstdc++-v3/doc/xml/manual/messages.xml
! 489dc876235f0b46a0cf931a02ed38a6  libstdc++-v3/doc/xml/manual/mt_allocator.xml
  0093c0e2ef4c460d644a7c3d3e90c7b4  libstdc++-v3/doc/xml/manual/numerics.xml
  e2b6426957c60c385c84e7b5143089ce  libstdc++-v3/doc/xml/manual/parallel_mode.xml
  877b32ce48c44db2c2ef8a7901d6157d  libstdc++-v3/doc/xml/manual/policy_data_structures.xml
*************** df9b17e3318f7ef36a1ba30c4ffc1314  libstd
*** 83555,83562 ****
  7d20c67a427688f750e697745522b268  libstdc++-v3/doc/xml/manual/shared_ptr.xml
  571f1b40ca0091ca5d8e0480d249a9f0  libstdc++-v3/doc/xml/manual/spine.xml
  e39b9e1f76939c3dc25d9d8e5314ac02  libstdc++-v3/doc/xml/manual/status_cxx1998.xml
! b41af43b209a8cdb9246e81f99b27e14  libstdc++-v3/doc/xml/manual/status_cxx2011.xml
! 83113b7917a9acd2501b474e86e332b7  libstdc++-v3/doc/xml/manual/status_cxx2014.xml
  0328d8bf2d7935051ce9dc880ef63b6d  libstdc++-v3/doc/xml/manual/status_cxxtr1.xml
  716409ea4f3fdc47d1b88cc8ac63b392  libstdc++-v3/doc/xml/manual/status_cxxtr24733.xml
  4bde3160d9ccaca3edfee800f93973f1  libstdc++-v3/doc/xml/manual/strings.xml
--- 83908,83915 ----
  7d20c67a427688f750e697745522b268  libstdc++-v3/doc/xml/manual/shared_ptr.xml
  571f1b40ca0091ca5d8e0480d249a9f0  libstdc++-v3/doc/xml/manual/spine.xml
  e39b9e1f76939c3dc25d9d8e5314ac02  libstdc++-v3/doc/xml/manual/status_cxx1998.xml
! 222590fd86868274a2722afafa58a658  libstdc++-v3/doc/xml/manual/status_cxx2011.xml
! 655a4017bccd94324e45206354dbfc13  libstdc++-v3/doc/xml/manual/status_cxx2014.xml
  0328d8bf2d7935051ce9dc880ef63b6d  libstdc++-v3/doc/xml/manual/status_cxxtr1.xml
  716409ea4f3fdc47d1b88cc8ac63b392  libstdc++-v3/doc/xml/manual/status_cxxtr24733.xml
  4bde3160d9ccaca3edfee800f93973f1  libstdc++-v3/doc/xml/manual/strings.xml
*************** d42dacf57cbf8644fc8b7217c7e8893a  libstd
*** 83569,83576 ****
  8d67ac4ec4ca26b7d147ec7a9dc7a549  libstdc++-v3/doc/xml/spine.xml
  bd966b4a0df6f2a84f9770525581d45c  libstdc++-v3/doc/xsl/customization.xsl.in
  73e63064a578098e6ddb49966a9773de  libstdc++-v3/fragment.am
! 9d3873f43e1b04e0cc5ef035952c637e  libstdc++-v3/include/Makefile.am
! 78e11d9913eed7d6764b4f6c39745d74  libstdc++-v3/include/Makefile.in
  c4b834f7067414a27d50e8f4456eb1a2  libstdc++-v3/include/backward/auto_ptr.h
  adf40f88fe614b729aba07b2d33b28a9  libstdc++-v3/include/backward/backward_warning.h
  0f6372fe1d565f2feae895c24ba1baea  libstdc++-v3/include/backward/binders.h
--- 83922,83929 ----
  8d67ac4ec4ca26b7d147ec7a9dc7a549  libstdc++-v3/doc/xml/spine.xml
  bd966b4a0df6f2a84f9770525581d45c  libstdc++-v3/doc/xsl/customization.xsl.in
  73e63064a578098e6ddb49966a9773de  libstdc++-v3/fragment.am
! 1338b3dbb793b9446f23c0a8fbb7e8c2  libstdc++-v3/include/Makefile.am
! 3b94e59274cf5fb9cdcc95812936dff0  libstdc++-v3/include/Makefile.in
  c4b834f7067414a27d50e8f4456eb1a2  libstdc++-v3/include/backward/auto_ptr.h
  adf40f88fe614b729aba07b2d33b28a9  libstdc++-v3/include/backward/backward_warning.h
  0f6372fe1d565f2feae895c24ba1baea  libstdc++-v3/include/backward/binders.h
*************** b623f07b6097a10d2bd4c8a6dd50e9f1  libstd
*** 83582,83598 ****
  9193bbe81a9ef1a20be296340de10026  libstdc++-v3/include/bits/algorithmfwd.h
  7c6e4fa600d5d212142e4ff4b6afff89  libstdc++-v3/include/bits/alloc_traits.h
  d03521e9e4585421188acde110dff0fe  libstdc++-v3/include/bits/allocated_ptr.h
! fb174e93bb5167a116014329657aed15  libstdc++-v3/include/bits/allocator.h
  d5147ec5a2ecafa44ecb070f584bc980  libstdc++-v3/include/bits/atomic_base.h
  4e6269ade6bac656d1a8e72404056732  libstdc++-v3/include/bits/atomic_futex.h
! f203d4cd579d02df3d77f371d1fd0643  libstdc++-v3/include/bits/basic_ios.h
  6d9b6ec8a4a3673b6eeedbdc8b4e1c5b  libstdc++-v3/include/bits/basic_ios.tcc
! cdd712ef4d0fc871794d28898a8a9434  libstdc++-v3/include/bits/basic_string.h
! 487fdbdb2caa268d5a2b5203c8c13f74  libstdc++-v3/include/bits/basic_string.tcc
  46ac099accb6dc0fbeabc9d4cf9bc192  libstdc++-v3/include/bits/boost_concept_check.h
  be0c0f956d1a7be00c0a46cdfdcc999b  libstdc++-v3/include/bits/c++0x_warning.h
  4382416b01d5dc9ee55518df54e774de  libstdc++-v3/include/bits/c++14_warning.h
! d1ab1c3b455430fd6adb61ef77c2bc66  libstdc++-v3/include/bits/c++config
  402844482558cec99d218279bfc5474d  libstdc++-v3/include/bits/char_traits.h
  402a382dedd9bd5821bd70c21e988b1c  libstdc++-v3/include/bits/codecvt.h
  a2bad8632aeb855c1159a3c60be17d00  libstdc++-v3/include/bits/concept_check.h
--- 83935,83951 ----
  9193bbe81a9ef1a20be296340de10026  libstdc++-v3/include/bits/algorithmfwd.h
  7c6e4fa600d5d212142e4ff4b6afff89  libstdc++-v3/include/bits/alloc_traits.h
  d03521e9e4585421188acde110dff0fe  libstdc++-v3/include/bits/allocated_ptr.h
! 98eabf9902a05ee67db8d46471436af0  libstdc++-v3/include/bits/allocator.h
  d5147ec5a2ecafa44ecb070f584bc980  libstdc++-v3/include/bits/atomic_base.h
  4e6269ade6bac656d1a8e72404056732  libstdc++-v3/include/bits/atomic_futex.h
! 1e2e1221f8ae11eed90e4854d04153e6  libstdc++-v3/include/bits/basic_ios.h
  6d9b6ec8a4a3673b6eeedbdc8b4e1c5b  libstdc++-v3/include/bits/basic_ios.tcc
! 9f5c6288ffa93d62f12672cdd0405103  libstdc++-v3/include/bits/basic_string.h
! 6139913054eaf66198eb20cfc586220d  libstdc++-v3/include/bits/basic_string.tcc
  46ac099accb6dc0fbeabc9d4cf9bc192  libstdc++-v3/include/bits/boost_concept_check.h
  be0c0f956d1a7be00c0a46cdfdcc999b  libstdc++-v3/include/bits/c++0x_warning.h
  4382416b01d5dc9ee55518df54e774de  libstdc++-v3/include/bits/c++14_warning.h
! 70c9bc71c2faba999e24386e94fd1361  libstdc++-v3/include/bits/c++config
  402844482558cec99d218279bfc5474d  libstdc++-v3/include/bits/char_traits.h
  402a382dedd9bd5821bd70c21e988b1c  libstdc++-v3/include/bits/codecvt.h
  a2bad8632aeb855c1159a3c60be17d00  libstdc++-v3/include/bits/concept_check.h
*************** dfdc6ba41855d60aa1b553e4710bb8e9  libstd
*** 83606,83643 ****
  529c3107ba724b9b19dd5b6bcb1e585c  libstdc++-v3/include/bits/functional_hash.h
  4b07e09985fdedde1e0cea43a1608d1f  libstdc++-v3/include/bits/gslice.h
  4000bd1f2b1812a41d720a57ceb3c377  libstdc++-v3/include/bits/gslice_array.h
! 7c7df3999376074771ac5d4d91e73b92  libstdc++-v3/include/bits/hashtable.h
  43193716b6a0c443e5de98aa19a94daa  libstdc++-v3/include/bits/hashtable_policy.h
  800e828d8b1684e542db04010571c75e  libstdc++-v3/include/bits/indirect_array.h
! 806925d42d8ad9d8e2d567de02651863  libstdc++-v3/include/bits/ios_base.h
! 85de1683458f5b94144c04565693294f  libstdc++-v3/include/bits/istream.tcc
! 5abf8c14a5acdd6343b48531d0570105  libstdc++-v3/include/bits/list.tcc
! 1a99bb51a6c89aad3c3a103c63467fbc  libstdc++-v3/include/bits/locale_classes.h
  db8825e72551a63c09b1321cd016b840  libstdc++-v3/include/bits/locale_classes.tcc
! c7618c920ed23de5b9295f6a49b58072  libstdc++-v3/include/bits/locale_conv.h
  a98311f7e4e0c0dca9cb9f1810da4227  libstdc++-v3/include/bits/locale_facets.h
  a8966716bb4f1fc46267e56afeab5c07  libstdc++-v3/include/bits/locale_facets.tcc
  6dd50440dd7b67000b5c879ddf7bc37b  libstdc++-v3/include/bits/locale_facets_nonio.h
  042fac84563eef65745571403f487323  libstdc++-v3/include/bits/locale_facets_nonio.tcc
  833667d84f0e8b18fd0f9c8a6bab9830  libstdc++-v3/include/bits/localefwd.h
! 3f8955bc1fca26dd0b4ca6e5f3c8f30b  libstdc++-v3/include/bits/mask_array.h
  1249d7756d45f32cd39b0f46724f6123  libstdc++-v3/include/bits/memoryfwd.h
  1107f29e7f548c9e8f53825f444ed501  libstdc++-v3/include/bits/move.h
  045ce9aae286c31d91d6fe9a510ac53a  libstdc++-v3/include/bits/ostream.tcc
  cfa7857ba221db82056f61d9229245b3  libstdc++-v3/include/bits/ostream_insert.h
  508b24ad40d04e24b60af8fbbcb65bb7  libstdc++-v3/include/bits/parse_numbers.h
  cedcf2c3add22d681ca3cd5720e381e9  libstdc++-v3/include/bits/postypes.h
! 40926eca03f17797f83ce683d78baab6  libstdc++-v3/include/bits/predefined_ops.h
  c9da956d485d9c78bf3cb0817ab7e27d  libstdc++-v3/include/bits/ptr_traits.h
  71556f9280f366116c089b52fc9b29f3  libstdc++-v3/include/bits/quoted_string.h
  ff0b1c19ac8e1870efb90b4ba73c6967  libstdc++-v3/include/bits/random.h
  cfdd4311674633599afdc67ee85d1d7d  libstdc++-v3/include/bits/random.tcc
  36d285beef9e04574561e1246887799a  libstdc++-v3/include/bits/range_access.h
! de5dca6c80ef5dbb1e035c02f59ee66f  libstdc++-v3/include/bits/regex.h
! 8cc6d444a6ac51183310d6efb1b06ec3  libstdc++-v3/include/bits/regex.tcc
  addc1a999e74463be797def3ca625b51  libstdc++-v3/include/bits/regex_automaton.h
  1f0448ba469a040b6a8bd17769790eac  libstdc++-v3/include/bits/regex_automaton.tcc
! b80f57063052457c96436b70adc8accd  libstdc++-v3/include/bits/regex_compiler.h
  7e1f90d07a6305f75c2808b03234b86f  libstdc++-v3/include/bits/regex_compiler.tcc
  1e2a18c083c985e41998840861d9d8c9  libstdc++-v3/include/bits/regex_constants.h
  97f58f33c0b220b02ef472de0dc2c922  libstdc++-v3/include/bits/regex_error.h
--- 83959,83996 ----
  529c3107ba724b9b19dd5b6bcb1e585c  libstdc++-v3/include/bits/functional_hash.h
  4b07e09985fdedde1e0cea43a1608d1f  libstdc++-v3/include/bits/gslice.h
  4000bd1f2b1812a41d720a57ceb3c377  libstdc++-v3/include/bits/gslice_array.h
! 20b3c12d19b0e732adb0c6a0b397eef4  libstdc++-v3/include/bits/hashtable.h
  43193716b6a0c443e5de98aa19a94daa  libstdc++-v3/include/bits/hashtable_policy.h
  800e828d8b1684e542db04010571c75e  libstdc++-v3/include/bits/indirect_array.h
! cd293da2d228dc0d9d40f6c8187f5f22  libstdc++-v3/include/bits/ios_base.h
! 1de5df48fdacbc6d8b4ec4dc3c61899b  libstdc++-v3/include/bits/istream.tcc
! 651fc01dfbfb61ff8809d565cca36414  libstdc++-v3/include/bits/list.tcc
! c91614ad38a7c2dddde607770d5cc416  libstdc++-v3/include/bits/locale_classes.h
  db8825e72551a63c09b1321cd016b840  libstdc++-v3/include/bits/locale_classes.tcc
! 7de54084f579656f535b37074e2b870c  libstdc++-v3/include/bits/locale_conv.h
  a98311f7e4e0c0dca9cb9f1810da4227  libstdc++-v3/include/bits/locale_facets.h
  a8966716bb4f1fc46267e56afeab5c07  libstdc++-v3/include/bits/locale_facets.tcc
  6dd50440dd7b67000b5c879ddf7bc37b  libstdc++-v3/include/bits/locale_facets_nonio.h
  042fac84563eef65745571403f487323  libstdc++-v3/include/bits/locale_facets_nonio.tcc
  833667d84f0e8b18fd0f9c8a6bab9830  libstdc++-v3/include/bits/localefwd.h
! 2974e8ab24d94d02de6a5676abda21b6  libstdc++-v3/include/bits/mask_array.h
  1249d7756d45f32cd39b0f46724f6123  libstdc++-v3/include/bits/memoryfwd.h
  1107f29e7f548c9e8f53825f444ed501  libstdc++-v3/include/bits/move.h
  045ce9aae286c31d91d6fe9a510ac53a  libstdc++-v3/include/bits/ostream.tcc
  cfa7857ba221db82056f61d9229245b3  libstdc++-v3/include/bits/ostream_insert.h
  508b24ad40d04e24b60af8fbbcb65bb7  libstdc++-v3/include/bits/parse_numbers.h
  cedcf2c3add22d681ca3cd5720e381e9  libstdc++-v3/include/bits/postypes.h
! aa57332c64a766043d31d8a41f54f115  libstdc++-v3/include/bits/predefined_ops.h
  c9da956d485d9c78bf3cb0817ab7e27d  libstdc++-v3/include/bits/ptr_traits.h
  71556f9280f366116c089b52fc9b29f3  libstdc++-v3/include/bits/quoted_string.h
  ff0b1c19ac8e1870efb90b4ba73c6967  libstdc++-v3/include/bits/random.h
  cfdd4311674633599afdc67ee85d1d7d  libstdc++-v3/include/bits/random.tcc
  36d285beef9e04574561e1246887799a  libstdc++-v3/include/bits/range_access.h
! 0bca97f155ac5f38317d2667bbf7232e  libstdc++-v3/include/bits/regex.h
! fd7106110c405cb313e811dbf42b99a5  libstdc++-v3/include/bits/regex.tcc
  addc1a999e74463be797def3ca625b51  libstdc++-v3/include/bits/regex_automaton.h
  1f0448ba469a040b6a8bd17769790eac  libstdc++-v3/include/bits/regex_automaton.tcc
! 529d63e510a0aae3e80c75afd489f960  libstdc++-v3/include/bits/regex_compiler.h
  7e1f90d07a6305f75c2808b03234b86f  libstdc++-v3/include/bits/regex_compiler.tcc
  1e2a18c083c985e41998840861d9d8c9  libstdc++-v3/include/bits/regex_constants.h
  97f58f33c0b220b02ef472de0dc2c922  libstdc++-v3/include/bits/regex_error.h
*************** f75db8b033b13bc655aac6089a21b878  libstd
*** 83647,83655 ****
  bc0c69af41c15c6315c8e58c16f5731c  libstdc++-v3/include/bits/regex_scanner.tcc
  2a3eb0c83530441c6ab7881676080616  libstdc++-v3/include/bits/shared_ptr.h
  0387eac1514094973bdc60bb54327671  libstdc++-v3/include/bits/shared_ptr_atomic.h
! 01d45b9b02be6d899edaed924627445b  libstdc++-v3/include/bits/shared_ptr_base.h
! 3ec6c40e7ab1bc346158440b507ec686  libstdc++-v3/include/bits/slice_array.h
! edee7c2271e68dcb2bfd04121028dc60  libstdc++-v3/include/bits/sstream.tcc
  741005fbac484d6778fd610b15f756fe  libstdc++-v3/include/bits/stl_algo.h
  b73f5b1c6933a7154884550a1789de12  libstdc++-v3/include/bits/stl_algobase.h
  15b9b0e21bfa3e0d0abaf9a680932a9f  libstdc++-v3/include/bits/stl_bvector.h
--- 84000,84008 ----
  bc0c69af41c15c6315c8e58c16f5731c  libstdc++-v3/include/bits/regex_scanner.tcc
  2a3eb0c83530441c6ab7881676080616  libstdc++-v3/include/bits/shared_ptr.h
  0387eac1514094973bdc60bb54327671  libstdc++-v3/include/bits/shared_ptr_atomic.h
! 853ea9e636c68a621f6baf67d171c42a  libstdc++-v3/include/bits/shared_ptr_base.h
! 454bb56a37b4dbb11b4f8f6c80088200  libstdc++-v3/include/bits/slice_array.h
! 45ef2302a613d7d6551eae8b3e41c4a7  libstdc++-v3/include/bits/sstream.tcc
  741005fbac484d6778fd610b15f756fe  libstdc++-v3/include/bits/stl_algo.h
  b73f5b1c6933a7154884550a1789de12  libstdc++-v3/include/bits/stl_algobase.h
  15b9b0e21bfa3e0d0abaf9a680932a9f  libstdc++-v3/include/bits/stl_bvector.h
*************** b73f5b1c6933a7154884550a1789de12  libstd
*** 83657,83686 ****
  e5b264a967b895ef837a01b429fb7ca2  libstdc++-v3/include/bits/stl_deque.h
  dc967bce7eeb75712ed3c6707d363e47  libstdc++-v3/include/bits/stl_function.h
  4b7571848aebe508778902c406705077  libstdc++-v3/include/bits/stl_heap.h
! 1d32604d5f987499fa1a98aef6732bef  libstdc++-v3/include/bits/stl_iterator.h
  79c537ace31abfbb587f715ceae0b455  libstdc++-v3/include/bits/stl_iterator_base_funcs.h
  6e513ab7614a7b5a24f402a287af23e3  libstdc++-v3/include/bits/stl_iterator_base_types.h
  0c48fb7bc156ea1526824ae9c5ee1805  libstdc++-v3/include/bits/stl_list.h
! f9c76b908d914d2526d337a0e96e95e2  libstdc++-v3/include/bits/stl_map.h
! 33fcf2c16dbf4ff800f9f8b0d06a9648  libstdc++-v3/include/bits/stl_multimap.h
! 8cb77d64aebf8016058909dc7e15931a  libstdc++-v3/include/bits/stl_multiset.h
  5f2acaf04b993e306b75dcc14877e7f2  libstdc++-v3/include/bits/stl_numeric.h
  1d9520b2cdc5022d49b4b59a82acdcdc  libstdc++-v3/include/bits/stl_pair.h
  844a4f273c88ff21a68db77d39180e03  libstdc++-v3/include/bits/stl_queue.h
  95a28ae884dd94a9908f33f7e6088443  libstdc++-v3/include/bits/stl_raw_storage_iter.h
  a9fa280316b07e950cfaa198795a7d16  libstdc++-v3/include/bits/stl_relops.h
! 26d5b69eefcfdf7ceaed5596c419c824  libstdc++-v3/include/bits/stl_set.h
! af6cb978b9854843f31a22786be2a6f6  libstdc++-v3/include/bits/stl_stack.h
  135e26d18f59f9c797166d146410be1f  libstdc++-v3/include/bits/stl_tempbuf.h
! beee4ceaa68389fe84d99a08acc49cee  libstdc++-v3/include/bits/stl_tree.h
  977ca56c20f9616a71556368af1ab055  libstdc++-v3/include/bits/stl_uninitialized.h
  a82511ac6537f991fd136d62ee218810  libstdc++-v3/include/bits/stl_vector.h
  435b98773d35537254095c906332835c  libstdc++-v3/include/bits/stream_iterator.h
  2a004bbd1c98faf6ebcb148c0c44ff49  libstdc++-v3/include/bits/streambuf.tcc
  7af47c9a13f44206097193b9bdaf15ae  libstdc++-v3/include/bits/streambuf_iterator.h
  28199adec95e40292569367297ebda54  libstdc++-v3/include/bits/stringfwd.h
! 8f14c3759d3a8a44ca6d5691668f6f30  libstdc++-v3/include/bits/uniform_int_dist.h
! 42198449d664e8a56de2d6f898af9194  libstdc++-v3/include/bits/unique_ptr.h
  4a84fc8c67a80bea5e7e7d22c7aea179  libstdc++-v3/include/bits/unordered_map.h
  c6eb8d4a755513fc43dbb8d5719d00ab  libstdc++-v3/include/bits/unordered_set.h
  1bbffc2dfcecddeb269f1e39bc126708  libstdc++-v3/include/bits/uses_allocator.h
--- 84010,84039 ----
  e5b264a967b895ef837a01b429fb7ca2  libstdc++-v3/include/bits/stl_deque.h
  dc967bce7eeb75712ed3c6707d363e47  libstdc++-v3/include/bits/stl_function.h
  4b7571848aebe508778902c406705077  libstdc++-v3/include/bits/stl_heap.h
! 879c1394de0b6d71bb7b0054466652bb  libstdc++-v3/include/bits/stl_iterator.h
  79c537ace31abfbb587f715ceae0b455  libstdc++-v3/include/bits/stl_iterator_base_funcs.h
  6e513ab7614a7b5a24f402a287af23e3  libstdc++-v3/include/bits/stl_iterator_base_types.h
  0c48fb7bc156ea1526824ae9c5ee1805  libstdc++-v3/include/bits/stl_list.h
! 73389200461211a5efb143d57836c79c  libstdc++-v3/include/bits/stl_map.h
! 3d8c7c78599fbb04acd76a8109538fc2  libstdc++-v3/include/bits/stl_multimap.h
! d78d02cb4f833dcce94f02a6dfa6e5fd  libstdc++-v3/include/bits/stl_multiset.h
  5f2acaf04b993e306b75dcc14877e7f2  libstdc++-v3/include/bits/stl_numeric.h
  1d9520b2cdc5022d49b4b59a82acdcdc  libstdc++-v3/include/bits/stl_pair.h
  844a4f273c88ff21a68db77d39180e03  libstdc++-v3/include/bits/stl_queue.h
  95a28ae884dd94a9908f33f7e6088443  libstdc++-v3/include/bits/stl_raw_storage_iter.h
  a9fa280316b07e950cfaa198795a7d16  libstdc++-v3/include/bits/stl_relops.h
! 9ccc5815c970b772f1e0d01157b71cf7  libstdc++-v3/include/bits/stl_set.h
! eb7abfa26bb82726982f9d2ea506e631  libstdc++-v3/include/bits/stl_stack.h
  135e26d18f59f9c797166d146410be1f  libstdc++-v3/include/bits/stl_tempbuf.h
! 7f298df0bd2a7d7f54d00db4b88cf450  libstdc++-v3/include/bits/stl_tree.h
  977ca56c20f9616a71556368af1ab055  libstdc++-v3/include/bits/stl_uninitialized.h
  a82511ac6537f991fd136d62ee218810  libstdc++-v3/include/bits/stl_vector.h
  435b98773d35537254095c906332835c  libstdc++-v3/include/bits/stream_iterator.h
  2a004bbd1c98faf6ebcb148c0c44ff49  libstdc++-v3/include/bits/streambuf.tcc
  7af47c9a13f44206097193b9bdaf15ae  libstdc++-v3/include/bits/streambuf_iterator.h
  28199adec95e40292569367297ebda54  libstdc++-v3/include/bits/stringfwd.h
! 3a49c0209ced0bc22e6010d8827a9000  libstdc++-v3/include/bits/uniform_int_dist.h
! 233ba0c0b513e38eec3f58c50de04b0b  libstdc++-v3/include/bits/unique_ptr.h
  4a84fc8c67a80bea5e7e7d22c7aea179  libstdc++-v3/include/bits/unordered_map.h
  c6eb8d4a755513fc43dbb8d5719d00ab  libstdc++-v3/include/bits/unordered_set.h
  1bbffc2dfcecddeb269f1e39bc126708  libstdc++-v3/include/bits/uses_allocator.h
*************** a7c9cb239f069f58ee02a34f3852f8ab  libstd
*** 83741,83747 ****
  93f3ea1836091eae75d5ade3863d9df3  libstdc++-v3/include/c_global/ciso646
  97b7b2ff08afae3d1443419576ae4be6  libstdc++-v3/include/c_global/climits
  4eda40ed6ff0261eae6c6b804d1b5b83  libstdc++-v3/include/c_global/clocale
! 981246f3a188e82a33d77abde4e527f5  libstdc++-v3/include/c_global/cmath
  e259231fdcb9f0d4fc6bcb0b2a7e95fb  libstdc++-v3/include/c_global/csetjmp
  5097425c2542629234e2833dc796a625  libstdc++-v3/include/c_global/csignal
  44951d53ee6510c911d473de3572553c  libstdc++-v3/include/c_global/cstdalign
--- 84094,84100 ----
  93f3ea1836091eae75d5ade3863d9df3  libstdc++-v3/include/c_global/ciso646
  97b7b2ff08afae3d1443419576ae4be6  libstdc++-v3/include/c_global/climits
  4eda40ed6ff0261eae6c6b804d1b5b83  libstdc++-v3/include/c_global/clocale
! 43ed3fd21abd108db67ac311f322d502  libstdc++-v3/include/c_global/cmath
  e259231fdcb9f0d4fc6bcb0b2a7e95fb  libstdc++-v3/include/c_global/csetjmp
  5097425c2542629234e2833dc796a625  libstdc++-v3/include/c_global/csignal
  44951d53ee6510c911d473de3572553c  libstdc++-v3/include/c_global/cstdalign
*************** e3f33a0e0d70a327203f10cc5518860c  libstd
*** 83789,83795 ****
  cd18e1e8f4318bcccd0533a465a68b90  libstdc++-v3/include/debug/multiset.h
  2bff5008e7eb8647ff94aeb2714fb2ce  libstdc++-v3/include/debug/safe_base.h
  51ccdffeb1fdc018338e5a8e427d5f96  libstdc++-v3/include/debug/safe_container.h
! 31d93f1444b1cfd3fe4ec6ff83e4b297  libstdc++-v3/include/debug/safe_iterator.h
  5ef26c9e6516db9f724e52c69bc1211c  libstdc++-v3/include/debug/safe_iterator.tcc
  fffc7c4335636b7de44054d035dbc9b5  libstdc++-v3/include/debug/safe_local_iterator.h
  5c9229d921a930cc2ebfb035a9e58975  libstdc++-v3/include/debug/safe_local_iterator.tcc
--- 84142,84148 ----
  cd18e1e8f4318bcccd0533a465a68b90  libstdc++-v3/include/debug/multiset.h
  2bff5008e7eb8647ff94aeb2714fb2ce  libstdc++-v3/include/debug/safe_base.h
  51ccdffeb1fdc018338e5a8e427d5f96  libstdc++-v3/include/debug/safe_container.h
! 689a5a44322c5af10b0bd6c26a1102d3  libstdc++-v3/include/debug/safe_iterator.h
  5ef26c9e6516db9f724e52c69bc1211c  libstdc++-v3/include/debug/safe_iterator.tcc
  fffc7c4335636b7de44054d035dbc9b5  libstdc++-v3/include/debug/safe_local_iterator.h
  5c9229d921a930cc2ebfb035a9e58975  libstdc++-v3/include/debug/safe_local_iterator.tcc
*************** ec20bebadbca12593b0f4fe575aa7643  libstd
*** 83800,83827 ****
  7f09dc669ba4b84568ffdd48ad171bc2  libstdc++-v3/include/debug/safe_unordered_container.tcc
  400742b3cba5b15ceab4fa324622e302  libstdc++-v3/include/debug/set
  294ecd493d646d45c1cc15ab994e69c9  libstdc++-v3/include/debug/set.h
! 7d0a67137aa952abd6b0d16287607b3f  libstdc++-v3/include/debug/string
  3cb07788058b0ba5b6228f43ae4288a8  libstdc++-v3/include/debug/unordered_map
  cc503cc585e3281614048e3c708ae821  libstdc++-v3/include/debug/unordered_set
  70e547e4514cde7b73e662269c4b7d72  libstdc++-v3/include/debug/vector
  c1a87224d2f217b9955455cbf8225c4c  libstdc++-v3/include/decimal/decimal
  c22a57829dec6f6226799a88f190087a  libstdc++-v3/include/decimal/decimal.h
! 86ff6c836a8c7bafb835bea011299adf  libstdc++-v3/include/experimental/algorithm
! 0dd5e6928d94db2e39f0f1e0b0b1340c  libstdc++-v3/include/experimental/any
! d7b0736935b0d3484aa6f79487fb15fb  libstdc++-v3/include/experimental/chrono
  310717c2cc2f5a34d10fb0684c7e602b  libstdc++-v3/include/experimental/filesystem
! f867264b85040767e59b68622b0c7215  libstdc++-v3/include/experimental/fs_dir.h
! c4ebb909569cfed63f6326cbba93bc00  libstdc++-v3/include/experimental/fs_fwd.h
! 60f6e576c569247c74f485e4a5521d17  libstdc++-v3/include/experimental/fs_ops.h
! b3e375d164168949dbdc9870534d5377  libstdc++-v3/include/experimental/fs_path.h
! 883e4541cb86fe010b322b838e41b8f5  libstdc++-v3/include/experimental/functional
! 6f7850536d5a2590e6e6a5b8a0ca1b2e  libstdc++-v3/include/experimental/optional
! cfe230b51d0f23891866c66b9476e1f5  libstdc++-v3/include/experimental/ratio
! b75c42f857b5e639ba2b68e7ba237565  libstdc++-v3/include/experimental/string_view
! 67983f2820330e7b17feba8ae1038f87  libstdc++-v3/include/experimental/string_view.tcc
! ed6d39a1d675716d9020eb743b98515f  libstdc++-v3/include/experimental/system_error
! 7b24082c3c6b8fefb76aa9d2714583f3  libstdc++-v3/include/experimental/tuple
! a964589d37e2ec0ae06f651f97021507  libstdc++-v3/include/experimental/type_traits
  d03045310ee74ec2b24aacfe0f085c53  libstdc++-v3/include/ext/algorithm
  8f4dd786b24537e778a632c65d8ea6c1  libstdc++-v3/include/ext/aligned_buffer.h
  2646f0407f618ea2f4225764e9ad41e6  libstdc++-v3/include/ext/alloc_traits.h
--- 84153,84181 ----
  7f09dc669ba4b84568ffdd48ad171bc2  libstdc++-v3/include/debug/safe_unordered_container.tcc
  400742b3cba5b15ceab4fa324622e302  libstdc++-v3/include/debug/set
  294ecd493d646d45c1cc15ab994e69c9  libstdc++-v3/include/debug/set.h
! f829c80d9aabaad6a98230a2cdbf1895  libstdc++-v3/include/debug/string
  3cb07788058b0ba5b6228f43ae4288a8  libstdc++-v3/include/debug/unordered_map
  cc503cc585e3281614048e3c708ae821  libstdc++-v3/include/debug/unordered_set
  70e547e4514cde7b73e662269c4b7d72  libstdc++-v3/include/debug/vector
  c1a87224d2f217b9955455cbf8225c4c  libstdc++-v3/include/decimal/decimal
  c22a57829dec6f6226799a88f190087a  libstdc++-v3/include/decimal/decimal.h
! 25256c4a7837f553b4dd87bf23b57777  libstdc++-v3/include/experimental/algorithm
! 8cd1d3748143ca2a4fb5edf5bedd8aa6  libstdc++-v3/include/experimental/any
! f211cf68119b890dc49a6647bc23bf54  libstdc++-v3/include/experimental/chrono
  310717c2cc2f5a34d10fb0684c7e602b  libstdc++-v3/include/experimental/filesystem
! ed379b4673715c9e92ff047464a24753  libstdc++-v3/include/experimental/fs_dir.h
! 8eef88b3fccab1cfd387e1f423440181  libstdc++-v3/include/experimental/fs_fwd.h
! b57f7cbbc75572b99ed9eb65eb2e4d6c  libstdc++-v3/include/experimental/fs_ops.h
! 7d374ee41c7c8d8b7f9bb98317e64b11  libstdc++-v3/include/experimental/fs_path.h
! bcd4ec15dc1e8c3806475113355c4fce  libstdc++-v3/include/experimental/functional
! 6ee95532bf7c7fc2f254ea6ef9ba69b5  libstdc++-v3/include/experimental/lfts_config.h
! c79e856962cf9dd0a98de41441cb4118  libstdc++-v3/include/experimental/optional
! 2c59b36f2c1ba936399c3f77207d7511  libstdc++-v3/include/experimental/ratio
! feffd3992f53152702be415270de282a  libstdc++-v3/include/experimental/string_view
! e80dd353ac0f2f05248f2ed419b1c245  libstdc++-v3/include/experimental/string_view.tcc
! 7acd7ec72461b14af3e8eff951dc8d50  libstdc++-v3/include/experimental/system_error
! 300c8748aadac9b00673c07f136a1631  libstdc++-v3/include/experimental/tuple
! 08c8f28fad4b84c395633e6aca3da7e5  libstdc++-v3/include/experimental/type_traits
  d03045310ee74ec2b24aacfe0f085c53  libstdc++-v3/include/ext/algorithm
  8f4dd786b24537e778a632c65d8ea6c1  libstdc++-v3/include/ext/aligned_buffer.h
  2646f0407f618ea2f4225764e9ad41e6  libstdc++-v3/include/ext/alloc_traits.h
*************** fe55cfa77fc8847284ecd13e3f3d259f  libstd
*** 83840,83846 ****
  3dfe5a7584de8414767a343632b54885  libstdc++-v3/include/ext/malloc_allocator.h
  9375e89000e7df3e178c67d3db4d1e76  libstdc++-v3/include/ext/memory
  89a69a9dc85ac093ea5db9c9f6f42e92  libstdc++-v3/include/ext/mt_allocator.h
! 155668750d7142788eb9f90b94f4e80f  libstdc++-v3/include/ext/new_allocator.h
  9dcbc7ec1a8ee98b058e32cdcd80bdc0  libstdc++-v3/include/ext/numeric
  7c06bd048c9006ff001b37411b062093  libstdc++-v3/include/ext/numeric_traits.h
  616c2edefb40bc0b64f393815599046a  libstdc++-v3/include/ext/pb_ds/assoc_container.hpp
--- 84194,84200 ----
  3dfe5a7584de8414767a343632b54885  libstdc++-v3/include/ext/malloc_allocator.h
  9375e89000e7df3e178c67d3db4d1e76  libstdc++-v3/include/ext/memory
  89a69a9dc85ac093ea5db9c9f6f42e92  libstdc++-v3/include/ext/mt_allocator.h
! b504571bb86ccbdc1a2c57e19c900c3e  libstdc++-v3/include/ext/new_allocator.h
  9dcbc7ec1a8ee98b058e32cdcd80bdc0  libstdc++-v3/include/ext/numeric
  7c06bd048c9006ff001b37411b062093  libstdc++-v3/include/ext/numeric_traits.h
  616c2edefb40bc0b64f393815599046a  libstdc++-v3/include/ext/pb_ds/assoc_container.hpp
*************** fa15bfae0b01ac65901916d24187f694  libstd
*** 83859,83865 ****
  1aa4b86f8dc531c948aa19652ce8f7cf  libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp
  c8fc47a16c126cf8fc0c739fa642c2db  libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp
  7e87c06f9cef9bd8e3ec394cf483412f  libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/traits.hpp
! fc8d9c1834cb9e44dc0a9ae102e7831c  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp
  c17f1ecd43c32b61b4c6e3e4e4aec7aa  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/const_iterator.hpp
  f4600911871dee38cde3f75e667e4867  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp
  930bbfc6f2e3cfd53abca03a40365bf3  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp
--- 84213,84219 ----
  1aa4b86f8dc531c948aa19652ce8f7cf  libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp
  c8fc47a16c126cf8fc0c739fa642c2db  libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp
  7e87c06f9cef9bd8e3ec394cf483412f  libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/traits.hpp
! dfc6004a37d6dcfbff248784de3c579c  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp
  c17f1ecd43c32b61b4c6e3e4e4aec7aa  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/const_iterator.hpp
  f4600911871dee38cde3f75e667e4867  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp
  930bbfc6f2e3cfd53abca03a40365bf3  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp
*************** a00f15023a904b6118947f4642e4d228  libstd
*** 83868,83874 ****
  464036dd29b060e16a179ac18509c45a  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp
  3988952fa664b2a8fad550c4fabf07ad  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp
  251479cf0dfd88a0593a3d1c793e5649  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp
! dfec7a1d4a055e77b5ea96bd980f9924  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp
  b1762ba99f6b811acc2c6b0d0c69da5a  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp
  dcd373695d11ed2958c442e5e70a5263  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/point_const_iterator.hpp
  ca69eba3a38113493cb6ab6e64c3b914  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp
--- 84222,84228 ----
  464036dd29b060e16a179ac18509c45a  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp
  3988952fa664b2a8fad550c4fabf07ad  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp
  251479cf0dfd88a0593a3d1c793e5649  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp
! fea72cd84699e3167fcda859cf8a0766  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp
  b1762ba99f6b811acc2c6b0d0c69da5a  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp
  dcd373695d11ed2958c442e5e70a5263  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/point_const_iterator.hpp
  ca69eba3a38113493cb6ab6e64c3b914  libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp
*************** fe344ea0009bf504f50b54881dd949b2  libstd
*** 84087,84093 ****
  fb227cfcf6e14a20c4983d642e6db7d5  libstdc++-v3/include/ext/pb_ds/tree_policy.hpp
  aca9684b0eebd7d0d99c505cc6db1d41  libstdc++-v3/include/ext/pb_ds/trie_policy.hpp
  64cda910f076139f0029995ed9aaad1f  libstdc++-v3/include/ext/pod_char_traits.h
! e6f47b174629de8feecf7de7f0a3189d  libstdc++-v3/include/ext/pointer.h
  15747e561bae554eae8538a0776f4e06  libstdc++-v3/include/ext/pool_allocator.h
  725adeb0cdf8e6d0228f257f0b7d9dd5  libstdc++-v3/include/ext/random
  924fef4ae21cf97d673e49bc190b482c  libstdc++-v3/include/ext/random.tcc
--- 84441,84447 ----
  fb227cfcf6e14a20c4983d642e6db7d5  libstdc++-v3/include/ext/pb_ds/tree_policy.hpp
  aca9684b0eebd7d0d99c505cc6db1d41  libstdc++-v3/include/ext/pb_ds/trie_policy.hpp
  64cda910f076139f0029995ed9aaad1f  libstdc++-v3/include/ext/pod_char_traits.h
! 77ba77cbd2e0e7c34ac4d967f18e6b22  libstdc++-v3/include/ext/pointer.h
  15747e561bae554eae8538a0776f4e06  libstdc++-v3/include/ext/pool_allocator.h
  725adeb0cdf8e6d0228f257f0b7d9dd5  libstdc++-v3/include/ext/random
  924fef4ae21cf97d673e49bc190b482c  libstdc++-v3/include/ext/random.tcc
*************** be695ad852fb6becd31a493fbafaefb0  libstd
*** 84186,84207 ****
  fc517c1f9b8018c15f3f9f1bbff88e43  libstdc++-v3/include/profile/vector
  46a3effda6f9d177c9806bd25eb2f66a  libstdc++-v3/include/std/algorithm
  eb1168b6ad4a483b491aaa255a68f919  libstdc++-v3/include/std/array
! cc021a4641775e06d48ba4bfd74fe6d0  libstdc++-v3/include/std/atomic
  7a29a48d6af4c1f3721f95c43d971662  libstdc++-v3/include/std/bitset
! b49f125a25fa9d6e7a5eb0b3932b0e29  libstdc++-v3/include/std/chrono
  ab8aa02144cdc1deb697f2a83ae3a434  libstdc++-v3/include/std/codecvt
! 4bbbeabd3c5a3d8448b54e64ca5b33fc  libstdc++-v3/include/std/complex
  6c505062630d48ec1472158b3be2f3f0  libstdc++-v3/include/std/condition_variable
  db284b41962fcb743cdf99e0b7dccbb7  libstdc++-v3/include/std/deque
  21a6baacdc50d7caa857b7fec30529d5  libstdc++-v3/include/std/forward_list
  3eb8357a1d87d69fc0ee5c5aa18e08e3  libstdc++-v3/include/std/fstream
! 9519d1afcc5bfb8e0a4630ab49e698c4  libstdc++-v3/include/std/functional
  6cbedd2aa0c122682c4359a484ca4003  libstdc++-v3/include/std/future
  f539a9510d347a6abfb269cee43c2f2e  libstdc++-v3/include/std/iomanip
  0e1e6882cd98ccd32f4ee4646376b5ff  libstdc++-v3/include/std/ios
  0d84938c8e26ba753e373decbd7283be  libstdc++-v3/include/std/iosfwd
  e4bf0770e011947b8a7d56d8cb6ec2e5  libstdc++-v3/include/std/iostream
! 7954ed15df327dd2edd887e32aad727f  libstdc++-v3/include/std/istream
  322a2fb29a24705ab2b82b67b62b224f  libstdc++-v3/include/std/iterator
  7e984c692fad49aaf5f38d50eec9f034  libstdc++-v3/include/std/limits
  2ac85ebc9b5b48a20655ef3a62309566  libstdc++-v3/include/std/list
--- 84540,84561 ----
  fc517c1f9b8018c15f3f9f1bbff88e43  libstdc++-v3/include/profile/vector
  46a3effda6f9d177c9806bd25eb2f66a  libstdc++-v3/include/std/algorithm
  eb1168b6ad4a483b491aaa255a68f919  libstdc++-v3/include/std/array
! 90748dfbc8f12d4d2cc06252b985b7f4  libstdc++-v3/include/std/atomic
  7a29a48d6af4c1f3721f95c43d971662  libstdc++-v3/include/std/bitset
! 01b6e92b81255cc73173f940a41fb5ce  libstdc++-v3/include/std/chrono
  ab8aa02144cdc1deb697f2a83ae3a434  libstdc++-v3/include/std/codecvt
! e168c12adef8de53e8fdc8785659bae8  libstdc++-v3/include/std/complex
  6c505062630d48ec1472158b3be2f3f0  libstdc++-v3/include/std/condition_variable
  db284b41962fcb743cdf99e0b7dccbb7  libstdc++-v3/include/std/deque
  21a6baacdc50d7caa857b7fec30529d5  libstdc++-v3/include/std/forward_list
  3eb8357a1d87d69fc0ee5c5aa18e08e3  libstdc++-v3/include/std/fstream
! 5fc4fb9f4160c3f7b865c3b14ec1e047  libstdc++-v3/include/std/functional
  6cbedd2aa0c122682c4359a484ca4003  libstdc++-v3/include/std/future
  f539a9510d347a6abfb269cee43c2f2e  libstdc++-v3/include/std/iomanip
  0e1e6882cd98ccd32f4ee4646376b5ff  libstdc++-v3/include/std/ios
  0d84938c8e26ba753e373decbd7283be  libstdc++-v3/include/std/iosfwd
  e4bf0770e011947b8a7d56d8cb6ec2e5  libstdc++-v3/include/std/iostream
! e94aac177534fbfef489f5ac6681952f  libstdc++-v3/include/std/istream
  322a2fb29a24705ab2b82b67b62b224f  libstdc++-v3/include/std/iterator
  7e984c692fad49aaf5f38d50eec9f034  libstdc++-v3/include/std/limits
  2ac85ebc9b5b48a20655ef3a62309566  libstdc++-v3/include/std/list
*************** f6be4066040330ef8e56f2de864c093b  libstd
*** 84215,84236 ****
  3d27aba8248e8cca4e8d448dc453f3dc  libstdc++-v3/include/std/random
  f491c417f1578fe6a2b7a7188080e9c6  libstdc++-v3/include/std/ratio
  a7902b42817c151acad6f28a2e5e6260  libstdc++-v3/include/std/regex
! c8ddc32928c1e2ce77437ebfe1a76599  libstdc++-v3/include/std/scoped_allocator
  4c392d082fe23b1780f3d04accc60d71  libstdc++-v3/include/std/set
  1b48aba7694aa6424e11e11218c3da15  libstdc++-v3/include/std/shared_mutex
! 1701cc092825192d1c2c8851cf442037  libstdc++-v3/include/std/sstream
  40479fb6ad81c6441f835438bce8725a  libstdc++-v3/include/std/stack
  792e013af7addf73559758069de4f429  libstdc++-v3/include/std/stdexcept
  96d2134205fb1d08d2197f5c916894a5  libstdc++-v3/include/std/streambuf
  b7c2ecfa12aa19964c07c9f3a15ac0d8  libstdc++-v3/include/std/string
  322bd374fb7688d906518199b1625516  libstdc++-v3/include/std/system_error
! 32e7d02b80646f6425790123bf89a163  libstdc++-v3/include/std/thread
! ce874c3b1b5889c09426dfbe2a507085  libstdc++-v3/include/std/tuple
  23a62c4a52d20cbd2d0261c6e1838729  libstdc++-v3/include/std/type_traits
  fc4bbfc09c3e949f9295f9017afddb1d  libstdc++-v3/include/std/typeindex
  8e3f73eceba4af13872d4b6421fd0611  libstdc++-v3/include/std/unordered_map
  1a70cae3286d6ec85c1366ba0c33e77a  libstdc++-v3/include/std/unordered_set
! f30eea6d3fbdbeba3799ef28c125b2e4  libstdc++-v3/include/std/utility
  bd7776c88f7dab8a61003fa4ee57be91  libstdc++-v3/include/std/valarray
  085de62d1b6f2110cb6bae42ffc0a9a0  libstdc++-v3/include/std/vector
  5f20a085c04a69f2ad980138be7f249f  libstdc++-v3/include/tr1/array
--- 84569,84590 ----
  3d27aba8248e8cca4e8d448dc453f3dc  libstdc++-v3/include/std/random
  f491c417f1578fe6a2b7a7188080e9c6  libstdc++-v3/include/std/ratio
  a7902b42817c151acad6f28a2e5e6260  libstdc++-v3/include/std/regex
! 44fcfe43210f82f9ce080f58282ddbf8  libstdc++-v3/include/std/scoped_allocator
  4c392d082fe23b1780f3d04accc60d71  libstdc++-v3/include/std/set
  1b48aba7694aa6424e11e11218c3da15  libstdc++-v3/include/std/shared_mutex
! 8c56f910f52a88be68b540d45dad40ac  libstdc++-v3/include/std/sstream
  40479fb6ad81c6441f835438bce8725a  libstdc++-v3/include/std/stack
  792e013af7addf73559758069de4f429  libstdc++-v3/include/std/stdexcept
  96d2134205fb1d08d2197f5c916894a5  libstdc++-v3/include/std/streambuf
  b7c2ecfa12aa19964c07c9f3a15ac0d8  libstdc++-v3/include/std/string
  322bd374fb7688d906518199b1625516  libstdc++-v3/include/std/system_error
! 79a56eefbca42e2f30f8727e2a92a5e2  libstdc++-v3/include/std/thread
! 9671bbe13a0a27b6d931b3ed1787fcdb  libstdc++-v3/include/std/tuple
  23a62c4a52d20cbd2d0261c6e1838729  libstdc++-v3/include/std/type_traits
  fc4bbfc09c3e949f9295f9017afddb1d  libstdc++-v3/include/std/typeindex
  8e3f73eceba4af13872d4b6421fd0611  libstdc++-v3/include/std/unordered_map
  1a70cae3286d6ec85c1366ba0c33e77a  libstdc++-v3/include/std/unordered_set
! ef591abea7d835b09ccc74e2ce116874  libstdc++-v3/include/std/utility
  bd7776c88f7dab8a61003fa4ee57be91  libstdc++-v3/include/std/valarray
  085de62d1b6f2110cb6bae42ffc0a9a0  libstdc++-v3/include/std/vector
  5f20a085c04a69f2ad980138be7f249f  libstdc++-v3/include/tr1/array
*************** bd7776c88f7dab8a61003fa4ee57be91  libstd
*** 84242,84248 ****
  5ae51365562bcb8c6d573847eb1fc641  libstdc++-v3/include/tr1/cfloat
  834d54aa786c2853e527f201a6e59584  libstdc++-v3/include/tr1/cinttypes
  ad151d94e79df58d06b03e0329e8de5f  libstdc++-v3/include/tr1/climits
! 7d2cddeee593cc048dbad15e15db8380  libstdc++-v3/include/tr1/cmath
  7b3b0a78d335f54c95aae4072f211a93  libstdc++-v3/include/tr1/complex
  c4354fbd022da12bbecf4c7eb14f2973  libstdc++-v3/include/tr1/complex.h
  b880b5ef4b1f73496a9f468d7345bb2e  libstdc++-v3/include/tr1/cstdarg
--- 84596,84602 ----
  5ae51365562bcb8c6d573847eb1fc641  libstdc++-v3/include/tr1/cfloat
  834d54aa786c2853e527f201a6e59584  libstdc++-v3/include/tr1/cinttypes
  ad151d94e79df58d06b03e0329e8de5f  libstdc++-v3/include/tr1/climits
! c48162c9be563f74746b0f178b0ed211  libstdc++-v3/include/tr1/cmath
  7b3b0a78d335f54c95aae4072f211a93  libstdc++-v3/include/tr1/complex
  c4354fbd022da12bbecf4c7eb14f2973  libstdc++-v3/include/tr1/complex.h
  b880b5ef4b1f73496a9f468d7345bb2e  libstdc++-v3/include/tr1/cstdarg
*************** a3f397a9552c0545301f163dfcb8f23e  libstd
*** 84313,84319 ****
  cfa4e920cf3f258f5524e2a292d4c41b  libstdc++-v3/libsupc++/bad_cast.cc
  feb0530f06efa95c5772caec8e313ef7  libstdc++-v3/libsupc++/bad_typeid.cc
  5a2e915ae2d643c364c48dd1e6ab3fd4  libstdc++-v3/libsupc++/class_type_info.cc
! 959d87f8a61c319083fafcb5041f53a9  libstdc++-v3/libsupc++/cxxabi.h
  7faa4d3f7492901207bb1794099ceaec  libstdc++-v3/libsupc++/cxxabi_forced.h
  04b8b7620fb0bd32e6c155d5784ced0d  libstdc++-v3/libsupc++/del_op.cc
  9c684e4391701c4344dd298efccf489d  libstdc++-v3/libsupc++/del_opnt.cc
--- 84667,84673 ----
  cfa4e920cf3f258f5524e2a292d4c41b  libstdc++-v3/libsupc++/bad_cast.cc
  feb0530f06efa95c5772caec8e313ef7  libstdc++-v3/libsupc++/bad_typeid.cc
  5a2e915ae2d643c364c48dd1e6ab3fd4  libstdc++-v3/libsupc++/class_type_info.cc
! a3aeb56fa2c8939fd00772565d0c737f  libstdc++-v3/libsupc++/cxxabi.h
  7faa4d3f7492901207bb1794099ceaec  libstdc++-v3/libsupc++/cxxabi_forced.h
  04b8b7620fb0bd32e6c155d5784ced0d  libstdc++-v3/libsupc++/del_op.cc
  9c684e4391701c4344dd298efccf489d  libstdc++-v3/libsupc++/del_opnt.cc
*************** d492c556dc465cbf896577d42b1d0134  libstd
*** 84383,84390 ****
  1aecbbcd88478de8b81a68900cf01bfa  libstdc++-v3/python/hook.in
  68b329da9893e34099c7d8ad5cb9c940  libstdc++-v3/python/libstdcxx/__init__.py
  2335d4087de89a8af5818e642c816bdf  libstdc++-v3/python/libstdcxx/v6/__init__.py
! c10ac2480598a3d270e870cf3687a7cc  libstdc++-v3/python/libstdcxx/v6/printers.py
! 30047004779f3384e4533fed594e701d  libstdc++-v3/python/libstdcxx/v6/xmethods.py
  b1441422cec6381d9285b7681b666124  libstdc++-v3/scripts/check_compile
  533e594add6e79910b0e557ba690fac6  libstdc++-v3/scripts/check_performance
  f480e111db2d50194a3e1f7014c9f422  libstdc++-v3/scripts/create_testsuite_files
--- 84737,84744 ----
  1aecbbcd88478de8b81a68900cf01bfa  libstdc++-v3/python/hook.in
  68b329da9893e34099c7d8ad5cb9c940  libstdc++-v3/python/libstdcxx/__init__.py
  2335d4087de89a8af5818e642c816bdf  libstdc++-v3/python/libstdcxx/v6/__init__.py
! 68d55600470ded815cdb928038e6dd00  libstdc++-v3/python/libstdcxx/v6/printers.py
! ddb64ac7fb08df24b811bdae09dd5165  libstdc++-v3/python/libstdcxx/v6/xmethods.py
  b1441422cec6381d9285b7681b666124  libstdc++-v3/scripts/check_compile
  533e594add6e79910b0e557ba690fac6  libstdc++-v3/scripts/check_performance
  f480e111db2d50194a3e1f7014c9f422  libstdc++-v3/scripts/create_testsuite_files
*************** b4fc738d3ce1e40f1b00792be045fa5a  libstd
*** 84402,84408 ****
  347521178190815879ac73d36dcef6fe  libstdc++-v3/src/c++11/Makefile.am
  32764fd4044c21291accd4f3ad5d7609  libstdc++-v3/src/c++11/Makefile.in
  3067c78086cb727760dfa1fae6d841b7  libstdc++-v3/src/c++11/chrono.cc
! a439d45799a30a40e1e702337f62e524  libstdc++-v3/src/c++11/codecvt.cc
  e96ab9bd2269a688c11d3c3220f924a7  libstdc++-v3/src/c++11/compatibility-atomic-c++0x.cc
  2c66f763695c6f4b1982c366a8d5eb86  libstdc++-v3/src/c++11/compatibility-c++0x.cc
  41cf96da1731eb71912646ff35c67971  libstdc++-v3/src/c++11/compatibility-chrono.cc
--- 84756,84762 ----
  347521178190815879ac73d36dcef6fe  libstdc++-v3/src/c++11/Makefile.am
  32764fd4044c21291accd4f3ad5d7609  libstdc++-v3/src/c++11/Makefile.in
  3067c78086cb727760dfa1fae6d841b7  libstdc++-v3/src/c++11/chrono.cc
! a6ad6bfb7cce19b9cdf432a0e30251b9  libstdc++-v3/src/c++11/codecvt.cc
  e96ab9bd2269a688c11d3c3220f924a7  libstdc++-v3/src/c++11/compatibility-atomic-c++0x.cc
  2c66f763695c6f4b1982c366a8d5eb86  libstdc++-v3/src/c++11/compatibility-c++0x.cc
  41cf96da1731eb71912646ff35c67971  libstdc++-v3/src/c++11/compatibility-chrono.cc
*************** aa183a21faffc51dfc6dc325b1fd925c  libstd
*** 84420,84426 ****
  06eb3bc6425f3a69a104675f56deb968  libstdc++-v3/src/c++11/cxx11-hash_tr1.cc
  c3bc14ceb9885ee3523ae6a7c7bd0213  libstdc++-v3/src/c++11/cxx11-ios_failure.cc
  ac3f803cd282ae86e5bcf061277e600f  libstdc++-v3/src/c++11/cxx11-locale-inst.cc
! d1ce16ea3989024bc4b42f821992a142  libstdc++-v3/src/c++11/cxx11-shim_facets.cc
  954dc5689342cc2774b9bb6d703d4206  libstdc++-v3/src/c++11/cxx11-stdexcept.cc
  f22550c145c6a8a458508badfbc78af0  libstdc++-v3/src/c++11/cxx11-wlocale-inst.cc
  354e3c34982c593b5bb8d290e51eb421  libstdc++-v3/src/c++11/debug.cc
--- 84774,84780 ----
  06eb3bc6425f3a69a104675f56deb968  libstdc++-v3/src/c++11/cxx11-hash_tr1.cc
  c3bc14ceb9885ee3523ae6a7c7bd0213  libstdc++-v3/src/c++11/cxx11-ios_failure.cc
  ac3f803cd282ae86e5bcf061277e600f  libstdc++-v3/src/c++11/cxx11-locale-inst.cc
! bd4e5ac38d30935a895b19a7440d3faa  libstdc++-v3/src/c++11/cxx11-shim_facets.cc
  954dc5689342cc2774b9bb6d703d4206  libstdc++-v3/src/c++11/cxx11-stdexcept.cc
  f22550c145c6a8a458508badfbc78af0  libstdc++-v3/src/c++11/cxx11-wlocale-inst.cc
  354e3c34982c593b5bb8d290e51eb421  libstdc++-v3/src/c++11/debug.cc
*************** bc73b73cdb2850fc54b3a4945e6152b5  libstd
*** 84443,84449 ****
  ab51932d5ec5f3308db7e0f01051cbdb  libstdc++-v3/src/c++11/placeholders.cc
  ca12e43ecd382508ef81e77522ce995a  libstdc++-v3/src/c++11/random.cc
  94351b1ce2a3f07857aaa3dcc9b63371  libstdc++-v3/src/c++11/regex.cc
! 86372580e8e6ba76040e8ca033edc91f  libstdc++-v3/src/c++11/shared_ptr.cc
  88d8414cea330d1d1055cdfd907f7eb1  libstdc++-v3/src/c++11/snprintf_lite.cc
  9a5842d919431ac35e088b4d1e7d47bb  libstdc++-v3/src/c++11/sstream-inst.cc
  bb8bc0cebfae6eb1061e58156dbd6e26  libstdc++-v3/src/c++11/streambuf-inst.cc
--- 84797,84803 ----
  ab51932d5ec5f3308db7e0f01051cbdb  libstdc++-v3/src/c++11/placeholders.cc
  ca12e43ecd382508ef81e77522ce995a  libstdc++-v3/src/c++11/random.cc
  94351b1ce2a3f07857aaa3dcc9b63371  libstdc++-v3/src/c++11/regex.cc
! de7fc10ad3078d974868e0c0b615472d  libstdc++-v3/src/c++11/shared_ptr.cc
  88d8414cea330d1d1055cdfd907f7eb1  libstdc++-v3/src/c++11/snprintf_lite.cc
  9a5842d919431ac35e088b4d1e7d47bb  libstdc++-v3/src/c++11/sstream-inst.cc
  bb8bc0cebfae6eb1061e58156dbd6e26  libstdc++-v3/src/c++11/streambuf-inst.cc
*************** f72f009c32f65bd525a1f0108a072855  libstd
*** 84495,84506 ****
  d2a1df0512a3ee37e33fc3c645922943  libstdc++-v3/src/c++98/tree.cc
  b6ffd48f6fea97d129e65b09896cf445  libstdc++-v3/src/c++98/valarray.cc
  60743fa9fa3d0ef76053bf3349624d6a  libstdc++-v3/src/filesystem/Makefile.am
! 39c72e3d3c5a6d860a94b5db458305b6  libstdc++-v3/src/filesystem/Makefile.in
  7633d4fa9dec0a57af7e7287834bfa78  libstdc++-v3/src/filesystem/cow-dir.cc
  8b626bae3ecd899c4363656ec78276dc  libstdc++-v3/src/filesystem/cow-ops.cc
  77d2776bb7a7156b2171591c26603519  libstdc++-v3/src/filesystem/cow-path.cc
! 488641174cc55b0a8a164893d5519ae7  libstdc++-v3/src/filesystem/dir.cc
! 542ef4263ac6b7140fdedffd6d2f2743  libstdc++-v3/src/filesystem/ops.cc
  8891cd157a54799cac221560ee4ae353  libstdc++-v3/src/filesystem/path.cc
  e8577b85117bb2ed35d706daad710c24  libstdc++-v3/src/shared/hashtable-aux.cc
  b452563b3592bb70abb353bc4a955541  libstdc++-v3/testsuite/17_intro/freestanding.cc
--- 84849,84860 ----
  d2a1df0512a3ee37e33fc3c645922943  libstdc++-v3/src/c++98/tree.cc
  b6ffd48f6fea97d129e65b09896cf445  libstdc++-v3/src/c++98/valarray.cc
  60743fa9fa3d0ef76053bf3349624d6a  libstdc++-v3/src/filesystem/Makefile.am
! 508b2762a46b6cf175cb42a9a17e1415  libstdc++-v3/src/filesystem/Makefile.in
  7633d4fa9dec0a57af7e7287834bfa78  libstdc++-v3/src/filesystem/cow-dir.cc
  8b626bae3ecd899c4363656ec78276dc  libstdc++-v3/src/filesystem/cow-ops.cc
  77d2776bb7a7156b2171591c26603519  libstdc++-v3/src/filesystem/cow-path.cc
! 723eb3eca4a3dbab97e94d243567cb6f  libstdc++-v3/src/filesystem/dir.cc
! 255a1c9e2550418b2be49c98182481f6  libstdc++-v3/src/filesystem/ops.cc
  8891cd157a54799cac221560ee4ae353  libstdc++-v3/src/filesystem/path.cc
  e8577b85117bb2ed35d706daad710c24  libstdc++-v3/src/shared/hashtable-aux.cc
  b452563b3592bb70abb353bc4a955541  libstdc++-v3/testsuite/17_intro/freestanding.cc
*************** f9e18ed7b2c745c612d4a9e2781774ba  libstd
*** 84525,84540 ****
  64803001dc96978bc048e5db2c185676  libstdc++-v3/testsuite/17_intro/headers/c++200x/stdc++.cc
  23b710261d9dfeaa56b11f1c6663f559  libstdc++-v3/testsuite/17_intro/headers/c++200x/stdc++_multiple_inclusion.cc
  07377fd6b991a8e29452c6375d760f28  libstdc++-v3/testsuite/17_intro/headers/c++2014/all_attributes.cc
  b20af6980716c71dcfdaf47d1b8f43b4  libstdc++-v3/testsuite/17_intro/shared_with_static_deps.cc
  13744eaa189ffc141fec7ed2cc2e0fd9  libstdc++-v3/testsuite/17_intro/static.cc
  dd1db8f3291dd92207aef73e464c4f00  libstdc++-v3/testsuite/17_intro/using_namespace_std.cc
  e379f3abfa90fa623f4bfae80420fbe0  libstdc++-v3/testsuite/17_intro/using_namespace_std_tr1_neg.cc
  dff67fa1e948df67524cbea647ef3880  libstdc++-v3/testsuite/18_support/50594.cc
  6fd3c6a703732fa2fce4dcf694120245  libstdc++-v3/testsuite/18_support/bad_alloc/cons_virtual_derivation.cc
  ab4ac40b50beaa88b20a88b1223fb0ed  libstdc++-v3/testsuite/18_support/bad_alloc/what.cc
  40270ac8ab9c1b4a93bddcff3ba55c8f  libstdc++-v3/testsuite/18_support/bad_cast/cons_virtual_derivation.cc
  4f287bfffd543db150c1a4de9484aad6  libstdc++-v3/testsuite/18_support/bad_cast/what.cc
! 7b6a147d68233bcf8e6fd542e72a66a9  libstdc++-v3/testsuite/18_support/bad_exception/23591_thread-1.c
  40d40a75fc85c09bb6415b69d4a478b2  libstdc++-v3/testsuite/18_support/bad_exception/59392.cc
  29f0fe0c71d85717627a92186312ca08  libstdc++-v3/testsuite/18_support/bad_exception/cons_virtual_derivation.cc
  ddfcdae67cc3602eaad9a30060ab5ca7  libstdc++-v3/testsuite/18_support/bad_exception/what.cc
--- 84879,84896 ----
  64803001dc96978bc048e5db2c185676  libstdc++-v3/testsuite/17_intro/headers/c++200x/stdc++.cc
  23b710261d9dfeaa56b11f1c6663f559  libstdc++-v3/testsuite/17_intro/headers/c++200x/stdc++_multiple_inclusion.cc
  07377fd6b991a8e29452c6375d760f28  libstdc++-v3/testsuite/17_intro/headers/c++2014/all_attributes.cc
+ e5203b13d9e40e55dfe4e0ca32686e3a  libstdc++-v3/testsuite/17_intro/names.cc
  b20af6980716c71dcfdaf47d1b8f43b4  libstdc++-v3/testsuite/17_intro/shared_with_static_deps.cc
  13744eaa189ffc141fec7ed2cc2e0fd9  libstdc++-v3/testsuite/17_intro/static.cc
  dd1db8f3291dd92207aef73e464c4f00  libstdc++-v3/testsuite/17_intro/using_namespace_std.cc
+ 70398e36de079e37329ba49c127d140b  libstdc++-v3/testsuite/17_intro/using_namespace_std_exp_neg.cc
  e379f3abfa90fa623f4bfae80420fbe0  libstdc++-v3/testsuite/17_intro/using_namespace_std_tr1_neg.cc
  dff67fa1e948df67524cbea647ef3880  libstdc++-v3/testsuite/18_support/50594.cc
  6fd3c6a703732fa2fce4dcf694120245  libstdc++-v3/testsuite/18_support/bad_alloc/cons_virtual_derivation.cc
  ab4ac40b50beaa88b20a88b1223fb0ed  libstdc++-v3/testsuite/18_support/bad_alloc/what.cc
  40270ac8ab9c1b4a93bddcff3ba55c8f  libstdc++-v3/testsuite/18_support/bad_cast/cons_virtual_derivation.cc
  4f287bfffd543db150c1a4de9484aad6  libstdc++-v3/testsuite/18_support/bad_cast/what.cc
! bd94485ce14edea1314b686a19408742  libstdc++-v3/testsuite/18_support/bad_exception/23591_thread-1.c
  40d40a75fc85c09bb6415b69d4a478b2  libstdc++-v3/testsuite/18_support/bad_exception/59392.cc
  29f0fe0c71d85717627a92186312ca08  libstdc++-v3/testsuite/18_support/bad_exception/cons_virtual_derivation.cc
  ddfcdae67cc3602eaad9a30060ab5ca7  libstdc++-v3/testsuite/18_support/bad_exception/what.cc
*************** b9c25e04ebf6a3462c016ce91cfea3ed  libstd
*** 84580,84586 ****
  63297a19fa260830f22d037fac689378  libstdc++-v3/testsuite/18_support/headers/exception/synopsis.cc
  44d66081e02d2c695782d5c5dd6ebaaf  libstdc++-v3/testsuite/18_support/headers/exception/types_std.cc
  f9d813df87f521529e31d55d48f9f1c1  libstdc++-v3/testsuite/18_support/headers/limits/synopsis.cc
! 460c9c6d56139fc750a54217fca8b82f  libstdc++-v3/testsuite/18_support/headers/new/synopsis.cc
  33f386b817e1ca3f9cabe8078096e403  libstdc++-v3/testsuite/18_support/headers/new/types_std.cc
  91572598fe62c0ea331bb7fec245ba0f  libstdc++-v3/testsuite/18_support/headers/typeinfo/synopsis.cc
  a1940ef71895b619745457baaa4c617f  libstdc++-v3/testsuite/18_support/headers/typeinfo/types_std.cc
--- 84936,84943 ----
  63297a19fa260830f22d037fac689378  libstdc++-v3/testsuite/18_support/headers/exception/synopsis.cc
  44d66081e02d2c695782d5c5dd6ebaaf  libstdc++-v3/testsuite/18_support/headers/exception/types_std.cc
  f9d813df87f521529e31d55d48f9f1c1  libstdc++-v3/testsuite/18_support/headers/limits/synopsis.cc
! 1a68500134caf6d76d07e0dc384af635  libstdc++-v3/testsuite/18_support/headers/new/synopsis.cc
! 96bc0ae5d946b289246aea969013d2b7  libstdc++-v3/testsuite/18_support/headers/new/synopsis_cxx98.cc
  33f386b817e1ca3f9cabe8078096e403  libstdc++-v3/testsuite/18_support/headers/new/types_std.cc
  91572598fe62c0ea331bb7fec245ba0f  libstdc++-v3/testsuite/18_support/headers/typeinfo/synopsis.cc
  a1940ef71895b619745457baaa4c617f  libstdc++-v3/testsuite/18_support/headers/typeinfo/types_std.cc
*************** dd797895afd8213d2e94b7eca5c31f55  libstd
*** 84653,84659 ****
  9d614eb890b0e76dd19ce1760382fcf2  libstdc++-v3/testsuite/19_diagnostics/headers/stdexcept/synopsis.cc
  1255fe501b2f5d9234a98b2bb5fb7093  libstdc++-v3/testsuite/19_diagnostics/headers/stdexcept/types_std.cc
  cd6745cc758ceb02097d5b1a80288856  libstdc++-v3/testsuite/19_diagnostics/headers/system_error/34538.cc
! fdff26e83117f91f5a902d03f132a0d8  libstdc++-v3/testsuite/19_diagnostics/headers/system_error/errc_std_c++0x.cc
  32e9779221eece8fd1127a59d87efc5e  libstdc++-v3/testsuite/19_diagnostics/headers/system_error/std_c++0x_neg.cc
  58626c928d03efb7310e0a9ba1e2b63c  libstdc++-v3/testsuite/19_diagnostics/headers/system_error/types_std_c++0x.cc
  d5156d412da4245970e1d2ef2bf578bc  libstdc++-v3/testsuite/19_diagnostics/logic_error/cons_virtual_derivation.cc
--- 85010,85016 ----
  9d614eb890b0e76dd19ce1760382fcf2  libstdc++-v3/testsuite/19_diagnostics/headers/stdexcept/synopsis.cc
  1255fe501b2f5d9234a98b2bb5fb7093  libstdc++-v3/testsuite/19_diagnostics/headers/stdexcept/types_std.cc
  cd6745cc758ceb02097d5b1a80288856  libstdc++-v3/testsuite/19_diagnostics/headers/system_error/34538.cc
! 4a17630c19748848f8f31f427e460f6e  libstdc++-v3/testsuite/19_diagnostics/headers/system_error/errc_std_c++0x.cc
  32e9779221eece8fd1127a59d87efc5e  libstdc++-v3/testsuite/19_diagnostics/headers/system_error/std_c++0x_neg.cc
  58626c928d03efb7310e0a9ba1e2b63c  libstdc++-v3/testsuite/19_diagnostics/headers/system_error/types_std_c++0x.cc
  d5156d412da4245970e1d2ef2bf578bc  libstdc++-v3/testsuite/19_diagnostics/logic_error/cons_virtual_derivation.cc
*************** bf2688b86ce4aa935512f08e2bff9814  libstd
*** 84712,84717 ****
--- 85069,85075 ----
  33a6133425f823526d50d60ca3d4b53a  libstdc++-v3/testsuite/20_util/allocator/8230.cc
  00ea8a5316b45c4a87aa20442f626d8e  libstdc++-v3/testsuite/20_util/allocator/requirements/explicit_instantiation/1.cc
  c97dba592ac17f95df08491e77e499e1  libstdc++-v3/testsuite/20_util/allocator/requirements/typedefs.cc
+ 357db2c847b39ea41eb430b0b1e001c6  libstdc++-v3/testsuite/20_util/allocator/void.cc
  161431214f03e89da5e00e829b85cda0  libstdc++-v3/testsuite/20_util/allocator_traits/members/allocate_hint.cc
  664404864917c584eb2d9c077f6a0041  libstdc++-v3/testsuite/20_util/allocator_traits/members/allocate_hint_nonpod.cc
  79f710905baa9f1c48f2b478a1597e74  libstdc++-v3/testsuite/20_util/allocator_traits/members/construct.cc
*************** dc96cd76d87b0bc2257a7f58b415fca2  libstd
*** 84787,84797 ****
  cf8c7cdb5f72b65ca8dfeb3052adf44c  libstdc++-v3/testsuite/20_util/duration/cons/2.cc
  88065ccb0e1e49269c9c93e8a4baf757  libstdc++-v3/testsuite/20_util/duration/cons/54025.cc
  815ca44bc4639b7e098a240dabebd258  libstdc++-v3/testsuite/20_util/duration/cons/constexpr.cc
  fb415292186ee4c1fdeed6a3b202ca26  libstdc++-v3/testsuite/20_util/duration/cons/dr974_neg.cc
  79325a58ebd07293f9e17ee7ce5a8fc8  libstdc++-v3/testsuite/20_util/duration/literals/61166.cc
  74982442dbc372859a037f7cb1cb0059  libstdc++-v3/testsuite/20_util/duration/literals/65499.cc
  a808c9968c77342c65010e2916cfcbe4  libstdc++-v3/testsuite/20_util/duration/literals/ns_detail.cc
! d634902df99ab3a2bc030f98fb769e05  libstdc++-v3/testsuite/20_util/duration/literals/range.cc
  f2aa59947bfe11e7fb4c6027fc6dc117  libstdc++-v3/testsuite/20_util/duration/literals/types.cc
  212960315cd235ece88530f9f7b16c54  libstdc++-v3/testsuite/20_util/duration/literals/values.cc
  d5704e843f1428b0deff038b9afd492e  libstdc++-v3/testsuite/20_util/duration/requirements/constexpr_functions.cc
--- 85145,85156 ----
  cf8c7cdb5f72b65ca8dfeb3052adf44c  libstdc++-v3/testsuite/20_util/duration/cons/2.cc
  88065ccb0e1e49269c9c93e8a4baf757  libstdc++-v3/testsuite/20_util/duration/cons/54025.cc
  815ca44bc4639b7e098a240dabebd258  libstdc++-v3/testsuite/20_util/duration/cons/constexpr.cc
+ 84b1c849d6cd3a82028f44614f1c5aed  libstdc++-v3/testsuite/20_util/duration/cons/dr1177.cc
  fb415292186ee4c1fdeed6a3b202ca26  libstdc++-v3/testsuite/20_util/duration/cons/dr974_neg.cc
  79325a58ebd07293f9e17ee7ce5a8fc8  libstdc++-v3/testsuite/20_util/duration/literals/61166.cc
  74982442dbc372859a037f7cb1cb0059  libstdc++-v3/testsuite/20_util/duration/literals/65499.cc
  a808c9968c77342c65010e2916cfcbe4  libstdc++-v3/testsuite/20_util/duration/literals/ns_detail.cc
! b33c4f8e399725b14d7202f6f466577c  libstdc++-v3/testsuite/20_util/duration/literals/range.cc
  f2aa59947bfe11e7fb4c6027fc6dc117  libstdc++-v3/testsuite/20_util/duration/literals/types.cc
  212960315cd235ece88530f9f7b16c54  libstdc++-v3/testsuite/20_util/duration/literals/values.cc
  d5704e843f1428b0deff038b9afd492e  libstdc++-v3/testsuite/20_util/duration/requirements/constexpr_functions.cc
*************** e5014382ec17c3faebe0336e98b11e11  libstd
*** 84838,84854 ****
  a1dbb251ff9c5f915028cff1d9456eb8  libstdc++-v3/testsuite/20_util/function/68995.cc
  7969f564fbd9cf5a436b98960dba1210  libstdc++-v3/testsuite/20_util/function/69222.cc
  de8640bf3cd09bf7dbc9caf451bf044a  libstdc++-v3/testsuite/20_util/function/7.cc
  0be60ec2bd4963ccdbbc2d342eac017c  libstdc++-v3/testsuite/20_util/function/8.cc
  2c29a7bc192d912ec34a144f7c98d46d  libstdc++-v3/testsuite/20_util/function/9.cc
! ac0d5b1ee1484e5d66378852a9675bc6  libstdc++-v3/testsuite/20_util/function/assign/move.cc
  6f5dc13d9e8e584b52f860ffed97c3ff  libstdc++-v3/testsuite/20_util/function/assign/move_target.cc
  dba4ecb898c87aaf457932e4bbf54868  libstdc++-v3/testsuite/20_util/function/cmp/cmp_neg.cc
  3c3ce967501b5056adc0b624957305fc  libstdc++-v3/testsuite/20_util/function/cons/55320.cc
! c61c5ba8830287abeae03f33df922c01  libstdc++-v3/testsuite/20_util/function/cons/57465.cc
  bc11a4cb910a31cf196d5b77ac8b0301  libstdc++-v3/testsuite/20_util/function/cons/addressof.cc
  447f97bdbdccb3cb191ee8383960dbdb  libstdc++-v3/testsuite/20_util/function/cons/callable.cc
! d20d3cc874912d1e705559bd60b6ea62  libstdc++-v3/testsuite/20_util/function/cons/move.cc
  3836c1cf3f54027d50269be43e983c4f  libstdc++-v3/testsuite/20_util/function/cons/move_target.cc
  aba63cc0a0fa69b175819bb519b549a7  libstdc++-v3/testsuite/20_util/function/invoke/forwarding.cc
  b446db653a17039da87c842c7725331a  libstdc++-v3/testsuite/20_util/function/invoke/move_only.cc
  0b143fa118ee8fd5f5acb02ff14a92f1  libstdc++-v3/testsuite/20_util/function/null_pointer_comparisons.cc
--- 85197,85216 ----
  a1dbb251ff9c5f915028cff1d9456eb8  libstdc++-v3/testsuite/20_util/function/68995.cc
  7969f564fbd9cf5a436b98960dba1210  libstdc++-v3/testsuite/20_util/function/69222.cc
  de8640bf3cd09bf7dbc9caf451bf044a  libstdc++-v3/testsuite/20_util/function/7.cc
+ 294f36176d900e2be3b3bf42301494f7  libstdc++-v3/testsuite/20_util/function/77322.cc
  0be60ec2bd4963ccdbbc2d342eac017c  libstdc++-v3/testsuite/20_util/function/8.cc
  2c29a7bc192d912ec34a144f7c98d46d  libstdc++-v3/testsuite/20_util/function/9.cc
! a5cac414296a3125468c0901c1807513  libstdc++-v3/testsuite/20_util/function/assign/move.cc
  6f5dc13d9e8e584b52f860ffed97c3ff  libstdc++-v3/testsuite/20_util/function/assign/move_target.cc
  dba4ecb898c87aaf457932e4bbf54868  libstdc++-v3/testsuite/20_util/function/cmp/cmp_neg.cc
  3c3ce967501b5056adc0b624957305fc  libstdc++-v3/testsuite/20_util/function/cons/55320.cc
! 90959971d6f1c8d1e7242df42f0b89b4  libstdc++-v3/testsuite/20_util/function/cons/57465.cc
! 1e369dfe927c8159f68b74615fd658bd  libstdc++-v3/testsuite/20_util/function/cons/72820.cc
  bc11a4cb910a31cf196d5b77ac8b0301  libstdc++-v3/testsuite/20_util/function/cons/addressof.cc
  447f97bdbdccb3cb191ee8383960dbdb  libstdc++-v3/testsuite/20_util/function/cons/callable.cc
! 5869ce89c75e604541b0b21bf81139df  libstdc++-v3/testsuite/20_util/function/cons/move.cc
  3836c1cf3f54027d50269be43e983c4f  libstdc++-v3/testsuite/20_util/function/cons/move_target.cc
+ 0854a43f0e035a0fd198df79037baac0  libstdc++-v3/testsuite/20_util/function/cons/refqual.cc
  aba63cc0a0fa69b175819bb519b549a7  libstdc++-v3/testsuite/20_util/function/invoke/forwarding.cc
  b446db653a17039da87c842c7725331a  libstdc++-v3/testsuite/20_util/function/invoke/move_only.cc
  0b143fa118ee8fd5f5acb02ff14a92f1  libstdc++-v3/testsuite/20_util/function/null_pointer_comparisons.cc
*************** f6f0c1f261df66cac881723ea8cc6319  libstd
*** 85117,85122 ****
--- 85479,85485 ----
  2bd60caaa9124de17811849126370f55  libstdc++-v3/testsuite/20_util/move_if_noexcept/constexpr.cc
  724784e929b1ee26ee26747d4779e5fd  libstdc++-v3/testsuite/20_util/move_if_noexcept/requirements/explicit_instantiation.cc
  99c21900c082a3378e4bc8d747c014f1  libstdc++-v3/testsuite/20_util/owner_less/cmp.cc
+ 27e275189f66554610c63cb1220f88f7  libstdc++-v3/testsuite/20_util/owner_less/noexcept.cc
  94068105982da501ab670b906df18566  libstdc++-v3/testsuite/20_util/pair/1.cc
  f6e057975d637bfe558d64f8d7a586cf  libstdc++-v3/testsuite/20_util/pair/2.cc
  6742c5799a9c2f4689a0779477612270  libstdc++-v3/testsuite/20_util/pair/3.cc
*************** d72e5626b91ae829e43c942cb10e4d14  libstd
*** 85168,85176 ****
  15258a6b95c62b7a3beaf6229d678701  libstdc++-v3/testsuite/20_util/raw_storage_iterator/requirements/typedefs.cc
  7420d56a682b50835b11c0ce98ba50aa  libstdc++-v3/testsuite/20_util/reference_wrapper/24803.cc
  822409e7b82ceebeed20801a4af53d91  libstdc++-v3/testsuite/20_util/reference_wrapper/41792.cc
! 8f411cc9e67f430775279ef2ce4b8c2e  libstdc++-v3/testsuite/20_util/reference_wrapper/invoke-2.cc
  f28ca1c055737c982d79792bafaf891d  libstdc++-v3/testsuite/20_util/reference_wrapper/invoke-3.cc
! 85e1d54542c98745fa4fb17e0c982982  libstdc++-v3/testsuite/20_util/reference_wrapper/invoke.cc
  ce661ea1f51a01fe73629a1426ce8a15  libstdc++-v3/testsuite/20_util/reference_wrapper/ref_neg.cc
  1405377fdb4c0df4774a7f12381ec9f9  libstdc++-v3/testsuite/20_util/reference_wrapper/requirements.cc
  a3e0377fe36a122b9363b88e4c3de3b6  libstdc++-v3/testsuite/20_util/reference_wrapper/result_type.cc
--- 85531,85540 ----
  15258a6b95c62b7a3beaf6229d678701  libstdc++-v3/testsuite/20_util/raw_storage_iterator/requirements/typedefs.cc
  7420d56a682b50835b11c0ce98ba50aa  libstdc++-v3/testsuite/20_util/reference_wrapper/24803.cc
  822409e7b82ceebeed20801a4af53d91  libstdc++-v3/testsuite/20_util/reference_wrapper/41792.cc
! c9d0498ecb019b25a60b08ab2d5fb63d  libstdc++-v3/testsuite/20_util/reference_wrapper/80504.cc
! e362c5da7f12a6a94214bba7c68a14c0  libstdc++-v3/testsuite/20_util/reference_wrapper/invoke-2.cc
  f28ca1c055737c982d79792bafaf891d  libstdc++-v3/testsuite/20_util/reference_wrapper/invoke-3.cc
! 7513bdfa262e7d971b34141c6e6afeaa  libstdc++-v3/testsuite/20_util/reference_wrapper/invoke.cc
  ce661ea1f51a01fe73629a1426ce8a15  libstdc++-v3/testsuite/20_util/reference_wrapper/ref_neg.cc
  1405377fdb4c0df4774a7f12381ec9f9  libstdc++-v3/testsuite/20_util/reference_wrapper/requirements.cc
  a3e0377fe36a122b9363b88e4c3de3b6  libstdc++-v3/testsuite/20_util/reference_wrapper/result_type.cc
*************** e3b0bf44f0e97fe987d8f524c6bf824f  libstd
*** 85206,85212 ****
--- 85570,85578 ----
  0c326f49ca8a4da379998b412701413b  libstdc++-v3/testsuite/20_util/result_of/sfinae_friendly_2.cc
  1da325a95d23243c9f7c6e43e0515a9f  libstdc++-v3/testsuite/20_util/scoped_allocator/1.cc
  e8c00dd83f8237b72426df0aff834a9c  libstdc++-v3/testsuite/20_util/scoped_allocator/2.cc
+ 22aae5019fa86565ffdf683618c3bd81  libstdc++-v3/testsuite/20_util/scoped_allocator/3.cc
  1d678612f50606f9c142612cbcb0cf54  libstdc++-v3/testsuite/20_util/scoped_allocator/65279.cc
+ 638da7195697e2e28e285655ca6a4f81  libstdc++-v3/testsuite/20_util/scoped_allocator/outermost.cc
  e65732f820cc3d53ebe94766a16a170d  libstdc++-v3/testsuite/20_util/scoped_allocator/propagation.cc
  ecfb31a75adbb19595c12b7581baa72f  libstdc++-v3/testsuite/20_util/scoped_allocator/requirements/explicit_instantiation.cc
  340a15367cf0f7564ab0d9ed2fac214f  libstdc++-v3/testsuite/20_util/scoped_allocator/requirements/typedefs.cc
*************** cf059eebc7561bb1dc8df57e77f0712d  libstd
*** 85282,85288 ****
  9ba56f78c53778a0653a07501b44ad5f  libstdc++-v3/testsuite/20_util/shared_ptr/modifiers/swap_neg.cc
  a9b3a667a5a976daae753a98c31e972a  libstdc++-v3/testsuite/20_util/shared_ptr/observers/bool_conv.cc
  44e74a69f4445114335f3868d752284d  libstdc++-v3/testsuite/20_util/shared_ptr/observers/get.cc
! 7919757b3f49c71d9f18b889b8a09c59  libstdc++-v3/testsuite/20_util/shared_ptr/observers/owner_before.cc
  7b234aab86faac33e45d2a72dab98d44  libstdc++-v3/testsuite/20_util/shared_ptr/observers/unique.cc
  06eaab77fabf76371d6a009723462aa6  libstdc++-v3/testsuite/20_util/shared_ptr/observers/use_count.cc
  8d774861947a921100631e3e2a07f007  libstdc++-v3/testsuite/20_util/shared_ptr/requirements/explicit_instantiation/1.cc
--- 85648,85654 ----
  9ba56f78c53778a0653a07501b44ad5f  libstdc++-v3/testsuite/20_util/shared_ptr/modifiers/swap_neg.cc
  a9b3a667a5a976daae753a98c31e972a  libstdc++-v3/testsuite/20_util/shared_ptr/observers/bool_conv.cc
  44e74a69f4445114335f3868d752284d  libstdc++-v3/testsuite/20_util/shared_ptr/observers/get.cc
! 892b6fc87fa7778844f9128183bca154  libstdc++-v3/testsuite/20_util/shared_ptr/observers/owner_before.cc
  7b234aab86faac33e45d2a72dab98d44  libstdc++-v3/testsuite/20_util/shared_ptr/observers/unique.cc
  06eaab77fabf76371d6a009723462aa6  libstdc++-v3/testsuite/20_util/shared_ptr/observers/use_count.cc
  8d774861947a921100631e3e2a07f007  libstdc++-v3/testsuite/20_util/shared_ptr/requirements/explicit_instantiation/1.cc
*************** f14a91abd29988411dab7196c5bfee24  libstd
*** 85308,85313 ****
--- 85674,85680 ----
  300b57aa791c77fa0d9e5ffbd85be838  libstdc++-v3/testsuite/20_util/time_point/2.cc
  7b5b48ba6e04e766d141febdf29429ab  libstdc++-v3/testsuite/20_util/time_point/3.cc
  7bb37f2db90f694ab08a7aac72bcb033  libstdc++-v3/testsuite/20_util/time_point/comparison_operators/constexpr.cc
+ 32f6081e3c15b3b718ccba0a2567abef  libstdc++-v3/testsuite/20_util/time_point/cons/81468.cc
  c4e64d8806bd7d53af286844a6ace5b6  libstdc++-v3/testsuite/20_util/time_point/cons/constexpr.cc
  8b1f4e073be862c2e26851e36f686849  libstdc++-v3/testsuite/20_util/time_point/nonmember/constexpr.cc
  5c0859e88ec36341c3da3a18a6a6eb7c  libstdc++-v3/testsuite/20_util/time_point/requirements/constexpr_functions.cc
*************** e8c5799ce8b7cf2953ed6ed63d183067  libstd
*** 85327,85332 ****
--- 85694,85700 ----
  b81efd1ff30c2342fa1e8b62744571b9  libstdc++-v3/testsuite/20_util/tuple/cons/44487.cc
  f5ce60cfe0f81c19a8578f21f31b3207  libstdc++-v3/testsuite/20_util/tuple/cons/45228.cc
  c0794cd42e6e0ba797fc7e3eb2095a9c  libstdc++-v3/testsuite/20_util/tuple/cons/48476.cc
+ d88be794268ced9e99dd4b7fee5d33aa  libstdc++-v3/testsuite/20_util/tuple/cons/allocator_with_any.cc
  7f2928ec41a8f08dc66bad562e22ab7e  libstdc++-v3/testsuite/20_util/tuple/cons/allocators.cc
  7ef488d72e472685dacf3edc90b14294  libstdc++-v3/testsuite/20_util/tuple/cons/assignment.cc
  cb54d8113b787e7989a9c1bc6b8c2a97  libstdc++-v3/testsuite/20_util/tuple/cons/big_tuples.cc
*************** c59176dfe7b413d23604134bb20140c0  libstd
*** 85371,85377 ****
  23eafe48135f30d3e58ae5a3fbf54056  libstdc++-v3/testsuite/20_util/underlying_type/requirements/typedefs-2.cc
  8f373c1f533cf4c63d27648e7b0720ac  libstdc++-v3/testsuite/20_util/unique_ptr/54351.cc
  57e8851834b0f93a02151e17ce1bac72  libstdc++-v3/testsuite/20_util/unique_ptr/assign/48635.cc
! 685156bc6c322359cd41cea24b74b137  libstdc++-v3/testsuite/20_util/unique_ptr/assign/48635_neg.cc
  d03ecf9501ad8f504986515793896202  libstdc++-v3/testsuite/20_util/unique_ptr/assign/assign_neg.cc
  c41cbceecc003b7bdd1eecb3951bbc66  libstdc++-v3/testsuite/20_util/unique_ptr/assign/cv_qual.cc
  093ab2a0f24d449fa98a0c5b9610304e  libstdc++-v3/testsuite/20_util/unique_ptr/assign/move.cc
--- 85739,85745 ----
  23eafe48135f30d3e58ae5a3fbf54056  libstdc++-v3/testsuite/20_util/underlying_type/requirements/typedefs-2.cc
  8f373c1f533cf4c63d27648e7b0720ac  libstdc++-v3/testsuite/20_util/unique_ptr/54351.cc
  57e8851834b0f93a02151e17ce1bac72  libstdc++-v3/testsuite/20_util/unique_ptr/assign/48635.cc
! bf29cb82cbae63e031c5ca668c66bf0f  libstdc++-v3/testsuite/20_util/unique_ptr/assign/48635_neg.cc
  d03ecf9501ad8f504986515793896202  libstdc++-v3/testsuite/20_util/unique_ptr/assign/assign_neg.cc
  c41cbceecc003b7bdd1eecb3951bbc66  libstdc++-v3/testsuite/20_util/unique_ptr/assign/cv_qual.cc
  093ab2a0f24d449fa98a0c5b9610304e  libstdc++-v3/testsuite/20_util/unique_ptr/assign/move.cc
*************** c41cbceecc003b7bdd1eecb3951bbc66  libstd
*** 85379,85384 ****
--- 85747,85753 ----
  6a37f036d09619c77af502fa3ebe079f  libstdc++-v3/testsuite/20_util/unique_ptr/assign/nullptr.cc
  507c39e7a4f13b01e487105d9bd966dd  libstdc++-v3/testsuite/20_util/unique_ptr/comparison/42925.cc
  5d8b8ca354f0516783d54f5a1d6aa492  libstdc++-v3/testsuite/20_util/unique_ptr/comparison/dr1401.cc
+ 47e0731eb8a184225a77c620f670c5e8  libstdc++-v3/testsuite/20_util/unique_ptr/cons/77990.cc
  82fcf174bb8d7fdc732b8c7dcd5fdb4d  libstdc++-v3/testsuite/20_util/unique_ptr/cons/array_convertible_neg.cc
  1692091b3b79d774d18d5901533f569f  libstdc++-v3/testsuite/20_util/unique_ptr/cons/auto_ptr.cc
  5e51cfcfb707e76826c289d9311cbde2  libstdc++-v3/testsuite/20_util/unique_ptr/cons/auto_ptr_neg.cc
*************** dc784433a9adff9f7ca23262950b45c5  libstd
*** 85415,85424 ****
  bd4ecde74f4c10f30480640935b7b220  libstdc++-v3/testsuite/20_util/weak_ptr/cons/constexpr.cc
  216768961542eebd80b54cf0574b1034  libstdc++-v3/testsuite/20_util/weak_ptr/cons/noexcept_move_construct.cc
  3a333d3cd9c06c6a3e609d8737e4e1e8  libstdc++-v3/testsuite/20_util/weak_ptr/lock/1.cc
! 24024304f8a426cfaeeb61cc9791dbfc  libstdc++-v3/testsuite/20_util/weak_ptr/observers/owner_before.cc
  1e2bd525b0386a12c24a75d2d6ad0dc9  libstdc++-v3/testsuite/20_util/weak_ptr/requirements/explicit_instantiation/1.cc
  da94c009fb1cc5e662affea01d948a14  libstdc++-v3/testsuite/20_util/weak_ptr/requirements/explicit_instantiation/2.cc
  88d3b1e9ad9a340f4731a73946aa665b  libstdc++-v3/testsuite/21_strings/basic_string/40160.cc
  3f081a159109ed37e9530a1c6a808c8f  libstdc++-v3/testsuite/21_strings/basic_string/capacity/1.cc
  3665452ce3caa95d05cd6dbf613b38b5  libstdc++-v3/testsuite/21_strings/basic_string/capacity/char/1.cc
  1da7e953837fb5cff8b085aa89fadb86  libstdc++-v3/testsuite/21_strings/basic_string/capacity/char/18654.cc
--- 85784,85807 ----
  bd4ecde74f4c10f30480640935b7b220  libstdc++-v3/testsuite/20_util/weak_ptr/cons/constexpr.cc
  216768961542eebd80b54cf0574b1034  libstdc++-v3/testsuite/20_util/weak_ptr/cons/noexcept_move_construct.cc
  3a333d3cd9c06c6a3e609d8737e4e1e8  libstdc++-v3/testsuite/20_util/weak_ptr/lock/1.cc
! 3bfcea3218f9b2522f93e0d6bd7d2736  libstdc++-v3/testsuite/20_util/weak_ptr/observers/owner_before.cc
  1e2bd525b0386a12c24a75d2d6ad0dc9  libstdc++-v3/testsuite/20_util/weak_ptr/requirements/explicit_instantiation/1.cc
  da94c009fb1cc5e662affea01d948a14  libstdc++-v3/testsuite/20_util/weak_ptr/requirements/explicit_instantiation/2.cc
  88d3b1e9ad9a340f4731a73946aa665b  libstdc++-v3/testsuite/21_strings/basic_string/40160.cc
+ 31199a94e0e1b36f7ded6c6f662be838  libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy.cc
+ 6ad42301e8fa32322a37d735e89980df  libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy_assign.cc
+ a789fc3f76c36af3d737f89e4feb7608  libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/minimal.cc
+ d49113fb6bb11b017845505163eef8a9  libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move.cc
+ 1f331207ba499c2b082e38d2744fa5e8  libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move_assign.cc
+ 2e52a80116081235a6f6cdbebd8c4c90  libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/noexcept.cc
+ 9ac41fce5412b284b15b8d46c694461a  libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/swap.cc
+ cd21c7792cb84971e67b11f1cf948796  libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy.cc
+ c157518162527dfdf9700c932d872a46  libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy_assign.cc
+ 184bf1189bdbe3187c73a4cbd9b65fb0  libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/minimal.cc
+ 4a474564327bf464ca0b8a03a64b25d7  libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move.cc
+ 5bbe221226ed7c32ceaf384de459ca77  libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move_assign.cc
+ 6ccbf082c03cac4ca551dacfd1970d92  libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/noexcept.cc
+ b31e52010e11ba984f5c1a6c0ed39bf5  libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/swap.cc
  3f081a159109ed37e9530a1c6a808c8f  libstdc++-v3/testsuite/21_strings/basic_string/capacity/1.cc
  3665452ce3caa95d05cd6dbf613b38b5  libstdc++-v3/testsuite/21_strings/basic_string/capacity/char/1.cc
  1da7e953837fb5cff8b085aa89fadb86  libstdc++-v3/testsuite/21_strings/basic_string/capacity/char/18654.cc
*************** a37738df7a1e40fbb0f30c4151b4b8b8  libstd
*** 85650,85662 ****
  1327edad6434db14d1c3097c65904f6c  libstdc++-v3/testsuite/22_locale/codecvt/always_noconv/wchar_t/4.cc
  170b643a635a82fcf754b94737b325fa  libstdc++-v3/testsuite/22_locale/codecvt/always_noconv/wchar_t/wrapped_env.cc
  10afdd17f39da271f8f5b430b4bdece2  libstdc++-v3/testsuite/22_locale/codecvt/always_noconv/wchar_t/wrapped_locale.cc
! 145cc9fe93531edef3341ec843ccf15b  libstdc++-v3/testsuite/22_locale/codecvt/char16_t.cc
  e62d38dc72809cf06244f6a69cb91300  libstdc++-v3/testsuite/22_locale/codecvt/char32_t.cc
  ec175be16bd209a6775d1c2cf82064eb  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/66417.cc
  c756049d8f0d54295ca5b1fa600e7c05  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/requirements/1.cc
  d1ed67ee033e3f14a4e84f4874b7f324  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/69703.cc
  8d5474596a8dc5d292dd87e6915f3f8d  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/requirements/1.cc
  692fd5a663e66c3e9bffc33af34d9d2a  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/66855.cc
  1d09547c50659fc30ac171af08067afa  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/requirements/1.cc
  4f2d1fd63e3c58e811577be09ac275f6  libstdc++-v3/testsuite/22_locale/codecvt/encoding/char/1.cc
  170b643a635a82fcf754b94737b325fa  libstdc++-v3/testsuite/22_locale/codecvt/encoding/char/wrapped_env.cc
--- 86033,86053 ----
  1327edad6434db14d1c3097c65904f6c  libstdc++-v3/testsuite/22_locale/codecvt/always_noconv/wchar_t/4.cc
  170b643a635a82fcf754b94737b325fa  libstdc++-v3/testsuite/22_locale/codecvt/always_noconv/wchar_t/wrapped_env.cc
  10afdd17f39da271f8f5b430b4bdece2  libstdc++-v3/testsuite/22_locale/codecvt/always_noconv/wchar_t/wrapped_locale.cc
! 97759351f1323700567d8141935b3854  libstdc++-v3/testsuite/22_locale/codecvt/char16_t.cc
  e62d38dc72809cf06244f6a69cb91300  libstdc++-v3/testsuite/22_locale/codecvt/char32_t.cc
  ec175be16bd209a6775d1c2cf82064eb  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/66417.cc
+ 7381a2a225a38f7d543b2644d317d814  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/79980.cc
+ ed30e4090d06632432240eaa969c69ec  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/80041.cc
+ b22427a7df8dec8cc70dadb95eb2c0f4  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/members.cc
+ 8438096d28972a2f757975cc1f38b9bf  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/misaligned.cc
  c756049d8f0d54295ca5b1fa600e7c05  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/requirements/1.cc
  d1ed67ee033e3f14a4e84f4874b7f324  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/69703.cc
+ efe5e5fabc0e3f37618ad00ad4747bc6  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/79980.cc
+ 11f5ce358412c9403cb074e4f53ad56a  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/members.cc
  8d5474596a8dc5d292dd87e6915f3f8d  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/requirements/1.cc
  692fd5a663e66c3e9bffc33af34d9d2a  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/66855.cc
+ d99bc82f0704f5511363849232f64e8d  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/79511.cc
+ d615ab2b8de234149c2ec6a4d64615c8  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/members.cc
  1d09547c50659fc30ac171af08067afa  libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/requirements/1.cc
  4f2d1fd63e3c58e811577be09ac275f6  libstdc++-v3/testsuite/22_locale/codecvt/encoding/char/1.cc
  170b643a635a82fcf754b94737b325fa  libstdc++-v3/testsuite/22_locale/codecvt/encoding/char/wrapped_env.cc
*************** bb4ad06beec013abba0c8365559a4275  libstd
*** 85770,85775 ****
--- 86161,86167 ----
  87f1476ad659a84d2c84517dd8be07ad  libstdc++-v3/testsuite/22_locale/collate_byname/requirements/explicit_instantiation.cc
  07ba4a82da008839491da717158fbc3b  libstdc++-v3/testsuite/22_locale/collate_byname/requirements/typedefs.cc
  3a89dd542edac0cf191021790854afe7  libstdc++-v3/testsuite/22_locale/conversions/buffer/1.cc
+ 8214d4a2e1204e771ded733605f13d49  libstdc++-v3/testsuite/22_locale/conversions/buffer/2.cc
  4b2e5ca9fa936d90c9e46c14faa9a9f8  libstdc++-v3/testsuite/22_locale/conversions/buffer/requirements/typedefs.cc
  3e00a010806da0adf3334b3e2a46032b  libstdc++-v3/testsuite/22_locale/conversions/string/1.cc
  c90d9242df426e02e05c617e3d14e405  libstdc++-v3/testsuite/22_locale/conversions/string/2.cc
*************** da3533ad05faa9cbb0e251489d85b422  libstd
*** 86583,86588 ****
--- 86975,86982 ----
  2d85bf3b8c7cc3002d2f43523effabcd  libstdc++-v3/testsuite/23_containers/list/operations/4.cc
  b6b24b67f1cd19209c12a9304aa33ac2  libstdc++-v3/testsuite/23_containers/list/operations/4.h
  d70fadf9c36e38ade2e4e73850191d71  libstdc++-v3/testsuite/23_containers/list/operations/42352.cc
+ 9a9c285a7e61c253f7e3be501b383cdf  libstdc++-v3/testsuite/23_containers/list/operations/78389.cc
+ 2e48ac629e274a125bbb34b2e932fd5b  libstdc++-v3/testsuite/23_containers/list/operations/80034.cc
  833167c03bd245f39a0c8199ae887b28  libstdc++-v3/testsuite/23_containers/list/operations/splice/const_iterator.cc
  fef8c09aecd0e8ede65b8f9d4c214e1d  libstdc++-v3/testsuite/23_containers/list/pthread1.cc
  da5dd41e27e41ce2a8e10e8700f96cf7  libstdc++-v3/testsuite/23_containers/list/pthread5.cc
*************** dd3ee3b50e2c19766ba83bbeb75d496f  libstd
*** 86612,86617 ****
--- 87006,87012 ----
  97457202f4f2d6067ff472e57794fe41  libstdc++-v3/testsuite/23_containers/map/56613.cc
  cbeae296fb20fc273a39cccfe47d45e9  libstdc++-v3/testsuite/23_containers/map/58764.cc
  41e2e000be03c3a10a259369305c8e5f  libstdc++-v3/testsuite/23_containers/map/59872.cc
+ d03325e67e465c815b7e50117cf88096  libstdc++-v3/testsuite/23_containers/map/77334.cc
  f8da8f21b83f04a5d98886cfcdc3f394  libstdc++-v3/testsuite/23_containers/map/allocator/copy.cc
  c77cb4ebb663897672e7a487286df286  libstdc++-v3/testsuite/23_containers/map/allocator/copy_assign.cc
  1918ae3f30dffb9938680b45ba0023e4  libstdc++-v3/testsuite/23_containers/map/allocator/init-list.cc
*************** fada72408ea1988aa57b33e155f7a9f3  libstd
*** 86622,86627 ****
--- 87017,87023 ----
  46892cc4a710c7f334aec4c2752e3ef7  libstdc++-v3/testsuite/23_containers/map/allocator/swap.cc
  74cf078351744d43e95f1d0fb49e9ac8  libstdc++-v3/testsuite/23_containers/map/capacity/29134.cc
  d5792bdbd3f18e1391dd6e8a010503e2  libstdc++-v3/testsuite/23_containers/map/cons/moveable.cc
+ 5945b2e8946d763cea3a66d76c4014af  libstdc++-v3/testsuite/23_containers/map/cons/noexcept_default_construct.cc
  9482c08dd302f7a63d53c51047bedfca  libstdc++-v3/testsuite/23_containers/map/cons/noexcept_move_construct.cc
  25787d3e99086023bb295863f851767a  libstdc++-v3/testsuite/23_containers/map/debug/60499.cc
  3b2dd3e2bad59ed7ba2b9acf36ad26f6  libstdc++-v3/testsuite/23_containers/map/debug/construct1_neg.cc
*************** ffef85b6a263a32e0975eaf9ef4f1025  libstd
*** 86660,86666 ****
  80150eaa96234d7f7468cf2311abcb6f  libstdc++-v3/testsuite/23_containers/map/modifiers/swap/2.cc
  6bd6e3a3edd3910d45043ef4c6ed83a1  libstdc++-v3/testsuite/23_containers/map/modifiers/swap/3.cc
  d5022eaf300bf670f1a3976d6b12b363  libstdc++-v3/testsuite/23_containers/map/operations/1.cc
! 03ec3efb44bd1895a848e16f6f901b61  libstdc++-v3/testsuite/23_containers/map/operations/2.cc
  f1fadf0f121bad275a73b4350702d85e  libstdc++-v3/testsuite/23_containers/map/operations/31440.cc
  8febd0417bdaf9883796c782b6ab6a7a  libstdc++-v3/testsuite/23_containers/map/operations/count.cc
  77e2b397dd2aac96c72b2c1f94d240d6  libstdc++-v3/testsuite/23_containers/map/operators/1.cc
--- 87056,87062 ----
  80150eaa96234d7f7468cf2311abcb6f  libstdc++-v3/testsuite/23_containers/map/modifiers/swap/2.cc
  6bd6e3a3edd3910d45043ef4c6ed83a1  libstdc++-v3/testsuite/23_containers/map/modifiers/swap/3.cc
  d5022eaf300bf670f1a3976d6b12b363  libstdc++-v3/testsuite/23_containers/map/operations/1.cc
! 27080cf24013f2ccfa63920cc937583c  libstdc++-v3/testsuite/23_containers/map/operations/2.cc
  f1fadf0f121bad275a73b4350702d85e  libstdc++-v3/testsuite/23_containers/map/operations/31440.cc
  8febd0417bdaf9883796c782b6ab6a7a  libstdc++-v3/testsuite/23_containers/map/operations/count.cc
  77e2b397dd2aac96c72b2c1f94d240d6  libstdc++-v3/testsuite/23_containers/map/operators/1.cc
*************** aa9cf1180d8961e6e7c7b5941ab7b2f4  libstd
*** 86694,86699 ****
--- 87090,87096 ----
  404d64772a8972ff5105258106574e62  libstdc++-v3/testsuite/23_containers/multimap/allocator/swap.cc
  984ec53e64ee9b012111021e8e11143b  libstdc++-v3/testsuite/23_containers/multimap/capacity/29134.cc
  4f755ed0240ece1c327ebe936b4631e6  libstdc++-v3/testsuite/23_containers/multimap/cons/moveable.cc
+ 6a5b594c983dbf55cb748ba043293dea  libstdc++-v3/testsuite/23_containers/multimap/cons/noexcept_default_construct.cc
  0a9a2f51b678ed3d73a44dac149c8a62  libstdc++-v3/testsuite/23_containers/multimap/cons/noexcept_move_construct.cc
  1fb80aff343dccdf6366cb1e7cf4fcbe  libstdc++-v3/testsuite/23_containers/multimap/debug/60499.cc
  3c7044f791d66c6ad3648c143c732b08  libstdc++-v3/testsuite/23_containers/multimap/debug/construct1_neg.cc
*************** bae9ae158ee7b80dd19bf298573fd17b  libstd
*** 86727,86733 ****
  3bea54ac5327d0f68d2aa557dde9c590  libstdc++-v3/testsuite/23_containers/multimap/modifiers/swap/2.cc
  bfdc56d2b68843bd59fd4760a6f0bed0  libstdc++-v3/testsuite/23_containers/multimap/modifiers/swap/3.cc
  9207c3cdb7c2eb9d0655748b22190d6c  libstdc++-v3/testsuite/23_containers/multimap/operations/1.cc
! a738a72bfb84413c6a96a572716ccad0  libstdc++-v3/testsuite/23_containers/multimap/operations/2.cc
  95298c3f8441ad5935f5274cda43be94  libstdc++-v3/testsuite/23_containers/multimap/operations/count.cc
  232ac9b212341b9bcf6a84f89c821347  libstdc++-v3/testsuite/23_containers/multimap/range_access.cc
  efa358c83b089a1476d627e9c1da82e4  libstdc++-v3/testsuite/23_containers/multimap/requirements/citerators.cc
--- 87124,87130 ----
  3bea54ac5327d0f68d2aa557dde9c590  libstdc++-v3/testsuite/23_containers/multimap/modifiers/swap/2.cc
  bfdc56d2b68843bd59fd4760a6f0bed0  libstdc++-v3/testsuite/23_containers/multimap/modifiers/swap/3.cc
  9207c3cdb7c2eb9d0655748b22190d6c  libstdc++-v3/testsuite/23_containers/multimap/operations/1.cc
! fa70bd1f227e3cb5c87bbfeba405debc  libstdc++-v3/testsuite/23_containers/multimap/operations/2.cc
  95298c3f8441ad5935f5274cda43be94  libstdc++-v3/testsuite/23_containers/multimap/operations/count.cc
  232ac9b212341b9bcf6a84f89c821347  libstdc++-v3/testsuite/23_containers/multimap/range_access.cc
  efa358c83b089a1476d627e9c1da82e4  libstdc++-v3/testsuite/23_containers/multimap/requirements/citerators.cc
*************** dc05e09ddbac2ecaa3c597ceabeb5895  libstd
*** 86756,86761 ****
--- 87153,87159 ----
  0db1de0a1f30335f82c6e8fa83584107  libstdc++-v3/testsuite/23_containers/multiset/allocator/swap.cc
  5033e22505bb8dac6f14efded78c3db8  libstdc++-v3/testsuite/23_containers/multiset/capacity/29134.cc
  4b67713d751330a549b9721eec2e21fa  libstdc++-v3/testsuite/23_containers/multiset/cons/moveable.cc
+ 2bc5f5dd7aa3ce79c4124a32e7db6328  libstdc++-v3/testsuite/23_containers/multiset/cons/noexcept_default_construct.cc
  3a6380199d3ef726975e89ba1bbf38b3  libstdc++-v3/testsuite/23_containers/multiset/cons/noexcept_move_construct.cc
  791dde856dc6cc4a83dbe4d841fbbd92  libstdc++-v3/testsuite/23_containers/multiset/debug/60499.cc
  764b0f413c90b840e4a1fed5618bf93f  libstdc++-v3/testsuite/23_containers/multiset/debug/construct1_neg.cc
*************** d2244035eca3f9ca9abeae95533adf51  libstd
*** 86788,86794 ****
  cfcb4265ae4feffc97aeba3a0e86a548  libstdc++-v3/testsuite/23_containers/multiset/modifiers/swap/2.cc
  58b9d37c230f20fcb60624e84c21ea68  libstdc++-v3/testsuite/23_containers/multiset/modifiers/swap/3.cc
  cdf2931657ac6f55e673ea3925c14a76  libstdc++-v3/testsuite/23_containers/multiset/operations/1.cc
! ec81c5b1b0c3544308f0da57288db5e2  libstdc++-v3/testsuite/23_containers/multiset/operations/2.cc
  3e52a65d80ece10f6dae023da082f19b  libstdc++-v3/testsuite/23_containers/multiset/operations/count.cc
  4aafd153fb412d1006016649ddcf4a01  libstdc++-v3/testsuite/23_containers/multiset/range_access.cc
  8403039f31e39cee66c7a42da65eb06c  libstdc++-v3/testsuite/23_containers/multiset/requirements/citerators.cc
--- 87186,87192 ----
  cfcb4265ae4feffc97aeba3a0e86a548  libstdc++-v3/testsuite/23_containers/multiset/modifiers/swap/2.cc
  58b9d37c230f20fcb60624e84c21ea68  libstdc++-v3/testsuite/23_containers/multiset/modifiers/swap/3.cc
  cdf2931657ac6f55e673ea3925c14a76  libstdc++-v3/testsuite/23_containers/multiset/operations/1.cc
! 4b357cf5a78a1929473691e6811c045e  libstdc++-v3/testsuite/23_containers/multiset/operations/2.cc
  3e52a65d80ece10f6dae023da082f19b  libstdc++-v3/testsuite/23_containers/multiset/operations/count.cc
  4aafd153fb412d1006016649ddcf4a01  libstdc++-v3/testsuite/23_containers/multiset/range_access.cc
  8403039f31e39cee66c7a42da65eb06c  libstdc++-v3/testsuite/23_containers/multiset/requirements/citerators.cc
*************** d947ee2c7259252df4c28869e7fcf35e  libstd
*** 86820,86825 ****
--- 87218,87224 ----
  054abaa0bf5b1f5bbc8d5d8a34f96ed1  libstdc++-v3/testsuite/23_containers/set/18604.cc
  5e77a53793c358c9aa2952d5f11e42bf  libstdc++-v3/testsuite/23_containers/set/23781_neg.cc
  c5001c88e56854144fe5d26a385ffd5c  libstdc++-v3/testsuite/23_containers/set/58764.cc
+ 6d4b3f9a23c4db12d15534bb670b76c6  libstdc++-v3/testsuite/23_containers/set/allocator/71964.cc
  46f9f551d9668b970d39ddfd95a9fce7  libstdc++-v3/testsuite/23_containers/set/allocator/copy.cc
  689cdba664d8ac0d53a5b7f8fcbaf517  libstdc++-v3/testsuite/23_containers/set/allocator/copy_assign.cc
  b9e53f65aab99dafeca512570d16798f  libstdc++-v3/testsuite/23_containers/set/allocator/init-list.cc
*************** a15d5a76b47f1e74c803a9ee35f45527  libstd
*** 86832,86837 ****
--- 87231,87237 ----
  1bd2bc0821657d0da1bba3be30d63515  libstdc++-v3/testsuite/23_containers/set/check_construct_destroy.cc
  69aa4c74ba5c8b0dce6b4355749914ed  libstdc++-v3/testsuite/23_containers/set/cons/61023.cc
  1ff85d921b584e15af7933295254e795  libstdc++-v3/testsuite/23_containers/set/cons/moveable.cc
+ 951116ecd4a8e4610c08ace6551760cc  libstdc++-v3/testsuite/23_containers/set/cons/noexcept_default_construct.cc
  6229dd81a1e69a5ffc84c844c6f421e3  libstdc++-v3/testsuite/23_containers/set/cons/noexcept_move_construct.cc
  3c1f9c64e92bd792fcf98450276c232b  libstdc++-v3/testsuite/23_containers/set/debug/60499.cc
  f6b5e076b17d737011002087ef09a2e5  libstdc++-v3/testsuite/23_containers/set/debug/construct1_neg.cc
*************** ccb86af5300532c1f547847cb4318c94  libstd
*** 86864,86870 ****
  5eaff68cbaa8cf4326389f0cd93cf6da  libstdc++-v3/testsuite/23_containers/set/modifiers/swap/2.cc
  e7af450234e1d6877013974f18cc37de  libstdc++-v3/testsuite/23_containers/set/modifiers/swap/3.cc
  3e5cfe0612234ca3155ab738718c8068  libstdc++-v3/testsuite/23_containers/set/operations/1.cc
! b1743085041da0a81e561979e6623b5a  libstdc++-v3/testsuite/23_containers/set/operations/2.cc
  a1b5cbfce2b2aada1c9eaee7ce136fe6  libstdc++-v3/testsuite/23_containers/set/operations/count.cc
  adb74dae8cba1949dbe4b993675f7d2d  libstdc++-v3/testsuite/23_containers/set/operators/1_neg.cc
  60ab4eb724fcfe42d95a375604d78724  libstdc++-v3/testsuite/23_containers/set/range_access.cc
--- 87264,87270 ----
  5eaff68cbaa8cf4326389f0cd93cf6da  libstdc++-v3/testsuite/23_containers/set/modifiers/swap/2.cc
  e7af450234e1d6877013974f18cc37de  libstdc++-v3/testsuite/23_containers/set/modifiers/swap/3.cc
  3e5cfe0612234ca3155ab738718c8068  libstdc++-v3/testsuite/23_containers/set/operations/1.cc
! 6a3024e0fd640a15a1d180bd29982ce8  libstdc++-v3/testsuite/23_containers/set/operations/2.cc
  a1b5cbfce2b2aada1c9eaee7ce136fe6  libstdc++-v3/testsuite/23_containers/set/operations/count.cc
  adb74dae8cba1949dbe4b993675f7d2d  libstdc++-v3/testsuite/23_containers/set/operators/1_neg.cc
  60ab4eb724fcfe42d95a375604d78724  libstdc++-v3/testsuite/23_containers/set/range_access.cc
*************** bdc73159b71b00eba56c356c955c9902  libstd
*** 86897,86902 ****
--- 87297,87303 ----
  31d7606af24b03cfc10a2118e7e683ae  libstdc++-v3/testsuite/23_containers/unordered_map/allocator/swap.cc
  e4f2fa04c7075a996109a515678f4d01  libstdc++-v3/testsuite/23_containers/unordered_map/cons/56112.cc
  90c0eccc40c13e676bb55467a6db0738  libstdc++-v3/testsuite/23_containers/unordered_map/cons/66055.cc
+ aed1acc4c55aaa31b9f0280e6f56ef87  libstdc++-v3/testsuite/23_containers/unordered_map/cons/81891.cc
  79a008ab71e1861809b6d3a89a6af722  libstdc++-v3/testsuite/23_containers/unordered_map/cons/moveable.cc
  8e714db9c678e4305348228670faac84  libstdc++-v3/testsuite/23_containers/unordered_map/debug/60499.cc
  c0bbe610547404a722ac3cfe753cee9e  libstdc++-v3/testsuite/23_containers/unordered_map/debug/begin1_neg.cc
*************** d5ec281d8cbcbcb8b730ec7114a39e0c  libstd
*** 87414,87419 ****
--- 87815,87821 ----
  e374ec574f6202c8aab179c92fda286d  libstdc++-v3/testsuite/24_iterators/reverse_iterator/11729.cc
  55c3cae069bb205250fa7bbcbacda2ed  libstdc++-v3/testsuite/24_iterators/reverse_iterator/2.cc
  1f1b4a7eae82b6b97c99ffc751ef4e61  libstdc++-v3/testsuite/24_iterators/reverse_iterator/3.cc
+ b6f78890d1eca7d0500a883de8c97174  libstdc++-v3/testsuite/24_iterators/reverse_iterator/71771.cc
  a2748c384b6246658f53a423c3031158  libstdc++-v3/testsuite/24_iterators/reverse_iterator/greedy_ops.cc
  0458ed6f18ad6c1351e0fb117d68eb5c  libstdc++-v3/testsuite/24_iterators/reverse_iterator/make.cc
  fb507b0195fd5cd52508f973da76bd85  libstdc++-v3/testsuite/24_iterators/reverse_iterator/requirements/base_classes.cc
*************** cc8db1b9fa01cea79688c9167b0c2571  libstd
*** 87780,87785 ****
--- 88182,88188 ----
  dc8ec0e222294a21977124cad281ef11  libstdc++-v3/testsuite/25_algorithms/rotate_copy/requirements/explicit_instantiation/2.cc
  703749064944408262e96e1709b8b553  libstdc++-v3/testsuite/25_algorithms/rotate_copy/requirements/explicit_instantiation/pod.cc
  7eb3fd900e7838d0c1637e6f90178914  libstdc++-v3/testsuite/25_algorithms/search/1.cc
+ f2d4ce909499bc068bd9c8890ad562db  libstdc++-v3/testsuite/25_algorithms/search/78346.cc
  c40e5512b816e510e8569a21eb00b7b4  libstdc++-v3/testsuite/25_algorithms/search/check_type.cc
  ffb029d1f136bef42d19f5a44db989bb  libstdc++-v3/testsuite/25_algorithms/search/requirements/explicit_instantiation/2.cc
  4a0bed563ef4b24fee0efd355c0fd58b  libstdc++-v3/testsuite/25_algorithms/search/requirements/explicit_instantiation/pod.cc
*************** bcb9e8614688d1a7f2f6ba79a41f2e0a  libstd
*** 87814,87819 ****
--- 88217,88223 ----
  db30dfe2a28f8e37fc535326651b48dd  libstdc++-v3/testsuite/25_algorithms/sort/34095.cc
  acca35dce26c4102654fe6789f1c5542  libstdc++-v3/testsuite/25_algorithms/sort/34636.cc
  0c1ce8c0746a163f9d9712afcec0393f  libstdc++-v3/testsuite/25_algorithms/sort/35588.cc
+ e0cd9f4576bd9974f038d2d0ec8d973e  libstdc++-v3/testsuite/25_algorithms/sort/78991.cc
  be9c40eda7f74bcab27558f9dc2738e7  libstdc++-v3/testsuite/25_algorithms/sort/check_compare_by_value.cc
  f732e61da8b669128bc8150bc237f59a  libstdc++-v3/testsuite/25_algorithms/sort/moveable.cc
  aff044d9af933e8598e5e92c97948d11  libstdc++-v3/testsuite/25_algorithms/sort/random_test.cc
*************** dba26320d842c6da39aa46f7f44a1705  libstd
*** 87986,87992 ****
  52992f14571e53324d111adeca09c957  libstdc++-v3/testsuite/26_numerics/random/chi_squared_distribution/operators/serialize.cc
  ba2a6ddd725a3d2de84712967406d1af  libstdc++-v3/testsuite/26_numerics/random/chi_squared_distribution/requirements/explicit_instantiation/1.cc
  e232ced63e9fd96450978108cc021fcd  libstdc++-v3/testsuite/26_numerics/random/chi_squared_distribution/requirements/typedefs.cc
! 7d1c6fd54012b2bec8840e2781192617  libstdc++-v3/testsuite/26_numerics/random/default_random_engine.cc
  8a83f4814376a2e22da2c3b425052a58  libstdc++-v3/testsuite/26_numerics/random/discard_block_engine/cons/55215.cc
  54d14358901a484f080135505cf19aec  libstdc++-v3/testsuite/26_numerics/random/discard_block_engine/cons/base_copy.cc
  ad5233b9a09bdd013398742ae9927b47  libstdc++-v3/testsuite/26_numerics/random/discard_block_engine/cons/base_move.cc
--- 88390,88396 ----
  52992f14571e53324d111adeca09c957  libstdc++-v3/testsuite/26_numerics/random/chi_squared_distribution/operators/serialize.cc
  ba2a6ddd725a3d2de84712967406d1af  libstdc++-v3/testsuite/26_numerics/random/chi_squared_distribution/requirements/explicit_instantiation/1.cc
  e232ced63e9fd96450978108cc021fcd  libstdc++-v3/testsuite/26_numerics/random/chi_squared_distribution/requirements/typedefs.cc
! 3d2e0a9ab8f5ac5e7051a0f19cb98fe9  libstdc++-v3/testsuite/26_numerics/random/default_random_engine.cc
  8a83f4814376a2e22da2c3b425052a58  libstdc++-v3/testsuite/26_numerics/random/discard_block_engine/cons/55215.cc
  54d14358901a484f080135505cf19aec  libstdc++-v3/testsuite/26_numerics/random/discard_block_engine/cons/base_copy.cc
  ad5233b9a09bdd013398742ae9927b47  libstdc++-v3/testsuite/26_numerics/random/discard_block_engine/cons/base_move.cc
*************** ff6ecee2b5823fa0f3a30fb700455c16  libstd
*** 88458,88463 ****
--- 88862,88868 ----
  b258cb69861951a84693d5548313ea07  libstdc++-v3/testsuite/27_io/basic_filebuf/underflow/wchar_t/5.cc
  cb01bcfb973b79d84f727f17f32fc994  libstdc++-v3/testsuite/27_io/basic_filebuf/underflow/wchar_t/9178.cc
  03b2c93f55a06ea5dfc024504d10aa2b  libstdc++-v3/testsuite/27_io/basic_filebuf/underflow/wchar_t/9520.cc
+ 9e38cd88be90e8ec763de87e3b49dd0c  libstdc++-v3/testsuite/27_io/basic_fstream/53984.cc
  93f45ed9e6f89815717fb868cad24a4d  libstdc++-v3/testsuite/27_io/basic_fstream/assign/1.cc
  a15a3c067481da04ff91b6fb69589403  libstdc++-v3/testsuite/27_io/basic_fstream/cons/1.cc
  13781c0ed6aec6cbf0c1ce3ef6d6ebf5  libstdc++-v3/testsuite/27_io/basic_fstream/cons/base.cc
*************** ba5cac552123a703ea36b6c7fd0dc4ab  libstd
*** 88643,88648 ****
--- 89048,89054 ----
  bb5b009d091ecae53f62b4e5246efead  libstdc++-v3/testsuite/27_io/basic_istream/sentry/char/12297.cc
  5f9fda9c8d5eb62980379e93a9e9dbe0  libstdc++-v3/testsuite/27_io/basic_istream/sentry/char/2.cc
  ec8ad8aae9bc9868a95b6fbbdb89aa55  libstdc++-v3/testsuite/27_io/basic_istream/sentry/char/3.cc
+ f2fcdbb63f9588d1f62cd3c82414f648  libstdc++-v3/testsuite/27_io/basic_istream/sentry/char/53984.cc
  cfc8a582163a5560f43e03e06aa1304d  libstdc++-v3/testsuite/27_io/basic_istream/sentry/pod/1.cc
  148268cfcfc25a99453bd2434dec31ef  libstdc++-v3/testsuite/27_io/basic_istream/sentry/wchar_t/1.cc
  f95920d57ca438b16f4ff7c2bc92f4d3  libstdc++-v3/testsuite/27_io/basic_istream/sentry/wchar_t/12297.cc
*************** f4d5955183b9200315720423b3d234b1  libstd
*** 88952,88957 ****
--- 89358,89364 ----
  c010c91128ba41c72b8c9a3935f690db  libstdc++-v3/testsuite/27_io/basic_stringbuf/sync/char/1057.cc
  15a32baf6c22341a4c34be974e747dbb  libstdc++-v3/testsuite/27_io/basic_stringbuf/sync/wchar_t/1057.cc
  6a365e6ace7610c7ba15d48ca8d4612c  libstdc++-v3/testsuite/27_io/basic_stringstream/assign/1.cc
+ b855e51bbcdfca55f7d3a14d0480bbc8  libstdc++-v3/testsuite/27_io/basic_stringstream/assign/81338.cc
  c297f463e41f7a3b04bfff320c7f770f  libstdc++-v3/testsuite/27_io/basic_stringstream/cons/2020.cc
  859e191cc5ddd83389974359c003e571  libstdc++-v3/testsuite/27_io/basic_stringstream/cons/move.cc
  2d7c4502e8e2e87bc9f20ea7f251992d  libstdc++-v3/testsuite/27_io/basic_stringstream/rdbuf/char/2832.cc
*************** d33366abd7d543c13f57516baa9b760f  libstd
*** 89213,89218 ****
--- 89620,89626 ----
  0aa2d8aac329ed3579ce5e5eddb672d9  libstdc++-v3/testsuite/28_regex/basic_regex/ctors/47724.cc
  93d1d1352352539c1ef345c83087e171  libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/cstring.cc
  6dde2381b97d763ca68376145a4d98ba  libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/default.cc
+ b461c46bfcc00f2be87ba870ccc166c5  libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/iter.cc
  1cb38629c4065a208fe07ed1ca08a238  libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/pstring_char.cc
  d480714a718001828ca9f36e9562e4c5  libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/pstring_wchar_t.cc
  f9eb1e495e38f8cbca2c0a6031ccaaa8  libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/raw_string.cc
*************** aae191c4d46650faf1250761b99afc72  libstd
*** 89268,89274 ****
  e0d4d0e50e11aa0a408d14bf1f45ff3f  libstdc++-v3/testsuite/28_regex/range_access.cc
  5d80d4a561189026dd4f7543b4f9ba18  libstdc++-v3/testsuite/28_regex/regex_error/base.cc
  978607a8f7e6e3f9bd517ec5e818bb02  libstdc++-v3/testsuite/28_regex/regex_error/regex_error.cc
! 1680e2b89386743a43720ad4c459ee3c  libstdc++-v3/testsuite/28_regex/regression.cc
  9dd71ab1944ac2a62b5eabf65ccd0f70  libstdc++-v3/testsuite/28_regex/requirements/typedefs.cc
  93f040c85b8b8289ef2ff59664ef072f  libstdc++-v3/testsuite/28_regex/sub_match/cast_char.cc
  7af9bccb781396989e3c630cd72546ac  libstdc++-v3/testsuite/28_regex/sub_match/cast_wchar_t.cc
--- 89676,89682 ----
  e0d4d0e50e11aa0a408d14bf1f45ff3f  libstdc++-v3/testsuite/28_regex/range_access.cc
  5d80d4a561189026dd4f7543b4f9ba18  libstdc++-v3/testsuite/28_regex/regex_error/base.cc
  978607a8f7e6e3f9bd517ec5e818bb02  libstdc++-v3/testsuite/28_regex/regex_error/regex_error.cc
! 6eb20a7897025e9fab4cd03936f348cb  libstdc++-v3/testsuite/28_regex/regression.cc
  9dd71ab1944ac2a62b5eabf65ccd0f70  libstdc++-v3/testsuite/28_regex/requirements/typedefs.cc
  93f040c85b8b8289ef2ff59664ef072f  libstdc++-v3/testsuite/28_regex/sub_match/cast_char.cc
  7af9bccb781396989e3c630cd72546ac  libstdc++-v3/testsuite/28_regex/sub_match/cast_wchar_t.cc
*************** f0b51453938dcbe484cce812ae75956b  libstd
*** 89303,89308 ****
--- 89711,89717 ----
  c06ea9763ce042e1aaa31591690c1dc0  libstdc++-v3/testsuite/29_atomics/atomic/64658.cc
  117ab70171f95ad2f7de16e7a0481eca  libstdc++-v3/testsuite/29_atomics/atomic/65147.cc
  bd42c192efa45b0fb834bf10cc1df250  libstdc++-v3/testsuite/29_atomics/atomic/65913.cc
+ 190039037ff5c550e3f2e5338fb45918  libstdc++-v3/testsuite/29_atomics/atomic/69301.cc
  f9a58d10e6c02aa4673d2c70fb0e4552  libstdc++-v3/testsuite/29_atomics/atomic/cons/49445.cc
  5bf285201b66a8f58c1d8b5a9b55d441  libstdc++-v3/testsuite/29_atomics/atomic/cons/assign_neg.cc
  66ad2a1b538a75abc696225c8fa32364  libstdc++-v3/testsuite/29_atomics/atomic/cons/constexpr.cc
*************** cd29e141b4fb0807cbbc5f0c0a65efa9  libstd
*** 89352,89358 ****
  60da78d39f970ac39440553b4e83dc1e  libstdc++-v3/testsuite/29_atomics/atomic_integral/requirements/standard_layout.cc
  bdd177f6e7fbf766660017d57d432104  libstdc++-v3/testsuite/29_atomics/atomic_integral/requirements/trivial.cc
  15a5cdbe78319dca42d3a96aceca39b7  libstdc++-v3/testsuite/29_atomics/headers/atomic/functions_std_c++0x.cc
! 6946128ce857feb7ee0c9a17d90ae5c2  libstdc++-v3/testsuite/29_atomics/headers/atomic/macros.cc
  79a8bc8e71b30e5218be79a201bf03cd  libstdc++-v3/testsuite/29_atomics/headers/atomic/std_c++0x_neg.cc
  34ea08eae3ad7c12028de900c5048eec  libstdc++-v3/testsuite/29_atomics/headers/atomic/types_std_c++0x.cc
  a92ab5304a7c24dd50f7fa236043a371  libstdc++-v3/testsuite/29_atomics/headers/atomic/types_std_c++0x_neg.cc
--- 89761,89767 ----
  60da78d39f970ac39440553b4e83dc1e  libstdc++-v3/testsuite/29_atomics/atomic_integral/requirements/standard_layout.cc
  bdd177f6e7fbf766660017d57d432104  libstdc++-v3/testsuite/29_atomics/atomic_integral/requirements/trivial.cc
  15a5cdbe78319dca42d3a96aceca39b7  libstdc++-v3/testsuite/29_atomics/headers/atomic/functions_std_c++0x.cc
! 4c541b30cbca6deef3d1fa7089ef5cc0  libstdc++-v3/testsuite/29_atomics/headers/atomic/macros.cc
  79a8bc8e71b30e5218be79a201bf03cd  libstdc++-v3/testsuite/29_atomics/headers/atomic/std_c++0x_neg.cc
  34ea08eae3ad7c12028de900c5048eec  libstdc++-v3/testsuite/29_atomics/headers/atomic/types_std_c++0x.cc
  a92ab5304a7c24dd50f7fa236043a371  libstdc++-v3/testsuite/29_atomics/headers/atomic/types_std_c++0x_neg.cc
*************** f5e421d01e425bfad1b908694b39eaba  libstd
*** 89563,89568 ****
--- 89972,89978 ----
  4b2ff3b155bd036f7938fa14687bf23f  libstdc++-v3/testsuite/30_threads/thread/cons/9.cc
  f95886b30fadd4ee70618412e850b0f9  libstdc++-v3/testsuite/30_threads/thread/cons/assign_neg.cc
  ef5f60de59de61c060fedc1afcd6b05c  libstdc++-v3/testsuite/30_threads/thread/cons/copy_neg.cc
+ 0788bc632bfa5945c37e8757d5312f1f  libstdc++-v3/testsuite/30_threads/thread/cons/lwg2097.cc
  042c7a0d34b1383620f2d5dd2f1a851d  libstdc++-v3/testsuite/30_threads/thread/cons/moveable.cc
  1bc6e00d27ea2ddd052fb0dd04637585  libstdc++-v3/testsuite/30_threads/thread/id/hash.cc
  a52c26db246d2bd588d1a1241901821b  libstdc++-v3/testsuite/30_threads/thread/id/operators.cc
*************** c37598c0fde33f623562b0e5cfd29b7e  libstd
*** 89611,89618 ****
  8d151722b6124bf752b383069b2dbe19  libstdc++-v3/testsuite/30_threads/unique_lock/modifiers/1.cc
  1f2bf346e538550b929431b3dc96d64f  libstdc++-v3/testsuite/30_threads/unique_lock/requirements/explicit_instantiation.cc
  1c6f3e1d45b7cc09ee4d838fe9269880  libstdc++-v3/testsuite/30_threads/unique_lock/requirements/typedefs.cc
! 44f1c3a8855cf03c04532dad52cd7d48  libstdc++-v3/testsuite/Makefile.am
! 6be5c042f456cf571f7457b8be9cfc85  libstdc++-v3/testsuite/Makefile.in
  3e4c47978b4ccb19b07513ffe8cc3aa7  libstdc++-v3/testsuite/abi/30586.cc
  1b168bed366ef5333aff0c11f5f68a7d  libstdc++-v3/testsuite/abi/cxx_runtime_only_linkage.cc
  7af82426bb5f8f19d1715453647bc3f1  libstdc++-v3/testsuite/abi/demangle/abi_examples/01.cc
--- 90021,90028 ----
  8d151722b6124bf752b383069b2dbe19  libstdc++-v3/testsuite/30_threads/unique_lock/modifiers/1.cc
  1f2bf346e538550b929431b3dc96d64f  libstdc++-v3/testsuite/30_threads/unique_lock/requirements/explicit_instantiation.cc
  1c6f3e1d45b7cc09ee4d838fe9269880  libstdc++-v3/testsuite/30_threads/unique_lock/requirements/typedefs.cc
! d6f3a19364db6361c15e0543bb4f5731  libstdc++-v3/testsuite/Makefile.am
! 8353731b44ae0036162ac74b1a2f9d11  libstdc++-v3/testsuite/Makefile.in
  3e4c47978b4ccb19b07513ffe8cc3aa7  libstdc++-v3/testsuite/abi/30586.cc
  1b168bed366ef5333aff0c11f5f68a7d  libstdc++-v3/testsuite/abi/cxx_runtime_only_linkage.cc
  7af82426bb5f8f19d1715453647bc3f1  libstdc++-v3/testsuite/abi/demangle/abi_examples/01.cc
*************** b00422bb58c0a1a3cba6f717a879a92c  libstd
*** 89689,89695 ****
  6c5d956b6b0bf00554b7c09aad40df7a  libstdc++-v3/testsuite/abi/demangle/regression/cw-15.cc
  3b7603cb8080c507fa85cdd4ebc26e2a  libstdc++-v3/testsuite/abi/demangle/regression/cw-16.cc
  1b1fa2da7ff2f18cfa9131032e97f0c2  libstdc++-v3/testsuite/abi/demangle/regression/old.cc
! 79488c4a0436fce07cfeed2205ab1938  libstdc++-v3/testsuite/abi/header_cxxabi.c
  eb211087d450aa52e8e371d3b6e43f0b  libstdc++-v3/testsuite/abi/pr42230.cc
  a1f8d9a05bd1a4b4ec035cc3562a4908  libstdc++-v3/testsuite/backward/11460.cc
  c2bec8f413c05c7b98eea1b8e9fff3ac  libstdc++-v3/testsuite/backward/hash_map/1.cc
--- 90099,90105 ----
  6c5d956b6b0bf00554b7c09aad40df7a  libstdc++-v3/testsuite/abi/demangle/regression/cw-15.cc
  3b7603cb8080c507fa85cdd4ebc26e2a  libstdc++-v3/testsuite/abi/demangle/regression/cw-16.cc
  1b1fa2da7ff2f18cfa9131032e97f0c2  libstdc++-v3/testsuite/abi/demangle/regression/old.cc
! 9381d035e2e050b11d44791ee86eeec5  libstdc++-v3/testsuite/abi/header_cxxabi.c
  eb211087d450aa52e8e371d3b6e43f0b  libstdc++-v3/testsuite/abi/pr42230.cc
  a1f8d9a05bd1a4b4ec035cc3562a4908  libstdc++-v3/testsuite/backward/11460.cc
  c2bec8f413c05c7b98eea1b8e9fff3ac  libstdc++-v3/testsuite/backward/hash_map/1.cc
*************** e4458818bdbc82771622d38f5079d968  libstd
*** 89777,89812 ****
  8912bbe40cc8eeda84e82f96e7df2dba  libstdc++-v3/testsuite/decimal/pr54036-3.cc
  b85e6634a14ee3ab49f092176cc51474  libstdc++-v3/testsuite/decimal/pr58815.cc
  d51f3e21ad6431dee5fe09d61cd212dd  libstdc++-v3/testsuite/decimal/unary-arith.cc
! 4940e0c38043752581e5c500c729a1a8  libstdc++-v3/testsuite/experimental/algorithm/sample.cc
  17afc05de841cd6cc88d3a8b739edc24  libstdc++-v3/testsuite/experimental/algorithm/search.cc
  5df144e01ffde22cb733c3562985229b  libstdc++-v3/testsuite/experimental/any/assign/1.cc
  77cdfabc2f351a6d637360a3446e3548  libstdc++-v3/testsuite/experimental/any/assign/2.cc
  9c4ab5fe5fb779271b94521b7b08dd2e  libstdc++-v3/testsuite/experimental/any/cons/1.cc
  0820d3ae16e4cb70c1cd197407728b77  libstdc++-v3/testsuite/experimental/any/cons/2.cc
  8852019ca7dfc3369a7fd09a6e6fdce7  libstdc++-v3/testsuite/experimental/any/cons/nontrivial.cc
! 842f1c56734d5e57cf7c367a51f4ba59  libstdc++-v3/testsuite/experimental/any/misc/any_cast.cc
! be02f48a16c7f5c4cdc2266c1307a3cd  libstdc++-v3/testsuite/experimental/any/misc/any_cast_neg.cc
  7b26a150cf689dd93126d743a4b5f57c  libstdc++-v3/testsuite/experimental/any/misc/any_cast_no_rtti.cc
  067ad8908443dca2d12c72be6f01a740  libstdc++-v3/testsuite/experimental/any/misc/swap.cc
  d9797aab1694a752ea961bebaa7a3291  libstdc++-v3/testsuite/experimental/any/modifiers/1.cc
  28bd2579e624d40cb7bb498717fb6564  libstdc++-v3/testsuite/experimental/any/observers/type.cc
! 79a776b15a0d127cb100daaf1574f8c1  libstdc++-v3/testsuite/experimental/any/typedefs.cc
! c71bae36e1ebc210a1e5e65e89ef3ff0  libstdc++-v3/testsuite/experimental/chrono/value.cc
  1c10a535f04c73dcb2dcf34a55e5f892  libstdc++-v3/testsuite/experimental/feat-cxx14.cc
  f1868e7d6427fc60964c1a38200d329f  libstdc++-v3/testsuite/experimental/feat-lib-fund.cc
! d9353455947c267aa24aab212095ae25  libstdc++-v3/testsuite/experimental/filesystem/iterators/directory_iterator.cc
! b64eb4551994515d2c844a9915a2b9fe  libstdc++-v3/testsuite/experimental/filesystem/iterators/recursive_directory_iterator.cc
  d59b619f20b86a251bd98a8404c36137  libstdc++-v3/testsuite/experimental/filesystem/operations/absolute.cc
  d158e1c53c170373d65dac0b0159492c  libstdc++-v3/testsuite/experimental/filesystem/operations/canonical.cc
! 73ebaba0b0e8c6af32b38c4a0c8a3e84  libstdc++-v3/testsuite/experimental/filesystem/operations/copy.cc
! 43478894c9ffeeff98b3c58779cdd278  libstdc++-v3/testsuite/experimental/filesystem/operations/copy_file.cc
! 181be60277b05df4db65bb821d5d8c44  libstdc++-v3/testsuite/experimental/filesystem/operations/create_directories.cc
  25adc7117e80c1cd1e18b1cde11f4c1e  libstdc++-v3/testsuite/experimental/filesystem/operations/create_directory.cc
  22e6de2575753436b6ed7bba2f56bcfb  libstdc++-v3/testsuite/experimental/filesystem/operations/current_path.cc
! 0c6d28111000f05d45e32004d93e1114  libstdc++-v3/testsuite/experimental/filesystem/operations/exists.cc
  5ee3804131357eb8335dee2619f859a8  libstdc++-v3/testsuite/experimental/filesystem/operations/file_size.cc
  ea39d7f9ddaa40bc9ea79628c951305c  libstdc++-v3/testsuite/experimental/filesystem/operations/status.cc
! 17996fdcec9639240c01a8a12bc79b33  libstdc++-v3/testsuite/experimental/filesystem/operations/temp_directory_path.cc
  c651b9cbfefcd55b4abb1d09e1477a97  libstdc++-v3/testsuite/experimental/filesystem/path/append/path.cc
  a8681c8a5546586c8aae970e89114690  libstdc++-v3/testsuite/experimental/filesystem/path/assign/assign.cc
  51dc391cb41f43de6d9ba6d718926e5a  libstdc++-v3/testsuite/experimental/filesystem/path/assign/copy.cc
--- 90187,90230 ----
  8912bbe40cc8eeda84e82f96e7df2dba  libstdc++-v3/testsuite/decimal/pr54036-3.cc
  b85e6634a14ee3ab49f092176cc51474  libstdc++-v3/testsuite/decimal/pr58815.cc
  d51f3e21ad6431dee5fe09d61cd212dd  libstdc++-v3/testsuite/decimal/unary-arith.cc
! b1bf34141186dfc05c57ba442ab6234d  libstdc++-v3/testsuite/experimental/algorithm/sample.cc
  17afc05de841cd6cc88d3a8b739edc24  libstdc++-v3/testsuite/experimental/algorithm/search.cc
  5df144e01ffde22cb733c3562985229b  libstdc++-v3/testsuite/experimental/any/assign/1.cc
  77cdfabc2f351a6d637360a3446e3548  libstdc++-v3/testsuite/experimental/any/assign/2.cc
  9c4ab5fe5fb779271b94521b7b08dd2e  libstdc++-v3/testsuite/experimental/any/cons/1.cc
  0820d3ae16e4cb70c1cd197407728b77  libstdc++-v3/testsuite/experimental/any/cons/2.cc
  8852019ca7dfc3369a7fd09a6e6fdce7  libstdc++-v3/testsuite/experimental/any/cons/nontrivial.cc
! d69b2f8108788c5ecdf8280946db2e1a  libstdc++-v3/testsuite/experimental/any/misc/any_cast.cc
! 3c9fbd9769548fb4b7f6de0e000503c9  libstdc++-v3/testsuite/experimental/any/misc/any_cast_neg.cc
  7b26a150cf689dd93126d743a4b5f57c  libstdc++-v3/testsuite/experimental/any/misc/any_cast_no_rtti.cc
  067ad8908443dca2d12c72be6f01a740  libstdc++-v3/testsuite/experimental/any/misc/swap.cc
  d9797aab1694a752ea961bebaa7a3291  libstdc++-v3/testsuite/experimental/any/modifiers/1.cc
  28bd2579e624d40cb7bb498717fb6564  libstdc++-v3/testsuite/experimental/any/observers/type.cc
! 178eb38c2d2bfb801b8ce4eeb241591a  libstdc++-v3/testsuite/experimental/any/typedefs.cc
! 0c3298322884370f0ccbf8f3c5fbac47  libstdc++-v3/testsuite/experimental/chrono/value.cc
  1c10a535f04c73dcb2dcf34a55e5f892  libstdc++-v3/testsuite/experimental/feat-cxx14.cc
  f1868e7d6427fc60964c1a38200d329f  libstdc++-v3/testsuite/experimental/feat-lib-fund.cc
! 5152f201fe4ed0fc602a47b865354bfd  libstdc++-v3/testsuite/experimental/filesystem/iterators/directory_iterator.cc
! 39dc30b4d0fa5d55ae6cf22181cee0db  libstdc++-v3/testsuite/experimental/filesystem/iterators/pop.cc
! 342294726d744aaeceb0b92dfbf9659a  libstdc++-v3/testsuite/experimental/filesystem/iterators/recursive_directory_iterator.cc
  d59b619f20b86a251bd98a8404c36137  libstdc++-v3/testsuite/experimental/filesystem/operations/absolute.cc
  d158e1c53c170373d65dac0b0159492c  libstdc++-v3/testsuite/experimental/filesystem/operations/canonical.cc
! c9c178490e0d377913e40d5f0fd41700  libstdc++-v3/testsuite/experimental/filesystem/operations/copy.cc
! 2bd6d91dacdd9dbcc53871916c94e881  libstdc++-v3/testsuite/experimental/filesystem/operations/copy_file.cc
! 232fed06860682a7eebd439eb290af63  libstdc++-v3/testsuite/experimental/filesystem/operations/create_directories.cc
  25adc7117e80c1cd1e18b1cde11f4c1e  libstdc++-v3/testsuite/experimental/filesystem/operations/create_directory.cc
+ 38ba8795fabeabcbc98284230a756c29  libstdc++-v3/testsuite/experimental/filesystem/operations/create_symlink.cc
  22e6de2575753436b6ed7bba2f56bcfb  libstdc++-v3/testsuite/experimental/filesystem/operations/current_path.cc
! dbdb00c67d5dc6772d150b87c7a3da0a  libstdc++-v3/testsuite/experimental/filesystem/operations/equivalent.cc
! 4b6de16de9670886293d825baa91e102  libstdc++-v3/testsuite/experimental/filesystem/operations/exists.cc
  5ee3804131357eb8335dee2619f859a8  libstdc++-v3/testsuite/experimental/filesystem/operations/file_size.cc
+ 085ecd77876b8765af0fb2376a324d12  libstdc++-v3/testsuite/experimental/filesystem/operations/is_empty.cc
+ 60e34aa9914fd1b224594e9a6db9b299  libstdc++-v3/testsuite/experimental/filesystem/operations/last_write_time.cc
+ 75d957c4b12b36e2c8ad4dafcbb38b7e  libstdc++-v3/testsuite/experimental/filesystem/operations/permissions.cc
+ 59a403c45210a3ceb057a905fe0ecd38  libstdc++-v3/testsuite/experimental/filesystem/operations/read_symlink.cc
+ 45c648cffe0568036684a3e4f548c019  libstdc++-v3/testsuite/experimental/filesystem/operations/remove_all.cc
  ea39d7f9ddaa40bc9ea79628c951305c  libstdc++-v3/testsuite/experimental/filesystem/operations/status.cc
! 9e17537128f48417959da824246cd5ce  libstdc++-v3/testsuite/experimental/filesystem/operations/temp_directory_path.cc
  c651b9cbfefcd55b4abb1d09e1477a97  libstdc++-v3/testsuite/experimental/filesystem/path/append/path.cc
  a8681c8a5546586c8aae970e89114690  libstdc++-v3/testsuite/experimental/filesystem/path/assign/assign.cc
  51dc391cb41f43de6d9ba6d718926e5a  libstdc++-v3/testsuite/experimental/filesystem/path/assign/copy.cc
*************** c697f2ad3719a6b60c9f665454560f3f  libstd
*** 89818,89824 ****
  a9b75b44755d0218b591d0800e6d8a95  libstdc++-v3/testsuite/experimental/filesystem/path/construct/copy.cc
  b92c6dc45c0b7aca50b5e4954593f072  libstdc++-v3/testsuite/experimental/filesystem/path/construct/default.cc
  abce0f1846315c2f67ddca1fddad07cb  libstdc++-v3/testsuite/experimental/filesystem/path/construct/locale.cc
! 97a6cfe62f2076fc415fc858d08e479c  libstdc++-v3/testsuite/experimental/filesystem/path/construct/range.cc
  79295fe47abb8efdd9f01a96bef0b3b9  libstdc++-v3/testsuite/experimental/filesystem/path/decompose/extension.cc
  78affa87ff7cd1d1c4d4454ecb227ef4  libstdc++-v3/testsuite/experimental/filesystem/path/decompose/filename.cc
  b0c62eea8573c84ea7a8edc5bf368fb6  libstdc++-v3/testsuite/experimental/filesystem/path/decompose/parent_path.cc
--- 90236,90243 ----
  a9b75b44755d0218b591d0800e6d8a95  libstdc++-v3/testsuite/experimental/filesystem/path/construct/copy.cc
  b92c6dc45c0b7aca50b5e4954593f072  libstdc++-v3/testsuite/experimental/filesystem/path/construct/default.cc
  abce0f1846315c2f67ddca1fddad07cb  libstdc++-v3/testsuite/experimental/filesystem/path/construct/locale.cc
! d1d325687da8c23e4502d760d23d29c2  libstdc++-v3/testsuite/experimental/filesystem/path/construct/range.cc
! e2a436d713e0ecbd3f2fba0f3c90cc34  libstdc++-v3/testsuite/experimental/filesystem/path/construct/string_view.cc
  79295fe47abb8efdd9f01a96bef0b3b9  libstdc++-v3/testsuite/experimental/filesystem/path/decompose/extension.cc
  78affa87ff7cd1d1c4d4454ecb227ef4  libstdc++-v3/testsuite/experimental/filesystem/path/decompose/filename.cc
  b0c62eea8573c84ea7a8edc5bf368fb6  libstdc++-v3/testsuite/experimental/filesystem/path/decompose/parent_path.cc
*************** d5db974a706f613a925136de562f5b3c  libstd
*** 89847,89899 ****
  3caad6031433c634c061e72edf0c01cd  libstdc++-v3/testsuite/experimental/filesystem/path/query/has_root_path.cc
  ac02712866abec15dd8ef5d75cae6a36  libstdc++-v3/testsuite/experimental/filesystem/path/query/has_stem.cc
  570a28c676a821eed170bb6e088194a9  libstdc++-v3/testsuite/experimental/filesystem/path/query/is_relative.cc
! 71a5e7e646664fad6a38f4edfa3e91c4  libstdc++-v3/testsuite/experimental/functional/not_fn.cc
  7dedd912cb1300b7278aef36626d72ca  libstdc++-v3/testsuite/experimental/functional/searchers.cc
  bde8d7805c483b450a4af8bf54546d4c  libstdc++-v3/testsuite/experimental/functional/value.cc
! 83d7c4eb6d91efc719a31bc789aace7e  libstdc++-v3/testsuite/experimental/optional/assignment/1.cc
! cc8e058f45441859f79a1ce54213b575  libstdc++-v3/testsuite/experimental/optional/assignment/2.cc
! df1edd34729d885b789a2781ee4c1362  libstdc++-v3/testsuite/experimental/optional/assignment/3.cc
! 4d9292c18797385296d3894c9e0d0482  libstdc++-v3/testsuite/experimental/optional/assignment/4.cc
! 2c1403a83ddff1763b2ea4e8deb73b8b  libstdc++-v3/testsuite/experimental/optional/assignment/5.cc
! ed2906d756e91ccd4ac9bf142cf7c4f8  libstdc++-v3/testsuite/experimental/optional/assignment/6.cc
  d4ca80db2b2a540d64c5a8216a549caa  libstdc++-v3/testsuite/experimental/optional/cons/copy.cc
  127e829757b16f28c2c30890a0a1b8b7  libstdc++-v3/testsuite/experimental/optional/cons/default.cc
! 9630ce8d661e7a7c0c60320c7509388a  libstdc++-v3/testsuite/experimental/optional/cons/move.cc
! d79e1173abdbb558a3377edc63356ba4  libstdc++-v3/testsuite/experimental/optional/cons/value.cc
  a8f27f2c76934b0e4aef193a3320462b  libstdc++-v3/testsuite/experimental/optional/constexpr/cons/default.cc
! 49a19f9aadb390a54d0292ec9babb65b  libstdc++-v3/testsuite/experimental/optional/constexpr/cons/value.cc
  d8922cac53a7de29eb23d8eb444adabd  libstdc++-v3/testsuite/experimental/optional/constexpr/in_place.cc
! 576e8bf473142686c8cb2a19ee65d474  libstdc++-v3/testsuite/experimental/optional/constexpr/make_optional.cc
  3d288fbb75569ba8a76c25d6ffbad468  libstdc++-v3/testsuite/experimental/optional/constexpr/nullopt.cc
! 7928831dd852348bd0e5cdc0fb97ddc2  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/1.cc
! fe6a0071562eb38710933666a815c481  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/2.cc
! 831f80d686c1d8ee818e4f29c99c142e  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/3.cc
! 43bf4083fb451e8fd1cbfaee49ad015d  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/4.cc
! 4ace25d23517903486c696ba564b1c75  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/5.cc
! 239565f455fbe5ff184a728e146100f4  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/1.cc
! fb9a4363f316f78adbcd6cd854412ee6  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/2.cc
! b8a77ee63b8064fbd683abb4427c5041  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/3.cc
! c7305170759230bb2d38114513cd8269  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/4.cc
! 2a02447409654c31acd417e9094bc98f  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/5.cc
! 2b23ac84856b34e9115b1bd5c43237e2  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/6.cc
  b018a8c113577ca3689f2fc2c8823fc1  libstdc++-v3/testsuite/experimental/optional/in_place.cc
! 70669eaca53abb45bdada047ae64d1e1  libstdc++-v3/testsuite/experimental/optional/make_optional.cc
  387280389da2d83b748e618ae0225fa1  libstdc++-v3/testsuite/experimental/optional/nullopt.cc
! 61862a4af4dde2b49a6fe9a2029ffceb  libstdc++-v3/testsuite/experimental/optional/observers/1.cc
! 047f5a137d54ee8925848bbb123d2e1e  libstdc++-v3/testsuite/experimental/optional/observers/2.cc
! 4ed8866ee996e2078abf37778217dbe8  libstdc++-v3/testsuite/experimental/optional/observers/3.cc
! 351d8e93cb521bf5344621623d6591ec  libstdc++-v3/testsuite/experimental/optional/observers/4.cc
! 9b590c0c8689c793a2ad95d8d6824fec  libstdc++-v3/testsuite/experimental/optional/observers/5.cc
! 16227aaffe61b9809d02df0a776e9b5b  libstdc++-v3/testsuite/experimental/optional/relops/1.cc
! ad091af2db449f5f3613f47209336694  libstdc++-v3/testsuite/experimental/optional/relops/2.cc
! 1bcfc9fadecc9d501d439d19fd8c5724  libstdc++-v3/testsuite/experimental/optional/relops/3.cc
! 60e495d49a0de665aeb3a6e824cfc667  libstdc++-v3/testsuite/experimental/optional/relops/4.cc
! 8738e89a3b5077f5732316ad5cd7b6d2  libstdc++-v3/testsuite/experimental/optional/relops/5.cc
! eb6bf591101c3fa9d7835af2325cec7b  libstdc++-v3/testsuite/experimental/optional/relops/6.cc
! d2c3de82f7e4b57a81f20929cc3a8d28  libstdc++-v3/testsuite/experimental/optional/requirements.cc
! a8780ea3c337d5bd190acf3150457e94  libstdc++-v3/testsuite/experimental/optional/swap/1.cc
! bd88d1b8f69d1ec51a29506dfb990da0  libstdc++-v3/testsuite/experimental/optional/typedefs.cc
! b3b6d8d1e1cb27d0a5448aad40a9f2b2  libstdc++-v3/testsuite/experimental/ratio/value.cc
  44b1f28db585dc85fe05fdf9d2326e0e  libstdc++-v3/testsuite/experimental/string_view/capacity/1.cc
  28b01d42e26b382b7f336f4978d4f7be  libstdc++-v3/testsuite/experimental/string_view/cons/char/1.cc
  390da4e0fe0d3ee1041751e0f3e2a702  libstdc++-v3/testsuite/experimental/string_view/cons/char/2.cc
--- 90266,90318 ----
  3caad6031433c634c061e72edf0c01cd  libstdc++-v3/testsuite/experimental/filesystem/path/query/has_root_path.cc
  ac02712866abec15dd8ef5d75cae6a36  libstdc++-v3/testsuite/experimental/filesystem/path/query/has_stem.cc
  570a28c676a821eed170bb6e088194a9  libstdc++-v3/testsuite/experimental/filesystem/path/query/is_relative.cc
! 40ccb743f043faf3775f85cef1411606  libstdc++-v3/testsuite/experimental/functional/not_fn.cc
  7dedd912cb1300b7278aef36626d72ca  libstdc++-v3/testsuite/experimental/functional/searchers.cc
  bde8d7805c483b450a4af8bf54546d4c  libstdc++-v3/testsuite/experimental/functional/value.cc
! 5b9959dce1ce956239c8dde7267a067c  libstdc++-v3/testsuite/experimental/optional/assignment/1.cc
! 9d5972d603e11ef75730b050c276c31d  libstdc++-v3/testsuite/experimental/optional/assignment/2.cc
! 16a6053a093b5429be0adff2fb926e54  libstdc++-v3/testsuite/experimental/optional/assignment/3.cc
! 24f3ba2babd5122df7d23e12eace2df9  libstdc++-v3/testsuite/experimental/optional/assignment/4.cc
! 029600f2089615f54d616a49ee2e0934  libstdc++-v3/testsuite/experimental/optional/assignment/5.cc
! a698b7c4a9cfd3f94ed8d27a4af4629c  libstdc++-v3/testsuite/experimental/optional/assignment/6.cc
  d4ca80db2b2a540d64c5a8216a549caa  libstdc++-v3/testsuite/experimental/optional/cons/copy.cc
  127e829757b16f28c2c30890a0a1b8b7  libstdc++-v3/testsuite/experimental/optional/cons/default.cc
! b914a084e893fc20444b6dbc97772d84  libstdc++-v3/testsuite/experimental/optional/cons/move.cc
! b8ac641ece7154511ab25b5833c1a84a  libstdc++-v3/testsuite/experimental/optional/cons/value.cc
  a8f27f2c76934b0e4aef193a3320462b  libstdc++-v3/testsuite/experimental/optional/constexpr/cons/default.cc
! a667031d47b7993001696557ad2ea851  libstdc++-v3/testsuite/experimental/optional/constexpr/cons/value.cc
  d8922cac53a7de29eb23d8eb444adabd  libstdc++-v3/testsuite/experimental/optional/constexpr/in_place.cc
! 1129a8efac61392e5df6f308f6eac965  libstdc++-v3/testsuite/experimental/optional/constexpr/make_optional.cc
  3d288fbb75569ba8a76c25d6ffbad468  libstdc++-v3/testsuite/experimental/optional/constexpr/nullopt.cc
! da1ed9a975510f19ed065847448f9e05  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/1.cc
! 802ee50d26f288e8831741201c83a19c  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/2.cc
! 1e8a5a4bdfbea9f3649f9acc50521ce9  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/3.cc
! d35794c291c98f5b1679b6194d6988d2  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/4.cc
! b724c37daaad9c758442c02d933cc2fe  libstdc++-v3/testsuite/experimental/optional/constexpr/observers/5.cc
! 3528ae13d4bb685a8423898d48ae6c53  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/1.cc
! d328fc912c5305a7c89a55091bf76653  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/2.cc
! 96a5303722dee563d3d524396b088048  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/3.cc
! 7505229b86de48bb4537028e779c8128  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/4.cc
! 93cc1c154989a4467583f47f5aec96ad  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/5.cc
! 80913b879871970daecec44840eb7aba  libstdc++-v3/testsuite/experimental/optional/constexpr/relops/6.cc
  b018a8c113577ca3689f2fc2c8823fc1  libstdc++-v3/testsuite/experimental/optional/in_place.cc
! f6db4a1f253c65b84a07140318b831df  libstdc++-v3/testsuite/experimental/optional/make_optional.cc
  387280389da2d83b748e618ae0225fa1  libstdc++-v3/testsuite/experimental/optional/nullopt.cc
! 45b9157187c30df48db1c89360889bb8  libstdc++-v3/testsuite/experimental/optional/observers/1.cc
! 3ae140205062e2b6844909bf9dced241  libstdc++-v3/testsuite/experimental/optional/observers/2.cc
! f22e5785e82b96db0e72d48d8def5395  libstdc++-v3/testsuite/experimental/optional/observers/3.cc
! 39945a24b49f01230108de78edd005e8  libstdc++-v3/testsuite/experimental/optional/observers/4.cc
! adfb42bf95c09eb490f4e79f8beeb64f  libstdc++-v3/testsuite/experimental/optional/observers/5.cc
! b8c8c9541ed75a9bf7721c5d4131835a  libstdc++-v3/testsuite/experimental/optional/relops/1.cc
! d813076b8a490e5c03057ce0df848a1e  libstdc++-v3/testsuite/experimental/optional/relops/2.cc
! e47fcdc7707b8560ac67167ac81f00f0  libstdc++-v3/testsuite/experimental/optional/relops/3.cc
! da5b0b76d802bfb337e673452be1265d  libstdc++-v3/testsuite/experimental/optional/relops/4.cc
! 9ed6c22133f7fde30ec01054a8deb420  libstdc++-v3/testsuite/experimental/optional/relops/5.cc
! cccd8032b85df09e80a8cdaf9f95e241  libstdc++-v3/testsuite/experimental/optional/relops/6.cc
! a8cd1e2c18ba75fe1d31bbf617ce8764  libstdc++-v3/testsuite/experimental/optional/requirements.cc
! 808b0e7279ed364a9c886a52b408efdf  libstdc++-v3/testsuite/experimental/optional/swap/1.cc
! 0e0a2daa72b2e06f6cc489a0fc0f8f37  libstdc++-v3/testsuite/experimental/optional/typedefs.cc
! 890e85757139536e342d2fff2d2e2581  libstdc++-v3/testsuite/experimental/ratio/value.cc
  44b1f28db585dc85fe05fdf9d2326e0e  libstdc++-v3/testsuite/experimental/string_view/capacity/1.cc
  28b01d42e26b382b7f336f4978d4f7be  libstdc++-v3/testsuite/experimental/string_view/cons/char/1.cc
  390da4e0fe0d3ee1041751e0f3e2a702  libstdc++-v3/testsuite/experimental/string_view/cons/char/2.cc
*************** fdaf3cbfa155768a04007995ff0df8a6  libstd
*** 89958,89969 ****
  74df7dff469c803245dba5475fbf5af9  libstdc++-v3/testsuite/experimental/string_view/requirements/explicit_instantiation/char32_t/1.cc
  404177a43d27b58c86e3d5befcbb6e58  libstdc++-v3/testsuite/experimental/string_view/requirements/explicit_instantiation/wchar_t/1.cc
  b15c1e440c6c766478b33d5c89049d23  libstdc++-v3/testsuite/experimental/string_view/requirements/typedefs.cc
! cceb4ae15b63e41780a782cee0c7351c  libstdc++-v3/testsuite/experimental/string_view/typedefs.cc
  2f40876477489904c91cf4abb3a95bbd  libstdc++-v3/testsuite/experimental/string_view/types/1.cc
! ad529a423bb74da678d59a230b218c96  libstdc++-v3/testsuite/experimental/system_error/value.cc
  73bcb1319926414f08bc6279a28a18d4  libstdc++-v3/testsuite/experimental/tuple/apply.cc
! a460a6019425b9eeffb6924d6e0219ed  libstdc++-v3/testsuite/experimental/tuple/tuple_size.cc
! 6d8525ec8b861f79c1bfdda4997f4d11  libstdc++-v3/testsuite/experimental/type_traits/value.cc
  11a524b0a27a56a698dbf630ddb149f7  libstdc++-v3/testsuite/ext/array_allocator/1.cc
  fa1377f6eafbb23351f933fcb8a1a143  libstdc++-v3/testsuite/ext/array_allocator/2.cc
  d1e170890f883ee074f74b6f50d9224c  libstdc++-v3/testsuite/ext/array_allocator/26875.cc
--- 90377,90388 ----
  74df7dff469c803245dba5475fbf5af9  libstdc++-v3/testsuite/experimental/string_view/requirements/explicit_instantiation/char32_t/1.cc
  404177a43d27b58c86e3d5befcbb6e58  libstdc++-v3/testsuite/experimental/string_view/requirements/explicit_instantiation/wchar_t/1.cc
  b15c1e440c6c766478b33d5c89049d23  libstdc++-v3/testsuite/experimental/string_view/requirements/typedefs.cc
! 69c128c4aeac46869fe5992397f495a6  libstdc++-v3/testsuite/experimental/string_view/typedefs.cc
  2f40876477489904c91cf4abb3a95bbd  libstdc++-v3/testsuite/experimental/string_view/types/1.cc
! e830d9b5f5390ce5f209170962a6f9ae  libstdc++-v3/testsuite/experimental/system_error/value.cc
  73bcb1319926414f08bc6279a28a18d4  libstdc++-v3/testsuite/experimental/tuple/apply.cc
! c6bcefa70ca30c0c67ddb3e38eaf77e0  libstdc++-v3/testsuite/experimental/tuple/tuple_size.cc
! 573332562c48e14cf4304b0bc70cd645  libstdc++-v3/testsuite/experimental/type_traits/value.cc
  11a524b0a27a56a698dbf630ddb149f7  libstdc++-v3/testsuite/ext/array_allocator/1.cc
  fa1377f6eafbb23351f933fcb8a1a143  libstdc++-v3/testsuite/ext/array_allocator/2.cc
  d1e170890f883ee074f74b6f50d9224c  libstdc++-v3/testsuite/ext/array_allocator/26875.cc
*************** d82b4fab7df54dc5c2715e5883bec7b5  libstd
*** 90083,90091 ****
  4e333d23116bbb486a65a5b0299c33c1  libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_map_rand_debug.cc
  d45f9e2dd31518b84164970861fd7625  libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_set_rand.cc
  775c7cec61f1ef55c1a951e4817df58f  libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_set_rand_debug.cc
  bd77766492d0f7fcf5c7925e1857e868  libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_rand.cc
  a96817c73816bff2c33952b8c6a12e40  libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_rand_debug.cc
! 342c7a2c762c9ae201c0ce04e78da648  libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc
  7e3db66d226b025469fce648e06b9c73  libstdc++-v3/testsuite/ext/pb_ds/regression/tree_map_rand.cc
  60abf43df3bb0eb55df961ec2a71dce4  libstdc++-v3/testsuite/ext/pb_ds/regression/tree_map_rand_debug.cc
  88637343793d687ceb3e127826661b1f  libstdc++-v3/testsuite/ext/pb_ds/regression/tree_set_rand.cc
--- 90502,90511 ----
  4e333d23116bbb486a65a5b0299c33c1  libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_map_rand_debug.cc
  d45f9e2dd31518b84164970861fd7625  libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_set_rand.cc
  775c7cec61f1ef55c1a951e4817df58f  libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_set_rand_debug.cc
+ adaf4213d618ef3bf2e611c156e73ce1  libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_binary_heap-62045.cc
  bd77766492d0f7fcf5c7925e1857e868  libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_rand.cc
  a96817c73816bff2c33952b8c6a12e40  libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_rand_debug.cc
! 34f1efbed067b8086824c37ee4767c99  libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc
  7e3db66d226b025469fce648e06b9c73  libstdc++-v3/testsuite/ext/pb_ds/regression/tree_map_rand.cc
  60abf43df3bb0eb55df961ec2a71dce4  libstdc++-v3/testsuite/ext/pb_ds/regression/tree_map_rand_debug.cc
  88637343793d687ceb3e127826661b1f  libstdc++-v3/testsuite/ext/pb_ds/regression/tree_set_rand.cc
*************** c85b22ef7778d1a58dcab78789d747a4  libstd
*** 90103,90109 ****
  08a291c5e0ff92133bdba048bb46848e  libstdc++-v3/testsuite/ext/pool_allocator/explicit_instantiation.cc
  56628295a7bdba12c0a830483e75bf27  libstdc++-v3/testsuite/ext/pool_allocator/variadic_construct.cc
  6e80d868ec40d2a8bc7509aa838d0a84  libstdc++-v3/testsuite/ext/profile/all.cc
! 1dd7c5dabc148a74637b530720e1181d  libstdc++-v3/testsuite/ext/profile/mutex_extensions_neg.cc
  fdd817f377bf8329ad61c7c2efe44605  libstdc++-v3/testsuite/ext/profile/profiler_algos.cc
  74b43934bcaa013af0ee530ca8bef0ca  libstdc++-v3/testsuite/ext/profile/replace_new.cc
  7e67dff1232cba142c53a1d8c326243d  libstdc++-v3/testsuite/ext/random/arcsine_distribution/cons/default.cc
--- 90523,90529 ----
  08a291c5e0ff92133bdba048bb46848e  libstdc++-v3/testsuite/ext/pool_allocator/explicit_instantiation.cc
  56628295a7bdba12c0a830483e75bf27  libstdc++-v3/testsuite/ext/pool_allocator/variadic_construct.cc
  6e80d868ec40d2a8bc7509aa838d0a84  libstdc++-v3/testsuite/ext/profile/all.cc
! 9570eefa21d4fe05a96c3a6e018ac975  libstdc++-v3/testsuite/ext/profile/mutex_extensions_neg.cc
  fdd817f377bf8329ad61c7c2efe44605  libstdc++-v3/testsuite/ext/profile/profiler_algos.cc
  74b43934bcaa013af0ee530ca8bef0ca  libstdc++-v3/testsuite/ext/profile/replace_new.cc
  7e67dff1232cba142c53a1d8c326243d  libstdc++-v3/testsuite/ext/random/arcsine_distribution/cons/default.cc
*************** bde5bbc5c6dd69150f391d1d625fabde  libstd
*** 90222,90227 ****
--- 90642,90649 ----
  3007b28fd60c82fc6a2f7a1d6d623d91  libstdc++-v3/testsuite/ext/stdio_filebuf/char/10063-2.cc
  4f469be1092ee407e46ef0f32721f233  libstdc++-v3/testsuite/ext/stdio_filebuf/char/10063-3.cc
  2e9b1c1692f9e2d4cee76e300a045df9  libstdc++-v3/testsuite/ext/stdio_filebuf/char/2.cc
+ 27988ec57765b6fad6dc4a46c6e8d093  libstdc++-v3/testsuite/ext/stdio_filebuf/char/79820.cc
+ a5b76ab5544142437a4202bcc0dcd2c0  libstdc++-v3/testsuite/ext/stdio_filebuf/char/81751.cc
  739340f84c950a9833b57febb7a8c92c  libstdc++-v3/testsuite/ext/stdio_filebuf/requirements/explicit_instantiation.cc
  e81da8cf1cce4ce8fa0ba42a1e478721  libstdc++-v3/testsuite/ext/stdio_sync_filebuf/char/1.cc
  705f6a96373d6060beb52d16d7784c69  libstdc++-v3/testsuite/ext/stdio_sync_filebuf/char/12048-1.cc
*************** cdda6f093b200c7369e10271522b8fca  libstd
*** 90294,90318 ****
  0f8ca56b40749b2924a4a8898a90e087  libstdc++-v3/testsuite/ext/vstring/types/23767.cc
  d1ccaa1d0aa1d567b1cefe40211570a3  libstdc++-v3/testsuite/lib/dg-options.exp
  3d9f0f9b8bfca1e41f33f5cf9be17261  libstdc++-v3/testsuite/lib/gdb-test.exp
! feafe2bee54b68b525e0f9dd9b15d8b5  libstdc++-v3/testsuite/lib/libstdc++.exp
  38175b10db17bc6a4addc1484a607447  libstdc++-v3/testsuite/lib/prune.exp
  75ec7d6fa668bf2dda42f09a8d0e8da9  libstdc++-v3/testsuite/libstdc++-abi/abi.exp
  a0a4cbf08f67a4fa61d7187fb0ed255d  libstdc++-v3/testsuite/libstdc++-dg/conformance.exp
  ef6b4db95cca251e5e71aaf5bf99d551  libstdc++-v3/testsuite/libstdc++-prettyprinters/48362.cc
  282d13795982eb654c7e3fc8988d54b5  libstdc++-v3/testsuite/libstdc++-prettyprinters/cxx11.cc
  6d8e1b90939735cecceb16d8755f6b17  libstdc++-v3/testsuite/libstdc++-prettyprinters/debug.cc
  1807f5e4c55a5760bb701253ddf8f160  libstdc++-v3/testsuite/libstdc++-prettyprinters/libfundts.cc
  caf971c86a8b350ec4d8aea2190e64d4  libstdc++-v3/testsuite/libstdc++-prettyprinters/prettyprinters.exp
  0d45de9b08da076346e1d5e97c434cc5  libstdc++-v3/testsuite/libstdc++-prettyprinters/shared_ptr.cc
! 4686038968162521d0df88229d2fa6e4  libstdc++-v3/testsuite/libstdc++-prettyprinters/simple.cc
! 492dd7bb218bdee90d5830705f826aa7  libstdc++-v3/testsuite/libstdc++-prettyprinters/simple11.cc
  f8bc1952ed05b68b8a451d8518fff660  libstdc++-v3/testsuite/libstdc++-prettyprinters/tr1.cc
  3e08409ebd36c1770229252fe8a29e70  libstdc++-v3/testsuite/libstdc++-prettyprinters/whatis.cc
  31ba231409babe4490c1976814261459  libstdc++-v3/testsuite/libstdc++-xmethods/array.cc
  e52422214e14e3185334b2ecaa34448a  libstdc++-v3/testsuite/libstdc++-xmethods/associative-containers.cc
  a999043567f67e61e797ad2350d530e2  libstdc++-v3/testsuite/libstdc++-xmethods/deque.cc
  9a2341d598e26848249af390291910b3  libstdc++-v3/testsuite/libstdc++-xmethods/forwardlist.cc
! 04a7eac1741ddc99e4a8058a9038c7e0  libstdc++-v3/testsuite/libstdc++-xmethods/list.cc
  e50b9cecb85b66d687e8891ce0b94380  libstdc++-v3/testsuite/libstdc++-xmethods/unique_ptr.cc
  e1ed8058eb3602b9028a64b494a8f5d5  libstdc++-v3/testsuite/libstdc++-xmethods/vector.cc
  22accf3a41ebf184e97435104ddda4a2  libstdc++-v3/testsuite/libstdc++-xmethods/xmethods.exp
--- 90716,90741 ----
  0f8ca56b40749b2924a4a8898a90e087  libstdc++-v3/testsuite/ext/vstring/types/23767.cc
  d1ccaa1d0aa1d567b1cefe40211570a3  libstdc++-v3/testsuite/lib/dg-options.exp
  3d9f0f9b8bfca1e41f33f5cf9be17261  libstdc++-v3/testsuite/lib/gdb-test.exp
! f0eec4cb1b40d5584be7bb7c40d445e9  libstdc++-v3/testsuite/lib/libstdc++.exp
  38175b10db17bc6a4addc1484a607447  libstdc++-v3/testsuite/lib/prune.exp
  75ec7d6fa668bf2dda42f09a8d0e8da9  libstdc++-v3/testsuite/libstdc++-abi/abi.exp
  a0a4cbf08f67a4fa61d7187fb0ed255d  libstdc++-v3/testsuite/libstdc++-dg/conformance.exp
  ef6b4db95cca251e5e71aaf5bf99d551  libstdc++-v3/testsuite/libstdc++-prettyprinters/48362.cc
+ 68e683137d64badec192d4c3bd419579  libstdc++-v3/testsuite/libstdc++-prettyprinters/59161.cc
  282d13795982eb654c7e3fc8988d54b5  libstdc++-v3/testsuite/libstdc++-prettyprinters/cxx11.cc
  6d8e1b90939735cecceb16d8755f6b17  libstdc++-v3/testsuite/libstdc++-prettyprinters/debug.cc
  1807f5e4c55a5760bb701253ddf8f160  libstdc++-v3/testsuite/libstdc++-prettyprinters/libfundts.cc
  caf971c86a8b350ec4d8aea2190e64d4  libstdc++-v3/testsuite/libstdc++-prettyprinters/prettyprinters.exp
  0d45de9b08da076346e1d5e97c434cc5  libstdc++-v3/testsuite/libstdc++-prettyprinters/shared_ptr.cc
! 2e4332de4258686dc86ae99f178fe375  libstdc++-v3/testsuite/libstdc++-prettyprinters/simple.cc
! f1ea5811702448803bfd269016bad4f5  libstdc++-v3/testsuite/libstdc++-prettyprinters/simple11.cc
  f8bc1952ed05b68b8a451d8518fff660  libstdc++-v3/testsuite/libstdc++-prettyprinters/tr1.cc
  3e08409ebd36c1770229252fe8a29e70  libstdc++-v3/testsuite/libstdc++-prettyprinters/whatis.cc
  31ba231409babe4490c1976814261459  libstdc++-v3/testsuite/libstdc++-xmethods/array.cc
  e52422214e14e3185334b2ecaa34448a  libstdc++-v3/testsuite/libstdc++-xmethods/associative-containers.cc
  a999043567f67e61e797ad2350d530e2  libstdc++-v3/testsuite/libstdc++-xmethods/deque.cc
  9a2341d598e26848249af390291910b3  libstdc++-v3/testsuite/libstdc++-xmethods/forwardlist.cc
! f4a78d6a8eb37dda09b274c2b47a5425  libstdc++-v3/testsuite/libstdc++-xmethods/list.cc
  e50b9cecb85b66d687e8891ce0b94380  libstdc++-v3/testsuite/libstdc++-xmethods/unique_ptr.cc
  e1ed8058eb3602b9028a64b494a8f5d5  libstdc++-v3/testsuite/libstdc++-xmethods/vector.cc
  22accf3a41ebf184e97435104ddda4a2  libstdc++-v3/testsuite/libstdc++-xmethods/xmethods.exp
*************** e255b3f6d0466119eb96f3d956f0ced2  libstd
*** 91086,91092 ****
  887bf40f7e3e256fdbaba654864141e6  libstdc++-v3/testsuite/util/testsuite_abi.h
  d0866c3b64aaa09d83e4fe16edeb11a5  libstdc++-v3/testsuite/util/testsuite_abi_check.cc
  a11b1e002a5c42fab34938479d8315ca  libstdc++-v3/testsuite/util/testsuite_allocator.cc
! 70d5fc7e12209d6ba443baf127d3ee71  libstdc++-v3/testsuite/util/testsuite_allocator.h
  36e33d1363b146391d91bd458283416d  libstdc++-v3/testsuite/util/testsuite_api.h
  dc98fd86b88226fd1338470d1bd3b217  libstdc++-v3/testsuite/util/testsuite_character.cc
  60165b3b356e585eb621719deb4080d8  libstdc++-v3/testsuite/util/testsuite_character.h
--- 91509,91515 ----
  887bf40f7e3e256fdbaba654864141e6  libstdc++-v3/testsuite/util/testsuite_abi.h
  d0866c3b64aaa09d83e4fe16edeb11a5  libstdc++-v3/testsuite/util/testsuite_abi_check.cc
  a11b1e002a5c42fab34938479d8315ca  libstdc++-v3/testsuite/util/testsuite_allocator.cc
! e40abcca223b3ba081c26f8542be0015  libstdc++-v3/testsuite/util/testsuite_allocator.h
  36e33d1363b146391d91bd458283416d  libstdc++-v3/testsuite/util/testsuite_api.h
  dc98fd86b88226fd1338470d1bd3b217  libstdc++-v3/testsuite/util/testsuite_character.cc
  60165b3b356e585eb621719deb4080d8  libstdc++-v3/testsuite/util/testsuite_character.h
*************** cfd6a3073a2a054ef0434258467f7e01  libstd
*** 91096,91105 ****
  41c4892b1a6335645517b54ccb31f5ea  libstdc++-v3/testsuite/util/testsuite_containers.h
  606eb58a9d68b55ae03577365d23ce9e  libstdc++-v3/testsuite/util/testsuite_counter_type.h
  d23ee1aef25d462266dda64d3f962d1c  libstdc++-v3/testsuite/util/testsuite_error.h
! 7c7c776dd5df84f876c8eb17c6005942  libstdc++-v3/testsuite/util/testsuite_fs.h
  aff5a0c6584cff622a9e62f6ffa73789  libstdc++-v3/testsuite/util/testsuite_greedy_ops.h
  431db1da6d6e8e9e1064773cb9b09c55  libstdc++-v3/testsuite/util/testsuite_hooks.cc
! 9d1bd5d1b0f4590ddae16040fbf06e47  libstdc++-v3/testsuite/util/testsuite_hooks.h
  0b4d17fadd08a420eaeb8612e4f549e2  libstdc++-v3/testsuite/util/testsuite_io.h
  fef59bdb25215ac4b80d7aa2bec48b74  libstdc++-v3/testsuite/util/testsuite_iterators.h
  a2333f73941fdf49306fddaafbd5254f  libstdc++-v3/testsuite/util/testsuite_new_operators.h
--- 91519,91528 ----
  41c4892b1a6335645517b54ccb31f5ea  libstdc++-v3/testsuite/util/testsuite_containers.h
  606eb58a9d68b55ae03577365d23ce9e  libstdc++-v3/testsuite/util/testsuite_counter_type.h
  d23ee1aef25d462266dda64d3f962d1c  libstdc++-v3/testsuite/util/testsuite_error.h
! 3de9a2d8a787eac57b09d36600206971  libstdc++-v3/testsuite/util/testsuite_fs.h
  aff5a0c6584cff622a9e62f6ffa73789  libstdc++-v3/testsuite/util/testsuite_greedy_ops.h
  431db1da6d6e8e9e1064773cb9b09c55  libstdc++-v3/testsuite/util/testsuite_hooks.cc
! d98590d23e0349381dfd626db2da7069  libstdc++-v3/testsuite/util/testsuite_hooks.h
  0b4d17fadd08a420eaeb8612e4f549e2  libstdc++-v3/testsuite/util/testsuite_io.h
  fef59bdb25215ac4b80d7aa2bec48b74  libstdc++-v3/testsuite/util/testsuite_iterators.h
  a2333f73941fdf49306fddaafbd5254f  libstdc++-v3/testsuite/util/testsuite_new_operators.h
*************** a2333f73941fdf49306fddaafbd5254f  libstd
*** 91113,91119 ****
  d70b9cbb92ec922b879056258938b07d  libstdc++-v3/testsuite/util/thread/all.h
  b950d655469c477755252b1e18009596  libtool-ldflags
  7a2b83d2d625a4022b9213ceb75f5897  libtool.m4
! 30b3730c67db1a70e8c33812af1f21d8  libvtv/ChangeLog
  244b517457d96ecc5b87cbc18e8047ed  libvtv/Makefile.am
  8642f78885bb2ab0bd770e01f4b876e7  libvtv/Makefile.in
  4ce86f8604e6c86211a4cb2025ffc53e  libvtv/acinclude.m4
--- 91536,91542 ----
  d70b9cbb92ec922b879056258938b07d  libstdc++-v3/testsuite/util/thread/all.h
  b950d655469c477755252b1e18009596  libtool-ldflags
  7a2b83d2d625a4022b9213ceb75f5897  libtool.m4
! 076d0f1c161b8327529f9190d5f74841  libvtv/ChangeLog
  244b517457d96ecc5b87cbc18e8047ed  libvtv/Makefile.am
  8642f78885bb2ab0bd770e01f4b876e7  libvtv/Makefile.in
  4ce86f8604e6c86211a4cb2025ffc53e  libvtv/acinclude.m4
*************** b667f264afd4d34b959414ca812fb36f  libvtv
*** 91196,91215 ****
  5ddbd6d7662cb8cab972934da6561160  libvtv/vtv_utils.h
  247597a3fcc5b5aa8bd923351c59d853  ltgcc.m4
  4e65f2f6a05f5eca82ba79c6363aa3db  ltmain.sh
! 1824b831aef7c55393720b70eb173694  lto-plugin/ChangeLog
  ac3e1f5348d7a62eef1fcd69e1fe9bff  lto-plugin/Makefile.am
  1c20eeba73adc0b0ac37cdb759265758  lto-plugin/Makefile.in
  e0b6c77fa2326a08aa2d7a69e87e0f8c  lto-plugin/aclocal.m4
  e8d8e3dc8d2e134b03f22c7c567d030c  lto-plugin/config.h.in
  7983d6efb28540d7b6e363fabb7cf983  lto-plugin/configure
  96f8a1797122b5436e2941a2a99b7893  lto-plugin/configure.ac
! 3a486d26e24af8d0aedc60d6eebf4d79  lto-plugin/lto-plugin.c
  139179f8500d6f092a4f53d8f4da7f5c  lto-plugin/lto-symtab.c
  dee72a6a60e99528b0d17bf3ff9a1e15  ltoptions.m4
  bc2f6032c98896249eadb56177c7d357  ltsugar.m4
  c30cd33c496505f13d9fbdb6970c7c33  ltversion.m4
  293853a13b7e218e3a4342cf85fbbf25  lt~obsolete.m4
! 82bd5cd434e85836b9474a903df84513  maintainer-scripts/ChangeLog
  33c7bc2d2c55956dfac85a05d8a80eff  maintainer-scripts/README
  4edf444bac508f167955906d3753b32b  maintainer-scripts/crontab
  6facef54b1f26f6ee5d58aef536e7c82  maintainer-scripts/gcc_release
--- 91619,91638 ----
  5ddbd6d7662cb8cab972934da6561160  libvtv/vtv_utils.h
  247597a3fcc5b5aa8bd923351c59d853  ltgcc.m4
  4e65f2f6a05f5eca82ba79c6363aa3db  ltmain.sh
! 8997d9fe3a821f4d396a6ec879df283e  lto-plugin/ChangeLog
  ac3e1f5348d7a62eef1fcd69e1fe9bff  lto-plugin/Makefile.am
  1c20eeba73adc0b0ac37cdb759265758  lto-plugin/Makefile.in
  e0b6c77fa2326a08aa2d7a69e87e0f8c  lto-plugin/aclocal.m4
  e8d8e3dc8d2e134b03f22c7c567d030c  lto-plugin/config.h.in
  7983d6efb28540d7b6e363fabb7cf983  lto-plugin/configure
  96f8a1797122b5436e2941a2a99b7893  lto-plugin/configure.ac
! 41556fdf74abebe78ebc2d5db5c3893e  lto-plugin/lto-plugin.c
  139179f8500d6f092a4f53d8f4da7f5c  lto-plugin/lto-symtab.c
  dee72a6a60e99528b0d17bf3ff9a1e15  ltoptions.m4
  bc2f6032c98896249eadb56177c7d357  ltsugar.m4
  c30cd33c496505f13d9fbdb6970c7c33  ltversion.m4
  293853a13b7e218e3a4342cf85fbbf25  lt~obsolete.m4
! b9609257867558c8ad3adc294410fa61  maintainer-scripts/ChangeLog
  33c7bc2d2c55956dfac85a05d8a80eff  maintainer-scripts/README
  4edf444bac508f167955906d3753b32b  maintainer-scripts/crontab
  6facef54b1f26f6ee5d58aef536e7c82  maintainer-scripts/gcc_release
*************** fbe2467afef81c41c166173adeb0ee20  mkdep
*** 91225,91231 ****
  cf2baa0854f564a7785307e79f155efc  symlink-tree
  cb06c1be6a41d68b0a65e0c1a91752bc  ylwrap
  ed77bd1cb8611c7e07d54332abbbb44a  zlib/CMakeLists.txt
! 3770fb0fc6784242d2583efdba69ba1d  zlib/ChangeLog
  dabec672c0eb67568e57ee1cb8d7ec2a  zlib/ChangeLog.gcj
  0e9a37be8e3b85cc0ccf60504064c297  zlib/ChangeLog.jit
  b7a1991f01daea3efe108a215c5514a5  zlib/FAQ
--- 91648,91654 ----
  cf2baa0854f564a7785307e79f155efc  symlink-tree
  cb06c1be6a41d68b0a65e0c1a91752bc  ylwrap
  ed77bd1cb8611c7e07d54332abbbb44a  zlib/CMakeLists.txt
! a07f39f5e82b77e2198742f456a95b5b  zlib/ChangeLog
  dabec672c0eb67568e57ee1cb8d7ec2a  zlib/ChangeLog.gcj
  0e9a37be8e3b85cc0ccf60504064c297  zlib/ChangeLog.jit
  b7a1991f01daea3efe108a215c5514a5  zlib/FAQ
diff -Nrcpad gcc-5.4.0/NEWS gcc-5.5.0/NEWS
*** gcc-5.4.0/NEWS	Fri Jun  3 08:46:16 2016
--- gcc-5.5.0/NEWS	Tue Oct 10 08:20:39 2017
*************** see ONEWS.
*** 6,35 ****
  
  ======================================================================
  http://gcc.gnu.org/gcc-5/index.html
- 
                                GCC 5 Release Series
  
!    June 3, 2016
  
     The [1]GNU project and the GCC developers are pleased to announce the
!    release of GCC 5.4.
  
     This release is a bug-fix release, containing fixes for regressions in
!    GCC 5.3 relative to previous releases of GCC.
  
  Release History
  
     GCC 5.4
!           June 3, 2016 ([2]changes, [3]documentation)
  
     GCC 5.3
!           December 4, 2015 ([4]changes, [5]documentation)
  
     GCC 5.2
!           July 16, 2015 ([6]changes, [7]documentation)
  
     GCC 5.1
!           April 22, 2015 ([8]changes, [9]documentation)
  
  References and Acknowledgements
  
--- 6,37 ----
  
  ======================================================================
  http://gcc.gnu.org/gcc-5/index.html
                                GCC 5 Release Series
  
!    October 10, 2017
  
     The [1]GNU project and the GCC developers are pleased to announce the
!    release of GCC 5.5.
  
     This release is a bug-fix release, containing fixes for regressions in
!    GCC 5.4 relative to previous releases of GCC.
  
  Release History
  
+    GCC 5.5
+           October 10, 2017 ([2]changes, [3]documentation)
+ 
     GCC 5.4
!           June 3, 2016 ([4]changes, [5]documentation)
  
     GCC 5.3
!           December 4, 2015 ([6]changes, [7]documentation)
  
     GCC 5.2
!           July 16, 2015 ([8]changes, [9]documentation)
  
     GCC 5.1
!           April 22, 2015 ([10]changes, [11]documentation)
  
  References and Acknowledgements
  
*************** References and Acknowledgements
*** 37,97 ****
     supports several other languages aside from C, it now stands for the
     GNU Compiler Collection.
  
!    A list of [10]successful builds is updated as new information becomes
     available.
  
     The GCC developers would like to thank the numerous people that have
     contributed new features, improvements, bug fixes, and other changes as
!    well as test results to GCC. This [11]amazing group of volunteers is
     what makes GCC successful.
  
!    For additional information about GCC please refer to the [12]GCC
!    project web site or contact the [13]GCC development mailing list.
  
!    To obtain GCC please use [14]our mirror sites or [15]our SVN server.
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [16]GCC manuals. If that fails, the
!     [17]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [18]gcc@gcc.gnu.org. All of [19]our lists have public
      archives.
  
!    Copyright (C) [20]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [21]maintained by the GCC team. Last modified
!    2016-06-03[22].
  
  References
  
     1. http://www.gnu.org/
     2. http://gcc.gnu.org/gcc-5/changes.html
!    3. http://gcc.gnu.org/onlinedocs/5.4.0/
     4. http://gcc.gnu.org/gcc-5/changes.html
!    5. http://gcc.gnu.org/onlinedocs/5.3.0/
     6. http://gcc.gnu.org/gcc-5/changes.html
!    7. http://gcc.gnu.org/onlinedocs/5.2.0/
     8. http://gcc.gnu.org/gcc-5/changes.html
!    9. http://gcc.gnu.org/onlinedocs/5.1.0/
!   10. http://gcc.gnu.org/gcc-5/buildstat.html
!   11. http://gcc.gnu.org/onlinedocs/gcc/Contributors.html
!   12. http://gcc.gnu.org/index.html
!   13. mailto:gcc@gcc.gnu.org
!   14. http://gcc.gnu.org/mirrors.html
!   15. http://gcc.gnu.org/svn.html
!   16. https://gcc.gnu.org/onlinedocs/
!   17. mailto:gcc-help@gcc.gnu.org
!   18. mailto:gcc@gcc.gnu.org
!   19. https://gcc.gnu.org/lists.html
!   20. http://www.fsf.org/
!   21. https://gcc.gnu.org/about.html
!   22. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-5/changes.html
- 
                                GCC 5 Release Series
                          Changes, New Features, and Fixes
  
--- 39,100 ----
     supports several other languages aside from C, it now stands for the
     GNU Compiler Collection.
  
!    A list of [12]successful builds is updated as new information becomes
     available.
  
     The GCC developers would like to thank the numerous people that have
     contributed new features, improvements, bug fixes, and other changes as
!    well as test results to GCC. This [13]amazing group of volunteers is
     what makes GCC successful.
  
!    For additional information about GCC please refer to the [14]GCC
!    project web site or contact the [15]GCC development mailing list.
  
!    To obtain GCC please use [16]our mirror sites or [17]our SVN server.
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [18]GCC manuals. If that fails, the
!     [19]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [20]gcc@gcc.gnu.org. All of [21]our lists have public
      archives.
  
!    Copyright (C) [22]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [23]maintained by the GCC team. Last modified
!    2017-10-10[24].
  
  References
  
     1. http://www.gnu.org/
     2. http://gcc.gnu.org/gcc-5/changes.html
!    3. http://gcc.gnu.org/onlinedocs/5.5.0/
     4. http://gcc.gnu.org/gcc-5/changes.html
!    5. http://gcc.gnu.org/onlinedocs/5.4.0/
     6. http://gcc.gnu.org/gcc-5/changes.html
!    7. http://gcc.gnu.org/onlinedocs/5.3.0/
     8. http://gcc.gnu.org/gcc-5/changes.html
!    9. http://gcc.gnu.org/onlinedocs/5.2.0/
!   10. http://gcc.gnu.org/gcc-5/changes.html
!   11. http://gcc.gnu.org/onlinedocs/5.1.0/
!   12. http://gcc.gnu.org/gcc-5/buildstat.html
!   13. http://gcc.gnu.org/onlinedocs/gcc/Contributors.html
!   14. http://gcc.gnu.org/index.html
!   15. mailto:gcc@gcc.gnu.org
!   16. http://gcc.gnu.org/mirrors.html
!   17. http://gcc.gnu.org/svn.html
!   18. https://gcc.gnu.org/onlinedocs/
!   19. mailto:gcc-help@gcc.gnu.org
!   20. mailto:gcc@gcc.gnu.org
!   21. https://gcc.gnu.org/lists.html
!   22. http://www.fsf.org/
!   23. https://gcc.gnu.org/about.html
!   24. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-5/changes.html
                                GCC 5 Release Series
                          Changes, New Features, and Fixes
  
*************** void operator delete[] (void *, std::siz
*** 506,513 ****
  
       * Compatibility notice:
            + The version of the module files (.mod) has been incremented.
!           + For free-form source files, [22]-Werror=line-truncation is now
!             enabled by default; note that comments exceeding the line
              length are not diagnosed. (For fixed-form source code, the
              same warning is available but turned off by default, such that
              excess characters are ignored. -ffree-line-length-n and
--- 509,516 ----
  
       * Compatibility notice:
            + The version of the module files (.mod) has been incremented.
!           + For free-form source files [22]-Werror=line-truncation is now
!             enabled by default. Note that comments exceeding the line
              length are not diagnosed. (For fixed-form source code, the
              same warning is available but turned off by default, such that
              excess characters are ignored. -ffree-line-length-n and
*************** void operator delete[] (void *, std::siz
*** 516,522 ****
            + The -Wtabs option is now more sensible: with -Wtabs the
              compiler warns if it encounters tabs and with -Wno-tabs this
              warning is turned off. Before, -Wno-tabs warned and -Wtabs
!             turned the warning off. As before, the warning is also enabled
              by -Wall, -pedantic and the f95, f2003, f2008 and f2008ts
              options of -std=.
       * Incomplete support for colorizing diagnostics emitted by gfortran
--- 519,525 ----
            + The -Wtabs option is now more sensible: with -Wtabs the
              compiler warns if it encounters tabs and with -Wno-tabs this
              warning is turned off. Before, -Wno-tabs warned and -Wtabs
!             disabled the warning. As before, this warning is also enabled
              by -Wall, -pedantic and the f95, f2003, f2008 and f2008ts
              options of -std=.
       * Incomplete support for colorizing diagnostics emitted by gfortran
*************** New Targets and Target Specific Improvem
*** 706,712 ****
  
    IA-32/x86-64
  
!      * New ISA extensions support [40]AVX-512{BW,DQ,VL,IFMA,VBMI} of
         Intel's CPU codenamed Skylake Server was added to GCC. That
         includes inline assembly support, new intrinsics, and basic
         autovectorization. These new AVX-512 extensions are available via
--- 709,715 ----
  
    IA-32/x86-64
  
!      * New [40]ISA extensions support AVX-512{BW,DQ,VL,IFMA,VBMI} of
         Intel's CPU codenamed Skylake Server was added to GCC. That
         includes inline assembly support, new intrinsics, and basic
         autovectorization. These new AVX-512 extensions are available via
*************** New Targets and Target Specific Improvem
*** 715,721 ****
         Dword and Qword instructions: -mavx512dq, AVX-512 FMA-52
         instructions: -mavx512ifma and for AVX-512 Vector Bit Manipulation
         Instructions: -mavx512vbmi.
!      * New ISA extensions support [41]Intel MPX was added to GCC. This new
         extension is available via the -mmpx compiler switch. Intel MPX is
         a set of processor features which, with compiler, run-time library
         and OS support, brings increased robustness to software by run-time
--- 718,724 ----
         Dword and Qword instructions: -mavx512dq, AVX-512 FMA-52
         instructions: -mavx512ifma and for AVX-512 Vector Bit Manipulation
         Instructions: -mavx512vbmi.
!      * New ISA extensions support Intel MPX was added to GCC. This new
         extension is available via the -mmpx compiler switch. Intel MPX is
         a set of processor features which, with compiler, run-time library
         and OS support, brings increased robustness to software by run-time
*************** New Targets and Target Specific Improvem
*** 845,850 ****
--- 848,859 ----
  
  Operating Systems
  
+   AIX
+ 
+      * GCC now supports stabs debugging continuation lines to allow long
+        stabs debug information without overflow that generates AIX linker
+        errors.
+ 
    DragonFly BSD
  
       * GCC now supports the DragonFly BSD operating system.
*************** Other significant improvements
*** 869,877 ****
         automatically generates a developer-friendly reproducer whenever an
         internal compiler error is encountered.
  
! GCC 5.2
  
!    This is the [42]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 5.2 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
--- 878,886 ----
         automatically generates a developer-friendly reproducer whenever an
         internal compiler error is encountered.
  
!                                     GCC 5.2
  
!    This is the [41]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 5.2 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
*************** Target Specific Changes
*** 910,918 ****
         make use of these builtins the vecintrin.h header file needs to be
         included.
  
! GCC 5.3
  
!    This is the [43]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 5.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
--- 919,927 ----
         make use of these builtins the vecintrin.h header file needs to be
         included.
  
!                                     GCC 5.3
  
!    This is the [42]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 5.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
*************** Target Specific Changes
*** 932,951 ****
         the GO runtime environment. GCC 5.3 has proven to be able to
         compile larger GO applications on IBM z Systems.
  
! GCC 5.4
  
!    This is the [44]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 5.4 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
! (Pending) GCC 5.5
  
!    This is the [45]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 5.5 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  
      For questions related to the use of GCC, please consult these web
      pages and the [46]GCC manuals. If that fails, the
--- 941,967 ----
         the GO runtime environment. GCC 5.3 has proven to be able to
         compile larger GO applications on IBM z Systems.
  
!                                     GCC 5.4
  
!    This is the [43]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 5.4 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
!                                     GCC 5.5
  
!    This is the [44]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 5.5 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
+ Target Specific Changes
+ 
+   IA-32/x86-64
+ 
+      * Support for the [45]deprecated pcommit instruction has been
+        removed.
+ 
  
      For questions related to the use of GCC, please consult these web
      pages and the [46]GCC manuals. If that fails, the
*************** GCC 5.4
*** 959,974 ****
     provided this notice is preserved.
  
     These pages are [51]maintained by the GCC team. Last modified
!    2016-06-03[52].
  
  References
  
     1. http://gcc.gnu.org/gcc-5/changes.html#libstdcxx
     2. https://gcc.gnu.org/onlinedocs/gcc/Spec-Files.html
     3. https://savannah.nongnu.org/bugs/?44574
!    4. https://gcc.gnu.org/wiki/Intel%20MPX%20support%20in%20the%20GCC%20compiler
!    5. http://www.openmp.org/mp-documents/OpenMP4.0.0.pdf
!    6. http://openmp.org/mp-documents/OpenMP4.0.0.Examples.pdf
     7. https://gcc.gnu.org/wiki/OpenACC
     8. https://gcc.gnu.org/install/configure.html
     9. https://www.cilkplus.org/
--- 975,990 ----
     provided this notice is preserved.
  
     These pages are [51]maintained by the GCC team. Last modified
!    2017-10-10[52].
  
  References
  
     1. http://gcc.gnu.org/gcc-5/changes.html#libstdcxx
     2. https://gcc.gnu.org/onlinedocs/gcc/Spec-Files.html
     3. https://savannah.nongnu.org/bugs/?44574
!    4. https://gcc.gnu.org/wiki/Intel MPX support in the GCC compiler
!    5. http://www.openmp.org/wp-content/uploads/OpenMP4.0.0.pdf
!    6. http://www.openmp.org/wp-content/uploads/OpenMP4.0.0.Examples.pdf
     7. https://gcc.gnu.org/wiki/OpenACC
     8. https://gcc.gnu.org/install/configure.html
     9. https://www.cilkplus.org/
*************** References
*** 1002,1013 ****
    37. https://gcc.gnu.org/onlinedocs/gcc-5.1.0/jit/intro/tutorial05.html
    38. https://gcc.gnu.org/onlinedocs/gcc/Spec-Files.html
    39. https://gcc.gnu.org/onlinedocs/gcc/Named-Address-Spaces.html
!   40. https://software.intel.com/sites/default/files/managed/0d/53/319433-023.pdf
!   41. https://software.intel.com/sites/default/files/managed/0d/53/319433-022.pdf
!   42. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=5.2
!   43. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=5.3
!   44. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=5.4
!   45. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=5.5
    46. https://gcc.gnu.org/onlinedocs/
    47. mailto:gcc-help@gcc.gnu.org
    48. mailto:gcc@gcc.gnu.org
--- 1018,1029 ----
    37. https://gcc.gnu.org/onlinedocs/gcc-5.1.0/jit/intro/tutorial05.html
    38. https://gcc.gnu.org/onlinedocs/gcc/Spec-Files.html
    39. https://gcc.gnu.org/onlinedocs/gcc/Named-Address-Spaces.html
!   40. https://software.intel.com/sites/default/files/managed/39/c5/325462-sdm-vol-1-2abcd-3abcd.pdf
!   41. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=5.2
!   42. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=5.3
!   43. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=5.4
!   44. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=5.5
!   45. https://software.intel.com/en-us/blogs/2016/09/12/deprecate-pcommit-instruction
    46. https://gcc.gnu.org/onlinedocs/
    47. mailto:gcc-help@gcc.gnu.org
    48. mailto:gcc@gcc.gnu.org
*************** References
*** 1017,1046 ****
    52. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.9/index.html
- 
                               GCC 4.9 Release Series
  
!    June 26, 2015
  
     The [1]GNU project and the GCC developers are pleased to announce the
!    release of GCC 4.9.3.
  
     This release is a bug-fix release, containing fixes for regressions in
!    GCC 4.9.2 relative to previous releases of GCC.
  
  Release History
  
     GCC 4.9.3
!           June 26, 2015 ([2]changes, [3]documentation)
  
     GCC 4.9.2
!           October 30, 2014 ([4]changes, [5]documentation)
  
     GCC 4.9.1
!           July 16, 2014 ([6]changes, [7]documentation)
  
     GCC 4.9.0
!           April 22, 2014 ([8]changes, [9]documentation)
  
  References and Acknowledgements
  
--- 1033,1066 ----
    52. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.9/index.html
                               GCC 4.9 Release Series
  
!    Aug 3, 2016
  
     The [1]GNU project and the GCC developers are pleased to announce the
!    release of GCC 4.9.4.
  
     This release is a bug-fix release, containing fixes for regressions in
!    GCC 4.9.3 relative to previous releases of GCC.
! 
!    This release series is no longer maintained.
  
  Release History
  
+    GCC 4.9.4
+           Aug 3, 2016 ([2]changes, [3]documentation)
+ 
     GCC 4.9.3
!           June 26, 2015 ([4]changes, [5]documentation)
  
     GCC 4.9.2
!           October 30, 2014 ([6]changes, [7]documentation)
  
     GCC 4.9.1
!           July 16, 2014 ([8]changes, [9]documentation)
  
     GCC 4.9.0
!           April 22, 2014 ([10]changes, [11]documentation)
  
  References and Acknowledgements
  
*************** References and Acknowledgements
*** 1048,1108 ****
     supports several other languages aside from C, it now stands for the
     GNU Compiler Collection.
  
!    A list of [10]successful builds is updated as new information becomes
     available.
  
     The GCC developers would like to thank the numerous people that have
     contributed new features, improvements, bug fixes, and other changes as
!    well as test results to GCC. This [11]amazing group of volunteers is
     what makes GCC successful.
  
!    For additional information about GCC please refer to the [12]GCC
!    project web site or contact the [13]GCC development mailing list.
  
!    To obtain GCC please use [14]our mirror sites or [15]our SVN server.
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [16]GCC manuals. If that fails, the
!     [17]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [18]gcc@gcc.gnu.org. All of [19]our lists have public
      archives.
  
!    Copyright (C) [20]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [21]maintained by the GCC team. Last modified
!    2016-01-30[22].
  
  References
  
     1. http://www.gnu.org/
     2. http://gcc.gnu.org/gcc-4.9/changes.html
!    3. http://gcc.gnu.org/onlinedocs/4.9.3/
     4. http://gcc.gnu.org/gcc-4.9/changes.html
!    5. http://gcc.gnu.org/onlinedocs/4.9.2/
     6. http://gcc.gnu.org/gcc-4.9/changes.html
!    7. http://gcc.gnu.org/onlinedocs/4.9.1/
     8. http://gcc.gnu.org/gcc-4.9/changes.html
!    9. https://gcc.gnu.org/onlinedocs/4.9.0/
!   10. http://gcc.gnu.org/gcc-4.9/buildstat.html
!   11. https://gcc.gnu.org/onlinedocs/gcc/Contributors.html
!   12. http://gcc.gnu.org/index.html
!   13. mailto:gcc@gcc.gnu.org
!   14. http://gcc.gnu.org/mirrors.html
!   15. http://gcc.gnu.org/svn.html
!   16. https://gcc.gnu.org/onlinedocs/
!   17. mailto:gcc-help@gcc.gnu.org
!   18. mailto:gcc@gcc.gnu.org
!   19. https://gcc.gnu.org/lists.html
!   20. http://www.fsf.org/
!   21. https://gcc.gnu.org/about.html
!   22. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.9/changes.html
- 
                               GCC 4.9 Release Series
                          Changes, New Features, and Fixes
  
--- 1068,1129 ----
     supports several other languages aside from C, it now stands for the
     GNU Compiler Collection.
  
!    A list of [12]successful builds is updated as new information becomes
     available.
  
     The GCC developers would like to thank the numerous people that have
     contributed new features, improvements, bug fixes, and other changes as
!    well as test results to GCC. This [13]amazing group of volunteers is
     what makes GCC successful.
  
!    For additional information about GCC please refer to the [14]GCC
!    project web site or contact the [15]GCC development mailing list.
  
!    To obtain GCC please use [16]our mirror sites or [17]our SVN server.
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [18]GCC manuals. If that fails, the
!     [19]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [20]gcc@gcc.gnu.org. All of [21]our lists have public
      archives.
  
!    Copyright (C) [22]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [23]maintained by the GCC team. Last modified
!    2016-09-30[24].
  
  References
  
     1. http://www.gnu.org/
     2. http://gcc.gnu.org/gcc-4.9/changes.html
!    3. http://gcc.gnu.org/onlinedocs/4.9.4/
     4. http://gcc.gnu.org/gcc-4.9/changes.html
!    5. http://gcc.gnu.org/onlinedocs/4.9.3/
     6. http://gcc.gnu.org/gcc-4.9/changes.html
!    7. http://gcc.gnu.org/onlinedocs/4.9.2/
     8. http://gcc.gnu.org/gcc-4.9/changes.html
!    9. http://gcc.gnu.org/onlinedocs/4.9.1/
!   10. http://gcc.gnu.org/gcc-4.9/changes.html
!   11. https://gcc.gnu.org/onlinedocs/4.9.0/
!   12. http://gcc.gnu.org/gcc-4.9/buildstat.html
!   13. https://gcc.gnu.org/onlinedocs/gcc/Contributors.html
!   14. http://gcc.gnu.org/index.html
!   15. mailto:gcc@gcc.gnu.org
!   16. http://gcc.gnu.org/mirrors.html
!   17. http://gcc.gnu.org/svn.html
!   18. https://gcc.gnu.org/onlinedocs/
!   19. mailto:gcc-help@gcc.gnu.org
!   20. mailto:gcc@gcc.gnu.org
!   21. https://gcc.gnu.org/lists.html
!   22. http://www.fsf.org/
!   23. https://gcc.gnu.org/about.html
!   24. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.9/changes.html
                               GCC 4.9 Release Series
                          Changes, New Features, and Fixes
  
*************** New Languages and Language specific impr
*** 1216,1236 ****
         -fdiagnostics-color=never.
         Sample diagnostics output:
      $ g++ -fdiagnostics-color=always -S -Wall test.C
!     test.C: In function `int foo()':
      test.C:1:14: warning: no return statement in function returning non-void [-W
  return-type]
       int foo () { }
                    ^
      test.C:2:46: error: template instantiation depth exceeds maximum of 900 (use
!  -ftemplate-depth= to increase the maximum) instantiating `struct X<100>'
       template <int N> struct X { static const int value = X<N-1>::value; }; temp
  late struct X<1000>;
                                                    ^
!     test.C:2:46:   recursively required from `const int X<999>::value'
!     test.C:2:46:   required from `const int X<1000>::value'
      test.C:2:88:   required from here
  
!     test.C:2:46: error: incomplete type `X<100>' used in nested name specifier
  
       * With the new [7]#pragma GCC ivdep, the user can assert that there
         are no loop-carried dependencies which would prevent concurrent
--- 1237,1257 ----
         -fdiagnostics-color=never.
         Sample diagnostics output:
      $ g++ -fdiagnostics-color=always -S -Wall test.C
!     test.C: In function â€˜int foo()â€™:
      test.C:1:14: warning: no return statement in function returning non-void [-W
  return-type]
       int foo () { }
                    ^
      test.C:2:46: error: template instantiation depth exceeds maximum of 900 (use
!  -ftemplate-depth= to increase the maximum) instantiating â€˜struct X<100>â€™
       template <int N> struct X { static const int value = X<N-1>::value; }; temp
  late struct X<1000>;
                                                    ^
!     test.C:2:46:   recursively required from â€˜const int X<999>::valueâ€™
!     test.C:2:46:   required from â€˜const int X<1000>::valueâ€™
      test.C:2:88:   required from here
  
!     test.C:2:46: error: incomplete type â€˜X<100>â€™ used in nested name specifier
  
       * With the new [7]#pragma GCC ivdep, the user can assert that there
         are no loop-carried dependencies which would prevent concurrent
*************** auto incr = [](auto x) { return x++; };
*** 1335,1345 ****
  // a functional object that will add two like-type objects
  auto add = [] <typename T> (T a, T b) { return a + b; };
  
!      * G++ supports unconstrained generic functions as specified by
!        S:4.1.2 and S:5.1.1 of [16]N3889: Concepts Lite Specification.
!        Briefly, auto may be used as a type-specifier in a parameter
!        declaration of any function declarator in order to introduce an
!        implicit function template parameter, akin to generic lambdas.
  
  // the following two function declarations are equivalent
  auto incr(auto x) { return x++; }
--- 1356,1366 ----
  // a functional object that will add two like-type objects
  auto add = [] <typename T> (T a, T b) { return a + b; };
  
!      * G++ supports unconstrained generic functions as specified by Â§4.1.2
!        and Â§5.1.1 of [16]N3889: Concepts Lite Specification. Briefly, auto
!        may be used as a type-specifier in a parameter declaration of any
!        function declarator in order to introduce an implicit function
!        template parameter, akin to generic lambdas.
  
  // the following two function declarations are equivalent
  auto incr(auto x) { return x++; }
*************** auto incr(T x) { return x++; }
*** 1429,1435 ****
         be used as argument to ISO_C_BINDING's C_LOC and as actual argument
         to another NO_ARG_CHECK dummy argument; also the other constraints
         of TYPE(*) apply. The dummy arguments should be declared as scalar
!        or assumed-size variable of type type(*) (recommended) - or of type
         integer, real, complex or logical. With NO_ARG_CHECK, a pointer to
         the data without further type or shape information is passed,
         similar to C's void*. Note that also TS 29113's
--- 1450,1456 ----
         be used as argument to ISO_C_BINDING's C_LOC and as actual argument
         to another NO_ARG_CHECK dummy argument; also the other constraints
         of TYPE(*) apply. The dummy arguments should be declared as scalar
!        or assumed-size variable of type type(*) (recommended) â€“ or of type
         integer, real, complex or logical. With NO_ARG_CHECK, a pointer to
         the data without further type or shape information is passed,
         similar to C's void*. Note that also TS 29113's
*************** New Targets and Target Specific Improvem
*** 1540,1545 ****
--- 1561,1572 ----
       * A number of code generation improvements for Thumb2 to reduce code
         size when compiling for the M-profile processors.
  
+   AVR
+ 
+      * A new command-line option -mfract-convert-truncate has been added.
+        It allows compiler to use truncation instead of rounding towards
+        zero for fractional fixed-point types.
+ 
    IA-32/x86-64
  
       * -mfpmath=sse is now implied by -ffast-math on all targets where
*************** GCC 4.9.1
*** 1669,1691 ****
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
!    Version 4.0 of the [26]OpenMP specification is supported even in
!    Fortran, not just C and C++.
  
  GCC 4.9.2
  
!    This is the [27]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.9.2 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.9.3
  
!    This is the [28]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.9.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  
      For questions related to the use of GCC, please consult these web
      pages and the [29]GCC manuals. If that fails, the
--- 1696,1725 ----
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
!    Version 4.0 of the OpenMP specification is supported even in Fortran,
!    not just C and C++.
  
  GCC 4.9.2
  
!    This is the [26]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.9.2 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.9.3
  
!    This is the [27]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.9.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
+ GCC 4.9.4
+ 
+    This is the [28]list of problem reports (PRs) from GCC's bug tracking
+    system that are known to be fixed in the 4.9.4 release. This list might
+    not be complete (that is, it is possible that some PRs that have been
+    fixed are not listed here).
+ 
  
      For questions related to the use of GCC, please consult these web
      pages and the [29]GCC manuals. If that fails, the
*************** GCC 4.9.3
*** 1699,1712 ****
     provided this notice is preserved.
  
     These pages are [34]maintained by the GCC team. Last modified
!    2016-01-30[35].
  
  References
  
     1. https://gcc.gnu.org/ml/gcc-patches/2013-05/msg00728.html
     2. https://gcc.gnu.org/PR60825
     3. https://gcc.gnu.org/gcc-4.9/porting_to.html
!    4. http://openmp.org/wp/openmp-specifications/
     5. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gcc/Optimize-Options.html#index-fsimd-cost-model-908
     6. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gcc/Language-Independent-Options.html#index-fdiagnostics-color-252
     7. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gcc/Loop-Specific-Pragmas.html
--- 1733,1746 ----
     provided this notice is preserved.
  
     These pages are [34]maintained by the GCC team. Last modified
!    2016-12-28[35].
  
  References
  
     1. https://gcc.gnu.org/ml/gcc-patches/2013-05/msg00728.html
     2. https://gcc.gnu.org/PR60825
     3. https://gcc.gnu.org/gcc-4.9/porting_to.html
!    4. http://www.openmp.org/specifications/
     5. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gcc/Optimize-Options.html#index-fsimd-cost-model-908
     6. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gcc/Language-Independent-Options.html#index-fdiagnostics-color-252
     7. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gcc/Loop-Specific-Pragmas.html
*************** References
*** 1728,1736 ****
    23. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gfortran/Debugging-Options.html
    24. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gcc/Function-Multiversioning.html
    25. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.9.1
!   26. http://openmp.org/wp/openmp-specifications/
!   27. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.9.2
!   28. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.9.3
    29. https://gcc.gnu.org/onlinedocs/
    30. mailto:gcc-help@gcc.gnu.org
    31. mailto:gcc@gcc.gnu.org
--- 1762,1770 ----
    23. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gfortran/Debugging-Options.html
    24. https://gcc.gnu.org/onlinedocs/gcc-4.9.2/gcc/Function-Multiversioning.html
    25. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.9.1
!   26. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.9.2
!   27. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.9.3
!   28. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.9.4
    29. https://gcc.gnu.org/onlinedocs/
    30. mailto:gcc-help@gcc.gnu.org
    31. mailto:gcc@gcc.gnu.org
*************** References
*** 1740,1746 ****
    35. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.8/index.html
- 
                               GCC 4.8 Release Series
  
     June 23, 2015
--- 1774,1779 ----
*************** http://gcc.gnu.org/gcc-4.8/index.html
*** 1751,1756 ****
--- 1784,1791 ----
     This release is a bug-fix release, containing fixes for regressions in
     GCC 4.8.4 relative to previous releases of GCC.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 4.8.5
*************** References and Acknowledgements
*** 1803,1809 ****
     provided this notice is preserved.
  
     These pages are [25]maintained by the GCC team. Last modified
!    2016-01-30[26].
  
  References
  
--- 1838,1844 ----
     provided this notice is preserved.
  
     These pages are [25]maintained by the GCC team. Last modified
!    2016-09-30[26].
  
  References
  
*************** References
*** 1835,1841 ****
    26. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.8/changes.html
- 
                               GCC 4.8 Release Series
                          Changes, New Features, and Fixes
  
--- 1870,1875 ----
*************** New Languages and Language specific impr
*** 1964,1971 ****
         diagnostics. Combined with the caret information, an example
         diagnostic showing these two features is:
  
! t.c:1:94: error: invalid operands to binary < (have `struct mystruct' and `float
! ')
   #define MYMAX(A,B)    __extension__ ({ __typeof__(A) __a = (A); __typeof__(B) _
  _b = (B); __a < __b ? __b : __a; })
  
--- 1998,2005 ----
         diagnostics. Combined with the caret information, an example
         diagnostic showing these two features is:
  
! t.c:1:94: error: invalid operands to binary < (have â€˜struct mystructâ€™ and â€˜float
! â€™)
   #define MYMAX(A,B)    __extension__ ({ __typeof__(A) __a = (A); __typeof__(B) _
  _b = (B); __a < __b ? __b : __a; })
  
*************** int i = A().f();  // error, f() requires
*** 2089,2096 ****
              older versions except as noted below.
            + ABI: Some internal names (used in the assembler/object file)
              have changed for symbols declared in the specification part of
!             a module. If an affected module - or a file using it via use
!             association - is recompiled, the module and all files which
              directly use such symbols have to be recompiled as well. This
              change only affects the following kind of module symbols:
                 o Procedure pointers. Note: C-interoperable function
--- 2123,2130 ----
              older versions except as noted below.
            + ABI: Some internal names (used in the assembler/object file)
              have changed for symbols declared in the specification part of
!             a module. If an affected module â€“ or a file using it via use
!             association â€“ is recompiled, the module and all files which
              directly use such symbols have to be recompiled as well. This
              change only affects the following kind of module symbols:
                 o Procedure pointers. Note: C-interoperable function
*************** int i = A().f();  // error, f() requires
*** 2117,2123 ****
       * The [21]-Wcompare-reals command-line option has been added. When
         this is set, warnings are issued when comparing REAL or COMPLEX
         types for equality and inequality; consider replacing a == b by
!        abs(a -b) < eps with a suitable eps. -Wcompare-reals is enabled by
         -Wextra.
       * The [22]-Wtarget-lifetime command-line option has been added
         (enabled with -Wall), which warns if the pointer in a pointer
--- 2151,2157 ----
       * The [21]-Wcompare-reals command-line option has been added. When
         this is set, warnings are issued when comparing REAL or COMPLEX
         types for equality and inequality; consider replacing a == b by
!        abs(aâˆ’b) < eps with a suitable eps. -Wcompare-reals is enabled by
         -Wextra.
       * The [22]-Wtarget-lifetime command-line option has been added
         (enabled with -Wall), which warns if the pointer in a pointer
*************** int i = A().f();  // error, f() requires
*** 2129,2135 ****
         4.0e0).
         (For Fortran source code, consider replacing the "q" in
         floating-point literals by a kind parameter (e.g. 4.0e0_qp with a
!        suitable qp). Note that - in Fortran source code - replacing "q" by
         a simple "e" is not equivalent.)
       * The GFORTRAN_TMPDIR environment variable for specifying a
         non-default directory for files opened with STATUS="SCRATCH", is
--- 2163,2169 ----
         4.0e0).
         (For Fortran source code, consider replacing the "q" in
         floating-point literals by a kind parameter (e.g. 4.0e0_qp with a
!        suitable qp). Note that â€“ in Fortran source code â€“ replacing "q" by
         a simple "e" is not equivalent.)
       * The GFORTRAN_TMPDIR environment variable for specifying a
         non-default directory for files opened with STATUS="SCRATCH", is
*************** New Targets and Target Specific Improvem
*** 2224,2231 ****
      }
         The inline assembler in this example will generate code like
      mov r24, 8+7
!        provided c is allocated to R24 and val is allocated to R8...R15.
!        This works because the GNU assembler accepts plain register numbers
         without register prefix.
       * Static initializers with 3-byte symbols are supported now:
      extern const __memx char foo;
--- 2258,2265 ----
      }
         The inline assembler in this example will generate code like
      mov r24, 8+7
!        provided c is allocated to R24 and val is allocated to R8â€¦R15. This
!        works because the GNU assembler accepts plain register numbers
         without register prefix.
       * Static initializers with 3-byte symbols are supported now:
      extern const __memx char foo;
*************** New Targets and Target Specific Improvem
*** 2476,2481 ****
--- 2510,2520 ----
  
  Operating Systems
  
+   OpenBSD
+ 
+      * Support for OpenBSD/amd64 (x86_64-*-openbsd*) has been added and
+        support for OpenBSD/i386 (i386-*-openbsd*) has been rejuvenated.
+ 
    Windows (Cygwin)
  
       * Executables are now linked against shared libgcc by default. The
*************** GCC 4.8.5
*** 2554,2560 ****
     provided this notice is preserved.
  
     These pages are [43]maintained by the GCC team. Last modified
!    2016-05-28[44].
  
  References
  
--- 2593,2599 ----
     provided this notice is preserved.
  
     These pages are [43]maintained by the GCC team. Last modified
!    2017-02-27[44].
  
  References
  
*************** References
*** 2583,2589 ****
    23. https://gcc.gnu.org/onlinedocs/gfortran/TMPDIR.html
    24. https://gcc.gnu.org/wiki/Fortran2003Status
    25. https://gcc.gnu.org/wiki/TS29113Status
!   26. https://gcc.gnu.org/viewcvs/trunk/libgfortran/libgfortran.h?content-type=text%2Fplain&view=co
    27. http://chasm-interop.sourceforge.net/
    28. https://gcc.gnu.org/wiki/avr-gcc#Fixed-Point_Support
    29. https://gcc.gnu.org/onlinedocs/gcc/Fixed-Point.html
--- 2622,2628 ----
    23. https://gcc.gnu.org/onlinedocs/gfortran/TMPDIR.html
    24. https://gcc.gnu.org/wiki/Fortran2003Status
    25. https://gcc.gnu.org/wiki/TS29113Status
!   26. https://gcc.gnu.org/viewcvs/trunk/libgfortran/libgfortran.h?content-type=text/plain&view=co
    27. http://chasm-interop.sourceforge.net/
    28. https://gcc.gnu.org/wiki/avr-gcc#Fixed-Point_Support
    29. https://gcc.gnu.org/onlinedocs/gcc/Fixed-Point.html
*************** References
*** 2604,2610 ****
    44. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.7/index.html
- 
                               GCC 4.7 Release Series
  
     June 12, 2014
--- 2643,2648 ----
*************** http://gcc.gnu.org/gcc-4.7/index.html
*** 2615,2620 ****
--- 2653,2660 ----
     This release is a bug-fix release, containing fixes for regressions in
     GCC 4.7.3 relative to previous releases of GCC.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 4.7.4
*************** References and Acknowledgements
*** 2664,2670 ****
     provided this notice is preserved.
  
     These pages are [23]maintained by the GCC team. Last modified
!    2016-01-30[24].
  
  References
  
--- 2704,2710 ----
     provided this notice is preserved.
  
     These pages are [23]maintained by the GCC team. Last modified
!    2016-09-30[24].
  
  References
  
*************** References
*** 2694,2700 ****
    24. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.7/changes.html
- 
                               GCC 4.7 Release Series
                          Changes, New Features, and Fixes
  
--- 2734,2739 ----
*************** long double pi = 180.0_degrees;
*** 3025,3031 ****
  template <class T> using Ptr = T*;
  Ptr<int> ip;  // decltype(ip) is int*
  
!      * Thanks to Ville Voutilainen and Pedro Lamarao, G++ now implements
         [13]C++11 delegating constructors.
  
  struct A {
--- 3064,3070 ----
  template <class T> using Ptr = T*;
  Ptr<int> ip;  // decltype(ip) is int*
  
!      * Thanks to Ville Voutilainen and Pedro LamarÃ£o, G++ now implements
         [13]C++11 delegating constructors.
  
  struct A {
*************** New Targets and Target Specific Improvem
*** 3219,3225 ****
  
       * GCC now supports the XMEGA architecture. This requires GNU binutils
         2.22 or later.
!      * Support for the [36]named address spaces __flash, __flash1, ...,
         __flash5 and __memx has been added. These address spaces locate
         read-only data in flash memory and allow reading from flash memory
         by means of ordinary C code, i.e. without the need of (inline)
--- 3258,3264 ----
  
       * GCC now supports the XMEGA architecture. This requires GNU binutils
         2.22 or later.
!      * Support for the [36]named address spaces __flash, __flash1, â€¦,
         __flash5 and __memx has been added. These address spaces locate
         read-only data in flash memory and allow reading from flash memory
         by means of ordinary C code, i.e. without the need of (inline)
*************** int add_values (const __flash int *p, in
*** 3245,3252 ****
       * New command-line options -maccumulate-args, -mbranch-cost=cost and
         -mstrict-X were added to allow better fine-tuning of code
         optimization.
!      * The command option -fdata-sections now also takes affect on the
!        section names of variables with the progmem attribute.
       * A new inline assembler print modifier %i to print a RAM address as
         I/O address has been added:
  
--- 3284,3291 ----
       * New command-line options -maccumulate-args, -mbranch-cost=cost and
         -mstrict-X were added to allow better fine-tuning of code
         optimization.
!      * The command-line option -fdata-sections now also takes affect on
!        the section names of variables with the progmem attribute.
       * A new inline assembler print modifier %i to print a RAM address as
         I/O address has been added:
  
*************** void set_portb (uint8_t value)
*** 3263,3269 ****
         suitable to be used as operand in an I/O command. The address must
         be a constant integer known at compile time.
       * The inline assembler constraint "R" to represent integers in the
!        range -6 ... 5 has been removed without replacement.
       * Many optimizations to:
            + 64-bit integer arithmetic
            + Widening multiplication
--- 3302,3308 ----
         suitable to be used as operand in an I/O command. The address must
         be a constant integer known at compile time.
       * The inline assembler constraint "R" to represent integers in the
!        range âˆ’6 â€¦ 5 has been removed without replacement.
       * Many optimizations to:
            + 64-bit integer arithmetic
            + Widening multiplication
*************** void set_portb (uint8_t value)
*** 3275,3281 ****
            + If-else decision trees generated by switch instructions
            + Merging of data located in flash memory
            + New libgcc variants for devices with 8-bit wide stack pointer
!           + ...
       * Better documentation:
            + Handling of EIND and indirect jumps on devices with more than
              128 KiB of program memory.
--- 3314,3320 ----
            + If-else decision trees generated by switch instructions
            + Merging of data located in flash memory
            + New libgcc variants for devices with 8-bit wide stack pointer
!           + â€¦
       * Better documentation:
            + Handling of EIND and indirect jumps on devices with more than
              128 KiB of program memory.
*************** GCC 4.7.4
*** 3486,3492 ****
     provided this notice is preserved.
  
     These pages are [55]maintained by the GCC team. Last modified
!    2016-02-29[56].
  
  References
  
--- 3525,3531 ----
     provided this notice is preserved.
  
     These pages are [55]maintained by the GCC team. Last modified
!    2017-03-03[56].
  
  References
  
*************** References
*** 3494,3500 ****
     2. http://savannah.nongnu.org/bugs/?35407
     3. https://gcc.gnu.org/PR18145
     4. https://gcc.gnu.org/gcc-4.7/porting_to.html
!    5. http://openmp.org/wp/openmp-specifications/
     6. https://gcc.gnu.org/wiki/TransactionalMemory
     7. https://gcc.gnu.org/wiki/Atomic/GCCMM
     8. http://gcc.gnu.org/gcc-4.7/cxx0x_status.html
--- 3533,3539 ----
     2. http://savannah.nongnu.org/bugs/?35407
     3. https://gcc.gnu.org/PR18145
     4. https://gcc.gnu.org/gcc-4.7/porting_to.html
!    5. http://www.openmp.org/specifications/
     6. https://gcc.gnu.org/wiki/TransactionalMemory
     7. https://gcc.gnu.org/wiki/Atomic/GCCMM
     8. http://gcc.gnu.org/gcc-4.7/cxx0x_status.html
*************** References
*** 3515,3521 ****
    23. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gfortran/Code-Gen-Options.html#index-g_t_0040code_007bfaggressive-function-elimination_007d-270
    24. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gfortran/Error-and-Warning-Options.html#index-g_t_0040code_007bWreal-q-constant_007d-149
    25. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gfortran/SELECTED_005fREAL_005fKIND.html
!   26. https://msdn.microsoft.com/en-us/library/bb787181%28v=vs.85%29.aspx
    27. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gfortran/Debugging-Options.html#index-g_t_0040code_007bfno-backtrace_007d-183
    28. https://gcc.gnu.org/wiki/Fortran2003Status
    29. https://gcc.gnu.org/wiki/OOP
--- 3554,3560 ----
    23. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gfortran/Code-Gen-Options.html#index-g_t_0040code_007bfaggressive-function-elimination_007d-270
    24. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gfortran/Error-and-Warning-Options.html#index-g_t_0040code_007bWreal-q-constant_007d-149
    25. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gfortran/SELECTED_005fREAL_005fKIND.html
!   26. https://msdn.microsoft.com/en-us/library/bb787181(v=vs.85).aspx
    27. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gfortran/Debugging-Options.html#index-g_t_0040code_007bfno-backtrace_007d-183
    28. https://gcc.gnu.org/wiki/Fortran2003Status
    29. https://gcc.gnu.org/wiki/OOP
*************** References
*** 3528,3538 ****
    36. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gcc/Named-Address-Spaces.html
    37. http://nongnu.org/avr-libc/
    38. https://gcc.gnu.org/PR54461
!   39. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gcc/AVR-Built%5f002din-Functions.html
    40. https://sites.google.com/site/x32abi/
    41. http://www.dwarfstd.org/ShowIssue.php?issue=100909.1
    42. http://www.dwarfstd.org/ShowIssue.php?issue=100909.2
!   43. http://www.dwarfstd.org/doc/040408.1.html
    44. http://www.dwarfstd.org/ShowIssue.php?issue=110722.1
    45. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.7.1
    46. https://golang.org/doc/go1
--- 3567,3577 ----
    36. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gcc/Named-Address-Spaces.html
    37. http://nongnu.org/avr-libc/
    38. https://gcc.gnu.org/PR54461
!   39. https://gcc.gnu.org/onlinedocs/gcc-4.7.1/gcc/AVR-Built_002din-Functions.html
    40. https://sites.google.com/site/x32abi/
    41. http://www.dwarfstd.org/ShowIssue.php?issue=100909.1
    42. http://www.dwarfstd.org/ShowIssue.php?issue=100909.2
!   43. http://www.dwarfstd.org/ShowIssue.php?issue=140425.1
    44. http://www.dwarfstd.org/ShowIssue.php?issue=110722.1
    45. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.7.1
    46. https://golang.org/doc/go1
*************** References
*** 3548,3554 ****
    56. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.6/index.html
- 
                               GCC 4.6 Release Series
  
     April 12, 2013
--- 3587,3592 ----
*************** http://gcc.gnu.org/gcc-4.6/index.html
*** 3559,3564 ****
--- 3597,3604 ----
     This release is a bug-fix release, containing fixes for regressions in
     GCC 4.6.3 relative to previous releases of GCC.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 4.6.4
*************** References and Acknowledgements
*** 3608,3614 ****
     provided this notice is preserved.
  
     These pages are [23]maintained by the GCC team. Last modified
!    2016-01-30[24].
  
  References
  
--- 3648,3654 ----
     provided this notice is preserved.
  
     These pages are [23]maintained by the GCC team. Last modified
!    2016-09-30[24].
  
  References
  
*************** References
*** 3638,3644 ****
    24. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.6/changes.html
- 
                               GCC 4.6 Release Series
                          Changes, New Features, and Fixes
  
--- 3678,3683 ----
*************** General Optimizer Improvements
*** 3755,3761 ****
                   the Gold linker on ELF targets. Plugin support of the
                   Apple linker on Darwin is not compatible with GCC. The
                   linker plugin can also be controlled by the
!                  -fuse-linker-plugin command line option.
                 o Resolution information from the linker plugin is used to
                   drive whole program assumptions. Use of the linker plugin
                   results in more aggressive optimization on binaries and
--- 3794,3800 ----
                   the Gold linker on ELF targets. Plugin support of the
                   Apple linker on Darwin is not compatible with GCC. The
                   linker plugin can also be controlled by the
!                  -fuse-linker-plugin command-line option.
                 o Resolution information from the linker plugin is used to
                   drive whole program assumptions. Use of the linker plugin
                   results in more aggressive optimization on binaries and
*************** New Languages and Language specific impr
*** 3882,3888 ****
  #pragma GCC diagnostic pop
    foo(c);                       /* error is given for this one */
  #pragma GCC diagnostic pop
!   foo(d);                       /* depends on command line options */
  
       * The -fmax-errors=N option is now supported. Using this option
         causes the compiler to exit after N errors have been issued.
--- 3921,3927 ----
  #pragma GCC diagnostic pop
    foo(c);                       /* error is given for this one */
  #pragma GCC diagnostic pop
!   foo(d);                       /* depends on command-line options */
  
       * The -fmax-errors=N option is now supported. Using this option
         causes the compiler to exit after N errors have been issued.
*************** New Languages and Language specific impr
*** 3978,3984 ****
  
       * [12]Improved experimental support for the upcoming ISO C++
         standard, C++0x, including using constexpr and nullptr.
!      * Performance improvements to the [13]Debug Mode, thanks to Franc,ois
         Dumont.
       * Atomic operations used for reference-counting are annotated so that
         they can be understood by race detectors such as Helgrind, see
--- 4017,4023 ----
  
       * [12]Improved experimental support for the upcoming ISO C++
         standard, C++0x, including using constexpr and nullptr.
!      * Performance improvements to the [13]Debug Mode, thanks to FranÃ§ois
         Dumont.
       * Atomic operations used for reference-counting are annotated so that
         they can be understood by race detectors such as Helgrind, see
*************** New Languages and Language specific impr
*** 4033,4039 ****
              allocated (if unallocated) or reallocated (if the shape or
              type parameter is different). To avoid the small performance
              penalty, you can use a(:) = ... instead of a = ... for arrays
!             and character strings - or disable the feature using -std=f95
              or -fno-realloc-lhs.
            + Deferred type parameter: For scalar allocatable and pointer
              variables the character length can be deferred.
--- 4072,4078 ----
              allocated (if unallocated) or reallocated (if the shape or
              type parameter is different). To avoid the small performance
              penalty, you can use a(:) = ... instead of a = ... for arrays
!             and character strings â€“ or disable the feature using -std=f95
              or -fno-realloc-lhs.
            + Deferred type parameter: For scalar allocatable and pointer
              variables the character length can be deferred.
*************** New Languages and Language specific impr
*** 4088,4094 ****
              be declared in a single PROCEDURE statement; implied-shape
              arrays are supported for named constants (PARAMETER). The
              transformational, three argument versions of BESSEL_JN and
!             BESSEL_YN were added - the elemental, two-argument version had
              been added in GCC 4.4; note that the transformational
              functions use a recurrence algorithm.
  
--- 4127,4133 ----
              be declared in a single PROCEDURE statement; implied-shape
              arrays are supported for named constants (PARAMETER). The
              transformational, three argument versions of BESSEL_JN and
!             BESSEL_YN were added â€“ the elemental, two-argument version had
              been added in GCC 4.4; note that the transformational
              functions use a recurrence algorithm.
  
*************** New Targets and Target Specific Improvem
*** 4368,4374 ****
         callee for functions taking parameters with sub-word size in 32-bit
         mode, since this is redundant with the specification of the ABI.
         GCC has never done so in 64-bit mode since this is also redundant.
!      * The command line option -mfix-at697f has been added to enable the
         documented workaround for the single erratum of the Atmel AT697F
         processor.
  
--- 4407,4413 ----
         callee for functions taking parameters with sub-word size in 32-bit
         mode, since this is redundant with the specification of the ABI.
         GCC has never done so in 64-bit mode since this is also redundant.
!      * The command-line option -mfix-at697f has been added to enable the
         documented workaround for the single erratum of the Atmel AT697F
         processor.
  
*************** GCC 4.6.4
*** 4533,4539 ****
     provided this notice is preserved.
  
     These pages are [29]maintained by the GCC team. Last modified
!    2016-05-28[30].
  
  References
  
--- 4572,4578 ----
     provided this notice is preserved.
  
     These pages are [29]maintained by the GCC team. Last modified
!    2016-11-27[30].
  
  References
  
*************** References
*** 4569,4575 ****
    30. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.5/index.html
- 
                               GCC 4.5 Release Series
  
     Jul 2, 2012
--- 4608,4613 ----
*************** http://gcc.gnu.org/gcc-4.5/index.html
*** 4580,4585 ****
--- 4618,4625 ----
     This release is a bug-fix release, containing fixes for regressions in
     GCC 4.5.3 relative to previous releases of GCC.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 4.5.4
*************** References and Acknowledgements
*** 4629,4635 ****
     provided this notice is preserved.
  
     These pages are [18]maintained by the GCC team. Last modified
!    2016-01-30[19].
  
  References
  
--- 4669,4675 ----
     provided this notice is preserved.
  
     These pages are [18]maintained by the GCC team. Last modified
!    2016-09-30[19].
  
  References
  
*************** References
*** 4654,4660 ****
    19. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.5/changes.html
- 
                               GCC 4.5 Release Series
                          Changes, New Features, and Fixes
  
--- 4694,4699 ----
*************** Caveats
*** 4696,4702 ****
         epilogue unwind info is emitted unconditionally whenever unwind
         info is emitted.
       * On x86 targets, code containing floating-point calculations may run
!        significantly slower when compiled with GCC 4.5 in strict C99
         conformance mode than they did with earlier GCC versions. This is
         due to stricter standard conformance of the compiler and can be
         avoided by using the option -fexcess-precision=fast; also see
--- 4735,4741 ----
         epilogue unwind info is emitted unconditionally whenever unwind
         info is emitted.
       * On x86 targets, code containing floating-point calculations may run
!        significantly more slowly when compiled with GCC 4.5 in strict C99
         conformance mode than they did with earlier GCC versions. This is
         due to stricter standard conformance of the compiler and can be
         avoided by using the option -fexcess-precision=fast; also see
*************** New Languages and Language specific impr
*** 4891,4897 ****
         defined ([13]DR 757).
       * Labels may now have attributes, as has been permitted for a while
         in C. This is only permitted when the label definition and the
!        attribute specifier is followed by a semicolon--i.e., the label
         applies to an empty statement. The only useful attribute for a
         label is unused.
       * G++ now implements [14]DR 176. Previously G++ did not support using
--- 4930,4936 ----
         defined ([13]DR 757).
       * Labels may now have attributes, as has been permitted for a while
         in C. This is only permitted when the label definition and the
!        attribute specifier is followed by a semicolonâ€”i.e., the label
         applies to an empty statement. The only useful attribute for a
         label is unused.
       * G++ now implements [14]DR 176. Previously G++ did not support using
*************** vector-size: improvement = 3: call stack
*** 4973,4979 ****
  
    Fortran
  
!      * The COMMON default padding has been changed - instead of adding the
         padding before a variable it is now added afterwards, which
         increases the compatibility with other vendors and helps to obtain
         the correct output in some cases. Cf. also the -falign-commons
--- 5012,5018 ----
  
    Fortran
  
!      * The COMMON default padding has been changed â€“ instead of adding the
         padding before a variable it is now added afterwards, which
         increases the compatibility with other vendors and helps to obtain
         the correct output in some cases. Cf. also the -falign-commons
*************** GCC 4.5.4
*** 5302,5308 ****
     provided this notice is preserved.
  
     These pages are [33]maintained by the GCC team. Last modified
!    2016-05-28[34].
  
  References
  
--- 5341,5347 ----
     provided this notice is preserved.
  
     These pages are [33]maintained by the GCC team. Last modified
!    2017-02-28[34].
  
  References
  
*************** References
*** 5342,5348 ****
    34. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.4/index.html
- 
                               GCC 4.4 Release Series
  
     March 13, 2012
--- 5381,5386 ----
*************** http://gcc.gnu.org/gcc-4.4/index.html
*** 5353,5358 ****
--- 5391,5398 ----
     This release is a bug-fix release, containing fixes for regressions in
     GCC 4.4.6 relative to previous releases of GCC.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 4.4.7
*************** References and Acknowledgements
*** 5411,5417 ****
     provided this notice is preserved.
  
     These pages are [21]maintained by the GCC team. Last modified
!    2016-01-30[22].
  
  References
  
--- 5451,5457 ----
     provided this notice is preserved.
  
     These pages are [21]maintained by the GCC team. Last modified
!    2016-09-30[22].
  
  References
  
*************** References
*** 5439,5445 ****
    22. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.4/changes.html
- 
                               GCC 4.4 Release Series
                          Changes, New Features, and Fixes
  
--- 5479,5484 ----
*************** New warning options
*** 5655,5663 ****
  
  New Languages and Language specific improvements
  
!      * Version 3.0 of the [5]OpenMP specification is now supported for the
!        C, C++, and Fortran compilers.
!      * New character data types, per [6]TR 19769: New character types in
         C, are now supported for the C compiler in -std=gnu99 mode, as
         __CHAR16_TYPE__ and __CHAR32_TYPE__, and for the C++ compiler in
         -std=c++0x and -std=gnu++0x modes, as char16_t and char32_t too.
--- 5694,5702 ----
  
  New Languages and Language specific improvements
  
!      * Version 3.0 of the OpenMP specification is now supported for the C,
!        C++, and Fortran compilers.
!      * New character data types, per [5]TR 19769: New character types in
         C, are now supported for the C compiler in -std=gnu99 mode, as
         __CHAR16_TYPE__ and __CHAR32_TYPE__, and for the C++ compiler in
         -std=c++0x and -std=gnu++0x modes, as char16_t and char32_t too.
*************** New Languages and Language specific impr
*** 5686,5692 ****
  
    C++
  
!      * [7]Improved experimental support for the upcoming ISO C++ standard,
         C++0x. Including support for auto, inline namespaces, generalized
         initializer lists, defaulted and deleted functions, new character
         types, and scoped enums.
--- 5725,5731 ----
  
    C++
  
!      * [6]Improved experimental support for the upcoming ISO C++ standard,
         C++0x. Including support for auto, inline namespaces, generalized
         initializer lists, defaulted and deleted functions, new character
         types, and scoped enums.
*************** New Languages and Language specific impr
*** 5726,5737 ****
    Fortran
  
       * GNU Fortran now employs libcpp directly instead of using cc1 as an
!        external preprocessor. The [8]-cpp option was added to allow manual
         invocation of the preprocessor without relying on filename
         extensions.
!      * The [9]-Warray-temporaries option warns about array temporaries
         generated by the compiler, as an aid to optimization.
!      * The [10]-fcheck-array-temporaries option has been added, printing a
         notification at run time, when an array temporary had to be created
         for an function argument. Contrary to -Warray-temporaries the
         warning is only printed if the array is noncontiguous.
--- 5765,5776 ----
    Fortran
  
       * GNU Fortran now employs libcpp directly instead of using cc1 as an
!        external preprocessor. The [7]-cpp option was added to allow manual
         invocation of the preprocessor without relying on filename
         extensions.
!      * The [8]-Warray-temporaries option warns about array temporaries
         generated by the compiler, as an aid to optimization.
!      * The [9]-fcheck-array-temporaries option has been added, printing a
         notification at run time, when an array temporary had to be created
         for an function argument. Contrary to -Warray-temporaries the
         warning is only printed if the array is noncontiguous.
*************** New Languages and Language specific impr
*** 5753,5759 ****
       * Fortran 2003 support has been extended:
            + Wide characters (ISO 10646, UCS-4, kind=4) and UTF-8 I/O is
              now supported (except internal reads from/writes to wide
!             strings). [11]-fbackslash now supports also \unnnn and
              \Unnnnnnnn to enter Unicode characters.
            + Asynchronous I/O (implemented as synchronous I/O) and the
              decimal=, size=, sign=, pad=, blank=, and delim= specifiers
--- 5792,5798 ----
       * Fortran 2003 support has been extended:
            + Wide characters (ISO 10646, UCS-4, kind=4) and UTF-8 I/O is
              now supported (except internal reads from/writes to wide
!             strings). [10]-fbackslash now supports also \unnnn and
              \Unnnnnnnn to enter Unicode characters.
            + Asynchronous I/O (implemented as synchronous I/O) and the
              decimal=, size=, sign=, pad=, blank=, and delim= specifiers
*************** Other significant improvements
*** 5982,6048 ****
  
  GCC 4.4.1
  
!    This is the [12]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.1 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.2
  
!    This is the [13]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.2 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.3
  
!    This is the [14]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.4
  
!    This is the [15]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.4 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.5
  
!    This is the [16]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.5 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.6
  
!    This is the [17]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.6 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.7
  
!    This is the [18]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.7 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [19]GCC manuals. If that fails, the
!     [20]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [21]gcc@gcc.gnu.org. All of [22]our lists have public
      archives.
  
!    Copyright (C) [23]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [24]maintained by the GCC team. Last modified
!    2016-01-30[25].
  
  References
  
--- 6021,6087 ----
  
  GCC 4.4.1
  
!    This is the [11]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.1 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.2
  
!    This is the [12]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.2 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.3
  
!    This is the [13]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.4
  
!    This is the [14]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.4 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.5
  
!    This is the [15]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.5 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.6
  
!    This is the [16]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.6 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.4.7
  
!    This is the [17]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.4.7 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [18]GCC manuals. If that fails, the
!     [19]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [20]gcc@gcc.gnu.org. All of [21]our lists have public
      archives.
  
!    Copyright (C) [22]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [23]maintained by the GCC team. Last modified
!    2016-12-28[24].
  
  References
  
*************** References
*** 6050,6079 ****
     2. http://gcc.gnu.org/gcc-4.3/changes.html#obsoleted
     3. http://gcc.gnu.org/gcc-4.4/porting_to.html
     4. https://gcc.gnu.org/wiki/Graphite
!    5. http://openmp.org/wp/openmp-specifications/
!    6. http://www.open-std.org/jtc1/sc22/wg14/www/docs/n1040.pdf
!    7. http://gcc.gnu.org/gcc-4.4/cxx0x_status.html
!    8. https://gcc.gnu.org/onlinedocs/gfortran/Preprocessing-Options.html
!    9. https://gcc.gnu.org/onlinedocs/gfortran/Error-and-Warning-Options.html#index-g_t_0040code_007bWarray-temporaries_007d-125
!   10. https://gcc.gnu.org/onlinedocs/gfortran/Code-Gen-Options.html#index-g_t_0040code_007bfcheck-array-temporaries_007d-221
!   11. https://gcc.gnu.org/onlinedocs/gfortran/Fortran-Dialect-Options.html#index-g_t_0040code_007bbackslash_007d-34
!   12. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.1
!   13. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.2
!   14. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.3
!   15. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.4
!   16. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.5
!   17. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.6
!   18. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.7
!   19. https://gcc.gnu.org/onlinedocs/
!   20. mailto:gcc-help@gcc.gnu.org
!   21. mailto:gcc@gcc.gnu.org
!   22. https://gcc.gnu.org/lists.html
!   23. http://www.fsf.org/
!   24. https://gcc.gnu.org/about.html
!   25. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.3/index.html
- 
                               GCC 4.3 Release Series
  
     Jun 27, 2011
--- 6089,6116 ----
     2. http://gcc.gnu.org/gcc-4.3/changes.html#obsoleted
     3. http://gcc.gnu.org/gcc-4.4/porting_to.html
     4. https://gcc.gnu.org/wiki/Graphite
!    5. http://www.open-std.org/jtc1/sc22/wg14/www/docs/n1040.pdf
!    6. http://gcc.gnu.org/gcc-4.4/cxx0x_status.html
!    7. https://gcc.gnu.org/onlinedocs/gfortran/Preprocessing-Options.html
!    8. https://gcc.gnu.org/onlinedocs/gfortran/Error-and-Warning-Options.html#index-g_t_0040code_007bWarray-temporaries_007d-125
!    9. https://gcc.gnu.org/onlinedocs/gfortran/Code-Gen-Options.html#index-g_t_0040code_007bfcheck-array-temporaries_007d-221
!   10. https://gcc.gnu.org/onlinedocs/gfortran/Fortran-Dialect-Options.html#index-g_t_0040code_007bbackslash_007d-34
!   11. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.1
!   12. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.2
!   13. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.3
!   14. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.4
!   15. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.5
!   16. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.6
!   17. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.4.7
!   18. https://gcc.gnu.org/onlinedocs/
!   19. mailto:gcc-help@gcc.gnu.org
!   20. mailto:gcc@gcc.gnu.org
!   21. https://gcc.gnu.org/lists.html
!   22. http://www.fsf.org/
!   23. https://gcc.gnu.org/about.html
!   24. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.3/index.html
                               GCC 4.3 Release Series
  
     Jun 27, 2011
*************** http://gcc.gnu.org/gcc-4.3/index.html
*** 6084,6089 ****
--- 6121,6128 ----
     This release is a bug-fix release, containing fixes for regressions in
     GCC 4.3.5 relative to previous releases of GCC.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 4.3.6
*************** References and Acknowledgements
*** 6139,6145 ****
     provided this notice is preserved.
  
     These pages are [20]maintained by the GCC team. Last modified
!    2016-01-30[21].
  
  References
  
--- 6178,6184 ----
     provided this notice is preserved.
  
     These pages are [20]maintained by the GCC team. Last modified
!    2016-09-30[21].
  
  References
  
*************** References
*** 6166,6172 ****
    21. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.3/changes.html
- 
                               GCC 4.3 Release Series
                          Changes, New Features, and Fixes
  
--- 6205,6210 ----
*************** New Languages and Language specific impr
*** 6415,6428 ****
  
       * [13]Experimental support for the upcoming ISO C++ standard, C++0x.
       * Support for TR1 mathematical special functions and regular
!        expressions. ([14]Implementation status of TR1)
       * Default what implementations give more elaborate exception strings
         for bad_cast, bad_typeid, bad_exception, and bad_alloc.
       * Header dependencies have been streamlined, reducing unnecessary
         includes and pre-processed bloat.
       * Variadic template implementations of items in <tuple> and
         <functional>.
!      * An experimental [15]parallel mode has been added. This is a
         parallel implementation of many C++ Standard library algorithms,
         like std::accumulate, std::for_each, std::transform, or std::sort,
         to give but four examples. These algorithms can be substituted for
--- 6453,6466 ----
  
       * [13]Experimental support for the upcoming ISO C++ standard, C++0x.
       * Support for TR1 mathematical special functions and regular
!        expressions.
       * Default what implementations give more elaborate exception strings
         for bad_cast, bad_typeid, bad_exception, and bad_alloc.
       * Header dependencies have been streamlined, reducing unnecessary
         includes and pre-processed bloat.
       * Variadic template implementations of items in <tuple> and
         <functional>.
!      * An experimental [14]parallel mode has been added. This is a
         parallel implementation of many C++ Standard library algorithms,
         like std::accumulate, std::for_each, std::transform, or std::sort,
         to give but four examples. These algorithms can be substituted for
*************** New Languages and Language specific impr
*** 6453,6459 ****
       * Due to the fact that the GMP and MPFR libraries are required for
         all languages, Fortran is no longer special in this regard and is
         available by default.
!      * The [16]-fexternal-blas option has been added, which generates
         calls to BLAS routines for intrinsic matrix operations such as
         matmul rather than using the built-in algorithms.
       * Support to give a backtrace (compiler flag -fbacktrace or
--- 6491,6497 ----
       * Due to the fact that the GMP and MPFR libraries are required for
         all languages, Fortran is no longer special in this regard and is
         available by default.
!      * The [15]-fexternal-blas option has been added, which generates
         calls to BLAS routines for intrinsic matrix operations such as
         matmul rather than using the built-in algorithms.
       * Support to give a backtrace (compiler flag -fbacktrace or
*************** New Languages and Language specific impr
*** 6462,6477 ****
         run-time error occured.
       * GNU Fortran now defines __GFORTRAN__ when it runs the C
         preprocessor (CPP).
!      * The [17]-finit-local-zero, -finit-real, -finit-integer,
         -finit-character, and -finit-logical options have been added, which
         can be used to initialize local variables.
!      * The intrinsic procedures [18]GAMMA and [19]LGAMMA have been added,
         which calculate the Gamma function and its logarithm. Use EXTERNAL
         gamma if you want to use your own gamma function.
       * GNU Fortran now regards the backslash character as literal (as
!        required by the Fortran 2003 standard); using [20]-fbackslash GNU
         Fortran interprets backslashes as C-style escape characters.
!      * The [21]interpretation of binary, octal and hexadecimal (BOZ)
         literal constants has been changed. Before they were always
         interpreted as integer; now they are bit-wise transferred as
         argument of INT, REAL, DBLE and CMPLX as required by the Fortran
--- 6500,6515 ----
         run-time error occured.
       * GNU Fortran now defines __GFORTRAN__ when it runs the C
         preprocessor (CPP).
!      * The [16]-finit-local-zero, -finit-real, -finit-integer,
         -finit-character, and -finit-logical options have been added, which
         can be used to initialize local variables.
!      * The intrinsic procedures [17]GAMMA and [18]LGAMMA have been added,
         which calculate the Gamma function and its logarithm. Use EXTERNAL
         gamma if you want to use your own gamma function.
       * GNU Fortran now regards the backslash character as literal (as
!        required by the Fortran 2003 standard); using [19]-fbackslash GNU
         Fortran interprets backslashes as C-style escape characters.
!      * The [20]interpretation of binary, octal and hexadecimal (BOZ)
         literal constants has been changed. Before they were always
         interpreted as integer; now they are bit-wise transferred as
         argument of INT, REAL, DBLE and CMPLX as required by the Fortran
*************** Documentation improvements
*** 6841,6847 ****
  
       * Existing libstdc++ documentation has been edited and restructured
         into a single DocBook XML manual. The results can be viewed online
!        [22]here.
  
  Other significant improvements
  
--- 6879,6885 ----
  
       * Existing libstdc++ documentation has been edited and restructured
         into a single DocBook XML manual. The results can be viewed online
!        [21]here.
  
  Other significant improvements
  
*************** Other significant improvements
*** 6873,6879 ****
  
  GCC 4.3.1
  
!    This is the [23]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.1 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
--- 6911,6917 ----
  
  GCC 4.3.1
  
!    This is the [22]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.1 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
*************** Target Specific Changes
*** 6899,6951 ****
  
  GCC 4.3.2
  
!    This is the [24]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.2 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.3.3
  
!    This is the [25]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.3.4
  
!    This is the [26]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.4 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.3.5
  
!    This is the [27]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.5 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.3.6
  
!    This is the [28]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.6 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [29]GCC manuals. If that fails, the
!     [30]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [31]gcc@gcc.gnu.org. All of [32]our lists have public
      archives.
  
!    Copyright (C) [33]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [34]maintained by the GCC team. Last modified
!    2016-01-30[35].
  
  References
  
--- 6937,6989 ----
  
  GCC 4.3.2
  
!    This is the [23]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.2 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.3.3
  
!    This is the [24]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.3.4
  
!    This is the [25]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.4 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.3.5
  
!    This is the [26]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.5 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  GCC 4.3.6
  
!    This is the [27]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 4.3.6 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [28]GCC manuals. If that fails, the
!     [29]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [30]gcc@gcc.gnu.org. All of [31]our lists have public
      archives.
  
!    Copyright (C) [32]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [33]maintained by the GCC team. Last modified
!    2017-02-07[34].
  
  References
  
*************** References
*** 6962,6992 ****
    11. https://gcc.gnu.org/onlinedocs/gcc/Warning-Options.html
    12. http://gcc.gnu.org/gcc-4.3/cxx0x_status.html
    13. http://gcc.gnu.org/gcc-4.3/cxx0x_status.html
!   14. https://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt01ch01.html#m anual.intro.status.standard.tr1
!   15. https://gcc.gnu.org/onlinedocs/libstdc++/manual/parallel_mode.html
!   16. https://gcc.gnu.org/onlinedocs/gfortran/Code-Gen-Options.html#Code-Gen-Options
!   17. https://gcc.gnu.org/onlinedocs/gfortran/Code-Gen-Options.html#index-g_t_0040code_007bfinit-local-zero_007d-167
!   18. https://gcc.gnu.org/onlinedocs/gcc-4.3.0/gfortran/GAMMA.html
!   19. https://gcc.gnu.org/onlinedocs/gcc-4.3.0/gfortran/LGAMMA.html
!   20. https://gcc.gnu.org/onlinedocs/gfortran/Fortran-Dialect-Options.html
!   21. https://gcc.gnu.org/onlinedocs/gfortran/BOZ-literal-constants.html
!   22. https://gcc.gnu.org/onlinedocs/libstdc++/
!   23. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.1
!   24. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.2
!   25. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.3
!   26. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.4
!   27. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.5
!   28. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.6
!   29. https://gcc.gnu.org/onlinedocs/
!   30. mailto:gcc-help@gcc.gnu.org
!   31. mailto:gcc@gcc.gnu.org
!   32. https://gcc.gnu.org/lists.html
!   33. http://www.fsf.org/
!   34. https://gcc.gnu.org/about.html
!   35. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.2/index.html
- 
                               GCC 4.2 Release Series
  
     May 19, 2008
--- 7000,7028 ----
    11. https://gcc.gnu.org/onlinedocs/gcc/Warning-Options.html
    12. http://gcc.gnu.org/gcc-4.3/cxx0x_status.html
    13. http://gcc.gnu.org/gcc-4.3/cxx0x_status.html
!   14. https://gcc.gnu.org/onlinedocs/libstdc++/manual/parallel_mode.html
!   15. https://gcc.gnu.org/onlinedocs/gfortran/Code-Gen-Options.html#Code-Gen-Options
!   16. https://gcc.gnu.org/onlinedocs/gfortran/Code-Gen-Options.html#index-g_t_0040code_007bfinit-local-zero_007d-167
!   17. https://gcc.gnu.org/onlinedocs/gcc-4.3.0/gfortran/GAMMA.html
!   18. https://gcc.gnu.org/onlinedocs/gcc-4.3.0/gfortran/LGAMMA.html
!   19. https://gcc.gnu.org/onlinedocs/gfortran/Fortran-Dialect-Options.html
!   20. https://gcc.gnu.org/onlinedocs/gfortran/BOZ-literal-constants.html
!   21. https://gcc.gnu.org/onlinedocs/libstdc++/
!   22. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.1
!   23. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.2
!   24. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.3
!   25. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.4
!   26. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.5
!   27. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=4.3.6
!   28. https://gcc.gnu.org/onlinedocs/
!   29. mailto:gcc-help@gcc.gnu.org
!   30. mailto:gcc@gcc.gnu.org
!   31. https://gcc.gnu.org/lists.html
!   32. http://www.fsf.org/
!   33. https://gcc.gnu.org/about.html
!   34. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.2/index.html
                               GCC 4.2 Release Series
  
     May 19, 2008
*************** http://gcc.gnu.org/gcc-4.2/index.html
*** 6997,7002 ****
--- 7033,7040 ----
     This release is a bug-fix release, containing fixes for regressions in
     GCC 4.2.3 relative to previous releases of GCC.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 4.2.4
*************** References and Acknowledgements
*** 7046,7052 ****
     provided this notice is preserved.
  
     These pages are [18]maintained by the GCC team. Last modified
!    2016-01-30[19].
  
  References
  
--- 7084,7090 ----
     provided this notice is preserved.
  
     These pages are [18]maintained by the GCC team. Last modified
!    2016-09-30[19].
  
  References
  
*************** References
*** 7071,7077 ****
    19. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.2/changes.html
- 
                               GCC 4.2 Release Series
                          Changes, New Features, and Fixes
  
--- 7109,7114 ----
*************** New Languages and Language specific impr
*** 7197,7203 ****
       * Added support for TR1 <random>, <complex>, and C compatibility
         headers. In addition, a lock-free version of shared_ptr was
         contributed as part of Phillip Jordan's Google Summer of Code
!        project on lock-free containers. ([3]Implementation status of TR1)
       * In association with the Summer of Code work on lock-free
         containers, the interface for atomic builtins was adjusted,
         creating simpler alternatives for non-threaded code paths. Also,
--- 7234,7240 ----
       * Added support for TR1 <random>, <complex>, and C compatibility
         headers. In addition, a lock-free version of shared_ptr was
         contributed as part of Phillip Jordan's Google Summer of Code
!        project on lock-free containers.
       * In association with the Summer of Code work on lock-free
         containers, the interface for atomic builtins was adjusted,
         creating simpler alternatives for non-threaded code paths. Also,
*************** New Languages and Language specific impr
*** 7215,7221 ****
         (basic_tree, tree, trie), lists (list_update), and both
         collision-chaining and probing hash-based containers
         (basic_hash_table, cc_hash_table, gp_hash_table). More details per
!        the [4]documentation.
       * The implementation of the debug mode was modified, whereby the
         debug namespaces were nested inside of namespace std and namespace
         __gnu_cxx in order to resolve some long standing corner cases
--- 7252,7258 ----
         (basic_tree, tree, trie), lists (list_update), and both
         collision-chaining and probing hash-based containers
         (basic_hash_table, cc_hash_table, gp_hash_table). More details per
!        the [3]documentation.
       * The implementation of the debug mode was modified, whereby the
         debug namespaces were nested inside of namespace std and namespace
         __gnu_cxx in order to resolve some long standing corner cases
*************** New Languages and Language specific impr
*** 7248,7254 ****
         gfortran used 8-byte record markers by default (on most systems).
         In order to change the length of the record markers, e.g. to read
         unformatted files created by older gfortran versions, the
!        [5]-frecord-marker=8 option can be used.
  
    Java (GCJ)
  
--- 7285,7291 ----
         gfortran used 8-byte record markers by default (on most systems).
         In order to change the length of the record markers, e.g. to read
         unformatted files created by older gfortran versions, the
!        [4]-frecord-marker=8 option can be used.
  
    Java (GCJ)
  
*************** New Languages and Language specific impr
*** 7259,7265 ****
         memory than if the shared version of libgcj were used. However
         caution should be used as it can also cause essential parts of the
         library to be omitted. Some of these issues are discussed in:
!        [6]https://gcc.gnu.org/wiki/Statically_linking_libgcj
       * fastjar is no longer bundled with GCC. To build libgcj, you will
         need either InfoZIP (both zip and unzip) or an external jar
         program. In the former case, the GCC build will install a jar shell
--- 7296,7302 ----
         memory than if the shared version of libgcj were used. However
         caution should be used as it can also cause essential parts of the
         library to be omitted. Some of these issues are discussed in:
!        [5]https://gcc.gnu.org/wiki/Statically_linking_libgcj
       * fastjar is no longer bundled with GCC. To build libgcj, you will
         need either InfoZIP (both zip and unzip) or an external jar
         program. In the former case, the GCC build will install a jar shell
*************** Other significant improvements
*** 7365,7401 ****
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [7]GCC manuals. If that fails, the
!     [8]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [9]gcc@gcc.gnu.org. All of [10]our lists have public
!     archives.
  
!    Copyright (C) [11]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [12]maintained by the GCC team. Last modified
!    2016-01-30[13].
  
  References
  
     1. http://gcc.gnu.org/projects/gomp/
     2. https://gcc.gnu.org/onlinedocs/gcc/Warning-Options.html
!    3. https://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt01ch01.html#manual.intro.status.standard.tr1
!    4. https://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/index.html
!    5. https://gcc.gnu.org/onlinedocs/gfortran/Runtime-Options.html
!    6. https://gcc.gnu.org/wiki/Statically_linking_libgcj
!    7. https://gcc.gnu.org/onlinedocs/
!    8. mailto:gcc-help@gcc.gnu.org
!    9. mailto:gcc@gcc.gnu.org
!   10. https://gcc.gnu.org/lists.html
!   11. http://www.fsf.org/
!   12. https://gcc.gnu.org/about.html
!   13. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.1/index.html
- 
                               GCC 4.1 Release Series
  
     February 13, 2007
--- 7402,7435 ----
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [6]GCC manuals. If that fails, the
!     [7]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [8]gcc@gcc.gnu.org. All of [9]our lists have public archives.
  
!    Copyright (C) [10]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [11]maintained by the GCC team. Last modified
!    2017-02-07[12].
  
  References
  
     1. http://gcc.gnu.org/projects/gomp/
     2. https://gcc.gnu.org/onlinedocs/gcc/Warning-Options.html
!    3. https://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/index.html
!    4. https://gcc.gnu.org/onlinedocs/gfortran/Runtime-Options.html
!    5. https://gcc.gnu.org/wiki/Statically_linking_libgcj
!    6. https://gcc.gnu.org/onlinedocs/
!    7. mailto:gcc-help@gcc.gnu.org
!    8. mailto:gcc@gcc.gnu.org
!    9. https://gcc.gnu.org/lists.html
!   10. http://www.fsf.org/
!   11. https://gcc.gnu.org/about.html
!   12. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.1/index.html
                               GCC 4.1 Release Series
  
     February 13, 2007
*************** http://gcc.gnu.org/gcc-4.1/index.html
*** 7406,7411 ****
--- 7440,7447 ----
     This release is a bug-fix release, containing fixes for regressions in
     GCC 4.1.1 relative to previous releases of GCC.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 4.1.2
*************** References and Acknowledgements
*** 7449,7455 ****
     provided this notice is preserved.
  
     These pages are [16]maintained by the GCC team. Last modified
!    2016-01-30[17].
  
  References
  
--- 7485,7491 ----
     provided this notice is preserved.
  
     These pages are [16]maintained by the GCC team. Last modified
!    2016-09-30[17].
  
  References
  
*************** References
*** 7472,7478 ****
    17. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.1/changes.html
- 
                               GCC 4.1 Release Series
                          Changes, New Features, and Fixes
  
--- 7508,7513 ----
*************** References
*** 8032,8038 ****
    13. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.0/index.html
- 
                               GCC 4.0 Release Series
  
     January 31, 2007
--- 8067,8072 ----
*************** http://gcc.gnu.org/gcc-4.0/index.html
*** 8043,8048 ****
--- 8077,8084 ----
     This release is a bug-fix release, containing fixes for regressions in
     GCC 4.0.3 relative to previous releases of GCC.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 4.0.4
*************** References and Acknowledgements
*** 8092,8098 ****
     provided this notice is preserved.
  
     These pages are [18]maintained by the GCC team. Last modified
!    2016-01-30[19].
  
  References
  
--- 8128,8134 ----
     provided this notice is preserved.
  
     These pages are [18]maintained by the GCC team. Last modified
!    2016-09-30[19].
  
  References
  
*************** References
*** 8117,8123 ****
    19. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-4.0/changes.html
- 
                               GCC 4.0 Release Series
                          Changes, New Features, and Fixes
  
--- 8153,8158 ----
*************** Obsolete Systems
*** 8527,8533 ****
     declared obsolete:
       * Intel i860
       * Ubicom IP2022
!      * National Semiconductor NS32K
       * Texas Instruments TMS320C[34]x
  
     Also, those for some individual systems have been obsoleted:
--- 8562,8568 ----
     declared obsolete:
       * Intel i860
       * Ubicom IP2022
!      * National Semiconductor NS32K (ns32k)
       * Texas Instruments TMS320C[34]x
  
     Also, those for some individual systems have been obsoleted:
*************** GCC 4.0.4
*** 8619,8625 ****
     provided this notice is preserved.
  
     These pages are [21]maintained by the GCC team. Last modified
!    2016-05-27[22].
  
  References
  
--- 8654,8660 ----
     provided this notice is preserved.
  
     These pages are [21]maintained by the GCC team. Last modified
!    2017-03-29[22].
  
  References
  
*************** References
*** 8630,8636 ****
     5. http://gcc.gnu.org/news/sms.html
     6. https://www.akkadia.org/drepper/dsohowto.pdf
     7. http://gcc.gnu.org/gcc-4.0/changes.html#visibility
!    8. http://mentorembedded.github.io/cxx-abi/
     9. http://gcc.gnu.org/fortran/
    10. https://gcc.gnu.org/install/
    11. https://gcc.gnu.org/wiki/Visibility
--- 8665,8671 ----
     5. http://gcc.gnu.org/news/sms.html
     6. https://www.akkadia.org/drepper/dsohowto.pdf
     7. http://gcc.gnu.org/gcc-4.0/changes.html#visibility
!    8. https://itanium-cxx-abi.github.io/cxx-abi/
     9. http://gcc.gnu.org/fortran/
    10. https://gcc.gnu.org/install/
    11. https://gcc.gnu.org/wiki/Visibility
*************** References
*** 8647,8653 ****
    22. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.4/index.html
- 
                               GCC 3.4 Release Series
  
     May 26, 2006
--- 8682,8687 ----
*************** http://gcc.gnu.org/gcc-3.4/index.html
*** 8663,8668 ****
--- 8697,8704 ----
     improvements, bug fixes, and other changes, thanks to an [3]amazing
     group of volunteers.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 3.4.6
*************** References and Acknowledgements
*** 8718,8724 ****
     provided this notice is preserved.
  
     These pages are [22]maintained by the GCC team. Last modified
!    2016-01-30[23].
  
  References
  
--- 8754,8760 ----
     provided this notice is preserved.
  
     These pages are [22]maintained by the GCC team. Last modified
!    2016-09-30[23].
  
  References
  
*************** References
*** 8747,8753 ****
    23. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.4/changes.html
- 
                               GCC 3.4 Release Series
                          Changes, New Features, and Fixes
  
--- 8783,8788 ----
*************** New Targets and Target Specific Improvem
*** 9354,9362 ****
         __builtin_alpha_zap to allow utilizing the more obscure
         instructions of the CPU.
       * Parameter passing of complex arguments has changed to match the
!        [20]ABI. This change is incompatible with previous GCC versions,
!        but does fix compatibility with the Tru64 compiler and several
!        corner cases where GCC was incompatible with itself.
  
    ARM
  
--- 9389,9397 ----
         __builtin_alpha_zap to allow utilizing the more obscure
         instructions of the CPU.
       * Parameter passing of complex arguments has changed to match the
!        ABI. This change is incompatible with previous GCC versions, but
!        does fix compatibility with the Tru64 compiler and several corner
!        cases where GCC was incompatible with itself.
  
    ARM
  
*************** New Targets and Target Specific Improvem
*** 9371,9378 ****
       * A new ARM target has been added: arm-wince-pe. This is similar to
         the arm-pe target, but it defaults to using the APCS32 ABI.
       * The existing ARM pipeline description has been converted to the use
!        the [21]DFA processor pipeline model. There is not much change in
!        code performance, but the description is now [22]easier to
         understand.
       * Support for the Cirrus EP9312 Maverick floating point co-processor
         added. Enabled at run time with the -mcpu=ep9312 command line
--- 9406,9413 ----
       * A new ARM target has been added: arm-wince-pe. This is similar to
         the arm-pe target, but it defaults to using the APCS32 ABI.
       * The existing ARM pipeline description has been converted to the use
!        the [20]DFA processor pipeline model. There is not much change in
!        code performance, but the description is now [21]easier to
         understand.
       * Support for the Cirrus EP9312 Maverick floating point co-processor
         added. Enabled at run time with the -mcpu=ep9312 command line
*************** New Targets and Target Specific Improvem
*** 9418,9424 ****
         generation of code tuned for Itanium 2 (option -mtune=itanium2) is
         enabled by default now. To generate code tuned for Itanium 1 the
         option -mtune=itanium1 should be used.
!      * [23]DFA processor pipeline descriptions for the IA-64 processors
         have been added. This resulted in about 3% improvement on the
         SPECInt2000 benchmark for Itanium 2.
       * Instruction bundling for the IA-64 processors has been rewritten
--- 9453,9459 ----
         generation of code tuned for Itanium 2 (option -mtune=itanium2) is
         enabled by default now. To generate code tuned for Itanium 1 the
         option -mtune=itanium1 should be used.
!      * [22]DFA processor pipeline descriptions for the IA-64 processors
         have been added. This resulted in about 3% improvement on the
         SPECInt2000 benchmark for Itanium 2.
       * Instruction bundling for the IA-64 processors has been rewritten
*************** New Targets and Target Specific Improvem
*** 9482,9488 ****
  
      General
  
!      * Several [24]ABI bugs have been fixed. Unfortunately, these changes
         will break binary compatibility with earlier releases.
       * GCC can now use explicit relocation operators when generating
         -mabicalls code. This behavior is controlled by -mexplicit-relocs
--- 9517,9523 ----
  
      General
  
!      * Several [23]ABI bugs have been fixed. Unfortunately, these changes
         will break binary compatibility with earlier releases.
       * GCC can now use explicit relocation operators when generating
         -mabicalls code. This behavior is controlled by -mexplicit-relocs
*************** New Targets and Target Specific Improvem
*** 9507,9513 ****
    PowerPC
  
       * GCC 3.4 releases have a number of fixes for PowerPC and PowerPC64
!        [25]ABI incompatibilities regarding the way parameters are passed
         during functions calls. These changes may result in incompatibility
         between code compiled with GCC 3.3 and GCC 3.4.
  
--- 9542,9548 ----
    PowerPC
  
       * GCC 3.4 releases have a number of fixes for PowerPC and PowerPC64
!        [24]ABI incompatibilities regarding the way parameters are passed
         during functions calls. These changes may result in incompatibility
         between code compiled with GCC 3.3 and GCC 3.4.
  
*************** New Targets and Target Specific Improvem
*** 9589,9595 ****
  
       * The option -mflat is deprecated.
       * Support for large (> 2GB) frames has been added to the 64-bit port.
!      * Several [26]ABI bugs have been fixed. Unfortunately, these changes
         will break binary compatibility with earlier releases.
       * The default debugging format has been switched from STABS to
         DWARF-2 for 32-bit code on Solaris 7 and later. DWARF-2 is already
--- 9624,9630 ----
  
       * The option -mflat is deprecated.
       * Support for large (> 2GB) frames has been added to the 64-bit port.
!      * Several [25]ABI bugs have been fixed. Unfortunately, these changes
         will break binary compatibility with earlier releases.
       * The default debugging format has been switched from STABS to
         DWARF-2 for 32-bit code on Solaris 7 and later. DWARF-2 is already
*************** GCC 3.4.0
*** 9702,9708 ****
    Bug Fixes
  
     A vast number of bugs have been fixed in 3.4.0, too many to publish a
!    complete list here. [27]Follow this link to query the Bugzilla database
     for the list of over 900 bugs fixed in 3.4.0. This is the list of all
     bugs marked as resolved and fixed in 3.4.0 that are not flagged as 3.4
     regressions.
--- 9737,9743 ----
    Bug Fixes
  
     A vast number of bugs have been fixed in 3.4.0, too many to publish a
!    complete list here. [26]Follow this link to query the Bugzilla database
     for the list of over 900 bugs fixed in 3.4.0. This is the list of all
     bugs marked as resolved and fixed in 3.4.0 that are not flagged as 3.4
     regressions.
*************** GCC 3.4.1
*** 9719,9982 ****
  
      Bootstrap failures
  
!      * [28]10129 Ada bootstrap fails on PPC-Darwin - invalid assembler
         emitted - PIC related
!      * [29]14576 [ARM] ICE in libiberty when building gcc-3.4 for arm-elf
!      * [30]14760 A bug in configure.in prevents using both
         --program-suffix and --program-prefix
!      * [31]14671 [hppa64] bootstrap fails: ICE in
         save_call_clobbered_regs, in caller_save.c
!      * [32]15093 [alpha][Java] make bootstrap fails to configure libffi on
         Alpha
!      * [33]15178 Solaris 9/x86 fails linking after stage 3
  
      Multi-platform internal compiler errors (ICEs)
  
!      * [34]12753 (preprocessor) Memory corruption in preprocessor on bad
         input
!      * [35]13985 ICE in gcc.c-torture/compile/930621-1.c
!      * [36]14810 (c++) tree check failures with invalid code involving
         templates
!      * [37]14883 (c++) ICE on invalid code, in cp_parser_lookup_name, in
         cp/parser.c
!      * [38]15044 (c++) ICE on syntax error, template header
!      * [39]15057 (c++) Compiling of conditional value throw constructs
         cause a segmentation violation
!      * [40]15064 (c++) typeid of template parameter gives ICE
!      * [41]15142 (c++) ICE when passing a string where a char* is expected
         in a throw statement
!      * [42]15159 ICE in rtl_verify_flow_info_1
!      * [43]15165 (c++) ICE in instantiate_template
!      * [44]15193 Unary minus using pointer to V4SF vector causes
         -fforce-mem to exhaust all memory
!      * [45]15209 (c++) Runs out of memory with packed structs
!      * [46]15227 (c++) Trouble with invalid function definition
!      * [47]15285 (c++) instantiate_type ICE when forming pointer to
         template function
!      * [48]15299 (c++) ICE in resolve_overloaded_unification
!      * [49]15329 (c++) ICE on constructor of member template
!      * [50]15550 ICE in extract_insn, in recog.c
!      * [51]15554 (c++) ICE in tsubst_copy, in cp/pt.c
!      * [52]15640 (c++) ICE on invalid code in arg_assoc, in
         cp/name-lookup.c
!      * [53]15666 [unit-at-a-time] Gcc abort on valid code
!      * [54]15696 (c++) ICE with bad pointer-to-member code
!      * [55]15701 (c++) ICE with friends and template template parameter
!      * [56]15761 ICE in do_SUBST, in combine.c
!      * [57]15829 (c++) ICE on Botan-1.3.13 due to -funroll-loops
  
      Ada
  
!      * [58]14538 All RTEMS targets broken for gnat
  
      C front end
  
!      * [59]12391 missing warning about assigning to an incomplete type
!      * [60]14649 atan(1.0) should not be a constant expression
!      * [61]15004 [unit-at-a-time] no warning for unused paramater in
         static function
!      * [62]15749 --pedantic-errors behaves differently from --pedantic
         with C-compiler on GNU/Linux
  
      C++ compiler and library
  
!      * [63]10646 non-const reference is incorrectly matched in a "const T"
         partial specialization
!      * [64]12077 wcin.rdbuf()->in_avail() return value too high
!      * [65]13598 enc_filebuf doesn't work
!      * [66]14211 const_cast returns lvalue but should be rvalue
!      * [67]14220 num_put::do_put() undesired float/double behavior
!      * [68]14245 problem with user-defined allocators in std::basic_string
!      * [69]14340 libstdc++ Debug mode: failure to convert iterator to
         const_iterator
!      * [70]14600 __gnu_cxx::stdio_sync_filebuf should expose internal
         FILE*
!      * [71]14668 no warning anymore for reevaluation of declaration
!      * [72]14775 LFS (large file support) tests missing
!      * [73]14821 Duplicate namespace alias declaration should not conflict
!      * [74]14930 Friend declaration ignored
!      * [75]14932 cannot use offsetof to get offsets of array elements in
         g++ 3.4.0
!      * [76]14950 [non unit-at-a-time] always_inline does not mix with
         templates and -O0
!      * [77]14962 g++ ignores #pragma redefine_extname
!      * [78]14975 Segfault on low-level write error during imbue
!      * [79]15002 Linewise stream input is unusably slow (std::string slow)
!      * [80]15025 compiler accepts redeclaration of template as
         non-template
!      * [81]15046 [arm] Math functions misdetected by cross configuration
!      * [82]15069 a bit test on a variable of enum type is miscompiled
!      * [83]15074 g++ -lsupc++ still links against libstdc++
!      * [84]15083 spurious "statement has no effect" warning
!      * [85]15096 parse error with templates and pointer to const member
!      * [86]15287 combination of operator[] and operator .* fails in
         templates
!      * [87]15317 __attribute__ unused in first parameter of constructor
         gives error
!      * [88]15337 sizeof on incomplete type diagnostic
!      * [89]15361 bitset<>::_Find_next fails
!      * [90]15412 _GLIBCXX_ symbols symbols defined and used in different
         namespaces
!      * [91]15427 valid code results in incomplete type error
!      * [92]15471 Incorrect member pointer offsets in anonymous
         structs/unions
!      * [93]15503 nested template problem
!      * [94]15507 compiler hangs while laying out union
!      * [95]15542 operator & and template definitions
!      * [96]15565 SLES9: leading + sign for unsigned int with showpos
!      * [97]15625 friend defined inside a template fails to find static
         function
!      * [98]15629 Function templates, overloads, and friend name injection
!      * [99]15742 'noreturn' attribute ignored in method of template
         functions.
!      * [100]15775 Allocator::pointer consistently ignored
!      * [101]15821 Duplicate namespace alias within namespace rejected
!      * [102]15862 'enum yn' fails (confict with undeclared builtin)
!      * [103]15875 rejects pointer to member in template
!      * [104]15877 valid code using templates and anonymous enums is
         rejected
!      * [105]15947 Puzzling error message for wrong destructor declaration
         in template class
!      * [106]16020 cannot copy __gnu_debug::bitset
!      * [107]16154 input iterator concept too restrictive
!      * [108]16174 deducing top-level consts
  
      Java
  
!      * [109]14315 Java compiler is not parallel make safe
  
      Fortran
  
!      * [110]15151 [g77] incorrect logical i/o in 64-bit mode
  
      Objective-C
  
!      * [111]7993 private variables cannot be shadowed in subclasses
  
      Optimization bugs
  
!      * [112]15228 useless copies of floating point operands
!      * [113]15345 [non-unit-at-a-time] unreferenced nested inline
         functions not optimized away
!      * [114]15945 Incorrect floating point optimization
!      * [115]15526 ftrapv aborts on 0 * (-1)
!      * [116]14690 Miscompiled POOMA tests
!      * [117]15112 GCC generates code to write to unchanging memory
  
      Preprocessor
  
!      * [118]15067 Minor glitch in the source of cpp
  
      Main driver program bugs
  
!      * [119]1963 collect2 interprets -oldstyle_liblookup as -o
         ldstyle_liblookup
  
      x86-specific (Intel/AMD)
  
!      * [120]15717 Error: can't resolve `L0' {*ABS* section} - `xx' {*UND*
         section}
  
      HPPA-specific
  
!      * [121]14782 GCC produces an unaligned data access at -O2
!      * [122]14828 FAIL: gcc.c-torture/execute/20030408-1.c execution, -O2
!      * [123]15202 ICE in reload_cse_simplify_operands, in postreload.c
  
      IA64-specific
  
!      * [124]14610 __float80 constants incorrectly emitted
!      * [125]14813 init_array sections are initialized in the wrong order
!      * [126]14857 GCC segfault on duplicated asm statement
!      * [127]15598 Gcc 3.4 ICE on valid code
!      * [128]15653 Gcc 3.4 ICE on valid code
  
      MIPS-specific
  
!      * [129]15189 wrong filling of delay slot with -march=mips1 -G0
         -mno-split-addresses -mno-explicit-relocs
!      * [130]15331 Assembler error building gnatlib on IRIX 6.5 with GNU as
         2.14.91
!      * [131]16144 Bogus reference to __divdf3 when -O1
!      * [132]16176 Miscompilation of unaligned data in MIPS backend
  
      PowerPC-specific
  
!      * [133]11591 ICE in gcc.dg/altivec-5.c
!      * [134]12028 powerpc-eabispe produces bad sCOND operation
!      * [135]14478 rs6000 geu/ltu patterns generate incorrect code
!      * [136]14567 long double and va_arg complex args
!      * [137]14715 Altivec stack layout may overlap gpr save with stack
         temps
!      * [138]14902 (libstdc++) Stream checking functions fail when -pthread
         option is used.
!      * [139]14924 Compiler ICE on valid code
!      * [140]14960 -maltivec affects vector return with -mabi=no-altivec
!      * [141]15106 vector varargs failure passing from altivec to
         non-altivec code for -m32
!      * [142]16026 ICE in function.c:4804, assign_parms, when -mpowerpc64 &
         half-word operation
!      * [143]15191 -maltivec -mabi=no-altivec results in mis-aligned lvx
         and stvx
!      * [144]15662 Segmentation fault when an exception is thrown - even if
         try and catch are specified
  
      s390-specific
  
!      * [145]15054 Bad code due to overlapping stack temporaries
  
      SPARC-specific
  
!      * [146]15783 ICE with union assignment in 64-bit mode
!      * [147]15626 GCC 3.4 emits "ld: warning: relocation error:
         R_SPARC_UA32"
  
      x86-64-specific
  
!      * [148]14326 boehm-gc hardcodes to 3DNow! prefetch for x86_64
!      * [149]14723 Backported -march=nocona from mainline
!      * [150]15290 __float128 failed to pass to function properly
  
      Cygwin/Mingw32-specific
  
!      * [151]15250 Option -mms-bitfields support on GCC 3.4 is not
         conformant to MS layout
!      * [152]15551 -mtune=pentium4 -O2 with sjlj EH breaks stack probe
         worker on windows32 targets
  
      Bugs specific to embedded processors
  
!      * [153]8309 [m68k] -m5200 produces erroneous SImode set of short
         varaible on stack
!      * [154]13250 [SH] Gcc code for rotation clobbers the register, but
         gcc continues to use the register as if it was not clobbered
!      * [155]13803 [coldfire] movqi operand constraints too restrictivefor
         TARGET_COLDFIRE
!      * [156]14093 [SH] ICE for code when using -mhitachi option in SH
!      * [157]14457 [m6811hc] ICE with simple c++ source
!      * [158]14542 [m6811hc] ICE on simple source
!      * [159]15100 [SH] cc1plus got hang-up on
         libstdc++-v3/testsuite/abi_check.cc
!      * [160]15296 [CRIS] Delayed branch scheduling causing invalid code on
         cris-*
!      * [161]15396 [SH] ICE with -O2 -fPIC
!      * [162]15782 [coldfire] m68k_output_mi_thunk emits wrong code for
         ColdFire
  
      Testsuite problems (compiler not affected)
  
!      * [163]11610 libstdc++ testcases 27_io/* don't work properly remotely
!      * [164]15488 (libstdc++) possibly insufficient file permissions for
         executing test suite
!      * [165]15489 (libstdc++) testsuite_files determined incorrectly
  
      Documentation bugs
  
!      * [166]13928 (libstdc++) no whatis info in some man pages generated
         by doxygen
!      * [167]14150 Ada documentation out of date
!      * [168]14949 (c++) Need to document method visibility changes
!      * [169]15123 libstdc++-doc: Allocators.3 manpage is empty
       __________________________________________________________________
  
  GCC 3.4.2
--- 9754,10017 ----
  
      Bootstrap failures
  
!      * [27]10129 Ada bootstrap fails on PPC-Darwin - invalid assembler
         emitted - PIC related
!      * [28]14576 [ARM] ICE in libiberty when building gcc-3.4 for arm-elf
!      * [29]14760 A bug in configure.in prevents using both
         --program-suffix and --program-prefix
!      * [30]14671 [hppa64] bootstrap fails: ICE in
         save_call_clobbered_regs, in caller_save.c
!      * [31]15093 [alpha][Java] make bootstrap fails to configure libffi on
         Alpha
!      * [32]15178 Solaris 9/x86 fails linking after stage 3
  
      Multi-platform internal compiler errors (ICEs)
  
!      * [33]12753 (preprocessor) Memory corruption in preprocessor on bad
         input
!      * [34]13985 ICE in gcc.c-torture/compile/930621-1.c
!      * [35]14810 (c++) tree check failures with invalid code involving
         templates
!      * [36]14883 (c++) ICE on invalid code, in cp_parser_lookup_name, in
         cp/parser.c
!      * [37]15044 (c++) ICE on syntax error, template header
!      * [38]15057 (c++) Compiling of conditional value throw constructs
         cause a segmentation violation
!      * [39]15064 (c++) typeid of template parameter gives ICE
!      * [40]15142 (c++) ICE when passing a string where a char* is expected
         in a throw statement
!      * [41]15159 ICE in rtl_verify_flow_info_1
!      * [42]15165 (c++) ICE in instantiate_template
!      * [43]15193 Unary minus using pointer to V4SF vector causes
         -fforce-mem to exhaust all memory
!      * [44]15209 (c++) Runs out of memory with packed structs
!      * [45]15227 (c++) Trouble with invalid function definition
!      * [46]15285 (c++) instantiate_type ICE when forming pointer to
         template function
!      * [47]15299 (c++) ICE in resolve_overloaded_unification
!      * [48]15329 (c++) ICE on constructor of member template
!      * [49]15550 ICE in extract_insn, in recog.c
!      * [50]15554 (c++) ICE in tsubst_copy, in cp/pt.c
!      * [51]15640 (c++) ICE on invalid code in arg_assoc, in
         cp/name-lookup.c
!      * [52]15666 [unit-at-a-time] Gcc abort on valid code
!      * [53]15696 (c++) ICE with bad pointer-to-member code
!      * [54]15701 (c++) ICE with friends and template template parameter
!      * [55]15761 ICE in do_SUBST, in combine.c
!      * [56]15829 (c++) ICE on Botan-1.3.13 due to -funroll-loops
  
      Ada
  
!      * [57]14538 All RTEMS targets broken for gnat
  
      C front end
  
!      * [58]12391 missing warning about assigning to an incomplete type
!      * [59]14649 atan(1.0) should not be a constant expression
!      * [60]15004 [unit-at-a-time] no warning for unused paramater in
         static function
!      * [61]15749 --pedantic-errors behaves differently from --pedantic
         with C-compiler on GNU/Linux
  
      C++ compiler and library
  
!      * [62]10646 non-const reference is incorrectly matched in a "const T"
         partial specialization
!      * [63]12077 wcin.rdbuf()->in_avail() return value too high
!      * [64]13598 enc_filebuf doesn't work
!      * [65]14211 const_cast returns lvalue but should be rvalue
!      * [66]14220 num_put::do_put() undesired float/double behavior
!      * [67]14245 problem with user-defined allocators in std::basic_string
!      * [68]14340 libstdc++ Debug mode: failure to convert iterator to
         const_iterator
!      * [69]14600 __gnu_cxx::stdio_sync_filebuf should expose internal
         FILE*
!      * [70]14668 no warning anymore for reevaluation of declaration
!      * [71]14775 LFS (large file support) tests missing
!      * [72]14821 Duplicate namespace alias declaration should not conflict
!      * [73]14930 Friend declaration ignored
!      * [74]14932 cannot use offsetof to get offsets of array elements in
         g++ 3.4.0
!      * [75]14950 [non unit-at-a-time] always_inline does not mix with
         templates and -O0
!      * [76]14962 g++ ignores #pragma redefine_extname
!      * [77]14975 Segfault on low-level write error during imbue
!      * [78]15002 Linewise stream input is unusably slow (std::string slow)
!      * [79]15025 compiler accepts redeclaration of template as
         non-template
!      * [80]15046 [arm] Math functions misdetected by cross configuration
!      * [81]15069 a bit test on a variable of enum type is miscompiled
!      * [82]15074 g++ -lsupc++ still links against libstdc++
!      * [83]15083 spurious "statement has no effect" warning
!      * [84]15096 parse error with templates and pointer to const member
!      * [85]15287 combination of operator[] and operator .* fails in
         templates
!      * [86]15317 __attribute__ unused in first parameter of constructor
         gives error
!      * [87]15337 sizeof on incomplete type diagnostic
!      * [88]15361 bitset<>::_Find_next fails
!      * [89]15412 _GLIBCXX_ symbols symbols defined and used in different
         namespaces
!      * [90]15427 valid code results in incomplete type error
!      * [91]15471 Incorrect member pointer offsets in anonymous
         structs/unions
!      * [92]15503 nested template problem
!      * [93]15507 compiler hangs while laying out union
!      * [94]15542 operator & and template definitions
!      * [95]15565 SLES9: leading + sign for unsigned int with showpos
!      * [96]15625 friend defined inside a template fails to find static
         function
!      * [97]15629 Function templates, overloads, and friend name injection
!      * [98]15742 'noreturn' attribute ignored in method of template
         functions.
!      * [99]15775 Allocator::pointer consistently ignored
!      * [100]15821 Duplicate namespace alias within namespace rejected
!      * [101]15862 'enum yn' fails (confict with undeclared builtin)
!      * [102]15875 rejects pointer to member in template
!      * [103]15877 valid code using templates and anonymous enums is
         rejected
!      * [104]15947 Puzzling error message for wrong destructor declaration
         in template class
!      * [105]16020 cannot copy __gnu_debug::bitset
!      * [106]16154 input iterator concept too restrictive
!      * [107]16174 deducing top-level consts
  
      Java
  
!      * [108]14315 Java compiler is not parallel make safe
  
      Fortran
  
!      * [109]15151 [g77] incorrect logical i/o in 64-bit mode
  
      Objective-C
  
!      * [110]7993 private variables cannot be shadowed in subclasses
  
      Optimization bugs
  
!      * [111]15228 useless copies of floating point operands
!      * [112]15345 [non-unit-at-a-time] unreferenced nested inline
         functions not optimized away
!      * [113]15945 Incorrect floating point optimization
!      * [114]15526 ftrapv aborts on 0 * (-1)
!      * [115]14690 Miscompiled POOMA tests
!      * [116]15112 GCC generates code to write to unchanging memory
  
      Preprocessor
  
!      * [117]15067 Minor glitch in the source of cpp
  
      Main driver program bugs
  
!      * [118]1963 collect2 interprets -oldstyle_liblookup as -o
         ldstyle_liblookup
  
      x86-specific (Intel/AMD)
  
!      * [119]15717 Error: can't resolve `L0' {*ABS* section} - `xx' {*UND*
         section}
  
      HPPA-specific
  
!      * [120]14782 GCC produces an unaligned data access at -O2
!      * [121]14828 FAIL: gcc.c-torture/execute/20030408-1.c execution, -O2
!      * [122]15202 ICE in reload_cse_simplify_operands, in postreload.c
  
      IA64-specific
  
!      * [123]14610 __float80 constants incorrectly emitted
!      * [124]14813 init_array sections are initialized in the wrong order
!      * [125]14857 GCC segfault on duplicated asm statement
!      * [126]15598 Gcc 3.4 ICE on valid code
!      * [127]15653 Gcc 3.4 ICE on valid code
  
      MIPS-specific
  
!      * [128]15189 wrong filling of delay slot with -march=mips1 -G0
         -mno-split-addresses -mno-explicit-relocs
!      * [129]15331 Assembler error building gnatlib on IRIX 6.5 with GNU as
         2.14.91
!      * [130]16144 Bogus reference to __divdf3 when -O1
!      * [131]16176 Miscompilation of unaligned data in MIPS backend
  
      PowerPC-specific
  
!      * [132]11591 ICE in gcc.dg/altivec-5.c
!      * [133]12028 powerpc-eabispe produces bad sCOND operation
!      * [134]14478 rs6000 geu/ltu patterns generate incorrect code
!      * [135]14567 long double and va_arg complex args
!      * [136]14715 Altivec stack layout may overlap gpr save with stack
         temps
!      * [137]14902 (libstdc++) Stream checking functions fail when -pthread
         option is used.
!      * [138]14924 Compiler ICE on valid code
!      * [139]14960 -maltivec affects vector return with -mabi=no-altivec
!      * [140]15106 vector varargs failure passing from altivec to
         non-altivec code for -m32
!      * [141]16026 ICE in function.c:4804, assign_parms, when -mpowerpc64 &
         half-word operation
!      * [142]15191 -maltivec -mabi=no-altivec results in mis-aligned lvx
         and stvx
!      * [143]15662 Segmentation fault when an exception is thrown - even if
         try and catch are specified
  
      s390-specific
  
!      * [144]15054 Bad code due to overlapping stack temporaries
  
      SPARC-specific
  
!      * [145]15783 ICE with union assignment in 64-bit mode
!      * [146]15626 GCC 3.4 emits "ld: warning: relocation error:
         R_SPARC_UA32"
  
      x86-64-specific
  
!      * [147]14326 boehm-gc hardcodes to 3DNow! prefetch for x86_64
!      * [148]14723 Backported -march=nocona from mainline
!      * [149]15290 __float128 failed to pass to function properly
  
      Cygwin/Mingw32-specific
  
!      * [150]15250 Option -mms-bitfields support on GCC 3.4 is not
         conformant to MS layout
!      * [151]15551 -mtune=pentium4 -O2 with sjlj EH breaks stack probe
         worker on windows32 targets
  
      Bugs specific to embedded processors
  
!      * [152]8309 [m68k] -m5200 produces erroneous SImode set of short
         varaible on stack
!      * [153]13250 [SH] Gcc code for rotation clobbers the register, but
         gcc continues to use the register as if it was not clobbered
!      * [154]13803 [coldfire] movqi operand constraints too restrictivefor
         TARGET_COLDFIRE
!      * [155]14093 [SH] ICE for code when using -mhitachi option in SH
!      * [156]14457 [m6811hc] ICE with simple c++ source
!      * [157]14542 [m6811hc] ICE on simple source
!      * [158]15100 [SH] cc1plus got hang-up on
         libstdc++-v3/testsuite/abi_check.cc
!      * [159]15296 [CRIS] Delayed branch scheduling causing invalid code on
         cris-*
!      * [160]15396 [SH] ICE with -O2 -fPIC
!      * [161]15782 [coldfire] m68k_output_mi_thunk emits wrong code for
         ColdFire
  
      Testsuite problems (compiler not affected)
  
!      * [162]11610 libstdc++ testcases 27_io/* don't work properly remotely
!      * [163]15488 (libstdc++) possibly insufficient file permissions for
         executing test suite
!      * [164]15489 (libstdc++) testsuite_files determined incorrectly
  
      Documentation bugs
  
!      * [165]13928 (libstdc++) no whatis info in some man pages generated
         by doxygen
!      * [166]14150 Ada documentation out of date
!      * [167]14949 (c++) Need to document method visibility changes
!      * [168]15123 libstdc++-doc: Allocators.3 manpage is empty
       __________________________________________________________________
  
  GCC 3.4.2
*************** GCC 3.4.2
*** 9990,10305 ****
  
      Bootstrap failures and issues
  
!      * [170]16469 [mips-sgi-irix5.3] bootstrap fails in
         libstdc++-v3/testsuite
!      * [171]16344 [hppa-linux-gnu] libstdc++'s PCH built by
         profiledbootstrap does not work with the built compiler
!      * [172]16842 [Solaris/x86] mkheaders can not find mkheaders.conf
  
      Multi-platform internal compiler errors (ICEs)
  
!      * [173]12608 (c++) ICE: expected class 't', have 'x' (error_mark) in
         cp_parser_class_specifier, in cp/parser.c
!      * [174]14492 ICE in loc_descriptor_from_tree, in dwarf2out.c
!      * [175]15461 (c++) ICE due to NRV and inlining
!      * [176]15890 (c++) ICE in c_expand_expr, in c-common.c
!      * [177]16180 ICE: segmentation fault in RTL optimization
!      * [178]16224 (c++) ICE in write_unscoped_name (template/namespace)
!      * [179]16408 ICE: in delete_insn, in cfgrtl.c
!      * [180]16529 (c++) ICE for: namespace-alias shall not be declared as
         the name of any other entity
!      * [181]16698 (c++) ICE with exceptions and declaration of __cxa_throw
!      * [182]16706 (c++) ICE in finish_member_declaration, in
         cp/semantics.c
!      * [183]16810 (c++) Legal C++ program with cast gives ICE in
         build_ptrmemfunc
!      * [184]16851 (c++) ICE when throwing a comma expression
!      * [185]16870 (c++) Boost.Spirit causes ICE in tsubst, in cp/pt.c
!      * [186]16904 (c++) ICE in finish_class_member_access_expr, in
         cp/typeck.c
!      * [187]16905 (c++) ICE (segfault) with exceptions
!      * [188]16964 (c++) ICE in cp_parser_class_specifier due to
         redefinition
!      * [189]17068 (c++) ICE: tree check: expected class 'd', have 'x'
         (identifier_node) in dependent_template_p, in cp/pt.c
  
      Preprocessor bugs
  
!      * [190]16366 Preprocessor option -remap causes memory corruption
  
      Optimization
  
!      * [191]15345 unreferenced nested inline functions not optimized away
!      * [192]16590 Incorrect execution when compiling with -O2
!      * [193]16693 Bitwise AND is lost when used within a cast to an enum
         of the same precision
!      * [194]17078 Jump into if(0) substatement fails
  
      Problems in generated debug information
  
!      * [195]13956 incorrect stabs for nested local variables
  
      C front end bugs
  
!      * [196]16684 GCC should not warn about redundant redeclarations of
         built-ins
  
      C++ compiler and library
  
!      * [197]12658 Thread safety problems in locale::global() and
         locale::locale()
!      * [198]13092 g++ accepts invalid pointer-to-member conversion
!      * [199]15320 Excessive memory consumption
!      * [200]16246 Incorrect template argument deduction
!      * [201]16273 Memory exhausted when using nested classes and virtual
         functions
!      * [202]16401 ostringstream in gcc 3.4.x very slow for big data
!      * [203]16411 undefined reference to
         __gnu_cxx::stdio_sync_filebuf<char, std::char_traits<char>
         >::file()
!      * [204]16489 G++ incorrectly rejects use of a null constant integral
         expression as a null constant pointer
!      * [205]16618 offsetof fails with constant member
!      * [206]16637 syntax error reported for valid input code
!      * [207]16717 __attribute__((constructor)) broken in C++
!      * [208]16813 compiler error in DEBUG version of range insertion
         std::map::insert
!      * [209]16853 pointer-to-member initialization from incompatible one
         accepted
!      * [210]16889 ambiguity is not detected
!      * [211]16959 Segmentation fault in ios_base::sync_with_stdio
  
      Java compiler and library
  
!      * [212]7587 direct threaded interpreter not thread-safe
!      * [213]16473 ServerSocket accept() leaks file descriptors
!      * [214]16478 Hash synchronization deadlock with finalizers
  
      Alpha-specific
  
!      * [215]10695 ICE in dwarf2out_frame_debug_expr, in dwarf2out.c
!      * [216]16974 could not split insn (ice in final_scan_insn, in
         final.c)
  
      x86-specific
  
!      * [217]16298 ICE in output_operand
!      * [218]17113 ICE with SSE2 intrinsics
  
      x86-64 specific
  
!      * [219]14697 libstdc++ couldn't find 32bit libgcc_s
  
      MIPS-specific
  
!      * [220]15869 [mips64] No NOP after LW (with -mips1 -O0)
!      * [221]16325 [mips64] value profiling clobbers gp on mips
!      * [222]16357 [mipsisa64-elf] ICE copying 7 bytes between extern
         char[]s
!      * [223]16380 [mips64] Use of uninitialised register after dbra
         conversion
!      * [224]16407 [mips64] Unaligned access to local variables
!      * [225]16643 [mips64] verify_local_live_at_start ICE after
         crossjumping & cfgcleanup
  
      ARM-specific
  
!      * [226]15927 THUMB -O2: strength-reduced iteration variable ends up
         off by 1
!      * [227]15948 THUMB: ICE with non-commutative cbranch
!      * [228]17019 THUMB: bad switch statement in md code for
         addsi3_cbranch_scratch
  
      IA64-specific
  
!      * [229]16130 ICE on valid code: in bundling, in config/ia64/ia64.c
         (-mtune=merced)
!      * [230]16142 ICE on valid code: in bundling, in config/ia64/ia64.c
         (-mtune=itanium)
!      * [231]16278 Gcc failed to build Linux kernel with -mtune=merced
!      * [232]16414 ICE on valid code: typo in comparison of asm_noperands
         result
!      * [233]16445 ICE on valid code: don't count ignored insns
!      * [234]16490 ICE (segfault) while compiling with -fprofile-use
!      * [235]16683 ia64 does not honor SUBTARGET_EXTRA_SPECS
  
      PowerPC-specific
  
!      * [236]16195 (ppc64): Miscompilation of GCC 3.3.x by 3.4.x
!      * [237]16239 ICE on ppc64 (mozilla 1.7 compile, -O1 -fno-exceptions
         issue)
  
      SPARC-specific
  
!      * [238]16199 ICE while compiling apache 2.0.49
!      * [239]16416 -m64 doesn't imply -mcpu=v9 anymore
!      * [240]16430 ICE when returning non-C aggregates larger than 16 bytes
  
      Bugs specific to embedded processors
  
!      * [241]16379 [m32r] can't output large model function call of memcpy
!      * [242]17093 [m32r] ICE with -msdata=use -O0
!      * [243]17119 [m32r] ICE at switch case 0x8000
  
      DJGPP-specific
  
!      * [244]15928 libstdc++ in 3.4.x doesn't cross-compile for djgpp
  
      Alpha Tru64-specific
  
!      * [245]16210 libstdc++ gratuitously omits "long long" I/O
  
      Testsuite, documentation issues (compiler is not affected):
  
!      * [246]15488 (libstdc++) possibly insufficient file permissions for
         executing test suite
!      * [247]16250 ada/doctools runs makeinfo even in release tarball
       __________________________________________________________________
  
  GCC 3.4.3
  
!    This is the [248]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 3.4.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
      Bootstrap failures
  
!      * [249]17369 [ia64] Bootstrap failure with binutils-2.15.90.0.1.1
!      * [250]17850 [arm-elf] bootstrap failure - libstdc++ uses strtold
         when undeclared
  
      Internal compiler errors (ICEs) affecting multiple platforms
  
!      * [251]13948 (java) GCJ segmentation fault while compiling GL4Java
         .class files
!      * [252]14492 ICE in loc_descriptor_from_tree, in dwarf2out.c
!      * [253]16301 (c++) ICE when "strong" attribute is attached to a using
         directive
!      * [254]16566 ICE with flexible arrays
!      * [255]17023 ICE with nested functions in parameter declaration
!      * [256]17027 ICE with noreturn function in loop at -O2
!      * [257]17524 ICE in grokdeclarator, in cp/decl.c
!      * [258]17826 (c++) ICE in cp_tree_equal
  
      C and optimization bugs
  
!      * [259]15526 -ftrapv aborts on 0 * (-1)
!      * [260]16999 #ident stopped working
!      * [261]17503 quadratic behaviour in invalid_mode_change_p
!      * [262]17581 Long long arithmetic fails inside a switch/case
         statement when compiled with -O2
!      * [263]18129 -fwritable-strings doesn't work
  
      C++ compiler and library bugs
  
!      * [264]10975 incorrect initial ostringstream::tellp()
!      * [265]11722 Unbuffered filebuf::sgetn is slow
!      * [266]14534 Unrecognizing static function as a template parameter
         when its return value is also templated
!      * [267]15172 Copy constructor optimization in aggregate
         initialization
!      * [268]15786 Bad error message for frequently occuring error.
!      * [269]16162 Rejects valid member-template-definition
!      * [270]16612 empty basic_strings can't live in shared memory
!      * [271]16715 std::basic_iostream is instantiated when used, even
         though instantiations are already contained in libstdc++
!      * [272]16848 code in /ext/demangle.h appears broken
!      * [273]17132 GCC fails to eliminate function template specialization
         when argument deduction fails
!      * [274]17259 One more _S_leaf incorrectly qualified with _RopeRep::
         in ropeimpl.h
!      * [275]17327 use of `enumeral_type' in template type unification
!      * [276]17393 "unused variable '._0'" warning with -Wall
!      * [277]17501 Confusion with member templates
!      * [278]17537 g++ not passing -lstdc++ to linker when all command line
         arguments are libraries
!      * [279]17585 usage of unqualified name of static member from within
         class not allowed
!      * [280]17821 Poor diagnostic for using "." instead of "->"
!      * [281]17829 wrong error: call of overloaded function is ambiguous
!      * [282]17851 Misleading diagnostic for invalid function declarations
         with undeclared types
!      * [283]17976 Destructor is called twice
!      * [284]18020 rejects valid definition of enum value in template
!      * [285]18093 bogus conflict in namespace aliasing
!      * [286]18140 C++ parser bug when using >> in templates
  
      Fortran
  
!      * [287]17541 data statements with double precision constants fail
  
      x86-specific
  
!      * [288]17853 -O2 ICE for MMX testcase
  
      SPARC-specific
  
!      * [289]17245 ICE compiling gsl-1.5 statistics/lag1.c
  
      Darwin-specific
  
!      * [290]17167 FATAL:Symbol L_foo$stub already defined.
  
      AIX-specific
  
!      * [291]17277 could not catch an exception when specified -maix64
  
      Solaris-specific
  
!      * [292]17505 <cmath> calls acosf(), ceilf(), and other functions
         missing from system libraries
  
      HP/UX specific:
  
!      * [293]17684 /usr/ccs/bin/ld: Can't create libgcc_s.sl
  
      ARM-specific
  
!      * [294]17384 ICE with mode attribute on structures
  
      MIPS-specific
  
!      * [295]17770 No NOP after LWL with -mips1
  
      Other embedded target specific
  
!      * [296]11476 [arc-elf] gcc ICE on newlib's vfprintf.c
!      * [297]14064 [avr-elf] -fdata-sections triggers ICE
!      * [298]14678 [m68hc11-elf] gcc ICE
!      * [299]15583 [powerpc-rtems] powerpc-rtems lacks __USE_INIT_FINI__
!      * [300]15790 [i686-coff] Alignment error building gcc with i686-coff
         target
!      * [301]15886 [SH] Miscompilation with -O2 -fPIC
!      * [302]16884 [avr-elf] [fweb related] bug while initializing
         variables
  
      Bugs relating to debugger support
  
!      * [303]13841 missing debug info for _Complex function arguments
!      * [304]15860 [big-endian targets] No DW_AT_location debug info is
         emitted for formal arguments to a function that uses "register"
         qualifiers
  
      Testsuite issues (compiler not affected)
  
!      * [305]17465 Testsuite in libffi overrides LD_LIBRARY_PATH
!      * [306]17469 Testsuite in libstdc++ overrides LD_LIBRARY_PATH
!      * [307]18138 [mips-sgi-irix6.5] libgcc_s.so.1 not found by 64-bit
         testsuite
  
      Documentation
  
!      * [308]15498 typo in gcc manual: non-existing locale example en_UK,
         should be en_GB
!      * [309]15747 [mips-sgi-irix5.3] /bin/sh hangs during bootstrap:
         document broken shell
!      * [310]16406 USE_LD_AS_NEEDED undocumented
       __________________________________________________________________
  
  GCC 3.4.4
  
!    This is the [311]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 3.4.4 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
--- 10025,10340 ----
  
      Bootstrap failures and issues
  
!      * [169]16469 [mips-sgi-irix5.3] bootstrap fails in
         libstdc++-v3/testsuite
!      * [170]16344 [hppa-linux-gnu] libstdc++'s PCH built by
         profiledbootstrap does not work with the built compiler
!      * [171]16842 [Solaris/x86] mkheaders can not find mkheaders.conf
  
      Multi-platform internal compiler errors (ICEs)
  
!      * [172]12608 (c++) ICE: expected class 't', have 'x' (error_mark) in
         cp_parser_class_specifier, in cp/parser.c
!      * [173]14492 ICE in loc_descriptor_from_tree, in dwarf2out.c
!      * [174]15461 (c++) ICE due to NRV and inlining
!      * [175]15890 (c++) ICE in c_expand_expr, in c-common.c
!      * [176]16180 ICE: segmentation fault in RTL optimization
!      * [177]16224 (c++) ICE in write_unscoped_name (template/namespace)
!      * [178]16408 ICE: in delete_insn, in cfgrtl.c
!      * [179]16529 (c++) ICE for: namespace-alias shall not be declared as
         the name of any other entity
!      * [180]16698 (c++) ICE with exceptions and declaration of __cxa_throw
!      * [181]16706 (c++) ICE in finish_member_declaration, in
         cp/semantics.c
!      * [182]16810 (c++) Legal C++ program with cast gives ICE in
         build_ptrmemfunc
!      * [183]16851 (c++) ICE when throwing a comma expression
!      * [184]16870 (c++) Boost.Spirit causes ICE in tsubst, in cp/pt.c
!      * [185]16904 (c++) ICE in finish_class_member_access_expr, in
         cp/typeck.c
!      * [186]16905 (c++) ICE (segfault) with exceptions
!      * [187]16964 (c++) ICE in cp_parser_class_specifier due to
         redefinition
!      * [188]17068 (c++) ICE: tree check: expected class 'd', have 'x'
         (identifier_node) in dependent_template_p, in cp/pt.c
  
      Preprocessor bugs
  
!      * [189]16366 Preprocessor option -remap causes memory corruption
  
      Optimization
  
!      * [190]15345 unreferenced nested inline functions not optimized away
!      * [191]16590 Incorrect execution when compiling with -O2
!      * [192]16693 Bitwise AND is lost when used within a cast to an enum
         of the same precision
!      * [193]17078 Jump into if(0) substatement fails
  
      Problems in generated debug information
  
!      * [194]13956 incorrect stabs for nested local variables
  
      C front end bugs
  
!      * [195]16684 GCC should not warn about redundant redeclarations of
         built-ins
  
      C++ compiler and library
  
!      * [196]12658 Thread safety problems in locale::global() and
         locale::locale()
!      * [197]13092 g++ accepts invalid pointer-to-member conversion
!      * [198]15320 Excessive memory consumption
!      * [199]16246 Incorrect template argument deduction
!      * [200]16273 Memory exhausted when using nested classes and virtual
         functions
!      * [201]16401 ostringstream in gcc 3.4.x very slow for big data
!      * [202]16411 undefined reference to
         __gnu_cxx::stdio_sync_filebuf<char, std::char_traits<char>
         >::file()
!      * [203]16489 G++ incorrectly rejects use of a null constant integral
         expression as a null constant pointer
!      * [204]16618 offsetof fails with constant member
!      * [205]16637 syntax error reported for valid input code
!      * [206]16717 __attribute__((constructor)) broken in C++
!      * [207]16813 compiler error in DEBUG version of range insertion
         std::map::insert
!      * [208]16853 pointer-to-member initialization from incompatible one
         accepted
!      * [209]16889 ambiguity is not detected
!      * [210]16959 Segmentation fault in ios_base::sync_with_stdio
  
      Java compiler and library
  
!      * [211]7587 direct threaded interpreter not thread-safe
!      * [212]16473 ServerSocket accept() leaks file descriptors
!      * [213]16478 Hash synchronization deadlock with finalizers
  
      Alpha-specific
  
!      * [214]10695 ICE in dwarf2out_frame_debug_expr, in dwarf2out.c
!      * [215]16974 could not split insn (ice in final_scan_insn, in
         final.c)
  
      x86-specific
  
!      * [216]16298 ICE in output_operand
!      * [217]17113 ICE with SSE2 intrinsics
  
      x86-64 specific
  
!      * [218]14697 libstdc++ couldn't find 32bit libgcc_s
  
      MIPS-specific
  
!      * [219]15869 [mips64] No NOP after LW (with -mips1 -O0)
!      * [220]16325 [mips64] value profiling clobbers gp on mips
!      * [221]16357 [mipsisa64-elf] ICE copying 7 bytes between extern
         char[]s
!      * [222]16380 [mips64] Use of uninitialised register after dbra
         conversion
!      * [223]16407 [mips64] Unaligned access to local variables
!      * [224]16643 [mips64] verify_local_live_at_start ICE after
         crossjumping & cfgcleanup
  
      ARM-specific
  
!      * [225]15927 THUMB -O2: strength-reduced iteration variable ends up
         off by 1
!      * [226]15948 THUMB: ICE with non-commutative cbranch
!      * [227]17019 THUMB: bad switch statement in md code for
         addsi3_cbranch_scratch
  
      IA64-specific
  
!      * [228]16130 ICE on valid code: in bundling, in config/ia64/ia64.c
         (-mtune=merced)
!      * [229]16142 ICE on valid code: in bundling, in config/ia64/ia64.c
         (-mtune=itanium)
!      * [230]16278 Gcc failed to build Linux kernel with -mtune=merced
!      * [231]16414 ICE on valid code: typo in comparison of asm_noperands
         result
!      * [232]16445 ICE on valid code: don't count ignored insns
!      * [233]16490 ICE (segfault) while compiling with -fprofile-use
!      * [234]16683 ia64 does not honor SUBTARGET_EXTRA_SPECS
  
      PowerPC-specific
  
!      * [235]16195 (ppc64): Miscompilation of GCC 3.3.x by 3.4.x
!      * [236]16239 ICE on ppc64 (mozilla 1.7 compile, -O1 -fno-exceptions
         issue)
  
      SPARC-specific
  
!      * [237]16199 ICE while compiling apache 2.0.49
!      * [238]16416 -m64 doesn't imply -mcpu=v9 anymore
!      * [239]16430 ICE when returning non-C aggregates larger than 16 bytes
  
      Bugs specific to embedded processors
  
!      * [240]16379 [m32r] can't output large model function call of memcpy
!      * [241]17093 [m32r] ICE with -msdata=use -O0
!      * [242]17119 [m32r] ICE at switch case 0x8000
  
      DJGPP-specific
  
!      * [243]15928 libstdc++ in 3.4.x doesn't cross-compile for djgpp
  
      Alpha Tru64-specific
  
!      * [244]16210 libstdc++ gratuitously omits "long long" I/O
  
      Testsuite, documentation issues (compiler is not affected):
  
!      * [245]15488 (libstdc++) possibly insufficient file permissions for
         executing test suite
!      * [246]16250 ada/doctools runs makeinfo even in release tarball
       __________________________________________________________________
  
  GCC 3.4.3
  
!    This is the [247]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 3.4.3 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
      Bootstrap failures
  
!      * [248]17369 [ia64] Bootstrap failure with binutils-2.15.90.0.1.1
!      * [249]17850 [arm-elf] bootstrap failure - libstdc++ uses strtold
         when undeclared
  
      Internal compiler errors (ICEs) affecting multiple platforms
  
!      * [250]13948 (java) GCJ segmentation fault while compiling GL4Java
         .class files
!      * [251]14492 ICE in loc_descriptor_from_tree, in dwarf2out.c
!      * [252]16301 (c++) ICE when "strong" attribute is attached to a using
         directive
!      * [253]16566 ICE with flexible arrays
!      * [254]17023 ICE with nested functions in parameter declaration
!      * [255]17027 ICE with noreturn function in loop at -O2
!      * [256]17524 ICE in grokdeclarator, in cp/decl.c
!      * [257]17826 (c++) ICE in cp_tree_equal
  
      C and optimization bugs
  
!      * [258]15526 -ftrapv aborts on 0 * (-1)
!      * [259]16999 #ident stopped working
!      * [260]17503 quadratic behaviour in invalid_mode_change_p
!      * [261]17581 Long long arithmetic fails inside a switch/case
         statement when compiled with -O2
!      * [262]18129 -fwritable-strings doesn't work
  
      C++ compiler and library bugs
  
!      * [263]10975 incorrect initial ostringstream::tellp()
!      * [264]11722 Unbuffered filebuf::sgetn is slow
!      * [265]14534 Unrecognizing static function as a template parameter
         when its return value is also templated
!      * [266]15172 Copy constructor optimization in aggregate
         initialization
!      * [267]15786 Bad error message for frequently occuring error.
!      * [268]16162 Rejects valid member-template-definition
!      * [269]16612 empty basic_strings can't live in shared memory
!      * [270]16715 std::basic_iostream is instantiated when used, even
         though instantiations are already contained in libstdc++
!      * [271]16848 code in /ext/demangle.h appears broken
!      * [272]17132 GCC fails to eliminate function template specialization
         when argument deduction fails
!      * [273]17259 One more _S_leaf incorrectly qualified with _RopeRep::
         in ropeimpl.h
!      * [274]17327 use of `enumeral_type' in template type unification
!      * [275]17393 "unused variable '._0'" warning with -Wall
!      * [276]17501 Confusion with member templates
!      * [277]17537 g++ not passing -lstdc++ to linker when all command line
         arguments are libraries
!      * [278]17585 usage of unqualified name of static member from within
         class not allowed
!      * [279]17821 Poor diagnostic for using "." instead of "->"
!      * [280]17829 wrong error: call of overloaded function is ambiguous
!      * [281]17851 Misleading diagnostic for invalid function declarations
         with undeclared types
!      * [282]17976 Destructor is called twice
!      * [283]18020 rejects valid definition of enum value in template
!      * [284]18093 bogus conflict in namespace aliasing
!      * [285]18140 C++ parser bug when using >> in templates
  
      Fortran
  
!      * [286]17541 data statements with double precision constants fail
  
      x86-specific
  
!      * [287]17853 -O2 ICE for MMX testcase
  
      SPARC-specific
  
!      * [288]17245 ICE compiling gsl-1.5 statistics/lag1.c
  
      Darwin-specific
  
!      * [289]17167 FATAL:Symbol L_foo$stub already defined.
  
      AIX-specific
  
!      * [290]17277 could not catch an exception when specified -maix64
  
      Solaris-specific
  
!      * [291]17505 <cmath> calls acosf(), ceilf(), and other functions
         missing from system libraries
  
      HP/UX specific:
  
!      * [292]17684 /usr/ccs/bin/ld: Can't create libgcc_s.sl
  
      ARM-specific
  
!      * [293]17384 ICE with mode attribute on structures
  
      MIPS-specific
  
!      * [294]17770 No NOP after LWL with -mips1
  
      Other embedded target specific
  
!      * [295]11476 [arc-elf] gcc ICE on newlib's vfprintf.c
!      * [296]14064 [avr-elf] -fdata-sections triggers ICE
!      * [297]14678 [m68hc11-elf] gcc ICE
!      * [298]15583 [powerpc-rtems] powerpc-rtems lacks __USE_INIT_FINI__
!      * [299]15790 [i686-coff] Alignment error building gcc with i686-coff
         target
!      * [300]15886 [SH] Miscompilation with -O2 -fPIC
!      * [301]16884 [avr-elf] [fweb related] bug while initializing
         variables
  
      Bugs relating to debugger support
  
!      * [302]13841 missing debug info for _Complex function arguments
!      * [303]15860 [big-endian targets] No DW_AT_location debug info is
         emitted for formal arguments to a function that uses "register"
         qualifiers
  
      Testsuite issues (compiler not affected)
  
!      * [304]17465 Testsuite in libffi overrides LD_LIBRARY_PATH
!      * [305]17469 Testsuite in libstdc++ overrides LD_LIBRARY_PATH
!      * [306]18138 [mips-sgi-irix6.5] libgcc_s.so.1 not found by 64-bit
         testsuite
  
      Documentation
  
!      * [307]15498 typo in gcc manual: non-existing locale example en_UK,
         should be en_GB
!      * [308]15747 [mips-sgi-irix5.3] /bin/sh hangs during bootstrap:
         document broken shell
!      * [309]16406 USE_LD_AS_NEEDED undocumented
       __________________________________________________________________
  
  GCC 3.4.4
  
!    This is the [310]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 3.4.4 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
*************** GCC 3.4.4
*** 10307,10513 ****
  
  GCC 3.4.5
  
!    This is the [312]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 3.4.5 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
      Bootstrap issues
  
!      * [313]24688 sco_math fixincl breaks math.h
  
      C compiler bugs
  
!      * [314]17188 struct Foo { } redefinition
!      * [315]20187 wrong code for ((unsigned char)(unsigned long
         long)((a?a:1)&(a*b)))?0:1)
!      * [316]21873 infinite warning loop on bad array initializer
!      * [317]21899 enum definition accepts values to be overriden
!      * [318]22061 ICE in find_function_data, in function.c
!      * [319]22308 Failure to diagnose violation of constraint 6.516p2
!      * [320]22458 ICE on missing brace
!      * [321]22589 ICE casting to long long
!      * [322]24101 Segfault with preprocessed source
  
      C++ compiler and library bugs
  
!      * [323]10611 operations on vector mode not recognized in C++
!      * [324]13377 unexpected behavior of namespace usage directive
!      * [325]16002 Strange error message with new parser
!      * [326]17413 local classes as template argument
!      * [327]17609 spurious error message after using keyword
!      * [328]17618 ICE in cp_convert_to_pointer, in cp/cvt.c
!      * [329]18124 ICE with invalid template template parameter
!      * [330]18155 typedef in template declaration not rejected
!      * [331]18177 ICE with const_cast for undeclared variable
!      * [332]18368 C++ error message regression
!      * [333]16378 ICE when returning a copy of a packed member
!      * [334]18466 int ::i; accepted
!      * [335]18512 ICE on invalid usage of template base class
!      * [336]18454 ICE when returning undefined type
!      * [337]18738 typename not allowed with non-dependent qualified name
!      * [338]18803 rejects access to operator() in template
!      * [339]19004 ICE in uses_template_parms, in cp/pt.c
!      * [340]19208 Spurious error about variably modified type
!      * [341]18253 bad error message / ICE for invalid template parameter
!      * [342]19608 ICE after friend function definition in local class
!      * [343]19884 ICE on explicit instantiation of a non-template
         constructor
!      * [344]20153 ICE when C++ template function contains anonymous union
!      * [345]20563 Infinite loop in diagnostic (and ice after error
         message)
!      * [346]20789 ICE with incomplete type in template
!      * [347]21336 Internal compiler error when using custom new operators
!      * [348]21768 ICE in error message due to violation of coding
         conventions
!      * [349]21853 constness of pointer to data member ignored
!      * [350]21903 Default argument of template function causes a
         compile-time error
!      * [351]21983 multiple diagnostics
!      * [352]21987 New testsuite failure
         g++.dg/warn/conversion-function-1.C
!      * [353]22153 ICE on invalid template specialization
!      * [354]22172 Internal compiler error, seg fault.
!      * [355]21286 filebuf::xsgetn vs pipes
!      * [356]22233 ICE with wrong number of template parameters
!      * [357]22508 ICE after invalid operator new
!      * [358]22545 ICE with pointer to class member & user defined
         conversion operator
!      * [359]23528 Wrong default allocator in ext/hash_map
!      * [360]23550 char_traits requirements/1.cc test bad math
!      * [361]23586 Bad diagnostic for invalid namespace-name
!      * [362]23624 ICE in invert_truthvalue, in fold-const.c
!      * [363]23639 Bad error message: not a member of '<declaration error>'
!      * [364]23797 ICE on typename outside template
!      * [365]23965 Bogus error message: no matching function for call to
         'foo(<type error>)'
!      * [366]24052 &#`label_decl' not supported by dump_expr#<expression
         error>
!      * [367]24580 virtual base class cause exception not to be caught
  
      Problems in generated debug information
  
!      * [368]24267 Bad DWARF for altivec vectors
  
      Optimizations issues
  
!      * [369]17810 ICE in verify_local_live_at_start
!      * [370]17860 Wrong generated code for loop with varying bound
!      * [371]21709 ICE on compile-time complex NaN
!      * [372]21964 broken tail call at -O2 or more
!      * [373]22167 Strange optimization bug when using -Os
!      * [374]22619 Compilation failure for real_const_1.f and
         real_const_2.f90
!      * [375]23241 Invalid code generated for comparison of uchar to 255
!      * [376]23478 Miscompilation due to reloading of a var that is also
         used in EH pad
!      * [377]24470 segmentation fault in cc1plus when compiling with -O
!      * [378]24950 ICE in operand_subword_force
  
      Precompiled headers problems
  
!      * [379]14400 Cannot compile qt-x11-free-3.3.0
!      * [380]14940 PCH largefile test fails on various platforms
  
      Preprocessor bugs
  
!      * [381]20239 ICE on empty preprocessed input
!      * [382]15220 "gcc -E -MM -MG" reports missing system headers in
         source directory
  
      Testsuite issues
  
!      * [383]19275 gcc.dg/20020919-1.c fails with -fpic/-fPIC on
         i686-pc-linux-gnu
  
      Alpha specific
  
!      * [384]21888 bootstrap failure with linker relaxation enabled
  
      ARM specific
  
!      * [385]15342 [arm-linux]: ICE in verify_local_live_at_start
!      * [386]23985 Memory aliasing information incorrect in inlined memcpy
  
      ColdFile specific
  
!      * [387]16719 Illegal move of byte into address register causes
         compiler to ICE
  
      HPPA specific
  
!      * [388]21723 ICE while building libgfortran
!      * [389]21841 -mhp-ld/-mgnu-ld documentation
  
      IA-64 specific
  
!      * [390]23644 IA-64 hardware models and configuration options
         documentation error
!      * [391]24718 Shared libgcc not used for linking by default
  
      M68000 specific
  
!      * [392]18421 ICE in reload_cse_simplify_operands, in postreload.c
  
      MIPS specific
  
!      * [393]20621 ICE in change_address_1, in emit-rtl.c
  
      PowerPC and PowerPC64 specific
  
!      * [394]18583 error on valid code: const
         __attribute__((altivec(vector__))) doesn't work in arrays
!      * [395]20191 ICE in reload_cse_simplify_operands
!      * [396]22083 AIX: TARGET_C99_FUNCTIONS is wrongly defined
!      * [397]23070 CALL_V4_CLEAR_FP_ARGS flag not properly set
!      * [398]23404 gij trashes args of functions with more than 8 fp args
!      * [399]23539 C & C++ compiler generating misaligned references
         regardless of compiler flags
!      * [400]24102 floatdisf2_internal2 broken
!      * [401]24465 -mminimal-toc miscompilation of __thread vars
  
      Solaris specific
  
!      * [402]19933 Problem with define of HUGE_VAL in math_c99
!      * [403]21889 Native Solaris assembler cannot grok DTP-relative debug
         symbols
  
      SPARC specific
  
!      * [404]19300 PCH failures on sparc-linux
!      * [405]20301 Assembler labels have a leading "-"
!      * [406]20673 C PCH testsuite assembly comparison failure
  
      x86 and x86_64 specific
  
!      * [407]18582 ICE with arrays of type V2DF
!      * [408]19340 Compilation SEGFAULTs with -O1 -fschedule-insns2
         -fsched2-use-traces
!      * [409]21716 ICE in reg-stack.c's swap_rtx_condition
!      * [410]24315 amd64 fails -fpeephole2
       __________________________________________________________________
  
  GCC 3.4.6
  
!    This is the [411]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 3.4.6 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [412]GCC manuals. If that fails, the
!     [413]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [414]gcc@gcc.gnu.org. All of [415]our lists have public
      archives.
  
!    Copyright (C) [416]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [417]maintained by the GCC team. Last modified
!    2016-01-30[418].
  
  References
  
--- 10342,10548 ----
  
  GCC 3.4.5
  
!    This is the [311]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 3.4.5 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
      Bootstrap issues
  
!      * [312]24688 sco_math fixincl breaks math.h
  
      C compiler bugs
  
!      * [313]17188 struct Foo { } redefinition
!      * [314]20187 wrong code for ((unsigned char)(unsigned long
         long)((a?a:1)&(a*b)))?0:1)
!      * [315]21873 infinite warning loop on bad array initializer
!      * [316]21899 enum definition accepts values to be overriden
!      * [317]22061 ICE in find_function_data, in function.c
!      * [318]22308 Failure to diagnose violation of constraint 6.516p2
!      * [319]22458 ICE on missing brace
!      * [320]22589 ICE casting to long long
!      * [321]24101 Segfault with preprocessed source
  
      C++ compiler and library bugs
  
!      * [322]10611 operations on vector mode not recognized in C++
!      * [323]13377 unexpected behavior of namespace usage directive
!      * [324]16002 Strange error message with new parser
!      * [325]17413 local classes as template argument
!      * [326]17609 spurious error message after using keyword
!      * [327]17618 ICE in cp_convert_to_pointer, in cp/cvt.c
!      * [328]18124 ICE with invalid template template parameter
!      * [329]18155 typedef in template declaration not rejected
!      * [330]18177 ICE with const_cast for undeclared variable
!      * [331]18368 C++ error message regression
!      * [332]16378 ICE when returning a copy of a packed member
!      * [333]18466 int ::i; accepted
!      * [334]18512 ICE on invalid usage of template base class
!      * [335]18454 ICE when returning undefined type
!      * [336]18738 typename not allowed with non-dependent qualified name
!      * [337]18803 rejects access to operator() in template
!      * [338]19004 ICE in uses_template_parms, in cp/pt.c
!      * [339]19208 Spurious error about variably modified type
!      * [340]18253 bad error message / ICE for invalid template parameter
!      * [341]19608 ICE after friend function definition in local class
!      * [342]19884 ICE on explicit instantiation of a non-template
         constructor
!      * [343]20153 ICE when C++ template function contains anonymous union
!      * [344]20563 Infinite loop in diagnostic (and ice after error
         message)
!      * [345]20789 ICE with incomplete type in template
!      * [346]21336 Internal compiler error when using custom new operators
!      * [347]21768 ICE in error message due to violation of coding
         conventions
!      * [348]21853 constness of pointer to data member ignored
!      * [349]21903 Default argument of template function causes a
         compile-time error
!      * [350]21983 multiple diagnostics
!      * [351]21987 New testsuite failure
         g++.dg/warn/conversion-function-1.C
!      * [352]22153 ICE on invalid template specialization
!      * [353]22172 Internal compiler error, seg fault.
!      * [354]21286 filebuf::xsgetn vs pipes
!      * [355]22233 ICE with wrong number of template parameters
!      * [356]22508 ICE after invalid operator new
!      * [357]22545 ICE with pointer to class member & user defined
         conversion operator
!      * [358]23528 Wrong default allocator in ext/hash_map
!      * [359]23550 char_traits requirements/1.cc test bad math
!      * [360]23586 Bad diagnostic for invalid namespace-name
!      * [361]23624 ICE in invert_truthvalue, in fold-const.c
!      * [362]23639 Bad error message: not a member of '<declaration error>'
!      * [363]23797 ICE on typename outside template
!      * [364]23965 Bogus error message: no matching function for call to
         'foo(<type error>)'
!      * [365]24052 &#`label_decl' not supported by dump_expr#<expression
         error>
!      * [366]24580 virtual base class cause exception not to be caught
  
      Problems in generated debug information
  
!      * [367]24267 Bad DWARF for altivec vectors
  
      Optimizations issues
  
!      * [368]17810 ICE in verify_local_live_at_start
!      * [369]17860 Wrong generated code for loop with varying bound
!      * [370]21709 ICE on compile-time complex NaN
!      * [371]21964 broken tail call at -O2 or more
!      * [372]22167 Strange optimization bug when using -Os
!      * [373]22619 Compilation failure for real_const_1.f and
         real_const_2.f90
!      * [374]23241 Invalid code generated for comparison of uchar to 255
!      * [375]23478 Miscompilation due to reloading of a var that is also
         used in EH pad
!      * [376]24470 segmentation fault in cc1plus when compiling with -O
!      * [377]24950 ICE in operand_subword_force
  
      Precompiled headers problems
  
!      * [378]14400 Cannot compile qt-x11-free-3.3.0
!      * [379]14940 PCH largefile test fails on various platforms
  
      Preprocessor bugs
  
!      * [380]20239 ICE on empty preprocessed input
!      * [381]15220 "gcc -E -MM -MG" reports missing system headers in
         source directory
  
      Testsuite issues
  
!      * [382]19275 gcc.dg/20020919-1.c fails with -fpic/-fPIC on
         i686-pc-linux-gnu
  
      Alpha specific
  
!      * [383]21888 bootstrap failure with linker relaxation enabled
  
      ARM specific
  
!      * [384]15342 [arm-linux]: ICE in verify_local_live_at_start
!      * [385]23985 Memory aliasing information incorrect in inlined memcpy
  
      ColdFile specific
  
!      * [386]16719 Illegal move of byte into address register causes
         compiler to ICE
  
      HPPA specific
  
!      * [387]21723 ICE while building libgfortran
!      * [388]21841 -mhp-ld/-mgnu-ld documentation
  
      IA-64 specific
  
!      * [389]23644 IA-64 hardware models and configuration options
         documentation error
!      * [390]24718 Shared libgcc not used for linking by default
  
      M68000 specific
  
!      * [391]18421 ICE in reload_cse_simplify_operands, in postreload.c
  
      MIPS specific
  
!      * [392]20621 ICE in change_address_1, in emit-rtl.c
  
      PowerPC and PowerPC64 specific
  
!      * [393]18583 error on valid code: const
         __attribute__((altivec(vector__))) doesn't work in arrays
!      * [394]20191 ICE in reload_cse_simplify_operands
!      * [395]22083 AIX: TARGET_C99_FUNCTIONS is wrongly defined
!      * [396]23070 CALL_V4_CLEAR_FP_ARGS flag not properly set
!      * [397]23404 gij trashes args of functions with more than 8 fp args
!      * [398]23539 C & C++ compiler generating misaligned references
         regardless of compiler flags
!      * [399]24102 floatdisf2_internal2 broken
!      * [400]24465 -mminimal-toc miscompilation of __thread vars
  
      Solaris specific
  
!      * [401]19933 Problem with define of HUGE_VAL in math_c99
!      * [402]21889 Native Solaris assembler cannot grok DTP-relative debug
         symbols
  
      SPARC specific
  
!      * [403]19300 PCH failures on sparc-linux
!      * [404]20301 Assembler labels have a leading "-"
!      * [405]20673 C PCH testsuite assembly comparison failure
  
      x86 and x86_64 specific
  
!      * [406]18582 ICE with arrays of type V2DF
!      * [407]19340 Compilation SEGFAULTs with -O1 -fschedule-insns2
         -fsched2-use-traces
!      * [408]21716 ICE in reg-stack.c's swap_rtx_condition
!      * [409]24315 amd64 fails -fpeephole2
       __________________________________________________________________
  
  GCC 3.4.6
  
!    This is the [410]list of problem reports (PRs) from GCC's bug tracking
     system that are known to be fixed in the 3.4.6 release. This list might
     not be complete (that is, it is possible that some PRs that have been
     fixed are not listed here).
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [411]GCC manuals. If that fails, the
!     [412]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [413]gcc@gcc.gnu.org. All of [414]our lists have public
      archives.
  
!    Copyright (C) [415]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [416]maintained by the GCC team. Last modified
!    2016-12-30[417].
  
  References
  
*************** References
*** 10520,10526 ****
     7. http://www.boost.org/
     8. https://gcc.gnu.org/PR11953
     9. https://gcc.gnu.org/PR8361
!   10. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gcc/Other-Builtins.html#Other%20Builtins
    11. http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_closed.html#209
    12. http://gcc.gnu.org/bugs/#cxx_rvalbind
    13. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gcc/Objective-C-Dialect-Options.html
--- 10555,10561 ----
     7. http://www.boost.org/
     8. https://gcc.gnu.org/PR11953
     9. https://gcc.gnu.org/PR8361
!   10. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gcc/Other-Builtins.html#Other Builtins
    11. http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_closed.html#209
    12. http://gcc.gnu.org/bugs/#cxx_rvalbind
    13. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gcc/Objective-C-Dialect-Options.html
*************** References
*** 10530,10937 ****
    17. http://www.eclipse.org/
    18. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/g77/News.html
    19. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gcc/Alpha-Built-in-Functions.html
!   20. http://h30097.www3.hp.com/docs/base_doc/DOCUMENTATION/V51A_HTML/ARH9MBTE/DTMNPLTN.HTM#normal-argument-list-structure
!   21. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gccint/Processor-pipeline-description.html
!   22. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gccint/Comparison-of-the-two-descriptions.html
!   23. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gccint/Processor-pipeline-description.html
!   24. http://gcc.gnu.org/gcc-3.4/mips-abi.html
!   25. http://gcc.gnu.org/gcc-3.4/powerpc-abi.html
!   26. http://gcc.gnu.org/gcc-3.4/sparc-abi.html
!   27. https://gcc.gnu.org/bugzilla/buglist.cgi?short_desc_type=notregexp&short_desc=%5C%5B3%5C.4.*%5BRr%5Degression&target_milestone=3.4.0&bug_status=RESOLVED&resolution=FIXED
!   28. https://gcc.gnu.org/PR10129
!   29. https://gcc.gnu.org/PR14576
!   30. https://gcc.gnu.org/PR14760
!   31. https://gcc.gnu.org/PR14671
!   32. https://gcc.gnu.org/PR15093
!   33. https://gcc.gnu.org/PR15178
!   34. https://gcc.gnu.org/PR12753
!   35. https://gcc.gnu.org/PR13985
!   36. https://gcc.gnu.org/PR14810
!   37. https://gcc.gnu.org/PR14883
!   38. https://gcc.gnu.org/PR15044
!   39. https://gcc.gnu.org/PR15057
!   40. https://gcc.gnu.org/PR15064
!   41. https://gcc.gnu.org/PR15142
!   42. https://gcc.gnu.org/PR15159
!   43. https://gcc.gnu.org/PR15165
!   44. https://gcc.gnu.org/PR15193
!   45. https://gcc.gnu.org/PR15209
!   46. https://gcc.gnu.org/PR15227
!   47. https://gcc.gnu.org/PR15285
!   48. https://gcc.gnu.org/PR15299
!   49. https://gcc.gnu.org/PR15329
!   50. https://gcc.gnu.org/PR15550
!   51. https://gcc.gnu.org/PR15554
!   52. https://gcc.gnu.org/PR15640
!   53. https://gcc.gnu.org/PR15666
!   54. https://gcc.gnu.org/PR15696
!   55. https://gcc.gnu.org/PR15701
!   56. https://gcc.gnu.org/PR15761
!   57. https://gcc.gnu.org/PR15829
!   58. https://gcc.gnu.org/PR14538
!   59. https://gcc.gnu.org/PR12391
!   60. https://gcc.gnu.org/PR14649
!   61. https://gcc.gnu.org/PR15004
!   62. https://gcc.gnu.org/PR15749
!   63. https://gcc.gnu.org/PR10646
!   64. https://gcc.gnu.org/PR12077
!   65. https://gcc.gnu.org/PR13598
!   66. https://gcc.gnu.org/PR14211
!   67. https://gcc.gnu.org/PR14220
!   68. https://gcc.gnu.org/PR14245
!   69. https://gcc.gnu.org/PR14340
!   70. https://gcc.gnu.org/PR14600
!   71. https://gcc.gnu.org/PR14668
!   72. https://gcc.gnu.org/PR14775
!   73. https://gcc.gnu.org/PR14821
!   74. https://gcc.gnu.org/PR14930
!   75. https://gcc.gnu.org/PR14932
!   76. https://gcc.gnu.org/PR14950
!   77. https://gcc.gnu.org/PR14962
!   78. https://gcc.gnu.org/PR14975
!   79. https://gcc.gnu.org/PR15002
!   80. https://gcc.gnu.org/PR15025
!   81. https://gcc.gnu.org/PR15046
!   82. https://gcc.gnu.org/PR15069
!   83. https://gcc.gnu.org/PR15074
!   84. https://gcc.gnu.org/PR15083
!   85. https://gcc.gnu.org/PR15096
!   86. https://gcc.gnu.org/PR15287
!   87. https://gcc.gnu.org/PR15317
!   88. https://gcc.gnu.org/PR15337
!   89. https://gcc.gnu.org/PR15361
!   90. https://gcc.gnu.org/PR15412
!   91. https://gcc.gnu.org/PR15427
!   92. https://gcc.gnu.org/PR15471
!   93. https://gcc.gnu.org/PR15503
!   94. https://gcc.gnu.org/PR15507
!   95. https://gcc.gnu.org/PR15542
!   96. https://gcc.gnu.org/PR15565
!   97. https://gcc.gnu.org/PR15625
!   98. https://gcc.gnu.org/PR15629
!   99. https://gcc.gnu.org/PR15742
!  100. https://gcc.gnu.org/PR15775
!  101. https://gcc.gnu.org/PR15821
!  102. https://gcc.gnu.org/PR15862
!  103. https://gcc.gnu.org/PR15875
!  104. https://gcc.gnu.org/PR15877
!  105. https://gcc.gnu.org/PR15947
!  106. https://gcc.gnu.org/PR16020
!  107. https://gcc.gnu.org/PR16154
!  108. https://gcc.gnu.org/PR16174
!  109. https://gcc.gnu.org/PR14315
!  110. https://gcc.gnu.org/PR15151
!  111. https://gcc.gnu.org/PR7993
!  112. https://gcc.gnu.org/PR15228
!  113. https://gcc.gnu.org/PR15345
!  114. https://gcc.gnu.org/PR15945
!  115. https://gcc.gnu.org/PR15526
!  116. https://gcc.gnu.org/PR14690
!  117. https://gcc.gnu.org/PR15112
!  118. https://gcc.gnu.org/PR15067
!  119. https://gcc.gnu.org/PR1963
!  120. https://gcc.gnu.org/PR15717
!  121. https://gcc.gnu.org/PR14782
!  122. https://gcc.gnu.org/PR14828
!  123. https://gcc.gnu.org/PR15202
!  124. https://gcc.gnu.org/PR14610
!  125. https://gcc.gnu.org/PR14813
!  126. https://gcc.gnu.org/PR14857
!  127. https://gcc.gnu.org/PR15598
!  128. https://gcc.gnu.org/PR15653
!  129. https://gcc.gnu.org/PR15189
!  130. https://gcc.gnu.org/PR15331
!  131. https://gcc.gnu.org/PR16144
!  132. https://gcc.gnu.org/PR16176
!  133. https://gcc.gnu.org/PR11591
!  134. https://gcc.gnu.org/PR12028
!  135. https://gcc.gnu.org/PR14478
!  136. https://gcc.gnu.org/PR14567
!  137. https://gcc.gnu.org/PR14715
!  138. https://gcc.gnu.org/PR14902
!  139. https://gcc.gnu.org/PR14924
!  140. https://gcc.gnu.org/PR14960
!  141. https://gcc.gnu.org/PR15106
!  142. https://gcc.gnu.org/PR16026
!  143. https://gcc.gnu.org/PR15191
!  144. https://gcc.gnu.org/PR15662
!  145. https://gcc.gnu.org/PR15054
!  146. https://gcc.gnu.org/PR15783
!  147. https://gcc.gnu.org/PR15626
!  148. https://gcc.gnu.org/PR14326
!  149. https://gcc.gnu.org/PR14723
!  150. https://gcc.gnu.org/PR15290
!  151. https://gcc.gnu.org/PR15250
!  152. https://gcc.gnu.org/PR15551
!  153. https://gcc.gnu.org/PR8309
!  154. https://gcc.gnu.org/PR13250
!  155. https://gcc.gnu.org/PR13803
!  156. https://gcc.gnu.org/PR14093
!  157. https://gcc.gnu.org/PR14457
!  158. https://gcc.gnu.org/PR14542
!  159. https://gcc.gnu.org/PR15100
!  160. https://gcc.gnu.org/PR15296
!  161. https://gcc.gnu.org/PR15396
!  162. https://gcc.gnu.org/PR15782
!  163. https://gcc.gnu.org/PR11610
!  164. https://gcc.gnu.org/PR15488
!  165. https://gcc.gnu.org/PR15489
!  166. https://gcc.gnu.org/PR13928
!  167. https://gcc.gnu.org/PR14150
!  168. https://gcc.gnu.org/PR14949
!  169. https://gcc.gnu.org/PR15123
!  170. https://gcc.gnu.org/PR16469
!  171. https://gcc.gnu.org/PR16344
!  172. https://gcc.gnu.org/PR16842
!  173. https://gcc.gnu.org/PR12608
!  174. https://gcc.gnu.org/PR14492
!  175. https://gcc.gnu.org/PR15461
!  176. https://gcc.gnu.org/PR15890
!  177. https://gcc.gnu.org/PR16180
!  178. https://gcc.gnu.org/PR16224
!  179. https://gcc.gnu.org/PR16408
!  180. https://gcc.gnu.org/PR16529
!  181. https://gcc.gnu.org/PR16698
!  182. https://gcc.gnu.org/PR16706
!  183. https://gcc.gnu.org/PR16810
!  184. https://gcc.gnu.org/PR16851
!  185. https://gcc.gnu.org/PR16870
!  186. https://gcc.gnu.org/PR16904
!  187. https://gcc.gnu.org/PR16905
!  188. https://gcc.gnu.org/PR16964
!  189. https://gcc.gnu.org/PR17068
!  190. https://gcc.gnu.org/PR16366
!  191. https://gcc.gnu.org/PR15345
!  192. https://gcc.gnu.org/PR16590
!  193. https://gcc.gnu.org/PR16693
!  194. https://gcc.gnu.org/PR17078
!  195. https://gcc.gnu.org/PR13956
!  196. https://gcc.gnu.org/PR16684
!  197. https://gcc.gnu.org/PR12658
!  198. https://gcc.gnu.org/PR13092
!  199. https://gcc.gnu.org/PR15320
!  200. https://gcc.gnu.org/PR16246
!  201. https://gcc.gnu.org/PR16273
!  202. https://gcc.gnu.org/PR16401
!  203. https://gcc.gnu.org/PR16411
!  204. https://gcc.gnu.org/PR16489
!  205. https://gcc.gnu.org/PR16618
!  206. https://gcc.gnu.org/PR16637
!  207. https://gcc.gnu.org/PR16717
!  208. https://gcc.gnu.org/PR16813
!  209. https://gcc.gnu.org/PR16853
!  210. https://gcc.gnu.org/PR16889
!  211. https://gcc.gnu.org/PR16959
!  212. https://gcc.gnu.org/PR7587
!  213. https://gcc.gnu.org/PR16473
!  214. https://gcc.gnu.org/PR16478
!  215. https://gcc.gnu.org/PR10695
!  216. https://gcc.gnu.org/PR16974
!  217. https://gcc.gnu.org/PR16298
!  218. https://gcc.gnu.org/PR17113
!  219. https://gcc.gnu.org/PR14697
!  220. https://gcc.gnu.org/PR15869
!  221. https://gcc.gnu.org/PR16325
!  222. https://gcc.gnu.org/PR16357
!  223. https://gcc.gnu.org/PR16380
!  224. https://gcc.gnu.org/PR16407
!  225. https://gcc.gnu.org/PR16643
!  226. https://gcc.gnu.org/PR15927
!  227. https://gcc.gnu.org/PR15948
!  228. https://gcc.gnu.org/PR17019
!  229. https://gcc.gnu.org/PR16130
!  230. https://gcc.gnu.org/PR16142
!  231. https://gcc.gnu.org/PR16278
!  232. https://gcc.gnu.org/PR16414
!  233. https://gcc.gnu.org/PR16445
!  234. https://gcc.gnu.org/PR16490
!  235. https://gcc.gnu.org/PR16683
!  236. https://gcc.gnu.org/PR16195
!  237. https://gcc.gnu.org/PR16239
!  238. https://gcc.gnu.org/PR16199
!  239. https://gcc.gnu.org/PR16416
!  240. https://gcc.gnu.org/PR16430
!  241. https://gcc.gnu.org/PR16379
!  242. https://gcc.gnu.org/PR17093
!  243. https://gcc.gnu.org/PR17119
!  244. https://gcc.gnu.org/PR15928
!  245. https://gcc.gnu.org/PR16210
!  246. https://gcc.gnu.org/PR15488
!  247. https://gcc.gnu.org/PR16250
!  248. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=3.4.3
!  249. https://gcc.gnu.org/PR17369
!  250. https://gcc.gnu.org/PR17850
!  251. https://gcc.gnu.org/PR13948
!  252. https://gcc.gnu.org/PR14492
!  253. https://gcc.gnu.org/PR16301
!  254. https://gcc.gnu.org/PR16566
!  255. https://gcc.gnu.org/PR17023
!  256. https://gcc.gnu.org/PR17027
!  257. https://gcc.gnu.org/PR17524
!  258. https://gcc.gnu.org/PR17826
!  259. https://gcc.gnu.org/PR15526
!  260. https://gcc.gnu.org/PR16999
!  261. https://gcc.gnu.org/PR17503
!  262. https://gcc.gnu.org/PR17581
!  263. https://gcc.gnu.org/PR18129
!  264. https://gcc.gnu.org/PR10975
!  265. https://gcc.gnu.org/PR11722
!  266. https://gcc.gnu.org/PR14534
!  267. https://gcc.gnu.org/PR15172
!  268. https://gcc.gnu.org/PR15786
!  269. https://gcc.gnu.org/PR16162
!  270. https://gcc.gnu.org/PR16612
!  271. https://gcc.gnu.org/PR16715
!  272. https://gcc.gnu.org/PR16848
!  273. https://gcc.gnu.org/PR17132
!  274. https://gcc.gnu.org/PR17259
!  275. https://gcc.gnu.org/PR17327
!  276. https://gcc.gnu.org/PR17393
!  277. https://gcc.gnu.org/PR17501
!  278. https://gcc.gnu.org/PR17537
!  279. https://gcc.gnu.org/PR17585
!  280. https://gcc.gnu.org/PR17821
!  281. https://gcc.gnu.org/PR17829
!  282. https://gcc.gnu.org/PR17851
!  283. https://gcc.gnu.org/PR17976
!  284. https://gcc.gnu.org/PR18020
!  285. https://gcc.gnu.org/PR18093
!  286. https://gcc.gnu.org/PR18140
!  287. https://gcc.gnu.org/PR17541
!  288. https://gcc.gnu.org/PR17853
!  289. https://gcc.gnu.org/PR17245
!  290. https://gcc.gnu.org/PR17167
!  291. https://gcc.gnu.org/PR17277
!  292. https://gcc.gnu.org/PR17505
!  293. https://gcc.gnu.org/PR17684
!  294. https://gcc.gnu.org/PR17384
!  295. https://gcc.gnu.org/PR17770
!  296. https://gcc.gnu.org/PR11476
!  297. https://gcc.gnu.org/PR14064
!  298. https://gcc.gnu.org/PR14678
!  299. https://gcc.gnu.org/PR15583
!  300. https://gcc.gnu.org/PR15790
!  301. https://gcc.gnu.org/PR15886
!  302. https://gcc.gnu.org/PR16884
!  303. https://gcc.gnu.org/PR13841
!  304. https://gcc.gnu.org/PR15860
!  305. https://gcc.gnu.org/PR17465
!  306. https://gcc.gnu.org/PR17469
!  307. https://gcc.gnu.org/PR18138
!  308. https://gcc.gnu.org/PR15498
!  309. https://gcc.gnu.org/PR15747
!  310. https://gcc.gnu.org/PR16406
!  311. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=3.4.4
!  312. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=3.4.5
!  313. https://gcc.gnu.org/PR24688
!  314. https://gcc.gnu.org/PR17188
!  315. https://gcc.gnu.org/PR20187
!  316. https://gcc.gnu.org/PR21873
!  317. https://gcc.gnu.org/PR21899
!  318. https://gcc.gnu.org/PR22061
!  319. https://gcc.gnu.org/PR22208
!  320. https://gcc.gnu.org/PR22458
!  321. https://gcc.gnu.org/PR22589
!  322. https://gcc.gnu.org/PR24101
!  323. https://gcc.gnu.org/PR10611
!  324. https://gcc.gnu.org/PR13377
!  325. https://gcc.gnu.org/PR16002
!  326. https://gcc.gnu.org/PR17413
!  327. https://gcc.gnu.org/PR17609
!  328. https://gcc.gnu.org/PR17618
!  329. https://gcc.gnu.org/PR18124
!  330. https://gcc.gnu.org/PR18155
!  331. https://gcc.gnu.org/PR18177
!  332. https://gcc.gnu.org/PR18368
!  333. https://gcc.gnu.org/PR18378
!  334. https://gcc.gnu.org/PR18466
!  335. https://gcc.gnu.org/PR18512
!  336. https://gcc.gnu.org/PR18545
!  337. https://gcc.gnu.org/PR18738
!  338. https://gcc.gnu.org/PR18803
!  339. https://gcc.gnu.org/PR19004
!  340. https://gcc.gnu.org/PR19208
!  341. https://gcc.gnu.org/PR19253
!  342. https://gcc.gnu.org/PR19608
!  343. https://gcc.gnu.org/PR19884
!  344. https://gcc.gnu.org/PR20153
!  345. https://gcc.gnu.org/PR20563
!  346. https://gcc.gnu.org/PR20789
!  347. https://gcc.gnu.org/PR21336
!  348. https://gcc.gnu.org/PR21768
!  349. https://gcc.gnu.org/PR21853
!  350. https://gcc.gnu.org/PR21903
!  351. https://gcc.gnu.org/PR21983
!  352. https://gcc.gnu.org/PR21987
!  353. https://gcc.gnu.org/PR22153
!  354. https://gcc.gnu.org/PR22172
!  355. https://gcc.gnu.org/PR21286
!  356. https://gcc.gnu.org/PR22233
!  357. https://gcc.gnu.org/PR22508
!  358. https://gcc.gnu.org/PR22545
!  359. https://gcc.gnu.org/PR23528
!  360. https://gcc.gnu.org/PR23550
!  361. https://gcc.gnu.org/PR23586
!  362. https://gcc.gnu.org/PR23624
!  363. https://gcc.gnu.org/PR23639
!  364. https://gcc.gnu.org/PR23797
!  365. https://gcc.gnu.org/PR23965
!  366. https://gcc.gnu.org/PR24052
!  367. https://gcc.gnu.org/PR24580
!  368. https://gcc.gnu.org/PR24267
!  369. https://gcc.gnu.org/PR17810
!  370. https://gcc.gnu.org/PR17860
!  371. https://gcc.gnu.org/PR21709
!  372. https://gcc.gnu.org/PR21964
!  373. https://gcc.gnu.org/PR22167
!  374. https://gcc.gnu.org/PR22619
!  375. https://gcc.gnu.org/PR23241
!  376. https://gcc.gnu.org/PR23478
!  377. https://gcc.gnu.org/PR24470
!  378. https://gcc.gnu.org/PR24950
!  379. https://gcc.gnu.org/PR14400
!  380. https://gcc.gnu.org/PR14940
!  381. https://gcc.gnu.org/PR20239
!  382. https://gcc.gnu.org/PR15220
!  383. https://gcc.gnu.org/PR19275
!  384. https://gcc.gnu.org/PR21888
!  385. https://gcc.gnu.org/PR15342
!  386. https://gcc.gnu.org/PR23985
!  387. https://gcc.gnu.org/PR16719
!  388. https://gcc.gnu.org/PR21723
!  389. https://gcc.gnu.org/PR21841
!  390. https://gcc.gnu.org/PR23644
!  391. https://gcc.gnu.org/PR24718
!  392. https://gcc.gnu.org/PR18421
!  393. https://gcc.gnu.org/PR20621
!  394. https://gcc.gnu.org/PR18583
!  395. https://gcc.gnu.org/PR20191
!  396. https://gcc.gnu.org/PR22083
!  397. https://gcc.gnu.org/PR23070
!  398. https://gcc.gnu.org/PR23404
!  399. https://gcc.gnu.org/PR23539
!  400. https://gcc.gnu.org/PR24102
!  401. https://gcc.gnu.org/PR24465
!  402. https://gcc.gnu.org/PR19933
!  403. https://gcc.gnu.org/PR21889
!  404. https://gcc.gnu.org/PR19300
!  405. https://gcc.gnu.org/PR20301
!  406. https://gcc.gnu.org/PR20673
!  407. https://gcc.gnu.org/PR18582
!  408. https://gcc.gnu.org/PR19340
!  409. https://gcc.gnu.org/PR21716
!  410. https://gcc.gnu.org/PR24315
!  411. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=3.4.6
!  412. https://gcc.gnu.org/onlinedocs/
!  413. mailto:gcc-help@gcc.gnu.org
!  414. mailto:gcc@gcc.gnu.org
!  415. https://gcc.gnu.org/lists.html
!  416. http://www.fsf.org/
!  417. https://gcc.gnu.org/about.html
!  418. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.3/index.html
- 
                               GCC 3.3 Release Series
  
     May 03, 2005
--- 10565,10970 ----
    17. http://www.eclipse.org/
    18. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/g77/News.html
    19. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gcc/Alpha-Built-in-Functions.html
!   20. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gccint/Processor-pipeline-description.html
!   21. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gccint/Comparison-of-the-two-descriptions.html
!   22. https://gcc.gnu.org/onlinedocs/gcc-3.4.3/gccint/Processor-pipeline-description.html
!   23. http://gcc.gnu.org/gcc-3.4/mips-abi.html
!   24. http://gcc.gnu.org/gcc-3.4/powerpc-abi.html
!   25. http://gcc.gnu.org/gcc-3.4/sparc-abi.html
!   26. https://gcc.gnu.org/bugzilla/buglist.cgi?short_desc_type=notregexp&short_desc=\[3\.4.*[Rr]egression&target_milestone=3.4.0&bug_status=RESOLVED&resolution=FIXED
!   27. https://gcc.gnu.org/PR10129
!   28. https://gcc.gnu.org/PR14576
!   29. https://gcc.gnu.org/PR14760
!   30. https://gcc.gnu.org/PR14671
!   31. https://gcc.gnu.org/PR15093
!   32. https://gcc.gnu.org/PR15178
!   33. https://gcc.gnu.org/PR12753
!   34. https://gcc.gnu.org/PR13985
!   35. https://gcc.gnu.org/PR14810
!   36. https://gcc.gnu.org/PR14883
!   37. https://gcc.gnu.org/PR15044
!   38. https://gcc.gnu.org/PR15057
!   39. https://gcc.gnu.org/PR15064
!   40. https://gcc.gnu.org/PR15142
!   41. https://gcc.gnu.org/PR15159
!   42. https://gcc.gnu.org/PR15165
!   43. https://gcc.gnu.org/PR15193
!   44. https://gcc.gnu.org/PR15209
!   45. https://gcc.gnu.org/PR15227
!   46. https://gcc.gnu.org/PR15285
!   47. https://gcc.gnu.org/PR15299
!   48. https://gcc.gnu.org/PR15329
!   49. https://gcc.gnu.org/PR15550
!   50. https://gcc.gnu.org/PR15554
!   51. https://gcc.gnu.org/PR15640
!   52. https://gcc.gnu.org/PR15666
!   53. https://gcc.gnu.org/PR15696
!   54. https://gcc.gnu.org/PR15701
!   55. https://gcc.gnu.org/PR15761
!   56. https://gcc.gnu.org/PR15829
!   57. https://gcc.gnu.org/PR14538
!   58. https://gcc.gnu.org/PR12391
!   59. https://gcc.gnu.org/PR14649
!   60. https://gcc.gnu.org/PR15004
!   61. https://gcc.gnu.org/PR15749
!   62. https://gcc.gnu.org/PR10646
!   63. https://gcc.gnu.org/PR12077
!   64. https://gcc.gnu.org/PR13598
!   65. https://gcc.gnu.org/PR14211
!   66. https://gcc.gnu.org/PR14220
!   67. https://gcc.gnu.org/PR14245
!   68. https://gcc.gnu.org/PR14340
!   69. https://gcc.gnu.org/PR14600
!   70. https://gcc.gnu.org/PR14668
!   71. https://gcc.gnu.org/PR14775
!   72. https://gcc.gnu.org/PR14821
!   73. https://gcc.gnu.org/PR14930
!   74. https://gcc.gnu.org/PR14932
!   75. https://gcc.gnu.org/PR14950
!   76. https://gcc.gnu.org/PR14962
!   77. https://gcc.gnu.org/PR14975
!   78. https://gcc.gnu.org/PR15002
!   79. https://gcc.gnu.org/PR15025
!   80. https://gcc.gnu.org/PR15046
!   81. https://gcc.gnu.org/PR15069
!   82. https://gcc.gnu.org/PR15074
!   83. https://gcc.gnu.org/PR15083
!   84. https://gcc.gnu.org/PR15096
!   85. https://gcc.gnu.org/PR15287
!   86. https://gcc.gnu.org/PR15317
!   87. https://gcc.gnu.org/PR15337
!   88. https://gcc.gnu.org/PR15361
!   89. https://gcc.gnu.org/PR15412
!   90. https://gcc.gnu.org/PR15427
!   91. https://gcc.gnu.org/PR15471
!   92. https://gcc.gnu.org/PR15503
!   93. https://gcc.gnu.org/PR15507
!   94. https://gcc.gnu.org/PR15542
!   95. https://gcc.gnu.org/PR15565
!   96. https://gcc.gnu.org/PR15625
!   97. https://gcc.gnu.org/PR15629
!   98. https://gcc.gnu.org/PR15742
!   99. https://gcc.gnu.org/PR15775
!  100. https://gcc.gnu.org/PR15821
!  101. https://gcc.gnu.org/PR15862
!  102. https://gcc.gnu.org/PR15875
!  103. https://gcc.gnu.org/PR15877
!  104. https://gcc.gnu.org/PR15947
!  105. https://gcc.gnu.org/PR16020
!  106. https://gcc.gnu.org/PR16154
!  107. https://gcc.gnu.org/PR16174
!  108. https://gcc.gnu.org/PR14315
!  109. https://gcc.gnu.org/PR15151
!  110. https://gcc.gnu.org/PR7993
!  111. https://gcc.gnu.org/PR15228
!  112. https://gcc.gnu.org/PR15345
!  113. https://gcc.gnu.org/PR15945
!  114. https://gcc.gnu.org/PR15526
!  115. https://gcc.gnu.org/PR14690
!  116. https://gcc.gnu.org/PR15112
!  117. https://gcc.gnu.org/PR15067
!  118. https://gcc.gnu.org/PR1963
!  119. https://gcc.gnu.org/PR15717
!  120. https://gcc.gnu.org/PR14782
!  121. https://gcc.gnu.org/PR14828
!  122. https://gcc.gnu.org/PR15202
!  123. https://gcc.gnu.org/PR14610
!  124. https://gcc.gnu.org/PR14813
!  125. https://gcc.gnu.org/PR14857
!  126. https://gcc.gnu.org/PR15598
!  127. https://gcc.gnu.org/PR15653
!  128. https://gcc.gnu.org/PR15189
!  129. https://gcc.gnu.org/PR15331
!  130. https://gcc.gnu.org/PR16144
!  131. https://gcc.gnu.org/PR16176
!  132. https://gcc.gnu.org/PR11591
!  133. https://gcc.gnu.org/PR12028
!  134. https://gcc.gnu.org/PR14478
!  135. https://gcc.gnu.org/PR14567
!  136. https://gcc.gnu.org/PR14715
!  137. https://gcc.gnu.org/PR14902
!  138. https://gcc.gnu.org/PR14924
!  139. https://gcc.gnu.org/PR14960
!  140. https://gcc.gnu.org/PR15106
!  141. https://gcc.gnu.org/PR16026
!  142. https://gcc.gnu.org/PR15191
!  143. https://gcc.gnu.org/PR15662
!  144. https://gcc.gnu.org/PR15054
!  145. https://gcc.gnu.org/PR15783
!  146. https://gcc.gnu.org/PR15626
!  147. https://gcc.gnu.org/PR14326
!  148. https://gcc.gnu.org/PR14723
!  149. https://gcc.gnu.org/PR15290
!  150. https://gcc.gnu.org/PR15250
!  151. https://gcc.gnu.org/PR15551
!  152. https://gcc.gnu.org/PR8309
!  153. https://gcc.gnu.org/PR13250
!  154. https://gcc.gnu.org/PR13803
!  155. https://gcc.gnu.org/PR14093
!  156. https://gcc.gnu.org/PR14457
!  157. https://gcc.gnu.org/PR14542
!  158. https://gcc.gnu.org/PR15100
!  159. https://gcc.gnu.org/PR15296
!  160. https://gcc.gnu.org/PR15396
!  161. https://gcc.gnu.org/PR15782
!  162. https://gcc.gnu.org/PR11610
!  163. https://gcc.gnu.org/PR15488
!  164. https://gcc.gnu.org/PR15489
!  165. https://gcc.gnu.org/PR13928
!  166. https://gcc.gnu.org/PR14150
!  167. https://gcc.gnu.org/PR14949
!  168. https://gcc.gnu.org/PR15123
!  169. https://gcc.gnu.org/PR16469
!  170. https://gcc.gnu.org/PR16344
!  171. https://gcc.gnu.org/PR16842
!  172. https://gcc.gnu.org/PR12608
!  173. https://gcc.gnu.org/PR14492
!  174. https://gcc.gnu.org/PR15461
!  175. https://gcc.gnu.org/PR15890
!  176. https://gcc.gnu.org/PR16180
!  177. https://gcc.gnu.org/PR16224
!  178. https://gcc.gnu.org/PR16408
!  179. https://gcc.gnu.org/PR16529
!  180. https://gcc.gnu.org/PR16698
!  181. https://gcc.gnu.org/PR16706
!  182. https://gcc.gnu.org/PR16810
!  183. https://gcc.gnu.org/PR16851
!  184. https://gcc.gnu.org/PR16870
!  185. https://gcc.gnu.org/PR16904
!  186. https://gcc.gnu.org/PR16905
!  187. https://gcc.gnu.org/PR16964
!  188. https://gcc.gnu.org/PR17068
!  189. https://gcc.gnu.org/PR16366
!  190. https://gcc.gnu.org/PR15345
!  191. https://gcc.gnu.org/PR16590
!  192. https://gcc.gnu.org/PR16693
!  193. https://gcc.gnu.org/PR17078
!  194. https://gcc.gnu.org/PR13956
!  195. https://gcc.gnu.org/PR16684
!  196. https://gcc.gnu.org/PR12658
!  197. https://gcc.gnu.org/PR13092
!  198. https://gcc.gnu.org/PR15320
!  199. https://gcc.gnu.org/PR16246
!  200. https://gcc.gnu.org/PR16273
!  201. https://gcc.gnu.org/PR16401
!  202. https://gcc.gnu.org/PR16411
!  203. https://gcc.gnu.org/PR16489
!  204. https://gcc.gnu.org/PR16618
!  205. https://gcc.gnu.org/PR16637
!  206. https://gcc.gnu.org/PR16717
!  207. https://gcc.gnu.org/PR16813
!  208. https://gcc.gnu.org/PR16853
!  209. https://gcc.gnu.org/PR16889
!  210. https://gcc.gnu.org/PR16959
!  211. https://gcc.gnu.org/PR7587
!  212. https://gcc.gnu.org/PR16473
!  213. https://gcc.gnu.org/PR16478
!  214. https://gcc.gnu.org/PR10695
!  215. https://gcc.gnu.org/PR16974
!  216. https://gcc.gnu.org/PR16298
!  217. https://gcc.gnu.org/PR17113
!  218. https://gcc.gnu.org/PR14697
!  219. https://gcc.gnu.org/PR15869
!  220. https://gcc.gnu.org/PR16325
!  221. https://gcc.gnu.org/PR16357
!  222. https://gcc.gnu.org/PR16380
!  223. https://gcc.gnu.org/PR16407
!  224. https://gcc.gnu.org/PR16643
!  225. https://gcc.gnu.org/PR15927
!  226. https://gcc.gnu.org/PR15948
!  227. https://gcc.gnu.org/PR17019
!  228. https://gcc.gnu.org/PR16130
!  229. https://gcc.gnu.org/PR16142
!  230. https://gcc.gnu.org/PR16278
!  231. https://gcc.gnu.org/PR16414
!  232. https://gcc.gnu.org/PR16445
!  233. https://gcc.gnu.org/PR16490
!  234. https://gcc.gnu.org/PR16683
!  235. https://gcc.gnu.org/PR16195
!  236. https://gcc.gnu.org/PR16239
!  237. https://gcc.gnu.org/PR16199
!  238. https://gcc.gnu.org/PR16416
!  239. https://gcc.gnu.org/PR16430
!  240. https://gcc.gnu.org/PR16379
!  241. https://gcc.gnu.org/PR17093
!  242. https://gcc.gnu.org/PR17119
!  243. https://gcc.gnu.org/PR15928
!  244. https://gcc.gnu.org/PR16210
!  245. https://gcc.gnu.org/PR15488
!  246. https://gcc.gnu.org/PR16250
!  247. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=3.4.3
!  248. https://gcc.gnu.org/PR17369
!  249. https://gcc.gnu.org/PR17850
!  250. https://gcc.gnu.org/PR13948
!  251. https://gcc.gnu.org/PR14492
!  252. https://gcc.gnu.org/PR16301
!  253. https://gcc.gnu.org/PR16566
!  254. https://gcc.gnu.org/PR17023
!  255. https://gcc.gnu.org/PR17027
!  256. https://gcc.gnu.org/PR17524
!  257. https://gcc.gnu.org/PR17826
!  258. https://gcc.gnu.org/PR15526
!  259. https://gcc.gnu.org/PR16999
!  260. https://gcc.gnu.org/PR17503
!  261. https://gcc.gnu.org/PR17581
!  262. https://gcc.gnu.org/PR18129
!  263. https://gcc.gnu.org/PR10975
!  264. https://gcc.gnu.org/PR11722
!  265. https://gcc.gnu.org/PR14534
!  266. https://gcc.gnu.org/PR15172
!  267. https://gcc.gnu.org/PR15786
!  268. https://gcc.gnu.org/PR16162
!  269. https://gcc.gnu.org/PR16612
!  270. https://gcc.gnu.org/PR16715
!  271. https://gcc.gnu.org/PR16848
!  272. https://gcc.gnu.org/PR17132
!  273. https://gcc.gnu.org/PR17259
!  274. https://gcc.gnu.org/PR17327
!  275. https://gcc.gnu.org/PR17393
!  276. https://gcc.gnu.org/PR17501
!  277. https://gcc.gnu.org/PR17537
!  278. https://gcc.gnu.org/PR17585
!  279. https://gcc.gnu.org/PR17821
!  280. https://gcc.gnu.org/PR17829
!  281. https://gcc.gnu.org/PR17851
!  282. https://gcc.gnu.org/PR17976
!  283. https://gcc.gnu.org/PR18020
!  284. https://gcc.gnu.org/PR18093
!  285. https://gcc.gnu.org/PR18140
!  286. https://gcc.gnu.org/PR17541
!  287. https://gcc.gnu.org/PR17853
!  288. https://gcc.gnu.org/PR17245
!  289. https://gcc.gnu.org/PR17167
!  290. https://gcc.gnu.org/PR17277
!  291. https://gcc.gnu.org/PR17505
!  292. https://gcc.gnu.org/PR17684
!  293. https://gcc.gnu.org/PR17384
!  294. https://gcc.gnu.org/PR17770
!  295. https://gcc.gnu.org/PR11476
!  296. https://gcc.gnu.org/PR14064
!  297. https://gcc.gnu.org/PR14678
!  298. https://gcc.gnu.org/PR15583
!  299. https://gcc.gnu.org/PR15790
!  300. https://gcc.gnu.org/PR15886
!  301. https://gcc.gnu.org/PR16884
!  302. https://gcc.gnu.org/PR13841
!  303. https://gcc.gnu.org/PR15860
!  304. https://gcc.gnu.org/PR17465
!  305. https://gcc.gnu.org/PR17469
!  306. https://gcc.gnu.org/PR18138
!  307. https://gcc.gnu.org/PR15498
!  308. https://gcc.gnu.org/PR15747
!  309. https://gcc.gnu.org/PR16406
!  310. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=3.4.4
!  311. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=3.4.5
!  312. https://gcc.gnu.org/PR24688
!  313. https://gcc.gnu.org/PR17188
!  314. https://gcc.gnu.org/PR20187
!  315. https://gcc.gnu.org/PR21873
!  316. https://gcc.gnu.org/PR21899
!  317. https://gcc.gnu.org/PR22061
!  318. https://gcc.gnu.org/PR22208
!  319. https://gcc.gnu.org/PR22458
!  320. https://gcc.gnu.org/PR22589
!  321. https://gcc.gnu.org/PR24101
!  322. https://gcc.gnu.org/PR10611
!  323. https://gcc.gnu.org/PR13377
!  324. https://gcc.gnu.org/PR16002
!  325. https://gcc.gnu.org/PR17413
!  326. https://gcc.gnu.org/PR17609
!  327. https://gcc.gnu.org/PR17618
!  328. https://gcc.gnu.org/PR18124
!  329. https://gcc.gnu.org/PR18155
!  330. https://gcc.gnu.org/PR18177
!  331. https://gcc.gnu.org/PR18368
!  332. https://gcc.gnu.org/PR18378
!  333. https://gcc.gnu.org/PR18466
!  334. https://gcc.gnu.org/PR18512
!  335. https://gcc.gnu.org/PR18545
!  336. https://gcc.gnu.org/PR18738
!  337. https://gcc.gnu.org/PR18803
!  338. https://gcc.gnu.org/PR19004
!  339. https://gcc.gnu.org/PR19208
!  340. https://gcc.gnu.org/PR19253
!  341. https://gcc.gnu.org/PR19608
!  342. https://gcc.gnu.org/PR19884
!  343. https://gcc.gnu.org/PR20153
!  344. https://gcc.gnu.org/PR20563
!  345. https://gcc.gnu.org/PR20789
!  346. https://gcc.gnu.org/PR21336
!  347. https://gcc.gnu.org/PR21768
!  348. https://gcc.gnu.org/PR21853
!  349. https://gcc.gnu.org/PR21903
!  350. https://gcc.gnu.org/PR21983
!  351. https://gcc.gnu.org/PR21987
!  352. https://gcc.gnu.org/PR22153
!  353. https://gcc.gnu.org/PR22172
!  354. https://gcc.gnu.org/PR21286
!  355. https://gcc.gnu.org/PR22233
!  356. https://gcc.gnu.org/PR22508
!  357. https://gcc.gnu.org/PR22545
!  358. https://gcc.gnu.org/PR23528
!  359. https://gcc.gnu.org/PR23550
!  360. https://gcc.gnu.org/PR23586
!  361. https://gcc.gnu.org/PR23624
!  362. https://gcc.gnu.org/PR23639
!  363. https://gcc.gnu.org/PR23797
!  364. https://gcc.gnu.org/PR23965
!  365. https://gcc.gnu.org/PR24052
!  366. https://gcc.gnu.org/PR24580
!  367. https://gcc.gnu.org/PR24267
!  368. https://gcc.gnu.org/PR17810
!  369. https://gcc.gnu.org/PR17860
!  370. https://gcc.gnu.org/PR21709
!  371. https://gcc.gnu.org/PR21964
!  372. https://gcc.gnu.org/PR22167
!  373. https://gcc.gnu.org/PR22619
!  374. https://gcc.gnu.org/PR23241
!  375. https://gcc.gnu.org/PR23478
!  376. https://gcc.gnu.org/PR24470
!  377. https://gcc.gnu.org/PR24950
!  378. https://gcc.gnu.org/PR14400
!  379. https://gcc.gnu.org/PR14940
!  380. https://gcc.gnu.org/PR20239
!  381. https://gcc.gnu.org/PR15220
!  382. https://gcc.gnu.org/PR19275
!  383. https://gcc.gnu.org/PR21888
!  384. https://gcc.gnu.org/PR15342
!  385. https://gcc.gnu.org/PR23985
!  386. https://gcc.gnu.org/PR16719
!  387. https://gcc.gnu.org/PR21723
!  388. https://gcc.gnu.org/PR21841
!  389. https://gcc.gnu.org/PR23644
!  390. https://gcc.gnu.org/PR24718
!  391. https://gcc.gnu.org/PR18421
!  392. https://gcc.gnu.org/PR20621
!  393. https://gcc.gnu.org/PR18583
!  394. https://gcc.gnu.org/PR20191
!  395. https://gcc.gnu.org/PR22083
!  396. https://gcc.gnu.org/PR23070
!  397. https://gcc.gnu.org/PR23404
!  398. https://gcc.gnu.org/PR23539
!  399. https://gcc.gnu.org/PR24102
!  400. https://gcc.gnu.org/PR24465
!  401. https://gcc.gnu.org/PR19933
!  402. https://gcc.gnu.org/PR21889
!  403. https://gcc.gnu.org/PR19300
!  404. https://gcc.gnu.org/PR20301
!  405. https://gcc.gnu.org/PR20673
!  406. https://gcc.gnu.org/PR18582
!  407. https://gcc.gnu.org/PR19340
!  408. https://gcc.gnu.org/PR21716
!  409. https://gcc.gnu.org/PR24315
!  410. https://gcc.gnu.org/bugzilla/buglist.cgi?bug_status=RESOLVED&resolution=FIXED&target_milestone=3.4.6
!  411. https://gcc.gnu.org/onlinedocs/
!  412. mailto:gcc-help@gcc.gnu.org
!  413. mailto:gcc@gcc.gnu.org
!  414. https://gcc.gnu.org/lists.html
!  415. http://www.fsf.org/
!  416. https://gcc.gnu.org/about.html
!  417. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.3/index.html
                               GCC 3.3 Release Series
  
     May 03, 2005
*************** http://gcc.gnu.org/gcc-3.3/index.html
*** 10948,10953 ****
--- 10981,10988 ----
     improvements, bug fixes, and other changes, thanks to an [3]amazing
     group of volunteers.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 3.3.6
*************** References and Acknowledgements
*** 11003,11009 ****
     provided this notice is preserved.
  
     These pages are [21]maintained by the GCC team. Last modified
!    2016-01-30[22].
  
  References
  
--- 11038,11044 ----
     provided this notice is preserved.
  
     These pages are [21]maintained by the GCC team. Last modified
!    2016-09-30[22].
  
  References
  
*************** References
*** 11031,11037 ****
    22. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.3/changes.html
- 
                               GCC 3.3 Release Series
                          Changes, New Features, and Fixes
  
--- 11066,11071 ----
*************** References
*** 12942,12948 ****
   557. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.2/index.html
- 
                               GCC 3.2 Release Series
  
     April 25, 2003
--- 12976,12981 ----
*************** http://gcc.gnu.org/gcc-3.2/index.html
*** 12962,12967 ****
--- 12995,13002 ----
     Please refer to our [2]detailed list of news, caveats, and bug-fixes
     for further information.
  
+    This release series is no longer maintained.
+ 
  Release History
  
     GCC 3.2.3
*************** References and Acknowledgements
*** 13008,13014 ****
     provided this notice is preserved.
  
     These pages are [17]maintained by the GCC team. Last modified
!    2016-01-30[18].
  
  References
  
--- 13043,13049 ----
     provided this notice is preserved.
  
     These pages are [17]maintained by the GCC team. Last modified
!    2016-09-30[18].
  
  References
  
*************** References
*** 13032,13038 ****
    18. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.2/changes.html
- 
                               GCC 3.2 Release Series
                          Changes, New Features, and Fixes
  
--- 13067,13072 ----
*************** References
*** 13890,13896 ****
   252. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.1/index.html
- 
                                      GCC 3.1
  
     July 27, 2002
--- 13924,13929 ----
*************** http://gcc.gnu.org/gcc-3.1/index.html
*** 13900,13905 ****
--- 13933,13940 ----
  
     The links below still apply to GCC 3.1.1.
  
+    This release series is no longer maintained.
+ 
     May 15, 2002
  
     The [2]GNU project and the GCC developers are pleased to announce the
*************** http://gcc.gnu.org/gcc-3.1/index.html
*** 13936,13942 ****
     provided this notice is preserved.
  
     These pages are [14]maintained by the GCC team. Last modified
!    2016-01-30[15].
  
  References
  
--- 13971,13977 ----
     provided this notice is preserved.
  
     These pages are [14]maintained by the GCC team. Last modified
!    2016-09-30[15].
  
  References
  
*************** References
*** 13957,13963 ****
    15. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.1/changes.html
- 
                               GCC 3.1 Release Series
                          Changes, New Features, and Fixes
  
--- 13992,13997 ----
*************** New Languages and Language specific impr
*** 14147,14161 ****
  
  New Targets and Target Specific Improvements
  
!      * Hans-Peter Nilsson has contributed a port to [8]MMIX, the CPU
         architecture used in new editions of Donald E. Knuth's The Art of
         Computer Programming.
!      * [9]Axis Communications has contributed its port to the CRIS CPU
!        architecture, used in the ETRAX system-on-a-chip series. See
!        [10]Axis' developer site for technical information.
!      * Alexandre Oliva, of Red Hat, has contributed a port to the
!        [11]SuperH SH5 64-bit RISC microprocessor architecture, extending
!        the existing SH port.
       * UltraSPARC is fully supported in 64-bit mode. The option -m64
         enables it.
       * For compatibility with the Sun compiler #pragma redefine_extname
--- 14181,14194 ----
  
  New Targets and Target Specific Improvements
  
!      * Hans-Peter Nilsson has contributed a port to MMIX, the CPU
         architecture used in new editions of Donald E. Knuth's The Art of
         Computer Programming.
!      * Axis Communications has contributed its port to the CRIS CPU
!        architecture, used in the ETRAX system-on-a-chip series.
!      * Alexandre Oliva, of Red Hat, has contributed a port to the SuperH
!        SH5 64-bit RISC microprocessor architecture, extending the existing
!        SH port.
       * UltraSPARC is fully supported in 64-bit mode. The option -m64
         enables it.
       * For compatibility with the Sun compiler #pragma redefine_extname
*************** New Targets and Target Specific Improvem
*** 14163,14169 ****
       * The x86 back end has had some noticeable work done to it.
            + SuSE Labs developers Jan Hubicka, Bo Thorsen and Andreas
              Jaeger have contributed a port to the AMD x86-64 architecture.
!             For more information on x86-64 see [12]http://www.x86-64.org.
            + The compiler now supports MMX, 3DNow!, SSE, and SSE2
              instructions. Options -mmmx, -m3dnow, -msse, and -msse2 will
              enable the respective instruction sets. Intel C++ compatible
--- 14196,14202 ----
       * The x86 back end has had some noticeable work done to it.
            + SuSE Labs developers Jan Hubicka, Bo Thorsen and Andreas
              Jaeger have contributed a port to the AMD x86-64 architecture.
!             For more information on x86-64 see http://www.x86-64.org.
            + The compiler now supports MMX, 3DNow!, SSE, and SSE2
              instructions. Options -mmmx, -m3dnow, -msse, and -msse2 will
              enable the respective instruction sets. Intel C++ compatible
*************** New Targets and Target Specific Improvem
*** 14176,14182 ****
            + For those targets that support it, -mfpmath=sse will cause the
              compiler to generate SSE/SSE2 instructions for floating point
              math instead of x87 instructions. Usually, this will lead to
!             quicker code -- especially on the Pentium 4. Note that only
              scalar floating point instructions are used and GCC does not
              exploit SIMD features yet.
            + Prefetch support has been added to the Pentium III, Pentium 4,
--- 14209,14215 ----
            + For those targets that support it, -mfpmath=sse will cause the
              compiler to generate SSE/SSE2 instructions for floating point
              math instead of x87 instructions. Usually, this will lead to
!             quicker code â€” especially on the Pentium 4. Note that only
              scalar floating point instructions are used and GCC does not
              exploit SIMD features yet.
            + Prefetch support has been added to the Pentium III, Pentium 4,
*************** Documentation improvements
*** 14281,14298 ****
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [13]GCC manuals. If that fails, the
!     [14]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [15]gcc@gcc.gnu.org. All of [16]our lists have public
      archives.
  
!    Copyright (C) [17]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [18]maintained by the GCC team. Last modified
!    2016-01-30[19].
  
  References
  
--- 14314,14331 ----
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [8]GCC manuals. If that fails, the
!     [9]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [10]gcc@gcc.gnu.org. All of [11]our lists have public
      archives.
  
!    Copyright (C) [12]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [13]maintained by the GCC team. Last modified
!    2017-09-09[14].
  
  References
  
*************** References
*** 14303,14323 ****
     5. https://gcc.gnu.org/onlinedocs/libstdc++/faq.html
     6. https://gcc.gnu.org/onlinedocs/gcc-3.1.1/g77/News.html
     7. http://www.adacore.com/
!    8. http://www-cs-faculty.stanford.edu/~uno/mmix.html
!    9. http://www.axis.com/
!   10. http://developer.axis.com/
!   11. http://www.superh.com/
!   12. http://www.x86-64.org/
!   13. https://gcc.gnu.org/onlinedocs/
!   14. mailto:gcc-help@gcc.gnu.org
!   15. mailto:gcc@gcc.gnu.org
!   16. https://gcc.gnu.org/lists.html
!   17. http://www.fsf.org/
!   18. https://gcc.gnu.org/about.html
!   19. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.0/index.html
- 
                                     GCC 3.0.4
  
     February 20, 2002
--- 14336,14350 ----
     5. https://gcc.gnu.org/onlinedocs/libstdc++/faq.html
     6. https://gcc.gnu.org/onlinedocs/gcc-3.1.1/g77/News.html
     7. http://www.adacore.com/
!    8. https://gcc.gnu.org/onlinedocs/
!    9. mailto:gcc-help@gcc.gnu.org
!   10. mailto:gcc@gcc.gnu.org
!   11. https://gcc.gnu.org/lists.html
!   12. http://www.fsf.org/
!   13. https://gcc.gnu.org/about.html
!   14. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.0/index.html
                                     GCC 3.0.4
  
     February 20, 2002
*************** http://gcc.gnu.org/gcc-3.0/index.html
*** 14326,14331 ****
--- 14353,14360 ----
     release of GCC 3.0.4, which is a bug-fix release for the GCC 3.0
     series.
  
+    This release series is no longer maintained.
+ 
     GCC used to stand for the GNU C Compiler, but since the compiler
     supports several other languages aside from C, it now stands for the
     GNU Compiler Collection.
*************** Previous 3.0.x Releases
*** 14370,14376 ****
     provided this notice is preserved.
  
     These pages are [14]maintained by the GCC team. Last modified
!    2016-01-30[15].
  
  References
  
--- 14399,14405 ----
     provided this notice is preserved.
  
     These pages are [14]maintained by the GCC team. Last modified
!    2016-09-30[15].
  
  References
  
*************** References
*** 14391,14397 ****
    15. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.0/features.html
- 
                                GCC 3.0 New Features
  
  Additional changes in GCC 3.0.4
--- 14420,14425 ----
*************** New Languages and Language specific impr
*** 14470,14482 ****
         inter-operating with other IA-64 compilers.
       * The new ABI also significantly reduces the size of symbol and debug
         information.
!      * New [7]C++ support library and many C++ bug fixes, vastly improving
         our conformance to the ISO C++ standard.
!      * New [8]inliner for C++.
       * Rewritten C preprocessor, integrated into the C, C++ and Objective
         C compilers, with very many improvements including ISO C99 support
!        and [9]improvements to dependency generation.
!      * Support for more [10]ISO C99 features.
       * Many improvements to support for checking calls to format functions
         such as printf and scanf, including support for ISO C99 format
         features, extensions from the Single Unix Specification and GNU
--- 14498,14510 ----
         inter-operating with other IA-64 compilers.
       * The new ABI also significantly reduces the size of symbol and debug
         information.
!      * New C++ support library and many C++ bug fixes, vastly improving
         our conformance to the ISO C++ standard.
!      * New [7]inliner for C++.
       * Rewritten C preprocessor, integrated into the C, C++ and Objective
         C compilers, with very many improvements including ISO C99 support
!        and [8]improvements to dependency generation.
!      * Support for more [9]ISO C99 features.
       * Many improvements to support for checking calls to format functions
         such as printf and scanf, including support for ISO C99 format
         features, extensions from the Single Unix Specification and GNU
*************** New Languages and Language specific impr
*** 14487,14493 ****
         = a++;, a[n] = b[n++]; and a[i++] = i;), included in -Wall.
       * Additional warning option -Wfloat-equal.
       * Improvements to -Wtraditional.
!      * Fortran improvements are listed in [11]the Fortran documentation.
  
  New Targets and Target Specific Improvements
  
--- 14515,14521 ----
         = a++;, a[n] = b[n++]; and a[i++] = i;), included in -Wall.
       * Additional warning option -Wfloat-equal.
       * Improvements to -Wtraditional.
!      * Fortran improvements are listed in [10]the Fortran documentation.
  
  New Targets and Target Specific Improvements
  
*************** Other significant improvements
*** 14535,14541 ****
         our mailing lists, for which you received no bug tracking number,
         should be submitted again using gccbug if you can reproduce the
         problem with GCC 3.0.)
!      * The internal libgcc library is [12]built as a shared library on
         systems that support it.
       * Extensive testsuite included with GCC, with many new tests. In
         addition to tests for GCC bugs that have been fixed, many tests
--- 14563,14569 ----
         our mailing lists, for which you received no bug tracking number,
         should be submitted again using gccbug if you can reproduce the
         problem with GCC 3.0.)
!      * The internal libgcc library is [11]built as a shared library on
         systems that support it.
       * Extensive testsuite included with GCC, with many new tests. In
         addition to tests for GCC bugs that have been fixed, many tests
*************** Other significant improvements
*** 14546,14568 ****
       * Target-independent options -falign-functions, -falign-loops and
         -falign-jumps.
  
!    Plus a great many bug fixes and almost all the [13]features found in
     GCC 2.95.
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [14]GCC manuals. If that fails, the
!     [15]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [16]gcc@gcc.gnu.org. All of [17]our lists have public
      archives.
  
!    Copyright (C) [18]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [19]maintained by the GCC team. Last modified
!    2016-01-30[20].
  
  References
  
--- 14574,14596 ----
       * Target-independent options -falign-functions, -falign-loops and
         -falign-jumps.
  
!    Plus a great many bug fixes and almost all the [12]features found in
     GCC 2.95.
  
  
      For questions related to the use of GCC, please consult these web
!     pages and the [13]GCC manuals. If that fails, the
!     [14]gcc-help@gcc.gnu.org mailing list might help. Comments on these
      web pages and the development of GCC are welcome on our developer
!     list at [15]gcc@gcc.gnu.org. All of [16]our lists have public
      archives.
  
!    Copyright (C) [17]Free Software Foundation, Inc. Verbatim copying and
     distribution of this entire article is permitted in any medium,
     provided this notice is preserved.
  
!    These pages are [18]maintained by the GCC team. Last modified
!    2016-08-23[19].
  
  References
  
*************** References
*** 14572,14594 ****
     4. http://gcc.gnu.org/news/null.html
     5. http://gcc.gnu.org/news/unify.html
     6. http://gcc.gnu.org/gcc-3.0/c++features.html
!    7. http://gcc.gnu.org/libstdc++/
!    8. http://gcc.gnu.org/news/inlining.html
!    9. http://gcc.gnu.org/news/dependencies.html
!   10. http://gcc.gnu.org/c99status.html
!   11. https://gcc.gnu.org/onlinedocs/gcc-3.4.6/g77/News.html
!   12. http://gcc.gnu.org/gcc-3.0/libgcc.html
!   13. http://gcc.gnu.org/gcc-2.95/features.html
!   14. https://gcc.gnu.org/onlinedocs/
!   15. mailto:gcc-help@gcc.gnu.org
!   16. mailto:gcc@gcc.gnu.org
!   17. https://gcc.gnu.org/lists.html
!   18. http://www.fsf.org/
!   19. https://gcc.gnu.org/about.html
!   20. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.0/caveats.html
- 
                                  GCC 3.0 Caveats
  
       * -fstrict-aliasing is now part of -O2 and higher optimization
--- 14600,14620 ----
     4. http://gcc.gnu.org/news/null.html
     5. http://gcc.gnu.org/news/unify.html
     6. http://gcc.gnu.org/gcc-3.0/c++features.html
!    7. http://gcc.gnu.org/news/inlining.html
!    8. http://gcc.gnu.org/news/dependencies.html
!    9. http://gcc.gnu.org/c99status.html
!   10. https://gcc.gnu.org/onlinedocs/gcc-3.4.6/g77/News.html
!   11. http://gcc.gnu.org/gcc-3.0/libgcc.html
!   12. http://gcc.gnu.org/gcc-2.95/features.html
!   13. https://gcc.gnu.org/onlinedocs/
!   14. mailto:gcc-help@gcc.gnu.org
!   15. mailto:gcc@gcc.gnu.org
!   16. https://gcc.gnu.org/lists.html
!   17. http://www.fsf.org/
!   18. https://gcc.gnu.org/about.html
!   19. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-3.0/caveats.html
                                  GCC 3.0 Caveats
  
       * -fstrict-aliasing is now part of -O2 and higher optimization
*************** References
*** 14649,14660 ****
     8. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-2.95/index.html
- 
                                      GCC 2.95
  
     March 16, 2001: The GNU project and the GCC developers are pleased to
     announce the release of GCC version 2.95.3.
  
  Release History
  
     GCC 2.95.3
--- 14675,14687 ----
     8. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-2.95/index.html
                                      GCC 2.95
  
     March 16, 2001: The GNU project and the GCC developers are pleased to
     announce the release of GCC version 2.95.3.
  
+    This release is no longer maintained.
+ 
  Release History
  
     GCC 2.95.3
*************** References and Acknowledgements
*** 14716,14722 ****
     provided this notice is preserved.
  
     These pages are [15]maintained by the GCC team. Last modified
!    2016-01-30[16].
  
  References
  
--- 14743,14749 ----
     provided this notice is preserved.
  
     These pages are [15]maintained by the GCC team. Last modified
!    2016-09-30[16].
  
  References
  
*************** References
*** 14738,14744 ****
    16. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-2.95/features.html
- 
                               GCC 2.95 New Features
  
       * General Optimizer Improvements:
--- 14765,14770 ----
*************** http://gcc.gnu.org/gcc-2.95/features.htm
*** 14759,14766 ****
       * New Languages and Language specific improvements
            + [8]Many C++ improvements.
            + [9]Many Fortran improvements.
!           + [10]Java front-end has been integrated. [11]runtime library is
!             available separately.
            + [12]ISO C99 support
            + [13]Chill front-end and runtime has been integrated.
            + Boehm garbage collector support in libobjc.
--- 14785,14792 ----
       * New Languages and Language specific improvements
            + [8]Many C++ improvements.
            + [9]Many Fortran improvements.
!           + [10]Java front-end has been integrated. A [11]runtime library
!             is available separately.
            + [12]ISO C99 support
            + [13]Chill front-end and runtime has been integrated.
            + Boehm garbage collector support in libobjc.
*************** Additional Changes in GCC 2.95.3
*** 14982,14988 ****
     provided this notice is preserved.
  
     These pages are [22]maintained by the GCC team. Last modified
!    2016-01-30[23].
  
  References
  
--- 15008,15014 ----
     provided this notice is preserved.
  
     These pages are [22]maintained by the GCC team. Last modified
!    2016-12-29[23].
  
  References
  
*************** References
*** 14995,15001 ****
     7. http://gcc.gnu.org/news/alias.html
     8. http://gcc.gnu.org/gcc-2.95/c++features.html
     9. https://gcc.gnu.org/onlinedocs/gcc-3.4.6/g77/News.html
!   10. http://gcc.gnu.org/java/gcj-announce.txt
    11. http://gcc.gnu.org/news/javaannounce.html
    12. http://gcc.gnu.org/c99status.html
    13. http://gcc.gnu.org/news/chill.html
--- 15021,15027 ----
     7. http://gcc.gnu.org/news/alias.html
     8. http://gcc.gnu.org/gcc-2.95/c++features.html
     9. https://gcc.gnu.org/onlinedocs/gcc-3.4.6/g77/News.html
!   10. http://gcc.gnu.org/news/gcj-announce.txt
    11. http://gcc.gnu.org/news/javaannounce.html
    12. http://gcc.gnu.org/c99status.html
    13. http://gcc.gnu.org/news/chill.html
*************** References
*** 15011,15017 ****
    23. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/gcc-2.95/caveats.html
- 
                                  GCC 2.95 Caveats
  
       * GCC 2.95 will issue an error for invalid asm statements that had
--- 15037,15042 ----
*************** References
*** 15080,15086 ****
     8. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/egcs-1.1/index.html
- 
                                      EGCS 1.1
  
     September 3, 1998: We are pleased to announce the release of EGCS 1.1.
--- 15105,15110 ----
*************** References
*** 15310,15316 ****
    16. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/egcs-1.1/features.html
- 
                               EGCS 1.1 new features
  
       * Integrated GNU Fortran (g77) compiler and runtime library with
--- 15334,15339 ----
*************** References
*** 15405,15411 ****
    11. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/egcs-1.1/caveats.html
- 
                                  EGCS 1.1 Caveats
  
       * EGCS has an integrated libstdc++, but does not have an integrated
--- 15428,15433 ----
*************** References
*** 15456,15462 ****
     7. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/egcs-1.0/index.html
- 
                                      EGCS 1.0
  
     December 3, 1997: We are pleased to announce the release of EGCS 1.0.
--- 15478,15483 ----
*************** References
*** 15657,15663 ****
    11. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/egcs-1.0/features.html
- 
                                 EGCS 1.0 features
  
       * Core compiler is based on the gcc2 development tree from Aug 2,
--- 15678,15683 ----
*************** References
*** 15722,15728 ****
     9. http://validator.w3.org/check/referer
  ======================================================================
  http://gcc.gnu.org/egcs-1.0/caveats.html
- 
                                  EGCS 1.0 Caveats
  
       * EGCS has an integrated libstdc++, but does not have an integrated
--- 15742,15747 ----
diff -Nrcpad gcc-5.4.0/boehm-gc/ChangeLog gcc-5.5.0/boehm-gc/ChangeLog
*** gcc-5.4.0/boehm-gc/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/boehm-gc/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/config/ChangeLog gcc-5.5.0/config/ChangeLog
*** gcc-5.4.0/config/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/config/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/config.sub gcc-5.5.0/config.sub
*** gcc-5.4.0/config.sub	Fri Jan  2 09:30:21 2015
--- gcc-5.5.0/config.sub	Wed Aug 31 09:37:05 2016
*************** case $os in
*** 1393,1399 ****
  	      | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \
  	      | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \
  	      | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \
! 	      | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es* | -tirtos*)
  	# Remember, each alternative MUST END IN *, to match a version number.
  		;;
  	-qnx*)
--- 1393,1399 ----
  	      | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \
  	      | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \
  	      | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \
! 	      | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es* | -tirtos* | -phoenix*)
  	# Remember, each alternative MUST END IN *, to match a version number.
  		;;
  	-qnx*)
diff -Nrcpad gcc-5.4.0/configure gcc-5.5.0/configure
*** gcc-5.4.0/configure	Sun May  3 17:29:57 2015
--- gcc-5.5.0/configure	Mon Jan  9 21:06:20 2017
*************** case "${target}" in
*** 3455,3460 ****
--- 3455,3463 ----
    *-*-vxworks*)
      noconfigdirs="$noconfigdirs ${libgcj}"
      ;;
+   aarch64*-*-freebsd*)
+     noconfigdirs="$noconfigdirs ${libgcj}"
+     ;;
    alpha*-*-*vms*)
      noconfigdirs="$noconfigdirs ${libgcj}"
      ;;
diff -Nrcpad gcc-5.4.0/configure.ac gcc-5.5.0/configure.ac
*** gcc-5.4.0/configure.ac	Sun May  3 17:29:57 2015
--- gcc-5.5.0/configure.ac	Mon Jan  9 21:06:20 2017
*************** case "${target}" in
*** 802,807 ****
--- 802,810 ----
    *-*-vxworks*)
      noconfigdirs="$noconfigdirs ${libgcj}"
      ;;
+   aarch64*-*-freebsd*)
+     noconfigdirs="$noconfigdirs ${libgcj}"
+     ;;
    alpha*-*-*vms*)
      noconfigdirs="$noconfigdirs ${libgcj}"
      ;;
diff -Nrcpad gcc-5.4.0/contrib/ChangeLog gcc-5.5.0/contrib/ChangeLog
*** gcc-5.4.0/contrib/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/contrib/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,11 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-10-02  Thomas Schwinge  <thomas@codesourcery.com>
+ 
+ 	* gcc_update (files_and_dependencies): Handle libbacktrace.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/contrib/gcc_update gcc-5.5.0/contrib/gcc_update
*** gcc-5.4.0/contrib/gcc_update	Thu Feb  5 13:55:25 2015
--- gcc-5.5.0/contrib/gcc_update	Mon Oct  2 11:58:56 2017
*************** liboffloadmic/configure: liboffloadmic/c
*** 173,178 ****
--- 173,182 ----
  liboffloadmic/plugin/aclocal.m4: liboffloadmic/plugin/configure.ac
  liboffloadmic/plugin/Makefile.in: liboffloadmic/plugin/Makefile.am
  liboffloadmic/plugin/configure: liboffloadmic/plugin/configure.ac
+ libbacktrace/aclocal.m4: libbacktrace/configure.ac
+ libbacktrace/Makefile.in: libbacktrace/Makefile.am libbacktrace/aclocal.m4
+ libbacktrace/configure: libbacktrace/configure.ac libbacktrace/aclocal.m4
+ libbacktrace/config.h.in: libbacktrace/configure.ac libbacktrace/aclocal.m4
  # Top level
  Makefile.in: Makefile.tpl Makefile.def
  configure: configure.ac config/acx.m4
diff -Nrcpad gcc-5.4.0/contrib/reghunt/ChangeLog gcc-5.5.0/contrib/reghunt/ChangeLog
*** gcc-5.4.0/contrib/reghunt/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/contrib/reghunt/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/contrib/regression/ChangeLog gcc-5.5.0/contrib/regression/ChangeLog
*** gcc-5.4.0/contrib/regression/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/contrib/regression/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/fixincludes/ChangeLog gcc-5.5.0/fixincludes/ChangeLog
*** gcc-5.4.0/fixincludes/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/fixincludes/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,45 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-01-30  Rainer Orth  <ro@CeBiTec.Uni-Bielefeld.DE>
+ 
+ 	Backport from mainline
+ 	2017-01-13  Rainer Orth  <ro@CeBiTec.Uni-Bielefeld.DE>
+ 
+ 	PR libstdc++/78979
+ 	* inclhack.def (solaris_gets_c11, solaris_gets_cxx14)
+ 	(solaris_std_gets_cxx14, solaris_stdlib_noreturn): New fixes.
+ 	* fixincl.x: Regenerate.
+ 	* tests/base/iso/stdio_iso.h [SOLARIS_GETS_C11_CHECK,
+ 	SOLARIS_GETS_CXX14_CHECK, SOLARIS_STD_GETS_CXX14_CHECK,
+ 	SOLARIS_STDLIB_NORETURN_CHECK]: New tests.
+ 
+ 2016-12-01  Rainer Orth  <ro@CeBiTec.Uni-Bielefeld.DE>
+ 
+ 	Backport from mainline
+ 	2016-11-21  Rainer Orth  <ro@CeBiTec.Uni-Bielefeld.DE>
+ 
+ 	* inclhack.def (solaris_math_12): New fix.
+ 	(hpux11_fabsf): Replace bypass by *-hp-hpux11* mach selector.
+ 	* fixincl.x: Regenerate.
+ 	* tests/base/math.h [SOLARIS_MATH_12_CHECK]: New test.
+ 
+ 2016-06-15  David Edelsohn  <dje.gcc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-06-13  David Edelsohn  <dje.gcc@gmail.com>
+ 
+ 	* inclhack.def (aix_stdlib_malloc): New fix.
+ 	(aix_stdlib_realloc): New fix.
+ 	(aix_stdlib_calloc): New fix.
+ 	(aix_stdlib_valloc): New fix.
+ 	* fixincl.x: Regenerate.
+ 	* tests/base/stdlib.h [AIX_STDLIB_MALLOC]: New test.
+ 	[AIX_STDLIB_REALLOC]: New test.
+ 	[AIX_STDLIB_CALLOC]: New test.
+ 	[AIX_STDLIB_VALLOC]: New test.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/fixincludes/fixincl.x gcc-5.5.0/fixincludes/fixincl.x
*** gcc-5.4.0/fixincludes/fixincl.x	Mon Feb  1 20:25:12 2016
--- gcc-5.5.0/fixincludes/fixincl.x	Mon Jan 30 16:08:42 2017
***************
*** 2,12 ****
   * 
   * DO NOT EDIT THIS FILE   (fixincl.x)
   * 
!  * It has been AutoGen-ed  Monday February  1, 2016 at 03:24:02 PM EST
   * From the definitions    inclhack.def
   * and the template file   fixincl
   */
! /* DO NOT SVN-MERGE THIS FILE, EITHER Mon  1 Feb 2016 15:24:02 EST
   *
   * You must regenerate it.  Use the ./genfixes script.
   *
--- 2,12 ----
   * 
   * DO NOT EDIT THIS FILE   (fixincl.x)
   * 
!  * It has been AutoGen-ed  January  5, 2017 at 06:05:06 PM by AutoGen 5.16.2
   * From the definitions    inclhack.def
   * and the template file   fixincl
   */
! /* DO NOT SVN-MERGE THIS FILE, EITHER Thu Jan  5 18:05:06 CET 2017
   *
   * You must regenerate it.  Use the ./genfixes script.
   *
***************
*** 15,21 ****
   * certain ANSI-incompatible system header files which are fixed to work
   * correctly with ANSI C and placed in a directory that GNU C will search.
   *
!  * This file contains 231 fixup descriptions.
   *
   * See README for more information.
   *
--- 15,21 ----
   * certain ANSI-incompatible system header files which are fixed to work
   * correctly with ANSI C and placed in a directory that GNU C will search.
   *
!  * This file contains 240 fixup descriptions.
   *
   * See README for more information.
   *
*************** static const char* apzAix_Stdio_InlinePa
*** 1547,1552 ****
--- 1547,1700 ----
  
  /* * * * * * * * * * * * * * * * * * * * * * * * * *
   *
+  *  Description of Aix_Stdlib_Malloc fix
+  */
+ tSCC zAix_Stdlib_MallocName[] =
+      "aix_stdlib_malloc";
+ 
+ /*
+  *  File name selection pattern
+  */
+ tSCC zAix_Stdlib_MallocList[] =
+   "stdlib.h\0";
+ /*
+  *  Machine/OS name selection pattern
+  */
+ tSCC* apzAix_Stdlib_MallocMachs[] = {
+         "*-*-aix*",
+         (const char*)NULL };
+ 
+ /*
+  *  content selection pattern - do fix if pattern found
+  */
+ tSCC zAix_Stdlib_MallocSelect0[] =
+        "#define[ \t]+malloc[ \t]+__linux_malloc";
+ 
+ #define    AIX_STDLIB_MALLOC_TEST_CT  1
+ static tTestDesc aAix_Stdlib_MallocTests[] = {
+   { TT_EGREP,    zAix_Stdlib_MallocSelect0, (regex_t*)NULL }, };
+ 
+ /*
+  *  Fix Command Arguments for Aix_Stdlib_Malloc
+  */
+ static const char* apzAix_Stdlib_MallocPatch[] = {
+     "format",
+     "extern void *malloc(size_t) __asm__(\"__linux_malloc\");",
+     (char*)NULL };
+ 
+ /* * * * * * * * * * * * * * * * * * * * * * * * * *
+  *
+  *  Description of Aix_Stdlib_Realloc fix
+  */
+ tSCC zAix_Stdlib_ReallocName[] =
+      "aix_stdlib_realloc";
+ 
+ /*
+  *  File name selection pattern
+  */
+ tSCC zAix_Stdlib_ReallocList[] =
+   "stdlib.h\0";
+ /*
+  *  Machine/OS name selection pattern
+  */
+ tSCC* apzAix_Stdlib_ReallocMachs[] = {
+         "*-*-aix*",
+         (const char*)NULL };
+ 
+ /*
+  *  content selection pattern - do fix if pattern found
+  */
+ tSCC zAix_Stdlib_ReallocSelect0[] =
+        "#define[ \t]+realloc[ \t]+__linux_realloc";
+ 
+ #define    AIX_STDLIB_REALLOC_TEST_CT  1
+ static tTestDesc aAix_Stdlib_ReallocTests[] = {
+   { TT_EGREP,    zAix_Stdlib_ReallocSelect0, (regex_t*)NULL }, };
+ 
+ /*
+  *  Fix Command Arguments for Aix_Stdlib_Realloc
+  */
+ static const char* apzAix_Stdlib_ReallocPatch[] = {
+     "format",
+     "extern void *realloc(void *, size_t) __asm__(\"__linux_realloc\");",
+     (char*)NULL };
+ 
+ /* * * * * * * * * * * * * * * * * * * * * * * * * *
+  *
+  *  Description of Aix_Stdlib_Calloc fix
+  */
+ tSCC zAix_Stdlib_CallocName[] =
+      "aix_stdlib_calloc";
+ 
+ /*
+  *  File name selection pattern
+  */
+ tSCC zAix_Stdlib_CallocList[] =
+   "stdlib.h\0";
+ /*
+  *  Machine/OS name selection pattern
+  */
+ tSCC* apzAix_Stdlib_CallocMachs[] = {
+         "*-*-aix*",
+         (const char*)NULL };
+ 
+ /*
+  *  content selection pattern - do fix if pattern found
+  */
+ tSCC zAix_Stdlib_CallocSelect0[] =
+        "#define[ \t]+calloc[ \t]+__linux_calloc";
+ 
+ #define    AIX_STDLIB_CALLOC_TEST_CT  1
+ static tTestDesc aAix_Stdlib_CallocTests[] = {
+   { TT_EGREP,    zAix_Stdlib_CallocSelect0, (regex_t*)NULL }, };
+ 
+ /*
+  *  Fix Command Arguments for Aix_Stdlib_Calloc
+  */
+ static const char* apzAix_Stdlib_CallocPatch[] = {
+     "format",
+     "extern void *calloc(size_t, size_t) __asm__(\"__linux_calloc\");",
+     (char*)NULL };
+ 
+ /* * * * * * * * * * * * * * * * * * * * * * * * * *
+  *
+  *  Description of Aix_Stdlib_Valloc fix
+  */
+ tSCC zAix_Stdlib_VallocName[] =
+      "aix_stdlib_valloc";
+ 
+ /*
+  *  File name selection pattern
+  */
+ tSCC zAix_Stdlib_VallocList[] =
+   "stdlib.h\0";
+ /*
+  *  Machine/OS name selection pattern
+  */
+ tSCC* apzAix_Stdlib_VallocMachs[] = {
+         "*-*-aix*",
+         (const char*)NULL };
+ 
+ /*
+  *  content selection pattern - do fix if pattern found
+  */
+ tSCC zAix_Stdlib_VallocSelect0[] =
+        "#define[ \t]+valloc[ \t]+__linux_valloc";
+ 
+ #define    AIX_STDLIB_VALLOC_TEST_CT  1
+ static tTestDesc aAix_Stdlib_VallocTests[] = {
+   { TT_EGREP,    zAix_Stdlib_VallocSelect0, (regex_t*)NULL }, };
+ 
+ /*
+  *  Fix Command Arguments for Aix_Stdlib_Valloc
+  */
+ static const char* apzAix_Stdlib_VallocPatch[] = {
+     "format",
+     "extern void *valloc(size_t) __asm__(\"__linux_valloc\");",
+     (char*)NULL };
+ 
+ /* * * * * * * * * * * * * * * * * * * * * * * * * *
+  *
   *  Description of Aix_Strtof_Const fix
   */
  tSCC zAix_Strtof_ConstName[] =
*************** tSCC zHpux11_FabsfList[] =
*** 4152,4158 ****
  /*
   *  Machine/OS name selection pattern
   */
! #define apzHpux11_FabsfMachs (const char**)NULL
  
  /*
   *  content selection pattern - do fix if pattern found
--- 4300,4308 ----
  /*
   *  Machine/OS name selection pattern
   */
! tSCC* apzHpux11_FabsfMachs[] = {
!         "*-hp-hpux11*",
!         (const char*)NULL };
  
  /*
   *  content selection pattern - do fix if pattern found
*************** tSCC zHpux11_FabsfList[] =
*** 4160,4174 ****
  tSCC zHpux11_FabsfSelect0[] =
         "^[ \t]*#[ \t]*define[ \t]+fabsf\\(.*";
  
! /*
!  *  content bypass pattern - skip fix if pattern found
!  */
! tSCC zHpux11_FabsfBypass0[] =
!        "__cplusplus";
! 
! #define    HPUX11_FABSF_TEST_CT  2
  static tTestDesc aHpux11_FabsfTests[] = {
-   { TT_NEGREP,   zHpux11_FabsfBypass0, (regex_t*)NULL },
    { TT_EGREP,    zHpux11_FabsfSelect0, (regex_t*)NULL }, };
  
  /*
--- 4310,4317 ----
  tSCC zHpux11_FabsfSelect0[] =
         "^[ \t]*#[ \t]*define[ \t]+fabsf\\(.*";
  
! #define    HPUX11_FABSF_TEST_CT  1
  static tTestDesc aHpux11_FabsfTests[] = {
    { TT_EGREP,    zHpux11_FabsfSelect0, (regex_t*)NULL }, };
  
  /*
*************** static const char* apzSolaris_Getc_Stric
*** 6681,6686 ****
--- 6824,6907 ----
  
  /* * * * * * * * * * * * * * * * * * * * * * * * * *
   *
+  *  Description of Solaris_Gets_C11 fix
+  */
+ tSCC zSolaris_Gets_C11Name[] =
+      "solaris_gets_c11";
+ 
+ /*
+  *  File name selection pattern
+  */
+ tSCC zSolaris_Gets_C11List[] =
+   "iso/stdio_iso.h\0";
+ /*
+  *  Machine/OS name selection pattern
+  */
+ tSCC* apzSolaris_Gets_C11Machs[] = {
+         "*-*-solaris2*",
+         (const char*)NULL };
+ 
+ /*
+  *  content selection pattern - do fix if pattern found
+  */
+ tSCC zSolaris_Gets_C11Select0[] =
+        "(extern char[ \t]*\\*gets\\(char \\*\\));";
+ 
+ #define    SOLARIS_GETS_C11_TEST_CT  1
+ static tTestDesc aSolaris_Gets_C11Tests[] = {
+   { TT_EGREP,    zSolaris_Gets_C11Select0, (regex_t*)NULL }, };
+ 
+ /*
+  *  Fix Command Arguments for Solaris_Gets_C11
+  */
+ static const char* apzSolaris_Gets_C11Patch[] = {
+     "format",
+     "#if __STDC_VERSION__ < 201112L && __cplusplus < 201402L\n\
+ %1 __attribute__((__deprecated__));\n\
+ #endif",
+     (char*)NULL };
+ 
+ /* * * * * * * * * * * * * * * * * * * * * * * * * *
+  *
+  *  Description of Solaris_Gets_Cxx14 fix
+  */
+ tSCC zSolaris_Gets_Cxx14Name[] =
+      "solaris_gets_cxx14";
+ 
+ /*
+  *  File name selection pattern
+  */
+ tSCC zSolaris_Gets_Cxx14List[] =
+   "iso/stdio_iso.h\0";
+ /*
+  *  Machine/OS name selection pattern
+  */
+ tSCC* apzSolaris_Gets_Cxx14Machs[] = {
+         "*-*-solaris2*",
+         (const char*)NULL };
+ 
+ /*
+  *  content selection pattern - do fix if pattern found
+  */
+ tSCC zSolaris_Gets_Cxx14Select0[] =
+        "(#if __STDC_VERSION__ < 201112L)\n\
+ (extern char\t\\*gets\\(char \\*\\) __ATTR_DEPRECATED;)";
+ 
+ #define    SOLARIS_GETS_CXX14_TEST_CT  1
+ static tTestDesc aSolaris_Gets_Cxx14Tests[] = {
+   { TT_EGREP,    zSolaris_Gets_Cxx14Select0, (regex_t*)NULL }, };
+ 
+ /*
+  *  Fix Command Arguments for Solaris_Gets_Cxx14
+  */
+ static const char* apzSolaris_Gets_Cxx14Patch[] = {
+     "format",
+     "%1 && __cplusplus < 201402L\n\
+ %2",
+     (char*)NULL };
+ 
+ /* * * * * * * * * * * * * * * * * * * * * * * * * *
+  *
   *  Description of Solaris_Int_Const fix
   */
  tSCC zSolaris_Int_ConstName[] =
*************** static const char* apzSolaris_Math_11Pat
*** 7191,7196 ****
--- 7412,7453 ----
  
  /* * * * * * * * * * * * * * * * * * * * * * * * * *
   *
+  *  Description of Solaris_Math_12 fix
+  */
+ tSCC zSolaris_Math_12Name[] =
+      "solaris_math_12";
+ 
+ /*
+  *  File name selection pattern
+  */
+ tSCC zSolaris_Math_12List[] =
+   "math.h\0";
+ /*
+  *  Machine/OS name selection pattern
+  */
+ tSCC* apzSolaris_Math_12Machs[] = {
+         "*-*-solaris2*",
+         (const char*)NULL };
+ 
+ /*
+  *  content selection pattern - do fix if pattern found
+  */
+ tSCC zSolaris_Math_12Select0[] =
+        "#undef.*_GLIBCXX_USE_C99_MATH";
+ 
+ #define    SOLARIS_MATH_12_TEST_CT  1
+ static tTestDesc aSolaris_Math_12Tests[] = {
+   { TT_EGREP,    zSolaris_Math_12Select0, (regex_t*)NULL }, };
+ 
+ /*
+  *  Fix Command Arguments for Solaris_Math_12
+  */
+ static const char* apzSolaris_Math_12Patch[] = { sed_cmd_z,
+     "-e", "/#undef[ \t]*_GLIBCXX_USE_C99_MATH/d",
+     (char*)NULL };
+ 
+ /* * * * * * * * * * * * * * * * * * * * * * * * * *
+  *
   *  Description of Solaris_Once_Init_1 fix
   */
  tSCC zSolaris_Once_Init_1Name[] =
*************** using std::__flsbuf;\n\
*** 7397,7402 ****
--- 7654,7698 ----
  
  /* * * * * * * * * * * * * * * * * * * * * * * * * *
   *
+  *  Description of Solaris_Std_Gets_Cxx14 fix
+  */
+ tSCC zSolaris_Std_Gets_Cxx14Name[] =
+      "solaris_std_gets_cxx14";
+ 
+ /*
+  *  File name selection pattern
+  */
+ tSCC zSolaris_Std_Gets_Cxx14List[] =
+   "stdio.h\0";
+ /*
+  *  Machine/OS name selection pattern
+  */
+ tSCC* apzSolaris_Std_Gets_Cxx14Machs[] = {
+         "*-*-solaris2*",
+         (const char*)NULL };
+ 
+ /*
+  *  content selection pattern - do fix if pattern found
+  */
+ tSCC zSolaris_Std_Gets_Cxx14Select0[] =
+        "using std::gets;";
+ 
+ #define    SOLARIS_STD_GETS_CXX14_TEST_CT  1
+ static tTestDesc aSolaris_Std_Gets_Cxx14Tests[] = {
+   { TT_EGREP,    zSolaris_Std_Gets_Cxx14Select0, (regex_t*)NULL }, };
+ 
+ /*
+  *  Fix Command Arguments for Solaris_Std_Gets_Cxx14
+  */
+ static const char* apzSolaris_Std_Gets_Cxx14Patch[] = {
+     "format",
+     "#if __cplusplus < 201402L\n\
+ %0\n\
+ #endif",
+     (char*)NULL };
+ 
+ /* * * * * * * * * * * * * * * * * * * * * * * * * *
+  *
   *  Description of Solaris_Stdio_Tag fix
   */
  tSCC zSolaris_Stdio_TagName[] =
*************** static const char* apzSolaris_Stdio_TagP
*** 7438,7443 ****
--- 7734,7776 ----
  
  /* * * * * * * * * * * * * * * * * * * * * * * * * *
   *
+  *  Description of Solaris_Stdlib_Noreturn fix
+  */
+ tSCC zSolaris_Stdlib_NoreturnName[] =
+      "solaris_stdlib_noreturn";
+ 
+ /*
+  *  File name selection pattern
+  */
+ tSCC zSolaris_Stdlib_NoreturnList[] =
+   "iso/stdlib_c99.h\0";
+ /*
+  *  Machine/OS name selection pattern
+  */
+ tSCC* apzSolaris_Stdlib_NoreturnMachs[] = {
+         "*-*-solaris2*",
+         (const char*)NULL };
+ 
+ /*
+  *  content selection pattern - do fix if pattern found
+  */
+ tSCC zSolaris_Stdlib_NoreturnSelect0[] =
+        "(extern) _Noreturn (void quick_exit\\(int\\));";
+ 
+ #define    SOLARIS_STDLIB_NORETURN_TEST_CT  1
+ static tTestDesc aSolaris_Stdlib_NoreturnTests[] = {
+   { TT_EGREP,    zSolaris_Stdlib_NoreturnSelect0, (regex_t*)NULL }, };
+ 
+ /*
+  *  Fix Command Arguments for Solaris_Stdlib_Noreturn
+  */
+ static const char* apzSolaris_Stdlib_NoreturnPatch[] = {
+     "format",
+     "%1 %2 __attribute__((__noreturn__));",
+     (char*)NULL };
+ 
+ /* * * * * * * * * * * * * * * * * * * * * * * * * *
+  *
   *  Description of Statsswtch fix
   */
  tSCC zStatsswtchName[] =
*************** static const char* apzX11_SprintfPatch[]
*** 9485,9493 ****
   *
   *  List of all fixes
   */
! #define REGEX_COUNT          268
  #define MACH_LIST_SIZE_LIMIT 187
! #define FIX_COUNT            231
  
  /*
   *  Enumerate the fixes
--- 9818,9826 ----
   *
   *  List of all fixes
   */
! #define REGEX_COUNT          276
  #define MACH_LIST_SIZE_LIMIT 187
! #define FIX_COUNT            240
  
  /*
   *  Enumerate the fixes
*************** typedef enum {
*** 9525,9530 ****
--- 9858,9867 ----
      AIX_STDINT_4_FIXIDX,
      AIX_STDINT_5_FIXIDX,
      AIX_STDIO_INLINE_FIXIDX,
+     AIX_STDLIB_MALLOC_FIXIDX,
+     AIX_STDLIB_REALLOC_FIXIDX,
+     AIX_STDLIB_CALLOC_FIXIDX,
+     AIX_STDLIB_VALLOC_FIXIDX,
      AIX_STRTOF_CONST_FIXIDX,
      AIX_SYSMACHINE_FIXIDX,
      AIX_SYSWAIT_2_FIXIDX,
*************** typedef enum {
*** 9654,9659 ****
--- 9991,9998 ----
      SOLARIS_COMPLEX_CXX_FIXIDX,
      SOLARIS_CXX_LINKAGE_FIXIDX,
      SOLARIS_GETC_STRICT_STDC_FIXIDX,
+     SOLARIS_GETS_C11_FIXIDX,
+     SOLARIS_GETS_CXX14_FIXIDX,
      SOLARIS_INT_CONST_FIXIDX,
      SOLARIS_INT_LIMITS_1_FIXIDX,
      SOLARIS_INT_LIMITS_2_FIXIDX,
*************** typedef enum {
*** 9666,9677 ****
--- 10005,10019 ----
      SOLARIS_MATH_8_FIXIDX,
      SOLARIS_MATH_9_FIXIDX,
      SOLARIS_MATH_11_FIXIDX,
+     SOLARIS_MATH_12_FIXIDX,
      SOLARIS_ONCE_INIT_1_FIXIDX,
      SOLARIS_POSIX_SPAWN_RESTRICT_FIXIDX,
      SOLARIS_POW_INT_OVERLOAD_FIXIDX,
      SOLARIS_RWLOCK_INIT_1_FIXIDX,
      SOLARIS_STD___FILBUF_FIXIDX,
+     SOLARIS_STD_GETS_CXX14_FIXIDX,
      SOLARIS_STDIO_TAG_FIXIDX,
+     SOLARIS_STDLIB_NORETURN_FIXIDX,
      STATSSWTCH_FIXIDX,
      STDIO_STDARG_H_FIXIDX,
      STDIO_VA_LIST_FIXIDX,
*************** tFixDesc fixDescList[ FIX_COUNT ] = {
*** 9887,9892 ****
--- 10229,10254 ----
       AIX_STDIO_INLINE_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
       aAix_Stdio_InlineTests,   apzAix_Stdio_InlinePatch, 0 },
  
+   {  zAix_Stdlib_MallocName,    zAix_Stdlib_MallocList,
+      apzAix_Stdlib_MallocMachs,
+      AIX_STDLIB_MALLOC_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
+      aAix_Stdlib_MallocTests,   apzAix_Stdlib_MallocPatch, 0 },
+ 
+   {  zAix_Stdlib_ReallocName,    zAix_Stdlib_ReallocList,
+      apzAix_Stdlib_ReallocMachs,
+      AIX_STDLIB_REALLOC_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
+      aAix_Stdlib_ReallocTests,   apzAix_Stdlib_ReallocPatch, 0 },
+ 
+   {  zAix_Stdlib_CallocName,    zAix_Stdlib_CallocList,
+      apzAix_Stdlib_CallocMachs,
+      AIX_STDLIB_CALLOC_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
+      aAix_Stdlib_CallocTests,   apzAix_Stdlib_CallocPatch, 0 },
+ 
+   {  zAix_Stdlib_VallocName,    zAix_Stdlib_VallocList,
+      apzAix_Stdlib_VallocMachs,
+      AIX_STDLIB_VALLOC_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
+      aAix_Stdlib_VallocTests,   apzAix_Stdlib_VallocPatch, 0 },
+ 
    {  zAix_Strtof_ConstName,    zAix_Strtof_ConstList,
       apzAix_Strtof_ConstMachs,
       AIX_STRTOF_CONST_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
*************** tFixDesc fixDescList[ FIX_COUNT ] = {
*** 10532,10537 ****
--- 10894,10909 ----
       SOLARIS_GETC_STRICT_STDC_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
       aSolaris_Getc_Strict_StdcTests,   apzSolaris_Getc_Strict_StdcPatch, 0 },
  
+   {  zSolaris_Gets_C11Name,    zSolaris_Gets_C11List,
+      apzSolaris_Gets_C11Machs,
+      SOLARIS_GETS_C11_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
+      aSolaris_Gets_C11Tests,   apzSolaris_Gets_C11Patch, 0 },
+ 
+   {  zSolaris_Gets_Cxx14Name,    zSolaris_Gets_Cxx14List,
+      apzSolaris_Gets_Cxx14Machs,
+      SOLARIS_GETS_CXX14_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
+      aSolaris_Gets_Cxx14Tests,   apzSolaris_Gets_Cxx14Patch, 0 },
+ 
    {  zSolaris_Int_ConstName,    zSolaris_Int_ConstList,
       apzSolaris_Int_ConstMachs,
       SOLARIS_INT_CONST_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
*************** tFixDesc fixDescList[ FIX_COUNT ] = {
*** 10592,10597 ****
--- 10964,10974 ----
       SOLARIS_MATH_11_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
       aSolaris_Math_11Tests,   apzSolaris_Math_11Patch, 0 },
  
+   {  zSolaris_Math_12Name,    zSolaris_Math_12List,
+      apzSolaris_Math_12Machs,
+      SOLARIS_MATH_12_TEST_CT, FD_MACH_ONLY,
+      aSolaris_Math_12Tests,   apzSolaris_Math_12Patch, 0 },
+ 
    {  zSolaris_Once_Init_1Name,    zSolaris_Once_Init_1List,
       apzSolaris_Once_Init_1Machs,
       SOLARIS_ONCE_INIT_1_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
*************** tFixDesc fixDescList[ FIX_COUNT ] = {
*** 10617,10627 ****
--- 10994,11014 ----
       SOLARIS_STD___FILBUF_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
       aSolaris_Std___FilbufTests,   apzSolaris_Std___FilbufPatch, 0 },
  
+   {  zSolaris_Std_Gets_Cxx14Name,    zSolaris_Std_Gets_Cxx14List,
+      apzSolaris_Std_Gets_Cxx14Machs,
+      SOLARIS_STD_GETS_CXX14_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
+      aSolaris_Std_Gets_Cxx14Tests,   apzSolaris_Std_Gets_Cxx14Patch, 0 },
+ 
    {  zSolaris_Stdio_TagName,    zSolaris_Stdio_TagList,
       apzSolaris_Stdio_TagMachs,
       SOLARIS_STDIO_TAG_TEST_CT, FD_MACH_ONLY,
       aSolaris_Stdio_TagTests,   apzSolaris_Stdio_TagPatch, 0 },
  
+   {  zSolaris_Stdlib_NoreturnName,    zSolaris_Stdlib_NoreturnList,
+      apzSolaris_Stdlib_NoreturnMachs,
+      SOLARIS_STDLIB_NORETURN_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
+      aSolaris_Stdlib_NoreturnTests,   apzSolaris_Stdlib_NoreturnPatch, 0 },
+ 
    {  zStatsswtchName,    zStatsswtchList,
       apzStatsswtchMachs,
       STATSSWTCH_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE,
diff -Nrcpad gcc-5.4.0/fixincludes/inclhack.def gcc-5.5.0/fixincludes/inclhack.def
*** gcc-5.4.0/fixincludes/inclhack.def	Mon Feb  1 20:22:43 2016
--- gcc-5.5.0/fixincludes/inclhack.def	Mon Jan 30 16:08:42 2017
*************** fix = {
*** 911,916 ****
--- 911,958 ----
      test_text = "#ifdef __cplusplus\n}\n\n#ifdef ferror";
  };
  
+ /*
+  * stdlib.h on AIX uses #define on malloc and friends.
+  */
+ fix = {
+     hackname  = aix_stdlib_malloc;
+     mach      = "*-*-aix*";
+     files     = stdlib.h;
+     select    = "#define[ \t]+malloc[ \t]+__linux_malloc";
+     c_fix     = format;
+     c_fix_arg = "extern void *malloc(size_t) __asm__(\"__linux_malloc\");";
+     test_text = "#define malloc __linux_malloc";
+ };
+ 
+ fix = {
+     hackname  = aix_stdlib_realloc;
+     mach      = "*-*-aix*";
+     files     = stdlib.h;
+     select    = "#define[ \t]+realloc[ \t]+__linux_realloc";
+     c_fix     = format;
+     c_fix_arg = "extern void *realloc(void *, size_t) __asm__(\"__linux_realloc\");";
+     test_text = "#define realloc __linux_realloc";
+ };
+ 
+ fix = {
+     hackname  = aix_stdlib_calloc;
+     mach      = "*-*-aix*";
+     files     = stdlib.h;
+     select    = "#define[ \t]+calloc[ \t]+__linux_calloc";
+     c_fix     = format;
+     c_fix_arg = "extern void *calloc(size_t, size_t) __asm__(\"__linux_calloc\");";
+     test_text = "#define calloc __linux_calloc";
+ };
+ 
+ fix = {
+     hackname  = aix_stdlib_valloc;
+     mach      = "*-*-aix*";
+     files     = stdlib.h;
+     select    = "#define[ \t]+valloc[ \t]+__linux_valloc";
+     c_fix     = format;
+     c_fix_arg = "extern void *valloc(size_t) __asm__(\"__linux_valloc\");";
+     test_text = "#define valloc __linux_valloc";
+ };
  
  /*
   * stdlib.h on AIX 4.3 declares strtof() with a non-const first argument.
*************** fix = {
*** 2195,2203 ****
   */
  fix = {
      hackname  = hpux11_fabsf;
      files     = math.h;
      select    = "^[ \t]*#[ \t]*define[ \t]+fabsf\\(.*";
-     bypass    = "__cplusplus";
  
      c_fix     = format;
      c_fix_arg = "#ifndef __cplusplus\n%0\n#endif";
--- 2237,2245 ----
   */
  fix = {
      hackname  = hpux11_fabsf;
+     mach      = "*-hp-hpux11*";
      files     = math.h;
      select    = "^[ \t]*#[ \t]*define[ \t]+fabsf\\(.*";
  
      c_fix     = format;
      c_fix_arg = "#ifndef __cplusplus\n%0\n#endif";
*************** fix = {
*** 3440,3445 ****
--- 3482,3524 ----
  };
  
  /*
+  *  Solaris <iso/stdio_iso.h> should deprecate gets before C11.
+  */
+ fix = {
+     hackname  = solaris_gets_c11;
+     mach      = "*-*-solaris2*";
+     files     = "iso/stdio_iso.h";
+     select    = "(extern char[ \t]*\\*gets\\(char \\*\\));";
+ 
+     c_fix     = format;
+     c_fix_arg = "#if __STDC_VERSION__ < 201112L && __cplusplus < 201402L\n"
+     		"%1 __attribute__((__deprecated__));\n"
+ 		"#endif";
+ 
+     test_text = "extern char	*gets(char *);";
+ };
+ 
+ /*
+  *  Solaris <iso/stdio_iso.h> shouldn't declare gets for C++14.
+  */
+ fix = {
+     hackname  = solaris_gets_cxx14;
+     mach      = "*-*-solaris2*";
+     files     = "iso/stdio_iso.h";
+     select    = <<- _EOSelect_
+ (#if __STDC_VERSION__ < 201112L)
+ (extern char	\*gets\(char \*\) __ATTR_DEPRECATED;)
+ _EOSelect_;
+     c_fix     = format;
+     c_fix_arg = "%1 && __cplusplus < 201402L\n%2";
+ 
+     test_text = <<- _EOText_
+ #if __STDC_VERSION__ < 201112L
+ extern char	*gets(char *) __ATTR_DEPRECATED;
+ _EOText_;
+ };
+ 
+ /*
   * Sun Solaris 2 has a version of sys/int_const.h that defines
   * UINT8_C and UINT16_C to unsigned constants.
   */
*************** _EOText_;
*** 3715,3720 ****
--- 3794,3816 ----
  };
  
  /*
+  * Some versions of Solaris 10+ <math.h> #undef libstdc++-internal macros.
+  */
+ fix = {
+     hackname  = solaris_math_12;
+     files     = math.h;
+     mach      = '*-*-solaris2*';
+     select    = '#undef.*_GLIBCXX_USE_C99_MATH';
+     sed       = "/#undef[ \t]*_GLIBCXX_USE_C99_MATH/d";
+     test_text = << _EOText_
+ #if __cplusplus >= 201103L
+ #undef  _GLIBCXX_USE_C99_MATH
+ #undef  _GLIBCXX_USE_C99_MATH_TR1
+ #endif
+ _EOText_;
+ };
+ 
+ /*
   * Sun Solaris defines PTHREAD_ONCE_INIT as an array containing a
   * structure.  As such, it need two levels of brackets, but only
   * contains one.  Wrap the macro definition in an extra layer.
*************** fix = {
*** 3812,3817 ****
--- 3908,3928 ----
  };
  
  /*
+  *  Solaris <stdio.h> shouldn't use std::gets for C++14.
+  */
+ fix = {
+     hackname  = solaris_std_gets_cxx14;
+     mach      = "*-*-solaris2*";
+     files     = "stdio.h";
+     select    = "using std::gets;";
+ 
+     c_fix     = format;
+     c_fix_arg = "#if __cplusplus < 201402L\n%0\n#endif";
+ 
+     test_text = "using std::gets;";
+ };
+ 
+ /*
   * Sun Solaris 8 has what appears to be some gross workaround for
   * some old version of their c++ compiler.  G++ doesn't want it
   * either, but doesn't want to be tied to SunPRO version numbers.
*************** fix = {
*** 3830,3835 ****
--- 3941,3961 ----
  };
  
  /*
+  *  Solaris <stdlib.h> shouldn't use _Noreturn, breaks with C++.
+  */
+ fix = {
+     hackname  = solaris_stdlib_noreturn;
+     mach      = "*-*-solaris2*";
+     files     = "iso/stdlib_c99.h";
+     select    = "(extern) _Noreturn (void quick_exit\\(int\\));";
+ 
+     c_fix     = format;
+     c_fix_arg = "%1 %2 __attribute__((__noreturn__));";
+ 
+     test_text = "extern _Noreturn void quick_exit(int);";
+ };
+ 
+ /*
   *  a missing semi-colon at the end of the statsswtch structure definition.
   */
  fix = {
diff -Nrcpad gcc-5.4.0/fixincludes/tests/base/iso/stdio_iso.h gcc-5.5.0/fixincludes/tests/base/iso/stdio_iso.h
*** gcc-5.4.0/fixincludes/tests/base/iso/stdio_iso.h	Wed Aug 10 08:43:38 2011
--- gcc-5.5.0/fixincludes/tests/base/iso/stdio_iso.h	Mon Jan 30 16:08:42 2017
***************
*** 12,14 ****
--- 12,27 ----
  #if defined( SOLARIS_GETC_STRICT_STDC_CHECK )
  #if	!defined(_REENTRANT) && !defined(_LP64) && (!defined(_STRICT_STDC) || (__cplusplus >= 199711L))
  #endif  /* SOLARIS_GETC_STRICT_STDC_CHECK */
+ 
+ 
+ #if defined( SOLARIS_GETS_C11_CHECK )
+ #if __STDC_VERSION__ < 201112L && __cplusplus < 201402L
+ extern char	*gets(char *) __attribute__((__deprecated__));
+ #endif
+ #endif  /* SOLARIS_GETS_C11_CHECK */
+ 
+ 
+ #if defined( SOLARIS_GETS_CXX14_CHECK )
+ #if __STDC_VERSION__ < 201112L && __cplusplus < 201402L
+ extern char	*gets(char *) __ATTR_DEPRECATED;
+ #endif  /* SOLARIS_GETS_CXX14_CHECK */
diff -Nrcpad gcc-5.4.0/fixincludes/tests/base/iso/stdlib_c99.h gcc-5.5.0/fixincludes/tests/base/iso/stdlib_c99.h
*** gcc-5.4.0/fixincludes/tests/base/iso/stdlib_c99.h	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/fixincludes/tests/base/iso/stdlib_c99.h	Mon Jan 30 16:08:42 2017
***************
*** 0 ****
--- 1,14 ----
+ /*  DO NOT EDIT THIS FILE.
+ 
+     It has been auto-edited by fixincludes from:
+ 
+ 	"fixinc/tests/inc/iso/stdlib_c99.h"
+ 
+     This had to be done to correct non-standard usages in the
+     original, manufacturer supplied header file.  */
+ 
+ 
+ 
+ #if defined( SOLARIS_STDLIB_NORETURN_CHECK )
+ extern void quick_exit(int) __attribute__((__noreturn__));
+ #endif  /* SOLARIS_STDLIB_NORETURN_CHECK */
diff -Nrcpad gcc-5.4.0/fixincludes/tests/base/math.h gcc-5.5.0/fixincludes/tests/base/math.h
*** gcc-5.4.0/fixincludes/tests/base/math.h	Sun Oct 28 21:42:48 2012
--- gcc-5.5.0/fixincludes/tests/base/math.h	Thu Dec  1 15:15:40 2016
*************** extern int class();
*** 85,90 ****
--- 85,96 ----
  #endif  /* RS6000_DOUBLE_CHECK */
  
  
+ #if defined( SOLARIS_MATH_12_CHECK )
+ #if __cplusplus >= 201103L
+ #endif
+ #endif  /* SOLARIS_MATH_12_CHECK */
+ 
+ 
  #if defined( STRICT_ANSI_NOT_CTD_CHECK )
  #if 1 && \
  && defined(mumbling) |& ( !defined(__STRICT_ANSI__)) \
diff -Nrcpad gcc-5.4.0/fixincludes/tests/base/stdio.h gcc-5.5.0/fixincludes/tests/base/stdio.h
*** gcc-5.4.0/fixincludes/tests/base/stdio.h	Mon Feb  1 20:22:43 2016
--- gcc-5.5.0/fixincludes/tests/base/stdio.h	Mon Jan 30 16:08:42 2017
*************** using std::__flsbuf;
*** 90,95 ****
--- 90,102 ----
  #endif  /* SOLARIS_STD___FILBUF_CHECK */
  
  
+ #if defined( SOLARIS_STD_GETS_CXX14_CHECK )
+ #if __cplusplus < 201402L
+ using std::gets;
+ #endif
+ #endif  /* SOLARIS_STD_GETS_CXX14_CHECK */
+ 
+ 
  #if defined( STDIO_STDARG_H_CHECK )
  
  #endif  /* STDIO_STDARG_H_CHECK */
diff -Nrcpad gcc-5.4.0/fixincludes/tests/base/stdlib.h gcc-5.5.0/fixincludes/tests/base/stdlib.h
*** gcc-5.4.0/fixincludes/tests/base/stdlib.h	Tue Feb 17 14:45:48 2015
--- gcc-5.5.0/fixincludes/tests/base/stdlib.h	Wed Jun 15 14:43:09 2016
***************
*** 9,14 ****
--- 9,34 ----
  
  
  
+ #if defined( AIX_STDLIB_MALLOC_CHECK )
+ extern void *malloc(size_t) __asm__("__linux_malloc");
+ #endif  /* AIX_STDLIB_MALLOC_CHECK */
+ 
+ 
+ #if defined( AIX_STDLIB_REALLOC_CHECK )
+ extern void *realloc(void *, size_t) __asm__("__linux_realloc");
+ #endif  /* AIX_STDLIB_REALLOC_CHECK */
+ 
+ 
+ #if defined( AIX_STDLIB_CALLOC_CHECK )
+ extern void *calloc(size_t, size_t) __asm__("__linux_calloc");
+ #endif  /* AIX_STDLIB_CALLOC_CHECK */
+ 
+ 
+ #if defined( AIX_STDLIB_VALLOC_CHECK )
+ extern void *valloc(size_t) __asm__("__linux_valloc");
+ #endif  /* AIX_STDLIB_VALLOC_CHECK */
+ 
+ 
  #if defined( AIX_STRTOF_CONST_CHECK )
  extern float    strtof(const char *, char **);
  #endif  /* AIX_STRTOF_CONST_CHECK */
diff -Nrcpad gcc-5.4.0/gcc/BASE-VER gcc-5.5.0/gcc/BASE-VER
*** gcc-5.4.0/gcc/BASE-VER	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/BASE-VER	Tue Oct 10 08:11:01 2017
***************
*** 1 ****
! 5.4.0
--- 1 ----
! 5.5.0
diff -Nrcpad gcc-5.4.0/gcc/ChangeLog gcc-5.5.0/gcc/ChangeLog
*** gcc-5.4.0/gcc/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,2957 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-10-02  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-09-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	* config/i386/i386.c (ix86_split_idivmod): Use mode instead of
+ 	always SImode for DIV and MOD in REG_EQUAL notes.
+ 
+ 2017-10-02  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-09-29  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/82337
+ 	* gimple-ssa-strength-reduction.c (find_phi_def): Don't record a
+ 	phi definition if the PHI result appears in an abnormal PHI.
+ 	(find_basis_for_base_expr): Don't record a basis if the LHS of the
+ 	basis appears in an abnormal PHI.
+ 
+ 2017-09-26  Iain Sandoe  <iain@codesourcery.com>
+             Ryan Mounce  <ryan@mounce.com.au>
+ 
+ 	PR bootstrap/81037
+  	Backport from mainline r235362
+  	2016-04-22  Szabolcs Nagy  <szabolcs.nagy@arm.com>
+  
+ 	* system.h (list, map, set, vector): Include conditionally.
+ 	* auto-profile.c (INCLUDE_MAP, INCLUDE_SET): Define.
+ 	* graphite-isl-ast-to-gimple.c (INCLUDE_MAP): Define.
+ 	* ipa-icf.c (INCLUDE_LIST): Define.
+ 	* ipa-icf-gimple.c (INCLUDE_LIST): Define.
+ 	* config/sh/sh.c (INCLUDE_VECTOR): Define.
+ 	* config/sh/sh_treg_combine.cc (INCLUDE_ALGORITHM): Define.
+ 	(INCLUDE_LIST, INCLUDE_VECTOR): Define.
+ 	* fortran/trans-common.c (INCLUDE_MAP): Define.
+ 
+ 	Backport from mainline r235361
+ 	2016-04-22  Szabolcs Nagy  <szabolcs.nagy@arm.com>
+ 
+ 	* auto-profile.c: Remove <string.h> include.
+ 	* diagnostic.c: Remove <new> include.
+ 	* genmatch.c: Likewise.
+ 	* pretty-print.c: Likewise.
+ 	* toplev.c: Likewise
+ 	* c/c-objc-common.c: Likewise.
+ 	* cp/error.c: Likewise.
+ 	* fortran/error.c: Likewise.
+ 
+ 2017-09-22  Alexander Monakov  <amonakov@ispras.ru>
+ 
+ 	PR tree-optimization/71702
+ 	Backport r230667
+ 	2015-11-20  Jim Wilson  <jim.wilson@linaro.org>
+ 
+ 	* tree-vect-data-refs.c (compare_tree): Call STRIP_NOPS.
+ 
+ 2017-09-21  Alan Modra  <amodra@gmail.com>
+ 
+ 	PR target/81996
+ 	* gcc/config/rs6000/rs6000.c (rs6000_return_addr): Use
+ 	stack_pointer_rtx for count 0.  Update comments.  Break up
+ 	large rtl expression.
+ 
+ 2017-09-19  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR c++/81355
+ 	* config/i386/i386.c (sorted_attr_string): Skip empty strings.
+ 
+ 2017-09-19  Martin Liska  <mliska@suse.cz>
+ 
+ 	Revert backport:
+ 	2017-08-10  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR c++/81355
+ 	* c-attribs.c (handle_target_attribute):
+ 	Report warning for an empty string argument of target attribute.
+ 
+ 2017-09-18  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2017-04-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/80362
+ 	* fold-const.c (fold_binary_loc): Look at unstripped ops when
+ 	looking for NEGATE_EXPR in -A / -B to A / B folding.
+ 
+ 	2015-11-25  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/68528
+ 	* fold-const.c (fold_binary_loc): Do not call negate_expr_p
+ 	on stripped operands.
+ 
+ 	2017-03-27  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/80171
+ 	* gimple-fold.c (fold_ctor_reference): Properly guard against
+ 	NULL return value from canonicalize_constructor_val.
+ 
+ 	2016-06-13  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/64516
+ 	* fold-const.c (fold_unary_loc): Preserve alignment when
+ 	folding a VIEW_CONVERT_EXPR into a MEM_REF.
+ 
+ 2017-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-08-09  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/81687
+ 	* omp-low.c (omp_copy_decl): Don't remap FORCED_LABEL or DECL_NONLOCAL
+ 	LABEL_DECLs.
+ 	* tree-cfg.c (move_stmt_op): Don't adjust DECL_CONTEXT of FORCED_LABEL
+ 	or DECL_NONLOCAL labels.
+ 	(move_stmt_r) <case GIMPLE_LABEL>: Adjust DECL_CONTEXT of FORCED_LABEL
+ 	or DECL_NONLOCAL labels here.
+ 
+ 	2017-08-08  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/81766
+ 	* function.c (thread_prologue_and_epilogue_insns): Restore
+ 	behavior of always calling find_many_sub_basic_blocks on
+ 	the inserted prologue.
+ 
+ 	2017-08-03  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/81621
+ 	* bb-reorder.c (pass_partition_blocks::execute): Return TODO_df_finish
+ 	after setting changeable df flags.
+ 
+ 	PR middle-end/81052
+ 	* omp-low.c (diagnose_sb_0): Handle flag_openmp_simd like flag_openmp.
+ 	(pass_diagnose_omp_blocks::gate): Enable also for flag_openmp_simd.
+ 
+ 	2017-08-02  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/79499
+ 	* function.c (thread_prologue_and_epilogue_insns): Determine blocks
+ 	for find_many_sub_basic_blocks bitmap by looking up BLOCK_FOR_INSN
+ 	of first NONDEBUG_INSN_P in each of the split_prologue_seq and
+ 	prologue_seq sequences - if any.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-08-11  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-opt/79987
+ 	* tree-chkp.c (chkp_get_bounds_for_decl_addr): Do not instrument
+ 	variables of void type.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-06-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR sanitizer/81224
+ 	* asan.c (instrument_derefs): Bail out inner references
+ 	that are hard register variables.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-08-30  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR inline-asm/82001
+ 	* ipa-icf-gimple.c (func_checker::compare_tree_list_operand):
+ 	Rename to ...
+ 	(func_checker::compare_asm_inputs_outputs): ... this function.
+ 	(func_checker::compare_gimple_asm): Use the function to compare
+ 	also ASM constrains.
+ 	* ipa-icf-gimple.h: Rename the function.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-08-10  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR c++/81355
+ 	* c-attribs.c (handle_target_attribute):
+ 	Report warning for an empty string argument of target attribute.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-08-08  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-opt/81696
+ 	* ipa-icf-gimple.c (func_checker::compare_cst_or_decl): Consider
+ 	LABEL_DECLs that can be from a different function.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-06-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/81128
+ 	* ipa-visibility.c (non_local_p): Handle visibility.
+ 
+ 2017-09-12  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-09-05  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR target/81833
+ 	* config/rs6000/altivec.md (altivec_vsum2sws): Convert from a
+ 	define_insn to a define_expand.
+ 	(altivec_vsum2sws_direct): New define_insn.
+ 	(altivec_vsumsws): Convert from a define_insn to a define_expand.
+ 
+ 2017-09-11  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	PR target/82181
+ 	* config/xtensa/xtensa.c (xtensa_mem_offset): Check that both
+ 	words of DImode object are reachable by xtensa_uimm8x4 access.
+ 
+ 2017-09-06  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline:
+ 	2017-08-30  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/81987
+ 	* gimple-ssa-strength-reduction.c (insert_initializers): Don't
+ 	insert an initializer in a location not dominated by the stride
+ 	definition.
+ 
+ 2017-09-05  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-08-29  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 		    Jakub Jelinek  <jakub@redhat.com>
+ 		    Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/81503
+ 	* gimple-ssa-strength-reduction.c (replace_mult_candidate): Ensure
+ 	folded constant fits in the target type; reorder tests for clarity.
+ 
+ 2017-08-22  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-08-17  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	PR target/80210
+ 	* config/rs6000/rs6000.c (rs6000_activate_target_options): New function.
+ 	(rs6000_set_current_function): Rewrite function to use it.
+ 
+ 2017-08-22  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2017-07-26 gcc-7-branch r250562.
+ 
+ 	PR 81487
+ 	* tree-ssa-structalias.c (alias_get_name): Use xasprintf instead
+ 	of asprintf.
+ 
+ 2017-08-22  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from trunk r247719.
+ 	2017-05-06  Richard Sandiford  <richard.sandiford@linaro.org>
+ 
+ 	PR rtl-optimization/75964
+ 	* simplify-rtx.c (simplify_const_relational_operation): Remove
+ 	invalid handling of comparisons of integer ABS.
+ 
+ 2017-08-22  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2017-07-05 trunk r249995.
+ 
+ 	PR target/81305
+ 	* config/avr/avr.c (avr_out_movhi_mr_r_xmega) [CONSTANT_ADDRESS_P]:
+ 	Don't depend on "optimize > 0".
+ 	(out_movhi_r_mr, out_movqi_mr_r): Same.
+ 	(out_movhi_mr_r, out_movqi_r_mr): Same.
+ 	(avr_address_cost) [CONSTANT_ADDRESS_P]: Don't depend cost for
+ 	io_address_operand on "optimize > 0".
+ 
+ 2017-08-22  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2016-06-15 trunk r237486.
+ 	Backport from 2017-07-12 trunk r250156.
+ 
+ 	PR target/79883
+ 	PR target/67353
+ 	* config/avr/avr.c (avr_set_current_function): Warn misspelled ISR
+ 	only if -Wmisspelled-isr is on.  In diagnostic messages: Quote
+ 	keywords and (parts of) identifiers.
+ 	[WITH_AVRLIBC]: Warn functions named "ISR", "SIGNAL" or "INTERUPT".
+ 	* doc/invoke.texi (AVR Options) <-Wmisspelled-isr>: Document.
+ 
+ 2017-08-22  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2017-04-19 trunk r246997.
+ 
+ 	PR target/80462
+ 	* config/avr/avr.c (tree.h): Include it.
+ 	(hash-table.h): Include it.
+ 	(hash-set.h): Include it.
+ 	(symtab.h): Include it.
+ 	(inchash.h): Include it.
+ 	(function.h): Include it.
+ 	(hash-map.h): Include it.
+ 	(plugin-api.h): Include it.
+ 	(ipa-ref.h): Include it.
+ 	(cgraph.h): Include it.
+ 	(avr_encode_section_info): Don't warn for uninitialized progmem
+ 	variable if it's just an alias.
+ 
+ 	Backport from 2017-07-12 trunk r250151.
+ 
+ 	PR target/81407
+ 	* config/avr/avr.c (avr_encode_section_info)
+ 	[progmem && !TREE_READONLY]: Error if progmem object needs
+ 	constructing.
+ 
+ 2017-08-22  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2017-08-22 trunk r251256.
+ 
+ 	PR target/81910
+ 	* config/avr/avr.c (avr_handle_addr_attribute): Early return if
+ 	not VAR_P. Filter attribute warnings with OPT_Wattributes.
+ 	(avr_attribute_table) <io, io_low, address>: Initialize
+ 	.decl_required with true.
+ 
+ 2017-08-19  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/81894
+ 	* doc/extend.texi (x86 Built-in Functions): Correct the name of
+ 	__builtin_ia32_lzcnt_u16.
+ 
+ 2017-08-17  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-08-17  Maxim Ostapenko  <m.ostapenko@samsung.com>
+ 
+ 	PR target/81861
+ 	* config/i386/i386.c (ix86_option_override_internal): Save target
+ 	specific options after ix86_stack_protector_guard_reg was changed.
+ 
+ 2017-08-16  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-08-08  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/81354
+ 	* gimple-ssa-strength-reduction.c (create_add_on_incoming_edge):
+ 	Insert on edges rather than explicitly creating landing pads.
+ 	(analyze_candidates_and_replace): Commit edge inserts.
+ 
+ 2017-07-31  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/81604
+ 	* ubsan.c (ubsan_type_descriptor): For UBSAN_PRINT_ARRAY don't
+ 	change type to the element type, instead add eltype variable and
+ 	use it where we are interested in the element type.
+ 
+ 2017-07-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/81555
+ 	PR tree-optimization/81556
+ 	* tree-ssa-reassoc.c (rewrite_expr_tree): Add NEXT_CHANGED argument,
+ 	if true, force CHANGED for the recursive invocation.
+ 	(reassociate_bb): Remember original length of ops array, pass
+ 	len != orig_len as NEXT_CHANGED in rewrite_expr_tree call.
+ 
+ 2017-07-26  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline r235874
+ 	2016-05-04  Alan Modra  <amodra@gmail.com>
+ 
+ 	* config/rs6000/rs6000.c (rs6000_elf_output_toc_section_asm_op):
+ 	Align .toc.
+ 
+ 2016-07-25  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-07-14  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/81162
+ 	* gimple-ssa-strength-reduction.c (replace_mult_candidate): Don't
+ 	replace a negate with an add.
+ 
+ 2017-07-24  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/80569
+ 	* config/i386/i386.c (ix86_option_override_internal): Disable
+ 	BMI, BMI2 and TBM instructions for -m16.
+ 
+ 2017-07-18  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/81471
+ 	* config/i386/i386.md (rorx_immediate_operand): New mode attribute.
+ 	(*bmi2_rorx<mode>3_1): Use rorx_immediate_operand as
+ 	operand 2 predicate.
+ 	(*bmi2_rorxsi3_1_zext): Use const_0_to_31_operand as
+ 	operand 2 predicate.
+ 	(ror,rol -> rorx splitters): Use const_int_operand as
+ 	operand 2 predicate.
+ 
+ 2017-07-14  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-07-10  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/81375
+ 	* config/i386/i386.md (divsf3): Add TARGET_SSE to TARGET_SSE_MATH.
+ 	(rcpps): Ditto.
+ 	(*rsqrtsf2_sse): Ditto.
+ 	(rsqrtsf2): Ditto.
+ 	(div<mode>3): Macroize insn from divdf3 and divsf3
+ 	using MODEF mode iterator.
+ 
+ 	Backport from mainline
+ 	2017-07-04  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/81300
+ 	* config/i386/i386.md (setcc + movzbl/and to xor + setcc peepholes):
+ 	Require dead FLAGS_REG at the beginning of a peephole.
+ 
+ 2017-07-03  Tom de Vries  <tom@codesourcery.com>
+ 
+ 	backport from mainline:
+ 	PR tree-optimization/81192
+ 	2017-07-03  Tom de Vries  <tom@codesourcery.com>
+ 
+ 	* tree-ssa-tail-merge.c (same_succ_flush_bb): Handle
+ 	BB_SAME_SUCC (bb) == NULL.
+ 
+ 2017-06-27  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	Revert:
+ 	Backports from trunk:
+ 
+ 	2017-04-12  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR target/80382
+ 	* config/rs6000/sync.md (atomic_load<mode>, atomic_store<mode): Test
+ 	for quad_address_p for TImode, instead of just not indexed_address.
+ 
+ 	2017-06-09  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR target/80966
+ 	* config/rs6000/rs6000.c (rs6000_emit_allocate_stack): Assert that
+ 	gen_add3_insn did not fail.
+ 	* config/rs6000/rs6000.md (add<mode>3): If asked to add a constant to
+ 	r0, construct that number in a temporary reg and add that reg to r0.
+ 	If asked to put the result in r0 as well, fail.
+ 
+ 2017-06-27  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	Backports from trunk:
+ 
+ 	2016-08-15  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR rtl-optimization/73650
+ 	* lra-constraints.c (simple_move_p): If the insn is multiple_sets
+ 	it is not a simple move.
+ 
+ 	2017-01-20  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR target/61729
+ 	PR target/77850
+ 	* config/rs6000/rs6000.c (rs6000_gimplify_va_arg): Adjust address to
+ 	read from, for big endian.
+ 
+ 	2017-04-12  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR target/80382
+ 	* config/rs6000/sync.md (atomic_load<mode>, atomic_store<mode): Test
+ 	for quad_address_p for TImode, instead of just not indexed_address.
+ 
+ 	2017-05-17  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR middle-end/80692
+ 	* real.c (do_compare): Give decimal_do_compare preference over
+ 	comparing just the signs.
+ 
+ 	2017-05-31  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR target/80618
+ 	* config/rs6000/vector.md (*vector_uneq<mode>): Write the nor in the
+ 	splitter result in the canonical way.
+ 
+ 	2017-06-09  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR target/80966
+ 	* config/rs6000/rs6000.c (rs6000_emit_allocate_stack): Assert that
+ 	gen_add3_insn did not fail.
+ 	* config/rs6000/rs6000.md (add<mode>3): If asked to add a constant to
+ 	r0, construct that number in a temporary reg and add that reg to r0.
+ 	If asked to put the result in r0 as well, fail.
+ 
+ 	2017-06-23  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR middle-end/80902
+ 	* builtins.c (expand_builtin_atomic_fetch_op): If emitting code after
+ 	a call, force the call to not be a tail call.
+ 
+ 2017-06-23  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2017-05-04  Prakhar Bahuguna  <prakhar.bahuguna@arm.com>
+ 
+ 	* config/arm/arm-builtins.c (arm_init_builtins): Rename
+ 	__builtin_arm_ldfscr to __builtin_arm_get_fpscr, and rename
+ 	__builtin_arm_stfscr to __builtin_arm_set_fpscr.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-05-31  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR target/79155
+ 	* config/i386/cpuid.h: Fix typo in a comment in cpuid.h.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-05-30  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR other/80909
+ 	* auto-profile.c (get_function_decl_from_block): Fix
+ 	parenthesis.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-05-26  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/80663
+ 	* params.def: Bound partial-inlining-entry-probability param.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-05-16  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/79850.
+ 	* ipa-devirt.c (odr_types_equivalent_p): Fix typo.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-05-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR driver/31468
+ 	* gcc.c (process_command): Do not allow empty argument of -o option.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-05-02  Martin Liska  <mliska@suse.cz>
+ 
+ 	* doc/gcov.texi: Add missing preposition.
+ 	* gcov.c (function_info::function_info): Properly fill up
+ 	all member variables.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-05-02  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR other/80589
+ 	* common.opt: Fix typo.
+ 	* doc/invoke.texi: Likewise.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	* doc/gcov.texi: Enhance documentation of gcov.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	* doc/gcov.texi: Sort options in alphabetic order.
+ 	* doc/gcov-dump.texi: Likewise.
+ 	* doc/gcov-tool.texi: Likewise.
+ 	* gcov.c (print_usage): Likewise.
+ 	* gcov-dump.c (print_usage): Likewise.
+ 	* gcov-tool.c (print_merge_usage_message): Likewise.
+ 	(print_rewrite_usage_message): Likewise.
+ 	(print_overlap_usage_message): Likewise.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR gcov-profile/53915
+ 	* gcov.c (format_gcov): Print 'NAN %' when top > bottom.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR driver/56469
+ 	* coverage.c (coverage_remove_note_file): New function.
+ 	* coverage.h: Declare the function.
+ 	* toplev.c (finalize): Clean if an error has been seen.
+ 
+ 2017-06-09  David S. Miller  <davem@davemloft.net>
+ 
+ 	PR target/80968
+ 	* config/sparc/sparc.c (sparc_flat_expand_epilogue): Don't
+ 	emit frame blockage here.
+ 	(sparc_expand_epilogue): Do it here.
+ 	* config/sparc/sparc.md (return expander): Emit frame blockage
+ 	for alloca here too.
+ 
+ 2017-06-06  David S. Miller  <davem@davemloft.net>
+ 
+ 	PR target/80968
+ 	* config/sparc/sparc.c (sparc_expand_prologue): Emit frame
+ 	blockage if function uses alloca.
+ 
+ 2017-06-01  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-08-19  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	* config/i386/rdseedintrin.h (_rdseed16_step, _rdseed32_step,
+ 	_rdseed64_step): Uglify argument names and/or local variable names
+ 	in inline functions.
+ 	* config/i386/rtmintrin.h (_xabort): Likewise.
+ 	* config/i386/avx512vlintrin.h (_mm256_ternarylogic_epi64,
+ 	_mm256_mask_ternarylogic_epi64, _mm256_maskz_ternarylogic_epi64,
+ 	_mm256_ternarylogic_epi32, _mm256_mask_ternarylogic_epi32,
+ 	_mm256_maskz_ternarylogic_epi32, _mm_ternarylogic_epi64,
+ 	_mm_mask_ternarylogic_epi64, _mm_maskz_ternarylogic_epi64,
+ 	_mm_ternarylogic_epi32, _mm_mask_ternarylogic_epi32,
+ 	_mm_maskz_ternarylogic_epi32): Likewise.
+ 	* config/i386/lwpintrin.h (__llwpcb, __lwpval32, __lwpval64,
+ 	__lwpins32, __lwpins64): Likewise.
+ 	* config/i386/avx2intrin.h (_mm_i32gather_pd, _mm_mask_i32gather_pd,
+ 	_mm256_i32gather_pd, _mm256_mask_i32gather_pd, _mm_i64gather_pd,
+ 	_mm_mask_i64gather_pd, _mm256_i64gather_pd, _mm256_mask_i64gather_pd,
+ 	_mm_i32gather_ps, _mm_mask_i32gather_ps, _mm256_i32gather_ps,
+ 	_mm256_mask_i32gather_ps, _mm_i64gather_ps, _mm_mask_i64gather_ps,
+ 	_mm256_i64gather_ps, _mm256_mask_i64gather_ps, _mm_i32gather_epi64,
+ 	_mm_mask_i32gather_epi64, _mm256_i32gather_epi64,
+ 	_mm256_mask_i32gather_epi64, _mm_i64gather_epi64,
+ 	_mm_mask_i64gather_epi64, _mm256_i64gather_epi64,
+ 	_mm256_mask_i64gather_epi64, _mm_i32gather_epi32,
+ 	_mm_mask_i32gather_epi32, _mm256_i32gather_epi32,
+ 	_mm256_mask_i32gather_epi32, _mm_i64gather_epi32,
+ 	_mm_mask_i64gather_epi32, _mm256_i64gather_epi32,
+ 	_mm256_mask_i64gather_epi32): Likewise.
+ 	* config/i386/pmm_malloc.h (_mm_malloc, _mm_free): Likewise.
+ 	* config/i386/ia32intrin.h (__writeeflags): Likewise.
+ 	* config/i386/avx512pfintrin.h (_mm512_mask_prefetch_i32gather_pd,
+ 	_mm512_mask_prefetch_i32gather_ps, _mm512_mask_prefetch_i64gather_pd,
+ 	_mm512_mask_prefetch_i64gather_ps, _mm512_prefetch_i32scatter_pd,
+ 	_mm512_prefetch_i32scatter_ps, _mm512_mask_prefetch_i32scatter_pd,
+ 	_mm512_mask_prefetch_i32scatter_ps, _mm512_prefetch_i64scatter_pd,
+ 	_mm512_prefetch_i64scatter_ps, _mm512_mask_prefetch_i64scatter_pd,
+ 	_mm512_mask_prefetch_i64scatter_ps): Likewise.
+ 	* config/i386/gmm_malloc.h (_mm_malloc, _mm_free): Likewise.
+ 	* config/i386/avx512fintrin.h (_mm512_ternarylogic_epi64,
+ 	_mm512_mask_ternarylogic_epi64, _mm512_maskz_ternarylogic_epi64,
+ 	_mm512_ternarylogic_epi32, _mm512_mask_ternarylogic_epi32,
+ 	_mm512_maskz_ternarylogic_epi32, _mm512_i32gather_ps,
+ 	_mm512_mask_i32gather_ps, _mm512_i32gather_pd, _mm512_i64gather_ps,
+ 	_mm512_i64gather_pd, _mm512_i32gather_epi32, _mm512_i32gather_epi64,
+ 	_mm512_i64gather_epi32, _mm512_i64gather_epi64): Likewise.
+ 
+ 2017-05-30  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-05-29  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	* config/xtensa/xtensa.c (xtensa_emit_call): Use
+ 	HOST_WIDE_INT_PRINT_HEX instead of 0x%lx format string.
+ 	(print_operand): Use HOST_WIDE_INT_PRINT_DEC instead of %ld
+ 	format string.
+ 
+ 2017-05-30  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-11-29  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	* config/xtensa/xtensa.c (hwloop_optimize): Don't emit zero
+ 	overhead loop start between a call and its CALL_ARG_LOCATION
+ 	note.
+ 
+ 2017-05-30  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2015-09-15  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	* config/xtensa/xtensa.h (DWARF_ALT_FRAME_RETURN_COLUMN): New
+ 	definition.
+ 	(DWARF_FRAME_REGISTERS): Reserve space for one extra register in
+ 	call0 ABI.
+ 
+ 2017-05-30  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2015-09-15  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	* config/xtensa/xtensa.c (xtensa_call_tls_desc): Use a10 or a2
+ 	to pass TLS call argument, according to current ABI.
+ 	* config/xtensa/xtensa.md (tls_call pattern): Use callx8 or
+ 	callx0 for TLS call, according to current ABI.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-04-25  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	* Makefile.in (s-options): Invoke opt-gather.awk with LC_ALL=C in the
+ 	environment.
+ 
+ 	2017-04-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/80385
+ 	* simplify-rtx.c (simplify_unary_operation_1): Don't transform
+ 	(not (neg X)) into (plus X -1) for complex or non-integral modes.
+ 
+ 	PR libgomp/80394
+ 	* omp-low.c (scan_omp_task): Don't optimize away empty tasks
+ 	if they have any depend clauses.
+ 
+ 	2017-04-04  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/80286
+ 	* config/i386/i386.c (ix86_expand_args_builtin): If op has scalar
+ 	int mode, convert_modes it to mode as unsigned, otherwise use
+ 	lowpart_subreg to mode rather than SImode.
+ 	* config/i386/sse.md (<mask_codefor>ashr<mode>3<mask_name>,
+ 	ashr<mode>3, ashr<mode>3<mask_name>, <shift_insn><mode>3<mask_name>):
+ 	Use DImode instead of SImode for the shift count operand.
+ 	* config/i386/mmx.md (mmx_ashr<mode>3, mmx_<shift_insn><mode>3):
+ 	Likewise.
+ 
+ 	2017-03-31  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR debug/80025
+ 	* cselib.c (cselib_hasher::equal): Pass 0 to rtx_equal_for_cselib_1.
+ 	(rtx_equal_for_cselib_1): Add depth argument.  If depth
+ 	is 128, don't look up VALUE locs and punt.  Increment
+ 	depth in recursive calls when walking VALUE locs.
+ 
+ 	2017-03-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/80168
+ 	* asan.c (instrument_derefs): Copy over last operand from
+ 	original COMPONENT_REF to the new COMPONENT_REF with
+ 	DECL_BIT_FIELD_REPRESENTATIVE.
+ 	* ubsan.c (instrument_object_size): Likewise.
+ 
+ 	2017-03-24  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/80112
+ 	* loop-doloop.c (doloop_condition_get): Don't check condition
+ 	if cmp isn't SET with IF_THEN_ELSE src.
+ 
+ 	2017-03-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/80129
+ 	* gimplify.c (gimplify_modify_expr_rhs) <case COND_EXPR>: Clear
+ 	TREE_READONLY on result if writing it more than once.
+ 
+ 	2017-03-09  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/79944
+ 	* asan.c (get_mem_refs_of_builtin_call): For BUILT_IN_ATOMIC* and
+ 	BUILT_IN_SYNC*, determine the access type from the size suffix and
+ 	always build a MEM_REF with that type.  Handle forgotten
+ 	BUILT_IN_SYNC_FETCH_AND_NAND_16 and BUILT_IN_SYNC_NAND_AND_FETCH_16.
+ 
+ 	PR target/79932
+ 	* config/i386/avx512vlintrin.h (_mm256_cmpge_epi32_mask,
+ 	_mm256_cmpge_epi64_mask, _mm256_cmpge_epu32_mask,
+ 	_mm256_cmpge_epu64_mask, _mm256_cmple_epi32_mask,
+ 	_mm256_cmple_epi64_mask, _mm256_cmple_epu32_mask,
+ 	_mm256_cmple_epu64_mask, _mm256_cmplt_epi32_mask,
+ 	_mm256_cmplt_epi64_mask, _mm256_cmplt_epu32_mask,
+ 	_mm256_cmplt_epu64_mask, _mm256_cmpneq_epi32_mask,
+ 	_mm256_cmpneq_epi64_mask, _mm256_cmpneq_epu32_mask,
+ 	_mm256_cmpneq_epu64_mask, _mm256_mask_cmpge_epi32_mask,
+ 	_mm256_mask_cmpge_epi64_mask, _mm256_mask_cmpge_epu32_mask,
+ 	_mm256_mask_cmpge_epu64_mask, _mm256_mask_cmple_epi32_mask,
+ 	_mm256_mask_cmple_epi64_mask, _mm256_mask_cmple_epu32_mask,
+ 	_mm256_mask_cmple_epu64_mask, _mm256_mask_cmplt_epi32_mask,
+ 	_mm256_mask_cmplt_epi64_mask, _mm256_mask_cmplt_epu32_mask,
+ 	_mm256_mask_cmplt_epu64_mask, _mm256_mask_cmpneq_epi32_mask,
+ 	_mm256_mask_cmpneq_epi64_mask, _mm256_mask_cmpneq_epu32_mask,
+ 	_mm256_mask_cmpneq_epu64_mask, _mm_cmpge_epi32_mask,
+ 	_mm_cmpge_epi64_mask, _mm_cmpge_epu32_mask, _mm_cmpge_epu64_mask,
+ 	_mm_cmple_epi32_mask, _mm_cmple_epi64_mask, _mm_cmple_epu32_mask,
+ 	_mm_cmple_epu64_mask, _mm_cmplt_epi32_mask, _mm_cmplt_epi64_mask,
+ 	_mm_cmplt_epu32_mask, _mm_cmplt_epu64_mask, _mm_cmpneq_epi32_mask,
+ 	_mm_cmpneq_epi64_mask, _mm_cmpneq_epu32_mask, _mm_cmpneq_epu64_mask,
+ 	_mm_mask_cmpge_epi32_mask, _mm_mask_cmpge_epi64_mask,
+ 	_mm_mask_cmpge_epu32_mask, _mm_mask_cmpge_epu64_mask,
+ 	_mm_mask_cmple_epi32_mask, _mm_mask_cmple_epi64_mask,
+ 	_mm_mask_cmple_epu32_mask, _mm_mask_cmple_epu64_mask,
+ 	_mm_mask_cmplt_epi32_mask, _mm_mask_cmplt_epi64_mask,
+ 	_mm_mask_cmplt_epu32_mask, _mm_mask_cmplt_epu64_mask,
+ 	_mm_mask_cmpneq_epi32_mask, _mm_mask_cmpneq_epi64_mask,
+ 	_mm_mask_cmpneq_epu32_mask, _mm_mask_cmpneq_epu64_mask): Move
+ 	definitions outside of __OPTIMIZE__ guarded section.
+ 
+ 	PR target/79932
+ 	* config/i386/avx512bwintrin.h (_mm512_packs_epi32,
+ 	_mm512_maskz_packs_epi32, _mm512_mask_packs_epi32,
+ 	_mm512_packus_epi32, _mm512_maskz_packus_epi32,
+ 	_mm512_mask_packus_epi32): Move definitions outside of __OPTIMIZE__
+ 	guarded section.
+ 
+ 	2017-03-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/79901
+ 	* config/i386/sse.md (*avx512bw_<code><mode>3<mask_name>): Renamed to
+ 	...
+ 	(*avx512f_<code><mode>3<mask_name>): ... this.
+ 	(<code><mode>3 with maxmin code iterator): Use VI8_AVX2_AVX512F
+ 	iterator instead of VI8_AVX2_AVX512BW.
+ 
+ 	PR rtl-optimization/79901
+ 	* expr.c (expand_expr_real_2): For vector MIN/MAX, if there is no
+ 	min/max expander, expand it using expand_vec_cond_expr.
+ 
+ 	2017-03-03  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79807
+ 	* config/i386/i386.c (ix86_expand_multi_arg_builtin): If target
+ 	is a memory operand, increase num_memory.
+ 	(ix86_expand_args_builtin): Likewise.
+ 
+ 	2017-02-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79729
+ 	* config/i386/i386.c (ix86_print_operand) <case 'R'>: Replace
+ 	gcc_unreachable with output_operand_lossage.
+ 
+ 	2017-02-25  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/79396
+ 	* tree-eh.c (operation_could_trap_p, stmt_could_throw_1_p): Handle
+ 	FMA_EXPR like tcc_binary or tcc_unary.
+ 
+ 	2017-02-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79570
+ 	* sel-sched.c (moveup_expr_cached): Don't call sel_bb_head
+ 	on temporarily removed DEBUG_INSNs.
+ 
+ 	PR target/79494
+ 	* config/i386/i386.c (ix86_expand_split_stack_prologue): Call
+ 	make_reg_eh_region_note_nothrow_nononlocal on call_insn.
+ 
+ 	2017-02-20  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79568
+ 	* config/i386/i386.c (ix86_expand_builtin): Handle
+ 	OPTION_MASK_ISA_AVX512VL and OPTION_MASK_ISA_64BIT in
+ 	ix86_builtins_isa[fcode].isa as a requirement of those
+ 	flags and any other flag in the bitmask.
+ 	(ix86_init_mmx_sse_builtins): Use 0 instead of
+ 	~OPTION_MASK_ISA_64BIT as mask.
+ 	* config/i386/i386-builtin.def (bdesc_special_args,
+ 	bdesc_args): Likewise.
+ 
+ 	2017-02-18  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79559
+ 	* config/i386/i386.c (ix86_print_operand): Use output_operand_lossage
+ 	instead of gcc_assert for K, r and R code checks.  Formatting fixes.
+ 
+ 	2017-02-10  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/79411
+ 	* tree-ssa-reassoc.c (is_reassociable_op): Return false if
+ 	stmt operands are SSA_NAMEs used in abnormal phis.
+ 	(can_reassociate_p): Return false if op is SSA_NAME used in abnormal
+ 	phis.
+ 
+ 	2017-02-07  Jakub Jelinek  <jakub@redhat.com>
+ 		    Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/79399
+ 	* ira-int.h (struct target_ira_int): Change x_max_struct_costs_size
+ 	type from int to size_t.
+ 	* ira-costs.c (struct_costs_size): Change type from int to size_t.
+ 
+ 	2017-02-02  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79197
+ 	* config/rs6000/rs6000.md (*fixuns_trunc<mode>di2_fctiduz): Rename to ...
+ 	(fixuns_trunc<mode>di2): ... this, remove previous expander.  Put all
+ 	conditions on a single line.
+ 
+ 	2016-12-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR ipa/77905
+ 	* ipa-pure-const.c (cdtor_p): Return true for
+ 	DECL_STATIC_{CON,DE}STRUCTOR even when it is
+ 	DECL_LOOPING_CONST_OR_PURE_P.
+ 
+ 	2016-12-14  Wilco Dijkstra  <wdijkstr@arm.com>
+ 		    Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/78796
+ 	* config/aarch64/aarch64.c (aarch64_classify_symbol): Merge large
+ 	model checks into switch.
+ 
+ 	2016-11-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/78298
+ 	* tree-nested.c (convert_local_reference_stmt): After adding
+ 	shared (FRAME.NN) clause to omp parallel, task or target,
+ 	add it also to all outer omp parallel, task or target constructs.
+ 
+ 	2016-11-23  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/69183
+ 	* omp-low.c (build_outer_var_ref): Change lastprivate argument
+ 	to code, pass it recursively, adjust uses.  For OMP_CLAUSE_PRIVATE
+ 	on worksharing constructs, treat it like clauses on simd construct.
+ 	Formatting fix.
+ 	(lower_rec_input_clauses): For OMP_CLAUSE_PRIVATE_OUTER_REF pass
+ 	OMP_CLAUSE_PRIVATE as last argument to build_outer_var_ref.
+ 	(lower_lastprivate_clauses): Pass OMP_CLAUSE_LASTPRIVATE instead
+ 	of true as last argument to build_outer_var_ref.
+ 
+ 	2016-11-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/78416
+ 	* expmed.c (expand_divmod): Use wide_int for computation of
+ 	op1_is_pow2.  Don't set it if op1 is 0.  Formatting fixes.
+ 	Use size <= HOST_BITS_PER_WIDE_INT instead of
+ 	HOST_BITS_PER_WIDE_INT >= size.
+ 
+ 	2016-11-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/67335
+ 	* omp-low.c (simd_clone_adjust_argument_types): Use NULL prefix
+ 	for tmp simd array if DECL_NAME (parm) is NULL.
+ 
+ 	2016-11-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/78378
+ 	* combine.c (make_extraction): Use force_to_mode for non-{REG,MEM}
+ 	inner only if pos is 0.  Fix up formatting.
+ 
+ 	2016-11-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/78227
+ 	* config/i386/i386.c (ix86_expand_sse_cmp): Force dest into
+ 	cmp_mode argument even for -O0 if cmp_mode != mode and maskcmp.
+ 
+ 	2016-10-29  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/77919
+ 	* expr.c (expand_expr_real_1) <normal_inner_ref>: Only avoid forcing
+ 	into memory if both modes are complex and their inner modes have the
+ 	same precision.  If the two modes are different complex modes, convert
+ 	each part separately and generate a new CONCAT.
+ 
+ 	2016-10-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/77919
+ 	* expr.c (expand_expr_real_1) <normal_inner_ref>: Force CONCAT into
+ 	MEM if mode1 is not a complex mode.
+ 
+ 	2016-10-05  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/66343
+ 	* ubsan.c (ubsan_ids): New GTY(()) array.
+ 	(ubsan_type_descriptor, ubsan_create_data): Use ubsan_ids
+ 	instead of static local counters.
+ 
+ 	2016-09-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/77665
+ 	* tree-inline.c (remap_gimple_stmt): Set has_simduid_loops
+ 	for all IFN_GOMP_SIMD_* internal fns.
+ 
+ 	2016-09-20  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/77624
+ 	* builtins.c (fold_builtin_atomic_always_lock_free): Only look through
+ 	cast to void * if the cast is from some other pointer type.
+ 
+ 	2016-09-19  Jakub Jelinek  <jakub@redhat.com>
+ 		    Jan Hubicka  <jh@suse.cz>
+ 
+ 	PR target/77587
+ 	* cgraph.c (cgraph_node::rtl_info): Pass &avail to
+ 	ultimate_alias_target call, return NULL if avail < AVAIL_AVAILABLE.
+ 	Call ultimate_alias_target just once, not up to 4 times.
+ 
+ 	2016-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 		    Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	PR middle-end/77594
+ 	* internal-fn.c (expand_arith_overflow) <case MINUS_EXPR>: Don't fall
+ 	through into expand_addsub_overflow after expand_neg_overflow.
+ 
+ 	2016-09-14  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/68260
+ 	* tsan.c: Include target.h.
+ 	(enum tsan_atomic_action): Add bool_clear and bool_test_and_set.
+ 	(BOOL_CLEAR, BOOL_TEST_AND_SET): Define.
+ 	(tsan_atomic_table): Add BUILT_IN_ATOMIC_CLEAR and
+ 	BUILT_IN_ATOMIC_TEST_AND_SET entries.
+ 	(instrument_builtin_call): Handle bool_clear and bool_test_and_set.
+ 
+ 	2016-09-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/77516
+ 	* omp-low.c (lower_rec_simd_input_clauses): Use max_vf for non-positive
+ 	OMP_CLAUSE_SAFELEN_EXPR.
+ 
+ 	2016-08-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR debug/77363
+ 	* dwarf2out.c (modified_type_die): Use lookup_type_die (type)
+ 	instead of lookup_type_die (type_main_variant (type)) even for array
+ 	types.
+ 
+ 	PR middle-end/77377
+ 	* simplify-rtx.c (avoid_constant_pool_reference): For out of bounds
+ 	constant pool reference return x instead of c.
+ 
+ 	2016-08-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/71910
+ 	* tree-cfg.c (execute_fixup_cfg): Add node variable, use it.  Before inlining,
+ 	add cgraph edge for the added __builtin_unreachable call.
+ 
+ 	2016-08-15  Martin Liska  <mliska@suse.cz>
+ 		    Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/72824
+ 	* tree-loop-distribution.c (const_with_all_bytes_same)
+ 	<case VECTOR_CST>: Fix a typo.
+ 
+ 	2016-08-09  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/72824
+ 	* tree-loop-distribution.c (const_with_all_bytes_same): Verify
+ 	real_zerop is not negative.
+ 
+ 	2016-07-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/71953
+ 	* asan.c (asan_dynamic_init_call): Call asan_init_shadow_ptr_types
+ 	before builtin_decl_implicit.
+ 
+ 2017-05-29  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* doc/install.texi (Options specification): Move entry of
+ 	--enable-sjlj-exceptions.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-24  Jan Hubicka  <hubicka@ucw.cz>
+ 
+ 	PR middle-end/79931
+ 	* ipa-devirt.c (dump_possible_polymorphic_call_targets): Fix ICE.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-19  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR ipa/65972
+ 	* auto-profile.c (afdo_vpt_for_early_inline): Update SSA
+ 	when needed by AutoPGO.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-19  Paulo J. Matos  <paulo@matos-sorge.com>
+ 
+ 	PR lto/50345
+ 	* doc/lto.texi: Remove an extra 'that'.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-18  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR gcov-profile/78783
+ 	* gcov-tool.c (gcov_output_files): Validate that destination
+ 	file is either removed by the tool or by a user.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR gcov-profile/80413
+ 	* gcov-io.c (gcov_write_string): Copy to buffer just when
+ 	allocated size is greater than zero.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-11  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/80212
+ 	* cgraph.c (cgraph_node::dump): Dump calls_comdat_local.
+ 	* ipa-split.c (split_function): Create a local comdat symbol
+ 	if caller is in a comdat group.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-11  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/80212
+ 	* ipa-cp.c (determine_versionability): Handle calls_comdat_local
+ 	flags.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-11  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR sanitizer/70878
+ 	* ubsan.c (instrument_object_size): Do not instrument register
+ 	variables.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-10  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR gcov-profile/80224
+ 	* gcov.c (print_usage): Fix usage string.
+ 	(get_gcov_intermediate_filename): Remove.
+ 	(output_gcov_file): Use both for normal and intermediate format.
+ 	(generate_results): Do not initialize special file for
+ 	intermediate format.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-28  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR ipa/80205
+ 	* tree-inline.c (copy_phis_for_bb): Do not create PHI node
+ 	without arguments, generate default definition of a SSA name.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/80104
+ 	* cgraphunit.c (cgraph_node::expand_thunk): Mark argument of a
+ 	thunk call as DECL_GIMPLE_REG_P when vector or complex type.
+ 
+ 2017-05-26  Sheldon Lobo  <smlobo@sheldon.us.oracle.com>
+ 
+ 	Backported from mainline
+ 	2017-05-24  Sheldon Lobo  <smlobo@sheldon.us.oracle.com>
+ 
+ 	* config/sparc/sparc.md (length): Return the correct value for -mflat
+ 	sibcalls to match output_sibcall.
+ 
+ 2017-05-19  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-05-18  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/80799
+ 	* config/i386/mmx.md (*mov<mode>_internal): Enable
+ 	alternatives 11, 12, 13 and 14 also for 32bit targets.
+ 	Remove alternatives 15, 16, 17 and 18.
+ 	* config/i386/sse.md (vec_concatv2di): Change
+ 	alternative (!x, *y) to (x, ?!*Yn).
+ 
+ 2017-05-15  Richard Biener  <rguenther@suse.de>
+ 
+ 	Revert backport of
+ 	PR middle-end/80222
+ 	* gimple-fold.c (gimple_fold_indirect_ref): Do not touch
+ 	TYPE_REF_CAN_ALIAS_ALL references.
+ 	* fold-const.c (fold_indirect_ref_1): Likewise.
+ 
+ 2017-05-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2017-02-28  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/79732
+ 	* tree-inline.c (expand_call_inline): Handle anonymous
+ 	SSA lhs properly when inlining a function without return
+ 	value.
+ 
+ 	2017-02-22  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/79666
+ 	* tree-vrp.c (extract_range_from_binary_expr_1): Make sure
+ 	to not symbolically negate if that may introduce undefined
+ 	overflow.
+ 
+ 2017-05-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2017-03-21  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/80122
+ 	* tree-inline.c (copy_bb): Do not expans va-arg packs or
+ 	va_arg_pack_len when the inlined call stmt requires pack
+ 	expansion itself.
+ 	* tree-inline.h (struct copy_body_data): Make call_stmt a gcall *.
+ 
+ 	2017-03-28  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/80222
+ 	* gimple-fold.c (gimple_fold_indirect_ref): Do not touch
+ 	TYPE_REF_CAN_ALIAS_ALL references.
+ 	* fold-const.c (fold_indirect_ref_1): Likewise.
+ 
+ 	2017-04-06  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/80334
+ 	* tree-ssa-loop-ivopts.c (rewrite_use_address): Properly
+ 	preserve alignment of accesses.
+ 
+ 	2017-04-27  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/80539
+ 	* tree-chrec.c (chrec_fold_plus_poly_poly): Deal with not
+ 	being in loop-closed SSA form conservatively.
+ 	(chrec_fold_multiply_poly_poly): Likewise.
+ 
+ 2016-05-08  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	PR target/69868 + swap optimization backports
+ 	* config/rs6000/rs6000.c (swap_web_entry): Enlarge
+ 	special_handling bitfield.
+ 	(special_handling_values): Add SH_XXPERMDI, SH_CONCAT, SH_VPERM,
+ 	and SH_VPERM_COMP.
+ 	(const_load_sequence_p): New.
+ 	(load_comp_mask_p): New.
+ 	(v2df_reduction_p): New.
+ 	(rtx_is_swappable_p): Perform special handling for XXPERMDI and
+ 	for reductions.
+ 	(insn_is_swappable_p): Perform special handling for VEC_CONCAT,
+ 	V2DF reductions, and various permutes.
+ 	(adjust_xxpermdi): New.
+ 	(adjust_concat): New.
+ 	(find_swapped_load_and_const_vector): New.
+ 	(replace_const_vector_in_load): New.
+ 	(adjust_vperm): New.
+ 	(adjust_vperm_comp): New.
+ 	(handle_special_swappables): Call adjust_xxpermdi, adjust_concat,
+ 	adjust_vperm, and adjust_vperm_comp.
+ 	(replace_swap_with_copy): Allow vector NOT operations to also be
+ 	replaced by copies.
+ 	(dump_swap_insn_table): Handle new special handling values.
+ 
+ 2017-05-03  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-05-01  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/68491
+ 	* config/i386/cpuid.h (__get_cpuid): Always return 0 when
+ 	__get_cpuid_max returns 0.
+ 
+ 2017-04-21  Christophe Lyon  <christophe.lyon@linaro.org>
+ 
+ 	Backport from mainline
+ 	+2015-11-23  Kugan Vivekanandarajah  <kuganv@linaro.org>
+ 
+ 	PR target/68390
+ 	* config/arm/arm.c (arm_function_ok_for_sibcall): Get function type
+ 	for indirect function call.
+ 
+ 2017-04-12  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-04-11  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR target/80376
+ 	PR target/80315
+ 	* config/rs6000/rs6000.c (rs6000_expand_unop_builtin): Return
+ 	CONST0_RTX (mode) rather than const0_rtx where appropriate.
+ 	(rs6000_expand_binop_builtin): Likewise.
+ 	(rs6000_expand_ternop_builtin): Likewise; also add missing
+ 	vsx_xxpermdi_* variants; also fix typo (arg1 => arg2) for
+ 	vshasigma built-ins.
+ 	* doc/extend.texi: Document that vec_xxpermdi's third argument
+ 	must be a constant.
+ 
+ 2017-04-11  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from GCC 6
+ 	2017-04-06  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	PR target/80082
+ 	* config/arm/arm-protos.h (FL_LPAE): Define macro.
+ 	(FL_FOR_ARCH7VE): Add FL_LPAE.
+ 	(arm_arch_lpae): Declare extern.
+ 	* config/arm/arm.c (arm_arch_lpae): Declare.
+ 	(arm_option_override): Define arm_arch_lpae.
+ 	* config/arm/arm.h (TARGET_HAVE_LPAE): Redefine in term of
+ 	arm_arch_lpae.
+ 
+ 2017-04-11  Martin Jambor  <mjambor@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-30  Martin Jambor  <mjambor@suse.cz>
+ 
+ 	PR ipa/77333
+ 	* cgraph.h (cgraph_build_function_type_skip_args): Declare.
+ 	* cgraph.c (redirect_call_stmt_to_callee): Set gimple fntype so that
+ 	it reflects the signature changes performed at the callee side.
+ 	* cgraphclones.c (build_function_type_skip_args): Make public, renamed
+ 	to cgraph_build_function_type_skip_args.
+ 	(build_function_decl_skip_args): Adjust call to the above function.
+ 
+ 2017-04-11  Bin Cheng  <bin.cheng@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-02-10  Bin Cheng  <bin.cheng@arm.com>
+ 
+ 	PR tree-optimization/68021
+ 	* tree-ssa-loop-ivopts.c (get_computation_aff): Set ratio to 1 if
+ 	when computing the value of biv cand by itself.
+ 
+ 2017-04-08  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backport from mainline
+ 	2017-04-08  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	* config/aarch64/aarch64-freebsd.h: Define MCOUNT_NAME.
+ 	Add comment for WCHAR_T.
+ 
+ 2017-04-07  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backport from mainline
+ 	2017-04-07  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	* config/aarch64/aarch64-freebsd.h: Define WCHAR_T.
+ 
+ 2017-04-07  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-04-06  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/79733
+ 	* config/i386/i386.c (ix86_expand_builtin)
+ 	<case IX86_BUILTIN_KORTEST{C,Z}16>: Determine insn operand
+ 	mode from insn data. Convert operands to insn operand mode.
+ 	Copy operands that don't satisfy insn predicate to a register.
+ 
+ 2017-03-30  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-03-30  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	PR target/80246
+ 	* config/rs6000/dfp.md (dfp_dxex_<mode>): Update mode of operand 0.
+ 	(dfp_diex_<mode>): Update mode of operand 1.
+ 	* doc/extend.texi (dxex, dxexq): Document change to return type.
+ 	(diex, diexq): Document change to argument type.
+ 
+ 2017-03-25  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/80180
+ 	* config/i386/i386.c (ix86_expand_builtin)
+ 	<IX86_BUILTIN_RDSEED{16,32,64}_STEP>: Do not expand arg0 between
+ 	flags reg setting and flags reg using instructions.
+ 	<IX86_BUILTIN_RDRAND{16,32,64}_STEP>: Ditto.  Use non-flags reg
+ 	clobbering instructions to zero extend op2.
+ 
+ >>>>>>> .r248557
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-02-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR lto/79587
+ 	* data-streamer-in.c (streamer_read_gcov_count): Remove assert.
+ 	* data-streamer-out.c (streamer_write_gcov_count_stream):
+ 	Likewise.
+ 	* value-prof.c (stream_out_histogram_value): Make assert more
+ 	precise based on type of counter.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR target/79906
+ 	* config/rs6000/rs6000.c (rs6000_inner_target_options): Show
+ 	error message instead of an ICE.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-21  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR gcov-profile/80081
+ 	* Makefile.in: Add gcov-dump and fix installation of gcov-tool.
+ 	* doc/gcc.texi: Include gcov-dump stuff.
+ 	* doc/gcov-dump.texi: New file.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR middle-end/79753
+ 	* tree-chkp.c (chkp_build_returned_bound): Do not build
+ 	returned bounds for a LHS that's not a BOUNDED_P type.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR target/79769
+ 	PR target/79770
+ 	* tree-chkp.c (chkp_find_bounds_1): Handle REAL_CST,
+ 	COMPLEX_CST and VECTOR_CST.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-14  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR middle-end/79831
+ 	* doc/invoke.texi (-Wchkp): Document the option.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR middle-end/78339
+ 	* ipa-pure-const.c (warn_function_noreturn): If the declarations
+ 	is a CHKP clone, use original declaration.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-06-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR target/65705
+ 	PR target/69804
+ 	PR sanitizer/71458
+ 
+ 	* toplev.c (process_options): Enable MPX with LSAN and UBSAN.
+ 	* tree-chkp.c (chkp_walk_pointer_assignments): Verify that
+ 	FIELD != NULL.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-09  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/79631
+ 	* tree-chkp-opt.c (chkp_is_constant_addr): Call
+ 	tree_int_cst_sign_bit just for INTEGER constants.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-09  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/79761
+ 	* tree-chkp.c (chkp_get_bound_for_parm): Get bounds for a param.
+ 	(chkp_find_bounds_1): Remove gcc_unreachable.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/79803
+ 	* tree-ssa-loop-prefetch.c (tree_ssa_prefetch_arrays): Remove
+ 	assert.
+ 	(pass_loop_prefetch::execute): Disabled optimization if an
+ 	assumption about L1 cache size is not met.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR rtl-optimization/79574
+ 	* gcse.c (struct gcse_expr): Use HOST_WIDE_INT instead of int.
+ 	(hash_scan_set): Likewise.
+ 	(dump_hash_table): Likewise.
+ 	(hoist_code): Likewise.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-02-17  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR rtl-optimization/79574
+ 	* gcse.c (want_to_gcse_p): Prevent integer overflow.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-02-17  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR rtl-optimization/79577
+ 	* params.def (selsched-max-sched-times): Increase minimum to 1.
+ 
+ 2017-03-21  Pat Haugen  <pthaugen@us.ibm.com>
+ 
+ 	Backport from mainline:
+ 	2017-03-17  Pat Haugen  <pthaugen@us.ibm.com>
+ 
+ 	PR target/79951
+ 	* config/rs6000/rs6000.md (copysign<mode>3_fcpsgn): Test
+ 	for VECTOR_UNIT_VSX_P (<MODE>mode) too.
+ 
+ 2017-03-21  Tamar Christina  <tamar.christina@arm.com>
+ 
+ 	* config/aarch64/aarch64-simd.md (*aarch64_simd_mov<mode>)
+ 	Change ins into fmov.
+ 
+ 2017-03-19  Dominique d'Humieres  <dominiq@lps.ens.fr>
+ 
+ 	PR target/71017
+ 	* config/i386/cpuid.h: Fix another undefined behavior.
+ 
+ 2017-03-17  Tom de Vries  <tom@codesourcery.com>
+ 
+ 	backport from trunk:
+ 	2017-03-17  Tom de Vries  <tom@codesourcery.com>
+ 
+ 	* gcov-dump.c (print_usage): Print bug_report_url.
+ 
+ 2017-03-15  Matthias Klose  <doko@ubuntu.com>
+ 
+ 	Backport from mainline
+ 	2017-03-14  Martin Liska  <mliska@suse.cz>
+ 
+ 	* Makefile.in: Install gcov-dump.
+ 
+ 2017-03-15  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/80019
+ 	* config/i386/i386.c (ix86_vector_duplicate_value): Create
+ 	subreg of inner mode for values already in registers.
+ 
+ 2017-03-10  Michael Meissner  <meissner@linux.vnet.ibm.com>
+ 
+ 	Back port from trunk
+ 	2017-03-01  Michael Meissner  <meissner@linux.vnet.ibm.com>
+ 
+ 	PR target/79439
+ 	* config/rs6000/predicates.md (current_file_function_operand): Do
+ 	not allow self calls to be local if the function is replaceable.
+ 
+ 2017-03-07  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-03-07  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	* config/i386/i386.c (ix86_local_alignment): Align most aggregates
+ 	of 16 bytes and more to 16 bytes, not those of 16 bits and more.
+ 
+ 2017-03-06  John David Anglin  <danglin@gcc.gnu.org>
+ 
+ 	PR target/77850
+ 	* config/pa/pa-64.h (PAD_VARARGS_DOWN): Don't pad down complex and
+ 	vector types.
+ 
+ 2017-03-02  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/79514
+ 	* config/i386/i386.md (*pushxf_rounded): New insn_and_split pattern.
+ 
+ 2017-03-01  Pat Haugen  <pthaugen@us.ibm.com>
+ 
+ 	Backport from mainline:
+ 	2017-02-27  Pat Haugen  <pthaugen@us.ibm.com>
+ 
+ 	PR target/79544
+ 	* rs6000/rs6000-c.c (struct altivec_builtin_types): Use VSRAD for
+ 	arithmetic shift of unsigned V2DI.
+ 
+ 2017-03-01  Martin Jambor  <mjambor@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-02-21  Martin Jambor  <mjambor@suse.cz>
+ 
+ 	PR lto/79579
+ 	* ipa-prop.c (ipa_prop_write_jump_functions): Bail out if no edges
+ 	have been analyzed.
+ 
+ 2017-02-28  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	PR target/79749
+ 	* config/sparc/sparc.c (sparc_frame_pointer_required): Add missing
+ 	condition on optimize for the leaf function test.
+ 
+ 2017-02-22  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-02-17  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR target/79261
+ 	* config/rs6000/rs6000.c (rs6000_expand_ternop_builtin): Add
+ 	support for CODE_FOR_vsx_xxpermdi_v2d[fi]_be.
+ 	* config/rs6000/rs6000.md (reload_gpr_from_vsx<mode>): Call
+ 	generator for vsx_xxpermdi_<mode>_be.
+ 	* config/rs6000/vsx.md (vsx_xxpermdi_<mode>): Remove logic to
+ 	force big-endian semantics.
+ 	(vsx_xxpermdi_<mode>_be): New define_expand with same
+ 	implementation as previous version of vsx_xxpermdi_<mode>.
+ 
+ 2017-02-19  Dominique d'Humieres  <dominiq@lps.ens.fr>
+ 
+ 	PR target/71017
+ 	* config/i386/cpuid.h: Fix undefined behavior.
+ 
+ 2017-02-18  Gerald Pfeifer  <gerald@pfeifer.com>
+ 
+ 	Backport from mainline
+ 	2016-12-11  Roger Pau MonnÃ©  <roger.pau@citrix.com>
+ 
+ 	* config/i386/x86-64.h: Append --32 to the assembler options when
+ 	-m16 is used on non-glibc systems as well.
+ 
+ 2017-02-17  Julia Koval  <julia.koval@intel.com>
+ 
+ 	PR target/76731
+ 	* config/i386/avx512fintrin.h
+ 	(_mm512_i32gather_ps): Change __addr type to void const*.
+ 	(_mm512_mask_i32gather_ps): Ditto.
+ 	(_mm512_i32gather_pd): Ditto.
+ 	(_mm512_mask_i32gather_pd): Ditto.
+ 	(_mm512_i64gather_ps): Ditto.
+ 	(_mm512_mask_i64gather_ps): Ditto.
+ 	(_mm512_i64gather_pd): Ditto.
+ 	(_mm512_mask_i64gather_pd): Ditto.
+ 	(_mm512_i32gather_epi32): Ditto.
+ 	(_mm512_mask_i32gather_epi32): Ditto.
+ 	(_mm512_i32gather_epi64): Ditto.
+ 	(_mm512_mask_i32gather_epi64): Ditto.
+ 	(_mm512_i64gather_epi32): Ditto.
+ 	(_mm512_mask_i64gather_epi32): Ditto.
+ 	(_mm512_i64gather_epi64): Ditto.
+ 	(_mm512_mask_i64gather_epi64): Ditto.
+ 	(_mm512_i32scatter_ps): Change __addr type to void*.
+ 	(_mm512_mask_i32scatter_ps): Ditto.
+ 	(_mm512_i32scatter_pd): Ditto.
+ 	(_mm512_mask_i32scatter_pd): Ditto.
+ 	(_mm512_i64scatter_ps): Ditto.
+ 	(_mm512_mask_i64scatter_ps): Ditto.
+ 	(_mm512_i64scatter_pd): Ditto.
+ 	(_mm512_mask_i64scatter_pd): Ditto.
+ 	(_mm512_i32scatter_epi32): Ditto.
+ 	(_mm512_mask_i32scatter_epi32): Ditto.
+ 	(_mm512_i32scatter_epi64): Ditto.
+ 	(_mm512_mask_i32scatter_epi64): Ditto.
+ 	(_mm512_i64scatter_epi32): Ditto.
+ 	(_mm512_mask_i64scatter_epi32): Ditto.
+ 	(_mm512_i64scatter_epi64): Ditto.
+ 	(_mm512_mask_i64scatter_epi64): Ditto.
+ 	* config/i386/avx512pfintrin.h
+ 	(_mm512_mask_prefetch_i32gather_pd): Change addr type to void const*.
+ 	(_mm512_mask_prefetch_i32gather_ps): Ditto.
+ 	(_mm512_mask_prefetch_i64gather_pd): Ditto.
+ 	(_mm512_mask_prefetch_i64gather_ps): Ditto.
+ 	(_mm512_prefetch_i32scatter_pd): Change addr type to void*.
+ 	(_mm512_prefetch_i32scatter_ps): Ditto.
+ 	(_mm512_mask_prefetch_i32scatter_pd): Ditto.
+ 	(_mm512_mask_prefetch_i32scatter_ps): Ditto.
+ 	(_mm512_prefetch_i64scatter_pd): Ditto.
+ 	(_mm512_prefetch_i64scatter_ps): Ditto.
+ 	(_mm512_mask_prefetch_i64scatter_pd): Ditto.
+ 	(_mm512_mask_prefetch_i64scatter_ps): Ditto.
+ 	* config/i386/avx512vlintrin.h
+ 	(_mm256_mmask_i32gather_ps): Change __addr type to void const*.
+ 	(_mm_mmask_i32gather_ps): Ditto.
+ 	(_mm256_mmask_i32gather_pd): Ditto.
+ 	(_mm_mmask_i32gather_pd): Ditto.
+ 	(_mm256_mmask_i64gather_ps): Ditto.
+ 	(_mm_mmask_i64gather_ps): Ditto.
+ 	(_mm256_mmask_i64gather_pd): Ditto.
+ 	(_mm_mmask_i64gather_pd): Ditto.
+ 	(_mm256_mmask_i32gather_epi32): Ditto.
+ 	(_mm_mmask_i32gather_epi32): Ditto.
+ 	(_mm256_mmask_i32gather_epi64): Ditto.
+ 	(_mm_mmask_i32gather_epi64): Ditto.
+ 	(_mm256_mmask_i64gather_epi32): Ditto.
+ 	(_mm_mmask_i64gather_epi32): Ditto.
+ 	(_mm256_mmask_i64gather_epi64): Ditto.
+ 	(_mm_mmask_i64gather_epi64): Ditto.
+ 	(_mm256_i32scatter_ps): Change __addr type to void*.
+ 	(_mm256_mask_i32scatter_ps): Ditto.
+ 	(_mm_i32scatter_ps): Ditto.
+ 	(_mm_mask_i32scatter_ps): Ditto.
+ 	(_mm256_i32scatter_pd): Ditto.
+ 	(_mm256_mask_i32scatter_pd): Ditto.
+ 	(_mm_i32scatter_pd): Ditto.
+ 	(_mm_mask_i32scatter_pd): Ditto.
+ 	(_mm256_i64scatter_ps): Ditto.
+ 	(_mm256_mask_i64scatter_ps): Ditto.
+ 	(_mm_i64scatter_ps): Ditto.
+ 	(_mm_mask_i64scatter_ps): Ditto.
+ 	(_mm256_i64scatter_pd): Ditto.
+ 	(_mm256_mask_i64scatter_pd): Ditto.
+ 	(_mm_i64scatter_pd): Ditto.
+ 	(_mm_mask_i64scatter_pd): Ditto.
+ 	(_mm256_i32scatter_epi32): Ditto.
+ 	(_mm256_mask_i32scatter_epi32): Ditto.
+ 	(_mm_i32scatter_epi32): Ditto.
+ 	(_mm_mask_i32scatter_epi32): Ditto.
+ 	(_mm256_i32scatter_epi64): Ditto.
+ 	(_mm256_mask_i32scatter_epi64): Ditto.
+ 	(_mm_i32scatter_epi64): Ditto.
+ 	(_mm_mask_i32scatter_epi64): Ditto.
+ 	(_mm256_i64scatter_epi32): Ditto.
+ 	(_mm256_mask_i64scatter_epi32): Ditto.
+ 	(_mm_i64scatter_epi32): Ditto.
+ 	(_mm_mask_i64scatter_epi32): Ditto.
+ 	(_mm256_i64scatter_epi64): Ditto.
+ 	(_mm256_mask_i64scatter_epi64): Ditto.
+ 	(_mm_i64scatter_epi64): Ditto.
+ 	(_mm_mask_i64scatter_epi64): Ditto.
+ 	* config/i386/i386-builtin-types.def (V16SF_V16SF_PCFLOAT_V16SI_HI_INT)
+ 	(V8DF_V8DF_PCDOUBLE_V8SI_QI_INT, V8SF_V8SF_PCFLOAT_V8DI_QI_INT)
+ 	(V8DF_V8DF_PCDOUBLE_V8DI_QI_INT, V16SI_V16SI_PCINT_V16SI_HI_INT)
+ 	(V8DI_V8DI_PCINT64_V8SI_QI_INT, V8SI_V8SI_PCINT_V8DI_QI_INT)
+ 	(V8DI_V8DI_PCINT64_V8DI_QI_INT, V2DF_V2DF_PCDOUBLE_V4SI_QI_INT)
+ 	(V4DF_V4DF_PCDOUBLE_V4SI_QI_INT, V2DF_V2DF_PCDOUBLE_V2DI_QI_INT)
+ 	(V4DF_V4DF_PCDOUBLE_V4DI_QI_INT, V4SF_V4SF_PCFLOAT_V4SI_QI_INT)
+ 	(V8SF_V8SF_PCFLOAT_V8SI_QI_INT, V4SF_V4SF_PCFLOAT_V2DI_QI_INT)
+ 	(V4SF_V4SF_PCFLOAT_V4DI_QI_INT, V2DI_V2DI_PCINT64_V4SI_QI_INT)
+ 	(V4DI_V4DI_PCINT64_V4SI_QI_INT, V2DI_V2DI_PCINT64_V2DI_QI_INT)
+ 	(V4DI_V4DI_PCINT64_V4DI_QI_INT, V4SI_V4SI_PCINT_V4SI_QI_INT)
+ 	(V8SI_V8SI_PCINT_V8SI_QI_INT, V4SI_V4SI_PCINT_V2DI_QI_INT)
+ 	(V4SI_V4SI_PCINT_V4DI_QI_INT, VOID_PFLOAT_HI_V16SI_V16SF_INT)
+ 	(VOID_PFLOAT_QI_V8SI_V8SF_INT, VOID_PFLOAT_QI_V4SI_V4SF_INT)
+ 	(VOID_PDOUBLE_QI_V8SI_V8DF_INT, VOID_PDOUBLE_QI_V4SI_V4DF_INT)
+ 	(VOID_PDOUBLE_QI_V4SI_V2DF_INT, VOID_PFLOAT_QI_V8DI_V8SF_INT)
+ 	(VOID_PFLOAT_QI_V4DI_V4SF_INT, VOID_PFLOAT_QI_V2DI_V4SF_INT)
+ 	(VOID_PDOUBLE_QI_V8DI_V8DF_INT, VOID_PDOUBLE_QI_V4DI_V4DF_INT)
+ 	(VOID_PDOUBLE_QI_V2DI_V2DF_INT, VOID_PINT_HI_V16SI_V16SI_INT)
+ 	(VOID_PINT_QI_V8SI_V8SI_INT, VOID_PINT_QI_V4SI_V4SI_INT)
+ 	(VOID_PLONGLONG_QI_V8SI_V8DI_INT, VOID_PLONGLONG_QI_V4SI_V4DI_INT)
+ 	(VOID_PLONGLONG_QI_V4SI_V2DI_INT, VOID_PINT_QI_V8DI_V8SI_INT)
+ 	(VOID_PINT_QI_V4DI_V4SI_INT, VOID_PINT_QI_V2DI_V4SI_INT)
+ 	(VOID_PLONGLONG_QI_V8DI_V8DI_INT, VOID_QI_V8SI_PCINT64_INT_INT)
+ 	(VOID_PLONGLONG_QI_V4DI_V4DI_INT, VOID_PLONGLONG_QI_V2DI_V2DI_INT)
+ 	(VOID_HI_V16SI_PCINT_INT_INT, VOID_QI_V8DI_PCINT64_INT_INT)
+ 	(VOID_QI_V8DI_PCINT_INT_INT): Remove.
+ 	(V16SF_V16SF_PCVOID_V16SI_HI_INT,  V8DF_V8DF_PCVOID_V8SI_QI_INT)
+ 	(V8SF_V8SF_PCVOID_V8DI_QI_INT, V8DF_V8DF_PCVOID_V8DI_QI_INT)
+ 	(V16SI_V16SI_PCVOID_V16SI_HI_INT, V8DI_V8DI_PCVOID_V8SI_QI_INT)
+ 	(V8SI_V8SI_PCVOID_V8DI_QI_INT, V8DI_V8DI_PCVOID_V8DI_QI_INT)
+ 	(VOID_PVOID_HI_V16SI_V16SF_INT, VOID_PVOID_QI_V8SI_V8DF_INT)
+ 	(VOID_PVOID_QI_V8DI_V8SF_INT, VOID_PVOID_QI_V8DI_V8DF_INT)
+ 	(VOID_PVOID_HI_V16SI_V16SI_INT, VOID_PVOID_QI_V8SI_V8DI_INT)
+ 	(VOID_PVOID_QI_V8DI_V8SI_INT, VOID_PVOID_QI_V8DI_V8DI_INT)
+ 	(V2DF_V2DF_PCVOID_V4SI_QI_INT, V4DF_V4DF_PCVOID_V4SI_QI_INT)
+ 	(V2DF_V2DF_PCVOID_V2DI_QI_INT, V4DF_V4DF_PCVOID_V4DI_QI_INT
+ 	(V4SF_V4SF_PCVOID_V4SI_QI_INT, V8SF_V8SF_PCVOID_V8SI_QI_INT)
+ 	(V4SF_V4SF_PCVOID_V2DI_QI_INT, V4SF_V4SF_PCVOID_V4DI_QI_INT)
+ 	(V2DI_V2DI_PCVOID_V4SI_QI_INT, V4DI_V4DI_PCVOID_V4SI_QI_INT)
+ 	(V2DI_V2DI_PCVOID_V2DI_QI_INT, V4DI_V4DI_PCVOID_V4DI_QI_INT)
+ 	(V4SI_V4SI_PCVOID_V4SI_QI_INT, V8SI_V8SI_PCVOID_V8SI_QI_INT)
+ 	(V4SI_V4SI_PCVOID_V2DI_QI_INT, V4SI_V4SI_PCVOID_V4DI_QI_INT)
+ 	(VOID_PVOID_QI_V8SI_V8SF_INT, VOID_PVOID_QI_V4SI_V4SF_INT)
+ 	(VOID_PVOID_QI_V4SI_V4DF_INT, VOID_PVOID_QI_V4SI_V2DF_INT)
+ 	(VOID_PVOID_QI_V4DI_V4SF_INT, VOID_PVOID_QI_V2DI_V4SF_INT)
+ 	(VOID_PVOID_QI_V4DI_V4DF_INT, VOID_PVOID_QI_V2DI_V2DF_INT)
+ 	(VOID_PVOID_QI_V8SI_V8SI_INT, VOID_PVOID_QI_V4SI_V4SI_INT)
+ 	(VOID_PVOID_QI_V4SI_V4DI_INT, VOID_PVOID_QI_V4SI_V2DI_INT)
+ 	(VOID_PVOID_QI_V4DI_V4SI_INT, VOID_PVOID_QI_V2DI_V4SI_INT)
+ 	(VOID_PVOID_QI_V4DI_V4DI_INT, VOID_PVOID_QI_V2DI_V2DI_INT)
+ 	(VOID_QI_V8SI_PCVOID_INT_INT, VOID_HI_V16SI_PCVOID_INT_INT)
+ 	(VOID_QI_V8DI_PCVOID_INT_INT): Add.
+ 	* config/i386/i386.c (ix86_init_mmx_sse_builtins): Adjust builtin
+ 	definitions accordingly.
+ 
+ 2017-02-16  Carl Love  <cel@us.ibm.com>
+ 
+ 	Backport from mainline commit r245460 on 2017-02-14
+ 
+ 	PR 79545
+ 	* config/rs6000/rs6000.c: Add case statement entry to make the xvcvuxdsp
+ 	built-in argument unsigned.
+ 	* config/rs6000/vsx.md: Fix the source and return operand types so they
+ 	match the instruction definitions from the ISA document.  Fix typo
+ 	in the instruction generation for the (define_insn "vsx_xvcvuxdsp"
+ 	statement.
+ 
+ 2017-02-14  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-03-01  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/70022
+ 	PR target/79498
+ 	* fold-const.c (fold_indirect_ref_1): Fix range checking for
+ 	vector BIT_FIELD_REF extract.
+ 
+ 2017-02-14  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-02-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR c/79471
+ 	* calls.c (expand_call): Replace XALLOCAVEC with XCNEWVEC.
+ 
+ 2017-02-08  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	PR translation/79397
+ 	* config/rs6000/rs6000.opt (maltivec=le, maltivec=be): Fix spelling
+ 	of AltiVec.
+ 
+ 2017-02-06  Carl Love  <cel@us.ibm.com>
+ 
+ 	Backport of two commits from mainline, r244943 and r244904,
+ 	dated 2017-01-26 and 2017-01-25 respectively
+ 
+ 	* config/rs6000/rs6000-c (altivec_overloaded_builtins): Fix order
+ 	of entries for ALTIVEC_BUILTIN_VEC_PACKS.  Remove bogus entries
+ 	for P8V_BUILTIN_VEC_VGBBD.
+ 
+ 2017-02-03  Maxim Ostapenko  <m.ostapenko@samsung.com>
+ 
+ 	PR lto/79061
+ 	* asan.c (asan_add_global): Force has_dynamic_init to zero in LTO mode.
+ 
+ 2017-01-26  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-01-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/79034
+ 	* tree-call-cdce.c (shrink_wrap_one_built_in_call_with_conds):
+ 	Propagate out degenerate PHIs in the joiner.
+ 
+ 	2016-11-07  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/78224
+ 	* tree-call-cdce.c (shrink_wrap_one_built_in_call_with_conds):
+ 	Split the fallthru edge in case its successor may have PHIs.
+ 	Do not free dominance info.
+ 
+ 2017-01-26  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-09-27  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77745
+ 	* tree-ssa-pre.c (eliminate_dom_walker::before_dom_children):
+ 	When removing redundant stores make sure to check compatibility
+ 	of the TBAA state for downstream accesses.
+ 	* tree-ssa-sccvn.c (visit_reference_op_store): Likewise for when
+ 	value-numbering virtual operands for store matches.
+ 
+ 	2016-09-29  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77768
+ 	* tree-ssa-sccvn.c (visit_reference_op_store): Properly deal
+ 	with stores to a place we know has a constant value.
+ 	* tree-vrp.c (set_defs_to_varying): New helper avoiding
+ 	writing to vr_const_varying.
+ 	(vrp_initialize): Call it.
+ 	(vrp_visit_stmt): Likewise.
+ 	(evrp_dom_walker::before_dom_children): Likewise.
+ 	* tree-ssa-pre.c (eliminate_dom_walker::before_dom_children):
+ 	Handle stores to readonly memory when removing redundant stores.
+ 
+ 2017-01-24  Wilco Dijkstra  <wdijkstr@arm.com>
+ 
+ 	Backport from mainline
+ 	PR target/78041
+ 	* config/arm/neon.md (ashldi3_neon): Add "r 0 i" and "&r r i" variants.
+ 	Remove partial overlap check for shift by 1.
+ 	(ashldi3_neon): Likewise.
+ 
+ 2017-01-24  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-09-20  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77646
+ 	* tree-ssa-sccvn.c (visit_reference_op_call): Always value-number
+ 	a VDEF.
+ 
+ 	2016-11-05  David Edelsohn  <dje.gcc@gmail.com>
+ 		Richard Biener  <rguenther@suse.de>
+ 
+ 	PR bootstrap/78188
+ 	PR c++/71848
+ 	* ipa-comdats.c (pass_ipa_comdats::gate): Require HAVE_COMDAT_GROUP.
+ 
+ 	2016-09-21  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77648
+ 	* tree-ssa-structalias.c (process_constraint): Handle all DEREF
+ 	with complex RHS.
+ 	(make_transitive_closure_constraints): Adjust comment.
+ 	(make_any_offset_constraints): New function.
+ 	(handle_rhs_call): Make sure to first expand a pointer to all
+ 	subfields before transitively closing it.
+ 	(handle_const_call): Likewise.  Properly expand returned
+ 	pointers as well.
+ 	(handle_pure_call): Likewise.
+ 
+ 	2016-10-07  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77879
+ 	* tree-ssa-structalias.c (handle_const_call): Properly handle
+ 	NRV return slots.
+ 	(handle_pure_call): Likewise.
+ 
+ 2017-01-24  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-10-06  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77855
+ 	* tree-ssa-pre.c (prune_clobbered_mems): Queue exprs to remove
+ 	instead of removing the current item while iterating over the set
+ 	which is not safe.
+ 
+ 	2016-09-01  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/77436
+ 	* tree-chrec.c (tree_fold_binomial): Use widest_int, properly
+ 	check whether the result fits the desired result type.
+ 
+ 	2016-09-19  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/77605
+ 	* tree-data-ref.c (analyze_subscript_affine_affine): Use the
+ 	proper niter to bound the loops.
+ 
+ 	2016-11-02  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/78047
+ 	* tree-ssa-structalias.c (push_fields_onto_fieldstack): Initialize
+ 	fake field at offset zero conservatively regarding to may_have_pointers.
+ 
+ 	2016-11-02  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/78185
+ 	* loop-invariant.c (find_invariant_insn): Never hoist trapping or
+ 	faulting instructions.
+ 	* tree-ssa-loop-im.c: Include tree-ssa-loop-niter.h.
+ 	(fill_always_executed_in_1): Honor infinite child loops.
+ 
+ 	2016-11-16  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/78333
+ 	* gimplify.c (gimplify_function_tree): Do not instrument
+ 	GNU extern inline functions.
+ 
+ 2017-01-23  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR lto/69188
+ 	* tree-profile.c (init_ic_make_global_vars): Do not call
+ 	finalize_decl.
+ 	(gimple_init_gcov_profiler): Likewise.
+ 
+ 2017-01-21  Gerald Pfeifer  <gerald@pfeifer.com>
+ 
+ 	Backport from mainline
+ 	2016-12-29  Gerald Pfeifer  <gerald@pfeifer.com>
+ 
+ 	* doc/extend.texi (Cilk Plus Builtins): cilkplus.org now uses
+ 	https by default.
+ 	* doc/passes.texi (Cilk Plus Transformation): Ditto.
+ 	* doc/generic.texi (Statements for C++): Ditto, and use @uref.
+ 
+ 2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-01-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/79043
+ 	* function.c (set_cfun): Add new argument force.
+ 	* function.h (set_cfun): Likewise.
+ 	* ipa-inline-transform.c (inline_call): Use the function when
+ 	strict alising from is dropped for function we inline to.
+ 
+ 2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-03-26  Richard Biener  <rguenther@suse.de>
+ 	            Prathamesh Kulkarni  <prathamesh.kulkarni@linaro.org>
+ 
+ 	PR ipa/70366
+ 	* ipa-inline-transform.c (inline_call): Pass opts_for_fn (to->decl)
+ 	instead of
+ 	TREE_OPTIMIZATION (DECL_FUNCTION_SPECIFIC_OPTIMIZATION (to->decl))
+ 	as 2nd argument to cl_optimization_restore().
+ 
+ 2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2015-12-01  Jan Hubicka  <hubicka@ucw.cz>
+ 
+ 	* c-common.c (parse_optimize_options): Do not silently ignore
+ 	-fstrict-aliasing changes.
+ 
+ 2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-01-01  Jan Hubicka  <hubicka@ucw.cz>
+ 
+ 	* ipa-inline-transform.c (inline_call): Drop
+ 	-fstrict-aliasing when 	inlining -fno-strict-aliasing into
+ 	-fstrict-aliasing body.
+ 
+ 2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-01-17  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/71207
+ 	* ipa-polymorphic-call.c (contains_type_p): Fix wrong
+ 	assumption and add comment.
+ 
+ 2017-01-17 Thomas Preud'homme <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-07 Thomas Preud'homme <thomas.preudhomme@arm.com>
+ 
+ 	PR rtl-optimization/78617
+ 	* lra-remat.c (do_remat): Initialize live_hard_regs from live in
+ 	registers, also setting hard registers mapped to pseudo registers.
+ 
+ 2017-01-11  Christophe Lyon  <christophe.lyon@linaro.org>
+ 
+ 	Backport from mainline r244320.
+ 	2017-01-11  Christophe Lyon  <christophe.lyon@linaro.org>
+ 
+ 	PR target/78253
+ 	* config/arm/arm.c (legitimize_pic_address): Handle reference to
+ 	weak symbol.
+ 	(arm_assemble_integer): Likewise.
+ 
+ 2016-01-12  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	* postreload.c (reload_cse_simplify): Check for NO_FUNCTION_CSE
+ 	definition instead of using it directly.
+ 
+ 2017-01-12  Maxim Ostapenko  <m.ostapenko@samsung.com>
+ 
+ 	Backport from mainline
+ 	2017-01-12  Maxim Ostapenko  <m.ostapenko@samsung.com>
+ 
+ 	PR lto/79042
+ 	* lto-cgraph.c (lto_output_varpool_node): Pack dynamically_initialized
+ 	bit.
+ 	(input_varpool_node): Unpack dynamically_initialized bit.
+ 	* lto-streamer.h (LTO_minor_version): Bump version.
+ 
+ 2017-01-11  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* config/i386/i386.c (memory_address_length): Increase len
+ 	only when rip_relative_addr_p returns false.
+ 
+ 2017-01-11  Andre Vieira <andre.simoesdiasvieira@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-09  Andre Vieira <andre.simoesdiasvieira@arm.com>
+ 
+ 	PR rtl-optimization/78255
+ 	* gcc/postreload.c (reload_cse_simplify): Do not CSE a function if
+ 	NO_FUNCTION_CSE is true.
+ 
+ 2017-01-10  Bill Seurer  <seurer@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-21  Bill Seurer  <seurer@linux.vnet.ibm.com>
+ 
+ 	PR sanitizer/65479
+ 	* config/rs6000/rs6000.c (rs6000_option_override_internal): Add
+ 	-fasynchronous-unwind-tables option when -fsanitize=address is
+ 	specified.
+ 
+ 2017-01-10  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-01-09  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR pch/78970
+ 	* gcc.c (driver_handle_option): Handle OPT_E and set
+ 	have_E.
+ 	(lookup_compiler): Do not show error message with have_E.
+ 
+ 2017-01-10  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-01-05  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR pch/78970
+ 	* gcc.c (lookup_compiler): Reject '-' filename for a precompiled
+ 	header.
+ 
+ 2017-01-10  Chung-Ju Wu  <jasonwucj@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-04-28  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	PR target/70668
+ 	* config/nds32/nds32.md (casesi): Don't access the operands array
+ 	out of bounds.
+ 
+ 2017-01-09  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backport from mainline
+ 	2016-10-10  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	* config.gcc: Add aarch64-*-freebsd* support.
+ 	* config.host: Likewise.
+ 	* config/aarch64/aarch64-freebsd.h: New file.
+ 	* config/aarch64/t-aarch64-freebsd: Ditto.
+ 
+ 2017-01-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-12-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/78886
+ 	* tree-ssa-strlen.c (handle_builtin_malloc): Return when LHS
+ 	is equal to NULL.
+ 
+ 2017-01-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-12-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/78428
+ 	* expr.c (store_constructor_field): Add new arguments to the
+ 	function.
+ 	(store_constructor): Set up bitregion_end and add
+ 	gcc_unreachable to fields that have either non-constant size
+ 	or (and) offset.
+ 
+ 2016-12-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR translation/78922
+ 	* config/i386/stringop.opt: Remove.
+ 
+ 2016-12-14  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/78731
+ 	* tree-ssa-threadedge.c (simplify_control_stmt_condition):
+ 	If we've seen a backedge to not walk the SSA value chain.
+ 	(thread_around_empty_blocks): Pass down whether we've seen
+ 	a backedge to simplify_control_stmt_condition.
+ 	(thread_through_normal_block): Likewise.
+ 
+ 2016-12-14  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-11-25  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	* tree-ssa-math-opts.c (struct symbolic_number): Improve comment.
+ 
+ 2016-12-14  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-11-25  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	PR tree-optimization/77673
+ 	* tree-ssa-math-opts.c (struct symbolic_number): Add new src field.
+ 	(init_symbolic_number): Initialize src field from src parameter.
+ 	(perform_symbolic_merge): Select most dominated statement as the
+ 	source statement.  Set src field of resulting n structure from the
+ 	input src with the lowest address.
+ 	(find_bswap_or_nop): Rename source_stmt into ins_stmt.
+ 	(bswap_replace): Rename src_stmt into ins_stmt.  Initially get source
+ 	of load from src field rather than insertion statement.  Cancel
+ 	optimization if statement analyzed is not dominated by the insertion
+ 	statement.
+ 	(pass_optimize_bswap::execute): Rename src_stmt to ins_stmt.  Compute
+ 	dominance information.
+ 
+ 2016-12-13  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-11-17  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	PR target/77933
+ 	* config/arm/arm.c (thumb1_expand_prologue): Distinguish between lr
+ 	being live in the function and lr needing to be saved.  Distinguish
+ 	between already saved pushable registers and registers to push.
+ 	Check for LR being an available pushable register.
+ 
+ 2016-12-12  Bernd Schmidt  <bschmidt@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-11-07  Bernd Schmidt  <bschmidt@redhat.com>
+ 
+ 	PR rtl-optimization/77309
+ 	* combine.c (make_compound_operation): Allow EQ for IN_CODE, and
+ 	don't assume an equality comparison for plain COMPARE.
+ 	(simplify_comparison): Pass a more accurate code to
+ 	make_compound_operation.
+ 
+ 2016-12-07  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	Backport from mainline
+ 	2016-11-12  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	PR target/77957
+ 	* config/rs6000/rs6000.c (rs6000_output_function_epilogue): Don't
+ 	return early if !optional_tbtab.
+ 
+ 2016-12-07  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-11-16  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	* config/arm/arm.md (arm_addsi3): Add alternative for addition of
+ 	general register with general register or ARM constant into SP
+ 	register.
+ 
+ 2016-12-06  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-05  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 	            Stefan Freudenberger  <stefan@reservoir.com>
+ 
+ 	PR tree-optimization/78646
+ 	* gimple-ssa-strength-reduction.c (replace_ref): The pointer
+ 	addition used for the memory base expression should have the type
+ 	of the candidate.
+ 
+ 2016-12-02  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-10-21  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	PR rtl-optimization/78038
+ 	* ree.c (get_defs): Return NULL if a defining insn for REG cannot
+ 	be deduced to set REG through the RTL structure.
+ 	(make_defs_and_copies_lists): Return false on a failing get_defs call.
+ 
+ 2016-12-02  Andreas Krebbel  <krebbel@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-02  Andreas Krebbel  <krebbel@linux.vnet.ibm.com>
+ 
+ 	* config/s390/s390-modes.def (CCVEQANY, CCVH, CCVHANY, CCVHU)
+ 	(CCVHUANY): Remove modes.
+ 	(CCVIH, CCVIHU, CCVIALL, CCVIANY, CCVFALL, CCVFANY): Add modes and
+ 	documentation.
+ 	* config/s390/s390.c (s390_match_ccmode_set): Rename cc modes.
+ 	(s390_expand_vec_compare_scalar): Pick one of the cc consumer
+ 	modes.
+ 	(s390_branch_condition_mask): Adjust to use the new cc consumer
+ 	modes.  The new modes allow for proper reversal in the middle-end.
+ 	(s390_expand_vec_compare_cc): Determine the proper cc producer and
+ 	consumer modes for a comparison.
+ 	* config/s390/s390.md: Rename CCVH to CCVIH and CCVHU to CCVIHU
+ 	throughout the file.
+ 	* config/s390/vx-builtins.md: Likewise.
+ 
+ 2016-12-01  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-01  Alan Modra  <amodra@gmail.com>
+ 
+ 	* gcc/config/rs6000/rs6000.c (insn_is_swappable_p): Properly
+ 	look inside UNSPEC_VSX_XXSPLTW vec.
+ 
+ 2016-11-29  Kaz Kojima  <kkojima@gcc.gnu.org>
+ 
+ 	Backported from mainline
+ 	2016-11-19  Kaz Kojima  <kkojima@gcc.gnu.org>
+ 
+ 	PR target/78426
+ 	* config/sh/sh-mem.cc (sh_expand_cmpnstr): Use copy_to_mode_reg
+ 	instead of force_reg.
+ 	(sh_expand_setmem): Likewise.
+ 
+ 2016-11-24  Martin Liska  <mliska@suse.cz>
+ 	Backported from mainline
+ 	2016-11-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/78309
+ 	* ipa-icf.c (void sem_item::set_hash): Update m_hash_set.
+ 	(sem_function::get_hash): Use the new field.
+ 	(sem_function::parse): Remove an argument from ctor.
+ 	(sem_variable::parse): Likewise.
+ 	(sem_variable::get_hash): Use the new field.
+ 	(sem_item_optimizer::read_section): Use new ctor and set hash.
+ 	* ipa-icf.h: _hash is removed from sem_item::sem_item,
+ 	sem_variable::sem_variable, sem_function::sem_function.
+ 
+ 2016-11-23  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* config/i386/i386.md (*<any_or:code>hi_1): Fix operand 2 constraints.
+ 	(kxnor<mode>): Return "#" for alternative 0.
+ 
+ 2016-11-22  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* Makefile.in ($(lang_checks_parallelized)): Fix detection
+ 	of -j argument.
+ 
+ 2016-11-15  Matthias Klose  <doko@ubuntu.com>
+ 
+ 	* doc/install.texi: Move the 'Overriding configure test results'
+ 	subsub section to the 'Cross-Compiler-Specific Options' sub section.
+ 
+ 2016-11-11  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/78310
+ 	* config/i386/i386.md (rotate to rotatex splitter): Avoid overflow
+ 	when calculating operand 2.
+ 	(rotate to rotatex zext splitter): Ditto.
+ 
+ 2016-11-09  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/78262
+ 	* config/i386/i386.md (*<shift_insn><mode>3_doubleword): Mark
+ 	operand 0 as earlyclobber.
+ 	(*ashl<mode>3_doubleword): Ditto for all operand 0 alternatives.
+ 
+ 2016-11-06  Jack Howarth  <howarth.at.gcc@gmail.com>
+ 
+ 	PR driver/78206
+ 	* incpath.c: (remove_dup(): Also silently ignore EPERM.
+ 
+ 2016-11-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-08-12  Martin Liska  <mliska@suse.cz>
+ 		    Adam Fineman  <afineman@afineman.com>
+ 
+ 	* gcov.c (process_file): Create .gcov file when .gcda
+ 	file is missing.
+ 
+ 2016-11-03  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	Backport from mainline
+ 	2016-10-17  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* explow.c (validize_mem): Do not modify the argument in-place.
+ 
+ 2016-11-02  Will Schmidt  <will_schmidt@vnet.ibm.com>
+ 
+ 	Backport from trunk
+ 	2016-10-26  Will Schmidt <will_schmidt@vnet.ibm.com>
+ 
+ 	PR middle-end/72747
+ 	* gimplify.c (gimplify_init_constructor): Move emit of constructor
+ 	assignment to earlier in the if/else logic.
+ 
+ 2016-10-29  John David Anglin  <danglin@gcc.gnu.org>
+ 
+ 	* config/pa/pa.h (BIGGEST_ALIGNMENT): Adjust comment.
+ 	(MALLOC_ABI_ALIGNMENT): Define.
+ 
+ 2016-10-23  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-10-17  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/77916
+ 	* gimple-ssa-strength-reduction.c (create_add_on_incoming_edge):
+ 	Don't allow a MINUS_EXPR for pointer arithmetic for either known
+ 	or unknown strides.
+ 	(record_increment): Increments of -1 for unknown strides just use
+ 	a multiply initializer like other negative values.
+ 	(analyze_increments): Remove stopgap solution for -1 increment
+ 	applied to pointer arithmetic.
+ 	(insert_initializers): Requirement of initializer for -1 should be
+ 	based on pointer-typedness of the candidate basis.
+ 
+ 2016-10-19  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/77991
+ 	* config/i386/i386.c (legitimize_tls_address)
+ 	<case TLS_MODEL_INITIAL_EXEC>: For TARGET_64BIT || TARGET_ANY_GNU_TLS
+ 	convert dest to Pmode if different than Pmode.
+ 
+ 2016-10-18  Kugan Vivekanandarajah  <kuganv@linaro.org>
+ 
+ 	Backport from mainline
+ 	2016-10-11  Kugan Vivekanandarajah  <kuganv@linaro.org>
+ 
+ 	* tree-vrp.c (vrp_intersect_ranges_1): Allocate bitmap before
+ 	  copying.
+ 
+ 2016-10-17  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-10-12  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/77937
+ 	* gimple-ssa-strength-reduction.c (analyze_increments): Use
+ 	POINTER_TYPE_P on the candidate type to determine whether
+ 	candidates in this chain require pointer arithmetic.
+ 
+ 	2016-10-13  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/77937
+ 	* gimple-ssa-strength-reduction.c (analyze_increments): Set cost
+ 	to infinite when we have a pointer with an increment of -1.
+ 
+ 2016-10-17  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backported from mainline
+ 	2016-10-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/77943
+ 	* tree-ssa-tail-merge.c (merge_stmts_p): Do not merge BBs with
+ 	a different EH landing pads.
+ 
+ 2016-10-16  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* config/sparc/sparc.c (sparc_expand_vector_init): Only accept literal
+ 	constants in CONST_VECTORs.
+ 
+ 2016-10-15  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* config/sparc/sparc.c (sparc_expand_vec_perm_bmask): Use a scratch
+ 	register as destination of bmask.
+ 	(vector_init_bshuffle): Likewise.
+ 	* config/sparc/sparc.md (vec_perm_constv8qi): Likewise.
+ 	(bmaskdi_vis): Enable only in 64-bit mode.
+ 
+ 2016-10-13  Andrew Senkevich  <andrew.senkevich@intel.com>
+ 
+ 	Backport from trunk
+ 	* common/config/i386/i386-common.c (OPTION_MASK_ISA_PCOMMIT_UNSET,
+ 	OPTION_MASK_ISA_PCOMMIT_SET): Deleted definitions.
+ 	(ix86_handle_option): Deleted handle of OPT_mpcommit.
+ 	* config.gcc: Deleted pcommitintrin.h
+ 	* config/i386/pcommitintrin.h: Deleted file.
+ 	* config/i386/cpuid.h (bit_PCOMMIT): Deleted.
+ 	* config/i386/driver-i386.c (host_detect_local_cpu): Deleted pcommit
+ 	detection.
+ 	* config/i386/i386-c.c (ix86_target_macros_internal): Deleted define
+ 	__PCOMMIT__.
+ 	* config/i386/i386.c (ix86_target_string): Deleted -mpcommit.
+ 	(PTA_PCOMMIT, IX86_BUILTIN_PCOMMIT, __builtin_ia32_pcommit): Deleted.
+ 	(ix86_option_override_internal): Deleted handle of option.
+ 	(ix86_valid_target_attribute_inner_p): Deleted pcommit.
+ 	* config/i386/i386.h (TARGET_PCOMMIT, TARGET_PCOMMIT_P): Deleted.
+ 	* config/i386/i386.md (unspecv): Deleted UNSPECV_PCOMMIT.
+ 	(pcommit): Deleted instruction.
+ 	* config/i386/i386.opt: Mention -mpcommit deprecation.
+ 	* config/i386/x86intrin.h: Deleted inclusion of pcommitintrin.h.
+ 
+ 2016-10-10  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	* config/avr/gen-avr-mmcu-texi.c (string.h): Include.
+ 
+ 2016-10-06  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/77874
+ 	* config/i386/sse.md (<mask_codefor><code><mode>3<mask_name>):
+ 	Remove wrong assert.
+ 	(<floatsuffix>float<sseintvecmodelower><mode>2<mask_name><round_name>:
+ 	Use <round_constraint> as operand 1 constraint.
+ 
+ 2016-09-28  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 	    Alan Modra  <amodra@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-07-01  Alan Modra  <amodra@gmail.com>
+ 
+ 	PR rtl-optimization/71709
+ 	* ira-lives.c (find_call_crossed_cheap_reg): Exit loop on arg reg
+ 	being set, not referenced.
+ 
+ 2016-09-27  David Edelsohn  <dje.gcc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-09-27  David Edelsohn  <dje.gcc@gmail.com>
+ 
+ 	* config/rs6000/rs6000.c (rs6000_output_symbol): Don't modify
+ 	VAR_DECL string.
+ 
+ 2016-09-27  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77478
+ 	* tree-vect-loop-manip.c (vect_gen_niters_for_prolog_loop):
+ 	Fix alignment of SSA var used before the alignment prologue.
+ 
+ 2016-09-27  Senthil Kumar Selvaraj  <senthil_kumar.selvaraj@atmel.com>
+ 
+ 	Backport from trunk r227496
+ 
+ 	PR target/65210
+ 	* config/avr/avr.c (avr_eval_addr_attrib): Look for io_low
+ 	attribute as well.
+ 
+ 2016-09-22  Senthil Kumar Selvaraj  <senthil_kumar.selvaraj@atmel.com>
+ 
+ 	Backport from 2016-09-22 trunk r240388.
+ 
+ 	* config/avr/avr.c (avr_rtx_costs_1): Handle DImode MULT.
+ 	(avr_address_cost): Replace 61 with MAX_LD_OFFSET(mode).
+ 
+ 2016-09-21  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	* doc/rtl.texi (JUMP_LABEL): Document RETURN and SIMPLE_RETURN values.
+ 
+ 2016-09-21  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2016-09-21 trunk r240306.
+ 
+ 	PR target/77326
+ 	* config/avr/avr.c (hard-reg-set.h): Move #include up in front
+ 	of rtl.h to that HARD_CONST is defined in rtl.h.
+ 	(avr_notice_update_cc) [CC_NONE]: If insn touches some regs
+ 	mentioned in cc_status, do CC_STATUS_INIT.
+ 
+ 2016-09-16  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* doc/extend.texi (Integer Overflow Builtins): Fix type of out
+ 	parameters for functions taking long long arguments.
+ 
+ 2016-08-31  Jakub Sejdak  <jakub.sejdak@phoesys.com>
+ 
+ 	* config.gcc: Add support for arm*-*-phoenix* targets.
+ 	* config/arm/t-phoenix: New.
+ 	* config/phoenix.h: New.
+ 
+ 2016-08-29  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/77403
+ 	* config/i386/sse.md (vec_set_lo_<mode><mask_name>): Fix assembler
+ 	template for intel asm dialect.
+ 	(vec_set_hi_<mode><mask_name>): Ditto.
+ 
+ 2016-08-29  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* Makefile.in (gcov-iov.h): Add dummy recipe.
+ 
+ 2016-08-26  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-04-20  Andrew Pinski  <apinski@cavium.com>
+ 	            Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	PR target/64971
+ 	* config/aarch64/aarch64.md (sibcall): Force call
+ 	address to be DImode for ILP32.
+ 	(sibcall_value): Likewise.
+ 
+ 2016-08-25  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline (minus test for POWER9 support)
+ 	2016-08-11  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR target/72863
+ 	* vsx.md (vsx_load_<mode>): For P8LE, emit swaps at expand time.
+ 	(vsx_store_<mode>): Likewise.
+ 
+ 2016-08-25  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-07-12  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	PR middle-end/71700
+ 	* expr.c (store_constructor): Mask sign-extended bits when widening
+ 	sub-word constructor element at the start of a word.
+ 
+ 2016-08-22  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-08-14  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/76342
+ 	* config/i386/avx512fintrin.h (_mm512_undefined_epi32):
+ 	Renamed from _mm512_undefined_si512.
+ 	(_mm_undefined_si512): New definition.
+ 
+ 	Backport from mainline:
+ 	2016-08-09  David Wohlferd  <dw@LimeGreenSocks.com>
+ 
+ 	* config/i3836/avx512fintrin.h (_mm512_cvtsepi64_epi32): Remove
+ 	unused variable __O.
+ 
+ 	Backport from mainline:
+ 	2016-08-09  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/72843
+ 	* config/i386/i386.md (*movtf_internal): Use
+ 	lra_in_progress || reload_completed instead of !can_create_pseudo_p
+ 	in the insn constraint.
+ 	(*movxf_internal): Ditto.
+ 	(*movdf_internal): Ditto.
+ 	(*movsf_internal): Ditto.
+ 
+ 2016-08-18  Oleg Endo  <olegendo@gcc.gnu.org>
+ 
+ 	Backport from mainline
+ 	2016-06-17  DJ Delorie  <dj@redhat.com>
+ 
+ 	PR target/71338
+ 	* config/rl78/rl78-expand.c (umulqihi3): Enable for G10.
+ 	* config/rl78/rl78-virtual.c (umulhi3_shift_virt): Likewise.
+ 	(umulqihi3_virt): Likewise.
+ 	* config/rl78/rl78-real.c (umulhi3_shift_real): Likewise.
+ 	(umulqihi3_real): Likewise.
+ 
+ 2016-08-16  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* doc/install.texi (*-*-solaris2*): Adjust latest change.
+ 
+ 2016-08-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backported from mainline
+ 	2016-08-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR driver/72765
+ 	* gcc.c (do_spec_1): Call save_string with the right size.
+ 	(save_string): Do an assert about string we copy.
+ 
+ 2016-08-15  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* doc/install.texi (*-*-solaris2*): Fix version number and document
+ 	requirement on GNU make for building libjava with the Solaris linker.
+ 
+ 2016-08-12  Bernd Edlinger  <bernd.edlinger@hotmail.de>
+ 
+ 	Backport from mainline
+ 	2016-08-11  Bernd Edlinger  <bernd.edlinger@hotmail.de>
+ 
+ 	PR tree-optimization/71083
+ 	* tree-predcom.c (ref_at_iteration): Correctly align the
+ 	reference type.
+ 
+ 2016-08-08  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2016-07-29 trunk r238863.
+ 
+ 	PR rtl-optimization/71976
+ 	* combine.c (get_last_value): Return 0 if the argument for which
+ 	the function is called has a wider mode than the recorded value.
+ 
+ 2016-08-04  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/72805
+ 	* config/i386/avx512fintrin.h (_mm512_cmp_epi32_mask) [!__OPTIMIZE__]:
+ 	Cast builtin function result to __mmask16 instead of __mmask8.
+ 	(_mm512_cmp_epu32_mask) [!__OPTIMIZE__]: Ditto.
+ 	(_mm512_mask_cmp_epi32_mask) [!__OPTIMIZE__]: Ditto.
+ 	(_mm512_mask_cmp_epu32_mask) [!__OPTIMIZE__]: Ditto.
+ 
+ 2016-08-01  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2016-08-01 trunk r238948.
+ 
+ 	PR target/72767
+ 	* config/avr/avr.md (length) [branch]: Correct insn length
+ 	attribute for forward branches.
+ 
+ 2016-07-29  Marek Polacek  <polacek@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-07-29  Marek Polacek  <polacek@redhat.com>
+ 
+ 	PR c/7652
+ 	* config/rs6000/rs6000.c (altivec_expand_ld_builtin): Add break.
+ 	(altivec_expand_st_builtin): Likewise.
+ 	* config/i386/i386.c (ix86_expand_args_builtin): Likewise.
+ 	(ix86_expand_round_builtin): Likewise.
+ 
+ 2016-07-27  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	PR target/71216
+ 	* config/rs6000/rs6000.c (rs6000_file_start): Fix condition for
+ 	when to emit a ".machine" pseudo-op.
+ 
+ 2016-07-26  Alan Modra  <amodra@gmail.com>
+ 
+ 	PR target/72103
+ 	* config/rs6000/rs6000.c (rs6000_secondary_reload): Initialize
+ 	sri->t_icode.
+ 
+ 2016-07-20  Martin Jambor  <mjambor@suse.cz>
+ 
+ 	PR fortran/71688
+ 	* trans-decl.c (gfc_generate_function_code): Use get_create rather
+ 	than create to get a call graph node.
+ 
+ 2016-07-19  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71874
+ 	* gimple-fold.c (fold_builtin_memory_op): Use
+ 	get_addr_base_and_unit_offset instead of get_ref_base_and_extent.
+ 
+ 2016-07-19  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backported from mainline
+ 	2016-03-15  Richard Henderson  <rth@redhat.com>
+ 
+ 	* line-map.c (new_linemap): Make alloc_size a size_t.
+ 
+ 2016-07-19  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-07-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71758
+ 	* omp-low.c (expand_omp_target): Gimplify device.
+ 
+ 2016-07-18  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backported from mainline
+ 	2016-07-12  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR rtl-optimization/71634
+ 	* ira-build.c (mark_loops_for_removal): Properly iterate
+ 	loops.
+ 
+ 2016-07-12  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	Backport from mainline
+ 	2016-07-06  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	PR target/70098
+ 	PR target/71763
+ 	* config/rs6000/rs6000.md (*ctr<mode>_internal1, *ctr<mode>_internal2,
+ 	*ctr<mode>_internal5, *ctr<mode>_internal6): Add *wi to the output
+ 	constraint.
+ 
+ 2016-07-08  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backported from mainline
+ 	2016-07-08  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR middle-end/71606
+ 	* fold-const.c (fold_convertible_p): As COMPLEX_TYPE
+ 	folding produces SAVE_EXPRs, thus return false for the type.
+ 
+ 2016-07-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-06-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71626
+ 	* config/i386/i386.c (ix86_expand_vector_move): For SUBREG of
+ 	a constant, force its SUBREG_REG into memory or register instead
+ 	of whole op1.
+ 
+ 	2016-06-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/71588
+ 	* tree-ssa-strlen.c (valid_builtin_call): New function.
+ 	(adjust_last_stmt, handle_builtin_memset, strlen_optimize_stmt): Use
+ 	it.
+ 
+ 	2016-06-20  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71581
+ 	* tree-ssa-uninit.c (warn_uninit): If EXPR and VAR are NULL,
+ 	see if T isn't anonymous SSA_NAME with COMPLEX_EXPR created
+ 	for conversion of scalar user var to complex type and use the
+ 	underlying SSA_NAME_VAR in that case.  If EXPR is still NULL,
+ 	punt.
+ 
+ 	2016-06-10  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71494
+ 	* tree-nested.c (convert_nonlocal_reference_stmt): For GIMPLE_GOTO
+ 	without LABEL_DECL, set *handled_ops_p to false instead of true.
+ 
+ 	2016-04-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/70641
+ 	* ipa-pure-const.c (pass_nothrow::execute): Call maybe_clean_eh_stmt
+ 	on all recursive call stmts.  Return TODO_cleanup_cfg if any dead
+ 	eh edges have been purged.
+ 
+ 	PR middle-end/70633
+ 	* gimplify.c (gimplify_init_constructor): Clear TREE_STATIC if
+ 	gimplification turns some element into non-constant.
+ 
+ 	2016-04-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR debug/70628
+ 	* explow.c (convert_memory_address_addr_space_1): Formatting fix.
+ 
+ 	PR debug/70628
+ 	* rtl.h (convert_memory_address_addr_space_1): New prototype.
+ 	* explow.c (convert_memory_address_addr_space_1): No longer static,
+ 	add NO_EMIT argument and don't call convert_modes if true, pass
+ 	it down recursively, remove break after return.
+ 	(convert_memory_address_addr_space): Adjust caller.
+ 	* simplify-rtx.c (simplify_unary_operation_1): Call
+ 	convert_memory_address_addr_space_1 instead of convert_memory_address,
+ 	if it returns NULL, don't simplify.
+ 
+ 	2016-04-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/70574
+ 	* fwprop.c (forward_propagate_and_simplify): Don't add
+ 	REG_EQUAL note if DF_REF_REG (use) is a paradoxical subreg.
+ 	(try_fwprop_subst): Don't add REG_EQUAL note if there are any
+ 	paradoxical subregs within *loc.
+ 
+ 	2016-04-05  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/70336
+ 	* match.pd (nested int casts): Limit to GIMPLE.
+ 
+ 2016-07-07  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-06-07  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/71423
+ 	* match.pd ((X | ~Y) -> Y <= X): Properly invert the comparison
+ 	for signed ops.
+ 
+ 	2016-06-08  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/71452
+ 	* tree-ssa.c (non_rewritable_lvalue_p): Make sure that the
+ 	type used for the SSA rewrite has enough precision to cover
+ 	the dynamic type of the location.
+ 
+ 	2016-06-14  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/71522
+ 	* tree-ssa.c (non_rewritable_lvalue_p): Do not rewrite non-float
+ 	copying into float copying.
+ 
+ 2016-07-01  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* config/arm/arm.c (arm_function_ok_for_sibcall): Add another check
+ 	for NULL decl.
+ 
+ 2016-06-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71693
+ 	* fold-const.c (fold_binary_loc) <case RROTATE_EXPR>: Cast
+ 	TREE_OPERAND (arg0, 0) and TREE_OPERAND (arg0, 1) to type
+ 	first when permuting bitwise operation with rotate.  Cast
+ 	TREE_OPERAND (arg0, 0) to type when cancelling two rotations.
+ 
+ 2016-06-21  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2016-06-21 trunk r237639.
+ 
+ 	PR target/30417
+ 	* config/avr/gen-avr-mmcu-specs.c (print_mcu):
+ 	[*link_data_start]: Wrap -Tdata into %{!Tdata:...}.
+ 	[*link_text_start]: Wrap -Ttext into %{!Ttext:...}.
+ 
+ 2016-06-21  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	PR target/71103
+ 	* config/avr/avr.md (movqi): Only handle loading subreg:qi of
+ 	constant addresses if can_create_pseudo_p.
+ 
+ 2016-06-20  Georg-Johann Lay  <avr@gjlay.de>
+ 	    Pitchumani Sivanupandi  <pitchumani.s@atmel.com>
+ 
+ 	Backport from 2016-06-20 trunk r237589, r236558.
+ 
+ 	PR target/71103
+ 	* config/avr/avr.md (movqi): Handle loading subreg:qi (const,
+ 	symbol_ref,label_ref).
+ 
+ 2016-06-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/71554
+ 	* config/i386/i386.md (setcc + movzbl peephole2): Use reg_set_p.
+ 	(setcc + and peephole2): Likewise.
+ 
+ 	Backported from mainline
+ 	2015-04-29  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* config/i386/i386.md (setcc+movzbl peephole2): Check also clobbered
+ 	reg.
+ 	(setcc+andl peephole2): Ditto.
+ 
+ 2016-06-15  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backported from mainline
+ 	2016-06-14  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	* config/arm/freebsd.h: Only enable unaligned access for armv6 on
+ 	FreeBSD 11 and above.
+ 
+ 2016-06-13  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/71505
+ 	* tree-vect-data-refs.c (vect_analyze_data_ref_accesses): Make
+ 	assert match comment.
+ 
+ 2016-06-13  Andreas Krebbel  <krebbel@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-06-13  Andreas Krebbel  <krebbel@linux.vnet.ibm.com>
+ 
+ 	PR target/71379
+ 	* config/s390/s390.c (s390_expand_builtin): Increase MAX_ARGS by
+ 	one.
+ 
+ 2016-06-07  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-06-07  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	* doc/invoke.texi (RS/6000 and PowerPC Options): Document -mhtm and
+ 	-mno-htm.
+ 
+ 2016-06-07  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/71389
+ 	* config/i386/i386.c (ix86_avx256_split_vector_move_misalign):
+ 	Copy op1 RTX to avoid invalid sharing.
+ 	(ix86_expand_vector_move_misalign): Ditto.
+ 
+ 2016-06-05  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-06-01  Uros Bizjak  <ubizjak@gmail.com>
+ 		    Jocelyn Mayer  <l_indien@magic.fr>
+ 
+ 	PR target/67310
+ 	* config/i386/driver-i386.c (host_detect_local_cpu): Correctly
+ 	detect processor family for signature_CENTAUR_ebx.
+ 	<case PROCESSOR_I486>: Pass c3, winchip2 or winchip-c6 for
+ 	signature_CENTAUR_ebx.
+ 	<case PROCESSOR _PENTIUMPRO>: Pass c3-2 for signature_CENTAUR_ebx.
+ 	<default>: Pass x86-64 for has_longmode.
+ 
+ 2016-06-03  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backport from mainline
+ 	2016-05-30  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	* config.gcc: Move hard float support for arm*hf*-*-freebsd* into
+ 	armv6*-*-freebsd* for FreeBSD 11. Eliminate the arm*hf*-*-freebsd*
+ 	target.
+ 
+ 2016-06-03  Richard Biener  <rguenther@suse.de>
+ 
+ 	* BASE-VER: Set to 5.4.1.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
***************
*** 34,40 ****
  
  	2016-03-24  Richard Henderson  <rth@redhat.com>
  
!         PR middle-end/69845
  	* fold-const.c (extract_muldiv_1): Correct test for multiplication
  	overflow.
  
--- 2988,2994 ----
  
  	2016-03-24  Richard Henderson  <rth@redhat.com>
  
! 	PR middle-end/69845
  	* fold-const.c (extract_muldiv_1): Correct test for multiplication
  	overflow.
  
***************
*** 2192,2198 ****
  
  	Backport from mainline
  	2015-11-26  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
! 	            Bernd Schmidt  <bschmidt@redhat.com>
  
  	PR rtl-optimization/67226
  	* calls.c (store_one_arg): Take into account
--- 5146,5152 ----
  
  	Backport from mainline
  	2015-11-26  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
! 		    Bernd Schmidt  <bschmidt@redhat.com>
  
  	PR rtl-optimization/67226
  	* calls.c (store_one_arg): Take into account
***************
*** 2252,2258 ****
  
  	Backport from mainline
  	2015-11-24  Bernd Schmidt <bschmidt@redhat.com>
! 	            Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
  
  	PR rtl-optimization/68194
  	PR rtl-optimization/68328
--- 5206,5212 ----
  
  	Backport from mainline
  	2015-11-24  Bernd Schmidt <bschmidt@redhat.com>
! 		    Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
  
  	PR rtl-optimization/68194
  	PR rtl-optimization/68328
***************
*** 2525,2531 ****
  
  	Backport from mainline
  	2015-11-16  Oleg Endo  <olegendo@gcc.gnu.org>
! 	            Kaz Kojima  <kkojima@gcc.gnu.org>
  
  	PR target/68277
  	* config/sh/sh.md (addsi3_scr): Handle reg overlap of operands[0] and
--- 5479,5485 ----
  
  	Backport from mainline
  	2015-11-16  Oleg Endo  <olegendo@gcc.gnu.org>
! 		    Kaz Kojima  <kkojima@gcc.gnu.org>
  
  	PR target/68277
  	* config/sh/sh.md (addsi3_scr): Handle reg overlap of operands[0] and
***************
*** 2599,2605 ****
  
  	Backport from mainline
  	2015-10-23  Steve Ellcey  <sellcey@imgtec.com>
! 	            Andrew Pinski  <apinski@cavium.com>
  
  	PR rtl-optimization/67736
  	* combine.c (simplify_comparison): Use gen_lowpart_or_truncate instead
--- 5553,5559 ----
  
  	Backport from mainline
  	2015-10-23  Steve Ellcey  <sellcey@imgtec.com>
! 		    Andrew Pinski  <apinski@cavium.com>
  
  	PR rtl-optimization/67736
  	* combine.c (simplify_comparison): Use gen_lowpart_or_truncate instead
diff -Nrcpad gcc-5.4.0/gcc/DATESTAMP gcc-5.5.0/gcc/DATESTAMP
*** gcc-5.4.0/gcc/DATESTAMP	Fri Jun  3 00:16:08 2016
--- gcc-5.5.0/gcc/DATESTAMP	Tue Oct 10 00:16:10 2017
***************
*** 1 ****
! 20160603
--- 1 ----
! 20171010
diff -Nrcpad gcc-5.4.0/gcc/Makefile.in gcc-5.5.0/gcc/Makefile.in
*** gcc-5.4.0/gcc/Makefile.in	Mon May  4 10:46:32 2015
--- gcc-5.5.0/gcc/Makefile.in	Tue May 30 08:27:04 2017
*************** GCC_TARGET_INSTALL_NAME := $(target_nonc
*** 769,774 ****
--- 769,775 ----
  CPP_INSTALL_NAME := $(shell echo cpp|sed '$(program_transform_name)')
  GCOV_INSTALL_NAME := $(shell echo gcov|sed '$(program_transform_name)')
  GCOV_TOOL_INSTALL_NAME := $(shell echo gcov-tool|sed '$(program_transform_name)')
+ GCOV_DUMP_INSTALL_NAME := $(shell echo gcov-dump|sed '$(program_transform_name)')
  
  # Setup the testing framework, if you have one
  EXPECT = `if [ -f $${rootme}/../expect/expect ] ; then \
*************** s-specs : Makefile
*** 2001,2006 ****
--- 2002,2008 ----
  
  optionlist: s-options ; @true
  s-options: $(ALL_OPT_FILES) Makefile $(srcdir)/opt-gather.awk
+ 	LC_ALL=C ; export LC_ALL ; \
  	$(AWK) -f $(srcdir)/opt-gather.awk $(ALL_OPT_FILES) > tmp-optionlist
  	$(SHELL) $(srcdir)/../move-if-change tmp-optionlist optionlist
  	$(STAMP) s-options
*************** build/gcov-iov$(build_exeext): build/gco
*** 2639,2645 ****
  	+$(LINKER_FOR_BUILD) $(BUILD_LINKERFLAGS) $(BUILD_LDFLAGS) \
  		build/gcov-iov.o -o $@
  
! gcov-iov.h: s-iov
  s-iov: build/gcov-iov$(build_exeext) $(BASEVER) $(DEVPHASE)
  	build/gcov-iov$(build_exeext) '$(BASEVER_c)' '$(DEVPHASE_c)' \
  	    > tmp-gcov-iov.h
--- 2641,2647 ----
  	+$(LINKER_FOR_BUILD) $(BUILD_LINKERFLAGS) $(BUILD_LDFLAGS) \
  		build/gcov-iov.o -o $@
  
! gcov-iov.h: s-iov; @true
  s-iov: build/gcov-iov$(build_exeext) $(BASEVER) $(DEVPHASE)
  	build/gcov-iov$(build_exeext) '$(BASEVER_c)' '$(DEVPHASE_c)' \
  	    > tmp-gcov-iov.h
*************** TEXI_GCC_FILES = gcc.texi gcc-common.tex
*** 2896,2902 ****
  	 gcov.texi trouble.texi bugreport.texi service.texi		\
  	 contribute.texi compat.texi funding.texi gnu.texi gpl_v3.texi	\
  	 fdl.texi contrib.texi cppenv.texi cppopts.texi avr-mmcu.texi	\
! 	 implement-c.texi implement-cxx.texi gcov-tool.texi
  
  # we explicitly use $(srcdir)/doc/tm.texi here to avoid confusion with
  # the generated tm.texi; the latter might have a more recent timestamp,
--- 2898,2904 ----
  	 gcov.texi trouble.texi bugreport.texi service.texi		\
  	 contribute.texi compat.texi funding.texi gnu.texi gpl_v3.texi	\
  	 fdl.texi contrib.texi cppenv.texi cppopts.texi avr-mmcu.texi	\
! 	 implement-c.texi implement-cxx.texi gcov-tool.texi gcov-dump.texi
  
  # we explicitly use $(srcdir)/doc/tm.texi here to avoid confusion with
  # the generated tm.texi; the latter might have a more recent timestamp,
*************** $(build_htmldir)/gccinstall/index.html:
*** 3019,3025 ****
  	$(SHELL) $(srcdir)/doc/install.texi2html
  
  MANFILES = doc/gcov.1 doc/cpp.1 doc/gcc.1 doc/gfdl.7 doc/gpl.7 \
!            doc/fsf-funding.7 doc/gcov-tool.1
  
  generated-manpages: man
  
--- 3021,3027 ----
  	$(SHELL) $(srcdir)/doc/install.texi2html
  
  MANFILES = doc/gcov.1 doc/cpp.1 doc/gcc.1 doc/gfdl.7 doc/gpl.7 \
!            doc/fsf-funding.7 doc/gcov-tool.1 doc/gcov-dump.1
  
  generated-manpages: man
  
*************** install-common: native lang.install-comm
*** 3321,3326 ****
--- 3323,3337 ----
  	    gcov-tool$(exeext) $(DESTDIR)$(bindir)/$(GCOV_TOOL_INSTALL_NAME)$(exeext); \
  	  fi; \
  	fi
+ # Install gcov-dump if it was compiled.
+ 	-if test "$(enable_as_accelerator)" != "yes" ; then \
+ 	  if [ -f gcov-dump$(exeext) ]; \
+ 	  then \
+ 	    rm -f $(DESTDIR)$(bindir)/$(GCOV_DUMP_INSTALL_NAME)$(exeext); \
+ 	    $(INSTALL_PROGRAM) \
+ 	    gcov-dump$(exeext) $(DESTDIR)$(bindir)/$(GCOV_DUMP_INSTALL_NAME)$(exeext); \
+ 	  fi; \
+ 	fi
  
  # Install the driver program as $(target_noncanonical)-gcc,
  # $(target_noncanonical)-gcc-$(version), and also as gcc if native.
*************** install-man: lang.install-man \
*** 3404,3409 ****
--- 3415,3422 ----
  	$(DESTDIR)$(man1dir)/$(GCC_INSTALL_NAME)$(man1ext) \
  	$(DESTDIR)$(man1dir)/$(CPP_INSTALL_NAME)$(man1ext) \
  	$(DESTDIR)$(man1dir)/$(GCOV_INSTALL_NAME)$(man1ext) \
+ 	$(DESTDIR)$(man1dir)/$(GCOV_TOOL_INSTALL_NAME)$(man1ext) \
+ 	$(DESTDIR)$(man1dir)/$(GCOV_DUMP_INSTALL_NAME)$(man1ext) \
  	$(DESTDIR)$(man7dir)/fsf-funding$(man7ext) \
  	$(DESTDIR)$(man7dir)/gfdl$(man7ext) \
  	$(DESTDIR)$(man7dir)/gpl$(man7ext)
*************** $(DESTDIR)$(man1dir)/$(GCOV_TOOL_INSTALL
*** 3433,3438 ****
--- 3446,3456 ----
  	-$(INSTALL_DATA) $< $@
  	-chmod a-x $@
  
+ $(DESTDIR)$(man1dir)/$(GCOV_DUMP_INSTALL_NAME)$(man1ext): doc/gcov-dump.1 installdirs
+ 	-rm -f $@
+ 	-$(INSTALL_DATA) $< $@
+ 	-chmod a-x $@
+ 
  # Install all the header files built in the include subdirectory.
  install-headers: $(INSTALL_HEADERS_DIR)
  # Fix symlinks to absolute paths in the installed include directory to
*************** check_p_subdirs=$(wordlist 1,$(check_p_c
*** 3739,3745 ****
  # variable (see above check_gcc_parallelize description).
  $(lang_checks_parallelized): check-% : site.exp
  	-rm -rf $(TESTSUITEDIR)/$*-parallel
! 	@if [ "$(filter -j, $(MFLAGS))" = "-j" ]; then \
  	  test -d $(TESTSUITEDIR) || mkdir $(TESTSUITEDIR) || true; \
  	  test -d $(TESTSUITEDIR)/$*-parallel || mkdir $(TESTSUITEDIR)/$*-parallel || true; \
  	  GCC_RUNTEST_PARALLELIZE_DIR=`${PWD_COMMAND}`/$(TESTSUITEDIR)/$(check_p_tool)-parallel ; \
--- 3757,3763 ----
  # variable (see above check_gcc_parallelize description).
  $(lang_checks_parallelized): check-% : site.exp
  	-rm -rf $(TESTSUITEDIR)/$*-parallel
! 	@if [ -n "$(filter -j%, $(MFLAGS))" ]; then \
  	  test -d $(TESTSUITEDIR) || mkdir $(TESTSUITEDIR) || true; \
  	  test -d $(TESTSUITEDIR)/$*-parallel || mkdir $(TESTSUITEDIR)/$*-parallel || true; \
  	  GCC_RUNTEST_PARALLELIZE_DIR=`${PWD_COMMAND}`/$(TESTSUITEDIR)/$(check_p_tool)-parallel ; \
diff -Nrcpad gcc-5.4.0/gcc/ada/ChangeLog gcc-5.5.0/gcc/ada/ChangeLog
*** gcc-5.4.0/gcc/ada/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/ada/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,87 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-02-24  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* gcc-interface/trans.c (gnat_to_gnu): Do not apply special handling
+ 	of boolean rvalues to function calls.
+ 
+ 2017-02-24  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* gcc-interface/trans.c (return_value_ok_for_nrv_p): Add sanity check.
+ 
+ 2016-11-22  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* gcc-interface/Make-lang.in (check-acats): Fix detection
+ 	of -j argument.
+ 
+ 2016-11-13  Bob Duff  <duff@adacore.com>
+ 
+ 	* gcc-interface/decl.c (gnat_to_gnu_entity): In assertion about known
+ 	Esize, protect with !is_type and change !Unknown_Esize to Known_Esize.
+ 
+ 2016-11-02  Rainer Orth  <ro@CeBiTec.Uni-Bielefeld.DE>
+ 
+ 	Backport from mainline
+ 	2016-10-24  Rainer Orth  <ro@CeBiTec.Uni-Bielefeld.DE>
+ 
+ 	* gcc-interface/Make-lang.in (lang_checks_parallelized): New target.
+ 	(check_gnat_parallelize): Likewise.
+ 
+ 2016-10-17  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* system-darwin-ppc64.ads (Support_64_Bit_Divides): Delete.
+ 	* system-linux-armeb.ads (Support_64_Bit_Divides): Likewise.
+ 	* system-linux-mips.ads (Support_64_Bit_Divides): Likewise.
+ 	* system-linux-mips64el.ads (Support_64_Bit_Divides): Likewise.
+ 	* system-linux-mipsel.ads (Support_64_Bit_Divides): Likewise.
+ 	* system-linux-sparcv9.ads (Support_64_Bit_Divides): Likewise.
+ 	* system-rtems.ads (Support_64_Bit_Divides): Likewise.
+ 
+ 2016-10-16  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* system-aix.ads (Always_Compatible_Rep): Change to False.
+ 	* system-aix64.ads (Always_Compatible_Rep): Likewise.
+ 	* system-hpux-ia64.ads (Always_Compatible_Rep): Likewise.
+ 	* system-hpux.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-alpha.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-hppa.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-ia64.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-mips.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-mips64el.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-mipsel.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-s390.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-s390x.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-sh4.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-sparc.ads (Always_Compatible_Rep): Likewise.
+ 	* system-linux-sparcv9.ads (Always_Compatible_Rep): Likewise.
+ 	* system-rtems.ads (Always_Compatible_Rep): Likewise.
+ 
+ 2016-10-11  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	Backport from mainline
+ 	2016-10-11  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* system-linux-armeb.ads (Backend_Overflow_Checks): Change to True.
+ 	* system-linux-mips.ads (Backend_Overflow_Checks): Likewise.
+ 	* system-linux-mips64el.ads (Backend_Overflow_Checks): Likewise.
+ 	* system-linux-mipsel.ads (Backend_Overflow_Checks): Likewise.
+ 	* system-linux-sparcv9.ads (Backend_Overflow_Checks): Likewise.
+ 	* system-rtems.ads (Always_Compatible_Rep): Likewise.
+ 
+ 	2016-10-11  Eric Botcazou  <ebotcazou@adacore.com>
+ 		    Tristan Gingold  <gingold@adacore.com>
+ 
+ 	* system-linux-ppc64.ads: Delete.
+ 	* system-linux-ppc.ads: Make 32-bit/64-bit neutral.
+ 	* gcc-interface/Makefile.in (PowerPC/Linux): Simplify.
+ 
+ 2016-10-10  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* gcc-interface/utils.c (convert): For a biased input type, convert
+ 	the bias itself to the base type before adding it.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/ada/gcc-interface/Make-lang.in gcc-5.5.0/gcc/ada/gcc-interface/Make-lang.in
*** gcc-5.4.0/gcc/ada/gcc-interface/Make-lang.in	Fri Oct  9 08:14:21 2015
--- gcc-5.5.0/gcc/ada/gcc-interface/Make-lang.in	Tue Nov 22 18:19:58 2016
*************** ada.stagefeedback: stagefeedback-start
*** 861,866 ****
--- 861,869 ----
  	-$(MV) ada/stamp-* stagefeedback/ada
  
  lang_checks += check-gnat
+ lang_checks_parallelized += check-gnat
+ # For description see the check_$lang_parallelize comment in gcc/Makefile.in.
+ check_gnat_parallelize = 1000
  
  check-ada: check-acats check-gnat
  check-ada-subtargets: check-acats-subtargets check-gnat-subtargets
*************** check-acats:
*** 884,890 ****
  	@test -d $(ACATSDIR) || mkdir -p $(ACATSDIR); \
  	rootme=`${PWD_COMMAND}`; export rootme; \
  	EXPECT=$(EXPECT); export EXPECT; \
! 	if [ -z "$(CHAPTERS)" ] && [ "$(filter -j, $(MFLAGS))" = "-j" ]; \
  	then \
  	  rm -rf $(ACATSDIR)-parallel; \
  	  mkdir $(ACATSDIR)-parallel; \
--- 887,893 ----
  	@test -d $(ACATSDIR) || mkdir -p $(ACATSDIR); \
  	rootme=`${PWD_COMMAND}`; export rootme; \
  	EXPECT=$(EXPECT); export EXPECT; \
! 	if [ -z "$(CHAPTERS)" ] && [ -n "$(filter -j%, $(MFLAGS))" ]; \
  	then \
  	  rm -rf $(ACATSDIR)-parallel; \
  	  mkdir $(ACATSDIR)-parallel; \
diff -Nrcpad gcc-5.4.0/gcc/ada/gcc-interface/Makefile.in gcc-5.5.0/gcc/ada/gcc-interface/Makefile.in
*** gcc-5.4.0/gcc/ada/gcc-interface/Makefile.in	Mon May  2 13:22:23 2016
--- gcc-5.5.0/gcc/ada/gcc-interface/Makefile.in	Tue Oct 11 20:05:44 2016
*************** ifeq ($(strip $(filter-out powerpc% linu
*** 1813,1853 ****
    s-tpopsp.adb<s-tpopsp-tls.adb \
    g-sercom.adb<g-sercom-linux.adb \
    $(ATOMICS_TARGET_PAIRS) \
!   $(ATOMICS_BUILTINS_TARGET_PAIRS)
  
    ifeq ($(strip $(filter-out xenomai,$(THREAD_KIND))),)
      LIBGNAT_TARGET_PAIRS = \
!       $(LIBGNAT_TARGET_PAIRS_COMMON)
! 
!     LIBGNAT_TARGET_PAIRS += \
!     s-osinte.ads<s-osinte-linux-xenomai.ads \
!     s-osprim.adb<s-osprim-linux-xenomai.adb \
!     s-taprop.adb<s-taprop-linux-xenomai.adb \
!     s-taspri.ads<s-taspri-linux-xenomai.ads \
!     system.ads<system-linux-ppc.ads
    else
!     LIBGNAT_TARGET_PAIRS_32 = \
!     system.ads<system-linux-ppc.ads
! 
!     LIBGNAT_TARGET_PAIRS_64 = \
!     system.ads<system-linux-ppc64.ads
! 
!     ifneq (,$(or $(filter powerpc64%, $(shell $(GCC_FOR_TARGET) $(GNATLIBCFLAGS) -print-multiarch)), $(filter ../lib64, $(shell $(GCC_FOR_TARGET) $(GNATLIBCFLAGS) -print-multi-os-directory))))
!       LIBGNAT_TARGET_PAIRS = \
!       $(LIBGNAT_TARGET_PAIRS_COMMON) $(LIBGNAT_TARGET_PAIRS_64)
!     else
!       LIBGNAT_TARGET_PAIRS = \
!       $(LIBGNAT_TARGET_PAIRS_COMMON) $(LIBGNAT_TARGET_PAIRS_32)
!     endif
! 
!     LIBGNAT_TARGET_PAIRS += \
!     s-mudido.adb<s-mudido-affinity.adb \
!     s-osinte.ads<s-osinte-linux.ads \
!     s-osprim.adb<s-osprim-posix.adb \
!     s-taprop.adb<s-taprop-linux.adb \
!     s-tasinf.ads<s-tasinf-linux.ads \
!     s-tasinf.adb<s-tasinf-linux.adb \
!     s-taspri.ads<s-taspri-posix-noaltstack.ads
    endif
  
    TOOLS_TARGET_PAIRS =  \
--- 1813,1838 ----
    s-tpopsp.adb<s-tpopsp-tls.adb \
    g-sercom.adb<g-sercom-linux.adb \
    $(ATOMICS_TARGET_PAIRS) \
!   $(ATOMICS_BUILTINS_TARGET_PAIRS) \
!   system.ads<system-linux-ppc.ads
  
    ifeq ($(strip $(filter-out xenomai,$(THREAD_KIND))),)
      LIBGNAT_TARGET_PAIRS = \
!       $(LIBGNAT_TARGET_PAIRS_COMMON) \
!       s-osinte.ads<s-osinte-linux-xenomai.ads \
!       s-osprim.adb<s-osprim-linux-xenomai.adb \
!       s-taprop.adb<s-taprop-linux-xenomai.adb \
!       s-taspri.ads<s-taspri-linux-xenomai.ads
    else
!     LIBGNAT_TARGET_PAIRS = \
!       $(LIBGNAT_TARGET_PAIRS_COMMON) \
!       s-mudido.adb<s-mudido-affinity.adb \
!       s-osinte.ads<s-osinte-linux.ads \
!       s-osprim.adb<s-osprim-posix.adb \
!       s-taprop.adb<s-taprop-linux.adb \
!       s-tasinf.ads<s-tasinf-linux.ads \
!       s-tasinf.adb<s-tasinf-linux.adb \
!       s-taspri.ads<s-taspri-posix-noaltstack.ads
    endif
  
    TOOLS_TARGET_PAIRS =  \
diff -Nrcpad gcc-5.4.0/gcc/ada/gcc-interface/decl.c gcc-5.5.0/gcc/ada/gcc-interface/decl.c
*** gcc-5.4.0/gcc/ada/gcc-interface/decl.c	Sat Apr  2 08:56:49 2016
--- gcc-5.5.0/gcc/ada/gcc-interface/decl.c	Sun Nov 13 18:38:16 2016
*************** gnat_to_gnu_entity (Entity_Id gnat_entit
*** 361,367 ****
       must be specified unless it was specified by the programmer.  Exceptions
       are for access-to-protected-subprogram types and all access subtypes, as
       another GNAT type is used to lay out the GCC type for them.  */
!   gcc_assert (!Unknown_Esize (gnat_entity)
  	      || Has_Size_Clause (gnat_entity)
  	      || (!IN (kind, Numeric_Kind)
  		  && !IN (kind, Enumeration_Kind)
--- 361,368 ----
       must be specified unless it was specified by the programmer.  Exceptions
       are for access-to-protected-subprogram types and all access subtypes, as
       another GNAT type is used to lay out the GCC type for them.  */
!   gcc_assert (!is_type
! 	      || Known_Esize (gnat_entity)
  	      || Has_Size_Clause (gnat_entity)
  	      || (!IN (kind, Numeric_Kind)
  		  && !IN (kind, Enumeration_Kind)
diff -Nrcpad gcc-5.4.0/gcc/ada/gcc-interface/trans.c gcc-5.5.0/gcc/ada/gcc-interface/trans.c
*** gcc-5.4.0/gcc/ada/gcc-interface/trans.c	Mon Jan 18 10:29:45 2016
--- gcc-5.5.0/gcc/ada/gcc-interface/trans.c	Fri Feb 24 10:54:21 2017
*************** return_value_ok_for_nrv_p (tree ret_obj,
*** 3499,3507 ****
--- 3499,3514 ----
    if (TREE_ADDRESSABLE (ret_val))
      return false;
  
+   /* For the constrained case, test for overalignment.  */
    if (ret_obj && DECL_ALIGN (ret_val) > DECL_ALIGN (ret_obj))
      return false;
  
+   /* For the unconstrained case, test for bogus initialization.  */
+   if (!ret_obj
+       && DECL_INITIAL (ret_val)
+       && TREE_CODE (DECL_INITIAL (ret_val)) == NULL_EXPR)
+     return false;
+ 
    return true;
  }
  
*************** gnat_to_gnu (Node_Id gnat_node)
*** 7315,7321 ****
        && (kind == N_Identifier
  	  || kind == N_Expanded_Name
  	  || kind == N_Explicit_Dereference
- 	  || kind == N_Function_Call
  	  || kind == N_Indexed_Component
  	  || kind == N_Selected_Component)
        && TREE_CODE (get_base_type (gnu_result_type)) == BOOLEAN_TYPE
--- 7322,7327 ----
diff -Nrcpad gcc-5.4.0/gcc/ada/gcc-interface/utils.c gcc-5.5.0/gcc/ada/gcc-interface/utils.c
*** gcc-5.4.0/gcc/ada/gcc-interface/utils.c	Thu Jun 11 12:51:04 2015
--- gcc-5.5.0/gcc/ada/gcc-interface/utils.c	Mon Oct 10 08:53:06 2016
*************** convert (tree type, tree expr)
*** 4086,4097 ****
        return convert (type, unpadded);
      }
  
!   /* If the input is a biased type, adjust first.  */
    if (ecode == INTEGER_TYPE && TYPE_BIASED_REPRESENTATION_P (etype))
      return convert (type, fold_build2 (PLUS_EXPR, TREE_TYPE (etype),
  				       fold_convert (TREE_TYPE (etype), expr),
! 				       fold_convert (TREE_TYPE (etype),
! 						     TYPE_MIN_VALUE (etype))));
  
    /* If the input is a justified modular type, we need to extract the actual
       object before converting it to any other type with the exceptions of an
--- 4086,4100 ----
        return convert (type, unpadded);
      }
  
!   /* If the input is a biased type, convert first to the base type and add
!      the bias.  Note that the bias must go through a full conversion to the
!      base type, lest it is itself a biased value; this happens for subtypes
!      of biased types.  */
    if (ecode == INTEGER_TYPE && TYPE_BIASED_REPRESENTATION_P (etype))
      return convert (type, fold_build2 (PLUS_EXPR, TREE_TYPE (etype),
  				       fold_convert (TREE_TYPE (etype), expr),
! 				       convert (TREE_TYPE (etype),
! 						TYPE_MIN_VALUE (etype))));
  
    /* If the input is a justified modular type, we need to extract the actual
       object before converting it to any other type with the exceptions of an
*************** convert (tree type, tree expr)
*** 4393,4399 ****
  	  && (ecode == ARRAY_TYPE || ecode == UNCONSTRAINED_ARRAY_TYPE
  	      || (ecode == RECORD_TYPE && TYPE_CONTAINS_TEMPLATE_P (etype))))
  	return unchecked_convert (type, expr, false);
!       else if (TYPE_BIASED_REPRESENTATION_P (type))
  	return fold_convert (type,
  			     fold_build2 (MINUS_EXPR, TREE_TYPE (type),
  					  convert (TREE_TYPE (type), expr),
--- 4396,4407 ----
  	  && (ecode == ARRAY_TYPE || ecode == UNCONSTRAINED_ARRAY_TYPE
  	      || (ecode == RECORD_TYPE && TYPE_CONTAINS_TEMPLATE_P (etype))))
  	return unchecked_convert (type, expr, false);
! 
!       /* If the output is a biased type, convert first to the base type and
! 	 subtract the bias.  Note that the bias itself must go through a full
! 	 conversion to the base type, lest it is a biased value; this happens
! 	 for subtypes of biased types.  */
!       if (TYPE_BIASED_REPRESENTATION_P (type))
  	return fold_convert (type,
  			     fold_build2 (MINUS_EXPR, TREE_TYPE (type),
  					  convert (TREE_TYPE (type), expr),
diff -Nrcpad gcc-5.4.0/gcc/ada/system-aix.ads gcc-5.5.0/gcc/ada/system-aix.ads
*** gcc-5.4.0/gcc/ada/system-aix.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-aix.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                            (AIX/PPC Version)                             --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                            (AIX/PPC Version)                             --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 148,154 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 148,154 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-aix64.ads gcc-5.5.0/gcc/ada/system-aix64.ads
*** gcc-5.4.0/gcc/ada/system-aix64.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-aix64.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                           (PPC/AIX64 Version)                            --
  --                                                                          --
! --          Copyright (C) 2009-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                           (PPC/AIX64 Version)                            --
  --                                                                          --
! --          Copyright (C) 2009-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 148,154 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 148,154 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-darwin-ppc64.ads gcc-5.5.0/gcc/ada/system-darwin-ppc64.ads
*** gcc-5.4.0/gcc/ada/system-darwin-ppc64.ads	Fri May  6 09:12:09 2016
--- gcc-5.5.0/gcc/ada/system-darwin-ppc64.ads	Mon Oct 17 08:56:14 2016
*************** private
*** 138,144 ****
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := False;
     Stack_Check_Limits        : constant Boolean := False;
-    Support_64_Bit_Divides    : constant Boolean := True;
     Support_Aggregates        : constant Boolean := True;
     Support_Atomic_Primitives : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
--- 138,143 ----
diff -Nrcpad gcc-5.4.0/gcc/ada/system-hpux-ia64.ads gcc-5.5.0/gcc/ada/system-hpux-ia64.ads
*** gcc-5.4.0/gcc/ada/system-hpux-ia64.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-hpux-ia64.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                           (HP-UX/ia64 Version)                           --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                           (HP-UX/ia64 Version)                           --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 139,145 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 139,145 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-hpux.ads gcc-5.5.0/gcc/ada/system-hpux.ads
*** gcc-5.4.0/gcc/ada/system-hpux.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-hpux.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                             (HP-UX Version)                              --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                             (HP-UX Version)                              --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 138,144 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 138,144 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-alpha.ads gcc-5.5.0/gcc/ada/system-linux-alpha.ads
*** gcc-5.4.0/gcc/ada/system-linux-alpha.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-linux-alpha.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                        (GNU-Linux/alpha Version)                         --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                        (GNU-Linux/alpha Version)                         --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 138,144 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 138,144 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-armeb.ads gcc-5.5.0/gcc/ada/system-linux-armeb.ads
*** gcc-5.4.0/gcc/ada/system-linux-armeb.ads	Fri May  6 09:12:09 2016
--- gcc-5.5.0/gcc/ada/system-linux-armeb.ads	Mon Oct 17 08:56:14 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                        (GNU-Linux/ARMEB Version)                         --
  --                                                                          --
! --          Copyright (C) 1992-2011, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                        (GNU-Linux/ARMEB Version)                         --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 127,133 ****
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := False;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
--- 127,133 ----
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := True;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
*************** private
*** 142,148 ****
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := True;
     Stack_Check_Limits        : constant Boolean := False;
-    Support_64_Bit_Divides    : constant Boolean := True;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
--- 142,147 ----
*************** private
*** 150,155 ****
     Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
!    ZCX_By_Default            : constant Boolean := False;
  
  end System;
--- 149,154 ----
     Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
!    ZCX_By_Default            : constant Boolean := True;
  
  end System;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-hppa.ads gcc-5.5.0/gcc/ada/system-linux-hppa.ads
*** gcc-5.4.0/gcc/ada/system-linux-hppa.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-linux-hppa.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                        (GNU/Linux-HPPA Version)                          --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                        (GNU/Linux-HPPA Version)                          --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 138,144 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 138,144 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-ia64.ads gcc-5.5.0/gcc/ada/system-linux-ia64.ads
*** gcc-5.4.0/gcc/ada/system-linux-ia64.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-linux-ia64.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                        (GNU-Linux/ia64 Version)                          --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                        (GNU-Linux/ia64 Version)                          --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 147,153 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 147,153 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-mips.ads gcc-5.5.0/gcc/ada/system-linux-mips.ads
*** gcc-5.4.0/gcc/ada/system-linux-mips.ads	Fri May  6 09:12:09 2016
--- gcc-5.5.0/gcc/ada/system-linux-mips.ads	Mon Oct 17 08:56:14 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                          (GNU-Linux/MIPS Version)                        --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                          (GNU-Linux/MIPS Version)                        --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 119,125 ****
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := False;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
--- 119,125 ----
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := True;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
*************** private
*** 134,145 ****
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := True;
     Stack_Check_Limits        : constant Boolean := False;
-    Support_64_Bit_Divides    : constant Boolean := True;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 134,144 ----
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := True;
     Stack_Check_Limits        : constant Boolean := False;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-mips64el.ads gcc-5.5.0/gcc/ada/system-linux-mips64el.ads
*** gcc-5.4.0/gcc/ada/system-linux-mips64el.ads	Fri May  6 09:12:09 2016
--- gcc-5.5.0/gcc/ada/system-linux-mips64el.ads	Mon Oct 17 08:56:14 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                       (GNU-Linux/MIPS64EL Version)                       --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                       (GNU-Linux/MIPS64EL Version)                       --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 119,125 ****
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := False;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
--- 119,125 ----
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := True;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
*************** private
*** 134,145 ****
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := True;
     Stack_Check_Limits        : constant Boolean := False;
-    Support_64_Bit_Divides    : constant Boolean := True;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 134,144 ----
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := True;
     Stack_Check_Limits        : constant Boolean := False;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-mipsel.ads gcc-5.5.0/gcc/ada/system-linux-mipsel.ads
*** gcc-5.4.0/gcc/ada/system-linux-mipsel.ads	Fri May  6 09:12:09 2016
--- gcc-5.5.0/gcc/ada/system-linux-mipsel.ads	Mon Oct 17 08:56:14 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                        (GNU-Linux/MIPSEL Version)                        --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                        (GNU-Linux/MIPSEL Version)                        --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 119,125 ****
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := False;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
--- 119,125 ----
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := True;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
*************** private
*** 134,145 ****
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := True;
     Stack_Check_Limits        : constant Boolean := False;
-    Support_64_Bit_Divides    : constant Boolean := True;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 134,144 ----
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := True;
     Stack_Check_Limits        : constant Boolean := False;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-ppc.ads gcc-5.5.0/gcc/ada/system-linux-ppc.ads
*** gcc-5.4.0/gcc/ada/system-linux-ppc.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-linux-ppc.ads	Tue Oct 11 20:05:44 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                         (GNU-Linux/PPC Version)                          --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                         (GNU-Linux/PPC Version)                          --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** package System is
*** 69,76 ****
     Null_Address : constant Address;
  
     Storage_Unit : constant := 8;
!    Word_Size    : constant := 32;
!    Memory_Size  : constant := 2 ** 32;
  
     --  Address comparison
  
--- 69,76 ----
     Null_Address : constant Address;
  
     Storage_Unit : constant := 8;
!    Word_Size    : constant := Standard'Word_Size;
!    Memory_Size  : constant := 2 ** Word_Size;
  
     --  Address comparison
  
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-ppc64.ads gcc-5.5.0/gcc/ada/system-linux-ppc64.ads
*** gcc-5.4.0/gcc/ada/system-linux-ppc64.ads	Fri May  6 09:12:09 2016
--- gcc-5.5.0/gcc/ada/system-linux-ppc64.ads	Thu Jan  1 00:00:00 1970
***************
*** 1,155 ****
- ------------------------------------------------------------------------------
- --                                                                          --
- --                        GNAT RUN-TIME COMPONENTS                          --
- --                                                                          --
- --                               S Y S T E M                                --
- --                                                                          --
- --                                 S p e c                                  --
- --                        (GNU-Linux/PPC64 Version)                         --
- --                                                                          --
- --          Copyright (C) 1992-2011, Free Software Foundation, Inc.         --
- --                                                                          --
- -- This specification is derived from the Ada Reference Manual for use with --
- -- GNAT. The copyright notice above, and the license provisions that follow --
- -- apply solely to the  contents of the part following the private keyword. --
- --                                                                          --
- -- GNAT is free software;  you can  redistribute it  and/or modify it under --
- -- terms of the  GNU General Public License as published  by the Free Soft- --
- -- ware  Foundation;  either version 3,  or (at your option) any later ver- --
- -- sion.  GNAT is distributed in the hope that it will be useful, but WITH- --
- -- OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY --
- -- or FITNESS FOR A PARTICULAR PURPOSE.                                     --
- --                                                                          --
- -- As a special exception under Section 7 of GPL version 3, you are granted --
- -- additional permissions described in the GCC Runtime Library Exception,   --
- -- version 3.1, as published by the Free Software Foundation.               --
- --                                                                          --
- -- You should have received a copy of the GNU General Public License and    --
- -- a copy of the GCC Runtime Library Exception along with this program;     --
- -- see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see    --
- -- <http://www.gnu.org/licenses/>.                                          --
- --                                                                          --
- -- GNAT was originally developed  by the GNAT team at  New York University. --
- -- Extensive contributions were provided by Ada Core Technologies Inc.      --
- --                                                                          --
- ------------------------------------------------------------------------------
- 
- package System is
-    pragma Pure;
-    --  Note that we take advantage of the implementation permission to make
-    --  this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada
-    --  2005, this is Pure in any case (AI-362).
- 
-    pragma No_Elaboration_Code_All;
-    --  Allow the use of that restriction in units that WITH this unit
- 
-    type Name is (SYSTEM_NAME_GNAT);
-    System_Name : constant Name := SYSTEM_NAME_GNAT;
- 
-    --  System-Dependent Named Numbers
- 
-    Min_Int               : constant := Long_Long_Integer'First;
-    Max_Int               : constant := Long_Long_Integer'Last;
- 
-    Max_Binary_Modulus    : constant := 2 ** Long_Long_Integer'Size;
-    Max_Nonbinary_Modulus : constant := 2 ** Integer'Size - 1;
- 
-    Max_Base_Digits       : constant := Long_Long_Float'Digits;
-    Max_Digits            : constant := Long_Long_Float'Digits;
- 
-    Max_Mantissa          : constant := 63;
-    Fine_Delta            : constant := 2.0 ** (-Max_Mantissa);
- 
-    Tick                  : constant := 0.000_001;
- 
-    --  Storage-related Declarations
- 
-    type Address is private;
-    pragma Preelaborable_Initialization (Address);
-    Null_Address : constant Address;
- 
-    Storage_Unit : constant := 8;
-    Word_Size    : constant := 64;
-    Memory_Size  : constant := 2 ** 64;
- 
-    --  Address comparison
- 
-    function "<"  (Left, Right : Address) return Boolean;
-    function "<=" (Left, Right : Address) return Boolean;
-    function ">"  (Left, Right : Address) return Boolean;
-    function ">=" (Left, Right : Address) return Boolean;
-    function "="  (Left, Right : Address) return Boolean;
- 
-    pragma Import (Intrinsic, "<");
-    pragma Import (Intrinsic, "<=");
-    pragma Import (Intrinsic, ">");
-    pragma Import (Intrinsic, ">=");
-    pragma Import (Intrinsic, "=");
- 
-    --  Other System-Dependent Declarations
- 
-    type Bit_Order is (High_Order_First, Low_Order_First);
-    Default_Bit_Order : constant Bit_Order := High_Order_First;
-    pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning
- 
-    --  Priority-related Declarations (RM D.1)
- 
-    --  0 .. 98 corresponds to the system priority range 1 .. 99.
-    --
-    --  If the scheduling policy is SCHED_FIFO or SCHED_RR the runtime makes use
-    --  of the entire range provided by the system.
-    --
-    --  If the scheduling policy is SCHED_OTHER the only valid system priority
-    --  is 1 and other values are simply ignored.
- 
-    Max_Priority           : constant Positive := 97;
-    Max_Interrupt_Priority : constant Positive := 98;
- 
-    subtype Any_Priority       is Integer      range  0 .. 98;
-    subtype Priority           is Any_Priority range  0 .. 97;
-    subtype Interrupt_Priority is Any_Priority range 98 .. 98;
- 
-    Default_Priority : constant Priority := 48;
- 
- private
- 
-    type Address is mod Memory_Size;
-    Null_Address : constant Address := 0;
- 
-    --------------------------------------
-    -- System Implementation Parameters --
-    --------------------------------------
- 
-    --  These parameters provide information about the target that is used
-    --  by the compiler. They are in the private part of System, where they
-    --  can be accessed using the special circuitry in the Targparm unit
-    --  whose source should be consulted for more detailed descriptions
-    --  of the individual switch values.
- 
-    Backend_Divide_Checks     : constant Boolean := False;
-    Backend_Overflow_Checks   : constant Boolean := False;
-    Command_Line_Args         : constant Boolean := True;
-    Configurable_Run_Time     : constant Boolean := False;
-    Denorm                    : constant Boolean := True;
-    Duration_32_Bits          : constant Boolean := False;
-    Exit_Status_Supported     : constant Boolean := True;
-    Fractional_Fixed_Ops      : constant Boolean := False;
-    Frontend_Layout           : constant Boolean := False;
-    Machine_Overflows         : constant Boolean := False;
-    Machine_Rounds            : constant Boolean := True;
-    Preallocated_Stacks       : constant Boolean := False;
-    Signed_Zeros              : constant Boolean := True;
-    Stack_Check_Default       : constant Boolean := False;
-    Stack_Check_Probes        : constant Boolean := True;
-    Stack_Check_Limits        : constant Boolean := False;
-    Support_64_Bit_Divides    : constant Boolean := True;
-    Support_Aggregates        : constant Boolean := True;
-    Support_Composite_Assign  : constant Boolean := True;
-    Support_Composite_Compare : constant Boolean := True;
-    Support_Long_Shifts       : constant Boolean := True;
-    Always_Compatible_Rep     : constant Boolean := False;
-    Suppress_Standard_Library : constant Boolean := False;
-    Use_Ada_Main_Program_Name : constant Boolean := False;
-    ZCX_By_Default            : constant Boolean := True;
- 
- end System;
--- 0 ----
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-s390.ads gcc-5.5.0/gcc/ada/system-linux-s390.ads
*** gcc-5.4.0/gcc/ada/system-linux-s390.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-linux-s390.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                          (GNU-Linux/s390 Version)                        --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                          (GNU-Linux/s390 Version)                        --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 138,144 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 138,144 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-s390x.ads gcc-5.5.0/gcc/ada/system-linux-s390x.ads
*** gcc-5.4.0/gcc/ada/system-linux-s390x.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-linux-s390x.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                          (GNU-Linux/s390x Version)                       --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                          (GNU-Linux/s390x Version)                       --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 138,144 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 138,144 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-sh4.ads gcc-5.5.0/gcc/ada/system-linux-sh4.ads
*** gcc-5.4.0/gcc/ada/system-linux-sh4.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-linux-sh4.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                         (GNU-Linux/sh4 Version)                          --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                         (GNU-Linux/sh4 Version)                          --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 146,152 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 146,152 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-sparc.ads gcc-5.5.0/gcc/ada/system-linux-sparc.ads
*** gcc-5.4.0/gcc/ada/system-linux-sparc.ads	Thu Oct 30 11:44:20 2014
--- gcc-5.5.0/gcc/ada/system-linux-sparc.ads	Sun Oct 16 14:05:04 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                          (GNU/Linux-SPARC Version)                       --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                          (GNU/Linux-SPARC Version)                       --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 138,144 ****
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 138,144 ----
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-linux-sparcv9.ads gcc-5.5.0/gcc/ada/system-linux-sparcv9.ads
*** gcc-5.4.0/gcc/ada/system-linux-sparcv9.ads	Fri May  6 09:12:09 2016
--- gcc-5.5.0/gcc/ada/system-linux-sparcv9.ads	Mon Oct 17 08:56:14 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                         (GNU/Linux-SPARCV9 Version)                      --
  --                                                                          --
! --          Copyright (C) 1992-2014, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                         (GNU/Linux-SPARCV9 Version)                      --
  --                                                                          --
! --          Copyright (C) 1992-2016, Free Software Foundation, Inc.         --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 119,125 ****
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := False;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
--- 119,125 ----
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := True;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
*************** private
*** 134,145 ****
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := True;
     Stack_Check_Limits        : constant Boolean := False;
-    Support_64_Bit_Divides    : constant Boolean := True;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
--- 134,144 ----
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := True;
     Stack_Check_Limits        : constant Boolean := False;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := True;
diff -Nrcpad gcc-5.4.0/gcc/ada/system-rtems.ads gcc-5.5.0/gcc/ada/system-rtems.ads
*** gcc-5.4.0/gcc/ada/system-rtems.ads	Fri May  6 09:12:09 2016
--- gcc-5.5.0/gcc/ada/system-rtems.ads	Mon Oct 17 08:56:14 2016
***************
*** 7,13 ****
  --                                 S p e c                                  --
  --                            (Compiler Version)                            --
  --                                                                          --
! --          Copyright (C) 1992-2014 Free Software Foundation, Inc.          --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
--- 7,13 ----
  --                                 S p e c                                  --
  --                            (Compiler Version)                            --
  --                                                                          --
! --          Copyright (C) 1992-2016 Free Software Foundation, Inc.          --
  --                                                                          --
  -- This specification is derived from the Ada Reference Manual for use with --
  -- GNAT. The copyright notice above, and the license provisions that follow --
*************** private
*** 138,144 ****
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := False;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
--- 138,144 ----
     --  of the individual switch values.
  
     Backend_Divide_Checks     : constant Boolean := False;
!    Backend_Overflow_Checks   : constant Boolean := True;
     Command_Line_Args         : constant Boolean := True;
     Configurable_Run_Time     : constant Boolean := False;
     Denorm                    : constant Boolean := True;
*************** private
*** 153,164 ****
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := False;
     Stack_Check_Limits        : constant Boolean := False;
-    Support_64_Bit_Divides    : constant Boolean := True;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := True;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := False;
--- 153,163 ----
     Stack_Check_Default       : constant Boolean := False;
     Stack_Check_Probes        : constant Boolean := False;
     Stack_Check_Limits        : constant Boolean := False;
     Support_Aggregates        : constant Boolean := True;
     Support_Composite_Assign  : constant Boolean := True;
     Support_Composite_Compare : constant Boolean := True;
     Support_Long_Shifts       : constant Boolean := True;
!    Always_Compatible_Rep     : constant Boolean := False;
     Suppress_Standard_Library : constant Boolean := False;
     Use_Ada_Main_Program_Name : constant Boolean := False;
     ZCX_By_Default            : constant Boolean := False;
diff -Nrcpad gcc-5.4.0/gcc/asan.c gcc-5.5.0/gcc/asan.c
*** gcc-5.4.0/gcc/asan.c	Wed Mar 11 07:39:20 2015
--- gcc-5.5.0/gcc/asan.c	Fri Sep 15 12:14:40 2017
*************** get_mem_refs_of_builtin_call (const gcal
*** 606,823 ****
      case BUILT_IN_STRLEN:
        source0 = gimple_call_arg (call, 0);
        len = gimple_call_lhs (call);
!       break ;
  
      /* And now the __atomic* and __sync builtins.
         These are handled differently from the classical memory memory
         access builtins above.  */
  
      case BUILT_IN_ATOMIC_LOAD_1:
-     case BUILT_IN_ATOMIC_LOAD_2:
-     case BUILT_IN_ATOMIC_LOAD_4:
-     case BUILT_IN_ATOMIC_LOAD_8:
-     case BUILT_IN_ATOMIC_LOAD_16:
        is_store = false;
!       /* fall through.  */
! 
      case BUILT_IN_SYNC_FETCH_AND_ADD_1:
-     case BUILT_IN_SYNC_FETCH_AND_ADD_2:
-     case BUILT_IN_SYNC_FETCH_AND_ADD_4:
-     case BUILT_IN_SYNC_FETCH_AND_ADD_8:
-     case BUILT_IN_SYNC_FETCH_AND_ADD_16:
- 
      case BUILT_IN_SYNC_FETCH_AND_SUB_1:
-     case BUILT_IN_SYNC_FETCH_AND_SUB_2:
-     case BUILT_IN_SYNC_FETCH_AND_SUB_4:
-     case BUILT_IN_SYNC_FETCH_AND_SUB_8:
-     case BUILT_IN_SYNC_FETCH_AND_SUB_16:
- 
      case BUILT_IN_SYNC_FETCH_AND_OR_1:
-     case BUILT_IN_SYNC_FETCH_AND_OR_2:
-     case BUILT_IN_SYNC_FETCH_AND_OR_4:
-     case BUILT_IN_SYNC_FETCH_AND_OR_8:
-     case BUILT_IN_SYNC_FETCH_AND_OR_16:
- 
      case BUILT_IN_SYNC_FETCH_AND_AND_1:
-     case BUILT_IN_SYNC_FETCH_AND_AND_2:
-     case BUILT_IN_SYNC_FETCH_AND_AND_4:
-     case BUILT_IN_SYNC_FETCH_AND_AND_8:
-     case BUILT_IN_SYNC_FETCH_AND_AND_16:
- 
      case BUILT_IN_SYNC_FETCH_AND_XOR_1:
-     case BUILT_IN_SYNC_FETCH_AND_XOR_2:
-     case BUILT_IN_SYNC_FETCH_AND_XOR_4:
-     case BUILT_IN_SYNC_FETCH_AND_XOR_8:
-     case BUILT_IN_SYNC_FETCH_AND_XOR_16:
- 
      case BUILT_IN_SYNC_FETCH_AND_NAND_1:
-     case BUILT_IN_SYNC_FETCH_AND_NAND_2:
-     case BUILT_IN_SYNC_FETCH_AND_NAND_4:
-     case BUILT_IN_SYNC_FETCH_AND_NAND_8:
- 
      case BUILT_IN_SYNC_ADD_AND_FETCH_1:
-     case BUILT_IN_SYNC_ADD_AND_FETCH_2:
-     case BUILT_IN_SYNC_ADD_AND_FETCH_4:
-     case BUILT_IN_SYNC_ADD_AND_FETCH_8:
-     case BUILT_IN_SYNC_ADD_AND_FETCH_16:
- 
      case BUILT_IN_SYNC_SUB_AND_FETCH_1:
-     case BUILT_IN_SYNC_SUB_AND_FETCH_2:
-     case BUILT_IN_SYNC_SUB_AND_FETCH_4:
-     case BUILT_IN_SYNC_SUB_AND_FETCH_8:
-     case BUILT_IN_SYNC_SUB_AND_FETCH_16:
- 
      case BUILT_IN_SYNC_OR_AND_FETCH_1:
-     case BUILT_IN_SYNC_OR_AND_FETCH_2:
-     case BUILT_IN_SYNC_OR_AND_FETCH_4:
-     case BUILT_IN_SYNC_OR_AND_FETCH_8:
-     case BUILT_IN_SYNC_OR_AND_FETCH_16:
- 
      case BUILT_IN_SYNC_AND_AND_FETCH_1:
-     case BUILT_IN_SYNC_AND_AND_FETCH_2:
-     case BUILT_IN_SYNC_AND_AND_FETCH_4:
-     case BUILT_IN_SYNC_AND_AND_FETCH_8:
-     case BUILT_IN_SYNC_AND_AND_FETCH_16:
- 
      case BUILT_IN_SYNC_XOR_AND_FETCH_1:
-     case BUILT_IN_SYNC_XOR_AND_FETCH_2:
-     case BUILT_IN_SYNC_XOR_AND_FETCH_4:
-     case BUILT_IN_SYNC_XOR_AND_FETCH_8:
-     case BUILT_IN_SYNC_XOR_AND_FETCH_16:
- 
      case BUILT_IN_SYNC_NAND_AND_FETCH_1:
-     case BUILT_IN_SYNC_NAND_AND_FETCH_2:
-     case BUILT_IN_SYNC_NAND_AND_FETCH_4:
-     case BUILT_IN_SYNC_NAND_AND_FETCH_8:
- 
      case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1:
-     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2:
-     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4:
-     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8:
-     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16:
- 
      case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1:
-     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2:
-     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4:
-     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8:
-     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16:
- 
      case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1:
-     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2:
-     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4:
-     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8:
-     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16:
- 
      case BUILT_IN_SYNC_LOCK_RELEASE_1:
-     case BUILT_IN_SYNC_LOCK_RELEASE_2:
-     case BUILT_IN_SYNC_LOCK_RELEASE_4:
-     case BUILT_IN_SYNC_LOCK_RELEASE_8:
-     case BUILT_IN_SYNC_LOCK_RELEASE_16:
- 
      case BUILT_IN_ATOMIC_EXCHANGE_1:
-     case BUILT_IN_ATOMIC_EXCHANGE_2:
-     case BUILT_IN_ATOMIC_EXCHANGE_4:
-     case BUILT_IN_ATOMIC_EXCHANGE_8:
-     case BUILT_IN_ATOMIC_EXCHANGE_16:
- 
      case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1:
-     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2:
-     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4:
-     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8:
-     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16:
- 
      case BUILT_IN_ATOMIC_STORE_1:
-     case BUILT_IN_ATOMIC_STORE_2:
-     case BUILT_IN_ATOMIC_STORE_4:
-     case BUILT_IN_ATOMIC_STORE_8:
-     case BUILT_IN_ATOMIC_STORE_16:
- 
      case BUILT_IN_ATOMIC_ADD_FETCH_1:
-     case BUILT_IN_ATOMIC_ADD_FETCH_2:
-     case BUILT_IN_ATOMIC_ADD_FETCH_4:
-     case BUILT_IN_ATOMIC_ADD_FETCH_8:
-     case BUILT_IN_ATOMIC_ADD_FETCH_16:
- 
      case BUILT_IN_ATOMIC_SUB_FETCH_1:
-     case BUILT_IN_ATOMIC_SUB_FETCH_2:
-     case BUILT_IN_ATOMIC_SUB_FETCH_4:
-     case BUILT_IN_ATOMIC_SUB_FETCH_8:
-     case BUILT_IN_ATOMIC_SUB_FETCH_16:
- 
      case BUILT_IN_ATOMIC_AND_FETCH_1:
-     case BUILT_IN_ATOMIC_AND_FETCH_2:
-     case BUILT_IN_ATOMIC_AND_FETCH_4:
-     case BUILT_IN_ATOMIC_AND_FETCH_8:
-     case BUILT_IN_ATOMIC_AND_FETCH_16:
- 
      case BUILT_IN_ATOMIC_NAND_FETCH_1:
-     case BUILT_IN_ATOMIC_NAND_FETCH_2:
-     case BUILT_IN_ATOMIC_NAND_FETCH_4:
-     case BUILT_IN_ATOMIC_NAND_FETCH_8:
-     case BUILT_IN_ATOMIC_NAND_FETCH_16:
- 
      case BUILT_IN_ATOMIC_XOR_FETCH_1:
-     case BUILT_IN_ATOMIC_XOR_FETCH_2:
-     case BUILT_IN_ATOMIC_XOR_FETCH_4:
-     case BUILT_IN_ATOMIC_XOR_FETCH_8:
-     case BUILT_IN_ATOMIC_XOR_FETCH_16:
- 
      case BUILT_IN_ATOMIC_OR_FETCH_1:
-     case BUILT_IN_ATOMIC_OR_FETCH_2:
-     case BUILT_IN_ATOMIC_OR_FETCH_4:
-     case BUILT_IN_ATOMIC_OR_FETCH_8:
-     case BUILT_IN_ATOMIC_OR_FETCH_16:
- 
      case BUILT_IN_ATOMIC_FETCH_ADD_1:
-     case BUILT_IN_ATOMIC_FETCH_ADD_2:
-     case BUILT_IN_ATOMIC_FETCH_ADD_4:
-     case BUILT_IN_ATOMIC_FETCH_ADD_8:
-     case BUILT_IN_ATOMIC_FETCH_ADD_16:
- 
      case BUILT_IN_ATOMIC_FETCH_SUB_1:
-     case BUILT_IN_ATOMIC_FETCH_SUB_2:
-     case BUILT_IN_ATOMIC_FETCH_SUB_4:
-     case BUILT_IN_ATOMIC_FETCH_SUB_8:
-     case BUILT_IN_ATOMIC_FETCH_SUB_16:
- 
      case BUILT_IN_ATOMIC_FETCH_AND_1:
-     case BUILT_IN_ATOMIC_FETCH_AND_2:
-     case BUILT_IN_ATOMIC_FETCH_AND_4:
-     case BUILT_IN_ATOMIC_FETCH_AND_8:
-     case BUILT_IN_ATOMIC_FETCH_AND_16:
- 
      case BUILT_IN_ATOMIC_FETCH_NAND_1:
-     case BUILT_IN_ATOMIC_FETCH_NAND_2:
-     case BUILT_IN_ATOMIC_FETCH_NAND_4:
-     case BUILT_IN_ATOMIC_FETCH_NAND_8:
-     case BUILT_IN_ATOMIC_FETCH_NAND_16:
- 
      case BUILT_IN_ATOMIC_FETCH_XOR_1:
-     case BUILT_IN_ATOMIC_FETCH_XOR_2:
-     case BUILT_IN_ATOMIC_FETCH_XOR_4:
-     case BUILT_IN_ATOMIC_FETCH_XOR_8:
-     case BUILT_IN_ATOMIC_FETCH_XOR_16:
- 
      case BUILT_IN_ATOMIC_FETCH_OR_1:
      case BUILT_IN_ATOMIC_FETCH_OR_2:
      case BUILT_IN_ATOMIC_FETCH_OR_4:
      case BUILT_IN_ATOMIC_FETCH_OR_8:
      case BUILT_IN_ATOMIC_FETCH_OR_16:
        {
  	dest = gimple_call_arg (call, 0);
  	/* DEST represents the address of a memory location.
  	   instrument_derefs wants the memory location, so lets
  	   dereference the address DEST before handing it to
  	   instrument_derefs.  */
! 	if (TREE_CODE (dest) == ADDR_EXPR)
! 	  dest = TREE_OPERAND (dest, 0);
! 	else if (TREE_CODE (dest) == SSA_NAME || TREE_CODE (dest) == INTEGER_CST)
! 	  dest = build2 (MEM_REF, TREE_TYPE (TREE_TYPE (dest)),
! 			 dest, build_int_cst (TREE_TYPE (dest), 0));
! 	else
! 	  gcc_unreachable ();
! 
! 	access_size = int_size_in_bytes (TREE_TYPE (dest));
        }
  
      default:
--- 606,813 ----
      case BUILT_IN_STRLEN:
        source0 = gimple_call_arg (call, 0);
        len = gimple_call_lhs (call);
!       break;
  
      /* And now the __atomic* and __sync builtins.
         These are handled differently from the classical memory memory
         access builtins above.  */
  
      case BUILT_IN_ATOMIC_LOAD_1:
        is_store = false;
!       /* FALLTHRU */
      case BUILT_IN_SYNC_FETCH_AND_ADD_1:
      case BUILT_IN_SYNC_FETCH_AND_SUB_1:
      case BUILT_IN_SYNC_FETCH_AND_OR_1:
      case BUILT_IN_SYNC_FETCH_AND_AND_1:
      case BUILT_IN_SYNC_FETCH_AND_XOR_1:
      case BUILT_IN_SYNC_FETCH_AND_NAND_1:
      case BUILT_IN_SYNC_ADD_AND_FETCH_1:
      case BUILT_IN_SYNC_SUB_AND_FETCH_1:
      case BUILT_IN_SYNC_OR_AND_FETCH_1:
      case BUILT_IN_SYNC_AND_AND_FETCH_1:
      case BUILT_IN_SYNC_XOR_AND_FETCH_1:
      case BUILT_IN_SYNC_NAND_AND_FETCH_1:
      case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1:
      case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1:
      case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1:
      case BUILT_IN_SYNC_LOCK_RELEASE_1:
      case BUILT_IN_ATOMIC_EXCHANGE_1:
      case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1:
      case BUILT_IN_ATOMIC_STORE_1:
      case BUILT_IN_ATOMIC_ADD_FETCH_1:
      case BUILT_IN_ATOMIC_SUB_FETCH_1:
      case BUILT_IN_ATOMIC_AND_FETCH_1:
      case BUILT_IN_ATOMIC_NAND_FETCH_1:
      case BUILT_IN_ATOMIC_XOR_FETCH_1:
      case BUILT_IN_ATOMIC_OR_FETCH_1:
      case BUILT_IN_ATOMIC_FETCH_ADD_1:
      case BUILT_IN_ATOMIC_FETCH_SUB_1:
      case BUILT_IN_ATOMIC_FETCH_AND_1:
      case BUILT_IN_ATOMIC_FETCH_NAND_1:
      case BUILT_IN_ATOMIC_FETCH_XOR_1:
      case BUILT_IN_ATOMIC_FETCH_OR_1:
+       access_size = 1;
+       goto do_atomic;
+ 
+     case BUILT_IN_ATOMIC_LOAD_2:
+       is_store = false;
+       /* FALLTHRU */
+     case BUILT_IN_SYNC_FETCH_AND_ADD_2:
+     case BUILT_IN_SYNC_FETCH_AND_SUB_2:
+     case BUILT_IN_SYNC_FETCH_AND_OR_2:
+     case BUILT_IN_SYNC_FETCH_AND_AND_2:
+     case BUILT_IN_SYNC_FETCH_AND_XOR_2:
+     case BUILT_IN_SYNC_FETCH_AND_NAND_2:
+     case BUILT_IN_SYNC_ADD_AND_FETCH_2:
+     case BUILT_IN_SYNC_SUB_AND_FETCH_2:
+     case BUILT_IN_SYNC_OR_AND_FETCH_2:
+     case BUILT_IN_SYNC_AND_AND_FETCH_2:
+     case BUILT_IN_SYNC_XOR_AND_FETCH_2:
+     case BUILT_IN_SYNC_NAND_AND_FETCH_2:
+     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2:
+     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2:
+     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2:
+     case BUILT_IN_SYNC_LOCK_RELEASE_2:
+     case BUILT_IN_ATOMIC_EXCHANGE_2:
+     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2:
+     case BUILT_IN_ATOMIC_STORE_2:
+     case BUILT_IN_ATOMIC_ADD_FETCH_2:
+     case BUILT_IN_ATOMIC_SUB_FETCH_2:
+     case BUILT_IN_ATOMIC_AND_FETCH_2:
+     case BUILT_IN_ATOMIC_NAND_FETCH_2:
+     case BUILT_IN_ATOMIC_XOR_FETCH_2:
+     case BUILT_IN_ATOMIC_OR_FETCH_2:
+     case BUILT_IN_ATOMIC_FETCH_ADD_2:
+     case BUILT_IN_ATOMIC_FETCH_SUB_2:
+     case BUILT_IN_ATOMIC_FETCH_AND_2:
+     case BUILT_IN_ATOMIC_FETCH_NAND_2:
+     case BUILT_IN_ATOMIC_FETCH_XOR_2:
      case BUILT_IN_ATOMIC_FETCH_OR_2:
+       access_size = 2;
+       goto do_atomic;
+ 
+     case BUILT_IN_ATOMIC_LOAD_4:
+       is_store = false;
+       /* FALLTHRU */
+     case BUILT_IN_SYNC_FETCH_AND_ADD_4:
+     case BUILT_IN_SYNC_FETCH_AND_SUB_4:
+     case BUILT_IN_SYNC_FETCH_AND_OR_4:
+     case BUILT_IN_SYNC_FETCH_AND_AND_4:
+     case BUILT_IN_SYNC_FETCH_AND_XOR_4:
+     case BUILT_IN_SYNC_FETCH_AND_NAND_4:
+     case BUILT_IN_SYNC_ADD_AND_FETCH_4:
+     case BUILT_IN_SYNC_SUB_AND_FETCH_4:
+     case BUILT_IN_SYNC_OR_AND_FETCH_4:
+     case BUILT_IN_SYNC_AND_AND_FETCH_4:
+     case BUILT_IN_SYNC_XOR_AND_FETCH_4:
+     case BUILT_IN_SYNC_NAND_AND_FETCH_4:
+     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4:
+     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4:
+     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4:
+     case BUILT_IN_SYNC_LOCK_RELEASE_4:
+     case BUILT_IN_ATOMIC_EXCHANGE_4:
+     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4:
+     case BUILT_IN_ATOMIC_STORE_4:
+     case BUILT_IN_ATOMIC_ADD_FETCH_4:
+     case BUILT_IN_ATOMIC_SUB_FETCH_4:
+     case BUILT_IN_ATOMIC_AND_FETCH_4:
+     case BUILT_IN_ATOMIC_NAND_FETCH_4:
+     case BUILT_IN_ATOMIC_XOR_FETCH_4:
+     case BUILT_IN_ATOMIC_OR_FETCH_4:
+     case BUILT_IN_ATOMIC_FETCH_ADD_4:
+     case BUILT_IN_ATOMIC_FETCH_SUB_4:
+     case BUILT_IN_ATOMIC_FETCH_AND_4:
+     case BUILT_IN_ATOMIC_FETCH_NAND_4:
+     case BUILT_IN_ATOMIC_FETCH_XOR_4:
      case BUILT_IN_ATOMIC_FETCH_OR_4:
+       access_size = 4;
+       goto do_atomic;
+ 
+     case BUILT_IN_ATOMIC_LOAD_8:
+       is_store = false;
+       /* FALLTHRU */
+     case BUILT_IN_SYNC_FETCH_AND_ADD_8:
+     case BUILT_IN_SYNC_FETCH_AND_SUB_8:
+     case BUILT_IN_SYNC_FETCH_AND_OR_8:
+     case BUILT_IN_SYNC_FETCH_AND_AND_8:
+     case BUILT_IN_SYNC_FETCH_AND_XOR_8:
+     case BUILT_IN_SYNC_FETCH_AND_NAND_8:
+     case BUILT_IN_SYNC_ADD_AND_FETCH_8:
+     case BUILT_IN_SYNC_SUB_AND_FETCH_8:
+     case BUILT_IN_SYNC_OR_AND_FETCH_8:
+     case BUILT_IN_SYNC_AND_AND_FETCH_8:
+     case BUILT_IN_SYNC_XOR_AND_FETCH_8:
+     case BUILT_IN_SYNC_NAND_AND_FETCH_8:
+     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8:
+     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8:
+     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8:
+     case BUILT_IN_SYNC_LOCK_RELEASE_8:
+     case BUILT_IN_ATOMIC_EXCHANGE_8:
+     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8:
+     case BUILT_IN_ATOMIC_STORE_8:
+     case BUILT_IN_ATOMIC_ADD_FETCH_8:
+     case BUILT_IN_ATOMIC_SUB_FETCH_8:
+     case BUILT_IN_ATOMIC_AND_FETCH_8:
+     case BUILT_IN_ATOMIC_NAND_FETCH_8:
+     case BUILT_IN_ATOMIC_XOR_FETCH_8:
+     case BUILT_IN_ATOMIC_OR_FETCH_8:
+     case BUILT_IN_ATOMIC_FETCH_ADD_8:
+     case BUILT_IN_ATOMIC_FETCH_SUB_8:
+     case BUILT_IN_ATOMIC_FETCH_AND_8:
+     case BUILT_IN_ATOMIC_FETCH_NAND_8:
+     case BUILT_IN_ATOMIC_FETCH_XOR_8:
      case BUILT_IN_ATOMIC_FETCH_OR_8:
+       access_size = 8;
+       goto do_atomic;
+ 
+     case BUILT_IN_ATOMIC_LOAD_16:
+       is_store = false;
+       /* FALLTHRU */
+     case BUILT_IN_SYNC_FETCH_AND_ADD_16:
+     case BUILT_IN_SYNC_FETCH_AND_SUB_16:
+     case BUILT_IN_SYNC_FETCH_AND_OR_16:
+     case BUILT_IN_SYNC_FETCH_AND_AND_16:
+     case BUILT_IN_SYNC_FETCH_AND_XOR_16:
+     case BUILT_IN_SYNC_FETCH_AND_NAND_16:
+     case BUILT_IN_SYNC_ADD_AND_FETCH_16:
+     case BUILT_IN_SYNC_SUB_AND_FETCH_16:
+     case BUILT_IN_SYNC_OR_AND_FETCH_16:
+     case BUILT_IN_SYNC_AND_AND_FETCH_16:
+     case BUILT_IN_SYNC_XOR_AND_FETCH_16:
+     case BUILT_IN_SYNC_NAND_AND_FETCH_16:
+     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16:
+     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16:
+     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16:
+     case BUILT_IN_SYNC_LOCK_RELEASE_16:
+     case BUILT_IN_ATOMIC_EXCHANGE_16:
+     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16:
+     case BUILT_IN_ATOMIC_STORE_16:
+     case BUILT_IN_ATOMIC_ADD_FETCH_16:
+     case BUILT_IN_ATOMIC_SUB_FETCH_16:
+     case BUILT_IN_ATOMIC_AND_FETCH_16:
+     case BUILT_IN_ATOMIC_NAND_FETCH_16:
+     case BUILT_IN_ATOMIC_XOR_FETCH_16:
+     case BUILT_IN_ATOMIC_OR_FETCH_16:
+     case BUILT_IN_ATOMIC_FETCH_ADD_16:
+     case BUILT_IN_ATOMIC_FETCH_SUB_16:
+     case BUILT_IN_ATOMIC_FETCH_AND_16:
+     case BUILT_IN_ATOMIC_FETCH_NAND_16:
+     case BUILT_IN_ATOMIC_FETCH_XOR_16:
      case BUILT_IN_ATOMIC_FETCH_OR_16:
+       access_size = 16;
+       /* FALLTHRU */
+     do_atomic:
        {
  	dest = gimple_call_arg (call, 0);
  	/* DEST represents the address of a memory location.
  	   instrument_derefs wants the memory location, so lets
  	   dereference the address DEST before handing it to
  	   instrument_derefs.  */
! 	tree type = build_nonstandard_integer_type (access_size
! 						    * BITS_PER_UNIT, 1);
! 	dest = build2 (MEM_REF, type, dest,
! 		       build_int_cst (build_pointer_type (char_type_node), 0));
! 	break;
        }
  
      default:
*************** instrument_derefs (gimple_stmt_iterator
*** 1803,1809 ****
        tree repr = DECL_BIT_FIELD_REPRESENTATIVE (TREE_OPERAND (t, 1));
        instrument_derefs (iter, build3 (COMPONENT_REF, TREE_TYPE (repr),
  				       TREE_OPERAND (t, 0), repr,
! 				       NULL_TREE), location, is_store);
        return;
      }
  
--- 1793,1800 ----
        tree repr = DECL_BIT_FIELD_REPRESENTATIVE (TREE_OPERAND (t, 1));
        instrument_derefs (iter, build3 (COMPONENT_REF, TREE_TYPE (repr),
  				       TREE_OPERAND (t, 0), repr,
! 				       TREE_OPERAND (t, 2)),
! 			 location, is_store);
        return;
      }
  
*************** instrument_derefs (gimple_stmt_iterator
*** 1811,1816 ****
--- 1802,1810 ----
        || bitsize != size_in_bytes * BITS_PER_UNIT)
      return;
  
+   if (TREE_CODE (inner) == VAR_DECL && DECL_HARD_REGISTER (inner))
+     return;
+ 
    if (TREE_CODE (inner) == VAR_DECL
        && offset == NULL_TREE
        && bitpos >= 0
*************** transform_statements (void)
*** 2129,2134 ****
--- 2123,2131 ----
  tree
  asan_dynamic_init_call (bool after_p)
  {
+   if (shadow_ptr_types[0] == NULL_TREE)
+     asan_init_shadow_ptr_types ();
+ 
    tree fn = builtin_decl_implicit (after_p
  				   ? BUILT_IN_ASAN_AFTER_DYNAMIC_INIT
  				   : BUILT_IN_ASAN_BEFORE_DYNAMIC_INIT);
*************** asan_dynamic_init_call (bool after_p)
*** 2138,2145 ****
        pretty_printer module_name_pp;
        pp_string (&module_name_pp, main_input_filename);
  
-       if (shadow_ptr_types[0] == NULL_TREE)
- 	asan_init_shadow_ptr_types ();
        module_name_cst = asan_pp_string (&module_name_pp);
        module_name_cst = fold_convert (const_ptr_type_node,
  				      module_name_cst);
--- 2135,2140 ----
*************** asan_add_global (tree decl, tree type, v
*** 2244,2250 ****
    CONSTRUCTOR_APPEND_ELT (vinner, NULL_TREE,
  			  fold_convert (const_ptr_type_node, module_name_cst));
    varpool_node *vnode = varpool_node::get (decl);
!   int has_dynamic_init = vnode ? vnode->dynamically_initialized : 0;
    CONSTRUCTOR_APPEND_ELT (vinner, NULL_TREE,
  			  build_int_cst (uptr, has_dynamic_init));
    tree locptr = NULL_TREE;
--- 2239,2249 ----
    CONSTRUCTOR_APPEND_ELT (vinner, NULL_TREE,
  			  fold_convert (const_ptr_type_node, module_name_cst));
    varpool_node *vnode = varpool_node::get (decl);
!   int has_dynamic_init = 0;
!   /* FIXME: Enable initialization order fiasco detection in LTO mode once
!      proper fix for PR 79061 will be applied.  */
!   if (!in_lto_p)
!     has_dynamic_init = vnode ? vnode->dynamically_initialized : 0;
    CONSTRUCTOR_APPEND_ELT (vinner, NULL_TREE,
  			  build_int_cst (uptr, has_dynamic_init));
    tree locptr = NULL_TREE;
diff -Nrcpad gcc-5.4.0/gcc/auto-profile.c gcc-5.5.0/gcc/auto-profile.c
*** gcc-5.4.0/gcc/auto-profile.c	Sun Jan 18 02:25:42 2015
--- gcc-5.5.0/gcc/auto-profile.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 19,30 ****
  <http://www.gnu.org/licenses/>.  */
  
  #include "config.h"
  #include "system.h"
  
- #include <string.h>
- #include <map>
- #include <set>
- 
  #include "coretypes.h"
  #include "hash-set.h"
  #include "machmode.h"
--- 19,28 ----
  <http://www.gnu.org/licenses/>.  */
  
  #include "config.h"
+ #define INCLUDE_MAP
+ #define INCLUDE_SET
  #include "system.h"
  
  #include "coretypes.h"
  #include "hash-set.h"
  #include "machmode.h"
*************** get_function_decl_from_block (tree block
*** 390,396 ****
  {
    tree decl;
  
!   if (LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block) == UNKNOWN_LOCATION))
      return NULL_TREE;
  
    for (decl = BLOCK_ABSTRACT_ORIGIN (block);
--- 388,394 ----
  {
    tree decl;
  
!   if (LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) == UNKNOWN_LOCATION)
      return NULL_TREE;
  
    for (decl = BLOCK_ABSTRACT_ORIGIN (block);
*************** afdo_vpt_for_early_inline (stmt_set *pro
*** 1469,1475 ****
  
    if (has_vpt)
      {
!       optimize_inline_calls (current_function_decl);
        return true;
      }
  
--- 1467,1475 ----
  
    if (has_vpt)
      {
!       unsigned todo = optimize_inline_calls (current_function_decl);
!       if (todo & TODO_update_ssa_any)
!        update_ssa (TODO_update_ssa);
        return true;
      }
  
diff -Nrcpad gcc-5.4.0/gcc/bb-reorder.c gcc-5.5.0/gcc/bb-reorder.c
*** gcc-5.4.0/gcc/bb-reorder.c	Wed Feb 24 12:55:31 2016
--- gcc-5.5.0/gcc/bb-reorder.c	Sat Sep 16 18:38:01 2017
*************** pass_partition_blocks::execute (function
*** 2744,2750 ****
  
    crossing_edges = find_rarely_executed_basic_blocks_and_crossing_edges ();
    if (!crossing_edges.exists ())
!     return 0;
  
    crtl->has_bb_partition = true;
  
--- 2744,2751 ----
  
    crossing_edges = find_rarely_executed_basic_blocks_and_crossing_edges ();
    if (!crossing_edges.exists ())
!     /* Make sure to process deferred rescans and clear changeable df flags.  */
!     return TODO_df_finish;
  
    crtl->has_bb_partition = true;
  
*************** pass_partition_blocks::execute (function
*** 2810,2816 ****
        df_analyze ();
      }
  
!   return 0;
  }
  
  } // anon namespace
--- 2811,2818 ----
        df_analyze ();
      }
  
!   /* Make sure to process deferred rescans and clear changeable df flags.  */
!   return TODO_df_finish;
  }
  
  } // anon namespace
diff -Nrcpad gcc-5.4.0/gcc/builtins.c gcc-5.5.0/gcc/builtins.c
*** gcc-5.4.0/gcc/builtins.c	Mon Apr 11 13:46:51 2016
--- gcc-5.5.0/gcc/builtins.c	Tue Jun 27 18:24:51 2017
*************** expand_builtin_atomic_fetch_op (machine_
*** 5594,5599 ****
--- 5594,5605 ----
    gcc_assert (TREE_OPERAND (addr, 0) == fndecl);
    TREE_OPERAND (addr, 0) = builtin_decl_explicit (ext_call);
  
+   /* If we will emit code after the call, the call can not be a tail call.
+      If it is emitted as a tail call, a barrier is emitted after it, and
+      then all trailing code is removed.  */
+   if (!ignore)
+     CALL_EXPR_TAILCALL (exp) = 0;
+ 
    /* Expand the call here so we can emit trailing code.  */
    ret = expand_call (exp, target, ignore);
  
*************** fold_builtin_atomic_always_lock_free (tr
*** 5719,5726 ****
  	 end before anything else has a chance to look at it.  The pointer
  	 parameter at this point is usually cast to a void *, so check for that
  	 and look past the cast.  */
!       if (CONVERT_EXPR_P (arg1) && POINTER_TYPE_P (ttype)
! 	  && VOID_TYPE_P (TREE_TYPE (ttype)))
  	arg1 = TREE_OPERAND (arg1, 0);
  
        ttype = TREE_TYPE (arg1);
--- 5725,5734 ----
  	 end before anything else has a chance to look at it.  The pointer
  	 parameter at this point is usually cast to a void *, so check for that
  	 and look past the cast.  */
!       if (CONVERT_EXPR_P (arg1)
! 	  && POINTER_TYPE_P (ttype)
! 	  && VOID_TYPE_P (TREE_TYPE (ttype))
! 	  && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (arg1, 0))))
  	arg1 = TREE_OPERAND (arg1, 0);
  
        ttype = TREE_TYPE (arg1);
diff -Nrcpad gcc-5.4.0/gcc/c/ChangeLog gcc-5.5.0/gcc/c/ChangeLog
*** gcc-5.4.0/gcc/c/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/c/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,57 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-06-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/81006
+ 	* c-typeck.c (handle_omp_array_sections_1): Convert TYPE_MAX_VALUE
+ 	to sizetype before size_binop.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-03-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/80097
+ 	* c-typeck.c (build_binary_op): Add EXCESS_PRECISION_EXPR only around
+ 	optional COMPOUND_EXPR with ubsan instrumentation.
+ 
+ 	2017-02-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/79512
+ 	* c-parser.c (c_parser_omp_target): For -fopenmp-simd
+ 	ignore #pragma omp target even when not followed by identifier.
+ 
+ 	2016-12-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/77767
+ 	* c-decl.c (grokdeclarator): If *expr is non-NULL, append expression
+ 	to *expr instead of overwriting it.
+ 
+ 	2016-08-12  Jakub Jelinek  <jakub@redhat.com>
+ 		    Martin Liska  <mliska@suse.cz>
+ 
+ 	PR c/67410
+ 	* c-typeck.c (set_nonincremental_init_from_string): Use / instead of
+ 	% to determine val element to change.  Assert that
+ 	wchar_bytes * charwidth fits into val array.
+ 
+ 	2016-08-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/72816
+ 	* c-decl.c (grokdeclarator): When adding TYPE_DOMAIN for flexible
+ 	array member through typedef, for orig_qual_indirect == 0 clear
+ 	orig_qual_type.
+ 
+ 2016-11-05  Martin Sebor  <msebor@redhat.com>
+ 
+ 	Backport from trunk.
+ 	PR c/71115
+ 	* c-typeck.c (error_init): Use
+ 	expansion_point_location_if_in_system_header.
+ 	(warning_init): Same.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/c/c-decl.c gcc-5.5.0/gcc/c/c-decl.c
*** gcc-5.4.0/gcc/c/c-decl.c	Mon Apr 18 15:21:52 2016
--- gcc-5.5.0/gcc/c/c-decl.c	Tue May 30 07:51:58 2017
*************** grokdeclarator (const struct c_declarato
*** 5409,5419 ****
    if (TREE_CODE (type) == ERROR_MARK)
      return error_mark_node;
    if (expr == NULL)
!     expr = &expr_dummy;
    if (expr_const_operands == NULL)
      expr_const_operands = &expr_const_operands_dummy;
  
!   *expr = declspecs->expr;
    *expr_const_operands = declspecs->expr_const_operands;
  
    if (decl_context == FUNCDEF)
--- 5409,5429 ----
    if (TREE_CODE (type) == ERROR_MARK)
      return error_mark_node;
    if (expr == NULL)
!     {
!       expr = &expr_dummy;
!       expr_dummy = NULL_TREE;
!     }
    if (expr_const_operands == NULL)
      expr_const_operands = &expr_const_operands_dummy;
  
!   if (declspecs->expr)
!     {
!       if (*expr)
! 	*expr = build2 (COMPOUND_EXPR, TREE_TYPE (declspecs->expr), *expr,
! 			declspecs->expr);
!       else
! 	*expr = declspecs->expr;
!     }
    *expr_const_operands = declspecs->expr_const_operands;
  
    if (decl_context == FUNCDEF)
*************** grokdeclarator (const struct c_declarato
*** 6572,6577 ****
--- 6582,6589 ----
  	    type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
  	    TYPE_DOMAIN (type) = build_range_type (sizetype, size_zero_node,
  						   NULL_TREE);
+ 	    if (orig_qual_indirect == 0)
+ 	      orig_qual_type = NULL_TREE;
  	  }
  	type = c_build_qualified_type (type, type_quals, orig_qual_type,
  				       orig_qual_indirect);
diff -Nrcpad gcc-5.4.0/gcc/c/c-objc-common.c gcc-5.5.0/gcc/c/c-objc-common.c
*** gcc-5.4.0/gcc/c/c-objc-common.c	Fri Jan  9 20:18:42 2015
--- gcc-5.5.0/gcc/c/c-objc-common.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 38,45 ****
  #include "langhooks.h"
  #include "c-objc-common.h"
  
- #include <new>                          // For placement new.
- 
  static bool c_tree_printer (pretty_printer *, text_info *, const char *,
  			    int, bool, bool, bool);
  
--- 38,43 ----
diff -Nrcpad gcc-5.4.0/gcc/c/c-parser.c gcc-5.5.0/gcc/c/c-parser.c
*** gcc-5.4.0/gcc/c/c-parser.c	Wed Feb 17 13:10:59 2016
--- gcc-5.5.0/gcc/c/c-parser.c	Tue May 30 07:58:55 2017
*************** c_parser_omp_target (c_parser *parser, e
*** 13980,13985 ****
--- 13980,13990 ----
  	}
      }
  
+   if (!flag_openmp) /* flag_openmp_simd  */
+     {
+       c_parser_skip_to_pragma_eol (parser, false);
+       return false;
+     }
    tree stmt = make_node (OMP_TARGET);
    TREE_TYPE (stmt) = void_type_node;
  
diff -Nrcpad gcc-5.4.0/gcc/c/c-typeck.c gcc-5.5.0/gcc/c/c-typeck.c
*** gcc-5.4.0/gcc/c/c-typeck.c	Wed Feb 17 13:10:59 2016
--- gcc-5.5.0/gcc/c/c-typeck.c	Thu Jun  8 19:23:34 2017
*************** error_init (location_t loc, const char *
*** 5632,5647 ****
     component name is taken from the spelling stack.  */
  
  static void
! pedwarn_init (location_t location, int opt, const char *gmsgid)
  {
    char *ofwhat;
    bool warned;
  
    /* The gmsgid may be a format string with %< and %>. */
!   warned = pedwarn (location, opt, gmsgid);
    ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
    if (*ofwhat && warned)
!     inform (location, "(near initialization for %qs)", ofwhat);
  }
  
  /* Issue a warning for a bad initializer component.
--- 5632,5652 ----
     component name is taken from the spelling stack.  */
  
  static void
! pedwarn_init (location_t loc, int opt, const char *gmsgid)
  {
    char *ofwhat;
    bool warned;
  
+   /* Use the location where a macro was expanded rather than where
+      it was defined to make sure macros defined in system headers
+      but used incorrectly elsewhere are diagnosed.  */
+   source_location exploc = expansion_point_location_if_in_system_header (loc);
+ 
    /* The gmsgid may be a format string with %< and %>. */
!   warned = pedwarn (exploc, opt, gmsgid);
    ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
    if (*ofwhat && warned)
!     inform (exploc, "(near initialization for %qs)", ofwhat);
  }
  
  /* Issue a warning for a bad initializer component.
*************** warning_init (location_t loc, int opt, c
*** 5656,5666 ****
    char *ofwhat;
    bool warned;
  
    /* The gmsgid may be a format string with %< and %>. */
!   warned = warning_at (loc, opt, gmsgid);
    ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
    if (*ofwhat && warned)
!     inform (loc, "(near initialization for %qs)", ofwhat);
  }
  
  /* If TYPE is an array type and EXPR is a parenthesized string
--- 5661,5676 ----
    char *ofwhat;
    bool warned;
  
+   /* Use the location where a macro was expanded rather than where
+      it was defined to make sure macros defined in system headers
+      but used incorrectly elsewhere are diagnosed.  */
+   source_location exploc = expansion_point_location_if_in_system_header (loc);
+ 
    /* The gmsgid may be a format string with %< and %>. */
!   warned = warning_at (exploc, opt, gmsgid);
    ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
    if (*ofwhat && warned)
!     inform (exploc, "(near initialization for %qs)", ofwhat);
  }
  
  /* If TYPE is an array type and EXPR is a parenthesized string
*************** set_nonincremental_init_from_string (tre
*** 8238,8243 ****
--- 8248,8255 ----
  
    wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
    charwidth = TYPE_PRECISION (char_type_node);
+   gcc_assert ((size_t) wchar_bytes * charwidth
+ 	      <= ARRAY_SIZE (val) * HOST_BITS_PER_WIDE_INT);
    type = TREE_TYPE (constructor_type);
    p = TREE_STRING_POINTER (str);
    end = p + TREE_STRING_LENGTH (str);
*************** set_nonincremental_init_from_string (tre
*** 8263,8269 ****
  		bitpos = (wchar_bytes - byte - 1) * charwidth;
  	      else
  		bitpos = byte * charwidth;
! 	      val[bitpos % HOST_BITS_PER_WIDE_INT]
  		|= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
  		   << (bitpos % HOST_BITS_PER_WIDE_INT);
  	    }
--- 8275,8281 ----
  		bitpos = (wchar_bytes - byte - 1) * charwidth;
  	      else
  		bitpos = byte * charwidth;
! 	      val[bitpos / HOST_BITS_PER_WIDE_INT]
  		|= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
  		   << (bitpos % HOST_BITS_PER_WIDE_INT);
  	    }
*************** build_binary_op (location_t location, en
*** 11326,11339 ****
    else if (TREE_CODE (ret) != INTEGER_CST && int_operands
  	   && !in_late_binary_op)
      ret = note_integer_operands (ret);
-   if (semantic_result_type)
-     ret = build1 (EXCESS_PRECISION_EXPR, semantic_result_type, ret);
    protected_set_expr_location (ret, location);
  
    if (instrument_expr != NULL)
      ret = fold_build2 (COMPOUND_EXPR, TREE_TYPE (ret),
  		       instrument_expr, ret);
  
    return ret;
  }
  
--- 11338,11353 ----
    else if (TREE_CODE (ret) != INTEGER_CST && int_operands
  	   && !in_late_binary_op)
      ret = note_integer_operands (ret);
    protected_set_expr_location (ret, location);
  
    if (instrument_expr != NULL)
      ret = fold_build2 (COMPOUND_EXPR, TREE_TYPE (ret),
  		       instrument_expr, ret);
  
+   if (semantic_result_type)
+     ret = build1_loc (location, EXCESS_PRECISION_EXPR,
+ 		      semantic_result_type, ret);
+ 
    return ret;
  }
  
*************** handle_omp_array_sections_1 (tree c, tre
*** 11740,11748 ****
  	  && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))
  			== INTEGER_CST)
  	{
! 	  tree size = size_binop (PLUS_EXPR,
! 				  TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
! 				  size_one_node);
  	  if (TREE_CODE (low_bound) == INTEGER_CST)
  	    {
  	      if (tree_int_cst_lt (size, low_bound))
--- 11754,11762 ----
  	  && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))
  			== INTEGER_CST)
  	{
! 	  tree size
! 	    = fold_convert (sizetype, TYPE_MAX_VALUE (TYPE_DOMAIN (type)));
! 	  size = size_binop (PLUS_EXPR, size, size_one_node);
  	  if (TREE_CODE (low_bound) == INTEGER_CST)
  	    {
  	      if (tree_int_cst_lt (size, low_bound))
diff -Nrcpad gcc-5.4.0/gcc/c-family/ChangeLog gcc-5.5.0/gcc/c-family/ChangeLog
*** gcc-5.4.0/gcc/c-family/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/c-family/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,101 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-09-12  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/82112
+ 	* c-common.c (sync_resolve_size): Instead of c_dialect_cxx ()
+ 	assertion check that in the condition.
+ 	(get_atomic_generic_size): Likewise.  Before testing if parameter
+ 	has pointer type, if it has array type, call for C++
+ 	default_conversion to perform array-to-pointer conversion.
+ 
+ 	2017-07-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/45784
+ 	* c-omp.c (c_finish_omp_for): If the condition is wrapped in
+ 	rhs of COMPOUND_EXPR(s), skip them and readd their lhs into
+ 	new COMPOUND_EXPRs around the rhs of the comparison.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-06-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/81128
+ 	* c-attribs.c (handle_alias_ifunc_attribute): Append ifunc alias
+ 	to a function declaration.
+ 
+ 2017-09-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR c++/81852
+ 	* c-cppbuiltin.c (c_cpp_builtins): Define __cpp_threadsafe_static_init.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-02-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/79641
+ 	* c-common.c (handle_mode_attribute): Use build_qualified_type to
+ 	preserve quals.
+ 
+ 2017-05-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	PR c/79756
+ 	* c-common.c (c_common_mark_addressable_vec): Look through
+ 	C_MAYBE_CONST_EXPR.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-09  Martin Liska  <mliska@suse.cz>
+ 
+ 	* c-ada-spec.c (macro_length): Increment value instead of a pointer.
+ 
+ 2017-03-21  Martin Sebor  <msebor@redhat.com>
+ 
+ 	PR c++/79548
+ 	* c-common.c (set_underlying_type): Mark type used only when
+ 	original del is declared unused.
+ 
+ 2017-01-24  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-09-06  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR c/77450
+ 	* c-common.c (c_common_mark_addressable_vec): Handle
+ 	COMPOUND_LITERAL_EXPR.
+ 
+ 2017-01-10  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-01-05  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR pch/78970
+ 	* c-opts.c (c_common_post_options): Reject '-' filename for a precompiled
+ 	header.
+ 
+ 2016-07-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-06-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/71498
+ 	* c-gimplify.c (ubsan_walk_array_refs_r): Set *walk_subtrees = 0 on
+ 	all BIND_EXPRs, and on all BIND_EXPRs recurse also on BIND_EXPR_BODY.
+ 
+ 2016-07-05  Markus Trippelsdorf  <markus@trippelsdorf.de>
+ 
+ 	PR c++/71214
+ 	* c-cppbuiltin.c (c_cpp_builtins): Define __cpp_rvalue_references.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/c-family/c-ada-spec.c gcc-5.5.0/gcc/c-family/c-ada-spec.c
*** gcc-5.4.0/gcc/c-family/c-ada-spec.c	Tue Apr 28 08:54:28 2015
--- gcc-5.5.0/gcc/c-family/c-ada-spec.c	Wed Mar 22 12:29:07 2017
*************** macro_length (const cpp_macro *macro, in
*** 85,91 ****
  
    if (macro->fun_like)
      {
!       param_len++;
        for (i = 0; i < macro->paramc; i++)
  	{
  	  cpp_hashnode *param = macro->params[i];
--- 85,91 ----
  
    if (macro->fun_like)
      {
!       (*param_len)++;
        for (i = 0; i < macro->paramc; i++)
  	{
  	  cpp_hashnode *param = macro->params[i];
diff -Nrcpad gcc-5.4.0/gcc/c-family/c-common.c gcc-5.5.0/gcc/c-family/c-common.c
*** gcc-5.4.0/gcc/c-family/c-common.c	Wed Mar 30 12:29:47 2016
--- gcc-5.5.0/gcc/c-family/c-common.c	Tue Sep 19 08:12:35 2017
*************** handle_mode_attribute (tree *node, tree
*** 7561,7567 ****
  	  return NULL_TREE;
  	}
  
!       *node = typefm;
      }
  
    return NULL_TREE;
--- 7561,7567 ----
  	  return NULL_TREE;
  	}
  
!       *node = build_qualified_type (typefm, TYPE_QUALS (type));
      }
  
    return NULL_TREE;
*************** handle_alias_ifunc_attribute (bool is_al
*** 7940,7948 ****
  	TREE_STATIC (decl) = 1;
  
        if (!is_alias)
! 	/* ifuncs are also aliases, so set that attribute too. */
! 	DECL_ATTRIBUTES (decl)
! 	  = tree_cons (get_identifier ("alias"), args, DECL_ATTRIBUTES (decl));
      }
    else
      {
--- 7940,7953 ----
  	TREE_STATIC (decl) = 1;
  
        if (!is_alias)
! 	{
! 	  /* ifuncs are also aliases, so set that attribute too.  */
! 	  DECL_ATTRIBUTES (decl)
! 	    = tree_cons (get_identifier ("alias"), args,
! 			 DECL_ATTRIBUTES (decl));
! 	  DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("ifunc"),
! 					      NULL, DECL_ATTRIBUTES (decl));
! 	}
      }
    else
      {
*************** parse_optimize_options (tree args, bool
*** 9321,9327 ****
    bool ret = true;
    unsigned opt_argc;
    unsigned i;
-   int saved_flag_strict_aliasing;
    const char **opt_argv;
    struct cl_decoded_option *decoded_options;
    unsigned int decoded_options_count;
--- 9326,9331 ----
*************** parse_optimize_options (tree args, bool
*** 9414,9421 ****
    for (i = 1; i < opt_argc; i++)
      opt_argv[i] = (*optimize_args)[i];
  
-   saved_flag_strict_aliasing = flag_strict_aliasing;
- 
    /* Now parse the options.  */
    decode_cmdline_options_to_array_default_mask (opt_argc, opt_argv,
  						&decoded_options,
--- 9418,9423 ----
*************** parse_optimize_options (tree args, bool
*** 9426,9434 ****
  
    targetm.override_options_after_change();
  
-   /* Don't allow changing -fstrict-aliasing.  */
-   flag_strict_aliasing = saved_flag_strict_aliasing;
- 
    optimize_args->truncate (0);
    return ret;
  }
--- 9428,9433 ----
*************** complete_array_type (tree *ptype, tree i
*** 10479,10487 ****
  void 
  c_common_mark_addressable_vec (tree t)
  {   
    while (handled_component_p (t))
      t = TREE_OPERAND (t, 0);
!   if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
      return;
    TREE_ADDRESSABLE (t) = 1;
  }
--- 10478,10490 ----
  void 
  c_common_mark_addressable_vec (tree t)
  {   
+   if (TREE_CODE (t) == C_MAYBE_CONST_EXPR)
+     t = C_MAYBE_CONST_EXPR_EXPR (t);
    while (handled_component_p (t))
      t = TREE_OPERAND (t, 0);
!   if (!VAR_P (t)
!       && TREE_CODE (t) != PARM_DECL
!       && TREE_CODE (t) != COMPOUND_LITERAL_EXPR)
      return;
    TREE_ADDRESSABLE (t) = 1;
  }
*************** sync_resolve_size (tree function, vec<tr
*** 10518,10527 ****
      }
  
    type = TREE_TYPE ((*params)[0]);
!   if (TREE_CODE (type) == ARRAY_TYPE)
      {
        /* Force array-to-pointer decay for C++.  */
-       gcc_assert (c_dialect_cxx());
        (*params)[0] = default_conversion ((*params)[0]);
        type = TREE_TYPE ((*params)[0]);
      }
--- 10521,10529 ----
      }
  
    type = TREE_TYPE ((*params)[0]);
!   if (TREE_CODE (type) == ARRAY_TYPE && c_dialect_cxx ())
      {
        /* Force array-to-pointer decay for C++.  */
        (*params)[0] = default_conversion ((*params)[0]);
        type = TREE_TYPE ((*params)[0]);
      }
*************** get_atomic_generic_size (location_t loc,
*** 10676,10685 ****
  
    /* Get type of first parameter, and determine its size.  */
    type_0 = TREE_TYPE ((*params)[0]);
!   if (TREE_CODE (type_0) == ARRAY_TYPE)
      {
        /* Force array-to-pointer decay for C++.  */
-       gcc_assert (c_dialect_cxx());
        (*params)[0] = default_conversion ((*params)[0]);
        type_0 = TREE_TYPE ((*params)[0]);
      }
--- 10678,10686 ----
  
    /* Get type of first parameter, and determine its size.  */
    type_0 = TREE_TYPE ((*params)[0]);
!   if (TREE_CODE (type_0) == ARRAY_TYPE && c_dialect_cxx ())
      {
        /* Force array-to-pointer decay for C++.  */
        (*params)[0] = default_conversion ((*params)[0]);
        type_0 = TREE_TYPE ((*params)[0]);
      }
*************** get_atomic_generic_size (location_t loc,
*** 10718,10723 ****
--- 10719,10730 ----
        /* __atomic_compare_exchange has a bool in the 4th position, skip it.  */
        if (n_param == 6 && x == 3)
          continue;
+       if (TREE_CODE (type) == ARRAY_TYPE && c_dialect_cxx ())
+ 	{
+ 	  /* Force array-to-pointer decay for C++.  */
+ 	  (*params)[x] = default_conversion ((*params)[x]);
+ 	  type = TREE_TYPE ((*params)[x]);
+ 	}
        if (!POINTER_TYPE_P (type))
  	{
  	  error_at (loc, "argument %d of %qE must be a pointer type", x + 1,
*************** set_underlying_type (tree x)
*** 11775,11781 ****
        tt = build_variant_type_copy (tt);
        TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
        TYPE_NAME (tt) = x;
!       TREE_USED (tt) = TREE_USED (x);
        TREE_TYPE (x) = tt;
      }
  }
--- 11782,11793 ----
        tt = build_variant_type_copy (tt);
        TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
        TYPE_NAME (tt) = x;
! 
!       /* Mark the type as used only when its type decl is decorated
! 	 with attribute unused.  */
!       if (lookup_attribute ("unused", DECL_ATTRIBUTES (x)))
! 	TREE_USED (tt) = 1;
! 
        TREE_TYPE (x) = tt;
      }
  }
diff -Nrcpad gcc-5.4.0/gcc/c-family/c-cppbuiltin.c gcc-5.5.0/gcc/c-family/c-cppbuiltin.c
*** gcc-5.4.0/gcc/c-family/c-cppbuiltin.c	Fri Feb 13 05:26:37 2015
--- gcc-5.5.0/gcc/c-family/c-cppbuiltin.c	Mon Sep 11 10:44:11 2017
*************** c_cpp_builtins (cpp_reader *pfile)
*** 856,861 ****
--- 856,862 ----
  	  cpp_define (pfile, "__cpp_decltype=200707");
  	  cpp_define (pfile, "__cpp_attributes=200809");
  	  cpp_define (pfile, "__cpp_rvalue_reference=200610");
+ 	  cpp_define (pfile, "__cpp_rvalue_references=200610");
  	  cpp_define (pfile, "__cpp_variadic_templates=200704");
  	  cpp_define (pfile, "__cpp_initializer_lists=200806");
  	  cpp_define (pfile, "__cpp_delegating_constructors=200604");
*************** c_cpp_builtins (cpp_reader *pfile)
*** 878,883 ****
--- 879,886 ----
  	}
        if (flag_sized_deallocation)
  	cpp_define (pfile, "__cpp_sized_deallocation=201309");
+       if (flag_threadsafe_statics)
+ 	cpp_define (pfile, "__cpp_threadsafe_static_init=200806");
      }
    /* Note that we define this for C as well, so that we know if
       __attribute__((cleanup)) will interface with EH.  */
diff -Nrcpad gcc-5.4.0/gcc/c-family/c-gimplify.c gcc-5.5.0/gcc/c-family/c-gimplify.c
*** gcc-5.4.0/gcc/c-family/c-gimplify.c	Fri Jan  9 20:18:42 2015
--- gcc-5.5.0/gcc/c-family/c-gimplify.c	Thu Jul  7 12:42:43 2016
*************** ubsan_walk_array_refs_r (tree *tp, int *
*** 96,118 ****
  {
    hash_set<tree> *pset = (hash_set<tree> *) data;
  
-   /* Since walk_tree doesn't call the callback function on the decls
-      in BIND_EXPR_VARS, we have to walk them manually.  */
    if (TREE_CODE (*tp) == BIND_EXPR)
      {
        for (tree decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
  	{
  	  if (TREE_STATIC (decl))
! 	    {
! 	      *walk_subtrees = 0;
! 	      continue;
! 	    }
  	  walk_tree (&DECL_INITIAL (decl), ubsan_walk_array_refs_r, pset,
  		     pset);
  	  walk_tree (&DECL_SIZE (decl), ubsan_walk_array_refs_r, pset, pset);
  	  walk_tree (&DECL_SIZE_UNIT (decl), ubsan_walk_array_refs_r, pset,
  		     pset);
  	}
      }
    else if (TREE_CODE (*tp) == ADDR_EXPR
  	   && TREE_CODE (TREE_OPERAND (*tp, 0)) == ARRAY_REF)
--- 96,118 ----
  {
    hash_set<tree> *pset = (hash_set<tree> *) data;
  
    if (TREE_CODE (*tp) == BIND_EXPR)
      {
+       /* Since walk_tree doesn't call the callback function on the decls
+ 	 in BIND_EXPR_VARS, we have to walk them manually, so we can avoid
+ 	 instrumenting DECL_INITIAL of TREE_STATIC vars.  */
+       *walk_subtrees = 0;
        for (tree decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
  	{
  	  if (TREE_STATIC (decl))
! 	    continue;
  	  walk_tree (&DECL_INITIAL (decl), ubsan_walk_array_refs_r, pset,
  		     pset);
  	  walk_tree (&DECL_SIZE (decl), ubsan_walk_array_refs_r, pset, pset);
  	  walk_tree (&DECL_SIZE_UNIT (decl), ubsan_walk_array_refs_r, pset,
  		     pset);
  	}
+       walk_tree (&BIND_EXPR_BODY (*tp), ubsan_walk_array_refs_r, pset, pset);
      }
    else if (TREE_CODE (*tp) == ADDR_EXPR
  	   && TREE_CODE (TREE_OPERAND (*tp, 0)) == ARRAY_REF)
diff -Nrcpad gcc-5.4.0/gcc/c-family/c-omp.c gcc-5.5.0/gcc/c-family/c-omp.c
*** gcc-5.4.0/gcc/c-family/c-omp.c	Fri Jul 10 14:12:20 2015
--- gcc-5.5.0/gcc/c-family/c-omp.c	Sat Sep 16 18:36:03 2017
*************** c_finish_omp_for (location_t locus, enum
*** 511,516 ****
--- 511,522 ----
  	{
  	  bool cond_ok = false;
  
+ 	  /* E.g. C sizeof (vla) could add COMPOUND_EXPRs with
+ 	     evaluation of the vla VAR_DECL.  We need to readd
+ 	     them to the non-decl operand.  See PR45784.  */
+ 	  while (TREE_CODE (cond) == COMPOUND_EXPR)
+ 	    cond = TREE_OPERAND (cond, 1);
+ 
  	  if (EXPR_HAS_LOCATION (cond))
  	    elocus = EXPR_LOCATION (cond);
  
*************** c_finish_omp_for (location_t locus, enum
*** 585,590 ****
--- 591,611 ----
  		  else if (code != CILK_SIMD && code != CILK_FOR)
  		    cond_ok = false;
  		}
+ 
+ 	      if (cond_ok && TREE_VEC_ELT (condv, i) != cond)
+ 		{
+ 		  tree ce = NULL_TREE, *pce = &ce;
+ 		  tree type = TREE_TYPE (TREE_OPERAND (cond, 1));
+ 		  for (tree c = TREE_VEC_ELT (condv, i); c != cond;
+ 		       c = TREE_OPERAND (c, 1))
+ 		    {
+ 		      *pce = build2 (COMPOUND_EXPR, type, TREE_OPERAND (c, 0),
+ 				     TREE_OPERAND (cond, 1));
+ 		      pce = &TREE_OPERAND (*pce, 1);
+ 		    }
+ 		  TREE_OPERAND (cond, 1) = ce;
+ 		  TREE_VEC_ELT (condv, i) = cond;
+ 		}
  	    }
  
  	  if (!cond_ok)
diff -Nrcpad gcc-5.4.0/gcc/c-family/c-opts.c gcc-5.5.0/gcc/c-family/c-opts.c
*** gcc-5.4.0/gcc/c-family/c-opts.c	Wed Jul  1 17:06:52 2015
--- gcc-5.5.0/gcc/c-family/c-opts.c	Tue Jan 10 14:07:41 2017
*************** c_common_post_options (const char **pfil
*** 749,755 ****
        in_fnames[0] = "";
      }
    else if (strcmp (in_fnames[0], "-") == 0)
!     in_fnames[0] = "";
  
    if (out_fname == NULL || !strcmp (out_fname, "-"))
      out_fname = "";
--- 749,760 ----
        in_fnames[0] = "";
      }
    else if (strcmp (in_fnames[0], "-") == 0)
!     {
!       if (pch_file)
! 	error ("cannot use %<-%> as input filename for a precompiled header");
! 
!       in_fnames[0] = "";
!     }
  
    if (out_fname == NULL || !strcmp (out_fname, "-"))
      out_fname = "";
diff -Nrcpad gcc-5.4.0/gcc/calls.c gcc-5.5.0/gcc/calls.c
*** gcc-5.4.0/gcc/calls.c	Mon Dec  7 09:11:06 2015
--- gcc-5.5.0/gcc/calls.c	Tue Feb 14 08:03:42 2017
*************** expand_call (tree exp, rtx target, int i
*** 2705,2712 ****
      n_named_args = num_actuals;
  
    /* Make a vector to hold all the information about each arg.  */
!   args = XALLOCAVEC (struct arg_data, num_actuals);
!   memset (args, 0, num_actuals * sizeof (struct arg_data));
  
    /* Build up entries in the ARGS array, compute the size of the
       arguments into ARGS_SIZE, etc.  */
--- 2705,2711 ----
      n_named_args = num_actuals;
  
    /* Make a vector to hold all the information about each arg.  */
!   args = XCNEWVEC (struct arg_data, num_actuals);
  
    /* Build up entries in the ARGS array, compute the size of the
       arguments into ARGS_SIZE, etc.  */
*************** expand_call (tree exp, rtx target, int i
*** 3719,3724 ****
--- 3718,3724 ----
    currently_expanding_call--;
  
    free (stack_usage_map_buf);
+   free (args);
  
    /* Join result with returned bounds so caller may use them if needed.  */
    target = chkp_join_splitted_slot (target, valbnd);
diff -Nrcpad gcc-5.4.0/gcc/cgraph.c gcc-5.5.0/gcc/cgraph.c
*** gcc-5.4.0/gcc/cgraph.c	Mon Mar 21 16:05:37 2016
--- gcc-5.5.0/gcc/cgraph.c	Tue May 30 07:26:00 2017
*************** cgraph_edge::redirect_call_stmt_to_calle
*** 1437,1444 ****
        if (skip_bounds)
  	new_stmt = chkp_copy_call_skip_bounds (new_stmt);
  
        gimple_call_set_fndecl (new_stmt, e->callee->decl);
!       gimple_call_set_fntype (new_stmt, gimple_call_fntype (e->call_stmt));
  
        if (gimple_vdef (new_stmt)
  	  && TREE_CODE (gimple_vdef (new_stmt)) == SSA_NAME)
--- 1437,1459 ----
        if (skip_bounds)
  	new_stmt = chkp_copy_call_skip_bounds (new_stmt);
  
+       tree old_fntype = gimple_call_fntype (e->call_stmt);
        gimple_call_set_fndecl (new_stmt, e->callee->decl);
!       cgraph_node *origin = e->callee;
!       while (origin->clone_of)
! 	origin = origin->clone_of;
! 
!       if ((origin->former_clone_of
! 	   && old_fntype == TREE_TYPE (origin->former_clone_of))
! 	  || old_fntype == TREE_TYPE (origin->decl))
! 	gimple_call_set_fntype (new_stmt, TREE_TYPE (e->callee->decl));
!       else
! 	{
! 	  bitmap skip = e->callee->clone.combined_args_to_skip;
! 	  tree t = cgraph_build_function_type_skip_args (old_fntype, skip,
! 							 false);
! 	  gimple_call_set_fntype (new_stmt, t);
! 	}
  
        if (gimple_vdef (new_stmt)
  	  && TREE_CODE (gimple_vdef (new_stmt)) == SSA_NAME)
*************** cgraph_node::rtl_info (tree decl)
*** 1899,1909 ****
    cgraph_node *node = get (decl);
    if (!node)
      return NULL;
!   node = node->ultimate_alias_target ();
!   if (node->decl != current_function_decl
!       && !TREE_ASM_WRITTEN (node->decl))
      return NULL;
!   return &node->ultimate_alias_target ()->rtl;
  }
  
  /* Return a string describing the failure REASON.  */
--- 1914,1927 ----
    cgraph_node *node = get (decl);
    if (!node)
      return NULL;
!   enum availability avail;
!   node = node->ultimate_alias_target (&avail);
!   if (decl != current_function_decl
!       && (avail < AVAIL_AVAILABLE
! 	  || (node->decl != current_function_decl
! 	      && !TREE_ASM_WRITTEN (node->decl))))
      return NULL;
!   return &node->rtl;
  }
  
  /* Return a string describing the failure REASON.  */
*************** cgraph_node::dump (FILE *f)
*** 2012,2017 ****
--- 2030,2037 ----
      fprintf (f, " only_called_at_exit");
    if (tm_clone)
      fprintf (f, " tm_clone");
+   if (calls_comdat_local)
+     fprintf (f, " calls_comdat_local");
    if (icf_merged)
      fprintf (f, " icf_merged");
    if (nonfreeing_fn)
diff -Nrcpad gcc-5.4.0/gcc/cgraph.h gcc-5.5.0/gcc/cgraph.h
*** gcc-5.4.0/gcc/cgraph.h	Fri Jan  8 12:30:56 2016
--- gcc-5.5.0/gcc/cgraph.h	Tue Apr 11 13:31:16 2017
*************** tree clone_function_name (tree decl, con
*** 2238,2243 ****
--- 2238,2245 ----
  
  void tree_function_versioning (tree, tree, vec<ipa_replace_map *, va_gc> *,
  			       bool, bitmap, bool, bitmap, basic_block);
+ tree cgraph_build_function_type_skip_args (tree orig_type, bitmap args_to_skip,
+ 					   bool skip_return);
  
  /* In cgraphbuild.c  */
  int compute_call_stmt_bb_frequency (tree, basic_block bb);
diff -Nrcpad gcc-5.4.0/gcc/cgraphclones.c gcc-5.5.0/gcc/cgraphclones.c
*** gcc-5.4.0/gcc/cgraphclones.c	Mon Jan 11 12:44:53 2016
--- gcc-5.5.0/gcc/cgraphclones.c	Tue Apr 11 13:31:16 2017
*************** cgraph_edge::clone (cgraph_node *n, gcal
*** 191,199 ****
  /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
     return value if SKIP_RETURN is true.  */
  
! static tree
! build_function_type_skip_args (tree orig_type, bitmap args_to_skip,
! 			       bool skip_return)
  {
    tree new_type = NULL;
    tree args, new_args = NULL;
--- 191,199 ----
  /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
     return value if SKIP_RETURN is true.  */
  
! tree
! cgraph_build_function_type_skip_args (tree orig_type, bitmap args_to_skip,
! 				      bool skip_return)
  {
    tree new_type = NULL;
    tree args, new_args = NULL;
*************** build_function_decl_skip_args (tree orig
*** 258,264 ****
    if (prototype_p (new_type)
        || (skip_return && !VOID_TYPE_P (TREE_TYPE (new_type))))
      new_type
!       = build_function_type_skip_args (new_type, args_to_skip, skip_return);
    TREE_TYPE (new_decl) = new_type;
  
    /* For declarations setting DECL_VINDEX (i.e. methods)
--- 258,265 ----
    if (prototype_p (new_type)
        || (skip_return && !VOID_TYPE_P (TREE_TYPE (new_type))))
      new_type
!       = cgraph_build_function_type_skip_args (new_type, args_to_skip,
! 					      skip_return);
    TREE_TYPE (new_decl) = new_type;
  
    /* For declarations setting DECL_VINDEX (i.e. methods)
diff -Nrcpad gcc-5.4.0/gcc/cgraphunit.c gcc-5.5.0/gcc/cgraphunit.c
*** gcc-5.4.0/gcc/cgraphunit.c	Wed Dec 16 11:12:06 2015
--- gcc-5.5.0/gcc/cgraphunit.c	Mon May 29 09:08:14 2017
*************** cgraph_node::expand_thunk (bool output_a
*** 1673,1678 ****
--- 1673,1682 ----
  	for (; i < nargs; i++, arg = DECL_CHAIN (arg))
  	  {
  	    tree tmp = arg;
+ 	    if (VECTOR_TYPE_P (TREE_TYPE (arg))
+ 		|| TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
+ 	      DECL_GIMPLE_REG_P (arg) = 1;
+ 
  	    if (!is_gimple_val (arg))
  	      {
  		tmp = create_tmp_reg (TYPE_MAIN_VARIANT
diff -Nrcpad gcc-5.4.0/gcc/combine.c gcc-5.5.0/gcc/combine.c
*** gcc-5.4.0/gcc/combine.c	Wed Mar 30 12:45:39 2016
--- gcc-5.5.0/gcc/combine.c	Tue May 30 07:40:21 2017
*************** make_extraction (machine_mode mode, rtx
*** 7342,7347 ****
--- 7342,7348 ----
    if (tmode != BLKmode
        && ((pos_rtx == 0 && (pos % BITS_PER_WORD) == 0
  	   && !MEM_P (inner)
+ 	   && (pos == 0 || REG_P (inner))
  	   && (inner_mode == tmode
  	       || !REG_P (inner)
  	       || TRULY_NOOP_TRUNCATION_MODES_P (tmode, inner_mode)
*************** make_extraction (machine_mode mode, rtx
*** 7418,7427 ****
  	}
        else
  	new_rtx = force_to_mode (inner, tmode,
! 			     len >= HOST_BITS_PER_WIDE_INT
! 			     ? ~(unsigned HOST_WIDE_INT) 0
! 			     : ((unsigned HOST_WIDE_INT) 1 << len) - 1,
! 			     0);
  
        /* If this extraction is going into the destination of a SET,
  	 make a STRICT_LOW_PART unless we made a MEM.  */
--- 7419,7427 ----
  	}
        else
  	new_rtx = force_to_mode (inner, tmode,
! 				 len >= HOST_BITS_PER_WIDE_INT
! 				 ? ~(unsigned HOST_WIDE_INT) 0
! 				 : ((unsigned HOST_WIDE_INT) 1 << len) - 1, 0);
  
        /* If this extraction is going into the destination of a SET,
  	 make a STRICT_LOW_PART unless we made a MEM.  */
*************** extract_left_shift (rtx x, int count)
*** 7726,7735 ****
  
     We try, as much as possible, to re-use rtl expressions to save memory.
  
!    IN_CODE says what kind of expression we are processing.  Normally, it is
!    SET.  In a memory address (inside a MEM, PLUS or minus, the latter two
!    being kludges), it is MEM.  When processing the arguments of a comparison
!    or a COMPARE against zero, it is COMPARE.  */
  
  rtx
  make_compound_operation (rtx x, enum rtx_code in_code)
--- 7726,7737 ----
  
     We try, as much as possible, to re-use rtl expressions to save memory.
  
!    IN_CODE says what kind of expression we are processing.  Normally,
!    it is SET.  In a memory address (inside a MEM, PLUS or minus, the
!    latter two being kludges), it is MEM.  When processing the
!    arguments of a comparison or a COMPARE against zero, it is COMPARE,
!    or EQ if more + precisely it is an equality comparison against
!    zero..  */
  
  rtx
  make_compound_operation (rtx x, enum rtx_code in_code)
*************** make_compound_operation (rtx x, enum rtx
*** 7743,7753 ****
--- 7745,7761 ----
    rtx new_rtx = 0;
    rtx tem;
    const char *fmt;
+   bool equality_comparison = false;
  
    /* Select the code to be used in recursive calls.  Once we are inside an
       address, we stay there.  If we have a comparison, set to COMPARE,
       but once inside, go back to our default of SET.  */
  
+   if (in_code == EQ)
+     {
+       equality_comparison = true;
+       in_code = COMPARE;
+     }
    next_code = (code == MEM ? MEM
  	       : ((code == PLUS || code == MINUS)
  		  && SCALAR_INT_MODE_P (mode)) ? MEM
*************** make_compound_operation (rtx x, enum rtx
*** 7935,7945 ****
        /* If we are in a comparison and this is an AND with a power of two,
  	 convert this into the appropriate bit extract.  */
        else if (in_code == COMPARE
! 	       && (i = exact_log2 (UINTVAL (XEXP (x, 1)))) >= 0)
  	new_rtx = make_extraction (mode,
! 			       make_compound_operation (XEXP (x, 0),
! 							next_code),
! 			       i, NULL_RTX, 1, 1, 0, 1);
  
        break;
  
--- 7943,7954 ----
        /* If we are in a comparison and this is an AND with a power of two,
  	 convert this into the appropriate bit extract.  */
        else if (in_code == COMPARE
! 	       && (i = exact_log2 (UINTVAL (XEXP (x, 1)))) >= 0
! 	       && (equality_comparison || i < GET_MODE_PRECISION (mode) - 1))
  	new_rtx = make_extraction (mode,
! 				   make_compound_operation (XEXP (x, 0),
! 							    next_code),
! 				   i, NULL_RTX, 1, 1, 0, 1);
  
        break;
  
*************** simplify_comparison (enum rtx_code code,
*** 12253,12259 ****
       We can never remove a SUBREG for a non-equality comparison because
       the sign bit is in a different place in the underlying object.  */
  
!   op0 = make_compound_operation (op0, op1 == const0_rtx ? COMPARE : SET);
    op1 = make_compound_operation (op1, SET);
  
    if (GET_CODE (op0) == SUBREG && subreg_lowpart_p (op0)
--- 12262,12272 ----
       We can never remove a SUBREG for a non-equality comparison because
       the sign bit is in a different place in the underlying object.  */
  
!   rtx_code op0_mco_code = SET;
!   if (op1 == const0_rtx)
!     op0_mco_code = code == NE || code == EQ ? EQ : COMPARE;
! 
!   op0 = make_compound_operation (op0, op0_mco_code);
    op1 = make_compound_operation (op1, SET);
  
    if (GET_CODE (op0) == SUBREG && subreg_lowpart_p (op0)
*************** get_last_value (const_rtx x)
*** 13041,13046 ****
--- 13054,13065 ----
        && DF_INSN_LUID (rsp->last_set) >= subst_low_luid)
      return 0;
  
+   /* If fewer bits were set than what we are asked for now, we cannot use
+      the value.  */
+   if (GET_MODE_PRECISION (rsp->last_set_mode)
+       < GET_MODE_PRECISION (GET_MODE (x)))
+     return 0;
+ 
    /* If the value has all its registers valid, return it.  */
    if (get_last_value_validate (&value, rsp->last_set, rsp->last_set_label, 0))
      return value;
diff -Nrcpad gcc-5.4.0/gcc/common/config/i386/i386-common.c gcc-5.5.0/gcc/common/config/i386/i386-common.c
*** gcc-5.4.0/gcc/common/config/i386/i386-common.c	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/common/config/i386/i386-common.c	Thu Oct 13 21:19:00 2016
*************** along with GCC; see the file COPYING3.
*** 86,92 ****
  #define OPTION_MASK_ISA_XSAVEC_SET \
    (OPTION_MASK_ISA_XSAVEC | OPTION_MASK_ISA_XSAVE)
  #define OPTION_MASK_ISA_CLWB_SET OPTION_MASK_ISA_CLWB
- #define OPTION_MASK_ISA_PCOMMIT_SET OPTION_MASK_ISA_PCOMMIT
  
  /* SSE4 includes both SSE4.1 and SSE4.2. -msse4 should be the same
     as -msse4.2.  */
--- 86,91 ----
*************** along with GCC; see the file COPYING3.
*** 185,191 ****
  #define OPTION_MASK_ISA_CLFLUSHOPT_UNSET OPTION_MASK_ISA_CLFLUSHOPT
  #define OPTION_MASK_ISA_XSAVEC_UNSET OPTION_MASK_ISA_XSAVEC
  #define OPTION_MASK_ISA_XSAVES_UNSET OPTION_MASK_ISA_XSAVES
- #define OPTION_MASK_ISA_PCOMMIT_UNSET OPTION_MASK_ISA_PCOMMIT
  #define OPTION_MASK_ISA_CLWB_UNSET OPTION_MASK_ISA_CLWB
  #define OPTION_MASK_ISA_MWAITX_UNSET OPTION_MASK_ISA_MWAITX
  
--- 184,189 ----
*************** ix86_handle_option (struct gcc_options *
*** 908,926 ****
  	}
        return true;
  
-     case OPT_mpcommit:
-       if (value)
- 	{
- 	  opts->x_ix86_isa_flags |= OPTION_MASK_ISA_PCOMMIT_SET;
- 	  opts->x_ix86_isa_flags_explicit |= OPTION_MASK_ISA_PCOMMIT_SET;
- 	}
-       else
- 	{
- 	  opts->x_ix86_isa_flags &= ~OPTION_MASK_ISA_PCOMMIT_UNSET;
- 	  opts->x_ix86_isa_flags_explicit |= OPTION_MASK_ISA_PCOMMIT_UNSET;
- 	}
-       return true;
- 
      case OPT_mclwb:
        if (value)
  	{
--- 906,911 ----
diff -Nrcpad gcc-5.4.0/gcc/common.opt gcc-5.5.0/gcc/common.opt
*** gcc-5.4.0/gcc/common.opt	Mon Jan 11 09:11:11 2016
--- gcc-5.5.0/gcc/common.opt	Thu Jun 22 11:28:22 2017
*************** flow and turn the statement with erroneo
*** 2273,2279 ****
  
  fisolate-erroneous-paths-attribute
  Common Report Var(flag_isolate_erroneous_paths_attribute) Optimization
! Detect paths that trigger erroneous or undefined behavior due a null value
  being used in a way forbidden by a returns_nonnull or nonnull
  attribute.  Isolate those paths from the main control flow and turn the
  statement with erroneous or undefined behavior into a trap. 
--- 2273,2279 ----
  
  fisolate-erroneous-paths-attribute
  Common Report Var(flag_isolate_erroneous_paths_attribute) Optimization
! Detect paths that trigger erroneous or undefined behavior due to a null value
  being used in a way forbidden by a returns_nonnull or nonnull
  attribute.  Isolate those paths from the main control flow and turn the
  statement with erroneous or undefined behavior into a trap. 
diff -Nrcpad gcc-5.4.0/gcc/config/aarch64/aarch64-freebsd.h gcc-5.5.0/gcc/config/aarch64/aarch64-freebsd.h
*** gcc-5.4.0/gcc/config/aarch64/aarch64-freebsd.h	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/config/aarch64/aarch64-freebsd.h	Sat Apr  8 19:18:15 2017
***************
*** 0 ****
--- 1,102 ----
+ /* Definitions for AArch64 running FreeBSD
+    Copyright (C) 2016-2017 Free Software Foundation, Inc.
+ 
+    This file is part of GCC.
+ 
+    GCC is free software; you can redistribute it and/or modify it
+    under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 3, or (at your option)
+    any later version.
+ 
+    GCC is distributed in the hope that it will be useful, but
+    WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    General Public License for more details.
+ 
+    You should have received a copy of the GNU General Public License
+    along with GCC; see the file COPYING3.  If not see
+    <http://www.gnu.org/licenses/>.  */
+ 
+ #ifndef GCC_AARCH64_FREEBSD_H
+ #define GCC_AARCH64_FREEBSD_H
+ 
+ #undef  SUBTARGET_CPP_SPEC
+ #define SUBTARGET_CPP_SPEC FBSD_CPP_SPEC
+ 
+ #if TARGET_BIG_ENDIAN_DEFAULT
+ #define TARGET_LINKER_EMULATION  "aarch64fbsdb"
+ #else
+ #define TARGET_LINKER_EMULATION  "aarch64fbsd"
+ #endif
+ 
+ #undef  SUBTARGET_EXTRA_LINK_SPEC
+ #define SUBTARGET_EXTRA_LINK_SPEC " -m" TARGET_LINKER_EMULATION
+ 
+ #undef  FBSD_TARGET_LINK_SPEC
+ #define FBSD_TARGET_LINK_SPEC "                                 \
+     %{p:%nconsider using `-pg' instead of `-p' with gprof (1) } \
+     %{v:-V}                                                     \
+     %{assert*} %{R*} %{rpath*} %{defsym*}                       \
+     %{shared:-Bshareable %{h*} %{soname*}}                      \
+     %{symbolic:-Bsymbolic}                                      \
+     %{static:-Bstatic}                                          \
+     %{!static:                                                  \
+       %{rdynamic:-export-dynamic}                               \
+       %{!shared:-dynamic-linker " FBSD_DYNAMIC_LINKER " }}      \
+     -X" SUBTARGET_EXTRA_LINK_SPEC "                             \
+     %{mbig-endian:-EB} %{mlittle-endian:-EL}"
+ 
+ #if TARGET_FIX_ERR_A53_835769_DEFAULT
+ #define CA53_ERR_835769_SPEC \
+   " %{!mno-fix-cortex-a53-835769:--fix-cortex-a53-835769}"
+ #else
+ #define CA53_ERR_835769_SPEC \
+   " %{mfix-cortex-a53-835769:--fix-cortex-a53-835769}"
+ #endif
+ 
+ #ifdef TARGET_FIX_ERR_A53_843419_DEFAULT
+ #define CA53_ERR_843419_SPEC \
+   " %{!mno-fix-cortex-a53-843419:--fix-cortex-a53-843419}"
+ #else
+ #define CA53_ERR_843419_SPEC \
+   " %{mfix-cortex-a53-843419:--fix-cortex-a53-843419}"
+ #endif
+ 
+ #undef  LINK_SPEC
+ #define LINK_SPEC FBSD_TARGET_LINK_SPEC	\
+                   CA53_ERR_835769_SPEC	\
+                   CA53_ERR_843419_SPEC
+ 
+ #define GNU_USER_TARGET_MATHFILE_SPEC \
+   "%{Ofast|ffast-math|funsafe-math-optimizations:crtfastmath.o%s}"
+ 
+ #undef ENDFILE_SPEC
+ #define ENDFILE_SPEC \
+     GNU_USER_TARGET_MATHFILE_SPEC " " \
+     FBSD_ENDFILE_SPEC
+ 
+ #undef  TARGET_OS_CPP_BUILTINS
+ #define TARGET_OS_CPP_BUILTINS()              \
+   do                                          \
+   {                                           \
+       FBSD_TARGET_OS_CPP_BUILTINS ();         \
+   }                                           \
+   while (false)
+ 
+ #define TARGET_ASM_FILE_END file_end_indicate_exec_stack
+ 
+ /* Uninitialized common symbols in non-PIE executables, even with
+    strong definitions in dependent shared libraries, will resolve
+    to COPY relocated symbol in the executable.  See PR65780.  */
+ #undef TARGET_BINDS_LOCAL_P
+ #define TARGET_BINDS_LOCAL_P default_binds_local_p_2
+ 
+ /* Use the AAPCS type for wchar_t, override the one from
+    config/freebsd.h.  */
+ #undef  WCHAR_TYPE
+ #define WCHAR_TYPE  "unsigned int"
+ 
+ #undef MCOUNT_NAME
+ #define MCOUNT_NAME ".mcount"
+ 
+ #endif  /* GCC_AARCH64_FREEBSD_H */
diff -Nrcpad gcc-5.4.0/gcc/config/aarch64/aarch64-simd.md gcc-5.5.0/gcc/config/aarch64/aarch64-simd.md
*** gcc-5.4.0/gcc/config/aarch64/aarch64-simd.md	Tue May 31 11:23:59 2016
--- gcc-5.5.0/gcc/config/aarch64/aarch64-simd.md	Tue Mar 21 09:47:07 2017
***************
*** 106,112 ****
       case 1: return "str\\t%d1, %0";
       case 2: return "orr\t%0.<Vbtype>, %1.<Vbtype>, %1.<Vbtype>";
       case 3: return "umov\t%0, %1.d[0]";
!      case 4: return "ins\t%0.d[0], %1";
       case 5: return "mov\t%0, %1";
       case 6:
  	return aarch64_output_simd_mov_immediate (operands[1],
--- 106,112 ----
       case 1: return "str\\t%d1, %0";
       case 2: return "orr\t%0.<Vbtype>, %1.<Vbtype>, %1.<Vbtype>";
       case 3: return "umov\t%0, %1.d[0]";
!      case 4: return "fmov\t%d0, %1";
       case 5: return "mov\t%0, %1";
       case 6:
  	return aarch64_output_simd_mov_immediate (operands[1],
***************
*** 115,122 ****
       }
  }
    [(set_attr "type" "neon_load1_1reg<q>, neon_store1_1reg<q>,\
!                      neon_logic<q>, neon_to_gp<q>, neon_from_gp<q>,\
!                      mov_reg, neon_move<q>")]
  )
  
  (define_insn "*aarch64_simd_mov<mode>"
--- 115,122 ----
       }
  }
    [(set_attr "type" "neon_load1_1reg<q>, neon_store1_1reg<q>,\
! 		     neon_logic<q>, neon_to_gp<q>, f_mcr,\
! 		     mov_reg, neon_move<q>")]
  )
  
  (define_insn "*aarch64_simd_mov<mode>"
diff -Nrcpad gcc-5.4.0/gcc/config/aarch64/aarch64.c gcc-5.5.0/gcc/config/aarch64/aarch64.c
*** gcc-5.4.0/gcc/config/aarch64/aarch64.c	Thu Apr 14 13:45:34 2016
--- gcc-5.5.0/gcc/config/aarch64/aarch64.c	Tue May 30 07:48:57 2017
*************** aarch64_classify_symbol (rtx x, rtx offs
*** 7069,7077 ****
  
    if (GET_CODE (x) == SYMBOL_REF)
      {
-       if (aarch64_cmodel == AARCH64_CMODEL_LARGE)
- 	  return SYMBOL_FORCE_TO_MEM;
- 
        if (aarch64_tls_symbol_p (x))
  	return aarch64_classify_tls_symbol (x);
  
--- 7069,7074 ----
*************** aarch64_classify_symbol (rtx x, rtx offs
*** 7110,7115 ****
--- 7107,7115 ----
  	    return SYMBOL_SMALL_GOT;
  	  return SYMBOL_SMALL_ABSOLUTE;
  
+ 	case AARCH64_CMODEL_LARGE:
+ 	  return SYMBOL_FORCE_TO_MEM;
+ 
  	default:
  	  gcc_unreachable ();
  	}
diff -Nrcpad gcc-5.4.0/gcc/config/aarch64/aarch64.md gcc-5.5.0/gcc/config/aarch64/aarch64.md
*** gcc-5.4.0/gcc/config/aarch64/aarch64.md	Mon Feb  1 07:06:53 2016
--- gcc-5.5.0/gcc/config/aarch64/aarch64.md	Fri Aug 26 09:37:20 2016
***************
*** 687,692 ****
--- 687,699 ----
         && (GET_CODE (XEXP (operands[0], 0)) != SYMBOL_REF))
       XEXP (operands[0], 0) = force_reg (Pmode, XEXP (operands[0], 0));
  
+     /* This is a band-aid.  An SImode symbol reference is sometimes generated
+        by expand_expr_addr_expr.  See PR 64971.  */
+     if (TARGET_ILP32
+ 	&& GET_CODE (XEXP (operands[0], 0)) == SYMBOL_REF
+ 	&& GET_MODE (XEXP (operands[0], 0)) == SImode)
+       XEXP (operands[0], 0) = convert_memory_address (Pmode,
+ 						      XEXP (operands[0], 0));
      if (operands[2] == NULL_RTX)
        operands[2] = const0_rtx;
  
***************
*** 717,722 ****
--- 724,737 ----
         && (GET_CODE (XEXP (operands[1], 0)) != SYMBOL_REF))
       XEXP (operands[1], 0) = force_reg (Pmode, XEXP (operands[1], 0));
  
+     /* This is a band-aid.  An SImode symbol reference is sometimes generated
+        by expand_expr_addr_expr.  See PR 64971.  */
+     if (TARGET_ILP32
+ 	&& GET_CODE (XEXP (operands[1], 0)) == SYMBOL_REF
+ 	&& GET_MODE (XEXP (operands[1], 0)) == SImode)
+       XEXP (operands[1], 0) = convert_memory_address (Pmode,
+ 						      XEXP (operands[1], 0));
+ 
      if (operands[3] == NULL_RTX)
        operands[3] = const0_rtx;
  
diff -Nrcpad gcc-5.4.0/gcc/config/aarch64/t-aarch64-freebsd gcc-5.5.0/gcc/config/aarch64/t-aarch64-freebsd
*** gcc-5.4.0/gcc/config/aarch64/t-aarch64-freebsd	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/config/aarch64/t-aarch64-freebsd	Mon Jan  9 21:06:20 2017
***************
*** 0 ****
--- 1,21 ----
+ # Machine description for AArch64 architecture.
+ #  Copyright (C) 2016-2017 Free Software Foundation, Inc.
+ #
+ #  This file is part of GCC.
+ #
+ #  GCC is free software; you can redistribute it and/or modify it
+ #  under the terms of the GNU General Public License as published by
+ #  the Free Software Foundation; either version 3, or (at your option)
+ #  any later version.
+ #
+ #  GCC is distributed in the hope that it will be useful, but
+ #  WITHOUT ANY WARRANTY; without even the implied warranty of
+ #  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ #  General Public License for more details.
+ #
+ #  You should have received a copy of the GNU General Public License
+ #  along with GCC; see the file COPYING3.  If not see
+ #  <http://www.gnu.org/licenses/>.
+ 
+ LIB1ASMSRC   = aarch64/lib1funcs.asm
+ LIB1ASMFUNCS = _aarch64_sync_cache_range
diff -Nrcpad gcc-5.4.0/gcc/config/arm/arm-builtins.c gcc-5.5.0/gcc/config/arm/arm-builtins.c
*** gcc-5.4.0/gcc/config/arm/arm-builtins.c	Wed Feb 10 18:40:54 2016
--- gcc-5.5.0/gcc/config/arm/arm-builtins.c	Fri Jun 23 16:15:56 2017
*************** arm_init_builtins (void)
*** 1747,1756 ****
  	= build_function_type_list (unsigned_type_node, NULL);
  
        arm_builtin_decls[ARM_BUILTIN_GET_FPSCR]
! 	= add_builtin_function ("__builtin_arm_ldfscr", ftype_get_fpscr,
  				ARM_BUILTIN_GET_FPSCR, BUILT_IN_MD, NULL, NULL_TREE);
        arm_builtin_decls[ARM_BUILTIN_SET_FPSCR]
! 	= add_builtin_function ("__builtin_arm_stfscr", ftype_set_fpscr,
  				ARM_BUILTIN_SET_FPSCR, BUILT_IN_MD, NULL, NULL_TREE);
      }
  }
--- 1747,1756 ----
  	= build_function_type_list (unsigned_type_node, NULL);
  
        arm_builtin_decls[ARM_BUILTIN_GET_FPSCR]
! 	= add_builtin_function ("__builtin_arm_get_fpscr", ftype_get_fpscr,
  				ARM_BUILTIN_GET_FPSCR, BUILT_IN_MD, NULL, NULL_TREE);
        arm_builtin_decls[ARM_BUILTIN_SET_FPSCR]
! 	= add_builtin_function ("__builtin_arm_set_fpscr", ftype_set_fpscr,
  				ARM_BUILTIN_SET_FPSCR, BUILT_IN_MD, NULL, NULL_TREE);
      }
  }
diff -Nrcpad gcc-5.4.0/gcc/config/arm/arm-protos.h gcc-5.5.0/gcc/config/arm/arm-protos.h
*** gcc-5.4.0/gcc/config/arm/arm-protos.h	Wed Aug 26 13:49:00 2015
--- gcc-5.5.0/gcc/config/arm/arm-protos.h	Tue Apr 11 15:26:20 2017
*************** extern bool arm_is_constant_pool_ref (rt
*** 343,349 ****
  #define FL_STRONG     (1 << 8)	      /* StrongARM */
  #define FL_ARCH5E     (1 << 9)        /* DSP extensions to v5 */
  #define FL_XSCALE     (1 << 10)	      /* XScale */
! /* spare	      (1 << 11)	*/
  #define FL_ARCH6      (1 << 12)       /* Architecture rel 6.  Adds
  					 media instructions.  */
  #define FL_VFPV2      (1 << 13)       /* Vector Floating Point V2.  */
--- 343,349 ----
  #define FL_STRONG     (1 << 8)	      /* StrongARM */
  #define FL_ARCH5E     (1 << 9)        /* DSP extensions to v5 */
  #define FL_XSCALE     (1 << 10)	      /* XScale */
! #define FL_LPAE       (1 << 11)       /* ARMv7-A LPAE.  */
  #define FL_ARCH6      (1 << 12)       /* Architecture rel 6.  Adds
  					 media instructions.  */
  #define FL_VFPV2      (1 << 13)       /* Vector Floating Point V2.  */
*************** extern bool arm_is_constant_pool_ref (rt
*** 392,398 ****
  #define FL_FOR_ARCH6M	(FL_FOR_ARCH6 & ~FL_NOTM)
  #define FL_FOR_ARCH7	((FL_FOR_ARCH6T2 & ~FL_NOTM) | FL_ARCH7)
  #define FL_FOR_ARCH7A	(FL_FOR_ARCH7 | FL_NOTM | FL_ARCH6K)
! #define FL_FOR_ARCH7VE	(FL_FOR_ARCH7A | FL_THUMB_DIV | FL_ARM_DIV)
  #define FL_FOR_ARCH7R	(FL_FOR_ARCH7A | FL_THUMB_DIV)
  #define FL_FOR_ARCH7M	(FL_FOR_ARCH7 | FL_THUMB_DIV)
  #define FL_FOR_ARCH7EM  (FL_FOR_ARCH7M | FL_ARCH7EM)
--- 392,398 ----
  #define FL_FOR_ARCH6M	(FL_FOR_ARCH6 & ~FL_NOTM)
  #define FL_FOR_ARCH7	((FL_FOR_ARCH6T2 & ~FL_NOTM) | FL_ARCH7)
  #define FL_FOR_ARCH7A	(FL_FOR_ARCH7 | FL_NOTM | FL_ARCH6K)
! #define FL_FOR_ARCH7VE	(FL_FOR_ARCH7A | FL_THUMB_DIV | FL_ARM_DIV | FL_LPAE)
  #define FL_FOR_ARCH7R	(FL_FOR_ARCH7A | FL_THUMB_DIV)
  #define FL_FOR_ARCH7M	(FL_FOR_ARCH7 | FL_THUMB_DIV)
  #define FL_FOR_ARCH7EM  (FL_FOR_ARCH7M | FL_ARCH7EM)
*************** extern int arm_arch_thumb2;
*** 487,492 ****
--- 487,495 ----
  extern int arm_arch_arm_hwdiv;
  extern int arm_arch_thumb_hwdiv;
  
+ /* Nonzero if this chip supports the Large Physical Address Extension.  */
+ extern int arm_arch_lpae;
+ 
  /* Nonzero if chip disallows volatile memory access in IT block.  */
  extern int arm_arch_no_volatile_ce;
  
diff -Nrcpad gcc-5.4.0/gcc/config/arm/arm.c gcc-5.5.0/gcc/config/arm/arm.c
*** gcc-5.4.0/gcc/config/arm/arm.c	Fri May 20 20:50:45 2016
--- gcc-5.5.0/gcc/config/arm/arm.c	Fri Apr 21 09:23:59 2017
*************** int arm_arch_thumb2;
*** 866,871 ****
--- 866,874 ----
  int arm_arch_arm_hwdiv;
  int arm_arch_thumb_hwdiv;
  
+ /* Nonzero if this chip supports the Large Physical Address Extension.  */
+ int arm_arch_lpae;
+ 
  /* Nonzero if chip disallows volatile memory access in IT block.  */
  int arm_arch_no_volatile_ce;
  
*************** arm_option_override (void)
*** 2862,2867 ****
--- 2865,2871 ----
    arm_arch_iwmmxt2 = (insn_flags & FL_IWMMXT2) != 0;
    arm_arch_thumb_hwdiv = (insn_flags & FL_THUMB_DIV) != 0;
    arm_arch_arm_hwdiv = (insn_flags & FL_ARM_DIV) != 0;
+   arm_arch_lpae = (insn_flags & FL_LPAE) != 0;
    arm_arch_no_volatile_ce = (insn_flags & FL_NO_VOLATILE_CE) != 0;
    arm_tune_cortex_a9 = (arm_tune == cortexa9) != 0;
    arm_arch_crc = (insn_flags & FL_CRC32) != 0;
*************** arm_function_ok_for_sibcall (tree decl,
*** 6481,6487 ****
  
    /* The PIC register is live on entry to VxWorks PLT entries, so we
       must make the call before restoring the PIC register.  */
!   if (TARGET_VXWORKS_RTP && flag_pic && !targetm.binds_local_p (decl))
      return false;
  
    /* If we are interworking and the function is not declared static
--- 6485,6491 ----
  
    /* The PIC register is live on entry to VxWorks PLT entries, so we
       must make the call before restoring the PIC register.  */
!   if (TARGET_VXWORKS_RTP && flag_pic && decl && !targetm.binds_local_p (decl))
      return false;
  
    /* If we are interworking and the function is not declared static
*************** arm_function_ok_for_sibcall (tree decl,
*** 6503,6510 ****
  	 a VFP register but then need to transfer it to a core
  	 register.  */
        rtx a, b;
  
!       a = arm_function_value (TREE_TYPE (exp), decl, false);
        b = arm_function_value (TREE_TYPE (DECL_RESULT (cfun->decl)),
  			      cfun->decl, false);
        if (!rtx_equal_p (a, b))
--- 6507,6519 ----
  	 a VFP register but then need to transfer it to a core
  	 register.  */
        rtx a, b;
+       tree decl_or_type = decl;
  
!       /* If it is an indirect function pointer, get the function type.  */
!       if (!decl)
! 	decl_or_type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (exp)));
! 
!       a = arm_function_value (TREE_TYPE (exp), decl_or_type, false);
        b = arm_function_value (TREE_TYPE (DECL_RESULT (cfun->decl)),
  			      cfun->decl, false);
        if (!rtx_equal_p (a, b))
*************** legitimize_pic_address (rtx orig, machin
*** 6631,6639 ****
  	 same segment as the GOT.  Unfortunately, the flexibility of linker
  	 scripts means that we can't be sure of that in general, so assume
  	 that GOTOFF is never valid on VxWorks.  */
        if ((GET_CODE (orig) == LABEL_REF
! 	   || (GET_CODE (orig) == SYMBOL_REF &&
! 	       SYMBOL_REF_LOCAL_P (orig)))
  	  && NEED_GOT_RELOC
  	  && arm_pic_data_is_text_relative)
  	insn = arm_pic_static_addr (orig, reg);
--- 6640,6652 ----
  	 same segment as the GOT.  Unfortunately, the flexibility of linker
  	 scripts means that we can't be sure of that in general, so assume
  	 that GOTOFF is never valid on VxWorks.  */
+       /* References to weak symbols cannot be resolved locally: they
+ 	 may be overridden by a non-weak definition at link time.  */
        if ((GET_CODE (orig) == LABEL_REF
! 	   || (GET_CODE (orig) == SYMBOL_REF
! 	       && SYMBOL_REF_LOCAL_P (orig)
! 	       && (SYMBOL_REF_DECL (orig)
! 		   ? !DECL_WEAK (SYMBOL_REF_DECL (orig)) : 1)))
  	  && NEED_GOT_RELOC
  	  && arm_pic_data_is_text_relative)
  	insn = arm_pic_static_addr (orig, reg);
*************** arm_assemble_integer (rtx x, unsigned in
*** 22438,22445 ****
  	{
  	  /* See legitimize_pic_address for an explanation of the
  	     TARGET_VXWORKS_RTP check.  */
  	  if (!arm_pic_data_is_text_relative
! 	      || (GET_CODE (x) == SYMBOL_REF && !SYMBOL_REF_LOCAL_P (x)))
  	    fputs ("(GOT)", asm_out_file);
  	  else
  	    fputs ("(GOTOFF)", asm_out_file);
--- 22451,22464 ----
  	{
  	  /* See legitimize_pic_address for an explanation of the
  	     TARGET_VXWORKS_RTP check.  */
+ 	  /* References to weak symbols cannot be resolved locally:
+ 	     they may be overridden by a non-weak definition at link
+ 	     time.  */
  	  if (!arm_pic_data_is_text_relative
! 	      || (GET_CODE (x) == SYMBOL_REF
! 		  && (!SYMBOL_REF_LOCAL_P (x)
! 		      || (SYMBOL_REF_DECL (x)
! 			  ? DECL_WEAK (SYMBOL_REF_DECL (x)) : 0))))
  	    fputs ("(GOT)", asm_out_file);
  	  else
  	    fputs ("(GOTOFF)", asm_out_file);
*************** thumb1_expand_prologue (void)
*** 24457,24462 ****
--- 24476,24482 ----
    unsigned long live_regs_mask;
    unsigned long l_mask;
    unsigned high_regs_pushed = 0;
+   bool lr_needs_saving;
  
    func_type = arm_current_func_type ();
  
*************** thumb1_expand_prologue (void)
*** 24479,24484 ****
--- 24499,24505 ----
  
    offsets = arm_get_frame_offsets ();
    live_regs_mask = offsets->saved_regs_mask;
+   lr_needs_saving = live_regs_mask & (1 << LR_REGNUM);
  
    /* Extract a mask of the ones we can give to the Thumb's push instruction.  */
    l_mask = live_regs_mask & 0x40ff;
*************** thumb1_expand_prologue (void)
*** 24545,24550 ****
--- 24566,24572 ----
  	{
  	  insn = thumb1_emit_multi_reg_push (l_mask, l_mask);
  	  RTX_FRAME_RELATED_P (insn) = 1;
+ 	  lr_needs_saving = false;
  
  	  offset = bit_count (l_mask) * UNITS_PER_WORD;
  	}
*************** thumb1_expand_prologue (void)
*** 24609,24620 ****
       be a push of LR and we can combine it with the push of the first high
       register.  */
    else if ((l_mask & 0xff) != 0
! 	   || (high_regs_pushed == 0 && l_mask))
      {
        unsigned long mask = l_mask;
        mask |= (1 << thumb1_extra_regs_pushed (offsets, true)) - 1;
        insn = thumb1_emit_multi_reg_push (mask, mask);
        RTX_FRAME_RELATED_P (insn) = 1;
      }
  
    if (high_regs_pushed)
--- 24631,24643 ----
       be a push of LR and we can combine it with the push of the first high
       register.  */
    else if ((l_mask & 0xff) != 0
! 	   || (high_regs_pushed == 0 && lr_needs_saving))
      {
        unsigned long mask = l_mask;
        mask |= (1 << thumb1_extra_regs_pushed (offsets, true)) - 1;
        insn = thumb1_emit_multi_reg_push (mask, mask);
        RTX_FRAME_RELATED_P (insn) = 1;
+       lr_needs_saving = false;
      }
  
    if (high_regs_pushed)
*************** thumb1_expand_prologue (void)
*** 24632,24638 ****
        /* Here we need to mask out registers used for passing arguments
  	 even if they can be pushed.  This is to avoid using them to stash the high
  	 registers.  Such kind of stash may clobber the use of arguments.  */
!       pushable_regs = l_mask & (~arg_regs_mask) & 0xff;
  
        if (pushable_regs == 0)
  	pushable_regs = 1 << thumb_find_work_register (live_regs_mask);
--- 24655,24663 ----
        /* Here we need to mask out registers used for passing arguments
  	 even if they can be pushed.  This is to avoid using them to stash the high
  	 registers.  Such kind of stash may clobber the use of arguments.  */
!       pushable_regs = l_mask & (~arg_regs_mask);
!       if (lr_needs_saving)
! 	pushable_regs &= ~(1 << LR_REGNUM);
  
        if (pushable_regs == 0)
  	pushable_regs = 1 << thumb_find_work_register (live_regs_mask);
*************** thumb1_expand_prologue (void)
*** 24640,24647 ****
        while (high_regs_pushed > 0)
  	{
  	  unsigned long real_regs_mask = 0;
  
! 	  for (regno = LAST_LO_REGNUM; regno >= 0; regno --)
  	    {
  	      if (pushable_regs & (1 << regno))
  		{
--- 24665,24673 ----
        while (high_regs_pushed > 0)
  	{
  	  unsigned long real_regs_mask = 0;
+ 	  unsigned long push_mask = 0;
  
! 	  for (regno = LR_REGNUM; regno >= 0; regno --)
  	    {
  	      if (pushable_regs & (1 << regno))
  		{
*************** thumb1_expand_prologue (void)
*** 24650,24655 ****
--- 24676,24682 ----
  
  		  high_regs_pushed --;
  		  real_regs_mask |= (1 << next_hi_reg);
+ 		  push_mask |= (1 << regno);
  
  		  if (high_regs_pushed)
  		    {
*************** thumb1_expand_prologue (void)
*** 24659,24681 ****
  			  break;
  		    }
  		  else
! 		    {
! 		      pushable_regs &= ~((1 << regno) - 1);
! 		      break;
! 		    }
  		}
  	    }
  
  	  /* If we had to find a work register and we have not yet
  	     saved the LR then add it to the list of regs to push.  */
! 	  if (l_mask == (1 << LR_REGNUM))
  	    {
! 	      pushable_regs |= l_mask;
! 	      real_regs_mask |= l_mask;
! 	      l_mask = 0;
  	    }
  
! 	  insn = thumb1_emit_multi_reg_push (pushable_regs, real_regs_mask);
  	  RTX_FRAME_RELATED_P (insn) = 1;
  	}
      }
--- 24686,24705 ----
  			  break;
  		    }
  		  else
! 		    break;
  		}
  	    }
  
  	  /* If we had to find a work register and we have not yet
  	     saved the LR then add it to the list of regs to push.  */
! 	  if (lr_needs_saving)
  	    {
! 	      push_mask |= 1 << LR_REGNUM;
! 	      real_regs_mask |= 1 << LR_REGNUM;
! 	      lr_needs_saving = false;
  	    }
  
! 	  insn = thumb1_emit_multi_reg_push (push_mask, real_regs_mask);
  	  RTX_FRAME_RELATED_P (insn) = 1;
  	}
      }
diff -Nrcpad gcc-5.4.0/gcc/config/arm/arm.h gcc-5.5.0/gcc/config/arm/arm.h
*** gcc-5.4.0/gcc/config/arm/arm.h	Tue Mar 29 13:28:34 2016
--- gcc-5.5.0/gcc/config/arm/arm.h	Tue Apr 11 15:26:20 2017
*************** extern void (*arm_lang_output_object_att
*** 370,377 ****
  #define TARGET_HAVE_LDREX	((arm_arch6 && TARGET_ARM) || arm_arch7)
  
  /* Nonzero if this chip supports LPAE.  */
! #define TARGET_HAVE_LPAE						\
!   (arm_arch7 && ((insn_flags & FL_FOR_ARCH7VE) == FL_FOR_ARCH7VE))
  
  /* Nonzero if this chip supports ldrex{bh} and strex{bh}.  */
  #define TARGET_HAVE_LDREXBH	((arm_arch6k && TARGET_ARM) || arm_arch7)
--- 370,376 ----
  #define TARGET_HAVE_LDREX	((arm_arch6 && TARGET_ARM) || arm_arch7)
  
  /* Nonzero if this chip supports LPAE.  */
! #define TARGET_HAVE_LPAE	(arm_arch_lpae)
  
  /* Nonzero if this chip supports ldrex{bh} and strex{bh}.  */
  #define TARGET_HAVE_LDREXBH	((arm_arch6k && TARGET_ARM) || arm_arch7)
diff -Nrcpad gcc-5.4.0/gcc/config/arm/arm.md gcc-5.5.0/gcc/config/arm/arm.md
*** gcc-5.4.0/gcc/config/arm/arm.md	Fri Jan  8 10:36:37 2016
--- gcc-5.5.0/gcc/config/arm/arm.md	Wed Dec  7 17:51:00 2016
***************
*** 567,575 ****
  ;;  (plus (reg rN) (reg sp)) into (reg rN).  In this case reload will
  ;; put the duplicated register first, and not try the commutative version.
  (define_insn_and_split "*arm_addsi3"
!   [(set (match_operand:SI          0 "s_register_operand" "=rk,l,l ,l ,r ,k ,r,r ,k ,r ,k,k,r ,k ,r")
!         (plus:SI (match_operand:SI 1 "s_register_operand" "%0 ,l,0 ,l ,rk,k ,r,rk,k ,rk,k,r,rk,k ,rk")
!                  (match_operand:SI 2 "reg_or_int_operand" "rk ,l,Py,Pd,rI,rI,k,Pj,Pj,L ,L,L,PJ,PJ,?n")))]
    "TARGET_32BIT"
    "@
     add%?\\t%0, %0, %2
--- 567,575 ----
  ;;  (plus (reg rN) (reg sp)) into (reg rN).  In this case reload will
  ;; put the duplicated register first, and not try the commutative version.
  (define_insn_and_split "*arm_addsi3"
!   [(set (match_operand:SI          0 "s_register_operand" "=rk,l,l ,l ,r ,k ,r,k ,r ,k ,r ,k,k,r ,k ,r")
! 	(plus:SI (match_operand:SI 1 "s_register_operand" "%0 ,l,0 ,l ,rk,k ,r,r ,rk,k ,rk,k,r,rk,k ,rk")
! 		 (match_operand:SI 2 "reg_or_int_operand" "rk ,l,Py,Pd,rI,rI,k,rI,Pj,Pj,L ,L,L,PJ,PJ,?n")))]
    "TARGET_32BIT"
    "@
     add%?\\t%0, %0, %2
***************
*** 579,584 ****
--- 579,585 ----
     add%?\\t%0, %1, %2
     add%?\\t%0, %1, %2
     add%?\\t%0, %2, %1
+    add%?\\t%0, %1, %2
     addw%?\\t%0, %1, %2
     addw%?\\t%0, %1, %2
     sub%?\\t%0, %1, #%n2
***************
*** 598,607 ****
  		      operands[1], 0);
    DONE;
    "
!   [(set_attr "length" "2,4,4,4,4,4,4,4,4,4,4,4,4,4,16")
     (set_attr "predicable" "yes")
!    (set_attr "predicable_short_it" "yes,yes,yes,yes,no,no,no,no,no,no,no,no,no,no,no")
!    (set_attr "arch" "t2,t2,t2,t2,*,*,*,t2,t2,*,*,a,t2,t2,*")
     (set (attr "type") (if_then_else (match_operand 2 "const_int_operand" "")
  		      (const_string "alu_imm")
  		      (const_string "alu_sreg")))
--- 599,608 ----
  		      operands[1], 0);
    DONE;
    "
!   [(set_attr "length" "2,4,4,4,4,4,4,4,4,4,4,4,4,4,4,16")
     (set_attr "predicable" "yes")
!    (set_attr "predicable_short_it" "yes,yes,yes,yes,no,no,no,no,no,no,no,no,no,no,no,no")
!    (set_attr "arch" "t2,t2,t2,t2,*,*,*,a,t2,t2,*,*,a,t2,t2,*")
     (set (attr "type") (if_then_else (match_operand 2 "const_int_operand" "")
  		      (const_string "alu_imm")
  		      (const_string "alu_sreg")))
diff -Nrcpad gcc-5.4.0/gcc/config/arm/freebsd.h gcc-5.5.0/gcc/config/arm/freebsd.h
*** gcc-5.4.0/gcc/config/arm/freebsd.h	Fri Jan  9 14:06:02 2015
--- gcc-5.5.0/gcc/config/arm/freebsd.h	Wed Jun 15 19:19:08 2016
***************
*** 120,130 ****
--- 120,134 ----
  #define SUBTARGET_CPU_DEFAULT   TARGET_CPU_arm9
  #endif
  
+ /* FreeBSD 10 does not support unaligned access for armv6 and up.
+    Unaligned access support was added in FreeBSD 11.  */
+ #if FBSD_MAJOR < 11
  #define SUBTARGET_OVERRIDE_OPTIONS		\
  do {						\
      if (unaligned_access)			\
  	unaligned_access = 0;			\
  } while (0)
+ #endif
  
  #undef MAX_SYNC_LIBFUNC_SIZE
  #define MAX_SYNC_LIBFUNC_SIZE 4 /* UNITS_PER_WORD not defined yet.  */
diff -Nrcpad gcc-5.4.0/gcc/config/arm/neon.md gcc-5.5.0/gcc/config/arm/neon.md
*** gcc-5.4.0/gcc/config/arm/neon.md	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/arm/neon.md	Tue Jan 24 14:14:12 2017
***************
*** 1015,1026 ****
  )
  
  (define_insn_and_split "ashldi3_neon"
!   [(set (match_operand:DI 0 "s_register_operand"	    "= w, w,?&r,?r, ?w,w")
! 	(ashift:DI (match_operand:DI 1 "s_register_operand" " 0w, w, 0r, r, 0w,w")
! 		   (match_operand:SI 2 "general_operand"    "rUm, i,  r, i,rUm,i")))
!    (clobber (match_scratch:SI 3				    "= X, X,?&r, X,  X,X"))
!    (clobber (match_scratch:SI 4				    "= X, X,?&r, X,  X,X"))
!    (clobber (match_scratch:DI 5				    "=&w, X,  X, X, &w,X"))
     (clobber (reg:CC_C CC_REGNUM))]
    "TARGET_NEON"
    "#"
--- 1015,1026 ----
  )
  
  (define_insn_and_split "ashldi3_neon"
!   [(set (match_operand:DI 0 "s_register_operand"	    "= w, w,?&r,?r,?&r, ?w,w")
! 	(ashift:DI (match_operand:DI 1 "s_register_operand" " 0w, w, 0r, 0,  r, 0w,w")
! 		   (match_operand:SI 2 "general_operand"    "rUm, i,  r, i,  i,rUm,i")))
!    (clobber (match_scratch:SI 3				    "= X, X,?&r, X,  X,  X,X"))
!    (clobber (match_scratch:SI 4				    "= X, X,?&r, X,  X,  X,X"))
!    (clobber (match_scratch:DI 5				    "=&w, X,  X, X,  X, &w,X"))
     (clobber (reg:CC_C CC_REGNUM))]
    "TARGET_NEON"
    "#"
***************
*** 1052,1060 ****
        }
      else
        {
! 	if (CONST_INT_P (operands[2]) && INTVAL (operands[2]) == 1
! 	    && (!reg_overlap_mentioned_p (operands[0], operands[1])
! 		|| REGNO (operands[0]) == REGNO (operands[1])))
  	  /* This clobbers CC.  */
  	  emit_insn (gen_arm_ashldi3_1bit (operands[0], operands[1]));
  	else
--- 1052,1062 ----
        }
      else
        {
! 	/* The shift expanders support either full overlap or no overlap.  */
! 	gcc_assert (!reg_overlap_mentioned_p (operands[0], operands[1])
! 		    || REGNO (operands[0]) == REGNO (operands[1]));
! 
! 	if (operands[2] == CONST1_RTX (SImode))
  	  /* This clobbers CC.  */
  	  emit_insn (gen_arm_ashldi3_1bit (operands[0], operands[1]));
  	else
***************
*** 1063,1070 ****
        }
      DONE;
    }"
!   [(set_attr "arch" "neon_for_64bits,neon_for_64bits,*,*,avoid_neon_for_64bits,avoid_neon_for_64bits")
!    (set_attr "opt" "*,*,speed,speed,*,*")
     (set_attr "type" "multiple")]
  )
  
--- 1065,1072 ----
        }
      DONE;
    }"
!   [(set_attr "arch" "neon_for_64bits,neon_for_64bits,*,*,*,avoid_neon_for_64bits,avoid_neon_for_64bits")
!    (set_attr "opt" "*,*,speed,speed,speed,*,*")
     (set_attr "type" "multiple")]
  )
  
***************
*** 1113,1124 ****
  ;; ashrdi3_neon
  ;; lshrdi3_neon
  (define_insn_and_split "<shift>di3_neon"
!   [(set (match_operand:DI 0 "s_register_operand"	     "= w, w,?&r,?r,?w,?w")
! 	(rshifts:DI (match_operand:DI 1 "s_register_operand" " 0w, w, 0r, r,0w, w")
! 		    (match_operand:SI 2 "reg_or_int_operand" "  r, i,  r, i, r, i")))
!    (clobber (match_scratch:SI 3				     "=2r, X, &r, X,2r, X"))
!    (clobber (match_scratch:SI 4				     "= X, X, &r, X, X, X"))
!    (clobber (match_scratch:DI 5				     "=&w, X,  X, X,&w, X"))
     (clobber (reg:CC CC_REGNUM))]
    "TARGET_NEON"
    "#"
--- 1115,1126 ----
  ;; ashrdi3_neon
  ;; lshrdi3_neon
  (define_insn_and_split "<shift>di3_neon"
!   [(set (match_operand:DI 0 "s_register_operand"	     "= w, w,?&r,?r,?&r,?w,?w")
! 	(rshifts:DI (match_operand:DI 1 "s_register_operand" " 0w, w, 0r, 0,  r,0w, w")
! 		    (match_operand:SI 2 "reg_or_int_operand" "  r, i,  r, i,  i, r, i")))
!    (clobber (match_scratch:SI 3				     "=2r, X, &r, X,  X,2r, X"))
!    (clobber (match_scratch:SI 4				     "= X, X, &r, X,  X, X, X"))
!    (clobber (match_scratch:DI 5				     "=&w, X,  X, X, X,&w, X"))
     (clobber (reg:CC CC_REGNUM))]
    "TARGET_NEON"
    "#"
***************
*** 1154,1162 ****
        }
      else
        {
! 	if (CONST_INT_P (operands[2]) && INTVAL (operands[2]) == 1
! 	    && (!reg_overlap_mentioned_p (operands[0], operands[1])
! 		|| REGNO (operands[0]) == REGNO (operands[1])))
  	  /* This clobbers CC.  */
  	  emit_insn (gen_arm_<shift>di3_1bit (operands[0], operands[1]));
  	else
--- 1156,1166 ----
        }
      else
        {
! 	/* The shift expanders support either full overlap or no overlap.  */
! 	gcc_assert (!reg_overlap_mentioned_p (operands[0], operands[1])
! 		    || REGNO (operands[0]) == REGNO (operands[1]));
! 
! 	if (operands[2] == CONST1_RTX (SImode))
  	  /* This clobbers CC.  */
  	  emit_insn (gen_arm_<shift>di3_1bit (operands[0], operands[1]));
  	else
***************
*** 1167,1174 ****
  
      DONE;
    }"
!   [(set_attr "arch" "neon_for_64bits,neon_for_64bits,*,*,avoid_neon_for_64bits,avoid_neon_for_64bits")
!    (set_attr "opt" "*,*,speed,speed,*,*")
     (set_attr "type" "multiple")]
  )
  
--- 1171,1178 ----
  
      DONE;
    }"
!   [(set_attr "arch" "neon_for_64bits,neon_for_64bits,*,*,*,avoid_neon_for_64bits,avoid_neon_for_64bits")
!    (set_attr "opt" "*,*,speed,speed,speed,*,*")
     (set_attr "type" "multiple")]
  )
  
diff -Nrcpad gcc-5.4.0/gcc/config/arm/t-phoenix gcc-5.5.0/gcc/config/arm/t-phoenix
*** gcc-5.4.0/gcc/config/arm/t-phoenix	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/config/arm/t-phoenix	Wed Aug 31 09:38:42 2016
***************
*** 0 ****
--- 1,29 ----
+ # Copyright (C) 2016 Free Software Foundation, Inc.
+ #
+ # This file is part of GCC.
+ #
+ # GCC is free software; you can redistribute it and/or modify
+ # it under the terms of the GNU General Public License as published by
+ # the Free Software Foundation; either version 3, or (at your option)
+ # any later version.
+ #
+ # GCC is distributed in the hope that it will be useful,
+ # but WITHOUT ANY WARRANTY; without even the implied warranty of
+ # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ # GNU General Public License for more details.
+ #
+ # You should have received a copy of the GNU General Public License
+ # along with GCC; see the file COPYING3.  If not see
+ # <http://www.gnu.org/licenses/>.
+ 
+ MULTILIB_OPTIONS     = marm/mthumb
+ MULTILIB_DIRNAMES    = arm thumb
+ MULTILIB_EXCEPTIONS  =
+ MULTILIB_MATCHES     =
+ 
+ MULTILIB_OPTIONS     += mfloat-abi=hard
+ MULTILIB_DIRNAMES    += fpu
+ MULTILIB_MATCHES     += mfloat-abi?hard=mhard-float
+ 
+ MULTILIB_OPTIONS     += mno-thumb-interwork/mthumb-interwork
+ MULTILIB_DIRNAMES    += normal interwork
diff -Nrcpad gcc-5.4.0/gcc/config/avr/avr.c gcc-5.5.0/gcc/config/avr/avr.c
*** gcc-5.4.0/gcc/config/avr/avr.c	Thu Aug 20 14:15:30 2015
--- gcc-5.5.0/gcc/config/avr/avr.c	Tue Aug 22 10:01:38 2017
***************
*** 21,30 ****
  #include "config.h"
  #include "system.h"
  #include "coretypes.h"
  #include "tm.h"
  #include "rtl.h"
  #include "regs.h"
- #include "hard-reg-set.h"
  #include "insn-config.h"
  #include "conditions.h"
  #include "insn-attr.h"
--- 21,40 ----
  #include "config.h"
  #include "system.h"
  #include "coretypes.h"
+ #include "hash-table.h"
  #include "tm.h"
+ #include "hard-reg-set.h"
  #include "rtl.h"
+ #include "hash-set.h"
+ #include "symtab.h"
+ #include "inchash.h"
+ #include "tree.h"
+ #include "function.h"
+ #include "hash-map.h"
+ #include "plugin-api.h"
+ #include "ipa-ref.h"
+ #include "cgraph.h"
  #include "regs.h"
  #include "insn-config.h"
  #include "conditions.h"
  #include "insn-attr.h"
*************** avr_set_current_function (tree decl)
*** 759,770 ****
  
        name = default_strip_name_encoding (name);
  
-       /* Silently ignore 'signal' if 'interrupt' is present.  AVR-LibC startet
-          using this when it switched from SIGNAL and INTERRUPT to ISR.  */
- 
-       if (cfun->machine->is_interrupt)
-         cfun->machine->is_signal = 0;
- 
        /* Interrupt handlers must be  void __vector (void)  functions.  */
  
        if (args && TREE_CODE (TREE_VALUE (args)) != VOID_TYPE)
--- 769,774 ----
*************** avr_set_current_function (tree decl)
*** 773,787 ****
        if (TREE_CODE (ret) != VOID_TYPE)
          error_at (loc, "%qs function cannot return a value", isr);
  
        /* If the function has the 'signal' or 'interrupt' attribute, ensure
           that the name of the function is "__vector_NN" so as to catch
           when the user misspells the vector name.  */
  
        if (!STR_PREFIX_P (name, "__vector"))
!         warning_at (loc, 0, "%qs appears to be a misspelled %s handler",
!                     name, isr);
      }
  
    /* Don't print the above diagnostics more than once.  */
  
    cfun->machine->attributes_checked_p = 1;
--- 777,813 ----
        if (TREE_CODE (ret) != VOID_TYPE)
          error_at (loc, "%qs function cannot return a value", isr);
  
+ #if defined WITH_AVRLIBC
+       /* Silently ignore 'signal' if 'interrupt' is present.  AVR-LibC startet
+          using this when it switched from SIGNAL and INTERRUPT to ISR.  */
+ 
+       if (cfun->machine->is_interrupt)
+         cfun->machine->is_signal = 0;
+ 
        /* If the function has the 'signal' or 'interrupt' attribute, ensure
           that the name of the function is "__vector_NN" so as to catch
           when the user misspells the vector name.  */
  
        if (!STR_PREFIX_P (name, "__vector"))
!         warning_at (loc, OPT_Wmisspelled_isr, "%qs appears to be a misspelled "
!                     "%qs handler, missing %<__vector%> prefix", name, isr);
! #endif // AVR-LibC naming conventions
      }
  
+ #if defined WITH_AVRLIBC
+   // Common problem is using "ISR" without first including avr/interrupt.h.
+   const char *name = IDENTIFIER_POINTER (DECL_NAME (decl));
+   name = default_strip_name_encoding (name);
+   if (0 == strcmp ("ISR", name)
+       || 0 == strcmp ("INTERRUPT", name)
+       || 0 == strcmp ("SIGNAL", name))
+     {
+       warning_at (loc, OPT_Wmisspelled_isr, "%qs is a reserved identifier"
+                   " in AVR-LibC.  Consider %<#include <avr/interrupt.h>%>"
+                   " before using the %qs macro", name, name);
+     }
+ #endif // AVR-LibC naming conventions
+ 
    /* Don't print the above diagnostics more than once.  */
  
    cfun->machine->attributes_checked_p = 1;
*************** avr_notice_update_cc (rtx body ATTRIBUTE
*** 2526,2533 ****
        break;
  
      case CC_NONE:
!       /* Insn does not affect CC at all.  */
!       break;
  
      case CC_SET_N:
        CC_STATUS_INIT;
--- 2552,2595 ----
        break;
  
      case CC_NONE:
!       /* Insn does not affect CC at all, but it might set some registers
!          that are stored in cc_status.  If such a register is affected by
!          the current insn, for example by means of a SET or a CLOBBER,
!          then we must reset cc_status; cf. PR77326.
! 
!          Unfortunately, set_of cannot be used as reg_overlap_mentioned_p
!          will abort on COMPARE (which might be found in cc_status.value1/2).
!          Thus work out the registers set by the insn and regs mentioned
!          in cc_status.value1/2.  */
! 
!       if (cc_status.value1
!           || cc_status.value2)
!         {
!           HARD_REG_SET regs_used;
!           HARD_REG_SET regs_set;
!           CLEAR_HARD_REG_SET (regs_used);
! 
!           if (cc_status.value1
!               && !CONSTANT_P (cc_status.value1))
!             {
!               find_all_hard_regs (cc_status.value1, &regs_used);
!             }
! 
!           if (cc_status.value2
!               && !CONSTANT_P (cc_status.value2))
!             {
!               find_all_hard_regs (cc_status.value2, &regs_used);
!             }
! 
!           find_all_hard_reg_sets (insn, &regs_set, false);
! 
!           if (hard_reg_set_intersect_p (regs_used, regs_set))
!             {
!               CC_STATUS_INIT;
!             }
!         }
! 
!       break; // CC_NONE
  
      case CC_SET_N:
        CC_STATUS_INIT;
*************** out_movqi_r_mr (rtx_insn *insn, rtx op[]
*** 3458,3464 ****
    if (CONSTANT_ADDRESS_P (x))
      {
        int n_words = AVR_TINY ? 1 : 2;
!       return optimize > 0 && io_address_operand (x, QImode)
          ? avr_asm_len ("in %0,%i1", op, plen, -1)
          : avr_asm_len ("lds %0,%m1", op, plen, -n_words);
      }
--- 3520,3526 ----
    if (CONSTANT_ADDRESS_P (x))
      {
        int n_words = AVR_TINY ? 1 : 2;
!       return io_address_operand (x, QImode)
          ? avr_asm_len ("in %0,%i1", op, plen, -1)
          : avr_asm_len ("lds %0,%m1", op, plen, -n_words);
      }
*************** out_movhi_r_mr (rtx_insn *insn, rtx op[]
*** 3713,3719 ****
    else if (CONSTANT_ADDRESS_P (base))
      {
        int n_words = AVR_TINY ? 2 : 4;
!       return optimize > 0 && io_address_operand (base, HImode)
          ? avr_asm_len ("in %A0,%i1" CR_TAB
                         "in %B0,%i1+1", op, plen, -2)
  
--- 3775,3781 ----
    else if (CONSTANT_ADDRESS_P (base))
      {
        int n_words = AVR_TINY ? 2 : 4;
!       return io_address_operand (base, HImode)
          ? avr_asm_len ("in %A0,%i1" CR_TAB
                         "in %B0,%i1+1", op, plen, -2)
  
*************** out_movqi_mr_r (rtx_insn *insn, rtx op[]
*** 4841,4847 ****
    if (CONSTANT_ADDRESS_P (x))
      {
        int n_words = AVR_TINY ? 1 : 2;
!       return optimize > 0 && io_address_operand (x, QImode)
          ? avr_asm_len ("out %i0,%1", op, plen, -1)
          : avr_asm_len ("sts %m0,%1", op, plen, -n_words);
      }
--- 4903,4909 ----
    if (CONSTANT_ADDRESS_P (x))
      {
        int n_words = AVR_TINY ? 1 : 2;
!       return io_address_operand (x, QImode)
          ? avr_asm_len ("out %i0,%1", op, plen, -1)
          : avr_asm_len ("sts %m0,%1", op, plen, -n_words);
      }
*************** avr_out_movhi_mr_r_xmega (rtx_insn *insn
*** 4917,4929 ****
  
    if (CONSTANT_ADDRESS_P (base))
      {
!       int n_words = AVR_TINY ? 2 : 4;
!       return optimize > 0 && io_address_operand (base, HImode)
          ? avr_asm_len ("out %i0,%A1" CR_TAB
                         "out %i0+1,%B1", op, plen, -2)
  
          : avr_asm_len ("sts %m0,%A1" CR_TAB
!                        "sts %m0+1,%B1", op, plen, -n_words);
      }
  
    if (reg_base > 0)
--- 4979,4990 ----
  
    if (CONSTANT_ADDRESS_P (base))
      {
!       return io_address_operand (base, HImode)
          ? avr_asm_len ("out %i0,%A1" CR_TAB
                         "out %i0+1,%B1", op, plen, -2)
  
          : avr_asm_len ("sts %m0,%A1" CR_TAB
!                        "sts %m0+1,%B1", op, plen, -4);
      }
  
    if (reg_base > 0)
*************** out_movhi_mr_r (rtx_insn *insn, rtx op[]
*** 5100,5106 ****
    if (CONSTANT_ADDRESS_P (base))
      {
        int n_words = AVR_TINY ? 2 : 4;
!       return optimize > 0 && io_address_operand (base, HImode)
          ? avr_asm_len ("out %i0+1,%B1" CR_TAB
                         "out %i0,%A1", op, plen, -2)
  
--- 5161,5167 ----
    if (CONSTANT_ADDRESS_P (base))
      {
        int n_words = AVR_TINY ? 2 : 4;
!       return io_address_operand (base, HImode)
          ? avr_asm_len ("out %i0+1,%B1" CR_TAB
                         "out %i0,%A1", op, plen, -2)
  
*************** avr_handle_addr_attribute (tree *node, t
*** 9023,9032 ****
    bool io_p = (strncmp (IDENTIFIER_POINTER (name), "io", 2) == 0);
    location_t loc = DECL_SOURCE_LOCATION (*node);
  
!   if (TREE_CODE (*node) != VAR_DECL)
      {
!       warning_at (loc, 0, "%qE attribute only applies to variables", name);
        *no_add = true;
      }
  
    if (args != NULL_TREE)
--- 9084,9095 ----
    bool io_p = (strncmp (IDENTIFIER_POINTER (name), "io", 2) == 0);
    location_t loc = DECL_SOURCE_LOCATION (*node);
  
!   if (!VAR_P (*node))
      {
!       warning_at (loc, OPT_Wattributes, "%qE attribute only applies to "
! 		  "variables", name);
        *no_add = true;
+       return NULL_TREE;
      }
  
    if (args != NULL_TREE)
*************** avr_handle_addr_attribute (tree *node, t
*** 9036,9043 ****
        tree arg = TREE_VALUE (args);
        if (TREE_CODE (arg) != INTEGER_CST)
  	{
! 	  warning (0, "%qE attribute allows only an integer constant argument",
! 		   name);
  	  *no_add = true;
  	}
        else if (io_p
--- 9099,9106 ----
        tree arg = TREE_VALUE (args);
        if (TREE_CODE (arg) != INTEGER_CST)
  	{
! 	  warning_at (loc, OPT_Wattributes, "%qE attribute allows only an "
! 		      "integer constant argument", name);
  	  *no_add = true;
  	}
        else if (io_p
*************** avr_handle_addr_attribute (tree *node, t
*** 9046,9064 ****
  			? low_io_address_operand : io_address_operand)
  			 (GEN_INT (TREE_INT_CST_LOW (arg)), QImode)))
  	{
! 	  warning_at (loc, 0, "%qE attribute address out of range", name);
  	  *no_add = true;
  	}
        else
  	{
  	  tree attribs = DECL_ATTRIBUTES (*node);
! 	  const char *names[] = { "io", "io_low", "address", NULL } ;
  	  for (const char **p = names; *p; p++)
  	    {
  	      tree other = lookup_attribute (*p, attribs);
  	      if (other && TREE_VALUE (other))
  		{
! 		  warning_at (loc, 0,
  			      "both %s and %qE attribute provide address",
  			      *p, name);
  		  *no_add = true;
--- 9109,9128 ----
  			? low_io_address_operand : io_address_operand)
  			 (GEN_INT (TREE_INT_CST_LOW (arg)), QImode)))
  	{
! 	  warning_at (loc, OPT_Wattributes, "%qE attribute address "
! 		      "out of range", name);
  	  *no_add = true;
  	}
        else
  	{
  	  tree attribs = DECL_ATTRIBUTES (*node);
! 	  const char *names[] = { "io", "io_low", "address", NULL };
  	  for (const char **p = names; *p; p++)
  	    {
  	      tree other = lookup_attribute (*p, attribs);
  	      if (other && TREE_VALUE (other))
  		{
! 		  warning_at (loc, OPT_Wattributes,
  			      "both %s and %qE attribute provide address",
  			      *p, name);
  		  *no_add = true;
*************** avr_handle_addr_attribute (tree *node, t
*** 9069,9075 ****
      }
  
    if (*no_add == false && io_p && !TREE_THIS_VOLATILE (*node))
!     warning_at (loc, 0, "%qE attribute on non-volatile variable", name);
  
    return NULL_TREE;
  }
--- 9133,9140 ----
      }
  
    if (*no_add == false && io_p && !TREE_THIS_VOLATILE (*node))
!     warning_at (loc, OPT_Wattributes, "%qE attribute on non-volatile variable",
! 		name);
  
    return NULL_TREE;
  }
*************** avr_eval_addr_attrib (rtx x)
*** 9086,9091 ****
--- 9151,9158 ----
        if (SYMBOL_REF_FLAGS (x) & SYMBOL_FLAG_IO)
  	{
  	  attr = lookup_attribute ("io", DECL_ATTRIBUTES (decl));
+ 	  if (!attr || !TREE_VALUE (attr))
+ 	    attr = lookup_attribute ("io_low", DECL_ATTRIBUTES (decl));
  	  gcc_assert (attr);
  	}
        if (!attr || !TREE_VALUE (attr))
*************** avr_attribute_table[] =
*** 9115,9125 ****
      false },
    { "OS_main",   0, 0, false, true,  true,   avr_handle_fntype_attribute,
      false },
!   { "io",        0, 1, false, false, false,  avr_handle_addr_attribute,
      false },
!   { "io_low",    0, 1, false, false, false,  avr_handle_addr_attribute,
      false },
!   { "address",   1, 1, false, false, false,  avr_handle_addr_attribute,
      false },
    { NULL,        0, 0, false, false, false, NULL, false }
  };
--- 9182,9192 ----
      false },
    { "OS_main",   0, 0, false, true,  true,   avr_handle_fntype_attribute,
      false },
!   { "io",        0, 1, true, false, false,  avr_handle_addr_attribute,
      false },
!   { "io_low",    0, 1, true, false, false,  avr_handle_addr_attribute,
      false },
!   { "address",   1, 1, true, false, false,  avr_handle_addr_attribute,
      false },
    { NULL,        0, 0, false, false, false, NULL, false }
  };
*************** avr_encode_section_info (tree decl, rtx
*** 9634,9646 ****
  
    if (new_decl_p
        && decl && DECL_P (decl)
-       && NULL_TREE == DECL_INITIAL (decl)
        && !DECL_EXTERNAL (decl)
        && avr_progmem_p (decl, DECL_ATTRIBUTES (decl)))
      {
!       warning (OPT_Wuninitialized,
!                "uninitialized variable %q+D put into "
!                "program memory area", decl);
      }
  
    default_encode_section_info (decl, rtl, new_decl_p);
--- 9701,9726 ----
  
    if (new_decl_p
        && decl && DECL_P (decl)
        && !DECL_EXTERNAL (decl)
        && avr_progmem_p (decl, DECL_ATTRIBUTES (decl)))
      {
!       if (!TREE_READONLY (decl))
!         {
!           // This might happen with C++ if stuff needs constructing.
!           error ("variable %q+D with dynamic initialization put "
!                  "into program memory area", decl);
!         }
!       else if (NULL_TREE == DECL_INITIAL (decl))
!         {
!           // Don't warn for (implicit) aliases like in PR80462.
!           tree asmname = DECL_ASSEMBLER_NAME (decl);
!           varpool_node *node = varpool_node::get_for_asmname (asmname);
!           bool alias_p = node && node->alias;
! 
!           if (!alias_p)
!             warning (OPT_Wuninitialized, "uninitialized variable %q+D put "
!                      "into program memory area", decl);
!         }
      }
  
    default_encode_section_info (decl, rtl, new_decl_p);
*************** avr_rtx_costs_1 (rtx x, int codearg, int
*** 10199,10204 ****
--- 10279,10285 ----
            break;
  
  	case SImode:
+ 	case DImode:
  	  if (AVR_HAVE_MUL)
              {
                if (!speed)
*************** avr_rtx_costs_1 (rtx x, int codearg, int
*** 10224,10230 ****
                  *total = COSTS_N_INSNS (AVR_HAVE_JMP_CALL ? 5 : 4);
              }
  
!           return true;
  
  	default:
  	  return false;
--- 10305,10314 ----
                  *total = COSTS_N_INSNS (AVR_HAVE_JMP_CALL ? 5 : 4);
              }
  
! 	   if (mode == DImode)
! 	     *total *= 2;
! 
! 	   return true;
  
  	default:
  	  return false;
*************** avr_address_cost (rtx x, machine_mode mo
*** 10801,10813 ****
        && (REG_P (XEXP (x, 0))
            || GET_CODE (XEXP (x, 0)) == SUBREG))
      {
!       if (INTVAL (XEXP (x, 1)) >= 61)
          cost = 18;
      }
    else if (CONSTANT_ADDRESS_P (x))
      {
!       if (optimize > 0
!           && io_address_operand (x, QImode))
          cost = 2;
      }
  
--- 10885,10896 ----
        && (REG_P (XEXP (x, 0))
            || GET_CODE (XEXP (x, 0)) == SUBREG))
      {
!       if (INTVAL (XEXP (x, 1)) > MAX_LD_OFFSET(mode))
          cost = 18;
      }
    else if (CONSTANT_ADDRESS_P (x))
      {
!       if (io_address_operand (x, QImode))
          cost = 2;
      }
  
diff -Nrcpad gcc-5.4.0/gcc/config/avr/avr.md gcc-5.5.0/gcc/config/avr/avr.md
*** gcc-5.4.0/gcc/config/avr/avr.md	Thu Feb 26 19:43:54 2015
--- gcc-5.5.0/gcc/config/avr/avr.md	Mon Aug  1 12:44:18 2016
***************
*** 112,123 ****
  (define_attr "length" ""
    (cond [(eq_attr "type" "branch")
           (if_then_else (and (ge (minus (pc) (match_dup 0))
!                                 (const_int -63))
                              (le (minus (pc) (match_dup 0))
                                  (const_int 62)))
                         (const_int 1)
                         (if_then_else (and (ge (minus (pc) (match_dup 0))
!                                               (const_int -2045))
                                            (le (minus (pc) (match_dup 0))
                                                (const_int 2045)))
                                       (const_int 2)
--- 112,123 ----
  (define_attr "length" ""
    (cond [(eq_attr "type" "branch")
           (if_then_else (and (ge (minus (pc) (match_dup 0))
!                                 (const_int -62))
                              (le (minus (pc) (match_dup 0))
                                  (const_int 62)))
                         (const_int 1)
                         (if_then_else (and (ge (minus (pc) (match_dup 0))
!                                               (const_int -2044))
                                            (le (minus (pc) (match_dup 0))
                                                (const_int 2045)))
                                       (const_int 2)
***************
*** 641,646 ****
--- 641,662 ----
      if (avr_mem_flash_p (dest))
        DONE;
  
+     if (QImode == <MODE>mode
+         && SUBREG_P (src)
+         && CONSTANT_ADDRESS_P (SUBREG_REG (src))
+         && can_create_pseudo_p())
+       {
+         // store_bitfield may want to store a SYMBOL_REF or CONST in a
+         // structure that's represented as PSImode.  As the upper 16 bits
+         // of PSImode cannot be expressed as an HImode subreg, the rhs is
+         // decomposed into QImode (word_mode) subregs of SYMBOL_REF,
+         // CONST or LABEL_REF; cf. PR71103.
+ 
+         rtx const_addr = SUBREG_REG (src);
+         operands[1] = src = copy_rtx (src);
+         SUBREG_REG (src) = copy_to_mode_reg (GET_MODE (const_addr), const_addr);
+       }
+ 
      /* One of the operands has to be in a register.  */
      if (!register_operand (dest, <MODE>mode)
          && !reg_or_0_operand (src, <MODE>mode))
diff -Nrcpad gcc-5.4.0/gcc/config/avr/avr.opt gcc-5.5.0/gcc/config/avr/avr.opt
*** gcc-5.4.0/gcc/config/avr/avr.opt	Wed Apr 22 16:14:50 2015
--- gcc-5.5.0/gcc/config/avr/avr.opt	Tue Aug 22 09:48:48 2017
*************** Waddr-space-convert
*** 91,96 ****
--- 91,100 ----
  Warning C Report Var(avr_warn_addr_space_convert) Init(0)
  Warn if the address space of an address is changed.
  
+ Wmisspelled-isr
+ Warning C C++ Report Var(avr_warn_misspelled_isr) Init(1)
+ Warn if the ISR is misspelled, i.e. without __vector prefix. Enabled by default.
+ 
  mfract-convert-truncate
  Target Report Mask(FRACT_CONV_TRUNC)
  Allow to use truncation instead of rounding towards 0 for fractional int types
diff -Nrcpad gcc-5.4.0/gcc/config/avr/gen-avr-mmcu-specs.c gcc-5.5.0/gcc/config/avr/gen-avr-mmcu-specs.c
*** gcc-5.4.0/gcc/config/avr/gen-avr-mmcu-specs.c	Mon Apr 27 11:49:42 2015
--- gcc-5.5.0/gcc/config/avr/gen-avr-mmcu-specs.c	Tue Jun 21 10:43:12 2016
***************
*** 27,33 ****
  
  #include "avr-devices.c"
  
! // Get rid of "defaults.h".  We just need tm.h for `WITH_AVRLIBS' and
  // and `WITH_RTEMS'.  */
  #define GCC_DEFAULTS_H
  
--- 27,33 ----
  
  #include "avr-devices.c"
  
! // Get rid of "defaults.h".  We just need tm.h for `WITH_AVRLIBC' and
  // and `WITH_RTEMS'.  */
  #define GCC_DEFAULTS_H
  
*************** print_mcu (const avr_mcu_t *mcu)
*** 242,253 ****
        fprintf (f, "*link_data_start:\n");
        if (mcu->data_section_start
            != arch->default_data_section_start)
!         fprintf (f, "\t-Tdata 0x%lX", 0x800000UL + mcu->data_section_start);
        fprintf (f, "\n\n");
  
        fprintf (f, "*link_text_start:\n");
        if (mcu->text_section_start != 0x0)
!         fprintf (f, "\t-Ttext 0x%lX", 0UL + mcu->text_section_start);
        fprintf (f, "\n\n");
      }
  
--- 242,254 ----
        fprintf (f, "*link_data_start:\n");
        if (mcu->data_section_start
            != arch->default_data_section_start)
!         fprintf (f, "\t%%{!Tdata:-Tdata 0x%lX}",
!                  0x800000UL + mcu->data_section_start);
        fprintf (f, "\n\n");
  
        fprintf (f, "*link_text_start:\n");
        if (mcu->text_section_start != 0x0)
!         fprintf (f, "\t%%{!Ttext:-Ttext 0x%lX}", 0UL + mcu->text_section_start);
        fprintf (f, "\n\n");
      }
  
diff -Nrcpad gcc-5.4.0/gcc/config/avr/gen-avr-mmcu-texi.c gcc-5.5.0/gcc/config/avr/gen-avr-mmcu-texi.c
*** gcc-5.4.0/gcc/config/avr/gen-avr-mmcu-texi.c	Tue Mar 10 09:50:41 2015
--- gcc-5.5.0/gcc/config/avr/gen-avr-mmcu-texi.c	Mon Oct 10 14:27:07 2016
***************
*** 19,24 ****
--- 19,25 ----
  
  #include <stdlib.h>
  #include <stdio.h>
+ #include <string.h>
  
  #define IN_GEN_AVR_MMCU_TEXI
  
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx2intrin.h gcc-5.5.0/gcc/config/i386/avx2intrin.h
*** gcc-5.4.0/gcc/config/i386/avx2intrin.h	Fri Jan 16 11:01:08 2015
--- gcc-5.5.0/gcc/config/i386/avx2intrin.h	Thu Jun  1 21:51:51 2017
*************** _mm_srlv_epi64 (__m128i __X, __m128i __Y
*** 1246,1667 ****
  #ifdef __OPTIMIZE__
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32gather_pd (double const *base, __m128i index, const int scale)
  {
!   __v2df zero = _mm_setzero_pd ();
!   __v2df mask = _mm_cmpeq_pd (zero, zero);
  
    return (__m128d) __builtin_ia32_gathersiv2df (_mm_undefined_pd (),
! 						base,
! 						(__v4si)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32gather_pd (__m128d src, double const *base, __m128i index,
! 		       __m128d mask, const int scale)
  {
!   return (__m128d) __builtin_ia32_gathersiv2df ((__v2df)src,
! 						base,
! 						(__v4si)index,
! 						(__v2df)mask,
! 						scale);
  }
  
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32gather_pd (double const *base, __m128i index, const int scale)
  {
!   __v4df zero = _mm256_setzero_pd ();
!   __v4df mask = _mm256_cmp_pd (zero, zero, _CMP_EQ_OQ);
  
    return (__m256d) __builtin_ia32_gathersiv4df (_mm256_undefined_pd (),
! 						base,
! 						(__v4si)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32gather_pd (__m256d src, double const *base,
! 			  __m128i index, __m256d mask, const int scale)
  {
!   return (__m256d) __builtin_ia32_gathersiv4df ((__v4df)src,
! 						base,
! 						(__v4si)index,
! 						(__v4df)mask,
! 						scale);
  }
  
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64gather_pd (double const *base, __m128i index, const int scale)
  {
!   __v2df src = _mm_setzero_pd ();
!   __v2df mask = _mm_cmpeq_pd (src, src);
  
!   return (__m128d) __builtin_ia32_gatherdiv2df (src,
! 						base,
! 						(__v2di)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64gather_pd (__m128d src, double const *base, __m128i index,
! 		       __m128d mask, const int scale)
  {
!   return (__m128d) __builtin_ia32_gatherdiv2df ((__v2df)src,
! 						base,
! 						(__v2di)index,
! 						(__v2df)mask,
! 						scale);
  }
  
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64gather_pd (double const *base, __m256i index, const int scale)
  {
!   __v4df src = _mm256_setzero_pd ();
!   __v4df mask = _mm256_cmp_pd (src, src, _CMP_EQ_OQ);
  
!   return (__m256d) __builtin_ia32_gatherdiv4df (src,
! 						base,
! 						(__v4di)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64gather_pd (__m256d src, double const *base,
! 			  __m256i index, __m256d mask, const int scale)
  {
!   return (__m256d) __builtin_ia32_gatherdiv4df ((__v4df)src,
! 						base,
! 						(__v4di)index,
! 						(__v4df)mask,
! 						scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32gather_ps (float const *base, __m128i index, const int scale)
  {
!   __v4sf src = _mm_setzero_ps ();
!   __v4sf mask = _mm_cmpeq_ps (src, src);
  
!   return (__m128) __builtin_ia32_gathersiv4sf (src,
! 					       base,
! 					       (__v4si)index,
! 					       mask,
! 					       scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32gather_ps (__m128 src, float const *base, __m128i index,
! 		       __m128 mask, const int scale)
  {
!   return (__m128) __builtin_ia32_gathersiv4sf ((__v4sf)src,
! 					       base,
! 					       (__v4si)index,
! 					       (__v4sf)mask,
! 					       scale);
  }
  
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32gather_ps (float const *base, __m256i index, const int scale)
  {
!   __v8sf src = _mm256_setzero_ps ();
!   __v8sf mask = _mm256_cmp_ps (src, src, _CMP_EQ_OQ);
  
!   return (__m256) __builtin_ia32_gathersiv8sf (src,
! 					       base,
! 					       (__v8si)index,
! 					       mask,
! 					       scale);
  }
  
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32gather_ps (__m256 src, float const *base,
! 			  __m256i index, __m256 mask, const int scale)
  {
!   return (__m256) __builtin_ia32_gathersiv8sf ((__v8sf)src,
! 					       base,
! 					       (__v8si)index,
! 					       (__v8sf)mask,
! 					       scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64gather_ps (float const *base, __m128i index, const int scale)
  {
!   __v4sf src = _mm_setzero_ps ();
!   __v4sf mask = _mm_cmpeq_ps (src, src);
  
!   return (__m128) __builtin_ia32_gatherdiv4sf (src,
! 					       base,
! 					       (__v2di)index,
! 					       mask,
! 					       scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64gather_ps (__m128 src, float const *base, __m128i index,
! 		       __m128 mask, const int scale)
  {
!   return (__m128) __builtin_ia32_gatherdiv4sf ((__v4sf)src,
! 						base,
! 						(__v2di)index,
! 						(__v4sf)mask,
! 						scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64gather_ps (float const *base, __m256i index, const int scale)
  {
!   __v4sf src = _mm_setzero_ps ();
!   __v4sf mask = _mm_cmpeq_ps (src, src);
  
!   return (__m128) __builtin_ia32_gatherdiv4sf256 (src,
! 						  base,
! 						  (__v4di)index,
! 						  mask,
! 						  scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64gather_ps (__m128 src, float const *base,
! 			  __m256i index, __m128 mask, const int scale)
  {
!   return (__m128) __builtin_ia32_gatherdiv4sf256 ((__v4sf)src,
! 						  base,
! 						  (__v4di)index,
! 						  (__v4sf)mask,
! 						  scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32gather_epi64 (long long int const *base,
! 		     __m128i index, const int scale)
  {
!   __v2di src = __extension__ (__v2di){ 0, 0 };
!   __v2di mask = __extension__ (__v2di){ ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gathersiv2di (src,
! 						base,
! 						(__v4si)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32gather_epi64 (__m128i src, long long int const *base,
! 			  __m128i index, __m128i mask, const int scale)
  {
!   return (__m128i) __builtin_ia32_gathersiv2di ((__v2di)src,
! 						base,
! 						(__v4si)index,
! 						(__v2di)mask,
! 						scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32gather_epi64 (long long int const *base,
! 			__m128i index, const int scale)
  {
!   __v4di src = __extension__ (__v4di){ 0, 0, 0, 0 };
!   __v4di mask = __extension__ (__v4di){ ~0, ~0, ~0, ~0 };
  
!   return (__m256i) __builtin_ia32_gathersiv4di (src,
! 						base,
! 						(__v4si)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32gather_epi64 (__m256i src, long long int const *base,
! 			     __m128i index, __m256i mask, const int scale)
  {
!   return (__m256i) __builtin_ia32_gathersiv4di ((__v4di)src,
! 						base,
! 						(__v4si)index,
! 						(__v4di)mask,
! 						scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64gather_epi64 (long long int const *base,
! 		     __m128i index, const int scale)
  {
!   __v2di src = __extension__ (__v2di){ 0, 0 };
!   __v2di mask = __extension__ (__v2di){ ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gatherdiv2di (src,
! 						base,
! 						(__v2di)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64gather_epi64 (__m128i src, long long int const *base, __m128i index,
! 			  __m128i mask, const int scale)
  {
!   return (__m128i) __builtin_ia32_gatherdiv2di ((__v2di)src,
! 						base,
! 						(__v2di)index,
! 						(__v2di)mask,
! 						scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64gather_epi64 (long long int const *base,
! 			__m256i index, const int scale)
  {
!   __v4di src = __extension__ (__v4di){ 0, 0, 0, 0 };
!   __v4di mask = __extension__ (__v4di){ ~0, ~0, ~0, ~0 };
  
!   return (__m256i) __builtin_ia32_gatherdiv4di (src,
! 						base,
! 						(__v4di)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64gather_epi64 (__m256i src, long long int const *base,
! 			     __m256i index, __m256i mask, const int scale)
  {
!   return (__m256i) __builtin_ia32_gatherdiv4di ((__v4di)src,
! 						base,
! 						(__v4di)index,
! 						(__v4di)mask,
! 						scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32gather_epi32 (int const *base, __m128i index, const int scale)
  {
!   __v4si src = __extension__ (__v4si){ 0, 0, 0, 0 };
!   __v4si mask = __extension__ (__v4si){ ~0, ~0, ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gathersiv4si (src,
! 					       base,
! 					       (__v4si)index,
! 					       mask,
! 					       scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32gather_epi32 (__m128i src, int const *base, __m128i index,
! 			  __m128i mask, const int scale)
  {
!   return (__m128i) __builtin_ia32_gathersiv4si ((__v4si)src,
! 						base,
! 						(__v4si)index,
! 						(__v4si)mask,
! 						scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32gather_epi32 (int const *base, __m256i index, const int scale)
  {
!   __v8si src = __extension__ (__v8si){ 0, 0, 0, 0, 0, 0, 0, 0 };
!   __v8si mask = __extension__ (__v8si){ ~0, ~0, ~0, ~0, ~0, ~0, ~0, ~0 };
  
!   return (__m256i) __builtin_ia32_gathersiv8si (src,
! 						base,
! 						(__v8si)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32gather_epi32 (__m256i src, int const *base,
! 			     __m256i index, __m256i mask, const int scale)
  {
!   return (__m256i) __builtin_ia32_gathersiv8si ((__v8si)src,
! 						base,
! 						(__v8si)index,
! 						(__v8si)mask,
! 						scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64gather_epi32 (int const *base, __m128i index, const int scale)
  {
!   __v4si src = __extension__ (__v4si){ 0, 0, 0, 0 };
!   __v4si mask = __extension__ (__v4si){ ~0, ~0, ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gatherdiv4si (src,
! 						base,
! 						(__v2di)index,
! 						mask,
! 						scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64gather_epi32 (__m128i src, int const *base, __m128i index,
! 			  __m128i mask, const int scale)
  {
!   return (__m128i) __builtin_ia32_gatherdiv4si ((__v4si)src,
! 						base,
! 						(__v2di)index,
! 						(__v4si)mask,
! 						scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64gather_epi32 (int const *base, __m256i index, const int scale)
  {
!   __v4si src = __extension__ (__v4si){ 0, 0, 0, 0 };
!   __v4si mask = __extension__ (__v4si){ ~0, ~0, ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gatherdiv4si256 (src,
! 						  base,
! 						  (__v4di)index,
! 						  mask,
! 						  scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64gather_epi32 (__m128i src, int const *base,
! 			     __m256i index, __m128i mask, const int scale)
  {
!   return (__m128i) __builtin_ia32_gatherdiv4si256 ((__v4si)src,
! 						   base,
! 						   (__v4di)index,
! 						   (__v4si)mask,
! 						   scale);
  }
  #else /* __OPTIMIZE__ */
  #define _mm_i32gather_pd(BASE, INDEX, SCALE)				\
--- 1246,1671 ----
  #ifdef __OPTIMIZE__
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32gather_pd (double const *__base, __m128i __index, const int __scale)
  {
!   __v2df __zero = _mm_setzero_pd ();
!   __v2df __mask = _mm_cmpeq_pd (__zero, __zero);
  
    return (__m128d) __builtin_ia32_gathersiv2df (_mm_undefined_pd (),
! 						__base,
! 						(__v4si)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32gather_pd (__m128d __src, double const *__base, __m128i __index,
! 		       __m128d __mask, const int __scale)
  {
!   return (__m128d) __builtin_ia32_gathersiv2df ((__v2df)__src,
! 						__base,
! 						(__v4si)__index,
! 						(__v2df)__mask,
! 						__scale);
  }
  
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32gather_pd (double const *__base, __m128i __index, const int __scale)
  {
!   __v4df __zero = _mm256_setzero_pd ();
!   __v4df __mask = _mm256_cmp_pd (__zero, __zero, _CMP_EQ_OQ);
  
    return (__m256d) __builtin_ia32_gathersiv4df (_mm256_undefined_pd (),
! 						__base,
! 						(__v4si)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32gather_pd (__m256d __src, double const *__base,
! 			  __m128i __index, __m256d __mask, const int __scale)
  {
!   return (__m256d) __builtin_ia32_gathersiv4df ((__v4df)__src,
! 						__base,
! 						(__v4si)__index,
! 						(__v4df)__mask,
! 						__scale);
  }
  
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64gather_pd (double const *__base, __m128i __index, const int __scale)
  {
!   __v2df __src = _mm_setzero_pd ();
!   __v2df __mask = _mm_cmpeq_pd (__src, __src);
  
!   return (__m128d) __builtin_ia32_gatherdiv2df (__src,
! 						__base,
! 						(__v2di)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64gather_pd (__m128d __src, double const *__base, __m128i __index,
! 		       __m128d __mask, const int __scale)
  {
!   return (__m128d) __builtin_ia32_gatherdiv2df ((__v2df)__src,
! 						__base,
! 						(__v2di)__index,
! 						(__v2df)__mask,
! 						__scale);
  }
  
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64gather_pd (double const *__base, __m256i __index, const int __scale)
  {
!   __v4df __src = _mm256_setzero_pd ();
!   __v4df __mask = _mm256_cmp_pd (__src, __src, _CMP_EQ_OQ);
  
!   return (__m256d) __builtin_ia32_gatherdiv4df (__src,
! 						__base,
! 						(__v4di)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64gather_pd (__m256d __src, double const *__base,
! 			  __m256i __index, __m256d __mask, const int __scale)
  {
!   return (__m256d) __builtin_ia32_gatherdiv4df ((__v4df)__src,
! 						__base,
! 						(__v4di)__index,
! 						(__v4df)__mask,
! 						__scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32gather_ps (float const *__base, __m128i __index, const int __scale)
  {
!   __v4sf __src = _mm_setzero_ps ();
!   __v4sf __mask = _mm_cmpeq_ps (__src, __src);
  
!   return (__m128) __builtin_ia32_gathersiv4sf (__src,
! 					       __base,
! 					       (__v4si)__index,
! 					       __mask,
! 					       __scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32gather_ps (__m128 __src, float const *__base, __m128i __index,
! 		       __m128 __mask, const int __scale)
  {
!   return (__m128) __builtin_ia32_gathersiv4sf ((__v4sf)__src,
! 					       __base,
! 					       (__v4si)__index,
! 					       (__v4sf)__mask,
! 					       __scale);
  }
  
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32gather_ps (float const *__base, __m256i __index, const int __scale)
  {
!   __v8sf __src = _mm256_setzero_ps ();
!   __v8sf __mask = _mm256_cmp_ps (__src, __src, _CMP_EQ_OQ);
  
!   return (__m256) __builtin_ia32_gathersiv8sf (__src,
! 					       __base,
! 					       (__v8si)__index,
! 					       __mask,
! 					       __scale);
  }
  
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32gather_ps (__m256 __src, float const *__base,
! 			  __m256i __index, __m256 __mask, const int __scale)
  {
!   return (__m256) __builtin_ia32_gathersiv8sf ((__v8sf)__src,
! 					       __base,
! 					       (__v8si)__index,
! 					       (__v8sf)__mask,
! 					       __scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64gather_ps (float const *__base, __m128i __index, const int __scale)
  {
!   __v4sf __src = _mm_setzero_ps ();
!   __v4sf __mask = _mm_cmpeq_ps (__src, __src);
  
!   return (__m128) __builtin_ia32_gatherdiv4sf (__src,
! 					       __base,
! 					       (__v2di)__index,
! 					       __mask,
! 					       __scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64gather_ps (__m128 __src, float const *__base, __m128i __index,
! 		       __m128 __mask, const int __scale)
  {
!   return (__m128) __builtin_ia32_gatherdiv4sf ((__v4sf)__src,
! 						__base,
! 						(__v2di)__index,
! 						(__v4sf)__mask,
! 						__scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64gather_ps (float const *__base, __m256i __index, const int __scale)
  {
!   __v4sf __src = _mm_setzero_ps ();
!   __v4sf __mask = _mm_cmpeq_ps (__src, __src);
  
!   return (__m128) __builtin_ia32_gatherdiv4sf256 (__src,
! 						  __base,
! 						  (__v4di)__index,
! 						  __mask,
! 						  __scale);
  }
  
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64gather_ps (__m128 __src, float const *__base,
! 			  __m256i __index, __m128 __mask, const int __scale)
  {
!   return (__m128) __builtin_ia32_gatherdiv4sf256 ((__v4sf)__src,
! 						  __base,
! 						  (__v4di)__index,
! 						  (__v4sf)__mask,
! 						  __scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32gather_epi64 (long long int const *__base,
! 		     __m128i __index, const int __scale)
  {
!   __v2di __src = __extension__ (__v2di){ 0, 0 };
!   __v2di __mask = __extension__ (__v2di){ ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gathersiv2di (__src,
! 						__base,
! 						(__v4si)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32gather_epi64 (__m128i __src, long long int const *__base,
! 			  __m128i __index, __m128i __mask, const int __scale)
  {
!   return (__m128i) __builtin_ia32_gathersiv2di ((__v2di)__src,
! 						__base,
! 						(__v4si)__index,
! 						(__v2di)__mask,
! 						__scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32gather_epi64 (long long int const *__base,
! 			__m128i __index, const int __scale)
  {
!   __v4di __src = __extension__ (__v4di){ 0, 0, 0, 0 };
!   __v4di __mask = __extension__ (__v4di){ ~0, ~0, ~0, ~0 };
  
!   return (__m256i) __builtin_ia32_gathersiv4di (__src,
! 						__base,
! 						(__v4si)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32gather_epi64 (__m256i __src, long long int const *__base,
! 			     __m128i __index, __m256i __mask,
! 			     const int __scale)
  {
!   return (__m256i) __builtin_ia32_gathersiv4di ((__v4di)__src,
! 						__base,
! 						(__v4si)__index,
! 						(__v4di)__mask,
! 						__scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64gather_epi64 (long long int const *__base,
! 		     __m128i __index, const int __scale)
  {
!   __v2di __src = __extension__ (__v2di){ 0, 0 };
!   __v2di __mask = __extension__ (__v2di){ ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gatherdiv2di (__src,
! 						__base,
! 						(__v2di)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64gather_epi64 (__m128i __src, long long int const *__base,
! 			  __m128i __index, __m128i __mask, const int __scale)
  {
!   return (__m128i) __builtin_ia32_gatherdiv2di ((__v2di)__src,
! 						__base,
! 						(__v2di)__index,
! 						(__v2di)__mask,
! 						__scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64gather_epi64 (long long int const *__base,
! 			__m256i __index, const int __scale)
  {
!   __v4di __src = __extension__ (__v4di){ 0, 0, 0, 0 };
!   __v4di __mask = __extension__ (__v4di){ ~0, ~0, ~0, ~0 };
  
!   return (__m256i) __builtin_ia32_gatherdiv4di (__src,
! 						__base,
! 						(__v4di)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64gather_epi64 (__m256i __src, long long int const *__base,
! 			     __m256i __index, __m256i __mask,
! 			     const int __scale)
  {
!   return (__m256i) __builtin_ia32_gatherdiv4di ((__v4di)__src,
! 						__base,
! 						(__v4di)__index,
! 						(__v4di)__mask,
! 						__scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32gather_epi32 (int const *__base, __m128i __index, const int __scale)
  {
!   __v4si __src = __extension__ (__v4si){ 0, 0, 0, 0 };
!   __v4si __mask = __extension__ (__v4si){ ~0, ~0, ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gathersiv4si (__src,
! 						__base,
! 						(__v4si)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32gather_epi32 (__m128i __src, int const *__base, __m128i __index,
! 			  __m128i __mask, const int __scale)
  {
!   return (__m128i) __builtin_ia32_gathersiv4si ((__v4si)__src,
! 						__base,
! 						(__v4si)__index,
! 						(__v4si)__mask,
! 						__scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32gather_epi32 (int const *__base, __m256i __index, const int __scale)
  {
!   __v8si __src = __extension__ (__v8si){ 0, 0, 0, 0, 0, 0, 0, 0 };
!   __v8si __mask = __extension__ (__v8si){ ~0, ~0, ~0, ~0, ~0, ~0, ~0, ~0 };
  
!   return (__m256i) __builtin_ia32_gathersiv8si (__src,
! 						__base,
! 						(__v8si)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32gather_epi32 (__m256i __src, int const *__base,
! 			     __m256i __index, __m256i __mask,
! 			     const int __scale)
  {
!   return (__m256i) __builtin_ia32_gathersiv8si ((__v8si)__src,
! 						__base,
! 						(__v8si)__index,
! 						(__v8si)__mask,
! 						__scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64gather_epi32 (int const *__base, __m128i __index, const int __scale)
  {
!   __v4si __src = __extension__ (__v4si){ 0, 0, 0, 0 };
!   __v4si __mask = __extension__ (__v4si){ ~0, ~0, ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gatherdiv4si (__src,
! 						__base,
! 						(__v2di)__index,
! 						__mask,
! 						__scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64gather_epi32 (__m128i __src, int const *__base, __m128i __index,
! 			  __m128i __mask, const int __scale)
  {
!   return (__m128i) __builtin_ia32_gatherdiv4si ((__v4si)__src,
! 						__base,
! 						(__v2di)__index,
! 						(__v4si)__mask,
! 						__scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64gather_epi32 (int const *__base, __m256i __index, const int __scale)
  {
!   __v4si __src = __extension__ (__v4si){ 0, 0, 0, 0 };
!   __v4si __mask = __extension__ (__v4si){ ~0, ~0, ~0, ~0 };
  
!   return (__m128i) __builtin_ia32_gatherdiv4si256 (__src,
! 						   __base,
! 						   (__v4di)__index,
! 						   __mask,
! 						   __scale);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64gather_epi32 (__m128i __src, int const *__base,
! 			     __m256i __index, __m128i __mask,
! 			     const int __scale)
  {
!   return (__m128i) __builtin_ia32_gatherdiv4si256 ((__v4si)__src,
! 						   __base,
! 						   (__v4di)__index,
! 						   (__v4si)__mask,
! 						   __scale);
  }
  #else /* __OPTIMIZE__ */
  #define _mm_i32gather_pd(BASE, INDEX, SCALE)				\
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512bwintrin.h gcc-5.5.0/gcc/config/i386/avx512bwintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512bwintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512bwintrin.h	Tue May 30 08:08:59 2017
*************** __attribute__ ((__gnu_inline__, __always
*** 270,278 ****
  _mm512_broadcastb_epi8 (__m128i __A)
  {
    return (__m512i) __builtin_ia32_pbroadcastb512_mask ((__v16qi) __A,
! 						       (__v64qi)_mm512_undefined_si512(),
! 						       (__mmask64) -
! 						       1);
  }
  
  extern __inline __m512i
--- 270,277 ----
  _mm512_broadcastb_epi8 (__m128i __A)
  {
    return (__m512i) __builtin_ia32_pbroadcastb512_mask ((__v16qi) __A,
! 						       (__v64qi)_mm512_undefined_epi32(),
! 						       (__mmask64) -1);
  }
  
  extern __inline __m512i
*************** __attribute__ ((__gnu_inline__, __always
*** 318,325 ****
  _mm512_broadcastw_epi16 (__m128i __A)
  {
    return (__m512i) __builtin_ia32_pbroadcastw512_mask ((__v8hi) __A,
! 						       (__v32hi)_mm512_undefined_si512(),
! 						       (__mmask32)-1);
  }
  
  extern __inline __m512i
--- 317,324 ----
  _mm512_broadcastw_epi16 (__m128i __A)
  {
    return (__m512i) __builtin_ia32_pbroadcastw512_mask ((__v8hi) __A,
! 						       (__v32hi)_mm512_undefined_epi32(),
! 						       (__mmask32) -1);
  }
  
  extern __inline __m512i
*************** _mm512_permutex2var_epi16 (__m512i __A,
*** 588,595 ****
  							/* idx */ ,
  							(__v32hi) __A,
  							(__v32hi) __B,
! 							(__mmask32) -
! 							1);
  }
  
  extern __inline __m512i
--- 587,593 ----
  							/* idx */ ,
  							(__v32hi) __A,
  							(__v32hi) __B,
! 							(__mmask32) -1);
  }
  
  extern __inline __m512i
*************** _mm512_cmpneq_epu8_mask (__m512i __X, __
*** 2284,2290 ****
  {
    return (__mmask64) __builtin_ia32_ucmpb512_mask ((__v64qi) __X,
  						   (__v64qi) __Y, 4,
! 						   (__mmask64) - 1);
  }
  
  extern __inline __mmask64
--- 2282,2288 ----
  {
    return (__mmask64) __builtin_ia32_ucmpb512_mask ((__v64qi) __X,
  						   (__v64qi) __Y, 4,
! 						   (__mmask64) -1);
  }
  
  extern __inline __mmask64
*************** _mm512_cmplt_epu8_mask (__m512i __X, __m
*** 2293,2299 ****
  {
    return (__mmask64) __builtin_ia32_ucmpb512_mask ((__v64qi) __X,
  						   (__v64qi) __Y, 1,
! 						   (__mmask64) - 1);
  }
  
  extern __inline __mmask64
--- 2291,2297 ----
  {
    return (__mmask64) __builtin_ia32_ucmpb512_mask ((__v64qi) __X,
  						   (__v64qi) __Y, 1,
! 						   (__mmask64) -1);
  }
  
  extern __inline __mmask64
*************** _mm512_cmpge_epu8_mask (__m512i __X, __m
*** 2302,2308 ****
  {
    return (__mmask64) __builtin_ia32_ucmpb512_mask ((__v64qi) __X,
  						   (__v64qi) __Y, 5,
! 						   (__mmask64) - 1);
  }
  
  extern __inline __mmask64
--- 2300,2306 ----
  {
    return (__mmask64) __builtin_ia32_ucmpb512_mask ((__v64qi) __X,
  						   (__v64qi) __Y, 5,
! 						   (__mmask64) -1);
  }
  
  extern __inline __mmask64
*************** _mm512_cmple_epu8_mask (__m512i __X, __m
*** 2311,2317 ****
  {
    return (__mmask64) __builtin_ia32_ucmpb512_mask ((__v64qi) __X,
  						   (__v64qi) __Y, 2,
! 						   (__mmask64) - 1);
  }
  
  extern __inline __mmask32
--- 2309,2315 ----
  {
    return (__mmask64) __builtin_ia32_ucmpb512_mask ((__v64qi) __X,
  						   (__v64qi) __Y, 2,
! 						   (__mmask64) -1);
  }
  
  extern __inline __mmask32
*************** _mm512_cmpneq_epu16_mask (__m512i __X, _
*** 2320,2326 ****
  {
    return (__mmask32) __builtin_ia32_ucmpw512_mask ((__v32hi) __X,
  						   (__v32hi) __Y, 4,
! 						   (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 2318,2324 ----
  {
    return (__mmask32) __builtin_ia32_ucmpw512_mask ((__v32hi) __X,
  						   (__v32hi) __Y, 4,
! 						   (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm512_cmplt_epu16_mask (__m512i __X, __
*** 2329,2335 ****
  {
    return (__mmask32) __builtin_ia32_ucmpw512_mask ((__v32hi) __X,
  						   (__v32hi) __Y, 1,
! 						   (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 2327,2333 ----
  {
    return (__mmask32) __builtin_ia32_ucmpw512_mask ((__v32hi) __X,
  						   (__v32hi) __Y, 1,
! 						   (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm512_cmpge_epu16_mask (__m512i __X, __
*** 2338,2344 ****
  {
    return (__mmask32) __builtin_ia32_ucmpw512_mask ((__v32hi) __X,
  						   (__v32hi) __Y, 5,
! 						   (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 2336,2342 ----
  {
    return (__mmask32) __builtin_ia32_ucmpw512_mask ((__v32hi) __X,
  						   (__v32hi) __Y, 5,
! 						   (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm512_cmple_epu16_mask (__m512i __X, __
*** 2347,2353 ****
  {
    return (__mmask32) __builtin_ia32_ucmpw512_mask ((__v32hi) __X,
  						   (__v32hi) __Y, 2,
! 						   (__mmask32) - 1);
  }
  
  extern __inline __mmask64
--- 2345,2351 ----
  {
    return (__mmask32) __builtin_ia32_ucmpw512_mask ((__v32hi) __X,
  						   (__v32hi) __Y, 2,
! 						   (__mmask32) -1);
  }
  
  extern __inline __mmask64
*************** _mm512_cmpneq_epi8_mask (__m512i __X, __
*** 2356,2362 ****
  {
    return (__mmask64) __builtin_ia32_cmpb512_mask ((__v64qi) __X,
  						  (__v64qi) __Y, 4,
! 						  (__mmask64) - 1);
  }
  
  extern __inline __mmask64
--- 2354,2360 ----
  {
    return (__mmask64) __builtin_ia32_cmpb512_mask ((__v64qi) __X,
  						  (__v64qi) __Y, 4,
! 						  (__mmask64) -1);
  }
  
  extern __inline __mmask64
*************** _mm512_cmplt_epi8_mask (__m512i __X, __m
*** 2365,2371 ****
  {
    return (__mmask64) __builtin_ia32_cmpb512_mask ((__v64qi) __X,
  						  (__v64qi) __Y, 1,
! 						  (__mmask64) - 1);
  }
  
  extern __inline __mmask64
--- 2363,2369 ----
  {
    return (__mmask64) __builtin_ia32_cmpb512_mask ((__v64qi) __X,
  						  (__v64qi) __Y, 1,
! 						  (__mmask64) -1);
  }
  
  extern __inline __mmask64
*************** _mm512_cmpge_epi8_mask (__m512i __X, __m
*** 2374,2380 ****
  {
    return (__mmask64) __builtin_ia32_cmpb512_mask ((__v64qi) __X,
  						  (__v64qi) __Y, 5,
! 						  (__mmask64) - 1);
  }
  
  extern __inline __mmask64
--- 2372,2378 ----
  {
    return (__mmask64) __builtin_ia32_cmpb512_mask ((__v64qi) __X,
  						  (__v64qi) __Y, 5,
! 						  (__mmask64) -1);
  }
  
  extern __inline __mmask64
*************** _mm512_cmple_epi8_mask (__m512i __X, __m
*** 2383,2389 ****
  {
    return (__mmask64) __builtin_ia32_cmpb512_mask ((__v64qi) __X,
  						  (__v64qi) __Y, 2,
! 						  (__mmask64) - 1);
  }
  
  extern __inline __mmask32
--- 2381,2387 ----
  {
    return (__mmask64) __builtin_ia32_cmpb512_mask ((__v64qi) __X,
  						  (__v64qi) __Y, 2,
! 						  (__mmask64) -1);
  }
  
  extern __inline __mmask32
*************** _mm512_cmpneq_epi16_mask (__m512i __X, _
*** 2392,2398 ****
  {
    return (__mmask32) __builtin_ia32_cmpw512_mask ((__v32hi) __X,
  						  (__v32hi) __Y, 4,
! 						  (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 2390,2396 ----
  {
    return (__mmask32) __builtin_ia32_cmpw512_mask ((__v32hi) __X,
  						  (__v32hi) __Y, 4,
! 						  (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm512_cmplt_epi16_mask (__m512i __X, __
*** 2401,2407 ****
  {
    return (__mmask32) __builtin_ia32_cmpw512_mask ((__v32hi) __X,
  						  (__v32hi) __Y, 1,
! 						  (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 2399,2405 ----
  {
    return (__mmask32) __builtin_ia32_cmpw512_mask ((__v32hi) __X,
  						  (__v32hi) __Y, 1,
! 						  (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm512_cmpge_epi16_mask (__m512i __X, __
*** 2410,2416 ****
  {
    return (__mmask32) __builtin_ia32_cmpw512_mask ((__v32hi) __X,
  						  (__v32hi) __Y, 5,
! 						  (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 2408,2414 ----
  {
    return (__mmask32) __builtin_ia32_cmpw512_mask ((__v32hi) __X,
  						  (__v32hi) __Y, 5,
! 						  (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm512_cmple_epi16_mask (__m512i __X, __
*** 2419,2425 ****
  {
    return (__mmask32) __builtin_ia32_cmpw512_mask ((__v32hi) __X,
  						  (__v32hi) __Y, 2,
! 						  (__mmask32) - 1);
  }
  
  #ifdef __OPTIMIZE__
--- 2417,2489 ----
  {
    return (__mmask32) __builtin_ia32_cmpw512_mask ((__v32hi) __X,
  						  (__v32hi) __Y, 2,
! 						  (__mmask32) -1);
! }
! 
! extern __inline __m512i
! __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_packs_epi32 (__m512i __A, __m512i __B)
! {
!   return (__m512i) __builtin_ia32_packssdw512_mask ((__v16si) __A,
! 						    (__v16si) __B,
! 						    (__v32hi)
! 						    _mm512_setzero_hi (),
! 						    (__mmask32) -1);
! }
! 
! extern __inline __m512i
! __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_maskz_packs_epi32 (__mmask32 __M, __m512i __A, __m512i __B)
! {
!   return (__m512i) __builtin_ia32_packssdw512_mask ((__v16si) __A,
! 						    (__v16si) __B,
! 						    (__v32hi)
! 						    _mm512_setzero_hi (),
! 						    __M);
! }
! 
! extern __inline __m512i
! __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_packs_epi32 (__m512i __W, __mmask32 __M, __m512i __A,
! 			 __m512i __B)
! {
!   return (__m512i) __builtin_ia32_packssdw512_mask ((__v16si) __A,
! 						    (__v16si) __B,
! 						    (__v32hi) __W,
! 						    __M);
! }
! 
! extern __inline __m512i
! __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_packus_epi32 (__m512i __A, __m512i __B)
! {
!   return (__m512i) __builtin_ia32_packusdw512_mask ((__v16si) __A,
! 						    (__v16si) __B,
! 						    (__v32hi)
! 						    _mm512_setzero_hi (),
! 						    (__mmask32) -1);
! }
! 
! extern __inline __m512i
! __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_maskz_packus_epi32 (__mmask32 __M, __m512i __A, __m512i __B)
! {
!   return (__m512i) __builtin_ia32_packusdw512_mask ((__v16si) __A,
! 						    (__v16si) __B,
! 						    (__v32hi)
! 						    _mm512_setzero_hi (),
! 						    __M);
! }
! 
! extern __inline __m512i
! __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_packus_epi32 (__m512i __W, __mmask32 __M, __m512i __A,
! 			  __m512i __B)
! {
!   return (__m512i) __builtin_ia32_packusdw512_mask ((__v16si) __A,
! 						    (__v16si) __B,
! 						    (__v32hi) __W,
! 						    __M);
  }
  
  #ifdef __OPTIMIZE__
*************** _mm512_cmp_epu8_mask (__m512i __X, __m51
*** 2746,2817 ****
  }
  
  extern __inline __m512i
- __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm512_packs_epi32 (__m512i __A, __m512i __B)
- {
-   return (__m512i) __builtin_ia32_packssdw512_mask ((__v16si) __A,
- 						    (__v16si) __B,
- 						    (__v32hi)
- 						    _mm512_setzero_hi (),
- 						    (__mmask32) -1);
- }
- 
- extern __inline __m512i
- __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm512_maskz_packs_epi32 (__mmask32 __M, __m512i __A, __m512i __B)
- {
-   return (__m512i) __builtin_ia32_packssdw512_mask ((__v16si) __A,
- 						    (__v16si) __B,
- 						    (__v32hi)
- 						    _mm512_setzero_hi(),
- 						    __M);
- }
- 
- extern __inline __m512i
- __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm512_mask_packs_epi32 (__m512i __W, __mmask32 __M, __m512i __A,
- 			 __m512i __B)
- {
-   return (__m512i) __builtin_ia32_packssdw512_mask ((__v16si) __A,
- 						    (__v16si) __B,
- 						    (__v32hi) __W,
- 						    __M);
- }
- 
- extern __inline __m512i
- __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm512_packus_epi32 (__m512i __A, __m512i __B)
- {
-   return (__m512i) __builtin_ia32_packusdw512_mask ((__v16si) __A,
- 						    (__v16si) __B,
- 						    (__v32hi)
- 						    _mm512_setzero_hi (),
- 						    (__mmask32) -1);
- }
- 
- extern __inline __m512i
- __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm512_maskz_packus_epi32 (__mmask32 __M, __m512i __A, __m512i __B)
- {
-   return (__m512i) __builtin_ia32_packusdw512_mask ((__v16si) __A,
- 						    (__v16si) __B,
- 						    (__v32hi)
- 						    _mm512_setzero_hi(),
- 						    __M);
- }
- 
- extern __inline __m512i
- __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm512_mask_packus_epi32 (__m512i __W, __mmask32 __M, __m512i __A,
- 			  __m512i __B)
- {
-   return (__m512i) __builtin_ia32_packusdw512_mask ((__v16si) __A,
- 						    (__v16si) __B,
- 						    (__v32hi) __W,
- 						    __M);
- }
- 
- extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_bslli_epi128 (__m512i __A, const int __N)
  {
--- 2810,2815 ----
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512dqintrin.h gcc-5.5.0/gcc/config/i386/avx512dqintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512dqintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512dqintrin.h	Mon Aug 22 18:57:37 2016
*************** _mm512_broadcast_f64x2 (__m128d __A)
*** 41,48 ****
    return (__m512d) __builtin_ia32_broadcastf64x2_512_mask ((__v2df)
  							   __A,
  							   _mm512_undefined_pd(),
! 							   (__mmask8) -
! 							   1);
  }
  
  extern __inline __m512d
--- 41,47 ----
    return (__m512d) __builtin_ia32_broadcastf64x2_512_mask ((__v2df)
  							   __A,
  							   _mm512_undefined_pd(),
! 							   (__mmask8) -1);
  }
  
  extern __inline __m512d
*************** _mm512_broadcast_i64x2 (__m128i __A)
*** 72,80 ****
  {
    return (__m512i) __builtin_ia32_broadcasti64x2_512_mask ((__v2di)
  							   __A,
! 							   _mm512_undefined_si512(),
! 							   (__mmask8) -
! 							   1);
  }
  
  extern __inline __m512i
--- 71,78 ----
  {
    return (__m512i) __builtin_ia32_broadcasti64x2_512_mask ((__v2di)
  							   __A,
! 							   _mm512_undefined_epi32(),
! 							   (__mmask8) -1);
  }
  
  extern __inline __m512i
*************** _mm512_broadcast_f32x2 (__m128 __A)
*** 104,111 ****
  {
    return (__m512) __builtin_ia32_broadcastf32x2_512_mask ((__v4sf) __A,
  							  (__v16sf)_mm512_undefined_ps(),
! 							  (__mmask16) -
! 							  1);
  }
  
  extern __inline __m512
--- 102,108 ----
  {
    return (__m512) __builtin_ia32_broadcastf32x2_512_mask ((__v4sf) __A,
  							  (__v16sf)_mm512_undefined_ps(),
! 							  (__mmask16) -1);
  }
  
  extern __inline __m512
*************** _mm512_broadcast_i32x2 (__m128i __A)
*** 133,141 ****
  {
    return (__m512i) __builtin_ia32_broadcasti32x2_512_mask ((__v4si)
  							   __A,
! 							   (__v16si)_mm512_undefined_si512(),
! 							   (__mmask16)
! 							   -1);
  }
  
  extern __inline __m512i
--- 130,137 ----
  {
    return (__m512i) __builtin_ia32_broadcasti32x2_512_mask ((__v4si)
  							   __A,
! 							   (__v16si)_mm512_undefined_epi32(),
! 							   (__mmask16) -1);
  }
  
  extern __inline __m512i
*************** _mm512_broadcast_f32x8 (__m256 __A)
*** 165,172 ****
  {
    return (__m512) __builtin_ia32_broadcastf32x8_512_mask ((__v8sf) __A,
  							  _mm512_undefined_ps(),
! 							  (__mmask16) -
! 							  1);
  }
  
  extern __inline __m512
--- 161,167 ----
  {
    return (__m512) __builtin_ia32_broadcastf32x8_512_mask ((__v8sf) __A,
  							  _mm512_undefined_ps(),
! 							  (__mmask16) -1);
  }
  
  extern __inline __m512
*************** _mm512_broadcast_i32x8 (__m256i __A)
*** 194,202 ****
  {
    return (__m512i) __builtin_ia32_broadcasti32x8_512_mask ((__v8si)
  							   __A,
! 							   (__v16si)_mm512_undefined_si512(),
! 							   (__mmask16)
! 							   -1);
  }
  
  extern __inline __m512i
--- 189,196 ----
  {
    return (__m512i) __builtin_ia32_broadcasti32x8_512_mask ((__v8si)
  							   __A,
! 							   (__v16si)_mm512_undefined_epi32(),
! 							   (__mmask16) -1);
  }
  
  extern __inline __m512i
*************** _mm512_extractf64x2_pd (__m512d __A, con
*** 1569,1576 ****
  							 __imm,
  							 (__v2df)
  							 _mm_setzero_pd (),
! 							 (__mmask8) -
! 							 1);
  }
  
  extern __inline __m128d
--- 1563,1569 ----
  							 __imm,
  							 (__v2df)
  							 _mm_setzero_pd (),
! 							 (__mmask8) -1);
  }
  
  extern __inline __m128d
*************** _mm512_extracti64x2_epi64 (__m512i __A,
*** 1640,1647 ****
  							 __imm,
  							 (__v2di)
  							 _mm_setzero_di (),
! 							 (__mmask8) -
! 							 1);
  }
  
  extern __inline __m128i
--- 1633,1639 ----
  							 __imm,
  							 (__v2di)
  							 _mm_setzero_di (),
! 							 (__mmask8) -1);
  }
  
  extern __inline __m128i
*************** _mm512_inserti64x2 (__m512i __A, __m128i
*** 1829,1836 ****
  							__imm,
  							(__v8di)
  							_mm512_setzero_si512 (),
! 							(__mmask8) -
! 							1);
  }
  
  extern __inline __m512i
--- 1821,1827 ----
  							__imm,
  							(__v8di)
  							_mm512_setzero_si512 (),
! 							(__mmask8) -1);
  }
  
  extern __inline __m512i
*************** _mm512_insertf64x2 (__m512d __A, __m128d
*** 1869,1876 ****
  							__imm,
  							(__v8df)
  							_mm512_setzero_pd (),
! 							(__mmask8) -
! 							1);
  }
  
  extern __inline __m512d
--- 1860,1866 ----
  							__imm,
  							(__v8df)
  							_mm512_setzero_pd (),
! 							(__mmask8) -1);
  }
  
  extern __inline __m512d
*************** _mm512_fpclass_ps_mask (__m512 __A, cons
*** 1933,1940 ****
  {
    return (__mmask16) __builtin_ia32_fpclassps512_mask ((__v16sf) __A,
  						       __imm,
! 						       (__mmask16) -
! 						       1);
  }
  
  #else
--- 1923,1929 ----
  {
    return (__mmask16) __builtin_ia32_fpclassps512_mask ((__v16sf) __A,
  						       __imm,
! 						       (__mmask16) -1);
  }
  
  #else
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512fintrin.h gcc-5.5.0/gcc/config/i386/avx512fintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512fintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512fintrin.h	Thu Jun  1 21:51:51 2017
*************** _mm512_undefined_pd (void)
*** 130,141 ****
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_undefined_si512 (void)
  {
    __m512i __Y = __Y;
    return __Y;
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_set1_epi8 (char __A)
--- 130,143 ----
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_undefined_epi32 (void)
  {
    __m512i __Y = __Y;
    return __Y;
  }
  
+ #define _mm512_undefined_si512 _mm512_undefined_epi32
+ 
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_set1_epi8 (char __A)
*************** _mm512_sllv_epi32 (__m512i __X, __m512i
*** 549,555 ****
    return (__m512i) __builtin_ia32_psllv16si_mask ((__v16si) __X,
  						  (__v16si) __Y,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 551,557 ----
    return (__m512i) __builtin_ia32_psllv16si_mask ((__v16si) __X,
  						  (__v16si) __Y,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_srav_epi32 (__m512i __X, __m512i
*** 581,587 ****
    return (__m512i) __builtin_ia32_psrav16si_mask ((__v16si) __X,
  						  (__v16si) __Y,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 583,589 ----
    return (__m512i) __builtin_ia32_psrav16si_mask ((__v16si) __X,
  						  (__v16si) __Y,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_srlv_epi32 (__m512i __X, __m512i
*** 613,619 ****
    return (__m512i) __builtin_ia32_psrlv16si_mask ((__v16si) __X,
  						  (__v16si) __Y,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 615,621 ----
    return (__m512i) __builtin_ia32_psrlv16si_mask ((__v16si) __X,
  						  (__v16si) __Y,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_srav_epi64 (__m512i __X, __m512i
*** 733,739 ****
    return (__m512i) __builtin_ia32_psrav8di_mask ((__v8di) __X,
  						 (__v8di) __Y,
  						 (__v8di)
! 						 _mm512_undefined_si512 (),
  						 (__mmask8) -1);
  }
  
--- 735,741 ----
    return (__m512i) __builtin_ia32_psrav8di_mask ((__v8di) __X,
  						 (__v8di) __Y,
  						 (__v8di)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask8) -1);
  }
  
*************** _mm512_srlv_epi64 (__m512i __X, __m512i
*** 765,771 ****
    return (__m512i) __builtin_ia32_psrlv8di_mask ((__v8di) __X,
  						 (__v8di) __Y,
  						 (__v8di)
! 						 _mm512_undefined_si512 (),
  						 (__mmask8) -1);
  }
  
--- 767,773 ----
    return (__m512i) __builtin_ia32_psrlv8di_mask ((__v8di) __X,
  						 (__v8di) __Y,
  						 (__v8di)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask8) -1);
  }
  
*************** _mm512_mul_epi32 (__m512i __X, __m512i _
*** 825,831 ****
    return (__m512i) __builtin_ia32_pmuldq512_mask ((__v16si) __X,
  						  (__v16si) __Y,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 827,833 ----
    return (__m512i) __builtin_ia32_pmuldq512_mask ((__v16si) __X,
  						  (__v16si) __Y,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_mul_epu32 (__m512i __X, __m512i _
*** 884,890 ****
    return (__m512i) __builtin_ia32_pmuludq512_mask ((__v16si) __X,
  						   (__v16si) __Y,
  						   (__v8di)
! 						   _mm512_undefined_si512 (),
  						   (__mmask8) -1);
  }
  
--- 886,892 ----
    return (__m512i) __builtin_ia32_pmuludq512_mask ((__v16si) __X,
  						   (__v16si) __Y,
  						   (__v8di)
! 						   _mm512_undefined_epi32 (),
  						   (__mmask8) -1);
  }
  
*************** _mm512_slli_epi64 (__m512i __A, unsigned
*** 915,921 ****
  {
    return (__m512i) __builtin_ia32_psllqi512_mask ((__v8di) __A, __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 917,923 ----
  {
    return (__m512i) __builtin_ia32_psllqi512_mask ((__v8di) __A, __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_maskz_slli_epi64 (__mmask8 __U, _
*** 941,947 ****
  #else
  #define _mm512_slli_epi64(X, C)						   \
    ((__m512i) __builtin_ia32_psllqi512_mask ((__v8di)(__m512i)(X), (int)(C),\
!     (__v8di)(__m512i)_mm512_undefined_si512 (),\
      (__mmask8)-1))
  
  #define _mm512_mask_slli_epi64(W, U, X, C)				   \
--- 943,949 ----
  #else
  #define _mm512_slli_epi64(X, C)						   \
    ((__m512i) __builtin_ia32_psllqi512_mask ((__v8di)(__m512i)(X), (int)(C),\
!     (__v8di)(__m512i)_mm512_undefined_epi32 (),\
      (__mmask8)-1))
  
  #define _mm512_mask_slli_epi64(W, U, X, C)				   \
*************** _mm512_sll_epi64 (__m512i __A, __m128i _
*** 962,968 ****
    return (__m512i) __builtin_ia32_psllq512_mask ((__v8di) __A,
  						 (__v2di) __B,
  						 (__v8di)
! 						 _mm512_undefined_si512 (),
  						 (__mmask8) -1);
  }
  
--- 964,970 ----
    return (__m512i) __builtin_ia32_psllq512_mask ((__v8di) __A,
  						 (__v2di) __B,
  						 (__v8di)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask8) -1);
  }
  
*************** _mm512_srli_epi64 (__m512i __A, unsigned
*** 994,1000 ****
  {
    return (__m512i) __builtin_ia32_psrlqi512_mask ((__v8di) __A, __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 996,1002 ----
  {
    return (__m512i) __builtin_ia32_psrlqi512_mask ((__v8di) __A, __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_maskz_srli_epi64 (__mmask8 __U, _
*** 1020,1026 ****
  #else
  #define _mm512_srli_epi64(X, C)						   \
    ((__m512i) __builtin_ia32_psrlqi512_mask ((__v8di)(__m512i)(X), (int)(C),\
!     (__v8di)(__m512i)_mm512_undefined_si512 (),\
      (__mmask8)-1))
  
  #define _mm512_mask_srli_epi64(W, U, X, C)				   \
--- 1022,1028 ----
  #else
  #define _mm512_srli_epi64(X, C)						   \
    ((__m512i) __builtin_ia32_psrlqi512_mask ((__v8di)(__m512i)(X), (int)(C),\
!     (__v8di)(__m512i)_mm512_undefined_epi32 (),\
      (__mmask8)-1))
  
  #define _mm512_mask_srli_epi64(W, U, X, C)				   \
*************** _mm512_srl_epi64 (__m512i __A, __m128i _
*** 1041,1047 ****
    return (__m512i) __builtin_ia32_psrlq512_mask ((__v8di) __A,
  						 (__v2di) __B,
  						 (__v8di)
! 						 _mm512_undefined_si512 (),
  						 (__mmask8) -1);
  }
  
--- 1043,1049 ----
    return (__m512i) __builtin_ia32_psrlq512_mask ((__v8di) __A,
  						 (__v2di) __B,
  						 (__v8di)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask8) -1);
  }
  
*************** _mm512_srai_epi64 (__m512i __A, unsigned
*** 1073,1079 ****
  {
    return (__m512i) __builtin_ia32_psraqi512_mask ((__v8di) __A, __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 1075,1081 ----
  {
    return (__m512i) __builtin_ia32_psraqi512_mask ((__v8di) __A, __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_maskz_srai_epi64 (__mmask8 __U, _
*** 1099,1105 ****
  #else
  #define _mm512_srai_epi64(X, C)						   \
    ((__m512i) __builtin_ia32_psraqi512_mask ((__v8di)(__m512i)(X), (int)(C),\
!     (__v8di)(__m512i)_mm512_undefined_si512 (),\
      (__mmask8)-1))
  
  #define _mm512_mask_srai_epi64(W, U, X, C)				   \
--- 1101,1107 ----
  #else
  #define _mm512_srai_epi64(X, C)						   \
    ((__m512i) __builtin_ia32_psraqi512_mask ((__v8di)(__m512i)(X), (int)(C),\
!     (__v8di)(__m512i)_mm512_undefined_epi32 (),\
      (__mmask8)-1))
  
  #define _mm512_mask_srai_epi64(W, U, X, C)				   \
*************** _mm512_sra_epi64 (__m512i __A, __m128i _
*** 1120,1126 ****
    return (__m512i) __builtin_ia32_psraq512_mask ((__v8di) __A,
  						 (__v2di) __B,
  						 (__v8di)
! 						 _mm512_undefined_si512 (),
  						 (__mmask8) -1);
  }
  
--- 1122,1128 ----
    return (__m512i) __builtin_ia32_psraq512_mask ((__v8di) __A,
  						 (__v2di) __B,
  						 (__v8di)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask8) -1);
  }
  
*************** _mm512_slli_epi32 (__m512i __A, unsigned
*** 1152,1158 ****
  {
    return (__m512i) __builtin_ia32_pslldi512_mask ((__v16si) __A, __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 1154,1160 ----
  {
    return (__m512i) __builtin_ia32_pslldi512_mask ((__v16si) __A, __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_maskz_slli_epi32 (__mmask16 __U,
*** 1178,1184 ****
  #else
  #define _mm512_slli_epi32(X, C)						    \
    ((__m512i) __builtin_ia32_pslldi512_mask ((__v16si)(__m512i)(X), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_si512 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_slli_epi32(W, U, X, C)                                  \
--- 1180,1186 ----
  #else
  #define _mm512_slli_epi32(X, C)						    \
    ((__m512i) __builtin_ia32_pslldi512_mask ((__v16si)(__m512i)(X), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_epi32 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_slli_epi32(W, U, X, C)                                  \
*************** _mm512_sll_epi32 (__m512i __A, __m128i _
*** 1199,1205 ****
    return (__m512i) __builtin_ia32_pslld512_mask ((__v16si) __A,
  						 (__v4si) __B,
  						 (__v16si)
! 						 _mm512_undefined_si512 (),
  						 (__mmask16) -1);
  }
  
--- 1201,1207 ----
    return (__m512i) __builtin_ia32_pslld512_mask ((__v16si) __A,
  						 (__v4si) __B,
  						 (__v16si)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask16) -1);
  }
  
*************** _mm512_srli_epi32 (__m512i __A, unsigned
*** 1231,1237 ****
  {
    return (__m512i) __builtin_ia32_psrldi512_mask ((__v16si) __A, __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 1233,1239 ----
  {
    return (__m512i) __builtin_ia32_psrldi512_mask ((__v16si) __A, __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_maskz_srli_epi32 (__mmask16 __U,
*** 1257,1263 ****
  #else
  #define _mm512_srli_epi32(X, C)						    \
    ((__m512i) __builtin_ia32_psrldi512_mask ((__v16si)(__m512i)(X), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_si512 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_srli_epi32(W, U, X, C)                                  \
--- 1259,1265 ----
  #else
  #define _mm512_srli_epi32(X, C)						    \
    ((__m512i) __builtin_ia32_psrldi512_mask ((__v16si)(__m512i)(X), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_epi32 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_srli_epi32(W, U, X, C)                                  \
*************** _mm512_srl_epi32 (__m512i __A, __m128i _
*** 1278,1284 ****
    return (__m512i) __builtin_ia32_psrld512_mask ((__v16si) __A,
  						 (__v4si) __B,
  						 (__v16si)
! 						 _mm512_undefined_si512 (),
  						 (__mmask16) -1);
  }
  
--- 1280,1286 ----
    return (__m512i) __builtin_ia32_psrld512_mask ((__v16si) __A,
  						 (__v4si) __B,
  						 (__v16si)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask16) -1);
  }
  
*************** _mm512_srai_epi32 (__m512i __A, unsigned
*** 1310,1316 ****
  {
    return (__m512i) __builtin_ia32_psradi512_mask ((__v16si) __A, __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 1312,1318 ----
  {
    return (__m512i) __builtin_ia32_psradi512_mask ((__v16si) __A, __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_maskz_srai_epi32 (__mmask16 __U,
*** 1336,1342 ****
  #else
  #define _mm512_srai_epi32(X, C)						    \
    ((__m512i) __builtin_ia32_psradi512_mask ((__v16si)(__m512i)(X), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_si512 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_srai_epi32(W, U, X, C)				    \
--- 1338,1344 ----
  #else
  #define _mm512_srai_epi32(X, C)						    \
    ((__m512i) __builtin_ia32_psradi512_mask ((__v16si)(__m512i)(X), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_epi32 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_srai_epi32(W, U, X, C)				    \
*************** _mm512_sra_epi32 (__m512i __A, __m128i _
*** 1357,1363 ****
    return (__m512i) __builtin_ia32_psrad512_mask ((__v16si) __A,
  						 (__v4si) __B,
  						 (__v16si)
! 						 _mm512_undefined_si512 (),
  						 (__mmask16) -1);
  }
  
--- 1359,1365 ----
    return (__m512i) __builtin_ia32_psrad512_mask ((__v16si) __A,
  						 (__v4si) __B,
  						 (__v16si)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask16) -1);
  }
  
*************** _mm_sub_round_ss (__m128 __A, __m128 __B
*** 1436,1501 ****
  #ifdef __OPTIMIZE__
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_ternarylogic_epi64 (__m512i __A, __m512i __B, __m512i __C, const int imm)
  {
    return (__m512i) __builtin_ia32_pternlogq512_mask ((__v8di) __A,
  						     (__v8di) __B,
! 						     (__v8di) __C, imm,
  						     (__mmask8) -1);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_ternarylogic_epi64 (__m512i __A, __mmask8 __U, __m512i __B,
! 				__m512i __C, const int imm)
  {
    return (__m512i) __builtin_ia32_pternlogq512_mask ((__v8di) __A,
  						     (__v8di) __B,
! 						     (__v8di) __C, imm,
  						     (__mmask8) __U);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_maskz_ternarylogic_epi64 (__mmask8 __U, __m512i __A, __m512i __B,
! 				 __m512i __C, const int imm)
  {
    return (__m512i) __builtin_ia32_pternlogq512_maskz ((__v8di) __A,
  						      (__v8di) __B,
  						      (__v8di) __C,
! 						      imm, (__mmask8) __U);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_ternarylogic_epi32 (__m512i __A, __m512i __B, __m512i __C, const int imm)
  {
    return (__m512i) __builtin_ia32_pternlogd512_mask ((__v16si) __A,
  						     (__v16si) __B,
  						     (__v16si) __C,
! 						     imm, (__mmask16) -1);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_ternarylogic_epi32 (__m512i __A, __mmask16 __U, __m512i __B,
! 				__m512i __C, const int imm)
  {
    return (__m512i) __builtin_ia32_pternlogd512_mask ((__v16si) __A,
  						     (__v16si) __B,
  						     (__v16si) __C,
! 						     imm, (__mmask16) __U);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_maskz_ternarylogic_epi32 (__mmask16 __U, __m512i __A, __m512i __B,
! 				 __m512i __C, const int imm)
  {
    return (__m512i) __builtin_ia32_pternlogd512_maskz ((__v16si) __A,
  						      (__v16si) __B,
  						      (__v16si) __C,
! 						      imm, (__mmask16) __U);
  }
  #else
  #define _mm512_ternarylogic_epi64(A, B, C, I)				\
--- 1438,1505 ----
  #ifdef __OPTIMIZE__
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_ternarylogic_epi64 (__m512i __A, __m512i __B, __m512i __C,
! 			   const int __imm)
  {
    return (__m512i) __builtin_ia32_pternlogq512_mask ((__v8di) __A,
  						     (__v8di) __B,
! 						     (__v8di) __C, __imm,
  						     (__mmask8) -1);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_ternarylogic_epi64 (__m512i __A, __mmask8 __U, __m512i __B,
! 				__m512i __C, const int __imm)
  {
    return (__m512i) __builtin_ia32_pternlogq512_mask ((__v8di) __A,
  						     (__v8di) __B,
! 						     (__v8di) __C, __imm,
  						     (__mmask8) __U);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_maskz_ternarylogic_epi64 (__mmask8 __U, __m512i __A, __m512i __B,
! 				 __m512i __C, const int __imm)
  {
    return (__m512i) __builtin_ia32_pternlogq512_maskz ((__v8di) __A,
  						      (__v8di) __B,
  						      (__v8di) __C,
! 						      __imm, (__mmask8) __U);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_ternarylogic_epi32 (__m512i __A, __m512i __B, __m512i __C,
! 			   const int __imm)
  {
    return (__m512i) __builtin_ia32_pternlogd512_mask ((__v16si) __A,
  						     (__v16si) __B,
  						     (__v16si) __C,
! 						     __imm, (__mmask16) -1);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_ternarylogic_epi32 (__m512i __A, __mmask16 __U, __m512i __B,
! 				__m512i __C, const int __imm)
  {
    return (__m512i) __builtin_ia32_pternlogd512_mask ((__v16si) __A,
  						     (__v16si) __B,
  						     (__v16si) __C,
! 						     __imm, (__mmask16) __U);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_maskz_ternarylogic_epi32 (__mmask16 __U, __m512i __A, __m512i __B,
! 				 __m512i __C, const int __imm)
  {
    return (__m512i) __builtin_ia32_pternlogd512_maskz ((__v16si) __A,
  						      (__v16si) __B,
  						      (__v16si) __C,
! 						      __imm, (__mmask16) __U);
  }
  #else
  #define _mm512_ternarylogic_epi64(A, B, C, I)				\
*************** _mm512_cvtepi8_epi32 (__m128i __A)
*** 1778,1784 ****
  {
    return (__m512i) __builtin_ia32_pmovsxbd512_mask ((__v16qi) __A,
  						    (__v16si)
! 						    _mm512_undefined_si512 (),
  						    (__mmask16) -1);
  }
  
--- 1782,1788 ----
  {
    return (__m512i) __builtin_ia32_pmovsxbd512_mask ((__v16qi) __A,
  						    (__v16si)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask16) -1);
  }
  
*************** _mm512_cvtepi8_epi64 (__m128i __A)
*** 1807,1813 ****
  {
    return (__m512i) __builtin_ia32_pmovsxbq512_mask ((__v16qi) __A,
  						    (__v8di)
! 						    _mm512_undefined_si512 (),
  						    (__mmask8) -1);
  }
  
--- 1811,1817 ----
  {
    return (__m512i) __builtin_ia32_pmovsxbq512_mask ((__v16qi) __A,
  						    (__v8di)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask8) -1);
  }
  
*************** _mm512_cvtepi16_epi32 (__m256i __A)
*** 1836,1842 ****
  {
    return (__m512i) __builtin_ia32_pmovsxwd512_mask ((__v16hi) __A,
  						    (__v16si)
! 						    _mm512_undefined_si512 (),
  						    (__mmask16) -1);
  }
  
--- 1840,1846 ----
  {
    return (__m512i) __builtin_ia32_pmovsxwd512_mask ((__v16hi) __A,
  						    (__v16si)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask16) -1);
  }
  
*************** _mm512_cvtepi16_epi64 (__m128i __A)
*** 1865,1871 ****
  {
    return (__m512i) __builtin_ia32_pmovsxwq512_mask ((__v8hi) __A,
  						    (__v8di)
! 						    _mm512_undefined_si512 (),
  						    (__mmask8) -1);
  }
  
--- 1869,1875 ----
  {
    return (__m512i) __builtin_ia32_pmovsxwq512_mask ((__v8hi) __A,
  						    (__v8di)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask8) -1);
  }
  
*************** _mm512_cvtepi32_epi64 (__m256i __X)
*** 1894,1900 ****
  {
    return (__m512i) __builtin_ia32_pmovsxdq512_mask ((__v8si) __X,
  						    (__v8di)
! 						    _mm512_undefined_si512 (),
  						    (__mmask8) -1);
  }
  
--- 1898,1904 ----
  {
    return (__m512i) __builtin_ia32_pmovsxdq512_mask ((__v8si) __X,
  						    (__v8di)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask8) -1);
  }
  
*************** _mm512_cvtepu8_epi32 (__m128i __A)
*** 1923,1929 ****
  {
    return (__m512i) __builtin_ia32_pmovzxbd512_mask ((__v16qi) __A,
  						    (__v16si)
! 						    _mm512_undefined_si512 (),
  						    (__mmask16) -1);
  }
  
--- 1927,1933 ----
  {
    return (__m512i) __builtin_ia32_pmovzxbd512_mask ((__v16qi) __A,
  						    (__v16si)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask16) -1);
  }
  
*************** _mm512_cvtepu8_epi64 (__m128i __A)
*** 1952,1958 ****
  {
    return (__m512i) __builtin_ia32_pmovzxbq512_mask ((__v16qi) __A,
  						    (__v8di)
! 						    _mm512_undefined_si512 (),
  						    (__mmask8) -1);
  }
  
--- 1956,1962 ----
  {
    return (__m512i) __builtin_ia32_pmovzxbq512_mask ((__v16qi) __A,
  						    (__v8di)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask8) -1);
  }
  
*************** _mm512_cvtepu16_epi32 (__m256i __A)
*** 1981,1987 ****
  {
    return (__m512i) __builtin_ia32_pmovzxwd512_mask ((__v16hi) __A,
  						    (__v16si)
! 						    _mm512_undefined_si512 (),
  						    (__mmask16) -1);
  }
  
--- 1985,1991 ----
  {
    return (__m512i) __builtin_ia32_pmovzxwd512_mask ((__v16hi) __A,
  						    (__v16si)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask16) -1);
  }
  
*************** _mm512_cvtepu16_epi64 (__m128i __A)
*** 2010,2016 ****
  {
    return (__m512i) __builtin_ia32_pmovzxwq512_mask ((__v8hi) __A,
  						    (__v8di)
! 						    _mm512_undefined_si512 (),
  						    (__mmask8) -1);
  }
  
--- 2014,2020 ----
  {
    return (__m512i) __builtin_ia32_pmovzxwq512_mask ((__v8hi) __A,
  						    (__v8di)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask8) -1);
  }
  
*************** _mm512_cvtepu32_epi64 (__m256i __X)
*** 2039,2045 ****
  {
    return (__m512i) __builtin_ia32_pmovzxdq512_mask ((__v8si) __X,
  						    (__v8di)
! 						    _mm512_undefined_si512 (),
  						    (__mmask8) -1);
  }
  
--- 2043,2049 ----
  {
    return (__m512i) __builtin_ia32_pmovzxdq512_mask ((__v8si) __X,
  						    (__v8di)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask8) -1);
  }
  
*************** _mm512_abs_epi64 (__m512i __A)
*** 3407,3413 ****
  {
    return (__m512i) __builtin_ia32_pabsq512_mask ((__v8di) __A,
  						 (__v8di)
! 						 _mm512_undefined_si512 (),
  						 (__mmask8) -1);
  }
  
--- 3411,3417 ----
  {
    return (__m512i) __builtin_ia32_pabsq512_mask ((__v8di) __A,
  						 (__v8di)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask8) -1);
  }
  
*************** _mm512_abs_epi32 (__m512i __A)
*** 3436,3442 ****
  {
    return (__m512i) __builtin_ia32_pabsd512_mask ((__v16si) __A,
  						 (__v16si)
! 						 _mm512_undefined_si512 (),
  						 (__mmask16) -1);
  }
  
--- 3440,3446 ----
  {
    return (__m512i) __builtin_ia32_pabsd512_mask ((__v16si) __A,
  						 (__v16si)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask16) -1);
  }
  
*************** _mm512_broadcastd_epi32 (__m128i __A)
*** 3521,3527 ****
  {
    return (__m512i) __builtin_ia32_pbroadcastd512 ((__v4si) __A,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 3525,3531 ----
  {
    return (__m512i) __builtin_ia32_pbroadcastd512 ((__v4si) __A,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_set1_epi32 (int __A)
*** 3549,3555 ****
  {
    return (__m512i) __builtin_ia32_pbroadcastd512_gpr_mask (__A,
  							   (__v16si)
! 							   _mm512_undefined_si512 (),
  							   (__mmask16)(-1));
  }
  
--- 3553,3559 ----
  {
    return (__m512i) __builtin_ia32_pbroadcastd512_gpr_mask (__A,
  							   (__v16si)
! 							   _mm512_undefined_epi32 (),
  							   (__mmask16)(-1));
  }
  
*************** _mm512_broadcastq_epi64 (__m128i __A)
*** 3577,3583 ****
  {
    return (__m512i) __builtin_ia32_pbroadcastq512 ((__v2di) __A,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 3581,3587 ----
  {
    return (__m512i) __builtin_ia32_pbroadcastq512 ((__v2di) __A,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_set1_epi64 (long long __A)
*** 3605,3611 ****
  {
    return (__m512i) __builtin_ia32_pbroadcastq512_gpr_mask (__A,
  							   (__v8di)
! 							   _mm512_undefined_si512 (),
  							   (__mmask8)(-1));
  }
  
--- 3609,3615 ----
  {
    return (__m512i) __builtin_ia32_pbroadcastq512_gpr_mask (__A,
  							   (__v8di)
! 							   _mm512_undefined_epi32 (),
  							   (__mmask8)(-1));
  }
  
*************** _mm512_broadcast_i32x4 (__m128i __A)
*** 3662,3668 ****
  {
    return (__m512i) __builtin_ia32_broadcasti32x4_512 ((__v4si) __A,
  						      (__v16si)
! 						      _mm512_undefined_si512 (),
  						      (__mmask16) -1);
  }
  
--- 3666,3672 ----
  {
    return (__m512i) __builtin_ia32_broadcasti32x4_512 ((__v4si) __A,
  						      (__v16si)
! 						      _mm512_undefined_epi32 (),
  						      (__mmask16) -1);
  }
  
*************** _mm512_broadcast_i64x4 (__m256i __A)
*** 3720,3726 ****
  {
    return (__m512i) __builtin_ia32_broadcasti64x4_512 ((__v4di) __A,
  						      (__v8di)
! 						      _mm512_undefined_si512 (),
  						      (__mmask8) -1);
  }
  
--- 3724,3730 ----
  {
    return (__m512i) __builtin_ia32_broadcasti64x4_512 ((__v4di) __A,
  						      (__v8di)
! 						      _mm512_undefined_epi32 (),
  						      (__mmask8) -1);
  }
  
*************** _mm512_shuffle_epi32 (__m512i __A, _MM_P
*** 3841,3847 ****
    return (__m512i) __builtin_ia32_pshufd512_mask ((__v16si) __A,
  						  __mask,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 3845,3851 ----
    return (__m512i) __builtin_ia32_pshufd512_mask ((__v16si) __A,
  						  __mask,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_shuffle_i64x2 (__m512i __A, __m51
*** 3874,3880 ****
    return (__m512i) __builtin_ia32_shuf_i64x2_mask ((__v8di) __A,
  						   (__v8di) __B, __imm,
  						   (__v8di)
! 						   _mm512_undefined_si512 (),
  						   (__mmask8) -1);
  }
  
--- 3878,3884 ----
    return (__m512i) __builtin_ia32_shuf_i64x2_mask ((__v8di) __A,
  						   (__v8di) __B, __imm,
  						   (__v8di)
! 						   _mm512_undefined_epi32 (),
  						   (__mmask8) -1);
  }
  
*************** _mm512_shuffle_i32x4 (__m512i __A, __m51
*** 3909,3915 ****
  						   (__v16si) __B,
  						   __imm,
  						   (__v16si)
! 						   _mm512_undefined_si512 (),
  						   (__mmask16) -1);
  }
  
--- 3913,3919 ----
  						   (__v16si) __B,
  						   __imm,
  						   (__v16si)
! 						   _mm512_undefined_epi32 (),
  						   (__mmask16) -1);
  }
  
*************** _mm512_maskz_shuffle_f32x4 (__mmask16 __
*** 4009,4015 ****
  #else
  #define _mm512_shuffle_epi32(X, C)                                      \
    ((__m512i)  __builtin_ia32_pshufd512_mask ((__v16si)(__m512i)(X), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_si512 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_shuffle_epi32(W, U, X, C)                           \
--- 4013,4019 ----
  #else
  #define _mm512_shuffle_epi32(X, C)                                      \
    ((__m512i)  __builtin_ia32_pshufd512_mask ((__v16si)(__m512i)(X), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_epi32 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_shuffle_epi32(W, U, X, C)                           \
*************** _mm512_maskz_shuffle_f32x4 (__mmask16 __
*** 4025,4031 ****
  #define _mm512_shuffle_i64x2(X, Y, C)                                   \
    ((__m512i)  __builtin_ia32_shuf_i64x2_mask ((__v8di)(__m512i)(X),     \
        (__v8di)(__m512i)(Y), (int)(C),\
!     (__v8di)(__m512i)_mm512_undefined_si512 (),\
      (__mmask8)-1))
  
  #define _mm512_mask_shuffle_i64x2(W, U, X, Y, C)                        \
--- 4029,4035 ----
  #define _mm512_shuffle_i64x2(X, Y, C)                                   \
    ((__m512i)  __builtin_ia32_shuf_i64x2_mask ((__v8di)(__m512i)(X),     \
        (__v8di)(__m512i)(Y), (int)(C),\
!     (__v8di)(__m512i)_mm512_undefined_epi32 (),\
      (__mmask8)-1))
  
  #define _mm512_mask_shuffle_i64x2(W, U, X, Y, C)                        \
*************** _mm512_maskz_shuffle_f32x4 (__mmask16 __
*** 4043,4049 ****
  #define _mm512_shuffle_i32x4(X, Y, C)                                   \
    ((__m512i)  __builtin_ia32_shuf_i32x4_mask ((__v16si)(__m512i)(X),    \
        (__v16si)(__m512i)(Y), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_si512 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_shuffle_i32x4(W, U, X, Y, C)                        \
--- 4047,4053 ----
  #define _mm512_shuffle_i32x4(X, Y, C)                                   \
    ((__m512i)  __builtin_ia32_shuf_i32x4_mask ((__v16si)(__m512i)(X),    \
        (__v16si)(__m512i)(Y), (int)(C),\
!     (__v16si)(__m512i)_mm512_undefined_epi32 (),\
      (__mmask16)-1))
  
  #define _mm512_mask_shuffle_i32x4(W, U, X, Y, C)                        \
*************** _mm512_rolv_epi32 (__m512i __A, __m512i
*** 4102,4108 ****
    return (__m512i) __builtin_ia32_prolvd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 4106,4112 ----
    return (__m512i) __builtin_ia32_prolvd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_rorv_epi32 (__m512i __A, __m512i
*** 4134,4140 ****
    return (__m512i) __builtin_ia32_prorvd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 4138,4144 ----
    return (__m512i) __builtin_ia32_prorvd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_rolv_epi64 (__m512i __A, __m512i
*** 4166,4172 ****
    return (__m512i) __builtin_ia32_prolvq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 4170,4176 ----
    return (__m512i) __builtin_ia32_prolvq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_rorv_epi64 (__m512i __A, __m512i
*** 4198,4204 ****
    return (__m512i) __builtin_ia32_prorvq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 4202,4208 ----
    return (__m512i) __builtin_ia32_prorvq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_cvtt_roundps_epi32 (__m512 __A, c
*** 4390,4396 ****
  {
    return (__m512i) __builtin_ia32_cvttps2dq512_mask ((__v16sf) __A,
  						     (__v16si)
! 						     _mm512_undefined_si512 (),
  						     (__mmask16) -1, __R);
  }
  
--- 4394,4400 ----
  {
    return (__m512i) __builtin_ia32_cvttps2dq512_mask ((__v16sf) __A,
  						     (__v16si)
! 						     _mm512_undefined_epi32 (),
  						     (__mmask16) -1, __R);
  }
  
*************** _mm512_cvtt_roundps_epu32 (__m512 __A, c
*** 4420,4426 ****
  {
    return (__m512i) __builtin_ia32_cvttps2udq512_mask ((__v16sf) __A,
  						      (__v16si)
! 						      _mm512_undefined_si512 (),
  						      (__mmask16) -1, __R);
  }
  
--- 4424,4430 ----
  {
    return (__m512i) __builtin_ia32_cvttps2udq512_mask ((__v16sf) __A,
  						      (__v16si)
! 						      _mm512_undefined_epi32 (),
  						      (__mmask16) -1, __R);
  }
  
*************** _mm512_maskz_cvtt_roundps_epu32 (__mmask
*** 4445,4451 ****
  }
  #else
  #define _mm512_cvtt_roundps_epi32(A, B)		     \
!     ((__m512i)__builtin_ia32_cvttps2dq512_mask(A, (__v16si)_mm512_undefined_si512 (), -1, B))
  
  #define _mm512_mask_cvtt_roundps_epi32(W, U, A, B)   \
      ((__m512i)__builtin_ia32_cvttps2dq512_mask(A, (__v16si)(W), U, B))
--- 4449,4455 ----
  }
  #else
  #define _mm512_cvtt_roundps_epi32(A, B)		     \
!     ((__m512i)__builtin_ia32_cvttps2dq512_mask(A, (__v16si)_mm512_undefined_epi32 (), -1, B))
  
  #define _mm512_mask_cvtt_roundps_epi32(W, U, A, B)   \
      ((__m512i)__builtin_ia32_cvttps2dq512_mask(A, (__v16si)(W), U, B))
*************** _mm512_maskz_cvtt_roundps_epu32 (__mmask
*** 4454,4460 ****
      ((__m512i)__builtin_ia32_cvttps2dq512_mask(A, (__v16si)_mm512_setzero_si512 (), U, B))
  
  #define _mm512_cvtt_roundps_epu32(A, B)		     \
!     ((__m512i)__builtin_ia32_cvttps2udq512_mask(A, (__v16si)_mm512_undefined_si512 (), -1, B))
  
  #define _mm512_mask_cvtt_roundps_epu32(W, U, A, B)   \
      ((__m512i)__builtin_ia32_cvttps2udq512_mask(A, (__v16si)(W), U, B))
--- 4458,4464 ----
      ((__m512i)__builtin_ia32_cvttps2dq512_mask(A, (__v16si)_mm512_setzero_si512 (), U, B))
  
  #define _mm512_cvtt_roundps_epu32(A, B)		     \
!     ((__m512i)__builtin_ia32_cvttps2udq512_mask(A, (__v16si)_mm512_undefined_epi32 (), -1, B))
  
  #define _mm512_mask_cvtt_roundps_epu32(W, U, A, B)   \
      ((__m512i)__builtin_ia32_cvttps2udq512_mask(A, (__v16si)(W), U, B))
*************** _mm512_cvt_roundps_epi32 (__m512 __A, co
*** 4470,4476 ****
  {
    return (__m512i) __builtin_ia32_cvtps2dq512_mask ((__v16sf) __A,
  						    (__v16si)
! 						    _mm512_undefined_si512 (),
  						    (__mmask16) -1, __R);
  }
  
--- 4474,4480 ----
  {
    return (__m512i) __builtin_ia32_cvtps2dq512_mask ((__v16sf) __A,
  						    (__v16si)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask16) -1, __R);
  }
  
*************** _mm512_cvt_roundps_epu32 (__m512 __A, co
*** 4500,4506 ****
  {
    return (__m512i) __builtin_ia32_cvtps2udq512_mask ((__v16sf) __A,
  						     (__v16si)
! 						     _mm512_undefined_si512 (),
  						     (__mmask16) -1, __R);
  }
  
--- 4504,4510 ----
  {
    return (__m512i) __builtin_ia32_cvtps2udq512_mask ((__v16sf) __A,
  						     (__v16si)
! 						     _mm512_undefined_epi32 (),
  						     (__mmask16) -1, __R);
  }
  
*************** _mm512_maskz_cvt_roundps_epu32 (__mmask1
*** 4525,4531 ****
  }
  #else
  #define _mm512_cvt_roundps_epi32(A, B)		    \
!     ((__m512i)__builtin_ia32_cvtps2dq512_mask(A, (__v16si)_mm512_undefined_si512 (), -1, B))
  
  #define _mm512_mask_cvt_roundps_epi32(W, U, A, B)   \
      ((__m512i)__builtin_ia32_cvtps2dq512_mask(A, (__v16si)(W), U, B))
--- 4529,4535 ----
  }
  #else
  #define _mm512_cvt_roundps_epi32(A, B)		    \
!     ((__m512i)__builtin_ia32_cvtps2dq512_mask(A, (__v16si)_mm512_undefined_epi32 (), -1, B))
  
  #define _mm512_mask_cvt_roundps_epi32(W, U, A, B)   \
      ((__m512i)__builtin_ia32_cvtps2dq512_mask(A, (__v16si)(W), U, B))
*************** _mm512_maskz_cvt_roundps_epu32 (__mmask1
*** 4534,4540 ****
      ((__m512i)__builtin_ia32_cvtps2dq512_mask(A, (__v16si)_mm512_setzero_si512 (), U, B))
  
  #define _mm512_cvt_roundps_epu32(A, B)		    \
!     ((__m512i)__builtin_ia32_cvtps2udq512_mask(A, (__v16si)_mm512_undefined_si512 (), -1, B))
  
  #define _mm512_mask_cvt_roundps_epu32(W, U, A, B)   \
      ((__m512i)__builtin_ia32_cvtps2udq512_mask(A, (__v16si)(W), U, B))
--- 4538,4544 ----
      ((__m512i)__builtin_ia32_cvtps2dq512_mask(A, (__v16si)_mm512_setzero_si512 (), U, B))
  
  #define _mm512_cvt_roundps_epu32(A, B)		    \
!     ((__m512i)__builtin_ia32_cvtps2udq512_mask(A, (__v16si)_mm512_undefined_epi32 (), -1, B))
  
  #define _mm512_mask_cvt_roundps_epu32(W, U, A, B)   \
      ((__m512i)__builtin_ia32_cvtps2udq512_mask(A, (__v16si)(W), U, B))
*************** extern __inline __m256i
*** 4903,4909 ****
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_cvtsepi64_epi32 (__m512i __A)
  {
-   __v8si __O;
    return (__m256i) __builtin_ia32_pmovsqd512_mask ((__v8di) __A,
  						   (__v8si)
  						   _mm256_undefined_si256 (),
--- 4907,4912 ----
*************** _mm512_inserti64x4 (__m512i __A, __m256i
*** 5556,5562 ****
  						    (__v4di) __B,
  						    __imm,
  						    (__v8di)
! 						    _mm512_undefined_si512 (),
  						    (__mmask8) -1);
  }
  
--- 5559,5565 ----
  						    (__v4di) __B,
  						    __imm,
  						    (__v8di)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask8) -1);
  }
  
*************** _mm512_maskz_insertf64x4 (__mmask8 __U,
*** 5651,5657 ****
  #define _mm512_inserti64x4(X, Y, C)                                     \
    ((__m512i) __builtin_ia32_inserti64x4_mask ((__v8di)(__m512i) (X),    \
      (__v4di)(__m256i) (Y), (int) (C),					\
!     (__v8di)(__m512i)_mm512_undefined_si512 (),				\
      (__mmask8)-1))
  
  #define _mm512_mask_inserti64x4(W, U, X, Y, C)                          \
--- 5654,5660 ----
  #define _mm512_inserti64x4(X, Y, C)                                     \
    ((__m512i) __builtin_ia32_inserti64x4_mask ((__v8di)(__m512i) (X),    \
      (__v4di)(__m256i) (Y), (int) (C),					\
!     (__v8di)(__m512i)_mm512_undefined_epi32 (),				\
      (__mmask8)-1))
  
  #define _mm512_mask_inserti64x4(W, U, X, Y, C)                          \
*************** _mm512_permutex_epi64 (__m512i __X, cons
*** 6177,6183 ****
  {
    return (__m512i) __builtin_ia32_permdi512_mask ((__v8di) __X, __I,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) (-1));
  }
  
--- 6180,6186 ----
  {
    return (__m512i) __builtin_ia32_permdi512_mask ((__v8di) __X, __I,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) (-1));
  }
  
*************** _mm512_maskz_permutex_pd (__mmask8 __U,
*** 6248,6254 ****
    ((__m512i) __builtin_ia32_permdi512_mask ((__v8di)(__m512i)(X), \
  					    (int)(I),             \
  					    (__v8di)(__m512i)	  \
! 					    (_mm512_undefined_si512 ()),\
  					    (__mmask8)(-1)))
  
  #define _mm512_maskz_permutex_epi64(M, X, I)                 \
--- 6251,6257 ----
    ((__m512i) __builtin_ia32_permdi512_mask ((__v8di)(__m512i)(X), \
  					    (int)(I),             \
  					    (__v8di)(__m512i)	  \
! 					    (_mm512_undefined_epi32 ()),\
  					    (__mmask8)(-1)))
  
  #define _mm512_maskz_permutex_epi64(M, X, I)                 \
*************** _mm512_permutexvar_epi64 (__m512i __X, _
*** 6283,6289 ****
    return (__m512i) __builtin_ia32_permvardi512_mask ((__v8di) __Y,
  						     (__v8di) __X,
  						     (__v8di)
! 						     _mm512_undefined_si512 (),
  						     (__mmask8) -1);
  }
  
--- 6286,6292 ----
    return (__m512i) __builtin_ia32_permvardi512_mask ((__v8di) __Y,
  						     (__v8di) __X,
  						     (__v8di)
! 						     _mm512_undefined_epi32 (),
  						     (__mmask8) -1);
  }
  
*************** _mm512_permutexvar_epi32 (__m512i __X, _
*** 6316,6322 ****
    return (__m512i) __builtin_ia32_permvarsi512_mask ((__v16si) __Y,
  						     (__v16si) __X,
  						     (__v16si)
! 						     _mm512_undefined_si512 (),
  						     (__mmask16) -1);
  }
  
--- 6319,6325 ----
    return (__m512i) __builtin_ia32_permvarsi512_mask ((__v16si) __Y,
  						     (__v16si) __X,
  						     (__v16si)
! 						     _mm512_undefined_epi32 (),
  						     (__mmask16) -1);
  }
  
*************** _mm512_rol_epi32 (__m512i __A, const int
*** 6891,6897 ****
  {
    return (__m512i) __builtin_ia32_prold512_mask ((__v16si) __A, __B,
  						 (__v16si)
! 						 _mm512_undefined_si512 (),
  						 (__mmask16) -1);
  }
  
--- 6894,6900 ----
  {
    return (__m512i) __builtin_ia32_prold512_mask ((__v16si) __A, __B,
  						 (__v16si)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask16) -1);
  }
  
*************** _mm512_ror_epi32 (__m512i __A, int __B)
*** 6920,6926 ****
  {
    return (__m512i) __builtin_ia32_prord512_mask ((__v16si) __A, __B,
  						 (__v16si)
! 						 _mm512_undefined_si512 (),
  						 (__mmask16) -1);
  }
  
--- 6923,6929 ----
  {
    return (__m512i) __builtin_ia32_prord512_mask ((__v16si) __A, __B,
  						 (__v16si)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask16) -1);
  }
  
*************** _mm512_rol_epi64 (__m512i __A, const int
*** 6949,6955 ****
  {
    return (__m512i) __builtin_ia32_prolq512_mask ((__v8di) __A, __B,
  						 (__v8di)
! 						 _mm512_undefined_si512 (),
  						 (__mmask8) -1);
  }
  
--- 6952,6958 ----
  {
    return (__m512i) __builtin_ia32_prolq512_mask ((__v8di) __A, __B,
  						 (__v8di)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask8) -1);
  }
  
*************** _mm512_ror_epi64 (__m512i __A, int __B)
*** 6978,6984 ****
  {
    return (__m512i) __builtin_ia32_prorq512_mask ((__v8di) __A, __B,
  						 (__v8di)
! 						 _mm512_undefined_si512 (),
  						 (__mmask8) -1);
  }
  
--- 6981,6987 ----
  {
    return (__m512i) __builtin_ia32_prorq512_mask ((__v8di) __A, __B,
  						 (__v8di)
! 						 _mm512_undefined_epi32 (),
  						 (__mmask8) -1);
  }
  
*************** _mm512_maskz_ror_epi64 (__mmask8 __U, __
*** 7005,7011 ****
  #define _mm512_rol_epi32(A, B)						  \
      ((__m512i)__builtin_ia32_prold512_mask ((__v16si)(__m512i)(A),	  \
  					    (int)(B),			  \
! 					    (__v16si)_mm512_undefined_si512 (), \
  					    (__mmask16)(-1)))
  #define _mm512_mask_rol_epi32(W, U, A, B)				  \
      ((__m512i)__builtin_ia32_prold512_mask ((__v16si)(__m512i)(A),	  \
--- 7008,7014 ----
  #define _mm512_rol_epi32(A, B)						  \
      ((__m512i)__builtin_ia32_prold512_mask ((__v16si)(__m512i)(A),	  \
  					    (int)(B),			  \
! 					    (__v16si)_mm512_undefined_epi32 (), \
  					    (__mmask16)(-1)))
  #define _mm512_mask_rol_epi32(W, U, A, B)				  \
      ((__m512i)__builtin_ia32_prold512_mask ((__v16si)(__m512i)(A),	  \
*************** _mm512_maskz_ror_epi64 (__mmask8 __U, __
*** 7020,7026 ****
  #define _mm512_ror_epi32(A, B)						  \
      ((__m512i)__builtin_ia32_prord512_mask ((__v16si)(__m512i)(A),	  \
  					    (int)(B),			  \
! 					    (__v16si)_mm512_undefined_si512 (), \
  					    (__mmask16)(-1)))
  #define _mm512_mask_ror_epi32(W, U, A, B)				  \
      ((__m512i)__builtin_ia32_prord512_mask ((__v16si)(__m512i)(A),	  \
--- 7023,7029 ----
  #define _mm512_ror_epi32(A, B)						  \
      ((__m512i)__builtin_ia32_prord512_mask ((__v16si)(__m512i)(A),	  \
  					    (int)(B),			  \
! 					    (__v16si)_mm512_undefined_epi32 (), \
  					    (__mmask16)(-1)))
  #define _mm512_mask_ror_epi32(W, U, A, B)				  \
      ((__m512i)__builtin_ia32_prord512_mask ((__v16si)(__m512i)(A),	  \
*************** _mm512_maskz_ror_epi64 (__mmask8 __U, __
*** 7035,7041 ****
  #define _mm512_rol_epi64(A, B)						  \
      ((__m512i)__builtin_ia32_prolq512_mask ((__v8di)(__m512i)(A),	  \
  					    (int)(B),			  \
! 					    (__v8di)_mm512_undefined_si512 (),  \
  					    (__mmask8)(-1)))
  #define _mm512_mask_rol_epi64(W, U, A, B)				  \
      ((__m512i)__builtin_ia32_prolq512_mask ((__v8di)(__m512i)(A),	  \
--- 7038,7044 ----
  #define _mm512_rol_epi64(A, B)						  \
      ((__m512i)__builtin_ia32_prolq512_mask ((__v8di)(__m512i)(A),	  \
  					    (int)(B),			  \
! 					    (__v8di)_mm512_undefined_epi32 (),  \
  					    (__mmask8)(-1)))
  #define _mm512_mask_rol_epi64(W, U, A, B)				  \
      ((__m512i)__builtin_ia32_prolq512_mask ((__v8di)(__m512i)(A),	  \
*************** _mm512_maskz_ror_epi64 (__mmask8 __U, __
*** 7051,7057 ****
  #define _mm512_ror_epi64(A, B)						  \
      ((__m512i)__builtin_ia32_prorq512_mask ((__v8di)(__m512i)(A),	  \
  					    (int)(B),			  \
! 					    (__v8di)_mm512_undefined_si512 (),  \
  					    (__mmask8)(-1)))
  #define _mm512_mask_ror_epi64(W, U, A, B)				  \
      ((__m512i)__builtin_ia32_prorq512_mask ((__v8di)(__m512i)(A),	  \
--- 7054,7060 ----
  #define _mm512_ror_epi64(A, B)						  \
      ((__m512i)__builtin_ia32_prorq512_mask ((__v8di)(__m512i)(A),	  \
  					    (int)(B),			  \
! 					    (__v8di)_mm512_undefined_epi32 (),  \
  					    (__mmask8)(-1)))
  #define _mm512_mask_ror_epi64(W, U, A, B)				  \
      ((__m512i)__builtin_ia32_prorq512_mask ((__v8di)(__m512i)(A),	  \
*************** _mm512_andnot_si512 (__m512i __A, __m512
*** 7134,7140 ****
    return (__m512i) __builtin_ia32_pandnd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 7137,7143 ----
    return (__m512i) __builtin_ia32_pandnd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_andnot_epi32 (__m512i __A, __m512
*** 7145,7151 ****
    return (__m512i) __builtin_ia32_pandnd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 7148,7154 ----
    return (__m512i) __builtin_ia32_pandnd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_andnot_epi64 (__m512i __A, __m512
*** 7177,7183 ****
    return (__m512i) __builtin_ia32_pandnq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 7180,7186 ----
    return (__m512i) __builtin_ia32_pandnq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_unpackhi_epi32 (__m512i __A, __m5
*** 7275,7281 ****
    return (__m512i) __builtin_ia32_punpckhdq512_mask ((__v16si) __A,
  						     (__v16si) __B,
  						     (__v16si)
! 						     _mm512_undefined_si512 (),
  						     (__mmask16) -1);
  }
  
--- 7278,7284 ----
    return (__m512i) __builtin_ia32_punpckhdq512_mask ((__v16si) __A,
  						     (__v16si) __B,
  						     (__v16si)
! 						     _mm512_undefined_epi32 (),
  						     (__mmask16) -1);
  }
  
*************** _mm512_unpackhi_epi64 (__m512i __A, __m5
*** 7308,7314 ****
    return (__m512i) __builtin_ia32_punpckhqdq512_mask ((__v8di) __A,
  						      (__v8di) __B,
  						      (__v8di)
! 						      _mm512_undefined_si512 (),
  						      (__mmask8) -1);
  }
  
--- 7311,7317 ----
    return (__m512i) __builtin_ia32_punpckhqdq512_mask ((__v8di) __A,
  						      (__v8di) __B,
  						      (__v8di)
! 						      _mm512_undefined_epi32 (),
  						      (__mmask8) -1);
  }
  
*************** _mm512_unpacklo_epi32 (__m512i __A, __m5
*** 7340,7346 ****
    return (__m512i) __builtin_ia32_punpckldq512_mask ((__v16si) __A,
  						     (__v16si) __B,
  						     (__v16si)
! 						     _mm512_undefined_si512 (),
  						     (__mmask16) -1);
  }
  
--- 7343,7349 ----
    return (__m512i) __builtin_ia32_punpckldq512_mask ((__v16si) __A,
  						     (__v16si) __B,
  						     (__v16si)
! 						     _mm512_undefined_epi32 (),
  						     (__mmask16) -1);
  }
  
*************** _mm512_unpacklo_epi64 (__m512i __A, __m5
*** 7373,7379 ****
    return (__m512i) __builtin_ia32_punpcklqdq512_mask ((__v8di) __A,
  						      (__v8di) __B,
  						      (__v8di)
! 						      _mm512_undefined_si512 (),
  						      (__mmask8) -1);
  }
  
--- 7376,7382 ----
    return (__m512i) __builtin_ia32_punpcklqdq512_mask ((__v8di) __A,
  						      (__v8di) __B,
  						      (__v8di)
! 						      _mm512_undefined_epi32 (),
  						      (__mmask8) -1);
  }
  
*************** _mm512_alignr_epi32 (__m512i __A, __m512
*** 8512,8518 ****
    return (__m512i) __builtin_ia32_alignd512_mask ((__v16si) __A,
  						  (__v16si) __B, __imm,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 8515,8521 ----
    return (__m512i) __builtin_ia32_alignd512_mask ((__v16si) __A,
  						  (__v16si) __B, __imm,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_alignr_epi64 (__m512i __A, __m512
*** 8546,8552 ****
    return (__m512i) __builtin_ia32_alignq512_mask ((__v8di) __A,
  						  (__v8di) __B, __imm,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 8549,8555 ----
    return (__m512i) __builtin_ia32_alignq512_mask ((__v8di) __A,
  						  (__v8di) __B, __imm,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_maskz_alignr_epi64 (__mmask8 __U,
*** 8575,8581 ****
  #else
  #define _mm512_alignr_epi32(X, Y, C)                                        \
      ((__m512i)__builtin_ia32_alignd512_mask ((__v16si)(__m512i)(X),         \
!         (__v16si)(__m512i)(Y), (int)(C), (__v16si)_mm512_undefined_si512 (),\
          (__mmask16)-1))
  
  #define _mm512_mask_alignr_epi32(W, U, X, Y, C)                             \
--- 8578,8584 ----
  #else
  #define _mm512_alignr_epi32(X, Y, C)                                        \
      ((__m512i)__builtin_ia32_alignd512_mask ((__v16si)(__m512i)(X),         \
!         (__v16si)(__m512i)(Y), (int)(C), (__v16si)_mm512_undefined_epi32 (),\
          (__mmask16)-1))
  
  #define _mm512_mask_alignr_epi32(W, U, X, Y, C)                             \
*************** _mm512_maskz_alignr_epi64 (__mmask8 __U,
*** 8590,8596 ****
  
  #define _mm512_alignr_epi64(X, Y, C)                                        \
      ((__m512i)__builtin_ia32_alignq512_mask ((__v8di)(__m512i)(X),          \
!         (__v8di)(__m512i)(Y), (int)(C), (__v8di)_mm512_undefined_si512 (),  \
  	(__mmask8)-1))
  
  #define _mm512_mask_alignr_epi64(W, U, X, Y, C)                             \
--- 8593,8599 ----
  
  #define _mm512_alignr_epi64(X, Y, C)                                        \
      ((__m512i)__builtin_ia32_alignq512_mask ((__v8di)(__m512i)(X),          \
!         (__v8di)(__m512i)(Y), (int)(C), (__v8di)_mm512_undefined_epi32 (),  \
  	(__mmask8)-1))
  
  #define _mm512_mask_alignr_epi64(W, U, X, Y, C)                             \
*************** _mm_mask_cmp_round_ss_mask (__mmask8 __M
*** 9130,9138 ****
  					   (__mmask8)-1))
  
  #define _mm512_cmp_epi32_mask(X, Y, P)					\
!   ((__mmask8) __builtin_ia32_cmpd512_mask ((__v16si)(__m512i)(X),	\
! 					   (__v16si)(__m512i)(Y), (int)(P),\
! 					   (__mmask16)-1))
  
  #define _mm512_cmp_epu64_mask(X, Y, P)					\
    ((__mmask8) __builtin_ia32_ucmpq512_mask ((__v8di)(__m512i)(X),	\
--- 9133,9141 ----
  					   (__mmask8)-1))
  
  #define _mm512_cmp_epi32_mask(X, Y, P)					\
!   ((__mmask16) __builtin_ia32_cmpd512_mask ((__v16si)(__m512i)(X),	\
! 					    (__v16si)(__m512i)(Y), (int)(P), \
! 					    (__mmask16)-1))
  
  #define _mm512_cmp_epu64_mask(X, Y, P)					\
    ((__mmask8) __builtin_ia32_ucmpq512_mask ((__v8di)(__m512i)(X),	\
*************** _mm_mask_cmp_round_ss_mask (__mmask8 __M
*** 9140,9205 ****
  					    (__mmask8)-1))
  
  #define _mm512_cmp_epu32_mask(X, Y, P)					\
!   ((__mmask8) __builtin_ia32_ucmpd512_mask ((__v16si)(__m512i)(X),	\
! 					    (__v16si)(__m512i)(Y), (int)(P),\
! 					    (__mmask16)-1))
  
! #define _mm512_cmp_round_pd_mask(X, Y, P, R)					\
    ((__mmask8) __builtin_ia32_cmppd512_mask ((__v8df)(__m512d)(X),	\
  					    (__v8df)(__m512d)(Y), (int)(P),\
  					    (__mmask8)-1, R))
  
! #define _mm512_cmp_round_ps_mask(X, Y, P, R)					\
    ((__mmask16) __builtin_ia32_cmpps512_mask ((__v16sf)(__m512)(X),	\
  					     (__v16sf)(__m512)(Y), (int)(P),\
  					     (__mmask16)-1, R))
  
! #define _mm512_mask_cmp_epi64_mask(M, X, Y, P)					\
    ((__mmask8) __builtin_ia32_cmpq512_mask ((__v8di)(__m512i)(X),	\
  					   (__v8di)(__m512i)(Y), (int)(P),\
  					   (__mmask8)M))
  
! #define _mm512_mask_cmp_epi32_mask(M, X, Y, P)					\
!   ((__mmask8) __builtin_ia32_cmpd512_mask ((__v16si)(__m512i)(X),	\
! 					   (__v16si)(__m512i)(Y), (int)(P),\
! 					   (__mmask16)M))
  
! #define _mm512_mask_cmp_epu64_mask(M, X, Y, P)					\
    ((__mmask8) __builtin_ia32_ucmpq512_mask ((__v8di)(__m512i)(X),	\
  					    (__v8di)(__m512i)(Y), (int)(P),\
  					    (__mmask8)M))
  
! #define _mm512_mask_cmp_epu32_mask(M, X, Y, P)					\
!   ((__mmask8) __builtin_ia32_ucmpd512_mask ((__v16si)(__m512i)(X),	\
! 					    (__v16si)(__m512i)(Y), (int)(P),\
! 					    (__mmask16)M))
  
! #define _mm512_mask_cmp_round_pd_mask(M, X, Y, P, R)					\
    ((__mmask8) __builtin_ia32_cmppd512_mask ((__v8df)(__m512d)(X),	\
  					    (__v8df)(__m512d)(Y), (int)(P),\
  					    (__mmask8)M, R))
  
! #define _mm512_mask_cmp_round_ps_mask(M, X, Y, P, R)					\
    ((__mmask16) __builtin_ia32_cmpps512_mask ((__v16sf)(__m512)(X),	\
  					     (__v16sf)(__m512)(Y), (int)(P),\
  					     (__mmask16)M, R))
  
! #define _mm_cmp_round_sd_mask(X, Y, P, R)					\
    ((__mmask8) __builtin_ia32_cmpsd_mask ((__v2df)(__m128d)(X),		\
  					 (__v2df)(__m128d)(Y), (int)(P),\
  					 (__mmask8)-1, R))
  
! #define _mm_mask_cmp_round_sd_mask(M, X, Y, P, R)					\
    ((__mmask8) __builtin_ia32_cmpsd_mask ((__v2df)(__m128d)(X),		\
  					 (__v2df)(__m128d)(Y), (int)(P),\
  					 (M), R))
  
! #define _mm_cmp_round_ss_mask(X, Y, P, R)					\
    ((__mmask8) __builtin_ia32_cmpss_mask ((__v4sf)(__m128)(X),		\
  					 (__v4sf)(__m128)(Y), (int)(P), \
  					 (__mmask8)-1, R))
  
! #define _mm_mask_cmp_round_ss_mask(M, X, Y, P, R)					\
    ((__mmask8) __builtin_ia32_cmpss_mask ((__v4sf)(__m128)(X),		\
  					 (__v4sf)(__m128)(Y), (int)(P), \
  					 (M), R))
--- 9143,9208 ----
  					    (__mmask8)-1))
  
  #define _mm512_cmp_epu32_mask(X, Y, P)					\
!   ((__mmask16) __builtin_ia32_ucmpd512_mask ((__v16si)(__m512i)(X),	\
! 					     (__v16si)(__m512i)(Y), (int)(P), \
! 					     (__mmask16)-1))
  
! #define _mm512_cmp_round_pd_mask(X, Y, P, R)				\
    ((__mmask8) __builtin_ia32_cmppd512_mask ((__v8df)(__m512d)(X),	\
  					    (__v8df)(__m512d)(Y), (int)(P),\
  					    (__mmask8)-1, R))
  
! #define _mm512_cmp_round_ps_mask(X, Y, P, R)				\
    ((__mmask16) __builtin_ia32_cmpps512_mask ((__v16sf)(__m512)(X),	\
  					     (__v16sf)(__m512)(Y), (int)(P),\
  					     (__mmask16)-1, R))
  
! #define _mm512_mask_cmp_epi64_mask(M, X, Y, P)				\
    ((__mmask8) __builtin_ia32_cmpq512_mask ((__v8di)(__m512i)(X),	\
  					   (__v8di)(__m512i)(Y), (int)(P),\
  					   (__mmask8)M))
  
! #define _mm512_mask_cmp_epi32_mask(M, X, Y, P)				\
!   ((__mmask16) __builtin_ia32_cmpd512_mask ((__v16si)(__m512i)(X),	\
! 					    (__v16si)(__m512i)(Y), (int)(P), \
! 					    (__mmask16)M))
  
! #define _mm512_mask_cmp_epu64_mask(M, X, Y, P)				\
    ((__mmask8) __builtin_ia32_ucmpq512_mask ((__v8di)(__m512i)(X),	\
  					    (__v8di)(__m512i)(Y), (int)(P),\
  					    (__mmask8)M))
  
! #define _mm512_mask_cmp_epu32_mask(M, X, Y, P)				\
!   ((__mmask16) __builtin_ia32_ucmpd512_mask ((__v16si)(__m512i)(X),	\
! 					     (__v16si)(__m512i)(Y), (int)(P), \
! 					     (__mmask16)M))
  
! #define _mm512_mask_cmp_round_pd_mask(M, X, Y, P, R)			\
    ((__mmask8) __builtin_ia32_cmppd512_mask ((__v8df)(__m512d)(X),	\
  					    (__v8df)(__m512d)(Y), (int)(P),\
  					    (__mmask8)M, R))
  
! #define _mm512_mask_cmp_round_ps_mask(M, X, Y, P, R)			\
    ((__mmask16) __builtin_ia32_cmpps512_mask ((__v16sf)(__m512)(X),	\
  					     (__v16sf)(__m512)(Y), (int)(P),\
  					     (__mmask16)M, R))
  
! #define _mm_cmp_round_sd_mask(X, Y, P, R)				\
    ((__mmask8) __builtin_ia32_cmpsd_mask ((__v2df)(__m128d)(X),		\
  					 (__v2df)(__m128d)(Y), (int)(P),\
  					 (__mmask8)-1, R))
  
! #define _mm_mask_cmp_round_sd_mask(M, X, Y, P, R)			\
    ((__mmask8) __builtin_ia32_cmpsd_mask ((__v2df)(__m128d)(X),		\
  					 (__v2df)(__m128d)(Y), (int)(P),\
  					 (M), R))
  
! #define _mm_cmp_round_ss_mask(X, Y, P, R)				\
    ((__mmask8) __builtin_ia32_cmpss_mask ((__v4sf)(__m128)(X),		\
  					 (__v4sf)(__m128)(Y), (int)(P), \
  					 (__mmask8)-1, R))
  
! #define _mm_mask_cmp_round_ss_mask(M, X, Y, P, R)			\
    ((__mmask8) __builtin_ia32_cmpss_mask ((__v4sf)(__m128)(X),		\
  					 (__v4sf)(__m128)(Y), (int)(P), \
  					 (M), R))
*************** _mm_mask_cmp_round_ss_mask (__mmask8 __M
*** 9208,9230 ****
  #ifdef __OPTIMIZE__
  extern __inline __m512
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32gather_ps (__m512i __index, float const *__addr, int __scale)
  {
!   __m512 v1_old = _mm512_undefined_ps ();
!   __mmask16 mask = 0xFFFF;
  
!   return (__m512) __builtin_ia32_gathersiv16sf ((__v16sf) v1_old,
  						__addr,
  						(__v16si) __index,
! 						mask, __scale);
  }
  
  extern __inline __m512
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32gather_ps (__m512 v1_old, __mmask16 __mask,
! 			  __m512i __index, float const *__addr, int __scale)
  {
!   return (__m512) __builtin_ia32_gathersiv16sf ((__v16sf) v1_old,
  						__addr,
  						(__v16si) __index,
  						__mask, __scale);
--- 9211,9233 ----
  #ifdef __OPTIMIZE__
  extern __inline __m512
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32gather_ps (__m512i __index, void const *__addr, int __scale)
  {
!   __m512 __v1_old = _mm512_undefined_ps ();
!   __mmask16 __mask = 0xFFFF;
  
!   return (__m512) __builtin_ia32_gathersiv16sf ((__v16sf) __v1_old,
  						__addr,
  						(__v16si) __index,
! 						__mask, __scale);
  }
  
  extern __inline __m512
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32gather_ps (__m512 __v1_old, __mmask16 __mask,
! 			  __m512i __index, void const *__addr, int __scale)
  {
!   return (__m512) __builtin_ia32_gathersiv16sf ((__v16sf) __v1_old,
  						__addr,
  						(__v16si) __index,
  						__mask, __scale);
*************** _mm512_mask_i32gather_ps (__m512 v1_old,
*** 9232,9252 ****
  
  extern __inline __m512d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32gather_pd (__m256i __index, double const *__addr, int __scale)
  {
!   __m512d v1_old = _mm512_undefined_pd ();
!   __mmask8 mask = 0xFF;
  
!   return (__m512d) __builtin_ia32_gathersiv8df ((__v8df) v1_old,
  						__addr,
! 						(__v8si) __index, mask,
  						__scale);
  }
  
  extern __inline __m512d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i32gather_pd (__m512d __v1_old, __mmask8 __mask,
! 			  __m256i __index, double const *__addr, int __scale)
  {
    return (__m512d) __builtin_ia32_gathersiv8df ((__v8df) __v1_old,
  						__addr,
--- 9235,9255 ----
  
  extern __inline __m512d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32gather_pd (__m256i __index, void const *__addr, int __scale)
  {
!   __m512d __v1_old = _mm512_undefined_pd ();
!   __mmask8 __mask = 0xFF;
  
!   return (__m512d) __builtin_ia32_gathersiv8df ((__v8df) __v1_old,
  						__addr,
! 						(__v8si) __index, __mask,
  						__scale);
  }
  
  extern __inline __m512d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i32gather_pd (__m512d __v1_old, __mmask8 __mask,
! 			  __m256i __index, void const *__addr, int __scale)
  {
    return (__m512d) __builtin_ia32_gathersiv8df ((__v8df) __v1_old,
  						__addr,
*************** _mm512_mask_i32gather_pd (__m512d __v1_o
*** 9256,9276 ****
  
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64gather_ps (__m512i __index, float const *__addr, int __scale)
  {
!   __m256 v1_old = _mm256_undefined_ps ();
!   __mmask8 mask = 0xFF;
  
!   return (__m256) __builtin_ia32_gatherdiv16sf ((__v8sf) v1_old,
  						__addr,
! 						(__v8di) __index, mask,
  						__scale);
  }
  
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i64gather_ps (__m256 __v1_old, __mmask8 __mask,
! 			  __m512i __index, float const *__addr, int __scale)
  {
    return (__m256) __builtin_ia32_gatherdiv16sf ((__v8sf) __v1_old,
  						__addr,
--- 9259,9279 ----
  
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64gather_ps (__m512i __index, void const *__addr, int __scale)
  {
!   __m256 __v1_old = _mm256_undefined_ps ();
!   __mmask8 __mask = 0xFF;
  
!   return (__m256) __builtin_ia32_gatherdiv16sf ((__v8sf) __v1_old,
  						__addr,
! 						(__v8di) __index, __mask,
  						__scale);
  }
  
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i64gather_ps (__m256 __v1_old, __mmask8 __mask,
! 			  __m512i __index, void const *__addr, int __scale)
  {
    return (__m256) __builtin_ia32_gatherdiv16sf ((__v8sf) __v1_old,
  						__addr,
*************** _mm512_mask_i64gather_ps (__m256 __v1_ol
*** 9280,9300 ****
  
  extern __inline __m512d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64gather_pd (__m512i __index, double const *__addr, int __scale)
  {
!   __m512d v1_old = _mm512_undefined_pd ();
!   __mmask8 mask = 0xFF;
  
!   return (__m512d) __builtin_ia32_gatherdiv8df ((__v8df) v1_old,
  						__addr,
! 						(__v8di) __index, mask,
  						__scale);
  }
  
  extern __inline __m512d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i64gather_pd (__m512d __v1_old, __mmask8 __mask,
! 			  __m512i __index, double const *__addr, int __scale)
  {
    return (__m512d) __builtin_ia32_gatherdiv8df ((__v8df) __v1_old,
  						__addr,
--- 9283,9303 ----
  
  extern __inline __m512d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64gather_pd (__m512i __index, void const *__addr, int __scale)
  {
!   __m512d __v1_old = _mm512_undefined_pd ();
!   __mmask8 __mask = 0xFF;
  
!   return (__m512d) __builtin_ia32_gatherdiv8df ((__v8df) __v1_old,
  						__addr,
! 						(__v8di) __index, __mask,
  						__scale);
  }
  
  extern __inline __m512d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i64gather_pd (__m512d __v1_old, __mmask8 __mask,
! 			  __m512i __index, void const *__addr, int __scale)
  {
    return (__m512d) __builtin_ia32_gatherdiv8df ((__v8df) __v1_old,
  						__addr,
*************** _mm512_mask_i64gather_pd (__m512d __v1_o
*** 9304,9324 ****
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32gather_epi32 (__m512i __index, int const *__addr, int __scale)
  {
!   __m512i v1_old = _mm512_undefined_si512 ();
!   __mmask16 mask = 0xFFFF;
  
!   return (__m512i) __builtin_ia32_gathersiv16si ((__v16si) v1_old,
  						 __addr,
  						 (__v16si) __index,
! 						 mask, __scale);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i32gather_epi32 (__m512i __v1_old, __mmask16 __mask,
! 			     __m512i __index, int const *__addr, int __scale)
  {
    return (__m512i) __builtin_ia32_gathersiv16si ((__v16si) __v1_old,
  						 __addr,
--- 9307,9327 ----
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32gather_epi32 (__m512i __index, void const *__addr, int __scale)
  {
!   __m512i __v1_old = _mm512_undefined_epi32 ();
!   __mmask16 __mask = 0xFFFF;
  
!   return (__m512i) __builtin_ia32_gathersiv16si ((__v16si) __v1_old,
  						 __addr,
  						 (__v16si) __index,
! 						 __mask, __scale);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i32gather_epi32 (__m512i __v1_old, __mmask16 __mask,
! 			     __m512i __index, void const *__addr, int __scale)
  {
    return (__m512i) __builtin_ia32_gathersiv16si ((__v16si) __v1_old,
  						 __addr,
*************** _mm512_mask_i32gather_epi32 (__m512i __v
*** 9328,9348 ****
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32gather_epi64 (__m256i __index, long long const *__addr, int __scale)
  {
!   __m512i v1_old = _mm512_undefined_si512 ();
!   __mmask8 mask = 0xFF;
  
!   return (__m512i) __builtin_ia32_gathersiv8di ((__v8di) v1_old,
  						__addr,
! 						(__v8si) __index, mask,
  						__scale);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i32gather_epi64 (__m512i __v1_old, __mmask8 __mask,
! 			     __m256i __index, long long const *__addr,
  			     int __scale)
  {
    return (__m512i) __builtin_ia32_gathersiv8di ((__v8di) __v1_old,
--- 9331,9351 ----
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32gather_epi64 (__m256i __index, void const *__addr, int __scale)
  {
!   __m512i __v1_old = _mm512_undefined_epi32 ();
!   __mmask8 __mask = 0xFF;
  
!   return (__m512i) __builtin_ia32_gathersiv8di ((__v8di) __v1_old,
  						__addr,
! 						(__v8si) __index, __mask,
  						__scale);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i32gather_epi64 (__m512i __v1_old, __mmask8 __mask,
! 			     __m256i __index, void const *__addr,
  			     int __scale)
  {
    return (__m512i) __builtin_ia32_gathersiv8di ((__v8di) __v1_old,
*************** _mm512_mask_i32gather_epi64 (__m512i __v
*** 9353,9373 ****
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64gather_epi32 (__m512i __index, int const *__addr, int __scale)
  {
!   __m256i v1_old = _mm256_undefined_si256 ();
!   __mmask8 mask = 0xFF;
  
!   return (__m256i) __builtin_ia32_gatherdiv16si ((__v8si) v1_old,
  						 __addr,
  						 (__v8di) __index,
! 						 mask, __scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i64gather_epi32 (__m256i __v1_old, __mmask8 __mask,
! 			     __m512i __index, int const *__addr, int __scale)
  {
    return (__m256i) __builtin_ia32_gatherdiv16si ((__v8si) __v1_old,
  						 __addr,
--- 9356,9376 ----
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64gather_epi32 (__m512i __index, void const *__addr, int __scale)
  {
!   __m256i __v1_old = _mm256_undefined_si256 ();
!   __mmask8 __mask = 0xFF;
  
!   return (__m256i) __builtin_ia32_gatherdiv16si ((__v8si) __v1_old,
  						 __addr,
  						 (__v8di) __index,
! 						 __mask, __scale);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i64gather_epi32 (__m256i __v1_old, __mmask8 __mask,
! 			     __m512i __index, void const *__addr, int __scale)
  {
    return (__m256i) __builtin_ia32_gatherdiv16si ((__v8si) __v1_old,
  						 __addr,
*************** _mm512_mask_i64gather_epi32 (__m256i __v
*** 9377,9397 ****
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64gather_epi64 (__m512i __index, long long const *__addr, int __scale)
  {
!   __m512i v1_old = _mm512_undefined_si512 ();
!   __mmask8 mask = 0xFF;
  
!   return (__m512i) __builtin_ia32_gatherdiv8di ((__v8di) v1_old,
  						__addr,
! 						(__v8di) __index, mask,
  						__scale);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i64gather_epi64 (__m512i __v1_old, __mmask8 __mask,
! 			     __m512i __index, long long const *__addr,
  			     int __scale)
  {
    return (__m512i) __builtin_ia32_gatherdiv8di ((__v8di) __v1_old,
--- 9380,9400 ----
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64gather_epi64 (__m512i __index, void const *__addr, int __scale)
  {
!   __m512i __v1_old = _mm512_undefined_epi32 ();
!   __mmask8 __mask = 0xFF;
  
!   return (__m512i) __builtin_ia32_gatherdiv8di ((__v8di) __v1_old,
  						__addr,
! 						(__v8di) __index, __mask,
  						__scale);
  }
  
  extern __inline __m512i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm512_mask_i64gather_epi64 (__m512i __v1_old, __mmask8 __mask,
! 			     __m512i __index, void const *__addr,
  			     int __scale)
  {
    return (__m512i) __builtin_ia32_gatherdiv8di ((__v8di) __v1_old,
*************** _mm512_mask_i64gather_epi64 (__m512i __v
*** 9402,9408 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32scatter_ps (float *__addr, __m512i __index, __m512 __v1, int __scale)
  {
    __builtin_ia32_scattersiv16sf (__addr, (__mmask16) 0xFFFF,
  				 (__v16si) __index, (__v16sf) __v1, __scale);
--- 9405,9411 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32scatter_ps (void *__addr, __m512i __index, __m512 __v1, int __scale)
  {
    __builtin_ia32_scattersiv16sf (__addr, (__mmask16) 0xFFFF,
  				 (__v16si) __index, (__v16sf) __v1, __scale);
*************** _mm512_i32scatter_ps (float *__addr, __m
*** 9410,9416 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32scatter_ps (float *__addr, __mmask16 __mask,
  			   __m512i __index, __m512 __v1, int __scale)
  {
    __builtin_ia32_scattersiv16sf (__addr, __mask, (__v16si) __index,
--- 9413,9419 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32scatter_ps (void *__addr, __mmask16 __mask,
  			   __m512i __index, __m512 __v1, int __scale)
  {
    __builtin_ia32_scattersiv16sf (__addr, __mask, (__v16si) __index,
*************** _mm512_mask_i32scatter_ps (float *__addr
*** 9419,9425 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32scatter_pd (double *__addr, __m256i __index, __m512d __v1,
  		      int __scale)
  {
    __builtin_ia32_scattersiv8df (__addr, (__mmask8) 0xFF,
--- 9422,9428 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32scatter_pd (void *__addr, __m256i __index, __m512d __v1,
  		      int __scale)
  {
    __builtin_ia32_scattersiv8df (__addr, (__mmask8) 0xFF,
*************** _mm512_i32scatter_pd (double *__addr, __
*** 9428,9434 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32scatter_pd (double *__addr, __mmask8 __mask,
  			   __m256i __index, __m512d __v1, int __scale)
  {
    __builtin_ia32_scattersiv8df (__addr, __mask, (__v8si) __index,
--- 9431,9437 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32scatter_pd (void *__addr, __mmask8 __mask,
  			   __m256i __index, __m512d __v1, int __scale)
  {
    __builtin_ia32_scattersiv8df (__addr, __mask, (__v8si) __index,
*************** _mm512_mask_i32scatter_pd (double *__add
*** 9437,9443 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64scatter_ps (float *__addr, __m512i __index, __m256 __v1, int __scale)
  {
    __builtin_ia32_scatterdiv16sf (__addr, (__mmask8) 0xFF,
  				 (__v8di) __index, (__v8sf) __v1, __scale);
--- 9440,9446 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64scatter_ps (void *__addr, __m512i __index, __m256 __v1, int __scale)
  {
    __builtin_ia32_scatterdiv16sf (__addr, (__mmask8) 0xFF,
  				 (__v8di) __index, (__v8sf) __v1, __scale);
*************** _mm512_i64scatter_ps (float *__addr, __m
*** 9445,9451 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i64scatter_ps (float *__addr, __mmask8 __mask,
  			   __m512i __index, __m256 __v1, int __scale)
  {
    __builtin_ia32_scatterdiv16sf (__addr, __mask, (__v8di) __index,
--- 9448,9454 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i64scatter_ps (void *__addr, __mmask8 __mask,
  			   __m512i __index, __m256 __v1, int __scale)
  {
    __builtin_ia32_scatterdiv16sf (__addr, __mask, (__v8di) __index,
*************** _mm512_mask_i64scatter_ps (float *__addr
*** 9454,9460 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64scatter_pd (double *__addr, __m512i __index, __m512d __v1,
  		      int __scale)
  {
    __builtin_ia32_scatterdiv8df (__addr, (__mmask8) 0xFF,
--- 9457,9463 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64scatter_pd (void *__addr, __m512i __index, __m512d __v1,
  		      int __scale)
  {
    __builtin_ia32_scatterdiv8df (__addr, (__mmask8) 0xFF,
*************** _mm512_i64scatter_pd (double *__addr, __
*** 9463,9469 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i64scatter_pd (double *__addr, __mmask8 __mask,
  			   __m512i __index, __m512d __v1, int __scale)
  {
    __builtin_ia32_scatterdiv8df (__addr, __mask, (__v8di) __index,
--- 9466,9472 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i64scatter_pd (void *__addr, __mmask8 __mask,
  			   __m512i __index, __m512d __v1, int __scale)
  {
    __builtin_ia32_scatterdiv8df (__addr, __mask, (__v8di) __index,
*************** _mm512_mask_i64scatter_pd (double *__add
*** 9472,9478 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32scatter_epi32 (int *__addr, __m512i __index,
  			 __m512i __v1, int __scale)
  {
    __builtin_ia32_scattersiv16si (__addr, (__mmask16) 0xFFFF,
--- 9475,9481 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32scatter_epi32 (void *__addr, __m512i __index,
  			 __m512i __v1, int __scale)
  {
    __builtin_ia32_scattersiv16si (__addr, (__mmask16) 0xFFFF,
*************** _mm512_i32scatter_epi32 (int *__addr, __
*** 9481,9487 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32scatter_epi32 (int *__addr, __mmask16 __mask,
  			      __m512i __index, __m512i __v1, int __scale)
  {
    __builtin_ia32_scattersiv16si (__addr, __mask, (__v16si) __index,
--- 9484,9490 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32scatter_epi32 (void *__addr, __mmask16 __mask,
  			      __m512i __index, __m512i __v1, int __scale)
  {
    __builtin_ia32_scattersiv16si (__addr, __mask, (__v16si) __index,
*************** _mm512_mask_i32scatter_epi32 (int *__add
*** 9490,9496 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32scatter_epi64 (long long *__addr, __m256i __index,
  			 __m512i __v1, int __scale)
  {
    __builtin_ia32_scattersiv8di (__addr, (__mmask8) 0xFF,
--- 9493,9499 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i32scatter_epi64 (void *__addr, __m256i __index,
  			 __m512i __v1, int __scale)
  {
    __builtin_ia32_scattersiv8di (__addr, (__mmask8) 0xFF,
*************** _mm512_i32scatter_epi64 (long long *__ad
*** 9499,9505 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32scatter_epi64 (long long *__addr, __mmask8 __mask,
  			      __m256i __index, __m512i __v1, int __scale)
  {
    __builtin_ia32_scattersiv8di (__addr, __mask, (__v8si) __index,
--- 9502,9508 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i32scatter_epi64 (void *__addr, __mmask8 __mask,
  			      __m256i __index, __m512i __v1, int __scale)
  {
    __builtin_ia32_scattersiv8di (__addr, __mask, (__v8si) __index,
*************** _mm512_mask_i32scatter_epi64 (long long
*** 9508,9514 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64scatter_epi32 (int *__addr, __m512i __index,
  			 __m256i __v1, int __scale)
  {
    __builtin_ia32_scatterdiv16si (__addr, (__mmask8) 0xFF,
--- 9511,9517 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64scatter_epi32 (void *__addr, __m512i __index,
  			 __m256i __v1, int __scale)
  {
    __builtin_ia32_scatterdiv16si (__addr, (__mmask8) 0xFF,
*************** _mm512_i64scatter_epi32 (int *__addr, __
*** 9517,9523 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i64scatter_epi32 (int *__addr, __mmask8 __mask,
  			      __m512i __index, __m256i __v1, int __scale)
  {
    __builtin_ia32_scatterdiv16si (__addr, __mask, (__v8di) __index,
--- 9520,9526 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i64scatter_epi32 (void *__addr, __mmask8 __mask,
  			      __m512i __index, __m256i __v1, int __scale)
  {
    __builtin_ia32_scatterdiv16si (__addr, __mask, (__v8di) __index,
*************** _mm512_mask_i64scatter_epi32 (int *__add
*** 9526,9532 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64scatter_epi64 (long long *__addr, __m512i __index,
  			 __m512i __v1, int __scale)
  {
    __builtin_ia32_scatterdiv8di (__addr, (__mmask8) 0xFF,
--- 9529,9535 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_i64scatter_epi64 (void *__addr, __m512i __index,
  			 __m512i __v1, int __scale)
  {
    __builtin_ia32_scatterdiv8di (__addr, (__mmask8) 0xFF,
*************** _mm512_i64scatter_epi64 (long long *__ad
*** 9535,9541 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i64scatter_epi64 (long long *__addr, __mmask8 __mask,
  			      __m512i __index, __m512i __v1, int __scale)
  {
    __builtin_ia32_scatterdiv8di (__addr, __mask, (__v8di) __index,
--- 9538,9544 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_i64scatter_epi64 (void *__addr, __mmask8 __mask,
  			      __m512i __index, __m512i __v1, int __scale)
  {
    __builtin_ia32_scatterdiv8di (__addr, __mask, (__v8di) __index,
*************** _mm512_mask_i64scatter_epi64 (long long
*** 9544,9720 ****
  #else
  #define _mm512_i32gather_ps(INDEX, ADDR, SCALE)				\
    (__m512) __builtin_ia32_gathersiv16sf ((__v16sf)_mm512_undefined_ps(),\
! 					 (float const *)ADDR,		\
  					 (__v16si)(__m512i)INDEX,	\
  					 (__mmask16)0xFFFF, (int)SCALE)
  
  #define _mm512_mask_i32gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512) __builtin_ia32_gathersiv16sf ((__v16sf)(__m512)V1OLD,	\
! 					 (float const *)ADDR,		\
  					 (__v16si)(__m512i)INDEX,	\
  					 (__mmask16)MASK, (int)SCALE)
  
  #define _mm512_i32gather_pd(INDEX, ADDR, SCALE)				\
    (__m512d) __builtin_ia32_gathersiv8df ((__v8df)_mm512_undefined_pd(),	\
! 					 (double const *)ADDR,		\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i32gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512d) __builtin_ia32_gathersiv8df ((__v8df)(__m512d)V1OLD,	\
! 					 (double const *)ADDR,		\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i64gather_ps(INDEX, ADDR, SCALE)				\
    (__m256) __builtin_ia32_gatherdiv16sf ((__v8sf)_mm256_undefined_ps(),	\
! 					 (float const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i64gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256) __builtin_ia32_gatherdiv16sf ((__v8sf)(__m256)V1OLD,		\
! 					 (float const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i64gather_pd(INDEX, ADDR, SCALE)				\
    (__m512d) __builtin_ia32_gatherdiv8df ((__v8df)_mm512_undefined_pd(),	\
! 					 (double const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i64gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512d) __builtin_ia32_gatherdiv8df ((__v8df)(__m512d)V1OLD,	\
! 					 (double const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i32gather_epi32(INDEX, ADDR, SCALE)			\
!   (__m512i) __builtin_ia32_gathersiv16si ((__v16si)_mm512_undefined_si512 (),	\
! 					  (int const *)ADDR,		\
  					  (__v16si)(__m512i)INDEX,	\
  					  (__mmask16)0xFFFF, (int)SCALE)
  
  #define _mm512_mask_i32gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512i) __builtin_ia32_gathersiv16si ((__v16si)(__m512i)V1OLD,	\
! 					  (int const *)ADDR,		\
  					  (__v16si)(__m512i)INDEX,	\
  					  (__mmask16)MASK, (int)SCALE)
  
  #define _mm512_i32gather_epi64(INDEX, ADDR, SCALE)			\
!   (__m512i) __builtin_ia32_gathersiv8di ((__v8di)_mm512_undefined_si512 (),	\
! 					 (long long const *)ADDR,	\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i32gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512i) __builtin_ia32_gathersiv8di ((__v8di)(__m512i)V1OLD,	\
! 					 (long long const *)ADDR,	\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i64gather_epi32(INDEX, ADDR, SCALE)			  \
    (__m256i) __builtin_ia32_gatherdiv16si ((__v8si)_mm256_undefined_si256(), \
! 					  (int const *)ADDR,		  \
  					  (__v8di)(__m512i)INDEX,	  \
  					  (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i64gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256i) __builtin_ia32_gatherdiv16si ((__v8si)(__m256i)V1OLD,	\
! 					  (int const *)ADDR,		\
  					  (__v8di)(__m512i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i64gather_epi64(INDEX, ADDR, SCALE)			\
!   (__m512i) __builtin_ia32_gatherdiv8di ((__v8di)_mm512_undefined_si512 (),	\
! 					 (long long const *)ADDR,	\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i64gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512i) __builtin_ia32_gatherdiv8di ((__v8di)(__m512i)V1OLD,	\
! 					 (long long const *)ADDR,	\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i32scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv16sf ((float *)ADDR, (__mmask16)0xFFFF,	\
  				 (__v16si)(__m512i)INDEX,		\
  				 (__v16sf)(__m512)V1, (int)SCALE)
  
  #define _mm512_mask_i32scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv16sf ((float *)ADDR, (__mmask16)MASK,		\
  				 (__v16si)(__m512i)INDEX,		\
  				 (__v16sf)(__m512)V1, (int)SCALE)
  
  #define _mm512_i32scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv8df ((double *)ADDR, (__mmask8)0xFF,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8df)(__m512d)V1, (int)SCALE)
  
  #define _mm512_mask_i32scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv8df ((double *)ADDR, (__mmask8)MASK,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8df)(__m512d)V1, (int)SCALE)
  
  #define _mm512_i64scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv16sf ((float *)ADDR, (__mmask8)0xFF,		\
  				 (__v8di)(__m512i)INDEX,		\
  				 (__v8sf)(__m256)V1, (int)SCALE)
  
  #define _mm512_mask_i64scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv16sf ((float *)ADDR, (__mmask16)MASK,		\
  				 (__v8di)(__m512i)INDEX,		\
  				 (__v8sf)(__m256)V1, (int)SCALE)
  
  #define _mm512_i64scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv8df ((double *)ADDR, (__mmask8)0xFF,		\
  				(__v8di)(__m512i)INDEX,			\
  				(__v8df)(__m512d)V1, (int)SCALE)
  
  #define _mm512_mask_i64scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv8df ((double *)ADDR, (__mmask8)MASK,		\
  				(__v8di)(__m512i)INDEX,			\
  				(__v8df)(__m512d)V1, (int)SCALE)
  
  #define _mm512_i32scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv16si ((int *)ADDR, (__mmask16)0xFFFF,	\
  				 (__v16si)(__m512i)INDEX,		\
  				 (__v16si)(__m512i)V1, (int)SCALE)
  
  #define _mm512_mask_i32scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scattersiv16si ((int *)ADDR, (__mmask16)MASK,		\
  				 (__v16si)(__m512i)INDEX,		\
  				 (__v16si)(__m512i)V1, (int)SCALE)
  
  #define _mm512_i32scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv8di ((long long *)ADDR, (__mmask8)0xFF,	\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8di)(__m512i)V1, (int)SCALE)
  
  #define _mm512_mask_i32scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scattersiv8di ((long long *)ADDR, (__mmask8)MASK,	\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8di)(__m512i)V1, (int)SCALE)
  
  #define _mm512_i64scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv16si ((int *)ADDR, (__mmask8)0xFF,		\
  				 (__v8di)(__m512i)INDEX,		\
  				 (__v8si)(__m256i)V1, (int)SCALE)
  
  #define _mm512_mask_i64scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scatterdiv16si ((int *)ADDR, (__mmask8)MASK,		\
  				 (__v8di)(__m512i)INDEX,		\
  				 (__v8si)(__m256i)V1, (int)SCALE)
  
  #define _mm512_i64scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv8di ((long long *)ADDR, (__mmask8)0xFF,	\
  				(__v8di)(__m512i)INDEX,			\
  				(__v8di)(__m512i)V1, (int)SCALE)
  
  #define _mm512_mask_i64scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scatterdiv8di ((long long *)ADDR, (__mmask8)MASK,	\
  				(__v8di)(__m512i)INDEX,			\
  				(__v8di)(__m512i)V1, (int)SCALE)
  #endif
--- 9547,9723 ----
  #else
  #define _mm512_i32gather_ps(INDEX, ADDR, SCALE)				\
    (__m512) __builtin_ia32_gathersiv16sf ((__v16sf)_mm512_undefined_ps(),\
! 					 (void const *)ADDR,		\
  					 (__v16si)(__m512i)INDEX,	\
  					 (__mmask16)0xFFFF, (int)SCALE)
  
  #define _mm512_mask_i32gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512) __builtin_ia32_gathersiv16sf ((__v16sf)(__m512)V1OLD,	\
! 					 (void const *)ADDR,		\
  					 (__v16si)(__m512i)INDEX,	\
  					 (__mmask16)MASK, (int)SCALE)
  
  #define _mm512_i32gather_pd(INDEX, ADDR, SCALE)				\
    (__m512d) __builtin_ia32_gathersiv8df ((__v8df)_mm512_undefined_pd(),	\
! 					 (void const *)ADDR,		\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i32gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512d) __builtin_ia32_gathersiv8df ((__v8df)(__m512d)V1OLD,	\
! 					 (void const *)ADDR,		\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i64gather_ps(INDEX, ADDR, SCALE)				\
    (__m256) __builtin_ia32_gatherdiv16sf ((__v8sf)_mm256_undefined_ps(),	\
! 					 (void const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i64gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256) __builtin_ia32_gatherdiv16sf ((__v8sf)(__m256)V1OLD,		\
! 					 (void const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i64gather_pd(INDEX, ADDR, SCALE)				\
    (__m512d) __builtin_ia32_gatherdiv8df ((__v8df)_mm512_undefined_pd(),	\
! 					 (void const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i64gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512d) __builtin_ia32_gatherdiv8df ((__v8df)(__m512d)V1OLD,	\
! 					 (void const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i32gather_epi32(INDEX, ADDR, SCALE)			\
!   (__m512i) __builtin_ia32_gathersiv16si ((__v16si)_mm512_undefined_epi32 (),	\
! 					  (void const *)ADDR,		\
  					  (__v16si)(__m512i)INDEX,	\
  					  (__mmask16)0xFFFF, (int)SCALE)
  
  #define _mm512_mask_i32gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512i) __builtin_ia32_gathersiv16si ((__v16si)(__m512i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v16si)(__m512i)INDEX,	\
  					  (__mmask16)MASK, (int)SCALE)
  
  #define _mm512_i32gather_epi64(INDEX, ADDR, SCALE)			\
!   (__m512i) __builtin_ia32_gathersiv8di ((__v8di)_mm512_undefined_epi32 (),	\
! 					 (void const *)ADDR,		\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i32gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512i) __builtin_ia32_gathersiv8di ((__v8di)(__m512i)V1OLD,	\
! 					 (void const *)ADDR,		\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i64gather_epi32(INDEX, ADDR, SCALE)			  \
    (__m256i) __builtin_ia32_gatherdiv16si ((__v8si)_mm256_undefined_si256(), \
! 					  (void const *)ADDR,		  \
  					  (__v8di)(__m512i)INDEX,	  \
  					  (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i64gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256i) __builtin_ia32_gatherdiv16si ((__v8si)(__m256i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v8di)(__m512i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i64gather_epi64(INDEX, ADDR, SCALE)			\
!   (__m512i) __builtin_ia32_gatherdiv8di ((__v8di)_mm512_undefined_epi32 (),	\
! 					 (void const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)0xFF, (int)SCALE)
  
  #define _mm512_mask_i64gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m512i) __builtin_ia32_gatherdiv8di ((__v8di)(__m512i)V1OLD,	\
! 					 (void const *)ADDR,		\
  					 (__v8di)(__m512i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm512_i32scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv16sf ((void *)ADDR, (__mmask16)0xFFFF,	\
  				 (__v16si)(__m512i)INDEX,		\
  				 (__v16sf)(__m512)V1, (int)SCALE)
  
  #define _mm512_mask_i32scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv16sf ((void *)ADDR, (__mmask16)MASK,		\
  				 (__v16si)(__m512i)INDEX,		\
  				 (__v16sf)(__m512)V1, (int)SCALE)
  
  #define _mm512_i32scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv8df ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8df)(__m512d)V1, (int)SCALE)
  
  #define _mm512_mask_i32scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv8df ((void *)ADDR, (__mmask8)MASK,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8df)(__m512d)V1, (int)SCALE)
  
  #define _mm512_i64scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv16sf ((void *)ADDR, (__mmask8)0xFF,		\
  				 (__v8di)(__m512i)INDEX,		\
  				 (__v8sf)(__m256)V1, (int)SCALE)
  
  #define _mm512_mask_i64scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv16sf ((void *)ADDR, (__mmask16)MASK,		\
  				 (__v8di)(__m512i)INDEX,		\
  				 (__v8sf)(__m256)V1, (int)SCALE)
  
  #define _mm512_i64scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv8df ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v8di)(__m512i)INDEX,			\
  				(__v8df)(__m512d)V1, (int)SCALE)
  
  #define _mm512_mask_i64scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv8df ((void *)ADDR, (__mmask8)MASK,		\
  				(__v8di)(__m512i)INDEX,			\
  				(__v8df)(__m512d)V1, (int)SCALE)
  
  #define _mm512_i32scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv16si ((void *)ADDR, (__mmask16)0xFFFF,	\
  				 (__v16si)(__m512i)INDEX,		\
  				 (__v16si)(__m512i)V1, (int)SCALE)
  
  #define _mm512_mask_i32scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scattersiv16si ((void *)ADDR, (__mmask16)MASK,		\
  				 (__v16si)(__m512i)INDEX,		\
  				 (__v16si)(__m512i)V1, (int)SCALE)
  
  #define _mm512_i32scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv8di ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8di)(__m512i)V1, (int)SCALE)
  
  #define _mm512_mask_i32scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scattersiv8di ((void *)ADDR, (__mmask8)MASK,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8di)(__m512i)V1, (int)SCALE)
  
  #define _mm512_i64scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv16si ((void *)ADDR, (__mmask8)0xFF,		\
  				 (__v8di)(__m512i)INDEX,		\
  				 (__v8si)(__m256i)V1, (int)SCALE)
  
  #define _mm512_mask_i64scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scatterdiv16si ((void *)ADDR, (__mmask8)MASK,		\
  				 (__v8di)(__m512i)INDEX,		\
  				 (__v8si)(__m256i)V1, (int)SCALE)
  
  #define _mm512_i64scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv8di ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v8di)(__m512i)INDEX,			\
  				(__v8di)(__m512i)V1, (int)SCALE)
  
  #define _mm512_mask_i64scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scatterdiv8di ((void *)ADDR, (__mmask8)MASK,		\
  				(__v8di)(__m512i)INDEX,			\
  				(__v8di)(__m512i)V1, (int)SCALE)
  #endif
*************** _mm512_max_epi64 (__m512i __A, __m512i _
*** 10123,10129 ****
    return (__m512i) __builtin_ia32_pmaxsq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 10126,10132 ----
    return (__m512i) __builtin_ia32_pmaxsq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_min_epi64 (__m512i __A, __m512i _
*** 10154,10160 ****
    return (__m512i) __builtin_ia32_pminsq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 10157,10163 ----
    return (__m512i) __builtin_ia32_pminsq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_max_epu64 (__m512i __A, __m512i _
*** 10185,10191 ****
    return (__m512i) __builtin_ia32_pmaxuq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 10188,10194 ----
    return (__m512i) __builtin_ia32_pmaxuq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_min_epu64 (__m512i __A, __m512i _
*** 10216,10222 ****
    return (__m512i) __builtin_ia32_pminuq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_si512 (),
  						  (__mmask8) -1);
  }
  
--- 10219,10225 ----
    return (__m512i) __builtin_ia32_pminuq512_mask ((__v8di) __A,
  						  (__v8di) __B,
  						  (__v8di)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask8) -1);
  }
  
*************** _mm512_max_epi32 (__m512i __A, __m512i _
*** 10247,10253 ****
    return (__m512i) __builtin_ia32_pmaxsd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 10250,10256 ----
    return (__m512i) __builtin_ia32_pmaxsd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_min_epi32 (__m512i __A, __m512i _
*** 10278,10284 ****
    return (__m512i) __builtin_ia32_pminsd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 10281,10287 ----
    return (__m512i) __builtin_ia32_pminsd512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_max_epu32 (__m512i __A, __m512i _
*** 10309,10315 ****
    return (__m512i) __builtin_ia32_pmaxud512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 10312,10318 ----
    return (__m512i) __builtin_ia32_pmaxud512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_min_epu32 (__m512i __A, __m512i _
*** 10340,10346 ****
    return (__m512i) __builtin_ia32_pminud512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_si512 (),
  						  (__mmask16) -1);
  }
  
--- 10343,10349 ----
    return (__m512i) __builtin_ia32_pminud512_mask ((__v16si) __A,
  						  (__v16si) __B,
  						  (__v16si)
! 						  _mm512_undefined_epi32 (),
  						  (__mmask16) -1);
  }
  
*************** _mm512_cvttps_epi32 (__m512 __A)
*** 11804,11810 ****
  {
    return (__m512i) __builtin_ia32_cvttps2dq512_mask ((__v16sf) __A,
  						     (__v16si)
! 						     _mm512_undefined_si512 (),
  						     (__mmask16) -1,
  						     _MM_FROUND_CUR_DIRECTION);
  }
--- 11807,11813 ----
  {
    return (__m512i) __builtin_ia32_cvttps2dq512_mask ((__v16sf) __A,
  						     (__v16si)
! 						     _mm512_undefined_epi32 (),
  						     (__mmask16) -1,
  						     _MM_FROUND_CUR_DIRECTION);
  }
*************** _mm512_cvttps_epu32 (__m512 __A)
*** 11836,11842 ****
  {
    return (__m512i) __builtin_ia32_cvttps2udq512_mask ((__v16sf) __A,
  						      (__v16si)
! 						      _mm512_undefined_si512 (),
  						      (__mmask16) -1,
  						      _MM_FROUND_CUR_DIRECTION);
  }
--- 11839,11845 ----
  {
    return (__m512i) __builtin_ia32_cvttps2udq512_mask ((__v16sf) __A,
  						      (__v16si)
! 						      _mm512_undefined_epi32 (),
  						      (__mmask16) -1,
  						      _MM_FROUND_CUR_DIRECTION);
  }
*************** _mm512_cvtps_epi32 (__m512 __A)
*** 11868,11874 ****
  {
    return (__m512i) __builtin_ia32_cvtps2dq512_mask ((__v16sf) __A,
  						    (__v16si)
! 						    _mm512_undefined_si512 (),
  						    (__mmask16) -1,
  						    _MM_FROUND_CUR_DIRECTION);
  }
--- 11871,11877 ----
  {
    return (__m512i) __builtin_ia32_cvtps2dq512_mask ((__v16sf) __A,
  						    (__v16si)
! 						    _mm512_undefined_epi32 (),
  						    (__mmask16) -1,
  						    _MM_FROUND_CUR_DIRECTION);
  }
*************** _mm512_cvtps_epu32 (__m512 __A)
*** 11900,11906 ****
  {
    return (__m512i) __builtin_ia32_cvtps2udq512_mask ((__v16sf) __A,
  						     (__v16si)
! 						     _mm512_undefined_si512 (),
  						     (__mmask16) -1,
  						     _MM_FROUND_CUR_DIRECTION);
  }
--- 11903,11909 ----
  {
    return (__m512i) __builtin_ia32_cvtps2udq512_mask ((__v16sf) __A,
  						     (__v16si)
! 						     _mm512_undefined_epi32 (),
  						     (__mmask16) -1,
  						     _MM_FROUND_CUR_DIRECTION);
  }
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512ifmaintrin.h gcc-5.5.0/gcc/config/i386/avx512ifmaintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512ifmaintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512ifmaintrin.h	Mon Aug 22 18:57:37 2016
*************** _mm512_madd52lo_epu64 (__m512i __X, __m5
*** 41,47 ****
    return (__m512i) __builtin_ia32_vpmadd52luq512_mask ((__v8di) __X,
  						       (__v8di) __Y,
  						       (__v8di) __Z,
! 						       (__mmask8) - 1);
  }
  
  extern __inline __m512i
--- 41,47 ----
    return (__m512i) __builtin_ia32_vpmadd52luq512_mask ((__v8di) __X,
  						       (__v8di) __Y,
  						       (__v8di) __Z,
! 						       (__mmask8) -1);
  }
  
  extern __inline __m512i
*************** _mm512_madd52hi_epu64 (__m512i __X, __m5
*** 51,57 ****
    return (__m512i) __builtin_ia32_vpmadd52huq512_mask ((__v8di) __X,
  						       (__v8di) __Y,
  						       (__v8di) __Z,
! 						       (__mmask8) - 1);
  }
  
  extern __inline __m512i
--- 51,57 ----
    return (__m512i) __builtin_ia32_vpmadd52huq512_mask ((__v8di) __X,
  						       (__v8di) __Y,
  						       (__v8di) __Z,
! 						       (__mmask8) -1);
  }
  
  extern __inline __m512i
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512ifmavlintrin.h gcc-5.5.0/gcc/config/i386/avx512ifmavlintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512ifmavlintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512ifmavlintrin.h	Mon Aug 22 18:57:37 2016
*************** _mm_madd52lo_epu64 (__m128i __X, __m128i
*** 41,47 ****
    return (__m128i) __builtin_ia32_vpmadd52luq128_mask ((__v2di) __X,
  						       (__v2di) __Y,
  						       (__v2di) __Z,
! 						       (__mmask8) - 1);
  }
  
  extern __inline __m128i
--- 41,47 ----
    return (__m128i) __builtin_ia32_vpmadd52luq128_mask ((__v2di) __X,
  						       (__v2di) __Y,
  						       (__v2di) __Z,
! 						       (__mmask8) -1);
  }
  
  extern __inline __m128i
*************** _mm_madd52hi_epu64 (__m128i __X, __m128i
*** 51,57 ****
    return (__m128i) __builtin_ia32_vpmadd52huq128_mask ((__v2di) __X,
  						       (__v2di) __Y,
  						       (__v2di) __Z,
! 						       (__mmask8) - 1);
  }
  
  extern __inline __m256i
--- 51,57 ----
    return (__m128i) __builtin_ia32_vpmadd52huq128_mask ((__v2di) __X,
  						       (__v2di) __Y,
  						       (__v2di) __Z,
! 						       (__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm256_madd52lo_epu64 (__m256i __X, __m2
*** 61,67 ****
    return (__m256i) __builtin_ia32_vpmadd52luq256_mask ((__v4di) __X,
  						       (__v4di) __Y,
  						       (__v4di) __Z,
! 						       (__mmask8) - 1);
  }
  
  extern __inline __m256i
--- 61,67 ----
    return (__m256i) __builtin_ia32_vpmadd52luq256_mask ((__v4di) __X,
  						       (__v4di) __Y,
  						       (__v4di) __Z,
! 						       (__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm256_madd52hi_epu64 (__m256i __X, __m2
*** 71,77 ****
    return (__m256i) __builtin_ia32_vpmadd52huq256_mask ((__v4di) __X,
  						       (__v4di) __Y,
  						       (__v4di) __Z,
! 						       (__mmask8) - 1);
  }
  
  extern __inline __m128i
--- 71,77 ----
    return (__m256i) __builtin_ia32_vpmadd52huq256_mask ((__v4di) __X,
  						       (__v4di) __Y,
  						       (__v4di) __Z,
! 						       (__mmask8) -1);
  }
  
  extern __inline __m128i
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512pfintrin.h gcc-5.5.0/gcc/config/i386/avx512pfintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512pfintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512pfintrin.h	Thu Jun  1 21:51:51 2017
*************** typedef unsigned short __mmask16;
*** 48,207 ****
  #ifdef __OPTIMIZE__
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i32gather_pd (__m256i index, __mmask8 mask,
! 				   void *addr, int scale, int hint)
  {
!   __builtin_ia32_gatherpfdpd (mask, (__v8si) index, (long long const *) addr,
! 			      scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i32gather_ps (__m512i index, __mmask16 mask,
! 				   void *addr, int scale, int hint)
  {
!   __builtin_ia32_gatherpfdps (mask, (__v16si) index, (int const *) addr,
! 			      scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i64gather_pd (__m512i index, __mmask8 mask,
! 				   void *addr, int scale, int hint)
  {
!   __builtin_ia32_gatherpfqpd (mask, (__v8di) index, (long long const *) addr,
! 			      scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i64gather_ps (__m512i index, __mmask8 mask,
! 				   void *addr, int scale, int hint)
  {
!   __builtin_ia32_gatherpfqps (mask, (__v8di) index, (int const *) addr,
! 			      scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_prefetch_i32scatter_pd (void *addr, __m256i index, int scale,
! 			       int hint)
  {
!   __builtin_ia32_scatterpfdpd ((__mmask8) 0xFF, (__v8si) index, 
! 			       (long long const *)addr, scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_prefetch_i32scatter_ps (void *addr, __m512i index, int scale,
! 			       int hint)
  {
!   __builtin_ia32_scatterpfdps ((__mmask16) 0xFFFF, (__v16si) index, (int const *) addr,
! 			       scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i32scatter_pd (void *addr, __mmask8 mask,
! 				    __m256i index, int scale, int hint)
  {
!   __builtin_ia32_scatterpfdpd (mask, (__v8si) index, (long long const *) addr,
! 			       scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i32scatter_ps (void *addr, __mmask16 mask,
! 				    __m512i index, int scale, int hint)
  {
!   __builtin_ia32_scatterpfdps (mask, (__v16si) index, (int const *) addr,
! 			       scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_prefetch_i64scatter_pd (void *addr, __m512i index, int scale,
! 			       int hint)
  {
!   __builtin_ia32_scatterpfqpd ((__mmask8) 0xFF, (__v8di) index, (long long const *) addr,
! 			       scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_prefetch_i64scatter_ps (void *addr, __m512i index, int scale,
! 			       int hint)
  {
!   __builtin_ia32_scatterpfqps ((__mmask8) 0xFF, (__v8di) index, (int const *) addr,
! 			       scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i64scatter_pd (void *addr, __mmask16 mask,
! 				    __m512i index, int scale, int hint)
  {
!   __builtin_ia32_scatterpfqpd (mask, (__v8di) index, (long long const *) addr,
! 			       scale, hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i64scatter_ps (void *addr, __mmask16 mask,
! 				    __m512i index, int scale, int hint)
  {
!   __builtin_ia32_scatterpfqps (mask, (__v8di) index, (int const *) addr,
! 			       scale, hint);
  }
  
  #else
  #define _mm512_mask_prefetch_i32gather_pd(INDEX, MASK, ADDR, SCALE, HINT)    \
    __builtin_ia32_gatherpfdpd ((__mmask8)MASK, (__v8si)(__m256i)INDEX,	     \
! 			      (long long const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i32gather_ps(INDEX, MASK, ADDR, SCALE, HINT)    \
    __builtin_ia32_gatherpfdps ((__mmask16)MASK, (__v16si)(__m512i)INDEX,      \
! 			      (int const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i64gather_pd(INDEX, MASK, ADDR, SCALE, HINT)    \
    __builtin_ia32_gatherpfqpd ((__mmask8)MASK, (__v8di)(__m512i)INDEX,	     \
! 			      (long long const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i64gather_ps(INDEX, MASK, ADDR, SCALE, HINT)    \
    __builtin_ia32_gatherpfqps ((__mmask8)MASK, (__v8di)(__m512i)INDEX,	     \
! 			      (int const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_prefetch_i32scatter_pd(ADDR, INDEX, SCALE, HINT)              \
    __builtin_ia32_scatterpfdpd ((__mmask8)0xFF, (__v8si)(__m256i)INDEX,       \
! 			       (long long const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_prefetch_i32scatter_ps(ADDR, INDEX, SCALE, HINT)              \
    __builtin_ia32_scatterpfdps ((__mmask16)0xFFFF, (__v16si)(__m512i)INDEX,   \
! 			       (int const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i32scatter_pd(ADDR, MASK, INDEX, SCALE, HINT)   \
    __builtin_ia32_scatterpfdpd ((__mmask8)MASK, (__v8si)(__m256i)INDEX,       \
! 			       (long long const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i32scatter_ps(ADDR, MASK, INDEX, SCALE, HINT)   \
    __builtin_ia32_scatterpfdps ((__mmask16)MASK, (__v16si)(__m512i)INDEX,     \
! 			       (int const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_prefetch_i64scatter_pd(ADDR, INDEX, SCALE, HINT)              \
    __builtin_ia32_scatterpfqpd ((__mmask8)0xFF, (__v8di)(__m512i)INDEX,	     \
! 			       (long long const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_prefetch_i64scatter_ps(ADDR, INDEX, SCALE, HINT)              \
    __builtin_ia32_scatterpfqps ((__mmask8)0xFF, (__v8di)(__m512i)INDEX,	     \
! 			       (int const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i64scatter_pd(ADDR, MASK, INDEX, SCALE, HINT)   \
    __builtin_ia32_scatterpfqpd ((__mmask8)MASK, (__v8di)(__m512i)INDEX,	     \
! 			       (long long const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i64scatter_ps(ADDR, MASK, INDEX, SCALE, HINT)   \
    __builtin_ia32_scatterpfqps ((__mmask8)MASK, (__v8di)(__m512i)INDEX,	     \
! 			       (int const *)ADDR, (int)SCALE, (int)HINT)
  #endif
  
  #ifdef __DISABLE_AVX512PF__
--- 48,207 ----
  #ifdef __OPTIMIZE__
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i32gather_pd (__m256i __index, __mmask8 __mask,
! 				   void const *__addr, int __scale, int __hint)
  {
!   __builtin_ia32_gatherpfdpd (__mask, (__v8si) __index,
! 			      __addr, __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i32gather_ps (__m512i __index, __mmask16 __mask,
! 				   void const *__addr, int __scale, int __hint)
  {
!   __builtin_ia32_gatherpfdps (__mask, (__v16si) __index, __addr,
! 			      __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i64gather_pd (__m512i __index, __mmask8 __mask,
! 				   void const *__addr, int __scale, int __hint)
  {
!   __builtin_ia32_gatherpfqpd (__mask, (__v8di) __index,
! 			      __addr, __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i64gather_ps (__m512i __index, __mmask8 __mask,
! 				   void const *__addr, int __scale, int __hint)
  {
!   __builtin_ia32_gatherpfqps (__mask, (__v8di) __index, __addr,
! 			      __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_prefetch_i32scatter_pd (void *__addr, __m256i __index, int __scale,
! 			       int __hint)
  {
!   __builtin_ia32_scatterpfdpd ((__mmask8) 0xFF, (__v8si) __index,
! 			       __addr, __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_prefetch_i32scatter_ps (void *__addr, __m512i __index, int __scale,
! 			       int __hint)
  {
!   __builtin_ia32_scatterpfdps ((__mmask16) 0xFFFF, (__v16si) __index,
! 			       __addr, __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i32scatter_pd (void *__addr, __mmask8 __mask,
! 				    __m256i __index, int __scale, int __hint)
  {
!   __builtin_ia32_scatterpfdpd (__mask, (__v8si) __index,
! 			       __addr, __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i32scatter_ps (void *__addr, __mmask16 __mask,
! 				    __m512i __index, int __scale, int __hint)
  {
!   __builtin_ia32_scatterpfdps (__mask, (__v16si) __index, __addr,
! 			       __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_prefetch_i64scatter_pd (void *__addr, __m512i __index, int __scale,
! 			       int __hint)
  {
!   __builtin_ia32_scatterpfqpd ((__mmask8) 0xFF, (__v8di) __index,
! 			       __addr, __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_prefetch_i64scatter_ps (void *__addr, __m512i __index, int __scale,
! 			       int __hint)
  {
!   __builtin_ia32_scatterpfqps ((__mmask8) 0xFF, (__v8di) __index,
! 			       __addr, __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i64scatter_pd (void *__addr, __mmask16 __mask,
! 				    __m512i __index, int __scale, int __hint)
  {
!   __builtin_ia32_scatterpfqpd (__mask, (__v8di) __index,
! 			       __addr, __scale, __hint);
  }
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm512_mask_prefetch_i64scatter_ps (void *__addr, __mmask16 __mask,
! 				    __m512i __index, int __scale, int __hint)
  {
!   __builtin_ia32_scatterpfqps (__mask, (__v8di) __index, __addr,
! 			       __scale, __hint);
  }
  
  #else
  #define _mm512_mask_prefetch_i32gather_pd(INDEX, MASK, ADDR, SCALE, HINT)    \
    __builtin_ia32_gatherpfdpd ((__mmask8)MASK, (__v8si)(__m256i)INDEX,	     \
! 			      (void const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i32gather_ps(INDEX, MASK, ADDR, SCALE, HINT)    \
    __builtin_ia32_gatherpfdps ((__mmask16)MASK, (__v16si)(__m512i)INDEX,      \
! 			      (void const *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i64gather_pd(INDEX, MASK, ADDR, SCALE, HINT)    \
    __builtin_ia32_gatherpfqpd ((__mmask8)MASK, (__v8di)(__m512i)INDEX,	     \
! 			      (void *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i64gather_ps(INDEX, MASK, ADDR, SCALE, HINT)    \
    __builtin_ia32_gatherpfqps ((__mmask8)MASK, (__v8di)(__m512i)INDEX,	     \
! 			      (void *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_prefetch_i32scatter_pd(ADDR, INDEX, SCALE, HINT)              \
    __builtin_ia32_scatterpfdpd ((__mmask8)0xFF, (__v8si)(__m256i)INDEX,       \
! 			       (void *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_prefetch_i32scatter_ps(ADDR, INDEX, SCALE, HINT)              \
    __builtin_ia32_scatterpfdps ((__mmask16)0xFFFF, (__v16si)(__m512i)INDEX,   \
! 			       (void *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i32scatter_pd(ADDR, MASK, INDEX, SCALE, HINT)   \
    __builtin_ia32_scatterpfdpd ((__mmask8)MASK, (__v8si)(__m256i)INDEX,       \
! 			       (void *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i32scatter_ps(ADDR, MASK, INDEX, SCALE, HINT)   \
    __builtin_ia32_scatterpfdps ((__mmask16)MASK, (__v16si)(__m512i)INDEX,     \
! 			       (void *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_prefetch_i64scatter_pd(ADDR, INDEX, SCALE, HINT)              \
    __builtin_ia32_scatterpfqpd ((__mmask8)0xFF, (__v8di)(__m512i)INDEX,	     \
! 			       (void *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_prefetch_i64scatter_ps(ADDR, INDEX, SCALE, HINT)              \
    __builtin_ia32_scatterpfqps ((__mmask8)0xFF, (__v8di)(__m512i)INDEX,	     \
! 			       (void *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i64scatter_pd(ADDR, MASK, INDEX, SCALE, HINT)   \
    __builtin_ia32_scatterpfqpd ((__mmask8)MASK, (__v8di)(__m512i)INDEX,	     \
! 			       (void *)ADDR, (int)SCALE, (int)HINT)
  
  #define _mm512_mask_prefetch_i64scatter_ps(ADDR, MASK, INDEX, SCALE, HINT)   \
    __builtin_ia32_scatterpfqps ((__mmask8)MASK, (__v8di)(__m512i)INDEX,	     \
! 			       (void *)ADDR, (int)SCALE, (int)HINT)
  #endif
  
  #ifdef __DISABLE_AVX512PF__
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512vbmiintrin.h gcc-5.5.0/gcc/config/i386/avx512vbmiintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512vbmiintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512vbmiintrin.h	Mon Aug 22 18:57:37 2016
*************** _mm512_multishift_epi64_epi8 (__m512i __
*** 62,68 ****
    return (__m512i) __builtin_ia32_vpmultishiftqb512_mask ((__v64qi) __X,
  							  (__v64qi) __Y,
  							  (__v64qi)
! 							  _mm512_undefined_si512 (),
  							  (__mmask64) -1);
  }
  
--- 62,68 ----
    return (__m512i) __builtin_ia32_vpmultishiftqb512_mask ((__v64qi) __X,
  							  (__v64qi) __Y,
  							  (__v64qi)
! 							  _mm512_undefined_epi32 (),
  							  (__mmask64) -1);
  }
  
*************** _mm512_permutexvar_epi8 (__m512i __A, __
*** 73,79 ****
    return (__m512i) __builtin_ia32_permvarqi512_mask ((__v64qi) __B,
  						     (__v64qi) __A,
  						     (__v64qi)
! 						     _mm512_undefined_si512 (),
  						     (__mmask64) -1);
  }
  
--- 73,79 ----
    return (__m512i) __builtin_ia32_permvarqi512_mask ((__v64qi) __B,
  						     (__v64qi) __A,
  						     (__v64qi)
! 						     _mm512_undefined_epi32 (),
  						     (__mmask64) -1);
  }
  
*************** _mm512_permutex2var_epi8 (__m512i __A, _
*** 108,115 ****
  							/* idx */ ,
  							(__v64qi) __A,
  							(__v64qi) __B,
! 							(__mmask64) -
! 							1);
  }
  
  extern __inline __m512i
--- 108,114 ----
  							/* idx */ ,
  							(__v64qi) __A,
  							(__v64qi) __B,
! 							(__mmask64) -1);
  }
  
  extern __inline __m512i
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512vbmivlintrin.h gcc-5.5.0/gcc/config/i386/avx512vbmivlintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512vbmivlintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512vbmivlintrin.h	Mon Aug 22 18:57:37 2016
*************** _mm256_permutex2var_epi8 (__m256i __A, _
*** 173,180 ****
  							/* idx */ ,
  							(__v32qi) __A,
  							(__v32qi) __B,
! 							(__mmask32) -
! 							1);
  }
  
  extern __inline __m256i
--- 173,179 ----
  							/* idx */ ,
  							(__v32qi) __A,
  							(__v32qi) __B,
! 							(__mmask32) -1);
  }
  
  extern __inline __m256i
*************** _mm_permutex2var_epi8 (__m128i __A, __m1
*** 224,231 ****
  							/* idx */ ,
  							(__v16qi) __A,
  							(__v16qi) __B,
! 							(__mmask16) -
! 							1);
  }
  
  extern __inline __m128i
--- 223,229 ----
  							/* idx */ ,
  							(__v16qi) __A,
  							(__v16qi) __B,
! 							(__mmask16) -1);
  }
  
  extern __inline __m128i
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512vlbwintrin.h gcc-5.5.0/gcc/config/i386/avx512vlbwintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512vlbwintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512vlbwintrin.h	Mon Aug 22 18:57:37 2016
*************** _mm256_permutex2var_epi16 (__m256i __A,
*** 575,582 ****
  							/* idx */ ,
  							(__v16hi) __A,
  							(__v16hi) __B,
! 							(__mmask16) -
! 							1);
  }
  
  extern __inline __m256i
--- 575,581 ----
  							/* idx */ ,
  							(__v16hi) __A,
  							(__v16hi) __B,
! 							(__mmask16) -1);
  }
  
  extern __inline __m256i
*************** _mm_permutex2var_epi16 (__m128i __A, __m
*** 626,633 ****
  							/* idx */ ,
  							(__v8hi) __A,
  							(__v8hi) __B,
! 							(__mmask8) -
! 							1);
  }
  
  extern __inline __m128i
--- 625,631 ----
  							/* idx */ ,
  							(__v8hi) __A,
  							(__v8hi) __B,
! 							(__mmask8) -1);
  }
  
  extern __inline __m128i
*************** _mm256_cmpneq_epi8_mask (__m256i __X, __
*** 2009,2015 ****
  {
    return (__mmask32) __builtin_ia32_cmpb256_mask ((__v32qi) __X,
  						  (__v32qi) __Y, 4,
! 						  (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 2007,2013 ----
  {
    return (__mmask32) __builtin_ia32_cmpb256_mask ((__v32qi) __X,
  						  (__v32qi) __Y, 4,
! 						  (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm256_cmplt_epi8_mask (__m256i __X, __m
*** 2018,2024 ****
  {
    return (__mmask32) __builtin_ia32_cmpb256_mask ((__v32qi) __X,
  						  (__v32qi) __Y, 1,
! 						  (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 2016,2022 ----
  {
    return (__mmask32) __builtin_ia32_cmpb256_mask ((__v32qi) __X,
  						  (__v32qi) __Y, 1,
! 						  (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm256_cmpge_epi8_mask (__m256i __X, __m
*** 2027,2033 ****
  {
    return (__mmask32) __builtin_ia32_cmpb256_mask ((__v32qi) __X,
  						  (__v32qi) __Y, 5,
! 						  (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 2025,2031 ----
  {
    return (__mmask32) __builtin_ia32_cmpb256_mask ((__v32qi) __X,
  						  (__v32qi) __Y, 5,
! 						  (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm256_cmple_epi8_mask (__m256i __X, __m
*** 2036,2042 ****
  {
    return (__mmask32) __builtin_ia32_cmpb256_mask ((__v32qi) __X,
  						  (__v32qi) __Y, 2,
! 						  (__mmask32) - 1);
  }
  
  extern __inline __mmask16
--- 2034,2040 ----
  {
    return (__mmask32) __builtin_ia32_cmpb256_mask ((__v32qi) __X,
  						  (__v32qi) __Y, 2,
! 						  (__mmask32) -1);
  }
  
  extern __inline __mmask16
*************** _mm256_cmpneq_epi16_mask (__m256i __X, _
*** 2045,2051 ****
  {
    return (__mmask16) __builtin_ia32_cmpw256_mask ((__v16hi) __X,
  						  (__v16hi) __Y, 4,
! 						  (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2043,2049 ----
  {
    return (__mmask16) __builtin_ia32_cmpw256_mask ((__v16hi) __X,
  						  (__v16hi) __Y, 4,
! 						  (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm256_cmplt_epi16_mask (__m256i __X, __
*** 2054,2060 ****
  {
    return (__mmask16) __builtin_ia32_cmpw256_mask ((__v16hi) __X,
  						  (__v16hi) __Y, 1,
! 						  (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2052,2058 ----
  {
    return (__mmask16) __builtin_ia32_cmpw256_mask ((__v16hi) __X,
  						  (__v16hi) __Y, 1,
! 						  (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm256_cmpge_epi16_mask (__m256i __X, __
*** 2063,2069 ****
  {
    return (__mmask16) __builtin_ia32_cmpw256_mask ((__v16hi) __X,
  						  (__v16hi) __Y, 5,
! 						  (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2061,2067 ----
  {
    return (__mmask16) __builtin_ia32_cmpw256_mask ((__v16hi) __X,
  						  (__v16hi) __Y, 5,
! 						  (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm256_cmple_epi16_mask (__m256i __X, __
*** 2072,2078 ****
  {
    return (__mmask16) __builtin_ia32_cmpw256_mask ((__v16hi) __X,
  						  (__v16hi) __Y, 2,
! 						  (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2070,2076 ----
  {
    return (__mmask16) __builtin_ia32_cmpw256_mask ((__v16hi) __X,
  						  (__v16hi) __Y, 2,
! 						  (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm_cmpneq_epu8_mask (__m128i __X, __m12
*** 2081,2087 ****
  {
    return (__mmask16) __builtin_ia32_ucmpb128_mask ((__v16qi) __X,
  						   (__v16qi) __Y, 4,
! 						   (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2079,2085 ----
  {
    return (__mmask16) __builtin_ia32_ucmpb128_mask ((__v16qi) __X,
  						   (__v16qi) __Y, 4,
! 						   (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm_cmplt_epu8_mask (__m128i __X, __m128
*** 2090,2096 ****
  {
    return (__mmask16) __builtin_ia32_ucmpb128_mask ((__v16qi) __X,
  						   (__v16qi) __Y, 1,
! 						   (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2088,2094 ----
  {
    return (__mmask16) __builtin_ia32_ucmpb128_mask ((__v16qi) __X,
  						   (__v16qi) __Y, 1,
! 						   (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm_cmpge_epu8_mask (__m128i __X, __m128
*** 2099,2105 ****
  {
    return (__mmask16) __builtin_ia32_ucmpb128_mask ((__v16qi) __X,
  						   (__v16qi) __Y, 5,
! 						   (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2097,2103 ----
  {
    return (__mmask16) __builtin_ia32_ucmpb128_mask ((__v16qi) __X,
  						   (__v16qi) __Y, 5,
! 						   (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm_cmple_epu8_mask (__m128i __X, __m128
*** 2108,2114 ****
  {
    return (__mmask16) __builtin_ia32_ucmpb128_mask ((__v16qi) __X,
  						   (__v16qi) __Y, 2,
! 						   (__mmask16) - 1);
  }
  
  extern __inline __mmask8
--- 2106,2112 ----
  {
    return (__mmask16) __builtin_ia32_ucmpb128_mask ((__v16qi) __X,
  						   (__v16qi) __Y, 2,
! 						   (__mmask16) -1);
  }
  
  extern __inline __mmask8
*************** _mm_cmpneq_epu16_mask (__m128i __X, __m1
*** 2117,2123 ****
  {
    return (__mmask8) __builtin_ia32_ucmpw128_mask ((__v8hi) __X,
  						  (__v8hi) __Y, 4,
! 						  (__mmask8) - 1);
  }
  
  extern __inline __mmask8
--- 2115,2121 ----
  {
    return (__mmask8) __builtin_ia32_ucmpw128_mask ((__v8hi) __X,
  						  (__v8hi) __Y, 4,
! 						  (__mmask8) -1);
  }
  
  extern __inline __mmask8
*************** _mm_cmplt_epu16_mask (__m128i __X, __m12
*** 2126,2132 ****
  {
    return (__mmask8) __builtin_ia32_ucmpw128_mask ((__v8hi) __X,
  						  (__v8hi) __Y, 1,
! 						  (__mmask8) - 1);
  }
  
  extern __inline __mmask8
--- 2124,2130 ----
  {
    return (__mmask8) __builtin_ia32_ucmpw128_mask ((__v8hi) __X,
  						  (__v8hi) __Y, 1,
! 						  (__mmask8) -1);
  }
  
  extern __inline __mmask8
*************** _mm_cmpge_epu16_mask (__m128i __X, __m12
*** 2135,2141 ****
  {
    return (__mmask8) __builtin_ia32_ucmpw128_mask ((__v8hi) __X,
  						  (__v8hi) __Y, 5,
! 						  (__mmask8) - 1);
  }
  
  extern __inline __mmask8
--- 2133,2139 ----
  {
    return (__mmask8) __builtin_ia32_ucmpw128_mask ((__v8hi) __X,
  						  (__v8hi) __Y, 5,
! 						  (__mmask8) -1);
  }
  
  extern __inline __mmask8
*************** _mm_cmple_epu16_mask (__m128i __X, __m12
*** 2144,2150 ****
  {
    return (__mmask8) __builtin_ia32_ucmpw128_mask ((__v8hi) __X,
  						  (__v8hi) __Y, 2,
! 						  (__mmask8) - 1);
  }
  
  extern __inline __mmask16
--- 2142,2148 ----
  {
    return (__mmask8) __builtin_ia32_ucmpw128_mask ((__v8hi) __X,
  						  (__v8hi) __Y, 2,
! 						  (__mmask8) -1);
  }
  
  extern __inline __mmask16
*************** _mm_cmpneq_epi8_mask (__m128i __X, __m12
*** 2153,2159 ****
  {
    return (__mmask16) __builtin_ia32_cmpb128_mask ((__v16qi) __X,
  						  (__v16qi) __Y, 4,
! 						  (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2151,2157 ----
  {
    return (__mmask16) __builtin_ia32_cmpb128_mask ((__v16qi) __X,
  						  (__v16qi) __Y, 4,
! 						  (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm_cmplt_epi8_mask (__m128i __X, __m128
*** 2162,2168 ****
  {
    return (__mmask16) __builtin_ia32_cmpb128_mask ((__v16qi) __X,
  						  (__v16qi) __Y, 1,
! 						  (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2160,2166 ----
  {
    return (__mmask16) __builtin_ia32_cmpb128_mask ((__v16qi) __X,
  						  (__v16qi) __Y, 1,
! 						  (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm_cmpge_epi8_mask (__m128i __X, __m128
*** 2171,2177 ****
  {
    return (__mmask16) __builtin_ia32_cmpb128_mask ((__v16qi) __X,
  						  (__v16qi) __Y, 5,
! 						  (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 2169,2175 ----
  {
    return (__mmask16) __builtin_ia32_cmpb128_mask ((__v16qi) __X,
  						  (__v16qi) __Y, 5,
! 						  (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm_cmple_epi8_mask (__m128i __X, __m128
*** 2180,2186 ****
  {
    return (__mmask16) __builtin_ia32_cmpb128_mask ((__v16qi) __X,
  						  (__v16qi) __Y, 2,
! 						  (__mmask16) - 1);
  }
  
  extern __inline __mmask8
--- 2178,2184 ----
  {
    return (__mmask16) __builtin_ia32_cmpb128_mask ((__v16qi) __X,
  						  (__v16qi) __Y, 2,
! 						  (__mmask16) -1);
  }
  
  extern __inline __mmask8
*************** _mm_cmpneq_epi16_mask (__m128i __X, __m1
*** 2189,2195 ****
  {
    return (__mmask8) __builtin_ia32_cmpw128_mask ((__v8hi) __X,
  						 (__v8hi) __Y, 4,
! 						 (__mmask8) - 1);
  }
  
  extern __inline __mmask8
--- 2187,2193 ----
  {
    return (__mmask8) __builtin_ia32_cmpw128_mask ((__v8hi) __X,
  						 (__v8hi) __Y, 4,
! 						 (__mmask8) -1);
  }
  
  extern __inline __mmask8
*************** _mm_cmplt_epi16_mask (__m128i __X, __m12
*** 2198,2204 ****
  {
    return (__mmask8) __builtin_ia32_cmpw128_mask ((__v8hi) __X,
  						 (__v8hi) __Y, 1,
! 						 (__mmask8) - 1);
  }
  
  extern __inline __mmask8
--- 2196,2202 ----
  {
    return (__mmask8) __builtin_ia32_cmpw128_mask ((__v8hi) __X,
  						 (__v8hi) __Y, 1,
! 						 (__mmask8) -1);
  }
  
  extern __inline __mmask8
*************** _mm_cmpge_epi16_mask (__m128i __X, __m12
*** 2207,2213 ****
  {
    return (__mmask8) __builtin_ia32_cmpw128_mask ((__v8hi) __X,
  						 (__v8hi) __Y, 5,
! 						 (__mmask8) - 1);
  }
  
  extern __inline __mmask8
--- 2205,2211 ----
  {
    return (__mmask8) __builtin_ia32_cmpw128_mask ((__v8hi) __X,
  						 (__v8hi) __Y, 5,
! 						 (__mmask8) -1);
  }
  
  extern __inline __mmask8
*************** _mm_cmple_epi16_mask (__m128i __X, __m12
*** 2216,2222 ****
  {
    return (__mmask8) __builtin_ia32_cmpw128_mask ((__v8hi) __X,
  						 (__v8hi) __Y, 2,
! 						 (__mmask8) - 1);
  }
  
  extern __inline __m256i
--- 2214,2220 ----
  {
    return (__mmask8) __builtin_ia32_cmpw128_mask ((__v8hi) __X,
  						 (__v8hi) __Y, 2,
! 						 (__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm256_cmpneq_epu8_mask (__m256i __X, __
*** 3609,3615 ****
  {
    return (__mmask32) __builtin_ia32_ucmpb256_mask ((__v32qi) __X,
  						   (__v32qi) __Y, 4,
! 						   (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 3607,3613 ----
  {
    return (__mmask32) __builtin_ia32_ucmpb256_mask ((__v32qi) __X,
  						   (__v32qi) __Y, 4,
! 						   (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm256_cmplt_epu8_mask (__m256i __X, __m
*** 3618,3624 ****
  {
    return (__mmask32) __builtin_ia32_ucmpb256_mask ((__v32qi) __X,
  						   (__v32qi) __Y, 1,
! 						   (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 3616,3622 ----
  {
    return (__mmask32) __builtin_ia32_ucmpb256_mask ((__v32qi) __X,
  						   (__v32qi) __Y, 1,
! 						   (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm256_cmpge_epu8_mask (__m256i __X, __m
*** 3627,3633 ****
  {
    return (__mmask32) __builtin_ia32_ucmpb256_mask ((__v32qi) __X,
  						   (__v32qi) __Y, 5,
! 						   (__mmask32) - 1);
  }
  
  extern __inline __mmask32
--- 3625,3631 ----
  {
    return (__mmask32) __builtin_ia32_ucmpb256_mask ((__v32qi) __X,
  						   (__v32qi) __Y, 5,
! 						   (__mmask32) -1);
  }
  
  extern __inline __mmask32
*************** _mm256_cmple_epu8_mask (__m256i __X, __m
*** 3636,3642 ****
  {
    return (__mmask32) __builtin_ia32_ucmpb256_mask ((__v32qi) __X,
  						   (__v32qi) __Y, 2,
! 						   (__mmask32) - 1);
  }
  
  extern __inline __mmask16
--- 3634,3640 ----
  {
    return (__mmask32) __builtin_ia32_ucmpb256_mask ((__v32qi) __X,
  						   (__v32qi) __Y, 2,
! 						   (__mmask32) -1);
  }
  
  extern __inline __mmask16
*************** _mm256_cmpneq_epu16_mask (__m256i __X, _
*** 3645,3651 ****
  {
    return (__mmask16) __builtin_ia32_ucmpw256_mask ((__v16hi) __X,
  						   (__v16hi) __Y, 4,
! 						   (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 3643,3649 ----
  {
    return (__mmask16) __builtin_ia32_ucmpw256_mask ((__v16hi) __X,
  						   (__v16hi) __Y, 4,
! 						   (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm256_cmplt_epu16_mask (__m256i __X, __
*** 3654,3660 ****
  {
    return (__mmask16) __builtin_ia32_ucmpw256_mask ((__v16hi) __X,
  						   (__v16hi) __Y, 1,
! 						   (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 3652,3658 ----
  {
    return (__mmask16) __builtin_ia32_ucmpw256_mask ((__v16hi) __X,
  						   (__v16hi) __Y, 1,
! 						   (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm256_cmpge_epu16_mask (__m256i __X, __
*** 3663,3669 ****
  {
    return (__mmask16) __builtin_ia32_ucmpw256_mask ((__v16hi) __X,
  						   (__v16hi) __Y, 5,
! 						   (__mmask16) - 1);
  }
  
  extern __inline __mmask16
--- 3661,3667 ----
  {
    return (__mmask16) __builtin_ia32_ucmpw256_mask ((__v16hi) __X,
  						   (__v16hi) __Y, 5,
! 						   (__mmask16) -1);
  }
  
  extern __inline __mmask16
*************** _mm256_cmple_epu16_mask (__m256i __X, __
*** 3672,3678 ****
  {
    return (__mmask16) __builtin_ia32_ucmpw256_mask ((__v16hi) __X,
  						   (__v16hi) __Y, 2,
! 						   (__mmask16) - 1);
  }
  
  extern __inline void
--- 3670,3676 ----
  {
    return (__mmask16) __builtin_ia32_ucmpw256_mask ((__v16hi) __X,
  						   (__v16hi) __Y, 2,
! 						   (__mmask16) -1);
  }
  
  extern __inline void
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512vldqintrin.h gcc-5.5.0/gcc/config/i386/avx512vldqintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512vldqintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512vldqintrin.h	Mon Aug 22 18:57:37 2016
*************** _mm256_broadcast_f64x2 (__m128d __A)
*** 389,396 ****
    return (__m256d) __builtin_ia32_broadcastf64x2_256_mask ((__v2df)
  							   __A,
  						           (__v4df)_mm256_undefined_pd(),
! 							   (__mmask8) -
! 							   1);
  }
  
  extern __inline __m256d
--- 389,395 ----
    return (__m256d) __builtin_ia32_broadcastf64x2_256_mask ((__v2df)
  							   __A,
  						           (__v4df)_mm256_undefined_pd(),
! 							   (__mmask8) -1);
  }
  
  extern __inline __m256d
*************** _mm256_broadcast_i64x2 (__m128i __A)
*** 421,428 ****
    return (__m256i) __builtin_ia32_broadcasti64x2_256_mask ((__v2di)
  							   __A,
  						           (__v4di)_mm256_undefined_si256(),
! 							   (__mmask8) -
! 							   1);
  }
  
  extern __inline __m256i
--- 420,426 ----
    return (__m256i) __builtin_ia32_broadcasti64x2_256_mask ((__v2di)
  							   __A,
  						           (__v4di)_mm256_undefined_si256(),
! 							   (__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm256_broadcast_f32x2 (__m128 __A)
*** 452,459 ****
  {
    return (__m256) __builtin_ia32_broadcastf32x2_256_mask ((__v4sf) __A,
  						          (__v8sf)_mm256_undefined_ps(),
! 							  (__mmask8) -
! 							  1);
  }
  
  extern __inline __m256
--- 450,456 ----
  {
    return (__m256) __builtin_ia32_broadcastf32x2_256_mask ((__v4sf) __A,
  						          (__v8sf)_mm256_undefined_ps(),
! 							  (__mmask8) -1);
  }
  
  extern __inline __m256
*************** _mm256_broadcast_i32x2 (__m128i __A)
*** 482,489 ****
    return (__m256i) __builtin_ia32_broadcasti32x2_256_mask ((__v4si)
  							   __A,
  						          (__v8si)_mm256_undefined_si256(),
! 							   (__mmask8) -
! 							   1);
  }
  
  extern __inline __m256i
--- 479,485 ----
    return (__m256i) __builtin_ia32_broadcasti32x2_256_mask ((__v4si)
  							   __A,
  						          (__v8si)_mm256_undefined_si256(),
! 							   (__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm_broadcast_i32x2 (__m128i __A)
*** 514,521 ****
    return (__m128i) __builtin_ia32_broadcasti32x2_128_mask ((__v4si)
  							   __A,
  						          (__v4si)_mm_undefined_si128(),
! 							   (__mmask8) -
! 							   1);
  }
  
  extern __inline __m128i
--- 510,516 ----
    return (__m128i) __builtin_ia32_broadcasti32x2_128_mask ((__v4si)
  							   __A,
  						          (__v4si)_mm_undefined_si128(),
! 							   (__mmask8) -1);
  }
  
  extern __inline __m128i
*************** _mm256_extractf64x2_pd (__m256d __A, con
*** 1351,1358 ****
  							 __imm,
  							 (__v2df)
  							 _mm_setzero_pd (),
! 							 (__mmask8) -
! 							 1);
  }
  
  extern __inline __m128d
--- 1346,1352 ----
  							 __imm,
  							 (__v2df)
  							 _mm_setzero_pd (),
! 							 (__mmask8) -1);
  }
  
  extern __inline __m128d
*************** _mm256_extracti64x2_epi64 (__m256i __A,
*** 1388,1395 ****
  							 __imm,
  							 (__v2di)
  							 _mm_setzero_di (),
! 							 (__mmask8) -
! 							 1);
  }
  
  extern __inline __m128i
--- 1382,1388 ----
  							 __imm,
  							 (__v2di)
  							 _mm_setzero_di (),
! 							 (__mmask8) -1);
  }
  
  extern __inline __m128i
*************** _mm256_inserti64x2 (__m256i __A, __m128i
*** 1743,1750 ****
  							__imm,
  							(__v4di)
  							_mm256_setzero_si256 (),
! 							(__mmask8) -
! 							1);
  }
  
  extern __inline __m256i
--- 1736,1742 ----
  							__imm,
  							(__v4di)
  							_mm256_setzero_si256 (),
! 							(__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm256_insertf64x2 (__m256d __A, __m128d
*** 1783,1790 ****
  							__imm,
  							(__v4df)
  							_mm256_setzero_pd (),
! 							(__mmask8) -
! 							1);
  }
  
  extern __inline __m256d
--- 1775,1781 ----
  							__imm,
  							(__v4df)
  							_mm256_setzero_pd (),
! 							(__mmask8) -1);
  }
  
  extern __inline __m256d
diff -Nrcpad gcc-5.4.0/gcc/config/i386/avx512vlintrin.h gcc-5.5.0/gcc/config/i386/avx512vlintrin.h
*** gcc-5.4.0/gcc/config/i386/avx512vlintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/avx512vlintrin.h	Thu Jun  1 21:51:51 2017
*************** _mm256_broadcast_f32x4 (__m128 __A)
*** 2698,2705 ****
  {
    return (__m256) __builtin_ia32_broadcastf32x4_256_mask ((__v4sf) __A,
  						          (__v8sf)_mm256_undefined_pd (),
! 							  (__mmask8) -
! 							  1);
  }
  
  extern __inline __m256
--- 2698,2704 ----
  {
    return (__m256) __builtin_ia32_broadcastf32x4_256_mask ((__v4sf) __A,
  						          (__v8sf)_mm256_undefined_pd (),
! 							  (__mmask8) -1);
  }
  
  extern __inline __m256
*************** _mm256_broadcast_i32x4 (__m128i __A)
*** 2728,2735 ****
    return (__m256i) __builtin_ia32_broadcasti32x4_256_mask ((__v4si)
  							   __A,
  						           (__v8si)_mm256_undefined_si256 (),
! 							   (__mmask8) -
! 							   1);
  }
  
  extern __inline __m256i
--- 2727,2733 ----
    return (__m256i) __builtin_ia32_broadcasti32x4_256_mask ((__v4si)
  							   __A,
  						           (__v8si)_mm256_undefined_si256 (),
! 							   (__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm256_permutex2var_pd (__m256d __A, __m
*** 6293,6300 ****
  							/* idx */ ,
  							(__v4df) __A,
  							(__v4df) __B,
! 							(__mmask8) -
! 							1);
  }
  
  extern __inline __m256d
--- 6291,6297 ----
  							/* idx */ ,
  							(__v4df) __A,
  							(__v4df) __B,
! 							(__mmask8) -1);
  }
  
  extern __inline __m256d
*************** _mm_permutex2var_pd (__m128d __A, __m128
*** 6584,6591 ****
  							/* idx */ ,
  							(__v2df) __A,
  							(__v2df) __B,
! 							(__mmask8) -
! 							1);
  }
  
  extern __inline __m128d
--- 6581,6587 ----
  							/* idx */ ,
  							(__v2df) __A,
  							(__v2df) __B,
! 							(__mmask8) -1);
  }
  
  extern __inline __m128d
*************** _mm256_conflict_epi64 (__m256i __A)
*** 8259,8266 ****
    return (__m256i) __builtin_ia32_vpconflictdi_256_mask ((__v4di) __A,
  							 (__v4di)
  							 _mm256_setzero_si256 (),
! 							 (__mmask8) -
! 							 1);
  }
  
  extern __inline __m256i
--- 8255,8261 ----
    return (__m256i) __builtin_ia32_vpconflictdi_256_mask ((__v4di) __A,
  							 (__v4di)
  							 _mm256_setzero_si256 (),
! 							 (__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm256_conflict_epi32 (__m256i __A)
*** 8291,8298 ****
    return (__m256i) __builtin_ia32_vpconflictsi_256_mask ((__v8si) __A,
  							 (__v8si)
  							 _mm256_setzero_si256 (),
! 							 (__mmask8) -
! 							 1);
  }
  
  extern __inline __m256i
--- 8286,8292 ----
    return (__m256i) __builtin_ia32_vpconflictsi_256_mask ((__v8si) __A,
  							 (__v8si)
  							 _mm256_setzero_si256 (),
! 							 (__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm_conflict_epi64 (__m128i __A)
*** 8381,8388 ****
    return (__m128i) __builtin_ia32_vpconflictdi_128_mask ((__v2di) __A,
  							 (__v2di)
  							 _mm_setzero_di (),
! 							 (__mmask8) -
! 							 1);
  }
  
  extern __inline __m128i
--- 8375,8381 ----
    return (__m128i) __builtin_ia32_vpconflictdi_128_mask ((__v2di) __A,
  							 (__v2di)
  							 _mm_setzero_di (),
! 							 (__mmask8) -1);
  }
  
  extern __inline __m128i
*************** _mm_conflict_epi32 (__m128i __A)
*** 8413,8420 ****
    return (__m128i) __builtin_ia32_vpconflictsi_128_mask ((__v4si) __A,
  							 (__v4si)
  							 _mm_setzero_si128 (),
! 							 (__mmask8) -
! 							 1);
  }
  
  extern __inline __m128i
--- 8406,8412 ----
    return (__m128i) __builtin_ia32_vpconflictsi_128_mask ((__v4si) __A,
  							 (__v4si)
  							 _mm_setzero_si128 (),
! 							 (__mmask8) -1);
  }
  
  extern __inline __m128i
*************** _mm256_mask_permutexvar_epi32 (__m256i _
*** 9167,9172 ****
--- 9159,9740 ----
  						     __M);
  }
  
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmpneq_epu32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
+ 						  (__v8si) __Y, 4,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmpneq_epu32_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
+ 						  (__v8si) __Y, 4,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmplt_epu32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
+ 						  (__v8si) __Y, 1,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmplt_epu32_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
+ 						  (__v8si) __Y, 1,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmpge_epu32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
+ 						  (__v8si) __Y, 5,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmpge_epu32_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
+ 						  (__v8si) __Y, 5,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmple_epu32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
+ 						  (__v8si) __Y, 2,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmple_epu32_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
+ 						  (__v8si) __Y, 2,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmpneq_epu64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
+ 						  (__v4di) __Y, 4,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmpneq_epu64_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
+ 						  (__v4di) __Y, 4,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmplt_epu64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
+ 						  (__v4di) __Y, 1,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmplt_epu64_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
+ 						  (__v4di) __Y, 1,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmpge_epu64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
+ 						  (__v4di) __Y, 5,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmpge_epu64_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
+ 						  (__v4di) __Y, 5,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmple_epu64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
+ 						  (__v4di) __Y, 2,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmple_epu64_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
+ 						  (__v4di) __Y, 2,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmpneq_epi32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
+ 						 (__v8si) __Y, 4,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmpneq_epi32_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
+ 						 (__v8si) __Y, 4,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmplt_epi32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
+ 						 (__v8si) __Y, 1,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmplt_epi32_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
+ 						 (__v8si) __Y, 1,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmpge_epi32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
+ 						 (__v8si) __Y, 5,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmpge_epi32_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
+ 						 (__v8si) __Y, 5,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmple_epi32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
+ 						 (__v8si) __Y, 2,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmple_epi32_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
+ 						 (__v8si) __Y, 2,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmpneq_epi64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
+ 						 (__v4di) __Y, 4,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmpneq_epi64_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
+ 						 (__v4di) __Y, 4,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmplt_epi64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
+ 						 (__v4di) __Y, 1,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmplt_epi64_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
+ 						 (__v4di) __Y, 1,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmpge_epi64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
+ 						 (__v4di) __Y, 5,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmpge_epi64_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
+ 						 (__v4di) __Y, 5,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_mask_cmple_epi64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
+ 						 (__v4di) __Y, 2,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm256_cmple_epi64_mask (__m256i __X, __m256i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
+ 						 (__v4di) __Y, 2,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmpneq_epu32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
+ 						  (__v4si) __Y, 4,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmpneq_epu32_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
+ 						  (__v4si) __Y, 4,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmplt_epu32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
+ 						  (__v4si) __Y, 1,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmplt_epu32_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
+ 						  (__v4si) __Y, 1,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmpge_epu32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
+ 						  (__v4si) __Y, 5,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmpge_epu32_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
+ 						  (__v4si) __Y, 5,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmple_epu32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
+ 						  (__v4si) __Y, 2,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmple_epu32_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
+ 						  (__v4si) __Y, 2,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmpneq_epu64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
+ 						  (__v2di) __Y, 4,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmpneq_epu64_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
+ 						  (__v2di) __Y, 4,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmplt_epu64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
+ 						  (__v2di) __Y, 1,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmplt_epu64_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
+ 						  (__v2di) __Y, 1,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmpge_epu64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
+ 						  (__v2di) __Y, 5,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmpge_epu64_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
+ 						  (__v2di) __Y, 5,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmple_epu64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
+ 						  (__v2di) __Y, 2,
+ 						  (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmple_epu64_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
+ 						  (__v2di) __Y, 2,
+ 						  (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmpneq_epi32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
+ 						 (__v4si) __Y, 4,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmpneq_epi32_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
+ 						 (__v4si) __Y, 4,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmplt_epi32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
+ 						 (__v4si) __Y, 1,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmplt_epi32_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
+ 						 (__v4si) __Y, 1,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmpge_epi32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
+ 						 (__v4si) __Y, 5,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmpge_epi32_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
+ 						 (__v4si) __Y, 5,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmple_epi32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
+ 						 (__v4si) __Y, 2,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmple_epi32_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
+ 						 (__v4si) __Y, 2,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmpneq_epi64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
+ 						 (__v2di) __Y, 4,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmpneq_epi64_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
+ 						 (__v2di) __Y, 4,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmplt_epi64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
+ 						 (__v2di) __Y, 1,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmplt_epi64_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
+ 						 (__v2di) __Y, 1,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmpge_epi64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
+ 						 (__v2di) __Y, 5,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmpge_epi64_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
+ 						 (__v2di) __Y, 5,
+ 						 (__mmask8) -1);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_mask_cmple_epi64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
+ 						 (__v2di) __Y, 2,
+ 						 (__mmask8) __M);
+ }
+ 
+ extern __inline __mmask8
+   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm_cmple_epi64_mask (__m128i __X, __m128i __Y)
+ {
+   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
+ 						 (__v2di) __Y, 2,
+ 						 (__mmask8) -1);
+ }
+ 
  #ifdef __OPTIMIZE__
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
*************** _mm256_inserti32x4 (__m256i __A, __m128i
*** 9291,9298 ****
  							__imm,
  							(__v8si)
  							_mm256_setzero_si256 (),
! 							(__mmask8) -
! 							1);
  }
  
  extern __inline __m256i
--- 9859,9865 ----
  							__imm,
  							(__v8si)
  							_mm256_setzero_si256 (),
! 							(__mmask8) -1);
  }
  
  extern __inline __m256i
*************** _mm256_extracti32x4_epi32 (__m256i __A,
*** 9367,9374 ****
  							 __imm,
  							 (__v4si)
  							 _mm_setzero_si128 (),
! 							 (__mmask8) -
! 							 1);
  }
  
  extern __inline __m128i
--- 9934,9940 ----
  							 __imm,
  							 (__v4si)
  							 _mm_setzero_si128 (),
! 							 (__mmask8) -1);
  }
  
  extern __inline __m128i
*************** _mm256_extractf32x4_ps (__m256 __A, cons
*** 9404,9411 ****
  							__imm,
  							(__v4sf)
  							_mm_setzero_ps (),
! 							(__mmask8) -
! 							1);
  }
  
  extern __inline __m128
--- 9970,9976 ----
  							__imm,
  							(__v4sf)
  							_mm_setzero_ps (),
! 							(__mmask8) -1);
  }
  
  extern __inline __m128
*************** _mm_maskz_srli_epi64 (__mmask8 __U, __m1
*** 9807,9817 ****
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_ternarylogic_epi64 (__m256i __A, __m256i __B, __m256i __C,
! 			   const int imm)
  {
    return (__m256i) __builtin_ia32_pternlogq256_mask ((__v4di) __A,
  						     (__v4di) __B,
! 						     (__v4di) __C, imm,
  						     (__mmask8) -1);
  }
  
--- 10372,10382 ----
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_ternarylogic_epi64 (__m256i __A, __m256i __B, __m256i __C,
! 			   const int __imm)
  {
    return (__m256i) __builtin_ia32_pternlogq256_mask ((__v4di) __A,
  						     (__v4di) __B,
! 						     (__v4di) __C, __imm,
  						     (__mmask8) -1);
  }
  
*************** extern __inline __m256i
*** 9819,9829 ****
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mask_ternarylogic_epi64 (__m256i __A, __mmask8 __U,
  				__m256i __B, __m256i __C,
! 				const int imm)
  {
    return (__m256i) __builtin_ia32_pternlogq256_mask ((__v4di) __A,
  						     (__v4di) __B,
! 						     (__v4di) __C, imm,
  						     (__mmask8) __U);
  }
  
--- 10384,10394 ----
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mask_ternarylogic_epi64 (__m256i __A, __mmask8 __U,
  				__m256i __B, __m256i __C,
! 				const int __imm)
  {
    return (__m256i) __builtin_ia32_pternlogq256_mask ((__v4di) __A,
  						     (__v4di) __B,
! 						     (__v4di) __C, __imm,
  						     (__mmask8) __U);
  }
  
*************** extern __inline __m256i
*** 9831,9853 ****
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_maskz_ternarylogic_epi64 (__mmask8 __U, __m256i __A,
  				 __m256i __B, __m256i __C,
! 				 const int imm)
  {
    return (__m256i) __builtin_ia32_pternlogq256_maskz ((__v4di) __A,
  						      (__v4di) __B,
  						      (__v4di) __C,
! 						      imm,
  						      (__mmask8) __U);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_ternarylogic_epi32 (__m256i __A, __m256i __B, __m256i __C,
! 			   const int imm)
  {
    return (__m256i) __builtin_ia32_pternlogd256_mask ((__v8si) __A,
  						     (__v8si) __B,
! 						     (__v8si) __C, imm,
  						     (__mmask8) -1);
  }
  
--- 10396,10418 ----
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_maskz_ternarylogic_epi64 (__mmask8 __U, __m256i __A,
  				 __m256i __B, __m256i __C,
! 				 const int __imm)
  {
    return (__m256i) __builtin_ia32_pternlogq256_maskz ((__v4di) __A,
  						      (__v4di) __B,
  						      (__v4di) __C,
! 						      __imm,
  						      (__mmask8) __U);
  }
  
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_ternarylogic_epi32 (__m256i __A, __m256i __B, __m256i __C,
! 			   const int __imm)
  {
    return (__m256i) __builtin_ia32_pternlogd256_mask ((__v8si) __A,
  						     (__v8si) __B,
! 						     (__v8si) __C, __imm,
  						     (__mmask8) -1);
  }
  
*************** extern __inline __m256i
*** 9855,9865 ****
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mask_ternarylogic_epi32 (__m256i __A, __mmask8 __U,
  				__m256i __B, __m256i __C,
! 				const int imm)
  {
    return (__m256i) __builtin_ia32_pternlogd256_mask ((__v8si) __A,
  						     (__v8si) __B,
! 						     (__v8si) __C, imm,
  						     (__mmask8) __U);
  }
  
--- 10420,10430 ----
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mask_ternarylogic_epi32 (__m256i __A, __mmask8 __U,
  				__m256i __B, __m256i __C,
! 				const int __imm)
  {
    return (__m256i) __builtin_ia32_pternlogd256_mask ((__v8si) __A,
  						     (__v8si) __B,
! 						     (__v8si) __C, __imm,
  						     (__mmask8) __U);
  }
  
*************** extern __inline __m256i
*** 9867,9946 ****
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_maskz_ternarylogic_epi32 (__mmask8 __U, __m256i __A,
  				 __m256i __B, __m256i __C,
! 				 const int imm)
  {
    return (__m256i) __builtin_ia32_pternlogd256_maskz ((__v8si) __A,
  						      (__v8si) __B,
  						      (__v8si) __C,
! 						      imm,
  						      (__mmask8) __U);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_ternarylogic_epi64 (__m128i __A, __m128i __B, __m128i __C,
! 			const int imm)
  {
    return (__m128i) __builtin_ia32_pternlogq128_mask ((__v2di) __A,
  						     (__v2di) __B,
! 						     (__v2di) __C, imm,
  						     (__mmask8) -1);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mask_ternarylogic_epi64 (__m128i __A, __mmask8 __U,
! 			     __m128i __B, __m128i __C, const int imm)
  {
    return (__m128i) __builtin_ia32_pternlogq128_mask ((__v2di) __A,
  						     (__v2di) __B,
! 						     (__v2di) __C, imm,
  						     (__mmask8) __U);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_maskz_ternarylogic_epi64 (__mmask8 __U, __m128i __A,
! 			      __m128i __B, __m128i __C, const int imm)
  {
    return (__m128i) __builtin_ia32_pternlogq128_maskz ((__v2di) __A,
  						      (__v2di) __B,
  						      (__v2di) __C,
! 						      imm,
  						      (__mmask8) __U);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_ternarylogic_epi32 (__m128i __A, __m128i __B, __m128i __C,
! 			const int imm)
  {
    return (__m128i) __builtin_ia32_pternlogd128_mask ((__v4si) __A,
  						     (__v4si) __B,
! 						     (__v4si) __C, imm,
  						     (__mmask8) -1);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mask_ternarylogic_epi32 (__m128i __A, __mmask8 __U,
! 			     __m128i __B, __m128i __C, const int imm)
  {
    return (__m128i) __builtin_ia32_pternlogd128_mask ((__v4si) __A,
  						     (__v4si) __B,
! 						     (__v4si) __C, imm,
  						     (__mmask8) __U);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_maskz_ternarylogic_epi32 (__mmask8 __U, __m128i __A,
! 			      __m128i __B, __m128i __C, const int imm)
  {
    return (__m128i) __builtin_ia32_pternlogd128_maskz ((__v4si) __A,
  						      (__v4si) __B,
  						      (__v4si) __C,
! 						      imm,
  						      (__mmask8) __U);
  }
  
--- 10432,10511 ----
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_maskz_ternarylogic_epi32 (__mmask8 __U, __m256i __A,
  				 __m256i __B, __m256i __C,
! 				 const int __imm)
  {
    return (__m256i) __builtin_ia32_pternlogd256_maskz ((__v8si) __A,
  						      (__v8si) __B,
  						      (__v8si) __C,
! 						      __imm,
  						      (__mmask8) __U);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_ternarylogic_epi64 (__m128i __A, __m128i __B, __m128i __C,
! 			const int __imm)
  {
    return (__m128i) __builtin_ia32_pternlogq128_mask ((__v2di) __A,
  						     (__v2di) __B,
! 						     (__v2di) __C, __imm,
  						     (__mmask8) -1);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mask_ternarylogic_epi64 (__m128i __A, __mmask8 __U,
! 			     __m128i __B, __m128i __C, const int __imm)
  {
    return (__m128i) __builtin_ia32_pternlogq128_mask ((__v2di) __A,
  						     (__v2di) __B,
! 						     (__v2di) __C, __imm,
  						     (__mmask8) __U);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_maskz_ternarylogic_epi64 (__mmask8 __U, __m128i __A,
! 			      __m128i __B, __m128i __C, const int __imm)
  {
    return (__m128i) __builtin_ia32_pternlogq128_maskz ((__v2di) __A,
  						      (__v2di) __B,
  						      (__v2di) __C,
! 						      __imm,
  						      (__mmask8) __U);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_ternarylogic_epi32 (__m128i __A, __m128i __B, __m128i __C,
! 			const int __imm)
  {
    return (__m128i) __builtin_ia32_pternlogd128_mask ((__v4si) __A,
  						     (__v4si) __B,
! 						     (__v4si) __C, __imm,
  						     (__mmask8) -1);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mask_ternarylogic_epi32 (__m128i __A, __mmask8 __U,
! 			     __m128i __B, __m128i __C, const int __imm)
  {
    return (__m128i) __builtin_ia32_pternlogd128_mask ((__v4si) __A,
  						     (__v4si) __B,
! 						     (__v4si) __C, __imm,
  						     (__mmask8) __U);
  }
  
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_maskz_ternarylogic_epi32 (__mmask8 __U, __m128i __A,
! 			      __m128i __B, __m128i __C, const int __imm)
  {
    return (__m128i) __builtin_ia32_pternlogd128_maskz ((__v4si) __A,
  						      (__v4si) __B,
  						      (__v4si) __C,
! 						      __imm,
  						      (__mmask8) __U);
  }
  
*************** _mm_maskz_getmant_pd (__mmask8 __U, __m1
*** 10227,10233 ****
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i32gather_ps (__m256 __v1_old, __mmask8 __mask,
! 			   __m256i __index, float const *__addr,
  			   int __scale)
  {
    return (__m256) __builtin_ia32_gather3siv8sf ((__v8sf) __v1_old,
--- 10792,10798 ----
  extern __inline __m256
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i32gather_ps (__m256 __v1_old, __mmask8 __mask,
! 			   __m256i __index, void const *__addr,
  			   int __scale)
  {
    return (__m256) __builtin_ia32_gather3siv8sf ((__v8sf) __v1_old,
*************** _mm256_mmask_i32gather_ps (__m256 __v1_o
*** 10239,10245 ****
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i32gather_ps (__m128 __v1_old, __mmask8 __mask,
! 			__m128i __index, float const *__addr,
  			int __scale)
  {
    return (__m128) __builtin_ia32_gather3siv4sf ((__v4sf) __v1_old,
--- 10804,10810 ----
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i32gather_ps (__m128 __v1_old, __mmask8 __mask,
! 			__m128i __index, void const *__addr,
  			int __scale)
  {
    return (__m128) __builtin_ia32_gather3siv4sf ((__v4sf) __v1_old,
*************** _mm_mmask_i32gather_ps (__m128 __v1_old,
*** 10251,10257 ****
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i32gather_pd (__m256d __v1_old, __mmask8 __mask,
! 			   __m128i __index, double const *__addr,
  			   int __scale)
  {
    return (__m256d) __builtin_ia32_gather3siv4df ((__v4df) __v1_old,
--- 10816,10822 ----
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i32gather_pd (__m256d __v1_old, __mmask8 __mask,
! 			   __m128i __index, void const *__addr,
  			   int __scale)
  {
    return (__m256d) __builtin_ia32_gather3siv4df ((__v4df) __v1_old,
*************** _mm256_mmask_i32gather_pd (__m256d __v1_
*** 10263,10269 ****
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i32gather_pd (__m128d __v1_old, __mmask8 __mask,
! 			__m128i __index, double const *__addr,
  			int __scale)
  {
    return (__m128d) __builtin_ia32_gather3siv2df ((__v2df) __v1_old,
--- 10828,10834 ----
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i32gather_pd (__m128d __v1_old, __mmask8 __mask,
! 			__m128i __index, void const *__addr,
  			int __scale)
  {
    return (__m128d) __builtin_ia32_gather3siv2df ((__v2df) __v1_old,
*************** _mm_mmask_i32gather_pd (__m128d __v1_old
*** 10275,10281 ****
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i64gather_ps (__m128 __v1_old, __mmask8 __mask,
! 			   __m256i __index, float const *__addr,
  			   int __scale)
  {
    return (__m128) __builtin_ia32_gather3div8sf ((__v4sf) __v1_old,
--- 10840,10846 ----
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i64gather_ps (__m128 __v1_old, __mmask8 __mask,
! 			   __m256i __index, void const *__addr,
  			   int __scale)
  {
    return (__m128) __builtin_ia32_gather3div8sf ((__v4sf) __v1_old,
*************** _mm256_mmask_i64gather_ps (__m128 __v1_o
*** 10287,10293 ****
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i64gather_ps (__m128 __v1_old, __mmask8 __mask,
! 			__m128i __index, float const *__addr,
  			int __scale)
  {
    return (__m128) __builtin_ia32_gather3div4sf ((__v4sf) __v1_old,
--- 10852,10858 ----
  extern __inline __m128
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i64gather_ps (__m128 __v1_old, __mmask8 __mask,
! 			__m128i __index, void const *__addr,
  			int __scale)
  {
    return (__m128) __builtin_ia32_gather3div4sf ((__v4sf) __v1_old,
*************** _mm_mmask_i64gather_ps (__m128 __v1_old,
*** 10299,10305 ****
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i64gather_pd (__m256d __v1_old, __mmask8 __mask,
! 			   __m256i __index, double const *__addr,
  			   int __scale)
  {
    return (__m256d) __builtin_ia32_gather3div4df ((__v4df) __v1_old,
--- 10864,10870 ----
  extern __inline __m256d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i64gather_pd (__m256d __v1_old, __mmask8 __mask,
! 			   __m256i __index, void const *__addr,
  			   int __scale)
  {
    return (__m256d) __builtin_ia32_gather3div4df ((__v4df) __v1_old,
*************** _mm256_mmask_i64gather_pd (__m256d __v1_
*** 10311,10317 ****
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i64gather_pd (__m128d __v1_old, __mmask8 __mask,
! 			__m128i __index, double const *__addr,
  			int __scale)
  {
    return (__m128d) __builtin_ia32_gather3div2df ((__v2df) __v1_old,
--- 10876,10882 ----
  extern __inline __m128d
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i64gather_pd (__m128d __v1_old, __mmask8 __mask,
! 			__m128i __index, void const *__addr,
  			int __scale)
  {
    return (__m128d) __builtin_ia32_gather3div2df ((__v2df) __v1_old,
*************** _mm_mmask_i64gather_pd (__m128d __v1_old
*** 10323,10329 ****
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i32gather_epi32 (__m256i __v1_old, __mmask8 __mask,
! 			      __m256i __index, int const *__addr,
  			      int __scale)
  {
    return (__m256i) __builtin_ia32_gather3siv8si ((__v8si) __v1_old,
--- 10888,10894 ----
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i32gather_epi32 (__m256i __v1_old, __mmask8 __mask,
! 			      __m256i __index, void const *__addr,
  			      int __scale)
  {
    return (__m256i) __builtin_ia32_gather3siv8si ((__v8si) __v1_old,
*************** _mm256_mmask_i32gather_epi32 (__m256i __
*** 10335,10341 ****
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i32gather_epi32 (__m128i __v1_old, __mmask8 __mask,
! 			   __m128i __index, int const *__addr,
  			   int __scale)
  {
    return (__m128i) __builtin_ia32_gather3siv4si ((__v4si) __v1_old,
--- 10900,10906 ----
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i32gather_epi32 (__m128i __v1_old, __mmask8 __mask,
! 			   __m128i __index, void const *__addr,
  			   int __scale)
  {
    return (__m128i) __builtin_ia32_gather3siv4si ((__v4si) __v1_old,
*************** _mm_mmask_i32gather_epi32 (__m128i __v1_
*** 10347,10353 ****
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i32gather_epi64 (__m256i __v1_old, __mmask8 __mask,
! 			      __m128i __index, long long const *__addr,
  			      int __scale)
  {
    return (__m256i) __builtin_ia32_gather3siv4di ((__v4di) __v1_old,
--- 10912,10918 ----
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i32gather_epi64 (__m256i __v1_old, __mmask8 __mask,
! 			      __m128i __index, void const *__addr,
  			      int __scale)
  {
    return (__m256i) __builtin_ia32_gather3siv4di ((__v4di) __v1_old,
*************** _mm256_mmask_i32gather_epi64 (__m256i __
*** 10359,10365 ****
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i32gather_epi64 (__m128i __v1_old, __mmask8 __mask,
! 			   __m128i __index, long long const *__addr,
  			   int __scale)
  {
    return (__m128i) __builtin_ia32_gather3siv2di ((__v2di) __v1_old,
--- 10924,10930 ----
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i32gather_epi64 (__m128i __v1_old, __mmask8 __mask,
! 			   __m128i __index, void const *__addr,
  			   int __scale)
  {
    return (__m128i) __builtin_ia32_gather3siv2di ((__v2di) __v1_old,
*************** _mm_mmask_i32gather_epi64 (__m128i __v1_
*** 10371,10377 ****
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i64gather_epi32 (__m128i __v1_old, __mmask8 __mask,
! 			      __m256i __index, int const *__addr,
  			      int __scale)
  {
    return (__m128i) __builtin_ia32_gather3div8si ((__v4si) __v1_old,
--- 10936,10942 ----
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i64gather_epi32 (__m128i __v1_old, __mmask8 __mask,
! 			      __m256i __index, void const *__addr,
  			      int __scale)
  {
    return (__m128i) __builtin_ia32_gather3div8si ((__v4si) __v1_old,
*************** _mm256_mmask_i64gather_epi32 (__m128i __
*** 10383,10389 ****
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i64gather_epi32 (__m128i __v1_old, __mmask8 __mask,
! 			   __m128i __index, int const *__addr,
  			   int __scale)
  {
    return (__m128i) __builtin_ia32_gather3div4si ((__v4si) __v1_old,
--- 10948,10954 ----
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i64gather_epi32 (__m128i __v1_old, __mmask8 __mask,
! 			   __m128i __index, void const *__addr,
  			   int __scale)
  {
    return (__m128i) __builtin_ia32_gather3div4si ((__v4si) __v1_old,
*************** _mm_mmask_i64gather_epi32 (__m128i __v1_
*** 10395,10401 ****
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i64gather_epi64 (__m256i __v1_old, __mmask8 __mask,
! 			      __m256i __index, long long const *__addr,
  			      int __scale)
  {
    return (__m256i) __builtin_ia32_gather3div4di ((__v4di) __v1_old,
--- 10960,10966 ----
  extern __inline __m256i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm256_mmask_i64gather_epi64 (__m256i __v1_old, __mmask8 __mask,
! 			      __m256i __index, void const *__addr,
  			      int __scale)
  {
    return (__m256i) __builtin_ia32_gather3div4di ((__v4di) __v1_old,
*************** _mm256_mmask_i64gather_epi64 (__m256i __
*** 10407,10413 ****
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i64gather_epi64 (__m128i __v1_old, __mmask8 __mask,
! 			   __m128i __index, long long const *__addr,
  			   int __scale)
  {
    return (__m128i) __builtin_ia32_gather3div2di ((__v2di) __v1_old,
--- 10972,10978 ----
  extern __inline __m128i
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
  _mm_mmask_i64gather_epi64 (__m128i __v1_old, __mmask8 __mask,
! 			   __m128i __index, void const *__addr,
  			   int __scale)
  {
    return (__m128i) __builtin_ia32_gather3div2di ((__v2di) __v1_old,
*************** _mm_mmask_i64gather_epi64 (__m128i __v1_
*** 10418,10424 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32scatter_ps (float *__addr, __m256i __index,
  		      __m256 __v1, const int __scale)
  {
    __builtin_ia32_scattersiv8sf (__addr, (__mmask8) 0xFF,
--- 10983,10989 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32scatter_ps (void *__addr, __m256i __index,
  		      __m256 __v1, const int __scale)
  {
    __builtin_ia32_scattersiv8sf (__addr, (__mmask8) 0xFF,
*************** _mm256_i32scatter_ps (float *__addr, __m
*** 10428,10434 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32scatter_ps (float *__addr, __mmask8 __mask,
  			   __m256i __index, __m256 __v1,
  			   const int __scale)
  {
--- 10993,10999 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32scatter_ps (void *__addr, __mmask8 __mask,
  			   __m256i __index, __m256 __v1,
  			   const int __scale)
  {
*************** _mm256_mask_i32scatter_ps (float *__addr
*** 10438,10444 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32scatter_ps (float *__addr, __m128i __index, __m128 __v1,
  		   const int __scale)
  {
    __builtin_ia32_scattersiv4sf (__addr, (__mmask8) 0xFF,
--- 11003,11009 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32scatter_ps (void *__addr, __m128i __index, __m128 __v1,
  		   const int __scale)
  {
    __builtin_ia32_scattersiv4sf (__addr, (__mmask8) 0xFF,
*************** _mm_i32scatter_ps (float *__addr, __m128
*** 10448,10454 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32scatter_ps (float *__addr, __mmask8 __mask,
  			__m128i __index, __m128 __v1,
  			const int __scale)
  {
--- 11013,11019 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32scatter_ps (void *__addr, __mmask8 __mask,
  			__m128i __index, __m128 __v1,
  			const int __scale)
  {
*************** _mm_mask_i32scatter_ps (float *__addr, _
*** 10458,10464 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32scatter_pd (double *__addr, __m128i __index,
  		      __m256d __v1, const int __scale)
  {
    __builtin_ia32_scattersiv4df (__addr, (__mmask8) 0xFF,
--- 11023,11029 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32scatter_pd (void *__addr, __m128i __index,
  		      __m256d __v1, const int __scale)
  {
    __builtin_ia32_scattersiv4df (__addr, (__mmask8) 0xFF,
*************** _mm256_i32scatter_pd (double *__addr, __
*** 10468,10474 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32scatter_pd (double *__addr, __mmask8 __mask,
  			   __m128i __index, __m256d __v1,
  			   const int __scale)
  {
--- 11033,11039 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32scatter_pd (void *__addr, __mmask8 __mask,
  			   __m128i __index, __m256d __v1,
  			   const int __scale)
  {
*************** _mm256_mask_i32scatter_pd (double *__add
*** 10478,10484 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32scatter_pd (double *__addr, __m128i __index,
  		   __m128d __v1, const int __scale)
  {
    __builtin_ia32_scattersiv2df (__addr, (__mmask8) 0xFF,
--- 11043,11049 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32scatter_pd (void *__addr, __m128i __index,
  		   __m128d __v1, const int __scale)
  {
    __builtin_ia32_scattersiv2df (__addr, (__mmask8) 0xFF,
*************** _mm_i32scatter_pd (double *__addr, __m12
*** 10488,10494 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32scatter_pd (double *__addr, __mmask8 __mask,
  			__m128i __index, __m128d __v1,
  			const int __scale)
  {
--- 11053,11059 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32scatter_pd (void *__addr, __mmask8 __mask,
  			__m128i __index, __m128d __v1,
  			const int __scale)
  {
*************** _mm_mask_i32scatter_pd (double *__addr,
*** 10498,10504 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64scatter_ps (float *__addr, __m256i __index,
  		      __m128 __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv8sf (__addr, (__mmask8) 0xFF,
--- 11063,11069 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64scatter_ps (void *__addr, __m256i __index,
  		      __m128 __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv8sf (__addr, (__mmask8) 0xFF,
*************** _mm256_i64scatter_ps (float *__addr, __m
*** 10508,10514 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64scatter_ps (float *__addr, __mmask8 __mask,
  			   __m256i __index, __m128 __v1,
  			   const int __scale)
  {
--- 11073,11079 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64scatter_ps (void *__addr, __mmask8 __mask,
  			   __m256i __index, __m128 __v1,
  			   const int __scale)
  {
*************** _mm256_mask_i64scatter_ps (float *__addr
*** 10518,10524 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64scatter_ps (float *__addr, __m128i __index, __m128 __v1,
  		   const int __scale)
  {
    __builtin_ia32_scatterdiv4sf (__addr, (__mmask8) 0xFF,
--- 11083,11089 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64scatter_ps (void *__addr, __m128i __index, __m128 __v1,
  		   const int __scale)
  {
    __builtin_ia32_scatterdiv4sf (__addr, (__mmask8) 0xFF,
*************** _mm_i64scatter_ps (float *__addr, __m128
*** 10528,10534 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64scatter_ps (float *__addr, __mmask8 __mask,
  			__m128i __index, __m128 __v1,
  			const int __scale)
  {
--- 11093,11099 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64scatter_ps (void *__addr, __mmask8 __mask,
  			__m128i __index, __m128 __v1,
  			const int __scale)
  {
*************** _mm_mask_i64scatter_ps (float *__addr, _
*** 10538,10544 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64scatter_pd (double *__addr, __m256i __index,
  		      __m256d __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv4df (__addr, (__mmask8) 0xFF,
--- 11103,11109 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64scatter_pd (void *__addr, __m256i __index,
  		      __m256d __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv4df (__addr, (__mmask8) 0xFF,
*************** _mm256_i64scatter_pd (double *__addr, __
*** 10548,10554 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64scatter_pd (double *__addr, __mmask8 __mask,
  			   __m256i __index, __m256d __v1,
  			   const int __scale)
  {
--- 11113,11119 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64scatter_pd (void *__addr, __mmask8 __mask,
  			   __m256i __index, __m256d __v1,
  			   const int __scale)
  {
*************** _mm256_mask_i64scatter_pd (double *__add
*** 10558,10564 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64scatter_pd (double *__addr, __m128i __index,
  		   __m128d __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv2df (__addr, (__mmask8) 0xFF,
--- 11123,11129 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64scatter_pd (void *__addr, __m128i __index,
  		   __m128d __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv2df (__addr, (__mmask8) 0xFF,
*************** _mm_i64scatter_pd (double *__addr, __m12
*** 10568,10574 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64scatter_pd (double *__addr, __mmask8 __mask,
  			__m128i __index, __m128d __v1,
  			const int __scale)
  {
--- 11133,11139 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64scatter_pd (void *__addr, __mmask8 __mask,
  			__m128i __index, __m128d __v1,
  			const int __scale)
  {
*************** _mm_mask_i64scatter_pd (double *__addr,
*** 10578,10584 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32scatter_epi32 (int *__addr, __m256i __index,
  			 __m256i __v1, const int __scale)
  {
    __builtin_ia32_scattersiv8si (__addr, (__mmask8) 0xFF,
--- 11143,11149 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32scatter_epi32 (void *__addr, __m256i __index,
  			 __m256i __v1, const int __scale)
  {
    __builtin_ia32_scattersiv8si (__addr, (__mmask8) 0xFF,
*************** _mm256_i32scatter_epi32 (int *__addr, __
*** 10588,10594 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32scatter_epi32 (int *__addr, __mmask8 __mask,
  			      __m256i __index, __m256i __v1,
  			      const int __scale)
  {
--- 11153,11159 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32scatter_epi32 (void *__addr, __mmask8 __mask,
  			      __m256i __index, __m256i __v1,
  			      const int __scale)
  {
*************** _mm256_mask_i32scatter_epi32 (int *__add
*** 10598,10604 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32scatter_epi32 (int *__addr, __m128i __index,
  		      __m128i __v1, const int __scale)
  {
    __builtin_ia32_scattersiv4si (__addr, (__mmask8) 0xFF,
--- 11163,11169 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32scatter_epi32 (void *__addr, __m128i __index,
  		      __m128i __v1, const int __scale)
  {
    __builtin_ia32_scattersiv4si (__addr, (__mmask8) 0xFF,
*************** _mm_i32scatter_epi32 (int *__addr, __m12
*** 10608,10614 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32scatter_epi32 (int *__addr, __mmask8 __mask,
  			   __m128i __index, __m128i __v1,
  			   const int __scale)
  {
--- 11173,11179 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32scatter_epi32 (void *__addr, __mmask8 __mask,
  			   __m128i __index, __m128i __v1,
  			   const int __scale)
  {
*************** _mm_mask_i32scatter_epi32 (int *__addr,
*** 10618,10624 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32scatter_epi64 (long long *__addr, __m128i __index,
  			 __m256i __v1, const int __scale)
  {
    __builtin_ia32_scattersiv4di (__addr, (__mmask8) 0xFF,
--- 11183,11189 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i32scatter_epi64 (void *__addr, __m128i __index,
  			 __m256i __v1, const int __scale)
  {
    __builtin_ia32_scattersiv4di (__addr, (__mmask8) 0xFF,
*************** _mm256_i32scatter_epi64 (long long *__ad
*** 10628,10634 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32scatter_epi64 (long long *__addr, __mmask8 __mask,
  			      __m128i __index, __m256i __v1,
  			      const int __scale)
  {
--- 11193,11199 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i32scatter_epi64 (void *__addr, __mmask8 __mask,
  			      __m128i __index, __m256i __v1,
  			      const int __scale)
  {
*************** _mm256_mask_i32scatter_epi64 (long long
*** 10638,10644 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32scatter_epi64 (long long *__addr, __m128i __index,
  		      __m128i __v1, const int __scale)
  {
    __builtin_ia32_scattersiv2di (__addr, (__mmask8) 0xFF,
--- 11203,11209 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i32scatter_epi64 (void *__addr, __m128i __index,
  		      __m128i __v1, const int __scale)
  {
    __builtin_ia32_scattersiv2di (__addr, (__mmask8) 0xFF,
*************** _mm_i32scatter_epi64 (long long *__addr,
*** 10648,10654 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32scatter_epi64 (long long *__addr, __mmask8 __mask,
  			   __m128i __index, __m128i __v1,
  			   const int __scale)
  {
--- 11213,11219 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i32scatter_epi64 (void *__addr, __mmask8 __mask,
  			   __m128i __index, __m128i __v1,
  			   const int __scale)
  {
*************** _mm_mask_i32scatter_epi64 (long long *__
*** 10658,10664 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64scatter_epi32 (int *__addr, __m256i __index,
  			 __m128i __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv8si (__addr, (__mmask8) 0xFF,
--- 11223,11229 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64scatter_epi32 (void *__addr, __m256i __index,
  			 __m128i __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv8si (__addr, (__mmask8) 0xFF,
*************** _mm256_i64scatter_epi32 (int *__addr, __
*** 10668,10674 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64scatter_epi32 (int *__addr, __mmask8 __mask,
  			      __m256i __index, __m128i __v1,
  			      const int __scale)
  {
--- 11233,11239 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64scatter_epi32 (void *__addr, __mmask8 __mask,
  			      __m256i __index, __m128i __v1,
  			      const int __scale)
  {
*************** _mm256_mask_i64scatter_epi32 (int *__add
*** 10678,10684 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64scatter_epi32 (int *__addr, __m128i __index,
  		      __m128i __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv4si (__addr, (__mmask8) 0xFF,
--- 11243,11249 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64scatter_epi32 (void *__addr, __m128i __index,
  		      __m128i __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv4si (__addr, (__mmask8) 0xFF,
*************** _mm_i64scatter_epi32 (int *__addr, __m12
*** 10688,10694 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64scatter_epi32 (int *__addr, __mmask8 __mask,
  			   __m128i __index, __m128i __v1,
  			   const int __scale)
  {
--- 11253,11259 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64scatter_epi32 (void *__addr, __mmask8 __mask,
  			   __m128i __index, __m128i __v1,
  			   const int __scale)
  {
*************** _mm_mask_i64scatter_epi32 (int *__addr,
*** 10698,10704 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64scatter_epi64 (long long *__addr, __m256i __index,
  			 __m256i __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv4di (__addr, (__mmask8) 0xFF,
--- 11263,11269 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_i64scatter_epi64 (void *__addr, __m256i __index,
  			 __m256i __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv4di (__addr, (__mmask8) 0xFF,
*************** _mm256_i64scatter_epi64 (long long *__ad
*** 10708,10714 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64scatter_epi64 (long long *__addr, __mmask8 __mask,
  			      __m256i __index, __m256i __v1,
  			      const int __scale)
  {
--- 11273,11279 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm256_mask_i64scatter_epi64 (void *__addr, __mmask8 __mask,
  			      __m256i __index, __m256i __v1,
  			      const int __scale)
  {
*************** _mm256_mask_i64scatter_epi64 (long long
*** 10718,10724 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64scatter_epi64 (long long *__addr, __m128i __index,
  		      __m128i __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv2di (__addr, (__mmask8) 0xFF,
--- 11283,11289 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_i64scatter_epi64 (void *__addr, __m128i __index,
  		      __m128i __v1, const int __scale)
  {
    __builtin_ia32_scatterdiv2di (__addr, (__mmask8) 0xFF,
*************** _mm_i64scatter_epi64 (long long *__addr,
*** 10728,10734 ****
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64scatter_epi64 (long long *__addr, __mmask8 __mask,
  			   __m128i __index, __m128i __v1,
  			   const int __scale)
  {
--- 11293,11299 ----
  
  extern __inline void
  __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
! _mm_mask_i64scatter_epi64 (void *__addr, __mmask8 __mask,
  			   __m128i __index, __m128i __v1,
  			   const int __scale)
  {
*************** _mm256_permutex_pd (__m256d __X, const i
*** 11782,12363 ****
  						  (__mmask8) -1);
  }
  
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmpneq_epu32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
- 						  (__v8si) __Y, 4,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmpneq_epu32_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
- 						  (__v8si) __Y, 4,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmplt_epu32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
- 						  (__v8si) __Y, 1,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmplt_epu32_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
- 						  (__v8si) __Y, 1,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmpge_epu32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
- 						  (__v8si) __Y, 5,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmpge_epu32_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
- 						  (__v8si) __Y, 5,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmple_epu32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
- 						  (__v8si) __Y, 2,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmple_epu32_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd256_mask ((__v8si) __X,
- 						  (__v8si) __Y, 2,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmpneq_epu64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
- 						  (__v4di) __Y, 4,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmpneq_epu64_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
- 						  (__v4di) __Y, 4,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmplt_epu64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
- 						  (__v4di) __Y, 1,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmplt_epu64_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
- 						  (__v4di) __Y, 1,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmpge_epu64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
- 						  (__v4di) __Y, 5,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmpge_epu64_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
- 						  (__v4di) __Y, 5,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmple_epu64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
- 						  (__v4di) __Y, 2,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmple_epu64_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq256_mask ((__v4di) __X,
- 						  (__v4di) __Y, 2,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmpneq_epi32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
- 						 (__v8si) __Y, 4,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmpneq_epi32_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
- 						 (__v8si) __Y, 4,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmplt_epi32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
- 						 (__v8si) __Y, 1,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmplt_epi32_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
- 						 (__v8si) __Y, 1,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmpge_epi32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
- 						 (__v8si) __Y, 5,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmpge_epi32_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
- 						 (__v8si) __Y, 5,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmple_epi32_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
- 						 (__v8si) __Y, 2,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmple_epi32_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd256_mask ((__v8si) __X,
- 						 (__v8si) __Y, 2,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmpneq_epi64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
- 						 (__v4di) __Y, 4,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmpneq_epi64_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
- 						 (__v4di) __Y, 4,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmplt_epi64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
- 						 (__v4di) __Y, 1,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmplt_epi64_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
- 						 (__v4di) __Y, 1,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmpge_epi64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
- 						 (__v4di) __Y, 5,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmpge_epi64_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
- 						 (__v4di) __Y, 5,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_mask_cmple_epi64_mask (__mmask8 __M, __m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
- 						 (__v4di) __Y, 2,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm256_cmple_epi64_mask (__m256i __X, __m256i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq256_mask ((__v4di) __X,
- 						 (__v4di) __Y, 2,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmpneq_epu32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
- 						  (__v4si) __Y, 4,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmpneq_epu32_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
- 						  (__v4si) __Y, 4,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmplt_epu32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
- 						  (__v4si) __Y, 1,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmplt_epu32_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
- 						  (__v4si) __Y, 1,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmpge_epu32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
- 						  (__v4si) __Y, 5,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmpge_epu32_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
- 						  (__v4si) __Y, 5,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmple_epu32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
- 						  (__v4si) __Y, 2,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmple_epu32_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpd128_mask ((__v4si) __X,
- 						  (__v4si) __Y, 2,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmpneq_epu64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
- 						  (__v2di) __Y, 4,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmpneq_epu64_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
- 						  (__v2di) __Y, 4,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmplt_epu64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
- 						  (__v2di) __Y, 1,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmplt_epu64_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
- 						  (__v2di) __Y, 1,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmpge_epu64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
- 						  (__v2di) __Y, 5,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmpge_epu64_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
- 						  (__v2di) __Y, 5,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmple_epu64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
- 						  (__v2di) __Y, 2,
- 						  (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmple_epu64_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_ucmpq128_mask ((__v2di) __X,
- 						  (__v2di) __Y, 2,
- 						  (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmpneq_epi32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
- 						 (__v4si) __Y, 4,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmpneq_epi32_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
- 						 (__v4si) __Y, 4,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmplt_epi32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
- 						 (__v4si) __Y, 1,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmplt_epi32_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
- 						 (__v4si) __Y, 1,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmpge_epi32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
- 						 (__v4si) __Y, 5,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmpge_epi32_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
- 						 (__v4si) __Y, 5,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmple_epi32_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
- 						 (__v4si) __Y, 2,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmple_epi32_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpd128_mask ((__v4si) __X,
- 						 (__v4si) __Y, 2,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmpneq_epi64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
- 						 (__v2di) __Y, 4,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmpneq_epi64_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
- 						 (__v2di) __Y, 4,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmplt_epi64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
- 						 (__v2di) __Y, 1,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmplt_epi64_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
- 						 (__v2di) __Y, 1,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmpge_epi64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
- 						 (__v2di) __Y, 5,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmpge_epi64_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
- 						 (__v2di) __Y, 5,
- 						 (__mmask8) - 1);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_mask_cmple_epi64_mask (__mmask8 __M, __m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
- 						 (__v2di) __Y, 2,
- 						 (__mmask8) __M);
- }
- 
- extern __inline __mmask8
-   __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
- _mm_cmple_epi64_mask (__m128i __X, __m128i __Y)
- {
-   return (__mmask8) __builtin_ia32_cmpq128_mask ((__v2di) __X,
- 						 (__v2di) __Y, 2,
- 						 (__mmask8) - 1);
- }
- 
  #else
  #define _mm256_permutex_pd(X, M)						\
    ((__m256d) __builtin_ia32_permdf256_mask ((__v4df)(__m256d)(X), (int)(M),	\
--- 12347,12352 ----
*************** _mm_cmple_epi64_mask (__m128i __X, __m12
*** 12879,13135 ****
  
  #define _mm256_mmask_i32gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256) __builtin_ia32_gather3siv8sf ((__v8sf)(__m256)V1OLD,		\
! 					 (float const *)ADDR,		\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i32gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)		\
    (__m128) __builtin_ia32_gather3siv4sf ((__v4sf)(__m128)V1OLD,		\
! 					 (float const *)ADDR,		\
  					 (__v4si)(__m128i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i32gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256d) __builtin_ia32_gather3siv4df ((__v4df)(__m256d)V1OLD,	\
! 					  (double const *)ADDR,		\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i32gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)		\
    (__m128d) __builtin_ia32_gather3siv2df ((__v2df)(__m128d)V1OLD,	\
! 					  (double const *)ADDR,		\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i64gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128) __builtin_ia32_gather3div8sf ((__v4sf)(__m128)V1OLD,		\
! 					 (float const *)ADDR,		\
  					 (__v4di)(__m256i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i64gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)		\
    (__m128) __builtin_ia32_gather3div4sf ((__v4sf)(__m128)V1OLD,		\
! 					 (float const *)ADDR,		\
  					 (__v2di)(__m128i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i64gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256d) __builtin_ia32_gather3div4df ((__v4df)(__m256d)V1OLD,	\
! 					  (double const *)ADDR,		\
  					  (__v4di)(__m256i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i64gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)		\
    (__m128d) __builtin_ia32_gather3div2df ((__v2df)(__m128d)V1OLD,	\
! 					  (double const *)ADDR,		\
  					  (__v2di)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i32gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256i) __builtin_ia32_gather3siv8si ((__v8si)(__m256i)V1OLD,	\
! 					  (int const *)ADDR,		\
  					  (__v8si)(__m256i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i32gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3siv4si ((__v4si)(__m128i)V1OLD,	\
! 					  (int const *)ADDR,		\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i32gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256i) __builtin_ia32_gather3siv4di ((__v4di)(__m256i)V1OLD,	\
! 					  (long long const *)ADDR,	\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i32gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3siv2di ((__v2di)(__m128i)V1OLD,	\
! 					  (long long const *)ADDR,	\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i64gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3div8si ((__v4si)(__m128i)V1OLD,	\
! 					  (int const *)ADDR,		\
  					  (__v4di)(__m256i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i64gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3div4si ((__v4si)(__m128i)V1OLD,	\
! 					  (int const *)ADDR,		\
  					  (__v2di)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i64gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256i) __builtin_ia32_gather3div4di ((__v4di)(__m256i)V1OLD,	\
! 					  (long long const *)ADDR,	\
  					  (__v4di)(__m256i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i64gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3div2di ((__v2di)(__m128i)V1OLD,	\
! 					  (long long const *)ADDR,	\
  					  (__v2di)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_i32scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv8sf ((float *)ADDR, (__mmask8)0xFF,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8sf)(__m256)V1, (int)SCALE)
  
  #define _mm256_mask_i32scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv8sf ((float *)ADDR, (__mmask8)MASK,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8sf)(__m256)V1, (int)SCALE)
  
  #define _mm_i32scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv4sf ((float *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm_mask_i32scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv4sf ((float *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm256_i32scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv4df ((double *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4df)(__m256d)V1, (int)SCALE)
  
  #define _mm256_mask_i32scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv4df ((double *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4df)(__m256d)V1, (int)SCALE)
  
  #define _mm_i32scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv2df ((double *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v2df)(__m128d)V1, (int)SCALE)
  
  #define _mm_mask_i32scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv2df ((double *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v2df)(__m128d)V1, (int)SCALE)
  
  #define _mm256_i64scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv8sf ((float *)ADDR, (__mmask8)0xFF,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm256_mask_i64scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv8sf ((float *)ADDR, (__mmask8)MASK,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm_i64scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv4sf ((float *)ADDR, (__mmask8)0xFF,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm_mask_i64scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv4sf ((float *)ADDR, (__mmask8)MASK,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm256_i64scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv4df ((double *)ADDR, (__mmask8)0xFF,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4df)(__m256d)V1, (int)SCALE)
  
  #define _mm256_mask_i64scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv4df ((double *)ADDR, (__mmask8)MASK,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4df)(__m256d)V1, (int)SCALE)
  
  #define _mm_i64scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv2df ((double *)ADDR, (__mmask8)0xFF,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v2df)(__m128d)V1, (int)SCALE)
  
  #define _mm_mask_i64scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv2df ((double *)ADDR, (__mmask8)MASK,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v2df)(__m128d)V1, (int)SCALE)
  
  #define _mm256_i32scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv8si ((int *)ADDR, (__mmask8)0xFF,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8si)(__m256i)V1, (int)SCALE)
  
  #define _mm256_mask_i32scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scattersiv8si ((int *)ADDR, (__mmask8)MASK,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8si)(__m256i)V1, (int)SCALE)
  
  #define _mm_i32scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv4si ((int *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm_mask_i32scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv4si ((int *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm256_i32scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv4di ((long long *)ADDR, (__mmask8)0xFF,	\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4di)(__m256i)V1, (int)SCALE)
  
  #define _mm256_mask_i32scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scattersiv4di ((long long *)ADDR, (__mmask8)MASK,	\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4di)(__m256i)V1, (int)SCALE)
  
  #define _mm_i32scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv2di ((long long *)ADDR, (__mmask8)0xFF,	\
  				(__v4si)(__m128i)INDEX,			\
  				(__v2di)(__m128i)V1, (int)SCALE)
  
  #define _mm_mask_i32scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv2di ((long long *)ADDR, (__mmask8)MASK,	\
  				(__v4si)(__m128i)INDEX,			\
  				(__v2di)(__m128i)V1, (int)SCALE)
  
  #define _mm256_i64scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv8si ((int *)ADDR, (__mmask8)0xFF,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm256_mask_i64scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scatterdiv8si ((int *)ADDR, (__mmask8)MASK,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm_i64scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv4si ((int *)ADDR, (__mmask8)0xFF,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm_mask_i64scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv4si ((int *)ADDR, (__mmask8)MASK,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm256_i64scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv4di ((long long *)ADDR, (__mmask8)0xFF,	\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4di)(__m256i)V1, (int)SCALE)
  
  #define _mm256_mask_i64scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scatterdiv4di ((long long *)ADDR, (__mmask8)MASK,	\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4di)(__m256i)V1, (int)SCALE)
  
  #define _mm_i64scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv2di ((long long *)ADDR, (__mmask8)0xFF,	\
  				(__v2di)(__m128i)INDEX,			\
  				(__v2di)(__m128i)V1, (int)SCALE)
  
  #define _mm_mask_i64scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv2di ((long long *)ADDR, (__mmask8)MASK,	\
  				(__v2di)(__m128i)INDEX,			\
  				(__v2di)(__m128i)V1, (int)SCALE)
  
--- 12868,13124 ----
  
  #define _mm256_mmask_i32gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256) __builtin_ia32_gather3siv8sf ((__v8sf)(__m256)V1OLD,		\
! 					 (void const *)ADDR,		\
  					 (__v8si)(__m256i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i32gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)		\
    (__m128) __builtin_ia32_gather3siv4sf ((__v4sf)(__m128)V1OLD,		\
! 					 (void const *)ADDR,		\
  					 (__v4si)(__m128i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i32gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256d) __builtin_ia32_gather3siv4df ((__v4df)(__m256d)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i32gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)		\
    (__m128d) __builtin_ia32_gather3siv2df ((__v2df)(__m128d)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i64gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128) __builtin_ia32_gather3div8sf ((__v4sf)(__m128)V1OLD,		\
! 					 (void const *)ADDR,		\
  					 (__v4di)(__m256i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i64gather_ps(V1OLD, MASK, INDEX, ADDR, SCALE)		\
    (__m128) __builtin_ia32_gather3div4sf ((__v4sf)(__m128)V1OLD,		\
! 					 (void const *)ADDR,		\
  					 (__v2di)(__m128i)INDEX,	\
  					 (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i64gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256d) __builtin_ia32_gather3div4df ((__v4df)(__m256d)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v4di)(__m256i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i64gather_pd(V1OLD, MASK, INDEX, ADDR, SCALE)		\
    (__m128d) __builtin_ia32_gather3div2df ((__v2df)(__m128d)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v2di)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i32gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256i) __builtin_ia32_gather3siv8si ((__v8si)(__m256i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v8si)(__m256i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i32gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3siv4si ((__v4si)(__m128i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i32gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256i) __builtin_ia32_gather3siv4di ((__v4di)(__m256i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i32gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3siv2di ((__v2di)(__m128i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v4si)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i64gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3div8si ((__v4si)(__m128i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v4di)(__m256i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i64gather_epi32(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3div4si ((__v4si)(__m128i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v2di)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_mmask_i64gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m256i) __builtin_ia32_gather3div4di ((__v4di)(__m256i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v4di)(__m256i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm_mmask_i64gather_epi64(V1OLD, MASK, INDEX, ADDR, SCALE)	\
    (__m128i) __builtin_ia32_gather3div2di ((__v2di)(__m128i)V1OLD,	\
! 					  (void const *)ADDR,		\
  					  (__v2di)(__m128i)INDEX,	\
  					  (__mmask8)MASK, (int)SCALE)
  
  #define _mm256_i32scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv8sf ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8sf)(__m256)V1, (int)SCALE)
  
  #define _mm256_mask_i32scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv8sf ((void *)ADDR, (__mmask8)MASK,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8sf)(__m256)V1, (int)SCALE)
  
  #define _mm_i32scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv4sf ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm_mask_i32scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv4sf ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm256_i32scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv4df ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4df)(__m256d)V1, (int)SCALE)
  
  #define _mm256_mask_i32scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv4df ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4df)(__m256d)V1, (int)SCALE)
  
  #define _mm_i32scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv2df ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v2df)(__m128d)V1, (int)SCALE)
  
  #define _mm_mask_i32scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv2df ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v2df)(__m128d)V1, (int)SCALE)
  
  #define _mm256_i64scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv8sf ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm256_mask_i64scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv8sf ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm_i64scatter_ps(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv4sf ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm_mask_i64scatter_ps(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv4sf ((void *)ADDR, (__mmask8)MASK,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v4sf)(__m128)V1, (int)SCALE)
  
  #define _mm256_i64scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv4df ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4df)(__m256d)V1, (int)SCALE)
  
  #define _mm256_mask_i64scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv4df ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4df)(__m256d)V1, (int)SCALE)
  
  #define _mm_i64scatter_pd(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv2df ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v2df)(__m128d)V1, (int)SCALE)
  
  #define _mm_mask_i64scatter_pd(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv2df ((void *)ADDR, (__mmask8)MASK,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v2df)(__m128d)V1, (int)SCALE)
  
  #define _mm256_i32scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv8si ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8si)(__m256i)V1, (int)SCALE)
  
  #define _mm256_mask_i32scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scattersiv8si ((void *)ADDR, (__mmask8)MASK,		\
  				(__v8si)(__m256i)INDEX,			\
  				(__v8si)(__m256i)V1, (int)SCALE)
  
  #define _mm_i32scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv4si ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm_mask_i32scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv4si ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm256_i32scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv4di ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4di)(__m256i)V1, (int)SCALE)
  
  #define _mm256_mask_i32scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scattersiv4di ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v4di)(__m256i)V1, (int)SCALE)
  
  #define _mm_i32scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scattersiv2di ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v2di)(__m128i)V1, (int)SCALE)
  
  #define _mm_mask_i32scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scattersiv2di ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4si)(__m128i)INDEX,			\
  				(__v2di)(__m128i)V1, (int)SCALE)
  
  #define _mm256_i64scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv8si ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm256_mask_i64scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scatterdiv8si ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm_i64scatter_epi32(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv4si ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm_mask_i64scatter_epi32(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv4si ((void *)ADDR, (__mmask8)MASK,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v4si)(__m128i)V1, (int)SCALE)
  
  #define _mm256_i64scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv4di ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4di)(__m256i)V1, (int)SCALE)
  
  #define _mm256_mask_i64scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)	\
!   __builtin_ia32_scatterdiv4di ((void *)ADDR, (__mmask8)MASK,		\
  				(__v4di)(__m256i)INDEX,			\
  				(__v4di)(__m256i)V1, (int)SCALE)
  
  #define _mm_i64scatter_epi64(ADDR, INDEX, V1, SCALE)			\
!   __builtin_ia32_scatterdiv2di ((void *)ADDR, (__mmask8)0xFF,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v2di)(__m128i)V1, (int)SCALE)
  
  #define _mm_mask_i64scatter_epi64(ADDR, MASK, INDEX, V1, SCALE)		\
!   __builtin_ia32_scatterdiv2di ((void *)ADDR, (__mmask8)MASK,		\
  				(__v2di)(__m128i)INDEX,			\
  				(__v2di)(__m128i)V1, (int)SCALE)
  
diff -Nrcpad gcc-5.4.0/gcc/config/i386/cpuid.h gcc-5.5.0/gcc/config/i386/cpuid.h
*** gcc-5.4.0/gcc/config/i386/cpuid.h	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/config/i386/cpuid.h	Thu Jun 22 11:31:28 2017
***************
*** 63,69 ****
  #define bit_MMXEXT	(1 << 22)
  #define bit_LM		(1 << 29)
  #define bit_3DNOWP	(1 << 30)
! #define bit_3DNOW	(1 << 31)
  
  /* Extended Features (%eax == 7) */
  /* %ebx */
--- 63,69 ----
  #define bit_MMXEXT	(1 << 22)
  #define bit_LM		(1 << 29)
  #define bit_3DNOWP	(1 << 30)
! #define bit_3DNOW	(1u << 31)
  
  /* Extended Features (%eax == 7) */
  /* %ebx */
***************
*** 79,85 ****
  #define bit_RDSEED	(1 << 18)
  #define bit_ADX	(1 << 19)
  #define bit_AVX512IFMA	(1 << 21)
- #define bit_PCOMMIT	(1 << 22)
  #define bit_CLFLUSHOPT	(1 << 23)
  #define bit_CLWB	(1 << 24)
  #define bit_AVX512PF	(1 << 26)
--- 79,84 ----
***************
*** 87,93 ****
  #define bit_AVX512CD	(1 << 28)
  #define bit_SHA		(1 << 29)
  #define bit_AVX512BW	(1 << 30)
! #define bit_AVX512VL	(1 << 31)
  
  /* %ecx */
  #define bit_PREFETCHWT1	  (1 << 0)
--- 86,92 ----
  #define bit_AVX512CD	(1 << 28)
  #define bit_SHA		(1 << 29)
  #define bit_AVX512BW	(1 << 30)
! #define bit_AVX512VL	(1u << 31)
  
  /* %ecx */
  #define bit_PREFETCHWT1	  (1 << 0)
***************
*** 168,174 ****
  
  
  /* Return highest supported input value for cpuid instruction.  ext can
!    be either 0x0 or 0x8000000 to return highest supported value for
     basic or extended cpuid information.  Function returns 0 if cpuid
     is not supported or whatever cpuid returns in eax register.  If sig
     pointer is non-null, then first four bytes of the signature
--- 167,173 ----
  
  
  /* Return highest supported input value for cpuid instruction.  ext can
!    be either 0x0 or 0x80000000 to return highest supported value for
     basic or extended cpuid information.  Function returns 0 if cpuid
     is not supported or whatever cpuid returns in eax register.  If sig
     pointer is non-null, then first four bytes of the signature
*************** __get_cpuid (unsigned int __level,
*** 235,242 ****
  	     unsigned int *__ecx, unsigned int *__edx)
  {
    unsigned int __ext = __level & 0x80000000;
  
!   if (__get_cpuid_max (__ext, 0) < __level)
      return 0;
  
    __cpuid (__level, *__eax, *__ebx, *__ecx, *__edx);
--- 234,242 ----
  	     unsigned int *__ecx, unsigned int *__edx)
  {
    unsigned int __ext = __level & 0x80000000;
+   unsigned int __maxlevel = __get_cpuid_max (__ext, 0);
  
!   if (__maxlevel == 0 || __maxlevel < __level)
      return 0;
  
    __cpuid (__level, *__eax, *__ebx, *__ecx, *__edx);
diff -Nrcpad gcc-5.4.0/gcc/config/i386/driver-i386.c gcc-5.5.0/gcc/config/i386/driver-i386.c
*** gcc-5.4.0/gcc/config/i386/driver-i386.c	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/config/i386/driver-i386.c	Thu Oct 13 21:19:00 2016
*************** const char *host_detect_local_cpu (int a
*** 413,419 ****
    unsigned int has_clflushopt = 0, has_xsavec = 0, has_xsaves = 0;
    unsigned int has_avx512dq = 0, has_avx512bw = 0, has_avx512vl = 0;
    unsigned int has_avx512vbmi = 0, has_avx512ifma = 0, has_clwb = 0;
!   unsigned int has_pcommit = 0, has_mwaitx = 0;
  
    bool arch;
  
--- 413,419 ----
    unsigned int has_clflushopt = 0, has_xsavec = 0, has_xsaves = 0;
    unsigned int has_avx512dq = 0, has_avx512bw = 0, has_avx512vl = 0;
    unsigned int has_avx512vbmi = 0, has_avx512ifma = 0, has_clwb = 0;
!   unsigned int has_mwaitx = 0;
  
    bool arch;
  
*************** const char *host_detect_local_cpu (int a
*** 491,497 ****
        has_avx512pf = ebx & bit_AVX512PF;
        has_avx512cd = ebx & bit_AVX512CD;
        has_sha = ebx & bit_SHA;
-       has_pcommit = ebx & bit_PCOMMIT;
        has_clflushopt = ebx & bit_CLFLUSHOPT;
        has_clwb = ebx & bit_CLWB;
        has_avx512dq = ebx & bit_AVX512DQ;
--- 491,496 ----
*************** const char *host_detect_local_cpu (int a
*** 630,662 ****
      }
    else if (vendor == signature_CENTAUR_ebx)
      {
!       if (arch)
  	{
! 	  switch (family)
! 	    {
! 	    case 6:
! 	      if (model > 9)
! 		/* Use the default detection procedure.  */
! 		processor = PROCESSOR_GENERIC;
! 	      else if (model == 9)
! 		cpu = "c3-2";
! 	      else if (model >= 6)
! 		cpu = "c3";
! 	      else
! 		processor = PROCESSOR_GENERIC;
! 	      break;
! 	    case 5:
! 	      if (has_3dnow)
! 		cpu = "winchip2";
! 	      else if (has_mmx)
! 		cpu = "winchip2-c6";
! 	      else
! 		processor = PROCESSOR_GENERIC;
! 	      break;
! 	    default:
! 	      /* We have no idea.  */
! 	      processor = PROCESSOR_GENERIC;
! 	    }
  	}
      }
    else
--- 629,655 ----
      }
    else if (vendor == signature_CENTAUR_ebx)
      {
!       processor = PROCESSOR_GENERIC;
! 
!       switch (family)
  	{
! 	default:
! 	  /* We have no idea.  */
! 	  break;
! 
! 	case 5:
! 	  if (has_3dnow || has_mmx)
! 	    processor = PROCESSOR_I486;
! 	  break;
! 
! 	case 6:
! 	  if (model > 9 || has_longmode)
! 	    /* Use the default detection procedure.  */
! 	    ;
! 	  else if (model == 9)
! 	    processor = PROCESSOR_PENTIUMPRO;
! 	  else if (model >= 6)
! 	    processor = PROCESSOR_I486;
  	}
      }
    else
*************** const char *host_detect_local_cpu (int a
*** 687,693 ****
        /* Default.  */
        break;
      case PROCESSOR_I486:
!       cpu = "i486";
        break;
      case PROCESSOR_PENTIUM:
        if (arch && has_mmx)
--- 680,697 ----
        /* Default.  */
        break;
      case PROCESSOR_I486:
!       if (arch && vendor == signature_CENTAUR_ebx)
! 	{
! 	  if (model >= 6)
! 	    cpu = "c3";
! 	  else if (has_3dnow)
! 	    cpu = "winchip2";
! 	  else
! 	    /* Assume WinChip C6.  */
! 	    cpu = "winchip-c6";
! 	}
!       else
! 	cpu = "i486";
        break;
      case PROCESSOR_PENTIUM:
        if (arch && has_mmx)
*************** const char *host_detect_local_cpu (int a
*** 804,811 ****
  		/* It is Pentium M.  */
  		cpu = "pentium-m";
  	      else if (has_sse)
! 		/* It is Pentium III.  */
! 		cpu = "pentium3";
  	      else if (has_mmx)
  		/* It is Pentium II.  */
  		cpu = "pentium2";
--- 808,820 ----
  		/* It is Pentium M.  */
  		cpu = "pentium-m";
  	      else if (has_sse)
! 		{
! 		  if (vendor == signature_CENTAUR_ebx)
! 		    cpu = "c3-2";
! 		  else
! 		    /* It is Pentium III.  */
! 		    cpu = "pentium3";
! 		}
  	      else if (has_mmx)
  		/* It is Pentium II.  */
  		cpu = "pentium2";
*************** const char *host_detect_local_cpu (int a
*** 886,891 ****
--- 895,905 ----
  	      else
  		cpu = "prescott";
  	    }
+ 	  else if (has_longmode)
+ 	    /* Perhaps some emulator?  Assume x86-64, otherwise gcc
+ 	       -march=native would be unusable for 64-bit compilations,
+ 	       as all the CPUs below are 32-bit only.  */
+ 	    cpu = "x86-64";
  	  else if (has_sse2)
  	    cpu = "pentium4";
  	  else if (has_cmov)
*************** const char *host_detect_local_cpu (int a
*** 953,959 ****
        const char *avx512ifma = has_avx512ifma ? " -mavx512ifma" : " -mno-avx512ifma";
        const char *avx512vbmi = has_avx512vbmi ? " -mavx512vbmi" : " -mno-avx512vbmi";
        const char *clwb = has_clwb ? " -mclwb" : " -mno-clwb";
-       const char *pcommit = has_pcommit ? " -mpcommit" : " -mno-pcommit";
        const char *mwaitx  = has_mwaitx  ? " -mmwaitx"  : " -mno-mwaitx"; 
  
        options = concat (options, mmx, mmx3dnow, sse, sse2, sse3, ssse3,
--- 967,972 ----
*************** const char *host_detect_local_cpu (int a
*** 964,970 ****
  			fxsr, xsave, xsaveopt, avx512f, avx512er,
  			avx512cd, avx512pf, prefetchwt1, clflushopt,
  			xsavec, xsaves, avx512dq, avx512bw, avx512vl,
! 			avx512ifma, avx512vbmi, clwb, pcommit, mwaitx, NULL);
      }
  
  done:
--- 977,983 ----
  			fxsr, xsave, xsaveopt, avx512f, avx512er,
  			avx512cd, avx512pf, prefetchwt1, clflushopt,
  			xsavec, xsaves, avx512dq, avx512bw, avx512vl,
! 			avx512ifma, avx512vbmi, clwb, mwaitx, NULL);
      }
  
  done:
diff -Nrcpad gcc-5.4.0/gcc/config/i386/gmm_malloc.h gcc-5.5.0/gcc/config/i386/gmm_malloc.h
*** gcc-5.4.0/gcc/config/i386/gmm_malloc.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/gmm_malloc.h	Thu Jun  1 21:51:51 2017
***************
*** 27,74 ****
  #include <stdlib.h>
  #include <errno.h>
  
! static __inline__ void* 
! _mm_malloc (size_t size, size_t align)
  {
!   void * malloc_ptr;
!   void * aligned_ptr;
  
    /* Error if align is not a power of two.  */
!   if (align & (align - 1))
      {
        errno = EINVAL;
!       return ((void*) 0);
      }
  
!   if (size == 0)
      return ((void *) 0);
  
   /* Assume malloc'd pointer is aligned at least to sizeof (void*).
      If necessary, add another sizeof (void*) to store the value
      returned by malloc. Effectively this enforces a minimum alignment
      of sizeof double. */     
!     if (align < 2 * sizeof (void *))
!       align = 2 * sizeof (void *);
  
!   malloc_ptr = malloc (size + align);
!   if (!malloc_ptr)
      return ((void *) 0);
  
    /* Align  We have at least sizeof (void *) space below malloc'd ptr. */
!   aligned_ptr = (void *) (((size_t) malloc_ptr + align)
! 			  & ~((size_t) (align) - 1));
  
    /* Store the original pointer just before p.  */	
!   ((void **) aligned_ptr) [-1] = malloc_ptr;
  
!   return aligned_ptr;
  }
  
  static __inline__ void
! _mm_free (void * aligned_ptr)
  {
!   if (aligned_ptr)
!     free (((void **) aligned_ptr) [-1]);
  }
  
  #endif /* _MM_MALLOC_H_INCLUDED */
--- 27,74 ----
  #include <stdlib.h>
  #include <errno.h>
  
! static __inline__ void * 
! _mm_malloc (size_t __size, size_t __align)
  {
!   void * __malloc_ptr;
!   void * __aligned_ptr;
  
    /* Error if align is not a power of two.  */
!   if (__align & (__align - 1))
      {
        errno = EINVAL;
!       return ((void *) 0);
      }
  
!   if (__size == 0)
      return ((void *) 0);
  
   /* Assume malloc'd pointer is aligned at least to sizeof (void*).
      If necessary, add another sizeof (void*) to store the value
      returned by malloc. Effectively this enforces a minimum alignment
      of sizeof double. */     
!     if (__align < 2 * sizeof (void *))
!       __align = 2 * sizeof (void *);
  
!   __malloc_ptr = malloc (__size + __align);
!   if (!__malloc_ptr)
      return ((void *) 0);
  
    /* Align  We have at least sizeof (void *) space below malloc'd ptr. */
!   __aligned_ptr = (void *) (((size_t) __malloc_ptr + __align)
! 			    & ~((size_t) (__align) - 1));
  
    /* Store the original pointer just before p.  */	
!   ((void **) __aligned_ptr)[-1] = __malloc_ptr;
  
!   return __aligned_ptr;
  }
  
  static __inline__ void
! _mm_free (void *__aligned_ptr)
  {
!   if (__aligned_ptr)
!     free (((void **) __aligned_ptr)[-1]);
  }
  
  #endif /* _MM_MALLOC_H_INCLUDED */
diff -Nrcpad gcc-5.4.0/gcc/config/i386/i386-builtin-types.def gcc-5.5.0/gcc/config/i386/i386-builtin-types.def
*** gcc-5.4.0/gcc/config/i386/i386-builtin-types.def	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/config/i386/i386-builtin-types.def	Fri Feb 17 16:35:37 2017
*************** DEF_FUNCTION_TYPE (V4SI, V4SI, PCINT, V2
*** 1117,1153 ****
  DEF_FUNCTION_TYPE (V4SI, V4SI, PCINT, V4DI, V4SI, INT)
  DEF_FUNCTION_TYPE (V8SI, V8SI, PCINT, V4DI, V8SI, INT)
  
- DEF_FUNCTION_TYPE (V16SF, V16SF, PCFLOAT, V16SI, HI, INT)
  DEF_FUNCTION_TYPE (V16SF, V16SF, PCFLOAT, V8DI, HI, INT)
- DEF_FUNCTION_TYPE (V8DF, V8DF, PCDOUBLE, V8SI, QI, INT)
  DEF_FUNCTION_TYPE (V8DF, V8DF, PCDOUBLE, V16SI, QI, INT)
- DEF_FUNCTION_TYPE (V8SF, V8SF, PCFLOAT, V8DI, QI, INT)
- DEF_FUNCTION_TYPE (V8DF, V8DF, PCDOUBLE, V8DI, QI, INT)
- DEF_FUNCTION_TYPE (V16SI, V16SI, PCINT, V16SI, HI, INT)
  DEF_FUNCTION_TYPE (V16SI, V16SI, PCINT, V8DI, HI, INT)
- DEF_FUNCTION_TYPE (V8DI, V8DI, PCINT64, V8SI, QI, INT)
  DEF_FUNCTION_TYPE (V8DI, V8DI, PCINT64, V16SI, QI, INT)
- DEF_FUNCTION_TYPE (V8SI, V8SI, PCINT, V8DI, QI, INT)
- DEF_FUNCTION_TYPE (V8DI, V8DI, PCINT64, V8DI, QI, INT)
- DEF_FUNCTION_TYPE (V2DF, V2DF, PCDOUBLE, V4SI, QI, INT)
- DEF_FUNCTION_TYPE (V4DF, V4DF, PCDOUBLE, V4SI, QI, INT)
  DEF_FUNCTION_TYPE (V4DF, V4DF, PCDOUBLE, V8SI, QI, INT)
- DEF_FUNCTION_TYPE (V2DF, V2DF, PCDOUBLE, V2DI, QI, INT)
- DEF_FUNCTION_TYPE (V4DF, V4DF, PCDOUBLE, V4DI, QI, INT)
- DEF_FUNCTION_TYPE (V4SF, V4SF, PCFLOAT, V4SI, QI, INT)
- DEF_FUNCTION_TYPE (V8SF, V8SF, PCFLOAT, V8SI, QI, INT)
- DEF_FUNCTION_TYPE (V4SF, V4SF, PCFLOAT, V2DI, QI, INT)
- DEF_FUNCTION_TYPE (V4SF, V4SF, PCFLOAT, V4DI, QI, INT)
  DEF_FUNCTION_TYPE (V8SF, V8SF, PCFLOAT, V4DI, QI, INT)
- DEF_FUNCTION_TYPE (V2DI, V2DI, PCINT64, V4SI, QI, INT)
- DEF_FUNCTION_TYPE (V4DI, V4DI, PCINT64, V4SI, QI, INT)
  DEF_FUNCTION_TYPE (V4DI, V4DI, PCINT64, V8SI, QI, INT)
- DEF_FUNCTION_TYPE (V2DI, V2DI, PCINT64, V2DI, QI, INT)
- DEF_FUNCTION_TYPE (V4DI, V4DI, PCINT64, V4DI, QI, INT)
- DEF_FUNCTION_TYPE (V4SI, V4SI, PCINT, V4SI, QI, INT)
- DEF_FUNCTION_TYPE (V8SI, V8SI, PCINT, V8SI, QI, INT)
- DEF_FUNCTION_TYPE (V4SI, V4SI, PCINT, V2DI, QI, INT)
- DEF_FUNCTION_TYPE (V4SI, V4SI, PCINT, V4DI, QI, INT)
  DEF_FUNCTION_TYPE (V8SI, V8SI, PCINT, V4DI, QI, INT)
  
  DEF_FUNCTION_TYPE (VOID, PFLOAT, HI, V16SI, V16SF, INT)
--- 1117,1129 ----
*************** DEF_FUNCTION_TYPE (VOID, PINT, QI, V8DI,
*** 1172,1184 ****
  DEF_FUNCTION_TYPE (VOID, PINT, QI, V4DI, V4SI, INT)
  DEF_FUNCTION_TYPE (VOID, PINT, QI, V2DI, V4SI, INT)
  DEF_FUNCTION_TYPE (VOID, PLONGLONG, QI, V8DI, V8DI, INT)
  
! DEF_FUNCTION_TYPE (VOID, QI, V8SI, PCINT64, INT, INT)
! DEF_FUNCTION_TYPE (VOID, PLONGLONG, QI, V4DI, V4DI, INT)
! DEF_FUNCTION_TYPE (VOID, PLONGLONG, QI, V2DI, V2DI, INT)
! DEF_FUNCTION_TYPE (VOID, HI, V16SI, PCINT, INT, INT)
! DEF_FUNCTION_TYPE (VOID, QI, V8DI, PCINT64, INT, INT)
! DEF_FUNCTION_TYPE (VOID, QI, V8DI, PCINT, INT, INT)
  
  DEF_FUNCTION_TYPE_ALIAS (V2DF_FTYPE_V2DF, ROUND)
  DEF_FUNCTION_TYPE_ALIAS (V4DF_FTYPE_V4DF, ROUND)
--- 1148,1209 ----
  DEF_FUNCTION_TYPE (VOID, PINT, QI, V4DI, V4SI, INT)
  DEF_FUNCTION_TYPE (VOID, PINT, QI, V2DI, V4SI, INT)
  DEF_FUNCTION_TYPE (VOID, PLONGLONG, QI, V8DI, V8DI, INT)
+ DEF_FUNCTION_TYPE (VOID, PFLOAT, HI, V8DI, V16SF, INT)
+ DEF_FUNCTION_TYPE (VOID, PDOUBLE, QI, V16SI, V8DF, INT)
+ DEF_FUNCTION_TYPE (VOID, PINT, HI, V8DI, V16SI, INT)
+ DEF_FUNCTION_TYPE (VOID, PLONGLONG, QI, V16SI, V8DI, INT)
  
! DEF_FUNCTION_TYPE (V16SF, V16SF, PCVOID, V16SI, HI, INT)
! DEF_FUNCTION_TYPE (V8DF, V8DF, PCVOID, V8SI, QI, INT)
! DEF_FUNCTION_TYPE (V8SF, V8SF, PCVOID, V8DI, QI, INT)
! DEF_FUNCTION_TYPE (V8DF, V8DF, PCVOID, V8DI, QI, INT)
! DEF_FUNCTION_TYPE (V16SI, V16SI, PCVOID, V16SI, HI, INT)
! DEF_FUNCTION_TYPE (V8DI, V8DI, PCVOID, V8SI, QI, INT)
! DEF_FUNCTION_TYPE (V8SI, V8SI, PCVOID, V8DI, QI, INT)
! DEF_FUNCTION_TYPE (V8DI, V8DI, PCVOID, V8DI, QI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, HI, V16SI, V16SF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V8SI, V8DF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V8DI, V8SF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V8DI, V8DF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, HI, V16SI, V16SI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V8SI, V8DI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V8DI, V8SI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V8DI, V8DI, INT)
! DEF_FUNCTION_TYPE (V2DF, V2DF, PCVOID, V4SI, QI, INT)
! DEF_FUNCTION_TYPE (V4DF, V4DF, PCVOID, V4SI, QI, INT)
! DEF_FUNCTION_TYPE (V2DF, V2DF, PCVOID, V2DI, QI, INT)
! DEF_FUNCTION_TYPE (V4DF, V4DF, PCVOID, V4DI, QI, INT)
! DEF_FUNCTION_TYPE (V4SF, V4SF, PCVOID, V4SI, QI, INT)
! DEF_FUNCTION_TYPE (V8SF, V8SF, PCVOID, V8SI, QI, INT)
! DEF_FUNCTION_TYPE (V4SF, V4SF, PCVOID, V2DI, QI, INT)
! DEF_FUNCTION_TYPE (V4SF, V4SF, PCVOID, V4DI, QI, INT)
! DEF_FUNCTION_TYPE (V2DI, V2DI, PCVOID, V4SI, QI, INT)
! DEF_FUNCTION_TYPE (V4DI, V4DI, PCVOID, V4SI, QI, INT)
! DEF_FUNCTION_TYPE (V2DI, V2DI, PCVOID, V2DI, QI, INT)
! DEF_FUNCTION_TYPE (V4DI, V4DI, PCVOID, V4DI, QI, INT)
! DEF_FUNCTION_TYPE (V4SI, V4SI, PCVOID, V4SI, QI, INT)
! DEF_FUNCTION_TYPE (V8SI, V8SI, PCVOID, V8SI, QI, INT)
! DEF_FUNCTION_TYPE (V4SI, V4SI, PCVOID, V2DI, QI, INT)
! DEF_FUNCTION_TYPE (V4SI, V4SI, PCVOID, V4DI, QI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V8SI, V8SF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4SI, V4SF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4SI, V4DF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4SI, V2DF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4DI, V4SF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V2DI, V4SF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4DI, V4DF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V2DI, V2DF, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V8SI, V8SI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4SI, V4SI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4SI, V4DI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4SI, V2DI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4DI, V4SI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V2DI, V4SI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V4DI, V4DI, INT)
! DEF_FUNCTION_TYPE (VOID, PVOID, QI, V2DI, V2DI, INT)
! DEF_FUNCTION_TYPE (VOID, QI, V8SI, PCVOID, INT, INT)
! DEF_FUNCTION_TYPE (VOID, HI, V16SI, PCVOID, INT, INT)
! DEF_FUNCTION_TYPE (VOID, QI, V8DI, PCVOID, INT, INT)
  
  DEF_FUNCTION_TYPE_ALIAS (V2DF_FTYPE_V2DF, ROUND)
  DEF_FUNCTION_TYPE_ALIAS (V4DF_FTYPE_V4DF, ROUND)
diff -Nrcpad gcc-5.4.0/gcc/config/i386/i386-c.c gcc-5.5.0/gcc/config/i386/i386-c.c
*** gcc-5.4.0/gcc/config/i386/i386-c.c	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/config/i386/i386-c.c	Thu Oct 13 21:19:00 2016
*************** ix86_target_macros_internal (HOST_WIDE_I
*** 428,435 ****
      def_or_undef (parse_in, "__XSAVES__");
    if (isa_flag & OPTION_MASK_ISA_MPX)
      def_or_undef (parse_in, "__MPX__");
-   if (isa_flag & OPTION_MASK_ISA_PCOMMIT)
-     def_or_undef (parse_in, "__PCOMMIT__");
    if (isa_flag & OPTION_MASK_ISA_CLWB)
      def_or_undef (parse_in, "__CLWB__");
    if (isa_flag & OPTION_MASK_ISA_MWAITX)
--- 428,433 ----
diff -Nrcpad gcc-5.4.0/gcc/config/i386/i386.c gcc-5.5.0/gcc/config/i386/i386.c
*** gcc-5.4.0/gcc/config/i386/i386.c	Fri May 20 13:24:29 2016
--- gcc-5.5.0/gcc/config/i386/i386.c	Mon Oct  2 18:44:07 2017
*************** ix86_target_string (HOST_WIDE_INT isa, i
*** 2678,2684 ****
      { "-mxsaves",	OPTION_MASK_ISA_XSAVES },
      { "-mmpx",          OPTION_MASK_ISA_MPX },
      { "-mclwb",		OPTION_MASK_ISA_CLWB },
-     { "-mpcommit",	OPTION_MASK_ISA_PCOMMIT },
      { "-mmwaitx",	OPTION_MASK_ISA_MWAITX  },
    };
  
--- 2678,2683 ----
*************** ix86_option_override_internal (bool main
*** 3192,3199 ****
  #define PTA_AVX512IFMA		(HOST_WIDE_INT_1 << 53)
  #define PTA_AVX512VBMI		(HOST_WIDE_INT_1 << 54)
  #define PTA_CLWB		(HOST_WIDE_INT_1 << 55)
! #define PTA_PCOMMIT		(HOST_WIDE_INT_1 << 56)
! #define PTA_MWAITX		(HOST_WIDE_INT_1 << 57)
  
  #define PTA_CORE2 \
    (PTA_64BIT | PTA_MMX | PTA_SSE | PTA_SSE2 | PTA_SSE3 | PTA_SSSE3 \
--- 3191,3197 ----
  #define PTA_AVX512IFMA		(HOST_WIDE_INT_1 << 53)
  #define PTA_AVX512VBMI		(HOST_WIDE_INT_1 << 54)
  #define PTA_CLWB		(HOST_WIDE_INT_1 << 55)
! #define PTA_MWAITX		(HOST_WIDE_INT_1 << 56)
  
  #define PTA_CORE2 \
    (PTA_64BIT | PTA_MMX | PTA_SSE | PTA_SSE2 | PTA_SSE3 | PTA_SSSE3 \
*************** ix86_option_override_internal (bool main
*** 3756,3764 ****
  	if (processor_alias_table[i].flags & PTA_PREFETCHWT1
  	    && !(opts->x_ix86_isa_flags_explicit & OPTION_MASK_ISA_PREFETCHWT1))
  	  opts->x_ix86_isa_flags |= OPTION_MASK_ISA_PREFETCHWT1;
- 	if (processor_alias_table[i].flags & PTA_PCOMMIT
- 	    && !(opts->x_ix86_isa_flags_explicit & OPTION_MASK_ISA_PCOMMIT))
- 	  opts->x_ix86_isa_flags |= OPTION_MASK_ISA_PCOMMIT;
  	if (processor_alias_table[i].flags & PTA_CLWB
  	    && !(opts->x_ix86_isa_flags_explicit & OPTION_MASK_ISA_CLWB))
  	  opts->x_ix86_isa_flags |= OPTION_MASK_ISA_CLWB;
--- 3754,3759 ----
*************** ix86_option_override_internal (bool main
*** 4020,4025 ****
--- 4015,4026 ----
      opts->x_ix86_isa_flags
        |= OPTION_MASK_ISA_LZCNT & ~opts->x_ix86_isa_flags_explicit;
  
+   /* Disable BMI, BMI2 and TBM instructions for -m16.  */
+   if (TARGET_16BIT_P(opts->x_ix86_isa_flags))
+     opts->x_ix86_isa_flags
+       &= ~((OPTION_MASK_ISA_BMI | OPTION_MASK_ISA_BMI2 | OPTION_MASK_ISA_TBM)
+ 	   & ~opts->x_ix86_isa_flags_explicit);
+ 
    /* Validate -mpreferred-stack-boundary= value or default it to
       PREFERRED_STACK_BOUNDARY_DEFAULT.  */
    ix86_preferred_stack_boundary = PREFERRED_STACK_BOUNDARY_DEFAULT;
*************** ix86_option_override_internal (bool main
*** 4356,4367 ****
    gcc_assert ((opts->x_target_flags & MASK_LONG_DOUBLE_64) == 0
  	      || (opts->x_target_flags & MASK_LONG_DOUBLE_128) == 0);
  
-   /* Save the initial options in case the user does function specific
-      options.  */
-   if (main_args_p)
-     target_option_default_node = target_option_current_node
-       = build_target_option_node (opts);
- 
    /* Handle stack protector */
    if (!opts_set->x_ix86_stack_protector_guard)
      opts->x_ix86_stack_protector_guard
--- 4357,4362 ----
*************** ix86_option_override_internal (bool main
*** 4381,4386 ****
--- 4376,4387 ----
        ix86_parse_stringop_strategy_string (str, true);
        free (str);
      }
+ 
+   /* Save the initial options in case the user does function specific
+      options.  */
+   if (main_args_p)
+     target_option_default_node = target_option_current_node
+       = build_target_option_node (opts);
  }
  
  /* Implement the TARGET_OPTION_OVERRIDE hook.  */
*************** ix86_valid_target_attribute_inner_p (tre
*** 4772,4778 ****
      IX86_ATTR_ISA ("avx512vbmi",	OPT_mavx512vbmi),
      IX86_ATTR_ISA ("avx512ifma",	OPT_mavx512ifma),
      IX86_ATTR_ISA ("clwb",	OPT_mclwb),
-     IX86_ATTR_ISA ("pcommit",	OPT_mpcommit),
      IX86_ATTR_ISA ("mwaitx",	OPT_mmwaitx),
  
      /* enum options */
--- 4773,4778 ----
*************** ix86_expand_split_stack_prologue (void)
*** 12704,12709 ****
--- 12704,12711 ----
  				GEN_INT (UNITS_PER_WORD), constm1_rtx,
  				NULL_RTX, false);
    add_function_usage_to (call_insn, call_fusage);
+   /* Indicate that this function can't jump to non-local gotos.  */
+   make_reg_eh_region_note_nothrow_nononlocal (as_a <rtx_insn *> (call_insn));
  
    /* In order to make call/return prediction work right, we now need
       to execute a return instruction.  See
*************** legitimize_tls_address (rtx x, enum tls_
*** 14292,14298 ****
  	  base = get_thread_pointer (tp_mode,
  				     for_mov || !TARGET_TLS_DIRECT_SEG_REFS);
  	  off = force_reg (tp_mode, off);
! 	  return gen_rtx_PLUS (tp_mode, base, off);
  	}
        else
  	{
--- 14294,14302 ----
  	  base = get_thread_pointer (tp_mode,
  				     for_mov || !TARGET_TLS_DIRECT_SEG_REFS);
  	  off = force_reg (tp_mode, off);
! 	  dest = gen_rtx_PLUS (tp_mode, base, off);
! 	  if (tp_mode != Pmode)
! 	    dest = convert_to_mode (Pmode, dest, 1);
  	}
        else
  	{
*************** ix86_print_operand (FILE *file, rtx x, i
*** 15585,15592 ****
  	      break;
  
  	    default:
! 	      output_operand_lossage
! 		("invalid operand size for operand code 'O'");
  	      return;
  	    }
  
--- 15589,15596 ----
  	      break;
  
  	    default:
! 	      output_operand_lossage ("invalid operand size for operand "
! 				      "code 'O'");
  	      return;
  	    }
  
*************** ix86_print_operand (FILE *file, rtx x, i
*** 15620,15634 ****
  		  return;
  
  		default:
! 		  output_operand_lossage
! 		    ("invalid operand size for operand code 'z'");
  		  return;
  		}
  	    }
  
  	  if (GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
! 	    warning
! 	      (0, "non-integer operand used with operand code 'z'");
  	  /* FALLTHRU */
  
  	case 'Z':
--- 15624,15637 ----
  		  return;
  
  		default:
! 		  output_operand_lossage ("invalid operand size for operand "
! 					  "code 'z'");
  		  return;
  		}
  	    }
  
  	  if (GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
! 	    warning (0, "non-integer operand used with operand code 'z'");
  	  /* FALLTHRU */
  
  	case 'Z':
*************** ix86_print_operand (FILE *file, rtx x, i
*** 15690,15702 ****
  	    }
  	  else
  	    {
! 	      output_operand_lossage
! 		("invalid operand type used with operand code 'Z'");
  	      return;
  	    }
  
! 	  output_operand_lossage
! 	    ("invalid operand size for operand code 'Z'");
  	  return;
  
  	case 'd':
--- 15693,15704 ----
  	    }
  	  else
  	    {
! 	      output_operand_lossage ("invalid operand type used with "
! 				      "operand code 'Z'");
  	      return;
  	    }
  
! 	  output_operand_lossage ("invalid operand size for operand code 'Z'");
  	  return;
  
  	case 'd':
*************** ix86_print_operand (FILE *file, rtx x, i
*** 15888,15894 ****
  	  break;
  
  	case 'K':
! 	  gcc_assert (CONST_INT_P (x));
  
  	  if (INTVAL (x) & IX86_HLE_ACQUIRE)
  #ifdef HAVE_AS_IX86_HLE
--- 15890,15901 ----
  	  break;
  
  	case 'K':
! 	  if (!CONST_INT_P (x))
! 	    {
! 	      output_operand_lossage ("operand is not an integer, invalid "
! 				      "operand code 'K'");
! 	      return;
! 	    }
  
  	  if (INTVAL (x) & IX86_HLE_ACQUIRE)
  #ifdef HAVE_AS_IX86_HLE
*************** ix86_print_operand (FILE *file, rtx x, i
*** 15911,15918 ****
  	  return;
  
  	case 'r':
! 	  gcc_assert (CONST_INT_P (x));
! 	  gcc_assert (INTVAL (x) == ROUND_SAE);
  
  	  if (ASSEMBLER_DIALECT == ASM_INTEL)
  	    fputs (", ", file);
--- 15918,15929 ----
  	  return;
  
  	case 'r':
! 	  if (!CONST_INT_P (x) || INTVAL (x) != ROUND_SAE)
! 	    {
! 	      output_operand_lossage ("operand is not a specific integer, "
! 				      "invalid operand code 'r'");
! 	      return;
! 	    }
  
  	  if (ASSEMBLER_DIALECT == ASM_INTEL)
  	    fputs (", ", file);
*************** ix86_print_operand (FILE *file, rtx x, i
*** 15925,15931 ****
  	  return;
  
  	case 'R':
! 	  gcc_assert (CONST_INT_P (x));
  
  	  if (ASSEMBLER_DIALECT == ASM_INTEL)
  	    fputs (", ", file);
--- 15936,15947 ----
  	  return;
  
  	case 'R':
! 	  if (!CONST_INT_P (x))
! 	    {
! 	      output_operand_lossage ("operand is not an integer, invalid "
! 				      "operand code 'R'");
! 	      return;
! 	    }
  
  	  if (ASSEMBLER_DIALECT == ASM_INTEL)
  	    fputs (", ", file);
*************** ix86_print_operand (FILE *file, rtx x, i
*** 15945,15951 ****
  	      fputs ("{rz-sae}", file);
  	      break;
  	    default:
! 	      gcc_unreachable ();
  	    }
  
  	  if (ASSEMBLER_DIALECT == ASM_ATT)
--- 15961,15968 ----
  	      fputs ("{rz-sae}", file);
  	      break;
  	    default:
! 	      output_operand_lossage ("operand is not a specific integer, "
! 				      "invalid operand code 'R'");
  	    }
  
  	  if (ASSEMBLER_DIALECT == ASM_ATT)
*************** ix86_print_operand (FILE *file, rtx x, i
*** 16040,16046 ****
  	  return;
  
  	default:
! 	    output_operand_lossage ("invalid operand code '%c'", code);
  	}
      }
  
--- 16057,16063 ----
  	  return;
  
  	default:
! 	  output_operand_lossage ("invalid operand code '%c'", code);
  	}
      }
  
*************** ix86_expand_vector_move (machine_mode mo
*** 17599,17610 ****
       of the register, once we have that information we may be able
       to handle some of them more efficiently.  */
    if (can_create_pseudo_p ()
-       && register_operand (op0, mode)
        && (CONSTANT_P (op1)
  	  || (GET_CODE (op1) == SUBREG
  	      && CONSTANT_P (SUBREG_REG (op1))))
!       && !standard_sse_constant_p (op1))
!     op1 = validize_mem (force_const_mem (mode, op1));
  
    /* We need to check memory alignment for SSE mode since attribute
       can make operands unaligned.  */
--- 17616,17644 ----
       of the register, once we have that information we may be able
       to handle some of them more efficiently.  */
    if (can_create_pseudo_p ()
        && (CONSTANT_P (op1)
  	  || (GET_CODE (op1) == SUBREG
  	      && CONSTANT_P (SUBREG_REG (op1))))
!       && ((register_operand (op0, mode)
! 	   && !standard_sse_constant_p (op1))
! 	  /* ix86_expand_vector_move_misalign() does not like constants.  */
! 	  || (SSE_REG_MODE_P (mode)
! 	      && MEM_P (op0)
! 	      && MEM_ALIGN (op0) < align)))
!     {
!       if (SUBREG_P (op1))
! 	{
! 	  machine_mode imode = GET_MODE (SUBREG_REG (op1));
! 	  rtx r = force_const_mem (imode, SUBREG_REG (op1));
! 	  if (r)
! 	    r = validize_mem (r);
! 	  else
! 	    r = force_reg (imode, SUBREG_REG (op1));
! 	  op1 = simplify_gen_subreg (mode, r, imode, SUBREG_BYTE (op1));
! 	}
!       else
! 	op1 = validize_mem (force_const_mem (mode, op1));
!     }
  
    /* We need to check memory alignment for SSE mode since attribute
       can make operands unaligned.  */
*************** ix86_expand_vector_move (machine_mode mo
*** 17615,17627 ****
      {
        rtx tmp[2];
  
!       /* ix86_expand_vector_move_misalign() does not like constants ... */
!       if (CONSTANT_P (op1)
! 	  || (GET_CODE (op1) == SUBREG
! 	      && CONSTANT_P (SUBREG_REG (op1))))
! 	op1 = validize_mem (force_const_mem (mode, op1));
! 
!       /* ... nor both arguments in memory.  */
        if (!register_operand (op0, mode)
  	  && !register_operand (op1, mode))
  	op1 = force_reg (mode, op1);
--- 17649,17656 ----
      {
        rtx tmp[2];
  
!       /* ix86_expand_vector_move_misalign() does not like both
! 	 arguments in memory.  */
        if (!register_operand (op0, mode)
  	  && !register_operand (op1, mode))
  	op1 = force_reg (mode, op1);
*************** ix86_avx256_split_vector_move_misalign (
*** 17707,17713 ****
  	  m = adjust_address (op0, mode, 0);
  	  emit_insn (extract (m, op1, const0_rtx));
  	  m = adjust_address (op0, mode, 16);
! 	  emit_insn (extract (m, op1, const1_rtx));
  	}
        else
  	emit_insn (store_unaligned (op0, op1));
--- 17736,17742 ----
  	  m = adjust_address (op0, mode, 0);
  	  emit_insn (extract (m, op1, const0_rtx));
  	  m = adjust_address (op0, mode, 16);
! 	  emit_insn (extract (m, copy_rtx (op1), const1_rtx));
  	}
        else
  	emit_insn (store_unaligned (op0, op1));
*************** ix86_expand_vector_move_misalign (machin
*** 18015,18021 ****
  	      m = adjust_address (op0, V2SFmode, 0);
  	      emit_insn (gen_sse_storelps (m, op1));
  	      m = adjust_address (op0, V2SFmode, 8);
! 	      emit_insn (gen_sse_storehps (m, op1));
  	    }
  	}
      }
--- 18044,18050 ----
  	      m = adjust_address (op0, V2SFmode, 0);
  	      emit_insn (gen_sse_storelps (m, op1));
  	      m = adjust_address (op0, V2SFmode, 8);
! 	      emit_insn (gen_sse_storehps (m, copy_rtx (op1)));
  	    }
  	}
      }
*************** ix86_split_idivmod (machine_mode mode, r
*** 18409,18421 ****
  
    if (signed_p)
      {
!       div = gen_rtx_DIV (SImode, operands[2], operands[3]);
!       mod = gen_rtx_MOD (SImode, operands[2], operands[3]);
      }
    else
      {
!       div = gen_rtx_UDIV (SImode, operands[2], operands[3]);
!       mod = gen_rtx_UMOD (SImode, operands[2], operands[3]);
      }
  
    /* Extract remainder from AH.  */
--- 18438,18450 ----
  
    if (signed_p)
      {
!       div = gen_rtx_DIV (mode, operands[2], operands[3]);
!       mod = gen_rtx_MOD (mode, operands[2], operands[3]);
      }
    else
      {
!       div = gen_rtx_UDIV (mode, operands[2], operands[3]);
!       mod = gen_rtx_UMOD (mode, operands[2], operands[3]);
      }
  
    /* Extract remainder from AH.  */
*************** ix86_expand_sse_cmp (rtx dest, enum rtx_
*** 21527,21532 ****
--- 21556,21562 ----
      cmp_op1 = force_reg (cmp_ops_mode, cmp_op1);
  
    if (optimize
+       || (maskcmp && cmp_mode != mode)
        || reg_overlap_mentioned_p (dest, op_true)
        || reg_overlap_mentioned_p (dest, op_false))
      dest = gen_reg_rtx (maskcmp ? cmp_mode : mode);
*************** memory_address_length (rtx addr, bool le
*** 26077,26083 ****
    else if (disp && !base && !index)
      {
        len += 4;
!       if (rip_relative_addr_p (&parts))
  	len++;
      }
    else
--- 26107,26113 ----
    else if (disp && !base && !index)
      {
        len += 4;
!       if (!rip_relative_addr_p (&parts))
  	len++;
      }
    else
*************** ix86_local_alignment (tree exp, machine_
*** 27678,27684 ****
  		  != TYPE_MAIN_VARIANT (va_list_type_node)))
  	  && TYPE_SIZE (type)
  	  && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
! 	  && wi::geu_p (TYPE_SIZE (type), 16)
  	  && align < 128)
  	return 128;
      }
--- 27708,27714 ----
  		  != TYPE_MAIN_VARIANT (va_list_type_node)))
  	  && TYPE_SIZE (type)
  	  && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
! 	  && wi::geu_p (TYPE_SIZE (type), 128)
  	  && align < 128)
  	return 128;
      }
*************** enum ix86_builtins
*** 30492,30500 ****
    /* CLWB instructions.  */
    IX86_BUILTIN_CLWB,
  
-   /* PCOMMIT instructions.  */
-   IX86_BUILTIN_PCOMMIT,
- 
    /* CLFLUSHOPT instructions.  */
    IX86_BUILTIN_CLFLUSHOPT,
  
--- 30522,30527 ----
*************** static const struct builtin_description
*** 30994,31002 ****
  /* Special builtins with variable number of arguments.  */
  static const struct builtin_description bdesc_special_args[] =
  {
!   { ~OPTION_MASK_ISA_64BIT, CODE_FOR_nothing, "__builtin_ia32_rdtsc", IX86_BUILTIN_RDTSC, UNKNOWN, (int) UINT64_FTYPE_VOID },
!   { ~OPTION_MASK_ISA_64BIT, CODE_FOR_nothing, "__builtin_ia32_rdtscp", IX86_BUILTIN_RDTSCP, UNKNOWN, (int) UINT64_FTYPE_PUNSIGNED },
!   { ~OPTION_MASK_ISA_64BIT, CODE_FOR_pause, "__builtin_ia32_pause", IX86_BUILTIN_PAUSE, UNKNOWN, (int) VOID_FTYPE_VOID },
  
    /* 80387 (for use internally for atomic compound assignment).  */
    { 0, CODE_FOR_fnstenv, "__builtin_ia32_fnstenv", IX86_BUILTIN_FNSTENV, UNKNOWN, (int) VOID_FTYPE_PVOID },
--- 31021,31029 ----
  /* Special builtins with variable number of arguments.  */
  static const struct builtin_description bdesc_special_args[] =
  {
!   { 0, CODE_FOR_nothing, "__builtin_ia32_rdtsc", IX86_BUILTIN_RDTSC, UNKNOWN, (int) UINT64_FTYPE_VOID },
!   { 0, CODE_FOR_nothing, "__builtin_ia32_rdtscp", IX86_BUILTIN_RDTSCP, UNKNOWN, (int) UINT64_FTYPE_PUNSIGNED },
!   { 0, CODE_FOR_pause, "__builtin_ia32_pause", IX86_BUILTIN_PAUSE, UNKNOWN, (int) VOID_FTYPE_VOID },
  
    /* 80387 (for use internally for atomic compound assignment).  */
    { 0, CODE_FOR_fnstenv, "__builtin_ia32_fnstenv", IX86_BUILTIN_FNSTENV, UNKNOWN, (int) VOID_FTYPE_PVOID },
*************** static const struct builtin_description
*** 31282,31302 ****
    { OPTION_MASK_ISA_AVX512VL, CODE_FOR_avx512vl_ss_truncatev4siv4hi2_mask_store, "__builtin_ia32_pmovsdw128mem_mask", IX86_BUILTIN_PMOVSDW128_MEM, UNKNOWN, (int) VOID_FTYPE_PV8HI_V4SI_QI },
    { OPTION_MASK_ISA_AVX512VL, CODE_FOR_avx512vl_us_truncatev8siv8hi2_mask_store, "__builtin_ia32_pmovusdw256mem_mask", IX86_BUILTIN_PMOVUSDW256_MEM, UNKNOWN, (int) VOID_FTYPE_PV8HI_V8SI_QI },
    { OPTION_MASK_ISA_AVX512VL, CODE_FOR_avx512vl_us_truncatev4siv4hi2_mask_store, "__builtin_ia32_pmovusdw128mem_mask", IX86_BUILTIN_PMOVUSDW128_MEM, UNKNOWN, (int) VOID_FTYPE_PV8HI_V4SI_QI },
- 
-   /* PCOMMIT.  */
-   { OPTION_MASK_ISA_PCOMMIT, CODE_FOR_pcommit, "__builtin_ia32_pcommit", IX86_BUILTIN_PCOMMIT, UNKNOWN, (int) VOID_FTYPE_VOID },
  };
  
  /* Builtins with variable number of arguments.  */
  static const struct builtin_description bdesc_args[] =
  {
!   { ~OPTION_MASK_ISA_64BIT, CODE_FOR_bsr, "__builtin_ia32_bsrsi", IX86_BUILTIN_BSRSI, UNKNOWN, (int) INT_FTYPE_INT },
    { OPTION_MASK_ISA_64BIT, CODE_FOR_bsr_rex64, "__builtin_ia32_bsrdi", IX86_BUILTIN_BSRDI, UNKNOWN, (int) INT64_FTYPE_INT64 },
!   { ~OPTION_MASK_ISA_64BIT, CODE_FOR_nothing, "__builtin_ia32_rdpmc", IX86_BUILTIN_RDPMC, UNKNOWN, (int) UINT64_FTYPE_INT },
!   { ~OPTION_MASK_ISA_64BIT, CODE_FOR_rotlqi3, "__builtin_ia32_rolqi", IX86_BUILTIN_ROLQI, UNKNOWN, (int) UINT8_FTYPE_UINT8_INT },
!   { ~OPTION_MASK_ISA_64BIT, CODE_FOR_rotlhi3, "__builtin_ia32_rolhi", IX86_BUILTIN_ROLHI, UNKNOWN, (int) UINT16_FTYPE_UINT16_INT },
!   { ~OPTION_MASK_ISA_64BIT, CODE_FOR_rotrqi3, "__builtin_ia32_rorqi", IX86_BUILTIN_RORQI, UNKNOWN, (int) UINT8_FTYPE_UINT8_INT },
!   { ~OPTION_MASK_ISA_64BIT, CODE_FOR_rotrhi3, "__builtin_ia32_rorhi", IX86_BUILTIN_RORHI, UNKNOWN, (int) UINT16_FTYPE_UINT16_INT },
  
    /* MMX */
    { OPTION_MASK_ISA_MMX, CODE_FOR_mmx_addv8qi3, "__builtin_ia32_paddb", IX86_BUILTIN_PADDB, UNKNOWN, (int) V8QI_FTYPE_V8QI_V8QI },
--- 31309,31326 ----
    { OPTION_MASK_ISA_AVX512VL, CODE_FOR_avx512vl_ss_truncatev4siv4hi2_mask_store, "__builtin_ia32_pmovsdw128mem_mask", IX86_BUILTIN_PMOVSDW128_MEM, UNKNOWN, (int) VOID_FTYPE_PV8HI_V4SI_QI },
    { OPTION_MASK_ISA_AVX512VL, CODE_FOR_avx512vl_us_truncatev8siv8hi2_mask_store, "__builtin_ia32_pmovusdw256mem_mask", IX86_BUILTIN_PMOVUSDW256_MEM, UNKNOWN, (int) VOID_FTYPE_PV8HI_V8SI_QI },
    { OPTION_MASK_ISA_AVX512VL, CODE_FOR_avx512vl_us_truncatev4siv4hi2_mask_store, "__builtin_ia32_pmovusdw128mem_mask", IX86_BUILTIN_PMOVUSDW128_MEM, UNKNOWN, (int) VOID_FTYPE_PV8HI_V4SI_QI },
  };
  
  /* Builtins with variable number of arguments.  */
  static const struct builtin_description bdesc_args[] =
  {
!   { 0, CODE_FOR_bsr, "__builtin_ia32_bsrsi", IX86_BUILTIN_BSRSI, UNKNOWN, (int) INT_FTYPE_INT },
    { OPTION_MASK_ISA_64BIT, CODE_FOR_bsr_rex64, "__builtin_ia32_bsrdi", IX86_BUILTIN_BSRDI, UNKNOWN, (int) INT64_FTYPE_INT64 },
!   { 0, CODE_FOR_nothing, "__builtin_ia32_rdpmc", IX86_BUILTIN_RDPMC, UNKNOWN, (int) UINT64_FTYPE_INT },
!   { 0, CODE_FOR_rotlqi3, "__builtin_ia32_rolqi", IX86_BUILTIN_ROLQI, UNKNOWN, (int) UINT8_FTYPE_UINT8_INT },
!   { 0, CODE_FOR_rotlhi3, "__builtin_ia32_rolhi", IX86_BUILTIN_ROLHI, UNKNOWN, (int) UINT16_FTYPE_UINT16_INT },
!   { 0, CODE_FOR_rotrqi3, "__builtin_ia32_rorqi", IX86_BUILTIN_RORQI, UNKNOWN, (int) UINT8_FTYPE_UINT8_INT },
!   { 0, CODE_FOR_rotrhi3, "__builtin_ia32_rorhi", IX86_BUILTIN_RORHI, UNKNOWN, (int) UINT16_FTYPE_UINT16_INT },
  
    /* MMX */
    { OPTION_MASK_ISA_MMX, CODE_FOR_mmx_addv8qi3, "__builtin_ia32_paddb", IX86_BUILTIN_PADDB, UNKNOWN, (int) V8QI_FTYPE_V8QI_V8QI },
*************** ix86_init_mmx_sse_builtins (void)
*** 34018,34052 ****
  
    /* AVX512F */
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gathersiv16sf",
! 	       V16SF_FTYPE_V16SF_PCFLOAT_V16SI_HI_INT,
  	       IX86_BUILTIN_GATHER3SIV16SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gathersiv8df",
! 	       V8DF_FTYPE_V8DF_PCDOUBLE_V8SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV8DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatherdiv16sf",
! 	       V8SF_FTYPE_V8SF_PCFLOAT_V8DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV16SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatherdiv8df",
! 	       V8DF_FTYPE_V8DF_PCDOUBLE_V8DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV8DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gathersiv16si",
! 	       V16SI_FTYPE_V16SI_PCINT_V16SI_HI_INT,
  	       IX86_BUILTIN_GATHER3SIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gathersiv8di",
! 	       V8DI_FTYPE_V8DI_PCINT64_V8SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV8DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatherdiv16si",
! 	       V8SI_FTYPE_V8SI_PCINT_V8DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatherdiv8di",
! 	       V8DI_FTYPE_V8DI_PCINT64_V8DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV8DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatheraltsiv8df ",
--- 34042,34076 ----
  
    /* AVX512F */
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gathersiv16sf",
! 	       V16SF_FTYPE_V16SF_PCVOID_V16SI_HI_INT,
  	       IX86_BUILTIN_GATHER3SIV16SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gathersiv8df",
! 	       V8DF_FTYPE_V8DF_PCVOID_V8SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV8DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatherdiv16sf",
! 	       V8SF_FTYPE_V8SF_PCVOID_V8DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV16SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatherdiv8df",
! 	       V8DF_FTYPE_V8DF_PCVOID_V8DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV8DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gathersiv16si",
! 	       V16SI_FTYPE_V16SI_PCVOID_V16SI_HI_INT,
  	       IX86_BUILTIN_GATHER3SIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gathersiv8di",
! 	       V8DI_FTYPE_V8DI_PCVOID_V8SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV8DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatherdiv16si",
! 	       V8SI_FTYPE_V8SI_PCVOID_V8DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatherdiv8di",
! 	       V8DI_FTYPE_V8DI_PCVOID_V8DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV8DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_gatheraltsiv8df ",
*************** ix86_init_mmx_sse_builtins (void)
*** 34066,34165 ****
  	       IX86_BUILTIN_GATHER3ALTDIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scattersiv16sf",
! 	       VOID_FTYPE_PFLOAT_HI_V16SI_V16SF_INT,
  	       IX86_BUILTIN_SCATTERSIV16SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scattersiv8df",
! 	       VOID_FTYPE_PDOUBLE_QI_V8SI_V8DF_INT,
  	       IX86_BUILTIN_SCATTERSIV8DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scatterdiv16sf",
! 	       VOID_FTYPE_PFLOAT_QI_V8DI_V8SF_INT,
  	       IX86_BUILTIN_SCATTERDIV16SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scatterdiv8df",
! 	       VOID_FTYPE_PDOUBLE_QI_V8DI_V8DF_INT,
  	       IX86_BUILTIN_SCATTERDIV8DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scattersiv16si",
! 	       VOID_FTYPE_PINT_HI_V16SI_V16SI_INT,
  	       IX86_BUILTIN_SCATTERSIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scattersiv8di",
! 	       VOID_FTYPE_PLONGLONG_QI_V8SI_V8DI_INT,
  	       IX86_BUILTIN_SCATTERSIV8DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scatterdiv16si",
! 	       VOID_FTYPE_PINT_QI_V8DI_V8SI_INT,
  	       IX86_BUILTIN_SCATTERDIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scatterdiv8di",
! 	       VOID_FTYPE_PLONGLONG_QI_V8DI_V8DI_INT,
  	       IX86_BUILTIN_SCATTERDIV8DI);
  
    /* AVX512VL */
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv2df",
! 	       V2DF_FTYPE_V2DF_PCDOUBLE_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV2DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv4df",
! 	       V4DF_FTYPE_V4DF_PCDOUBLE_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV4DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div2df",
! 	       V2DF_FTYPE_V2DF_PCDOUBLE_V2DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV2DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div4df",
! 	       V4DF_FTYPE_V4DF_PCDOUBLE_V4DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV4DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv4sf",
! 	       V4SF_FTYPE_V4SF_PCFLOAT_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV4SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv8sf",
! 	       V8SF_FTYPE_V8SF_PCFLOAT_V8SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV8SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div4sf",
! 	       V4SF_FTYPE_V4SF_PCFLOAT_V2DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV4SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div8sf",
! 	       V4SF_FTYPE_V4SF_PCFLOAT_V4DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV8SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv2di",
! 	       V2DI_FTYPE_V2DI_PCINT64_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV2DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv4di",
! 	       V4DI_FTYPE_V4DI_PCINT64_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV4DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div2di",
! 	       V2DI_FTYPE_V2DI_PCINT64_V2DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV2DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div4di",
! 	       V4DI_FTYPE_V4DI_PCINT64_V4DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV4DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv4si",
! 	       V4SI_FTYPE_V4SI_PCINT_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV4SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv8si",
! 	       V8SI_FTYPE_V8SI_PCINT_V8SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div4si",
! 	       V4SI_FTYPE_V4SI_PCINT_V2DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV4SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div8si",
! 	       V4SI_FTYPE_V4SI_PCINT_V4DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3altsiv4df ",
--- 34090,34189 ----
  	       IX86_BUILTIN_GATHER3ALTDIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scattersiv16sf",
! 	       VOID_FTYPE_PVOID_HI_V16SI_V16SF_INT,
  	       IX86_BUILTIN_SCATTERSIV16SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scattersiv8df",
! 	       VOID_FTYPE_PVOID_QI_V8SI_V8DF_INT,
  	       IX86_BUILTIN_SCATTERSIV8DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scatterdiv16sf",
! 	       VOID_FTYPE_PVOID_QI_V8DI_V8SF_INT,
  	       IX86_BUILTIN_SCATTERDIV16SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scatterdiv8df",
! 	       VOID_FTYPE_PVOID_QI_V8DI_V8DF_INT,
  	       IX86_BUILTIN_SCATTERDIV8DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scattersiv16si",
! 	       VOID_FTYPE_PVOID_HI_V16SI_V16SI_INT,
  	       IX86_BUILTIN_SCATTERSIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scattersiv8di",
! 	       VOID_FTYPE_PVOID_QI_V8SI_V8DI_INT,
  	       IX86_BUILTIN_SCATTERSIV8DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scatterdiv16si",
! 	       VOID_FTYPE_PVOID_QI_V8DI_V8SI_INT,
  	       IX86_BUILTIN_SCATTERDIV16SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512F, "__builtin_ia32_scatterdiv8di",
! 	       VOID_FTYPE_PVOID_QI_V8DI_V8DI_INT,
  	       IX86_BUILTIN_SCATTERDIV8DI);
  
    /* AVX512VL */
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv2df",
! 	       V2DF_FTYPE_V2DF_PCVOID_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV2DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv4df",
! 	       V4DF_FTYPE_V4DF_PCVOID_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV4DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div2df",
! 	       V2DF_FTYPE_V2DF_PCVOID_V2DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV2DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div4df",
! 	       V4DF_FTYPE_V4DF_PCVOID_V4DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV4DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv4sf",
! 	       V4SF_FTYPE_V4SF_PCVOID_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV4SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv8sf",
! 	       V8SF_FTYPE_V8SF_PCVOID_V8SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV8SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div4sf",
! 	       V4SF_FTYPE_V4SF_PCVOID_V2DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV4SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div8sf",
! 	       V4SF_FTYPE_V4SF_PCVOID_V4DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV8SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv2di",
! 	       V2DI_FTYPE_V2DI_PCVOID_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV2DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv4di",
! 	       V4DI_FTYPE_V4DI_PCVOID_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV4DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div2di",
! 	       V2DI_FTYPE_V2DI_PCVOID_V2DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV2DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div4di",
! 	       V4DI_FTYPE_V4DI_PCVOID_V4DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV4DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv4si",
! 	       V4SI_FTYPE_V4SI_PCVOID_V4SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV4SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3siv8si",
! 	       V8SI_FTYPE_V8SI_PCVOID_V8SI_QI_INT,
  	       IX86_BUILTIN_GATHER3SIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div4si",
! 	       V4SI_FTYPE_V4SI_PCVOID_V2DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV4SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3div8si",
! 	       V4SI_FTYPE_V4SI_PCVOID_V4DI_QI_INT,
  	       IX86_BUILTIN_GATHER3DIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_gather3altsiv4df ",
*************** ix86_init_mmx_sse_builtins (void)
*** 34179,34271 ****
  	       IX86_BUILTIN_GATHER3ALTDIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv8sf",
! 	       VOID_FTYPE_PFLOAT_QI_V8SI_V8SF_INT,
  	       IX86_BUILTIN_SCATTERSIV8SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv4sf",
! 	       VOID_FTYPE_PFLOAT_QI_V4SI_V4SF_INT,
  	       IX86_BUILTIN_SCATTERSIV4SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv4df",
! 	       VOID_FTYPE_PDOUBLE_QI_V4SI_V4DF_INT,
  	       IX86_BUILTIN_SCATTERSIV4DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv2df",
! 	       VOID_FTYPE_PDOUBLE_QI_V4SI_V2DF_INT,
  	       IX86_BUILTIN_SCATTERSIV2DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv8sf",
! 	       VOID_FTYPE_PFLOAT_QI_V4DI_V4SF_INT,
  	       IX86_BUILTIN_SCATTERDIV8SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv4sf",
! 	       VOID_FTYPE_PFLOAT_QI_V2DI_V4SF_INT,
  	       IX86_BUILTIN_SCATTERDIV4SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv4df",
! 	       VOID_FTYPE_PDOUBLE_QI_V4DI_V4DF_INT,
  	       IX86_BUILTIN_SCATTERDIV4DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv2df",
! 	       VOID_FTYPE_PDOUBLE_QI_V2DI_V2DF_INT,
  	       IX86_BUILTIN_SCATTERDIV2DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv8si",
! 	       VOID_FTYPE_PINT_QI_V8SI_V8SI_INT,
  	       IX86_BUILTIN_SCATTERSIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv4si",
! 	       VOID_FTYPE_PINT_QI_V4SI_V4SI_INT,
  	       IX86_BUILTIN_SCATTERSIV4SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv4di",
! 	       VOID_FTYPE_PLONGLONG_QI_V4SI_V4DI_INT,
  	       IX86_BUILTIN_SCATTERSIV4DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv2di",
! 	       VOID_FTYPE_PLONGLONG_QI_V4SI_V2DI_INT,
  	       IX86_BUILTIN_SCATTERSIV2DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv8si",
! 	       VOID_FTYPE_PINT_QI_V4DI_V4SI_INT,
  	       IX86_BUILTIN_SCATTERDIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv4si",
! 	       VOID_FTYPE_PINT_QI_V2DI_V4SI_INT,
  	       IX86_BUILTIN_SCATTERDIV4SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv4di",
! 	       VOID_FTYPE_PLONGLONG_QI_V4DI_V4DI_INT,
  	       IX86_BUILTIN_SCATTERDIV4DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv2di",
! 	       VOID_FTYPE_PLONGLONG_QI_V2DI_V2DI_INT,
  	       IX86_BUILTIN_SCATTERDIV2DI);
  
    /* AVX512PF */
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_gatherpfdpd",
! 	       VOID_FTYPE_QI_V8SI_PCINT64_INT_INT,
  	       IX86_BUILTIN_GATHERPFDPD);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_gatherpfdps",
! 	       VOID_FTYPE_HI_V16SI_PCINT_INT_INT,
  	       IX86_BUILTIN_GATHERPFDPS);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_gatherpfqpd",
! 	       VOID_FTYPE_QI_V8DI_PCINT64_INT_INT,
  	       IX86_BUILTIN_GATHERPFQPD);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_gatherpfqps",
! 	       VOID_FTYPE_QI_V8DI_PCINT_INT_INT,
  	       IX86_BUILTIN_GATHERPFQPS);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_scatterpfdpd",
! 	       VOID_FTYPE_QI_V8SI_PCINT64_INT_INT,
  	       IX86_BUILTIN_SCATTERPFDPD);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_scatterpfdps",
! 	       VOID_FTYPE_HI_V16SI_PCINT_INT_INT,
  	       IX86_BUILTIN_SCATTERPFDPS);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_scatterpfqpd",
! 	       VOID_FTYPE_QI_V8DI_PCINT64_INT_INT,
  	       IX86_BUILTIN_SCATTERPFQPD);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_scatterpfqps",
! 	       VOID_FTYPE_QI_V8DI_PCINT_INT_INT,
  	       IX86_BUILTIN_SCATTERPFQPS);
  
    /* SHA */
--- 34203,34295 ----
  	       IX86_BUILTIN_GATHER3ALTDIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv8sf",
! 	       VOID_FTYPE_PVOID_QI_V8SI_V8SF_INT,
  	       IX86_BUILTIN_SCATTERSIV8SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv4sf",
! 	       VOID_FTYPE_PVOID_QI_V4SI_V4SF_INT,
  	       IX86_BUILTIN_SCATTERSIV4SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv4df",
! 	       VOID_FTYPE_PVOID_QI_V4SI_V4DF_INT,
  	       IX86_BUILTIN_SCATTERSIV4DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv2df",
! 	       VOID_FTYPE_PVOID_QI_V4SI_V2DF_INT,
  	       IX86_BUILTIN_SCATTERSIV2DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv8sf",
! 	       VOID_FTYPE_PVOID_QI_V4DI_V4SF_INT,
  	       IX86_BUILTIN_SCATTERDIV8SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv4sf",
! 	       VOID_FTYPE_PVOID_QI_V2DI_V4SF_INT,
  	       IX86_BUILTIN_SCATTERDIV4SF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv4df",
! 	       VOID_FTYPE_PVOID_QI_V4DI_V4DF_INT,
  	       IX86_BUILTIN_SCATTERDIV4DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv2df",
! 	       VOID_FTYPE_PVOID_QI_V2DI_V2DF_INT,
  	       IX86_BUILTIN_SCATTERDIV2DF);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv8si",
! 	       VOID_FTYPE_PVOID_QI_V8SI_V8SI_INT,
  	       IX86_BUILTIN_SCATTERSIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv4si",
! 	       VOID_FTYPE_PVOID_QI_V4SI_V4SI_INT,
  	       IX86_BUILTIN_SCATTERSIV4SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv4di",
! 	       VOID_FTYPE_PVOID_QI_V4SI_V4DI_INT,
  	       IX86_BUILTIN_SCATTERSIV4DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scattersiv2di",
! 	       VOID_FTYPE_PVOID_QI_V4SI_V2DI_INT,
  	       IX86_BUILTIN_SCATTERSIV2DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv8si",
! 	       VOID_FTYPE_PVOID_QI_V4DI_V4SI_INT,
  	       IX86_BUILTIN_SCATTERDIV8SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv4si",
! 	       VOID_FTYPE_PVOID_QI_V2DI_V4SI_INT,
  	       IX86_BUILTIN_SCATTERDIV4SI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv4di",
! 	       VOID_FTYPE_PVOID_QI_V4DI_V4DI_INT,
  	       IX86_BUILTIN_SCATTERDIV4DI);
  
    def_builtin (OPTION_MASK_ISA_AVX512VL, "__builtin_ia32_scatterdiv2di",
! 	       VOID_FTYPE_PVOID_QI_V2DI_V2DI_INT,
  	       IX86_BUILTIN_SCATTERDIV2DI);
  
    /* AVX512PF */
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_gatherpfdpd",
! 	       VOID_FTYPE_QI_V8SI_PCVOID_INT_INT,
  	       IX86_BUILTIN_GATHERPFDPD);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_gatherpfdps",
! 	       VOID_FTYPE_HI_V16SI_PCVOID_INT_INT,
  	       IX86_BUILTIN_GATHERPFDPS);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_gatherpfqpd",
! 	       VOID_FTYPE_QI_V8DI_PCVOID_INT_INT,
  	       IX86_BUILTIN_GATHERPFQPD);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_gatherpfqps",
! 	       VOID_FTYPE_QI_V8DI_PCVOID_INT_INT,
  	       IX86_BUILTIN_GATHERPFQPS);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_scatterpfdpd",
! 	       VOID_FTYPE_QI_V8SI_PCVOID_INT_INT,
  	       IX86_BUILTIN_SCATTERPFDPD);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_scatterpfdps",
! 	       VOID_FTYPE_HI_V16SI_PCVOID_INT_INT,
  	       IX86_BUILTIN_SCATTERPFDPS);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_scatterpfqpd",
! 	       VOID_FTYPE_QI_V8DI_PCVOID_INT_INT,
  	       IX86_BUILTIN_SCATTERPFQPD);
    def_builtin (OPTION_MASK_ISA_AVX512PF, "__builtin_ia32_scatterpfqps",
! 	       VOID_FTYPE_QI_V8DI_PCVOID_INT_INT,
  	       IX86_BUILTIN_SCATTERPFQPS);
  
    /* SHA */
*************** ix86_init_mmx_sse_builtins (void)
*** 34369,34379 ****
  	       IX86_BUILTIN_SBB64);
  
    /* Read/write FLAGS.  */
!   def_builtin (~OPTION_MASK_ISA_64BIT, "__builtin_ia32_readeflags_u32",
                 UNSIGNED_FTYPE_VOID, IX86_BUILTIN_READ_FLAGS);
    def_builtin (OPTION_MASK_ISA_64BIT, "__builtin_ia32_readeflags_u64",
                 UINT64_FTYPE_VOID, IX86_BUILTIN_READ_FLAGS);
!   def_builtin (~OPTION_MASK_ISA_64BIT, "__builtin_ia32_writeeflags_u32",
                 VOID_FTYPE_UNSIGNED, IX86_BUILTIN_WRITE_FLAGS);
    def_builtin (OPTION_MASK_ISA_64BIT, "__builtin_ia32_writeeflags_u64",
                 VOID_FTYPE_UINT64, IX86_BUILTIN_WRITE_FLAGS);
--- 34393,34403 ----
  	       IX86_BUILTIN_SBB64);
  
    /* Read/write FLAGS.  */
!   def_builtin (0, "__builtin_ia32_readeflags_u32",
                 UNSIGNED_FTYPE_VOID, IX86_BUILTIN_READ_FLAGS);
    def_builtin (OPTION_MASK_ISA_64BIT, "__builtin_ia32_readeflags_u64",
                 UINT64_FTYPE_VOID, IX86_BUILTIN_READ_FLAGS);
!   def_builtin (0, "__builtin_ia32_writeeflags_u32",
                 VOID_FTYPE_UNSIGNED, IX86_BUILTIN_WRITE_FLAGS);
    def_builtin (OPTION_MASK_ISA_64BIT, "__builtin_ia32_writeeflags_u64",
                 VOID_FTYPE_UINT64, IX86_BUILTIN_WRITE_FLAGS);
*************** sorted_attr_string (tree arglist)
*** 35013,35018 ****
--- 35037,35045 ----
      {
        const char *str = TREE_STRING_POINTER (TREE_VALUE (arg));
        size_t len = strlen (str);
+       /* Skip empty string.  */
+       if (len == 0)
+ 	continue;
        str_len_sum += len + 1;
        if (arg != arglist)
  	argnum++;
*************** sorted_attr_string (tree arglist)
*** 35027,35037 ****
--- 35054,35074 ----
      {
        const char *str = TREE_STRING_POINTER (TREE_VALUE (arg));
        size_t len = strlen (str);
+       /* Skip empty string.  */
+       if (len == 0)
+ 	continue;
        memcpy (attr_str + str_len_sum, str, len);
        attr_str[str_len_sum + len] = TREE_CHAIN (arg) ? ',' : '\0';
        str_len_sum += len + 1;
      }
  
+   /* Strip ',' character at the end.  */
+   if (str_len_sum > 0 && attr_str[str_len_sum - 1] == ',')
+     {
+       attr_str[str_len_sum - 1] = '\0';
+       str_len_sum--;
+     }
+ 
    /* Replace "=,-" with "_".  */
    for (i = 0; i < strlen (attr_str); i++)
      if (attr_str[i] == '=' || attr_str[i]== '-')
*************** ix86_expand_multi_arg_builtin (enum insn
*** 36218,36223 ****
--- 36255,36262 ----
        || GET_MODE (target) != tmode
        || !insn_data[icode].operand[0].predicate (target, tmode))
      target = gen_reg_rtx (tmode);
+   else if (memory_operand (target, tmode))
+     num_memory++;
  
    gcc_assert (nargs <= 4);
  
*************** ix86_expand_args_builtin (const struct b
*** 37543,37548 ****
--- 37582,37589 ----
  	  || GET_MODE (target) != tmode
  	  || !insn_p->operand[0].predicate (target, tmode))
  	target = gen_reg_rtx (tmode);
+       else if (memory_operand (target, tmode))
+ 	num_memory++;
        real_target = target;
      }
    else
*************** ix86_expand_args_builtin (const struct b
*** 37562,37571 ****
  	{
  	  /* SIMD shift insns take either an 8-bit immediate or
  	     register as count.  But builtin functions take int as
! 	     count.  If count doesn't match, we put it in register.  */
  	  if (!match)
  	    {
! 	      op = simplify_gen_subreg (SImode, op, GET_MODE (op), 0);
  	      if (!insn_p->operand[i + 1].predicate (op, mode))
  		op = copy_to_reg (op);
  	    }
--- 37603,37619 ----
  	{
  	  /* SIMD shift insns take either an 8-bit immediate or
  	     register as count.  But builtin functions take int as
! 	     count.  If count doesn't match, we put it in register.
! 	     The instructions are using 64-bit count, if op is just
! 	     32-bit, zero-extend it, as negative shift counts
! 	     are undefined behavior and zero-extension is more
! 	     efficient.  */
  	  if (!match)
  	    {
! 	      if (SCALAR_INT_MODE_P (GET_MODE (op)))
! 		op = convert_modes (mode, GET_MODE (op), op, 1);
! 	      else
! 		op = simplify_gen_subreg (mode, op, GET_MODE (op), 0);
  	      if (!insn_p->operand[i + 1].predicate (op, mode))
  		op = copy_to_reg (op);
  	    }
*************** ix86_expand_args_builtin (const struct b
*** 37748,37753 ****
--- 37796,37802 ----
      case 5:
        pat = GEN_FCN (icode) (real_target, args[0].op, args[1].op,
  			     args[2].op, args[3].op, args[4].op);
+       break;
      case 6:
        pat = GEN_FCN (icode) (real_target, args[0].op, args[1].op,
  			     args[2].op, args[3].op, args[4].op,
*************** ix86_expand_round_builtin (const struct
*** 38123,38128 ****
--- 38172,38178 ----
      case 5:
        pat = GEN_FCN (icode) (target, args[0].op, args[1].op,
  			     args[2].op, args[3].op, args[4].op);
+       break;
      case 6:
        pat = GEN_FCN (icode) (target, args[0].op, args[1].op,
  			     args[2].op, args[3].op, args[4].op,
*************** ix86_expand_builtin (tree exp, rtx targe
*** 38733,38741 ****
       Originally the builtin was not created if it wasn't applicable to the
       current ISA based on the command line switches.  With function specific
       options, we need to check in the context of the function making the call
!      whether it is supported.  */
!   if (ix86_builtins_isa[fcode].isa
!       && !(ix86_builtins_isa[fcode].isa & ix86_isa_flags))
      {
        char *opts = ix86_target_string (ix86_builtins_isa[fcode].isa, 0, NULL,
  				       NULL, (enum fpmath_unit) 0, false);
--- 38783,38800 ----
       Originally the builtin was not created if it wasn't applicable to the
       current ISA based on the command line switches.  With function specific
       options, we need to check in the context of the function making the call
!      whether it is supported.  Treat AVX512VL specially.  For other flags,
!      if isa includes more than one ISA bit, treat those are requiring any
!      of them.  For AVX512VL, require both AVX512VL and the non-AVX512VL
!      ISAs.  Similarly for 64BIT, but we shouldn't be building such builtins
!      at all, -m64 is a whole TU option.  */
!   if (((ix86_builtins_isa[fcode].isa
! 	& ~(OPTION_MASK_ISA_AVX512VL | OPTION_MASK_ISA_64BIT))
!        && !(ix86_builtins_isa[fcode].isa
! 	    & ~(OPTION_MASK_ISA_AVX512VL | OPTION_MASK_ISA_64BIT)
! 	    & ix86_isa_flags))
!       || ((ix86_builtins_isa[fcode].isa & OPTION_MASK_ISA_AVX512VL)
! 	  && !(ix86_isa_flags & OPTION_MASK_ISA_AVX512VL)))
      {
        char *opts = ix86_target_string (ix86_builtins_isa[fcode].isa, 0, NULL,
  				       NULL, (enum fpmath_unit) 0, false);
*************** ix86_expand_builtin (tree exp, rtx targe
*** 39529,39537 ****
        mode0 = DImode;
  
  rdrand_step:
-       op0 = gen_reg_rtx (mode0);
-       emit_insn (GEN_FCN (icode) (op0));
- 
        arg0 = CALL_EXPR_ARG (exp, 0);
        op1 = expand_normal (arg0);
        if (!address_operand (op1, VOIDmode))
--- 39588,39593 ----
*************** rdrand_step:
*** 39539,39544 ****
--- 39595,39604 ----
  	  op1 = convert_memory_address (Pmode, op1);
  	  op1 = copy_addr_to_reg (op1);
  	}
+ 
+       op0 = gen_reg_rtx (mode0);
+       emit_insn (GEN_FCN (icode) (op0));
+ 
        emit_move_insn (gen_rtx_MEM (mode0, op1), op0);
  
        op1 = gen_reg_rtx (SImode);
*************** rdrand_step:
*** 39547,39554 ****
        /* Emit SImode conditional move.  */
        if (mode0 == HImode)
  	{
! 	  op2 = gen_reg_rtx (SImode);
! 	  emit_insn (gen_zero_extendhisi2 (op2, op0));
  	}
        else if (mode0 == SImode)
  	op2 = op0;
--- 39607,39626 ----
        /* Emit SImode conditional move.  */
        if (mode0 == HImode)
  	{
! 	  if (TARGET_ZERO_EXTEND_WITH_AND
! 	      && optimize_function_for_speed_p (cfun))
! 	    {
! 	      op2 = force_reg (SImode, const0_rtx);
! 
! 	      emit_insn (gen_movstricthi
! 			 (gen_lowpart (HImode, op2), op0));
! 	    }
! 	  else
! 	    {
! 	      op2 = gen_reg_rtx (SImode);
! 
! 	      emit_insn (gen_zero_extendhisi2 (op2, op0));
! 	    }
  	}
        else if (mode0 == SImode)
  	op2 = op0;
*************** rdrand_step:
*** 39580,39588 ****
        mode0 = DImode;
  
  rdseed_step:
-       op0 = gen_reg_rtx (mode0);
-       emit_insn (GEN_FCN (icode) (op0));
- 
        arg0 = CALL_EXPR_ARG (exp, 0);
        op1 = expand_normal (arg0);
        if (!address_operand (op1, VOIDmode))
--- 39652,39657 ----
*************** rdseed_step:
*** 39590,39595 ****
--- 39659,39668 ----
  	  op1 = convert_memory_address (Pmode, op1);
  	  op1 = copy_addr_to_reg (op1);
  	}
+ 
+       op0 = gen_reg_rtx (mode0);
+       emit_insn (GEN_FCN (icode) (op0));
+ 
        emit_move_insn (gen_rtx_MEM (mode0, op1), op0);
  
        op2 = gen_reg_rtx (QImode);
*************** rdseed_step:
*** 39695,39708 ****
  
      case IX86_BUILTIN_KORTESTC16:
        icode = CODE_FOR_kortestchi;
!       mode0 = HImode;
!       mode1 = CCCmode;
        goto kortest;
  
      case IX86_BUILTIN_KORTESTZ16:
        icode = CODE_FOR_kortestzhi;
!       mode0 = HImode;
!       mode1 = CCZmode;
  
      kortest:
        arg0 = CALL_EXPR_ARG (exp, 0); /* Mask reg src1.  */
--- 39768,39779 ----
  
      case IX86_BUILTIN_KORTESTC16:
        icode = CODE_FOR_kortestchi;
!       mode3 = CCCmode;
        goto kortest;
  
      case IX86_BUILTIN_KORTESTZ16:
        icode = CODE_FOR_kortestzhi;
!       mode3 = CCZmode;
  
      kortest:
        arg0 = CALL_EXPR_ARG (exp, 0); /* Mask reg src1.  */
*************** rdseed_step:
*** 39710,39728 ****
        op0 = expand_normal (arg0);
        op1 = expand_normal (arg1);
  
!       op0 = copy_to_reg (op0);
!       op0 = simplify_gen_subreg (mode0, op0, GET_MODE (op0), 0);
!       op1 = copy_to_reg (op1);
!       op1 = simplify_gen_subreg (mode0, op1, GET_MODE (op1), 0);
  
        target = gen_reg_rtx (QImode);
-       emit_insn (gen_rtx_SET (mode0, target, const0_rtx));
  
        /* Emit kortest.  */
        emit_insn (GEN_FCN (icode) (op0, op1));
        /* And use setcc to return result from flags.  */
        ix86_expand_setcc (target, EQ,
! 			 gen_rtx_REG (mode1, FLAGS_REG), const0_rtx);
        return target;
  
      case IX86_BUILTIN_GATHERSIV2DF:
--- 39781,39812 ----
        op0 = expand_normal (arg0);
        op1 = expand_normal (arg1);
  
!       mode0 = insn_data[icode].operand[0].mode;
!       mode1 = insn_data[icode].operand[1].mode;
! 
!       if (GET_MODE (op0) != VOIDmode)
! 	op0 = force_reg (GET_MODE (op0), op0);
! 
!       op0 = gen_lowpart (mode0, op0);
! 
!       if (!insn_data[icode].operand[0].predicate (op0, mode0))
! 	op0 = copy_to_mode_reg (mode0, op0);
! 
!       if (GET_MODE (op1) != VOIDmode)
! 	op1 = force_reg (GET_MODE (op1), op1);
! 
!       op1 = gen_lowpart (mode1, op1);
! 
!       if (!insn_data[icode].operand[1].predicate (op1, mode1))
! 	op1 = copy_to_mode_reg (mode1, op1);
  
        target = gen_reg_rtx (QImode);
  
        /* Emit kortest.  */
        emit_insn (GEN_FCN (icode) (op0, op1));
        /* And use setcc to return result from flags.  */
        ix86_expand_setcc (target, EQ,
! 			 gen_rtx_REG (mode3, FLAGS_REG), const0_rtx);
        return target;
  
      case IX86_BUILTIN_GATHERSIV2DF:
*************** ix86_vector_duplicate_value (machine_mod
*** 43985,43994 ****
    if (recog_memoized (insn) < 0)
      {
        rtx_insn *seq;
        /* If that fails, force VAL into a register.  */
  
        start_sequence ();
!       XEXP (dup, 0) = force_reg (GET_MODE_INNER (mode), val);
        seq = get_insns ();
        end_sequence ();
        if (seq)
--- 44069,44084 ----
    if (recog_memoized (insn) < 0)
      {
        rtx_insn *seq;
+       machine_mode innermode = GET_MODE_INNER (mode);
+       rtx reg;
+ 
        /* If that fails, force VAL into a register.  */
  
        start_sequence ();
!       reg = force_reg (innermode, val);
!       if (GET_MODE (reg) != innermode)
! 	reg = gen_lowpart (innermode, reg);
!       XEXP (dup, 0) = reg;
        seq = get_insns ();
        end_sequence ();
        if (seq)
diff -Nrcpad gcc-5.4.0/gcc/config/i386/i386.h gcc-5.5.0/gcc/config/i386/i386.h
*** gcc-5.4.0/gcc/config/i386/i386.h	Wed May 25 08:08:08 2016
--- gcc-5.5.0/gcc/config/i386/i386.h	Thu Oct 13 21:19:00 2016
*************** see the files COPYING3 and COPYING.RUNTI
*** 150,157 ****
  #define TARGET_PREFETCHWT1_P(x)	TARGET_ISA_PREFETCHWT1_P(x)
  #define TARGET_MPX	TARGET_ISA_MPX
  #define TARGET_MPX_P(x)	TARGET_ISA_MPX_P(x)
- #define TARGET_PCOMMIT	TARGET_ISA_PCOMMIT
- #define TARGET_PCOMMIT_P(x)	TARGET_ISA_PCOMMIT_P(x)
  #define TARGET_CLWB	TARGET_ISA_CLWB
  #define TARGET_CLWB_P(x)	TARGET_ISA_CLWB_P(x)
  #define TARGET_MWAITX	TARGET_ISA_MWAITX
--- 150,155 ----
diff -Nrcpad gcc-5.4.0/gcc/config/i386/i386.md gcc-5.5.0/gcc/config/i386/i386.md
*** gcc-5.4.0/gcc/config/i386/i386.md	Wed Mar 30 12:38:21 2016
--- gcc-5.5.0/gcc/config/i386/i386.md	Tue Jul 18 21:44:03 2017
***************
*** 255,263 ****
    ;; For CLWB support
    UNSPECV_CLWB
  
-   ;; For PCOMMIT support
-   UNSPECV_PCOMMIT
- 
    ;; For CLFLUSHOPT support
    UNSPECV_CLFLUSHOPT
  
--- 255,260 ----
***************
*** 2819,2824 ****
--- 2816,2851 ----
    operands[0] = replace_equiv_address (operands[0], stack_pointer_rtx);
  })
  
+ (define_insn_and_split "*pushxf_rounded"
+   [(set (mem:XF
+ 	  (pre_modify:P
+ 	    (reg:P SP_REG)
+ 	    (plus:P (reg:P SP_REG) (const_int -16))))
+ 	(match_operand:XF 0 "nonmemory_no_elim_operand" "f,r,*r,C"))]
+   "TARGET_64BIT"
+   "#"
+   "&& 1"
+   [(set (reg:P SP_REG) (plus:P (reg:P SP_REG) (const_int -16)))
+    (set (match_dup 1) (match_dup 0))]
+ {
+   rtx pat = PATTERN (curr_insn);
+   operands[1] = SET_DEST (pat);
+ 
+   /* Preserve memory attributes. */
+   operands[1] = replace_equiv_address (operands[1], stack_pointer_rtx);
+ }
+   [(set_attr "type" "multi")
+    (set_attr "unit" "i387,*,*,*")
+    (set (attr "mode")
+ 	(cond [(eq_attr "alternative" "1,2,3")
+ 		 (const_string "DI")
+ 	      ]
+ 	      (const_string "XF")))
+    (set (attr "preferred_for_size")
+      (cond [(eq_attr "alternative" "1")
+               (symbol_ref "false")]
+            (symbol_ref "true")))])
+ 
  (define_insn "*pushxf"
    [(set (match_operand:XF 0 "push_operand" "=<,<,<,<")
  	(match_operand:XF 1 "general_no_elim_operand" "f,r,*r,oF"))]
***************
*** 2974,2980 ****
  	(match_operand:TF 1 "general_operand"	   "C ,xm,x,*roF,*rC"))]
    "(TARGET_64BIT || TARGET_SSE)
     && !(MEM_P (operands[0]) && MEM_P (operands[1]))
!    && (!can_create_pseudo_p ()
         || (ix86_cmodel == CM_MEDIUM || ix86_cmodel == CM_LARGE)
         || GET_CODE (operands[1]) != CONST_DOUBLE
         || (optimize_function_for_size_p (cfun)
--- 3001,3007 ----
  	(match_operand:TF 1 "general_operand"	   "C ,xm,x,*roF,*rC"))]
    "(TARGET_64BIT || TARGET_SSE)
     && !(MEM_P (operands[0]) && MEM_P (operands[1]))
!    && (lra_in_progress || reload_completed
         || (ix86_cmodel == CM_MEDIUM || ix86_cmodel == CM_LARGE)
         || GET_CODE (operands[1]) != CONST_DOUBLE
         || (optimize_function_for_size_p (cfun)
***************
*** 3044,3050 ****
  	(match_operand:XF 1 "general_operand"
  	 "fm,f,G,roF,r , *roF,*r,F ,C"))]
    "!(MEM_P (operands[0]) && MEM_P (operands[1]))
!    && (!can_create_pseudo_p ()
         || (ix86_cmodel == CM_MEDIUM || ix86_cmodel == CM_LARGE)
         || GET_CODE (operands[1]) != CONST_DOUBLE
         || (optimize_function_for_size_p (cfun)
--- 3071,3077 ----
  	(match_operand:XF 1 "general_operand"
  	 "fm,f,G,roF,r , *roF,*r,F ,C"))]
    "!(MEM_P (operands[0]) && MEM_P (operands[1]))
!    && (lra_in_progress || reload_completed
         || (ix86_cmodel == CM_MEDIUM || ix86_cmodel == CM_LARGE)
         || GET_CODE (operands[1]) != CONST_DOUBLE
         || (optimize_function_for_size_p (cfun)
***************
*** 3098,3104 ****
  	(match_operand:DF 1 "general_operand"
      "Yf*fm,Yf*f,G   ,roF,r ,*roF,*r,F ,rm,rC,C ,F ,C,v,m,v,C ,*x,m ,*x,Yj,r"))]
    "!(MEM_P (operands[0]) && MEM_P (operands[1]))
!    && (!can_create_pseudo_p ()
         || (ix86_cmodel == CM_MEDIUM || ix86_cmodel == CM_LARGE)
         || GET_CODE (operands[1]) != CONST_DOUBLE
         || (optimize_function_for_size_p (cfun)
--- 3125,3131 ----
  	(match_operand:DF 1 "general_operand"
      "Yf*fm,Yf*f,G   ,roF,r ,*roF,*r,F ,rm,rC,C ,F ,C,v,m,v,C ,*x,m ,*x,Yj,r"))]
    "!(MEM_P (operands[0]) && MEM_P (operands[1]))
!    && (lra_in_progress || reload_completed
         || (ix86_cmodel == CM_MEDIUM || ix86_cmodel == CM_LARGE)
         || GET_CODE (operands[1]) != CONST_DOUBLE
         || (optimize_function_for_size_p (cfun)
***************
*** 3281,3287 ****
  	(match_operand:SF 1 "general_operand"
  	  "Yf*fm,Yf*f,G   ,rmF,rF,C,v,m,v,Yj,r  ,*y ,m  ,*y,*Yn,r"))]
    "!(MEM_P (operands[0]) && MEM_P (operands[1]))
!    && (!can_create_pseudo_p ()
         || (ix86_cmodel == CM_MEDIUM || ix86_cmodel == CM_LARGE)
         || GET_CODE (operands[1]) != CONST_DOUBLE
         || (optimize_function_for_size_p (cfun)
--- 3308,3314 ----
  	(match_operand:SF 1 "general_operand"
  	  "Yf*fm,Yf*f,G   ,rmF,rF,C,v,m,v,Yj,r  ,*y ,m  ,*y,*Yn,r"))]
    "!(MEM_P (operands[0]) && MEM_P (operands[1]))
!    && (lra_in_progress || reload_completed
         || (ix86_cmodel == CM_MEDIUM || ix86_cmodel == CM_LARGE)
         || GET_CODE (operands[1]) != CONST_DOUBLE
         || (optimize_function_for_size_p (cfun)
***************
*** 5132,5138 ****
  (define_expand "floatunsdisf2"
    [(use (match_operand:SF 0 "register_operand"))
     (use (match_operand:DI 1 "nonimmediate_operand"))]
!   "TARGET_64BIT && TARGET_SSE_MATH"
    "x86_emit_floatuns (operands); DONE;")
  
  (define_expand "floatunsdidf2"
--- 5159,5165 ----
  (define_expand "floatunsdisf2"
    [(use (match_operand:SF 0 "register_operand"))
     (use (match_operand:DI 1 "nonimmediate_operand"))]
!   "TARGET_64BIT && TARGET_SSE && TARGET_SSE_MATH"
    "x86_emit_floatuns (operands); DONE;")
  
  (define_expand "floatunsdidf2"
***************
*** 7080,7100 ****
  		(match_operand:XF 2 "register_operand")))]
    "TARGET_80387")
  
! (define_expand "divdf3"
!   [(set (match_operand:DF 0 "register_operand")
!  	(div:DF (match_operand:DF 1 "register_operand")
!  		(match_operand:DF 2 "nonimmediate_operand")))]
!    "(TARGET_80387 && X87_ENABLE_ARITH (DFmode))
!     || (TARGET_SSE2 && TARGET_SSE_MATH)")
! 
! (define_expand "divsf3"
!   [(set (match_operand:SF 0 "register_operand")
! 	(div:SF (match_operand:SF 1 "register_operand")
! 		(match_operand:SF 2 "nonimmediate_operand")))]
!   "(TARGET_80387 && X87_ENABLE_ARITH (SFmode))
!     || TARGET_SSE_MATH"
  {
!   if (TARGET_SSE_MATH
        && TARGET_RECIP_DIV
        && optimize_insn_for_speed_p ()
        && flag_finite_math_only && !flag_trapping_math
--- 7107,7121 ----
  		(match_operand:XF 2 "register_operand")))]
    "TARGET_80387")
  
! (define_expand "div<mode>3"
!   [(set (match_operand:MODEF 0 "register_operand")
! 	(div:MODEF (match_operand:MODEF 1 "register_operand")
! 		   (match_operand:MODEF 2 "nonimmediate_operand")))]
!   "(TARGET_80387 && X87_ENABLE_ARITH (<MODE>mode))
!     || (SSE_FLOAT_MODE_P (<MODE>mode) && TARGET_SSE_MATH)"
  {
!   if (<MODE>mode == SFmode
!       && TARGET_SSE && TARGET_SSE_MATH
        && TARGET_RECIP_DIV
        && optimize_insn_for_speed_p ()
        && flag_finite_math_only && !flag_trapping_math
***************
*** 8364,8370 ****
    [(set (match_operand:HI 0 "nonimmediate_operand" "=r,rm,!k")
  	(any_or:HI
  	 (match_operand:HI 1 "nonimmediate_operand" "%0,0,k")
! 	 (match_operand:HI 2 "general_operand" "<g>,r<i>,k")))
     (clobber (reg:CC FLAGS_REG))]
    "ix86_binary_operator_ok (<CODE>, HImode, operands)"
    "@
--- 8385,8391 ----
    [(set (match_operand:HI 0 "nonimmediate_operand" "=r,rm,!k")
  	(any_or:HI
  	 (match_operand:HI 1 "nonimmediate_operand" "%0,0,k")
! 	 (match_operand:HI 2 "general_operand" "rmn,rn,k")))
     (clobber (reg:CC FLAGS_REG))]
    "ix86_binary_operator_ok (<CODE>, HImode, operands)"
    "@
***************
*** 8446,8452 ****
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_AVX512F"
  {
!   if (which_alternative == 1 && <MODE>mode == QImode && TARGET_AVX512DQ)
      return "kxnorb\t{%2, %1, %0|%0, %1, %2}";
    return "kxnorw\t{%2, %1, %0|%0, %1, %2}";
  }
--- 8467,8476 ----
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_AVX512F"
  {
!   if (which_alternative == 0)
!     return "#";
! 
!   if (<MODE>mode == QImode && TARGET_AVX512DQ)
      return "kxnorb\t{%2, %1, %0|%0, %1, %2}";
    return "kxnorw\t{%2, %1, %0|%0, %1, %2}";
  }
***************
*** 9285,9291 ****
    "ix86_expand_binary_operator (ASHIFT, <MODE>mode, operands); DONE;")
  
  (define_insn "*ashl<mode>3_doubleword"
!   [(set (match_operand:DWI 0 "register_operand" "=&r,r")
  	(ashift:DWI (match_operand:DWI 1 "reg_or_pm1_operand" "n,0")
  		    (match_operand:QI 2 "nonmemory_operand" "<S>c,<S>c")))
     (clobber (reg:CC FLAGS_REG))]
--- 9309,9315 ----
    "ix86_expand_binary_operator (ASHIFT, <MODE>mode, operands); DONE;")
  
  (define_insn "*ashl<mode>3_doubleword"
!   [(set (match_operand:DWI 0 "register_operand" "=&r,&r")
  	(ashift:DWI (match_operand:DWI 1 "reg_or_pm1_operand" "n,0")
  		    (match_operand:QI 2 "nonmemory_operand" "<S>c,<S>c")))
     (clobber (reg:CC FLAGS_REG))]
***************
*** 9918,9924 ****
     (set_attr "mode" "<MODE>")])
  
  (define_insn_and_split "*<shift_insn><mode>3_doubleword"
!   [(set (match_operand:DWI 0 "register_operand" "=r")
  	(any_shiftrt:DWI (match_operand:DWI 1 "register_operand" "0")
  			 (match_operand:QI 2 "nonmemory_operand" "<S>c")))
     (clobber (reg:CC FLAGS_REG))]
--- 9942,9948 ----
     (set_attr "mode" "<MODE>")])
  
  (define_insn_and_split "*<shift_insn><mode>3_doubleword"
!   [(set (match_operand:DWI 0 "register_operand" "=&r")
  	(any_shiftrt:DWI (match_operand:DWI 1 "register_operand" "0")
  			 (match_operand:QI 2 "nonmemory_operand" "<S>c")))
     (clobber (reg:CC FLAGS_REG))]
***************
*** 10431,10440 ****
    split_double_mode (<DWI>mode, &operands[0], 1, &operands[4], &operands[5]);
  })
  
  (define_insn "*bmi2_rorx<mode>3_1"
    [(set (match_operand:SWI48 0 "register_operand" "=r")
! 	(rotatert:SWI48 (match_operand:SWI48 1 "nonimmediate_operand" "rm")
! 			(match_operand:QI 2 "immediate_operand" "<S>")))]
    "TARGET_BMI2"
    "rorx\t{%2, %1, %0|%0, %1, %2}"
    [(set_attr "type" "rotatex")
--- 10455,10469 ----
    split_double_mode (<DWI>mode, &operands[0], 1, &operands[4], &operands[5]);
  })
  
+ (define_mode_attr rorx_immediate_operand
+ 	[(SI "const_0_to_31_operand")
+ 	 (DI "const_0_to_63_operand")])
+ 
  (define_insn "*bmi2_rorx<mode>3_1"
    [(set (match_operand:SWI48 0 "register_operand" "=r")
! 	(rotatert:SWI48
! 	  (match_operand:SWI48 1 "nonimmediate_operand" "rm")
! 	  (match_operand:QI 2 "<rorx_immediate_operand>" "<S>")))]
    "TARGET_BMI2"
    "rorx\t{%2, %1, %0|%0, %1, %2}"
    [(set_attr "type" "rotatex")
***************
*** 10477,10496 ****
  (define_split
    [(set (match_operand:SWI48 0 "register_operand")
  	(rotate:SWI48 (match_operand:SWI48 1 "nonimmediate_operand")
! 		      (match_operand:QI 2 "immediate_operand")))
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_BMI2 && reload_completed"
    [(set (match_dup 0)
  	(rotatert:SWI48 (match_dup 1) (match_dup 2)))]
  {
!   operands[2]
!     = GEN_INT (GET_MODE_BITSIZE (<MODE>mode) - INTVAL (operands[2]));
  })
  
  (define_split
    [(set (match_operand:SWI48 0 "register_operand")
  	(rotatert:SWI48 (match_operand:SWI48 1 "nonimmediate_operand")
! 			(match_operand:QI 2 "immediate_operand")))
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_BMI2 && reload_completed"
    [(set (match_dup 0)
--- 10506,10526 ----
  (define_split
    [(set (match_operand:SWI48 0 "register_operand")
  	(rotate:SWI48 (match_operand:SWI48 1 "nonimmediate_operand")
! 		      (match_operand:QI 2 "const_int_operand")))
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_BMI2 && reload_completed"
    [(set (match_dup 0)
  	(rotatert:SWI48 (match_dup 1) (match_dup 2)))]
  {
!   int bitsize = GET_MODE_BITSIZE (<MODE>mode);
! 
!   operands[2] = GEN_INT ((bitsize - INTVAL (operands[2])) % bitsize);
  })
  
  (define_split
    [(set (match_operand:SWI48 0 "register_operand")
  	(rotatert:SWI48 (match_operand:SWI48 1 "nonimmediate_operand")
! 			(match_operand:QI 2 "const_int_operand")))
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_BMI2 && reload_completed"
    [(set (match_dup 0)
***************
*** 10500,10506 ****
    [(set (match_operand:DI 0 "register_operand" "=r")
  	(zero_extend:DI
  	  (rotatert:SI (match_operand:SI 1 "nonimmediate_operand" "rm")
! 		       (match_operand:QI 2 "immediate_operand" "I"))))]
    "TARGET_64BIT && TARGET_BMI2"
    "rorx\t{%2, %1, %k0|%k0, %1, %2}"
    [(set_attr "type" "rotatex")
--- 10530,10536 ----
    [(set (match_operand:DI 0 "register_operand" "=r")
  	(zero_extend:DI
  	  (rotatert:SI (match_operand:SI 1 "nonimmediate_operand" "rm")
! 		       (match_operand:QI 2 "const_0_to_31_operand" "I"))))]
    "TARGET_64BIT && TARGET_BMI2"
    "rorx\t{%2, %1, %k0|%k0, %1, %2}"
    [(set_attr "type" "rotatex")
***************
*** 10544,10564 ****
    [(set (match_operand:DI 0 "register_operand")
  	(zero_extend:DI
  	  (rotate:SI (match_operand:SI 1 "nonimmediate_operand")
! 		     (match_operand:QI 2 "immediate_operand"))))
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_64BIT && TARGET_BMI2 && reload_completed"
    [(set (match_dup 0)
  	(zero_extend:DI (rotatert:SI (match_dup 1) (match_dup 2))))]
  {
!   operands[2]
!     = GEN_INT (GET_MODE_BITSIZE (SImode) - INTVAL (operands[2]));
  })
  
  (define_split
    [(set (match_operand:DI 0 "register_operand")
  	(zero_extend:DI
  	  (rotatert:SI (match_operand:SI 1 "nonimmediate_operand")
! 		       (match_operand:QI 2 "immediate_operand"))))
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_64BIT && TARGET_BMI2 && reload_completed"
    [(set (match_dup 0)
--- 10574,10595 ----
    [(set (match_operand:DI 0 "register_operand")
  	(zero_extend:DI
  	  (rotate:SI (match_operand:SI 1 "nonimmediate_operand")
! 		     (match_operand:QI 2 "const_int_operand"))))
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_64BIT && TARGET_BMI2 && reload_completed"
    [(set (match_dup 0)
  	(zero_extend:DI (rotatert:SI (match_dup 1) (match_dup 2))))]
  {
!   int bitsize = GET_MODE_BITSIZE (SImode);
! 
!   operands[2] = GEN_INT ((bitsize - INTVAL (operands[2])) % bitsize);
  })
  
  (define_split
    [(set (match_operand:DI 0 "register_operand")
  	(zero_extend:DI
  	  (rotatert:SI (match_operand:SI 1 "nonimmediate_operand")
! 		       (match_operand:QI 2 "const_int_operand"))))
     (clobber (reg:CC FLAGS_REG))]
    "TARGET_64BIT && TARGET_BMI2 && reload_completed"
    [(set (match_dup 0)
***************
*** 11625,11631 ****
  	(zero_extend (match_dup 1)))]
    "(peep2_reg_dead_p (3, operands[1])
      || operands_match_p (operands[1], operands[3]))
!    && ! reg_overlap_mentioned_p (operands[3], operands[0])"
    [(set (match_dup 4) (match_dup 0))
     (set (strict_low_part (match_dup 5))
  	(match_dup 2))]
--- 11656,11663 ----
  	(zero_extend (match_dup 1)))]
    "(peep2_reg_dead_p (3, operands[1])
      || operands_match_p (operands[1], operands[3]))
!    && ! reg_overlap_mentioned_p (operands[3], operands[0])
!    && peep2_regno_dead_p (0, FLAGS_REG)"
    [(set (match_dup 4) (match_dup 0))
     (set (strict_low_part (match_dup 5))
  	(match_dup 2))]
***************
*** 11645,11651 ****
  	(zero_extend (match_dup 1)))]
    "(peep2_reg_dead_p (3, operands[1])
      || operands_match_p (operands[1], operands[3]))
!    && ! reg_overlap_mentioned_p (operands[3], operands[0])"
    [(parallel [(set (match_dup 5) (match_dup 0))
  	      (match_dup 4)])
     (set (strict_low_part (match_dup 6))
--- 11677,11685 ----
  	(zero_extend (match_dup 1)))]
    "(peep2_reg_dead_p (3, operands[1])
      || operands_match_p (operands[1], operands[3]))
!    && ! reg_overlap_mentioned_p (operands[3], operands[0])
!    && ! reg_set_p (operands[3], operands[4])
!    && peep2_regno_dead_p (0, FLAGS_REG)"
    [(parallel [(set (match_dup 5) (match_dup 0))
  	      (match_dup 4)])
     (set (strict_low_part (match_dup 6))
***************
*** 11667,11673 ****
  		   (and:SI (match_dup 3) (const_int 255)))
  	      (clobber (reg:CC FLAGS_REG))])]
    "REGNO (operands[1]) == REGNO (operands[3])
!    && ! reg_overlap_mentioned_p (operands[3], operands[0])"
    [(set (match_dup 4) (match_dup 0))
     (set (strict_low_part (match_dup 5))
  	(match_dup 2))]
--- 11701,11708 ----
  		   (and:SI (match_dup 3) (const_int 255)))
  	      (clobber (reg:CC FLAGS_REG))])]
    "REGNO (operands[1]) == REGNO (operands[3])
!    && ! reg_overlap_mentioned_p (operands[3], operands[0])
!    && peep2_regno_dead_p (0, FLAGS_REG)"
    [(set (match_dup 4) (match_dup 0))
     (set (strict_low_part (match_dup 5))
  	(match_dup 2))]
***************
*** 11688,11694 ****
  	      (clobber (reg:CC FLAGS_REG))])]
    "(peep2_reg_dead_p (3, operands[1])
      || operands_match_p (operands[1], operands[3]))
!    && ! reg_overlap_mentioned_p (operands[3], operands[0])"
    [(parallel [(set (match_dup 5) (match_dup 0))
  	      (match_dup 4)])
     (set (strict_low_part (match_dup 6))
--- 11723,11731 ----
  	      (clobber (reg:CC FLAGS_REG))])]
    "(peep2_reg_dead_p (3, operands[1])
      || operands_match_p (operands[1], operands[3]))
!    && ! reg_overlap_mentioned_p (operands[3], operands[0])
!    && ! reg_set_p (operands[3], operands[4])
!    && peep2_regno_dead_p (0, FLAGS_REG)"
    [(parallel [(set (match_dup 5) (match_dup 0))
  	      (match_dup 4)])
     (set (strict_low_part (match_dup 6))
***************
*** 13744,13750 ****
    [(set (match_operand:SF 0 "register_operand" "=x")
  	(unspec:SF [(match_operand:SF 1 "nonimmediate_operand" "xm")]
  		   UNSPEC_RCP))]
!   "TARGET_SSE_MATH"
    "%vrcpss\t{%1, %d0|%d0, %1}"
    [(set_attr "type" "sse")
     (set_attr "atom_sse_attr" "rcp")
--- 13781,13787 ----
    [(set (match_operand:SF 0 "register_operand" "=x")
  	(unspec:SF [(match_operand:SF 1 "nonimmediate_operand" "xm")]
  		   UNSPEC_RCP))]
!   "TARGET_SSE && TARGET_SSE_MATH"
    "%vrcpss\t{%1, %d0|%d0, %1}"
    [(set_attr "type" "sse")
     (set_attr "atom_sse_attr" "rcp")
***************
*** 14053,14059 ****
    [(set (match_operand:SF 0 "register_operand" "=x")
  	(unspec:SF [(match_operand:SF 1 "nonimmediate_operand" "xm")]
  		   UNSPEC_RSQRT))]
!   "TARGET_SSE_MATH"
    "%vrsqrtss\t{%1, %d0|%d0, %1}"
    [(set_attr "type" "sse")
     (set_attr "atom_sse_attr" "rcp")
--- 14090,14096 ----
    [(set (match_operand:SF 0 "register_operand" "=x")
  	(unspec:SF [(match_operand:SF 1 "nonimmediate_operand" "xm")]
  		   UNSPEC_RSQRT))]
!   "TARGET_SSE && TARGET_SSE_MATH"
    "%vrsqrtss\t{%1, %d0|%d0, %1}"
    [(set_attr "type" "sse")
     (set_attr "atom_sse_attr" "rcp")
***************
*** 14065,14071 ****
    [(set (match_operand:SF 0 "register_operand")
  	(unspec:SF [(match_operand:SF 1 "nonimmediate_operand")]
  		   UNSPEC_RSQRT))]
!   "TARGET_SSE_MATH"
  {
    ix86_emit_swsqrtsf (operands[0], operands[1], SFmode, 1);
    DONE;
--- 14102,14108 ----
    [(set (match_operand:SF 0 "register_operand")
  	(unspec:SF [(match_operand:SF 1 "nonimmediate_operand")]
  		   UNSPEC_RSQRT))]
!   "TARGET_SSE && TARGET_SSE_MATH"
  {
    ix86_emit_swsqrtsf (operands[0], operands[1], SFmode, 1);
    DONE;
***************
*** 14094,14100 ****
     || (SSE_FLOAT_MODE_P (<MODE>mode) && TARGET_SSE_MATH)"
  {
    if (<MODE>mode == SFmode
!       && TARGET_SSE_MATH
        && TARGET_RECIP_SQRT
        && !optimize_function_for_size_p (cfun)
        && flag_finite_math_only && !flag_trapping_math
--- 14131,14137 ----
     || (SSE_FLOAT_MODE_P (<MODE>mode) && TARGET_SSE_MATH)"
  {
    if (<MODE>mode == SFmode
!       && TARGET_SSE && TARGET_SSE_MATH
        && TARGET_RECIP_SQRT
        && !optimize_function_for_size_p (cfun)
        && flag_finite_math_only && !flag_trapping_math
***************
*** 18871,18883 ****
    [(set_attr "type" "other")
     (set_attr "length" "3")])
  
- (define_insn "pcommit"
-   [(unspec_volatile [(const_int 0)] UNSPECV_PCOMMIT)]
-   "TARGET_PCOMMIT"
-   "pcommit"
-   [(set_attr "type" "other")
-    (set_attr "length" "4")])
- 
  (define_insn "clwb"
    [(unspec_volatile [(match_operand 0 "address_operand" "p")]
                     UNSPECV_CLWB)]
--- 18908,18913 ----
diff -Nrcpad gcc-5.4.0/gcc/config/i386/i386.opt gcc-5.5.0/gcc/config/i386/i386.opt
*** gcc-5.4.0/gcc/config/i386/i386.opt	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/config/i386/i386.opt	Thu Oct 13 21:19:00 2016
*************** Target Report Mask(ISA_CLWB) Var(ix86_is
*** 747,754 ****
  Support CLWB instruction
  
  mpcommit
! Target Report Mask(ISA_PCOMMIT) Var(ix86_isa_flags) Save
! Support PCOMMIT instruction
  
  mfxsr
  Target Report Mask(ISA_FXSR) Var(ix86_isa_flags) Save
--- 747,754 ----
  Support CLWB instruction
  
  mpcommit
! Target Undocumented Warn(%<-mpcommit%> was deprecated)
! ;; Deprecated
  
  mfxsr
  Target Report Mask(ISA_FXSR) Var(ix86_isa_flags) Save
diff -Nrcpad gcc-5.4.0/gcc/config/i386/ia32intrin.h gcc-5.5.0/gcc/config/i386/ia32intrin.h
*** gcc-5.4.0/gcc/config/i386/ia32intrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/ia32intrin.h	Thu Jun  1 21:51:51 2017
*************** __readeflags (void)
*** 249,257 ****
  /* Write flags register */
  extern __inline void
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __writeeflags (unsigned long long X)
  {
!   __builtin_ia32_writeeflags_u64 (X);
  }
  
  #define _bswap64(a)		__bswapq(a)
--- 249,257 ----
  /* Write flags register */
  extern __inline void
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __writeeflags (unsigned long long __X)
  {
!   __builtin_ia32_writeeflags_u64 (__X);
  }
  
  #define _bswap64(a)		__bswapq(a)
*************** __readeflags (void)
*** 269,277 ****
  /* Write flags register */
  extern __inline void
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __writeeflags (unsigned int X)
  {
!   __builtin_ia32_writeeflags_u32 (X);
  }
  
  #endif
--- 269,277 ----
  /* Write flags register */
  extern __inline void
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __writeeflags (unsigned int __X)
  {
!   __builtin_ia32_writeeflags_u32 (__X);
  }
  
  #endif
diff -Nrcpad gcc-5.4.0/gcc/config/i386/lwpintrin.h gcc-5.5.0/gcc/config/i386/lwpintrin.h
*** gcc-5.4.0/gcc/config/i386/lwpintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/lwpintrin.h	Thu Jun  1 21:51:51 2017
***************
*** 35,43 ****
  #endif /* __LWP__ */
  
  extern __inline void __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __llwpcb (void *pcbAddress)
  {
!   __builtin_ia32_llwpcb (pcbAddress);
  }
  
  extern __inline void * __attribute__((__gnu_inline__, __always_inline__, __artificial__))
--- 35,43 ----
  #endif /* __LWP__ */
  
  extern __inline void __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __llwpcb (void *__pcbAddress)
  {
!   __builtin_ia32_llwpcb (__pcbAddress);
  }
  
  extern __inline void * __attribute__((__gnu_inline__, __always_inline__, __artificial__))
*************** __slwpcb (void)
*** 48,63 ****
  
  #ifdef __OPTIMIZE__
  extern __inline void __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __lwpval32 (unsigned int data2, unsigned int data1, unsigned int flags)
  {
!   __builtin_ia32_lwpval32 (data2, data1, flags);
  }
  
  #ifdef __x86_64__
  extern __inline void __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __lwpval64 (unsigned long long data2, unsigned int data1, unsigned int flags)
  {
!   __builtin_ia32_lwpval64 (data2, data1, flags);
  }
  #endif
  #else
--- 48,64 ----
  
  #ifdef __OPTIMIZE__
  extern __inline void __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __lwpval32 (unsigned int __data2, unsigned int __data1, unsigned int __flags)
  {
!   __builtin_ia32_lwpval32 (__data2, __data1, __flags);
  }
  
  #ifdef __x86_64__
  extern __inline void __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __lwpval64 (unsigned long long __data2, unsigned int __data1,
! 	    unsigned int __flags)
  {
!   __builtin_ia32_lwpval64 (__data2, __data1, __flags);
  }
  #endif
  #else
*************** __lwpval64 (unsigned long long data2, un
*** 74,89 ****
  
  #ifdef __OPTIMIZE__
  extern __inline unsigned char __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __lwpins32 (unsigned int data2, unsigned int data1, unsigned int flags)
  {
!   return __builtin_ia32_lwpins32 (data2, data1, flags);
  }
  
  #ifdef __x86_64__
  extern __inline unsigned char __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __lwpins64 (unsigned long long data2, unsigned int data1, unsigned int flags)
  {
!   return __builtin_ia32_lwpins64 (data2, data1, flags);
  }
  #endif
  #else
--- 75,91 ----
  
  #ifdef __OPTIMIZE__
  extern __inline unsigned char __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __lwpins32 (unsigned int __data2, unsigned int __data1, unsigned int __flags)
  {
!   return __builtin_ia32_lwpins32 (__data2, __data1, __flags);
  }
  
  #ifdef __x86_64__
  extern __inline unsigned char __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! __lwpins64 (unsigned long long __data2, unsigned int __data1,
! 	    unsigned int __flags)
  {
!   return __builtin_ia32_lwpins64 (__data2, __data1, __flags);
  }
  #endif
  #else
diff -Nrcpad gcc-5.4.0/gcc/config/i386/mmx.md gcc-5.5.0/gcc/config/i386/mmx.md
*** gcc-5.4.0/gcc/config/i386/mmx.md	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/mmx.md	Tue May 30 08:23:29 2017
***************
*** 78,86 ****
  
  (define_insn "*mov<mode>_internal"
    [(set (match_operand:MMXMODE 0 "nonimmediate_operand"
!     "=r ,o ,r,r ,m ,?!y,!y,?!y,m  ,r   ,?!Ym,v,v,v,m,*x,*x,*x,m ,r ,Yi,!Ym,*Yi")
  	(match_operand:MMXMODE 1 "vector_move_operand"
!     "rCo,rC,C,rm,rC,C  ,!y,m  ,?!y,?!Yn,r   ,C,v,m,v,C ,*x,m ,*x,Yj,r ,*Yj,!Yn"))]
    "TARGET_MMX
     && !(MEM_P (operands[0]) && MEM_P (operands[1]))"
  {
--- 78,86 ----
  
  (define_insn "*mov<mode>_internal"
    [(set (match_operand:MMXMODE 0 "nonimmediate_operand"
!     "=r ,o ,r,r ,m ,?!y,!y,?!y,m  ,r   ,?!Ym,v,v,v,m,r ,Yi,!Ym,*Yi")
  	(match_operand:MMXMODE 1 "vector_move_operand"
!     "rCo,rC,C,rm,rC,C  ,!y,m  ,?!y,?!Yn,r   ,C,v,m,v,Yj,r ,*Yj,!Yn"))]
    "TARGET_MMX
     && !(MEM_P (operands[0]) && MEM_P (operands[1]))"
  {
***************
*** 146,152 ****
    [(set (attr "isa")
       (cond [(eq_attr "alternative" "0,1")
  	      (const_string "nox64")
! 	    (eq_attr "alternative" "2,3,4,9,10,11,12,13,14,19,20")
  	      (const_string "x64")
  	   ]
  	   (const_string "*")))
--- 146,152 ----
    [(set (attr "isa")
       (cond [(eq_attr "alternative" "0,1")
  	      (const_string "nox64")
! 	    (eq_attr "alternative" "2,3,4,9,10,15,16")
  	      (const_string "x64")
  	   ]
  	   (const_string "*")))
***************
*** 159,172 ****
  	      (const_string "mmx")
  	    (eq_attr "alternative" "6,7,8,9,10")
  	      (const_string "mmxmov")
! 	    (eq_attr "alternative" "11,15")
  	      (const_string "sselog1")
! 	    (eq_attr "alternative" "21,22")
  	      (const_string "ssecvt")
  	   ]
  	   (const_string "ssemov")))
     (set (attr "prefix_rex")
!      (if_then_else (eq_attr "alternative" "9,10,19,20")
         (const_string "1")
         (const_string "*")))
     (set (attr "prefix")
--- 159,172 ----
  	      (const_string "mmx")
  	    (eq_attr "alternative" "6,7,8,9,10")
  	      (const_string "mmxmov")
! 	    (eq_attr "alternative" "11")
  	      (const_string "sselog1")
! 	    (eq_attr "alternative" "17,18")
  	      (const_string "ssecvt")
  	   ]
  	   (const_string "ssemov")))
     (set (attr "prefix_rex")
!      (if_then_else (eq_attr "alternative" "9,10,15,16")
         (const_string "1")
         (const_string "*")))
     (set (attr "prefix")
***************
*** 181,187 ****
     (set (attr "mode")
       (cond [(eq_attr "alternative" "2")
  	      (const_string "SI")
! 	    (eq_attr "alternative" "11,12,15,16")
  	      (cond [(ior (match_operand 0 "ext_sse_reg_operand")
  			  (match_operand 1 "ext_sse_reg_operand"))
  			(const_string "XI")
--- 181,187 ----
     (set (attr "mode")
       (cond [(eq_attr "alternative" "2")
  	      (const_string "SI")
! 	    (eq_attr "alternative" "11,12")
  	      (cond [(ior (match_operand 0 "ext_sse_reg_operand")
  			  (match_operand 1 "ext_sse_reg_operand"))
  			(const_string "XI")
***************
*** 197,203 ****
  		    ]
  		    (const_string "TI"))
  
! 	    (and (eq_attr "alternative" "13,14,17,18")
  	    	 (ior (match_test "<MODE>mode == V2SFmode")
  		      (not (match_test "TARGET_SSE2"))))
  	      (const_string "V2SF")
--- 197,203 ----
  		    ]
  		    (const_string "TI"))
  
! 	    (and (eq_attr "alternative" "13,14")
  	    	 (ior (match_test "<MODE>mode == V2SFmode")
  		      (not (match_test "TARGET_SSE2"))))
  	      (const_string "V2SF")
***************
*** 918,924 ****
    [(set (match_operand:MMXMODE24 0 "register_operand" "=y")
          (ashiftrt:MMXMODE24
  	  (match_operand:MMXMODE24 1 "register_operand" "0")
! 	  (match_operand:SI 2 "nonmemory_operand" "yN")))]
    "TARGET_MMX"
    "psra<mmxvecsize>\t{%2, %0|%0, %2}"
    [(set_attr "type" "mmxshft")
--- 918,924 ----
    [(set (match_operand:MMXMODE24 0 "register_operand" "=y")
          (ashiftrt:MMXMODE24
  	  (match_operand:MMXMODE24 1 "register_operand" "0")
! 	  (match_operand:DI 2 "nonmemory_operand" "yN")))]
    "TARGET_MMX"
    "psra<mmxvecsize>\t{%2, %0|%0, %2}"
    [(set_attr "type" "mmxshft")
***************
*** 932,938 ****
    [(set (match_operand:MMXMODE248 0 "register_operand" "=y")
          (any_lshift:MMXMODE248
  	  (match_operand:MMXMODE248 1 "register_operand" "0")
! 	  (match_operand:SI 2 "nonmemory_operand" "yN")))]
    "TARGET_MMX"
    "p<vshift><mmxvecsize>\t{%2, %0|%0, %2}"
    [(set_attr "type" "mmxshft")
--- 932,938 ----
    [(set (match_operand:MMXMODE248 0 "register_operand" "=y")
          (any_lshift:MMXMODE248
  	  (match_operand:MMXMODE248 1 "register_operand" "0")
! 	  (match_operand:DI 2 "nonmemory_operand" "yN")))]
    "TARGET_MMX"
    "p<vshift><mmxvecsize>\t{%2, %0|%0, %2}"
    [(set_attr "type" "mmxshft")
diff -Nrcpad gcc-5.4.0/gcc/config/i386/pcommitintrin.h gcc-5.5.0/gcc/config/i386/pcommitintrin.h
*** gcc-5.4.0/gcc/config/i386/pcommitintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/pcommitintrin.h	Thu Jan  1 00:00:00 1970
***************
*** 1,49 ****
- /* Copyright (C) 2013-2015 Free Software Foundation, Inc.
- 
-    This file is part of GCC.
- 
-    GCC is free software; you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation; either version 3, or (at your option)
-    any later version.
- 
-    GCC is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
- 
-    Under Section 7 of GPL version 3, you are granted additional
-    permissions described in the GCC Runtime Library Exception, version
-    3.1, as published by the Free Software Foundation.
- 
-    You should have received a copy of the GNU General Public License and
-    a copy of the GCC Runtime Library Exception along with this program;
-    see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
-    <http://www.gnu.org/licenses/>.  */
- 
- #if !defined _X86INTRIN_H_INCLUDED
- # error "Never use <pcommitintrin.h> directly; include <x86intrin.h> instead."
- #endif
- 
- #ifndef _PCOMMITINTRIN_H_INCLUDED
- #define _PCOMMITINTRIN_H_INCLUDED
- 
- #ifndef __PCOMMIT__
- #pragma GCC push_options
- #pragma GCC target("pcommit")
- #define __DISABLE_PCOMMIT__
- #endif /* __PCOMMIT__ */
- 
- extern __inline void
- __attribute__((__gnu_inline__, __always_inline__, __artificial__))
- _mm_pcommit (void)
- {
-   __builtin_ia32_pcommit ();
- }
- 
- #ifdef __DISABLE_PCOMMIT__
- #undef __DISABLE_PCOMMIT__
- #pragma GCC pop_options
- #endif /* __DISABLE_PCOMMIT__ */
- 
- #endif /* _PCOMMITINTRIN_H_INCLUDED */
--- 0 ----
diff -Nrcpad gcc-5.4.0/gcc/config/i386/pmm_malloc.h gcc-5.5.0/gcc/config/i386/pmm_malloc.h
*** gcc-5.4.0/gcc/config/i386/pmm_malloc.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/pmm_malloc.h	Thu Jun  1 21:51:51 2017
*************** extern "C" int posix_memalign (void **,
*** 35,57 ****
  #endif
  
  static __inline void *
! _mm_malloc (size_t size, size_t alignment)
  {
!   void *ptr;
!   if (alignment == 1)
!     return malloc (size);
!   if (alignment == 2 || (sizeof (void *) == 8 && alignment == 4))
!     alignment = sizeof (void *);
!   if (posix_memalign (&ptr, alignment, size) == 0)
!     return ptr;
    else
      return NULL;
  }
  
  static __inline void
! _mm_free (void * ptr)
  {
!   free (ptr);
  }
  
  #endif /* _MM_MALLOC_H_INCLUDED */
--- 35,57 ----
  #endif
  
  static __inline void *
! _mm_malloc (size_t __size, size_t __alignment)
  {
!   void *__ptr;
!   if (__alignment == 1)
!     return malloc (__size);
!   if (__alignment == 2 || (sizeof (void *) == 8 && __alignment == 4))
!     __alignment = sizeof (void *);
!   if (posix_memalign (&__ptr, __alignment, __size) == 0)
!     return __ptr;
    else
      return NULL;
  }
  
  static __inline void
! _mm_free (void *__ptr)
  {
!   free (__ptr);
  }
  
  #endif /* _MM_MALLOC_H_INCLUDED */
diff -Nrcpad gcc-5.4.0/gcc/config/i386/rdseedintrin.h gcc-5.5.0/gcc/config/i386/rdseedintrin.h
*** gcc-5.4.0/gcc/config/i386/rdseedintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/rdseedintrin.h	Thu Jun  1 21:51:51 2017
***************
*** 37,60 ****
  
  extern __inline int
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! _rdseed16_step (unsigned short *p)
  {
!     return __builtin_ia32_rdseed_hi_step (p);
  }
  
  extern __inline int
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! _rdseed32_step (unsigned int *p)
  {
!     return __builtin_ia32_rdseed_si_step (p);
  }
  
  #ifdef __x86_64__
  extern __inline int
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! _rdseed64_step (unsigned long long *p)
  {
!     return __builtin_ia32_rdseed_di_step (p);
  }
  #endif
  
--- 37,60 ----
  
  extern __inline int
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! _rdseed16_step (unsigned short *__p)
  {
!     return __builtin_ia32_rdseed_hi_step (__p);
  }
  
  extern __inline int
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! _rdseed32_step (unsigned int *__p)
  {
!     return __builtin_ia32_rdseed_si_step (__p);
  }
  
  #ifdef __x86_64__
  extern __inline int
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! _rdseed64_step (unsigned long long *__p)
  {
!     return __builtin_ia32_rdseed_di_step (__p);
  }
  #endif
  
diff -Nrcpad gcc-5.4.0/gcc/config/i386/rtmintrin.h gcc-5.5.0/gcc/config/i386/rtmintrin.h
*** gcc-5.4.0/gcc/config/i386/rtmintrin.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/rtmintrin.h	Thu Jun  1 21:51:51 2017
*************** _xend (void)
*** 68,76 ****
  #ifdef __OPTIMIZE__
  extern __inline void
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! _xabort (const unsigned int imm)
  {
!   __builtin_ia32_xabort (imm);
  }
  #else
  #define _xabort(N)  __builtin_ia32_xabort (N)
--- 68,76 ----
  #ifdef __OPTIMIZE__
  extern __inline void
  __attribute__((__gnu_inline__, __always_inline__, __artificial__))
! _xabort (const unsigned int __imm)
  {
!   __builtin_ia32_xabort (__imm);
  }
  #else
  #define _xabort(N)  __builtin_ia32_xabort (N)
diff -Nrcpad gcc-5.4.0/gcc/config/i386/sse.md gcc-5.5.0/gcc/config/i386/sse.md
*** gcc-5.4.0/gcc/config/i386/sse.md	Fri Apr 15 15:13:42 2016
--- gcc-5.5.0/gcc/config/i386/sse.md	Tue May 30 08:23:29 2017
***************
*** 4494,4500 ****
  (define_insn "<floatsuffix>float<sseintvecmodelower><mode>2<mask_name><round_name>"
    [(set (match_operand:VF2_AVX512VL 0 "register_operand" "=v")
  	(any_float:VF2_AVX512VL
! 	  (match_operand:<sseintvecmode> 1 "nonimmediate_operand" "vm")))]
    "TARGET_AVX512DQ"
    "vcvt<floatsuffix>qq2pd\t{<round_mask_op2>%1, %0<mask_operand2>|%0<mask_operand2>, %1<round_mask_op2>}"
    [(set_attr "type" "ssecvt")
--- 4494,4500 ----
  (define_insn "<floatsuffix>float<sseintvecmodelower><mode>2<mask_name><round_name>"
    [(set (match_operand:VF2_AVX512VL 0 "register_operand" "=v")
  	(any_float:VF2_AVX512VL
! 	  (match_operand:<sseintvecmode> 1 "nonimmediate_operand" "<round_constraint>")))]
    "TARGET_AVX512DQ"
    "vcvt<floatsuffix>qq2pd\t{<round_mask_op2>%1, %0<mask_operand2>|%0<mask_operand2>, %1<round_mask_op2>}"
    [(set_attr "type" "ssecvt")
***************
*** 9936,9942 ****
    [(set (match_operand:VI24_AVX2 0 "register_operand" "=x,x")
  	(ashiftrt:VI24_AVX2
  	  (match_operand:VI24_AVX2 1 "register_operand" "0,x")
! 	  (match_operand:SI 2 "nonmemory_operand" "xN,xN")))]
    "TARGET_SSE2"
    "@
     psra<ssemodesuffix>\t{%2, %0|%0, %2}
--- 9936,9942 ----
    [(set (match_operand:VI24_AVX2 0 "register_operand" "=x,x")
  	(ashiftrt:VI24_AVX2
  	  (match_operand:VI24_AVX2 1 "register_operand" "0,x")
! 	  (match_operand:DI 2 "nonmemory_operand" "xN,xN")))]
    "TARGET_SSE2"
    "@
     psra<ssemodesuffix>\t{%2, %0|%0, %2}
***************
*** 9955,9961 ****
    [(set (match_operand:VI24_AVX512BW_1 0 "register_operand" "=v,v")
  	(ashiftrt:VI24_AVX512BW_1
  	  (match_operand:VI24_AVX512BW_1 1 "nonimmediate_operand" "v,vm")
! 	  (match_operand:SI 2 "nonmemory_operand" "v,N")))]
    "TARGET_AVX512VL"
    "vpsra<ssemodesuffix>\t{%2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2}"
    [(set_attr "type" "sseishft")
--- 9955,9961 ----
    [(set (match_operand:VI24_AVX512BW_1 0 "register_operand" "=v,v")
  	(ashiftrt:VI24_AVX512BW_1
  	  (match_operand:VI24_AVX512BW_1 1 "nonimmediate_operand" "v,vm")
! 	  (match_operand:DI 2 "nonmemory_operand" "v,N")))]
    "TARGET_AVX512VL"
    "vpsra<ssemodesuffix>\t{%2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2}"
    [(set_attr "type" "sseishft")
***************
*** 9983,9989 ****
    [(set (match_operand:VI248_AVX512BW_AVX512VL 0 "register_operand" "=v,v")
  	(ashiftrt:VI248_AVX512BW_AVX512VL
  	  (match_operand:VI248_AVX512BW_AVX512VL 1 "nonimmediate_operand" "v,vm")
! 	  (match_operand:SI 2 "nonmemory_operand" "v,N")))]
    "TARGET_AVX512F"
    "vpsra<ssemodesuffix>\t{%2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2}"
    [(set_attr "type" "sseishft")
--- 9983,9989 ----
    [(set (match_operand:VI248_AVX512BW_AVX512VL 0 "register_operand" "=v,v")
  	(ashiftrt:VI248_AVX512BW_AVX512VL
  	  (match_operand:VI248_AVX512BW_AVX512VL 1 "nonimmediate_operand" "v,vm")
! 	  (match_operand:DI 2 "nonmemory_operand" "v,N")))]
    "TARGET_AVX512F"
    "vpsra<ssemodesuffix>\t{%2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2}"
    [(set_attr "type" "sseishft")
***************
*** 9997,10003 ****
    [(set (match_operand:VI2_AVX2_AVX512BW 0 "register_operand" "=x,v")
  	(any_lshift:VI2_AVX2_AVX512BW
  	  (match_operand:VI2_AVX2_AVX512BW 1 "register_operand" "0,v")
! 	  (match_operand:SI 2 "nonmemory_operand" "xN,vN")))]
    "TARGET_SSE2 && <mask_mode512bit_condition> && <mask_avx512bw_condition>"
    "@
     p<vshift><ssemodesuffix>\t{%2, %0|%0, %2}
--- 9997,10003 ----
    [(set (match_operand:VI2_AVX2_AVX512BW 0 "register_operand" "=x,v")
  	(any_lshift:VI2_AVX2_AVX512BW
  	  (match_operand:VI2_AVX2_AVX512BW 1 "register_operand" "0,v")
! 	  (match_operand:DI 2 "nonmemory_operand" "xN,vN")))]
    "TARGET_SSE2 && <mask_mode512bit_condition> && <mask_avx512bw_condition>"
    "@
     p<vshift><ssemodesuffix>\t{%2, %0|%0, %2}
***************
*** 10016,10022 ****
    [(set (match_operand:VI48_AVX2 0 "register_operand" "=x,v")
  	(any_lshift:VI48_AVX2
  	  (match_operand:VI48_AVX2 1 "register_operand" "0,v")
! 	  (match_operand:SI 2 "nonmemory_operand" "xN,vN")))]
    "TARGET_SSE2 && <mask_mode512bit_condition>"
    "@
     p<vshift><ssemodesuffix>\t{%2, %0|%0, %2}
--- 10016,10022 ----
    [(set (match_operand:VI48_AVX2 0 "register_operand" "=x,v")
  	(any_lshift:VI48_AVX2
  	  (match_operand:VI48_AVX2 1 "register_operand" "0,v")
! 	  (match_operand:DI 2 "nonmemory_operand" "xN,vN")))]
    "TARGET_SSE2 && <mask_mode512bit_condition>"
    "@
     p<vshift><ssemodesuffix>\t{%2, %0|%0, %2}
***************
*** 10035,10041 ****
    [(set (match_operand:VI48_512 0 "register_operand" "=v,v")
  	(any_lshift:VI48_512
  	  (match_operand:VI48_512 1 "nonimmediate_operand" "v,m")
! 	  (match_operand:SI 2 "nonmemory_operand" "vN,N")))]
    "TARGET_AVX512F && <mask_mode512bit_condition>"
    "vp<vshift><ssemodesuffix>\t{%2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2}"
    [(set_attr "isa" "avx512f")
--- 10035,10041 ----
    [(set (match_operand:VI48_512 0 "register_operand" "=v,v")
  	(any_lshift:VI48_512
  	  (match_operand:VI48_512 1 "nonimmediate_operand" "v,m")
! 	  (match_operand:DI 2 "nonmemory_operand" "vN,N")))]
    "TARGET_AVX512F && <mask_mode512bit_condition>"
    "vp<vshift><ssemodesuffix>\t{%2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2}"
    [(set_attr "isa" "avx512f")
***************
*** 10178,10184 ****
    "TARGET_AVX512F"
    "ix86_fixup_binary_operands_no_copy (<CODE>, <MODE>mode, operands);")
  
! (define_insn "*avx512bw_<code><mode>3<mask_name>"
    [(set (match_operand:VI48_AVX512VL 0 "register_operand" "=v")
  	(maxmin:VI48_AVX512VL
  	  (match_operand:VI48_AVX512VL 1 "nonimmediate_operand" "%v")
--- 10178,10184 ----
    "TARGET_AVX512F"
    "ix86_fixup_binary_operands_no_copy (<CODE>, <MODE>mode, operands);")
  
! (define_insn "*avx512f_<code><mode>3<mask_name>"
    [(set (match_operand:VI48_AVX512VL 0 "register_operand" "=v")
  	(maxmin:VI48_AVX512VL
  	  (match_operand:VI48_AVX512VL 1 "nonimmediate_operand" "%v")
***************
*** 10202,10211 ****
     (set_attr "mode" "<sseinsnmode>")])
  
  (define_expand "<code><mode>3"
!   [(set (match_operand:VI8_AVX2_AVX512BW 0 "register_operand")
! 	(maxmin:VI8_AVX2_AVX512BW
! 	  (match_operand:VI8_AVX2_AVX512BW 1 "register_operand")
! 	  (match_operand:VI8_AVX2_AVX512BW 2 "register_operand")))]
    "TARGET_SSE4_2"
  {
    if (TARGET_AVX512F
--- 10202,10211 ----
     (set_attr "mode" "<sseinsnmode>")])
  
  (define_expand "<code><mode>3"
!   [(set (match_operand:VI8_AVX2_AVX512F 0 "register_operand")
! 	(maxmin:VI8_AVX2_AVX512F
! 	  (match_operand:VI8_AVX2_AVX512F 1 "register_operand")
! 	  (match_operand:VI8_AVX2_AVX512F 2 "register_operand")))]
    "TARGET_SSE4_2"
  {
    if (TARGET_AVX512F
***************
*** 10979,10985 ****
        gcc_assert (TARGET_AVX);
     case MODE_V4SF:
        gcc_assert (TARGET_SSE);
-       gcc_assert (!<mask_applied>);
        tmp = "<logic>ps";
        break;
  
--- 10979,10984 ----
***************
*** 11866,11872 ****
  		       (const_int 12) (const_int 13)
  		       (const_int 14) (const_int 15)]))))]
    "TARGET_AVX512DQ"
!   "vinsert<shuffletype>32x8\t{$0x0, %2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2, $0x0}"
    [(set_attr "type" "sselog")
     (set_attr "length_immediate" "1")
     (set_attr "prefix" "evex")
--- 11865,11871 ----
  		       (const_int 12) (const_int 13)
  		       (const_int 14) (const_int 15)]))))]
    "TARGET_AVX512DQ"
!   "vinsert<shuffletype>32x8\t{$0x0, %2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2, 0x0}"
    [(set_attr "type" "sselog")
     (set_attr "length_immediate" "1")
     (set_attr "prefix" "evex")
***************
*** 11883,11889 ****
  		       (const_int 6) (const_int 7)]))
  	  (match_operand:<ssehalfvecmode> 2 "nonimmediate_operand" "vm")))]
    "TARGET_AVX512DQ"
!   "vinsert<shuffletype>32x8\t{$0x1, %2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2, $0x1}"
    [(set_attr "type" "sselog")
     (set_attr "length_immediate" "1")
     (set_attr "prefix" "evex")
--- 11882,11888 ----
  		       (const_int 6) (const_int 7)]))
  	  (match_operand:<ssehalfvecmode> 2 "nonimmediate_operand" "vm")))]
    "TARGET_AVX512DQ"
!   "vinsert<shuffletype>32x8\t{$0x1, %2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2, 0x1}"
    [(set_attr "type" "sselog")
     (set_attr "length_immediate" "1")
     (set_attr "prefix" "evex")
***************
*** 11898,11904 ****
  	    (parallel [(const_int 4) (const_int 5)
  		       (const_int 6) (const_int 7)]))))]
    "TARGET_AVX512F"
!   "vinsert<shuffletype>64x4\t{$0x0, %2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2, $0x0}"
    [(set_attr "type" "sselog")
     (set_attr "length_immediate" "1")
     (set_attr "prefix" "evex")
--- 11897,11903 ----
  	    (parallel [(const_int 4) (const_int 5)
  		       (const_int 6) (const_int 7)]))))]
    "TARGET_AVX512F"
!   "vinsert<shuffletype>64x4\t{$0x0, %2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2, 0x0}"
    [(set_attr "type" "sselog")
     (set_attr "length_immediate" "1")
     (set_attr "prefix" "evex")
***************
*** 11913,11919 ****
  		       (const_int 2) (const_int 3)]))
  	  (match_operand:<ssehalfvecmode> 2 "nonimmediate_operand" "vm")))]
    "TARGET_AVX512F"
!   "vinsert<shuffletype>64x4\t{$0x1, %2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2, $0x1}"
    [(set_attr "type" "sselog")
     (set_attr "length_immediate" "1")
     (set_attr "prefix" "evex")
--- 11912,11918 ----
  		       (const_int 2) (const_int 3)]))
  	  (match_operand:<ssehalfvecmode> 2 "nonimmediate_operand" "vm")))]
    "TARGET_AVX512F"
!   "vinsert<shuffletype>64x4\t{$0x1, %2, %1, %0<mask_operand3>|%0<mask_operand3>, %1, %2, 0x1}"
    [(set_attr "type" "sselog")
     (set_attr "length_immediate" "1")
     (set_attr "prefix" "evex")
***************
*** 13060,13069 ****
  ;; movd instead of movq is required to handle broken assemblers.
  (define_insn "vec_concatv2di"
    [(set (match_operand:V2DI 0 "register_operand"
! 	  "=Yr,*x,x ,Yi,x ,!x,x,x,x,x,x")
  	(vec_concat:V2DI
  	  (match_operand:DI 1 "nonimmediate_operand"
! 	  "  0, 0,x ,r ,xm,*y,0,x,0,0,x")
  	  (match_operand:DI 2 "vector_move_operand"
  	  "*rm,rm,rm,C ,C ,C ,x,x,x,m,m")))]
    "TARGET_SSE"
--- 13059,13068 ----
  ;; movd instead of movq is required to handle broken assemblers.
  (define_insn "vec_concatv2di"
    [(set (match_operand:V2DI 0 "register_operand"
! 	  "=Yr,*x,x ,Yi,x ,x    ,x,x,x,x,x")
  	(vec_concat:V2DI
  	  (match_operand:DI 1 "nonimmediate_operand"
! 	  "  0, 0,x ,r ,xm,?!*Yn,0,x,0,0,x")
  	  (match_operand:DI 2 "vector_move_operand"
  	  "*rm,rm,rm,C ,C ,C ,x,x,x,m,m")))]
    "TARGET_SSE"
diff -Nrcpad gcc-5.4.0/gcc/config/i386/stringop.opt gcc-5.5.0/gcc/config/i386/stringop.opt
*** gcc-5.4.0/gcc/config/i386/stringop.opt	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/stringop.opt	Thu Jan  1 00:00:00 1970
***************
*** 1,31 ****
- /* Definitions for stringop option handling for IA-32.
-    Copyright (C) 2013-2015 Free Software Foundation, Inc.
- 
- This file is part of GCC.
- 
- GCC is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 3, or (at your option)
- any later version.
- 
- GCC is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- GNU General Public License for more details.
- 
- You should have received a copy of the GNU General Public License
- along with GCC; see the files COPYING3.  If not,
- see <http://www.gnu.org/licenses/>.  */
- 
- Enum(stringop_alg) String(rep_byte) Value(rep_prefix_1_byte)
- 
- #undef DEF_ENUM
- #define DEF_ENUM EnumValue
- 
- #undef DEF_ALG
- #define DEF_ALG(alg, name) Enum(stringop_alg) String(name) Value(alg)
- 
- #include "stringop.def"
- 
- #undef DEF_ENUM
- #undef DEF_ALG
--- 0 ----
diff -Nrcpad gcc-5.4.0/gcc/config/i386/x86-64.h gcc-5.5.0/gcc/config/i386/x86-64.h
*** gcc-5.4.0/gcc/config/i386/x86-64.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/i386/x86-64.h	Sat Feb 18 22:58:48 2017
*************** see the files COPYING3 and COPYING.RUNTI
*** 49,55 ****
  #define WCHAR_TYPE_SIZE 32
  
  #undef ASM_SPEC
! #define ASM_SPEC "%{m32:--32} %{m64:--64} %{mx32:--x32}"
  
  #undef ASM_OUTPUT_ALIGNED_BSS
  #define ASM_OUTPUT_ALIGNED_BSS(FILE, DECL, NAME, SIZE, ALIGN) \
--- 49,55 ----
  #define WCHAR_TYPE_SIZE 32
  
  #undef ASM_SPEC
! #define ASM_SPEC "%{m16|m32:--32} %{m64:--64} %{mx32:--x32}"
  
  #undef ASM_OUTPUT_ALIGNED_BSS
  #define ASM_OUTPUT_ALIGNED_BSS(FILE, DECL, NAME, SIZE, ALIGN) \
diff -Nrcpad gcc-5.4.0/gcc/config/i386/x86intrin.h gcc-5.5.0/gcc/config/i386/x86intrin.h
*** gcc-5.4.0/gcc/config/i386/x86intrin.h	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/config/i386/x86intrin.h	Thu Oct 13 21:19:00 2016
***************
*** 77,84 ****
  
  #include <clwbintrin.h>
  
- #include <pcommitintrin.h>
- 
  #include <clflushoptintrin.h>
  
  #include <xsavesintrin.h>
--- 77,82 ----
diff -Nrcpad gcc-5.4.0/gcc/config/nds32/nds32.md gcc-5.5.0/gcc/config/nds32/nds32.md
*** gcc-5.4.0/gcc/config/nds32/nds32.md	Fri Jan 16 06:45:09 2015
--- gcc-5.5.0/gcc/config/nds32/nds32.md	Tue Jan 10 04:23:35 2017
*************** create_template:
*** 2289,2299 ****
    emit_jump_insn (gen_cbranchsi4 (test, operands[0], operands[2],
  				  operands[4]));
  
!   operands[5] = gen_reg_rtx (SImode);
!   /* Step C, D, E, and F, using another temporary register operands[5].  */
!   emit_jump_insn (gen_casesi_internal (operands[0],
! 				       operands[3],
! 				       operands[5]));
    DONE;
  })
  
--- 2289,2297 ----
    emit_jump_insn (gen_cbranchsi4 (test, operands[0], operands[2],
  				  operands[4]));
  
!   /* Step C, D, E, and F, using another temporary register.  */
!   rtx tmp = gen_reg_rtx (SImode);
!   emit_jump_insn (gen_casesi_internal (operands[0], operands[3], tmp));
    DONE;
  })
  
diff -Nrcpad gcc-5.4.0/gcc/config/pa/pa-64.h gcc-5.5.0/gcc/config/pa/pa-64.h
*** gcc-5.4.0/gcc/config/pa/pa-64.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/pa/pa-64.h	Mon Mar  6 22:55:33 2017
*************** along with GCC; see the file COPYING3.
*** 83,89 ****
     arguments are padded down when BYTES_BIG_ENDIAN is true.  We don't
     want aggregates padded down.  */
  
! #define PAD_VARARGS_DOWN (!AGGREGATE_TYPE_P (type))
  
  /* In the PA architecture, it is not possible to directly move data
     between GENERAL_REGS and FP_REGS.  On the 32-bit port, we use the
--- 83,92 ----
     arguments are padded down when BYTES_BIG_ENDIAN is true.  We don't
     want aggregates padded down.  */
  
! #define PAD_VARARGS_DOWN \
!   (!AGGREGATE_TYPE_P (type) \
!    && TREE_CODE (type) != COMPLEX_TYPE \
!    && TREE_CODE (type) != VECTOR_TYPE)
  
  /* In the PA architecture, it is not possible to directly move data
     between GENERAL_REGS and FP_REGS.  On the 32-bit port, we use the
diff -Nrcpad gcc-5.4.0/gcc/config/pa/pa.h gcc-5.5.0/gcc/config/pa/pa.h
*** gcc-5.4.0/gcc/config/pa/pa.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/pa/pa.h	Sat Oct 29 15:47:41 2016
*************** typedef struct GTY(()) machine_function
*** 298,306 ****
  /* A bit-field declared as `int' forces `int' alignment for the struct.  */
  #define PCC_BITFIELD_TYPE_MATTERS 1
  
! /* No data type wants to be aligned rounder than this.  */
  #define BIGGEST_ALIGNMENT (2 * BITS_PER_WORD)
  
  /* Get around hp-ux assembler bug, and make strcpy of constants fast.  */
  #define CONSTANT_ALIGNMENT(EXP, ALIGN)		\
    (TREE_CODE (EXP) == STRING_CST		\
--- 298,320 ----
  /* A bit-field declared as `int' forces `int' alignment for the struct.  */
  #define PCC_BITFIELD_TYPE_MATTERS 1
  
! /* No data type wants to be aligned rounder than this.  The long double
!    type has 16-byte alignment on the 64-bit target even though it was never
!    implemented in hardware.  The software implementation only needs 8-byte
!    alignment.  This matches the biggest alignment of the HP compilers.  */
  #define BIGGEST_ALIGNMENT (2 * BITS_PER_WORD)
  
+ /* Alignment, in bits, a C conformant malloc implementation has to provide.
+    The HP-UX malloc implementation provides a default alignment of 8 bytes.
+    It should be 16 bytes on the 64-bit target since long double has 16-byte
+    alignment.  It can be increased with mallopt but it's non critical since
+    long double was never implemented in hardware.  The glibc implementation
+    currently provides 8-byte alignment.  It should be 16 bytes since various
+    POSIX types such as pthread_mutex_t require 16-byte alignment.  Again,
+    this is non critical since 16-byte alignment is no longer needed for
+    atomic operations.  */
+ #define MALLOC_ABI_ALIGNMENT (TARGET_SOM ? 64 : 128)
+ 
  /* Get around hp-ux assembler bug, and make strcpy of constants fast.  */
  #define CONSTANT_ALIGNMENT(EXP, ALIGN)		\
    (TREE_CODE (EXP) == STRING_CST		\
diff -Nrcpad gcc-5.4.0/gcc/config/phoenix.h gcc-5.5.0/gcc/config/phoenix.h
*** gcc-5.4.0/gcc/config/phoenix.h	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/config/phoenix.h	Wed Aug 31 09:38:42 2016
***************
*** 0 ****
--- 1,33 ----
+ /* Base configuration file for all Phoenix-RTOS targets.
+    Copyright (C) 2016 Free Software Foundation, Inc.
+ 
+ This file is part of GCC.
+ 
+ GCC is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3, or (at your option)
+ any later version.
+ 
+ GCC is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU General Public License for more details.
+ 
+ You should have received a copy of the GNU General Public License
+ along with GCC; see the file COPYING3.  If not see
+ <http://www.gnu.org/licenses/>.  */
+ 
+ #undef TARGET_OS_CPP_BUILTINS
+ #define TARGET_OS_CPP_BUILTINS()           \
+     do {                                   \
+       builtin_define_std ("phoenix");      \
+       builtin_define_std ("unix");         \
+       builtin_assert ("system=phoenix");   \
+       builtin_assert ("system=unix");      \
+     } while(0);
+ 
+ #define STD_LIB_SPEC "%{!shared:%{g*:-lg} %{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}}"
+ 
+ /* This will prevent selecting 'unsigned long int' instead of 'unsigned int' as 'uint32_t' in stdint-newlib.h. */
+ #undef STDINT_LONG32
+ #define STDINT_LONG32		0
diff -Nrcpad gcc-5.4.0/gcc/config/rl78/rl78-expand.md gcc-5.5.0/gcc/config/rl78/rl78-expand.md
*** gcc-5.4.0/gcc/config/rl78/rl78-expand.md	Tue Feb 24 21:52:19 2015
--- gcc-5.5.0/gcc/config/rl78/rl78-expand.md	Thu Aug 18 12:14:33 2016
***************
*** 159,165 ****
    [(set (match_operand:HI 0 "register_operand")
          (mult:HI (zero_extend:HI (match_operand:QI 1 "register_operand"))
                   (zero_extend:HI (match_operand:QI 2 "register_operand"))))]
!   "!TARGET_G10"
    ""
  )
  
--- 159,165 ----
    [(set (match_operand:HI 0 "register_operand")
          (mult:HI (zero_extend:HI (match_operand:QI 1 "register_operand"))
                   (zero_extend:HI (match_operand:QI 2 "register_operand"))))]
!   ""
    ""
  )
  
diff -Nrcpad gcc-5.4.0/gcc/config/rl78/rl78-real.md gcc-5.5.0/gcc/config/rl78/rl78-real.md
*** gcc-5.4.0/gcc/config/rl78/rl78-real.md	Wed Mar  4 14:54:15 2015
--- gcc-5.5.0/gcc/config/rl78/rl78-real.md	Thu Aug 18 12:14:33 2016
***************
*** 179,185 ****
    [(set (match_operand:HI 0 "register_operand" "=A,A")
          (mult:HI (match_operand:HI 1 "rl78_nonfar_operand" "0,0")
                   (match_operand:HI 2 "rl78_24_operand" "N,i")))]
!   "rl78_real_insns_ok () && !TARGET_G10"
    "@
     shlw\t%0, 1
     shlw\t%0, 2"
--- 179,185 ----
    [(set (match_operand:HI 0 "register_operand" "=A,A")
          (mult:HI (match_operand:HI 1 "rl78_nonfar_operand" "0,0")
                   (match_operand:HI 2 "rl78_24_operand" "N,i")))]
!   "rl78_real_insns_ok ()"
    "@
     shlw\t%0, 1
     shlw\t%0, 2"
***************
*** 189,195 ****
    [(set (match_operand:HI 0 "nonimmediate_operand" "=A")
          (mult:HI (zero_extend:HI (match_operand:QI 1 "general_operand" "%a"))
                   (zero_extend:HI (match_operand:QI 2 "general_operand" "x"))))]
!   "rl78_real_insns_ok () && !TARGET_G10"
    "mulu\t%2"
  )
  
--- 189,195 ----
    [(set (match_operand:HI 0 "nonimmediate_operand" "=A")
          (mult:HI (zero_extend:HI (match_operand:QI 1 "general_operand" "%a"))
                   (zero_extend:HI (match_operand:QI 2 "general_operand" "x"))))]
!   "rl78_real_insns_ok ()"
    "mulu\t%2"
  )
  
diff -Nrcpad gcc-5.4.0/gcc/config/rl78/rl78-virt.md gcc-5.5.0/gcc/config/rl78/rl78-virt.md
*** gcc-5.4.0/gcc/config/rl78/rl78-virt.md	Thu Mar 19 04:00:51 2015
--- gcc-5.5.0/gcc/config/rl78/rl78-virt.md	Thu Aug 18 12:14:33 2016
***************
*** 116,122 ****
    [(set (match_operand:HI 0 "register_operand" "=vm")
          (mult:HI (match_operand:HI 1 "rl78_nonfar_operand" "%vim")
                   (match_operand:HI 2 "rl78_24_operand" "Ni")))]
!   "rl78_virt_insns_ok () && !TARGET_G10"
    "v.mulu\t%0, %1, %2"
    [(set_attr "valloc" "umul")]
  )
--- 116,122 ----
    [(set (match_operand:HI 0 "register_operand" "=vm")
          (mult:HI (match_operand:HI 1 "rl78_nonfar_operand" "%vim")
                   (match_operand:HI 2 "rl78_24_operand" "Ni")))]
!   "rl78_virt_insns_ok ()"
    "v.mulu\t%0, %1, %2"
    [(set_attr "valloc" "umul")]
  )
***************
*** 125,131 ****
    [(set (match_operand:HI 0 "register_operand" "=vm")
          (mult:HI (zero_extend:HI (match_operand:QI 1 "rl78_nonfar_operand" "%vim"))
                   (zero_extend:HI (match_operand:QI 2 "general_operand" "vim"))))]
!   "rl78_virt_insns_ok () && !TARGET_G10"
    "v.mulu\t%0, %2"
    [(set_attr "valloc" "umul")]
  )
--- 125,131 ----
    [(set (match_operand:HI 0 "register_operand" "=vm")
          (mult:HI (zero_extend:HI (match_operand:QI 1 "rl78_nonfar_operand" "%vim"))
                   (zero_extend:HI (match_operand:QI 2 "general_operand" "vim"))))]
!   "rl78_virt_insns_ok ()"
    "v.mulu\t%0, %2"
    [(set_attr "valloc" "umul")]
  )
diff -Nrcpad gcc-5.4.0/gcc/config/rs6000/altivec.md gcc-5.5.0/gcc/config/rs6000/altivec.md
*** gcc-5.4.0/gcc/config/rs6000/altivec.md	Wed Feb 17 17:49:22 2016
--- gcc-5.5.0/gcc/config/rs6000/altivec.md	Tue Sep 12 21:07:30 2017
***************
*** 1628,1678 ****
    "vsum4s<VI_char>s %0,%1,%2"
    [(set_attr "type" "veccomplex")])
  
! ;; FIXME: For the following two patterns, the scratch should only be
! ;; allocated for !VECTOR_ELT_ORDER_BIG, and the instructions should
! ;; be emitted separately.
! (define_insn "altivec_vsum2sws"
!   [(set (match_operand:V4SI 0 "register_operand" "=v")
!         (unspec:V4SI [(match_operand:V4SI 1 "register_operand" "v")
!                       (match_operand:V4SI 2 "register_operand" "v")]
! 		     UNSPEC_VSUM2SWS))
!    (set (reg:SI 110) (unspec:SI [(const_int 0)] UNSPEC_SET_VSCR))
!    (clobber (match_scratch:V4SI 3 "=v"))]
    "TARGET_ALTIVEC"
  {
    if (VECTOR_ELT_ORDER_BIG)
!     return "vsum2sws %0,%1,%2";
    else
!     return "vsldoi %3,%2,%2,12\n\tvsum2sws %3,%1,%3\n\tvsldoi %0,%3,%3,4";
! }
!   [(set_attr "type" "veccomplex")
!    (set (attr "length")
!      (if_then_else
!        (match_test "VECTOR_ELT_ORDER_BIG")
!        (const_string "4")
!        (const_string "12")))])
  
! (define_insn "altivec_vsumsws"
    [(set (match_operand:V4SI 0 "register_operand" "=v")
          (unspec:V4SI [(match_operand:V4SI 1 "register_operand" "v")
!                       (match_operand:V4SI 2 "register_operand" "v")]
! 		     UNSPEC_VSUMSWS))
!    (set (reg:SI 110) (unspec:SI [(const_int 0)] UNSPEC_SET_VSCR))
!    (clobber (match_scratch:V4SI 3 "=v"))]
    "TARGET_ALTIVEC"
  {
    if (VECTOR_ELT_ORDER_BIG)
!     return "vsumsws %0,%1,%2";
    else
!     return "vspltw %3,%2,0\n\tvsumsws %3,%1,%3\n\tvsldoi %0,%3,%3,12";
! }
!   [(set_attr "type" "veccomplex")
!    (set (attr "length")
!      (if_then_else
!        (match_test "(VECTOR_ELT_ORDER_BIG)")
!        (const_string "4")
!        (const_string "12")))])
  
  (define_insn "altivec_vsumsws_direct"
    [(set (match_operand:V4SI 0 "register_operand" "=v")
          (unspec:V4SI [(match_operand:V4SI 1 "register_operand" "v")
--- 1628,1688 ----
    "vsum4s<VI_char>s %0,%1,%2"
    [(set_attr "type" "veccomplex")])
  
! (define_expand "altivec_vsum2sws"
!   [(use (match_operand:V4SI 0 "register_operand"))
!    (use (match_operand:V4SI 1 "register_operand"))
!    (use (match_operand:V4SI 2 "register_operand"))]
    "TARGET_ALTIVEC"
  {
    if (VECTOR_ELT_ORDER_BIG)
!     emit_insn (gen_altivec_vsum2sws_direct (operands[0], operands[1],
!                                             operands[2]));
    else
!     {
!       rtx tmp1 = gen_reg_rtx (V4SImode);
!       rtx tmp2 = gen_reg_rtx (V4SImode);
!       emit_insn (gen_altivec_vsldoi_v4si (tmp1, operands[2],
!                                           operands[2], GEN_INT (12)));
!       emit_insn (gen_altivec_vsum2sws_direct (tmp2, operands[1], tmp1));
!       emit_insn (gen_altivec_vsldoi_v4si (operands[0], tmp2, tmp2,
!                                           GEN_INT (4)));
!     }
!   DONE;
! })
  
! ; FIXME: This can probably be expressed without an UNSPEC.
! (define_insn "altivec_vsum2sws_direct"
    [(set (match_operand:V4SI 0 "register_operand" "=v")
          (unspec:V4SI [(match_operand:V4SI 1 "register_operand" "v")
! 	              (match_operand:V4SI 2 "register_operand" "v")]
! 		     UNSPEC_VSUM2SWS))
!    (set (reg:SI VSCR_REGNO) (unspec:SI [(const_int 0)] UNSPEC_SET_VSCR))]
!   "TARGET_ALTIVEC"
!   "vsum2sws %0,%1,%2"
!   [(set_attr "type" "veccomplex")])
! 
! (define_expand "altivec_vsumsws"
!   [(use (match_operand:V4SI 0 "register_operand"))
!    (use (match_operand:V4SI 1 "register_operand"))
!    (use (match_operand:V4SI 2 "register_operand"))]
    "TARGET_ALTIVEC"
  {
    if (VECTOR_ELT_ORDER_BIG)
!     emit_insn (gen_altivec_vsumsws_direct (operands[0], operands[1],
!                                            operands[2]));
    else
!     {
!       rtx tmp1 = gen_reg_rtx (V4SImode);
!       rtx tmp2 = gen_reg_rtx (V4SImode);
!       emit_insn (gen_altivec_vspltw_direct (tmp1, operands[2], const0_rtx));
!       emit_insn (gen_altivec_vsumsws_direct (tmp2, operands[1], tmp1));
!       emit_insn (gen_altivec_vsldoi_v4si (operands[0], tmp2, tmp2,
!                                           GEN_INT (12)));
!     }
!   DONE;
! })
  
+ ; FIXME: This can probably be expressed without an UNSPEC.
  (define_insn "altivec_vsumsws_direct"
    [(set (match_operand:V4SI 0 "register_operand" "=v")
          (unspec:V4SI [(match_operand:V4SI 1 "register_operand" "v")
diff -Nrcpad gcc-5.4.0/gcc/config/rs6000/dfp.md gcc-5.5.0/gcc/config/rs6000/dfp.md
*** gcc-5.4.0/gcc/config/rs6000/dfp.md	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/config/rs6000/dfp.md	Thu Mar 30 20:09:32 2017
***************
*** 344,359 ****
    [(set_attr "type" "fp")])
  
  (define_insn "dfp_dxex_<mode>"
!   [(set (match_operand:D64_D128 0 "gpc_reg_operand" "=d")
! 	(unspec:D64_D128 [(match_operand:D64_D128 1 "gpc_reg_operand" "d")]
! 			 UNSPEC_DXEX))]
    "TARGET_DFP"
    "dxex<dfp_suffix> %0,%1"
    [(set_attr "type" "fp")])
  
  (define_insn "dfp_diex_<mode>"
    [(set (match_operand:D64_D128 0 "gpc_reg_operand" "=d")
! 	(unspec:D64_D128 [(match_operand:D64_D128 1 "gpc_reg_operand" "d")
  			  (match_operand:D64_D128 2 "gpc_reg_operand" "d")]
  			 UNSPEC_DXEX))]
    "TARGET_DFP"
--- 344,359 ----
    [(set_attr "type" "fp")])
  
  (define_insn "dfp_dxex_<mode>"
!   [(set (match_operand:DI 0 "gpc_reg_operand" "=d")
! 	(unspec:DI [(match_operand:D64_D128 1 "gpc_reg_operand" "d")]
! 		   UNSPEC_DXEX))]
    "TARGET_DFP"
    "dxex<dfp_suffix> %0,%1"
    [(set_attr "type" "fp")])
  
  (define_insn "dfp_diex_<mode>"
    [(set (match_operand:D64_D128 0 "gpc_reg_operand" "=d")
! 	(unspec:D64_D128 [(match_operand:DI 1 "gpc_reg_operand" "d")
  			  (match_operand:D64_D128 2 "gpc_reg_operand" "d")]
  			 UNSPEC_DXEX))]
    "TARGET_DFP"
diff -Nrcpad gcc-5.4.0/gcc/config/rs6000/predicates.md gcc-5.5.0/gcc/config/rs6000/predicates.md
*** gcc-5.4.0/gcc/config/rs6000/predicates.md	Wed Mar 30 00:36:36 2016
--- gcc-5.5.0/gcc/config/rs6000/predicates.md	Fri Mar 10 20:53:18 2017
***************
*** 1049,1055 ****
    (and (match_code "symbol_ref")
         (match_test "(DEFAULT_ABI != ABI_AIX || SYMBOL_REF_FUNCTION_P (op))
  		    && (SYMBOL_REF_LOCAL_P (op)
! 			|| op == XEXP (DECL_RTL (current_function_decl), 0))
  		    && !((DEFAULT_ABI == ABI_AIX
  			  || DEFAULT_ABI == ABI_ELFv2)
  			 && (SYMBOL_REF_EXTERNAL_P (op)
--- 1049,1056 ----
    (and (match_code "symbol_ref")
         (match_test "(DEFAULT_ABI != ABI_AIX || SYMBOL_REF_FUNCTION_P (op))
  		    && (SYMBOL_REF_LOCAL_P (op)
! 			|| (op == XEXP (DECL_RTL (current_function_decl), 0)
! 			    && !decl_replaceable_p (current_function_decl)))
  		    && !((DEFAULT_ABI == ABI_AIX
  			  || DEFAULT_ABI == ABI_ELFv2)
  			 && (SYMBOL_REF_EXTERNAL_P (op)
diff -Nrcpad gcc-5.4.0/gcc/config/rs6000/rs6000-c.c gcc-5.5.0/gcc/config/rs6000/rs6000-c.c
*** gcc-5.4.0/gcc/config/rs6000/rs6000-c.c	Wed Mar 30 12:43:44 2016
--- gcc-5.5.0/gcc/config/rs6000/rs6000-c.c	Wed Mar  1 21:17:46 2017
*************** const struct altivec_builtin_types altiv
*** 2065,2078 ****
      RS6000_BTI_unsigned_V8HI, RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V4SI, 0 },
    { ALTIVEC_BUILTIN_VEC_PACKS, ALTIVEC_BUILTIN_VPKSWSS,
      RS6000_BTI_V8HI, RS6000_BTI_V4SI, RS6000_BTI_V4SI, 0 },
-   { ALTIVEC_BUILTIN_VEC_VPKSWSS, ALTIVEC_BUILTIN_VPKSWSS,
-     RS6000_BTI_V8HI, RS6000_BTI_V4SI, RS6000_BTI_V4SI, 0 },
-   { ALTIVEC_BUILTIN_VEC_VPKUWUS, ALTIVEC_BUILTIN_VPKUWUS,
-     RS6000_BTI_unsigned_V8HI, RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V4SI, 0 },
    { ALTIVEC_BUILTIN_VEC_PACKS, P8V_BUILTIN_VPKUDUS,
      RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
    { ALTIVEC_BUILTIN_VEC_PACKS, P8V_BUILTIN_VPKSDSS,
      RS6000_BTI_V4SI, RS6000_BTI_V2DI, RS6000_BTI_V2DI, 0 },
    { ALTIVEC_BUILTIN_VEC_VPKSHSS, ALTIVEC_BUILTIN_VPKSHSS,
      RS6000_BTI_V16QI, RS6000_BTI_V8HI, RS6000_BTI_V8HI, 0 },
    { ALTIVEC_BUILTIN_VEC_VPKUHUS, ALTIVEC_BUILTIN_VPKUHUS,
--- 2065,2078 ----
      RS6000_BTI_unsigned_V8HI, RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V4SI, 0 },
    { ALTIVEC_BUILTIN_VEC_PACKS, ALTIVEC_BUILTIN_VPKSWSS,
      RS6000_BTI_V8HI, RS6000_BTI_V4SI, RS6000_BTI_V4SI, 0 },
    { ALTIVEC_BUILTIN_VEC_PACKS, P8V_BUILTIN_VPKUDUS,
      RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
    { ALTIVEC_BUILTIN_VEC_PACKS, P8V_BUILTIN_VPKSDSS,
      RS6000_BTI_V4SI, RS6000_BTI_V2DI, RS6000_BTI_V2DI, 0 },
+   { ALTIVEC_BUILTIN_VEC_VPKSWSS, ALTIVEC_BUILTIN_VPKSWSS,
+     RS6000_BTI_V8HI, RS6000_BTI_V4SI, RS6000_BTI_V4SI, 0 },
+   { ALTIVEC_BUILTIN_VEC_VPKUWUS, ALTIVEC_BUILTIN_VPKUWUS,
+     RS6000_BTI_unsigned_V8HI, RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V4SI, 0 },
    { ALTIVEC_BUILTIN_VEC_VPKSHSS, ALTIVEC_BUILTIN_VPKSHSS,
      RS6000_BTI_V16QI, RS6000_BTI_V8HI, RS6000_BTI_V8HI, 0 },
    { ALTIVEC_BUILTIN_VEC_VPKUHUS, ALTIVEC_BUILTIN_VPKUHUS,
*************** const struct altivec_builtin_types altiv
*** 2343,2349 ****
      RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V4SI, 0 },
    { ALTIVEC_BUILTIN_VEC_SRA, P8V_BUILTIN_VSRAD,
      RS6000_BTI_V2DI, RS6000_BTI_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
!   { ALTIVEC_BUILTIN_VEC_SRA, P8V_BUILTIN_VSRD,
      RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
    { ALTIVEC_BUILTIN_VEC_VSRAW, ALTIVEC_BUILTIN_VSRAW,
      RS6000_BTI_V4SI, RS6000_BTI_V4SI, RS6000_BTI_unsigned_V4SI, 0 },
--- 2343,2349 ----
      RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V4SI, RS6000_BTI_unsigned_V4SI, 0 },
    { ALTIVEC_BUILTIN_VEC_SRA, P8V_BUILTIN_VSRAD,
      RS6000_BTI_V2DI, RS6000_BTI_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
!   { ALTIVEC_BUILTIN_VEC_SRA, P8V_BUILTIN_VSRAD,
      RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
    { ALTIVEC_BUILTIN_VEC_VSRAW, ALTIVEC_BUILTIN_VSRAW,
      RS6000_BTI_V4SI, RS6000_BTI_V4SI, RS6000_BTI_unsigned_V4SI, 0 },
*************** const struct altivec_builtin_types altiv
*** 4158,4164 ****
  
    { P8V_BUILTIN_VEC_VSRAD, P8V_BUILTIN_VSRAD,
      RS6000_BTI_V2DI, RS6000_BTI_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
!   { P8V_BUILTIN_VEC_VSRAD, P8V_BUILTIN_VSRD,
      RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
  
    { P8V_BUILTIN_VEC_VSUBCUQ, P8V_BUILTIN_VSUBCUQ,
--- 4158,4164 ----
  
    { P8V_BUILTIN_VEC_VSRAD, P8V_BUILTIN_VSRAD,
      RS6000_BTI_V2DI, RS6000_BTI_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
!   { P8V_BUILTIN_VEC_VSRAD, P8V_BUILTIN_VSRAD,
      RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, RS6000_BTI_unsigned_V2DI, 0 },
  
    { P8V_BUILTIN_VEC_VSUBCUQ, P8V_BUILTIN_VSUBCUQ,
*************** const struct altivec_builtin_types altiv
*** 4196,4206 ****
    { P8V_BUILTIN_VEC_VUPKLSW, P8V_BUILTIN_VUPKLSW,
      RS6000_BTI_bool_V2DI, RS6000_BTI_bool_V4SI, 0, 0 },
  
-   { P8V_BUILTIN_VEC_VGBBD, P8V_BUILTIN_VGBBD,
-     RS6000_BTI_V16QI, 0, 0, 0 },
-   { P8V_BUILTIN_VEC_VGBBD, P8V_BUILTIN_VGBBD,
-     RS6000_BTI_unsigned_V16QI, 0, 0, 0 },
- 
    /* Crypto builtins.  */
    { CRYPTO_BUILTIN_VPERMXOR, CRYPTO_BUILTIN_VPERMXOR_V16QI,
      RS6000_BTI_unsigned_V16QI, RS6000_BTI_unsigned_V16QI,
--- 4196,4201 ----
diff -Nrcpad gcc-5.4.0/gcc/config/rs6000/rs6000.c gcc-5.5.0/gcc/config/rs6000/rs6000.c
*** gcc-5.4.0/gcc/config/rs6000/rs6000.c	Wed Mar 30 12:35:50 2016
--- gcc-5.5.0/gcc/config/rs6000/rs6000.c	Thu Sep 21 13:25:45 2017
*************** rs6000_option_override_internal (bool gl
*** 3268,3273 ****
--- 3268,3280 ----
        && !global_options_set.x_flag_ira_loop_pressure)
      flag_ira_loop_pressure = 1;
  
+   /* -fsanitize=address needs to turn on -fasynchronous-unwind-tables in order
+      for tracebacks to be complete but not if any -fasynchronous-unwind-tables
+      options were already specified.  */
+   if (flag_sanitize & SANITIZE_USER_ADDRESS
+       && !global_options_set.x_flag_asynchronous_unwind_tables)
+     flag_asynchronous_unwind_tables = 1;
+ 
    /* Set the pointer size.  */
    if (TARGET_64BIT)
      {
*************** rs6000_file_start (void)
*** 5180,5187 ****
      }
  
  #ifdef USING_ELFOS_H
!   if (rs6000_default_cpu == 0 || rs6000_default_cpu[0] == '\0'
!       || !global_options_set.x_rs6000_cpu_index)
      {
        fputs ("\t.machine ", asm_out_file);
        if ((rs6000_isa_flags & OPTION_MASK_DIRECT_MOVE) != 0)
--- 5187,5194 ----
      }
  
  #ifdef USING_ELFOS_H
!   if (!(rs6000_default_cpu && rs6000_default_cpu[0])
!       && !global_options_set.x_rs6000_cpu_index)
      {
        fputs ("\t.machine ", asm_out_file);
        if ((rs6000_isa_flags & OPTION_MASK_DIRECT_MOVE) != 0)
*************** rs6000_gimplify_va_arg (tree valist, tre
*** 11518,11523 ****
--- 11525,11531 ----
  
    size = int_size_in_bytes (type);
    rsize = (size + 3) / 4;
+   int pad = 4 * rsize - size;
    align = 1;
  
    if (TARGET_HARD_FLOAT && TARGET_FPRS
*************** rs6000_gimplify_va_arg (tree valist, tre
*** 11605,11610 ****
--- 11613,11622 ----
  	  && TYPE_MODE (type) == SDmode)
  	t = fold_build_pointer_plus_hwi (t, size);
  
+       /* Args are right-aligned.  */
+       if (BYTES_BIG_ENDIAN)
+ 	t = fold_build_pointer_plus_hwi (t, pad);
+ 
        gimplify_assign (addr, t, pre_p);
  
        gimple_seq_add_stmt (pre_p, gimple_build_goto (lab_over));
*************** rs6000_gimplify_va_arg (tree valist, tre
*** 11630,11635 ****
--- 11642,11652 ----
        t = build2 (BIT_AND_EXPR, TREE_TYPE (t), t,
  		  build_int_cst (TREE_TYPE (t), -align));
      }
+ 
+   /* Args are right-aligned.  */
+   if (BYTES_BIG_ENDIAN)
+     t = fold_build_pointer_plus_hwi (t, pad);
+ 
    gimplify_expr (&t, pre_p, NULL, is_gimple_val, fb_rvalue);
  
    gimplify_assign (unshare_expr (addr), t, pre_p);
*************** rs6000_expand_unop_builtin (enum insn_co
*** 12168,12174 ****
  	  || INTVAL (op0) < -16)
  	{
  	  error ("argument 1 must be a 5-bit signed literal");
! 	  return const0_rtx;
  	}
      }
  
--- 12185,12191 ----
  	  || INTVAL (op0) < -16)
  	{
  	  error ("argument 1 must be a 5-bit signed literal");
! 	  return CONST0_RTX (tmode);
  	}
      }
  
*************** rs6000_expand_binop_builtin (enum insn_c
*** 12271,12277 ****
  	  || TREE_INT_CST_LOW (arg1) & ~0x1f)
  	{
  	  error ("argument 2 must be a 5-bit unsigned literal");
! 	  return const0_rtx;
  	}
      }
  
--- 12288,12294 ----
  	  || TREE_INT_CST_LOW (arg1) & ~0x1f)
  	{
  	  error ("argument 2 must be a 5-bit unsigned literal");
! 	  return CONST0_RTX (tmode);
  	}
      }
  
*************** rs6000_expand_ternop_builtin (enum insn_
*** 12950,12960 ****
  	  || TREE_INT_CST_LOW (arg2) & ~0xf)
  	{
  	  error ("argument 3 must be a 4-bit unsigned literal");
! 	  return const0_rtx;
  	}
      }
    else if (icode == CODE_FOR_vsx_xxpermdi_v2df
             || icode == CODE_FOR_vsx_xxpermdi_v2di
             || icode == CODE_FOR_vsx_xxsldwi_v16qi
             || icode == CODE_FOR_vsx_xxsldwi_v8hi
             || icode == CODE_FOR_vsx_xxsldwi_v4si
--- 12967,12984 ----
  	  || TREE_INT_CST_LOW (arg2) & ~0xf)
  	{
  	  error ("argument 3 must be a 4-bit unsigned literal");
! 	  return CONST0_RTX (tmode);
  	}
      }
    else if (icode == CODE_FOR_vsx_xxpermdi_v2df
             || icode == CODE_FOR_vsx_xxpermdi_v2di
+            || icode == CODE_FOR_vsx_xxpermdi_v2df_be
+            || icode == CODE_FOR_vsx_xxpermdi_v2di_be
+            || icode == CODE_FOR_vsx_xxpermdi_v1ti
+            || icode == CODE_FOR_vsx_xxpermdi_v4sf
+            || icode == CODE_FOR_vsx_xxpermdi_v4si
+            || icode == CODE_FOR_vsx_xxpermdi_v8hi
+            || icode == CODE_FOR_vsx_xxpermdi_v16qi
             || icode == CODE_FOR_vsx_xxsldwi_v16qi
             || icode == CODE_FOR_vsx_xxsldwi_v8hi
             || icode == CODE_FOR_vsx_xxsldwi_v4si
*************** rs6000_expand_ternop_builtin (enum insn_
*** 12968,12974 ****
  	  || TREE_INT_CST_LOW (arg2) & ~0x3)
  	{
  	  error ("argument 3 must be a 2-bit unsigned literal");
! 	  return const0_rtx;
  	}
      }
    else if (icode == CODE_FOR_vsx_set_v2df
--- 12992,12998 ----
  	  || TREE_INT_CST_LOW (arg2) & ~0x3)
  	{
  	  error ("argument 3 must be a 2-bit unsigned literal");
! 	  return CONST0_RTX (tmode);
  	}
      }
    else if (icode == CODE_FOR_vsx_set_v2df
*************** rs6000_expand_ternop_builtin (enum insn_
*** 12988,12994 ****
  	  || TREE_INT_CST_LOW (arg2) & ~0x1)
  	{
  	  error ("argument 3 must be a 1-bit unsigned literal");
! 	  return const0_rtx;
  	}
      }
    else if (icode == CODE_FOR_dfp_ddedpd_dd
--- 13012,13018 ----
  	  || TREE_INT_CST_LOW (arg2) & ~0x1)
  	{
  	  error ("argument 3 must be a 1-bit unsigned literal");
! 	  return CONST0_RTX (tmode);
  	}
      }
    else if (icode == CODE_FOR_dfp_ddedpd_dd
*************** rs6000_expand_ternop_builtin (enum insn_
*** 13000,13006 ****
  	  || TREE_INT_CST_LOW (arg2) & ~0x3)
  	{
  	  error ("argument 1 must be 0 or 2");
! 	  return const0_rtx;
  	}
      }
    else if (icode == CODE_FOR_dfp_denbcd_dd
--- 13024,13030 ----
  	  || TREE_INT_CST_LOW (arg2) & ~0x3)
  	{
  	  error ("argument 1 must be 0 or 2");
! 	  return CONST0_RTX (tmode);
  	}
      }
    else if (icode == CODE_FOR_dfp_denbcd_dd
*************** rs6000_expand_ternop_builtin (enum insn_
*** 13012,13018 ****
  	  || TREE_INT_CST_LOW (arg0) & ~0x1)
  	{
  	  error ("argument 1 must be a 1-bit unsigned literal");
! 	  return const0_rtx;
  	}
      }
    else if (icode == CODE_FOR_dfp_dscli_dd
--- 13036,13042 ----
  	  || TREE_INT_CST_LOW (arg0) & ~0x1)
  	{
  	  error ("argument 1 must be a 1-bit unsigned literal");
! 	  return CONST0_RTX (tmode);
  	}
      }
    else if (icode == CODE_FOR_dfp_dscli_dd
*************** rs6000_expand_ternop_builtin (enum insn_
*** 13026,13032 ****
  	  || TREE_INT_CST_LOW (arg1) & ~0x3f)
  	{
  	  error ("argument 2 must be a 6-bit unsigned literal");
! 	  return const0_rtx;
  	}
      }
    else if (icode == CODE_FOR_crypto_vshasigmaw
--- 13050,13056 ----
  	  || TREE_INT_CST_LOW (arg1) & ~0x3f)
  	{
  	  error ("argument 2 must be a 6-bit unsigned literal");
! 	  return CONST0_RTX (tmode);
  	}
      }
    else if (icode == CODE_FOR_crypto_vshasigmaw
*************** rs6000_expand_ternop_builtin (enum insn_
*** 13038,13051 ****
        if (TREE_CODE (arg1) != INTEGER_CST || wi::geu_p (arg1, 2))
  	{
  	  error ("argument 2 must be 0 or 1");
! 	  return const0_rtx;
  	}
  
        STRIP_NOPS (arg2);
!       if (TREE_CODE (arg2) != INTEGER_CST || wi::geu_p (arg1, 16))
  	{
  	  error ("argument 3 must be in the range 0..15");
! 	  return const0_rtx;
  	}
      }
  
--- 13062,13075 ----
        if (TREE_CODE (arg1) != INTEGER_CST || wi::geu_p (arg1, 2))
  	{
  	  error ("argument 2 must be 0 or 1");
! 	  return CONST0_RTX (tmode);
  	}
  
        STRIP_NOPS (arg2);
!       if (TREE_CODE (arg2) != INTEGER_CST || wi::geu_p (arg2, 16))
  	{
  	  error ("argument 3 must be in the range 0..15");
! 	  return CONST0_RTX (tmode);
  	}
      }
  
*************** altivec_expand_ld_builtin (tree exp, rtx
*** 13102,13107 ****
--- 13126,13132 ----
        break;
      case ALTIVEC_BUILTIN_LD_INTERNAL_2di:
        icode = CODE_FOR_vector_altivec_load_v2di;
+       break;
      case ALTIVEC_BUILTIN_LD_INTERNAL_1ti:
        icode = CODE_FOR_vector_altivec_load_v1ti;
        break;
*************** altivec_expand_st_builtin (tree exp, rtx
*** 13163,13168 ****
--- 13188,13194 ----
        break;
      case ALTIVEC_BUILTIN_ST_INTERNAL_2di:
        icode = CODE_FOR_vector_altivec_store_v2di;
+       break;
      case ALTIVEC_BUILTIN_ST_INTERNAL_1ti:
        icode = CODE_FOR_vector_altivec_store_v1ti;
        break;
*************** builtin_function_type (machine_mode mode
*** 15619,15624 ****
--- 15645,15651 ----
        break;
  
        /* unsigned args, signed return.  */
+     case VSX_BUILTIN_XVCVUXDSP:
      case VSX_BUILTIN_XVCVUXDDP_UNS:
      case ALTIVEC_BUILTIN_UNSFLOAT_V4SI_V4SF:
        h.uns_p[1] = 1;
*************** rs6000_secondary_reload (bool in_p,
*** 17232,17237 ****
--- 17259,17265 ----
  		       && MEM_P (SUBREG_REG (x))));
  
    sri->icode = CODE_FOR_nothing;
+   sri->t_icode = CODE_FOR_nothing;
    sri->extra_cost = 0;
    icode = ((in_p)
  	   ? reg_addr[mode].reload_load
*************** debug_stack_info (rs6000_stack_t *info)
*** 22286,22309 ****
  rtx
  rs6000_return_addr (int count, rtx frame)
  {
!   /* Currently we don't optimize very well between prolog and body
!      code and for PIC code the code can be actually quite bad, so
!      don't try to be too clever here.  */
    if (count != 0
        || ((DEFAULT_ABI == ABI_V4 || DEFAULT_ABI == ABI_DARWIN) && flag_pic))
      {
        cfun->machine->ra_needs_full_frame = 1;
  
!       return
! 	gen_rtx_MEM
! 	  (Pmode,
! 	   memory_address
! 	   (Pmode,
! 	    plus_constant (Pmode,
! 			   copy_to_reg
! 			   (gen_rtx_MEM (Pmode,
! 					 memory_address (Pmode, frame))),
! 			   RETURN_ADDRESS_OFFSET)));
      }
  
    cfun->machine->ra_need_lr = 1;
--- 22314,22336 ----
  rtx
  rs6000_return_addr (int count, rtx frame)
  {
!   /* We can't use get_hard_reg_initial_val for LR when count == 0 if LR
!      is trashed by the prologue, as it is for PIC on ABI_V4 and Darwin.  */
    if (count != 0
        || ((DEFAULT_ABI == ABI_V4 || DEFAULT_ABI == ABI_DARWIN) && flag_pic))
      {
        cfun->machine->ra_needs_full_frame = 1;
  
!       if (count == 0)
! 	/* FRAME is set to frame_pointer_rtx by the generic code, but that
! 	   is good for loading 0(r1) only when !FRAME_GROWS_DOWNWARD.  */
! 	frame = stack_pointer_rtx;
!       rtx prev_frame_addr = memory_address (Pmode, frame);
!       rtx prev_frame = copy_to_reg (gen_rtx_MEM (Pmode, prev_frame_addr));
!       rtx lr_save_off = plus_constant (Pmode,
! 				       prev_frame, RETURN_ADDRESS_OFFSET);
!       rtx lr_save_addr = memory_address (Pmode, lr_save_off);
!       return gen_rtx_MEM (Pmode, lr_save_addr);
      }
  
    cfun->machine->ra_need_lr = 1;
*************** rs6000_output_function_epilogue (FILE *f
*** 25856,25908 ****
  	 seems to set the bit when not optimizing.  */
        fprintf (file, "%d\n", ((float_parms << 1) | (! optimize)));
  
!       if (! optional_tbtab)
! 	return;
! 
!       /* Optional fields follow.  Some are variable length.  */
  
!       /* Parameter types, left adjusted bit fields: 0 fixed, 10 single float,
! 	 11 double float.  */
!       /* There is an entry for each parameter in a register, in the order that
! 	 they occur in the parameter list.  Any intervening arguments on the
! 	 stack are ignored.  If the list overflows a long (max possible length
! 	 34 bits) then completely leave off all elements that don't fit.  */
!       /* Only emit this long if there was at least one parameter.  */
!       if (fixed_parms || float_parms)
! 	fprintf (file, "\t.long %d\n", parm_info);
  
!       /* Offset from start of code to tb table.  */
!       fputs ("\t.long ", file);
!       ASM_OUTPUT_INTERNAL_LABEL_PREFIX (file, "LT");
!       RS6000_OUTPUT_BASENAME (file, fname);
!       putc ('-', file);
!       rs6000_output_function_entry (file, fname);
!       putc ('\n', file);
  
!       /* Interrupt handler mask.  */
!       /* Omit this long, since we never set the interrupt handler bit
! 	 above.  */
  
!       /* Number of CTL (controlled storage) anchors.  */
!       /* Omit this long, since the has_ctl bit is never set above.  */
  
!       /* Displacement into stack of each CTL anchor.  */
!       /* Omit this list of longs, because there are no CTL anchors.  */
  
!       /* Length of function name.  */
!       if (*fname == '*')
! 	++fname;
!       fprintf (file, "\t.short %d\n", (int) strlen (fname));
  
!       /* Function name.  */
!       assemble_string (fname, strlen (fname));
  
!       /* Register for alloca automatic storage; this is always reg 31.
! 	 Only emit this if the alloca bit was set above.  */
!       if (frame_pointer_needed)
! 	fputs ("\t.byte 31\n", file);
  
!       fputs ("\t.align 2\n", file);
      }
  }
  
--- 25883,25936 ----
  	 seems to set the bit when not optimizing.  */
        fprintf (file, "%d\n", ((float_parms << 1) | (! optimize)));
  
!       if (optional_tbtab)
! 	{
! 	  /* Optional fields follow.  Some are variable length.  */
  
! 	  /* Parameter types, left adjusted bit fields: 0 fixed, 10 single
! 	     float, 11 double float.  */
! 	  /* There is an entry for each parameter in a register, in the order
! 	     that they occur in the parameter list.  Any intervening arguments
! 	     on the stack are ignored.  If the list overflows a long (max
! 	     possible length 34 bits) then completely leave off all elements
! 	     that don't fit.  */
! 	  /* Only emit this long if there was at least one parameter.  */
! 	  if (fixed_parms || float_parms)
! 	    fprintf (file, "\t.long %d\n", parm_info);
  
! 	  /* Offset from start of code to tb table.  */
! 	  fputs ("\t.long ", file);
! 	  ASM_OUTPUT_INTERNAL_LABEL_PREFIX (file, "LT");
! 	  RS6000_OUTPUT_BASENAME (file, fname);
! 	  putc ('-', file);
! 	  rs6000_output_function_entry (file, fname);
! 	  putc ('\n', file);
  
! 	  /* Interrupt handler mask.  */
! 	  /* Omit this long, since we never set the interrupt handler bit
! 	     above.  */
  
! 	  /* Number of CTL (controlled storage) anchors.  */
! 	  /* Omit this long, since the has_ctl bit is never set above.  */
  
! 	  /* Displacement into stack of each CTL anchor.  */
! 	  /* Omit this list of longs, because there are no CTL anchors.  */
  
! 	  /* Length of function name.  */
! 	  if (*fname == '*')
! 	    ++fname;
! 	  fprintf (file, "\t.short %d\n", (int) strlen (fname));
  
! 	  /* Function name.  */
! 	  assemble_string (fname, strlen (fname));
  
! 	  /* Register for alloca automatic storage; this is always reg 31.
! 	     Only emit this if the alloca bit was set above.  */
! 	  if (frame_pointer_needed)
! 	    fputs ("\t.byte 31\n", file);
  
! 	  fputs ("\t.align 2\n", file);
! 	}
      }
  }
  
*************** rs6000_output_symbol_ref (FILE *file, rt
*** 26228,26234 ****
  		     (TREE_CODE (decl) == FUNCTION_DECL
  		      ? "[DS]" : "[UA]"),
  		     NULL);
!       XSTR (x, 0) = name;
      }
  
    if (VTABLE_NAME_P (name))
--- 26256,26265 ----
  		     (TREE_CODE (decl) == FUNCTION_DECL
  		      ? "[DS]" : "[UA]"),
  		     NULL);
! 
!       /* Don't modify name in extern VAR_DECL to include mapping class.  */
!       if (TREE_CODE (decl) == FUNCTION_DECL)
! 	XSTR (x, 0) = name;
      }
  
    if (VTABLE_NAME_P (name))
*************** rs6000_elf_output_toc_section_asm_op (co
*** 29173,29180 ****
      {
        if (!toc_initialized)
  	{
- 	  toc_initialized = 1;
  	  fprintf (asm_out_file, "%s\n", TOC_SECTION_ASM_OP);
  	  (*targetm.asm_out.internal_label) (asm_out_file, "LCTOC", 0);
  	  fprintf (asm_out_file, "\t.tc ");
  	  ASM_OUTPUT_INTERNAL_LABEL_PREFIX (asm_out_file, "LCTOC1[TC],");
--- 29204,29211 ----
      {
        if (!toc_initialized)
  	{
  	  fprintf (asm_out_file, "%s\n", TOC_SECTION_ASM_OP);
+ 	  ASM_OUTPUT_ALIGN (asm_out_file, TARGET_64BIT ? 3 : 2);
  	  (*targetm.asm_out.internal_label) (asm_out_file, "LCTOC", 0);
  	  fprintf (asm_out_file, "\t.tc ");
  	  ASM_OUTPUT_INTERNAL_LABEL_PREFIX (asm_out_file, "LCTOC1[TC],");
*************** rs6000_elf_output_toc_section_asm_op (co
*** 29182,29201 ****
  	  fprintf (asm_out_file, "\n");
  
  	  fprintf (asm_out_file, "%s\n", MINIMAL_TOC_SECTION_ASM_OP);
  	  ASM_OUTPUT_INTERNAL_LABEL_PREFIX (asm_out_file, "LCTOC1");
  	  fprintf (asm_out_file, " = .+32768\n");
  	}
        else
  	fprintf (asm_out_file, "%s\n", MINIMAL_TOC_SECTION_ASM_OP);
      }
    else if ((DEFAULT_ABI == ABI_AIX || DEFAULT_ABI == ABI_ELFv2)
  	   && !TARGET_RELOCATABLE)
!     fprintf (asm_out_file, "%s\n", TOC_SECTION_ASM_OP);
    else
      {
        fprintf (asm_out_file, "%s\n", MINIMAL_TOC_SECTION_ASM_OP);
        if (!toc_initialized)
  	{
  	  ASM_OUTPUT_INTERNAL_LABEL_PREFIX (asm_out_file, "LCTOC1");
  	  fprintf (asm_out_file, " = .+32768\n");
  	  toc_initialized = 1;
--- 29213,29242 ----
  	  fprintf (asm_out_file, "\n");
  
  	  fprintf (asm_out_file, "%s\n", MINIMAL_TOC_SECTION_ASM_OP);
+ 	  ASM_OUTPUT_ALIGN (asm_out_file, TARGET_64BIT ? 3 : 2);
  	  ASM_OUTPUT_INTERNAL_LABEL_PREFIX (asm_out_file, "LCTOC1");
  	  fprintf (asm_out_file, " = .+32768\n");
+ 	  toc_initialized = 1;
  	}
        else
  	fprintf (asm_out_file, "%s\n", MINIMAL_TOC_SECTION_ASM_OP);
      }
    else if ((DEFAULT_ABI == ABI_AIX || DEFAULT_ABI == ABI_ELFv2)
  	   && !TARGET_RELOCATABLE)
!     {
!       fprintf (asm_out_file, "%s\n", TOC_SECTION_ASM_OP);
!       if (!toc_initialized)
! 	{
! 	  ASM_OUTPUT_ALIGN (asm_out_file, TARGET_64BIT ? 3 : 2);
! 	  toc_initialized = 1;
! 	}
!     }
    else
      {
        fprintf (asm_out_file, "%s\n", MINIMAL_TOC_SECTION_ASM_OP);
        if (!toc_initialized)
  	{
+ 	  ASM_OUTPUT_ALIGN (asm_out_file, TARGET_64BIT ? 3 : 2);
  	  ASM_OUTPUT_INTERNAL_LABEL_PREFIX (asm_out_file, "LCTOC1");
  	  fprintf (asm_out_file, " = .+32768\n");
  	  toc_initialized = 1;
*************** rs6000_inner_target_options (tree args,
*** 32611,32617 ****
      }
  
    else
!     gcc_unreachable ();
  
    return ret;
  }
--- 32652,32661 ----
      }
  
    else
!     {
!       error ("attribute %<target%> argument not a string");
!       return false;
!     }
  
    return ret;
  }
*************** rs6000_pragma_target_parse (tree args, t
*** 32835,32857 ****
  /* Remember the last target of rs6000_set_current_function.  */
  static GTY(()) tree rs6000_previous_fndecl;
  
  /* Establish appropriate back-end context for processing the function
     FNDECL.  The argument might be NULL to indicate processing at top
     level, outside of any function scope.  */
  static void
  rs6000_set_current_function (tree fndecl)
  {
-   tree old_tree = (rs6000_previous_fndecl
- 		   ? DECL_FUNCTION_SPECIFIC_TARGET (rs6000_previous_fndecl)
- 		   : NULL_TREE);
- 
-   tree new_tree = (fndecl
- 		   ? DECL_FUNCTION_SPECIFIC_TARGET (fndecl)
- 		   : NULL_TREE);
- 
    if (TARGET_DEBUG_TARGET)
      {
-       bool print_final = false;
        fprintf (stderr, "\n==================== rs6000_set_current_function");
  
        if (fndecl)
--- 32879,32908 ----
  /* Remember the last target of rs6000_set_current_function.  */
  static GTY(()) tree rs6000_previous_fndecl;
  
+ /* Restore target's globals from NEW_TREE and invalidate the
+    rs6000_previous_fndecl cache.  */
+ 
+ static void
+ rs6000_activate_target_options (tree new_tree)
+ {
+   cl_target_option_restore (&global_options, TREE_TARGET_OPTION (new_tree));
+   if (TREE_TARGET_GLOBALS (new_tree))
+     restore_target_globals (TREE_TARGET_GLOBALS (new_tree));
+   else if (new_tree == target_option_default_node)
+     restore_target_globals (&default_target_globals);
+   else
+     TREE_TARGET_GLOBALS (new_tree) = save_target_globals_default_opts ();
+   rs6000_previous_fndecl = NULL_TREE;
+ }
+ 
  /* Establish appropriate back-end context for processing the function
     FNDECL.  The argument might be NULL to indicate processing at top
     level, outside of any function scope.  */
  static void
  rs6000_set_current_function (tree fndecl)
  {
    if (TARGET_DEBUG_TARGET)
      {
        fprintf (stderr, "\n==================== rs6000_set_current_function");
  
        if (fndecl)
*************** rs6000_set_current_function (tree fndecl
*** 32864,32921 ****
  	fprintf (stderr, ", prev_fndecl (%p)", (void *)rs6000_previous_fndecl);
  
        fprintf (stderr, "\n");
        if (new_tree)
  	{
  	  fprintf (stderr, "\nnew fndecl target specific options:\n");
  	  debug_tree (new_tree);
- 	  print_final = true;
  	}
  
        if (old_tree)
  	{
  	  fprintf (stderr, "\nold fndecl target specific options:\n");
  	  debug_tree (old_tree);
- 	  print_final = true;
  	}
  
!       if (print_final)
  	fprintf (stderr, "--------------------\n");
      }
  
!   /* Only change the context if the function changes.  This hook is called
!      several times in the course of compiling a function, and we don't want to
!      slow things down too much or call target_reinit when it isn't safe.  */
!   if (fndecl && fndecl != rs6000_previous_fndecl)
!     {
!       rs6000_previous_fndecl = fndecl;
!       if (old_tree == new_tree)
! 	;
! 
!       else if (new_tree && new_tree != target_option_default_node)
! 	{
! 	  cl_target_option_restore (&global_options,
! 				    TREE_TARGET_OPTION (new_tree));
! 	  if (TREE_TARGET_GLOBALS (new_tree))
! 	    restore_target_globals (TREE_TARGET_GLOBALS (new_tree));
! 	  else
! 	    TREE_TARGET_GLOBALS (new_tree)
! 	      = save_target_globals_default_opts ();
! 	}
  
!       else if (old_tree && old_tree != target_option_default_node)
! 	{
! 	  new_tree = target_option_current_node;
! 	  cl_target_option_restore (&global_options,
! 				    TREE_TARGET_OPTION (new_tree));
! 	  if (TREE_TARGET_GLOBALS (new_tree))
! 	    restore_target_globals (TREE_TARGET_GLOBALS (new_tree));
! 	  else if (new_tree == target_option_default_node)
! 	    restore_target_globals (&default_target_globals);
! 	  else
! 	    TREE_TARGET_GLOBALS (new_tree)
! 	      = save_target_globals_default_opts ();
! 	}
!     }
  }
  
  
--- 32915,32974 ----
  	fprintf (stderr, ", prev_fndecl (%p)", (void *)rs6000_previous_fndecl);
  
        fprintf (stderr, "\n");
+     }
+ 
+   /* Only change the context if the function changes.  This hook is called
+      several times in the course of compiling a function, and we don't want to
+      slow things down too much or call target_reinit when it isn't safe.  */
+   if (fndecl == rs6000_previous_fndecl)
+     return;
+ 
+   tree old_tree;
+   if (rs6000_previous_fndecl == NULL_TREE)
+     old_tree = target_option_current_node;
+   else if (DECL_FUNCTION_SPECIFIC_TARGET (rs6000_previous_fndecl))
+     old_tree = DECL_FUNCTION_SPECIFIC_TARGET (rs6000_previous_fndecl);
+   else
+     old_tree = target_option_default_node;
+ 
+   tree new_tree;
+   if (fndecl == NULL_TREE)
+     {
+       if (old_tree != target_option_current_node)
+ 	new_tree = target_option_current_node;
+       else
+ 	new_tree = NULL_TREE;
+     }
+   else
+     {
+       new_tree = DECL_FUNCTION_SPECIFIC_TARGET (fndecl);
+       if (new_tree == NULL_TREE)
+ 	new_tree = target_option_default_node;
+     }
+ 
+   if (TARGET_DEBUG_TARGET)
+     {
        if (new_tree)
  	{
  	  fprintf (stderr, "\nnew fndecl target specific options:\n");
  	  debug_tree (new_tree);
  	}
  
        if (old_tree)
  	{
  	  fprintf (stderr, "\nold fndecl target specific options:\n");
  	  debug_tree (old_tree);
  	}
  
!       if (old_tree != NULL_TREE || new_tree != NULL_TREE)
  	fprintf (stderr, "--------------------\n");
      }
  
!   if (new_tree && old_tree != new_tree)
!     rs6000_activate_target_options (new_tree);
  
!   if (fndecl)
!     rs6000_previous_fndecl = fndecl;
  }
  
  
*************** emit_fusion_gpr_load (rtx target, rtx me
*** 34134,34143 ****
     throughout the computation, we can get correct behavior by replacing
     M with M' as follows:
  
!             { M[i+8]+8 : i < 8, M[i+8] in [0,7] U [16,23]
!     M'[i] = { M[i+8]-8 : i < 8, M[i+8] in [8,15] U [24,31]
!             { M[i-8]+8 : i >= 8, M[i-8] in [0,7] U [16,23]
!             { M[i-8]-8 : i >= 8, M[i-8] in [8,15] U [24,31]
  
     This seems promising at first, since we are just replacing one mask
     with another.  But certain masks are preferable to others.  If M
--- 34187,34194 ----
     throughout the computation, we can get correct behavior by replacing
     M with M' as follows:
  
!     M'[i] = { (M[i]+8)%16      : M[i] in [0,15]
!             { ((M[i]+8)%16)+16 : M[i] in [16,31]
  
     This seems promising at first, since we are just replacing one mask
     with another.  But certain masks are preferable to others.  If M
*************** emit_fusion_gpr_load (rtx target, rtx me
*** 34155,34161 ****
     mask to be produced by an UNSPEC_LVSL, in which case the mask 
     cannot be known at compile time.  In such a case we would have to
     generate several instructions to compute M' as above at run time,
!    and a cost model is needed again.  */
  
  /* This is based on the union-find logic in web.c.  web_entry_base is
     defined in df.h.  */
--- 34206,34216 ----
     mask to be produced by an UNSPEC_LVSL, in which case the mask 
     cannot be known at compile time.  In such a case we would have to
     generate several instructions to compute M' as above at run time,
!    and a cost model is needed again.
! 
!    However, when the mask M for an UNSPEC_VPERM is loaded from the
!    constant pool, we can replace M with M' as above at no cost
!    beyond adding a constant pool entry.  */
  
  /* This is based on the union-find logic in web.c.  web_entry_base is
     defined in df.h.  */
*************** class swap_web_entry : public web_entry_
*** 34191,34197 ****
    /* A nonzero value indicates what kind of special handling for this
       insn is required if doublewords are swapped.  Undefined if
       is_swappable is not set.  */
!   unsigned int special_handling : 3;
    /* Set if the web represented by this entry cannot be optimized.  */
    unsigned int web_not_optimizable : 1;
    /* Set if this insn should be deleted.  */
--- 34246,34252 ----
    /* A nonzero value indicates what kind of special handling for this
       insn is required if doublewords are swapped.  Undefined if
       is_swappable is not set.  */
!   unsigned int special_handling : 4;
    /* Set if the web represented by this entry cannot be optimized.  */
    unsigned int web_not_optimizable : 1;
    /* Set if this insn should be deleted.  */
*************** enum special_handling_values {
*** 34205,34211 ****
    SH_NOSWAP_LD,
    SH_NOSWAP_ST,
    SH_EXTRACT,
!   SH_SPLAT
  };
  
  /* Union INSN with all insns containing definitions that reach USE.
--- 34260,34270 ----
    SH_NOSWAP_LD,
    SH_NOSWAP_ST,
    SH_EXTRACT,
!   SH_SPLAT,
!   SH_XXPERMDI,
!   SH_CONCAT,
!   SH_VPERM,
!   SH_VPERM_COMP
  };
  
  /* Union INSN with all insns containing definitions that reach USE.
*************** insn_is_swap_p (rtx insn)
*** 34340,34345 ****
--- 34399,34562 ----
    return 1;
  }
  
+ /* Return TRUE if insn is a swap fed by a load from the constant pool.  */
+ static bool
+ const_load_sequence_p (swap_web_entry *insn_entry, rtx insn)
+ {
+   unsigned uid = INSN_UID (insn);
+   if (!insn_entry[uid].is_swap || insn_entry[uid].is_load)
+     return false;
+ 
+   /* Find the unique use in the swap and locate its def.  If the def
+      isn't unique, punt.  */
+   struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
+   df_ref use;
+   FOR_EACH_INSN_INFO_USE (use, insn_info)
+     {
+       struct df_link *def_link = DF_REF_CHAIN (use);
+       if (!def_link || def_link->next)
+ 	return false;
+ 
+       rtx def_insn = DF_REF_INSN (def_link->ref);
+       unsigned uid2 = INSN_UID (def_insn);
+       if (!insn_entry[uid2].is_load || !insn_entry[uid2].is_swap)
+ 	return false;
+ 
+       rtx body = PATTERN (def_insn);
+       if (GET_CODE (body) != SET
+ 	  || GET_CODE (SET_SRC (body)) != VEC_SELECT
+ 	  || GET_CODE (XEXP (SET_SRC (body), 0)) != MEM)
+ 	return false;
+ 
+       rtx mem = XEXP (SET_SRC (body), 0);
+       rtx base_reg = XEXP (mem, 0);
+ 
+       if (!REG_P (base_reg))
+ 	{
+ 	  gcc_assert (GET_CODE (base_reg) == PLUS);
+ 	  base_reg = XEXP (base_reg, 0);
+ 	}
+ 
+       df_ref base_use;
+       rtx_insn *tocrel_insn = 0;
+       insn_info = DF_INSN_INFO_GET (def_insn);
+       FOR_EACH_INSN_INFO_USE (base_use, insn_info)
+ 	{
+ 	  if (!rtx_equal_p (DF_REF_REG (base_use), base_reg))
+ 	    continue;
+ 
+ 	  struct df_link *base_def_link = DF_REF_CHAIN (base_use);
+ 	  if (!base_def_link || base_def_link->next)
+ 	    return false;
+ 
+ 	  tocrel_insn = DF_REF_INSN (base_def_link->ref);
+ 	  rtx tocrel_body = PATTERN (tocrel_insn);
+ 	  rtx base, offset;
+ 	  if (GET_CODE (tocrel_body) != SET)
+ 	    return false;
+ 	  /* There is an extra level of indirection for small/large
+ 	     code models.  */
+ 	  rtx tocrel_expr = SET_SRC (tocrel_body);
+ 	  if (GET_CODE (tocrel_expr) == MEM)
+ 	    tocrel_expr = XEXP (tocrel_expr, 0);
+ 	  if (!toc_relative_expr_p (tocrel_expr, false))
+ 	    return false;
+ 	  split_const (XVECEXP (tocrel_base, 0, 0), &base, &offset);
+ 	  if (GET_CODE (base) != SYMBOL_REF || !CONSTANT_POOL_ADDRESS_P (base))
+ 	    return false;
+ 	  rtx const_vector = get_pool_constant (base);
+ 	  /* With the extra indirection, get_pool_constant will produce the
+ 	     real constant from the reg_equal expression, so get the real
+ 	     constant.  It's still possible that the reg_equal doesn't
+ 	     represent a constant, so punt in that case.  */
+ 	  if (GET_CODE (const_vector) == SYMBOL_REF)
+ 	    {
+ 	      if (!CONSTANT_POOL_ADDRESS_P (const_vector))
+ 		return false;
+ 	      const_vector = get_pool_constant (const_vector);
+ 	    }
+ 	  if (GET_CODE (const_vector) != CONST_VECTOR)
+ 	    return false;
+ 	}
+       gcc_assert (tocrel_insn);
+     }
+   return true;
+ }
+ 
+ /* Return TRUE if insn is a swap fed by a load from the constant pool
+    and subsequently complemented.  */
+ static bool
+ load_comp_mask_p (swap_web_entry *insn_entry, rtx insn)
+ {
+   rtx body = PATTERN (insn);
+   if (GET_CODE (body) != SET)
+     return false;
+   rtx ior = SET_SRC (body);
+   if (GET_CODE (ior) != IOR)
+     return false;
+   rtx not1 = XEXP (ior, 0);
+   rtx not2 = XEXP (ior, 1);
+   if (GET_CODE (not1) != NOT || GET_CODE (not2) != NOT)
+     return false;
+   rtx reg1 = XEXP (not1, 0);
+   rtx reg2 = XEXP (not2, 0);
+   if (!REG_P (reg1) || !rtx_equal_p (reg1, reg2))
+     return false;
+ 
+   /* We have a VNOR operation.  Find the def of its source reg and
+      check for the remaining conditions.  */
+   struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
+   df_ref use;
+   FOR_EACH_INSN_INFO_USE (use, insn_info)
+     {
+       struct df_link *def_link = DF_REF_CHAIN (use);
+       if (!def_link || def_link->next)
+ 	return false;
+       rtx def_insn = DF_REF_INSN (def_link->ref);
+       return const_load_sequence_p (insn_entry, def_insn);
+     }
+ 
+   gcc_unreachable ();
+ }
+ 
+ /* Return TRUE iff OP matches a V2DF reduction pattern.  See the
+    definition of vsx_reduc_<VEC_reduc_name>_v2df in vsx.md.  */
+ static bool
+ v2df_reduction_p (rtx op)
+ {
+   if (GET_MODE (op) != V2DFmode)
+     return false;
+   
+   enum rtx_code code = GET_CODE (op);
+   if (code != PLUS && code != SMIN && code != SMAX)
+     return false;
+ 
+   rtx concat = XEXP (op, 0);
+   if (GET_CODE (concat) != VEC_CONCAT)
+     return false;
+ 
+   rtx select0 = XEXP (concat, 0);
+   rtx select1 = XEXP (concat, 1);
+   if (GET_CODE (select0) != VEC_SELECT || GET_CODE (select1) != VEC_SELECT)
+     return false;
+ 
+   rtx reg0 = XEXP (select0, 0);
+   rtx reg1 = XEXP (select1, 0);
+   if (!rtx_equal_p (reg0, reg1) || !REG_P (reg0))
+     return false;
+ 
+   rtx parallel0 = XEXP (select0, 1);
+   rtx parallel1 = XEXP (select1, 1);
+   if (GET_CODE (parallel0) != PARALLEL || GET_CODE (parallel1) != PARALLEL)
+     return false;
+ 
+   if (!rtx_equal_p (XVECEXP (parallel0, 0, 0), const1_rtx)
+       || !rtx_equal_p (XVECEXP (parallel1, 0, 0), const0_rtx))
+     return false;
+ 
+   return true;
+ }
+ 
  /* Return 1 iff OP is an operand that will not be affected by having
     vector doublewords swapped in memory.  */
  static unsigned int
*************** rtx_is_swappable_p (rtx op, unsigned int
*** 34397,34402 ****
--- 34614,34635 ----
  	  *special = SH_EXTRACT;
  	  return 1;
  	}
+       /* An XXPERMDI is ok if we adjust the lanes.  Note that if the
+ 	 XXPERMDI is a swap operation, it will be identified by
+ 	 insn_is_swap_p and therefore we won't get here.  */
+       else if (GET_CODE (XEXP (op, 0)) == VEC_CONCAT
+ 	       && (GET_MODE (XEXP (op, 0)) == V4DFmode
+ 		   || GET_MODE (XEXP (op, 0)) == V4DImode)
+ 	       && GET_CODE ((parallel = XEXP (op, 1))) == PARALLEL
+ 	       && XVECLEN (parallel, 0) == 2
+ 	       && GET_CODE (XVECEXP (parallel, 0, 0)) == CONST_INT
+ 	       && GET_CODE (XVECEXP (parallel, 0, 1)) == CONST_INT)
+ 	{
+ 	  *special = SH_XXPERMDI;
+ 	  return 1;
+ 	}
+       else if (v2df_reduction_p (op))
+ 	return 1;
        else
  	return 0;
  
*************** rtx_is_swappable_p (rtx op, unsigned int
*** 34461,34466 ****
--- 34694,34702 ----
  	  case UNSPEC_VSPLT_DIRECT:
  	    *special = SH_SPLAT;
  	    return 1;
+ 	  case UNSPEC_REDUC_PLUS:
+ 	  case UNSPEC_REDUC:
+ 	    return 1;
  	  }
        }
  
*************** insn_is_swappable_p (swap_web_entry *ins
*** 34566,34572 ****
  	    if (GET_CODE (use_body) != SET
  		|| GET_CODE (SET_SRC (use_body)) != UNSPEC
  		|| XINT (SET_SRC (use_body), 1) != UNSPEC_VSX_XXSPLTW
! 		|| XEXP (XEXP (SET_SRC (use_body), 0), 1) != const0_rtx)
  	      return 0;
  	  }
  	}
--- 34802,34808 ----
  	    if (GET_CODE (use_body) != SET
  		|| GET_CODE (SET_SRC (use_body)) != UNSPEC
  		|| XINT (SET_SRC (use_body), 1) != UNSPEC_VSX_XXSPLTW
! 		|| XVECEXP (SET_SRC (use_body), 0, 1) != const0_rtx)
  	      return 0;
  	  }
  	}
*************** insn_is_swappable_p (swap_web_entry *ins
*** 34574,34579 ****
--- 34810,34868 ----
        return 1;
      }
  
+   /* A concatenation of two doublewords is ok if we reverse the
+      order of the inputs.  */
+   if (GET_CODE (body) == SET
+       && GET_CODE (SET_SRC (body)) == VEC_CONCAT
+       && (GET_MODE (SET_SRC (body)) == V2DFmode
+ 	  || GET_MODE (SET_SRC (body)) == V2DImode))
+     {
+       *special = SH_CONCAT;
+       return 1;
+     }
+ 
+   /* V2DF reductions are always swappable.  */
+   if (GET_CODE (body) == PARALLEL)
+     {
+       rtx expr = XVECEXP (body, 0, 0);
+       if (GET_CODE (expr) == SET
+ 	  && v2df_reduction_p (SET_SRC (expr)))
+ 	return 1;
+     }
+ 
+   /* An UNSPEC_VPERM is ok if the mask operand is loaded from the
+      constant pool, and optionally complemented afterwards.  */
+   if (GET_CODE (body) == SET
+       && GET_CODE (SET_SRC (body)) == UNSPEC
+       && XINT (SET_SRC (body), 1) == UNSPEC_VPERM
+       && XVECLEN (SET_SRC (body), 0) == 3
+       && GET_CODE (XVECEXP (SET_SRC (body), 0, 2)) == REG)
+     {
+       rtx mask_reg = XVECEXP (SET_SRC (body), 0, 2);
+       struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
+       df_ref use;
+       FOR_EACH_INSN_INFO_USE (use, insn_info)
+ 	if (rtx_equal_p (DF_REF_REG (use), mask_reg))
+ 	  {
+ 	    struct df_link *def_link = DF_REF_CHAIN (use);
+ 	    /* Punt if multiple definitions for this reg.  */
+ 	    if (def_link && !def_link->next &&
+ 		const_load_sequence_p (insn_entry,
+ 				       DF_REF_INSN (def_link->ref)))
+ 	      {
+ 		*special = SH_VPERM;
+ 		return 1;
+ 	      }
+ 	    else if (def_link && !def_link->next &&
+ 		     load_comp_mask_p (insn_entry,
+ 				       DF_REF_INSN (def_link->ref)))
+ 	      {
+ 		*special = SH_VPERM_COMP;
+ 		return 1;
+ 	      }
+ 	  }
+     }
+ 
    /* Otherwise check the operands for vector lane violations.  */
    return rtx_is_swappable_p (body, special);
  }
*************** adjust_splat (rtx_insn *insn)
*** 34863,34868 ****
--- 35152,35386 ----
      fprintf (dump_file, "Changing lane for splat %d\n", INSN_UID (insn));
  }
  
+ /* Given OP that contains an XXPERMDI operation (that is not a doubleword
+    swap), reverse the order of the source operands and adjust the indices
+    of the source lanes to account for doubleword reversal.  */
+ static void
+ adjust_xxpermdi (rtx_insn *insn)
+ {
+   rtx set = PATTERN (insn);
+   rtx select = XEXP (set, 1);
+   rtx concat = XEXP (select, 0);
+   rtx src0 = XEXP (concat, 0);
+   XEXP (concat, 0) = XEXP (concat, 1);
+   XEXP (concat, 1) = src0;
+   rtx parallel = XEXP (select, 1);
+   int lane0 = INTVAL (XVECEXP (parallel, 0, 0));
+   int lane1 = INTVAL (XVECEXP (parallel, 0, 1));
+   int new_lane0 = 3 - lane1;
+   int new_lane1 = 3 - lane0;
+   XVECEXP (parallel, 0, 0) = GEN_INT (new_lane0);
+   XVECEXP (parallel, 0, 1) = GEN_INT (new_lane1);
+   INSN_CODE (insn) = -1; /* Force re-recognition.  */
+   df_insn_rescan (insn);
+ 
+   if (dump_file)
+     fprintf (dump_file, "Changing lanes for xxpermdi %d\n", INSN_UID (insn));
+ }
+ 
+ /* Given OP that contains a VEC_CONCAT operation of two doublewords,
+    reverse the order of those inputs.  */
+ static void
+ adjust_concat (rtx_insn *insn)
+ {
+   rtx set = PATTERN (insn);
+   rtx concat = XEXP (set, 1);
+   rtx src0 = XEXP (concat, 0);
+   XEXP (concat, 0) = XEXP (concat, 1);
+   XEXP (concat, 1) = src0;
+   INSN_CODE (insn) = -1; /* Force re-recognition.  */
+   df_insn_rescan (insn);
+ 
+   if (dump_file)
+     fprintf (dump_file, "Reversing inputs for concat %d\n", INSN_UID (insn));
+ }
+ 
+ /* We previously determined that a use of MASK_REG in INSN was fed by a
+    swap of a swapping load of a TOC-relative constant pool symbol.  Return
+    the CONST_VECTOR that was loaded, as well as the LOAD_INSN (by
+    reference).  */
+ static rtx
+ find_swapped_load_and_const_vector (rtx_insn *insn, rtx_insn **load_insn,
+ 				    rtx mask_reg)
+ {
+   /* Find the swap.  */
+   struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
+   df_ref use;
+   rtx_insn *swap_insn = 0;
+   FOR_EACH_INSN_INFO_USE (use, insn_info)
+     if (rtx_equal_p (DF_REF_REG (use), mask_reg))
+       {
+ 	struct df_link *def_link = DF_REF_CHAIN (use);
+ 	gcc_assert (def_link && !def_link->next);
+ 	swap_insn = DF_REF_INSN (def_link->ref);
+ 	break;
+       }
+   gcc_assert (swap_insn);
+   
+   /* Find the load.  */
+   insn_info = DF_INSN_INFO_GET (swap_insn);
+   FOR_EACH_INSN_INFO_USE (use, insn_info)
+     {
+       struct df_link *def_link = DF_REF_CHAIN (use);
+       gcc_assert (def_link && !def_link->next);
+       *load_insn = DF_REF_INSN (def_link->ref);
+       break;
+     }
+   gcc_assert (*load_insn);
+ 
+   /* Find the TOC-relative symbol access.  */
+   insn_info = DF_INSN_INFO_GET (*load_insn);
+   rtx_insn *tocrel_insn = 0;
+   FOR_EACH_INSN_INFO_USE (use, insn_info)
+     {
+       struct df_link *def_link = DF_REF_CHAIN (use);
+       gcc_assert (def_link && !def_link->next);
+       tocrel_insn = DF_REF_INSN (def_link->ref);
+       break;
+     }
+   gcc_assert (tocrel_insn);
+ 
+   /* Find the embedded CONST_VECTOR.  We have to call toc_relative_expr_p
+      to set tocrel_base; otherwise it would be unnecessary as we've
+      already established it will return true.  */
+   rtx base, offset;
+   rtx tocrel_expr = SET_SRC (PATTERN (tocrel_insn));
+   /* There is an extra level of indirection for small/large code models.  */
+   if (GET_CODE (tocrel_expr) == MEM)
+     tocrel_expr = XEXP (tocrel_expr, 0);
+   if (!toc_relative_expr_p (tocrel_expr, false))
+     gcc_unreachable ();
+   split_const (XVECEXP (tocrel_base, 0, 0), &base, &offset);
+   rtx const_vector = get_pool_constant (base);
+   /* With the extra indirection, get_pool_constant will produce the
+      real constant from the reg_equal expression, so get the real
+      constant.  */
+   if (GET_CODE (const_vector) == SYMBOL_REF)
+     const_vector = get_pool_constant (const_vector);
+   gcc_assert (GET_CODE (const_vector) == CONST_VECTOR);
+ 
+   return const_vector;
+ }
+ 
+ /* Create a new CONST_VECTOR from NEW_MASK, and replace the MEM in
+    LOAD_INSN with a MEM referencing that CONST_VECTOR.  */
+ static void
+ replace_const_vector_in_load (rtx_insn *load_insn, unsigned int *new_mask)
+ {
+   unsigned int i;
+   rtx vals = gen_rtx_PARALLEL (V16QImode, rtvec_alloc (16));
+   for (i = 0; i < 16; ++i)
+     XVECEXP (vals, 0, i) = GEN_INT (new_mask[i]);
+   rtx new_const_vector = gen_rtx_CONST_VECTOR (V16QImode, XVEC (vals, 0));
+   rtx new_mem = force_const_mem (V16QImode, new_const_vector);
+   /* This gives us a MEM whose base operand is a SYMBOL_REF, which we
+      can't recognize.  Force the SYMBOL_REF into a register.  */
+   if (!REG_P (XEXP (new_mem, 0))) {
+     rtx base_reg = force_reg (Pmode, XEXP (new_mem, 0));
+     XEXP (new_mem, 0) = base_reg;
+     /* Move the newly created insn ahead of the load insn.  */
+     rtx_insn *force_insn = get_last_insn ();
+     remove_insn (force_insn);
+     rtx_insn *before_load_insn = PREV_INSN (load_insn);
+     add_insn_after (force_insn, before_load_insn, BLOCK_FOR_INSN (load_insn));
+     df_insn_rescan (before_load_insn);
+     df_insn_rescan (force_insn);
+   }
+ 
+   XEXP (SET_SRC (PATTERN (load_insn)), 0) = new_mem;
+   INSN_CODE (load_insn) = -1; /* Force re-recognition.  */
+   df_insn_rescan (load_insn);
+ }
+ 
+ /* Given an UNSPEC_VPERM insn, modify the mask loaded from the
+    constant pool to reflect swapped doublewords.  */
+ static void
+ adjust_vperm (rtx_insn *insn)
+ {
+   /* We previously determined that the UNSPEC_VPERM was fed by a
+      swap of a swapping load of a TOC-relative constant pool symbol.
+      Find the MEM in the swapping load and replace it with a MEM for
+      the adjusted mask constant.  */
+   rtx set = PATTERN (insn);
+   rtx mask_reg = XVECEXP (SET_SRC (set), 0, 2);
+   rtx_insn *load_insn = 0;
+   rtx const_vector = find_swapped_load_and_const_vector (insn, &load_insn,
+ 							 mask_reg);
+ 
+   /* Create an adjusted mask from the initial mask.  */
+   unsigned int new_mask[16], i, val;
+   for (i = 0; i < 16; ++i) {
+     val = INTVAL (XVECEXP (const_vector, 0, i));
+     if (val < 16)
+       new_mask[i] = (val + 8) % 16;
+     else
+       new_mask[i] = ((val + 8) % 16) + 16;
+   }
+ 
+   /* Update the load instruction to load the new constant vector.  */
+   replace_const_vector_in_load (load_insn, new_mask);
+ 
+   if (dump_file)
+     fprintf (dump_file, "Adjusting mask for vperm %d\n", INSN_UID (insn));
+ }
+ 
+ /* Given an UNSPEC_VPERM insn fed by a complement operation, modify
+    the mask loaded from the constant pool to reflect swapped doublewords
+    and the complement.  */
+ static void
+ adjust_vperm_comp (rtx_insn *insn, swap_web_entry *insn_entry)
+ {
+   /* We previously determined that the UNSPEC_VPERM was fed by a
+      VNOR, itself fed by a swap of a swapping load of a TOC-relative
+      constant pool symbol.  Find the MEM in the swapping load and
+      replace it with a MEM for the adjusted mask constant.  */
+   rtx set = PATTERN (insn);
+   rtx mask_reg = XVECEXP (SET_SRC (set), 0, 2);
+ 
+   /* Find the VNOR and mark it for removal.  */
+   struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
+   df_ref use;
+   rtx_insn *vnor_insn = 0;
+   FOR_EACH_INSN_INFO_USE (use, insn_info)
+     if (rtx_equal_p (DF_REF_REG (use), mask_reg))
+       {
+ 	struct df_link *def_link = DF_REF_CHAIN (use);
+ 	gcc_assert (def_link && !def_link->next);
+ 	vnor_insn = DF_REF_INSN (def_link->ref);
+ 	break;
+       }
+   gcc_assert (vnor_insn);
+ 
+   unsigned uid = INSN_UID (vnor_insn);
+   insn_entry[uid].will_delete = 1;
+ 
+   /* Identify the original mask register from the VNOR.  */
+   set = PATTERN (vnor_insn);
+   mask_reg = XEXP (XEXP (SET_SRC (set), 0), 0);
+ 
+   /* Find the load insn and the CONST_VECTOR that it loads.  */
+   rtx_insn *load_insn = 0;
+   rtx const_vector
+     = find_swapped_load_and_const_vector (vnor_insn, &load_insn, mask_reg);
+ 
+   /* Create an adjusted mask from the initial mask, which reflects
+      both the effect of the swap and of the complement. */
+   unsigned int new_mask[16], i, val;
+   for (i = 0; i < 16; ++i) {
+     val = 31 - INTVAL (XVECEXP (const_vector, 0, i));
+     if (val < 16)
+       new_mask[i] = (val + 8) % 16;
+     else
+       new_mask[i] = ((val + 8) % 16) + 16;
+   }
+ 
+   /* Update the load instruction to load the new constant vector.  */
+   replace_const_vector_in_load (load_insn, new_mask);
+ 
+   if (dump_file)
+     fprintf (dump_file, "Adjusting mask for vperm %d\n", INSN_UID (insn));
+ }
+ 
  /* The insn described by INSN_ENTRY[I] can be swapped, but only
     with special handling.  Take care of that here.  */
  static void
*************** handle_special_swappables (swap_web_entr
*** 34909,34925 ****
        /* Change the lane on a direct-splat operation.  */
        adjust_splat (insn);
        break;
      }
  }
  
  /* Find the insn from the Ith table entry, which is known to be a
!    register swap Y = SWAP(X).  Replace it with a copy Y = X.  */
  static void
  replace_swap_with_copy (swap_web_entry *insn_entry, unsigned i)
  {
    rtx_insn *insn = insn_entry[i].insn;
    rtx body = PATTERN (insn);
!   rtx src_reg = XEXP (SET_SRC (body), 0);
    rtx copy = gen_rtx_SET (VOIDmode, SET_DEST (body), src_reg);
    rtx_insn *new_insn = emit_insn_before (copy, insn);
    set_block_for_insn (new_insn, BLOCK_FOR_INSN (insn));
--- 35427,35464 ----
        /* Change the lane on a direct-splat operation.  */
        adjust_splat (insn);
        break;
+     case SH_XXPERMDI:
+       /* Change the lanes on an XXPERMDI operation.  */
+       adjust_xxpermdi (insn);
+       break;
+     case SH_CONCAT:
+       /* Reverse the order of a concatenation operation.  */
+       adjust_concat (insn);
+       break;
+     case SH_VPERM:
+       /* Change the mask loaded from the constant pool for a VPERM.  */
+       adjust_vperm (insn);
+       break;
+     case SH_VPERM_COMP:
+       /* Change the mask loaded from the constant pool and
+ 	 complemented for a vec_perm built-in.  */
+       adjust_vperm_comp (insn, insn_entry);
      }
  }
  
  /* Find the insn from the Ith table entry, which is known to be a
!    register swap Y = SWAP(X).  Replace it with a copy Y = X.
!    There is now one exception to this.  The table entry may also
!    refer to Y = VNOR(X, X).  */
  static void
  replace_swap_with_copy (swap_web_entry *insn_entry, unsigned i)
  {
    rtx_insn *insn = insn_entry[i].insn;
    rtx body = PATTERN (insn);
!   enum rtx_code code = GET_CODE (SET_SRC (body));
!   rtx src_reg = (code == IOR
! 		 ? XEXP (XEXP (SET_SRC (body), 0), 0)
! 		 : XEXP (SET_SRC (body), 0));
    rtx copy = gen_rtx_SET (VOIDmode, SET_DEST (body), src_reg);
    rtx_insn *new_insn = emit_insn_before (copy, insn);
    set_block_for_insn (new_insn, BLOCK_FOR_INSN (insn));
*************** replace_swap_with_copy (swap_web_entry *
*** 34928,34934 ****
    if (dump_file)
      {
        unsigned int new_uid = INSN_UID (new_insn);
!       fprintf (dump_file, "Replacing swap %d with copy %d\n", i, new_uid);
      }
  
    df_insn_delete (insn);
--- 35467,35476 ----
    if (dump_file)
      {
        unsigned int new_uid = INSN_UID (new_insn);
!       if (code == IOR)
! 	fprintf (dump_file, "Replacing vnor %d with copy %d\n", i, new_uid);
!       else
! 	fprintf (dump_file, "Replacing swap %d with copy %d\n", i, new_uid);
      }
  
    df_insn_delete (insn);
*************** dump_swap_insn_table (swap_web_entry *in
*** 34981,34986 ****
--- 35523,35536 ----
  	      fputs ("special:extract ", dump_file);
  	    else if (insn_entry[i].special_handling == SH_SPLAT)
  	      fputs ("special:splat ", dump_file);
+ 	    else if (insn_entry[i].special_handling == SH_XXPERMDI)
+ 	      fputs ("special:xxpermdi ", dump_file);
+ 	    else if (insn_entry[i].special_handling == SH_CONCAT)
+ 	      fputs ("special:concat ", dump_file);
+ 	    else if (insn_entry[i].special_handling == SH_VPERM)
+ 	      fputs ("special:vperm ", dump_file);
+ 	    else if (insn_entry[i].special_handling == SH_VPERM_COMP)
+ 	      fputs ("special:vperm_c ", dump_file);
  	  }
  	if (insn_entry[i].web_not_optimizable)
  	  fputs ("unoptimizable ", dump_file);
diff -Nrcpad gcc-5.4.0/gcc/config/rs6000/rs6000.md gcc-5.5.0/gcc/config/rs6000/rs6000.md
*** gcc-5.4.0/gcc/config/rs6000/rs6000.md	Mon Apr 25 22:28:36 2016
--- gcc-5.5.0/gcc/config/rs6000/rs6000.md	Tue Jun 27 21:45:45 2017
***************
*** 5335,5341 ****
  	(unspec:SFDF [(match_operand:SFDF 1 "gpc_reg_operand" "<Ff>,<Fv>")
  		      (match_operand:SFDF 2 "gpc_reg_operand" "<Ff>,<Fv>")]
  		     UNSPEC_COPYSIGN))]
!   "TARGET_<MODE>_FPR && TARGET_CMPB"
    "@
     fcpsgn %0,%2,%1
     xscpsgndp %x0,%x2,%x1"
--- 5335,5341 ----
  	(unspec:SFDF [(match_operand:SFDF 1 "gpc_reg_operand" "<Ff>,<Fv>")
  		      (match_operand:SFDF 2 "gpc_reg_operand" "<Ff>,<Fv>")]
  		     UNSPEC_COPYSIGN))]
!   "TARGET_<MODE>_FPR && (TARGET_CMPB || VECTOR_UNIT_VSX_P (<MODE>mode))"
    "@
     fcpsgn %0,%2,%1
     xscpsgndp %x0,%x2,%x1"
***************
*** 6098,6114 ****
    [(set_attr "length" "12")
     (set_attr "type" "fp")])
  
! (define_expand "fixuns_trunc<mode>di2"
!   [(set (match_operand:DI 0 "register_operand" "")
! 	(unsigned_fix:DI (match_operand:SFDF 1 "register_operand" "")))]
!   "TARGET_HARD_FLOAT && (TARGET_FCTIDUZ || VECTOR_UNIT_VSX_P (<MODE>mode))"
!   "")
! 
! (define_insn "*fixuns_trunc<mode>di2_fctiduz"
    [(set (match_operand:DI 0 "gpc_reg_operand" "=d,wi")
  	(unsigned_fix:DI (match_operand:SFDF 1 "gpc_reg_operand" "<Ff>,<Fa>")))]
!   "TARGET_HARD_FLOAT && TARGET_DOUBLE_FLOAT && TARGET_FPRS
!     && TARGET_FCTIDUZ"
    "@
     fctiduz %0,%1
     xscvdpuxds %x0,%x1"
--- 6098,6107 ----
    [(set_attr "length" "12")
     (set_attr "type" "fp")])
  
! (define_insn "fixuns_trunc<mode>di2"
    [(set (match_operand:DI 0 "gpc_reg_operand" "=d,wi")
  	(unsigned_fix:DI (match_operand:SFDF 1 "gpc_reg_operand" "<Ff>,<Fa>")))]
!   "TARGET_HARD_FLOAT && TARGET_DOUBLE_FLOAT && TARGET_FPRS && TARGET_FCTIDUZ"
    "@
     fctiduz %0,%1
     xscvdpuxds %x0,%x1"
***************
*** 8905,8911 ****
    rtx gpr_lo_reg = gen_lowpart (DFmode, dest);
  
    emit_insn (gen_p8_mfvsrd_3_<mode> (gpr_hi_reg, src));
!   emit_insn (gen_vsx_xxpermdi_<mode> (tmp, src, src, GEN_INT (3)));
    emit_insn (gen_p8_mfvsrd_3_<mode> (gpr_lo_reg, tmp));
  }
    [(set_attr "length" "12")
--- 8898,8904 ----
    rtx gpr_lo_reg = gen_lowpart (DFmode, dest);
  
    emit_insn (gen_p8_mfvsrd_3_<mode> (gpr_hi_reg, src));
!   emit_insn (gen_vsx_xxpermdi_<mode>_be (tmp, src, src, GEN_INT (3)));
    emit_insn (gen_p8_mfvsrd_3_<mode> (gpr_lo_reg, tmp));
  }
    [(set_attr "length" "12")
***************
*** 12987,12993 ****
  			  (const_int 1))
  		      (label_ref (match_operand 0 "" ""))
  		      (pc)))
!    (set (match_operand:P 2 "nonimmediate_operand" "=1,*r,m,*d*c*l")
  	(plus:P (match_dup 1)
  		 (const_int -1)))
     (clobber (match_scratch:CC 3 "=X,&x,&x,&x"))
--- 12980,12986 ----
  			  (const_int 1))
  		      (label_ref (match_operand 0 "" ""))
  		      (pc)))
!    (set (match_operand:P 2 "nonimmediate_operand" "=1,*r,m,*d*wi*c*l")
  	(plus:P (match_dup 1)
  		 (const_int -1)))
     (clobber (match_scratch:CC 3 "=X,&x,&x,&x"))
***************
*** 13011,13017 ****
  			  (const_int 1))
  		      (pc)
  		      (label_ref (match_operand 0 "" ""))))
!    (set (match_operand:P 2 "nonimmediate_operand" "=1,*r,m,*d*c*l")
  	(plus:P (match_dup 1)
  		 (const_int -1)))
     (clobber (match_scratch:CC 3 "=X,&x,&x,&x"))
--- 13004,13010 ----
  			  (const_int 1))
  		      (pc)
  		      (label_ref (match_operand 0 "" ""))))
!    (set (match_operand:P 2 "nonimmediate_operand" "=1,*r,m,*d*wi*c*l")
  	(plus:P (match_dup 1)
  		 (const_int -1)))
     (clobber (match_scratch:CC 3 "=X,&x,&x,&x"))
***************
*** 13037,13043 ****
  			  (const_int 1))
  		      (label_ref (match_operand 0 "" ""))
  		      (pc)))
!    (set (match_operand:P 2 "nonimmediate_operand" "=1,*r,m,*d*c*l")
  	(plus:P (match_dup 1)
  		 (const_int -1)))
     (clobber (match_scratch:CC 3 "=X,&x,&x,&x"))
--- 13030,13036 ----
  			  (const_int 1))
  		      (label_ref (match_operand 0 "" ""))
  		      (pc)))
!    (set (match_operand:P 2 "nonimmediate_operand" "=1,*r,m,*d*wi*c*l")
  	(plus:P (match_dup 1)
  		 (const_int -1)))
     (clobber (match_scratch:CC 3 "=X,&x,&x,&x"))
***************
*** 13061,13067 ****
  			  (const_int 1))
  		      (pc)
  		      (label_ref (match_operand 0 "" ""))))
!    (set (match_operand:P 2 "nonimmediate_operand" "=1,*r,m,*d*c*l")
  	(plus:P (match_dup 1)
  		 (const_int -1)))
     (clobber (match_scratch:CC 3 "=X,&x,&x,&x"))
--- 13054,13060 ----
  			  (const_int 1))
  		      (pc)
  		      (label_ref (match_operand 0 "" ""))))
!    (set (match_operand:P 2 "nonimmediate_operand" "=1,*r,m,*d*wi*c*l")
  	(plus:P (match_dup 1)
  		 (const_int -1)))
     (clobber (match_scratch:CC 3 "=X,&x,&x,&x"))
diff -Nrcpad gcc-5.4.0/gcc/config/rs6000/rs6000.opt gcc-5.5.0/gcc/config/rs6000/rs6000.opt
*** gcc-5.4.0/gcc/config/rs6000/rs6000.opt	Mon Aug 24 19:11:02 2015
--- gcc-5.5.0/gcc/config/rs6000/rs6000.opt	Wed Feb  8 21:44:37 2017
*************** Use AltiVec instructions
*** 142,152 ****
  
  maltivec=le
  Target Report RejectNegative Var(rs6000_altivec_element_order, 1) Save
! Generate Altivec instructions using little-endian element order
  
  maltivec=be
  Target Report RejectNegative Var(rs6000_altivec_element_order, 2)
! Generate Altivec instructions using big-endian element order
  
  mhard-dfp
  Target Report Mask(DFP) Var(rs6000_isa_flags)
--- 142,152 ----
  
  maltivec=le
  Target Report RejectNegative Var(rs6000_altivec_element_order, 1) Save
! Generate AltiVec instructions using little-endian element order
  
  maltivec=be
  Target Report RejectNegative Var(rs6000_altivec_element_order, 2)
! Generate AltiVec instructions using big-endian element order
  
  mhard-dfp
  Target Report Mask(DFP) Var(rs6000_isa_flags)
diff -Nrcpad gcc-5.4.0/gcc/config/rs6000/vector.md gcc-5.5.0/gcc/config/rs6000/vector.md
*** gcc-5.4.0/gcc/config/rs6000/vector.md	Thu Aug 27 18:34:54 2015
--- gcc-5.5.0/gcc/config/rs6000/vector.md	Tue Jun 27 18:24:51 2017
***************
*** 480,492 ****
  	(gt:VEC_F (match_dup 2)
  		  (match_dup 1)))
     (set (match_dup 0)
! 	(not:VEC_F (ior:VEC_F (match_dup 3)
! 			      (match_dup 4))))]
!   "
  {
    operands[3] = gen_reg_rtx (<MODE>mode);
    operands[4] = gen_reg_rtx (<MODE>mode);
! }")
  
  (define_insn_and_split "*vector_ltgt<mode>"
    [(set (match_operand:VEC_F 0 "vfloat_operand" "")
--- 480,491 ----
  	(gt:VEC_F (match_dup 2)
  		  (match_dup 1)))
     (set (match_dup 0)
! 	(and:VEC_F (not:VEC_F (match_dup 3))
! 		   (not:VEC_F (match_dup 4))))]
  {
    operands[3] = gen_reg_rtx (<MODE>mode);
    operands[4] = gen_reg_rtx (<MODE>mode);
! })
  
  (define_insn_and_split "*vector_ltgt<mode>"
    [(set (match_operand:VEC_F 0 "vfloat_operand" "")
diff -Nrcpad gcc-5.4.0/gcc/config/rs6000/vsx.md gcc-5.5.0/gcc/config/rs6000/vsx.md
*** gcc-5.4.0/gcc/config/rs6000/vsx.md	Tue May 10 16:07:04 2016
--- gcc-5.5.0/gcc/config/rs6000/vsx.md	Wed Feb 22 22:54:56 2017
***************
*** 716,728 ****
    [(set (match_operand:VSX_M 0 "vsx_register_operand" "")
  	(match_operand:VSX_M 1 "memory_operand" ""))]
    "VECTOR_MEM_VSX_P (<MODE>mode)"
!   "")
  
  (define_expand "vsx_store_<mode>"
    [(set (match_operand:VSX_M 0 "memory_operand" "")
  	(match_operand:VSX_M 1 "vsx_register_operand" ""))]
    "VECTOR_MEM_VSX_P (<MODE>mode)"
!   "")
  
  
  ;; VSX vector floating point arithmetic instructions.  The VSX scalar
--- 716,742 ----
    [(set (match_operand:VSX_M 0 "vsx_register_operand" "")
  	(match_operand:VSX_M 1 "memory_operand" ""))]
    "VECTOR_MEM_VSX_P (<MODE>mode)"
! {
!   /* Expand to swaps if needed, prior to swap optimization.  */
!   if (!BYTES_BIG_ENDIAN)
!     {
!       rs6000_emit_le_vsx_move (operands[0], operands[1], <MODE>mode);
!       DONE;
!     }
! })
  
  (define_expand "vsx_store_<mode>"
    [(set (match_operand:VSX_M 0 "memory_operand" "")
  	(match_operand:VSX_M 1 "vsx_register_operand" ""))]
    "VECTOR_MEM_VSX_P (<MODE>mode)"
! {
!   /* Expand to swaps if needed, prior to swap optimization.  */
!   if (!BYTES_BIG_ENDIAN)
!     {
!       rs6000_emit_le_vsx_move (operands[0], operands[1], <MODE>mode);
!       DONE;
!     }
! })
  
  
  ;; VSX vector floating point arithmetic instructions.  The VSX scalar
***************
*** 1487,1505 ****
    [(set_attr "type" "vecdouble")])
  
  (define_insn "vsx_xvcvsxdsp"
!   [(set (match_operand:V4SI 0 "vsx_register_operand" "=wd,?wa")
! 	(unspec:V4SI [(match_operand:V2DF 1 "vsx_register_operand" "wf,wa")]
  		     UNSPEC_VSX_CVSXDSP))]
    "VECTOR_UNIT_VSX_P (V2DFmode)"
    "xvcvsxdsp %x0,%x1"
    [(set_attr "type" "vecfloat")])
  
  (define_insn "vsx_xvcvuxdsp"
!   [(set (match_operand:V4SI 0 "vsx_register_operand" "=wd,?wa")
! 	(unspec:V4SI [(match_operand:V2DF 1 "vsx_register_operand" "wf,wa")]
  		     UNSPEC_VSX_CVUXDSP))]
    "VECTOR_UNIT_VSX_P (V2DFmode)"
!   "xvcvuxwdp %x0,%x1"
    [(set_attr "type" "vecdouble")])
  
  ;; Convert from 32-bit to 64-bit types
--- 1501,1519 ----
    [(set_attr "type" "vecdouble")])
  
  (define_insn "vsx_xvcvsxdsp"
!   [(set (match_operand:V4SF 0 "vsx_register_operand" "=wd,?wa")
! 	(unspec:V4SF [(match_operand:V2DI 1 "vsx_register_operand" "wf,wa")]
  		     UNSPEC_VSX_CVSXDSP))]
    "VECTOR_UNIT_VSX_P (V2DFmode)"
    "xvcvsxdsp %x0,%x1"
    [(set_attr "type" "vecfloat")])
  
  (define_insn "vsx_xvcvuxdsp"
!   [(set (match_operand:V4SF 0 "vsx_register_operand" "=wd,?wa")
! 	(unspec:V4SF [(match_operand:V2DI 1 "vsx_register_operand" "wf,wa")]
  		     UNSPEC_VSX_CVUXDSP))]
    "VECTOR_UNIT_VSX_P (V2DFmode)"
!   "xvcvuxdsp %x0,%x1"
    [(set_attr "type" "vecdouble")])
  
  ;; Convert from 32-bit to 64-bit types
***************
*** 1911,1916 ****
--- 1925,1962 ----
    [(match_operand:VSX_L 0 "vsx_register_operand" "")
     (match_operand:VSX_L 1 "vsx_register_operand" "")
     (match_operand:VSX_L 2 "vsx_register_operand" "")
+    (match_operand:QI 3 "u5bit_cint_operand" "")]
+   "VECTOR_MEM_VSX_P (<MODE>mode)"
+ {
+   rtx target = operands[0];
+   rtx op0 = operands[1];
+   rtx op1 = operands[2];
+   int mask = INTVAL (operands[3]);
+   rtx perm0 = GEN_INT ((mask >> 1) & 1);
+   rtx perm1 = GEN_INT ((mask & 1) + 2);
+   rtx (*gen) (rtx, rtx, rtx, rtx, rtx);
+ 
+   if (<MODE>mode == V2DFmode)
+     gen = gen_vsx_xxpermdi2_v2df_1;
+   else
+     {
+       gen = gen_vsx_xxpermdi2_v2di_1;
+       if (<MODE>mode != V2DImode)
+ 	{
+ 	  target = gen_lowpart (V2DImode, target);
+ 	  op0 = gen_lowpart (V2DImode, op0);
+ 	  op1 = gen_lowpart (V2DImode, op1);
+ 	}
+     }
+   emit_insn (gen (target, op0, op1, perm0, perm1));
+   DONE;
+ })
+ 
+ ;; Special version of xxpermdi that retains big-endian semantics.
+ (define_expand "vsx_xxpermdi_<mode>_be"
+   [(match_operand:VSX_L 0 "vsx_register_operand" "")
+    (match_operand:VSX_L 1 "vsx_register_operand" "")
+    (match_operand:VSX_L 2 "vsx_register_operand" "")
     (match_operand:QI 3 "u5bit_cint_operand" "")]
    "VECTOR_MEM_VSX_P (<MODE>mode)"
  {
diff -Nrcpad gcc-5.4.0/gcc/config/s390/s390-modes.def gcc-5.5.0/gcc/config/s390/s390-modes.def
*** gcc-5.4.0/gcc/config/s390/s390-modes.def	Thu Jul  2 15:53:33 2015
--- gcc-5.5.0/gcc/config/s390/s390-modes.def	Fri Dec  2 08:51:58 2016
*************** Requested mode            -> Destination
*** 84,105 ****
  CCS, CCU, CCT, CCSR, CCUR -> CCZ
  CCA                       -> CCAP, CCAN
  
- Vector comparison modes
- 
- CCVEQ  	  EQ	  - 	       - 	   NE	      (VCEQ)
- CCVEQANY  EQ	  EQ	       - 	   NE	      (VCEQ)
- 
- CCVH	  GT	  - 	       - 	   LE	      (VCH)
- CCVHANY	  GT	  GT	       - 	   LE	      (VCH)
- CCVHU	  GTU	  -  	       -  	   LEU	      (VCHL)
- CCVHUANY  GTU	  GTU	       -  	   LEU	      (VCHL)
- 
- CCVFH	  GT	  -   	       -   	   UNLE	      (VFCH)
- CCVFHANY  GT	  GT	       -   	   UNLE	      (VFCH)
- CCVFHE	  GE	  -   	       -   	   UNLT	      (VFCHE)
- CCVFHEANY GE	  GE	       -   	   UNLT	      (VFCHE)
- 
- 
  
  
  *** Comments ***
--- 84,89 ----
*************** The compare and swap instructions sets t
*** 169,182 ****
  operands were equal/unequal. The CCZ1 mode ensures the result can be
  effectively placed into a register.
  
  
! CCV*
  
! The variants with and without ANY are generated by the same
! instructions and therefore are holding the same information.  However,
! when generating a condition code mask they require checking different
! bits of CC.  In that case the variants without ANY represent the
! results for *all* elements.
  
  CCRAW
  
--- 153,192 ----
  operands were equal/unequal. The CCZ1 mode ensures the result can be
  effectively placed into a register.
  
+ CCVIH, CCVIHU, CCVFH, CCVFHE
+ 
+ These are condition code modes used in instructions setting the
+ condition code.  The mode determines which comparison to perform (H -
+ high, HU - high unsigned, HE - high or equal) and whether it is a
+ floating point comparison or not (I - int, F - float).
  
! The comparison operation to be performed needs to be encoded into the
! condition code mode since the comparison operator is not available in
! compare style patterns (set cc (compare (op0) (op1))).  So the
! condition code mode is the only information to determine the
! instruction to be used.
  
! CCVIALL, CCVIANY, CCVFALL, CCVFANY
! 
! These modes are used in instructions reading the condition code.
! Opposed to the CC producer patterns the comparison operator is
! available.  Hence the comparison operation does not need to be part of
! the CC mode.  However, we still need to know whether CC has been
! generated by a float or an integer comparison in order to be able to
! invert the condition correctly (int: GT -> LE, float: GT -> UNLE).
! 
! The ALL and ANY variants differ only in the usage of CC1 which
! indicates a mixed result across the vector elements.  Be aware that
! depending on the comparison code the ALL and ANY variants might
! actually refer to their opposite meaning.  I.e. while inverting the
! comparison in (EQ (reg:CCVIALL 33) (const_int 0)) results in (NE
! (reg:CCVIALL 33) (const_int 0)) it in fact describes an ANY comparison
! (inverting "all equal" should be "any not equal") However, the
! middle-end does invert only the comparison operator without touching
! the mode.
! Hence, the ALL/ANY in the mode names refer to the meaning in the
! context of EQ, GT, GE while for the inverted codes it actually means
! ANY/ALL.
  
  CCRAW
  
*************** CC_MODE (CCT3);
*** 209,226 ****
  CC_MODE (CCRAW);
  
  CC_MODE (CCVEQ);
- CC_MODE (CCVEQANY);
  
! CC_MODE (CCVH);
! CC_MODE (CCVHANY);
! CC_MODE (CCVHU);
! CC_MODE (CCVHUANY);
  
  CC_MODE (CCVFH);
- CC_MODE (CCVFHANY);
  CC_MODE (CCVFHE);
- CC_MODE (CCVFHEANY);
  
  
  /* Vector modes.  */
  
--- 219,236 ----
  CC_MODE (CCRAW);
  
  CC_MODE (CCVEQ);
  
! CC_MODE (CCVIH);
! CC_MODE (CCVIHU);
  
  CC_MODE (CCVFH);
  CC_MODE (CCVFHE);
  
+ CC_MODE (CCVIALL);
+ CC_MODE (CCVIANY);
+ 
+ CC_MODE (CCVFALL);
+ CC_MODE (CCVFANY);
  
  /* Vector modes.  */
  
diff -Nrcpad gcc-5.4.0/gcc/config/s390/s390.c gcc-5.5.0/gcc/config/s390/s390.c
*** gcc-5.4.0/gcc/config/s390/s390.c	Wed Apr 20 07:09:32 2016
--- gcc-5.5.0/gcc/config/s390/s390.c	Fri Dec  2 08:51:58 2016
*************** s390_expand_builtin (tree exp, rtx targe
*** 785,791 ****
  		     machine_mode mode ATTRIBUTE_UNUSED,
  		     int ignore ATTRIBUTE_UNUSED)
  {
! #define MAX_ARGS 5
  
    tree fndecl = TREE_OPERAND (CALL_EXPR_FN (exp), 0);
    unsigned int fcode = DECL_FUNCTION_CODE (fndecl);
--- 785,791 ----
  		     machine_mode mode ATTRIBUTE_UNUSED,
  		     int ignore ATTRIBUTE_UNUSED)
  {
! #define MAX_ARGS 6
  
    tree fndecl = TREE_OPERAND (CALL_EXPR_FN (exp), 0);
    unsigned int fcode = DECL_FUNCTION_CODE (fndecl);
*************** s390_match_ccmode_set (rtx set, machine_
*** 1242,1247 ****
--- 1242,1252 ----
  
    gcc_assert (GET_CODE (set) == SET);
  
+   /* These modes are supposed to be used only in CC consumer
+      patterns.  */
+   gcc_assert (req_mode != CCVIALLmode && req_mode != CCVIANYmode
+ 	      && req_mode != CCVFALLmode && req_mode != CCVFANYmode);
+ 
    if (GET_CODE (SET_DEST (set)) != REG || !CC_REGNO_P (REGNO (SET_DEST (set))))
      return 1;
  
*************** s390_match_ccmode_set (rtx set, machine_
*** 1260,1267 ****
      case CCT2mode:
      case CCT3mode:
      case CCVEQmode:
!     case CCVHmode:
!     case CCVHUmode:
      case CCVFHmode:
      case CCVFHEmode:
        if (req_mode != set_mode)
--- 1265,1272 ----
      case CCT2mode:
      case CCT3mode:
      case CCVEQmode:
!     case CCVIHmode:
!     case CCVIHUmode:
      case CCVFHmode:
      case CCVFHEmode:
        if (req_mode != set_mode)
*************** s390_expand_vec_compare_scalar (enum rtx
*** 1719,1732 ****
        cmp2 = cmp1;
        cmp1 = tmp;
      }
!   *cc = gen_rtx_REG (cmp_mode, CC_REGNUM);
    emit_insn (gen_rtx_PARALLEL (VOIDmode,
  	       gen_rtvec (2,
! 			  gen_rtx_SET (VOIDmode, *cc,
  				       gen_rtx_COMPARE (cmp_mode, cmp1,
  							cmp2)),
  			  gen_rtx_CLOBBER (VOIDmode,
  					   gen_rtx_SCRATCH (V2DImode)))));
    return true;
  }
  
--- 1724,1744 ----
        cmp2 = cmp1;
        cmp1 = tmp;
      }
! 
    emit_insn (gen_rtx_PARALLEL (VOIDmode,
  	       gen_rtvec (2,
! 			  gen_rtx_SET (VOIDmode,
! 				       gen_rtx_REG (cmp_mode, CC_REGNUM),
  				       gen_rtx_COMPARE (cmp_mode, cmp1,
  							cmp2)),
  			  gen_rtx_CLOBBER (VOIDmode,
  					   gen_rtx_SCRATCH (V2DImode)))));
+ 
+   /* This is the cc reg how it will be used in the cc mode consumer.
+      It either needs to be CCVFALL or CCVFANY.  However, CC1 will
+      never be set by the scalar variants.  So it actually doesn't
+      matter which one we choose here.  */
+   *cc = gen_rtx_REG (CCVFALLmode, CC_REGNUM);
    return true;
  }
  
*************** s390_branch_condition_mask (rtx code)
*** 1988,2079 ****
        break;
  
        /* Vector comparison modes.  */
! 
!     case CCVEQmode:
!       switch (GET_CODE (code))
! 	{
! 	case EQ:        return CC0;
! 	case NE:        return CC3;
! 	default:        return -1;
! 	}
! 
!     case CCVEQANYmode:
!       switch (GET_CODE (code))
! 	{
! 	case EQ:        return CC0 | CC1;
! 	case NE:        return CC3 | CC1;
! 	default:        return -1;
! 	}
! 
!       /* Integer vector compare modes.  */
! 
!     case CCVHmode:
!       switch (GET_CODE (code))
! 	{
! 	case GT:        return CC0;
! 	case LE:        return CC3;
! 	default:        return -1;
! 	}
! 
!     case CCVHANYmode:
!       switch (GET_CODE (code))
! 	{
! 	case GT:        return CC0 | CC1;
! 	case LE:        return CC3 | CC1;
! 	default:        return -1;
! 	}
! 
!     case CCVHUmode:
!       switch (GET_CODE (code))
! 	{
! 	case GTU:       return CC0;
! 	case LEU:       return CC3;
! 	default:        return -1;
! 	}
! 
!     case CCVHUANYmode:
!       switch (GET_CODE (code))
! 	{
! 	case GTU:       return CC0 | CC1;
! 	case LEU:       return CC3 | CC1;
! 	default:        return -1;
! 	}
! 
!       /* FP vector compare modes.  */
! 
!     case CCVFHmode:
        switch (GET_CODE (code))
  	{
! 	case GT:        return CC0;
! 	case UNLE:      return CC3;
  	default:        return -1;
  	}
  
!     case CCVFHANYmode:
        switch (GET_CODE (code))
  	{
! 	case GT:        return CC0 | CC1;
! 	case UNLE:      return CC3 | CC1;
  	default:        return -1;
  	}
! 
!     case CCVFHEmode:
        switch (GET_CODE (code))
  	{
  	case GE:        return CC0;
! 	case UNLT:      return CC3;
  	default:        return -1;
  	}
  
!     case CCVFHEANYmode:
        switch (GET_CODE (code))
  	{
  	case GE:        return CC0 | CC1;
! 	case UNLT:      return CC3 | CC1;
  	default:        return -1;
  	}
  
- 
      case CCRAWmode:
        switch (GET_CODE (code))
  	{
--- 2000,2062 ----
        break;
  
        /* Vector comparison modes.  */
!       /* CC2 will never be set.  It however is part of the negated
! 	 masks.  */
!     case CCVIALLmode:
        switch (GET_CODE (code))
  	{
! 	case EQ:
! 	case GTU:
! 	case GT:
! 	case GE:        return CC0;
! 	  /* The inverted modes are in fact *any* modes.  */
! 	case NE:
! 	case LEU:
! 	case LE:
! 	case LT:        return CC3 | CC1 | CC2;
  	default:        return -1;
  	}
  
!     case CCVIANYmode:
        switch (GET_CODE (code))
  	{
! 	case EQ:
! 	case GTU:
! 	case GT:
! 	case GE:        return CC0 | CC1;
! 	  /* The inverted modes are in fact *all* modes.  */
! 	case NE:
! 	case LEU:
! 	case LE:
! 	case LT:        return CC3 | CC2;
  	default:        return -1;
  	}
!     case CCVFALLmode:
        switch (GET_CODE (code))
  	{
+ 	case EQ:
+ 	case GT:
  	case GE:        return CC0;
! 	  /* The inverted modes are in fact *any* modes.  */
! 	case NE:
! 	case UNLE:
! 	case UNLT:      return CC3 | CC1 | CC2;
  	default:        return -1;
  	}
  
!     case CCVFANYmode:
        switch (GET_CODE (code))
  	{
+ 	case EQ:
+ 	case GT:
  	case GE:        return CC0 | CC1;
! 	  /* The inverted modes are in fact *all* modes.  */
! 	case NE:
! 	case UNLE:
! 	case UNLT:      return CC3 | CC2;
  	default:        return -1;
  	}
  
      case CCRAWmode:
        switch (GET_CODE (code))
  	{
*************** s390_expand_vec_compare (rtx target, enu
*** 6128,6140 ****
  
  /* Expand the comparison CODE of CMP1 and CMP2 and copy 1 or 0 into
     TARGET if either all (ALL_P is true) or any (ALL_P is false) of the
!    elements in CMP1 and CMP2 fulfill the comparison.  */
  void
  s390_expand_vec_compare_cc (rtx target, enum rtx_code code,
  			    rtx cmp1, rtx cmp2, bool all_p)
  {
!   enum rtx_code new_code = code;
!   machine_mode cmp_mode, full_cmp_mode, scratch_mode;
    rtx tmp_reg = gen_reg_rtx (SImode);
    bool swap_p = false;
  
--- 6111,6125 ----
  
  /* Expand the comparison CODE of CMP1 and CMP2 and copy 1 or 0 into
     TARGET if either all (ALL_P is true) or any (ALL_P is false) of the
!    elements in CMP1 and CMP2 fulfill the comparison.
!    This function is only used to emit patterns for the vx builtins and
!    therefore only handles comparison codes required by the
!    builtins.  */
  void
  s390_expand_vec_compare_cc (rtx target, enum rtx_code code,
  			    rtx cmp1, rtx cmp2, bool all_p)
  {
!   machine_mode cc_producer_mode, cc_consumer_mode, scratch_mode;
    rtx tmp_reg = gen_reg_rtx (SImode);
    bool swap_p = false;
  
*************** s390_expand_vec_compare_cc (rtx target,
*** 6142,6194 ****
      {
        switch (code)
  	{
! 	case EQ:  cmp_mode = CCVEQmode; break;
! 	case NE:  cmp_mode = CCVEQmode; break;
! 	case GT:  cmp_mode = CCVHmode;  break;
! 	case GE:  cmp_mode = CCVHmode;  new_code = LE; swap_p = true; break;
! 	case LT:  cmp_mode = CCVHmode;  new_code = GT; swap_p = true; break;
! 	case LE:  cmp_mode = CCVHmode;  new_code = LE; break;
! 	case GTU: cmp_mode = CCVHUmode; break;
! 	case GEU: cmp_mode = CCVHUmode; new_code = LEU; swap_p = true; break;
! 	case LTU: cmp_mode = CCVHUmode; new_code = GTU; swap_p = true; break;
! 	case LEU: cmp_mode = CCVHUmode; new_code = LEU; break;
! 	default: gcc_unreachable ();
  	}
        scratch_mode = GET_MODE (cmp1);
      }
!   else if (GET_MODE (cmp1) == V2DFmode)
      {
        switch (code)
  	{
! 	case EQ:   cmp_mode = CCVEQmode;  break;
! 	case NE:   cmp_mode = CCVEQmode;  break;
! 	case GT:   cmp_mode = CCVFHmode;  break;
! 	case GE:   cmp_mode = CCVFHEmode; break;
! 	case UNLE: cmp_mode = CCVFHmode;  break;
! 	case UNLT: cmp_mode = CCVFHEmode; break;
! 	case LT:   cmp_mode = CCVFHmode;  new_code = GT; swap_p = true; break;
! 	case LE:   cmp_mode = CCVFHEmode; new_code = GE; swap_p = true; break;
  	default: gcc_unreachable ();
  	}
!       scratch_mode = V2DImode;
      }
    else
      gcc_unreachable ();
  
-   if (!all_p)
-     switch (cmp_mode)
-       {
-       case CCVEQmode:  full_cmp_mode = CCVEQANYmode;  break;
-       case CCVHmode:   full_cmp_mode = CCVHANYmode;   break;
-       case CCVHUmode:  full_cmp_mode = CCVHUANYmode;  break;
-       case CCVFHmode:  full_cmp_mode = CCVFHANYmode;  break;
-       case CCVFHEmode: full_cmp_mode = CCVFHEANYmode; break;
-       default: gcc_unreachable ();
-       }
-   else
-     /* The modes without ANY match the ALL modes.  */
-     full_cmp_mode = cmp_mode;
- 
    if (swap_p)
      {
        rtx tmp = cmp2;
--- 6127,6197 ----
      {
        switch (code)
  	{
! 	case EQ:
! 	case NE:
! 	  cc_producer_mode = CCVEQmode;
! 	  break;
! 	case GE:
! 	case LT:
! 	  code = swap_condition (code);
! 	  swap_p = true;
! 	  /* fallthrough */
! 	case GT:
! 	case LE:
! 	  cc_producer_mode = CCVIHmode;
! 	  break;
! 	case GEU:
! 	case LTU:
! 	  code = swap_condition (code);
! 	  swap_p = true;
! 	  /* fallthrough */
! 	case GTU:
! 	case LEU:
! 	  cc_producer_mode = CCVIHUmode;
! 	  break;
! 	default:
! 	  gcc_unreachable ();
  	}
+ 
        scratch_mode = GET_MODE (cmp1);
+       /* These codes represent inverted CC interpretations.  Inverting
+ 	 an ALL CC mode results in an ANY CC mode and the other way
+ 	 around.  Invert the all_p flag here to compensate for
+ 	 that.  */
+       if (code == NE || code == LE || code == LEU)
+ 	all_p = !all_p;
+ 
+       cc_consumer_mode = all_p ? CCVIALLmode : CCVIANYmode;
      }
!   else if (GET_MODE_CLASS (GET_MODE (cmp1)) == MODE_VECTOR_FLOAT)
      {
+       bool inv_p = false;
+ 
        switch (code)
  	{
! 	case EQ:   cc_producer_mode = CCVEQmode;  break;
! 	case NE:   cc_producer_mode = CCVEQmode;  inv_p = true; break;
! 	case GT:   cc_producer_mode = CCVFHmode;  break;
! 	case GE:   cc_producer_mode = CCVFHEmode; break;
! 	case UNLE: cc_producer_mode = CCVFHmode;  inv_p = true; break;
! 	case UNLT: cc_producer_mode = CCVFHEmode; inv_p = true; break;
! 	case LT:   cc_producer_mode = CCVFHmode;  code = GT; swap_p = true; break;
! 	case LE:   cc_producer_mode = CCVFHEmode; code = GE; swap_p = true; break;
  	default: gcc_unreachable ();
  	}
!       scratch_mode = mode_for_vector (
! 		       int_mode_for_mode (GET_MODE_INNER (GET_MODE (cmp1))),
! 		       GET_MODE_NUNITS (GET_MODE (cmp1)));
!       gcc_assert (scratch_mode != BLKmode);
! 
!       if (inv_p)
! 	all_p = !all_p;
! 
!       cc_consumer_mode = all_p ? CCVFALLmode : CCVFANYmode;
      }
    else
      gcc_unreachable ();
  
    if (swap_p)
      {
        rtx tmp = cmp2;
*************** s390_expand_vec_compare_cc (rtx target,
*** 6197,6205 ****
      }
  
    emit_insn (gen_rtx_PARALLEL (VOIDmode,
! 	       gen_rtvec (2, gen_rtx_SET (VOIDmode,
! 			       gen_rtx_REG (cmp_mode, CC_REGNUM),
! 			       gen_rtx_COMPARE (cmp_mode, cmp1, cmp2)),
  			  gen_rtx_CLOBBER (VOIDmode,
  					   gen_rtx_SCRATCH (scratch_mode)))));
    emit_move_insn (target, const0_rtx);
--- 6200,6208 ----
      }
  
    emit_insn (gen_rtx_PARALLEL (VOIDmode,
! 			  gen_rtvec (2, gen_rtx_SET (VOIDmode,
! 			       gen_rtx_REG (cc_producer_mode, CC_REGNUM),
! 			       gen_rtx_COMPARE (cc_producer_mode, cmp1, cmp2)),
  			  gen_rtx_CLOBBER (VOIDmode,
  					   gen_rtx_SCRATCH (scratch_mode)))));
    emit_move_insn (target, const0_rtx);
*************** s390_expand_vec_compare_cc (rtx target,
*** 6207,6216 ****
  
    emit_move_insn (target,
  		  gen_rtx_IF_THEN_ELSE (SImode,
! 		    gen_rtx_fmt_ee (new_code, VOIDmode,
! 				    gen_rtx_REG (full_cmp_mode, CC_REGNUM),
  				    const0_rtx),
! 		      target, tmp_reg));
  }
  
  /* Generate a vector comparison expression loading either elements of
--- 6210,6219 ----
  
    emit_move_insn (target,
  		  gen_rtx_IF_THEN_ELSE (SImode,
! 		    gen_rtx_fmt_ee (code, VOIDmode,
! 				    gen_rtx_REG (cc_consumer_mode, CC_REGNUM),
  				    const0_rtx),
! 					tmp_reg, target));
  }
  
  /* Generate a vector comparison expression loading either elements of
diff -Nrcpad gcc-5.4.0/gcc/config/s390/s390.md gcc-5.5.0/gcc/config/s390/s390.md
*** gcc-5.4.0/gcc/config/s390/s390.md	Tue May 10 09:03:20 2016
--- gcc-5.5.0/gcc/config/s390/s390.md	Fri Dec  2 08:51:58 2016
***************
*** 745,751 ****
  ; Used with VFCMP to expand part of the mnemonic
  ; For fp we have a mismatch: eq in the insn name - e in asm
  (define_mode_attr asm_fcmp [(CCVEQ "e") (CCVFH "h") (CCVFHE "he")])
! (define_mode_attr insn_cmp [(CCVEQ "eq") (CCVH "h") (CCVHU "hl") (CCVFH "h") (CCVFHE "he")])
  
  
  (include "vector.md")
--- 745,751 ----
  ; Used with VFCMP to expand part of the mnemonic
  ; For fp we have a mismatch: eq in the insn name - e in asm
  (define_mode_attr asm_fcmp [(CCVEQ "e") (CCVFH "h") (CCVFHE "he")])
! (define_mode_attr insn_cmp [(CCVEQ "eq") (CCVIH "h") (CCVIHU "hl") (CCVFH "h") (CCVFHE "he")])
  
  
  (include "vector.md")
diff -Nrcpad gcc-5.4.0/gcc/config/s390/vx-builtins.md gcc-5.5.0/gcc/config/s390/vx-builtins.md
*** gcc-5.4.0/gcc/config/s390/vx-builtins.md	Thu Feb 25 11:10:37 2016
--- gcc-5.5.0/gcc/config/s390/vx-builtins.md	Fri Dec  2 08:51:58 2016
***************
*** 36,42 ****
  			      (V1DF "DI") (V2DF "DI")])
  
  ; Condition code modes generated by int comparisons
! (define_mode_iterator VICMP [CCVEQ CCVH CCVHU])
  
  ; Comparisons supported by the vec_cmp* builtins
  (define_code_iterator intcmp [eq gt gtu ge geu lt ltu le leu])
--- 36,42 ----
  			      (V1DF "DI") (V2DF "DI")])
  
  ; Condition code modes generated by int comparisons
! (define_mode_iterator VICMP [CCVEQ CCVIH CCVIHU])
  
  ; Comparisons supported by the vec_cmp* builtins
  (define_code_iterator intcmp [eq gt gtu ge geu lt ltu le leu])
***************
*** 1951,1974 ****
  
  (define_expand "vec_cmph<VI_HW:mode>_cc"
    [(parallel
!     [(set (reg:CCVH CC_REGNUM)
! 	  (compare:CCVH (match_operand:VI_HW 1 "register_operand" "v")
! 			(match_operand:VI_HW 2 "register_operand" "v")))
       (set (match_operand:VI_HW 0 "register_operand" "=v")
  	  (gt:VI_HW (match_dup 1) (match_dup 2)))])
     (set (match_operand:SI 3 "memory_operand" "")
! 	(unspec:SI [(reg:CCVH CC_REGNUM)] UNSPEC_CC_TO_INT))]
    "TARGET_VX")
  
  (define_expand "vec_cmphl<VI_HW:mode>_cc"
    [(parallel
!     [(set (reg:CCVHU CC_REGNUM)
! 	  (compare:CCVHU (match_operand:VI_HW 1 "register_operand" "v")
! 			 (match_operand:VI_HW 2 "register_operand" "v")))
       (set (match_operand:VI_HW 0 "register_operand" "=v")
  	  (gtu:VI_HW (match_dup 1) (match_dup 2)))])
     (set (match_operand:SI 3 "memory_operand" "")
! 	(unspec:SI [(reg:CCVHU CC_REGNUM)] UNSPEC_CC_TO_INT))]
    "TARGET_VX")
  
  
--- 1951,1974 ----
  
  (define_expand "vec_cmph<VI_HW:mode>_cc"
    [(parallel
!     [(set (reg:CCVIH CC_REGNUM)
! 	  (compare:CCVIH (match_operand:VI_HW 1 "register_operand" "v")
! 			 (match_operand:VI_HW 2 "register_operand" "v")))
       (set (match_operand:VI_HW 0 "register_operand" "=v")
  	  (gt:VI_HW (match_dup 1) (match_dup 2)))])
     (set (match_operand:SI 3 "memory_operand" "")
! 	(unspec:SI [(reg:CCVIH CC_REGNUM)] UNSPEC_CC_TO_INT))]
    "TARGET_VX")
  
  (define_expand "vec_cmphl<VI_HW:mode>_cc"
    [(parallel
!     [(set (reg:CCVIHU CC_REGNUM)
! 	  (compare:CCVIHU (match_operand:VI_HW 1 "register_operand" "v")
! 			  (match_operand:VI_HW 2 "register_operand" "v")))
       (set (match_operand:VI_HW 0 "register_operand" "=v")
  	  (gtu:VI_HW (match_dup 1) (match_dup 2)))])
     (set (match_operand:SI 3 "memory_operand" "")
! 	(unspec:SI [(reg:CCVIHU CC_REGNUM)] UNSPEC_CC_TO_INT))]
    "TARGET_VX")
  
  
***************
*** 1983,1991 ****
    [(set_attr "op_type" "VRR")])
  
  (define_insn "*vec_cmph<VI_HW:mode>_cc"
!   [(set (reg:CCVH CC_REGNUM)
! 	(compare:CCVH (match_operand:VI_HW 0 "register_operand"  "v")
! 		      (match_operand:VI_HW 1 "register_operand"  "v")))
     (set (match_operand:VI_HW               2 "register_operand" "=v")
  	(gt:VI_HW (match_dup 0) (match_dup 1)))]
    "TARGET_VX"
--- 1983,1991 ----
    [(set_attr "op_type" "VRR")])
  
  (define_insn "*vec_cmph<VI_HW:mode>_cc"
!   [(set (reg:CCVIH CC_REGNUM)
! 	(compare:CCVIH (match_operand:VI_HW 0 "register_operand"  "v")
! 		       (match_operand:VI_HW 1 "register_operand"  "v")))
     (set (match_operand:VI_HW               2 "register_operand" "=v")
  	(gt:VI_HW (match_dup 0) (match_dup 1)))]
    "TARGET_VX"
***************
*** 1993,2001 ****
    [(set_attr "op_type" "VRR")])
  
  (define_insn "*vec_cmphl<VI_HW:mode>_cc"
!   [(set (reg:CCVHU CC_REGNUM)
! 	(compare:CCVHU (match_operand:VI_HW 0 "register_operand"  "v")
! 		       (match_operand:VI_HW 1 "register_operand"  "v")))
     (set (match_operand:VI_HW                2 "register_operand" "=v")
  	(gtu:VI_HW (match_dup 0) (match_dup 1)))]
    "TARGET_VX"
--- 1993,2001 ----
    [(set_attr "op_type" "VRR")])
  
  (define_insn "*vec_cmphl<VI_HW:mode>_cc"
!   [(set (reg:CCVIHU CC_REGNUM)
! 	(compare:CCVIHU (match_operand:VI_HW 0 "register_operand"  "v")
! 			(match_operand:VI_HW 1 "register_operand"  "v")))
     (set (match_operand:VI_HW                2 "register_operand" "=v")
  	(gtu:VI_HW (match_dup 0) (match_dup 1)))]
    "TARGET_VX"
***************
*** 2029,2041 ****
  
  (define_expand "vec_cmphv2df_cc"
    [(parallel
!     [(set (reg:CCVH CC_REGNUM)
! 	  (compare:CCVH (match_operand:V2DF 1 "register_operand"  "v")
! 			(match_operand:V2DF 2 "register_operand"  "v")))
       (set (match_operand:V2DI 0 "register_operand" "=v")
  	  (gt:V2DI (match_dup 1) (match_dup 2)))])
     (set (match_operand:SI 3 "memory_operand" "")
! 	(unspec:SI [(reg:CCVH CC_REGNUM)] UNSPEC_CC_TO_INT))]
    "TARGET_VX")
  
  (define_expand "vec_cmphev2df_cc"
--- 2029,2041 ----
  
  (define_expand "vec_cmphv2df_cc"
    [(parallel
!     [(set (reg:CCVIH CC_REGNUM)
! 	  (compare:CCVIH (match_operand:V2DF 1 "register_operand"  "v")
! 			 (match_operand:V2DF 2 "register_operand"  "v")))
       (set (match_operand:V2DI 0 "register_operand" "=v")
  	  (gt:V2DI (match_dup 1) (match_dup 2)))])
     (set (match_operand:SI 3 "memory_operand" "")
! 	(unspec:SI [(reg:CCVIH CC_REGNUM)] UNSPEC_CC_TO_INT))]
    "TARGET_VX")
  
  (define_expand "vec_cmphev2df_cc"
***************
*** 2061,2069 ****
    [(set_attr "op_type" "VRR")])
  
  (define_insn "*vec_cmphv2df_cc"
!   [(set (reg:CCVH CC_REGNUM)
! 	(compare:CCVH (match_operand:V2DF 0 "register_operand"  "v")
! 		      (match_operand:V2DF 1 "register_operand"  "v")))
     (set (match_operand:V2DI               2 "register_operand" "=v")
  	(gt:V2DI (match_dup 0) (match_dup 1)))]
    "TARGET_VX"
--- 2061,2069 ----
    [(set_attr "op_type" "VRR")])
  
  (define_insn "*vec_cmphv2df_cc"
!   [(set (reg:CCVIH CC_REGNUM)
! 	(compare:CCVIH (match_operand:V2DF 0 "register_operand"  "v")
! 		       (match_operand:V2DF 1 "register_operand"  "v")))
     (set (match_operand:V2DI               2 "register_operand" "=v")
  	(gt:V2DI (match_dup 0) (match_dup 1)))]
    "TARGET_VX"
diff -Nrcpad gcc-5.4.0/gcc/config/sh/sh-mem.cc gcc-5.5.0/gcc/config/sh/sh-mem.cc
*** gcc-5.4.0/gcc/config/sh/sh-mem.cc	Thu Jan 15 13:28:42 2015
--- gcc-5.5.0/gcc/config/sh/sh-mem.cc	Tue Nov 29 23:23:30 2016
*************** sh_expand_cmpnstr (rtx *operands)
*** 363,369 ****
    rtx_code_label *L_loop_byte = gen_label_rtx ();
    rtx_code_label *L_end_loop_byte = gen_label_rtx ();
  
!   rtx len = force_reg (SImode, operands[3]);
    int constp = CONST_INT_P (operands[3]);
  
    /* Loop on a register count.  */
--- 363,369 ----
    rtx_code_label *L_loop_byte = gen_label_rtx ();
    rtx_code_label *L_end_loop_byte = gen_label_rtx ();
  
!   rtx len = copy_to_mode_reg (SImode, operands[3]);
    int constp = CONST_INT_P (operands[3]);
  
    /* Loop on a register count.  */
*************** sh_expand_setmem (rtx *operands)
*** 674,682 ****
    rtx jump;
    rtx dest = copy_rtx (operands[0]);
    rtx dest_addr = copy_addr_to_reg (XEXP (dest, 0));
!   rtx val = force_reg (SImode, operands[2]);
    int align = INTVAL (operands[3]);
!   rtx len = force_reg (SImode, operands[1]);
  
    if (! CONST_INT_P (operands[1]))
      return;
--- 674,682 ----
    rtx jump;
    rtx dest = copy_rtx (operands[0]);
    rtx dest_addr = copy_addr_to_reg (XEXP (dest, 0));
!   rtx val = copy_to_mode_reg (SImode, operands[2]);
    int align = INTVAL (operands[3]);
!   rtx len = copy_to_mode_reg (SImode, operands[1]);
  
    if (! CONST_INT_P (operands[1]))
      return;
diff -Nrcpad gcc-5.4.0/gcc/config/sh/sh.c gcc-5.5.0/gcc/config/sh/sh.c
*** gcc-5.4.0/gcc/config/sh/sh.c	Sat Oct  3 15:20:58 2015
--- gcc-5.5.0/gcc/config/sh/sh.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 20,28 ****
  <http://www.gnu.org/licenses/>.  */
  
  #include <sstream>
- #include <vector>
  
  #include "config.h"
  #include "system.h"
  #include "coretypes.h"
  #include "tm.h"
--- 20,28 ----
  <http://www.gnu.org/licenses/>.  */
  
  #include <sstream>
  
  #include "config.h"
+ #define INCLUDE_VECTOR
  #include "system.h"
  #include "coretypes.h"
  #include "tm.h"
diff -Nrcpad gcc-5.4.0/gcc/config/sh/sh_treg_combine.cc gcc-5.5.0/gcc/config/sh/sh_treg_combine.cc
*** gcc-5.4.0/gcc/config/sh/sh_treg_combine.cc	Thu Jan 15 13:28:42 2015
--- gcc-5.5.0/gcc/config/sh/sh_treg_combine.cc	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 19,24 ****
--- 19,27 ----
  <http://www.gnu.org/licenses/>.  */
  
  #include "config.h"
+ #define INCLUDE_ALGORITHM
+ #define INCLUDE_LIST
+ #define INCLUDE_VECTOR
  #include "system.h"
  #include "coretypes.h"
  #include "machmode.h"
*************** along with GCC; see the file COPYING3.
*** 65,74 ****
  #include "stmt.h"
  #include "expr.h"
  
- #include <algorithm>
- #include <list>
- #include <vector>
- 
  /*
  This pass tries to optimize for example this:
  	mov.l	@(4,r4),r1
--- 68,73 ----
diff -Nrcpad gcc-5.4.0/gcc/config/sparc/sparc.c gcc-5.5.0/gcc/config/sparc/sparc.c
*** gcc-5.4.0/gcc/config/sparc/sparc.c	Tue Apr 12 20:55:33 2016
--- gcc-5.5.0/gcc/config/sparc/sparc.c	Fri Jun  9 19:21:15 2017
*************** sparc_expand_epilogue (bool for_eh)
*** 5756,5761 ****
--- 5756,5764 ----
  {
    HOST_WIDE_INT size = sparc_frame_size;
  
+   if (cfun->calls_alloca)
+     emit_insn (gen_frame_blockage ());
+ 
    if (sparc_n_global_fp_regs > 0)
      emit_save_or_restore_global_fp_regs (sparc_frame_base_reg,
  				         sparc_frame_base_offset
*************** sparc_expand_vec_perm_bmask (machine_mod
*** 11967,11973 ****
      }
  
    /* Always perform the final addition/merge within the bmask insn.  */
!   emit_insn (gen_bmasksi_vis (gen_rtx_REG (SImode, 0), sel, t_1));
  }
  
  /* Implement TARGET_FRAME_POINTER_REQUIRED.  */
--- 11970,11976 ----
      }
  
    /* Always perform the final addition/merge within the bmask insn.  */
!   emit_insn (gen_bmasksi_vis (gen_reg_rtx (SImode), sel, t_1));
  }
  
  /* Implement TARGET_FRAME_POINTER_REQUIRED.  */
*************** sparc_frame_pointer_required (void)
*** 11989,11996 ****
    if (TARGET_FLAT)
      return false;
  
!   /* Otherwise, the frame pointer is required if the function isn't leaf.  */
!   return !(crtl->is_leaf && only_leaf_regs_used ());
  }
  
  /* The way this is structured, we can't eliminate SFP in favor of SP
--- 11992,12000 ----
    if (TARGET_FLAT)
      return false;
  
!   /* Otherwise, the frame pointer is required if the function isn't leaf, but
!      we cannot use sparc_leaf_function_p since it hasn't been computed yet.  */
!   return !(optimize > 0 && crtl->is_leaf && only_leaf_regs_used ());
  }
  
  /* The way this is structured, we can't eliminate SFP in favor of SP
*************** vector_init_bshuffle (rtx target, rtx el
*** 12233,12239 ****
      }
  
    sel = force_reg (SImode, GEN_INT (bmask));
!   emit_insn (gen_bmasksi_vis (gen_rtx_REG (SImode, 0), sel, const0_rtx));
    emit_insn (final_insn);
  }
  
--- 12237,12243 ----
      }
  
    sel = force_reg (SImode, GEN_INT (bmask));
!   emit_insn (gen_bmasksi_vis (gen_reg_rtx (SImode), sel, const0_rtx));
    emit_insn (final_insn);
  }
  
*************** sparc_expand_vector_init (rtx target, rt
*** 12289,12302 ****
    const machine_mode inner_mode = GET_MODE_INNER (mode);
    const int n_elts = GET_MODE_NUNITS (mode);
    int i, n_var = 0;
!   bool all_same;
    rtx mem;
  
-   all_same = true;
    for (i = 0; i < n_elts; i++)
      {
        rtx x = XVECEXP (vals, 0, i);
!       if (!CONSTANT_P (x))
  	n_var++;
  
        if (i > 0 && !rtx_equal_p (x, XVECEXP (vals, 0, 0)))
--- 12293,12307 ----
    const machine_mode inner_mode = GET_MODE_INNER (mode);
    const int n_elts = GET_MODE_NUNITS (mode);
    int i, n_var = 0;
!   bool all_same = true;
    rtx mem;
  
    for (i = 0; i < n_elts; i++)
      {
        rtx x = XVECEXP (vals, 0, i);
!       if (!(CONST_INT_P (x)
! 	    || GET_CODE (x) == CONST_DOUBLE
! 	    || GET_CODE (x) == CONST_FIXED))
  	n_var++;
  
        if (i > 0 && !rtx_equal_p (x, XVECEXP (vals, 0, 0)))
diff -Nrcpad gcc-5.4.0/gcc/config/sparc/sparc.md gcc-5.5.0/gcc/config/sparc/sparc.md
*** gcc-5.4.0/gcc/config/sparc/sparc.md	Sat Dec 19 21:59:47 2015
--- gcc-5.5.0/gcc/config/sparc/sparc.md	Fri Jun  9 19:21:15 2017
***************
*** 328,334 ****
  	     (const_int 2)
  	     (const_int 1))
  	 (eq_attr "type" "sibcall")
! 	   (if_then_else (eq_attr "leaf_function" "true")
  	     (if_then_else (eq_attr "empty_delay_slot" "true")
  	       (const_int 3)
  	       (const_int 2))
--- 328,335 ----
  	     (const_int 2)
  	     (const_int 1))
  	 (eq_attr "type" "sibcall")
! 	   (if_then_else (ior (eq_attr "leaf_function" "true")
! 	                      (eq_attr "flat" "true"))
  	     (if_then_else (eq_attr "empty_delay_slot" "true")
  	       (const_int 3)
  	       (const_int 2))
***************
*** 6367,6373 ****
  (define_expand "return"
    [(return)]
    "sparc_can_use_return_insn_p ()"
!   "")
  
  (define_insn "*return_internal"
    [(return)]
--- 6368,6377 ----
  (define_expand "return"
    [(return)]
    "sparc_can_use_return_insn_p ()"
! {
!   if (cfun->calls_alloca)
!     emit_insn (gen_frame_blockage ());
! })
  
  (define_insn "*return_internal"
    [(return)]
***************
*** 8380,8386 ****
                   (match_operand:DI 2 "register_or_zero_operand" "rJ")))
     (set (zero_extract:DI (reg:DI GSR_REG) (const_int 32) (const_int 32))
          (plus:DI (match_dup 1) (match_dup 2)))]
!   "TARGET_VIS2"
    "bmask\t%r1, %r2, %0"
    [(set_attr "type" "array")])
  
--- 8384,8390 ----
                   (match_operand:DI 2 "register_or_zero_operand" "rJ")))
     (set (zero_extract:DI (reg:DI GSR_REG) (const_int 32) (const_int 32))
          (plus:DI (match_dup 1) (match_dup 2)))]
!   "TARGET_VIS2 && TARGET_ARCH64"
    "bmask\t%r1, %r2, %0"
    [(set_attr "type" "array")])
  
***************
*** 8422,8428 ****
      mask |= (INTVAL (XVECEXP (sel, 0, i)) & 0xf) << (28 - i*4);
    sel = force_reg (SImode, gen_int_mode (mask, SImode));
  
!   emit_insn (gen_bmasksi_vis (gen_rtx_REG (SImode, 0), sel, const0_rtx));
    emit_insn (gen_bshufflev8qi_vis (operands[0], operands[1], operands[2]));
    DONE;
  })
--- 8426,8432 ----
      mask |= (INTVAL (XVECEXP (sel, 0, i)) & 0xf) << (28 - i*4);
    sel = force_reg (SImode, gen_int_mode (mask, SImode));
  
!   emit_insn (gen_bmasksi_vis (gen_reg_rtx (SImode), sel, const0_rtx));
    emit_insn (gen_bshufflev8qi_vis (operands[0], operands[1], operands[2]));
    DONE;
  })
diff -Nrcpad gcc-5.4.0/gcc/config/xtensa/xtensa.c gcc-5.5.0/gcc/config/xtensa/xtensa.c
*** gcc-5.4.0/gcc/config/xtensa/xtensa.c	Tue Mar  3 17:44:01 2015
--- gcc-5.5.0/gcc/config/xtensa/xtensa.c	Mon Sep 11 21:53:38 2017
*************** xtensa_mem_offset (unsigned v, machine_m
*** 634,639 ****
--- 634,640 ----
      case HImode:
        return xtensa_uimm8x2 (v);
  
+     case DImode:
      case DFmode:
        return (xtensa_uimm8x4 (v) && xtensa_uimm8x4 (v + 4));
  
*************** xtensa_emit_call (int callop, rtx *opera
*** 1808,1814 ****
    rtx tgt = operands[callop];
  
    if (GET_CODE (tgt) == CONST_INT)
!     sprintf (result, "call%d\t0x%lx", WINDOW_SIZE, INTVAL (tgt));
    else if (register_operand (tgt, VOIDmode))
      sprintf (result, "callx%d\t%%%d", WINDOW_SIZE, callop);
    else
--- 1809,1816 ----
    rtx tgt = operands[callop];
  
    if (GET_CODE (tgt) == CONST_INT)
!     sprintf (result, "call%d\t" HOST_WIDE_INT_PRINT_HEX,
! 	     WINDOW_SIZE, INTVAL (tgt));
    else if (register_operand (tgt, VOIDmode))
      sprintf (result, "callx%d\t%%%d", WINDOW_SIZE, callop);
    else
*************** xtensa_tls_module_base (void)
*** 1891,1913 ****
  static rtx_insn *
  xtensa_call_tls_desc (rtx sym, rtx *retp)
  {
!   rtx fn, arg, a10;
    rtx_insn *call_insn, *insns;
  
    start_sequence ();
    fn = gen_reg_rtx (Pmode);
    arg = gen_reg_rtx (Pmode);
!   a10 = gen_rtx_REG (Pmode, 10);
  
    emit_insn (gen_tls_func (fn, sym));
    emit_insn (gen_tls_arg (arg, sym));
!   emit_move_insn (a10, arg);
!   call_insn = emit_call_insn (gen_tls_call (a10, fn, sym, const1_rtx));
!   use_reg (&CALL_INSN_FUNCTION_USAGE (call_insn), a10);
    insns = get_insns ();
    end_sequence ();
  
!   *retp = a10;
    return insns;
  }
  
--- 1893,1915 ----
  static rtx_insn *
  xtensa_call_tls_desc (rtx sym, rtx *retp)
  {
!   rtx fn, arg, a_io;
    rtx_insn *call_insn, *insns;
  
    start_sequence ();
    fn = gen_reg_rtx (Pmode);
    arg = gen_reg_rtx (Pmode);
!   a_io = gen_rtx_REG (Pmode, WINDOW_SIZE + 2);
  
    emit_insn (gen_tls_func (fn, sym));
    emit_insn (gen_tls_arg (arg, sym));
!   emit_move_insn (a_io, arg);
!   call_insn = emit_call_insn (gen_tls_call (a_io, fn, sym, const1_rtx));
!   use_reg (&CALL_INSN_FUNCTION_USAGE (call_insn), a_io);
    insns = get_insns ();
    end_sequence ();
  
!   *retp = a_io;
    return insns;
  }
  
*************** print_operand (FILE *file, rtx x, int le
*** 2379,2392 ****
  
      case 'L':
        if (GET_CODE (x) == CONST_INT)
! 	fprintf (file, "%ld", (32 - INTVAL (x)) & 0x1f);
        else
  	output_operand_lossage ("invalid %%L value");
        break;
  
      case 'R':
        if (GET_CODE (x) == CONST_INT)
! 	fprintf (file, "%ld", INTVAL (x) & 0x1f);
        else
  	output_operand_lossage ("invalid %%R value");
        break;
--- 2381,2394 ----
  
      case 'L':
        if (GET_CODE (x) == CONST_INT)
! 	fprintf (file, HOST_WIDE_INT_PRINT_DEC, (32 - INTVAL (x)) & 0x1f);
        else
  	output_operand_lossage ("invalid %%L value");
        break;
  
      case 'R':
        if (GET_CODE (x) == CONST_INT)
! 	fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x) & 0x1f);
        else
  	output_operand_lossage ("invalid %%R value");
        break;
*************** print_operand (FILE *file, rtx x, int le
*** 2400,2406 ****
  
      case 'd':
        if (GET_CODE (x) == CONST_INT)
! 	fprintf (file, "%ld", INTVAL (x));
        else
  	output_operand_lossage ("invalid %%d value");
        break;
--- 2402,2408 ----
  
      case 'd':
        if (GET_CODE (x) == CONST_INT)
! 	fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
        else
  	output_operand_lossage ("invalid %%d value");
        break;
*************** print_operand (FILE *file, rtx x, int le
*** 2455,2461 ****
        else if (GET_CODE (x) == MEM)
  	output_address (XEXP (x, 0));
        else if (GET_CODE (x) == CONST_INT)
! 	fprintf (file, "%ld", INTVAL (x));
        else
  	output_addr_const (file, x);
      }
--- 2457,2463 ----
        else if (GET_CODE (x) == MEM)
  	output_address (XEXP (x, 0));
        else if (GET_CODE (x) == CONST_INT)
! 	fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
        else
  	output_addr_const (file, x);
      }
*************** hwloop_optimize (hwloop_info loop)
*** 4165,4171 ****
        entry_after = BB_END (entry_bb);
        while (DEBUG_INSN_P (entry_after)
               || (NOTE_P (entry_after)
!                  && NOTE_KIND (entry_after) != NOTE_INSN_BASIC_BLOCK))
          entry_after = PREV_INSN (entry_after);
  
        emit_insn_after (seq, entry_after);
--- 4167,4176 ----
        entry_after = BB_END (entry_bb);
        while (DEBUG_INSN_P (entry_after)
               || (NOTE_P (entry_after)
!                  && NOTE_KIND (entry_after) != NOTE_INSN_BASIC_BLOCK
! 		 /* Make sure we don't split a call and its corresponding
! 		    CALL_ARG_LOCATION note.  */
!                  && NOTE_KIND (entry_after) != NOTE_INSN_CALL_ARG_LOCATION))
          entry_after = PREV_INSN (entry_after);
  
        emit_insn_after (seq, entry_after);
diff -Nrcpad gcc-5.4.0/gcc/config/xtensa/xtensa.h gcc-5.5.0/gcc/config/xtensa/xtensa.h
*** gcc-5.4.0/gcc/config/xtensa/xtensa.h	Tue Mar  3 17:44:01 2015
--- gcc-5.5.0/gcc/config/xtensa/xtensa.h	Tue May 30 23:38:45 2017
*************** typedef struct xtensa_args
*** 812,818 ****
     for debugging.  */
  #define INCOMING_RETURN_ADDR_RTX gen_rtx_REG (Pmode, 0)
  #define DWARF_FRAME_RETURN_COLUMN DWARF_FRAME_REGNUM (0)
! #define DWARF_FRAME_REGISTERS 16
  #define EH_RETURN_DATA_REGNO(N) ((N) < 2 ? (N) + 2 : INVALID_REGNUM)
  #define ASM_PREFERRED_EH_DATA_FORMAT(CODE, GLOBAL)			\
    (flag_pic								\
--- 812,820 ----
     for debugging.  */
  #define INCOMING_RETURN_ADDR_RTX gen_rtx_REG (Pmode, 0)
  #define DWARF_FRAME_RETURN_COLUMN DWARF_FRAME_REGNUM (0)
! #define DWARF_ALT_FRAME_RETURN_COLUMN 16
! #define DWARF_FRAME_REGISTERS (DWARF_ALT_FRAME_RETURN_COLUMN		\
! 			       + (TARGET_WINDOWED_ABI ? 0 : 1))
  #define EH_RETURN_DATA_REGNO(N) ((N) < 2 ? (N) + 2 : INVALID_REGNUM)
  #define ASM_PREFERRED_EH_DATA_FORMAT(CODE, GLOBAL)			\
    (flag_pic								\
diff -Nrcpad gcc-5.4.0/gcc/config/xtensa/xtensa.md gcc-5.5.0/gcc/config/xtensa/xtensa.md
*** gcc-5.4.0/gcc/config/xtensa/xtensa.md	Tue Mar  3 17:44:01 2015
--- gcc-5.5.0/gcc/config/xtensa/xtensa.md	Tue May 30 23:37:42 2017
***************
*** 1867,1873 ****
  				  UNSPEC_TLS_CALL))
  	      (match_operand 3 "" "i")))]
    "TARGET_THREADPTR && HAVE_AS_TLS"
!   "callx8.tls %1, %2@TLSCALL"
    [(set_attr "type"	"call")
     (set_attr "mode"	"none")
     (set_attr "length"	"3")])
--- 1867,1878 ----
  				  UNSPEC_TLS_CALL))
  	      (match_operand 3 "" "i")))]
    "TARGET_THREADPTR && HAVE_AS_TLS"
! {
!   if (TARGET_WINDOWED_ABI)
!     return "callx8.tls %1, %2@TLSCALL";
!   else
!     return "callx0.tls %1, %2@TLSCALL";
! }
    [(set_attr "type"	"call")
     (set_attr "mode"	"none")
     (set_attr "length"	"3")])
diff -Nrcpad gcc-5.4.0/gcc/config.gcc gcc-5.5.0/gcc/config.gcc
*** gcc-5.4.0/gcc/config.gcc	Thu Sep 10 14:17:53 2015
--- gcc-5.5.0/gcc/config.gcc	Mon Jan  9 21:06:20 2017
*************** i[34567]86-*-*)
*** 367,373 ****
  		       xsavesintrin.h avx512dqintrin.h avx512bwintrin.h
  		       avx512vlintrin.h avx512vlbwintrin.h avx512vldqintrin.h
  		       avx512ifmaintrin.h avx512ifmavlintrin.h avx512vbmiintrin.h
! 		       avx512vbmivlintrin.h clwbintrin.h pcommitintrin.h mwaitxintrin.h"
  	;;
  x86_64-*-*)
  	cpu_type=i386
--- 367,373 ----
  		       xsavesintrin.h avx512dqintrin.h avx512bwintrin.h
  		       avx512vlintrin.h avx512vlbwintrin.h avx512vldqintrin.h
  		       avx512ifmaintrin.h avx512ifmavlintrin.h avx512vbmiintrin.h
! 		       avx512vbmivlintrin.h clwbintrin.h mwaitxintrin.h"
  	;;
  x86_64-*-*)
  	cpu_type=i386
*************** x86_64-*-*)
*** 388,394 ****
  		       xsavesintrin.h avx512dqintrin.h avx512bwintrin.h
  		       avx512vlintrin.h avx512vlbwintrin.h avx512vldqintrin.h
  		       avx512ifmaintrin.h avx512ifmavlintrin.h avx512vbmiintrin.h
! 		       avx512vbmivlintrin.h clwbintrin.h pcommitintrin.h mwaitxintrin.h"
  	;;
  ia64-*-*)
  	extra_headers=ia64intrin.h
--- 388,394 ----
  		       xsavesintrin.h avx512dqintrin.h avx512bwintrin.h
  		       avx512vlintrin.h avx512vlbwintrin.h avx512vldqintrin.h
  		       avx512ifmaintrin.h avx512ifmavlintrin.h avx512vbmiintrin.h
! 		       avx512vbmivlintrin.h clwbintrin.h mwaitxintrin.h"
  	;;
  ia64-*-*)
  	extra_headers=ia64intrin.h
*************** case ${target} in
*** 790,795 ****
--- 790,800 ----
        ;;
    esac
    ;;
+ *-*-phoenix*)
+   gas=yes
+   gnu_ld=yes
+   default_use_cxa_atexit=yes
+   ;;
  *-*-rtems*)
    case ${enable_threads} in
      "" | yes | rtems) thread_file='rtems' ;;
*************** aarch64*-*-elf)
*** 909,914 ****
--- 914,924 ----
  	done
  	TM_MULTILIB_CONFIG=`echo $TM_MULTILIB_CONFIG | sed 's/^,//'`
  	;;
+ aarch64*-*-freebsd*)
+ 	tm_file="${tm_file} dbxelf.h elfos.h ${fbsd_tm_file}"
+ 	tm_file="${tm_file} aarch64/aarch64-elf.h aarch64/aarch64-freebsd.h"
+ 	tmake_file="${tmake_file} aarch64/t-aarch64 aarch64/t-aarch64-freebsd"
+ 	;;
  aarch64*-*-linux*)
  	tm_file="${tm_file} dbxelf.h elfos.h gnu-user.h linux.h glibc-stdint.h"
  	tm_file="${tm_file} aarch64/aarch64-elf.h aarch64/aarch64-linux.h"
*************** arm*-*-freebsd*)                # ARM Fr
*** 1026,1036 ****
  	case $target in
  	armv6*-*-freebsd*)
  	    tm_defines="${tm_defines} TARGET_FREEBSD_ARMv6=1"
! 	    ;;
! 	esac
! 	case $target in
! 	arm*hf-*-freebsd*)
! 	    tm_defines="${tm_defines} TARGET_FREEBSD_ARM_HARD_FLOAT=1"
  	    ;;
  	esac
  	with_tls=${with_tls:-gnu}
--- 1036,1044 ----
  	case $target in
  	armv6*-*-freebsd*)
  	    tm_defines="${tm_defines} TARGET_FREEBSD_ARMv6=1"
!             if test $fbsd_major -ge 11; then
!                tm_defines="${tm_defines} TARGET_FREEBSD_ARM_HARD_FLOAT=1"
!             fi
  	    ;;
  	esac
  	with_tls=${with_tls:-gnu}
*************** arm*-*-uclinux*eabi*)		# ARM ucLinux
*** 1067,1072 ****
--- 1075,1086 ----
  	# The EABI requires the use of __cxa_atexit.
  	default_use_cxa_atexit=yes
  	;;
+ arm*-*-phoenix*)
+ 	tm_file="elfos.h arm/unknown-elf.h arm/elf.h arm/bpabi.h"
+ 	tm_file="${tm_file} newlib-stdint.h phoenix.h"
+ 	tm_file="${tm_file} arm/aout.h arm/arm.h"
+ 	tmake_file="${tmake_file} arm/t-arm arm/t-bpabi arm/t-phoenix"
+ 	;;
  arm*-*-eabi* | arm*-*-symbianelf* | arm*-*-rtems*)
  	case ${target} in
  	arm*eb-*-eabi*)
diff -Nrcpad gcc-5.4.0/gcc/coverage.c gcc-5.5.0/gcc/coverage.c
*** gcc-5.4.0/gcc/coverage.c	Thu Jan 15 13:28:42 2015
--- gcc-5.5.0/gcc/coverage.c	Thu Jun 22 11:26:58 2017
*************** coverage_end_function (unsigned lineno_c
*** 767,772 ****
--- 767,784 ----
      }
  }
  
+ /* Remove coverage file if opened.  */
+ 
+ void
+ coverage_remove_note_file (void)
+ {
+   if (bbg_file_name)
+     {
+       gcov_close ();
+       unlink (bbg_file_name);
+     }
+ }
+ 
  /* Build a coverage variable of TYPE for function FN_DECL.  If COUNTER
     >= 0 it is a counter array, otherwise it is the function structure.  */
  
diff -Nrcpad gcc-5.4.0/gcc/coverage.h gcc-5.5.0/gcc/coverage.h
*** gcc-5.4.0/gcc/coverage.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/coverage.h	Thu Jun 22 11:26:58 2017
*************** along with GCC; see the file COPYING3.
*** 24,29 ****
--- 24,30 ----
  
  extern void coverage_init (const char *);
  extern void coverage_finish (void);
+ extern void coverage_remove_note_file (void);
  
  /* Start outputting coverage information for the current
     function.  */
diff -Nrcpad gcc-5.4.0/gcc/cp/ChangeLog gcc-5.5.0/gcc/cp/ChangeLog
*** gcc-5.4.0/gcc/cp/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/cp/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,256 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-09-18  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/80294 - ICE with constexpr and inheritance.
+ 	* constexpr.c (reduced_constant_expression_p):
+ 	A null constructor element is non-constant.
+ 	(cxx_eval_indirect_ref): Don't VERIFY_CONSTANT before
+ 	returning an empty base.
+ 
+ 	PR c++/79607 - ICE with T{} initializer
+ 	* decl.c (type_dependent_init_p): Check the type of a CONSTRUCTOR.
+ 
+ 	PR c++/72457
+ 	* init.c (expand_aggr_init_1): Only handle value-init of bases.
+ 	* constexpr.c (build_data_member_initialization): Handle multiple
+ 	initializers for the same field.
+ 
+ 	PR c++/55922
+ 	PR c++/63151
+ 	* init.c (expand_aggr_init_1): Handle list-initialization from {}.
+ 
+ 2017-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-06-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/81154
+ 	* semantics.c (handle_omp_array_sections_1, finish_omp_clauses):
+ 	Complain about t not being a variable if t is OVERLOAD even
+ 	when processing_template_decl.
+ 
+ 	2017-06-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/80984
+ 	* cp-gimplify.c (cp_genericize): Only look for VAR_DECLs in
+ 	BLOCK_VARS (outer) chain.
+ 	(cxx_omp_const_qual_no_mutable): Likewise.
+ 
+ 2017-06-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/81006
+ 	* semantics.c (handle_omp_array_sections_1): Convert TYPE_MAX_VALUE
+ 	to sizetype before size_binop.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-04-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/80363
+ 	* error.c (dump_expr): Handle VEC_COND_EXPR like COND_EXPR.
+ 
+ 	2017-04-10  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/80176
+ 	* tree.c (lvalue_kind): For COMPONENT_REF with BASELINK second
+ 	operand, if it is a static member function, recurse on the
+ 	BASELINK.
+ 
+ 	2017-03-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/80141
+ 	* semantics.c (finish_omp_clause) <case OMP_CLAUSE_SIMDLEN,
+ 	case OMP_CLAUSE_ALIGNED>: Call maybe_constant_value only when not
+ 	processing_template_decl.
+ 
+ 	2017-03-10  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/79896
+ 	* decl.c (finish_enum_value_list): If value is error_mark_node,
+ 	don't copy it and change its type.
+ 	* init.c (constant_value_1): Return error_mark_node if DECL_INITIAL
+ 	of CONST_DECL is error_mark_node.
+ 
+ 	2017-02-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/79664
+ 	* parser.c (cp_parser_omp_teams, cp_parser_omp_target): Use
+ 	SET_EXPR_LOCATION on OMP_TARGET/OMP_TEAMS tree.
+ 	* constexpr.c (potential_constant_expression_1): Handle
+ 	OMP_*, OACC_* and CILK_* trees.
+ 
+ 	2017-02-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/79512
+ 	* parser.c (cp_parser_omp_target): For -fopenmp-simd
+ 	ignore #pragma omp target even when not followed by identifier.
+ 
+ 	2017-01-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/78341
+ 	* parser.c (cp_parser_std_attribute_spec): Remove over-eager
+ 	assertion.  Formatting fix.
+ 
+ 	2017-01-04  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/78949
+ 	* typeck.c (cp_build_unary_op): Call mark_rvalue_use on arg if it has
+ 	vector type.
+ 
+ 	2016-12-02  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/78649
+ 	* pt.c (tsubst_init): Don't call build_value_init if decl's type
+ 	is error_mark_node.
+ 
+ 	2016-11-23  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77739
+ 	* cp-gimplify.c (cp_gimplify_tree) <case VEC_INIT_EXPR>: Pass
+ 	false as handle_invisiref_parm_p to cp_genericize_tree.
+ 	(struct cp_genericize_data): Add handle_invisiref_parm_p field.
+ 	(cp_genericize_r): Don't wrap is_invisiref_parm into references
+ 	if !wtd->handle_invisiref_parm_p.
+ 	(cp_genericize_tree): Add handle_invisiref_parm_p argument,
+ 	set wtd.handle_invisiref_parm_p to it.
+ 	(cp_genericize): Pass true as handle_invisiref_parm_p to
+ 	cp_genericize_tree.  Formatting fix.
+ 
+ 	2016-11-18  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77285
+ 	* mangle.c (mangle_tls_init_fn, mangle_tls_wrapper_fn): Call
+ 	check_abi_tags.
+ 
+ 	2016-10-31  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/78089
+ 	* parser.c (cp_parser_postfix_expression): Replace return statement in
+ 	the first switch with setting postfix_expression to the return
+ 	expression and break;.
+ 
+ 	2016-09-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77467
+ 	* constexpr.c (enum constexpr_switch_state): New.
+ 	(struct constexpr_ctx): Add css_state field.
+ 	(label_matches): Add CTX and STMT arguments, remove I and
+ 	DEFAULT_LABEL.  For CASE_LABEL_EXPR assert ctx->css_state != NULL,
+ 	handle default labels according to css_state.
+ 	(cxx_eval_statement_list): Remove statement skipping, label_matches
+ 	and default_label handling code.
+ 	(cxx_eval_loop_expr): Exit after first iteration even if
+ 	switches (jump_target).
+ 	(cxx_eval_switch_expr): Set up css_state field in ctx, if default
+ 	label has been seen in the body, but no cases matched, evaluate
+ 	the body second time.
+ 	(cxx_eval_constant_expression): Handle stmt skipping and label_matches
+ 	here.  Handle PREDICT_EXPR.  For MODIFY_EXPR or INIT_EXPR, assert
+ 	statement is not skipped.  For COND_EXPR during skipping, don't
+ 	evaluate condition, just the then block and if still skipping at the
+ 	end also the else block.
+ 	(cxx_eval_outermost_constant_expr): Adjust constexpr_ctx initializer.
+ 	(is_sub_constant_expr): Likewise.
+ 
+ 	2016-09-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77722
+ 	* cp-gimplify.c (cp_ubsan_maybe_instrument_return): Instrument also
+ 	functions that have just a STATEMENT_LIST instead of BIND_EXPR, or
+ 	BIND_EXPR with some statement rather than STATEMENT_LIST as body.
+ 
+ 	2016-09-20  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77637
+ 	* parser.c (cp_parser_std_attribute_list): Reject ... without
+ 	preceding attribute.
+ 
+ 	2016-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77375
+ 	* class.c (check_bases): Set CLASSTYPE_HAS_MUTABLE if any
+ 	TYPE_HAS_MUTABLE_P for any bases.
+ 
+ 	2016-08-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/72868
+ 	* constexpr.c (label_matches): Handle case range expressions.
+ 
+ 2017-01-12  Nathan Sidwell  <nathan@acm.org>
+ 
+ 	PR c++/77812
+ 	* name-lookup.c (set_namespace_binding_1): An overload of 1 decl
+ 	is a new overload.
+ 
+ 2016-12-08  Nathan Sidwell  <nathan@acm.org>
+ 
+ 	PR c++/78551
+ 	* constexpr.c (extract_string_elt): New.  Broken out of ...
+ 	(cxx_eval_array_reference): ... here.  Call it.
+ 	(cxx_eval_store_expression): Convert init by STRING_CST into
+ 	CONSTRUCTOR, if needed.
+ 
+ 2016-08-05  Nathan Sidwell  <nathan@acm.org>
+ 
+ 	PR c++/68724
+ 	* pt.c (unify): TRAIT_EXPR is an expr.
+ 
+ 2016-07-25  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/71833
+ 	* pt.c (coerce_template_parameter_pack): Fix logic for
+ 	pack index.
+ 
+ 2016-07-21  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/69223
+ 	* semantics.c (apply_deduced_return_type): Call
+ 	complete_type_or_else before building the new RESULT_DECL.
+ 
+ 	PR c++/71630
+ 	* pt.c (instantiate_decl): Fix pattern_defined for namespace scope
+ 	variable templates.
+ 
+ 	PR c++/71913
+ 	* call.c (unsafe_copy_elision_p): It's OK to elide when
+ 	initializing an unknown object.
+ 
+ 2016-07-20  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/71909
+ 	* parser.c (cp_parser_save_member_function_body): Consume
+ 	__transaction_relaxed or __transaction_atomic with optional
+ 	attribute.  Only skip catch with block if try keyword is seen.
+ 
+ 2016-07-19  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-07-18  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/71871
+ 	* typeck.c (build_x_conditional_expr): Revert the 2012-10-25 change.
+ 
+ 2016-07-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-06-14  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/71528
+ 	* decl.c (duplicate_decls): For DECL_INITIALIZED_P non-external
+ 	olddecl vars, preserve their TREE_READONLY bit.
+ 
+ 	PR c++/71516
+ 	* decl.c (complete_vars): Handle gracefully type == error_mark_node.
+ 
+ 2016-06-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/71442
+ 	* pt.c (tsubst_copy): Only set TREE_USED on DECLs.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/cp/call.c gcc-5.5.0/gcc/cp/call.c
*** gcc-5.4.0/gcc/cp/call.c	Fri May 20 19:09:59 2016
--- gcc-5.5.0/gcc/cp/call.c	Fri Jul 22 03:51:07 2016
*************** static bool
*** 7029,7038 ****
  unsafe_copy_elision_p (tree target, tree exp)
  {
    tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
!   if (type == CLASSTYPE_AS_BASE (type))
      return false;
!   if (!is_base_field_ref (target)
!       && resolves_to_fixed_type_p (target, NULL))
      return false;
    tree init = TARGET_EXPR_INITIAL (exp);
    /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR.  */
--- 7029,7039 ----
  unsafe_copy_elision_p (tree target, tree exp)
  {
    tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
!   /* It's safe to elide the copy for a class with no tail padding.  */
!   if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
      return false;
!   /* It's safe to elide the copy if we aren't initializing a base object.  */
!   if (!is_base_field_ref (target))
      return false;
    tree init = TARGET_EXPR_INITIAL (exp);
    /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR.  */
diff -Nrcpad gcc-5.4.0/gcc/cp/class.c gcc-5.5.0/gcc/cp/class.c
*** gcc-5.4.0/gcc/cp/class.c	Wed Mar  2 02:46:19 2016
--- gcc-5.5.0/gcc/cp/class.c	Tue May 30 07:24:56 2017
*************** check_bases (tree t,
*** 1763,1768 ****
--- 1763,1770 ----
        SET_CLASSTYPE_REF_FIELDS_NEED_INIT
  	(t, CLASSTYPE_REF_FIELDS_NEED_INIT (t)
  	 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype));
+       if (TYPE_HAS_MUTABLE_P (basetype))
+ 	CLASSTYPE_HAS_MUTABLE (t) = 1;
  
        /*  A standard-layout class is a class that:
  	  ...
diff -Nrcpad gcc-5.4.0/gcc/cp/constexpr.c gcc-5.5.0/gcc/cp/constexpr.c
*** gcc-5.4.0/gcc/cp/constexpr.c	Wed May 18 15:59:05 2016
--- gcc-5.5.0/gcc/cp/constexpr.c	Mon Sep 18 18:34:10 2017
*************** build_data_member_initialization (tree t
*** 401,407 ****
  	gcc_assert (TREE_TYPE (member) == vtbl_ptr_type_node);
      }
  
!   CONSTRUCTOR_APPEND_ELT (*vec, member, init);
    return true;
  }
  
--- 401,412 ----
  	gcc_assert (TREE_TYPE (member) == vtbl_ptr_type_node);
      }
  
!   /* Value-initialization can produce multiple initializers for the
!      same field; use the last one.  */
!   if (!vec_safe_is_empty (*vec) && (*vec)->last().index == member)
!     (*vec)->last().value = init;
!   else
!     CONSTRUCTOR_APPEND_ELT (*vec, member, init);
    return true;
  }
  
*************** struct constexpr_call_hasher : ggc_hashe
*** 888,893 ****
--- 893,910 ----
    static bool equal (constexpr_call *, constexpr_call *);
  };
  
+ enum constexpr_switch_state {
+   /* Used when processing a switch for the first time by cxx_eval_switch_expr
+      and default: label for that switch has not been seen yet.  */
+   css_default_not_seen,
+   /* Used when processing a switch for the first time by cxx_eval_switch_expr
+      and default: label for that switch has been seen already.  */
+   css_default_seen,
+   /* Used when processing a switch for the second time by
+      cxx_eval_switch_expr, where default: label should match.  */
+   css_default_processing
+ };
+ 
  /* The constexpr expansion context.  CALL is the current function
     expansion, CTOR is the current aggregate initializer, OBJECT is the
     object being initialized by CTOR, either a VAR_DECL or a _REF.  VALUES
*************** struct constexpr_ctx {
*** 907,912 ****
--- 924,931 ----
    tree ctor;
    /* The object we're building the CONSTRUCTOR for.  */
    tree object;
+   /* If inside SWITCH_EXPR.  */
+   constexpr_switch_state *css_state;
    /* Whether we should error on a non-constant expression or fail quietly.  */
    bool quiet;
    /* Whether we are strictly conforming to constant expression rules or
*************** reduced_constant_expression_p (tree t)
*** 1485,1492 ****
        /* And we need to handle PTRMEM_CST wrapped in a CONSTRUCTOR.  */
        tree elt; unsigned HOST_WIDE_INT idx;
        FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t), idx, elt)
! 	if (!reduced_constant_expression_p (elt))
! 	  return false;
        return true;
  
      default:
--- 1504,1516 ----
        /* And we need to handle PTRMEM_CST wrapped in a CONSTRUCTOR.  */
        tree elt; unsigned HOST_WIDE_INT idx;
        FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t), idx, elt)
! 	{
! 	  if (!elt)
! 	    /* We're in the middle of initializing this element.  */
! 	    return false;
! 	  if (!reduced_constant_expression_p (elt))
! 	    return false;
! 	}
        return true;
  
      default:
*************** find_array_ctor_elt (tree ary, tree dind
*** 1829,1834 ****
--- 1853,1879 ----
  }
  
  
+ /* Extract element INDEX consisting of CHARS_PER_ELT chars from
+    STRING_CST STRING.  */
+ 
+ static tree
+ extract_string_elt (tree string, unsigned chars_per_elt, unsigned index)
+ {
+   tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (string)));
+   tree r;
+ 
+   if (chars_per_elt == 1)
+     r = build_int_cst (type, TREE_STRING_POINTER (string)[index]);
+   else
+     {
+       const unsigned char *ptr
+ 	= ((const unsigned char *)TREE_STRING_POINTER (string)
+ 	   + index * chars_per_elt);
+       r = native_interpret_expr (type, ptr, chars_per_elt);
+     }
+   return r;
+ }
+ 
  /* Subroutine of cxx_eval_constant_expression.
     Attempt to reduce a reference to an array slot.  */
  
*************** cxx_eval_array_reference (const constexp
*** 1913,1928 ****
  
    if (TREE_CODE (ary) == CONSTRUCTOR)
      return (*CONSTRUCTOR_ELTS (ary))[i].value;
-   else if (elem_nchars == 1)
-     return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
- 			  TREE_STRING_POINTER (ary)[i]);
    else
!     {
!       tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary)));
!       return native_interpret_expr (type, (const unsigned char *)
! 					  TREE_STRING_POINTER (ary)
! 					  + i * elem_nchars, elem_nchars);
!     }
    /* Don't VERIFY_CONSTANT here.  */
  }
  
--- 1958,1965 ----
  
    if (TREE_CODE (ary) == CONSTRUCTOR)
      return (*CONSTRUCTOR_ELTS (ary))[i].value;
    else
!     return extract_string_elt (ary, elem_nchars, i);
    /* Don't VERIFY_CONSTANT here.  */
  }
  
*************** cxx_eval_indirect_ref (const constexpr_c
*** 2661,2672 ****
  	}
      }
  
!   /* If we're pulling out the value of an empty base, make sure
!      that the whole object is constant and then return an empty
       CONSTRUCTOR.  */
    if (empty_base && !lval)
      {
-       VERIFY_CONSTANT (r);
        r = build_constructor (TREE_TYPE (t), NULL);
        TREE_CONSTANT (r) = true;
      }
--- 2698,2707 ----
  	}
      }
  
!   /* If we're pulling out the value of an empty base, just return an empty
       CONSTRUCTOR.  */
    if (empty_base && !lval)
      {
        r = build_constructor (TREE_TYPE (t), NULL);
        TREE_CONSTANT (r) = true;
      }
*************** cxx_eval_store_expression (const constex
*** 2838,2843 ****
--- 2873,2906 ----
  	  *valp = build_constructor (type, NULL);
  	  CONSTRUCTOR_NO_IMPLICIT_ZERO (*valp) = true;
  	}
+       else if (TREE_CODE (*valp) == STRING_CST)
+ 	{
+ 	  /* An array was initialized with a string constant, and now
+ 	     we're writing into one of its elements.  Explode the
+ 	     single initialization into a set of element
+ 	     initializations.  */
+ 	  gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
+ 
+ 	  tree string = *valp;
+ 	  tree elt_type = TREE_TYPE (type);
+ 	  unsigned chars_per_elt = (TYPE_PRECISION (elt_type)
+ 				    / TYPE_PRECISION (char_type_node));
+ 	  unsigned num_elts = TREE_STRING_LENGTH (string) / chars_per_elt;
+ 	  tree ary_ctor = build_constructor (type, NULL);
+ 
+ 	  vec_safe_reserve (CONSTRUCTOR_ELTS (ary_ctor), num_elts);
+ 	  for (unsigned ix = 0; ix != num_elts; ix++)
+ 	    {
+ 	      constructor_elt elt = 
+ 		{
+ 		  build_int_cst (size_type_node, ix),
+ 		  extract_string_elt (string, chars_per_elt, ix)
+ 		};
+ 	      CONSTRUCTOR_ELTS (ary_ctor)->quick_push (elt);
+ 	    }
+ 	  
+ 	  *valp = ary_ctor;
+ 	}
  
        enum tree_code code = TREE_CODE (type);
        type = refs->pop();
*************** switches (tree *jump_target)
*** 3030,3043 ****
  }
  
  /* Subroutine of cxx_eval_statement_list.  Determine whether the statement
!    at I matches *jump_target.  If we're looking for a case label and we see
!    the default label, copy I into DEFAULT_LABEL.  */
  
  static bool
! label_matches (tree *jump_target, tree_stmt_iterator i,
! 	       tree_stmt_iterator& default_label)
  {
-   tree stmt = tsi_stmt (i);
    switch (TREE_CODE (*jump_target))
      {
      case LABEL_DECL:
--- 3093,3104 ----
  }
  
  /* Subroutine of cxx_eval_statement_list.  Determine whether the statement
!    STMT matches *jump_target.  If we're looking for a case label and we see
!    the default label, note it in ctx->css_state.  */
  
  static bool
! label_matches (const constexpr_ctx *ctx, tree *jump_target, tree stmt)
  {
    switch (TREE_CODE (*jump_target))
      {
      case LABEL_DECL:
*************** label_matches (tree *jump_target, tree_s
*** 3049,3056 ****
      case INTEGER_CST:
        if (TREE_CODE (stmt) == CASE_LABEL_EXPR)
  	{
  	  if (!CASE_LOW (stmt))
! 	    default_label = i;
  	  else if (tree_int_cst_equal (*jump_target, CASE_LOW (stmt)))
  	    return true;
  	}
--- 3110,3133 ----
      case INTEGER_CST:
        if (TREE_CODE (stmt) == CASE_LABEL_EXPR)
  	{
+ 	  gcc_assert (ctx->css_state != NULL);
  	  if (!CASE_LOW (stmt))
! 	    {
! 	      /* default: should appear just once in a SWITCH_EXPR
! 		 body (excluding nested SWITCH_EXPR).  */
! 	      gcc_assert (*ctx->css_state != css_default_seen);
! 	      /* When evaluating SWITCH_EXPR body for the second time,
! 		 return true for the default: label.  */
! 	      if (*ctx->css_state == css_default_processing)
! 		return true;
! 	      *ctx->css_state = css_default_seen;
! 	    }
! 	  else if (CASE_HIGH (stmt))
! 	    {
! 	      if (tree_int_cst_le (CASE_LOW (stmt), *jump_target)
! 		  && tree_int_cst_le (*jump_target, CASE_HIGH (stmt)))
! 		return true;
! 	    }
  	  else if (tree_int_cst_equal (*jump_target, CASE_LOW (stmt)))
  	    return true;
  	}
*************** cxx_eval_statement_list (const constexpr
*** 3071,3077 ****
  			 tree *jump_target)
  {
    tree_stmt_iterator i;
-   tree_stmt_iterator default_label = tree_stmt_iterator();
    tree local_target;
    /* In a statement-expression we want to return the last value.  */
    tree r = NULL_TREE;
--- 3148,3153 ----
*************** cxx_eval_statement_list (const constexpr
*** 3082,3099 ****
      }
    for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
      {
-     reenter:
        tree stmt = tsi_stmt (i);
-       if (*jump_target)
- 	{
- 	  if (TREE_CODE (stmt) == STATEMENT_LIST)
- 	    /* The label we want might be inside.  */;
- 	  else if (label_matches (jump_target, i, default_label))
- 	    /* Found it.  */
- 	    *jump_target = NULL_TREE;
- 	  else
- 	    continue;
- 	}
        r = cxx_eval_constant_expression (ctx, stmt, false,
  					non_constant_p, overflow_p,
  					jump_target);
--- 3158,3164 ----
*************** cxx_eval_statement_list (const constexpr
*** 3102,3113 ****
        if (returns (jump_target) || breaks (jump_target))
  	break;
      }
-   if (switches (jump_target) && !tsi_end_p (default_label))
-     {
-       i = default_label;
-       *jump_target = NULL_TREE;
-       goto reenter;
-     }
    return r;
  }
  
--- 3167,3172 ----
*************** cxx_eval_loop_expr (const constexpr_ctx
*** 3142,3148 ****
        /* Forget saved values of SAVE_EXPRs.  */
        save_exprs.traverse<constexpr_ctx &, save_exprs_remover>(new_ctx);
      }
!   while (!returns (jump_target) && !breaks (jump_target) && !*non_constant_p);
  
    if (breaks (jump_target))
      *jump_target = NULL_TREE;
--- 3201,3210 ----
        /* Forget saved values of SAVE_EXPRs.  */
        save_exprs.traverse<constexpr_ctx &, save_exprs_remover>(new_ctx);
      }
!   while (!returns (jump_target)
! 	 && !breaks (jump_target)
! 	 && !switches (jump_target)
! 	 && !*non_constant_p);
  
    if (breaks (jump_target))
      *jump_target = NULL_TREE;
*************** cxx_eval_switch_expr (const constexpr_ct
*** 3165,3172 ****
    *jump_target = cond;
  
    tree body = TREE_OPERAND (t, 1);
!   cxx_eval_statement_list (ctx, body,
! 			   non_constant_p, overflow_p, jump_target);
    if (breaks (jump_target) || switches (jump_target))
      *jump_target = NULL_TREE;
    return NULL_TREE;
--- 3227,3246 ----
    *jump_target = cond;
  
    tree body = TREE_OPERAND (t, 1);
!   constexpr_ctx new_ctx = *ctx;
!   constexpr_switch_state css = css_default_not_seen;
!   new_ctx.css_state = &css;
!   cxx_eval_constant_expression (&new_ctx, body, false,
! 				non_constant_p, overflow_p, jump_target);
!   if (switches (jump_target) && css == css_default_seen)
!     {
!       /* If the SWITCH_EXPR body has default: label, process it once again,
! 	 this time instructing label_matches to return true for default:
! 	 label on switches (jump_target).  */
!       css = css_default_processing;
!       cxx_eval_constant_expression (&new_ctx, body, false,
! 				    non_constant_p, overflow_p, jump_target);
!     }
    if (breaks (jump_target) || switches (jump_target))
      *jump_target = NULL_TREE;
    return NULL_TREE;
*************** cxx_eval_constant_expression (const cons
*** 3243,3248 ****
--- 3317,3343 ----
    constexpr_ctx new_ctx;
    tree r = t;
  
+   if (jump_target && *jump_target)
+     {
+       /* If we are jumping, ignore all statements/expressions except those
+ 	 that could have LABEL_EXPR or CASE_LABEL_EXPR in their bodies.  */
+       switch (TREE_CODE (t))
+ 	{
+ 	case BIND_EXPR:
+ 	case STATEMENT_LIST:
+ 	case LOOP_EXPR:
+ 	case COND_EXPR:
+ 	  break;
+ 	case LABEL_EXPR:
+ 	case CASE_LABEL_EXPR:
+ 	  if (label_matches (ctx, jump_target, t))
+ 	    /* Found it.  */
+ 	    *jump_target = NULL_TREE;
+ 	  return NULL_TREE;
+ 	default:
+ 	  return NULL_TREE;
+ 	}
+     }
    if (t == error_mark_node)
      {
        *non_constant_p = true;
*************** cxx_eval_constant_expression (const cons
*** 3297,3302 ****
--- 3392,3398 ----
      case LABEL_DECL:
      case LABEL_EXPR:
      case CASE_LABEL_EXPR:
+     case PREDICT_EXPR:
        return t;
  
      case PARM_DECL:
*************** cxx_eval_constant_expression (const cons
*** 3414,3419 ****
--- 3510,3516 ----
  	}
        /* else fall through */
      case MODIFY_EXPR:
+       gcc_assert (jump_target == NULL || *jump_target == NULL_TREE);
        r = cxx_eval_store_expression (ctx, t, lval,
  				     non_constant_p, overflow_p);
        break;
*************** cxx_eval_constant_expression (const cons
*** 3644,3649 ****
--- 3741,3762 ----
        break;
  
      case COND_EXPR:
+       if (jump_target && *jump_target)
+ 	{
+ 	  /* When jumping to a label, the label might be either in the
+ 	     then or else blocks, so process then block first in skipping
+ 	     mode first, and if we are still in the skipping mode at its end,
+ 	     process the else block too.  */
+ 	  r = cxx_eval_constant_expression (ctx, TREE_OPERAND (t, 1),
+ 					    lval, non_constant_p, overflow_p,
+ 					    jump_target);
+ 	  if (*jump_target)
+ 	    r = cxx_eval_constant_expression (ctx, TREE_OPERAND (t, 2),
+ 					      lval, non_constant_p, overflow_p,
+ 					      jump_target);
+ 	  break;
+ 	}
+       /* FALLTHRU */
      case VEC_COND_EXPR:
        r = cxx_eval_conditional_expression (ctx, t, lval,
  					   non_constant_p, overflow_p,
*************** cxx_eval_outermost_constant_expr (tree t
*** 3825,3831 ****
    bool overflow_p = false;
    hash_map<tree,tree> map;
  
!   constexpr_ctx ctx = { NULL, &map, NULL, NULL, NULL,
  			allow_non_constant, strict };
  
    tree type = initialized_type (t);
--- 3938,3944 ----
    bool overflow_p = false;
    hash_map<tree,tree> map;
  
!   constexpr_ctx ctx = { NULL, &map, NULL, NULL, NULL, NULL,
  			allow_non_constant, strict };
  
    tree type = initialized_type (t);
*************** is_sub_constant_expr (tree t)
*** 3936,3942 ****
    bool overflow_p = false;
    hash_map <tree, tree> map;
  
!   constexpr_ctx ctx = { NULL, &map, NULL, NULL, NULL, true, true };
  
    cxx_eval_constant_expression (&ctx, t, false, &non_constant_p,
  				&overflow_p);
--- 4049,4055 ----
    bool overflow_p = false;
    hash_map <tree, tree> map;
  
!   constexpr_ctx ctx = { NULL, &map, NULL, NULL, NULL, NULL, true, true };
  
    cxx_eval_constant_expression (&ctx, t, false, &non_constant_p,
  				&overflow_p);
*************** potential_constant_expression_1 (tree t,
*** 4450,4459 ****
--- 4563,4599 ----
      case DELETE_EXPR:
      case VEC_DELETE_EXPR:
      case THROW_EXPR:
+     case OMP_PARALLEL:
+     case OMP_TASK:
+     case OMP_FOR:
+     case OMP_DISTRIBUTE:
+     case OMP_TEAMS:
+     case OMP_TARGET_DATA:
+     case OMP_TARGET:
+     case OMP_SECTIONS:
+     case OMP_ORDERED:
+     case OMP_CRITICAL:
+     case OMP_SINGLE:
+     case OMP_SECTION:
+     case OMP_MASTER:
+     case OMP_TASKGROUP:
+     case OMP_TARGET_UPDATE:
      case OMP_ATOMIC:
      case OMP_ATOMIC_READ:
      case OMP_ATOMIC_CAPTURE_OLD:
      case OMP_ATOMIC_CAPTURE_NEW:
+     case OACC_PARALLEL:
+     case OACC_KERNELS:
+     case OACC_DATA:
+     case OACC_HOST_DATA:
+     case OACC_LOOP:
+     case OACC_CACHE:
+     case OACC_DECLARE:
+     case OACC_ENTER_DATA:
+     case OACC_EXIT_DATA:
+     case OACC_UPDATE:
+     case CILK_SIMD:
+     case CILK_FOR:
        /* GCC internal stuff.  */
      case VA_ARG_EXPR:
      case OBJ_TYPE_REF:
*************** potential_constant_expression_1 (tree t,
*** 4461,4467 ****
      case ASM_EXPR:
      fail:
        if (flags & tf_error)
!         error ("expression %qE is not a constant-expression", t);
        return false;
  
      case TYPEID_EXPR:
--- 4601,4608 ----
      case ASM_EXPR:
      fail:
        if (flags & tf_error)
! 	error_at (EXPR_LOC_OR_LOC (t, input_location),
! 		  "expression %qE is not a constant-expression", t);
        return false;
  
      case TYPEID_EXPR:
diff -Nrcpad gcc-5.4.0/gcc/cp/cp-gimplify.c gcc-5.5.0/gcc/cp/cp-gimplify.c
*** gcc-5.4.0/gcc/cp/cp-gimplify.c	Thu Jun  4 08:39:01 2015
--- gcc-5.5.0/gcc/cp/cp-gimplify.c	Sat Sep 16 18:33:01 2017
*************** along with GCC; see the file COPYING3.
*** 59,65 ****
  /* Forward declarations.  */
  
  static tree cp_genericize_r (tree *, int *, void *);
! static void cp_genericize_tree (tree*);
  
  /* Local declarations.  */
  
--- 59,65 ----
  /* Forward declarations.  */
  
  static tree cp_genericize_r (tree *, int *, void *);
! static void cp_genericize_tree (tree*, bool);
  
  /* Local declarations.  */
  
*************** cp_gimplify_expr (tree *expr_p, gimple_s
*** 592,598 ****
  				  init, VEC_INIT_EXPR_VALUE_INIT (*expr_p),
  				  from_array,
  				  tf_warning_or_error);
! 	cp_genericize_tree (expr_p);
  	ret = GS_OK;
  	input_location = loc;
        }
--- 592,598 ----
  				  init, VEC_INIT_EXPR_VALUE_INIT (*expr_p),
  				  from_array,
  				  tf_warning_or_error);
! 	cp_genericize_tree (expr_p, false);
  	ret = GS_OK;
  	input_location = loc;
        }
*************** struct cp_genericize_data
*** 906,911 ****
--- 906,912 ----
    vec<tree> bind_expr_stack;
    struct cp_genericize_omp_taskreg *omp_ctx;
    bool no_sanitize_p;
+   bool handle_invisiref_parm_p;
  };
  
  /* Perform any pre-gimplification lowering of C++ front end trees to
*************** cp_genericize_r (tree *stmt_p, int *walk
*** 926,932 ****
        && omp_var_to_track (stmt))
      omp_cxx_notice_variable (wtd->omp_ctx, stmt);
  
!   if (is_invisiref_parm (stmt)
        /* Don't dereference parms in a thunk, pass the references through. */
        && !(DECL_THUNK_P (current_function_decl)
  	   && TREE_CODE (stmt) == PARM_DECL))
--- 927,934 ----
        && omp_var_to_track (stmt))
      omp_cxx_notice_variable (wtd->omp_ctx, stmt);
  
!   if (wtd->handle_invisiref_parm_p
!       && is_invisiref_parm (stmt)
        /* Don't dereference parms in a thunk, pass the references through. */
        && !(DECL_THUNK_P (current_function_decl)
  	   && TREE_CODE (stmt) == PARM_DECL))
*************** cp_genericize_r (tree *stmt_p, int *walk
*** 1279,1285 ****
  /* Lower C++ front end trees to GENERIC in T_P.  */
  
  static void
! cp_genericize_tree (tree* t_p)
  {
    struct cp_genericize_data wtd;
  
--- 1281,1287 ----
  /* Lower C++ front end trees to GENERIC in T_P.  */
  
  static void
! cp_genericize_tree (tree* t_p, bool handle_invisiref_parm_p)
  {
    struct cp_genericize_data wtd;
  
*************** cp_genericize_tree (tree* t_p)
*** 1287,1292 ****
--- 1289,1295 ----
    wtd.bind_expr_stack.create (0);
    wtd.omp_ctx = NULL;
    wtd.no_sanitize_p = false;
+   wtd.handle_invisiref_parm_p = handle_invisiref_parm_p;
    cp_walk_tree (t_p, cp_genericize_r, &wtd, NULL);
    delete wtd.p_set;
    wtd.bind_expr_stack.release ();
*************** cp_ubsan_maybe_instrument_return (tree f
*** 1337,1350 ****
      }
    if (t == NULL_TREE)
      return;
!   t = DECL_SAVED_TREE (fndecl);
!   if (TREE_CODE (t) == BIND_EXPR
!       && TREE_CODE (BIND_EXPR_BODY (t)) == STATEMENT_LIST)
!     {
!       tree_stmt_iterator i = tsi_last (BIND_EXPR_BODY (t));
!       t = ubsan_instrument_return (DECL_SOURCE_LOCATION (fndecl));
!       tsi_link_after (&i, t, TSI_NEW_STMT);
!     }
  }
  
  void
--- 1340,1350 ----
      }
    if (t == NULL_TREE)
      return;
!   tree *p = &DECL_SAVED_TREE (fndecl);
!   if (TREE_CODE (*p) == BIND_EXPR)
!     p = &BIND_EXPR_BODY (*p);
!   t = ubsan_instrument_return (DECL_SOURCE_LOCATION (fndecl));
!   append_to_statement_list (t, p);
  }
  
  void
*************** cp_genericize (tree fndecl)
*** 1384,1390 ****
  
  	  if (outer)
  	    for (var = BLOCK_VARS (outer); var; var = DECL_CHAIN (var))
! 	      if (DECL_NAME (t) == DECL_NAME (var)
  		  && DECL_HAS_VALUE_EXPR_P (var)
  		  && DECL_VALUE_EXPR (var) == t)
  		{
--- 1384,1391 ----
  
  	  if (outer)
  	    for (var = BLOCK_VARS (outer); var; var = DECL_CHAIN (var))
! 	      if (VAR_P (var)
! 		  && DECL_NAME (t) == DECL_NAME (var)
  		  && DECL_HAS_VALUE_EXPR_P (var)
  		  && DECL_VALUE_EXPR (var) == t)
  		{
*************** cp_genericize (tree fndecl)
*** 1402,1413 ****
    /* Expand all the array notations here.  */
    if (flag_cilkplus 
        && contains_array_notation_expr (DECL_SAVED_TREE (fndecl)))
!     DECL_SAVED_TREE (fndecl) = 
!       expand_array_notation_exprs (DECL_SAVED_TREE (fndecl));
  
    /* We do want to see every occurrence of the parms, so we can't just use
       walk_tree's hash functionality.  */
!   cp_genericize_tree (&DECL_SAVED_TREE (fndecl));
  
    if (flag_sanitize & SANITIZE_RETURN
        && do_ubsan_in_current_function ())
--- 1403,1414 ----
    /* Expand all the array notations here.  */
    if (flag_cilkplus 
        && contains_array_notation_expr (DECL_SAVED_TREE (fndecl)))
!     DECL_SAVED_TREE (fndecl)
!       = expand_array_notation_exprs (DECL_SAVED_TREE (fndecl));
  
    /* We do want to see every occurrence of the parms, so we can't just use
       walk_tree's hash functionality.  */
!   cp_genericize_tree (&DECL_SAVED_TREE (fndecl), true);
  
    if (flag_sanitize & SANITIZE_RETURN
        && do_ubsan_in_current_function ())
*************** cxx_omp_const_qual_no_mutable (tree decl
*** 1622,1628 ****
  
  	  if (outer)
  	    for (var = BLOCK_VARS (outer); var; var = DECL_CHAIN (var))
! 	      if (DECL_NAME (decl) == DECL_NAME (var)
  		  && (TYPE_MAIN_VARIANT (type)
  		      == TYPE_MAIN_VARIANT (TREE_TYPE (var))))
  		{
--- 1623,1630 ----
  
  	  if (outer)
  	    for (var = BLOCK_VARS (outer); var; var = DECL_CHAIN (var))
! 	      if (VAR_P (var)
! 		  && DECL_NAME (decl) == DECL_NAME (var)
  		  && (TYPE_MAIN_VARIANT (type)
  		      == TYPE_MAIN_VARIANT (TREE_TYPE (var))))
  		{
diff -Nrcpad gcc-5.4.0/gcc/cp/decl.c gcc-5.5.0/gcc/cp/decl.c
*** gcc-5.4.0/gcc/cp/decl.c	Wed May 18 15:59:13 2016
--- gcc-5.5.0/gcc/cp/decl.c	Mon Sep 18 18:34:03 2017
*************** duplicate_decls (tree newdecl, tree oldd
*** 2023,2028 ****
--- 2023,2036 ----
        if (VAR_P (newdecl))
  	{
  	  DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
+ 	  /* For already initialized vars, TREE_READONLY could have been
+ 	     cleared in cp_finish_decl, because the var needs runtime
+ 	     initialization or destruction.  Make sure not to set
+ 	     TREE_READONLY on it again.  */
+ 	  if (DECL_INITIALIZED_P (olddecl)
+ 	      && !DECL_EXTERNAL (olddecl)
+ 	      && !TREE_READONLY (olddecl))
+ 	    TREE_READONLY (newdecl) = 0;
  	  DECL_INITIALIZED_P (newdecl) |= DECL_INITIALIZED_P (olddecl);
  	  DECL_NONTRIVIALLY_INITIALIZED_P (newdecl)
  	    |= DECL_NONTRIVIALLY_INITIALIZED_P (olddecl);
*************** type_dependent_init_p (tree init)
*** 6341,6346 ****
--- 6349,6357 ----
    else if (TREE_CODE (init) == CONSTRUCTOR)
    /* A brace-enclosed initializer, e.g.: int i = { 3 }; ? */
      {
+       if (dependent_type_p (TREE_TYPE (init)))
+ 	return true;
+ 
        vec<constructor_elt, va_gc> *elts;
        size_t nelts;
        size_t i;
*************** finish_enum_value_list (tree enumtype)
*** 13069,13077 ****
        input_location = saved_location;
  
        /* Do not clobber shared ints.  */
!       value = copy_node (value);
  
!       TREE_TYPE (value) = enumtype;
        DECL_INITIAL (decl) = value;
      }
  
--- 13080,13091 ----
        input_location = saved_location;
  
        /* Do not clobber shared ints.  */
!       if (value != error_mark_node)
! 	{
! 	  value = copy_node (value);
  
! 	  TREE_TYPE (value) = enumtype;
! 	}
        DECL_INITIAL (decl) = value;
      }
  
*************** complete_vars (tree type)
*** 14561,14568 ****
  	  tree var = iv->decl;
  	  tree type = TREE_TYPE (var);
  
! 	  if (TYPE_MAIN_VARIANT (strip_array_types (type))
! 	      == iv->incomplete_type)
  	    {
  	      /* Complete the type of the variable.  The VAR_DECL itself
  		 will be laid out in expand_expr.  */
--- 14575,14583 ----
  	  tree var = iv->decl;
  	  tree type = TREE_TYPE (var);
  
! 	  if (type != error_mark_node
! 	      && (TYPE_MAIN_VARIANT (strip_array_types (type))
! 		  == iv->incomplete_type))
  	    {
  	      /* Complete the type of the variable.  The VAR_DECL itself
  		 will be laid out in expand_expr.  */
diff -Nrcpad gcc-5.4.0/gcc/cp/error.c gcc-5.5.0/gcc/cp/error.c
*** gcc-5.4.0/gcc/cp/error.c	Wed Aug 12 18:05:49 2015
--- gcc-5.5.0/gcc/cp/error.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 44,51 ****
  #include "ubsan.h"
  #include "internal-fn.h"
  
- #include <new>                    // For placement-new.
- 
  #define pp_separate_with_comma(PP) pp_cxx_separate_with (PP, ',')
  #define pp_separate_with_semicolon(PP) pp_cxx_separate_with (PP, ';')
  
--- 44,49 ----
*************** dump_expr (cxx_pretty_printer *pp, tree
*** 2005,2010 ****
--- 2003,2009 ----
        break;
  
      case COND_EXPR:
+     case VEC_COND_EXPR:
        pp_cxx_left_paren (pp);
        dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
        pp_string (pp, " ? ");
diff -Nrcpad gcc-5.4.0/gcc/cp/init.c gcc-5.5.0/gcc/cp/init.c
*** gcc-5.4.0/gcc/cp/init.c	Wed Feb 10 19:36:19 2016
--- gcc-5.5.0/gcc/cp/init.c	Mon Sep 18 18:33:58 2017
*************** expand_aggr_init_1 (tree binfo, tree tru
*** 1810,1815 ****
--- 1810,1828 ----
        return;
      }
  
+   /* List-initialization from {} becomes value-initialization for non-aggregate
+      classes with default constructors.  Handle this here when we're
+      initializing a base, so protected access works.  */
+   if (exp != true_exp && init && TREE_CODE (init) == TREE_LIST)
+     {
+       tree elt = TREE_VALUE (init);
+       if (DIRECT_LIST_INIT_P (elt)
+ 	  && CONSTRUCTOR_ELTS (elt) == 0
+ 	  && CLASSTYPE_NON_AGGREGATE (type)
+ 	  && TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
+ 	init = void_type_node;
+     }
+ 
    /* If an explicit -- but empty -- initializer list was present,
       that's value-initialization.  */
    if (init == void_type_node)
*************** constant_value_1 (tree decl, bool strict
*** 2050,2056 ****
        init = DECL_INITIAL (decl);
        if (init == error_mark_node)
  	{
! 	  if (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))
  	    /* Treat the error as a constant to avoid cascading errors on
  	       excessively recursive template instantiation (c++/9335).  */
  	    return init;
--- 2063,2070 ----
        init = DECL_INITIAL (decl);
        if (init == error_mark_node)
  	{
! 	  if (TREE_CODE (decl) == CONST_DECL
! 	      || DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))
  	    /* Treat the error as a constant to avoid cascading errors on
  	       excessively recursive template instantiation (c++/9335).  */
  	    return init;
diff -Nrcpad gcc-5.4.0/gcc/cp/mangle.c gcc-5.5.0/gcc/cp/mangle.c
*** gcc-5.4.0/gcc/cp/mangle.c	Fri Dec  4 11:44:17 2015
--- gcc-5.5.0/gcc/cp/mangle.c	Tue May 30 07:41:57 2017
*************** mangle_guard_variable (const tree variab
*** 3881,3886 ****
--- 3881,3887 ----
  tree
  mangle_tls_init_fn (const tree variable)
  {
+   check_abi_tags (variable);
    start_mangling (variable);
    write_string ("_ZTH");
    write_guarded_var_name (variable);
*************** mangle_tls_init_fn (const tree variable)
*** 3895,3900 ****
--- 3896,3902 ----
  tree
  mangle_tls_wrapper_fn (const tree variable)
  {
+   check_abi_tags (variable);
    start_mangling (variable);
    write_string (TLS_WRAPPER_PREFIX);
    write_guarded_var_name (variable);
diff -Nrcpad gcc-5.4.0/gcc/cp/name-lookup.c gcc-5.5.0/gcc/cp/name-lookup.c
*** gcc-5.4.0/gcc/cp/name-lookup.c	Wed Apr 22 20:52:57 2015
--- gcc-5.5.0/gcc/cp/name-lookup.c	Thu Jan 12 12:40:28 2017
*************** set_namespace_binding_1 (tree name, tree
*** 3477,3483 ****
    if (scope == NULL_TREE)
      scope = global_namespace;
    b = binding_for_name (NAMESPACE_LEVEL (scope), name);
!   if (!b->value || TREE_CODE (val) == OVERLOAD || val == error_mark_node)
      b->value = val;
    else
      supplement_binding (b, val);
--- 3477,3488 ----
    if (scope == NULL_TREE)
      scope = global_namespace;
    b = binding_for_name (NAMESPACE_LEVEL (scope), name);
!   if (!b->value
!       /* For templates and using we create a single element OVERLOAD.
! 	 Look for the chain to know whether this is really augmenting
! 	 an existing overload.  */
!       || (TREE_CODE (val) == OVERLOAD && OVL_CHAIN (val))
!       || val == error_mark_node)
      b->value = val;
    else
      supplement_binding (b, val);
diff -Nrcpad gcc-5.4.0/gcc/cp/parser.c gcc-5.5.0/gcc/cp/parser.c
*** gcc-5.4.0/gcc/cp/parser.c	Wed Mar 30 12:31:21 2016
--- gcc-5.5.0/gcc/cp/parser.c	Tue May 30 08:04:55 2017
*************** cp_parser_postfix_expression (cp_parser
*** 5894,5900 ****
  	   can be used in constant-expressions.  */
  	if (!cast_valid_in_integral_constant_expression_p (type)
  	    && cp_parser_non_integral_constant_expression (parser, NIC_CAST))
! 	  return error_mark_node;
  
  	switch (keyword)
  	  {
--- 5894,5903 ----
  	   can be used in constant-expressions.  */
  	if (!cast_valid_in_integral_constant_expression_p (type)
  	    && cp_parser_non_integral_constant_expression (parser, NIC_CAST))
! 	  {
! 	    postfix_expression = error_mark_node;
! 	    break;
! 	  }
  
  	switch (keyword)
  	  {
*************** cp_parser_postfix_expression (cp_parser
*** 5966,5972 ****
  	parser->type_definition_forbidden_message = saved_message;
  	/* `typeid' may not appear in an integral constant expression.  */
  	if (cp_parser_non_integral_constant_expression (parser, NIC_TYPEID))
! 	  return error_mark_node;
        }
        break;
  
--- 5969,5975 ----
  	parser->type_definition_forbidden_message = saved_message;
  	/* `typeid' may not appear in an integral constant expression.  */
  	if (cp_parser_non_integral_constant_expression (parser, NIC_TYPEID))
! 	  postfix_expression = error_mark_node;
        }
        break;
  
*************** cp_parser_postfix_expression (cp_parser
*** 6045,6067 ****
  		    /*cast_p=*/false, /*allow_expansion_p=*/true,
  		    /*non_constant_p=*/NULL);
  	if (vec == NULL)
! 	  return error_mark_node;
  
  	FOR_EACH_VEC_ELT (*vec, i, p)
  	  mark_exp_read (p);
  
  	if (vec->length () == 2)
! 	  return build_x_vec_perm_expr (loc, (*vec)[0], NULL_TREE, (*vec)[1],
! 					 tf_warning_or_error);
  	else if (vec->length () == 3)
! 	  return build_x_vec_perm_expr (loc, (*vec)[0], (*vec)[1], (*vec)[2],
! 					 tf_warning_or_error);
  	else
! 	{
! 	  error_at (loc, "wrong number of arguments to "
! 	      "%<__builtin_shuffle%>");
! 	  return error_mark_node;
! 	}
  	break;
        }
  
--- 6048,6075 ----
  		    /*cast_p=*/false, /*allow_expansion_p=*/true,
  		    /*non_constant_p=*/NULL);
  	if (vec == NULL)
! 	  {
! 	    postfix_expression = error_mark_node;
! 	    break;
! 	  }
  
  	FOR_EACH_VEC_ELT (*vec, i, p)
  	  mark_exp_read (p);
  
  	if (vec->length () == 2)
! 	  postfix_expression
! 	    = build_x_vec_perm_expr (loc, (*vec)[0], NULL_TREE, (*vec)[1],
! 				     tf_warning_or_error);
  	else if (vec->length () == 3)
! 	  postfix_expression
! 	    = build_x_vec_perm_expr (loc, (*vec)[0], (*vec)[1], (*vec)[2],
! 				     tf_warning_or_error);
  	else
! 	  {
! 	    error_at (loc, "wrong number of arguments to "
! 			   "%<__builtin_shuffle%>");
! 	    postfix_expression = error_mark_node;
! 	  }
  	break;
        }
  
*************** cp_parser_std_attribute_list (cp_parser
*** 22528,22535 ****
        if (token->type == CPP_ELLIPSIS)
  	{
  	  cp_lexer_consume_token (parser->lexer);
! 	  TREE_VALUE (attribute)
! 	    = make_pack_expansion (TREE_VALUE (attribute));
  	  token = cp_lexer_peek_token (parser->lexer);
  	}
        if (token->type != CPP_COMMA)
--- 22536,22547 ----
        if (token->type == CPP_ELLIPSIS)
  	{
  	  cp_lexer_consume_token (parser->lexer);
! 	  if (attribute == NULL_TREE)
! 	    error_at (token->location,
! 		      "expected attribute before %<...%>");
! 	  else
! 	    TREE_VALUE (attribute)
! 	      = make_pack_expansion (TREE_VALUE (attribute));
  	  token = cp_lexer_peek_token (parser->lexer);
  	}
        if (token->type != CPP_COMMA)
*************** cp_parser_std_attribute_spec (cp_parser
*** 22598,22608 ****
  
        if (!cp_parser_parse_definitely (parser))
  	{
! 	  gcc_assert (alignas_expr == error_mark_node
! 		      || alignas_expr == NULL_TREE);
! 
! 	  alignas_expr =
! 	    cp_parser_assignment_expression (parser);
  	  if (alignas_expr == error_mark_node)
  	    cp_parser_skip_to_end_of_statement (parser);
  	  if (alignas_expr == NULL_TREE
--- 22610,22616 ----
  
        if (!cp_parser_parse_definitely (parser))
  	{
! 	  alignas_expr = cp_parser_assignment_expression (parser);
  	  if (alignas_expr == error_mark_node)
  	    cp_parser_skip_to_end_of_statement (parser);
  	  if (alignas_expr == NULL_TREE
*************** cp_parser_save_member_function_body (cp_
*** 23964,23969 ****
--- 23972,23978 ----
    cp_token *first;
    cp_token *last;
    tree fn;
+   bool function_try_block = false;
  
    /* Create the FUNCTION_DECL.  */
    fn = grokmethod (decl_specifiers, declarator, attributes);
*************** cp_parser_save_member_function_body (cp_
*** 23984,23992 ****
    /* Save away the tokens that make up the body of the
       function.  */
    first = parser->lexer->next_token;
    /* Handle function try blocks.  */
    if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
!     cp_lexer_consume_token (parser->lexer);
    /* We can have braced-init-list mem-initializers before the fn body.  */
    if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
      {
--- 23993,24035 ----
    /* Save away the tokens that make up the body of the
       function.  */
    first = parser->lexer->next_token;
+ 
+   if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRANSACTION_RELAXED))
+     cp_lexer_consume_token (parser->lexer);
+   else if (cp_lexer_next_token_is_keyword (parser->lexer,
+ 					   RID_TRANSACTION_ATOMIC))
+     {
+       cp_lexer_consume_token (parser->lexer);
+       /* Match cp_parser_txn_attribute_opt [[ identifier ]].  */
+       if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE)
+ 	  && cp_lexer_nth_token_is (parser->lexer, 2, CPP_OPEN_SQUARE)
+ 	  && (cp_lexer_nth_token_is (parser->lexer, 3, CPP_NAME)
+ 	      || cp_lexer_nth_token_is (parser->lexer, 3, CPP_KEYWORD))
+ 	  && cp_lexer_nth_token_is (parser->lexer, 4, CPP_CLOSE_SQUARE)
+ 	  && cp_lexer_nth_token_is (parser->lexer, 5, CPP_CLOSE_SQUARE))
+ 	{
+ 	  cp_lexer_consume_token (parser->lexer);
+ 	  cp_lexer_consume_token (parser->lexer);
+ 	  cp_lexer_consume_token (parser->lexer);
+ 	  cp_lexer_consume_token (parser->lexer);
+ 	  cp_lexer_consume_token (parser->lexer);
+ 	}
+       else
+ 	while (cp_next_tokens_can_be_gnu_attribute_p (parser)
+ 	       && cp_lexer_nth_token_is (parser->lexer, 2, CPP_OPEN_PAREN))
+ 	  {
+ 	    cp_lexer_consume_token (parser->lexer);
+ 	    if (cp_parser_cache_group (parser, CPP_CLOSE_PAREN, /*depth=*/0))
+ 	      break;
+ 	  }
+     }
+ 
    /* Handle function try blocks.  */
    if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
!     {
!       cp_lexer_consume_token (parser->lexer);
!       function_try_block = true;
!     }
    /* We can have braced-init-list mem-initializers before the fn body.  */
    if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
      {
*************** cp_parser_save_member_function_body (cp_
*** 24004,24011 ****
      }
    cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
    /* Handle function try blocks.  */
!   while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
!     cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
    last = parser->lexer->next_token;
  
    /* Save away the inline definition; we will process it when the
--- 24047,24055 ----
      }
    cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
    /* Handle function try blocks.  */
!   if (function_try_block)
!     while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
!       cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
    last = parser->lexer->next_token;
  
    /* Save away the inline definition; we will process it when the
*************** cp_parser_omp_teams (cp_parser *parser,
*** 31356,31361 ****
--- 31400,31406 ----
  	  OMP_TEAMS_CLAUSES (ret) = clauses;
  	  OMP_TEAMS_BODY (ret) = body;
  	  OMP_TEAMS_COMBINED (ret) = 1;
+ 	  SET_EXPR_LOCATION (ret, loc);
  	  return add_stmt (ret);
  	}
      }
*************** cp_parser_omp_teams (cp_parser *parser,
*** 31377,31382 ****
--- 31422,31428 ----
    TREE_TYPE (stmt) = void_type_node;
    OMP_TEAMS_CLAUSES (stmt) = clauses;
    OMP_TEAMS_BODY (stmt) = cp_parser_omp_structured_block (parser);
+   SET_EXPR_LOCATION (stmt, loc);
  
    return add_stmt (stmt);
  }
*************** cp_parser_omp_target (cp_parser *parser,
*** 31501,31506 ****
--- 31547,31553 ----
  	  TREE_TYPE (stmt) = void_type_node;
  	  OMP_TARGET_CLAUSES (stmt) = cclauses[C_OMP_CLAUSE_SPLIT_TARGET];
  	  OMP_TARGET_BODY (stmt) = body;
+ 	  SET_EXPR_LOCATION (stmt, pragma_tok->location);
  	  add_stmt (stmt);
  	  return true;
  	}
*************** cp_parser_omp_target (cp_parser *parser,
*** 31522,31527 ****
--- 31569,31579 ----
  	}
      }
  
+   if (!flag_openmp)  /* flag_openmp_simd  */
+     {
+       cp_parser_skip_to_pragma_eol (parser, pragma_tok);
+       return false;
+     }
    tree stmt = make_node (OMP_TARGET);
    TREE_TYPE (stmt) = void_type_node;
  
diff -Nrcpad gcc-5.4.0/gcc/cp/pt.c gcc-5.5.0/gcc/cp/pt.c
*** gcc-5.4.0/gcc/cp/pt.c	Wed May 18 15:59:19 2016
--- gcc-5.5.0/gcc/cp/pt.c	Tue May 30 07:46:27 2017
*************** coerce_template_parameter_pack (tree par
*** 6912,6922 ****
  
    /* Convert the remaining arguments, which will be a part of the
       parameter pack "parm".  */
    for (; arg_idx < nargs; ++arg_idx)
      {
        tree arg = TREE_VEC_ELT (inner_args, arg_idx);
        tree actual_parm = TREE_VALUE (parm);
!       int pack_idx = arg_idx - parm_idx;
  
        if (packed_parms)
          {
--- 6912,6923 ----
  
    /* Convert the remaining arguments, which will be a part of the
       parameter pack "parm".  */
+   int first_pack_arg = arg_idx;
    for (; arg_idx < nargs; ++arg_idx)
      {
        tree arg = TREE_VEC_ELT (inner_args, arg_idx);
        tree actual_parm = TREE_VALUE (parm);
!       int pack_idx = arg_idx - first_pack_arg;
  
        if (packed_parms)
          {
*************** coerce_template_parameter_pack (tree par
*** 6945,6956 ****
        TREE_VEC_ELT (packed_args, pack_idx) = arg;
      }
  
!   if (arg_idx - parm_idx < TREE_VEC_LENGTH (packed_args)
        && TREE_VEC_LENGTH (packed_args) > 0)
      {
        if (complain & tf_error)
  	error ("wrong number of template arguments (%d, should be %d)",
! 	       arg_idx - parm_idx, TREE_VEC_LENGTH (packed_args));
        return error_mark_node;
      }
  
--- 6946,6957 ----
        TREE_VEC_ELT (packed_args, pack_idx) = arg;
      }
  
!   if (arg_idx - first_pack_arg < TREE_VEC_LENGTH (packed_args)
        && TREE_VEC_LENGTH (packed_args) > 0)
      {
        if (complain & tf_error)
  	error ("wrong number of template arguments (%d, should be %d)",
! 	       arg_idx - first_pack_arg, TREE_VEC_LENGTH (packed_args));
        return error_mark_node;
      }
  
*************** tsubst_init (tree init, tree decl, tree
*** 12987,12993 ****
  
    init = tsubst_expr (init, args, complain, in_decl, false);
  
!   if (!init)
      {
        /* If we had an initializer but it
  	 instantiated to nothing,
--- 12988,12994 ----
  
    init = tsubst_expr (init, args, complain, in_decl, false);
  
!   if (!init && TREE_TYPE (decl) != error_mark_node)
      {
        /* If we had an initializer but it
  	 instantiated to nothing,
*************** tsubst_copy (tree t, tree args, tsubst_f
*** 13287,13293 ****
  	      len = TREE_VEC_LENGTH (expanded);
  	      /* Set TREE_USED for the benefit of -Wunused.  */
  	      for (int i = 0; i < len; i++)
! 		TREE_USED (TREE_VEC_ELT (expanded, i)) = true;
  	    }
  
  	  if (expanded == error_mark_node)
--- 13288,13295 ----
  	      len = TREE_VEC_LENGTH (expanded);
  	      /* Set TREE_USED for the benefit of -Wunused.  */
  	      for (int i = 0; i < len; i++)
! 		if (DECL_P (TREE_VEC_ELT (expanded, i)))
! 		  TREE_USED (TREE_VEC_ELT (expanded, i)) = true;
  	    }
  
  	  if (expanded == error_mark_node)
*************** unify (tree tparms, tree targs, tree par
*** 18805,18811 ****
        /* An unresolved overload is a nondeduced context.  */
        if (is_overloaded_fn (parm) || type_unknown_p (parm))
  	return unify_success (explain_p);
!       gcc_assert (EXPR_P (parm));
  
        /* We must be looking at an expression.  This can happen with
  	 something like:
--- 18807,18813 ----
        /* An unresolved overload is a nondeduced context.  */
        if (is_overloaded_fn (parm) || type_unknown_p (parm))
  	return unify_success (explain_p);
!       gcc_assert (EXPR_P (parm) || TREE_CODE (parm) == TRAIT_EXPR);
  
        /* We must be looking at an expression.  This can happen with
  	 something like:
*************** instantiate_decl (tree d, int defer_ok,
*** 20409,20415 ****
    else
      {
        deleted_p = false;
!       pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
      }
  
    /* We may be in the middle of deferred access check.  Disable it now.  */
--- 20411,20420 ----
    else
      {
        deleted_p = false;
!       if (DECL_CLASS_SCOPE_P (code_pattern))
! 	pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
!       else
! 	pattern_defined = ! DECL_EXTERNAL (code_pattern);
      }
  
    /* We may be in the middle of deferred access check.  Disable it now.  */
diff -Nrcpad gcc-5.4.0/gcc/cp/semantics.c gcc-5.5.0/gcc/cp/semantics.c
*** gcc-5.4.0/gcc/cp/semantics.c	Wed Mar  2 02:46:19 2016
--- gcc-5.5.0/gcc/cp/semantics.c	Sat Sep 16 18:31:58 2017
*************** handle_omp_array_sections_1 (tree c, tre
*** 4297,4303 ****
  	return error_mark_node;
        if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
  	{
! 	  if (processing_template_decl)
  	    return NULL_TREE;
  	  if (DECL_P (t))
  	    error_at (OMP_CLAUSE_LOCATION (c),
--- 4297,4303 ----
  	return error_mark_node;
        if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
  	{
! 	  if (processing_template_decl && TREE_CODE (t) != OVERLOAD)
  	    return NULL_TREE;
  	  if (DECL_P (t))
  	    error_at (OMP_CLAUSE_LOCATION (c),
*************** handle_omp_array_sections_1 (tree c, tre
*** 4410,4418 ****
  	  && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))
  			== INTEGER_CST)
  	{
! 	  tree size = size_binop (PLUS_EXPR,
! 				  TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
! 				  size_one_node);
  	  if (TREE_CODE (low_bound) == INTEGER_CST)
  	    {
  	      if (tree_int_cst_lt (size, low_bound))
--- 4410,4418 ----
  	  && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))
  			== INTEGER_CST)
  	{
! 	  tree size
! 	    = fold_convert (sizetype, TYPE_MAX_VALUE (TYPE_DOMAIN (type)));
! 	  size = size_binop (PLUS_EXPR, size, size_one_node);
  	  if (TREE_CODE (low_bound) == INTEGER_CST)
  	    {
  	      if (tree_int_cst_lt (size, low_bound))
*************** finish_omp_clauses (tree clauses)
*** 5392,5398 ****
  	  t = OMP_CLAUSE_DECL (c);
  	  if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in clause %qs", t,
--- 5392,5398 ----
  	  t = OMP_CLAUSE_DECL (c);
  	  if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl && TREE_CODE (t) != OVERLOAD)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in clause %qs", t,
*************** finish_omp_clauses (tree clauses)
*** 5417,5423 ****
  	  t = OMP_CLAUSE_DECL (c);
  	  if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in clause %<firstprivate%>", t);
--- 5417,5423 ----
  	  t = OMP_CLAUSE_DECL (c);
  	  if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl && TREE_CODE (t) != OVERLOAD)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in clause %<firstprivate%>", t);
*************** finish_omp_clauses (tree clauses)
*** 5439,5445 ****
  	  t = OMP_CLAUSE_DECL (c);
  	  if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in clause %<lastprivate%>", t);
--- 5439,5445 ----
  	  t = OMP_CLAUSE_DECL (c);
  	  if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl && TREE_CODE (t) != OVERLOAD)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in clause %<lastprivate%>", t);
*************** finish_omp_clauses (tree clauses)
*** 5546,5554 ****
  	  else
  	    {
  	      t = mark_rvalue_use (t);
- 	      t = maybe_constant_value (t);
  	      if (!processing_template_decl)
  		{
  		  if (TREE_CODE (t) != INTEGER_CST
  		      || tree_int_cst_sgn (t) != 1)
  		    {
--- 5546,5554 ----
  	  else
  	    {
  	      t = mark_rvalue_use (t);
  	      if (!processing_template_decl)
  		{
+ 		  t = maybe_constant_value (t);
  		  if (TREE_CODE (t) != INTEGER_CST
  		      || tree_int_cst_sgn (t) != 1)
  		    {
*************** finish_omp_clauses (tree clauses)
*** 5683,5689 ****
  	  t = OMP_CLAUSE_DECL (c);
  	  if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in %<aligned%> clause", t);
--- 5683,5689 ----
  	  t = OMP_CLAUSE_DECL (c);
  	  if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl && TREE_CODE (t) != OVERLOAD)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in %<aligned%> clause", t);
*************** finish_omp_clauses (tree clauses)
*** 5726,5734 ****
  	  else
  	    {
  	      t = mark_rvalue_use (t);
- 	      t = maybe_constant_value (t);
  	      if (!processing_template_decl)
  		{
  		  if (TREE_CODE (t) != INTEGER_CST
  		      || tree_int_cst_sgn (t) != 1)
  		    {
--- 5726,5734 ----
  	  else
  	    {
  	      t = mark_rvalue_use (t);
  	      if (!processing_template_decl)
  		{
+ 		  t = maybe_constant_value (t);
  		  if (TREE_CODE (t) != INTEGER_CST
  		      || tree_int_cst_sgn (t) != 1)
  		    {
*************** finish_omp_clauses (tree clauses)
*** 5753,5759 ****
  	    remove = true;
  	  else if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in %<depend%> clause", t);
--- 5753,5759 ----
  	    remove = true;
  	  else if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl && TREE_CODE (t) != OVERLOAD)
  		break;
  	      if (DECL_P (t))
  		error ("%qD is not a variable in %<depend%> clause", t);
*************** finish_omp_clauses (tree clauses)
*** 5795,5801 ****
  	    remove = true;
  	  else if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl)
  		break;
  	      if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP
  		  && OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_POINTER)
--- 5795,5801 ----
  	    remove = true;
  	  else if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
  	    {
! 	      if (processing_template_decl && TREE_CODE (t) != OVERLOAD)
  		break;
  	      if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP
  		  && OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_POINTER)
*************** apply_deduced_return_type (tree fco, tre
*** 7698,7703 ****
--- 7698,7707 ----
    if (TREE_TYPE (result) == return_type)
      return;
  
+   if (!processing_template_decl && !VOID_TYPE_P (return_type)
+       && !complete_type_or_else (return_type, NULL_TREE))
+     return;
+ 
    /* We already have a DECL_RESULT from start_preparsed_function.
       Now we need to redo the work it and allocate_struct_function
       did to reflect the new type.  */
*************** apply_deduced_return_type (tree fco, tre
*** 7713,7720 ****
  
    if (!processing_template_decl)
      {
-       if (!VOID_TYPE_P (TREE_TYPE (result)))
- 	complete_type_or_else (TREE_TYPE (result), NULL_TREE);
        bool aggr = aggregate_value_p (result, fco);
  #ifdef PCC_STATIC_STRUCT_RETURN
        cfun->returns_pcc_struct = aggr;
--- 7717,7722 ----
diff -Nrcpad gcc-5.4.0/gcc/cp/tree.c gcc-5.5.0/gcc/cp/tree.c
*** gcc-5.4.0/gcc/cp/tree.c	Mon Mar 21 12:09:48 2016
--- gcc-5.5.0/gcc/cp/tree.c	Tue May 30 08:24:21 2017
*************** lvalue_kind (const_tree ref)
*** 129,134 ****
--- 129,145 ----
        return op1_lvalue_kind;
  
      case COMPONENT_REF:
+       if (BASELINK_P (TREE_OPERAND (ref, 1)))
+ 	{
+ 	  tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (ref, 1));
+ 
+ 	  /* For static member function recurse on the BASELINK, we can get
+ 	     here e.g. from reference_binding.  If BASELINK_FUNCTIONS is
+ 	     OVERLOAD, the overload is resolved first if possible through
+ 	     resolve_address_of_overloaded_function.  */
+ 	  if (TREE_CODE (fn) == FUNCTION_DECL && DECL_STATIC_FUNCTION_P (fn))
+ 	    return lvalue_kind (TREE_OPERAND (ref, 1));
+ 	}
        op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 0));
        /* Look at the member designator.  */
        if (!op1_lvalue_kind)
diff -Nrcpad gcc-5.4.0/gcc/cp/typeck.c gcc-5.5.0/gcc/cp/typeck.c
*** gcc-5.4.0/gcc/cp/typeck.c	Wed Apr  6 07:45:34 2016
--- gcc-5.5.0/gcc/cp/typeck.c	Tue May 30 07:53:35 2017
*************** cp_build_unary_op (enum tree_code code,
*** 5700,5705 ****
--- 5700,5707 ----
  	errstring = _("wrong type argument to bit-complement");
        else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
  	arg = cp_perform_integral_promotions (arg, complain);
+       else if (!noconvert && VECTOR_TYPE_P (TREE_TYPE (arg)))
+ 	arg = mark_rvalue_use (arg);
        break;
  
      case ABS_EXPR:
*************** build_x_conditional_expr (location_t loc
*** 6125,6132 ****
      }
  
    expr = build_conditional_expr (loc, ifexp, op1, op2, complain);
!   if (processing_template_decl && expr != error_mark_node
!       && TREE_CODE (expr) != VEC_COND_EXPR)
      {
        tree min = build_min_non_dep (COND_EXPR, expr,
  				    orig_ifexp, orig_op1, orig_op2);
--- 6127,6133 ----
      }
  
    expr = build_conditional_expr (loc, ifexp, op1, op2, complain);
!   if (processing_template_decl && expr != error_mark_node)
      {
        tree min = build_min_non_dep (COND_EXPR, expr,
  				    orig_ifexp, orig_op1, orig_op2);
diff -Nrcpad gcc-5.4.0/gcc/cselib.c gcc-5.5.0/gcc/cselib.c
*** gcc-5.4.0/gcc/cselib.c	Fri Jan  9 20:18:42 2015
--- gcc-5.5.0/gcc/cselib.c	Tue May 30 08:22:41 2017
*************** static void unchain_one_value (cselib_va
*** 71,77 ****
  static void unchain_one_elt_list (struct elt_list **);
  static void unchain_one_elt_loc_list (struct elt_loc_list **);
  static void remove_useless_values (void);
! static int rtx_equal_for_cselib_1 (rtx, rtx, machine_mode);
  static unsigned int cselib_hash_rtx (rtx, int, machine_mode);
  static cselib_val *new_cselib_val (unsigned int, machine_mode, rtx);
  static void add_mem_for_addr (cselib_val *, cselib_val *, rtx);
--- 71,77 ----
  static void unchain_one_elt_list (struct elt_list **);
  static void unchain_one_elt_loc_list (struct elt_loc_list **);
  static void remove_useless_values (void);
! static int rtx_equal_for_cselib_1 (rtx, rtx, machine_mode, int);
  static unsigned int cselib_hash_rtx (rtx, int, machine_mode);
  static cselib_val *new_cselib_val (unsigned int, machine_mode, rtx);
  static void add_mem_for_addr (cselib_val *, cselib_val *, rtx);
*************** cselib_hasher::equal (const value_type *
*** 147,153 ****
    /* We don't guarantee that distinct rtx's have different hash values,
       so we need to do a comparison.  */
    for (l = v->locs; l; l = l->next)
!     if (rtx_equal_for_cselib_1 (l->loc, x, memmode))
        {
  	promote_debug_loc (l);
  	return true;
--- 147,153 ----
    /* We don't guarantee that distinct rtx's have different hash values,
       so we need to do a comparison.  */
    for (l = v->locs; l; l = l->next)
!     if (rtx_equal_for_cselib_1 (l->loc, x, memmode, 0))
        {
  	promote_debug_loc (l);
  	return true;
*************** cselib_reg_set_mode (const_rtx x)
*** 812,818 ****
  int
  rtx_equal_for_cselib_p (rtx x, rtx y)
  {
!   return rtx_equal_for_cselib_1 (x, y, VOIDmode);
  }
  
  /* If x is a PLUS or an autoinc operation, expand the operation,
--- 812,818 ----
  int
  rtx_equal_for_cselib_p (rtx x, rtx y)
  {
!   return rtx_equal_for_cselib_1 (x, y, VOIDmode, 0);
  }
  
  /* If x is a PLUS or an autoinc operation, expand the operation,
*************** autoinc_split (rtx x, rtx *off, machine_
*** 862,868 ****
     addresses, MEMMODE should be VOIDmode.  */
  
  static int
! rtx_equal_for_cselib_1 (rtx x, rtx y, machine_mode memmode)
  {
    enum rtx_code code;
    const char *fmt;
--- 862,868 ----
     addresses, MEMMODE should be VOIDmode.  */
  
  static int
! rtx_equal_for_cselib_1 (rtx x, rtx y, machine_mode memmode, int depth)
  {
    enum rtx_code code;
    const char *fmt;
*************** rtx_equal_for_cselib_1 (rtx x, rtx y, ma
*** 895,900 ****
--- 895,903 ----
        if (GET_CODE (y) == VALUE)
  	return e == canonical_cselib_val (CSELIB_VAL_PTR (y));
  
+       if (depth == 128)
+ 	return 0;
+ 
        for (l = e->locs; l; l = l->next)
  	{
  	  rtx t = l->loc;
*************** rtx_equal_for_cselib_1 (rtx x, rtx y, ma
*** 904,910 ****
  	     list.  */
  	  if (REG_P (t) || MEM_P (t) || GET_CODE (t) == VALUE)
  	    continue;
! 	  else if (rtx_equal_for_cselib_1 (t, y, memmode))
  	    return 1;
  	}
  
--- 907,913 ----
  	     list.  */
  	  if (REG_P (t) || MEM_P (t) || GET_CODE (t) == VALUE)
  	    continue;
! 	  else if (rtx_equal_for_cselib_1 (t, y, memmode, depth + 1))
  	    return 1;
  	}
  
*************** rtx_equal_for_cselib_1 (rtx x, rtx y, ma
*** 915,927 ****
        cselib_val *e = canonical_cselib_val (CSELIB_VAL_PTR (y));
        struct elt_loc_list *l;
  
        for (l = e->locs; l; l = l->next)
  	{
  	  rtx t = l->loc;
  
  	  if (REG_P (t) || MEM_P (t) || GET_CODE (t) == VALUE)
  	    continue;
! 	  else if (rtx_equal_for_cselib_1 (x, t, memmode))
  	    return 1;
  	}
  
--- 918,933 ----
        cselib_val *e = canonical_cselib_val (CSELIB_VAL_PTR (y));
        struct elt_loc_list *l;
  
+       if (depth == 128)
+ 	return 0;
+ 
        for (l = e->locs; l; l = l->next)
  	{
  	  rtx t = l->loc;
  
  	  if (REG_P (t) || MEM_P (t) || GET_CODE (t) == VALUE)
  	    continue;
! 	  else if (rtx_equal_for_cselib_1 (x, t, memmode, depth + 1))
  	    return 1;
  	}
  
*************** rtx_equal_for_cselib_1 (rtx x, rtx y, ma
*** 942,953 ****
        if (!xoff != !yoff)
  	return 0;
  
!       if (xoff && !rtx_equal_for_cselib_1 (xoff, yoff, memmode))
  	return 0;
  
        /* Don't recurse if nothing changed.  */
        if (x != xorig || y != yorig)
! 	return rtx_equal_for_cselib_1 (x, y, memmode);
  
        return 0;
      }
--- 948,959 ----
        if (!xoff != !yoff)
  	return 0;
  
!       if (xoff && !rtx_equal_for_cselib_1 (xoff, yoff, memmode, depth))
  	return 0;
  
        /* Don't recurse if nothing changed.  */
        if (x != xorig || y != yorig)
! 	return rtx_equal_for_cselib_1 (x, y, memmode, depth);
  
        return 0;
      }
*************** rtx_equal_for_cselib_1 (rtx x, rtx y, ma
*** 978,984 ****
      case MEM:
        /* We have to compare any autoinc operations in the addresses
  	 using this MEM's mode.  */
!       return rtx_equal_for_cselib_1 (XEXP (x, 0), XEXP (y, 0), GET_MODE (x));
  
      default:
        break;
--- 984,991 ----
      case MEM:
        /* We have to compare any autoinc operations in the addresses
  	 using this MEM's mode.  */
!       return rtx_equal_for_cselib_1 (XEXP (x, 0), XEXP (y, 0), GET_MODE (x),
! 				     depth);
  
      default:
        break;
*************** rtx_equal_for_cselib_1 (rtx x, rtx y, ma
*** 1013,1029 ****
  	  /* And the corresponding elements must match.  */
  	  for (j = 0; j < XVECLEN (x, i); j++)
  	    if (! rtx_equal_for_cselib_1 (XVECEXP (x, i, j),
! 					  XVECEXP (y, i, j), memmode))
  	      return 0;
  	  break;
  
  	case 'e':
  	  if (i == 1
  	      && targetm.commutative_p (x, UNKNOWN)
! 	      && rtx_equal_for_cselib_1 (XEXP (x, 1), XEXP (y, 0), memmode)
! 	      && rtx_equal_for_cselib_1 (XEXP (x, 0), XEXP (y, 1), memmode))
  	    return 1;
! 	  if (! rtx_equal_for_cselib_1 (XEXP (x, i), XEXP (y, i), memmode))
  	    return 0;
  	  break;
  
--- 1020,1039 ----
  	  /* And the corresponding elements must match.  */
  	  for (j = 0; j < XVECLEN (x, i); j++)
  	    if (! rtx_equal_for_cselib_1 (XVECEXP (x, i, j),
! 					  XVECEXP (y, i, j), memmode, depth))
  	      return 0;
  	  break;
  
  	case 'e':
  	  if (i == 1
  	      && targetm.commutative_p (x, UNKNOWN)
! 	      && rtx_equal_for_cselib_1 (XEXP (x, 1), XEXP (y, 0), memmode,
! 					 depth)
! 	      && rtx_equal_for_cselib_1 (XEXP (x, 0), XEXP (y, 1), memmode,
! 					 depth))
  	    return 1;
! 	  if (! rtx_equal_for_cselib_1 (XEXP (x, i), XEXP (y, i), memmode,
! 					depth))
  	    return 0;
  	  break;
  
diff -Nrcpad gcc-5.4.0/gcc/data-streamer-in.c gcc-5.5.0/gcc/data-streamer-in.c
*** gcc-5.4.0/gcc/data-streamer-in.c	Thu Feb 26 12:26:11 2015
--- gcc-5.5.0/gcc/data-streamer-in.c	Wed Mar 22 14:59:44 2017
*************** gcov_type
*** 206,211 ****
  streamer_read_gcov_count (struct lto_input_block *ib)
  {
    gcov_type ret = streamer_read_hwi (ib);
-   gcc_assert (ret >= 0);
    return ret;
  }
--- 206,210 ----
diff -Nrcpad gcc-5.4.0/gcc/data-streamer-out.c gcc-5.5.0/gcc/data-streamer-out.c
*** gcc-5.4.0/gcc/data-streamer-out.c	Fri Jan  9 20:18:42 2015
--- gcc-5.5.0/gcc/data-streamer-out.c	Wed Mar 22 14:59:44 2017
*************** streamer_write_hwi_stream (struct lto_ou
*** 363,369 ****
  void
  streamer_write_gcov_count_stream (struct lto_output_stream *obs, gcov_type work)
  {
-   gcc_assert (work >= 0);
    gcc_assert ((HOST_WIDE_INT) work == work);
    streamer_write_hwi_stream (obs, work);
  }
--- 363,368 ----
diff -Nrcpad gcc-5.4.0/gcc/diagnostic.c gcc-5.5.0/gcc/diagnostic.c
*** gcc-5.4.0/gcc/diagnostic.c	Sun Nov 22 19:23:39 2015
--- gcc-5.5.0/gcc/diagnostic.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 41,48 ****
  # include <sys/ioctl.h>
  #endif
  
- #include <new>                     // For placement new.
- 
  #define pedantic_warning_kind(DC)			\
    ((DC)->pedantic_errors ? DK_ERROR : DK_WARNING)
  #define permissive_error_kind(DC) ((DC)->permissive ? DK_WARNING : DK_ERROR)
--- 41,46 ----
diff -Nrcpad gcc-5.4.0/gcc/doc/aot-compile.1 gcc-5.5.0/gcc/doc/aot-compile.1
*** gcc-5.4.0/gcc/doc/aot-compile.1	Fri Jun  3 10:32:25 2016
--- gcc-5.5.0/gcc/doc/aot-compile.1	Tue Oct 10 09:40:27 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "AOT-COMPILE 1"
! .TH AOT-COMPILE 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "AOT-COMPILE 1"
! .TH AOT-COMPILE 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/gcc/doc/cpp.1 gcc-5.5.0/gcc/doc/cpp.1
*** gcc-5.4.0/gcc/doc/cpp.1	Fri Jun  3 08:54:10 2016
--- gcc-5.5.0/gcc/doc/cpp.1	Tue Oct 10 08:23:53 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "CPP 1"
! .TH CPP 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "CPP 1"
! .TH CPP 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** Wherever possible, you should use a prep
*** 180,190 ****
  you are writing in.  Modern versions of the \s-1GNU\s0 assembler have macro
  facilities.  Most high level programming languages have their own
  conditional compilation and inclusion mechanism.  If all else fails,
! try a true general text processor, such as \s-1GNU\s0 M4.
  .PP
! C preprocessors vary in some details.  This manual discusses the \s-1GNU\s0 C
  preprocessor, which provides a small superset of the features of \s-1ISO\s0
! Standard C.  In its default mode, the \s-1GNU\s0 C preprocessor does not do a
  few things required by the standard.  These are features which are
  rarely, if ever, used, and may cause surprising changes to the meaning
  of a program which does not expect them.  To get strict \s-1ISO\s0 Standard C,
--- 177,187 ----
  you are writing in.  Modern versions of the \s-1GNU\s0 assembler have macro
  facilities.  Most high level programming languages have their own
  conditional compilation and inclusion mechanism.  If all else fails,
! try a true general text processor, such as \s-1GNU M4.\s0
  .PP
! C preprocessors vary in some details.  This manual discusses the \s-1GNU C\s0
  preprocessor, which provides a small superset of the features of \s-1ISO\s0
! Standard C.  In its default mode, the \s-1GNU C\s0 preprocessor does not do a
  few things required by the standard.  These are features which are
  rarely, if ever, used, and may cause surprising changes to the meaning
  of a program which does not expect them.  To get strict \s-1ISO\s0 Standard C,
*************** differences that do exist are detailed i
*** 201,207 ****
  Mode\fR.
  .PP
  For clarity, unless noted otherwise, references to \fB\s-1CPP\s0\fR in this
! manual refer to \s-1GNU\s0 \s-1CPP\s0.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
  The C preprocessor expects two file names as arguments, \fIinfile\fR and
--- 198,204 ----
  Mode\fR.
  .PP
  For clarity, unless noted otherwise, references to \fB\s-1CPP\s0\fR in this
! manual refer to \s-1GNU CPP.\s0
  .SH "OPTIONS"
  .IX Header "OPTIONS"
  The C preprocessor expects two file names as arguments, \fIinfile\fR and
*************** get trigraph conversion without warnings
*** 305,311 ****
  .IP "\fB\-Wtraditional\fR" 4
  .IX Item "-Wtraditional"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO\s0 C.  Also warn about \s-1ISO\s0 C constructs that have no traditional C
  equivalent, and problematic constructs which should be avoided.
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
--- 302,308 ----
  .IP "\fB\-Wtraditional\fR" 4
  .IX Item "-Wtraditional"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO C.\s0  Also warn about \s-1ISO C\s0 constructs that have no traditional C
  equivalent, and problematic constructs which should be avoided.
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
*************** in finding bugs in your own code, theref
*** 358,364 ****
  responsible for the system library, you may want to see them.
  .IP "\fB\-w\fR" 4
  .IX Item "-w"
! Suppress all warnings, including those which \s-1GNU\s0 \s-1CPP\s0 issues by default.
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  Issue all the mandatory diagnostics listed in the C standard.  Some of
--- 355,361 ----
  responsible for the system library, you may want to see them.
  .IP "\fB\-w\fR" 4
  .IX Item "-w"
! Suppress all warnings, including those which \s-1GNU CPP\s0 issues by default.
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  Issue all the mandatory diagnostics listed in the C standard.  Some of
*************** may be one of:
*** 530,536 ****
  .el .IP "\f(CWiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! The \s-1ISO\s0 C standard from 1990.  \fBc90\fR is the customary shorthand for
  this version of the standard.
  .Sp
  The \fB\-ansi\fR option is equivalent to \fB\-std=c90\fR.
--- 527,533 ----
  .el .IP "\f(CWiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! The \s-1ISO C\s0 standard from 1990.  \fBc90\fR is the customary shorthand for
  this version of the standard.
  .Sp
  The \fB\-ansi\fR option is equivalent to \fB\-std=c90\fR.
*************** The 1990 C standard, as amended in 1994.
*** 552,558 ****
  .el .IP "\f(CWc9x\fR" 4
  .IX Item "c9x"
  .PD
! The revised \s-1ISO\s0 C standard, published in December 1999.  Before
  publication, this was known as C9X.
  .ie n .IP """iso9899:2011""" 4
  .el .IP "\f(CWiso9899:2011\fR" 4
--- 549,555 ----
  .el .IP "\f(CWc9x\fR" 4
  .IX Item "c9x"
  .PD
! The revised \s-1ISO C\s0 standard, published in December 1999.  Before
  publication, this was known as C9X.
  .ie n .IP """iso9899:2011""" 4
  .el .IP "\f(CWiso9899:2011\fR" 4
*************** publication, this was known as C9X.
*** 565,571 ****
  .el .IP "\f(CWc1x\fR" 4
  .IX Item "c1x"
  .PD
! The revised \s-1ISO\s0 C standard, published in December 2011.  Before
  publication, this was known as C1X.
  .ie n .IP """gnu90""" 4
  .el .IP "\f(CWgnu90\fR" 4
--- 562,568 ----
  .el .IP "\f(CWc1x\fR" 4
  .IX Item "c1x"
  .PD
! The revised \s-1ISO C\s0 standard, published in December 2011.  Before
  publication, this was known as C1X.
  .ie n .IP """gnu90""" 4
  .el .IP "\f(CWgnu90\fR" 4
*************** The 2011 C standard plus \s-1GNU\s0 exte
*** 597,603 ****
  .ie n .IP """c++98""" 4
  .el .IP "\f(CWc++98\fR" 4
  .IX Item "c++98"
! The 1998 \s-1ISO\s0 \*(C+ standard plus amendments.
  .ie n .IP """gnu++98""" 4
  .el .IP "\f(CWgnu++98\fR" 4
  .IX Item "gnu++98"
--- 594,600 ----
  .ie n .IP """c++98""" 4
  .el .IP "\f(CWc++98\fR" 4
  .IX Item "c++98"
! The 1998 \s-1ISO \*(C+\s0 standard plus amendments.
  .ie n .IP """gnu++98""" 4
  .el .IP "\f(CWgnu++98\fR" 4
  .IX Item "gnu++98"
*************** line.  If the value is less than 1 or gr
*** 752,758 ****
  ignored.  The default is 8.
  .IP "\fB\-fdebug\-cpp\fR" 4
  .IX Item "-fdebug-cpp"
! This option is only useful for debugging \s-1GCC\s0.  When used with
  \&\fB\-E\fR, dumps debugging information about location maps.  Every
  token in the output is preceded by the dump of the map its location
  belongs to.  The dump of the map holding the location of a token would
--- 749,755 ----
  ignored.  The default is 8.
  .IP "\fB\-fdebug\-cpp\fR" 4
  .IX Item "-fdebug-cpp"
! This option is only useful for debugging \s-1GCC.\s0  When used with
  \&\fB\-E\fR, dumps debugging information about location maps.  Every
  token in the output is preceded by the dump of the map its location
  belongs to.  The dump of the map holding the location of a token would
*************** Note that \f(CW\*(C`\-ftrack\-macro\-exp
*** 785,796 ****
  .IP "\fB\-fexec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fexec-charset=charset"
  Set the execution character set, used for string and character
! constants.  The default is \s-1UTF\-8\s0.  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
  .IP "\fB\-fwide\-exec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fwide-exec-charset=charset"
  Set the wide execution character set, used for wide string and
! character constants.  The default is \s-1UTF\-32\s0 or \s-1UTF\-16\s0, whichever
  corresponds to the width of \f(CW\*(C`wchar_t\*(C'\fR.  As with
  \&\fB\-fexec\-charset\fR, \fIcharset\fR can be any encoding supported
  by the system's \f(CW\*(C`iconv\*(C'\fR library routine; however, you will have
--- 782,793 ----
  .IP "\fB\-fexec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fexec-charset=charset"
  Set the execution character set, used for string and character
! constants.  The default is \s-1UTF\-8.\s0  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
  .IP "\fB\-fwide\-exec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fwide-exec-charset=charset"
  Set the wide execution character set, used for wide string and
! character constants.  The default is \s-1UTF\-32\s0 or \s-1UTF\-16,\s0 whichever
  corresponds to the width of \f(CW\*(C`wchar_t\*(C'\fR.  As with
  \&\fB\-fexec\-charset\fR, \fIcharset\fR can be any encoding supported
  by the system's \f(CW\*(C`iconv\*(C'\fR library routine; however, you will have
*************** problems with encodings that do not fit
*** 798,806 ****
  .IP "\fB\-finput\-charset=\fR\fIcharset\fR" 4
  .IX Item "-finput-charset=charset"
  Set the input character set, used for translation from the character
! set of the input file to the source character set used by \s-1GCC\s0.  If the
  locale does not specify, or \s-1GCC\s0 cannot get this information from the
! locale, the default is \s-1UTF\-8\s0.  This can be overridden by either the locale
  or this command-line option.  Currently the command-line option takes
  precedence if there's a conflict.  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
--- 795,803 ----
  .IP "\fB\-finput\-charset=\fR\fIcharset\fR" 4
  .IX Item "-finput-charset=charset"
  Set the input character set, used for translation from the character
! set of the input file to the source character set used by \s-1GCC.\s0  If the
  locale does not specify, or \s-1GCC\s0 cannot get this information from the
! locale, the default is \s-1UTF\-8.\s0  This can be overridden by either the locale
  or this command-line option.  Currently the command-line option takes
  precedence if there's a conflict.  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
*************** Cancel an assertion with the predicate \
*** 837,843 ****
  .IX Item "-dCHARS"
  \&\fI\s-1CHARS\s0\fR is a sequence of one or more of the following characters,
  and must not be preceded by a space.  Other characters are interpreted
! by the compiler proper, or reserved for future versions of \s-1GCC\s0, and so
  are silently ignored.  If you specify characters whose behavior
  conflicts, the result is undefined.
  .RS 4
--- 834,840 ----
  .IX Item "-dCHARS"
  \&\fI\s-1CHARS\s0\fR is a sequence of one or more of the following characters,
  and must not be preceded by a space.  Other characters are interpreted
! by the compiler proper, or reserved for future versions of \s-1GCC,\s0 and so
  are silently ignored.  If you specify characters whose behavior
  conflicts, the result is undefined.
  .RS 4
*************** The \fB\-CC\fR option is generally used
*** 913,919 ****
  .IP "\fB\-traditional\-cpp\fR" 4
  .IX Item "-traditional-cpp"
  Try to imitate the behavior of old-fashioned C preprocessors, as
! opposed to \s-1ISO\s0 C preprocessors.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
  Process trigraph sequences.
--- 910,916 ----
  .IP "\fB\-traditional\-cpp\fR" 4
  .IX Item "-traditional-cpp"
  Try to imitate the behavior of old-fashioned C preprocessors, as
! opposed to \s-1ISO C\s0 preprocessors.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
  Process trigraph sequences.
*************** Print text describing all the command-li
*** 931,937 ****
  preprocessing anything.
  .IP "\fB\-v\fR" 4
  .IX Item "-v"
! Verbose mode.  Print out \s-1GNU\s0 \s-1CPP\s0's version number at the beginning of
  execution, and report the final form of the include path.
  .IP "\fB\-H\fR" 4
  .IX Item "-H"
--- 928,934 ----
  preprocessing anything.
  .IP "\fB\-v\fR" 4
  .IX Item "-v"
! Verbose mode.  Print out \s-1GNU CPP\s0's version number at the beginning of
  execution, and report the final form of the include path.
  .IP "\fB\-H\fR" 4
  .IX Item "-H"
*************** header file is printed with \fB...x\fR a
*** 946,952 ****
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
  .PD
! Print out \s-1GNU\s0 \s-1CPP\s0's version number.  With one dash, proceed to
  preprocess as normal.  With two dashes, exit immediately.
  .SH "ENVIRONMENT"
  .IX Header "ENVIRONMENT"
--- 943,949 ----
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
  .PD
! Print out \s-1GNU CPP\s0's version number.  With one dash, proceed to
  preprocess as normal.  With two dashes, exit immediately.
  .SH "ENVIRONMENT"
  .IX Header "ENVIRONMENT"
*************** Note that you can also specify places to
*** 958,964 ****
  \&\fB\-I\fR, and control dependency output with options like
  \&\fB\-M\fR.  These take precedence over
  environment variables, which in turn take precedence over the
! configuration of \s-1GCC\s0.
  .IP "\fB\s-1CPATH\s0\fR" 4
  .IX Item "CPATH"
  .PD 0
--- 955,961 ----
  \&\fB\-I\fR, and control dependency output with options like
  \&\fB\-M\fR.  These take precedence over
  environment variables, which in turn take precedence over the
! configuration of \s-1GCC.\s0
  .IP "\fB\s-1CPATH\s0\fR" 4
  .IX Item "CPATH"
  .PD 0
diff -Nrcpad gcc-5.4.0/gcc/doc/cpp.info gcc-5.5.0/gcc/doc/cpp.info
*** gcc-5.4.0/gcc/doc/cpp.info	Fri Jun  3 10:32:20 2016
--- gcc-5.5.0/gcc/doc/cpp.info	Tue Oct 10 09:40:04 2017
***************
*** 1,5 ****
! This is doc/cpp.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/doc/cpp.texi.
  
  Copyright (C) 1987-2015 Free Software Foundation, Inc.
  
--- 1,4 ----
! This is cpp.info, produced by makeinfo version 6.1 from cpp.texi.
  
  Copyright (C) 1987-2015 Free Software Foundation, Inc.
  
*************** are (a) (see below), and the Back-Cover
*** 19,27 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
! 
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * Cpp: (cpp).                  The GNU C preprocessor.
--- 18,25 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * Cpp: (cpp).                  The GNU C preprocessor.
*************** useful on its own.
*** 57,63 ****
  * Option Index::
  * Concept Index::
  
!  --- The Detailed Node Listing ---
  
  Overview
  
--- 55,61 ----
  * Option Index::
  * Concept Index::
  
!  -- The Detailed Node Listing --
  
  Overview
  
*************** Obsolete Features
*** 132,137 ****
--- 130,136 ----
  
  * Obsolete Features::
  
+ 
     Copyright (C) 1987-2015 Free Software Foundation, Inc.
  
     Permission is granted to copy, distribute and/or modify this document
*************** are (a) (see below), and the Back-Cover
*** 150,157 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
  
  
  File: cpp.info,  Node: Overview,  Next: Header Files,  Prev: Top,  Up: Top
--- 149,156 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
  
  
  File: cpp.info,  Node: Overview,  Next: Header Files,  Prev: Top,  Up: Top
*************** File: cpp.info,  Node: Overview,  Next:
*** 159,169 ****
  1 Overview
  **********
  
! The C preprocessor, often known as "cpp", is a "macro processor" that
! is used automatically by the C compiler to transform your program
! before compilation.  It is called a macro processor because it allows
! you to define "macros", which are brief abbreviations for longer
! constructs.
  
     The C preprocessor is intended to be used only with C, C++, and
  Objective-C source code.  In the past, it has been abused as a general
--- 158,167 ----
  1 Overview
  **********
  
! The C preprocessor, often known as "cpp", is a "macro processor" that is
! used automatically by the C compiler to transform your program before
! compilation.  It is called a macro processor because it allows you to
! define "macros", which are brief abbreviations for longer constructs.
  
     The C preprocessor is intended to be used only with C, C++, and
  Objective-C source code.  In the past, it has been abused as a general
*************** will be removed, and the Makefile will n
*** 176,182 ****
  
     Having said that, you can often get away with using cpp on things
  which are not C.  Other Algol-ish programming languages are often safe
! (Pascal, Ada, etc.) So is assembly, with caution.  `-traditional-cpp'
  mode preserves more white space, and is otherwise more permissive.  Many
  of the problems can be avoided by writing C or C++ style comments
  instead of native language comments, and keeping macros simple.
--- 174,180 ----
  
     Having said that, you can often get away with using cpp on things
  which are not C.  Other Algol-ish programming languages are often safe
! (Pascal, Ada, etc.)  So is assembly, with caution.  '-traditional-cpp'
  mode preserves more white space, and is otherwise more permissive.  Many
  of the problems can be avoided by writing C or C++ style comments
  instead of native language comments, and keeping macros simple.
*************** instead of native language comments, and
*** 184,191 ****
     Wherever possible, you should use a preprocessor geared to the
  language you are writing in.  Modern versions of the GNU assembler have
  macro facilities.  Most high level programming languages have their own
! conditional compilation and inclusion mechanism.  If all else fails,
! try a true general text processor, such as GNU M4.
  
     C preprocessors vary in some details.  This manual discusses the GNU
  C preprocessor, which provides a small superset of the features of ISO
--- 182,189 ----
     Wherever possible, you should use a preprocessor geared to the
  language you are writing in.  Modern versions of the GNU assembler have
  macro facilities.  Most high level programming languages have their own
! conditional compilation and inclusion mechanism.  If all else fails, try
! a true general text processor, such as GNU M4.
  
     C preprocessors vary in some details.  This manual discusses the GNU
  C preprocessor, which provides a small superset of the features of ISO
*************** Standard C.  In its default mode, the GN
*** 193,201 ****
  few things required by the standard.  These are features which are
  rarely, if ever, used, and may cause surprising changes to the meaning
  of a program which does not expect them.  To get strict ISO Standard C,
! you should use the `-std=c90', `-std=c99' or `-std=c11' options,
  depending on which version of the standard you want.  To get all the
! mandatory diagnostics, you must also use `-pedantic'.  *Note
  Invocation::.
  
     This manual describes the behavior of the ISO preprocessor.  To
--- 191,199 ----
  few things required by the standard.  These are features which are
  rarely, if ever, used, and may cause surprising changes to the meaning
  of a program which does not expect them.  To get strict ISO Standard C,
! you should use the '-std=c90', '-std=c99' or '-std=c11' options,
  depending on which version of the standard you want.  To get all the
! mandatory diagnostics, you must also use '-pedantic'.  *Note
  Invocation::.
  
     This manual describes the behavior of the ISO preprocessor.  To
*************** does not conflict with traditional seman
*** 204,210 ****
  preprocessor should behave the same way.  The various differences that
  do exist are detailed in the section *note Traditional Mode::.
  
!    For clarity, unless noted otherwise, references to `CPP' in this
  manual refer to GNU CPP.
  
  * Menu:
--- 202,208 ----
  preprocessor should behave the same way.  The various differences that
  do exist are detailed in the section *note Traditional Mode::.
  
!    For clarity, unless noted otherwise, references to 'CPP' in this
  manual refer to GNU CPP.
  
  * Menu:
*************** there are really at least four.
*** 226,267 ****
  
     The files input to CPP might be in any character set at all.  CPP's
  very first action, before it even looks for line boundaries, is to
! convert the file into the character set it uses for internal
! processing.  That set is what the C standard calls the "source"
! character set.  It must be isomorphic with ISO 10646, also known as
! Unicode.  CPP uses the UTF-8 encoding of Unicode.
  
     The character sets of the input files are specified using the
! `-finput-charset=' option.
  
     All preprocessing work (the subject of the rest of this manual) is
  carried out in the source character set.  If you request textual output
! from the preprocessor with the `-E' option, it will be in UTF-8.
  
     After preprocessing is complete, string and character constants are
! converted again, into the "execution" character set.  This character
! set is under control of the user; the default is UTF-8, matching the
! source character set.  Wide string and character constants have their
! own character set, which is not called out specifically in the
! standard.  Again, it is under control of the user.  The default is
! UTF-16 or UTF-32, whichever fits in the target's `wchar_t' type, in the
! target machine's byte order.(1)  Octal and hexadecimal escape sequences
! do not undergo conversion; '\x12' has the value 0x12 regardless of the
  currently selected execution character set.  All other escapes are
  replaced by the character in the source character set that they
  represent, then converted to the execution character set, just like
  unescaped characters.
  
     In identifiers, characters outside the ASCII range can only be
! specified with the `\u' and `\U' escapes, not used directly.  If strict
! ISO C90 conformance is specified with an option such as `-std=c90', or
! `-fno-extended-identifiers' is used, then those escapes are not
  permitted in identifiers.
  
     ---------- Footnotes ----------
  
     (1) UTF-16 does not meet the requirements of the C standard for a
! wide character set, but the choice of 16-bit `wchar_t' is enshrined in
  some system ABIs so we cannot fix this.
  
  
--- 224,265 ----
  
     The files input to CPP might be in any character set at all.  CPP's
  very first action, before it even looks for line boundaries, is to
! convert the file into the character set it uses for internal processing.
! That set is what the C standard calls the "source" character set.  It
! must be isomorphic with ISO 10646, also known as Unicode.  CPP uses the
! UTF-8 encoding of Unicode.
  
     The character sets of the input files are specified using the
! '-finput-charset=' option.
  
     All preprocessing work (the subject of the rest of this manual) is
  carried out in the source character set.  If you request textual output
! from the preprocessor with the '-E' option, it will be in UTF-8.
  
     After preprocessing is complete, string and character constants are
! converted again, into the "execution" character set.  This character set
! is under control of the user; the default is UTF-8, matching the source
! character set.  Wide string and character constants have their own
! character set, which is not called out specifically in the standard.
! Again, it is under control of the user.  The default is UTF-16 or
! UTF-32, whichever fits in the target's 'wchar_t' type, in the target
! machine's byte order.(1)  Octal and hexadecimal escape sequences do not
! undergo conversion; '\x12' has the value 0x12 regardless of the
  currently selected execution character set.  All other escapes are
  replaced by the character in the source character set that they
  represent, then converted to the execution character set, just like
  unescaped characters.
  
     In identifiers, characters outside the ASCII range can only be
! specified with the '\u' and '\U' escapes, not used directly.  If strict
! ISO C90 conformance is specified with an option such as '-std=c90', or
! '-fno-extended-identifiers' is used, then those escapes are not
  permitted in identifiers.
  
     ---------- Footnotes ----------
  
     (1) UTF-16 does not meet the requirements of the C standard for a
! wide character set, but the choice of 16-bit 'wchar_t' is enshrined in
  some system ABIs so we cannot fix this.
  
  
*************** standard.
*** 281,315 ****
    1. The input file is read into memory and broken into lines.
  
       Different systems use different conventions to indicate the end of
!      a line.  GCC accepts the ASCII control sequences `LF', `CR LF' and
!      `CR' as end-of-line markers.  These are the canonical sequences
       used by Unix, DOS and VMS, and the classic Mac OS (before OSX)
!      respectively.  You may therefore safely copy source code written
!      on any of those systems to a different one and use it without
       conversion.  (GCC may lose track of the current line number if a
       file doesn't consistently use one convention, as sometimes happens
       when it is edited on computers with different conventions that
       share a network file system.)
  
!      If the last line of any input file lacks an end-of-line marker,
!      the end of the file is considered to implicitly supply one.  The C
       standard says that this condition provokes undefined behavior, so
       GCC will emit a warning message.
  
    2. If trigraphs are enabled, they are replaced by their corresponding
       single characters.  By default GCC ignores trigraphs, but if you
!      request a strictly conforming mode with the `-std' option, or you
!      specify the `-trigraphs' option, then it converts them.
  
!      These are nine three-character sequences, all starting with `??',
       that are defined by ISO C to stand for single characters.  They
!      permit obsolete systems that lack some of C's punctuation to use
!      C.  For example, `??/' stands for `\', so '??/n' is a character
       constant for a newline.
  
       Trigraphs are not popular and many compilers implement them
       incorrectly.  Portable code should not rely on trigraphs being
!      either converted or ignored.  With `-Wtrigraphs' GCC will warn you
       when a trigraph may change the meaning of your program if it were
       converted.  *Note Wtrigraphs::.
  
--- 279,313 ----
    1. The input file is read into memory and broken into lines.
  
       Different systems use different conventions to indicate the end of
!      a line.  GCC accepts the ASCII control sequences 'LF', 'CR LF' and
!      'CR' as end-of-line markers.  These are the canonical sequences
       used by Unix, DOS and VMS, and the classic Mac OS (before OSX)
!      respectively.  You may therefore safely copy source code written on
!      any of those systems to a different one and use it without
       conversion.  (GCC may lose track of the current line number if a
       file doesn't consistently use one convention, as sometimes happens
       when it is edited on computers with different conventions that
       share a network file system.)
  
!      If the last line of any input file lacks an end-of-line marker, the
!      end of the file is considered to implicitly supply one.  The C
       standard says that this condition provokes undefined behavior, so
       GCC will emit a warning message.
  
    2. If trigraphs are enabled, they are replaced by their corresponding
       single characters.  By default GCC ignores trigraphs, but if you
!      request a strictly conforming mode with the '-std' option, or you
!      specify the '-trigraphs' option, then it converts them.
  
!      These are nine three-character sequences, all starting with '??',
       that are defined by ISO C to stand for single characters.  They
!      permit obsolete systems that lack some of C's punctuation to use C.
!      For example, '??/' stands for '\', so '??/n' is a character
       constant for a newline.
  
       Trigraphs are not popular and many compilers implement them
       incorrectly.  Portable code should not rely on trigraphs being
!      either converted or ignored.  With '-Wtrigraphs' GCC will warn you
       when a trigraph may change the meaning of your program if it were
       converted.  *Note Wtrigraphs::.
  
*************** standard.
*** 317,324 ****
       from being confused with a trigraph by inserting a backslash
       between the question marks, or by separating the string literal at
       the trigraph and making use of string literal concatenation.
!      "(??\?)"  is the string `(???)', not `(?]'.  Traditional C
!      compilers do not recognize these idioms.
  
       The nine trigraphs and their replacements are
  
--- 315,322 ----
       from being confused with a trigraph by inserting a backslash
       between the question marks, or by separating the string literal at
       the trigraph and making use of string literal concatenation.
!      "(??\?)" is the string '(???)', not '(?]'.  Traditional C compilers
!      do not recognize these idioms.
  
       The nine trigraphs and their replacements are
  
*************** standard.
*** 327,333 ****
  
    3. Continued lines are merged into one long line.
  
!      A continued line is a line which ends with a backslash, `\'.  The
       backslash is removed and the following line is joined with the
       current one.  No space is inserted, so you may split a line
       anywhere, even in the middle of a word.  (It is generally more
--- 325,331 ----
  
    3. Continued lines are merged into one long line.
  
!      A continued line is a line which ends with a backslash, '\'.  The
       backslash is removed and the following line is joined with the
       current one.  No space is inserted, so you may split a line
       anywhere, even in the middle of a word.  (It is generally more
*************** standard.
*** 338,354 ****
  
       If there is white space between a backslash and the end of a line,
       that is still a continued line.  However, as this is usually the
!      result of an editing mistake, and many compilers will not accept
!      it as a continued line, GCC will warn you about it.
  
    4. All comments are replaced with single spaces.
  
!      There are two kinds of comments.  "Block comments" begin with `/*'
!      and continue until the next `*/'.  Block comments do not nest:
  
            /* this is /* one comment */ text outside comment
  
!      "Line comments" begin with `//' and continue to the end of the
       current line.  Line comments do not nest either, but it does not
       matter, because they would end in the same place anyway.
  
--- 336,352 ----
  
       If there is white space between a backslash and the end of a line,
       that is still a continued line.  However, as this is usually the
!      result of an editing mistake, and many compilers will not accept it
!      as a continued line, GCC will warn you about it.
  
    4. All comments are replaced with single spaces.
  
!      There are two kinds of comments.  "Block comments" begin with '/*'
!      and continue until the next '*/'.  Block comments do not nest:
  
            /* this is /* one comment */ text outside comment
  
!      "Line comments" begin with '//' and continue to the end of the
       current line.  Line comments do not nest either, but it does not
       matter, because they would end in the same place anyway.
  
*************** comment.
*** 371,377 ****
           oops! this isn't a comment anymore */
  
     Comments are not recognized within string literals.  "/* blah */" is
! the string constant `/* blah */', not an empty string.
  
     Line comments are not in the 1989 edition of the C standard, but they
  are recognized by GCC as an extension.  In C++ and in the 1999 edition
--- 369,375 ----
           oops! this isn't a comment anymore */
  
     Comments are not recognized within string literals.  "/* blah */" is
! the string constant '/* blah */', not an empty string.
  
     Line comments are not in the 1989 edition of the C standard, but they
  are recognized by GCC as an extension.  In C++ and in the 1999 edition
*************** of the C standard, they are an official
*** 380,387 ****
     Since these transformations happen before all other processing, you
  can split a line mechanically with backslash-newline anywhere.  You can
  comment out the end of a line.  You can continue a line comment onto the
! next line with backslash-newline.  You can even split `/*', `*/', and
! `//' onto multiple lines with backslash-newline.  For example:
  
       /\
       *
--- 378,385 ----
     Since these transformations happen before all other processing, you
  can split a line mechanically with backslash-newline anywhere.  You can
  comment out the end of a line.  You can continue a line comment onto the
! next line with backslash-newline.  You can even split '/*', '*/', and
! '//' onto multiple lines with backslash-newline.  For example:
  
       /\
       *
*************** next line with backslash-newline.  You c
*** 391,397 ****
       O 10\
       20
  
! is equivalent to `#define FOO 1020'.  All these tricks are extremely
  confusing and should not be used in code intended to be readable.
  
     There is no way to prevent a backslash at the end of a line from
--- 389,395 ----
       O 10\
       20
  
! is equivalent to '#define FOO 1020'.  All these tricks are extremely
  confusing and should not be used in code intended to be readable.
  
     There is no way to prevent a backslash at the end of a line from
*************** token of any kind.  Tokens do not have t
*** 412,426 ****
  but it is often necessary to avoid ambiguities.
  
     When faced with a sequence of characters that has more than one
! possible tokenization, the preprocessor is greedy.  It always makes
! each token, starting from the left, as big as possible before moving on
! to the next token.  For instance, `a+++++b' is interpreted as
! `a ++ ++ + b', not as `a ++ + ++ b', even though the latter
! tokenization could be part of a valid C program and the former could
! not.
  
     Once the input file is broken into tokens, the token boundaries never
! change, except when the `##' preprocessing operator is used to paste
  tokens together.  *Note Concatenation::.  For example,
  
       #define foo() bar
--- 410,423 ----
  but it is often necessary to avoid ambiguities.
  
     When faced with a sequence of characters that has more than one
! possible tokenization, the preprocessor is greedy.  It always makes each
! token, starting from the left, as big as possible before moving on to
! the next token.  For instance, 'a+++++b' is interpreted as
! 'a ++ ++ + b', not as 'a ++ + ++ b', even though the latter tokenization
! could be part of a valid C program and the former could not.
  
     Once the input file is broken into tokens, the token boundaries never
! change, except when the '##' preprocessing operator is used to paste
  tokens together.  *Note Concatenation::.  For example,
  
       #define foo() bar
*************** preprocessing token becomes one compiler
*** 434,445 ****
  
     Preprocessing tokens fall into five broad classes: identifiers,
  preprocessing numbers, string literals, punctuators, and other.  An
! "identifier" is the same as an identifier in C: any sequence of
! letters, digits, or underscores, which begins with a letter or
! underscore.  Keywords of C have no significance to the preprocessor;
! they are ordinary identifiers.  You can define a macro whose name is a
! keyword, for instance.  The only identifier which can be considered a
! preprocessing keyword is `defined'.  *Note Defined::.
  
     This is mostly true of other languages which use the C preprocessor.
  However, a few of the keywords of C++ are significant even in the
--- 431,442 ----
  
     Preprocessing tokens fall into five broad classes: identifiers,
  preprocessing numbers, string literals, punctuators, and other.  An
! "identifier" is the same as an identifier in C: any sequence of letters,
! digits, or underscores, which begins with a letter or underscore.
! Keywords of C have no significance to the preprocessor; they are
! ordinary identifiers.  You can define a macro whose name is a keyword,
! for instance.  The only identifier which can be considered a
! preprocessing keyword is 'defined'.  *Note Defined::.
  
     This is mostly true of other languages which use the C preprocessor.
  However, a few of the keywords of C++ are significant even in the
*************** preprocessor.  *Note C++ Named Operators
*** 449,461 ****
  part of the "basic source character set", at the implementation's
  discretion (such as accented Latin letters, Greek letters, or Chinese
  ideograms).  This may be done with an extended character set, or the
! `\u' and `\U' escape sequences.  GCC only accepts such characters in
! the `\u' and `\U' forms.
  
!    As an extension, GCC treats `$' as a letter.  This is for
! compatibility with some systems, such as VMS, where `$' is commonly
! used in system-defined function and object names.  `$' is not a letter
! in strictly conforming mode, or if you specify the `-$' option.  *Note
  Invocation::.
  
     A "preprocessing number" has a rather bizarre definition.  The
--- 446,458 ----
  part of the "basic source character set", at the implementation's
  discretion (such as accented Latin letters, Greek letters, or Chinese
  ideograms).  This may be done with an extended character set, or the
! '\u' and '\U' escape sequences.  GCC only accepts such characters in the
! '\u' and '\U' forms.
  
!    As an extension, GCC treats '$' as a letter.  This is for
! compatibility with some systems, such as VMS, where '$' is commonly used
! in system-defined function and object names.  '$' is not a letter in
! strictly conforming mode, or if you specify the '-$' option.  *Note
  Invocation::.
  
     A "preprocessing number" has a rather bizarre definition.  The
*************** one expects of C, but also a number of o
*** 464,472 ****
  initially recognize as a number.  Formally, preprocessing numbers begin
  with an optional period, a required decimal digit, and then continue
  with any sequence of letters, digits, underscores, periods, and
! exponents.  Exponents are the two-character sequences `e+', `e-', `E+',
! `E-', `p+', `p-', `P+', and `P-'.  (The exponents that begin with `p'
! or `P' are new to C99.  They are used for hexadecimal floating-point
  constants.)
  
     The purpose of this unusual definition is to isolate the preprocessor
--- 461,469 ----
  initially recognize as a number.  Formally, preprocessing numbers begin
  with an optional period, a required decimal digit, and then continue
  with any sequence of letters, digits, underscores, periods, and
! exponents.  Exponents are the two-character sequences 'e+', 'e-', 'E+',
! 'E-', 'p+', 'p-', 'P+', and 'P-'.  (The exponents that begin with 'p' or
! 'P' are new to C99.  They are used for hexadecimal floating-point
  constants.)
  
     The purpose of this unusual definition is to isolate the preprocessor
*************** from the full complexity of numeric cons
*** 474,495 ****
  distinguish between lexically valid and invalid floating-point numbers,
  which is complicated.  The definition also permits you to split an
  identifier at any position and get exactly two tokens, which can then be
! pasted back together with the `##' operator.
  
     It's possible for preprocessing numbers to cause programs to be
! misinterpreted.  For example, `0xE+12' is a preprocessing number which
  does not translate to any valid numeric constant, therefore a syntax
! error.  It does not mean `0xE + 12', which is what you might have
  intended.
  
     "String literals" are string constants, character constants, and
! header file names (the argument of `#include').(1)  String constants
! and character constants are straightforward: "..." or '...'.  In either
! case embedded quotes should be escaped with a backslash: '\'' is the
! character constant for `''.  There is no limit on the length of a
  character constant, but the value of a character constant that contains
! more than one character is implementation-defined.  *Note
! Implementation Details::.
  
     Header file names either look like string constants, "...", or are
  written with angle brackets instead, <...>.  In either case, backslash
--- 471,492 ----
  distinguish between lexically valid and invalid floating-point numbers,
  which is complicated.  The definition also permits you to split an
  identifier at any position and get exactly two tokens, which can then be
! pasted back together with the '##' operator.
  
     It's possible for preprocessing numbers to cause programs to be
! misinterpreted.  For example, '0xE+12' is a preprocessing number which
  does not translate to any valid numeric constant, therefore a syntax
! error.  It does not mean '0xE + 12', which is what you might have
  intended.
  
     "String literals" are string constants, character constants, and
! header file names (the argument of '#include').(1)  String constants and
! character constants are straightforward: "..." or '...'.  In either case
! embedded quotes should be escaped with a backslash: '\'' is the
! character constant for '''.  There is no limit on the length of a
  character constant, but the value of a character constant that contains
! more than one character is implementation-defined.  *Note Implementation
! Details::.
  
     Header file names either look like string constants, "...", or are
  written with angle brackets instead, <...>.  In either case, backslash
*************** Operation::.
*** 500,518 ****
  
     No string literal may extend past the end of a line.  Older versions
  of GCC accepted multi-line string constants.  You may use continued
! lines instead, or string constant concatenation.  *Note Differences
! from previous versions::.
  
     "Punctuators" are all the usual bits of punctuation which are
  meaningful to C and C++.  All but three of the punctuation characters in
! ASCII are C punctuators.  The exceptions are `@', `$', and ``'.  In
  addition, all the two- and three-character operators are punctuators.
! There are also six "digraphs", which the C++ standard calls
! "alternative tokens", which are merely alternate ways to spell other
! punctuators.  This is a second attempt to work around missing
! punctuation in obsolete systems.  It has no negative side effects,
! unlike trigraphs, but does not cover as much ground.  The digraphs and
! their corresponding normal punctuators are:
  
       Digraph:        <%  %>  <:  :>  %:  %:%:
       Punctuator:      {   }   [   ]   #    ##
--- 497,515 ----
  
     No string literal may extend past the end of a line.  Older versions
  of GCC accepted multi-line string constants.  You may use continued
! lines instead, or string constant concatenation.  *Note Differences from
! previous versions::.
  
     "Punctuators" are all the usual bits of punctuation which are
  meaningful to C and C++.  All but three of the punctuation characters in
! ASCII are C punctuators.  The exceptions are '@', '$', and '`'.  In
  addition, all the two- and three-character operators are punctuators.
! There are also six "digraphs", which the C++ standard calls "alternative
! tokens", which are merely alternate ways to spell other punctuators.
! This is a second attempt to work around missing punctuation in obsolete
! systems.  It has no negative side effects, unlike trigraphs, but does
! not cover as much ground.  The digraphs and their corresponding normal
! punctuators are:
  
       Digraph:        <%  %>  <:  :>  %:  %:%:
       Punctuator:      {   }   [   ]   #    ##
*************** their corresponding normal punctuators a
*** 520,531 ****
     Any other single character is considered "other".  It is passed on to
  the preprocessor's output unmolested.  The C compiler will almost
  certainly reject source code containing "other" tokens.  In ASCII, the
! only other characters are `@', `$', ``', and control characters other
! than NUL (all bits zero).  (Note that `$' is normally considered a
! letter.)  All characters with the high bit set (numeric range
! 0x7F-0xFF) are also "other" in the present implementation.  This will
! change when proper support for international character sets is added to
! GCC.
  
     NUL is a special case because of the high probability that its
  appearance is accidental, and because it may be invisible to the user
--- 517,527 ----
     Any other single character is considered "other".  It is passed on to
  the preprocessor's output unmolested.  The C compiler will almost
  certainly reject source code containing "other" tokens.  In ASCII, the
! only other characters are '@', '$', '`', and control characters other
! than NUL (all bits zero).  (Note that '$' is normally considered a
! letter.)  All characters with the high bit set (numeric range 0x7F-0xFF)
! are also "other" in the present implementation.  This will change when
! proper support for international character sets is added to GCC.
  
     NUL is a special case because of the high probability that its
  appearance is accidental, and because it may be invisible to the user
*************** have the same meaning.
*** 537,545 ****
       #define X^@1
       #define X 1
  
! (where `^@' is ASCII NUL).  Within string or character constants, NULs
! are preserved.  In the latter two cases the preprocessor emits a
! warning message.
  
     ---------- Footnotes ----------
  
--- 533,541 ----
       #define X^@1
       #define X 1
  
! (where '^@' is ASCII NUL).  Within string or character constants, NULs
! are preserved.  In the latter two cases the preprocessor emits a warning
! message.
  
     ---------- Footnotes ----------
  
*************** and "macros" to be expanded.  Its primar
*** 573,580 ****
       program according to various conditions.
  
     * Line control.  If you use a program to combine or rearrange source
!      files into an intermediate file which is then compiled, you can
!      use line control to inform the compiler where each source line
       originally came from.
  
     * Diagnostics.  You can detect problems at compile time and issue
--- 569,576 ----
       program according to various conditions.
  
     * Line control.  If you use a program to combine or rearrange source
!      files into an intermediate file which is then compiled, you can use
!      line control to inform the compiler where each source line
       originally came from.
  
     * Diagnostics.  You can detect problems at compile time and issue
*************** and "macros" to be expanded.  Its primar
*** 583,598 ****
     There are a few more, less useful, features.
  
     Except for expansion of predefined macros, all these operations are
! triggered with "preprocessing directives".  Preprocessing directives
! are lines in your program that start with `#'.  Whitespace is allowed
! before and after the `#'.  The `#' is followed by an identifier, the
! "directive name".  It specifies the operation to perform.  Directives
! are commonly referred to as `#NAME' where NAME is the directive name.
! For example, `#define' is the directive that defines a macro.
  
!    The `#' which begins a directive cannot come from a macro expansion.
! Also, the directive name is not macro expanded.  Thus, if `foo' is
! defined as a macro expanding to `define', that does not make `#foo' a
  valid preprocessing directive.
  
     The set of valid directive names is fixed.  Programs cannot define
--- 579,594 ----
     There are a few more, less useful, features.
  
     Except for expansion of predefined macros, all these operations are
! triggered with "preprocessing directives".  Preprocessing directives are
! lines in your program that start with '#'.  Whitespace is allowed before
! and after the '#'.  The '#' is followed by an identifier, the "directive
! name".  It specifies the operation to perform.  Directives are commonly
! referred to as '#NAME' where NAME is the directive name.  For example,
! '#define' is the directive that defines a macro.
  
!    The '#' which begins a directive cannot come from a macro expansion.
! Also, the directive name is not macro expanded.  Thus, if 'foo' is
! defined as a macro expanding to 'define', that does not make '#foo' a
  valid preprocessing directive.
  
     The set of valid directive names is fixed.  Programs cannot define
*************** new preprocessing directives.
*** 600,607 ****
  
     Some directives require arguments; these make up the rest of the
  directive line and must be separated from the directive name by
! whitespace.  For example, `#define' must be followed by a macro name
! and the intended expansion of the macro.
  
     A preprocessing directive cannot cover more than one line.  The line
  may, however, be continued with backslash-newline, or by a block comment
--- 596,603 ----
  
     Some directives require arguments; these make up the rest of the
  directive line and must be separated from the directive name by
! whitespace.  For example, '#define' must be followed by a macro name and
! the intended expansion of the macro.
  
     A preprocessing directive cannot cover more than one line.  The line
  may, however, be continued with backslash-newline, or by a block comment
*************** File: cpp.info,  Node: Header Files,  Ne
*** 618,624 ****
  A header file is a file containing C declarations and macro definitions
  (*note Macros::) to be shared between several source files.  You request
  the use of a header file in your program by "including" it, with the C
! preprocessing directive `#include'.
  
     Header files serve two purposes.
  
--- 614,620 ----
  A header file is a file containing C declarations and macro definitions
  (*note Macros::) to be shared between several source files.  You request
  the use of a header file in your program by "including" it, with the C
! preprocessing directive '#include'.
  
     Header files serve two purposes.
  
*************** preprocessing directive `#include'.
*** 629,636 ****
  
     * Your own header files contain declarations for interfaces between
       the source files of your program.  Each time you have a group of
!      related declarations and macro definitions all or most of which
!      are needed in several different source files, it is a good idea to
       create a header file for them.
  
     Including a header file produces the same results as copying the
--- 625,632 ----
  
     * Your own header files contain declarations for interfaces between
       the source files of your program.  Each time you have a group of
!      related declarations and macro definitions all or most of which are
!      needed in several different source files, it is a good idea to
       create a header file for them.
  
     Including a header file produces the same results as copying the
*************** as the risk that a failure to find one c
*** 644,650 ****
  inconsistencies within a program.
  
     In C, the usual convention is to give header files names that end
! with `.h'.  It is most portable to use only letters, digits, dashes, and
  underscores in header file names, and at most one dot.
  
  * Menu:
--- 640,646 ----
  inconsistencies within a program.
  
     In C, the usual convention is to give header files names that end
! with '.h'.  It is most portable to use only letters, digits, dashes, and
  underscores in header file names, and at most one dot.
  
  * Menu:
*************** File: cpp.info,  Node: Include Syntax,
*** 665,697 ****
  ==================
  
  Both user and system header files are included using the preprocessing
! directive `#include'.  It has two variants:
  
! `#include <FILE>'
       This variant is used for system header files.  It searches for a
       file named FILE in a standard list of system directories.  You can
!      prepend directories to this list with the `-I' option (*note
       Invocation::).
  
! `#include "FILE"'
       This variant is used for header files of your own program.  It
       searches for a file named FILE first in the directory containing
       the current file, then in the quote directories and then the same
!      directories used for `<FILE>'.  You can prepend directories to the
!      list of quote directories with the `-iquote' option.
  
!    The argument of `#include', whether delimited with quote marks or
  angle brackets, behaves like a string constant in that comments are not
! recognized, and macro names are not expanded.  Thus, `#include <x/*y>'
! specifies inclusion of a system header file named `x/*y'.
  
     However, if backslashes occur within FILE, they are considered
  ordinary text characters, not escape characters.  None of the character
  escape sequences appropriate to string constants in C are processed.
! Thus, `#include "x\n\\y"' specifies a filename containing three
! backslashes.  (Some systems interpret `\' as a pathname separator.  All
! of these also interpret `/' the same way.  It is most portable to use
! only `/'.)
  
     It is an error if there is anything (other than comments) on the line
  after the file name.
--- 661,693 ----
  ==================
  
  Both user and system header files are included using the preprocessing
! directive '#include'.  It has two variants:
  
! '#include <FILE>'
       This variant is used for system header files.  It searches for a
       file named FILE in a standard list of system directories.  You can
!      prepend directories to this list with the '-I' option (*note
       Invocation::).
  
! '#include "FILE"'
       This variant is used for header files of your own program.  It
       searches for a file named FILE first in the directory containing
       the current file, then in the quote directories and then the same
!      directories used for '<FILE>'.  You can prepend directories to the
!      list of quote directories with the '-iquote' option.
  
!    The argument of '#include', whether delimited with quote marks or
  angle brackets, behaves like a string constant in that comments are not
! recognized, and macro names are not expanded.  Thus, '#include <x/*y>'
! specifies inclusion of a system header file named 'x/*y'.
  
     However, if backslashes occur within FILE, they are considered
  ordinary text characters, not escape characters.  None of the character
  escape sequences appropriate to string constants in C are processed.
! Thus, '#include "x\n\\y"' specifies a filename containing three
! backslashes.  (Some systems interpret '\' as a pathname separator.  All
! of these also interpret '/' the same way.  It is most portable to use
! only '/'.)
  
     It is an error if there is anything (other than comments) on the line
  after the file name.
*************** File: cpp.info,  Node: Include Operation
*** 702,718 ****
  2.2 Include Operation
  =====================
  
! The `#include' directive works by directing the C preprocessor to scan
  the specified file as input before continuing with the rest of the
  current file.  The output from the preprocessor contains the output
  already generated, followed by the output resulting from the included
  file, followed by the output that comes from the text after the
! `#include' directive.  For example, if you have a header file
! `header.h' as follows,
  
       char *test (void);
  
! and a main program called `program.c' that uses the header file, like
  this,
  
       int x;
--- 698,714 ----
  2.2 Include Operation
  =====================
  
! The '#include' directive works by directing the C preprocessor to scan
  the specified file as input before continuing with the rest of the
  current file.  The output from the preprocessor contains the output
  already generated, followed by the output resulting from the included
  file, followed by the output that comes from the text after the
! '#include' directive.  For example, if you have a header file 'header.h'
! as follows,
  
       char *test (void);
  
! and a main program called 'program.c' that uses the header file, like
  this,
  
       int x;
*************** this,
*** 724,730 ****
         puts (test ());
       }
  
! the compiler will see the same token stream as it would if `program.c'
  read
  
       int x;
--- 720,726 ----
         puts (test ());
       }
  
! the compiler will see the same token stream as it would if 'program.c'
  read
  
       int x;
*************** the file.
*** 750,756 ****
  syntactic units--function declarations or definitions, type
  declarations, etc.
  
!    The line following the `#include' directive is always treated as a
  separate line by the C preprocessor, even if the included file lacks a
  final newline.
  
--- 746,752 ----
  syntactic units--function declarations or definitions, type
  declarations, etc.
  
!    The line following the '#include' directive is always treated as a
  separate line by the C preprocessor, even if the included file lacks a
  final newline.
  
*************** File: cpp.info,  Node: Search Path,  Nex
*** 762,768 ****
  
  GCC looks in several different places for headers.  On a normal Unix
  system, if you do not instruct it otherwise, it will look for headers
! requested with `#include <FILE>' in:
  
       /usr/local/include
       LIBDIR/gcc/TARGET/VERSION/include
--- 758,764 ----
  
  GCC looks in several different places for headers.  On a normal Unix
  system, if you do not instruct it otherwise, it will look for headers
! requested with '#include <FILE>' in:
  
       /usr/local/include
       LIBDIR/gcc/TARGET/VERSION/include
*************** requested with `#include <FILE>' in:
*** 770,783 ****
       /usr/include
  
     For C++ programs, it will also look in
! `LIBDIR/../include/c++/VERSION', first.  In the above, TARGET is the
  canonical name of the system GCC was configured to compile code for;
  often but not always the same as the canonical name of the system it
  runs on.  VERSION is the version of GCC in use.
  
!    You can add to this list with the `-IDIR' command-line option.  All
! the directories named by `-I' are searched, in left-to-right order,
! _before_ the default directories.  The only exception is when `dir' is
  already searched by default.  In this case, the option is ignored and
  the search order for system directories remains unchanged.
  
--- 766,779 ----
       /usr/include
  
     For C++ programs, it will also look in
! 'LIBDIR/../include/c++/VERSION', first.  In the above, TARGET is the
  canonical name of the system GCC was configured to compile code for;
  often but not always the same as the canonical name of the system it
  runs on.  VERSION is the version of GCC in use.
  
!    You can add to this list with the '-IDIR' command-line option.  All
! the directories named by '-I' are searched, in left-to-right order,
! _before_ the default directories.  The only exception is when 'dir' is
  already searched by default.  In this case, the option is ignored and
  the search order for system directories remains unchanged.
  
*************** Thus, it is possible for a directory to
*** 787,824 ****
  chain if it was specified in both the quote and bracket chains.
  
     You can prevent GCC from searching any of the default directories
! with the `-nostdinc' option.  This is useful when you are compiling an
  operating system kernel or some other program that does not use the
! standard C library facilities, or the standard C library itself.  `-I'
! options are not ignored as described above when `-nostdinc' is in
  effect.
  
!    GCC looks for headers requested with `#include "FILE"' first in the
  directory containing the current file, then in the directories as
! specified by `-iquote' options, then in the same places it would have
  looked for a header requested with angle brackets.  For example, if
! `/usr/include/sys/stat.h' contains `#include "types.h"', GCC looks for
! `types.h' first in `/usr/include/sys', then in its usual search path.
  
!    `#line' (*note Line Control::) does not change GCC's idea of the
  directory containing the current file.
  
!    You may put `-I-' at any point in your list of `-I' options.  This
! has two effects.  First, directories appearing before the `-I-' in the
  list are searched only for headers requested with quote marks.
! Directories after `-I-' are searched for all headers.  Second, the
  directory containing the current file is not searched for anything,
! unless it happens to be one of the directories named by an `-I' switch.
! `-I-' is deprecated, `-iquote' should be used instead.
  
!    `-I. -I-' is not the same as no `-I' options at all, and does not
! cause the same behavior for `<>' includes that `""' includes get with
! no special options.  `-I.' searches the compiler's current working
  directory for header files.  That may or may not be the same as the
  directory containing the current file.
  
!    If you need to look for headers in a directory named `-', write
! `-I./-'.
  
     There are several more ways to adjust the header search path.  They
  are generally less useful.  *Note Invocation::.
--- 783,820 ----
  chain if it was specified in both the quote and bracket chains.
  
     You can prevent GCC from searching any of the default directories
! with the '-nostdinc' option.  This is useful when you are compiling an
  operating system kernel or some other program that does not use the
! standard C library facilities, or the standard C library itself.  '-I'
! options are not ignored as described above when '-nostdinc' is in
  effect.
  
!    GCC looks for headers requested with '#include "FILE"' first in the
  directory containing the current file, then in the directories as
! specified by '-iquote' options, then in the same places it would have
  looked for a header requested with angle brackets.  For example, if
! '/usr/include/sys/stat.h' contains '#include "types.h"', GCC looks for
! 'types.h' first in '/usr/include/sys', then in its usual search path.
  
!    '#line' (*note Line Control::) does not change GCC's idea of the
  directory containing the current file.
  
!    You may put '-I-' at any point in your list of '-I' options.  This
! has two effects.  First, directories appearing before the '-I-' in the
  list are searched only for headers requested with quote marks.
! Directories after '-I-' are searched for all headers.  Second, the
  directory containing the current file is not searched for anything,
! unless it happens to be one of the directories named by an '-I' switch.
! '-I-' is deprecated, '-iquote' should be used instead.
  
!    '-I. -I-' is not the same as no '-I' options at all, and does not
! cause the same behavior for '<>' includes that '""' includes get with no
! special options.  '-I.' searches the compiler's current working
  directory for header files.  That may or may not be the same as the
  directory containing the current file.
  
!    If you need to look for headers in a directory named '-', write
! '-I./-'.
  
     There are several more ways to adjust the header search path.  They
  are generally less useful.  *Note Invocation::.
*************** contents of the file in a conditional, l
*** 847,866 ****
  
     This construct is commonly known as a "wrapper #ifndef".  When the
  header is included again, the conditional will be false, because
! `FILE_FOO_SEEN' is defined.  The preprocessor will skip over the entire
  contents of the file, and the compiler will not see it twice.
  
     CPP optimizes even further.  It remembers when a header file has a
! wrapper `#ifndef'.  If a subsequent `#include' specifies that header,
! and the macro in the `#ifndef' is still defined, it does not bother to
  rescan the file at all.
  
     You can put comments outside the wrapper.  They will not interfere
  with this optimization.
  
!    The macro `FILE_FOO_SEEN' is called the "controlling macro" or
! "guard macro".  In a user header file, the macro name should not begin
! with `_'.  In a system header file, it should begin with `__' to avoid
  conflicts with user programs.  In any kind of header file, the macro
  name should contain the name of the file and some additional text, to
  avoid conflicts with other header files.
--- 843,862 ----
  
     This construct is commonly known as a "wrapper #ifndef".  When the
  header is included again, the conditional will be false, because
! 'FILE_FOO_SEEN' is defined.  The preprocessor will skip over the entire
  contents of the file, and the compiler will not see it twice.
  
     CPP optimizes even further.  It remembers when a header file has a
! wrapper '#ifndef'.  If a subsequent '#include' specifies that header,
! and the macro in the '#ifndef' is still defined, it does not bother to
  rescan the file at all.
  
     You can put comments outside the wrapper.  They will not interfere
  with this optimization.
  
!    The macro 'FILE_FOO_SEEN' is called the "controlling macro" or "guard
! macro".  In a user header file, the macro name should not begin with
! '_'.  In a system header file, it should begin with '__' to avoid
  conflicts with user programs.  In any kind of header file, the macro
  name should contain the name of the file and some additional text, to
  avoid conflicts with other header files.
*************** File: cpp.info,  Node: Alternatives to W
*** 872,906 ****
  ===================================
  
  CPP supports two more ways of indicating that a header file should be
! read only once.  Neither one is as portable as a wrapper `#ifndef' and
  we recommend you do not use them in new programs, with the caveat that
! `#import' is standard practice in Objective-C.
  
!    CPP supports a variant of `#include' called `#import' which includes
! a file, but does so at most once.  If you use `#import' instead of
! `#include', then you don't need the conditionals inside the header file
! to prevent multiple inclusion of the contents.  `#import' is standard
! in Objective-C, but is considered a deprecated extension in C and C++.
  
!    `#import' is not a well designed feature.  It requires the users of
! a header file to know that it should only be included once.  It is much
  better for the header file's implementor to write the file so that users
! don't need to know this.  Using a wrapper `#ifndef' accomplishes this
  goal.
  
!    In the present implementation, a single use of `#import' will
! prevent the file from ever being read again, by either `#import' or
! `#include'.  You should not rely on this; do not use both `#import' and
! `#include' to refer to the same header file.
  
     Another way to prevent a header file from being included more than
! once is with the `#pragma once' directive.  If `#pragma once' is seen
  when scanning a header file, that file will never be read again, no
  matter what.
  
!    `#pragma once' does not have the problems that `#import' does, but
! it is not recognized by all preprocessors, so you cannot rely on it in
! a portable program.
  
  
  File: cpp.info,  Node: Computed Includes,  Next: Wrapper Headers,  Prev: Alternatives to Wrapper #ifndef,  Up: Header Files
--- 868,902 ----
  ===================================
  
  CPP supports two more ways of indicating that a header file should be
! read only once.  Neither one is as portable as a wrapper '#ifndef' and
  we recommend you do not use them in new programs, with the caveat that
! '#import' is standard practice in Objective-C.
  
!    CPP supports a variant of '#include' called '#import' which includes
! a file, but does so at most once.  If you use '#import' instead of
! '#include', then you don't need the conditionals inside the header file
! to prevent multiple inclusion of the contents.  '#import' is standard in
! Objective-C, but is considered a deprecated extension in C and C++.
  
!    '#import' is not a well designed feature.  It requires the users of a
! header file to know that it should only be included once.  It is much
  better for the header file's implementor to write the file so that users
! don't need to know this.  Using a wrapper '#ifndef' accomplishes this
  goal.
  
!    In the present implementation, a single use of '#import' will prevent
! the file from ever being read again, by either '#import' or '#include'.
! You should not rely on this; do not use both '#import' and '#include' to
! refer to the same header file.
  
     Another way to prevent a header file from being included more than
! once is with the '#pragma once' directive.  If '#pragma once' is seen
  when scanning a header file, that file will never be read again, no
  matter what.
  
!    '#pragma once' does not have the problems that '#import' does, but it
! is not recognized by all preprocessors, so you cannot rely on it in a
! portable program.
  
  
  File: cpp.info,  Node: Computed Includes,  Next: Wrapper Headers,  Prev: Alternatives to Wrapper #ifndef,  Up: Header Files
*************** systems, for instance.  You could do thi
*** 924,950 ****
     That rapidly becomes tedious.  Instead, the preprocessor offers the
  ability to use a macro for the header name.  This is called a "computed
  include".  Instead of writing a header name as the direct argument of
! `#include', you simply put a macro name there instead:
  
       #define SYSTEM_H "system_1.h"
       ...
       #include SYSTEM_H
  
! `SYSTEM_H' will be expanded, and the preprocessor will look for
! `system_1.h' as if the `#include' had been written that way originally.
! `SYSTEM_H' could be defined by your Makefile with a `-D' option.
  
!    You must be careful when you define the macro.  `#define' saves
  tokens, not text.  The preprocessor has no way of knowing that the macro
! will be used as the argument of `#include', so it generates ordinary
  tokens, not a header name.  This is unlikely to cause problems if you
  use double-quote includes, which are close enough to string constants.
  If you use angle brackets, however, you may have trouble.
  
     The syntax of a computed include is actually a bit more general than
! the above.  If the first non-whitespace character after `#include' is
! not `"' or `<', then the entire line is macro-expanded like running
! text would be.
  
     If the line expands to a single string constant, the contents of that
  string constant are the file to be included.  CPP does not re-examine
--- 920,946 ----
     That rapidly becomes tedious.  Instead, the preprocessor offers the
  ability to use a macro for the header name.  This is called a "computed
  include".  Instead of writing a header name as the direct argument of
! '#include', you simply put a macro name there instead:
  
       #define SYSTEM_H "system_1.h"
       ...
       #include SYSTEM_H
  
! 'SYSTEM_H' will be expanded, and the preprocessor will look for
! 'system_1.h' as if the '#include' had been written that way originally.
! 'SYSTEM_H' could be defined by your Makefile with a '-D' option.
  
!    You must be careful when you define the macro.  '#define' saves
  tokens, not text.  The preprocessor has no way of knowing that the macro
! will be used as the argument of '#include', so it generates ordinary
  tokens, not a header name.  This is unlikely to cause problems if you
  use double-quote includes, which are close enough to string constants.
  If you use angle brackets, however, you may have trouble.
  
     The syntax of a computed include is actually a bit more general than
! the above.  If the first non-whitespace character after '#include' is
! not '"' or '<', then the entire line is macro-expanded like running text
! would be.
  
     If the line expands to a single string constant, the contents of that
  string constant are the file to be included.  CPP does not re-examine
*************** escapes in the string.  Therefore
*** 954,973 ****
       #define HEADER "a\"b"
       #include HEADER
  
! looks for a file named `a\"b'.  CPP searches for the file according to
  the rules for double-quoted includes.
  
!    If the line expands to a token stream beginning with a `<' token and
! including a `>' token, then the tokens between the `<' and the first
! `>' are combined to form the filename to be included.  Any whitespace
  between tokens is reduced to a single space; then any space after the
! initial `<' is retained, but a trailing space before the closing `>' is
  ignored.  CPP searches for the file according to the rules for
  angle-bracket includes.
  
     In either case, if there are any tokens on the line after the file
! name, an error occurs and the directive is not processed.  It is also
! an error if the result of expansion does not match either of the two
  expected forms.
  
     These rules are implementation-defined behavior according to the C
--- 950,969 ----
       #define HEADER "a\"b"
       #include HEADER
  
! looks for a file named 'a\"b'.  CPP searches for the file according to
  the rules for double-quoted includes.
  
!    If the line expands to a token stream beginning with a '<' token and
! including a '>' token, then the tokens between the '<' and the first '>'
! are combined to form the filename to be included.  Any whitespace
  between tokens is reduced to a single space; then any space after the
! initial '<' is retained, but a trailing space before the closing '>' is
  ignored.  CPP searches for the file according to the rules for
  angle-bracket includes.
  
     In either case, if there are any tokens on the line after the file
! name, an error occurs and the directive is not processed.  It is also an
! error if the result of expansion does not match either of the two
  expected forms.
  
     These rules are implementation-defined behavior according to the C
*************** File: cpp.info,  Node: Wrapper Headers,
*** 983,1030 ****
  ===================
  
  Sometimes it is necessary to adjust the contents of a system-provided
! header file without editing it directly.  GCC's `fixincludes' operation
  does this, for example.  One way to do that would be to create a new
  header file with the same name and insert it in the search path before
  the original header.  That works fine as long as you're willing to
  replace the old header entirely.  But what if you want to refer to the
  old header from the new one?
  
!    You cannot simply include the old header with `#include'.  That will
  start from the beginning, and find your new header again.  If your
  header is not protected from multiple inclusion (*note Once-Only
  Headers::), it will recurse infinitely and cause a fatal error.
  
     You could include the old header with an absolute pathname:
       #include "/usr/include/old-header.h"
!    This works, but is not clean; should the system headers ever move,
! you would have to edit the new headers to match.
  
     There is no way to solve this problem within the C standard, but you
! can use the GNU extension `#include_next'.  It means, "Include the
! _next_ file with this name".  This directive works like `#include'
! except in searching for the specified file: it starts searching the
! list of header file directories _after_ the directory in which the
! current file was found.
  
!    Suppose you specify `-I /usr/local/include', and the list of
! directories to search also includes `/usr/include'; and suppose both
! directories contain `signal.h'.  Ordinary `#include <signal.h>' finds
! the file under `/usr/local/include'.  If that file contains
! `#include_next <signal.h>', it starts searching after that directory,
! and finds the file in `/usr/include'.
  
!    `#include_next' does not distinguish between `<FILE>' and `"FILE"'
! inclusion, nor does it check that the file you specify has the same
! name as the current file.  It simply looks for the file named, starting
! with the directory in the search path after the one where the current
! file was found.
  
!    The use of `#include_next' can lead to great confusion.  We
! recommend it be used only when there is no other alternative.  In
! particular, it should not be used in the headers belonging to a specific
! program; it should be used only to make global corrections along the
! lines of `fixincludes'.
  
  
  File: cpp.info,  Node: System Headers,  Prev: Wrapper Headers,  Up: Header Files
--- 979,1026 ----
  ===================
  
  Sometimes it is necessary to adjust the contents of a system-provided
! header file without editing it directly.  GCC's 'fixincludes' operation
  does this, for example.  One way to do that would be to create a new
  header file with the same name and insert it in the search path before
  the original header.  That works fine as long as you're willing to
  replace the old header entirely.  But what if you want to refer to the
  old header from the new one?
  
!    You cannot simply include the old header with '#include'.  That will
  start from the beginning, and find your new header again.  If your
  header is not protected from multiple inclusion (*note Once-Only
  Headers::), it will recurse infinitely and cause a fatal error.
  
     You could include the old header with an absolute pathname:
       #include "/usr/include/old-header.h"
! This works, but is not clean; should the system headers ever move, you
! would have to edit the new headers to match.
  
     There is no way to solve this problem within the C standard, but you
! can use the GNU extension '#include_next'.  It means, "Include the
! _next_ file with this name".  This directive works like '#include'
! except in searching for the specified file: it starts searching the list
! of header file directories _after_ the directory in which the current
! file was found.
  
!    Suppose you specify '-I /usr/local/include', and the list of
! directories to search also includes '/usr/include'; and suppose both
! directories contain 'signal.h'.  Ordinary '#include <signal.h>' finds
! the file under '/usr/local/include'.  If that file contains
! '#include_next <signal.h>', it starts searching after that directory,
! and finds the file in '/usr/include'.
  
!    '#include_next' does not distinguish between '<FILE>' and '"FILE"'
! inclusion, nor does it check that the file you specify has the same name
! as the current file.  It simply looks for the file named, starting with
! the directory in the search path after the one where the current file
! was found.
  
!    The use of '#include_next' can lead to great confusion.  We recommend
! it be used only when there is no other alternative.  In particular, it
! should not be used in the headers belonging to a specific program; it
! should be used only to make global corrections along the lines of
! 'fixincludes'.
  
  
  File: cpp.info,  Node: System Headers,  Prev: Wrapper Headers,  Up: Header Files
*************** File: cpp.info,  Node: System Headers,
*** 1035,1072 ****
  The header files declaring interfaces to the operating system and
  runtime libraries often cannot be written in strictly conforming C.
  Therefore, GCC gives code found in "system headers" special treatment.
! All warnings, other than those generated by `#warning' (*note
  Diagnostics::), are suppressed while GCC is processing a system header.
  Macros defined in a system header are immune to a few warnings wherever
! they are expanded.  This immunity is granted on an ad-hoc basis, when
! we find that a warning generates lots of false positives because of
! code in macros defined in system headers.
  
     Normally, only the headers found in specific directories are
! considered system headers.  These directories are determined when GCC
! is compiled.  There are, however, two ways to make normal headers into
  system headers.
  
!    The `-isystem' command-line option adds its argument to the list of
! directories to search for headers, just like `-I'.  Any headers found
! in that directory will be considered system headers.
  
!    All directories named by `-isystem' are searched _after_ all
! directories named by `-I', no matter what their order was on the
! command line.  If the same directory is named by both `-I' and
! `-isystem', the `-I' option is ignored.  GCC provides an informative
! message when this occurs if `-v' is used.
  
!    There is also a directive, `#pragma GCC system_header', which tells
! GCC to consider the rest of the current include file a system header,
! no matter where it was found.  Code that comes before the `#pragma' in
! the file will not be affected.  `#pragma GCC system_header' has no
! effect in the primary source file.
  
     On very old systems, some of the pre-defined system header
  directories get even more special treatment.  GNU C++ considers code in
! headers found in those directories to be surrounded by an `extern "C"'
! block.  There is no way to request this behavior with a `#pragma', or
  from the command line.
  
  
--- 1031,1068 ----
  The header files declaring interfaces to the operating system and
  runtime libraries often cannot be written in strictly conforming C.
  Therefore, GCC gives code found in "system headers" special treatment.
! All warnings, other than those generated by '#warning' (*note
  Diagnostics::), are suppressed while GCC is processing a system header.
  Macros defined in a system header are immune to a few warnings wherever
! they are expanded.  This immunity is granted on an ad-hoc basis, when we
! find that a warning generates lots of false positives because of code in
! macros defined in system headers.
  
     Normally, only the headers found in specific directories are
! considered system headers.  These directories are determined when GCC is
! compiled.  There are, however, two ways to make normal headers into
  system headers.
  
!    The '-isystem' command-line option adds its argument to the list of
! directories to search for headers, just like '-I'.  Any headers found in
! that directory will be considered system headers.
  
!    All directories named by '-isystem' are searched _after_ all
! directories named by '-I', no matter what their order was on the command
! line.  If the same directory is named by both '-I' and '-isystem', the
! '-I' option is ignored.  GCC provides an informative message when this
! occurs if '-v' is used.
  
!    There is also a directive, '#pragma GCC system_header', which tells
! GCC to consider the rest of the current include file a system header, no
! matter where it was found.  Code that comes before the '#pragma' in the
! file will not be affected.  '#pragma GCC system_header' has no effect in
! the primary source file.
  
     On very old systems, some of the pre-defined system header
  directories get even more special treatment.  GNU C++ considers code in
! headers found in those directories to be surrounded by an 'extern "C"'
! block.  There is no way to request this behavior with a '#pragma', or
  from the command line.
  
  
*************** File: cpp.info,  Node: Macros,  Next: Co
*** 1077,1093 ****
  
  A "macro" is a fragment of code which has been given a name.  Whenever
  the name is used, it is replaced by the contents of the macro.  There
! are two kinds of macros.  They differ mostly in what they look like
! when they are used.  "Object-like" macros resemble data objects when
! used, "function-like" macros resemble function calls.
  
     You may define any valid identifier as a macro, even if it is a C
  keyword.  The preprocessor does not know anything about keywords.  This
! can be useful if you wish to hide a keyword such as `const' from an
  older compiler that does not understand it.  However, the preprocessor
! operator `defined' (*note Defined::) can never be defined as a macro,
! and C++'s named operators (*note C++ Named Operators::) cannot be
! macros when you are compiling C++.
  
  * Menu:
  
--- 1073,1089 ----
  
  A "macro" is a fragment of code which has been given a name.  Whenever
  the name is used, it is replaced by the contents of the macro.  There
! are two kinds of macros.  They differ mostly in what they look like when
! they are used.  "Object-like" macros resemble data objects when used,
! "function-like" macros resemble function calls.
  
     You may define any valid identifier as a macro, even if it is a C
  keyword.  The preprocessor does not know anything about keywords.  This
! can be useful if you wish to hide a keyword such as 'const' from an
  older compiler that does not understand it.  However, the preprocessor
! operator 'defined' (*note Defined::) can never be defined as a macro,
! and C++'s named operators (*note C++ Named Operators::) cannot be macros
! when you are compiling C++.
  
  * Menu:
  
*************** a code fragment.  It is called object-li
*** 1113,1133 ****
  object in code that uses it.  They are most commonly used to give
  symbolic names to numeric constants.
  
!    You create macros with the `#define' directive.  `#define' is
  followed by the name of the macro and then the token sequence it should
  be an abbreviation for, which is variously referred to as the macro's
  "body", "expansion" or "replacement list".  For example,
  
       #define BUFFER_SIZE 1024
  
! defines a macro named `BUFFER_SIZE' as an abbreviation for the token
! `1024'.  If somewhere after this `#define' directive there comes a C
  statement of the form
  
       foo = (char *) malloc (BUFFER_SIZE);
  
  then the C preprocessor will recognize and "expand" the macro
! `BUFFER_SIZE'.  The C compiler will see the same tokens as it would if
  you had written
  
       foo = (char *) malloc (1024);
--- 1109,1129 ----
  object in code that uses it.  They are most commonly used to give
  symbolic names to numeric constants.
  
!    You create macros with the '#define' directive.  '#define' is
  followed by the name of the macro and then the token sequence it should
  be an abbreviation for, which is variously referred to as the macro's
  "body", "expansion" or "replacement list".  For example,
  
       #define BUFFER_SIZE 1024
  
! defines a macro named 'BUFFER_SIZE' as an abbreviation for the token
! '1024'.  If somewhere after this '#define' directive there comes a C
  statement of the form
  
       foo = (char *) malloc (BUFFER_SIZE);
  
  then the C preprocessor will recognize and "expand" the macro
! 'BUFFER_SIZE'.  The C compiler will see the same tokens as it would if
  you had written
  
       foo = (char *) malloc (1024);
*************** you had written
*** 1136,1142 ****
  easier to read when it is possible to tell at a glance which names are
  macros.
  
!    The macro's body ends at the end of the `#define' line.  You may
  continue the definition onto multiple lines, if necessary, using
  backslash-newline.  When the macro is expanded, however, it will all
  come out on one line.  For example,
--- 1132,1138 ----
  easier to read when it is possible to tell at a glance which names are
  macros.
  
!    The macro's body ends at the end of the '#define' line.  You may
  continue the definition onto multiple lines, if necessary, using
  backslash-newline.  When the macro is expanded, however, it will all
  come out on one line.  For example,
*************** macros to expand.  For example,
*** 1178,1195 ****
            ==> BUFSIZE
            ==> 1024
  
! `TABLESIZE' is expanded first to produce `BUFSIZE', then that macro is
! expanded to produce the final result, `1024'.
  
!    Notice that `BUFSIZE' was not defined when `TABLESIZE' was defined.
! The `#define' for `TABLESIZE' uses exactly the expansion you
! specify--in this case, `BUFSIZE'--and does not check to see whether it
! too contains macro names.  Only when you _use_ `TABLESIZE' is the
! result of its expansion scanned for more macro names.
  
!    This makes a difference if you change the definition of `BUFSIZE' at
! some point in the source file.  `TABLESIZE', defined as shown, will
! always expand using the definition of `BUFSIZE' that is currently in
  effect:
  
       #define BUFSIZE 1020
--- 1174,1191 ----
            ==> BUFSIZE
            ==> 1024
  
! 'TABLESIZE' is expanded first to produce 'BUFSIZE', then that macro is
! expanded to produce the final result, '1024'.
  
!    Notice that 'BUFSIZE' was not defined when 'TABLESIZE' was defined.
! The '#define' for 'TABLESIZE' uses exactly the expansion you specify--in
! this case, 'BUFSIZE'--and does not check to see whether it too contains
! macro names.  Only when you _use_ 'TABLESIZE' is the result of its
! expansion scanned for more macro names.
  
!    This makes a difference if you change the definition of 'BUFSIZE' at
! some point in the source file.  'TABLESIZE', defined as shown, will
! always expand using the definition of 'BUFSIZE' that is currently in
  effect:
  
       #define BUFSIZE 1020
*************** effect:
*** 1197,1203 ****
       #undef BUFSIZE
       #define BUFSIZE 37
  
! Now `TABLESIZE' expands (in two stages) to `37'.
  
     If the expansion of a macro contains its own name, either directly or
  via intermediate macros, it is not expanded again when the expansion is
--- 1193,1199 ----
       #undef BUFSIZE
       #define BUFSIZE 37
  
! Now 'TABLESIZE' expands (in two stages) to '37'.
  
     If the expansion of a macro contains its own name, either directly or
  via intermediate macros, it is not expanded again when the expansion is
*************** File: cpp.info,  Node: Function-like Mac
*** 1211,1218 ****
  ========================
  
  You can also define macros whose use looks like a function call.  These
! are called "function-like macros".  To define a function-like macro,
! you use the same `#define' directive, but you put a pair of parentheses
  immediately after the macro name.  For example,
  
       #define lang_init()  c_init()
--- 1207,1214 ----
  ========================
  
  You can also define macros whose use looks like a function call.  These
! are called "function-like macros".  To define a function-like macro, you
! use the same '#define' directive, but you put a pair of parentheses
  immediately after the macro name.  For example,
  
       #define lang_init()  c_init()
*************** same name, and you wish to use the funct
*** 1230,1238 ****
         foo();
         funcptr = foo;
  
!    Here the call to `foo()' will use the macro, but the function
! pointer will get the address of the real function.  If the macro were to
! be expanded, it would cause a syntax error.
  
     If you put spaces between the macro name and the parentheses in the
  macro definition, that does not define a function-like macro, it defines
--- 1226,1234 ----
         foo();
         funcptr = foo;
  
!    Here the call to 'foo()' will use the macro, but the function pointer
! will get the address of the real function.  If the macro were to be
! expanded, it would cause a syntax error.
  
     If you put spaces between the macro name and the parentheses in the
  macro definition, that does not define a function-like macro, it defines
*************** parentheses.
*** 1245,1251 ****
  
     The first two pairs of parentheses in this expansion come from the
  macro.  The third is the pair that was originally after the macro
! invocation.  Since `lang_init' is an object-like macro, it does not
  consume those parentheses.
  
  
--- 1241,1247 ----
  
     The first two pairs of parentheses in this expansion come from the
  macro.  The third is the pair that was originally after the macro
! invocation.  Since 'lang_init' is an object-like macro, it does not
  consume those parentheses.
  
  
*************** File: cpp.info,  Node: Macro Arguments,
*** 1254,1264 ****
  3.3 Macro Arguments
  ===================
  
! Function-like macros can take "arguments", just like true functions.
! To define a macro that uses arguments, you insert "parameters" between
! the pair of parentheses in the macro definition that make the macro
! function-like.  The parameters must be valid C identifiers, separated
! by commas and optionally whitespace.
  
     To invoke a macro that takes arguments, you write the name of the
  macro followed by a list of "actual arguments" in parentheses, separated
--- 1250,1260 ----
  3.3 Macro Arguments
  ===================
  
! Function-like macros can take "arguments", just like true functions.  To
! define a macro that uses arguments, you insert "parameters" between the
! pair of parentheses in the macro definition that make the macro
! function-like.  The parameters must be valid C identifiers, separated by
! commas and optionally whitespace.
  
     To invoke a macro that takes arguments, you write the name of the
  macro followed by a list of "actual arguments" in parentheses, separated
*************** prevent a comma from separating argument
*** 1290,1308 ****
  
       macro (array[x = y, x + 1])
  
! passes two arguments to `macro': `array[x = y' and `x + 1]'.  If you
! want to supply `array[x = y, x + 1]' as an argument, you can write it
! as `array[(x = y, x + 1)]', which is equivalent C code.
  
     All arguments to a macro are completely macro-expanded before they
  are substituted into the macro body.  After substitution, the complete
  text is scanned again for macros to expand, including the arguments.
! This rule may seem strange, but it is carefully designed so you need
! not worry about whether any function call is actually a macro
! invocation.  You can run into trouble if you try to be too clever,
! though.  *Note Argument Prescan::, for detailed discussion.
  
!    For example, `min (min (a, b), c)' is first expanded to
  
         min (((a) < (b) ? (a) : (b)), (c))
  
--- 1286,1304 ----
  
       macro (array[x = y, x + 1])
  
! passes two arguments to 'macro': 'array[x = y' and 'x + 1]'.  If you
! want to supply 'array[x = y, x + 1]' as an argument, you can write it as
! 'array[(x = y, x + 1)]', which is equivalent C code.
  
     All arguments to a macro are completely macro-expanded before they
  are substituted into the macro body.  After substitution, the complete
  text is scanned again for macros to expand, including the arguments.
! This rule may seem strange, but it is carefully designed so you need not
! worry about whether any function call is actually a macro invocation.
! You can run into trouble if you try to be too clever, though.  *Note
! Argument Prescan::, for detailed discussion.
  
!    For example, 'min (min (a, b), c)' is first expanded to
  
         min (((a) < (b) ? (a) : (b)), (c))
  
*************** and then to
*** 1318,1339 ****
  preprocessor (but many macros will then expand to invalid code).  You
  cannot leave out arguments entirely; if a macro takes two arguments,
  there must be exactly one comma at the top level of its argument list.
! Here are some silly examples using `min':
  
       min(, b)        ==> ((   ) < (b) ? (   ) : (b))
       min(a, )        ==> ((a  ) < ( ) ? (a  ) : ( ))
       min(,)          ==> ((   ) < ( ) ? (   ) : ( ))
       min((,),)       ==> (((,)) < ( ) ? ((,)) : ( ))
  
!      min()      error--> macro "min" requires 2 arguments, but only 1 given
!      min(,,)    error--> macro "min" passed 3 arguments, but takes just 2
  
!    Whitespace is not a preprocessing token, so if a macro `foo' takes
! one argument, `foo ()' and `foo ( )' both supply it an empty argument.
  Previous GNU preprocessor implementations and documentation were
! incorrect on this point, insisting that a function-like macro that
! takes a single argument be passed a space if an empty argument was
! required.
  
     Macro parameters appearing inside string literals are not replaced by
  their corresponding actual arguments.
--- 1314,1334 ----
  preprocessor (but many macros will then expand to invalid code).  You
  cannot leave out arguments entirely; if a macro takes two arguments,
  there must be exactly one comma at the top level of its argument list.
! Here are some silly examples using 'min':
  
       min(, b)        ==> ((   ) < (b) ? (   ) : (b))
       min(a, )        ==> ((a  ) < ( ) ? (a  ) : ( ))
       min(,)          ==> ((   ) < ( ) ? (   ) : ( ))
       min((,),)       ==> (((,)) < ( ) ? ((,)) : ( ))
  
!      min()      error-> macro "min" requires 2 arguments, but only 1 given
!      min(,,)    error-> macro "min" passed 3 arguments, but takes just 2
  
!    Whitespace is not a preprocessing token, so if a macro 'foo' takes
! one argument, 'foo ()' and 'foo ( )' both supply it an empty argument.
  Previous GNU preprocessor implementations and documentation were
! incorrect on this point, insisting that a function-like macro that takes
! a single argument be passed a space if an empty argument was required.
  
     Macro parameters appearing inside string literals are not replaced by
  their corresponding actual arguments.
*************** File: cpp.info,  Node: Stringification,
*** 1349,1356 ****
  
  Sometimes you may want to convert a macro argument into a string
  constant.  Parameters are not replaced inside string constants, but you
! can use the `#' preprocessing operator instead.  When a macro parameter
! is used with a leading `#', the preprocessor replaces it with the
  literal text of the actual argument, converted to a string constant.
  Unlike normal parameter replacement, the argument is not macro-expanded
  first.  This is called "stringification".
--- 1344,1351 ----
  
  Sometimes you may want to convert a macro argument into a string
  constant.  Parameters are not replaced inside string constants, but you
! can use the '#' preprocessing operator instead.  When a macro parameter
! is used with a leading '#', the preprocessor replaces it with the
  literal text of the actual argument, converted to a string constant.
  Unlike normal parameter replacement, the argument is not macro-expanded
  first.  This is called "stringification".
*************** first.  This is called "stringification"
*** 1358,1366 ****
     There is no way to combine an argument with surrounding text and
  stringify it all together.  Instead, you can write a series of adjacent
  string constants and stringified arguments.  The preprocessor will
! replace the stringified arguments with string constants.  The C
! compiler will then combine all the adjacent string constants into one
! long string.
  
     Here is an example of a macro definition that uses stringification:
  
--- 1353,1361 ----
     There is no way to combine an argument with surrounding text and
  stringify it all together.  Instead, you can write a series of adjacent
  string constants and stringified arguments.  The preprocessor will
! replace the stringified arguments with string constants.  The C compiler
! will then combine all the adjacent string constants into one long
! string.
  
     Here is an example of a macro definition that uses stringification:
  
*************** long string.
*** 1372,1394 ****
            ==> do { if (x == 0)
                  fprintf (stderr, "Warning: " "x == 0" "\n"); } while (0);
  
! The argument for `EXP' is substituted once, as-is, into the `if'
! statement, and once, stringified, into the argument to `fprintf'.  If
! `x' were a macro, it would be expanded in the `if' statement, but not
! in the string.
  
!    The `do' and `while (0)' are a kludge to make it possible to write
! `WARN_IF (ARG);', which the resemblance of `WARN_IF' to a function
! would make C programmers want to do; see *note Swallowing the
! Semicolon::.
  
     Stringification in C involves more than putting double-quote
  characters around the fragment.  The preprocessor backslash-escapes the
! quotes surrounding embedded string constants, and all backslashes
! within string and character constants, in order to get a valid C string
! constant with the proper contents.  Thus, stringifying `p = "foo\n";'
  results in "p = \"foo\\n\";".  However, backslashes that are not inside
! string or character constants are not duplicated: `\n' by itself
  stringifies to "\n".
  
     All leading and trailing whitespace in text being stringified is
--- 1367,1388 ----
            ==> do { if (x == 0)
                  fprintf (stderr, "Warning: " "x == 0" "\n"); } while (0);
  
! The argument for 'EXP' is substituted once, as-is, into the 'if'
! statement, and once, stringified, into the argument to 'fprintf'.  If
! 'x' were a macro, it would be expanded in the 'if' statement, but not in
! the string.
  
!    The 'do' and 'while (0)' are a kludge to make it possible to write
! 'WARN_IF (ARG);', which the resemblance of 'WARN_IF' to a function would
! make C programmers want to do; see *note Swallowing the Semicolon::.
  
     Stringification in C involves more than putting double-quote
  characters around the fragment.  The preprocessor backslash-escapes the
! quotes surrounding embedded string constants, and all backslashes within
! string and character constants, in order to get a valid C string
! constant with the proper contents.  Thus, stringifying 'p = "foo\n";'
  results in "p = \"foo\\n\";".  However, backslashes that are not inside
! string or character constants are not duplicated: '\n' by itself
  stringifies to "\n".
  
     All leading and trailing whitespace in text being stringified is
*************** you have to use two levels of macros.
*** 1413,1423 ****
            ==> str (4)
            ==> "4"
  
!    `s' is stringified when it is used in `str', so it is not
! macro-expanded first.  But `s' is an ordinary argument to `xstr', so it
! is completely macro-expanded before `xstr' itself is expanded (*note
! Argument Prescan::).  Therefore, by the time `str' gets to its
! argument, it has already been macro-expanded.
  
  
  File: cpp.info,  Node: Concatenation,  Next: Variadic Macros,  Prev: Stringification,  Up: Macros
--- 1407,1417 ----
            ==> str (4)
            ==> "4"
  
!    's' is stringified when it is used in 'str', so it is not
! macro-expanded first.  But 's' is an ordinary argument to 'xstr', so it
! is completely macro-expanded before 'xstr' itself is expanded (*note
! Argument Prescan::).  Therefore, by the time 'str' gets to its argument,
! it has already been macro-expanded.
  
  
  File: cpp.info,  Node: Concatenation,  Next: Variadic Macros,  Prev: Stringification,  Up: Macros
*************** File: cpp.info,  Node: Concatenation,  N
*** 1426,1464 ****
  =================
  
  It is often useful to merge two tokens into one while expanding macros.
! This is called "token pasting" or "token concatenation".  The `##'
  preprocessing operator performs token pasting.  When a macro is
! expanded, the two tokens on either side of each `##' operator are
! combined into a single token, which then replaces the `##' and the two
  original tokens in the macro expansion.  Usually both will be
  identifiers, or one will be an identifier and the other a preprocessing
  number.  When pasted, they make a longer identifier.  This isn't the
  only valid case.  It is also possible to concatenate two numbers (or a
! number and a name, such as `1.5' and `e3') into a number.  Also,
! multi-character operators such as `+=' can be formed by token pasting.
  
     However, two tokens that don't together form a valid token cannot be
! pasted together.  For example, you cannot concatenate `x' with `+' in
  either order.  If you try, the preprocessor issues a warning and emits
  the two tokens.  Whether it puts white space between the tokens is
! undefined.  It is common to find unnecessary uses of `##' in complex
  macros.  If you get this warning, it is likely that you can simply
! remove the `##'.
  
!    Both the tokens combined by `##' could come from the macro body, but
  you could just as well write them as one token in the first place.
  Token pasting is most useful when one or both of the tokens comes from a
! macro argument.  If either of the tokens next to an `##' is a parameter
! name, it is replaced by its actual argument before `##' executes.  As
  with stringification, the actual argument is not macro-expanded first.
! If the argument is empty, that `##' has no effect.
  
     Keep in mind that the C preprocessor converts comments to whitespace
  before macros are even considered.  Therefore, you cannot create a
! comment by concatenating `/' and `*'.  You can put as much whitespace
! between `##' and its operands as you like, including comments, and you
! can put comments in arguments that will be concatenated.  However, it
! is an error if `##' appears at either end of a macro body.
  
     Consider a C program that interprets named commands.  There probably
  needs to be a table of commands, perhaps an array of structures declared
--- 1420,1458 ----
  =================
  
  It is often useful to merge two tokens into one while expanding macros.
! This is called "token pasting" or "token concatenation".  The '##'
  preprocessing operator performs token pasting.  When a macro is
! expanded, the two tokens on either side of each '##' operator are
! combined into a single token, which then replaces the '##' and the two
  original tokens in the macro expansion.  Usually both will be
  identifiers, or one will be an identifier and the other a preprocessing
  number.  When pasted, they make a longer identifier.  This isn't the
  only valid case.  It is also possible to concatenate two numbers (or a
! number and a name, such as '1.5' and 'e3') into a number.  Also,
! multi-character operators such as '+=' can be formed by token pasting.
  
     However, two tokens that don't together form a valid token cannot be
! pasted together.  For example, you cannot concatenate 'x' with '+' in
  either order.  If you try, the preprocessor issues a warning and emits
  the two tokens.  Whether it puts white space between the tokens is
! undefined.  It is common to find unnecessary uses of '##' in complex
  macros.  If you get this warning, it is likely that you can simply
! remove the '##'.
  
!    Both the tokens combined by '##' could come from the macro body, but
  you could just as well write them as one token in the first place.
  Token pasting is most useful when one or both of the tokens comes from a
! macro argument.  If either of the tokens next to an '##' is a parameter
! name, it is replaced by its actual argument before '##' executes.  As
  with stringification, the actual argument is not macro-expanded first.
! If the argument is empty, that '##' has no effect.
  
     Keep in mind that the C preprocessor converts comments to whitespace
  before macros are even considered.  Therefore, you cannot create a
! comment by concatenating '/' and '*'.  You can put as much whitespace
! between '##' and its operands as you like, including comments, and you
! can put comments in arguments that will be concatenated.  However, it is
! an error if '##' appears at either end of a macro body.
  
     Consider a C program that interprets named commands.  There probably
  needs to be a table of commands, perhaps an array of structures declared
*************** as follows:
*** 1477,1488 ****
         ...
       };
  
!    It would be cleaner not to have to give each command name twice,
! once in the string constant and once in the function name.  A macro
! which takes the name of a command as an argument can make this
! unnecessary.  The string constant can be created with stringification,
! and the function name by concatenating the argument with `_command'.
! Here is how it is done:
  
       #define COMMAND(NAME)  { #NAME, NAME ## _command }
  
--- 1471,1482 ----
         ...
       };
  
!    It would be cleaner not to have to give each command name twice, once
! in the string constant and once in the function name.  A macro which
! takes the name of a command as an argument can make this unnecessary.
! The string constant can be created with stringification, and the
! function name by concatenating the argument with '_command'.  Here is
! how it is done:
  
       #define COMMAND(NAME)  { #NAME, NAME ## _command }
  
*************** a function.  Here is an example:
*** 1508,1514 ****
     This kind of macro is called "variadic".  When the macro is invoked,
  all the tokens in its argument list after the last named argument (this
  macro has none), including any commas, become the "variable argument".
! This sequence of tokens replaces the identifier `__VA_ARGS__' in the
  macro body wherever it appears.  Thus, we have this expansion:
  
       eprintf ("%s:%d: ", input_file, lineno)
--- 1502,1508 ----
     This kind of macro is called "variadic".  When the macro is invoked,
  all the tokens in its argument list after the last named argument (this
  macro has none), including any commas, become the "variable argument".
! This sequence of tokens replaces the identifier '__VA_ARGS__' in the
  macro body wherever it appears.  Thus, we have this expansion:
  
       eprintf ("%s:%d: ", input_file, lineno)
*************** macro body wherever it appears.  Thus, w
*** 1516,1538 ****
  
     The variable argument is completely macro-expanded before it is
  inserted into the macro expansion, just like an ordinary argument.  You
! may use the `#' and `##' operators to stringify the variable argument
! or to paste its leading or trailing token with another token.  (But see
! below for an important special case for `##'.)
  
     If your macro is complicated, you may want a more descriptive name
! for the variable argument than `__VA_ARGS__'.  CPP permits this, as an
! extension.  You may write an argument name immediately before the
! `...'; that name is used for the variable argument.  The `eprintf'
! macro above could be written
  
       #define eprintf(args...) fprintf (stderr, args)
  
! using this extension.  You cannot use `__VA_ARGS__' and this extension
  in the same macro.
  
     You can have named arguments as well as variable arguments in a
! variadic macro.  We could define `eprintf' like this, instead:
  
       #define eprintf(format, ...) fprintf (stderr, format, __VA_ARGS__)
  
--- 1510,1532 ----
  
     The variable argument is completely macro-expanded before it is
  inserted into the macro expansion, just like an ordinary argument.  You
! may use the '#' and '##' operators to stringify the variable argument or
! to paste its leading or trailing token with another token.  (But see
! below for an important special case for '##'.)
  
     If your macro is complicated, you may want a more descriptive name
! for the variable argument than '__VA_ARGS__'.  CPP permits this, as an
! extension.  You may write an argument name immediately before the '...';
! that name is used for the variable argument.  The 'eprintf' macro above
! could be written
  
       #define eprintf(args...) fprintf (stderr, args)
  
! using this extension.  You cannot use '__VA_ARGS__' and this extension
  in the same macro.
  
     You can have named arguments as well as variable arguments in a
! variadic macro.  We could define 'eprintf' like this, instead:
  
       #define eprintf(format, ...) fprintf (stderr, format, __VA_ARGS__)
  
*************** This formulation looks more descriptive,
*** 1540,1547 ****
  flexible: you must now supply at least one argument after the format
  string.  In standard C, you cannot omit the comma separating the named
  argument from the variable arguments.  Furthermore, if you leave the
! variable argument empty, you will get a syntax error, because there
! will be an extra comma after the format string.
  
       eprintf("success!\n", );
            ==> fprintf(stderr, "success!\n", );
--- 1534,1541 ----
  flexible: you must now supply at least one argument after the format
  string.  In standard C, you cannot omit the comma separating the named
  argument from the variable arguments.  Furthermore, if you leave the
! variable argument empty, you will get a syntax error, because there will
! be an extra comma after the format string.
  
       eprintf("success!\n", );
            ==> fprintf(stderr, "success!\n", );
*************** First, you are allowed to leave the vari
*** 1552,1597 ****
       eprintf ("success!\n")
            ==> fprintf(stderr, "success!\n", );
  
! Second, the `##' token paste operator has a special meaning when placed
  between a comma and a variable argument.  If you write
  
       #define eprintf(format, ...) fprintf (stderr, format, ##__VA_ARGS__)
  
! and the variable argument is left out when the `eprintf' macro is used,
! then the comma before the `##' will be deleted.  This does _not_ happen
! if you pass an empty argument, nor does it happen if the token
! preceding `##' is anything other than a comma.
  
       eprintf ("success!\n")
            ==> fprintf(stderr, "success!\n");
  
  The above explanation is ambiguous about the case where the only macro
! parameter is a variable arguments parameter, as it is meaningless to
! try to distinguish whether no argument at all is an empty argument or a
! missing argument.  In this case the C99 standard is clear that the
! comma must remain, however the existing GCC extension used to swallow
! the comma.  So CPP retains the comma when conforming to a specific C
  standard, and drops it otherwise.
  
!    C99 mandates that the only place the identifier `__VA_ARGS__' can
  appear is in the replacement list of a variadic macro.  It may not be
! used as a macro name, macro argument name, or within a different type
! of macro.  It may also be forbidden in open text; the standard is
  ambiguous.  We recommend you avoid using it except for its defined
  purpose.
  
     Variadic macros are a new feature in C99.  GNU CPP has supported them
! for a long time, but only with a named variable argument (`args...',
! not `...' and `__VA_ARGS__').  If you are concerned with portability to
  previous versions of GCC, you should use only named variable arguments.
  On the other hand, if you are concerned with portability to other
! conforming implementations of C99, you should use only `__VA_ARGS__'.
  
     Previous versions of CPP implemented the comma-deletion extension
  much more generally.  We have restricted it in this release to minimize
  the differences from C99.  To get the same effect with both this and
! previous versions of GCC, the token preceding the special `##' must be
! a comma, and there must be white space between that comma and whatever
  comes immediately before it:
  
       #define eprintf(format, args...) fprintf (stderr, format , ##args)
--- 1546,1591 ----
       eprintf ("success!\n")
            ==> fprintf(stderr, "success!\n", );
  
! Second, the '##' token paste operator has a special meaning when placed
  between a comma and a variable argument.  If you write
  
       #define eprintf(format, ...) fprintf (stderr, format, ##__VA_ARGS__)
  
! and the variable argument is left out when the 'eprintf' macro is used,
! then the comma before the '##' will be deleted.  This does _not_ happen
! if you pass an empty argument, nor does it happen if the token preceding
! '##' is anything other than a comma.
  
       eprintf ("success!\n")
            ==> fprintf(stderr, "success!\n");
  
  The above explanation is ambiguous about the case where the only macro
! parameter is a variable arguments parameter, as it is meaningless to try
! to distinguish whether no argument at all is an empty argument or a
! missing argument.  In this case the C99 standard is clear that the comma
! must remain, however the existing GCC extension used to swallow the
! comma.  So CPP retains the comma when conforming to a specific C
  standard, and drops it otherwise.
  
!    C99 mandates that the only place the identifier '__VA_ARGS__' can
  appear is in the replacement list of a variadic macro.  It may not be
! used as a macro name, macro argument name, or within a different type of
! macro.  It may also be forbidden in open text; the standard is
  ambiguous.  We recommend you avoid using it except for its defined
  purpose.
  
     Variadic macros are a new feature in C99.  GNU CPP has supported them
! for a long time, but only with a named variable argument ('args...', not
! '...' and '__VA_ARGS__').  If you are concerned with portability to
  previous versions of GCC, you should use only named variable arguments.
  On the other hand, if you are concerned with portability to other
! conforming implementations of C99, you should use only '__VA_ARGS__'.
  
     Previous versions of CPP implemented the comma-deletion extension
  much more generally.  We have restricted it in this release to minimize
  the differences from C99.  To get the same effect with both this and
! previous versions of GCC, the token preceding the special '##' must be a
! comma, and there must be white space between that comma and whatever
  comes immediately before it:
  
       #define eprintf(format, args...) fprintf (stderr, format , ##args)
*************** File: cpp.info,  Node: Standard Predefin
*** 1625,1649 ****
  --------------------------------
  
  The standard predefined macros are specified by the relevant language
! standards, so they are available with all compilers that implement
! those standards.  Older compilers may not provide all of them.  Their
! names all start with double underscores.
  
! `__FILE__'
       This macro expands to the name of the current input file, in the
       form of a C string constant.  This is the path by which the
       preprocessor opened the file, not the short name specified in
!      `#include' or as the input file name argument.  For example,
!      `"/usr/local/include/myheader.h"' is a possible expansion of this
       macro.
  
! `__LINE__'
!      This macro expands to the current input line number, in the form
!      of a decimal integer constant.  While we call it a predefined
!      macro, it's a pretty strange macro, since its "definition" changes
!      with each new line of source code.
  
!    `__FILE__' and `__LINE__' are useful in generating an error message
  to report an inconsistency detected by the program; the message can
  state the source line at which the inconsistency was detected.  For
  example,
--- 1619,1643 ----
  --------------------------------
  
  The standard predefined macros are specified by the relevant language
! standards, so they are available with all compilers that implement those
! standards.  Older compilers may not provide all of them.  Their names
! all start with double underscores.
  
! '__FILE__'
       This macro expands to the name of the current input file, in the
       form of a C string constant.  This is the path by which the
       preprocessor opened the file, not the short name specified in
!      '#include' or as the input file name argument.  For example,
!      '"/usr/local/include/myheader.h"' is a possible expansion of this
       macro.
  
! '__LINE__'
!      This macro expands to the current input line number, in the form of
!      a decimal integer constant.  While we call it a predefined macro,
!      it's a pretty strange macro, since its "definition" changes with
!      each new line of source code.
  
!    '__FILE__' and '__LINE__' are useful in generating an error message
  to report an inconsistency detected by the program; the message can
  state the source line at which the inconsistency was detected.  For
  example,
*************** example,
*** 1653,1755 ****
                        "%d at %s, line %d.",
                length, __FILE__, __LINE__);
  
!    An `#include' directive changes the expansions of `__FILE__' and
! `__LINE__' to correspond to the included file.  At the end of that
! file, when processing resumes on the input file that contained the
! `#include' directive, the expansions of `__FILE__' and `__LINE__'
! revert to the values they had before the `#include' (but `__LINE__' is
! then incremented by one as processing moves to the line after the
! `#include').
  
!    A `#line' directive changes `__LINE__', and may change `__FILE__' as
  well.  *Note Line Control::.
  
!    C99 introduces `__func__', and GCC has provided `__FUNCTION__' for a
! long time.  Both of these are strings containing the name of the
! current function (there are slight semantic differences; see the GCC
! manual).  Neither of them is a macro; the preprocessor does not know the
! name of the current function.  They tend to be useful in conjunction
! with `__FILE__' and `__LINE__', though.
  
! `__DATE__'
       This macro expands to a string constant that describes the date on
       which the preprocessor is being run.  The string constant contains
!      eleven characters and looks like `"Feb 12 1996"'.  If the day of
       the month is less than 10, it is padded with a space on the left.
  
       If GCC cannot determine the current date, it will emit a warning
!      message (once per compilation) and `__DATE__' will expand to
!      `"??? ?? ????"'.
  
! `__TIME__'
       This macro expands to a string constant that describes the time at
       which the preprocessor is being run.  The string constant contains
!      eight characters and looks like `"23:59:01"'.
  
       If GCC cannot determine the current time, it will emit a warning
!      message (once per compilation) and `__TIME__' will expand to
!      `"??:??:??"'.
  
! `__STDC__'
       In normal operation, this macro expands to the constant 1, to
       signify that this compiler conforms to ISO Standard C.  If GNU CPP
       is used with a compiler other than GCC, this is not necessarily
       true; however, the preprocessor always conforms to the standard
!      unless the `-traditional-cpp' option is used.
  
!      This macro is not defined if the `-traditional-cpp' option is used.
  
       On some hosts, the system compiler uses a different convention,
!      where `__STDC__' is normally 0, but is 1 if the user specifies
       strict conformance to the C Standard.  CPP follows the host
!      convention when processing system header files, but when
!      processing user files `__STDC__' is always 1.  This has been
!      reported to cause problems; for instance, some versions of Solaris
!      provide X Windows headers that expect `__STDC__' to be either
!      undefined or 1.  *Note Invocation::.
  
! `__STDC_VERSION__'
       This macro expands to the C Standard's version number, a long
!      integer constant of the form `YYYYMML' where YYYY and MM are the
       year and month of the Standard version.  This signifies which
       version of the C Standard the compiler conforms to.  Like
!      `__STDC__', this is not necessarily accurate for the entire
       implementation, unless GNU CPP is being used with GCC.
  
!      The value `199409L' signifies the 1989 C standard as amended in
!      1994, which is the current default; the value `199901L' signifies
!      the 1999 revision of the C standard.  Support for the 1999
!      revision is not yet complete.
  
!      This macro is not defined if the `-traditional-cpp' option is
!      used, nor when compiling C++ or Objective-C.
  
! `__STDC_HOSTED__'
       This macro is defined, with value 1, if the compiler's target is a
       "hosted environment".  A hosted environment has the complete
       facilities of the standard C library available.
  
! `__cplusplus'
       This macro is defined when the C++ compiler is in use.  You can use
!      `__cplusplus' to test whether a header is compiled by a C compiler
!      or a C++ compiler.  This macro is similar to `__STDC_VERSION__', in
       that it expands to a version number.  Depending on the language
!      standard selected, the value of the macro is `199711L', as
!      mandated by the 1998 C++ standard; `201103L', per the 2011 C++
!      standard; an unspecified value strictly larger than `201103L' for
!      the experimental languages enabled by `-std=c++1y' and
!      `-std=gnu++1y'.
  
! `__OBJC__'
       This macro is defined, with value 1, when the Objective-C compiler
!      is in use.  You can use `__OBJC__' to test whether a header is
       compiled by a C compiler or an Objective-C compiler.
  
! `__ASSEMBLER__'
       This macro is defined with value 1 when preprocessing assembly
       language.
  
- 
  
  File: cpp.info,  Node: Common Predefined Macros,  Next: System-specific Predefined Macros,  Prev: Standard Predefined Macros,  Up: Predefined Macros
  
--- 1647,1747 ----
                        "%d at %s, line %d.",
                length, __FILE__, __LINE__);
  
!    An '#include' directive changes the expansions of '__FILE__' and
! '__LINE__' to correspond to the included file.  At the end of that file,
! when processing resumes on the input file that contained the '#include'
! directive, the expansions of '__FILE__' and '__LINE__' revert to the
! values they had before the '#include' (but '__LINE__' is then
! incremented by one as processing moves to the line after the
! '#include').
  
!    A '#line' directive changes '__LINE__', and may change '__FILE__' as
  well.  *Note Line Control::.
  
!    C99 introduces '__func__', and GCC has provided '__FUNCTION__' for a
! long time.  Both of these are strings containing the name of the current
! function (there are slight semantic differences; see the GCC manual).
! Neither of them is a macro; the preprocessor does not know the name of
! the current function.  They tend to be useful in conjunction with
! '__FILE__' and '__LINE__', though.
  
! '__DATE__'
       This macro expands to a string constant that describes the date on
       which the preprocessor is being run.  The string constant contains
!      eleven characters and looks like '"Feb 12 1996"'.  If the day of
       the month is less than 10, it is padded with a space on the left.
  
       If GCC cannot determine the current date, it will emit a warning
!      message (once per compilation) and '__DATE__' will expand to
!      '"??? ?? ????"'.
  
! '__TIME__'
       This macro expands to a string constant that describes the time at
       which the preprocessor is being run.  The string constant contains
!      eight characters and looks like '"23:59:01"'.
  
       If GCC cannot determine the current time, it will emit a warning
!      message (once per compilation) and '__TIME__' will expand to
!      '"??:??:??"'.
  
! '__STDC__'
       In normal operation, this macro expands to the constant 1, to
       signify that this compiler conforms to ISO Standard C.  If GNU CPP
       is used with a compiler other than GCC, this is not necessarily
       true; however, the preprocessor always conforms to the standard
!      unless the '-traditional-cpp' option is used.
  
!      This macro is not defined if the '-traditional-cpp' option is used.
  
       On some hosts, the system compiler uses a different convention,
!      where '__STDC__' is normally 0, but is 1 if the user specifies
       strict conformance to the C Standard.  CPP follows the host
!      convention when processing system header files, but when processing
!      user files '__STDC__' is always 1.  This has been reported to cause
!      problems; for instance, some versions of Solaris provide X Windows
!      headers that expect '__STDC__' to be either undefined or 1.  *Note
!      Invocation::.
  
! '__STDC_VERSION__'
       This macro expands to the C Standard's version number, a long
!      integer constant of the form 'YYYYMML' where YYYY and MM are the
       year and month of the Standard version.  This signifies which
       version of the C Standard the compiler conforms to.  Like
!      '__STDC__', this is not necessarily accurate for the entire
       implementation, unless GNU CPP is being used with GCC.
  
!      The value '199409L' signifies the 1989 C standard as amended in
!      1994, which is the current default; the value '199901L' signifies
!      the 1999 revision of the C standard.  Support for the 1999 revision
!      is not yet complete.
  
!      This macro is not defined if the '-traditional-cpp' option is used,
!      nor when compiling C++ or Objective-C.
  
! '__STDC_HOSTED__'
       This macro is defined, with value 1, if the compiler's target is a
       "hosted environment".  A hosted environment has the complete
       facilities of the standard C library available.
  
! '__cplusplus'
       This macro is defined when the C++ compiler is in use.  You can use
!      '__cplusplus' to test whether a header is compiled by a C compiler
!      or a C++ compiler.  This macro is similar to '__STDC_VERSION__', in
       that it expands to a version number.  Depending on the language
!      standard selected, the value of the macro is '199711L', as mandated
!      by the 1998 C++ standard; '201103L', per the 2011 C++ standard; an
!      unspecified value strictly larger than '201103L' for the
!      experimental languages enabled by '-std=c++1y' and '-std=gnu++1y'.
  
! '__OBJC__'
       This macro is defined, with value 1, when the Objective-C compiler
!      is in use.  You can use '__OBJC__' to test whether a header is
       compiled by a C compiler or an Objective-C compiler.
  
! '__ASSEMBLER__'
       This macro is defined with value 1 when preprocessing assembly
       language.
  
  
  File: cpp.info,  Node: Common Predefined Macros,  Next: System-specific Predefined Macros,  Prev: Standard Predefined Macros,  Up: Predefined Macros
  
*************** with the same meanings regardless of the
*** 1761,1802 ****
  which you are using GNU C or GNU Fortran.  Their names all start with
  double underscores.
  
! `__COUNTER__'
       This macro expands to sequential integral values starting from 0.
!      In conjunction with the `##' operator, this provides a convenient
!      means to generate unique identifiers.  Care must be taken to
!      ensure that `__COUNTER__' is not expanded prior to inclusion of
       precompiled headers which use it.  Otherwise, the precompiled
       headers will not be used.
  
! `__GFORTRAN__'
       The GNU Fortran compiler defines this.
  
! `__GNUC__'
! `__GNUC_MINOR__'
! `__GNUC_PATCHLEVEL__'
       These macros are defined by all GNU compilers that use the C
       preprocessor: C, C++, Objective-C and Fortran.  Their values are
       the major version, minor version, and patch level of the compiler,
       as integer constants.  For example, GCC 3.2.1 will define
!      `__GNUC__' to 3, `__GNUC_MINOR__' to 2, and `__GNUC_PATCHLEVEL__'
!      to 1.  These macros are also defined if you invoke the
!      preprocessor directly.
  
!      `__GNUC_PATCHLEVEL__' is new to GCC 3.0; it is also present in the
       widely-used development snapshots leading up to 3.0 (which identify
       themselves as GCC 2.96 or 2.97, depending on which snapshot you
       have).
  
       If all you need to know is whether or not your program is being
       compiled by GCC, or a non-GCC compiler that claims to accept the
!      GNU C dialects, you can simply test `__GNUC__'.  If you need to
       write code which depends on a specific version, you must be more
!      careful.  Each time the minor version is increased, the patch
!      level is reset to zero; each time the major version is increased
!      (which happens rarely), the minor version and patch level are
!      reset.  If you wish to use the predefined macros directly in the
!      conditional, you will need to write it like this:
  
            /* Test for GCC > 3.2.0 */
            #if __GNUC__ > 3 || \
--- 1753,1794 ----
  which you are using GNU C or GNU Fortran.  Their names all start with
  double underscores.
  
! '__COUNTER__'
       This macro expands to sequential integral values starting from 0.
!      In conjunction with the '##' operator, this provides a convenient
!      means to generate unique identifiers.  Care must be taken to ensure
!      that '__COUNTER__' is not expanded prior to inclusion of
       precompiled headers which use it.  Otherwise, the precompiled
       headers will not be used.
  
! '__GFORTRAN__'
       The GNU Fortran compiler defines this.
  
! '__GNUC__'
! '__GNUC_MINOR__'
! '__GNUC_PATCHLEVEL__'
       These macros are defined by all GNU compilers that use the C
       preprocessor: C, C++, Objective-C and Fortran.  Their values are
       the major version, minor version, and patch level of the compiler,
       as integer constants.  For example, GCC 3.2.1 will define
!      '__GNUC__' to 3, '__GNUC_MINOR__' to 2, and '__GNUC_PATCHLEVEL__'
!      to 1.  These macros are also defined if you invoke the preprocessor
!      directly.
  
!      '__GNUC_PATCHLEVEL__' is new to GCC 3.0; it is also present in the
       widely-used development snapshots leading up to 3.0 (which identify
       themselves as GCC 2.96 or 2.97, depending on which snapshot you
       have).
  
       If all you need to know is whether or not your program is being
       compiled by GCC, or a non-GCC compiler that claims to accept the
!      GNU C dialects, you can simply test '__GNUC__'.  If you need to
       write code which depends on a specific version, you must be more
!      careful.  Each time the minor version is increased, the patch level
!      is reset to zero; each time the major version is increased (which
!      happens rarely), the minor version and patch level are reset.  If
!      you wish to use the predefined macros directly in the conditional,
!      you will need to write it like this:
  
            /* Test for GCC > 3.2.0 */
            #if __GNUC__ > 3 || \
*************** double underscores.
*** 1816,1863 ****
  
       Many people find this form easier to understand.
  
! `__GNUG__'
       The GNU C++ compiler defines this.  Testing it is equivalent to
!      testing `(__GNUC__ && __cplusplus)'.
  
! `__STRICT_ANSI__'
!      GCC defines this macro if and only if the `-ansi' switch, or a
!      `-std' switch specifying strict conformance to some version of ISO
!      C or ISO C++, was specified when GCC was invoked.  It is defined
!      to `1'.  This macro exists primarily to direct GNU libc's header
!      files to restrict their definitions to the minimal set found in
!      the 1989 C standard.
  
! `__BASE_FILE__'
       This macro expands to the name of the main input file, in the form
       of a C string constant.  This is the source file that was specified
       on the command line of the preprocessor or C compiler.
  
! `__INCLUDE_LEVEL__'
       This macro expands to a decimal integer constant that represents
       the depth of nesting in include files.  The value of this macro is
!      incremented on every `#include' directive and decremented at the
       end of every included file.  It starts out at 0, its value within
       the base file specified on the command line.
  
! `__ELF__'
       This macro is defined if the target uses the ELF object format.
  
! `__VERSION__'
!      This macro expands to a string constant which describes the
!      version of the compiler in use.  You should not rely on its
!      contents having any particular form, but it can be counted on to
!      contain at least the release number.
  
! `__OPTIMIZE__'
! `__OPTIMIZE_SIZE__'
! `__NO_INLINE__'
!      These macros describe the compilation mode.  `__OPTIMIZE__' is
!      defined in all optimizing compilations.  `__OPTIMIZE_SIZE__' is
       defined if the compiler is optimizing for size, not speed.
!      `__NO_INLINE__' is defined if no functions will be inlined into
       their callers (when not optimizing, or when inlining has been
!      specifically disabled by `-fno-inline').
  
       These macros cause certain GNU header files to provide optimized
       definitions, using macros or inline functions, of system library
--- 1808,1855 ----
  
       Many people find this form easier to understand.
  
! '__GNUG__'
       The GNU C++ compiler defines this.  Testing it is equivalent to
!      testing '(__GNUC__ && __cplusplus)'.
  
! '__STRICT_ANSI__'
!      GCC defines this macro if and only if the '-ansi' switch, or a
!      '-std' switch specifying strict conformance to some version of ISO
!      C or ISO C++, was specified when GCC was invoked.  It is defined to
!      '1'.  This macro exists primarily to direct GNU libc's header files
!      to restrict their definitions to the minimal set found in the 1989
!      C standard.
  
! '__BASE_FILE__'
       This macro expands to the name of the main input file, in the form
       of a C string constant.  This is the source file that was specified
       on the command line of the preprocessor or C compiler.
  
! '__INCLUDE_LEVEL__'
       This macro expands to a decimal integer constant that represents
       the depth of nesting in include files.  The value of this macro is
!      incremented on every '#include' directive and decremented at the
       end of every included file.  It starts out at 0, its value within
       the base file specified on the command line.
  
! '__ELF__'
       This macro is defined if the target uses the ELF object format.
  
! '__VERSION__'
!      This macro expands to a string constant which describes the version
!      of the compiler in use.  You should not rely on its contents having
!      any particular form, but it can be counted on to contain at least
!      the release number.
  
! '__OPTIMIZE__'
! '__OPTIMIZE_SIZE__'
! '__NO_INLINE__'
!      These macros describe the compilation mode.  '__OPTIMIZE__' is
!      defined in all optimizing compilations.  '__OPTIMIZE_SIZE__' is
       defined if the compiler is optimizing for size, not speed.
!      '__NO_INLINE__' is defined if no functions will be inlined into
       their callers (when not optimizing, or when inlining has been
!      specifically disabled by '-fno-inline').
  
       These macros cause certain GNU header files to provide optimized
       definitions, using macros or inline functions, of system library
*************** double underscores.
*** 1865,2080 ****
       make sure that programs will execute with the same effect whether
       or not they are defined.  If they are defined, their value is 1.
  
! `__GNUC_GNU_INLINE__'
!      GCC defines this macro if functions declared `inline' will be
       handled in GCC's traditional gnu90 mode.  Object files will contain
!      externally visible definitions of all functions declared `inline'
!      without `extern' or `static'.  They will not contain any
!      definitions of any functions declared `extern inline'.
  
! `__GNUC_STDC_INLINE__'
!      GCC defines this macro if functions declared `inline' will be
       handled according to the ISO C99 standard.  Object files will
       contain externally visible definitions of all functions declared
!      `extern inline'.  They will not contain definitions of any
!      functions declared `inline' without `extern'.
  
!      If this macro is defined, GCC supports the `gnu_inline' function
       attribute as a way to always get the gnu90 behavior.  Support for
!      this and `__GNUC_GNU_INLINE__' was added in GCC 4.1.3.  If neither
!      macro is defined, an older version of GCC is being used: `inline'
!      functions will be compiled in gnu90 mode, and the `gnu_inline'
       function attribute will not be recognized.
  
! `__CHAR_UNSIGNED__'
!      GCC defines this macro if and only if the data type `char' is
       unsigned on the target machine.  It exists to cause the standard
!      header file `limits.h' to work correctly.  You should not use this
       macro yourself; instead, refer to the standard macros defined in
!      `limits.h'.
  
! `__WCHAR_UNSIGNED__'
!      Like `__CHAR_UNSIGNED__', this macro is defined if and only if the
!      data type `wchar_t' is unsigned and the front-end is in C++ mode.
  
! `__REGISTER_PREFIX__'
       This macro expands to a single token (not a string constant) which
       is the prefix applied to CPU register names in assembly language
       for this target.  You can use it to write assembly that is usable
!      in multiple environments.  For example, in the `m68k-aout'
!      environment it expands to nothing, but in the `m68k-coff'
!      environment it expands to a single `%'.
  
! `__USER_LABEL_PREFIX__'
       This macro expands to a single token which is the prefix applied to
       user labels (symbols visible to C code) in assembly.  For example,
!      in the `m68k-aout' environment it expands to an `_', but in the
!      `m68k-coff' environment it expands to nothing.
  
       This macro will have the correct definition even if
!      `-f(no-)underscores' is in use, but it will not be correct if
       target-specific options that adjust this prefix are used (e.g. the
!      OSF/rose `-mno-underscores' option).
  
! `__SIZE_TYPE__'
! `__PTRDIFF_TYPE__'
! `__WCHAR_TYPE__'
! `__WINT_TYPE__'
! `__INTMAX_TYPE__'
! `__UINTMAX_TYPE__'
! `__SIG_ATOMIC_TYPE__'
! `__INT8_TYPE__'
! `__INT16_TYPE__'
! `__INT32_TYPE__'
! `__INT64_TYPE__'
! `__UINT8_TYPE__'
! `__UINT16_TYPE__'
! `__UINT32_TYPE__'
! `__UINT64_TYPE__'
! `__INT_LEAST8_TYPE__'
! `__INT_LEAST16_TYPE__'
! `__INT_LEAST32_TYPE__'
! `__INT_LEAST64_TYPE__'
! `__UINT_LEAST8_TYPE__'
! `__UINT_LEAST16_TYPE__'
! `__UINT_LEAST32_TYPE__'
! `__UINT_LEAST64_TYPE__'
! `__INT_FAST8_TYPE__'
! `__INT_FAST16_TYPE__'
! `__INT_FAST32_TYPE__'
! `__INT_FAST64_TYPE__'
! `__UINT_FAST8_TYPE__'
! `__UINT_FAST16_TYPE__'
! `__UINT_FAST32_TYPE__'
! `__UINT_FAST64_TYPE__'
! `__INTPTR_TYPE__'
! `__UINTPTR_TYPE__'
       These macros are defined to the correct underlying types for the
!      `size_t', `ptrdiff_t', `wchar_t', `wint_t', `intmax_t',
!      `uintmax_t', `sig_atomic_t', `int8_t', `int16_t', `int32_t',
!      `int64_t', `uint8_t', `uint16_t', `uint32_t', `uint64_t',
!      `int_least8_t', `int_least16_t', `int_least32_t', `int_least64_t',
!      `uint_least8_t', `uint_least16_t', `uint_least32_t',
!      `uint_least64_t', `int_fast8_t', `int_fast16_t', `int_fast32_t',
!      `int_fast64_t', `uint_fast8_t', `uint_fast16_t', `uint_fast32_t',
!      `uint_fast64_t', `intptr_t', and `uintptr_t' typedefs,
       respectively.  They exist to make the standard header files
!      `stddef.h', `stdint.h', and `wchar.h' work correctly.  You should
       not use these macros directly; instead, include the appropriate
       headers and use the typedefs.  Some of these macros may not be
!      defined on particular systems if GCC does not provide a `stdint.h'
       header on those systems.
  
! `__CHAR_BIT__'
       Defined to the number of bits used in the representation of the
!      `char' data type.  It exists to make the standard header given
       numerical limits work correctly.  You should not use this macro
       directly; instead, include the appropriate headers.
  
! `__SCHAR_MAX__'
! `__WCHAR_MAX__'
! `__SHRT_MAX__'
! `__INT_MAX__'
! `__LONG_MAX__'
! `__LONG_LONG_MAX__'
! `__WINT_MAX__'
! `__SIZE_MAX__'
! `__PTRDIFF_MAX__'
! `__INTMAX_MAX__'
! `__UINTMAX_MAX__'
! `__SIG_ATOMIC_MAX__'
! `__INT8_MAX__'
! `__INT16_MAX__'
! `__INT32_MAX__'
! `__INT64_MAX__'
! `__UINT8_MAX__'
! `__UINT16_MAX__'
! `__UINT32_MAX__'
! `__UINT64_MAX__'
! `__INT_LEAST8_MAX__'
! `__INT_LEAST16_MAX__'
! `__INT_LEAST32_MAX__'
! `__INT_LEAST64_MAX__'
! `__UINT_LEAST8_MAX__'
! `__UINT_LEAST16_MAX__'
! `__UINT_LEAST32_MAX__'
! `__UINT_LEAST64_MAX__'
! `__INT_FAST8_MAX__'
! `__INT_FAST16_MAX__'
! `__INT_FAST32_MAX__'
! `__INT_FAST64_MAX__'
! `__UINT_FAST8_MAX__'
! `__UINT_FAST16_MAX__'
! `__UINT_FAST32_MAX__'
! `__UINT_FAST64_MAX__'
! `__INTPTR_MAX__'
! `__UINTPTR_MAX__'
! `__WCHAR_MIN__'
! `__WINT_MIN__'
! `__SIG_ATOMIC_MIN__'
!      Defined to the maximum value of the `signed char', `wchar_t',
!      `signed short', `signed int', `signed long', `signed long long',
!      `wint_t', `size_t', `ptrdiff_t', `intmax_t', `uintmax_t',
!      `sig_atomic_t', `int8_t', `int16_t', `int32_t', `int64_t',
!      `uint8_t', `uint16_t', `uint32_t', `uint64_t', `int_least8_t',
!      `int_least16_t', `int_least32_t', `int_least64_t',
!      `uint_least8_t', `uint_least16_t', `uint_least32_t',
!      `uint_least64_t', `int_fast8_t', `int_fast16_t', `int_fast32_t',
!      `int_fast64_t', `uint_fast8_t', `uint_fast16_t', `uint_fast32_t',
!      `uint_fast64_t', `intptr_t', and `uintptr_t' types and to the
!      minimum value of the `wchar_t', `wint_t', and `sig_atomic_t' types
!      respectively.  They exist to make the standard header given
!      numerical limits work correctly.  You should not use these macros
!      directly; instead, include the appropriate headers.  Some of these
!      macros may not be defined on particular systems if GCC does not
!      provide a `stdint.h' header on those systems.
  
! `__INT8_C'
! `__INT16_C'
! `__INT32_C'
! `__INT64_C'
! `__UINT8_C'
! `__UINT16_C'
! `__UINT32_C'
! `__UINT64_C'
! `__INTMAX_C'
! `__UINTMAX_C'
!      Defined to implementations of the standard `stdint.h' macros with
!      the same names without the leading `__'.  They exist the make the
       implementation of that header work correctly.  You should not use
       these macros directly; instead, include the appropriate headers.
       Some of these macros may not be defined on particular systems if
!      GCC does not provide a `stdint.h' header on those systems.
  
! `__SIZEOF_INT__'
! `__SIZEOF_LONG__'
! `__SIZEOF_LONG_LONG__'
! `__SIZEOF_SHORT__'
! `__SIZEOF_POINTER__'
! `__SIZEOF_FLOAT__'
! `__SIZEOF_DOUBLE__'
! `__SIZEOF_LONG_DOUBLE__'
! `__SIZEOF_SIZE_T__'
! `__SIZEOF_WCHAR_T__'
! `__SIZEOF_WINT_T__'
! `__SIZEOF_PTRDIFF_T__'
!      Defined to the number of bytes of the C standard data types: `int',
!      `long', `long long', `short', `void *', `float', `double', `long
!      double', `size_t', `wchar_t', `wint_t' and `ptrdiff_t'.
  
! `__BYTE_ORDER__'
! `__ORDER_LITTLE_ENDIAN__'
! `__ORDER_BIG_ENDIAN__'
! `__ORDER_PDP_ENDIAN__'
!      `__BYTE_ORDER__' is defined to one of the values
!      `__ORDER_LITTLE_ENDIAN__', `__ORDER_BIG_ENDIAN__', or
!      `__ORDER_PDP_ENDIAN__' to reflect the layout of multi-byte and
!      multi-word quantities in memory.  If `__BYTE_ORDER__' is equal to
!      `__ORDER_LITTLE_ENDIAN__' or `__ORDER_BIG_ENDIAN__', then
       multi-byte and multi-word quantities are laid out identically: the
       byte (word) at the lowest address is the least significant or most
       significant byte (word) of the quantity, respectively.  If
!      `__BYTE_ORDER__' is equal to `__ORDER_PDP_ENDIAN__', then bytes in
       16-bit words are laid out in a little-endian fashion, whereas the
       16-bit subwords of a 32-bit quantity are laid out in big-endian
       fashion.
--- 1857,2072 ----
       make sure that programs will execute with the same effect whether
       or not they are defined.  If they are defined, their value is 1.
  
! '__GNUC_GNU_INLINE__'
!      GCC defines this macro if functions declared 'inline' will be
       handled in GCC's traditional gnu90 mode.  Object files will contain
!      externally visible definitions of all functions declared 'inline'
!      without 'extern' or 'static'.  They will not contain any
!      definitions of any functions declared 'extern inline'.
  
! '__GNUC_STDC_INLINE__'
!      GCC defines this macro if functions declared 'inline' will be
       handled according to the ISO C99 standard.  Object files will
       contain externally visible definitions of all functions declared
!      'extern inline'.  They will not contain definitions of any
!      functions declared 'inline' without 'extern'.
  
!      If this macro is defined, GCC supports the 'gnu_inline' function
       attribute as a way to always get the gnu90 behavior.  Support for
!      this and '__GNUC_GNU_INLINE__' was added in GCC 4.1.3.  If neither
!      macro is defined, an older version of GCC is being used: 'inline'
!      functions will be compiled in gnu90 mode, and the 'gnu_inline'
       function attribute will not be recognized.
  
! '__CHAR_UNSIGNED__'
!      GCC defines this macro if and only if the data type 'char' is
       unsigned on the target machine.  It exists to cause the standard
!      header file 'limits.h' to work correctly.  You should not use this
       macro yourself; instead, refer to the standard macros defined in
!      'limits.h'.
  
! '__WCHAR_UNSIGNED__'
!      Like '__CHAR_UNSIGNED__', this macro is defined if and only if the
!      data type 'wchar_t' is unsigned and the front-end is in C++ mode.
  
! '__REGISTER_PREFIX__'
       This macro expands to a single token (not a string constant) which
       is the prefix applied to CPU register names in assembly language
       for this target.  You can use it to write assembly that is usable
!      in multiple environments.  For example, in the 'm68k-aout'
!      environment it expands to nothing, but in the 'm68k-coff'
!      environment it expands to a single '%'.
  
! '__USER_LABEL_PREFIX__'
       This macro expands to a single token which is the prefix applied to
       user labels (symbols visible to C code) in assembly.  For example,
!      in the 'm68k-aout' environment it expands to an '_', but in the
!      'm68k-coff' environment it expands to nothing.
  
       This macro will have the correct definition even if
!      '-f(no-)underscores' is in use, but it will not be correct if
       target-specific options that adjust this prefix are used (e.g. the
!      OSF/rose '-mno-underscores' option).
  
! '__SIZE_TYPE__'
! '__PTRDIFF_TYPE__'
! '__WCHAR_TYPE__'
! '__WINT_TYPE__'
! '__INTMAX_TYPE__'
! '__UINTMAX_TYPE__'
! '__SIG_ATOMIC_TYPE__'
! '__INT8_TYPE__'
! '__INT16_TYPE__'
! '__INT32_TYPE__'
! '__INT64_TYPE__'
! '__UINT8_TYPE__'
! '__UINT16_TYPE__'
! '__UINT32_TYPE__'
! '__UINT64_TYPE__'
! '__INT_LEAST8_TYPE__'
! '__INT_LEAST16_TYPE__'
! '__INT_LEAST32_TYPE__'
! '__INT_LEAST64_TYPE__'
! '__UINT_LEAST8_TYPE__'
! '__UINT_LEAST16_TYPE__'
! '__UINT_LEAST32_TYPE__'
! '__UINT_LEAST64_TYPE__'
! '__INT_FAST8_TYPE__'
! '__INT_FAST16_TYPE__'
! '__INT_FAST32_TYPE__'
! '__INT_FAST64_TYPE__'
! '__UINT_FAST8_TYPE__'
! '__UINT_FAST16_TYPE__'
! '__UINT_FAST32_TYPE__'
! '__UINT_FAST64_TYPE__'
! '__INTPTR_TYPE__'
! '__UINTPTR_TYPE__'
       These macros are defined to the correct underlying types for the
!      'size_t', 'ptrdiff_t', 'wchar_t', 'wint_t', 'intmax_t',
!      'uintmax_t', 'sig_atomic_t', 'int8_t', 'int16_t', 'int32_t',
!      'int64_t', 'uint8_t', 'uint16_t', 'uint32_t', 'uint64_t',
!      'int_least8_t', 'int_least16_t', 'int_least32_t', 'int_least64_t',
!      'uint_least8_t', 'uint_least16_t', 'uint_least32_t',
!      'uint_least64_t', 'int_fast8_t', 'int_fast16_t', 'int_fast32_t',
!      'int_fast64_t', 'uint_fast8_t', 'uint_fast16_t', 'uint_fast32_t',
!      'uint_fast64_t', 'intptr_t', and 'uintptr_t' typedefs,
       respectively.  They exist to make the standard header files
!      'stddef.h', 'stdint.h', and 'wchar.h' work correctly.  You should
       not use these macros directly; instead, include the appropriate
       headers and use the typedefs.  Some of these macros may not be
!      defined on particular systems if GCC does not provide a 'stdint.h'
       header on those systems.
  
! '__CHAR_BIT__'
       Defined to the number of bits used in the representation of the
!      'char' data type.  It exists to make the standard header given
       numerical limits work correctly.  You should not use this macro
       directly; instead, include the appropriate headers.
  
! '__SCHAR_MAX__'
! '__WCHAR_MAX__'
! '__SHRT_MAX__'
! '__INT_MAX__'
! '__LONG_MAX__'
! '__LONG_LONG_MAX__'
! '__WINT_MAX__'
! '__SIZE_MAX__'
! '__PTRDIFF_MAX__'
! '__INTMAX_MAX__'
! '__UINTMAX_MAX__'
! '__SIG_ATOMIC_MAX__'
! '__INT8_MAX__'
! '__INT16_MAX__'
! '__INT32_MAX__'
! '__INT64_MAX__'
! '__UINT8_MAX__'
! '__UINT16_MAX__'
! '__UINT32_MAX__'
! '__UINT64_MAX__'
! '__INT_LEAST8_MAX__'
! '__INT_LEAST16_MAX__'
! '__INT_LEAST32_MAX__'
! '__INT_LEAST64_MAX__'
! '__UINT_LEAST8_MAX__'
! '__UINT_LEAST16_MAX__'
! '__UINT_LEAST32_MAX__'
! '__UINT_LEAST64_MAX__'
! '__INT_FAST8_MAX__'
! '__INT_FAST16_MAX__'
! '__INT_FAST32_MAX__'
! '__INT_FAST64_MAX__'
! '__UINT_FAST8_MAX__'
! '__UINT_FAST16_MAX__'
! '__UINT_FAST32_MAX__'
! '__UINT_FAST64_MAX__'
! '__INTPTR_MAX__'
! '__UINTPTR_MAX__'
! '__WCHAR_MIN__'
! '__WINT_MIN__'
! '__SIG_ATOMIC_MIN__'
!      Defined to the maximum value of the 'signed char', 'wchar_t',
!      'signed short', 'signed int', 'signed long', 'signed long long',
!      'wint_t', 'size_t', 'ptrdiff_t', 'intmax_t', 'uintmax_t',
!      'sig_atomic_t', 'int8_t', 'int16_t', 'int32_t', 'int64_t',
!      'uint8_t', 'uint16_t', 'uint32_t', 'uint64_t', 'int_least8_t',
!      'int_least16_t', 'int_least32_t', 'int_least64_t', 'uint_least8_t',
!      'uint_least16_t', 'uint_least32_t', 'uint_least64_t',
!      'int_fast8_t', 'int_fast16_t', 'int_fast32_t', 'int_fast64_t',
!      'uint_fast8_t', 'uint_fast16_t', 'uint_fast32_t', 'uint_fast64_t',
!      'intptr_t', and 'uintptr_t' types and to the minimum value of the
!      'wchar_t', 'wint_t', and 'sig_atomic_t' types respectively.  They
!      exist to make the standard header given numerical limits work
!      correctly.  You should not use these macros directly; instead,
!      include the appropriate headers.  Some of these macros may not be
!      defined on particular systems if GCC does not provide a 'stdint.h'
!      header on those systems.
  
! '__INT8_C'
! '__INT16_C'
! '__INT32_C'
! '__INT64_C'
! '__UINT8_C'
! '__UINT16_C'
! '__UINT32_C'
! '__UINT64_C'
! '__INTMAX_C'
! '__UINTMAX_C'
!      Defined to implementations of the standard 'stdint.h' macros with
!      the same names without the leading '__'.  They exist the make the
       implementation of that header work correctly.  You should not use
       these macros directly; instead, include the appropriate headers.
       Some of these macros may not be defined on particular systems if
!      GCC does not provide a 'stdint.h' header on those systems.
  
! '__SIZEOF_INT__'
! '__SIZEOF_LONG__'
! '__SIZEOF_LONG_LONG__'
! '__SIZEOF_SHORT__'
! '__SIZEOF_POINTER__'
! '__SIZEOF_FLOAT__'
! '__SIZEOF_DOUBLE__'
! '__SIZEOF_LONG_DOUBLE__'
! '__SIZEOF_SIZE_T__'
! '__SIZEOF_WCHAR_T__'
! '__SIZEOF_WINT_T__'
! '__SIZEOF_PTRDIFF_T__'
!      Defined to the number of bytes of the C standard data types: 'int',
!      'long', 'long long', 'short', 'void *', 'float', 'double', 'long
!      double', 'size_t', 'wchar_t', 'wint_t' and 'ptrdiff_t'.
  
! '__BYTE_ORDER__'
! '__ORDER_LITTLE_ENDIAN__'
! '__ORDER_BIG_ENDIAN__'
! '__ORDER_PDP_ENDIAN__'
!      '__BYTE_ORDER__' is defined to one of the values
!      '__ORDER_LITTLE_ENDIAN__', '__ORDER_BIG_ENDIAN__', or
!      '__ORDER_PDP_ENDIAN__' to reflect the layout of multi-byte and
!      multi-word quantities in memory.  If '__BYTE_ORDER__' is equal to
!      '__ORDER_LITTLE_ENDIAN__' or '__ORDER_BIG_ENDIAN__', then
       multi-byte and multi-word quantities are laid out identically: the
       byte (word) at the lowest address is the least significant or most
       significant byte (word) of the quantity, respectively.  If
!      '__BYTE_ORDER__' is equal to '__ORDER_PDP_ENDIAN__', then bytes in
       16-bit words are laid out in a little-endian fashion, whereas the
       16-bit subwords of a 32-bit quantity are laid out in big-endian
       fashion.
*************** double underscores.
*** 2084,2237 ****
            /* Test for a little-endian machine */
            #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
  
! `__FLOAT_WORD_ORDER__'
!      `__FLOAT_WORD_ORDER__' is defined to one of the values
!      `__ORDER_LITTLE_ENDIAN__' or `__ORDER_BIG_ENDIAN__' to reflect the
       layout of the words of multi-word floating-point quantities.
  
! `__DEPRECATED'
       This macro is defined, with value 1, when compiling a C++ source
       file with warnings about deprecated constructs enabled.  These
       warnings are enabled by default, but can be disabled with
!      `-Wno-deprecated'.
  
! `__EXCEPTIONS'
       This macro is defined, with value 1, when compiling a C++ source
!      file with exceptions enabled.  If `-fno-exceptions' is used when
       compiling the file, then this macro is not defined.
  
! `__GXX_RTTI'
       This macro is defined, with value 1, when compiling a C++ source
!      file with runtime type identification enabled.  If `-fno-rtti' is
       used when compiling the file, then this macro is not defined.
  
! `__USING_SJLJ_EXCEPTIONS__'
       This macro is defined, with value 1, if the compiler uses the old
!      mechanism based on `setjmp' and `longjmp' for exception handling.
  
! `__GXX_EXPERIMENTAL_CXX0X__'
       This macro is defined when compiling a C++ source file with the
!      option `-std=c++0x' or `-std=gnu++0x'. It indicates that some
!      features likely to be included in C++0x are available. Note that
       these features are experimental, and may change or be removed in
       future versions of GCC.
  
! `__GXX_WEAK__'
       This macro is defined when compiling a C++ source file.  It has the
       value 1 if the compiler will use weak symbols, COMDAT sections, or
       other similar techniques to collapse symbols with "vague linkage"
       that are defined in multiple translation units.  If the compiler
!      will not collapse such symbols, this macro is defined with value
!      0.  In general, user code should not need to make use of this
!      macro; the purpose of this macro is to ease implementation of the
!      C++ runtime library provided with G++.
  
! `__NEXT_RUNTIME__'
       This macro is defined, with value 1, if (and only if) the NeXT
!      runtime (as in `-fnext-runtime') is in use for Objective-C.  If
!      the GNU runtime is used, this macro is not defined, so that you
!      can use this macro to determine which runtime (NeXT or GNU) is
!      being used.
  
! `__LP64__'
! `_LP64'
       These macros are defined, with value 1, if (and only if) the
!      compilation is for a target where `long int' and pointer both use
!      64-bits and `int' uses 32-bit.
  
! `__SSP__'
!      This macro is defined, with value 1, when `-fstack-protector' is in
       use.
  
! `__SSP_ALL__'
!      This macro is defined, with value 2, when `-fstack-protector-all'
       is in use.
  
! `__SSP_STRONG__'
       This macro is defined, with value 3, when
!      `-fstack-protector-strong' is in use.
  
! `__SSP_EXPLICIT__'
       This macro is defined, with value 4, when
!      `-fstack-protector-explicit' is in use.
  
! `__SANITIZE_ADDRESS__'
!      This macro is defined, with value 1, when `-fsanitize=address' or
!      `-fsanitize=kernel-address' are in use.
  
! `__TIMESTAMP__'
!      This macro expands to a string constant that describes the date
!      and time of the last modification of the current source file. The
!      string constant contains abbreviated day of the week, month, day
!      of the month, time in hh:mm:ss form, year and looks like
!      `"Sun Sep 16 01:03:52 1973"'.  If the day of the month is less
!      than 10, it is padded with a space on the left.
  
       If GCC cannot determine the current date, it will emit a warning
!      message (once per compilation) and `__TIMESTAMP__' will expand to
!      `"??? ??? ?? ??:??:?? ????"'.
  
! `__GCC_HAVE_SYNC_COMPARE_AND_SWAP_1'
! `__GCC_HAVE_SYNC_COMPARE_AND_SWAP_2'
! `__GCC_HAVE_SYNC_COMPARE_AND_SWAP_4'
! `__GCC_HAVE_SYNC_COMPARE_AND_SWAP_8'
! `__GCC_HAVE_SYNC_COMPARE_AND_SWAP_16'
       These macros are defined when the target processor supports atomic
       compare and swap operations on operands 1, 2, 4, 8 or 16 bytes in
       length, respectively.
  
! `__GCC_HAVE_DWARF2_CFI_ASM'
       This macro is defined when the compiler is emitting Dwarf2 CFI
       directives to the assembler.  When this is defined, it is possible
       to emit those same directives in inline assembly.
  
! `__FP_FAST_FMA'
! `__FP_FAST_FMAF'
! `__FP_FAST_FMAL'
       These macros are defined with value 1 if the backend supports the
!      `fma', `fmaf', and `fmal' builtin functions, so that the include
!      file `math.h' can define the macros `FP_FAST_FMA', `FP_FAST_FMAF',
!      and `FP_FAST_FMAL' for compatibility with the 1999 C standard.
  
! `__GCC_IEC_559'
       This macro is defined to indicate the intended level of support for
       IEEE 754 (IEC 60559) floating-point arithmetic.  It expands to a
!      nonnegative integer value.  If 0, it indicates that the
!      combination of the compiler configuration and the command-line
!      options is not intended to support IEEE 754 arithmetic for `float'
!      and `double' as defined in C99 and C11 Annex F (for example, that
!      the standard rounding modes and exceptions are not supported, or
!      that optimizations are enabled that conflict with IEEE 754
!      semantics).  If 1, it indicates that IEEE 754 arithmetic is
!      intended to be supported; this does not mean that all relevant
!      language features are supported by GCC.  If 2 or more, it
!      additionally indicates support for IEEE 754-2008 (in particular,
!      that the binary encodings for quiet and signaling NaNs are as
!      specified in IEEE 754-2008).
  
       This macro does not indicate the default state of command-line
       options that control optimizations that C99 and C11 permit to be
       controlled by standard pragmas, where those standards do not
       require a particular default state.  It does not indicate whether
       optimizations respect signaling NaN semantics (the macro for that
!      is `__SUPPORT_SNAN__').  It does not indicate support for decimal
       floating point or the IEEE 754 binary16 and binary128 types.
  
! `__GCC_IEC_559_COMPLEX'
       This macro is defined to indicate the intended level of support for
!      IEEE 754 (IEC 60559) floating-point arithmetic for complex
!      numbers, as defined in C99 and C11 Annex G.  It expands to a
!      nonnegative integer value.  If 0, it indicates that the
!      combination of the compiler configuration and the command-line
!      options is not intended to support Annex G requirements (for
!      example, because `-fcx-limited-range' was used).  If 1 or more, it
!      indicates that it is intended to support those requirements; this
!      does not mean that all relevant language features are supported by
!      GCC.
  
! `__NO_MATH_ERRNO__'
!      This macro is defined if `-fno-math-errno' is used, or enabled by
!      another option such as `-ffast-math' or by default.
  
  
  File: cpp.info,  Node: System-specific Predefined Macros,  Next: C++ Named Operators,  Prev: Common Predefined Macros,  Up: Predefined Macros
--- 2076,2226 ----
            /* Test for a little-endian machine */
            #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
  
! '__FLOAT_WORD_ORDER__'
!      '__FLOAT_WORD_ORDER__' is defined to one of the values
!      '__ORDER_LITTLE_ENDIAN__' or '__ORDER_BIG_ENDIAN__' to reflect the
       layout of the words of multi-word floating-point quantities.
  
! '__DEPRECATED'
       This macro is defined, with value 1, when compiling a C++ source
       file with warnings about deprecated constructs enabled.  These
       warnings are enabled by default, but can be disabled with
!      '-Wno-deprecated'.
  
! '__EXCEPTIONS'
       This macro is defined, with value 1, when compiling a C++ source
!      file with exceptions enabled.  If '-fno-exceptions' is used when
       compiling the file, then this macro is not defined.
  
! '__GXX_RTTI'
       This macro is defined, with value 1, when compiling a C++ source
!      file with runtime type identification enabled.  If '-fno-rtti' is
       used when compiling the file, then this macro is not defined.
  
! '__USING_SJLJ_EXCEPTIONS__'
       This macro is defined, with value 1, if the compiler uses the old
!      mechanism based on 'setjmp' and 'longjmp' for exception handling.
  
! '__GXX_EXPERIMENTAL_CXX0X__'
       This macro is defined when compiling a C++ source file with the
!      option '-std=c++0x' or '-std=gnu++0x'.  It indicates that some
!      features likely to be included in C++0x are available.  Note that
       these features are experimental, and may change or be removed in
       future versions of GCC.
  
! '__GXX_WEAK__'
       This macro is defined when compiling a C++ source file.  It has the
       value 1 if the compiler will use weak symbols, COMDAT sections, or
       other similar techniques to collapse symbols with "vague linkage"
       that are defined in multiple translation units.  If the compiler
!      will not collapse such symbols, this macro is defined with value 0.
!      In general, user code should not need to make use of this macro;
!      the purpose of this macro is to ease implementation of the C++
!      runtime library provided with G++.
  
! '__NEXT_RUNTIME__'
       This macro is defined, with value 1, if (and only if) the NeXT
!      runtime (as in '-fnext-runtime') is in use for Objective-C.  If the
!      GNU runtime is used, this macro is not defined, so that you can use
!      this macro to determine which runtime (NeXT or GNU) is being used.
  
! '__LP64__'
! '_LP64'
       These macros are defined, with value 1, if (and only if) the
!      compilation is for a target where 'long int' and pointer both use
!      64-bits and 'int' uses 32-bit.
  
! '__SSP__'
!      This macro is defined, with value 1, when '-fstack-protector' is in
       use.
  
! '__SSP_ALL__'
!      This macro is defined, with value 2, when '-fstack-protector-all'
       is in use.
  
! '__SSP_STRONG__'
       This macro is defined, with value 3, when
!      '-fstack-protector-strong' is in use.
  
! '__SSP_EXPLICIT__'
       This macro is defined, with value 4, when
!      '-fstack-protector-explicit' is in use.
  
! '__SANITIZE_ADDRESS__'
!      This macro is defined, with value 1, when '-fsanitize=address' or
!      '-fsanitize=kernel-address' are in use.
  
! '__TIMESTAMP__'
!      This macro expands to a string constant that describes the date and
!      time of the last modification of the current source file.  The
!      string constant contains abbreviated day of the week, month, day of
!      the month, time in hh:mm:ss form, year and looks like
!      '"Sun Sep 16 01:03:52 1973"'.  If the day of the month is less than
!      10, it is padded with a space on the left.
  
       If GCC cannot determine the current date, it will emit a warning
!      message (once per compilation) and '__TIMESTAMP__' will expand to
!      '"??? ??? ?? ??:??:?? ????"'.
  
! '__GCC_HAVE_SYNC_COMPARE_AND_SWAP_1'
! '__GCC_HAVE_SYNC_COMPARE_AND_SWAP_2'
! '__GCC_HAVE_SYNC_COMPARE_AND_SWAP_4'
! '__GCC_HAVE_SYNC_COMPARE_AND_SWAP_8'
! '__GCC_HAVE_SYNC_COMPARE_AND_SWAP_16'
       These macros are defined when the target processor supports atomic
       compare and swap operations on operands 1, 2, 4, 8 or 16 bytes in
       length, respectively.
  
! '__GCC_HAVE_DWARF2_CFI_ASM'
       This macro is defined when the compiler is emitting Dwarf2 CFI
       directives to the assembler.  When this is defined, it is possible
       to emit those same directives in inline assembly.
  
! '__FP_FAST_FMA'
! '__FP_FAST_FMAF'
! '__FP_FAST_FMAL'
       These macros are defined with value 1 if the backend supports the
!      'fma', 'fmaf', and 'fmal' builtin functions, so that the include
!      file 'math.h' can define the macros 'FP_FAST_FMA', 'FP_FAST_FMAF',
!      and 'FP_FAST_FMAL' for compatibility with the 1999 C standard.
  
! '__GCC_IEC_559'
       This macro is defined to indicate the intended level of support for
       IEEE 754 (IEC 60559) floating-point arithmetic.  It expands to a
!      nonnegative integer value.  If 0, it indicates that the combination
!      of the compiler configuration and the command-line options is not
!      intended to support IEEE 754 arithmetic for 'float' and 'double' as
!      defined in C99 and C11 Annex F (for example, that the standard
!      rounding modes and exceptions are not supported, or that
!      optimizations are enabled that conflict with IEEE 754 semantics).
!      If 1, it indicates that IEEE 754 arithmetic is intended to be
!      supported; this does not mean that all relevant language features
!      are supported by GCC. If 2 or more, it additionally indicates
!      support for IEEE 754-2008 (in particular, that the binary encodings
!      for quiet and signaling NaNs are as specified in IEEE 754-2008).
  
       This macro does not indicate the default state of command-line
       options that control optimizations that C99 and C11 permit to be
       controlled by standard pragmas, where those standards do not
       require a particular default state.  It does not indicate whether
       optimizations respect signaling NaN semantics (the macro for that
!      is '__SUPPORT_SNAN__').  It does not indicate support for decimal
       floating point or the IEEE 754 binary16 and binary128 types.
  
! '__GCC_IEC_559_COMPLEX'
       This macro is defined to indicate the intended level of support for
!      IEEE 754 (IEC 60559) floating-point arithmetic for complex numbers,
!      as defined in C99 and C11 Annex G. It expands to a nonnegative
!      integer value.  If 0, it indicates that the combination of the
!      compiler configuration and the command-line options is not intended
!      to support Annex G requirements (for example, because
!      '-fcx-limited-range' was used).  If 1 or more, it indicates that it
!      is intended to support those requirements; this does not mean that
!      all relevant language features are supported by GCC.
  
! '__NO_MATH_ERRNO__'
!      This macro is defined if '-fno-math-errno' is used, or enabled by
!      another option such as '-ffast-math' or by default.
  
  
  File: cpp.info,  Node: System-specific Predefined Macros,  Next: C++ Named Operators,  Prev: Common Predefined Macros,  Up: Predefined Macros
*************** File: cpp.info,  Node: System-specific P
*** 2242,2264 ****
  The C preprocessor normally predefines several macros that indicate what
  type of system and machine is in use.  They are obviously different on
  each target supported by GCC.  This manual, being for all systems and
! machines, cannot tell you what their names are, but you can use `cpp
  -dM' to see them all.  *Note Invocation::.  All system-specific
  predefined macros expand to a constant value, so you can test them with
! either `#ifdef' or `#if'.
  
     The C standard requires that all system-specific macros be part of
  the "reserved namespace".  All names which begin with two underscores,
  or an underscore and a capital letter, are reserved for the compiler and
  library to use as they wish.  However, historically system-specific
  macros have had names with no special prefix; for instance, it is common
! to find `unix' defined on Unix systems.  For all such macros, GCC
  provides a parallel macro with two underscores added at the beginning
! and the end.  If `unix' is defined, `__unix__' will be defined too.
! There will never be more than two underscores; the parallel of `_mips'
! is `__mips__'.
  
!    When the `-ansi' option, or any `-std' option that requests strict
  conformance, is given to the compiler, all the system-specific
  predefined macros outside the reserved namespace are suppressed.  The
  parallel macros, inside the reserved namespace, remain defined.
--- 2231,2253 ----
  The C preprocessor normally predefines several macros that indicate what
  type of system and machine is in use.  They are obviously different on
  each target supported by GCC.  This manual, being for all systems and
! machines, cannot tell you what their names are, but you can use 'cpp
  -dM' to see them all.  *Note Invocation::.  All system-specific
  predefined macros expand to a constant value, so you can test them with
! either '#ifdef' or '#if'.
  
     The C standard requires that all system-specific macros be part of
  the "reserved namespace".  All names which begin with two underscores,
  or an underscore and a capital letter, are reserved for the compiler and
  library to use as they wish.  However, historically system-specific
  macros have had names with no special prefix; for instance, it is common
! to find 'unix' defined on Unix systems.  For all such macros, GCC
  provides a parallel macro with two underscores added at the beginning
! and the end.  If 'unix' is defined, '__unix__' will be defined too.
! There will never be more than two underscores; the parallel of '_mips'
! is '__mips__'.
  
!    When the '-ansi' option, or any '-std' option that requests strict
  conformance, is given to the compiler, all the system-specific
  predefined macros outside the reserved namespace are suppressed.  The
  parallel macros, inside the reserved namespace, remain defined.
*************** encourage you to correct older code to u
*** 2269,2275 ****
  you find it.  We don't recommend you use the system-specific macros that
  are in the reserved namespace, either.  It is better in the long run to
  check specifically for features you need, using a tool such as
! `autoconf'.
  
  
  File: cpp.info,  Node: C++ Named Operators,  Prev: System-specific Predefined Macros,  Up: Predefined Macros
--- 2258,2264 ----
  you find it.  We don't recommend you use the system-specific macros that
  are in the reserved namespace, either.  It is better in the long run to
  check specifically for features you need, using a tool such as
! 'autoconf'.
  
  
  File: cpp.info,  Node: C++ Named Operators,  Prev: System-specific Predefined Macros,  Up: Predefined Macros
*************** File: cpp.info,  Node: C++ Named Operato
*** 2280,2304 ****
  In C++, there are eleven keywords which are simply alternate spellings
  of operators normally written with punctuation.  These keywords are
  treated as such even in the preprocessor.  They function as operators in
! `#if', and they cannot be defined as macros or poisoned.  In C, you can
  request that those keywords take their C++ meaning by including
! `iso646.h'.  That header defines each one as a normal object-like macro
  expanding to the appropriate punctuator.
  
     These are the named operators and their corresponding punctuators:
  
  Named Operator   Punctuator
! `and'            `&&'
! `and_eq'         `&='
! `bitand'         `&'
! `bitor'          `|'
! `compl'          `~'
! `not'            `!'
! `not_eq'         `!='
! `or'             `||'
! `or_eq'          `|='
! `xor'            `^'
! `xor_eq'         `^='
  
  
  File: cpp.info,  Node: Undefining and Redefining Macros,  Next: Directives Within Macro Arguments,  Prev: Predefined Macros,  Up: Macros
--- 2269,2293 ----
  In C++, there are eleven keywords which are simply alternate spellings
  of operators normally written with punctuation.  These keywords are
  treated as such even in the preprocessor.  They function as operators in
! '#if', and they cannot be defined as macros or poisoned.  In C, you can
  request that those keywords take their C++ meaning by including
! 'iso646.h'.  That header defines each one as a normal object-like macro
  expanding to the appropriate punctuator.
  
     These are the named operators and their corresponding punctuators:
  
  Named Operator   Punctuator
! 'and'            '&&'
! 'and_eq'         '&='
! 'bitand'         '&'
! 'bitor'          '|'
! 'compl'          '~'
! 'not'            '!'
! 'not_eq'         '!='
! 'or'             '||'
! 'or_eq'          '|='
! 'xor'            '^'
! 'xor_eq'         '^='
  
  
  File: cpp.info,  Node: Undefining and Redefining Macros,  Next: Directives Within Macro Arguments,  Prev: Predefined Macros,  Up: Macros
*************** File: cpp.info,  Node: Undefining and Re
*** 2306,2316 ****
  3.8 Undefining and Redefining Macros
  ====================================
  
! If a macro ceases to be useful, it may be "undefined" with the `#undef'
! directive.  `#undef' takes a single argument, the name of the macro to
  undefine.  You use the bare macro name, even if the macro is
! function-like.  It is an error if anything appears on the line after
! the macro name.  `#undef' has no effect if the name is not a macro.
  
       #define FOO 4
       x = FOO;        ==> x = 4;
--- 2295,2305 ----
  3.8 Undefining and Redefining Macros
  ====================================
  
! If a macro ceases to be useful, it may be "undefined" with the '#undef'
! directive.  '#undef' takes a single argument, the name of the macro to
  undefine.  You use the bare macro name, even if the macro is
! function-like.  It is an error if anything appears on the line after the
! macro name.  '#undef' has no effect if the name is not a macro.
  
       #define FOO 4
       x = FOO;        ==> x = 4;
*************** the macro name.  `#undef' has no effect
*** 2318,2335 ****
       x = FOO;        ==> x = FOO;
  
     Once a macro has been undefined, that identifier may be "redefined"
! as a macro by a subsequent `#define' directive.  The new definition
! need not have any resemblance to the old definition.
  
     However, if an identifier which is currently a macro is redefined,
  then the new definition must be "effectively the same" as the old one.
  Two macro definitions are effectively the same if:
     * Both are the same type of macro (object- or function-like).
- 
     * All the tokens of the replacement list are the same.
- 
     * If there are any parameters, they are the same.
- 
     * Whitespace appears in the same places in both.  It need not be
       exactly the same amount of whitespace, though.  Remember that
       comments count as whitespace.
--- 2307,2321 ----
       x = FOO;        ==> x = FOO;
  
     Once a macro has been undefined, that identifier may be "redefined"
! as a macro by a subsequent '#define' directive.  The new definition need
! not have any resemblance to the old definition.
  
     However, if an identifier which is currently a macro is redefined,
  then the new definition must be "effectively the same" as the old one.
  Two macro definitions are effectively the same if:
     * Both are the same type of macro (object- or function-like).
     * All the tokens of the replacement list are the same.
     * If there are any parameters, they are the same.
     * Whitespace appears in the same places in both.  It need not be
       exactly the same amount of whitespace, though.  Remember that
       comments count as whitespace.
*************** These definitions are effectively the sa
*** 2338,2344 ****
       #define FOUR (2 + 2)
       #define FOUR         (2    +    2)
       #define FOUR (2 /* two */ + 2)
!    but these are not:
       #define FOUR (2 + 2)
       #define FOUR ( 2+2 )
       #define FOUR (2 * 2)
--- 2324,2330 ----
       #define FOUR (2 + 2)
       #define FOUR         (2    +    2)
       #define FOUR (2 /* two */ + 2)
! but these are not:
       #define FOUR (2 + 2)
       #define FOUR ( 2+2 )
       #define FOUR (2 * 2)
*************** these cases is undefined.
*** 2364,2374 ****
     Versions of CPP prior to 3.2 would reject such constructs with an
  error message.  This was the only syntactic difference between normal
  functions and function-like macros, so it seemed attractive to remove
! this limitation, and people would often be surprised that they could
! not use macros in this way.  Moreover, sometimes people would use
  conditional compilation in the argument list to a normal library
! function like `printf', only to find that after a library upgrade
! `printf' had changed to be a function-like macro, and their code would
  no longer compile.  So from version 3.2 we changed CPP to successfully
  process arbitrary directives within macro arguments in exactly the same
  way as it would have processed the directive were the function-like
--- 2350,2360 ----
     Versions of CPP prior to 3.2 would reject such constructs with an
  error message.  This was the only syntactic difference between normal
  functions and function-like macros, so it seemed attractive to remove
! this limitation, and people would often be surprised that they could not
! use macros in this way.  Moreover, sometimes people would use
  conditional compilation in the argument list to a normal library
! function like 'printf', only to find that after a library upgrade
! 'printf' had changed to be a function-like macro, and their code would
  no longer compile.  So from version 3.2 we changed CPP to successfully
  process arbitrary directives within macro arguments in exactly the same
  way as it would have processed the directive were the function-like
*************** outside of it.  For example,
*** 2439,2447 ****
       strange(stderr) p, 35)
            ==> fprintf (stderr, "%s %d", p, 35)
  
!    The ability to piece together a macro call can be useful, but the
! use of unbalanced open parentheses in a macro body is just confusing,
! and should be avoided.
  
  
  File: cpp.info,  Node: Operator Precedence Problems,  Next: Swallowing the Semicolon,  Prev: Misnesting,  Up: Macro Pitfalls
--- 2425,2433 ----
       strange(stderr) p, 35)
            ==> fprintf (stderr, "%s %d", p, 35)
  
!    The ability to piece together a macro call can be useful, but the use
! of unbalanced open parentheses in a macro body is just confusing, and
! should be avoided.
  
  
  File: cpp.info,  Node: Operator Precedence Problems,  Next: Swallowing the Semicolon,  Prev: Misnesting,  Up: Macro Pitfalls
*************** way.
*** 2460,2467 ****
       #define ceil_div(x, y) (x + y - 1) / y
  
  whose purpose is to divide, rounding up.  (One use for this operation is
! to compute how many `int' objects are needed to hold a certain number
! of `char' objects.)  Then suppose it is used as follows:
  
       a = ceil_div (b & c, sizeof (int));
            ==> a = (b & c + sizeof (int) - 1) / sizeof (int);
--- 2446,2453 ----
       #define ceil_div(x, y) (x + y - 1) / y
  
  whose purpose is to divide, rounding up.  (One use for this operation is
! to compute how many 'int' objects are needed to hold a certain number of
! 'char' objects.)  Then suppose it is used as follows:
  
       a = ceil_div (b & c, sizeof (int));
            ==> a = (b & c + sizeof (int) - 1) / sizeof (int);
*************** Defining the macro as
*** 2481,2499 ****
  
  provides the desired result.
  
!    Unintended grouping can result in another way.  Consider `sizeof
  ceil_div(1, 2)'.  That has the appearance of a C expression that would
! compute the size of the type of `ceil_div (1, 2)', but in fact it means
  something very different.  Here is what it expands to:
  
       sizeof ((1) + (2) - 1) / (2)
  
  This would take the size of an integer and divide it by two.  The
! precedence rules have put the division outside the `sizeof' when it was
  intended to be inside.
  
     Parentheses around the entire macro definition prevent such problems.
! Here, then, is the recommended way to define `ceil_div':
  
       #define ceil_div(x, y) (((x) + (y) - 1) / (y))
  
--- 2467,2485 ----
  
  provides the desired result.
  
!    Unintended grouping can result in another way.  Consider 'sizeof
  ceil_div(1, 2)'.  That has the appearance of a C expression that would
! compute the size of the type of 'ceil_div (1, 2)', but in fact it means
  something very different.  Here is what it expands to:
  
       sizeof ((1) + (2) - 1) / (2)
  
  This would take the size of an integer and divide it by two.  The
! precedence rules have put the division outside the 'sizeof' when it was
  intended to be inside.
  
     Parentheses around the entire macro definition prevent such problems.
! Here, then, is the recommended way to define 'ceil_div':
  
       #define ceil_div(x, y) (((x) + (y) - 1) / (y))
  
*************** File: cpp.info,  Node: Swallowing the Se
*** 2505,2511 ****
  
  Often it is desirable to define a macro that expands into a compound
  statement.  Consider, for example, the following macro, that advances a
! pointer (the argument `p' says where to find it) across whitespace
  characters:
  
       #define SKIP_SPACES(p, limit)  \
--- 2491,2497 ----
  
  Often it is desirable to define a macro that expands into a compound
  statement.  Consider, for example, the following macro, that advances a
! pointer (the argument 'p' says where to find it) across whitespace
  characters:
  
       #define SKIP_SPACES(p, limit)  \
*************** Here backslash-newline is used to split
*** 2518,2531 ****
  be a single logical line, so that it resembles the way such code would
  be laid out if not part of a macro definition.
  
!    A call to this macro might be `SKIP_SPACES (p, lim)'.  Strictly
  speaking, the call expands to a compound statement, which is a complete
  statement with no need for a semicolon to end it.  However, since it
  looks like a function call, it minimizes confusion if you can use it
! like a function call, writing a semicolon afterward, as in `SKIP_SPACES
  (p, lim);'
  
!    This can cause trouble before `else' statements, because the
  semicolon is actually a null statement.  Suppose you write
  
       if (*p != 0)
--- 2504,2517 ----
  be a single logical line, so that it resembles the way such code would
  be laid out if not part of a macro definition.
  
!    A call to this macro might be 'SKIP_SPACES (p, lim)'.  Strictly
  speaking, the call expands to a compound statement, which is a complete
  statement with no need for a semicolon to end it.  However, since it
  looks like a function call, it minimizes confusion if you can use it
! like a function call, writing a semicolon afterward, as in 'SKIP_SPACES
  (p, lim);'
  
!    This can cause trouble before 'else' statements, because the
  semicolon is actually a null statement.  Suppose you write
  
       if (*p != 0)
*************** semicolon is actually a null statement.
*** 2533,2543 ****
       else ...
  
  The presence of two statements--the compound statement and a null
! statement--in between the `if' condition and the `else' makes invalid C
  code.
  
!    The definition of the macro `SKIP_SPACES' can be altered to solve
! this problem, using a `do ... while' statement.  Here is how:
  
       #define SKIP_SPACES(p, limit)     \
       do { char *lim = (limit);         \
--- 2519,2529 ----
       else ...
  
  The presence of two statements--the compound statement and a null
! statement--in between the 'if' condition and the 'else' makes invalid C
  code.
  
!    The definition of the macro 'SKIP_SPACES' can be altered to solve
! this problem, using a 'do ... while' statement.  Here is how:
  
       #define SKIP_SPACES(p, limit)     \
       do { char *lim = (limit);         \
*************** this problem, using a `do ... while' sta
*** 2546,2552 ****
                p--; break; }}}          \
       while (0)
  
!    Now `SKIP_SPACES (p, lim);' expands into
  
       do {...} while (0);
  
--- 2532,2538 ----
                p--; break; }}}          \
       while (0)
  
!    Now 'SKIP_SPACES (p, lim);' expands into
  
       do {...} while (0);
  
*************** File: cpp.info,  Node: Duplication of Si
*** 2559,2570 ****
  3.10.4 Duplication of Side Effects
  ----------------------------------
  
! Many C programs define a macro `min', for "minimum", like this:
  
       #define min(X, Y)  ((X) < (Y) ? (X) : (Y))
  
!    When you use this macro with an argument containing a side effect,
! as shown here,
  
       next = min (x + y, foo (z));
  
--- 2545,2556 ----
  3.10.4 Duplication of Side Effects
  ----------------------------------
  
! Many C programs define a macro 'min', for "minimum", like this:
  
       #define min(X, Y)  ((X) < (Y) ? (X) : (Y))
  
!    When you use this macro with an argument containing a side effect, as
! shown here,
  
       next = min (x + y, foo (z));
  
*************** it expands as follows:
*** 2572,2588 ****
  
       next = ((x + y) < (foo (z)) ? (x + y) : (foo (z)));
  
! where `x + y' has been substituted for `X' and `foo (z)' for `Y'.
  
!    The function `foo' is used only once in the statement as it appears
! in the program, but the expression `foo (z)' has been substituted twice
! into the macro expansion.  As a result, `foo' might be called two times
! when the statement is executed.  If it has side effects or if it takes
! a long time to compute, the results might not be what you intended.  We
! say that `min' is an "unsafe" macro.
  
!    The best solution to this problem is to define `min' in a way that
! computes the value of `foo (z)' only once.  The C language offers no
  standard way to do this, but it can be done with GNU extensions as
  follows:
  
--- 2558,2574 ----
  
       next = ((x + y) < (foo (z)) ? (x + y) : (foo (z)));
  
! where 'x + y' has been substituted for 'X' and 'foo (z)' for 'Y'.
  
!    The function 'foo' is used only once in the statement as it appears
! in the program, but the expression 'foo (z)' has been substituted twice
! into the macro expansion.  As a result, 'foo' might be called two times
! when the statement is executed.  If it has side effects or if it takes a
! long time to compute, the results might not be what you intended.  We
! say that 'min' is an "unsafe" macro.
  
!    The best solution to this problem is to define 'min' in a way that
! computes the value of 'foo (z)' only once.  The C language offers no
  standard way to do this, but it can be done with GNU extensions as
  follows:
  
*************** follows:
*** 2591,2597 ****
          typeof (Y) y_ = (Y);          \
          (x_ < y_) ? x_ : y_; })
  
!    The `({ ... })' notation produces a compound statement that acts as
  an expression.  Its value is the value of its last statement.  This
  permits us to define local variables and assign each argument to one.
  The local variables have underscores after their names to reduce the
--- 2577,2583 ----
          typeof (Y) y_ = (Y);          \
          (x_ < y_) ? x_ : y_; })
  
!    The '({ ... })' notation produces a compound statement that acts as
  an expression.  Its value is the value of its last statement.  This
  permits us to define local variables and assign each argument to one.
  The local variables have underscores after their names to reduce the
*************** risk of conflict with an identifier of w
*** 2599,2607 ****
  avoid this entirely).  Now each argument is evaluated exactly once.
  
     If you do not wish to use GNU C extensions, the only solution is to
! be careful when _using_ the macro `min'.  For example, you can
! calculate the value of `foo (z)', save it in a variable, and use that
! variable in `min':
  
       #define min(X, Y)  ((X) < (Y) ? (X) : (Y))
       ...
--- 2585,2593 ----
  avoid this entirely).  Now each argument is evaluated exactly once.
  
     If you do not wish to use GNU C extensions, the only solution is to
! be careful when _using_ the macro 'min'.  For example, you can calculate
! the value of 'foo (z)', save it in a variable, and use that variable in
! 'min':
  
       #define min(X, Y)  ((X) < (Y) ? (X) : (Y))
       ...
*************** variable in `min':
*** 2610,2616 ****
         next = min (x + y, tem);
       }
  
! (where we assume that `foo' returns type `int').
  
  
  File: cpp.info,  Node: Self-Referential Macros,  Next: Argument Prescan,  Prev: Duplication of Side Effects,  Up: Macro Pitfalls
--- 2596,2602 ----
         next = min (x + y, tem);
       }
  
! (where we assume that 'foo' returns type 'int').
  
  
  File: cpp.info,  Node: Self-Referential Macros,  Next: Argument Prescan,  Prev: Duplication of Side Effects,  Up: Macro Pitfalls
*************** preprocessor output unchanged.  Consider
*** 2627,2668 ****
  
       #define foo (4 + foo)
  
! where `foo' is also a variable in your program.
  
!    Following the ordinary rules, each reference to `foo' will expand
! into `(4 + foo)'; then this will be rescanned and will expand into `(4
! + (4 + foo))'; and so on until the computer runs out of memory.
  
     The self-reference rule cuts this process short after one step, at
! `(4 + foo)'.  Therefore, this macro definition has the possibly useful
! effect of causing the program to add 4 to the value of `foo' wherever
! `foo' is referred to.
  
     In most cases, it is a bad idea to take advantage of this feature.  A
! person reading the program who sees that `foo' is a variable will not
  expect that it is a macro as well.  The reader will come across the
! identifier `foo' in the program and think its value should be that of
! the variable `foo', whereas in fact the value is four greater.
  
     One common, useful use of self-reference is to create a macro which
  expands to itself.  If you write
  
       #define EPERM EPERM
  
! then the macro `EPERM' expands to `EPERM'.  Effectively, it is left
  alone by the preprocessor whenever it's used in running text.  You can
! tell that it's a macro with `#ifdef'.  You might do this if you want to
! define numeric constants with an `enum', but have `#ifdef' be true for
  each constant.
  
!    If a macro `x' expands to use a macro `y', and the expansion of `y'
! refers to the macro `x', that is an "indirect self-reference" of `x'.
! `x' is not expanded in this case either.  Thus, if we have
  
       #define x (4 + y)
       #define y (2 * x)
  
! then `x' and `y' expand as follows:
  
       x    ==> (4 + y)
            ==> (4 + (2 * x))
--- 2613,2654 ----
  
       #define foo (4 + foo)
  
! where 'foo' is also a variable in your program.
  
!    Following the ordinary rules, each reference to 'foo' will expand
! into '(4 + foo)'; then this will be rescanned and will expand into '(4 +
! (4 + foo))'; and so on until the computer runs out of memory.
  
     The self-reference rule cuts this process short after one step, at
! '(4 + foo)'.  Therefore, this macro definition has the possibly useful
! effect of causing the program to add 4 to the value of 'foo' wherever
! 'foo' is referred to.
  
     In most cases, it is a bad idea to take advantage of this feature.  A
! person reading the program who sees that 'foo' is a variable will not
  expect that it is a macro as well.  The reader will come across the
! identifier 'foo' in the program and think its value should be that of
! the variable 'foo', whereas in fact the value is four greater.
  
     One common, useful use of self-reference is to create a macro which
  expands to itself.  If you write
  
       #define EPERM EPERM
  
! then the macro 'EPERM' expands to 'EPERM'.  Effectively, it is left
  alone by the preprocessor whenever it's used in running text.  You can
! tell that it's a macro with '#ifdef'.  You might do this if you want to
! define numeric constants with an 'enum', but have '#ifdef' be true for
  each constant.
  
!    If a macro 'x' expands to use a macro 'y', and the expansion of 'y'
! refers to the macro 'x', that is an "indirect self-reference" of 'x'.
! 'x' is not expanded in this case either.  Thus, if we have
  
       #define x (4 + y)
       #define y (2 * x)
  
! then 'x' and 'y' expand as follows:
  
       x    ==> (4 + y)
            ==> (4 + (2 * x))
*************** same results.
*** 2695,2722 ****
  
     You might expect the double scan to change the results when a
  self-referential macro is used in an argument of another macro (*note
! Self-Referential Macros::): the self-referential macro would be
! expanded once in the first scan, and a second time in the second scan.
! However, this is not what happens.  The self-references that do not
! expand in the first scan are marked so that they will not expand in the
! second scan either.
  
     You might wonder, "Why mention the prescan, if it makes no
! difference?  And why not skip it and make the preprocessor faster?"
! The answer is that the prescan does make a difference in three special
  cases:
  
     * Nested calls to a macro.
  
       We say that "nested" calls to a macro occur when a macro's argument
!      contains a call to that very macro.  For example, if `f' is a macro
!      that expects one argument, `f (f (1))' is a nested pair of calls to
!      `f'.  The desired expansion is made by expanding `f (1)' and
!      substituting that into the definition of `f'.  The prescan causes
!      the expected result to happen.  Without the prescan, `f (1)' itself
!      would be substituted as an argument, and the inner use of `f' would
!      appear during the main scan as an indirect self-reference and
!      would not be expanded.
  
     * Macros that call other macros that stringify or concatenate.
  
--- 2681,2708 ----
  
     You might expect the double scan to change the results when a
  self-referential macro is used in an argument of another macro (*note
! Self-Referential Macros::): the self-referential macro would be expanded
! once in the first scan, and a second time in the second scan.  However,
! this is not what happens.  The self-references that do not expand in the
! first scan are marked so that they will not expand in the second scan
! either.
  
     You might wonder, "Why mention the prescan, if it makes no
! difference?  And why not skip it and make the preprocessor faster?"  The
! answer is that the prescan does make a difference in three special
  cases:
  
     * Nested calls to a macro.
  
       We say that "nested" calls to a macro occur when a macro's argument
!      contains a call to that very macro.  For example, if 'f' is a macro
!      that expects one argument, 'f (f (1))' is a nested pair of calls to
!      'f'.  The desired expansion is made by expanding 'f (1)' and
!      substituting that into the definition of 'f'.  The prescan causes
!      the expected result to happen.  Without the prescan, 'f (1)' itself
!      would be substituted as an argument, and the inner use of 'f' would
!      appear during the main scan as an indirect self-reference and would
!      not be expanded.
  
     * Macros that call other macros that stringify or concatenate.
  
*************** cases:
*** 2731,2738 ****
            #define TABLESIZE 1024
            #define BUFSIZE TABLESIZE
  
!      then `AFTERX(BUFSIZE)' expands to `X_BUFSIZE', and
!      `XAFTERX(BUFSIZE)' expands to `X_1024'.  (Not to `X_TABLESIZE'.
       Prescan always does a complete expansion.)
  
     * Macros used in arguments, whose expansions contain unshielded
--- 2717,2724 ----
            #define TABLESIZE 1024
            #define BUFSIZE TABLESIZE
  
!      then 'AFTERX(BUFSIZE)' expands to 'X_BUFSIZE', and
!      'XAFTERX(BUFSIZE)' expands to 'X_1024'.  (Not to 'X_TABLESIZE'.
       Prescan always does a complete expansion.)
  
     * Macros used in arguments, whose expansions contain unshielded
*************** cases:
*** 2745,2753 ****
            #define bar(x) lose(x)
            #define lose(x) (1 + (x))
  
!      We would like `bar(foo)' to turn into `(1 + (foo))', which would
!      then turn into `(1 + (a,b))'.  Instead, `bar(foo)' expands into
!      `lose(a,b)', and you get an error because `lose' requires a single
       argument.  In this case, the problem is easily solved by the same
       parentheses that ought to be used to prevent misnesting of
       arithmetic operations:
--- 2731,2739 ----
            #define bar(x) lose(x)
            #define lose(x) (1 + (x))
  
!      We would like 'bar(foo)' to turn into '(1 + (foo))', which would
!      then turn into '(1 + (a,b))'.  Instead, 'bar(foo)' expands into
!      'lose(a,b)', and you get an error because 'lose' requires a single
       argument.  In this case, the problem is easily solved by the same
       parentheses that ought to be used to prevent misnesting of
       arithmetic operations:
*************** cases:
*** 2756,2765 ****
       or
            #define bar(x) lose((x))
  
!      The extra pair of parentheses prevents the comma in `foo''s
       definition from being interpreted as an argument separator.
  
- 
  
  File: cpp.info,  Node: Newlines in Arguments,  Prev: Argument Prescan,  Up: Macro Pitfalls
  
--- 2742,2750 ----
       or
            #define bar(x) lose((x))
  
!      The extra pair of parentheses prevents the comma in 'foo''s
       definition from being interpreted as an argument separator.
  
  
  File: cpp.info,  Node: Newlines in Arguments,  Prev: Argument Prescan,  Up: Macro Pitfalls
  
*************** different to the line containing the arg
*** 2780,2786 ****
                          ignored (),
                          syntax error);
  
! The syntax error triggered by the tokens `syntax error' results in an
  error message citing line three--the line of ignore_second_arg-- even
  though the problematic code comes from line five.
  
--- 2765,2771 ----
                          ignored (),
                          syntax error);
  
! The syntax error triggered by the tokens 'syntax error' results in an
  error message citing line three--the line of ignore_second_arg-- even
  though the problematic code comes from line five.
  
*************** File: cpp.info,  Node: Conditionals,  Ne
*** 2792,2818 ****
  4 Conditionals
  **************
  
! A "conditional" is a directive that instructs the preprocessor to
! select whether or not to include a chunk of code in the final token
! stream passed to the compiler.  Preprocessor conditionals can test
! arithmetic expressions, or whether a name is defined as a macro, or both
! simultaneously using the special `defined' operator.
  
!    A conditional in the C preprocessor resembles in some ways an `if'
  statement in C, but it is important to understand the difference between
! them.  The condition in an `if' statement is tested during the
! execution of your program.  Its purpose is to allow your program to
! behave differently from run to run, depending on the data it is
! operating on.  The condition in a preprocessing conditional directive is
! tested when your program is compiled.  Its purpose is to allow different
! code to be included in the program depending on the situation at the
! time of compilation.
  
     However, the distinction is becoming less clear.  Modern compilers
! often do test `if' statements when a program is compiled, if their
  conditions are known not to vary at run time, and eliminate code which
  can never be executed.  If you can count on your compiler to do this,
! you may find that your program is more readable if you use `if'
  statements with constant conditions (perhaps determined by macros).  Of
  course, you can only use this to exclude code, not type definitions or
  other preprocessing directives, and you can only do it if the code
--- 2777,2803 ----
  4 Conditionals
  **************
  
! A "conditional" is a directive that instructs the preprocessor to select
! whether or not to include a chunk of code in the final token stream
! passed to the compiler.  Preprocessor conditionals can test arithmetic
! expressions, or whether a name is defined as a macro, or both
! simultaneously using the special 'defined' operator.
  
!    A conditional in the C preprocessor resembles in some ways an 'if'
  statement in C, but it is important to understand the difference between
! them.  The condition in an 'if' statement is tested during the execution
! of your program.  Its purpose is to allow your program to behave
! differently from run to run, depending on the data it is operating on.
! The condition in a preprocessing conditional directive is tested when
! your program is compiled.  Its purpose is to allow different code to be
! included in the program depending on the situation at the time of
! compilation.
  
     However, the distinction is becoming less clear.  Modern compilers
! often do test 'if' statements when a program is compiled, if their
  conditions are known not to vary at run time, and eliminate code which
  can never be executed.  If you can count on your compiler to do this,
! you may find that your program is more readable if you use 'if'
  statements with constant conditions (perhaps determined by macros).  Of
  course, you can only use this to exclude code, not type definitions or
  other preprocessing directives, and you can only do it if the code
*************** There are three general reasons to use a
*** 2840,2858 ****
       one operating system may be erroneous on another operating system;
       for example, it might refer to data types or constants that do not
       exist on the other system.  When this happens, it is not enough to
!      avoid executing the invalid code.  Its mere presence will cause
!      the compiler to reject the program.  With a preprocessing
!      conditional, the offending code can be effectively excised from
!      the program when it is not valid.
  
     * You may want to be able to compile the same source file into two
       different programs.  One version might make frequent time-consuming
       consistency checks on its intermediate data, or print the values of
       those data for debugging, and the other not.
  
!    * A conditional whose condition is always false is one way to
!      exclude code from the program but keep it as a sort of comment for
!      future reference.
  
     Simple programs that do not need system-specific logic or complex
  debugging hooks generally will not need to use preprocessing
--- 2825,2843 ----
       one operating system may be erroneous on another operating system;
       for example, it might refer to data types or constants that do not
       exist on the other system.  When this happens, it is not enough to
!      avoid executing the invalid code.  Its mere presence will cause the
!      compiler to reject the program.  With a preprocessing conditional,
!      the offending code can be effectively excised from the program when
!      it is not valid.
  
     * You may want to be able to compile the same source file into two
       different programs.  One version might make frequent time-consuming
       consistency checks on its intermediate data, or print the values of
       those data for debugging, and the other not.
  
!    * A conditional whose condition is always false is one way to exclude
!      code from the program but keep it as a sort of comment for future
!      reference.
  
     Simple programs that do not need system-specific logic or complex
  debugging hooks generally will not need to use preprocessing
*************** File: cpp.info,  Node: Conditional Synta
*** 2865,2871 ****
  ======================
  
  A conditional in the C preprocessor begins with a "conditional
! directive": `#if', `#ifdef' or `#ifndef'.
  
  * Menu:
  
--- 2850,2856 ----
  ======================
  
  A conditional in the C preprocessor begins with a "conditional
! directive": '#if', '#ifdef' or '#ifndef'.
  
  * Menu:
  
*************** included in the output of the preprocess
*** 2894,2905 ****
  defined.  We say that the conditional "succeeds" if MACRO is defined,
  "fails" if it is not.
  
!    The CONTROLLED TEXT inside of a conditional can include
! preprocessing directives.  They are executed only if the conditional
! succeeds.  You can nest conditional groups inside other conditional
! groups, but they must be completely nested.  In other words, `#endif'
! always matches the nearest `#ifdef' (or `#ifndef', or `#if').  Also,
! you cannot start a conditional group in one file and end it in another.
  
     Even if a conditional fails, the CONTROLLED TEXT inside it is still
  run through initial transformations and tokenization.  Therefore, it
--- 2879,2890 ----
  defined.  We say that the conditional "succeeds" if MACRO is defined,
  "fails" if it is not.
  
!    The CONTROLLED TEXT inside of a conditional can include preprocessing
! directives.  They are executed only if the conditional succeeds.  You
! can nest conditional groups inside other conditional groups, but they
! must be completely nested.  In other words, '#endif' always matches the
! nearest '#ifdef' (or '#ifndef', or '#if').  Also, you cannot start a
! conditional group in one file and end it in another.
  
     Even if a conditional fails, the CONTROLLED TEXT inside it is still
  run through initial transformations and tokenization.  Therefore, it
*************** must all be lexically valid C.  Normally
*** 2907,2924 ****
  that all comments and string literals inside a failing conditional group
  must still be properly ended.
  
!    The comment following the `#endif' is not required, but it is a good
  practice if there is a lot of CONTROLLED TEXT, because it helps people
! match the `#endif' to the corresponding `#ifdef'.  Older programs
! sometimes put MACRO directly after the `#endif' without enclosing it in
  a comment.  This is invalid code according to the C standard.  CPP
! accepts it with a warning.  It never affects which `#ifndef' the
! `#endif' matches.
  
!    Sometimes you wish to use some code if a macro is _not_ defined.
! You can do this by writing `#ifndef' instead of `#ifdef'.  One common
! use of `#ifndef' is to include code only the first time a header file
! is included.  *Note Once-Only Headers::.
  
     Macro definitions can vary between compilations for several reasons.
  Here are some samples.
--- 2892,2909 ----
  that all comments and string literals inside a failing conditional group
  must still be properly ended.
  
!    The comment following the '#endif' is not required, but it is a good
  practice if there is a lot of CONTROLLED TEXT, because it helps people
! match the '#endif' to the corresponding '#ifdef'.  Older programs
! sometimes put MACRO directly after the '#endif' without enclosing it in
  a comment.  This is invalid code according to the C standard.  CPP
! accepts it with a warning.  It never affects which '#ifndef' the
! '#endif' matches.
  
!    Sometimes you wish to use some code if a macro is _not_ defined.  You
! can do this by writing '#ifndef' instead of '#ifdef'.  One common use of
! '#ifndef' is to include code only the first time a header file is
! included.  *Note Once-Only Headers::.
  
     Macro definitions can vary between compilations for several reasons.
  Here are some samples.
*************** Here are some samples.
*** 2932,2952 ****
       conditionals to avoid using a system feature on a machine where it
       is not implemented.
  
!    * Macros can be defined or undefined with the `-D' and `-U'
!      command-line options when you compile the program.  You can
!      arrange to compile the same source file into two different
!      programs by choosing a macro name to specify which program you
!      want, writing conditionals to test whether or how this macro is
!      defined, and then controlling the state of the macro with
!      command-line options, perhaps set in the Makefile.  *Note
!      Invocation::.
  
     * Your program might have a special header file (often called
!      `config.h') that is adjusted when the program is compiled.  It can
!      define or not define macros depending on the features of the
!      system and the desired capabilities of the program.  The
!      adjustment can be automated by a tool such as `autoconf', or done
!      by hand.
  
  
  File: cpp.info,  Node: If,  Next: Defined,  Prev: Ifdef,  Up: Conditional Syntax
--- 2917,2935 ----
       conditionals to avoid using a system feature on a machine where it
       is not implemented.
  
!    * Macros can be defined or undefined with the '-D' and '-U'
!      command-line options when you compile the program.  You can arrange
!      to compile the same source file into two different programs by
!      choosing a macro name to specify which program you want, writing
!      conditionals to test whether or how this macro is defined, and then
!      controlling the state of the macro with command-line options,
!      perhaps set in the Makefile.  *Note Invocation::.
  
     * Your program might have a special header file (often called
!      'config.h') that is adjusted when the program is compiled.  It can
!      define or not define macros depending on the features of the system
!      and the desired capabilities of the program.  The adjustment can be
!      automated by a tool such as 'autoconf', or done by hand.
  
  
  File: cpp.info,  Node: If,  Next: Defined,  Prev: Ifdef,  Up: Conditional Syntax
*************** File: cpp.info,  Node: If,  Next: Define
*** 2954,2960 ****
  4.2.2 If
  --------
  
! The `#if' directive allows you to test the value of an arithmetic
  expression, rather than the mere existence of one macro.  Its syntax is
  
       #if EXPRESSION
--- 2937,2943 ----
  4.2.2 If
  --------
  
! The '#if' directive allows you to test the value of an arithmetic
  expression, rather than the mere existence of one macro.  Its syntax is
  
       #if EXPRESSION
*************** restrictions.  It may contain
*** 2973,3001 ****
  
     * Arithmetic operators for addition, subtraction, multiplication,
       division, bitwise operations, shifts, comparisons, and logical
!      operations (`&&' and `||').  The latter two obey the usual
       short-circuiting rules of standard C.
  
     * Macros.  All macros in the expression are expanded before actual
       computation of the expression's value begins.
  
!    * Uses of the `defined' operator, which lets you check whether macros
!      are defined in the middle of an `#if'.
  
     * Identifiers that are not macros, which are all considered to be the
!      number zero.  This allows you to write `#if MACRO' instead of
!      `#ifdef MACRO', if you know that MACRO, when defined, will always
       have a nonzero value.  Function-like macros used without their
       function call parentheses are also treated as zero.
  
!      In some contexts this shortcut is undesirable.  The `-Wundef'
       option causes GCC to warn whenever it encounters an identifier
!      which is not a macro in an `#if'.
  
     The preprocessor does not know anything about types in the language.
! Therefore, `sizeof' operators are not recognized in `#if', and neither
! are `enum' constants.  They will be taken as identifiers which are not
! macros, and replaced by zero.  In the case of `sizeof', this is likely
  to cause the expression to be invalid.
  
     The preprocessor calculates the value of EXPRESSION.  It carries out
--- 2956,2984 ----
  
     * Arithmetic operators for addition, subtraction, multiplication,
       division, bitwise operations, shifts, comparisons, and logical
!      operations ('&&' and '||').  The latter two obey the usual
       short-circuiting rules of standard C.
  
     * Macros.  All macros in the expression are expanded before actual
       computation of the expression's value begins.
  
!    * Uses of the 'defined' operator, which lets you check whether macros
!      are defined in the middle of an '#if'.
  
     * Identifiers that are not macros, which are all considered to be the
!      number zero.  This allows you to write '#if MACRO' instead of
!      '#ifdef MACRO', if you know that MACRO, when defined, will always
       have a nonzero value.  Function-like macros used without their
       function call parentheses are also treated as zero.
  
!      In some contexts this shortcut is undesirable.  The '-Wundef'
       option causes GCC to warn whenever it encounters an identifier
!      which is not a macro in an '#if'.
  
     The preprocessor does not know anything about types in the language.
! Therefore, 'sizeof' operators are not recognized in '#if', and neither
! are 'enum' constants.  They will be taken as identifiers which are not
! macros, and replaced by zero.  In the case of 'sizeof', this is likely
  to cause the expression to be invalid.
  
     The preprocessor calculates the value of EXPRESSION.  It carries out
*************** all calculations in the widest integer t
*** 3003,3009 ****
  most machines supported by GCC this is 64 bits.  This is not the same
  rule as the compiler uses to calculate the value of a constant
  expression, and may give different results in some cases.  If the value
! comes out to be nonzero, the `#if' succeeds and the CONTROLLED TEXT is
  included; otherwise it is skipped.
  
  
--- 2986,2992 ----
  most machines supported by GCC this is 64 bits.  This is not the same
  rule as the compiler uses to calculate the value of a constant
  expression, and may give different results in some cases.  If the value
! comes out to be nonzero, the '#if' succeeds and the CONTROLLED TEXT is
  included; otherwise it is skipped.
  
  
*************** File: cpp.info,  Node: Defined,  Next: E
*** 3012,3045 ****
  4.2.3 Defined
  -------------
  
! The special operator `defined' is used in `#if' and `#elif' expressions
! to test whether a certain name is defined as a macro.  `defined NAME'
! and `defined (NAME)' are both expressions whose value is 1 if NAME is
! defined as a macro at the current point in the program, and 0
! otherwise.  Thus,  `#if defined MACRO' is precisely equivalent to
! `#ifdef MACRO'.
  
!    `defined' is useful when you wish to test more than one macro for
  existence at once.  For example,
  
       #if defined (__vax__) || defined (__ns16000__)
  
! would succeed if either of the names `__vax__' or `__ns16000__' is
  defined as a macro.
  
     Conditionals written like this:
  
       #if defined BUFSIZE && BUFSIZE >= 1024
  
! can generally be simplified to just `#if BUFSIZE >= 1024', since if
! `BUFSIZE' is not defined, it will be interpreted as having the value
  zero.
  
!    If the `defined' operator appears as a result of a macro expansion,
  the C standard says the behavior is undefined.  GNU cpp treats it as a
! genuine `defined' operator and evaluates it normally.  It will warn
  wherever your code uses this feature if you use the command-line option
! `-pedantic', since other compilers may handle it differently.
  
  
  File: cpp.info,  Node: Else,  Next: Elif,  Prev: Defined,  Up: Conditional Syntax
--- 2995,3027 ----
  4.2.3 Defined
  -------------
  
! The special operator 'defined' is used in '#if' and '#elif' expressions
! to test whether a certain name is defined as a macro.  'defined NAME'
! and 'defined (NAME)' are both expressions whose value is 1 if NAME is
! defined as a macro at the current point in the program, and 0 otherwise.
! Thus, '#if defined MACRO' is precisely equivalent to '#ifdef MACRO'.
  
!    'defined' is useful when you wish to test more than one macro for
  existence at once.  For example,
  
       #if defined (__vax__) || defined (__ns16000__)
  
! would succeed if either of the names '__vax__' or '__ns16000__' is
  defined as a macro.
  
     Conditionals written like this:
  
       #if defined BUFSIZE && BUFSIZE >= 1024
  
! can generally be simplified to just '#if BUFSIZE >= 1024', since if
! 'BUFSIZE' is not defined, it will be interpreted as having the value
  zero.
  
!    If the 'defined' operator appears as a result of a macro expansion,
  the C standard says the behavior is undefined.  GNU cpp treats it as a
! genuine 'defined' operator and evaluates it normally.  It will warn
  wherever your code uses this feature if you use the command-line option
! '-pedantic', since other compilers may handle it differently.
  
  
  File: cpp.info,  Node: Else,  Next: Elif,  Prev: Defined,  Up: Conditional Syntax
*************** File: cpp.info,  Node: Else,  Next: Elif
*** 3047,3053 ****
  4.2.4 Else
  ----------
  
! The `#else' directive can be added to a conditional to provide
  alternative text to be used if the condition fails.  This is what it
  looks like:
  
--- 3029,3035 ----
  4.2.4 Else
  ----------
  
! The '#else' directive can be added to a conditional to provide
  alternative text to be used if the condition fails.  This is what it
  looks like:
  
*************** looks like:
*** 3060,3066 ****
  If EXPRESSION is nonzero, the TEXT-IF-TRUE is included and the
  TEXT-IF-FALSE is skipped.  If EXPRESSION is zero, the opposite happens.
  
!    You can use `#else' with `#ifdef' and `#ifndef', too.
  
  
  File: cpp.info,  Node: Elif,  Prev: Else,  Up: Conditional Syntax
--- 3042,3048 ----
  If EXPRESSION is nonzero, the TEXT-IF-TRUE is included and the
  TEXT-IF-FALSE is skipped.  If EXPRESSION is zero, the opposite happens.
  
!    You can use '#else' with '#ifdef' and '#ifndef', too.
  
  
  File: cpp.info,  Node: Elif,  Prev: Else,  Up: Conditional Syntax
*************** two possible alternatives.  For example,
*** 3081,3088 ****
       #endif /* X != 2 */
       #endif /* X != 1 */
  
!    Another conditional directive, `#elif', allows this to be
! abbreviated as follows:
  
       #if X == 1
       ...
--- 3063,3070 ----
       #endif /* X != 2 */
       #endif /* X != 1 */
  
!    Another conditional directive, '#elif', allows this to be abbreviated
! as follows:
  
       #if X == 1
       ...
*************** abbreviated as follows:
*** 3092,3111 ****
       ...
       #endif /* X != 2 and X != 1*/
  
!    `#elif' stands for "else if".  Like `#else', it goes in the middle
! of a conditional group and subdivides it; it does not require a
! matching `#endif' of its own.  Like `#if', the `#elif' directive
! includes an expression to be tested.  The text following the `#elif' is
! processed only if the original `#if'-condition failed and the `#elif'
! condition succeeds.
  
!    More than one `#elif' can go in the same conditional group.  Then
! the text after each `#elif' is processed only if the `#elif' condition
! succeeds after the original `#if' and all previous `#elif' directives
  within it have failed.
  
!    `#else' is allowed after any number of `#elif' directives, but
! `#elif' may not follow `#else'.
  
  
  File: cpp.info,  Node: Deleted Code,  Prev: Conditional Syntax,  Up: Conditionals
--- 3074,3093 ----
       ...
       #endif /* X != 2 and X != 1*/
  
!    '#elif' stands for "else if".  Like '#else', it goes in the middle of
! a conditional group and subdivides it; it does not require a matching
! '#endif' of its own.  Like '#if', the '#elif' directive includes an
! expression to be tested.  The text following the '#elif' is processed
! only if the original '#if'-condition failed and the '#elif' condition
! succeeds.
  
!    More than one '#elif' can go in the same conditional group.  Then the
! text after each '#elif' is processed only if the '#elif' condition
! succeeds after the original '#if' and all previous '#elif' directives
  within it have failed.
  
!    '#else' is allowed after any number of '#elif' directives, but
! '#elif' may not follow '#else'.
  
  
  File: cpp.info,  Node: Deleted Code,  Prev: Conditional Syntax,  Up: Conditionals
*************** code will end the commenting-out.  The p
*** 3120,3139 ****
  syntax errors.
  
     One way to avoid this problem is to use an always-false conditional
! instead.  For instance, put `#if 0' before the deleted code and
! `#endif' after it.  This works even if the code being turned off
! contains conditionals, but they must be entire conditionals (balanced
! `#if' and `#endif').
  
!    Some people use `#ifdef notdef' instead.  This is risky, because
! `notdef' might be accidentally defined as a macro, and then the
! conditional would succeed.  `#if 0' can be counted on to fail.
  
!    Do not use `#if 0' for comments which are not C code.  Use a real
! comment, instead.  The interior of `#if 0' must consist of complete
  tokens; in particular, single-quote characters must balance.  Comments
  often contain unbalanced single-quote characters (known in English as
! apostrophes).  These confuse `#if 0'.  They don't confuse `/*'.
  
  
  File: cpp.info,  Node: Diagnostics,  Next: Line Control,  Prev: Conditionals,  Up: Top
--- 3102,3121 ----
  syntax errors.
  
     One way to avoid this problem is to use an always-false conditional
! instead.  For instance, put '#if 0' before the deleted code and '#endif'
! after it.  This works even if the code being turned off contains
! conditionals, but they must be entire conditionals (balanced '#if' and
! '#endif').
  
!    Some people use '#ifdef notdef' instead.  This is risky, because
! 'notdef' might be accidentally defined as a macro, and then the
! conditional would succeed.  '#if 0' can be counted on to fail.
  
!    Do not use '#if 0' for comments which are not C code.  Use a real
! comment, instead.  The interior of '#if 0' must consist of complete
  tokens; in particular, single-quote characters must balance.  Comments
  often contain unbalanced single-quote characters (known in English as
! apostrophes).  These confuse '#if 0'.  They don't confuse '/*'.
  
  
  File: cpp.info,  Node: Diagnostics,  Next: Line Control,  Prev: Conditionals,  Up: Top
*************** File: cpp.info,  Node: Diagnostics,  Nex
*** 3141,3151 ****
  5 Diagnostics
  *************
  
! The directive `#error' causes the preprocessor to report a fatal error.
! The tokens forming the rest of the line following `#error' are used as
  the error message.
  
!    You would use `#error' inside of a conditional that detects a
  combination of parameters which you know the program does not properly
  support.  For example, if you know that the program will not run
  properly on a VAX, you might write
--- 3123,3133 ----
  5 Diagnostics
  *************
  
! The directive '#error' causes the preprocessor to report a fatal error.
! The tokens forming the rest of the line following '#error' are used as
  the error message.
  
!    You would use '#error' inside of a conditional that detects a
  combination of parameters which you know the program does not properly
  support.  For example, if you know that the program will not run
  properly on a VAX, you might write
*************** properly on a VAX, you might write
*** 3156,3179 ****
  
     If you have several configuration parameters that must be set up by
  the installation in a consistent way, you can use conditionals to detect
! an inconsistency and report it with `#error'.  For example,
  
       #if !defined(FOO) && defined(BAR)
       #error "BAR requires FOO."
       #endif
  
!    The directive `#warning' is like `#error', but causes the
  preprocessor to issue a warning and continue preprocessing.  The tokens
! following `#warning' are used as the warning message.
  
!    You might use `#warning' in obsolete header files, with a message
  directing the user to the header file which should be used instead.
  
!    Neither `#error' nor `#warning' macro-expands its argument.
! Internal whitespace sequences are each replaced with a single space.
! The line must consist of complete tokens.  It is wisest to make the
! argument of these directives be a single string constant; this avoids
! problems with apostrophes and the like.
  
  
  File: cpp.info,  Node: Line Control,  Next: Pragmas,  Prev: Diagnostics,  Up: Top
--- 3138,3161 ----
  
     If you have several configuration parameters that must be set up by
  the installation in a consistent way, you can use conditionals to detect
! an inconsistency and report it with '#error'.  For example,
  
       #if !defined(FOO) && defined(BAR)
       #error "BAR requires FOO."
       #endif
  
!    The directive '#warning' is like '#error', but causes the
  preprocessor to issue a warning and continue preprocessing.  The tokens
! following '#warning' are used as the warning message.
  
!    You might use '#warning' in obsolete header files, with a message
  directing the user to the header file which should be used instead.
  
!    Neither '#error' nor '#warning' macro-expands its argument.  Internal
! whitespace sequences are each replaced with a single space.  The line
! must consist of complete tokens.  It is wisest to make the argument of
! these directives be a single string constant; this avoids problems with
! apostrophes and the like.
  
  
  File: cpp.info,  Node: Line Control,  Next: Pragmas,  Prev: Diagnostics,  Up: Top
*************** reported as having appeared on the line
*** 3188,3246 ****
  outermost macro was used.  We intend to be more accurate in the future.
  
     If you write a program which generates source code, such as the
! `bison' parser generator, you may want to adjust the preprocessor's
  notion of the current file name and line number by hand.  Parts of the
! output from `bison' are generated from scratch, other parts come from a
! standard parser file.  The rest are copied verbatim from `bison''s
! input.  You would like compiler error messages and symbolic debuggers
! to be able to refer to `bison''s input file.
  
!    `bison' or any such program can arrange this by writing `#line'
! directives into the output file.  `#line' is a directive that specifies
  the original line number and source file name for subsequent input in
! the current preprocessor input file.  `#line' has three variants:
  
! `#line LINENUM'
       LINENUM is a non-negative decimal integer constant.  It specifies
       the line number which should be reported for the following line of
       input.  Subsequent lines are counted from LINENUM.
  
! `#line LINENUM FILENAME'
!      LINENUM is the same as for the first form, and has the same
!      effect.  In addition, FILENAME is a string constant.  The
!      following line and all subsequent lines are reported to come from
!      the file it specifies, until something else happens to change that.
!      FILENAME is interpreted according to the normal rules for a string
!      constant: backslash escapes are interpreted.  This is different
!      from `#include'.
  
!      Previous versions of CPP did not interpret escapes in `#line'; we
       have changed it because the standard requires they be interpreted,
       and most other compilers do.
  
! `#line ANYTHING ELSE'
       ANYTHING ELSE is checked for macro calls, which are expanded.  The
       result should match one of the above two forms.
  
!    `#line' directives alter the results of the `__FILE__' and
! `__LINE__' predefined macros from that point on.  *Note Standard
! Predefined Macros::.  They do not have any effect on `#include''s idea
! of the directory containing the current file.  This is a change from
! GCC 2.95.  Previously, a file reading
  
-      #line 1 "../src/gram.y"
       #include "gram.h"
  
!    would search for `gram.h' in `../src', then the `-I' chain; the
! directory containing the physical source file would not be searched.
! In GCC 3.0 and later, the `#include' is not affected by the presence of
! a `#line' referring to a different directory.
  
     We made this change because the old behavior caused problems when
  generated source files were transported between machines.  For instance,
  it is common practice to ship generated parsers with a source release,
  so that people building the distribution do not need to have yacc or
! Bison installed.  These files frequently have `#line' directives
  referring to the directory tree of the system where the distribution was
  created.  If GCC tries to search for headers in those directories, the
  build is likely to fail.
--- 3170,3227 ----
  outermost macro was used.  We intend to be more accurate in the future.
  
     If you write a program which generates source code, such as the
! 'bison' parser generator, you may want to adjust the preprocessor's
  notion of the current file name and line number by hand.  Parts of the
! output from 'bison' are generated from scratch, other parts come from a
! standard parser file.  The rest are copied verbatim from 'bison''s
! input.  You would like compiler error messages and symbolic debuggers to
! be able to refer to 'bison''s input file.
  
!    'bison' or any such program can arrange this by writing '#line'
! directives into the output file.  '#line' is a directive that specifies
  the original line number and source file name for subsequent input in
! the current preprocessor input file.  '#line' has three variants:
  
! '#line LINENUM'
       LINENUM is a non-negative decimal integer constant.  It specifies
       the line number which should be reported for the following line of
       input.  Subsequent lines are counted from LINENUM.
  
! '#line LINENUM FILENAME'
!      LINENUM is the same as for the first form, and has the same effect.
!      In addition, FILENAME is a string constant.  The following line and
!      all subsequent lines are reported to come from the file it
!      specifies, until something else happens to change that.  FILENAME
!      is interpreted according to the normal rules for a string constant:
!      backslash escapes are interpreted.  This is different from
!      '#include'.
  
!      Previous versions of CPP did not interpret escapes in '#line'; we
       have changed it because the standard requires they be interpreted,
       and most other compilers do.
  
! '#line ANYTHING ELSE'
       ANYTHING ELSE is checked for macro calls, which are expanded.  The
       result should match one of the above two forms.
  
!    '#line' directives alter the results of the '__FILE__' and '__LINE__'
! predefined macros from that point on.  *Note Standard Predefined
! Macros::.  They do not have any effect on '#include''s idea of the
! directory containing the current file.  This is a change from GCC 2.95.
! Previously, a file reading
  
       #include "gram.h"
  
!    would search for 'gram.h' in '../src', then the '-I' chain; the
! directory containing the physical source file would not be searched.  In
! GCC 3.0 and later, the '#include' is not affected by the presence of a
! '#line' referring to a different directory.
  
     We made this change because the old behavior caused problems when
  generated source files were transported between machines.  For instance,
  it is common practice to ship generated parsers with a source release,
  so that people building the distribution do not need to have yacc or
! Bison installed.  These files frequently have '#line' directives
  referring to the directory tree of the system where the distribution was
  created.  If GCC tries to search for headers in those directories, the
  build is likely to fail.
*************** build is likely to fail.
*** 3249,3255 ****
  in the same directory as its source and it attempts to include a header
  which would be visible searching from the directory containing the
  source file.  However, this problem is easily solved with an additional
! `-I' switch on the command line.  The failures caused by the old
  semantics could sometimes be corrected only by editing the generated
  files, which is difficult and error-prone.
  
--- 3230,3236 ----
  in the same directory as its source and it attempts to include a header
  which would be visible searching from the directory containing the
  source file.  However, this problem is easily solved with an additional
! '-I' switch on the command line.  The failures caused by the old
  semantics could sometimes be corrected only by editing the generated
  files, which is difficult and error-prone.
  
*************** File: cpp.info,  Node: Pragmas,  Next: O
*** 3259,3306 ****
  7 Pragmas
  *********
  
! The `#pragma' directive is the method specified by the C standard for
  providing additional information to the compiler, beyond what is
  conveyed in the language itself.  Three forms of this directive
! (commonly known as "pragmas") are specified by the 1999 C standard.  A
! C compiler is free to attach any meaning it likes to other pragmas.
  
     GCC has historically preferred to use extensions to the syntax of the
! language, such as `__attribute__', for this purpose.  However, GCC does
  define a few pragmas of its own.  These mostly have effects on the
  entire translation unit or source file.
  
     In GCC version 3, all GNU-defined, supported pragmas have been given
! a `GCC' prefix.  This is in line with the `STDC' prefix on all pragmas
  defined by C99.  For backward compatibility, pragmas which were
! recognized by previous versions are still recognized without the `GCC'
! prefix, but that usage is deprecated.  Some older pragmas are
! deprecated in their entirety.  They are not recognized with the `GCC'
! prefix.  *Note Obsolete Features::.
  
!    C99 introduces the `_Pragma' operator.  This feature addresses a
! major problem with `#pragma': being a directive, it cannot be produced
! as the result of macro expansion.  `_Pragma' is an operator, much like
! `sizeof' or `defined', and can be embedded in a macro.
  
!    Its syntax is `_Pragma (STRING-LITERAL)', where STRING-LITERAL can
! be either a normal or wide-character string literal.  It is
! destringized, by replacing all `\\' with a single `\' and all `\"' with
! a `"'.  The result is then processed as if it had appeared as the right
! hand side of a `#pragma' directive.  For example,
  
       _Pragma ("GCC dependency \"parse.y\"")
  
! has the same effect as `#pragma GCC dependency "parse.y"'.  The same
  effect could be achieved using macros, for example
  
       #define DO_PRAGMA(x) _Pragma (#x)
       DO_PRAGMA (GCC dependency "parse.y")
  
!    The standard is unclear on where a `_Pragma' operator can appear.
  The preprocessor does not accept it within a preprocessing conditional
! directive like `#if'.  To be safe, you are probably best keeping it out
! of directives other than `#define', and putting it on a line of its own.
  
     This manual documents the pragmas which are meaningful to the
  preprocessor itself.  Other pragmas are meaningful to the C or C++
--- 3240,3287 ----
  7 Pragmas
  *********
  
! The '#pragma' directive is the method specified by the C standard for
  providing additional information to the compiler, beyond what is
  conveyed in the language itself.  Three forms of this directive
! (commonly known as "pragmas") are specified by the 1999 C standard.  A C
! compiler is free to attach any meaning it likes to other pragmas.
  
     GCC has historically preferred to use extensions to the syntax of the
! language, such as '__attribute__', for this purpose.  However, GCC does
  define a few pragmas of its own.  These mostly have effects on the
  entire translation unit or source file.
  
     In GCC version 3, all GNU-defined, supported pragmas have been given
! a 'GCC' prefix.  This is in line with the 'STDC' prefix on all pragmas
  defined by C99.  For backward compatibility, pragmas which were
! recognized by previous versions are still recognized without the 'GCC'
! prefix, but that usage is deprecated.  Some older pragmas are deprecated
! in their entirety.  They are not recognized with the 'GCC' prefix.
! *Note Obsolete Features::.
  
!    C99 introduces the '_Pragma' operator.  This feature addresses a
! major problem with '#pragma': being a directive, it cannot be produced
! as the result of macro expansion.  '_Pragma' is an operator, much like
! 'sizeof' or 'defined', and can be embedded in a macro.
  
!    Its syntax is '_Pragma (STRING-LITERAL)', where STRING-LITERAL can be
! either a normal or wide-character string literal.  It is destringized,
! by replacing all '\\' with a single '\' and all '\"' with a '"'.  The
! result is then processed as if it had appeared as the right hand side of
! a '#pragma' directive.  For example,
  
       _Pragma ("GCC dependency \"parse.y\"")
  
! has the same effect as '#pragma GCC dependency "parse.y"'.  The same
  effect could be achieved using macros, for example
  
       #define DO_PRAGMA(x) _Pragma (#x)
       DO_PRAGMA (GCC dependency "parse.y")
  
!    The standard is unclear on where a '_Pragma' operator can appear.
  The preprocessor does not accept it within a preprocessing conditional
! directive like '#if'.  To be safe, you are probably best keeping it out
! of directives other than '#define', and putting it on a line of its own.
  
     This manual documents the pragmas which are meaningful to the
  preprocessor itself.  Other pragmas are meaningful to the C or C++
*************** compilers.  They are documented in the G
*** 3308,3315 ****
  
     GCC plugins may provide their own pragmas.
  
! `#pragma GCC dependency'
!      `#pragma GCC dependency' allows you to check the relative dates of
       the current file and another file.  If the other file is more
       recent than the current file, a warning is issued.  This is useful
       if the current file is derived from the other file, and should be
--- 3289,3296 ----
  
     GCC plugins may provide their own pragmas.
  
! '#pragma GCC dependency'
!      '#pragma GCC dependency' allows you to check the relative dates of
       the current file and another file.  If the other file is more
       recent than the current file, a warning is issued.  This is useful
       if the current file is derived from the other file, and should be
*************** compilers.  They are documented in the G
*** 3320,3330 ****
            #pragma GCC dependency "parse.y"
            #pragma GCC dependency "/usr/include/time.h" rerun fixincludes
  
! `#pragma GCC poison'
       Sometimes, there is an identifier that you want to remove
       completely from your program, and make sure that it never creeps
       back in.  To enforce this, you can "poison" the identifier with
!      this pragma.  `#pragma GCC poison' is followed by a list of
       identifiers to poison.  If any of those identifiers appears
       anywhere in the source after the directive, it is a hard error.
       For example,
--- 3301,3311 ----
            #pragma GCC dependency "parse.y"
            #pragma GCC dependency "/usr/include/time.h" rerun fixincludes
  
! '#pragma GCC poison'
       Sometimes, there is an identifier that you want to remove
       completely from your program, and make sure that it never creeps
       back in.  To enforce this, you can "poison" the identifier with
!      this pragma.  '#pragma GCC poison' is followed by a list of
       identifiers to poison.  If any of those identifiers appears
       anywhere in the source after the directive, it is a hard error.
       For example,
*************** compilers.  They are documented in the G
*** 3335,3343 ****
       will produce an error.
  
       If a poisoned identifier appears as part of the expansion of a
!      macro which was defined before the identifier was poisoned, it
!      will _not_ cause an error.  This lets you poison an identifier
!      without worrying about system headers defining macros that use it.
  
       For example,
  
--- 3316,3324 ----
       will produce an error.
  
       If a poisoned identifier appears as part of the expansion of a
!      macro which was defined before the identifier was poisoned, it will
!      _not_ cause an error.  This lets you poison an identifier without
!      worrying about system headers defining macros that use it.
  
       For example,
  
*************** compilers.  They are documented in the G
*** 3347,3366 ****
  
       will not produce an error.
  
! `#pragma GCC system_header'
       This pragma takes no arguments.  It causes the rest of the code in
       the current file to be treated as if it came from a system header.
       *Note System Headers::.
  
! `#pragma GCC warning'
! `#pragma GCC error'
!      `#pragma GCC warning "message"' causes the preprocessor to issue a
!      warning diagnostic with the text `message'.  The message contained
!      in the pragma must be a single string literal.  Similarly,
!      `#pragma GCC error "message"' issues an error message.  Unlike the
!      `#warning' and `#error' directives, these pragmas can be embedded
!      in preprocessor macros using `_Pragma'.
! 
  
  
  File: cpp.info,  Node: Other Directives,  Next: Preprocessor Output,  Prev: Pragmas,  Up: Top
--- 3328,3346 ----
  
       will not produce an error.
  
! '#pragma GCC system_header'
       This pragma takes no arguments.  It causes the rest of the code in
       the current file to be treated as if it came from a system header.
       *Note System Headers::.
  
! '#pragma GCC warning'
! '#pragma GCC error'
!      '#pragma GCC warning "message"' causes the preprocessor to issue a
!      warning diagnostic with the text 'message'.  The message contained
!      in the pragma must be a single string literal.  Similarly, '#pragma
!      GCC error "message"' issues an error message.  Unlike the
!      '#warning' and '#error' directives, these pragmas can be embedded
!      in preprocessor macros using '_Pragma'.
  
  
  File: cpp.info,  Node: Other Directives,  Next: Preprocessor Output,  Prev: Pragmas,  Up: Top
*************** File: cpp.info,  Node: Other Directives,
*** 3368,3388 ****
  8 Other Directives
  ******************
  
! The `#ident' directive takes one argument, a string constant.  On some
  systems, that string constant is copied into a special segment of the
! object file.  On other systems, the directive is ignored.  The `#sccs'
! directive is a synonym for `#ident'.
  
     These directives are not part of the C standard, but they are not
  official GNU extensions either.  What historical information we have
  been able to find, suggests they originated with System V.
  
!    The "null directive" consists of a `#' followed by a newline, with
  only whitespace (including comments) in between.  A null directive is
  understood as a preprocessing directive but has no effect on the
  preprocessor output.  The primary significance of the existence of the
! null directive is that an input line consisting of just a `#' will
! produce no output, rather than a line of output containing just a `#'.
  Supposedly some old C programs contain such lines.
  
  
--- 3348,3368 ----
  8 Other Directives
  ******************
  
! The '#ident' directive takes one argument, a string constant.  On some
  systems, that string constant is copied into a special segment of the
! object file.  On other systems, the directive is ignored.  The '#sccs'
! directive is a synonym for '#ident'.
  
     These directives are not part of the C standard, but they are not
  official GNU extensions either.  What historical information we have
  been able to find, suggests they originated with System V.
  
!    The "null directive" consists of a '#' followed by a newline, with
  only whitespace (including comments) in between.  A null directive is
  understood as a preprocessing directive but has no effect on the
  preprocessor output.  The primary significance of the existence of the
! null directive is that an input line consisting of just a '#' will
! produce no output, rather than a line of output containing just a '#'.
  Supposedly some old C programs contain such lines.
  
  
*************** that the following line originated in fi
*** 3424,3462 ****
  FILENAME will never contain any non-printing characters; they are
  replaced with octal escape sequences.
  
!    After the file name comes zero or more flags, which are `1', `2',
! `3', or `4'.  If there are multiple flags, spaces separate them.  Here
  is what the flags mean:
  
! `1'
       This indicates the start of a new file.
! 
! `2'
       This indicates returning to a file (after having included another
       file).
! 
! `3'
       This indicates that the following text comes from a system header
       file, so certain warnings should be suppressed.
! 
! `4'
       This indicates that the following text should be treated as being
!      wrapped in an implicit `extern "C"' block.
  
     As an extension, the preprocessor accepts linemarkers in
  non-assembler input files.  They are treated like the corresponding
! `#line' directive, (*note Line Control::), except that trailing flags
  are permitted, and are interpreted with the meanings described above.
  If multiple flags are given, they must be in ascending order.
  
     Some directives may be duplicated in the output of the preprocessor.
! These are `#ident' (always), `#pragma' (only if the preprocessor does
! not handle the pragma itself), and `#define' and `#undef' (with certain
! debugging options).  If this happens, the `#' of the directive will
  always be in the first column, and there will be no space between the
! `#' and the directive name.  If macro expansion happens to generate
  tokens which might be mistaken for a duplicated directive, a space will
! be inserted between the `#' and the directive name.
  
  
  File: cpp.info,  Node: Traditional Mode,  Next: Implementation Details,  Prev: Preprocessor Output,  Up: Top
--- 3404,3439 ----
  FILENAME will never contain any non-printing characters; they are
  replaced with octal escape sequences.
  
!    After the file name comes zero or more flags, which are '1', '2',
! '3', or '4'.  If there are multiple flags, spaces separate them.  Here
  is what the flags mean:
  
! '1'
       This indicates the start of a new file.
! '2'
       This indicates returning to a file (after having included another
       file).
! '3'
       This indicates that the following text comes from a system header
       file, so certain warnings should be suppressed.
! '4'
       This indicates that the following text should be treated as being
!      wrapped in an implicit 'extern "C"' block.
  
     As an extension, the preprocessor accepts linemarkers in
  non-assembler input files.  They are treated like the corresponding
! '#line' directive, (*note Line Control::), except that trailing flags
  are permitted, and are interpreted with the meanings described above.
  If multiple flags are given, they must be in ascending order.
  
     Some directives may be duplicated in the output of the preprocessor.
! These are '#ident' (always), '#pragma' (only if the preprocessor does
! not handle the pragma itself), and '#define' and '#undef' (with certain
! debugging options).  If this happens, the '#' of the directive will
  always be in the first column, and there will be no space between the
! '#' and the directive name.  If macro expansion happens to generate
  tokens which might be mistaken for a duplicated directive, a space will
! be inserted between the '#' and the directive name.
  
  
  File: cpp.info,  Node: Traditional Mode,  Next: Implementation Details,  Prev: Preprocessor Output,  Up: Top
*************** File: cpp.info,  Node: Traditional Mode,
*** 3466,3472 ****
  
  Traditional (pre-standard) C preprocessing is rather different from the
  preprocessing specified by the standard.  When GCC is given the
! `-traditional-cpp' option, it attempts to emulate a traditional
  preprocessor.
  
     GCC versions 3.2 and later only support traditional mode semantics in
--- 3443,3449 ----
  
  Traditional (pre-standard) C preprocessing is rather different from the
  preprocessing specified by the standard.  When GCC is given the
! '-traditional-cpp' option, it attempts to emulate a traditional
  preprocessor.
  
     GCC versions 3.2 and later only support traditional mode semantics in
*************** simply treated as a stream of text with
*** 3499,3529 ****
  
     This implementation does not treat trigraphs (*note trigraphs::)
  specially since they were an invention of the standards committee.  It
! handles arbitrarily-positioned escaped newlines properly and splices
! the lines as you would expect; many traditional preprocessors did not
! do this.
  
     The form of horizontal whitespace in the input file is preserved in
  the output.  In particular, hard tabs remain hard tabs.  This can be
  useful if, for example, you are preprocessing a Makefile.
  
     Traditional CPP only recognizes C-style block comments, and treats
! the `/*' sequence as introducing a comment only if it lies outside
  quoted text.  Quoted text is introduced by the usual single and double
! quotes, and also by an initial `<' in a `#include' directive.
  
     Traditionally, comments are completely removed and are not replaced
! with a space.  Since a traditional compiler does its own tokenization
! of the output of the preprocessor, this means that comments can
! effectively be used as token paste operators.  However, comments behave
! like separators for text handled by the preprocessor itself, since it
! doesn't re-lex its input.  For example, in
  
       #if foo/**/bar
  
! `foo' and `bar' are distinct identifiers and expanded separately if
! they happen to be macros.  In other words, this directive is equivalent
! to
  
       #if foo bar
  
--- 3476,3505 ----
  
     This implementation does not treat trigraphs (*note trigraphs::)
  specially since they were an invention of the standards committee.  It
! handles arbitrarily-positioned escaped newlines properly and splices the
! lines as you would expect; many traditional preprocessors did not do
! this.
  
     The form of horizontal whitespace in the input file is preserved in
  the output.  In particular, hard tabs remain hard tabs.  This can be
  useful if, for example, you are preprocessing a Makefile.
  
     Traditional CPP only recognizes C-style block comments, and treats
! the '/*' sequence as introducing a comment only if it lies outside
  quoted text.  Quoted text is introduced by the usual single and double
! quotes, and also by an initial '<' in a '#include' directive.
  
     Traditionally, comments are completely removed and are not replaced
! with a space.  Since a traditional compiler does its own tokenization of
! the output of the preprocessor, this means that comments can effectively
! be used as token paste operators.  However, comments behave like
! separators for text handled by the preprocessor itself, since it doesn't
! re-lex its input.  For example, in
  
       #if foo/**/bar
  
! 'foo' and 'bar' are distinct identifiers and expanded separately if they
! happen to be macros.  In other words, this directive is equivalent to
  
       #if foo bar
  
*************** with replacement text that contains an u
*** 3537,3543 ****
  you attempt to compile preprocessed output containing an unmatched quote
  you will get a syntax error.
  
!    However, all preprocessing directives other than `#define' require
  matching quotes.  For example:
  
       #define m This macro's fine and has an unmatched quote
--- 3513,3519 ----
  you attempt to compile preprocessed output containing an unmatched quote
  you will get a syntax error.
  
!    However, all preprocessing directives other than '#define' require
  matching quotes.  For example:
  
       #define m This macro's fine and has an unmatched quote
*************** can run together with the text after the
*** 3568,3583 ****
  single token.
  
     Normally comments are removed from the replacement text after the
! macro is expanded, but if the `-CC' option is passed on the
! command-line comments are preserved.  (In fact, the current
! implementation removes comments even before saving the macro
! replacement text, but it careful to do it in such a way that the
! observed effect is identical even in the function-like macro case.)
  
!    The ISO stringification operator `#' and token paste operator `##'
! have no special meaning.  As explained later, an effect similar to
! these operators can be obtained in a different way.  Macro names that
! are embedded in quotes, either from the main file or after macro
  replacement, do not expand.
  
     CPP replaces an unquoted object-like macro name with its replacement
--- 3544,3559 ----
  single token.
  
     Normally comments are removed from the replacement text after the
! macro is expanded, but if the '-CC' option is passed on the command-line
! comments are preserved.  (In fact, the current implementation removes
! comments even before saving the macro replacement text, but it careful
! to do it in such a way that the observed effect is identical even in the
! function-like macro case.)
  
!    The ISO stringification operator '#' and token paste operator '##'
! have no special meaning.  As explained later, an effect similar to these
! operators can be obtained in a different way.  Macro names that are
! embedded in quotes, either from the main file or after macro
  replacement, do not expand.
  
     CPP replaces an unquoted object-like macro name with its replacement
*************** invocation.
*** 3597,3619 ****
     Function-like macros are similar in form but quite different in
  behavior to their ISO counterparts.  Their arguments are contained
  within parentheses, are comma-separated, and can cross physical lines.
! Commas within nested parentheses are not treated as argument
! separators.  Similarly, a quote in an argument cannot be left unclosed;
! a following comma or parenthesis that comes before the closing quote is
! treated like any other character.  There is no facility for handling
! variadic macros.
  
     This implementation removes all comments from macro arguments, unless
! the `-C' option is given.  The form of all other horizontal whitespace
  in arguments is preserved, including leading and trailing whitespace.
  In particular
  
       f( )
  
! is treated as an invocation of the macro `f' with a single argument
  consisting of a single space.  If you want to invoke a function-like
! macro that takes no arguments, you must not leave any whitespace
! between the parentheses.
  
     If a macro argument crosses a new line, the new line is replaced with
  a space when forming the argument.  If the previous line contained an
--- 3573,3594 ----
     Function-like macros are similar in form but quite different in
  behavior to their ISO counterparts.  Their arguments are contained
  within parentheses, are comma-separated, and can cross physical lines.
! Commas within nested parentheses are not treated as argument separators.
! Similarly, a quote in an argument cannot be left unclosed; a following
! comma or parenthesis that comes before the closing quote is treated like
! any other character.  There is no facility for handling variadic macros.
  
     This implementation removes all comments from macro arguments, unless
! the '-C' option is given.  The form of all other horizontal whitespace
  in arguments is preserved, including leading and trailing whitespace.
  In particular
  
       f( )
  
! is treated as an invocation of the macro 'f' with a single argument
  consisting of a single space.  If you want to invoke a function-like
! macro that takes no arguments, you must not leave any whitespace between
! the parentheses.
  
     If a macro argument crosses a new line, the new line is replaced with
  a space when forming the argument.  If the previous line contained an
*************** File: cpp.info,  Node: Traditional misce
*** 3644,3659 ****
  Here are some things to be aware of when using the traditional
  preprocessor.
  
!    * Preprocessing directives are recognized only when their leading
!      `#' appears in the first column.  There can be no whitespace
!      between the beginning of the line and the `#', but whitespace can
!      follow the `#'.
  
!    * A true traditional C preprocessor does not recognize `#error' or
!      `#pragma', and may not recognize `#elif'.  CPP supports all the
       directives in traditional mode that it supports in ISO mode,
       including extensions, with the exception that the effects of
!      `#pragma GCC poison' are undefined.
  
     * __STDC__ is not defined.
  
--- 3619,3634 ----
  Here are some things to be aware of when using the traditional
  preprocessor.
  
!    * Preprocessing directives are recognized only when their leading '#'
!      appears in the first column.  There can be no whitespace between
!      the beginning of the line and the '#', but whitespace can follow
!      the '#'.
  
!    * A true traditional C preprocessor does not recognize '#error' or
!      '#pragma', and may not recognize '#elif'.  CPP supports all the
       directives in traditional mode that it supports in ISO mode,
       including extensions, with the exception that the effects of
!      '#pragma GCC poison' are undefined.
  
     * __STDC__ is not defined.
  
*************** preprocessor.
*** 3662,3668 ****
     * If a line that looks like a directive appears within macro
       arguments, the behavior is undefined.
  
- 
  
  File: cpp.info,  Node: Traditional warnings,  Prev: Traditional miscellany,  Up: Traditional Mode
  
--- 3637,3642 ----
*************** File: cpp.info,  Node: Traditional warni
*** 3670,3693 ****
  =========================
  
  You can request warnings about features that did not exist, or worked
! differently, in traditional C with the `-Wtraditional' option.  GCC
! does not warn about features of ISO C which you must use when you are
! using a conforming compiler, such as the `#' and `##' operators.
  
!    Presently `-Wtraditional' warns about:
  
     * Macro parameters that appear within string literals in the macro
!      body.  In traditional C macro replacement takes place within
!      string literals, but does not in ISO C.
  
     * In traditional C, some preprocessor directives did not exist.
       Traditional preprocessors would only consider a line to be a
!      directive if the `#' appeared in column 1 on the line.  Therefore
!      `-Wtraditional' warns about directives that traditional C
!      understands but would ignore because the `#' does not appear as the
       first character on the line.  It also suggests you hide directives
!      like `#pragma' not understood by traditional C by indenting them.
!      Some traditional implementations would not recognize `#elif', so it
       suggests avoiding it altogether.
  
     * A function-like macro that appears without an argument list.  In
--- 3644,3667 ----
  =========================
  
  You can request warnings about features that did not exist, or worked
! differently, in traditional C with the '-Wtraditional' option.  GCC does
! not warn about features of ISO C which you must use when you are using a
! conforming compiler, such as the '#' and '##' operators.
  
!    Presently '-Wtraditional' warns about:
  
     * Macro parameters that appear within string literals in the macro
!      body.  In traditional C macro replacement takes place within string
!      literals, but does not in ISO C.
  
     * In traditional C, some preprocessor directives did not exist.
       Traditional preprocessors would only consider a line to be a
!      directive if the '#' appeared in column 1 on the line.  Therefore
!      '-Wtraditional' warns about directives that traditional C
!      understands but would ignore because the '#' does not appear as the
       first character on the line.  It also suggests you hide directives
!      like '#pragma' not understood by traditional C by indenting them.
!      Some traditional implementations would not recognize '#elif', so it
       suggests avoiding it altogether.
  
     * A function-like macro that appears without an argument list.  In
*************** using a conforming compiler, such as the
*** 3696,3707 ****
  
     * The unary plus operator.  This did not exist in traditional C.
  
!    * The `U' and `LL' integer constant suffixes, which were not
!      available in traditional C.  (Traditional C does support the `L'
       suffix for simple long integer constants.)  You are not warned
       about uses of these suffixes in macros defined in system headers.
!      For instance, `UINT_MAX' may well be defined as `4294967295U', but
!      you will not be warned if you use `UINT_MAX'.
  
       You can usually avoid the warning, and the related warning about
       constants which are so large that they are unsigned, by writing the
--- 3670,3681 ----
  
     * The unary plus operator.  This did not exist in traditional C.
  
!    * The 'U' and 'LL' integer constant suffixes, which were not
!      available in traditional C.  (Traditional C does support the 'L'
       suffix for simple long integer constants.)  You are not warned
       about uses of these suffixes in macros defined in system headers.
!      For instance, 'UINT_MAX' may well be defined as '4294967295U', but
!      you will not be warned if you use 'UINT_MAX'.
  
       You can usually avoid the warning, and the related warning about
       constants which are so large that they are unsigned, by writing the
*************** File: cpp.info,  Node: Implementation-de
*** 3737,3803 ****
  ====================================
  
  This is how CPP behaves in all the cases which the C standard describes
! as "implementation-defined".  This term means that the implementation
! is free to do what it likes, but must document its choice and stick to
! it.
  
     * The mapping of physical source file multi-byte characters to the
       execution character set.
  
       The input character set can be specified using the
!      `-finput-charset' option, while the execution character set may be
!      controlled using the `-fexec-charset' and `-fwide-exec-charset'
       options.
  
!    * Identifier characters.  The C and C++ standards allow identifiers
!      to be composed of `_' and the alphanumeric characters.  C++ and
!      C99 also allow universal character names, and C99 further permits
!      implementation-defined characters.
  
!      GCC allows the `$' character in identifiers as an extension for
!      most targets.  This is true regardless of the `std=' switch, since
       this extension cannot conflict with standards-conforming programs.
       When preprocessing assembler, however, dollars are not identifier
       characters by default.
  
!      Currently the targets that by default do not permit `$' are AVR,
       IP2K, MMIX, MIPS Irix 3, ARM aout, and PowerPC targets for the AIX
       operating system.
  
!      You can override the default with `-fdollars-in-identifiers' or
!      `fno-dollars-in-identifiers'.  *Note fdollars-in-identifiers::.
  
     * Non-empty sequences of whitespace characters.
  
       In textual output, each whitespace sequence is collapsed to a
       single space.  For aesthetic reasons, the first token on each
       non-directive line of output is preceded with sufficient spaces
!      that it appears in the same column as it did in the original
!      source file.
  
     * The numeric value of character constants in preprocessor
       expressions.
  
       The preprocessor and compiler interpret character constants in the
!      same way; i.e. escape sequences such as `\a' are given the values
       they would have on the target machine.
  
       The compiler evaluates a multi-character character constant a
!      character at a time, shifting the previous value left by the
!      number of bits per target character, and then or-ing in the
!      bit-pattern of the new character truncated to the width of a
!      target character.  The final bit-pattern is given type `int', and
!      is therefore signed, regardless of whether single characters are
!      signed or not (a slight change from versions 3.1 and earlier of
!      GCC).  If there are more characters in the constant than would fit
!      in the target `int' the compiler issues a warning, and the excess
!      leading characters are ignored.
  
!      For example, `'ab'' for a target with an 8-bit `char' would be
       interpreted as
!      `(int) ((unsigned char) 'a' * 256 + (unsigned char) 'b')', and
!      `'\234a'' as
!      `(int) ((unsigned char) '\234' * 256 + (unsigned char) 'a')'.
  
     * Source file inclusion.
  
--- 3711,3778 ----
  ====================================
  
  This is how CPP behaves in all the cases which the C standard describes
! as "implementation-defined".  This term means that the implementation is
! free to do what it likes, but must document its choice and stick to it.
  
     * The mapping of physical source file multi-byte characters to the
       execution character set.
  
       The input character set can be specified using the
!      '-finput-charset' option, while the execution character set may be
!      controlled using the '-fexec-charset' and '-fwide-exec-charset'
       options.
  
!    * Identifier characters.
  
!      The C and C++ standards allow identifiers to be composed of '_' and
!      the alphanumeric characters.  C++ and C99 also allow universal
!      character names, and C99 further permits implementation-defined
!      characters.
! 
!      GCC allows the '$' character in identifiers as an extension for
!      most targets.  This is true regardless of the 'std=' switch, since
       this extension cannot conflict with standards-conforming programs.
       When preprocessing assembler, however, dollars are not identifier
       characters by default.
  
!      Currently the targets that by default do not permit '$' are AVR,
       IP2K, MMIX, MIPS Irix 3, ARM aout, and PowerPC targets for the AIX
       operating system.
  
!      You can override the default with '-fdollars-in-identifiers' or
!      'fno-dollars-in-identifiers'.  *Note fdollars-in-identifiers::.
  
     * Non-empty sequences of whitespace characters.
  
       In textual output, each whitespace sequence is collapsed to a
       single space.  For aesthetic reasons, the first token on each
       non-directive line of output is preceded with sufficient spaces
!      that it appears in the same column as it did in the original source
!      file.
  
     * The numeric value of character constants in preprocessor
       expressions.
  
       The preprocessor and compiler interpret character constants in the
!      same way; i.e. escape sequences such as '\a' are given the values
       they would have on the target machine.
  
       The compiler evaluates a multi-character character constant a
!      character at a time, shifting the previous value left by the number
!      of bits per target character, and then or-ing in the bit-pattern of
!      the new character truncated to the width of a target character.
!      The final bit-pattern is given type 'int', and is therefore signed,
!      regardless of whether single characters are signed or not (a slight
!      change from versions 3.1 and earlier of GCC).  If there are more
!      characters in the constant than would fit in the target 'int' the
!      compiler issues a warning, and the excess leading characters are
!      ignored.
  
!      For example, ''ab'' for a target with an 8-bit 'char' would be
       interpreted as
!      '(int) ((unsigned char) 'a' * 256 + (unsigned char) 'b')', and
!      ''\234a'' as
!      '(int) ((unsigned char) '\234' * 256 + (unsigned char) 'a')'.
  
     * Source file inclusion.
  
*************** it.
*** 3805,3823 ****
       *note Include Operation::.
  
     * Interpretation of the filename resulting from a macro-expanded
!      `#include' directive.
  
       *Note Computed Includes::.
  
!    * Treatment of a `#pragma' directive that after macro-expansion
       results in a standard pragma.
  
!      No macro expansion occurs on any `#pragma' directive line, so the
       question does not arise.
  
       Note that GCC does not yet implement any of the standard pragmas.
  
- 
  
  File: cpp.info,  Node: Implementation limits,  Next: Obsolete Features,  Prev: Implementation-defined behavior,  Up: Implementation Details
  
--- 3780,3797 ----
       *note Include Operation::.
  
     * Interpretation of the filename resulting from a macro-expanded
!      '#include' directive.
  
       *Note Computed Includes::.
  
!    * Treatment of a '#pragma' directive that after macro-expansion
       results in a standard pragma.
  
!      No macro expansion occurs on any '#pragma' directive line, so the
       question does not arise.
  
       Note that GCC does not yet implement any of the standard pragmas.
  
  
  File: cpp.info,  Node: Implementation limits,  Next: Obsolete Features,  Prev: Implementation-defined behavior,  Up: Implementation Details
  
*************** limit, please report that as a bug.  *No
*** 3832,3843 ****
  
     Where we say something is limited "only by available memory", that
  means that internal data structures impose no intrinsic limit, and space
! is allocated with `malloc' or equivalent.  The actual limit will
  therefore depend on many things, such as the size of other things
  allocated by the compiler at the same time, the amount of memory
  consumed by other processes on the same computer, etc.
  
!    * Nesting levels of `#include' files.
  
       We impose an arbitrary limit of 200 levels, to avoid runaway
       recursion.  The standard requires at least 15 levels.
--- 3806,3817 ----
  
     Where we say something is limited "only by available memory", that
  means that internal data structures impose no intrinsic limit, and space
! is allocated with 'malloc' or equivalent.  The actual limit will
  therefore depend on many things, such as the size of other things
  allocated by the compiler at the same time, the amount of memory
  consumed by other processes on the same computer, etc.
  
!    * Nesting levels of '#include' files.
  
       We impose an arbitrary limit of 200 levels, to avoid runaway
       recursion.  The standard requires at least 15 levels.
*************** consumed by other processes on the same
*** 3863,3872 ****
       The standard requires at least 4095 be possible.  CPP is limited
       only by available memory.
  
!    * Number of parameters in a macro definition and arguments in a
!      macro call.
  
!      We allow `USHRT_MAX', which is no smaller than 65,535.  The minimum
       required by the standard is 127.
  
     * Number of characters on a logical source line.
--- 3837,3846 ----
       The standard requires at least 4095 be possible.  CPP is limited
       only by available memory.
  
!    * Number of parameters in a macro definition and arguments in a macro
!      call.
  
!      We allow 'USHRT_MAX', which is no smaller than 65,535.  The minimum
       required by the standard is 127.
  
     * Number of characters on a logical source line.
*************** consumed by other processes on the same
*** 3878,3888 ****
     * Maximum size of a source file.
  
       The standard does not specify any lower limit on the maximum size
!      of a source file.  GNU cpp maps files into memory, so it is
!      limited by the available address space.  This is generally at
!      least two gigabytes.  Depending on the operating system, the size
!      of physical memory may or may not be a limitation.
! 
  
  
  File: cpp.info,  Node: Obsolete Features,  Next: Differences from previous versions,  Prev: Implementation limits,  Up: Implementation Details
--- 3852,3861 ----
     * Maximum size of a source file.
  
       The standard does not specify any lower limit on the maximum size
!      of a source file.  GNU cpp maps files into memory, so it is limited
!      by the available address space.  This is generally at least two
!      gigabytes.  Depending on the operating system, the size of physical
!      memory may or may not be a limitation.
  
  
  File: cpp.info,  Node: Obsolete Features,  Next: Differences from previous versions,  Prev: Implementation limits,  Up: Implementation Details
*************** File: cpp.info,  Node: Obsolete Features
*** 3891,3898 ****
  ======================
  
  CPP has some features which are present mainly for compatibility with
! older programs.  We discourage their use in new code.  In some cases,
! we plan to remove the feature in a future version of GCC.
  
  11.3.1 Assertions
  -----------------
--- 3864,3871 ----
  ======================
  
  CPP has some features which are present mainly for compatibility with
! older programs.  We discourage their use in new code.  In some cases, we
! plan to remove the feature in a future version of GCC.
  
  11.3.1 Assertions
  -----------------
*************** define them with preprocessing directive
*** 3906,3913 ****
  the compiler's target system and we added them for compatibility with
  existing compilers.  In practice they are just as unpredictable as the
  system-specific predefined macros.  In addition, they are not part of
! any standard, and only a few compilers support them.  Therefore, the
! use of assertions is *less* portable than the use of system-specific
  predefined macros.  We recommend you do not use them at all.
  
     An assertion looks like this:
--- 3879,3886 ----
  the compiler's target system and we added them for compatibility with
  existing compilers.  In practice they are just as unpredictable as the
  system-specific predefined macros.  In addition, they are not part of
! any standard, and only a few compilers support them.  Therefore, the use
! of assertions is *less* portable than the use of system-specific
  predefined macros.  We recommend you do not use them at all.
  
     An assertion looks like this:
*************** PREDICATE must be a single identifier.
*** 3918,3929 ****
  tokens; all characters are significant except for leading and trailing
  whitespace, and differences in internal whitespace sequences are
  ignored.  (This is similar to the rules governing macro redefinition.)
! Thus, `(x + y)' is different from `(x+y)' but equivalent to
! `( x + y )'.  Parentheses do not nest inside an answer.
  
!    To test an assertion, you write it in an `#if'.  For example, this
! conditional succeeds if either `vax' or `ns16000' has been asserted as
! an answer for `machine'.
  
       #if #machine (vax) || #machine (ns16000)
  
--- 3891,3902 ----
  tokens; all characters are significant except for leading and trailing
  whitespace, and differences in internal whitespace sequences are
  ignored.  (This is similar to the rules governing macro redefinition.)
! Thus, '(x + y)' is different from '(x+y)' but equivalent to '( x + y )'.
! Parentheses do not nest inside an answer.
  
!    To test an assertion, you write it in an '#if'.  For example, this
! conditional succeeds if either 'vax' or 'ns16000' has been asserted as
! an answer for 'machine'.
  
       #if #machine (vax) || #machine (ns16000)
  
*************** omitting the answer in the conditional:
*** 3932,3939 ****
  
       #if #machine
  
!    Assertions are made with the `#assert' directive.  Its sole argument
! is the assertion to make, without the leading `#' that identifies
  assertions in conditionals.
  
       #assert PREDICATE (ANSWER)
--- 3905,3912 ----
  
       #if #machine
  
!    Assertions are made with the '#assert' directive.  Its sole argument
! is the assertion to make, without the leading '#' that identifies
  assertions in conditionals.
  
       #assert PREDICATE (ANSWER)
*************** answers.  Subsequent assertions do not o
*** 3943,3957 ****
  same predicate.  All the answers for any given predicate are
  simultaneously true.
  
!    Assertions can be canceled with the `#unassert' directive.  It has
! the same syntax as `#assert'.  In that form it cancels only the answer
! which was specified on the `#unassert' line; other answers for that
  predicate remain true.  You can cancel an entire predicate by leaving
  out the answer:
  
       #unassert PREDICATE
  
! In either form, if no such assertion has been made, `#unassert' has no
  effect.
  
     You can also make or cancel assertions using command-line options.
--- 3916,3930 ----
  same predicate.  All the answers for any given predicate are
  simultaneously true.
  
!    Assertions can be canceled with the '#unassert' directive.  It has
! the same syntax as '#assert'.  In that form it cancels only the answer
! which was specified on the '#unassert' line; other answers for that
  predicate remain true.  You can cancel an entire predicate by leaving
  out the answer:
  
       #unassert PREDICATE
  
! In either form, if no such assertion has been made, '#unassert' has no
  effect.
  
     You can also make or cancel assertions using command-line options.
*************** File: cpp.info,  Node: Differences from
*** 3964,3971 ****
  =======================================
  
  This section details behavior which has changed from previous versions
! of CPP.  We do not plan to change it again in the near future, but we
! do not promise not to, either.
  
     The "previous versions" discussed here are 2.95 and before.  The
  behavior of GCC 3.0 is mostly the same as the behavior of the widely
--- 3937,3944 ----
  =======================================
  
  This section details behavior which has changed from previous versions
! of CPP.  We do not plan to change it again in the near future, but we do
! not promise not to, either.
  
     The "previous versions" discussed here are 2.95 and before.  The
  behavior of GCC 3.0 is mostly the same as the behavior of the widely
*************** they generally represent bugs in the sna
*** 3974,4021 ****
  
     * -I- deprecated
  
!      This option has been deprecated in 4.0.  `-iquote' is meant to
       replace the need for this option.
  
!    * Order of evaluation of `#' and `##' operators
  
       The standard does not specify the order of evaluation of a chain of
!      `##' operators, nor whether `#' is evaluated before, after, or at
!      the same time as `##'.  You should therefore not write any code
       which depends on any specific ordering.  It is possible to
       guarantee an ordering, if you need one, by suitable use of nested
       macros.
  
!      An example of where this might matter is pasting the arguments `1',
!      `e' and `-2'.  This would be fine for left-to-right pasting, but
!      right-to-left pasting would produce an invalid token `e-2'.
  
!      GCC 3.0 evaluates `#' and `##' at the same time and strictly left
!      to right.  Older versions evaluated all `#' operators first, then
!      all `##' operators, in an unreliable order.
  
     * The form of whitespace between tokens in preprocessor output
  
       *Note Preprocessor Output::, for the current textual format.  This
       is also the format used by stringification.  Normally, the
!      preprocessor communicates tokens directly to the compiler's
!      parser, and whitespace does not come up at all.
  
!      Older versions of GCC preserved all whitespace provided by the
!      user and inserted lots more whitespace of their own, because they
!      could not accurately predict when extra spaces were needed to
!      prevent accidental token pasting.
  
     * Optional argument when invoking rest argument macros
  
       As an extension, GCC permits you to omit the variable arguments
!      entirely when you use a variable argument macro.  This is
!      forbidden by the 1999 C standard, and will provoke a pedantic
!      warning with GCC 3.0.  Previous versions accepted it silently.
  
!    * `##' swallowing preceding text in rest argument macros
  
!      Formerly, in a macro expansion, if `##' appeared before a variable
       arguments parameter, and the set of tokens specified for that
       argument in the macro invocation was empty, previous versions of
       CPP would back up and remove the preceding sequence of
--- 3947,3994 ----
  
     * -I- deprecated
  
!      This option has been deprecated in 4.0.  '-iquote' is meant to
       replace the need for this option.
  
!    * Order of evaluation of '#' and '##' operators
  
       The standard does not specify the order of evaluation of a chain of
!      '##' operators, nor whether '#' is evaluated before, after, or at
!      the same time as '##'.  You should therefore not write any code
       which depends on any specific ordering.  It is possible to
       guarantee an ordering, if you need one, by suitable use of nested
       macros.
  
!      An example of where this might matter is pasting the arguments '1',
!      'e' and '-2'.  This would be fine for left-to-right pasting, but
!      right-to-left pasting would produce an invalid token 'e-2'.
  
!      GCC 3.0 evaluates '#' and '##' at the same time and strictly left
!      to right.  Older versions evaluated all '#' operators first, then
!      all '##' operators, in an unreliable order.
  
     * The form of whitespace between tokens in preprocessor output
  
       *Note Preprocessor Output::, for the current textual format.  This
       is also the format used by stringification.  Normally, the
!      preprocessor communicates tokens directly to the compiler's parser,
!      and whitespace does not come up at all.
  
!      Older versions of GCC preserved all whitespace provided by the user
!      and inserted lots more whitespace of their own, because they could
!      not accurately predict when extra spaces were needed to prevent
!      accidental token pasting.
  
     * Optional argument when invoking rest argument macros
  
       As an extension, GCC permits you to omit the variable arguments
!      entirely when you use a variable argument macro.  This is forbidden
!      by the 1999 C standard, and will provoke a pedantic warning with
!      GCC 3.0.  Previous versions accepted it silently.
  
!    * '##' swallowing preceding text in rest argument macros
  
!      Formerly, in a macro expansion, if '##' appeared before a variable
       arguments parameter, and the set of tokens specified for that
       argument in the macro invocation was empty, previous versions of
       CPP would back up and remove the preceding sequence of
*************** they generally represent bugs in the sna
*** 4023,4053 ****
       extension is in direct conflict with the 1999 C standard and has
       been drastically pared back.
  
!      In the current version of the preprocessor, if `##' appears between
       a comma and a variable arguments parameter, and the variable
       argument is omitted entirely, the comma will be removed from the
       expansion.  If the variable argument is empty, or the token before
!      `##' is not a comma, then `##' behaves as a normal token paste.
  
!    * `#line' and `#include'
  
!      The `#line' directive used to change GCC's notion of the
!      "directory containing the current file", used by `#include' with a
       double-quoted header file name.  In 3.0 and later, it does not.
       *Note Line Control::, for further explanation.
  
!    * Syntax of `#line'
  
!      In GCC 2.95 and previous, the string constant argument to `#line'
!      was treated the same way as the argument to `#include': backslash
!      escapes were not honored, and the string ended at the second `"'.
       This is not compliant with the C standard.  In GCC 3.0, an attempt
!      was made to correct the behavior, so that the string was treated
!      as a real string constant, but it turned out to be buggy.  In 3.1,
!      the bugs have been fixed.  (We are not fixing the bugs in 3.0
!      because they affect relatively few people and the fix is quite
!      invasive.)
! 
  
  
  File: cpp.info,  Node: Invocation,  Next: Environment Variables,  Prev: Implementation Details,  Up: Top
--- 3996,4024 ----
       extension is in direct conflict with the 1999 C standard and has
       been drastically pared back.
  
!      In the current version of the preprocessor, if '##' appears between
       a comma and a variable arguments parameter, and the variable
       argument is omitted entirely, the comma will be removed from the
       expansion.  If the variable argument is empty, or the token before
!      '##' is not a comma, then '##' behaves as a normal token paste.
  
!    * '#line' and '#include'
  
!      The '#line' directive used to change GCC's notion of the "directory
!      containing the current file", used by '#include' with a
       double-quoted header file name.  In 3.0 and later, it does not.
       *Note Line Control::, for further explanation.
  
!    * Syntax of '#line'
  
!      In GCC 2.95 and previous, the string constant argument to '#line'
!      was treated the same way as the argument to '#include': backslash
!      escapes were not honored, and the string ended at the second '"'.
       This is not compliant with the C standard.  In GCC 3.0, an attempt
!      was made to correct the behavior, so that the string was treated as
!      a real string constant, but it turned out to be buggy.  In 3.1, the
!      bugs have been fixed.  (We are not fixing the bugs in 3.0 because
!      they affect relatively few people and the fix is quite invasive.)
  
  
  File: cpp.info,  Node: Invocation,  Next: Environment Variables,  Prev: Implementation Details,  Up: Top
*************** here are also acceptable to the C compil
*** 4062,4100 ****
  except that the C compiler has different rules for specifying the output
  file.
  
!    _Note:_ Whether you use the preprocessor by way of `gcc' or `cpp',
  the "compiler driver" is run first.  This program's purpose is to
  translate your command into invocations of the programs that do the
  actual work.  Their command-line interfaces are similar but not
  identical to the documented interface, and may change without notice.
  
     The C preprocessor expects two file names as arguments, INFILE and
! OUTFILE.  The preprocessor reads INFILE together with any other files
! it specifies with `#include'.  All the output generated by the combined
  input files is written in OUTFILE.
  
!    Either INFILE or OUTFILE may be `-', which as INFILE means to read
  from standard input and as OUTFILE means to write to standard output.
! Also, if either file is omitted, it means the same as if `-' had been
  specified for that file.
  
!    Unless otherwise noted, or the option ends in `=', all options which
  take an argument may have that argument appear either immediately after
! the option, or with a space between option and argument: `-Ifoo' and
! `-I foo' have the same effect.
  
     Many options have multi-letter names; therefore multiple
! single-letter options may _not_ be grouped: `-dM' is very different from
! `-d -M'.
  
! `-D NAME'
!      Predefine NAME as a macro, with definition `1'.
  
! `-D NAME=DEFINITION'
       The contents of DEFINITION are tokenized and processed as if they
!      appeared during translation phase three in a `#define' directive.
!      In particular, the definition will be truncated by embedded
!      newline characters.
  
       If you are invoking the preprocessor from a shell or shell-like
       program you may need to use the shell's quoting syntax to protect
--- 4033,4071 ----
  except that the C compiler has different rules for specifying the output
  file.
  
!    _Note:_ Whether you use the preprocessor by way of 'gcc' or 'cpp',
  the "compiler driver" is run first.  This program's purpose is to
  translate your command into invocations of the programs that do the
  actual work.  Their command-line interfaces are similar but not
  identical to the documented interface, and may change without notice.
  
     The C preprocessor expects two file names as arguments, INFILE and
! OUTFILE.  The preprocessor reads INFILE together with any other files it
! specifies with '#include'.  All the output generated by the combined
  input files is written in OUTFILE.
  
!    Either INFILE or OUTFILE may be '-', which as INFILE means to read
  from standard input and as OUTFILE means to write to standard output.
! Also, if either file is omitted, it means the same as if '-' had been
  specified for that file.
  
!    Unless otherwise noted, or the option ends in '=', all options which
  take an argument may have that argument appear either immediately after
! the option, or with a space between option and argument: '-Ifoo' and '-I
! foo' have the same effect.
  
     Many options have multi-letter names; therefore multiple
! single-letter options may _not_ be grouped: '-dM' is very different from
! '-d -M'.
  
! '-D NAME'
!      Predefine NAME as a macro, with definition '1'.
  
! '-D NAME=DEFINITION'
       The contents of DEFINITION are tokenized and processed as if they
!      appeared during translation phase three in a '#define' directive.
!      In particular, the definition will be truncated by embedded newline
!      characters.
  
       If you are invoking the preprocessor from a shell or shell-like
       program you may need to use the shell's quoting syntax to protect
*************** single-letter options may _not_ be group
*** 4103,4178 ****
       If you wish to define a function-like macro on the command line,
       write its argument list with surrounding parentheses before the
       equals sign (if any).  Parentheses are meaningful to most shells,
!      so you will need to quote the option.  With `sh' and `csh',
!      `-D'NAME(ARGS...)=DEFINITION'' works.
  
!      `-D' and `-U' options are processed in the order they are given on
!      the command line.  All `-imacros FILE' and `-include FILE' options
!      are processed after all `-D' and `-U' options.
  
! `-U NAME'
!      Cancel any previous definition of NAME, either built in or
!      provided with a `-D' option.
  
! `-undef'
       Do not predefine any system-specific or GCC-specific macros.  The
       standard predefined macros remain defined.  *Note Standard
       Predefined Macros::.
  
! `-I DIR'
!      Add the directory DIR to the list of directories to be searched
!      for header files.  *Note Search Path::.  Directories named by `-I'
!      are searched before the standard system include directories.  If
!      the directory DIR is a standard system include directory, the
!      option is ignored to ensure that the default search order for
!      system directories and the special treatment of system headers are
!      not defeated (*note System Headers::) .  If DIR begins with `=',
!      then the `=' will be replaced by the sysroot prefix; see
!      `--sysroot' and `-isysroot'.
  
! `-o FILE'
       Write output to FILE.  This is the same as specifying FILE as the
!      second non-option argument to `cpp'.  `gcc' has a different
       interpretation of a second non-option argument, so you must use
!      `-o' to specify the output file.
  
! `-Wall'
       Turns on all optional warnings which are desirable for normal code.
!      At present this is `-Wcomment', `-Wtrigraphs', `-Wmultichar' and a
!      warning about integer promotion causing a change of sign in `#if'
       expressions.  Note that many of the preprocessor's warnings are on
       by default and have no options to control them.
  
! `-Wcomment'
! `-Wcomments'
!      Warn whenever a comment-start sequence `/*' appears in a `/*'
!      comment, or whenever a backslash-newline appears in a `//' comment.
       (Both forms have the same effect.)
  
! `-Wtrigraphs'
       Most trigraphs in comments cannot affect the meaning of the
       program.  However, a trigraph that would form an escaped newline
!      (`??/' at the end of a line) can, by changing where the comment
       begins or ends.  Therefore, only trigraphs that would form escaped
       newlines produce warnings inside a comment.
  
!      This option is implied by `-Wall'.  If `-Wall' is not given, this
       option is still enabled unless trigraphs are enabled.  To get
!      trigraph conversion without warnings, but get the other `-Wall'
!      warnings, use `-trigraphs -Wall -Wno-trigraphs'.
  
! `-Wtraditional'
       Warn about certain constructs that behave differently in
       traditional and ISO C.  Also warn about ISO C constructs that have
       no traditional C equivalent, and problematic constructs which
       should be avoided.  *Note Traditional Mode::.
  
! `-Wundef'
       Warn whenever an identifier which is not a macro is encountered in
!      an `#if' directive, outside of `defined'.  Such identifiers are
       replaced with zero.
  
! `-Wunused-macros'
       Warn about macros defined in the main file that are unused.  A
       macro is "used" if it is expanded or tested for existence at least
       once.  The preprocessor will also warn if the macro has not been
--- 4074,4149 ----
       If you wish to define a function-like macro on the command line,
       write its argument list with surrounding parentheses before the
       equals sign (if any).  Parentheses are meaningful to most shells,
!      so you will need to quote the option.  With 'sh' and 'csh',
!      '-D'NAME(ARGS...)=DEFINITION'' works.
  
!      '-D' and '-U' options are processed in the order they are given on
!      the command line.  All '-imacros FILE' and '-include FILE' options
!      are processed after all '-D' and '-U' options.
  
! '-U NAME'
!      Cancel any previous definition of NAME, either built in or provided
!      with a '-D' option.
  
! '-undef'
       Do not predefine any system-specific or GCC-specific macros.  The
       standard predefined macros remain defined.  *Note Standard
       Predefined Macros::.
  
! '-I DIR'
!      Add the directory DIR to the list of directories to be searched for
!      header files.  *Note Search Path::.  Directories named by '-I' are
!      searched before the standard system include directories.  If the
!      directory DIR is a standard system include directory, the option is
!      ignored to ensure that the default search order for system
!      directories and the special treatment of system headers are not
!      defeated (*note System Headers::) .  If DIR begins with '=', then
!      the '=' will be replaced by the sysroot prefix; see '--sysroot' and
!      '-isysroot'.
  
! '-o FILE'
       Write output to FILE.  This is the same as specifying FILE as the
!      second non-option argument to 'cpp'.  'gcc' has a different
       interpretation of a second non-option argument, so you must use
!      '-o' to specify the output file.
  
! '-Wall'
       Turns on all optional warnings which are desirable for normal code.
!      At present this is '-Wcomment', '-Wtrigraphs', '-Wmultichar' and a
!      warning about integer promotion causing a change of sign in '#if'
       expressions.  Note that many of the preprocessor's warnings are on
       by default and have no options to control them.
  
! '-Wcomment'
! '-Wcomments'
!      Warn whenever a comment-start sequence '/*' appears in a '/*'
!      comment, or whenever a backslash-newline appears in a '//' comment.
       (Both forms have the same effect.)
  
! '-Wtrigraphs'
       Most trigraphs in comments cannot affect the meaning of the
       program.  However, a trigraph that would form an escaped newline
!      ('??/' at the end of a line) can, by changing where the comment
       begins or ends.  Therefore, only trigraphs that would form escaped
       newlines produce warnings inside a comment.
  
!      This option is implied by '-Wall'.  If '-Wall' is not given, this
       option is still enabled unless trigraphs are enabled.  To get
!      trigraph conversion without warnings, but get the other '-Wall'
!      warnings, use '-trigraphs -Wall -Wno-trigraphs'.
  
! '-Wtraditional'
       Warn about certain constructs that behave differently in
       traditional and ISO C.  Also warn about ISO C constructs that have
       no traditional C equivalent, and problematic constructs which
       should be avoided.  *Note Traditional Mode::.
  
! '-Wundef'
       Warn whenever an identifier which is not a macro is encountered in
!      an '#if' directive, outside of 'defined'.  Such identifiers are
       replaced with zero.
  
! '-Wunused-macros'
       Warn about macros defined in the main file that are unused.  A
       macro is "used" if it is expanded or tested for existence at least
       once.  The preprocessor will also warn if the macro has not been
*************** single-letter options may _not_ be group
*** 4191,4199 ****
            #if defined the_macro_causing_the_warning
            #endif
  
! `-Wendif-labels'
!      Warn whenever an `#else' or an `#endif' are followed by text.
!      This usually happens in code of the form
  
            #if FOO
            ...
--- 4162,4170 ----
            #if defined the_macro_causing_the_warning
            #endif
  
! '-Wendif-labels'
!      Warn whenever an '#else' or an '#endif' are followed by text.  This
!      usually happens in code of the form
  
            #if FOO
            ...
*************** single-letter options may _not_ be group
*** 4201,4292 ****
            ...
            #endif FOO
  
!      The second and third `FOO' should be in comments, but often are not
       in older programs.  This warning is on by default.
  
! `-Werror'
       Make all warnings into hard errors.  Source code which triggers
       warnings will be rejected.
  
! `-Wsystem-headers'
       Issue warnings for code in system headers.  These are normally
       unhelpful in finding bugs in your own code, therefore suppressed.
       If you are responsible for the system library, you may want to see
       them.
  
! `-w'
       Suppress all warnings, including those which GNU CPP issues by
       default.
  
! `-pedantic'
!      Issue all the mandatory diagnostics listed in the C standard.
!      Some of them are left out by default, since they trigger
!      frequently on harmless code.
  
! `-pedantic-errors'
       Issue all the mandatory diagnostics, and make all mandatory
       diagnostics into errors.  This includes mandatory diagnostics that
!      GCC issues without `-pedantic' but treats as warnings.
  
! `-M'
       Instead of outputting the result of preprocessing, output a rule
!      suitable for `make' describing the dependencies of the main source
!      file.  The preprocessor outputs one `make' rule containing the
       object file name for that source file, a colon, and the names of
!      all the included files, including those coming from `-include' or
!      `-imacros' command-line options.
  
!      Unless specified explicitly (with `-MT' or `-MQ'), the object file
       name consists of the name of the source file with any suffix
       replaced with object file suffix and with any leading directory
       parts removed.  If there are many included files then the rule is
!      split into several lines using `\'-newline.  The rule has no
       commands.
  
!      This option does not suppress the preprocessor's debug output,
!      such as `-dM'.  To avoid mixing such debug output with the
!      dependency rules you should explicitly specify the dependency
!      output file with `-MF', or use an environment variable like
!      `DEPENDENCIES_OUTPUT' (*note Environment Variables::).  Debug
!      output will still be sent to the regular output stream as normal.
  
!      Passing `-M' to the driver implies `-E', and suppresses warnings
!      with an implicit `-w'.
  
! `-MM'
!      Like `-M' but do not mention header files that are found in system
!      header directories, nor header files that are included, directly
!      or indirectly, from such a header.
  
       This implies that the choice of angle brackets or double quotes in
!      an `#include' directive does not in itself determine whether that
!      header will appear in `-MM' dependency output.  This is a slight
       change in semantics from GCC versions 3.0 and earlier.
  
! `-MF FILE'
!      When used with `-M' or `-MM', specifies a file to write the
!      dependencies to.  If no `-MF' switch is given the preprocessor
       sends the rules to the same place it would have sent preprocessed
       output.
  
!      When used with the driver options `-MD' or `-MMD', `-MF' overrides
       the default dependency output file.
  
! `-MG'
!      In conjunction with an option such as `-M' requesting dependency
!      generation, `-MG' assumes missing header files are generated files
!      and adds them to the dependency list without raising an error.
!      The dependency filename is taken directly from the `#include'
!      directive without prepending any path.  `-MG' also suppresses
!      preprocessed output, as a missing header file renders this useless.
  
       This feature is used in automatic updating of makefiles.
  
! `-MP'
       This option instructs CPP to add a phony target for each dependency
       other than the main file, causing each to depend on nothing.  These
!      dummy rules work around errors `make' gives if you remove header
!      files without updating the `Makefile' to match.
  
       This is typical output:
  
--- 4172,4263 ----
            ...
            #endif FOO
  
!      The second and third 'FOO' should be in comments, but often are not
       in older programs.  This warning is on by default.
  
! '-Werror'
       Make all warnings into hard errors.  Source code which triggers
       warnings will be rejected.
  
! '-Wsystem-headers'
       Issue warnings for code in system headers.  These are normally
       unhelpful in finding bugs in your own code, therefore suppressed.
       If you are responsible for the system library, you may want to see
       them.
  
! '-w'
       Suppress all warnings, including those which GNU CPP issues by
       default.
  
! '-pedantic'
!      Issue all the mandatory diagnostics listed in the C standard.  Some
!      of them are left out by default, since they trigger frequently on
!      harmless code.
  
! '-pedantic-errors'
       Issue all the mandatory diagnostics, and make all mandatory
       diagnostics into errors.  This includes mandatory diagnostics that
!      GCC issues without '-pedantic' but treats as warnings.
  
! '-M'
       Instead of outputting the result of preprocessing, output a rule
!      suitable for 'make' describing the dependencies of the main source
!      file.  The preprocessor outputs one 'make' rule containing the
       object file name for that source file, a colon, and the names of
!      all the included files, including those coming from '-include' or
!      '-imacros' command-line options.
  
!      Unless specified explicitly (with '-MT' or '-MQ'), the object file
       name consists of the name of the source file with any suffix
       replaced with object file suffix and with any leading directory
       parts removed.  If there are many included files then the rule is
!      split into several lines using '\'-newline.  The rule has no
       commands.
  
!      This option does not suppress the preprocessor's debug output, such
!      as '-dM'.  To avoid mixing such debug output with the dependency
!      rules you should explicitly specify the dependency output file with
!      '-MF', or use an environment variable like 'DEPENDENCIES_OUTPUT'
!      (*note Environment Variables::).  Debug output will still be sent
!      to the regular output stream as normal.
  
!      Passing '-M' to the driver implies '-E', and suppresses warnings
!      with an implicit '-w'.
  
! '-MM'
!      Like '-M' but do not mention header files that are found in system
!      header directories, nor header files that are included, directly or
!      indirectly, from such a header.
  
       This implies that the choice of angle brackets or double quotes in
!      an '#include' directive does not in itself determine whether that
!      header will appear in '-MM' dependency output.  This is a slight
       change in semantics from GCC versions 3.0 and earlier.
  
! '-MF FILE'
!      When used with '-M' or '-MM', specifies a file to write the
!      dependencies to.  If no '-MF' switch is given the preprocessor
       sends the rules to the same place it would have sent preprocessed
       output.
  
!      When used with the driver options '-MD' or '-MMD', '-MF' overrides
       the default dependency output file.
  
! '-MG'
!      In conjunction with an option such as '-M' requesting dependency
!      generation, '-MG' assumes missing header files are generated files
!      and adds them to the dependency list without raising an error.  The
!      dependency filename is taken directly from the '#include' directive
!      without prepending any path.  '-MG' also suppresses preprocessed
!      output, as a missing header file renders this useless.
  
       This feature is used in automatic updating of makefiles.
  
! '-MP'
       This option instructs CPP to add a phony target for each dependency
       other than the main file, causing each to depend on nothing.  These
!      dummy rules work around errors 'make' gives if you remove header
!      files without updating the 'Makefile' to match.
  
       This is typical output:
  
*************** single-letter options may _not_ be group
*** 4294,4734 ****
  
            test.h:
  
! `-MT TARGET'
       Change the target of the rule emitted by dependency generation.  By
       default CPP takes the name of the main input file, deletes any
!      directory components and any file suffix such as `.c', and appends
       the platform's usual object suffix.  The result is the target.
  
!      An `-MT' option will set the target to be exactly the string you
       specify.  If you want multiple targets, you can specify them as a
!      single argument to `-MT', or use multiple `-MT' options.
  
!      For example, `-MT '$(objpfx)foo.o'' might give
  
            $(objpfx)foo.o: foo.c
  
! `-MQ TARGET'
!      Same as `-MT', but it quotes any characters which are special to
!      Make.  `-MQ '$(objpfx)foo.o'' gives
  
            $$(objpfx)foo.o: foo.c
  
       The default target is automatically quoted, as if it were given
!      with `-MQ'.
  
! `-MD'
!      `-MD' is equivalent to `-M -MF FILE', except that `-E' is not
!      implied.  The driver determines FILE based on whether an `-o'
!      option is given.  If it is, the driver uses its argument but with
!      a suffix of `.d', otherwise it takes the name of the input file,
!      removes any directory components and suffix, and applies a `.d'
       suffix.
  
!      If `-MD' is used in conjunction with `-E', any `-o' switch is
       understood to specify the dependency output file (*note -MF:
!      dashMF.), but if used without `-E', each `-o' is understood to
       specify a target object file.
  
!      Since `-E' is not implied, `-MD' can be used to generate a
       dependency output file as a side-effect of the compilation process.
  
! `-MMD'
!      Like `-MD' except mention only user header files, not system
!      header files.
  
! `-x c'
! `-x c++'
! `-x objective-c'
! `-x assembler-with-cpp'
       Specify the source language: C, C++, Objective-C, or assembly.
!      This has nothing to do with standards conformance or extensions;
!      it merely selects which base syntax to expect.  If you give none
!      of these options, cpp will deduce the language from the extension
!      of the source file: `.c', `.cc', `.m', or `.S'.  Some other common
       extensions for C++ and assembly are also recognized.  If cpp does
       not recognize the extension, it will treat the file as C; this is
       the most generic mode.
  
!      _Note:_ Previous versions of cpp accepted a `-lang' option which
       selected both the language and the standards conformance level.
!      This option has been removed, because it conflicts with the `-l'
       option.
  
! `-std=STANDARD'
! `-ansi'
       Specify the standard to which the code should conform.  Currently
       CPP knows about C and C++ standards; others may be added in the
       future.
  
       STANDARD may be one of:
!     `c90'
!     `c89'
!     `iso9899:1990'
!           The ISO C standard from 1990.  `c90' is the customary
            shorthand for this version of the standard.
  
!           The `-ansi' option is equivalent to `-std=c90'.
  
!     `iso9899:199409'
            The 1990 C standard, as amended in 1994.
  
!     `iso9899:1999'
!     `c99'
!     `iso9899:199x'
!     `c9x'
            The revised ISO C standard, published in December 1999.
            Before publication, this was known as C9X.
  
!     `iso9899:2011'
!     `c11'
!     `c1x'
            The revised ISO C standard, published in December 2011.
            Before publication, this was known as C1X.
  
!     `gnu90'
!     `gnu89'
            The 1990 C standard plus GNU extensions.  This is the default.
  
!     `gnu99'
!     `gnu9x'
            The 1999 C standard plus GNU extensions.
  
!     `gnu11'
!     `gnu1x'
            The 2011 C standard plus GNU extensions.
  
!     `c++98'
            The 1998 ISO C++ standard plus amendments.
  
!     `gnu++98'
!           The same as `-std=c++98' plus GNU extensions.  This is the
            default for C++ code.
  
! `-I-'
!      Split the include path.  Any directories specified with `-I'
!      options before `-I-' are searched only for headers requested with
!      `#include "FILE"'; they are not searched for `#include <FILE>'.
!      If additional directories are specified with `-I' options after
!      the `-I-', those directories are searched for all `#include'
       directives.
  
!      In addition, `-I-' inhibits the use of the directory of the current
!      file directory as the first search directory for `#include "FILE"'.
       *Note Search Path::.  This option has been deprecated.
  
! `-nostdinc'
       Do not search the standard system directories for header files.
!      Only the directories you have specified with `-I' options (and the
       directory of the current file, if appropriate) are searched.
  
! `-nostdinc++'
       Do not search for header files in the C++-specific standard
       directories, but do still search the other standard directories.
       (This option is used when building the C++ library.)
  
! `-include FILE'
!      Process FILE as if `#include "file"' appeared as the first line of
!      the primary source file.  However, the first directory searched
!      for FILE is the preprocessor's working directory _instead of_ the
       directory containing the main source file.  If not found there, it
!      is searched for in the remainder of the `#include "..."' search
       chain as normal.
  
!      If multiple `-include' options are given, the files are included
!      in the order they appear on the command line.
  
! `-imacros FILE'
!      Exactly like `-include', except that any output produced by
       scanning FILE is thrown away.  Macros it defines remain defined.
       This allows you to acquire all the macros from a header without
       also processing its declarations.
  
!      All files specified by `-imacros' are processed before all files
!      specified by `-include'.
  
! `-idirafter DIR'
       Search DIR for header files, but do it _after_ all directories
!      specified with `-I' and the standard system directories have been
       exhausted.  DIR is treated as a system include directory.  If DIR
!      begins with `=', then the `=' will be replaced by the sysroot
!      prefix; see `--sysroot' and `-isysroot'.
  
! `-iprefix PREFIX'
!      Specify PREFIX as the prefix for subsequent `-iwithprefix'
!      options.  If the prefix represents a directory, you should include
!      the final `/'.
  
! `-iwithprefix DIR'
! `-iwithprefixbefore DIR'
!      Append DIR to the prefix specified previously with `-iprefix', and
       add the resulting directory to the include search path.
!      `-iwithprefixbefore' puts it in the same place `-I' would;
!      `-iwithprefix' puts it where `-idirafter' would.
  
! `-isysroot DIR'
!      This option is like the `--sysroot' option, but applies only to
       header files (except for Darwin targets, where it applies to both
!      header files and libraries).  See the `--sysroot' option for more
       information.
  
! `-imultilib DIR'
       Use DIR as a subdirectory of the directory containing
       target-specific C++ headers.
  
! `-isystem DIR'
       Search DIR for header files, after all directories specified by
!      `-I' but before the standard system directories.  Mark it as a
       system directory, so that it gets the same special treatment as is
       applied to the standard system directories.  *Note System
!      Headers::.  If DIR begins with `=', then the `=' will be replaced
!      by the sysroot prefix; see `--sysroot' and `-isysroot'.
  
! `-iquote DIR'
!      Search DIR only for header files requested with `#include "FILE"';
!      they are not searched for `#include <FILE>', before all
!      directories specified by `-I' and before the standard system
!      directories.  *Note Search Path::.  If DIR begins with `=', then
!      the `=' will be replaced by the sysroot prefix; see `--sysroot'
!      and `-isysroot'.
  
! `-fdirectives-only'
       When preprocessing, handle directives, but do not expand macros.
  
!      The option's behavior depends on the `-E' and `-fpreprocessed'
       options.
  
!      With `-E', preprocessing is limited to the handling of directives
!      such as `#define', `#ifdef', and `#error'.  Other preprocessor
!      operations, such as macro expansion and trigraph conversion are
!      not performed.  In addition, the `-dD' option is implicitly
!      enabled.
  
!      With `-fpreprocessed', predefinition of command line and most
!      builtin macros is disabled.  Macros such as `__LINE__', which are
       contextually dependent, are handled normally.  This enables
!      compilation of files previously preprocessed with `-E
       -fdirectives-only'.
  
!      With both `-E' and `-fpreprocessed', the rules for
!      `-fpreprocessed' take precedence.  This enables full preprocessing
!      of files previously preprocessed with `-E -fdirectives-only'.
  
! `-fdollars-in-identifiers'
!      Accept `$' in identifiers.  *Note Identifier characters::.
  
! `-fextended-identifiers'
       Accept universal character names in identifiers.  This option is
       enabled by default for C99 (and later C standard versions) and C++.
  
! `-fno-canonical-system-headers'
       When preprocessing, do not shorten system header paths with
       canonicalization.
  
! `-fpreprocessed'
       Indicate to the preprocessor that the input file has already been
       preprocessed.  This suppresses things like macro expansion,
       trigraph conversion, escaped newline splicing, and processing of
       most directives.  The preprocessor still recognizes and removes
!      comments, so that you can pass a file preprocessed with `-C' to
!      the compiler without problems.  In this mode the integrated
       preprocessor is little more than a tokenizer for the front ends.
  
!      `-fpreprocessed' is implicit if the input file has one of the
!      extensions `.i', `.ii' or `.mi'.  These are the extensions that
!      GCC uses for preprocessed files created by `-save-temps'.
  
! `-ftabstop=WIDTH'
       Set the distance between tab stops.  This helps the preprocessor
       report correct column numbers in warnings or errors, even if tabs
       appear on the line.  If the value is less than 1 or greater than
       100, the option is ignored.  The default is 8.
  
! `-fdebug-cpp'
!      This option is only useful for debugging GCC.  When used with
!      `-E', dumps debugging information about location maps.  Every
!      token in the output is preceded by the dump of the map its location
!      belongs to.  The dump of the map holding the location of a token
!      would be:
!           {`P':`/file/path';`F':`/includer/path';`L':LINE_NUM;`C':COL_NUM;`S':SYSTEM_HEADER_P;`M':MAP_ADDRESS;`E':MACRO_EXPANSION_P,`loc':LOCATION}
  
!      When used without `-E', this option has no effect.
  
! `-ftrack-macro-expansion[=LEVEL]'
!      Track locations of tokens across macro expansions. This allows the
       compiler to emit diagnostic about the current macro expansion stack
!      when a compilation error occurs in a macro expansion. Using this
!      option makes the preprocessor and the compiler consume more
!      memory. The LEVEL parameter can be used to choose the level of
!      precision of token location tracking thus decreasing the memory
!      consumption if necessary. Value `0' of LEVEL de-activates this
!      option just as if no `-ftrack-macro-expansion' was present on the
!      command line. Value `1' tracks tokens locations in a degraded mode
!      for the sake of minimal memory overhead. In this mode all tokens
!      resulting from the expansion of an argument of a function-like
!      macro have the same location. Value `2' tracks tokens locations
!      completely. This value is the most memory hungry.  When this
!      option is given no argument, the default parameter value is `2'.
  
!      Note that `-ftrack-macro-expansion=2' is activated by default.
  
! `-fexec-charset=CHARSET'
       Set the execution character set, used for string and character
       constants.  The default is UTF-8.  CHARSET can be any encoding
!      supported by the system's `iconv' library routine.
  
! `-fwide-exec-charset=CHARSET'
       Set the wide execution character set, used for wide string and
       character constants.  The default is UTF-32 or UTF-16, whichever
!      corresponds to the width of `wchar_t'.  As with `-fexec-charset',
!      CHARSET can be any encoding supported by the system's `iconv'
       library routine; however, you will have problems with encodings
!      that do not fit exactly in `wchar_t'.
  
! `-finput-charset=CHARSET'
       Set the input character set, used for translation from the
!      character set of the input file to the source character set used
!      by GCC.  If the locale does not specify, or GCC cannot get this
       information from the locale, the default is UTF-8.  This can be
       overridden by either the locale or this command-line option.
       Currently the command-line option takes precedence if there's a
       conflict.  CHARSET can be any encoding supported by the system's
!      `iconv' library routine.
  
! `-fworking-directory'
       Enable generation of linemarkers in the preprocessor output that
       will let the compiler know the current working directory at the
       time of preprocessing.  When this option is enabled, the
       preprocessor will emit, after the initial linemarker, a second
       linemarker with the current working directory followed by two
       slashes.  GCC will use this directory, when it's present in the
!      preprocessed input, as the directory emitted as the current
!      working directory in some debugging information formats.  This
!      option is implicitly enabled if debugging information is enabled,
!      but this can be inhibited with the negated form
!      `-fno-working-directory'.  If the `-P' flag is present in the
!      command line, this option has no effect, since no `#line'
!      directives are emitted whatsoever.
  
! `-fno-show-column'
       Do not print column numbers in diagnostics.  This may be necessary
       if diagnostics are being scanned by a program that does not
!      understand the column numbers, such as `dejagnu'.
  
! `-A PREDICATE=ANSWER'
       Make an assertion with the predicate PREDICATE and answer ANSWER.
!      This form is preferred to the older form `-A PREDICATE(ANSWER)',
       which is still supported, because it does not use shell special
       characters.  *Note Obsolete Features::.
  
! `-A -PREDICATE=ANSWER'
       Cancel an assertion with the predicate PREDICATE and answer ANSWER.
  
! `-dCHARS'
!      CHARS is a sequence of one or more of the following characters,
!      and must not be preceded by a space.  Other characters are
!      interpreted by the compiler proper, or reserved for future
!      versions of GCC, and so are silently ignored.  If you specify
!      characters whose behavior conflicts, the result is undefined.
  
!     `M'
!           Instead of the normal output, generate a list of `#define'
            directives for all the macros defined during the execution of
!           the preprocessor, including predefined macros.  This gives
!           you a way of finding out what is predefined in your version
!           of the preprocessor.  Assuming you have no file `foo.h', the
!           command
  
                 touch foo.h; cpp -dM foo.h
  
            will show all the predefined macros.
  
!           If you use `-dM' without the `-E' option, `-dM' is
!           interpreted as a synonym for `-fdump-rtl-mach'.  *Note
!           Debugging Options: (gcc)Debugging Options.
  
!     `D'
!           Like `M' except in two respects: it does _not_ include the
!           predefined macros, and it outputs _both_ the `#define'
            directives and the result of preprocessing.  Both kinds of
            output go to the standard output file.
  
!     `N'
!           Like `D', but emit only the macro names, not their expansions.
  
!     `I'
!           Output `#include' directives in addition to the result of
            preprocessing.
  
!     `U'
!           Like `D' except that only macros that are expanded, or whose
            definedness is tested in preprocessor directives, are output;
            the output is delayed until the use or test of the macro; and
!           `#undef' directives are also output for macros tested but
            undefined at the time.
  
! `-P'
       Inhibit generation of linemarkers in the output from the
       preprocessor.  This might be useful when running the preprocessor
       on something that is not C code, and will be sent to a program
       which might be confused by the linemarkers.  *Note Preprocessor
       Output::.
  
! `-C'
       Do not discard comments.  All comments are passed through to the
!      output file, except for comments in processed directives, which
!      are deleted along with the directive.
  
!      You should be prepared for side effects when using `-C'; it causes
       the preprocessor to treat comments as tokens in their own right.
       For example, comments appearing at the start of what would be a
       directive line have the effect of turning that line into an
       ordinary source line, since the first token on the line is no
!      longer a `#'.
  
! `-CC'
       Do not discard comments, including during macro expansion.  This is
!      like `-C', except that comments contained within macros are also
       passed through to the output file where the macro is expanded.
  
!      In addition to the side-effects of the `-C' option, the `-CC'
!      option causes all C++-style comments inside a macro to be
!      converted to C-style comments.  This is to prevent later use of
!      that macro from inadvertently commenting out the remainder of the
!      source line.
  
!      The `-CC' option is generally used to support lint comments.
  
! `-traditional-cpp'
       Try to imitate the behavior of old-fashioned C preprocessors, as
       opposed to ISO C preprocessors.  *Note Traditional Mode::.
  
! `-trigraphs'
       Process trigraph sequences.  *Note Initial processing::.
  
! `-remap'
       Enable special code to work around file systems which only permit
       very short file names, such as MS-DOS.
  
! `--help'
! `--target-help'
       Print text describing all the command-line options instead of
       preprocessing anything.
  
! `-v'
       Verbose mode.  Print out GNU CPP's version number at the beginning
       of execution, and report the final form of the include path.
  
! `-H'
       Print the name of each header file used, in addition to other
       normal activities.  Each name is indented to show how deep in the
!      `#include' stack it is.  Precompiled header files are also
!      printed, even if they are found to be invalid; an invalid
!      precompiled header file is printed with `...x' and a valid one
!      with `...!' .
  
! `-version'
! `--version'
       Print out GNU CPP's version number.  With one dash, proceed to
       preprocess as normal.  With two dashes, exit immediately.
  
--- 4265,4700 ----
  
            test.h:
  
! '-MT TARGET'
! 
       Change the target of the rule emitted by dependency generation.  By
       default CPP takes the name of the main input file, deletes any
!      directory components and any file suffix such as '.c', and appends
       the platform's usual object suffix.  The result is the target.
  
!      An '-MT' option will set the target to be exactly the string you
       specify.  If you want multiple targets, you can specify them as a
!      single argument to '-MT', or use multiple '-MT' options.
  
!      For example, '-MT '$(objpfx)foo.o'' might give
  
            $(objpfx)foo.o: foo.c
  
! '-MQ TARGET'
! 
!      Same as '-MT', but it quotes any characters which are special to
!      Make.  '-MQ '$(objpfx)foo.o'' gives
  
            $$(objpfx)foo.o: foo.c
  
       The default target is automatically quoted, as if it were given
!      with '-MQ'.
  
! '-MD'
!      '-MD' is equivalent to '-M -MF FILE', except that '-E' is not
!      implied.  The driver determines FILE based on whether an '-o'
!      option is given.  If it is, the driver uses its argument but with a
!      suffix of '.d', otherwise it takes the name of the input file,
!      removes any directory components and suffix, and applies a '.d'
       suffix.
  
!      If '-MD' is used in conjunction with '-E', any '-o' switch is
       understood to specify the dependency output file (*note -MF:
!      dashMF.), but if used without '-E', each '-o' is understood to
       specify a target object file.
  
!      Since '-E' is not implied, '-MD' can be used to generate a
       dependency output file as a side-effect of the compilation process.
  
! '-MMD'
!      Like '-MD' except mention only user header files, not system header
!      files.
  
! '-x c'
! '-x c++'
! '-x objective-c'
! '-x assembler-with-cpp'
       Specify the source language: C, C++, Objective-C, or assembly.
!      This has nothing to do with standards conformance or extensions; it
!      merely selects which base syntax to expect.  If you give none of
!      these options, cpp will deduce the language from the extension of
!      the source file: '.c', '.cc', '.m', or '.S'.  Some other common
       extensions for C++ and assembly are also recognized.  If cpp does
       not recognize the extension, it will treat the file as C; this is
       the most generic mode.
  
!      _Note:_ Previous versions of cpp accepted a '-lang' option which
       selected both the language and the standards conformance level.
!      This option has been removed, because it conflicts with the '-l'
       option.
  
! '-std=STANDARD'
! '-ansi'
       Specify the standard to which the code should conform.  Currently
       CPP knows about C and C++ standards; others may be added in the
       future.
  
       STANDARD may be one of:
!      'c90'
!      'c89'
!      'iso9899:1990'
!           The ISO C standard from 1990.  'c90' is the customary
            shorthand for this version of the standard.
  
!           The '-ansi' option is equivalent to '-std=c90'.
  
!      'iso9899:199409'
            The 1990 C standard, as amended in 1994.
  
!      'iso9899:1999'
!      'c99'
!      'iso9899:199x'
!      'c9x'
            The revised ISO C standard, published in December 1999.
            Before publication, this was known as C9X.
  
!      'iso9899:2011'
!      'c11'
!      'c1x'
            The revised ISO C standard, published in December 2011.
            Before publication, this was known as C1X.
  
!      'gnu90'
!      'gnu89'
            The 1990 C standard plus GNU extensions.  This is the default.
  
!      'gnu99'
!      'gnu9x'
            The 1999 C standard plus GNU extensions.
  
!      'gnu11'
!      'gnu1x'
            The 2011 C standard plus GNU extensions.
  
!      'c++98'
            The 1998 ISO C++ standard plus amendments.
  
!      'gnu++98'
!           The same as '-std=c++98' plus GNU extensions.  This is the
            default for C++ code.
  
! '-I-'
!      Split the include path.  Any directories specified with '-I'
!      options before '-I-' are searched only for headers requested with
!      '#include "FILE"'; they are not searched for '#include <FILE>'.  If
!      additional directories are specified with '-I' options after the
!      '-I-', those directories are searched for all '#include'
       directives.
  
!      In addition, '-I-' inhibits the use of the directory of the current
!      file directory as the first search directory for '#include "FILE"'.
       *Note Search Path::.  This option has been deprecated.
  
! '-nostdinc'
       Do not search the standard system directories for header files.
!      Only the directories you have specified with '-I' options (and the
       directory of the current file, if appropriate) are searched.
  
! '-nostdinc++'
       Do not search for header files in the C++-specific standard
       directories, but do still search the other standard directories.
       (This option is used when building the C++ library.)
  
! '-include FILE'
!      Process FILE as if '#include "file"' appeared as the first line of
!      the primary source file.  However, the first directory searched for
!      FILE is the preprocessor's working directory _instead of_ the
       directory containing the main source file.  If not found there, it
!      is searched for in the remainder of the '#include "..."' search
       chain as normal.
  
!      If multiple '-include' options are given, the files are included in
!      the order they appear on the command line.
  
! '-imacros FILE'
!      Exactly like '-include', except that any output produced by
       scanning FILE is thrown away.  Macros it defines remain defined.
       This allows you to acquire all the macros from a header without
       also processing its declarations.
  
!      All files specified by '-imacros' are processed before all files
!      specified by '-include'.
  
! '-idirafter DIR'
       Search DIR for header files, but do it _after_ all directories
!      specified with '-I' and the standard system directories have been
       exhausted.  DIR is treated as a system include directory.  If DIR
!      begins with '=', then the '=' will be replaced by the sysroot
!      prefix; see '--sysroot' and '-isysroot'.
  
! '-iprefix PREFIX'
!      Specify PREFIX as the prefix for subsequent '-iwithprefix' options.
!      If the prefix represents a directory, you should include the final
!      '/'.
  
! '-iwithprefix DIR'
! '-iwithprefixbefore DIR'
!      Append DIR to the prefix specified previously with '-iprefix', and
       add the resulting directory to the include search path.
!      '-iwithprefixbefore' puts it in the same place '-I' would;
!      '-iwithprefix' puts it where '-idirafter' would.
  
! '-isysroot DIR'
!      This option is like the '--sysroot' option, but applies only to
       header files (except for Darwin targets, where it applies to both
!      header files and libraries).  See the '--sysroot' option for more
       information.
  
! '-imultilib DIR'
       Use DIR as a subdirectory of the directory containing
       target-specific C++ headers.
  
! '-isystem DIR'
       Search DIR for header files, after all directories specified by
!      '-I' but before the standard system directories.  Mark it as a
       system directory, so that it gets the same special treatment as is
       applied to the standard system directories.  *Note System
!      Headers::.  If DIR begins with '=', then the '=' will be replaced
!      by the sysroot prefix; see '--sysroot' and '-isysroot'.
  
! '-iquote DIR'
!      Search DIR only for header files requested with '#include "FILE"';
!      they are not searched for '#include <FILE>', before all directories
!      specified by '-I' and before the standard system directories.
!      *Note Search Path::.  If DIR begins with '=', then the '=' will be
!      replaced by the sysroot prefix; see '--sysroot' and '-isysroot'.
  
! '-fdirectives-only'
       When preprocessing, handle directives, but do not expand macros.
  
!      The option's behavior depends on the '-E' and '-fpreprocessed'
       options.
  
!      With '-E', preprocessing is limited to the handling of directives
!      such as '#define', '#ifdef', and '#error'.  Other preprocessor
!      operations, such as macro expansion and trigraph conversion are not
!      performed.  In addition, the '-dD' option is implicitly enabled.
  
!      With '-fpreprocessed', predefinition of command line and most
!      builtin macros is disabled.  Macros such as '__LINE__', which are
       contextually dependent, are handled normally.  This enables
!      compilation of files previously preprocessed with '-E
       -fdirectives-only'.
  
!      With both '-E' and '-fpreprocessed', the rules for '-fpreprocessed'
!      take precedence.  This enables full preprocessing of files
!      previously preprocessed with '-E -fdirectives-only'.
  
! '-fdollars-in-identifiers'
!      Accept '$' in identifiers.  *Note Identifier characters::.
  
! '-fextended-identifiers'
       Accept universal character names in identifiers.  This option is
       enabled by default for C99 (and later C standard versions) and C++.
  
! '-fno-canonical-system-headers'
       When preprocessing, do not shorten system header paths with
       canonicalization.
  
! '-fpreprocessed'
       Indicate to the preprocessor that the input file has already been
       preprocessed.  This suppresses things like macro expansion,
       trigraph conversion, escaped newline splicing, and processing of
       most directives.  The preprocessor still recognizes and removes
!      comments, so that you can pass a file preprocessed with '-C' to the
!      compiler without problems.  In this mode the integrated
       preprocessor is little more than a tokenizer for the front ends.
  
!      '-fpreprocessed' is implicit if the input file has one of the
!      extensions '.i', '.ii' or '.mi'.  These are the extensions that GCC
!      uses for preprocessed files created by '-save-temps'.
  
! '-ftabstop=WIDTH'
       Set the distance between tab stops.  This helps the preprocessor
       report correct column numbers in warnings or errors, even if tabs
       appear on the line.  If the value is less than 1 or greater than
       100, the option is ignored.  The default is 8.
  
! '-fdebug-cpp'
!      This option is only useful for debugging GCC. When used with '-E',
!      dumps debugging information about location maps.  Every token in
!      the output is preceded by the dump of the map its location belongs
!      to.  The dump of the map holding the location of a token would be:
!           {'P':/file/path;'F':/includer/path;'L':LINE_NUM;'C':COL_NUM;'S':SYSTEM_HEADER_P;'M':MAP_ADDRESS;'E':MACRO_EXPANSION_P,'loc':LOCATION}
  
!      When used without '-E', this option has no effect.
  
! '-ftrack-macro-expansion[=LEVEL]'
!      Track locations of tokens across macro expansions.  This allows the
       compiler to emit diagnostic about the current macro expansion stack
!      when a compilation error occurs in a macro expansion.  Using this
!      option makes the preprocessor and the compiler consume more memory.
!      The LEVEL parameter can be used to choose the level of precision of
!      token location tracking thus decreasing the memory consumption if
!      necessary.  Value '0' of LEVEL de-activates this option just as if
!      no '-ftrack-macro-expansion' was present on the command line.
!      Value '1' tracks tokens locations in a degraded mode for the sake
!      of minimal memory overhead.  In this mode all tokens resulting from
!      the expansion of an argument of a function-like macro have the same
!      location.  Value '2' tracks tokens locations completely.  This
!      value is the most memory hungry.  When this option is given no
!      argument, the default parameter value is '2'.
  
!      Note that '-ftrack-macro-expansion=2' is activated by default.
  
! '-fexec-charset=CHARSET'
       Set the execution character set, used for string and character
       constants.  The default is UTF-8.  CHARSET can be any encoding
!      supported by the system's 'iconv' library routine.
  
! '-fwide-exec-charset=CHARSET'
       Set the wide execution character set, used for wide string and
       character constants.  The default is UTF-32 or UTF-16, whichever
!      corresponds to the width of 'wchar_t'.  As with '-fexec-charset',
!      CHARSET can be any encoding supported by the system's 'iconv'
       library routine; however, you will have problems with encodings
!      that do not fit exactly in 'wchar_t'.
  
! '-finput-charset=CHARSET'
       Set the input character set, used for translation from the
!      character set of the input file to the source character set used by
!      GCC.  If the locale does not specify, or GCC cannot get this
       information from the locale, the default is UTF-8.  This can be
       overridden by either the locale or this command-line option.
       Currently the command-line option takes precedence if there's a
       conflict.  CHARSET can be any encoding supported by the system's
!      'iconv' library routine.
  
! '-fworking-directory'
       Enable generation of linemarkers in the preprocessor output that
       will let the compiler know the current working directory at the
       time of preprocessing.  When this option is enabled, the
       preprocessor will emit, after the initial linemarker, a second
       linemarker with the current working directory followed by two
       slashes.  GCC will use this directory, when it's present in the
!      preprocessed input, as the directory emitted as the current working
!      directory in some debugging information formats.  This option is
!      implicitly enabled if debugging information is enabled, but this
!      can be inhibited with the negated form '-fno-working-directory'.
!      If the '-P' flag is present in the command line, this option has no
!      effect, since no '#line' directives are emitted whatsoever.
  
! '-fno-show-column'
       Do not print column numbers in diagnostics.  This may be necessary
       if diagnostics are being scanned by a program that does not
!      understand the column numbers, such as 'dejagnu'.
  
! '-A PREDICATE=ANSWER'
       Make an assertion with the predicate PREDICATE and answer ANSWER.
!      This form is preferred to the older form '-A PREDICATE(ANSWER)',
       which is still supported, because it does not use shell special
       characters.  *Note Obsolete Features::.
  
! '-A -PREDICATE=ANSWER'
       Cancel an assertion with the predicate PREDICATE and answer ANSWER.
  
! '-dCHARS'
!      CHARS is a sequence of one or more of the following characters, and
!      must not be preceded by a space.  Other characters are interpreted
!      by the compiler proper, or reserved for future versions of GCC, and
!      so are silently ignored.  If you specify characters whose behavior
!      conflicts, the result is undefined.
  
!      'M'
!           Instead of the normal output, generate a list of '#define'
            directives for all the macros defined during the execution of
!           the preprocessor, including predefined macros.  This gives you
!           a way of finding out what is predefined in your version of the
!           preprocessor.  Assuming you have no file 'foo.h', the command
  
                 touch foo.h; cpp -dM foo.h
  
            will show all the predefined macros.
  
!           If you use '-dM' without the '-E' option, '-dM' is interpreted
!           as a synonym for '-fdump-rtl-mach'.  *Note (gcc)Debugging
!           Options::.
  
!      'D'
!           Like 'M' except in two respects: it does _not_ include the
!           predefined macros, and it outputs _both_ the '#define'
            directives and the result of preprocessing.  Both kinds of
            output go to the standard output file.
  
!      'N'
!           Like 'D', but emit only the macro names, not their expansions.
  
!      'I'
!           Output '#include' directives in addition to the result of
            preprocessing.
  
!      'U'
!           Like 'D' except that only macros that are expanded, or whose
            definedness is tested in preprocessor directives, are output;
            the output is delayed until the use or test of the macro; and
!           '#undef' directives are also output for macros tested but
            undefined at the time.
  
! '-P'
       Inhibit generation of linemarkers in the output from the
       preprocessor.  This might be useful when running the preprocessor
       on something that is not C code, and will be sent to a program
       which might be confused by the linemarkers.  *Note Preprocessor
       Output::.
  
! '-C'
       Do not discard comments.  All comments are passed through to the
!      output file, except for comments in processed directives, which are
!      deleted along with the directive.
  
!      You should be prepared for side effects when using '-C'; it causes
       the preprocessor to treat comments as tokens in their own right.
       For example, comments appearing at the start of what would be a
       directive line have the effect of turning that line into an
       ordinary source line, since the first token on the line is no
!      longer a '#'.
  
! '-CC'
       Do not discard comments, including during macro expansion.  This is
!      like '-C', except that comments contained within macros are also
       passed through to the output file where the macro is expanded.
  
!      In addition to the side-effects of the '-C' option, the '-CC'
!      option causes all C++-style comments inside a macro to be converted
!      to C-style comments.  This is to prevent later use of that macro
!      from inadvertently commenting out the remainder of the source line.
  
!      The '-CC' option is generally used to support lint comments.
  
! '-traditional-cpp'
       Try to imitate the behavior of old-fashioned C preprocessors, as
       opposed to ISO C preprocessors.  *Note Traditional Mode::.
  
! '-trigraphs'
       Process trigraph sequences.  *Note Initial processing::.
  
! '-remap'
       Enable special code to work around file systems which only permit
       very short file names, such as MS-DOS.
  
! '--help'
! '--target-help'
       Print text describing all the command-line options instead of
       preprocessing anything.
  
! '-v'
       Verbose mode.  Print out GNU CPP's version number at the beginning
       of execution, and report the final form of the include path.
  
! '-H'
       Print the name of each header file used, in addition to other
       normal activities.  Each name is indented to show how deep in the
!      '#include' stack it is.  Precompiled header files are also printed,
!      even if they are found to be invalid; an invalid precompiled header
!      file is printed with '...x' and a valid one with '...!' .
  
! '-version'
! '--version'
       Print out GNU CPP's version number.  With one dash, proceed to
       preprocess as normal.  With two dashes, exit immediately.
  
*************** operates.  You can use them to specify d
*** 4743,4802 ****
  when searching for include files, or to control dependency output.
  
     Note that you can also specify places to search using options such as
! `-I', and control dependency output with options like `-M' (*note
  Invocation::).  These take precedence over environment variables, which
  in turn take precedence over the configuration of GCC.
  
! `CPATH'
! `C_INCLUDE_PATH'
! `CPLUS_INCLUDE_PATH'
! `OBJC_INCLUDE_PATH'
       Each variable's value is a list of directories separated by a
!      special character, much like `PATH', in which to look for header
!      files.  The special character, `PATH_SEPARATOR', is
       target-dependent and determined at GCC build time.  For Microsoft
       Windows-based targets it is a semicolon, and for almost all other
       targets it is a colon.
  
!      `CPATH' specifies a list of directories to be searched as if
!      specified with `-I', but after any paths given with `-I' options
!      on the command line.  This environment variable is used regardless
!      of which language is being preprocessed.
  
       The remaining environment variables apply only when preprocessing
       the particular language indicated.  Each specifies a list of
!      directories to be searched as if specified with `-isystem', but
!      after any paths given with `-isystem' options on the command line.
  
       In all these variables, an empty element instructs the compiler to
!      search its current working directory.  Empty elements can appear
!      at the beginning or end of a path.  For instance, if the value of
!      `CPATH' is `:/special/include', that has the same effect as
!      `-I. -I/special/include'.
  
       See also *note Search Path::.
  
! `DEPENDENCIES_OUTPUT'
       If this variable is set, its value specifies how to output
       dependencies for Make based on the non-system header files
       processed by the compiler.  System header files are ignored in the
       dependency output.
  
!      The value of `DEPENDENCIES_OUTPUT' can be just a file name, in
       which case the Make rules are written to that file, guessing the
       target name from the source file name.  Or the value can have the
!      form `FILE TARGET', in which case the rules are written to file
       FILE using TARGET as the target name.
  
       In other words, this environment variable is equivalent to
!      combining the options `-MM' and `-MF' (*note Invocation::), with
!      an optional `-MT' switch too.
  
! `SUNPRO_DEPENDENCIES'
!      This variable is the same as `DEPENDENCIES_OUTPUT' (see above),
!      except that system header files are not ignored, so it implies
!      `-M' rather than `-MM'.  However, the dependence on the main input
!      file is omitted.  *Note Invocation::.
  
  
  File: cpp.info,  Node: GNU Free Documentation License,  Next: Index of Directives,  Prev: Environment Variables,  Up: Top
--- 4709,4768 ----
  when searching for include files, or to control dependency output.
  
     Note that you can also specify places to search using options such as
! '-I', and control dependency output with options like '-M' (*note
  Invocation::).  These take precedence over environment variables, which
  in turn take precedence over the configuration of GCC.
  
! 'CPATH'
! 'C_INCLUDE_PATH'
! 'CPLUS_INCLUDE_PATH'
! 'OBJC_INCLUDE_PATH'
       Each variable's value is a list of directories separated by a
!      special character, much like 'PATH', in which to look for header
!      files.  The special character, 'PATH_SEPARATOR', is
       target-dependent and determined at GCC build time.  For Microsoft
       Windows-based targets it is a semicolon, and for almost all other
       targets it is a colon.
  
!      'CPATH' specifies a list of directories to be searched as if
!      specified with '-I', but after any paths given with '-I' options on
!      the command line.  This environment variable is used regardless of
!      which language is being preprocessed.
  
       The remaining environment variables apply only when preprocessing
       the particular language indicated.  Each specifies a list of
!      directories to be searched as if specified with '-isystem', but
!      after any paths given with '-isystem' options on the command line.
  
       In all these variables, an empty element instructs the compiler to
!      search its current working directory.  Empty elements can appear at
!      the beginning or end of a path.  For instance, if the value of
!      'CPATH' is ':/special/include', that has the same effect as
!      '-I. -I/special/include'.
  
       See also *note Search Path::.
  
! 'DEPENDENCIES_OUTPUT'
       If this variable is set, its value specifies how to output
       dependencies for Make based on the non-system header files
       processed by the compiler.  System header files are ignored in the
       dependency output.
  
!      The value of 'DEPENDENCIES_OUTPUT' can be just a file name, in
       which case the Make rules are written to that file, guessing the
       target name from the source file name.  Or the value can have the
!      form 'FILE TARGET', in which case the rules are written to file
       FILE using TARGET as the target name.
  
       In other words, this environment variable is equivalent to
!      combining the options '-MM' and '-MF' (*note Invocation::), with an
!      optional '-MT' switch too.
  
! 'SUNPRO_DEPENDENCIES'
!      This variable is the same as 'DEPENDENCIES_OUTPUT' (see above),
!      except that system header files are not ignored, so it implies '-M'
!      rather than '-MM'.  However, the dependence on the main input file
!      is omitted.  *Note Invocation::.
  
  
  File: cpp.info,  Node: GNU Free Documentation License,  Next: Index of Directives,  Prev: Environment Variables,  Up: Top
*************** GNU Free Documentation License
*** 4807,4813 ****
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
--- 4773,4779 ----
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
*************** GNU Free Documentation License
*** 4832,4852 ****
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.
!      We recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it
!      can be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You
!      accept the license if you copy, modify or distribute the work in a
!      way requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
--- 4798,4818 ----
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.  We
!      recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it can
!      be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You accept
!      the license if you copy, modify or distribute the work in a way
!      requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
*************** GNU Free Documentation License
*** 4864,4875 ****
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in
!      the notice that says that the Document is released under this
!      License.  If a section does not fit the above definition of
!      Secondary then it is not allowed to be designated as Invariant.
!      The Document may contain zero Invariant Sections.  If the Document
!      does not identify any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
--- 4830,4841 ----
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in the
!      notice that says that the Document is released under this License.
!      If a section does not fit the above definition of Secondary then it
!      is not allowed to be designated as Invariant.  The Document may
!      contain zero Invariant Sections.  If the Document does not identify
!      any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
*************** GNU Free Documentation License
*** 4880,4906 ****
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images
!      composed of pixels) generic paint programs or (for drawings) some
!      widely available drawing editor, and that is suitable for input to
!      text formatters or for automatic translation to a variety of
!      formats suitable for input to text formatters.  A copy made in an
!      otherwise Transparent file format whose markup, or absence of
!      markup, has been arranged to thwart or discourage subsequent
!      modification by readers is not Transparent.  An image format is
!      not Transparent if used for any substantial amount of text.  A
!      copy that is not "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and
!      standard-conforming simple HTML, PostScript or PDF designed for
!      human modification.  Examples of transparent image formats include
!      PNG, XCF and JPG.  Opaque formats include proprietary formats that
!      can be read and edited only by proprietary word processors, SGML or
!      XML for which the DTD and/or processing tools are not generally
!      available, and the machine-generated HTML, PostScript or PDF
!      produced by some word processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
--- 4846,4872 ----
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images composed
!      of pixels) generic paint programs or (for drawings) some widely
!      available drawing editor, and that is suitable for input to text
!      formatters or for automatic translation to a variety of formats
!      suitable for input to text formatters.  A copy made in an otherwise
!      Transparent file format whose markup, or absence of markup, has
!      been arranged to thwart or discourage subsequent modification by
!      readers is not Transparent.  An image format is not Transparent if
!      used for any substantial amount of text.  A copy that is not
!      "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and standard-conforming
!      simple HTML, PostScript or PDF designed for human modification.
!      Examples of transparent image formats include PNG, XCF and JPG.
!      Opaque formats include proprietary formats that can be read and
!      edited only by proprietary word processors, SGML or XML for which
!      the DTD and/or processing tools are not generally available, and
!      the machine-generated HTML, PostScript or PDF produced by some word
!      processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
*************** GNU Free Documentation License
*** 4938,4945 ****
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow
!      the conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
--- 4904,4911 ----
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow the
!      conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
*************** GNU Free Documentation License
*** 4953,4964 ****
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the
!      title equally prominent and visible.  You may add other material
!      on the covers in addition.  Copying with changes limited to the
!      covers, as long as they preserve the title of the Document and
!      satisfy these conditions, can be treated as verbatim copying in
!      other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
--- 4919,4929 ----
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the title
!      equally prominent and visible.  You may add other material on the
!      covers in addition.  Copying with changes limited to the covers, as
!      long as they preserve the title of the Document and satisfy these
!      conditions, can be treated as verbatim copying in other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
*************** GNU Free Documentation License
*** 4966,5005 ****
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a
!      machine-readable Transparent copy along with each Opaque copy, or
!      state in or with each Opaque copy a computer-network location from
!      which the general network-using public has access to download
!      using public-standard network protocols a complete Transparent
!      copy of the Document, free of added material.  If you use the
!      latter option, you must take reasonably prudent steps, when you
!      begin distribution of Opaque copies in quantity, to ensure that
!      this Transparent copy will remain thus accessible at the stated
!      location until at least one year after the last time you
!      distribute an Opaque copy (directly or through your agents or
!      retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of
!      copies, to give them a chance to provide you with an updated
!      version of the Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with
!      the Modified Version filling the role of the Document, thus
!      licensing distribution and modification of the Modified Version to
!      whoever possesses a copy of it.  In addition, you must do these
!      things in the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of
!           previous versions (which should, if there were any, be listed
!           in the History section of the Document).  You may use the
!           same title as a previous version if the original publisher of
!           that version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
--- 4931,4969 ----
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a machine-readable
!      Transparent copy along with each Opaque copy, or state in or with
!      each Opaque copy a computer-network location from which the general
!      network-using public has access to download using public-standard
!      network protocols a complete Transparent copy of the Document, free
!      of added material.  If you use the latter option, you must take
!      reasonably prudent steps, when you begin distribution of Opaque
!      copies in quantity, to ensure that this Transparent copy will
!      remain thus accessible at the stated location until at least one
!      year after the last time you distribute an Opaque copy (directly or
!      through your agents or retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of copies,
!      to give them a chance to provide you with an updated version of the
!      Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with the
!      Modified Version filling the role of the Document, thus licensing
!      distribution and modification of the Modified Version to whoever
!      possesses a copy of it.  In addition, you must do these things in
!      the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of previous
!           versions (which should, if there were any, be listed in the
!           History section of the Document).  You may use the same title
!           as a previous version if the original publisher of that
!           version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
*************** GNU Free Documentation License
*** 5029,5059 ****
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on
!           the Title Page.  If there is no section Entitled "History" in
!           the Document, create one stating the title, year, authors,
!           and publisher of the Document as given on its Title Page,
!           then add an item describing the Modified Version as stated in
!           the previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in
!           the "History" section.  You may omit a network location for a
!           work that was published at least four years before the
!           Document itself, or if the original publisher of the version
!           it refers to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the
!           section all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document,
!           unaltered in their text and in their titles.  Section numbers
!           or the equivalent are not considered part of the section
!           titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
--- 4993,5022 ----
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on the
!           Title Page.  If there is no section Entitled "History" in the
!           Document, create one stating the title, year, authors, and
!           publisher of the Document as given on its Title Page, then add
!           an item describing the Modified Version as stated in the
!           previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in the
!           "History" section.  You may omit a network location for a work
!           that was published at least four years before the Document
!           itself, or if the original publisher of the version it refers
!           to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the section
!           all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document, unaltered
!           in their text and in their titles.  Section numbers or the
!           equivalent are not considered part of the section titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
*************** GNU Free Documentation License
*** 5066,5076 ****
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option
!      designate some or all of these sections as invariant.  To do this,
!      add their titles to the list of Invariant Sections in the Modified
!      Version's license notice.  These titles must be distinct from any
!      other section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
--- 5029,5039 ----
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option designate
!      some or all of these sections as invariant.  To do this, add their
!      titles to the list of Invariant Sections in the Modified Version's
!      license notice.  These titles must be distinct from any other
!      section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
*************** GNU Free Documentation License
*** 5079,5093 ****
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end
!      of the list of Cover Texts in the Modified Version.  Only one
!      passage of Front-Cover Text and one of Back-Cover Text may be
!      added by (or through arrangements made by) any one entity.  If the
!      Document already includes a cover text for the same cover,
!      previously added by you or by arrangement made by the same entity
!      you are acting on behalf of, you may not add another; but you may
!      replace the old one, on explicit permission from the previous
!      publisher that added the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
--- 5042,5056 ----
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end of
!      the list of Cover Texts in the Modified Version.  Only one passage
!      of Front-Cover Text and one of Back-Cover Text may be added by (or
!      through arrangements made by) any one entity.  If the Document
!      already includes a cover text for the same cover, previously added
!      by you or by arrangement made by the same entity you are acting on
!      behalf of, you may not add another; but you may replace the old
!      one, on explicit permission from the previous publisher that added
!      the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
*************** GNU Free Documentation License
*** 5097,5104 ****
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination
!      all of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
--- 5060,5067 ----
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination all
!      of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
*************** GNU Free Documentation License
*** 5125,5144 ****
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the
!      documents in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow
!      this License in all other respects regarding verbatim copying of
!      that document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of
!      a storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
--- 5088,5107 ----
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the documents
!      in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow this
!      License in all other respects regarding verbatim copying of that
!      document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of a
!      storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
*************** GNU Free Documentation License
*** 5183,5190 ****
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 5146,5153 ----
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** GNU Free Documentation License
*** 5196,5228 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, receipt of a copy of some or all of
!      the same material does not give you any rights to use it.
  
!  10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      `http://www.gnu.org/copyleft/'.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If
!      the Document does not specify a version number of this License,
!      you may choose any version ever published (not as a draft) by the
!      Free Software Foundation.  If the Document specifies that a proxy
!      can decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!  11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
--- 5159,5191 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, receipt of a copy of some or all of the
!      same material does not give you any rights to use it.
  
!   10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      <http://www.gnu.org/copyleft/>.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If the
!      Document does not specify a version number of this License, you may
!      choose any version ever published (not as a draft) by the Free
!      Software Foundation.  If the Document specifies that a proxy can
!      decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!   11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
*************** GNU Free Documentation License
*** 5252,5258 ****
       site under CC-BY-SA on the same site at any time before August 1,
       2009, provided the MMC is eligible for relicensing.
  
- 
  ADDENDUM: How to use this License for your documents
  ====================================================
  
--- 5215,5220 ----
*************** notices just after the title page:
*** 5269,5275 ****
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts." line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
--- 5231,5237 ----
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts."  line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
*************** combination of the three, merge those tw
*** 5280,5288 ****
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of
! free software license, such as the GNU General Public License, to
! permit their use in free software.
  
  
  File: cpp.info,  Node: Index of Directives,  Next: Option Index,  Prev: GNU Free Documentation License,  Up: Top
--- 5242,5250 ----
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of free
! software license, such as the GNU General Public License, to permit
! their use in free software.
  
  
  File: cpp.info,  Node: Index of Directives,  Next: Option Index,  Prev: GNU Free Documentation License,  Up: Top
*************** Index of Directives
*** 5311,5318 ****
  * #pragma GCC dependency:                Pragmas.             (line  55)
  * #pragma GCC error:                     Pragmas.             (line 100)
  * #pragma GCC poison:                    Pragmas.             (line  67)
- * #pragma GCC system_header <1>:         Pragmas.             (line  94)
  * #pragma GCC system_header:             System Headers.      (line  31)
  * #pragma GCC warning:                   Pragmas.             (line  99)
  * #sccs:                                 Other Directives.    (line   6)
  * #unassert:                             Obsolete Features.   (line  59)
--- 5273,5280 ----
  * #pragma GCC dependency:                Pragmas.             (line  55)
  * #pragma GCC error:                     Pragmas.             (line 100)
  * #pragma GCC poison:                    Pragmas.             (line  67)
  * #pragma GCC system_header:             System Headers.      (line  31)
+ * #pragma GCC system_header <1>:         Pragmas.             (line  94)
  * #pragma GCC warning:                   Pragmas.             (line  99)
  * #sccs:                                 Other Directives.    (line   6)
  * #unassert:                             Obsolete Features.   (line  59)
*************** Option Index
*** 5327,5422 ****
  ************
  
  CPP's command-line options and environment variables are indexed here
! without any initial `-' or `--'.
  
  [index]
  * Menu:
  
! * A:                                     Invocation.          (line 567)
! * ansi:                                  Invocation.          (line 308)
! * C:                                     Invocation.          (line 626)
! * C_INCLUDE_PATH:                        Environment Variables.
!                                                               (line  16)
  * CPATH:                                 Environment Variables.
                                                                (line  15)
  * CPLUS_INCLUDE_PATH:                    Environment Variables.
                                                                (line  17)
! * D:                                     Invocation.          (line  39)
! * dD:                                    Invocation.          (line 599)
  * DEPENDENCIES_OUTPUT:                   Environment Variables.
!                                                               (line  44)
! * dI:                                    Invocation.          (line 608)
! * dM:                                    Invocation.          (line 583)
! * dN:                                    Invocation.          (line 605)
! * dU:                                    Invocation.          (line 612)
! * fdebug-cpp:                            Invocation.          (line 496)
! * fdirectives-only:                      Invocation.          (line 444)
! * fdollars-in-identifiers:               Invocation.          (line 466)
  * fexec-charset:                         Invocation.          (line 524)
! * fextended-identifiers:                 Invocation.          (line 469)
  * finput-charset:                        Invocation.          (line 537)
! * fno-canonical-system-headers:          Invocation.          (line 473)
! * fno-show-column:                       Invocation.          (line 562)
  * fno-working-directory:                 Invocation.          (line 547)
! * fpreprocessed:                         Invocation.          (line 477)
! * ftabstop:                              Invocation.          (line 490)
  * ftrack-macro-expansion:                Invocation.          (line 506)
  * fwide-exec-charset:                    Invocation.          (line 529)
  * fworking-directory:                    Invocation.          (line 547)
! * H:                                     Invocation.          (line 671)
! * help:                                  Invocation.          (line 663)
! * I:                                     Invocation.          (line  71)
! * I-:                                    Invocation.          (line 357)
! * idirafter:                             Invocation.          (line 399)
! * imacros:                               Invocation.          (line 390)
! * imultilib:                             Invocation.          (line 424)
! * include:                               Invocation.          (line 379)
! * iprefix:                               Invocation.          (line 406)
! * iquote:                                Invocation.          (line 436)
! * isysroot:                              Invocation.          (line 418)
! * isystem:                               Invocation.          (line 428)
! * iwithprefix:                           Invocation.          (line 412)
! * iwithprefixbefore:                     Invocation.          (line 412)
! * M:                                     Invocation.          (line 180)
! * MD:                                    Invocation.          (line 269)
! * MF:                                    Invocation.          (line 215)
! * MG:                                    Invocation.          (line 224)
! * MM:                                    Invocation.          (line 205)
! * MMD:                                   Invocation.          (line 285)
! * MP:                                    Invocation.          (line 234)
! * MQ:                                    Invocation.          (line 260)
! * MT:                                    Invocation.          (line 246)
! * nostdinc:                              Invocation.          (line 369)
! * nostdinc++:                            Invocation.          (line 374)
! * o:                                     Invocation.          (line  82)
  * OBJC_INCLUDE_PATH:                     Environment Variables.
                                                                (line  18)
! * P:                                     Invocation.          (line 619)
! * pedantic:                              Invocation.          (line 170)
! * pedantic-errors:                       Invocation.          (line 175)
! * remap:                                 Invocation.          (line 658)
! * std=:                                  Invocation.          (line 308)
  * SUNPRO_DEPENDENCIES:                   Environment Variables.
!                                                               (line  60)
! * target-help:                           Invocation.          (line 663)
! * traditional-cpp:                       Invocation.          (line 651)
! * trigraphs:                             Invocation.          (line 655)
! * U:                                     Invocation.          (line  62)
! * undef:                                 Invocation.          (line  66)
! * v:                                     Invocation.          (line 667)
! * version:                               Invocation.          (line 680)
! * w:                                     Invocation.          (line 166)
! * Wall:                                  Invocation.          (line  88)
! * Wcomment:                              Invocation.          (line  96)
! * Wcomments:                             Invocation.          (line  96)
! * Wendif-labels:                         Invocation.          (line 143)
! * Werror:                                Invocation.          (line 156)
! * Wsystem-headers:                       Invocation.          (line 160)
! * Wtraditional:                          Invocation.          (line 113)
! * Wtrigraphs:                            Invocation.          (line 101)
! * Wundef:                                Invocation.          (line 119)
! * Wunused-macros:                        Invocation.          (line 124)
! * x:                                     Invocation.          (line 292)
  
  
  File: cpp.info,  Node: Concept Index,  Prev: Option Index,  Up: Top
--- 5289,5384 ----
  ************
  
  CPP's command-line options and environment variables are indexed here
! without any initial '-' or '--'.
  
  [index]
  * Menu:
  
! * A:                                     Invocation.          (line 566)
! * ansi:                                  Invocation.          (line 311)
! * C:                                     Invocation.          (line 624)
  * CPATH:                                 Environment Variables.
                                                                (line  15)
  * CPLUS_INCLUDE_PATH:                    Environment Variables.
                                                                (line  17)
! * C_INCLUDE_PATH:                        Environment Variables.
!                                                               (line  16)
! * D:                                     Invocation.          (line  40)
! * dD:                                    Invocation.          (line 597)
  * DEPENDENCIES_OUTPUT:                   Environment Variables.
!                                                               (line  45)
! * dI:                                    Invocation.          (line 606)
! * dM:                                    Invocation.          (line 582)
! * dN:                                    Invocation.          (line 603)
! * dU:                                    Invocation.          (line 610)
! * fdebug-cpp:                            Invocation.          (line 497)
! * fdirectives-only:                      Invocation.          (line 446)
! * fdollars-in-identifiers:               Invocation.          (line 467)
  * fexec-charset:                         Invocation.          (line 524)
! * fextended-identifiers:                 Invocation.          (line 470)
  * finput-charset:                        Invocation.          (line 537)
! * fno-canonical-system-headers:          Invocation.          (line 474)
! * fno-show-column:                       Invocation.          (line 561)
  * fno-working-directory:                 Invocation.          (line 547)
! * fpreprocessed:                         Invocation.          (line 478)
! * ftabstop:                              Invocation.          (line 491)
  * ftrack-macro-expansion:                Invocation.          (line 506)
  * fwide-exec-charset:                    Invocation.          (line 529)
  * fworking-directory:                    Invocation.          (line 547)
! * H:                                     Invocation.          (line 668)
! * help:                                  Invocation.          (line 660)
! * I:                                     Invocation.          (line  72)
! * I-:                                    Invocation.          (line 360)
! * idirafter:                             Invocation.          (line 402)
! * imacros:                               Invocation.          (line 393)
! * imultilib:                             Invocation.          (line 427)
! * include:                               Invocation.          (line 382)
! * iprefix:                               Invocation.          (line 409)
! * iquote:                                Invocation.          (line 439)
! * isysroot:                              Invocation.          (line 421)
! * isystem:                               Invocation.          (line 431)
! * iwithprefix:                           Invocation.          (line 415)
! * iwithprefixbefore:                     Invocation.          (line 415)
! * M:                                     Invocation.          (line 181)
! * MD:                                    Invocation.          (line 272)
! * MF:                                    Invocation.          (line 216)
! * MG:                                    Invocation.          (line 225)
! * MM:                                    Invocation.          (line 206)
! * MMD:                                   Invocation.          (line 288)
! * MP:                                    Invocation.          (line 235)
! * MQ:                                    Invocation.          (line 262)
! * MT:                                    Invocation.          (line 247)
! * nostdinc:                              Invocation.          (line 372)
! * nostdinc++:                            Invocation.          (line 377)
! * o:                                     Invocation.          (line  83)
  * OBJC_INCLUDE_PATH:                     Environment Variables.
                                                                (line  18)
! * P:                                     Invocation.          (line 617)
! * pedantic:                              Invocation.          (line 171)
! * pedantic-errors:                       Invocation.          (line 176)
! * remap:                                 Invocation.          (line 655)
! * std=:                                  Invocation.          (line 311)
  * SUNPRO_DEPENDENCIES:                   Environment Variables.
!                                                               (line  61)
! * target-help:                           Invocation.          (line 660)
! * traditional-cpp:                       Invocation.          (line 648)
! * trigraphs:                             Invocation.          (line 652)
! * U:                                     Invocation.          (line  63)
! * undef:                                 Invocation.          (line  67)
! * v:                                     Invocation.          (line 664)
! * version:                               Invocation.          (line 676)
! * w:                                     Invocation.          (line 167)
! * Wall:                                  Invocation.          (line  89)
! * Wcomment:                              Invocation.          (line  97)
! * Wcomments:                             Invocation.          (line  97)
! * Wendif-labels:                         Invocation.          (line 144)
! * Werror:                                Invocation.          (line 157)
! * Wsystem-headers:                       Invocation.          (line 161)
! * Wtraditional:                          Invocation.          (line 114)
! * Wtrigraphs:                            Invocation.          (line 102)
! * Wundef:                                Invocation.          (line 120)
! * Wunused-macros:                        Invocation.          (line 125)
! * x:                                     Invocation.          (line 295)
  
  
  File: cpp.info,  Node: Concept Index,  Prev: Option Index,  Up: Top
*************** Concept Index
*** 5430,5436 ****
  * # operator:                            Stringification.     (line   6)
  * ## operator:                           Concatenation.       (line   6)
  * _Pragma:                               Pragmas.             (line  25)
! * alternative tokens:                    Tokenization.        (line 105)
  * arguments:                             Macro Arguments.     (line   6)
  * arguments in macro definitions:        Macro Arguments.     (line   6)
  * assertions:                            Obsolete Features.   (line  13)
--- 5392,5398 ----
  * # operator:                            Stringification.     (line   6)
  * ## operator:                           Concatenation.       (line   6)
  * _Pragma:                               Pragmas.             (line  25)
! * alternative tokens:                    Tokenization.        (line 104)
  * arguments:                             Macro Arguments.     (line   6)
  * arguments in macro definitions:        Macro Arguments.     (line   6)
  * assertions:                            Obsolete Features.   (line  13)
*************** Concept Index
*** 5438,5444 ****
  * backslash-newline:                     Initial processing.  (line  61)
  * block comments:                        Initial processing.  (line  77)
  * C++ named operators:                   C++ Named Operators. (line   6)
! * character constants:                   Tokenization.        (line  84)
  * character set, execution:              Invocation.          (line 524)
  * character set, input:                  Invocation.          (line 537)
  * character set, wide execution:         Invocation.          (line 529)
--- 5400,5406 ----
  * backslash-newline:                     Initial processing.  (line  61)
  * block comments:                        Initial processing.  (line  77)
  * C++ named operators:                   C++ Named Operators. (line   6)
! * character constants:                   Tokenization.        (line  83)
  * character set, execution:              Invocation.          (line 524)
  * character set, input:                  Invocation.          (line 537)
  * character set, wide execution:         Invocation.          (line 529)
*************** Concept Index
*** 5455,5466 ****
  * controlling macro:                     Once-Only Headers.   (line  35)
  * defined:                               Defined.             (line   6)
  * dependencies for make as output:       Environment Variables.
!                                                               (line  45)
! * dependencies, make:                    Invocation.          (line 180)
  * diagnostic:                            Diagnostics.         (line   6)
  * differences from previous versions:    Differences from previous versions.
                                                                (line   6)
! * digraphs:                              Tokenization.        (line 105)
  * directive line:                        The preprocessing language.
                                                                (line   6)
  * directive name:                        The preprocessing language.
--- 5417,5430 ----
  * controlling macro:                     Once-Only Headers.   (line  35)
  * defined:                               Defined.             (line   6)
  * dependencies for make as output:       Environment Variables.
!                                                               (line  46)
! * dependencies for make as output <1>:   Environment Variables.
!                                                               (line  62)
! * dependencies, make:                    Invocation.          (line 181)
  * diagnostic:                            Diagnostics.         (line   6)
  * differences from previous versions:    Differences from previous versions.
                                                                (line   6)
! * digraphs:                              Tokenization.        (line 104)
  * directive line:                        The preprocessing language.
                                                                (line   6)
  * directive name:                        The preprocessing language.
*************** Concept Index
*** 5478,5485 ****
  * grouping options:                      Invocation.          (line  34)
  * guard macro:                           Once-Only Headers.   (line  35)
  * header file:                           Header Files.        (line   6)
! * header file names:                     Tokenization.        (line  84)
! * identifiers:                           Tokenization.        (line  34)
  * implementation limits:                 Implementation limits.
                                                                (line   6)
  * implementation-defined behavior:       Implementation-defined behavior.
--- 5442,5449 ----
  * grouping options:                      Invocation.          (line  34)
  * guard macro:                           Once-Only Headers.   (line  35)
  * header file:                           Header Files.        (line   6)
! * header file names:                     Tokenization.        (line  83)
! * identifiers:                           Tokenization.        (line  33)
  * implementation limits:                 Implementation limits.
                                                                (line   6)
  * implementation-defined behavior:       Implementation-defined behavior.
*************** Concept Index
*** 5497,5513 ****
  * macros in include:                     Computed Includes.   (line   6)
  * macros with arguments:                 Macro Arguments.     (line   6)
  * macros with variable arguments:        Variadic Macros.     (line   6)
! * make:                                  Invocation.          (line 180)
  * manifest constants:                    Object-like Macros.  (line   6)
  * named operators:                       C++ Named Operators. (line   6)
  * newlines in macro arguments:           Newlines in Arguments.
                                                                (line   6)
  * null directive:                        Other Directives.    (line  15)
! * numbers:                               Tokenization.        (line  60)
  * object-like macro:                     Object-like Macros.  (line   6)
! * options:                               Invocation.          (line  38)
  * options, grouping:                     Invocation.          (line  34)
! * other tokens:                          Tokenization.        (line 119)
  * output format:                         Preprocessor Output. (line  12)
  * overriding a header file:              Wrapper Headers.     (line   6)
  * parentheses in macro bodies:           Operator Precedence Problems.
--- 5461,5477 ----
  * macros in include:                     Computed Includes.   (line   6)
  * macros with arguments:                 Macro Arguments.     (line   6)
  * macros with variable arguments:        Variadic Macros.     (line   6)
! * make:                                  Invocation.          (line 181)
  * manifest constants:                    Object-like Macros.  (line   6)
  * named operators:                       C++ Named Operators. (line   6)
  * newlines in macro arguments:           Newlines in Arguments.
                                                                (line   6)
  * null directive:                        Other Directives.    (line  15)
! * numbers:                               Tokenization.        (line  59)
  * object-like macro:                     Object-like Macros.  (line   6)
! * options:                               Invocation.          (line  39)
  * options, grouping:                     Invocation.          (line  34)
! * other tokens:                          Tokenization.        (line 118)
  * output format:                         Preprocessor Output. (line  12)
  * overriding a header file:              Wrapper Headers.     (line   6)
  * parentheses in macro bodies:           Operator Precedence Problems.
*************** Concept Index
*** 5519,5529 ****
  * predicates:                            Obsolete Features.   (line  26)
  * preprocessing directives:              The preprocessing language.
                                                                (line   6)
! * preprocessing numbers:                 Tokenization.        (line  60)
  * preprocessing tokens:                  Tokenization.        (line   6)
  * prescan of macro arguments:            Argument Prescan.    (line   6)
  * problems with macros:                  Macro Pitfalls.      (line   6)
! * punctuators:                           Tokenization.        (line 105)
  * redefining macros:                     Undefining and Redefining Macros.
                                                                (line   6)
  * repeated inclusion:                    Once-Only Headers.   (line   6)
--- 5483,5493 ----
  * predicates:                            Obsolete Features.   (line  26)
  * preprocessing directives:              The preprocessing language.
                                                                (line   6)
! * preprocessing numbers:                 Tokenization.        (line  59)
  * preprocessing tokens:                  Tokenization.        (line   6)
  * prescan of macro arguments:            Argument Prescan.    (line   6)
  * problems with macros:                  Macro Pitfalls.      (line   6)
! * punctuators:                           Tokenization.        (line 104)
  * redefining macros:                     Undefining and Redefining Macros.
                                                                (line   6)
  * repeated inclusion:                    Once-Only Headers.   (line   6)
*************** Concept Index
*** 5539,5550 ****
                                                                (line   6)
  * standard predefined macros.:           Standard Predefined Macros.
                                                                (line   6)
! * string constants:                      Tokenization.        (line  84)
! * string literals:                       Tokenization.        (line  84)
  * stringification:                       Stringification.     (line   6)
  * symbolic constants:                    Object-like Macros.  (line   6)
- * system header files <1>:               System Headers.      (line   6)
  * system header files:                   Header Files.        (line  13)
  * system-specific predefined macros:     System-specific Predefined Macros.
                                                                (line   6)
  * testing predicates:                    Obsolete Features.   (line  37)
--- 5503,5514 ----
                                                                (line   6)
  * standard predefined macros.:           Standard Predefined Macros.
                                                                (line   6)
! * string constants:                      Tokenization.        (line  83)
! * string literals:                       Tokenization.        (line  83)
  * stringification:                       Stringification.     (line   6)
  * symbolic constants:                    Object-like Macros.  (line   6)
  * system header files:                   Header Files.        (line  13)
+ * system header files <1>:               System Headers.      (line   6)
  * system-specific predefined macros:     System-specific Predefined Macros.
                                                                (line   6)
  * testing predicates:                    Obsolete Features.   (line  37)
*************** Concept Index
*** 5564,5642 ****
  
  
  Tag Table:
! Node: Top996
! Node: Overview3601
! Node: Character sets6434
! Ref: Character sets-Footnote-18591
! Node: Initial processing8772
! Ref: trigraphs10331
! Node: Tokenization14533
! Ref: Tokenization-Footnote-121564
! Node: The preprocessing language21675
! Node: Header Files24553
! Node: Include Syntax26469
! Node: Include Operation28106
! Node: Search Path29954
! Node: Once-Only Headers33155
! Node: Alternatives to Wrapper #ifndef34814
! Node: Computed Includes36557
! Node: Wrapper Headers39715
! Node: System Headers42141
! Node: Macros44191
! Node: Object-like Macros45332
! Node: Function-like Macros48922
! Node: Macro Arguments50538
! Node: Stringification54683
! Node: Concatenation57889
! Node: Variadic Macros60997
! Node: Predefined Macros65784
! Node: Standard Predefined Macros66372
! Node: Common Predefined Macros72348
! Node: System-specific Predefined Macros92437
! Node: C++ Named Operators94460
! Node: Undefining and Redefining Macros95424
! Node: Directives Within Macro Arguments97528
! Node: Macro Pitfalls99076
! Node: Misnesting99609
! Node: Operator Precedence Problems100721
! Node: Swallowing the Semicolon102587
! Node: Duplication of Side Effects104610
! Node: Self-Referential Macros106793
! Node: Argument Prescan109202
! Node: Newlines in Arguments112956
! Node: Conditionals113907
! Node: Conditional Uses115737
! Node: Conditional Syntax117095
! Node: Ifdef117415
! Node: If120581
! Node: Defined122885
! Node: Else124168
! Node: Elif124738
! Node: Deleted Code126027
! Node: Diagnostics127274
! Node: Line Control128821
! Node: Pragmas132625
! Node: Other Directives137381
! Node: Preprocessor Output138431
! Node: Traditional Mode141632
! Node: Traditional lexical analysis142690
! Node: Traditional macros145193
! Node: Traditional miscellany148995
! Node: Traditional warnings149992
! Node: Implementation Details152189
! Node: Implementation-defined behavior152810
! Ref: Identifier characters153562
! Node: Implementation limits156446
! Node: Obsolete Features159120
! Node: Differences from previous versions162008
! Node: Invocation166216
! Ref: Wtrigraphs170668
! Ref: dashMF175443
! Ref: fdollars-in-identifiers185174
! Node: Environment Variables195019
! Node: GNU Free Documentation License197985
! Node: Index of Directives223149
! Node: Option Index225229
! Node: Concept Index231632
  
  End Tag Table
--- 5528,5606 ----
  
  
  Tag Table:
! Node: Top945
! Node: Overview3549
! Node: Character sets6383
! Ref: Character sets-Footnote-18538
! Node: Initial processing8719
! Ref: trigraphs10278
! Node: Tokenization14478
! Ref: Tokenization-Footnote-121507
! Node: The preprocessing language21618
! Node: Header Files24497
! Node: Include Syntax26413
! Node: Include Operation28050
! Node: Search Path29898
! Node: Once-Only Headers33099
! Node: Alternatives to Wrapper #ifndef34758
! Node: Computed Includes36500
! Node: Wrapper Headers39658
! Node: System Headers42081
! Node: Macros44131
! Node: Object-like Macros45272
! Node: Function-like Macros48862
! Node: Macro Arguments50478
! Node: Stringification54621
! Node: Concatenation57827
! Node: Variadic Macros60935
! Node: Predefined Macros65722
! Node: Standard Predefined Macros66310
! Node: Common Predefined Macros72279
! Node: System-specific Predefined Macros92352
! Node: C++ Named Operators94375
! Node: Undefining and Redefining Macros95339
! Node: Directives Within Macro Arguments97437
! Node: Macro Pitfalls98985
! Node: Misnesting99518
! Node: Operator Precedence Problems100630
! Node: Swallowing the Semicolon102496
! Node: Duplication of Side Effects104519
! Node: Self-Referential Macros106702
! Node: Argument Prescan109111
! Node: Newlines in Arguments112866
! Node: Conditionals113817
! Node: Conditional Uses115646
! Node: Conditional Syntax117004
! Node: Ifdef117324
! Node: If120481
! Node: Defined122785
! Node: Else124066
! Node: Elif124636
! Node: Deleted Code125925
! Node: Diagnostics127172
! Node: Line Control128721
! Node: Pragmas132496
! Node: Other Directives137250
! Node: Preprocessor Output138300
! Node: Traditional Mode141498
! Node: Traditional lexical analysis142556
! Node: Traditional macros145059
! Node: Traditional miscellany148860
! Node: Traditional warnings149856
! Node: Implementation Details152053
! Node: Implementation-defined behavior152674
! Ref: Identifier characters153424
! Node: Implementation limits156313
! Node: Obsolete Features158986
! Node: Differences from previous versions161873
! Node: Invocation166075
! Ref: Wtrigraphs170527
! Ref: dashMF175304
! Ref: fdollars-in-identifiers185046
! Node: Environment Variables194849
! Node: GNU Free Documentation License197815
! Node: Index of Directives222960
! Node: Option Index225040
! Node: Concept Index231443
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/gcc/doc/cppinternals.info gcc-5.5.0/gcc/doc/cppinternals.info
*** gcc-5.4.0/gcc/doc/cppinternals.info	Fri Jun  3 10:32:21 2016
--- gcc-5.5.0/gcc/doc/cppinternals.info	Tue Oct 10 09:40:20 2017
***************
*** 1,12 ****
! This is doc/cppinternals.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/doc/cppinternals.texi.
  
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * Cpplib: (cppinternals).      Cpplib internals.
  END-INFO-DIR-ENTRY
  
!    This file documents the internals of the GNU C Preprocessor.
  
     Copyright (C) 2000-2015 Free Software Foundation, Inc.
  
--- 1,12 ----
! This is cppinternals.info, produced by makeinfo version 6.1 from
! cppinternals.texi.
  
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * Cpplib: (cppinternals).      Cpplib internals.
  END-INFO-DIR-ENTRY
  
! This file documents the internals of the GNU C Preprocessor.
  
     Copyright (C) 2000-2015 Free Software Foundation, Inc.
  
*************** preserved on all copies.
*** 16,23 ****
  
     Permission is granted to copy and distribute modified versions of
  this manual under the conditions for verbatim copying, provided also
! that the entire resulting derived work is distributed under the terms
! of a permission notice identical to this one.
  
     Permission is granted to copy and distribute translations of this
  manual into another language, under the above conditions for modified
--- 16,23 ----
  
     Permission is granted to copy and distribute modified versions of
  this manual under the conditions for verbatim copying, provided also
! that the entire resulting derived work is distributed under the terms of
! a permission notice identical to this one.
  
     Permission is granted to copy and distribute translations of this
  manual into another language, under the above conditions for modified
*************** preprocessor in previous versions of GCC
*** 46,54 ****
  as the fundamental unit.
  
     This brief manual documents the internals of cpplib, and explains
! some of the tricky issues.  It is intended that, along with the
! comments in the source code, a reasonably competent C programmer should
! be able to figure out what the code is doing, and why things have been
  implemented the way they have.
  
  * Menu:
--- 46,54 ----
  as the fundamental unit.
  
     This brief manual documents the internals of cpplib, and explains
! some of the tricky issues.  It is intended that, along with the comments
! in the source code, a reasonably competent C programmer should be able
! to figure out what the code is doing, and why things have been
  implemented the way they have.
  
  * Menu:
*************** File: cppinternals.info,  Node: Conventi
*** 69,85 ****
  Conventions
  ***********
  
! cpplib has two interfaces--one is exposed internally only, and the
! other is for both internal and external use.
  
     The convention is that functions and types that are exposed to
! multiple files internally are prefixed with `_cpp_', and are to be
! found in the file `internal.h'.  Functions and types exposed to external
! clients are in `cpplib.h', and prefixed with `cpp_'.  For historical
  reasons this is no longer quite true, but we should strive to stick to
  it.
  
!    We are striving to reduce the information exposed in `cpplib.h' to
  the bare minimum necessary, and then to keep it there.  This makes clear
  exactly what external clients are entitled to assume, and allows us to
  change internals in the future without worrying whether library clients
--- 69,85 ----
  Conventions
  ***********
  
! cpplib has two interfaces--one is exposed internally only, and the other
! is for both internal and external use.
  
     The convention is that functions and types that are exposed to
! multiple files internally are prefixed with '_cpp_', and are to be found
! in the file 'internal.h'.  Functions and types exposed to external
! clients are in 'cpplib.h', and prefixed with 'cpp_'.  For historical
  reasons this is no longer quite true, but we should strive to stick to
  it.
  
!    We are striving to reduce the information exposed in 'cpplib.h' to
  the bare minimum necessary, and then to keep it there.  This makes clear
  exactly what external clients are entitled to assume, and allows us to
  change internals in the future without worrying whether library clients
*************** The Lexer
*** 95,101 ****
  Overview
  ========
  
! The lexer is contained in the file `lex.c'.  It is a hand-coded lexer,
  and not implemented as a state machine.  It can understand C, C++ and
  Objective-C source code, and has been extended to allow reasonably
  successful preprocessing of assembly language.  The lexer does not make
--- 95,101 ----
  Overview
  ========
  
! The lexer is contained in the file 'lex.c'.  It is a hand-coded lexer,
  and not implemented as a state machine.  It can understand C, C++ and
  Objective-C source code, and has been extended to allow reasonably
  successful preprocessing of assembly language.  The lexer does not make
*************** them as they are encountered in a single
*** 104,120 ****
  returns preprocessing tokens individually, not a line at a time.
  
     It is mostly transparent to users of the library, since the library's
! interface for obtaining the next token, `cpp_get_token', takes care of
  lexing new tokens, handling directives, and expanding macros as
  necessary.  However, the lexer does expose some functionality so that
  clients of the library can easily spell a given token, such as
! `cpp_spell_token' and `cpp_token_len'.  These functions are useful when
  generating diagnostics, and for emitting the preprocessed output.
  
  Lexing a token
  ==============
  
! Lexing of an individual token is handled by `_cpp_lex_direct' and its
  subroutines.  In its current form the code is quite complicated, with
  read ahead characters and such-like, since it strives to not step back
  in the character stream in preparation for handling non-ASCII file
--- 104,120 ----
  returns preprocessing tokens individually, not a line at a time.
  
     It is mostly transparent to users of the library, since the library's
! interface for obtaining the next token, 'cpp_get_token', takes care of
  lexing new tokens, handling directives, and expanding macros as
  necessary.  However, the lexer does expose some functionality so that
  clients of the library can easily spell a given token, such as
! 'cpp_spell_token' and 'cpp_token_len'.  These functions are useful when
  generating diagnostics, and for emitting the preprocessed output.
  
  Lexing a token
  ==============
  
! Lexing of an individual token is handled by '_cpp_lex_direct' and its
  subroutines.  In its current form the code is quite complicated, with
  read ahead characters and such-like, since it strives to not step back
  in the character stream in preparation for handling non-ASCII file
*************** encodings.  The current plan is to conve
*** 122,187 ****
  before processing them.  This complexity is therefore unnecessary and
  will be removed, so I'll not discuss it further here.
  
!    The job of `_cpp_lex_direct' is simply to lex a token.  It is not
  responsible for issues like directive handling, returning lookahead
  tokens directly, multiple-include optimization, or conditional block
! skipping.  It necessarily has a minor ro^le to play in memory
! management of lexed lines.  I discuss these issues in a separate section
! (*note Lexing a line::).
  
     The lexer places the token it lexes into storage pointed to by the
! variable `cur_token', and then increments it.  This variable is
  important for correct diagnostic positioning.  Unless a specific line
  and column are passed to the diagnostic routines, they will examine the
! `line' and `col' values of the token just before the location that
! `cur_token' points to, and use that location to report the diagnostic.
  
     The lexer does not consider whitespace to be a token in its own
  right.  If whitespace (other than a new line) precedes a token, it sets
! the `PREV_WHITE' bit in the token's flags.  Each token has its `line'
! and `col' variables set to the line and column of the first character
! of the token.  This line number is the line number in the translation
! unit, and can be converted to a source (file, line) pair using the line
! map code.
  
!    The first token on a logical, i.e. unescaped, line has the flag
! `BOL' set for beginning-of-line.  This flag is intended for internal
! use, both to distinguish a `#' that begins a directive from one that
! doesn't, and to generate a call-back to clients that want to be
! notified about the start of every non-directive line with tokens on it.
! Clients cannot reliably determine this for themselves: the first token
! might be a macro, and the tokens of a macro expansion do not have the
! `BOL' flag set.  The macro expansion may even be empty, and the next
! token on the line certainly won't have the `BOL' flag set.
  
     New lines are treated specially; exactly how the lexer handles them
  is context-dependent.  The C standard mandates that directives are
  terminated by the first unescaped newline character, even if it appears
  in the middle of a macro expansion.  Therefore, if the state variable
! `in_directive' is set, the lexer returns a `CPP_EOF' token, which is
! normally used to indicate end-of-file, to indicate end-of-directive.
! In a directive a `CPP_EOF' token never means end-of-file.
! Conveniently, if the caller was `collect_args', it already handles
! `CPP_EOF' as if it were end-of-file, and reports an error about an
! unterminated macro argument list.
  
     The C standard also specifies that a new line in the middle of the
  arguments to a macro is treated as whitespace.  This white space is
  important in case the macro argument is stringified.  The state variable
! `parsing_args' is nonzero when the preprocessor is collecting the
  arguments to a macro call.  It is set to 1 when looking for the opening
  parenthesis to a function-like macro, and 2 when collecting the actual
  arguments up to the closing parenthesis, since these two cases need to
  be distinguished sometimes.  One such time is here: the lexer sets the
! `PREV_WHITE' flag of a token if it meets a new line when `parsing_args'
  is set to 2.  It doesn't set it if it meets a new line when
! `parsing_args' is 1, since then code like
  
       #define foo() bar
       foo
       baz
  
! would be output with an erroneous space before `baz':
  
       foo
        baz
--- 122,187 ----
  before processing them.  This complexity is therefore unnecessary and
  will be removed, so I'll not discuss it further here.
  
!    The job of '_cpp_lex_direct' is simply to lex a token.  It is not
  responsible for issues like directive handling, returning lookahead
  tokens directly, multiple-include optimization, or conditional block
! skipping.  It necessarily has a minor ro^le to play in memory management
! of lexed lines.  I discuss these issues in a separate section (*note
! Lexing a line::).
  
     The lexer places the token it lexes into storage pointed to by the
! variable 'cur_token', and then increments it.  This variable is
  important for correct diagnostic positioning.  Unless a specific line
  and column are passed to the diagnostic routines, they will examine the
! 'line' and 'col' values of the token just before the location that
! 'cur_token' points to, and use that location to report the diagnostic.
  
     The lexer does not consider whitespace to be a token in its own
  right.  If whitespace (other than a new line) precedes a token, it sets
! the 'PREV_WHITE' bit in the token's flags.  Each token has its 'line'
! and 'col' variables set to the line and column of the first character of
! the token.  This line number is the line number in the translation unit,
! and can be converted to a source (file, line) pair using the line map
! code.
  
!    The first token on a logical, i.e. unescaped, line has the flag 'BOL'
! set for beginning-of-line.  This flag is intended for internal use, both
! to distinguish a '#' that begins a directive from one that doesn't, and
! to generate a call-back to clients that want to be notified about the
! start of every non-directive line with tokens on it.  Clients cannot
! reliably determine this for themselves: the first token might be a
! macro, and the tokens of a macro expansion do not have the 'BOL' flag
! set.  The macro expansion may even be empty, and the next token on the
! line certainly won't have the 'BOL' flag set.
  
     New lines are treated specially; exactly how the lexer handles them
  is context-dependent.  The C standard mandates that directives are
  terminated by the first unescaped newline character, even if it appears
  in the middle of a macro expansion.  Therefore, if the state variable
! 'in_directive' is set, the lexer returns a 'CPP_EOF' token, which is
! normally used to indicate end-of-file, to indicate end-of-directive.  In
! a directive a 'CPP_EOF' token never means end-of-file.  Conveniently, if
! the caller was 'collect_args', it already handles 'CPP_EOF' as if it
! were end-of-file, and reports an error about an unterminated macro
! argument list.
  
     The C standard also specifies that a new line in the middle of the
  arguments to a macro is treated as whitespace.  This white space is
  important in case the macro argument is stringified.  The state variable
! 'parsing_args' is nonzero when the preprocessor is collecting the
  arguments to a macro call.  It is set to 1 when looking for the opening
  parenthesis to a function-like macro, and 2 when collecting the actual
  arguments up to the closing parenthesis, since these two cases need to
  be distinguished sometimes.  One such time is here: the lexer sets the
! 'PREV_WHITE' flag of a token if it meets a new line when 'parsing_args'
  is set to 2.  It doesn't set it if it meets a new line when
! 'parsing_args' is 1, since then code like
  
       #define foo() bar
       foo
       baz
  
! would be output with an erroneous space before 'baz':
  
       foo
        baz
*************** would be output with an erroneous space
*** 190,277 ****
  correct in the preprocessor; there are plenty of tests in the testsuite
  for corner cases like this.
  
!    The lexer is written to treat each of `\r', `\n', `\r\n' and `\n\r'
  as a single new line indicator.  This allows it to transparently
  preprocess MS-DOS, Macintosh and Unix files without their needing to
  pass through a special filter beforehand.
  
!    We also decided to treat a backslash, either `\' or the trigraph
! `??/', separated from one of the above newline indicators by
! non-comment whitespace only, as intending to escape the newline.  It
! tends to be a typing mistake, and cannot reasonably be mistaken for
! anything else in any of the C-family grammars.  Since handling it this
! way is not strictly conforming to the ISO standard, the library issues a
! warning wherever it encounters it.
  
     Handling newlines like this is made simpler by doing it in one place
! only.  The function `handle_newline' takes care of all newline
! characters, and `skip_escaped_newlines' takes care of arbitrarily long
! sequences of escaped newlines, deferring to `handle_newline' to handle
  the newlines themselves.
  
     The most painful aspect of lexing ISO-standard C and C++ is handling
  trigraphs and backlash-escaped newlines.  Trigraphs are processed before
  any interpretation of the meaning of a character is made, and
  unfortunately there is a trigraph representation for a backslash, so it
! is possible for the trigraph `??/' to introduce an escaped newline.
  
     Escaped newlines are tedious because theoretically they can occur
! anywhere--between the `+' and `=' of the `+=' token, within the
! characters of an identifier, and even between the `*' and `/' that
  terminates a comment.  Moreover, you cannot be sure there is just
  one--there might be an arbitrarily long sequence of them.
  
!    So, for example, the routine that lexes a number, `parse_number',
  cannot assume that it can scan forwards until the first non-number
! character and be done with it, because this could be the `\'
! introducing an escaped newline, or the `?' introducing the trigraph
! sequence that represents the `\' of an escaped newline.  If it
! encounters a `?' or `\', it calls `skip_escaped_newlines' to skip over
! any potential escaped newlines before checking whether the number has
! been finished.
  
!    Similarly code in the main body of `_cpp_lex_direct' cannot simply
! check for a `=' after a `+' character to determine whether it has a
! `+=' token; it needs to be prepared for an escaped newline of some
! sort.  Such cases use the function `get_effective_char', which returns
! the first character after any intervening escaped newlines.
  
     The lexer needs to keep track of the correct column position,
! including counting tabs as specified by the `-ftabstop=' option.  This
  should be done even within C-style comments; they can appear in the
  middle of a line, and we want to report diagnostics in the correct
  position for text appearing after the end of the comment.
  
!    Some identifiers, such as `__VA_ARGS__' and poisoned identifiers,
! may be invalid and require a diagnostic.  However, if they appear in a
! macro expansion we don't want to complain with each use of the macro.
! It is therefore best to catch them during the lexing stage, in
! `parse_identifier'.  In both cases, whether a diagnostic is needed or
  not is dependent upon the lexer's state.  For example, we don't want to
  issue a diagnostic for re-poisoning a poisoned identifier, or for using
! `__VA_ARGS__' in the expansion of a variable-argument macro.  Therefore
! `parse_identifier' makes use of state flags to determine whether a
  diagnostic is appropriate.  Since we change state on a per-token basis,
  and don't lex whole lines at a time, this is not a problem.
  
     Another place where state flags are used to change behavior is whilst
! lexing header names.  Normally, a `<' would be lexed as a single token.
! After a `#include' directive, though, it should be lexed as a single
! token as far as the nearest `>' character.  Note that we don't allow
! the terminators of header names to be escaped; the first `"' or `>'
  terminates the header name.
  
     Interpretation of some character sequences depends upon whether we
  are lexing C, C++ or Objective-C, and on the revision of the standard in
! force.  For example, `::' is a single token in C++, but in C it is two
! separate `:' tokens and almost certainly a syntax error.  Such cases
! are handled by `_cpp_lex_direct' based upon command-line flags stored
! in the `cpp_options' structure.
  
     Once a token has been lexed, it leads an independent existence.  The
  spelling of numbers, identifiers and strings is copied to permanent
  storage from the original input buffer, so a token remains valid and
! correct even if its source buffer is freed with `_cpp_pop_buffer'.  The
  storage holding the spellings of such tokens remains until the client
  program calls cpp_destroy, probably at the end of the translation unit.
  
--- 190,276 ----
  correct in the preprocessor; there are plenty of tests in the testsuite
  for corner cases like this.
  
!    The lexer is written to treat each of '\r', '\n', '\r\n' and '\n\r'
  as a single new line indicator.  This allows it to transparently
  preprocess MS-DOS, Macintosh and Unix files without their needing to
  pass through a special filter beforehand.
  
!    We also decided to treat a backslash, either '\' or the trigraph
! '??/', separated from one of the above newline indicators by non-comment
! whitespace only, as intending to escape the newline.  It tends to be a
! typing mistake, and cannot reasonably be mistaken for anything else in
! any of the C-family grammars.  Since handling it this way is not
! strictly conforming to the ISO standard, the library issues a warning
! wherever it encounters it.
  
     Handling newlines like this is made simpler by doing it in one place
! only.  The function 'handle_newline' takes care of all newline
! characters, and 'skip_escaped_newlines' takes care of arbitrarily long
! sequences of escaped newlines, deferring to 'handle_newline' to handle
  the newlines themselves.
  
     The most painful aspect of lexing ISO-standard C and C++ is handling
  trigraphs and backlash-escaped newlines.  Trigraphs are processed before
  any interpretation of the meaning of a character is made, and
  unfortunately there is a trigraph representation for a backslash, so it
! is possible for the trigraph '??/' to introduce an escaped newline.
  
     Escaped newlines are tedious because theoretically they can occur
! anywhere--between the '+' and '=' of the '+=' token, within the
! characters of an identifier, and even between the '*' and '/' that
  terminates a comment.  Moreover, you cannot be sure there is just
  one--there might be an arbitrarily long sequence of them.
  
!    So, for example, the routine that lexes a number, 'parse_number',
  cannot assume that it can scan forwards until the first non-number
! character and be done with it, because this could be the '\' introducing
! an escaped newline, or the '?' introducing the trigraph sequence that
! represents the '\' of an escaped newline.  If it encounters a '?' or
! '\', it calls 'skip_escaped_newlines' to skip over any potential escaped
! newlines before checking whether the number has been finished.
  
!    Similarly code in the main body of '_cpp_lex_direct' cannot simply
! check for a '=' after a '+' character to determine whether it has a '+='
! token; it needs to be prepared for an escaped newline of some sort.
! Such cases use the function 'get_effective_char', which returns the
! first character after any intervening escaped newlines.
  
     The lexer needs to keep track of the correct column position,
! including counting tabs as specified by the '-ftabstop=' option.  This
  should be done even within C-style comments; they can appear in the
  middle of a line, and we want to report diagnostics in the correct
  position for text appearing after the end of the comment.
  
!    Some identifiers, such as '__VA_ARGS__' and poisoned identifiers, may
! be invalid and require a diagnostic.  However, if they appear in a macro
! expansion we don't want to complain with each use of the macro.  It is
! therefore best to catch them during the lexing stage, in
! 'parse_identifier'.  In both cases, whether a diagnostic is needed or
  not is dependent upon the lexer's state.  For example, we don't want to
  issue a diagnostic for re-poisoning a poisoned identifier, or for using
! '__VA_ARGS__' in the expansion of a variable-argument macro.  Therefore
! 'parse_identifier' makes use of state flags to determine whether a
  diagnostic is appropriate.  Since we change state on a per-token basis,
  and don't lex whole lines at a time, this is not a problem.
  
     Another place where state flags are used to change behavior is whilst
! lexing header names.  Normally, a '<' would be lexed as a single token.
! After a '#include' directive, though, it should be lexed as a single
! token as far as the nearest '>' character.  Note that we don't allow the
! terminators of header names to be escaped; the first '"' or '>'
  terminates the header name.
  
     Interpretation of some character sequences depends upon whether we
  are lexing C, C++ or Objective-C, and on the revision of the standard in
! force.  For example, '::' is a single token in C++, but in C it is two
! separate ':' tokens and almost certainly a syntax error.  Such cases are
! handled by '_cpp_lex_direct' based upon command-line flags stored in the
! 'cpp_options' structure.
  
     Once a token has been lexed, it leads an independent existence.  The
  spelling of numbers, identifiers and strings is copied to permanent
  storage from the original input buffer, so a token remains valid and
! correct even if its source buffer is freed with '_cpp_pop_buffer'.  The
  storage holding the spellings of such tokens remains until the client
  program calls cpp_destroy, probably at the end of the translation unit.
  
*************** to cpplib itself internally.
*** 288,296 ****
  token stream.  For example, after the name of a function-like macro, it
  wants to check the next token to see if it is an opening parenthesis.
  Another example is that, after reading the first few tokens of a
! `#pragma' directive and not recognizing it as a registered pragma, it
  wants to backtrack and allow the user-defined handler for unknown
! pragmas to access the full `#pragma' token stream.  The stand-alone
  preprocessor wants to be able to test the current token with the
  previous one to see if a space needs to be inserted to preserve their
  separate tokenization upon re-lexing (paste avoidance), so it needs to
--- 287,295 ----
  token stream.  For example, after the name of a function-like macro, it
  wants to check the next token to see if it is an opening parenthesis.
  Another example is that, after reading the first few tokens of a
! '#pragma' directive and not recognizing it as a registered pragma, it
  wants to backtrack and allow the user-defined handler for unknown
! pragmas to access the full '#pragma' token stream.  The stand-alone
  preprocessor wants to be able to test the current token with the
  previous one to see if a space needs to be inserted to preserve their
  separate tokenization upon re-lexing (paste avoidance), so it needs to
*************** to jump back to a prior position in that
*** 303,310 ****
  preprocessor lex all tokens on a line consecutively into a token buffer,
  which I call a "token run", and when meeting an unescaped new line
  (newlines within comments do not count either), to start lexing back at
! the beginning of the run.  Note that we do _not_ lex a line of tokens
! at once; if we did that `parse_identifier' would not have state flags
  available to warn about invalid identifiers (*note Invalid
  identifiers::).
  
--- 302,309 ----
  preprocessor lex all tokens on a line consecutively into a token buffer,
  which I call a "token run", and when meeting an unescaped new line
  (newlines within comments do not count either), to start lexing back at
! the beginning of the run.  Note that we do _not_ lex a line of tokens at
! once; if we did that 'parse_identifier' would not have state flags
  available to warn about invalid identifiers (*note Invalid
  identifiers::).
  
*************** identifiers::).
*** 312,336 ****
  line is valid, but since each logical line overwrites the tokens of the
  previous line, tokens from prior lines are unavailable.  In particular,
  since a directive only occupies a single logical line, this means that
! the directive handlers like the `#pragma' handler can jump around in
! the directive's tokens if necessary.
  
     Two issues remain: what about tokens that arise from macro
! expansions, and what happens when we have a long line that overflows
! the token run?
  
     Since we promise clients that we preserve the validity of pointers
  that we have already returned for tokens that appeared earlier in the
! line, we cannot reallocate the run.  Instead, on overflow it is
! expanded by chaining a new token run on to the end of the existing one.
  
     The tokens forming a macro's replacement list are collected by the
! `#define' handler, and placed in storage that is only freed by
! `cpp_destroy'.  So if a macro is expanded in the line of tokens, the
  pointers to the tokens of its expansion that are returned will always
  remain valid.  However, macros are a little trickier than that, since
  they give rise to three sources of fresh tokens.  They are the built-in
! macros like `__LINE__', and the `#' and `##' operators for
  stringification and token pasting.  I handled this by allocating space
  for these tokens from the lexer's token run chain.  This means they
  automatically receive the same lifetime guarantees as lexed tokens, and
--- 311,335 ----
  line is valid, but since each logical line overwrites the tokens of the
  previous line, tokens from prior lines are unavailable.  In particular,
  since a directive only occupies a single logical line, this means that
! the directive handlers like the '#pragma' handler can jump around in the
! directive's tokens if necessary.
  
     Two issues remain: what about tokens that arise from macro
! expansions, and what happens when we have a long line that overflows the
! token run?
  
     Since we promise clients that we preserve the validity of pointers
  that we have already returned for tokens that appeared earlier in the
! line, we cannot reallocate the run.  Instead, on overflow it is expanded
! by chaining a new token run on to the end of the existing one.
  
     The tokens forming a macro's replacement list are collected by the
! '#define' handler, and placed in storage that is only freed by
! 'cpp_destroy'.  So if a macro is expanded in the line of tokens, the
  pointers to the tokens of its expansion that are returned will always
  remain valid.  However, macros are a little trickier than that, since
  they give rise to three sources of fresh tokens.  They are the built-in
! macros like '__LINE__', and the '#' and '##' operators for
  stringification and token pasting.  I handled this by allocating space
  for these tokens from the lexer's token run chain.  This means they
  automatically receive the same lifetime guarantees as lexed tokens, and
*************** management issues, but not all.  The ope
*** 341,360 ****
  function-like macro name might lie on a different line, and the front
  ends definitely want the ability to look ahead past the end of the
  current line.  So cpplib only moves back to the start of the token run
! at the end of a line if the variable `keep_tokens' is zero.
  Line-buffering is quite natural for the preprocessor, and as a result
  the only time cpplib needs to increment this variable is whilst looking
  for the opening parenthesis to, and reading the arguments of, a
! function-like macro.  In the near future cpplib will export an
! interface to increment and decrement this variable, so that clients can
! share full control over the lifetime of token pointers too.
  
!    The routine `_cpp_lex_token' handles moving to new token runs,
! calling `_cpp_lex_direct' to lex new tokens, or returning
  previously-lexed tokens if we stepped back in the token stream.  It also
! checks each token for the `BOL' flag, which might indicate a directive
  that needs to be handled, or require a start-of-line call-back to be
! made.  `_cpp_lex_token' also handles skipping over tokens in failed
  conditional blocks, and invalidates the control macro of the
  multiple-include optimization if a token was successfully lexed outside
  a directive.  In other words, its callers do not need to concern
--- 340,359 ----
  function-like macro name might lie on a different line, and the front
  ends definitely want the ability to look ahead past the end of the
  current line.  So cpplib only moves back to the start of the token run
! at the end of a line if the variable 'keep_tokens' is zero.
  Line-buffering is quite natural for the preprocessor, and as a result
  the only time cpplib needs to increment this variable is whilst looking
  for the opening parenthesis to, and reading the arguments of, a
! function-like macro.  In the near future cpplib will export an interface
! to increment and decrement this variable, so that clients can share full
! control over the lifetime of token pointers too.
  
!    The routine '_cpp_lex_token' handles moving to new token runs,
! calling '_cpp_lex_direct' to lex new tokens, or returning
  previously-lexed tokens if we stepped back in the token stream.  It also
! checks each token for the 'BOL' flag, which might indicate a directive
  that needs to be handled, or require a start-of-line call-back to be
! made.  '_cpp_lex_token' also handles skipping over tokens in failed
  conditional blocks, and invalidates the control macro of the
  multiple-include optimization if a token was successfully lexed outside
  a directive.  In other words, its callers do not need to concern
*************** Hash Nodes
*** 368,377 ****
  
  When cpplib encounters an "identifier", it generates a hash code for it
  and stores it in the hash table.  By "identifier" we mean tokens with
! type `CPP_NAME'; this includes identifiers in the usual C sense, as
! well as keywords, directive names, macro names and so on.  For example,
! all of `pragma', `int', `foo' and `__GNUC__' are identifiers and hashed
! when lexed.
  
     Each node in the hash table contain various information about the
  identifier it represents.  For example, its length and type.  At any one
--- 367,376 ----
  
  When cpplib encounters an "identifier", it generates a hash code for it
  and stores it in the hash table.  By "identifier" we mean tokens with
! type 'CPP_NAME'; this includes identifiers in the usual C sense, as well
! as keywords, directive names, macro names and so on.  For example, all
! of 'pragma', 'int', 'foo' and '__GNUC__' are identifiers and hashed when
! lexed.
  
     Each node in the hash table contain various information about the
  identifier it represents.  For example, its length and type.  At any one
*************** time, each identifier falls into exactly
*** 380,425 ****
     * Macros
  
       These have been declared to be macros, either on the command line
!      or with `#define'.  A few, such as `__TIME__' are built-ins
!      entered in the hash table during initialization.  The hash node
!      for a normal macro points to a structure with more information
!      about the macro, such as whether it is function-like, how many
!      arguments it takes, and its expansion.  Built-in macros are
!      flagged as special, and instead contain an enum indicating which
!      of the various built-in macros it is.
  
     * Assertions
  
!      Assertions are in a separate namespace to macros.  To enforce
!      this, cpp actually prepends a `#' character before hashing and
!      entering it in the hash table.  An assertion's node points to a
!      chain of answers to that assertion.
  
     * Void
  
       Everything else falls into this category--an identifier that is not
       currently a macro, or a macro that has since been undefined with
!      `#undef'.
  
       When preprocessing C++, this category also includes the named
!      operators, such as `xor'.  In expressions these behave like the
       operators they represent, but in contexts where the spelling of a
       token matters they are spelt differently.  This spelling
       distinction is relevant when they are operands of the stringizing
!      and pasting macro operators `#' and `##'.  Named operator hash
       nodes are flagged, both to catch the spelling distinction and to
       prevent them from being defined as macros.
  
     The same identifiers share the same hash node.  Since each identifier
  token, after lexing, contains a pointer to its hash node, this is used
  to provide rapid lookup of various information.  For example, when
! parsing a `#define' statement, CPP flags each argument's identifier
! hash node with the index of that argument.  This makes duplicated
! argument checking an O(1) operation for each argument.  Similarly, for
! each identifier in the macro's expansion, lookup to see if it is an
! argument, and which argument it is, is also an O(1) operation.  Further,
! each directive name, such as `endif', has an associated directive enum
! stored in its hash node, so that directive lookup is also O(1).
  
  
  File: cppinternals.info,  Node: Macro Expansion,  Next: Token Spacing,  Prev: Hash Nodes,  Up: Top
--- 379,424 ----
     * Macros
  
       These have been declared to be macros, either on the command line
!      or with '#define'.  A few, such as '__TIME__' are built-ins entered
!      in the hash table during initialization.  The hash node for a
!      normal macro points to a structure with more information about the
!      macro, such as whether it is function-like, how many arguments it
!      takes, and its expansion.  Built-in macros are flagged as special,
!      and instead contain an enum indicating which of the various
!      built-in macros it is.
  
     * Assertions
  
!      Assertions are in a separate namespace to macros.  To enforce this,
!      cpp actually prepends a '#' character before hashing and entering
!      it in the hash table.  An assertion's node points to a chain of
!      answers to that assertion.
  
     * Void
  
       Everything else falls into this category--an identifier that is not
       currently a macro, or a macro that has since been undefined with
!      '#undef'.
  
       When preprocessing C++, this category also includes the named
!      operators, such as 'xor'.  In expressions these behave like the
       operators they represent, but in contexts where the spelling of a
       token matters they are spelt differently.  This spelling
       distinction is relevant when they are operands of the stringizing
!      and pasting macro operators '#' and '##'.  Named operator hash
       nodes are flagged, both to catch the spelling distinction and to
       prevent them from being defined as macros.
  
     The same identifiers share the same hash node.  Since each identifier
  token, after lexing, contains a pointer to its hash node, this is used
  to provide rapid lookup of various information.  For example, when
! parsing a '#define' statement, CPP flags each argument's identifier hash
! node with the index of that argument.  This makes duplicated argument
! checking an O(1) operation for each argument.  Similarly, for each
! identifier in the macro's expansion, lookup to see if it is an argument,
! and which argument it is, is also an O(1) operation.  Further, each
! directive name, such as 'endif', has an associated directive enum stored
! in its hash node, so that directive lookup is also O(1).
  
  
  File: cppinternals.info,  Node: Macro Expansion,  Next: Token Spacing,  Prev: Hash Nodes,  Up: Top
*************** and situations that render what you thou
*** 432,460 ****
  the preprocessor's expansion algorithm wrong in quite subtle ways.
  
     I strongly recommend you have a good grasp of how the C and C++
! standards require macros to be expanded before diving into this
! section, let alone the code!.  If you don't have a clear mental picture
! of how things like nested macro expansion, stringification and token
! pasting are supposed to work, damage to your sanity can quickly result.
  
  Internal representation of macros
  =================================
  
  The preprocessor stores macro expansions in tokenized form.  This saves
! repeated lexing passes during expansion, at the cost of a small
! increase in memory consumption on average.  The tokens are stored
! contiguously in memory, so a pointer to the first one and a token count
! is all you need to get the replacement list of a macro.
  
     If the macro is a function-like macro the preprocessor also stores
  its parameters, in the form of an ordered list of pointers to the hash
  table entry of each parameter's identifier.  Further, in the macro's
  stored expansion each occurrence of a parameter is replaced with a
! special token of type `CPP_MACRO_ARG'.  Each such token holds the index
! of the parameter it represents in the parameter list, which allows
! rapid replacement of parameters with their arguments during expansion.
  Despite this optimization it is still necessary to store the original
! parameters to the macro, both for dumping with e.g., `-dD', and to warn
  about non-trivial macro redefinitions when the parameter names have
  changed.
  
--- 431,459 ----
  the preprocessor's expansion algorithm wrong in quite subtle ways.
  
     I strongly recommend you have a good grasp of how the C and C++
! standards require macros to be expanded before diving into this section,
! let alone the code!.  If you don't have a clear mental picture of how
! things like nested macro expansion, stringification and token pasting
! are supposed to work, damage to your sanity can quickly result.
  
  Internal representation of macros
  =================================
  
  The preprocessor stores macro expansions in tokenized form.  This saves
! repeated lexing passes during expansion, at the cost of a small increase
! in memory consumption on average.  The tokens are stored contiguously in
! memory, so a pointer to the first one and a token count is all you need
! to get the replacement list of a macro.
  
     If the macro is a function-like macro the preprocessor also stores
  its parameters, in the form of an ordered list of pointers to the hash
  table entry of each parameter's identifier.  Further, in the macro's
  stored expansion each occurrence of a parameter is replaced with a
! special token of type 'CPP_MACRO_ARG'.  Each such token holds the index
! of the parameter it represents in the parameter list, which allows rapid
! replacement of parameters with their arguments during expansion.
  Despite this optimization it is still necessary to store the original
! parameters to the macro, both for dumping with e.g., '-dD', and to warn
  about non-trivial macro redefinitions when the parameter names have
  changed.
  
*************** Macro expansion overview
*** 462,517 ****
  ========================
  
  The preprocessor maintains a "context stack", implemented as a linked
! list of `cpp_context' structures, which together represent the macro
! expansion state at any one time.  The `struct cpp_reader' member
! variable `context' points to the current top of this stack.  The top
  normally holds the unexpanded replacement list of the innermost macro
  under expansion, except when cpplib is about to pre-expand an argument,
  in which case it holds that argument's unexpanded tokens.
  
     When there are no macros under expansion, cpplib is in "base
! context".  All contexts other than the base context contain a
! contiguous list of tokens delimited by a starting and ending token.
! When not in base context, cpplib obtains the next token from the list
! of the top context.  If there are no tokens left in the list, it pops
! that context off the stack, and subsequent ones if necessary, until an
! unexhausted context is found or it returns to base context.  In base
! context, cpplib reads tokens directly from the lexer.
  
     If it encounters an identifier that is both a macro and enabled for
  expansion, cpplib prepares to push a new context for that macro on the
! stack by calling the routine `enter_macro_context'.  When this routine
  returns, the new context will contain the unexpanded tokens of the
  replacement list of that macro.  In the case of function-like macros,
! `enter_macro_context' also replaces any parameters in the replacement
! list, stored as `CPP_MACRO_ARG' tokens, with the appropriate macro
  argument.  If the standard requires that the parameter be replaced with
  its expanded argument, the argument will have been fully macro expanded
  first.
  
!    `enter_macro_context' also handles special macros like `__LINE__'.
  Although these macros expand to a single token which cannot contain any
! further macros, for reasons of token spacing (*note Token Spacing::)
! and simplicity of implementation, cpplib handles these special macros
! by pushing a context containing just that one token.
  
!    The final thing that `enter_macro_context' does before returning is
! to mark the macro disabled for expansion (except for special macros
! like `__TIME__').  The macro is re-enabled when its context is later
! popped from the context stack, as described above.  This strict
! ordering ensures that a macro is disabled whilst its expansion is being
! scanned, but that it is _not_ disabled whilst any arguments to it are
! being expanded.
  
  Scanning the replacement list for macros to expand
  ==================================================
  
! The C standard states that, after any parameters have been replaced
! with their possibly-expanded arguments, the replacement list is scanned
! for nested macros.  Further, any identifiers in the replacement list
! that are not expanded during this scan are never again eligible for
! expansion in the future, if the reason they were not expanded is that
! the macro in question was disabled.
  
     Clearly this latter condition can only apply to tokens resulting from
  argument pre-expansion.  Other tokens never have an opportunity to be
--- 461,516 ----
  ========================
  
  The preprocessor maintains a "context stack", implemented as a linked
! list of 'cpp_context' structures, which together represent the macro
! expansion state at any one time.  The 'struct cpp_reader' member
! variable 'context' points to the current top of this stack.  The top
  normally holds the unexpanded replacement list of the innermost macro
  under expansion, except when cpplib is about to pre-expand an argument,
  in which case it holds that argument's unexpanded tokens.
  
     When there are no macros under expansion, cpplib is in "base
! context".  All contexts other than the base context contain a contiguous
! list of tokens delimited by a starting and ending token.  When not in
! base context, cpplib obtains the next token from the list of the top
! context.  If there are no tokens left in the list, it pops that context
! off the stack, and subsequent ones if necessary, until an unexhausted
! context is found or it returns to base context.  In base context, cpplib
! reads tokens directly from the lexer.
  
     If it encounters an identifier that is both a macro and enabled for
  expansion, cpplib prepares to push a new context for that macro on the
! stack by calling the routine 'enter_macro_context'.  When this routine
  returns, the new context will contain the unexpanded tokens of the
  replacement list of that macro.  In the case of function-like macros,
! 'enter_macro_context' also replaces any parameters in the replacement
! list, stored as 'CPP_MACRO_ARG' tokens, with the appropriate macro
  argument.  If the standard requires that the parameter be replaced with
  its expanded argument, the argument will have been fully macro expanded
  first.
  
!    'enter_macro_context' also handles special macros like '__LINE__'.
  Although these macros expand to a single token which cannot contain any
! further macros, for reasons of token spacing (*note Token Spacing::) and
! simplicity of implementation, cpplib handles these special macros by
! pushing a context containing just that one token.
  
!    The final thing that 'enter_macro_context' does before returning is
! to mark the macro disabled for expansion (except for special macros like
! '__TIME__').  The macro is re-enabled when its context is later popped
! from the context stack, as described above.  This strict ordering
! ensures that a macro is disabled whilst its expansion is being scanned,
! but that it is _not_ disabled whilst any arguments to it are being
! expanded.
  
  Scanning the replacement list for macros to expand
  ==================================================
  
! The C standard states that, after any parameters have been replaced with
! their possibly-expanded arguments, the replacement list is scanned for
! nested macros.  Further, any identifiers in the replacement list that
! are not expanded during this scan are never again eligible for expansion
! in the future, if the reason they were not expanded is that the macro in
! question was disabled.
  
     Clearly this latter condition can only apply to tokens resulting from
  argument pre-expansion.  Other tokens never have an opportunity to be
*************** looking for the _next_ token do we pop i
*** 530,556 ****
  lower context.  This makes backing up by one token easy, but more
  importantly ensures that the macro corresponding to the current context
  is still disabled when we are considering the last token of its
! replacement list for expansion (or indeed expanding it).  As an
! example, which illustrates many of the points above, consider
  
       #define foo(x) bar x
       foo(foo) (2)
  
! which fully expands to `bar foo (2)'.  During pre-expansion of the
! argument, `foo' does not expand even though the macro is enabled, since
  it has no following parenthesis [pre-expansion of an argument only uses
  tokens from that argument; it cannot take tokens from whatever follows
! the macro invocation].  This still leaves the argument token `foo'
  eligible for future expansion.  Then, when re-scanning after argument
! replacement, the token `foo' is rejected for expansion, and marked
! ineligible for future expansion, since the macro is now disabled.  It
! is disabled because the replacement list `bar foo' of the macro is
! still on the context stack.
  
     If instead the algorithm looked for an opening parenthesis first and
  then tested whether the macro were disabled it would be subtly wrong.
! In the example above, the replacement list of `foo' would be popped in
! the process of finding the parenthesis, re-enabling `foo' and expanding
  it a second time.
  
  Looking for a function-like macro's opening parenthesis
--- 529,555 ----
  lower context.  This makes backing up by one token easy, but more
  importantly ensures that the macro corresponding to the current context
  is still disabled when we are considering the last token of its
! replacement list for expansion (or indeed expanding it).  As an example,
! which illustrates many of the points above, consider
  
       #define foo(x) bar x
       foo(foo) (2)
  
! which fully expands to 'bar foo (2)'.  During pre-expansion of the
! argument, 'foo' does not expand even though the macro is enabled, since
  it has no following parenthesis [pre-expansion of an argument only uses
  tokens from that argument; it cannot take tokens from whatever follows
! the macro invocation].  This still leaves the argument token 'foo'
  eligible for future expansion.  Then, when re-scanning after argument
! replacement, the token 'foo' is rejected for expansion, and marked
! ineligible for future expansion, since the macro is now disabled.  It is
! disabled because the replacement list 'bar foo' of the macro is still on
! the context stack.
  
     If instead the algorithm looked for an opening parenthesis first and
  then tested whether the macro were disabled it would be subtly wrong.
! In the example above, the replacement list of 'foo' would be popped in
! the process of finding the parenthesis, re-enabling 'foo' and expanding
  it a second time.
  
  Looking for a function-like macro's opening parenthesis
*************** Function-like macros only expand when im
*** 560,577 ****
  parenthesis.  To do this cpplib needs to temporarily disable macros and
  read the next token.  Unfortunately, because of spacing issues (*note
  Token Spacing::), there can be fake padding tokens in-between, and if
! the next real token is not a parenthesis cpplib needs to be able to
! back up that one token as well as retain the information in any
! intervening padding tokens.
  
     Backing up more than one token when macros are involved is not
  permitted by cpplib, because in general it might involve issues like
  restoring popped contexts onto the context stack, which are too hard.
! Instead, searching for the parenthesis is handled by a special
! function, `funlike_invocation_p', which remembers padding information
! as it reads tokens.  If the next real token is not an opening
! parenthesis, it backs up that one token, and then pushes an extra
! context just containing the padding information if necessary.
  
  Marking tokens ineligible for future expansion
  ==============================================
--- 559,576 ----
  parenthesis.  To do this cpplib needs to temporarily disable macros and
  read the next token.  Unfortunately, because of spacing issues (*note
  Token Spacing::), there can be fake padding tokens in-between, and if
! the next real token is not a parenthesis cpplib needs to be able to back
! up that one token as well as retain the information in any intervening
! padding tokens.
  
     Backing up more than one token when macros are involved is not
  permitted by cpplib, because in general it might involve issues like
  restoring popped contexts onto the context stack, which are too hard.
! Instead, searching for the parenthesis is handled by a special function,
! 'funlike_invocation_p', which remembers padding information as it reads
! tokens.  If the next real token is not an opening parenthesis, it backs
! up that one token, and then pushes an extra context just containing the
! padding information if necessary.
  
  Marking tokens ineligible for future expansion
  ==============================================
*************** Marking tokens ineligible for future exp
*** 579,590 ****
  As discussed above, cpplib needs a way of marking tokens as
  unexpandable.  Since the tokens cpplib handles are read-only once they
  have been lexed, it instead makes a copy of the token and adds the flag
! `NO_EXPAND' to the copy.
  
     For efficiency and to simplify memory management by avoiding having
  to remember to free these tokens, they are allocated as temporary tokens
  from the lexer's current token run (*note Lexing a line::) using the
! function `_cpp_temp_token'.  The tokens are then re-used once the
  current line of tokens has been read in.
  
     This might sound unsafe.  However, tokens runs are not re-used at the
--- 578,589 ----
  As discussed above, cpplib needs a way of marking tokens as
  unexpandable.  Since the tokens cpplib handles are read-only once they
  have been lexed, it instead makes a copy of the token and adds the flag
! 'NO_EXPAND' to the copy.
  
     For efficiency and to simplify memory management by avoiding having
  to remember to free these tokens, they are allocated as temporary tokens
  from the lexer's current token run (*note Lexing a line::) using the
! function '_cpp_temp_token'.  The tokens are then re-used once the
  current line of tokens has been read in.
  
     This might sound unsafe.  However, tokens runs are not re-used at the
*************** both for aesthetic reasons and because i
*** 619,638 ****
  still try to abuse the preprocessor for things like Fortran source and
  Makefiles.
  
!    For now, just notice that when tokens are added (or removed, as
! shown by the `EMPTY' example) from the original lexed token stream, we
! need to check for accidental token pasting.  We call this "paste
! avoidance".  Token addition and removal can only occur because of macro
! expansion, but accidental pasting can occur in many places: both before
! and after each macro replacement, each argument replacement, and
! additionally each token created by the `#' and `##' operators.
  
!    Look at how the preprocessor gets whitespace output correct
! normally.  The `cpp_token' structure contains a flags byte, and one of
! those flags is `PREV_WHITE'.  This is flagged by the lexer, and
! indicates that the token was preceded by whitespace of some form other
! than a new line.  The stand-alone preprocessor can use this flag to
! decide whether to insert a space between tokens in the output.
  
     Now consider the result of the following macro expansion:
  
--- 618,637 ----
  still try to abuse the preprocessor for things like Fortran source and
  Makefiles.
  
!    For now, just notice that when tokens are added (or removed, as shown
! by the 'EMPTY' example) from the original lexed token stream, we need to
! check for accidental token pasting.  We call this "paste avoidance".
! Token addition and removal can only occur because of macro expansion,
! but accidental pasting can occur in many places: both before and after
! each macro replacement, each argument replacement, and additionally each
! token created by the '#' and '##' operators.
  
!    Look at how the preprocessor gets whitespace output correct normally.
! The 'cpp_token' structure contains a flags byte, and one of those flags
! is 'PREV_WHITE'.  This is flagged by the lexer, and indicates that the
! token was preceded by whitespace of some form other than a new line.
! The stand-alone preprocessor can use this flag to decide whether to
! insert a space between tokens in the output.
  
     Now consider the result of the following macro expansion:
  
*************** decide whether to insert a space between
*** 640,679 ****
       sum = add (1,2, 3);
               ==> sum = 1 + 2 +3;
  
!    The interesting thing here is that the tokens `1' and `2' are output
! with a preceding space, and `3' is output without a preceding space,
! but when lexed none of these tokens had that property.  Careful
! consideration reveals that `1' gets its preceding whitespace from the
! space preceding `add' in the macro invocation, _not_ replacement list.
! `2' gets its whitespace from the space preceding the parameter `y' in
! the macro replacement list, and `3' has no preceding space because
! parameter `z' has none in the replacement list.
  
     Once lexed, tokens are effectively fixed and cannot be altered, since
  pointers to them might be held in many places, in particular by
  in-progress macro expansions.  So instead of modifying the two tokens
! above, the preprocessor inserts a special token, which I call a
! "padding token", into the token stream to indicate that spacing of the
! subsequent token is special.  The preprocessor inserts padding tokens
! in front of every macro expansion and expanded macro argument.  These
! point to a "source token" from which the subsequent real token should
! inherit its spacing.  In the above example, the source tokens are `add'
! in the macro invocation, and `y' and `z' in the macro replacement list,
! respectively.
  
!    It is quite easy to get multiple padding tokens in a row, for
! example if a macro's first replacement token expands straight into
! another macro.
  
       #define foo bar
       #define bar baz
       [foo]
               ==> [baz]
  
!    Here, two padding tokens are generated with sources the `foo' token
! between the brackets, and the `bar' token from foo's replacement list,
! respectively.  Clearly the first padding token is the one to use, so
! the output code should contain a rule that the first padding token in a
  sequence is the one that matters.
  
     But what if a macro expansion is left?  Adjusting the above example
--- 639,677 ----
       sum = add (1,2, 3);
               ==> sum = 1 + 2 +3;
  
!    The interesting thing here is that the tokens '1' and '2' are output
! with a preceding space, and '3' is output without a preceding space, but
! when lexed none of these tokens had that property.  Careful
! consideration reveals that '1' gets its preceding whitespace from the
! space preceding 'add' in the macro invocation, _not_ replacement list.
! '2' gets its whitespace from the space preceding the parameter 'y' in
! the macro replacement list, and '3' has no preceding space because
! parameter 'z' has none in the replacement list.
  
     Once lexed, tokens are effectively fixed and cannot be altered, since
  pointers to them might be held in many places, in particular by
  in-progress macro expansions.  So instead of modifying the two tokens
! above, the preprocessor inserts a special token, which I call a "padding
! token", into the token stream to indicate that spacing of the subsequent
! token is special.  The preprocessor inserts padding tokens in front of
! every macro expansion and expanded macro argument.  These point to a
! "source token" from which the subsequent real token should inherit its
! spacing.  In the above example, the source tokens are 'add' in the macro
! invocation, and 'y' and 'z' in the macro replacement list, respectively.
  
!    It is quite easy to get multiple padding tokens in a row, for example
! if a macro's first replacement token expands straight into another
! macro.
  
       #define foo bar
       #define bar baz
       [foo]
               ==> [baz]
  
!    Here, two padding tokens are generated with sources the 'foo' token
! between the brackets, and the 'bar' token from foo's replacement list,
! respectively.  Clearly the first padding token is the one to use, so the
! output code should contain a rule that the first padding token in a
  sequence is the one that matters.
  
     But what if a macro expansion is left?  Adjusting the above example
*************** slightly:
*** 685,697 ****
       [foo] EMPTY;
               ==> [ baz] ;
  
!    As shown, now there should be a space before `baz' and the semicolon
  in the output.
  
!    The rules we decided above fail for `baz': we generate three padding
! tokens, one per macro invocation, before the token `baz'.  We would
! then have it take its spacing from the first of these, which carries
! source token `foo' with no leading space.
  
     It is vital that cpplib get spacing correct in these examples since
  any of these macro expansions could be stringified, where spacing
--- 683,695 ----
       [foo] EMPTY;
               ==> [ baz] ;
  
!    As shown, now there should be a space before 'baz' and the semicolon
  in the output.
  
!    The rules we decided above fail for 'baz': we generate three padding
! tokens, one per macro invocation, before the token 'baz'.  We would then
! have it take its spacing from the first of these, which carries source
! token 'foo' with no leading space.
  
     It is vital that cpplib get spacing correct in these examples since
  any of these macro expansions could be stringified, where spacing
*************** matters.
*** 699,709 ****
  
     So, this demonstrates that not just entering macro and argument
  expansions, but leaving them requires special handling too.  I made
! cpplib insert a padding token with a `NULL' source token when leaving
  macro expansions, as well as after each replaced argument in a macro's
  replacement list.  It also inserts appropriate padding tokens on either
! side of tokens created by the `#' and `##' operators.  I expanded the
! rule so that, if we see a padding token with a `NULL' source token,
  _and_ that source token has no leading space, then we behave as if we
  have seen no padding tokens at all.  A quick check shows this rule will
  then get the above example correct as well.
--- 697,707 ----
  
     So, this demonstrates that not just entering macro and argument
  expansions, but leaving them requires special handling too.  I made
! cpplib insert a padding token with a 'NULL' source token when leaving
  macro expansions, as well as after each replaced argument in a macro's
  replacement list.  It also inserts appropriate padding tokens on either
! side of tokens created by the '#' and '##' operators.  I expanded the
! rule so that, if we see a padding token with a 'NULL' source token,
  _and_ that source token has no leading space, then we behave as if we
  have seen no padding tokens at all.  A quick check shows this rule will
  then get the above example correct as well.
*************** implementation of paste avoidance easy:
*** 715,721 ****
  preprocessor is fixing up spacing because of padding tokens, and it
  turns out that no space is needed, it has to take the extra step to
  check that a space is not needed after all to avoid an accidental paste.
! The function `cpp_avoid_paste' advises whether a space is required
  between two consecutive tokens.  To avoid excessive spacing, it tries
  hard to only require a space if one is likely to be necessary, but for
  reasons of efficiency it is slightly conservative and might recommend a
--- 713,719 ----
  preprocessor is fixing up spacing because of padding tokens, and it
  turns out that no space is needed, it has to take the extra step to
  check that a space is not needed after all to avoid an accidental paste.
! The function 'cpp_avoid_paste' advises whether a space is required
  between two consecutive tokens.  To avoid excessive spacing, it tries
  hard to only require a space if one is likely to be necessary, but for
  reasons of efficiency it is slightly conservative and might recommend a
*************** There are three reasonable requirements
*** 734,740 ****
  the line number of a token passed to it:
  
     * The source line it was lexed on.
- 
     * The line it is output on.  This can be different to the line it was
       lexed on if, for example, there are intervening escaped newlines or
       C-style comments.  For example:
--- 732,737 ----
*************** the line number of a token passed to it:
*** 749,762 ****
       name, or possibly the line of the closing parenthesis in the case
       of function-like macro expansion.
  
!    The `cpp_token' structure contains `line' and `col' members.  The
  lexer fills these in with the line and column of the first character of
  the token.  Consequently, but maybe unexpectedly, a token from the
  replacement list of a macro expansion carries the location of the token
! within the `#define' directive, because cpplib expands a macro by
  returning pointers to the tokens in its replacement list.  The current
! implementation of cpplib assigns tokens created from built-in macros
! and the `#' and `##' operators the location of the most recently lexed
  token.  This is a because they are allocated from the lexer's token
  runs, and because of the way the diagnostic routines infer the
  appropriate location to report.
--- 746,759 ----
       name, or possibly the line of the closing parenthesis in the case
       of function-like macro expansion.
  
!    The 'cpp_token' structure contains 'line' and 'col' members.  The
  lexer fills these in with the line and column of the first character of
  the token.  Consequently, but maybe unexpectedly, a token from the
  replacement list of a macro expansion carries the location of the token
! within the '#define' directive, because cpplib expands a macro by
  returning pointers to the tokens in its replacement list.  The current
! implementation of cpplib assigns tokens created from built-in macros and
! the '#' and '##' operators the location of the most recently lexed
  token.  This is a because they are allocated from the lexer's token
  runs, and because of the way the diagnostic routines infer the
  appropriate location to report.
*************** line other than the first.
*** 778,787 ****
  
     To solve these issues, cpplib provides a callback that is generated
  whenever it lexes a preprocessing token that starts a new logical line
! other than a directive.  It passes this token (which may be a `CPP_EOF'
  token indicating the end of the translation unit) to the callback
! routine, which can then use the line and column of this token to
! produce correct output.
  
  Representation of line numbers
  ==============================
--- 775,784 ----
  
     To solve these issues, cpplib provides a callback that is generated
  whenever it lexes a preprocessing token that starts a new logical line
! other than a directive.  It passes this token (which may be a 'CPP_EOF'
  token indicating the end of the translation unit) to the callback
! routine, which can then use the line and column of this token to produce
! correct output.
  
  Representation of line numbers
  ==============================
*************** starts counting from one.
*** 801,815 ****
  translation unit.  With some simple infrastructure, it is straight
  forward to map from this to the original source file and line number
  pair, saving space whenever line number information needs to be saved.
! The code the implements this mapping lies in the files `line-map.c' and
! `line-map.h'.
  
     Command-line macros and assertions are implemented by pushing a
! buffer containing the right hand side of an equivalent `#define' or
! `#assert' directive.  Some built-in macros are handled similarly.
! Since these are all processed before the first line of the main input
! file, it will typically have an assigned line closer to twenty than to
! one.
  
  
  File: cppinternals.info,  Node: Guard Macros,  Next: Files,  Prev: Line Numbering,  Up: Top
--- 798,811 ----
  translation unit.  With some simple infrastructure, it is straight
  forward to map from this to the original source file and line number
  pair, saving space whenever line number information needs to be saved.
! The code the implements this mapping lies in the files 'line-map.c' and
! 'line-map.h'.
  
     Command-line macros and assertions are implemented by pushing a
! buffer containing the right hand side of an equivalent '#define' or
! '#assert' directive.  Some built-in macros are handled similarly.  Since
! these are all processed before the first line of the main input file, it
! will typically have an assigned line closer to twenty than to one.
  
  
  File: cppinternals.info,  Node: Guard Macros,  Next: Files,  Prev: Line Numbering,  Up: Top
*************** Header files are often of the form
*** 826,832 ****
  
  to prevent the compiler from processing them more than once.  The
  preprocessor notices such header files, so that if the header file
! appears in a subsequent `#include' directive and `FOO' is defined, then
  it is ignored and it doesn't preprocess or even re-open the file a
  second time.  This is referred to as the "multiple include
  optimization".
--- 822,828 ----
  
  to prevent the compiler from processing them more than once.  The
  preprocessor notices such header files, so that if the header file
! appears in a subsequent '#include' directive and 'FOO' is defined, then
  it is ignored and it doesn't preprocess or even re-open the file a
  second time.  This is referred to as the "multiple include
  optimization".
*************** inclusion would result in no tokens to r
*** 837,848 ****
  directives to process.  Therefore the current implementation imposes
  requirements and makes some allowances as follows:
  
!   1. There must be no tokens outside the controlling `#if'-`#endif'
       pair, but whitespace and comments are permitted.
  
!   2. There must be no directives outside the controlling directive
!      pair, but the "null directive" (a line containing nothing other
!      than a single `#' and possibly whitespace) is permitted.
  
    3. The opening directive must be of the form
  
--- 833,844 ----
  directives to process.  Therefore the current implementation imposes
  requirements and makes some allowances as follows:
  
!   1. There must be no tokens outside the controlling '#if'-'#endif'
       pair, but whitespace and comments are permitted.
  
!   2. There must be no directives outside the controlling directive pair,
!      but the "null directive" (a line containing nothing other than a
!      single '#' and possibly whitespace) is permitted.
  
    3. The opening directive must be of the form
  
*************** requirements and makes some allowances a
*** 852,921 ****
  
            #if !defined FOO     [equivalently, #if !defined(FOO)]
  
!   4. In the second form above, the tokens forming the `#if' expression
       must have come directly from the source file--no macro expansion
       must have been involved.  This is because macro definitions can
!      change, and tracking whether or not a relevant change has been
!      made is not worth the implementation cost.
  
!   5. There can be no `#else' or `#elif' directives at the outer
       conditional block level, because they would probably contain
       something of interest to a subsequent pass.
  
     First, when pushing a new file on the buffer stack,
! `_stack_include_file' sets the controlling macro `mi_cmacro' to `NULL',
! and sets `mi_valid' to `true'.  This indicates that the preprocessor
! has not yet encountered anything that would invalidate the
! multiple-include optimization.  As described in the next few
! paragraphs, these two variables having these values effectively
! indicates top-of-file.
  
     When about to return a token that is not part of a directive,
! `_cpp_lex_token' sets `mi_valid' to `false'.  This enforces the
  constraint that tokens outside the controlling conditional block
  invalidate the optimization.
  
!    The `do_if', when appropriate, and `do_ifndef' directive handlers
! pass the controlling macro to the function `push_conditional'.  cpplib
  maintains a stack of nested conditional blocks, and after processing
! every opening conditional this function pushes an `if_stack' structure
  onto the stack.  In this structure it records the controlling macro for
  the block, provided there is one and we're at top-of-file (as described
! above).  If an `#elif' or `#else' directive is encountered, the
! controlling macro for that block is cleared to `NULL'.  Otherwise, it
! survives until the `#endif' closing the block, upon which `do_endif'
! sets `mi_valid' to true and stores the controlling macro in `mi_cmacro'.
  
!    `_cpp_handle_directive' clears `mi_valid' when processing any
  directive other than an opening conditional and the null directive.
  With this, and requiring top-of-file to record a controlling macro, and
! no `#else' or `#elif' for it to survive and be copied to `mi_cmacro' by
! `do_endif', we have enforced the absence of directives outside the main
  conditional block for the optimization to be on.
  
!    Note that whilst we are inside the conditional block, `mi_valid' is
! likely to be reset to `false', but this does not matter since the
! closing `#endif' restores it to `true' if appropriate.
  
!    Finally, since `_cpp_lex_direct' pops the file off the buffer stack
! at `EOF' without returning a token, if the `#endif' directive was not
! followed by any tokens, `mi_valid' is `true' and `_cpp_pop_file_buffer'
  remembers the controlling macro associated with the file.  Subsequent
! calls to `stack_include_file' result in no buffer being pushed if the
  controlling macro is defined, effecting the optimization.
  
     A quick word on how we handle the
  
       #if !defined FOO
  
! case.  `_cpp_parse_expr' and `parse_defined' take steps to see whether
! the three stages `!', `defined-expression' and `end-of-directive' occur
! in order in a `#if' expression.  If so, they return the guard macro to
! `do_if' in the variable `mi_ind_cmacro', and otherwise set it to `NULL'.
! `enter_macro_context' sets `mi_valid' to false, so if a macro was
! expanded whilst parsing any part of the expression, then the
! top-of-file test in `push_conditional' fails and the optimization is
! turned off.
  
  
  File: cppinternals.info,  Node: Files,  Next: Concept Index,  Prev: Guard Macros,  Up: Top
--- 848,915 ----
  
            #if !defined FOO     [equivalently, #if !defined(FOO)]
  
!   4. In the second form above, the tokens forming the '#if' expression
       must have come directly from the source file--no macro expansion
       must have been involved.  This is because macro definitions can
!      change, and tracking whether or not a relevant change has been made
!      is not worth the implementation cost.
  
!   5. There can be no '#else' or '#elif' directives at the outer
       conditional block level, because they would probably contain
       something of interest to a subsequent pass.
  
     First, when pushing a new file on the buffer stack,
! '_stack_include_file' sets the controlling macro 'mi_cmacro' to 'NULL',
! and sets 'mi_valid' to 'true'.  This indicates that the preprocessor has
! not yet encountered anything that would invalidate the multiple-include
! optimization.  As described in the next few paragraphs, these two
! variables having these values effectively indicates top-of-file.
  
     When about to return a token that is not part of a directive,
! '_cpp_lex_token' sets 'mi_valid' to 'false'.  This enforces the
  constraint that tokens outside the controlling conditional block
  invalidate the optimization.
  
!    The 'do_if', when appropriate, and 'do_ifndef' directive handlers
! pass the controlling macro to the function 'push_conditional'.  cpplib
  maintains a stack of nested conditional blocks, and after processing
! every opening conditional this function pushes an 'if_stack' structure
  onto the stack.  In this structure it records the controlling macro for
  the block, provided there is one and we're at top-of-file (as described
! above).  If an '#elif' or '#else' directive is encountered, the
! controlling macro for that block is cleared to 'NULL'.  Otherwise, it
! survives until the '#endif' closing the block, upon which 'do_endif'
! sets 'mi_valid' to true and stores the controlling macro in 'mi_cmacro'.
  
!    '_cpp_handle_directive' clears 'mi_valid' when processing any
  directive other than an opening conditional and the null directive.
  With this, and requiring top-of-file to record a controlling macro, and
! no '#else' or '#elif' for it to survive and be copied to 'mi_cmacro' by
! 'do_endif', we have enforced the absence of directives outside the main
  conditional block for the optimization to be on.
  
!    Note that whilst we are inside the conditional block, 'mi_valid' is
! likely to be reset to 'false', but this does not matter since the
! closing '#endif' restores it to 'true' if appropriate.
  
!    Finally, since '_cpp_lex_direct' pops the file off the buffer stack
! at 'EOF' without returning a token, if the '#endif' directive was not
! followed by any tokens, 'mi_valid' is 'true' and '_cpp_pop_file_buffer'
  remembers the controlling macro associated with the file.  Subsequent
! calls to 'stack_include_file' result in no buffer being pushed if the
  controlling macro is defined, effecting the optimization.
  
     A quick word on how we handle the
  
       #if !defined FOO
  
! case.  '_cpp_parse_expr' and 'parse_defined' take steps to see whether
! the three stages '!', 'defined-expression' and 'end-of-directive' occur
! in order in a '#if' expression.  If so, they return the guard macro to
! 'do_if' in the variable 'mi_ind_cmacro', and otherwise set it to 'NULL'.
! 'enter_macro_context' sets 'mi_valid' to false, so if a macro was
! expanded whilst parsing any part of the expression, then the top-of-file
! test in 'push_conditional' fails and the optimization is turned off.
  
  
  File: cppinternals.info,  Node: Files,  Next: Concept Index,  Prev: Guard Macros,  Up: Top
*************** File Handling
*** 924,936 ****
  *************
  
  Fairly obviously, the file handling code of cpplib resides in the file
! `files.c'.  It takes care of the details of file searching, opening,
  reading and caching, for both the main source file and all the headers
  it recursively includes.
  
     The basic strategy is to minimize the number of system calls.  On
! many systems, the basic `open ()' and `fstat ()' system calls can be
! quite expensive.  For every `#include'-d file, we need to try all the
  directories in the search path until we find a match.  Some projects,
  such as glibc, pass twenty or thirty include paths on the command line,
  so this can rapidly become time consuming.
--- 918,930 ----
  *************
  
  Fairly obviously, the file handling code of cpplib resides in the file
! 'files.c'.  It takes care of the details of file searching, opening,
  reading and caching, for both the main source file and all the headers
  it recursively includes.
  
     The basic strategy is to minimize the number of system calls.  On
! many systems, the basic 'open ()' and 'fstat ()' system calls can be
! quite expensive.  For every '#include'-d file, we need to try all the
  directories in the search path until we find a match.  Some projects,
  such as glibc, pass twenty or thirty include paths on the command line,
  so this can rapidly become time consuming.
*************** repeating the filesystem queries whilst
*** 942,986 ****
  
     For each file we try to open, we store the constructed path in a
  splay tree.  This path first undergoes simplification by the function
! `_cpp_simplify_pathname'.  For example, `/usr/include/bits/../foo.h' is
! simplified to `/usr/include/foo.h' before we enter it in the splay tree
! and try to `open ()' the file.  CPP will then find subsequent uses of
! `foo.h', even as `/usr/include/foo.h', in the splay tree and save
! system calls.
  
!    Further, it is likely the file contents have also been cached,
! saving a `read ()' system call.  We don't bother caching the contents of
! header files that are re-inclusion protected, and whose re-inclusion
! macro is defined when we leave the header file for the first time.  If
! the host supports it, we try to map suitably large files into memory,
! rather than reading them in directly.
  
     The include paths are internally stored on a null-terminated
! singly-linked list, starting with the `"header.h"' directory search
! chain, which then links into the `<header.h>' directory chain.
  
!    Files included with the `<foo.h>' syntax start the lookup directly
! in the second half of this chain.  However, files included with the
! `"foo.h"' syntax start at the beginning of the chain, but with one
! extra directory prepended.  This is the directory of the current file;
! the one containing the `#include' directive.  Prepending this directory
! on a per-file basis is handled by the function `search_from'.
  
     Note that a header included with a directory component, such as
! `#include "mydir/foo.h"' and opened as
! `/usr/local/include/mydir/foo.h', will have the complete path minus the
! basename `foo.h' as the current directory.
  
     Enough information is stored in the splay tree that CPP can
  immediately tell whether it can skip the header file because of the
! multiple include optimization, whether the file didn't exist or
! couldn't be opened for some reason, or whether the header was flagged
! not to be re-used, as it is with the obsolete `#import' directive.
  
     For the benefit of MS-DOS filesystems with an 8.3 filename
  limitation, CPP offers the ability to treat various include file names
  as aliases for the real header files with shorter names.  The map from
! one to the other is found in a special file called `header.gcc', stored
  in the command line (or system) include directories to which the mapping
  applies.  This may be higher up the directory tree than the full path to
  the file minus the base name.
--- 936,980 ----
  
     For each file we try to open, we store the constructed path in a
  splay tree.  This path first undergoes simplification by the function
! '_cpp_simplify_pathname'.  For example, '/usr/include/bits/../foo.h' is
! simplified to '/usr/include/foo.h' before we enter it in the splay tree
! and try to 'open ()' the file.  CPP will then find subsequent uses of
! 'foo.h', even as '/usr/include/foo.h', in the splay tree and save system
! calls.
  
!    Further, it is likely the file contents have also been cached, saving
! a 'read ()' system call.  We don't bother caching the contents of header
! files that are re-inclusion protected, and whose re-inclusion macro is
! defined when we leave the header file for the first time.  If the host
! supports it, we try to map suitably large files into memory, rather than
! reading them in directly.
  
     The include paths are internally stored on a null-terminated
! singly-linked list, starting with the '"header.h"' directory search
! chain, which then links into the '<header.h>' directory chain.
  
!    Files included with the '<foo.h>' syntax start the lookup directly in
! the second half of this chain.  However, files included with the
! '"foo.h"' syntax start at the beginning of the chain, but with one extra
! directory prepended.  This is the directory of the current file; the one
! containing the '#include' directive.  Prepending this directory on a
! per-file basis is handled by the function 'search_from'.
  
     Note that a header included with a directory component, such as
! '#include "mydir/foo.h"' and opened as '/usr/local/include/mydir/foo.h',
! will have the complete path minus the basename 'foo.h' as the current
! directory.
  
     Enough information is stored in the splay tree that CPP can
  immediately tell whether it can skip the header file because of the
! multiple include optimization, whether the file didn't exist or couldn't
! be opened for some reason, or whether the header was flagged not to be
! re-used, as it is with the obsolete '#import' directive.
  
     For the benefit of MS-DOS filesystems with an 8.3 filename
  limitation, CPP offers the ability to treat various include file names
  as aliases for the real header files with shorter names.  The map from
! one to the other is found in a special file called 'header.gcc', stored
  in the command line (or system) include directories to which the mapping
  applies.  This may be higher up the directory tree than the full path to
  the file minus the base name.
*************** Concept Index
*** 996,1002 ****
  
  * assertions:                            Hash Nodes.          (line   6)
  * controlling macros:                    Guard Macros.        (line   6)
! * escaped newlines:                      Lexer.               (line   6)
  * files:                                 Files.               (line   6)
  * guard macros:                          Guard Macros.        (line   6)
  * hash table:                            Hash Nodes.          (line   6)
--- 990,996 ----
  
  * assertions:                            Hash Nodes.          (line   6)
  * controlling macros:                    Guard Macros.        (line   6)
! * escaped newlines:                      Lexer.               (line   5)
  * files:                                 Files.               (line   6)
  * guard macros:                          Guard Macros.        (line   6)
  * hash table:                            Hash Nodes.          (line   6)
*************** Concept Index
*** 1004,1010 ****
  * identifiers:                           Hash Nodes.          (line   6)
  * interface:                             Conventions.         (line   6)
  * lexer:                                 Lexer.               (line   6)
! * line numbers:                          Line Numbering.      (line   6)
  * macro expansion:                       Macro Expansion.     (line   6)
  * macro representation (internal):       Macro Expansion.     (line  19)
  * macros:                                Hash Nodes.          (line   6)
--- 998,1004 ----
  * identifiers:                           Hash Nodes.          (line   6)
  * interface:                             Conventions.         (line   6)
  * lexer:                                 Lexer.               (line   6)
! * line numbers:                          Line Numbering.      (line   5)
  * macro expansion:                       Macro Expansion.     (line   6)
  * macro representation (internal):       Macro Expansion.     (line  19)
  * macros:                                Hash Nodes.          (line   6)
*************** Concept Index
*** 1013,1035 ****
  * newlines:                              Lexer.               (line   6)
  * paste avoidance:                       Token Spacing.       (line   6)
  * spacing:                               Token Spacing.       (line   6)
! * token run:                             Lexer.               (line 192)
  * token spacing:                         Token Spacing.       (line   6)
  
  
  
  Tag Table:
! Node: Top958
! Node: Conventions2643
! Node: Lexer3585
! Ref: Invalid identifiers11498
! Ref: Lexing a line13447
! Node: Hash Nodes18220
! Node: Macro Expansion21099
! Node: Token Spacing30046
! Node: Line Numbering35906
! Node: Guard Macros39991
! Node: Files44782
! Node: Concept Index48248
  
  End Tag Table
--- 1007,1029 ----
  * newlines:                              Lexer.               (line   6)
  * paste avoidance:                       Token Spacing.       (line   6)
  * spacing:                               Token Spacing.       (line   6)
! * token run:                             Lexer.               (line 191)
  * token spacing:                         Token Spacing.       (line   6)
  
  
  
  Tag Table:
! Node: Top905
! Node: Conventions2590
! Node: Lexer3532
! Ref: Invalid identifiers11447
! Ref: Lexing a line13397
! Node: Hash Nodes18170
! Node: Macro Expansion21049
! Node: Token Spacing29997
! Node: Line Numbering35854
! Node: Guard Macros39939
! Node: Files44730
! Node: Concept Index48196
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/gcc/doc/extend.texi gcc-5.5.0/gcc/doc/extend.texi
*** gcc-5.4.0/gcc/doc/extend.texi	Thu Oct 15 16:38:47 2015
--- gcc-5.5.0/gcc/doc/extend.texi	Sat Aug 19 08:25:14 2017
*************** together with checking whether the opera
*** 8625,8634 ****
  @deftypefn {Built-in Function} bool __builtin_add_overflow (@var{type1} a, @var{type2} b, @var{type3} *res)
  @deftypefnx {Built-in Function} bool __builtin_sadd_overflow (int a, int b, int *res)
  @deftypefnx {Built-in Function} bool __builtin_saddl_overflow (long int a, long int b, long int *res)
! @deftypefnx {Built-in Function} bool __builtin_saddll_overflow (long long int a, long long int b, long int *res)
  @deftypefnx {Built-in Function} bool __builtin_uadd_overflow (unsigned int a, unsigned int b, unsigned int *res)
  @deftypefnx {Built-in Function} bool __builtin_uaddl_overflow (unsigned long int a, unsigned long int b, unsigned long int *res)
! @deftypefnx {Built-in Function} bool __builtin_uaddll_overflow (unsigned long long int a, unsigned long long int b, unsigned long int *res)
  
  These built-in functions promote the first two operands into infinite precision signed
  type and perform addition on those promoted operands.  The result is then
--- 8625,8634 ----
  @deftypefn {Built-in Function} bool __builtin_add_overflow (@var{type1} a, @var{type2} b, @var{type3} *res)
  @deftypefnx {Built-in Function} bool __builtin_sadd_overflow (int a, int b, int *res)
  @deftypefnx {Built-in Function} bool __builtin_saddl_overflow (long int a, long int b, long int *res)
! @deftypefnx {Built-in Function} bool __builtin_saddll_overflow (long long int a, long long int b, long long int *res)
  @deftypefnx {Built-in Function} bool __builtin_uadd_overflow (unsigned int a, unsigned int b, unsigned int *res)
  @deftypefnx {Built-in Function} bool __builtin_uaddl_overflow (unsigned long int a, unsigned long int b, unsigned long int *res)
! @deftypefnx {Built-in Function} bool __builtin_uaddll_overflow (unsigned long long int a, unsigned long long int b, unsigned long long int *res)
  
  These built-in functions promote the first two operands into infinite precision signed
  type and perform addition on those promoted operands.  The result is then
*************** after addition, conditional jump on carr
*** 8651,8660 ****
  @deftypefn {Built-in Function} bool __builtin_sub_overflow (@var{type1} a, @var{type2} b, @var{type3} *res)
  @deftypefnx {Built-in Function} bool __builtin_ssub_overflow (int a, int b, int *res)
  @deftypefnx {Built-in Function} bool __builtin_ssubl_overflow (long int a, long int b, long int *res)
! @deftypefnx {Built-in Function} bool __builtin_ssubll_overflow (long long int a, long long int b, long int *res)
  @deftypefnx {Built-in Function} bool __builtin_usub_overflow (unsigned int a, unsigned int b, unsigned int *res)
  @deftypefnx {Built-in Function} bool __builtin_usubl_overflow (unsigned long int a, unsigned long int b, unsigned long int *res)
! @deftypefnx {Built-in Function} bool __builtin_usubll_overflow (unsigned long long int a, unsigned long long int b, unsigned long int *res)
  
  These built-in functions are similar to the add overflow checking built-in
  functions above, except they perform subtraction, subtract the second argument
--- 8651,8660 ----
  @deftypefn {Built-in Function} bool __builtin_sub_overflow (@var{type1} a, @var{type2} b, @var{type3} *res)
  @deftypefnx {Built-in Function} bool __builtin_ssub_overflow (int a, int b, int *res)
  @deftypefnx {Built-in Function} bool __builtin_ssubl_overflow (long int a, long int b, long int *res)
! @deftypefnx {Built-in Function} bool __builtin_ssubll_overflow (long long int a, long long int b, long long int *res)
  @deftypefnx {Built-in Function} bool __builtin_usub_overflow (unsigned int a, unsigned int b, unsigned int *res)
  @deftypefnx {Built-in Function} bool __builtin_usubl_overflow (unsigned long int a, unsigned long int b, unsigned long int *res)
! @deftypefnx {Built-in Function} bool __builtin_usubll_overflow (unsigned long long int a, unsigned long long int b, unsigned long long int *res)
  
  These built-in functions are similar to the add overflow checking built-in
  functions above, except they perform subtraction, subtract the second argument
*************** from the first one, instead of addition.
*** 8665,8674 ****
  @deftypefn {Built-in Function} bool __builtin_mul_overflow (@var{type1} a, @var{type2} b, @var{type3} *res)
  @deftypefnx {Built-in Function} bool __builtin_smul_overflow (int a, int b, int *res)
  @deftypefnx {Built-in Function} bool __builtin_smull_overflow (long int a, long int b, long int *res)
! @deftypefnx {Built-in Function} bool __builtin_smulll_overflow (long long int a, long long int b, long int *res)
  @deftypefnx {Built-in Function} bool __builtin_umul_overflow (unsigned int a, unsigned int b, unsigned int *res)
  @deftypefnx {Built-in Function} bool __builtin_umull_overflow (unsigned long int a, unsigned long int b, unsigned long int *res)
! @deftypefnx {Built-in Function} bool __builtin_umulll_overflow (unsigned long long int a, unsigned long long int b, unsigned long int *res)
  
  These built-in functions are similar to the add overflow checking built-in
  functions above, except they perform multiplication, instead of addition.
--- 8665,8674 ----
  @deftypefn {Built-in Function} bool __builtin_mul_overflow (@var{type1} a, @var{type2} b, @var{type3} *res)
  @deftypefnx {Built-in Function} bool __builtin_smul_overflow (int a, int b, int *res)
  @deftypefnx {Built-in Function} bool __builtin_smull_overflow (long int a, long int b, long int *res)
! @deftypefnx {Built-in Function} bool __builtin_smulll_overflow (long long int a, long long int b, long long int *res)
  @deftypefnx {Built-in Function} bool __builtin_umul_overflow (unsigned int a, unsigned int b, unsigned int *res)
  @deftypefnx {Built-in Function} bool __builtin_umull_overflow (unsigned long int a, unsigned long int b, unsigned long int *res)
! @deftypefnx {Built-in Function} bool __builtin_umulll_overflow (unsigned long long int a, unsigned long long int b, unsigned long long int *res)
  
  These built-in functions are similar to the add overflow checking built-in
  functions above, except they perform multiplication, instead of addition.
*************** is enabled. Cilk Plus can be enabled usi
*** 9041,9047 ****
  
  Further details and examples about these built-in functions are described 
  in the Cilk Plus language manual which can be found at 
! @uref{http://www.cilkplus.org}.
  
  @node Other Builtins
  @section Other Built-in Functions Provided by GCC
--- 9041,9047 ----
  
  Further details and examples about these built-in functions are described 
  in the Cilk Plus language manual which can be found at 
! @uref{https://www.cilkplus.org}.
  
  @node Other Builtins
  @section Other Built-in Functions Provided by GCC
*************** The following built-in functions are ava
*** 12486,12499 ****
  of processors when hardware decimal floating point
  (@option{-mhard-dfp}) is available:
  @smallexample
! _Decimal64 __builtin_dxex (_Decimal64);
! _Decimal128 __builtin_dxexq (_Decimal128);
  _Decimal64 __builtin_ddedpd (int, _Decimal64);
  _Decimal128 __builtin_ddedpdq (int, _Decimal128);
  _Decimal64 __builtin_denbcd (int, _Decimal64);
  _Decimal128 __builtin_denbcdq (int, _Decimal128);
! _Decimal64 __builtin_diex (_Decimal64, _Decimal64);
! _Decimal128 _builtin_diexq (_Decimal128, _Decimal128);
  _Decimal64 __builtin_dscli (_Decimal64, int);
  _Decimal128 __builtin_dscliq (_Decimal128, int);
  _Decimal64 __builtin_dscri (_Decimal64, int);
--- 12486,12499 ----
  of processors when hardware decimal floating point
  (@option{-mhard-dfp}) is available:
  @smallexample
! long long __builtin_dxex (_Decimal64);
! long long __builtin_dxexq (_Decimal128);
  _Decimal64 __builtin_ddedpd (int, _Decimal64);
  _Decimal128 __builtin_ddedpdq (int, _Decimal128);
  _Decimal64 __builtin_denbcd (int, _Decimal64);
  _Decimal128 __builtin_denbcdq (int, _Decimal128);
! _Decimal64 __builtin_diex (long long, _Decimal64);
! _Decimal128 _builtin_diexq (long long, _Decimal128);
  _Decimal64 __builtin_dscli (_Decimal64, int);
  _Decimal128 __builtin_dscliq (_Decimal128, int);
  _Decimal64 __builtin_dscri (_Decimal64, int);
*************** void vec_vsx_st (vector bool char, int,
*** 14638,14657 ****
  void vec_vsx_st (vector bool char, int, unsigned char *);
  void vec_vsx_st (vector bool char, int, signed char *);
  
! vector double vec_xxpermdi (vector double, vector double, int);
! vector float vec_xxpermdi (vector float, vector float, int);
! vector long long vec_xxpermdi (vector long long, vector long long, int);
  vector unsigned long long vec_xxpermdi (vector unsigned long long,
!                                         vector unsigned long long, int);
! vector int vec_xxpermdi (vector int, vector int, int);
  vector unsigned int vec_xxpermdi (vector unsigned int,
!                                   vector unsigned int, int);
! vector short vec_xxpermdi (vector short, vector short, int);
  vector unsigned short vec_xxpermdi (vector unsigned short,
!                                     vector unsigned short, int);
! vector signed char vec_xxpermdi (vector signed char, vector signed char, int);
  vector unsigned char vec_xxpermdi (vector unsigned char,
!                                    vector unsigned char, int);
  
  vector double vec_xxsldi (vector double, vector double, int);
  vector float vec_xxsldi (vector float, vector float, int);
--- 14638,14658 ----
  void vec_vsx_st (vector bool char, int, unsigned char *);
  void vec_vsx_st (vector bool char, int, signed char *);
  
! vector double vec_xxpermdi (vector double, vector double, const int);
! vector float vec_xxpermdi (vector float, vector float, const int);
! vector long long vec_xxpermdi (vector long long, vector long long, const int);
  vector unsigned long long vec_xxpermdi (vector unsigned long long,
!                                         vector unsigned long long, const int);
! vector int vec_xxpermdi (vector int, vector int, const int);
  vector unsigned int vec_xxpermdi (vector unsigned int,
!                                   vector unsigned int, const int);
! vector short vec_xxpermdi (vector short, vector short, const int);
  vector unsigned short vec_xxpermdi (vector unsigned short,
!                                     vector unsigned short, const int);
! vector signed char vec_xxpermdi (vector signed char, vector signed char,
!                                  const int);
  vector unsigned char vec_xxpermdi (vector unsigned char,
!                                    vector unsigned char, const int);
  
  vector double vec_xxsldi (vector double, vector double, int);
  vector float vec_xxsldi (vector float, vector float, int);
*************** unsigned long long _pext_u64 (unsigned l
*** 17221,17227 ****
  The following built-in functions are available when @option{-mlzcnt} is used.
  All of them generate the machine instruction that is part of the name.
  @smallexample
! unsigned short __builtin_ia32_lzcnt_16(unsigned short);
  unsigned int __builtin_ia32_lzcnt_u32(unsigned int);
  unsigned long long __builtin_ia32_lzcnt_u64 (unsigned long long);
  @end smallexample
--- 17222,17228 ----
  The following built-in functions are available when @option{-mlzcnt} is used.
  All of them generate the machine instruction that is part of the name.
  @smallexample
! unsigned short __builtin_ia32_lzcnt_u16(unsigned short);
  unsigned int __builtin_ia32_lzcnt_u32(unsigned int);
  unsigned long long __builtin_ia32_lzcnt_u64 (unsigned long long);
  @end smallexample
diff -Nrcpad gcc-5.4.0/gcc/doc/fsf-funding.7 gcc-5.5.0/gcc/doc/fsf-funding.7
*** gcc-5.4.0/gcc/doc/fsf-funding.7	Fri Jun  3 08:54:13 2016
--- gcc-5.5.0/gcc/doc/fsf-funding.7	Tue Oct 10 08:23:55 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "FSF-FUNDING 7"
! .TH FSF-FUNDING 7 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "FSF-FUNDING 7"
! .TH FSF-FUNDING 7 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
***************
*** 141,147 ****
  fsf\-funding \- Funding Free Software
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! .Sh "Funding Free Software"
  .IX Subsection "Funding Free Software"
  If you want to have more free software a few years from now, it makes
  sense for you to help encourage people to contribute funds for its
--- 138,144 ----
  fsf\-funding \- Funding Free Software
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! .SS "Funding Free Software"
  .IX Subsection "Funding Free Software"
  If you want to have more free software a few years from now, it makes
  sense for you to help encourage people to contribute funds for its
diff -Nrcpad gcc-5.4.0/gcc/doc/g++.1 gcc-5.5.0/gcc/doc/g++.1
*** gcc-5.4.0/gcc/doc/g++.1	Fri Jun  3 10:32:25 2016
--- gcc-5.5.0/gcc/doc/g++.1	Tue Oct 10 09:40:26 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GCC 1"
! .TH GCC 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GCC 1"
! .TH GCC 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** Only the most useful options are listed
*** 153,159 ****
  remainder.  \fBg++\fR accepts mostly the same options as \fBgcc\fR.
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! When you invoke \s-1GCC\s0, it normally does preprocessing, compilation,
  assembly and linking.  The \*(L"overall options\*(R" allow you to stop this
  process at an intermediate stage.  For example, the \fB\-c\fR option
  says not to run the linker.  Then the output consists of object files
--- 150,156 ----
  remainder.  \fBg++\fR accepts mostly the same options as \fBgcc\fR.
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! When you invoke \s-1GCC,\s0 it normally does preprocessing, compilation,
  assembly and linking.  The \*(L"overall options\*(R" allow you to stop this
  process at an intermediate stage.  For example, the \fB\-c\fR option
  says not to run the linker.  Then the output consists of object files
*************** these have both positive and negative fo
*** 188,194 ****
  only one of these two forms, whichever one is not the default.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! .Sh "Option Summary"
  .IX Subsection "Option Summary"
  Here is a summary of all the options, grouped by type.  Explanations are
  in the following sections.
--- 185,191 ----
  only one of these two forms, whichever one is not the default.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! .SS "Option Summary"
  .IX Subsection "Option Summary"
  Here is a summary of all the options, grouped by type.  Explanations are
  in the following sections.
*************** in the following sections.
*** 276,282 ****
  \&\-Wno\-attributes \-Wno\-builtin\-macro\-redefined 
  \&\-Wc90\-c99\-compat \-Wc99\-c11\-compat 
  \&\-Wc++\-compat \-Wc++11\-compat \-Wc++14\-compat \-Wcast\-align  \-Wcast\-qual  
! \&\-Wchar\-subscripts \-Wclobbered  \-Wcomment \-Wconditionally\-supported  
  \&\-Wconversion \-Wcoverage\-mismatch \-Wdate\-time \-Wdelete\-incomplete \-Wno\-cpp  
  \&\-Wno\-deprecated \-Wno\-deprecated\-declarations \-Wno\-designated\-init 
  \&\-Wdisabled\-optimization 
--- 273,279 ----
  \&\-Wno\-attributes \-Wno\-builtin\-macro\-redefined 
  \&\-Wc90\-c99\-compat \-Wc99\-c11\-compat 
  \&\-Wc++\-compat \-Wc++11\-compat \-Wc++14\-compat \-Wcast\-align  \-Wcast\-qual  
! \&\-Wchar\-subscripts \-Wchkp \-Wclobbered  \-Wcomment \-Wconditionally\-supported  
  \&\-Wconversion \-Wcoverage\-mismatch \-Wdate\-time \-Wdelete\-incomplete \-Wno\-cpp  
  \&\-Wno\-deprecated \-Wno\-deprecated\-declarations \-Wno\-designated\-init 
  \&\-Wdisabled\-optimization 
*************** in the following sections.
*** 594,600 ****
  \&\fI\s-1AVR\s0 Options\fR
  \&\fB\-mmcu=\fR\fImcu\fR \fB\-maccumulate\-args \-mbranch\-cost=\fR\fIcost\fR 
  \&\fB\-mcall\-prologues \-mint8 \-mn_flash=\fR\fIsize\fR \fB\-mno\-interrupts 
! \&\-mrelax \-mrmw \-mstrict\-X \-mtiny\-stack \-nodevicelib \-Waddr\-space\-convert\fR
  .Sp
  \&\fIBlackfin Options\fR
  \&\fB\-mcpu=\fR\fIcpu\fR[\fB\-\fR\fIsirevision\fR] 
--- 591,598 ----
  \&\fI\s-1AVR\s0 Options\fR
  \&\fB\-mmcu=\fR\fImcu\fR \fB\-maccumulate\-args \-mbranch\-cost=\fR\fIcost\fR 
  \&\fB\-mcall\-prologues \-mint8 \-mn_flash=\fR\fIsize\fR \fB\-mno\-interrupts 
! \&\-mrelax \-mrmw \-mstrict\-X \-mtiny\-stack \-nodevicelib \-Waddr\-space\-convert 
! \&\-Wmisspelled\-isr\fR
  .Sp
  \&\fIBlackfin Options\fR
  \&\fB\-mcpu=\fR\fIcpu\fR[\fB\-\fR\fIsirevision\fR] 
*************** See \s-1RS/6000\s0 and PowerPC Options.
*** 943,949 ****
  \&\-mpointers\-to\-nested\-functions \-mno\-pointers\-to\-nested\-functions 
  \&\-msave\-toc\-indirect \-mno\-save\-toc\-indirect 
  \&\-mpower8\-fusion \-mno\-mpower8\-fusion \-mpower8\-vector \-mno\-power8\-vector 
! \&\-mcrypto \-mno\-crypto \-mdirect\-move \-mno\-direct\-move 
  \&\-mquad\-memory \-mno\-quad\-memory 
  \&\-mquad\-memory\-atomic \-mno\-quad\-memory\-atomic 
  \&\-mcompat\-align\-parm \-mno\-compat\-align\-parm 
--- 941,947 ----
  \&\-mpointers\-to\-nested\-functions \-mno\-pointers\-to\-nested\-functions 
  \&\-msave\-toc\-indirect \-mno\-save\-toc\-indirect 
  \&\-mpower8\-fusion \-mno\-mpower8\-fusion \-mpower8\-vector \-mno\-power8\-vector 
! \&\-mcrypto \-mno\-crypto \-mhtm \-mno\-htm \-mdirect\-move \-mno\-direct\-move 
  \&\-mquad\-memory \-mno\-quad\-memory 
  \&\-mquad\-memory\-atomic \-mno\-quad\-memory\-atomic 
  \&\-mcompat\-align\-parm \-mno\-compat\-align\-parm 
*************** See S/390 and zSeries Options.
*** 1155,1161 ****
  \&\fB\-ftrapv  \-fwrapv  \-fbounds\-check 
  \&\-fvisibility=\fR[\fBdefault\fR|\fBinternal\fR|\fBhidden\fR|\fBprotected\fR] 
  \&\fB\-fstrict\-volatile\-bitfields \-fsync\-libcalls\fR
! .Sh "Options Controlling the Kind of Output"
  .IX Subsection "Options Controlling the Kind of Output"
  Compilation can involve up to four stages: preprocessing, compilation
  proper, assembly and linking, always in that order.  \s-1GCC\s0 is capable of
--- 1153,1159 ----
  \&\fB\-ftrapv  \-fwrapv  \-fbounds\-check 
  \&\-fvisibility=\fR[\fBdefault\fR|\fBinternal\fR|\fBhidden\fR|\fBprotected\fR] 
  \&\fB\-fstrict\-volatile\-bitfields \-fsync\-libcalls\fR
! .SS "Options Controlling the Kind of Output"
  .IX Subsection "Options Controlling the Kind of Output"
  Compilation can involve up to four stages: preprocessing, compilation
  proper, assembly and linking, always in that order.  \s-1GCC\s0 is capable of
*************** option.
*** 1459,1465 ****
  .IX Item "language"
  Display the options supported for \fIlanguage\fR, where
  \&\fIlanguage\fR is the name of one of the languages supported in this
! version of \s-1GCC\s0.
  .IP "\fBcommon\fR" 4
  .IX Item "common"
  Display the options that are common to all languages.
--- 1457,1463 ----
  .IX Item "language"
  Display the options supported for \fIlanguage\fR, where
  \&\fIlanguage\fR is the name of one of the languages supported in this
! version of \s-1GCC.\s0
  .IP "\fBcommon\fR" 4
  .IX Item "common"
  Display the options that are common to all languages.
*************** or \fB/./\fR, or make the path absolute
*** 1556,1562 ****
  prefix.
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
! Display the version number and copyrights of the invoked \s-1GCC\s0.
  .IP "\fB\-wrapper\fR" 4
  .IX Item "-wrapper"
  Invoke all subcommands under a wrapper program.  The name of the
--- 1554,1560 ----
  prefix.
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
! Display the version number and copyrights of the invoked \s-1GCC.\s0
  .IP "\fB\-wrapper\fR" 4
  .IX Item "-wrapper"
  Invoke all subcommands under a wrapper program.  The name of the
*************** the shared object file is used to identi
*** 1578,1584 ****
  purposes of argument parsing (See
  \&\fB\-fplugin\-arg\-\fR\fIname\fR\fB\-\fR\fIkey\fR\fB=\fR\fIvalue\fR below).
  Each plugin should define the callback functions specified in the
! Plugins \s-1API\s0.
  .IP "\fB\-fplugin\-arg\-\fR\fIname\fR\fB\-\fR\fIkey\fR\fB=\fR\fIvalue\fR" 4
  .IX Item "-fplugin-arg-name-key=value"
  Define an argument called \fIkey\fR with a value of \fIvalue\fR
--- 1576,1582 ----
  purposes of argument parsing (See
  \&\fB\-fplugin\-arg\-\fR\fIname\fR\fB\-\fR\fIkey\fR\fB=\fR\fIvalue\fR below).
  Each plugin should define the callback functions specified in the
! Plugins \s-1API.\s0
  .IP "\fB\-fplugin\-arg\-\fR\fIname\fR\fB\-\fR\fIkey\fR\fB=\fR\fIvalue\fR" 4
  .IX Item "-fplugin-arg-name-key=value"
  Define an argument called \fIkey\fR with a value of \fIvalue\fR
*************** option in either single or double quotes
*** 1610,1617 ****
  backslash) may be included by prefixing the character to be included
  with a backslash.  The \fIfile\fR may itself contain additional
  @\fIfile\fR options; any such options will be processed recursively.
! .Sh "Compiling \*(C+ Programs"
! .IX Subsection "Compiling  Programs"
  \&\*(C+ source files conventionally use one of the suffixes \fB.C\fR,
  \&\fB.cc\fR, \fB.cpp\fR, \fB.CPP\fR, \fB.c++\fR, \fB.cp\fR, or
  \&\fB.cxx\fR; \*(C+ header files often use \fB.hh\fR, \fB.hpp\fR,
--- 1608,1615 ----
  backslash) may be included by prefixing the character to be included
  with a backslash.  The \fIfile\fR may itself contain additional
  @\fIfile\fR options; any such options will be processed recursively.
! .SS "Compiling \*(C+ Programs"
! .IX Subsection "Compiling Programs"
  \&\*(C+ source files conventionally use one of the suffixes \fB.C\fR,
  \&\fB.cc\fR, \fB.cpp\fR, \fB.CPP\fR, \fB.c++\fR, \fB.cp\fR, or
  \&\fB.cxx\fR; \*(C+ header files often use \fB.hh\fR, \fB.hpp\fR,
*************** When you compile \*(C+ programs, you may
*** 1634,1640 ****
  command-line options that you use for compiling programs in any
  language; or command-line options meaningful for C and related
  languages; or options that are meaningful only for \*(C+ programs.
! .Sh "Options Controlling C Dialect"
  .IX Subsection "Options Controlling C Dialect"
  The following options control the dialect of C (or languages derived
  from C, such as \*(C+, Objective-C and Objective\-\*(C+) that the compiler
--- 1632,1638 ----
  command-line options that you use for compiling programs in any
  language; or command-line options meaningful for C and related
  languages; or options that are meaningful only for \*(C+ programs.
! .SS "Options Controlling C Dialect"
  .IX Subsection "Options Controlling C Dialect"
  The following options control the dialect of C (or languages derived
  from C, such as \*(C+, Objective-C and Objective\-\*(C+) that the compiler
*************** accepts:
*** 1644,1651 ****
  In C mode, this is equivalent to \fB\-std=c90\fR. In \*(C+ mode, it is
  equivalent to \fB\-std=c++98\fR.
  .Sp
! This turns off certain features of \s-1GCC\s0 that are incompatible with \s-1ISO\s0
! C90 (when compiling C code), or of standard \*(C+ (when compiling \*(C+ code),
  such as the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR keywords, and
  predefined macros such as \f(CW\*(C`unix\*(C'\fR and \f(CW\*(C`vax\*(C'\fR that identify the
  type of system you are using.  It also enables the undesirable and
--- 1642,1649 ----
  In C mode, this is equivalent to \fB\-std=c90\fR. In \*(C+ mode, it is
  equivalent to \fB\-std=c++98\fR.
  .Sp
! This turns off certain features of \s-1GCC\s0 that are incompatible with \s-1ISO
! C90\s0 (when compiling C code), or of standard \*(C+ (when compiling \*(C+ code),
  such as the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR keywords, and
  predefined macros such as \f(CW\*(C`unix\*(C'\fR and \f(CW\*(C`vax\*(C'\fR that identify the
  type of system you are using.  It also enables the undesirable and
*************** the \f(CW\*(C`inline\*(C'\fR keyword.
*** 1655,1661 ****
  .Sp
  The alternate keywords \f(CW\*(C`_\|_asm_\|_\*(C'\fR, \f(CW\*(C`_\|_extension_\|_\*(C'\fR,
  \&\f(CW\*(C`_\|_inline_\|_\*(C'\fR and \f(CW\*(C`_\|_typeof_\|_\*(C'\fR continue to work despite
! \&\fB\-ansi\fR.  You would not want to use them in an \s-1ISO\s0 C program, of
  course, but it is useful to put them in header files that might be included
  in compilations done with \fB\-ansi\fR.  Alternate predefined macros
  such as \f(CW\*(C`_\|_unix_\|_\*(C'\fR and \f(CW\*(C`_\|_vax_\|_\*(C'\fR are also available, with or
--- 1653,1659 ----
  .Sp
  The alternate keywords \f(CW\*(C`_\|_asm_\|_\*(C'\fR, \f(CW\*(C`_\|_extension_\|_\*(C'\fR,
  \&\f(CW\*(C`_\|_inline_\|_\*(C'\fR and \f(CW\*(C`_\|_typeof_\|_\*(C'\fR continue to work despite
! \&\fB\-ansi\fR.  You would not want to use them in an \s-1ISO C\s0 program, of
  course, but it is useful to put them in header files that might be included
  in compilations done with \fB\-ansi\fR.  Alternate predefined macros
  such as \f(CW\*(C`_\|_unix_\|_\*(C'\fR and \f(CW\*(C`_\|_vax_\|_\*(C'\fR are also available, with or
*************** from declaring certain functions or defi
*** 1672,1678 ****
  programs that might use these names for other things.
  .Sp
  Functions that are normally built in but do not have semantics
! defined by \s-1ISO\s0 C (such as \f(CW\*(C`alloca\*(C'\fR and \f(CW\*(C`ffs\*(C'\fR) are not built-in
  functions when \fB\-ansi\fR is used.
  .IP "\fB\-std=\fR" 4
  .IX Item "-std="
--- 1670,1676 ----
  programs that might use these names for other things.
  .Sp
  Functions that are normally built in but do not have semantics
! defined by \s-1ISO C\s0 (such as \f(CW\*(C`alloca\*(C'\fR and \f(CW\*(C`ffs\*(C'\fR) are not built-in
  functions when \fB\-ansi\fR is used.
  .IP "\fB\-std=\fR" 4
  .IX Item "-std="
*************** The compiler can accept several base sta
*** 1685,1693 ****
  compiler accepts all programs following that standard plus those
  using \s-1GNU\s0 extensions that do not contradict it.  For example,
  \&\fB\-std=c90\fR turns off certain features of \s-1GCC\s0 that are
! incompatible with \s-1ISO\s0 C90, such as the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR
  keywords, but not other \s-1GNU\s0 extensions that do not have a meaning in
! \&\s-1ISO\s0 C90, such as omitting the middle term of a \f(CW\*(C`?:\*(C'\fR
  expression. On the other hand, when a \s-1GNU\s0 dialect of a standard is
  specified, all features supported by the compiler are enabled, even when
  those features change the meaning of the base standard.  As a result, some
--- 1683,1691 ----
  compiler accepts all programs following that standard plus those
  using \s-1GNU\s0 extensions that do not contradict it.  For example,
  \&\fB\-std=c90\fR turns off certain features of \s-1GCC\s0 that are
! incompatible with \s-1ISO C90,\s0 such as the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR
  keywords, but not other \s-1GNU\s0 extensions that do not have a meaning in
! \&\s-1ISO C90,\s0 such as omitting the middle term of a \f(CW\*(C`?:\*(C'\fR
  expression. On the other hand, when a \s-1GNU\s0 dialect of a standard is
  specified, all features supported by the compiler are enabled, even when
  those features change the meaning of the base standard.  As a result, some
*************** A value for this option must be provided
*** 1707,1717 ****
  .IP "\fBiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! Support all \s-1ISO\s0 C90 programs (certain \s-1GNU\s0 extensions that conflict
! with \s-1ISO\s0 C90 are disabled). Same as \fB\-ansi\fR for C code.
  .IP "\fBiso9899:199409\fR" 4
  .IX Item "iso9899:199409"
! \&\s-1ISO\s0 C90 as modified in amendment 1.
  .IP "\fBc99\fR" 4
  .IX Item "c99"
  .PD 0
--- 1705,1715 ----
  .IP "\fBiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! Support all \s-1ISO C90\s0 programs (certain \s-1GNU\s0 extensions that conflict
! with \s-1ISO C90\s0 are disabled). Same as \fB\-ansi\fR for C code.
  .IP "\fBiso9899:199409\fR" 4
  .IX Item "iso9899:199409"
! \&\s-1ISO C90\s0 as modified in amendment 1.
  .IP "\fBc99\fR" 4
  .IX Item "c99"
  .PD 0
*************** with \s-1ISO\s0 C90 are disabled). Same
*** 1722,1728 ****
  .IP "\fBiso9899:199x\fR" 4
  .IX Item "iso9899:199x"
  .PD
! \&\s-1ISO\s0 C99.  This standard is substantially completely supported, modulo
  bugs and floating-point issues
  (mainly but not entirely relating to optional C99 features from
  Annexes F and G).  See
--- 1720,1726 ----
  .IP "\fBiso9899:199x\fR" 4
  .IX Item "iso9899:199x"
  .PD
! \&\s-1ISO C99.\s0  This standard is substantially completely supported, modulo
  bugs and floating-point issues
  (mainly but not entirely relating to optional C99 features from
  Annexes F and G).  See
*************** names \fBc9x\fR and \fBiso9899:199x\fR a
*** 1736,1742 ****
  .IP "\fBiso9899:2011\fR" 4
  .IX Item "iso9899:2011"
  .PD
! \&\s-1ISO\s0 C11, the 2011 revision of the \s-1ISO\s0 C standard.  This standard is
  substantially completely supported, modulo bugs, floating-point issues
  (mainly but not entirely relating to optional C11 features from
  Annexes F and G) and the optional Annexes K (Bounds-checking
--- 1734,1740 ----
  .IP "\fBiso9899:2011\fR" 4
  .IX Item "iso9899:2011"
  .PD
! \&\s-1ISO C11,\s0 the 2011 revision of the \s-1ISO C\s0 standard.  This standard is
  substantially completely supported, modulo bugs, floating-point issues
  (mainly but not entirely relating to optional C11 features from
  Annexes F and G) and the optional Annexes K (Bounds-checking
*************** interfaces) and L (Analyzability).  The
*** 1747,1767 ****
  .IP "\fBgnu89\fR" 4
  .IX Item "gnu89"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO\s0 C90 (including some C99 features).
  .IP "\fBgnu99\fR" 4
  .IX Item "gnu99"
  .PD 0
  .IP "\fBgnu9x\fR" 4
  .IX Item "gnu9x"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO\s0 C99.  The name \fBgnu9x\fR is deprecated.
  .IP "\fBgnu11\fR" 4
  .IX Item "gnu11"
  .PD 0
  .IP "\fBgnu1x\fR" 4
  .IX Item "gnu1x"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO\s0 C11.  This is the default for C code.
  The name \fBgnu1x\fR is deprecated.
  .IP "\fBc++98\fR" 4
  .IX Item "c++98"
--- 1745,1765 ----
  .IP "\fBgnu89\fR" 4
  .IX Item "gnu89"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO C90\s0 (including some C99 features).
  .IP "\fBgnu99\fR" 4
  .IX Item "gnu99"
  .PD 0
  .IP "\fBgnu9x\fR" 4
  .IX Item "gnu9x"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO C99.\s0  The name \fBgnu9x\fR is deprecated.
  .IP "\fBgnu11\fR" 4
  .IX Item "gnu11"
  .PD 0
  .IP "\fBgnu1x\fR" 4
  .IX Item "gnu1x"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO C11.\s0  This is the default for C code.
  The name \fBgnu1x\fR is deprecated.
  .IP "\fBc++98\fR" 4
  .IX Item "c++98"
*************** The name \fBgnu1x\fR is deprecated.
*** 1769,1775 ****
  .IP "\fBc++03\fR" 4
  .IX Item "c++03"
  .PD
! The 1998 \s-1ISO\s0 \*(C+ standard plus the 2003 technical corrigendum and some
  additional defect reports. Same as \fB\-ansi\fR for \*(C+ code.
  .IP "\fBgnu++98\fR" 4
  .IX Item "gnu++98"
--- 1767,1773 ----
  .IP "\fBc++03\fR" 4
  .IX Item "c++03"
  .PD
! The 1998 \s-1ISO \*(C+\s0 standard plus the 2003 technical corrigendum and some
  additional defect reports. Same as \fB\-ansi\fR for \*(C+ code.
  .IP "\fBgnu++98\fR" 4
  .IX Item "gnu++98"
*************** additional defect reports. Same as \fB\-
*** 1785,1791 ****
  .IP "\fBc++0x\fR" 4
  .IX Item "c++0x"
  .PD
! The 2011 \s-1ISO\s0 \*(C+ standard plus amendments.
  The name \fBc++0x\fR is deprecated.
  .IP "\fBgnu++11\fR" 4
  .IX Item "gnu++11"
--- 1783,1789 ----
  .IP "\fBc++0x\fR" 4
  .IX Item "c++0x"
  .PD
! The 2011 \s-1ISO \*(C+\s0 standard plus amendments.
  The name \fBc++0x\fR is deprecated.
  .IP "\fBgnu++11\fR" 4
  .IX Item "gnu++11"
*************** The name \fBgnu++0x\fR is deprecated.
*** 1801,1807 ****
  .IP "\fBc++1y\fR" 4
  .IX Item "c++1y"
  .PD
! The 2014 \s-1ISO\s0 \*(C+ standard plus amendments.
  The name \fBc++1y\fR is deprecated.
  .IP "\fBgnu++14\fR" 4
  .IX Item "gnu++14"
--- 1799,1805 ----
  .IP "\fBc++1y\fR" 4
  .IX Item "c++1y"
  .PD
! The 2014 \s-1ISO \*(C+\s0 standard plus amendments.
  The name \fBc++1y\fR is deprecated.
  .IP "\fBgnu++14\fR" 4
  .IX Item "gnu++14"
*************** The name \fBc++1y\fR is deprecated.
*** 1813,1819 ****
  The name \fBgnu++1y\fR is deprecated.
  .IP "\fBc++1z\fR" 4
  .IX Item "c++1z"
! The next revision of the \s-1ISO\s0 \*(C+ standard, tentatively planned for
  2017.  Support is highly experimental, and will almost certainly
  change in incompatible ways in future releases.
  .IP "\fBgnu++1z\fR" 4
--- 1811,1817 ----
  The name \fBgnu++1y\fR is deprecated.
  .IP "\fBc++1z\fR" 4
  .IX Item "c++1z"
! The next revision of the \s-1ISO \*(C+\s0 standard, tentatively planned for
  2017.  Support is highly experimental, and will almost certainly
  change in incompatible ways in future releases.
  .IP "\fBgnu++1z\fR" 4
*************** In \*(C+, this switch only affects the \
*** 1875,1881 ****
  use the \fB\-fno\-gnu\-keywords\fR flag instead, which has the same
  effect.  In C99 mode (\fB\-std=c99\fR or \fB\-std=gnu99\fR), this
  switch only affects the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR keywords, since
! \&\f(CW\*(C`inline\*(C'\fR is a standard keyword in \s-1ISO\s0 C99.
  .IP "\fB\-fno\-builtin\fR" 4
  .IX Item "-fno-builtin"
  .PD 0
--- 1873,1879 ----
  use the \fB\-fno\-gnu\-keywords\fR flag instead, which has the same
  effect.  In C99 mode (\fB\-std=c99\fR or \fB\-std=gnu99\fR), this
  switch only affects the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR keywords, since
! \&\f(CW\*(C`inline\*(C'\fR is a standard keyword in \s-1ISO C99.\s0
  .IP "\fB\-fno\-builtin\fR" 4
  .IX Item "-fno-builtin"
  .PD 0
*************** known not to modify global memory.
*** 1903,1909 ****
  With the \fB\-fno\-builtin\-\fR\fIfunction\fR option
  only the built-in function \fIfunction\fR is
  disabled.  \fIfunction\fR must not begin with \fB_\|_builtin_\fR.  If a
! function is named that is not built-in in this version of \s-1GCC\s0, this
  option is ignored.  There is no corresponding
  \&\fB\-fbuiltin\-\fR\fIfunction\fR option; if you wish to enable
  built-in functions selectively when using \fB\-fno\-builtin\fR or
--- 1901,1907 ----
  With the \fB\-fno\-builtin\-\fR\fIfunction\fR option
  only the built-in function \fIfunction\fR is
  disabled.  \fIfunction\fR must not begin with \fB_\|_builtin_\fR.  If a
! function is named that is not built-in in this version of \s-1GCC,\s0 this
  option is ignored.  There is no corresponding
  \&\fB\-fbuiltin\-\fR\fIfunction\fR option; if you wish to enable
  built-in functions selectively when using \fB\-fno\-builtin\fR or
*************** implies \fB\-pthread\fR, and thus is onl
*** 1937,1943 ****
  have support for \fB\-pthread\fR.
  .Sp
  Note that this is an experimental feature, incomplete, and subject to
! change in future versions of \s-1GCC\s0.  See
  <\fBhttps://gcc.gnu.org/wiki/OpenACC\fR> for more information.
  .IP "\fB\-fopenmp\fR" 4
  .IX Item "-fopenmp"
--- 1935,1941 ----
  have support for \fB\-pthread\fR.
  .Sp
  Note that this is an experimental feature, incomplete, and subject to
! change in future versions of \s-1GCC.\s0  See
  <\fBhttps://gcc.gnu.org/wiki/OpenACC\fR> for more information.
  .IP "\fB\-fopenmp\fR" 4
  .IX Item "-fopenmp"
*************** When the option \fB\-fgnu\-tm\fR is spec
*** 1969,1975 ****
  generates code for the Linux variant of Intel's current Transactional
  Memory \s-1ABI\s0 specification document (Revision 1.1, May 6 2009).  This is
  an experimental feature whose interface may change in future versions
! of \s-1GCC\s0, as the official specification changes.  Please note that not
  all architectures are supported for this feature.
  .Sp
  For more information on \s-1GCC\s0's support for transactional memory,
--- 1967,1973 ----
  generates code for the Linux variant of Intel's current Transactional
  Memory \s-1ABI\s0 specification document (Revision 1.1, May 6 2009).  This is
  an experimental feature whose interface may change in future versions
! of \s-1GCC,\s0 as the official specification changes.  Please note that not
  all architectures are supported for this feature.
  .Sp
  For more information on \s-1GCC\s0's support for transactional memory,
*************** fields declared using a typedef.    This
*** 2006,2013 ****
  supported for C, not \*(C+.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
! Support \s-1ISO\s0 C trigraphs.  The \fB\-ansi\fR option (and \fB\-std\fR
! options for strict \s-1ISO\s0 C conformance) implies \fB\-trigraphs\fR.
  .IP "\fB\-traditional\fR" 4
  .IX Item "-traditional"
  .PD 0
--- 2004,2011 ----
  supported for C, not \*(C+.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
! Support \s-1ISO C\s0 trigraphs.  The \fB\-ansi\fR option (and \fB\-std\fR
! options for strict \s-1ISO C\s0 conformance) implies \fB\-trigraphs\fR.
  .IP "\fB\-traditional\fR" 4
  .IX Item "-traditional"
  .PD 0
*************** options for strict \s-1ISO\s0 C conforma
*** 2016,2023 ****
  .PD
  Formerly, these options caused \s-1GCC\s0 to attempt to emulate a pre-standard
  C compiler.  They are now only supported with the \fB\-E\fR switch.
! The preprocessor continues to support a pre-standard mode.  See the \s-1GNU\s0
! \&\s-1CPP\s0 manual for details.
  .IP "\fB\-fcond\-mismatch\fR" 4
  .IX Item "-fcond-mismatch"
  Allow conditional expressions with mismatched types in the second and
--- 2014,2021 ----
  .PD
  Formerly, these options caused \s-1GCC\s0 to attempt to emulate a pre-standard
  C compiler.  They are now only supported with the \fB\-E\fR switch.
! The preprocessor continues to support a pre-standard mode.  See the \s-1GNU
! CPP\s0 manual for details.
  .IP "\fB\-fcond\-mismatch\fR" 4
  .IX Item "-fcond-mismatch"
  Allow conditional expressions with mismatched types in the second and
*************** These options control whether a bit-fiel
*** 2067,2074 ****
  declaration does not use either \f(CW\*(C`signed\*(C'\fR or \f(CW\*(C`unsigned\*(C'\fR.  By
  default, such a bit-field is signed, because this is consistent: the
  basic integer types such as \f(CW\*(C`int\*(C'\fR are signed types.
! .Sh "Options Controlling \*(C+ Dialect"
! .IX Subsection "Options Controlling  Dialect"
  This section describes the command-line options that are only meaningful
  for \*(C+ programs.  You can also use most of the \s-1GNU\s0 compiler options
  regardless of what language your program is in.  For example, you
--- 2065,2072 ----
  declaration does not use either \f(CW\*(C`signed\*(C'\fR or \f(CW\*(C`unsigned\*(C'\fR.  By
  default, such a bit-field is signed, because this is consistent: the
  basic integer types such as \f(CW\*(C`int\*(C'\fR are signed types.
! .SS "Options Controlling \*(C+ Dialect"
! .IX Subsection "Options Controlling Dialect"
  This section describes the command-line options that are only meaningful
  for \*(C+ programs.  You can also use most of the \s-1GNU\s0 compiler options
  regardless of what language your program is in.  For example, you
*************** might compile a file \fIfirstClass.C\fR
*** 2080,2091 ****
  .PP
  In this example, only \fB\-frepo\fR is an option meant
  only for \*(C+ programs; you can use the other options with any
! language supported by \s-1GCC\s0.
  .PP
  Here is a list of options that are \fIonly\fR for compiling \*(C+ programs:
  .IP "\fB\-fabi\-version=\fR\fIn\fR" 4
  .IX Item "-fabi-version=n"
! Use version \fIn\fR of the \*(C+ \s-1ABI\s0.  The default is version 0.
  .Sp
  Version 0 refers to the version conforming most closely to
  the \*(C+ \s-1ABI\s0 specification.  Therefore, the \s-1ABI\s0 obtained using version 0
--- 2078,2089 ----
  .PP
  In this example, only \fB\-frepo\fR is an option meant
  only for \*(C+ programs; you can use the other options with any
! language supported by \s-1GCC.\s0
  .PP
  Here is a list of options that are \fIonly\fR for compiling \*(C+ programs:
  .IP "\fB\-fabi\-version=\fR\fIn\fR" 4
  .IX Item "-fabi-version=n"
! Use version \fIn\fR of the \*(C+ \s-1ABI.\s0  The default is version 0.
  .Sp
  Version 0 refers to the version conforming most closely to
  the \*(C+ \s-1ABI\s0 specification.  Therefore, the \s-1ABI\s0 obtained using version 0
*************** Inject friend functions into the enclosi
*** 2182,2188 ****
  visible outside the scope of the class in which they are declared.
  Friend functions were documented to work this way in the old Annotated
  \&\*(C+ Reference Manual.  
! However, in \s-1ISO\s0 \*(C+ a friend function that is not declared
  in an enclosing scope can only be found using argument dependent
  lookup.  \s-1GCC\s0 defaults to the standard behavior.
  .Sp
--- 2180,2186 ----
  visible outside the scope of the class in which they are declared.
  Friend functions were documented to work this way in the old Annotated
  \&\*(C+ Reference Manual.  
! However, in \s-1ISO \*(C+\s0 a friend function that is not declared
  in an enclosing scope can only be found using argument dependent
  lookup.  \s-1GCC\s0 defaults to the standard behavior.
  .Sp
*************** controlled by \f(CW\*(C`#pragma implemen
*** 2265,2276 ****
  errors if these functions are not inlined everywhere they are called.
  .IP "\fB\-fms\-extensions\fR" 4
  .IX Item "-fms-extensions"
! Disable Wpedantic warnings about constructs used in \s-1MFC\s0, such as implicit
  int and getting a pointer to member function via non-standard syntax.
  .IP "\fB\-fno\-nonansi\-builtins\fR" 4
  .IX Item "-fno-nonansi-builtins"
  Disable built-in declarations of functions that are not mandated by
! \&\s-1ANSI/ISO\s0 C.  These include \f(CW\*(C`ffs\*(C'\fR, \f(CW\*(C`alloca\*(C'\fR, \f(CW\*(C`_exit\*(C'\fR,
  \&\f(CW\*(C`index\*(C'\fR, \f(CW\*(C`bzero\*(C'\fR, \f(CW\*(C`conjf\*(C'\fR, and other related functions.
  .IP "\fB\-fnothrow\-opt\fR" 4
  .IX Item "-fnothrow-opt"
--- 2263,2274 ----
  errors if these functions are not inlined everywhere they are called.
  .IP "\fB\-fms\-extensions\fR" 4
  .IX Item "-fms-extensions"
! Disable Wpedantic warnings about constructs used in \s-1MFC,\s0 such as implicit
  int and getting a pointer to member function via non-standard syntax.
  .IP "\fB\-fno\-nonansi\-builtins\fR" 4
  .IX Item "-fno-nonansi-builtins"
  Disable built-in declarations of functions that are not mandated by
! \&\s-1ANSI/ISO C.\s0  These include \f(CW\*(C`ffs\*(C'\fR, \f(CW\*(C`alloca\*(C'\fR, \f(CW\*(C`_exit\*(C'\fR,
  \&\f(CW\*(C`index\*(C'\fR, \f(CW\*(C`bzero\*(C'\fR, \f(CW\*(C`conjf\*(C'\fR, and other related functions.
  .IP "\fB\-fnothrow\-opt\fR" 4
  .IX Item "-fnothrow-opt"
*************** warning or error to \fIn\fR.  The defaul
*** 2358,2364 ****
  .IX Item "-ftemplate-depth=n"
  Set the maximum instantiation depth for template classes to \fIn\fR.
  A limit on the template instantiation depth is needed to detect
! endless recursions during template class instantiation.  \s-1ANSI/ISO\s0 \*(C+
  conforming programs must not rely on a maximum depth greater than 17
  (changed to 1024 in \*(C+11).  The default value is 900, as the compiler
  can run out of stack space before hitting 1024 in some situations.
--- 2356,2362 ----
  .IX Item "-ftemplate-depth=n"
  Set the maximum instantiation depth for template classes to \fIn\fR.
  A limit on the template instantiation depth is needed to detect
! endless recursions during template class instantiation.  \s-1ANSI/ISO \*(C+\s0
  conforming programs must not rely on a maximum depth greater than 17
  (changed to 1024 in \*(C+11).  The default value is 900, as the compiler
  can run out of stack space before hitting 1024 in some situations.
*************** are taken in different shared objects.
*** 2389,2395 ****
  The effect of this is that \s-1GCC\s0 may, effectively, mark inline methods with
  \&\f(CW\*(C`_\|_attribute_\|_ ((visibility ("hidden")))\*(C'\fR so that they do not
  appear in the export table of a \s-1DSO\s0 and do not require a \s-1PLT\s0 indirection
! when used within the \s-1DSO\s0.  Enabling this option can have a dramatic effect
  on load and link times of a \s-1DSO\s0 as it massively reduces the size of the
  dynamic export table when the library makes heavy use of templates.
  .Sp
--- 2387,2393 ----
  The effect of this is that \s-1GCC\s0 may, effectively, mark inline methods with
  \&\f(CW\*(C`_\|_attribute_\|_ ((visibility ("hidden")))\*(C'\fR so that they do not
  appear in the export table of a \s-1DSO\s0 and do not require a \s-1PLT\s0 indirection
! when used within the \s-1DSO.\s0  Enabling this option can have a dramatic effect
  on load and link times of a \s-1DSO\s0 as it massively reduces the size of the
  dynamic export table when the library makes heavy use of templates.
  .Sp
*************** is used when building the \*(C+ library.
*** 2509,2518 ****
  In addition, these optimization, warning, and code generation options
  have meanings only for \*(C+ programs:
  .IP "\fB\-Wabi\fR (C, Objective-C, \*(C+ and Objective\-\*(C+ only)" 4
! .IX Item "-Wabi (C, Objective-C,  and Objective- only)"
  When an explicit \fB\-fabi\-version=\fR\fIn\fR option is used, causes
  G++ to warn when it generates code that is probably not compatible with the
! vendor-neutral \*(C+ \s-1ABI\s0.  Since G++ now defaults to
  \&\fB\-fabi\-version=0\fR, \fB\-Wabi\fR has no effect unless either
  an older \s-1ABI\s0 version is selected (with \fB\-fabi\-version=\fR\fIn\fR)
  or an older compatibility version is selected (with
--- 2507,2516 ----
  In addition, these optimization, warning, and code generation options
  have meanings only for \*(C+ programs:
  .IP "\fB\-Wabi\fR (C, Objective-C, \*(C+ and Objective\-\*(C+ only)" 4
! .IX Item "-Wabi (C, Objective-C, and Objective- only)"
  When an explicit \fB\-fabi\-version=\fR\fIn\fR option is used, causes
  G++ to warn when it generates code that is probably not compatible with the
! vendor-neutral \*(C+ \s-1ABI.\s0  Since G++ now defaults to
  \&\fB\-fabi\-version=0\fR, \fB\-Wabi\fR has no effect unless either
  an older \s-1ABI\s0 version is selected (with \fB\-fabi\-version=\fR\fIn\fR)
  or an older compatibility version is selected (with
*************** level, e.g. \fB\-Wabi=2\fR to warn about
*** 2535,2541 ****
  \&\fB\-fabi\-compat\-version=\fR\fIn\fR.
  .Sp
  The known incompatibilities in \fB\-fabi\-version=2\fR (which was the
! default from \s-1GCC\s0 3.4 to 4.9) include:
  .RS 4
  .IP "*" 4
  A template with a non-type template parameter of reference type was
--- 2533,2539 ----
  \&\fB\-fabi\-compat\-version=\fR\fIn\fR.
  .Sp
  The known incompatibilities in \fB\-fabi\-version=2\fR (which was the
! default from \s-1GCC 3.4\s0 to 4.9) include:
  .RS 4
  .IP "*" 4
  A template with a non-type template parameter of reference type was
*************** These mangling issues were fixed in \fB\
*** 2563,2569 ****
  Scoped enumerators passed as arguments to a variadic function are
  promoted like unscoped enumerators, causing \f(CW\*(C`va_arg\*(C'\fR to complain.
  On most targets this does not actually affect the parameter passing
! \&\s-1ABI\s0, as there is no way to pass an argument smaller than \f(CW\*(C`int\*(C'\fR.
  .Sp
  Also, the \s-1ABI\s0 changed the mangling of template argument packs,
  \&\f(CW\*(C`const_cast\*(C'\fR, \f(CW\*(C`static_cast\*(C'\fR, prefix increment/decrement, and
--- 2561,2567 ----
  Scoped enumerators passed as arguments to a variadic function are
  promoted like unscoped enumerators, causing \f(CW\*(C`va_arg\*(C'\fR to complain.
  On most targets this does not actually affect the parameter passing
! \&\s-1ABI,\s0 as there is no way to pass an argument smaller than \f(CW\*(C`int\*(C'\fR.
  .Sp
  Also, the \s-1ABI\s0 changed the mangling of template argument packs,
  \&\f(CW\*(C`const_cast\*(C'\fR, \f(CW\*(C`static_cast\*(C'\fR, prefix increment/decrement, and
*************** When mangling a function type with funct
*** 2580,2593 ****
  un-qualified function type was incorrectly treated as a substitution
  candidate.
  .Sp
! This was fixed in \fB\-fabi\-version=8\fR, the default for \s-1GCC\s0 5.1.
  .IP "*" 4
  \&\f(CW\*(C`decltype(nullptr)\*(C'\fR incorrectly had an alignment of 1, leading to
  unaligned accesses.  Note that this did not affect the \s-1ABI\s0 of a
  function with a \f(CW\*(C`nullptr_t\*(C'\fR parameter, as parameters have a
  minimum alignment.
  .Sp
! This was fixed in \fB\-fabi\-version=9\fR, the default for \s-1GCC\s0 5.2.
  .RE
  .RS 4
  .Sp
--- 2578,2591 ----
  un-qualified function type was incorrectly treated as a substitution
  candidate.
  .Sp
! This was fixed in \fB\-fabi\-version=8\fR, the default for \s-1GCC 5.1.\s0
  .IP "*" 4
  \&\f(CW\*(C`decltype(nullptr)\*(C'\fR incorrectly had an alignment of 1, leading to
  unaligned accesses.  Note that this did not affect the \s-1ABI\s0 of a
  function with a \f(CW\*(C`nullptr_t\*(C'\fR parameter, as parameters have a
  minimum alignment.
  .Sp
! This was fixed in \fB\-fabi\-version=9\fR, the default for \s-1GCC 5.2.\s0
  .RE
  .RS 4
  .Sp
*************** This is on by default for all pre\-\*(C+
*** 2703,2709 ****
  \&\fB\-std=c++98\fR, \fB\-std=gnu++98\fR, \fB\-std=gnu++11\fR,
  \&\fB\-std=gnu++14\fR.
  This option is off by default
! for \s-1ISO\s0 \*(C+11 onwards (\fB\-std=c++11\fR, ...).
  .PP
  The following \fB\-W...\fR options are not affected by \fB\-Wall\fR.
  .IP "\fB\-Weffc++\fR (\*(C+ and Objective\-\*(C+ only)" 4
--- 2701,2707 ----
  \&\fB\-std=c++98\fR, \fB\-std=gnu++98\fR, \fB\-std=gnu++11\fR,
  \&\fB\-std=gnu++14\fR.
  This option is off by default
! for \s-1ISO \*(C+11\s0 onwards (\fB\-std=c++11\fR, ...).
  .PP
  The following \fB\-W...\fR options are not affected by \fB\-Wall\fR.
  .IP "\fB\-Weffc++\fR (\*(C+ and Objective\-\*(C+ only)" 4
*************** Warn when overload resolution chooses a
*** 2799,2805 ****
  enumerated type to a signed type, over a conversion to an unsigned type of
  the same size.  Previous versions of G++ tried to preserve
  unsignedness, but the standard mandates the current behavior.
! .Sh "Options Controlling Objective-C and Objective\-\*(C+ Dialects"
  .IX Subsection "Options Controlling Objective-C and Objective- Dialects"
  (\s-1NOTE:\s0 This manual does not describe the Objective-C and Objective\-\*(C+
  languages themselves.
--- 2797,2803 ----
  enumerated type to a signed type, over a conversion to an unsigned type of
  the same size.  Previous versions of G++ tried to preserve
  unsignedness, but the standard mandates the current behavior.
! .SS "Options Controlling Objective-C and Objective\-\*(C+ Dialects"
  .IX Subsection "Options Controlling Objective-C and Objective- Dialects"
  (\s-1NOTE:\s0 This manual does not describe the Objective-C and Objective\-\*(C+
  languages themselves.
*************** For example, you might compile a file \f
*** 2815,2821 ****
  .PP
  In this example, \fB\-fgnu\-runtime\fR is an option meant only for
  Objective-C and Objective\-\*(C+ programs; you can use the other options with
! any language supported by \s-1GCC\s0.
  .PP
  Note that since Objective-C is an extension of the C language, Objective-C
  compilations may also use options specific to the C front-end (e.g.,
--- 2813,2819 ----
  .PP
  In this example, \fB\-fgnu\-runtime\fR is an option meant only for
  Objective-C and Objective\-\*(C+ programs; you can use the other options with
! any language supported by \s-1GCC.\s0
  .PP
  Note that since Objective-C is an extension of the C language, Objective-C
  compilations may also use options specific to the C front-end (e.g.,
*************** runtime.  This is the default for most t
*** 2840,2846 ****
  .IP "\fB\-fnext\-runtime\fR" 4
  .IX Item "-fnext-runtime"
  Generate output compatible with the NeXT runtime.  This is the default
! for NeXT-based systems, including Darwin and Mac \s-1OS\s0 X.  The macro
  \&\f(CW\*(C`_\|_NEXT_RUNTIME_\|_\*(C'\fR is predefined if (and only if) this option is
  used.
  .IP "\fB\-fno\-nil\-receivers\fR" 4
--- 2838,2844 ----
  .IP "\fB\-fnext\-runtime\fR" 4
  .IX Item "-fnext-runtime"
  Generate output compatible with the NeXT runtime.  This is the default
! for NeXT-based systems, including Darwin and Mac \s-1OS X.\s0  The macro
  \&\f(CW\*(C`_\|_NEXT_RUNTIME_\|_\*(C'\fR is predefined if (and only if) this option is
  used.
  .IP "\fB\-fno\-nil\-receivers\fR" 4
*************** This option is currently supported only
*** 2857,2863 ****
  case, Version 0 is the traditional (32\-bit) \s-1ABI\s0 without support for
  properties and other Objective-C 2.0 additions.  Version 1 is the
  traditional (32\-bit) \s-1ABI\s0 with support for properties and other
! Objective-C 2.0 additions.  Version 2 is the modern (64\-bit) \s-1ABI\s0.  If
  nothing is specified, the default is Version 0 on 32\-bit target
  machines, and Version 2 on 64\-bit target machines.
  .IP "\fB\-fobjc\-call\-cxx\-cdtors\fR" 4
--- 2855,2861 ----
  case, Version 0 is the traditional (32\-bit) \s-1ABI\s0 without support for
  properties and other Objective-C 2.0 additions.  Version 1 is the
  traditional (32\-bit) \s-1ABI\s0 with support for properties and other
! Objective-C 2.0 additions.  Version 2 is the modern (64\-bit) \s-1ABI.\s0  If
  nothing is specified, the default is Version 0 on 32\-bit target
  machines, and Version 2 on 64\-bit target machines.
  .IP "\fB\-fobjc\-call\-cxx\-cdtors\fR" 4
*************** by the runtime immediately after a new o
*** 2881,2887 ****
  the \f(CW\*(C`\- (void) .cxx_destruct\*(C'\fR methods are invoked immediately
  before the runtime deallocates an object instance.
  .Sp
! As of this writing, only the NeXT runtime on Mac \s-1OS\s0 X 10.4 and later has
  support for invoking the \f(CW\*(C`\- (id) .cxx_construct\*(C'\fR and
  \&\f(CW\*(C`\- (void) .cxx_destruct\*(C'\fR methods.
  .IP "\fB\-fobjc\-direct\-dispatch\fR" 4
--- 2879,2885 ----
  the \f(CW\*(C`\- (void) .cxx_destruct\*(C'\fR methods are invoked immediately
  before the runtime deallocates an object instance.
  .Sp
! As of this writing, only the NeXT runtime on Mac \s-1OS X 10.4\s0 and later has
  support for invoking the \f(CW\*(C`\- (id) .cxx_construct\*(C'\fR and
  \&\f(CW\*(C`\- (void) .cxx_destruct\*(C'\fR methods.
  .IP "\fB\-fobjc\-direct\-dispatch\fR" 4
*************** is required to use the Objective-C keywo
*** 2896,2902 ****
  \&\f(CW@throw\fR, \f(CW@catch\fR, \f(CW@finally\fR and
  \&\f(CW@synchronized\fR.  This option is available with both the \s-1GNU\s0
  runtime and the NeXT runtime (but not available in conjunction with
! the NeXT runtime on Mac \s-1OS\s0 X 10.2 and earlier).
  .IP "\fB\-fobjc\-gc\fR" 4
  .IX Item "-fobjc-gc"
  Enable garbage collection (\s-1GC\s0) in Objective-C and Objective\-\*(C+
--- 2894,2900 ----
  \&\f(CW@throw\fR, \f(CW@catch\fR, \f(CW@finally\fR and
  \&\f(CW@synchronized\fR.  This option is available with both the \s-1GNU\s0
  runtime and the NeXT runtime (but not available in conjunction with
! the NeXT runtime on Mac \s-1OS X 10.2\s0 and earlier).
  .IP "\fB\-fobjc\-gc\fR" 4
  .IX Item "-fobjc-gc"
  Enable garbage collection (\s-1GC\s0) in Objective-C and Objective\-\*(C+
*************** programs.  This option is only available
*** 2905,2927 ****
  does not require special compiler flags.
  .IP "\fB\-fobjc\-nilcheck\fR" 4
  .IX Item "-fobjc-nilcheck"
! For the NeXT runtime with version 2 of the \s-1ABI\s0, check for a nil
  receiver in method invocations before doing the actual method call.
  This is the default and can be disabled using
  \&\fB\-fno\-objc\-nilcheck\fR.  Class methods and super calls are never
  checked for nil in this way no matter what this flag is set to.
  Currently this flag does nothing when the \s-1GNU\s0 runtime, or an older
! version of the NeXT runtime \s-1ABI\s0, is used.
  .IP "\fB\-fobjc\-std=objc1\fR" 4
  .IX Item "-fobjc-std=objc1"
  Conform to the language syntax of Objective-C 1.0, the language
! recognized by \s-1GCC\s0 4.0.  This only affects the Objective-C additions to
  the C/\*(C+ language; it does not affect conformance to C/\*(C+ standards,
  which is controlled by the separate C/\*(C+ dialect option flags.  When
  this option is used with the Objective-C or Objective\-\*(C+ compiler,
! any Objective-C syntax that is not recognized by \s-1GCC\s0 4.0 is rejected.
  This is useful if you need to make sure that your Objective-C code can
! be compiled with older versions of \s-1GCC\s0.
  .IP "\fB\-freplace\-objc\-classes\fR" 4
  .IX Item "-freplace-objc-classes"
  Emit a special marker instructing \fB\f(BIld\fB\|(1)\fR not to statically link in
--- 2903,2925 ----
  does not require special compiler flags.
  .IP "\fB\-fobjc\-nilcheck\fR" 4
  .IX Item "-fobjc-nilcheck"
! For the NeXT runtime with version 2 of the \s-1ABI,\s0 check for a nil
  receiver in method invocations before doing the actual method call.
  This is the default and can be disabled using
  \&\fB\-fno\-objc\-nilcheck\fR.  Class methods and super calls are never
  checked for nil in this way no matter what this flag is set to.
  Currently this flag does nothing when the \s-1GNU\s0 runtime, or an older
! version of the NeXT runtime \s-1ABI,\s0 is used.
  .IP "\fB\-fobjc\-std=objc1\fR" 4
  .IX Item "-fobjc-std=objc1"
  Conform to the language syntax of Objective-C 1.0, the language
! recognized by \s-1GCC 4.0.\s0  This only affects the Objective-C additions to
  the C/\*(C+ language; it does not affect conformance to C/\*(C+ standards,
  which is controlled by the separate C/\*(C+ dialect option flags.  When
  this option is used with the Objective-C or Objective\-\*(C+ compiler,
! any Objective-C syntax that is not recognized by \s-1GCC 4.0\s0 is rejected.
  This is useful if you need to make sure that your Objective-C code can
! be compiled with older versions of \s-1GCC.\s0
  .IP "\fB\-freplace\-objc\-classes\fR" 4
  .IX Item "-freplace-objc-classes"
  Emit a special marker instructing \fB\f(BIld\fB\|(1)\fR not to statically link in
*************** run time instead.  This is used in conju
*** 2930,2936 ****
  debugging mode, where the object file in question may be recompiled and
  dynamically reloaded in the course of program execution, without the need
  to restart the program itself.  Currently, Fix-and-Continue functionality
! is only available in conjunction with the NeXT runtime on Mac \s-1OS\s0 X 10.3
  and later.
  .IP "\fB\-fzero\-link\fR" 4
  .IX Item "-fzero-link"
--- 2928,2934 ----
  debugging mode, where the object file in question may be recompiled and
  dynamically reloaded in the course of program execution, without the need
  to restart the program itself.  Currently, Fix-and-Continue functionality
! is only available in conjunction with the NeXT runtime on Mac \s-1OS X 10.3\s0
  and later.
  .IP "\fB\-fzero\-link\fR" 4
  .IX Item "-fzero-link"
*************** that methods and selectors must be decla
*** 3009,3015 ****
  .IX Item "-print-objc-runtime-info"
  Generate C header describing the largest structure that is passed by
  value, if any.
! .Sh "Options to Control Diagnostic Messages Formatting"
  .IX Subsection "Options to Control Diagnostic Messages Formatting"
  Traditionally, diagnostic messages have been formatted irrespective of
  the output device's aspect (e.g. its width, ...).  You can use the
--- 3007,3013 ----
  .IX Item "-print-objc-runtime-info"
  Generate C header describing the largest structure that is passed by
  value, if any.
! .SS "Options to Control Diagnostic Messages Formatting"
  .IX Subsection "Options to Control Diagnostic Messages Formatting"
  Traditionally, diagnostic messages have been formatted irrespective of
  the output device's aspect (e.g. its width, ...).  You can use the
*************** information.  The source line is truncat
*** 3131,3144 ****
  the \fB\-fmessage\-length=n\fR option is given.  When the output is done
  to the terminal, the width is limited to the width given by the
  \&\fB\s-1COLUMNS\s0\fR environment variable or, if not set, to the terminal width.
! .Sh "Options to Request or Suppress Warnings"
  .IX Subsection "Options to Request or Suppress Warnings"
  Warnings are diagnostic messages that report constructions that
  are not inherently erroneous but that are risky or suggest there
  may have been an error.
  .PP
  The following language-independent options do not enable specific
! warnings but control the kinds of diagnostics produced by \s-1GCC\s0.
  .IP "\fB\-fsyntax\-only\fR" 4
  .IX Item "-fsyntax-only"
  Check the code for syntax errors, but don't do anything beyond that.
--- 3129,3142 ----
  the \fB\-fmessage\-length=n\fR option is given.  When the output is done
  to the terminal, the width is limited to the width given by the
  \&\fB\s-1COLUMNS\s0\fR environment variable or, if not set, to the terminal width.
! .SS "Options to Request or Suppress Warnings"
  .IX Subsection "Options to Request or Suppress Warnings"
  Warnings are diagnostic messages that report constructions that
  are not inherently erroneous but that are risky or suggest there
  may have been an error.
  .PP
  The following language-independent options do not enable specific
! warnings but control the kinds of diagnostics produced by \s-1GCC.\s0
  .IP "\fB\-fsyntax\-only\fR" 4
  .IX Item "-fsyntax-only"
  Check the code for syntax errors, but don't do anything beyond that.
*************** warns that an unrecognized option is pre
*** 3213,3226 ****
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  .PD
! Issue all the warnings demanded by strict \s-1ISO\s0 C and \s-1ISO\s0 \*(C+;
  reject all programs that use forbidden extensions, and some other
! programs that do not follow \s-1ISO\s0 C and \s-1ISO\s0 \*(C+.  For \s-1ISO\s0 C, follows the
! version of the \s-1ISO\s0 C standard specified by any \fB\-std\fR option used.
  .Sp
! Valid \s-1ISO\s0 C and \s-1ISO\s0 \*(C+ programs should compile properly with or without
  this option (though a rare few require \fB\-ansi\fR or a
! \&\fB\-std\fR option specifying the required version of \s-1ISO\s0 C).  However,
  without this option, certain \s-1GNU\s0 extensions and traditional C and \*(C+
  features are supported as well.  With this option, they are rejected.
  .Sp
--- 3211,3224 ----
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  .PD
! Issue all the warnings demanded by strict \s-1ISO C\s0 and \s-1ISO \*(C+\s0;
  reject all programs that use forbidden extensions, and some other
! programs that do not follow \s-1ISO C\s0 and \s-1ISO \*(C+.\s0  For \s-1ISO C,\s0 follows the
! version of the \s-1ISO C\s0 standard specified by any \fB\-std\fR option used.
  .Sp
! Valid \s-1ISO C\s0 and \s-1ISO \*(C+\s0 programs should compile properly with or without
  this option (though a rare few require \fB\-ansi\fR or a
! \&\fB\-std\fR option specifying the required version of \s-1ISO C\s0).  However,
  without this option, certain \s-1GNU\s0 extensions and traditional C and \*(C+
  features are supported as well.  With this option, they are rejected.
  .Sp
*************** warnings are also disabled in the expres
*** 3230,3253 ****
  \&\f(CW\*(C`_\|_extension_\|_\*(C'\fR.  However, only system header files should use
  these escape routes; application programs should avoid them.
  .Sp
! Some users try to use \fB\-Wpedantic\fR to check programs for strict \s-1ISO\s0
! C conformance.  They soon find that it does not do quite what they want:
  it finds some non-ISO practices, but not all\-\-\-only those for which
! \&\s-1ISO\s0 C \fIrequires\fR a diagnostic, and some others for which
  diagnostics have been added.
  .Sp
! A feature to report any failure to conform to \s-1ISO\s0 C might be useful in
  some instances, but would require considerable additional work and would
  be quite different from \fB\-Wpedantic\fR.  We don't have plans to
  support such a feature in the near future.
  .Sp
  Where the standard specified with \fB\-std\fR represents a \s-1GNU\s0
  extended dialect of C, such as \fBgnu90\fR or \fBgnu99\fR, there is a
! corresponding \fIbase standard\fR, the version of \s-1ISO\s0 C on which the \s-1GNU\s0
  extended dialect is based.  Warnings from \fB\-Wpedantic\fR are given
  where they are required by the base standard.  (It does not make sense
! for such warnings to be given only for features not in the specified \s-1GNU\s0
! C dialect, since by definition the \s-1GNU\s0 dialects of C include all
  features the compiler supports with the given option, and there would be
  nothing to warn about.)
  .IP "\fB\-pedantic\-errors\fR" 4
--- 3228,3251 ----
  \&\f(CW\*(C`_\|_extension_\|_\*(C'\fR.  However, only system header files should use
  these escape routes; application programs should avoid them.
  .Sp
! Some users try to use \fB\-Wpedantic\fR to check programs for strict \s-1ISO
! C\s0 conformance.  They soon find that it does not do quite what they want:
  it finds some non-ISO practices, but not all\-\-\-only those for which
! \&\s-1ISO C\s0 \fIrequires\fR a diagnostic, and some others for which
  diagnostics have been added.
  .Sp
! A feature to report any failure to conform to \s-1ISO C\s0 might be useful in
  some instances, but would require considerable additional work and would
  be quite different from \fB\-Wpedantic\fR.  We don't have plans to
  support such a feature in the near future.
  .Sp
  Where the standard specified with \fB\-std\fR represents a \s-1GNU\s0
  extended dialect of C, such as \fBgnu90\fR or \fBgnu99\fR, there is a
! corresponding \fIbase standard\fR, the version of \s-1ISO C\s0 on which the \s-1GNU\s0
  extended dialect is based.  Warnings from \fB\-Wpedantic\fR are given
  where they are required by the base standard.  (It does not make sense
! for such warnings to be given only for features not in the specified \s-1GNU
! C\s0 dialect, since by definition the \s-1GNU\s0 dialects of C include all
  features the compiler supports with the given option, and there would be
  nothing to warn about.)
  .IP "\fB\-pedantic\-errors\fR" 4
*************** This warning is enabled by \fB\-Wall\fR.
*** 3359,3364 ****
--- 3357,3366 ----
  Warn whenever a comment-start sequence \fB/*\fR appears in a \fB/*\fR
  comment, or whenever a Backslash-Newline appears in a \fB//\fR comment.
  This warning is enabled by \fB\-Wall\fR.
+ .IP "\fB\-Wchkp\fR" 4
+ .IX Item "-Wchkp"
+ Warn about an invalid memory access that is found by Pointer Bounds Checker
+ (\fB\-fcheck\-pointer\-bounds\fR).
  .IP "\fB\-Wno\-coverage\-mismatch\fR" 4
  .IX Item "-Wno-coverage-mismatch"
  Warn if feedback profiles do not match when using the
*************** functions without the attribute specifie
*** 3419,3425 ****
  \&\fB\-ffreestanding\fR or \fB\-fno\-builtin\fR.
  .Sp
  The formats are checked against the format features supported by \s-1GNU\s0
! libc version 2.2.  These include all \s-1ISO\s0 C90 and C99 features, as well
  as features from the Single Unix Specification and some \s-1BSD\s0 and \s-1GNU\s0
  extensions.  Other library implementations may not support all these
  features; \s-1GCC\s0 does not support warning about features that go beyond a
--- 3421,3427 ----
  \&\fB\-ffreestanding\fR or \fB\-fno\-builtin\fR.
  .Sp
  The formats are checked against the format features supported by \s-1GNU\s0
! libc version 2.2.  These include all \s-1ISO C90\s0 and C99 features, as well
  as features from the Single Unix Specification and some \s-1BSD\s0 and \s-1GNU\s0
  extensions.  Other library implementations may not support all these
  features; \s-1GCC\s0 does not support warning about features that go beyond a
*************** enabled by default and it is made into a
*** 3535,3546 ****
  Same as \fB\-Wimplicit\-int\fR and \fB\-Wimplicit\-function\-declaration\fR.
  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wignored\-qualifiers\fR (C and \*(C+ only)" 4
! .IX Item "-Wignored-qualifiers (C and  only)"
  Warn if the return type of a function has a type qualifier
! such as \f(CW\*(C`const\*(C'\fR.  For \s-1ISO\s0 C such a type qualifier has no effect,
  since the value returned by a function is not an lvalue.
  For \*(C+, the warning is only emitted for scalar types or \f(CW\*(C`void\*(C'\fR.
! \&\s-1ISO\s0 C prohibits qualified \f(CW\*(C`void\*(C'\fR return types on function
  definitions, so such return types always receive a warning
  even without this option.
  .Sp
--- 3537,3548 ----
  Same as \fB\-Wimplicit\-int\fR and \fB\-Wimplicit\-function\-declaration\fR.
  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wignored\-qualifiers\fR (C and \*(C+ only)" 4
! .IX Item "-Wignored-qualifiers (C and only)"
  Warn if the return type of a function has a type qualifier
! such as \f(CW\*(C`const\*(C'\fR.  For \s-1ISO C\s0 such a type qualifier has no effect,
  since the value returned by a function is not an lvalue.
  For \*(C+, the warning is only emitted for scalar types or \f(CW\*(C`void\*(C'\fR.
! \&\s-1ISO C\s0 prohibits qualified \f(CW\*(C`void\*(C'\fR return types on function
  definitions, so such return types always receive a warning
  even without this option.
  .Sp
*************** expression to a type other than \f(CW\*(
*** 3727,3735 ****
  .Sp
  This warning is enabled by default for C and \*(C+ programs.
  .IP "\fB\-Wsync\-nand\fR (C and \*(C+ only)" 4
! .IX Item "-Wsync-nand (C and  only)"
  Warn when \f(CW\*(C`_\|_sync_fetch_and_nand\*(C'\fR and \f(CW\*(C`_\|_sync_nand_and_fetch\*(C'\fR
! built-in functions are used.  These functions changed semantics in \s-1GCC\s0 4.4.
  .IP "\fB\-Wtrigraphs\fR" 4
  .IX Item "-Wtrigraphs"
  Warn if any trigraphs are encountered that might change the meaning of
--- 3729,3737 ----
  .Sp
  This warning is enabled by default for C and \*(C+ programs.
  .IP "\fB\-Wsync\-nand\fR (C and \*(C+ only)" 4
! .IX Item "-Wsync-nand (C and only)"
  Warn when \f(CW\*(C`_\|_sync_fetch_and_nand\*(C'\fR and \f(CW\*(C`_\|_sync_nand_and_fetch\*(C'\fR
! built-in functions are used.  These functions changed semantics in \s-1GCC 4.4.\s0
  .IP "\fB\-Wtrigraphs\fR" 4
  .IX Item "-Wtrigraphs"
  Warn if any trigraphs are encountered that might change the meaning of
*************** This warning is enabled by \fB\-Wall\fR.
*** 3766,3772 ****
  .Sp
  To suppress this warning use the \f(CW\*(C`unused\*(C'\fR attribute.
  .IP "\fB\-Wunused\-local\-typedefs\fR (C, Objective-C, \*(C+ and Objective\-\*(C+ only)" 4
! .IX Item "-Wunused-local-typedefs (C, Objective-C,  and Objective- only)"
  Warn when a typedef locally defined in a function is not used.
  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wunused\-parameter\fR" 4
--- 3768,3774 ----
  .Sp
  To suppress this warning use the \f(CW\*(C`unused\*(C'\fR attribute.
  .IP "\fB\-Wunused\-local\-typedefs\fR (C, Objective-C, \*(C+ and Objective\-\*(C+ only)" 4
! .IX Item "-Wunused-local-typedefs (C, Objective-C, and Objective- only)"
  Warn when a typedef locally defined in a function is not used.
  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wunused\-parameter\fR" 4
*************** This warning is enabled by \fB\-Wall\fR
*** 3873,3879 ****
  .IP "\fB\-Wunknown\-pragmas\fR" 4
  .IX Item "-Wunknown-pragmas"
  Warn when a \f(CW\*(C`#pragma\*(C'\fR directive is encountered that is not understood by 
! \&\s-1GCC\s0.  If this command-line option is used, warnings are even issued
  for unknown pragmas in system header files.  This is not the case if
  the warnings are only enabled by the \fB\-Wall\fR command-line option.
  .IP "\fB\-Wno\-pragmas\fR" 4
--- 3875,3881 ----
  .IP "\fB\-Wunknown\-pragmas\fR" 4
  .IX Item "-Wunknown-pragmas"
  Warn when a \f(CW\*(C`#pragma\*(C'\fR directive is encountered that is not understood by 
! \&\s-1GCC.\s0  If this command-line option is used, warnings are even issued
  for unknown pragmas in system header files.  This is not the case if
  the warnings are only enabled by the \fB\-Wall\fR command-line option.
  .IP "\fB\-Wno\-pragmas\fR" 4
*************** probably mistaken.
*** 4151,4163 ****
  .IP "\fB\-Wtraditional\fR (C and Objective-C only)" 4
  .IX Item "-Wtraditional (C and Objective-C only)"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO\s0 C.  Also warn about \s-1ISO\s0 C constructs that have no traditional C
  equivalent, and/or problematic constructs that should be avoided.
  .RS 4
  .IP "*" 4
  Macro parameters that appear within string literals in the macro body.
  In traditional C macro replacement takes place within string literals,
! but in \s-1ISO\s0 C it does not.
  .IP "*" 4
  In traditional C, some preprocessor directives did not exist.
  Traditional preprocessors only considered a line to be a directive
--- 4153,4165 ----
  .IP "\fB\-Wtraditional\fR (C and Objective-C only)" 4
  .IX Item "-Wtraditional (C and Objective-C only)"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO C.\s0  Also warn about \s-1ISO C\s0 constructs that have no traditional C
  equivalent, and/or problematic constructs that should be avoided.
  .RS 4
  .IP "*" 4
  Macro parameters that appear within string literals in the macro body.
  In traditional C macro replacement takes place within string literals,
! but in \s-1ISO C\s0 it does not.
  .IP "*" 4
  In traditional C, some preprocessor directives did not exist.
  Traditional preprocessors only considered a line to be a directive
*************** versa.  The absence of these prototypes
*** 4212,4220 ****
  C causes serious problems.  This is a subset of the possible
  conversion warnings; for the full set use \fB\-Wtraditional\-conversion\fR.
  .IP "*" 4
! Use of \s-1ISO\s0 C style function definitions.  This warning intentionally is
  \&\fInot\fR issued for prototype declarations or variadic functions
! because these \s-1ISO\s0 C features appear in your code when using
  libiberty's traditional C compatibility macros, \f(CW\*(C`PARAMS\*(C'\fR and
  \&\f(CW\*(C`VPARAMS\*(C'\fR.  This warning is also bypassed for nested functions
  because that feature is already a \s-1GCC\s0 extension and thus not relevant to
--- 4214,4222 ----
  C causes serious problems.  This is a subset of the possible
  conversion warnings; for the full set use \fB\-Wtraditional\-conversion\fR.
  .IP "*" 4
! Use of \s-1ISO C\s0 style function definitions.  This warning intentionally is
  \&\fInot\fR issued for prototype declarations or variadic functions
! because these \s-1ISO C\s0 features appear in your code when using
  libiberty's traditional C compatibility macros, \f(CW\*(C`PARAMS\*(C'\fR and
  \&\f(CW\*(C`VPARAMS\*(C'\fR.  This warning is also bypassed for nested functions
  because that feature is already a \s-1GCC\s0 extension and thus not relevant to
*************** except when the same as the default prom
*** 4232,4239 ****
  .IP "\fB\-Wdeclaration\-after\-statement\fR (C and Objective-C only)" 4
  .IX Item "-Wdeclaration-after-statement (C and Objective-C only)"
  Warn when a declaration is found after a statement in a block.  This
! construct, known from \*(C+, was introduced with \s-1ISO\s0 C99 and is by default
! allowed in \s-1GCC\s0.  It is not supported by \s-1ISO\s0 C90.
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
  Warn if an undefined identifier is evaluated in an \f(CW\*(C`#if\*(C'\fR directive.
--- 4234,4241 ----
  .IP "\fB\-Wdeclaration\-after\-statement\fR (C and Objective-C only)" 4
  .IX Item "-Wdeclaration-after-statement (C and Objective-C only)"
  Warn when a declaration is found after a statement in a block.  This
! construct, known from \*(C+, was introduced with \s-1ISO C99\s0 and is by default
! allowed in \s-1GCC.\s0  It is not supported by \s-1ISO C90.\s0
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
  Warn if an undefined identifier is evaluated in an \f(CW\*(C`#if\*(C'\fR directive.
*************** which depend on the \s-1MS\s0 runtime.
*** 4315,4321 ****
  .IP "\fB\-Wpointer\-arith\fR" 4
  .IX Item "-Wpointer-arith"
  Warn about anything that depends on the \*(L"size of\*(R" a function type or
! of \f(CW\*(C`void\*(C'\fR.  \s-1GNU\s0 C assigns these types a size of 1, for
  convenience in calculations with \f(CW\*(C`void *\*(C'\fR pointers and pointers
  to functions.  In \*(C+, warn also when an arithmetic operation involves
  \&\f(CW\*(C`NULL\*(C'\fR.  This warning is also enabled by \fB\-Wpedantic\fR.
--- 4317,4323 ----
  .IP "\fB\-Wpointer\-arith\fR" 4
  .IX Item "-Wpointer-arith"
  Warn about anything that depends on the \*(L"size of\*(R" a function type or
! of \f(CW\*(C`void\*(C'\fR.  \s-1GNU C\s0 assigns these types a size of 1, for
  convenience in calculations with \f(CW\*(C`void *\*(C'\fR pointers and pointers
  to functions.  In \*(C+, warn also when an arithmetic operation involves
  \&\f(CW\*(C`NULL\*(C'\fR.  This warning is also enabled by \fB\-Wpedantic\fR.
*************** For example, warn if a call to a functio
*** 4333,4346 ****
  is cast to a pointer type.
  .IP "\fB\-Wc90\-c99\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc90-c99-compat (C and Objective-C only)"
! Warn about features not present in \s-1ISO\s0 C90, but present in \s-1ISO\s0 C99.
  For instance, warn about use of variable length arrays, \f(CW\*(C`long long\*(C'\fR
  type, \f(CW\*(C`bool\*(C'\fR type, compound literals, designated initializers, and so
  on.  This option is independent of the standards mode.  Warnings are disabled
  in the expression that follows \f(CW\*(C`_\|_extension_\|_\*(C'\fR.
  .IP "\fB\-Wc99\-c11\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc99-c11-compat (C and Objective-C only)"
! Warn about features not present in \s-1ISO\s0 C99, but present in \s-1ISO\s0 C11.
  For instance, warn about use of anonymous structures and unions,
  \&\f(CW\*(C`_Atomic\*(C'\fR type qualifier, \f(CW\*(C`_Thread_local\*(C'\fR storage-class specifier,
  \&\f(CW\*(C`_Alignas\*(C'\fR specifier, \f(CW\*(C`Alignof\*(C'\fR operator, \f(CW\*(C`_Generic\*(C'\fR keyword,
--- 4335,4348 ----
  is cast to a pointer type.
  .IP "\fB\-Wc90\-c99\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc90-c99-compat (C and Objective-C only)"
! Warn about features not present in \s-1ISO C90,\s0 but present in \s-1ISO C99.\s0
  For instance, warn about use of variable length arrays, \f(CW\*(C`long long\*(C'\fR
  type, \f(CW\*(C`bool\*(C'\fR type, compound literals, designated initializers, and so
  on.  This option is independent of the standards mode.  Warnings are disabled
  in the expression that follows \f(CW\*(C`_\|_extension_\|_\*(C'\fR.
  .IP "\fB\-Wc99\-c11\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc99-c11-compat (C and Objective-C only)"
! Warn about features not present in \s-1ISO C99,\s0 but present in \s-1ISO C11.\s0
  For instance, warn about use of anonymous structures and unions,
  \&\f(CW\*(C`_Atomic\*(C'\fR type qualifier, \f(CW\*(C`_Thread_local\*(C'\fR storage-class specifier,
  \&\f(CW\*(C`_Alignas\*(C'\fR specifier, \f(CW\*(C`Alignof\*(C'\fR operator, \f(CW\*(C`_Generic\*(C'\fR keyword,
*************** and so on.  This option is independent o
*** 4348,4366 ****
  disabled in the expression that follows \f(CW\*(C`_\|_extension_\|_\*(C'\fR.
  .IP "\fB\-Wc++\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc++-compat (C and Objective-C only)"
! Warn about \s-1ISO\s0 C constructs that are outside of the common subset of
! \&\s-1ISO\s0 C and \s-1ISO\s0 \*(C+, e.g. request for implicit conversion from
  \&\f(CW\*(C`void *\*(C'\fR to a pointer to non\-\f(CW\*(C`void\*(C'\fR type.
  .IP "\fB\-Wc++11\-compat\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wc++11-compat ( and Objective- only)"
! Warn about \*(C+ constructs whose meaning differs between \s-1ISO\s0 \*(C+ 1998
! and \s-1ISO\s0 \*(C+ 2011, e.g., identifiers in \s-1ISO\s0 \*(C+ 1998 that are keywords
! in \s-1ISO\s0 \*(C+ 2011.  This warning turns on \fB\-Wnarrowing\fR and is
  enabled by \fB\-Wall\fR.
  .IP "\fB\-Wc++14\-compat\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wc++14-compat ( and Objective- only)"
! Warn about \*(C+ constructs whose meaning differs between \s-1ISO\s0 \*(C+ 2011
! and \s-1ISO\s0 \*(C+ 2014.  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wcast\-qual\fR" 4
  .IX Item "-Wcast-qual"
  Warn whenever a pointer is cast so as to remove a type qualifier from
--- 4350,4368 ----
  disabled in the expression that follows \f(CW\*(C`_\|_extension_\|_\*(C'\fR.
  .IP "\fB\-Wc++\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc++-compat (C and Objective-C only)"
! Warn about \s-1ISO C\s0 constructs that are outside of the common subset of
! \&\s-1ISO C\s0 and \s-1ISO \*(C+,\s0 e.g. request for implicit conversion from
  \&\f(CW\*(C`void *\*(C'\fR to a pointer to non\-\f(CW\*(C`void\*(C'\fR type.
  .IP "\fB\-Wc++11\-compat\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wc++11-compat ( and Objective- only)"
! Warn about \*(C+ constructs whose meaning differs between \s-1ISO \*(C+ 1998\s0
! and \s-1ISO \*(C+ 2011,\s0 e.g., identifiers in \s-1ISO \*(C+ 1998\s0 that are keywords
! in \s-1ISO \*(C+ 2011.\s0  This warning turns on \fB\-Wnarrowing\fR and is
  enabled by \fB\-Wall\fR.
  .IP "\fB\-Wc++14\-compat\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wc++14-compat ( and Objective- only)"
! Warn about \*(C+ constructs whose meaning differs between \s-1ISO \*(C+ 2011\s0
! and \s-1ISO \*(C+ 2014.\s0  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wcast\-qual\fR" 4
  .IX Item "-Wcast-qual"
  Warn whenever a pointer is cast so as to remove a type qualifier from
*************** Usually they indicate a typo in the user
*** 4663,4687 ****
  implementation-defined values, and should not be used in portable code.
  .IP "\fB\-Wnormalized\fR[\fB=\fR<\fBnone\fR|\fBid\fR|\fBnfc\fR|\fBnfkc\fR>]" 4
  .IX Item "-Wnormalized[=<none|id|nfc|nfkc>]"
! In \s-1ISO\s0 C and \s-1ISO\s0 \*(C+, two identifiers are different if they are
  different sequences of characters.  However, sometimes when characters
  outside the basic \s-1ASCII\s0 character set are used, you can have two
  different character sequences that look the same.  To avoid confusion,
! the \s-1ISO\s0 10646 standard sets out some \fInormalization rules\fR which
  when applied ensure that two sequences that look the same are turned into
  the same sequence.  \s-1GCC\s0 can warn you if you are using identifiers that
  have not been normalized; this option controls that warning.
  .Sp
! There are four levels of warning supported by \s-1GCC\s0.  The default is
  \&\fB\-Wnormalized=nfc\fR, which warns about any identifier that is
! not in the \s-1ISO\s0 10646 \*(L"C\*(R" normalized form, \fI\s-1NFC\s0\fR.  \s-1NFC\s0 is the
  recommended form for most uses.  It is equivalent to
  \&\fB\-Wnormalized\fR.
  .Sp
  Unfortunately, there are some characters allowed in identifiers by
! \&\s-1ISO\s0 C and \s-1ISO\s0 \*(C+ that, when turned into \s-1NFC\s0, are not allowed in 
  identifiers.  That is, there's no way to use these symbols in portable
! \&\s-1ISO\s0 C or \*(C+ and have all your identifiers in \s-1NFC\s0.
  \&\fB\-Wnormalized=id\fR suppresses the warning for these characters.
  It is hoped that future versions of the standards involved will correct
  this, which is why this option is not the default.
--- 4665,4689 ----
  implementation-defined values, and should not be used in portable code.
  .IP "\fB\-Wnormalized\fR[\fB=\fR<\fBnone\fR|\fBid\fR|\fBnfc\fR|\fBnfkc\fR>]" 4
  .IX Item "-Wnormalized[=<none|id|nfc|nfkc>]"
! In \s-1ISO C\s0 and \s-1ISO \*(C+,\s0 two identifiers are different if they are
  different sequences of characters.  However, sometimes when characters
  outside the basic \s-1ASCII\s0 character set are used, you can have two
  different character sequences that look the same.  To avoid confusion,
! the \s-1ISO 10646\s0 standard sets out some \fInormalization rules\fR which
  when applied ensure that two sequences that look the same are turned into
  the same sequence.  \s-1GCC\s0 can warn you if you are using identifiers that
  have not been normalized; this option controls that warning.
  .Sp
! There are four levels of warning supported by \s-1GCC.\s0  The default is
  \&\fB\-Wnormalized=nfc\fR, which warns about any identifier that is
! not in the \s-1ISO 10646 \*(L"C\*(R"\s0 normalized form, \fI\s-1NFC\s0\fR.  \s-1NFC\s0 is the
  recommended form for most uses.  It is equivalent to
  \&\fB\-Wnormalized\fR.
  .Sp
  Unfortunately, there are some characters allowed in identifiers by
! \&\s-1ISO C\s0 and \s-1ISO \*(C+\s0 that, when turned into \s-1NFC,\s0 are not allowed in 
  identifiers.  That is, there's no way to use these symbols in portable
! \&\s-1ISO C\s0 or \*(C+ and have all your identifiers in \s-1NFC.\s0
  \&\fB\-Wnormalized=id\fR suppresses the warning for these characters.
  It is hoped that future versions of the standards involved will correct
  this, which is why this option is not the default.
*************** only do this if you are using some other
*** 4692,4702 ****
  \&\*(L"D\*(R"), because otherwise you can easily create bugs that are
  literally impossible to see.
  .Sp
! Some characters in \s-1ISO\s0 10646 have distinct meanings but look identical
  in some fonts or display methodologies, especially once formatting has
! been applied.  For instance \f(CW\*(C`\eu207F\*(C'\fR, \*(L"\s-1SUPERSCRIPT\s0 \s-1LATIN\s0 \s-1SMALL\s0
! \&\s-1LETTER\s0 N\*(R", displays just like a regular \f(CW\*(C`n\*(C'\fR that has been
! placed in a superscript.  \s-1ISO\s0 10646 defines the \fI\s-1NFKC\s0\fR
  normalization scheme to convert all these into a standard form as
  well, and \s-1GCC\s0 warns if your code is not in \s-1NFKC\s0 if you use
  \&\fB\-Wnormalized=nfkc\fR.  This warning is comparable to warning
--- 4694,4704 ----
  \&\*(L"D\*(R"), because otherwise you can easily create bugs that are
  literally impossible to see.
  .Sp
! Some characters in \s-1ISO 10646\s0 have distinct meanings but look identical
  in some fonts or display methodologies, especially once formatting has
! been applied.  For instance \f(CW\*(C`\eu207F\*(C'\fR, \*(L"\s-1SUPERSCRIPT LATIN SMALL
! LETTER N\*(R",\s0 displays just like a regular \f(CW\*(C`n\*(C'\fR that has been
! placed in a superscript.  \s-1ISO 10646\s0 defines the \fI\s-1NFKC\s0\fR
  normalization scheme to convert all these into a standard form as
  well, and \s-1GCC\s0 warns if your code is not in \s-1NFKC\s0 if you use
  \&\fB\-Wnormalized=nfkc\fR.  This warning is comparable to warning
*************** have the packed attribute:
*** 4754,4762 ****
  .IP "\fB\-Wpacked\-bitfield\-compat\fR" 4
  .IX Item "-Wpacked-bitfield-compat"
  The 4.1, 4.2 and 4.3 series of \s-1GCC\s0 ignore the \f(CW\*(C`packed\*(C'\fR attribute
! on bit-fields of type \f(CW\*(C`char\*(C'\fR.  This has been fixed in \s-1GCC\s0 4.4 but
  the change can lead to differences in the structure layout.  \s-1GCC\s0
! informs you when the offset of such a field has changed in \s-1GCC\s0 4.4.
  For example there is no longer a 4\-bit padding between field \f(CW\*(C`a\*(C'\fR
  and \f(CW\*(C`b\*(C'\fR in this structure:
  .Sp
--- 4756,4764 ----
  .IP "\fB\-Wpacked\-bitfield\-compat\fR" 4
  .IX Item "-Wpacked-bitfield-compat"
  The 4.1, 4.2 and 4.3 series of \s-1GCC\s0 ignore the \f(CW\*(C`packed\*(C'\fR attribute
! on bit-fields of type \f(CW\*(C`char\*(C'\fR.  This has been fixed in \s-1GCC 4.4\s0 but
  the change can lead to differences in the structure layout.  \s-1GCC\s0
! informs you when the offset of such a field has changed in \s-1GCC 4.4.\s0
  For example there is no longer a 4\-bit padding between field \f(CW\*(C`a\*(C'\fR
  and \f(CW\*(C`b\*(C'\fR in this structure:
  .Sp
*************** warnings produced by \fB\-Winline\fR to
*** 4803,4809 ****
  .IP "\fB\-Wno\-invalid\-offsetof\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wno-invalid-offsetof ( and Objective- only)"
  Suppress warnings from applying the \f(CW\*(C`offsetof\*(C'\fR macro to a non-POD
! type.  According to the 2014 \s-1ISO\s0 \*(C+ standard, applying \f(CW\*(C`offsetof\*(C'\fR
  to a non-standard-layout type is undefined.  In existing \*(C+ implementations,
  however, \f(CW\*(C`offsetof\*(C'\fR typically gives meaningful results.
  This flag is for users who are aware that they are
--- 4805,4811 ----
  .IP "\fB\-Wno\-invalid\-offsetof\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wno-invalid-offsetof ( and Objective- only)"
  Suppress warnings from applying the \f(CW\*(C`offsetof\*(C'\fR macro to a non-POD
! type.  According to the 2014 \s-1ISO \*(C+\s0 standard, applying \f(CW\*(C`offsetof\*(C'\fR
  to a non-standard-layout type is undefined.  In existing \*(C+ implementations,
  however, \f(CW\*(C`offsetof\*(C'\fR typically gives meaningful results.
  This flag is for users who are aware that they are
*************** the search path but can't be used.
*** 4828,4839 ****
  .IP "\fB\-Wlong\-long\fR" 4
  .IX Item "-Wlong-long"
  Warn if \f(CW\*(C`long long\*(C'\fR type is used.  This is enabled by either
! \&\fB\-Wpedantic\fR or \fB\-Wtraditional\fR in \s-1ISO\s0 C90 and \*(C+98
  modes.  To inhibit the warning messages, use \fB\-Wno\-long\-long\fR.
  .IP "\fB\-Wvariadic\-macros\fR" 4
  .IX Item "-Wvariadic-macros"
! Warn if variadic macros are used in \s-1ISO\s0 C90 mode, or if the \s-1GNU\s0
! alternate syntax is used in \s-1ISO\s0 C99 mode.  This is enabled by either
  \&\fB\-Wpedantic\fR or \fB\-Wtraditional\fR.  To inhibit the warning
  messages, use \fB\-Wno\-variadic\-macros\fR.
  .IP "\fB\-Wvarargs\fR" 4
--- 4830,4841 ----
  .IP "\fB\-Wlong\-long\fR" 4
  .IX Item "-Wlong-long"
  Warn if \f(CW\*(C`long long\*(C'\fR type is used.  This is enabled by either
! \&\fB\-Wpedantic\fR or \fB\-Wtraditional\fR in \s-1ISO C90\s0 and \*(C+98
  modes.  To inhibit the warning messages, use \fB\-Wno\-long\-long\fR.
  .IP "\fB\-Wvariadic\-macros\fR" 4
  .IX Item "-Wvariadic-macros"
! Warn if variadic macros are used in \s-1ISO C90\s0 mode, or if the \s-1GNU\s0
! alternate syntax is used in \s-1ISO C99\s0 mode.  This is enabled by either
  \&\fB\-Wpedantic\fR or \fB\-Wtraditional\fR.  To inhibit the warning
  messages, use \fB\-Wno\-variadic\-macros\fR.
  .IP "\fB\-Wvarargs\fR" 4
*************** standard's minimum limit, but very porta
*** 4897,4903 ****
  using longer strings.
  .Sp
  The limit applies \fIafter\fR string constant concatenation, and does
! not count the trailing \s-1NUL\s0.  In C90, the limit was 509 characters; in
  C99, it was raised to 4095.  \*(C+98 does not specify a normative
  minimum maximum, so we do not diagnose overlength strings in \*(C+.
  .Sp
--- 4899,4905 ----
  using longer strings.
  .Sp
  The limit applies \fIafter\fR string constant concatenation, and does
! not count the trailing \s-1NUL.\s0  In C90, the limit was 509 characters; in
  C99, it was raised to 4095.  \*(C+98 does not specify a normative
  minimum maximum, so we do not diagnose overlength strings in \*(C+.
  .Sp
*************** from the decimal floating-point extensio
*** 4915,4928 ****
  Suppress warnings when a positional initializer is used to initialize
  a structure that has been marked with the \f(CW\*(C`designated_init\*(C'\fR
  attribute.
! .Sh "Options for Debugging Your Program or \s-1GCC\s0"
  .IX Subsection "Options for Debugging Your Program or GCC"
  \&\s-1GCC\s0 has various special options that are used for debugging
  either your program or \s-1GCC:\s0
  .IP "\fB\-g\fR" 4
  .IX Item "-g"
  Produce debugging information in the operating system's native format
! (stabs, \s-1COFF\s0, \s-1XCOFF\s0, or \s-1DWARF\s0 2).  \s-1GDB\s0 can work with this debugging
  information.
  .Sp
  On most systems that use stabs format, \fB\-g\fR enables use of extra
--- 4917,4930 ----
  Suppress warnings when a positional initializer is used to initialize
  a structure that has been marked with the \f(CW\*(C`designated_init\*(C'\fR
  attribute.
! .SS "Options for Debugging Your Program or \s-1GCC\s0"
  .IX Subsection "Options for Debugging Your Program or GCC"
  \&\s-1GCC\s0 has various special options that are used for debugging
  either your program or \s-1GCC:\s0
  .IP "\fB\-g\fR" 4
  .IX Item "-g"
  Produce debugging information in the operating system's native format
! (stabs, \s-1COFF, XCOFF,\s0 or \s-1DWARF 2\s0).  \s-1GDB\s0 can work with this debugging
  information.
  .Sp
  On most systems that use stabs format, \fB\-g\fR enables use of extra
*************** be useful, this option requires a debugg
*** 4955,4962 ****
  files.
  .IP "\fB\-ggdb\fR" 4
  .IX Item "-ggdb"
! Produce debugging information for use by \s-1GDB\s0.  This means to use the
! most expressive format available (\s-1DWARF\s0 2, stabs, or the native format
  if neither of those are supported), including \s-1GDB\s0 extensions if at all
  possible.
  .IP "\fB\-gpubnames\fR" 4
--- 4957,4964 ----
  files.
  .IP "\fB\-ggdb\fR" 4
  .IX Item "-ggdb"
! Produce debugging information for use by \s-1GDB.\s0  This means to use the
! most expressive format available (\s-1DWARF 2,\s0 stabs, or the native format
  if neither of those are supported), including \s-1GDB\s0 extensions if at all
  possible.
  .IP "\fB\-gpubnames\fR" 4
*************** with a linker that can produce \s-1GDB\s
*** 4971,4978 ****
  .IX Item "-gstabs"
  Produce debugging information in stabs format (if that is supported),
  without \s-1GDB\s0 extensions.  This is the format used by \s-1DBX\s0 on most \s-1BSD\s0
! systems.  On \s-1MIPS\s0, Alpha and System V Release 4 systems this option
! produces stabs debugging output that is not understood by \s-1DBX\s0 or \s-1SDB\s0.
  On System V Release 4 systems this option requires the \s-1GNU\s0 assembler.
  .IP "\fB\-feliminate\-unused\-debug\-symbols\fR" 4
  .IX Item "-feliminate-unused-debug-symbols"
--- 4973,4980 ----
  .IX Item "-gstabs"
  Produce debugging information in stabs format (if that is supported),
  without \s-1GDB\s0 extensions.  This is the format used by \s-1DBX\s0 on most \s-1BSD\s0
! systems.  On \s-1MIPS,\s0 Alpha and System V Release 4 systems this option
! produces stabs debugging output that is not understood by \s-1DBX\s0 or \s-1SDB.\s0
  On System V Release 4 systems this option requires the \s-1GNU\s0 assembler.
  .IP "\fB\-feliminate\-unused\-debug\-symbols\fR" 4
  .IX Item "-feliminate-unused-debug-symbols"
*************** System V Release 4.
*** 5009,5015 ****
  .IP "\fB\-gxcoff\fR" 4
  .IX Item "-gxcoff"
  Produce debugging information in \s-1XCOFF\s0 format (if that is supported).
! This is the format used by the \s-1DBX\s0 debugger on \s-1IBM\s0 \s-1RS/6000\s0 systems.
  .IP "\fB\-gxcoff+\fR" 4
  .IX Item "-gxcoff+"
  Produce debugging information in \s-1XCOFF\s0 format (if that is supported),
--- 5011,5017 ----
  .IP "\fB\-gxcoff\fR" 4
  .IX Item "-gxcoff"
  Produce debugging information in \s-1XCOFF\s0 format (if that is supported).
! This is the format used by the \s-1DBX\s0 debugger on \s-1IBM RS/6000\s0 systems.
  .IP "\fB\-gxcoff+\fR" 4
  .IX Item "-gxcoff+"
  Produce debugging information in \s-1XCOFF\s0 format (if that is supported),
*************** The value of \fIversion\fR may be either
*** 5024,5032 ****
  for most targets is 4.  \s-1DWARF\s0 Version 5 is only experimental.
  .Sp
  Note that with \s-1DWARF\s0 Version 2, some ports require and always
! use some non-conflicting \s-1DWARF\s0 3 extensions in the unwind tables.
  .Sp
! Version 4 may require \s-1GDB\s0 7.0 and \fB\-fvar\-tracking\-assignments\fR
  for maximum benefit.
  .IP "\fB\-grecord\-gcc\-switches\fR" 4
  .IX Item "-grecord-gcc-switches"
--- 5026,5034 ----
  for most targets is 4.  \s-1DWARF\s0 Version 5 is only experimental.
  .Sp
  Note that with \s-1DWARF\s0 Version 2, some ports require and always
! use some non-conflicting \s-1DWARF 3\s0 extensions in the unwind tables.
  .Sp
! Version 4 may require \s-1GDB 7.0\s0 and \fB\-fvar\-tracking\-assignments\fR
  for maximum benefit.
  .IP "\fB\-grecord\-gcc\-switches\fR" 4
  .IX Item "-grecord-gcc-switches"
*************** debug information in version 1 of the \s
*** 5099,5105 ****
  different from version 2), and it would have been too confusing.  That
  debug format is long obsolete, but the option cannot be changed now.
  Instead use an additional \fB\-g\fR\fIlevel\fR option to change the
! debug level for \s-1DWARF\s0.
  .IP "\fB\-gtoggle\fR" 4
  .IX Item "-gtoggle"
  Turn off generation of debug info, if leaving out this option
--- 5101,5107 ----
  different from version 2), and it would have been too confusing.  That
  debug format is long obsolete, but the option cannot be changed now.
  Instead use an additional \fB\-g\fR\fIlevel\fR option to change the
! debug level for \s-1DWARF.\s0
  .IP "\fB\-gtoggle\fR" 4
  .IX Item "-gtoggle"
  Turn off generation of debug info, if leaving out this option
*************** at runtime.  Current suboptions are:
*** 5152,5158 ****
  .IX Item "-fsanitize=shift"
  This option enables checking that the result of a shift operation is
  not undefined.  Note that what exactly is considered undefined differs
! slightly between C and \*(C+, as well as between \s-1ISO\s0 C90 and C99, etc.
  .IP "\fB\-fsanitize=integer\-divide\-by\-zero\fR" 4
  .IX Item "-fsanitize=integer-divide-by-zero"
  Detect integer division by zero as well as \f(CW\*(C`INT_MIN / \-1\*(C'\fR division.
--- 5154,5160 ----
  .IX Item "-fsanitize=shift"
  This option enables checking that the result of a shift operation is
  not undefined.  Note that what exactly is considered undefined differs
! slightly between C and \*(C+, as well as between \s-1ISO C90\s0 and C99, etc.
  .IP "\fB\-fsanitize=integer\-divide\-by\-zero\fR" 4
  .IX Item "-fsanitize=integer-divide-by-zero"
  Detect integer division by zero as well as \f(CW\*(C`INT_MIN / \-1\*(C'\fR division.
*************** When this option is passed to the compil
*** 5458,5466 ****
  other than debugging the compiler proper.
  .IP "\fB\-feliminate\-dwarf2\-dups\fR" 4
  .IX Item "-feliminate-dwarf2-dups"
! Compress \s-1DWARF\s0 2 debugging information by eliminating duplicated
  information about each symbol.  This option only makes sense when
! generating \s-1DWARF\s0 2 debugging information with \fB\-gdwarf\-2\fR.
  .IP "\fB\-femit\-struct\-debug\-baseonly\fR" 4
  .IX Item "-femit-struct-debug-baseonly"
  Emit debug information for struct-like types
--- 5460,5468 ----
  other than debugging the compiler proper.
  .IP "\fB\-feliminate\-dwarf2\-dups\fR" 4
  .IX Item "-feliminate-dwarf2-dups"
! Compress \s-1DWARF 2\s0 debugging information by eliminating duplicated
  information about each symbol.  This option only makes sense when
! generating \s-1DWARF 2\s0 debugging information with \fB\-gdwarf\-2\fR.
  .IP "\fB\-femit\-struct\-debug\-baseonly\fR" 4
  .IX Item "-femit-struct-debug-baseonly"
  Emit debug information for struct-like types
*************** but at significant potential loss in typ
*** 5472,5478 ****
  See \fB\-femit\-struct\-debug\-reduced\fR for a less aggressive option.
  See \fB\-femit\-struct\-debug\-detailed\fR for more detailed control.
  .Sp
! This option works only with \s-1DWARF\s0 2.
  .IP "\fB\-femit\-struct\-debug\-reduced\fR" 4
  .IX Item "-femit-struct-debug-reduced"
  Emit debug information for struct-like types
--- 5474,5480 ----
  See \fB\-femit\-struct\-debug\-reduced\fR for a less aggressive option.
  See \fB\-femit\-struct\-debug\-detailed\fR for more detailed control.
  .Sp
! This option works only with \s-1DWARF 2.\s0
  .IP "\fB\-femit\-struct\-debug\-reduced\fR" 4
  .IX Item "-femit-struct-debug-reduced"
  Emit debug information for struct-like types
*************** with some potential loss in type informa
*** 5485,5491 ****
  See \fB\-femit\-struct\-debug\-baseonly\fR for a more aggressive option.
  See \fB\-femit\-struct\-debug\-detailed\fR for more detailed control.
  .Sp
! This option works only with \s-1DWARF\s0 2.
  .IP "\fB\-femit\-struct\-debug\-detailed\fR[\fB=\fR\fIspec-list\fR]" 4
  .IX Item "-femit-struct-debug-detailed[=spec-list]"
  Specify the struct-like types
--- 5487,5493 ----
  See \fB\-femit\-struct\-debug\-baseonly\fR for a more aggressive option.
  See \fB\-femit\-struct\-debug\-detailed\fR for more detailed control.
  .Sp
! This option works only with \s-1DWARF 2.\s0
  .IP "\fB\-femit\-struct\-debug\-detailed\fR[\fB=\fR\fIspec-list\fR]" 4
  .IX Item "-femit-struct-debug-detailed[=spec-list]"
  Specify the struct-like types
*************** You may need to experiment to determine
*** 5531,5537 ****
  .Sp
  The default is \fB\-femit\-struct\-debug\-detailed=all\fR.
  .Sp
! This option works only with \s-1DWARF\s0 2.
  .IP "\fB\-fno\-merge\-debug\-strings\fR" 4
  .IX Item "-fno-merge-debug-strings"
  Direct the linker to not merge together strings in the debugging
--- 5533,5539 ----
  .Sp
  The default is \fB\-femit\-struct\-debug\-detailed=all\fR.
  .Sp
! This option works only with \s-1DWARF 2.\s0
  .IP "\fB\-fno\-merge\-debug\-strings\fR" 4
  .IX Item "-fno-merge-debug-strings"
  Direct the linker to not merge together strings in the debugging
*************** When compiling files in directory \fI\fI
*** 5545,5551 ****
  information describing them as in \fI\fInew\fI\fR instead.
  .IP "\fB\-fno\-dwarf2\-cfi\-asm\fR" 4
  .IX Item "-fno-dwarf2-cfi-asm"
! Emit \s-1DWARF\s0 2 unwind info as compiler generated \f(CW\*(C`.eh_frame\*(C'\fR section
  instead of using \s-1GAS\s0 \f(CW\*(C`.cfi_*\*(C'\fR directives.
  .IP "\fB\-p\fR" 4
  .IX Item "-p"
--- 5547,5553 ----
  information describing them as in \fI\fInew\fI\fR instead.
  .IP "\fB\-fno\-dwarf2\-cfi\-asm\fR" 4
  .IX Item "-fno-dwarf2-cfi-asm"
! Emit \s-1DWARF 2\s0 unwind info as compiler generated \f(CW\*(C`.eh_frame\*(C'\fR section
  instead of using \s-1GAS\s0 \f(CW\*(C`.cfi_*\*(C'\fR directives.
  .IP "\fB\-p\fR" 4
  .IX Item "-p"
*************** For example, with \fB\-fdbg\-cnt=dce:10,
*** 5703,5709 ****
  .IX Item "-fdisable-kind-pass=range-list"
  .PD
  This is a set of options that are used to explicitly disable/enable
! optimization passes.  These options are intended for use for debugging \s-1GCC\s0.
  Compiler users should use regular options for enabling/disabling
  passes instead.
  .RS 4
--- 5705,5711 ----
  .IX Item "-fdisable-kind-pass=range-list"
  .PD
  This is a set of options that are used to explicitly disable/enable
! optimization passes.  These options are intended for use for debugging \s-1GCC.\s0
  Compiler users should use regular options for enabling/disabling
  passes instead.
  .RS 4
*************** by some other path.
*** 6176,6182 ****
  When dumping pretty-printed trees, this option inhibits dumping the
  bodies of control structures.
  .Sp
! When dumping \s-1RTL\s0, print the \s-1RTL\s0 in slim (condensed) form instead of
  the default LISP-like representation.
  .IP "\fBraw\fR" 4
  .IX Item "raw"
--- 6178,6184 ----
  When dumping pretty-printed trees, this option inhibits dumping the
  bodies of control structures.
  .Sp
! When dumping \s-1RTL,\s0 print the \s-1RTL\s0 in slim (condensed) form instead of
  the default LISP-like representation.
  .IP "\fBraw\fR" 4
  .IX Item "raw"
*************** Dump aliasing information for each funct
*** 6289,6295 ****
  appending \fI.alias\fR to the source file name.
  .IP "\fBccp\fR" 4
  .IX Item "ccp"
! Dump each function after \s-1CCP\s0.  The file name is made by appending
  \&\fI.ccp\fR to the source file name.
  .IP "\fBstoreccp\fR" 4
  .IX Item "storeccp"
--- 6291,6297 ----
  appending \fI.alias\fR to the source file name.
  .IP "\fBccp\fR" 4
  .IX Item "ccp"
! Dump each function after \s-1CCP.\s0  The file name is made by appending
  \&\fI.ccp\fR to the source file name.
  .IP "\fBstoreccp\fR" 4
  .IX Item "storeccp"
*************** Print the compiler's built-in specs\-\-\
*** 6708,6714 ****
  is used when \s-1GCC\s0 itself is being built.)
  .IP "\fB\-fno\-eliminate\-unused\-debug\-types\fR" 4
  .IX Item "-fno-eliminate-unused-debug-types"
! Normally, when producing \s-1DWARF\s0 2 output, \s-1GCC\s0 avoids producing debug symbol 
  output for types that are nowhere used in the source file being compiled.
  Sometimes it is useful to have \s-1GCC\s0 emit debugging
  information for all types declared in a compilation
--- 6710,6716 ----
  is used when \s-1GCC\s0 itself is being built.)
  .IP "\fB\-fno\-eliminate\-unused\-debug\-types\fR" 4
  .IX Item "-fno-eliminate-unused-debug-types"
! Normally, when producing \s-1DWARF 2\s0 output, \s-1GCC\s0 avoids producing debug symbol 
  output for types that are nowhere used in the source file being compiled.
  Sometimes it is useful to have \s-1GCC\s0 emit debugging
  information for all types declared in a compilation
*************** in that compilation unit, for example
*** 6717,6723 ****
  if, in the debugger, you want to cast a value to a type that is
  not actually used in your program (but is declared).  More often,
  however, this results in a significant amount of wasted space.
! .Sh "Options That Control Optimization"
  .IX Subsection "Options That Control Optimization"
  These options control various sorts of optimizations.
  .PP
--- 6719,6725 ----
  if, in the debugger, you want to cast a value to a type that is
  not actually used in your program (but is declared).  More often,
  however, this results in a significant amount of wasted space.
! .SS "Options That Control Optimization"
  .IX Subsection "Options That Control Optimization"
  These options control various sorts of optimizations.
  .PP
*************** function calls and pops them all at once
*** 6913,6919 ****
  Disabled at levels \fB\-O\fR, \fB\-O2\fR, \fB\-O3\fR, \fB\-Os\fR.
  .IP "\fB\-fforward\-propagate\fR" 4
  .IX Item "-fforward-propagate"
! Perform a forward propagation pass on \s-1RTL\s0.  The pass tries to combine two
  instructions and checks if the result can be simplified.  If loop unrolling
  is active, two passes are performed and the second is scheduled after
  loop unrolling.
--- 6915,6921 ----
  Disabled at levels \fB\-O\fR, \fB\-O2\fR, \fB\-O3\fR, \fB\-Os\fR.
  .IP "\fB\-fforward\-propagate\fR" 4
  .IX Item "-fforward-propagate"
! Perform a forward propagation pass on \s-1RTL.\s0  The pass tries to combine two
  instructions and checks if the result can be simplified.  If loop unrolling
  is active, two passes are performed and the second is scheduled after
  loop unrolling.
*************** restore frame pointers; it also makes an
*** 6939,6945 ****
  in many functions.  \fBIt also makes debugging impossible on
  some machines.\fR
  .Sp
! On some machines, such as the \s-1VAX\s0, this flag has no effect, because
  the standard calling sequence automatically handles the frame pointer
  and nothing is saved by pretending it doesn't exist.  The
  machine-description macro \f(CW\*(C`FRAME_POINTER_REQUIRED\*(C'\fR controls
--- 6941,6947 ----
  in many functions.  \fBIt also makes debugging impossible on
  some machines.\fR
  .Sp
! On some machines, such as the \s-1VAX,\s0 this flag has no effect, because
  the standard calling sequence automatically handles the frame pointer
  and nothing is saved by pretending it doesn't exist.  The
  machine-description macro \f(CW\*(C`FRAME_POINTER_REQUIRED\*(C'\fR controls
*************** attribute or declspec
*** 7064,7070 ****
  In C, emit \f(CW\*(C`static\*(C'\fR functions that are declared \f(CW\*(C`inline\*(C'\fR
  into the object file, even if the function has been inlined into all
  of its callers.  This switch does not affect functions using the
! \&\f(CW\*(C`extern inline\*(C'\fR extension in \s-1GNU\s0 C90.  In \*(C+, emit any and all
  inline functions into the object file.
  .IP "\fB\-fkeep\-static\-consts\fR" 4
  .IX Item "-fkeep-static-consts"
--- 7066,7072 ----
  In C, emit \f(CW\*(C`static\*(C'\fR functions that are declared \f(CW\*(C`inline\*(C'\fR
  into the object file, even if the function has been inlined into all
  of its callers.  This switch does not affect functions using the
! \&\f(CW\*(C`extern inline\*(C'\fR extension in \s-1GNU C90.\s0  In \*(C+, emit any and all
  inline functions into the object file.
  .IP "\fB\-fkeep\-static\-consts\fR" 4
  .IX Item "-fkeep-static-consts"
*************** The default is \fB\-ffunction\-cse\fR
*** 7131,7137 ****
  .IP "\fB\-fno\-zero\-initialized\-in\-bss\fR" 4
  .IX Item "-fno-zero-initialized-in-bss"
  If the target supports a \s-1BSS\s0 section, \s-1GCC\s0 by default puts variables that
! are initialized to zero into \s-1BSS\s0.  This can save space in the resulting
  code.
  .Sp
  This option turns off this behavior because some programs explicitly
--- 7133,7139 ----
  .IP "\fB\-fno\-zero\-initialized\-in\-bss\fR" 4
  .IX Item "-fno-zero-initialized-in-bss"
  If the target supports a \s-1BSS\s0 section, \s-1GCC\s0 by default puts variables that
! are initialized to zero into \s-1BSS.\s0  This can save space in the resulting
  code.
  .Sp
  This option turns off this behavior because some programs explicitly
*************** instructions to support this.  Enabled b
*** 7254,7264 ****
  higher on architectures that support this.
  .IP "\fB\-fdce\fR" 4
  .IX Item "-fdce"
! Perform dead code elimination (\s-1DCE\s0) on \s-1RTL\s0.
  Enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-fdse\fR" 4
  .IX Item "-fdse"
! Perform dead store elimination (\s-1DSE\s0) on \s-1RTL\s0.
  Enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-fif\-conversion\fR" 4
  .IX Item "-fif-conversion"
--- 7256,7266 ----
  higher on architectures that support this.
  .IP "\fB\-fdce\fR" 4
  .IX Item "-fdce"
! Perform dead code elimination (\s-1DCE\s0) on \s-1RTL.\s0
  Enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-fdse\fR" 4
  .IX Item "-fdse"
! Perform dead store elimination (\s-1DSE\s0) on \s-1RTL.\s0
  Enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-fif\-conversion\fR" 4
  .IX Item "-fif-conversion"
*************** The default value is 5.  If the value \f
*** 7418,7424 ****
  the dump output is sent to stderr using the same format as \fIn\fR minus 10.
  .IP "\fB\-flra\-remat\fR" 4
  .IX Item "-flra-remat"
! Enable CFG-sensitive rematerialization in \s-1LRA\s0.  Instead of loading
  values of spilled pseudos, \s-1LRA\s0 tries to rematerialize (recalculate)
  values if it is profitable.
  .Sp
--- 7420,7426 ----
  the dump output is sent to stderr using the same format as \fIn\fR minus 10.
  .IP "\fB\-flra\-remat\fR" 4
  .IX Item "-flra-remat"
! Enable CFG-sensitive rematerialization in \s-1LRA.\s0  Instead of loading
  values of spilled pseudos, \s-1LRA\s0 tries to rematerialize (recalculate)
  values if it is profitable.
  .Sp
*************** When pipelining loops during selective s
*** 7577,7585 ****
  This option has no effect unless \fB\-fsel\-sched\-pipelining\fR is turned on.
  .IP "\fB\-fsemantic\-interposition\fR" 4
  .IX Item "-fsemantic-interposition"
! Some object formats, like \s-1ELF\s0, allow interposing of symbols by the 
  dynamic linker.
! This means that for symbols exported from the \s-1DSO\s0, the compiler cannot perform
  interprocedural propagation, inlining and other optimizations in anticipation
  that the function or variable in question may change. While this feature is
  useful, for example, to rewrite memory allocation functions by a debugging
--- 7579,7587 ----
  This option has no effect unless \fB\-fsel\-sched\-pipelining\fR is turned on.
  .IP "\fB\-fsemantic\-interposition\fR" 4
  .IX Item "-fsemantic-interposition"
! Some object formats, like \s-1ELF,\s0 allow interposing of symbols by the 
  dynamic linker.
! This means that for symbols exported from the \s-1DSO,\s0 the compiler cannot perform
  interprocedural propagation, inlining and other optimizations in anticipation
  that the function or variable in question may change. While this feature is
  useful, for example, to rewrite memory allocation functions by a debugging
*************** at \fB\-O\fR and higher.
*** 7649,7655 ****
  Perform full redundancy elimination (\s-1FRE\s0) on trees.  The difference
  between \s-1FRE\s0 and \s-1PRE\s0 is that \s-1FRE\s0 only considers expressions
  that are computed on all paths leading to the redundant computation.
! This analysis is faster than \s-1PRE\s0, though it exposes fewer redundancies.
  This flag is enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-ftree\-phiprop\fR" 4
  .IX Item "-ftree-phiprop"
--- 7651,7657 ----
  Perform full redundancy elimination (\s-1FRE\s0) on trees.  The difference
  between \s-1FRE\s0 and \s-1PRE\s0 is that \s-1FRE\s0 only considers expressions
  that are computed on all paths leading to the redundant computation.
! This analysis is faster than \s-1PRE,\s0 though it exposes fewer redundancies.
  This flag is enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-ftree\-phiprop\fR" 4
  .IX Item "-ftree-phiprop"
*************** The optimization reduces code size and m
*** 7720,7726 ****
  a function by equivalent one with a different name. The optimization works
  more effectively with link time optimization enabled.
  .Sp
! Nevertheless the behavior is similar to Gold Linker \s-1ICF\s0 optimization, \s-1GCC\s0 \s-1ICF\s0
  works on different levels and thus the optimizations are not same \- there are
  equivalences that are found only by \s-1GCC\s0 and equivalences found only by Gold.
  .Sp
--- 7722,7728 ----
  a function by equivalent one with a different name. The optimization works
  more effectively with link time optimization enabled.
  .Sp
! Nevertheless the behavior is similar to Gold Linker \s-1ICF\s0 optimization, \s-1GCC ICF\s0
  works on different levels and thus the optimizations are not same \- there are
  equivalences that are found only by \s-1GCC\s0 and equivalences found only by Gold.
  .Sp
*************** pass only operates on local scalar varia
*** 7755,7761 ****
  at \fB\-O\fR and higher.
  .IP "\fB\-fssa\-phiopt\fR" 4
  .IX Item "-fssa-phiopt"
! Perform pattern matching on \s-1SSA\s0 \s-1PHI\s0 nodes to optimize conditional
  code.  This pass is enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-ftree\-switch\-conversion\fR" 4
  .IX Item "-ftree-switch-conversion"
--- 7757,7763 ----
  at \fB\-O\fR and higher.
  .IP "\fB\-fssa\-phiopt\fR" 4
  .IX Item "-fssa-phiopt"
! Perform pattern matching on \s-1SSA PHI\s0 nodes to optimize conditional
  code.  This pass is enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-ftree\-switch\-conversion\fR" 4
  .IX Item "-ftree-switch-conversion"
*************** Enable the identity transformation for g
*** 7912,7918 ****
  the polyhedral representation and transform it back to gimple.  Using
  \&\fB\-fgraphite\-identity\fR we can check the costs or benefits of the
  \&\s-1GIMPLE\s0 \-> \s-1GRAPHITE\s0 \-> \s-1GIMPLE\s0 transformation.  Some minimal optimizations
! are also performed by the code generator \s-1ISL\s0, like index splitting and
  dead code elimination in loops.
  .IP "\fB\-floop\-nest\-optimize\fR" 4
  .IX Item "-floop-nest-optimize"
--- 7914,7920 ----
  the polyhedral representation and transform it back to gimple.  Using
  \&\fB\-fgraphite\-identity\fR we can check the costs or benefits of the
  \&\s-1GIMPLE\s0 \-> \s-1GRAPHITE\s0 \-> \s-1GIMPLE\s0 transformation.  Some minimal optimizations
! are also performed by the code generator \s-1ISL,\s0 like index splitting and
  dead code elimination in loops.
  .IP "\fB\-floop\-nest\-optimize\fR" 4
  .IX Item "-floop-nest-optimize"
*************** targets.
*** 8417,8423 ****
  Constructs webs as commonly used for register allocation purposes and assign
  each web individual pseudo register.  This allows the register allocation pass
  to operate on pseudos directly, but also strengthens several other optimization
! passes, such as \s-1CSE\s0, loop optimizer and trivial dead code remover.  It can,
  however, make debugging impossible, since variables no longer stay in a
  \&\*(L"home register\*(R".
  .Sp
--- 8419,8425 ----
  Constructs webs as commonly used for register allocation purposes and assign
  each web individual pseudo register.  This allows the register allocation pass
  to operate on pseudos directly, but also strengthens several other optimization
! passes, such as \s-1CSE,\s0 loop optimizer and trivial dead code remover.  It can,
  however, make debugging impossible, since variables no longer stay in a
  \&\*(L"home register\*(R".
  .Sp
*************** link time.
*** 8560,8566 ****
  .Sp
  If \s-1LTO\s0 encounters objects with C linkage declared with incompatible
  types in separate translation units to be linked together (undefined
! behavior according to \s-1ISO\s0 C99 6.2.7), a non-fatal diagnostic may be
  issued.  The behavior is still undefined at run time.  Similar
  diagnostics may be raised for other languages.
  .Sp
--- 8562,8568 ----
  .Sp
  If \s-1LTO\s0 encounters objects with C linkage declared with incompatible
  types in separate translation units to be linked together (undefined
! behavior according to \s-1ISO C99 6.2.7\s0), a non-fatal diagnostic may be
  issued.  The behavior is still undefined at run time.  Similar
  diagnostics may be raised for other languages.
  .Sp
*************** regular (non-LTO) compilation.
*** 8583,8589 ****
  If object files containing \s-1GIMPLE\s0 bytecode are stored in a library archive, say
  \&\fIlibfoo.a\fR, it is possible to extract and use them in an \s-1LTO\s0 link if you
  are using a linker with plugin support.  To create static libraries suitable
! for \s-1LTO\s0, use \fBgcc-ar\fR and \fBgcc-ranlib\fR instead of \fBar\fR
  and \fBranlib\fR; 
  to show the symbols of object files with \s-1GIMPLE\s0 bytecode, use
  \&\fBgcc-nm\fR.  Those commands require that \fBar\fR, \fBranlib\fR
--- 8585,8591 ----
  If object files containing \s-1GIMPLE\s0 bytecode are stored in a library archive, say
  \&\fIlibfoo.a\fR, it is possible to extract and use them in an \s-1LTO\s0 link if you
  are using a linker with plugin support.  To create static libraries suitable
! for \s-1LTO,\s0 use \fBgcc-ar\fR and \fBgcc-ranlib\fR instead of \fBar\fR
  and \fBranlib\fR; 
  to show the symbols of object files with \s-1GIMPLE\s0 bytecode, use
  \&\fBgcc-nm\fR.  Those commands require that \fBar\fR, \fBranlib\fR
*************** The current implementation of \s-1LTO\s0
*** 8618,8624 ****
  attempt to generate bytecode that is portable between different
  types of hosts.  The bytecode files are versioned and there is a
  strict version check, so bytecode files generated in one version of
! \&\s-1GCC\s0 do not work with an older or newer version of \s-1GCC\s0.
  .Sp
  Link-time optimization does not work well with generation of debugging
  information.  Combining \fB\-flto\fR with
--- 8620,8626 ----
  attempt to generate bytecode that is portable between different
  types of hosts.  The bytecode files are versioned and there is a
  strict version check, so bytecode files generated in one version of
! \&\s-1GCC\s0 do not work with an older or newer version of \s-1GCC.\s0
  .Sp
  Link-time optimization does not work well with generation of debugging
  information.  Combining \fB\-flto\fR with
*************** and the object code. This makes them usa
*** 8701,8708 ****
  linking. This option is effective only when compiling with \fB\-flto\fR
  and is ignored at link time.
  .Sp
! \&\fB\-fno\-fat\-lto\-objects\fR improves compilation time over plain \s-1LTO\s0, but
! requires the complete toolchain to be aware of \s-1LTO\s0. It requires a linker with
  linker plugin support for basic functionality.  Additionally,
  \&\fBnm\fR, \fBar\fR and \fBranlib\fR
  need to support linker plugins to allow a full-featured build environment
--- 8703,8710 ----
  linking. This option is effective only when compiling with \fB\-flto\fR
  and is ignored at link time.
  .Sp
! \&\fB\-fno\-fat\-lto\-objects\fR improves compilation time over plain \s-1LTO,\s0 but
! requires the complete toolchain to be aware of \s-1LTO.\s0 It requires a linker with
  linker plugin support for basic functionality.  Additionally,
  \&\fBnm\fR, \fBar\fR and \fBranlib\fR
  need to support linker plugins to allow a full-featured build environment
*************** E.g.
*** 8811,8817 ****
  .Ve
  .Sp
  Then use the \fBcreate_gcov\fR tool to convert the raw profile data
! to a format that can be used by \s-1GCC\s0.  You must also supply the 
  unstripped binary for your program to this tool.  
  See <\fBhttps://github.com/google/autofdo\fR>.
  .Sp
--- 8813,8819 ----
  .Ve
  .Sp
  Then use the \fBcreate_gcov\fR tool to convert the raw profile data
! to a format that can be used by \s-1GCC.\s0  You must also supply the 
  unstripped binary for your program to this tool.  
  See <\fBhttps://github.com/google/autofdo\fR>.
  .Sp
*************** operations are carried out in the precis
*** 8849,8855 ****
  it is unpredictable when rounding to the types specified in the source
  code takes place.  When compiling C, if
  \&\fB\-fexcess\-precision=standard\fR is specified then excess
! precision follows the rules specified in \s-1ISO\s0 C99; in particular,
  both casts and assignments cause values to be rounded to their
  semantic types (whereas \fB\-ffloat\-store\fR only affects
  assignments).  This option is enabled by default for C if a strict
--- 8851,8857 ----
  it is unpredictable when rounding to the types specified in the source
  code takes place.  When compiling C, if
  \&\fB\-fexcess\-precision=standard\fR is specified then excess
! precision follows the rules specified in \s-1ISO C99\s0; in particular,
  both casts and assignments cause values to be rounded to their
  semantic types (whereas \fB\-ffloat\-store\fR only affects
  assignments).  This option is enabled by default for C if a strict
*************** The default is \fB\-fno\-unsafe\-math\-o
*** 8913,8919 ****
  .IP "\fB\-fassociative\-math\fR" 4
  .IX Item "-fassociative-math"
  Allow re-association of operands in series of floating-point operations.
! This violates the \s-1ISO\s0 C and \*(C+ language standard by possibly changing
  computation result.  \s-1NOTE:\s0 re-ordering may change the sign of zero as
  well as ignore NaNs and inhibit or create underflow or overflow (and
  thus cannot be used on code that relies on rounding behavior like
--- 8915,8921 ----
  .IP "\fB\-fassociative\-math\fR" 4
  .IX Item "-fassociative-math"
  Allow re-association of operands in series of floating-point operations.
! This violates the \s-1ISO C\s0 and \*(C+ language standard by possibly changing
  computation result.  \s-1NOTE:\s0 re-ordering may change the sign of zero as
  well as ignore NaNs and inhibit or create underflow or overflow (and
  thus cannot be used on code that relies on rounding behavior like
*************** whether the result of a complex multipli
*** 9016,9022 ****
  default is \fB\-fno\-cx\-limited\-range\fR, but is enabled by
  \&\fB\-ffast\-math\fR.
  .Sp
! This option controls the default setting of the \s-1ISO\s0 C99
  \&\f(CW\*(C`CX_LIMITED_RANGE\*(C'\fR pragma.  Nevertheless, the option applies to
  all languages.
  .IP "\fB\-fcx\-fortran\-rules\fR" 4
--- 9018,9024 ----
  default is \fB\-fno\-cx\-limited\-range\fR, but is enabled by
  \&\fB\-ffast\-math\fR.
  .Sp
! This option controls the default setting of the \s-1ISO C99\s0
  \&\f(CW\*(C`CX_LIMITED_RANGE\*(C'\fR pragma.  Nevertheless, the option applies to
  all languages.
  .IP "\fB\-fcx\-fortran\-rules\fR" 4
*************** optimization is not done.
*** 9288,9294 ****
  .IP "\fBmax-gcse-insertion-ratio\fR" 4
  .IX Item "max-gcse-insertion-ratio"
  If the ratio of expression insertions to deletions is larger than this value
! for any expression, then \s-1RTL\s0 \s-1PRE\s0 inserts or removes the expression and thus
  leaves partially redundant computations in the instruction stream.  The default value is 20.
  .IP "\fBmax-pending-list-length\fR" 4
  .IX Item "max-pending-list-length"
--- 9290,9296 ----
  .IP "\fBmax-gcse-insertion-ratio\fR" 4
  .IX Item "max-gcse-insertion-ratio"
  If the ratio of expression insertions to deletions is larger than this value
! for any expression, then \s-1RTL PRE\s0 inserts or removes the expression and thus
  leaves partially redundant computations in the instruction stream.  The default value is 20.
  .IP "\fBmax-pending-list-length\fR" 4
  .IX Item "max-pending-list-length"
*************** when modulo scheduling a loop.  Larger v
*** 9303,9309 ****
  compilation time.
  .IP "\fBmax-inline-insns-single\fR" 4
  .IX Item "max-inline-insns-single"
! Several parameters control the tree inliner used in \s-1GCC\s0.
  This number sets the maximum number of instructions (counted in \s-1GCC\s0's
  internal representation) in a single function that the tree inliner
  considers for inlining.  This only affects functions declared
--- 9305,9311 ----
  compilation time.
  .IP "\fBmax-inline-insns-single\fR" 4
  .IX Item "max-inline-insns-single"
! Several parameters control the tree inliner used in \s-1GCC.\s0
  This number sets the maximum number of instructions (counted in \s-1GCC\s0's
  internal representation) in a single function that the tree inliner
  considers for inlining.  This only affects functions declared
*************** Tuning this may improve compilation spee
*** 9659,9665 ****
  generation.
  .Sp
  The default is 30% + 70% * (\s-1RAM/1GB\s0) with an upper bound of 100% when
! \&\s-1RAM\s0 >= 1GB.  If \f(CW\*(C`getrlimit\*(C'\fR is available, the notion of \*(L"\s-1RAM\s0\*(R" is
  the smallest of actual \s-1RAM\s0 and \f(CW\*(C`RLIMIT_DATA\*(C'\fR or \f(CW\*(C`RLIMIT_AS\*(C'\fR.  If
  \&\s-1GCC\s0 is not able to calculate \s-1RAM\s0 on a particular platform, the lower
  bound of 30% is used.  Setting this parameter and
--- 9661,9667 ----
  generation.
  .Sp
  The default is 30% + 70% * (\s-1RAM/1GB\s0) with an upper bound of 100% when
! \&\s-1RAM\s0 >= 1GB.  If \f(CW\*(C`getrlimit\*(C'\fR is available, the notion of \*(L"\s-1RAM\*(R"\s0 is
  the smallest of actual \s-1RAM\s0 and \f(CW\*(C`RLIMIT_DATA\*(C'\fR or \f(CW\*(C`RLIMIT_AS\*(C'\fR.  If
  \&\s-1GCC\s0 is not able to calculate \s-1RAM\s0 on a particular platform, the lower
  bound of 30% is used.  Setting this parameter and
*************** by \fBggc-min-expand\fR% beyond \fBggc-m
*** 9674,9680 ****
  tuning this may improve compilation speed, and has no effect on code
  generation.
  .Sp
! The default is the smaller of \s-1RAM/8\s0, \s-1RLIMIT_RSS\s0, or a limit that
  tries to ensure that \s-1RLIMIT_DATA\s0 or \s-1RLIMIT_AS\s0 are not exceeded, but
  with a lower bound of 4096 (four megabytes) and an upper bound of
  131072 (128 megabytes).  If \s-1GCC\s0 is not able to calculate \s-1RAM\s0 on a
--- 9676,9682 ----
  tuning this may improve compilation speed, and has no effect on code
  generation.
  .Sp
! The default is the smaller of \s-1RAM/8, RLIMIT_RSS,\s0 or a limit that
  tries to ensure that \s-1RLIMIT_DATA\s0 or \s-1RLIMIT_AS\s0 are not exceeded, but
  with a lower bound of 4096 (four megabytes) and an upper bound of
  131072 (128 megabytes).  If \s-1GCC\s0 is not able to calculate \s-1RAM\s0 on a
*************** This value is the best found from numero
*** 9899,9905 ****
  This optimization is called inheritance.  \s-1EBB\s0 is used as a region to
  do this optimization.  The parameter defines a minimal fall-through
  edge probability in percentage used to add \s-1BB\s0 to inheritance \s-1EBB\s0 in
! \&\s-1LRA\s0.  The default value of the parameter is 40.  The value was chosen
  from numerous runs of \s-1SPEC2000\s0 on x86\-64.
  .IP "\fBloop-invariant-max-bbs-in-loop\fR" 4
  .IX Item "loop-invariant-max-bbs-in-loop"
--- 9901,9907 ----
  This optimization is called inheritance.  \s-1EBB\s0 is used as a region to
  do this optimization.  The parameter defines a minimal fall-through
  edge probability in percentage used to add \s-1BB\s0 to inheritance \s-1EBB\s0 in
! \&\s-1LRA.\s0  The default value of the parameter is 40.  The value was chosen
  from numerous runs of \s-1SPEC2000\s0 on x86\-64.
  .IP "\fBloop-invariant-max-bbs-in-loop\fR" 4
  .IX Item "loop-invariant-max-bbs-in-loop"
*************** automaton.  The default is 50.
*** 10153,10159 ****
  .RE
  .RS 4
  .RE
! .Sh "Options Controlling the Preprocessor"
  .IX Subsection "Options Controlling the Preprocessor"
  These options control the C preprocessor, which is run on each C source
  file before actual compilation.
--- 10155,10161 ----
  .RE
  .RS 4
  .RE
! .SS "Options Controlling the Preprocessor"
  .IX Subsection "Options Controlling the Preprocessor"
  These options control the C preprocessor, which is run on each C source
  file before actual compilation.
*************** get trigraph conversion without warnings
*** 10277,10283 ****
  .IP "\fB\-Wtraditional\fR" 4
  .IX Item "-Wtraditional"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO\s0 C.  Also warn about \s-1ISO\s0 C constructs that have no traditional C
  equivalent, and problematic constructs which should be avoided.
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
--- 10279,10285 ----
  .IP "\fB\-Wtraditional\fR" 4
  .IX Item "-Wtraditional"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO C.\s0  Also warn about \s-1ISO C\s0 constructs that have no traditional C
  equivalent, and problematic constructs which should be avoided.
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
*************** in finding bugs in your own code, theref
*** 10330,10336 ****
  responsible for the system library, you may want to see them.
  .IP "\fB\-w\fR" 4
  .IX Item "-w"
! Suppress all warnings, including those which \s-1GNU\s0 \s-1CPP\s0 issues by default.
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  Issue all the mandatory diagnostics listed in the C standard.  Some of
--- 10332,10338 ----
  responsible for the system library, you may want to see them.
  .IP "\fB\-w\fR" 4
  .IX Item "-w"
! Suppress all warnings, including those which \s-1GNU CPP\s0 issues by default.
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  Issue all the mandatory diagnostics listed in the C standard.  Some of
*************** This option allows use of a precompiled
*** 10470,10479 ****
  \&\f(CW\*(C`#pragma GCC pch_preprocess "\f(CIfilename\f(CW"\*(C'\fR in the output to mark
  the place where the precompiled header was found, and its \fIfilename\fR.
  When \fB\-fpreprocessed\fR is in use, \s-1GCC\s0 recognizes this \f(CW\*(C`#pragma\*(C'\fR
! and loads the \s-1PCH\s0.
  .Sp
  This option is off by default, because the resulting preprocessed output
! is only really suitable as input to \s-1GCC\s0.  It is switched on by
  \&\fB\-save\-temps\fR.
  .Sp
  You should not write this \f(CW\*(C`#pragma\*(C'\fR in your own code, but it is
--- 10472,10481 ----
  \&\f(CW\*(C`#pragma GCC pch_preprocess "\f(CIfilename\f(CW"\*(C'\fR in the output to mark
  the place where the precompiled header was found, and its \fIfilename\fR.
  When \fB\-fpreprocessed\fR is in use, \s-1GCC\s0 recognizes this \f(CW\*(C`#pragma\*(C'\fR
! and loads the \s-1PCH.\s0
  .Sp
  This option is off by default, because the resulting preprocessed output
! is only really suitable as input to \s-1GCC.\s0  It is switched on by
  \&\fB\-save\-temps\fR.
  .Sp
  You should not write this \f(CW\*(C`#pragma\*(C'\fR in your own code, but it is
*************** may be one of:
*** 10526,10532 ****
  .el .IP "\f(CWiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! The \s-1ISO\s0 C standard from 1990.  \fBc90\fR is the customary shorthand for
  this version of the standard.
  .Sp
  The \fB\-ansi\fR option is equivalent to \fB\-std=c90\fR.
--- 10528,10534 ----
  .el .IP "\f(CWiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! The \s-1ISO C\s0 standard from 1990.  \fBc90\fR is the customary shorthand for
  this version of the standard.
  .Sp
  The \fB\-ansi\fR option is equivalent to \fB\-std=c90\fR.
*************** The 1990 C standard, as amended in 1994.
*** 10548,10554 ****
  .el .IP "\f(CWc9x\fR" 4
  .IX Item "c9x"
  .PD
! The revised \s-1ISO\s0 C standard, published in December 1999.  Before
  publication, this was known as C9X.
  .ie n .IP """iso9899:2011""" 4
  .el .IP "\f(CWiso9899:2011\fR" 4
--- 10550,10556 ----
  .el .IP "\f(CWc9x\fR" 4
  .IX Item "c9x"
  .PD
! The revised \s-1ISO C\s0 standard, published in December 1999.  Before
  publication, this was known as C9X.
  .ie n .IP """iso9899:2011""" 4
  .el .IP "\f(CWiso9899:2011\fR" 4
*************** publication, this was known as C9X.
*** 10561,10567 ****
  .el .IP "\f(CWc1x\fR" 4
  .IX Item "c1x"
  .PD
! The revised \s-1ISO\s0 C standard, published in December 2011.  Before
  publication, this was known as C1X.
  .ie n .IP """gnu90""" 4
  .el .IP "\f(CWgnu90\fR" 4
--- 10563,10569 ----
  .el .IP "\f(CWc1x\fR" 4
  .IX Item "c1x"
  .PD
! The revised \s-1ISO C\s0 standard, published in December 2011.  Before
  publication, this was known as C1X.
  .ie n .IP """gnu90""" 4
  .el .IP "\f(CWgnu90\fR" 4
*************** The 2011 C standard plus \s-1GNU\s0 exte
*** 10593,10599 ****
  .ie n .IP """c++98""" 4
  .el .IP "\f(CWc++98\fR" 4
  .IX Item "c++98"
! The 1998 \s-1ISO\s0 \*(C+ standard plus amendments.
  .ie n .IP """gnu++98""" 4
  .el .IP "\f(CWgnu++98\fR" 4
  .IX Item "gnu++98"
--- 10595,10601 ----
  .ie n .IP """c++98""" 4
  .el .IP "\f(CWc++98\fR" 4
  .IX Item "c++98"
! The 1998 \s-1ISO \*(C+\s0 standard plus amendments.
  .ie n .IP """gnu++98""" 4
  .el .IP "\f(CWgnu++98\fR" 4
  .IX Item "gnu++98"
*************** line.  If the value is less than 1 or gr
*** 10745,10751 ****
  ignored.  The default is 8.
  .IP "\fB\-fdebug\-cpp\fR" 4
  .IX Item "-fdebug-cpp"
! This option is only useful for debugging \s-1GCC\s0.  When used with
  \&\fB\-E\fR, dumps debugging information about location maps.  Every
  token in the output is preceded by the dump of the map its location
  belongs to.  The dump of the map holding the location of a token would
--- 10747,10753 ----
  ignored.  The default is 8.
  .IP "\fB\-fdebug\-cpp\fR" 4
  .IX Item "-fdebug-cpp"
! This option is only useful for debugging \s-1GCC.\s0  When used with
  \&\fB\-E\fR, dumps debugging information about location maps.  Every
  token in the output is preceded by the dump of the map its location
  belongs to.  The dump of the map holding the location of a token would
*************** Note that \f(CW\*(C`\-ftrack\-macro\-exp
*** 10778,10789 ****
  .IP "\fB\-fexec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fexec-charset=charset"
  Set the execution character set, used for string and character
! constants.  The default is \s-1UTF\-8\s0.  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
  .IP "\fB\-fwide\-exec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fwide-exec-charset=charset"
  Set the wide execution character set, used for wide string and
! character constants.  The default is \s-1UTF\-32\s0 or \s-1UTF\-16\s0, whichever
  corresponds to the width of \f(CW\*(C`wchar_t\*(C'\fR.  As with
  \&\fB\-fexec\-charset\fR, \fIcharset\fR can be any encoding supported
  by the system's \f(CW\*(C`iconv\*(C'\fR library routine; however, you will have
--- 10780,10791 ----
  .IP "\fB\-fexec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fexec-charset=charset"
  Set the execution character set, used for string and character
! constants.  The default is \s-1UTF\-8.\s0  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
  .IP "\fB\-fwide\-exec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fwide-exec-charset=charset"
  Set the wide execution character set, used for wide string and
! character constants.  The default is \s-1UTF\-32\s0 or \s-1UTF\-16,\s0 whichever
  corresponds to the width of \f(CW\*(C`wchar_t\*(C'\fR.  As with
  \&\fB\-fexec\-charset\fR, \fIcharset\fR can be any encoding supported
  by the system's \f(CW\*(C`iconv\*(C'\fR library routine; however, you will have
*************** problems with encodings that do not fit
*** 10791,10799 ****
  .IP "\fB\-finput\-charset=\fR\fIcharset\fR" 4
  .IX Item "-finput-charset=charset"
  Set the input character set, used for translation from the character
! set of the input file to the source character set used by \s-1GCC\s0.  If the
  locale does not specify, or \s-1GCC\s0 cannot get this information from the
! locale, the default is \s-1UTF\-8\s0.  This can be overridden by either the locale
  or this command-line option.  Currently the command-line option takes
  precedence if there's a conflict.  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
--- 10793,10801 ----
  .IP "\fB\-finput\-charset=\fR\fIcharset\fR" 4
  .IX Item "-finput-charset=charset"
  Set the input character set, used for translation from the character
! set of the input file to the source character set used by \s-1GCC.\s0  If the
  locale does not specify, or \s-1GCC\s0 cannot get this information from the
! locale, the default is \s-1UTF\-8.\s0  This can be overridden by either the locale
  or this command-line option.  Currently the command-line option takes
  precedence if there's a conflict.  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
*************** Cancel an assertion with the predicate \
*** 10830,10836 ****
  .IX Item "-dCHARS"
  \&\fI\s-1CHARS\s0\fR is a sequence of one or more of the following characters,
  and must not be preceded by a space.  Other characters are interpreted
! by the compiler proper, or reserved for future versions of \s-1GCC\s0, and so
  are silently ignored.  If you specify characters whose behavior
  conflicts, the result is undefined.
  .RS 4
--- 10832,10838 ----
  .IX Item "-dCHARS"
  \&\fI\s-1CHARS\s0\fR is a sequence of one or more of the following characters,
  and must not be preceded by a space.  Other characters are interpreted
! by the compiler proper, or reserved for future versions of \s-1GCC,\s0 and so
  are silently ignored.  If you specify characters whose behavior
  conflicts, the result is undefined.
  .RS 4
*************** The \fB\-CC\fR option is generally used
*** 10906,10917 ****
  .IP "\fB\-traditional\-cpp\fR" 4
  .IX Item "-traditional-cpp"
  Try to imitate the behavior of old-fashioned C preprocessors, as
! opposed to \s-1ISO\s0 C preprocessors.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
  Process trigraph sequences.
  These are three-character sequences, all starting with \fB??\fR, that
! are defined by \s-1ISO\s0 C to stand for single characters.  For example,
  \&\fB??/\fR stands for \fB\e\fR, so \fB'??/n'\fR is a character
  constant for a newline.  By default, \s-1GCC\s0 ignores trigraphs, but in
  standard-conforming modes it converts them.  See the \fB\-std\fR and
--- 10908,10919 ----
  .IP "\fB\-traditional\-cpp\fR" 4
  .IX Item "-traditional-cpp"
  Try to imitate the behavior of old-fashioned C preprocessors, as
! opposed to \s-1ISO C\s0 preprocessors.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
  Process trigraph sequences.
  These are three-character sequences, all starting with \fB??\fR, that
! are defined by \s-1ISO C\s0 to stand for single characters.  For example,
  \&\fB??/\fR stands for \fB\e\fR, so \fB'??/n'\fR is a character
  constant for a newline.  By default, \s-1GCC\s0 ignores trigraphs, but in
  standard-conforming modes it converts them.  See the \fB\-std\fR and
*************** Print text describing all the command-li
*** 10937,10943 ****
  preprocessing anything.
  .IP "\fB\-v\fR" 4
  .IX Item "-v"
! Verbose mode.  Print out \s-1GNU\s0 \s-1CPP\s0's version number at the beginning of
  execution, and report the final form of the include path.
  .IP "\fB\-H\fR" 4
  .IX Item "-H"
--- 10939,10945 ----
  preprocessing anything.
  .IP "\fB\-v\fR" 4
  .IX Item "-v"
! Verbose mode.  Print out \s-1GNU CPP\s0's version number at the beginning of
  execution, and report the final form of the include path.
  .IP "\fB\-H\fR" 4
  .IX Item "-H"
*************** header file is printed with \fB...x\fR a
*** 10952,10960 ****
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
  .PD
! Print out \s-1GNU\s0 \s-1CPP\s0's version number.  With one dash, proceed to
  preprocess as normal.  With two dashes, exit immediately.
! .Sh "Passing Options to the Assembler"
  .IX Subsection "Passing Options to the Assembler"
  You can pass options to the assembler.
  .IP "\fB\-Wa,\fR\fIoption\fR" 4
--- 10954,10962 ----
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
  .PD
! Print out \s-1GNU CPP\s0's version number.  With one dash, proceed to
  preprocess as normal.  With two dashes, exit immediately.
! .SS "Passing Options to the Assembler"
  .IX Subsection "Passing Options to the Assembler"
  You can pass options to the assembler.
  .IP "\fB\-Wa,\fR\fIoption\fR" 4
*************** recognize.
*** 10969,10975 ****
  .Sp
  If you want to pass an option that takes an argument, you must use
  \&\fB\-Xassembler\fR twice, once for the option and once for the argument.
! .Sh "Options for Linking"
  .IX Subsection "Options for Linking"
  These options come into play when the compiler links object files into
  an executable output file.  They are meaningless if the compiler is
--- 10971,10977 ----
  .Sp
  If you want to pass an option that takes an argument, you must use
  \&\fB\-Xassembler\fR twice, once for the option and once for the argument.
! .SS "Options for Linking"
  .IX Subsection "Options for Linking"
  These options come into play when the compiler links object files into
  an executable output file.  They are meaningless if the compiler is
*************** different symbols to force loading of ad
*** 11256,11262 ****
  \&\fB\-z\fR is passed directly on to the linker along with the keyword
  \&\fIkeyword\fR. See the section in the documentation of your linker for
  permitted values and their meanings.
! .Sh "Options for Directory Search"
  .IX Subsection "Options for Directory Search"
  These options specify directories to search for header files, for
  libraries and for parts of the compiler:
--- 11258,11264 ----
  \&\fB\-z\fR is passed directly on to the linker along with the keyword
  \&\fIkeyword\fR. See the section in the documentation of your linker for
  permitted values and their meanings.
! .SS "Options for Directory Search"
  .IX Subsection "Options for Directory Search"
  These options specify directories to search for header files, for
  libraries and for parts of the compiler:
*************** by default, but it is often satisfactory
*** 11392,11404 ****
  \&\fB\-I\-\fR does not inhibit the use of the standard system directories
  for header files.  Thus, \fB\-I\-\fR and \fB\-nostdinc\fR are
  independent.
! .Sh "Specifying Target Machine and Compiler Version"
  .IX Subsection "Specifying Target Machine and Compiler Version"
  The usual way to run \s-1GCC\s0 is to run the executable called \fBgcc\fR, or
  \&\fImachine\fR\fB\-gcc\fR when cross-compiling, or
  \&\fImachine\fR\fB\-gcc\-\fR\fIversion\fR to run a version other than the
  one that was installed last.
! .Sh "Hardware Models and Configurations"
  .IX Subsection "Hardware Models and Configurations"
  Each target machine types can have its own
  special options, starting with \fB\-m\fR, to choose among various
--- 11394,11406 ----
  \&\fB\-I\-\fR does not inhibit the use of the standard system directories
  for header files.  Thus, \fB\-I\-\fR and \fB\-nostdinc\fR are
  independent.
! .SS "Specifying Target Machine and Compiler Version"
  .IX Subsection "Specifying Target Machine and Compiler Version"
  The usual way to run \s-1GCC\s0 is to run the executable called \fBgcc\fR, or
  \&\fImachine\fR\fB\-gcc\fR when cross-compiling, or
  \&\fImachine\fR\fB\-gcc\-\fR\fIversion\fR to run a version other than the
  one that was installed last.
! .SS "Hardware Models and Configurations"
  .IX Subsection "Hardware Models and Configurations"
  Each target machine types can have its own
  special options, starting with \fB\-m\fR, to choose among various
*************** but long int and pointer are 64\-bit.
*** 11424,11430 ****
  .Sp
  The default depends on the specific target configuration.  Note that
  the \s-1LP64\s0 and \s-1ILP32\s0 ABIs are not link-compatible; you must compile your
! entire program with the same \s-1ABI\s0, and link with a compatible set of libraries.
  .IP "\fB\-mbig\-endian\fR" 4
  .IX Item "-mbig-endian"
  Generate big-endian code.  This is the default when \s-1GCC\s0 is configured for an
--- 11426,11432 ----
  .Sp
  The default depends on the specific target configuration.  Note that
  the \s-1LP64\s0 and \s-1ILP32\s0 ABIs are not link-compatible; you must compile your
! entire program with the same \s-1ABI,\s0 and link with a compatible set of libraries.
  .IP "\fB\-mbig\-endian\fR" 4
  .IX Item "-mbig-endian"
  Generate big-endian code.  This is the default when \s-1GCC\s0 is configured for an
*************** This is the mode used for floating-point
*** 11660,11666 ****
  round-to-nearest-or-even rounding mode.
  .IP "\fBint\fR" 4
  .IX Item "int"
! This is the mode used to perform integer calculations in the \s-1FPU\s0, e.g.
  integer multiply, or integer multiply-and-accumulate.
  .RE
  .RS 4
--- 11662,11668 ----
  round-to-nearest-or-even rounding mode.
  .IP "\fBint\fR" 4
  .IX Item "int"
! This is the mode used to perform integer calculations in the \s-1FPU,\s0 e.g.
  integer multiply, or integer multiply-and-accumulate.
  .RE
  .RS 4
*************** values for \fIcpu\fR are
*** 11722,11734 ****
  .RS 4
  .IP "\fB\s-1ARC600\s0\fR" 4
  .IX Item "ARC600"
! Compile for \s-1ARC600\s0.  Aliases: \fB\-mA6\fR, \fB\-mARC600\fR.
  .IP "\fB\s-1ARC601\s0\fR" 4
  .IX Item "ARC601"
! Compile for \s-1ARC601\s0.  Alias: \fB\-mARC601\fR.
  .IP "\fB\s-1ARC700\s0\fR" 4
  .IX Item "ARC700"
! Compile for \s-1ARC700\s0.  Aliases: \fB\-mA7\fR, \fB\-mARC700\fR.
  This is the default when configured with \fB\-\-with\-cpu=arc700\fR.
  .RE
  .RS 4
--- 11724,11736 ----
  .RS 4
  .IP "\fB\s-1ARC600\s0\fR" 4
  .IX Item "ARC600"
! Compile for \s-1ARC600.\s0  Aliases: \fB\-mA6\fR, \fB\-mARC600\fR.
  .IP "\fB\s-1ARC601\s0\fR" 4
  .IX Item "ARC601"
! Compile for \s-1ARC601.\s0  Alias: \fB\-mARC601\fR.
  .IP "\fB\s-1ARC700\s0\fR" 4
  .IX Item "ARC700"
! Compile for \s-1ARC700.\s0  Aliases: \fB\-mA7\fR, \fB\-mARC700\fR.
  This is the default when configured with \fB\-\-with\-cpu=arc700\fR.
  .RE
  .RS 4
*************** Generate Extended arithmetic instruction
*** 11755,11761 ****
  supported.  This is always enabled for \fB\-mcpu=ARC700\fR.
  .IP "\fB\-mno\-mpy\fR" 4
  .IX Item "-mno-mpy"
! Do not generate mpy instructions for \s-1ARC700\s0.
  .IP "\fB\-mmul32x16\fR" 4
  .IX Item "-mmul32x16"
  Generate 32x16 bit multiply and mac instructions.
--- 11757,11763 ----
  supported.  This is always enabled for \fB\-mcpu=ARC700\fR.
  .IP "\fB\-mno\-mpy\fR" 4
  .IX Item "-mno-mpy"
! Do not generate mpy instructions for \s-1ARC700.\s0
  .IP "\fB\-mmul32x16\fR" 4
  .IX Item "-mmul32x16"
  Generate 32x16 bit multiply and mac instructions.
*************** implementation.
*** 11780,11786 ****
  implementation.
  .IP "\fB\-msimd\fR" 4
  .IX Item "-msimd"
! Enable generation of \s-1ARC\s0 \s-1SIMD\s0 instructions via target-specific
  builtins.  Only valid for \fB\-mcpu=ARC700\fR.
  .IP "\fB\-msoft\-float\fR" 4
  .IX Item "-msoft-float"
--- 11782,11788 ----
  implementation.
  .IP "\fB\-msimd\fR" 4
  .IX Item "-msimd"
! Enable generation of \s-1ARC SIMD\s0 instructions via target-specific
  builtins.  Only valid for \fB\-mcpu=ARC700\fR.
  .IP "\fB\-msoft\-float\fR" 4
  .IX Item "-msoft-float"
*************** optimizers then assume that indexed stor
*** 11947,11953 ****
  the case.
  .IP "\fB\-mlra\fR" 4
  .IX Item "-mlra"
! Enable Local Register Allocation.  This is still experimental for \s-1ARC\s0,
  so by default the compiler uses standard reload
  (i.e. \fB\-mno\-lra\fR).
  .IP "\fB\-mlra\-priority\-none\fR" 4
--- 11949,11955 ----
  the case.
  .IP "\fB\-mlra\fR" 4
  .IX Item "-mlra"
! Enable Local Register Allocation.  This is still experimental for \s-1ARC,\s0
  so by default the compiler uses standard reload
  (i.e. \fB\-mno\-lra\fR).
  .IP "\fB\-mlra\-priority\-none\fR" 4
*************** The following options are maintained for
*** 12053,12059 ****
  are now deprecated and will be removed in a future release:
  .IP "\fB\-margonaut\fR" 4
  .IX Item "-margonaut"
! Obsolete \s-1FPX\s0.
  .IP "\fB\-mbig\-endian\fR" 4
  .IX Item "-mbig-endian"
  .PD 0
--- 12055,12061 ----
  are now deprecated and will be removed in a future release:
  .IP "\fB\-margonaut\fR" 4
  .IX Item "-margonaut"
! Obsolete \s-1FPX.\s0
  .IP "\fB\-mbig\-endian\fR" 4
  .IX Item "-mbig-endian"
  .PD 0
*************** Replaced by \fB\-mmultcost\fR.
*** 12116,12122 ****
  These \fB\-m\fR options are defined for the \s-1ARM\s0 port:
  .IP "\fB\-mabi=\fR\fIname\fR" 4
  .IX Item "-mabi=name"
! Generate code for the specified \s-1ABI\s0.  Permissible values are: \fBapcs-gnu\fR,
  \&\fBatpcs\fR, \fBaapcs\fR, \fBaapcs-linux\fR and \fBiwmmxt\fR.
  .IP "\fB\-mapcs\-frame\fR" 4
  .IX Item "-mapcs-frame"
--- 12118,12124 ----
  These \fB\-m\fR options are defined for the \s-1ARM\s0 port:
  .IP "\fB\-mabi=\fR\fIname\fR" 4
  .IX Item "-mabi=name"
! Generate code for the specified \s-1ABI.\s0  Permissible values are: \fBapcs-gnu\fR,
  \&\fBatpcs\fR, \fBaapcs\fR, \fBaapcs-linux\fR and \fBiwmmxt\fR.
  .IP "\fB\-mapcs\-frame\fR" 4
  .IX Item "-mapcs-frame"
*************** and uses FPU-specific calling convention
*** 12160,12166 ****
  .Sp
  The default depends on the specific target configuration.  Note that
  the hard-float and soft-float ABIs are not link-compatible; you must
! compile your entire program with the same \s-1ABI\s0, and link with a
  compatible set of libraries.
  .IP "\fB\-mlittle\-endian\fR" 4
  .IX Item "-mlittle-endian"
--- 12162,12168 ----
  .Sp
  The default depends on the specific target configuration.  Note that
  the hard-float and soft-float ABIs are not link-compatible; you must
! compile your entire program with the same \s-1ABI,\s0 and link with a
  compatible set of libraries.
  .IP "\fB\-mlittle\-endian\fR" 4
  .IX Item "-mlittle-endian"
*************** If the selected floating-point hardware
*** 12290,12296 ****
  (e.g. \fB\-mfpu\fR=\fBneon\fR), note that floating-point
  operations are not generated by \s-1GCC\s0's auto-vectorization pass unless
  \&\fB\-funsafe\-math\-optimizations\fR is also specified.  This is
! because \s-1NEON\s0 hardware does not fully implement the \s-1IEEE\s0 754 standard for
  floating-point arithmetic (in particular denormal values are treated as
  zero), so the use of \s-1NEON\s0 instructions may lead to a loss of precision.
  .IP "\fB\-mfp16\-format=\fR\fIname\fR" 4
--- 12292,12298 ----
  (e.g. \fB\-mfpu\fR=\fBneon\fR), note that floating-point
  operations are not generated by \s-1GCC\s0's auto-vectorization pass unless
  \&\fB\-funsafe\-math\-optimizations\fR is also specified.  This is
! because \s-1NEON\s0 hardware does not fully implement the \s-1IEEE 754\s0 standard for
  floating-point arithmetic (in particular denormal values are treated as
  zero), so the use of \s-1NEON\s0 instructions may lead to a loss of precision.
  .IP "\fB\-mfp16\-format=\fR\fIname\fR" 4
*************** otherwise the default is \fBR10\fR.
*** 12363,12369 ****
  .IX Item "-mpic-data-is-text-relative"
  Assume that each data segments are relative to text segment at load time.
  Therefore, it permits addressing data using PC-relative operations.
! This option is on by default for targets other than VxWorks \s-1RTP\s0.
  .IP "\fB\-mpoke\-function\-name\fR" 4
  .IX Item "-mpoke-function-name"
  Write the name of each function into the text section, directly
--- 12365,12371 ----
  .IX Item "-mpic-data-is-text-relative"
  Assume that each data segments are relative to text segment at load time.
  Therefore, it permits addressing data using PC-relative operations.
! This option is on by default for targets other than VxWorks \s-1RTP.\s0
  .IP "\fB\-mpoke\-function\-name\fR" 4
  .IX Item "-mpoke-function-name"
  Write the name of each function into the text section, directly
*************** off by default.
*** 12487,12493 ****
  Assume inline assembler is using unified asm syntax.  The default is
  currently off which implies divided syntax.  Currently this option is
  available only for Thumb1 and has no effect on \s-1ARM\s0 state and Thumb2.
! However, this may change in future releases of \s-1GCC\s0.  Divided syntax
  should be considered deprecated.
  .IP "\fB\-mrestrict\-it\fR" 4
  .IX Item "-mrestrict-it"
--- 12489,12495 ----
  Assume inline assembler is using unified asm syntax.  The default is
  currently off which implies divided syntax.  Currently this option is
  available only for Thumb1 and has no effect on \s-1ARM\s0 state and Thumb2.
! However, this may change in future releases of \s-1GCC.\s0  Divided syntax
  should be considered deprecated.
  .IP "\fB\-mrestrict\-it\fR" 4
  .IX Item "-mrestrict-it"
*************** The default for this option is@tie{}\fBa
*** 12556,12592 ****
  .ie n .IP """avr6""" 4
  .el .IP "\f(CWavr6\fR" 4
  .IX Item "avr6"
! \&\*(L"Enhanced\*(R" devices with 3\-byte \s-1PC\s0, i.e. with more than 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atmega256rfr2\*(C'\fR, \f(CW\*(C`atmega2560\*(C'\fR, \f(CW\*(C`atmega2561\*(C'\fR, \f(CW\*(C`atmega2564rfr2\*(C'\fR.
  .ie n .IP """avrxmega2""" 4
  .el .IP "\f(CWavrxmega2\fR" 4
  .IX Item "avrxmega2"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 8@tie{}KiB and up to 64@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega16a4\*(C'\fR, \f(CW\*(C`atxmega16a4u\*(C'\fR, \f(CW\*(C`atxmega16c4\*(C'\fR, \f(CW\*(C`atxmega16d4\*(C'\fR, \f(CW\*(C`atxmega16e5\*(C'\fR, \f(CW\*(C`atxmega32a4\*(C'\fR, \f(CW\*(C`atxmega32a4u\*(C'\fR, \f(CW\*(C`atxmega32c3\*(C'\fR, \f(CW\*(C`atxmega32c4\*(C'\fR, \f(CW\*(C`atxmega32d3\*(C'\fR, \f(CW\*(C`atxmega32d4\*(C'\fR, \f(CW\*(C`atxmega32e5\*(C'\fR, \f(CW\*(C`atxmega8e5\*(C'\fR.
  .ie n .IP """avrxmega4""" 4
  .el .IP "\f(CWavrxmega4\fR" 4
  .IX Item "avrxmega4"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 64@tie{}KiB and up to 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega64a3\*(C'\fR, \f(CW\*(C`atxmega64a3u\*(C'\fR, \f(CW\*(C`atxmega64a4u\*(C'\fR, \f(CW\*(C`atxmega64b1\*(C'\fR, \f(CW\*(C`atxmega64b3\*(C'\fR, \f(CW\*(C`atxmega64c3\*(C'\fR, \f(CW\*(C`atxmega64d3\*(C'\fR, \f(CW\*(C`atxmega64d4\*(C'\fR.
  .ie n .IP """avrxmega5""" 4
  .el .IP "\f(CWavrxmega5\fR" 4
  .IX Item "avrxmega5"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 64@tie{}KiB and up to 128@tie{}KiB of program memory and more than 64@tie{}KiB of \s-1RAM\s0.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega64a1\*(C'\fR, \f(CW\*(C`atxmega64a1u\*(C'\fR.
  .ie n .IP """avrxmega6""" 4
  .el .IP "\f(CWavrxmega6\fR" 4
  .IX Item "avrxmega6"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega128a3\*(C'\fR, \f(CW\*(C`atxmega128a3u\*(C'\fR, \f(CW\*(C`atxmega128b1\*(C'\fR, \f(CW\*(C`atxmega128b3\*(C'\fR, \f(CW\*(C`atxmega128c3\*(C'\fR, \f(CW\*(C`atxmega128d3\*(C'\fR, \f(CW\*(C`atxmega128d4\*(C'\fR, \f(CW\*(C`atxmega192a3\*(C'\fR, \f(CW\*(C`atxmega192a3u\*(C'\fR, \f(CW\*(C`atxmega192c3\*(C'\fR, \f(CW\*(C`atxmega192d3\*(C'\fR, \f(CW\*(C`atxmega256a3\*(C'\fR, \f(CW\*(C`atxmega256a3b\*(C'\fR, \f(CW\*(C`atxmega256a3bu\*(C'\fR, \f(CW\*(C`atxmega256a3u\*(C'\fR, \f(CW\*(C`atxmega256c3\*(C'\fR, \f(CW\*(C`atxmega256d3\*(C'\fR, \f(CW\*(C`atxmega384c3\*(C'\fR, \f(CW\*(C`atxmega384d3\*(C'\fR.
  .ie n .IP """avrxmega7""" 4
  .el .IP "\f(CWavrxmega7\fR" 4
  .IX Item "avrxmega7"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 128@tie{}KiB of program memory and more than 64@tie{}KiB of \s-1RAM\s0.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega128a1\*(C'\fR, \f(CW\*(C`atxmega128a1u\*(C'\fR, \f(CW\*(C`atxmega128a4u\*(C'\fR.
  .ie n .IP """avrtiny""" 4
  .el .IP "\f(CWavrtiny\fR" 4
  .IX Item "avrtiny"
! \&\*(L"\s-1TINY\s0\*(R" Tiny core devices with 512@tie{}B up to 4@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`attiny10\*(C'\fR, \f(CW\*(C`attiny20\*(C'\fR, \f(CW\*(C`attiny4\*(C'\fR, \f(CW\*(C`attiny40\*(C'\fR, \f(CW\*(C`attiny5\*(C'\fR, \f(CW\*(C`attiny9\*(C'\fR.
  .ie n .IP """avr1""" 4
  .el .IP "\f(CWavr1\fR" 4
--- 12558,12594 ----
  .ie n .IP """avr6""" 4
  .el .IP "\f(CWavr6\fR" 4
  .IX Item "avr6"
! \&\*(L"Enhanced\*(R" devices with 3\-byte \s-1PC,\s0 i.e. with more than 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atmega256rfr2\*(C'\fR, \f(CW\*(C`atmega2560\*(C'\fR, \f(CW\*(C`atmega2561\*(C'\fR, \f(CW\*(C`atmega2564rfr2\*(C'\fR.
  .ie n .IP """avrxmega2""" 4
  .el .IP "\f(CWavrxmega2\fR" 4
  .IX Item "avrxmega2"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 8@tie{}KiB and up to 64@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega16a4\*(C'\fR, \f(CW\*(C`atxmega16a4u\*(C'\fR, \f(CW\*(C`atxmega16c4\*(C'\fR, \f(CW\*(C`atxmega16d4\*(C'\fR, \f(CW\*(C`atxmega16e5\*(C'\fR, \f(CW\*(C`atxmega32a4\*(C'\fR, \f(CW\*(C`atxmega32a4u\*(C'\fR, \f(CW\*(C`atxmega32c3\*(C'\fR, \f(CW\*(C`atxmega32c4\*(C'\fR, \f(CW\*(C`atxmega32d3\*(C'\fR, \f(CW\*(C`atxmega32d4\*(C'\fR, \f(CW\*(C`atxmega32e5\*(C'\fR, \f(CW\*(C`atxmega8e5\*(C'\fR.
  .ie n .IP """avrxmega4""" 4
  .el .IP "\f(CWavrxmega4\fR" 4
  .IX Item "avrxmega4"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 64@tie{}KiB and up to 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega64a3\*(C'\fR, \f(CW\*(C`atxmega64a3u\*(C'\fR, \f(CW\*(C`atxmega64a4u\*(C'\fR, \f(CW\*(C`atxmega64b1\*(C'\fR, \f(CW\*(C`atxmega64b3\*(C'\fR, \f(CW\*(C`atxmega64c3\*(C'\fR, \f(CW\*(C`atxmega64d3\*(C'\fR, \f(CW\*(C`atxmega64d4\*(C'\fR.
  .ie n .IP """avrxmega5""" 4
  .el .IP "\f(CWavrxmega5\fR" 4
  .IX Item "avrxmega5"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 64@tie{}KiB and up to 128@tie{}KiB of program memory and more than 64@tie{}KiB of \s-1RAM.\s0
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega64a1\*(C'\fR, \f(CW\*(C`atxmega64a1u\*(C'\fR.
  .ie n .IP """avrxmega6""" 4
  .el .IP "\f(CWavrxmega6\fR" 4
  .IX Item "avrxmega6"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega128a3\*(C'\fR, \f(CW\*(C`atxmega128a3u\*(C'\fR, \f(CW\*(C`atxmega128b1\*(C'\fR, \f(CW\*(C`atxmega128b3\*(C'\fR, \f(CW\*(C`atxmega128c3\*(C'\fR, \f(CW\*(C`atxmega128d3\*(C'\fR, \f(CW\*(C`atxmega128d4\*(C'\fR, \f(CW\*(C`atxmega192a3\*(C'\fR, \f(CW\*(C`atxmega192a3u\*(C'\fR, \f(CW\*(C`atxmega192c3\*(C'\fR, \f(CW\*(C`atxmega192d3\*(C'\fR, \f(CW\*(C`atxmega256a3\*(C'\fR, \f(CW\*(C`atxmega256a3b\*(C'\fR, \f(CW\*(C`atxmega256a3bu\*(C'\fR, \f(CW\*(C`atxmega256a3u\*(C'\fR, \f(CW\*(C`atxmega256c3\*(C'\fR, \f(CW\*(C`atxmega256d3\*(C'\fR, \f(CW\*(C`atxmega384c3\*(C'\fR, \f(CW\*(C`atxmega384d3\*(C'\fR.
  .ie n .IP """avrxmega7""" 4
  .el .IP "\f(CWavrxmega7\fR" 4
  .IX Item "avrxmega7"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 128@tie{}KiB of program memory and more than 64@tie{}KiB of \s-1RAM.\s0
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega128a1\*(C'\fR, \f(CW\*(C`atxmega128a1u\*(C'\fR, \f(CW\*(C`atxmega128a4u\*(C'\fR.
  .ie n .IP """avrtiny""" 4
  .el .IP "\f(CWavrtiny\fR" 4
  .IX Item "avrtiny"
! \&\*(L"\s-1TINY\*(R"\s0 Tiny core devices with 512@tie{}B up to 4@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`attiny10\*(C'\fR, \f(CW\*(C`attiny20\*(C'\fR, \f(CW\*(C`attiny4\*(C'\fR, \f(CW\*(C`attiny40\*(C'\fR, \f(CW\*(C`attiny5\*(C'\fR, \f(CW\*(C`attiny9\*(C'\fR.
  .ie n .IP """avr1""" 4
  .el .IP "\f(CWavr1\fR" 4
*************** performed as
*** 12691,12701 ****
  Only change the lower 8@tie{}bits of the stack pointer.
  .IP "\fB\-nodevicelib\fR" 4
  .IX Item "-nodevicelib"
! Don't link against AVR-LibC's device specific library \f(CW\*(C`libdev.a\*(C'\fR.
  .IP "\fB\-Waddr\-space\-convert\fR" 4
  .IX Item "-Waddr-space-convert"
  Warn about conversions between address spaces in the case where the
  resulting address space is not contained in the incoming address space.
  .PP
  \f(CW\*(C`EIND\*(C'\fR and Devices with More Than 128 Ki Bytes of Flash
  .IX Subsection "EIND and Devices with More Than 128 Ki Bytes of Flash"
--- 12693,12707 ----
  Only change the lower 8@tie{}bits of the stack pointer.
  .IP "\fB\-nodevicelib\fR" 4
  .IX Item "-nodevicelib"
! Don't link against AVR-LibC's device specific library \f(CW\*(C`lib<mcu>.a\*(C'\fR.
  .IP "\fB\-Waddr\-space\-convert\fR" 4
  .IX Item "-Waddr-space-convert"
  Warn about conversions between address spaces in the case where the
  resulting address space is not contained in the incoming address space.
+ .IP "\fB\-Wmisspelled\-isr\fR" 4
+ .IX Item "-Wmisspelled-isr"
+ Warn if the \s-1ISR\s0 is misspelled, i.e. without \f(CW\*(C`_\|_vector\*(C'\fR prefix.
+ Enabled by default.
  .PP
  \f(CW\*(C`EIND\*(C'\fR and Devices with More Than 128 Ki Bytes of Flash
  .IX Subsection "EIND and Devices with More Than 128 Ki Bytes of Flash"
*************** command-line option.
*** 12802,12808 ****
  .IX Item "-<Switch/case dispatch tables. If you do not want such dispatch>"
  tables you can specify the \fB\-fno\-jump\-tables\fR command-line option.
  .IP "\-<C and \*(C+ constructors/destructors called during startup/shutdown.>" 4
! .IX Item "-<C and  constructors/destructors called during startup/shutdown.>"
  .PD 0
  .ie n .IP "\-<If the tools hit a ""gs()"" modifier explained above.>" 4
  .el .IP "\-<If the tools hit a \f(CWgs()\fR modifier explained above.>" 4
--- 12808,12814 ----
  .IX Item "-<Switch/case dispatch tables. If you do not want such dispatch>"
  tables you can specify the \fB\-fno\-jump\-tables\fR command-line option.
  .IP "\-<C and \*(C+ constructors/destructors called during startup/shutdown.>" 4
! .IX Item "-<C and constructors/destructors called during startup/shutdown.>"
  .PD 0
  .ie n .IP "\-<If the tools hit a ""gs()"" modifier explained above.>" 4
  .el .IP "\-<If the tools hit a \f(CWgs()\fR modifier explained above.>" 4
*************** for \fImcu\fR=\f(CW\*(C`avrtiny\*(C'\fR,
*** 12903,12909 ****
  If \fImcu\fR specifies a device, this built-in macro is set
  accordingly. For example, with \fB\-mmcu=atmega8\fR the macro is
  defined to \f(CW4\fR.
! .ie n .IP """_\|_AVR_\f(CIDevice\f(CW_\|_""" 4
  .el .IP "\f(CW_\|_AVR_\f(CIDevice\f(CW_\|_\fR" 4
  .IX Item "__AVR_Device__"
  Setting \fB\-mmcu=\fR\fIdevice\fR defines this built-in macro which reflects
--- 12909,12915 ----
  If \fImcu\fR specifies a device, this built-in macro is set
  accordingly. For example, with \fB\-mmcu=atmega8\fR the macro is
  defined to \f(CW4\fR.
! .ie n .IP """_\|_AVR_\fIDevice\fP_\|_""" 4
  .el .IP "\f(CW_\|_AVR_\f(CIDevice\f(CW_\|_\fR" 4
  .IX Item "__AVR_Device__"
  Setting \fB\-mmcu=\fR\fIdevice\fR defines this built-in macro which reflects
*************** This macro reflects the \fB\-mno\-interr
*** 13030,13036 ****
  .el .IP "\f(CW_\|_AVR_ERRATA_SKIP_JMP_CALL_\|_\fR" 4
  .IX Item "__AVR_ERRATA_SKIP_JMP_CALL__"
  .PD
! Some \s-1AVR\s0 devices (\s-1AT90S8515\s0, ATmega103) must not skip 32\-bit
  instructions because of a hardware erratum.  Skip instructions are
  \&\f(CW\*(C`SBRS\*(C'\fR, \f(CW\*(C`SBRC\*(C'\fR, \f(CW\*(C`SBIS\*(C'\fR, \f(CW\*(C`SBIC\*(C'\fR and \f(CW\*(C`CPSE\*(C'\fR.
  The second macro is only defined if \f(CW\*(C`_\|_AVR_HAVE_JMP_CALL_\|_\*(C'\fR is also
--- 13036,13042 ----
  .el .IP "\f(CW_\|_AVR_ERRATA_SKIP_JMP_CALL_\|_\fR" 4
  .IX Item "__AVR_ERRATA_SKIP_JMP_CALL__"
  .PD
! Some \s-1AVR\s0 devices (\s-1AT90S8515,\s0 ATmega103) must not skip 32\-bit
  instructions because of a hardware erratum.  Skip instructions are
  \&\f(CW\*(C`SBRS\*(C'\fR, \f(CW\*(C`SBRC\*(C'\fR, \f(CW\*(C`SBIS\*(C'\fR, \f(CW\*(C`SBIC\*(C'\fR and \f(CW\*(C`CPSE\*(C'\fR.
  The second macro is only defined if \f(CW\*(C`_\|_AVR_HAVE_JMP_CALL_\|_\*(C'\fR is also
*************** set.
*** 13038,13045 ****
  .ie n .IP """_\|_AVR_ISA_RMW_\|_""" 4
  .el .IP "\f(CW_\|_AVR_ISA_RMW_\|_\fR" 4
  .IX Item "__AVR_ISA_RMW__"
! The device has Read-Modify-Write instructions (\s-1XCH\s0, \s-1LAC\s0, \s-1LAS\s0 and \s-1LAT\s0).
! .ie n .IP """_\|_AVR_SFR_OFFSET_\|_=\f(CIoffset\f(CW""" 4
  .el .IP "\f(CW_\|_AVR_SFR_OFFSET_\|_=\f(CIoffset\f(CW\fR" 4
  .IX Item "__AVR_SFR_OFFSET__=offset"
  Instructions that can address I/O special function registers directly
--- 13044,13051 ----
  .ie n .IP """_\|_AVR_ISA_RMW_\|_""" 4
  .el .IP "\f(CW_\|_AVR_ISA_RMW_\|_\fR" 4
  .IX Item "__AVR_ISA_RMW__"
! The device has Read-Modify-Write instructions (\s-1XCH, LAC, LAS\s0 and \s-1LAT\s0).
! .ie n .IP """_\|_AVR_SFR_OFFSET_\|_=\fIoffset\fP""" 4
  .el .IP "\f(CW_\|_AVR_SFR_OFFSET_\|_=\f(CIoffset\f(CW\fR" 4
  .IX Item "__AVR_SFR_OFFSET__=offset"
  Instructions that can address I/O special function registers directly
*************** should be used instead of \f(CW\*(C`main
*** 13222,13229 ****
  This option can only be used in conjunction with \fB\-mmulticore\fR.
  .IP "\fB\-msdram\fR" 4
  .IX Item "-msdram"
! Build a standalone application for \s-1SDRAM\s0. Proper start files and
! link scripts are used to put the application into \s-1SDRAM\s0, and the macro
  \&\f(CW\*(C`_\|_BFIN_SDRAM\*(C'\fR is defined.
  The loader should initialize \s-1SDRAM\s0 before loading the application.
  .IP "\fB\-micplb\fR" 4
--- 13228,13235 ----
  This option can only be used in conjunction with \fB\-mmulticore\fR.
  .IP "\fB\-msdram\fR" 4
  .IX Item "-msdram"
! Build a standalone application for \s-1SDRAM.\s0 Proper start files and
! link scripts are used to put the application into \s-1SDRAM,\s0 and the macro
  \&\f(CW\*(C`_\|_BFIN_SDRAM\*(C'\fR is defined.
  The loader should initialize \s-1SDRAM\s0 before loading the application.
  .IP "\fB\-micplb\fR" 4
*************** These options are defined specifically f
*** 13282,13288 ****
  .PD
  Generate code for the specified architecture.  The choices for
  \&\fIarchitecture-type\fR are \fBv3\fR, \fBv8\fR and \fBv10\fR for
! respectively \s-1ETRAX\s0\ 4, \s-1ETRAX\s0\ 100, and \s-1ETRAX\s0\ 100\ \s-1LX\s0.
  Default is \fBv0\fR except for cris-axis-linux-gnu, where the default is
  \&\fBv10\fR.
  .IP "\fB\-mtune=\fR\fIarchitecture-type\fR" 4
--- 13288,13294 ----
  .PD
  Generate code for the specified architecture.  The choices for
  \&\fIarchitecture-type\fR are \fBv3\fR, \fBv8\fR and \fBv10\fR for
! respectively \s-1ETRAX\s0\ 4, \s-1ETRAX\s0\ 100, and \s-1ETRAX\s0\ 100\ \s-1LX.\s0
  Default is \fBv0\fR except for cris-axis-linux-gnu, where the default is
  \&\fBv10\fR.
  .IP "\fB\-mtune=\fR\fIarchitecture-type\fR" 4
*************** or storage for local variables needs to
*** 13375,13381 ****
  With \fB\-fpic\fR and \fB\-fPIC\fR, don't generate (do generate)
  instruction sequences that load addresses for functions from the \s-1PLT\s0 part
  of the \s-1GOT\s0 rather than (traditional on other architectures) calls to the
! \&\s-1PLT\s0.  The default is \fB\-mgotplt\fR.
  .IP "\fB\-melf\fR" 4
  .IX Item "-melf"
  Legacy no-op option only recognized with the cris-axis-elf and
--- 13381,13387 ----
  With \fB\-fpic\fR and \fB\-fPIC\fR, don't generate (do generate)
  instruction sequences that load addresses for functions from the \s-1PLT\s0 part
  of the \s-1GOT\s0 rather than (traditional on other architectures) calls to the
! \&\s-1PLT.\s0  The default is \fB\-mgotplt\fR.
  .IP "\fB\-melf\fR" 4
  .IX Item "-melf"
  Legacy no-op option only recognized with the cris-axis-elf and
*************** However, \fBfar\fR is not valid with \fB
*** 13431,13437 ****
  These options are defined for all architectures running the Darwin operating
  system.
  .PP
! \&\s-1FSF\s0 \s-1GCC\s0 on Darwin does not create \*(L"fat\*(R" object files; it creates
  an object file for the single architecture that \s-1GCC\s0 was built to
  target.  Apple's \s-1GCC\s0 on Darwin does create \*(L"fat\*(R" files if multiple
  \&\fB\-arch\fR options are used; it does so by running the compiler or
--- 13437,13443 ----
  These options are defined for all architectures running the Darwin operating
  system.
  .PP
! \&\s-1FSF GCC\s0 on Darwin does not create \*(L"fat\*(R" object files; it creates
  an object file for the single architecture that \s-1GCC\s0 was built to
  target.  Apple's \s-1GCC\s0 on Darwin does create \*(L"fat\*(R" files if multiple
  \&\fB\-arch\fR options are used; it does so by running the compiler or
*************** warn about constructs contained within h
*** 13491,13497 ****
  .IX Item "-gused"
  Emit debugging information for symbols that are used.  For stabs
  debugging format, this enables \fB\-feliminate\-unused\-debug\-symbols\fR.
! This is by default \s-1ON\s0.
  .IP "\fB\-gfull\fR" 4
  .IX Item "-gfull"
  Emit debugging information for all symbols and types.
--- 13497,13503 ----
  .IX Item "-gused"
  Emit debugging information for symbols that are used.  For stabs
  debugging format, this enables \fB\-feliminate\-unused\-debug\-symbols\fR.
! This is by default \s-1ON.\s0
  .IP "\fB\-gfull\fR" 4
  .IX Item "-gfull"
  Emit debugging information for all symbols and types.
*************** an executable when linking, using the Da
*** 13567,13573 ****
  This causes \s-1GCC\s0's output file to have the \fB\s-1ALL\s0\fR subtype, instead of
  one controlled by the \fB\-mcpu\fR or \fB\-march\fR option.
  .IP "\fB\-allowable_client\fR  \fIclient_name\fR" 4
! .IX Item "-allowable_client  client_name"
  .PD 0
  .IP "\fB\-client_name\fR" 4
  .IX Item "-client_name"
--- 13573,13579 ----
  This causes \s-1GCC\s0's output file to have the \fB\s-1ALL\s0\fR subtype, instead of
  one controlled by the \fB\-mcpu\fR or \fB\-march\fR option.
  .IP "\fB\-allowable_client\fR  \fIclient_name\fR" 4
! .IX Item "-allowable_client client_name"
  .PD 0
  .IP "\fB\-client_name\fR" 4
  .IX Item "-client_name"
*************** before it can find the variables and con
*** 13867,13874 ****
  .IP "\fB\-mno\-max\fR" 4
  .IX Item "-mno-max"
  .PD
! Indicate whether \s-1GCC\s0 should generate code to use the optional \s-1BWX\s0,
! \&\s-1CIX\s0, \s-1FIX\s0 and \s-1MAX\s0 instruction sets.  The default is to use the instruction
  sets supported by the \s-1CPU\s0 type specified via \fB\-mcpu=\fR option or that
  of the \s-1CPU\s0 on which \s-1GCC\s0 was built if none is specified.
  .IP "\fB\-mfloat\-vax\fR" 4
--- 13873,13880 ----
  .IP "\fB\-mno\-max\fR" 4
  .IX Item "-mno-max"
  .PD
! Indicate whether \s-1GCC\s0 should generate code to use the optional \s-1BWX,
! CIX, FIX\s0 and \s-1MAX\s0 instruction sets.  The default is to use the instruction
  sets supported by the \s-1CPU\s0 type specified via \fB\-mcpu=\fR option or that
  of the \s-1CPU\s0 on which \s-1GCC\s0 was built if none is specified.
  .IP "\fB\-mfloat\-vax\fR" 4
*************** of the \s-1CPU\s0 on which \s-1GCC\s0 wa
*** 13877,13883 ****
  .IP "\fB\-mfloat\-ieee\fR" 4
  .IX Item "-mfloat-ieee"
  .PD
! Generate code that uses (does not use) \s-1VAX\s0 F and G floating-point
  arithmetic instead of \s-1IEEE\s0 single and double precision.
  .IP "\fB\-mexplicit\-relocs\fR" 4
  .IX Item "-mexplicit-relocs"
--- 13883,13889 ----
  .IP "\fB\-mfloat\-ieee\fR" 4
  .IX Item "-mfloat-ieee"
  .PD
! Generate code that uses (does not use) \s-1VAX F\s0 and G floating-point
  arithmetic instead of \s-1IEEE\s0 single and double precision.
  .IP "\fB\-mexplicit\-relocs\fR" 4
  .IX Item "-mexplicit-relocs"
*************** The default is \fB\-mlarge\-text\fR.
*** 13932,13938 ****
  Set the instruction set and instruction scheduling parameters for
  machine type \fIcpu_type\fR.  You can specify either the \fB\s-1EV\s0\fR
  style name or the corresponding chip number.  \s-1GCC\s0 supports scheduling
! parameters for the \s-1EV4\s0, \s-1EV5\s0 and \s-1EV6\s0 family of processors and
  chooses the default values for the instruction set from the processor
  you specify.  If you do not specify a processor type, \s-1GCC\s0 defaults
  to the processor on which the compiler was built.
--- 13938,13944 ----
  Set the instruction set and instruction scheduling parameters for
  machine type \fIcpu_type\fR.  You can specify either the \fB\s-1EV\s0\fR
  style name or the corresponding chip number.  \s-1GCC\s0 supports scheduling
! parameters for the \s-1EV4, EV5\s0 and \s-1EV6\s0 family of processors and
  chooses the default values for the instruction set from the processor
  you specify.  If you do not specify a processor type, \s-1GCC\s0 defaults
  to the processor on which the compiler was built.
*************** Schedules as an \s-1EV5\s0 and supports
*** 13977,13990 ****
  .IP "\fB21264\fR" 4
  .IX Item "21264"
  .PD
! Schedules as an \s-1EV6\s0 and supports the \s-1BWX\s0, \s-1FIX\s0, and \s-1MAX\s0 extensions.
  .IP "\fBev67\fR" 4
  .IX Item "ev67"
  .PD 0
  .IP "\fB21264a\fR" 4
  .IX Item "21264a"
  .PD
! Schedules as an \s-1EV6\s0 and supports the \s-1BWX\s0, \s-1CIX\s0, \s-1FIX\s0, and \s-1MAX\s0 extensions.
  .RE
  .RS 4
  .Sp
--- 13983,13996 ----
  .IP "\fB21264\fR" 4
  .IX Item "21264"
  .PD
! Schedules as an \s-1EV6\s0 and supports the \s-1BWX, FIX,\s0 and \s-1MAX\s0 extensions.
  .IP "\fBev67\fR" 4
  .IX Item "ev67"
  .PD 0
  .IP "\fB21264a\fR" 4
  .IX Item "21264a"
  .PD
! Schedules as an \s-1EV6\s0 and supports the \s-1BWX, CIX, FIX,\s0 and \s-1MAX\s0 extensions.
  .RE
  .RS 4
  .Sp
*************** A decimal number representing clock cycl
*** 14025,14033 ****
  .IX Item "main"
  .PD
  The compiler contains estimates of the number of clock cycles for
! \&\*(L"typical\*(R" \s-1EV4\s0 & \s-1EV5\s0 hardware for the Level 1, 2 & 3 caches
  (also called Dcache, Scache, and Bcache), as well as to main memory.
! Note that L3 is only valid for \s-1EV5\s0.
  .RE
  .RS 4
  .RE
--- 14031,14039 ----
  .IX Item "main"
  .PD
  The compiler contains estimates of the number of clock cycles for
! \&\*(L"typical\*(R" \s-1EV4 & EV5\s0 hardware for the Level 1, 2 & 3 caches
  (also called Dcache, Scache, and Bcache), as well as to main memory.
! Note that L3 is only valid for \s-1EV5.\s0
  .RE
  .RS 4
  .RE
*************** Use multiply and add/subtract instructio
*** 14100,14106 ****
  Do not use multiply and add/subtract instructions.
  .IP "\fB\-mfdpic\fR" 4
  .IX Item "-mfdpic"
! Select the \s-1FDPIC\s0 \s-1ABI\s0, which uses function descriptors to represent
  pointers to functions.  Without any PIC/PIE\-related options, it
  implies \fB\-fPIE\fR.  With \fB\-fpic\fR or \fB\-fpie\fR, it
  assumes \s-1GOT\s0 entries and small data are within a 12\-bit range from the
--- 14106,14112 ----
  Do not use multiply and add/subtract instructions.
  .IP "\fB\-mfdpic\fR" 4
  .IX Item "-mfdpic"
! Select the \s-1FDPIC ABI,\s0 which uses function descriptors to represent
  pointers to functions.  Without any PIC/PIE\-related options, it
  implies \fB\-fPIE\fR.  With \fB\-fpic\fR or \fB\-fpie\fR, it
  assumes \s-1GOT\s0 entries and small data are within a 12\-bit range from the
*************** Assume a large \s-1TLS\s0 segment when g
*** 14123,14129 ****
  Do not assume a large \s-1TLS\s0 segment when generating thread-local code.
  .IP "\fB\-mgprel\-ro\fR" 4
  .IX Item "-mgprel-ro"
! Enable the use of \f(CW\*(C`GPREL\*(C'\fR relocations in the \s-1FDPIC\s0 \s-1ABI\s0 for data
  that is known to be in read-only sections.  It's enabled by default,
  except for \fB\-fpic\fR or \fB\-fpie\fR: even though it may help
  make the global offset table smaller, it trades 1 instruction for 4.
--- 14129,14135 ----
  Do not assume a large \s-1TLS\s0 segment when generating thread-local code.
  .IP "\fB\-mgprel\-ro\fR" 4
  .IX Item "-mgprel-ro"
! Enable the use of \f(CW\*(C`GPREL\*(C'\fR relocations in the \s-1FDPIC ABI\s0 for data
  that is known to be in read-only sections.  It's enabled by default,
  except for \fB\-fpic\fR or \fB\-fpie\fR: even though it may help
  make the global offset table smaller, it trades 1 instruction for 4.
*************** Select the processor type for which to g
*** 14267,14273 ****
  These \fB\-m\fR options are defined for GNU/Linux targets:
  .IP "\fB\-mglibc\fR" 4
  .IX Item "-mglibc"
! Use the \s-1GNU\s0 C library.  This is the default except
  on \fB*\-*\-linux\-*uclibc*\fR and \fB*\-*\-linux\-*android*\fR targets.
  .IP "\fB\-muclibc\fR" 4
  .IX Item "-muclibc"
--- 14273,14279 ----
  These \fB\-m\fR options are defined for GNU/Linux targets:
  .IP "\fB\-mglibc\fR" 4
  .IX Item "-mglibc"
! Use the \s-1GNU C\s0 library.  This is the default except
  on \fB*\-*\-linux\-*uclibc*\fR and \fB*\-*\-linux\-*android*\fR targets.
  .IP "\fB\-muclibc\fR" 4
  .IX Item "-muclibc"
*************** These \fB\-m\fR options are defined for
*** 14346,14353 ****
  .IP "\fB\-march=\fR\fIarchitecture-type\fR" 4
  .IX Item "-march=architecture-type"
  Generate code for the specified architecture.  The choices for
! \&\fIarchitecture-type\fR are \fB1.0\fR for \s-1PA\s0 1.0, \fB1.1\fR for \s-1PA\s0
! 1.1, and \fB2.0\fR for \s-1PA\s0 2.0 processors.  Refer to
  \&\fI/usr/lib/sched.models\fR on an HP-UX system to determine the proper
  architecture option for your machine.  Code compiled for lower numbered
  architectures runs on higher numbered architectures, but not the
--- 14352,14359 ----
  .IP "\fB\-march=\fR\fIarchitecture-type\fR" 4
  .IX Item "-march=architecture-type"
  Generate code for the specified architecture.  The choices for
! \&\fIarchitecture-type\fR are \fB1.0\fR for \s-1PA 1.0,\s0 \fB1.1\fR for \s-1PA
! 1.1,\s0 and \fB2.0\fR for \s-1PA 2.0\s0 processors.  Refer to
  \&\fI/usr/lib/sched.models\fR on an HP-UX system to determine the proper
  architecture option for your machine.  Code compiled for lower numbered
  architectures runs on higher numbered architectures, but not the
*************** floating-point operations, the compiler
*** 14373,14379 ****
  .IP "\fB\-mdisable\-indexing\fR" 4
  .IX Item "-mdisable-indexing"
  Prevent the compiler from using indexing address modes.  This avoids some
! rather obscure problems when compiling \s-1MIG\s0 generated code under \s-1MACH\s0.
  .IP "\fB\-mno\-space\-regs\fR" 4
  .IX Item "-mno-space-regs"
  Generate code that assumes the target has no space registers.  This allows
--- 14379,14385 ----
  .IP "\fB\-mdisable\-indexing\fR" 4
  .IX Item "-mdisable-indexing"
  Prevent the compiler from using indexing address modes.  This avoids some
! rather obscure problems when compiling \s-1MIG\s0 generated code under \s-1MACH.\s0
  .IP "\fB\-mno\-space\-regs\fR" 4
  .IX Item "-mno-space-regs"
  Generate code that assumes the target has no space registers.  This allows
*************** cross-compilation.
*** 14430,14442 ****
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC\s0, with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-msio\fR" 4
  .IX Item "-msio"
! Generate the predefine, \f(CW\*(C`_SIO\*(C'\fR, for server \s-1IO\s0.  The default is
  \&\fB\-mwsio\fR.  This generates the predefines, \f(CW\*(C`_\|_hp9000s700\*(C'\fR,
! \&\f(CW\*(C`_\|_hp9000s700_\|_\*(C'\fR and \f(CW\*(C`_WSIO\*(C'\fR, for workstation \s-1IO\s0.  These
  options are available under HP-UX and HI-UX.
  .IP "\fB\-mgnu\-ld\fR" 4
  .IX Item "-mgnu-ld"
--- 14436,14448 ----
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC,\s0 with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-msio\fR" 4
  .IX Item "-msio"
! Generate the predefine, \f(CW\*(C`_SIO\*(C'\fR, for server \s-1IO.\s0  The default is
  \&\fB\-mwsio\fR.  This generates the predefines, \f(CW\*(C`_\|_hp9000s700\*(C'\fR,
! \&\f(CW\*(C`_\|_hp9000s700_\|_\*(C'\fR and \f(CW\*(C`_WSIO\*(C'\fR, for workstation \s-1IO.\s0  These
  options are available under HP-UX and HI-UX.
  .IP "\fB\-mgnu\-ld\fR" 4
  .IX Item "-mgnu-ld"
*************** The \fBld\fR that is called is determine
*** 14450,14456 ****
  \&\fB\-\-with\-ld\fR configure option, \s-1GCC\s0's program search path, and
  finally by the user's \fB\s-1PATH\s0\fR.  The linker used by \s-1GCC\s0 can be printed
  using \fBwhich `gcc \-print\-prog\-name=ld`\fR.  This option is only available
! on the 64\-bit HP-UX \s-1GCC\s0, i.e. configured with \fBhppa*64*\-*\-hpux*\fR.
  .IP "\fB\-mhp\-ld\fR" 4
  .IX Item "-mhp-ld"
  Use options specific to \s-1HP\s0 \fBld\fR.
--- 14456,14462 ----
  \&\fB\-\-with\-ld\fR configure option, \s-1GCC\s0's program search path, and
  finally by the user's \fB\s-1PATH\s0\fR.  The linker used by \s-1GCC\s0 can be printed
  using \fBwhich `gcc \-print\-prog\-name=ld`\fR.  This option is only available
! on the 64\-bit HP-UX \s-1GCC,\s0 i.e. configured with \fBhppa*64*\-*\-hpux*\fR.
  .IP "\fB\-mhp\-ld\fR" 4
  .IX Item "-mhp-ld"
  Use options specific to \s-1HP\s0 \fBld\fR.
*************** The \fBld\fR that is called is determine
*** 14464,14470 ****
  configure option, \s-1GCC\s0's program search path, and finally by the user's
  \&\fB\s-1PATH\s0\fR.  The linker used by \s-1GCC\s0 can be printed using \fBwhich
  `gcc \-print\-prog\-name=ld`\fR.  This option is only available on the 64\-bit
! HP-UX \s-1GCC\s0, i.e. configured with \fBhppa*64*\-*\-hpux*\fR.
  .IP "\fB\-mlong\-calls\fR" 4
  .IX Item "-mlong-calls"
  Generate code that uses long call sequences.  This ensures that a call
--- 14470,14476 ----
  configure option, \s-1GCC\s0's program search path, and finally by the user's
  \&\fB\s-1PATH\s0\fR.  The linker used by \s-1GCC\s0 can be printed using \fBwhich
  `gcc \-print\-prog\-name=ld`\fR.  This option is only available on the 64\-bit
! HP-UX \s-1GCC,\s0 i.e. configured with \fBhppa*64*\-*\-hpux*\fR.
  .IP "\fB\-mlong\-calls\fR" 4
  .IX Item "-mlong-calls"
  Generate code that uses long call sequences.  This ensures that a call
*************** long calls only when the distance from t
*** 14473,14479 ****
  of the function or translation unit, as the case may be, exceeds a
  predefined limit set by the branch type being used.  The limits for
  normal calls are 7,600,000 and 240,000 bytes, respectively for the
! \&\s-1PA\s0 2.0 and \s-1PA\s0 1.X architectures.  Sibcalls are always limited at
  240,000 bytes.
  .Sp
  Distances are measured from the beginning of functions when using the
--- 14479,14485 ----
  of the function or translation unit, as the case may be, exceeds a
  predefined limit set by the branch type being used.  The limits for
  normal calls are 7,600,000 and 240,000 bytes, respectively for the
! \&\s-1PA 2.0\s0 and \s-1PA 1.X\s0 architectures.  Sibcalls are always limited at
  240,000 bytes.
  .Sp
  Distances are measured from the beginning of functions when using the
*************** is available on HP-UX 10.10 and later.
*** 14501,14507 ****
  \&\fB95\fR for HP-UX 10.10 though to 11.00, and \fB98\fR for HP-UX 11.11
  and later.
  .Sp
! \&\fB\-munix=93\fR provides the same predefines as \s-1GCC\s0 3.3 and 3.4.
  \&\fB\-munix=95\fR provides additional predefines for \f(CW\*(C`XOPEN_UNIX\*(C'\fR
  and \f(CW\*(C`_XOPEN_SOURCE_EXTENDED\*(C'\fR, and the startfile \fIunix95.o\fR.
  \&\fB\-munix=98\fR provides additional predefines for \f(CW\*(C`_XOPEN_UNIX\*(C'\fR,
--- 14507,14513 ----
  \&\fB95\fR for HP-UX 10.10 though to 11.00, and \fB98\fR for HP-UX 11.11
  and later.
  .Sp
! \&\fB\-munix=93\fR provides the same predefines as \s-1GCC 3.3\s0 and 3.4.
  \&\fB\-munix=95\fR provides additional predefines for \f(CW\*(C`XOPEN_UNIX\*(C'\fR
  and \f(CW\*(C`_XOPEN_SOURCE_EXTENDED\*(C'\fR, and the startfile \fIunix95.o\fR.
  \&\fB\-munix=98\fR provides additional predefines for \f(CW\*(C`_XOPEN_UNIX\*(C'\fR,
*************** Generate (or don't) code for the \s-1GNU
*** 14567,14573 ****
  .IP "\fB\-mno\-pic\fR" 4
  .IX Item "-mno-pic"
  Generate code that does not use a global pointer register.  The result
! is not position independent code, and violates the \s-1IA\-64\s0 \s-1ABI\s0.
  .IP "\fB\-mvolatile\-asm\-stop\fR" 4
  .IX Item "-mvolatile-asm-stop"
  .PD 0
--- 14573,14579 ----
  .IP "\fB\-mno\-pic\fR" 4
  .IX Item "-mno-pic"
  Generate code that does not use a global pointer register.  The result
! is not position independent code, and violates the \s-1IA\-64 ABI.\s0
  .IP "\fB\-mvolatile\-asm\-stop\fR" 4
  .IX Item "-mvolatile-asm-stop"
  .PD 0
*************** instructions.  The default is to use the
*** 14647,14653 ****
  .IP "\fB\-mdwarf2\-asm\fR" 4
  .IX Item "-mdwarf2-asm"
  .PD
! Don't (or do) generate assembler code for the \s-1DWARF\s0 2 line number debugging
  info.  This may be useful when not using the \s-1GNU\s0 assembler.
  .IP "\fB\-mearly\-stop\-bits\fR" 4
  .IX Item "-mearly-stop-bits"
--- 14653,14659 ----
  .IP "\fB\-mdwarf2\-asm\fR" 4
  .IX Item "-mdwarf2-asm"
  .PD
! Don't (or do) generate assembler code for the \s-1DWARF 2\s0 line number debugging
  info.  This may be useful when not using the \s-1GNU\s0 assembler.
  .IP "\fB\-mearly\-stop\-bits\fR" 4
  .IX Item "-mearly-stop-bits"
*************** Specify bit size of immediate \s-1TLS\s0
*** 14671,14677 ****
  64.
  .IP "\fB\-mtune=\fR\fIcpu-type\fR" 4
  .IX Item "-mtune=cpu-type"
! Tune the instruction scheduling for a particular \s-1CPU\s0, Valid values are
  \&\fBitanium\fR, \fBitanium1\fR, \fBmerced\fR, \fBitanium2\fR,
  and \fBmckinley\fR.
  .IP "\fB\-milp32\fR" 4
--- 14677,14683 ----
  64.
  .IP "\fB\-mtune=\fR\fIcpu-type\fR" 4
  .IX Item "-mtune=cpu-type"
! Tune the instruction scheduling for a particular \s-1CPU,\s0 Valid values are
  \&\fBitanium\fR, \fBitanium1\fR, \fBmerced\fR, \fBitanium2\fR,
  and \fBmckinley\fR.
  .IP "\fB\-milp32\fR" 4
*************** have to be emulated by software on the 6
*** 15120,15126 ****
  does not have code to emulate those instructions.
  .IP "\fB\-mcpu32\fR" 4
  .IX Item "-mcpu32"
! Generate output for a \s-1CPU32\s0.  This is the default
  when the compiler is configured for CPU32\-based systems.
  It is equivalent to \fB\-march=cpu32\fR.
  .Sp
--- 15126,15132 ----
  does not have code to emulate those instructions.
  .IP "\fB\-mcpu32\fR" 4
  .IX Item "-mcpu32"
! Generate output for a \s-1CPU32.\s0  This is the default
  when the compiler is configured for CPU32\-based systems.
  It is equivalent to \fB\-march=cpu32\fR.
  .Sp
*************** Use this option for microcontrollers wit
*** 15129,15144 ****
  68336, 68340, 68341, 68349 and 68360.
  .IP "\fB\-m5200\fR" 4
  .IX Item "-m5200"
! Generate output for a 520X ColdFire \s-1CPU\s0.  This is the default
  when the compiler is configured for 520X\-based systems.
  It is equivalent to \fB\-mcpu=5206\fR, and is now deprecated
  in favor of that option.
  .Sp
  Use this option for microcontroller with a 5200 core, including
! the \s-1MCF5202\s0, \s-1MCF5203\s0, \s-1MCF5204\s0 and \s-1MCF5206\s0.
  .IP "\fB\-m5206e\fR" 4
  .IX Item "-m5206e"
! Generate output for a 5206e ColdFire \s-1CPU\s0.  The option is now
  deprecated in favor of the equivalent \fB\-mcpu=5206e\fR.
  .IP "\fB\-m528x\fR" 4
  .IX Item "-m528x"
--- 15135,15150 ----
  68336, 68340, 68341, 68349 and 68360.
  .IP "\fB\-m5200\fR" 4
  .IX Item "-m5200"
! Generate output for a 520X ColdFire \s-1CPU.\s0  This is the default
  when the compiler is configured for 520X\-based systems.
  It is equivalent to \fB\-mcpu=5206\fR, and is now deprecated
  in favor of that option.
  .Sp
  Use this option for microcontroller with a 5200 core, including
! the \s-1MCF5202, MCF5203, MCF5204\s0 and \s-1MCF5206.\s0
  .IP "\fB\-m5206e\fR" 4
  .IX Item "-m5206e"
! Generate output for a 5206e ColdFire \s-1CPU.\s0  The option is now
  deprecated in favor of the equivalent \fB\-mcpu=5206e\fR.
  .IP "\fB\-m528x\fR" 4
  .IX Item "-m528x"
*************** The option is now deprecated in favor of
*** 15147,15157 ****
  \&\fB\-mcpu=528x\fR.
  .IP "\fB\-m5307\fR" 4
  .IX Item "-m5307"
! Generate output for a ColdFire 5307 \s-1CPU\s0.  The option is now deprecated
  in favor of the equivalent \fB\-mcpu=5307\fR.
  .IP "\fB\-m5407\fR" 4
  .IX Item "-m5407"
! Generate output for a ColdFire 5407 \s-1CPU\s0.  The option is now deprecated
  in favor of the equivalent \fB\-mcpu=5407\fR.
  .IP "\fB\-mcfv4e\fR" 4
  .IX Item "-mcfv4e"
--- 15153,15163 ----
  \&\fB\-mcpu=528x\fR.
  .IP "\fB\-m5307\fR" 4
  .IX Item "-m5307"
! Generate output for a ColdFire 5307 \s-1CPU.\s0  The option is now deprecated
  in favor of the equivalent \fB\-mcpu=5307\fR.
  .IP "\fB\-m5407\fR" 4
  .IX Item "-m5407"
! Generate output for a ColdFire 5407 \s-1CPU.\s0  The option is now deprecated
  in favor of the equivalent \fB\-mcpu=5407\fR.
  .IP "\fB\-mcfv4e\fR" 4
  .IX Item "-mcfv4e"
*************** The option is equivalent to \fB\-march=6
*** 15182,15195 ****
  .IX Item "-m68881"
  .PD
  Generate floating-point instructions.  This is the default for 68020
! and above, and for ColdFire devices that have an \s-1FPU\s0.  It defines the
  macro \f(CW\*(C`_\|_HAVE_68881_\|_\*(C'\fR on M680x0 targets and \f(CW\*(C`_\|_mcffpu_\|_\*(C'\fR
  on ColdFire targets.
  .IP "\fB\-msoft\-float\fR" 4
  .IX Item "-msoft-float"
  Do not generate floating-point instructions; use library calls instead.
  This is the default for 68000, 68010, and 68832 targets.  It is also
! the default for ColdFire devices that have no \s-1FPU\s0.
  .IP "\fB\-mdiv\fR" 4
  .IX Item "-mdiv"
  .PD 0
--- 15188,15201 ----
  .IX Item "-m68881"
  .PD
  Generate floating-point instructions.  This is the default for 68020
! and above, and for ColdFire devices that have an \s-1FPU.\s0  It defines the
  macro \f(CW\*(C`_\|_HAVE_68881_\|_\*(C'\fR on M680x0 targets and \f(CW\*(C`_\|_mcffpu_\|_\*(C'\fR
  on ColdFire targets.
  .IP "\fB\-msoft\-float\fR" 4
  .IX Item "-msoft-float"
  Do not generate floating-point instructions; use library calls instead.
  This is the default for 68000, 68010, and 68832 targets.  It is also
! the default for ColdFire devices that have no \s-1FPU.\s0
  .IP "\fB\-mdiv\fR" 4
  .IX Item "-mdiv"
  .PD 0
*************** Generate (do not generate) ColdFire hard
*** 15200,15206 ****
  instructions.  If \fB\-march\fR is used without \fB\-mcpu\fR,
  the default is \*(L"on\*(R" for ColdFire architectures and \*(L"off\*(R" for M680x0
  architectures.  Otherwise, the default is taken from the target \s-1CPU\s0
! (either the default \s-1CPU\s0, or the one specified by \fB\-mcpu\fR).  For
  example, the default is \*(L"off\*(R" for \fB\-mcpu=5206\fR and \*(L"on\*(R" for
  \&\fB\-mcpu=5206e\fR.
  .Sp
--- 15206,15212 ----
  instructions.  If \fB\-march\fR is used without \fB\-mcpu\fR,
  the default is \*(L"on\*(R" for ColdFire architectures and \*(L"off\*(R" for M680x0
  architectures.  Otherwise, the default is taken from the target \s-1CPU\s0
! (either the default \s-1CPU,\s0 or the one specified by \fB\-mcpu\fR).  For
  example, the default is \*(L"off\*(R" for \fB\-mcpu=5206\fR and \*(L"on\*(R" for
  \&\fB\-mcpu=5206e\fR.
  .Sp
*************** that works if the \s-1GOT\s0 has more th
*** 15319,15325 ****
  larger and slower than code generated without this option.  On M680x0
  processors, this option is not needed; \fB\-fPIC\fR suffices.
  .Sp
! \&\s-1GCC\s0 normally uses a single instruction to load values from the \s-1GOT\s0.
  While this is relatively efficient, it only works if the \s-1GOT\s0
  is smaller than about 64k.  Anything larger causes the linker
  to report an error such as:
--- 15325,15331 ----
  larger and slower than code generated without this option.  On M680x0
  processors, this option is not needed; \fB\-fPIC\fR suffices.
  .Sp
! \&\s-1GCC\s0 normally uses a single instruction to load values from the \s-1GOT.\s0
  While this is relatively efficient, it only works if the \s-1GOT\s0
  is smaller than about 64k.  Anything larger causes the linker
  to report an error such as:
*************** useful unless you also provide \fB\-mmin
*** 15461,15467 ****
  Selects one of the built-in core configurations.  Each MeP chip has
  one or more modules in it; each module has a core \s-1CPU\s0 and a variety of
  coprocessors, optional instructions, and peripherals.  The
! \&\f(CW\*(C`MeP\-Integrator\*(C'\fR tool, not part of \s-1GCC\s0, provides these
  configurations through this option; using this option is the same as
  using all the corresponding command-line options.  The default
  configuration is \fBdefault\fR.
--- 15467,15473 ----
  Selects one of the built-in core configurations.  Each MeP chip has
  one or more modules in it; each module has a core \s-1CPU\s0 and a variety of
  coprocessors, optional instructions, and peripherals.  The
! \&\f(CW\*(C`MeP\-Integrator\*(C'\fR tool, not part of \s-1GCC,\s0 provides these
  configurations through this option; using this option is the same as
  using all the corresponding command-line options.  The default
  configuration is \fBdefault\fR.
*************** Do not optimize block moves, use \f(CW\*
*** 15564,15570 ****
  This option is deprecated.  Use \fB\-fno\-zero\-initialized\-in\-bss\fR instead.
  .IP "\fB\-mcpu=\fR\fIcpu-type\fR" 4
  .IX Item "-mcpu=cpu-type"
! Use features of, and schedule code for, the given \s-1CPU\s0.
  Supported values are in the format \fBv\fR\fIX\fR\fB.\fR\fI\s-1YY\s0\fR\fB.\fR\fIZ\fR,
  where \fIX\fR is a major version, \fI\s-1YY\s0\fR is the minor version, and
  \&\fIZ\fR is compatibility code.  Example values are \fBv3.00.a\fR,
--- 15570,15576 ----
  This option is deprecated.  Use \fB\-fno\-zero\-initialized\-in\-bss\fR instead.
  .IP "\fB\-mcpu=\fR\fIcpu-type\fR" 4
  .IX Item "-mcpu=cpu-type"
! Use features of, and schedule code for, the given \s-1CPU.\s0
  Supported values are in the format \fBv\fR\fIX\fR\fB.\fR\fI\s-1YY\s0\fR\fB.\fR\fIZ\fR,
  where \fIX\fR is a major version, \fI\s-1YY\s0\fR is the minor version, and
  \&\fIZ\fR is compatibility code.  Example values are \fBv3.00.a\fR,
*************** configurations.
*** 15650,15656 ****
  .IP "\fB\-march=\fR\fIarch\fR" 4
  .IX Item "-march=arch"
  Generate code that runs on \fIarch\fR, which can be the name of a
! generic \s-1MIPS\s0 \s-1ISA\s0, or the name of a particular processor.
  The \s-1ISA\s0 names are:
  \&\fBmips1\fR, \fBmips2\fR, \fBmips3\fR, \fBmips4\fR,
  \&\fBmips32\fR, \fBmips32r2\fR, \fBmips32r3\fR, \fBmips32r5\fR,
--- 15656,15662 ----
  .IP "\fB\-march=\fR\fIarch\fR" 4
  .IX Item "-march=arch"
  Generate code that runs on \fIarch\fR, which can be the name of a
! generic \s-1MIPS ISA,\s0 or the name of a particular processor.
  The \s-1ISA\s0 names are:
  \&\fBmips1\fR, \fBmips2\fR, \fBmips3\fR, \fBmips4\fR,
  \&\fBmips32\fR, \fBmips32r2\fR, \fBmips32r3\fR, \fBmips32r5\fR,
*************** Equivalent to \fB\-march=mips64r6\fR.
*** 15778,15784 ****
  .IX Item "-mno-mips16"
  .PD
  Generate (do not generate) \s-1MIPS16\s0 code.  If \s-1GCC\s0 is targeting a
! \&\s-1MIPS32\s0 or \s-1MIPS64\s0 architecture, it makes use of the MIPS16e \s-1ASE\s0.
  .Sp
  \&\s-1MIPS16\s0 code generation can also be controlled on a per-function basis
  by means of \f(CW\*(C`mips16\*(C'\fR and \f(CW\*(C`nomips16\*(C'\fR attributes.
--- 15784,15790 ----
  .IX Item "-mno-mips16"
  .PD
  Generate (do not generate) \s-1MIPS16\s0 code.  If \s-1GCC\s0 is targeting a
! \&\s-1MIPS32\s0 or \s-1MIPS64\s0 architecture, it makes use of the MIPS16e \s-1ASE.\s0
  .Sp
  \&\s-1MIPS16\s0 code generation can also be controlled on a per-function basis
  by means of \f(CW\*(C`mips16\*(C'\fR and \f(CW\*(C`nomips16\*(C'\fR attributes.
*************** not intended for ordinary use in compili
*** 15793,15799 ****
  .IP "\fB\-mno\-interlink\-compressed\fR" 4
  .IX Item "-mno-interlink-compressed"
  .PD
! Require (do not require) that code using the standard (uncompressed) \s-1MIPS\s0 \s-1ISA\s0
  be link-compatible with \s-1MIPS16\s0 and microMIPS code, and vice versa.
  .Sp
  For example, code using the standard \s-1ISA\s0 encoding cannot jump directly
--- 15799,15805 ----
  .IP "\fB\-mno\-interlink\-compressed\fR" 4
  .IX Item "-mno-interlink-compressed"
  .PD
! Require (do not require) that code using the standard (uncompressed) \s-1MIPS ISA\s0
  be link-compatible with \s-1MIPS16\s0 and microMIPS code, and vice versa.
  .Sp
  For example, code using the standard \s-1ISA\s0 encoding cannot jump directly
*************** and are retained for backwards compatibi
*** 15821,15840 ****
  .IP "\fB\-mabi=eabi\fR" 4
  .IX Item "-mabi=eabi"
  .PD
! Generate code for the given \s-1ABI\s0.
  .Sp
  Note that the \s-1EABI\s0 has a 32\-bit and a 64\-bit variant.  \s-1GCC\s0 normally
  generates 64\-bit code when you select a 64\-bit architecture, but you
  can use \fB\-mgp32\fR to get 32\-bit code instead.
  .Sp
! For information about the O64 \s-1ABI\s0, see
  <\fBhttp://gcc.gnu.org/projects/mipso64\-abi.html\fR>.
  .Sp
  \&\s-1GCC\s0 supports a variant of the o32 \s-1ABI\s0 in which floating-point registers
  are 64 rather than 32 bits wide.  You can select this combination with
  \&\fB\-mabi=32\fR \fB\-mfp64\fR.  This \s-1ABI\s0 relies on the \f(CW\*(C`mthc1\*(C'\fR
  and \f(CW\*(C`mfhc1\*(C'\fR instructions and is therefore only supported for
! \&\s-1MIPS32R2\s0, \s-1MIPS32R3\s0 and \s-1MIPS32R5\s0 processors.
  .Sp
  The register assignments for arguments and return values remain the
  same, but each scalar value is passed in a single 64\-bit register
--- 15827,15846 ----
  .IP "\fB\-mabi=eabi\fR" 4
  .IX Item "-mabi=eabi"
  .PD
! Generate code for the given \s-1ABI.\s0
  .Sp
  Note that the \s-1EABI\s0 has a 32\-bit and a 64\-bit variant.  \s-1GCC\s0 normally
  generates 64\-bit code when you select a 64\-bit architecture, but you
  can use \fB\-mgp32\fR to get 32\-bit code instead.
  .Sp
! For information about the O64 \s-1ABI,\s0 see
  <\fBhttp://gcc.gnu.org/projects/mipso64\-abi.html\fR>.
  .Sp
  \&\s-1GCC\s0 supports a variant of the o32 \s-1ABI\s0 in which floating-point registers
  are 64 rather than 32 bits wide.  You can select this combination with
  \&\fB\-mabi=32\fR \fB\-mfp64\fR.  This \s-1ABI\s0 relies on the \f(CW\*(C`mthc1\*(C'\fR
  and \f(CW\*(C`mfhc1\*(C'\fR instructions and is therefore only supported for
! \&\s-1MIPS32R2, MIPS32R3\s0 and \s-1MIPS32R5\s0 processors.
  .Sp
  The register assignments for arguments and return values remain the
  same, but each scalar value is passed in a single 64\-bit register
*************** a transition from 32\-bit to 64\-bit reg
*** 15849,15855 ****
  (\fB\-mfpxx\fR) and \s-1FP64A\s0 (\fB\-mfp64\fR \fB\-mno\-odd\-spreg\fR).
  The \s-1FPXX\s0 extension mandates that all code must execute correctly
  when run using 32\-bit or 64\-bit registers.  The code can be interlinked
! with either \s-1FP32\s0 or \s-1FP64\s0, but not both.
  The \s-1FP64A\s0 extension is similar to the \s-1FP64\s0 extension but forbids the
  use of odd-numbered single-precision registers.  This can be used
  in conjunction with the \f(CW\*(C`FRE\*(C'\fR mode of FPUs in \s-1MIPS32R5\s0
--- 15855,15861 ----
  (\fB\-mfpxx\fR) and \s-1FP64A\s0 (\fB\-mfp64\fR \fB\-mno\-odd\-spreg\fR).
  The \s-1FPXX\s0 extension mandates that all code must execute correctly
  when run using 32\-bit or 64\-bit registers.  The code can be interlinked
! with either \s-1FP32\s0 or \s-1FP64,\s0 but not both.
  The \s-1FP64A\s0 extension is similar to the \s-1FP64\s0 extension but forbids the
  use of odd-numbered single-precision registers.  This can be used
  in conjunction with the \f(CW\*(C`FRE\*(C'\fR mode of FPUs in \s-1MIPS32R5\s0
*************** executables both smaller and quicker.
*** 15896,15902 ****
  .PD
  Assume (do not assume) that the static and dynamic linkers
  support PLTs and copy relocations.  This option only affects
! \&\fB\-mno\-shared \-mabicalls\fR.  For the n64 \s-1ABI\s0, this option
  has no effect without \fB\-msym32\fR.
  .Sp
  You can make \fB\-mplt\fR the default by configuring
--- 15902,15908 ----
  .PD
  Assume (do not assume) that the static and dynamic linkers
  support PLTs and copy relocations.  This option only affects
! \&\fB\-mno\-shared \-mabicalls\fR.  For the n64 \s-1ABI,\s0 this option
  has no effect without \fB\-msym32\fR.
  .Sp
  You can make \fB\-mplt\fR the default by configuring
*************** You can make \fB\-mplt\fR the default by
*** 15911,15917 ****
  Lift (do not lift) the usual restrictions on the size of the global
  offset table.
  .Sp
! \&\s-1GCC\s0 normally uses a single instruction to load values from the \s-1GOT\s0.
  While this is relatively efficient, it only works if the \s-1GOT\s0
  is smaller than about 64k.  Anything larger causes the linker
  to report an error such as:
--- 15917,15923 ----
  Lift (do not lift) the usual restrictions on the size of the global
  offset table.
  .Sp
! \&\s-1GCC\s0 normally uses a single instruction to load values from the \s-1GOT.\s0
  While this is relatively efficient, it only works if the \s-1GOT\s0
  is smaller than about 64k.  Anything larger causes the linker
  to report an error such as:
*************** operations.  This is the default.
*** 15979,15986 ****
  .IX Item "-mno-odd-spreg"
  .PD
  Enable the use of odd-numbered single-precision floating-point registers
! for the o32 \s-1ABI\s0.  This is the default for processors that are known to
! support these registers.  When using the o32 \s-1FPXX\s0 \s-1ABI\s0, \fB\-mno\-odd\-spreg\fR
  is set by default.
  .IP "\fB\-mabs=2008\fR" 4
  .IX Item "-mabs=2008"
--- 15985,15992 ----
  .IX Item "-mno-odd-spreg"
  .PD
  Enable the use of odd-numbered single-precision floating-point registers
! for the o32 \s-1ABI.\s0  This is the default for processors that are known to
! support these registers.  When using the o32 \s-1FPXX ABI,\s0 \fB\-mno\-odd\-spreg\fR
  is set by default.
  .IP "\fB\-mabs=2008\fR" 4
  .IX Item "-mabs=2008"
*************** is set by default.
*** 15989,15995 ****
  .IX Item "-mabs=legacy"
  .PD
  These options control the treatment of the special not-a-number (NaN)
! \&\s-1IEEE\s0 754 floating-point data with the \f(CW\*(C`abs.\f(CIfmt\f(CW\*(C'\fR and
  \&\f(CW\*(C`neg.\f(CIfmt\f(CW\*(C'\fR machine instructions.
  .Sp
  By default or when \fB\-mabs=legacy\fR is used the legacy
--- 15995,16001 ----
  .IX Item "-mabs=legacy"
  .PD
  These options control the treatment of the special not-a-number (NaN)
! \&\s-1IEEE 754\s0 floating-point data with the \f(CW\*(C`abs.\f(CIfmt\f(CW\*(C'\fR and
  \&\f(CW\*(C`neg.\f(CIfmt\f(CW\*(C'\fR machine instructions.
  .Sp
  By default or when \fB\-mabs=legacy\fR is used the legacy
*************** manipulate the sign bit of floating-poin
*** 16000,16006 ****
  instead unless the \fB\-ffinite\-math\-only\fR option has also been
  specified.
  .Sp
! The \fB\-mabs=2008\fR option selects the \s-1IEEE\s0 754\-2008 treatment.  In
  this case these instructions are considered non-arithmetic and therefore
  operating correctly in all cases, including in particular where the
  input operand is a NaN.  These instructions are therefore always used
--- 16006,16012 ----
  instead unless the \fB\-ffinite\-math\-only\fR option has also been
  specified.
  .Sp
! The \fB\-mabs=2008\fR option selects the \s-1IEEE 754\-2008\s0 treatment.  In
  this case these instructions are considered non-arithmetic and therefore
  operating correctly in all cases, including in particular where the
  input operand is a NaN.  These instructions are therefore always used
*************** for the respective operations.
*** 16012,16025 ****
  .IX Item "-mnan=legacy"
  .PD
  These options control the encoding of the special not-a-number (NaN)
! \&\s-1IEEE\s0 754 floating-point data.
  .Sp
  The \fB\-mnan=legacy\fR option selects the legacy encoding.  In this
  case quiet NaNs (qNaNs) are denoted by the first bit of their trailing
  significand field being 0, whereas signalling NaNs (sNaNs) are denoted
  by the first bit of their trailing significand field being 1.
  .Sp
! The \fB\-mnan=2008\fR option selects the \s-1IEEE\s0 754\-2008 encoding.  In
  this case qNaNs are denoted by the first bit of their trailing
  significand field being 1, whereas sNaNs are denoted by the first bit of
  their trailing significand field being 0.
--- 16018,16031 ----
  .IX Item "-mnan=legacy"
  .PD
  These options control the encoding of the special not-a-number (NaN)
! \&\s-1IEEE 754\s0 floating-point data.
  .Sp
  The \fB\-mnan=legacy\fR option selects the legacy encoding.  In this
  case quiet NaNs (qNaNs) are denoted by the first bit of their trailing
  significand field being 0, whereas signalling NaNs (sNaNs) are denoted
  by the first bit of their trailing significand field being 1.
  .Sp
! The \fB\-mnan=2008\fR option selects the \s-1IEEE 754\-2008\s0 encoding.  In
  this case qNaNs are denoted by the first bit of their trailing
  significand field being 1, whereas sNaNs are denoted by the first bit of
  their trailing significand field being 0.
*************** configurations; see the installation doc
*** 16049,16055 ****
  .IP "\fB\-mno\-dsp\fR" 4
  .IX Item "-mno-dsp"
  .PD
! Use (do not use) revision 1 of the \s-1MIPS\s0 \s-1DSP\s0 \s-1ASE\s0.
    This option defines the
  preprocessor macro \f(CW\*(C`_\|_mips_dsp\*(C'\fR.  It also defines
  \&\f(CW\*(C`_\|_mips_dsp_rev\*(C'\fR to 1.
--- 16055,16061 ----
  .IP "\fB\-mno\-dsp\fR" 4
  .IX Item "-mno-dsp"
  .PD
! Use (do not use) revision 1 of the \s-1MIPS DSP ASE.\s0
    This option defines the
  preprocessor macro \f(CW\*(C`_\|_mips_dsp\*(C'\fR.  It also defines
  \&\f(CW\*(C`_\|_mips_dsp_rev\*(C'\fR to 1.
*************** preprocessor macro \f(CW\*(C`_\|_mips_ds
*** 16059,16065 ****
  .IP "\fB\-mno\-dspr2\fR" 4
  .IX Item "-mno-dspr2"
  .PD
! Use (do not use) revision 2 of the \s-1MIPS\s0 \s-1DSP\s0 \s-1ASE\s0.
    This option defines the
  preprocessor macros \f(CW\*(C`_\|_mips_dsp\*(C'\fR and \f(CW\*(C`_\|_mips_dspr2\*(C'\fR.
  It also defines \f(CW\*(C`_\|_mips_dsp_rev\*(C'\fR to 2.
--- 16065,16071 ----
  .IP "\fB\-mno\-dspr2\fR" 4
  .IX Item "-mno-dspr2"
  .PD
! Use (do not use) revision 2 of the \s-1MIPS DSP ASE.\s0
    This option defines the
  preprocessor macros \f(CW\*(C`_\|_mips_dsp\*(C'\fR and \f(CW\*(C`_\|_mips_dspr2\*(C'\fR.
  It also defines \f(CW\*(C`_\|_mips_dsp_rev\*(C'\fR to 2.
*************** It also defines \f(CW\*(C`_\|_mips_dsp_r
*** 16069,16075 ****
  .IP "\fB\-mno\-smartmips\fR" 4
  .IX Item "-mno-smartmips"
  .PD
! Use (do not use) the \s-1MIPS\s0 SmartMIPS \s-1ASE\s0.
  .IP "\fB\-mpaired\-single\fR" 4
  .IX Item "-mpaired-single"
  .PD 0
--- 16075,16081 ----
  .IP "\fB\-mno\-smartmips\fR" 4
  .IX Item "-mno-smartmips"
  .PD
! Use (do not use) the \s-1MIPS\s0 SmartMIPS \s-1ASE.\s0
  .IP "\fB\-mpaired\-single\fR" 4
  .IX Item "-mpaired-single"
  .PD 0
*************** hardware floating-point support to be en
*** 16094,16100 ****
  .IP "\fB\-mno\-mips3d\fR" 4
  .IX Item "-mno-mips3d"
  .PD
! Use (do not use) the \s-1MIPS\-3D\s0 \s-1ASE\s0.  
  The option \fB\-mips3d\fR implies \fB\-mpaired\-single\fR.
  .IP "\fB\-mmicromips\fR" 4
  .IX Item "-mmicromips"
--- 16100,16106 ----
  .IP "\fB\-mno\-mips3d\fR" 4
  .IX Item "-mno-mips3d"
  .PD
! Use (do not use) the \s-1MIPS\-3D ASE.\s0  
  The option \fB\-mips3d\fR implies \fB\-mpaired\-single\fR.
  .IP "\fB\-mmicromips\fR" 4
  .IX Item "-mmicromips"
*************** Use (do not use) \s-1MT\s0 Multithreadin
*** 16119,16125 ****
  .IP "\fB\-mno\-mcu\fR" 4
  .IX Item "-mno-mcu"
  .PD
! Use (do not use) the \s-1MIPS\s0 \s-1MCU\s0 \s-1ASE\s0 instructions.
  .IP "\fB\-meva\fR" 4
  .IX Item "-meva"
  .PD 0
--- 16125,16131 ----
  .IP "\fB\-mno\-mcu\fR" 4
  .IX Item "-mno-mcu"
  .PD
! Use (do not use) the \s-1MIPS MCU ASE\s0 instructions.
  .IP "\fB\-meva\fR" 4
  .IX Item "-meva"
  .PD 0
*************** determined.
*** 16151,16157 ****
  Force \f(CW\*(C`long\*(C'\fR, \f(CW\*(C`int\*(C'\fR, and pointer types to be 32 bits wide.
  .Sp
  The default size of \f(CW\*(C`int\*(C'\fRs, \f(CW\*(C`long\*(C'\fRs and pointers depends on
! the \s-1ABI\s0.  All the supported ABIs use 32\-bit \f(CW\*(C`int\*(C'\fRs.  The n64 \s-1ABI\s0
  uses 64\-bit \f(CW\*(C`long\*(C'\fRs, as does the 64\-bit \s-1EABI\s0; the others use
  32\-bit \f(CW\*(C`long\*(C'\fRs.  Pointers are the same size as \f(CW\*(C`long\*(C'\fRs,
  or the same size as integer registers, whichever is smaller.
--- 16157,16163 ----
  Force \f(CW\*(C`long\*(C'\fR, \f(CW\*(C`int\*(C'\fR, and pointer types to be 32 bits wide.
  .Sp
  The default size of \f(CW\*(C`int\*(C'\fRs, \f(CW\*(C`long\*(C'\fRs and pointers depends on
! the \s-1ABI.\s0  All the supported ABIs use 32\-bit \f(CW\*(C`int\*(C'\fRs.  The n64 \s-1ABI\s0
  uses 64\-bit \f(CW\*(C`long\*(C'\fRs, as does the 64\-bit \s-1EABI\s0; the others use
  32\-bit \f(CW\*(C`long\*(C'\fRs.  Pointers are the same size as \f(CW\*(C`long\*(C'\fRs,
  or the same size as integer registers, whichever is smaller.
*************** or the same size as integer registers, w
*** 16162,16168 ****
  .IX Item "-mno-sym32"
  .PD
  Assume (do not assume) that all symbols have 32\-bit values, regardless
! of the selected \s-1ABI\s0.  This option is useful in combination with
  \&\fB\-mabi=64\fR and \fB\-mno\-abicalls\fR because it allows \s-1GCC\s0
  to generate shorter and faster references to symbolic addresses.
  .IP "\fB\-G\fR \fInum\fR" 4
--- 16168,16174 ----
  .IX Item "-mno-sym32"
  .PD
  Assume (do not assume) that all symbols have 32\-bit values, regardless
! of the selected \s-1ABI.\s0  This option is useful in combination with
  \&\fB\-mabi=64\fR and \fB\-mno\-abicalls\fR because it allows \s-1GCC\s0
  to generate shorter and faster references to symbolic addresses.
  .IP "\fB\-G\fR \fInum\fR" 4
*************** but other instructions must not do so.
*** 16267,16279 ****
  and 4KSd processors when the code TLBs have the Read Inhibit bit set.
  It is also useful on processors that can be configured to have a dual
  instruction/data \s-1SRAM\s0 interface and that, like the M4K, automatically
! redirect PC-relative loads to the instruction \s-1RAM\s0.
  .IP "\fB\-mcode\-readable=no\fR" 4
  .IX Item "-mcode-readable=no"
  Instructions must not access executable sections.  This option can be
  useful on targets that are configured to have a dual instruction/data
  \&\s-1SRAM\s0 interface but that (unlike the M4K) do not automatically redirect
! PC-relative loads to the instruction \s-1RAM\s0.
  .RE
  .RS 4
  .RE
--- 16273,16285 ----
  and 4KSd processors when the code TLBs have the Read Inhibit bit set.
  It is also useful on processors that can be configured to have a dual
  instruction/data \s-1SRAM\s0 interface and that, like the M4K, automatically
! redirect PC-relative loads to the instruction \s-1RAM.\s0
  .IP "\fB\-mcode\-readable=no\fR" 4
  .IX Item "-mcode-readable=no"
  Instructions must not access executable sections.  This option can be
  useful on targets that are configured to have a dual instruction/data
  \&\s-1SRAM\s0 interface but that (unlike the M4K) do not automatically redirect
! PC-relative loads to the instruction \s-1RAM.\s0
  .RE
  .RS 4
  .RE
*************** The default is \fB\-mcheck\-zero\-divisi
*** 16315,16321 ****
  .PD
  \&\s-1MIPS\s0 systems check for division by zero by generating either a
  conditional trap or a break instruction.  Using traps results in
! smaller code, but is only supported on \s-1MIPS\s0 \s-1II\s0 and later.  Also, some
  versions of the Linux kernel have a bug that prevents trap from
  generating the proper signal (\f(CW\*(C`SIGFPE\*(C'\fR).  Use \fB\-mdivide\-traps\fR to
  allow conditional traps on architectures that support them and
--- 16321,16327 ----
  .PD
  \&\s-1MIPS\s0 systems check for division by zero by generating either a
  conditional trap or a break instruction.  Using traps results in
! smaller code, but is only supported on \s-1MIPS II\s0 and later.  Also, some
  versions of the Linux kernel have a bug that prevents trap from
  generating the proper signal (\f(CW\*(C`SIGFPE\*(C'\fR).  Use \fB\-mdivide\-traps\fR to
  allow conditional traps on architectures that support them and
*************** This option has no effect on abicalls co
*** 16353,16359 ****
  .IX Item "-mno-mad"
  .PD
  Enable (disable) use of the \f(CW\*(C`mad\*(C'\fR, \f(CW\*(C`madu\*(C'\fR and \f(CW\*(C`mul\*(C'\fR
! instructions, as provided by the R4650 \s-1ISA\s0.
  .IP "\fB\-mimadd\fR" 4
  .IX Item "-mimadd"
  .PD 0
--- 16359,16365 ----
  .IX Item "-mno-mad"
  .PD
  Enable (disable) use of the \f(CW\*(C`mad\*(C'\fR, \f(CW\*(C`madu\*(C'\fR and \f(CW\*(C`mul\*(C'\fR
! instructions, as provided by the R4650 \s-1ISA.\s0
  .IP "\fB\-mimadd\fR" 4
  .IX Item "-mimadd"
  .PD 0
*************** assembler files (with a \fB.s\fR suffix)
*** 16391,16397 ****
  .IX Item "-mno-fix-24k"
  .PD
  Work around the 24K E48 (lost data on stores during refill) errata.
! The workarounds are implemented by the assembler rather than by \s-1GCC\s0.
  .IP "\fB\-mfix\-r4000\fR" 4
  .IX Item "-mfix-r4000"
  .PD 0
--- 16397,16403 ----
  .IX Item "-mno-fix-24k"
  .PD
  Work around the 24K E48 (lost data on stores during refill) errata.
! The workarounds are implemented by the assembler rather than by \s-1GCC.\s0
  .IP "\fB\-mfix\-r4000\fR" 4
  .IX Item "-mfix-r4000"
  .PD 0
*************** otherwise.
*** 16452,16458 ****
  .IX Item "-mno-fix-rm7000"
  .PD
  Work around the \s-1RM7000\s0 \f(CW\*(C`dmult\*(C'\fR/\f(CW\*(C`dmultu\*(C'\fR errata.  The
! workarounds are implemented by the assembler rather than by \s-1GCC\s0.
  .IP "\fB\-mfix\-vr4120\fR" 4
  .IX Item "-mfix-vr4120"
  .PD 0
--- 16458,16464 ----
  .IX Item "-mno-fix-rm7000"
  .PD
  Work around the \s-1RM7000\s0 \f(CW\*(C`dmult\*(C'\fR/\f(CW\*(C`dmultu\*(C'\fR errata.  The
! workarounds are implemented by the assembler rather than by \s-1GCC.\s0
  .IP "\fB\-mfix\-vr4120\fR" 4
  .IX Item "-mfix-vr4120"
  .PD 0
*************** instructions.  These errata are handled
*** 16479,16485 ****
  .IP "\fB\-mfix\-vr4130\fR" 4
  .IX Item "-mfix-vr4130"
  Work around the \s-1VR4130\s0 \f(CW\*(C`mflo\*(C'\fR/\f(CW\*(C`mfhi\*(C'\fR errata.  The
! workarounds are implemented by the assembler rather than by \s-1GCC\s0,
  although \s-1GCC\s0 avoids using \f(CW\*(C`mflo\*(C'\fR and \f(CW\*(C`mfhi\*(C'\fR if the
  \&\s-1VR4130\s0 \f(CW\*(C`macc\*(C'\fR, \f(CW\*(C`macchi\*(C'\fR, \f(CW\*(C`dmacc\*(C'\fR and \f(CW\*(C`dmacchi\*(C'\fR
  instructions are available instead.
--- 16485,16491 ----
  .IP "\fB\-mfix\-vr4130\fR" 4
  .IX Item "-mfix-vr4130"
  Work around the \s-1VR4130\s0 \f(CW\*(C`mflo\*(C'\fR/\f(CW\*(C`mfhi\*(C'\fR errata.  The
! workarounds are implemented by the assembler rather than by \s-1GCC,\s0
  although \s-1GCC\s0 avoids using \f(CW\*(C`mflo\*(C'\fR and \f(CW\*(C`mfhi\*(C'\fR if the
  \&\s-1VR4130\s0 \f(CW\*(C`macc\*(C'\fR, \f(CW\*(C`macchi\*(C'\fR, \f(CW\*(C`dmacc\*(C'\fR and \f(CW\*(C`dmacchi\*(C'\fR
  instructions are available instead.
*************** instructions are available instead.
*** 16489,16495 ****
  .IP "\fB\-mno\-fix\-sb1\fR" 4
  .IX Item "-mno-fix-sb1"
  .PD
! Work around certain \s-1SB\-1\s0 \s-1CPU\s0 core errata.
  (This flag currently works around the \s-1SB\-1\s0 revision 2
  \&\*(L"F1\*(R" and \*(L"F2\*(R" floating-point errata.)
  .IP "\fB\-mr10k\-cache\-barrier=\fR\fIsetting\fR" 4
--- 16495,16501 ----
  .IP "\fB\-mno\-fix\-sb1\fR" 4
  .IX Item "-mno-fix-sb1"
  .PD
! Work around certain \s-1SB\-1 CPU\s0 core errata.
  (This flag currently works around the \s-1SB\-1\s0 revision 2
  \&\*(L"F1\*(R" and \*(L"F2\*(R" floating-point errata.)
  .IP "\fB\-mr10k\-cache\-barrier=\fR\fIsetting\fR" 4
*************** Specifies whether \s-1FP\s0 exceptions a
*** 16603,16609 ****
  The default is that \s-1FP\s0 exceptions are
  enabled.
  .Sp
! For instance, on the \s-1SB\-1\s0, if \s-1FP\s0 exceptions are disabled, and we are emitting
  64\-bit code, then we can use both \s-1FP\s0 pipes.  Otherwise, we can only use one
  \&\s-1FP\s0 pipe.
  .IP "\fB\-mvr4130\-align\fR" 4
--- 16609,16615 ----
  The default is that \s-1FP\s0 exceptions are
  enabled.
  .Sp
! For instance, on the \s-1SB\-1,\s0 if \s-1FP\s0 exceptions are disabled, and we are emitting
  64\-bit code, then we can use both \s-1FP\s0 pipes.  Otherwise, we can only use one
  \&\s-1FP\s0 pipe.
  .IP "\fB\-mvr4130\-align\fR" 4
*************** instructions together if the first one i
*** 16617,16623 ****
  option is enabled, \s-1GCC\s0 aligns pairs of instructions that it
  thinks should execute in parallel.
  .Sp
! This option only has an effect when optimizing for the \s-1VR4130\s0.
  It normally makes code faster, but at the expense of making it bigger.
  It is enabled by default at optimization level \fB\-O3\fR.
  .IP "\fB\-msynci\fR" 4
--- 16623,16629 ----
  option is enabled, \s-1GCC\s0 aligns pairs of instructions that it
  thinks should execute in parallel.
  .Sp
! This option only has an effect when optimizing for the \s-1VR4130.\s0
  It normally makes code faster, but at the expense of making it bigger.
  It is enabled by default at optimization level \fB\-O3\fR.
  .IP "\fB\-msynci\fR" 4
*************** to the \f(CW\*(C`rE\*(C'\fR epsilon regi
*** 16706,16712 ****
  .PD
  Generate code that passes function parameters and return values that (in
  the called function) are seen as registers \f(CW$0\fR and up, as opposed to
! the \s-1GNU\s0 \s-1ABI\s0 which uses global registers \f(CW$231\fR and up.
  .IP "\fB\-mzero\-extend\fR" 4
  .IX Item "-mzero-extend"
  .PD 0
--- 16712,16718 ----
  .PD
  Generate code that passes function parameters and return values that (in
  the called function) are seen as registers \f(CW$0\fR and up, as opposed to
! the \s-1GNU ABI\s0 which uses global registers \f(CW$231\fR and up.
  .IP "\fB\-mzero\-extend\fR" 4
  .IX Item "-mzero-extend"
  .PD 0
*************** Do not generate code using features spec
*** 16790,16796 ****
  is the default.
  .IP "\fB\-mam33\-2\fR" 4
  .IX Item "-mam33-2"
! Generate code using features specific to the \s-1AM33/2\s0.0 processor.
  .IP "\fB\-mam34\fR" 4
  .IX Item "-mam34"
  Generate code using features specific to the \s-1AM34\s0 processor.
--- 16796,16802 ----
  is the default.
  .IP "\fB\-mam33\-2\fR" 4
  .IX Item "-mam33-2"
! Generate code using features specific to the \s-1AM33/2.0\s0 processor.
  .IP "\fB\-mam34\fR" 4
  .IX Item "-mam34"
  Generate code using features specific to the \s-1AM34\s0 processor.
*************** header file.
*** 16875,16882 ****
  The option also sets the \s-1ISA\s0 to use.  If the \s-1MCU\s0 name is one that is
  known to only support the 430 \s-1ISA\s0 then that is selected, otherwise the
  430X \s-1ISA\s0 is selected.  A generic \s-1MCU\s0 name of \fBmsp430\fR can also be
! used to select the 430 \s-1ISA\s0.  Similarly the generic \fBmsp430x\fR \s-1MCU\s0
! name selects the 430X \s-1ISA\s0.
  .Sp
  In addition an MCU-specific linker script is added to the linker
  command line.  The script's name is the name of the \s-1MCU\s0 with
--- 16881,16888 ----
  The option also sets the \s-1ISA\s0 to use.  If the \s-1MCU\s0 name is one that is
  known to only support the 430 \s-1ISA\s0 then that is selected, otherwise the
  430X \s-1ISA\s0 is selected.  A generic \s-1MCU\s0 name of \fBmsp430\fR can also be
! used to select the 430 \s-1ISA.\s0  Similarly the generic \fBmsp430x\fR \s-1MCU\s0
! name selects the 430X \s-1ISA.\s0
  .Sp
  In addition an MCU-specific linker script is added to the linker
  command line.  The script's name is the name of the \s-1MCU\s0 with
*************** This option is also passed on to the ass
*** 16889,16895 ****
  .IX Item "-mcpu="
  Specifies the \s-1ISA\s0 to use.  Accepted values are \fBmsp430\fR,
  \&\fBmsp430x\fR and \fBmsp430xv2\fR.  This option is deprecated.  The
! \&\fB\-mmcu=\fR option should be used to select the \s-1ISA\s0.
  .IP "\fB\-msim\fR" 4
  .IX Item "-msim"
  Link to the simulator runtime libraries and linker script.  Overrides
--- 16895,16901 ----
  .IX Item "-mcpu="
  Specifies the \s-1ISA\s0 to use.  Accepted values are \fBmsp430\fR,
  \&\fBmsp430x\fR and \fBmsp430xv2\fR.  This option is deprecated.  The
! \&\fB\-mmcu=\fR option should be used to select the \s-1ISA.\s0
  .IP "\fB\-msim\fR" 4
  .IX Item "-msim"
  Link to the simulator runtime libraries and linker script.  Overrides
*************** global pointer.
*** 17066,17072 ****
  .Sp
  The default is \fB\-mgpopt\fR except when \fB\-fpic\fR or
  \&\fB\-fPIC\fR is specified to generate position-independent code.
! Note that the Nios \s-1II\s0 \s-1ABI\s0 does not permit GP-relative accesses from
  shared libraries.
  .Sp
  You may need to specify \fB\-mno\-gpopt\fR explicitly when building
--- 17072,17078 ----
  .Sp
  The default is \fB\-mgpopt\fR except when \fB\-fpic\fR or
  \&\fB\-fPIC\fR is specified to generate position-independent code.
! Note that the Nios \s-1II ABI\s0 does not permit GP-relative accesses from
  shared libraries.
  .Sp
  You may need to specify \fB\-mno\-gpopt\fR explicitly when building
*************** of the default behavior of using a libra
*** 17139,17145 ****
  .Sp
  The following values of \fIinsn\fR are supported.  Except as otherwise
  noted, floating-point operations are expected to be implemented with
! normal \s-1IEEE\s0 754 semantics and correspond directly to the C operators or the
  equivalent \s-1GCC\s0 built-in functions.
  .Sp
  Single-precision floating point:
--- 17145,17151 ----
  .Sp
  The following values of \fIinsn\fR are supported.  Except as otherwise
  noted, floating-point operations are expected to be implemented with
! normal \s-1IEEE 754\s0 semantics and correspond directly to the C operators or the
  equivalent \s-1GCC\s0 built-in functions.
  .Sp
  Single-precision floating point:
*************** configuration by using the \f(CW\*(C`tar
*** 17298,17311 ****
  function attribute
  or pragma.
  .PP
! These additional \fB\-m\fR options are available for the Altera Nios \s-1II\s0
! \&\s-1ELF\s0 (bare-metal) target:
  .IP "\fB\-mhal\fR" 4
  .IX Item "-mhal"
! Link with \s-1HAL\s0 \s-1BSP\s0.  This suppresses linking with the GCC-provided C runtime
  startup and termination code, and is typically used in conjunction with
  \&\fB\-msys\-crt0=\fR to specify the location of the alternate startup code
! provided by the \s-1HAL\s0 \s-1BSP\s0.
  .IP "\fB\-msmallc\fR" 4
  .IX Item "-msmallc"
  Link with a limited version of the C library, \fB\-lsmallc\fR, rather than
--- 17304,17317 ----
  function attribute
  or pragma.
  .PP
! These additional \fB\-m\fR options are available for the Altera Nios \s-1II
! ELF\s0 (bare-metal) target:
  .IP "\fB\-mhal\fR" 4
  .IX Item "-mhal"
! Link with \s-1HAL BSP.\s0  This suppresses linking with the GCC-provided C runtime
  startup and termination code, and is typically used in conjunction with
  \&\fB\-msys\-crt0=\fR to specify the location of the alternate startup code
! provided by the \s-1HAL BSP.\s0
  .IP "\fB\-msmallc\fR" 4
  .IX Item "-msmallc"
  Link with a limited version of the C library, \fB\-lsmallc\fR, rather than
*************** when linking.  This option is only usefu
*** 17319,17325 ****
  \&\fIsystemlib\fR is the library name of the library that provides
  low-level system calls required by the C library,
  e.g. \f(CW\*(C`read\*(C'\fR and \f(CW\*(C`write\*(C'\fR.
! This option is typically used to link with a library provided by a \s-1HAL\s0 \s-1BSP\s0.
  .PP
  \fINvidia \s-1PTX\s0 Options\fR
  .IX Subsection "Nvidia PTX Options"
--- 17325,17331 ----
  \&\fIsystemlib\fR is the library name of the library that provides
  low-level system calls required by the C library,
  e.g. \f(CW\*(C`read\*(C'\fR and \f(CW\*(C`write\*(C'\fR.
! This option is typically used to link with a library provided by a \s-1HAL BSP.\s0
  .PP
  \fINvidia \s-1PTX\s0 Options\fR
  .IX Subsection "Nvidia PTX Options"
*************** These options are defined for Nvidia \s-
*** 17331,17337 ****
  .IP "\fB\-m64\fR" 4
  .IX Item "-m64"
  .PD
! Generate code for 32\-bit or 64\-bit \s-1ABI\s0.
  .IP "\fB\-mmainkernel\fR" 4
  .IX Item "-mmainkernel"
  Link in code for a _\|_main kernel.  This is for stand-alone instead of
--- 17337,17343 ----
  .IP "\fB\-m64\fR" 4
  .IX Item "-m64"
  .PD
! Generate code for 32\-bit or 64\-bit \s-1ABI.\s0
  .IP "\fB\-mmainkernel\fR" 4
  .IX Item "-mmainkernel"
  Link in code for a _\|_main kernel.  This is for stand-alone instead of
*************** Return floating-point results in ac0 (fr
*** 17356,17368 ****
  Return floating-point results in memory.  This is the default.
  .IP "\fB\-m40\fR" 4
  .IX Item "-m40"
! Generate code for a \s-1PDP\-11/40\s0.
  .IP "\fB\-m45\fR" 4
  .IX Item "-m45"
! Generate code for a \s-1PDP\-11/45\s0.  This is the default.
  .IP "\fB\-m10\fR" 4
  .IX Item "-m10"
! Generate code for a \s-1PDP\-11/10\s0.
  .IP "\fB\-mbcopy\-builtin\fR" 4
  .IX Item "-mbcopy-builtin"
  Use inline \f(CW\*(C`movmemhi\*(C'\fR patterns for copying memory.  This is the
--- 17362,17374 ----
  Return floating-point results in memory.  This is the default.
  .IP "\fB\-m40\fR" 4
  .IX Item "-m40"
! Generate code for a \s-1PDP\-11/40.\s0
  .IP "\fB\-m45\fR" 4
  .IX Item "-m45"
! Generate code for a \s-1PDP\-11/45.\s0  This is the default.
  .IP "\fB\-m10\fR" 4
  .IX Item "-m10"
! Generate code for a \s-1PDP\-11/10.\s0
  .IP "\fB\-mbcopy\-builtin\fR" 4
  .IX Item "-mbcopy-builtin"
  Use inline \f(CW\*(C`movmemhi\*(C'\fR patterns for copying memory.  This is the
*************** for \fIae_type\fR are \fB\s-1ANY\s0\fR,
*** 17434,17447 ****
  generated with this option runs on any of the other \s-1AE\s0 types.  The
  code is not as efficient as it would be if compiled for a specific
  \&\s-1AE\s0 type, and some types of operation (e.g., multiplication) do not
! work properly on all types of \s-1AE\s0.
  .Sp
! \&\fB\-mae=MUL\fR selects a \s-1MUL\s0 \s-1AE\s0 type.  This is the most useful \s-1AE\s0 type
  for compiled code, and is the default.
  .Sp
! \&\fB\-mae=MAC\fR selects a DSP-style \s-1MAC\s0 \s-1AE\s0.  Code compiled with this
  option may suffer from poor performance of byte (char) manipulation,
! since the \s-1DSP\s0 \s-1AE\s0 does not provide hardware support for byte load/stores.
  .IP "\fB\-msymbol\-as\-address\fR" 4
  .IX Item "-msymbol-as-address"
  Enable the compiler to directly use a symbol name as an address in a
--- 17440,17453 ----
  generated with this option runs on any of the other \s-1AE\s0 types.  The
  code is not as efficient as it would be if compiled for a specific
  \&\s-1AE\s0 type, and some types of operation (e.g., multiplication) do not
! work properly on all types of \s-1AE.\s0
  .Sp
! \&\fB\-mae=MUL\fR selects a \s-1MUL AE\s0 type.  This is the most useful \s-1AE\s0 type
  for compiled code, and is the default.
  .Sp
! \&\fB\-mae=MAC\fR selects a DSP-style \s-1MAC AE.\s0  Code compiled with this
  option may suffer from poor performance of byte (char) manipulation,
! since the \s-1DSP AE\s0 does not provide hardware support for byte load/stores.
  .IP "\fB\-msymbol\-as\-address\fR" 4
  .IX Item "-msymbol-as-address"
  Enable the compiler to directly use a symbol name as an address in a
*************** rather than being permanently enabled.
*** 17454,17460 ****
  .IX Item "-mno-inefficient-warnings"
  Disables warnings about the generation of inefficient code.  These
  warnings can be generated, for example, when compiling code that
! performs byte-level memory operations on the \s-1MAC\s0 \s-1AE\s0 type.  The \s-1MAC\s0 \s-1AE\s0 has
  no hardware support for byte-level memory operations, so all byte
  load/stores must be synthesized from word load/store operations.  This is
  inefficient and a warning is generated to indicate
--- 17460,17466 ----
  .IX Item "-mno-inefficient-warnings"
  Disables warnings about the generation of inefficient code.  These
  warnings can be generated, for example, when compiling code that
! performs byte-level memory operations on the \s-1MAC AE\s0 type.  The \s-1MAC AE\s0 has
  no hardware support for byte-level memory operations, so all byte
  load/stores must be synthesized from word load/store operations.  This is
  inefficient and a warning is generated to indicate
*************** Make the \f(CW\*(C`double\*(C'\fR data t
*** 17496,17505 ****
  or 32 bits (\fB\-m32bit\-doubles\fR) in size.  The default is
  \&\fB\-m32bit\-doubles\fR.
  .PP
! \fI\s-1IBM\s0 \s-1RS/6000\s0 and PowerPC Options\fR
  .IX Subsection "IBM RS/6000 and PowerPC Options"
  .PP
! These \fB\-m\fR options are defined for the \s-1IBM\s0 \s-1RS/6000\s0 and PowerPC:
  .IP "\fB\-mpowerpc\-gpopt\fR" 4
  .IX Item "-mpowerpc-gpopt"
  .PD 0
--- 17502,17511 ----
  or 32 bits (\fB\-m32bit\-doubles\fR) in size.  The default is
  \&\fB\-m32bit\-doubles\fR.
  .PP
! \fI\s-1IBM RS/6000\s0 and PowerPC Options\fR
  .IX Subsection "IBM RS/6000 and PowerPC Options"
  .PP
! These \fB\-m\fR options are defined for the \s-1IBM RS/6000\s0 and PowerPC:
  .IP "\fB\-mpowerpc\-gpopt\fR" 4
  .IX Item "-mpowerpc-gpopt"
  .PD 0
*************** These \fB\-m\fR options are defined for
*** 17544,17550 ****
  .PD
  You use these options to specify which instructions are available on the
  processor you are using.  The default value of these options is
! determined when configuring \s-1GCC\s0.  Specifying the
  \&\fB\-mcpu=\fR\fIcpu_type\fR overrides the specification of these
  options.  We recommend you use the \fB\-mcpu=\fR\fIcpu_type\fR option
  rather than the options listed above.
--- 17550,17556 ----
  .PD
  You use these options to specify which instructions are available on the
  processor you are using.  The default value of these options is
! determined when configuring \s-1GCC.\s0  Specifying the
  \&\fB\-mcpu=\fR\fIcpu_type\fR overrides the specification of these
  options.  We recommend you use the \fB\-mcpu=\fR\fIcpu_type\fR option
  rather than the options listed above.
*************** following options:
*** 17617,17623 ****
  \&\-mpopcntb \-mpopcntd  \-mpowerpc64 
  \&\-mpowerpc\-gpopt  \-mpowerpc\-gfxopt  \-msingle\-float \-mdouble\-float 
  \&\-msimple\-fpu \-mstring  \-mmulhw  \-mdlmzb  \-mmfpgpr \-mvsx 
! \&\-mcrypto \-mdirect\-move \-mpower8\-fusion \-mpower8\-vector 
  \&\-mquad\-memory \-mquad\-memory\-atomic\fR
  .Sp
  The particular options set for any particular \s-1CPU\s0 varies between
--- 17623,17629 ----
  \&\-mpopcntb \-mpopcntd  \-mpowerpc64 
  \&\-mpowerpc\-gpopt  \-mpowerpc\-gfxopt  \-msingle\-float \-mdouble\-float 
  \&\-msimple\-fpu \-mstring  \-mmulhw  \-mdlmzb  \-mmfpgpr \-mvsx 
! \&\-mcrypto \-mdirect\-move \-mhtm \-mpower8\-fusion \-mpower8\-vector 
  \&\-mquad\-memory \-mquad\-memory\-atomic\fR
  .Sp
  The particular options set for any particular \s-1CPU\s0 varies between
*************** capabilities.  If you wish to set an ind
*** 17627,17633 ****
  value, you may specify it after the \fB\-mcpu\fR option, like
  \&\fB\-mcpu=970 \-mno\-altivec\fR.
  .Sp
! On \s-1AIX\s0, the \fB\-maltivec\fR and \fB\-mpowerpc64\fR options are
  not enabled or disabled by the \fB\-mcpu\fR option at present because
  \&\s-1AIX\s0 does not have full support for these options.  You may still
  enable or disable them individually if you're sure it'll work in your
--- 17633,17639 ----
  value, you may specify it after the \fB\-mcpu\fR option, like
  \&\fB\-mcpu=970 \-mno\-altivec\fR.
  .Sp
! On \s-1AIX,\s0 the \fB\-maltivec\fR and \fB\-mpowerpc64\fR options are
  not enabled or disabled by the \fB\-mcpu\fR option at present because
  \&\s-1AIX\s0 does not have full support for these options.  You may still
  enable or disable them individually if you're sure it'll work in your
*************** Generate code that allows \fBld\fR and \
*** 17715,17728 ****
  to build executables and shared
  libraries with non-executable \f(CW\*(C`.plt\*(C'\fR and \f(CW\*(C`.got\*(C'\fR sections.
  This is a PowerPC
! 32\-bit \s-1SYSV\s0 \s-1ABI\s0 option.
  .IP "\fB\-mbss\-plt\fR" 4
  .IX Item "-mbss-plt"
  Generate code that uses a \s-1BSS\s0 \f(CW\*(C`.plt\*(C'\fR section that \fBld.so\fR
  fills in, and
  requires \f(CW\*(C`.plt\*(C'\fR and \f(CW\*(C`.got\*(C'\fR
  sections that are both writable and executable.
! This is a PowerPC 32\-bit \s-1SYSV\s0 \s-1ABI\s0 option.
  .IP "\fB\-misel\fR" 4
  .IX Item "-misel"
  .PD 0
--- 17721,17734 ----
  to build executables and shared
  libraries with non-executable \f(CW\*(C`.plt\*(C'\fR and \f(CW\*(C`.got\*(C'\fR sections.
  This is a PowerPC
! 32\-bit \s-1SYSV ABI\s0 option.
  .IP "\fB\-mbss\-plt\fR" 4
  .IX Item "-mbss-plt"
  Generate code that uses a \s-1BSS\s0 \f(CW\*(C`.plt\*(C'\fR section that \fBld.so\fR
  fills in, and
  requires \f(CW\*(C`.plt\*(C'\fR and \f(CW\*(C`.got\*(C'\fR
  sections that are both writable and executable.
! This is a PowerPC 32\-bit \s-1SYSV ABI\s0 option.
  .IP "\fB\-misel\fR" 4
  .IX Item "-misel"
  .PD 0
*************** more direct access to the \s-1VSX\s0 ins
*** 17771,17777 ****
  .PD
  Enable the use (disable) of the built-in functions that allow direct
  access to the cryptographic instructions that were added in version
! 2.07 of the PowerPC \s-1ISA\s0.
  .IP "\fB\-mdirect\-move\fR" 4
  .IX Item "-mdirect-move"
  .PD 0
--- 17777,17783 ----
  .PD
  Enable the use (disable) of the built-in functions that allow direct
  access to the cryptographic instructions that were added in version
! 2.07 of the PowerPC \s-1ISA.\s0
  .IP "\fB\-mdirect\-move\fR" 4
  .IX Item "-mdirect-move"
  .PD 0
*************** access to the cryptographic instructions
*** 17780,17786 ****
  .PD
  Generate code that uses (does not use) the instructions to move data
  between the general purpose registers and the vector/scalar (\s-1VSX\s0)
! registers that were added in version 2.07 of the PowerPC \s-1ISA\s0.
  .IP "\fB\-mpower8\-fusion\fR" 4
  .IX Item "-mpower8-fusion"
  .PD 0
--- 17786,17801 ----
  .PD
  Generate code that uses (does not use) the instructions to move data
  between the general purpose registers and the vector/scalar (\s-1VSX\s0)
! registers that were added in version 2.07 of the PowerPC \s-1ISA.\s0
! .IP "\fB\-mhtm\fR" 4
! .IX Item "-mhtm"
! .PD 0
! .IP "\fB\-mno\-htm\fR" 4
! .IX Item "-mno-htm"
! .PD
! Enable (disable) the use of the built-in functions that allow direct
! access to the Hardware Transactional Memory (\s-1HTM\s0) instructions that
! were added in version 2.07 of the PowerPC \s-1ISA.\s0
  .IP "\fB\-mpower8\-fusion\fR" 4
  .IX Item "-mpower8-fusion"
  .PD 0
*************** later processors.
*** 17797,17803 ****
  .IX Item "-mno-power8-vector"
  .PD
  Generate code that uses (does not use) the vector and scalar
! instructions that were added in version 2.07 of the PowerPC \s-1ISA\s0.  Also
  enable the use of built-in functions that allow more direct access to
  the vector instructions.
  .IP "\fB\-mquad\-memory\fR" 4
--- 17812,17818 ----
  .IX Item "-mno-power8-vector"
  .PD
  Generate code that uses (does not use) the vector and scalar
! instructions that were added in version 2.07 of the PowerPC \s-1ISA.\s0  Also
  enable the use of built-in functions that allow more direct access to
  the vector instructions.
  .IP "\fB\-mquad\-memory\fR" 4
*************** instructions.  The \fB\-mquad\-memory\-a
*** 17827,17833 ****
  Generate code that uses (does not use) the scalar double precision
  instructions that target all 64 registers in the vector/scalar
  floating point register set that were added in version 2.06 of the
! PowerPC \s-1ISA\s0.  \fB\-mupper\-regs\-df\fR is turned on by default if you
  use any of the \fB\-mcpu=power7\fR, \fB\-mcpu=power8\fR, or
  \&\fB\-mvsx\fR options.
  .IP "\fB\-mupper\-regs\-sf\fR" 4
--- 17842,17848 ----
  Generate code that uses (does not use) the scalar double precision
  instructions that target all 64 registers in the vector/scalar
  floating point register set that were added in version 2.06 of the
! PowerPC \s-1ISA.\s0  \fB\-mupper\-regs\-df\fR is turned on by default if you
  use any of the \fB\-mcpu=power7\fR, \fB\-mcpu=power8\fR, or
  \&\fB\-mvsx\fR options.
  .IP "\fB\-mupper\-regs\-sf\fR" 4
*************** use any of the \fB\-mcpu=power7\fR, \fB\
*** 17839,17845 ****
  Generate code that uses (does not use) the scalar single precision
  instructions that target all 64 registers in the vector/scalar
  floating point register set that were added in version 2.07 of the
! PowerPC \s-1ISA\s0.  \fB\-mupper\-regs\-sf\fR is turned on by default if you
  use either of the \fB\-mcpu=power8\fR or \fB\-mpower8\-vector\fR
  options.
  .IP "\fB\-mupper\-regs\fR" 4
--- 17854,17860 ----
  Generate code that uses (does not use) the scalar single precision
  instructions that target all 64 registers in the vector/scalar
  floating point register set that were added in version 2.07 of the
! PowerPC \s-1ISA.\s0  \fB\-mupper\-regs\-sf\fR is turned on by default if you
  use either of the \fB\-mcpu=power8\fR or \fB\-mpower8\-vector\fR
  options.
  .IP "\fB\-mupper\-regs\fR" 4
*************** Modify generation of the \s-1TOC\s0 (Tab
*** 17900,17907 ****
  every executable file.  The \fB\-mfull\-toc\fR option is selected by
  default.  In that case, \s-1GCC\s0 allocates at least one \s-1TOC\s0 entry for
  each unique non-automatic variable reference in your program.  \s-1GCC\s0
! also places floating-point constants in the \s-1TOC\s0.  However, only
! 16,384 entries are available in the \s-1TOC\s0.
  .Sp
  If you receive a linker error message that saying you have overflowed
  the available \s-1TOC\s0 space, you can reduce the amount of \s-1TOC\s0 space used
--- 17915,17922 ----
  every executable file.  The \fB\-mfull\-toc\fR option is selected by
  default.  In that case, \s-1GCC\s0 allocates at least one \s-1TOC\s0 entry for
  each unique non-automatic variable reference in your program.  \s-1GCC\s0
! also places floating-point constants in the \s-1TOC.\s0  However, only
! 16,384 entries are available in the \s-1TOC.\s0
  .Sp
  If you receive a linker error message that saying you have overflowed
  the available \s-1TOC\s0 space, you can reduce the amount of \s-1TOC\s0 space used
*************** with the \fB\-mno\-fp\-in\-toc\fR and \f
*** 17909,17915 ****
  \&\fB\-mno\-fp\-in\-toc\fR prevents \s-1GCC\s0 from putting floating-point
  constants in the \s-1TOC\s0 and \fB\-mno\-sum\-in\-toc\fR forces \s-1GCC\s0 to
  generate code to calculate the sum of an address and a constant at
! run time instead of putting that sum into the \s-1TOC\s0.  You may specify one
  or both of these options.  Each causes \s-1GCC\s0 to produce very slightly
  slower and larger code at the expense of conserving \s-1TOC\s0 space.
  .Sp
--- 17924,17930 ----
  \&\fB\-mno\-fp\-in\-toc\fR prevents \s-1GCC\s0 from putting floating-point
  constants in the \s-1TOC\s0 and \fB\-mno\-sum\-in\-toc\fR forces \s-1GCC\s0 to
  generate code to calculate the sum of an address and a constant at
! run time instead of putting that sum into the \s-1TOC.\s0  You may specify one
  or both of these options.  Each causes \s-1GCC\s0 to produce very slightly
  slower and larger code at the expense of conserving \s-1TOC\s0 space.
  .Sp
*************** only on files that contain less frequent
*** 17925,17931 ****
  .IP "\fB\-maix32\fR" 4
  .IX Item "-maix32"
  .PD
! Enable 64\-bit \s-1AIX\s0 \s-1ABI\s0 and calling convention: 64\-bit pointers, 64\-bit
  \&\f(CW\*(C`long\*(C'\fR type, and the infrastructure needed to support them.
  Specifying \fB\-maix64\fR implies \fB\-mpowerpc64\fR,
  while \fB\-maix32\fR disables the 64\-bit \s-1ABI\s0 and
--- 17940,17946 ----
  .IP "\fB\-maix32\fR" 4
  .IX Item "-maix32"
  .PD
! Enable 64\-bit \s-1AIX ABI\s0 and calling convention: 64\-bit pointers, 64\-bit
  \&\f(CW\*(C`long\*(C'\fR type, and the infrastructure needed to support them.
  Specifying \fB\-maix64\fR implies \fB\-mpowerpc64\fR,
  while \fB\-maix32\fR disables the 64\-bit \s-1ABI\s0 and
*************** implies \fB\-mno\-powerpc64\fR.  \s-1GCC
*** 17936,17943 ****
  .IP "\fB\-mno\-xl\-compat\fR" 4
  .IX Item "-mno-xl-compat"
  .PD
! Produce code that conforms more closely to \s-1IBM\s0 \s-1XL\s0 compiler semantics
! when using AIX-compatible \s-1ABI\s0.  Pass floating-point arguments to
  prototyped functions beyond the register save area (\s-1RSA\s0) on the stack
  in addition to argument FPRs.  Do not assume that most significant
  double in 128\-bit long double value is properly rounded when comparing
--- 17951,17958 ----
  .IP "\fB\-mno\-xl\-compat\fR" 4
  .IX Item "-mno-xl-compat"
  .PD
! Produce code that conforms more closely to \s-1IBM XL\s0 compiler semantics
! when using AIX-compatible \s-1ABI.\s0  Pass floating-point arguments to
  prototyped functions beyond the register save area (\s-1RSA\s0) on the stack
  in addition to argument FPRs.  Do not assume that most significant
  double in 128\-bit long double value is properly rounded when comparing
*************** support routines.
*** 17946,17961 ****
  .Sp
  The \s-1AIX\s0 calling convention was extended but not initially documented to
  handle an obscure K&R C case of calling a function that takes the
! address of its arguments with fewer arguments than declared.  \s-1IBM\s0 \s-1XL\s0
  compilers access floating-point arguments that do not fit in the
  \&\s-1RSA\s0 from the stack when a subroutine is compiled without
  optimization.  Because always storing floating-point arguments on the
  stack is inefficient and rarely needed, this option is not enabled by
! default and only is necessary when calling subroutines compiled by \s-1IBM\s0
! \&\s-1XL\s0 compilers without optimization.
  .IP "\fB\-mpe\fR" 4
  .IX Item "-mpe"
! Support \fI\s-1IBM\s0 \s-1RS/6000\s0 \s-1SP\s0\fR \fIParallel Environment\fR (\s-1PE\s0).  Link an
  application written to use message passing with special startup code to
  enable the application to run.  The system must have \s-1PE\s0 installed in the
  standard location (\fI/usr/lpp/ppe.poe/\fR), or the \fIspecs\fR file
--- 17961,17976 ----
  .Sp
  The \s-1AIX\s0 calling convention was extended but not initially documented to
  handle an obscure K&R C case of calling a function that takes the
! address of its arguments with fewer arguments than declared.  \s-1IBM XL\s0
  compilers access floating-point arguments that do not fit in the
  \&\s-1RSA\s0 from the stack when a subroutine is compiled without
  optimization.  Because always storing floating-point arguments on the
  stack is inefficient and rarely needed, this option is not enabled by
! default and only is necessary when calling subroutines compiled by \s-1IBM
! XL\s0 compilers without optimization.
  .IP "\fB\-mpe\fR" 4
  .IX Item "-mpe"
! Support \fI\s-1IBM RS/6000 SP\s0\fR \fIParallel Environment\fR (\s-1PE\s0).  Link an
  application written to use message passing with special startup code to
  enable the application to run.  The system must have \s-1PE\s0 installed in the
  standard location (\fI/usr/lpp/ppe.poe/\fR), or the \fIspecs\fR file
*************** option are incompatible.
*** 17969,17979 ****
  .IP "\fB\-malign\-power\fR" 4
  .IX Item "-malign-power"
  .PD
! On \s-1AIX\s0, 32\-bit Darwin, and 64\-bit PowerPC GNU/Linux, the option
  \&\fB\-malign\-natural\fR overrides the ABI-defined alignment of larger
  types, such as floating-point doubles, on their natural size-based boundary.
  The option \fB\-malign\-power\fR instructs \s-1GCC\s0 to follow the ABI-specified
! alignment rules.  \s-1GCC\s0 defaults to the standard alignment defined in the \s-1ABI\s0.
  .Sp
  On 64\-bit Darwin, natural alignment is the default, and \fB\-malign\-power\fR
  is not supported.
--- 17984,17994 ----
  .IP "\fB\-malign\-power\fR" 4
  .IX Item "-malign-power"
  .PD
! On \s-1AIX,\s0 32\-bit Darwin, and 64\-bit PowerPC GNU/Linux, the option
  \&\fB\-malign\-natural\fR overrides the ABI-defined alignment of larger
  types, such as floating-point doubles, on their natural size-based boundary.
  The option \fB\-malign\-power\fR instructs \s-1GCC\s0 to follow the ABI-specified
! alignment rules.  \s-1GCC\s0 defaults to the standard alignment defined in the \s-1ABI.\s0
  .Sp
  On 64\-bit Darwin, natural alignment is the default, and \fB\-malign\-power\fR
  is not supported.
*************** Specify type of floating-point unit.  Va
*** 18007,18013 ****
  and \fBdp_full\fR (equivalent to \fB\-mdouble\-float\fR).
  .IP "\fB\-mxilinx\-fpu\fR" 4
  .IX Item "-mxilinx-fpu"
! Perform optimizations for the floating-point unit on Xilinx \s-1PPC\s0 405/440.
  .IP "\fB\-mmultiple\fR" 4
  .IX Item "-mmultiple"
  .PD 0
--- 18022,18028 ----
  and \fBdp_full\fR (equivalent to \fB\-mdouble\-float\fR).
  .IP "\fB\-mxilinx\-fpu\fR" 4
  .IX Item "-mxilinx-fpu"
! Perform optimizations for the floating-point unit on Xilinx \s-1PPC 405/440.\s0
  .IP "\fB\-mmultiple\fR" 4
  .IX Item "-mmultiple"
  .PD 0
*************** mapped to \fB\-ffp\-contract=off\fR.
*** 18078,18084 ****
  .IX Item "-mno-mulhw"
  .PD
  Generate code that uses (does not use) the half-word multiply and
! multiply-accumulate instructions on the \s-1IBM\s0 405, 440, 464 and 476 processors.
  These instructions are generated by default when targeting those
  processors.
  .IP "\fB\-mdlmzb\fR" 4
--- 18093,18099 ----
  .IX Item "-mno-mulhw"
  .PD
  Generate code that uses (does not use) the half-word multiply and
! multiply-accumulate instructions on the \s-1IBM 405, 440, 464\s0 and 476 processors.
  These instructions are generated by default when targeting those
  processors.
  .IP "\fB\-mdlmzb\fR" 4
*************** processors.
*** 18088,18094 ****
  .IX Item "-mno-dlmzb"
  .PD
  Generate code that uses (does not use) the string-search \fBdlmzb\fR
! instruction on the \s-1IBM\s0 405, 440, 464 and 476 processors.  This instruction is
  generated by default when targeting those processors.
  .IP "\fB\-mno\-bit\-align\fR" 4
  .IX Item "-mno-bit-align"
--- 18103,18109 ----
  .IX Item "-mno-dlmzb"
  .PD
  Generate code that uses (does not use) the string-search \fBdlmzb\fR
! instruction on the \s-1IBM 405, 440, 464\s0 and 476 processors.  This instruction is
  generated by default when targeting those processors.
  .IP "\fB\-mno\-bit\-align\fR" 4
  .IX Item "-mno-bit-align"
*************** processor in big-endian mode.  The \fB\-
*** 18168,18174 ****
  the same as \fB\-mbig\fR.
  .IP "\fB\-mdynamic\-no\-pic\fR" 4
  .IX Item "-mdynamic-no-pic"
! On Darwin and Mac \s-1OS\s0 X systems, compile code so that it is not
  relocatable, but that its external references are relocatable.  The
  resulting code is suitable for applications, but not shared
  libraries.
--- 18183,18189 ----
  the same as \fB\-mbig\fR.
  .IP "\fB\-mdynamic\-no\-pic\fR" 4
  .IX Item "-mdynamic-no-pic"
! On Darwin and Mac \s-1OS X\s0 systems, compile code so that it is not
  relocatable, but that its external references are relocatable.  The
  resulting code is suitable for applications, but not shared
  libraries.
*************** On System V.4 and embedded PowerPC syste
*** 18274,18284 ****
  OpenBSD operating system.
  .IP "\fB\-maix\-struct\-return\fR" 4
  .IX Item "-maix-struct-return"
! Return all structures in memory (as specified by the \s-1AIX\s0 \s-1ABI\s0).
  .IP "\fB\-msvr4\-struct\-return\fR" 4
  .IX Item "-msvr4-struct-return"
  Return structures smaller than 8 bytes in registers (as specified by the
! \&\s-1SVR4\s0 \s-1ABI\s0).
  .IP "\fB\-mabi=\fR\fIabi-type\fR" 4
  .IX Item "-mabi=abi-type"
  Extend the current \s-1ABI\s0 with a particular extension, or remove such extension.
--- 18289,18299 ----
  OpenBSD operating system.
  .IP "\fB\-maix\-struct\-return\fR" 4
  .IX Item "-maix-struct-return"
! Return all structures in memory (as specified by the \s-1AIX ABI\s0).
  .IP "\fB\-msvr4\-struct\-return\fR" 4
  .IX Item "-msvr4-struct-return"
  Return structures smaller than 8 bytes in registers (as specified by the
! \&\s-1SVR4 ABI\s0).
  .IP "\fB\-mabi=\fR\fIabi-type\fR" 4
  .IX Item "-mabi=abi-type"
  Extend the current \s-1ABI\s0 with a particular extension, or remove such extension.
*************** Valid values are \fBaltivec\fR, \fBno-al
*** 18287,18315 ****
  \&\fBelfv1\fR, \fBelfv2\fR.
  .IP "\fB\-mabi=spe\fR" 4
  .IX Item "-mabi=spe"
! Extend the current \s-1ABI\s0 with \s-1SPE\s0 \s-1ABI\s0 extensions.  This does not change
! the default \s-1ABI\s0, instead it adds the \s-1SPE\s0 \s-1ABI\s0 extensions to the current
! \&\s-1ABI\s0.
  .IP "\fB\-mabi=no\-spe\fR" 4
  .IX Item "-mabi=no-spe"
! Disable Book-E \s-1SPE\s0 \s-1ABI\s0 extensions for the current \s-1ABI\s0.
  .IP "\fB\-mabi=ibmlongdouble\fR" 4
  .IX Item "-mabi=ibmlongdouble"
  Change the current \s-1ABI\s0 to use \s-1IBM\s0 extended-precision long double.
! This is a PowerPC 32\-bit \s-1SYSV\s0 \s-1ABI\s0 option.
  .IP "\fB\-mabi=ieeelongdouble\fR" 4
  .IX Item "-mabi=ieeelongdouble"
  Change the current \s-1ABI\s0 to use \s-1IEEE\s0 extended-precision long double.
  This is a PowerPC 32\-bit Linux \s-1ABI\s0 option.
  .IP "\fB\-mabi=elfv1\fR" 4
  .IX Item "-mabi=elfv1"
! Change the current \s-1ABI\s0 to use the ELFv1 \s-1ABI\s0.
  This is the default \s-1ABI\s0 for big-endian PowerPC 64\-bit Linux.
  Overriding the default \s-1ABI\s0 requires special system support and is
  likely to fail in spectacular ways.
  .IP "\fB\-mabi=elfv2\fR" 4
  .IX Item "-mabi=elfv2"
! Change the current \s-1ABI\s0 to use the ELFv2 \s-1ABI\s0.
  This is the default \s-1ABI\s0 for little-endian PowerPC 64\-bit Linux.
  Overriding the default \s-1ABI\s0 requires special system support and is
  likely to fail in spectacular ways.
--- 18302,18330 ----
  \&\fBelfv1\fR, \fBelfv2\fR.
  .IP "\fB\-mabi=spe\fR" 4
  .IX Item "-mabi=spe"
! Extend the current \s-1ABI\s0 with \s-1SPE ABI\s0 extensions.  This does not change
! the default \s-1ABI,\s0 instead it adds the \s-1SPE ABI\s0 extensions to the current
! \&\s-1ABI.\s0
  .IP "\fB\-mabi=no\-spe\fR" 4
  .IX Item "-mabi=no-spe"
! Disable Book-E \s-1SPE ABI\s0 extensions for the current \s-1ABI.\s0
  .IP "\fB\-mabi=ibmlongdouble\fR" 4
  .IX Item "-mabi=ibmlongdouble"
  Change the current \s-1ABI\s0 to use \s-1IBM\s0 extended-precision long double.
! This is a PowerPC 32\-bit \s-1SYSV ABI\s0 option.
  .IP "\fB\-mabi=ieeelongdouble\fR" 4
  .IX Item "-mabi=ieeelongdouble"
  Change the current \s-1ABI\s0 to use \s-1IEEE\s0 extended-precision long double.
  This is a PowerPC 32\-bit Linux \s-1ABI\s0 option.
  .IP "\fB\-mabi=elfv1\fR" 4
  .IX Item "-mabi=elfv1"
! Change the current \s-1ABI\s0 to use the ELFv1 \s-1ABI.\s0
  This is the default \s-1ABI\s0 for big-endian PowerPC 64\-bit Linux.
  Overriding the default \s-1ABI\s0 requires special system support and is
  likely to fail in spectacular ways.
  .IP "\fB\-mabi=elfv2\fR" 4
  .IX Item "-mabi=elfv2"
! Change the current \s-1ABI\s0 to use the ELFv2 \s-1ABI.\s0
  This is the default \s-1ABI\s0 for little-endian PowerPC 64\-bit Linux.
  Overriding the default \s-1ABI\s0 requires special system support and is
  likely to fail in spectacular ways.
*************** which handle the double-precision recipr
*** 18559,18565 ****
  .PD
  Assume (do not assume) that the reciprocal estimate instructions
  provide higher-precision estimates than is mandated by the PowerPC
! \&\s-1ABI\s0.  Selecting \fB\-mcpu=power6\fR, \fB\-mcpu=power7\fR or
  \&\fB\-mcpu=power8\fR automatically selects \fB\-mrecip\-precision\fR.
  The double-precision square root estimate instructions are not generated by
  default on low-precision machines, since they do not provide an
--- 18574,18580 ----
  .PD
  Assume (do not assume) that the reciprocal estimate instructions
  provide higher-precision estimates than is mandated by the PowerPC
! \&\s-1ABI.\s0  Selecting \fB\-mcpu=power6\fR, \fB\-mcpu=power7\fR or
  \&\fB\-mcpu=power8\fR automatically selects \fB\-mrecip\-precision\fR.
  The double-precision square root estimate instructions are not generated by
  default on low-precision machines, since they do not provide an
*************** pointer.  The \fB\-mno\-save\-toc\-indir
*** 18632,18645 ****
  .PD
  Generate (do not generate) code to pass structure parameters with a
  maximum alignment of 64 bits, for compatibility with older versions
! of \s-1GCC\s0.
  .Sp
  Older versions of \s-1GCC\s0 (prior to 4.9.0) incorrectly did not align a
  structure parameter on a 128\-bit boundary when that structure contained
  a member requiring 128\-bit alignment.  This is corrected in more
! recent versions of \s-1GCC\s0.  This option may be used to generate code
  that is compatible with functions compiled with older versions of
! \&\s-1GCC\s0.
  .Sp
  The \fB\-mno\-compat\-align\-parm\fR option is the default.
  .PP
--- 18647,18660 ----
  .PD
  Generate (do not generate) code to pass structure parameters with a
  maximum alignment of 64 bits, for compatibility with older versions
! of \s-1GCC.\s0
  .Sp
  Older versions of \s-1GCC\s0 (prior to 4.9.0) incorrectly did not align a
  structure parameter on a 128\-bit boundary when that structure contained
  a member requiring 128\-bit alignment.  This is corrected in more
! recent versions of \s-1GCC.\s0  This option may be used to generate code
  that is compatible with functions compiled with older versions of
! \&\s-1GCC.\s0
  .Sp
  The \fB\-mno\-compat\-align\-parm\fR option is the default.
  .PP
*************** values, however, so the \s-1FPU\s0 hardw
*** 18674,18685 ****
  .Sp
  \&\fINote\fR If the \fB\-fpu\fR option is enabled then
  \&\fB\-funsafe\-math\-optimizations\fR is also enabled automatically.
! This is because the \s-1RX\s0 \s-1FPU\s0 instructions are themselves unsafe.
  .IP "\fB\-mcpu=\fR\fIname\fR" 4
  .IX Item "-mcpu=name"
! Selects the type of \s-1RX\s0 \s-1CPU\s0 to be targeted.  Currently three types are
  supported, the generic \fB\s-1RX600\s0\fR and \fB\s-1RX200\s0\fR series hardware and
! the specific \fB\s-1RX610\s0\fR \s-1CPU\s0.  The default is \fB\s-1RX600\s0\fR.
  .Sp
  The only difference between \fB\s-1RX600\s0\fR and \fB\s-1RX610\s0\fR is that the
  \&\fB\s-1RX610\s0\fR does not support the \f(CW\*(C`MVTIPL\*(C'\fR instruction.
--- 18689,18700 ----
  .Sp
  \&\fINote\fR If the \fB\-fpu\fR option is enabled then
  \&\fB\-funsafe\-math\-optimizations\fR is also enabled automatically.
! This is because the \s-1RX FPU\s0 instructions are themselves unsafe.
  .IP "\fB\-mcpu=\fR\fIname\fR" 4
  .IX Item "-mcpu=name"
! Selects the type of \s-1RX CPU\s0 to be targeted.  Currently three types are
  supported, the generic \fB\s-1RX600\s0\fR and \fB\s-1RX200\s0\fR series hardware and
! the specific \fB\s-1RX610\s0\fR \s-1CPU.\s0  The default is \fB\s-1RX600\s0\fR.
  .Sp
  The only difference between \fB\s-1RX600\s0\fR and \fB\s-1RX610\s0\fR is that the
  \&\fB\s-1RX610\s0\fR does not support the \f(CW\*(C`MVTIPL\*(C'\fR instruction.
*************** type. This is the default.
*** 18865,18871 ****
  Store (do not store) the address of the caller's frame as backchain pointer
  into the callee's stack frame.
  A backchain may be needed to allow debugging using tools that do not understand
! \&\s-1DWARF\s0 2 call frame information.
  When \fB\-mno\-packed\-stack\fR is in effect, the backchain pointer is stored
  at the bottom of the stack frame; when \fB\-mpacked\-stack\fR is in effect,
  the backchain is placed into the topmost word of the 96/160 byte register
--- 18880,18886 ----
  Store (do not store) the address of the caller's frame as backchain pointer
  into the callee's stack frame.
  A backchain may be needed to allow debugging using tools that do not understand
! \&\s-1DWARF 2\s0 call frame information.
  When \fB\-mno\-packed\-stack\fR is in effect, the backchain pointer is stored
  at the bottom of the stack frame; when \fB\-mpacked\-stack\fR is in effect,
  the backchain is placed into the topmost word of the 96/160 byte register
*************** register is always saved two words below
*** 18897,18903 ****
  .Sp
  As long as the stack frame backchain is not used, code generated with
  \&\fB\-mpacked\-stack\fR is call-compatible with code generated with
! \&\fB\-mno\-packed\-stack\fR.  Note that some non-FSF releases of \s-1GCC\s0 2.95 for
  S/390 or zSeries generated code that uses the stack frame backchain at run
  time, not just for debugging purposes.  Such code is not call-compatible
  with code compiled with \fB\-mpacked\-stack\fR.  Also, note that the
--- 18912,18918 ----
  .Sp
  As long as the stack frame backchain is not used, code generated with
  \&\fB\-mpacked\-stack\fR is call-compatible with code generated with
! \&\fB\-mno\-packed\-stack\fR.  Note that some non-FSF releases of \s-1GCC 2.95\s0 for
  S/390 or zSeries generated code that uses the stack frame backchain at run
  time, not just for debugging purposes.  Such code is not call-compatible
  with code compiled with \fB\-mpacked\-stack\fR.  Also, note that the
*************** which does not have this limitation.
*** 18924,18931 ****
  .IX Item "-m31"
  .PD
  When \fB\-m31\fR is specified, generate code compliant to the
! GNU/Linux for S/390 \s-1ABI\s0.  When \fB\-m64\fR is specified, generate
! code compliant to the GNU/Linux for zSeries \s-1ABI\s0.  This allows \s-1GCC\s0 in
  particular to generate 64\-bit instructions.  For the \fBs390\fR
  targets, the default is \fB\-m31\fR, while the \fBs390x\fR
  targets default to \fB\-m64\fR.
--- 18939,18946 ----
  .IX Item "-m31"
  .PD
  When \fB\-m31\fR is specified, generate code compliant to the
! GNU/Linux for S/390 \s-1ABI.\s0  When \fB\-m64\fR is specified, generate
! code compliant to the GNU/Linux for zSeries \s-1ABI.\s0  This allows \s-1GCC\s0 in
  particular to generate 64\-bit instructions.  For the \fBs390\fR
  targets, the default is \fB\-m31\fR, while the \fBs390x\fR
  targets default to \fB\-m64\fR.
*************** targets default to \fB\-m64\fR.
*** 18938,18948 ****
  When \fB\-mzarch\fR is specified, generate code using the
  instructions available on z/Architecture.
  When \fB\-mesa\fR is specified, generate code using the
! instructions available on \s-1ESA/390\s0.  Note that \fB\-mesa\fR is
  not possible with \fB\-m64\fR.
! When generating code compliant to the GNU/Linux for S/390 \s-1ABI\s0,
  the default is \fB\-mesa\fR.  When generating code compliant
! to the GNU/Linux for zSeries \s-1ABI\s0, the default is \fB\-mzarch\fR.
  .IP "\fB\-mmvcle\fR" 4
  .IX Item "-mmvcle"
  .PD 0
--- 18953,18963 ----
  When \fB\-mzarch\fR is specified, generate code using the
  instructions available on z/Architecture.
  When \fB\-mesa\fR is specified, generate code using the
! instructions available on \s-1ESA/390.\s0  Note that \fB\-mesa\fR is
  not possible with \fB\-m64\fR.
! When generating code compliant to the GNU/Linux for S/390 \s-1ABI,\s0
  the default is \fB\-mesa\fR.  When generating code compliant
! to the GNU/Linux for zSeries \s-1ABI,\s0 the default is \fB\-mzarch\fR.
  .IP "\fB\-mmvcle\fR" 4
  .IX Item "-mmvcle"
  .PD 0
*************** The default is the value used for \fB\-m
*** 18983,18991 ****
  .IP "\fB\-mno\-tpf\-trace\fR" 4
  .IX Item "-mno-tpf-trace"
  .PD
! Generate code that adds (does not add) in \s-1TPF\s0 \s-1OS\s0 specific branches to trace
  routines in the operating system.  This option is off by default, even
! when compiling for the \s-1TPF\s0 \s-1OS\s0.
  .IP "\fB\-mfused\-madd\fR" 4
  .IX Item "-mfused-madd"
  .PD 0
--- 18998,19006 ----
  .IP "\fB\-mno\-tpf\-trace\fR" 4
  .IX Item "-mno-tpf-trace"
  .PD
! Generate code that adds (does not add) in \s-1TPF OS\s0 specific branches to trace
  routines in the operating system.  This option is off by default, even
! when compiling for the \s-1TPF OS.\s0
  .IP "\fB\-mfused\-madd\fR" 4
  .IX Item "-mfused-madd"
  .PD 0
*************** Specify the \s-1SCORE7D\s0 as the target
*** 19078,19093 ****
  These \fB\-m\fR options are defined for the \s-1SH\s0 implementations:
  .IP "\fB\-m1\fR" 4
  .IX Item "-m1"
! Generate code for the \s-1SH1\s0.
  .IP "\fB\-m2\fR" 4
  .IX Item "-m2"
! Generate code for the \s-1SH2\s0.
  .IP "\fB\-m2e\fR" 4
  .IX Item "-m2e"
  Generate code for the SH2e.
  .IP "\fB\-m2a\-nofpu\fR" 4
  .IX Item "-m2a-nofpu"
! Generate code for the SH2a without \s-1FPU\s0, or for a SH2a\-FPU in such a way
  that the floating-point unit is not used.
  .IP "\fB\-m2a\-single\-only\fR" 4
  .IX Item "-m2a-single-only"
--- 19093,19108 ----
  These \fB\-m\fR options are defined for the \s-1SH\s0 implementations:
  .IP "\fB\-m1\fR" 4
  .IX Item "-m1"
! Generate code for the \s-1SH1.\s0
  .IP "\fB\-m2\fR" 4
  .IX Item "-m2"
! Generate code for the \s-1SH2.\s0
  .IP "\fB\-m2e\fR" 4
  .IX Item "-m2e"
  Generate code for the SH2e.
  .IP "\fB\-m2a\-nofpu\fR" 4
  .IX Item "-m2a-nofpu"
! Generate code for the SH2a without \s-1FPU,\s0 or for a SH2a\-FPU in such a way
  that the floating-point unit is not used.
  .IP "\fB\-m2a\-single\-only\fR" 4
  .IX Item "-m2a-single-only"
*************** Generate code for the SH2a\-FPU assuming
*** 19103,19109 ****
  double-precision mode by default.
  .IP "\fB\-m3\fR" 4
  .IX Item "-m3"
! Generate code for the \s-1SH3\s0.
  .IP "\fB\-m3e\fR" 4
  .IX Item "-m3e"
  Generate code for the SH3e.
--- 19118,19124 ----
  double-precision mode by default.
  .IP "\fB\-m3\fR" 4
  .IX Item "-m3"
! Generate code for the \s-1SH3.\s0
  .IP "\fB\-m3e\fR" 4
  .IX Item "-m3e"
  Generate code for the SH3e.
*************** Generate code for the \s-1SH4\s0 assumin
*** 19120,19129 ****
  single-precision mode by default.
  .IP "\fB\-m4\fR" 4
  .IX Item "-m4"
! Generate code for the \s-1SH4\s0.
  .IP "\fB\-m4\-100\fR" 4
  .IX Item "-m4-100"
! Generate code for \s-1SH4\-100\s0.
  .IP "\fB\-m4\-100\-nofpu\fR" 4
  .IX Item "-m4-100-nofpu"
  Generate code for \s-1SH4\-100\s0 in such a way that the
--- 19135,19144 ----
  single-precision mode by default.
  .IP "\fB\-m4\fR" 4
  .IX Item "-m4"
! Generate code for the \s-1SH4.\s0
  .IP "\fB\-m4\-100\fR" 4
  .IX Item "-m4-100"
! Generate code for \s-1SH4\-100.\s0
  .IP "\fB\-m4\-100\-nofpu\fR" 4
  .IX Item "-m4-100-nofpu"
  Generate code for \s-1SH4\-100\s0 in such a way that the
*************** Generate code for \s-1SH4\-100\s0 in suc
*** 19138,19144 ****
  floating-point operations are used.
  .IP "\fB\-m4\-200\fR" 4
  .IX Item "-m4-200"
! Generate code for \s-1SH4\-200\s0.
  .IP "\fB\-m4\-200\-nofpu\fR" 4
  .IX Item "-m4-200-nofpu"
  Generate code for \s-1SH4\-200\s0 without in such a way that the
--- 19153,19159 ----
  floating-point operations are used.
  .IP "\fB\-m4\-200\fR" 4
  .IX Item "-m4-200"
! Generate code for \s-1SH4\-200.\s0
  .IP "\fB\-m4\-200\-nofpu\fR" 4
  .IX Item "-m4-200-nofpu"
  Generate code for \s-1SH4\-200\s0 without in such a way that the
*************** Generate code for \s-1SH4\-200\s0 in suc
*** 19153,19159 ****
  floating-point operations are used.
  .IP "\fB\-m4\-300\fR" 4
  .IX Item "-m4-300"
! Generate code for \s-1SH4\-300\s0.
  .IP "\fB\-m4\-300\-nofpu\fR" 4
  .IX Item "-m4-300-nofpu"
  Generate code for \s-1SH4\-300\s0 without in such a way that the
--- 19168,19174 ----
  floating-point operations are used.
  .IP "\fB\-m4\-300\fR" 4
  .IX Item "-m4-300"
! Generate code for \s-1SH4\-300.\s0
  .IP "\fB\-m4\-300\-nofpu\fR" 4
  .IX Item "-m4-300-nofpu"
  Generate code for \s-1SH4\-300\s0 without in such a way that the
*************** Generate code for \s-1SH4\-300\s0 in suc
*** 19168,19174 ****
  floating-point operations are used.
  .IP "\fB\-m4\-340\fR" 4
  .IX Item "-m4-340"
! Generate code for \s-1SH4\-340\s0 (no \s-1MMU\s0, no \s-1FPU\s0).
  .IP "\fB\-m4\-500\fR" 4
  .IX Item "-m4-500"
  Generate code for \s-1SH4\-500\s0 (no \s-1FPU\s0).  Passes \fB\-isa=sh4\-nofpu\fR to the
--- 19183,19189 ----
  floating-point operations are used.
  .IP "\fB\-m4\-340\fR" 4
  .IX Item "-m4-340"
! Generate code for \s-1SH4\-340\s0 (no \s-1MMU,\s0 no \s-1FPU\s0).
  .IP "\fB\-m4\-500\fR" 4
  .IX Item "-m4-500"
  Generate code for \s-1SH4\-500\s0 (no \s-1FPU\s0).  Passes \fB\-isa=sh4\-nofpu\fR to the
*************** Use 32\-bit offsets in \f(CW\*(C`switch\
*** 19235,19241 ****
  16\-bit offsets.
  .IP "\fB\-mbitops\fR" 4
  .IX Item "-mbitops"
! Enable the use of bit manipulation instructions on \s-1SH2A\s0.
  .IP "\fB\-mfmovd\fR" 4
  .IX Item "-mfmovd"
  Enable the use of the instruction \f(CW\*(C`fmovd\*(C'\fR.  Check \fB\-mdalign\fR for
--- 19250,19256 ----
  16\-bit offsets.
  .IP "\fB\-mbitops\fR" 4
  .IX Item "-mbitops"
! Enable the use of bit manipulation instructions on \s-1SH2A.\s0
  .IP "\fB\-mfmovd\fR" 4
  .IX Item "-mfmovd"
  Enable the use of the instruction \f(CW\*(C`fmovd\*(C'\fR.  Check \fB\-mdalign\fR for
*************** Dump instruction size and location in th
*** 19282,19288 ****
  .IP "\fB\-mpadstruct\fR" 4
  .IX Item "-mpadstruct"
  This option is deprecated.  It pads structures to multiple of 4 bytes,
! which is incompatible with the \s-1SH\s0 \s-1ABI\s0.
  .IP "\fB\-matomic\-model=\fR\fImodel\fR" 4
  .IX Item "-matomic-model=model"
  Sets the model of atomic operations and additional parameters as a comma
--- 19297,19303 ----
  .IP "\fB\-mpadstruct\fR" 4
  .IX Item "-mpadstruct"
  This option is deprecated.  It pads structures to multiple of 4 bytes,
! which is incompatible with the \s-1SH ABI.\s0
  .IP "\fB\-matomic\-model=\fR\fImodel\fR" 4
  .IX Item "-matomic-model=model"
  Sets the model of atomic operations and additional parameters as a comma
*************** Generate GNU/Linux compatible gUSA softw
*** 19299,19305 ****
  built-in functions.  The generated atomic sequences require additional support
  from the interrupt/exception handling code of the system and are only suitable
  for SH3* and SH4* single-core systems.  This option is enabled by default when
! the target is \f(CW\*(C`sh*\-*\-linux*\*(C'\fR and SH3* or SH4*.  When the target is \s-1SH4A\s0,
  this option also partially utilizes the hardware atomic instructions
  \&\f(CW\*(C`movli.l\*(C'\fR and \f(CW\*(C`movco.l\*(C'\fR to create more efficient code, unless
  \&\fBstrict\fR is specified.
--- 19314,19320 ----
  built-in functions.  The generated atomic sequences require additional support
  from the interrupt/exception handling code of the system and are only suitable
  for SH3* and SH4* single-core systems.  This option is enabled by default when
! the target is \f(CW\*(C`sh*\-*\-linux*\*(C'\fR and SH3* or SH4*.  When the target is \s-1SH4A,\s0
  this option also partially utilizes the hardware atomic instructions
  \&\f(CW\*(C`movli.l\*(C'\fR and \f(CW\*(C`movco.l\*(C'\fR to create more efficient code, unless
  \&\fBstrict\fR is specified.
*************** For targets other than SHmedia \fIstrate
*** 19442,19461 ****
  .IX Item "call-div1"
  Calls a library function that uses the single-step division instruction
  \&\f(CW\*(C`div1\*(C'\fR to perform the operation.  Division by zero calculates an
! unspecified result and does not trap.  This is the default except for \s-1SH4\s0,
! \&\s-1SH2A\s0 and SHcompact.
  .IP "\fBcall-fp\fR" 4
  .IX Item "call-fp"
  Calls a library function that performs the operation in double precision
  floating point.  Division by zero causes a floating-point exception.  This is
! the default for SHcompact with \s-1FPU\s0.  Specifying this for targets that do not
  have a double precision \s-1FPU\s0 defaults to \f(CW\*(C`call\-div1\*(C'\fR.
  .IP "\fBcall-table\fR" 4
  .IX Item "call-table"
  Calls a library function that uses a lookup table for small divisors and
  the \f(CW\*(C`div1\*(C'\fR instruction with case distinction for larger divisors.  Division
  by zero calculates an unspecified result and does not trap.  This is the default
! for \s-1SH4\s0.  Specifying this for targets that do not have dynamic shift
  instructions defaults to \f(CW\*(C`call\-div1\*(C'\fR.
  .RE
  .RS 4
--- 19457,19476 ----
  .IX Item "call-div1"
  Calls a library function that uses the single-step division instruction
  \&\f(CW\*(C`div1\*(C'\fR to perform the operation.  Division by zero calculates an
! unspecified result and does not trap.  This is the default except for \s-1SH4,
! SH2A\s0 and SHcompact.
  .IP "\fBcall-fp\fR" 4
  .IX Item "call-fp"
  Calls a library function that performs the operation in double precision
  floating point.  Division by zero causes a floating-point exception.  This is
! the default for SHcompact with \s-1FPU.\s0  Specifying this for targets that do not
  have a double precision \s-1FPU\s0 defaults to \f(CW\*(C`call\-div1\*(C'\fR.
  .IP "\fBcall-table\fR" 4
  .IX Item "call-table"
  Calls a library function that uses a lookup table for small divisors and
  the \f(CW\*(C`div1\*(C'\fR instruction with case distinction for larger divisors.  Division
  by zero calculates an unspecified result and does not trap.  This is the default
! for \s-1SH4.\s0  Specifying this for targets that do not have dynamic shift
  instructions defaults to \f(CW\*(C`call\-div1\*(C'\fR.
  .RE
  .RS 4
*************** specified separated by a comma.
*** 19489,19498 ****
  Enable the use of the indexed addressing mode for SHmedia32/SHcompact.
  This is only safe if the hardware and/or \s-1OS\s0 implement 32\-bit wrap-around
  semantics for the indexed addressing mode.  The architecture allows the
! implementation of processors with 64\-bit \s-1MMU\s0, which the \s-1OS\s0 could use to
  get 32\-bit addressing, but since no current hardware implementation supports
  this or any other way to make the indexed addressing mode safe to use in
! the 32\-bit \s-1ABI\s0, the default is \fB\-mno\-indexed\-addressing\fR.
  .IP "\fB\-mgettrcost=\fR\fInumber\fR" 4
  .IX Item "-mgettrcost=number"
  Set the cost assumed for the \f(CW\*(C`gettr\*(C'\fR instruction to \fInumber\fR.
--- 19504,19513 ----
  Enable the use of the indexed addressing mode for SHmedia32/SHcompact.
  This is only safe if the hardware and/or \s-1OS\s0 implement 32\-bit wrap-around
  semantics for the indexed addressing mode.  The architecture allows the
! implementation of processors with 64\-bit \s-1MMU,\s0 which the \s-1OS\s0 could use to
  get 32\-bit addressing, but since no current hardware implementation supports
  this or any other way to make the indexed addressing mode safe to use in
! the 32\-bit \s-1ABI,\s0 the default is \fB\-mno\-indexed\-addressing\fR.
  .IP "\fB\-mgettrcost=\fR\fInumber\fR" 4
  .IX Item "-mgettrcost=number"
  Set the cost assumed for the \f(CW\*(C`gettr\*(C'\fR instruction to \fInumber\fR.
*************** the compiler are always valid to load wi
*** 19529,19535 ****
  but with assembler and/or linker tricks it is possible
  to generate symbols that cause \f(CW\*(C`ptabs\*(C'\fR or \f(CW\*(C`ptrel\*(C'\fR to trap.
  This option is only meaningful when \fB\-mno\-pt\-fixed\fR is in effect.
! It prevents cross-basic-block \s-1CSE\s0, hoisting and most scheduling
  of symbol loads.  The default is \fB\-mno\-invalid\-symbols\fR.
  .IP "\fB\-mbranch\-cost=\fR\fInum\fR" 4
  .IX Item "-mbranch-cost=num"
--- 19544,19550 ----
  but with assembler and/or linker tricks it is possible
  to generate symbols that cause \f(CW\*(C`ptabs\*(C'\fR or \f(CW\*(C`ptrel\*(C'\fR to trap.
  This option is only meaningful when \fB\-mno\-pt\-fixed\fR is in effect.
! It prevents cross-basic-block \s-1CSE,\s0 hoisting and most scheduling
  of symbol loads.  The default is \fB\-mno\-invalid\-symbols\fR.
  .IP "\fB\-mbranch\-cost=\fR\fInum\fR" 4
  .IX Item "-mbranch-cost=num"
*************** is being compiled for.
*** 19546,19559 ****
  Assume (do not assume) that zero displacement conditional branch instructions
  \&\f(CW\*(C`bt\*(C'\fR and \f(CW\*(C`bf\*(C'\fR are fast.  If \fB\-mzdcbranch\fR is specified, the
  compiler prefers zero displacement branch code sequences.  This is
! enabled by default when generating code for \s-1SH4\s0 and \s-1SH4A\s0.  It can be explicitly
  disabled by specifying \fB\-mno\-zdcbranch\fR.
  .IP "\fB\-mcbranch\-force\-delay\-slot\fR" 4
  .IX Item "-mcbranch-force-delay-slot"
  Force the usage of delay slots for conditional branches, which stuffs the delay
  slot with a \f(CW\*(C`nop\*(C'\fR if a suitable instruction can't be found.  By default
  this option is disabled.  It can be enabled to work around hardware bugs as
! found in the original \s-1SH7055\s0.
  .IP "\fB\-mfused\-madd\fR" 4
  .IX Item "-mfused-madd"
  .PD 0
--- 19561,19574 ----
  Assume (do not assume) that zero displacement conditional branch instructions
  \&\f(CW\*(C`bt\*(C'\fR and \f(CW\*(C`bf\*(C'\fR are fast.  If \fB\-mzdcbranch\fR is specified, the
  compiler prefers zero displacement branch code sequences.  This is
! enabled by default when generating code for \s-1SH4\s0 and \s-1SH4A.\s0  It can be explicitly
  disabled by specifying \fB\-mno\-zdcbranch\fR.
  .IP "\fB\-mcbranch\-force\-delay\-slot\fR" 4
  .IX Item "-mcbranch-force-delay-slot"
  Force the usage of delay slots for conditional branches, which stuffs the delay
  slot with a \f(CW\*(C`nop\*(C'\fR if a suitable instruction can't be found.  By default
  this option is disabled.  It can be enabled to work around hardware bugs as
! found in the original \s-1SH7055.\s0
  .IP "\fB\-mfused\-madd\fR" 4
  .IX Item "-mfused-madd"
  .PD 0
*************** mapped to \fB\-ffp\-contract=off\fR.
*** 19575,19581 ****
  Allow or disallow the compiler to emit the \f(CW\*(C`fsca\*(C'\fR instruction for sine
  and cosine approximations.  The option \fB\-mfsca\fR must be used in
  combination with \fB\-funsafe\-math\-optimizations\fR.  It is enabled by default
! when generating code for \s-1SH4A\s0.  Using \fB\-mno\-fsca\fR disables sine and cosine
  approximations even if \fB\-funsafe\-math\-optimizations\fR is in effect.
  .IP "\fB\-mfsrra\fR" 4
  .IX Item "-mfsrra"
--- 19590,19596 ----
  Allow or disallow the compiler to emit the \f(CW\*(C`fsca\*(C'\fR instruction for sine
  and cosine approximations.  The option \fB\-mfsca\fR must be used in
  combination with \fB\-funsafe\-math\-optimizations\fR.  It is enabled by default
! when generating code for \s-1SH4A.\s0  Using \fB\-mno\-fsca\fR disables sine and cosine
  approximations even if \fB\-funsafe\-math\-optimizations\fR is in effect.
  .IP "\fB\-mfsrra\fR" 4
  .IX Item "-mfsrra"
*************** Allow or disallow the compiler to emit t
*** 19587,19593 ****
  reciprocal square root approximations.  The option \fB\-mfsrra\fR must be used
  in combination with \fB\-funsafe\-math\-optimizations\fR and
  \&\fB\-ffinite\-math\-only\fR.  It is enabled by default when generating code for
! \&\s-1SH4A\s0.  Using \fB\-mno\-fsrra\fR disables reciprocal square root approximations
  even if \fB\-funsafe\-math\-optimizations\fR and \fB\-ffinite\-math\-only\fR are
  in effect.
  .IP "\fB\-mpretend\-cmove\fR" 4
--- 19602,19608 ----
  reciprocal square root approximations.  The option \fB\-mfsrra\fR must be used
  in combination with \fB\-funsafe\-math\-optimizations\fR and
  \&\fB\-ffinite\-math\-only\fR.  It is enabled by default when generating code for
! \&\s-1SH4A.\s0  Using \fB\-mno\-fsrra\fR disables reciprocal square root approximations
  even if \fB\-funsafe\-math\-optimizations\fR and \fB\-ffinite\-math\-only\fR are
  in effect.
  .IP "\fB\-mpretend\-cmove\fR" 4
*************** These \fB\-m\fR options are supported on
*** 19641,19647 ****
  .IX Item "-mapp-regs"
  .PD
  Specify \fB\-mapp\-regs\fR to generate output using the global registers
! 2 through 4, which the \s-1SPARC\s0 \s-1SVR4\s0 \s-1ABI\s0 reserves for applications.  Like the
  global register 1, each global register 2 through 4 is then treated as an
  allocable register that is clobbered by function calls.  This is the default.
  .Sp
--- 19656,19662 ----
  .IX Item "-mapp-regs"
  .PD
  Specify \fB\-mapp\-regs\fR to generate output using the global registers
! 2 through 4, which the \s-1SPARC SVR4 ABI\s0 reserves for applications.  Like the
  global register 1, each global register 2 through 4 is then treated as an
  allocable register that is clobbered by function calls.  This is the default.
  .Sp
*************** cross-compilation.  The embedded targets
*** 19687,19693 ****
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC\s0, with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-mhard\-quad\-float\fR" 4
  .IX Item "-mhard-quad-float"
--- 19702,19708 ----
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC,\s0 with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-mhard\-quad\-float\fR" 4
  .IX Item "-mhard-quad-float"
*************** instructions.
*** 19697,19703 ****
  .IX Item "-msoft-quad-float"
  Generate output containing library calls for quad-word (long double)
  floating-point instructions.  The functions called are those specified
! in the \s-1SPARC\s0 \s-1ABI\s0.  This is the default.
  .Sp
  As of this writing, there are no \s-1SPARC\s0 implementations that have hardware
  support for the quad-word floating-point instructions.  They all invoke
--- 19712,19718 ----
  .IX Item "-msoft-quad-float"
  Generate output containing library calls for quad-word (long double)
  floating-point instructions.  The functions called are those specified
! in the \s-1SPARC ABI.\s0  This is the default.
  .Sp
  As of this writing, there are no \s-1SPARC\s0 implementations that have hardware
  support for the quad-word floating-point instructions.  They all invoke
*************** With \fB\-mfaster\-structs\fR, the compi
*** 19738,19747 ****
  should have 8\-byte alignment.  This enables the use of pairs of
  \&\f(CW\*(C`ldd\*(C'\fR and \f(CW\*(C`std\*(C'\fR instructions for copies in structure
  assignment, in place of twice as many \f(CW\*(C`ld\*(C'\fR and \f(CW\*(C`st\*(C'\fR pairs.
! However, the use of this changed alignment directly violates the \s-1SPARC\s0
! \&\s-1ABI\s0.  Thus, it's intended only for use on targets where the developer
  acknowledges that their resulting code is not directly in line with
! the rules of the \s-1ABI\s0.
  .IP "\fB\-mcpu=\fR\fIcpu_type\fR" 4
  .IX Item "-mcpu=cpu_type"
  Set the instruction set, register set, and instruction scheduling parameters
--- 19753,19762 ----
  should have 8\-byte alignment.  This enables the use of pairs of
  \&\f(CW\*(C`ldd\*(C'\fR and \f(CW\*(C`std\*(C'\fR instructions for copies in structure
  assignment, in place of twice as many \f(CW\*(C`ld\*(C'\fR and \f(CW\*(C`st\*(C'\fR pairs.
! However, the use of this changed alignment directly violates the \s-1SPARC
! ABI.\s0  Thus, it's intended only for use on targets where the developer
  acknowledges that their resulting code is not directly in line with
! the rules of the \s-1ABI.\s0
  .IP "\fB\-mcpu=\fR\fIcpu_type\fR" 4
  .IX Item "-mcpu=cpu_type"
  Set the instruction set, register set, and instruction scheduling parameters
*************** SPARCStation 1, 2, \s-1IPX\s0 etc.
*** 19791,19812 ****
  With \fB\-mcpu=v8\fR, \s-1GCC\s0 generates code for the V8 variant of the \s-1SPARC\s0
  architecture.  The only difference from V7 code is that the compiler emits
  the integer multiply and integer divide instructions which exist in \s-1SPARC\-V8\s0
! but not in \s-1SPARC\-V7\s0.  With \fB\-mcpu=supersparc\fR, the compiler additionally
  optimizes it for the SuperSPARC chip, as used in the SPARCStation 10, 1000 and
  2000 series.
  .Sp
  With \fB\-mcpu=sparclite\fR, \s-1GCC\s0 generates code for the SPARClite variant of
  the \s-1SPARC\s0 architecture.  This adds the integer multiply, integer divide step
! and scan (\f(CW\*(C`ffs\*(C'\fR) instructions which exist in SPARClite but not in \s-1SPARC\-V7\s0.
  With \fB\-mcpu=f930\fR, the compiler additionally optimizes it for the
! Fujitsu \s-1MB86930\s0 chip, which is the original SPARClite, with no \s-1FPU\s0.  With
  \&\fB\-mcpu=f934\fR, the compiler additionally optimizes it for the Fujitsu
! \&\s-1MB86934\s0 chip, which is the more recent SPARClite with \s-1FPU\s0.
  .Sp
  With \fB\-mcpu=sparclet\fR, \s-1GCC\s0 generates code for the SPARClet variant of
  the \s-1SPARC\s0 architecture.  This adds the integer multiply, multiply/accumulate,
  integer divide step and scan (\f(CW\*(C`ffs\*(C'\fR) instructions which exist in SPARClet
! but not in \s-1SPARC\-V7\s0.  With \fB\-mcpu=tsc701\fR, the compiler additionally
  optimizes it for the \s-1TEMIC\s0 SPARClet chip.
  .Sp
  With \fB\-mcpu=v9\fR, \s-1GCC\s0 generates code for the V9 variant of the \s-1SPARC\s0
--- 19806,19827 ----
  With \fB\-mcpu=v8\fR, \s-1GCC\s0 generates code for the V8 variant of the \s-1SPARC\s0
  architecture.  The only difference from V7 code is that the compiler emits
  the integer multiply and integer divide instructions which exist in \s-1SPARC\-V8\s0
! but not in \s-1SPARC\-V7.\s0  With \fB\-mcpu=supersparc\fR, the compiler additionally
  optimizes it for the SuperSPARC chip, as used in the SPARCStation 10, 1000 and
  2000 series.
  .Sp
  With \fB\-mcpu=sparclite\fR, \s-1GCC\s0 generates code for the SPARClite variant of
  the \s-1SPARC\s0 architecture.  This adds the integer multiply, integer divide step
! and scan (\f(CW\*(C`ffs\*(C'\fR) instructions which exist in SPARClite but not in \s-1SPARC\-V7.\s0
  With \fB\-mcpu=f930\fR, the compiler additionally optimizes it for the
! Fujitsu \s-1MB86930\s0 chip, which is the original SPARClite, with no \s-1FPU.\s0  With
  \&\fB\-mcpu=f934\fR, the compiler additionally optimizes it for the Fujitsu
! \&\s-1MB86934\s0 chip, which is the more recent SPARClite with \s-1FPU.\s0
  .Sp
  With \fB\-mcpu=sparclet\fR, \s-1GCC\s0 generates code for the SPARClet variant of
  the \s-1SPARC\s0 architecture.  This adds the integer multiply, multiply/accumulate,
  integer divide step and scan (\f(CW\*(C`ffs\*(C'\fR) instructions which exist in SPARClet
! but not in \s-1SPARC\-V7.\s0  With \fB\-mcpu=tsc701\fR, the compiler additionally
  optimizes it for the \s-1TEMIC\s0 SPARClet chip.
  .Sp
  With \fB\-mcpu=v9\fR, \s-1GCC\s0 generates code for the V9 variant of the \s-1SPARC\s0
*************** toolchains, \fBnative\fR can also be use
*** 19843,19849 ****
  .IP "\fB\-mno\-v8plus\fR" 4
  .IX Item "-mno-v8plus"
  .PD
! With \fB\-mv8plus\fR, \s-1GCC\s0 generates code for the \s-1SPARC\-V8+\s0 \s-1ABI\s0.  The
  difference from the V8 \s-1ABI\s0 is that the global and out registers are
  considered 64 bits wide.  This is enabled by default on Solaris in 32\-bit
  mode for all \s-1SPARC\-V9\s0 processors.
--- 19858,19864 ----
  .IP "\fB\-mno\-v8plus\fR" 4
  .IX Item "-mno-v8plus"
  .PD
! With \fB\-mv8plus\fR, \s-1GCC\s0 generates code for the \s-1SPARC\-V8+ ABI.\s0  The
  difference from the V8 \s-1ABI\s0 is that the global and out registers are
  considered 64 bits wide.  This is enabled by default on Solaris in 32\-bit
  mode for all \s-1SPARC\-V9\s0 processors.
*************** This option suppresses generation of the
*** 20298,20306 ****
  v850e, v850e1, v850e2, v850e2v3 and v850e3v5 flavors of the v850
  architecture.
  .Sp
! This option is enabled by default when the \s-1RH850\s0 \s-1ABI\s0 is
  in use (see \fB\-mrh850\-abi\fR), and disabled by default when the
! \&\s-1GCC\s0 \s-1ABI\s0 is in use.  If \f(CW\*(C`CALLT\*(C'\fR instructions are being generated
  then the C preprocessor symbol \f(CW\*(C`_\|_V850_CALLT_\|_\*(C'\fR is defined.
  .IP "\fB\-mrelax\fR" 4
  .IX Item "-mrelax"
--- 20313,20321 ----
  v850e, v850e1, v850e2, v850e2v3 and v850e3v5 flavors of the v850
  architecture.
  .Sp
! This option is enabled by default when the \s-1RH850 ABI\s0 is
  in use (see \fB\-mrh850\-abi\fR), and disabled by default when the
! \&\s-1GCC ABI\s0 is in use.  If \f(CW\*(C`CALLT\*(C'\fR instructions are being generated
  then the C preprocessor symbol \f(CW\*(C`_\|_V850_CALLT_\|_\*(C'\fR is defined.
  .IP "\fB\-mrelax\fR" 4
  .IX Item "-mrelax"
*************** selected because its use is still experi
*** 20340,20346 ****
  .IP "\fB\-mghs\fR" 4
  .IX Item "-mghs"
  .PD
! Enables support for the \s-1RH850\s0 version of the V850 \s-1ABI\s0.  This is the
  default.  With this version of the \s-1ABI\s0 the following rules apply:
  .RS 4
  .IP "*" 4
--- 20355,20361 ----
  .IP "\fB\-mghs\fR" 4
  .IX Item "-mghs"
  .PD
! Enables support for the \s-1RH850\s0 version of the V850 \s-1ABI.\s0  This is the
  default.  With this version of the \s-1ABI\s0 the following rules apply:
  .RS 4
  .IP "*" 4
*************** When this version of the \s-1ABI\s0 is e
*** 20365,20371 ****
  .RE
  .IP "\fB\-mgcc\-abi\fR" 4
  .IX Item "-mgcc-abi"
! Enables support for the old \s-1GCC\s0 version of the V850 \s-1ABI\s0.  With this
  version of the \s-1ABI\s0 the following rules apply:
  .RS 4
  .IP "*" 4
--- 20380,20386 ----
  .RE
  .IP "\fB\-mgcc\-abi\fR" 4
  .IX Item "-mgcc-abi"
! Enables support for the old \s-1GCC\s0 version of the V850 \s-1ABI.\s0  With this
  version of the \s-1ABI\s0 the following rules apply:
  .RS 4
  .IP "*" 4
*************** Generate code containing library calls f
*** 20460,20466 ****
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC\s0, with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-mcpu=\fR\fIcpu_type\fR" 4
  .IX Item "-mcpu=cpu_type"
--- 20475,20481 ----
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC,\s0 with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-mcpu=\fR\fIcpu_type\fR" 4
  .IX Item "-mcpu=cpu_type"
*************** the access to general registers.  This i
*** 20488,20495 ****
  .IP "\fB\-muser\-mode\fR" 4
  .IX Item "-muser-mode"
  Generate code for the user mode, where the access to some general registers
! is forbidden: on the \s-1GR5\s0, registers r24 to r31 cannot be accessed in this
! mode; on the \s-1GR6\s0, only registers r29 to r31 are affected.
  .PP
  \fI\s-1VMS\s0 Options\fR
  .IX Subsection "VMS Options"
--- 20503,20510 ----
  .IP "\fB\-muser\-mode\fR" 4
  .IX Item "-muser-mode"
  Generate code for the user mode, where the access to some general registers
! is forbidden: on the \s-1GR5,\s0 registers r24 to r31 cannot be accessed in this
! mode; on the \s-1GR6,\s0 only registers r29 to r31 are affected.
  .PP
  \fI\s-1VMS\s0 Options\fR
  .IX Subsection "VMS Options"
*************** produces code optimized for the local ma
*** 20572,20581 ****
  of the selected instruction set.
  .IP "\fBi386\fR" 4
  .IX Item "i386"
! Original Intel i386 \s-1CPU\s0.
  .IP "\fBi486\fR" 4
  .IX Item "i486"
! Intel i486 \s-1CPU\s0.  (No scheduling is implemented for this chip.)
  .IP "\fBi586\fR" 4
  .IX Item "i586"
  .PD 0
--- 20587,20596 ----
  of the selected instruction set.
  .IP "\fBi386\fR" 4
  .IX Item "i386"
! Original Intel i386 \s-1CPU.\s0
  .IP "\fBi486\fR" 4
  .IX Item "i486"
! Intel i486 \s-1CPU.\s0  (No scheduling is implemented for this chip.)
  .IP "\fBi586\fR" 4
  .IX Item "i586"
  .PD 0
*************** Intel i486 \s-1CPU\s0.  (No scheduling i
*** 20585,20594 ****
  Intel Pentium \s-1CPU\s0 with no \s-1MMX\s0 support.
  .IP "\fBpentium-mmx\fR" 4
  .IX Item "pentium-mmx"
! Intel Pentium \s-1MMX\s0 \s-1CPU\s0, based on Pentium core with \s-1MMX\s0 instruction set support.
  .IP "\fBpentiumpro\fR" 4
  .IX Item "pentiumpro"
! Intel Pentium Pro \s-1CPU\s0.
  .IP "\fBi686\fR" 4
  .IX Item "i686"
  When used with \fB\-march\fR, the Pentium Pro
--- 20600,20609 ----
  Intel Pentium \s-1CPU\s0 with no \s-1MMX\s0 support.
  .IP "\fBpentium-mmx\fR" 4
  .IX Item "pentium-mmx"
! Intel Pentium \s-1MMX CPU,\s0 based on Pentium core with \s-1MMX\s0 instruction set support.
  .IP "\fBpentiumpro\fR" 4
  .IX Item "pentiumpro"
! Intel Pentium Pro \s-1CPU.\s0
  .IP "\fBi686\fR" 4
  .IX Item "i686"
  When used with \fB\-march\fR, the Pentium Pro
*************** instruction set is used, so the code run
*** 20596,20602 ****
  When used with \fB\-mtune\fR, it has the same meaning as \fBgeneric\fR.
  .IP "\fBpentium2\fR" 4
  .IX Item "pentium2"
! Intel Pentium \s-1II\s0 \s-1CPU\s0, based on Pentium Pro core with \s-1MMX\s0 instruction set
  support.
  .IP "\fBpentium3\fR" 4
  .IX Item "pentium3"
--- 20611,20617 ----
  When used with \fB\-mtune\fR, it has the same meaning as \fBgeneric\fR.
  .IP "\fBpentium2\fR" 4
  .IX Item "pentium2"
! Intel Pentium \s-1II CPU,\s0 based on Pentium Pro core with \s-1MMX\s0 instruction set
  support.
  .IP "\fBpentium3\fR" 4
  .IX Item "pentium3"
*************** support.
*** 20604,20692 ****
  .IP "\fBpentium3m\fR" 4
  .IX Item "pentium3m"
  .PD
! Intel Pentium \s-1III\s0 \s-1CPU\s0, based on Pentium Pro core with \s-1MMX\s0 and \s-1SSE\s0 instruction
  set support.
  .IP "\fBpentium-m\fR" 4
  .IX Item "pentium-m"
! Intel Pentium M; low-power version of Intel Pentium \s-1III\s0 \s-1CPU\s0
! with \s-1MMX\s0, \s-1SSE\s0 and \s-1SSE2\s0 instruction set support.  Used by Centrino notebooks.
  .IP "\fBpentium4\fR" 4
  .IX Item "pentium4"
  .PD 0
  .IP "\fBpentium4m\fR" 4
  .IX Item "pentium4m"
  .PD
! Intel Pentium 4 \s-1CPU\s0 with \s-1MMX\s0, \s-1SSE\s0 and \s-1SSE2\s0 instruction set support.
  .IP "\fBprescott\fR" 4
  .IX Item "prescott"
! Improved version of Intel Pentium 4 \s-1CPU\s0 with \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0 and \s-1SSE3\s0 instruction
  set support.
  .IP "\fBnocona\fR" 4
  .IX Item "nocona"
! Improved version of Intel Pentium 4 \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0,
! \&\s-1SSE2\s0 and \s-1SSE3\s0 instruction set support.
  .IP "\fBcore2\fR" 4
  .IX Item "core2"
! Intel Core 2 \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0 and \s-1SSSE3\s0
  instruction set support.
  .IP "\fBnehalem\fR" 4
  .IX Item "nehalem"
! Intel Nehalem \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2 and \s-1POPCNT\s0 instruction set support.
  .IP "\fBwestmere\fR" 4
  .IX Item "westmere"
! Intel Westmere \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AES\s0 and \s-1PCLMUL\s0 instruction set support.
  .IP "\fBsandybridge\fR" 4
  .IX Item "sandybridge"
! Intel Sandy Bridge \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AES\s0 and \s-1PCLMUL\s0 instruction set support.
  .IP "\fBivybridge\fR" 4
  .IX Item "ivybridge"
! Intel Ivy Bridge \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0 and F16C
  instruction set support.
  .IP "\fBhaswell\fR" 4
  .IX Item "haswell"
! Intel Haswell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AVX2\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0, \s-1FMA\s0,
! \&\s-1BMI\s0, \s-1BMI2\s0 and F16C instruction set support.
  .IP "\fBbroadwell\fR" 4
  .IX Item "broadwell"
! Intel Broadwell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AVX2\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0, \s-1FMA\s0,
! \&\s-1BMI\s0, \s-1BMI2\s0, F16C, \s-1RDSEED\s0, \s-1ADCX\s0 and \s-1PREFETCHW\s0 instruction set support.
  .IP "\fBbonnell\fR" 4
  .IX Item "bonnell"
! Intel Bonnell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0 and \s-1SSSE3\s0
  instruction set support.
  .IP "\fBsilvermont\fR" 4
  .IX Item "silvermont"
! Intel Silvermont \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AES\s0, \s-1PCLMUL\s0 and \s-1RDRND\s0 instruction set support.
  .IP "\fBknl\fR" 4
  .IX Item "knl"
! Intel Knight's Landing \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0,
! \&\s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AVX2\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0, \s-1FMA\s0,
! \&\s-1BMI\s0, \s-1BMI2\s0, F16C, \s-1RDSEED\s0, \s-1ADCX\s0, \s-1PREFETCHW\s0, \s-1AVX512F\s0, \s-1AVX512PF\s0, \s-1AVX512ER\s0 and
  \&\s-1AVX512CD\s0 instruction set support.
  .IP "\fBk6\fR" 4
  .IX Item "k6"
! \&\s-1AMD\s0 K6 \s-1CPU\s0 with \s-1MMX\s0 instruction set support.
  .IP "\fBk6\-2\fR" 4
  .IX Item "k6-2"
  .PD 0
  .IP "\fBk6\-3\fR" 4
  .IX Item "k6-3"
  .PD
! Improved versions of \s-1AMD\s0 K6 \s-1CPU\s0 with \s-1MMX\s0 and 3DNow! instruction set support.
  .IP "\fBathlon\fR" 4
  .IX Item "athlon"
  .PD 0
  .IP "\fBathlon-tbird\fR" 4
  .IX Item "athlon-tbird"
  .PD
! \&\s-1AMD\s0 Athlon \s-1CPU\s0 with \s-1MMX\s0, 3dNOW!, enhanced 3DNow! and \s-1SSE\s0 prefetch instructions
  support.
  .IP "\fBathlon\-4\fR" 4
  .IX Item "athlon-4"
--- 20619,20707 ----
  .IP "\fBpentium3m\fR" 4
  .IX Item "pentium3m"
  .PD
! Intel Pentium \s-1III CPU,\s0 based on Pentium Pro core with \s-1MMX\s0 and \s-1SSE\s0 instruction
  set support.
  .IP "\fBpentium-m\fR" 4
  .IX Item "pentium-m"
! Intel Pentium M; low-power version of Intel Pentium \s-1III CPU\s0
! with \s-1MMX, SSE\s0 and \s-1SSE2\s0 instruction set support.  Used by Centrino notebooks.
  .IP "\fBpentium4\fR" 4
  .IX Item "pentium4"
  .PD 0
  .IP "\fBpentium4m\fR" 4
  .IX Item "pentium4m"
  .PD
! Intel Pentium 4 \s-1CPU\s0 with \s-1MMX, SSE\s0 and \s-1SSE2\s0 instruction set support.
  .IP "\fBprescott\fR" 4
  .IX Item "prescott"
! Improved version of Intel Pentium 4 \s-1CPU\s0 with \s-1MMX, SSE, SSE2\s0 and \s-1SSE3\s0 instruction
  set support.
  .IP "\fBnocona\fR" 4
  .IX Item "nocona"
! Improved version of Intel Pentium 4 \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE,
! SSE2\s0 and \s-1SSE3\s0 instruction set support.
  .IP "\fBcore2\fR" 4
  .IX Item "core2"
! Intel Core 2 \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3\s0 and \s-1SSSE3\s0
  instruction set support.
  .IP "\fBnehalem\fR" 4
  .IX Item "nehalem"
! Intel Nehalem \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2\s0 and \s-1POPCNT\s0 instruction set support.
  .IP "\fBwestmere\fR" 4
  .IX Item "westmere"
! Intel Westmere \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AES\s0 and \s-1PCLMUL\s0 instruction set support.
  .IP "\fBsandybridge\fR" 4
  .IX Item "sandybridge"
! Intel Sandy Bridge \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AVX, AES\s0 and \s-1PCLMUL\s0 instruction set support.
  .IP "\fBivybridge\fR" 4
  .IX Item "ivybridge"
! Intel Ivy Bridge \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AVX, AES, PCLMUL, FSGSBASE, RDRND\s0 and F16C
  instruction set support.
  .IP "\fBhaswell\fR" 4
  .IX Item "haswell"
! Intel Haswell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES, PCLMUL, FSGSBASE, RDRND, FMA,
! BMI, BMI2\s0 and F16C instruction set support.
  .IP "\fBbroadwell\fR" 4
  .IX Item "broadwell"
! Intel Broadwell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES, PCLMUL, FSGSBASE, RDRND, FMA,
! BMI, BMI2, F16C, RDSEED, ADCX\s0 and \s-1PREFETCHW\s0 instruction set support.
  .IP "\fBbonnell\fR" 4
  .IX Item "bonnell"
! Intel Bonnell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3\s0 and \s-1SSSE3\s0
  instruction set support.
  .IP "\fBsilvermont\fR" 4
  .IX Item "silvermont"
! Intel Silvermont \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AES, PCLMUL\s0 and \s-1RDRND\s0 instruction set support.
  .IP "\fBknl\fR" 4
  .IX Item "knl"
! Intel Knight's Landing \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3,
! SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES, PCLMUL, FSGSBASE, RDRND, FMA,
! BMI, BMI2, F16C, RDSEED, ADCX, PREFETCHW, AVX512F, AVX512PF, AVX512ER\s0 and
  \&\s-1AVX512CD\s0 instruction set support.
  .IP "\fBk6\fR" 4
  .IX Item "k6"
! \&\s-1AMD K6 CPU\s0 with \s-1MMX\s0 instruction set support.
  .IP "\fBk6\-2\fR" 4
  .IX Item "k6-2"
  .PD 0
  .IP "\fBk6\-3\fR" 4
  .IX Item "k6-3"
  .PD
! Improved versions of \s-1AMD K6 CPU\s0 with \s-1MMX\s0 and 3DNow! instruction set support.
  .IP "\fBathlon\fR" 4
  .IX Item "athlon"
  .PD 0
  .IP "\fBathlon-tbird\fR" 4
  .IX Item "athlon-tbird"
  .PD
! \&\s-1AMD\s0 Athlon \s-1CPU\s0 with \s-1MMX,\s0 3dNOW!, enhanced 3DNow! and \s-1SSE\s0 prefetch instructions
  support.
  .IP "\fBathlon\-4\fR" 4
  .IX Item "athlon-4"
*************** support.
*** 20696,20702 ****
  .IP "\fBathlon-mp\fR" 4
  .IX Item "athlon-mp"
  .PD
! Improved \s-1AMD\s0 Athlon \s-1CPU\s0 with \s-1MMX\s0, 3DNow!, enhanced 3DNow! and full \s-1SSE\s0
  instruction set support.
  .IP "\fBk8\fR" 4
  .IX Item "k8"
--- 20711,20717 ----
  .IP "\fBathlon-mp\fR" 4
  .IX Item "athlon-mp"
  .PD
! Improved \s-1AMD\s0 Athlon \s-1CPU\s0 with \s-1MMX,\s0 3DNow!, enhanced 3DNow! and full \s-1SSE\s0
  instruction set support.
  .IP "\fBk8\fR" 4
  .IX Item "k8"
*************** instruction set support.
*** 20708,20716 ****
  .IP "\fBathlon-fx\fR" 4
  .IX Item "athlon-fx"
  .PD
! Processors based on the \s-1AMD\s0 K8 core with x86\-64 instruction set support,
  including the \s-1AMD\s0 Opteron, Athlon 64, and Athlon 64 \s-1FX\s0 processors.
! (This supersets \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, 3DNow!, enhanced 3DNow! and 64\-bit
  instruction set extensions.)
  .IP "\fBk8\-sse3\fR" 4
  .IX Item "k8-sse3"
--- 20723,20731 ----
  .IP "\fBathlon-fx\fR" 4
  .IX Item "athlon-fx"
  .PD
! Processors based on the \s-1AMD K8\s0 core with x86\-64 instruction set support,
  including the \s-1AMD\s0 Opteron, Athlon 64, and Athlon 64 \s-1FX\s0 processors.
! (This supersets \s-1MMX, SSE, SSE2,\s0 3DNow!, enhanced 3DNow! and 64\-bit
  instruction set extensions.)
  .IP "\fBk8\-sse3\fR" 4
  .IX Item "k8-sse3"
*************** instruction set extensions.)
*** 20720,20726 ****
  .IP "\fBathlon64\-sse3\fR" 4
  .IX Item "athlon64-sse3"
  .PD
! Improved versions of \s-1AMD\s0 K8 cores with \s-1SSE3\s0 instruction set support.
  .IP "\fBamdfam10\fR" 4
  .IX Item "amdfam10"
  .PD 0
--- 20735,20741 ----
  .IP "\fBathlon64\-sse3\fR" 4
  .IX Item "athlon64-sse3"
  .PD
! Improved versions of \s-1AMD K8\s0 cores with \s-1SSE3\s0 instruction set support.
  .IP "\fBamdfam10\fR" 4
  .IX Item "amdfam10"
  .PD 0
*************** Improved versions of \s-1AMD\s0 K8 cores
*** 20728,20783 ****
  .IX Item "barcelona"
  .PD
  CPUs based on \s-1AMD\s0 Family 10h cores with x86\-64 instruction set support.  (This
! supersets \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0, 3DNow!, enhanced 3DNow!, \s-1ABM\s0 and 64\-bit
  instruction set extensions.)
  .IP "\fBbdver1\fR" 4
  .IX Item "bdver1"
  CPUs based on \s-1AMD\s0 Family 15h cores with x86\-64 instruction set support.  (This
! supersets \s-1FMA4\s0, \s-1AVX\s0, \s-1XOP\s0, \s-1LWP\s0, \s-1AES\s0, \s-1PCL_MUL\s0, \s-1CX16\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0,
! \&\s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1ABM\s0 and 64\-bit instruction set extensions.)
  .IP "\fBbdver2\fR" 4
  .IX Item "bdver2"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI\s0, \s-1TBM\s0, F16C, \s-1FMA\s0, \s-1FMA4\s0, \s-1AVX\s0, \s-1XOP\s0, \s-1LWP\s0, \s-1AES\s0, \s-1PCL_MUL\s0, \s-1CX16\s0, \s-1MMX\s0,
! \&\s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0, \s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1ABM\s0 and 64\-bit instruction set 
  extensions.)
  .IP "\fBbdver3\fR" 4
  .IX Item "bdver3"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI\s0, \s-1TBM\s0, F16C, \s-1FMA\s0, \s-1FMA4\s0, \s-1FSGSBASE\s0, \s-1AVX\s0, \s-1XOP\s0, \s-1LWP\s0, \s-1AES\s0, 
! \&\s-1PCL_MUL\s0, \s-1CX16\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0, \s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1ABM\s0 and 
  64\-bit instruction set extensions.
  .IP "\fBbdver4\fR" 4
  .IX Item "bdver4"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI\s0, \s-1BMI2\s0, \s-1TBM\s0, F16C, \s-1FMA\s0, \s-1FMA4\s0, \s-1FSGSBASE\s0, \s-1AVX\s0, \s-1AVX2\s0, \s-1XOP\s0, \s-1LWP\s0, 
! \&\s-1AES\s0, \s-1PCL_MUL\s0, \s-1CX16\s0, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0, \s-1SSSE3\s0, \s-1SSE4\s0.1, 
! \&\s-1SSE4\s0.2, \s-1ABM\s0 and 64\-bit instruction set extensions.
  .IP "\fBbtver1\fR" 4
  .IX Item "btver1"
  CPUs based on \s-1AMD\s0 Family 14h cores with x86\-64 instruction set support.  (This
! supersets \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0, \s-1SSE4A\s0, \s-1CX16\s0, \s-1ABM\s0 and 64\-bit
  instruction set extensions.)
  .IP "\fBbtver2\fR" 4
  .IX Item "btver2"
  CPUs based on \s-1AMD\s0 Family 16h cores with x86\-64 instruction set support. This
! includes \s-1MOVBE\s0, F16C, \s-1BMI\s0, \s-1AVX\s0, \s-1PCL_MUL\s0, \s-1AES\s0, \s-1SSE4\s0.2, \s-1SSE4\s0.1, \s-1CX16\s0, \s-1ABM\s0,
! \&\s-1SSE4A\s0, \s-1SSSE3\s0, \s-1SSE3\s0, \s-1SSE2\s0, \s-1SSE\s0, \s-1MMX\s0 and 64\-bit instruction set extensions.
  .IP "\fBwinchip\-c6\fR" 4
  .IX Item "winchip-c6"
! \&\s-1IDT\s0 WinChip C6 \s-1CPU\s0, dealt in same way as i486 with additional \s-1MMX\s0 instruction
  set support.
  .IP "\fBwinchip2\fR" 4
  .IX Item "winchip2"
! \&\s-1IDT\s0 WinChip 2 \s-1CPU\s0, dealt in same way as i486 with additional \s-1MMX\s0 and 3DNow!
  instruction set support.
  .IP "\fBc3\fR" 4
  .IX Item "c3"
! \&\s-1VIA\s0 C3 \s-1CPU\s0 with \s-1MMX\s0 and 3DNow! instruction set support.  (No scheduling is
  implemented for this chip.)
  .IP "\fBc3\-2\fR" 4
  .IX Item "c3-2"
! \&\s-1VIA\s0 C3\-2 (Nehemiah/C5XL) \s-1CPU\s0 with \s-1MMX\s0 and \s-1SSE\s0 instruction set support.
  (No scheduling is
  implemented for this chip.)
  .IP "\fBgeode\fR" 4
--- 20743,20798 ----
  .IX Item "barcelona"
  .PD
  CPUs based on \s-1AMD\s0 Family 10h cores with x86\-64 instruction set support.  (This
! supersets \s-1MMX, SSE, SSE2, SSE3, SSE4A,\s0 3DNow!, enhanced 3DNow!, \s-1ABM\s0 and 64\-bit
  instruction set extensions.)
  .IP "\fBbdver1\fR" 4
  .IX Item "bdver1"
  CPUs based on \s-1AMD\s0 Family 15h cores with x86\-64 instruction set support.  (This
! supersets \s-1FMA4, AVX, XOP, LWP, AES, PCL_MUL, CX16, MMX, SSE, SSE2, SSE3, SSE4A,
! SSSE3, SSE4.1, SSE4.2, ABM\s0 and 64\-bit instruction set extensions.)
  .IP "\fBbdver2\fR" 4
  .IX Item "bdver2"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI, TBM, F16C, FMA, FMA4, AVX, XOP, LWP, AES, PCL_MUL, CX16, MMX,
! SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1, SSE4.2, ABM\s0 and 64\-bit instruction set 
  extensions.)
  .IP "\fBbdver3\fR" 4
  .IX Item "bdver3"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI, TBM, F16C, FMA, FMA4, FSGSBASE, AVX, XOP, LWP, AES,\s0 
! \&\s-1PCL_MUL, CX16, MMX, SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1, SSE4.2, ABM\s0 and 
  64\-bit instruction set extensions.
  .IP "\fBbdver4\fR" 4
  .IX Item "bdver4"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI, BMI2, TBM, F16C, FMA, FMA4, FSGSBASE, AVX, AVX2, XOP, LWP,\s0 
! \&\s-1AES, PCL_MUL, CX16, MOVBE, MMX, SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1,\s0 
! \&\s-1SSE4.2, ABM\s0 and 64\-bit instruction set extensions.
  .IP "\fBbtver1\fR" 4
  .IX Item "btver1"
  CPUs based on \s-1AMD\s0 Family 14h cores with x86\-64 instruction set support.  (This
! supersets \s-1MMX, SSE, SSE2, SSE3, SSSE3, SSE4A, CX16, ABM\s0 and 64\-bit
  instruction set extensions.)
  .IP "\fBbtver2\fR" 4
  .IX Item "btver2"
  CPUs based on \s-1AMD\s0 Family 16h cores with x86\-64 instruction set support. This
! includes \s-1MOVBE, F16C, BMI, AVX, PCL_MUL, AES, SSE4.2, SSE4.1, CX16, ABM,
! SSE4A, SSSE3, SSE3, SSE2, SSE, MMX\s0 and 64\-bit instruction set extensions.
  .IP "\fBwinchip\-c6\fR" 4
  .IX Item "winchip-c6"
! \&\s-1IDT\s0 WinChip C6 \s-1CPU,\s0 dealt in same way as i486 with additional \s-1MMX\s0 instruction
  set support.
  .IP "\fBwinchip2\fR" 4
  .IX Item "winchip2"
! \&\s-1IDT\s0 WinChip 2 \s-1CPU,\s0 dealt in same way as i486 with additional \s-1MMX\s0 and 3DNow!
  instruction set support.
  .IP "\fBc3\fR" 4
  .IX Item "c3"
! \&\s-1VIA C3 CPU\s0 with \s-1MMX\s0 and 3DNow! instruction set support.  (No scheduling is
  implemented for this chip.)
  .IP "\fBc3\-2\fR" 4
  .IX Item "c3-2"
! \&\s-1VIA C3\-2\s0 (Nehemiah/C5XL) \s-1CPU\s0 with \s-1MMX\s0 and \s-1SSE\s0 instruction set support.
  (No scheduling is
  implemented for this chip.)
  .IP "\fBgeode\fR" 4
*************** of your application will have, then you
*** 20811,20817 ****
  .Sp
  As new processors are deployed in the marketplace, the behavior of this
  option will change.  Therefore, if you upgrade to a newer version of
! \&\s-1GCC\s0, code generation controlled by this option will change to reflect
  the processors
  that are most common at the time that version of \s-1GCC\s0 is released.
  .Sp
--- 20826,20832 ----
  .Sp
  As new processors are deployed in the marketplace, the behavior of this
  option will change.  Therefore, if you upgrade to a newer version of
! \&\s-1GCC,\s0 code generation controlled by this option will change to reflect
  the processors
  that are most common at the time that version of \s-1GCC\s0 is released.
  .Sp
*************** processors) for which the code is optimi
*** 20823,20829 ****
  .IP "\fBintel\fR" 4
  .IX Item "intel"
  Produce code optimized for the most current Intel processors, which are
! Haswell and Silvermont for this version of \s-1GCC\s0.  If you know the \s-1CPU\s0
  on which your code will run, then you should use the corresponding
  \&\fB\-mtune\fR or \fB\-march\fR option instead of \fB\-mtune=intel\fR.
  But, if you want your application performs better on both Haswell and
--- 20838,20844 ----
  .IP "\fBintel\fR" 4
  .IX Item "intel"
  Produce code optimized for the most current Intel processors, which are
! Haswell and Silvermont for this version of \s-1GCC.\s0  If you know the \s-1CPU\s0
  on which your code will run, then you should use the corresponding
  \&\fB\-mtune\fR or \fB\-march\fR option instead of \fB\-mtune=intel\fR.
  But, if you want your application performs better on both Haswell and
*************** Silvermont, then you should use this opt
*** 20831,20837 ****
  .Sp
  As new Intel processors are deployed in the marketplace, the behavior of
  this option will change.  Therefore, if you upgrade to a newer version of
! \&\s-1GCC\s0, code generation controlled by this option will change to reflect
  the most current Intel processors at the time that version of \s-1GCC\s0 is
  released.
  .Sp
--- 20846,20852 ----
  .Sp
  As new Intel processors are deployed in the marketplace, the behavior of
  this option will change.  Therefore, if you upgrade to a newer version of
! \&\s-1GCC,\s0 code generation controlled by this option will change to reflect
  the most current Intel processors at the time that version of \s-1GCC\s0 is
  released.
  .Sp
*************** comparison is unordered.
*** 20916,20922 ****
  .IX Item "-msoft-float"
  Generate output containing library calls for floating point.
  .Sp
! \&\fBWarning:\fR the requisite libraries are not part of \s-1GCC\s0.
  Normally the facilities of the machine's usual C compiler are used, but
  this can't be done directly in cross-compilation.  You must make your
  own arrangements to provide suitable library functions for
--- 20931,20937 ----
  .IX Item "-msoft-float"
  Generate output containing library calls for floating point.
  .Sp
! \&\fBWarning:\fR the requisite libraries are not part of \s-1GCC.\s0
  Normally the facilities of the machine's usual C compiler are used, but
  this can't be done directly in cross-compilation.  You must make your
  own arrangements to provide suitable library functions for
*************** Do not use the \s-1FPU\s0 registers for
*** 20931,20938 ****
  .Sp
  The usual calling convention has functions return values of types
  \&\f(CW\*(C`float\*(C'\fR and \f(CW\*(C`double\*(C'\fR in an \s-1FPU\s0 register, even if there
! is no \s-1FPU\s0.  The idea is that the operating system should emulate
! an \s-1FPU\s0.
  .Sp
  The option \fB\-mno\-fp\-ret\-in\-387\fR causes such values to be returned
  in ordinary \s-1CPU\s0 registers instead.
--- 20946,20953 ----
  .Sp
  The usual calling convention has functions return values of types
  \&\f(CW\*(C`float\*(C'\fR and \f(CW\*(C`double\*(C'\fR in an \s-1FPU\s0 register, even if there
! is no \s-1FPU.\s0  The idea is that the operating system should emulate
! an \s-1FPU.\s0
  .Sp
  The option \fB\-mno\-fp\-ret\-in\-387\fR causes such values to be returned
  in ordinary \s-1CPU\s0 registers instead.
*************** so \fB\-m96bit\-long\-double\fR is the d
*** 20977,20983 ****
  .Sp
  Modern architectures (Pentium and newer) prefer \f(CW\*(C`long double\*(C'\fR
  to be aligned to an 8\- or 16\-byte boundary.  In arrays or structures
! conforming to the \s-1ABI\s0, this is not possible.  So specifying
  \&\fB\-m128bit\-long\-double\fR aligns \f(CW\*(C`long double\*(C'\fR
  to a 16\-byte boundary by padding the \f(CW\*(C`long double\*(C'\fR with an additional
  32\-bit zero.
--- 20992,20998 ----
  .Sp
  Modern architectures (Pentium and newer) prefer \f(CW\*(C`long double\*(C'\fR
  to be aligned to an 8\- or 16\-byte boundary.  In arrays or structures
! conforming to the \s-1ABI,\s0 this is not possible.  So specifying
  \&\fB\-m128bit\-long\-double\fR aligns \f(CW\*(C`long double\*(C'\fR
  to a 16\-byte boundary by padding the \f(CW\*(C`long double\*(C'\fR with an additional
  32\-bit zero.
*************** its \s-1ABI\s0 specifies that \f(CW\*(C`
*** 20988,20994 ****
  Notice that neither of these options enable any extra precision over the x87
  standard of 80 bits for a \f(CW\*(C`long double\*(C'\fR.
  .Sp
! \&\fBWarning:\fR if you override the default value for your target \s-1ABI\s0, this
  changes the size of 
  structures and arrays containing \f(CW\*(C`long double\*(C'\fR variables,
  as well as modifying the function calling convention for functions taking
--- 21003,21009 ----
  Notice that neither of these options enable any extra precision over the x87
  standard of 80 bits for a \f(CW\*(C`long double\*(C'\fR.
  .Sp
! \&\fBWarning:\fR if you override the default value for your target \s-1ABI,\s0 this
  changes the size of 
  structures and arrays containing \f(CW\*(C`long double\*(C'\fR variables,
  as well as modifying the function calling convention for functions taking
*************** type. This is the default for 32\-bit Bi
*** 21008,21014 ****
  of 128 bits makes the \f(CW\*(C`long double\*(C'\fR type equivalent to the
  \&\f(CW\*(C`_\|_float128\*(C'\fR type. This is the default for 64\-bit Bionic C library.
  .Sp
! \&\fBWarning:\fR if you override the default value for your target \s-1ABI\s0, this
  changes the size of
  structures and arrays containing \f(CW\*(C`long double\*(C'\fR variables,
  as well as modifying the function calling convention for functions taking
--- 21023,21029 ----
  of 128 bits makes the \f(CW\*(C`long double\*(C'\fR type equivalent to the
  \&\f(CW\*(C`_\|_float128\*(C'\fR type. This is the default for 64\-bit Bionic C library.
  .Sp
! \&\fBWarning:\fR if you override the default value for your target \s-1ABI,\s0 this
  changes the size of
  structures and arrays containing \f(CW\*(C`long double\*(C'\fR variables,
  as well as modifying the function calling convention for functions taking
*************** with code compiled without that switch.
*** 21017,21023 ****
  .IP "\fB\-malign\-data=\fR\fItype\fR" 4
  .IX Item "-malign-data=type"
  Control how \s-1GCC\s0 aligns variables.  Supported values for \fItype\fR are
! \&\fBcompat\fR uses increased alignment value compatible uses \s-1GCC\s0 4.8
  and earlier, \fBabi\fR uses alignment value as specified by the
  psABI, and \fBcacheline\fR uses increased alignment value to match
  the cache line size.  \fBcompat\fR is the default.
--- 21032,21038 ----
  .IP "\fB\-malign\-data=\fR\fItype\fR" 4
  .IX Item "-malign-data=type"
  Control how \s-1GCC\s0 aligns variables.  Supported values for \fItype\fR are
! \&\fBcompat\fR uses increased alignment value compatible uses \s-1GCC 4.8\s0
  and earlier, \fBabi\fR uses alignment value as specified by the
  psABI, and \fBcacheline\fR uses increased alignment value to match
  the cache line size.  \fBcompat\fR is the default.
*************** Studio compilers until version 12.  Late
*** 21079,21085 ****
  with Studio 12 Update@tie{}1) follow the \s-1ABI\s0 used by other x86 targets, which
  is the default on Solaris@tie{}10 and later.  \fIOnly\fR use this option if
  you need to remain compatible with existing code produced by those
! previous compiler versions or older versions of \s-1GCC\s0.
  .IP "\fB\-mpc32\fR" 4
  .IX Item "-mpc32"
  .PD 0
--- 21094,21100 ----
  with Studio 12 Update@tie{}1) follow the \s-1ABI\s0 used by other x86 targets, which
  is the default on Solaris@tie{}10 and later.  \fIOnly\fR use this option if
  you need to remain compatible with existing code produced by those
! previous compiler versions or older versions of \s-1GCC.\s0
  .IP "\fB\-mpc32\fR" 4
  .IX Item "-mpc32"
  .PD 0
*************** the one specified by \fB\-mpreferred\-st
*** 21140,21146 ****
  .Sp
  On Pentium and Pentium Pro, \f(CW\*(C`double\*(C'\fR and \f(CW\*(C`long double\*(C'\fR values
  should be aligned to an 8\-byte boundary (see \fB\-malign\-double\fR) or
! suffer significant run time performance penalties.  On Pentium \s-1III\s0, the
  Streaming \s-1SIMD\s0 Extension (\s-1SSE\s0) data type \f(CW\*(C`_\|_m128\*(C'\fR may not work
  properly if it is not 16\-byte aligned.
  .Sp
--- 21155,21161 ----
  .Sp
  On Pentium and Pentium Pro, \f(CW\*(C`double\*(C'\fR and \f(CW\*(C`long double\*(C'\fR values
  should be aligned to an 8\-byte boundary (see \fB\-malign\-double\fR) or
! suffer significant run time performance penalties.  On Pentium \s-1III,\s0 the
  Streaming \s-1SIMD\s0 Extension (\s-1SSE\s0) data type \f(CW\*(C`_\|_m128\*(C'\fR may not work
  properly if it is not 16\-byte aligned.
  .Sp
*************** preferred alignment to \fB\-mpreferred\-
*** 21244,21253 ****
  .IP "\fB\-mmwaitx\fR" 4
  .IX Item "-mmwaitx"
  .PD
! These switches enable the use of instructions in the \s-1MMX\s0, \s-1SSE\s0,
! \&\s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1AVX\s0, \s-1AVX2\s0, \s-1AVX512F\s0, \s-1AVX512PF\s0, \s-1AVX512ER\s0, \s-1AVX512CD\s0,
! \&\s-1SHA\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0, F16C, \s-1FMA\s0, \s-1SSE4A\s0, \s-1FMA4\s0, \s-1XOP\s0, \s-1LWP\s0, \s-1ABM\s0,
! \&\s-1BMI\s0, \s-1BMI2\s0, \s-1FXSR\s0, \s-1XSAVE\s0, \s-1XSAVEOPT\s0, \s-1LZCNT\s0, \s-1RTM\s0, \s-1MPX\s0, \s-1MWAITX\s0 or 3DNow!
  extended instruction sets.  Each has a corresponding \fB\-mno\-\fR option
  to disable use of these instructions.
  .Sp
--- 21259,21268 ----
  .IP "\fB\-mmwaitx\fR" 4
  .IX Item "-mmwaitx"
  .PD
! These switches enable the use of instructions in the \s-1MMX, SSE,
! SSE2, SSE3, SSSE3, SSE4.1, AVX, AVX2, AVX512F, AVX512PF, AVX512ER, AVX512CD,
! SHA, AES, PCLMUL, FSGSBASE, RDRND, F16C, FMA, SSE4A, FMA4, XOP, LWP, ABM,
! BMI, BMI2, FXSR, XSAVE, XSAVEOPT, LZCNT, RTM, MPX, MWAITX\s0 or 3DNow!
  extended instruction sets.  Each has a corresponding \fB\-mno\-\fR option
  to disable use of these instructions.
  .Sp
*************** This option enables generation of \f(CW\
*** 21324,21330 ****
  Early Intel Pentium 4 CPUs with Intel 64 support,
  prior to the introduction of Pentium 4 G1 step in December 2005,
  lacked the \f(CW\*(C`LAHF\*(C'\fR and \f(CW\*(C`SAHF\*(C'\fR instructions
! which are supported by \s-1AMD64\s0.
  These are load and store instructions, respectively, for certain status flags.
  In 64\-bit mode, the \f(CW\*(C`SAHF\*(C'\fR instruction is used to optimize \f(CW\*(C`fmod\*(C'\fR,
  \&\f(CW\*(C`drem\*(C'\fR, and \f(CW\*(C`remainder\*(C'\fR built-in functions;
--- 21339,21345 ----
  Early Intel Pentium 4 CPUs with Intel 64 support,
  prior to the introduction of Pentium 4 G1 step in December 2005,
  lacked the \f(CW\*(C`LAHF\*(C'\fR and \f(CW\*(C`SAHF\*(C'\fR instructions
! which are supported by \s-1AMD64.\s0
  These are load and store instructions, respectively, for certain status flags.
  In 64\-bit mode, the \f(CW\*(C`SAHF\*(C'\fR instruction is used to optimize \f(CW\*(C`fmod\*(C'\fR,
  \&\f(CW\*(C`drem\*(C'\fR, and \f(CW\*(C`remainder\*(C'\fR built-in functions;
*************** when \fB\-mveclibabi=acml\fR is used.
*** 21423,21429 ****
  .IX Item "-mabi=name"
  Generate code for the specified calling convention.  Permissible values
  are \fBsysv\fR for the \s-1ABI\s0 used on GNU/Linux and other systems, and
! \&\fBms\fR for the Microsoft \s-1ABI\s0.  The default is to use the Microsoft
  \&\s-1ABI\s0 when targeting Microsoft Windows and the SysV \s-1ABI\s0 on all other systems.
  You can control this behavior for specific functions by
  using the function attributes \f(CW\*(C`ms_abi\*(C'\fR and \f(CW\*(C`sysv_abi\*(C'\fR.
--- 21438,21444 ----
  .IX Item "-mabi=name"
  Generate code for the specified calling convention.  Permissible values
  are \fBsysv\fR for the \s-1ABI\s0 used on GNU/Linux and other systems, and
! \&\fBms\fR for the Microsoft \s-1ABI.\s0  The default is to use the Microsoft
  \&\s-1ABI\s0 when targeting Microsoft Windows and the SysV \s-1ABI\s0 on all other systems.
  You can control this behavior for specific functions by
  using the function attributes \f(CW\*(C`ms_abi\*(C'\fR and \f(CW\*(C`sysv_abi\*(C'\fR.
*************** or whether the thread base pointer must
*** 21538,21544 ****
  is valid depends on the operating system, and whether it maps the
  segment to cover the entire \s-1TLS\s0 area.
  .Sp
! For systems that use the \s-1GNU\s0 C Library, the default is on.
  .IP "\fB\-msse2avx\fR" 4
  .IX Item "-msse2avx"
  .PD 0
--- 21553,21559 ----
  is valid depends on the operating system, and whether it maps the
  segment to cover the entire \s-1TLS\s0 area.
  .Sp
! For systems that use the \s-1GNU C\s0 Library, the default is on.
  .IP "\fB\-msse2avx\fR" 4
  .IX Item "-msse2avx"
  .PD 0
*************** register when there are no variable argu
*** 21589,21595 ****
  \&\fBWarning:\fR Since \s-1RAX\s0 register is used to avoid unnecessarily
  saving vector registers on stack when passing variable arguments, the
  impacts of this option are callees may waste some stack space,
! misbehave or jump to a random location.  \s-1GCC\s0 4.4 or newer don't have
  those issues, regardless the \s-1RAX\s0 register value.
  .IP "\fB\-m8bit\-idiv\fR" 4
  .IX Item "-m8bit-idiv"
--- 21604,21610 ----
  \&\fBWarning:\fR Since \s-1RAX\s0 register is used to avoid unnecessarily
  saving vector registers on stack when passing variable arguments, the
  impacts of this option are callees may waste some stack space,
! misbehave or jump to a random location.  \s-1GCC 4.4\s0 or newer don't have
  those issues, regardless the \s-1RAX\s0 register value.
  .IP "\fB\-m8bit\-idiv\fR" 4
  .IX Item "-m8bit-idiv"
*************** appropriately.
*** 21733,21739 ****
  This option is available for MinGW targets. It specifies that
  the executable flag for the stack used by nested functions isn't
  set. This is necessary for binaries running in kernel mode of
! Microsoft Windows, as there the User32 \s-1API\s0, which is used to set executable
  privileges, isn't available.
  .IP "\fB\-fwritable\-relocated\-rdata\fR" 4
  .IX Item "-fwritable-relocated-rdata"
--- 21748,21754 ----
  This option is available for MinGW targets. It specifies that
  the executable flag for the stack used by nested functions isn't
  set. This is necessary for binaries running in kernel mode of
! Microsoft Windows, as there the User32 \s-1API,\s0 which is used to set executable
  privileges, isn't available.
  .IP "\fB\-fwritable\-relocated\-rdata\fR" 4
  .IX Item "-fwritable-relocated-rdata"
*************** kernel code.
*** 21818,21824 ****
  These options control the treatment of literal pools.  The default is
  \&\fB\-mno\-text\-section\-literals\fR, which places literals in a separate
  section in the output file.  This allows the literal pool to be placed
! in a data \s-1RAM/ROM\s0, and it also allows the linker to combine literal
  pools from separate object files to remove redundant literals and
  improve code size.  With \fB\-mtext\-section\-literals\fR, the literals
  are interspersed in the text section in order to keep them as close as
--- 21833,21839 ----
  These options control the treatment of literal pools.  The default is
  \&\fB\-mno\-text\-section\-literals\fR, which places literals in a separate
  section in the output file.  This allows the literal pool to be placed
! in a data \s-1RAM/ROM,\s0 and it also allows the linker to combine literal
  pools from separate object files to remove redundant literals and
  improve code size.  With \fB\-mtext\-section\-literals\fR, the literals
  are interspersed in the text section in order to keep them as close as
*************** every cross-file call, not just those th
*** 21864,21870 ****
  .IX Subsection "zSeries Options"
  .PP
  These are listed under
! .Sh "Options for Code Generation Conventions"
  .IX Subsection "Options for Code Generation Conventions"
  These machine-independent options control the interface conventions
  used in code generation.
--- 21879,21885 ----
  .IX Subsection "zSeries Options"
  .PP
  These are listed under
! .SS "Options for Code Generation Conventions"
  .IX Subsection "Options for Code Generation Conventions"
  These machine-independent options control the interface conventions
  used in code generation.
*************** You normally do not need to enable this
*** 22003,22009 ****
  that needs this handling enables it on your behalf.
  .IP "\fB\-fasynchronous\-unwind\-tables\fR" 4
  .IX Item "-fasynchronous-unwind-tables"
! Generate unwind table in \s-1DWARF\s0 2 format, if supported by target machine.  The
  table is exact at each instruction boundary, so it can be used for stack
  unwinding from asynchronous events (such as debugger or garbage collector).
  .IP "\fB\-fno\-gnu\-unique\fR" 4
--- 22018,22024 ----
  that needs this handling enables it on your behalf.
  .IP "\fB\-fasynchronous\-unwind\-tables\fR" 4
  .IX Item "-fasynchronous-unwind-tables"
! Generate unwind table in \s-1DWARF 2\s0 format, if supported by target machine.  The
  table is exact at each instruction boundary, so it can be used for stack
  unwinding from asynchronous events (such as debugger or garbage collector).
  .IP "\fB\-fno\-gnu\-unique\fR" 4
*************** Use it to conform to a non-default appli
*** 22074,22080 ****
  .IX Item "-fshort-wchar"
  Override the underlying type for \f(CW\*(C`wchar_t\*(C'\fR to be \f(CW\*(C`short
  unsigned int\*(C'\fR instead of the default for the target.  This option is
! useful for building programs to run under \s-1WINE\s0.
  .Sp
  \&\fBWarning:\fR the \fB\-fshort\-wchar\fR switch causes \s-1GCC\s0 to generate
  code that is not binary compatible with code generated without that switch.
--- 22089,22095 ----
  .IX Item "-fshort-wchar"
  Override the underlying type for \f(CW\*(C`wchar_t\*(C'\fR to be \f(CW\*(C`short
  unsigned int\*(C'\fR instead of the default for the target.  This option is
! useful for building programs to run under \s-1WINE.\s0
  .Sp
  \&\fBWarning:\fR the \fB\-fshort\-wchar\fR switch causes \s-1GCC\s0 to generate
  code that is not binary compatible with code generated without that switch.
*************** such variables in different compilation
*** 22087,22093 ****
  in a common block.
  This is the behavior specified by \fB\-fcommon\fR, and is the default
  for \s-1GCC\s0 on most targets.
! On the other hand, this behavior is not required by \s-1ISO\s0 C, and on some
  targets may carry a speed or code size penalty on variable references.
  The \fB\-fno\-common\fR option specifies that the compiler should place
  uninitialized global variables in the data section of the object file,
--- 22102,22108 ----
  in a common block.
  This is the behavior specified by \fB\-fcommon\fR, and is the default
  for \s-1GCC\s0 on most targets.
! On the other hand, this behavior is not required by \s-1ISO C,\s0 and on some
  targets may carry a speed or code size penalty on variable references.
  The \fB\-fno\-common\fR option specifies that the compiler should place
  uninitialized global variables in the data section of the object file,
*************** the \s-1GOT\s0 size for the linked execu
*** 22143,22153 ****
  maximum size, you get an error message from the linker indicating that
  \&\fB\-fpic\fR does not work; in that case, recompile with \fB\-fPIC\fR
  instead.  (These maximums are 8k on the \s-1SPARC\s0 and 32k
! on the m68k and \s-1RS/6000\s0.  The x86 has no such limit.)
  .Sp
  Position-independent code requires special support, and therefore works
  only on certain machines.  For the x86, \s-1GCC\s0 supports \s-1PIC\s0 for System V
! but not for the Sun 386i.  Code generated for the \s-1IBM\s0 \s-1RS/6000\s0 is always
  position-independent.
  .Sp
  When this flag is set, the macros \f(CW\*(C`_\|_pic_\|_\*(C'\fR and \f(CW\*(C`_\|_PIC_\|_\*(C'\fR
--- 22158,22168 ----
  maximum size, you get an error message from the linker indicating that
  \&\fB\-fpic\fR does not work; in that case, recompile with \fB\-fPIC\fR
  instead.  (These maximums are 8k on the \s-1SPARC\s0 and 32k
! on the m68k and \s-1RS/6000.\s0  The x86 has no such limit.)
  .Sp
  Position-independent code requires special support, and therefore works
  only on certain machines.  For the x86, \s-1GCC\s0 supports \s-1PIC\s0 for System V
! but not for the Sun 386i.  Code generated for the \s-1IBM RS/6000\s0 is always
  position-independent.
  .Sp
  When this flag is set, the macros \f(CW\*(C`_\|_pic_\|_\*(C'\fR and \f(CW\*(C`_\|_PIC_\|_\*(C'\fR
*************** are defined to 1.
*** 22157,22163 ****
  If supported for the target machine, emit position-independent code,
  suitable for dynamic linking and avoiding any limit on the size of the
  global offset table.  This option makes a difference on the m68k,
! PowerPC and \s-1SPARC\s0.
  .Sp
  Position-independent code requires special support, and therefore works
  only on certain machines.
--- 22172,22178 ----
  If supported for the target machine, emit position-independent code,
  suitable for dynamic linking and avoiding any limit on the size of the
  global offset table.  This option makes a difference on the m68k,
! PowerPC and \s-1SPARC.\s0
  .Sp
  Position-independent code requires special support, and therefore works
  only on certain machines.
*************** name, such as \f(CW\*(C`vector<int> blah
*** 22307,22313 ****
  internal mangled name (e.g., \f(CW\*(C`_Z4blahRSt6vectorIiSaIiEE\*(C'\fR).  The
  match is done on substrings: if the \fIsym\fR parameter is a substring
  of the function name, it is considered to be a match.  For C99 and \*(C+
! extended identifiers, the function name must be given in \s-1UTF\-8\s0, not
  using universal character names.
  .IP "\fB\-fstack\-check\fR" 4
  .IX Item "-fstack-check"
--- 22322,22328 ----
  internal mangled name (e.g., \f(CW\*(C`_Z4blahRSt6vectorIiSaIiEE\*(C'\fR).  The
  match is done on substrings: if the \fIsym\fR parameter is a substring
  of the function name, it is considered to be a match.  For C99 and \*(C+
! extended identifiers, the function name must be given in \s-1UTF\-8,\s0 not
  using universal character names.
  .IP "\fB\-fstack\-check\fR" 4
  .IX Item "-fstack-check"
*************** always specify visibility when it is not
*** 22446,22452 ****
  only for use within the local \s-1DSO\s0 should \fBalways\fR be marked explicitly
  as hidden as so to avoid \s-1PLT\s0 indirection overheads\-\-\-making this
  abundantly clear also aids readability and self-documentation of the code.
! Note that due to \s-1ISO\s0 \*(C+ specification requirements, \f(CW\*(C`operator new\*(C'\fR and
  \&\f(CW\*(C`operator delete\*(C'\fR must always be of default visibility.
  .Sp
  Be aware that headers from outside your project, in particular system
--- 22461,22467 ----
  only for use within the local \s-1DSO\s0 should \fBalways\fR be marked explicitly
  as hidden as so to avoid \s-1PLT\s0 indirection overheads\-\-\-making this
  abundantly clear also aids readability and self-documentation of the code.
! Note that due to \s-1ISO \*(C+\s0 specification requirements, \f(CW\*(C`operator new\*(C'\fR and
  \&\f(CW\*(C`operator delete\*(C'\fR must always be of default visibility.
  .Sp
  Be aware that headers from outside your project, in particular system
*************** before including any such headers.
*** 22458,22464 ****
  \&\f(CW\*(C`extern\*(C'\fR declarations are not affected by \fB\-fvisibility\fR, so
  a lot of code can be recompiled with \fB\-fvisibility=hidden\fR with
  no modifications.  However, this means that calls to \f(CW\*(C`extern\*(C'\fR
! functions with no explicit visibility use the \s-1PLT\s0, so it is more
  effective to use \f(CW\*(C`_\|_attribute ((visibility))\*(C'\fR and/or
  \&\f(CW\*(C`#pragma GCC visibility\*(C'\fR to tell the compiler which \f(CW\*(C`extern\*(C'\fR
  declarations should be treated as hidden.
--- 22473,22479 ----
  \&\f(CW\*(C`extern\*(C'\fR declarations are not affected by \fB\-fvisibility\fR, so
  a lot of code can be recompiled with \fB\-fvisibility=hidden\fR with
  no modifications.  However, this means that calls to \f(CW\*(C`extern\*(C'\fR
! functions with no explicit visibility use the \s-1PLT,\s0 so it is more
  effective to use \f(CW\*(C`_\|_attribute ((visibility))\*(C'\fR and/or
  \&\f(CW\*(C`#pragma GCC visibility\*(C'\fR to tell the compiler which \f(CW\*(C`extern\*(C'\fR
  declarations should be treated as hidden.
*************** aspects of the compilation environment.
*** 22520,22526 ****
  Note that you can also specify places to search using options such as
  \&\fB\-B\fR, \fB\-I\fR and \fB\-L\fR.  These
  take precedence over places specified using environment variables, which
! in turn take precedence over those specified by the configuration of \s-1GCC\s0.
  .IP "\fB\s-1LANG\s0\fR" 4
  .IX Item "LANG"
  .PD 0
--- 22535,22541 ----
  Note that you can also specify places to search using options such as
  \&\fB\-B\fR, \fB\-I\fR and \fB\-L\fR.  These
  take precedence over places specified using environment variables, which
! in turn take precedence over those specified by the configuration of \s-1GCC.\s0
  .IP "\fB\s-1LANG\s0\fR" 4
  .IX Item "LANG"
  .PD 0
*************** national conventions.  \s-1GCC\s0 inspec
*** 22537,22543 ****
  \&\fB\s-1LC_CTYPE\s0\fR and \fB\s-1LC_MESSAGES\s0\fR if it has been configured to do
  so.  These locale categories can be set to any value supported by your
  installation.  A typical value is \fBen_GB.UTF\-8\fR for English in the United
! Kingdom encoded in \s-1UTF\-8\s0.
  .Sp
  The \fB\s-1LC_CTYPE\s0\fR environment variable specifies character
  classification.  \s-1GCC\s0 uses it to determine the character boundaries in
--- 22552,22558 ----
  \&\fB\s-1LC_CTYPE\s0\fR and \fB\s-1LC_MESSAGES\s0\fR if it has been configured to do
  so.  These locale categories can be set to any value supported by your
  installation.  A typical value is \fBen_GB.UTF\-8\fR for English in the United
! Kingdom encoded in \s-1UTF\-8.\s0
  .Sp
  The \fB\s-1LC_CTYPE\s0\fR environment variable specifies character
  classification.  \s-1GCC\s0 uses it to determine the character boundaries in
*************** and the Info entries for \fIgcc\fR, \fIc
*** 22717,22723 ****
  .IX Header "AUTHOR"
  See the Info entry for \fBgcc\fR, or
  <\fBhttp://gcc.gnu.org/onlinedocs/gcc/Contributors.html\fR>,
! for contributors to \s-1GCC\s0.
  .SH "COPYRIGHT"
  .IX Header "COPYRIGHT"
  Copyright (c) 1988\-2015 Free Software Foundation, Inc.
--- 22732,22738 ----
  .IX Header "AUTHOR"
  See the Info entry for \fBgcc\fR, or
  <\fBhttp://gcc.gnu.org/onlinedocs/gcc/Contributors.html\fR>,
! for contributors to \s-1GCC.\s0
  .SH "COPYRIGHT"
  .IX Header "COPYRIGHT"
  Copyright (c) 1988\-2015 Free Software Foundation, Inc.
diff -Nrcpad gcc-5.4.0/gcc/doc/gc-analyze.1 gcc-5.5.0/gcc/doc/gc-analyze.1
*** gcc-5.4.0/gcc/doc/gc-analyze.1	Fri Jun  3 10:15:09 2016
--- gcc-5.5.0/gcc/doc/gc-analyze.1	Tue Oct 10 09:24:12 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GC-ANALYZE 1"
! .TH GC-ANALYZE 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GC-ANALYZE 1"
! .TH GC-ANALYZE 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/gcc/doc/gcc.1 gcc-5.5.0/gcc/doc/gcc.1
*** gcc-5.4.0/gcc/doc/gcc.1	Fri Jun  3 10:32:24 2016
--- gcc-5.5.0/gcc/doc/gcc.1	Tue Oct 10 09:40:26 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GCC 1"
! .TH GCC 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GCC 1"
! .TH GCC 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** Only the most useful options are listed
*** 153,159 ****
  remainder.  \fBg++\fR accepts mostly the same options as \fBgcc\fR.
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! When you invoke \s-1GCC\s0, it normally does preprocessing, compilation,
  assembly and linking.  The \*(L"overall options\*(R" allow you to stop this
  process at an intermediate stage.  For example, the \fB\-c\fR option
  says not to run the linker.  Then the output consists of object files
--- 150,156 ----
  remainder.  \fBg++\fR accepts mostly the same options as \fBgcc\fR.
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! When you invoke \s-1GCC,\s0 it normally does preprocessing, compilation,
  assembly and linking.  The \*(L"overall options\*(R" allow you to stop this
  process at an intermediate stage.  For example, the \fB\-c\fR option
  says not to run the linker.  Then the output consists of object files
*************** these have both positive and negative fo
*** 188,194 ****
  only one of these two forms, whichever one is not the default.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! .Sh "Option Summary"
  .IX Subsection "Option Summary"
  Here is a summary of all the options, grouped by type.  Explanations are
  in the following sections.
--- 185,191 ----
  only one of these two forms, whichever one is not the default.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! .SS "Option Summary"
  .IX Subsection "Option Summary"
  Here is a summary of all the options, grouped by type.  Explanations are
  in the following sections.
*************** in the following sections.
*** 276,282 ****
  \&\-Wno\-attributes \-Wno\-builtin\-macro\-redefined 
  \&\-Wc90\-c99\-compat \-Wc99\-c11\-compat 
  \&\-Wc++\-compat \-Wc++11\-compat \-Wc++14\-compat \-Wcast\-align  \-Wcast\-qual  
! \&\-Wchar\-subscripts \-Wclobbered  \-Wcomment \-Wconditionally\-supported  
  \&\-Wconversion \-Wcoverage\-mismatch \-Wdate\-time \-Wdelete\-incomplete \-Wno\-cpp  
  \&\-Wno\-deprecated \-Wno\-deprecated\-declarations \-Wno\-designated\-init 
  \&\-Wdisabled\-optimization 
--- 273,279 ----
  \&\-Wno\-attributes \-Wno\-builtin\-macro\-redefined 
  \&\-Wc90\-c99\-compat \-Wc99\-c11\-compat 
  \&\-Wc++\-compat \-Wc++11\-compat \-Wc++14\-compat \-Wcast\-align  \-Wcast\-qual  
! \&\-Wchar\-subscripts \-Wchkp \-Wclobbered  \-Wcomment \-Wconditionally\-supported  
  \&\-Wconversion \-Wcoverage\-mismatch \-Wdate\-time \-Wdelete\-incomplete \-Wno\-cpp  
  \&\-Wno\-deprecated \-Wno\-deprecated\-declarations \-Wno\-designated\-init 
  \&\-Wdisabled\-optimization 
*************** in the following sections.
*** 594,600 ****
  \&\fI\s-1AVR\s0 Options\fR
  \&\fB\-mmcu=\fR\fImcu\fR \fB\-maccumulate\-args \-mbranch\-cost=\fR\fIcost\fR 
  \&\fB\-mcall\-prologues \-mint8 \-mn_flash=\fR\fIsize\fR \fB\-mno\-interrupts 
! \&\-mrelax \-mrmw \-mstrict\-X \-mtiny\-stack \-nodevicelib \-Waddr\-space\-convert\fR
  .Sp
  \&\fIBlackfin Options\fR
  \&\fB\-mcpu=\fR\fIcpu\fR[\fB\-\fR\fIsirevision\fR] 
--- 591,598 ----
  \&\fI\s-1AVR\s0 Options\fR
  \&\fB\-mmcu=\fR\fImcu\fR \fB\-maccumulate\-args \-mbranch\-cost=\fR\fIcost\fR 
  \&\fB\-mcall\-prologues \-mint8 \-mn_flash=\fR\fIsize\fR \fB\-mno\-interrupts 
! \&\-mrelax \-mrmw \-mstrict\-X \-mtiny\-stack \-nodevicelib \-Waddr\-space\-convert 
! \&\-Wmisspelled\-isr\fR
  .Sp
  \&\fIBlackfin Options\fR
  \&\fB\-mcpu=\fR\fIcpu\fR[\fB\-\fR\fIsirevision\fR] 
*************** See \s-1RS/6000\s0 and PowerPC Options.
*** 943,949 ****
  \&\-mpointers\-to\-nested\-functions \-mno\-pointers\-to\-nested\-functions 
  \&\-msave\-toc\-indirect \-mno\-save\-toc\-indirect 
  \&\-mpower8\-fusion \-mno\-mpower8\-fusion \-mpower8\-vector \-mno\-power8\-vector 
! \&\-mcrypto \-mno\-crypto \-mdirect\-move \-mno\-direct\-move 
  \&\-mquad\-memory \-mno\-quad\-memory 
  \&\-mquad\-memory\-atomic \-mno\-quad\-memory\-atomic 
  \&\-mcompat\-align\-parm \-mno\-compat\-align\-parm 
--- 941,947 ----
  \&\-mpointers\-to\-nested\-functions \-mno\-pointers\-to\-nested\-functions 
  \&\-msave\-toc\-indirect \-mno\-save\-toc\-indirect 
  \&\-mpower8\-fusion \-mno\-mpower8\-fusion \-mpower8\-vector \-mno\-power8\-vector 
! \&\-mcrypto \-mno\-crypto \-mhtm \-mno\-htm \-mdirect\-move \-mno\-direct\-move 
  \&\-mquad\-memory \-mno\-quad\-memory 
  \&\-mquad\-memory\-atomic \-mno\-quad\-memory\-atomic 
  \&\-mcompat\-align\-parm \-mno\-compat\-align\-parm 
*************** See S/390 and zSeries Options.
*** 1155,1161 ****
  \&\fB\-ftrapv  \-fwrapv  \-fbounds\-check 
  \&\-fvisibility=\fR[\fBdefault\fR|\fBinternal\fR|\fBhidden\fR|\fBprotected\fR] 
  \&\fB\-fstrict\-volatile\-bitfields \-fsync\-libcalls\fR
! .Sh "Options Controlling the Kind of Output"
  .IX Subsection "Options Controlling the Kind of Output"
  Compilation can involve up to four stages: preprocessing, compilation
  proper, assembly and linking, always in that order.  \s-1GCC\s0 is capable of
--- 1153,1159 ----
  \&\fB\-ftrapv  \-fwrapv  \-fbounds\-check 
  \&\-fvisibility=\fR[\fBdefault\fR|\fBinternal\fR|\fBhidden\fR|\fBprotected\fR] 
  \&\fB\-fstrict\-volatile\-bitfields \-fsync\-libcalls\fR
! .SS "Options Controlling the Kind of Output"
  .IX Subsection "Options Controlling the Kind of Output"
  Compilation can involve up to four stages: preprocessing, compilation
  proper, assembly and linking, always in that order.  \s-1GCC\s0 is capable of
*************** option.
*** 1459,1465 ****
  .IX Item "language"
  Display the options supported for \fIlanguage\fR, where
  \&\fIlanguage\fR is the name of one of the languages supported in this
! version of \s-1GCC\s0.
  .IP "\fBcommon\fR" 4
  .IX Item "common"
  Display the options that are common to all languages.
--- 1457,1463 ----
  .IX Item "language"
  Display the options supported for \fIlanguage\fR, where
  \&\fIlanguage\fR is the name of one of the languages supported in this
! version of \s-1GCC.\s0
  .IP "\fBcommon\fR" 4
  .IX Item "common"
  Display the options that are common to all languages.
*************** or \fB/./\fR, or make the path absolute
*** 1556,1562 ****
  prefix.
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
! Display the version number and copyrights of the invoked \s-1GCC\s0.
  .IP "\fB\-wrapper\fR" 4
  .IX Item "-wrapper"
  Invoke all subcommands under a wrapper program.  The name of the
--- 1554,1560 ----
  prefix.
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
! Display the version number and copyrights of the invoked \s-1GCC.\s0
  .IP "\fB\-wrapper\fR" 4
  .IX Item "-wrapper"
  Invoke all subcommands under a wrapper program.  The name of the
*************** the shared object file is used to identi
*** 1578,1584 ****
  purposes of argument parsing (See
  \&\fB\-fplugin\-arg\-\fR\fIname\fR\fB\-\fR\fIkey\fR\fB=\fR\fIvalue\fR below).
  Each plugin should define the callback functions specified in the
! Plugins \s-1API\s0.
  .IP "\fB\-fplugin\-arg\-\fR\fIname\fR\fB\-\fR\fIkey\fR\fB=\fR\fIvalue\fR" 4
  .IX Item "-fplugin-arg-name-key=value"
  Define an argument called \fIkey\fR with a value of \fIvalue\fR
--- 1576,1582 ----
  purposes of argument parsing (See
  \&\fB\-fplugin\-arg\-\fR\fIname\fR\fB\-\fR\fIkey\fR\fB=\fR\fIvalue\fR below).
  Each plugin should define the callback functions specified in the
! Plugins \s-1API.\s0
  .IP "\fB\-fplugin\-arg\-\fR\fIname\fR\fB\-\fR\fIkey\fR\fB=\fR\fIvalue\fR" 4
  .IX Item "-fplugin-arg-name-key=value"
  Define an argument called \fIkey\fR with a value of \fIvalue\fR
*************** option in either single or double quotes
*** 1610,1617 ****
  backslash) may be included by prefixing the character to be included
  with a backslash.  The \fIfile\fR may itself contain additional
  @\fIfile\fR options; any such options will be processed recursively.
! .Sh "Compiling \*(C+ Programs"
! .IX Subsection "Compiling  Programs"
  \&\*(C+ source files conventionally use one of the suffixes \fB.C\fR,
  \&\fB.cc\fR, \fB.cpp\fR, \fB.CPP\fR, \fB.c++\fR, \fB.cp\fR, or
  \&\fB.cxx\fR; \*(C+ header files often use \fB.hh\fR, \fB.hpp\fR,
--- 1608,1615 ----
  backslash) may be included by prefixing the character to be included
  with a backslash.  The \fIfile\fR may itself contain additional
  @\fIfile\fR options; any such options will be processed recursively.
! .SS "Compiling \*(C+ Programs"
! .IX Subsection "Compiling Programs"
  \&\*(C+ source files conventionally use one of the suffixes \fB.C\fR,
  \&\fB.cc\fR, \fB.cpp\fR, \fB.CPP\fR, \fB.c++\fR, \fB.cp\fR, or
  \&\fB.cxx\fR; \*(C+ header files often use \fB.hh\fR, \fB.hpp\fR,
*************** When you compile \*(C+ programs, you may
*** 1634,1640 ****
  command-line options that you use for compiling programs in any
  language; or command-line options meaningful for C and related
  languages; or options that are meaningful only for \*(C+ programs.
! .Sh "Options Controlling C Dialect"
  .IX Subsection "Options Controlling C Dialect"
  The following options control the dialect of C (or languages derived
  from C, such as \*(C+, Objective-C and Objective\-\*(C+) that the compiler
--- 1632,1638 ----
  command-line options that you use for compiling programs in any
  language; or command-line options meaningful for C and related
  languages; or options that are meaningful only for \*(C+ programs.
! .SS "Options Controlling C Dialect"
  .IX Subsection "Options Controlling C Dialect"
  The following options control the dialect of C (or languages derived
  from C, such as \*(C+, Objective-C and Objective\-\*(C+) that the compiler
*************** accepts:
*** 1644,1651 ****
  In C mode, this is equivalent to \fB\-std=c90\fR. In \*(C+ mode, it is
  equivalent to \fB\-std=c++98\fR.
  .Sp
! This turns off certain features of \s-1GCC\s0 that are incompatible with \s-1ISO\s0
! C90 (when compiling C code), or of standard \*(C+ (when compiling \*(C+ code),
  such as the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR keywords, and
  predefined macros such as \f(CW\*(C`unix\*(C'\fR and \f(CW\*(C`vax\*(C'\fR that identify the
  type of system you are using.  It also enables the undesirable and
--- 1642,1649 ----
  In C mode, this is equivalent to \fB\-std=c90\fR. In \*(C+ mode, it is
  equivalent to \fB\-std=c++98\fR.
  .Sp
! This turns off certain features of \s-1GCC\s0 that are incompatible with \s-1ISO
! C90\s0 (when compiling C code), or of standard \*(C+ (when compiling \*(C+ code),
  such as the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR keywords, and
  predefined macros such as \f(CW\*(C`unix\*(C'\fR and \f(CW\*(C`vax\*(C'\fR that identify the
  type of system you are using.  It also enables the undesirable and
*************** the \f(CW\*(C`inline\*(C'\fR keyword.
*** 1655,1661 ****
  .Sp
  The alternate keywords \f(CW\*(C`_\|_asm_\|_\*(C'\fR, \f(CW\*(C`_\|_extension_\|_\*(C'\fR,
  \&\f(CW\*(C`_\|_inline_\|_\*(C'\fR and \f(CW\*(C`_\|_typeof_\|_\*(C'\fR continue to work despite
! \&\fB\-ansi\fR.  You would not want to use them in an \s-1ISO\s0 C program, of
  course, but it is useful to put them in header files that might be included
  in compilations done with \fB\-ansi\fR.  Alternate predefined macros
  such as \f(CW\*(C`_\|_unix_\|_\*(C'\fR and \f(CW\*(C`_\|_vax_\|_\*(C'\fR are also available, with or
--- 1653,1659 ----
  .Sp
  The alternate keywords \f(CW\*(C`_\|_asm_\|_\*(C'\fR, \f(CW\*(C`_\|_extension_\|_\*(C'\fR,
  \&\f(CW\*(C`_\|_inline_\|_\*(C'\fR and \f(CW\*(C`_\|_typeof_\|_\*(C'\fR continue to work despite
! \&\fB\-ansi\fR.  You would not want to use them in an \s-1ISO C\s0 program, of
  course, but it is useful to put them in header files that might be included
  in compilations done with \fB\-ansi\fR.  Alternate predefined macros
  such as \f(CW\*(C`_\|_unix_\|_\*(C'\fR and \f(CW\*(C`_\|_vax_\|_\*(C'\fR are also available, with or
*************** from declaring certain functions or defi
*** 1672,1678 ****
  programs that might use these names for other things.
  .Sp
  Functions that are normally built in but do not have semantics
! defined by \s-1ISO\s0 C (such as \f(CW\*(C`alloca\*(C'\fR and \f(CW\*(C`ffs\*(C'\fR) are not built-in
  functions when \fB\-ansi\fR is used.
  .IP "\fB\-std=\fR" 4
  .IX Item "-std="
--- 1670,1676 ----
  programs that might use these names for other things.
  .Sp
  Functions that are normally built in but do not have semantics
! defined by \s-1ISO C\s0 (such as \f(CW\*(C`alloca\*(C'\fR and \f(CW\*(C`ffs\*(C'\fR) are not built-in
  functions when \fB\-ansi\fR is used.
  .IP "\fB\-std=\fR" 4
  .IX Item "-std="
*************** The compiler can accept several base sta
*** 1685,1693 ****
  compiler accepts all programs following that standard plus those
  using \s-1GNU\s0 extensions that do not contradict it.  For example,
  \&\fB\-std=c90\fR turns off certain features of \s-1GCC\s0 that are
! incompatible with \s-1ISO\s0 C90, such as the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR
  keywords, but not other \s-1GNU\s0 extensions that do not have a meaning in
! \&\s-1ISO\s0 C90, such as omitting the middle term of a \f(CW\*(C`?:\*(C'\fR
  expression. On the other hand, when a \s-1GNU\s0 dialect of a standard is
  specified, all features supported by the compiler are enabled, even when
  those features change the meaning of the base standard.  As a result, some
--- 1683,1691 ----
  compiler accepts all programs following that standard plus those
  using \s-1GNU\s0 extensions that do not contradict it.  For example,
  \&\fB\-std=c90\fR turns off certain features of \s-1GCC\s0 that are
! incompatible with \s-1ISO C90,\s0 such as the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR
  keywords, but not other \s-1GNU\s0 extensions that do not have a meaning in
! \&\s-1ISO C90,\s0 such as omitting the middle term of a \f(CW\*(C`?:\*(C'\fR
  expression. On the other hand, when a \s-1GNU\s0 dialect of a standard is
  specified, all features supported by the compiler are enabled, even when
  those features change the meaning of the base standard.  As a result, some
*************** A value for this option must be provided
*** 1707,1717 ****
  .IP "\fBiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! Support all \s-1ISO\s0 C90 programs (certain \s-1GNU\s0 extensions that conflict
! with \s-1ISO\s0 C90 are disabled). Same as \fB\-ansi\fR for C code.
  .IP "\fBiso9899:199409\fR" 4
  .IX Item "iso9899:199409"
! \&\s-1ISO\s0 C90 as modified in amendment 1.
  .IP "\fBc99\fR" 4
  .IX Item "c99"
  .PD 0
--- 1705,1715 ----
  .IP "\fBiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! Support all \s-1ISO C90\s0 programs (certain \s-1GNU\s0 extensions that conflict
! with \s-1ISO C90\s0 are disabled). Same as \fB\-ansi\fR for C code.
  .IP "\fBiso9899:199409\fR" 4
  .IX Item "iso9899:199409"
! \&\s-1ISO C90\s0 as modified in amendment 1.
  .IP "\fBc99\fR" 4
  .IX Item "c99"
  .PD 0
*************** with \s-1ISO\s0 C90 are disabled). Same
*** 1722,1728 ****
  .IP "\fBiso9899:199x\fR" 4
  .IX Item "iso9899:199x"
  .PD
! \&\s-1ISO\s0 C99.  This standard is substantially completely supported, modulo
  bugs and floating-point issues
  (mainly but not entirely relating to optional C99 features from
  Annexes F and G).  See
--- 1720,1726 ----
  .IP "\fBiso9899:199x\fR" 4
  .IX Item "iso9899:199x"
  .PD
! \&\s-1ISO C99.\s0  This standard is substantially completely supported, modulo
  bugs and floating-point issues
  (mainly but not entirely relating to optional C99 features from
  Annexes F and G).  See
*************** names \fBc9x\fR and \fBiso9899:199x\fR a
*** 1736,1742 ****
  .IP "\fBiso9899:2011\fR" 4
  .IX Item "iso9899:2011"
  .PD
! \&\s-1ISO\s0 C11, the 2011 revision of the \s-1ISO\s0 C standard.  This standard is
  substantially completely supported, modulo bugs, floating-point issues
  (mainly but not entirely relating to optional C11 features from
  Annexes F and G) and the optional Annexes K (Bounds-checking
--- 1734,1740 ----
  .IP "\fBiso9899:2011\fR" 4
  .IX Item "iso9899:2011"
  .PD
! \&\s-1ISO C11,\s0 the 2011 revision of the \s-1ISO C\s0 standard.  This standard is
  substantially completely supported, modulo bugs, floating-point issues
  (mainly but not entirely relating to optional C11 features from
  Annexes F and G) and the optional Annexes K (Bounds-checking
*************** interfaces) and L (Analyzability).  The
*** 1747,1767 ****
  .IP "\fBgnu89\fR" 4
  .IX Item "gnu89"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO\s0 C90 (including some C99 features).
  .IP "\fBgnu99\fR" 4
  .IX Item "gnu99"
  .PD 0
  .IP "\fBgnu9x\fR" 4
  .IX Item "gnu9x"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO\s0 C99.  The name \fBgnu9x\fR is deprecated.
  .IP "\fBgnu11\fR" 4
  .IX Item "gnu11"
  .PD 0
  .IP "\fBgnu1x\fR" 4
  .IX Item "gnu1x"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO\s0 C11.  This is the default for C code.
  The name \fBgnu1x\fR is deprecated.
  .IP "\fBc++98\fR" 4
  .IX Item "c++98"
--- 1745,1765 ----
  .IP "\fBgnu89\fR" 4
  .IX Item "gnu89"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO C90\s0 (including some C99 features).
  .IP "\fBgnu99\fR" 4
  .IX Item "gnu99"
  .PD 0
  .IP "\fBgnu9x\fR" 4
  .IX Item "gnu9x"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO C99.\s0  The name \fBgnu9x\fR is deprecated.
  .IP "\fBgnu11\fR" 4
  .IX Item "gnu11"
  .PD 0
  .IP "\fBgnu1x\fR" 4
  .IX Item "gnu1x"
  .PD
! \&\s-1GNU\s0 dialect of \s-1ISO C11.\s0  This is the default for C code.
  The name \fBgnu1x\fR is deprecated.
  .IP "\fBc++98\fR" 4
  .IX Item "c++98"
*************** The name \fBgnu1x\fR is deprecated.
*** 1769,1775 ****
  .IP "\fBc++03\fR" 4
  .IX Item "c++03"
  .PD
! The 1998 \s-1ISO\s0 \*(C+ standard plus the 2003 technical corrigendum and some
  additional defect reports. Same as \fB\-ansi\fR for \*(C+ code.
  .IP "\fBgnu++98\fR" 4
  .IX Item "gnu++98"
--- 1767,1773 ----
  .IP "\fBc++03\fR" 4
  .IX Item "c++03"
  .PD
! The 1998 \s-1ISO \*(C+\s0 standard plus the 2003 technical corrigendum and some
  additional defect reports. Same as \fB\-ansi\fR for \*(C+ code.
  .IP "\fBgnu++98\fR" 4
  .IX Item "gnu++98"
*************** additional defect reports. Same as \fB\-
*** 1785,1791 ****
  .IP "\fBc++0x\fR" 4
  .IX Item "c++0x"
  .PD
! The 2011 \s-1ISO\s0 \*(C+ standard plus amendments.
  The name \fBc++0x\fR is deprecated.
  .IP "\fBgnu++11\fR" 4
  .IX Item "gnu++11"
--- 1783,1789 ----
  .IP "\fBc++0x\fR" 4
  .IX Item "c++0x"
  .PD
! The 2011 \s-1ISO \*(C+\s0 standard plus amendments.
  The name \fBc++0x\fR is deprecated.
  .IP "\fBgnu++11\fR" 4
  .IX Item "gnu++11"
*************** The name \fBgnu++0x\fR is deprecated.
*** 1801,1807 ****
  .IP "\fBc++1y\fR" 4
  .IX Item "c++1y"
  .PD
! The 2014 \s-1ISO\s0 \*(C+ standard plus amendments.
  The name \fBc++1y\fR is deprecated.
  .IP "\fBgnu++14\fR" 4
  .IX Item "gnu++14"
--- 1799,1805 ----
  .IP "\fBc++1y\fR" 4
  .IX Item "c++1y"
  .PD
! The 2014 \s-1ISO \*(C+\s0 standard plus amendments.
  The name \fBc++1y\fR is deprecated.
  .IP "\fBgnu++14\fR" 4
  .IX Item "gnu++14"
*************** The name \fBc++1y\fR is deprecated.
*** 1813,1819 ****
  The name \fBgnu++1y\fR is deprecated.
  .IP "\fBc++1z\fR" 4
  .IX Item "c++1z"
! The next revision of the \s-1ISO\s0 \*(C+ standard, tentatively planned for
  2017.  Support is highly experimental, and will almost certainly
  change in incompatible ways in future releases.
  .IP "\fBgnu++1z\fR" 4
--- 1811,1817 ----
  The name \fBgnu++1y\fR is deprecated.
  .IP "\fBc++1z\fR" 4
  .IX Item "c++1z"
! The next revision of the \s-1ISO \*(C+\s0 standard, tentatively planned for
  2017.  Support is highly experimental, and will almost certainly
  change in incompatible ways in future releases.
  .IP "\fBgnu++1z\fR" 4
*************** In \*(C+, this switch only affects the \
*** 1875,1881 ****
  use the \fB\-fno\-gnu\-keywords\fR flag instead, which has the same
  effect.  In C99 mode (\fB\-std=c99\fR or \fB\-std=gnu99\fR), this
  switch only affects the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR keywords, since
! \&\f(CW\*(C`inline\*(C'\fR is a standard keyword in \s-1ISO\s0 C99.
  .IP "\fB\-fno\-builtin\fR" 4
  .IX Item "-fno-builtin"
  .PD 0
--- 1873,1879 ----
  use the \fB\-fno\-gnu\-keywords\fR flag instead, which has the same
  effect.  In C99 mode (\fB\-std=c99\fR or \fB\-std=gnu99\fR), this
  switch only affects the \f(CW\*(C`asm\*(C'\fR and \f(CW\*(C`typeof\*(C'\fR keywords, since
! \&\f(CW\*(C`inline\*(C'\fR is a standard keyword in \s-1ISO C99.\s0
  .IP "\fB\-fno\-builtin\fR" 4
  .IX Item "-fno-builtin"
  .PD 0
*************** known not to modify global memory.
*** 1903,1909 ****
  With the \fB\-fno\-builtin\-\fR\fIfunction\fR option
  only the built-in function \fIfunction\fR is
  disabled.  \fIfunction\fR must not begin with \fB_\|_builtin_\fR.  If a
! function is named that is not built-in in this version of \s-1GCC\s0, this
  option is ignored.  There is no corresponding
  \&\fB\-fbuiltin\-\fR\fIfunction\fR option; if you wish to enable
  built-in functions selectively when using \fB\-fno\-builtin\fR or
--- 1901,1907 ----
  With the \fB\-fno\-builtin\-\fR\fIfunction\fR option
  only the built-in function \fIfunction\fR is
  disabled.  \fIfunction\fR must not begin with \fB_\|_builtin_\fR.  If a
! function is named that is not built-in in this version of \s-1GCC,\s0 this
  option is ignored.  There is no corresponding
  \&\fB\-fbuiltin\-\fR\fIfunction\fR option; if you wish to enable
  built-in functions selectively when using \fB\-fno\-builtin\fR or
*************** implies \fB\-pthread\fR, and thus is onl
*** 1937,1943 ****
  have support for \fB\-pthread\fR.
  .Sp
  Note that this is an experimental feature, incomplete, and subject to
! change in future versions of \s-1GCC\s0.  See
  <\fBhttps://gcc.gnu.org/wiki/OpenACC\fR> for more information.
  .IP "\fB\-fopenmp\fR" 4
  .IX Item "-fopenmp"
--- 1935,1941 ----
  have support for \fB\-pthread\fR.
  .Sp
  Note that this is an experimental feature, incomplete, and subject to
! change in future versions of \s-1GCC.\s0  See
  <\fBhttps://gcc.gnu.org/wiki/OpenACC\fR> for more information.
  .IP "\fB\-fopenmp\fR" 4
  .IX Item "-fopenmp"
*************** When the option \fB\-fgnu\-tm\fR is spec
*** 1969,1975 ****
  generates code for the Linux variant of Intel's current Transactional
  Memory \s-1ABI\s0 specification document (Revision 1.1, May 6 2009).  This is
  an experimental feature whose interface may change in future versions
! of \s-1GCC\s0, as the official specification changes.  Please note that not
  all architectures are supported for this feature.
  .Sp
  For more information on \s-1GCC\s0's support for transactional memory,
--- 1967,1973 ----
  generates code for the Linux variant of Intel's current Transactional
  Memory \s-1ABI\s0 specification document (Revision 1.1, May 6 2009).  This is
  an experimental feature whose interface may change in future versions
! of \s-1GCC,\s0 as the official specification changes.  Please note that not
  all architectures are supported for this feature.
  .Sp
  For more information on \s-1GCC\s0's support for transactional memory,
*************** fields declared using a typedef.    This
*** 2006,2013 ****
  supported for C, not \*(C+.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
! Support \s-1ISO\s0 C trigraphs.  The \fB\-ansi\fR option (and \fB\-std\fR
! options for strict \s-1ISO\s0 C conformance) implies \fB\-trigraphs\fR.
  .IP "\fB\-traditional\fR" 4
  .IX Item "-traditional"
  .PD 0
--- 2004,2011 ----
  supported for C, not \*(C+.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
! Support \s-1ISO C\s0 trigraphs.  The \fB\-ansi\fR option (and \fB\-std\fR
! options for strict \s-1ISO C\s0 conformance) implies \fB\-trigraphs\fR.
  .IP "\fB\-traditional\fR" 4
  .IX Item "-traditional"
  .PD 0
*************** options for strict \s-1ISO\s0 C conforma
*** 2016,2023 ****
  .PD
  Formerly, these options caused \s-1GCC\s0 to attempt to emulate a pre-standard
  C compiler.  They are now only supported with the \fB\-E\fR switch.
! The preprocessor continues to support a pre-standard mode.  See the \s-1GNU\s0
! \&\s-1CPP\s0 manual for details.
  .IP "\fB\-fcond\-mismatch\fR" 4
  .IX Item "-fcond-mismatch"
  Allow conditional expressions with mismatched types in the second and
--- 2014,2021 ----
  .PD
  Formerly, these options caused \s-1GCC\s0 to attempt to emulate a pre-standard
  C compiler.  They are now only supported with the \fB\-E\fR switch.
! The preprocessor continues to support a pre-standard mode.  See the \s-1GNU
! CPP\s0 manual for details.
  .IP "\fB\-fcond\-mismatch\fR" 4
  .IX Item "-fcond-mismatch"
  Allow conditional expressions with mismatched types in the second and
*************** These options control whether a bit-fiel
*** 2067,2074 ****
  declaration does not use either \f(CW\*(C`signed\*(C'\fR or \f(CW\*(C`unsigned\*(C'\fR.  By
  default, such a bit-field is signed, because this is consistent: the
  basic integer types such as \f(CW\*(C`int\*(C'\fR are signed types.
! .Sh "Options Controlling \*(C+ Dialect"
! .IX Subsection "Options Controlling  Dialect"
  This section describes the command-line options that are only meaningful
  for \*(C+ programs.  You can also use most of the \s-1GNU\s0 compiler options
  regardless of what language your program is in.  For example, you
--- 2065,2072 ----
  declaration does not use either \f(CW\*(C`signed\*(C'\fR or \f(CW\*(C`unsigned\*(C'\fR.  By
  default, such a bit-field is signed, because this is consistent: the
  basic integer types such as \f(CW\*(C`int\*(C'\fR are signed types.
! .SS "Options Controlling \*(C+ Dialect"
! .IX Subsection "Options Controlling Dialect"
  This section describes the command-line options that are only meaningful
  for \*(C+ programs.  You can also use most of the \s-1GNU\s0 compiler options
  regardless of what language your program is in.  For example, you
*************** might compile a file \fIfirstClass.C\fR
*** 2080,2091 ****
  .PP
  In this example, only \fB\-frepo\fR is an option meant
  only for \*(C+ programs; you can use the other options with any
! language supported by \s-1GCC\s0.
  .PP
  Here is a list of options that are \fIonly\fR for compiling \*(C+ programs:
  .IP "\fB\-fabi\-version=\fR\fIn\fR" 4
  .IX Item "-fabi-version=n"
! Use version \fIn\fR of the \*(C+ \s-1ABI\s0.  The default is version 0.
  .Sp
  Version 0 refers to the version conforming most closely to
  the \*(C+ \s-1ABI\s0 specification.  Therefore, the \s-1ABI\s0 obtained using version 0
--- 2078,2089 ----
  .PP
  In this example, only \fB\-frepo\fR is an option meant
  only for \*(C+ programs; you can use the other options with any
! language supported by \s-1GCC.\s0
  .PP
  Here is a list of options that are \fIonly\fR for compiling \*(C+ programs:
  .IP "\fB\-fabi\-version=\fR\fIn\fR" 4
  .IX Item "-fabi-version=n"
! Use version \fIn\fR of the \*(C+ \s-1ABI.\s0  The default is version 0.
  .Sp
  Version 0 refers to the version conforming most closely to
  the \*(C+ \s-1ABI\s0 specification.  Therefore, the \s-1ABI\s0 obtained using version 0
*************** Inject friend functions into the enclosi
*** 2182,2188 ****
  visible outside the scope of the class in which they are declared.
  Friend functions were documented to work this way in the old Annotated
  \&\*(C+ Reference Manual.  
! However, in \s-1ISO\s0 \*(C+ a friend function that is not declared
  in an enclosing scope can only be found using argument dependent
  lookup.  \s-1GCC\s0 defaults to the standard behavior.
  .Sp
--- 2180,2186 ----
  visible outside the scope of the class in which they are declared.
  Friend functions were documented to work this way in the old Annotated
  \&\*(C+ Reference Manual.  
! However, in \s-1ISO \*(C+\s0 a friend function that is not declared
  in an enclosing scope can only be found using argument dependent
  lookup.  \s-1GCC\s0 defaults to the standard behavior.
  .Sp
*************** controlled by \f(CW\*(C`#pragma implemen
*** 2265,2276 ****
  errors if these functions are not inlined everywhere they are called.
  .IP "\fB\-fms\-extensions\fR" 4
  .IX Item "-fms-extensions"
! Disable Wpedantic warnings about constructs used in \s-1MFC\s0, such as implicit
  int and getting a pointer to member function via non-standard syntax.
  .IP "\fB\-fno\-nonansi\-builtins\fR" 4
  .IX Item "-fno-nonansi-builtins"
  Disable built-in declarations of functions that are not mandated by
! \&\s-1ANSI/ISO\s0 C.  These include \f(CW\*(C`ffs\*(C'\fR, \f(CW\*(C`alloca\*(C'\fR, \f(CW\*(C`_exit\*(C'\fR,
  \&\f(CW\*(C`index\*(C'\fR, \f(CW\*(C`bzero\*(C'\fR, \f(CW\*(C`conjf\*(C'\fR, and other related functions.
  .IP "\fB\-fnothrow\-opt\fR" 4
  .IX Item "-fnothrow-opt"
--- 2263,2274 ----
  errors if these functions are not inlined everywhere they are called.
  .IP "\fB\-fms\-extensions\fR" 4
  .IX Item "-fms-extensions"
! Disable Wpedantic warnings about constructs used in \s-1MFC,\s0 such as implicit
  int and getting a pointer to member function via non-standard syntax.
  .IP "\fB\-fno\-nonansi\-builtins\fR" 4
  .IX Item "-fno-nonansi-builtins"
  Disable built-in declarations of functions that are not mandated by
! \&\s-1ANSI/ISO C.\s0  These include \f(CW\*(C`ffs\*(C'\fR, \f(CW\*(C`alloca\*(C'\fR, \f(CW\*(C`_exit\*(C'\fR,
  \&\f(CW\*(C`index\*(C'\fR, \f(CW\*(C`bzero\*(C'\fR, \f(CW\*(C`conjf\*(C'\fR, and other related functions.
  .IP "\fB\-fnothrow\-opt\fR" 4
  .IX Item "-fnothrow-opt"
*************** warning or error to \fIn\fR.  The defaul
*** 2358,2364 ****
  .IX Item "-ftemplate-depth=n"
  Set the maximum instantiation depth for template classes to \fIn\fR.
  A limit on the template instantiation depth is needed to detect
! endless recursions during template class instantiation.  \s-1ANSI/ISO\s0 \*(C+
  conforming programs must not rely on a maximum depth greater than 17
  (changed to 1024 in \*(C+11).  The default value is 900, as the compiler
  can run out of stack space before hitting 1024 in some situations.
--- 2356,2362 ----
  .IX Item "-ftemplate-depth=n"
  Set the maximum instantiation depth for template classes to \fIn\fR.
  A limit on the template instantiation depth is needed to detect
! endless recursions during template class instantiation.  \s-1ANSI/ISO \*(C+\s0
  conforming programs must not rely on a maximum depth greater than 17
  (changed to 1024 in \*(C+11).  The default value is 900, as the compiler
  can run out of stack space before hitting 1024 in some situations.
*************** are taken in different shared objects.
*** 2389,2395 ****
  The effect of this is that \s-1GCC\s0 may, effectively, mark inline methods with
  \&\f(CW\*(C`_\|_attribute_\|_ ((visibility ("hidden")))\*(C'\fR so that they do not
  appear in the export table of a \s-1DSO\s0 and do not require a \s-1PLT\s0 indirection
! when used within the \s-1DSO\s0.  Enabling this option can have a dramatic effect
  on load and link times of a \s-1DSO\s0 as it massively reduces the size of the
  dynamic export table when the library makes heavy use of templates.
  .Sp
--- 2387,2393 ----
  The effect of this is that \s-1GCC\s0 may, effectively, mark inline methods with
  \&\f(CW\*(C`_\|_attribute_\|_ ((visibility ("hidden")))\*(C'\fR so that they do not
  appear in the export table of a \s-1DSO\s0 and do not require a \s-1PLT\s0 indirection
! when used within the \s-1DSO.\s0  Enabling this option can have a dramatic effect
  on load and link times of a \s-1DSO\s0 as it massively reduces the size of the
  dynamic export table when the library makes heavy use of templates.
  .Sp
*************** is used when building the \*(C+ library.
*** 2509,2518 ****
  In addition, these optimization, warning, and code generation options
  have meanings only for \*(C+ programs:
  .IP "\fB\-Wabi\fR (C, Objective-C, \*(C+ and Objective\-\*(C+ only)" 4
! .IX Item "-Wabi (C, Objective-C,  and Objective- only)"
  When an explicit \fB\-fabi\-version=\fR\fIn\fR option is used, causes
  G++ to warn when it generates code that is probably not compatible with the
! vendor-neutral \*(C+ \s-1ABI\s0.  Since G++ now defaults to
  \&\fB\-fabi\-version=0\fR, \fB\-Wabi\fR has no effect unless either
  an older \s-1ABI\s0 version is selected (with \fB\-fabi\-version=\fR\fIn\fR)
  or an older compatibility version is selected (with
--- 2507,2516 ----
  In addition, these optimization, warning, and code generation options
  have meanings only for \*(C+ programs:
  .IP "\fB\-Wabi\fR (C, Objective-C, \*(C+ and Objective\-\*(C+ only)" 4
! .IX Item "-Wabi (C, Objective-C, and Objective- only)"
  When an explicit \fB\-fabi\-version=\fR\fIn\fR option is used, causes
  G++ to warn when it generates code that is probably not compatible with the
! vendor-neutral \*(C+ \s-1ABI.\s0  Since G++ now defaults to
  \&\fB\-fabi\-version=0\fR, \fB\-Wabi\fR has no effect unless either
  an older \s-1ABI\s0 version is selected (with \fB\-fabi\-version=\fR\fIn\fR)
  or an older compatibility version is selected (with
*************** level, e.g. \fB\-Wabi=2\fR to warn about
*** 2535,2541 ****
  \&\fB\-fabi\-compat\-version=\fR\fIn\fR.
  .Sp
  The known incompatibilities in \fB\-fabi\-version=2\fR (which was the
! default from \s-1GCC\s0 3.4 to 4.9) include:
  .RS 4
  .IP "*" 4
  A template with a non-type template parameter of reference type was
--- 2533,2539 ----
  \&\fB\-fabi\-compat\-version=\fR\fIn\fR.
  .Sp
  The known incompatibilities in \fB\-fabi\-version=2\fR (which was the
! default from \s-1GCC 3.4\s0 to 4.9) include:
  .RS 4
  .IP "*" 4
  A template with a non-type template parameter of reference type was
*************** These mangling issues were fixed in \fB\
*** 2563,2569 ****
  Scoped enumerators passed as arguments to a variadic function are
  promoted like unscoped enumerators, causing \f(CW\*(C`va_arg\*(C'\fR to complain.
  On most targets this does not actually affect the parameter passing
! \&\s-1ABI\s0, as there is no way to pass an argument smaller than \f(CW\*(C`int\*(C'\fR.
  .Sp
  Also, the \s-1ABI\s0 changed the mangling of template argument packs,
  \&\f(CW\*(C`const_cast\*(C'\fR, \f(CW\*(C`static_cast\*(C'\fR, prefix increment/decrement, and
--- 2561,2567 ----
  Scoped enumerators passed as arguments to a variadic function are
  promoted like unscoped enumerators, causing \f(CW\*(C`va_arg\*(C'\fR to complain.
  On most targets this does not actually affect the parameter passing
! \&\s-1ABI,\s0 as there is no way to pass an argument smaller than \f(CW\*(C`int\*(C'\fR.
  .Sp
  Also, the \s-1ABI\s0 changed the mangling of template argument packs,
  \&\f(CW\*(C`const_cast\*(C'\fR, \f(CW\*(C`static_cast\*(C'\fR, prefix increment/decrement, and
*************** When mangling a function type with funct
*** 2580,2593 ****
  un-qualified function type was incorrectly treated as a substitution
  candidate.
  .Sp
! This was fixed in \fB\-fabi\-version=8\fR, the default for \s-1GCC\s0 5.1.
  .IP "*" 4
  \&\f(CW\*(C`decltype(nullptr)\*(C'\fR incorrectly had an alignment of 1, leading to
  unaligned accesses.  Note that this did not affect the \s-1ABI\s0 of a
  function with a \f(CW\*(C`nullptr_t\*(C'\fR parameter, as parameters have a
  minimum alignment.
  .Sp
! This was fixed in \fB\-fabi\-version=9\fR, the default for \s-1GCC\s0 5.2.
  .RE
  .RS 4
  .Sp
--- 2578,2591 ----
  un-qualified function type was incorrectly treated as a substitution
  candidate.
  .Sp
! This was fixed in \fB\-fabi\-version=8\fR, the default for \s-1GCC 5.1.\s0
  .IP "*" 4
  \&\f(CW\*(C`decltype(nullptr)\*(C'\fR incorrectly had an alignment of 1, leading to
  unaligned accesses.  Note that this did not affect the \s-1ABI\s0 of a
  function with a \f(CW\*(C`nullptr_t\*(C'\fR parameter, as parameters have a
  minimum alignment.
  .Sp
! This was fixed in \fB\-fabi\-version=9\fR, the default for \s-1GCC 5.2.\s0
  .RE
  .RS 4
  .Sp
*************** This is on by default for all pre\-\*(C+
*** 2703,2709 ****
  \&\fB\-std=c++98\fR, \fB\-std=gnu++98\fR, \fB\-std=gnu++11\fR,
  \&\fB\-std=gnu++14\fR.
  This option is off by default
! for \s-1ISO\s0 \*(C+11 onwards (\fB\-std=c++11\fR, ...).
  .PP
  The following \fB\-W...\fR options are not affected by \fB\-Wall\fR.
  .IP "\fB\-Weffc++\fR (\*(C+ and Objective\-\*(C+ only)" 4
--- 2701,2707 ----
  \&\fB\-std=c++98\fR, \fB\-std=gnu++98\fR, \fB\-std=gnu++11\fR,
  \&\fB\-std=gnu++14\fR.
  This option is off by default
! for \s-1ISO \*(C+11\s0 onwards (\fB\-std=c++11\fR, ...).
  .PP
  The following \fB\-W...\fR options are not affected by \fB\-Wall\fR.
  .IP "\fB\-Weffc++\fR (\*(C+ and Objective\-\*(C+ only)" 4
*************** Warn when overload resolution chooses a
*** 2799,2805 ****
  enumerated type to a signed type, over a conversion to an unsigned type of
  the same size.  Previous versions of G++ tried to preserve
  unsignedness, but the standard mandates the current behavior.
! .Sh "Options Controlling Objective-C and Objective\-\*(C+ Dialects"
  .IX Subsection "Options Controlling Objective-C and Objective- Dialects"
  (\s-1NOTE:\s0 This manual does not describe the Objective-C and Objective\-\*(C+
  languages themselves.
--- 2797,2803 ----
  enumerated type to a signed type, over a conversion to an unsigned type of
  the same size.  Previous versions of G++ tried to preserve
  unsignedness, but the standard mandates the current behavior.
! .SS "Options Controlling Objective-C and Objective\-\*(C+ Dialects"
  .IX Subsection "Options Controlling Objective-C and Objective- Dialects"
  (\s-1NOTE:\s0 This manual does not describe the Objective-C and Objective\-\*(C+
  languages themselves.
*************** For example, you might compile a file \f
*** 2815,2821 ****
  .PP
  In this example, \fB\-fgnu\-runtime\fR is an option meant only for
  Objective-C and Objective\-\*(C+ programs; you can use the other options with
! any language supported by \s-1GCC\s0.
  .PP
  Note that since Objective-C is an extension of the C language, Objective-C
  compilations may also use options specific to the C front-end (e.g.,
--- 2813,2819 ----
  .PP
  In this example, \fB\-fgnu\-runtime\fR is an option meant only for
  Objective-C and Objective\-\*(C+ programs; you can use the other options with
! any language supported by \s-1GCC.\s0
  .PP
  Note that since Objective-C is an extension of the C language, Objective-C
  compilations may also use options specific to the C front-end (e.g.,
*************** runtime.  This is the default for most t
*** 2840,2846 ****
  .IP "\fB\-fnext\-runtime\fR" 4
  .IX Item "-fnext-runtime"
  Generate output compatible with the NeXT runtime.  This is the default
! for NeXT-based systems, including Darwin and Mac \s-1OS\s0 X.  The macro
  \&\f(CW\*(C`_\|_NEXT_RUNTIME_\|_\*(C'\fR is predefined if (and only if) this option is
  used.
  .IP "\fB\-fno\-nil\-receivers\fR" 4
--- 2838,2844 ----
  .IP "\fB\-fnext\-runtime\fR" 4
  .IX Item "-fnext-runtime"
  Generate output compatible with the NeXT runtime.  This is the default
! for NeXT-based systems, including Darwin and Mac \s-1OS X.\s0  The macro
  \&\f(CW\*(C`_\|_NEXT_RUNTIME_\|_\*(C'\fR is predefined if (and only if) this option is
  used.
  .IP "\fB\-fno\-nil\-receivers\fR" 4
*************** This option is currently supported only
*** 2857,2863 ****
  case, Version 0 is the traditional (32\-bit) \s-1ABI\s0 without support for
  properties and other Objective-C 2.0 additions.  Version 1 is the
  traditional (32\-bit) \s-1ABI\s0 with support for properties and other
! Objective-C 2.0 additions.  Version 2 is the modern (64\-bit) \s-1ABI\s0.  If
  nothing is specified, the default is Version 0 on 32\-bit target
  machines, and Version 2 on 64\-bit target machines.
  .IP "\fB\-fobjc\-call\-cxx\-cdtors\fR" 4
--- 2855,2861 ----
  case, Version 0 is the traditional (32\-bit) \s-1ABI\s0 without support for
  properties and other Objective-C 2.0 additions.  Version 1 is the
  traditional (32\-bit) \s-1ABI\s0 with support for properties and other
! Objective-C 2.0 additions.  Version 2 is the modern (64\-bit) \s-1ABI.\s0  If
  nothing is specified, the default is Version 0 on 32\-bit target
  machines, and Version 2 on 64\-bit target machines.
  .IP "\fB\-fobjc\-call\-cxx\-cdtors\fR" 4
*************** by the runtime immediately after a new o
*** 2881,2887 ****
  the \f(CW\*(C`\- (void) .cxx_destruct\*(C'\fR methods are invoked immediately
  before the runtime deallocates an object instance.
  .Sp
! As of this writing, only the NeXT runtime on Mac \s-1OS\s0 X 10.4 and later has
  support for invoking the \f(CW\*(C`\- (id) .cxx_construct\*(C'\fR and
  \&\f(CW\*(C`\- (void) .cxx_destruct\*(C'\fR methods.
  .IP "\fB\-fobjc\-direct\-dispatch\fR" 4
--- 2879,2885 ----
  the \f(CW\*(C`\- (void) .cxx_destruct\*(C'\fR methods are invoked immediately
  before the runtime deallocates an object instance.
  .Sp
! As of this writing, only the NeXT runtime on Mac \s-1OS X 10.4\s0 and later has
  support for invoking the \f(CW\*(C`\- (id) .cxx_construct\*(C'\fR and
  \&\f(CW\*(C`\- (void) .cxx_destruct\*(C'\fR methods.
  .IP "\fB\-fobjc\-direct\-dispatch\fR" 4
*************** is required to use the Objective-C keywo
*** 2896,2902 ****
  \&\f(CW@throw\fR, \f(CW@catch\fR, \f(CW@finally\fR and
  \&\f(CW@synchronized\fR.  This option is available with both the \s-1GNU\s0
  runtime and the NeXT runtime (but not available in conjunction with
! the NeXT runtime on Mac \s-1OS\s0 X 10.2 and earlier).
  .IP "\fB\-fobjc\-gc\fR" 4
  .IX Item "-fobjc-gc"
  Enable garbage collection (\s-1GC\s0) in Objective-C and Objective\-\*(C+
--- 2894,2900 ----
  \&\f(CW@throw\fR, \f(CW@catch\fR, \f(CW@finally\fR and
  \&\f(CW@synchronized\fR.  This option is available with both the \s-1GNU\s0
  runtime and the NeXT runtime (but not available in conjunction with
! the NeXT runtime on Mac \s-1OS X 10.2\s0 and earlier).
  .IP "\fB\-fobjc\-gc\fR" 4
  .IX Item "-fobjc-gc"
  Enable garbage collection (\s-1GC\s0) in Objective-C and Objective\-\*(C+
*************** programs.  This option is only available
*** 2905,2927 ****
  does not require special compiler flags.
  .IP "\fB\-fobjc\-nilcheck\fR" 4
  .IX Item "-fobjc-nilcheck"
! For the NeXT runtime with version 2 of the \s-1ABI\s0, check for a nil
  receiver in method invocations before doing the actual method call.
  This is the default and can be disabled using
  \&\fB\-fno\-objc\-nilcheck\fR.  Class methods and super calls are never
  checked for nil in this way no matter what this flag is set to.
  Currently this flag does nothing when the \s-1GNU\s0 runtime, or an older
! version of the NeXT runtime \s-1ABI\s0, is used.
  .IP "\fB\-fobjc\-std=objc1\fR" 4
  .IX Item "-fobjc-std=objc1"
  Conform to the language syntax of Objective-C 1.0, the language
! recognized by \s-1GCC\s0 4.0.  This only affects the Objective-C additions to
  the C/\*(C+ language; it does not affect conformance to C/\*(C+ standards,
  which is controlled by the separate C/\*(C+ dialect option flags.  When
  this option is used with the Objective-C or Objective\-\*(C+ compiler,
! any Objective-C syntax that is not recognized by \s-1GCC\s0 4.0 is rejected.
  This is useful if you need to make sure that your Objective-C code can
! be compiled with older versions of \s-1GCC\s0.
  .IP "\fB\-freplace\-objc\-classes\fR" 4
  .IX Item "-freplace-objc-classes"
  Emit a special marker instructing \fB\f(BIld\fB\|(1)\fR not to statically link in
--- 2903,2925 ----
  does not require special compiler flags.
  .IP "\fB\-fobjc\-nilcheck\fR" 4
  .IX Item "-fobjc-nilcheck"
! For the NeXT runtime with version 2 of the \s-1ABI,\s0 check for a nil
  receiver in method invocations before doing the actual method call.
  This is the default and can be disabled using
  \&\fB\-fno\-objc\-nilcheck\fR.  Class methods and super calls are never
  checked for nil in this way no matter what this flag is set to.
  Currently this flag does nothing when the \s-1GNU\s0 runtime, or an older
! version of the NeXT runtime \s-1ABI,\s0 is used.
  .IP "\fB\-fobjc\-std=objc1\fR" 4
  .IX Item "-fobjc-std=objc1"
  Conform to the language syntax of Objective-C 1.0, the language
! recognized by \s-1GCC 4.0.\s0  This only affects the Objective-C additions to
  the C/\*(C+ language; it does not affect conformance to C/\*(C+ standards,
  which is controlled by the separate C/\*(C+ dialect option flags.  When
  this option is used with the Objective-C or Objective\-\*(C+ compiler,
! any Objective-C syntax that is not recognized by \s-1GCC 4.0\s0 is rejected.
  This is useful if you need to make sure that your Objective-C code can
! be compiled with older versions of \s-1GCC.\s0
  .IP "\fB\-freplace\-objc\-classes\fR" 4
  .IX Item "-freplace-objc-classes"
  Emit a special marker instructing \fB\f(BIld\fB\|(1)\fR not to statically link in
*************** run time instead.  This is used in conju
*** 2930,2936 ****
  debugging mode, where the object file in question may be recompiled and
  dynamically reloaded in the course of program execution, without the need
  to restart the program itself.  Currently, Fix-and-Continue functionality
! is only available in conjunction with the NeXT runtime on Mac \s-1OS\s0 X 10.3
  and later.
  .IP "\fB\-fzero\-link\fR" 4
  .IX Item "-fzero-link"
--- 2928,2934 ----
  debugging mode, where the object file in question may be recompiled and
  dynamically reloaded in the course of program execution, without the need
  to restart the program itself.  Currently, Fix-and-Continue functionality
! is only available in conjunction with the NeXT runtime on Mac \s-1OS X 10.3\s0
  and later.
  .IP "\fB\-fzero\-link\fR" 4
  .IX Item "-fzero-link"
*************** that methods and selectors must be decla
*** 3009,3015 ****
  .IX Item "-print-objc-runtime-info"
  Generate C header describing the largest structure that is passed by
  value, if any.
! .Sh "Options to Control Diagnostic Messages Formatting"
  .IX Subsection "Options to Control Diagnostic Messages Formatting"
  Traditionally, diagnostic messages have been formatted irrespective of
  the output device's aspect (e.g. its width, ...).  You can use the
--- 3007,3013 ----
  .IX Item "-print-objc-runtime-info"
  Generate C header describing the largest structure that is passed by
  value, if any.
! .SS "Options to Control Diagnostic Messages Formatting"
  .IX Subsection "Options to Control Diagnostic Messages Formatting"
  Traditionally, diagnostic messages have been formatted irrespective of
  the output device's aspect (e.g. its width, ...).  You can use the
*************** information.  The source line is truncat
*** 3131,3144 ****
  the \fB\-fmessage\-length=n\fR option is given.  When the output is done
  to the terminal, the width is limited to the width given by the
  \&\fB\s-1COLUMNS\s0\fR environment variable or, if not set, to the terminal width.
! .Sh "Options to Request or Suppress Warnings"
  .IX Subsection "Options to Request or Suppress Warnings"
  Warnings are diagnostic messages that report constructions that
  are not inherently erroneous but that are risky or suggest there
  may have been an error.
  .PP
  The following language-independent options do not enable specific
! warnings but control the kinds of diagnostics produced by \s-1GCC\s0.
  .IP "\fB\-fsyntax\-only\fR" 4
  .IX Item "-fsyntax-only"
  Check the code for syntax errors, but don't do anything beyond that.
--- 3129,3142 ----
  the \fB\-fmessage\-length=n\fR option is given.  When the output is done
  to the terminal, the width is limited to the width given by the
  \&\fB\s-1COLUMNS\s0\fR environment variable or, if not set, to the terminal width.
! .SS "Options to Request or Suppress Warnings"
  .IX Subsection "Options to Request or Suppress Warnings"
  Warnings are diagnostic messages that report constructions that
  are not inherently erroneous but that are risky or suggest there
  may have been an error.
  .PP
  The following language-independent options do not enable specific
! warnings but control the kinds of diagnostics produced by \s-1GCC.\s0
  .IP "\fB\-fsyntax\-only\fR" 4
  .IX Item "-fsyntax-only"
  Check the code for syntax errors, but don't do anything beyond that.
*************** warns that an unrecognized option is pre
*** 3213,3226 ****
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  .PD
! Issue all the warnings demanded by strict \s-1ISO\s0 C and \s-1ISO\s0 \*(C+;
  reject all programs that use forbidden extensions, and some other
! programs that do not follow \s-1ISO\s0 C and \s-1ISO\s0 \*(C+.  For \s-1ISO\s0 C, follows the
! version of the \s-1ISO\s0 C standard specified by any \fB\-std\fR option used.
  .Sp
! Valid \s-1ISO\s0 C and \s-1ISO\s0 \*(C+ programs should compile properly with or without
  this option (though a rare few require \fB\-ansi\fR or a
! \&\fB\-std\fR option specifying the required version of \s-1ISO\s0 C).  However,
  without this option, certain \s-1GNU\s0 extensions and traditional C and \*(C+
  features are supported as well.  With this option, they are rejected.
  .Sp
--- 3211,3224 ----
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  .PD
! Issue all the warnings demanded by strict \s-1ISO C\s0 and \s-1ISO \*(C+\s0;
  reject all programs that use forbidden extensions, and some other
! programs that do not follow \s-1ISO C\s0 and \s-1ISO \*(C+.\s0  For \s-1ISO C,\s0 follows the
! version of the \s-1ISO C\s0 standard specified by any \fB\-std\fR option used.
  .Sp
! Valid \s-1ISO C\s0 and \s-1ISO \*(C+\s0 programs should compile properly with or without
  this option (though a rare few require \fB\-ansi\fR or a
! \&\fB\-std\fR option specifying the required version of \s-1ISO C\s0).  However,
  without this option, certain \s-1GNU\s0 extensions and traditional C and \*(C+
  features are supported as well.  With this option, they are rejected.
  .Sp
*************** warnings are also disabled in the expres
*** 3230,3253 ****
  \&\f(CW\*(C`_\|_extension_\|_\*(C'\fR.  However, only system header files should use
  these escape routes; application programs should avoid them.
  .Sp
! Some users try to use \fB\-Wpedantic\fR to check programs for strict \s-1ISO\s0
! C conformance.  They soon find that it does not do quite what they want:
  it finds some non-ISO practices, but not all\-\-\-only those for which
! \&\s-1ISO\s0 C \fIrequires\fR a diagnostic, and some others for which
  diagnostics have been added.
  .Sp
! A feature to report any failure to conform to \s-1ISO\s0 C might be useful in
  some instances, but would require considerable additional work and would
  be quite different from \fB\-Wpedantic\fR.  We don't have plans to
  support such a feature in the near future.
  .Sp
  Where the standard specified with \fB\-std\fR represents a \s-1GNU\s0
  extended dialect of C, such as \fBgnu90\fR or \fBgnu99\fR, there is a
! corresponding \fIbase standard\fR, the version of \s-1ISO\s0 C on which the \s-1GNU\s0
  extended dialect is based.  Warnings from \fB\-Wpedantic\fR are given
  where they are required by the base standard.  (It does not make sense
! for such warnings to be given only for features not in the specified \s-1GNU\s0
! C dialect, since by definition the \s-1GNU\s0 dialects of C include all
  features the compiler supports with the given option, and there would be
  nothing to warn about.)
  .IP "\fB\-pedantic\-errors\fR" 4
--- 3228,3251 ----
  \&\f(CW\*(C`_\|_extension_\|_\*(C'\fR.  However, only system header files should use
  these escape routes; application programs should avoid them.
  .Sp
! Some users try to use \fB\-Wpedantic\fR to check programs for strict \s-1ISO
! C\s0 conformance.  They soon find that it does not do quite what they want:
  it finds some non-ISO practices, but not all\-\-\-only those for which
! \&\s-1ISO C\s0 \fIrequires\fR a diagnostic, and some others for which
  diagnostics have been added.
  .Sp
! A feature to report any failure to conform to \s-1ISO C\s0 might be useful in
  some instances, but would require considerable additional work and would
  be quite different from \fB\-Wpedantic\fR.  We don't have plans to
  support such a feature in the near future.
  .Sp
  Where the standard specified with \fB\-std\fR represents a \s-1GNU\s0
  extended dialect of C, such as \fBgnu90\fR or \fBgnu99\fR, there is a
! corresponding \fIbase standard\fR, the version of \s-1ISO C\s0 on which the \s-1GNU\s0
  extended dialect is based.  Warnings from \fB\-Wpedantic\fR are given
  where they are required by the base standard.  (It does not make sense
! for such warnings to be given only for features not in the specified \s-1GNU
! C\s0 dialect, since by definition the \s-1GNU\s0 dialects of C include all
  features the compiler supports with the given option, and there would be
  nothing to warn about.)
  .IP "\fB\-pedantic\-errors\fR" 4
*************** This warning is enabled by \fB\-Wall\fR.
*** 3359,3364 ****
--- 3357,3366 ----
  Warn whenever a comment-start sequence \fB/*\fR appears in a \fB/*\fR
  comment, or whenever a Backslash-Newline appears in a \fB//\fR comment.
  This warning is enabled by \fB\-Wall\fR.
+ .IP "\fB\-Wchkp\fR" 4
+ .IX Item "-Wchkp"
+ Warn about an invalid memory access that is found by Pointer Bounds Checker
+ (\fB\-fcheck\-pointer\-bounds\fR).
  .IP "\fB\-Wno\-coverage\-mismatch\fR" 4
  .IX Item "-Wno-coverage-mismatch"
  Warn if feedback profiles do not match when using the
*************** functions without the attribute specifie
*** 3419,3425 ****
  \&\fB\-ffreestanding\fR or \fB\-fno\-builtin\fR.
  .Sp
  The formats are checked against the format features supported by \s-1GNU\s0
! libc version 2.2.  These include all \s-1ISO\s0 C90 and C99 features, as well
  as features from the Single Unix Specification and some \s-1BSD\s0 and \s-1GNU\s0
  extensions.  Other library implementations may not support all these
  features; \s-1GCC\s0 does not support warning about features that go beyond a
--- 3421,3427 ----
  \&\fB\-ffreestanding\fR or \fB\-fno\-builtin\fR.
  .Sp
  The formats are checked against the format features supported by \s-1GNU\s0
! libc version 2.2.  These include all \s-1ISO C90\s0 and C99 features, as well
  as features from the Single Unix Specification and some \s-1BSD\s0 and \s-1GNU\s0
  extensions.  Other library implementations may not support all these
  features; \s-1GCC\s0 does not support warning about features that go beyond a
*************** enabled by default and it is made into a
*** 3535,3546 ****
  Same as \fB\-Wimplicit\-int\fR and \fB\-Wimplicit\-function\-declaration\fR.
  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wignored\-qualifiers\fR (C and \*(C+ only)" 4
! .IX Item "-Wignored-qualifiers (C and  only)"
  Warn if the return type of a function has a type qualifier
! such as \f(CW\*(C`const\*(C'\fR.  For \s-1ISO\s0 C such a type qualifier has no effect,
  since the value returned by a function is not an lvalue.
  For \*(C+, the warning is only emitted for scalar types or \f(CW\*(C`void\*(C'\fR.
! \&\s-1ISO\s0 C prohibits qualified \f(CW\*(C`void\*(C'\fR return types on function
  definitions, so such return types always receive a warning
  even without this option.
  .Sp
--- 3537,3548 ----
  Same as \fB\-Wimplicit\-int\fR and \fB\-Wimplicit\-function\-declaration\fR.
  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wignored\-qualifiers\fR (C and \*(C+ only)" 4
! .IX Item "-Wignored-qualifiers (C and only)"
  Warn if the return type of a function has a type qualifier
! such as \f(CW\*(C`const\*(C'\fR.  For \s-1ISO C\s0 such a type qualifier has no effect,
  since the value returned by a function is not an lvalue.
  For \*(C+, the warning is only emitted for scalar types or \f(CW\*(C`void\*(C'\fR.
! \&\s-1ISO C\s0 prohibits qualified \f(CW\*(C`void\*(C'\fR return types on function
  definitions, so such return types always receive a warning
  even without this option.
  .Sp
*************** expression to a type other than \f(CW\*(
*** 3727,3735 ****
  .Sp
  This warning is enabled by default for C and \*(C+ programs.
  .IP "\fB\-Wsync\-nand\fR (C and \*(C+ only)" 4
! .IX Item "-Wsync-nand (C and  only)"
  Warn when \f(CW\*(C`_\|_sync_fetch_and_nand\*(C'\fR and \f(CW\*(C`_\|_sync_nand_and_fetch\*(C'\fR
! built-in functions are used.  These functions changed semantics in \s-1GCC\s0 4.4.
  .IP "\fB\-Wtrigraphs\fR" 4
  .IX Item "-Wtrigraphs"
  Warn if any trigraphs are encountered that might change the meaning of
--- 3729,3737 ----
  .Sp
  This warning is enabled by default for C and \*(C+ programs.
  .IP "\fB\-Wsync\-nand\fR (C and \*(C+ only)" 4
! .IX Item "-Wsync-nand (C and only)"
  Warn when \f(CW\*(C`_\|_sync_fetch_and_nand\*(C'\fR and \f(CW\*(C`_\|_sync_nand_and_fetch\*(C'\fR
! built-in functions are used.  These functions changed semantics in \s-1GCC 4.4.\s0
  .IP "\fB\-Wtrigraphs\fR" 4
  .IX Item "-Wtrigraphs"
  Warn if any trigraphs are encountered that might change the meaning of
*************** This warning is enabled by \fB\-Wall\fR.
*** 3766,3772 ****
  .Sp
  To suppress this warning use the \f(CW\*(C`unused\*(C'\fR attribute.
  .IP "\fB\-Wunused\-local\-typedefs\fR (C, Objective-C, \*(C+ and Objective\-\*(C+ only)" 4
! .IX Item "-Wunused-local-typedefs (C, Objective-C,  and Objective- only)"
  Warn when a typedef locally defined in a function is not used.
  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wunused\-parameter\fR" 4
--- 3768,3774 ----
  .Sp
  To suppress this warning use the \f(CW\*(C`unused\*(C'\fR attribute.
  .IP "\fB\-Wunused\-local\-typedefs\fR (C, Objective-C, \*(C+ and Objective\-\*(C+ only)" 4
! .IX Item "-Wunused-local-typedefs (C, Objective-C, and Objective- only)"
  Warn when a typedef locally defined in a function is not used.
  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wunused\-parameter\fR" 4
*************** This warning is enabled by \fB\-Wall\fR
*** 3873,3879 ****
  .IP "\fB\-Wunknown\-pragmas\fR" 4
  .IX Item "-Wunknown-pragmas"
  Warn when a \f(CW\*(C`#pragma\*(C'\fR directive is encountered that is not understood by 
! \&\s-1GCC\s0.  If this command-line option is used, warnings are even issued
  for unknown pragmas in system header files.  This is not the case if
  the warnings are only enabled by the \fB\-Wall\fR command-line option.
  .IP "\fB\-Wno\-pragmas\fR" 4
--- 3875,3881 ----
  .IP "\fB\-Wunknown\-pragmas\fR" 4
  .IX Item "-Wunknown-pragmas"
  Warn when a \f(CW\*(C`#pragma\*(C'\fR directive is encountered that is not understood by 
! \&\s-1GCC.\s0  If this command-line option is used, warnings are even issued
  for unknown pragmas in system header files.  This is not the case if
  the warnings are only enabled by the \fB\-Wall\fR command-line option.
  .IP "\fB\-Wno\-pragmas\fR" 4
*************** probably mistaken.
*** 4151,4163 ****
  .IP "\fB\-Wtraditional\fR (C and Objective-C only)" 4
  .IX Item "-Wtraditional (C and Objective-C only)"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO\s0 C.  Also warn about \s-1ISO\s0 C constructs that have no traditional C
  equivalent, and/or problematic constructs that should be avoided.
  .RS 4
  .IP "*" 4
  Macro parameters that appear within string literals in the macro body.
  In traditional C macro replacement takes place within string literals,
! but in \s-1ISO\s0 C it does not.
  .IP "*" 4
  In traditional C, some preprocessor directives did not exist.
  Traditional preprocessors only considered a line to be a directive
--- 4153,4165 ----
  .IP "\fB\-Wtraditional\fR (C and Objective-C only)" 4
  .IX Item "-Wtraditional (C and Objective-C only)"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO C.\s0  Also warn about \s-1ISO C\s0 constructs that have no traditional C
  equivalent, and/or problematic constructs that should be avoided.
  .RS 4
  .IP "*" 4
  Macro parameters that appear within string literals in the macro body.
  In traditional C macro replacement takes place within string literals,
! but in \s-1ISO C\s0 it does not.
  .IP "*" 4
  In traditional C, some preprocessor directives did not exist.
  Traditional preprocessors only considered a line to be a directive
*************** versa.  The absence of these prototypes
*** 4212,4220 ****
  C causes serious problems.  This is a subset of the possible
  conversion warnings; for the full set use \fB\-Wtraditional\-conversion\fR.
  .IP "*" 4
! Use of \s-1ISO\s0 C style function definitions.  This warning intentionally is
  \&\fInot\fR issued for prototype declarations or variadic functions
! because these \s-1ISO\s0 C features appear in your code when using
  libiberty's traditional C compatibility macros, \f(CW\*(C`PARAMS\*(C'\fR and
  \&\f(CW\*(C`VPARAMS\*(C'\fR.  This warning is also bypassed for nested functions
  because that feature is already a \s-1GCC\s0 extension and thus not relevant to
--- 4214,4222 ----
  C causes serious problems.  This is a subset of the possible
  conversion warnings; for the full set use \fB\-Wtraditional\-conversion\fR.
  .IP "*" 4
! Use of \s-1ISO C\s0 style function definitions.  This warning intentionally is
  \&\fInot\fR issued for prototype declarations or variadic functions
! because these \s-1ISO C\s0 features appear in your code when using
  libiberty's traditional C compatibility macros, \f(CW\*(C`PARAMS\*(C'\fR and
  \&\f(CW\*(C`VPARAMS\*(C'\fR.  This warning is also bypassed for nested functions
  because that feature is already a \s-1GCC\s0 extension and thus not relevant to
*************** except when the same as the default prom
*** 4232,4239 ****
  .IP "\fB\-Wdeclaration\-after\-statement\fR (C and Objective-C only)" 4
  .IX Item "-Wdeclaration-after-statement (C and Objective-C only)"
  Warn when a declaration is found after a statement in a block.  This
! construct, known from \*(C+, was introduced with \s-1ISO\s0 C99 and is by default
! allowed in \s-1GCC\s0.  It is not supported by \s-1ISO\s0 C90.
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
  Warn if an undefined identifier is evaluated in an \f(CW\*(C`#if\*(C'\fR directive.
--- 4234,4241 ----
  .IP "\fB\-Wdeclaration\-after\-statement\fR (C and Objective-C only)" 4
  .IX Item "-Wdeclaration-after-statement (C and Objective-C only)"
  Warn when a declaration is found after a statement in a block.  This
! construct, known from \*(C+, was introduced with \s-1ISO C99\s0 and is by default
! allowed in \s-1GCC.\s0  It is not supported by \s-1ISO C90.\s0
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
  Warn if an undefined identifier is evaluated in an \f(CW\*(C`#if\*(C'\fR directive.
*************** which depend on the \s-1MS\s0 runtime.
*** 4315,4321 ****
  .IP "\fB\-Wpointer\-arith\fR" 4
  .IX Item "-Wpointer-arith"
  Warn about anything that depends on the \*(L"size of\*(R" a function type or
! of \f(CW\*(C`void\*(C'\fR.  \s-1GNU\s0 C assigns these types a size of 1, for
  convenience in calculations with \f(CW\*(C`void *\*(C'\fR pointers and pointers
  to functions.  In \*(C+, warn also when an arithmetic operation involves
  \&\f(CW\*(C`NULL\*(C'\fR.  This warning is also enabled by \fB\-Wpedantic\fR.
--- 4317,4323 ----
  .IP "\fB\-Wpointer\-arith\fR" 4
  .IX Item "-Wpointer-arith"
  Warn about anything that depends on the \*(L"size of\*(R" a function type or
! of \f(CW\*(C`void\*(C'\fR.  \s-1GNU C\s0 assigns these types a size of 1, for
  convenience in calculations with \f(CW\*(C`void *\*(C'\fR pointers and pointers
  to functions.  In \*(C+, warn also when an arithmetic operation involves
  \&\f(CW\*(C`NULL\*(C'\fR.  This warning is also enabled by \fB\-Wpedantic\fR.
*************** For example, warn if a call to a functio
*** 4333,4346 ****
  is cast to a pointer type.
  .IP "\fB\-Wc90\-c99\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc90-c99-compat (C and Objective-C only)"
! Warn about features not present in \s-1ISO\s0 C90, but present in \s-1ISO\s0 C99.
  For instance, warn about use of variable length arrays, \f(CW\*(C`long long\*(C'\fR
  type, \f(CW\*(C`bool\*(C'\fR type, compound literals, designated initializers, and so
  on.  This option is independent of the standards mode.  Warnings are disabled
  in the expression that follows \f(CW\*(C`_\|_extension_\|_\*(C'\fR.
  .IP "\fB\-Wc99\-c11\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc99-c11-compat (C and Objective-C only)"
! Warn about features not present in \s-1ISO\s0 C99, but present in \s-1ISO\s0 C11.
  For instance, warn about use of anonymous structures and unions,
  \&\f(CW\*(C`_Atomic\*(C'\fR type qualifier, \f(CW\*(C`_Thread_local\*(C'\fR storage-class specifier,
  \&\f(CW\*(C`_Alignas\*(C'\fR specifier, \f(CW\*(C`Alignof\*(C'\fR operator, \f(CW\*(C`_Generic\*(C'\fR keyword,
--- 4335,4348 ----
  is cast to a pointer type.
  .IP "\fB\-Wc90\-c99\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc90-c99-compat (C and Objective-C only)"
! Warn about features not present in \s-1ISO C90,\s0 but present in \s-1ISO C99.\s0
  For instance, warn about use of variable length arrays, \f(CW\*(C`long long\*(C'\fR
  type, \f(CW\*(C`bool\*(C'\fR type, compound literals, designated initializers, and so
  on.  This option is independent of the standards mode.  Warnings are disabled
  in the expression that follows \f(CW\*(C`_\|_extension_\|_\*(C'\fR.
  .IP "\fB\-Wc99\-c11\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc99-c11-compat (C and Objective-C only)"
! Warn about features not present in \s-1ISO C99,\s0 but present in \s-1ISO C11.\s0
  For instance, warn about use of anonymous structures and unions,
  \&\f(CW\*(C`_Atomic\*(C'\fR type qualifier, \f(CW\*(C`_Thread_local\*(C'\fR storage-class specifier,
  \&\f(CW\*(C`_Alignas\*(C'\fR specifier, \f(CW\*(C`Alignof\*(C'\fR operator, \f(CW\*(C`_Generic\*(C'\fR keyword,
*************** and so on.  This option is independent o
*** 4348,4366 ****
  disabled in the expression that follows \f(CW\*(C`_\|_extension_\|_\*(C'\fR.
  .IP "\fB\-Wc++\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc++-compat (C and Objective-C only)"
! Warn about \s-1ISO\s0 C constructs that are outside of the common subset of
! \&\s-1ISO\s0 C and \s-1ISO\s0 \*(C+, e.g. request for implicit conversion from
  \&\f(CW\*(C`void *\*(C'\fR to a pointer to non\-\f(CW\*(C`void\*(C'\fR type.
  .IP "\fB\-Wc++11\-compat\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wc++11-compat ( and Objective- only)"
! Warn about \*(C+ constructs whose meaning differs between \s-1ISO\s0 \*(C+ 1998
! and \s-1ISO\s0 \*(C+ 2011, e.g., identifiers in \s-1ISO\s0 \*(C+ 1998 that are keywords
! in \s-1ISO\s0 \*(C+ 2011.  This warning turns on \fB\-Wnarrowing\fR and is
  enabled by \fB\-Wall\fR.
  .IP "\fB\-Wc++14\-compat\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wc++14-compat ( and Objective- only)"
! Warn about \*(C+ constructs whose meaning differs between \s-1ISO\s0 \*(C+ 2011
! and \s-1ISO\s0 \*(C+ 2014.  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wcast\-qual\fR" 4
  .IX Item "-Wcast-qual"
  Warn whenever a pointer is cast so as to remove a type qualifier from
--- 4350,4368 ----
  disabled in the expression that follows \f(CW\*(C`_\|_extension_\|_\*(C'\fR.
  .IP "\fB\-Wc++\-compat\fR (C and Objective-C only)" 4
  .IX Item "-Wc++-compat (C and Objective-C only)"
! Warn about \s-1ISO C\s0 constructs that are outside of the common subset of
! \&\s-1ISO C\s0 and \s-1ISO \*(C+,\s0 e.g. request for implicit conversion from
  \&\f(CW\*(C`void *\*(C'\fR to a pointer to non\-\f(CW\*(C`void\*(C'\fR type.
  .IP "\fB\-Wc++11\-compat\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wc++11-compat ( and Objective- only)"
! Warn about \*(C+ constructs whose meaning differs between \s-1ISO \*(C+ 1998\s0
! and \s-1ISO \*(C+ 2011,\s0 e.g., identifiers in \s-1ISO \*(C+ 1998\s0 that are keywords
! in \s-1ISO \*(C+ 2011.\s0  This warning turns on \fB\-Wnarrowing\fR and is
  enabled by \fB\-Wall\fR.
  .IP "\fB\-Wc++14\-compat\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wc++14-compat ( and Objective- only)"
! Warn about \*(C+ constructs whose meaning differs between \s-1ISO \*(C+ 2011\s0
! and \s-1ISO \*(C+ 2014.\s0  This warning is enabled by \fB\-Wall\fR.
  .IP "\fB\-Wcast\-qual\fR" 4
  .IX Item "-Wcast-qual"
  Warn whenever a pointer is cast so as to remove a type qualifier from
*************** Usually they indicate a typo in the user
*** 4663,4687 ****
  implementation-defined values, and should not be used in portable code.
  .IP "\fB\-Wnormalized\fR[\fB=\fR<\fBnone\fR|\fBid\fR|\fBnfc\fR|\fBnfkc\fR>]" 4
  .IX Item "-Wnormalized[=<none|id|nfc|nfkc>]"
! In \s-1ISO\s0 C and \s-1ISO\s0 \*(C+, two identifiers are different if they are
  different sequences of characters.  However, sometimes when characters
  outside the basic \s-1ASCII\s0 character set are used, you can have two
  different character sequences that look the same.  To avoid confusion,
! the \s-1ISO\s0 10646 standard sets out some \fInormalization rules\fR which
  when applied ensure that two sequences that look the same are turned into
  the same sequence.  \s-1GCC\s0 can warn you if you are using identifiers that
  have not been normalized; this option controls that warning.
  .Sp
! There are four levels of warning supported by \s-1GCC\s0.  The default is
  \&\fB\-Wnormalized=nfc\fR, which warns about any identifier that is
! not in the \s-1ISO\s0 10646 \*(L"C\*(R" normalized form, \fI\s-1NFC\s0\fR.  \s-1NFC\s0 is the
  recommended form for most uses.  It is equivalent to
  \&\fB\-Wnormalized\fR.
  .Sp
  Unfortunately, there are some characters allowed in identifiers by
! \&\s-1ISO\s0 C and \s-1ISO\s0 \*(C+ that, when turned into \s-1NFC\s0, are not allowed in 
  identifiers.  That is, there's no way to use these symbols in portable
! \&\s-1ISO\s0 C or \*(C+ and have all your identifiers in \s-1NFC\s0.
  \&\fB\-Wnormalized=id\fR suppresses the warning for these characters.
  It is hoped that future versions of the standards involved will correct
  this, which is why this option is not the default.
--- 4665,4689 ----
  implementation-defined values, and should not be used in portable code.
  .IP "\fB\-Wnormalized\fR[\fB=\fR<\fBnone\fR|\fBid\fR|\fBnfc\fR|\fBnfkc\fR>]" 4
  .IX Item "-Wnormalized[=<none|id|nfc|nfkc>]"
! In \s-1ISO C\s0 and \s-1ISO \*(C+,\s0 two identifiers are different if they are
  different sequences of characters.  However, sometimes when characters
  outside the basic \s-1ASCII\s0 character set are used, you can have two
  different character sequences that look the same.  To avoid confusion,
! the \s-1ISO 10646\s0 standard sets out some \fInormalization rules\fR which
  when applied ensure that two sequences that look the same are turned into
  the same sequence.  \s-1GCC\s0 can warn you if you are using identifiers that
  have not been normalized; this option controls that warning.
  .Sp
! There are four levels of warning supported by \s-1GCC.\s0  The default is
  \&\fB\-Wnormalized=nfc\fR, which warns about any identifier that is
! not in the \s-1ISO 10646 \*(L"C\*(R"\s0 normalized form, \fI\s-1NFC\s0\fR.  \s-1NFC\s0 is the
  recommended form for most uses.  It is equivalent to
  \&\fB\-Wnormalized\fR.
  .Sp
  Unfortunately, there are some characters allowed in identifiers by
! \&\s-1ISO C\s0 and \s-1ISO \*(C+\s0 that, when turned into \s-1NFC,\s0 are not allowed in 
  identifiers.  That is, there's no way to use these symbols in portable
! \&\s-1ISO C\s0 or \*(C+ and have all your identifiers in \s-1NFC.\s0
  \&\fB\-Wnormalized=id\fR suppresses the warning for these characters.
  It is hoped that future versions of the standards involved will correct
  this, which is why this option is not the default.
*************** only do this if you are using some other
*** 4692,4702 ****
  \&\*(L"D\*(R"), because otherwise you can easily create bugs that are
  literally impossible to see.
  .Sp
! Some characters in \s-1ISO\s0 10646 have distinct meanings but look identical
  in some fonts or display methodologies, especially once formatting has
! been applied.  For instance \f(CW\*(C`\eu207F\*(C'\fR, \*(L"\s-1SUPERSCRIPT\s0 \s-1LATIN\s0 \s-1SMALL\s0
! \&\s-1LETTER\s0 N\*(R", displays just like a regular \f(CW\*(C`n\*(C'\fR that has been
! placed in a superscript.  \s-1ISO\s0 10646 defines the \fI\s-1NFKC\s0\fR
  normalization scheme to convert all these into a standard form as
  well, and \s-1GCC\s0 warns if your code is not in \s-1NFKC\s0 if you use
  \&\fB\-Wnormalized=nfkc\fR.  This warning is comparable to warning
--- 4694,4704 ----
  \&\*(L"D\*(R"), because otherwise you can easily create bugs that are
  literally impossible to see.
  .Sp
! Some characters in \s-1ISO 10646\s0 have distinct meanings but look identical
  in some fonts or display methodologies, especially once formatting has
! been applied.  For instance \f(CW\*(C`\eu207F\*(C'\fR, \*(L"\s-1SUPERSCRIPT LATIN SMALL
! LETTER N\*(R",\s0 displays just like a regular \f(CW\*(C`n\*(C'\fR that has been
! placed in a superscript.  \s-1ISO 10646\s0 defines the \fI\s-1NFKC\s0\fR
  normalization scheme to convert all these into a standard form as
  well, and \s-1GCC\s0 warns if your code is not in \s-1NFKC\s0 if you use
  \&\fB\-Wnormalized=nfkc\fR.  This warning is comparable to warning
*************** have the packed attribute:
*** 4754,4762 ****
  .IP "\fB\-Wpacked\-bitfield\-compat\fR" 4
  .IX Item "-Wpacked-bitfield-compat"
  The 4.1, 4.2 and 4.3 series of \s-1GCC\s0 ignore the \f(CW\*(C`packed\*(C'\fR attribute
! on bit-fields of type \f(CW\*(C`char\*(C'\fR.  This has been fixed in \s-1GCC\s0 4.4 but
  the change can lead to differences in the structure layout.  \s-1GCC\s0
! informs you when the offset of such a field has changed in \s-1GCC\s0 4.4.
  For example there is no longer a 4\-bit padding between field \f(CW\*(C`a\*(C'\fR
  and \f(CW\*(C`b\*(C'\fR in this structure:
  .Sp
--- 4756,4764 ----
  .IP "\fB\-Wpacked\-bitfield\-compat\fR" 4
  .IX Item "-Wpacked-bitfield-compat"
  The 4.1, 4.2 and 4.3 series of \s-1GCC\s0 ignore the \f(CW\*(C`packed\*(C'\fR attribute
! on bit-fields of type \f(CW\*(C`char\*(C'\fR.  This has been fixed in \s-1GCC 4.4\s0 but
  the change can lead to differences in the structure layout.  \s-1GCC\s0
! informs you when the offset of such a field has changed in \s-1GCC 4.4.\s0
  For example there is no longer a 4\-bit padding between field \f(CW\*(C`a\*(C'\fR
  and \f(CW\*(C`b\*(C'\fR in this structure:
  .Sp
*************** warnings produced by \fB\-Winline\fR to
*** 4803,4809 ****
  .IP "\fB\-Wno\-invalid\-offsetof\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wno-invalid-offsetof ( and Objective- only)"
  Suppress warnings from applying the \f(CW\*(C`offsetof\*(C'\fR macro to a non-POD
! type.  According to the 2014 \s-1ISO\s0 \*(C+ standard, applying \f(CW\*(C`offsetof\*(C'\fR
  to a non-standard-layout type is undefined.  In existing \*(C+ implementations,
  however, \f(CW\*(C`offsetof\*(C'\fR typically gives meaningful results.
  This flag is for users who are aware that they are
--- 4805,4811 ----
  .IP "\fB\-Wno\-invalid\-offsetof\fR (\*(C+ and Objective\-\*(C+ only)" 4
  .IX Item "-Wno-invalid-offsetof ( and Objective- only)"
  Suppress warnings from applying the \f(CW\*(C`offsetof\*(C'\fR macro to a non-POD
! type.  According to the 2014 \s-1ISO \*(C+\s0 standard, applying \f(CW\*(C`offsetof\*(C'\fR
  to a non-standard-layout type is undefined.  In existing \*(C+ implementations,
  however, \f(CW\*(C`offsetof\*(C'\fR typically gives meaningful results.
  This flag is for users who are aware that they are
*************** the search path but can't be used.
*** 4828,4839 ****
  .IP "\fB\-Wlong\-long\fR" 4
  .IX Item "-Wlong-long"
  Warn if \f(CW\*(C`long long\*(C'\fR type is used.  This is enabled by either
! \&\fB\-Wpedantic\fR or \fB\-Wtraditional\fR in \s-1ISO\s0 C90 and \*(C+98
  modes.  To inhibit the warning messages, use \fB\-Wno\-long\-long\fR.
  .IP "\fB\-Wvariadic\-macros\fR" 4
  .IX Item "-Wvariadic-macros"
! Warn if variadic macros are used in \s-1ISO\s0 C90 mode, or if the \s-1GNU\s0
! alternate syntax is used in \s-1ISO\s0 C99 mode.  This is enabled by either
  \&\fB\-Wpedantic\fR or \fB\-Wtraditional\fR.  To inhibit the warning
  messages, use \fB\-Wno\-variadic\-macros\fR.
  .IP "\fB\-Wvarargs\fR" 4
--- 4830,4841 ----
  .IP "\fB\-Wlong\-long\fR" 4
  .IX Item "-Wlong-long"
  Warn if \f(CW\*(C`long long\*(C'\fR type is used.  This is enabled by either
! \&\fB\-Wpedantic\fR or \fB\-Wtraditional\fR in \s-1ISO C90\s0 and \*(C+98
  modes.  To inhibit the warning messages, use \fB\-Wno\-long\-long\fR.
  .IP "\fB\-Wvariadic\-macros\fR" 4
  .IX Item "-Wvariadic-macros"
! Warn if variadic macros are used in \s-1ISO C90\s0 mode, or if the \s-1GNU\s0
! alternate syntax is used in \s-1ISO C99\s0 mode.  This is enabled by either
  \&\fB\-Wpedantic\fR or \fB\-Wtraditional\fR.  To inhibit the warning
  messages, use \fB\-Wno\-variadic\-macros\fR.
  .IP "\fB\-Wvarargs\fR" 4
*************** standard's minimum limit, but very porta
*** 4897,4903 ****
  using longer strings.
  .Sp
  The limit applies \fIafter\fR string constant concatenation, and does
! not count the trailing \s-1NUL\s0.  In C90, the limit was 509 characters; in
  C99, it was raised to 4095.  \*(C+98 does not specify a normative
  minimum maximum, so we do not diagnose overlength strings in \*(C+.
  .Sp
--- 4899,4905 ----
  using longer strings.
  .Sp
  The limit applies \fIafter\fR string constant concatenation, and does
! not count the trailing \s-1NUL.\s0  In C90, the limit was 509 characters; in
  C99, it was raised to 4095.  \*(C+98 does not specify a normative
  minimum maximum, so we do not diagnose overlength strings in \*(C+.
  .Sp
*************** from the decimal floating-point extensio
*** 4915,4928 ****
  Suppress warnings when a positional initializer is used to initialize
  a structure that has been marked with the \f(CW\*(C`designated_init\*(C'\fR
  attribute.
! .Sh "Options for Debugging Your Program or \s-1GCC\s0"
  .IX Subsection "Options for Debugging Your Program or GCC"
  \&\s-1GCC\s0 has various special options that are used for debugging
  either your program or \s-1GCC:\s0
  .IP "\fB\-g\fR" 4
  .IX Item "-g"
  Produce debugging information in the operating system's native format
! (stabs, \s-1COFF\s0, \s-1XCOFF\s0, or \s-1DWARF\s0 2).  \s-1GDB\s0 can work with this debugging
  information.
  .Sp
  On most systems that use stabs format, \fB\-g\fR enables use of extra
--- 4917,4930 ----
  Suppress warnings when a positional initializer is used to initialize
  a structure that has been marked with the \f(CW\*(C`designated_init\*(C'\fR
  attribute.
! .SS "Options for Debugging Your Program or \s-1GCC\s0"
  .IX Subsection "Options for Debugging Your Program or GCC"
  \&\s-1GCC\s0 has various special options that are used for debugging
  either your program or \s-1GCC:\s0
  .IP "\fB\-g\fR" 4
  .IX Item "-g"
  Produce debugging information in the operating system's native format
! (stabs, \s-1COFF, XCOFF,\s0 or \s-1DWARF 2\s0).  \s-1GDB\s0 can work with this debugging
  information.
  .Sp
  On most systems that use stabs format, \fB\-g\fR enables use of extra
*************** be useful, this option requires a debugg
*** 4955,4962 ****
  files.
  .IP "\fB\-ggdb\fR" 4
  .IX Item "-ggdb"
! Produce debugging information for use by \s-1GDB\s0.  This means to use the
! most expressive format available (\s-1DWARF\s0 2, stabs, or the native format
  if neither of those are supported), including \s-1GDB\s0 extensions if at all
  possible.
  .IP "\fB\-gpubnames\fR" 4
--- 4957,4964 ----
  files.
  .IP "\fB\-ggdb\fR" 4
  .IX Item "-ggdb"
! Produce debugging information for use by \s-1GDB.\s0  This means to use the
! most expressive format available (\s-1DWARF 2,\s0 stabs, or the native format
  if neither of those are supported), including \s-1GDB\s0 extensions if at all
  possible.
  .IP "\fB\-gpubnames\fR" 4
*************** with a linker that can produce \s-1GDB\s
*** 4971,4978 ****
  .IX Item "-gstabs"
  Produce debugging information in stabs format (if that is supported),
  without \s-1GDB\s0 extensions.  This is the format used by \s-1DBX\s0 on most \s-1BSD\s0
! systems.  On \s-1MIPS\s0, Alpha and System V Release 4 systems this option
! produces stabs debugging output that is not understood by \s-1DBX\s0 or \s-1SDB\s0.
  On System V Release 4 systems this option requires the \s-1GNU\s0 assembler.
  .IP "\fB\-feliminate\-unused\-debug\-symbols\fR" 4
  .IX Item "-feliminate-unused-debug-symbols"
--- 4973,4980 ----
  .IX Item "-gstabs"
  Produce debugging information in stabs format (if that is supported),
  without \s-1GDB\s0 extensions.  This is the format used by \s-1DBX\s0 on most \s-1BSD\s0
! systems.  On \s-1MIPS,\s0 Alpha and System V Release 4 systems this option
! produces stabs debugging output that is not understood by \s-1DBX\s0 or \s-1SDB.\s0
  On System V Release 4 systems this option requires the \s-1GNU\s0 assembler.
  .IP "\fB\-feliminate\-unused\-debug\-symbols\fR" 4
  .IX Item "-feliminate-unused-debug-symbols"
*************** System V Release 4.
*** 5009,5015 ****
  .IP "\fB\-gxcoff\fR" 4
  .IX Item "-gxcoff"
  Produce debugging information in \s-1XCOFF\s0 format (if that is supported).
! This is the format used by the \s-1DBX\s0 debugger on \s-1IBM\s0 \s-1RS/6000\s0 systems.
  .IP "\fB\-gxcoff+\fR" 4
  .IX Item "-gxcoff+"
  Produce debugging information in \s-1XCOFF\s0 format (if that is supported),
--- 5011,5017 ----
  .IP "\fB\-gxcoff\fR" 4
  .IX Item "-gxcoff"
  Produce debugging information in \s-1XCOFF\s0 format (if that is supported).
! This is the format used by the \s-1DBX\s0 debugger on \s-1IBM RS/6000\s0 systems.
  .IP "\fB\-gxcoff+\fR" 4
  .IX Item "-gxcoff+"
  Produce debugging information in \s-1XCOFF\s0 format (if that is supported),
*************** The value of \fIversion\fR may be either
*** 5024,5032 ****
  for most targets is 4.  \s-1DWARF\s0 Version 5 is only experimental.
  .Sp
  Note that with \s-1DWARF\s0 Version 2, some ports require and always
! use some non-conflicting \s-1DWARF\s0 3 extensions in the unwind tables.
  .Sp
! Version 4 may require \s-1GDB\s0 7.0 and \fB\-fvar\-tracking\-assignments\fR
  for maximum benefit.
  .IP "\fB\-grecord\-gcc\-switches\fR" 4
  .IX Item "-grecord-gcc-switches"
--- 5026,5034 ----
  for most targets is 4.  \s-1DWARF\s0 Version 5 is only experimental.
  .Sp
  Note that with \s-1DWARF\s0 Version 2, some ports require and always
! use some non-conflicting \s-1DWARF 3\s0 extensions in the unwind tables.
  .Sp
! Version 4 may require \s-1GDB 7.0\s0 and \fB\-fvar\-tracking\-assignments\fR
  for maximum benefit.
  .IP "\fB\-grecord\-gcc\-switches\fR" 4
  .IX Item "-grecord-gcc-switches"
*************** debug information in version 1 of the \s
*** 5099,5105 ****
  different from version 2), and it would have been too confusing.  That
  debug format is long obsolete, but the option cannot be changed now.
  Instead use an additional \fB\-g\fR\fIlevel\fR option to change the
! debug level for \s-1DWARF\s0.
  .IP "\fB\-gtoggle\fR" 4
  .IX Item "-gtoggle"
  Turn off generation of debug info, if leaving out this option
--- 5101,5107 ----
  different from version 2), and it would have been too confusing.  That
  debug format is long obsolete, but the option cannot be changed now.
  Instead use an additional \fB\-g\fR\fIlevel\fR option to change the
! debug level for \s-1DWARF.\s0
  .IP "\fB\-gtoggle\fR" 4
  .IX Item "-gtoggle"
  Turn off generation of debug info, if leaving out this option
*************** at runtime.  Current suboptions are:
*** 5152,5158 ****
  .IX Item "-fsanitize=shift"
  This option enables checking that the result of a shift operation is
  not undefined.  Note that what exactly is considered undefined differs
! slightly between C and \*(C+, as well as between \s-1ISO\s0 C90 and C99, etc.
  .IP "\fB\-fsanitize=integer\-divide\-by\-zero\fR" 4
  .IX Item "-fsanitize=integer-divide-by-zero"
  Detect integer division by zero as well as \f(CW\*(C`INT_MIN / \-1\*(C'\fR division.
--- 5154,5160 ----
  .IX Item "-fsanitize=shift"
  This option enables checking that the result of a shift operation is
  not undefined.  Note that what exactly is considered undefined differs
! slightly between C and \*(C+, as well as between \s-1ISO C90\s0 and C99, etc.
  .IP "\fB\-fsanitize=integer\-divide\-by\-zero\fR" 4
  .IX Item "-fsanitize=integer-divide-by-zero"
  Detect integer division by zero as well as \f(CW\*(C`INT_MIN / \-1\*(C'\fR division.
*************** When this option is passed to the compil
*** 5458,5466 ****
  other than debugging the compiler proper.
  .IP "\fB\-feliminate\-dwarf2\-dups\fR" 4
  .IX Item "-feliminate-dwarf2-dups"
! Compress \s-1DWARF\s0 2 debugging information by eliminating duplicated
  information about each symbol.  This option only makes sense when
! generating \s-1DWARF\s0 2 debugging information with \fB\-gdwarf\-2\fR.
  .IP "\fB\-femit\-struct\-debug\-baseonly\fR" 4
  .IX Item "-femit-struct-debug-baseonly"
  Emit debug information for struct-like types
--- 5460,5468 ----
  other than debugging the compiler proper.
  .IP "\fB\-feliminate\-dwarf2\-dups\fR" 4
  .IX Item "-feliminate-dwarf2-dups"
! Compress \s-1DWARF 2\s0 debugging information by eliminating duplicated
  information about each symbol.  This option only makes sense when
! generating \s-1DWARF 2\s0 debugging information with \fB\-gdwarf\-2\fR.
  .IP "\fB\-femit\-struct\-debug\-baseonly\fR" 4
  .IX Item "-femit-struct-debug-baseonly"
  Emit debug information for struct-like types
*************** but at significant potential loss in typ
*** 5472,5478 ****
  See \fB\-femit\-struct\-debug\-reduced\fR for a less aggressive option.
  See \fB\-femit\-struct\-debug\-detailed\fR for more detailed control.
  .Sp
! This option works only with \s-1DWARF\s0 2.
  .IP "\fB\-femit\-struct\-debug\-reduced\fR" 4
  .IX Item "-femit-struct-debug-reduced"
  Emit debug information for struct-like types
--- 5474,5480 ----
  See \fB\-femit\-struct\-debug\-reduced\fR for a less aggressive option.
  See \fB\-femit\-struct\-debug\-detailed\fR for more detailed control.
  .Sp
! This option works only with \s-1DWARF 2.\s0
  .IP "\fB\-femit\-struct\-debug\-reduced\fR" 4
  .IX Item "-femit-struct-debug-reduced"
  Emit debug information for struct-like types
*************** with some potential loss in type informa
*** 5485,5491 ****
  See \fB\-femit\-struct\-debug\-baseonly\fR for a more aggressive option.
  See \fB\-femit\-struct\-debug\-detailed\fR for more detailed control.
  .Sp
! This option works only with \s-1DWARF\s0 2.
  .IP "\fB\-femit\-struct\-debug\-detailed\fR[\fB=\fR\fIspec-list\fR]" 4
  .IX Item "-femit-struct-debug-detailed[=spec-list]"
  Specify the struct-like types
--- 5487,5493 ----
  See \fB\-femit\-struct\-debug\-baseonly\fR for a more aggressive option.
  See \fB\-femit\-struct\-debug\-detailed\fR for more detailed control.
  .Sp
! This option works only with \s-1DWARF 2.\s0
  .IP "\fB\-femit\-struct\-debug\-detailed\fR[\fB=\fR\fIspec-list\fR]" 4
  .IX Item "-femit-struct-debug-detailed[=spec-list]"
  Specify the struct-like types
*************** You may need to experiment to determine
*** 5531,5537 ****
  .Sp
  The default is \fB\-femit\-struct\-debug\-detailed=all\fR.
  .Sp
! This option works only with \s-1DWARF\s0 2.
  .IP "\fB\-fno\-merge\-debug\-strings\fR" 4
  .IX Item "-fno-merge-debug-strings"
  Direct the linker to not merge together strings in the debugging
--- 5533,5539 ----
  .Sp
  The default is \fB\-femit\-struct\-debug\-detailed=all\fR.
  .Sp
! This option works only with \s-1DWARF 2.\s0
  .IP "\fB\-fno\-merge\-debug\-strings\fR" 4
  .IX Item "-fno-merge-debug-strings"
  Direct the linker to not merge together strings in the debugging
*************** When compiling files in directory \fI\fI
*** 5545,5551 ****
  information describing them as in \fI\fInew\fI\fR instead.
  .IP "\fB\-fno\-dwarf2\-cfi\-asm\fR" 4
  .IX Item "-fno-dwarf2-cfi-asm"
! Emit \s-1DWARF\s0 2 unwind info as compiler generated \f(CW\*(C`.eh_frame\*(C'\fR section
  instead of using \s-1GAS\s0 \f(CW\*(C`.cfi_*\*(C'\fR directives.
  .IP "\fB\-p\fR" 4
  .IX Item "-p"
--- 5547,5553 ----
  information describing them as in \fI\fInew\fI\fR instead.
  .IP "\fB\-fno\-dwarf2\-cfi\-asm\fR" 4
  .IX Item "-fno-dwarf2-cfi-asm"
! Emit \s-1DWARF 2\s0 unwind info as compiler generated \f(CW\*(C`.eh_frame\*(C'\fR section
  instead of using \s-1GAS\s0 \f(CW\*(C`.cfi_*\*(C'\fR directives.
  .IP "\fB\-p\fR" 4
  .IX Item "-p"
*************** For example, with \fB\-fdbg\-cnt=dce:10,
*** 5703,5709 ****
  .IX Item "-fdisable-kind-pass=range-list"
  .PD
  This is a set of options that are used to explicitly disable/enable
! optimization passes.  These options are intended for use for debugging \s-1GCC\s0.
  Compiler users should use regular options for enabling/disabling
  passes instead.
  .RS 4
--- 5705,5711 ----
  .IX Item "-fdisable-kind-pass=range-list"
  .PD
  This is a set of options that are used to explicitly disable/enable
! optimization passes.  These options are intended for use for debugging \s-1GCC.\s0
  Compiler users should use regular options for enabling/disabling
  passes instead.
  .RS 4
*************** by some other path.
*** 6176,6182 ****
  When dumping pretty-printed trees, this option inhibits dumping the
  bodies of control structures.
  .Sp
! When dumping \s-1RTL\s0, print the \s-1RTL\s0 in slim (condensed) form instead of
  the default LISP-like representation.
  .IP "\fBraw\fR" 4
  .IX Item "raw"
--- 6178,6184 ----
  When dumping pretty-printed trees, this option inhibits dumping the
  bodies of control structures.
  .Sp
! When dumping \s-1RTL,\s0 print the \s-1RTL\s0 in slim (condensed) form instead of
  the default LISP-like representation.
  .IP "\fBraw\fR" 4
  .IX Item "raw"
*************** Dump aliasing information for each funct
*** 6289,6295 ****
  appending \fI.alias\fR to the source file name.
  .IP "\fBccp\fR" 4
  .IX Item "ccp"
! Dump each function after \s-1CCP\s0.  The file name is made by appending
  \&\fI.ccp\fR to the source file name.
  .IP "\fBstoreccp\fR" 4
  .IX Item "storeccp"
--- 6291,6297 ----
  appending \fI.alias\fR to the source file name.
  .IP "\fBccp\fR" 4
  .IX Item "ccp"
! Dump each function after \s-1CCP.\s0  The file name is made by appending
  \&\fI.ccp\fR to the source file name.
  .IP "\fBstoreccp\fR" 4
  .IX Item "storeccp"
*************** Print the compiler's built-in specs\-\-\
*** 6708,6714 ****
  is used when \s-1GCC\s0 itself is being built.)
  .IP "\fB\-fno\-eliminate\-unused\-debug\-types\fR" 4
  .IX Item "-fno-eliminate-unused-debug-types"
! Normally, when producing \s-1DWARF\s0 2 output, \s-1GCC\s0 avoids producing debug symbol 
  output for types that are nowhere used in the source file being compiled.
  Sometimes it is useful to have \s-1GCC\s0 emit debugging
  information for all types declared in a compilation
--- 6710,6716 ----
  is used when \s-1GCC\s0 itself is being built.)
  .IP "\fB\-fno\-eliminate\-unused\-debug\-types\fR" 4
  .IX Item "-fno-eliminate-unused-debug-types"
! Normally, when producing \s-1DWARF 2\s0 output, \s-1GCC\s0 avoids producing debug symbol 
  output for types that are nowhere used in the source file being compiled.
  Sometimes it is useful to have \s-1GCC\s0 emit debugging
  information for all types declared in a compilation
*************** in that compilation unit, for example
*** 6717,6723 ****
  if, in the debugger, you want to cast a value to a type that is
  not actually used in your program (but is declared).  More often,
  however, this results in a significant amount of wasted space.
! .Sh "Options That Control Optimization"
  .IX Subsection "Options That Control Optimization"
  These options control various sorts of optimizations.
  .PP
--- 6719,6725 ----
  if, in the debugger, you want to cast a value to a type that is
  not actually used in your program (but is declared).  More often,
  however, this results in a significant amount of wasted space.
! .SS "Options That Control Optimization"
  .IX Subsection "Options That Control Optimization"
  These options control various sorts of optimizations.
  .PP
*************** function calls and pops them all at once
*** 6913,6919 ****
  Disabled at levels \fB\-O\fR, \fB\-O2\fR, \fB\-O3\fR, \fB\-Os\fR.
  .IP "\fB\-fforward\-propagate\fR" 4
  .IX Item "-fforward-propagate"
! Perform a forward propagation pass on \s-1RTL\s0.  The pass tries to combine two
  instructions and checks if the result can be simplified.  If loop unrolling
  is active, two passes are performed and the second is scheduled after
  loop unrolling.
--- 6915,6921 ----
  Disabled at levels \fB\-O\fR, \fB\-O2\fR, \fB\-O3\fR, \fB\-Os\fR.
  .IP "\fB\-fforward\-propagate\fR" 4
  .IX Item "-fforward-propagate"
! Perform a forward propagation pass on \s-1RTL.\s0  The pass tries to combine two
  instructions and checks if the result can be simplified.  If loop unrolling
  is active, two passes are performed and the second is scheduled after
  loop unrolling.
*************** restore frame pointers; it also makes an
*** 6939,6945 ****
  in many functions.  \fBIt also makes debugging impossible on
  some machines.\fR
  .Sp
! On some machines, such as the \s-1VAX\s0, this flag has no effect, because
  the standard calling sequence automatically handles the frame pointer
  and nothing is saved by pretending it doesn't exist.  The
  machine-description macro \f(CW\*(C`FRAME_POINTER_REQUIRED\*(C'\fR controls
--- 6941,6947 ----
  in many functions.  \fBIt also makes debugging impossible on
  some machines.\fR
  .Sp
! On some machines, such as the \s-1VAX,\s0 this flag has no effect, because
  the standard calling sequence automatically handles the frame pointer
  and nothing is saved by pretending it doesn't exist.  The
  machine-description macro \f(CW\*(C`FRAME_POINTER_REQUIRED\*(C'\fR controls
*************** attribute or declspec
*** 7064,7070 ****
  In C, emit \f(CW\*(C`static\*(C'\fR functions that are declared \f(CW\*(C`inline\*(C'\fR
  into the object file, even if the function has been inlined into all
  of its callers.  This switch does not affect functions using the
! \&\f(CW\*(C`extern inline\*(C'\fR extension in \s-1GNU\s0 C90.  In \*(C+, emit any and all
  inline functions into the object file.
  .IP "\fB\-fkeep\-static\-consts\fR" 4
  .IX Item "-fkeep-static-consts"
--- 7066,7072 ----
  In C, emit \f(CW\*(C`static\*(C'\fR functions that are declared \f(CW\*(C`inline\*(C'\fR
  into the object file, even if the function has been inlined into all
  of its callers.  This switch does not affect functions using the
! \&\f(CW\*(C`extern inline\*(C'\fR extension in \s-1GNU C90.\s0  In \*(C+, emit any and all
  inline functions into the object file.
  .IP "\fB\-fkeep\-static\-consts\fR" 4
  .IX Item "-fkeep-static-consts"
*************** The default is \fB\-ffunction\-cse\fR
*** 7131,7137 ****
  .IP "\fB\-fno\-zero\-initialized\-in\-bss\fR" 4
  .IX Item "-fno-zero-initialized-in-bss"
  If the target supports a \s-1BSS\s0 section, \s-1GCC\s0 by default puts variables that
! are initialized to zero into \s-1BSS\s0.  This can save space in the resulting
  code.
  .Sp
  This option turns off this behavior because some programs explicitly
--- 7133,7139 ----
  .IP "\fB\-fno\-zero\-initialized\-in\-bss\fR" 4
  .IX Item "-fno-zero-initialized-in-bss"
  If the target supports a \s-1BSS\s0 section, \s-1GCC\s0 by default puts variables that
! are initialized to zero into \s-1BSS.\s0  This can save space in the resulting
  code.
  .Sp
  This option turns off this behavior because some programs explicitly
*************** instructions to support this.  Enabled b
*** 7254,7264 ****
  higher on architectures that support this.
  .IP "\fB\-fdce\fR" 4
  .IX Item "-fdce"
! Perform dead code elimination (\s-1DCE\s0) on \s-1RTL\s0.
  Enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-fdse\fR" 4
  .IX Item "-fdse"
! Perform dead store elimination (\s-1DSE\s0) on \s-1RTL\s0.
  Enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-fif\-conversion\fR" 4
  .IX Item "-fif-conversion"
--- 7256,7266 ----
  higher on architectures that support this.
  .IP "\fB\-fdce\fR" 4
  .IX Item "-fdce"
! Perform dead code elimination (\s-1DCE\s0) on \s-1RTL.\s0
  Enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-fdse\fR" 4
  .IX Item "-fdse"
! Perform dead store elimination (\s-1DSE\s0) on \s-1RTL.\s0
  Enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-fif\-conversion\fR" 4
  .IX Item "-fif-conversion"
*************** The default value is 5.  If the value \f
*** 7418,7424 ****
  the dump output is sent to stderr using the same format as \fIn\fR minus 10.
  .IP "\fB\-flra\-remat\fR" 4
  .IX Item "-flra-remat"
! Enable CFG-sensitive rematerialization in \s-1LRA\s0.  Instead of loading
  values of spilled pseudos, \s-1LRA\s0 tries to rematerialize (recalculate)
  values if it is profitable.
  .Sp
--- 7420,7426 ----
  the dump output is sent to stderr using the same format as \fIn\fR minus 10.
  .IP "\fB\-flra\-remat\fR" 4
  .IX Item "-flra-remat"
! Enable CFG-sensitive rematerialization in \s-1LRA.\s0  Instead of loading
  values of spilled pseudos, \s-1LRA\s0 tries to rematerialize (recalculate)
  values if it is profitable.
  .Sp
*************** When pipelining loops during selective s
*** 7577,7585 ****
  This option has no effect unless \fB\-fsel\-sched\-pipelining\fR is turned on.
  .IP "\fB\-fsemantic\-interposition\fR" 4
  .IX Item "-fsemantic-interposition"
! Some object formats, like \s-1ELF\s0, allow interposing of symbols by the 
  dynamic linker.
! This means that for symbols exported from the \s-1DSO\s0, the compiler cannot perform
  interprocedural propagation, inlining and other optimizations in anticipation
  that the function or variable in question may change. While this feature is
  useful, for example, to rewrite memory allocation functions by a debugging
--- 7579,7587 ----
  This option has no effect unless \fB\-fsel\-sched\-pipelining\fR is turned on.
  .IP "\fB\-fsemantic\-interposition\fR" 4
  .IX Item "-fsemantic-interposition"
! Some object formats, like \s-1ELF,\s0 allow interposing of symbols by the 
  dynamic linker.
! This means that for symbols exported from the \s-1DSO,\s0 the compiler cannot perform
  interprocedural propagation, inlining and other optimizations in anticipation
  that the function or variable in question may change. While this feature is
  useful, for example, to rewrite memory allocation functions by a debugging
*************** at \fB\-O\fR and higher.
*** 7649,7655 ****
  Perform full redundancy elimination (\s-1FRE\s0) on trees.  The difference
  between \s-1FRE\s0 and \s-1PRE\s0 is that \s-1FRE\s0 only considers expressions
  that are computed on all paths leading to the redundant computation.
! This analysis is faster than \s-1PRE\s0, though it exposes fewer redundancies.
  This flag is enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-ftree\-phiprop\fR" 4
  .IX Item "-ftree-phiprop"
--- 7651,7657 ----
  Perform full redundancy elimination (\s-1FRE\s0) on trees.  The difference
  between \s-1FRE\s0 and \s-1PRE\s0 is that \s-1FRE\s0 only considers expressions
  that are computed on all paths leading to the redundant computation.
! This analysis is faster than \s-1PRE,\s0 though it exposes fewer redundancies.
  This flag is enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-ftree\-phiprop\fR" 4
  .IX Item "-ftree-phiprop"
*************** The optimization reduces code size and m
*** 7720,7726 ****
  a function by equivalent one with a different name. The optimization works
  more effectively with link time optimization enabled.
  .Sp
! Nevertheless the behavior is similar to Gold Linker \s-1ICF\s0 optimization, \s-1GCC\s0 \s-1ICF\s0
  works on different levels and thus the optimizations are not same \- there are
  equivalences that are found only by \s-1GCC\s0 and equivalences found only by Gold.
  .Sp
--- 7722,7728 ----
  a function by equivalent one with a different name. The optimization works
  more effectively with link time optimization enabled.
  .Sp
! Nevertheless the behavior is similar to Gold Linker \s-1ICF\s0 optimization, \s-1GCC ICF\s0
  works on different levels and thus the optimizations are not same \- there are
  equivalences that are found only by \s-1GCC\s0 and equivalences found only by Gold.
  .Sp
*************** pass only operates on local scalar varia
*** 7755,7761 ****
  at \fB\-O\fR and higher.
  .IP "\fB\-fssa\-phiopt\fR" 4
  .IX Item "-fssa-phiopt"
! Perform pattern matching on \s-1SSA\s0 \s-1PHI\s0 nodes to optimize conditional
  code.  This pass is enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-ftree\-switch\-conversion\fR" 4
  .IX Item "-ftree-switch-conversion"
--- 7757,7763 ----
  at \fB\-O\fR and higher.
  .IP "\fB\-fssa\-phiopt\fR" 4
  .IX Item "-fssa-phiopt"
! Perform pattern matching on \s-1SSA PHI\s0 nodes to optimize conditional
  code.  This pass is enabled by default at \fB\-O\fR and higher.
  .IP "\fB\-ftree\-switch\-conversion\fR" 4
  .IX Item "-ftree-switch-conversion"
*************** Enable the identity transformation for g
*** 7912,7918 ****
  the polyhedral representation and transform it back to gimple.  Using
  \&\fB\-fgraphite\-identity\fR we can check the costs or benefits of the
  \&\s-1GIMPLE\s0 \-> \s-1GRAPHITE\s0 \-> \s-1GIMPLE\s0 transformation.  Some minimal optimizations
! are also performed by the code generator \s-1ISL\s0, like index splitting and
  dead code elimination in loops.
  .IP "\fB\-floop\-nest\-optimize\fR" 4
  .IX Item "-floop-nest-optimize"
--- 7914,7920 ----
  the polyhedral representation and transform it back to gimple.  Using
  \&\fB\-fgraphite\-identity\fR we can check the costs or benefits of the
  \&\s-1GIMPLE\s0 \-> \s-1GRAPHITE\s0 \-> \s-1GIMPLE\s0 transformation.  Some minimal optimizations
! are also performed by the code generator \s-1ISL,\s0 like index splitting and
  dead code elimination in loops.
  .IP "\fB\-floop\-nest\-optimize\fR" 4
  .IX Item "-floop-nest-optimize"
*************** targets.
*** 8417,8423 ****
  Constructs webs as commonly used for register allocation purposes and assign
  each web individual pseudo register.  This allows the register allocation pass
  to operate on pseudos directly, but also strengthens several other optimization
! passes, such as \s-1CSE\s0, loop optimizer and trivial dead code remover.  It can,
  however, make debugging impossible, since variables no longer stay in a
  \&\*(L"home register\*(R".
  .Sp
--- 8419,8425 ----
  Constructs webs as commonly used for register allocation purposes and assign
  each web individual pseudo register.  This allows the register allocation pass
  to operate on pseudos directly, but also strengthens several other optimization
! passes, such as \s-1CSE,\s0 loop optimizer and trivial dead code remover.  It can,
  however, make debugging impossible, since variables no longer stay in a
  \&\*(L"home register\*(R".
  .Sp
*************** link time.
*** 8560,8566 ****
  .Sp
  If \s-1LTO\s0 encounters objects with C linkage declared with incompatible
  types in separate translation units to be linked together (undefined
! behavior according to \s-1ISO\s0 C99 6.2.7), a non-fatal diagnostic may be
  issued.  The behavior is still undefined at run time.  Similar
  diagnostics may be raised for other languages.
  .Sp
--- 8562,8568 ----
  .Sp
  If \s-1LTO\s0 encounters objects with C linkage declared with incompatible
  types in separate translation units to be linked together (undefined
! behavior according to \s-1ISO C99 6.2.7\s0), a non-fatal diagnostic may be
  issued.  The behavior is still undefined at run time.  Similar
  diagnostics may be raised for other languages.
  .Sp
*************** regular (non-LTO) compilation.
*** 8583,8589 ****
  If object files containing \s-1GIMPLE\s0 bytecode are stored in a library archive, say
  \&\fIlibfoo.a\fR, it is possible to extract and use them in an \s-1LTO\s0 link if you
  are using a linker with plugin support.  To create static libraries suitable
! for \s-1LTO\s0, use \fBgcc-ar\fR and \fBgcc-ranlib\fR instead of \fBar\fR
  and \fBranlib\fR; 
  to show the symbols of object files with \s-1GIMPLE\s0 bytecode, use
  \&\fBgcc-nm\fR.  Those commands require that \fBar\fR, \fBranlib\fR
--- 8585,8591 ----
  If object files containing \s-1GIMPLE\s0 bytecode are stored in a library archive, say
  \&\fIlibfoo.a\fR, it is possible to extract and use them in an \s-1LTO\s0 link if you
  are using a linker with plugin support.  To create static libraries suitable
! for \s-1LTO,\s0 use \fBgcc-ar\fR and \fBgcc-ranlib\fR instead of \fBar\fR
  and \fBranlib\fR; 
  to show the symbols of object files with \s-1GIMPLE\s0 bytecode, use
  \&\fBgcc-nm\fR.  Those commands require that \fBar\fR, \fBranlib\fR
*************** The current implementation of \s-1LTO\s0
*** 8618,8624 ****
  attempt to generate bytecode that is portable between different
  types of hosts.  The bytecode files are versioned and there is a
  strict version check, so bytecode files generated in one version of
! \&\s-1GCC\s0 do not work with an older or newer version of \s-1GCC\s0.
  .Sp
  Link-time optimization does not work well with generation of debugging
  information.  Combining \fB\-flto\fR with
--- 8620,8626 ----
  attempt to generate bytecode that is portable between different
  types of hosts.  The bytecode files are versioned and there is a
  strict version check, so bytecode files generated in one version of
! \&\s-1GCC\s0 do not work with an older or newer version of \s-1GCC.\s0
  .Sp
  Link-time optimization does not work well with generation of debugging
  information.  Combining \fB\-flto\fR with
*************** and the object code. This makes them usa
*** 8701,8708 ****
  linking. This option is effective only when compiling with \fB\-flto\fR
  and is ignored at link time.
  .Sp
! \&\fB\-fno\-fat\-lto\-objects\fR improves compilation time over plain \s-1LTO\s0, but
! requires the complete toolchain to be aware of \s-1LTO\s0. It requires a linker with
  linker plugin support for basic functionality.  Additionally,
  \&\fBnm\fR, \fBar\fR and \fBranlib\fR
  need to support linker plugins to allow a full-featured build environment
--- 8703,8710 ----
  linking. This option is effective only when compiling with \fB\-flto\fR
  and is ignored at link time.
  .Sp
! \&\fB\-fno\-fat\-lto\-objects\fR improves compilation time over plain \s-1LTO,\s0 but
! requires the complete toolchain to be aware of \s-1LTO.\s0 It requires a linker with
  linker plugin support for basic functionality.  Additionally,
  \&\fBnm\fR, \fBar\fR and \fBranlib\fR
  need to support linker plugins to allow a full-featured build environment
*************** E.g.
*** 8811,8817 ****
  .Ve
  .Sp
  Then use the \fBcreate_gcov\fR tool to convert the raw profile data
! to a format that can be used by \s-1GCC\s0.  You must also supply the 
  unstripped binary for your program to this tool.  
  See <\fBhttps://github.com/google/autofdo\fR>.
  .Sp
--- 8813,8819 ----
  .Ve
  .Sp
  Then use the \fBcreate_gcov\fR tool to convert the raw profile data
! to a format that can be used by \s-1GCC.\s0  You must also supply the 
  unstripped binary for your program to this tool.  
  See <\fBhttps://github.com/google/autofdo\fR>.
  .Sp
*************** operations are carried out in the precis
*** 8849,8855 ****
  it is unpredictable when rounding to the types specified in the source
  code takes place.  When compiling C, if
  \&\fB\-fexcess\-precision=standard\fR is specified then excess
! precision follows the rules specified in \s-1ISO\s0 C99; in particular,
  both casts and assignments cause values to be rounded to their
  semantic types (whereas \fB\-ffloat\-store\fR only affects
  assignments).  This option is enabled by default for C if a strict
--- 8851,8857 ----
  it is unpredictable when rounding to the types specified in the source
  code takes place.  When compiling C, if
  \&\fB\-fexcess\-precision=standard\fR is specified then excess
! precision follows the rules specified in \s-1ISO C99\s0; in particular,
  both casts and assignments cause values to be rounded to their
  semantic types (whereas \fB\-ffloat\-store\fR only affects
  assignments).  This option is enabled by default for C if a strict
*************** The default is \fB\-fno\-unsafe\-math\-o
*** 8913,8919 ****
  .IP "\fB\-fassociative\-math\fR" 4
  .IX Item "-fassociative-math"
  Allow re-association of operands in series of floating-point operations.
! This violates the \s-1ISO\s0 C and \*(C+ language standard by possibly changing
  computation result.  \s-1NOTE:\s0 re-ordering may change the sign of zero as
  well as ignore NaNs and inhibit or create underflow or overflow (and
  thus cannot be used on code that relies on rounding behavior like
--- 8915,8921 ----
  .IP "\fB\-fassociative\-math\fR" 4
  .IX Item "-fassociative-math"
  Allow re-association of operands in series of floating-point operations.
! This violates the \s-1ISO C\s0 and \*(C+ language standard by possibly changing
  computation result.  \s-1NOTE:\s0 re-ordering may change the sign of zero as
  well as ignore NaNs and inhibit or create underflow or overflow (and
  thus cannot be used on code that relies on rounding behavior like
*************** whether the result of a complex multipli
*** 9016,9022 ****
  default is \fB\-fno\-cx\-limited\-range\fR, but is enabled by
  \&\fB\-ffast\-math\fR.
  .Sp
! This option controls the default setting of the \s-1ISO\s0 C99
  \&\f(CW\*(C`CX_LIMITED_RANGE\*(C'\fR pragma.  Nevertheless, the option applies to
  all languages.
  .IP "\fB\-fcx\-fortran\-rules\fR" 4
--- 9018,9024 ----
  default is \fB\-fno\-cx\-limited\-range\fR, but is enabled by
  \&\fB\-ffast\-math\fR.
  .Sp
! This option controls the default setting of the \s-1ISO C99\s0
  \&\f(CW\*(C`CX_LIMITED_RANGE\*(C'\fR pragma.  Nevertheless, the option applies to
  all languages.
  .IP "\fB\-fcx\-fortran\-rules\fR" 4
*************** optimization is not done.
*** 9288,9294 ****
  .IP "\fBmax-gcse-insertion-ratio\fR" 4
  .IX Item "max-gcse-insertion-ratio"
  If the ratio of expression insertions to deletions is larger than this value
! for any expression, then \s-1RTL\s0 \s-1PRE\s0 inserts or removes the expression and thus
  leaves partially redundant computations in the instruction stream.  The default value is 20.
  .IP "\fBmax-pending-list-length\fR" 4
  .IX Item "max-pending-list-length"
--- 9290,9296 ----
  .IP "\fBmax-gcse-insertion-ratio\fR" 4
  .IX Item "max-gcse-insertion-ratio"
  If the ratio of expression insertions to deletions is larger than this value
! for any expression, then \s-1RTL PRE\s0 inserts or removes the expression and thus
  leaves partially redundant computations in the instruction stream.  The default value is 20.
  .IP "\fBmax-pending-list-length\fR" 4
  .IX Item "max-pending-list-length"
*************** when modulo scheduling a loop.  Larger v
*** 9303,9309 ****
  compilation time.
  .IP "\fBmax-inline-insns-single\fR" 4
  .IX Item "max-inline-insns-single"
! Several parameters control the tree inliner used in \s-1GCC\s0.
  This number sets the maximum number of instructions (counted in \s-1GCC\s0's
  internal representation) in a single function that the tree inliner
  considers for inlining.  This only affects functions declared
--- 9305,9311 ----
  compilation time.
  .IP "\fBmax-inline-insns-single\fR" 4
  .IX Item "max-inline-insns-single"
! Several parameters control the tree inliner used in \s-1GCC.\s0
  This number sets the maximum number of instructions (counted in \s-1GCC\s0's
  internal representation) in a single function that the tree inliner
  considers for inlining.  This only affects functions declared
*************** Tuning this may improve compilation spee
*** 9659,9665 ****
  generation.
  .Sp
  The default is 30% + 70% * (\s-1RAM/1GB\s0) with an upper bound of 100% when
! \&\s-1RAM\s0 >= 1GB.  If \f(CW\*(C`getrlimit\*(C'\fR is available, the notion of \*(L"\s-1RAM\s0\*(R" is
  the smallest of actual \s-1RAM\s0 and \f(CW\*(C`RLIMIT_DATA\*(C'\fR or \f(CW\*(C`RLIMIT_AS\*(C'\fR.  If
  \&\s-1GCC\s0 is not able to calculate \s-1RAM\s0 on a particular platform, the lower
  bound of 30% is used.  Setting this parameter and
--- 9661,9667 ----
  generation.
  .Sp
  The default is 30% + 70% * (\s-1RAM/1GB\s0) with an upper bound of 100% when
! \&\s-1RAM\s0 >= 1GB.  If \f(CW\*(C`getrlimit\*(C'\fR is available, the notion of \*(L"\s-1RAM\*(R"\s0 is
  the smallest of actual \s-1RAM\s0 and \f(CW\*(C`RLIMIT_DATA\*(C'\fR or \f(CW\*(C`RLIMIT_AS\*(C'\fR.  If
  \&\s-1GCC\s0 is not able to calculate \s-1RAM\s0 on a particular platform, the lower
  bound of 30% is used.  Setting this parameter and
*************** by \fBggc-min-expand\fR% beyond \fBggc-m
*** 9674,9680 ****
  tuning this may improve compilation speed, and has no effect on code
  generation.
  .Sp
! The default is the smaller of \s-1RAM/8\s0, \s-1RLIMIT_RSS\s0, or a limit that
  tries to ensure that \s-1RLIMIT_DATA\s0 or \s-1RLIMIT_AS\s0 are not exceeded, but
  with a lower bound of 4096 (four megabytes) and an upper bound of
  131072 (128 megabytes).  If \s-1GCC\s0 is not able to calculate \s-1RAM\s0 on a
--- 9676,9682 ----
  tuning this may improve compilation speed, and has no effect on code
  generation.
  .Sp
! The default is the smaller of \s-1RAM/8, RLIMIT_RSS,\s0 or a limit that
  tries to ensure that \s-1RLIMIT_DATA\s0 or \s-1RLIMIT_AS\s0 are not exceeded, but
  with a lower bound of 4096 (four megabytes) and an upper bound of
  131072 (128 megabytes).  If \s-1GCC\s0 is not able to calculate \s-1RAM\s0 on a
*************** This value is the best found from numero
*** 9899,9905 ****
  This optimization is called inheritance.  \s-1EBB\s0 is used as a region to
  do this optimization.  The parameter defines a minimal fall-through
  edge probability in percentage used to add \s-1BB\s0 to inheritance \s-1EBB\s0 in
! \&\s-1LRA\s0.  The default value of the parameter is 40.  The value was chosen
  from numerous runs of \s-1SPEC2000\s0 on x86\-64.
  .IP "\fBloop-invariant-max-bbs-in-loop\fR" 4
  .IX Item "loop-invariant-max-bbs-in-loop"
--- 9901,9907 ----
  This optimization is called inheritance.  \s-1EBB\s0 is used as a region to
  do this optimization.  The parameter defines a minimal fall-through
  edge probability in percentage used to add \s-1BB\s0 to inheritance \s-1EBB\s0 in
! \&\s-1LRA.\s0  The default value of the parameter is 40.  The value was chosen
  from numerous runs of \s-1SPEC2000\s0 on x86\-64.
  .IP "\fBloop-invariant-max-bbs-in-loop\fR" 4
  .IX Item "loop-invariant-max-bbs-in-loop"
*************** automaton.  The default is 50.
*** 10153,10159 ****
  .RE
  .RS 4
  .RE
! .Sh "Options Controlling the Preprocessor"
  .IX Subsection "Options Controlling the Preprocessor"
  These options control the C preprocessor, which is run on each C source
  file before actual compilation.
--- 10155,10161 ----
  .RE
  .RS 4
  .RE
! .SS "Options Controlling the Preprocessor"
  .IX Subsection "Options Controlling the Preprocessor"
  These options control the C preprocessor, which is run on each C source
  file before actual compilation.
*************** get trigraph conversion without warnings
*** 10277,10283 ****
  .IP "\fB\-Wtraditional\fR" 4
  .IX Item "-Wtraditional"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO\s0 C.  Also warn about \s-1ISO\s0 C constructs that have no traditional C
  equivalent, and problematic constructs which should be avoided.
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
--- 10279,10285 ----
  .IP "\fB\-Wtraditional\fR" 4
  .IX Item "-Wtraditional"
  Warn about certain constructs that behave differently in traditional and
! \&\s-1ISO C.\s0  Also warn about \s-1ISO C\s0 constructs that have no traditional C
  equivalent, and problematic constructs which should be avoided.
  .IP "\fB\-Wundef\fR" 4
  .IX Item "-Wundef"
*************** in finding bugs in your own code, theref
*** 10330,10336 ****
  responsible for the system library, you may want to see them.
  .IP "\fB\-w\fR" 4
  .IX Item "-w"
! Suppress all warnings, including those which \s-1GNU\s0 \s-1CPP\s0 issues by default.
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  Issue all the mandatory diagnostics listed in the C standard.  Some of
--- 10332,10338 ----
  responsible for the system library, you may want to see them.
  .IP "\fB\-w\fR" 4
  .IX Item "-w"
! Suppress all warnings, including those which \s-1GNU CPP\s0 issues by default.
  .IP "\fB\-pedantic\fR" 4
  .IX Item "-pedantic"
  Issue all the mandatory diagnostics listed in the C standard.  Some of
*************** This option allows use of a precompiled
*** 10470,10479 ****
  \&\f(CW\*(C`#pragma GCC pch_preprocess "\f(CIfilename\f(CW"\*(C'\fR in the output to mark
  the place where the precompiled header was found, and its \fIfilename\fR.
  When \fB\-fpreprocessed\fR is in use, \s-1GCC\s0 recognizes this \f(CW\*(C`#pragma\*(C'\fR
! and loads the \s-1PCH\s0.
  .Sp
  This option is off by default, because the resulting preprocessed output
! is only really suitable as input to \s-1GCC\s0.  It is switched on by
  \&\fB\-save\-temps\fR.
  .Sp
  You should not write this \f(CW\*(C`#pragma\*(C'\fR in your own code, but it is
--- 10472,10481 ----
  \&\f(CW\*(C`#pragma GCC pch_preprocess "\f(CIfilename\f(CW"\*(C'\fR in the output to mark
  the place where the precompiled header was found, and its \fIfilename\fR.
  When \fB\-fpreprocessed\fR is in use, \s-1GCC\s0 recognizes this \f(CW\*(C`#pragma\*(C'\fR
! and loads the \s-1PCH.\s0
  .Sp
  This option is off by default, because the resulting preprocessed output
! is only really suitable as input to \s-1GCC.\s0  It is switched on by
  \&\fB\-save\-temps\fR.
  .Sp
  You should not write this \f(CW\*(C`#pragma\*(C'\fR in your own code, but it is
*************** may be one of:
*** 10526,10532 ****
  .el .IP "\f(CWiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! The \s-1ISO\s0 C standard from 1990.  \fBc90\fR is the customary shorthand for
  this version of the standard.
  .Sp
  The \fB\-ansi\fR option is equivalent to \fB\-std=c90\fR.
--- 10528,10534 ----
  .el .IP "\f(CWiso9899:1990\fR" 4
  .IX Item "iso9899:1990"
  .PD
! The \s-1ISO C\s0 standard from 1990.  \fBc90\fR is the customary shorthand for
  this version of the standard.
  .Sp
  The \fB\-ansi\fR option is equivalent to \fB\-std=c90\fR.
*************** The 1990 C standard, as amended in 1994.
*** 10548,10554 ****
  .el .IP "\f(CWc9x\fR" 4
  .IX Item "c9x"
  .PD
! The revised \s-1ISO\s0 C standard, published in December 1999.  Before
  publication, this was known as C9X.
  .ie n .IP """iso9899:2011""" 4
  .el .IP "\f(CWiso9899:2011\fR" 4
--- 10550,10556 ----
  .el .IP "\f(CWc9x\fR" 4
  .IX Item "c9x"
  .PD
! The revised \s-1ISO C\s0 standard, published in December 1999.  Before
  publication, this was known as C9X.
  .ie n .IP """iso9899:2011""" 4
  .el .IP "\f(CWiso9899:2011\fR" 4
*************** publication, this was known as C9X.
*** 10561,10567 ****
  .el .IP "\f(CWc1x\fR" 4
  .IX Item "c1x"
  .PD
! The revised \s-1ISO\s0 C standard, published in December 2011.  Before
  publication, this was known as C1X.
  .ie n .IP """gnu90""" 4
  .el .IP "\f(CWgnu90\fR" 4
--- 10563,10569 ----
  .el .IP "\f(CWc1x\fR" 4
  .IX Item "c1x"
  .PD
! The revised \s-1ISO C\s0 standard, published in December 2011.  Before
  publication, this was known as C1X.
  .ie n .IP """gnu90""" 4
  .el .IP "\f(CWgnu90\fR" 4
*************** The 2011 C standard plus \s-1GNU\s0 exte
*** 10593,10599 ****
  .ie n .IP """c++98""" 4
  .el .IP "\f(CWc++98\fR" 4
  .IX Item "c++98"
! The 1998 \s-1ISO\s0 \*(C+ standard plus amendments.
  .ie n .IP """gnu++98""" 4
  .el .IP "\f(CWgnu++98\fR" 4
  .IX Item "gnu++98"
--- 10595,10601 ----
  .ie n .IP """c++98""" 4
  .el .IP "\f(CWc++98\fR" 4
  .IX Item "c++98"
! The 1998 \s-1ISO \*(C+\s0 standard plus amendments.
  .ie n .IP """gnu++98""" 4
  .el .IP "\f(CWgnu++98\fR" 4
  .IX Item "gnu++98"
*************** line.  If the value is less than 1 or gr
*** 10745,10751 ****
  ignored.  The default is 8.
  .IP "\fB\-fdebug\-cpp\fR" 4
  .IX Item "-fdebug-cpp"
! This option is only useful for debugging \s-1GCC\s0.  When used with
  \&\fB\-E\fR, dumps debugging information about location maps.  Every
  token in the output is preceded by the dump of the map its location
  belongs to.  The dump of the map holding the location of a token would
--- 10747,10753 ----
  ignored.  The default is 8.
  .IP "\fB\-fdebug\-cpp\fR" 4
  .IX Item "-fdebug-cpp"
! This option is only useful for debugging \s-1GCC.\s0  When used with
  \&\fB\-E\fR, dumps debugging information about location maps.  Every
  token in the output is preceded by the dump of the map its location
  belongs to.  The dump of the map holding the location of a token would
*************** Note that \f(CW\*(C`\-ftrack\-macro\-exp
*** 10778,10789 ****
  .IP "\fB\-fexec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fexec-charset=charset"
  Set the execution character set, used for string and character
! constants.  The default is \s-1UTF\-8\s0.  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
  .IP "\fB\-fwide\-exec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fwide-exec-charset=charset"
  Set the wide execution character set, used for wide string and
! character constants.  The default is \s-1UTF\-32\s0 or \s-1UTF\-16\s0, whichever
  corresponds to the width of \f(CW\*(C`wchar_t\*(C'\fR.  As with
  \&\fB\-fexec\-charset\fR, \fIcharset\fR can be any encoding supported
  by the system's \f(CW\*(C`iconv\*(C'\fR library routine; however, you will have
--- 10780,10791 ----
  .IP "\fB\-fexec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fexec-charset=charset"
  Set the execution character set, used for string and character
! constants.  The default is \s-1UTF\-8.\s0  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
  .IP "\fB\-fwide\-exec\-charset=\fR\fIcharset\fR" 4
  .IX Item "-fwide-exec-charset=charset"
  Set the wide execution character set, used for wide string and
! character constants.  The default is \s-1UTF\-32\s0 or \s-1UTF\-16,\s0 whichever
  corresponds to the width of \f(CW\*(C`wchar_t\*(C'\fR.  As with
  \&\fB\-fexec\-charset\fR, \fIcharset\fR can be any encoding supported
  by the system's \f(CW\*(C`iconv\*(C'\fR library routine; however, you will have
*************** problems with encodings that do not fit
*** 10791,10799 ****
  .IP "\fB\-finput\-charset=\fR\fIcharset\fR" 4
  .IX Item "-finput-charset=charset"
  Set the input character set, used for translation from the character
! set of the input file to the source character set used by \s-1GCC\s0.  If the
  locale does not specify, or \s-1GCC\s0 cannot get this information from the
! locale, the default is \s-1UTF\-8\s0.  This can be overridden by either the locale
  or this command-line option.  Currently the command-line option takes
  precedence if there's a conflict.  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
--- 10793,10801 ----
  .IP "\fB\-finput\-charset=\fR\fIcharset\fR" 4
  .IX Item "-finput-charset=charset"
  Set the input character set, used for translation from the character
! set of the input file to the source character set used by \s-1GCC.\s0  If the
  locale does not specify, or \s-1GCC\s0 cannot get this information from the
! locale, the default is \s-1UTF\-8.\s0  This can be overridden by either the locale
  or this command-line option.  Currently the command-line option takes
  precedence if there's a conflict.  \fIcharset\fR can be any encoding
  supported by the system's \f(CW\*(C`iconv\*(C'\fR library routine.
*************** Cancel an assertion with the predicate \
*** 10830,10836 ****
  .IX Item "-dCHARS"
  \&\fI\s-1CHARS\s0\fR is a sequence of one or more of the following characters,
  and must not be preceded by a space.  Other characters are interpreted
! by the compiler proper, or reserved for future versions of \s-1GCC\s0, and so
  are silently ignored.  If you specify characters whose behavior
  conflicts, the result is undefined.
  .RS 4
--- 10832,10838 ----
  .IX Item "-dCHARS"
  \&\fI\s-1CHARS\s0\fR is a sequence of one or more of the following characters,
  and must not be preceded by a space.  Other characters are interpreted
! by the compiler proper, or reserved for future versions of \s-1GCC,\s0 and so
  are silently ignored.  If you specify characters whose behavior
  conflicts, the result is undefined.
  .RS 4
*************** The \fB\-CC\fR option is generally used
*** 10906,10917 ****
  .IP "\fB\-traditional\-cpp\fR" 4
  .IX Item "-traditional-cpp"
  Try to imitate the behavior of old-fashioned C preprocessors, as
! opposed to \s-1ISO\s0 C preprocessors.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
  Process trigraph sequences.
  These are three-character sequences, all starting with \fB??\fR, that
! are defined by \s-1ISO\s0 C to stand for single characters.  For example,
  \&\fB??/\fR stands for \fB\e\fR, so \fB'??/n'\fR is a character
  constant for a newline.  By default, \s-1GCC\s0 ignores trigraphs, but in
  standard-conforming modes it converts them.  See the \fB\-std\fR and
--- 10908,10919 ----
  .IP "\fB\-traditional\-cpp\fR" 4
  .IX Item "-traditional-cpp"
  Try to imitate the behavior of old-fashioned C preprocessors, as
! opposed to \s-1ISO C\s0 preprocessors.
  .IP "\fB\-trigraphs\fR" 4
  .IX Item "-trigraphs"
  Process trigraph sequences.
  These are three-character sequences, all starting with \fB??\fR, that
! are defined by \s-1ISO C\s0 to stand for single characters.  For example,
  \&\fB??/\fR stands for \fB\e\fR, so \fB'??/n'\fR is a character
  constant for a newline.  By default, \s-1GCC\s0 ignores trigraphs, but in
  standard-conforming modes it converts them.  See the \fB\-std\fR and
*************** Print text describing all the command-li
*** 10937,10943 ****
  preprocessing anything.
  .IP "\fB\-v\fR" 4
  .IX Item "-v"
! Verbose mode.  Print out \s-1GNU\s0 \s-1CPP\s0's version number at the beginning of
  execution, and report the final form of the include path.
  .IP "\fB\-H\fR" 4
  .IX Item "-H"
--- 10939,10945 ----
  preprocessing anything.
  .IP "\fB\-v\fR" 4
  .IX Item "-v"
! Verbose mode.  Print out \s-1GNU CPP\s0's version number at the beginning of
  execution, and report the final form of the include path.
  .IP "\fB\-H\fR" 4
  .IX Item "-H"
*************** header file is printed with \fB...x\fR a
*** 10952,10960 ****
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
  .PD
! Print out \s-1GNU\s0 \s-1CPP\s0's version number.  With one dash, proceed to
  preprocess as normal.  With two dashes, exit immediately.
! .Sh "Passing Options to the Assembler"
  .IX Subsection "Passing Options to the Assembler"
  You can pass options to the assembler.
  .IP "\fB\-Wa,\fR\fIoption\fR" 4
--- 10954,10962 ----
  .IP "\fB\-\-version\fR" 4
  .IX Item "--version"
  .PD
! Print out \s-1GNU CPP\s0's version number.  With one dash, proceed to
  preprocess as normal.  With two dashes, exit immediately.
! .SS "Passing Options to the Assembler"
  .IX Subsection "Passing Options to the Assembler"
  You can pass options to the assembler.
  .IP "\fB\-Wa,\fR\fIoption\fR" 4
*************** recognize.
*** 10969,10975 ****
  .Sp
  If you want to pass an option that takes an argument, you must use
  \&\fB\-Xassembler\fR twice, once for the option and once for the argument.
! .Sh "Options for Linking"
  .IX Subsection "Options for Linking"
  These options come into play when the compiler links object files into
  an executable output file.  They are meaningless if the compiler is
--- 10971,10977 ----
  .Sp
  If you want to pass an option that takes an argument, you must use
  \&\fB\-Xassembler\fR twice, once for the option and once for the argument.
! .SS "Options for Linking"
  .IX Subsection "Options for Linking"
  These options come into play when the compiler links object files into
  an executable output file.  They are meaningless if the compiler is
*************** different symbols to force loading of ad
*** 11256,11262 ****
  \&\fB\-z\fR is passed directly on to the linker along with the keyword
  \&\fIkeyword\fR. See the section in the documentation of your linker for
  permitted values and their meanings.
! .Sh "Options for Directory Search"
  .IX Subsection "Options for Directory Search"
  These options specify directories to search for header files, for
  libraries and for parts of the compiler:
--- 11258,11264 ----
  \&\fB\-z\fR is passed directly on to the linker along with the keyword
  \&\fIkeyword\fR. See the section in the documentation of your linker for
  permitted values and their meanings.
! .SS "Options for Directory Search"
  .IX Subsection "Options for Directory Search"
  These options specify directories to search for header files, for
  libraries and for parts of the compiler:
*************** by default, but it is often satisfactory
*** 11392,11404 ****
  \&\fB\-I\-\fR does not inhibit the use of the standard system directories
  for header files.  Thus, \fB\-I\-\fR and \fB\-nostdinc\fR are
  independent.
! .Sh "Specifying Target Machine and Compiler Version"
  .IX Subsection "Specifying Target Machine and Compiler Version"
  The usual way to run \s-1GCC\s0 is to run the executable called \fBgcc\fR, or
  \&\fImachine\fR\fB\-gcc\fR when cross-compiling, or
  \&\fImachine\fR\fB\-gcc\-\fR\fIversion\fR to run a version other than the
  one that was installed last.
! .Sh "Hardware Models and Configurations"
  .IX Subsection "Hardware Models and Configurations"
  Each target machine types can have its own
  special options, starting with \fB\-m\fR, to choose among various
--- 11394,11406 ----
  \&\fB\-I\-\fR does not inhibit the use of the standard system directories
  for header files.  Thus, \fB\-I\-\fR and \fB\-nostdinc\fR are
  independent.
! .SS "Specifying Target Machine and Compiler Version"
  .IX Subsection "Specifying Target Machine and Compiler Version"
  The usual way to run \s-1GCC\s0 is to run the executable called \fBgcc\fR, or
  \&\fImachine\fR\fB\-gcc\fR when cross-compiling, or
  \&\fImachine\fR\fB\-gcc\-\fR\fIversion\fR to run a version other than the
  one that was installed last.
! .SS "Hardware Models and Configurations"
  .IX Subsection "Hardware Models and Configurations"
  Each target machine types can have its own
  special options, starting with \fB\-m\fR, to choose among various
*************** but long int and pointer are 64\-bit.
*** 11424,11430 ****
  .Sp
  The default depends on the specific target configuration.  Note that
  the \s-1LP64\s0 and \s-1ILP32\s0 ABIs are not link-compatible; you must compile your
! entire program with the same \s-1ABI\s0, and link with a compatible set of libraries.
  .IP "\fB\-mbig\-endian\fR" 4
  .IX Item "-mbig-endian"
  Generate big-endian code.  This is the default when \s-1GCC\s0 is configured for an
--- 11426,11432 ----
  .Sp
  The default depends on the specific target configuration.  Note that
  the \s-1LP64\s0 and \s-1ILP32\s0 ABIs are not link-compatible; you must compile your
! entire program with the same \s-1ABI,\s0 and link with a compatible set of libraries.
  .IP "\fB\-mbig\-endian\fR" 4
  .IX Item "-mbig-endian"
  Generate big-endian code.  This is the default when \s-1GCC\s0 is configured for an
*************** This is the mode used for floating-point
*** 11660,11666 ****
  round-to-nearest-or-even rounding mode.
  .IP "\fBint\fR" 4
  .IX Item "int"
! This is the mode used to perform integer calculations in the \s-1FPU\s0, e.g.
  integer multiply, or integer multiply-and-accumulate.
  .RE
  .RS 4
--- 11662,11668 ----
  round-to-nearest-or-even rounding mode.
  .IP "\fBint\fR" 4
  .IX Item "int"
! This is the mode used to perform integer calculations in the \s-1FPU,\s0 e.g.
  integer multiply, or integer multiply-and-accumulate.
  .RE
  .RS 4
*************** values for \fIcpu\fR are
*** 11722,11734 ****
  .RS 4
  .IP "\fB\s-1ARC600\s0\fR" 4
  .IX Item "ARC600"
! Compile for \s-1ARC600\s0.  Aliases: \fB\-mA6\fR, \fB\-mARC600\fR.
  .IP "\fB\s-1ARC601\s0\fR" 4
  .IX Item "ARC601"
! Compile for \s-1ARC601\s0.  Alias: \fB\-mARC601\fR.
  .IP "\fB\s-1ARC700\s0\fR" 4
  .IX Item "ARC700"
! Compile for \s-1ARC700\s0.  Aliases: \fB\-mA7\fR, \fB\-mARC700\fR.
  This is the default when configured with \fB\-\-with\-cpu=arc700\fR.
  .RE
  .RS 4
--- 11724,11736 ----
  .RS 4
  .IP "\fB\s-1ARC600\s0\fR" 4
  .IX Item "ARC600"
! Compile for \s-1ARC600.\s0  Aliases: \fB\-mA6\fR, \fB\-mARC600\fR.
  .IP "\fB\s-1ARC601\s0\fR" 4
  .IX Item "ARC601"
! Compile for \s-1ARC601.\s0  Alias: \fB\-mARC601\fR.
  .IP "\fB\s-1ARC700\s0\fR" 4
  .IX Item "ARC700"
! Compile for \s-1ARC700.\s0  Aliases: \fB\-mA7\fR, \fB\-mARC700\fR.
  This is the default when configured with \fB\-\-with\-cpu=arc700\fR.
  .RE
  .RS 4
*************** Generate Extended arithmetic instruction
*** 11755,11761 ****
  supported.  This is always enabled for \fB\-mcpu=ARC700\fR.
  .IP "\fB\-mno\-mpy\fR" 4
  .IX Item "-mno-mpy"
! Do not generate mpy instructions for \s-1ARC700\s0.
  .IP "\fB\-mmul32x16\fR" 4
  .IX Item "-mmul32x16"
  Generate 32x16 bit multiply and mac instructions.
--- 11757,11763 ----
  supported.  This is always enabled for \fB\-mcpu=ARC700\fR.
  .IP "\fB\-mno\-mpy\fR" 4
  .IX Item "-mno-mpy"
! Do not generate mpy instructions for \s-1ARC700.\s0
  .IP "\fB\-mmul32x16\fR" 4
  .IX Item "-mmul32x16"
  Generate 32x16 bit multiply and mac instructions.
*************** implementation.
*** 11780,11786 ****
  implementation.
  .IP "\fB\-msimd\fR" 4
  .IX Item "-msimd"
! Enable generation of \s-1ARC\s0 \s-1SIMD\s0 instructions via target-specific
  builtins.  Only valid for \fB\-mcpu=ARC700\fR.
  .IP "\fB\-msoft\-float\fR" 4
  .IX Item "-msoft-float"
--- 11782,11788 ----
  implementation.
  .IP "\fB\-msimd\fR" 4
  .IX Item "-msimd"
! Enable generation of \s-1ARC SIMD\s0 instructions via target-specific
  builtins.  Only valid for \fB\-mcpu=ARC700\fR.
  .IP "\fB\-msoft\-float\fR" 4
  .IX Item "-msoft-float"
*************** optimizers then assume that indexed stor
*** 11947,11953 ****
  the case.
  .IP "\fB\-mlra\fR" 4
  .IX Item "-mlra"
! Enable Local Register Allocation.  This is still experimental for \s-1ARC\s0,
  so by default the compiler uses standard reload
  (i.e. \fB\-mno\-lra\fR).
  .IP "\fB\-mlra\-priority\-none\fR" 4
--- 11949,11955 ----
  the case.
  .IP "\fB\-mlra\fR" 4
  .IX Item "-mlra"
! Enable Local Register Allocation.  This is still experimental for \s-1ARC,\s0
  so by default the compiler uses standard reload
  (i.e. \fB\-mno\-lra\fR).
  .IP "\fB\-mlra\-priority\-none\fR" 4
*************** The following options are maintained for
*** 12053,12059 ****
  are now deprecated and will be removed in a future release:
  .IP "\fB\-margonaut\fR" 4
  .IX Item "-margonaut"
! Obsolete \s-1FPX\s0.
  .IP "\fB\-mbig\-endian\fR" 4
  .IX Item "-mbig-endian"
  .PD 0
--- 12055,12061 ----
  are now deprecated and will be removed in a future release:
  .IP "\fB\-margonaut\fR" 4
  .IX Item "-margonaut"
! Obsolete \s-1FPX.\s0
  .IP "\fB\-mbig\-endian\fR" 4
  .IX Item "-mbig-endian"
  .PD 0
*************** Replaced by \fB\-mmultcost\fR.
*** 12116,12122 ****
  These \fB\-m\fR options are defined for the \s-1ARM\s0 port:
  .IP "\fB\-mabi=\fR\fIname\fR" 4
  .IX Item "-mabi=name"
! Generate code for the specified \s-1ABI\s0.  Permissible values are: \fBapcs-gnu\fR,
  \&\fBatpcs\fR, \fBaapcs\fR, \fBaapcs-linux\fR and \fBiwmmxt\fR.
  .IP "\fB\-mapcs\-frame\fR" 4
  .IX Item "-mapcs-frame"
--- 12118,12124 ----
  These \fB\-m\fR options are defined for the \s-1ARM\s0 port:
  .IP "\fB\-mabi=\fR\fIname\fR" 4
  .IX Item "-mabi=name"
! Generate code for the specified \s-1ABI.\s0  Permissible values are: \fBapcs-gnu\fR,
  \&\fBatpcs\fR, \fBaapcs\fR, \fBaapcs-linux\fR and \fBiwmmxt\fR.
  .IP "\fB\-mapcs\-frame\fR" 4
  .IX Item "-mapcs-frame"
*************** and uses FPU-specific calling convention
*** 12160,12166 ****
  .Sp
  The default depends on the specific target configuration.  Note that
  the hard-float and soft-float ABIs are not link-compatible; you must
! compile your entire program with the same \s-1ABI\s0, and link with a
  compatible set of libraries.
  .IP "\fB\-mlittle\-endian\fR" 4
  .IX Item "-mlittle-endian"
--- 12162,12168 ----
  .Sp
  The default depends on the specific target configuration.  Note that
  the hard-float and soft-float ABIs are not link-compatible; you must
! compile your entire program with the same \s-1ABI,\s0 and link with a
  compatible set of libraries.
  .IP "\fB\-mlittle\-endian\fR" 4
  .IX Item "-mlittle-endian"
*************** If the selected floating-point hardware
*** 12290,12296 ****
  (e.g. \fB\-mfpu\fR=\fBneon\fR), note that floating-point
  operations are not generated by \s-1GCC\s0's auto-vectorization pass unless
  \&\fB\-funsafe\-math\-optimizations\fR is also specified.  This is
! because \s-1NEON\s0 hardware does not fully implement the \s-1IEEE\s0 754 standard for
  floating-point arithmetic (in particular denormal values are treated as
  zero), so the use of \s-1NEON\s0 instructions may lead to a loss of precision.
  .IP "\fB\-mfp16\-format=\fR\fIname\fR" 4
--- 12292,12298 ----
  (e.g. \fB\-mfpu\fR=\fBneon\fR), note that floating-point
  operations are not generated by \s-1GCC\s0's auto-vectorization pass unless
  \&\fB\-funsafe\-math\-optimizations\fR is also specified.  This is
! because \s-1NEON\s0 hardware does not fully implement the \s-1IEEE 754\s0 standard for
  floating-point arithmetic (in particular denormal values are treated as
  zero), so the use of \s-1NEON\s0 instructions may lead to a loss of precision.
  .IP "\fB\-mfp16\-format=\fR\fIname\fR" 4
*************** otherwise the default is \fBR10\fR.
*** 12363,12369 ****
  .IX Item "-mpic-data-is-text-relative"
  Assume that each data segments are relative to text segment at load time.
  Therefore, it permits addressing data using PC-relative operations.
! This option is on by default for targets other than VxWorks \s-1RTP\s0.
  .IP "\fB\-mpoke\-function\-name\fR" 4
  .IX Item "-mpoke-function-name"
  Write the name of each function into the text section, directly
--- 12365,12371 ----
  .IX Item "-mpic-data-is-text-relative"
  Assume that each data segments are relative to text segment at load time.
  Therefore, it permits addressing data using PC-relative operations.
! This option is on by default for targets other than VxWorks \s-1RTP.\s0
  .IP "\fB\-mpoke\-function\-name\fR" 4
  .IX Item "-mpoke-function-name"
  Write the name of each function into the text section, directly
*************** off by default.
*** 12487,12493 ****
  Assume inline assembler is using unified asm syntax.  The default is
  currently off which implies divided syntax.  Currently this option is
  available only for Thumb1 and has no effect on \s-1ARM\s0 state and Thumb2.
! However, this may change in future releases of \s-1GCC\s0.  Divided syntax
  should be considered deprecated.
  .IP "\fB\-mrestrict\-it\fR" 4
  .IX Item "-mrestrict-it"
--- 12489,12495 ----
  Assume inline assembler is using unified asm syntax.  The default is
  currently off which implies divided syntax.  Currently this option is
  available only for Thumb1 and has no effect on \s-1ARM\s0 state and Thumb2.
! However, this may change in future releases of \s-1GCC.\s0  Divided syntax
  should be considered deprecated.
  .IP "\fB\-mrestrict\-it\fR" 4
  .IX Item "-mrestrict-it"
*************** The default for this option is@tie{}\fBa
*** 12556,12592 ****
  .ie n .IP """avr6""" 4
  .el .IP "\f(CWavr6\fR" 4
  .IX Item "avr6"
! \&\*(L"Enhanced\*(R" devices with 3\-byte \s-1PC\s0, i.e. with more than 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atmega256rfr2\*(C'\fR, \f(CW\*(C`atmega2560\*(C'\fR, \f(CW\*(C`atmega2561\*(C'\fR, \f(CW\*(C`atmega2564rfr2\*(C'\fR.
  .ie n .IP """avrxmega2""" 4
  .el .IP "\f(CWavrxmega2\fR" 4
  .IX Item "avrxmega2"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 8@tie{}KiB and up to 64@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega16a4\*(C'\fR, \f(CW\*(C`atxmega16a4u\*(C'\fR, \f(CW\*(C`atxmega16c4\*(C'\fR, \f(CW\*(C`atxmega16d4\*(C'\fR, \f(CW\*(C`atxmega16e5\*(C'\fR, \f(CW\*(C`atxmega32a4\*(C'\fR, \f(CW\*(C`atxmega32a4u\*(C'\fR, \f(CW\*(C`atxmega32c3\*(C'\fR, \f(CW\*(C`atxmega32c4\*(C'\fR, \f(CW\*(C`atxmega32d3\*(C'\fR, \f(CW\*(C`atxmega32d4\*(C'\fR, \f(CW\*(C`atxmega32e5\*(C'\fR, \f(CW\*(C`atxmega8e5\*(C'\fR.
  .ie n .IP """avrxmega4""" 4
  .el .IP "\f(CWavrxmega4\fR" 4
  .IX Item "avrxmega4"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 64@tie{}KiB and up to 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega64a3\*(C'\fR, \f(CW\*(C`atxmega64a3u\*(C'\fR, \f(CW\*(C`atxmega64a4u\*(C'\fR, \f(CW\*(C`atxmega64b1\*(C'\fR, \f(CW\*(C`atxmega64b3\*(C'\fR, \f(CW\*(C`atxmega64c3\*(C'\fR, \f(CW\*(C`atxmega64d3\*(C'\fR, \f(CW\*(C`atxmega64d4\*(C'\fR.
  .ie n .IP """avrxmega5""" 4
  .el .IP "\f(CWavrxmega5\fR" 4
  .IX Item "avrxmega5"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 64@tie{}KiB and up to 128@tie{}KiB of program memory and more than 64@tie{}KiB of \s-1RAM\s0.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega64a1\*(C'\fR, \f(CW\*(C`atxmega64a1u\*(C'\fR.
  .ie n .IP """avrxmega6""" 4
  .el .IP "\f(CWavrxmega6\fR" 4
  .IX Item "avrxmega6"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega128a3\*(C'\fR, \f(CW\*(C`atxmega128a3u\*(C'\fR, \f(CW\*(C`atxmega128b1\*(C'\fR, \f(CW\*(C`atxmega128b3\*(C'\fR, \f(CW\*(C`atxmega128c3\*(C'\fR, \f(CW\*(C`atxmega128d3\*(C'\fR, \f(CW\*(C`atxmega128d4\*(C'\fR, \f(CW\*(C`atxmega192a3\*(C'\fR, \f(CW\*(C`atxmega192a3u\*(C'\fR, \f(CW\*(C`atxmega192c3\*(C'\fR, \f(CW\*(C`atxmega192d3\*(C'\fR, \f(CW\*(C`atxmega256a3\*(C'\fR, \f(CW\*(C`atxmega256a3b\*(C'\fR, \f(CW\*(C`atxmega256a3bu\*(C'\fR, \f(CW\*(C`atxmega256a3u\*(C'\fR, \f(CW\*(C`atxmega256c3\*(C'\fR, \f(CW\*(C`atxmega256d3\*(C'\fR, \f(CW\*(C`atxmega384c3\*(C'\fR, \f(CW\*(C`atxmega384d3\*(C'\fR.
  .ie n .IP """avrxmega7""" 4
  .el .IP "\f(CWavrxmega7\fR" 4
  .IX Item "avrxmega7"
! \&\*(L"\s-1XMEGA\s0\*(R" devices with more than 128@tie{}KiB of program memory and more than 64@tie{}KiB of \s-1RAM\s0.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega128a1\*(C'\fR, \f(CW\*(C`atxmega128a1u\*(C'\fR, \f(CW\*(C`atxmega128a4u\*(C'\fR.
  .ie n .IP """avrtiny""" 4
  .el .IP "\f(CWavrtiny\fR" 4
  .IX Item "avrtiny"
! \&\*(L"\s-1TINY\s0\*(R" Tiny core devices with 512@tie{}B up to 4@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`attiny10\*(C'\fR, \f(CW\*(C`attiny20\*(C'\fR, \f(CW\*(C`attiny4\*(C'\fR, \f(CW\*(C`attiny40\*(C'\fR, \f(CW\*(C`attiny5\*(C'\fR, \f(CW\*(C`attiny9\*(C'\fR.
  .ie n .IP """avr1""" 4
  .el .IP "\f(CWavr1\fR" 4
--- 12558,12594 ----
  .ie n .IP """avr6""" 4
  .el .IP "\f(CWavr6\fR" 4
  .IX Item "avr6"
! \&\*(L"Enhanced\*(R" devices with 3\-byte \s-1PC,\s0 i.e. with more than 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atmega256rfr2\*(C'\fR, \f(CW\*(C`atmega2560\*(C'\fR, \f(CW\*(C`atmega2561\*(C'\fR, \f(CW\*(C`atmega2564rfr2\*(C'\fR.
  .ie n .IP """avrxmega2""" 4
  .el .IP "\f(CWavrxmega2\fR" 4
  .IX Item "avrxmega2"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 8@tie{}KiB and up to 64@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega16a4\*(C'\fR, \f(CW\*(C`atxmega16a4u\*(C'\fR, \f(CW\*(C`atxmega16c4\*(C'\fR, \f(CW\*(C`atxmega16d4\*(C'\fR, \f(CW\*(C`atxmega16e5\*(C'\fR, \f(CW\*(C`atxmega32a4\*(C'\fR, \f(CW\*(C`atxmega32a4u\*(C'\fR, \f(CW\*(C`atxmega32c3\*(C'\fR, \f(CW\*(C`atxmega32c4\*(C'\fR, \f(CW\*(C`atxmega32d3\*(C'\fR, \f(CW\*(C`atxmega32d4\*(C'\fR, \f(CW\*(C`atxmega32e5\*(C'\fR, \f(CW\*(C`atxmega8e5\*(C'\fR.
  .ie n .IP """avrxmega4""" 4
  .el .IP "\f(CWavrxmega4\fR" 4
  .IX Item "avrxmega4"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 64@tie{}KiB and up to 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega64a3\*(C'\fR, \f(CW\*(C`atxmega64a3u\*(C'\fR, \f(CW\*(C`atxmega64a4u\*(C'\fR, \f(CW\*(C`atxmega64b1\*(C'\fR, \f(CW\*(C`atxmega64b3\*(C'\fR, \f(CW\*(C`atxmega64c3\*(C'\fR, \f(CW\*(C`atxmega64d3\*(C'\fR, \f(CW\*(C`atxmega64d4\*(C'\fR.
  .ie n .IP """avrxmega5""" 4
  .el .IP "\f(CWavrxmega5\fR" 4
  .IX Item "avrxmega5"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 64@tie{}KiB and up to 128@tie{}KiB of program memory and more than 64@tie{}KiB of \s-1RAM.\s0
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega64a1\*(C'\fR, \f(CW\*(C`atxmega64a1u\*(C'\fR.
  .ie n .IP """avrxmega6""" 4
  .el .IP "\f(CWavrxmega6\fR" 4
  .IX Item "avrxmega6"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 128@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega128a3\*(C'\fR, \f(CW\*(C`atxmega128a3u\*(C'\fR, \f(CW\*(C`atxmega128b1\*(C'\fR, \f(CW\*(C`atxmega128b3\*(C'\fR, \f(CW\*(C`atxmega128c3\*(C'\fR, \f(CW\*(C`atxmega128d3\*(C'\fR, \f(CW\*(C`atxmega128d4\*(C'\fR, \f(CW\*(C`atxmega192a3\*(C'\fR, \f(CW\*(C`atxmega192a3u\*(C'\fR, \f(CW\*(C`atxmega192c3\*(C'\fR, \f(CW\*(C`atxmega192d3\*(C'\fR, \f(CW\*(C`atxmega256a3\*(C'\fR, \f(CW\*(C`atxmega256a3b\*(C'\fR, \f(CW\*(C`atxmega256a3bu\*(C'\fR, \f(CW\*(C`atxmega256a3u\*(C'\fR, \f(CW\*(C`atxmega256c3\*(C'\fR, \f(CW\*(C`atxmega256d3\*(C'\fR, \f(CW\*(C`atxmega384c3\*(C'\fR, \f(CW\*(C`atxmega384d3\*(C'\fR.
  .ie n .IP """avrxmega7""" 4
  .el .IP "\f(CWavrxmega7\fR" 4
  .IX Item "avrxmega7"
! \&\*(L"\s-1XMEGA\*(R"\s0 devices with more than 128@tie{}KiB of program memory and more than 64@tie{}KiB of \s-1RAM.\s0
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`atxmega128a1\*(C'\fR, \f(CW\*(C`atxmega128a1u\*(C'\fR, \f(CW\*(C`atxmega128a4u\*(C'\fR.
  .ie n .IP """avrtiny""" 4
  .el .IP "\f(CWavrtiny\fR" 4
  .IX Item "avrtiny"
! \&\*(L"\s-1TINY\*(R"\s0 Tiny core devices with 512@tie{}B up to 4@tie{}KiB of program memory.
  \&\fImcu\fR\f(CW@tie\fR{}= \f(CW\*(C`attiny10\*(C'\fR, \f(CW\*(C`attiny20\*(C'\fR, \f(CW\*(C`attiny4\*(C'\fR, \f(CW\*(C`attiny40\*(C'\fR, \f(CW\*(C`attiny5\*(C'\fR, \f(CW\*(C`attiny9\*(C'\fR.
  .ie n .IP """avr1""" 4
  .el .IP "\f(CWavr1\fR" 4
*************** performed as
*** 12691,12701 ****
  Only change the lower 8@tie{}bits of the stack pointer.
  .IP "\fB\-nodevicelib\fR" 4
  .IX Item "-nodevicelib"
! Don't link against AVR-LibC's device specific library \f(CW\*(C`libdev.a\*(C'\fR.
  .IP "\fB\-Waddr\-space\-convert\fR" 4
  .IX Item "-Waddr-space-convert"
  Warn about conversions between address spaces in the case where the
  resulting address space is not contained in the incoming address space.
  .PP
  \f(CW\*(C`EIND\*(C'\fR and Devices with More Than 128 Ki Bytes of Flash
  .IX Subsection "EIND and Devices with More Than 128 Ki Bytes of Flash"
--- 12693,12707 ----
  Only change the lower 8@tie{}bits of the stack pointer.
  .IP "\fB\-nodevicelib\fR" 4
  .IX Item "-nodevicelib"
! Don't link against AVR-LibC's device specific library \f(CW\*(C`lib<mcu>.a\*(C'\fR.
  .IP "\fB\-Waddr\-space\-convert\fR" 4
  .IX Item "-Waddr-space-convert"
  Warn about conversions between address spaces in the case where the
  resulting address space is not contained in the incoming address space.
+ .IP "\fB\-Wmisspelled\-isr\fR" 4
+ .IX Item "-Wmisspelled-isr"
+ Warn if the \s-1ISR\s0 is misspelled, i.e. without \f(CW\*(C`_\|_vector\*(C'\fR prefix.
+ Enabled by default.
  .PP
  \f(CW\*(C`EIND\*(C'\fR and Devices with More Than 128 Ki Bytes of Flash
  .IX Subsection "EIND and Devices with More Than 128 Ki Bytes of Flash"
*************** command-line option.
*** 12802,12808 ****
  .IX Item "-<Switch/case dispatch tables. If you do not want such dispatch>"
  tables you can specify the \fB\-fno\-jump\-tables\fR command-line option.
  .IP "\-<C and \*(C+ constructors/destructors called during startup/shutdown.>" 4
! .IX Item "-<C and  constructors/destructors called during startup/shutdown.>"
  .PD 0
  .ie n .IP "\-<If the tools hit a ""gs()"" modifier explained above.>" 4
  .el .IP "\-<If the tools hit a \f(CWgs()\fR modifier explained above.>" 4
--- 12808,12814 ----
  .IX Item "-<Switch/case dispatch tables. If you do not want such dispatch>"
  tables you can specify the \fB\-fno\-jump\-tables\fR command-line option.
  .IP "\-<C and \*(C+ constructors/destructors called during startup/shutdown.>" 4
! .IX Item "-<C and constructors/destructors called during startup/shutdown.>"
  .PD 0
  .ie n .IP "\-<If the tools hit a ""gs()"" modifier explained above.>" 4
  .el .IP "\-<If the tools hit a \f(CWgs()\fR modifier explained above.>" 4
*************** for \fImcu\fR=\f(CW\*(C`avrtiny\*(C'\fR,
*** 12903,12909 ****
  If \fImcu\fR specifies a device, this built-in macro is set
  accordingly. For example, with \fB\-mmcu=atmega8\fR the macro is
  defined to \f(CW4\fR.
! .ie n .IP """_\|_AVR_\f(CIDevice\f(CW_\|_""" 4
  .el .IP "\f(CW_\|_AVR_\f(CIDevice\f(CW_\|_\fR" 4
  .IX Item "__AVR_Device__"
  Setting \fB\-mmcu=\fR\fIdevice\fR defines this built-in macro which reflects
--- 12909,12915 ----
  If \fImcu\fR specifies a device, this built-in macro is set
  accordingly. For example, with \fB\-mmcu=atmega8\fR the macro is
  defined to \f(CW4\fR.
! .ie n .IP """_\|_AVR_\fIDevice\fP_\|_""" 4
  .el .IP "\f(CW_\|_AVR_\f(CIDevice\f(CW_\|_\fR" 4
  .IX Item "__AVR_Device__"
  Setting \fB\-mmcu=\fR\fIdevice\fR defines this built-in macro which reflects
*************** This macro reflects the \fB\-mno\-interr
*** 13030,13036 ****
  .el .IP "\f(CW_\|_AVR_ERRATA_SKIP_JMP_CALL_\|_\fR" 4
  .IX Item "__AVR_ERRATA_SKIP_JMP_CALL__"
  .PD
! Some \s-1AVR\s0 devices (\s-1AT90S8515\s0, ATmega103) must not skip 32\-bit
  instructions because of a hardware erratum.  Skip instructions are
  \&\f(CW\*(C`SBRS\*(C'\fR, \f(CW\*(C`SBRC\*(C'\fR, \f(CW\*(C`SBIS\*(C'\fR, \f(CW\*(C`SBIC\*(C'\fR and \f(CW\*(C`CPSE\*(C'\fR.
  The second macro is only defined if \f(CW\*(C`_\|_AVR_HAVE_JMP_CALL_\|_\*(C'\fR is also
--- 13036,13042 ----
  .el .IP "\f(CW_\|_AVR_ERRATA_SKIP_JMP_CALL_\|_\fR" 4
  .IX Item "__AVR_ERRATA_SKIP_JMP_CALL__"
  .PD
! Some \s-1AVR\s0 devices (\s-1AT90S8515,\s0 ATmega103) must not skip 32\-bit
  instructions because of a hardware erratum.  Skip instructions are
  \&\f(CW\*(C`SBRS\*(C'\fR, \f(CW\*(C`SBRC\*(C'\fR, \f(CW\*(C`SBIS\*(C'\fR, \f(CW\*(C`SBIC\*(C'\fR and \f(CW\*(C`CPSE\*(C'\fR.
  The second macro is only defined if \f(CW\*(C`_\|_AVR_HAVE_JMP_CALL_\|_\*(C'\fR is also
*************** set.
*** 13038,13045 ****
  .ie n .IP """_\|_AVR_ISA_RMW_\|_""" 4
  .el .IP "\f(CW_\|_AVR_ISA_RMW_\|_\fR" 4
  .IX Item "__AVR_ISA_RMW__"
! The device has Read-Modify-Write instructions (\s-1XCH\s0, \s-1LAC\s0, \s-1LAS\s0 and \s-1LAT\s0).
! .ie n .IP """_\|_AVR_SFR_OFFSET_\|_=\f(CIoffset\f(CW""" 4
  .el .IP "\f(CW_\|_AVR_SFR_OFFSET_\|_=\f(CIoffset\f(CW\fR" 4
  .IX Item "__AVR_SFR_OFFSET__=offset"
  Instructions that can address I/O special function registers directly
--- 13044,13051 ----
  .ie n .IP """_\|_AVR_ISA_RMW_\|_""" 4
  .el .IP "\f(CW_\|_AVR_ISA_RMW_\|_\fR" 4
  .IX Item "__AVR_ISA_RMW__"
! The device has Read-Modify-Write instructions (\s-1XCH, LAC, LAS\s0 and \s-1LAT\s0).
! .ie n .IP """_\|_AVR_SFR_OFFSET_\|_=\fIoffset\fP""" 4
  .el .IP "\f(CW_\|_AVR_SFR_OFFSET_\|_=\f(CIoffset\f(CW\fR" 4
  .IX Item "__AVR_SFR_OFFSET__=offset"
  Instructions that can address I/O special function registers directly
*************** should be used instead of \f(CW\*(C`main
*** 13222,13229 ****
  This option can only be used in conjunction with \fB\-mmulticore\fR.
  .IP "\fB\-msdram\fR" 4
  .IX Item "-msdram"
! Build a standalone application for \s-1SDRAM\s0. Proper start files and
! link scripts are used to put the application into \s-1SDRAM\s0, and the macro
  \&\f(CW\*(C`_\|_BFIN_SDRAM\*(C'\fR is defined.
  The loader should initialize \s-1SDRAM\s0 before loading the application.
  .IP "\fB\-micplb\fR" 4
--- 13228,13235 ----
  This option can only be used in conjunction with \fB\-mmulticore\fR.
  .IP "\fB\-msdram\fR" 4
  .IX Item "-msdram"
! Build a standalone application for \s-1SDRAM.\s0 Proper start files and
! link scripts are used to put the application into \s-1SDRAM,\s0 and the macro
  \&\f(CW\*(C`_\|_BFIN_SDRAM\*(C'\fR is defined.
  The loader should initialize \s-1SDRAM\s0 before loading the application.
  .IP "\fB\-micplb\fR" 4
*************** These options are defined specifically f
*** 13282,13288 ****
  .PD
  Generate code for the specified architecture.  The choices for
  \&\fIarchitecture-type\fR are \fBv3\fR, \fBv8\fR and \fBv10\fR for
! respectively \s-1ETRAX\s0\ 4, \s-1ETRAX\s0\ 100, and \s-1ETRAX\s0\ 100\ \s-1LX\s0.
  Default is \fBv0\fR except for cris-axis-linux-gnu, where the default is
  \&\fBv10\fR.
  .IP "\fB\-mtune=\fR\fIarchitecture-type\fR" 4
--- 13288,13294 ----
  .PD
  Generate code for the specified architecture.  The choices for
  \&\fIarchitecture-type\fR are \fBv3\fR, \fBv8\fR and \fBv10\fR for
! respectively \s-1ETRAX\s0\ 4, \s-1ETRAX\s0\ 100, and \s-1ETRAX\s0\ 100\ \s-1LX.\s0
  Default is \fBv0\fR except for cris-axis-linux-gnu, where the default is
  \&\fBv10\fR.
  .IP "\fB\-mtune=\fR\fIarchitecture-type\fR" 4
*************** or storage for local variables needs to
*** 13375,13381 ****
  With \fB\-fpic\fR and \fB\-fPIC\fR, don't generate (do generate)
  instruction sequences that load addresses for functions from the \s-1PLT\s0 part
  of the \s-1GOT\s0 rather than (traditional on other architectures) calls to the
! \&\s-1PLT\s0.  The default is \fB\-mgotplt\fR.
  .IP "\fB\-melf\fR" 4
  .IX Item "-melf"
  Legacy no-op option only recognized with the cris-axis-elf and
--- 13381,13387 ----
  With \fB\-fpic\fR and \fB\-fPIC\fR, don't generate (do generate)
  instruction sequences that load addresses for functions from the \s-1PLT\s0 part
  of the \s-1GOT\s0 rather than (traditional on other architectures) calls to the
! \&\s-1PLT.\s0  The default is \fB\-mgotplt\fR.
  .IP "\fB\-melf\fR" 4
  .IX Item "-melf"
  Legacy no-op option only recognized with the cris-axis-elf and
*************** However, \fBfar\fR is not valid with \fB
*** 13431,13437 ****
  These options are defined for all architectures running the Darwin operating
  system.
  .PP
! \&\s-1FSF\s0 \s-1GCC\s0 on Darwin does not create \*(L"fat\*(R" object files; it creates
  an object file for the single architecture that \s-1GCC\s0 was built to
  target.  Apple's \s-1GCC\s0 on Darwin does create \*(L"fat\*(R" files if multiple
  \&\fB\-arch\fR options are used; it does so by running the compiler or
--- 13437,13443 ----
  These options are defined for all architectures running the Darwin operating
  system.
  .PP
! \&\s-1FSF GCC\s0 on Darwin does not create \*(L"fat\*(R" object files; it creates
  an object file for the single architecture that \s-1GCC\s0 was built to
  target.  Apple's \s-1GCC\s0 on Darwin does create \*(L"fat\*(R" files if multiple
  \&\fB\-arch\fR options are used; it does so by running the compiler or
*************** warn about constructs contained within h
*** 13491,13497 ****
  .IX Item "-gused"
  Emit debugging information for symbols that are used.  For stabs
  debugging format, this enables \fB\-feliminate\-unused\-debug\-symbols\fR.
! This is by default \s-1ON\s0.
  .IP "\fB\-gfull\fR" 4
  .IX Item "-gfull"
  Emit debugging information for all symbols and types.
--- 13497,13503 ----
  .IX Item "-gused"
  Emit debugging information for symbols that are used.  For stabs
  debugging format, this enables \fB\-feliminate\-unused\-debug\-symbols\fR.
! This is by default \s-1ON.\s0
  .IP "\fB\-gfull\fR" 4
  .IX Item "-gfull"
  Emit debugging information for all symbols and types.
*************** an executable when linking, using the Da
*** 13567,13573 ****
  This causes \s-1GCC\s0's output file to have the \fB\s-1ALL\s0\fR subtype, instead of
  one controlled by the \fB\-mcpu\fR or \fB\-march\fR option.
  .IP "\fB\-allowable_client\fR  \fIclient_name\fR" 4
! .IX Item "-allowable_client  client_name"
  .PD 0
  .IP "\fB\-client_name\fR" 4
  .IX Item "-client_name"
--- 13573,13579 ----
  This causes \s-1GCC\s0's output file to have the \fB\s-1ALL\s0\fR subtype, instead of
  one controlled by the \fB\-mcpu\fR or \fB\-march\fR option.
  .IP "\fB\-allowable_client\fR  \fIclient_name\fR" 4
! .IX Item "-allowable_client client_name"
  .PD 0
  .IP "\fB\-client_name\fR" 4
  .IX Item "-client_name"
*************** before it can find the variables and con
*** 13867,13874 ****
  .IP "\fB\-mno\-max\fR" 4
  .IX Item "-mno-max"
  .PD
! Indicate whether \s-1GCC\s0 should generate code to use the optional \s-1BWX\s0,
! \&\s-1CIX\s0, \s-1FIX\s0 and \s-1MAX\s0 instruction sets.  The default is to use the instruction
  sets supported by the \s-1CPU\s0 type specified via \fB\-mcpu=\fR option or that
  of the \s-1CPU\s0 on which \s-1GCC\s0 was built if none is specified.
  .IP "\fB\-mfloat\-vax\fR" 4
--- 13873,13880 ----
  .IP "\fB\-mno\-max\fR" 4
  .IX Item "-mno-max"
  .PD
! Indicate whether \s-1GCC\s0 should generate code to use the optional \s-1BWX,
! CIX, FIX\s0 and \s-1MAX\s0 instruction sets.  The default is to use the instruction
  sets supported by the \s-1CPU\s0 type specified via \fB\-mcpu=\fR option or that
  of the \s-1CPU\s0 on which \s-1GCC\s0 was built if none is specified.
  .IP "\fB\-mfloat\-vax\fR" 4
*************** of the \s-1CPU\s0 on which \s-1GCC\s0 wa
*** 13877,13883 ****
  .IP "\fB\-mfloat\-ieee\fR" 4
  .IX Item "-mfloat-ieee"
  .PD
! Generate code that uses (does not use) \s-1VAX\s0 F and G floating-point
  arithmetic instead of \s-1IEEE\s0 single and double precision.
  .IP "\fB\-mexplicit\-relocs\fR" 4
  .IX Item "-mexplicit-relocs"
--- 13883,13889 ----
  .IP "\fB\-mfloat\-ieee\fR" 4
  .IX Item "-mfloat-ieee"
  .PD
! Generate code that uses (does not use) \s-1VAX F\s0 and G floating-point
  arithmetic instead of \s-1IEEE\s0 single and double precision.
  .IP "\fB\-mexplicit\-relocs\fR" 4
  .IX Item "-mexplicit-relocs"
*************** The default is \fB\-mlarge\-text\fR.
*** 13932,13938 ****
  Set the instruction set and instruction scheduling parameters for
  machine type \fIcpu_type\fR.  You can specify either the \fB\s-1EV\s0\fR
  style name or the corresponding chip number.  \s-1GCC\s0 supports scheduling
! parameters for the \s-1EV4\s0, \s-1EV5\s0 and \s-1EV6\s0 family of processors and
  chooses the default values for the instruction set from the processor
  you specify.  If you do not specify a processor type, \s-1GCC\s0 defaults
  to the processor on which the compiler was built.
--- 13938,13944 ----
  Set the instruction set and instruction scheduling parameters for
  machine type \fIcpu_type\fR.  You can specify either the \fB\s-1EV\s0\fR
  style name or the corresponding chip number.  \s-1GCC\s0 supports scheduling
! parameters for the \s-1EV4, EV5\s0 and \s-1EV6\s0 family of processors and
  chooses the default values for the instruction set from the processor
  you specify.  If you do not specify a processor type, \s-1GCC\s0 defaults
  to the processor on which the compiler was built.
*************** Schedules as an \s-1EV5\s0 and supports
*** 13977,13990 ****
  .IP "\fB21264\fR" 4
  .IX Item "21264"
  .PD
! Schedules as an \s-1EV6\s0 and supports the \s-1BWX\s0, \s-1FIX\s0, and \s-1MAX\s0 extensions.
  .IP "\fBev67\fR" 4
  .IX Item "ev67"
  .PD 0
  .IP "\fB21264a\fR" 4
  .IX Item "21264a"
  .PD
! Schedules as an \s-1EV6\s0 and supports the \s-1BWX\s0, \s-1CIX\s0, \s-1FIX\s0, and \s-1MAX\s0 extensions.
  .RE
  .RS 4
  .Sp
--- 13983,13996 ----
  .IP "\fB21264\fR" 4
  .IX Item "21264"
  .PD
! Schedules as an \s-1EV6\s0 and supports the \s-1BWX, FIX,\s0 and \s-1MAX\s0 extensions.
  .IP "\fBev67\fR" 4
  .IX Item "ev67"
  .PD 0
  .IP "\fB21264a\fR" 4
  .IX Item "21264a"
  .PD
! Schedules as an \s-1EV6\s0 and supports the \s-1BWX, CIX, FIX,\s0 and \s-1MAX\s0 extensions.
  .RE
  .RS 4
  .Sp
*************** A decimal number representing clock cycl
*** 14025,14033 ****
  .IX Item "main"
  .PD
  The compiler contains estimates of the number of clock cycles for
! \&\*(L"typical\*(R" \s-1EV4\s0 & \s-1EV5\s0 hardware for the Level 1, 2 & 3 caches
  (also called Dcache, Scache, and Bcache), as well as to main memory.
! Note that L3 is only valid for \s-1EV5\s0.
  .RE
  .RS 4
  .RE
--- 14031,14039 ----
  .IX Item "main"
  .PD
  The compiler contains estimates of the number of clock cycles for
! \&\*(L"typical\*(R" \s-1EV4 & EV5\s0 hardware for the Level 1, 2 & 3 caches
  (also called Dcache, Scache, and Bcache), as well as to main memory.
! Note that L3 is only valid for \s-1EV5.\s0
  .RE
  .RS 4
  .RE
*************** Use multiply and add/subtract instructio
*** 14100,14106 ****
  Do not use multiply and add/subtract instructions.
  .IP "\fB\-mfdpic\fR" 4
  .IX Item "-mfdpic"
! Select the \s-1FDPIC\s0 \s-1ABI\s0, which uses function descriptors to represent
  pointers to functions.  Without any PIC/PIE\-related options, it
  implies \fB\-fPIE\fR.  With \fB\-fpic\fR or \fB\-fpie\fR, it
  assumes \s-1GOT\s0 entries and small data are within a 12\-bit range from the
--- 14106,14112 ----
  Do not use multiply and add/subtract instructions.
  .IP "\fB\-mfdpic\fR" 4
  .IX Item "-mfdpic"
! Select the \s-1FDPIC ABI,\s0 which uses function descriptors to represent
  pointers to functions.  Without any PIC/PIE\-related options, it
  implies \fB\-fPIE\fR.  With \fB\-fpic\fR or \fB\-fpie\fR, it
  assumes \s-1GOT\s0 entries and small data are within a 12\-bit range from the
*************** Assume a large \s-1TLS\s0 segment when g
*** 14123,14129 ****
  Do not assume a large \s-1TLS\s0 segment when generating thread-local code.
  .IP "\fB\-mgprel\-ro\fR" 4
  .IX Item "-mgprel-ro"
! Enable the use of \f(CW\*(C`GPREL\*(C'\fR relocations in the \s-1FDPIC\s0 \s-1ABI\s0 for data
  that is known to be in read-only sections.  It's enabled by default,
  except for \fB\-fpic\fR or \fB\-fpie\fR: even though it may help
  make the global offset table smaller, it trades 1 instruction for 4.
--- 14129,14135 ----
  Do not assume a large \s-1TLS\s0 segment when generating thread-local code.
  .IP "\fB\-mgprel\-ro\fR" 4
  .IX Item "-mgprel-ro"
! Enable the use of \f(CW\*(C`GPREL\*(C'\fR relocations in the \s-1FDPIC ABI\s0 for data
  that is known to be in read-only sections.  It's enabled by default,
  except for \fB\-fpic\fR or \fB\-fpie\fR: even though it may help
  make the global offset table smaller, it trades 1 instruction for 4.
*************** Select the processor type for which to g
*** 14267,14273 ****
  These \fB\-m\fR options are defined for GNU/Linux targets:
  .IP "\fB\-mglibc\fR" 4
  .IX Item "-mglibc"
! Use the \s-1GNU\s0 C library.  This is the default except
  on \fB*\-*\-linux\-*uclibc*\fR and \fB*\-*\-linux\-*android*\fR targets.
  .IP "\fB\-muclibc\fR" 4
  .IX Item "-muclibc"
--- 14273,14279 ----
  These \fB\-m\fR options are defined for GNU/Linux targets:
  .IP "\fB\-mglibc\fR" 4
  .IX Item "-mglibc"
! Use the \s-1GNU C\s0 library.  This is the default except
  on \fB*\-*\-linux\-*uclibc*\fR and \fB*\-*\-linux\-*android*\fR targets.
  .IP "\fB\-muclibc\fR" 4
  .IX Item "-muclibc"
*************** These \fB\-m\fR options are defined for
*** 14346,14353 ****
  .IP "\fB\-march=\fR\fIarchitecture-type\fR" 4
  .IX Item "-march=architecture-type"
  Generate code for the specified architecture.  The choices for
! \&\fIarchitecture-type\fR are \fB1.0\fR for \s-1PA\s0 1.0, \fB1.1\fR for \s-1PA\s0
! 1.1, and \fB2.0\fR for \s-1PA\s0 2.0 processors.  Refer to
  \&\fI/usr/lib/sched.models\fR on an HP-UX system to determine the proper
  architecture option for your machine.  Code compiled for lower numbered
  architectures runs on higher numbered architectures, but not the
--- 14352,14359 ----
  .IP "\fB\-march=\fR\fIarchitecture-type\fR" 4
  .IX Item "-march=architecture-type"
  Generate code for the specified architecture.  The choices for
! \&\fIarchitecture-type\fR are \fB1.0\fR for \s-1PA 1.0,\s0 \fB1.1\fR for \s-1PA
! 1.1,\s0 and \fB2.0\fR for \s-1PA 2.0\s0 processors.  Refer to
  \&\fI/usr/lib/sched.models\fR on an HP-UX system to determine the proper
  architecture option for your machine.  Code compiled for lower numbered
  architectures runs on higher numbered architectures, but not the
*************** floating-point operations, the compiler
*** 14373,14379 ****
  .IP "\fB\-mdisable\-indexing\fR" 4
  .IX Item "-mdisable-indexing"
  Prevent the compiler from using indexing address modes.  This avoids some
! rather obscure problems when compiling \s-1MIG\s0 generated code under \s-1MACH\s0.
  .IP "\fB\-mno\-space\-regs\fR" 4
  .IX Item "-mno-space-regs"
  Generate code that assumes the target has no space registers.  This allows
--- 14379,14385 ----
  .IP "\fB\-mdisable\-indexing\fR" 4
  .IX Item "-mdisable-indexing"
  Prevent the compiler from using indexing address modes.  This avoids some
! rather obscure problems when compiling \s-1MIG\s0 generated code under \s-1MACH.\s0
  .IP "\fB\-mno\-space\-regs\fR" 4
  .IX Item "-mno-space-regs"
  Generate code that assumes the target has no space registers.  This allows
*************** cross-compilation.
*** 14430,14442 ****
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC\s0, with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-msio\fR" 4
  .IX Item "-msio"
! Generate the predefine, \f(CW\*(C`_SIO\*(C'\fR, for server \s-1IO\s0.  The default is
  \&\fB\-mwsio\fR.  This generates the predefines, \f(CW\*(C`_\|_hp9000s700\*(C'\fR,
! \&\f(CW\*(C`_\|_hp9000s700_\|_\*(C'\fR and \f(CW\*(C`_WSIO\*(C'\fR, for workstation \s-1IO\s0.  These
  options are available under HP-UX and HI-UX.
  .IP "\fB\-mgnu\-ld\fR" 4
  .IX Item "-mgnu-ld"
--- 14436,14448 ----
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC,\s0 with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-msio\fR" 4
  .IX Item "-msio"
! Generate the predefine, \f(CW\*(C`_SIO\*(C'\fR, for server \s-1IO.\s0  The default is
  \&\fB\-mwsio\fR.  This generates the predefines, \f(CW\*(C`_\|_hp9000s700\*(C'\fR,
! \&\f(CW\*(C`_\|_hp9000s700_\|_\*(C'\fR and \f(CW\*(C`_WSIO\*(C'\fR, for workstation \s-1IO.\s0  These
  options are available under HP-UX and HI-UX.
  .IP "\fB\-mgnu\-ld\fR" 4
  .IX Item "-mgnu-ld"
*************** The \fBld\fR that is called is determine
*** 14450,14456 ****
  \&\fB\-\-with\-ld\fR configure option, \s-1GCC\s0's program search path, and
  finally by the user's \fB\s-1PATH\s0\fR.  The linker used by \s-1GCC\s0 can be printed
  using \fBwhich `gcc \-print\-prog\-name=ld`\fR.  This option is only available
! on the 64\-bit HP-UX \s-1GCC\s0, i.e. configured with \fBhppa*64*\-*\-hpux*\fR.
  .IP "\fB\-mhp\-ld\fR" 4
  .IX Item "-mhp-ld"
  Use options specific to \s-1HP\s0 \fBld\fR.
--- 14456,14462 ----
  \&\fB\-\-with\-ld\fR configure option, \s-1GCC\s0's program search path, and
  finally by the user's \fB\s-1PATH\s0\fR.  The linker used by \s-1GCC\s0 can be printed
  using \fBwhich `gcc \-print\-prog\-name=ld`\fR.  This option is only available
! on the 64\-bit HP-UX \s-1GCC,\s0 i.e. configured with \fBhppa*64*\-*\-hpux*\fR.
  .IP "\fB\-mhp\-ld\fR" 4
  .IX Item "-mhp-ld"
  Use options specific to \s-1HP\s0 \fBld\fR.
*************** The \fBld\fR that is called is determine
*** 14464,14470 ****
  configure option, \s-1GCC\s0's program search path, and finally by the user's
  \&\fB\s-1PATH\s0\fR.  The linker used by \s-1GCC\s0 can be printed using \fBwhich
  `gcc \-print\-prog\-name=ld`\fR.  This option is only available on the 64\-bit
! HP-UX \s-1GCC\s0, i.e. configured with \fBhppa*64*\-*\-hpux*\fR.
  .IP "\fB\-mlong\-calls\fR" 4
  .IX Item "-mlong-calls"
  Generate code that uses long call sequences.  This ensures that a call
--- 14470,14476 ----
  configure option, \s-1GCC\s0's program search path, and finally by the user's
  \&\fB\s-1PATH\s0\fR.  The linker used by \s-1GCC\s0 can be printed using \fBwhich
  `gcc \-print\-prog\-name=ld`\fR.  This option is only available on the 64\-bit
! HP-UX \s-1GCC,\s0 i.e. configured with \fBhppa*64*\-*\-hpux*\fR.
  .IP "\fB\-mlong\-calls\fR" 4
  .IX Item "-mlong-calls"
  Generate code that uses long call sequences.  This ensures that a call
*************** long calls only when the distance from t
*** 14473,14479 ****
  of the function or translation unit, as the case may be, exceeds a
  predefined limit set by the branch type being used.  The limits for
  normal calls are 7,600,000 and 240,000 bytes, respectively for the
! \&\s-1PA\s0 2.0 and \s-1PA\s0 1.X architectures.  Sibcalls are always limited at
  240,000 bytes.
  .Sp
  Distances are measured from the beginning of functions when using the
--- 14479,14485 ----
  of the function or translation unit, as the case may be, exceeds a
  predefined limit set by the branch type being used.  The limits for
  normal calls are 7,600,000 and 240,000 bytes, respectively for the
! \&\s-1PA 2.0\s0 and \s-1PA 1.X\s0 architectures.  Sibcalls are always limited at
  240,000 bytes.
  .Sp
  Distances are measured from the beginning of functions when using the
*************** is available on HP-UX 10.10 and later.
*** 14501,14507 ****
  \&\fB95\fR for HP-UX 10.10 though to 11.00, and \fB98\fR for HP-UX 11.11
  and later.
  .Sp
! \&\fB\-munix=93\fR provides the same predefines as \s-1GCC\s0 3.3 and 3.4.
  \&\fB\-munix=95\fR provides additional predefines for \f(CW\*(C`XOPEN_UNIX\*(C'\fR
  and \f(CW\*(C`_XOPEN_SOURCE_EXTENDED\*(C'\fR, and the startfile \fIunix95.o\fR.
  \&\fB\-munix=98\fR provides additional predefines for \f(CW\*(C`_XOPEN_UNIX\*(C'\fR,
--- 14507,14513 ----
  \&\fB95\fR for HP-UX 10.10 though to 11.00, and \fB98\fR for HP-UX 11.11
  and later.
  .Sp
! \&\fB\-munix=93\fR provides the same predefines as \s-1GCC 3.3\s0 and 3.4.
  \&\fB\-munix=95\fR provides additional predefines for \f(CW\*(C`XOPEN_UNIX\*(C'\fR
  and \f(CW\*(C`_XOPEN_SOURCE_EXTENDED\*(C'\fR, and the startfile \fIunix95.o\fR.
  \&\fB\-munix=98\fR provides additional predefines for \f(CW\*(C`_XOPEN_UNIX\*(C'\fR,
*************** Generate (or don't) code for the \s-1GNU
*** 14567,14573 ****
  .IP "\fB\-mno\-pic\fR" 4
  .IX Item "-mno-pic"
  Generate code that does not use a global pointer register.  The result
! is not position independent code, and violates the \s-1IA\-64\s0 \s-1ABI\s0.
  .IP "\fB\-mvolatile\-asm\-stop\fR" 4
  .IX Item "-mvolatile-asm-stop"
  .PD 0
--- 14573,14579 ----
  .IP "\fB\-mno\-pic\fR" 4
  .IX Item "-mno-pic"
  Generate code that does not use a global pointer register.  The result
! is not position independent code, and violates the \s-1IA\-64 ABI.\s0
  .IP "\fB\-mvolatile\-asm\-stop\fR" 4
  .IX Item "-mvolatile-asm-stop"
  .PD 0
*************** instructions.  The default is to use the
*** 14647,14653 ****
  .IP "\fB\-mdwarf2\-asm\fR" 4
  .IX Item "-mdwarf2-asm"
  .PD
! Don't (or do) generate assembler code for the \s-1DWARF\s0 2 line number debugging
  info.  This may be useful when not using the \s-1GNU\s0 assembler.
  .IP "\fB\-mearly\-stop\-bits\fR" 4
  .IX Item "-mearly-stop-bits"
--- 14653,14659 ----
  .IP "\fB\-mdwarf2\-asm\fR" 4
  .IX Item "-mdwarf2-asm"
  .PD
! Don't (or do) generate assembler code for the \s-1DWARF 2\s0 line number debugging
  info.  This may be useful when not using the \s-1GNU\s0 assembler.
  .IP "\fB\-mearly\-stop\-bits\fR" 4
  .IX Item "-mearly-stop-bits"
*************** Specify bit size of immediate \s-1TLS\s0
*** 14671,14677 ****
  64.
  .IP "\fB\-mtune=\fR\fIcpu-type\fR" 4
  .IX Item "-mtune=cpu-type"
! Tune the instruction scheduling for a particular \s-1CPU\s0, Valid values are
  \&\fBitanium\fR, \fBitanium1\fR, \fBmerced\fR, \fBitanium2\fR,
  and \fBmckinley\fR.
  .IP "\fB\-milp32\fR" 4
--- 14677,14683 ----
  64.
  .IP "\fB\-mtune=\fR\fIcpu-type\fR" 4
  .IX Item "-mtune=cpu-type"
! Tune the instruction scheduling for a particular \s-1CPU,\s0 Valid values are
  \&\fBitanium\fR, \fBitanium1\fR, \fBmerced\fR, \fBitanium2\fR,
  and \fBmckinley\fR.
  .IP "\fB\-milp32\fR" 4
*************** have to be emulated by software on the 6
*** 15120,15126 ****
  does not have code to emulate those instructions.
  .IP "\fB\-mcpu32\fR" 4
  .IX Item "-mcpu32"
! Generate output for a \s-1CPU32\s0.  This is the default
  when the compiler is configured for CPU32\-based systems.
  It is equivalent to \fB\-march=cpu32\fR.
  .Sp
--- 15126,15132 ----
  does not have code to emulate those instructions.
  .IP "\fB\-mcpu32\fR" 4
  .IX Item "-mcpu32"
! Generate output for a \s-1CPU32.\s0  This is the default
  when the compiler is configured for CPU32\-based systems.
  It is equivalent to \fB\-march=cpu32\fR.
  .Sp
*************** Use this option for microcontrollers wit
*** 15129,15144 ****
  68336, 68340, 68341, 68349 and 68360.
  .IP "\fB\-m5200\fR" 4
  .IX Item "-m5200"
! Generate output for a 520X ColdFire \s-1CPU\s0.  This is the default
  when the compiler is configured for 520X\-based systems.
  It is equivalent to \fB\-mcpu=5206\fR, and is now deprecated
  in favor of that option.
  .Sp
  Use this option for microcontroller with a 5200 core, including
! the \s-1MCF5202\s0, \s-1MCF5203\s0, \s-1MCF5204\s0 and \s-1MCF5206\s0.
  .IP "\fB\-m5206e\fR" 4
  .IX Item "-m5206e"
! Generate output for a 5206e ColdFire \s-1CPU\s0.  The option is now
  deprecated in favor of the equivalent \fB\-mcpu=5206e\fR.
  .IP "\fB\-m528x\fR" 4
  .IX Item "-m528x"
--- 15135,15150 ----
  68336, 68340, 68341, 68349 and 68360.
  .IP "\fB\-m5200\fR" 4
  .IX Item "-m5200"
! Generate output for a 520X ColdFire \s-1CPU.\s0  This is the default
  when the compiler is configured for 520X\-based systems.
  It is equivalent to \fB\-mcpu=5206\fR, and is now deprecated
  in favor of that option.
  .Sp
  Use this option for microcontroller with a 5200 core, including
! the \s-1MCF5202, MCF5203, MCF5204\s0 and \s-1MCF5206.\s0
  .IP "\fB\-m5206e\fR" 4
  .IX Item "-m5206e"
! Generate output for a 5206e ColdFire \s-1CPU.\s0  The option is now
  deprecated in favor of the equivalent \fB\-mcpu=5206e\fR.
  .IP "\fB\-m528x\fR" 4
  .IX Item "-m528x"
*************** The option is now deprecated in favor of
*** 15147,15157 ****
  \&\fB\-mcpu=528x\fR.
  .IP "\fB\-m5307\fR" 4
  .IX Item "-m5307"
! Generate output for a ColdFire 5307 \s-1CPU\s0.  The option is now deprecated
  in favor of the equivalent \fB\-mcpu=5307\fR.
  .IP "\fB\-m5407\fR" 4
  .IX Item "-m5407"
! Generate output for a ColdFire 5407 \s-1CPU\s0.  The option is now deprecated
  in favor of the equivalent \fB\-mcpu=5407\fR.
  .IP "\fB\-mcfv4e\fR" 4
  .IX Item "-mcfv4e"
--- 15153,15163 ----
  \&\fB\-mcpu=528x\fR.
  .IP "\fB\-m5307\fR" 4
  .IX Item "-m5307"
! Generate output for a ColdFire 5307 \s-1CPU.\s0  The option is now deprecated
  in favor of the equivalent \fB\-mcpu=5307\fR.
  .IP "\fB\-m5407\fR" 4
  .IX Item "-m5407"
! Generate output for a ColdFire 5407 \s-1CPU.\s0  The option is now deprecated
  in favor of the equivalent \fB\-mcpu=5407\fR.
  .IP "\fB\-mcfv4e\fR" 4
  .IX Item "-mcfv4e"
*************** The option is equivalent to \fB\-march=6
*** 15182,15195 ****
  .IX Item "-m68881"
  .PD
  Generate floating-point instructions.  This is the default for 68020
! and above, and for ColdFire devices that have an \s-1FPU\s0.  It defines the
  macro \f(CW\*(C`_\|_HAVE_68881_\|_\*(C'\fR on M680x0 targets and \f(CW\*(C`_\|_mcffpu_\|_\*(C'\fR
  on ColdFire targets.
  .IP "\fB\-msoft\-float\fR" 4
  .IX Item "-msoft-float"
  Do not generate floating-point instructions; use library calls instead.
  This is the default for 68000, 68010, and 68832 targets.  It is also
! the default for ColdFire devices that have no \s-1FPU\s0.
  .IP "\fB\-mdiv\fR" 4
  .IX Item "-mdiv"
  .PD 0
--- 15188,15201 ----
  .IX Item "-m68881"
  .PD
  Generate floating-point instructions.  This is the default for 68020
! and above, and for ColdFire devices that have an \s-1FPU.\s0  It defines the
  macro \f(CW\*(C`_\|_HAVE_68881_\|_\*(C'\fR on M680x0 targets and \f(CW\*(C`_\|_mcffpu_\|_\*(C'\fR
  on ColdFire targets.
  .IP "\fB\-msoft\-float\fR" 4
  .IX Item "-msoft-float"
  Do not generate floating-point instructions; use library calls instead.
  This is the default for 68000, 68010, and 68832 targets.  It is also
! the default for ColdFire devices that have no \s-1FPU.\s0
  .IP "\fB\-mdiv\fR" 4
  .IX Item "-mdiv"
  .PD 0
*************** Generate (do not generate) ColdFire hard
*** 15200,15206 ****
  instructions.  If \fB\-march\fR is used without \fB\-mcpu\fR,
  the default is \*(L"on\*(R" for ColdFire architectures and \*(L"off\*(R" for M680x0
  architectures.  Otherwise, the default is taken from the target \s-1CPU\s0
! (either the default \s-1CPU\s0, or the one specified by \fB\-mcpu\fR).  For
  example, the default is \*(L"off\*(R" for \fB\-mcpu=5206\fR and \*(L"on\*(R" for
  \&\fB\-mcpu=5206e\fR.
  .Sp
--- 15206,15212 ----
  instructions.  If \fB\-march\fR is used without \fB\-mcpu\fR,
  the default is \*(L"on\*(R" for ColdFire architectures and \*(L"off\*(R" for M680x0
  architectures.  Otherwise, the default is taken from the target \s-1CPU\s0
! (either the default \s-1CPU,\s0 or the one specified by \fB\-mcpu\fR).  For
  example, the default is \*(L"off\*(R" for \fB\-mcpu=5206\fR and \*(L"on\*(R" for
  \&\fB\-mcpu=5206e\fR.
  .Sp
*************** that works if the \s-1GOT\s0 has more th
*** 15319,15325 ****
  larger and slower than code generated without this option.  On M680x0
  processors, this option is not needed; \fB\-fPIC\fR suffices.
  .Sp
! \&\s-1GCC\s0 normally uses a single instruction to load values from the \s-1GOT\s0.
  While this is relatively efficient, it only works if the \s-1GOT\s0
  is smaller than about 64k.  Anything larger causes the linker
  to report an error such as:
--- 15325,15331 ----
  larger and slower than code generated without this option.  On M680x0
  processors, this option is not needed; \fB\-fPIC\fR suffices.
  .Sp
! \&\s-1GCC\s0 normally uses a single instruction to load values from the \s-1GOT.\s0
  While this is relatively efficient, it only works if the \s-1GOT\s0
  is smaller than about 64k.  Anything larger causes the linker
  to report an error such as:
*************** useful unless you also provide \fB\-mmin
*** 15461,15467 ****
  Selects one of the built-in core configurations.  Each MeP chip has
  one or more modules in it; each module has a core \s-1CPU\s0 and a variety of
  coprocessors, optional instructions, and peripherals.  The
! \&\f(CW\*(C`MeP\-Integrator\*(C'\fR tool, not part of \s-1GCC\s0, provides these
  configurations through this option; using this option is the same as
  using all the corresponding command-line options.  The default
  configuration is \fBdefault\fR.
--- 15467,15473 ----
  Selects one of the built-in core configurations.  Each MeP chip has
  one or more modules in it; each module has a core \s-1CPU\s0 and a variety of
  coprocessors, optional instructions, and peripherals.  The
! \&\f(CW\*(C`MeP\-Integrator\*(C'\fR tool, not part of \s-1GCC,\s0 provides these
  configurations through this option; using this option is the same as
  using all the corresponding command-line options.  The default
  configuration is \fBdefault\fR.
*************** Do not optimize block moves, use \f(CW\*
*** 15564,15570 ****
  This option is deprecated.  Use \fB\-fno\-zero\-initialized\-in\-bss\fR instead.
  .IP "\fB\-mcpu=\fR\fIcpu-type\fR" 4
  .IX Item "-mcpu=cpu-type"
! Use features of, and schedule code for, the given \s-1CPU\s0.
  Supported values are in the format \fBv\fR\fIX\fR\fB.\fR\fI\s-1YY\s0\fR\fB.\fR\fIZ\fR,
  where \fIX\fR is a major version, \fI\s-1YY\s0\fR is the minor version, and
  \&\fIZ\fR is compatibility code.  Example values are \fBv3.00.a\fR,
--- 15570,15576 ----
  This option is deprecated.  Use \fB\-fno\-zero\-initialized\-in\-bss\fR instead.
  .IP "\fB\-mcpu=\fR\fIcpu-type\fR" 4
  .IX Item "-mcpu=cpu-type"
! Use features of, and schedule code for, the given \s-1CPU.\s0
  Supported values are in the format \fBv\fR\fIX\fR\fB.\fR\fI\s-1YY\s0\fR\fB.\fR\fIZ\fR,
  where \fIX\fR is a major version, \fI\s-1YY\s0\fR is the minor version, and
  \&\fIZ\fR is compatibility code.  Example values are \fBv3.00.a\fR,
*************** configurations.
*** 15650,15656 ****
  .IP "\fB\-march=\fR\fIarch\fR" 4
  .IX Item "-march=arch"
  Generate code that runs on \fIarch\fR, which can be the name of a
! generic \s-1MIPS\s0 \s-1ISA\s0, or the name of a particular processor.
  The \s-1ISA\s0 names are:
  \&\fBmips1\fR, \fBmips2\fR, \fBmips3\fR, \fBmips4\fR,
  \&\fBmips32\fR, \fBmips32r2\fR, \fBmips32r3\fR, \fBmips32r5\fR,
--- 15656,15662 ----
  .IP "\fB\-march=\fR\fIarch\fR" 4
  .IX Item "-march=arch"
  Generate code that runs on \fIarch\fR, which can be the name of a
! generic \s-1MIPS ISA,\s0 or the name of a particular processor.
  The \s-1ISA\s0 names are:
  \&\fBmips1\fR, \fBmips2\fR, \fBmips3\fR, \fBmips4\fR,
  \&\fBmips32\fR, \fBmips32r2\fR, \fBmips32r3\fR, \fBmips32r5\fR,
*************** Equivalent to \fB\-march=mips64r6\fR.
*** 15778,15784 ****
  .IX Item "-mno-mips16"
  .PD
  Generate (do not generate) \s-1MIPS16\s0 code.  If \s-1GCC\s0 is targeting a
! \&\s-1MIPS32\s0 or \s-1MIPS64\s0 architecture, it makes use of the MIPS16e \s-1ASE\s0.
  .Sp
  \&\s-1MIPS16\s0 code generation can also be controlled on a per-function basis
  by means of \f(CW\*(C`mips16\*(C'\fR and \f(CW\*(C`nomips16\*(C'\fR attributes.
--- 15784,15790 ----
  .IX Item "-mno-mips16"
  .PD
  Generate (do not generate) \s-1MIPS16\s0 code.  If \s-1GCC\s0 is targeting a
! \&\s-1MIPS32\s0 or \s-1MIPS64\s0 architecture, it makes use of the MIPS16e \s-1ASE.\s0
  .Sp
  \&\s-1MIPS16\s0 code generation can also be controlled on a per-function basis
  by means of \f(CW\*(C`mips16\*(C'\fR and \f(CW\*(C`nomips16\*(C'\fR attributes.
*************** not intended for ordinary use in compili
*** 15793,15799 ****
  .IP "\fB\-mno\-interlink\-compressed\fR" 4
  .IX Item "-mno-interlink-compressed"
  .PD
! Require (do not require) that code using the standard (uncompressed) \s-1MIPS\s0 \s-1ISA\s0
  be link-compatible with \s-1MIPS16\s0 and microMIPS code, and vice versa.
  .Sp
  For example, code using the standard \s-1ISA\s0 encoding cannot jump directly
--- 15799,15805 ----
  .IP "\fB\-mno\-interlink\-compressed\fR" 4
  .IX Item "-mno-interlink-compressed"
  .PD
! Require (do not require) that code using the standard (uncompressed) \s-1MIPS ISA\s0
  be link-compatible with \s-1MIPS16\s0 and microMIPS code, and vice versa.
  .Sp
  For example, code using the standard \s-1ISA\s0 encoding cannot jump directly
*************** and are retained for backwards compatibi
*** 15821,15840 ****
  .IP "\fB\-mabi=eabi\fR" 4
  .IX Item "-mabi=eabi"
  .PD
! Generate code for the given \s-1ABI\s0.
  .Sp
  Note that the \s-1EABI\s0 has a 32\-bit and a 64\-bit variant.  \s-1GCC\s0 normally
  generates 64\-bit code when you select a 64\-bit architecture, but you
  can use \fB\-mgp32\fR to get 32\-bit code instead.
  .Sp
! For information about the O64 \s-1ABI\s0, see
  <\fBhttp://gcc.gnu.org/projects/mipso64\-abi.html\fR>.
  .Sp
  \&\s-1GCC\s0 supports a variant of the o32 \s-1ABI\s0 in which floating-point registers
  are 64 rather than 32 bits wide.  You can select this combination with
  \&\fB\-mabi=32\fR \fB\-mfp64\fR.  This \s-1ABI\s0 relies on the \f(CW\*(C`mthc1\*(C'\fR
  and \f(CW\*(C`mfhc1\*(C'\fR instructions and is therefore only supported for
! \&\s-1MIPS32R2\s0, \s-1MIPS32R3\s0 and \s-1MIPS32R5\s0 processors.
  .Sp
  The register assignments for arguments and return values remain the
  same, but each scalar value is passed in a single 64\-bit register
--- 15827,15846 ----
  .IP "\fB\-mabi=eabi\fR" 4
  .IX Item "-mabi=eabi"
  .PD
! Generate code for the given \s-1ABI.\s0
  .Sp
  Note that the \s-1EABI\s0 has a 32\-bit and a 64\-bit variant.  \s-1GCC\s0 normally
  generates 64\-bit code when you select a 64\-bit architecture, but you
  can use \fB\-mgp32\fR to get 32\-bit code instead.
  .Sp
! For information about the O64 \s-1ABI,\s0 see
  <\fBhttp://gcc.gnu.org/projects/mipso64\-abi.html\fR>.
  .Sp
  \&\s-1GCC\s0 supports a variant of the o32 \s-1ABI\s0 in which floating-point registers
  are 64 rather than 32 bits wide.  You can select this combination with
  \&\fB\-mabi=32\fR \fB\-mfp64\fR.  This \s-1ABI\s0 relies on the \f(CW\*(C`mthc1\*(C'\fR
  and \f(CW\*(C`mfhc1\*(C'\fR instructions and is therefore only supported for
! \&\s-1MIPS32R2, MIPS32R3\s0 and \s-1MIPS32R5\s0 processors.
  .Sp
  The register assignments for arguments and return values remain the
  same, but each scalar value is passed in a single 64\-bit register
*************** a transition from 32\-bit to 64\-bit reg
*** 15849,15855 ****
  (\fB\-mfpxx\fR) and \s-1FP64A\s0 (\fB\-mfp64\fR \fB\-mno\-odd\-spreg\fR).
  The \s-1FPXX\s0 extension mandates that all code must execute correctly
  when run using 32\-bit or 64\-bit registers.  The code can be interlinked
! with either \s-1FP32\s0 or \s-1FP64\s0, but not both.
  The \s-1FP64A\s0 extension is similar to the \s-1FP64\s0 extension but forbids the
  use of odd-numbered single-precision registers.  This can be used
  in conjunction with the \f(CW\*(C`FRE\*(C'\fR mode of FPUs in \s-1MIPS32R5\s0
--- 15855,15861 ----
  (\fB\-mfpxx\fR) and \s-1FP64A\s0 (\fB\-mfp64\fR \fB\-mno\-odd\-spreg\fR).
  The \s-1FPXX\s0 extension mandates that all code must execute correctly
  when run using 32\-bit or 64\-bit registers.  The code can be interlinked
! with either \s-1FP32\s0 or \s-1FP64,\s0 but not both.
  The \s-1FP64A\s0 extension is similar to the \s-1FP64\s0 extension but forbids the
  use of odd-numbered single-precision registers.  This can be used
  in conjunction with the \f(CW\*(C`FRE\*(C'\fR mode of FPUs in \s-1MIPS32R5\s0
*************** executables both smaller and quicker.
*** 15896,15902 ****
  .PD
  Assume (do not assume) that the static and dynamic linkers
  support PLTs and copy relocations.  This option only affects
! \&\fB\-mno\-shared \-mabicalls\fR.  For the n64 \s-1ABI\s0, this option
  has no effect without \fB\-msym32\fR.
  .Sp
  You can make \fB\-mplt\fR the default by configuring
--- 15902,15908 ----
  .PD
  Assume (do not assume) that the static and dynamic linkers
  support PLTs and copy relocations.  This option only affects
! \&\fB\-mno\-shared \-mabicalls\fR.  For the n64 \s-1ABI,\s0 this option
  has no effect without \fB\-msym32\fR.
  .Sp
  You can make \fB\-mplt\fR the default by configuring
*************** You can make \fB\-mplt\fR the default by
*** 15911,15917 ****
  Lift (do not lift) the usual restrictions on the size of the global
  offset table.
  .Sp
! \&\s-1GCC\s0 normally uses a single instruction to load values from the \s-1GOT\s0.
  While this is relatively efficient, it only works if the \s-1GOT\s0
  is smaller than about 64k.  Anything larger causes the linker
  to report an error such as:
--- 15917,15923 ----
  Lift (do not lift) the usual restrictions on the size of the global
  offset table.
  .Sp
! \&\s-1GCC\s0 normally uses a single instruction to load values from the \s-1GOT.\s0
  While this is relatively efficient, it only works if the \s-1GOT\s0
  is smaller than about 64k.  Anything larger causes the linker
  to report an error such as:
*************** operations.  This is the default.
*** 15979,15986 ****
  .IX Item "-mno-odd-spreg"
  .PD
  Enable the use of odd-numbered single-precision floating-point registers
! for the o32 \s-1ABI\s0.  This is the default for processors that are known to
! support these registers.  When using the o32 \s-1FPXX\s0 \s-1ABI\s0, \fB\-mno\-odd\-spreg\fR
  is set by default.
  .IP "\fB\-mabs=2008\fR" 4
  .IX Item "-mabs=2008"
--- 15985,15992 ----
  .IX Item "-mno-odd-spreg"
  .PD
  Enable the use of odd-numbered single-precision floating-point registers
! for the o32 \s-1ABI.\s0  This is the default for processors that are known to
! support these registers.  When using the o32 \s-1FPXX ABI,\s0 \fB\-mno\-odd\-spreg\fR
  is set by default.
  .IP "\fB\-mabs=2008\fR" 4
  .IX Item "-mabs=2008"
*************** is set by default.
*** 15989,15995 ****
  .IX Item "-mabs=legacy"
  .PD
  These options control the treatment of the special not-a-number (NaN)
! \&\s-1IEEE\s0 754 floating-point data with the \f(CW\*(C`abs.\f(CIfmt\f(CW\*(C'\fR and
  \&\f(CW\*(C`neg.\f(CIfmt\f(CW\*(C'\fR machine instructions.
  .Sp
  By default or when \fB\-mabs=legacy\fR is used the legacy
--- 15995,16001 ----
  .IX Item "-mabs=legacy"
  .PD
  These options control the treatment of the special not-a-number (NaN)
! \&\s-1IEEE 754\s0 floating-point data with the \f(CW\*(C`abs.\f(CIfmt\f(CW\*(C'\fR and
  \&\f(CW\*(C`neg.\f(CIfmt\f(CW\*(C'\fR machine instructions.
  .Sp
  By default or when \fB\-mabs=legacy\fR is used the legacy
*************** manipulate the sign bit of floating-poin
*** 16000,16006 ****
  instead unless the \fB\-ffinite\-math\-only\fR option has also been
  specified.
  .Sp
! The \fB\-mabs=2008\fR option selects the \s-1IEEE\s0 754\-2008 treatment.  In
  this case these instructions are considered non-arithmetic and therefore
  operating correctly in all cases, including in particular where the
  input operand is a NaN.  These instructions are therefore always used
--- 16006,16012 ----
  instead unless the \fB\-ffinite\-math\-only\fR option has also been
  specified.
  .Sp
! The \fB\-mabs=2008\fR option selects the \s-1IEEE 754\-2008\s0 treatment.  In
  this case these instructions are considered non-arithmetic and therefore
  operating correctly in all cases, including in particular where the
  input operand is a NaN.  These instructions are therefore always used
*************** for the respective operations.
*** 16012,16025 ****
  .IX Item "-mnan=legacy"
  .PD
  These options control the encoding of the special not-a-number (NaN)
! \&\s-1IEEE\s0 754 floating-point data.
  .Sp
  The \fB\-mnan=legacy\fR option selects the legacy encoding.  In this
  case quiet NaNs (qNaNs) are denoted by the first bit of their trailing
  significand field being 0, whereas signalling NaNs (sNaNs) are denoted
  by the first bit of their trailing significand field being 1.
  .Sp
! The \fB\-mnan=2008\fR option selects the \s-1IEEE\s0 754\-2008 encoding.  In
  this case qNaNs are denoted by the first bit of their trailing
  significand field being 1, whereas sNaNs are denoted by the first bit of
  their trailing significand field being 0.
--- 16018,16031 ----
  .IX Item "-mnan=legacy"
  .PD
  These options control the encoding of the special not-a-number (NaN)
! \&\s-1IEEE 754\s0 floating-point data.
  .Sp
  The \fB\-mnan=legacy\fR option selects the legacy encoding.  In this
  case quiet NaNs (qNaNs) are denoted by the first bit of their trailing
  significand field being 0, whereas signalling NaNs (sNaNs) are denoted
  by the first bit of their trailing significand field being 1.
  .Sp
! The \fB\-mnan=2008\fR option selects the \s-1IEEE 754\-2008\s0 encoding.  In
  this case qNaNs are denoted by the first bit of their trailing
  significand field being 1, whereas sNaNs are denoted by the first bit of
  their trailing significand field being 0.
*************** configurations; see the installation doc
*** 16049,16055 ****
  .IP "\fB\-mno\-dsp\fR" 4
  .IX Item "-mno-dsp"
  .PD
! Use (do not use) revision 1 of the \s-1MIPS\s0 \s-1DSP\s0 \s-1ASE\s0.
    This option defines the
  preprocessor macro \f(CW\*(C`_\|_mips_dsp\*(C'\fR.  It also defines
  \&\f(CW\*(C`_\|_mips_dsp_rev\*(C'\fR to 1.
--- 16055,16061 ----
  .IP "\fB\-mno\-dsp\fR" 4
  .IX Item "-mno-dsp"
  .PD
! Use (do not use) revision 1 of the \s-1MIPS DSP ASE.\s0
    This option defines the
  preprocessor macro \f(CW\*(C`_\|_mips_dsp\*(C'\fR.  It also defines
  \&\f(CW\*(C`_\|_mips_dsp_rev\*(C'\fR to 1.
*************** preprocessor macro \f(CW\*(C`_\|_mips_ds
*** 16059,16065 ****
  .IP "\fB\-mno\-dspr2\fR" 4
  .IX Item "-mno-dspr2"
  .PD
! Use (do not use) revision 2 of the \s-1MIPS\s0 \s-1DSP\s0 \s-1ASE\s0.
    This option defines the
  preprocessor macros \f(CW\*(C`_\|_mips_dsp\*(C'\fR and \f(CW\*(C`_\|_mips_dspr2\*(C'\fR.
  It also defines \f(CW\*(C`_\|_mips_dsp_rev\*(C'\fR to 2.
--- 16065,16071 ----
  .IP "\fB\-mno\-dspr2\fR" 4
  .IX Item "-mno-dspr2"
  .PD
! Use (do not use) revision 2 of the \s-1MIPS DSP ASE.\s0
    This option defines the
  preprocessor macros \f(CW\*(C`_\|_mips_dsp\*(C'\fR and \f(CW\*(C`_\|_mips_dspr2\*(C'\fR.
  It also defines \f(CW\*(C`_\|_mips_dsp_rev\*(C'\fR to 2.
*************** It also defines \f(CW\*(C`_\|_mips_dsp_r
*** 16069,16075 ****
  .IP "\fB\-mno\-smartmips\fR" 4
  .IX Item "-mno-smartmips"
  .PD
! Use (do not use) the \s-1MIPS\s0 SmartMIPS \s-1ASE\s0.
  .IP "\fB\-mpaired\-single\fR" 4
  .IX Item "-mpaired-single"
  .PD 0
--- 16075,16081 ----
  .IP "\fB\-mno\-smartmips\fR" 4
  .IX Item "-mno-smartmips"
  .PD
! Use (do not use) the \s-1MIPS\s0 SmartMIPS \s-1ASE.\s0
  .IP "\fB\-mpaired\-single\fR" 4
  .IX Item "-mpaired-single"
  .PD 0
*************** hardware floating-point support to be en
*** 16094,16100 ****
  .IP "\fB\-mno\-mips3d\fR" 4
  .IX Item "-mno-mips3d"
  .PD
! Use (do not use) the \s-1MIPS\-3D\s0 \s-1ASE\s0.  
  The option \fB\-mips3d\fR implies \fB\-mpaired\-single\fR.
  .IP "\fB\-mmicromips\fR" 4
  .IX Item "-mmicromips"
--- 16100,16106 ----
  .IP "\fB\-mno\-mips3d\fR" 4
  .IX Item "-mno-mips3d"
  .PD
! Use (do not use) the \s-1MIPS\-3D ASE.\s0  
  The option \fB\-mips3d\fR implies \fB\-mpaired\-single\fR.
  .IP "\fB\-mmicromips\fR" 4
  .IX Item "-mmicromips"
*************** Use (do not use) \s-1MT\s0 Multithreadin
*** 16119,16125 ****
  .IP "\fB\-mno\-mcu\fR" 4
  .IX Item "-mno-mcu"
  .PD
! Use (do not use) the \s-1MIPS\s0 \s-1MCU\s0 \s-1ASE\s0 instructions.
  .IP "\fB\-meva\fR" 4
  .IX Item "-meva"
  .PD 0
--- 16125,16131 ----
  .IP "\fB\-mno\-mcu\fR" 4
  .IX Item "-mno-mcu"
  .PD
! Use (do not use) the \s-1MIPS MCU ASE\s0 instructions.
  .IP "\fB\-meva\fR" 4
  .IX Item "-meva"
  .PD 0
*************** determined.
*** 16151,16157 ****
  Force \f(CW\*(C`long\*(C'\fR, \f(CW\*(C`int\*(C'\fR, and pointer types to be 32 bits wide.
  .Sp
  The default size of \f(CW\*(C`int\*(C'\fRs, \f(CW\*(C`long\*(C'\fRs and pointers depends on
! the \s-1ABI\s0.  All the supported ABIs use 32\-bit \f(CW\*(C`int\*(C'\fRs.  The n64 \s-1ABI\s0
  uses 64\-bit \f(CW\*(C`long\*(C'\fRs, as does the 64\-bit \s-1EABI\s0; the others use
  32\-bit \f(CW\*(C`long\*(C'\fRs.  Pointers are the same size as \f(CW\*(C`long\*(C'\fRs,
  or the same size as integer registers, whichever is smaller.
--- 16157,16163 ----
  Force \f(CW\*(C`long\*(C'\fR, \f(CW\*(C`int\*(C'\fR, and pointer types to be 32 bits wide.
  .Sp
  The default size of \f(CW\*(C`int\*(C'\fRs, \f(CW\*(C`long\*(C'\fRs and pointers depends on
! the \s-1ABI.\s0  All the supported ABIs use 32\-bit \f(CW\*(C`int\*(C'\fRs.  The n64 \s-1ABI\s0
  uses 64\-bit \f(CW\*(C`long\*(C'\fRs, as does the 64\-bit \s-1EABI\s0; the others use
  32\-bit \f(CW\*(C`long\*(C'\fRs.  Pointers are the same size as \f(CW\*(C`long\*(C'\fRs,
  or the same size as integer registers, whichever is smaller.
*************** or the same size as integer registers, w
*** 16162,16168 ****
  .IX Item "-mno-sym32"
  .PD
  Assume (do not assume) that all symbols have 32\-bit values, regardless
! of the selected \s-1ABI\s0.  This option is useful in combination with
  \&\fB\-mabi=64\fR and \fB\-mno\-abicalls\fR because it allows \s-1GCC\s0
  to generate shorter and faster references to symbolic addresses.
  .IP "\fB\-G\fR \fInum\fR" 4
--- 16168,16174 ----
  .IX Item "-mno-sym32"
  .PD
  Assume (do not assume) that all symbols have 32\-bit values, regardless
! of the selected \s-1ABI.\s0  This option is useful in combination with
  \&\fB\-mabi=64\fR and \fB\-mno\-abicalls\fR because it allows \s-1GCC\s0
  to generate shorter and faster references to symbolic addresses.
  .IP "\fB\-G\fR \fInum\fR" 4
*************** but other instructions must not do so.
*** 16267,16279 ****
  and 4KSd processors when the code TLBs have the Read Inhibit bit set.
  It is also useful on processors that can be configured to have a dual
  instruction/data \s-1SRAM\s0 interface and that, like the M4K, automatically
! redirect PC-relative loads to the instruction \s-1RAM\s0.
  .IP "\fB\-mcode\-readable=no\fR" 4
  .IX Item "-mcode-readable=no"
  Instructions must not access executable sections.  This option can be
  useful on targets that are configured to have a dual instruction/data
  \&\s-1SRAM\s0 interface but that (unlike the M4K) do not automatically redirect
! PC-relative loads to the instruction \s-1RAM\s0.
  .RE
  .RS 4
  .RE
--- 16273,16285 ----
  and 4KSd processors when the code TLBs have the Read Inhibit bit set.
  It is also useful on processors that can be configured to have a dual
  instruction/data \s-1SRAM\s0 interface and that, like the M4K, automatically
! redirect PC-relative loads to the instruction \s-1RAM.\s0
  .IP "\fB\-mcode\-readable=no\fR" 4
  .IX Item "-mcode-readable=no"
  Instructions must not access executable sections.  This option can be
  useful on targets that are configured to have a dual instruction/data
  \&\s-1SRAM\s0 interface but that (unlike the M4K) do not automatically redirect
! PC-relative loads to the instruction \s-1RAM.\s0
  .RE
  .RS 4
  .RE
*************** The default is \fB\-mcheck\-zero\-divisi
*** 16315,16321 ****
  .PD
  \&\s-1MIPS\s0 systems check for division by zero by generating either a
  conditional trap or a break instruction.  Using traps results in
! smaller code, but is only supported on \s-1MIPS\s0 \s-1II\s0 and later.  Also, some
  versions of the Linux kernel have a bug that prevents trap from
  generating the proper signal (\f(CW\*(C`SIGFPE\*(C'\fR).  Use \fB\-mdivide\-traps\fR to
  allow conditional traps on architectures that support them and
--- 16321,16327 ----
  .PD
  \&\s-1MIPS\s0 systems check for division by zero by generating either a
  conditional trap or a break instruction.  Using traps results in
! smaller code, but is only supported on \s-1MIPS II\s0 and later.  Also, some
  versions of the Linux kernel have a bug that prevents trap from
  generating the proper signal (\f(CW\*(C`SIGFPE\*(C'\fR).  Use \fB\-mdivide\-traps\fR to
  allow conditional traps on architectures that support them and
*************** This option has no effect on abicalls co
*** 16353,16359 ****
  .IX Item "-mno-mad"
  .PD
  Enable (disable) use of the \f(CW\*(C`mad\*(C'\fR, \f(CW\*(C`madu\*(C'\fR and \f(CW\*(C`mul\*(C'\fR
! instructions, as provided by the R4650 \s-1ISA\s0.
  .IP "\fB\-mimadd\fR" 4
  .IX Item "-mimadd"
  .PD 0
--- 16359,16365 ----
  .IX Item "-mno-mad"
  .PD
  Enable (disable) use of the \f(CW\*(C`mad\*(C'\fR, \f(CW\*(C`madu\*(C'\fR and \f(CW\*(C`mul\*(C'\fR
! instructions, as provided by the R4650 \s-1ISA.\s0
  .IP "\fB\-mimadd\fR" 4
  .IX Item "-mimadd"
  .PD 0
*************** assembler files (with a \fB.s\fR suffix)
*** 16391,16397 ****
  .IX Item "-mno-fix-24k"
  .PD
  Work around the 24K E48 (lost data on stores during refill) errata.
! The workarounds are implemented by the assembler rather than by \s-1GCC\s0.
  .IP "\fB\-mfix\-r4000\fR" 4
  .IX Item "-mfix-r4000"
  .PD 0
--- 16397,16403 ----
  .IX Item "-mno-fix-24k"
  .PD
  Work around the 24K E48 (lost data on stores during refill) errata.
! The workarounds are implemented by the assembler rather than by \s-1GCC.\s0
  .IP "\fB\-mfix\-r4000\fR" 4
  .IX Item "-mfix-r4000"
  .PD 0
*************** otherwise.
*** 16452,16458 ****
  .IX Item "-mno-fix-rm7000"
  .PD
  Work around the \s-1RM7000\s0 \f(CW\*(C`dmult\*(C'\fR/\f(CW\*(C`dmultu\*(C'\fR errata.  The
! workarounds are implemented by the assembler rather than by \s-1GCC\s0.
  .IP "\fB\-mfix\-vr4120\fR" 4
  .IX Item "-mfix-vr4120"
  .PD 0
--- 16458,16464 ----
  .IX Item "-mno-fix-rm7000"
  .PD
  Work around the \s-1RM7000\s0 \f(CW\*(C`dmult\*(C'\fR/\f(CW\*(C`dmultu\*(C'\fR errata.  The
! workarounds are implemented by the assembler rather than by \s-1GCC.\s0
  .IP "\fB\-mfix\-vr4120\fR" 4
  .IX Item "-mfix-vr4120"
  .PD 0
*************** instructions.  These errata are handled
*** 16479,16485 ****
  .IP "\fB\-mfix\-vr4130\fR" 4
  .IX Item "-mfix-vr4130"
  Work around the \s-1VR4130\s0 \f(CW\*(C`mflo\*(C'\fR/\f(CW\*(C`mfhi\*(C'\fR errata.  The
! workarounds are implemented by the assembler rather than by \s-1GCC\s0,
  although \s-1GCC\s0 avoids using \f(CW\*(C`mflo\*(C'\fR and \f(CW\*(C`mfhi\*(C'\fR if the
  \&\s-1VR4130\s0 \f(CW\*(C`macc\*(C'\fR, \f(CW\*(C`macchi\*(C'\fR, \f(CW\*(C`dmacc\*(C'\fR and \f(CW\*(C`dmacchi\*(C'\fR
  instructions are available instead.
--- 16485,16491 ----
  .IP "\fB\-mfix\-vr4130\fR" 4
  .IX Item "-mfix-vr4130"
  Work around the \s-1VR4130\s0 \f(CW\*(C`mflo\*(C'\fR/\f(CW\*(C`mfhi\*(C'\fR errata.  The
! workarounds are implemented by the assembler rather than by \s-1GCC,\s0
  although \s-1GCC\s0 avoids using \f(CW\*(C`mflo\*(C'\fR and \f(CW\*(C`mfhi\*(C'\fR if the
  \&\s-1VR4130\s0 \f(CW\*(C`macc\*(C'\fR, \f(CW\*(C`macchi\*(C'\fR, \f(CW\*(C`dmacc\*(C'\fR and \f(CW\*(C`dmacchi\*(C'\fR
  instructions are available instead.
*************** instructions are available instead.
*** 16489,16495 ****
  .IP "\fB\-mno\-fix\-sb1\fR" 4
  .IX Item "-mno-fix-sb1"
  .PD
! Work around certain \s-1SB\-1\s0 \s-1CPU\s0 core errata.
  (This flag currently works around the \s-1SB\-1\s0 revision 2
  \&\*(L"F1\*(R" and \*(L"F2\*(R" floating-point errata.)
  .IP "\fB\-mr10k\-cache\-barrier=\fR\fIsetting\fR" 4
--- 16495,16501 ----
  .IP "\fB\-mno\-fix\-sb1\fR" 4
  .IX Item "-mno-fix-sb1"
  .PD
! Work around certain \s-1SB\-1 CPU\s0 core errata.
  (This flag currently works around the \s-1SB\-1\s0 revision 2
  \&\*(L"F1\*(R" and \*(L"F2\*(R" floating-point errata.)
  .IP "\fB\-mr10k\-cache\-barrier=\fR\fIsetting\fR" 4
*************** Specifies whether \s-1FP\s0 exceptions a
*** 16603,16609 ****
  The default is that \s-1FP\s0 exceptions are
  enabled.
  .Sp
! For instance, on the \s-1SB\-1\s0, if \s-1FP\s0 exceptions are disabled, and we are emitting
  64\-bit code, then we can use both \s-1FP\s0 pipes.  Otherwise, we can only use one
  \&\s-1FP\s0 pipe.
  .IP "\fB\-mvr4130\-align\fR" 4
--- 16609,16615 ----
  The default is that \s-1FP\s0 exceptions are
  enabled.
  .Sp
! For instance, on the \s-1SB\-1,\s0 if \s-1FP\s0 exceptions are disabled, and we are emitting
  64\-bit code, then we can use both \s-1FP\s0 pipes.  Otherwise, we can only use one
  \&\s-1FP\s0 pipe.
  .IP "\fB\-mvr4130\-align\fR" 4
*************** instructions together if the first one i
*** 16617,16623 ****
  option is enabled, \s-1GCC\s0 aligns pairs of instructions that it
  thinks should execute in parallel.
  .Sp
! This option only has an effect when optimizing for the \s-1VR4130\s0.
  It normally makes code faster, but at the expense of making it bigger.
  It is enabled by default at optimization level \fB\-O3\fR.
  .IP "\fB\-msynci\fR" 4
--- 16623,16629 ----
  option is enabled, \s-1GCC\s0 aligns pairs of instructions that it
  thinks should execute in parallel.
  .Sp
! This option only has an effect when optimizing for the \s-1VR4130.\s0
  It normally makes code faster, but at the expense of making it bigger.
  It is enabled by default at optimization level \fB\-O3\fR.
  .IP "\fB\-msynci\fR" 4
*************** to the \f(CW\*(C`rE\*(C'\fR epsilon regi
*** 16706,16712 ****
  .PD
  Generate code that passes function parameters and return values that (in
  the called function) are seen as registers \f(CW$0\fR and up, as opposed to
! the \s-1GNU\s0 \s-1ABI\s0 which uses global registers \f(CW$231\fR and up.
  .IP "\fB\-mzero\-extend\fR" 4
  .IX Item "-mzero-extend"
  .PD 0
--- 16712,16718 ----
  .PD
  Generate code that passes function parameters and return values that (in
  the called function) are seen as registers \f(CW$0\fR and up, as opposed to
! the \s-1GNU ABI\s0 which uses global registers \f(CW$231\fR and up.
  .IP "\fB\-mzero\-extend\fR" 4
  .IX Item "-mzero-extend"
  .PD 0
*************** Do not generate code using features spec
*** 16790,16796 ****
  is the default.
  .IP "\fB\-mam33\-2\fR" 4
  .IX Item "-mam33-2"
! Generate code using features specific to the \s-1AM33/2\s0.0 processor.
  .IP "\fB\-mam34\fR" 4
  .IX Item "-mam34"
  Generate code using features specific to the \s-1AM34\s0 processor.
--- 16796,16802 ----
  is the default.
  .IP "\fB\-mam33\-2\fR" 4
  .IX Item "-mam33-2"
! Generate code using features specific to the \s-1AM33/2.0\s0 processor.
  .IP "\fB\-mam34\fR" 4
  .IX Item "-mam34"
  Generate code using features specific to the \s-1AM34\s0 processor.
*************** header file.
*** 16875,16882 ****
  The option also sets the \s-1ISA\s0 to use.  If the \s-1MCU\s0 name is one that is
  known to only support the 430 \s-1ISA\s0 then that is selected, otherwise the
  430X \s-1ISA\s0 is selected.  A generic \s-1MCU\s0 name of \fBmsp430\fR can also be
! used to select the 430 \s-1ISA\s0.  Similarly the generic \fBmsp430x\fR \s-1MCU\s0
! name selects the 430X \s-1ISA\s0.
  .Sp
  In addition an MCU-specific linker script is added to the linker
  command line.  The script's name is the name of the \s-1MCU\s0 with
--- 16881,16888 ----
  The option also sets the \s-1ISA\s0 to use.  If the \s-1MCU\s0 name is one that is
  known to only support the 430 \s-1ISA\s0 then that is selected, otherwise the
  430X \s-1ISA\s0 is selected.  A generic \s-1MCU\s0 name of \fBmsp430\fR can also be
! used to select the 430 \s-1ISA.\s0  Similarly the generic \fBmsp430x\fR \s-1MCU\s0
! name selects the 430X \s-1ISA.\s0
  .Sp
  In addition an MCU-specific linker script is added to the linker
  command line.  The script's name is the name of the \s-1MCU\s0 with
*************** This option is also passed on to the ass
*** 16889,16895 ****
  .IX Item "-mcpu="
  Specifies the \s-1ISA\s0 to use.  Accepted values are \fBmsp430\fR,
  \&\fBmsp430x\fR and \fBmsp430xv2\fR.  This option is deprecated.  The
! \&\fB\-mmcu=\fR option should be used to select the \s-1ISA\s0.
  .IP "\fB\-msim\fR" 4
  .IX Item "-msim"
  Link to the simulator runtime libraries and linker script.  Overrides
--- 16895,16901 ----
  .IX Item "-mcpu="
  Specifies the \s-1ISA\s0 to use.  Accepted values are \fBmsp430\fR,
  \&\fBmsp430x\fR and \fBmsp430xv2\fR.  This option is deprecated.  The
! \&\fB\-mmcu=\fR option should be used to select the \s-1ISA.\s0
  .IP "\fB\-msim\fR" 4
  .IX Item "-msim"
  Link to the simulator runtime libraries and linker script.  Overrides
*************** global pointer.
*** 17066,17072 ****
  .Sp
  The default is \fB\-mgpopt\fR except when \fB\-fpic\fR or
  \&\fB\-fPIC\fR is specified to generate position-independent code.
! Note that the Nios \s-1II\s0 \s-1ABI\s0 does not permit GP-relative accesses from
  shared libraries.
  .Sp
  You may need to specify \fB\-mno\-gpopt\fR explicitly when building
--- 17072,17078 ----
  .Sp
  The default is \fB\-mgpopt\fR except when \fB\-fpic\fR or
  \&\fB\-fPIC\fR is specified to generate position-independent code.
! Note that the Nios \s-1II ABI\s0 does not permit GP-relative accesses from
  shared libraries.
  .Sp
  You may need to specify \fB\-mno\-gpopt\fR explicitly when building
*************** of the default behavior of using a libra
*** 17139,17145 ****
  .Sp
  The following values of \fIinsn\fR are supported.  Except as otherwise
  noted, floating-point operations are expected to be implemented with
! normal \s-1IEEE\s0 754 semantics and correspond directly to the C operators or the
  equivalent \s-1GCC\s0 built-in functions.
  .Sp
  Single-precision floating point:
--- 17145,17151 ----
  .Sp
  The following values of \fIinsn\fR are supported.  Except as otherwise
  noted, floating-point operations are expected to be implemented with
! normal \s-1IEEE 754\s0 semantics and correspond directly to the C operators or the
  equivalent \s-1GCC\s0 built-in functions.
  .Sp
  Single-precision floating point:
*************** configuration by using the \f(CW\*(C`tar
*** 17298,17311 ****
  function attribute
  or pragma.
  .PP
! These additional \fB\-m\fR options are available for the Altera Nios \s-1II\s0
! \&\s-1ELF\s0 (bare-metal) target:
  .IP "\fB\-mhal\fR" 4
  .IX Item "-mhal"
! Link with \s-1HAL\s0 \s-1BSP\s0.  This suppresses linking with the GCC-provided C runtime
  startup and termination code, and is typically used in conjunction with
  \&\fB\-msys\-crt0=\fR to specify the location of the alternate startup code
! provided by the \s-1HAL\s0 \s-1BSP\s0.
  .IP "\fB\-msmallc\fR" 4
  .IX Item "-msmallc"
  Link with a limited version of the C library, \fB\-lsmallc\fR, rather than
--- 17304,17317 ----
  function attribute
  or pragma.
  .PP
! These additional \fB\-m\fR options are available for the Altera Nios \s-1II
! ELF\s0 (bare-metal) target:
  .IP "\fB\-mhal\fR" 4
  .IX Item "-mhal"
! Link with \s-1HAL BSP.\s0  This suppresses linking with the GCC-provided C runtime
  startup and termination code, and is typically used in conjunction with
  \&\fB\-msys\-crt0=\fR to specify the location of the alternate startup code
! provided by the \s-1HAL BSP.\s0
  .IP "\fB\-msmallc\fR" 4
  .IX Item "-msmallc"
  Link with a limited version of the C library, \fB\-lsmallc\fR, rather than
*************** when linking.  This option is only usefu
*** 17319,17325 ****
  \&\fIsystemlib\fR is the library name of the library that provides
  low-level system calls required by the C library,
  e.g. \f(CW\*(C`read\*(C'\fR and \f(CW\*(C`write\*(C'\fR.
! This option is typically used to link with a library provided by a \s-1HAL\s0 \s-1BSP\s0.
  .PP
  \fINvidia \s-1PTX\s0 Options\fR
  .IX Subsection "Nvidia PTX Options"
--- 17325,17331 ----
  \&\fIsystemlib\fR is the library name of the library that provides
  low-level system calls required by the C library,
  e.g. \f(CW\*(C`read\*(C'\fR and \f(CW\*(C`write\*(C'\fR.
! This option is typically used to link with a library provided by a \s-1HAL BSP.\s0
  .PP
  \fINvidia \s-1PTX\s0 Options\fR
  .IX Subsection "Nvidia PTX Options"
*************** These options are defined for Nvidia \s-
*** 17331,17337 ****
  .IP "\fB\-m64\fR" 4
  .IX Item "-m64"
  .PD
! Generate code for 32\-bit or 64\-bit \s-1ABI\s0.
  .IP "\fB\-mmainkernel\fR" 4
  .IX Item "-mmainkernel"
  Link in code for a _\|_main kernel.  This is for stand-alone instead of
--- 17337,17343 ----
  .IP "\fB\-m64\fR" 4
  .IX Item "-m64"
  .PD
! Generate code for 32\-bit or 64\-bit \s-1ABI.\s0
  .IP "\fB\-mmainkernel\fR" 4
  .IX Item "-mmainkernel"
  Link in code for a _\|_main kernel.  This is for stand-alone instead of
*************** Return floating-point results in ac0 (fr
*** 17356,17368 ****
  Return floating-point results in memory.  This is the default.
  .IP "\fB\-m40\fR" 4
  .IX Item "-m40"
! Generate code for a \s-1PDP\-11/40\s0.
  .IP "\fB\-m45\fR" 4
  .IX Item "-m45"
! Generate code for a \s-1PDP\-11/45\s0.  This is the default.
  .IP "\fB\-m10\fR" 4
  .IX Item "-m10"
! Generate code for a \s-1PDP\-11/10\s0.
  .IP "\fB\-mbcopy\-builtin\fR" 4
  .IX Item "-mbcopy-builtin"
  Use inline \f(CW\*(C`movmemhi\*(C'\fR patterns for copying memory.  This is the
--- 17362,17374 ----
  Return floating-point results in memory.  This is the default.
  .IP "\fB\-m40\fR" 4
  .IX Item "-m40"
! Generate code for a \s-1PDP\-11/40.\s0
  .IP "\fB\-m45\fR" 4
  .IX Item "-m45"
! Generate code for a \s-1PDP\-11/45.\s0  This is the default.
  .IP "\fB\-m10\fR" 4
  .IX Item "-m10"
! Generate code for a \s-1PDP\-11/10.\s0
  .IP "\fB\-mbcopy\-builtin\fR" 4
  .IX Item "-mbcopy-builtin"
  Use inline \f(CW\*(C`movmemhi\*(C'\fR patterns for copying memory.  This is the
*************** for \fIae_type\fR are \fB\s-1ANY\s0\fR,
*** 17434,17447 ****
  generated with this option runs on any of the other \s-1AE\s0 types.  The
  code is not as efficient as it would be if compiled for a specific
  \&\s-1AE\s0 type, and some types of operation (e.g., multiplication) do not
! work properly on all types of \s-1AE\s0.
  .Sp
! \&\fB\-mae=MUL\fR selects a \s-1MUL\s0 \s-1AE\s0 type.  This is the most useful \s-1AE\s0 type
  for compiled code, and is the default.
  .Sp
! \&\fB\-mae=MAC\fR selects a DSP-style \s-1MAC\s0 \s-1AE\s0.  Code compiled with this
  option may suffer from poor performance of byte (char) manipulation,
! since the \s-1DSP\s0 \s-1AE\s0 does not provide hardware support for byte load/stores.
  .IP "\fB\-msymbol\-as\-address\fR" 4
  .IX Item "-msymbol-as-address"
  Enable the compiler to directly use a symbol name as an address in a
--- 17440,17453 ----
  generated with this option runs on any of the other \s-1AE\s0 types.  The
  code is not as efficient as it would be if compiled for a specific
  \&\s-1AE\s0 type, and some types of operation (e.g., multiplication) do not
! work properly on all types of \s-1AE.\s0
  .Sp
! \&\fB\-mae=MUL\fR selects a \s-1MUL AE\s0 type.  This is the most useful \s-1AE\s0 type
  for compiled code, and is the default.
  .Sp
! \&\fB\-mae=MAC\fR selects a DSP-style \s-1MAC AE.\s0  Code compiled with this
  option may suffer from poor performance of byte (char) manipulation,
! since the \s-1DSP AE\s0 does not provide hardware support for byte load/stores.
  .IP "\fB\-msymbol\-as\-address\fR" 4
  .IX Item "-msymbol-as-address"
  Enable the compiler to directly use a symbol name as an address in a
*************** rather than being permanently enabled.
*** 17454,17460 ****
  .IX Item "-mno-inefficient-warnings"
  Disables warnings about the generation of inefficient code.  These
  warnings can be generated, for example, when compiling code that
! performs byte-level memory operations on the \s-1MAC\s0 \s-1AE\s0 type.  The \s-1MAC\s0 \s-1AE\s0 has
  no hardware support for byte-level memory operations, so all byte
  load/stores must be synthesized from word load/store operations.  This is
  inefficient and a warning is generated to indicate
--- 17460,17466 ----
  .IX Item "-mno-inefficient-warnings"
  Disables warnings about the generation of inefficient code.  These
  warnings can be generated, for example, when compiling code that
! performs byte-level memory operations on the \s-1MAC AE\s0 type.  The \s-1MAC AE\s0 has
  no hardware support for byte-level memory operations, so all byte
  load/stores must be synthesized from word load/store operations.  This is
  inefficient and a warning is generated to indicate
*************** Make the \f(CW\*(C`double\*(C'\fR data t
*** 17496,17505 ****
  or 32 bits (\fB\-m32bit\-doubles\fR) in size.  The default is
  \&\fB\-m32bit\-doubles\fR.
  .PP
! \fI\s-1IBM\s0 \s-1RS/6000\s0 and PowerPC Options\fR
  .IX Subsection "IBM RS/6000 and PowerPC Options"
  .PP
! These \fB\-m\fR options are defined for the \s-1IBM\s0 \s-1RS/6000\s0 and PowerPC:
  .IP "\fB\-mpowerpc\-gpopt\fR" 4
  .IX Item "-mpowerpc-gpopt"
  .PD 0
--- 17502,17511 ----
  or 32 bits (\fB\-m32bit\-doubles\fR) in size.  The default is
  \&\fB\-m32bit\-doubles\fR.
  .PP
! \fI\s-1IBM RS/6000\s0 and PowerPC Options\fR
  .IX Subsection "IBM RS/6000 and PowerPC Options"
  .PP
! These \fB\-m\fR options are defined for the \s-1IBM RS/6000\s0 and PowerPC:
  .IP "\fB\-mpowerpc\-gpopt\fR" 4
  .IX Item "-mpowerpc-gpopt"
  .PD 0
*************** These \fB\-m\fR options are defined for
*** 17544,17550 ****
  .PD
  You use these options to specify which instructions are available on the
  processor you are using.  The default value of these options is
! determined when configuring \s-1GCC\s0.  Specifying the
  \&\fB\-mcpu=\fR\fIcpu_type\fR overrides the specification of these
  options.  We recommend you use the \fB\-mcpu=\fR\fIcpu_type\fR option
  rather than the options listed above.
--- 17550,17556 ----
  .PD
  You use these options to specify which instructions are available on the
  processor you are using.  The default value of these options is
! determined when configuring \s-1GCC.\s0  Specifying the
  \&\fB\-mcpu=\fR\fIcpu_type\fR overrides the specification of these
  options.  We recommend you use the \fB\-mcpu=\fR\fIcpu_type\fR option
  rather than the options listed above.
*************** following options:
*** 17617,17623 ****
  \&\-mpopcntb \-mpopcntd  \-mpowerpc64 
  \&\-mpowerpc\-gpopt  \-mpowerpc\-gfxopt  \-msingle\-float \-mdouble\-float 
  \&\-msimple\-fpu \-mstring  \-mmulhw  \-mdlmzb  \-mmfpgpr \-mvsx 
! \&\-mcrypto \-mdirect\-move \-mpower8\-fusion \-mpower8\-vector 
  \&\-mquad\-memory \-mquad\-memory\-atomic\fR
  .Sp
  The particular options set for any particular \s-1CPU\s0 varies between
--- 17623,17629 ----
  \&\-mpopcntb \-mpopcntd  \-mpowerpc64 
  \&\-mpowerpc\-gpopt  \-mpowerpc\-gfxopt  \-msingle\-float \-mdouble\-float 
  \&\-msimple\-fpu \-mstring  \-mmulhw  \-mdlmzb  \-mmfpgpr \-mvsx 
! \&\-mcrypto \-mdirect\-move \-mhtm \-mpower8\-fusion \-mpower8\-vector 
  \&\-mquad\-memory \-mquad\-memory\-atomic\fR
  .Sp
  The particular options set for any particular \s-1CPU\s0 varies between
*************** capabilities.  If you wish to set an ind
*** 17627,17633 ****
  value, you may specify it after the \fB\-mcpu\fR option, like
  \&\fB\-mcpu=970 \-mno\-altivec\fR.
  .Sp
! On \s-1AIX\s0, the \fB\-maltivec\fR and \fB\-mpowerpc64\fR options are
  not enabled or disabled by the \fB\-mcpu\fR option at present because
  \&\s-1AIX\s0 does not have full support for these options.  You may still
  enable or disable them individually if you're sure it'll work in your
--- 17633,17639 ----
  value, you may specify it after the \fB\-mcpu\fR option, like
  \&\fB\-mcpu=970 \-mno\-altivec\fR.
  .Sp
! On \s-1AIX,\s0 the \fB\-maltivec\fR and \fB\-mpowerpc64\fR options are
  not enabled or disabled by the \fB\-mcpu\fR option at present because
  \&\s-1AIX\s0 does not have full support for these options.  You may still
  enable or disable them individually if you're sure it'll work in your
*************** Generate code that allows \fBld\fR and \
*** 17715,17728 ****
  to build executables and shared
  libraries with non-executable \f(CW\*(C`.plt\*(C'\fR and \f(CW\*(C`.got\*(C'\fR sections.
  This is a PowerPC
! 32\-bit \s-1SYSV\s0 \s-1ABI\s0 option.
  .IP "\fB\-mbss\-plt\fR" 4
  .IX Item "-mbss-plt"
  Generate code that uses a \s-1BSS\s0 \f(CW\*(C`.plt\*(C'\fR section that \fBld.so\fR
  fills in, and
  requires \f(CW\*(C`.plt\*(C'\fR and \f(CW\*(C`.got\*(C'\fR
  sections that are both writable and executable.
! This is a PowerPC 32\-bit \s-1SYSV\s0 \s-1ABI\s0 option.
  .IP "\fB\-misel\fR" 4
  .IX Item "-misel"
  .PD 0
--- 17721,17734 ----
  to build executables and shared
  libraries with non-executable \f(CW\*(C`.plt\*(C'\fR and \f(CW\*(C`.got\*(C'\fR sections.
  This is a PowerPC
! 32\-bit \s-1SYSV ABI\s0 option.
  .IP "\fB\-mbss\-plt\fR" 4
  .IX Item "-mbss-plt"
  Generate code that uses a \s-1BSS\s0 \f(CW\*(C`.plt\*(C'\fR section that \fBld.so\fR
  fills in, and
  requires \f(CW\*(C`.plt\*(C'\fR and \f(CW\*(C`.got\*(C'\fR
  sections that are both writable and executable.
! This is a PowerPC 32\-bit \s-1SYSV ABI\s0 option.
  .IP "\fB\-misel\fR" 4
  .IX Item "-misel"
  .PD 0
*************** more direct access to the \s-1VSX\s0 ins
*** 17771,17777 ****
  .PD
  Enable the use (disable) of the built-in functions that allow direct
  access to the cryptographic instructions that were added in version
! 2.07 of the PowerPC \s-1ISA\s0.
  .IP "\fB\-mdirect\-move\fR" 4
  .IX Item "-mdirect-move"
  .PD 0
--- 17777,17783 ----
  .PD
  Enable the use (disable) of the built-in functions that allow direct
  access to the cryptographic instructions that were added in version
! 2.07 of the PowerPC \s-1ISA.\s0
  .IP "\fB\-mdirect\-move\fR" 4
  .IX Item "-mdirect-move"
  .PD 0
*************** access to the cryptographic instructions
*** 17780,17786 ****
  .PD
  Generate code that uses (does not use) the instructions to move data
  between the general purpose registers and the vector/scalar (\s-1VSX\s0)
! registers that were added in version 2.07 of the PowerPC \s-1ISA\s0.
  .IP "\fB\-mpower8\-fusion\fR" 4
  .IX Item "-mpower8-fusion"
  .PD 0
--- 17786,17801 ----
  .PD
  Generate code that uses (does not use) the instructions to move data
  between the general purpose registers and the vector/scalar (\s-1VSX\s0)
! registers that were added in version 2.07 of the PowerPC \s-1ISA.\s0
! .IP "\fB\-mhtm\fR" 4
! .IX Item "-mhtm"
! .PD 0
! .IP "\fB\-mno\-htm\fR" 4
! .IX Item "-mno-htm"
! .PD
! Enable (disable) the use of the built-in functions that allow direct
! access to the Hardware Transactional Memory (\s-1HTM\s0) instructions that
! were added in version 2.07 of the PowerPC \s-1ISA.\s0
  .IP "\fB\-mpower8\-fusion\fR" 4
  .IX Item "-mpower8-fusion"
  .PD 0
*************** later processors.
*** 17797,17803 ****
  .IX Item "-mno-power8-vector"
  .PD
  Generate code that uses (does not use) the vector and scalar
! instructions that were added in version 2.07 of the PowerPC \s-1ISA\s0.  Also
  enable the use of built-in functions that allow more direct access to
  the vector instructions.
  .IP "\fB\-mquad\-memory\fR" 4
--- 17812,17818 ----
  .IX Item "-mno-power8-vector"
  .PD
  Generate code that uses (does not use) the vector and scalar
! instructions that were added in version 2.07 of the PowerPC \s-1ISA.\s0  Also
  enable the use of built-in functions that allow more direct access to
  the vector instructions.
  .IP "\fB\-mquad\-memory\fR" 4
*************** instructions.  The \fB\-mquad\-memory\-a
*** 17827,17833 ****
  Generate code that uses (does not use) the scalar double precision
  instructions that target all 64 registers in the vector/scalar
  floating point register set that were added in version 2.06 of the
! PowerPC \s-1ISA\s0.  \fB\-mupper\-regs\-df\fR is turned on by default if you
  use any of the \fB\-mcpu=power7\fR, \fB\-mcpu=power8\fR, or
  \&\fB\-mvsx\fR options.
  .IP "\fB\-mupper\-regs\-sf\fR" 4
--- 17842,17848 ----
  Generate code that uses (does not use) the scalar double precision
  instructions that target all 64 registers in the vector/scalar
  floating point register set that were added in version 2.06 of the
! PowerPC \s-1ISA.\s0  \fB\-mupper\-regs\-df\fR is turned on by default if you
  use any of the \fB\-mcpu=power7\fR, \fB\-mcpu=power8\fR, or
  \&\fB\-mvsx\fR options.
  .IP "\fB\-mupper\-regs\-sf\fR" 4
*************** use any of the \fB\-mcpu=power7\fR, \fB\
*** 17839,17845 ****
  Generate code that uses (does not use) the scalar single precision
  instructions that target all 64 registers in the vector/scalar
  floating point register set that were added in version 2.07 of the
! PowerPC \s-1ISA\s0.  \fB\-mupper\-regs\-sf\fR is turned on by default if you
  use either of the \fB\-mcpu=power8\fR or \fB\-mpower8\-vector\fR
  options.
  .IP "\fB\-mupper\-regs\fR" 4
--- 17854,17860 ----
  Generate code that uses (does not use) the scalar single precision
  instructions that target all 64 registers in the vector/scalar
  floating point register set that were added in version 2.07 of the
! PowerPC \s-1ISA.\s0  \fB\-mupper\-regs\-sf\fR is turned on by default if you
  use either of the \fB\-mcpu=power8\fR or \fB\-mpower8\-vector\fR
  options.
  .IP "\fB\-mupper\-regs\fR" 4
*************** Modify generation of the \s-1TOC\s0 (Tab
*** 17900,17907 ****
  every executable file.  The \fB\-mfull\-toc\fR option is selected by
  default.  In that case, \s-1GCC\s0 allocates at least one \s-1TOC\s0 entry for
  each unique non-automatic variable reference in your program.  \s-1GCC\s0
! also places floating-point constants in the \s-1TOC\s0.  However, only
! 16,384 entries are available in the \s-1TOC\s0.
  .Sp
  If you receive a linker error message that saying you have overflowed
  the available \s-1TOC\s0 space, you can reduce the amount of \s-1TOC\s0 space used
--- 17915,17922 ----
  every executable file.  The \fB\-mfull\-toc\fR option is selected by
  default.  In that case, \s-1GCC\s0 allocates at least one \s-1TOC\s0 entry for
  each unique non-automatic variable reference in your program.  \s-1GCC\s0
! also places floating-point constants in the \s-1TOC.\s0  However, only
! 16,384 entries are available in the \s-1TOC.\s0
  .Sp
  If you receive a linker error message that saying you have overflowed
  the available \s-1TOC\s0 space, you can reduce the amount of \s-1TOC\s0 space used
*************** with the \fB\-mno\-fp\-in\-toc\fR and \f
*** 17909,17915 ****
  \&\fB\-mno\-fp\-in\-toc\fR prevents \s-1GCC\s0 from putting floating-point
  constants in the \s-1TOC\s0 and \fB\-mno\-sum\-in\-toc\fR forces \s-1GCC\s0 to
  generate code to calculate the sum of an address and a constant at
! run time instead of putting that sum into the \s-1TOC\s0.  You may specify one
  or both of these options.  Each causes \s-1GCC\s0 to produce very slightly
  slower and larger code at the expense of conserving \s-1TOC\s0 space.
  .Sp
--- 17924,17930 ----
  \&\fB\-mno\-fp\-in\-toc\fR prevents \s-1GCC\s0 from putting floating-point
  constants in the \s-1TOC\s0 and \fB\-mno\-sum\-in\-toc\fR forces \s-1GCC\s0 to
  generate code to calculate the sum of an address and a constant at
! run time instead of putting that sum into the \s-1TOC.\s0  You may specify one
  or both of these options.  Each causes \s-1GCC\s0 to produce very slightly
  slower and larger code at the expense of conserving \s-1TOC\s0 space.
  .Sp
*************** only on files that contain less frequent
*** 17925,17931 ****
  .IP "\fB\-maix32\fR" 4
  .IX Item "-maix32"
  .PD
! Enable 64\-bit \s-1AIX\s0 \s-1ABI\s0 and calling convention: 64\-bit pointers, 64\-bit
  \&\f(CW\*(C`long\*(C'\fR type, and the infrastructure needed to support them.
  Specifying \fB\-maix64\fR implies \fB\-mpowerpc64\fR,
  while \fB\-maix32\fR disables the 64\-bit \s-1ABI\s0 and
--- 17940,17946 ----
  .IP "\fB\-maix32\fR" 4
  .IX Item "-maix32"
  .PD
! Enable 64\-bit \s-1AIX ABI\s0 and calling convention: 64\-bit pointers, 64\-bit
  \&\f(CW\*(C`long\*(C'\fR type, and the infrastructure needed to support them.
  Specifying \fB\-maix64\fR implies \fB\-mpowerpc64\fR,
  while \fB\-maix32\fR disables the 64\-bit \s-1ABI\s0 and
*************** implies \fB\-mno\-powerpc64\fR.  \s-1GCC
*** 17936,17943 ****
  .IP "\fB\-mno\-xl\-compat\fR" 4
  .IX Item "-mno-xl-compat"
  .PD
! Produce code that conforms more closely to \s-1IBM\s0 \s-1XL\s0 compiler semantics
! when using AIX-compatible \s-1ABI\s0.  Pass floating-point arguments to
  prototyped functions beyond the register save area (\s-1RSA\s0) on the stack
  in addition to argument FPRs.  Do not assume that most significant
  double in 128\-bit long double value is properly rounded when comparing
--- 17951,17958 ----
  .IP "\fB\-mno\-xl\-compat\fR" 4
  .IX Item "-mno-xl-compat"
  .PD
! Produce code that conforms more closely to \s-1IBM XL\s0 compiler semantics
! when using AIX-compatible \s-1ABI.\s0  Pass floating-point arguments to
  prototyped functions beyond the register save area (\s-1RSA\s0) on the stack
  in addition to argument FPRs.  Do not assume that most significant
  double in 128\-bit long double value is properly rounded when comparing
*************** support routines.
*** 17946,17961 ****
  .Sp
  The \s-1AIX\s0 calling convention was extended but not initially documented to
  handle an obscure K&R C case of calling a function that takes the
! address of its arguments with fewer arguments than declared.  \s-1IBM\s0 \s-1XL\s0
  compilers access floating-point arguments that do not fit in the
  \&\s-1RSA\s0 from the stack when a subroutine is compiled without
  optimization.  Because always storing floating-point arguments on the
  stack is inefficient and rarely needed, this option is not enabled by
! default and only is necessary when calling subroutines compiled by \s-1IBM\s0
! \&\s-1XL\s0 compilers without optimization.
  .IP "\fB\-mpe\fR" 4
  .IX Item "-mpe"
! Support \fI\s-1IBM\s0 \s-1RS/6000\s0 \s-1SP\s0\fR \fIParallel Environment\fR (\s-1PE\s0).  Link an
  application written to use message passing with special startup code to
  enable the application to run.  The system must have \s-1PE\s0 installed in the
  standard location (\fI/usr/lpp/ppe.poe/\fR), or the \fIspecs\fR file
--- 17961,17976 ----
  .Sp
  The \s-1AIX\s0 calling convention was extended but not initially documented to
  handle an obscure K&R C case of calling a function that takes the
! address of its arguments with fewer arguments than declared.  \s-1IBM XL\s0
  compilers access floating-point arguments that do not fit in the
  \&\s-1RSA\s0 from the stack when a subroutine is compiled without
  optimization.  Because always storing floating-point arguments on the
  stack is inefficient and rarely needed, this option is not enabled by
! default and only is necessary when calling subroutines compiled by \s-1IBM
! XL\s0 compilers without optimization.
  .IP "\fB\-mpe\fR" 4
  .IX Item "-mpe"
! Support \fI\s-1IBM RS/6000 SP\s0\fR \fIParallel Environment\fR (\s-1PE\s0).  Link an
  application written to use message passing with special startup code to
  enable the application to run.  The system must have \s-1PE\s0 installed in the
  standard location (\fI/usr/lpp/ppe.poe/\fR), or the \fIspecs\fR file
*************** option are incompatible.
*** 17969,17979 ****
  .IP "\fB\-malign\-power\fR" 4
  .IX Item "-malign-power"
  .PD
! On \s-1AIX\s0, 32\-bit Darwin, and 64\-bit PowerPC GNU/Linux, the option
  \&\fB\-malign\-natural\fR overrides the ABI-defined alignment of larger
  types, such as floating-point doubles, on their natural size-based boundary.
  The option \fB\-malign\-power\fR instructs \s-1GCC\s0 to follow the ABI-specified
! alignment rules.  \s-1GCC\s0 defaults to the standard alignment defined in the \s-1ABI\s0.
  .Sp
  On 64\-bit Darwin, natural alignment is the default, and \fB\-malign\-power\fR
  is not supported.
--- 17984,17994 ----
  .IP "\fB\-malign\-power\fR" 4
  .IX Item "-malign-power"
  .PD
! On \s-1AIX,\s0 32\-bit Darwin, and 64\-bit PowerPC GNU/Linux, the option
  \&\fB\-malign\-natural\fR overrides the ABI-defined alignment of larger
  types, such as floating-point doubles, on their natural size-based boundary.
  The option \fB\-malign\-power\fR instructs \s-1GCC\s0 to follow the ABI-specified
! alignment rules.  \s-1GCC\s0 defaults to the standard alignment defined in the \s-1ABI.\s0
  .Sp
  On 64\-bit Darwin, natural alignment is the default, and \fB\-malign\-power\fR
  is not supported.
*************** Specify type of floating-point unit.  Va
*** 18007,18013 ****
  and \fBdp_full\fR (equivalent to \fB\-mdouble\-float\fR).
  .IP "\fB\-mxilinx\-fpu\fR" 4
  .IX Item "-mxilinx-fpu"
! Perform optimizations for the floating-point unit on Xilinx \s-1PPC\s0 405/440.
  .IP "\fB\-mmultiple\fR" 4
  .IX Item "-mmultiple"
  .PD 0
--- 18022,18028 ----
  and \fBdp_full\fR (equivalent to \fB\-mdouble\-float\fR).
  .IP "\fB\-mxilinx\-fpu\fR" 4
  .IX Item "-mxilinx-fpu"
! Perform optimizations for the floating-point unit on Xilinx \s-1PPC 405/440.\s0
  .IP "\fB\-mmultiple\fR" 4
  .IX Item "-mmultiple"
  .PD 0
*************** mapped to \fB\-ffp\-contract=off\fR.
*** 18078,18084 ****
  .IX Item "-mno-mulhw"
  .PD
  Generate code that uses (does not use) the half-word multiply and
! multiply-accumulate instructions on the \s-1IBM\s0 405, 440, 464 and 476 processors.
  These instructions are generated by default when targeting those
  processors.
  .IP "\fB\-mdlmzb\fR" 4
--- 18093,18099 ----
  .IX Item "-mno-mulhw"
  .PD
  Generate code that uses (does not use) the half-word multiply and
! multiply-accumulate instructions on the \s-1IBM 405, 440, 464\s0 and 476 processors.
  These instructions are generated by default when targeting those
  processors.
  .IP "\fB\-mdlmzb\fR" 4
*************** processors.
*** 18088,18094 ****
  .IX Item "-mno-dlmzb"
  .PD
  Generate code that uses (does not use) the string-search \fBdlmzb\fR
! instruction on the \s-1IBM\s0 405, 440, 464 and 476 processors.  This instruction is
  generated by default when targeting those processors.
  .IP "\fB\-mno\-bit\-align\fR" 4
  .IX Item "-mno-bit-align"
--- 18103,18109 ----
  .IX Item "-mno-dlmzb"
  .PD
  Generate code that uses (does not use) the string-search \fBdlmzb\fR
! instruction on the \s-1IBM 405, 440, 464\s0 and 476 processors.  This instruction is
  generated by default when targeting those processors.
  .IP "\fB\-mno\-bit\-align\fR" 4
  .IX Item "-mno-bit-align"
*************** processor in big-endian mode.  The \fB\-
*** 18168,18174 ****
  the same as \fB\-mbig\fR.
  .IP "\fB\-mdynamic\-no\-pic\fR" 4
  .IX Item "-mdynamic-no-pic"
! On Darwin and Mac \s-1OS\s0 X systems, compile code so that it is not
  relocatable, but that its external references are relocatable.  The
  resulting code is suitable for applications, but not shared
  libraries.
--- 18183,18189 ----
  the same as \fB\-mbig\fR.
  .IP "\fB\-mdynamic\-no\-pic\fR" 4
  .IX Item "-mdynamic-no-pic"
! On Darwin and Mac \s-1OS X\s0 systems, compile code so that it is not
  relocatable, but that its external references are relocatable.  The
  resulting code is suitable for applications, but not shared
  libraries.
*************** On System V.4 and embedded PowerPC syste
*** 18274,18284 ****
  OpenBSD operating system.
  .IP "\fB\-maix\-struct\-return\fR" 4
  .IX Item "-maix-struct-return"
! Return all structures in memory (as specified by the \s-1AIX\s0 \s-1ABI\s0).
  .IP "\fB\-msvr4\-struct\-return\fR" 4
  .IX Item "-msvr4-struct-return"
  Return structures smaller than 8 bytes in registers (as specified by the
! \&\s-1SVR4\s0 \s-1ABI\s0).
  .IP "\fB\-mabi=\fR\fIabi-type\fR" 4
  .IX Item "-mabi=abi-type"
  Extend the current \s-1ABI\s0 with a particular extension, or remove such extension.
--- 18289,18299 ----
  OpenBSD operating system.
  .IP "\fB\-maix\-struct\-return\fR" 4
  .IX Item "-maix-struct-return"
! Return all structures in memory (as specified by the \s-1AIX ABI\s0).
  .IP "\fB\-msvr4\-struct\-return\fR" 4
  .IX Item "-msvr4-struct-return"
  Return structures smaller than 8 bytes in registers (as specified by the
! \&\s-1SVR4 ABI\s0).
  .IP "\fB\-mabi=\fR\fIabi-type\fR" 4
  .IX Item "-mabi=abi-type"
  Extend the current \s-1ABI\s0 with a particular extension, or remove such extension.
*************** Valid values are \fBaltivec\fR, \fBno-al
*** 18287,18315 ****
  \&\fBelfv1\fR, \fBelfv2\fR.
  .IP "\fB\-mabi=spe\fR" 4
  .IX Item "-mabi=spe"
! Extend the current \s-1ABI\s0 with \s-1SPE\s0 \s-1ABI\s0 extensions.  This does not change
! the default \s-1ABI\s0, instead it adds the \s-1SPE\s0 \s-1ABI\s0 extensions to the current
! \&\s-1ABI\s0.
  .IP "\fB\-mabi=no\-spe\fR" 4
  .IX Item "-mabi=no-spe"
! Disable Book-E \s-1SPE\s0 \s-1ABI\s0 extensions for the current \s-1ABI\s0.
  .IP "\fB\-mabi=ibmlongdouble\fR" 4
  .IX Item "-mabi=ibmlongdouble"
  Change the current \s-1ABI\s0 to use \s-1IBM\s0 extended-precision long double.
! This is a PowerPC 32\-bit \s-1SYSV\s0 \s-1ABI\s0 option.
  .IP "\fB\-mabi=ieeelongdouble\fR" 4
  .IX Item "-mabi=ieeelongdouble"
  Change the current \s-1ABI\s0 to use \s-1IEEE\s0 extended-precision long double.
  This is a PowerPC 32\-bit Linux \s-1ABI\s0 option.
  .IP "\fB\-mabi=elfv1\fR" 4
  .IX Item "-mabi=elfv1"
! Change the current \s-1ABI\s0 to use the ELFv1 \s-1ABI\s0.
  This is the default \s-1ABI\s0 for big-endian PowerPC 64\-bit Linux.
  Overriding the default \s-1ABI\s0 requires special system support and is
  likely to fail in spectacular ways.
  .IP "\fB\-mabi=elfv2\fR" 4
  .IX Item "-mabi=elfv2"
! Change the current \s-1ABI\s0 to use the ELFv2 \s-1ABI\s0.
  This is the default \s-1ABI\s0 for little-endian PowerPC 64\-bit Linux.
  Overriding the default \s-1ABI\s0 requires special system support and is
  likely to fail in spectacular ways.
--- 18302,18330 ----
  \&\fBelfv1\fR, \fBelfv2\fR.
  .IP "\fB\-mabi=spe\fR" 4
  .IX Item "-mabi=spe"
! Extend the current \s-1ABI\s0 with \s-1SPE ABI\s0 extensions.  This does not change
! the default \s-1ABI,\s0 instead it adds the \s-1SPE ABI\s0 extensions to the current
! \&\s-1ABI.\s0
  .IP "\fB\-mabi=no\-spe\fR" 4
  .IX Item "-mabi=no-spe"
! Disable Book-E \s-1SPE ABI\s0 extensions for the current \s-1ABI.\s0
  .IP "\fB\-mabi=ibmlongdouble\fR" 4
  .IX Item "-mabi=ibmlongdouble"
  Change the current \s-1ABI\s0 to use \s-1IBM\s0 extended-precision long double.
! This is a PowerPC 32\-bit \s-1SYSV ABI\s0 option.
  .IP "\fB\-mabi=ieeelongdouble\fR" 4
  .IX Item "-mabi=ieeelongdouble"
  Change the current \s-1ABI\s0 to use \s-1IEEE\s0 extended-precision long double.
  This is a PowerPC 32\-bit Linux \s-1ABI\s0 option.
  .IP "\fB\-mabi=elfv1\fR" 4
  .IX Item "-mabi=elfv1"
! Change the current \s-1ABI\s0 to use the ELFv1 \s-1ABI.\s0
  This is the default \s-1ABI\s0 for big-endian PowerPC 64\-bit Linux.
  Overriding the default \s-1ABI\s0 requires special system support and is
  likely to fail in spectacular ways.
  .IP "\fB\-mabi=elfv2\fR" 4
  .IX Item "-mabi=elfv2"
! Change the current \s-1ABI\s0 to use the ELFv2 \s-1ABI.\s0
  This is the default \s-1ABI\s0 for little-endian PowerPC 64\-bit Linux.
  Overriding the default \s-1ABI\s0 requires special system support and is
  likely to fail in spectacular ways.
*************** which handle the double-precision recipr
*** 18559,18565 ****
  .PD
  Assume (do not assume) that the reciprocal estimate instructions
  provide higher-precision estimates than is mandated by the PowerPC
! \&\s-1ABI\s0.  Selecting \fB\-mcpu=power6\fR, \fB\-mcpu=power7\fR or
  \&\fB\-mcpu=power8\fR automatically selects \fB\-mrecip\-precision\fR.
  The double-precision square root estimate instructions are not generated by
  default on low-precision machines, since they do not provide an
--- 18574,18580 ----
  .PD
  Assume (do not assume) that the reciprocal estimate instructions
  provide higher-precision estimates than is mandated by the PowerPC
! \&\s-1ABI.\s0  Selecting \fB\-mcpu=power6\fR, \fB\-mcpu=power7\fR or
  \&\fB\-mcpu=power8\fR automatically selects \fB\-mrecip\-precision\fR.
  The double-precision square root estimate instructions are not generated by
  default on low-precision machines, since they do not provide an
*************** pointer.  The \fB\-mno\-save\-toc\-indir
*** 18632,18645 ****
  .PD
  Generate (do not generate) code to pass structure parameters with a
  maximum alignment of 64 bits, for compatibility with older versions
! of \s-1GCC\s0.
  .Sp
  Older versions of \s-1GCC\s0 (prior to 4.9.0) incorrectly did not align a
  structure parameter on a 128\-bit boundary when that structure contained
  a member requiring 128\-bit alignment.  This is corrected in more
! recent versions of \s-1GCC\s0.  This option may be used to generate code
  that is compatible with functions compiled with older versions of
! \&\s-1GCC\s0.
  .Sp
  The \fB\-mno\-compat\-align\-parm\fR option is the default.
  .PP
--- 18647,18660 ----
  .PD
  Generate (do not generate) code to pass structure parameters with a
  maximum alignment of 64 bits, for compatibility with older versions
! of \s-1GCC.\s0
  .Sp
  Older versions of \s-1GCC\s0 (prior to 4.9.0) incorrectly did not align a
  structure parameter on a 128\-bit boundary when that structure contained
  a member requiring 128\-bit alignment.  This is corrected in more
! recent versions of \s-1GCC.\s0  This option may be used to generate code
  that is compatible with functions compiled with older versions of
! \&\s-1GCC.\s0
  .Sp
  The \fB\-mno\-compat\-align\-parm\fR option is the default.
  .PP
*************** values, however, so the \s-1FPU\s0 hardw
*** 18674,18685 ****
  .Sp
  \&\fINote\fR If the \fB\-fpu\fR option is enabled then
  \&\fB\-funsafe\-math\-optimizations\fR is also enabled automatically.
! This is because the \s-1RX\s0 \s-1FPU\s0 instructions are themselves unsafe.
  .IP "\fB\-mcpu=\fR\fIname\fR" 4
  .IX Item "-mcpu=name"
! Selects the type of \s-1RX\s0 \s-1CPU\s0 to be targeted.  Currently three types are
  supported, the generic \fB\s-1RX600\s0\fR and \fB\s-1RX200\s0\fR series hardware and
! the specific \fB\s-1RX610\s0\fR \s-1CPU\s0.  The default is \fB\s-1RX600\s0\fR.
  .Sp
  The only difference between \fB\s-1RX600\s0\fR and \fB\s-1RX610\s0\fR is that the
  \&\fB\s-1RX610\s0\fR does not support the \f(CW\*(C`MVTIPL\*(C'\fR instruction.
--- 18689,18700 ----
  .Sp
  \&\fINote\fR If the \fB\-fpu\fR option is enabled then
  \&\fB\-funsafe\-math\-optimizations\fR is also enabled automatically.
! This is because the \s-1RX FPU\s0 instructions are themselves unsafe.
  .IP "\fB\-mcpu=\fR\fIname\fR" 4
  .IX Item "-mcpu=name"
! Selects the type of \s-1RX CPU\s0 to be targeted.  Currently three types are
  supported, the generic \fB\s-1RX600\s0\fR and \fB\s-1RX200\s0\fR series hardware and
! the specific \fB\s-1RX610\s0\fR \s-1CPU.\s0  The default is \fB\s-1RX600\s0\fR.
  .Sp
  The only difference between \fB\s-1RX600\s0\fR and \fB\s-1RX610\s0\fR is that the
  \&\fB\s-1RX610\s0\fR does not support the \f(CW\*(C`MVTIPL\*(C'\fR instruction.
*************** type. This is the default.
*** 18865,18871 ****
  Store (do not store) the address of the caller's frame as backchain pointer
  into the callee's stack frame.
  A backchain may be needed to allow debugging using tools that do not understand
! \&\s-1DWARF\s0 2 call frame information.
  When \fB\-mno\-packed\-stack\fR is in effect, the backchain pointer is stored
  at the bottom of the stack frame; when \fB\-mpacked\-stack\fR is in effect,
  the backchain is placed into the topmost word of the 96/160 byte register
--- 18880,18886 ----
  Store (do not store) the address of the caller's frame as backchain pointer
  into the callee's stack frame.
  A backchain may be needed to allow debugging using tools that do not understand
! \&\s-1DWARF 2\s0 call frame information.
  When \fB\-mno\-packed\-stack\fR is in effect, the backchain pointer is stored
  at the bottom of the stack frame; when \fB\-mpacked\-stack\fR is in effect,
  the backchain is placed into the topmost word of the 96/160 byte register
*************** register is always saved two words below
*** 18897,18903 ****
  .Sp
  As long as the stack frame backchain is not used, code generated with
  \&\fB\-mpacked\-stack\fR is call-compatible with code generated with
! \&\fB\-mno\-packed\-stack\fR.  Note that some non-FSF releases of \s-1GCC\s0 2.95 for
  S/390 or zSeries generated code that uses the stack frame backchain at run
  time, not just for debugging purposes.  Such code is not call-compatible
  with code compiled with \fB\-mpacked\-stack\fR.  Also, note that the
--- 18912,18918 ----
  .Sp
  As long as the stack frame backchain is not used, code generated with
  \&\fB\-mpacked\-stack\fR is call-compatible with code generated with
! \&\fB\-mno\-packed\-stack\fR.  Note that some non-FSF releases of \s-1GCC 2.95\s0 for
  S/390 or zSeries generated code that uses the stack frame backchain at run
  time, not just for debugging purposes.  Such code is not call-compatible
  with code compiled with \fB\-mpacked\-stack\fR.  Also, note that the
*************** which does not have this limitation.
*** 18924,18931 ****
  .IX Item "-m31"
  .PD
  When \fB\-m31\fR is specified, generate code compliant to the
! GNU/Linux for S/390 \s-1ABI\s0.  When \fB\-m64\fR is specified, generate
! code compliant to the GNU/Linux for zSeries \s-1ABI\s0.  This allows \s-1GCC\s0 in
  particular to generate 64\-bit instructions.  For the \fBs390\fR
  targets, the default is \fB\-m31\fR, while the \fBs390x\fR
  targets default to \fB\-m64\fR.
--- 18939,18946 ----
  .IX Item "-m31"
  .PD
  When \fB\-m31\fR is specified, generate code compliant to the
! GNU/Linux for S/390 \s-1ABI.\s0  When \fB\-m64\fR is specified, generate
! code compliant to the GNU/Linux for zSeries \s-1ABI.\s0  This allows \s-1GCC\s0 in
  particular to generate 64\-bit instructions.  For the \fBs390\fR
  targets, the default is \fB\-m31\fR, while the \fBs390x\fR
  targets default to \fB\-m64\fR.
*************** targets default to \fB\-m64\fR.
*** 18938,18948 ****
  When \fB\-mzarch\fR is specified, generate code using the
  instructions available on z/Architecture.
  When \fB\-mesa\fR is specified, generate code using the
! instructions available on \s-1ESA/390\s0.  Note that \fB\-mesa\fR is
  not possible with \fB\-m64\fR.
! When generating code compliant to the GNU/Linux for S/390 \s-1ABI\s0,
  the default is \fB\-mesa\fR.  When generating code compliant
! to the GNU/Linux for zSeries \s-1ABI\s0, the default is \fB\-mzarch\fR.
  .IP "\fB\-mmvcle\fR" 4
  .IX Item "-mmvcle"
  .PD 0
--- 18953,18963 ----
  When \fB\-mzarch\fR is specified, generate code using the
  instructions available on z/Architecture.
  When \fB\-mesa\fR is specified, generate code using the
! instructions available on \s-1ESA/390.\s0  Note that \fB\-mesa\fR is
  not possible with \fB\-m64\fR.
! When generating code compliant to the GNU/Linux for S/390 \s-1ABI,\s0
  the default is \fB\-mesa\fR.  When generating code compliant
! to the GNU/Linux for zSeries \s-1ABI,\s0 the default is \fB\-mzarch\fR.
  .IP "\fB\-mmvcle\fR" 4
  .IX Item "-mmvcle"
  .PD 0
*************** The default is the value used for \fB\-m
*** 18983,18991 ****
  .IP "\fB\-mno\-tpf\-trace\fR" 4
  .IX Item "-mno-tpf-trace"
  .PD
! Generate code that adds (does not add) in \s-1TPF\s0 \s-1OS\s0 specific branches to trace
  routines in the operating system.  This option is off by default, even
! when compiling for the \s-1TPF\s0 \s-1OS\s0.
  .IP "\fB\-mfused\-madd\fR" 4
  .IX Item "-mfused-madd"
  .PD 0
--- 18998,19006 ----
  .IP "\fB\-mno\-tpf\-trace\fR" 4
  .IX Item "-mno-tpf-trace"
  .PD
! Generate code that adds (does not add) in \s-1TPF OS\s0 specific branches to trace
  routines in the operating system.  This option is off by default, even
! when compiling for the \s-1TPF OS.\s0
  .IP "\fB\-mfused\-madd\fR" 4
  .IX Item "-mfused-madd"
  .PD 0
*************** Specify the \s-1SCORE7D\s0 as the target
*** 19078,19093 ****
  These \fB\-m\fR options are defined for the \s-1SH\s0 implementations:
  .IP "\fB\-m1\fR" 4
  .IX Item "-m1"
! Generate code for the \s-1SH1\s0.
  .IP "\fB\-m2\fR" 4
  .IX Item "-m2"
! Generate code for the \s-1SH2\s0.
  .IP "\fB\-m2e\fR" 4
  .IX Item "-m2e"
  Generate code for the SH2e.
  .IP "\fB\-m2a\-nofpu\fR" 4
  .IX Item "-m2a-nofpu"
! Generate code for the SH2a without \s-1FPU\s0, or for a SH2a\-FPU in such a way
  that the floating-point unit is not used.
  .IP "\fB\-m2a\-single\-only\fR" 4
  .IX Item "-m2a-single-only"
--- 19093,19108 ----
  These \fB\-m\fR options are defined for the \s-1SH\s0 implementations:
  .IP "\fB\-m1\fR" 4
  .IX Item "-m1"
! Generate code for the \s-1SH1.\s0
  .IP "\fB\-m2\fR" 4
  .IX Item "-m2"
! Generate code for the \s-1SH2.\s0
  .IP "\fB\-m2e\fR" 4
  .IX Item "-m2e"
  Generate code for the SH2e.
  .IP "\fB\-m2a\-nofpu\fR" 4
  .IX Item "-m2a-nofpu"
! Generate code for the SH2a without \s-1FPU,\s0 or for a SH2a\-FPU in such a way
  that the floating-point unit is not used.
  .IP "\fB\-m2a\-single\-only\fR" 4
  .IX Item "-m2a-single-only"
*************** Generate code for the SH2a\-FPU assuming
*** 19103,19109 ****
  double-precision mode by default.
  .IP "\fB\-m3\fR" 4
  .IX Item "-m3"
! Generate code for the \s-1SH3\s0.
  .IP "\fB\-m3e\fR" 4
  .IX Item "-m3e"
  Generate code for the SH3e.
--- 19118,19124 ----
  double-precision mode by default.
  .IP "\fB\-m3\fR" 4
  .IX Item "-m3"
! Generate code for the \s-1SH3.\s0
  .IP "\fB\-m3e\fR" 4
  .IX Item "-m3e"
  Generate code for the SH3e.
*************** Generate code for the \s-1SH4\s0 assumin
*** 19120,19129 ****
  single-precision mode by default.
  .IP "\fB\-m4\fR" 4
  .IX Item "-m4"
! Generate code for the \s-1SH4\s0.
  .IP "\fB\-m4\-100\fR" 4
  .IX Item "-m4-100"
! Generate code for \s-1SH4\-100\s0.
  .IP "\fB\-m4\-100\-nofpu\fR" 4
  .IX Item "-m4-100-nofpu"
  Generate code for \s-1SH4\-100\s0 in such a way that the
--- 19135,19144 ----
  single-precision mode by default.
  .IP "\fB\-m4\fR" 4
  .IX Item "-m4"
! Generate code for the \s-1SH4.\s0
  .IP "\fB\-m4\-100\fR" 4
  .IX Item "-m4-100"
! Generate code for \s-1SH4\-100.\s0
  .IP "\fB\-m4\-100\-nofpu\fR" 4
  .IX Item "-m4-100-nofpu"
  Generate code for \s-1SH4\-100\s0 in such a way that the
*************** Generate code for \s-1SH4\-100\s0 in suc
*** 19138,19144 ****
  floating-point operations are used.
  .IP "\fB\-m4\-200\fR" 4
  .IX Item "-m4-200"
! Generate code for \s-1SH4\-200\s0.
  .IP "\fB\-m4\-200\-nofpu\fR" 4
  .IX Item "-m4-200-nofpu"
  Generate code for \s-1SH4\-200\s0 without in such a way that the
--- 19153,19159 ----
  floating-point operations are used.
  .IP "\fB\-m4\-200\fR" 4
  .IX Item "-m4-200"
! Generate code for \s-1SH4\-200.\s0
  .IP "\fB\-m4\-200\-nofpu\fR" 4
  .IX Item "-m4-200-nofpu"
  Generate code for \s-1SH4\-200\s0 without in such a way that the
*************** Generate code for \s-1SH4\-200\s0 in suc
*** 19153,19159 ****
  floating-point operations are used.
  .IP "\fB\-m4\-300\fR" 4
  .IX Item "-m4-300"
! Generate code for \s-1SH4\-300\s0.
  .IP "\fB\-m4\-300\-nofpu\fR" 4
  .IX Item "-m4-300-nofpu"
  Generate code for \s-1SH4\-300\s0 without in such a way that the
--- 19168,19174 ----
  floating-point operations are used.
  .IP "\fB\-m4\-300\fR" 4
  .IX Item "-m4-300"
! Generate code for \s-1SH4\-300.\s0
  .IP "\fB\-m4\-300\-nofpu\fR" 4
  .IX Item "-m4-300-nofpu"
  Generate code for \s-1SH4\-300\s0 without in such a way that the
*************** Generate code for \s-1SH4\-300\s0 in suc
*** 19168,19174 ****
  floating-point operations are used.
  .IP "\fB\-m4\-340\fR" 4
  .IX Item "-m4-340"
! Generate code for \s-1SH4\-340\s0 (no \s-1MMU\s0, no \s-1FPU\s0).
  .IP "\fB\-m4\-500\fR" 4
  .IX Item "-m4-500"
  Generate code for \s-1SH4\-500\s0 (no \s-1FPU\s0).  Passes \fB\-isa=sh4\-nofpu\fR to the
--- 19183,19189 ----
  floating-point operations are used.
  .IP "\fB\-m4\-340\fR" 4
  .IX Item "-m4-340"
! Generate code for \s-1SH4\-340\s0 (no \s-1MMU,\s0 no \s-1FPU\s0).
  .IP "\fB\-m4\-500\fR" 4
  .IX Item "-m4-500"
  Generate code for \s-1SH4\-500\s0 (no \s-1FPU\s0).  Passes \fB\-isa=sh4\-nofpu\fR to the
*************** Use 32\-bit offsets in \f(CW\*(C`switch\
*** 19235,19241 ****
  16\-bit offsets.
  .IP "\fB\-mbitops\fR" 4
  .IX Item "-mbitops"
! Enable the use of bit manipulation instructions on \s-1SH2A\s0.
  .IP "\fB\-mfmovd\fR" 4
  .IX Item "-mfmovd"
  Enable the use of the instruction \f(CW\*(C`fmovd\*(C'\fR.  Check \fB\-mdalign\fR for
--- 19250,19256 ----
  16\-bit offsets.
  .IP "\fB\-mbitops\fR" 4
  .IX Item "-mbitops"
! Enable the use of bit manipulation instructions on \s-1SH2A.\s0
  .IP "\fB\-mfmovd\fR" 4
  .IX Item "-mfmovd"
  Enable the use of the instruction \f(CW\*(C`fmovd\*(C'\fR.  Check \fB\-mdalign\fR for
*************** Dump instruction size and location in th
*** 19282,19288 ****
  .IP "\fB\-mpadstruct\fR" 4
  .IX Item "-mpadstruct"
  This option is deprecated.  It pads structures to multiple of 4 bytes,
! which is incompatible with the \s-1SH\s0 \s-1ABI\s0.
  .IP "\fB\-matomic\-model=\fR\fImodel\fR" 4
  .IX Item "-matomic-model=model"
  Sets the model of atomic operations and additional parameters as a comma
--- 19297,19303 ----
  .IP "\fB\-mpadstruct\fR" 4
  .IX Item "-mpadstruct"
  This option is deprecated.  It pads structures to multiple of 4 bytes,
! which is incompatible with the \s-1SH ABI.\s0
  .IP "\fB\-matomic\-model=\fR\fImodel\fR" 4
  .IX Item "-matomic-model=model"
  Sets the model of atomic operations and additional parameters as a comma
*************** Generate GNU/Linux compatible gUSA softw
*** 19299,19305 ****
  built-in functions.  The generated atomic sequences require additional support
  from the interrupt/exception handling code of the system and are only suitable
  for SH3* and SH4* single-core systems.  This option is enabled by default when
! the target is \f(CW\*(C`sh*\-*\-linux*\*(C'\fR and SH3* or SH4*.  When the target is \s-1SH4A\s0,
  this option also partially utilizes the hardware atomic instructions
  \&\f(CW\*(C`movli.l\*(C'\fR and \f(CW\*(C`movco.l\*(C'\fR to create more efficient code, unless
  \&\fBstrict\fR is specified.
--- 19314,19320 ----
  built-in functions.  The generated atomic sequences require additional support
  from the interrupt/exception handling code of the system and are only suitable
  for SH3* and SH4* single-core systems.  This option is enabled by default when
! the target is \f(CW\*(C`sh*\-*\-linux*\*(C'\fR and SH3* or SH4*.  When the target is \s-1SH4A,\s0
  this option also partially utilizes the hardware atomic instructions
  \&\f(CW\*(C`movli.l\*(C'\fR and \f(CW\*(C`movco.l\*(C'\fR to create more efficient code, unless
  \&\fBstrict\fR is specified.
*************** For targets other than SHmedia \fIstrate
*** 19442,19461 ****
  .IX Item "call-div1"
  Calls a library function that uses the single-step division instruction
  \&\f(CW\*(C`div1\*(C'\fR to perform the operation.  Division by zero calculates an
! unspecified result and does not trap.  This is the default except for \s-1SH4\s0,
! \&\s-1SH2A\s0 and SHcompact.
  .IP "\fBcall-fp\fR" 4
  .IX Item "call-fp"
  Calls a library function that performs the operation in double precision
  floating point.  Division by zero causes a floating-point exception.  This is
! the default for SHcompact with \s-1FPU\s0.  Specifying this for targets that do not
  have a double precision \s-1FPU\s0 defaults to \f(CW\*(C`call\-div1\*(C'\fR.
  .IP "\fBcall-table\fR" 4
  .IX Item "call-table"
  Calls a library function that uses a lookup table for small divisors and
  the \f(CW\*(C`div1\*(C'\fR instruction with case distinction for larger divisors.  Division
  by zero calculates an unspecified result and does not trap.  This is the default
! for \s-1SH4\s0.  Specifying this for targets that do not have dynamic shift
  instructions defaults to \f(CW\*(C`call\-div1\*(C'\fR.
  .RE
  .RS 4
--- 19457,19476 ----
  .IX Item "call-div1"
  Calls a library function that uses the single-step division instruction
  \&\f(CW\*(C`div1\*(C'\fR to perform the operation.  Division by zero calculates an
! unspecified result and does not trap.  This is the default except for \s-1SH4,
! SH2A\s0 and SHcompact.
  .IP "\fBcall-fp\fR" 4
  .IX Item "call-fp"
  Calls a library function that performs the operation in double precision
  floating point.  Division by zero causes a floating-point exception.  This is
! the default for SHcompact with \s-1FPU.\s0  Specifying this for targets that do not
  have a double precision \s-1FPU\s0 defaults to \f(CW\*(C`call\-div1\*(C'\fR.
  .IP "\fBcall-table\fR" 4
  .IX Item "call-table"
  Calls a library function that uses a lookup table for small divisors and
  the \f(CW\*(C`div1\*(C'\fR instruction with case distinction for larger divisors.  Division
  by zero calculates an unspecified result and does not trap.  This is the default
! for \s-1SH4.\s0  Specifying this for targets that do not have dynamic shift
  instructions defaults to \f(CW\*(C`call\-div1\*(C'\fR.
  .RE
  .RS 4
*************** specified separated by a comma.
*** 19489,19498 ****
  Enable the use of the indexed addressing mode for SHmedia32/SHcompact.
  This is only safe if the hardware and/or \s-1OS\s0 implement 32\-bit wrap-around
  semantics for the indexed addressing mode.  The architecture allows the
! implementation of processors with 64\-bit \s-1MMU\s0, which the \s-1OS\s0 could use to
  get 32\-bit addressing, but since no current hardware implementation supports
  this or any other way to make the indexed addressing mode safe to use in
! the 32\-bit \s-1ABI\s0, the default is \fB\-mno\-indexed\-addressing\fR.
  .IP "\fB\-mgettrcost=\fR\fInumber\fR" 4
  .IX Item "-mgettrcost=number"
  Set the cost assumed for the \f(CW\*(C`gettr\*(C'\fR instruction to \fInumber\fR.
--- 19504,19513 ----
  Enable the use of the indexed addressing mode for SHmedia32/SHcompact.
  This is only safe if the hardware and/or \s-1OS\s0 implement 32\-bit wrap-around
  semantics for the indexed addressing mode.  The architecture allows the
! implementation of processors with 64\-bit \s-1MMU,\s0 which the \s-1OS\s0 could use to
  get 32\-bit addressing, but since no current hardware implementation supports
  this or any other way to make the indexed addressing mode safe to use in
! the 32\-bit \s-1ABI,\s0 the default is \fB\-mno\-indexed\-addressing\fR.
  .IP "\fB\-mgettrcost=\fR\fInumber\fR" 4
  .IX Item "-mgettrcost=number"
  Set the cost assumed for the \f(CW\*(C`gettr\*(C'\fR instruction to \fInumber\fR.
*************** the compiler are always valid to load wi
*** 19529,19535 ****
  but with assembler and/or linker tricks it is possible
  to generate symbols that cause \f(CW\*(C`ptabs\*(C'\fR or \f(CW\*(C`ptrel\*(C'\fR to trap.
  This option is only meaningful when \fB\-mno\-pt\-fixed\fR is in effect.
! It prevents cross-basic-block \s-1CSE\s0, hoisting and most scheduling
  of symbol loads.  The default is \fB\-mno\-invalid\-symbols\fR.
  .IP "\fB\-mbranch\-cost=\fR\fInum\fR" 4
  .IX Item "-mbranch-cost=num"
--- 19544,19550 ----
  but with assembler and/or linker tricks it is possible
  to generate symbols that cause \f(CW\*(C`ptabs\*(C'\fR or \f(CW\*(C`ptrel\*(C'\fR to trap.
  This option is only meaningful when \fB\-mno\-pt\-fixed\fR is in effect.
! It prevents cross-basic-block \s-1CSE,\s0 hoisting and most scheduling
  of symbol loads.  The default is \fB\-mno\-invalid\-symbols\fR.
  .IP "\fB\-mbranch\-cost=\fR\fInum\fR" 4
  .IX Item "-mbranch-cost=num"
*************** is being compiled for.
*** 19546,19559 ****
  Assume (do not assume) that zero displacement conditional branch instructions
  \&\f(CW\*(C`bt\*(C'\fR and \f(CW\*(C`bf\*(C'\fR are fast.  If \fB\-mzdcbranch\fR is specified, the
  compiler prefers zero displacement branch code sequences.  This is
! enabled by default when generating code for \s-1SH4\s0 and \s-1SH4A\s0.  It can be explicitly
  disabled by specifying \fB\-mno\-zdcbranch\fR.
  .IP "\fB\-mcbranch\-force\-delay\-slot\fR" 4
  .IX Item "-mcbranch-force-delay-slot"
  Force the usage of delay slots for conditional branches, which stuffs the delay
  slot with a \f(CW\*(C`nop\*(C'\fR if a suitable instruction can't be found.  By default
  this option is disabled.  It can be enabled to work around hardware bugs as
! found in the original \s-1SH7055\s0.
  .IP "\fB\-mfused\-madd\fR" 4
  .IX Item "-mfused-madd"
  .PD 0
--- 19561,19574 ----
  Assume (do not assume) that zero displacement conditional branch instructions
  \&\f(CW\*(C`bt\*(C'\fR and \f(CW\*(C`bf\*(C'\fR are fast.  If \fB\-mzdcbranch\fR is specified, the
  compiler prefers zero displacement branch code sequences.  This is
! enabled by default when generating code for \s-1SH4\s0 and \s-1SH4A.\s0  It can be explicitly
  disabled by specifying \fB\-mno\-zdcbranch\fR.
  .IP "\fB\-mcbranch\-force\-delay\-slot\fR" 4
  .IX Item "-mcbranch-force-delay-slot"
  Force the usage of delay slots for conditional branches, which stuffs the delay
  slot with a \f(CW\*(C`nop\*(C'\fR if a suitable instruction can't be found.  By default
  this option is disabled.  It can be enabled to work around hardware bugs as
! found in the original \s-1SH7055.\s0
  .IP "\fB\-mfused\-madd\fR" 4
  .IX Item "-mfused-madd"
  .PD 0
*************** mapped to \fB\-ffp\-contract=off\fR.
*** 19575,19581 ****
  Allow or disallow the compiler to emit the \f(CW\*(C`fsca\*(C'\fR instruction for sine
  and cosine approximations.  The option \fB\-mfsca\fR must be used in
  combination with \fB\-funsafe\-math\-optimizations\fR.  It is enabled by default
! when generating code for \s-1SH4A\s0.  Using \fB\-mno\-fsca\fR disables sine and cosine
  approximations even if \fB\-funsafe\-math\-optimizations\fR is in effect.
  .IP "\fB\-mfsrra\fR" 4
  .IX Item "-mfsrra"
--- 19590,19596 ----
  Allow or disallow the compiler to emit the \f(CW\*(C`fsca\*(C'\fR instruction for sine
  and cosine approximations.  The option \fB\-mfsca\fR must be used in
  combination with \fB\-funsafe\-math\-optimizations\fR.  It is enabled by default
! when generating code for \s-1SH4A.\s0  Using \fB\-mno\-fsca\fR disables sine and cosine
  approximations even if \fB\-funsafe\-math\-optimizations\fR is in effect.
  .IP "\fB\-mfsrra\fR" 4
  .IX Item "-mfsrra"
*************** Allow or disallow the compiler to emit t
*** 19587,19593 ****
  reciprocal square root approximations.  The option \fB\-mfsrra\fR must be used
  in combination with \fB\-funsafe\-math\-optimizations\fR and
  \&\fB\-ffinite\-math\-only\fR.  It is enabled by default when generating code for
! \&\s-1SH4A\s0.  Using \fB\-mno\-fsrra\fR disables reciprocal square root approximations
  even if \fB\-funsafe\-math\-optimizations\fR and \fB\-ffinite\-math\-only\fR are
  in effect.
  .IP "\fB\-mpretend\-cmove\fR" 4
--- 19602,19608 ----
  reciprocal square root approximations.  The option \fB\-mfsrra\fR must be used
  in combination with \fB\-funsafe\-math\-optimizations\fR and
  \&\fB\-ffinite\-math\-only\fR.  It is enabled by default when generating code for
! \&\s-1SH4A.\s0  Using \fB\-mno\-fsrra\fR disables reciprocal square root approximations
  even if \fB\-funsafe\-math\-optimizations\fR and \fB\-ffinite\-math\-only\fR are
  in effect.
  .IP "\fB\-mpretend\-cmove\fR" 4
*************** These \fB\-m\fR options are supported on
*** 19641,19647 ****
  .IX Item "-mapp-regs"
  .PD
  Specify \fB\-mapp\-regs\fR to generate output using the global registers
! 2 through 4, which the \s-1SPARC\s0 \s-1SVR4\s0 \s-1ABI\s0 reserves for applications.  Like the
  global register 1, each global register 2 through 4 is then treated as an
  allocable register that is clobbered by function calls.  This is the default.
  .Sp
--- 19656,19662 ----
  .IX Item "-mapp-regs"
  .PD
  Specify \fB\-mapp\-regs\fR to generate output using the global registers
! 2 through 4, which the \s-1SPARC SVR4 ABI\s0 reserves for applications.  Like the
  global register 1, each global register 2 through 4 is then treated as an
  allocable register that is clobbered by function calls.  This is the default.
  .Sp
*************** cross-compilation.  The embedded targets
*** 19687,19693 ****
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC\s0, with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-mhard\-quad\-float\fR" 4
  .IX Item "-mhard-quad-float"
--- 19702,19708 ----
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC,\s0 with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-mhard\-quad\-float\fR" 4
  .IX Item "-mhard-quad-float"
*************** instructions.
*** 19697,19703 ****
  .IX Item "-msoft-quad-float"
  Generate output containing library calls for quad-word (long double)
  floating-point instructions.  The functions called are those specified
! in the \s-1SPARC\s0 \s-1ABI\s0.  This is the default.
  .Sp
  As of this writing, there are no \s-1SPARC\s0 implementations that have hardware
  support for the quad-word floating-point instructions.  They all invoke
--- 19712,19718 ----
  .IX Item "-msoft-quad-float"
  Generate output containing library calls for quad-word (long double)
  floating-point instructions.  The functions called are those specified
! in the \s-1SPARC ABI.\s0  This is the default.
  .Sp
  As of this writing, there are no \s-1SPARC\s0 implementations that have hardware
  support for the quad-word floating-point instructions.  They all invoke
*************** With \fB\-mfaster\-structs\fR, the compi
*** 19738,19747 ****
  should have 8\-byte alignment.  This enables the use of pairs of
  \&\f(CW\*(C`ldd\*(C'\fR and \f(CW\*(C`std\*(C'\fR instructions for copies in structure
  assignment, in place of twice as many \f(CW\*(C`ld\*(C'\fR and \f(CW\*(C`st\*(C'\fR pairs.
! However, the use of this changed alignment directly violates the \s-1SPARC\s0
! \&\s-1ABI\s0.  Thus, it's intended only for use on targets where the developer
  acknowledges that their resulting code is not directly in line with
! the rules of the \s-1ABI\s0.
  .IP "\fB\-mcpu=\fR\fIcpu_type\fR" 4
  .IX Item "-mcpu=cpu_type"
  Set the instruction set, register set, and instruction scheduling parameters
--- 19753,19762 ----
  should have 8\-byte alignment.  This enables the use of pairs of
  \&\f(CW\*(C`ldd\*(C'\fR and \f(CW\*(C`std\*(C'\fR instructions for copies in structure
  assignment, in place of twice as many \f(CW\*(C`ld\*(C'\fR and \f(CW\*(C`st\*(C'\fR pairs.
! However, the use of this changed alignment directly violates the \s-1SPARC
! ABI.\s0  Thus, it's intended only for use on targets where the developer
  acknowledges that their resulting code is not directly in line with
! the rules of the \s-1ABI.\s0
  .IP "\fB\-mcpu=\fR\fIcpu_type\fR" 4
  .IX Item "-mcpu=cpu_type"
  Set the instruction set, register set, and instruction scheduling parameters
*************** SPARCStation 1, 2, \s-1IPX\s0 etc.
*** 19791,19812 ****
  With \fB\-mcpu=v8\fR, \s-1GCC\s0 generates code for the V8 variant of the \s-1SPARC\s0
  architecture.  The only difference from V7 code is that the compiler emits
  the integer multiply and integer divide instructions which exist in \s-1SPARC\-V8\s0
! but not in \s-1SPARC\-V7\s0.  With \fB\-mcpu=supersparc\fR, the compiler additionally
  optimizes it for the SuperSPARC chip, as used in the SPARCStation 10, 1000 and
  2000 series.
  .Sp
  With \fB\-mcpu=sparclite\fR, \s-1GCC\s0 generates code for the SPARClite variant of
  the \s-1SPARC\s0 architecture.  This adds the integer multiply, integer divide step
! and scan (\f(CW\*(C`ffs\*(C'\fR) instructions which exist in SPARClite but not in \s-1SPARC\-V7\s0.
  With \fB\-mcpu=f930\fR, the compiler additionally optimizes it for the
! Fujitsu \s-1MB86930\s0 chip, which is the original SPARClite, with no \s-1FPU\s0.  With
  \&\fB\-mcpu=f934\fR, the compiler additionally optimizes it for the Fujitsu
! \&\s-1MB86934\s0 chip, which is the more recent SPARClite with \s-1FPU\s0.
  .Sp
  With \fB\-mcpu=sparclet\fR, \s-1GCC\s0 generates code for the SPARClet variant of
  the \s-1SPARC\s0 architecture.  This adds the integer multiply, multiply/accumulate,
  integer divide step and scan (\f(CW\*(C`ffs\*(C'\fR) instructions which exist in SPARClet
! but not in \s-1SPARC\-V7\s0.  With \fB\-mcpu=tsc701\fR, the compiler additionally
  optimizes it for the \s-1TEMIC\s0 SPARClet chip.
  .Sp
  With \fB\-mcpu=v9\fR, \s-1GCC\s0 generates code for the V9 variant of the \s-1SPARC\s0
--- 19806,19827 ----
  With \fB\-mcpu=v8\fR, \s-1GCC\s0 generates code for the V8 variant of the \s-1SPARC\s0
  architecture.  The only difference from V7 code is that the compiler emits
  the integer multiply and integer divide instructions which exist in \s-1SPARC\-V8\s0
! but not in \s-1SPARC\-V7.\s0  With \fB\-mcpu=supersparc\fR, the compiler additionally
  optimizes it for the SuperSPARC chip, as used in the SPARCStation 10, 1000 and
  2000 series.
  .Sp
  With \fB\-mcpu=sparclite\fR, \s-1GCC\s0 generates code for the SPARClite variant of
  the \s-1SPARC\s0 architecture.  This adds the integer multiply, integer divide step
! and scan (\f(CW\*(C`ffs\*(C'\fR) instructions which exist in SPARClite but not in \s-1SPARC\-V7.\s0
  With \fB\-mcpu=f930\fR, the compiler additionally optimizes it for the
! Fujitsu \s-1MB86930\s0 chip, which is the original SPARClite, with no \s-1FPU.\s0  With
  \&\fB\-mcpu=f934\fR, the compiler additionally optimizes it for the Fujitsu
! \&\s-1MB86934\s0 chip, which is the more recent SPARClite with \s-1FPU.\s0
  .Sp
  With \fB\-mcpu=sparclet\fR, \s-1GCC\s0 generates code for the SPARClet variant of
  the \s-1SPARC\s0 architecture.  This adds the integer multiply, multiply/accumulate,
  integer divide step and scan (\f(CW\*(C`ffs\*(C'\fR) instructions which exist in SPARClet
! but not in \s-1SPARC\-V7.\s0  With \fB\-mcpu=tsc701\fR, the compiler additionally
  optimizes it for the \s-1TEMIC\s0 SPARClet chip.
  .Sp
  With \fB\-mcpu=v9\fR, \s-1GCC\s0 generates code for the V9 variant of the \s-1SPARC\s0
*************** toolchains, \fBnative\fR can also be use
*** 19843,19849 ****
  .IP "\fB\-mno\-v8plus\fR" 4
  .IX Item "-mno-v8plus"
  .PD
! With \fB\-mv8plus\fR, \s-1GCC\s0 generates code for the \s-1SPARC\-V8+\s0 \s-1ABI\s0.  The
  difference from the V8 \s-1ABI\s0 is that the global and out registers are
  considered 64 bits wide.  This is enabled by default on Solaris in 32\-bit
  mode for all \s-1SPARC\-V9\s0 processors.
--- 19858,19864 ----
  .IP "\fB\-mno\-v8plus\fR" 4
  .IX Item "-mno-v8plus"
  .PD
! With \fB\-mv8plus\fR, \s-1GCC\s0 generates code for the \s-1SPARC\-V8+ ABI.\s0  The
  difference from the V8 \s-1ABI\s0 is that the global and out registers are
  considered 64 bits wide.  This is enabled by default on Solaris in 32\-bit
  mode for all \s-1SPARC\-V9\s0 processors.
*************** This option suppresses generation of the
*** 20298,20306 ****
  v850e, v850e1, v850e2, v850e2v3 and v850e3v5 flavors of the v850
  architecture.
  .Sp
! This option is enabled by default when the \s-1RH850\s0 \s-1ABI\s0 is
  in use (see \fB\-mrh850\-abi\fR), and disabled by default when the
! \&\s-1GCC\s0 \s-1ABI\s0 is in use.  If \f(CW\*(C`CALLT\*(C'\fR instructions are being generated
  then the C preprocessor symbol \f(CW\*(C`_\|_V850_CALLT_\|_\*(C'\fR is defined.
  .IP "\fB\-mrelax\fR" 4
  .IX Item "-mrelax"
--- 20313,20321 ----
  v850e, v850e1, v850e2, v850e2v3 and v850e3v5 flavors of the v850
  architecture.
  .Sp
! This option is enabled by default when the \s-1RH850 ABI\s0 is
  in use (see \fB\-mrh850\-abi\fR), and disabled by default when the
! \&\s-1GCC ABI\s0 is in use.  If \f(CW\*(C`CALLT\*(C'\fR instructions are being generated
  then the C preprocessor symbol \f(CW\*(C`_\|_V850_CALLT_\|_\*(C'\fR is defined.
  .IP "\fB\-mrelax\fR" 4
  .IX Item "-mrelax"
*************** selected because its use is still experi
*** 20340,20346 ****
  .IP "\fB\-mghs\fR" 4
  .IX Item "-mghs"
  .PD
! Enables support for the \s-1RH850\s0 version of the V850 \s-1ABI\s0.  This is the
  default.  With this version of the \s-1ABI\s0 the following rules apply:
  .RS 4
  .IP "*" 4
--- 20355,20361 ----
  .IP "\fB\-mghs\fR" 4
  .IX Item "-mghs"
  .PD
! Enables support for the \s-1RH850\s0 version of the V850 \s-1ABI.\s0  This is the
  default.  With this version of the \s-1ABI\s0 the following rules apply:
  .RS 4
  .IP "*" 4
*************** When this version of the \s-1ABI\s0 is e
*** 20365,20371 ****
  .RE
  .IP "\fB\-mgcc\-abi\fR" 4
  .IX Item "-mgcc-abi"
! Enables support for the old \s-1GCC\s0 version of the V850 \s-1ABI\s0.  With this
  version of the \s-1ABI\s0 the following rules apply:
  .RS 4
  .IP "*" 4
--- 20380,20386 ----
  .RE
  .IP "\fB\-mgcc\-abi\fR" 4
  .IX Item "-mgcc-abi"
! Enables support for the old \s-1GCC\s0 version of the V850 \s-1ABI.\s0  With this
  version of the \s-1ABI\s0 the following rules apply:
  .RS 4
  .IP "*" 4
*************** Generate code containing library calls f
*** 20460,20466 ****
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC\s0, with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-mcpu=\fR\fIcpu_type\fR" 4
  .IX Item "-mcpu=cpu_type"
--- 20475,20481 ----
  \&\fB\-msoft\-float\fR changes the calling convention in the output file;
  therefore, it is only useful if you compile \fIall\fR of a program with
  this option.  In particular, you need to compile \fIlibgcc.a\fR, the
! library that comes with \s-1GCC,\s0 with \fB\-msoft\-float\fR in order for
  this to work.
  .IP "\fB\-mcpu=\fR\fIcpu_type\fR" 4
  .IX Item "-mcpu=cpu_type"
*************** the access to general registers.  This i
*** 20488,20495 ****
  .IP "\fB\-muser\-mode\fR" 4
  .IX Item "-muser-mode"
  Generate code for the user mode, where the access to some general registers
! is forbidden: on the \s-1GR5\s0, registers r24 to r31 cannot be accessed in this
! mode; on the \s-1GR6\s0, only registers r29 to r31 are affected.
  .PP
  \fI\s-1VMS\s0 Options\fR
  .IX Subsection "VMS Options"
--- 20503,20510 ----
  .IP "\fB\-muser\-mode\fR" 4
  .IX Item "-muser-mode"
  Generate code for the user mode, where the access to some general registers
! is forbidden: on the \s-1GR5,\s0 registers r24 to r31 cannot be accessed in this
! mode; on the \s-1GR6,\s0 only registers r29 to r31 are affected.
  .PP
  \fI\s-1VMS\s0 Options\fR
  .IX Subsection "VMS Options"
*************** produces code optimized for the local ma
*** 20572,20581 ****
  of the selected instruction set.
  .IP "\fBi386\fR" 4
  .IX Item "i386"
! Original Intel i386 \s-1CPU\s0.
  .IP "\fBi486\fR" 4
  .IX Item "i486"
! Intel i486 \s-1CPU\s0.  (No scheduling is implemented for this chip.)
  .IP "\fBi586\fR" 4
  .IX Item "i586"
  .PD 0
--- 20587,20596 ----
  of the selected instruction set.
  .IP "\fBi386\fR" 4
  .IX Item "i386"
! Original Intel i386 \s-1CPU.\s0
  .IP "\fBi486\fR" 4
  .IX Item "i486"
! Intel i486 \s-1CPU.\s0  (No scheduling is implemented for this chip.)
  .IP "\fBi586\fR" 4
  .IX Item "i586"
  .PD 0
*************** Intel i486 \s-1CPU\s0.  (No scheduling i
*** 20585,20594 ****
  Intel Pentium \s-1CPU\s0 with no \s-1MMX\s0 support.
  .IP "\fBpentium-mmx\fR" 4
  .IX Item "pentium-mmx"
! Intel Pentium \s-1MMX\s0 \s-1CPU\s0, based on Pentium core with \s-1MMX\s0 instruction set support.
  .IP "\fBpentiumpro\fR" 4
  .IX Item "pentiumpro"
! Intel Pentium Pro \s-1CPU\s0.
  .IP "\fBi686\fR" 4
  .IX Item "i686"
  When used with \fB\-march\fR, the Pentium Pro
--- 20600,20609 ----
  Intel Pentium \s-1CPU\s0 with no \s-1MMX\s0 support.
  .IP "\fBpentium-mmx\fR" 4
  .IX Item "pentium-mmx"
! Intel Pentium \s-1MMX CPU,\s0 based on Pentium core with \s-1MMX\s0 instruction set support.
  .IP "\fBpentiumpro\fR" 4
  .IX Item "pentiumpro"
! Intel Pentium Pro \s-1CPU.\s0
  .IP "\fBi686\fR" 4
  .IX Item "i686"
  When used with \fB\-march\fR, the Pentium Pro
*************** instruction set is used, so the code run
*** 20596,20602 ****
  When used with \fB\-mtune\fR, it has the same meaning as \fBgeneric\fR.
  .IP "\fBpentium2\fR" 4
  .IX Item "pentium2"
! Intel Pentium \s-1II\s0 \s-1CPU\s0, based on Pentium Pro core with \s-1MMX\s0 instruction set
  support.
  .IP "\fBpentium3\fR" 4
  .IX Item "pentium3"
--- 20611,20617 ----
  When used with \fB\-mtune\fR, it has the same meaning as \fBgeneric\fR.
  .IP "\fBpentium2\fR" 4
  .IX Item "pentium2"
! Intel Pentium \s-1II CPU,\s0 based on Pentium Pro core with \s-1MMX\s0 instruction set
  support.
  .IP "\fBpentium3\fR" 4
  .IX Item "pentium3"
*************** support.
*** 20604,20692 ****
  .IP "\fBpentium3m\fR" 4
  .IX Item "pentium3m"
  .PD
! Intel Pentium \s-1III\s0 \s-1CPU\s0, based on Pentium Pro core with \s-1MMX\s0 and \s-1SSE\s0 instruction
  set support.
  .IP "\fBpentium-m\fR" 4
  .IX Item "pentium-m"
! Intel Pentium M; low-power version of Intel Pentium \s-1III\s0 \s-1CPU\s0
! with \s-1MMX\s0, \s-1SSE\s0 and \s-1SSE2\s0 instruction set support.  Used by Centrino notebooks.
  .IP "\fBpentium4\fR" 4
  .IX Item "pentium4"
  .PD 0
  .IP "\fBpentium4m\fR" 4
  .IX Item "pentium4m"
  .PD
! Intel Pentium 4 \s-1CPU\s0 with \s-1MMX\s0, \s-1SSE\s0 and \s-1SSE2\s0 instruction set support.
  .IP "\fBprescott\fR" 4
  .IX Item "prescott"
! Improved version of Intel Pentium 4 \s-1CPU\s0 with \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0 and \s-1SSE3\s0 instruction
  set support.
  .IP "\fBnocona\fR" 4
  .IX Item "nocona"
! Improved version of Intel Pentium 4 \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0,
! \&\s-1SSE2\s0 and \s-1SSE3\s0 instruction set support.
  .IP "\fBcore2\fR" 4
  .IX Item "core2"
! Intel Core 2 \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0 and \s-1SSSE3\s0
  instruction set support.
  .IP "\fBnehalem\fR" 4
  .IX Item "nehalem"
! Intel Nehalem \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2 and \s-1POPCNT\s0 instruction set support.
  .IP "\fBwestmere\fR" 4
  .IX Item "westmere"
! Intel Westmere \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AES\s0 and \s-1PCLMUL\s0 instruction set support.
  .IP "\fBsandybridge\fR" 4
  .IX Item "sandybridge"
! Intel Sandy Bridge \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AES\s0 and \s-1PCLMUL\s0 instruction set support.
  .IP "\fBivybridge\fR" 4
  .IX Item "ivybridge"
! Intel Ivy Bridge \s-1CPU\s0 with 64\-bit extensions, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0 and F16C
  instruction set support.
  .IP "\fBhaswell\fR" 4
  .IX Item "haswell"
! Intel Haswell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AVX2\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0, \s-1FMA\s0,
! \&\s-1BMI\s0, \s-1BMI2\s0 and F16C instruction set support.
  .IP "\fBbroadwell\fR" 4
  .IX Item "broadwell"
! Intel Broadwell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AVX2\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0, \s-1FMA\s0,
! \&\s-1BMI\s0, \s-1BMI2\s0, F16C, \s-1RDSEED\s0, \s-1ADCX\s0 and \s-1PREFETCHW\s0 instruction set support.
  .IP "\fBbonnell\fR" 4
  .IX Item "bonnell"
! Intel Bonnell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0 and \s-1SSSE3\s0
  instruction set support.
  .IP "\fBsilvermont\fR" 4
  .IX Item "silvermont"
! Intel Silvermont \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0,
! \&\s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AES\s0, \s-1PCLMUL\s0 and \s-1RDRND\s0 instruction set support.
  .IP "\fBknl\fR" 4
  .IX Item "knl"
! Intel Knight's Landing \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0,
! \&\s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1POPCNT\s0, \s-1AVX\s0, \s-1AVX2\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0, \s-1FMA\s0,
! \&\s-1BMI\s0, \s-1BMI2\s0, F16C, \s-1RDSEED\s0, \s-1ADCX\s0, \s-1PREFETCHW\s0, \s-1AVX512F\s0, \s-1AVX512PF\s0, \s-1AVX512ER\s0 and
  \&\s-1AVX512CD\s0 instruction set support.
  .IP "\fBk6\fR" 4
  .IX Item "k6"
! \&\s-1AMD\s0 K6 \s-1CPU\s0 with \s-1MMX\s0 instruction set support.
  .IP "\fBk6\-2\fR" 4
  .IX Item "k6-2"
  .PD 0
  .IP "\fBk6\-3\fR" 4
  .IX Item "k6-3"
  .PD
! Improved versions of \s-1AMD\s0 K6 \s-1CPU\s0 with \s-1MMX\s0 and 3DNow! instruction set support.
  .IP "\fBathlon\fR" 4
  .IX Item "athlon"
  .PD 0
  .IP "\fBathlon-tbird\fR" 4
  .IX Item "athlon-tbird"
  .PD
! \&\s-1AMD\s0 Athlon \s-1CPU\s0 with \s-1MMX\s0, 3dNOW!, enhanced 3DNow! and \s-1SSE\s0 prefetch instructions
  support.
  .IP "\fBathlon\-4\fR" 4
  .IX Item "athlon-4"
--- 20619,20707 ----
  .IP "\fBpentium3m\fR" 4
  .IX Item "pentium3m"
  .PD
! Intel Pentium \s-1III CPU,\s0 based on Pentium Pro core with \s-1MMX\s0 and \s-1SSE\s0 instruction
  set support.
  .IP "\fBpentium-m\fR" 4
  .IX Item "pentium-m"
! Intel Pentium M; low-power version of Intel Pentium \s-1III CPU\s0
! with \s-1MMX, SSE\s0 and \s-1SSE2\s0 instruction set support.  Used by Centrino notebooks.
  .IP "\fBpentium4\fR" 4
  .IX Item "pentium4"
  .PD 0
  .IP "\fBpentium4m\fR" 4
  .IX Item "pentium4m"
  .PD
! Intel Pentium 4 \s-1CPU\s0 with \s-1MMX, SSE\s0 and \s-1SSE2\s0 instruction set support.
  .IP "\fBprescott\fR" 4
  .IX Item "prescott"
! Improved version of Intel Pentium 4 \s-1CPU\s0 with \s-1MMX, SSE, SSE2\s0 and \s-1SSE3\s0 instruction
  set support.
  .IP "\fBnocona\fR" 4
  .IX Item "nocona"
! Improved version of Intel Pentium 4 \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE,
! SSE2\s0 and \s-1SSE3\s0 instruction set support.
  .IP "\fBcore2\fR" 4
  .IX Item "core2"
! Intel Core 2 \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3\s0 and \s-1SSSE3\s0
  instruction set support.
  .IP "\fBnehalem\fR" 4
  .IX Item "nehalem"
! Intel Nehalem \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2\s0 and \s-1POPCNT\s0 instruction set support.
  .IP "\fBwestmere\fR" 4
  .IX Item "westmere"
! Intel Westmere \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AES\s0 and \s-1PCLMUL\s0 instruction set support.
  .IP "\fBsandybridge\fR" 4
  .IX Item "sandybridge"
! Intel Sandy Bridge \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AVX, AES\s0 and \s-1PCLMUL\s0 instruction set support.
  .IP "\fBivybridge\fR" 4
  .IX Item "ivybridge"
! Intel Ivy Bridge \s-1CPU\s0 with 64\-bit extensions, \s-1MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AVX, AES, PCLMUL, FSGSBASE, RDRND\s0 and F16C
  instruction set support.
  .IP "\fBhaswell\fR" 4
  .IX Item "haswell"
! Intel Haswell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES, PCLMUL, FSGSBASE, RDRND, FMA,
! BMI, BMI2\s0 and F16C instruction set support.
  .IP "\fBbroadwell\fR" 4
  .IX Item "broadwell"
! Intel Broadwell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES, PCLMUL, FSGSBASE, RDRND, FMA,
! BMI, BMI2, F16C, RDSEED, ADCX\s0 and \s-1PREFETCHW\s0 instruction set support.
  .IP "\fBbonnell\fR" 4
  .IX Item "bonnell"
! Intel Bonnell \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3\s0 and \s-1SSSE3\s0
  instruction set support.
  .IP "\fBsilvermont\fR" 4
  .IX Item "silvermont"
! Intel Silvermont \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3, SSSE3,
! SSE4.1, SSE4.2, POPCNT, AES, PCLMUL\s0 and \s-1RDRND\s0 instruction set support.
  .IP "\fBknl\fR" 4
  .IX Item "knl"
! Intel Knight's Landing \s-1CPU\s0 with 64\-bit extensions, \s-1MOVBE, MMX, SSE, SSE2, SSE3,
! SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES, PCLMUL, FSGSBASE, RDRND, FMA,
! BMI, BMI2, F16C, RDSEED, ADCX, PREFETCHW, AVX512F, AVX512PF, AVX512ER\s0 and
  \&\s-1AVX512CD\s0 instruction set support.
  .IP "\fBk6\fR" 4
  .IX Item "k6"
! \&\s-1AMD K6 CPU\s0 with \s-1MMX\s0 instruction set support.
  .IP "\fBk6\-2\fR" 4
  .IX Item "k6-2"
  .PD 0
  .IP "\fBk6\-3\fR" 4
  .IX Item "k6-3"
  .PD
! Improved versions of \s-1AMD K6 CPU\s0 with \s-1MMX\s0 and 3DNow! instruction set support.
  .IP "\fBathlon\fR" 4
  .IX Item "athlon"
  .PD 0
  .IP "\fBathlon-tbird\fR" 4
  .IX Item "athlon-tbird"
  .PD
! \&\s-1AMD\s0 Athlon \s-1CPU\s0 with \s-1MMX,\s0 3dNOW!, enhanced 3DNow! and \s-1SSE\s0 prefetch instructions
  support.
  .IP "\fBathlon\-4\fR" 4
  .IX Item "athlon-4"
*************** support.
*** 20696,20702 ****
  .IP "\fBathlon-mp\fR" 4
  .IX Item "athlon-mp"
  .PD
! Improved \s-1AMD\s0 Athlon \s-1CPU\s0 with \s-1MMX\s0, 3DNow!, enhanced 3DNow! and full \s-1SSE\s0
  instruction set support.
  .IP "\fBk8\fR" 4
  .IX Item "k8"
--- 20711,20717 ----
  .IP "\fBathlon-mp\fR" 4
  .IX Item "athlon-mp"
  .PD
! Improved \s-1AMD\s0 Athlon \s-1CPU\s0 with \s-1MMX,\s0 3DNow!, enhanced 3DNow! and full \s-1SSE\s0
  instruction set support.
  .IP "\fBk8\fR" 4
  .IX Item "k8"
*************** instruction set support.
*** 20708,20716 ****
  .IP "\fBathlon-fx\fR" 4
  .IX Item "athlon-fx"
  .PD
! Processors based on the \s-1AMD\s0 K8 core with x86\-64 instruction set support,
  including the \s-1AMD\s0 Opteron, Athlon 64, and Athlon 64 \s-1FX\s0 processors.
! (This supersets \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, 3DNow!, enhanced 3DNow! and 64\-bit
  instruction set extensions.)
  .IP "\fBk8\-sse3\fR" 4
  .IX Item "k8-sse3"
--- 20723,20731 ----
  .IP "\fBathlon-fx\fR" 4
  .IX Item "athlon-fx"
  .PD
! Processors based on the \s-1AMD K8\s0 core with x86\-64 instruction set support,
  including the \s-1AMD\s0 Opteron, Athlon 64, and Athlon 64 \s-1FX\s0 processors.
! (This supersets \s-1MMX, SSE, SSE2,\s0 3DNow!, enhanced 3DNow! and 64\-bit
  instruction set extensions.)
  .IP "\fBk8\-sse3\fR" 4
  .IX Item "k8-sse3"
*************** instruction set extensions.)
*** 20720,20726 ****
  .IP "\fBathlon64\-sse3\fR" 4
  .IX Item "athlon64-sse3"
  .PD
! Improved versions of \s-1AMD\s0 K8 cores with \s-1SSE3\s0 instruction set support.
  .IP "\fBamdfam10\fR" 4
  .IX Item "amdfam10"
  .PD 0
--- 20735,20741 ----
  .IP "\fBathlon64\-sse3\fR" 4
  .IX Item "athlon64-sse3"
  .PD
! Improved versions of \s-1AMD K8\s0 cores with \s-1SSE3\s0 instruction set support.
  .IP "\fBamdfam10\fR" 4
  .IX Item "amdfam10"
  .PD 0
*************** Improved versions of \s-1AMD\s0 K8 cores
*** 20728,20783 ****
  .IX Item "barcelona"
  .PD
  CPUs based on \s-1AMD\s0 Family 10h cores with x86\-64 instruction set support.  (This
! supersets \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0, 3DNow!, enhanced 3DNow!, \s-1ABM\s0 and 64\-bit
  instruction set extensions.)
  .IP "\fBbdver1\fR" 4
  .IX Item "bdver1"
  CPUs based on \s-1AMD\s0 Family 15h cores with x86\-64 instruction set support.  (This
! supersets \s-1FMA4\s0, \s-1AVX\s0, \s-1XOP\s0, \s-1LWP\s0, \s-1AES\s0, \s-1PCL_MUL\s0, \s-1CX16\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0,
! \&\s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1ABM\s0 and 64\-bit instruction set extensions.)
  .IP "\fBbdver2\fR" 4
  .IX Item "bdver2"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI\s0, \s-1TBM\s0, F16C, \s-1FMA\s0, \s-1FMA4\s0, \s-1AVX\s0, \s-1XOP\s0, \s-1LWP\s0, \s-1AES\s0, \s-1PCL_MUL\s0, \s-1CX16\s0, \s-1MMX\s0,
! \&\s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0, \s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1ABM\s0 and 64\-bit instruction set 
  extensions.)
  .IP "\fBbdver3\fR" 4
  .IX Item "bdver3"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI\s0, \s-1TBM\s0, F16C, \s-1FMA\s0, \s-1FMA4\s0, \s-1FSGSBASE\s0, \s-1AVX\s0, \s-1XOP\s0, \s-1LWP\s0, \s-1AES\s0, 
! \&\s-1PCL_MUL\s0, \s-1CX16\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0, \s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1SSE4\s0.2, \s-1ABM\s0 and 
  64\-bit instruction set extensions.
  .IP "\fBbdver4\fR" 4
  .IX Item "bdver4"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI\s0, \s-1BMI2\s0, \s-1TBM\s0, F16C, \s-1FMA\s0, \s-1FMA4\s0, \s-1FSGSBASE\s0, \s-1AVX\s0, \s-1AVX2\s0, \s-1XOP\s0, \s-1LWP\s0, 
! \&\s-1AES\s0, \s-1PCL_MUL\s0, \s-1CX16\s0, \s-1MOVBE\s0, \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSE4A\s0, \s-1SSSE3\s0, \s-1SSE4\s0.1, 
! \&\s-1SSE4\s0.2, \s-1ABM\s0 and 64\-bit instruction set extensions.
  .IP "\fBbtver1\fR" 4
  .IX Item "btver1"
  CPUs based on \s-1AMD\s0 Family 14h cores with x86\-64 instruction set support.  (This
! supersets \s-1MMX\s0, \s-1SSE\s0, \s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0, \s-1SSE4A\s0, \s-1CX16\s0, \s-1ABM\s0 and 64\-bit
  instruction set extensions.)
  .IP "\fBbtver2\fR" 4
  .IX Item "btver2"
  CPUs based on \s-1AMD\s0 Family 16h cores with x86\-64 instruction set support. This
! includes \s-1MOVBE\s0, F16C, \s-1BMI\s0, \s-1AVX\s0, \s-1PCL_MUL\s0, \s-1AES\s0, \s-1SSE4\s0.2, \s-1SSE4\s0.1, \s-1CX16\s0, \s-1ABM\s0,
! \&\s-1SSE4A\s0, \s-1SSSE3\s0, \s-1SSE3\s0, \s-1SSE2\s0, \s-1SSE\s0, \s-1MMX\s0 and 64\-bit instruction set extensions.
  .IP "\fBwinchip\-c6\fR" 4
  .IX Item "winchip-c6"
! \&\s-1IDT\s0 WinChip C6 \s-1CPU\s0, dealt in same way as i486 with additional \s-1MMX\s0 instruction
  set support.
  .IP "\fBwinchip2\fR" 4
  .IX Item "winchip2"
! \&\s-1IDT\s0 WinChip 2 \s-1CPU\s0, dealt in same way as i486 with additional \s-1MMX\s0 and 3DNow!
  instruction set support.
  .IP "\fBc3\fR" 4
  .IX Item "c3"
! \&\s-1VIA\s0 C3 \s-1CPU\s0 with \s-1MMX\s0 and 3DNow! instruction set support.  (No scheduling is
  implemented for this chip.)
  .IP "\fBc3\-2\fR" 4
  .IX Item "c3-2"
! \&\s-1VIA\s0 C3\-2 (Nehemiah/C5XL) \s-1CPU\s0 with \s-1MMX\s0 and \s-1SSE\s0 instruction set support.
  (No scheduling is
  implemented for this chip.)
  .IP "\fBgeode\fR" 4
--- 20743,20798 ----
  .IX Item "barcelona"
  .PD
  CPUs based on \s-1AMD\s0 Family 10h cores with x86\-64 instruction set support.  (This
! supersets \s-1MMX, SSE, SSE2, SSE3, SSE4A,\s0 3DNow!, enhanced 3DNow!, \s-1ABM\s0 and 64\-bit
  instruction set extensions.)
  .IP "\fBbdver1\fR" 4
  .IX Item "bdver1"
  CPUs based on \s-1AMD\s0 Family 15h cores with x86\-64 instruction set support.  (This
! supersets \s-1FMA4, AVX, XOP, LWP, AES, PCL_MUL, CX16, MMX, SSE, SSE2, SSE3, SSE4A,
! SSSE3, SSE4.1, SSE4.2, ABM\s0 and 64\-bit instruction set extensions.)
  .IP "\fBbdver2\fR" 4
  .IX Item "bdver2"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI, TBM, F16C, FMA, FMA4, AVX, XOP, LWP, AES, PCL_MUL, CX16, MMX,
! SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1, SSE4.2, ABM\s0 and 64\-bit instruction set 
  extensions.)
  .IP "\fBbdver3\fR" 4
  .IX Item "bdver3"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI, TBM, F16C, FMA, FMA4, FSGSBASE, AVX, XOP, LWP, AES,\s0 
! \&\s-1PCL_MUL, CX16, MMX, SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1, SSE4.2, ABM\s0 and 
  64\-bit instruction set extensions.
  .IP "\fBbdver4\fR" 4
  .IX Item "bdver4"
  \&\s-1AMD\s0 Family 15h core based CPUs with x86\-64 instruction set support.  (This
! supersets \s-1BMI, BMI2, TBM, F16C, FMA, FMA4, FSGSBASE, AVX, AVX2, XOP, LWP,\s0 
! \&\s-1AES, PCL_MUL, CX16, MOVBE, MMX, SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1,\s0 
! \&\s-1SSE4.2, ABM\s0 and 64\-bit instruction set extensions.
  .IP "\fBbtver1\fR" 4
  .IX Item "btver1"
  CPUs based on \s-1AMD\s0 Family 14h cores with x86\-64 instruction set support.  (This
! supersets \s-1MMX, SSE, SSE2, SSE3, SSSE3, SSE4A, CX16, ABM\s0 and 64\-bit
  instruction set extensions.)
  .IP "\fBbtver2\fR" 4
  .IX Item "btver2"
  CPUs based on \s-1AMD\s0 Family 16h cores with x86\-64 instruction set support. This
! includes \s-1MOVBE, F16C, BMI, AVX, PCL_MUL, AES, SSE4.2, SSE4.1, CX16, ABM,
! SSE4A, SSSE3, SSE3, SSE2, SSE, MMX\s0 and 64\-bit instruction set extensions.
  .IP "\fBwinchip\-c6\fR" 4
  .IX Item "winchip-c6"
! \&\s-1IDT\s0 WinChip C6 \s-1CPU,\s0 dealt in same way as i486 with additional \s-1MMX\s0 instruction
  set support.
  .IP "\fBwinchip2\fR" 4
  .IX Item "winchip2"
! \&\s-1IDT\s0 WinChip 2 \s-1CPU,\s0 dealt in same way as i486 with additional \s-1MMX\s0 and 3DNow!
  instruction set support.
  .IP "\fBc3\fR" 4
  .IX Item "c3"
! \&\s-1VIA C3 CPU\s0 with \s-1MMX\s0 and 3DNow! instruction set support.  (No scheduling is
  implemented for this chip.)
  .IP "\fBc3\-2\fR" 4
  .IX Item "c3-2"
! \&\s-1VIA C3\-2\s0 (Nehemiah/C5XL) \s-1CPU\s0 with \s-1MMX\s0 and \s-1SSE\s0 instruction set support.
  (No scheduling is
  implemented for this chip.)
  .IP "\fBgeode\fR" 4
*************** of your application will have, then you
*** 20811,20817 ****
  .Sp
  As new processors are deployed in the marketplace, the behavior of this
  option will change.  Therefore, if you upgrade to a newer version of
! \&\s-1GCC\s0, code generation controlled by this option will change to reflect
  the processors
  that are most common at the time that version of \s-1GCC\s0 is released.
  .Sp
--- 20826,20832 ----
  .Sp
  As new processors are deployed in the marketplace, the behavior of this
  option will change.  Therefore, if you upgrade to a newer version of
! \&\s-1GCC,\s0 code generation controlled by this option will change to reflect
  the processors
  that are most common at the time that version of \s-1GCC\s0 is released.
  .Sp
*************** processors) for which the code is optimi
*** 20823,20829 ****
  .IP "\fBintel\fR" 4
  .IX Item "intel"
  Produce code optimized for the most current Intel processors, which are
! Haswell and Silvermont for this version of \s-1GCC\s0.  If you know the \s-1CPU\s0
  on which your code will run, then you should use the corresponding
  \&\fB\-mtune\fR or \fB\-march\fR option instead of \fB\-mtune=intel\fR.
  But, if you want your application performs better on both Haswell and
--- 20838,20844 ----
  .IP "\fBintel\fR" 4
  .IX Item "intel"
  Produce code optimized for the most current Intel processors, which are
! Haswell and Silvermont for this version of \s-1GCC.\s0  If you know the \s-1CPU\s0
  on which your code will run, then you should use the corresponding
  \&\fB\-mtune\fR or \fB\-march\fR option instead of \fB\-mtune=intel\fR.
  But, if you want your application performs better on both Haswell and
*************** Silvermont, then you should use this opt
*** 20831,20837 ****
  .Sp
  As new Intel processors are deployed in the marketplace, the behavior of
  this option will change.  Therefore, if you upgrade to a newer version of
! \&\s-1GCC\s0, code generation controlled by this option will change to reflect
  the most current Intel processors at the time that version of \s-1GCC\s0 is
  released.
  .Sp
--- 20846,20852 ----
  .Sp
  As new Intel processors are deployed in the marketplace, the behavior of
  this option will change.  Therefore, if you upgrade to a newer version of
! \&\s-1GCC,\s0 code generation controlled by this option will change to reflect
  the most current Intel processors at the time that version of \s-1GCC\s0 is
  released.
  .Sp
*************** comparison is unordered.
*** 20916,20922 ****
  .IX Item "-msoft-float"
  Generate output containing library calls for floating point.
  .Sp
! \&\fBWarning:\fR the requisite libraries are not part of \s-1GCC\s0.
  Normally the facilities of the machine's usual C compiler are used, but
  this can't be done directly in cross-compilation.  You must make your
  own arrangements to provide suitable library functions for
--- 20931,20937 ----
  .IX Item "-msoft-float"
  Generate output containing library calls for floating point.
  .Sp
! \&\fBWarning:\fR the requisite libraries are not part of \s-1GCC.\s0
  Normally the facilities of the machine's usual C compiler are used, but
  this can't be done directly in cross-compilation.  You must make your
  own arrangements to provide suitable library functions for
*************** Do not use the \s-1FPU\s0 registers for
*** 20931,20938 ****
  .Sp
  The usual calling convention has functions return values of types
  \&\f(CW\*(C`float\*(C'\fR and \f(CW\*(C`double\*(C'\fR in an \s-1FPU\s0 register, even if there
! is no \s-1FPU\s0.  The idea is that the operating system should emulate
! an \s-1FPU\s0.
  .Sp
  The option \fB\-mno\-fp\-ret\-in\-387\fR causes such values to be returned
  in ordinary \s-1CPU\s0 registers instead.
--- 20946,20953 ----
  .Sp
  The usual calling convention has functions return values of types
  \&\f(CW\*(C`float\*(C'\fR and \f(CW\*(C`double\*(C'\fR in an \s-1FPU\s0 register, even if there
! is no \s-1FPU.\s0  The idea is that the operating system should emulate
! an \s-1FPU.\s0
  .Sp
  The option \fB\-mno\-fp\-ret\-in\-387\fR causes such values to be returned
  in ordinary \s-1CPU\s0 registers instead.
*************** so \fB\-m96bit\-long\-double\fR is the d
*** 20977,20983 ****
  .Sp
  Modern architectures (Pentium and newer) prefer \f(CW\*(C`long double\*(C'\fR
  to be aligned to an 8\- or 16\-byte boundary.  In arrays or structures
! conforming to the \s-1ABI\s0, this is not possible.  So specifying
  \&\fB\-m128bit\-long\-double\fR aligns \f(CW\*(C`long double\*(C'\fR
  to a 16\-byte boundary by padding the \f(CW\*(C`long double\*(C'\fR with an additional
  32\-bit zero.
--- 20992,20998 ----
  .Sp
  Modern architectures (Pentium and newer) prefer \f(CW\*(C`long double\*(C'\fR
  to be aligned to an 8\- or 16\-byte boundary.  In arrays or structures
! conforming to the \s-1ABI,\s0 this is not possible.  So specifying
  \&\fB\-m128bit\-long\-double\fR aligns \f(CW\*(C`long double\*(C'\fR
  to a 16\-byte boundary by padding the \f(CW\*(C`long double\*(C'\fR with an additional
  32\-bit zero.
*************** its \s-1ABI\s0 specifies that \f(CW\*(C`
*** 20988,20994 ****
  Notice that neither of these options enable any extra precision over the x87
  standard of 80 bits for a \f(CW\*(C`long double\*(C'\fR.
  .Sp
! \&\fBWarning:\fR if you override the default value for your target \s-1ABI\s0, this
  changes the size of 
  structures and arrays containing \f(CW\*(C`long double\*(C'\fR variables,
  as well as modifying the function calling convention for functions taking
--- 21003,21009 ----
  Notice that neither of these options enable any extra precision over the x87
  standard of 80 bits for a \f(CW\*(C`long double\*(C'\fR.
  .Sp
! \&\fBWarning:\fR if you override the default value for your target \s-1ABI,\s0 this
  changes the size of 
  structures and arrays containing \f(CW\*(C`long double\*(C'\fR variables,
  as well as modifying the function calling convention for functions taking
*************** type. This is the default for 32\-bit Bi
*** 21008,21014 ****
  of 128 bits makes the \f(CW\*(C`long double\*(C'\fR type equivalent to the
  \&\f(CW\*(C`_\|_float128\*(C'\fR type. This is the default for 64\-bit Bionic C library.
  .Sp
! \&\fBWarning:\fR if you override the default value for your target \s-1ABI\s0, this
  changes the size of
  structures and arrays containing \f(CW\*(C`long double\*(C'\fR variables,
  as well as modifying the function calling convention for functions taking
--- 21023,21029 ----
  of 128 bits makes the \f(CW\*(C`long double\*(C'\fR type equivalent to the
  \&\f(CW\*(C`_\|_float128\*(C'\fR type. This is the default for 64\-bit Bionic C library.
  .Sp
! \&\fBWarning:\fR if you override the default value for your target \s-1ABI,\s0 this
  changes the size of
  structures and arrays containing \f(CW\*(C`long double\*(C'\fR variables,
  as well as modifying the function calling convention for functions taking
*************** with code compiled without that switch.
*** 21017,21023 ****
  .IP "\fB\-malign\-data=\fR\fItype\fR" 4
  .IX Item "-malign-data=type"
  Control how \s-1GCC\s0 aligns variables.  Supported values for \fItype\fR are
! \&\fBcompat\fR uses increased alignment value compatible uses \s-1GCC\s0 4.8
  and earlier, \fBabi\fR uses alignment value as specified by the
  psABI, and \fBcacheline\fR uses increased alignment value to match
  the cache line size.  \fBcompat\fR is the default.
--- 21032,21038 ----
  .IP "\fB\-malign\-data=\fR\fItype\fR" 4
  .IX Item "-malign-data=type"
  Control how \s-1GCC\s0 aligns variables.  Supported values for \fItype\fR are
! \&\fBcompat\fR uses increased alignment value compatible uses \s-1GCC 4.8\s0
  and earlier, \fBabi\fR uses alignment value as specified by the
  psABI, and \fBcacheline\fR uses increased alignment value to match
  the cache line size.  \fBcompat\fR is the default.
*************** Studio compilers until version 12.  Late
*** 21079,21085 ****
  with Studio 12 Update@tie{}1) follow the \s-1ABI\s0 used by other x86 targets, which
  is the default on Solaris@tie{}10 and later.  \fIOnly\fR use this option if
  you need to remain compatible with existing code produced by those
! previous compiler versions or older versions of \s-1GCC\s0.
  .IP "\fB\-mpc32\fR" 4
  .IX Item "-mpc32"
  .PD 0
--- 21094,21100 ----
  with Studio 12 Update@tie{}1) follow the \s-1ABI\s0 used by other x86 targets, which
  is the default on Solaris@tie{}10 and later.  \fIOnly\fR use this option if
  you need to remain compatible with existing code produced by those
! previous compiler versions or older versions of \s-1GCC.\s0
  .IP "\fB\-mpc32\fR" 4
  .IX Item "-mpc32"
  .PD 0
*************** the one specified by \fB\-mpreferred\-st
*** 21140,21146 ****
  .Sp
  On Pentium and Pentium Pro, \f(CW\*(C`double\*(C'\fR and \f(CW\*(C`long double\*(C'\fR values
  should be aligned to an 8\-byte boundary (see \fB\-malign\-double\fR) or
! suffer significant run time performance penalties.  On Pentium \s-1III\s0, the
  Streaming \s-1SIMD\s0 Extension (\s-1SSE\s0) data type \f(CW\*(C`_\|_m128\*(C'\fR may not work
  properly if it is not 16\-byte aligned.
  .Sp
--- 21155,21161 ----
  .Sp
  On Pentium and Pentium Pro, \f(CW\*(C`double\*(C'\fR and \f(CW\*(C`long double\*(C'\fR values
  should be aligned to an 8\-byte boundary (see \fB\-malign\-double\fR) or
! suffer significant run time performance penalties.  On Pentium \s-1III,\s0 the
  Streaming \s-1SIMD\s0 Extension (\s-1SSE\s0) data type \f(CW\*(C`_\|_m128\*(C'\fR may not work
  properly if it is not 16\-byte aligned.
  .Sp
*************** preferred alignment to \fB\-mpreferred\-
*** 21244,21253 ****
  .IP "\fB\-mmwaitx\fR" 4
  .IX Item "-mmwaitx"
  .PD
! These switches enable the use of instructions in the \s-1MMX\s0, \s-1SSE\s0,
! \&\s-1SSE2\s0, \s-1SSE3\s0, \s-1SSSE3\s0, \s-1SSE4\s0.1, \s-1AVX\s0, \s-1AVX2\s0, \s-1AVX512F\s0, \s-1AVX512PF\s0, \s-1AVX512ER\s0, \s-1AVX512CD\s0,
! \&\s-1SHA\s0, \s-1AES\s0, \s-1PCLMUL\s0, \s-1FSGSBASE\s0, \s-1RDRND\s0, F16C, \s-1FMA\s0, \s-1SSE4A\s0, \s-1FMA4\s0, \s-1XOP\s0, \s-1LWP\s0, \s-1ABM\s0,
! \&\s-1BMI\s0, \s-1BMI2\s0, \s-1FXSR\s0, \s-1XSAVE\s0, \s-1XSAVEOPT\s0, \s-1LZCNT\s0, \s-1RTM\s0, \s-1MPX\s0, \s-1MWAITX\s0 or 3DNow!
  extended instruction sets.  Each has a corresponding \fB\-mno\-\fR option
  to disable use of these instructions.
  .Sp
--- 21259,21268 ----
  .IP "\fB\-mmwaitx\fR" 4
  .IX Item "-mmwaitx"
  .PD
! These switches enable the use of instructions in the \s-1MMX, SSE,
! SSE2, SSE3, SSSE3, SSE4.1, AVX, AVX2, AVX512F, AVX512PF, AVX512ER, AVX512CD,
! SHA, AES, PCLMUL, FSGSBASE, RDRND, F16C, FMA, SSE4A, FMA4, XOP, LWP, ABM,
! BMI, BMI2, FXSR, XSAVE, XSAVEOPT, LZCNT, RTM, MPX, MWAITX\s0 or 3DNow!
  extended instruction sets.  Each has a corresponding \fB\-mno\-\fR option
  to disable use of these instructions.
  .Sp
*************** This option enables generation of \f(CW\
*** 21324,21330 ****
  Early Intel Pentium 4 CPUs with Intel 64 support,
  prior to the introduction of Pentium 4 G1 step in December 2005,
  lacked the \f(CW\*(C`LAHF\*(C'\fR and \f(CW\*(C`SAHF\*(C'\fR instructions
! which are supported by \s-1AMD64\s0.
  These are load and store instructions, respectively, for certain status flags.
  In 64\-bit mode, the \f(CW\*(C`SAHF\*(C'\fR instruction is used to optimize \f(CW\*(C`fmod\*(C'\fR,
  \&\f(CW\*(C`drem\*(C'\fR, and \f(CW\*(C`remainder\*(C'\fR built-in functions;
--- 21339,21345 ----
  Early Intel Pentium 4 CPUs with Intel 64 support,
  prior to the introduction of Pentium 4 G1 step in December 2005,
  lacked the \f(CW\*(C`LAHF\*(C'\fR and \f(CW\*(C`SAHF\*(C'\fR instructions
! which are supported by \s-1AMD64.\s0
  These are load and store instructions, respectively, for certain status flags.
  In 64\-bit mode, the \f(CW\*(C`SAHF\*(C'\fR instruction is used to optimize \f(CW\*(C`fmod\*(C'\fR,
  \&\f(CW\*(C`drem\*(C'\fR, and \f(CW\*(C`remainder\*(C'\fR built-in functions;
*************** when \fB\-mveclibabi=acml\fR is used.
*** 21423,21429 ****
  .IX Item "-mabi=name"
  Generate code for the specified calling convention.  Permissible values
  are \fBsysv\fR for the \s-1ABI\s0 used on GNU/Linux and other systems, and
! \&\fBms\fR for the Microsoft \s-1ABI\s0.  The default is to use the Microsoft
  \&\s-1ABI\s0 when targeting Microsoft Windows and the SysV \s-1ABI\s0 on all other systems.
  You can control this behavior for specific functions by
  using the function attributes \f(CW\*(C`ms_abi\*(C'\fR and \f(CW\*(C`sysv_abi\*(C'\fR.
--- 21438,21444 ----
  .IX Item "-mabi=name"
  Generate code for the specified calling convention.  Permissible values
  are \fBsysv\fR for the \s-1ABI\s0 used on GNU/Linux and other systems, and
! \&\fBms\fR for the Microsoft \s-1ABI.\s0  The default is to use the Microsoft
  \&\s-1ABI\s0 when targeting Microsoft Windows and the SysV \s-1ABI\s0 on all other systems.
  You can control this behavior for specific functions by
  using the function attributes \f(CW\*(C`ms_abi\*(C'\fR and \f(CW\*(C`sysv_abi\*(C'\fR.
*************** or whether the thread base pointer must
*** 21538,21544 ****
  is valid depends on the operating system, and whether it maps the
  segment to cover the entire \s-1TLS\s0 area.
  .Sp
! For systems that use the \s-1GNU\s0 C Library, the default is on.
  .IP "\fB\-msse2avx\fR" 4
  .IX Item "-msse2avx"
  .PD 0
--- 21553,21559 ----
  is valid depends on the operating system, and whether it maps the
  segment to cover the entire \s-1TLS\s0 area.
  .Sp
! For systems that use the \s-1GNU C\s0 Library, the default is on.
  .IP "\fB\-msse2avx\fR" 4
  .IX Item "-msse2avx"
  .PD 0
*************** register when there are no variable argu
*** 21589,21595 ****
  \&\fBWarning:\fR Since \s-1RAX\s0 register is used to avoid unnecessarily
  saving vector registers on stack when passing variable arguments, the
  impacts of this option are callees may waste some stack space,
! misbehave or jump to a random location.  \s-1GCC\s0 4.4 or newer don't have
  those issues, regardless the \s-1RAX\s0 register value.
  .IP "\fB\-m8bit\-idiv\fR" 4
  .IX Item "-m8bit-idiv"
--- 21604,21610 ----
  \&\fBWarning:\fR Since \s-1RAX\s0 register is used to avoid unnecessarily
  saving vector registers on stack when passing variable arguments, the
  impacts of this option are callees may waste some stack space,
! misbehave or jump to a random location.  \s-1GCC 4.4\s0 or newer don't have
  those issues, regardless the \s-1RAX\s0 register value.
  .IP "\fB\-m8bit\-idiv\fR" 4
  .IX Item "-m8bit-idiv"
*************** appropriately.
*** 21733,21739 ****
  This option is available for MinGW targets. It specifies that
  the executable flag for the stack used by nested functions isn't
  set. This is necessary for binaries running in kernel mode of
! Microsoft Windows, as there the User32 \s-1API\s0, which is used to set executable
  privileges, isn't available.
  .IP "\fB\-fwritable\-relocated\-rdata\fR" 4
  .IX Item "-fwritable-relocated-rdata"
--- 21748,21754 ----
  This option is available for MinGW targets. It specifies that
  the executable flag for the stack used by nested functions isn't
  set. This is necessary for binaries running in kernel mode of
! Microsoft Windows, as there the User32 \s-1API,\s0 which is used to set executable
  privileges, isn't available.
  .IP "\fB\-fwritable\-relocated\-rdata\fR" 4
  .IX Item "-fwritable-relocated-rdata"
*************** kernel code.
*** 21818,21824 ****
  These options control the treatment of literal pools.  The default is
  \&\fB\-mno\-text\-section\-literals\fR, which places literals in a separate
  section in the output file.  This allows the literal pool to be placed
! in a data \s-1RAM/ROM\s0, and it also allows the linker to combine literal
  pools from separate object files to remove redundant literals and
  improve code size.  With \fB\-mtext\-section\-literals\fR, the literals
  are interspersed in the text section in order to keep them as close as
--- 21833,21839 ----
  These options control the treatment of literal pools.  The default is
  \&\fB\-mno\-text\-section\-literals\fR, which places literals in a separate
  section in the output file.  This allows the literal pool to be placed
! in a data \s-1RAM/ROM,\s0 and it also allows the linker to combine literal
  pools from separate object files to remove redundant literals and
  improve code size.  With \fB\-mtext\-section\-literals\fR, the literals
  are interspersed in the text section in order to keep them as close as
*************** every cross-file call, not just those th
*** 21864,21870 ****
  .IX Subsection "zSeries Options"
  .PP
  These are listed under
! .Sh "Options for Code Generation Conventions"
  .IX Subsection "Options for Code Generation Conventions"
  These machine-independent options control the interface conventions
  used in code generation.
--- 21879,21885 ----
  .IX Subsection "zSeries Options"
  .PP
  These are listed under
! .SS "Options for Code Generation Conventions"
  .IX Subsection "Options for Code Generation Conventions"
  These machine-independent options control the interface conventions
  used in code generation.
*************** You normally do not need to enable this
*** 22003,22009 ****
  that needs this handling enables it on your behalf.
  .IP "\fB\-fasynchronous\-unwind\-tables\fR" 4
  .IX Item "-fasynchronous-unwind-tables"
! Generate unwind table in \s-1DWARF\s0 2 format, if supported by target machine.  The
  table is exact at each instruction boundary, so it can be used for stack
  unwinding from asynchronous events (such as debugger or garbage collector).
  .IP "\fB\-fno\-gnu\-unique\fR" 4
--- 22018,22024 ----
  that needs this handling enables it on your behalf.
  .IP "\fB\-fasynchronous\-unwind\-tables\fR" 4
  .IX Item "-fasynchronous-unwind-tables"
! Generate unwind table in \s-1DWARF 2\s0 format, if supported by target machine.  The
  table is exact at each instruction boundary, so it can be used for stack
  unwinding from asynchronous events (such as debugger or garbage collector).
  .IP "\fB\-fno\-gnu\-unique\fR" 4
*************** Use it to conform to a non-default appli
*** 22074,22080 ****
  .IX Item "-fshort-wchar"
  Override the underlying type for \f(CW\*(C`wchar_t\*(C'\fR to be \f(CW\*(C`short
  unsigned int\*(C'\fR instead of the default for the target.  This option is
! useful for building programs to run under \s-1WINE\s0.
  .Sp
  \&\fBWarning:\fR the \fB\-fshort\-wchar\fR switch causes \s-1GCC\s0 to generate
  code that is not binary compatible with code generated without that switch.
--- 22089,22095 ----
  .IX Item "-fshort-wchar"
  Override the underlying type for \f(CW\*(C`wchar_t\*(C'\fR to be \f(CW\*(C`short
  unsigned int\*(C'\fR instead of the default for the target.  This option is
! useful for building programs to run under \s-1WINE.\s0
  .Sp
  \&\fBWarning:\fR the \fB\-fshort\-wchar\fR switch causes \s-1GCC\s0 to generate
  code that is not binary compatible with code generated without that switch.
*************** such variables in different compilation
*** 22087,22093 ****
  in a common block.
  This is the behavior specified by \fB\-fcommon\fR, and is the default
  for \s-1GCC\s0 on most targets.
! On the other hand, this behavior is not required by \s-1ISO\s0 C, and on some
  targets may carry a speed or code size penalty on variable references.
  The \fB\-fno\-common\fR option specifies that the compiler should place
  uninitialized global variables in the data section of the object file,
--- 22102,22108 ----
  in a common block.
  This is the behavior specified by \fB\-fcommon\fR, and is the default
  for \s-1GCC\s0 on most targets.
! On the other hand, this behavior is not required by \s-1ISO C,\s0 and on some
  targets may carry a speed or code size penalty on variable references.
  The \fB\-fno\-common\fR option specifies that the compiler should place
  uninitialized global variables in the data section of the object file,
*************** the \s-1GOT\s0 size for the linked execu
*** 22143,22153 ****
  maximum size, you get an error message from the linker indicating that
  \&\fB\-fpic\fR does not work; in that case, recompile with \fB\-fPIC\fR
  instead.  (These maximums are 8k on the \s-1SPARC\s0 and 32k
! on the m68k and \s-1RS/6000\s0.  The x86 has no such limit.)
  .Sp
  Position-independent code requires special support, and therefore works
  only on certain machines.  For the x86, \s-1GCC\s0 supports \s-1PIC\s0 for System V
! but not for the Sun 386i.  Code generated for the \s-1IBM\s0 \s-1RS/6000\s0 is always
  position-independent.
  .Sp
  When this flag is set, the macros \f(CW\*(C`_\|_pic_\|_\*(C'\fR and \f(CW\*(C`_\|_PIC_\|_\*(C'\fR
--- 22158,22168 ----
  maximum size, you get an error message from the linker indicating that
  \&\fB\-fpic\fR does not work; in that case, recompile with \fB\-fPIC\fR
  instead.  (These maximums are 8k on the \s-1SPARC\s0 and 32k
! on the m68k and \s-1RS/6000.\s0  The x86 has no such limit.)
  .Sp
  Position-independent code requires special support, and therefore works
  only on certain machines.  For the x86, \s-1GCC\s0 supports \s-1PIC\s0 for System V
! but not for the Sun 386i.  Code generated for the \s-1IBM RS/6000\s0 is always
  position-independent.
  .Sp
  When this flag is set, the macros \f(CW\*(C`_\|_pic_\|_\*(C'\fR and \f(CW\*(C`_\|_PIC_\|_\*(C'\fR
*************** are defined to 1.
*** 22157,22163 ****
  If supported for the target machine, emit position-independent code,
  suitable for dynamic linking and avoiding any limit on the size of the
  global offset table.  This option makes a difference on the m68k,
! PowerPC and \s-1SPARC\s0.
  .Sp
  Position-independent code requires special support, and therefore works
  only on certain machines.
--- 22172,22178 ----
  If supported for the target machine, emit position-independent code,
  suitable for dynamic linking and avoiding any limit on the size of the
  global offset table.  This option makes a difference on the m68k,
! PowerPC and \s-1SPARC.\s0
  .Sp
  Position-independent code requires special support, and therefore works
  only on certain machines.
*************** name, such as \f(CW\*(C`vector<int> blah
*** 22307,22313 ****
  internal mangled name (e.g., \f(CW\*(C`_Z4blahRSt6vectorIiSaIiEE\*(C'\fR).  The
  match is done on substrings: if the \fIsym\fR parameter is a substring
  of the function name, it is considered to be a match.  For C99 and \*(C+
! extended identifiers, the function name must be given in \s-1UTF\-8\s0, not
  using universal character names.
  .IP "\fB\-fstack\-check\fR" 4
  .IX Item "-fstack-check"
--- 22322,22328 ----
  internal mangled name (e.g., \f(CW\*(C`_Z4blahRSt6vectorIiSaIiEE\*(C'\fR).  The
  match is done on substrings: if the \fIsym\fR parameter is a substring
  of the function name, it is considered to be a match.  For C99 and \*(C+
! extended identifiers, the function name must be given in \s-1UTF\-8,\s0 not
  using universal character names.
  .IP "\fB\-fstack\-check\fR" 4
  .IX Item "-fstack-check"
*************** always specify visibility when it is not
*** 22446,22452 ****
  only for use within the local \s-1DSO\s0 should \fBalways\fR be marked explicitly
  as hidden as so to avoid \s-1PLT\s0 indirection overheads\-\-\-making this
  abundantly clear also aids readability and self-documentation of the code.
! Note that due to \s-1ISO\s0 \*(C+ specification requirements, \f(CW\*(C`operator new\*(C'\fR and
  \&\f(CW\*(C`operator delete\*(C'\fR must always be of default visibility.
  .Sp
  Be aware that headers from outside your project, in particular system
--- 22461,22467 ----
  only for use within the local \s-1DSO\s0 should \fBalways\fR be marked explicitly
  as hidden as so to avoid \s-1PLT\s0 indirection overheads\-\-\-making this
  abundantly clear also aids readability and self-documentation of the code.
! Note that due to \s-1ISO \*(C+\s0 specification requirements, \f(CW\*(C`operator new\*(C'\fR and
  \&\f(CW\*(C`operator delete\*(C'\fR must always be of default visibility.
  .Sp
  Be aware that headers from outside your project, in particular system
*************** before including any such headers.
*** 22458,22464 ****
  \&\f(CW\*(C`extern\*(C'\fR declarations are not affected by \fB\-fvisibility\fR, so
  a lot of code can be recompiled with \fB\-fvisibility=hidden\fR with
  no modifications.  However, this means that calls to \f(CW\*(C`extern\*(C'\fR
! functions with no explicit visibility use the \s-1PLT\s0, so it is more
  effective to use \f(CW\*(C`_\|_attribute ((visibility))\*(C'\fR and/or
  \&\f(CW\*(C`#pragma GCC visibility\*(C'\fR to tell the compiler which \f(CW\*(C`extern\*(C'\fR
  declarations should be treated as hidden.
--- 22473,22479 ----
  \&\f(CW\*(C`extern\*(C'\fR declarations are not affected by \fB\-fvisibility\fR, so
  a lot of code can be recompiled with \fB\-fvisibility=hidden\fR with
  no modifications.  However, this means that calls to \f(CW\*(C`extern\*(C'\fR
! functions with no explicit visibility use the \s-1PLT,\s0 so it is more
  effective to use \f(CW\*(C`_\|_attribute ((visibility))\*(C'\fR and/or
  \&\f(CW\*(C`#pragma GCC visibility\*(C'\fR to tell the compiler which \f(CW\*(C`extern\*(C'\fR
  declarations should be treated as hidden.
*************** aspects of the compilation environment.
*** 22520,22526 ****
  Note that you can also specify places to search using options such as
  \&\fB\-B\fR, \fB\-I\fR and \fB\-L\fR.  These
  take precedence over places specified using environment variables, which
! in turn take precedence over those specified by the configuration of \s-1GCC\s0.
  .IP "\fB\s-1LANG\s0\fR" 4
  .IX Item "LANG"
  .PD 0
--- 22535,22541 ----
  Note that you can also specify places to search using options such as
  \&\fB\-B\fR, \fB\-I\fR and \fB\-L\fR.  These
  take precedence over places specified using environment variables, which
! in turn take precedence over those specified by the configuration of \s-1GCC.\s0
  .IP "\fB\s-1LANG\s0\fR" 4
  .IX Item "LANG"
  .PD 0
*************** national conventions.  \s-1GCC\s0 inspec
*** 22537,22543 ****
  \&\fB\s-1LC_CTYPE\s0\fR and \fB\s-1LC_MESSAGES\s0\fR if it has been configured to do
  so.  These locale categories can be set to any value supported by your
  installation.  A typical value is \fBen_GB.UTF\-8\fR for English in the United
! Kingdom encoded in \s-1UTF\-8\s0.
  .Sp
  The \fB\s-1LC_CTYPE\s0\fR environment variable specifies character
  classification.  \s-1GCC\s0 uses it to determine the character boundaries in
--- 22552,22558 ----
  \&\fB\s-1LC_CTYPE\s0\fR and \fB\s-1LC_MESSAGES\s0\fR if it has been configured to do
  so.  These locale categories can be set to any value supported by your
  installation.  A typical value is \fBen_GB.UTF\-8\fR for English in the United
! Kingdom encoded in \s-1UTF\-8.\s0
  .Sp
  The \fB\s-1LC_CTYPE\s0\fR environment variable specifies character
  classification.  \s-1GCC\s0 uses it to determine the character boundaries in
*************** and the Info entries for \fIgcc\fR, \fIc
*** 22717,22723 ****
  .IX Header "AUTHOR"
  See the Info entry for \fBgcc\fR, or
  <\fBhttp://gcc.gnu.org/onlinedocs/gcc/Contributors.html\fR>,
! for contributors to \s-1GCC\s0.
  .SH "COPYRIGHT"
  .IX Header "COPYRIGHT"
  Copyright (c) 1988\-2015 Free Software Foundation, Inc.
--- 22732,22738 ----
  .IX Header "AUTHOR"
  See the Info entry for \fBgcc\fR, or
  <\fBhttp://gcc.gnu.org/onlinedocs/gcc/Contributors.html\fR>,
! for contributors to \s-1GCC.\s0
  .SH "COPYRIGHT"
  .IX Header "COPYRIGHT"
  Copyright (c) 1988\-2015 Free Software Foundation, Inc.
diff -Nrcpad gcc-5.4.0/gcc/doc/gcc.info gcc-5.5.0/gcc/doc/gcc.info
*** gcc-5.4.0/gcc/doc/gcc.info	Fri Jun  3 10:32:21 2016
--- gcc-5.5.0/gcc/doc/gcc.info	Tue Oct 10 09:40:11 2017
***************
*** 1,5 ****
! This is doc/gcc.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/doc/gcc.texi.
  
  Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
--- 1,4 ----
! This is gcc.info, produced by makeinfo version 6.1 from gcc.texi.
  
  Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
*************** Free Documentation License".
*** 17,33 ****
  
   (b) The FSF's Back-Cover Text is:
  
!  You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
! 
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * gcc: (gcc).                  The GNU Compiler Collection.
  * g++: (gcc).                  The GNU C++ compiler.
! * gcov: (gcc) Gcov.            `gcov'--a test coverage program.
! * gcov-tool: (gcc) Gcov-tool.  `gcov-tool'--an offline gcda profile processing program.
  END-INFO-DIR-ENTRY
   This file documents the use of the GNU compilers.
  
   Copyright (C) 1988-2015 Free Software Foundation, Inc.
--- 16,33 ----
  
   (b) The FSF's Back-Cover Text is:
  
!  You have freedom to copy and modify this GNU Manual, like GNU software.
! Copies published by the Free Software Foundation raise funds for GNU
! development.
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * gcc: (gcc).                  The GNU Compiler Collection.
  * g++: (gcc).                  The GNU C++ compiler.
! * gcov: (gcc) Gcov.            'gcov'--a test coverage program.
! * gcov-tool: (gcc) Gcov-tool.  'gcov-tool'--an offline gcda profile processing program.
! * gcov-dump: (gcc) Gcov-dump.  'gcov-dump'--an offline gcda and gcno profile dump tool.
  END-INFO-DIR-ENTRY
+ 
   This file documents the use of the GNU compilers.
  
   Copyright (C) 1988-2015 Free Software Foundation, Inc.
*************** Free Documentation License".
*** 46,55 ****
  
   (b) The FSF's Back-Cover Text is:
  
!  You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
! 
  
  
  File: gcc.info,  Node: Top,  Next: G++ and GCC,  Up: (DIR)
--- 46,54 ----
  
   (b) The FSF's Back-Cover Text is:
  
!  You have freedom to copy and modify this GNU Manual, like GNU software.
! Copies published by the Free Software Foundation raise funds for GNU
! development.
  
  
  File: gcc.info,  Node: Top,  Next: G++ and GCC,  Up: (DIR)
*************** Introduction
*** 59,65 ****
  
  This manual documents how to use the GNU compilers, as well as their
  features and incompatibilities, and how to report bugs.  It corresponds
! to the compilers (GCC) version 5.4.0.  The internals of the GNU
  compilers, including how to port them to new targets and some
  information about how to write front ends for new languages, are
  documented in a separate manual.  *Note Introduction: (gccint)Top.
--- 58,64 ----
  
  This manual documents how to use the GNU compilers, as well as their
  features and incompatibilities, and how to report bugs.  It corresponds
! to the compilers (GCC) version 5.5.0.  The internals of the GNU
  compilers, including how to port them to new targets and some
  information about how to write front ends for new languages, are
  documented in a separate manual.  *Note Introduction: (gccint)Top.
*************** documented in a separate manual.  *Note
*** 68,82 ****
  
  * G++ and GCC::     You can compile C or C++ programs.
  * Standards::       Language standards supported by GCC.
! * Invoking GCC::    Command options supported by `gcc'.
  * C Implementation:: How GCC implements the ISO C specification.
  * C++ Implementation:: How GCC implements the ISO C++ specification.
  * C Extensions::    GNU extensions to the C language family.
  * C++ Extensions::  GNU extensions to the C++ language.
  * Objective-C::     GNU Objective-C runtime features.
  * Compatibility::   Binary Compatibility
! * Gcov::            `gcov'---a test coverage program.
! * Gcov-tool::       `gcov-tool'---an offline gcda profile processing program.
  * Trouble::         If you have trouble using GCC.
  * Bugs::            How, why and where to report bugs.
  * Service::         How To Get Help with GCC
--- 67,82 ----
  
  * G++ and GCC::     You can compile C or C++ programs.
  * Standards::       Language standards supported by GCC.
! * Invoking GCC::    Command options supported by 'gcc'.
  * C Implementation:: How GCC implements the ISO C specification.
  * C++ Implementation:: How GCC implements the ISO C++ specification.
  * C Extensions::    GNU extensions to the C language family.
  * C++ Extensions::  GNU extensions to the C++ language.
  * Objective-C::     GNU Objective-C runtime features.
  * Compatibility::   Binary Compatibility
! * Gcov::            'gcov'--a test coverage program.
! * Gcov-tool::       'gcov-tool'--an offline gcda profile processing program.
! * Gcov-dump::       'gcov-dump'--an offline gcda and gcno profile dump tool.
  * Trouble::         If you have trouble using GCC.
  * Bugs::            How, why and where to report bugs.
  * Service::         How To Get Help with GCC
*************** documented in a separate manual.  *Note
*** 94,100 ****
  * Keyword Index::   Index of concepts and symbol names.
  
  
! File: gcc.info,  Node: G++ and GCC,  Next: Standards,  Prev: Top,  Up: Top
  
  1 Programming Languages Supported by GCC
  ****************************************
--- 94,100 ----
  * Keyword Index::   Index of concepts and symbol names.
  
  
! File: gcc.info,  Node: G++ and GCC,  Next: Standards,  Up: Top
  
  1 Programming Languages Supported by GCC
  ****************************************
*************** published in 1990.  This standard was ra
*** 157,168 ****
  (ISO/IEC 9899:1990) later in 1990.  There were no technical differences
  between these publications, although the sections of the ANSI standard
  were renumbered and became clauses in the ISO standard.  This standard,
! in both its forms, is commonly known as "C89", or occasionally as
! "C90", from the dates of ratification.  The ANSI standard, but not the
! ISO standard, also came with a Rationale document.  To select this
! standard in GCC, use one of the options `-ansi', `-std=c90' or
! `-std=iso9899:1990'; to obtain all the diagnostics required by the
! standard, you should also specify `-pedantic' (or `-pedantic-errors' if
  you want them to be errors rather than warnings).  *Note Options
  Controlling C Dialect: C Dialect Options.
  
--- 157,168 ----
  (ISO/IEC 9899:1990) later in 1990.  There were no technical differences
  between these publications, although the sections of the ANSI standard
  were renumbered and became clauses in the ISO standard.  This standard,
! in both its forms, is commonly known as "C89", or occasionally as "C90",
! from the dates of ratification.  The ANSI standard, but not the ISO
! standard, also came with a Rationale document.  To select this standard
! in GCC, use one of the options '-ansi', '-std=c90' or
! '-std=iso9899:1990'; to obtain all the diagnostics required by the
! standard, you should also specify '-pedantic' (or '-pedantic-errors' if
  you want them to be errors rather than warnings).  *Note Options
  Controlling C Dialect: C Dialect Options.
  
*************** Corrigenda published in 1994 and 1996.
*** 171,189 ****
  uncorrected version.
  
   An amendment to the 1990 standard was published in 1995.  This
! amendment added digraphs and `__STDC_VERSION__' to the language, but
  otherwise concerned the library.  This amendment is commonly known as
  "AMD1"; the amended standard is sometimes known as "C94" or "C95".  To
! select this standard in GCC, use the option `-std=iso9899:199409'
! (with, as for other standard versions, `-pedantic' to receive all
! required diagnostics).
  
   A new edition of the ISO C standard was published in 1999 as ISO/IEC
  9899:1999, and is commonly known as "C99".  GCC has substantially
  complete support for this standard version; see
! `http://gcc.gnu.org/c99status.html' for details.  To select this
! standard, use `-std=c99' or `-std=iso9899:1999'.  (While in
! development, drafts of this standard version were referred to as "C9X".)
  
   Errors in the 1999 ISO C standard were corrected in three Technical
  Corrigenda published in 2001, 2004 and 2007.  GCC does not support the
--- 171,189 ----
  uncorrected version.
  
   An amendment to the 1990 standard was published in 1995.  This
! amendment added digraphs and '__STDC_VERSION__' to the language, but
  otherwise concerned the library.  This amendment is commonly known as
  "AMD1"; the amended standard is sometimes known as "C94" or "C95".  To
! select this standard in GCC, use the option '-std=iso9899:199409' (with,
! as for other standard versions, '-pedantic' to receive all required
! diagnostics).
  
   A new edition of the ISO C standard was published in 1999 as ISO/IEC
  9899:1999, and is commonly known as "C99".  GCC has substantially
  complete support for this standard version; see
! <http://gcc.gnu.org/c99status.html> for details.  To select this
! standard, use '-std=c99' or '-std=iso9899:1999'.  (While in development,
! drafts of this standard version were referred to as "C9X".)
  
   Errors in the 1999 ISO C standard were corrected in three Technical
  Corrigenda published in 2001, 2004 and 2007.  GCC does not support the
*************** uncorrected version.
*** 191,229 ****
  
   A fourth version of the C standard, known as "C11", was published in
  2011 as ISO/IEC 9899:2011.  GCC has substantially complete support for
! this standard, enabled with `-std=c11' or `-std=iso9899:2011'.  (While
  in development, drafts of this standard version were referred to as
  "C1X".)
  
!  By default, GCC provides some extensions to the C language that on
! rare occasions conflict with the C standard.  *Note Extensions to the C
! Language Family: C Extensions.  Use of the `-std' options listed above
  will disable these extensions where they conflict with the C standard
  version selected.  You may also select an extended version of the C
! language explicitly with `-std=gnu90' (for C90 with GNU extensions),
! `-std=gnu99' (for C99 with GNU extensions) or `-std=gnu11' (for C11
! with GNU extensions).  The default, if no C language dialect options
! are given, is `-std=gnu11'.  Some features that are part of the C99
! standard are accepted as extensions in C90 mode, and some features that
! are part of the C11 standard are accepted as extensions in C90 and C99
! modes.
  
   The ISO C standard defines (in clause 4) two classes of conforming
! implementation.  A "conforming hosted implementation" supports the
! whole standard including all the library facilities; a "conforming
! freestanding implementation" is only required to provide certain
! library facilities: those in `<float.h>', `<limits.h>', `<stdarg.h>',
! and `<stddef.h>'; since AMD1, also those in `<iso646.h>'; since C99,
! also those in `<stdbool.h>' and `<stdint.h>'; and since C11, also those
! in `<stdalign.h>' and `<stdnoreturn.h>'.  In addition, complex types,
! added in C99, are not required for freestanding implementations.  The
! standard also defines two environments for programs, a "freestanding
  environment", required of all implementations and which may not have
  library facilities beyond those required of freestanding
  implementations, where the handling of program startup and termination
  are implementation-defined, and a "hosted environment", which is not
  required, in which all the library facilities are provided and startup
! is through a function `int main (void)' or `int main (int, char *[])'.
  An OS kernel would be a freestanding environment; a program using the
  facilities of an operating system would normally be in a hosted
  implementation.
--- 191,228 ----
  
   A fourth version of the C standard, known as "C11", was published in
  2011 as ISO/IEC 9899:2011.  GCC has substantially complete support for
! this standard, enabled with '-std=c11' or '-std=iso9899:2011'.  (While
  in development, drafts of this standard version were referred to as
  "C1X".)
  
!  By default, GCC provides some extensions to the C language that on rare
! occasions conflict with the C standard.  *Note Extensions to the C
! Language Family: C Extensions.  Use of the '-std' options listed above
  will disable these extensions where they conflict with the C standard
  version selected.  You may also select an extended version of the C
! language explicitly with '-std=gnu90' (for C90 with GNU extensions),
! '-std=gnu99' (for C99 with GNU extensions) or '-std=gnu11' (for C11 with
! GNU extensions).  The default, if no C language dialect options are
! given, is '-std=gnu11'.  Some features that are part of the C99 standard
! are accepted as extensions in C90 mode, and some features that are part
! of the C11 standard are accepted as extensions in C90 and C99 modes.
  
   The ISO C standard defines (in clause 4) two classes of conforming
! implementation.  A "conforming hosted implementation" supports the whole
! standard including all the library facilities; a "conforming
! freestanding implementation" is only required to provide certain library
! facilities: those in '<float.h>', '<limits.h>', '<stdarg.h>', and
! '<stddef.h>'; since AMD1, also those in '<iso646.h>'; since C99, also
! those in '<stdbool.h>' and '<stdint.h>'; and since C11, also those in
! '<stdalign.h>' and '<stdnoreturn.h>'.  In addition, complex types, added
! in C99, are not required for freestanding implementations.  The standard
! also defines two environments for programs, a "freestanding
  environment", required of all implementations and which may not have
  library facilities beyond those required of freestanding
  implementations, where the handling of program startup and termination
  are implementation-defined, and a "hosted environment", which is not
  required, in which all the library facilities are provided and startup
! is through a function 'int main (void)' or 'int main (int, char *[])'.
  An OS kernel would be a freestanding environment; a program using the
  facilities of an operating system would normally be in a hosted
  implementation.
*************** implementation.
*** 231,241 ****
   GCC aims towards being usable as a conforming freestanding
  implementation, or as the compiler for a conforming hosted
  implementation.  By default, it will act as the compiler for a hosted
! implementation, defining `__STDC_HOSTED__' as `1' and presuming that
  when the names of ISO C functions are used, they have the semantics
  defined in the standard.  To make it act as a conforming freestanding
  implementation for a freestanding environment, use the option
! `-ffreestanding'; it will then define `__STDC_HOSTED__' to `0' and not
  make assumptions about the meanings of function names from the standard
  library, with exceptions noted below.  To build an OS kernel, you may
  well still need to make your own arrangements for linking and startup.
--- 230,240 ----
   GCC aims towards being usable as a conforming freestanding
  implementation, or as the compiler for a conforming hosted
  implementation.  By default, it will act as the compiler for a hosted
! implementation, defining '__STDC_HOSTED__' as '1' and presuming that
  when the names of ISO C functions are used, they have the semantics
  defined in the standard.  To make it act as a conforming freestanding
  implementation for a freestanding environment, use the option
! '-ffreestanding'; it will then define '__STDC_HOSTED__' to '0' and not
  make assumptions about the meanings of function names from the standard
  library, with exceptions noted below.  To build an OS kernel, you may
  well still need to make your own arrangements for linking and startup.
*************** well still need to make your own arrange
*** 244,262 ****
   GCC does not provide the library facilities required only of hosted
  implementations, nor yet all the facilities required by C99 of
  freestanding implementations on all platforms; to use the facilities of
! a hosted environment, you will need to find them elsewhere (for
! example, in the GNU C library).  *Note Standard Libraries: Standard
! Libraries.
  
   Most of the compiler support routines used by GCC are present in
! `libgcc', but there are a few exceptions.  GCC requires the
! freestanding environment provide `memcpy', `memmove', `memset' and
! `memcmp'.  Finally, if `__builtin_trap' is used, and the target does
! not implement the `trap' pattern, then GCC will emit a call to `abort'.
  
   For references to Technical Corrigenda, Rationale documents and
  information concerning the history of C that is available online, see
! `http://gcc.gnu.org/readings.html'
  
  2.2 C++ Language
  ================
--- 243,260 ----
   GCC does not provide the library facilities required only of hosted
  implementations, nor yet all the facilities required by C99 of
  freestanding implementations on all platforms; to use the facilities of
! a hosted environment, you will need to find them elsewhere (for example,
! in the GNU C library).  *Note Standard Libraries: Standard Libraries.
  
   Most of the compiler support routines used by GCC are present in
! 'libgcc', but there are a few exceptions.  GCC requires the freestanding
! environment provide 'memcpy', 'memmove', 'memset' and 'memcmp'.
! Finally, if '__builtin_trap' is used, and the target does not implement
! the 'trap' pattern, then GCC will emit a call to 'abort'.
  
   For references to Technical Corrigenda, Rationale documents and
  information concerning the history of C that is available online, see
! <http://gcc.gnu.org/readings.html>
  
  2.2 C++ Language
  ================
*************** experimental support for the second ISO
*** 266,367 ****
  
   The original ISO C++ standard was published as the ISO standard
  (ISO/IEC 14882:1998) and amended by a Technical Corrigenda published in
! 2003 (ISO/IEC 14882:2003). These standards are referred to as C++98 and
! C++03, respectively. GCC implements the majority of C++98 (`export' is
  a notable exception) and most of the changes in C++03.  To select this
! standard in GCC, use one of the options `-ansi', `-std=c++98', or
! `-std=c++03'; to obtain all the diagnostics required by the standard,
! you should also specify `-pedantic' (or `-pedantic-errors' if you want
  them to be errors rather than warnings).
  
!  A revised ISO C++ standard was published in 2011 as ISO/IEC
! 14882:2011, and is referred to as C++11; before its publication it was
! commonly referred to as C++0x.  C++11 contains several changes to the
! C++ language, most of which have been implemented in an experimental
! C++11 mode in GCC.  For information regarding the C++11 features
! available in the experimental C++11 mode, see
! `http://gcc.gnu.org/projects/cxx0x.html'. To select this standard in
! GCC, use the option `-std=c++11'; to obtain all the diagnostics
! required by the standard, you should also specify `-pedantic' (or
! `-pedantic-errors' if you want them to be errors rather than warnings).
  
   More information about the C++ standards is available on the ISO C++
! committee's web site at `http://www.open-std.org/jtc1/sc22/wg21/'.
  
   By default, GCC provides some extensions to the C++ language; *Note
! Options Controlling C++ Dialect: C++ Dialect Options.  Use of the
! `-std' option listed above will disable these extensions.  You may also
! select an extended version of the C++ language explicitly with
! `-std=gnu++98' (for C++98 with GNU extensions) or `-std=gnu++11' (for
! C++11 with GNU extensions).  The default, if no C++ language dialect
! options are given, is `-std=gnu++98'.
  
  2.3 Objective-C and Objective-C++ Languages
  ===========================================
  
! GCC supports "traditional" Objective-C (also known as "Objective-C
! 1.0") and contains support for the Objective-C exception and
! synchronization syntax.  It has also support for a number of
! "Objective-C 2.0" language extensions, including properties, fast
! enumeration (only for Objective-C), method attributes and the @optional
! and @required keywords in protocols.  GCC supports Objective-C++ and
! features available in Objective-C are also available in Objective-C++.
  
   GCC by default uses the GNU Objective-C runtime library, which is part
! of GCC and is not the same as the Apple/NeXT Objective-C runtime
! library used on Apple systems.  There are a number of differences
! documented in this manual.  The options `-fgnu-runtime' and
! `-fnext-runtime' allow you to switch between producing output that
! works with the GNU Objective-C runtime library and output that works
! with the Apple/NeXT Objective-C runtime library.
  
   There is no formal written standard for Objective-C or Objective-C++.
  The authoritative manual on traditional Objective-C (1.0) is
! "Object-Oriented Programming and the Objective-C Language", available
! at a number of web sites:
!    * `http://www.gnustep.org/resources/documentation/ObjectivCBook.pdf'
       is the original NeXTstep document;
! 
!    * `http://objc.toodarkpark.net' is the same document in another
       format;
! 
!    *
!      `http://developer.apple.com/mac/library/documentation/Cocoa/Conceptual/ObjectiveC/'
       has an updated version but make sure you search for "Object
       Oriented Programming and the Objective-C Programming Language 1.0",
       not documentation on the newer "Objective-C 2.0" language
  
   The Objective-C exception and synchronization syntax (that is, the
  keywords @try, @throw, @catch, @finally and @synchronized) is supported
! by GCC and is enabled with the option `-fobjc-exceptions'.  The syntax
  is briefly documented in this manual and in the Objective-C 2.0 manuals
  from Apple.
  
   The Objective-C 2.0 language extensions and features are automatically
  enabled; they include properties (via the @property, @synthesize and
  @dynamic keywords), fast enumeration (not available in Objective-C++),
! attributes for methods (such as deprecated, noreturn, sentinel,
! format), the unused attribute for method arguments, the @package
! keyword for instance variables and the @optional and @required keywords
! in protocols.  You can disable all these Objective-C 2.0 language
! extensions with the option `-fobjc-std=objc1', which causes the
! compiler to recognize the same Objective-C language syntax recognized
! by GCC 4.0, and to produce an error if one of the new features is used.
  
   GCC has currently no support for non-fragile instance variables.
  
   The authoritative manual on Objective-C 2.0 is available from Apple:
!    *
!      `http://developer.apple.com/mac/library/documentation/Cocoa/Conceptual/ObjectiveC/'
  
   For more information concerning the history of Objective-C that is
! available online, see `http://gcc.gnu.org/readings.html'
  
  2.4 Go Language
  ===============
  
  As of the GCC 4.7.1 release, GCC supports the Go 1 language standard,
! described at `http://golang.org/doc/go1.html'.
  
  2.5 References for Other Languages
  ==================================
--- 264,363 ----
  
   The original ISO C++ standard was published as the ISO standard
  (ISO/IEC 14882:1998) and amended by a Technical Corrigenda published in
! 2003 (ISO/IEC 14882:2003).  These standards are referred to as C++98 and
! C++03, respectively.  GCC implements the majority of C++98 ('export' is
  a notable exception) and most of the changes in C++03.  To select this
! standard in GCC, use one of the options '-ansi', '-std=c++98', or
! '-std=c++03'; to obtain all the diagnostics required by the standard,
! you should also specify '-pedantic' (or '-pedantic-errors' if you want
  them to be errors rather than warnings).
  
!  A revised ISO C++ standard was published in 2011 as ISO/IEC 14882:2011,
! and is referred to as C++11; before its publication it was commonly
! referred to as C++0x.  C++11 contains several changes to the C++
! language, most of which have been implemented in an experimental C++11
! mode in GCC.  For information regarding the C++11 features available in
! the experimental C++11 mode, see
! <http://gcc.gnu.org/projects/cxx0x.html>.  To select this standard in
! GCC, use the option '-std=c++11'; to obtain all the diagnostics required
! by the standard, you should also specify '-pedantic' (or
! '-pedantic-errors' if you want them to be errors rather than warnings).
  
   More information about the C++ standards is available on the ISO C++
! committee's web site at <http://www.open-std.org/jtc1/sc22/wg21/>.
  
   By default, GCC provides some extensions to the C++ language; *Note
! Options Controlling C++ Dialect: C++ Dialect Options.  Use of the '-std'
! option listed above will disable these extensions.  You may also select
! an extended version of the C++ language explicitly with '-std=gnu++98'
! (for C++98 with GNU extensions) or '-std=gnu++11' (for C++11 with GNU
! extensions).  The default, if no C++ language dialect options are given,
! is '-std=gnu++98'.
  
  2.3 Objective-C and Objective-C++ Languages
  ===========================================
  
! GCC supports "traditional" Objective-C (also known as "Objective-C 1.0")
! and contains support for the Objective-C exception and synchronization
! syntax.  It has also support for a number of "Objective-C 2.0" language
! extensions, including properties, fast enumeration (only for
! Objective-C), method attributes and the @optional and @required keywords
! in protocols.  GCC supports Objective-C++ and features available in
! Objective-C are also available in Objective-C++.
  
   GCC by default uses the GNU Objective-C runtime library, which is part
! of GCC and is not the same as the Apple/NeXT Objective-C runtime library
! used on Apple systems.  There are a number of differences documented in
! this manual.  The options '-fgnu-runtime' and '-fnext-runtime' allow you
! to switch between producing output that works with the GNU Objective-C
! runtime library and output that works with the Apple/NeXT Objective-C
! runtime library.
  
   There is no formal written standard for Objective-C or Objective-C++.
  The authoritative manual on traditional Objective-C (1.0) is
! "Object-Oriented Programming and the Objective-C Language", available at
! a number of web sites:
!    * <http://www.gnustep.org/resources/documentation/ObjectivCBook.pdf>
       is the original NeXTstep document;
!    * <http://objc.toodarkpark.net> is the same document in another
       format;
!    * 
!      <http://developer.apple.com/mac/library/documentation/Cocoa/Conceptual/ObjectiveC/>
       has an updated version but make sure you search for "Object
       Oriented Programming and the Objective-C Programming Language 1.0",
       not documentation on the newer "Objective-C 2.0" language
  
   The Objective-C exception and synchronization syntax (that is, the
  keywords @try, @throw, @catch, @finally and @synchronized) is supported
! by GCC and is enabled with the option '-fobjc-exceptions'.  The syntax
  is briefly documented in this manual and in the Objective-C 2.0 manuals
  from Apple.
  
   The Objective-C 2.0 language extensions and features are automatically
  enabled; they include properties (via the @property, @synthesize and
  @dynamic keywords), fast enumeration (not available in Objective-C++),
! attributes for methods (such as deprecated, noreturn, sentinel, format),
! the unused attribute for method arguments, the @package keyword for
! instance variables and the @optional and @required keywords in
! protocols.  You can disable all these Objective-C 2.0 language
! extensions with the option '-fobjc-std=objc1', which causes the compiler
! to recognize the same Objective-C language syntax recognized by GCC 4.0,
! and to produce an error if one of the new features is used.
  
   GCC has currently no support for non-fragile instance variables.
  
   The authoritative manual on Objective-C 2.0 is available from Apple:
!    * 
!      <http://developer.apple.com/mac/library/documentation/Cocoa/Conceptual/ObjectiveC/>
  
   For more information concerning the history of Objective-C that is
! available online, see <http://gcc.gnu.org/readings.html>
  
  2.4 Go Language
  ===============
  
  As of the GCC 4.7.1 release, GCC supports the Go 1 language standard,
! described at <http://golang.org/doc/go1.html>.
  
  2.5 References for Other Languages
  ==================================
*************** conformance and compatibility of the Ada
*** 373,379 ****
  supported by GNU Fortran.
  
   *Note Compatibility with the Java Platform: (gcj)Compatibility, for
! details of compatibility between `gcj' and the Java Platform.
  
  
  File: gcc.info,  Node: Invoking GCC,  Next: C Implementation,  Prev: Standards,  Up: Top
--- 369,375 ----
  supported by GNU Fortran.
  
   *Note Compatibility with the Java Platform: (gcj)Compatibility, for
! details of compatibility between 'gcj' and the Java Platform.
  
  
  File: gcc.info,  Node: Invoking GCC,  Next: C Implementation,  Prev: Standards,  Up: Top
*************** File: gcc.info,  Node: Invoking GCC,  Ne
*** 383,391 ****
  
  When you invoke GCC, it normally does preprocessing, compilation,
  assembly and linking.  The "overall options" allow you to stop this
! process at an intermediate stage.  For example, the `-c' option says
! not to run the linker.  Then the output consists of object files output
! by the assembler.
  
   Other options are passed on to one stage of processing.  Some options
  control the preprocessor and others the compiler itself.  Yet other
--- 379,387 ----
  
  When you invoke GCC, it normally does preprocessing, compilation,
  assembly and linking.  The "overall options" allow you to stop this
! process at an intermediate stage.  For example, the '-c' option says not
! to run the linker.  Then the output consists of object files output by
! the assembler.
  
   Other options are passed on to one stage of processing.  Some options
  control the preprocessor and others the compiler itself.  Yet other
*************** that option with all supported languages
*** 401,420 ****
   *Note Compiling C++ Programs: Invoking G++, for a summary of special
  options for compiling C++ programs.
  
!  The `gcc' program accepts options and file names as operands.  Many
  options have multi-letter names; therefore multiple single-letter
! options may _not_ be grouped: `-dv' is very different from `-d -v'.
  
   You can mix options and other arguments.  For the most part, the order
  you use doesn't matter.  Order does matter when you use several options
! of the same kind; for example, if you specify `-L' more than once, the
! directories are searched in the order specified.  Also, the placement
! of the `-l' option is significant.
  
!  Many options have long names starting with `-f' or with `-W'--for
! example, `-fmove-loop-invariants', `-Wformat' and so on.  Most of these
! have both positive and negative forms; the negative form of `-ffoo' is
! `-fno-foo'.  This manual documents only one of these two forms,
  whichever one is not the default.
  
   *Note Option Index::, for an index to GCC's options.
--- 397,416 ----
   *Note Compiling C++ Programs: Invoking G++, for a summary of special
  options for compiling C++ programs.
  
!  The 'gcc' program accepts options and file names as operands.  Many
  options have multi-letter names; therefore multiple single-letter
! options may _not_ be grouped: '-dv' is very different from '-d -v'.
  
   You can mix options and other arguments.  For the most part, the order
  you use doesn't matter.  Order does matter when you use several options
! of the same kind; for example, if you specify '-L' more than once, the
! directories are searched in the order specified.  Also, the placement of
! the '-l' option is significant.
  
!  Many options have long names starting with '-f' or with '-W'--for
! example, '-fmove-loop-invariants', '-Wformat' and so on.  Most of these
! have both positive and negative forms; the negative form of '-ffoo' is
! '-fno-foo'.  This manual documents only one of these two forms,
  whichever one is not the default.
  
   *Note Option Index::, for an index to GCC's options.
*************** _Warning Options_
*** 550,556 ****
            -Wno-attributes -Wno-builtin-macro-redefined
            -Wc90-c99-compat -Wc99-c11-compat
            -Wc++-compat -Wc++11-compat -Wc++14-compat -Wcast-align  -Wcast-qual
!           -Wchar-subscripts -Wclobbered  -Wcomment -Wconditionally-supported
            -Wconversion -Wcoverage-mismatch -Wdate-time -Wdelete-incomplete -Wno-cpp
            -Wno-deprecated -Wno-deprecated-declarations -Wno-designated-init
            -Wdisabled-optimization
--- 546,552 ----
            -Wno-attributes -Wno-builtin-macro-redefined
            -Wc90-c99-compat -Wc99-c11-compat
            -Wc++-compat -Wc++11-compat -Wc++14-compat -Wcast-align  -Wcast-qual
!           -Wchar-subscripts -Wchkp -Wclobbered  -Wcomment -Wconditionally-supported
            -Wconversion -Wcoverage-mismatch -Wdate-time -Wdelete-incomplete -Wno-cpp
            -Wno-deprecated -Wno-deprecated-declarations -Wno-designated-init
            -Wdisabled-optimization
*************** _Machine Dependent Options_
*** 877,882 ****
--- 873,879 ----
            -mmcu=MCU -maccumulate-args -mbranch-cost=COST
            -mcall-prologues -mint8 -mn_flash=SIZE -mno-interrupts
            -mrelax -mrmw -mstrict-X -mtiny-stack -nodevicelib -Waddr-space-convert
+           -Wmisspelled-isr
  
       _Blackfin Options_
            -mcpu=CPU[-SIREVISION]
*************** _Machine Dependent Options_
*** 1224,1230 ****
            -mpointers-to-nested-functions -mno-pointers-to-nested-functions
            -msave-toc-indirect -mno-save-toc-indirect
            -mpower8-fusion -mno-mpower8-fusion -mpower8-vector -mno-power8-vector
!           -mcrypto -mno-crypto -mdirect-move -mno-direct-move
            -mquad-memory -mno-quad-memory
            -mquad-memory-atomic -mno-quad-memory-atomic
            -mcompat-align-parm -mno-compat-align-parm
--- 1221,1227 ----
            -mpointers-to-nested-functions -mno-pointers-to-nested-functions
            -msave-toc-indirect -mno-save-toc-indirect
            -mpower8-fusion -mno-mpower8-fusion -mpower8-vector -mno-power8-vector
!           -mcrypto -mno-crypto -mhtm -mno-htm -mdirect-move -mno-direct-move
            -mquad-memory -mno-quad-memory
            -mquad-memory-atomic -mno-quad-memory-atomic
            -mcompat-align-parm -mno-compat-align-parm
*************** _Code Generation Options_
*** 1437,1443 ****
            -fvisibility=[default|internal|hidden|protected]
            -fstrict-volatile-bitfields -fsync-libcalls
  
- 
  
  File: gcc.info,  Node: Overall Options,  Next: Invoking G++,  Prev: Option Summary,  Up: Invoking GCC
  
--- 1434,1439 ----
*************** File: gcc.info,  Node: Overall Options,
*** 1447,1576 ****
  Compilation can involve up to four stages: preprocessing, compilation
  proper, assembly and linking, always in that order.  GCC is capable of
  preprocessing and compiling several files either into several assembler
! input files, or into one assembler input file; then each assembler
! input file produces an object file, and linking combines all the object
! files (those newly compiled, and those specified as input) into an
! executable file.
  
   For any given input file, the file name suffix determines what kind of
  compilation is done:
  
! `FILE.c'
       C source code that must be preprocessed.
  
! `FILE.i'
       C source code that should not be preprocessed.
  
! `FILE.ii'
       C++ source code that should not be preprocessed.
  
! `FILE.m'
       Objective-C source code.  Note that you must link with the
!      `libobjc' library to make an Objective-C program work.
  
! `FILE.mi'
       Objective-C source code that should not be preprocessed.
  
! `FILE.mm'
! `FILE.M'
       Objective-C++ source code.  Note that you must link with the
!      `libobjc' library to make an Objective-C++ program work.  Note
!      that `.M' refers to a literal capital M.
  
! `FILE.mii'
       Objective-C++ source code that should not be preprocessed.
  
! `FILE.h'
       C, C++, Objective-C or Objective-C++ header file to be turned into
       a precompiled header (default), or C, C++ header file to be turned
!      into an Ada spec (via the `-fdump-ada-spec' switch).
  
! `FILE.cc'
! `FILE.cp'
! `FILE.cxx'
! `FILE.cpp'
! `FILE.CPP'
! `FILE.c++'
! `FILE.C'
!      C++ source code that must be preprocessed.  Note that in `.cxx',
!      the last two letters must both be literally `x'.  Likewise, `.C'
       refers to a literal capital C.
  
! `FILE.mm'
! `FILE.M'
       Objective-C++ source code that must be preprocessed.
  
! `FILE.mii'
       Objective-C++ source code that should not be preprocessed.
  
! `FILE.hh'
! `FILE.H'
! `FILE.hp'
! `FILE.hxx'
! `FILE.hpp'
! `FILE.HPP'
! `FILE.h++'
! `FILE.tcc'
       C++ header file to be turned into a precompiled header or Ada spec.
  
! `FILE.f'
! `FILE.for'
! `FILE.ftn'
       Fixed form Fortran source code that should not be preprocessed.
  
! `FILE.F'
! `FILE.FOR'
! `FILE.fpp'
! `FILE.FPP'
! `FILE.FTN'
       Fixed form Fortran source code that must be preprocessed (with the
       traditional preprocessor).
  
! `FILE.f90'
! `FILE.f95'
! `FILE.f03'
! `FILE.f08'
       Free form Fortran source code that should not be preprocessed.
  
! `FILE.F90'
! `FILE.F95'
! `FILE.F03'
! `FILE.F08'
       Free form Fortran source code that must be preprocessed (with the
       traditional preprocessor).
  
! `FILE.go'
       Go source code.
  
! `FILE.ads'
       Ada source code file that contains a library unit declaration (a
       declaration of a package, subprogram, or generic, or a generic
       instantiation), or a library unit renaming declaration (a package,
       generic, or subprogram renaming declaration).  Such files are also
       called "specs".
  
! `FILE.adb'
       Ada source code file containing a library unit body (a subprogram
       or package body).  Such files are also called "bodies".
  
! `FILE.s'
       Assembler code.
  
! `FILE.S'
! `FILE.sx'
       Assembler code that must be preprocessed.
  
! `OTHER'
!      An object file to be fed straight into linking.  Any file name
!      with no recognized suffix is treated this way.
  
!  You can specify the input language explicitly with the `-x' option:
  
! `-x LANGUAGE'
       Specify explicitly the LANGUAGE for the following input files
       (rather than letting the compiler choose a default based on the
       file name suffix).  This option applies to all following input
!      files until the next `-x' option.  Possible values for LANGUAGE
       are:
            c  c-header  cpp-output
            c++  c++-header  c++-cpp-output
--- 1443,1572 ----
  Compilation can involve up to four stages: preprocessing, compilation
  proper, assembly and linking, always in that order.  GCC is capable of
  preprocessing and compiling several files either into several assembler
! input files, or into one assembler input file; then each assembler input
! file produces an object file, and linking combines all the object files
! (those newly compiled, and those specified as input) into an executable
! file.
  
   For any given input file, the file name suffix determines what kind of
  compilation is done:
  
! 'FILE.c'
       C source code that must be preprocessed.
  
! 'FILE.i'
       C source code that should not be preprocessed.
  
! 'FILE.ii'
       C++ source code that should not be preprocessed.
  
! 'FILE.m'
       Objective-C source code.  Note that you must link with the
!      'libobjc' library to make an Objective-C program work.
  
! 'FILE.mi'
       Objective-C source code that should not be preprocessed.
  
! 'FILE.mm'
! 'FILE.M'
       Objective-C++ source code.  Note that you must link with the
!      'libobjc' library to make an Objective-C++ program work.  Note that
!      '.M' refers to a literal capital M.
  
! 'FILE.mii'
       Objective-C++ source code that should not be preprocessed.
  
! 'FILE.h'
       C, C++, Objective-C or Objective-C++ header file to be turned into
       a precompiled header (default), or C, C++ header file to be turned
!      into an Ada spec (via the '-fdump-ada-spec' switch).
  
! 'FILE.cc'
! 'FILE.cp'
! 'FILE.cxx'
! 'FILE.cpp'
! 'FILE.CPP'
! 'FILE.c++'
! 'FILE.C'
!      C++ source code that must be preprocessed.  Note that in '.cxx',
!      the last two letters must both be literally 'x'.  Likewise, '.C'
       refers to a literal capital C.
  
! 'FILE.mm'
! 'FILE.M'
       Objective-C++ source code that must be preprocessed.
  
! 'FILE.mii'
       Objective-C++ source code that should not be preprocessed.
  
! 'FILE.hh'
! 'FILE.H'
! 'FILE.hp'
! 'FILE.hxx'
! 'FILE.hpp'
! 'FILE.HPP'
! 'FILE.h++'
! 'FILE.tcc'
       C++ header file to be turned into a precompiled header or Ada spec.
  
! 'FILE.f'
! 'FILE.for'
! 'FILE.ftn'
       Fixed form Fortran source code that should not be preprocessed.
  
! 'FILE.F'
! 'FILE.FOR'
! 'FILE.fpp'
! 'FILE.FPP'
! 'FILE.FTN'
       Fixed form Fortran source code that must be preprocessed (with the
       traditional preprocessor).
  
! 'FILE.f90'
! 'FILE.f95'
! 'FILE.f03'
! 'FILE.f08'
       Free form Fortran source code that should not be preprocessed.
  
! 'FILE.F90'
! 'FILE.F95'
! 'FILE.F03'
! 'FILE.F08'
       Free form Fortran source code that must be preprocessed (with the
       traditional preprocessor).
  
! 'FILE.go'
       Go source code.
  
! 'FILE.ads'
       Ada source code file that contains a library unit declaration (a
       declaration of a package, subprogram, or generic, or a generic
       instantiation), or a library unit renaming declaration (a package,
       generic, or subprogram renaming declaration).  Such files are also
       called "specs".
  
! 'FILE.adb'
       Ada source code file containing a library unit body (a subprogram
       or package body).  Such files are also called "bodies".
  
! 'FILE.s'
       Assembler code.
  
! 'FILE.S'
! 'FILE.sx'
       Assembler code that must be preprocessed.
  
! 'OTHER'
!      An object file to be fed straight into linking.  Any file name with
!      no recognized suffix is treated this way.
  
!  You can specify the input language explicitly with the '-x' option:
  
! '-x LANGUAGE'
       Specify explicitly the LANGUAGE for the following input files
       (rather than letting the compiler choose a default based on the
       file name suffix).  This option applies to all following input
!      files until the next '-x' option.  Possible values for LANGUAGE
       are:
            c  c-header  cpp-output
            c++  c++-header  c++-cpp-output
*************** compilation is done:
*** 1582,1720 ****
            go
            java
  
! `-x none'
       Turn off any specification of a language, so that subsequent files
       are handled according to their file name suffixes (as they are if
!      `-x' has not been used at all).
  
! `-pass-exit-codes'
!      Normally the `gcc' program exits with the code of 1 if any phase
!      of the compiler returns a non-success return code.  If you specify
!      `-pass-exit-codes', the `gcc' program instead returns with the
       numerically highest error produced by any phase returning an error
       indication.  The C, C++, and Fortran front ends return 4 if an
       internal compiler error is encountered.
  
!  If you only want some of the stages of compilation, you can use `-x'
! (or filename suffixes) to tell `gcc' where to start, and one of the
! options `-c', `-S', or `-E' to say where `gcc' is to stop.  Note that
! some combinations (for example, `-x cpp-output -E') instruct `gcc' to
! do nothing at all.
  
! `-c'
       Compile or assemble the source files, but do not link.  The linking
       stage simply is not done.  The ultimate output is in the form of an
       object file for each source file.
  
       By default, the object file name for a source file is made by
!      replacing the suffix `.c', `.i', `.s', etc., with `.o'.
  
       Unrecognized input files, not requiring compilation or assembly,
       are ignored.
  
! `-S'
       Stop after the stage of compilation proper; do not assemble.  The
       output is in the form of an assembler code file for each
       non-assembler input file specified.
  
       By default, the assembler file name for a source file is made by
!      replacing the suffix `.c', `.i', etc., with `.s'.
  
       Input files that don't require compilation are ignored.
  
! `-E'
!      Stop after the preprocessing stage; do not run the compiler
!      proper.  The output is in the form of preprocessed source code,
!      which is sent to the standard output.
  
       Input files that don't require preprocessing are ignored.
  
! `-o FILE'
!      Place output in file FILE.  This applies to whatever sort of
!      output is being produced, whether it be an executable file, an
!      object file, an assembler file or preprocessed C code.
  
!      If `-o' is not specified, the default is to put an executable file
!      in `a.out', the object file for `SOURCE.SUFFIX' in `SOURCE.o', its
!      assembler file in `SOURCE.s', a precompiled header file in
!      `SOURCE.SUFFIX.gch', and all preprocessed C source on standard
       output.
  
! `-v'
       Print (on standard error output) the commands executed to run the
       stages of compilation.  Also print the version number of the
       compiler driver program and of the preprocessor and the compiler
       proper.
  
! `-###'
!      Like `-v' except the commands are not executed and arguments are
!      quoted unless they contain only alphanumeric characters or `./-_'.
       This is useful for shell scripts to capture the driver-generated
       command lines.
  
! `-pipe'
       Use pipes rather than temporary files for communication between the
       various stages of compilation.  This fails to work on some systems
       where the assembler is unable to read from a pipe; but the GNU
       assembler has no trouble.
  
! `--help'
       Print (on the standard output) a description of the command-line
!      options understood by `gcc'.  If the `-v' option is also specified
!      then `--help' is also passed on to the various processes invoked
!      by `gcc', so that they can display the command-line options they
!      accept.  If the `-Wextra' option has also been specified (prior to
!      the `--help' option), then command-line options that have no
       documentation associated with them are also displayed.
  
! `--target-help'
       Print (on the standard output) a description of target-specific
       command-line options for each tool.  For some targets extra
       target-specific information may also be printed.
  
! `--help={CLASS|[^]QUALIFIER}[,...]'
       Print (on the standard output) a description of the command-line
       options understood by the compiler that fit into all specified
       classes and qualifiers.  These are the supported classes:
  
!     `optimizers'
            Display all of the optimization options supported by the
            compiler.
  
!     `warnings'
            Display all of the options controlling warning messages
            produced by the compiler.
  
!     `target'
!           Display target-specific options.  Unlike the `--target-help'
            option however, target-specific options of the linker and
            assembler are not displayed.  This is because those tools do
!           not currently support the extended `--help=' syntax.
  
!     `params'
!           Display the values recognized by the `--param' option.
  
!     LANGUAGE
            Display the options supported for LANGUAGE, where LANGUAGE is
            the name of one of the languages supported in this version of
            GCC.
  
!     `common'
            Display the options that are common to all languages.
  
       These are the supported qualifiers:
  
!     `undocumented'
            Display only those options that are undocumented.
  
!     `joined'
            Display options taking an argument that appears after an equal
            sign in the same continuous piece of text, such as:
!           `--help=target'.
  
!     `separate'
            Display options taking an argument that appears as a separate
!           word following the original option, such as: `-o output-file'.
  
       Thus for example to display all the undocumented target-specific
       switches supported by the compiler, use:
--- 1578,1716 ----
            go
            java
  
! '-x none'
       Turn off any specification of a language, so that subsequent files
       are handled according to their file name suffixes (as they are if
!      '-x' has not been used at all).
  
! '-pass-exit-codes'
!      Normally the 'gcc' program exits with the code of 1 if any phase of
!      the compiler returns a non-success return code.  If you specify
!      '-pass-exit-codes', the 'gcc' program instead returns with the
       numerically highest error produced by any phase returning an error
       indication.  The C, C++, and Fortran front ends return 4 if an
       internal compiler error is encountered.
  
!  If you only want some of the stages of compilation, you can use '-x'
! (or filename suffixes) to tell 'gcc' where to start, and one of the
! options '-c', '-S', or '-E' to say where 'gcc' is to stop.  Note that
! some combinations (for example, '-x cpp-output -E') instruct 'gcc' to do
! nothing at all.
  
! '-c'
       Compile or assemble the source files, but do not link.  The linking
       stage simply is not done.  The ultimate output is in the form of an
       object file for each source file.
  
       By default, the object file name for a source file is made by
!      replacing the suffix '.c', '.i', '.s', etc., with '.o'.
  
       Unrecognized input files, not requiring compilation or assembly,
       are ignored.
  
! '-S'
       Stop after the stage of compilation proper; do not assemble.  The
       output is in the form of an assembler code file for each
       non-assembler input file specified.
  
       By default, the assembler file name for a source file is made by
!      replacing the suffix '.c', '.i', etc., with '.s'.
  
       Input files that don't require compilation are ignored.
  
! '-E'
!      Stop after the preprocessing stage; do not run the compiler proper.
!      The output is in the form of preprocessed source code, which is
!      sent to the standard output.
  
       Input files that don't require preprocessing are ignored.
  
! '-o FILE'
!      Place output in file FILE.  This applies to whatever sort of output
!      is being produced, whether it be an executable file, an object
!      file, an assembler file or preprocessed C code.
  
!      If '-o' is not specified, the default is to put an executable file
!      in 'a.out', the object file for 'SOURCE.SUFFIX' in 'SOURCE.o', its
!      assembler file in 'SOURCE.s', a precompiled header file in
!      'SOURCE.SUFFIX.gch', and all preprocessed C source on standard
       output.
  
! '-v'
       Print (on standard error output) the commands executed to run the
       stages of compilation.  Also print the version number of the
       compiler driver program and of the preprocessor and the compiler
       proper.
  
! '-###'
!      Like '-v' except the commands are not executed and arguments are
!      quoted unless they contain only alphanumeric characters or './-_'.
       This is useful for shell scripts to capture the driver-generated
       command lines.
  
! '-pipe'
       Use pipes rather than temporary files for communication between the
       various stages of compilation.  This fails to work on some systems
       where the assembler is unable to read from a pipe; but the GNU
       assembler has no trouble.
  
! '--help'
       Print (on the standard output) a description of the command-line
!      options understood by 'gcc'.  If the '-v' option is also specified
!      then '--help' is also passed on to the various processes invoked by
!      'gcc', so that they can display the command-line options they
!      accept.  If the '-Wextra' option has also been specified (prior to
!      the '--help' option), then command-line options that have no
       documentation associated with them are also displayed.
  
! '--target-help'
       Print (on the standard output) a description of target-specific
       command-line options for each tool.  For some targets extra
       target-specific information may also be printed.
  
! '--help={CLASS|[^]QUALIFIER}[,...]'
       Print (on the standard output) a description of the command-line
       options understood by the compiler that fit into all specified
       classes and qualifiers.  These are the supported classes:
  
!      'optimizers'
            Display all of the optimization options supported by the
            compiler.
  
!      'warnings'
            Display all of the options controlling warning messages
            produced by the compiler.
  
!      'target'
!           Display target-specific options.  Unlike the '--target-help'
            option however, target-specific options of the linker and
            assembler are not displayed.  This is because those tools do
!           not currently support the extended '--help=' syntax.
  
!      'params'
!           Display the values recognized by the '--param' option.
  
!      LANGUAGE
            Display the options supported for LANGUAGE, where LANGUAGE is
            the name of one of the languages supported in this version of
            GCC.
  
!      'common'
            Display the options that are common to all languages.
  
       These are the supported qualifiers:
  
!      'undocumented'
            Display only those options that are undocumented.
  
!      'joined'
            Display options taking an argument that appears after an equal
            sign in the same continuous piece of text, such as:
!           '--help=target'.
  
!      'separate'
            Display options taking an argument that appears as a separate
!           word following the original option, such as: '-o output-file'.
  
       Thus for example to display all the undocumented target-specific
       switches supported by the compiler, use:
*************** do nothing at all.
*** 1722,1734 ****
            --help=target,undocumented
  
       The sense of a qualifier can be inverted by prefixing it with the
!      `^' character, so for example to display all binary warning
!      options (i.e., ones that are either on or off and that do not take
!      an argument) that have a description, use:
  
            --help=warnings,^joined,^undocumented
  
!      The argument to `--help=' should not consist solely of inverted
       qualifiers.
  
       Combining several classes is possible, although this usually
--- 1718,1730 ----
            --help=target,undocumented
  
       The sense of a qualifier can be inverted by prefixing it with the
!      '^' character, so for example to display all binary warning options
!      (i.e., ones that are either on or off and that do not take an
!      argument) that have a description, use:
  
            --help=warnings,^joined,^undocumented
  
!      The argument to '--help=' should not consist solely of inverted
       qualifiers.
  
       Combining several classes is possible, although this usually
*************** do nothing at all.
*** 1739,1756 ****
  
            --help=target,optimizers
  
!      The `--help=' option can be repeated on the command line.  Each
       successive use displays its requested class of options, skipping
       those that have already been displayed.
  
!      If the `-Q' option appears on the command line before the
!      `--help=' option, then the descriptive text displayed by `--help='
!      is changed.  Instead of describing the displayed options, an
       indication is given as to whether the option is enabled, disabled
       or set to a specific value (assuming that the compiler knows this
!      at the point where the `--help=' option is used).
  
!      Here is a truncated example from the ARM port of `gcc':
  
              % gcc -Q -mabi=2 --help=target -c
              The following options are target specific:
--- 1735,1752 ----
  
            --help=target,optimizers
  
!      The '--help=' option can be repeated on the command line.  Each
       successive use displays its requested class of options, skipping
       those that have already been displayed.
  
!      If the '-Q' option appears on the command line before the '--help='
!      option, then the descriptive text displayed by '--help=' is
!      changed.  Instead of describing the displayed options, an
       indication is given as to whether the option is enabled, disabled
       or set to a specific value (assuming that the compiler knows this
!      at the point where the '--help=' option is used).
  
!      Here is a truncated example from the ARM port of 'gcc':
  
              % gcc -Q -mabi=2 --help=target -c
              The following options are target specific:
*************** do nothing at all.
*** 1760,1834 ****
  
       The output is sensitive to the effects of previous command-line
       options, so for example it is possible to find out which
!      optimizations are enabled at `-O2' by using:
  
            -Q -O2 --help=optimizers
  
       Alternatively you can discover which binary optimizations are
!      enabled by `-O3' by using:
  
            gcc -c -Q -O3 --help=optimizers > /tmp/O3-opts
            gcc -c -Q -O2 --help=optimizers > /tmp/O2-opts
            diff /tmp/O2-opts /tmp/O3-opts | grep enabled
  
! `-no-canonical-prefixes'
!      Do not expand any symbolic links, resolve references to `/../' or
!      `/./', or make the path absolute when generating a relative prefix.
  
! `--version'
       Display the version number and copyrights of the invoked GCC.
  
! `-wrapper'
       Invoke all subcommands under a wrapper program.  The name of the
       wrapper program and its parameters are passed as a comma separated
       list.
  
            gcc -c t.c -wrapper gdb,--args
  
!      This invokes all subprograms of `gcc' under `gdb --args', thus the
!      invocation of `cc1' is `gdb --args cc1 ...'.
  
! `-fplugin=NAME.so'
!      Load the plugin code in file NAME.so, assumed to be a shared
!      object to be dlopen'd by the compiler.  The base name of the
!      shared object file is used to identify the plugin for the purposes
!      of argument parsing (See `-fplugin-arg-NAME-KEY=VALUE' below).
!      Each plugin should define the callback functions specified in the
!      Plugins API.
  
! `-fplugin-arg-NAME-KEY=VALUE'
       Define an argument called KEY with a value of VALUE for the plugin
       called NAME.
  
! `-fdump-ada-spec[-slim]'
       For C and C++ source and include files, generate corresponding Ada
!      specs.  *Note Generating Ada Bindings for C and C++ headers:
!      (gnat_ugn)Generating Ada Bindings for C and C++ headers, which
!      provides detailed documentation on this feature.
  
! `-fada-spec-parent=UNIT'
!      In conjunction with `-fdump-ada-spec[-slim]' above, generate Ada
       specs as child units of parent UNIT.
  
! `-fdump-go-spec=FILE'
       For input files in any language, generate corresponding Go
!      declarations in FILE.  This generates Go `const', `type', `var',
!      and `func' declarations which may be a useful way to start writing
       a Go interface to code written in some other language.
  
! `@FILE'
!      Read command-line options from FILE.  The options read are
!      inserted in place of the original @FILE option.  If FILE does not
!      exist, or cannot be read, then the option will be treated
!      literally, and not removed.
  
       Options in FILE are separated by whitespace.  A whitespace
       character may be included in an option by surrounding the entire
!      option in either single or double quotes.  Any character
!      (including a backslash) may be included by prefixing the character
!      to be included with a backslash.  The FILE may itself contain
!      additional @FILE options; any such options will be processed
!      recursively.
  
  
  File: gcc.info,  Node: Invoking G++,  Next: C Dialect Options,  Prev: Overall Options,  Up: Invoking GCC
--- 1756,1827 ----
  
       The output is sensitive to the effects of previous command-line
       options, so for example it is possible to find out which
!      optimizations are enabled at '-O2' by using:
  
            -Q -O2 --help=optimizers
  
       Alternatively you can discover which binary optimizations are
!      enabled by '-O3' by using:
  
            gcc -c -Q -O3 --help=optimizers > /tmp/O3-opts
            gcc -c -Q -O2 --help=optimizers > /tmp/O2-opts
            diff /tmp/O2-opts /tmp/O3-opts | grep enabled
  
! '-no-canonical-prefixes'
!      Do not expand any symbolic links, resolve references to '/../' or
!      '/./', or make the path absolute when generating a relative prefix.
  
! '--version'
       Display the version number and copyrights of the invoked GCC.
  
! '-wrapper'
       Invoke all subcommands under a wrapper program.  The name of the
       wrapper program and its parameters are passed as a comma separated
       list.
  
            gcc -c t.c -wrapper gdb,--args
  
!      This invokes all subprograms of 'gcc' under 'gdb --args', thus the
!      invocation of 'cc1' is 'gdb --args cc1 ...'.
  
! '-fplugin=NAME.so'
!      Load the plugin code in file NAME.so, assumed to be a shared object
!      to be dlopen'd by the compiler.  The base name of the shared object
!      file is used to identify the plugin for the purposes of argument
!      parsing (See '-fplugin-arg-NAME-KEY=VALUE' below).  Each plugin
!      should define the callback functions specified in the Plugins API.
  
! '-fplugin-arg-NAME-KEY=VALUE'
       Define an argument called KEY with a value of VALUE for the plugin
       called NAME.
  
! '-fdump-ada-spec[-slim]'
       For C and C++ source and include files, generate corresponding Ada
!      specs.  *Note (gnat_ugn)Generating Ada Bindings for C and C++
!      headers::, which provides detailed documentation on this feature.
  
! '-fada-spec-parent=UNIT'
!      In conjunction with '-fdump-ada-spec[-slim]' above, generate Ada
       specs as child units of parent UNIT.
  
! '-fdump-go-spec=FILE'
       For input files in any language, generate corresponding Go
!      declarations in FILE.  This generates Go 'const', 'type', 'var',
!      and 'func' declarations which may be a useful way to start writing
       a Go interface to code written in some other language.
  
! '@FILE'
!      Read command-line options from FILE.  The options read are inserted
!      in place of the original @FILE option.  If FILE does not exist, or
!      cannot be read, then the option will be treated literally, and not
!      removed.
  
       Options in FILE are separated by whitespace.  A whitespace
       character may be included in an option by surrounding the entire
!      option in either single or double quotes.  Any character (including
!      a backslash) may be included by prefixing the character to be
!      included with a backslash.  The FILE may itself contain additional
!      @FILE options; any such options will be processed recursively.
  
  
  File: gcc.info,  Node: Invoking G++,  Next: C Dialect Options,  Prev: Overall Options,  Up: Invoking GCC
*************** File: gcc.info,  Node: Invoking G++,  Ne
*** 1836,1856 ****
  3.3 Compiling C++ Programs
  ==========================
  
! C++ source files conventionally use one of the suffixes `.C', `.cc',
! `.cpp', `.CPP', `.c++', `.cp', or `.cxx'; C++ header files often use
! `.hh', `.hpp', `.H', or (for shared template code) `.tcc'; and
! preprocessed C++ files use the suffix `.ii'.  GCC recognizes files with
  these names and compiles them as C++ programs even if you call the
! compiler the same way as for compiling C programs (usually with the
! name `gcc').
  
!  However, the use of `gcc' does not add the C++ library.  `g++' is a
  program that calls GCC and automatically specifies linking against the
! C++ library.  It treats `.c', `.h' and `.i' files as C++ source files
! instead of C source files unless `-x' is used.  This program is also
! useful when precompiling a C header file with a `.h' extension for use
! in C++ compilations.  On many systems, `g++' is also installed with the
! name `c++'.
  
   When you compile C++ programs, you may specify many of the same
  command-line options that you use for compiling programs in any
--- 1829,1849 ----
  3.3 Compiling C++ Programs
  ==========================
  
! C++ source files conventionally use one of the suffixes '.C', '.cc',
! '.cpp', '.CPP', '.c++', '.cp', or '.cxx'; C++ header files often use
! '.hh', '.hpp', '.H', or (for shared template code) '.tcc'; and
! preprocessed C++ files use the suffix '.ii'.  GCC recognizes files with
  these names and compiles them as C++ programs even if you call the
! compiler the same way as for compiling C programs (usually with the name
! 'gcc').
  
!  However, the use of 'gcc' does not add the C++ library.  'g++' is a
  program that calls GCC and automatically specifies linking against the
! C++ library.  It treats '.c', '.h' and '.i' files as C++ source files
! instead of C source files unless '-x' is used.  This program is also
! useful when precompiling a C header file with a '.h' extension for use
! in C++ compilations.  On many systems, 'g++' is also installed with the
! name 'c++'.
  
   When you compile C++ programs, you may specify many of the same
  command-line options that you use for compiling programs in any
*************** The following options control the dialec
*** 1871,2165 ****
  from C, such as C++, Objective-C and Objective-C++) that the compiler
  accepts:
  
! `-ansi'
!      In C mode, this is equivalent to `-std=c90'. In C++ mode, it is
!      equivalent to `-std=c++98'.
  
       This turns off certain features of GCC that are incompatible with
!      ISO C90 (when compiling C code), or of standard C++ (when
!      compiling C++ code), such as the `asm' and `typeof' keywords, and
!      predefined macros such as `unix' and `vax' that identify the type
!      of system you are using.  It also enables the undesirable and
!      rarely used ISO trigraph feature.  For the C compiler, it disables
!      recognition of C++ style `//' comments as well as the `inline'
!      keyword.
  
!      The alternate keywords `__asm__', `__extension__', `__inline__'
!      and `__typeof__' continue to work despite `-ansi'.  You would not
!      want to use them in an ISO C program, of course, but it is useful
!      to put them in header files that might be included in compilations
!      done with `-ansi'.  Alternate predefined macros such as `__unix__'
!      and `__vax__' are also available, with or without `-ansi'.
  
!      The `-ansi' option does not cause non-ISO programs to be rejected
!      gratuitously.  For that, `-Wpedantic' is required in addition to
!      `-ansi'.  *Note Warning Options::.
  
!      The macro `__STRICT_ANSI__' is predefined when the `-ansi' option
       is used.  Some header files may notice this macro and refrain from
!      declaring certain functions or defining certain macros that the
!      ISO standard doesn't call for; this is to avoid interfering with
!      any programs that might use these names for other things.
  
       Functions that are normally built in but do not have semantics
!      defined by ISO C (such as `alloca' and `ffs') are not built-in
!      functions when `-ansi' is used.  *Note Other built-in functions
       provided by GCC: Other Builtins, for details of the functions
       affected.
  
! `-std='
!      Determine the language standard. *Note Language Standards
       Supported by GCC: Standards, for details of these standard
!      versions.  This option is currently only supported when compiling
!      C or C++.
  
!      The compiler can accept several base standards, such as `c90' or
!      `c++98', and GNU dialects of those standards, such as `gnu90' or
!      `gnu++98'.  When a base standard is specified, the compiler
!      accepts all programs following that standard plus those using GNU
!      extensions that do not contradict it.  For example, `-std=c90'
       turns off certain features of GCC that are incompatible with ISO
!      C90, such as the `asm' and `typeof' keywords, but not other GNU
       extensions that do not have a meaning in ISO C90, such as omitting
!      the middle term of a `?:' expression. On the other hand, when a
       GNU dialect of a standard is specified, all features supported by
       the compiler are enabled, even when those features change the
       meaning of the base standard.  As a result, some strict-conforming
       programs may be rejected.  The particular standard is used by
!      `-Wpedantic' to identify which features are GNU extensions given
!      that version of the standard. For example `-std=gnu90 -Wpedantic'
!      warns about C++ style `//' comments, while `-std=gnu99 -Wpedantic'
       does not.
  
       A value for this option must be provided; possible values are
  
!     `c90'
!     `c89'
!     `iso9899:1990'
            Support all ISO C90 programs (certain GNU extensions that
!           conflict with ISO C90 are disabled). Same as `-ansi' for C
            code.
  
!     `iso9899:199409'
            ISO C90 as modified in amendment 1.
  
!     `c99'
!     `c9x'
!     `iso9899:1999'
!     `iso9899:199x'
!           ISO C99.  This standard is substantially completely
!           supported, modulo bugs and floating-point issues (mainly but
!           not entirely relating to optional C99 features from Annexes F
!           and G).  See `http://gcc.gnu.org/c99status.html' for more
!           information.  The names `c9x' and `iso9899:199x' are
!           deprecated.
  
!     `c11'
!     `c1x'
!     `iso9899:2011'
            ISO C11, the 2011 revision of the ISO C standard.  This
            standard is substantially completely supported, modulo bugs,
            floating-point issues (mainly but not entirely relating to
            optional C11 features from Annexes F and G) and the optional
            Annexes K (Bounds-checking interfaces) and L (Analyzability).
!           The name `c1x' is deprecated.
  
!     `gnu90'
!     `gnu89'
            GNU dialect of ISO C90 (including some C99 features).
  
!     `gnu99'
!     `gnu9x'
!           GNU dialect of ISO C99.  The name `gnu9x' is deprecated.
  
!     `gnu11'
!     `gnu1x'
            GNU dialect of ISO C11.  This is the default for C code.  The
!           name `gnu1x' is deprecated.
  
!     `c++98'
!     `c++03'
            The 1998 ISO C++ standard plus the 2003 technical corrigendum
!           and some additional defect reports. Same as `-ansi' for C++
            code.
  
!     `gnu++98'
!     `gnu++03'
!           GNU dialect of `-std=c++98'.  This is the default for C++
            code.
  
!     `c++11'
!     `c++0x'
!           The 2011 ISO C++ standard plus amendments.  The name `c++0x'
            is deprecated.
  
!     `gnu++11'
!     `gnu++0x'
!           GNU dialect of `-std=c++11'.  The name `gnu++0x' is
            deprecated.
  
!     `c++14'
!     `c++1y'
!           The 2014 ISO C++ standard plus amendments.  The name `c++1y'
            is deprecated.
  
!     `gnu++14'
!     `gnu++1y'
!           GNU dialect of `-std=c++14'.  The name `gnu++1y' is
            deprecated.
  
!     `c++1z'
!           The next revision of the ISO C++ standard, tentatively
!           planned for 2017.  Support is highly experimental, and will
!           almost certainly change in incompatible ways in future
!           releases.
  
!     `gnu++1z'
!           GNU dialect of `-std=c++1z'.  Support is highly experimental,
            and will almost certainly change in incompatible ways in
            future releases.
  
! `-fgnu89-inline'
!      The option `-fgnu89-inline' tells GCC to use the traditional GNU
!      semantics for `inline' functions when in C99 mode.  *Note An
!      Inline Function is As Fast As a Macro: Inline.  Using this option
!      is roughly equivalent to adding the `gnu_inline' function
!      attribute to all inline functions (*note Function Attributes::).
  
!      The option `-fno-gnu89-inline' explicitly tells GCC to use the C99
!      semantics for `inline' when in C99 or gnu99 mode (i.e., it
       specifies the default behavior).  This option is not supported in
!      `-std=c90' or `-std=gnu90' mode.
  
!      The preprocessor macros `__GNUC_GNU_INLINE__' and
!      `__GNUC_STDC_INLINE__' may be used to check which semantics are in
!      effect for `inline' functions.  *Note Common Predefined Macros:
!      (cpp)Common Predefined Macros.
  
! `-aux-info FILENAME'
       Output to the given filename prototyped declarations for all
       functions declared and/or defined in a translation unit, including
       those in header files.  This option is silently ignored in any
       language other than C.
  
       Besides declarations, the file indicates, in comments, the origin
!      of each declaration (source file and line), whether the
!      declaration was implicit, prototyped or unprototyped (`I', `N' for
!      new or `O' for old, respectively, in the first character after the
!      line number and the colon), and whether it came from a declaration
!      or a definition (`C' or `F', respectively, in the following
!      character).  In the case of function definitions, a K&R-style list
!      of arguments followed by their declarations is also provided,
!      inside comments, after the declaration.
  
! `-fallow-parameterless-variadic-functions'
       Accept variadic functions without named parameters.
  
       Although it is possible to define such a function, this is not very
       useful as it is not possible to read the arguments.  This is only
       supported for C as this construct is allowed by C++.
  
! `-fno-asm'
!      Do not recognize `asm', `inline' or `typeof' as a keyword, so that
       code can use these words as identifiers.  You can use the keywords
!      `__asm__', `__inline__' and `__typeof__' instead.  `-ansi' implies
!      `-fno-asm'.
  
!      In C++, this switch only affects the `typeof' keyword, since `asm'
!      and `inline' are standard keywords.  You may want to use the
!      `-fno-gnu-keywords' flag instead, which has the same effect.  In
!      C99 mode (`-std=c99' or `-std=gnu99'), this switch only affects
!      the `asm' and `typeof' keywords, since `inline' is a standard
!      keyword in ISO C99.
  
! `-fno-builtin'
! `-fno-builtin-FUNCTION'
       Don't recognize built-in functions that do not begin with
!      `__builtin_' as prefix.  *Note Other built-in functions provided
!      by GCC: Other Builtins, for details of the functions affected,
!      including those which are not built-in functions when `-ansi' or
!      `-std' options for strict ISO C conformance are used because they
       do not have an ISO standard meaning.
  
       GCC normally generates special code to handle certain built-in
!      functions more efficiently; for instance, calls to `alloca' may
       become single instructions which adjust the stack directly, and
!      calls to `memcpy' may become inline copy loops.  The resulting
!      code is often both smaller and faster, but since the function
!      calls no longer appear as such, you cannot set a breakpoint on
!      those calls, nor can you change the behavior of the functions by
!      linking with a different library.  In addition, when a function is
!      recognized as a built-in function, GCC may use information about
!      that function to warn about problems with calls to that function,
!      or to generate more efficient code, even if the resulting code
!      still contains calls to that function.  For example, warnings are
!      given with `-Wformat' for bad calls to `printf' when `printf' is
!      built in and `strlen' is known not to modify global memory.
  
!      With the `-fno-builtin-FUNCTION' option only the built-in function
!      FUNCTION is disabled.  FUNCTION must not begin with `__builtin_'.
!      If a function is named that is not built-in in this version of
!      GCC, this option is ignored.  There is no corresponding
!      `-fbuiltin-FUNCTION' option; if you wish to enable built-in
!      functions selectively when using `-fno-builtin' or
!      `-ffreestanding', you may define macros such as:
  
            #define abs(n)          __builtin_abs ((n))
            #define strcpy(d, s)    __builtin_strcpy ((d), (s))
  
! `-fhosted'
       Assert that compilation targets a hosted environment.  This implies
!      `-fbuiltin'.  A hosted environment is one in which the entire
!      standard library is available, and in which `main' has a return
!      type of `int'.  Examples are nearly everything except a kernel.
!      This is equivalent to `-fno-freestanding'.
  
- `-ffreestanding'
       Assert that compilation targets a freestanding environment.  This
!      implies `-fno-builtin'.  A freestanding environment is one in
!      which the standard library may not exist, and program startup may
!      not necessarily be at `main'.  The most obvious example is an OS
!      kernel.  This is equivalent to `-fno-hosted'.
  
       *Note Language Standards Supported by GCC: Standards, for details
       of freestanding and hosted environments.
  
! `-fopenacc'
!      Enable handling of OpenACC directives `#pragma acc' in C/C++ and
!      `!$acc' in Fortran.  When `-fopenacc' is specified, the compiler
       generates accelerated code according to the OpenACC Application
!      Programming Interface v2.0 `http://www.openacc.org/'.  This option
!      implies `-pthread', and thus is only supported on targets that
!      have support for `-pthread'.
  
       Note that this is an experimental feature, incomplete, and subject
!      to change in future versions of GCC.  See
!      `https://gcc.gnu.org/wiki/OpenACC' for more information.
  
! `-fopenmp'
!      Enable handling of OpenMP directives `#pragma omp' in C/C++ and
!      `!$omp' in Fortran.  When `-fopenmp' is specified, the compiler
!      generates parallel code according to the OpenMP Application
!      Program Interface v4.0 `http://www.openmp.org/'.  This option
!      implies `-pthread', and thus is only supported on targets that
!      have support for `-pthread'. `-fopenmp' implies `-fopenmp-simd'.
  
! `-fopenmp-simd'
!      Enable handling of OpenMP's SIMD directives with `#pragma omp' in
!      C/C++ and `!$omp' in Fortran. Other OpenMP directives are ignored.
  
! `-fcilkplus'
       Enable the usage of Cilk Plus language extension features for
!      C/C++.  When the option `-fcilkplus' is specified, enable the
!      usage of the Cilk Plus Language extension features for C/C++.  The
       present implementation follows ABI version 1.2.  This is an
       experimental feature that is only partially complete, and whose
       interface may change in future versions of GCC as the official
!      specification changes.  Currently, all features but `_Cilk_for'
       have been implemented.
  
! `-fgnu-tm'
!      When the option `-fgnu-tm' is specified, the compiler generates
       code for the Linux variant of Intel's current Transactional Memory
       ABI specification document (Revision 1.1, May 6 2009).  This is an
       experimental feature whose interface may change in future versions
--- 1864,2157 ----
  from C, such as C++, Objective-C and Objective-C++) that the compiler
  accepts:
  
! '-ansi'
!      In C mode, this is equivalent to '-std=c90'.  In C++ mode, it is
!      equivalent to '-std=c++98'.
  
       This turns off certain features of GCC that are incompatible with
!      ISO C90 (when compiling C code), or of standard C++ (when compiling
!      C++ code), such as the 'asm' and 'typeof' keywords, and predefined
!      macros such as 'unix' and 'vax' that identify the type of system
!      you are using.  It also enables the undesirable and rarely used ISO
!      trigraph feature.  For the C compiler, it disables recognition of
!      C++ style '//' comments as well as the 'inline' keyword.
  
!      The alternate keywords '__asm__', '__extension__', '__inline__' and
!      '__typeof__' continue to work despite '-ansi'.  You would not want
!      to use them in an ISO C program, of course, but it is useful to put
!      them in header files that might be included in compilations done
!      with '-ansi'.  Alternate predefined macros such as '__unix__' and
!      '__vax__' are also available, with or without '-ansi'.
  
!      The '-ansi' option does not cause non-ISO programs to be rejected
!      gratuitously.  For that, '-Wpedantic' is required in addition to
!      '-ansi'.  *Note Warning Options::.
  
!      The macro '__STRICT_ANSI__' is predefined when the '-ansi' option
       is used.  Some header files may notice this macro and refrain from
!      declaring certain functions or defining certain macros that the ISO
!      standard doesn't call for; this is to avoid interfering with any
!      programs that might use these names for other things.
  
       Functions that are normally built in but do not have semantics
!      defined by ISO C (such as 'alloca' and 'ffs') are not built-in
!      functions when '-ansi' is used.  *Note Other built-in functions
       provided by GCC: Other Builtins, for details of the functions
       affected.
  
! '-std='
!      Determine the language standard.  *Note Language Standards
       Supported by GCC: Standards, for details of these standard
!      versions.  This option is currently only supported when compiling C
!      or C++.
  
!      The compiler can accept several base standards, such as 'c90' or
!      'c++98', and GNU dialects of those standards, such as 'gnu90' or
!      'gnu++98'.  When a base standard is specified, the compiler accepts
!      all programs following that standard plus those using GNU
!      extensions that do not contradict it.  For example, '-std=c90'
       turns off certain features of GCC that are incompatible with ISO
!      C90, such as the 'asm' and 'typeof' keywords, but not other GNU
       extensions that do not have a meaning in ISO C90, such as omitting
!      the middle term of a '?:' expression.  On the other hand, when a
       GNU dialect of a standard is specified, all features supported by
       the compiler are enabled, even when those features change the
       meaning of the base standard.  As a result, some strict-conforming
       programs may be rejected.  The particular standard is used by
!      '-Wpedantic' to identify which features are GNU extensions given
!      that version of the standard.  For example '-std=gnu90 -Wpedantic'
!      warns about C++ style '//' comments, while '-std=gnu99 -Wpedantic'
       does not.
  
       A value for this option must be provided; possible values are
  
!      'c90'
!      'c89'
!      'iso9899:1990'
            Support all ISO C90 programs (certain GNU extensions that
!           conflict with ISO C90 are disabled).  Same as '-ansi' for C
            code.
  
!      'iso9899:199409'
            ISO C90 as modified in amendment 1.
  
!      'c99'
!      'c9x'
!      'iso9899:1999'
!      'iso9899:199x'
!           ISO C99.  This standard is substantially completely supported,
!           modulo bugs and floating-point issues (mainly but not entirely
!           relating to optional C99 features from Annexes F and G). See
!           <http://gcc.gnu.org/c99status.html> for more information.  The
!           names 'c9x' and 'iso9899:199x' are deprecated.
  
!      'c11'
!      'c1x'
!      'iso9899:2011'
            ISO C11, the 2011 revision of the ISO C standard.  This
            standard is substantially completely supported, modulo bugs,
            floating-point issues (mainly but not entirely relating to
            optional C11 features from Annexes F and G) and the optional
            Annexes K (Bounds-checking interfaces) and L (Analyzability).
!           The name 'c1x' is deprecated.
  
!      'gnu90'
!      'gnu89'
            GNU dialect of ISO C90 (including some C99 features).
  
!      'gnu99'
!      'gnu9x'
!           GNU dialect of ISO C99.  The name 'gnu9x' is deprecated.
  
!      'gnu11'
!      'gnu1x'
            GNU dialect of ISO C11.  This is the default for C code.  The
!           name 'gnu1x' is deprecated.
  
!      'c++98'
!      'c++03'
            The 1998 ISO C++ standard plus the 2003 technical corrigendum
!           and some additional defect reports.  Same as '-ansi' for C++
            code.
  
!      'gnu++98'
!      'gnu++03'
!           GNU dialect of '-std=c++98'.  This is the default for C++
            code.
  
!      'c++11'
!      'c++0x'
!           The 2011 ISO C++ standard plus amendments.  The name 'c++0x'
            is deprecated.
  
!      'gnu++11'
!      'gnu++0x'
!           GNU dialect of '-std=c++11'.  The name 'gnu++0x' is
            deprecated.
  
!      'c++14'
!      'c++1y'
!           The 2014 ISO C++ standard plus amendments.  The name 'c++1y'
            is deprecated.
  
!      'gnu++14'
!      'gnu++1y'
!           GNU dialect of '-std=c++14'.  The name 'gnu++1y' is
            deprecated.
  
!      'c++1z'
!           The next revision of the ISO C++ standard, tentatively planned
!           for 2017.  Support is highly experimental, and will almost
!           certainly change in incompatible ways in future releases.
  
!      'gnu++1z'
!           GNU dialect of '-std=c++1z'.  Support is highly experimental,
            and will almost certainly change in incompatible ways in
            future releases.
  
! '-fgnu89-inline'
!      The option '-fgnu89-inline' tells GCC to use the traditional GNU
!      semantics for 'inline' functions when in C99 mode.  *Note An Inline
!      Function is As Fast As a Macro: Inline.  Using this option is
!      roughly equivalent to adding the 'gnu_inline' function attribute to
!      all inline functions (*note Function Attributes::).
  
!      The option '-fno-gnu89-inline' explicitly tells GCC to use the C99
!      semantics for 'inline' when in C99 or gnu99 mode (i.e., it
       specifies the default behavior).  This option is not supported in
!      '-std=c90' or '-std=gnu90' mode.
  
!      The preprocessor macros '__GNUC_GNU_INLINE__' and
!      '__GNUC_STDC_INLINE__' may be used to check which semantics are in
!      effect for 'inline' functions.  *Note (cpp)Common Predefined
!      Macros::.
  
! '-aux-info FILENAME'
       Output to the given filename prototyped declarations for all
       functions declared and/or defined in a translation unit, including
       those in header files.  This option is silently ignored in any
       language other than C.
  
       Besides declarations, the file indicates, in comments, the origin
!      of each declaration (source file and line), whether the declaration
!      was implicit, prototyped or unprototyped ('I', 'N' for new or 'O'
!      for old, respectively, in the first character after the line number
!      and the colon), and whether it came from a declaration or a
!      definition ('C' or 'F', respectively, in the following character).
!      In the case of function definitions, a K&R-style list of arguments
!      followed by their declarations is also provided, inside comments,
!      after the declaration.
  
! '-fallow-parameterless-variadic-functions'
       Accept variadic functions without named parameters.
  
       Although it is possible to define such a function, this is not very
       useful as it is not possible to read the arguments.  This is only
       supported for C as this construct is allowed by C++.
  
! '-fno-asm'
!      Do not recognize 'asm', 'inline' or 'typeof' as a keyword, so that
       code can use these words as identifiers.  You can use the keywords
!      '__asm__', '__inline__' and '__typeof__' instead.  '-ansi' implies
!      '-fno-asm'.
  
!      In C++, this switch only affects the 'typeof' keyword, since 'asm'
!      and 'inline' are standard keywords.  You may want to use the
!      '-fno-gnu-keywords' flag instead, which has the same effect.  In
!      C99 mode ('-std=c99' or '-std=gnu99'), this switch only affects the
!      'asm' and 'typeof' keywords, since 'inline' is a standard keyword
!      in ISO C99.
  
! '-fno-builtin'
! '-fno-builtin-FUNCTION'
       Don't recognize built-in functions that do not begin with
!      '__builtin_' as prefix.  *Note Other built-in functions provided by
!      GCC: Other Builtins, for details of the functions affected,
!      including those which are not built-in functions when '-ansi' or
!      '-std' options for strict ISO C conformance are used because they
       do not have an ISO standard meaning.
  
       GCC normally generates special code to handle certain built-in
!      functions more efficiently; for instance, calls to 'alloca' may
       become single instructions which adjust the stack directly, and
!      calls to 'memcpy' may become inline copy loops.  The resulting code
!      is often both smaller and faster, but since the function calls no
!      longer appear as such, you cannot set a breakpoint on those calls,
!      nor can you change the behavior of the functions by linking with a
!      different library.  In addition, when a function is recognized as a
!      built-in function, GCC may use information about that function to
!      warn about problems with calls to that function, or to generate
!      more efficient code, even if the resulting code still contains
!      calls to that function.  For example, warnings are given with
!      '-Wformat' for bad calls to 'printf' when 'printf' is built in and
!      'strlen' is known not to modify global memory.
  
!      With the '-fno-builtin-FUNCTION' option only the built-in function
!      FUNCTION is disabled.  FUNCTION must not begin with '__builtin_'.
!      If a function is named that is not built-in in this version of GCC,
!      this option is ignored.  There is no corresponding
!      '-fbuiltin-FUNCTION' option; if you wish to enable built-in
!      functions selectively when using '-fno-builtin' or
!      '-ffreestanding', you may define macros such as:
  
            #define abs(n)          __builtin_abs ((n))
            #define strcpy(d, s)    __builtin_strcpy ((d), (s))
  
! '-fhosted'
! 
       Assert that compilation targets a hosted environment.  This implies
!      '-fbuiltin'.  A hosted environment is one in which the entire
!      standard library is available, and in which 'main' has a return
!      type of 'int'.  Examples are nearly everything except a kernel.
!      This is equivalent to '-fno-freestanding'.
! 
! '-ffreestanding'
  
       Assert that compilation targets a freestanding environment.  This
!      implies '-fno-builtin'.  A freestanding environment is one in which
!      the standard library may not exist, and program startup may not
!      necessarily be at 'main'.  The most obvious example is an OS
!      kernel.  This is equivalent to '-fno-hosted'.
  
       *Note Language Standards Supported by GCC: Standards, for details
       of freestanding and hosted environments.
  
! '-fopenacc'
!      Enable handling of OpenACC directives '#pragma acc' in C/C++ and
!      '!$acc' in Fortran.  When '-fopenacc' is specified, the compiler
       generates accelerated code according to the OpenACC Application
!      Programming Interface v2.0 <http://www.openacc.org/>.  This option
!      implies '-pthread', and thus is only supported on targets that have
!      support for '-pthread'.
  
       Note that this is an experimental feature, incomplete, and subject
!      to change in future versions of GCC. See
!      <https://gcc.gnu.org/wiki/OpenACC> for more information.
  
! '-fopenmp'
!      Enable handling of OpenMP directives '#pragma omp' in C/C++ and
!      '!$omp' in Fortran.  When '-fopenmp' is specified, the compiler
!      generates parallel code according to the OpenMP Application Program
!      Interface v4.0 <http://www.openmp.org/>.  This option implies
!      '-pthread', and thus is only supported on targets that have support
!      for '-pthread'.  '-fopenmp' implies '-fopenmp-simd'.
  
! '-fopenmp-simd'
!      Enable handling of OpenMP's SIMD directives with '#pragma omp' in
!      C/C++ and '!$omp' in Fortran.  Other OpenMP directives are ignored.
  
! '-fcilkplus'
       Enable the usage of Cilk Plus language extension features for
!      C/C++.  When the option '-fcilkplus' is specified, enable the usage
!      of the Cilk Plus Language extension features for C/C++.  The
       present implementation follows ABI version 1.2.  This is an
       experimental feature that is only partially complete, and whose
       interface may change in future versions of GCC as the official
!      specification changes.  Currently, all features but '_Cilk_for'
       have been implemented.
  
! '-fgnu-tm'
!      When the option '-fgnu-tm' is specified, the compiler generates
       code for the Linux variant of Intel's current Transactional Memory
       ABI specification document (Revision 1.1, May 6 2009).  This is an
       experimental feature whose interface may change in future versions
*************** accepts:
*** 2171,2179 ****
       libitm.
  
       Note that the transactional memory feature is not supported with
!      non-call exceptions (`-fnon-call-exceptions').
  
! `-fms-extensions'
       Accept some non-standard constructs used in Microsoft header files.
  
       In C++ code, this allows member names in structures to be similar
--- 2163,2171 ----
       libitm.
  
       Note that the transactional memory feature is not supported with
!      non-call exceptions ('-fnon-call-exceptions').
  
! '-fms-extensions'
       Accept some non-standard constructs used in Microsoft header files.
  
       In C++ code, this allows member names in structures to be similar
*************** accepts:
*** 2191,2260 ****
       Note that this option is off for all targets but x86 targets using
       ms-abi.
  
! `-fplan9-extensions'
       Accept some non-standard constructs used in Plan 9 code.
  
!      This enables `-fms-extensions', permits passing pointers to
       structures with anonymous fields to functions that expect pointers
       to elements of the type of the field, and permits referring to
       anonymous fields declared using a typedef.  *Note Unnamed
       struct/union fields within structs/unions: Unnamed Fields, for
       details.  This is only supported for C, not C++.
  
! `-trigraphs'
!      Support ISO C trigraphs.  The `-ansi' option (and `-std' options
!      for strict ISO C conformance) implies `-trigraphs'.
  
! `-traditional'
! `-traditional-cpp'
       Formerly, these options caused GCC to attempt to emulate a
!      pre-standard C compiler.  They are now only supported with the
!      `-E' switch.  The preprocessor continues to support a pre-standard
!      mode.  See the GNU CPP manual for details.
  
! `-fcond-mismatch'
       Allow conditional expressions with mismatched types in the second
       and third arguments.  The value of such an expression is void.
       This option is not supported for C++.
  
! `-flax-vector-conversions'
       Allow implicit conversions between vectors with differing numbers
       of elements and/or incompatible element types.  This option should
       not be used for new code.
  
! `-funsigned-char'
!      Let the type `char' be unsigned, like `unsigned char'.
  
!      Each kind of machine has a default for what `char' should be.  It
!      is either like `unsigned char' by default or like `signed char' by
       default.
  
!      Ideally, a portable program should always use `signed char' or
!      `unsigned char' when it depends on the signedness of an object.
!      But many programs have been written to use plain `char' and expect
       it to be signed, or expect it to be unsigned, depending on the
       machines they were written for.  This option, and its inverse, let
       you make such a program work with the opposite default.
  
!      The type `char' is always a distinct type from each of `signed
!      char' or `unsigned char', even though its behavior is always just
       like one of those two.
  
! `-fsigned-char'
!      Let the type `char' be signed, like `signed char'.
  
!      Note that this is equivalent to `-fno-unsigned-char', which is the
!      negative form of `-funsigned-char'.  Likewise, the option
!      `-fno-signed-char' is equivalent to `-funsigned-char'.
  
! `-fsigned-bitfields'
! `-funsigned-bitfields'
! `-fno-signed-bitfields'
! `-fno-unsigned-bitfields'
       These options control whether a bit-field is signed or unsigned,
!      when the declaration does not use either `signed' or `unsigned'.
!      By default, such a bit-field is signed, because this is
!      consistent: the basic integer types such as `int' are signed types.
  
  
  File: gcc.info,  Node: C++ Dialect Options,  Next: Objective-C and Objective-C++ Dialect Options,  Prev: C Dialect Options,  Up: Invoking GCC
--- 2183,2252 ----
       Note that this option is off for all targets but x86 targets using
       ms-abi.
  
! '-fplan9-extensions'
       Accept some non-standard constructs used in Plan 9 code.
  
!      This enables '-fms-extensions', permits passing pointers to
       structures with anonymous fields to functions that expect pointers
       to elements of the type of the field, and permits referring to
       anonymous fields declared using a typedef.  *Note Unnamed
       struct/union fields within structs/unions: Unnamed Fields, for
       details.  This is only supported for C, not C++.
  
! '-trigraphs'
!      Support ISO C trigraphs.  The '-ansi' option (and '-std' options
!      for strict ISO C conformance) implies '-trigraphs'.
  
! '-traditional'
! '-traditional-cpp'
       Formerly, these options caused GCC to attempt to emulate a
!      pre-standard C compiler.  They are now only supported with the '-E'
!      switch.  The preprocessor continues to support a pre-standard mode.
!      See the GNU CPP manual for details.
  
! '-fcond-mismatch'
       Allow conditional expressions with mismatched types in the second
       and third arguments.  The value of such an expression is void.
       This option is not supported for C++.
  
! '-flax-vector-conversions'
       Allow implicit conversions between vectors with differing numbers
       of elements and/or incompatible element types.  This option should
       not be used for new code.
  
! '-funsigned-char'
!      Let the type 'char' be unsigned, like 'unsigned char'.
  
!      Each kind of machine has a default for what 'char' should be.  It
!      is either like 'unsigned char' by default or like 'signed char' by
       default.
  
!      Ideally, a portable program should always use 'signed char' or
!      'unsigned char' when it depends on the signedness of an object.
!      But many programs have been written to use plain 'char' and expect
       it to be signed, or expect it to be unsigned, depending on the
       machines they were written for.  This option, and its inverse, let
       you make such a program work with the opposite default.
  
!      The type 'char' is always a distinct type from each of 'signed
!      char' or 'unsigned char', even though its behavior is always just
       like one of those two.
  
! '-fsigned-char'
!      Let the type 'char' be signed, like 'signed char'.
  
!      Note that this is equivalent to '-fno-unsigned-char', which is the
!      negative form of '-funsigned-char'.  Likewise, the option
!      '-fno-signed-char' is equivalent to '-funsigned-char'.
  
! '-fsigned-bitfields'
! '-funsigned-bitfields'
! '-fno-signed-bitfields'
! '-fno-unsigned-bitfields'
       These options control whether a bit-field is signed or unsigned,
!      when the declaration does not use either 'signed' or 'unsigned'.
!      By default, such a bit-field is signed, because this is consistent:
!      the basic integer types such as 'int' are signed types.
  
  
  File: gcc.info,  Node: C++ Dialect Options,  Next: Objective-C and Objective-C++ Dialect Options,  Prev: C Dialect Options,  Up: Invoking GCC
*************** File: gcc.info,  Node: C++ Dialect Optio
*** 2265,2281 ****
  This section describes the command-line options that are only meaningful
  for C++ programs.  You can also use most of the GNU compiler options
  regardless of what language your program is in.  For example, you might
! compile a file `firstClass.C' like this:
  
       g++ -g -frepo -O -c firstClass.C
  
! In this example, only `-frepo' is an option meant only for C++
! programs; you can use the other options with any language supported by
! GCC.
  
   Here is a list of options that are _only_ for compiling C++ programs:
  
! `-fabi-version=N'
       Use version N of the C++ ABI.  The default is version 0.
  
       Version 0 refers to the version conforming most closely to the C++
--- 2257,2272 ----
  This section describes the command-line options that are only meaningful
  for C++ programs.  You can also use most of the GNU compiler options
  regardless of what language your program is in.  For example, you might
! compile a file 'firstClass.C' like this:
  
       g++ -g -frepo -O -c firstClass.C
  
! In this example, only '-frepo' is an option meant only for C++ programs;
! you can use the other options with any language supported by GCC.
  
   Here is a list of options that are _only_ for compiling C++ programs:
  
! '-fabi-version=N'
       Use version N of the C++ ABI.  The default is version 0.
  
       Version 0 refers to the version conforming most closely to the C++
*************** GCC.
*** 2313,2356 ****
       function-cv-qualifiers.
  
       Version 9, which first appeared in G++ 5.2, corrects the alignment
!      of `nullptr_t'.
  
!      See also `-Wabi'.
  
! `-fabi-compat-version=N'
       On targets that support strong aliases, G++ works around mangling
       changes by creating an alias with the correct mangled name when
       defining a symbol with an incorrect mangled name.  This switch
       specifies which ABI version to use for the alias.
  
!      With `-fabi-version=0' (the default), this defaults to 2.  If
       another ABI version is explicitly selected, this defaults to 0.
  
!      The compatibility version is also set by `-Wabi=N'.
  
! `-fno-access-control'
       Turn off all access checking.  This switch is mainly useful for
       working around bugs in the access control code.
  
! `-fcheck-new'
!      Check that the pointer returned by `operator new' is non-null
       before attempting to modify the storage allocated.  This check is
       normally unnecessary because the C++ standard specifies that
!      `operator new' only returns `0' if it is declared `throw()', in
!      which case the compiler always checks the return value even
!      without this option.  In all other cases, when `operator new' has
!      a non-empty exception specification, memory exhaustion is
!      signalled by throwing `std::bad_alloc'.  See also `new (nothrow)'.
  
! `-fconstexpr-depth=N'
       Set the maximum nested evaluation depth for C++11 constexpr
       functions to N.  A limit is needed to detect endless recursion
       during constant expression evaluation.  The minimum specified by
       the standard is 512.
  
! `-fdeduce-init-list'
       Enable deduction of a template type parameter as
!      `std::initializer_list' from a brace-enclosed initializer list,
       i.e.
  
            template <class T> auto forward(T t) -> decltype (realfn (t))
--- 2304,2347 ----
       function-cv-qualifiers.
  
       Version 9, which first appeared in G++ 5.2, corrects the alignment
!      of 'nullptr_t'.
  
!      See also '-Wabi'.
  
! '-fabi-compat-version=N'
       On targets that support strong aliases, G++ works around mangling
       changes by creating an alias with the correct mangled name when
       defining a symbol with an incorrect mangled name.  This switch
       specifies which ABI version to use for the alias.
  
!      With '-fabi-version=0' (the default), this defaults to 2.  If
       another ABI version is explicitly selected, this defaults to 0.
  
!      The compatibility version is also set by '-Wabi=N'.
  
! '-fno-access-control'
       Turn off all access checking.  This switch is mainly useful for
       working around bugs in the access control code.
  
! '-fcheck-new'
!      Check that the pointer returned by 'operator new' is non-null
       before attempting to modify the storage allocated.  This check is
       normally unnecessary because the C++ standard specifies that
!      'operator new' only returns '0' if it is declared 'throw()', in
!      which case the compiler always checks the return value even without
!      this option.  In all other cases, when 'operator new' has a
!      non-empty exception specification, memory exhaustion is signalled
!      by throwing 'std::bad_alloc'.  See also 'new (nothrow)'.
  
! '-fconstexpr-depth=N'
       Set the maximum nested evaluation depth for C++11 constexpr
       functions to N.  A limit is needed to detect endless recursion
       during constant expression evaluation.  The minimum specified by
       the standard is 512.
  
! '-fdeduce-init-list'
       Enable deduction of a template type parameter as
!      'std::initializer_list' from a brace-enclosed initializer list,
       i.e.
  
            template <class T> auto forward(T t) -> decltype (realfn (t))
*************** GCC.
*** 2369,2428 ****
       option is deprecated, and may be removed in a future version of
       G++.
  
! `-ffriend-injection'
       Inject friend functions into the enclosing namespace, so that they
       are visible outside the scope of the class in which they are
!      declared.  Friend functions were documented to work this way in
!      the old Annotated C++ Reference Manual.  However, in ISO C++ a
!      friend function that is not declared in an enclosing scope can
!      only be found using argument dependent lookup.  GCC defaults to
!      the standard behavior.
  
       This option is for compatibility, and may be removed in a future
       release of G++.
  
! `-fno-elide-constructors'
       The C++ standard allows an implementation to omit creating a
       temporary that is only used to initialize another object of the
       same type.  Specifying this option disables that optimization, and
       forces G++ to call the copy constructor in all cases.
  
! `-fno-enforce-eh-specs'
       Don't generate code to check for violation of exception
!      specifications at run time.  This option violates the C++
!      standard, but may be useful for reducing code size in production
!      builds, much like defining `NDEBUG'.  This does not give user code
!      permission to throw exceptions in violation of the exception
!      specifications; the compiler still optimizes based on the
!      specifications, so throwing an unexpected exception results in
!      undefined behavior at run time.
  
! `-fextern-tls-init'
! `-fno-extern-tls-init'
!      The C++11 and OpenMP standards allow `thread_local' and
!      `threadprivate' variables to have dynamic (runtime)
!      initialization.  To support this, any use of such a variable goes
!      through a wrapper function that performs any necessary
!      initialization.  When the use and definition of the variable are
!      in the same translation unit, this overhead can be optimized away,
!      but when the use is in a different translation unit there is
!      significant overhead even if the variable doesn't actually need
!      dynamic initialization.  If the programmer can be sure that no use
!      of the variable in a non-defining TU needs to trigger dynamic
!      initialization (either because the variable is statically
!      initialized, or a use of the variable in the defining TU will be
!      executed before any uses in another TU), they can avoid this
!      overhead with the `-fno-extern-tls-init' option.
  
       On targets that support symbol aliases, the default is
!      `-fextern-tls-init'.  On targets that do not support symbol
!      aliases, the default is `-fno-extern-tls-init'.
  
! `-ffor-scope'
! `-fno-for-scope'
!      If `-ffor-scope' is specified, the scope of variables declared in
!      a for-init-statement is limited to the `for' loop itself, as
!      specified by the C++ standard.  If `-fno-for-scope' is specified,
       the scope of variables declared in a for-init-statement extends to
       the end of the enclosing scope, as was the case in old versions of
       G++, and other (traditional) implementations of C++.
--- 2360,2418 ----
       option is deprecated, and may be removed in a future version of
       G++.
  
! '-ffriend-injection'
       Inject friend functions into the enclosing namespace, so that they
       are visible outside the scope of the class in which they are
!      declared.  Friend functions were documented to work this way in the
!      old Annotated C++ Reference Manual.  However, in ISO C++ a friend
!      function that is not declared in an enclosing scope can only be
!      found using argument dependent lookup.  GCC defaults to the
!      standard behavior.
  
       This option is for compatibility, and may be removed in a future
       release of G++.
  
! '-fno-elide-constructors'
       The C++ standard allows an implementation to omit creating a
       temporary that is only used to initialize another object of the
       same type.  Specifying this option disables that optimization, and
       forces G++ to call the copy constructor in all cases.
  
! '-fno-enforce-eh-specs'
       Don't generate code to check for violation of exception
!      specifications at run time.  This option violates the C++ standard,
!      but may be useful for reducing code size in production builds, much
!      like defining 'NDEBUG'.  This does not give user code permission to
!      throw exceptions in violation of the exception specifications; the
!      compiler still optimizes based on the specifications, so throwing
!      an unexpected exception results in undefined behavior at run time.
  
! '-fextern-tls-init'
! '-fno-extern-tls-init'
!      The C++11 and OpenMP standards allow 'thread_local' and
!      'threadprivate' variables to have dynamic (runtime) initialization.
!      To support this, any use of such a variable goes through a wrapper
!      function that performs any necessary initialization.  When the use
!      and definition of the variable are in the same translation unit,
!      this overhead can be optimized away, but when the use is in a
!      different translation unit there is significant overhead even if
!      the variable doesn't actually need dynamic initialization.  If the
!      programmer can be sure that no use of the variable in a
!      non-defining TU needs to trigger dynamic initialization (either
!      because the variable is statically initialized, or a use of the
!      variable in the defining TU will be executed before any uses in
!      another TU), they can avoid this overhead with the
!      '-fno-extern-tls-init' option.
  
       On targets that support symbol aliases, the default is
!      '-fextern-tls-init'.  On targets that do not support symbol
!      aliases, the default is '-fno-extern-tls-init'.
  
! '-ffor-scope'
! '-fno-for-scope'
!      If '-ffor-scope' is specified, the scope of variables declared in a
!      for-init-statement is limited to the 'for' loop itself, as
!      specified by the C++ standard.  If '-fno-for-scope' is specified,
       the scope of variables declared in a for-init-statement extends to
       the end of the enclosing scope, as was the case in old versions of
       G++, and other (traditional) implementations of C++.
*************** GCC.
*** 2431,2585 ****
       but to allow and give a warning for old-style code that would
       otherwise be invalid, or have different behavior.
  
! `-fno-gnu-keywords'
!      Do not recognize `typeof' as a keyword, so that code can use this
!      word as an identifier.  You can use the keyword `__typeof__'
!      instead.  `-ansi' implies `-fno-gnu-keywords'.
  
! `-fno-implicit-templates'
       Never emit code for non-inline templates that are instantiated
       implicitly (i.e. by use); only emit code for explicit
       instantiations.  *Note Template Instantiation::, for more
       information.
  
! `-fno-implicit-inline-templates'
       Don't emit code for implicit instantiations of inline templates,
       either.  The default is to handle inlines differently so that
       compiles with and without optimization need the same set of
       explicit instantiations.
  
! `-fno-implement-inlines'
       To save space, do not emit out-of-line copies of inline functions
!      controlled by `#pragma implementation'.  This causes linker errors
       if these functions are not inlined everywhere they are called.
  
! `-fms-extensions'
       Disable Wpedantic warnings about constructs used in MFC, such as
       implicit int and getting a pointer to member function via
       non-standard syntax.
  
! `-fno-nonansi-builtins'
       Disable built-in declarations of functions that are not mandated by
!      ANSI/ISO C.  These include `ffs', `alloca', `_exit', `index',
!      `bzero', `conjf', and other related functions.
  
! `-fnothrow-opt'
!      Treat a `throw()' exception specification as if it were a
!      `noexcept' specification to reduce or eliminate the text size
       overhead relative to a function with no exception specification.
       If the function has local variables of types with non-trivial
       destructors, the exception specification actually makes the
       function smaller because the EH cleanups for those variables can be
       optimized away.  The semantic effect is that an exception thrown
!      out of a function with such an exception specification results in
!      a call to `terminate' rather than `unexpected'.
  
! `-fno-operator-names'
!      Do not treat the operator name keywords `and', `bitand', `bitor',
!      `compl', `not', `or' and `xor' as synonyms as keywords.
  
! `-fno-optional-diags'
!      Disable diagnostics that the standard says a compiler does not
!      need to issue.  Currently, the only such diagnostic issued by G++
!      is the one for a name having multiple meanings within a class.
  
! `-fpermissive'
       Downgrade some diagnostics about nonconformant code from errors to
!      warnings.  Thus, using `-fpermissive' allows some nonconforming
       code to compile.
  
! `-fno-pretty-templates'
       When an error message refers to a specialization of a function
       template, the compiler normally prints the signature of the
       template followed by the template arguments and any typedefs or
!      typenames in the signature (e.g. `void f(T) [with T = int]' rather
!      than `void f(int)') so that it's clear which template is involved.
       When an error message refers to a specialization of a class
       template, the compiler omits any template arguments that match the
       default template arguments for that template.  If either of these
       behaviors make it harder to understand the error message rather
!      than easier, you can use `-fno-pretty-templates' to disable them.
  
! `-frepo'
       Enable automatic template instantiation at link time.  This option
!      also implies `-fno-implicit-templates'.  *Note Template
       Instantiation::, for more information.
  
! `-fno-rtti'
       Disable generation of information about every class with virtual
       functions for use by the C++ run-time type identification features
!      (`dynamic_cast' and `typeid').  If you don't use those parts of
!      the language, you can save some space by using this flag.  Note
!      that exception handling uses the same information, but G++
!      generates it as needed. The `dynamic_cast' operator can still be
!      used for casts that do not require run-time type information, i.e.
!      casts to `void *' or to unambiguous base classes.
  
! `-fsized-deallocation'
       Enable the built-in global declarations
            void operator delete (void *, std::size_t) noexcept;
            void operator delete[] (void *, std::size_t) noexcept;
       as introduced in C++14.  This is useful for user-defined
       replacement deallocation functions that, for example, use the size
       of the object to make deallocation faster.  Enabled by default
!      under `-std=c++14' and above.  The flag `-Wsized-deallocation'
       warns about places that might want to add a definition.
  
! `-fstats'
       Emit statistics about front-end processing at the end of the
       compilation.  This information is generally only useful to the G++
       development team.
  
! `-fstrict-enums'
       Allow the compiler to optimize using the assumption that a value of
       enumerated type can only be one of the values of the enumeration
       (as defined in the C++ standard; basically, a value that can be
       represented in the minimum number of bits needed to represent all
       the enumerators).  This assumption may not be valid if the program
!      uses a cast to convert an arbitrary integer value to the
!      enumerated type.
  
! `-ftemplate-backtrace-limit=N'
       Set the maximum number of template instantiation notes for a single
       warning or error to N.  The default value is 10.
  
! `-ftemplate-depth=N'
       Set the maximum instantiation depth for template classes to N.  A
       limit on the template instantiation depth is needed to detect
       endless recursions during template class instantiation.  ANSI/ISO
       C++ conforming programs must not rely on a maximum depth greater
       than 17 (changed to 1024 in C++11).  The default value is 900, as
!      the compiler can run out of stack space before hitting 1024 in
!      some situations.
  
! `-fno-threadsafe-statics'
       Do not emit the extra code to use the routines specified in the C++
       ABI for thread-safe initialization of local statics.  You can use
       this option to reduce code size slightly in code that doesn't need
       to be thread-safe.
  
! `-fuse-cxa-atexit'
       Register destructors for objects with static storage duration with
!      the `__cxa_atexit' function rather than the `atexit' function.
       This option is required for fully standards-compliant handling of
       static destructors, but only works if your C library supports
!      `__cxa_atexit'.
  
! `-fno-use-cxa-get-exception-ptr'
!      Don't use the `__cxa_get_exception_ptr' runtime routine.  This
!      causes `std::uncaught_exception' to be incorrect, but is necessary
       if the runtime routine is not available.
  
! `-fvisibility-inlines-hidden'
       This switch declares that the user does not attempt to compare
       pointers to inline functions or methods where the addresses of the
       two functions are taken in different shared objects.
  
       The effect of this is that GCC may, effectively, mark inline
!      methods with `__attribute__ ((visibility ("hidden")))' so that
!      they do not appear in the export table of a DSO and do not require
!      a PLT indirection when used within the DSO.  Enabling this option
!      can have a dramatic effect on load and link times of a DSO as it
       massively reduces the size of the dynamic export table when the
       library makes heavy use of templates.
  
--- 2421,2575 ----
       but to allow and give a warning for old-style code that would
       otherwise be invalid, or have different behavior.
  
! '-fno-gnu-keywords'
!      Do not recognize 'typeof' as a keyword, so that code can use this
!      word as an identifier.  You can use the keyword '__typeof__'
!      instead.  '-ansi' implies '-fno-gnu-keywords'.
  
! '-fno-implicit-templates'
       Never emit code for non-inline templates that are instantiated
       implicitly (i.e. by use); only emit code for explicit
       instantiations.  *Note Template Instantiation::, for more
       information.
  
! '-fno-implicit-inline-templates'
       Don't emit code for implicit instantiations of inline templates,
       either.  The default is to handle inlines differently so that
       compiles with and without optimization need the same set of
       explicit instantiations.
  
! '-fno-implement-inlines'
       To save space, do not emit out-of-line copies of inline functions
!      controlled by '#pragma implementation'.  This causes linker errors
       if these functions are not inlined everywhere they are called.
  
! '-fms-extensions'
       Disable Wpedantic warnings about constructs used in MFC, such as
       implicit int and getting a pointer to member function via
       non-standard syntax.
  
! '-fno-nonansi-builtins'
       Disable built-in declarations of functions that are not mandated by
!      ANSI/ISO C.  These include 'ffs', 'alloca', '_exit', 'index',
!      'bzero', 'conjf', and other related functions.
  
! '-fnothrow-opt'
!      Treat a 'throw()' exception specification as if it were a
!      'noexcept' specification to reduce or eliminate the text size
       overhead relative to a function with no exception specification.
       If the function has local variables of types with non-trivial
       destructors, the exception specification actually makes the
       function smaller because the EH cleanups for those variables can be
       optimized away.  The semantic effect is that an exception thrown
!      out of a function with such an exception specification results in a
!      call to 'terminate' rather than 'unexpected'.
  
! '-fno-operator-names'
!      Do not treat the operator name keywords 'and', 'bitand', 'bitor',
!      'compl', 'not', 'or' and 'xor' as synonyms as keywords.
  
! '-fno-optional-diags'
!      Disable diagnostics that the standard says a compiler does not need
!      to issue.  Currently, the only such diagnostic issued by G++ is the
!      one for a name having multiple meanings within a class.
  
! '-fpermissive'
       Downgrade some diagnostics about nonconformant code from errors to
!      warnings.  Thus, using '-fpermissive' allows some nonconforming
       code to compile.
  
! '-fno-pretty-templates'
       When an error message refers to a specialization of a function
       template, the compiler normally prints the signature of the
       template followed by the template arguments and any typedefs or
!      typenames in the signature (e.g.  'void f(T) [with T = int]' rather
!      than 'void f(int)') so that it's clear which template is involved.
       When an error message refers to a specialization of a class
       template, the compiler omits any template arguments that match the
       default template arguments for that template.  If either of these
       behaviors make it harder to understand the error message rather
!      than easier, you can use '-fno-pretty-templates' to disable them.
  
! '-frepo'
       Enable automatic template instantiation at link time.  This option
!      also implies '-fno-implicit-templates'.  *Note Template
       Instantiation::, for more information.
  
! '-fno-rtti'
       Disable generation of information about every class with virtual
       functions for use by the C++ run-time type identification features
!      ('dynamic_cast' and 'typeid').  If you don't use those parts of the
!      language, you can save some space by using this flag.  Note that
!      exception handling uses the same information, but G++ generates it
!      as needed.  The 'dynamic_cast' operator can still be used for casts
!      that do not require run-time type information, i.e. casts to 'void
!      *' or to unambiguous base classes.
  
! '-fsized-deallocation'
       Enable the built-in global declarations
            void operator delete (void *, std::size_t) noexcept;
            void operator delete[] (void *, std::size_t) noexcept;
       as introduced in C++14.  This is useful for user-defined
       replacement deallocation functions that, for example, use the size
       of the object to make deallocation faster.  Enabled by default
!      under '-std=c++14' and above.  The flag '-Wsized-deallocation'
       warns about places that might want to add a definition.
  
! '-fstats'
       Emit statistics about front-end processing at the end of the
       compilation.  This information is generally only useful to the G++
       development team.
  
! '-fstrict-enums'
       Allow the compiler to optimize using the assumption that a value of
       enumerated type can only be one of the values of the enumeration
       (as defined in the C++ standard; basically, a value that can be
       represented in the minimum number of bits needed to represent all
       the enumerators).  This assumption may not be valid if the program
!      uses a cast to convert an arbitrary integer value to the enumerated
!      type.
  
! '-ftemplate-backtrace-limit=N'
       Set the maximum number of template instantiation notes for a single
       warning or error to N.  The default value is 10.
  
! '-ftemplate-depth=N'
       Set the maximum instantiation depth for template classes to N.  A
       limit on the template instantiation depth is needed to detect
       endless recursions during template class instantiation.  ANSI/ISO
       C++ conforming programs must not rely on a maximum depth greater
       than 17 (changed to 1024 in C++11).  The default value is 900, as
!      the compiler can run out of stack space before hitting 1024 in some
!      situations.
  
! '-fno-threadsafe-statics'
       Do not emit the extra code to use the routines specified in the C++
       ABI for thread-safe initialization of local statics.  You can use
       this option to reduce code size slightly in code that doesn't need
       to be thread-safe.
  
! '-fuse-cxa-atexit'
       Register destructors for objects with static storage duration with
!      the '__cxa_atexit' function rather than the 'atexit' function.
       This option is required for fully standards-compliant handling of
       static destructors, but only works if your C library supports
!      '__cxa_atexit'.
  
! '-fno-use-cxa-get-exception-ptr'
!      Don't use the '__cxa_get_exception_ptr' runtime routine.  This
!      causes 'std::uncaught_exception' to be incorrect, but is necessary
       if the runtime routine is not available.
  
! '-fvisibility-inlines-hidden'
       This switch declares that the user does not attempt to compare
       pointers to inline functions or methods where the addresses of the
       two functions are taken in different shared objects.
  
       The effect of this is that GCC may, effectively, mark inline
!      methods with '__attribute__ ((visibility ("hidden")))' so that they
!      do not appear in the export table of a DSO and do not require a PLT
!      indirection when used within the DSO.  Enabling this option can
!      have a dramatic effect on load and link times of a DSO as it
       massively reduces the size of the dynamic export table when the
       library makes heavy use of templates.
  
*************** GCC.
*** 2598,2611 ****
       option as their linkage might otherwise cross a shared library
       boundary.  *Note Template Instantiation::.
  
! `-fvisibility-ms-compat'
       This flag attempts to use visibility settings to make GCC's C++
       linkage model compatible with that of Microsoft Visual Studio.
  
       The flag makes these changes to GCC's linkage model:
  
!        1. It sets the default visibility to `hidden', like
!           `-fvisibility=hidden'.
  
         2. Types, but not their members, are not hidden by default.
  
--- 2588,2601 ----
       option as their linkage might otherwise cross a shared library
       boundary.  *Note Template Instantiation::.
  
! '-fvisibility-ms-compat'
       This flag attempts to use visibility settings to make GCC's C++
       linkage model compatible with that of Microsoft Visual Studio.
  
       The flag makes these changes to GCC's linkage model:
  
!        1. It sets the default visibility to 'hidden', like
!           '-fvisibility=hidden'.
  
         2. Types, but not their members, are not hidden by default.
  
*************** GCC.
*** 2614,2620 ****
            shared object: those declarations are permitted if they are
            permitted when this option is not used.
  
!      In new code it is better to use `-fvisibility=hidden' and export
       those classes that are intended to be externally visible.
       Unfortunately it is possible for code to rely, perhaps
       accidentally, on the Visual Studio behavior.
--- 2604,2610 ----
            shared object: those declarations are permitted if they are
            permitted when this option is not used.
  
!      In new code it is better to use '-fvisibility=hidden' and export
       those classes that are intended to be externally visible.
       Unfortunately it is possible for code to rely, perhaps
       accidentally, on the Visual Studio behavior.
*************** GCC.
*** 2627,2707 ****
       given, it is a violation of the ODR to define types with the same
       name differently.
  
! `-fvtable-verify=[std|preinit|none]'
!      Turn on (or off, if using `-fvtable-verify=none') the security
!      feature that verifies at run time, for every virtual call, that
!      the vtable pointer through which the call is made is valid for the
!      type of the object, and has not been corrupted or overwritten.  If
!      an invalid vtable pointer is detected at run time, an error is
       reported and execution of the program is immediately halted.
  
       This option causes run-time data structures to be built at program
       startup, which are used for verifying the vtable pointers.  The
!      options `std' and `preinit' control the timing of when these data
       structures are built.  In both cases the data structures are built
!      before execution reaches `main'.  Using `-fvtable-verify=std'
       causes the data structures to be built after shared libraries have
!      been loaded and initialized.  `-fvtable-verify=preinit' causes
!      them to be built before shared libraries have been loaded and
       initialized.
  
       If this option appears multiple times in the command line with
!      different values specified, `none' takes highest priority over
!      both `std' and `preinit'; `preinit' takes priority over `std'.
  
! `-fvtv-debug'
!      When used in conjunction with `-fvtable-verify=std' or
!      `-fvtable-verify=preinit', causes debug versions of the runtime
       functions for the vtable verification feature to be called.  This
!      flag also causes the compiler to log information about which
!      vtable pointers it finds for each class.  This information is
!      written to a file named `vtv_set_ptr_data.log' in the directory
!      named by the environment variable `VTV_LOGS_DIR' if that is
!      defined or the current working directory otherwise.
  
!      Note:  This feature _appends_ data to the log file. If you want a
       fresh log file, be sure to delete any existing one.
  
! `-fvtv-counts'
       This is a debugging flag.  When used in conjunction with
!      `-fvtable-verify=std' or `-fvtable-verify=preinit', this causes
!      the compiler to keep track of the total number of virtual calls it
       encounters and the number of verifications it inserts.  It also
       counts the number of calls to certain run-time library functions
       that it inserts and logs this information for each compilation
       unit.  The compiler writes this information to a file named
!      `vtv_count_data.log' in the directory named by the environment
!      variable `VTV_LOGS_DIR' if that is defined or the current working
!      directory otherwise.  It also counts the size of the vtable
!      pointer sets for each class, and writes this information to
!      `vtv_class_set_sizes.log' in the same directory.
  
!      Note:  This feature _appends_ data to the log files.  To get fresh
       log files, be sure to delete any existing ones.
  
! `-fno-weak'
       Do not use weak symbol support, even if it is provided by the
       linker.  By default, G++ uses weak symbols if they are available.
       This option exists only for testing, and should not be used by
       end-users; it results in inferior code and has no benefits.  This
       option may be removed in a future release of G++.
  
! `-nostdinc++'
!      Do not search for header files in the standard directories
!      specific to C++, but do still search the other standard
!      directories.  (This option is used when building the C++ library.)
  
   In addition, these optimization, warning, and code generation options
  have meanings only for C++ programs:
  
! `-Wabi (C, Objective-C, C++ and Objective-C++ only)'
!      When an explicit `-fabi-version=N' option is used, causes G++ to
       warn when it generates code that is probably not compatible with
       the vendor-neutral C++ ABI.  Since G++ now defaults to
!      `-fabi-version=0', `-Wabi' has no effect unless either an older
!      ABI version is selected (with `-fabi-version=N') or an older
!      compatibility version is selected (with `-Wabi=N' or
!      `-fabi-compat-version=N').
  
       Although an effort has been made to warn about all such cases,
       there are probably some cases that are not warned about, even
--- 2617,2697 ----
       given, it is a violation of the ODR to define types with the same
       name differently.
  
! '-fvtable-verify=[std|preinit|none]'
!      Turn on (or off, if using '-fvtable-verify=none') the security
!      feature that verifies at run time, for every virtual call, that the
!      vtable pointer through which the call is made is valid for the type
!      of the object, and has not been corrupted or overwritten.  If an
!      invalid vtable pointer is detected at run time, an error is
       reported and execution of the program is immediately halted.
  
       This option causes run-time data structures to be built at program
       startup, which are used for verifying the vtable pointers.  The
!      options 'std' and 'preinit' control the timing of when these data
       structures are built.  In both cases the data structures are built
!      before execution reaches 'main'.  Using '-fvtable-verify=std'
       causes the data structures to be built after shared libraries have
!      been loaded and initialized.  '-fvtable-verify=preinit' causes them
!      to be built before shared libraries have been loaded and
       initialized.
  
       If this option appears multiple times in the command line with
!      different values specified, 'none' takes highest priority over both
!      'std' and 'preinit'; 'preinit' takes priority over 'std'.
  
! '-fvtv-debug'
!      When used in conjunction with '-fvtable-verify=std' or
!      '-fvtable-verify=preinit', causes debug versions of the runtime
       functions for the vtable verification feature to be called.  This
!      flag also causes the compiler to log information about which vtable
!      pointers it finds for each class.  This information is written to a
!      file named 'vtv_set_ptr_data.log' in the directory named by the
!      environment variable 'VTV_LOGS_DIR' if that is defined or the
!      current working directory otherwise.
  
!      Note: This feature _appends_ data to the log file.  If you want a
       fresh log file, be sure to delete any existing one.
  
! '-fvtv-counts'
       This is a debugging flag.  When used in conjunction with
!      '-fvtable-verify=std' or '-fvtable-verify=preinit', this causes the
!      compiler to keep track of the total number of virtual calls it
       encounters and the number of verifications it inserts.  It also
       counts the number of calls to certain run-time library functions
       that it inserts and logs this information for each compilation
       unit.  The compiler writes this information to a file named
!      'vtv_count_data.log' in the directory named by the environment
!      variable 'VTV_LOGS_DIR' if that is defined or the current working
!      directory otherwise.  It also counts the size of the vtable pointer
!      sets for each class, and writes this information to
!      'vtv_class_set_sizes.log' in the same directory.
  
!      Note: This feature _appends_ data to the log files.  To get fresh
       log files, be sure to delete any existing ones.
  
! '-fno-weak'
       Do not use weak symbol support, even if it is provided by the
       linker.  By default, G++ uses weak symbols if they are available.
       This option exists only for testing, and should not be used by
       end-users; it results in inferior code and has no benefits.  This
       option may be removed in a future release of G++.
  
! '-nostdinc++'
!      Do not search for header files in the standard directories specific
!      to C++, but do still search the other standard directories.  (This
!      option is used when building the C++ library.)
  
   In addition, these optimization, warning, and code generation options
  have meanings only for C++ programs:
  
! '-Wabi (C, Objective-C, C++ and Objective-C++ only)'
!      When an explicit '-fabi-version=N' option is used, causes G++ to
       warn when it generates code that is probably not compatible with
       the vendor-neutral C++ ABI.  Since G++ now defaults to
!      '-fabi-version=0', '-Wabi' has no effect unless either an older ABI
!      version is selected (with '-fabi-version=N') or an older
!      compatibility version is selected (with '-Wabi=N' or
!      '-fabi-compat-version=N').
  
       Although an effort has been made to warn about all such cases,
       there are probably some cases that are not warned about, even
*************** have meanings only for C++ programs:
*** 2713,2724 ****
       concerned about the fact that code generated by G++ may not be
       binary compatible with code generated by other compilers.
  
!      `-Wabi' can also be used with an explicit version number to warn
!      about compatibility with a particular `-fabi-version' level, e.g.
!      `-Wabi=2' to warn about changes relative to `-fabi-version=2'.
!      Specifying a version number also sets `-fabi-compat-version=N'.
  
!      The known incompatibilities in `-fabi-version=2' (which was the
       default from GCC 3.4 to 4.9) include:
  
          * A template with a non-type template parameter of reference
--- 2703,2714 ----
       concerned about the fact that code generated by G++ may not be
       binary compatible with code generated by other compilers.
  
!      '-Wabi' can also be used with an explicit version number to warn
!      about compatibility with a particular '-fabi-version' level, e.g.
!      '-Wabi=2' to warn about changes relative to '-fabi-version=2'.
!      Specifying a version number also sets '-fabi-compat-version=N'.
  
!      The known incompatibilities in '-fabi-version=2' (which was the
       default from GCC 3.4 to 4.9) include:
  
          * A template with a non-type template parameter of reference
*************** have meanings only for C++ programs:
*** 2727,2816 ****
                 template <int &> struct S {};
                 void n (S<N>) {2}
  
!           This was fixed in `-fabi-version=3'.
  
!         * SIMD vector types declared using `__attribute
!           ((vector_size))' were mangled in a non-standard way that does
!           not allow for overloading of functions taking vectors of
!           different sizes.
  
!           The mangling was changed in `-fabi-version=4'.
  
!         * `__attribute ((const))' and `noreturn' were mangled as type
!           qualifiers, and `decltype' of a plain declaration was folded
            away.
  
!           These mangling issues were fixed in `-fabi-version=5'.
  
          * Scoped enumerators passed as arguments to a variadic function
!           are promoted like unscoped enumerators, causing `va_arg' to
            complain.  On most targets this does not actually affect the
            parameter passing ABI, as there is no way to pass an argument
!           smaller than `int'.
  
            Also, the ABI changed the mangling of template argument packs,
!           `const_cast', `static_cast', prefix increment/decrement, and
!           a class scope function used as a template argument.
  
!           These issues were corrected in `-fabi-version=6'.
  
          * Lambdas in default argument scope were mangled incorrectly,
!           and the ABI changed the mangling of `nullptr_t'.
  
!           These issues were corrected in `-fabi-version=7'.
  
          * When mangling a function type with function-cv-qualifiers, the
            un-qualified function type was incorrectly treated as a
            substitution candidate.
  
!           This was fixed in `-fabi-version=8', the default for GCC 5.1.
  
!         * `decltype(nullptr)' incorrectly had an alignment of 1,
!           leading to unaligned accesses.  Note that this did not affect
!           the ABI of a function with a `nullptr_t' parameter, as
!           parameters have a minimum alignment.
  
!           This was fixed in `-fabi-version=9', the default for GCC 5.2.
  
!      It also warns about psABI-related changes.  The known psABI
!      changes at this point include:
  
!         * For SysV/x86-64, unions with `long double' members are passed
!           in memory as specified in psABI.  For example:
  
                 union U {
                   long double ld;
                   int i;
                 };
  
!           `union U' is always passed in memory.
! 
  
! `-Wabi-tag (C++ and Objective-C++ only)'
       Warn when a type with an ABI tag is used in a context that does not
       have that ABI tag.  See *note C++ Attributes:: for more information
       about ABI tags.
  
! `-Wctor-dtor-privacy (C++ and Objective-C++ only)'
       Warn when a class seems unusable because all the constructors or
       destructors in that class are private, and it has neither friends
       nor public static member functions.  Also warn if there are no
       non-private methods, and there's at least one private member
       function that isn't a constructor or destructor.
  
! `-Wdelete-non-virtual-dtor (C++ and Objective-C++ only)'
!      Warn when `delete' is used to destroy an instance of a class that
!      has virtual functions and non-virtual destructor. It is unsafe to
       delete an instance of a derived class through a pointer to a base
       class if the base class does not have a virtual destructor.  This
!      warning is enabled by `-Wall'.
  
! `-Wliteral-suffix (C++ and Objective-C++ only)'
       Warn when a string or character literal is followed by a ud-suffix
       which does not begin with an underscore.  As a conforming
       extension, GCC treats such suffixes as separate preprocessing
       tokens in order to maintain backwards compatibility with code that
!      uses formatting macros from `<inttypes.h>'.  For example:
  
            #define __STDC_FORMAT_MACROS
            #include <inttypes.h>
--- 2717,2804 ----
                 template <int &> struct S {};
                 void n (S<N>) {2}
  
!           This was fixed in '-fabi-version=3'.
  
!         * SIMD vector types declared using '__attribute ((vector_size))'
!           were mangled in a non-standard way that does not allow for
!           overloading of functions taking vectors of different sizes.
  
!           The mangling was changed in '-fabi-version=4'.
  
!         * '__attribute ((const))' and 'noreturn' were mangled as type
!           qualifiers, and 'decltype' of a plain declaration was folded
            away.
  
!           These mangling issues were fixed in '-fabi-version=5'.
  
          * Scoped enumerators passed as arguments to a variadic function
!           are promoted like unscoped enumerators, causing 'va_arg' to
            complain.  On most targets this does not actually affect the
            parameter passing ABI, as there is no way to pass an argument
!           smaller than 'int'.
  
            Also, the ABI changed the mangling of template argument packs,
!           'const_cast', 'static_cast', prefix increment/decrement, and a
!           class scope function used as a template argument.
  
!           These issues were corrected in '-fabi-version=6'.
  
          * Lambdas in default argument scope were mangled incorrectly,
!           and the ABI changed the mangling of 'nullptr_t'.
  
!           These issues were corrected in '-fabi-version=7'.
  
          * When mangling a function type with function-cv-qualifiers, the
            un-qualified function type was incorrectly treated as a
            substitution candidate.
  
!           This was fixed in '-fabi-version=8', the default for GCC 5.1.
  
!         * 'decltype(nullptr)' incorrectly had an alignment of 1, leading
!           to unaligned accesses.  Note that this did not affect the ABI
!           of a function with a 'nullptr_t' parameter, as parameters have
!           a minimum alignment.
  
!           This was fixed in '-fabi-version=9', the default for GCC 5.2.
  
!      It also warns about psABI-related changes.  The known psABI changes
!      at this point include:
  
!         * For SysV/x86-64, unions with 'long double' members are passed
!           in memory as specified in psABI. For example:
  
                 union U {
                   long double ld;
                   int i;
                 };
  
!           'union U' is always passed in memory.
  
! '-Wabi-tag (C++ and Objective-C++ only)'
       Warn when a type with an ABI tag is used in a context that does not
       have that ABI tag.  See *note C++ Attributes:: for more information
       about ABI tags.
  
! '-Wctor-dtor-privacy (C++ and Objective-C++ only)'
       Warn when a class seems unusable because all the constructors or
       destructors in that class are private, and it has neither friends
       nor public static member functions.  Also warn if there are no
       non-private methods, and there's at least one private member
       function that isn't a constructor or destructor.
  
! '-Wdelete-non-virtual-dtor (C++ and Objective-C++ only)'
!      Warn when 'delete' is used to destroy an instance of a class that
!      has virtual functions and non-virtual destructor.  It is unsafe to
       delete an instance of a derived class through a pointer to a base
       class if the base class does not have a virtual destructor.  This
!      warning is enabled by '-Wall'.
  
! '-Wliteral-suffix (C++ and Objective-C++ only)'
       Warn when a string or character literal is followed by a ud-suffix
       which does not begin with an underscore.  As a conforming
       extension, GCC treats such suffixes as separate preprocessing
       tokens in order to maintain backwards compatibility with code that
!      uses formatting macros from '<inttypes.h>'.  For example:
  
            #define __STDC_FORMAT_MACROS
            #include <inttypes.h>
*************** have meanings only for C++ programs:
*** 2821,2859 ****
              printf("My int64: %"PRId64"\n", i64);
            }
  
!      In this case, `PRId64' is treated as a separate preprocessing
       token.
  
       This warning is enabled by default.
  
! `-Wnarrowing (C++ and Objective-C++ only)'
       Warn when a narrowing conversion prohibited by C++11 occurs within
!      `{ }', e.g.
  
            int i = { 2.2 }; // error: narrowing from double to int
  
!      This flag is included in `-Wall' and `-Wc++11-compat'.
  
!      With `-std=c++11', `-Wno-narrowing' suppresses the diagnostic
       required by the standard.  Note that this does not affect the
       meaning of well-formed code; narrowing conversions are still
       considered ill-formed in SFINAE context.
  
! `-Wnoexcept (C++ and Objective-C++ only)'
       Warn when a noexcept-expression evaluates to false because of a
       call to a function that does not have a non-throwing exception
!      specification (i.e. `throw()' or `noexcept') but is known by the
       compiler to never throw an exception.
  
! `-Wnon-virtual-dtor (C++ and Objective-C++ only)'
       Warn when a class has virtual functions and an accessible
       non-virtual destructor itself or in an accessible polymorphic base
       class, in which case it is possible but unsafe to delete an
       instance of a derived class through a pointer to the class itself
!      or base class.  This warning is automatically enabled if
!      `-Weffc++' is specified.
  
! `-Wreorder (C++ and Objective-C++ only)'
       Warn when the order of member initializers given in the code does
       not match the order in which they must be executed.  For instance:
  
--- 2809,2847 ----
              printf("My int64: %"PRId64"\n", i64);
            }
  
!      In this case, 'PRId64' is treated as a separate preprocessing
       token.
  
       This warning is enabled by default.
  
! '-Wnarrowing (C++ and Objective-C++ only)'
       Warn when a narrowing conversion prohibited by C++11 occurs within
!      '{ }', e.g.
  
            int i = { 2.2 }; // error: narrowing from double to int
  
!      This flag is included in '-Wall' and '-Wc++11-compat'.
  
!      With '-std=c++11', '-Wno-narrowing' suppresses the diagnostic
       required by the standard.  Note that this does not affect the
       meaning of well-formed code; narrowing conversions are still
       considered ill-formed in SFINAE context.
  
! '-Wnoexcept (C++ and Objective-C++ only)'
       Warn when a noexcept-expression evaluates to false because of a
       call to a function that does not have a non-throwing exception
!      specification (i.e.  'throw()' or 'noexcept') but is known by the
       compiler to never throw an exception.
  
! '-Wnon-virtual-dtor (C++ and Objective-C++ only)'
       Warn when a class has virtual functions and an accessible
       non-virtual destructor itself or in an accessible polymorphic base
       class, in which case it is possible but unsafe to delete an
       instance of a derived class through a pointer to the class itself
!      or base class.  This warning is automatically enabled if '-Weffc++'
!      is specified.
  
! '-Wreorder (C++ and Objective-C++ only)'
       Warn when the order of member initializers given in the code does
       not match the order in which they must be executed.  For instance:
  
*************** have meanings only for C++ programs:
*** 2863,2893 ****
              A(): j (0), i (1) { }
            };
  
!      The compiler rearranges the member initializers for `i' and `j' to
       match the declaration order of the members, emitting a warning to
!      that effect.  This warning is enabled by `-Wall'.
  
! `-fext-numeric-literals (C++ and Objective-C++ only)'
       Accept imaginary, fixed-point, or machine-defined literal number
       suffixes as GNU extensions.  When this option is turned off these
       suffixes are treated as C++11 user-defined literal numeric
!      suffixes.  This is on by default for all pre-C++11 dialects and
!      all GNU dialects: `-std=c++98', `-std=gnu++98', `-std=gnu++11',
!      `-std=gnu++14'.  This option is off by default for ISO C++11
!      onwards (`-std=c++11', ...).
  
!  The following `-W...' options are not affected by `-Wall'.
  
! `-Weffc++ (C++ and Objective-C++ only)'
       Warn about violations of the following style guidelines from Scott
!      Meyers' `Effective C++' series of books:
  
          * Define a copy constructor and an assignment operator for
            classes with dynamically-allocated memory.
  
          * Prefer initialization to assignment in constructors.
  
!         * Have `operator=' return a reference to `*this'.
  
          * Don't try to return a reference when you must return an
            object.
--- 2851,2881 ----
              A(): j (0), i (1) { }
            };
  
!      The compiler rearranges the member initializers for 'i' and 'j' to
       match the declaration order of the members, emitting a warning to
!      that effect.  This warning is enabled by '-Wall'.
  
! '-fext-numeric-literals (C++ and Objective-C++ only)'
       Accept imaginary, fixed-point, or machine-defined literal number
       suffixes as GNU extensions.  When this option is turned off these
       suffixes are treated as C++11 user-defined literal numeric
!      suffixes.  This is on by default for all pre-C++11 dialects and all
!      GNU dialects: '-std=c++98', '-std=gnu++98', '-std=gnu++11',
!      '-std=gnu++14'.  This option is off by default for ISO C++11
!      onwards ('-std=c++11', ...).
  
!  The following '-W...' options are not affected by '-Wall'.
  
! '-Weffc++ (C++ and Objective-C++ only)'
       Warn about violations of the following style guidelines from Scott
!      Meyers' 'Effective C++' series of books:
  
          * Define a copy constructor and an assignment operator for
            classes with dynamically-allocated memory.
  
          * Prefer initialization to assignment in constructors.
  
!         * Have 'operator=' return a reference to '*this'.
  
          * Don't try to return a reference when you must return an
            object.
*************** have meanings only for C++ programs:
*** 2895,2943 ****
          * Distinguish between prefix and postfix forms of increment and
            decrement operators.
  
!         * Never overload `&&', `||', or `,'.
! 
  
!      This option also enables `-Wnon-virtual-dtor', which is also one
!      of the effective C++ recommendations.  However, the check is
!      extended to warn about the lack of virtual destructor in accessible
       non-polymorphic bases classes too.
  
       When selecting this option, be aware that the standard library
!      headers do not obey all of these guidelines; use `grep -v' to
       filter out those warnings.
  
! `-Wstrict-null-sentinel (C++ and Objective-C++ only)'
!      Warn about the use of an uncasted `NULL' as sentinel.  When
!      compiling only with GCC this is a valid sentinel, as `NULL' is
!      defined to `__null'.  Although it is a null pointer constant
!      rather than a null pointer, it is guaranteed to be of the same
!      size as a pointer.  But this use is not portable across different
!      compilers.
  
! `-Wno-non-template-friend (C++ and Objective-C++ only)'
       Disable warnings when non-templatized friend functions are declared
       within a template.  Since the advent of explicit template
       specification support in G++, if the name of the friend is an
!      unqualified-id (i.e., `friend foo(int)'), the C++ language
       specification demands that the friend declare or define an
       ordinary, nontemplate function.  (Section 14.5.3).  Before G++
       implemented explicit specification, unqualified-ids could be
       interpreted as a particular specialization of a templatized
       function.  Because this non-conforming behavior is no longer the
!      default behavior for G++, `-Wnon-template-friend' allows the
       compiler to check existing code for potential trouble spots and is
       on by default.  This new compiler behavior can be turned off with
!      `-Wno-non-template-friend', which keeps the conformant compiler
       code but disables the helpful warning.
  
! `-Wold-style-cast (C++ and Objective-C++ only)'
       Warn if an old-style (C-style) cast to a non-void type is used
!      within a C++ program.  The new-style casts (`dynamic_cast',
!      `static_cast', `reinterpret_cast', and `const_cast') are less
       vulnerable to unintended effects and much easier to search for.
  
! `-Woverloaded-virtual (C++ and Objective-C++ only)'
       Warn when a function declaration hides virtual functions from a
       base class.  For example, in:
  
--- 2883,2929 ----
          * Distinguish between prefix and postfix forms of increment and
            decrement operators.
  
!         * Never overload '&&', '||', or ','.
  
!      This option also enables '-Wnon-virtual-dtor', which is also one of
!      the effective C++ recommendations.  However, the check is extended
!      to warn about the lack of virtual destructor in accessible
       non-polymorphic bases classes too.
  
       When selecting this option, be aware that the standard library
!      headers do not obey all of these guidelines; use 'grep -v' to
       filter out those warnings.
  
! '-Wstrict-null-sentinel (C++ and Objective-C++ only)'
!      Warn about the use of an uncasted 'NULL' as sentinel.  When
!      compiling only with GCC this is a valid sentinel, as 'NULL' is
!      defined to '__null'.  Although it is a null pointer constant rather
!      than a null pointer, it is guaranteed to be of the same size as a
!      pointer.  But this use is not portable across different compilers.
  
! '-Wno-non-template-friend (C++ and Objective-C++ only)'
       Disable warnings when non-templatized friend functions are declared
       within a template.  Since the advent of explicit template
       specification support in G++, if the name of the friend is an
!      unqualified-id (i.e., 'friend foo(int)'), the C++ language
       specification demands that the friend declare or define an
       ordinary, nontemplate function.  (Section 14.5.3).  Before G++
       implemented explicit specification, unqualified-ids could be
       interpreted as a particular specialization of a templatized
       function.  Because this non-conforming behavior is no longer the
!      default behavior for G++, '-Wnon-template-friend' allows the
       compiler to check existing code for potential trouble spots and is
       on by default.  This new compiler behavior can be turned off with
!      '-Wno-non-template-friend', which keeps the conformant compiler
       code but disables the helpful warning.
  
! '-Wold-style-cast (C++ and Objective-C++ only)'
       Warn if an old-style (C-style) cast to a non-void type is used
!      within a C++ program.  The new-style casts ('dynamic_cast',
!      'static_cast', 'reinterpret_cast', and 'const_cast') are less
       vulnerable to unintended effects and much easier to search for.
  
! '-Woverloaded-virtual (C++ and Objective-C++ only)'
       Warn when a function declaration hides virtual functions from a
       base class.  For example, in:
  
*************** have meanings only for C++ programs:
*** 2949,2966 ****
              void f(int);
            };
  
!      the `A' class version of `f' is hidden in `B', and code like:
  
            B* b;
            b->f();
  
       fails to compile.
  
! `-Wno-pmf-conversions (C++ and Objective-C++ only)'
       Disable the diagnostic for converting a bound pointer to member
       function to a plain pointer.
  
! `-Wsign-promo (C++ and Objective-C++ only)'
       Warn when overload resolution chooses a promotion from unsigned or
       enumerated type to a signed type, over a conversion to an unsigned
       type of the same size.  Previous versions of G++ tried to preserve
--- 2935,2952 ----
              void f(int);
            };
  
!      the 'A' class version of 'f' is hidden in 'B', and code like:
  
            B* b;
            b->f();
  
       fails to compile.
  
! '-Wno-pmf-conversions (C++ and Objective-C++ only)'
       Disable the diagnostic for converting a bound pointer to member
       function to a plain pointer.
  
! '-Wsign-promo (C++ and Objective-C++ only)'
       Warn when overload resolution chooses a promotion from unsigned or
       enumerated type to a signed type, over a conversion to an unsigned
       type of the same size.  Previous versions of G++ tried to preserve
*************** languages themselves.  *Note Language St
*** 2977,3192 ****
  Standards, for references.)
  
   This section describes the command-line options that are only
! meaningful for Objective-C and Objective-C++ programs.  You can also
! use most of the language-independent GNU compiler options.  For
! example, you might compile a file `some_class.m' like this:
  
       gcc -g -fgnu-runtime -O -c some_class.m
  
! In this example, `-fgnu-runtime' is an option meant only for
! Objective-C and Objective-C++ programs; you can use the other options
! with any language supported by GCC.
  
   Note that since Objective-C is an extension of the C language,
  Objective-C compilations may also use options specific to the C
! front-end (e.g., `-Wtraditional').  Similarly, Objective-C++
! compilations may use C++-specific options (e.g., `-Wabi').
  
!  Here is a list of options that are _only_ for compiling Objective-C
! and Objective-C++ programs:
  
! `-fconstant-string-class=CLASS-NAME'
       Use CLASS-NAME as the name of the class to instantiate for each
!      literal string specified with the syntax `@"..."'.  The default
!      class name is `NXConstantString' if the GNU runtime is being used,
!      and `NSConstantString' if the NeXT runtime is being used (see
!      below).  The `-fconstant-cfstrings' option, if also present,
!      overrides the `-fconstant-string-class' setting and cause `@"..."'
       literals to be laid out as constant CoreFoundation strings.
  
! `-fgnu-runtime'
       Generate object code compatible with the standard GNU Objective-C
       runtime.  This is the default for most types of systems.
  
! `-fnext-runtime'
       Generate output compatible with the NeXT runtime.  This is the
!      default for NeXT-based systems, including Darwin and Mac OS X.
!      The macro `__NEXT_RUNTIME__' is predefined if (and only if) this
!      option is used.
  
! `-fno-nil-receivers'
!      Assume that all Objective-C message dispatches (`[receiver
       message:arg]') in this translation unit ensure that the receiver is
!      not `nil'.  This allows for more efficient entry points in the
       runtime to be used.  This option is only available in conjunction
       with the NeXT runtime and ABI version 0 or 1.
  
! `-fobjc-abi-version=N'
       Use version N of the Objective-C ABI for the selected runtime.
       This option is currently supported only for the NeXT runtime.  In
       that case, Version 0 is the traditional (32-bit) ABI without
       support for properties and other Objective-C 2.0 additions.
       Version 1 is the traditional (32-bit) ABI with support for
       properties and other Objective-C 2.0 additions.  Version 2 is the
!      modern (64-bit) ABI.  If nothing is specified, the default is
!      Version 0 on 32-bit target machines, and Version 2 on 64-bit
!      target machines.
  
! `-fobjc-call-cxx-cdtors'
       For each Objective-C class, check if any of its instance variables
       is a C++ object with a non-trivial default constructor.  If so,
!      synthesize a special `- (id) .cxx_construct' instance method which
       runs non-trivial default constructors on any such instance
!      variables, in order, and then return `self'.  Similarly, check if
       any instance variable is a C++ object with a non-trivial
!      destructor, and if so, synthesize a special `- (void)
       .cxx_destruct' method which runs all such default destructors, in
       reverse order.
  
!      The `- (id) .cxx_construct' and `- (void) .cxx_destruct' methods
!      thusly generated only operate on instance variables declared in
!      the current Objective-C class, and not those inherited from
       superclasses.  It is the responsibility of the Objective-C runtime
       to invoke all such methods in an object's inheritance hierarchy.
!      The `- (id) .cxx_construct' methods are invoked by the runtime
!      immediately after a new object instance is allocated; the `-
!      (void) .cxx_destruct' methods are invoked immediately before the
!      runtime deallocates an object instance.
  
       As of this writing, only the NeXT runtime on Mac OS X 10.4 and
!      later has support for invoking the `- (id) .cxx_construct' and `-
       (void) .cxx_destruct' methods.
  
! `-fobjc-direct-dispatch'
       Allow fast jumps to the message dispatcher.  On Darwin this is
       accomplished via the comm page.
  
! `-fobjc-exceptions'
       Enable syntactic support for structured exception handling in
       Objective-C, similar to what is offered by C++ and Java.  This
!      option is required to use the Objective-C keywords `@try',
!      `@throw', `@catch', `@finally' and `@synchronized'.  This option
!      is available with both the GNU runtime and the NeXT runtime (but
!      not available in conjunction with the NeXT runtime on Mac OS X
!      10.2 and earlier).
  
! `-fobjc-gc'
       Enable garbage collection (GC) in Objective-C and Objective-C++
       programs.  This option is only available with the NeXT runtime; the
       GNU runtime has a different garbage collection implementation that
       does not require special compiler flags.
  
! `-fobjc-nilcheck'
       For the NeXT runtime with version 2 of the ABI, check for a nil
       receiver in method invocations before doing the actual method call.
!      This is the default and can be disabled using
!      `-fno-objc-nilcheck'.  Class methods and super calls are never
!      checked for nil in this way no matter what this flag is set to.
!      Currently this flag does nothing when the GNU runtime, or an older
!      version of the NeXT runtime ABI, is used.
  
! `-fobjc-std=objc1'
       Conform to the language syntax of Objective-C 1.0, the language
!      recognized by GCC 4.0.  This only affects the Objective-C
!      additions to the C/C++ language; it does not affect conformance to
!      C/C++ standards, which is controlled by the separate C/C++ dialect
!      option flags.  When this option is used with the Objective-C or
       Objective-C++ compiler, any Objective-C syntax that is not
       recognized by GCC 4.0 is rejected.  This is useful if you need to
       make sure that your Objective-C code can be compiled with older
       versions of GCC.
  
! `-freplace-objc-classes'
!      Emit a special marker instructing `ld(1)' not to statically link in
!      the resulting object file, and allow `dyld(1)' to load it in at
!      run time instead.  This is used in conjunction with the
       Fix-and-Continue debugging mode, where the object file in question
!      may be recompiled and dynamically reloaded in the course of
!      program execution, without the need to restart the program itself.
       Currently, Fix-and-Continue functionality is only available in
       conjunction with the NeXT runtime on Mac OS X 10.3 and later.
  
! `-fzero-link'
       When compiling for the NeXT runtime, the compiler ordinarily
!      replaces calls to `objc_getClass("...")' (when the name of the
       class is known at compile time) with static class references that
       get initialized at load time, which improves run-time performance.
!      Specifying the `-fzero-link' flag suppresses this behavior and
!      causes calls to `objc_getClass("...")' to be retained.  This is
       useful in Zero-Link debugging mode, since it allows for individual
!      class implementations to be modified during program execution.
!      The GNU runtime currently always retains calls to
!      `objc_get_class("...")' regardless of command-line options.
  
! `-fno-local-ivars'
       By default instance variables in Objective-C can be accessed as if
       they were local variables from within the methods of the class
       they're declared in.  This can lead to shadowing between instance
       variables and other variables declared either locally inside a
       class method or globally with the same name.  Specifying the
!      `-fno-local-ivars' flag disables this behavior thus avoiding
       variable shadowing issues.
  
! `-fivar-visibility=[public|protected|private|package]'
       Set the default instance variable visibility to the specified
!      option so that instance variables declared outside the scope of
!      any access modifier directives default to the specified visibility.
  
! `-gen-decls'
!      Dump interface declarations for all classes seen in the source
!      file to a file named `SOURCENAME.decl'.
  
! `-Wassign-intercept (Objective-C and Objective-C++ only)'
       Warn whenever an Objective-C assignment is being intercepted by the
       garbage collector.
  
! `-Wno-protocol (Objective-C and Objective-C++ only)'
!      If a class is declared to implement a protocol, a warning is
!      issued for every method in the protocol that is not implemented by
!      the class.  The default behavior is to issue a warning for every
!      method not explicitly implemented in the class, even if a method
       implementation is inherited from the superclass.  If you use the
!      `-Wno-protocol' option, then methods inherited from the superclass
       are considered to be implemented, and no warning is issued for
       them.
  
! `-Wselector (Objective-C and Objective-C++ only)'
       Warn if multiple methods of different types for the same selector
       are found during compilation.  The check is performed on the list
       of methods in the final stage of compilation.  Additionally, a
       check is performed for each selector appearing in a
!      `@selector(...)'  expression, and a corresponding method for that
       selector has been found during compilation.  Because these checks
       scan the method table only at the end of compilation, these
       warnings are not produced if the final stage of compilation is not
       reached, for example because an error is found during compilation,
!      or because the `-fsyntax-only' option is being used.
  
! `-Wstrict-selector-match (Objective-C and Objective-C++ only)'
       Warn if multiple methods with differing argument and/or return
       types are found for a given selector when attempting to send a
!      message using this selector to a receiver of type `id' or `Class'.
!      When this flag is off (which is the default behavior), the
!      compiler omits such warnings if any differences found are confined
!      to types that share the same size and alignment.
  
! `-Wundeclared-selector (Objective-C and Objective-C++ only)'
!      Warn if a `@selector(...)' expression referring to an undeclared
       selector is found.  A selector is considered undeclared if no
!      method with that name has been declared before the
!      `@selector(...)' expression, either explicitly in an `@interface'
!      or `@protocol' declaration, or implicitly in an `@implementation'
!      section.  This option always performs its checks as soon as a
!      `@selector(...)' expression is found, while `-Wselector' only
!      performs its checks in the final stage of compilation.  This also
!      enforces the coding style convention that methods and selectors
!      must be declared before being used.
  
! `-print-objc-runtime-info'
       Generate C header describing the largest structure that is passed
       by value, if any.
  
- 
  
  File: gcc.info,  Node: Language Independent Options,  Next: Warning Options,  Prev: Objective-C and Objective-C++ Dialect Options,  Up: Invoking GCC
  
--- 2963,3177 ----
  Standards, for references.)
  
   This section describes the command-line options that are only
! meaningful for Objective-C and Objective-C++ programs.  You can also use
! most of the language-independent GNU compiler options.  For example, you
! might compile a file 'some_class.m' like this:
  
       gcc -g -fgnu-runtime -O -c some_class.m
  
! In this example, '-fgnu-runtime' is an option meant only for Objective-C
! and Objective-C++ programs; you can use the other options with any
! language supported by GCC.
  
   Note that since Objective-C is an extension of the C language,
  Objective-C compilations may also use options specific to the C
! front-end (e.g., '-Wtraditional').  Similarly, Objective-C++
! compilations may use C++-specific options (e.g., '-Wabi').
  
!  Here is a list of options that are _only_ for compiling Objective-C and
! Objective-C++ programs:
  
! '-fconstant-string-class=CLASS-NAME'
       Use CLASS-NAME as the name of the class to instantiate for each
!      literal string specified with the syntax '@"..."'.  The default
!      class name is 'NXConstantString' if the GNU runtime is being used,
!      and 'NSConstantString' if the NeXT runtime is being used (see
!      below).  The '-fconstant-cfstrings' option, if also present,
!      overrides the '-fconstant-string-class' setting and cause '@"..."'
       literals to be laid out as constant CoreFoundation strings.
  
! '-fgnu-runtime'
       Generate object code compatible with the standard GNU Objective-C
       runtime.  This is the default for most types of systems.
  
! '-fnext-runtime'
       Generate output compatible with the NeXT runtime.  This is the
!      default for NeXT-based systems, including Darwin and Mac OS X.  The
!      macro '__NEXT_RUNTIME__' is predefined if (and only if) this option
!      is used.
  
! '-fno-nil-receivers'
!      Assume that all Objective-C message dispatches ('[receiver
       message:arg]') in this translation unit ensure that the receiver is
!      not 'nil'.  This allows for more efficient entry points in the
       runtime to be used.  This option is only available in conjunction
       with the NeXT runtime and ABI version 0 or 1.
  
! '-fobjc-abi-version=N'
       Use version N of the Objective-C ABI for the selected runtime.
       This option is currently supported only for the NeXT runtime.  In
       that case, Version 0 is the traditional (32-bit) ABI without
       support for properties and other Objective-C 2.0 additions.
       Version 1 is the traditional (32-bit) ABI with support for
       properties and other Objective-C 2.0 additions.  Version 2 is the
!      modern (64-bit) ABI. If nothing is specified, the default is
!      Version 0 on 32-bit target machines, and Version 2 on 64-bit target
!      machines.
  
! '-fobjc-call-cxx-cdtors'
       For each Objective-C class, check if any of its instance variables
       is a C++ object with a non-trivial default constructor.  If so,
!      synthesize a special '- (id) .cxx_construct' instance method which
       runs non-trivial default constructors on any such instance
!      variables, in order, and then return 'self'.  Similarly, check if
       any instance variable is a C++ object with a non-trivial
!      destructor, and if so, synthesize a special '- (void)
       .cxx_destruct' method which runs all such default destructors, in
       reverse order.
  
!      The '- (id) .cxx_construct' and '- (void) .cxx_destruct' methods
!      thusly generated only operate on instance variables declared in the
!      current Objective-C class, and not those inherited from
       superclasses.  It is the responsibility of the Objective-C runtime
       to invoke all such methods in an object's inheritance hierarchy.
!      The '- (id) .cxx_construct' methods are invoked by the runtime
!      immediately after a new object instance is allocated; the '- (void)
!      .cxx_destruct' methods are invoked immediately before the runtime
!      deallocates an object instance.
  
       As of this writing, only the NeXT runtime on Mac OS X 10.4 and
!      later has support for invoking the '- (id) .cxx_construct' and '-
       (void) .cxx_destruct' methods.
  
! '-fobjc-direct-dispatch'
       Allow fast jumps to the message dispatcher.  On Darwin this is
       accomplished via the comm page.
  
! '-fobjc-exceptions'
       Enable syntactic support for structured exception handling in
       Objective-C, similar to what is offered by C++ and Java.  This
!      option is required to use the Objective-C keywords '@try',
!      '@throw', '@catch', '@finally' and '@synchronized'.  This option is
!      available with both the GNU runtime and the NeXT runtime (but not
!      available in conjunction with the NeXT runtime on Mac OS X 10.2 and
!      earlier).
  
! '-fobjc-gc'
       Enable garbage collection (GC) in Objective-C and Objective-C++
       programs.  This option is only available with the NeXT runtime; the
       GNU runtime has a different garbage collection implementation that
       does not require special compiler flags.
  
! '-fobjc-nilcheck'
       For the NeXT runtime with version 2 of the ABI, check for a nil
       receiver in method invocations before doing the actual method call.
!      This is the default and can be disabled using '-fno-objc-nilcheck'.
!      Class methods and super calls are never checked for nil in this way
!      no matter what this flag is set to.  Currently this flag does
!      nothing when the GNU runtime, or an older version of the NeXT
!      runtime ABI, is used.
  
! '-fobjc-std=objc1'
       Conform to the language syntax of Objective-C 1.0, the language
!      recognized by GCC 4.0.  This only affects the Objective-C additions
!      to the C/C++ language; it does not affect conformance to C/C++
!      standards, which is controlled by the separate C/C++ dialect option
!      flags.  When this option is used with the Objective-C or
       Objective-C++ compiler, any Objective-C syntax that is not
       recognized by GCC 4.0 is rejected.  This is useful if you need to
       make sure that your Objective-C code can be compiled with older
       versions of GCC.
  
! '-freplace-objc-classes'
!      Emit a special marker instructing 'ld(1)' not to statically link in
!      the resulting object file, and allow 'dyld(1)' to load it in at run
!      time instead.  This is used in conjunction with the
       Fix-and-Continue debugging mode, where the object file in question
!      may be recompiled and dynamically reloaded in the course of program
!      execution, without the need to restart the program itself.
       Currently, Fix-and-Continue functionality is only available in
       conjunction with the NeXT runtime on Mac OS X 10.3 and later.
  
! '-fzero-link'
       When compiling for the NeXT runtime, the compiler ordinarily
!      replaces calls to 'objc_getClass("...")' (when the name of the
       class is known at compile time) with static class references that
       get initialized at load time, which improves run-time performance.
!      Specifying the '-fzero-link' flag suppresses this behavior and
!      causes calls to 'objc_getClass("...")' to be retained.  This is
       useful in Zero-Link debugging mode, since it allows for individual
!      class implementations to be modified during program execution.  The
!      GNU runtime currently always retains calls to
!      'objc_get_class("...")' regardless of command-line options.
  
! '-fno-local-ivars'
       By default instance variables in Objective-C can be accessed as if
       they were local variables from within the methods of the class
       they're declared in.  This can lead to shadowing between instance
       variables and other variables declared either locally inside a
       class method or globally with the same name.  Specifying the
!      '-fno-local-ivars' flag disables this behavior thus avoiding
       variable shadowing issues.
  
! '-fivar-visibility=[public|protected|private|package]'
       Set the default instance variable visibility to the specified
!      option so that instance variables declared outside the scope of any
!      access modifier directives default to the specified visibility.
  
! '-gen-decls'
!      Dump interface declarations for all classes seen in the source file
!      to a file named 'SOURCENAME.decl'.
  
! '-Wassign-intercept (Objective-C and Objective-C++ only)'
       Warn whenever an Objective-C assignment is being intercepted by the
       garbage collector.
  
! '-Wno-protocol (Objective-C and Objective-C++ only)'
!      If a class is declared to implement a protocol, a warning is issued
!      for every method in the protocol that is not implemented by the
!      class.  The default behavior is to issue a warning for every method
!      not explicitly implemented in the class, even if a method
       implementation is inherited from the superclass.  If you use the
!      '-Wno-protocol' option, then methods inherited from the superclass
       are considered to be implemented, and no warning is issued for
       them.
  
! '-Wselector (Objective-C and Objective-C++ only)'
       Warn if multiple methods of different types for the same selector
       are found during compilation.  The check is performed on the list
       of methods in the final stage of compilation.  Additionally, a
       check is performed for each selector appearing in a
!      '@selector(...)' expression, and a corresponding method for that
       selector has been found during compilation.  Because these checks
       scan the method table only at the end of compilation, these
       warnings are not produced if the final stage of compilation is not
       reached, for example because an error is found during compilation,
!      or because the '-fsyntax-only' option is being used.
  
! '-Wstrict-selector-match (Objective-C and Objective-C++ only)'
       Warn if multiple methods with differing argument and/or return
       types are found for a given selector when attempting to send a
!      message using this selector to a receiver of type 'id' or 'Class'.
!      When this flag is off (which is the default behavior), the compiler
!      omits such warnings if any differences found are confined to types
!      that share the same size and alignment.
  
! '-Wundeclared-selector (Objective-C and Objective-C++ only)'
!      Warn if a '@selector(...)' expression referring to an undeclared
       selector is found.  A selector is considered undeclared if no
!      method with that name has been declared before the '@selector(...)'
!      expression, either explicitly in an '@interface' or '@protocol'
!      declaration, or implicitly in an '@implementation' section.  This
!      option always performs its checks as soon as a '@selector(...)'
!      expression is found, while '-Wselector' only performs its checks in
!      the final stage of compilation.  This also enforces the coding
!      style convention that methods and selectors must be declared before
!      being used.
  
! '-print-objc-runtime-info'
       Generate C header describing the largest structure that is passed
       by value, if any.
  
  
  File: gcc.info,  Node: Language Independent Options,  Next: Warning Options,  Prev: Objective-C and Objective-C++ Dialect Options,  Up: Invoking GCC
  
*************** File: gcc.info,  Node: Language Independ
*** 3196,3294 ****
  Traditionally, diagnostic messages have been formatted irrespective of
  the output device's aspect (e.g. its width, ...).  You can use the
  options described below to control the formatting algorithm for
! diagnostic messages, e.g. how many characters per line, how often
! source location information should be reported.  Note that some
! language front ends may not honor these options.
  
! `-fmessage-length=N'
       Try to format error messages so that they fit on lines of about N
       characters.  If N is zero, then no line-wrapping is done; each
       error message appears on a single line.  This is the default for
       all front ends.
  
! `-fdiagnostics-show-location=once'
       Only meaningful in line-wrapping mode.  Instructs the diagnostic
       messages reporter to emit source location information _once_; that
       is, in case the message is too long to fit on a single physical
       line and has to be wrapped, the source location won't be emitted
!      (as prefix) again, over and over, in subsequent continuation
!      lines.  This is the default behavior.
  
! `-fdiagnostics-show-location=every-line'
       Only meaningful in line-wrapping mode.  Instructs the diagnostic
       messages reporter to emit the same source location information (as
       prefix) for physical lines that result from the process of breaking
       a message which is too long to fit on a single line.
  
! `-fdiagnostics-color[=WHEN]'
! `-fno-diagnostics-color'
!      Use color in diagnostics.  WHEN is `never', `always', or `auto'.
!      The default depends on how the compiler has been configured, it
!      can be any of the above WHEN options or also `never' if
!      `GCC_COLORS' environment variable isn't present in the environment,
!      and `auto' otherwise.  `auto' means to use color only when the
!      standard error is a terminal.  The forms `-fdiagnostics-color' and
!      `-fno-diagnostics-color' are aliases for
!      `-fdiagnostics-color=always' and `-fdiagnostics-color=never',
       respectively.
  
!      The colors are defined by the environment variable `GCC_COLORS'.
       Its value is a colon-separated list of capabilities and Select
!      Graphic Rendition (SGR) substrings. SGR commands are interpreted
       by the terminal or terminal emulator.  (See the section in the
       documentation of your text terminal for permitted values and their
       meanings as character attributes.)  These substring values are
       integers in decimal representation and can be concatenated with
!      semicolons.  Common values to concatenate include `1' for bold,
!      `4' for underline, `5' for blink, `7' for inverse, `39' for
!      default foreground color, `30' to `37' for foreground colors, `90'
!      to `97' for 16-color mode foreground colors, `38;5;0' to `38;5;255'
!      for 88-color and 256-color modes foreground colors, `49' for
!      default background color, `40' to `47' for background colors,
!      `100' to `107' for 16-color mode background colors, and `48;5;0'
!      to `48;5;255' for 88-color and 256-color modes background colors.
  
!      The default `GCC_COLORS' is
            error=01;31:warning=01;35:note=01;36:caret=01;32:locus=01:quote=01
!      where `01;31' is bold red, `01;35' is bold magenta, `01;36' is
!      bold cyan, `01;32' is bold green and `01' is bold. Setting
!      `GCC_COLORS' to the empty string disables colors.  Supported
!      capabilities are as follows.
  
!     `error='
            SGR substring for error: markers.
  
!     `warning='
            SGR substring for warning: markers.
  
!     `note='
            SGR substring for note: markers.
  
!     `caret='
            SGR substring for caret line.
  
!     `locus='
!           SGR substring for location information, `file:line' or
!           `file:line:column' etc.
  
!     `quote='
            SGR substring for information printed within quotes.
  
! `-fno-diagnostics-show-option'
       By default, each diagnostic emitted includes text indicating the
       command-line option that directly controls the diagnostic (if such
       an option is known to the diagnostic machinery).  Specifying the
!      `-fno-diagnostics-show-option' flag suppresses that behavior.
  
! `-fno-diagnostics-show-caret'
       By default, each diagnostic emitted includes the original source
!      line and a caret '^' indicating the column.  This option
!      suppresses this information.  The source line is truncated to N
!      characters, if the `-fmessage-length=n' option is given.  When the
!      output is done to the terminal, the width is limited to the width
!      given by the `COLUMNS' environment variable or, if not set, to the
!      terminal width.
! 
  
  
  File: gcc.info,  Node: Warning Options,  Next: Debugging Options,  Prev: Language Independent Options,  Up: Invoking GCC
--- 3181,3278 ----
  Traditionally, diagnostic messages have been formatted irrespective of
  the output device's aspect (e.g. its width, ...).  You can use the
  options described below to control the formatting algorithm for
! diagnostic messages, e.g. how many characters per line, how often source
! location information should be reported.  Note that some language front
! ends may not honor these options.
  
! '-fmessage-length=N'
       Try to format error messages so that they fit on lines of about N
       characters.  If N is zero, then no line-wrapping is done; each
       error message appears on a single line.  This is the default for
       all front ends.
  
! '-fdiagnostics-show-location=once'
       Only meaningful in line-wrapping mode.  Instructs the diagnostic
       messages reporter to emit source location information _once_; that
       is, in case the message is too long to fit on a single physical
       line and has to be wrapped, the source location won't be emitted
!      (as prefix) again, over and over, in subsequent continuation lines.
!      This is the default behavior.
  
! '-fdiagnostics-show-location=every-line'
       Only meaningful in line-wrapping mode.  Instructs the diagnostic
       messages reporter to emit the same source location information (as
       prefix) for physical lines that result from the process of breaking
       a message which is too long to fit on a single line.
  
! '-fdiagnostics-color[=WHEN]'
! '-fno-diagnostics-color'
!      Use color in diagnostics.  WHEN is 'never', 'always', or 'auto'.
!      The default depends on how the compiler has been configured, it can
!      be any of the above WHEN options or also 'never' if 'GCC_COLORS'
!      environment variable isn't present in the environment, and 'auto'
!      otherwise.  'auto' means to use color only when the standard error
!      is a terminal.  The forms '-fdiagnostics-color' and
!      '-fno-diagnostics-color' are aliases for
!      '-fdiagnostics-color=always' and '-fdiagnostics-color=never',
       respectively.
  
!      The colors are defined by the environment variable 'GCC_COLORS'.
       Its value is a colon-separated list of capabilities and Select
!      Graphic Rendition (SGR) substrings.  SGR commands are interpreted
       by the terminal or terminal emulator.  (See the section in the
       documentation of your text terminal for permitted values and their
       meanings as character attributes.)  These substring values are
       integers in decimal representation and can be concatenated with
!      semicolons.  Common values to concatenate include '1' for bold, '4'
!      for underline, '5' for blink, '7' for inverse, '39' for default
!      foreground color, '30' to '37' for foreground colors, '90' to '97'
!      for 16-color mode foreground colors, '38;5;0' to '38;5;255' for
!      88-color and 256-color modes foreground colors, '49' for default
!      background color, '40' to '47' for background colors, '100' to
!      '107' for 16-color mode background colors, and '48;5;0' to
!      '48;5;255' for 88-color and 256-color modes background colors.
  
!      The default 'GCC_COLORS' is
            error=01;31:warning=01;35:note=01;36:caret=01;32:locus=01:quote=01
!      where '01;31' is bold red, '01;35' is bold magenta, '01;36' is bold
!      cyan, '01;32' is bold green and '01' is bold.  Setting 'GCC_COLORS'
!      to the empty string disables colors.  Supported capabilities are as
!      follows.
  
!      'error='
            SGR substring for error: markers.
  
!      'warning='
            SGR substring for warning: markers.
  
!      'note='
            SGR substring for note: markers.
  
!      'caret='
            SGR substring for caret line.
  
!      'locus='
!           SGR substring for location information, 'file:line' or
!           'file:line:column' etc.
  
!      'quote='
            SGR substring for information printed within quotes.
  
! '-fno-diagnostics-show-option'
       By default, each diagnostic emitted includes text indicating the
       command-line option that directly controls the diagnostic (if such
       an option is known to the diagnostic machinery).  Specifying the
!      '-fno-diagnostics-show-option' flag suppresses that behavior.
  
! '-fno-diagnostics-show-caret'
       By default, each diagnostic emitted includes the original source
!      line and a caret '^' indicating the column.  This option suppresses
!      this information.  The source line is truncated to N characters, if
!      the '-fmessage-length=n' option is given.  When the output is done
!      to the terminal, the width is limited to the width given by the
!      'COLUMNS' environment variable or, if not set, to the terminal
!      width.
  
  
  File: gcc.info,  Node: Warning Options,  Next: Debugging Options,  Prev: Language Independent Options,  Up: Invoking GCC
*************** an error.
*** 3303,3428 ****
   The following language-independent options do not enable specific
  warnings but control the kinds of diagnostics produced by GCC.
  
! `-fsyntax-only'
       Check the code for syntax errors, but don't do anything beyond
       that.
  
! `-fmax-errors=N'
       Limits the maximum number of error messages to N, at which point
       GCC bails out rather than attempting to continue processing the
       source code.  If N is 0 (the default), there is no limit on the
!      number of error messages produced.  If `-Wfatal-errors' is also
!      specified, then `-Wfatal-errors' takes precedence over this option.
  
! `-w'
       Inhibit all warning messages.
  
! `-Werror'
       Make all warnings into errors.
  
! `-Werror='
       Make the specified warning into an error.  The specifier for a
!      warning is appended; for example `-Werror=switch' turns the
!      warnings controlled by `-Wswitch' into errors.  This switch takes a
!      negative form, to be used to negate `-Werror' for specific
!      warnings; for example `-Wno-error=switch' makes `-Wswitch'
!      warnings not be errors, even when `-Werror' is in effect.
  
       The warning message for each controllable warning includes the
       option that controls the warning.  That option can then be used
!      with `-Werror=' and `-Wno-error=' as described above.  (Printing
!      of the option in the warning message can be disabled using the
!      `-fno-diagnostics-show-option' flag.)
  
!      Note that specifying `-Werror='FOO automatically implies `-W'FOO.
!      However, `-Wno-error='FOO does not imply anything.
  
! `-Wfatal-errors'
       This option causes the compiler to abort compilation on the first
       error occurred rather than trying to keep going and printing
       further error messages.
  
- 
   You can request many specific warnings with options beginning with
! `-W', for example `-Wimplicit' to request warnings on implicit
  declarations.  Each of these specific warning options also has a
! negative form beginning `-Wno-' to turn off warnings; for example,
! `-Wno-implicit'.  This manual lists only one of the two forms,
! whichever is not the default.  For further language-specific options
! also refer to *note C++ Dialect Options:: and *note Objective-C and
! Objective-C++ Dialect Options::.
  
!  Some options, such as `-Wall' and `-Wextra', turn on other options,
! such as `-Wunused', which may turn on further options, such as
! `-Wunused-value'. The combined effect of positive and negative forms is
  that more specific options have priority over less specific ones,
! independently of their position in the command-line. For options of the
! same specificity, the last one takes effect. Options enabled or
! disabled via pragmas (*note Diagnostic Pragmas::) take effect as if
! they appeared at the end of the command-line.
  
   When an unrecognized warning option is requested (e.g.,
! `-Wunknown-warning'), GCC emits a diagnostic stating that the option is
! not recognized.  However, if the `-Wno-' form is used, the behavior is
! slightly different: no diagnostic is produced for
! `-Wno-unknown-warning' unless other diagnostics are being produced.
! This allows the use of new `-Wno-' options with old compilers, but if
! something goes wrong, the compiler warns that an unrecognized option is
! present.
  
! `-Wpedantic'
! `-pedantic'
!      Issue all the warnings demanded by strict ISO C and ISO C++;
!      reject all programs that use forbidden extensions, and some other
!      programs that do not follow ISO C and ISO C++.  For ISO C, follows
!      the version of the ISO C standard specified by any `-std' option
!      used.
  
       Valid ISO C and ISO C++ programs should compile properly with or
!      without this option (though a rare few require `-ansi' or a `-std'
!      option specifying the required version of ISO C).  However,
!      without this option, certain GNU extensions and traditional C and
!      C++ features are supported as well.  With this option, they are
       rejected.
  
!      `-Wpedantic' does not cause warning messages for use of the
!      alternate keywords whose names begin and end with `__'.  Pedantic
       warnings are also disabled in the expression that follows
!      `__extension__'.  However, only system header files should use
!      these escape routes; application programs should avoid them.
!      *Note Alternate Keywords::.
  
!      Some users try to use `-Wpedantic' to check programs for strict ISO
       C conformance.  They soon find that it does not do quite what they
       want: it finds some non-ISO practices, but not all--only those for
       which ISO C _requires_ a diagnostic, and some others for which
       diagnostics have been added.
  
!      A feature to report any failure to conform to ISO C might be
!      useful in some instances, but would require considerable
!      additional work and would be quite different from `-Wpedantic'.
!      We don't have plans to support such a feature in the near future.
  
!      Where the standard specified with `-std' represents a GNU extended
!      dialect of C, such as `gnu90' or `gnu99', there is a corresponding
       "base standard", the version of ISO C on which the GNU extended
!      dialect is based.  Warnings from `-Wpedantic' are given where they
       are required by the base standard.  (It does not make sense for
       such warnings to be given only for features not in the specified
       GNU C dialect, since by definition the GNU dialects of C include
!      all features the compiler supports with the given option, and
!      there would be nothing to warn about.)
  
! `-pedantic-errors'
!      Give an error whenever the "base standard" (see `-Wpedantic')
       requires a diagnostic, in some cases where there is undefined
       behavior at compile-time and in some other cases that do not
       prevent compilation of programs that are valid according to the
!      standard. This is not equivalent to `-Werror=pedantic', since
       there are errors enabled by this option and not enabled by the
       latter and vice versa.
  
! `-Wall'
       This enables all the warnings about constructions that some users
       consider questionable, and that are easy to avoid (or modify to
       prevent the warning), even in conjunction with macros.  This also
--- 3287,3409 ----
   The following language-independent options do not enable specific
  warnings but control the kinds of diagnostics produced by GCC.
  
! '-fsyntax-only'
       Check the code for syntax errors, but don't do anything beyond
       that.
  
! '-fmax-errors=N'
       Limits the maximum number of error messages to N, at which point
       GCC bails out rather than attempting to continue processing the
       source code.  If N is 0 (the default), there is no limit on the
!      number of error messages produced.  If '-Wfatal-errors' is also
!      specified, then '-Wfatal-errors' takes precedence over this option.
  
! '-w'
       Inhibit all warning messages.
  
! '-Werror'
       Make all warnings into errors.
  
! '-Werror='
       Make the specified warning into an error.  The specifier for a
!      warning is appended; for example '-Werror=switch' turns the
!      warnings controlled by '-Wswitch' into errors.  This switch takes a
!      negative form, to be used to negate '-Werror' for specific
!      warnings; for example '-Wno-error=switch' makes '-Wswitch' warnings
!      not be errors, even when '-Werror' is in effect.
  
       The warning message for each controllable warning includes the
       option that controls the warning.  That option can then be used
!      with '-Werror=' and '-Wno-error=' as described above.  (Printing of
!      the option in the warning message can be disabled using the
!      '-fno-diagnostics-show-option' flag.)
  
!      Note that specifying '-Werror='FOO automatically implies '-W'FOO.
!      However, '-Wno-error='FOO does not imply anything.
  
! '-Wfatal-errors'
       This option causes the compiler to abort compilation on the first
       error occurred rather than trying to keep going and printing
       further error messages.
  
   You can request many specific warnings with options beginning with
! '-W', for example '-Wimplicit' to request warnings on implicit
  declarations.  Each of these specific warning options also has a
! negative form beginning '-Wno-' to turn off warnings; for example,
! '-Wno-implicit'.  This manual lists only one of the two forms, whichever
! is not the default.  For further language-specific options also refer to
! *note C++ Dialect Options:: and *note Objective-C and Objective-C++
! Dialect Options::.
  
!  Some options, such as '-Wall' and '-Wextra', turn on other options,
! such as '-Wunused', which may turn on further options, such as
! '-Wunused-value'.  The combined effect of positive and negative forms is
  that more specific options have priority over less specific ones,
! independently of their position in the command-line.  For options of the
! same specificity, the last one takes effect.  Options enabled or
! disabled via pragmas (*note Diagnostic Pragmas::) take effect as if they
! appeared at the end of the command-line.
  
   When an unrecognized warning option is requested (e.g.,
! '-Wunknown-warning'), GCC emits a diagnostic stating that the option is
! not recognized.  However, if the '-Wno-' form is used, the behavior is
! slightly different: no diagnostic is produced for '-Wno-unknown-warning'
! unless other diagnostics are being produced.  This allows the use of new
! '-Wno-' options with old compilers, but if something goes wrong, the
! compiler warns that an unrecognized option is present.
  
! '-Wpedantic'
! '-pedantic'
!      Issue all the warnings demanded by strict ISO C and ISO C++; reject
!      all programs that use forbidden extensions, and some other programs
!      that do not follow ISO C and ISO C++.  For ISO C, follows the
!      version of the ISO C standard specified by any '-std' option used.
  
       Valid ISO C and ISO C++ programs should compile properly with or
!      without this option (though a rare few require '-ansi' or a '-std'
!      option specifying the required version of ISO C).  However, without
!      this option, certain GNU extensions and traditional C and C++
!      features are supported as well.  With this option, they are
       rejected.
  
!      '-Wpedantic' does not cause warning messages for use of the
!      alternate keywords whose names begin and end with '__'.  Pedantic
       warnings are also disabled in the expression that follows
!      '__extension__'.  However, only system header files should use
!      these escape routes; application programs should avoid them.  *Note
!      Alternate Keywords::.
  
!      Some users try to use '-Wpedantic' to check programs for strict ISO
       C conformance.  They soon find that it does not do quite what they
       want: it finds some non-ISO practices, but not all--only those for
       which ISO C _requires_ a diagnostic, and some others for which
       diagnostics have been added.
  
!      A feature to report any failure to conform to ISO C might be useful
!      in some instances, but would require considerable additional work
!      and would be quite different from '-Wpedantic'.  We don't have
!      plans to support such a feature in the near future.
  
!      Where the standard specified with '-std' represents a GNU extended
!      dialect of C, such as 'gnu90' or 'gnu99', there is a corresponding
       "base standard", the version of ISO C on which the GNU extended
!      dialect is based.  Warnings from '-Wpedantic' are given where they
       are required by the base standard.  (It does not make sense for
       such warnings to be given only for features not in the specified
       GNU C dialect, since by definition the GNU dialects of C include
!      all features the compiler supports with the given option, and there
!      would be nothing to warn about.)
  
! '-pedantic-errors'
!      Give an error whenever the "base standard" (see '-Wpedantic')
       requires a diagnostic, in some cases where there is undefined
       behavior at compile-time and in some other cases that do not
       prevent compilation of programs that are valid according to the
!      standard.  This is not equivalent to '-Werror=pedantic', since
       there are errors enabled by this option and not enabled by the
       latter and vice versa.
  
! '-Wall'
       This enables all the warnings about constructions that some users
       consider questionable, and that are easy to avoid (or modify to
       prevent the warning), even in conjunction with macros.  This also
*************** present.
*** 3430,3439 ****
       Dialect Options:: and *note Objective-C and Objective-C++ Dialect
       Options::.
  
!      `-Wall' turns on the following warning flags:
  
            -Waddress
!           -Warray-bounds=1 (only with `-O2')
            -Wc++11-compat  -Wc++14-compat
            -Wchar-subscripts
            -Wenum-compare (in C/ObjC; this is on by default in C++)
--- 3411,3420 ----
       Dialect Options:: and *note Objective-C and Objective-C++ Dialect
       Options::.
  
!      '-Wall' turns on the following warning flags:
  
            -Waddress
!           -Warray-bounds=1 (only with -O2)
            -Wc++11-compat  -Wc++14-compat
            -Wchar-subscripts
            -Wenum-compare (in C/ObjC; this is on by default in C++)
*************** present.
*** 3441,3447 ****
            -Wimplicit-function-declaration (C and Objective-C only)
            -Wcomment
            -Wformat
!           -Wmain (only for C/ObjC and unless `-ffreestanding')
            -Wmaybe-uninitialized
            -Wmissing-braces (only for C/ObjC)
            -Wnonnull
--- 3422,3428 ----
            -Wimplicit-function-declaration (C and Objective-C only)
            -Wcomment
            -Wformat
!           -Wmain (only for C/ObjC and unless -ffreestanding)
            -Wmaybe-uninitialized
            -Wmissing-braces (only for C/ObjC)
            -Wnonnull
*************** present.
*** 3464,3480 ****
            -Wunused-variable
            -Wvolatile-register-var
  
!      Note that some warning flags are not implied by `-Wall'.  Some of
       them warn about constructions that users generally do not consider
       questionable, but which occasionally you might wish to check for;
!      others warn about constructions that are necessary or hard to
!      avoid in some cases, and there is no simple way to modify the code
!      to suppress the warning. Some of them are enabled by `-Wextra' but
       many of them must be enabled individually.
  
! `-Wextra'
       This enables some extra warning flags that are not enabled by
!      `-Wall'. (This option used to be called `-W'.  The older name is
       still supported, but the newer name is more descriptive.)
  
            -Wclobbered
--- 3445,3462 ----
            -Wunused-variable
            -Wvolatile-register-var
  
! 
!      Note that some warning flags are not implied by '-Wall'.  Some of
       them warn about constructions that users generally do not consider
       questionable, but which occasionally you might wish to check for;
!      others warn about constructions that are necessary or hard to avoid
!      in some cases, and there is no simple way to modify the code to
!      suppress the warning.  Some of them are enabled by '-Wextra' but
       many of them must be enabled individually.
  
! '-Wextra'
       This enables some extra warning flags that are not enabled by
!      '-Wall'.  (This option used to be called '-W'.  The older name is
       still supported, but the newer name is more descriptive.)
  
            -Wclobbered
*************** present.
*** 3487,3500 ****
            -Wsign-compare
            -Wtype-limits
            -Wuninitialized
!           -Wunused-parameter (only with `-Wunused' or `-Wall')
!           -Wunused-but-set-parameter (only with `-Wunused' or `-Wall')
  
-      The option `-Wextra' also prints warning messages for the
-      following cases:
  
!         * A pointer is compared against integer zero with `<', `<=',
!           `>', or `>='.
  
          * (C++ only) An enumerator and a non-enumerator both appear in a
            conditional expression.
--- 3469,3483 ----
            -Wsign-compare
            -Wtype-limits
            -Wuninitialized
!           -Wunused-parameter (only with -Wunused or -Wall)
!           -Wunused-but-set-parameter (only with -Wunused or -Wall)
  
  
!      The option '-Wextra' also prints warning messages for the following
!      cases:
! 
!         * A pointer is compared against integer zero with '<', '<=',
!           '>', or '>='.
  
          * (C++ only) An enumerator and a non-enumerator both appear in a
            conditional expression.
*************** present.
*** 3502,3735 ****
          * (C++ only) Ambiguous virtual bases.
  
          * (C++ only) Subscripting an array that has been declared
!           `register'.
  
          * (C++ only) Taking the address of a variable that has been
!           declared `register'.
  
          * (C++ only) A base class is not initialized in a derived
            class's copy constructor.
  
! 
! `-Wchar-subscripts'
!      Warn if an array subscript has type `char'.  This is a common cause
       of error, as programmers often forget that this type is signed on
!      some machines.  This warning is enabled by `-Wall'.
  
! `-Wcomment'
!      Warn whenever a comment-start sequence `/*' appears in a `/*'
!      comment, or whenever a Backslash-Newline appears in a `//' comment.
!      This warning is enabled by `-Wall'.
  
! `-Wno-coverage-mismatch'
       Warn if feedback profiles do not match when using the
!      `-fprofile-use' option.  If a source file is changed between
!      compiling with `-fprofile-gen' and with `-fprofile-use', the files
!      with the profile feedback can fail to match the source file and
!      GCC cannot use the profile feedback information.  By default, this
       warning is enabled and is treated as an error.
!      `-Wno-coverage-mismatch' can be used to disable the warning or
!      `-Wno-error=coverage-mismatch' can be used to disable the error.
!      Disabling the error for this warning can result in poorly
!      optimized code and is useful only in the case of very minor
!      changes such as bug fixes to an existing code-base.  Completely
!      disabling the warning is not recommended.
  
! `-Wno-cpp'
       (C, Objective-C, C++, Objective-C++ and Fortran only)
  
!      Suppress warning messages emitted by `#warning' directives.
  
! `-Wdouble-promotion (C, C++, Objective-C and Objective-C++ only)'
!      Give a warning when a value of type `float' is implicitly promoted
!      to `double'.  CPUs with a 32-bit "single-precision" floating-point
!      unit implement `float' in hardware, but emulate `double' in
!      software.  On such a machine, doing computations using `double'
       values is much more expensive because of the overhead required for
       software emulation.
  
!      It is easy to accidentally do computations with `double' because
!      floating-point literals are implicitly of type `double'.  For
       example, in:
            float area(float radius)
            {
               return 3.14159 * radius * radius;
            }
!      the compiler performs the entire computation with `double' because
!      the floating-point literal is a `double'.
  
! `-Wformat'
! `-Wformat=N'
!      Check calls to `printf' and `scanf', etc., to make sure that the
       arguments supplied have types appropriate to the format string
       specified, and that the conversions specified in the format string
!      make sense.  This includes standard functions, and others
!      specified by format attributes (*note Function Attributes::), in
!      the `printf', `scanf', `strftime' and `strfmon' (an X/Open
!      extension, not in the C standard) families (or other
!      target-specific families).  Which functions are checked without
!      format attributes having been specified depends on the standard
!      version selected, and such checks of functions without the
!      attribute specified are disabled by `-ffreestanding' or
!      `-fno-builtin'.
  
       The formats are checked against the format features supported by
       GNU libc version 2.2.  These include all ISO C90 and C99 features,
!      as well as features from the Single Unix Specification and some
!      BSD and GNU extensions.  Other library implementations may not
!      support all these features; GCC does not support warning about
!      features that go beyond a particular library's limitations.
!      However, if `-Wpedantic' is used with `-Wformat', warnings are
!      given about format features not in the selected standard version
!      (but not for `strfmon' formats, since those are not in any version
!      of the C standard).  *Note Options Controlling C Dialect: C
!      Dialect Options.
  
!     `-Wformat=1'
!     `-Wformat'
!           Option `-Wformat' is equivalent to `-Wformat=1', and
!           `-Wno-format' is equivalent to `-Wformat=0'.  Since
!           `-Wformat' also checks for null format arguments for several
!           functions, `-Wformat' also implies `-Wnonnull'.  Some aspects
!           of this level of format checking can be disabled by the
!           options: `-Wno-format-contains-nul',
!           `-Wno-format-extra-args', and `-Wno-format-zero-length'.
!           `-Wformat' is enabled by `-Wall'.
  
!     `-Wno-format-contains-nul'
!           If `-Wformat' is specified, do not warn about format strings
            that contain NUL bytes.
  
!     `-Wno-format-extra-args'
!           If `-Wformat' is specified, do not warn about excess
!           arguments to a `printf' or `scanf' format function.  The C
!           standard specifies that such arguments are ignored.
  
            Where the unused arguments lie between used arguments that are
!           specified with `$' operand number specifications, normally
            warnings are still given, since the implementation could not
!           know what type to pass to `va_arg' to skip the unused
!           arguments.  However, in the case of `scanf' formats, this
            option suppresses the warning if the unused arguments are all
            pointers, since the Single Unix Specification says that such
            unused arguments are allowed.
  
!     `-Wno-format-zero-length'
!           If `-Wformat' is specified, do not warn about zero-length
            formats.  The C standard specifies that zero-length formats
            are allowed.
  
!     `-Wformat=2'
!           Enable `-Wformat' plus additional format checks.  Currently
!           equivalent to `-Wformat -Wformat-nonliteral -Wformat-security
            -Wformat-y2k'.
  
!     `-Wformat-nonliteral'
!           If `-Wformat' is specified, also warn if the format string is
            not a string literal and so cannot be checked, unless the
!           format function takes its format arguments as a `va_list'.
  
!     `-Wformat-security'
!           If `-Wformat' is specified, also warn about uses of format
            functions that represent possible security problems.  At
!           present, this warns about calls to `printf' and `scanf'
            functions where the format string is not a string literal and
!           there are no format arguments, as in `printf (foo);'.  This
            may be a security hole if the format string came from
!           untrusted input and contains `%n'.  (This is currently a
!           subset of what `-Wformat-nonliteral' warns about, but in
!           future warnings may be added to `-Wformat-security' that are
!           not included in `-Wformat-nonliteral'.)
  
!     `-Wformat-signedness'
!           If `-Wformat' is specified, also warn if the format string
            requires an unsigned argument and the argument is signed and
            vice versa.
  
!     `-Wformat-y2k'
!           If `-Wformat' is specified, also warn about `strftime'
!           formats that may yield only a two-digit year.
  
! `-Wnonnull'
!      Warn about passing a null pointer for arguments marked as
!      requiring a non-null value by the `nonnull' function attribute.
  
!      `-Wnonnull' is included in `-Wall' and `-Wformat'.  It can be
!      disabled with the `-Wno-nonnull' option.
  
! `-Winit-self (C, C++, Objective-C and Objective-C++ only)'
       Warn about uninitialized variables that are initialized with
       themselves.  Note this option can only be used with the
!      `-Wuninitialized' option.
  
!      For example, GCC warns about `i' being uninitialized in the
!      following snippet only when `-Winit-self' has been specified:
            int f()
            {
              int i = i;
              return i;
            }
  
!      This warning is enabled by `-Wall' in C++.
  
! `-Wimplicit-int (C and Objective-C only)'
       Warn when a declaration does not specify a type.  This warning is
!      enabled by `-Wall'.
  
! `-Wimplicit-function-declaration (C and Objective-C only)'
       Give a warning whenever a function is used before being declared.
!      In C99 mode (`-std=c99' or `-std=gnu99'), this warning is enabled
!      by default and it is made into an error by `-pedantic-errors'.
!      This warning is also enabled by `-Wall'.
  
! `-Wimplicit (C and Objective-C only)'
!      Same as `-Wimplicit-int' and `-Wimplicit-function-declaration'.
!      This warning is enabled by `-Wall'.
  
! `-Wignored-qualifiers (C and C++ only)'
       Warn if the return type of a function has a type qualifier such as
!      `const'.  For ISO C such a type qualifier has no effect, since the
       value returned by a function is not an lvalue.  For C++, the
!      warning is only emitted for scalar types or `void'.  ISO C
!      prohibits qualified `void' return types on function definitions,
!      so such return types always receive a warning even without this
       option.
  
!      This warning is also enabled by `-Wextra'.
  
! `-Wmain'
!      Warn if the type of `main' is suspicious.  `main' should be a
       function with external linkage, returning int, taking either zero
       arguments, two, or three arguments of appropriate types.  This
       warning is enabled by default in C++ and is enabled by either
!      `-Wall' or `-Wpedantic'.
  
! `-Wmissing-braces'
       Warn if an aggregate or union initializer is not fully bracketed.
!      In the following example, the initializer for `a' is not fully
!      bracketed, but that for `b' is fully bracketed.  This warning is
!      enabled by `-Wall' in C.
  
            int a[2][2] = { 0, 1, 2, 3 };
            int b[2][2] = { { 0, 1 }, { 2, 3 } };
  
!      This warning is enabled by `-Wall'.
  
! `-Wmissing-include-dirs (C, C++, Objective-C and Objective-C++ only)'
       Warn if a user-supplied include directory does not exist.
  
! `-Wparentheses'
       Warn if parentheses are omitted in certain contexts, such as when
       there is an assignment in a context where a truth value is
       expected, or when operators are nested whose precedence people
       often get confused about.
  
!      Also warn if a comparison like `x<=y<=z' appears; this is
!      equivalent to `(x<=y ? 1 : 0) <= z', which is a different
       interpretation from that of ordinary mathematical notation.
  
       Also warn about constructions where there may be confusion to which
!      `if' statement an `else' branch belongs.  Here is an example of
       such a case:
  
            {
--- 3485,3718 ----
          * (C++ only) Ambiguous virtual bases.
  
          * (C++ only) Subscripting an array that has been declared
!           'register'.
  
          * (C++ only) Taking the address of a variable that has been
!           declared 'register'.
  
          * (C++ only) A base class is not initialized in a derived
            class's copy constructor.
  
! '-Wchar-subscripts'
!      Warn if an array subscript has type 'char'.  This is a common cause
       of error, as programmers often forget that this type is signed on
!      some machines.  This warning is enabled by '-Wall'.
  
! '-Wcomment'
!      Warn whenever a comment-start sequence '/*' appears in a '/*'
!      comment, or whenever a Backslash-Newline appears in a '//' comment.
!      This warning is enabled by '-Wall'.
  
! '-Wchkp'
!      Warn about an invalid memory access that is found by Pointer Bounds
!      Checker ('-fcheck-pointer-bounds').
! 
! '-Wno-coverage-mismatch'
       Warn if feedback profiles do not match when using the
!      '-fprofile-use' option.  If a source file is changed between
!      compiling with '-fprofile-gen' and with '-fprofile-use', the files
!      with the profile feedback can fail to match the source file and GCC
!      cannot use the profile feedback information.  By default, this
       warning is enabled and is treated as an error.
!      '-Wno-coverage-mismatch' can be used to disable the warning or
!      '-Wno-error=coverage-mismatch' can be used to disable the error.
!      Disabling the error for this warning can result in poorly optimized
!      code and is useful only in the case of very minor changes such as
!      bug fixes to an existing code-base.  Completely disabling the
!      warning is not recommended.
  
! '-Wno-cpp'
       (C, Objective-C, C++, Objective-C++ and Fortran only)
  
!      Suppress warning messages emitted by '#warning' directives.
  
! '-Wdouble-promotion (C, C++, Objective-C and Objective-C++ only)'
!      Give a warning when a value of type 'float' is implicitly promoted
!      to 'double'.  CPUs with a 32-bit "single-precision" floating-point
!      unit implement 'float' in hardware, but emulate 'double' in
!      software.  On such a machine, doing computations using 'double'
       values is much more expensive because of the overhead required for
       software emulation.
  
!      It is easy to accidentally do computations with 'double' because
!      floating-point literals are implicitly of type 'double'.  For
       example, in:
            float area(float radius)
            {
               return 3.14159 * radius * radius;
            }
!      the compiler performs the entire computation with 'double' because
!      the floating-point literal is a 'double'.
  
! '-Wformat'
! '-Wformat=N'
!      Check calls to 'printf' and 'scanf', etc., to make sure that the
       arguments supplied have types appropriate to the format string
       specified, and that the conversions specified in the format string
!      make sense.  This includes standard functions, and others specified
!      by format attributes (*note Function Attributes::), in the
!      'printf', 'scanf', 'strftime' and 'strfmon' (an X/Open extension,
!      not in the C standard) families (or other target-specific
!      families).  Which functions are checked without format attributes
!      having been specified depends on the standard version selected, and
!      such checks of functions without the attribute specified are
!      disabled by '-ffreestanding' or '-fno-builtin'.
  
       The formats are checked against the format features supported by
       GNU libc version 2.2.  These include all ISO C90 and C99 features,
!      as well as features from the Single Unix Specification and some BSD
!      and GNU extensions.  Other library implementations may not support
!      all these features; GCC does not support warning about features
!      that go beyond a particular library's limitations.  However, if
!      '-Wpedantic' is used with '-Wformat', warnings are given about
!      format features not in the selected standard version (but not for
!      'strfmon' formats, since those are not in any version of the C
!      standard).  *Note Options Controlling C Dialect: C Dialect Options.
  
!      '-Wformat=1'
!      '-Wformat'
!           Option '-Wformat' is equivalent to '-Wformat=1', and
!           '-Wno-format' is equivalent to '-Wformat=0'.  Since '-Wformat'
!           also checks for null format arguments for several functions,
!           '-Wformat' also implies '-Wnonnull'.  Some aspects of this
!           level of format checking can be disabled by the options:
!           '-Wno-format-contains-nul', '-Wno-format-extra-args', and
!           '-Wno-format-zero-length'.  '-Wformat' is enabled by '-Wall'.
  
!      '-Wno-format-contains-nul'
!           If '-Wformat' is specified, do not warn about format strings
            that contain NUL bytes.
  
!      '-Wno-format-extra-args'
!           If '-Wformat' is specified, do not warn about excess arguments
!           to a 'printf' or 'scanf' format function.  The C standard
!           specifies that such arguments are ignored.
  
            Where the unused arguments lie between used arguments that are
!           specified with '$' operand number specifications, normally
            warnings are still given, since the implementation could not
!           know what type to pass to 'va_arg' to skip the unused
!           arguments.  However, in the case of 'scanf' formats, this
            option suppresses the warning if the unused arguments are all
            pointers, since the Single Unix Specification says that such
            unused arguments are allowed.
  
!      '-Wno-format-zero-length'
!           If '-Wformat' is specified, do not warn about zero-length
            formats.  The C standard specifies that zero-length formats
            are allowed.
  
!      '-Wformat=2'
!           Enable '-Wformat' plus additional format checks.  Currently
!           equivalent to '-Wformat -Wformat-nonliteral -Wformat-security
            -Wformat-y2k'.
  
!      '-Wformat-nonliteral'
!           If '-Wformat' is specified, also warn if the format string is
            not a string literal and so cannot be checked, unless the
!           format function takes its format arguments as a 'va_list'.
  
!      '-Wformat-security'
!           If '-Wformat' is specified, also warn about uses of format
            functions that represent possible security problems.  At
!           present, this warns about calls to 'printf' and 'scanf'
            functions where the format string is not a string literal and
!           there are no format arguments, as in 'printf (foo);'.  This
            may be a security hole if the format string came from
!           untrusted input and contains '%n'.  (This is currently a
!           subset of what '-Wformat-nonliteral' warns about, but in
!           future warnings may be added to '-Wformat-security' that are
!           not included in '-Wformat-nonliteral'.)
  
!      '-Wformat-signedness'
!           If '-Wformat' is specified, also warn if the format string
            requires an unsigned argument and the argument is signed and
            vice versa.
  
!      '-Wformat-y2k'
!           If '-Wformat' is specified, also warn about 'strftime' formats
!           that may yield only a two-digit year.
  
! '-Wnonnull'
!      Warn about passing a null pointer for arguments marked as requiring
!      a non-null value by the 'nonnull' function attribute.
  
!      '-Wnonnull' is included in '-Wall' and '-Wformat'.  It can be
!      disabled with the '-Wno-nonnull' option.
  
! '-Winit-self (C, C++, Objective-C and Objective-C++ only)'
       Warn about uninitialized variables that are initialized with
       themselves.  Note this option can only be used with the
!      '-Wuninitialized' option.
  
!      For example, GCC warns about 'i' being uninitialized in the
!      following snippet only when '-Winit-self' has been specified:
            int f()
            {
              int i = i;
              return i;
            }
  
!      This warning is enabled by '-Wall' in C++.
  
! '-Wimplicit-int (C and Objective-C only)'
       Warn when a declaration does not specify a type.  This warning is
!      enabled by '-Wall'.
  
! '-Wimplicit-function-declaration (C and Objective-C only)'
       Give a warning whenever a function is used before being declared.
!      In C99 mode ('-std=c99' or '-std=gnu99'), this warning is enabled
!      by default and it is made into an error by '-pedantic-errors'.
!      This warning is also enabled by '-Wall'.
  
! '-Wimplicit (C and Objective-C only)'
!      Same as '-Wimplicit-int' and '-Wimplicit-function-declaration'.
!      This warning is enabled by '-Wall'.
  
! '-Wignored-qualifiers (C and C++ only)'
       Warn if the return type of a function has a type qualifier such as
!      'const'.  For ISO C such a type qualifier has no effect, since the
       value returned by a function is not an lvalue.  For C++, the
!      warning is only emitted for scalar types or 'void'.  ISO C
!      prohibits qualified 'void' return types on function definitions, so
!      such return types always receive a warning even without this
       option.
  
!      This warning is also enabled by '-Wextra'.
  
! '-Wmain'
!      Warn if the type of 'main' is suspicious.  'main' should be a
       function with external linkage, returning int, taking either zero
       arguments, two, or three arguments of appropriate types.  This
       warning is enabled by default in C++ and is enabled by either
!      '-Wall' or '-Wpedantic'.
  
! '-Wmissing-braces'
       Warn if an aggregate or union initializer is not fully bracketed.
!      In the following example, the initializer for 'a' is not fully
!      bracketed, but that for 'b' is fully bracketed.  This warning is
!      enabled by '-Wall' in C.
  
            int a[2][2] = { 0, 1, 2, 3 };
            int b[2][2] = { { 0, 1 }, { 2, 3 } };
  
!      This warning is enabled by '-Wall'.
  
! '-Wmissing-include-dirs (C, C++, Objective-C and Objective-C++ only)'
       Warn if a user-supplied include directory does not exist.
  
! '-Wparentheses'
       Warn if parentheses are omitted in certain contexts, such as when
       there is an assignment in a context where a truth value is
       expected, or when operators are nested whose precedence people
       often get confused about.
  
!      Also warn if a comparison like 'x<=y<=z' appears; this is
!      equivalent to '(x<=y ? 1 : 0) <= z', which is a different
       interpretation from that of ordinary mathematical notation.
  
       Also warn about constructions where there may be confusion to which
!      'if' statement an 'else' branch belongs.  Here is an example of
       such a case:
  
            {
*************** present.
*** 3740,3753 ****
                bar ();
            }
  
!      In C/C++, every `else' branch belongs to the innermost possible
!      `if' statement, which in this example is `if (b)'.  This is often
       not what the programmer expected, as illustrated in the above
       example by indentation the programmer chose.  When there is the
       potential for this confusion, GCC issues a warning when this flag
       is specified.  To eliminate the warning, add explicit braces around
!      the innermost `if' statement so there is no way the `else' can
!      belong to the enclosing `if'.  The resulting code looks like this:
  
            {
              if (a)
--- 3723,3736 ----
                bar ();
            }
  
!      In C/C++, every 'else' branch belongs to the innermost possible
!      'if' statement, which in this example is 'if (b)'.  This is often
       not what the programmer expected, as illustrated in the above
       example by indentation the programmer chose.  When there is the
       potential for this confusion, GCC issues a warning when this flag
       is specified.  To eliminate the warning, add explicit braces around
!      the innermost 'if' statement so there is no way the 'else' can
!      belong to the enclosing 'if'.  The resulting code looks like this:
  
            {
              if (a)
*************** present.
*** 3759,3773 ****
                }
            }
  
!      Also warn for dangerous uses of the GNU extension to `?:' with
!      omitted middle operand. When the condition in the `?': operator is
       a boolean expression, the omitted value is always 1.  Often
!      programmers expect it to be a value computed inside the
!      conditional expression instead.
  
!      This warning is enabled by `-Wall'.
  
! `-Wsequence-point'
       Warn about code that may have undefined semantics because of
       violations of sequence point rules in the C and C++ standards.
  
--- 3742,3756 ----
                }
            }
  
!      Also warn for dangerous uses of the GNU extension to '?:' with
!      omitted middle operand.  When the condition in the '?': operator is
       a boolean expression, the omitted value is always 1.  Often
!      programmers expect it to be a value computed inside the conditional
!      expression instead.
  
!      This warning is enabled by '-Wall'.
  
! '-Wsequence-point'
       Warn about code that may have undefined semantics because of
       violations of sequence point rules in the C and C++ standards.
  
*************** present.
*** 3777,3806 ****
       program: those executed before the sequence point, and those
       executed after it.  These occur after the evaluation of a full
       expression (one which is not part of a larger expression), after
!      the evaluation of the first operand of a `&&', `||', `? :' or `,'
       (comma) operator, before a function is called (but after the
       evaluation of its arguments and the expression denoting the called
!      function), and in certain other places.  Other than as expressed
!      by the sequence point rules, the order of evaluation of
!      subexpressions of an expression is not specified.  All these rules
!      describe only a partial order rather than a total order, since,
!      for example, if two functions are called within one expression
!      with no sequence point between them, the order in which the
!      functions are called is not specified.  However, the standards
!      committee have ruled that function calls do not overlap.
  
       It is not specified when between sequence points modifications to
!      the values of objects take effect.  Programs whose behavior
!      depends on this have undefined behavior; the C and C++ standards
!      specify that "Between the previous and next sequence point an
!      object shall have its stored value modified at most once by the
!      evaluation of an expression.  Furthermore, the prior value shall
!      be read only to determine the value to be stored.".  If a program
!      breaks these rules, the results on any particular implementation
!      are entirely unpredictable.
  
!      Examples of code with undefined behavior are `a = a++;', `a[n] =
!      b[n++]' and `a[i++] = i;'.  Some more complicated cases are not
       diagnosed by this option, and it may give an occasional false
       positive result, but in general it has been found fairly effective
       at detecting this sort of problem in programs.
--- 3760,3789 ----
       program: those executed before the sequence point, and those
       executed after it.  These occur after the evaluation of a full
       expression (one which is not part of a larger expression), after
!      the evaluation of the first operand of a '&&', '||', '? :' or ','
       (comma) operator, before a function is called (but after the
       evaluation of its arguments and the expression denoting the called
!      function), and in certain other places.  Other than as expressed by
!      the sequence point rules, the order of evaluation of subexpressions
!      of an expression is not specified.  All these rules describe only a
!      partial order rather than a total order, since, for example, if two
!      functions are called within one expression with no sequence point
!      between them, the order in which the functions are called is not
!      specified.  However, the standards committee have ruled that
!      function calls do not overlap.
  
       It is not specified when between sequence points modifications to
!      the values of objects take effect.  Programs whose behavior depends
!      on this have undefined behavior; the C and C++ standards specify
!      that "Between the previous and next sequence point an object shall
!      have its stored value modified at most once by the evaluation of an
!      expression.  Furthermore, the prior value shall be read only to
!      determine the value to be stored.".  If a program breaks these
!      rules, the results on any particular implementation are entirely
!      unpredictable.
  
!      Examples of code with undefined behavior are 'a = a++;', 'a[n] =
!      b[n++]' and 'a[i++] = i;'.  Some more complicated cases are not
       diagnosed by this option, and it may give an occasional false
       positive result, but in general it has been found fairly effective
       at detecting this sort of problem in programs.
*************** present.
*** 3809,3971 ****
       over the precise meaning of the sequence point rules in subtle
       cases.  Links to discussions of the problem, including proposed
       formal definitions, may be found on the GCC readings page, at
!      `http://gcc.gnu.org/readings.html'.
  
!      This warning is enabled by `-Wall' for C and C++.
  
! `-Wno-return-local-addr'
       Do not warn about returning a pointer (or in C++, a reference) to a
       variable that goes out of scope after the function returns.
  
! `-Wreturn-type'
       Warn whenever a function is defined with a return type that
!      defaults to `int'.  Also warn about any `return' statement with no
!      return value in a function whose return type is not `void'
!      (falling off the end of the function body is considered returning
!      without a value), and about a `return' statement with an
!      expression in a function whose return type is `void'.
  
       For C++, a function without return type always produces a
!      diagnostic message, even when `-Wno-return-type' is specified.
!      The only exceptions are `main' and functions defined in system
!      headers.
  
!      This warning is enabled by `-Wall'.
  
! `-Wshift-count-negative'
!      Warn if shift count is negative. This warning is enabled by
       default.
  
! `-Wshift-count-overflow'
!      Warn if shift count >= width of type. This warning is enabled by
       default.
  
! `-Wswitch'
!      Warn whenever a `switch' statement has an index of enumerated type
!      and lacks a `case' for one or more of the named codes of that
!      enumeration.  (The presence of a `default' label prevents this
!      warning.)  `case' labels outside the enumeration range also
!      provoke warnings when this option is used (even if there is a
!      `default' label).  This warning is enabled by `-Wall'.
  
! `-Wswitch-default'
!      Warn whenever a `switch' statement does not have a `default' case.
  
! `-Wswitch-enum'
!      Warn whenever a `switch' statement has an index of enumerated type
!      and lacks a `case' for one or more of the named codes of that
!      enumeration.  `case' labels outside the enumeration range also
       provoke warnings when this option is used.  The only difference
!      between `-Wswitch' and this option is that this option gives a
       warning about an omitted enumeration code even if there is a
!      `default' label.
  
! `-Wswitch-bool'
!      Warn whenever a `switch' statement has an index of boolean type.
       It is possible to suppress this warning by casting the controlling
!      expression to a type other than `bool'.  For example:
            switch ((int) (a == 4))
              {
              ...
              }
       This warning is enabled by default for C and C++ programs.
  
! `-Wsync-nand (C and C++ only)'
!      Warn when `__sync_fetch_and_nand' and `__sync_nand_and_fetch'
       built-in functions are used.  These functions changed semantics in
       GCC 4.4.
  
! `-Wtrigraphs'
!      Warn if any trigraphs are encountered that might change the
!      meaning of the program (trigraphs within comments are not warned
!      about).  This warning is enabled by `-Wall'.
  
! `-Wunused-but-set-parameter'
       Warn whenever a function parameter is assigned to, but otherwise
       unused (aside from its declaration).
  
!      To suppress this warning use the `unused' attribute (*note
!      Variable Attributes::).
  
!      This warning is also enabled by `-Wunused' together with `-Wextra'.
  
! `-Wunused-but-set-variable'
       Warn whenever a local variable is assigned to, but otherwise unused
!      (aside from its declaration).  This warning is enabled by `-Wall'.
  
!      To suppress this warning use the `unused' attribute (*note
!      Variable Attributes::).
  
!      This warning is also enabled by `-Wunused', which is enabled by
!      `-Wall'.
  
! `-Wunused-function'
       Warn whenever a static function is declared but not defined or a
       non-inline static function is unused.  This warning is enabled by
!      `-Wall'.
  
! `-Wunused-label'
       Warn whenever a label is declared but not used.  This warning is
!      enabled by `-Wall'.
  
!      To suppress this warning use the `unused' attribute (*note
!      Variable Attributes::).
  
! `-Wunused-local-typedefs (C, Objective-C, C++ and Objective-C++ only)'
       Warn when a typedef locally defined in a function is not used.
!      This warning is enabled by `-Wall'.
  
! `-Wunused-parameter'
       Warn whenever a function parameter is unused aside from its
       declaration.
  
!      To suppress this warning use the `unused' attribute (*note
!      Variable Attributes::).
  
! `-Wno-unused-result'
       Do not warn if a caller of a function marked with attribute
!      `warn_unused_result' (*note Function Attributes::) does not use
!      its return value. The default is `-Wunused-result'.
  
! `-Wunused-variable'
       Warn whenever a local variable or non-constant static variable is
       unused aside from its declaration.  This warning is enabled by
!      `-Wall'.
  
!      To suppress this warning use the `unused' attribute (*note
!      Variable Attributes::).
  
! `-Wunused-value'
       Warn whenever a statement computes a result that is explicitly not
!      used. To suppress this warning cast the unused expression to
!      `void'. This includes an expression-statement or the left-hand
!      side of a comma expression that contains no side effects. For
!      example, an expression such as `x[i,j]' causes a warning, while
!      `x[(void)i,j]' does not.
  
!      This warning is enabled by `-Wall'.
  
! `-Wunused'
!      All the above `-Wunused' options combined.
  
       In order to get a warning about an unused function parameter, you
!      must either specify `-Wextra -Wunused' (note that `-Wall' implies
!      `-Wunused'), or separately specify `-Wunused-parameter'.
  
! `-Wuninitialized'
       Warn if an automatic variable is used without first being
!      initialized or if a variable may be clobbered by a `setjmp' call.
!      In C++, warn if a non-static reference or non-static `const' member
       appears in a class without constructors.
  
!      If you want to warn about code that uses the uninitialized value
!      of the variable in its own initializer, use the `-Winit-self'
!      option.
  
       These warnings occur for individual uninitialized or clobbered
       elements of structure, union or array variables as well as for
       variables that are uninitialized or clobbered as a whole.  They do
!      not occur for variables or elements declared `volatile'.  Because
       these warnings depend on optimization, the exact variables or
       elements for which there are warnings depends on the precise
       optimization options and version of GCC used.
--- 3792,3952 ----
       over the precise meaning of the sequence point rules in subtle
       cases.  Links to discussions of the problem, including proposed
       formal definitions, may be found on the GCC readings page, at
!      <http://gcc.gnu.org/readings.html>.
  
!      This warning is enabled by '-Wall' for C and C++.
  
! '-Wno-return-local-addr'
       Do not warn about returning a pointer (or in C++, a reference) to a
       variable that goes out of scope after the function returns.
  
! '-Wreturn-type'
       Warn whenever a function is defined with a return type that
!      defaults to 'int'.  Also warn about any 'return' statement with no
!      return value in a function whose return type is not 'void' (falling
!      off the end of the function body is considered returning without a
!      value), and about a 'return' statement with an expression in a
!      function whose return type is 'void'.
  
       For C++, a function without return type always produces a
!      diagnostic message, even when '-Wno-return-type' is specified.  The
!      only exceptions are 'main' and functions defined in system headers.
  
!      This warning is enabled by '-Wall'.
  
! '-Wshift-count-negative'
!      Warn if shift count is negative.  This warning is enabled by
       default.
  
! '-Wshift-count-overflow'
!      Warn if shift count >= width of type.  This warning is enabled by
       default.
  
! '-Wswitch'
!      Warn whenever a 'switch' statement has an index of enumerated type
!      and lacks a 'case' for one or more of the named codes of that
!      enumeration.  (The presence of a 'default' label prevents this
!      warning.)  'case' labels outside the enumeration range also provoke
!      warnings when this option is used (even if there is a 'default'
!      label).  This warning is enabled by '-Wall'.
  
! '-Wswitch-default'
!      Warn whenever a 'switch' statement does not have a 'default' case.
  
! '-Wswitch-enum'
!      Warn whenever a 'switch' statement has an index of enumerated type
!      and lacks a 'case' for one or more of the named codes of that
!      enumeration.  'case' labels outside the enumeration range also
       provoke warnings when this option is used.  The only difference
!      between '-Wswitch' and this option is that this option gives a
       warning about an omitted enumeration code even if there is a
!      'default' label.
  
! '-Wswitch-bool'
!      Warn whenever a 'switch' statement has an index of boolean type.
       It is possible to suppress this warning by casting the controlling
!      expression to a type other than 'bool'.  For example:
            switch ((int) (a == 4))
              {
              ...
              }
       This warning is enabled by default for C and C++ programs.
  
! '-Wsync-nand (C and C++ only)'
!      Warn when '__sync_fetch_and_nand' and '__sync_nand_and_fetch'
       built-in functions are used.  These functions changed semantics in
       GCC 4.4.
  
! '-Wtrigraphs'
!      Warn if any trigraphs are encountered that might change the meaning
!      of the program (trigraphs within comments are not warned about).
!      This warning is enabled by '-Wall'.
  
! '-Wunused-but-set-parameter'
       Warn whenever a function parameter is assigned to, but otherwise
       unused (aside from its declaration).
  
!      To suppress this warning use the 'unused' attribute (*note Variable
!      Attributes::).
  
!      This warning is also enabled by '-Wunused' together with '-Wextra'.
  
! '-Wunused-but-set-variable'
       Warn whenever a local variable is assigned to, but otherwise unused
!      (aside from its declaration).  This warning is enabled by '-Wall'.
  
!      To suppress this warning use the 'unused' attribute (*note Variable
!      Attributes::).
  
!      This warning is also enabled by '-Wunused', which is enabled by
!      '-Wall'.
  
! '-Wunused-function'
       Warn whenever a static function is declared but not defined or a
       non-inline static function is unused.  This warning is enabled by
!      '-Wall'.
  
! '-Wunused-label'
       Warn whenever a label is declared but not used.  This warning is
!      enabled by '-Wall'.
  
!      To suppress this warning use the 'unused' attribute (*note Variable
!      Attributes::).
  
! '-Wunused-local-typedefs (C, Objective-C, C++ and Objective-C++ only)'
       Warn when a typedef locally defined in a function is not used.
!      This warning is enabled by '-Wall'.
  
! '-Wunused-parameter'
       Warn whenever a function parameter is unused aside from its
       declaration.
  
!      To suppress this warning use the 'unused' attribute (*note Variable
!      Attributes::).
  
! '-Wno-unused-result'
       Do not warn if a caller of a function marked with attribute
!      'warn_unused_result' (*note Function Attributes::) does not use its
!      return value.  The default is '-Wunused-result'.
  
! '-Wunused-variable'
       Warn whenever a local variable or non-constant static variable is
       unused aside from its declaration.  This warning is enabled by
!      '-Wall'.
  
!      To suppress this warning use the 'unused' attribute (*note Variable
!      Attributes::).
  
! '-Wunused-value'
       Warn whenever a statement computes a result that is explicitly not
!      used.  To suppress this warning cast the unused expression to
!      'void'.  This includes an expression-statement or the left-hand
!      side of a comma expression that contains no side effects.  For
!      example, an expression such as 'x[i,j]' causes a warning, while
!      'x[(void)i,j]' does not.
  
!      This warning is enabled by '-Wall'.
  
! '-Wunused'
!      All the above '-Wunused' options combined.
  
       In order to get a warning about an unused function parameter, you
!      must either specify '-Wextra -Wunused' (note that '-Wall' implies
!      '-Wunused'), or separately specify '-Wunused-parameter'.
  
! '-Wuninitialized'
       Warn if an automatic variable is used without first being
!      initialized or if a variable may be clobbered by a 'setjmp' call.
!      In C++, warn if a non-static reference or non-static 'const' member
       appears in a class without constructors.
  
!      If you want to warn about code that uses the uninitialized value of
!      the variable in its own initializer, use the '-Winit-self' option.
  
       These warnings occur for individual uninitialized or clobbered
       elements of structure, union or array variables as well as for
       variables that are uninitialized or clobbered as a whole.  They do
!      not occur for variables or elements declared 'volatile'.  Because
       these warnings depend on optimization, the exact variables or
       elements for which there are warnings depends on the precise
       optimization options and version of GCC used.
*************** present.
*** 3975,3989 ****
       computations may be deleted by data flow analysis before the
       warnings are printed.
  
! `-Wmaybe-uninitialized'
       For an automatic variable, if there exists a path from the function
       entry to a use of the variable that is initialized, but there exist
       some other paths for which the variable is not initialized, the
!      compiler emits a warning if it cannot prove the uninitialized
!      paths are not executed at run time. These warnings are made
!      optional because GCC is not smart enough to see all the reasons
!      why the code might be correct in spite of appearing to have an
!      error.  Here is one example of how this can happen:
  
            {
              int x;
--- 3956,3970 ----
       computations may be deleted by data flow analysis before the
       warnings are printed.
  
! '-Wmaybe-uninitialized'
       For an automatic variable, if there exists a path from the function
       entry to a use of the variable that is initialized, but there exist
       some other paths for which the variable is not initialized, the
!      compiler emits a warning if it cannot prove the uninitialized paths
!      are not executed at run time.  These warnings are made optional
!      because GCC is not smart enough to see all the reasons why the code
!      might be correct in spite of appearing to have an error.  Here is
!      one example of how this can happen:
  
            {
              int x;
*************** present.
*** 3998,4077 ****
              foo (x);
            }
  
!      If the value of `y' is always 1, 2 or 3, then `x' is always
!      initialized, but GCC doesn't know this. To suppress the warning,
       you need to provide a default case with assert(0) or similar code.
  
!      This option also warns when a non-volatile automatic variable
!      might be changed by a call to `longjmp'.  These warnings as well
!      are possible only in optimizing compilation.
  
!      The compiler sees only the calls to `setjmp'.  It cannot know
!      where `longjmp' will be called; in fact, a signal handler could
!      call it at any point in the code.  As a result, you may get a
!      warning even when there is in fact no problem because `longjmp'
!      cannot in fact be called at the place that would cause a problem.
  
       Some spurious warnings can be avoided if you declare all the
!      functions you use that never return as `noreturn'.  *Note Function
       Attributes::.
  
!      This warning is enabled by `-Wall' or `-Wextra'.
  
! `-Wunknown-pragmas'
!      Warn when a `#pragma' directive is encountered that is not
       understood by GCC.  If this command-line option is used, warnings
       are even issued for unknown pragmas in system header files.  This
!      is not the case if the warnings are only enabled by the `-Wall'
       command-line option.
  
! `-Wno-pragmas'
       Do not warn about misuses of pragmas, such as incorrect parameters,
       invalid syntax, or conflicts between pragmas.  See also
!      `-Wunknown-pragmas'.
  
! `-Wstrict-aliasing'
!      This option is only active when `-fstrict-aliasing' is active.  It
       warns about code that might break the strict aliasing rules that
!      the compiler is using for optimization.  The warning does not
!      catch all cases, but does attempt to catch the more common
!      pitfalls.  It is included in `-Wall'.  It is equivalent to
!      `-Wstrict-aliasing=3'
  
! `-Wstrict-aliasing=n'
!      This option is only active when `-fstrict-aliasing' is active.  It
       warns about code that might break the strict aliasing rules that
       the compiler is using for optimization.  Higher levels correspond
       to higher accuracy (fewer false positives).  Higher levels also
!      correspond to more effort, similar to the way `-O' works.
!      `-Wstrict-aliasing' is equivalent to `-Wstrict-aliasing=3'.
  
       Level 1: Most aggressive, quick, least accurate.  Possibly useful
!      when higher levels do not warn but `-fstrict-aliasing' still
!      breaks the code, as it has very few false negatives.  However, it
!      has many false positives.  Warns for all pointer conversions
!      between possibly incompatible types, even if never dereferenced.
!      Runs in the front end only.
  
       Level 2: Aggressive, quick, not too precise.  May still have many
       false positives (not as many as level 1 though), and few false
       negatives (but possibly more than level 1).  Unlike level 1, it
!      only warns when an address is taken.  Warns about incomplete
!      types.  Runs in the front end only.
  
!      Level 3 (default for `-Wstrict-aliasing'): Should have very few
       false positives and few false negatives.  Slightly slower than
       levels 1 or 2 when optimization is enabled.  Takes care of the
       common pun+dereference pattern in the front end:
!      `*(int*)&some_float'.  If optimization is enabled, it also runs in
       the back end, where it deals with multiple statement cases using
       flow-sensitive points-to information.  Only warns when the
       converted pointer is dereferenced.  Does not warn about incomplete
       types.
  
! `-Wstrict-overflow'
! `-Wstrict-overflow=N'
!      This option is only active when `-fstrict-overflow' is active.  It
       warns about cases where the compiler optimizes based on the
       assumption that signed overflow does not occur.  Note that it does
       not warn about all cases where the code might overflow: it only
--- 3979,4057 ----
              foo (x);
            }
  
!      If the value of 'y' is always 1, 2 or 3, then 'x' is always
!      initialized, but GCC doesn't know this.  To suppress the warning,
       you need to provide a default case with assert(0) or similar code.
  
!      This option also warns when a non-volatile automatic variable might
!      be changed by a call to 'longjmp'.  These warnings as well are
!      possible only in optimizing compilation.
  
!      The compiler sees only the calls to 'setjmp'.  It cannot know where
!      'longjmp' will be called; in fact, a signal handler could call it
!      at any point in the code.  As a result, you may get a warning even
!      when there is in fact no problem because 'longjmp' cannot in fact
!      be called at the place that would cause a problem.
  
       Some spurious warnings can be avoided if you declare all the
!      functions you use that never return as 'noreturn'.  *Note Function
       Attributes::.
  
!      This warning is enabled by '-Wall' or '-Wextra'.
  
! '-Wunknown-pragmas'
!      Warn when a '#pragma' directive is encountered that is not
       understood by GCC.  If this command-line option is used, warnings
       are even issued for unknown pragmas in system header files.  This
!      is not the case if the warnings are only enabled by the '-Wall'
       command-line option.
  
! '-Wno-pragmas'
       Do not warn about misuses of pragmas, such as incorrect parameters,
       invalid syntax, or conflicts between pragmas.  See also
!      '-Wunknown-pragmas'.
  
! '-Wstrict-aliasing'
!      This option is only active when '-fstrict-aliasing' is active.  It
       warns about code that might break the strict aliasing rules that
!      the compiler is using for optimization.  The warning does not catch
!      all cases, but does attempt to catch the more common pitfalls.  It
!      is included in '-Wall'.  It is equivalent to '-Wstrict-aliasing=3'
  
! '-Wstrict-aliasing=n'
!      This option is only active when '-fstrict-aliasing' is active.  It
       warns about code that might break the strict aliasing rules that
       the compiler is using for optimization.  Higher levels correspond
       to higher accuracy (fewer false positives).  Higher levels also
!      correspond to more effort, similar to the way '-O' works.
!      '-Wstrict-aliasing' is equivalent to '-Wstrict-aliasing=3'.
  
       Level 1: Most aggressive, quick, least accurate.  Possibly useful
!      when higher levels do not warn but '-fstrict-aliasing' still breaks
!      the code, as it has very few false negatives.  However, it has many
!      false positives.  Warns for all pointer conversions between
!      possibly incompatible types, even if never dereferenced.  Runs in
!      the front end only.
  
       Level 2: Aggressive, quick, not too precise.  May still have many
       false positives (not as many as level 1 though), and few false
       negatives (but possibly more than level 1).  Unlike level 1, it
!      only warns when an address is taken.  Warns about incomplete types.
!      Runs in the front end only.
  
!      Level 3 (default for '-Wstrict-aliasing'): Should have very few
       false positives and few false negatives.  Slightly slower than
       levels 1 or 2 when optimization is enabled.  Takes care of the
       common pun+dereference pattern in the front end:
!      '*(int*)&some_float'.  If optimization is enabled, it also runs in
       the back end, where it deals with multiple statement cases using
       flow-sensitive points-to information.  Only warns when the
       converted pointer is dereferenced.  Does not warn about incomplete
       types.
  
! '-Wstrict-overflow'
! '-Wstrict-overflow=N'
!      This option is only active when '-fstrict-overflow' is active.  It
       warns about cases where the compiler optimizes based on the
       assumption that signed overflow does not occur.  Note that it does
       not warn about all cases where the code might overflow: it only
*************** present.
*** 4088,4255 ****
       loop requires, in particular when determining whether a loop will
       be executed at all.
  
!     `-Wstrict-overflow=1'
!           Warn about cases that are both questionable and easy to
!           avoid.  For example,  with `-fstrict-overflow', the compiler
!           simplifies `x + 1 > x' to `1'.  This level of
!           `-Wstrict-overflow' is enabled by `-Wall'; higher levels are
!           not, and must be explicitly requested.
  
!     `-Wstrict-overflow=2'
            Also warn about other cases where a comparison is simplified
!           to a constant.  For example: `abs (x) >= 0'.  This can only be
!           simplified when `-fstrict-overflow' is in effect, because
!           `abs (INT_MIN)' overflows to `INT_MIN', which is less than
!           zero.  `-Wstrict-overflow' (with no level) is the same as
!           `-Wstrict-overflow=2'.
  
!     `-Wstrict-overflow=3'
            Also warn about other cases where a comparison is simplified.
!           For example: `x + 1 > 1' is simplified to `x > 0'.
  
!     `-Wstrict-overflow=4'
!           Also warn about other simplifications not covered by the
!           above cases.  For example: `(x * 10) / 5' is simplified to `x
!           * 2'.
  
!     `-Wstrict-overflow=5'
!           Also warn about cases where the compiler reduces the
!           magnitude of a constant involved in a comparison.  For
!           example: `x + 2 > y' is simplified to `x + 1 >= y'.  This is
!           reported only at the highest warning level because this
!           simplification applies to many comparisons, so this warning
!           level gives a very large number of false positives.
  
! `-Wsuggest-attribute=[pure|const|noreturn|format]'
!      Warn for cases where adding an attribute may be beneficial. The
       attributes currently supported are listed below.
  
!     `-Wsuggest-attribute=pure'
!     `-Wsuggest-attribute=const'
!     `-Wsuggest-attribute=noreturn'
            Warn about functions that might be candidates for attributes
!           `pure', `const' or `noreturn'.  The compiler only warns for
            functions visible in other compilation units or (in the case
!           of `pure' and `const') if it cannot prove that the function
!           returns normally. A function returns normally if it doesn't
            contain an infinite loop or return abnormally by throwing,
!           calling `abort' or trapping.  This analysis requires option
!           `-fipa-pure-const', which is enabled by default at `-O' and
            higher.  Higher optimization levels improve the accuracy of
            the analysis.
  
!     `-Wsuggest-attribute=format'
!     `-Wmissing-format-attribute'
            Warn about function pointers that might be candidates for
!           `format' attributes.  Note these are only possible
!           candidates, not absolute ones.  GCC guesses that function
!           pointers with `format' attributes that are used in
!           assignment, initialization, parameter passing or return
!           statements should have a corresponding `format' attribute in
!           the resulting type.  I.e. the left-hand side of the
!           assignment or initialization, the type of the parameter
!           variable, or the return type of the containing function
!           respectively should also have a `format' attribute to avoid
!           the warning.
  
            GCC also warns about function definitions that might be
!           candidates for `format' attributes.  Again, these are only
!           possible candidates.  GCC guesses that `format' attributes
            might be appropriate for any function that calls a function
!           like `vprintf' or `vscanf', but this might not always be the
!           case, and some functions for which `format' attributes are
            appropriate may not be detected.
  
! `-Wsuggest-final-types'
       Warn about types with virtual methods where code quality would be
!      improved if the type were declared with the C++11 `final'
       specifier, or, if possible, declared in an anonymous namespace.
       This allows GCC to more aggressively devirtualize the polymorphic
!      calls. This warning is more effective with link time optimization,
       where the information about the class hierarchy graph is more
       complete.
  
! `-Wsuggest-final-methods'
       Warn about virtual methods where code quality would be improved if
!      the method were declared with the C++11 `final' specifier, or, if
       possible, its type were declared in an anonymous namespace or with
!      the `final' specifier.  This warning is more effective with link
       time optimization, where the information about the class hierarchy
!      graph is more complete. It is recommended to first consider
!      suggestions of `-Wsuggest-final-types' and then rebuild with new
       annotations.
  
! `-Wsuggest-override'
       Warn about overriding virtual functions that are not marked with
       the override keyword.
  
! `-Warray-bounds'
! `-Warray-bounds=N'
!      This option is only active when `-ftree-vrp' is active (default
!      for `-O2' and above). It warns about subscripts to arrays that are
!      always out of bounds. This warning is enabled by `-Wall'.
  
!     `-Warray-bounds=1'
!           This is the warning level of `-Warray-bounds' and is enabled
!           by `-Wall'; higher levels are not, and must be explicitly
            requested.
  
!     `-Warray-bounds=2'
            This warning level also warns about out of bounds access for
            arrays at the end of a struct and for arrays accessed through
!           pointers. This warning level may give a larger number of
            false positives and is deactivated by default.
  
! `-Wbool-compare'
       Warn about boolean expression compared with an integer value
!      different from `true'/`false'.  For instance, the following
       comparison is always false:
            int n = 5;
            ...
            if ((n > 1) == 2) { ... }
!      This warning is enabled by `-Wall'.
  
! `-Wno-discarded-qualifiers (C and Objective-C only)'
       Do not warn if type qualifiers on pointers are being discarded.
!      Typically, the compiler warns if a `const char *' variable is
!      passed to a function that takes a `char *' parameter.  This option
       can be used to suppress such a warning.
  
! `-Wno-discarded-array-qualifiers (C and Objective-C only)'
       Do not warn if type qualifiers on arrays which are pointer targets
!      are being discarded. Typically, the compiler warns if a `const int
!      (*)[]' variable is passed to a function that takes a `int (*)[]'
       parameter.  This option can be used to suppress such a warning.
  
! `-Wno-incompatible-pointer-types (C and Objective-C only)'
       Do not warn when there is a conversion between pointers that have
       incompatible types.  This warning is for cases not covered by
!      `-Wno-pointer-sign', which warns for pointer argument passing or
       assignment with different signedness.
  
! `-Wno-int-conversion (C and Objective-C only)'
       Do not warn about incompatible integer to pointer and pointer to
       integer conversions.  This warning is about implicit conversions;
!      for explicit conversions the warnings `-Wno-int-to-pointer-cast'
!      and `-Wno-pointer-to-int-cast' may be used.
  
! `-Wno-div-by-zero'
       Do not warn about compile-time integer division by zero.
!      Floating-point division by zero is not warned about, as it can be
!      a legitimate way of obtaining infinities and NaNs.
  
! `-Wsystem-headers'
       Print warning messages for constructs found in system header files.
       Warnings from system headers are normally suppressed, on the
       assumption that they usually do not indicate real problems and
       would only make the compiler output harder to read.  Using this
       command-line option tells GCC to emit warnings from system headers
!      as if they occurred in user code.  However, note that using
!      `-Wall' in conjunction with this option does _not_ warn about
!      unknown pragmas in system headers--for that, `-Wunknown-pragmas'
!      must also be used.
  
! `-Wtrampolines'
       Warn about trampolines generated for pointers to nested functions.
       A trampoline is a small piece of data or code that is created at
       run time on the stack when the address of a nested function is
--- 4068,4235 ----
       loop requires, in particular when determining whether a loop will
       be executed at all.
  
!      '-Wstrict-overflow=1'
!           Warn about cases that are both questionable and easy to avoid.
!           For example, with '-fstrict-overflow', the compiler simplifies
!           'x + 1 > x' to '1'.  This level of '-Wstrict-overflow' is
!           enabled by '-Wall'; higher levels are not, and must be
!           explicitly requested.
  
!      '-Wstrict-overflow=2'
            Also warn about other cases where a comparison is simplified
!           to a constant.  For example: 'abs (x) >= 0'.  This can only be
!           simplified when '-fstrict-overflow' is in effect, because 'abs
!           (INT_MIN)' overflows to 'INT_MIN', which is less than zero.
!           '-Wstrict-overflow' (with no level) is the same as
!           '-Wstrict-overflow=2'.
  
!      '-Wstrict-overflow=3'
            Also warn about other cases where a comparison is simplified.
!           For example: 'x + 1 > 1' is simplified to 'x > 0'.
  
!      '-Wstrict-overflow=4'
!           Also warn about other simplifications not covered by the above
!           cases.  For example: '(x * 10) / 5' is simplified to 'x * 2'.
  
!      '-Wstrict-overflow=5'
!           Also warn about cases where the compiler reduces the magnitude
!           of a constant involved in a comparison.  For example: 'x + 2 >
!           y' is simplified to 'x + 1 >= y'.  This is reported only at
!           the highest warning level because this simplification applies
!           to many comparisons, so this warning level gives a very large
!           number of false positives.
  
! '-Wsuggest-attribute=[pure|const|noreturn|format]'
!      Warn for cases where adding an attribute may be beneficial.  The
       attributes currently supported are listed below.
  
!      '-Wsuggest-attribute=pure'
!      '-Wsuggest-attribute=const'
!      '-Wsuggest-attribute=noreturn'
! 
            Warn about functions that might be candidates for attributes
!           'pure', 'const' or 'noreturn'.  The compiler only warns for
            functions visible in other compilation units or (in the case
!           of 'pure' and 'const') if it cannot prove that the function
!           returns normally.  A function returns normally if it doesn't
            contain an infinite loop or return abnormally by throwing,
!           calling 'abort' or trapping.  This analysis requires option
!           '-fipa-pure-const', which is enabled by default at '-O' and
            higher.  Higher optimization levels improve the accuracy of
            the analysis.
  
!      '-Wsuggest-attribute=format'
!      '-Wmissing-format-attribute'
! 
            Warn about function pointers that might be candidates for
!           'format' attributes.  Note these are only possible candidates,
!           not absolute ones.  GCC guesses that function pointers with
!           'format' attributes that are used in assignment,
!           initialization, parameter passing or return statements should
!           have a corresponding 'format' attribute in the resulting type.
!           I.e. the left-hand side of the assignment or initialization,
!           the type of the parameter variable, or the return type of the
!           containing function respectively should also have a 'format'
!           attribute to avoid the warning.
  
            GCC also warns about function definitions that might be
!           candidates for 'format' attributes.  Again, these are only
!           possible candidates.  GCC guesses that 'format' attributes
            might be appropriate for any function that calls a function
!           like 'vprintf' or 'vscanf', but this might not always be the
!           case, and some functions for which 'format' attributes are
            appropriate may not be detected.
  
! '-Wsuggest-final-types'
       Warn about types with virtual methods where code quality would be
!      improved if the type were declared with the C++11 'final'
       specifier, or, if possible, declared in an anonymous namespace.
       This allows GCC to more aggressively devirtualize the polymorphic
!      calls.  This warning is more effective with link time optimization,
       where the information about the class hierarchy graph is more
       complete.
  
! '-Wsuggest-final-methods'
       Warn about virtual methods where code quality would be improved if
!      the method were declared with the C++11 'final' specifier, or, if
       possible, its type were declared in an anonymous namespace or with
!      the 'final' specifier.  This warning is more effective with link
       time optimization, where the information about the class hierarchy
!      graph is more complete.  It is recommended to first consider
!      suggestions of '-Wsuggest-final-types' and then rebuild with new
       annotations.
  
! '-Wsuggest-override'
       Warn about overriding virtual functions that are not marked with
       the override keyword.
  
! '-Warray-bounds'
! '-Warray-bounds=N'
!      This option is only active when '-ftree-vrp' is active (default for
!      '-O2' and above).  It warns about subscripts to arrays that are
!      always out of bounds.  This warning is enabled by '-Wall'.
  
!      '-Warray-bounds=1'
!           This is the warning level of '-Warray-bounds' and is enabled
!           by '-Wall'; higher levels are not, and must be explicitly
            requested.
  
!      '-Warray-bounds=2'
            This warning level also warns about out of bounds access for
            arrays at the end of a struct and for arrays accessed through
!           pointers.  This warning level may give a larger number of
            false positives and is deactivated by default.
  
! '-Wbool-compare'
       Warn about boolean expression compared with an integer value
!      different from 'true'/'false'.  For instance, the following
       comparison is always false:
            int n = 5;
            ...
            if ((n > 1) == 2) { ... }
!      This warning is enabled by '-Wall'.
  
! '-Wno-discarded-qualifiers (C and Objective-C only)'
       Do not warn if type qualifiers on pointers are being discarded.
!      Typically, the compiler warns if a 'const char *' variable is
!      passed to a function that takes a 'char *' parameter.  This option
       can be used to suppress such a warning.
  
! '-Wno-discarded-array-qualifiers (C and Objective-C only)'
       Do not warn if type qualifiers on arrays which are pointer targets
!      are being discarded.  Typically, the compiler warns if a 'const int
!      (*)[]' variable is passed to a function that takes a 'int (*)[]'
       parameter.  This option can be used to suppress such a warning.
  
! '-Wno-incompatible-pointer-types (C and Objective-C only)'
       Do not warn when there is a conversion between pointers that have
       incompatible types.  This warning is for cases not covered by
!      '-Wno-pointer-sign', which warns for pointer argument passing or
       assignment with different signedness.
  
! '-Wno-int-conversion (C and Objective-C only)'
       Do not warn about incompatible integer to pointer and pointer to
       integer conversions.  This warning is about implicit conversions;
!      for explicit conversions the warnings '-Wno-int-to-pointer-cast'
!      and '-Wno-pointer-to-int-cast' may be used.
  
! '-Wno-div-by-zero'
       Do not warn about compile-time integer division by zero.
!      Floating-point division by zero is not warned about, as it can be a
!      legitimate way of obtaining infinities and NaNs.
  
! '-Wsystem-headers'
       Print warning messages for constructs found in system header files.
       Warnings from system headers are normally suppressed, on the
       assumption that they usually do not indicate real problems and
       would only make the compiler output harder to read.  Using this
       command-line option tells GCC to emit warnings from system headers
!      as if they occurred in user code.  However, note that using '-Wall'
!      in conjunction with this option does _not_ warn about unknown
!      pragmas in system headers--for that, '-Wunknown-pragmas' must also
!      be used.
  
! '-Wtrampolines'
       Warn about trampolines generated for pointers to nested functions.
       A trampoline is a small piece of data or code that is created at
       run time on the stack when the address of a nested function is
*************** present.
*** 4259,4265 ****
       and thus requires the stack to be made executable in order for the
       program to work properly.
  
! `-Wfloat-equal'
       Warn if floating-point values are used in equality comparisons.
  
       The idea behind this is that sometimes it is convenient (for the
--- 4239,4245 ----
       and thus requires the stack to be made executable in order for the
       program to work properly.
  
! '-Wfloat-equal'
       Warn if floating-point values are used in equality comparisons.
  
       The idea behind this is that sometimes it is convenient (for the
*************** present.
*** 4268,4280 ****
       need to compute (by analyzing the code, or in some other way) the
       maximum or likely maximum error that the computation introduces,
       and allow for it when performing comparisons (and when producing
!      output, but that's a different problem).  In particular, instead
!      of testing for equality, you should check to see whether the two
       values have ranges that overlap; and this is done with the
       relational operators, so equality comparisons are probably
       mistaken.
  
! `-Wtraditional (C and Objective-C only)'
       Warn about certain constructs that behave differently in
       traditional and ISO C.  Also warn about ISO C constructs that have
       no traditional C equivalent, and/or problematic constructs that
--- 4248,4260 ----
       need to compute (by analyzing the code, or in some other way) the
       maximum or likely maximum error that the computation introduces,
       and allow for it when performing comparisons (and when producing
!      output, but that's a different problem).  In particular, instead of
!      testing for equality, you should check to see whether the two
       values have ranges that overlap; and this is done with the
       relational operators, so equality comparisons are probably
       mistaken.
  
! '-Wtraditional (C and Objective-C only)'
       Warn about certain constructs that behave differently in
       traditional and ISO C.  Also warn about ISO C constructs that have
       no traditional C equivalent, and/or problematic constructs that
*************** present.
*** 4286,4320 ****
  
          * In traditional C, some preprocessor directives did not exist.
            Traditional preprocessors only considered a line to be a
!           directive if the `#' appeared in column 1 on the line.
!           Therefore `-Wtraditional' warns about directives that
!           traditional C understands but ignores because the `#' does
!           not appear as the first character on the line.  It also
!           suggests you hide directives like `#pragma' not understood by
            traditional C by indenting them.  Some traditional
!           implementations do not recognize `#elif', so this option
            suggests avoiding it altogether.
  
          * A function-like macro that appears without arguments.
  
          * The unary plus operator.
  
!         * The `U' integer constant suffix, or the `F' or `L'
!           floating-point constant suffixes.  (Traditional C does
!           support the `L' suffix on integer constants.)  Note, these
!           suffixes appear in macros defined in the system headers of
!           most modern systems, e.g. the `_MIN'/`_MAX' macros in
!           `<limits.h>'.  Use of these macros in user code might
!           normally lead to spurious warnings, however GCC's integrated
!           preprocessor has enough context to avoid warning in these
!           cases.
  
          * A function declared external in one block and then used after
            the end of the block.
  
!         * A `switch' statement has an operand of type `long'.
  
!         * A non-`static' function declaration follows a `static' one.
            This construct is not accepted by some traditional C
            compilers.
  
--- 4266,4299 ----
  
          * In traditional C, some preprocessor directives did not exist.
            Traditional preprocessors only considered a line to be a
!           directive if the '#' appeared in column 1 on the line.
!           Therefore '-Wtraditional' warns about directives that
!           traditional C understands but ignores because the '#' does not
!           appear as the first character on the line.  It also suggests
!           you hide directives like '#pragma' not understood by
            traditional C by indenting them.  Some traditional
!           implementations do not recognize '#elif', so this option
            suggests avoiding it altogether.
  
          * A function-like macro that appears without arguments.
  
          * The unary plus operator.
  
!         * The 'U' integer constant suffix, or the 'F' or 'L'
!           floating-point constant suffixes.  (Traditional C does support
!           the 'L' suffix on integer constants.)  Note, these suffixes
!           appear in macros defined in the system headers of most modern
!           systems, e.g. the '_MIN'/'_MAX' macros in '<limits.h>'.  Use
!           of these macros in user code might normally lead to spurious
!           warnings, however GCC's integrated preprocessor has enough
!           context to avoid warning in these cases.
  
          * A function declared external in one block and then used after
            the end of the block.
  
!         * A 'switch' statement has an operand of type 'long'.
  
!         * A non-'static' function declaration follows a 'static' one.
            This construct is not accepted by some traditional C
            compilers.
  
*************** present.
*** 4334,4498 ****
          * Initialization of unions.  If the initializer is zero, the
            warning is omitted.  This is done under the assumption that
            the zero initializer in user code appears conditioned on e.g.
!           `__STDC__' to avoid missing initializer warnings and relies
!           on default initialization to zero in the traditional C case.
  
          * Conversions by prototypes between fixed/floating-point values
            and vice versa.  The absence of these prototypes when
!           compiling with traditional C causes serious problems.  This
!           is a subset of the possible conversion warnings; for the full
!           set use `-Wtraditional-conversion'.
  
          * Use of ISO C style function definitions.  This warning
            intentionally is _not_ issued for prototype declarations or
!           variadic functions because these ISO C features appear in
!           your code when using libiberty's traditional C compatibility
!           macros, `PARAMS' and `VPARAMS'.  This warning is also
!           bypassed for nested functions because that feature is already
!           a GCC extension and thus not relevant to traditional C
            compatibility.
  
! `-Wtraditional-conversion (C and Objective-C only)'
!      Warn if a prototype causes a type conversion that is different
!      from what would happen to the same argument in the absence of a
       prototype.  This includes conversions of fixed point to floating
!      and vice versa, and conversions changing the width or signedness
!      of a fixed-point argument except when the same as the default
       promotion.
  
! `-Wdeclaration-after-statement (C and Objective-C only)'
       Warn when a declaration is found after a statement in a block.
       This construct, known from C++, was introduced with ISO C99 and is
       by default allowed in GCC.  It is not supported by ISO C90.  *Note
       Mixed Declarations::.
  
! `-Wundef'
!      Warn if an undefined identifier is evaluated in an `#if' directive.
  
! `-Wno-endif-labels'
!      Do not warn whenever an `#else' or an `#endif' are followed by
       text.
  
! `-Wshadow'
       Warn whenever a local variable or type declaration shadows another
       variable, parameter, type, class member (in C++), or instance
       variable (in Objective-C) or whenever a built-in function is
!      shadowed. Note that in C++, the compiler warns if a local variable
       shadows an explicit typedef, but not if it shadows a
       struct/class/enum.
  
! `-Wno-shadow-ivar (Objective-C only)'
       Do not warn whenever a local variable shadows an instance variable
       in an Objective-C method.
  
! `-Wlarger-than=LEN'
       Warn whenever an object of larger than LEN bytes is defined.
  
! `-Wframe-larger-than=LEN'
!      Warn if the size of a function frame is larger than LEN bytes.
!      The computation done to determine the stack frame size is
!      approximate and not conservative.  The actual requirements may be
!      somewhat greater than LEN even if you do not get a warning.  In
!      addition, any space allocated via `alloca', variable-length
!      arrays, or related constructs is not included by the compiler when
!      determining whether or not to issue a warning.
  
! `-Wno-free-nonheap-object'
       Do not warn when attempting to free an object that was not
       allocated on the heap.
  
! `-Wstack-usage=LEN'
       Warn if the stack usage of a function might be larger than LEN
       bytes.  The computation done to determine the stack usage is
!      conservative.  Any space allocated via `alloca', variable-length
       arrays, or related constructs is included by the compiler when
       determining whether or not to issue a warning.
  
!      The message is in keeping with the output of `-fstack-usage'.
  
          * If the stack usage is fully static but exceeds the specified
            amount, it's:
  
                   warning: stack usage is 1120 bytes
- 
          * If the stack usage is (partly) dynamic but bounded, it's:
  
                   warning: stack usage might be 1648 bytes
- 
          * If the stack usage is (partly) dynamic and not bounded, it's:
  
                   warning: stack usage might be unbounded
  
! `-Wunsafe-loop-optimizations'
       Warn if the loop cannot be optimized because the compiler cannot
       assume anything on the bounds of the loop indices.  With
!      `-funsafe-loop-optimizations' warn if the compiler makes such
       assumptions.
  
! `-Wno-pedantic-ms-format (MinGW targets only)'
!      When used in combination with `-Wformat' and `-pedantic' without
       GNU extensions, this option disables the warnings about non-ISO
!      `printf' / `scanf' format width specifiers `I32', `I64', and `I'
       used on Windows targets, which depend on the MS runtime.
  
! `-Wpointer-arith'
       Warn about anything that depends on the "size of" a function type
!      or of `void'.  GNU C assigns these types a size of 1, for
!      convenience in calculations with `void *' pointers and pointers to
       functions.  In C++, warn also when an arithmetic operation involves
!      `NULL'.  This warning is also enabled by `-Wpedantic'.
  
! `-Wtype-limits'
       Warn if a comparison is always true or always false due to the
       limited range of the data type, but do not warn for constant
!      expressions.  For example, warn if an unsigned variable is
!      compared against zero with `<' or `>='.  This warning is also
!      enabled by `-Wextra'.
  
! `-Wbad-function-cast (C and Objective-C only)'
       Warn when a function call is cast to a non-matching type.  For
       example, warn if a call to a function returning an integer type is
       cast to a pointer type.
  
! `-Wc90-c99-compat (C and Objective-C only)'
       Warn about features not present in ISO C90, but present in ISO C99.
!      For instance, warn about use of variable length arrays, `long long'
!      type, `bool' type, compound literals, designated initializers, and
!      so on.  This option is independent of the standards mode.
!      Warnings are disabled in the expression that follows
!      `__extension__'.
  
! `-Wc99-c11-compat (C and Objective-C only)'
       Warn about features not present in ISO C99, but present in ISO C11.
       For instance, warn about use of anonymous structures and unions,
!      `_Atomic' type qualifier, `_Thread_local' storage-class specifier,
!      `_Alignas' specifier, `Alignof' operator, `_Generic' keyword, and
!      so on.  This option is independent of the standards mode.
!      Warnings are disabled in the expression that follows
!      `__extension__'.
  
! `-Wc++-compat (C and Objective-C only)'
       Warn about ISO C constructs that are outside of the common subset
       of ISO C and ISO C++, e.g. request for implicit conversion from
!      `void *' to a pointer to non-`void' type.
  
! `-Wc++11-compat (C++ and Objective-C++ only)'
       Warn about C++ constructs whose meaning differs between ISO C++
       1998 and ISO C++ 2011, e.g., identifiers in ISO C++ 1998 that are
!      keywords in ISO C++ 2011.  This warning turns on `-Wnarrowing' and
!      is enabled by `-Wall'.
  
! `-Wc++14-compat (C++ and Objective-C++ only)'
       Warn about C++ constructs whose meaning differs between ISO C++
!      2011 and ISO C++ 2014.  This warning is enabled by `-Wall'.
  
! `-Wcast-qual'
       Warn whenever a pointer is cast so as to remove a type qualifier
!      from the target type.  For example, warn if a `const char *' is
!      cast to an ordinary `char *'.
  
       Also warn when making a cast that introduces a type qualifier in an
!      unsafe way.  For example, casting `char **' to `const char **' is
       unsafe, as in this example:
  
              /* p is char ** value.  */
--- 4313,4473 ----
          * Initialization of unions.  If the initializer is zero, the
            warning is omitted.  This is done under the assumption that
            the zero initializer in user code appears conditioned on e.g.
!           '__STDC__' to avoid missing initializer warnings and relies on
!           default initialization to zero in the traditional C case.
  
          * Conversions by prototypes between fixed/floating-point values
            and vice versa.  The absence of these prototypes when
!           compiling with traditional C causes serious problems.  This is
!           a subset of the possible conversion warnings; for the full set
!           use '-Wtraditional-conversion'.
  
          * Use of ISO C style function definitions.  This warning
            intentionally is _not_ issued for prototype declarations or
!           variadic functions because these ISO C features appear in your
!           code when using libiberty's traditional C compatibility
!           macros, 'PARAMS' and 'VPARAMS'.  This warning is also bypassed
!           for nested functions because that feature is already a GCC
!           extension and thus not relevant to traditional C
            compatibility.
  
! '-Wtraditional-conversion (C and Objective-C only)'
!      Warn if a prototype causes a type conversion that is different from
!      what would happen to the same argument in the absence of a
       prototype.  This includes conversions of fixed point to floating
!      and vice versa, and conversions changing the width or signedness of
!      a fixed-point argument except when the same as the default
       promotion.
  
! '-Wdeclaration-after-statement (C and Objective-C only)'
       Warn when a declaration is found after a statement in a block.
       This construct, known from C++, was introduced with ISO C99 and is
       by default allowed in GCC.  It is not supported by ISO C90.  *Note
       Mixed Declarations::.
  
! '-Wundef'
!      Warn if an undefined identifier is evaluated in an '#if' directive.
  
! '-Wno-endif-labels'
!      Do not warn whenever an '#else' or an '#endif' are followed by
       text.
  
! '-Wshadow'
       Warn whenever a local variable or type declaration shadows another
       variable, parameter, type, class member (in C++), or instance
       variable (in Objective-C) or whenever a built-in function is
!      shadowed.  Note that in C++, the compiler warns if a local variable
       shadows an explicit typedef, but not if it shadows a
       struct/class/enum.
  
! '-Wno-shadow-ivar (Objective-C only)'
       Do not warn whenever a local variable shadows an instance variable
       in an Objective-C method.
  
! '-Wlarger-than=LEN'
       Warn whenever an object of larger than LEN bytes is defined.
  
! '-Wframe-larger-than=LEN'
!      Warn if the size of a function frame is larger than LEN bytes.  The
!      computation done to determine the stack frame size is approximate
!      and not conservative.  The actual requirements may be somewhat
!      greater than LEN even if you do not get a warning.  In addition,
!      any space allocated via 'alloca', variable-length arrays, or
!      related constructs is not included by the compiler when determining
!      whether or not to issue a warning.
  
! '-Wno-free-nonheap-object'
       Do not warn when attempting to free an object that was not
       allocated on the heap.
  
! '-Wstack-usage=LEN'
       Warn if the stack usage of a function might be larger than LEN
       bytes.  The computation done to determine the stack usage is
!      conservative.  Any space allocated via 'alloca', variable-length
       arrays, or related constructs is included by the compiler when
       determining whether or not to issue a warning.
  
!      The message is in keeping with the output of '-fstack-usage'.
  
          * If the stack usage is fully static but exceeds the specified
            amount, it's:
  
                   warning: stack usage is 1120 bytes
          * If the stack usage is (partly) dynamic but bounded, it's:
  
                   warning: stack usage might be 1648 bytes
          * If the stack usage is (partly) dynamic and not bounded, it's:
  
                   warning: stack usage might be unbounded
  
! '-Wunsafe-loop-optimizations'
       Warn if the loop cannot be optimized because the compiler cannot
       assume anything on the bounds of the loop indices.  With
!      '-funsafe-loop-optimizations' warn if the compiler makes such
       assumptions.
  
! '-Wno-pedantic-ms-format (MinGW targets only)'
!      When used in combination with '-Wformat' and '-pedantic' without
       GNU extensions, this option disables the warnings about non-ISO
!      'printf' / 'scanf' format width specifiers 'I32', 'I64', and 'I'
       used on Windows targets, which depend on the MS runtime.
  
! '-Wpointer-arith'
       Warn about anything that depends on the "size of" a function type
!      or of 'void'.  GNU C assigns these types a size of 1, for
!      convenience in calculations with 'void *' pointers and pointers to
       functions.  In C++, warn also when an arithmetic operation involves
!      'NULL'.  This warning is also enabled by '-Wpedantic'.
  
! '-Wtype-limits'
       Warn if a comparison is always true or always false due to the
       limited range of the data type, but do not warn for constant
!      expressions.  For example, warn if an unsigned variable is compared
!      against zero with '<' or '>='.  This warning is also enabled by
!      '-Wextra'.
  
! '-Wbad-function-cast (C and Objective-C only)'
       Warn when a function call is cast to a non-matching type.  For
       example, warn if a call to a function returning an integer type is
       cast to a pointer type.
  
! '-Wc90-c99-compat (C and Objective-C only)'
       Warn about features not present in ISO C90, but present in ISO C99.
!      For instance, warn about use of variable length arrays, 'long long'
!      type, 'bool' type, compound literals, designated initializers, and
!      so on.  This option is independent of the standards mode.  Warnings
!      are disabled in the expression that follows '__extension__'.
  
! '-Wc99-c11-compat (C and Objective-C only)'
       Warn about features not present in ISO C99, but present in ISO C11.
       For instance, warn about use of anonymous structures and unions,
!      '_Atomic' type qualifier, '_Thread_local' storage-class specifier,
!      '_Alignas' specifier, 'Alignof' operator, '_Generic' keyword, and
!      so on.  This option is independent of the standards mode.  Warnings
!      are disabled in the expression that follows '__extension__'.
  
! '-Wc++-compat (C and Objective-C only)'
       Warn about ISO C constructs that are outside of the common subset
       of ISO C and ISO C++, e.g. request for implicit conversion from
!      'void *' to a pointer to non-'void' type.
  
! '-Wc++11-compat (C++ and Objective-C++ only)'
       Warn about C++ constructs whose meaning differs between ISO C++
       1998 and ISO C++ 2011, e.g., identifiers in ISO C++ 1998 that are
!      keywords in ISO C++ 2011.  This warning turns on '-Wnarrowing' and
!      is enabled by '-Wall'.
  
! '-Wc++14-compat (C++ and Objective-C++ only)'
       Warn about C++ constructs whose meaning differs between ISO C++
!      2011 and ISO C++ 2014.  This warning is enabled by '-Wall'.
  
! '-Wcast-qual'
       Warn whenever a pointer is cast so as to remove a type qualifier
!      from the target type.  For example, warn if a 'const char *' is
!      cast to an ordinary 'char *'.
  
       Also warn when making a cast that introduces a type qualifier in an
!      unsafe way.  For example, casting 'char **' to 'const char **' is
       unsafe, as in this example:
  
              /* p is char ** value.  */
*************** present.
*** 4502,4613 ****
              /* Now char** pointer points to read-only memory.  */
              **p = 'b';
  
! `-Wcast-align'
!      Warn whenever a pointer is cast such that the required alignment
!      of the target is increased.  For example, warn if a `char *' is
!      cast to an `int *' on machines where integers can only be accessed
!      at two- or four-byte boundaries.
  
! `-Wwrite-strings'
!      When compiling C, give string constants the type `const
!      char[LENGTH]' so that copying the address of one into a
!      non-`const' `char *' pointer produces a warning.  These warnings
!      help you find at compile time code that can try to write into a
!      string constant, but only if you have been very careful about
!      using `const' in declarations and prototypes.  Otherwise, it is
!      just a nuisance. This is why we did not make `-Wall' request these
!      warnings.
  
       When compiling C++, warn about the deprecated conversion from
!      string literals to `char *'.  This warning is enabled by default
       for C++ programs.
  
! `-Wclobbered'
!      Warn for variables that might be changed by `longjmp' or `vfork'.
!      This warning is also enabled by `-Wextra'.
  
! `-Wconditionally-supported (C++ and Objective-C++ only)'
       Warn for conditionally-supported (C++11 [intro.defs]) constructs.
  
! `-Wconversion'
!      Warn for implicit conversions that may alter a value. This includes
!      conversions between real and integer, like `abs (x)' when `x' is
!      `double'; conversions between signed and unsigned, like `unsigned
!      ui = -1'; and conversions to smaller types, like `sqrtf (M_PI)'.
!      Do not warn for explicit casts like `abs ((int) x)' and `ui =
!      (unsigned) -1', or if the value is not changed by the conversion
!      like in `abs (2.0)'.  Warnings about conversions between signed
!      and unsigned integers can be disabled by using
!      `-Wno-sign-conversion'.
  
       For C++, also warn for confusing overload resolution for
       user-defined conversions; and conversions that never use a type
!      conversion operator: conversions to `void', the same type, a base
!      class or a reference to them. Warnings about conversions between
       signed and unsigned integers are disabled by default in C++ unless
!      `-Wsign-conversion' is explicitly enabled.
  
! `-Wno-conversion-null (C++ and Objective-C++ only)'
!      Do not warn for conversions between `NULL' and non-pointer types.
!      `-Wconversion-null' is enabled by default.
  
! `-Wzero-as-null-pointer-constant (C++ and Objective-C++ only)'
       Warn when a literal '0' is used as null pointer constant.  This can
!      be useful to facilitate the conversion to `nullptr' in C++11.
  
! `-Wdate-time'
!      Warn when macros `__TIME__', `__DATE__' or `__TIMESTAMP__' are
       encountered as they might prevent bit-wise-identical reproducible
       compilations.
  
! `-Wdelete-incomplete (C++ and Objective-C++ only)'
       Warn when deleting a pointer to incomplete type, which may cause
       undefined behavior at runtime.  This warning is enabled by default.
  
! `-Wuseless-cast (C++ and Objective-C++ only)'
       Warn when an expression is casted to its own type.
  
! `-Wempty-body'
!      Warn if an empty body occurs in an `if', `else' or `do while'
!      statement.  This warning is also enabled by `-Wextra'.
  
! `-Wenum-compare'
       Warn about a comparison between values of different enumerated
       types.  In C++ enumeral mismatches in conditional expressions are
       also diagnosed and the warning is enabled by default.  In C this
!      warning is enabled by `-Wall'.
  
! `-Wjump-misses-init (C, Objective-C only)'
!      Warn if a `goto' statement or a `switch' statement jumps forward
       across the initialization of a variable, or jumps backward to a
       label after the variable has been initialized.  This only warns
       about variables that are initialized when they are declared.  This
       warning is only supported for C and Objective-C; in C++ this sort
       of branch is an error in any case.
  
!      `-Wjump-misses-init' is included in `-Wc++-compat'.  It can be
!      disabled with the `-Wno-jump-misses-init' option.
  
! `-Wsign-compare'
       Warn when a comparison between signed and unsigned values could
       produce an incorrect result when the signed value is converted to
!      unsigned.  This warning is also enabled by `-Wextra'; to get the
!      other warnings of `-Wextra' without this warning, use `-Wextra
       -Wno-sign-compare'.
  
! `-Wsign-conversion'
       Warn for implicit conversions that may change the sign of an
       integer value, like assigning a signed integer expression to an
!      unsigned integer variable. An explicit cast silences the warning.
!      In C, this option is enabled also by `-Wconversion'.
  
! `-Wfloat-conversion'
       Warn for implicit conversions that reduce the precision of a real
       value.  This includes conversions from real to integer, and from
       higher precision real to lower precision real values.  This option
!      is also enabled by `-Wconversion'.
  
! `-Wsized-deallocation (C++ and Objective-C++ only)'
       Warn about a definition of an unsized deallocation function
            void operator delete (void *) noexcept;
            void operator delete[] (void *) noexcept;
--- 4477,4587 ----
              /* Now char** pointer points to read-only memory.  */
              **p = 'b';
  
! '-Wcast-align'
!      Warn whenever a pointer is cast such that the required alignment of
!      the target is increased.  For example, warn if a 'char *' is cast
!      to an 'int *' on machines where integers can only be accessed at
!      two- or four-byte boundaries.
  
! '-Wwrite-strings'
!      When compiling C, give string constants the type 'const
!      char[LENGTH]' so that copying the address of one into a non-'const'
!      'char *' pointer produces a warning.  These warnings help you find
!      at compile time code that can try to write into a string constant,
!      but only if you have been very careful about using 'const' in
!      declarations and prototypes.  Otherwise, it is just a nuisance.
!      This is why we did not make '-Wall' request these warnings.
  
       When compiling C++, warn about the deprecated conversion from
!      string literals to 'char *'.  This warning is enabled by default
       for C++ programs.
  
! '-Wclobbered'
!      Warn for variables that might be changed by 'longjmp' or 'vfork'.
!      This warning is also enabled by '-Wextra'.
  
! '-Wconditionally-supported (C++ and Objective-C++ only)'
       Warn for conditionally-supported (C++11 [intro.defs]) constructs.
  
! '-Wconversion'
!      Warn for implicit conversions that may alter a value.  This
!      includes conversions between real and integer, like 'abs (x)' when
!      'x' is 'double'; conversions between signed and unsigned, like
!      'unsigned ui = -1'; and conversions to smaller types, like 'sqrtf
!      (M_PI)'.  Do not warn for explicit casts like 'abs ((int) x)' and
!      'ui = (unsigned) -1', or if the value is not changed by the
!      conversion like in 'abs (2.0)'.  Warnings about conversions between
!      signed and unsigned integers can be disabled by using
!      '-Wno-sign-conversion'.
  
       For C++, also warn for confusing overload resolution for
       user-defined conversions; and conversions that never use a type
!      conversion operator: conversions to 'void', the same type, a base
!      class or a reference to them.  Warnings about conversions between
       signed and unsigned integers are disabled by default in C++ unless
!      '-Wsign-conversion' is explicitly enabled.
  
! '-Wno-conversion-null (C++ and Objective-C++ only)'
!      Do not warn for conversions between 'NULL' and non-pointer types.
!      '-Wconversion-null' is enabled by default.
  
! '-Wzero-as-null-pointer-constant (C++ and Objective-C++ only)'
       Warn when a literal '0' is used as null pointer constant.  This can
!      be useful to facilitate the conversion to 'nullptr' in C++11.
  
! '-Wdate-time'
!      Warn when macros '__TIME__', '__DATE__' or '__TIMESTAMP__' are
       encountered as they might prevent bit-wise-identical reproducible
       compilations.
  
! '-Wdelete-incomplete (C++ and Objective-C++ only)'
       Warn when deleting a pointer to incomplete type, which may cause
       undefined behavior at runtime.  This warning is enabled by default.
  
! '-Wuseless-cast (C++ and Objective-C++ only)'
       Warn when an expression is casted to its own type.
  
! '-Wempty-body'
!      Warn if an empty body occurs in an 'if', 'else' or 'do while'
!      statement.  This warning is also enabled by '-Wextra'.
  
! '-Wenum-compare'
       Warn about a comparison between values of different enumerated
       types.  In C++ enumeral mismatches in conditional expressions are
       also diagnosed and the warning is enabled by default.  In C this
!      warning is enabled by '-Wall'.
  
! '-Wjump-misses-init (C, Objective-C only)'
!      Warn if a 'goto' statement or a 'switch' statement jumps forward
       across the initialization of a variable, or jumps backward to a
       label after the variable has been initialized.  This only warns
       about variables that are initialized when they are declared.  This
       warning is only supported for C and Objective-C; in C++ this sort
       of branch is an error in any case.
  
!      '-Wjump-misses-init' is included in '-Wc++-compat'.  It can be
!      disabled with the '-Wno-jump-misses-init' option.
  
! '-Wsign-compare'
       Warn when a comparison between signed and unsigned values could
       produce an incorrect result when the signed value is converted to
!      unsigned.  This warning is also enabled by '-Wextra'; to get the
!      other warnings of '-Wextra' without this warning, use '-Wextra
       -Wno-sign-compare'.
  
! '-Wsign-conversion'
       Warn for implicit conversions that may change the sign of an
       integer value, like assigning a signed integer expression to an
!      unsigned integer variable.  An explicit cast silences the warning.
!      In C, this option is enabled also by '-Wconversion'.
  
! '-Wfloat-conversion'
       Warn for implicit conversions that reduce the precision of a real
       value.  This includes conversions from real to integer, and from
       higher precision real to lower precision real values.  This option
!      is also enabled by '-Wconversion'.
  
! '-Wsized-deallocation (C++ and Objective-C++ only)'
       Warn about a definition of an unsized deallocation function
            void operator delete (void *) noexcept;
            void operator delete[] (void *) noexcept;
*************** present.
*** 4615,4666 ****
       function
            void operator delete (void *, std::size_t) noexcept;
            void operator delete[] (void *, std::size_t) noexcept;
!      or vice versa.  Enabled by `-Wextra' along with
!      `-fsized-deallocation'.
  
! `-Wsizeof-pointer-memaccess'
       Warn for suspicious length parameters to certain string and memory
!      built-in functions if the argument uses `sizeof'.  This warning
!      warns e.g.  about `memset (ptr, 0, sizeof (ptr));' if `ptr' is not
       an array, but a pointer, and suggests a possible fix, or about
!      `memcpy (&foo, ptr, sizeof (&foo));'.  This warning is enabled by
!      `-Wall'.
  
! `-Wsizeof-array-argument'
!      Warn when the `sizeof' operator is applied to a parameter that is
       declared as an array in a function definition.  This warning is
       enabled by default for C and C++ programs.
  
! `-Wmemset-transposed-args'
!      Warn for suspicious calls to the `memset' built-in function, if the
       second argument is not zero and the third argument is zero.  This
!      warns e.g. about `memset (buf, sizeof buf, 0)' where most probably
!      `memset (buf, 0, sizeof buf)' was meant instead.  The diagnostics
       is only emitted if the third argument is literal zero.  If it is
       some expression that is folded to zero, a cast of zero to some
       type, etc., it is far less likely that the user has mistakenly
!      exchanged the arguments and no warning is emitted.  This warning
!      is enabled by `-Wall'.
  
! `-Waddress'
!      Warn about suspicious uses of memory addresses. These include using
!      the address of a function in a conditional expression, such as
!      `void func(void); if (func)', and comparisons against the memory
!      address of a string literal, such as `if (x == "abc")'.  Such uses
       typically indicate a programmer error: the address of a function
       always evaluates to true, so their use in a conditional usually
       indicate that the programmer forgot the parentheses in a function
       call; and comparisons against string literals result in unspecified
       behavior and are not portable in C, so they usually indicate that
!      the programmer intended to use `strcmp'.  This warning is enabled
!      by `-Wall'.
  
! `-Wlogical-op'
       Warn about suspicious uses of logical operators in expressions.
       This includes using logical operators in contexts where a bit-wise
       operator is likely to be expected.
  
! `-Wlogical-not-parentheses'
       Warn about logical not used on the left hand side operand of a
       comparison.  This option does not warn if the RHS operand is of a
       boolean type.  Its purpose is to detect suspicious code like the
--- 4589,4640 ----
       function
            void operator delete (void *, std::size_t) noexcept;
            void operator delete[] (void *, std::size_t) noexcept;
!      or vice versa.  Enabled by '-Wextra' along with
!      '-fsized-deallocation'.
  
! '-Wsizeof-pointer-memaccess'
       Warn for suspicious length parameters to certain string and memory
!      built-in functions if the argument uses 'sizeof'.  This warning
!      warns e.g. about 'memset (ptr, 0, sizeof (ptr));' if 'ptr' is not
       an array, but a pointer, and suggests a possible fix, or about
!      'memcpy (&foo, ptr, sizeof (&foo));'.  This warning is enabled by
!      '-Wall'.
  
! '-Wsizeof-array-argument'
!      Warn when the 'sizeof' operator is applied to a parameter that is
       declared as an array in a function definition.  This warning is
       enabled by default for C and C++ programs.
  
! '-Wmemset-transposed-args'
!      Warn for suspicious calls to the 'memset' built-in function, if the
       second argument is not zero and the third argument is zero.  This
!      warns e.g. about 'memset (buf, sizeof buf, 0)' where most probably
!      'memset (buf, 0, sizeof buf)' was meant instead.  The diagnostics
       is only emitted if the third argument is literal zero.  If it is
       some expression that is folded to zero, a cast of zero to some
       type, etc., it is far less likely that the user has mistakenly
!      exchanged the arguments and no warning is emitted.  This warning is
!      enabled by '-Wall'.
  
! '-Waddress'
!      Warn about suspicious uses of memory addresses.  These include
!      using the address of a function in a conditional expression, such
!      as 'void func(void); if (func)', and comparisons against the memory
!      address of a string literal, such as 'if (x == "abc")'.  Such uses
       typically indicate a programmer error: the address of a function
       always evaluates to true, so their use in a conditional usually
       indicate that the programmer forgot the parentheses in a function
       call; and comparisons against string literals result in unspecified
       behavior and are not portable in C, so they usually indicate that
!      the programmer intended to use 'strcmp'.  This warning is enabled
!      by '-Wall'.
  
! '-Wlogical-op'
       Warn about suspicious uses of logical operators in expressions.
       This includes using logical operators in contexts where a bit-wise
       operator is likely to be expected.
  
! '-Wlogical-not-parentheses'
       Warn about logical not used on the left hand side operand of a
       comparison.  This option does not warn if the RHS operand is of a
       boolean type.  Its purpose is to detect suspicious code like the
*************** present.
*** 4673,4726 ****
       parentheses:
            if ((!a) > 1) { ... }
  
!      This warning is enabled by `-Wall'.
  
! `-Waggregate-return'
       Warn if any functions that return structures or unions are defined
       or called.  (In languages where you can return an array, this also
       elicits a warning.)
  
! `-Wno-aggressive-loop-optimizations'
       Warn if in a loop with constant number of iterations the compiler
       detects undefined behavior in some statement during one or more of
       the iterations.
  
! `-Wno-attributes'
!      Do not warn if an unexpected `__attribute__' is used, such as
       unrecognized attributes, function attributes applied to variables,
       etc.  This does not stop errors for incorrect use of supported
       attributes.
  
! `-Wno-builtin-macro-redefined'
       Do not warn if certain built-in macros are redefined.  This
!      suppresses warnings for redefinition of `__TIMESTAMP__',
!      `__TIME__', `__DATE__', `__FILE__', and `__BASE_FILE__'.
  
! `-Wstrict-prototypes (C and Objective-C only)'
       Warn if a function is declared or defined without specifying the
       argument types.  (An old-style function definition is permitted
       without a warning if preceded by a declaration that specifies the
       argument types.)
  
! `-Wold-style-declaration (C and Objective-C only)'
       Warn for obsolescent usages, according to the C Standard, in a
!      declaration. For example, warn if storage-class specifiers like
!      `static' are not the first things in a declaration.  This warning
!      is also enabled by `-Wextra'.
  
! `-Wold-style-definition (C and Objective-C only)'
       Warn if an old-style function definition is used.  A warning is
       given even if there is a previous prototype.
  
! `-Wmissing-parameter-type (C and Objective-C only)'
       A function parameter is declared without a type specifier in
       K&R-style functions:
  
            void foo(bar) { }
  
!      This warning is also enabled by `-Wextra'.
  
! `-Wmissing-prototypes (C and Objective-C only)'
       Warn if a global function is defined without a previous prototype
       declaration.  This warning is issued even if the definition itself
       provides a prototype.  Use this option to detect global functions
--- 4647,4700 ----
       parentheses:
            if ((!a) > 1) { ... }
  
!      This warning is enabled by '-Wall'.
  
! '-Waggregate-return'
       Warn if any functions that return structures or unions are defined
       or called.  (In languages where you can return an array, this also
       elicits a warning.)
  
! '-Wno-aggressive-loop-optimizations'
       Warn if in a loop with constant number of iterations the compiler
       detects undefined behavior in some statement during one or more of
       the iterations.
  
! '-Wno-attributes'
!      Do not warn if an unexpected '__attribute__' is used, such as
       unrecognized attributes, function attributes applied to variables,
       etc.  This does not stop errors for incorrect use of supported
       attributes.
  
! '-Wno-builtin-macro-redefined'
       Do not warn if certain built-in macros are redefined.  This
!      suppresses warnings for redefinition of '__TIMESTAMP__',
!      '__TIME__', '__DATE__', '__FILE__', and '__BASE_FILE__'.
  
! '-Wstrict-prototypes (C and Objective-C only)'
       Warn if a function is declared or defined without specifying the
       argument types.  (An old-style function definition is permitted
       without a warning if preceded by a declaration that specifies the
       argument types.)
  
! '-Wold-style-declaration (C and Objective-C only)'
       Warn for obsolescent usages, according to the C Standard, in a
!      declaration.  For example, warn if storage-class specifiers like
!      'static' are not the first things in a declaration.  This warning
!      is also enabled by '-Wextra'.
  
! '-Wold-style-definition (C and Objective-C only)'
       Warn if an old-style function definition is used.  A warning is
       given even if there is a previous prototype.
  
! '-Wmissing-parameter-type (C and Objective-C only)'
       A function parameter is declared without a type specifier in
       K&R-style functions:
  
            void foo(bar) { }
  
!      This warning is also enabled by '-Wextra'.
  
! '-Wmissing-prototypes (C and Objective-C only)'
       Warn if a global function is defined without a previous prototype
       declaration.  This warning is issued even if the definition itself
       provides a prototype.  Use this option to detect global functions
*************** present.
*** 4728,4749 ****
       This option is not valid for C++ because all function declarations
       provide prototypes and a non-matching declaration declares an
       overload rather than conflict with an earlier declaration.  Use
!      `-Wmissing-declarations' to detect missing declarations in C++.
  
! `-Wmissing-declarations'
       Warn if a global function is defined without a previous
       declaration.  Do so even if the definition itself provides a
!      prototype.  Use this option to detect global functions that are
!      not declared in header files.  In C, no warnings are issued for
       functions with previous non-prototype declarations; use
!      `-Wmissing-prototypes' to detect missing prototypes.  In C++, no
       warnings are issued for function templates, or for inline
       functions, or for functions in anonymous namespaces.
  
! `-Wmissing-field-initializers'
       Warn if a structure's initializer has some fields missing.  For
!      example, the following code causes such a warning, because `x.h'
!      is implicitly zero:
  
            struct s { int f, g, h; };
            struct s x = { 3, 4 };
--- 4702,4723 ----
       This option is not valid for C++ because all function declarations
       provide prototypes and a non-matching declaration declares an
       overload rather than conflict with an earlier declaration.  Use
!      '-Wmissing-declarations' to detect missing declarations in C++.
  
! '-Wmissing-declarations'
       Warn if a global function is defined without a previous
       declaration.  Do so even if the definition itself provides a
!      prototype.  Use this option to detect global functions that are not
!      declared in header files.  In C, no warnings are issued for
       functions with previous non-prototype declarations; use
!      '-Wmissing-prototypes' to detect missing prototypes.  In C++, no
       warnings are issued for function templates, or for inline
       functions, or for functions in anonymous namespaces.
  
! '-Wmissing-field-initializers'
       Warn if a structure's initializer has some fields missing.  For
!      example, the following code causes such a warning, because 'x.h' is
!      implicitly zero:
  
            struct s { int f, g, h; };
            struct s x = { 3, 4 };
*************** present.
*** 4760,4857 ****
            struct s { int f, g, h; };
            s x = { };
  
!      This warning is included in `-Wextra'.  To get other `-Wextra'
!      warnings without this one, use `-Wextra
       -Wno-missing-field-initializers'.
  
! `-Wno-multichar'
!      Do not warn if a multicharacter constant (`'FOOF'') is used.
       Usually they indicate a typo in the user's code, as they have
       implementation-defined values, and should not be used in portable
       code.
  
! `-Wnormalized[=<none|id|nfc|nfkc>]'
       In ISO C and ISO C++, two identifiers are different if they are
       different sequences of characters.  However, sometimes when
       characters outside the basic ASCII character set are used, you can
       have two different character sequences that look the same.  To
       avoid confusion, the ISO 10646 standard sets out some
       "normalization rules" which when applied ensure that two sequences
!      that look the same are turned into the same sequence.  GCC can
!      warn you if you are using identifiers that have not been
!      normalized; this option controls that warning.
  
       There are four levels of warning supported by GCC.  The default is
!      `-Wnormalized=nfc', which warns about any identifier that is not
!      in the ISO 10646 "C" normalized form, "NFC".  NFC is the
!      recommended form for most uses.  It is equivalent to
!      `-Wnormalized'.
  
       Unfortunately, there are some characters allowed in identifiers by
       ISO C and ISO C++ that, when turned into NFC, are not allowed in
       identifiers.  That is, there's no way to use these symbols in
       portable ISO C or C++ and have all your identifiers in NFC.
!      `-Wnormalized=id' suppresses the warning for these characters.  It
       is hoped that future versions of the standards involved will
       correct this, which is why this option is not the default.
  
       You can switch the warning off for all characters by writing
!      `-Wnormalized=none' or `-Wno-normalized'.  You should only do this
       if you are using some other normalization scheme (like "D"),
       because otherwise you can easily create bugs that are literally
       impossible to see.
  
       Some characters in ISO 10646 have distinct meanings but look
       identical in some fonts or display methodologies, especially once
!      formatting has been applied.  For instance `\u207F', "SUPERSCRIPT
!      LATIN SMALL LETTER N", displays just like a regular `n' that has
       been placed in a superscript.  ISO 10646 defines the "NFKC"
       normalization scheme to convert all these into a standard form as
       well, and GCC warns if your code is not in NFKC if you use
!      `-Wnormalized=nfkc'.  This warning is comparable to warning about
       every identifier that contains the letter O because it might be
       confused with the digit 0, and so is not the default, but may be
       useful as a local coding convention if the programming environment
       cannot be fixed to display these characters distinctly.
  
! `-Wno-deprecated'
       Do not warn about usage of deprecated features.  *Note Deprecated
       Features::.
  
! `-Wno-deprecated-declarations'
       Do not warn about uses of functions (*note Function Attributes::),
       variables (*note Variable Attributes::), and types (*note Type
!      Attributes::) marked as deprecated by using the `deprecated'
       attribute.
  
! `-Wno-overflow'
       Do not warn about compile-time overflow in constant expressions.
  
! `-Wno-odr'
       Warn about One Definition Rule violations during link-time
!      optimization.  Requires `-flto-odr-type-merging' to be enabled.
       Enabled by default.
  
! `-Wopenmp-simd'
       Warn if the vectorizer cost model overrides the OpenMP or the Cilk
!      Plus simd directive set by user.  The `-fsimd-cost-model=unlimited'
       option can be used to relax the cost model.
  
! `-Woverride-init (C and Objective-C only)'
       Warn if an initialized field without side effects is overridden
       when using designated initializers (*note Designated Initializers:
       Designated Inits.).
  
!      This warning is included in `-Wextra'.  To get other `-Wextra'
!      warnings without this one, use `-Wextra -Wno-override-init'.
  
! `-Wpacked'
       Warn if a structure is given the packed attribute, but the packed
       attribute has no effect on the layout or size of the structure.
       Such structures may be mis-aligned for little benefit.  For
!      instance, in this code, the variable `f.x' in `struct bar' is
!      misaligned even though `struct bar' does not itself have the
!      packed attribute:
  
            struct foo {
              int x;
--- 4734,4830 ----
            struct s { int f, g, h; };
            s x = { };
  
!      This warning is included in '-Wextra'.  To get other '-Wextra'
!      warnings without this one, use '-Wextra
       -Wno-missing-field-initializers'.
  
! '-Wno-multichar'
!      Do not warn if a multicharacter constant (''FOOF'') is used.
       Usually they indicate a typo in the user's code, as they have
       implementation-defined values, and should not be used in portable
       code.
  
! '-Wnormalized[=<none|id|nfc|nfkc>]'
       In ISO C and ISO C++, two identifiers are different if they are
       different sequences of characters.  However, sometimes when
       characters outside the basic ASCII character set are used, you can
       have two different character sequences that look the same.  To
       avoid confusion, the ISO 10646 standard sets out some
       "normalization rules" which when applied ensure that two sequences
!      that look the same are turned into the same sequence.  GCC can warn
!      you if you are using identifiers that have not been normalized;
!      this option controls that warning.
  
       There are four levels of warning supported by GCC.  The default is
!      '-Wnormalized=nfc', which warns about any identifier that is not in
!      the ISO 10646 "C" normalized form, "NFC". NFC is the recommended
!      form for most uses.  It is equivalent to '-Wnormalized'.
  
       Unfortunately, there are some characters allowed in identifiers by
       ISO C and ISO C++ that, when turned into NFC, are not allowed in
       identifiers.  That is, there's no way to use these symbols in
       portable ISO C or C++ and have all your identifiers in NFC.
!      '-Wnormalized=id' suppresses the warning for these characters.  It
       is hoped that future versions of the standards involved will
       correct this, which is why this option is not the default.
  
       You can switch the warning off for all characters by writing
!      '-Wnormalized=none' or '-Wno-normalized'.  You should only do this
       if you are using some other normalization scheme (like "D"),
       because otherwise you can easily create bugs that are literally
       impossible to see.
  
       Some characters in ISO 10646 have distinct meanings but look
       identical in some fonts or display methodologies, especially once
!      formatting has been applied.  For instance '\u207F', "SUPERSCRIPT
!      LATIN SMALL LETTER N", displays just like a regular 'n' that has
       been placed in a superscript.  ISO 10646 defines the "NFKC"
       normalization scheme to convert all these into a standard form as
       well, and GCC warns if your code is not in NFKC if you use
!      '-Wnormalized=nfkc'.  This warning is comparable to warning about
       every identifier that contains the letter O because it might be
       confused with the digit 0, and so is not the default, but may be
       useful as a local coding convention if the programming environment
       cannot be fixed to display these characters distinctly.
  
! '-Wno-deprecated'
       Do not warn about usage of deprecated features.  *Note Deprecated
       Features::.
  
! '-Wno-deprecated-declarations'
       Do not warn about uses of functions (*note Function Attributes::),
       variables (*note Variable Attributes::), and types (*note Type
!      Attributes::) marked as deprecated by using the 'deprecated'
       attribute.
  
! '-Wno-overflow'
       Do not warn about compile-time overflow in constant expressions.
  
! '-Wno-odr'
       Warn about One Definition Rule violations during link-time
!      optimization.  Requires '-flto-odr-type-merging' to be enabled.
       Enabled by default.
  
! '-Wopenmp-simd'
       Warn if the vectorizer cost model overrides the OpenMP or the Cilk
!      Plus simd directive set by user.  The '-fsimd-cost-model=unlimited'
       option can be used to relax the cost model.
  
! '-Woverride-init (C and Objective-C only)'
       Warn if an initialized field without side effects is overridden
       when using designated initializers (*note Designated Initializers:
       Designated Inits.).
  
!      This warning is included in '-Wextra'.  To get other '-Wextra'
!      warnings without this one, use '-Wextra -Wno-override-init'.
  
! '-Wpacked'
       Warn if a structure is given the packed attribute, but the packed
       attribute has no effect on the layout or size of the structure.
       Such structures may be mis-aligned for little benefit.  For
!      instance, in this code, the variable 'f.x' in 'struct bar' is
!      misaligned even though 'struct bar' does not itself have the packed
!      attribute:
  
            struct foo {
              int x;
*************** present.
*** 4862,4874 ****
              struct foo f;
            };
  
! `-Wpacked-bitfield-compat'
!      The 4.1, 4.2 and 4.3 series of GCC ignore the `packed' attribute
!      on bit-fields of type `char'.  This has been fixed in GCC 4.4 but
!      the change can lead to differences in the structure layout.  GCC
       informs you when the offset of such a field has changed in GCC 4.4.
!      For example there is no longer a 4-bit padding between field `a'
!      and `b' in this structure:
  
            struct foo
            {
--- 4835,4847 ----
              struct foo f;
            };
  
! '-Wpacked-bitfield-compat'
!      The 4.1, 4.2 and 4.3 series of GCC ignore the 'packed' attribute on
!      bit-fields of type 'char'.  This has been fixed in GCC 4.4 but the
!      change can lead to differences in the structure layout.  GCC
       informs you when the offset of such a field has changed in GCC 4.4.
!      For example there is no longer a 4-bit padding between field 'a'
!      and 'b' in this structure:
  
            struct foo
            {
*************** present.
*** 4877,4905 ****
            } __attribute__ ((packed));
  
       This warning is enabled by default.  Use
!      `-Wno-packed-bitfield-compat' to disable this warning.
  
! `-Wpadded'
       Warn if padding is included in a structure, either to align an
       element of the structure or to align the whole structure.
       Sometimes when this happens it is possible to rearrange the fields
       of the structure to reduce the padding and so make the structure
       smaller.
  
! `-Wredundant-decls'
!      Warn if anything is declared more than once in the same scope,
!      even in cases where multiple declaration is valid and changes
!      nothing.
  
! `-Wnested-externs (C and Objective-C only)'
!      Warn if an `extern' declaration is encountered within a function.
  
! `-Wno-inherited-variadic-ctor'
       Suppress warnings about use of C++11 inheriting constructors when
       the base class inherited from has a C variadic constructor; the
       warning is on by default because the ellipsis is not inherited.
  
! `-Winline'
       Warn if a function that is declared as inline cannot be inlined.
       Even with this option, the compiler does not warn about failures to
       inline functions declared in system headers.
--- 4850,4877 ----
            } __attribute__ ((packed));
  
       This warning is enabled by default.  Use
!      '-Wno-packed-bitfield-compat' to disable this warning.
  
! '-Wpadded'
       Warn if padding is included in a structure, either to align an
       element of the structure or to align the whole structure.
       Sometimes when this happens it is possible to rearrange the fields
       of the structure to reduce the padding and so make the structure
       smaller.
  
! '-Wredundant-decls'
!      Warn if anything is declared more than once in the same scope, even
!      in cases where multiple declaration is valid and changes nothing.
  
! '-Wnested-externs (C and Objective-C only)'
!      Warn if an 'extern' declaration is encountered within a function.
  
! '-Wno-inherited-variadic-ctor'
       Suppress warnings about use of C++11 inheriting constructors when
       the base class inherited from has a C variadic constructor; the
       warning is on by default because the ellipsis is not inherited.
  
! '-Winline'
       Warn if a function that is declared as inline cannot be inlined.
       Even with this option, the compiler does not warn about failures to
       inline functions declared in system headers.
*************** present.
*** 4909,4969 ****
       account the size of the function being inlined and the amount of
       inlining that has already been done in the current function.
       Therefore, seemingly insignificant changes in the source program
!      can cause the warnings produced by `-Winline' to appear or
       disappear.
  
! `-Wno-invalid-offsetof (C++ and Objective-C++ only)'
!      Suppress warnings from applying the `offsetof' macro to a non-POD
!      type.  According to the 2014 ISO C++ standard, applying `offsetof'
       to a non-standard-layout type is undefined.  In existing C++
!      implementations, however, `offsetof' typically gives meaningful
       results.  This flag is for users who are aware that they are
!      writing nonportable code and who have deliberately chosen to
!      ignore the warning about it.
  
!      The restrictions on `offsetof' may be relaxed in a future version
       of the C++ standard.
  
! `-Wno-int-to-pointer-cast'
       Suppress warnings from casts to pointer type of an integer of a
!      different size. In C++, casting to a pointer type of smaller size
!      is an error. `Wint-to-pointer-cast' is enabled by default.
  
! `-Wno-pointer-to-int-cast (C and Objective-C only)'
       Suppress warnings from casts from a pointer to an integer type of a
       different size.
  
! `-Winvalid-pch'
!      Warn if a precompiled header (*note Precompiled Headers::) is
!      found in the search path but can't be used.
  
! `-Wlong-long'
!      Warn if `long long' type is used.  This is enabled by either
!      `-Wpedantic' or `-Wtraditional' in ISO C90 and C++98 modes.  To
!      inhibit the warning messages, use `-Wno-long-long'.
  
! `-Wvariadic-macros'
       Warn if variadic macros are used in ISO C90 mode, or if the GNU
       alternate syntax is used in ISO C99 mode.  This is enabled by
!      either `-Wpedantic' or `-Wtraditional'.  To inhibit the warning
!      messages, use `-Wno-variadic-macros'.
  
! `-Wvarargs'
       Warn upon questionable usage of the macros used to handle variable
!      arguments like `va_start'.  This is default.  To inhibit the
!      warning messages, use `-Wno-varargs'.
  
! `-Wvector-operation-performance'
       Warn if vector operation is not implemented via SIMD capabilities
       of the architecture.  Mainly useful for the performance tuning.
!      Vector operation can be implemented `piecewise', which means that
!      the scalar operation is performed on every vector element; `in
       parallel', which means that the vector operation is implemented
       using scalars of wider type, which normally is more performance
!      efficient; and `as a single scalar', which means that vector fits
       into a scalar type.
  
! `-Wno-virtual-move-assign'
       Suppress warnings about inheriting from a virtual base with a
       non-trivial C++11 move assignment operator.  This is dangerous
       because if the virtual base is reachable along more than one path,
--- 4881,4941 ----
       account the size of the function being inlined and the amount of
       inlining that has already been done in the current function.
       Therefore, seemingly insignificant changes in the source program
!      can cause the warnings produced by '-Winline' to appear or
       disappear.
  
! '-Wno-invalid-offsetof (C++ and Objective-C++ only)'
!      Suppress warnings from applying the 'offsetof' macro to a non-POD
!      type.  According to the 2014 ISO C++ standard, applying 'offsetof'
       to a non-standard-layout type is undefined.  In existing C++
!      implementations, however, 'offsetof' typically gives meaningful
       results.  This flag is for users who are aware that they are
!      writing nonportable code and who have deliberately chosen to ignore
!      the warning about it.
  
!      The restrictions on 'offsetof' may be relaxed in a future version
       of the C++ standard.
  
! '-Wno-int-to-pointer-cast'
       Suppress warnings from casts to pointer type of an integer of a
!      different size.  In C++, casting to a pointer type of smaller size
!      is an error.  'Wint-to-pointer-cast' is enabled by default.
  
! '-Wno-pointer-to-int-cast (C and Objective-C only)'
       Suppress warnings from casts from a pointer to an integer type of a
       different size.
  
! '-Winvalid-pch'
!      Warn if a precompiled header (*note Precompiled Headers::) is found
!      in the search path but can't be used.
  
! '-Wlong-long'
!      Warn if 'long long' type is used.  This is enabled by either
!      '-Wpedantic' or '-Wtraditional' in ISO C90 and C++98 modes.  To
!      inhibit the warning messages, use '-Wno-long-long'.
  
! '-Wvariadic-macros'
       Warn if variadic macros are used in ISO C90 mode, or if the GNU
       alternate syntax is used in ISO C99 mode.  This is enabled by
!      either '-Wpedantic' or '-Wtraditional'.  To inhibit the warning
!      messages, use '-Wno-variadic-macros'.
  
! '-Wvarargs'
       Warn upon questionable usage of the macros used to handle variable
!      arguments like 'va_start'.  This is default.  To inhibit the
!      warning messages, use '-Wno-varargs'.
  
! '-Wvector-operation-performance'
       Warn if vector operation is not implemented via SIMD capabilities
       of the architecture.  Mainly useful for the performance tuning.
!      Vector operation can be implemented 'piecewise', which means that
!      the scalar operation is performed on every vector element; 'in
       parallel', which means that the vector operation is implemented
       using scalars of wider type, which normally is more performance
!      efficient; and 'as a single scalar', which means that vector fits
       into a scalar type.
  
! '-Wno-virtual-move-assign'
       Suppress warnings about inheriting from a virtual base with a
       non-trivial C++11 move assignment operator.  This is dangerous
       because if the virtual base is reachable along more than one path,
*************** present.
*** 4972,4988 ****
       to avoid moving from a moved-from object, this warning can be
       disabled.
  
! `-Wvla'
!      Warn if variable length array is used in the code.  `-Wno-vla'
!      prevents the `-Wpedantic' warning of the variable length array.
  
! `-Wvolatile-register-var'
       Warn if a register variable is declared volatile.  The volatile
       modifier does not inhibit all optimizations that may eliminate
!      reads and/or writes to register variables.  This warning is
!      enabled by `-Wall'.
  
! `-Wdisabled-optimization'
       Warn if a requested optimization pass is disabled.  This warning
       does not generally indicate that there is anything wrong with your
       code; it merely indicates that GCC's optimizers are unable to
--- 4944,4960 ----
       to avoid moving from a moved-from object, this warning can be
       disabled.
  
! '-Wvla'
!      Warn if variable length array is used in the code.  '-Wno-vla'
!      prevents the '-Wpedantic' warning of the variable length array.
  
! '-Wvolatile-register-var'
       Warn if a register variable is declared volatile.  The volatile
       modifier does not inhibit all optimizations that may eliminate
!      reads and/or writes to register variables.  This warning is enabled
!      by '-Wall'.
  
! '-Wdisabled-optimization'
       Warn if a requested optimization pass is disabled.  This warning
       does not generally indicate that there is anything wrong with your
       code; it merely indicates that GCC's optimizers are unable to
*************** present.
*** 4991,5008 ****
       the optimization itself is likely to take inordinate amounts of
       time.
  
! `-Wpointer-sign (C and Objective-C only)'
       Warn for pointer argument passing or assignment with different
       signedness.  This option is only supported for C and Objective-C.
!      It is implied by `-Wall' and by `-Wpedantic', which can be
!      disabled with `-Wno-pointer-sign'.
  
! `-Wstack-protector'
!      This option is only active when `-fstack-protector' is active.  It
       warns about functions that are not protected against stack
       smashing.
  
! `-Woverlength-strings'
       Warn about string constants that are longer than the "minimum
       maximum" length specified in the C standard.  Modern compilers
       generally allow string constants that are much longer than the
--- 4963,4980 ----
       the optimization itself is likely to take inordinate amounts of
       time.
  
! '-Wpointer-sign (C and Objective-C only)'
       Warn for pointer argument passing or assignment with different
       signedness.  This option is only supported for C and Objective-C.
!      It is implied by '-Wall' and by '-Wpedantic', which can be disabled
!      with '-Wno-pointer-sign'.
  
! '-Wstack-protector'
!      This option is only active when '-fstack-protector' is active.  It
       warns about functions that are not protected against stack
       smashing.
  
! '-Woverlength-strings'
       Warn about string constants that are longer than the "minimum
       maximum" length specified in the C standard.  Modern compilers
       generally allow string constants that are much longer than the
*************** present.
*** 5014,5034 ****
       in C99, it was raised to 4095.  C++98 does not specify a normative
       minimum maximum, so we do not diagnose overlength strings in C++.
  
!      This option is implied by `-Wpedantic', and can be disabled with
!      `-Wno-overlength-strings'.
  
- `-Wunsuffixed-float-constants (C and Objective-C only)'
       Issue a warning for any floating constant that does not have a
!      suffix.  When used together with `-Wsystem-headers' it warns about
       such constants in system header files.  This can be useful when
!      preparing code to use with the `FLOAT_CONST_DECIMAL64' pragma from
       the decimal floating-point extension to C99.
  
! `-Wno-designated-init (C and Objective-C only)'
       Suppress warnings when a positional initializer is used to
       initialize a structure that has been marked with the
!      `designated_init' attribute.
! 
  
  
  File: gcc.info,  Node: Debugging Options,  Next: Optimize Options,  Prev: Warning Options,  Up: Invoking GCC
--- 4986,5006 ----
       in C99, it was raised to 4095.  C++98 does not specify a normative
       minimum maximum, so we do not diagnose overlength strings in C++.
  
!      This option is implied by '-Wpedantic', and can be disabled with
!      '-Wno-overlength-strings'.
! 
! '-Wunsuffixed-float-constants (C and Objective-C only)'
  
       Issue a warning for any floating constant that does not have a
!      suffix.  When used together with '-Wsystem-headers' it warns about
       such constants in system header files.  This can be useful when
!      preparing code to use with the 'FLOAT_CONST_DECIMAL64' pragma from
       the decimal floating-point extension to C99.
  
! '-Wno-designated-init (C and Objective-C only)'
       Suppress warnings when a positional initializer is used to
       initialize a structure that has been marked with the
!      'designated_init' attribute.
  
  
  File: gcc.info,  Node: Debugging Options,  Next: Optimize Options,  Prev: Warning Options,  Up: Invoking GCC
*************** File: gcc.info,  Node: Debugging Options
*** 5039,5058 ****
  GCC has various special options that are used for debugging either your
  program or GCC:
  
! `-g'
       Produce debugging information in the operating system's native
       format (stabs, COFF, XCOFF, or DWARF 2).  GDB can work with this
       debugging information.
  
!      On most systems that use stabs format, `-g' enables use of extra
       debugging information that only GDB can use; this extra information
       makes debugging work better in GDB but probably makes other
       debuggers crash or refuse to read the program.  If you want to
       control for certain whether to generate the extra information, use
!      `-gstabs+', `-gstabs', `-gxcoff+', `-gxcoff', or `-gvms' (see
       below).
  
!      GCC allows you to use `-g' with `-O'.  The shortcuts taken by
       optimized code may occasionally produce surprising results: some
       variables you declared may not exist at all; flow of control may
       briefly move where you did not expect it; some statements may not
--- 5011,5030 ----
  GCC has various special options that are used for debugging either your
  program or GCC:
  
! '-g'
       Produce debugging information in the operating system's native
       format (stabs, COFF, XCOFF, or DWARF 2).  GDB can work with this
       debugging information.
  
!      On most systems that use stabs format, '-g' enables use of extra
       debugging information that only GDB can use; this extra information
       makes debugging work better in GDB but probably makes other
       debuggers crash or refuse to read the program.  If you want to
       control for certain whether to generate the extra information, use
!      '-gstabs+', '-gstabs', '-gxcoff+', '-gxcoff', or '-gvms' (see
       below).
  
!      GCC allows you to use '-g' with '-O'.  The shortcuts taken by
       optimized code may occasionally produce surprising results: some
       variables you declared may not exist at all; flow of control may
       briefly move where you did not expect it; some statements may not
*************** program or GCC:
*** 5067,5139 ****
       The following options are useful when GCC is generated with the
       capability for more than one debugging format.
  
! `-gsplit-dwarf'
       Separate as much dwarf debugging information as possible into a
       separate output file with the extension .dwo.  This option allows
       the build system to avoid linking files with debug information.  To
       be useful, this option requires a debugger capable of reading .dwo
       files.
  
! `-ggdb'
       Produce debugging information for use by GDB.  This means to use
!      the most expressive format available (DWARF 2, stabs, or the
!      native format if neither of those are supported), including GDB
!      extensions if at all possible.
  
! `-gpubnames'
       Generate dwarf .debug_pubnames and .debug_pubtypes sections.
  
! `-ggnu-pubnames'
       Generate .debug_pubnames and .debug_pubtypes sections in a format
       suitable for conversion into a GDB index.  This option is only
       useful with a linker that can produce GDB index version 7.
  
! `-gstabs'
       Produce debugging information in stabs format (if that is
!      supported), without GDB extensions.  This is the format used by
!      DBX on most BSD systems.  On MIPS, Alpha and System V Release 4
!      systems this option produces stabs debugging output that is not
!      understood by DBX or SDB.  On System V Release 4 systems this
!      option requires the GNU assembler.
  
! `-feliminate-unused-debug-symbols'
       Produce debugging information in stabs format (if that is
       supported), for only symbols that are actually used.
  
! `-femit-class-debug-always'
       Instead of emitting debugging information for a C++ class in only
!      one object file, emit it in all object files using the class.
!      This option should be used only with debuggers that are unable to
!      handle the way GCC normally emits debugging information for
!      classes because using this option increases the size of debugging
       information by as much as a factor of two.
  
! `-fdebug-types-section'
       When using DWARF Version 4 or higher, type DIEs can be put into
!      their own `.debug_types' section instead of making them part of the
!      `.debug_info' section.  It is more efficient to put them in a
       separate comdat sections since the linker can then remove
!      duplicates.  But not all DWARF consumers support `.debug_types'
!      sections yet and on some objects `.debug_types' produces larger
       instead of smaller debugging information.
  
! `-gstabs+'
       Produce debugging information in stabs format (if that is
       supported), using GNU extensions understood only by the GNU
       debugger (GDB).  The use of these extensions is likely to make
       other debuggers crash or refuse to read the program.
  
! `-gcoff'
       Produce debugging information in COFF format (if that is
       supported).  This is the format used by SDB on most System V
       systems prior to System V Release 4.
  
! `-gxcoff'
       Produce debugging information in XCOFF format (if that is
       supported).  This is the format used by the DBX debugger on IBM
       RS/6000 systems.
  
! `-gxcoff+'
       Produce debugging information in XCOFF format (if that is
       supported), using GNU extensions understood only by the GNU
       debugger (GDB).  The use of these extensions is likely to make
--- 5039,5111 ----
       The following options are useful when GCC is generated with the
       capability for more than one debugging format.
  
! '-gsplit-dwarf'
       Separate as much dwarf debugging information as possible into a
       separate output file with the extension .dwo.  This option allows
       the build system to avoid linking files with debug information.  To
       be useful, this option requires a debugger capable of reading .dwo
       files.
  
! '-ggdb'
       Produce debugging information for use by GDB.  This means to use
!      the most expressive format available (DWARF 2, stabs, or the native
!      format if neither of those are supported), including GDB extensions
!      if at all possible.
  
! '-gpubnames'
       Generate dwarf .debug_pubnames and .debug_pubtypes sections.
  
! '-ggnu-pubnames'
       Generate .debug_pubnames and .debug_pubtypes sections in a format
       suitable for conversion into a GDB index.  This option is only
       useful with a linker that can produce GDB index version 7.
  
! '-gstabs'
       Produce debugging information in stabs format (if that is
!      supported), without GDB extensions.  This is the format used by DBX
!      on most BSD systems.  On MIPS, Alpha and System V Release 4 systems
!      this option produces stabs debugging output that is not understood
!      by DBX or SDB.  On System V Release 4 systems this option requires
!      the GNU assembler.
  
! '-feliminate-unused-debug-symbols'
       Produce debugging information in stabs format (if that is
       supported), for only symbols that are actually used.
  
! '-femit-class-debug-always'
       Instead of emitting debugging information for a C++ class in only
!      one object file, emit it in all object files using the class.  This
!      option should be used only with debuggers that are unable to handle
!      the way GCC normally emits debugging information for classes
!      because using this option increases the size of debugging
       information by as much as a factor of two.
  
! '-fdebug-types-section'
       When using DWARF Version 4 or higher, type DIEs can be put into
!      their own '.debug_types' section instead of making them part of the
!      '.debug_info' section.  It is more efficient to put them in a
       separate comdat sections since the linker can then remove
!      duplicates.  But not all DWARF consumers support '.debug_types'
!      sections yet and on some objects '.debug_types' produces larger
       instead of smaller debugging information.
  
! '-gstabs+'
       Produce debugging information in stabs format (if that is
       supported), using GNU extensions understood only by the GNU
       debugger (GDB).  The use of these extensions is likely to make
       other debuggers crash or refuse to read the program.
  
! '-gcoff'
       Produce debugging information in COFF format (if that is
       supported).  This is the format used by SDB on most System V
       systems prior to System V Release 4.
  
! '-gxcoff'
       Produce debugging information in XCOFF format (if that is
       supported).  This is the format used by the DBX debugger on IBM
       RS/6000 systems.
  
! '-gxcoff+'
       Produce debugging information in XCOFF format (if that is
       supported), using GNU extensions understood only by the GNU
       debugger (GDB).  The use of these extensions is likely to make
*************** program or GCC:
*** 5141,5147 ****
       assemblers other than the GNU assembler (GAS) to fail with an
       error.
  
! `-gdwarf-VERSION'
       Produce debugging information in DWARF format (if that is
       supported).  The value of VERSION may be either 2, 3, 4 or 5; the
       default version for most targets is 4.  DWARF Version 5 is only
--- 5113,5119 ----
       assemblers other than the GNU assembler (GAS) to fail with an
       error.
  
! '-gdwarf-VERSION'
       Produce debugging information in DWARF format (if that is
       supported).  The value of VERSION may be either 2, 3, 4 or 5; the
       default version for most targets is 4.  DWARF Version 5 is only
*************** program or GCC:
*** 5150,5294 ****
       Note that with DWARF Version 2, some ports require and always use
       some non-conflicting DWARF 3 extensions in the unwind tables.
  
!      Version 4 may require GDB 7.0 and `-fvar-tracking-assignments' for
       maximum benefit.
  
! `-grecord-gcc-switches'
       This switch causes the command-line options used to invoke the
       compiler that may affect code generation to be appended to the
       DW_AT_producer attribute in DWARF debugging information.  The
       options are concatenated with spaces separating them from each
       other and from the compiler version.  See also
!      `-frecord-gcc-switches' for another way of storing compiler
!      options into the object file.  This is the default.
  
! `-gno-record-gcc-switches'
       Disallow appending command-line options to the DW_AT_producer
       attribute in DWARF debugging information.
  
! `-gstrict-dwarf'
       Disallow using extensions of later DWARF standard version than
!      selected with `-gdwarf-VERSION'.  On most targets using
       non-conflicting DWARF extensions from later standard versions is
       allowed.
  
! `-gno-strict-dwarf'
       Allow using extensions of later DWARF standard version than
!      selected with `-gdwarf-VERSION'.
  
! `-gz[=TYPE]'
       Produce compressed debug sections in DWARF format, if that is
       supported.  If TYPE is not given, the default type depends on the
       capabilities of the assembler and linker used.  TYPE may be one of
!      `none' (don't compress debug sections), `zlib' (use zlib
!      compression in ELF gABI format), or `zlib-gnu' (use zlib
       compression in traditional GNU format).  If the linker doesn't
       support writing compressed debug sections, the option is rejected.
!      Otherwise, if the assembler does not support them, `-gz' is
       silently ignored when producing object files.
  
! `-gvms'
       Produce debugging information in Alpha/VMS debug format (if that is
       supported).  This is the format used by DEBUG on Alpha/VMS systems.
  
! `-gLEVEL'
! `-ggdbLEVEL'
! `-gstabsLEVEL'
! `-gcoffLEVEL'
! `-gxcoffLEVEL'
! `-gvmsLEVEL'
       Request debugging information and also use LEVEL to specify how
       much information.  The default level is 2.
  
!      Level 0 produces no debug information at all.  Thus, `-g0' negates
!      `-g'.
  
       Level 1 produces minimal information, enough for making backtraces
       in parts of the program that you don't plan to debug.  This
!      includes descriptions of functions and external variables, and
!      line number tables, but no information about local variables.
  
       Level 3 includes extra information, such as all the macro
       definitions present in the program.  Some debuggers support macro
!      expansion when you use `-g3'.
  
!      `-gdwarf-2' does not accept a concatenated debug level, because
!      GCC used to support an option `-gdwarf' that meant to generate
!      debug information in version 1 of the DWARF format (which is very
       different from version 2), and it would have been too confusing.
       That debug format is long obsolete, but the option cannot be
!      changed now.  Instead use an additional `-gLEVEL' option to change
       the debug level for DWARF.
  
! `-gtoggle'
       Turn off generation of debug info, if leaving out this option
       generates it, or turn it on at level 2 otherwise.  The position of
       this argument in the command line does not matter; it takes effect
!      after all other options are processed, and it does so only once,
!      no matter how many times it is given.  This is mainly intended to
!      be used with `-fcompare-debug'.
  
! `-fsanitize=address'
       Enable AddressSanitizer, a fast memory error detector.  Memory
       access instructions are instrumented to detect out-of-bounds and
       use-after-free bugs.  See
!      `https://github.com/google/sanitizers/wiki/AddressSanitizer' for
       more details.  The run-time behavior can be influenced using the
!      `ASAN_OPTIONS' environment variable.  When set to `help=1', the
!      available options are shown at startup of the instrumended
!      program.  See
!      `https://github.com/google/sanitizers/wiki/AddressSanitizerFlags#run-time-flags'
       for a list of supported options.
  
! `-fsanitize=kernel-address'
       Enable AddressSanitizer for Linux kernel.  See
!      `https://github.com/google/kasan/wiki' for more details.
  
! `-fsanitize=thread'
       Enable ThreadSanitizer, a fast data race detector.  Memory access
       instructions are instrumented to detect data race bugs.  See
!      `https://github.com/google/sanitizers/wiki#threadsanitizer' for
!      more details. The run-time behavior can be influenced using the
!      `TSAN_OPTIONS' environment variable; see
!      `https://github.com/google/sanitizers/wiki/ThreadSanitizerFlags'
       for a list of supported options.
  
! `-fsanitize=leak'
       Enable LeakSanitizer, a memory leak detector.  This option only
       matters for linking of executables and if neither
!      `-fsanitize=address' nor `-fsanitize=thread' is used.  In that
!      case the executable is linked against a library that overrides
!      `malloc' and other allocator functions.  See
!      `https://github.com/google/sanitizers/wiki/AddressSanitizerLeakSanitizer'
       for more details.  The run-time behavior can be influenced using
!      the `LSAN_OPTIONS' environment variable.
  
! `-fsanitize=undefined'
       Enable UndefinedBehaviorSanitizer, a fast undefined behavior
       detector.  Various computations are instrumented to detect
       undefined behavior at runtime.  Current suboptions are:
  
!     `-fsanitize=shift'
            This option enables checking that the result of a shift
            operation is not undefined.  Note that what exactly is
            considered undefined differs slightly between C and C++, as
            well as between ISO C90 and C99, etc.
  
!     `-fsanitize=integer-divide-by-zero'
!           Detect integer division by zero as well as `INT_MIN / -1'
            division.
  
!     `-fsanitize=unreachable'
            With this option, the compiler turns the
!           `__builtin_unreachable' call into a diagnostics message call
!           instead.  When reaching the `__builtin_unreachable' call, the
            behavior is undefined.
  
!     `-fsanitize=vla-bound'
!           This option instructs the compiler to check that the size of
!           a variable length array is positive.
  
!     `-fsanitize=null'
            This option enables pointer checking.  Particularly, the
            application built with this option turned on will issue an
            error message when it tries to dereference a NULL pointer, or
--- 5122,5266 ----
       Note that with DWARF Version 2, some ports require and always use
       some non-conflicting DWARF 3 extensions in the unwind tables.
  
!      Version 4 may require GDB 7.0 and '-fvar-tracking-assignments' for
       maximum benefit.
  
! '-grecord-gcc-switches'
       This switch causes the command-line options used to invoke the
       compiler that may affect code generation to be appended to the
       DW_AT_producer attribute in DWARF debugging information.  The
       options are concatenated with spaces separating them from each
       other and from the compiler version.  See also
!      '-frecord-gcc-switches' for another way of storing compiler options
!      into the object file.  This is the default.
  
! '-gno-record-gcc-switches'
       Disallow appending command-line options to the DW_AT_producer
       attribute in DWARF debugging information.
  
! '-gstrict-dwarf'
       Disallow using extensions of later DWARF standard version than
!      selected with '-gdwarf-VERSION'.  On most targets using
       non-conflicting DWARF extensions from later standard versions is
       allowed.
  
! '-gno-strict-dwarf'
       Allow using extensions of later DWARF standard version than
!      selected with '-gdwarf-VERSION'.
  
! '-gz[=TYPE]'
       Produce compressed debug sections in DWARF format, if that is
       supported.  If TYPE is not given, the default type depends on the
       capabilities of the assembler and linker used.  TYPE may be one of
!      'none' (don't compress debug sections), 'zlib' (use zlib
!      compression in ELF gABI format), or 'zlib-gnu' (use zlib
       compression in traditional GNU format).  If the linker doesn't
       support writing compressed debug sections, the option is rejected.
!      Otherwise, if the assembler does not support them, '-gz' is
       silently ignored when producing object files.
  
! '-gvms'
       Produce debugging information in Alpha/VMS debug format (if that is
       supported).  This is the format used by DEBUG on Alpha/VMS systems.
  
! '-gLEVEL'
! '-ggdbLEVEL'
! '-gstabsLEVEL'
! '-gcoffLEVEL'
! '-gxcoffLEVEL'
! '-gvmsLEVEL'
       Request debugging information and also use LEVEL to specify how
       much information.  The default level is 2.
  
!      Level 0 produces no debug information at all.  Thus, '-g0' negates
!      '-g'.
  
       Level 1 produces minimal information, enough for making backtraces
       in parts of the program that you don't plan to debug.  This
!      includes descriptions of functions and external variables, and line
!      number tables, but no information about local variables.
  
       Level 3 includes extra information, such as all the macro
       definitions present in the program.  Some debuggers support macro
!      expansion when you use '-g3'.
  
!      '-gdwarf-2' does not accept a concatenated debug level, because GCC
!      used to support an option '-gdwarf' that meant to generate debug
!      information in version 1 of the DWARF format (which is very
       different from version 2), and it would have been too confusing.
       That debug format is long obsolete, but the option cannot be
!      changed now.  Instead use an additional '-gLEVEL' option to change
       the debug level for DWARF.
  
! '-gtoggle'
       Turn off generation of debug info, if leaving out this option
       generates it, or turn it on at level 2 otherwise.  The position of
       this argument in the command line does not matter; it takes effect
!      after all other options are processed, and it does so only once, no
!      matter how many times it is given.  This is mainly intended to be
!      used with '-fcompare-debug'.
  
! '-fsanitize=address'
       Enable AddressSanitizer, a fast memory error detector.  Memory
       access instructions are instrumented to detect out-of-bounds and
       use-after-free bugs.  See
!      <https://github.com/google/sanitizers/wiki/AddressSanitizer> for
       more details.  The run-time behavior can be influenced using the
!      'ASAN_OPTIONS' environment variable.  When set to 'help=1', the
!      available options are shown at startup of the instrumended program.
!      See
!      <https://github.com/google/sanitizers/wiki/AddressSanitizerFlags#run-time-flags>
       for a list of supported options.
  
! '-fsanitize=kernel-address'
       Enable AddressSanitizer for Linux kernel.  See
!      <https://github.com/google/kasan/wiki> for more details.
  
! '-fsanitize=thread'
       Enable ThreadSanitizer, a fast data race detector.  Memory access
       instructions are instrumented to detect data race bugs.  See
!      <https://github.com/google/sanitizers/wiki#threadsanitizer> for
!      more details.  The run-time behavior can be influenced using the
!      'TSAN_OPTIONS' environment variable; see
!      <https://github.com/google/sanitizers/wiki/ThreadSanitizerFlags>
       for a list of supported options.
  
! '-fsanitize=leak'
       Enable LeakSanitizer, a memory leak detector.  This option only
       matters for linking of executables and if neither
!      '-fsanitize=address' nor '-fsanitize=thread' is used.  In that case
!      the executable is linked against a library that overrides 'malloc'
!      and other allocator functions.  See
!      <https://github.com/google/sanitizers/wiki/AddressSanitizerLeakSanitizer>
       for more details.  The run-time behavior can be influenced using
!      the 'LSAN_OPTIONS' environment variable.
  
! '-fsanitize=undefined'
       Enable UndefinedBehaviorSanitizer, a fast undefined behavior
       detector.  Various computations are instrumented to detect
       undefined behavior at runtime.  Current suboptions are:
  
!      '-fsanitize=shift'
            This option enables checking that the result of a shift
            operation is not undefined.  Note that what exactly is
            considered undefined differs slightly between C and C++, as
            well as between ISO C90 and C99, etc.
  
!      '-fsanitize=integer-divide-by-zero'
!           Detect integer division by zero as well as 'INT_MIN / -1'
            division.
  
!      '-fsanitize=unreachable'
            With this option, the compiler turns the
!           '__builtin_unreachable' call into a diagnostics message call
!           instead.  When reaching the '__builtin_unreachable' call, the
            behavior is undefined.
  
!      '-fsanitize=vla-bound'
!           This option instructs the compiler to check that the size of a
!           variable length array is positive.
  
!      '-fsanitize=null'
            This option enables pointer checking.  Particularly, the
            application built with this option turned on will issue an
            error message when it tries to dereference a NULL pointer, or
*************** program or GCC:
*** 5296,5405 ****
            NULL pointer, or if a method is invoked on an object pointed
            by a NULL pointer.
  
!     `-fsanitize=return'
!           This option enables return statement checking.  Programs
!           built with this option turned on will issue an error message
!           when the end of a non-void function is reached without
!           actually returning a value.  This option works in C++ only.
  
!     `-fsanitize=signed-integer-overflow'
            This option enables signed integer overflow checking.  We
!           check that the result of `+', `*', and both unary and binary
!           `-' does not overflow in the signed arithmetics.  Note,
            integer promotion rules must be taken into account.  That is,
            the following is not an overflow:
                 signed char a = SCHAR_MAX;
                 a++;
  
!     `-fsanitize=bounds'
            This option enables instrumentation of array bounds.  Various
            out of bounds accesses are detected.  Flexible array members,
            flexible array member-like arrays, and initializers of
            variables with static storage are not instrumented.
  
!     `-fsanitize=alignment'
            This option enables checking of alignment of pointers when
            they are dereferenced, or when a reference is bound to
!           insufficiently aligned target, or when a method or
!           constructor is invoked on insufficiently aligned object.
  
!     `-fsanitize=object-size'
!           This option enables instrumentation of memory references
!           using the `__builtin_object_size' function.  Various out of
!           bounds pointer accesses are detected.
  
!     `-fsanitize=float-divide-by-zero'
            Detect floating-point division by zero.  Unlike other similar
!           options, `-fsanitize=float-divide-by-zero' is not enabled by
!           `-fsanitize=undefined', since floating-point division by zero
            can be a legitimate way of obtaining infinities and NaNs.
  
!     `-fsanitize=float-cast-overflow'
            This option enables floating-point type to integer conversion
!           checking.  We check that the result of the conversion does
!           not overflow.  Unlike other similar options,
!           `-fsanitize=float-cast-overflow' is not enabled by
!           `-fsanitize=undefined'.  This option does not work well with
!           `FE_INVALID' exceptions enabled.
  
!     `-fsanitize=nonnull-attribute'
!           This option enables instrumentation of calls, checking
!           whether null values are not passed to arguments marked as
!           requiring a non-null value by the `nonnull' function
!           attribute.
  
-     `-fsanitize=returns-nonnull-attribute'
            This option enables instrumentation of return statements in
!           functions marked with `returns_nonnull' function attribute,
!           to detect returning of null values from such functions.
  
-     `-fsanitize=bool'
            This option enables instrumentation of loads from bool.  If a
            value other than 0/1 is loaded, a run-time error is issued.
  
!     `-fsanitize=enum'
            This option enables instrumentation of loads from an enum
            type.  If a value outside the range of values for the enum
            type is loaded, a run-time error is issued.
  
!     `-fsanitize=vptr'
            This option enables instrumentation of C++ member function
            calls, member accesses and some conversions between pointers
            to base and derived classes, to verify the referenced object
            has the correct dynamic type.
  
! 
!      While `-ftrapv' causes traps for signed overflows to be emitted,
!      `-fsanitize=undefined' gives a diagnostic message.  This currently
       works only for the C family of languages.
  
! `-fno-sanitize=all'
       This option disables all previously enabled sanitizers.
!      `-fsanitize=all' is not allowed, as some sanitizers cannot be used
       together.
  
! `-fasan-shadow-offset=NUMBER'
       This option forces GCC to use custom shadow offset in
       AddressSanitizer checks.  It is useful for experimenting with
       different shadow memory layouts in Kernel AddressSanitizer.
  
! `-fsanitize-recover[=OPTS]'
!      `-fsanitize-recover=' controls error recovery mode for sanitizers
       mentioned in comma-separated list of OPTS.  Enabling this option
       for a sanitizer component causes it to attempt to continue running
       the program as if no error happened.  This means multiple runtime
       errors can be reported in a single program run, and the exit code
       of the program may indicate success even when errors have been
!      reported.  The `-fno-sanitize-recover=' option can be used to alter
       this behavior: only the first detected error is reported and
       program then exits with a non-zero exit code.
  
!      Currently this feature only works for `-fsanitize=undefined' (and
!      its suboptions except for `-fsanitize=unreachable' and
!      `-fsanitize=return'), `-fsanitize=float-cast-overflow',
!      `-fsanitize=float-divide-by-zero' and `-fsanitize=kernel-address'.
       For these sanitizers error recovery is turned on by default.
!      `-fsanitize-recover=all' and `-fno-sanitize-recover=all' is also
       accepted, the former enables recovery for all sanitizers that
       support it, the latter disables recovery for all sanitizers that
       support it.
--- 5268,5382 ----
            NULL pointer, or if a method is invoked on an object pointed
            by a NULL pointer.
  
!      '-fsanitize=return'
!           This option enables return statement checking.  Programs built
!           with this option turned on will issue an error message when
!           the end of a non-void function is reached without actually
!           returning a value.  This option works in C++ only.
  
!      '-fsanitize=signed-integer-overflow'
            This option enables signed integer overflow checking.  We
!           check that the result of '+', '*', and both unary and binary
!           '-' does not overflow in the signed arithmetics.  Note,
            integer promotion rules must be taken into account.  That is,
            the following is not an overflow:
                 signed char a = SCHAR_MAX;
                 a++;
  
!      '-fsanitize=bounds'
            This option enables instrumentation of array bounds.  Various
            out of bounds accesses are detected.  Flexible array members,
            flexible array member-like arrays, and initializers of
            variables with static storage are not instrumented.
  
!      '-fsanitize=alignment'
! 
            This option enables checking of alignment of pointers when
            they are dereferenced, or when a reference is bound to
!           insufficiently aligned target, or when a method or constructor
!           is invoked on insufficiently aligned object.
  
!      '-fsanitize=object-size'
!           This option enables instrumentation of memory references using
!           the '__builtin_object_size' function.  Various out of bounds
!           pointer accesses are detected.
  
!      '-fsanitize=float-divide-by-zero'
            Detect floating-point division by zero.  Unlike other similar
!           options, '-fsanitize=float-divide-by-zero' is not enabled by
!           '-fsanitize=undefined', since floating-point division by zero
            can be a legitimate way of obtaining infinities and NaNs.
  
!      '-fsanitize=float-cast-overflow'
            This option enables floating-point type to integer conversion
!           checking.  We check that the result of the conversion does not
!           overflow.  Unlike other similar options,
!           '-fsanitize=float-cast-overflow' is not enabled by
!           '-fsanitize=undefined'.  This option does not work well with
!           'FE_INVALID' exceptions enabled.
  
!      '-fsanitize=nonnull-attribute'
! 
!           This option enables instrumentation of calls, checking whether
!           null values are not passed to arguments marked as requiring a
!           non-null value by the 'nonnull' function attribute.
! 
!      '-fsanitize=returns-nonnull-attribute'
  
            This option enables instrumentation of return statements in
!           functions marked with 'returns_nonnull' function attribute, to
!           detect returning of null values from such functions.
! 
!      '-fsanitize=bool'
  
            This option enables instrumentation of loads from bool.  If a
            value other than 0/1 is loaded, a run-time error is issued.
  
!      '-fsanitize=enum'
! 
            This option enables instrumentation of loads from an enum
            type.  If a value outside the range of values for the enum
            type is loaded, a run-time error is issued.
  
!      '-fsanitize=vptr'
! 
            This option enables instrumentation of C++ member function
            calls, member accesses and some conversions between pointers
            to base and derived classes, to verify the referenced object
            has the correct dynamic type.
  
!      While '-ftrapv' causes traps for signed overflows to be emitted,
!      '-fsanitize=undefined' gives a diagnostic message.  This currently
       works only for the C family of languages.
  
! '-fno-sanitize=all'
! 
       This option disables all previously enabled sanitizers.
!      '-fsanitize=all' is not allowed, as some sanitizers cannot be used
       together.
  
! '-fasan-shadow-offset=NUMBER'
       This option forces GCC to use custom shadow offset in
       AddressSanitizer checks.  It is useful for experimenting with
       different shadow memory layouts in Kernel AddressSanitizer.
  
! '-fsanitize-recover[=OPTS]'
!      '-fsanitize-recover=' controls error recovery mode for sanitizers
       mentioned in comma-separated list of OPTS.  Enabling this option
       for a sanitizer component causes it to attempt to continue running
       the program as if no error happened.  This means multiple runtime
       errors can be reported in a single program run, and the exit code
       of the program may indicate success even when errors have been
!      reported.  The '-fno-sanitize-recover=' option can be used to alter
       this behavior: only the first detected error is reported and
       program then exits with a non-zero exit code.
  
!      Currently this feature only works for '-fsanitize=undefined' (and
!      its suboptions except for '-fsanitize=unreachable' and
!      '-fsanitize=return'), '-fsanitize=float-cast-overflow',
!      '-fsanitize=float-divide-by-zero' and '-fsanitize=kernel-address'.
       For these sanitizers error recovery is turned on by default.
!      '-fsanitize-recover=all' and '-fno-sanitize-recover=all' is also
       accepted, the former enables recovery for all sanitizers that
       support it, the latter disables recovery for all sanitizers that
       support it.
*************** program or GCC:
*** 5407,5434 ****
       Syntax without explicit OPTS parameter is deprecated.  It is
       equivalent to
            -fsanitize-recover=undefined,float-cast-overflow,float-divide-by-zero
!      Similarly `-fno-sanitize-recover' is equivalent to
            -fno-sanitize-recover=undefined,float-cast-overflow,float-divide-by-zero
  
! `-fsanitize-undefined-trap-on-error'
!      The `-fsanitize-undefined-trap-on-error' option instructs the
!      compiler to report undefined behavior using `__builtin_trap'
!      rather than a `libubsan' library routine.  The advantage of this
!      is that the `libubsan' library is not needed and is not linked in,
!      so this is usable even in freestanding environments.
  
! `-fcheck-pointer-bounds'
       Enable Pointer Bounds Checker instrumentation.  Each memory
       reference is instrumented with checks of the pointer used for
       memory access against bounds associated with that pointer.
  
       Currently there is only an implementation for Intel MPX available,
!      thus x86 target and `-mmpx' are required to enable this feature.
       MPX-based instrumentation requires a runtime library to enable MPX
       in hardware and handle bounds violation signals.  By default when
!      `-fcheck-pointer-bounds' and `-mmpx' options are used to link a
!      program, the GCC driver links against the `libmpx' runtime library
!      and `libmpxwrappers' library.  It also passes '-z bndplt' to a
       linker in case it supports this option (which is checked on libmpx
       configuration).  Note that old versions of linker may ignore
       option.  Gold linker doesn't support '-z bndplt' option.  With no
--- 5384,5411 ----
       Syntax without explicit OPTS parameter is deprecated.  It is
       equivalent to
            -fsanitize-recover=undefined,float-cast-overflow,float-divide-by-zero
!      Similarly '-fno-sanitize-recover' is equivalent to
            -fno-sanitize-recover=undefined,float-cast-overflow,float-divide-by-zero
  
! '-fsanitize-undefined-trap-on-error'
!      The '-fsanitize-undefined-trap-on-error' option instructs the
!      compiler to report undefined behavior using '__builtin_trap' rather
!      than a 'libubsan' library routine.  The advantage of this is that
!      the 'libubsan' library is not needed and is not linked in, so this
!      is usable even in freestanding environments.
  
! '-fcheck-pointer-bounds'
       Enable Pointer Bounds Checker instrumentation.  Each memory
       reference is instrumented with checks of the pointer used for
       memory access against bounds associated with that pointer.
  
       Currently there is only an implementation for Intel MPX available,
!      thus x86 target and '-mmpx' are required to enable this feature.
       MPX-based instrumentation requires a runtime library to enable MPX
       in hardware and handle bounds violation signals.  By default when
!      '-fcheck-pointer-bounds' and '-mmpx' options are used to link a
!      program, the GCC driver links against the 'libmpx' runtime library
!      and 'libmpxwrappers' library.  It also passes '-z bndplt' to a
       linker in case it supports this option (which is checked on libmpx
       configuration).  Note that old versions of linker may ignore
       option.  Gold linker doesn't support '-z bndplt' option.  With no
*************** program or GCC:
*** 5436,5604 ****
       passed bounds reducing overall protection level.  It's highly
       recommended to use linker with '-z bndplt' support.  In case such
       linker is not available it is adviced to always use
!      `-static-libmpxwrappers' for better protection level or use
!      `-static' to completely avoid external calls to dynamic libraries.
!      MPX-based instrumentation may be used for debugging and also may
!      be included in production code to increase program security.
       Depending on usage, you may have different requirements for the
!      runtime library.  The current version of the MPX runtime library
!      is more oriented for use as a debugging tool.  MPX runtime library
!      usage implies `-lpthread'.  See also `-static-libmpx'.  The
!      runtime library  behavior can be influenced using various
!      `CHKP_RT_*' environment variables.  See
!      `https://gcc.gnu.org/wiki/Intel%20MPX%20support%20in%20the%20GCC%20compiler'
       for more details.
  
!      Generated instrumentation may be controlled by various `-fchkp-*'
!      options and by the `bnd_variable_size' structure field attribute
!      (*note Type Attributes::) and `bnd_legacy', and `bnd_instrument'
       function attributes (*note Function Attributes::).  GCC also
!      provides a number of built-in functions for controlling the
!      Pointer Bounds Checker.  *Note Pointer Bounds Checker builtins::,
!      for more information.
  
! `-fchkp-check-incomplete-type'
       Generate pointer bounds checks for variables with incomplete type.
       Enabled by default.
  
! `-fchkp-narrow-bounds'
       Controls bounds used by Pointer Bounds Checker for pointers to
!      object fields.  If narrowing is enabled then field bounds are
!      used.  Otherwise object bounds are used.  See also
!      `-fchkp-narrow-to-innermost-array' and
!      `-fchkp-first-field-has-own-bounds'.  Enabled by default.
  
! `-fchkp-first-field-has-own-bounds'
       Forces Pointer Bounds Checker to use narrowed bounds for the
       address of the first field in the structure.  By default a pointer
       to the first field has the same bounds as a pointer to the whole
       structure.
  
! `-fchkp-narrow-to-innermost-array'
!      Forces Pointer Bounds Checker to use bounds of the innermost
!      arrays in case of nested static array access.  By default this
!      option is disabled and bounds of the outermost array are used.
  
! `-fchkp-optimize'
       Enables Pointer Bounds Checker optimizations.  Enabled by default
!      at optimization levels `-O', `-O2', `-O3'.
  
! `-fchkp-use-fast-string-functions'
!      Enables use of `*_nobnd' versions of string functions (not copying
       bounds) by Pointer Bounds Checker.  Disabled by default.
  
! `-fchkp-use-nochk-string-functions'
!      Enables use of `*_nochk' versions of string functions (not
!      checking bounds) by Pointer Bounds Checker.  Disabled by default.
  
! `-fchkp-use-static-bounds'
       Allow Pointer Bounds Checker to generate static bounds holding
       bounds of static variables.  Enabled by default.
  
! `-fchkp-use-static-const-bounds'
       Use statically-initialized bounds for constant bounds instead of
       generating them each time they are required.  By default enabled
!      when `-fchkp-use-static-bounds' is enabled.
  
! `-fchkp-treat-zero-dynamic-size-as-infinite'
       With this option, objects with incomplete type whose
       dynamically-obtained size is zero are treated as having infinite
!      size instead by Pointer Bounds Checker.  This option may be
!      helpful if a program is linked with a library missing size
!      information for some symbols.  Disabled by default.
  
! `-fchkp-check-read'
       Instructs Pointer Bounds Checker to generate checks for all read
       accesses to memory.  Enabled by default.
  
! `-fchkp-check-write'
       Instructs Pointer Bounds Checker to generate checks for all write
       accesses to memory.  Enabled by default.
  
! `-fchkp-store-bounds'
       Instructs Pointer Bounds Checker to generate bounds stores for
       pointer writes.  Enabled by default.
  
! `-fchkp-instrument-calls'
       Instructs Pointer Bounds Checker to pass pointer bounds to calls.
       Enabled by default.
  
! `-fchkp-instrument-marked-only'
       Instructs Pointer Bounds Checker to instrument only functions
!      marked with the `bnd_instrument' attribute (*note Function
       Attributes::).  Disabled by default.
  
! `-fchkp-use-wrappers'
       Allows Pointer Bounds Checker to replace calls to built-in
       functions with calls to wrapper functions.  When
!      `-fchkp-use-wrappers' is used to link a program, the GCC driver
!      automatically links against `libmpxwrappers'.  See also
!      `-static-libmpxwrappers'.  Enabled by default.
  
! `-fdump-final-insns[=FILE]'
       Dump the final internal representation (RTL) to FILE.  If the
!      optional argument is omitted (or if FILE is `.'), the name of the
!      dump file is determined by appending `.gkd' to the compilation
       output file name.
  
! `-fcompare-debug[=OPTS]'
       If no error occurs during compilation, run the compiler a second
!      time, adding OPTS and `-fcompare-debug-second' to the arguments
       passed to the second compilation.  Dump the final internal
       representation in both compilations, and print an error if they
       differ.
  
!      If the equal sign is omitted, the default `-gtoggle' is used.
  
!      The environment variable `GCC_COMPARE_DEBUG', if defined, non-empty
!      and nonzero, implicitly enables `-fcompare-debug'.  If
!      `GCC_COMPARE_DEBUG' is defined to a string starting with a dash,
!      then it is used for OPTS, otherwise the default `-gtoggle' is used.
  
!      `-fcompare-debug=', with the equal sign but without OPTS, is
!      equivalent to `-fno-compare-debug', which disables the dumping of
       the final representation and the second compilation, preventing
!      even `GCC_COMPARE_DEBUG' from taking effect.
  
!      To verify full coverage during `-fcompare-debug' testing, set
!      `GCC_COMPARE_DEBUG' to say `-fcompare-debug-not-overridden', which
       GCC rejects as an invalid option in any actual compilation (rather
       than preprocessing, assembly or linking).  To get just a warning,
!      setting `GCC_COMPARE_DEBUG' to `-w%n-fcompare-debug not
!      overridden' will do.
  
! `-fcompare-debug-second'
       This option is implicitly passed to the compiler for the second
!      compilation requested by `-fcompare-debug', along with options to
       silence warnings, and omitting other options that would cause
       side-effect compiler outputs to files or to the standard output.
       Dump files and preserved temporary files are renamed so as to
!      contain the `.gk' additional extension during the second
       compilation, to avoid overwriting those generated by the first.
  
       When this option is passed to the compiler driver, it causes the
       _first_ compilation to be skipped, which makes it useful for little
       other than debugging the compiler proper.
  
! `-feliminate-dwarf2-dups'
       Compress DWARF 2 debugging information by eliminating duplicated
       information about each symbol.  This option only makes sense when
!      generating DWARF 2 debugging information with `-gdwarf-2'.
  
! `-femit-struct-debug-baseonly'
       Emit debug information for struct-like types only when the base
       name of the compilation source file matches the base name of file
       in which the struct is defined.
  
       This option substantially reduces the size of debugging
       information, but at significant potential loss in type information
!      to the debugger.  See `-femit-struct-debug-reduced' for a less
!      aggressive option.  See `-femit-struct-debug-detailed' for more
       detailed control.
  
       This option works only with DWARF 2.
  
! `-femit-struct-debug-reduced'
       Emit debug information for struct-like types only when the base
       name of the compilation source file matches the base name of file
       in which the type is defined, unless the struct is a template or
--- 5413,5581 ----
       passed bounds reducing overall protection level.  It's highly
       recommended to use linker with '-z bndplt' support.  In case such
       linker is not available it is adviced to always use
!      '-static-libmpxwrappers' for better protection level or use
!      '-static' to completely avoid external calls to dynamic libraries.
!      MPX-based instrumentation may be used for debugging and also may be
!      included in production code to increase program security.
       Depending on usage, you may have different requirements for the
!      runtime library.  The current version of the MPX runtime library is
!      more oriented for use as a debugging tool.  MPX runtime library
!      usage implies '-lpthread'.  See also '-static-libmpx'.  The runtime
!      library behavior can be influenced using various 'CHKP_RT_*'
!      environment variables.  See
!      <https://gcc.gnu.org/wiki/Intel%20MPX%20support%20in%20the%20GCC%20compiler>
       for more details.
  
!      Generated instrumentation may be controlled by various '-fchkp-*'
!      options and by the 'bnd_variable_size' structure field attribute
!      (*note Type Attributes::) and 'bnd_legacy', and 'bnd_instrument'
       function attributes (*note Function Attributes::).  GCC also
!      provides a number of built-in functions for controlling the Pointer
!      Bounds Checker.  *Note Pointer Bounds Checker builtins::, for more
!      information.
  
! '-fchkp-check-incomplete-type'
       Generate pointer bounds checks for variables with incomplete type.
       Enabled by default.
  
! '-fchkp-narrow-bounds'
       Controls bounds used by Pointer Bounds Checker for pointers to
!      object fields.  If narrowing is enabled then field bounds are used.
!      Otherwise object bounds are used.  See also
!      '-fchkp-narrow-to-innermost-array' and
!      '-fchkp-first-field-has-own-bounds'.  Enabled by default.
  
! '-fchkp-first-field-has-own-bounds'
       Forces Pointer Bounds Checker to use narrowed bounds for the
       address of the first field in the structure.  By default a pointer
       to the first field has the same bounds as a pointer to the whole
       structure.
  
! '-fchkp-narrow-to-innermost-array'
!      Forces Pointer Bounds Checker to use bounds of the innermost arrays
!      in case of nested static array access.  By default this option is
!      disabled and bounds of the outermost array are used.
  
! '-fchkp-optimize'
       Enables Pointer Bounds Checker optimizations.  Enabled by default
!      at optimization levels '-O', '-O2', '-O3'.
  
! '-fchkp-use-fast-string-functions'
!      Enables use of '*_nobnd' versions of string functions (not copying
       bounds) by Pointer Bounds Checker.  Disabled by default.
  
! '-fchkp-use-nochk-string-functions'
!      Enables use of '*_nochk' versions of string functions (not checking
!      bounds) by Pointer Bounds Checker.  Disabled by default.
  
! '-fchkp-use-static-bounds'
       Allow Pointer Bounds Checker to generate static bounds holding
       bounds of static variables.  Enabled by default.
  
! '-fchkp-use-static-const-bounds'
       Use statically-initialized bounds for constant bounds instead of
       generating them each time they are required.  By default enabled
!      when '-fchkp-use-static-bounds' is enabled.
  
! '-fchkp-treat-zero-dynamic-size-as-infinite'
       With this option, objects with incomplete type whose
       dynamically-obtained size is zero are treated as having infinite
!      size instead by Pointer Bounds Checker.  This option may be helpful
!      if a program is linked with a library missing size information for
!      some symbols.  Disabled by default.
  
! '-fchkp-check-read'
       Instructs Pointer Bounds Checker to generate checks for all read
       accesses to memory.  Enabled by default.
  
! '-fchkp-check-write'
       Instructs Pointer Bounds Checker to generate checks for all write
       accesses to memory.  Enabled by default.
  
! '-fchkp-store-bounds'
       Instructs Pointer Bounds Checker to generate bounds stores for
       pointer writes.  Enabled by default.
  
! '-fchkp-instrument-calls'
       Instructs Pointer Bounds Checker to pass pointer bounds to calls.
       Enabled by default.
  
! '-fchkp-instrument-marked-only'
       Instructs Pointer Bounds Checker to instrument only functions
!      marked with the 'bnd_instrument' attribute (*note Function
       Attributes::).  Disabled by default.
  
! '-fchkp-use-wrappers'
       Allows Pointer Bounds Checker to replace calls to built-in
       functions with calls to wrapper functions.  When
!      '-fchkp-use-wrappers' is used to link a program, the GCC driver
!      automatically links against 'libmpxwrappers'.  See also
!      '-static-libmpxwrappers'.  Enabled by default.
  
! '-fdump-final-insns[=FILE]'
       Dump the final internal representation (RTL) to FILE.  If the
!      optional argument is omitted (or if FILE is '.'), the name of the
!      dump file is determined by appending '.gkd' to the compilation
       output file name.
  
! '-fcompare-debug[=OPTS]'
       If no error occurs during compilation, run the compiler a second
!      time, adding OPTS and '-fcompare-debug-second' to the arguments
       passed to the second compilation.  Dump the final internal
       representation in both compilations, and print an error if they
       differ.
  
!      If the equal sign is omitted, the default '-gtoggle' is used.
  
!      The environment variable 'GCC_COMPARE_DEBUG', if defined, non-empty
!      and nonzero, implicitly enables '-fcompare-debug'.  If
!      'GCC_COMPARE_DEBUG' is defined to a string starting with a dash,
!      then it is used for OPTS, otherwise the default '-gtoggle' is used.
  
!      '-fcompare-debug=', with the equal sign but without OPTS, is
!      equivalent to '-fno-compare-debug', which disables the dumping of
       the final representation and the second compilation, preventing
!      even 'GCC_COMPARE_DEBUG' from taking effect.
  
!      To verify full coverage during '-fcompare-debug' testing, set
!      'GCC_COMPARE_DEBUG' to say '-fcompare-debug-not-overridden', which
       GCC rejects as an invalid option in any actual compilation (rather
       than preprocessing, assembly or linking).  To get just a warning,
!      setting 'GCC_COMPARE_DEBUG' to '-w%n-fcompare-debug not overridden'
!      will do.
  
! '-fcompare-debug-second'
       This option is implicitly passed to the compiler for the second
!      compilation requested by '-fcompare-debug', along with options to
       silence warnings, and omitting other options that would cause
       side-effect compiler outputs to files or to the standard output.
       Dump files and preserved temporary files are renamed so as to
!      contain the '.gk' additional extension during the second
       compilation, to avoid overwriting those generated by the first.
  
       When this option is passed to the compiler driver, it causes the
       _first_ compilation to be skipped, which makes it useful for little
       other than debugging the compiler proper.
  
! '-feliminate-dwarf2-dups'
       Compress DWARF 2 debugging information by eliminating duplicated
       information about each symbol.  This option only makes sense when
!      generating DWARF 2 debugging information with '-gdwarf-2'.
  
! '-femit-struct-debug-baseonly'
       Emit debug information for struct-like types only when the base
       name of the compilation source file matches the base name of file
       in which the struct is defined.
  
       This option substantially reduces the size of debugging
       information, but at significant potential loss in type information
!      to the debugger.  See '-femit-struct-debug-reduced' for a less
!      aggressive option.  See '-femit-struct-debug-detailed' for more
       detailed control.
  
       This option works only with DWARF 2.
  
! '-femit-struct-debug-reduced'
       Emit debug information for struct-like types only when the base
       name of the compilation source file matches the base name of file
       in which the type is defined, unless the struct is a template or
*************** program or GCC:
*** 5606,5870 ****
  
       This option significantly reduces the size of debugging
       information, with some potential loss in type information to the
!      debugger.  See `-femit-struct-debug-baseonly' for a more
!      aggressive option.  See `-femit-struct-debug-detailed' for more
!      detailed control.
  
       This option works only with DWARF 2.
  
! `-femit-struct-debug-detailed[=SPEC-LIST]'
       Specify the struct-like types for which the compiler generates
       debug information.  The intent is to reduce duplicate struct debug
       information between different object files within the same program.
  
!      This option is a detailed version of `-femit-struct-debug-reduced'
!      and `-femit-struct-debug-baseonly', which serves for most needs.
  
       A specification has the syntax
!      [`dir:'|`ind:'][`ord:'|`gen:'](`any'|`sys'|`base'|`none')
  
       The optional first word limits the specification to structs that
!      are used directly (`dir:') or used indirectly (`ind:').  A struct
       type is used directly when it is the type of a variable, member.
!      Indirect uses arise through pointers to structs.  That is, when
!      use of an incomplete struct is valid, the use is indirect.  An
!      example is `struct one direct; struct two * indirect;'.
  
       The optional second word limits the specification to ordinary
!      structs (`ord:') or generic structs (`gen:').  Generic structs are
       a bit complicated to explain.  For C++, these are non-explicit
!      specializations of template classes, or non-template classes
!      within the above.  Other programming languages have generics, but
!      `-femit-struct-debug-detailed' does not yet implement them.
  
       The third word specifies the source files for those structs for
       which the compiler should emit debug information.  The values
!      `none' and `any' have the normal meaning.  The value `base' means
       that the base of name of the file in which the type declaration
       appears must match the base of the name of the main compilation
!      file.  In practice, this means that when compiling `foo.c', debug
       information is generated for types declared in that file and
!      `foo.h', but not other header files.  The value `sys' means those
!      types satisfying `base' or declared in system or compiler headers.
  
       You may need to experiment to determine the best settings for your
       application.
  
!      The default is `-femit-struct-debug-detailed=all'.
  
       This option works only with DWARF 2.
  
! `-fno-merge-debug-strings'
       Direct the linker to not merge together strings in the debugging
       information that are identical in different object files.  Merging
       is not supported by all assemblers or linkers.  Merging decreases
!      the size of the debug information in the output file at the cost
!      of increasing link processing time.  Merging is enabled by default.
  
! `-fdebug-prefix-map=OLD=NEW'
!      When compiling files in directory `OLD', record debugging
!      information describing them as in `NEW' instead.
  
! `-fno-dwarf2-cfi-asm'
!      Emit DWARF 2 unwind info as compiler generated `.eh_frame' section
!      instead of using GAS `.cfi_*' directives.
  
! `-p'
       Generate extra code to write profile information suitable for the
!      analysis program `prof'.  You must use this option when compiling
       the source files you want data about, and you must also use it when
       linking.
  
! `-pg'
       Generate extra code to write profile information suitable for the
!      analysis program `gprof'.  You must use this option when compiling
       the source files you want data about, and you must also use it when
       linking.
  
! `-Q'
       Makes the compiler print out each function name as it is compiled,
       and print some statistics about each pass when it finishes.
  
! `-ftime-report'
!      Makes the compiler print some statistics about the time consumed
!      by each pass when it finishes.
  
! `-fmem-report'
       Makes the compiler print some statistics about permanent memory
       allocation when it finishes.
  
! `-fmem-report-wpa'
       Makes the compiler print some statistics about permanent memory
       allocation for the WPA phase only.
  
! `-fpre-ipa-mem-report'
! 
! `-fpost-ipa-mem-report'
       Makes the compiler print some statistics about permanent memory
       allocation before or after interprocedural optimization.
  
! `-fprofile-report'
       Makes the compiler print some statistics about consistency of the
       (estimated) profile and effect of individual passes.
  
! `-fstack-usage'
       Makes the compiler output stack usage information for the program,
       on a per-function basis.  The filename for the dump is made by
!      appending `.su' to the AUXNAME.  AUXNAME is generated from the
!      name of the output file, if explicitly specified and it is not an
       executable, otherwise it is the basename of the source file.  An
       entry is made up of three fields:
  
          * The name of the function.
- 
          * A number of bytes.
  
!         * One or more qualifiers: `static', `dynamic', `bounded'.
! 
!      The qualifier `static' means that the function manipulates the
       stack statically: a fixed number of bytes are allocated for the
       frame on function entry and released on function exit; no stack
       adjustments are otherwise made in the function.  The second field
       is this fixed number of bytes.
  
!      The qualifier `dynamic' means that the function manipulates the
       stack dynamically: in addition to the static allocation described
       above, stack adjustments are made in the body of the function, for
       example to push/pop arguments around function calls.  If the
!      qualifier `bounded' is also present, the amount of these
       adjustments is bounded at compile time and the second field is an
       upper bound of the total amount of stack used by the function.  If
       it is not present, the amount of these adjustments is not bounded
       at compile time and the second field only represents the bounded
       part.
  
! `-fprofile-arcs'
       Add code so that program flow "arcs" are instrumented.  During
       execution the program records how many times each branch and call
       is executed and how many times it is taken or returns.  When the
       compiled program exits it saves this data to a file called
!      `AUXNAME.gcda' for each source file.  The data may be used for
!      profile-directed optimizations (`-fbranch-probabilities'), or for
!      test coverage analysis (`-ftest-coverage').  Each object file's
       AUXNAME is generated from the name of the output file, if
       explicitly specified and it is not the final executable, otherwise
!      it is the basename of the source file.  In both cases any suffix
!      is removed (e.g. `foo.gcda' for input file `dir/foo.c', or
!      `dir/foo.gcda' for output file specified as `-o dir/foo.o').
!      *Note Cross-profiling::.
  
- `--coverage'
       This option is used to compile and link code instrumented for
!      coverage analysis.  The option is a synonym for `-fprofile-arcs'
!      `-ftest-coverage' (when compiling) and `-lgcov' (when linking).
       See the documentation for those options for more details.
  
!         * Compile the source files with `-fprofile-arcs' plus
            optimization and code generation options.  For test coverage
!           analysis, use the additional `-ftest-coverage' option.  You
!           do not need to profile every source file in a program.
  
!         * Link your object files with `-lgcov' or `-fprofile-arcs' (the
            latter implies the former).
  
          * Run the program on a representative workload to generate the
            arc profile information.  This may be repeated any number of
            times.  You can run concurrent instances of your program, and
!           provided that the file system supports locking, the data
!           files will be correctly updated.  Also `fork' calls are
!           detected and correctly handled (double counting will not
!           happen).
  
          * For profile-directed optimizations, compile the source files
            again with the same optimization and code generation options
!           plus `-fbranch-probabilities' (*note Options that Control
            Optimization: Optimize Options.).
  
!         * For test coverage analysis, use `gcov' to produce human
!           readable information from the `.gcno' and `.gcda' files.
!           Refer to the `gcov' documentation for further information.
! 
  
!      With `-fprofile-arcs', for each function of your program GCC
       creates a program flow graph, then finds a spanning tree for the
       graph.  Only arcs that are not on the spanning tree have to be
       instrumented: the compiler adds code to count the number of times
!      that these arcs are executed.  When an arc is the only exit or
!      only entrance to a block, the instrumentation code can be added to
!      the block; otherwise, a new basic block must be created to hold
!      the instrumentation code.
  
! `-ftest-coverage'
!      Produce a notes file that the `gcov' code-coverage utility (*note
!      `gcov'--a Test Coverage Program: Gcov.) can use to show program
!      coverage.  Each source file's note file is called `AUXNAME.gcno'.
!      Refer to the `-fprofile-arcs' option above for a description of
       AUXNAME and instructions on how to generate test coverage data.
       Coverage data matches the source files more closely if you do not
       optimize.
  
! `-fdbg-cnt-list'
       Print the name and the counter upper bound for all debug counters.
  
! `-fdbg-cnt=COUNTER-VALUE-LIST'
       Set the internal debug counter upper bound.  COUNTER-VALUE-LIST is
       a comma-separated list of NAME:VALUE pairs which sets the upper
!      bound of each debug counter NAME to VALUE.  All debug counters
!      have the initial upper bound of `UINT_MAX'; thus `dbg_cnt' returns
!      true always unless the upper bound is set by this option.  For
!      example, with `-fdbg-cnt=dce:10,tail_call:0', `dbg_cnt(dce)'
!      returns true only for first 10 invocations.
  
- `-fenable-KIND-PASS'
- `-fdisable-KIND-PASS=RANGE-LIST'
       This is a set of options that are used to explicitly disable/enable
       optimization passes.  These options are intended for use for
!      debugging GCC.  Compiler users should use regular options for
       enabling/disabling passes instead.
  
!     `-fdisable-ipa-PASS'
!           Disable IPA pass PASS. PASS is the pass name.  If the same
!           pass is statically invoked in the compiler multiple times,
!           the pass name should be appended with a sequential number
!           starting from 1.
  
!     `-fdisable-rtl-PASS'
!     `-fdisable-rtl-PASS=RANGE-LIST'
            Disable RTL pass PASS.  PASS is the pass name.  If the same
!           pass is statically invoked in the compiler multiple times,
!           the pass name should be appended with a sequential number
!           starting from 1.  RANGE-LIST is a comma-separated list of
!           function ranges or assembler names.  Each range is a number
!           pair separated by a colon.  The range is inclusive in both
!           ends.  If the range is trivial, the number pair can be
!           simplified as a single number.  If the function's call graph
!           node's UID falls within one of the specified ranges, the PASS
!           is disabled for that function.  The UID is shown in the
!           function header of a dump file, and the pass names can be
!           dumped by using option `-fdump-passes'.
  
!     `-fdisable-tree-PASS'
!     `-fdisable-tree-PASS=RANGE-LIST'
!           Disable tree pass PASS.  See `-fdisable-rtl' for the
            description of option arguments.
  
!     `-fenable-ipa-PASS'
            Enable IPA pass PASS.  PASS is the pass name.  If the same
!           pass is statically invoked in the compiler multiple times,
!           the pass name should be appended with a sequential number
!           starting from 1.
  
!     `-fenable-rtl-PASS'
!     `-fenable-rtl-PASS=RANGE-LIST'
!           Enable RTL pass PASS.  See `-fdisable-rtl' for option argument
            description and examples.
  
!     `-fenable-tree-PASS'
!     `-fenable-tree-PASS=RANGE-LIST'
!           Enable tree pass PASS.  See `-fdisable-rtl' for the
            description of option arguments.
  
- 
       Here are some examples showing uses of these options.
  
  
--- 5583,5843 ----
  
       This option significantly reduces the size of debugging
       information, with some potential loss in type information to the
!      debugger.  See '-femit-struct-debug-baseonly' for a more aggressive
!      option.  See '-femit-struct-debug-detailed' for more detailed
!      control.
  
       This option works only with DWARF 2.
  
! '-femit-struct-debug-detailed[=SPEC-LIST]'
       Specify the struct-like types for which the compiler generates
       debug information.  The intent is to reduce duplicate struct debug
       information between different object files within the same program.
  
!      This option is a detailed version of '-femit-struct-debug-reduced'
!      and '-femit-struct-debug-baseonly', which serves for most needs.
  
       A specification has the syntax
!      ['dir:'|'ind:']['ord:'|'gen:']('any'|'sys'|'base'|'none')
  
       The optional first word limits the specification to structs that
!      are used directly ('dir:') or used indirectly ('ind:').  A struct
       type is used directly when it is the type of a variable, member.
!      Indirect uses arise through pointers to structs.  That is, when use
!      of an incomplete struct is valid, the use is indirect.  An example
!      is 'struct one direct; struct two * indirect;'.
  
       The optional second word limits the specification to ordinary
!      structs ('ord:') or generic structs ('gen:').  Generic structs are
       a bit complicated to explain.  For C++, these are non-explicit
!      specializations of template classes, or non-template classes within
!      the above.  Other programming languages have generics, but
!      '-femit-struct-debug-detailed' does not yet implement them.
  
       The third word specifies the source files for those structs for
       which the compiler should emit debug information.  The values
!      'none' and 'any' have the normal meaning.  The value 'base' means
       that the base of name of the file in which the type declaration
       appears must match the base of the name of the main compilation
!      file.  In practice, this means that when compiling 'foo.c', debug
       information is generated for types declared in that file and
!      'foo.h', but not other header files.  The value 'sys' means those
!      types satisfying 'base' or declared in system or compiler headers.
  
       You may need to experiment to determine the best settings for your
       application.
  
!      The default is '-femit-struct-debug-detailed=all'.
  
       This option works only with DWARF 2.
  
! '-fno-merge-debug-strings'
       Direct the linker to not merge together strings in the debugging
       information that are identical in different object files.  Merging
       is not supported by all assemblers or linkers.  Merging decreases
!      the size of the debug information in the output file at the cost of
!      increasing link processing time.  Merging is enabled by default.
  
! '-fdebug-prefix-map=OLD=NEW'
!      When compiling files in directory 'OLD', record debugging
!      information describing them as in 'NEW' instead.
  
! '-fno-dwarf2-cfi-asm'
!      Emit DWARF 2 unwind info as compiler generated '.eh_frame' section
!      instead of using GAS '.cfi_*' directives.
  
! '-p'
       Generate extra code to write profile information suitable for the
!      analysis program 'prof'.  You must use this option when compiling
       the source files you want data about, and you must also use it when
       linking.
  
! '-pg'
       Generate extra code to write profile information suitable for the
!      analysis program 'gprof'.  You must use this option when compiling
       the source files you want data about, and you must also use it when
       linking.
  
! '-Q'
       Makes the compiler print out each function name as it is compiled,
       and print some statistics about each pass when it finishes.
  
! '-ftime-report'
!      Makes the compiler print some statistics about the time consumed by
!      each pass when it finishes.
  
! '-fmem-report'
       Makes the compiler print some statistics about permanent memory
       allocation when it finishes.
  
! '-fmem-report-wpa'
       Makes the compiler print some statistics about permanent memory
       allocation for the WPA phase only.
  
! '-fpre-ipa-mem-report'
! '-fpost-ipa-mem-report'
       Makes the compiler print some statistics about permanent memory
       allocation before or after interprocedural optimization.
  
! '-fprofile-report'
       Makes the compiler print some statistics about consistency of the
       (estimated) profile and effect of individual passes.
  
! '-fstack-usage'
       Makes the compiler output stack usage information for the program,
       on a per-function basis.  The filename for the dump is made by
!      appending '.su' to the AUXNAME.  AUXNAME is generated from the name
!      of the output file, if explicitly specified and it is not an
       executable, otherwise it is the basename of the source file.  An
       entry is made up of three fields:
  
          * The name of the function.
          * A number of bytes.
+         * One or more qualifiers: 'static', 'dynamic', 'bounded'.
  
!      The qualifier 'static' means that the function manipulates the
       stack statically: a fixed number of bytes are allocated for the
       frame on function entry and released on function exit; no stack
       adjustments are otherwise made in the function.  The second field
       is this fixed number of bytes.
  
!      The qualifier 'dynamic' means that the function manipulates the
       stack dynamically: in addition to the static allocation described
       above, stack adjustments are made in the body of the function, for
       example to push/pop arguments around function calls.  If the
!      qualifier 'bounded' is also present, the amount of these
       adjustments is bounded at compile time and the second field is an
       upper bound of the total amount of stack used by the function.  If
       it is not present, the amount of these adjustments is not bounded
       at compile time and the second field only represents the bounded
       part.
  
! '-fprofile-arcs'
       Add code so that program flow "arcs" are instrumented.  During
       execution the program records how many times each branch and call
       is executed and how many times it is taken or returns.  When the
       compiled program exits it saves this data to a file called
!      'AUXNAME.gcda' for each source file.  The data may be used for
!      profile-directed optimizations ('-fbranch-probabilities'), or for
!      test coverage analysis ('-ftest-coverage').  Each object file's
       AUXNAME is generated from the name of the output file, if
       explicitly specified and it is not the final executable, otherwise
!      it is the basename of the source file.  In both cases any suffix is
!      removed (e.g. 'foo.gcda' for input file 'dir/foo.c', or
!      'dir/foo.gcda' for output file specified as '-o dir/foo.o').  *Note
!      Cross-profiling::.
! 
! '--coverage'
  
       This option is used to compile and link code instrumented for
!      coverage analysis.  The option is a synonym for '-fprofile-arcs'
!      '-ftest-coverage' (when compiling) and '-lgcov' (when linking).
       See the documentation for those options for more details.
  
!         * Compile the source files with '-fprofile-arcs' plus
            optimization and code generation options.  For test coverage
!           analysis, use the additional '-ftest-coverage' option.  You do
!           not need to profile every source file in a program.
  
!         * Link your object files with '-lgcov' or '-fprofile-arcs' (the
            latter implies the former).
  
          * Run the program on a representative workload to generate the
            arc profile information.  This may be repeated any number of
            times.  You can run concurrent instances of your program, and
!           provided that the file system supports locking, the data files
!           will be correctly updated.  Also 'fork' calls are detected and
!           correctly handled (double counting will not happen).
  
          * For profile-directed optimizations, compile the source files
            again with the same optimization and code generation options
!           plus '-fbranch-probabilities' (*note Options that Control
            Optimization: Optimize Options.).
  
!         * For test coverage analysis, use 'gcov' to produce human
!           readable information from the '.gcno' and '.gcda' files.
!           Refer to the 'gcov' documentation for further information.
  
!      With '-fprofile-arcs', for each function of your program GCC
       creates a program flow graph, then finds a spanning tree for the
       graph.  Only arcs that are not on the spanning tree have to be
       instrumented: the compiler adds code to count the number of times
!      that these arcs are executed.  When an arc is the only exit or only
!      entrance to a block, the instrumentation code can be added to the
!      block; otherwise, a new basic block must be created to hold the
!      instrumentation code.
  
! '-ftest-coverage'
!      Produce a notes file that the 'gcov' code-coverage utility (*note
!      'gcov'--a Test Coverage Program: Gcov.) can use to show program
!      coverage.  Each source file's note file is called 'AUXNAME.gcno'.
!      Refer to the '-fprofile-arcs' option above for a description of
       AUXNAME and instructions on how to generate test coverage data.
       Coverage data matches the source files more closely if you do not
       optimize.
  
! '-fdbg-cnt-list'
       Print the name and the counter upper bound for all debug counters.
  
! '-fdbg-cnt=COUNTER-VALUE-LIST'
       Set the internal debug counter upper bound.  COUNTER-VALUE-LIST is
       a comma-separated list of NAME:VALUE pairs which sets the upper
!      bound of each debug counter NAME to VALUE.  All debug counters have
!      the initial upper bound of 'UINT_MAX'; thus 'dbg_cnt' returns true
!      always unless the upper bound is set by this option.  For example,
!      with '-fdbg-cnt=dce:10,tail_call:0', 'dbg_cnt(dce)' returns true
!      only for first 10 invocations.
! 
! '-fenable-KIND-PASS'
! '-fdisable-KIND-PASS=RANGE-LIST'
  
       This is a set of options that are used to explicitly disable/enable
       optimization passes.  These options are intended for use for
!      debugging GCC. Compiler users should use regular options for
       enabling/disabling passes instead.
  
!      '-fdisable-ipa-PASS'
!           Disable IPA pass PASS.  PASS is the pass name.  If the same
!           pass is statically invoked in the compiler multiple times, the
!           pass name should be appended with a sequential number starting
!           from 1.
  
!      '-fdisable-rtl-PASS'
!      '-fdisable-rtl-PASS=RANGE-LIST'
            Disable RTL pass PASS.  PASS is the pass name.  If the same
!           pass is statically invoked in the compiler multiple times, the
!           pass name should be appended with a sequential number starting
!           from 1.  RANGE-LIST is a comma-separated list of function
!           ranges or assembler names.  Each range is a number pair
!           separated by a colon.  The range is inclusive in both ends.
!           If the range is trivial, the number pair can be simplified as
!           a single number.  If the function's call graph node's UID
!           falls within one of the specified ranges, the PASS is disabled
!           for that function.  The UID is shown in the function header of
!           a dump file, and the pass names can be dumped by using option
!           '-fdump-passes'.
  
!      '-fdisable-tree-PASS'
!      '-fdisable-tree-PASS=RANGE-LIST'
!           Disable tree pass PASS.  See '-fdisable-rtl' for the
            description of option arguments.
  
!      '-fenable-ipa-PASS'
            Enable IPA pass PASS.  PASS is the pass name.  If the same
!           pass is statically invoked in the compiler multiple times, the
!           pass name should be appended with a sequential number starting
!           from 1.
  
!      '-fenable-rtl-PASS'
!      '-fenable-rtl-PASS=RANGE-LIST'
!           Enable RTL pass PASS.  See '-fdisable-rtl' for option argument
            description and examples.
  
!      '-fenable-tree-PASS'
!      '-fenable-tree-PASS=RANGE-LIST'
!           Enable tree pass PASS.  See '-fdisable-rtl' for the
            description of option arguments.
  
       Here are some examples showing uses of these options.
  
  
*************** program or GCC:
*** 5883,6217 ****
            # enable tree full unroll
               -fenable-tree-unroll
  
! `-dLETTERS'
! `-fdump-rtl-PASS'
! `-fdump-rtl-PASS=FILENAME'
       Says to make debugging dumps during compilation at times specified
       by LETTERS.  This is used for debugging the RTL-based passes of the
       compiler.  The file names for most of the dumps are made by
       appending a pass number and a word to the DUMPNAME, and the files
!      are created in the directory of the output file. In case of
!      `=FILENAME' option, the dump is output on the given file instead
!      of the pass numbered dump files. Note that the pass number is
       computed statically as passes get registered into the pass manager.
!      Thus the numbering is not related to the dynamic order of
!      execution of passes.  In particular, a pass installed by a plugin
!      could have a number over 200 even if it executed quite early.
!      DUMPNAME is generated from the name of the output file, if
!      explicitly specified and it is not an executable, otherwise it is
!      the basename of the source file. These switches may have different
!      effects when `-E' is used for preprocessing.
  
!      Debug dumps can be enabled with a `-fdump-rtl' switch or some `-d'
       option LETTERS.  Here are the possible letters for use in PASS and
       LETTERS, and their meanings:
  
!     `-fdump-rtl-alignments'
            Dump after branch alignments have been computed.
  
!     `-fdump-rtl-asmcons'
            Dump after fixing rtl statements that have unsatisfied in/out
            constraints.
  
!     `-fdump-rtl-auto_inc_dec'
            Dump after auto-inc-dec discovery.  This pass is only run on
            architectures that have auto inc or auto dec instructions.
  
!     `-fdump-rtl-barriers'
            Dump after cleaning up the barrier instructions.
  
!     `-fdump-rtl-bbpart'
            Dump after partitioning hot and cold basic blocks.
  
!     `-fdump-rtl-bbro'
            Dump after block reordering.
  
!     `-fdump-rtl-btl1'
!     `-fdump-rtl-btl2'
!           `-fdump-rtl-btl1' and `-fdump-rtl-btl2' enable dumping after
            the two branch target load optimization passes.
  
!     `-fdump-rtl-bypass'
            Dump after jump bypassing and control flow optimizations.
  
!     `-fdump-rtl-combine'
            Dump after the RTL instruction combination pass.
  
!     `-fdump-rtl-compgotos'
            Dump after duplicating the computed gotos.
  
!     `-fdump-rtl-ce1'
!     `-fdump-rtl-ce2'
!     `-fdump-rtl-ce3'
!           `-fdump-rtl-ce1', `-fdump-rtl-ce2', and `-fdump-rtl-ce3'
            enable dumping after the three if conversion passes.
  
!     `-fdump-rtl-cprop_hardreg'
            Dump after hard register copy propagation.
  
!     `-fdump-rtl-csa'
            Dump after combining stack adjustments.
  
!     `-fdump-rtl-cse1'
!     `-fdump-rtl-cse2'
!           `-fdump-rtl-cse1' and `-fdump-rtl-cse2' enable dumping after
            the two common subexpression elimination passes.
  
!     `-fdump-rtl-dce'
            Dump after the standalone dead code elimination passes.
  
!     `-fdump-rtl-dbr'
            Dump after delayed branch scheduling.
  
!     `-fdump-rtl-dce1'
!     `-fdump-rtl-dce2'
!           `-fdump-rtl-dce1' and `-fdump-rtl-dce2' enable dumping after
            the two dead store elimination passes.
  
!     `-fdump-rtl-eh'
            Dump after finalization of EH handling code.
  
!     `-fdump-rtl-eh_ranges'
            Dump after conversion of EH handling range regions.
  
!     `-fdump-rtl-expand'
            Dump after RTL generation.
  
!     `-fdump-rtl-fwprop1'
!     `-fdump-rtl-fwprop2'
!           `-fdump-rtl-fwprop1' and `-fdump-rtl-fwprop2' enable dumping
            after the two forward propagation passes.
  
!     `-fdump-rtl-gcse1'
!     `-fdump-rtl-gcse2'
!           `-fdump-rtl-gcse1' and `-fdump-rtl-gcse2' enable dumping
!           after global common subexpression elimination.
  
!     `-fdump-rtl-init-regs'
            Dump after the initialization of the registers.
  
!     `-fdump-rtl-initvals'
            Dump after the computation of the initial value sets.
  
!     `-fdump-rtl-into_cfglayout'
            Dump after converting to cfglayout mode.
  
!     `-fdump-rtl-ira'
            Dump after iterated register allocation.
  
!     `-fdump-rtl-jump'
            Dump after the second jump optimization.
  
!     `-fdump-rtl-loop2'
!           `-fdump-rtl-loop2' enables dumping after the rtl loop
            optimization passes.
  
!     `-fdump-rtl-mach'
            Dump after performing the machine dependent reorganization
            pass, if that pass exists.
  
!     `-fdump-rtl-mode_sw'
            Dump after removing redundant mode switches.
  
!     `-fdump-rtl-rnreg'
            Dump after register renumbering.
  
!     `-fdump-rtl-outof_cfglayout'
            Dump after converting from cfglayout mode.
  
!     `-fdump-rtl-peephole2'
            Dump after the peephole pass.
  
!     `-fdump-rtl-postreload'
            Dump after post-reload optimizations.
  
!     `-fdump-rtl-pro_and_epilogue'
            Dump after generating the function prologues and epilogues.
  
!     `-fdump-rtl-sched1'
!     `-fdump-rtl-sched2'
!           `-fdump-rtl-sched1' and `-fdump-rtl-sched2' enable dumping
            after the basic block scheduling passes.
  
!     `-fdump-rtl-ree'
            Dump after sign/zero extension elimination.
  
!     `-fdump-rtl-seqabstr'
            Dump after common sequence discovery.
  
!     `-fdump-rtl-shorten'
            Dump after shortening branches.
  
!     `-fdump-rtl-sibling'
            Dump after sibling call optimizations.
  
!     `-fdump-rtl-split1'
!     `-fdump-rtl-split2'
!     `-fdump-rtl-split3'
!     `-fdump-rtl-split4'
!     `-fdump-rtl-split5'
            These options enable dumping after five rounds of instruction
            splitting.
  
!     `-fdump-rtl-sms'
            Dump after modulo scheduling.  This pass is only run on some
            architectures.
  
!     `-fdump-rtl-stack'
            Dump after conversion from GCC's "flat register file"
            registers to the x87's stack-like registers.  This pass is
            only run on x86 variants.
  
!     `-fdump-rtl-subreg1'
!     `-fdump-rtl-subreg2'
!           `-fdump-rtl-subreg1' and `-fdump-rtl-subreg2' enable dumping
            after the two subreg expansion passes.
  
!     `-fdump-rtl-unshare'
            Dump after all rtl has been unshared.
  
!     `-fdump-rtl-vartrack'
            Dump after variable tracking.
  
!     `-fdump-rtl-vregs'
            Dump after converting virtual registers to hard registers.
  
!     `-fdump-rtl-web'
            Dump after live range splitting.
  
!     `-fdump-rtl-regclass'
!     `-fdump-rtl-subregs_of_mode_init'
!     `-fdump-rtl-subregs_of_mode_finish'
!     `-fdump-rtl-dfinit'
!     `-fdump-rtl-dfinish'
            These dumps are defined but always produce empty files.
  
!     `-da'
!     `-fdump-rtl-all'
            Produce all the dumps listed above.
  
!     `-dA'
            Annotate the assembler output with miscellaneous debugging
            information.
  
!     `-dD'
            Dump all macro definitions, at the end of preprocessing, in
            addition to normal output.
  
!     `-dH'
            Produce a core dump whenever an error occurs.
  
!     `-dp'
            Annotate the assembler output with a comment indicating which
            pattern and alternative is used.  The length of each
            instruction is also printed.
  
!     `-dP'
            Dump the RTL in the assembler output as a comment before each
!           instruction.  Also turns on `-dp' annotation.
  
!     `-dx'
            Just generate RTL for a function instead of compiling it.
!           Usually used with `-fdump-rtl-expand'.
  
! `-fdump-noaddr'
!      When doing debugging dumps, suppress address output.  This makes
!      it more feasible to use diff on debugging dumps for compiler
       invocations with different compiler binaries and/or different text
       / bss / data / heap / stack / dso start locations.
  
! `-freport-bug'
       Collect and dump debug information into temporary file if ICE in
       C/C++ compiler occured.
  
! `-fdump-unnumbered'
       When doing debugging dumps, suppress instruction numbers and
       address output.  This makes it more feasible to use diff on
!      debugging dumps for compiler invocations with different options,
!      in particular with and without `-g'.
  
! `-fdump-unnumbered-links'
!      When doing debugging dumps (see `-d' option above), suppress
       instruction numbers for the links to the previous and next
       instructions in a sequence.
  
! `-fdump-translation-unit (C++ only)'
! `-fdump-translation-unit-OPTIONS (C++ only)'
       Dump a representation of the tree structure for the entire
       translation unit to a file.  The file name is made by appending
!      `.tu' to the source file name, and the file is created in the same
!      directory as the output file.  If the `-OPTIONS' form is used,
       OPTIONS controls the details of the dump as described for the
!      `-fdump-tree' options.
  
! `-fdump-class-hierarchy (C++ only)'
! `-fdump-class-hierarchy-OPTIONS (C++ only)'
       Dump a representation of each class's hierarchy and virtual
       function table layout to a file.  The file name is made by
!      appending `.class' to the source file name, and the file is
!      created in the same directory as the output file.  If the
!      `-OPTIONS' form is used, OPTIONS controls the details of the dump
!      as described for the `-fdump-tree' options.
  
! `-fdump-ipa-SWITCH'
       Control the dumping at various stages of inter-procedural analysis
       language tree to a file.  The file name is generated by appending a
       switch specific suffix to the source file name, and the file is
       created in the same directory as the output file.  The following
       dumps are possible:
  
!     `all'
            Enables all inter-procedural analysis dumps.
  
!     `cgraph'
            Dumps information about call-graph optimization, unused
            function removal, and inlining decisions.
  
!     `inline'
            Dump after function inlining.
  
! 
! `-fdump-passes'
       Dump the list of optimization passes that are turned on and off by
       the current command-line options.
  
! `-fdump-statistics-OPTION'
       Enable and control dumping of pass statistics in a separate file.
       The file name is generated by appending a suffix ending in
!      `.statistics' to the source file name, and the file is created in
!      the same directory as the output file.  If the `-OPTION' form is
!      used, `-stats' causes counters to be summed over the whole
!      compilation unit while `-details' dumps every event as the passes
       generate them.  The default with no option is to sum counters for
       each function compiled.
  
! `-fdump-tree-SWITCH'
! `-fdump-tree-SWITCH-OPTIONS'
! `-fdump-tree-SWITCH-OPTIONS=FILENAME'
       Control the dumping at various stages of processing the
       intermediate language tree to a file.  The file name is generated
       by appending a switch-specific suffix to the source file name, and
!      the file is created in the same directory as the output file. In
!      case of `=FILENAME' option, the dump is output on the given file
!      instead of the auto named dump files.  If the `-OPTIONS' form is
!      used, OPTIONS is a list of `-' separated options which control the
       details of the dump.  Not all options are applicable to all dumps;
       those that are not meaningful are ignored.  The following options
       are available
  
!     `address'
            Print the address of each node.  Usually this is not
            meaningful as it changes according to the environment and
!           source file.  Its primary use is for tying up a dump file
!           with a debug environment.
! 
!     `asmname'
!           If `DECL_ASSEMBLER_NAME' has been set for a given decl, use
!           that in the dump instead of `DECL_NAME'.  Its primary use is
            ease of use working backward from mangled names in the
            assembly file.
! 
!     `slim'
            When dumping front-end intermediate representations, inhibit
            dumping of members of a scope or body of a function merely
            because that scope has been reached.  Only dump such items
--- 5856,6188 ----
            # enable tree full unroll
               -fenable-tree-unroll
  
! 
! '-dLETTERS'
! '-fdump-rtl-PASS'
! '-fdump-rtl-PASS=FILENAME'
       Says to make debugging dumps during compilation at times specified
       by LETTERS.  This is used for debugging the RTL-based passes of the
       compiler.  The file names for most of the dumps are made by
       appending a pass number and a word to the DUMPNAME, and the files
!      are created in the directory of the output file.  In case of
!      '=FILENAME' option, the dump is output on the given file instead of
!      the pass numbered dump files.  Note that the pass number is
       computed statically as passes get registered into the pass manager.
!      Thus the numbering is not related to the dynamic order of execution
!      of passes.  In particular, a pass installed by a plugin could have
!      a number over 200 even if it executed quite early.  DUMPNAME is
!      generated from the name of the output file, if explicitly specified
!      and it is not an executable, otherwise it is the basename of the
!      source file.  These switches may have different effects when '-E'
!      is used for preprocessing.
  
!      Debug dumps can be enabled with a '-fdump-rtl' switch or some '-d'
       option LETTERS.  Here are the possible letters for use in PASS and
       LETTERS, and their meanings:
  
!      '-fdump-rtl-alignments'
            Dump after branch alignments have been computed.
  
!      '-fdump-rtl-asmcons'
            Dump after fixing rtl statements that have unsatisfied in/out
            constraints.
  
!      '-fdump-rtl-auto_inc_dec'
            Dump after auto-inc-dec discovery.  This pass is only run on
            architectures that have auto inc or auto dec instructions.
  
!      '-fdump-rtl-barriers'
            Dump after cleaning up the barrier instructions.
  
!      '-fdump-rtl-bbpart'
            Dump after partitioning hot and cold basic blocks.
  
!      '-fdump-rtl-bbro'
            Dump after block reordering.
  
!      '-fdump-rtl-btl1'
!      '-fdump-rtl-btl2'
!           '-fdump-rtl-btl1' and '-fdump-rtl-btl2' enable dumping after
            the two branch target load optimization passes.
  
!      '-fdump-rtl-bypass'
            Dump after jump bypassing and control flow optimizations.
  
!      '-fdump-rtl-combine'
            Dump after the RTL instruction combination pass.
  
!      '-fdump-rtl-compgotos'
            Dump after duplicating the computed gotos.
  
!      '-fdump-rtl-ce1'
!      '-fdump-rtl-ce2'
!      '-fdump-rtl-ce3'
!           '-fdump-rtl-ce1', '-fdump-rtl-ce2', and '-fdump-rtl-ce3'
            enable dumping after the three if conversion passes.
  
!      '-fdump-rtl-cprop_hardreg'
            Dump after hard register copy propagation.
  
!      '-fdump-rtl-csa'
            Dump after combining stack adjustments.
  
!      '-fdump-rtl-cse1'
!      '-fdump-rtl-cse2'
!           '-fdump-rtl-cse1' and '-fdump-rtl-cse2' enable dumping after
            the two common subexpression elimination passes.
  
!      '-fdump-rtl-dce'
            Dump after the standalone dead code elimination passes.
  
!      '-fdump-rtl-dbr'
            Dump after delayed branch scheduling.
  
!      '-fdump-rtl-dce1'
!      '-fdump-rtl-dce2'
!           '-fdump-rtl-dce1' and '-fdump-rtl-dce2' enable dumping after
            the two dead store elimination passes.
  
!      '-fdump-rtl-eh'
            Dump after finalization of EH handling code.
  
!      '-fdump-rtl-eh_ranges'
            Dump after conversion of EH handling range regions.
  
!      '-fdump-rtl-expand'
            Dump after RTL generation.
  
!      '-fdump-rtl-fwprop1'
!      '-fdump-rtl-fwprop2'
!           '-fdump-rtl-fwprop1' and '-fdump-rtl-fwprop2' enable dumping
            after the two forward propagation passes.
  
!      '-fdump-rtl-gcse1'
!      '-fdump-rtl-gcse2'
!           '-fdump-rtl-gcse1' and '-fdump-rtl-gcse2' enable dumping after
!           global common subexpression elimination.
  
!      '-fdump-rtl-init-regs'
            Dump after the initialization of the registers.
  
!      '-fdump-rtl-initvals'
            Dump after the computation of the initial value sets.
  
!      '-fdump-rtl-into_cfglayout'
            Dump after converting to cfglayout mode.
  
!      '-fdump-rtl-ira'
            Dump after iterated register allocation.
  
!      '-fdump-rtl-jump'
            Dump after the second jump optimization.
  
!      '-fdump-rtl-loop2'
!           '-fdump-rtl-loop2' enables dumping after the rtl loop
            optimization passes.
  
!      '-fdump-rtl-mach'
            Dump after performing the machine dependent reorganization
            pass, if that pass exists.
  
!      '-fdump-rtl-mode_sw'
            Dump after removing redundant mode switches.
  
!      '-fdump-rtl-rnreg'
            Dump after register renumbering.
  
!      '-fdump-rtl-outof_cfglayout'
            Dump after converting from cfglayout mode.
  
!      '-fdump-rtl-peephole2'
            Dump after the peephole pass.
  
!      '-fdump-rtl-postreload'
            Dump after post-reload optimizations.
  
!      '-fdump-rtl-pro_and_epilogue'
            Dump after generating the function prologues and epilogues.
  
!      '-fdump-rtl-sched1'
!      '-fdump-rtl-sched2'
!           '-fdump-rtl-sched1' and '-fdump-rtl-sched2' enable dumping
            after the basic block scheduling passes.
  
!      '-fdump-rtl-ree'
            Dump after sign/zero extension elimination.
  
!      '-fdump-rtl-seqabstr'
            Dump after common sequence discovery.
  
!      '-fdump-rtl-shorten'
            Dump after shortening branches.
  
!      '-fdump-rtl-sibling'
            Dump after sibling call optimizations.
  
!      '-fdump-rtl-split1'
!      '-fdump-rtl-split2'
!      '-fdump-rtl-split3'
!      '-fdump-rtl-split4'
!      '-fdump-rtl-split5'
            These options enable dumping after five rounds of instruction
            splitting.
  
!      '-fdump-rtl-sms'
            Dump after modulo scheduling.  This pass is only run on some
            architectures.
  
!      '-fdump-rtl-stack'
            Dump after conversion from GCC's "flat register file"
            registers to the x87's stack-like registers.  This pass is
            only run on x86 variants.
  
!      '-fdump-rtl-subreg1'
!      '-fdump-rtl-subreg2'
!           '-fdump-rtl-subreg1' and '-fdump-rtl-subreg2' enable dumping
            after the two subreg expansion passes.
  
!      '-fdump-rtl-unshare'
            Dump after all rtl has been unshared.
  
!      '-fdump-rtl-vartrack'
            Dump after variable tracking.
  
!      '-fdump-rtl-vregs'
            Dump after converting virtual registers to hard registers.
  
!      '-fdump-rtl-web'
            Dump after live range splitting.
  
!      '-fdump-rtl-regclass'
!      '-fdump-rtl-subregs_of_mode_init'
!      '-fdump-rtl-subregs_of_mode_finish'
!      '-fdump-rtl-dfinit'
!      '-fdump-rtl-dfinish'
            These dumps are defined but always produce empty files.
  
!      '-da'
!      '-fdump-rtl-all'
            Produce all the dumps listed above.
  
!      '-dA'
            Annotate the assembler output with miscellaneous debugging
            information.
  
!      '-dD'
            Dump all macro definitions, at the end of preprocessing, in
            addition to normal output.
  
!      '-dH'
            Produce a core dump whenever an error occurs.
  
!      '-dp'
            Annotate the assembler output with a comment indicating which
            pattern and alternative is used.  The length of each
            instruction is also printed.
  
!      '-dP'
            Dump the RTL in the assembler output as a comment before each
!           instruction.  Also turns on '-dp' annotation.
  
!      '-dx'
            Just generate RTL for a function instead of compiling it.
!           Usually used with '-fdump-rtl-expand'.
  
! '-fdump-noaddr'
!      When doing debugging dumps, suppress address output.  This makes it
!      more feasible to use diff on debugging dumps for compiler
       invocations with different compiler binaries and/or different text
       / bss / data / heap / stack / dso start locations.
  
! '-freport-bug'
       Collect and dump debug information into temporary file if ICE in
       C/C++ compiler occured.
  
! '-fdump-unnumbered'
       When doing debugging dumps, suppress instruction numbers and
       address output.  This makes it more feasible to use diff on
!      debugging dumps for compiler invocations with different options, in
!      particular with and without '-g'.
  
! '-fdump-unnumbered-links'
!      When doing debugging dumps (see '-d' option above), suppress
       instruction numbers for the links to the previous and next
       instructions in a sequence.
  
! '-fdump-translation-unit (C++ only)'
! '-fdump-translation-unit-OPTIONS (C++ only)'
       Dump a representation of the tree structure for the entire
       translation unit to a file.  The file name is made by appending
!      '.tu' to the source file name, and the file is created in the same
!      directory as the output file.  If the '-OPTIONS' form is used,
       OPTIONS controls the details of the dump as described for the
!      '-fdump-tree' options.
  
! '-fdump-class-hierarchy (C++ only)'
! '-fdump-class-hierarchy-OPTIONS (C++ only)'
       Dump a representation of each class's hierarchy and virtual
       function table layout to a file.  The file name is made by
!      appending '.class' to the source file name, and the file is created
!      in the same directory as the output file.  If the '-OPTIONS' form
!      is used, OPTIONS controls the details of the dump as described for
!      the '-fdump-tree' options.
  
! '-fdump-ipa-SWITCH'
       Control the dumping at various stages of inter-procedural analysis
       language tree to a file.  The file name is generated by appending a
       switch specific suffix to the source file name, and the file is
       created in the same directory as the output file.  The following
       dumps are possible:
  
!      'all'
            Enables all inter-procedural analysis dumps.
  
!      'cgraph'
            Dumps information about call-graph optimization, unused
            function removal, and inlining decisions.
  
!      'inline'
            Dump after function inlining.
  
! '-fdump-passes'
       Dump the list of optimization passes that are turned on and off by
       the current command-line options.
  
! '-fdump-statistics-OPTION'
       Enable and control dumping of pass statistics in a separate file.
       The file name is generated by appending a suffix ending in
!      '.statistics' to the source file name, and the file is created in
!      the same directory as the output file.  If the '-OPTION' form is
!      used, '-stats' causes counters to be summed over the whole
!      compilation unit while '-details' dumps every event as the passes
       generate them.  The default with no option is to sum counters for
       each function compiled.
  
! '-fdump-tree-SWITCH'
! '-fdump-tree-SWITCH-OPTIONS'
! '-fdump-tree-SWITCH-OPTIONS=FILENAME'
       Control the dumping at various stages of processing the
       intermediate language tree to a file.  The file name is generated
       by appending a switch-specific suffix to the source file name, and
!      the file is created in the same directory as the output file.  In
!      case of '=FILENAME' option, the dump is output on the given file
!      instead of the auto named dump files.  If the '-OPTIONS' form is
!      used, OPTIONS is a list of '-' separated options which control the
       details of the dump.  Not all options are applicable to all dumps;
       those that are not meaningful are ignored.  The following options
       are available
  
!      'address'
            Print the address of each node.  Usually this is not
            meaningful as it changes according to the environment and
!           source file.  Its primary use is for tying up a dump file with
!           a debug environment.
!      'asmname'
!           If 'DECL_ASSEMBLER_NAME' has been set for a given decl, use
!           that in the dump instead of 'DECL_NAME'.  Its primary use is
            ease of use working backward from mangled names in the
            assembly file.
!      'slim'
            When dumping front-end intermediate representations, inhibit
            dumping of members of a scope or body of a function merely
            because that scope has been reached.  Only dump such items
*************** program or GCC:
*** 6222,6490 ****
  
            When dumping RTL, print the RTL in slim (condensed) form
            instead of the default LISP-like representation.
! 
!     `raw'
            Print a raw representation of the tree.  By default, trees are
            pretty-printed into a C-like representation.
! 
!     `details'
!           Enable more detailed dumps (not honored by every dump
!           option). Also include information from the optimization
!           passes.
! 
!     `stats'
            Enable dumping various statistics about the pass (not honored
            by every dump option).
! 
!     `blocks'
            Enable showing basic block boundaries (disabled in raw dumps).
! 
!     `graph'
            For each of the other indicated dump files
!           (`-fdump-rtl-PASS'), dump a representation of the control
!           flow graph suitable for viewing with GraphViz to
!           `FILE.PASSID.PASS.dot'.  Each function in the file is
            pretty-printed as a subgraph, so that GraphViz can render them
            all in a single plot.
  
!           This option currently only works for RTL dumps, and the RTL
!           is always dumped in slim form.
! 
!     `vops'
            Enable showing virtual operands for every statement.
! 
!     `lineno'
            Enable showing line numbers for statements.
! 
!     `uid'
!           Enable showing the unique ID (`DECL_UID') for each variable.
! 
!     `verbose'
            Enable showing the tree dump for each statement.
! 
!     `eh'
            Enable showing the EH region number holding each statement.
! 
!     `scev'
            Enable showing scalar evolution analysis details.
! 
!     `optimized'
            Enable showing optimization information (only available in
            certain passes).
! 
!     `missed'
!           Enable showing missed optimization information (only
!           available in certain passes).
! 
!     `note'
!           Enable other detailed optimization information (only
!           available in certain passes).
! 
!     `=FILENAME'
            Instead of an auto named dump file, output into the given file
!           name. The file names `stdout' and `stderr' are treated
            specially and are considered already open standard streams.
            For example,
  
                 gcc -O2 -ftree-vectorize -fdump-tree-vect-blocks=foo.dump
                      -fdump-tree-pre=stderr file.c
  
!           outputs vectorizer dump into `foo.dump', while the PRE dump is
!           output on to `stderr'. If two conflicting dump filenames are
            given for the same pass, then the latter option overrides the
            earlier one.
  
!     `all'
!           Turn on all options, except `raw', `slim', `verbose' and
!           `lineno'.
  
!     `optall'
!           Turn on all optimization options, i.e., `optimized',
!           `missed', and `note'.
  
       The following tree dumps are possible:
-     `original'
-           Dump before any tree based optimization, to `FILE.original'.
  
!     `optimized'
!           Dump after all tree based optimization, to `FILE.optimized'.
  
!     `gimple'
!           Dump each function before and after the gimplification pass
!           to a file.  The file name is made by appending `.gimple' to
!           the source file name.
  
!     `cfg'
            Dump the control flow graph of each function to a file.  The
!           file name is made by appending `.cfg' to the source file name.
  
!     `ch'
            Dump each function after copying loop headers.  The file name
!           is made by appending `.ch' to the source file name.
  
!     `ssa'
!           Dump SSA related information to a file.  The file name is
!           made by appending `.ssa' to the source file name.
  
!     `alias'
!           Dump aliasing information for each function.  The file name
!           is made by appending `.alias' to the source file name.
  
!     `ccp'
            Dump each function after CCP.  The file name is made by
!           appending `.ccp' to the source file name.
  
!     `storeccp'
            Dump each function after STORE-CCP.  The file name is made by
!           appending `.storeccp' to the source file name.
  
!     `pre'
            Dump trees after partial redundancy elimination.  The file
!           name is made by appending `.pre' to the source file name.
  
!     `fre'
            Dump trees after full redundancy elimination.  The file name
!           is made by appending `.fre' to the source file name.
  
!     `copyprop'
            Dump trees after copy propagation.  The file name is made by
!           appending `.copyprop' to the source file name.
  
!     `store_copyprop'
            Dump trees after store copy-propagation.  The file name is
!           made by appending `.store_copyprop' to the source file name.
  
!     `dce'
!           Dump each function after dead code elimination.  The file
!           name is made by appending `.dce' to the source file name.
  
!     `sra'
            Dump each function after performing scalar replacement of
!           aggregates.  The file name is made by appending `.sra' to the
            source file name.
  
!     `sink'
            Dump each function after performing code sinking.  The file
!           name is made by appending `.sink' to the source file name.
  
!     `dom'
            Dump each function after applying dominator tree
!           optimizations.  The file name is made by appending `.dom' to
            the source file name.
  
!     `dse'
!           Dump each function after applying dead store elimination.
!           The file name is made by appending `.dse' to the source file
!           name.
  
!     `phiopt'
            Dump each function after optimizing PHI nodes into
            straightline code.  The file name is made by appending
!           `.phiopt' to the source file name.
  
!     `forwprop'
            Dump each function after forward propagating single use
!           variables.  The file name is made by appending `.forwprop' to
            the source file name.
  
!     `copyrename'
            Dump each function after applying the copy rename
            optimization.  The file name is made by appending
!           `.copyrename' to the source file name.
  
!     `nrv'
            Dump each function after applying the named return value
            optimization on generic trees.  The file name is made by
!           appending `.nrv' to the source file name.
  
!     `vect'
!           Dump each function after applying vectorization of loops.
!           The file name is made by appending `.vect' to the source file
            name.
  
!     `slp'
            Dump each function after applying vectorization of basic
!           blocks.  The file name is made by appending `.slp' to the
            source file name.
  
!     `vrp'
!           Dump each function after Value Range Propagation (VRP).  The
!           file name is made by appending `.vrp' to the source file name.
  
!     `all'
!           Enable all the available tree dumps with the flags provided
!           in this option.
  
! `-fopt-info'
! `-fopt-info-OPTIONS'
! `-fopt-info-OPTIONS=FILENAME'
!      Controls optimization dumps from various optimization passes. If
!      the `-OPTIONS' form is used, OPTIONS is a list of `-' separated
       option keywords to select the dump details and optimizations.
  
       The OPTIONS can be divided into two groups: options describing the
       verbosity of the dump, and options describing which optimizations
!      should be included. The options from both the groups can be freely
!      mixed as they are non-overlapping. However, in case of any
       conflicts, the later options override the earlier options on the
       command line.
  
       The following options control the dump verbosity:
  
!     `optimized'
            Print information when an optimization is successfully
!           applied. It is up to a pass to decide which information is
!           relevant. For example, the vectorizer passes print the source
            location of loops which are successfully vectorized.
! 
!     `missed'
!           Print information about missed optimizations. Individual
            passes control which information to include in the output.
! 
!     `note'
            Print verbose information about optimizations, such as certain
            transformations, more detailed messages about decisions etc.
! 
!     `all'
!           Print detailed optimization information. This includes
!           `optimized', `missed', and `note'.
  
       One or more of the following option keywords can be used to
       describe a group of optimizations:
  
!     `ipa'
            Enable dumps from all interprocedural optimizations.
! 
!     `loop'
            Enable dumps from all loop optimizations.
! 
!     `inline'
            Enable dumps from all inlining optimizations.
! 
!     `vec'
            Enable dumps from all vectorization optimizations.
! 
!     `optall'
!           Enable dumps from all optimizations. This is a superset of
            the optimization groups listed above.
  
!      If OPTIONS is omitted, it defaults to `optimized-optall', which
       means to dump all info about successful optimizations from all the
       passes.
  
!      If the FILENAME is provided, then the dumps from all the
!      applicable optimizations are concatenated into the FILENAME.
!      Otherwise the dump is output onto `stderr'. Though multiple
!      `-fopt-info' options are accepted, only one of them can include a
!      FILENAME. If other filenames are provided then all but the first
!      such option are ignored.
  
       Note that the output FILENAME is overwritten in case of multiple
!      translation units. If a combined output from multiple translation
!      units is desired, `stderr' should be used instead.
  
       In the following example, the optimization info is output to
!      `stderr':
  
            gcc -O3 -fopt-info
  
--- 6193,6438 ----
  
            When dumping RTL, print the RTL in slim (condensed) form
            instead of the default LISP-like representation.
!      'raw'
            Print a raw representation of the tree.  By default, trees are
            pretty-printed into a C-like representation.
!      'details'
!           Enable more detailed dumps (not honored by every dump option).
!           Also include information from the optimization passes.
!      'stats'
            Enable dumping various statistics about the pass (not honored
            by every dump option).
!      'blocks'
            Enable showing basic block boundaries (disabled in raw dumps).
!      'graph'
            For each of the other indicated dump files
!           ('-fdump-rtl-PASS'), dump a representation of the control flow
!           graph suitable for viewing with GraphViz to
!           'FILE.PASSID.PASS.dot'.  Each function in the file is
            pretty-printed as a subgraph, so that GraphViz can render them
            all in a single plot.
  
!           This option currently only works for RTL dumps, and the RTL is
!           always dumped in slim form.
!      'vops'
            Enable showing virtual operands for every statement.
!      'lineno'
            Enable showing line numbers for statements.
!      'uid'
!           Enable showing the unique ID ('DECL_UID') for each variable.
!      'verbose'
            Enable showing the tree dump for each statement.
!      'eh'
            Enable showing the EH region number holding each statement.
!      'scev'
            Enable showing scalar evolution analysis details.
!      'optimized'
            Enable showing optimization information (only available in
            certain passes).
!      'missed'
!           Enable showing missed optimization information (only available
!           in certain passes).
!      'note'
!           Enable other detailed optimization information (only available
!           in certain passes).
!      '=FILENAME'
            Instead of an auto named dump file, output into the given file
!           name.  The file names 'stdout' and 'stderr' are treated
            specially and are considered already open standard streams.
            For example,
  
                 gcc -O2 -ftree-vectorize -fdump-tree-vect-blocks=foo.dump
                      -fdump-tree-pre=stderr file.c
  
!           outputs vectorizer dump into 'foo.dump', while the PRE dump is
!           output on to 'stderr'.  If two conflicting dump filenames are
            given for the same pass, then the latter option overrides the
            earlier one.
  
!      'all'
!           Turn on all options, except 'raw', 'slim', 'verbose' and
!           'lineno'.
  
!      'optall'
!           Turn on all optimization options, i.e., 'optimized', 'missed',
!           and 'note'.
  
       The following tree dumps are possible:
  
!      'original'
!           Dump before any tree based optimization, to 'FILE.original'.
  
!      'optimized'
!           Dump after all tree based optimization, to 'FILE.optimized'.
  
!      'gimple'
!           Dump each function before and after the gimplification pass to
!           a file.  The file name is made by appending '.gimple' to the
!           source file name.
! 
!      'cfg'
            Dump the control flow graph of each function to a file.  The
!           file name is made by appending '.cfg' to the source file name.
  
!      'ch'
            Dump each function after copying loop headers.  The file name
!           is made by appending '.ch' to the source file name.
  
!      'ssa'
!           Dump SSA related information to a file.  The file name is made
!           by appending '.ssa' to the source file name.
  
!      'alias'
!           Dump aliasing information for each function.  The file name is
!           made by appending '.alias' to the source file name.
  
!      'ccp'
            Dump each function after CCP.  The file name is made by
!           appending '.ccp' to the source file name.
  
!      'storeccp'
            Dump each function after STORE-CCP.  The file name is made by
!           appending '.storeccp' to the source file name.
  
!      'pre'
            Dump trees after partial redundancy elimination.  The file
!           name is made by appending '.pre' to the source file name.
  
!      'fre'
            Dump trees after full redundancy elimination.  The file name
!           is made by appending '.fre' to the source file name.
  
!      'copyprop'
            Dump trees after copy propagation.  The file name is made by
!           appending '.copyprop' to the source file name.
  
!      'store_copyprop'
            Dump trees after store copy-propagation.  The file name is
!           made by appending '.store_copyprop' to the source file name.
  
!      'dce'
!           Dump each function after dead code elimination.  The file name
!           is made by appending '.dce' to the source file name.
  
!      'sra'
            Dump each function after performing scalar replacement of
!           aggregates.  The file name is made by appending '.sra' to the
            source file name.
  
!      'sink'
            Dump each function after performing code sinking.  The file
!           name is made by appending '.sink' to the source file name.
  
!      'dom'
            Dump each function after applying dominator tree
!           optimizations.  The file name is made by appending '.dom' to
            the source file name.
  
!      'dse'
!           Dump each function after applying dead store elimination.  The
!           file name is made by appending '.dse' to the source file name.
  
!      'phiopt'
            Dump each function after optimizing PHI nodes into
            straightline code.  The file name is made by appending
!           '.phiopt' to the source file name.
  
!      'forwprop'
            Dump each function after forward propagating single use
!           variables.  The file name is made by appending '.forwprop' to
            the source file name.
  
!      'copyrename'
            Dump each function after applying the copy rename
            optimization.  The file name is made by appending
!           '.copyrename' to the source file name.
  
!      'nrv'
            Dump each function after applying the named return value
            optimization on generic trees.  The file name is made by
!           appending '.nrv' to the source file name.
  
!      'vect'
!           Dump each function after applying vectorization of loops.  The
!           file name is made by appending '.vect' to the source file
            name.
  
!      'slp'
            Dump each function after applying vectorization of basic
!           blocks.  The file name is made by appending '.slp' to the
            source file name.
  
!      'vrp'
!           Dump each function after Value Range Propagation (VRP). The
!           file name is made by appending '.vrp' to the source file name.
  
!      'all'
!           Enable all the available tree dumps with the flags provided in
!           this option.
  
! '-fopt-info'
! '-fopt-info-OPTIONS'
! '-fopt-info-OPTIONS=FILENAME'
!      Controls optimization dumps from various optimization passes.  If
!      the '-OPTIONS' form is used, OPTIONS is a list of '-' separated
       option keywords to select the dump details and optimizations.
  
       The OPTIONS can be divided into two groups: options describing the
       verbosity of the dump, and options describing which optimizations
!      should be included.  The options from both the groups can be freely
!      mixed as they are non-overlapping.  However, in case of any
       conflicts, the later options override the earlier options on the
       command line.
  
       The following options control the dump verbosity:
  
!      'optimized'
            Print information when an optimization is successfully
!           applied.  It is up to a pass to decide which information is
!           relevant.  For example, the vectorizer passes print the source
            location of loops which are successfully vectorized.
!      'missed'
!           Print information about missed optimizations.  Individual
            passes control which information to include in the output.
!      'note'
            Print verbose information about optimizations, such as certain
            transformations, more detailed messages about decisions etc.
!      'all'
!           Print detailed optimization information.  This includes
!           'optimized', 'missed', and 'note'.
  
       One or more of the following option keywords can be used to
       describe a group of optimizations:
  
!      'ipa'
            Enable dumps from all interprocedural optimizations.
!      'loop'
            Enable dumps from all loop optimizations.
!      'inline'
            Enable dumps from all inlining optimizations.
!      'vec'
            Enable dumps from all vectorization optimizations.
!      'optall'
!           Enable dumps from all optimizations.  This is a superset of
            the optimization groups listed above.
  
!      If OPTIONS is omitted, it defaults to 'optimized-optall', which
       means to dump all info about successful optimizations from all the
       passes.
  
!      If the FILENAME is provided, then the dumps from all the applicable
!      optimizations are concatenated into the FILENAME.  Otherwise the
!      dump is output onto 'stderr'.  Though multiple '-fopt-info' options
!      are accepted, only one of them can include a FILENAME.  If other
!      filenames are provided then all but the first such option are
!      ignored.
  
       Note that the output FILENAME is overwritten in case of multiple
!      translation units.  If a combined output from multiple translation
!      units is desired, 'stderr' should be used instead.
  
       In the following example, the optimization info is output to
!      'stderr':
  
            gcc -O3 -fopt-info
  
*************** program or GCC:
*** 6492,6527 ****
            gcc -O3 -fopt-info-missed=missed.all
  
       outputs missed optimization report from all the passes into
!      `missed.all', and this one:
  
            gcc -O2 -ftree-vectorize -fopt-info-vec-missed
  
       prints information about missed optimization opportunities from
!      vectorization passes on `stderr'.  Note that
!      `-fopt-info-vec-missed' is equivalent to `-fopt-info-missed-vec'.
  
       As another example,
            gcc -O3 -fopt-info-inline-optimized-missed=inline.txt
  
!      outputs information about missed optimizations as well as
!      optimized locations from all the inlining passes into `inline.txt'.
  
       Finally, consider:
  
            gcc -fopt-info-vec-missed=vec.miss -fopt-info-loop-optimized=loop.opt
  
!      Here the two output filenames `vec.miss' and `loop.opt' are in
!      conflict since only one output file is allowed. In this case, only
       the first option takes effect and the subsequent options are
!      ignored. Thus only `vec.miss' is produced which contains dumps
       from the vectorizer about missed opportunities.
  
! `-frandom-seed=STRING'
       This option provides a seed that GCC uses in place of random
       numbers in generating certain symbol names that have to be
       different in every compiled file.  It is also used to place unique
       stamps in coverage data files and the object files that produce
!      them.  You can use the `-frandom-seed' option to produce
       reproducibly identical object files.
  
       The STRING can either be a number (decimal, octal or hex) or an
--- 6440,6475 ----
            gcc -O3 -fopt-info-missed=missed.all
  
       outputs missed optimization report from all the passes into
!      'missed.all', and this one:
  
            gcc -O2 -ftree-vectorize -fopt-info-vec-missed
  
       prints information about missed optimization opportunities from
!      vectorization passes on 'stderr'.  Note that
!      '-fopt-info-vec-missed' is equivalent to '-fopt-info-missed-vec'.
  
       As another example,
            gcc -O3 -fopt-info-inline-optimized-missed=inline.txt
  
!      outputs information about missed optimizations as well as optimized
!      locations from all the inlining passes into 'inline.txt'.
  
       Finally, consider:
  
            gcc -fopt-info-vec-missed=vec.miss -fopt-info-loop-optimized=loop.opt
  
!      Here the two output filenames 'vec.miss' and 'loop.opt' are in
!      conflict since only one output file is allowed.  In this case, only
       the first option takes effect and the subsequent options are
!      ignored.  Thus only 'vec.miss' is produced which contains dumps
       from the vectorizer about missed opportunities.
  
! '-frandom-seed=STRING'
       This option provides a seed that GCC uses in place of random
       numbers in generating certain symbol names that have to be
       different in every compiled file.  It is also used to place unique
       stamps in coverage data files and the object files that produce
!      them.  You can use the '-frandom-seed' option to produce
       reproducibly identical object files.
  
       The STRING can either be a number (decimal, octal or hex) or an
*************** program or GCC:
*** 6530,6584 ****
  
       The STRING should be different for every file you compile.
  
! `-fsched-verbose=N'
       On targets that use instruction scheduling, this option controls
       the amount of debugging output the scheduler prints.  This
       information is written to standard error, unless
!      `-fdump-rtl-sched1' or `-fdump-rtl-sched2' is specified, in which
!      case it is output to the usual dump listing file, `.sched1' or
!      `.sched2' respectively.  However for N greater than nine, the
       output is always printed to standard error.
  
!      For N greater than zero, `-fsched-verbose' outputs the same
!      information as `-fdump-rtl-sched1' and `-fdump-rtl-sched2'.  For N
       greater than one, it also output basic block probabilities,
       detailed ready list information and unit/insn info.  For N greater
       than two, it includes RTL at abort point, control-flow and regions
!      info.  And for N over four, `-fsched-verbose' also includes
       dependence info.
  
! `-save-temps'
! `-save-temps=cwd'
       Store the usual "temporary" intermediate files permanently; place
       them in the current directory and name them based on the source
!      file.  Thus, compiling `foo.c' with `-c -save-temps' produces files
!      `foo.i' and `foo.s', as well as `foo.o'.  This creates a
!      preprocessed `foo.i' output file even though the compiler now
       normally uses an integrated preprocessor.
  
!      When used in combination with the `-x' command-line option,
!      `-save-temps' is sensible enough to avoid over writing an input
       source file with the same extension as an intermediate file.  The
       corresponding intermediate file may be obtained by renaming the
!      source file before using `-save-temps'.
  
       If you invoke GCC in parallel, compiling several different source
       files that share a common base name in different subdirectories or
       the same source file compiled for multiple output destinations, it
!      is likely that the different parallel compilers will interfere
!      with each other, and overwrite the temporary files.  For instance:
  
            gcc -save-temps -o outdir1/foo.o indir1/foo.c&
            gcc -save-temps -o outdir2/foo.o indir2/foo.c&
  
!      may result in `foo.i' and `foo.o' being written to simultaneously
       by both compilers.
  
! `-save-temps=obj'
       Store the usual "temporary" intermediate files permanently.  If the
!      `-o' option is used, the temporary files are based on the object
!      file.  If the `-o' option is not used, the `-save-temps=obj'
!      switch behaves like `-save-temps'.
  
       For example:
  
--- 6478,6532 ----
  
       The STRING should be different for every file you compile.
  
! '-fsched-verbose=N'
       On targets that use instruction scheduling, this option controls
       the amount of debugging output the scheduler prints.  This
       information is written to standard error, unless
!      '-fdump-rtl-sched1' or '-fdump-rtl-sched2' is specified, in which
!      case it is output to the usual dump listing file, '.sched1' or
!      '.sched2' respectively.  However for N greater than nine, the
       output is always printed to standard error.
  
!      For N greater than zero, '-fsched-verbose' outputs the same
!      information as '-fdump-rtl-sched1' and '-fdump-rtl-sched2'.  For N
       greater than one, it also output basic block probabilities,
       detailed ready list information and unit/insn info.  For N greater
       than two, it includes RTL at abort point, control-flow and regions
!      info.  And for N over four, '-fsched-verbose' also includes
       dependence info.
  
! '-save-temps'
! '-save-temps=cwd'
       Store the usual "temporary" intermediate files permanently; place
       them in the current directory and name them based on the source
!      file.  Thus, compiling 'foo.c' with '-c -save-temps' produces files
!      'foo.i' and 'foo.s', as well as 'foo.o'.  This creates a
!      preprocessed 'foo.i' output file even though the compiler now
       normally uses an integrated preprocessor.
  
!      When used in combination with the '-x' command-line option,
!      '-save-temps' is sensible enough to avoid over writing an input
       source file with the same extension as an intermediate file.  The
       corresponding intermediate file may be obtained by renaming the
!      source file before using '-save-temps'.
  
       If you invoke GCC in parallel, compiling several different source
       files that share a common base name in different subdirectories or
       the same source file compiled for multiple output destinations, it
!      is likely that the different parallel compilers will interfere with
!      each other, and overwrite the temporary files.  For instance:
  
            gcc -save-temps -o outdir1/foo.o indir1/foo.c&
            gcc -save-temps -o outdir2/foo.o indir2/foo.c&
  
!      may result in 'foo.i' and 'foo.o' being written to simultaneously
       by both compilers.
  
! '-save-temps=obj'
       Store the usual "temporary" intermediate files permanently.  If the
!      '-o' option is used, the temporary files are based on the object
!      file.  If the '-o' option is not used, the '-save-temps=obj' switch
!      behaves like '-save-temps'.
  
       For example:
  
*************** program or GCC:
*** 6586,6595 ****
            gcc -save-temps=obj -c bar.c -o dir/xbar.o
            gcc -save-temps=obj foobar.c -o dir2/yfoobar
  
!      creates `foo.i', `foo.s', `dir/xbar.i', `dir/xbar.s',
!      `dir2/yfoobar.i', `dir2/yfoobar.s', and `dir2/yfoobar.o'.
  
! `-time[=FILE]'
       Report the CPU time taken by each subprocess in the compilation
       sequence.  For C source files, this is the compiler proper and
       assembler (plus the linker if linking is done).
--- 6534,6543 ----
            gcc -save-temps=obj -c bar.c -o dir/xbar.o
            gcc -save-temps=obj foobar.c -o dir2/yfoobar
  
!      creates 'foo.i', 'foo.s', 'dir/xbar.i', 'dir/xbar.s',
!      'dir2/yfoobar.i', 'dir2/yfoobar.s', and 'dir2/yfoobar.o'.
  
! '-time[=FILE]'
       Report the CPU time taken by each subprocess in the compilation
       sequence.  For C source files, this is the compiler proper and
       assembler (plus the linker if linking is done).
*************** program or GCC:
*** 6605,6612 ****
       time", time spent executing operating system routines on behalf of
       the program.  Both numbers are in seconds.
  
!      With the specification of an output file, the output is appended
!      to the named file, and it looks like this:
  
            0.12 0.01 cc1 OPTIONS
            0.00 0.01 as OPTIONS
--- 6553,6560 ----
       time", time spent executing operating system routines on behalf of
       the program.  Both numbers are in seconds.
  
!      With the specification of an output file, the output is appended to
!      the named file, and it looks like this:
  
            0.12 0.01 cc1 OPTIONS
            0.00 0.01 as OPTIONS
*************** program or GCC:
*** 6616,6735 ****
       one can later tell what file was being compiled, and with which
       options.
  
! `-fvar-tracking'
!      Run variable tracking pass.  It computes where variables are
!      stored at each position in code.  Better debugging information is
!      then generated (if the debugging information format supports this
       information).
  
!      It is enabled by default when compiling with optimization (`-Os',
!      `-O', `-O2', ...), debugging information (`-g') and the debug info
       format supports it.
  
! `-fvar-tracking-assignments'
       Annotate assignments to user variables early in the compilation and
       attempt to carry the annotations over throughout the compilation
       all the way to the end, in an attempt to improve debug information
!      while optimizing.  Use of `-gdwarf-4' is recommended along with it.
  
       It can be enabled even if var-tracking is disabled, in which case
       annotations are created and maintained, but discarded at the end.
!      By default, this flag is enabled together with `-fvar-tracking',
       except when selective scheduling is enabled.
  
! `-fvar-tracking-assignments-toggle'
!      Toggle `-fvar-tracking-assignments', in the same way that
!      `-gtoggle' toggles `-g'.
  
! `-print-file-name=LIBRARY'
!      Print the full absolute name of the library file LIBRARY that
!      would be used when linking--and don't do anything else.  With this
       option, GCC does not compile or link anything; it just prints the
       file name.
  
! `-print-multi-directory'
       Print the directory name corresponding to the multilib selected by
       any other switches present in the command line.  This directory is
!      supposed to exist in `GCC_EXEC_PREFIX'.
  
! `-print-multi-lib'
       Print the mapping from multilib directory names to compiler
       switches that enable them.  The directory name is separated from
!      the switches by `;', and each switch starts with an `@' instead of
!      the `-', without spaces between multiple switches.  This is
       supposed to ease shell processing.
  
! `-print-multi-os-directory'
       Print the path to OS libraries for the selected multilib, relative
!      to some `lib' subdirectory.  If OS libraries are present in the
!      `lib' subdirectory and no multilibs are used, this is usually just
!      `.', if OS libraries are present in `libSUFFIX' sibling
!      directories this prints e.g. `../lib64', `../lib' or `../lib32',
!      or if OS libraries are present in `lib/SUBDIR' subdirectories it
!      prints e.g. `amd64', `sparcv9' or `ev6'.
  
! `-print-multiarch'
!      Print the path to OS libraries for the selected multiarch,
!      relative to some `lib' subdirectory.
  
! `-print-prog-name=PROGRAM'
!      Like `-print-file-name', but searches for a program such as `cpp'.
  
! `-print-libgcc-file-name'
!      Same as `-print-file-name=libgcc.a'.
  
!      This is useful when you use `-nostdlib' or `-nodefaultlibs' but
!      you do want to link with `libgcc.a'.  You can do:
  
            gcc -nostdlib FILES... `gcc -print-libgcc-file-name`
  
! `-print-search-dirs'
       Print the name of the configured installation directory and a list
!      of program and library directories `gcc' searches--and don't do
       anything else.
  
!      This is useful when `gcc' prints the error message `installation
       problem, cannot exec cpp0: No such file or directory'.  To resolve
!      this you either need to put `cpp0' and the other compiler
!      components where `gcc' expects to find them, or you can set the
!      environment variable `GCC_EXEC_PREFIX' to the directory where you
!      installed them.  Don't forget the trailing `/'.  *Note Environment
       Variables::.
  
! `-print-sysroot'
!      Print the target sysroot directory that is used during
!      compilation.  This is the target sysroot specified either at
!      configure time or using the `--sysroot' option, possibly with an
!      extra suffix that depends on compilation options.  If no target
!      sysroot is specified, the option prints nothing.
  
! `-print-sysroot-headers-suffix'
       Print the suffix added to the target sysroot when searching for
       headers, or give an error if the compiler is not configured with
       such a suffix--and don't do anything else.
  
! `-dumpmachine'
       Print the compiler's target machine (for example,
!      `i686-pc-linux-gnu')--and don't do anything else.
  
! `-dumpversion'
!      Print the compiler version (for example, `3.0')--and don't do
       anything else.
  
! `-dumpspecs'
       Print the compiler's built-in specs--and don't do anything else.
       (This is used when GCC itself is being built.)  *Note Spec Files::.
  
! `-fno-eliminate-unused-debug-types'
!      Normally, when producing DWARF 2 output, GCC avoids producing
!      debug symbol output for types that are nowhere used in the source
!      file being compiled.  Sometimes it is useful to have GCC emit
!      debugging information for all types declared in a compilation
!      unit, regardless of whether or not they are actually used in that
!      compilation unit, for example if, in the debugger, you want to
!      cast a value to a type that is not actually used in your program
!      (but is declared).  More often, however, this results in a
!      significant amount of wasted space.
  
  
  File: gcc.info,  Node: Optimize Options,  Next: Preprocessor Options,  Prev: Debugging Options,  Up: Invoking GCC
--- 6564,6683 ----
       one can later tell what file was being compiled, and with which
       options.
  
! '-fvar-tracking'
!      Run variable tracking pass.  It computes where variables are stored
!      at each position in code.  Better debugging information is then
!      generated (if the debugging information format supports this
       information).
  
!      It is enabled by default when compiling with optimization ('-Os',
!      '-O', '-O2', ...), debugging information ('-g') and the debug info
       format supports it.
  
! '-fvar-tracking-assignments'
       Annotate assignments to user variables early in the compilation and
       attempt to carry the annotations over throughout the compilation
       all the way to the end, in an attempt to improve debug information
!      while optimizing.  Use of '-gdwarf-4' is recommended along with it.
  
       It can be enabled even if var-tracking is disabled, in which case
       annotations are created and maintained, but discarded at the end.
!      By default, this flag is enabled together with '-fvar-tracking',
       except when selective scheduling is enabled.
  
! '-fvar-tracking-assignments-toggle'
!      Toggle '-fvar-tracking-assignments', in the same way that
!      '-gtoggle' toggles '-g'.
  
! '-print-file-name=LIBRARY'
!      Print the full absolute name of the library file LIBRARY that would
!      be used when linking--and don't do anything else.  With this
       option, GCC does not compile or link anything; it just prints the
       file name.
  
! '-print-multi-directory'
       Print the directory name corresponding to the multilib selected by
       any other switches present in the command line.  This directory is
!      supposed to exist in 'GCC_EXEC_PREFIX'.
  
! '-print-multi-lib'
       Print the mapping from multilib directory names to compiler
       switches that enable them.  The directory name is separated from
!      the switches by ';', and each switch starts with an '@' instead of
!      the '-', without spaces between multiple switches.  This is
       supposed to ease shell processing.
  
! '-print-multi-os-directory'
       Print the path to OS libraries for the selected multilib, relative
!      to some 'lib' subdirectory.  If OS libraries are present in the
!      'lib' subdirectory and no multilibs are used, this is usually just
!      '.', if OS libraries are present in 'libSUFFIX' sibling directories
!      this prints e.g. '../lib64', '../lib' or '../lib32', or if OS
!      libraries are present in 'lib/SUBDIR' subdirectories it prints e.g.
!      'amd64', 'sparcv9' or 'ev6'.
  
! '-print-multiarch'
!      Print the path to OS libraries for the selected multiarch, relative
!      to some 'lib' subdirectory.
  
! '-print-prog-name=PROGRAM'
!      Like '-print-file-name', but searches for a program such as 'cpp'.
  
! '-print-libgcc-file-name'
!      Same as '-print-file-name=libgcc.a'.
  
!      This is useful when you use '-nostdlib' or '-nodefaultlibs' but you
!      do want to link with 'libgcc.a'.  You can do:
  
            gcc -nostdlib FILES... `gcc -print-libgcc-file-name`
  
! '-print-search-dirs'
       Print the name of the configured installation directory and a list
!      of program and library directories 'gcc' searches--and don't do
       anything else.
  
!      This is useful when 'gcc' prints the error message 'installation
       problem, cannot exec cpp0: No such file or directory'.  To resolve
!      this you either need to put 'cpp0' and the other compiler
!      components where 'gcc' expects to find them, or you can set the
!      environment variable 'GCC_EXEC_PREFIX' to the directory where you
!      installed them.  Don't forget the trailing '/'.  *Note Environment
       Variables::.
  
! '-print-sysroot'
!      Print the target sysroot directory that is used during compilation.
!      This is the target sysroot specified either at configure time or
!      using the '--sysroot' option, possibly with an extra suffix that
!      depends on compilation options.  If no target sysroot is specified,
!      the option prints nothing.
  
! '-print-sysroot-headers-suffix'
       Print the suffix added to the target sysroot when searching for
       headers, or give an error if the compiler is not configured with
       such a suffix--and don't do anything else.
  
! '-dumpmachine'
       Print the compiler's target machine (for example,
!      'i686-pc-linux-gnu')--and don't do anything else.
  
! '-dumpversion'
!      Print the compiler version (for example, '3.0')--and don't do
       anything else.
  
! '-dumpspecs'
       Print the compiler's built-in specs--and don't do anything else.
       (This is used when GCC itself is being built.)  *Note Spec Files::.
  
! '-fno-eliminate-unused-debug-types'
!      Normally, when producing DWARF 2 output, GCC avoids producing debug
!      symbol output for types that are nowhere used in the source file
!      being compiled.  Sometimes it is useful to have GCC emit debugging
!      information for all types declared in a compilation unit,
!      regardless of whether or not they are actually used in that
!      compilation unit, for example if, in the debugger, you want to cast
!      a value to a type that is not actually used in your program (but is
!      declared).  More often, however, this results in a significant
!      amount of wasted space.
  
  
  File: gcc.info,  Node: Optimize Options,  Next: Preprocessor Options,  Prev: Debugging Options,  Up: Invoking GCC
*************** between statements, you can then assign
*** 6746,6783 ****
  change the program counter to any other statement in the function and
  get exactly the results you expect from the source code.
  
!  Turning on optimization flags makes the compiler attempt to improve
! the performance and/or code size at the expense of compilation time and
  possibly the ability to debug the program.
  
   The compiler performs optimization based on the knowledge it has of the
  program.  Compiling multiple files at once to a single output file mode
! allows the compiler to use information gained from all of the files
! when compiling each of them.
  
   Not all optimizations are controlled directly by a flag.  Only
  optimizations that have a flag are listed in this section.
  
!  Most optimizations are only enabled if an `-O' level is set on the
  command line.  Otherwise they are disabled, even if individual
  optimization flags are specified.
  
   Depending on the target and how GCC was configured, a slightly
! different set of optimizations may be enabled at each `-O' level than
! those listed here.  You can invoke GCC with `-Q --help=optimizers' to
  find out the exact set of optimizations that are enabled at each level.
  *Note Overall Options::, for examples.
  
! `-O'
! `-O1'
       Optimize.  Optimizing compilation takes somewhat more time, and a
       lot more memory for a large function.
  
!      With `-O', the compiler tries to reduce code size and execution
       time, without performing any optimizations that take a great deal
       of compilation time.
  
!      `-O' turns on the following optimization flags:
            -fauto-inc-dec
            -fbranch-count-reg
            -fcombine-stack-adjustments
--- 6694,6731 ----
  change the program counter to any other statement in the function and
  get exactly the results you expect from the source code.
  
!  Turning on optimization flags makes the compiler attempt to improve the
! performance and/or code size at the expense of compilation time and
  possibly the ability to debug the program.
  
   The compiler performs optimization based on the knowledge it has of the
  program.  Compiling multiple files at once to a single output file mode
! allows the compiler to use information gained from all of the files when
! compiling each of them.
  
   Not all optimizations are controlled directly by a flag.  Only
  optimizations that have a flag are listed in this section.
  
!  Most optimizations are only enabled if an '-O' level is set on the
  command line.  Otherwise they are disabled, even if individual
  optimization flags are specified.
  
   Depending on the target and how GCC was configured, a slightly
! different set of optimizations may be enabled at each '-O' level than
! those listed here.  You can invoke GCC with '-Q --help=optimizers' to
  find out the exact set of optimizations that are enabled at each level.
  *Note Overall Options::, for examples.
  
! '-O'
! '-O1'
       Optimize.  Optimizing compilation takes somewhat more time, and a
       lot more memory for a large function.
  
!      With '-O', the compiler tries to reduce code size and execution
       time, without performing any optimizations that take a great deal
       of compilation time.
  
!      '-O' turns on the following optimization flags:
            -fauto-inc-dec
            -fbranch-count-reg
            -fcombine-stack-adjustments
*************** find out the exact set of optimizations
*** 6818,6833 ****
            -ftree-ter
            -funit-at-a-time
  
!      `-O' also turns on `-fomit-frame-pointer' on machines where doing
       so does not interfere with debugging.
  
! `-O2'
       Optimize even more.  GCC performs nearly all supported
       optimizations that do not involve a space-speed tradeoff.  As
!      compared to `-O', this option increases both compilation time and
       the performance of the generated code.
  
!      `-O2' turns on all optimization flags specified by `-O'.  It also
       turns on the following optimization flags:
            -fthread-jumps
            -falign-functions  -falign-jumps
--- 6766,6781 ----
            -ftree-ter
            -funit-at-a-time
  
!      '-O' also turns on '-fomit-frame-pointer' on machines where doing
       so does not interfere with debugging.
  
! '-O2'
       Optimize even more.  GCC performs nearly all supported
       optimizations that do not involve a space-speed tradeoff.  As
!      compared to '-O', this option increases both compilation time and
       the performance of the generated code.
  
!      '-O2' turns on all optimization flags specified by '-O'.  It also
       turns on the following optimization flags:
            -fthread-jumps
            -falign-functions  -falign-jumps
*************** find out the exact set of optimizations
*** 6863,7063 ****
            -ftree-vrp
            -fipa-ra
  
!      Please note the warning under `-fgcse' about invoking `-O2' on
       programs that use computed gotos.
  
! `-O3'
!      Optimize yet more.  `-O3' turns on all optimizations specified by
!      `-O2' and also turns on the `-finline-functions',
!      `-funswitch-loops', `-fpredictive-commoning',
!      `-fgcse-after-reload', `-ftree-loop-vectorize',
!      `-ftree-loop-distribute-patterns', `-ftree-slp-vectorize',
!      `-fvect-cost-model', `-ftree-partial-pre' and `-fipa-cp-clone'
       options.
  
! `-O0'
       Reduce compilation time and make debugging produce the expected
       results.  This is the default.
  
! `-Os'
!      Optimize for size.  `-Os' enables all `-O2' optimizations that do
       not typically increase code size.  It also performs further
       optimizations designed to reduce code size.
  
!      `-Os' disables the following optimization flags:
            -falign-functions  -falign-jumps  -falign-loops
            -falign-labels  -freorder-blocks  -freorder-blocks-and-partition
            -fprefetch-loop-arrays
  
! `-Ofast'
!      Disregard strict standards compliance.  `-Ofast' enables all `-O3'
       optimizations.  It also enables optimizations that are not valid
!      for all standard-compliant programs.  It turns on `-ffast-math'
!      and the Fortran-specific `-fno-protect-parens' and
!      `-fstack-arrays'.
  
! `-Og'
!      Optimize debugging experience.  `-Og' enables optimizations that
!      do not interfere with debugging. It should be the optimization
!      level of choice for the standard edit-compile-debug cycle, offering
!      a reasonable level of optimization while maintaining fast
!      compilation and a good debugging experience.
  
!      If you use multiple `-O' options, with or without level numbers,
       the last such option is the one that is effective.
  
!  Options of the form `-fFLAG' specify machine-independent flags.  Most
  flags have both positive and negative forms; the negative form of
! `-ffoo' is `-fno-foo'.  In the table below, only one of the forms is
! listed--the one you typically use.  You can figure out the other form
! by either removing `no-' or adding it.
  
   The following options control specific optimizations.  They are either
! activated by `-O' options or are related to ones that are.  You can use
  the following flags in the rare cases when "fine-tuning" of
  optimizations to be performed is desired.
  
! `-fno-defer-pop'
       Always pop the arguments to each function call as soon as that
       function returns.  For machines that must pop arguments after a
       function call, the compiler normally lets arguments accumulate on
       the stack for several function calls and pops them all at once.
  
!      Disabled at levels `-O', `-O2', `-O3', `-Os'.
  
! `-fforward-propagate'
       Perform a forward propagation pass on RTL.  The pass tries to
       combine two instructions and checks if the result can be
       simplified.  If loop unrolling is active, two passes are performed
       and the second is scheduled after loop unrolling.
  
!      This option is enabled by default at optimization levels `-O',
!      `-O2', `-O3', `-Os'.
  
! `-ffp-contract=STYLE'
!      `-ffp-contract=off' disables floating-point expression contraction.
!      `-ffp-contract=fast' enables floating-point expression contraction
       such as forming of fused multiply-add operations if the target has
!      native support for them.  `-ffp-contract=on' enables
!      floating-point expression contraction if allowed by the language
!      standard.  This is currently not implemented and treated equal to
!      `-ffp-contract=off'.
  
!      The default is `-ffp-contract=fast'.
  
! `-fomit-frame-pointer'
!      Don't keep the frame pointer in a register for functions that
!      don't need one.  This avoids the instructions to save, set up and
!      restore frame pointers; it also makes an extra register available
!      in many functions.  *It also makes debugging impossible on some
!      machines.*
  
       On some machines, such as the VAX, this flag has no effect, because
       the standard calling sequence automatically handles the frame
       pointer and nothing is saved by pretending it doesn't exist.  The
!      machine-description macro `FRAME_POINTER_REQUIRED' controls
!      whether a target machine supports this flag.  *Note Register
!      Usage: (gccint)Registers.
  
       The default setting (when not optimizing for size) for 32-bit
       GNU/Linux x86 and 32-bit Darwin x86 targets is
!      `-fomit-frame-pointer'.  You can configure GCC with the
!      `--enable-frame-pointer' configure option to change the default.
  
!      Enabled at levels `-O', `-O2', `-O3', `-Os'.
  
! `-foptimize-sibling-calls'
       Optimize sibling and tail recursive calls.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-foptimize-strlen'
!      Optimize various standard C string functions (e.g. `strlen',
!      `strchr' or `strcpy') and their `_FORTIFY_SOURCE' counterparts
!      into faster alternatives.
  
!      Enabled at levels `-O2', `-O3'.
  
! `-fno-inline'
!      Do not expand any functions inline apart from those marked with
!      the `always_inline' attribute.  This is the default when not
       optimizing.
  
!      Single functions can be exempted from inlining by marking them
!      with the `noinline' attribute.
  
! `-finline-small-functions'
       Integrate functions into their callers when their body is smaller
       than expected function call code (so overall size of program gets
       smaller).  The compiler heuristically decides which functions are
       simple enough to be worth integrating in this way.  This inlining
       applies to all functions, even those not declared inline.
  
!      Enabled at level `-O2'.
  
! `-findirect-inlining'
       Inline also indirect calls that are discovered to be known at
       compile time thanks to previous inlining.  This option has any
       effect only when inlining itself is turned on by the
!      `-finline-functions' or `-finline-small-functions' options.
  
!      Enabled at level `-O2'.
  
! `-finline-functions'
       Consider all functions for inlining, even if they are not declared
       inline.  The compiler heuristically decides which functions are
       worth integrating in this way.
  
       If all calls to a given function are integrated, and the function
!      is declared `static', then the function is normally not output as
       assembler code in its own right.
  
!      Enabled at level `-O3'.
  
! `-finline-functions-called-once'
!      Consider all `static' functions called once for inlining into their
!      caller even if they are not marked `inline'.  If a call to a given
       function is integrated, then the function is not output as
       assembler code in its own right.
  
!      Enabled at levels `-O1', `-O2', `-O3' and `-Os'.
  
! `-fearly-inlining'
!      Inline functions marked by `always_inline' and functions whose
!      body seems smaller than the function call overhead early before
!      doing `-fprofile-generate' instrumentation and real inlining pass.
!      Doing so makes profiling significantly cheaper and usually
!      inlining faster on programs having large chains of nested wrapper
!      functions.
  
       Enabled by default.
  
! `-fipa-sra'
       Perform interprocedural scalar replacement of aggregates, removal
       of unused parameters and replacement of parameters passed by
       reference by parameters passed by value.
  
!      Enabled at levels `-O2', `-O3' and `-Os'.
  
! `-finline-limit=N'
       By default, GCC limits the size of functions that can be inlined.
       This flag allows coarse control of this limit.  N is the size of
       functions that can be inlined in number of pseudo instructions.
  
       Inlining is actually controlled by a number of parameters, which
!      may be specified individually by using `--param NAME=VALUE'.  The
!      `-finline-limit=N' option sets some of these parameters as follows:
  
!     `max-inline-insns-single'
            is set to N/2.
! 
!     `max-inline-insns-auto'
            is set to N/2.
  
       See below for a documentation of the individual parameters
       controlling inlining and for the defaults of these parameters.
  
!      _Note:_ there may be no value to `-finline-limit' that results in
       default behavior.
  
       _Note:_ pseudo instruction represents, in this particular context,
--- 6811,7007 ----
            -ftree-vrp
            -fipa-ra
  
!      Please note the warning under '-fgcse' about invoking '-O2' on
       programs that use computed gotos.
  
! '-O3'
!      Optimize yet more.  '-O3' turns on all optimizations specified by
!      '-O2' and also turns on the '-finline-functions',
!      '-funswitch-loops', '-fpredictive-commoning',
!      '-fgcse-after-reload', '-ftree-loop-vectorize',
!      '-ftree-loop-distribute-patterns', '-ftree-slp-vectorize',
!      '-fvect-cost-model', '-ftree-partial-pre' and '-fipa-cp-clone'
       options.
  
! '-O0'
       Reduce compilation time and make debugging produce the expected
       results.  This is the default.
  
! '-Os'
!      Optimize for size.  '-Os' enables all '-O2' optimizations that do
       not typically increase code size.  It also performs further
       optimizations designed to reduce code size.
  
!      '-Os' disables the following optimization flags:
            -falign-functions  -falign-jumps  -falign-loops
            -falign-labels  -freorder-blocks  -freorder-blocks-and-partition
            -fprefetch-loop-arrays
  
! '-Ofast'
!      Disregard strict standards compliance.  '-Ofast' enables all '-O3'
       optimizations.  It also enables optimizations that are not valid
!      for all standard-compliant programs.  It turns on '-ffast-math' and
!      the Fortran-specific '-fno-protect-parens' and '-fstack-arrays'.
  
! '-Og'
!      Optimize debugging experience.  '-Og' enables optimizations that do
!      not interfere with debugging.  It should be the optimization level
!      of choice for the standard edit-compile-debug cycle, offering a
!      reasonable level of optimization while maintaining fast compilation
!      and a good debugging experience.
  
!      If you use multiple '-O' options, with or without level numbers,
       the last such option is the one that is effective.
  
!  Options of the form '-fFLAG' specify machine-independent flags.  Most
  flags have both positive and negative forms; the negative form of
! '-ffoo' is '-fno-foo'.  In the table below, only one of the forms is
! listed--the one you typically use.  You can figure out the other form by
! either removing 'no-' or adding it.
  
   The following options control specific optimizations.  They are either
! activated by '-O' options or are related to ones that are.  You can use
  the following flags in the rare cases when "fine-tuning" of
  optimizations to be performed is desired.
  
! '-fno-defer-pop'
       Always pop the arguments to each function call as soon as that
       function returns.  For machines that must pop arguments after a
       function call, the compiler normally lets arguments accumulate on
       the stack for several function calls and pops them all at once.
  
!      Disabled at levels '-O', '-O2', '-O3', '-Os'.
  
! '-fforward-propagate'
       Perform a forward propagation pass on RTL.  The pass tries to
       combine two instructions and checks if the result can be
       simplified.  If loop unrolling is active, two passes are performed
       and the second is scheduled after loop unrolling.
  
!      This option is enabled by default at optimization levels '-O',
!      '-O2', '-O3', '-Os'.
  
! '-ffp-contract=STYLE'
!      '-ffp-contract=off' disables floating-point expression contraction.
!      '-ffp-contract=fast' enables floating-point expression contraction
       such as forming of fused multiply-add operations if the target has
!      native support for them.  '-ffp-contract=on' enables floating-point
!      expression contraction if allowed by the language standard.  This
!      is currently not implemented and treated equal to
!      '-ffp-contract=off'.
  
!      The default is '-ffp-contract=fast'.
  
! '-fomit-frame-pointer'
!      Don't keep the frame pointer in a register for functions that don't
!      need one.  This avoids the instructions to save, set up and restore
!      frame pointers; it also makes an extra register available in many
!      functions.  *It also makes debugging impossible on some machines.*
  
       On some machines, such as the VAX, this flag has no effect, because
       the standard calling sequence automatically handles the frame
       pointer and nothing is saved by pretending it doesn't exist.  The
!      machine-description macro 'FRAME_POINTER_REQUIRED' controls whether
!      a target machine supports this flag.  *Note Register Usage:
!      (gccint)Registers.
  
       The default setting (when not optimizing for size) for 32-bit
       GNU/Linux x86 and 32-bit Darwin x86 targets is
!      '-fomit-frame-pointer'.  You can configure GCC with the
!      '--enable-frame-pointer' configure option to change the default.
  
!      Enabled at levels '-O', '-O2', '-O3', '-Os'.
  
! '-foptimize-sibling-calls'
       Optimize sibling and tail recursive calls.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-foptimize-strlen'
!      Optimize various standard C string functions (e.g.  'strlen',
!      'strchr' or 'strcpy') and their '_FORTIFY_SOURCE' counterparts into
!      faster alternatives.
  
!      Enabled at levels '-O2', '-O3'.
  
! '-fno-inline'
!      Do not expand any functions inline apart from those marked with the
!      'always_inline' attribute.  This is the default when not
       optimizing.
  
!      Single functions can be exempted from inlining by marking them with
!      the 'noinline' attribute.
  
! '-finline-small-functions'
       Integrate functions into their callers when their body is smaller
       than expected function call code (so overall size of program gets
       smaller).  The compiler heuristically decides which functions are
       simple enough to be worth integrating in this way.  This inlining
       applies to all functions, even those not declared inline.
  
!      Enabled at level '-O2'.
  
! '-findirect-inlining'
       Inline also indirect calls that are discovered to be known at
       compile time thanks to previous inlining.  This option has any
       effect only when inlining itself is turned on by the
!      '-finline-functions' or '-finline-small-functions' options.
  
!      Enabled at level '-O2'.
  
! '-finline-functions'
       Consider all functions for inlining, even if they are not declared
       inline.  The compiler heuristically decides which functions are
       worth integrating in this way.
  
       If all calls to a given function are integrated, and the function
!      is declared 'static', then the function is normally not output as
       assembler code in its own right.
  
!      Enabled at level '-O3'.
  
! '-finline-functions-called-once'
!      Consider all 'static' functions called once for inlining into their
!      caller even if they are not marked 'inline'.  If a call to a given
       function is integrated, then the function is not output as
       assembler code in its own right.
  
!      Enabled at levels '-O1', '-O2', '-O3' and '-Os'.
  
! '-fearly-inlining'
!      Inline functions marked by 'always_inline' and functions whose body
!      seems smaller than the function call overhead early before doing
!      '-fprofile-generate' instrumentation and real inlining pass.  Doing
!      so makes profiling significantly cheaper and usually inlining
!      faster on programs having large chains of nested wrapper functions.
  
       Enabled by default.
  
! '-fipa-sra'
       Perform interprocedural scalar replacement of aggregates, removal
       of unused parameters and replacement of parameters passed by
       reference by parameters passed by value.
  
!      Enabled at levels '-O2', '-O3' and '-Os'.
  
! '-finline-limit=N'
       By default, GCC limits the size of functions that can be inlined.
       This flag allows coarse control of this limit.  N is the size of
       functions that can be inlined in number of pseudo instructions.
  
       Inlining is actually controlled by a number of parameters, which
!      may be specified individually by using '--param NAME=VALUE'.  The
!      '-finline-limit=N' option sets some of these parameters as follows:
  
!      'max-inline-insns-single'
            is set to N/2.
!      'max-inline-insns-auto'
            is set to N/2.
  
       See below for a documentation of the individual parameters
       controlling inlining and for the defaults of these parameters.
  
!      _Note:_ there may be no value to '-finline-limit' that results in
       default behavior.
  
       _Note:_ pseudo instruction represents, in this particular context,
*************** optimizations to be performed is desired
*** 7065,7126 ****
       represent a count of assembly instructions and as such its exact
       meaning might change from one release to an another.
  
! `-fno-keep-inline-dllexport'
!      This is a more fine-grained version of `-fkeep-inline-functions',
       which applies only to functions that are declared using the
!      `dllexport' attribute or declspec (*Note Declaring Attributes of
       Functions: Function Attributes.)
  
! `-fkeep-inline-functions'
!      In C, emit `static' functions that are declared `inline' into the
       object file, even if the function has been inlined into all of its
!      callers.  This switch does not affect functions using the `extern
       inline' extension in GNU C90.  In C++, emit any and all inline
       functions into the object file.
  
! `-fkeep-static-consts'
!      Emit variables declared `static const' when optimization isn't
       turned on, even if the variables aren't referenced.
  
       GCC enables this option by default.  If you want to force the
       compiler to check if a variable is referenced, regardless of
       whether or not optimization is turned on, use the
!      `-fno-keep-static-consts' option.
  
! `-fmerge-constants'
       Attempt to merge identical constants (string constants and
       floating-point constants) across compilation units.
  
       This option is the default for optimized compilation if the
!      assembler and linker support it.  Use `-fno-merge-constants' to
       inhibit this behavior.
  
!      Enabled at levels `-O', `-O2', `-O3', `-Os'.
  
! `-fmerge-all-constants'
       Attempt to merge identical constants and identical variables.
  
!      This option implies `-fmerge-constants'.  In addition to
!      `-fmerge-constants' this considers e.g. even constant initialized
       arrays or initialized constant variables with integral or
       floating-point types.  Languages like C or C++ require each
       variable, including multiple instances of the same variable in
       recursive calls, to have distinct locations, so using this option
       results in non-conforming behavior.
  
! `-fmodulo-sched'
       Perform swing modulo scheduling immediately before the first
       scheduling pass.  This pass looks at innermost loops and reorders
       their instructions by overlapping different iterations.
  
! `-fmodulo-sched-allow-regmoves'
       Perform more aggressive SMS-based modulo scheduling with register
!      moves allowed.  By setting this flag certain anti-dependences
!      edges are deleted, which triggers the generation of reg-moves
!      based on the life-range analysis.  This option is effective only
!      with `-fmodulo-sched' enabled.
  
! `-fno-branch-count-reg'
       Do not use "decrement and branch" instructions on a count register,
       but instead generate a sequence of instructions that decrement a
       register, compare it against zero, then branch based upon the
--- 7009,7070 ----
       represent a count of assembly instructions and as such its exact
       meaning might change from one release to an another.
  
! '-fno-keep-inline-dllexport'
!      This is a more fine-grained version of '-fkeep-inline-functions',
       which applies only to functions that are declared using the
!      'dllexport' attribute or declspec (*Note Declaring Attributes of
       Functions: Function Attributes.)
  
! '-fkeep-inline-functions'
!      In C, emit 'static' functions that are declared 'inline' into the
       object file, even if the function has been inlined into all of its
!      callers.  This switch does not affect functions using the 'extern
       inline' extension in GNU C90.  In C++, emit any and all inline
       functions into the object file.
  
! '-fkeep-static-consts'
!      Emit variables declared 'static const' when optimization isn't
       turned on, even if the variables aren't referenced.
  
       GCC enables this option by default.  If you want to force the
       compiler to check if a variable is referenced, regardless of
       whether or not optimization is turned on, use the
!      '-fno-keep-static-consts' option.
  
! '-fmerge-constants'
       Attempt to merge identical constants (string constants and
       floating-point constants) across compilation units.
  
       This option is the default for optimized compilation if the
!      assembler and linker support it.  Use '-fno-merge-constants' to
       inhibit this behavior.
  
!      Enabled at levels '-O', '-O2', '-O3', '-Os'.
  
! '-fmerge-all-constants'
       Attempt to merge identical constants and identical variables.
  
!      This option implies '-fmerge-constants'.  In addition to
!      '-fmerge-constants' this considers e.g. even constant initialized
       arrays or initialized constant variables with integral or
       floating-point types.  Languages like C or C++ require each
       variable, including multiple instances of the same variable in
       recursive calls, to have distinct locations, so using this option
       results in non-conforming behavior.
  
! '-fmodulo-sched'
       Perform swing modulo scheduling immediately before the first
       scheduling pass.  This pass looks at innermost loops and reorders
       their instructions by overlapping different iterations.
  
! '-fmodulo-sched-allow-regmoves'
       Perform more aggressive SMS-based modulo scheduling with register
!      moves allowed.  By setting this flag certain anti-dependences edges
!      are deleted, which triggers the generation of reg-moves based on
!      the life-range analysis.  This option is effective only with
!      '-fmodulo-sched' enabled.
  
! '-fno-branch-count-reg'
       Do not use "decrement and branch" instructions on a count register,
       but instead generate a sequence of instructions that decrement a
       register, compare it against zero, then branch based upon the
*************** optimizations to be performed is desired
*** 7128,7138 ****
       support such instructions, which include x86, PowerPC, IA-64 and
       S/390.
  
!      Enabled by default at `-O1' and higher.
  
!      The default is `-fbranch-count-reg'.
  
! `-fno-function-cse'
       Do not put function addresses in registers; make each instruction
       that calls a constant function contain the function's address
       explicitly.
--- 7072,7082 ----
       support such instructions, which include x86, PowerPC, IA-64 and
       S/390.
  
!      Enabled by default at '-O1' and higher.
  
!      The default is '-fbranch-count-reg'.
  
! '-fno-function-cse'
       Do not put function addresses in registers; make each instruction
       that calls a constant function contain the function's address
       explicitly.
*************** optimizations to be performed is desired
*** 7141,7295 ****
       that alter the assembler output may be confused by the
       optimizations performed when this option is not used.
  
!      The default is `-ffunction-cse'
  
! `-fno-zero-initialized-in-bss'
!      If the target supports a BSS section, GCC by default puts
!      variables that are initialized to zero into BSS.  This can save
!      space in the resulting code.
  
       This option turns off this behavior because some programs
       explicitly rely on variables going to the data section--e.g., so
       that the resulting executable can find the beginning of that
       section and/or make assumptions based on that.
  
!      The default is `-fzero-initialized-in-bss'.
  
! `-fthread-jumps'
       Perform optimizations that check to see if a jump branches to a
       location where another comparison subsumed by the first is found.
       If so, the first branch is redirected to either the destination of
!      the second branch or a point immediately following it, depending
!      on whether the condition is known to be true or false.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fsplit-wide-types'
!      When using a type that occupies multiple registers, such as `long
       long' on a 32-bit system, split the registers apart and allocate
       them independently.  This normally generates better code for those
       types, but may make debugging more difficult.
  
!      Enabled at levels `-O', `-O2', `-O3', `-Os'.
  
! `-fcse-follow-jumps'
       In common subexpression elimination (CSE), scan through jump
       instructions when the target of the jump is not reached by any
!      other path.  For example, when CSE encounters an `if' statement
!      with an `else' clause, CSE follows the jump when the condition
       tested is false.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fcse-skip-blocks'
!      This is similar to `-fcse-follow-jumps', but causes CSE to follow
       jumps that conditionally skip over blocks.  When CSE encounters a
!      simple `if' statement with no else clause, `-fcse-skip-blocks'
!      causes CSE to follow the jump around the body of the `if'.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-frerun-cse-after-loop'
       Re-run common subexpression elimination after loop optimizations
       are performed.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fgcse'
       Perform a global common subexpression elimination pass.  This pass
       also performs global constant and copy propagation.
  
       _Note:_ When compiling a program using computed gotos, a GCC
       extension, you may get better run-time performance if you disable
       the global common subexpression elimination pass by adding
!      `-fno-gcse' to the command line.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fgcse-lm'
!      When `-fgcse-lm' is enabled, global common subexpression
       elimination attempts to move loads that are only killed by stores
       into themselves.  This allows a loop containing a load/store
!      sequence to be changed to a load outside the loop, and a
!      copy/store within the loop.
  
!      Enabled by default when `-fgcse' is enabled.
  
! `-fgcse-sm'
!      When `-fgcse-sm' is enabled, a store motion pass is run after
       global common subexpression elimination.  This pass attempts to
       move stores out of loops.  When used in conjunction with
!      `-fgcse-lm', loops containing a load/store sequence can be changed
       to a load before the loop and a store after the loop.
  
       Not enabled at any optimization level.
  
! `-fgcse-las'
!      When `-fgcse-las' is enabled, the global common subexpression
       elimination pass eliminates redundant loads that come after stores
       to the same memory location (both partial and full redundancies).
  
       Not enabled at any optimization level.
  
! `-fgcse-after-reload'
!      When `-fgcse-after-reload' is enabled, a redundant load elimination
       pass is performed after reload.  The purpose of this pass is to
       clean up redundant spilling.
  
! `-faggressive-loop-optimizations'
       This option tells the loop optimizer to use language constraints to
!      derive bounds for the number of iterations of a loop.  This
!      assumes that loop code does not invoke undefined behavior by for
!      example causing signed integer overflows or out-of-bound array
!      accesses.  The bounds for the number of iterations of a loop are
!      used to guide loop unrolling and peeling and loop exit test
!      optimizations.  This option is enabled by default.
  
! `-funsafe-loop-optimizations'
!      This option tells the loop optimizer to assume that loop indices
!      do not overflow, and that loops with nontrivial exit condition are
!      not infinite.  This enables a wider range of loop optimizations
!      even if the loop optimizer itself cannot prove that these
!      assumptions are valid.  If you use `-Wunsafe-loop-optimizations',
!      the compiler warns you if it finds this kind of loop.
  
! `-fcrossjumping'
       Perform cross-jumping transformation.  This transformation unifies
!      equivalent code and saves code size.  The resulting code may or
!      may not perform better than without cross-jumping.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fauto-inc-dec'
       Combine increments or decrements of addresses with memory accesses.
       This pass is always skipped on architectures that do not have
!      instructions to support this.  Enabled by default at `-O' and
       higher on architectures that support this.
  
! `-fdce'
       Perform dead code elimination (DCE) on RTL.  Enabled by default at
!      `-O' and higher.
  
! `-fdse'
!      Perform dead store elimination (DSE) on RTL.  Enabled by default
!      at `-O' and higher.
  
! `-fif-conversion'
       Attempt to transform conditional jumps into branch-less
!      equivalents.  This includes use of conditional moves, min, max,
!      set flags and abs instructions, and some tricks doable by standard
!      arithmetics.  The use of conditional execution on chips where it
!      is available is controlled by `-fif-conversion2'.
  
!      Enabled at levels `-O', `-O2', `-O3', `-Os'.
  
! `-fif-conversion2'
       Use conditional execution (where available) to transform
       conditional jumps into branch-less equivalents.
  
!      Enabled at levels `-O', `-O2', `-O3', `-Os'.
  
! `-fdeclone-ctor-dtor'
       The C++ ABI requires multiple entry points for constructors and
       destructors: one for a base subobject, one for a complete object,
       and one for a virtual destructor that calls operator delete
--- 7085,7239 ----
       that alter the assembler output may be confused by the
       optimizations performed when this option is not used.
  
!      The default is '-ffunction-cse'
  
! '-fno-zero-initialized-in-bss'
!      If the target supports a BSS section, GCC by default puts variables
!      that are initialized to zero into BSS.  This can save space in the
!      resulting code.
  
       This option turns off this behavior because some programs
       explicitly rely on variables going to the data section--e.g., so
       that the resulting executable can find the beginning of that
       section and/or make assumptions based on that.
  
!      The default is '-fzero-initialized-in-bss'.
  
! '-fthread-jumps'
       Perform optimizations that check to see if a jump branches to a
       location where another comparison subsumed by the first is found.
       If so, the first branch is redirected to either the destination of
!      the second branch or a point immediately following it, depending on
!      whether the condition is known to be true or false.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fsplit-wide-types'
!      When using a type that occupies multiple registers, such as 'long
       long' on a 32-bit system, split the registers apart and allocate
       them independently.  This normally generates better code for those
       types, but may make debugging more difficult.
  
!      Enabled at levels '-O', '-O2', '-O3', '-Os'.
  
! '-fcse-follow-jumps'
       In common subexpression elimination (CSE), scan through jump
       instructions when the target of the jump is not reached by any
!      other path.  For example, when CSE encounters an 'if' statement
!      with an 'else' clause, CSE follows the jump when the condition
       tested is false.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fcse-skip-blocks'
!      This is similar to '-fcse-follow-jumps', but causes CSE to follow
       jumps that conditionally skip over blocks.  When CSE encounters a
!      simple 'if' statement with no else clause, '-fcse-skip-blocks'
!      causes CSE to follow the jump around the body of the 'if'.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-frerun-cse-after-loop'
       Re-run common subexpression elimination after loop optimizations
       are performed.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fgcse'
       Perform a global common subexpression elimination pass.  This pass
       also performs global constant and copy propagation.
  
       _Note:_ When compiling a program using computed gotos, a GCC
       extension, you may get better run-time performance if you disable
       the global common subexpression elimination pass by adding
!      '-fno-gcse' to the command line.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fgcse-lm'
!      When '-fgcse-lm' is enabled, global common subexpression
       elimination attempts to move loads that are only killed by stores
       into themselves.  This allows a loop containing a load/store
!      sequence to be changed to a load outside the loop, and a copy/store
!      within the loop.
  
!      Enabled by default when '-fgcse' is enabled.
  
! '-fgcse-sm'
!      When '-fgcse-sm' is enabled, a store motion pass is run after
       global common subexpression elimination.  This pass attempts to
       move stores out of loops.  When used in conjunction with
!      '-fgcse-lm', loops containing a load/store sequence can be changed
       to a load before the loop and a store after the loop.
  
       Not enabled at any optimization level.
  
! '-fgcse-las'
!      When '-fgcse-las' is enabled, the global common subexpression
       elimination pass eliminates redundant loads that come after stores
       to the same memory location (both partial and full redundancies).
  
       Not enabled at any optimization level.
  
! '-fgcse-after-reload'
!      When '-fgcse-after-reload' is enabled, a redundant load elimination
       pass is performed after reload.  The purpose of this pass is to
       clean up redundant spilling.
  
! '-faggressive-loop-optimizations'
       This option tells the loop optimizer to use language constraints to
!      derive bounds for the number of iterations of a loop.  This assumes
!      that loop code does not invoke undefined behavior by for example
!      causing signed integer overflows or out-of-bound array accesses.
!      The bounds for the number of iterations of a loop are used to guide
!      loop unrolling and peeling and loop exit test optimizations.  This
!      option is enabled by default.
  
! '-funsafe-loop-optimizations'
!      This option tells the loop optimizer to assume that loop indices do
!      not overflow, and that loops with nontrivial exit condition are not
!      infinite.  This enables a wider range of loop optimizations even if
!      the loop optimizer itself cannot prove that these assumptions are
!      valid.  If you use '-Wunsafe-loop-optimizations', the compiler
!      warns you if it finds this kind of loop.
  
! '-fcrossjumping'
       Perform cross-jumping transformation.  This transformation unifies
!      equivalent code and saves code size.  The resulting code may or may
!      not perform better than without cross-jumping.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fauto-inc-dec'
       Combine increments or decrements of addresses with memory accesses.
       This pass is always skipped on architectures that do not have
!      instructions to support this.  Enabled by default at '-O' and
       higher on architectures that support this.
  
! '-fdce'
       Perform dead code elimination (DCE) on RTL.  Enabled by default at
!      '-O' and higher.
  
! '-fdse'
!      Perform dead store elimination (DSE) on RTL.  Enabled by default at
!      '-O' and higher.
  
! '-fif-conversion'
       Attempt to transform conditional jumps into branch-less
!      equivalents.  This includes use of conditional moves, min, max, set
!      flags and abs instructions, and some tricks doable by standard
!      arithmetics.  The use of conditional execution on chips where it is
!      available is controlled by '-fif-conversion2'.
  
!      Enabled at levels '-O', '-O2', '-O3', '-Os'.
  
! '-fif-conversion2'
       Use conditional execution (where available) to transform
       conditional jumps into branch-less equivalents.
  
!      Enabled at levels '-O', '-O2', '-O3', '-Os'.
  
! '-fdeclone-ctor-dtor'
       The C++ ABI requires multiple entry points for constructors and
       destructors: one for a base subobject, one for a complete object,
       and one for a virtual destructor that calls operator delete
*************** optimizations to be performed is desired
*** 7298,7738 ****
       function.  With this option, the base and complete variants are
       changed to be thunks that call a common implementation.
  
!      Enabled by `-Os'.
  
! `-fdelete-null-pointer-checks'
       Assume that programs cannot safely dereference null pointers, and
       that no code or data element resides there.  This enables simple
       constant folding optimizations at all optimization levels.  In
!      addition, other optimization passes in GCC use this flag to
!      control global dataflow analyses that eliminate useless checks for
!      null pointers; these assume that if a pointer is checked after it
!      has already been dereferenced, it cannot be null.
  
       Note however that in some environments this assumption is not true.
!      Use `-fno-delete-null-pointer-checks' to disable this optimization
       for programs that depend on that behavior.
  
       Some targets, especially embedded ones, disable this option at all
!      levels.  Otherwise it is enabled at all levels: `-O0', `-O1',
!      `-O2', `-O3', `-Os'.  Passes that use the information are enabled
       independently at different optimization levels.
  
! `-fdevirtualize'
       Attempt to convert calls to virtual functions to direct calls.
       This is done both within a procedure and interprocedurally as part
!      of indirect inlining (`-findirect-inlining') and interprocedural
!      constant propagation (`-fipa-cp').  Enabled at levels `-O2',
!      `-O3', `-Os'.
  
! `-fdevirtualize-speculatively'
!      Attempt to convert calls to virtual functions to speculative
!      direct calls.  Based on the analysis of the type inheritance
!      graph, determine for a given call the set of likely targets. If
!      the set is small, preferably of size 1, change the call into a
!      conditional deciding between direct and indirect calls.  The
!      speculative calls enable more optimizations, such as inlining.
!      When they seem useless after further optimization, they are
!      converted back into original form.
  
! `-fdevirtualize-at-ltrans'
       Stream extra information needed for aggressive devirtualization
       when running the link-time optimizer in local transformation mode.
       This option enables more devirtualization but significantly
!      increases the size of streamed data. For this reason it is
       disabled by default.
  
! `-fexpensive-optimizations'
       Perform a number of minor optimizations that are relatively
       expensive.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-free'
       Attempt to remove redundant extension instructions.  This is
       especially helpful for the x86-64 architecture, which implicitly
       zero-extends in 64-bit registers after writing to their lower
       32-bit half.
  
!      Enabled for Alpha, AArch64 and x86 at levels `-O2', `-O3', `-Os'.
  
! `-fno-lifetime-dse'
       In C++ the value of an object is only affected by changes within
       its lifetime: when the constructor begins, the object has an
       indeterminate value, and any changes during the lifetime of the
       object are dead when the object is destroyed.  Normally dead store
!      elimination will take advantage of this; if your code relies on
!      the value of the object storage persisting beyond the lifetime of
!      the object, you can use this flag to disable this optimization.
  
! `-flive-range-shrinkage'
       Attempt to decrease register pressure through register live range
       shrinkage.  This is helpful for fast processors with small or
       moderate size register sets.
  
! `-fira-algorithm=ALGORITHM'
       Use the specified coloring algorithm for the integrated register
!      allocator.  The ALGORITHM argument can be `priority', which
!      specifies Chow's priority coloring, or `CB', which specifies
       Chaitin-Briggs coloring.  Chaitin-Briggs coloring is not
       implemented for all architectures, but for those targets that do
       support it, it is the default because it generates better code.
  
! `-fira-region=REGION'
       Use specified regions for the integrated register allocator.  The
       REGION argument should be one of the following:
  
!     `all'
            Use all loops as register allocation regions.  This can give
            the best results for machines with a small and/or irregular
            register set.
  
!     `mixed'
!           Use all loops except for loops with small register pressure
!           as the regions.  This value usually gives the best results in
            most cases and for most architectures, and is enabled by
!           default when compiling with optimization for speed (`-O',
!           `-O2', ...).
  
!     `one'
            Use all functions as a single region.  This typically results
!           in the smallest code size, and is enabled by default for
!           `-Os' or `-O0'.
! 
  
! `-fira-hoist-pressure'
       Use IRA to evaluate register pressure in the code hoisting pass for
       decisions to hoist expressions.  This option usually results in
       smaller code, but it can slow the compiler down.
  
!      This option is enabled at level `-Os' for all targets.
  
! `-fira-loop-pressure'
       Use IRA to evaluate register pressure in loops for decisions to
!      move loop invariants.  This option usually results in generation
!      of faster and smaller code on machines with large register files
!      (>= 32 registers), but it can slow the compiler down.
  
!      This option is enabled at level `-O3' for some targets.
  
! `-fno-ira-share-save-slots'
       Disable sharing of stack slots used for saving call-used hard
       registers living through a call.  Each hard register gets a
       separate stack slot, and as a result function stack frames are
       larger.
  
! `-fno-ira-share-spill-slots'
       Disable sharing of stack slots allocated for pseudo-registers.
       Each pseudo-register that does not get a hard register gets a
       separate stack slot, and as a result function stack frames are
       larger.
  
! `-fira-verbose=N'
       Control the verbosity of the dump file for the integrated register
       allocator.  The default value is 5.  If the value N is greater or
       equal to 10, the dump output is sent to stderr using the same
       format as N minus 10.
  
! `-flra-remat'
!      Enable CFG-sensitive rematerialization in LRA.  Instead of loading
       values of spilled pseudos, LRA tries to rematerialize (recalculate)
       values if it is profitable.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fdelayed-branch'
       If supported for the target machine, attempt to reorder
       instructions to exploit instruction slots available after delayed
       branch instructions.
  
!      Enabled at levels `-O', `-O2', `-O3', `-Os'.
  
! `-fschedule-insns'
       If supported for the target machine, attempt to reorder
       instructions to eliminate execution stalls due to required data
       being unavailable.  This helps machines that have slow floating
!      point or memory load instructions by allowing other instructions
!      to be issued until the result of the load or floating-point
       instruction is required.
  
!      Enabled at levels `-O2', `-O3'.
  
! `-fschedule-insns2'
!      Similar to `-fschedule-insns', but requests an additional pass of
       instruction scheduling after register allocation has been done.
       This is especially useful on machines with a relatively small
       number of registers and where memory load instructions take more
       than one cycle.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fno-sched-interblock'
       Don't schedule instructions across basic blocks.  This is normally
       enabled by default when scheduling before register allocation, i.e.
!      with `-fschedule-insns' or at `-O2' or higher.
  
! `-fno-sched-spec'
       Don't allow speculative motion of non-load instructions.  This is
       normally enabled by default when scheduling before register
!      allocation, i.e.  with `-fschedule-insns' or at `-O2' or higher.
  
! `-fsched-pressure'
       Enable register pressure sensitive insn scheduling before register
       allocation.  This only makes sense when scheduling before register
!      allocation is enabled, i.e. with `-fschedule-insns' or at `-O2' or
       higher.  Usage of this option can improve the generated code and
       decrease its size by preventing register pressure increase above
       the number of available hard registers and subsequent spills in
       register allocation.
  
! `-fsched-spec-load'
       Allow speculative motion of some load instructions.  This only
       makes sense when scheduling before register allocation, i.e. with
!      `-fschedule-insns' or at `-O2' or higher.
  
! `-fsched-spec-load-dangerous'
       Allow speculative motion of more load instructions.  This only
       makes sense when scheduling before register allocation, i.e. with
!      `-fschedule-insns' or at `-O2' or higher.
  
! `-fsched-stalled-insns'
! `-fsched-stalled-insns=N'
       Define how many insns (if any) can be moved prematurely from the
       queue of stalled insns into the ready list during the second
!      scheduling pass.  `-fno-sched-stalled-insns' means that no insns
!      are moved prematurely, `-fsched-stalled-insns=0' means there is no
       limit on how many queued insns can be moved prematurely.
!      `-fsched-stalled-insns' without a value is equivalent to
!      `-fsched-stalled-insns=1'.
  
! `-fsched-stalled-insns-dep'
! `-fsched-stalled-insns-dep=N'
       Define how many insn groups (cycles) are examined for a dependency
       on a stalled insn that is a candidate for premature removal from
       the queue of stalled insns.  This has an effect only during the
!      second scheduling pass, and only if `-fsched-stalled-insns' is
!      used.  `-fno-sched-stalled-insns-dep' is equivalent to
!      `-fsched-stalled-insns-dep=0'.  `-fsched-stalled-insns-dep'
!      without a value is equivalent to `-fsched-stalled-insns-dep=1'.
  
! `-fsched2-use-superblocks'
       When scheduling after register allocation, use superblock
       scheduling.  This allows motion across basic block boundaries,
!      resulting in faster schedules.  This option is experimental, as
!      not all machine descriptions used by GCC model the CPU closely
!      enough to avoid unreliable results from the algorithm.
  
       This only makes sense when scheduling after register allocation,
!      i.e. with `-fschedule-insns2' or at `-O2' or higher.
  
! `-fsched-group-heuristic'
       Enable the group heuristic in the scheduler.  This heuristic favors
       the instruction that belongs to a schedule group.  This is enabled
!      by default when scheduling is enabled, i.e. with `-fschedule-insns'
!      or `-fschedule-insns2' or at `-O2' or higher.
  
! `-fsched-critical-path-heuristic'
       Enable the critical-path heuristic in the scheduler.  This
       heuristic favors instructions on the critical path.  This is
       enabled by default when scheduling is enabled, i.e. with
!      `-fschedule-insns' or `-fschedule-insns2' or at `-O2' or higher.
  
! `-fsched-spec-insn-heuristic'
       Enable the speculative instruction heuristic in the scheduler.
       This heuristic favors speculative instructions with greater
!      dependency weakness.  This is enabled by default when scheduling
!      is enabled, i.e.  with `-fschedule-insns' or `-fschedule-insns2'
!      or at `-O2' or higher.
  
! `-fsched-rank-heuristic'
       Enable the rank heuristic in the scheduler.  This heuristic favors
       the instruction belonging to a basic block with greater size or
       frequency.  This is enabled by default when scheduling is enabled,
!      i.e.  with `-fschedule-insns' or `-fschedule-insns2' or at `-O2'
!      or higher.
  
! `-fsched-last-insn-heuristic'
       Enable the last-instruction heuristic in the scheduler.  This
!      heuristic favors the instruction that is less dependent on the
!      last instruction scheduled.  This is enabled by default when
!      scheduling is enabled, i.e. with `-fschedule-insns' or
!      `-fschedule-insns2' or at `-O2' or higher.
  
! `-fsched-dep-count-heuristic'
       Enable the dependent-count heuristic in the scheduler.  This
       heuristic favors the instruction that has more instructions
       depending on it.  This is enabled by default when scheduling is
!      enabled, i.e.  with `-fschedule-insns' or `-fschedule-insns2' or
!      at `-O2' or higher.
  
! `-freschedule-modulo-scheduled-loops'
!      Modulo scheduling is performed before traditional scheduling.  If
!      a loop is modulo scheduled, later scheduling passes may change its
       schedule.  Use this option to control that behavior.
  
! `-fselective-scheduling'
       Schedule instructions using selective scheduling algorithm.
       Selective scheduling runs instead of the first scheduler pass.
  
! `-fselective-scheduling2'
       Schedule instructions using selective scheduling algorithm.
       Selective scheduling runs instead of the second scheduler pass.
  
! `-fsel-sched-pipelining'
       Enable software pipelining of innermost loops during selective
       scheduling.  This option has no effect unless one of
!      `-fselective-scheduling' or `-fselective-scheduling2' is turned on.
  
! `-fsel-sched-pipelining-outer-loops'
       When pipelining loops during selective scheduling, also pipeline
       outer loops.  This option has no effect unless
!      `-fsel-sched-pipelining' is turned on.
  
! `-fsemantic-interposition'
       Some object formats, like ELF, allow interposing of symbols by the
!      dynamic linker.  This means that for symbols exported from the
!      DSO, the compiler cannot perform interprocedural propagation,
!      inlining and other optimizations in anticipation that the function
!      or variable in question may change. While this feature is useful,
!      for example, to rewrite memory allocation functions by a debugging
!      implementation, it is expensive in the terms of code quality.
!      With `-fno-semantic-interposition' the compiler assumes that if
       interposition happens for functions the overwriting function will
!      have precisely the same semantics (and side effects).  Similarly
!      if interposition happens for variables, the constructor of the
!      variable will be the same. The flag has no effect for functions
       explicitly declared inline (where it is never allowed for
       interposition to change semantics) and for symbols explicitly
       declared weak.
  
! `-fshrink-wrap'
!      Emit function prologues only before parts of the function that
!      need it, rather than at the top of the function.  This flag is
!      enabled by default at `-O' and higher.
  
! `-fcaller-saves'
       Enable allocation of values to registers that are clobbered by
       function calls, by emitting extra instructions to save and restore
!      the registers around such calls.  Such allocation is done only
!      when it seems to result in better code.
  
       This option is always enabled by default on certain machines,
       usually those which have no call-preserved registers to use
       instead.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fcombine-stack-adjustments'
       Tracks stack adjustments (pushes and pops) and stack memory
       references and then tries to find ways to combine them.
  
!      Enabled by default at `-O1' and higher.
  
! `-fipa-ra'
!      Use caller save registers for allocation if those registers are
!      not used by any called function.  In that case it is not necessary
!      to save and restore them around calls.  This is only possible if
       called functions are part of same compilation unit as current
       function and they are compiled before it.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fconserve-stack'
       Attempt to minimize stack usage.  The compiler attempts to use less
       stack space, even if that makes the program slower.  This option
!      implies setting the `large-stack-frame' parameter to 100 and the
!      `large-stack-frame-growth' parameter to 400.
  
! `-ftree-reassoc'
!      Perform reassociation on trees.  This flag is enabled by default
!      at `-O' and higher.
  
! `-ftree-pre'
       Perform partial redundancy elimination (PRE) on trees.  This flag
!      is enabled by default at `-O2' and `-O3'.
  
! `-ftree-partial-pre'
       Make partial redundancy elimination (PRE) more aggressive.  This
!      flag is enabled by default at `-O3'.
  
! `-ftree-forwprop'
       Perform forward propagation on trees.  This flag is enabled by
!      default at `-O' and higher.
  
! `-ftree-fre'
       Perform full redundancy elimination (FRE) on trees.  The difference
!      between FRE and PRE is that FRE only considers expressions that
!      are computed on all paths leading to the redundant computation.
!      This analysis is faster than PRE, though it exposes fewer
!      redundancies.  This flag is enabled by default at `-O' and higher.
  
! `-ftree-phiprop'
       Perform hoisting of loads from conditional pointers on trees.  This
!      pass is enabled by default at `-O' and higher.
  
! `-fhoist-adjacent-loads'
       Speculatively hoist loads from both branches of an if-then-else if
!      the loads are from adjacent locations in the same structure and
!      the target architecture has a conditional move instruction.  This
!      flag is enabled by default at `-O2' and higher.
  
! `-ftree-copy-prop'
       Perform copy propagation on trees.  This pass eliminates
       unnecessary copy operations.  This flag is enabled by default at
!      `-O' and higher.
  
! `-fipa-pure-const'
       Discover which functions are pure or constant.  Enabled by default
!      at `-O' and higher.
  
! `-fipa-reference'
       Discover which static variables do not escape the compilation unit.
!      Enabled by default at `-O' and higher.
  
! `-fipa-pta'
       Perform interprocedural pointer analysis and interprocedural
       modification and reference analysis.  This option can cause
!      excessive memory and compile-time usage on large compilation
!      units.  It is not enabled by default at any optimization level.
  
! `-fipa-profile'
       Perform interprocedural profile propagation.  The functions called
!      only from cold functions are marked as cold. Also functions
!      executed once (such as `cold', `noreturn', static constructors or
!      destructors) are identified. Cold functions and loop less parts of
       functions executed once are then optimized for size.  Enabled by
!      default at `-O' and higher.
  
! `-fipa-cp'
       Perform interprocedural constant propagation.  This optimization
       analyzes the program to determine when values passed to functions
       are constants and then optimizes accordingly.  This optimization
       can substantially increase performance if the application has
       constants passed to functions.  This flag is enabled by default at
!      `-O2', `-Os' and `-O3'.
  
! `-fipa-cp-clone'
       Perform function cloning to make interprocedural constant
       propagation stronger.  When enabled, interprocedural constant
       propagation performs function cloning when externally visible
       function can be called with constant arguments.  Because this
       optimization can create multiple copies of functions, it may
!      significantly increase code size (see `--param
       ipcp-unit-growth=VALUE').  This flag is enabled by default at
!      `-O3'.
  
! `-fipa-cp-alignment'
       When enabled, this optimization propagates alignment of function
       parameters to support better vectorization and string operations.
  
!      This flag is enabled by default at `-O2' and `-Os'.  It requires
!      that `-fipa-cp' is enabled.
  
! `-fipa-icf'
       Perform Identical Code Folding for functions and read-only
       variables.  The optimization reduces code size and may disturb
       unwind stacks by replacing a function by equivalent one with a
!      different name. The optimization works more effectively with link
       time optimization enabled.
  
       Nevertheless the behavior is similar to Gold Linker ICF
--- 7242,7681 ----
       function.  With this option, the base and complete variants are
       changed to be thunks that call a common implementation.
  
!      Enabled by '-Os'.
  
! '-fdelete-null-pointer-checks'
       Assume that programs cannot safely dereference null pointers, and
       that no code or data element resides there.  This enables simple
       constant folding optimizations at all optimization levels.  In
!      addition, other optimization passes in GCC use this flag to control
!      global dataflow analyses that eliminate useless checks for null
!      pointers; these assume that if a pointer is checked after it has
!      already been dereferenced, it cannot be null.
  
       Note however that in some environments this assumption is not true.
!      Use '-fno-delete-null-pointer-checks' to disable this optimization
       for programs that depend on that behavior.
  
       Some targets, especially embedded ones, disable this option at all
!      levels.  Otherwise it is enabled at all levels: '-O0', '-O1',
!      '-O2', '-O3', '-Os'.  Passes that use the information are enabled
       independently at different optimization levels.
  
! '-fdevirtualize'
       Attempt to convert calls to virtual functions to direct calls.
       This is done both within a procedure and interprocedurally as part
!      of indirect inlining ('-findirect-inlining') and interprocedural
!      constant propagation ('-fipa-cp').  Enabled at levels '-O2', '-O3',
!      '-Os'.
  
! '-fdevirtualize-speculatively'
!      Attempt to convert calls to virtual functions to speculative direct
!      calls.  Based on the analysis of the type inheritance graph,
!      determine for a given call the set of likely targets.  If the set
!      is small, preferably of size 1, change the call into a conditional
!      deciding between direct and indirect calls.  The speculative calls
!      enable more optimizations, such as inlining.  When they seem
!      useless after further optimization, they are converted back into
!      original form.
  
! '-fdevirtualize-at-ltrans'
       Stream extra information needed for aggressive devirtualization
       when running the link-time optimizer in local transformation mode.
       This option enables more devirtualization but significantly
!      increases the size of streamed data.  For this reason it is
       disabled by default.
  
! '-fexpensive-optimizations'
       Perform a number of minor optimizations that are relatively
       expensive.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-free'
       Attempt to remove redundant extension instructions.  This is
       especially helpful for the x86-64 architecture, which implicitly
       zero-extends in 64-bit registers after writing to their lower
       32-bit half.
  
!      Enabled for Alpha, AArch64 and x86 at levels '-O2', '-O3', '-Os'.
  
! '-fno-lifetime-dse'
       In C++ the value of an object is only affected by changes within
       its lifetime: when the constructor begins, the object has an
       indeterminate value, and any changes during the lifetime of the
       object are dead when the object is destroyed.  Normally dead store
!      elimination will take advantage of this; if your code relies on the
!      value of the object storage persisting beyond the lifetime of the
!      object, you can use this flag to disable this optimization.
  
! '-flive-range-shrinkage'
       Attempt to decrease register pressure through register live range
       shrinkage.  This is helpful for fast processors with small or
       moderate size register sets.
  
! '-fira-algorithm=ALGORITHM'
       Use the specified coloring algorithm for the integrated register
!      allocator.  The ALGORITHM argument can be 'priority', which
!      specifies Chow's priority coloring, or 'CB', which specifies
       Chaitin-Briggs coloring.  Chaitin-Briggs coloring is not
       implemented for all architectures, but for those targets that do
       support it, it is the default because it generates better code.
  
! '-fira-region=REGION'
       Use specified regions for the integrated register allocator.  The
       REGION argument should be one of the following:
  
!      'all'
            Use all loops as register allocation regions.  This can give
            the best results for machines with a small and/or irregular
            register set.
  
!      'mixed'
!           Use all loops except for loops with small register pressure as
!           the regions.  This value usually gives the best results in
            most cases and for most architectures, and is enabled by
!           default when compiling with optimization for speed ('-O',
!           '-O2', ...).
  
!      'one'
            Use all functions as a single region.  This typically results
!           in the smallest code size, and is enabled by default for '-Os'
!           or '-O0'.
  
! '-fira-hoist-pressure'
       Use IRA to evaluate register pressure in the code hoisting pass for
       decisions to hoist expressions.  This option usually results in
       smaller code, but it can slow the compiler down.
  
!      This option is enabled at level '-Os' for all targets.
  
! '-fira-loop-pressure'
       Use IRA to evaluate register pressure in loops for decisions to
!      move loop invariants.  This option usually results in generation of
!      faster and smaller code on machines with large register files (>=
!      32 registers), but it can slow the compiler down.
  
!      This option is enabled at level '-O3' for some targets.
  
! '-fno-ira-share-save-slots'
       Disable sharing of stack slots used for saving call-used hard
       registers living through a call.  Each hard register gets a
       separate stack slot, and as a result function stack frames are
       larger.
  
! '-fno-ira-share-spill-slots'
       Disable sharing of stack slots allocated for pseudo-registers.
       Each pseudo-register that does not get a hard register gets a
       separate stack slot, and as a result function stack frames are
       larger.
  
! '-fira-verbose=N'
       Control the verbosity of the dump file for the integrated register
       allocator.  The default value is 5.  If the value N is greater or
       equal to 10, the dump output is sent to stderr using the same
       format as N minus 10.
  
! '-flra-remat'
!      Enable CFG-sensitive rematerialization in LRA. Instead of loading
       values of spilled pseudos, LRA tries to rematerialize (recalculate)
       values if it is profitable.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fdelayed-branch'
       If supported for the target machine, attempt to reorder
       instructions to exploit instruction slots available after delayed
       branch instructions.
  
!      Enabled at levels '-O', '-O2', '-O3', '-Os'.
  
! '-fschedule-insns'
       If supported for the target machine, attempt to reorder
       instructions to eliminate execution stalls due to required data
       being unavailable.  This helps machines that have slow floating
!      point or memory load instructions by allowing other instructions to
!      be issued until the result of the load or floating-point
       instruction is required.
  
!      Enabled at levels '-O2', '-O3'.
  
! '-fschedule-insns2'
!      Similar to '-fschedule-insns', but requests an additional pass of
       instruction scheduling after register allocation has been done.
       This is especially useful on machines with a relatively small
       number of registers and where memory load instructions take more
       than one cycle.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fno-sched-interblock'
       Don't schedule instructions across basic blocks.  This is normally
       enabled by default when scheduling before register allocation, i.e.
!      with '-fschedule-insns' or at '-O2' or higher.
  
! '-fno-sched-spec'
       Don't allow speculative motion of non-load instructions.  This is
       normally enabled by default when scheduling before register
!      allocation, i.e. with '-fschedule-insns' or at '-O2' or higher.
  
! '-fsched-pressure'
       Enable register pressure sensitive insn scheduling before register
       allocation.  This only makes sense when scheduling before register
!      allocation is enabled, i.e. with '-fschedule-insns' or at '-O2' or
       higher.  Usage of this option can improve the generated code and
       decrease its size by preventing register pressure increase above
       the number of available hard registers and subsequent spills in
       register allocation.
  
! '-fsched-spec-load'
       Allow speculative motion of some load instructions.  This only
       makes sense when scheduling before register allocation, i.e. with
!      '-fschedule-insns' or at '-O2' or higher.
  
! '-fsched-spec-load-dangerous'
       Allow speculative motion of more load instructions.  This only
       makes sense when scheduling before register allocation, i.e. with
!      '-fschedule-insns' or at '-O2' or higher.
  
! '-fsched-stalled-insns'
! '-fsched-stalled-insns=N'
       Define how many insns (if any) can be moved prematurely from the
       queue of stalled insns into the ready list during the second
!      scheduling pass.  '-fno-sched-stalled-insns' means that no insns
!      are moved prematurely, '-fsched-stalled-insns=0' means there is no
       limit on how many queued insns can be moved prematurely.
!      '-fsched-stalled-insns' without a value is equivalent to
!      '-fsched-stalled-insns=1'.
  
! '-fsched-stalled-insns-dep'
! '-fsched-stalled-insns-dep=N'
       Define how many insn groups (cycles) are examined for a dependency
       on a stalled insn that is a candidate for premature removal from
       the queue of stalled insns.  This has an effect only during the
!      second scheduling pass, and only if '-fsched-stalled-insns' is
!      used.  '-fno-sched-stalled-insns-dep' is equivalent to
!      '-fsched-stalled-insns-dep=0'.  '-fsched-stalled-insns-dep' without
!      a value is equivalent to '-fsched-stalled-insns-dep=1'.
  
! '-fsched2-use-superblocks'
       When scheduling after register allocation, use superblock
       scheduling.  This allows motion across basic block boundaries,
!      resulting in faster schedules.  This option is experimental, as not
!      all machine descriptions used by GCC model the CPU closely enough
!      to avoid unreliable results from the algorithm.
  
       This only makes sense when scheduling after register allocation,
!      i.e. with '-fschedule-insns2' or at '-O2' or higher.
  
! '-fsched-group-heuristic'
       Enable the group heuristic in the scheduler.  This heuristic favors
       the instruction that belongs to a schedule group.  This is enabled
!      by default when scheduling is enabled, i.e. with '-fschedule-insns'
!      or '-fschedule-insns2' or at '-O2' or higher.
  
! '-fsched-critical-path-heuristic'
       Enable the critical-path heuristic in the scheduler.  This
       heuristic favors instructions on the critical path.  This is
       enabled by default when scheduling is enabled, i.e. with
!      '-fschedule-insns' or '-fschedule-insns2' or at '-O2' or higher.
  
! '-fsched-spec-insn-heuristic'
       Enable the speculative instruction heuristic in the scheduler.
       This heuristic favors speculative instructions with greater
!      dependency weakness.  This is enabled by default when scheduling is
!      enabled, i.e. with '-fschedule-insns' or '-fschedule-insns2' or at
!      '-O2' or higher.
  
! '-fsched-rank-heuristic'
       Enable the rank heuristic in the scheduler.  This heuristic favors
       the instruction belonging to a basic block with greater size or
       frequency.  This is enabled by default when scheduling is enabled,
!      i.e. with '-fschedule-insns' or '-fschedule-insns2' or at '-O2' or
!      higher.
  
! '-fsched-last-insn-heuristic'
       Enable the last-instruction heuristic in the scheduler.  This
!      heuristic favors the instruction that is less dependent on the last
!      instruction scheduled.  This is enabled by default when scheduling
!      is enabled, i.e. with '-fschedule-insns' or '-fschedule-insns2' or
!      at '-O2' or higher.
  
! '-fsched-dep-count-heuristic'
       Enable the dependent-count heuristic in the scheduler.  This
       heuristic favors the instruction that has more instructions
       depending on it.  This is enabled by default when scheduling is
!      enabled, i.e. with '-fschedule-insns' or '-fschedule-insns2' or at
!      '-O2' or higher.
  
! '-freschedule-modulo-scheduled-loops'
!      Modulo scheduling is performed before traditional scheduling.  If a
!      loop is modulo scheduled, later scheduling passes may change its
       schedule.  Use this option to control that behavior.
  
! '-fselective-scheduling'
       Schedule instructions using selective scheduling algorithm.
       Selective scheduling runs instead of the first scheduler pass.
  
! '-fselective-scheduling2'
       Schedule instructions using selective scheduling algorithm.
       Selective scheduling runs instead of the second scheduler pass.
  
! '-fsel-sched-pipelining'
       Enable software pipelining of innermost loops during selective
       scheduling.  This option has no effect unless one of
!      '-fselective-scheduling' or '-fselective-scheduling2' is turned on.
  
! '-fsel-sched-pipelining-outer-loops'
       When pipelining loops during selective scheduling, also pipeline
       outer loops.  This option has no effect unless
!      '-fsel-sched-pipelining' is turned on.
  
! '-fsemantic-interposition'
       Some object formats, like ELF, allow interposing of symbols by the
!      dynamic linker.  This means that for symbols exported from the DSO,
!      the compiler cannot perform interprocedural propagation, inlining
!      and other optimizations in anticipation that the function or
!      variable in question may change.  While this feature is useful, for
!      example, to rewrite memory allocation functions by a debugging
!      implementation, it is expensive in the terms of code quality.  With
!      '-fno-semantic-interposition' the compiler assumes that if
       interposition happens for functions the overwriting function will
!      have precisely the same semantics (and side effects).  Similarly if
!      interposition happens for variables, the constructor of the
!      variable will be the same.  The flag has no effect for functions
       explicitly declared inline (where it is never allowed for
       interposition to change semantics) and for symbols explicitly
       declared weak.
  
! '-fshrink-wrap'
!      Emit function prologues only before parts of the function that need
!      it, rather than at the top of the function.  This flag is enabled
!      by default at '-O' and higher.
  
! '-fcaller-saves'
       Enable allocation of values to registers that are clobbered by
       function calls, by emitting extra instructions to save and restore
!      the registers around such calls.  Such allocation is done only when
!      it seems to result in better code.
  
       This option is always enabled by default on certain machines,
       usually those which have no call-preserved registers to use
       instead.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fcombine-stack-adjustments'
       Tracks stack adjustments (pushes and pops) and stack memory
       references and then tries to find ways to combine them.
  
!      Enabled by default at '-O1' and higher.
  
! '-fipa-ra'
!      Use caller save registers for allocation if those registers are not
!      used by any called function.  In that case it is not necessary to
!      save and restore them around calls.  This is only possible if
       called functions are part of same compilation unit as current
       function and they are compiled before it.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fconserve-stack'
       Attempt to minimize stack usage.  The compiler attempts to use less
       stack space, even if that makes the program slower.  This option
!      implies setting the 'large-stack-frame' parameter to 100 and the
!      'large-stack-frame-growth' parameter to 400.
  
! '-ftree-reassoc'
!      Perform reassociation on trees.  This flag is enabled by default at
!      '-O' and higher.
  
! '-ftree-pre'
       Perform partial redundancy elimination (PRE) on trees.  This flag
!      is enabled by default at '-O2' and '-O3'.
  
! '-ftree-partial-pre'
       Make partial redundancy elimination (PRE) more aggressive.  This
!      flag is enabled by default at '-O3'.
  
! '-ftree-forwprop'
       Perform forward propagation on trees.  This flag is enabled by
!      default at '-O' and higher.
  
! '-ftree-fre'
       Perform full redundancy elimination (FRE) on trees.  The difference
!      between FRE and PRE is that FRE only considers expressions that are
!      computed on all paths leading to the redundant computation.  This
!      analysis is faster than PRE, though it exposes fewer redundancies.
!      This flag is enabled by default at '-O' and higher.
  
! '-ftree-phiprop'
       Perform hoisting of loads from conditional pointers on trees.  This
!      pass is enabled by default at '-O' and higher.
  
! '-fhoist-adjacent-loads'
       Speculatively hoist loads from both branches of an if-then-else if
!      the loads are from adjacent locations in the same structure and the
!      target architecture has a conditional move instruction.  This flag
!      is enabled by default at '-O2' and higher.
  
! '-ftree-copy-prop'
       Perform copy propagation on trees.  This pass eliminates
       unnecessary copy operations.  This flag is enabled by default at
!      '-O' and higher.
  
! '-fipa-pure-const'
       Discover which functions are pure or constant.  Enabled by default
!      at '-O' and higher.
  
! '-fipa-reference'
       Discover which static variables do not escape the compilation unit.
!      Enabled by default at '-O' and higher.
  
! '-fipa-pta'
       Perform interprocedural pointer analysis and interprocedural
       modification and reference analysis.  This option can cause
!      excessive memory and compile-time usage on large compilation units.
!      It is not enabled by default at any optimization level.
  
! '-fipa-profile'
       Perform interprocedural profile propagation.  The functions called
!      only from cold functions are marked as cold.  Also functions
!      executed once (such as 'cold', 'noreturn', static constructors or
!      destructors) are identified.  Cold functions and loop less parts of
       functions executed once are then optimized for size.  Enabled by
!      default at '-O' and higher.
  
! '-fipa-cp'
       Perform interprocedural constant propagation.  This optimization
       analyzes the program to determine when values passed to functions
       are constants and then optimizes accordingly.  This optimization
       can substantially increase performance if the application has
       constants passed to functions.  This flag is enabled by default at
!      '-O2', '-Os' and '-O3'.
  
! '-fipa-cp-clone'
       Perform function cloning to make interprocedural constant
       propagation stronger.  When enabled, interprocedural constant
       propagation performs function cloning when externally visible
       function can be called with constant arguments.  Because this
       optimization can create multiple copies of functions, it may
!      significantly increase code size (see '--param
       ipcp-unit-growth=VALUE').  This flag is enabled by default at
!      '-O3'.
  
! '-fipa-cp-alignment'
       When enabled, this optimization propagates alignment of function
       parameters to support better vectorization and string operations.
  
!      This flag is enabled by default at '-O2' and '-Os'.  It requires
!      that '-fipa-cp' is enabled.
  
! '-fipa-icf'
       Perform Identical Code Folding for functions and read-only
       variables.  The optimization reduces code size and may disturb
       unwind stacks by replacing a function by equivalent one with a
!      different name.  The optimization works more effectively with link
       time optimization enabled.
  
       Nevertheless the behavior is similar to Gold Linker ICF
*************** optimizations to be performed is desired
*** 7740,7836 ****
       optimizations are not same - there are equivalences that are found
       only by GCC and equivalences found only by Gold.
  
!      This flag is enabled by default at `-O2' and `-Os'.
  
! `-fisolate-erroneous-paths-dereference'
       Detect paths that trigger erroneous or undefined behavior due to
       dereferencing a null pointer.  Isolate those paths from the main
       control flow and turn the statement with erroneous or undefined
!      behavior into a trap.  This flag is enabled by default at `-O2'
!      and higher.
  
! `-fisolate-erroneous-paths-attribute'
       Detect paths that trigger erroneous or undefined behavior due a
!      null value being used in a way forbidden by a `returns_nonnull' or
!      `nonnull' attribute.  Isolate those paths from the main control
       flow and turn the statement with erroneous or undefined behavior
       into a trap.  This is not currently enabled, but may be enabled by
!      `-O2' in the future.
  
! `-ftree-sink'
!      Perform forward store motion  on trees.  This flag is enabled by
!      default at `-O' and higher.
  
! `-ftree-bit-ccp'
       Perform sparse conditional bit constant propagation on trees and
       propagate pointer alignment information.  This pass only operates
!      on local scalar variables and is enabled by default at `-O' and
!      higher.  It requires that `-ftree-ccp' is enabled.
  
! `-ftree-ccp'
       Perform sparse conditional constant propagation (CCP) on trees.
!      This pass only operates on local scalar variables and is enabled
!      by default at `-O' and higher.
  
! `-fssa-phiopt'
       Perform pattern matching on SSA PHI nodes to optimize conditional
!      code.  This pass is enabled by default at `-O' and higher.
  
! `-ftree-switch-conversion'
       Perform conversion of simple initializations in a switch to
       initializations from a scalar array.  This flag is enabled by
!      default at `-O2' and higher.
  
! `-ftree-tail-merge'
       Look for identical code sequences.  When found, replace one with a
       jump to the other.  This optimization is known as tail merging or
!      cross jumping.  This flag is enabled by default at `-O2' and
       higher.  The compilation time in this pass can be limited using
!      `max-tail-merge-comparisons' parameter and
!      `max-tail-merge-iterations' parameter.
  
! `-ftree-dce'
!      Perform dead code elimination (DCE) on trees.  This flag is
!      enabled by default at `-O' and higher.
  
! `-ftree-builtin-call-dce'
       Perform conditional dead code elimination (DCE) for calls to
!      built-in functions that may set `errno' but are otherwise
!      side-effect free.  This flag is enabled by default at `-O2' and
!      higher if `-Os' is not also specified.
  
! `-ftree-dominator-opts'
       Perform a variety of simple scalar cleanups (constant/copy
       propagation, redundancy elimination, range propagation and
       expression simplification) based on a dominator tree traversal.
!      This also performs jump threading (to reduce jumps to jumps). This
!      flag is enabled by default at `-O' and higher.
  
! `-ftree-dse'
       Perform dead store elimination (DSE) on trees.  A dead store is a
       store into a memory location that is later overwritten by another
       store without any intervening loads.  In this case the earlier
!      store can be deleted.  This flag is enabled by default at `-O' and
       higher.
  
! `-ftree-ch'
       Perform loop header copying on trees.  This is beneficial since it
       increases effectiveness of code motion optimizations.  It also
!      saves one jump.  This flag is enabled by default at `-O' and
!      higher.  It is not enabled for `-Os', since it usually increases
       code size.
  
! `-ftree-loop-optimize'
       Perform loop optimizations on trees.  This flag is enabled by
!      default at `-O' and higher.
  
! `-ftree-loop-linear'
       Perform loop interchange transformations on tree.  Same as
!      `-floop-interchange'.  To use this code transformation, GCC has to
!      be configured with `--with-isl' to enable the Graphite loop
       transformation infrastructure.
  
! `-floop-interchange'
       Perform loop interchange transformations on loops.  Interchanging
       two nested loops switches the inner and outer loops.  For example,
       given a loop like:
--- 7683,7779 ----
       optimizations are not same - there are equivalences that are found
       only by GCC and equivalences found only by Gold.
  
!      This flag is enabled by default at '-O2' and '-Os'.
  
! '-fisolate-erroneous-paths-dereference'
       Detect paths that trigger erroneous or undefined behavior due to
       dereferencing a null pointer.  Isolate those paths from the main
       control flow and turn the statement with erroneous or undefined
!      behavior into a trap.  This flag is enabled by default at '-O2' and
!      higher.
  
! '-fisolate-erroneous-paths-attribute'
       Detect paths that trigger erroneous or undefined behavior due a
!      null value being used in a way forbidden by a 'returns_nonnull' or
!      'nonnull' attribute.  Isolate those paths from the main control
       flow and turn the statement with erroneous or undefined behavior
       into a trap.  This is not currently enabled, but may be enabled by
!      '-O2' in the future.
  
! '-ftree-sink'
!      Perform forward store motion on trees.  This flag is enabled by
!      default at '-O' and higher.
  
! '-ftree-bit-ccp'
       Perform sparse conditional bit constant propagation on trees and
       propagate pointer alignment information.  This pass only operates
!      on local scalar variables and is enabled by default at '-O' and
!      higher.  It requires that '-ftree-ccp' is enabled.
  
! '-ftree-ccp'
       Perform sparse conditional constant propagation (CCP) on trees.
!      This pass only operates on local scalar variables and is enabled by
!      default at '-O' and higher.
  
! '-fssa-phiopt'
       Perform pattern matching on SSA PHI nodes to optimize conditional
!      code.  This pass is enabled by default at '-O' and higher.
  
! '-ftree-switch-conversion'
       Perform conversion of simple initializations in a switch to
       initializations from a scalar array.  This flag is enabled by
!      default at '-O2' and higher.
  
! '-ftree-tail-merge'
       Look for identical code sequences.  When found, replace one with a
       jump to the other.  This optimization is known as tail merging or
!      cross jumping.  This flag is enabled by default at '-O2' and
       higher.  The compilation time in this pass can be limited using
!      'max-tail-merge-comparisons' parameter and
!      'max-tail-merge-iterations' parameter.
  
! '-ftree-dce'
!      Perform dead code elimination (DCE) on trees.  This flag is enabled
!      by default at '-O' and higher.
  
! '-ftree-builtin-call-dce'
       Perform conditional dead code elimination (DCE) for calls to
!      built-in functions that may set 'errno' but are otherwise
!      side-effect free.  This flag is enabled by default at '-O2' and
!      higher if '-Os' is not also specified.
  
! '-ftree-dominator-opts'
       Perform a variety of simple scalar cleanups (constant/copy
       propagation, redundancy elimination, range propagation and
       expression simplification) based on a dominator tree traversal.
!      This also performs jump threading (to reduce jumps to jumps).  This
!      flag is enabled by default at '-O' and higher.
  
! '-ftree-dse'
       Perform dead store elimination (DSE) on trees.  A dead store is a
       store into a memory location that is later overwritten by another
       store without any intervening loads.  In this case the earlier
!      store can be deleted.  This flag is enabled by default at '-O' and
       higher.
  
! '-ftree-ch'
       Perform loop header copying on trees.  This is beneficial since it
       increases effectiveness of code motion optimizations.  It also
!      saves one jump.  This flag is enabled by default at '-O' and
!      higher.  It is not enabled for '-Os', since it usually increases
       code size.
  
! '-ftree-loop-optimize'
       Perform loop optimizations on trees.  This flag is enabled by
!      default at '-O' and higher.
  
! '-ftree-loop-linear'
       Perform loop interchange transformations on tree.  Same as
!      '-floop-interchange'.  To use this code transformation, GCC has to
!      be configured with '--with-isl' to enable the Graphite loop
       transformation infrastructure.
  
! '-floop-interchange'
       Perform loop interchange transformations on loops.  Interchanging
       two nested loops switches the inner and outer loops.  For example,
       given a loop like:
*************** optimizations to be performed is desired
*** 7845,7865 ****
                A(J, I) = A(J, I) * C
              ENDDO
            ENDDO
!      which can be beneficial when `N' is larger than the caches,
!      because in Fortran, the elements of an array are stored in memory
       contiguously by column, and the original loop iterates over rows,
       potentially creating at each access a cache miss.  This
       optimization applies to all the languages supported by GCC and is
       not limited to Fortran.  To use this code transformation, GCC has
!      to be configured with `--with-isl' to enable the Graphite loop
       transformation infrastructure.
  
! `-floop-strip-mine'
       Perform loop strip mining transformations on loops.  Strip mining
       splits a loop into two nested loops.  The outer loop has strides
       equal to the strip size and the inner loop has strides of the
       original loop within a strip.  The strip length can be changed
!      using the `loop-block-tile-size' parameter.  For example, given a
       loop like:
            DO I = 1, N
              A(I) = A(I) + C
--- 7788,7808 ----
                A(J, I) = A(J, I) * C
              ENDDO
            ENDDO
!      which can be beneficial when 'N' is larger than the caches, because
!      in Fortran, the elements of an array are stored in memory
       contiguously by column, and the original loop iterates over rows,
       potentially creating at each access a cache miss.  This
       optimization applies to all the languages supported by GCC and is
       not limited to Fortran.  To use this code transformation, GCC has
!      to be configured with '--with-isl' to enable the Graphite loop
       transformation infrastructure.
  
! '-floop-strip-mine'
       Perform loop strip mining transformations on loops.  Strip mining
       splits a loop into two nested loops.  The outer loop has strides
       equal to the strip size and the inner loop has strides of the
       original loop within a strip.  The strip length can be changed
!      using the 'loop-block-tile-size' parameter.  For example, given a
       loop like:
            DO I = 1, N
              A(I) = A(I) + C
*************** optimizations to be performed is desired
*** 7870,7885 ****
                A(I) = A(I) + C
              ENDDO
            ENDDO
!      This optimization applies to all the languages supported by GCC
!      and is not limited to Fortran.  To use this code transformation,
!      GCC has to be configured with `--with-isl' to enable the Graphite
!      loop transformation infrastructure.
  
! `-floop-block'
       Perform loop blocking transformations on loops.  Blocking strip
       mines each loop in the loop nest such that the memory accesses of
       the element loops fit inside caches.  The strip length can be
!      changed using the `loop-block-tile-size' parameter.  For example,
       given a loop like:
            DO I = 1, N
              DO J = 1, M
--- 7813,7828 ----
                A(I) = A(I) + C
              ENDDO
            ENDDO
!      This optimization applies to all the languages supported by GCC and
!      is not limited to Fortran.  To use this code transformation, GCC
!      has to be configured with '--with-isl' to enable the Graphite loop
!      transformation infrastructure.
  
! '-floop-block'
       Perform loop blocking transformations on loops.  Blocking strip
       mines each loop in the loop nest such that the memory accesses of
       the element loops fit inside caches.  The strip length can be
!      changed using the 'loop-block-tile-size' parameter.  For example,
       given a loop like:
            DO I = 1, N
              DO J = 1, M
*************** optimizations to be performed is desired
*** 7896,7948 ****
                ENDDO
              ENDDO
            ENDDO
!      which can be beneficial when `M' is larger than the caches,
!      because the innermost loop iterates over a smaller amount of data
!      which can be kept in the caches.  This optimization applies to all
!      the languages supported by GCC and is not limited to Fortran.  To
!      use this code transformation, GCC has to be configured with
!      `--with-isl' to enable the Graphite loop transformation
       infrastructure.
  
! `-fgraphite-identity'
!      Enable the identity transformation for graphite.  For every SCoP
!      we generate the polyhedral representation and transform it back to
!      gimple.  Using `-fgraphite-identity' we can check the costs or
       benefits of the GIMPLE -> GRAPHITE -> GIMPLE transformation.  Some
!      minimal optimizations are also performed by the code generator
!      ISL, like index splitting and dead code elimination in loops.
  
! `-floop-nest-optimize'
       Enable the ISL based loop nest optimizer.  This is a generic loop
       nest optimizer based on the Pluto optimization algorithms.  It
       calculates a loop structure optimized for data-locality and
       parallelism.  This option is experimental.
  
! `-floop-unroll-and-jam'
       Enable unroll and jam for the ISL based loop nest optimizer.  The
!      unroll factor can be changed using the `loop-unroll-jam-size'
       parameter.  The unrolled dimension (counting from the most inner
!      one) can be changed using the `loop-unroll-jam-depth' parameter.
!                   .
  
! `-floop-parallelize-all'
       Use the Graphite data dependence analysis to identify loops that
       can be parallelized.  Parallelize all the loops that can be
       analyzed to not contain loop carried dependences without checking
       that it is profitable to parallelize the loops.
  
! `-fcheck-data-deps'
       Compare the results of several data dependence analyzers.  This
       option is used for debugging the data dependence analyzers.
  
! `-ftree-loop-if-convert'
       Attempt to transform conditional jumps in the innermost loops to
       branch-less equivalents.  The intent is to remove control-flow from
       the innermost loops in order to improve the ability of the
       vectorization pass to handle these loops.  This is enabled by
       default if vectorization is enabled.
  
! `-ftree-loop-if-convert-stores'
       Attempt to also if-convert conditional jumps containing memory
       writes.  This transformation can be unsafe for multi-threaded
       programs as it transforms conditional memory writes into
--- 7839,7890 ----
                ENDDO
              ENDDO
            ENDDO
!      which can be beneficial when 'M' is larger than the caches, because
!      the innermost loop iterates over a smaller amount of data which can
!      be kept in the caches.  This optimization applies to all the
!      languages supported by GCC and is not limited to Fortran.  To use
!      this code transformation, GCC has to be configured with
!      '--with-isl' to enable the Graphite loop transformation
       infrastructure.
  
! '-fgraphite-identity'
!      Enable the identity transformation for graphite.  For every SCoP we
!      generate the polyhedral representation and transform it back to
!      gimple.  Using '-fgraphite-identity' we can check the costs or
       benefits of the GIMPLE -> GRAPHITE -> GIMPLE transformation.  Some
!      minimal optimizations are also performed by the code generator ISL,
!      like index splitting and dead code elimination in loops.
  
! '-floop-nest-optimize'
       Enable the ISL based loop nest optimizer.  This is a generic loop
       nest optimizer based on the Pluto optimization algorithms.  It
       calculates a loop structure optimized for data-locality and
       parallelism.  This option is experimental.
  
! '-floop-unroll-and-jam'
       Enable unroll and jam for the ISL based loop nest optimizer.  The
!      unroll factor can be changed using the 'loop-unroll-jam-size'
       parameter.  The unrolled dimension (counting from the most inner
!      one) can be changed using the 'loop-unroll-jam-depth' parameter.  .
  
! '-floop-parallelize-all'
       Use the Graphite data dependence analysis to identify loops that
       can be parallelized.  Parallelize all the loops that can be
       analyzed to not contain loop carried dependences without checking
       that it is profitable to parallelize the loops.
  
! '-fcheck-data-deps'
       Compare the results of several data dependence analyzers.  This
       option is used for debugging the data dependence analyzers.
  
! '-ftree-loop-if-convert'
       Attempt to transform conditional jumps in the innermost loops to
       branch-less equivalents.  The intent is to remove control-flow from
       the innermost loops in order to improve the ability of the
       vectorization pass to handle these loops.  This is enabled by
       default if vectorization is enabled.
  
! '-ftree-loop-if-convert-stores'
       Attempt to also if-convert conditional jumps containing memory
       writes.  This transformation can be unsafe for multi-threaded
       programs as it transforms conditional memory writes into
*************** optimizations to be performed is desired
*** 7955,7965 ****
              A[i] = cond ? expr : A[i];
       potentially producing data races.
  
! `-ftree-loop-distribution'
!      Perform loop distribution.  This flag can improve cache
!      performance on big loop bodies and allow further loop
!      optimizations, like parallelization or vectorization, to take
!      place.  For example, the loop
            DO I = 1, N
              A(I) = B(I) + C
              D(I) = E(I) * F
--- 7897,7907 ----
              A[i] = cond ? expr : A[i];
       potentially producing data races.
  
! '-ftree-loop-distribution'
!      Perform loop distribution.  This flag can improve cache performance
!      on big loop bodies and allow further loop optimizations, like
!      parallelization or vectorization, to take place.  For example, the
!      loop
            DO I = 1, N
              A(I) = B(I) + C
              D(I) = E(I) * F
*************** optimizations to be performed is desired
*** 7972,7983 ****
               D(I) = E(I) * F
            ENDDO
  
! `-ftree-loop-distribute-patterns'
       Perform loop distribution of patterns that can be code generated
!      with calls to a library.  This flag is enabled by default at `-O3'.
  
!      This pass distributes the initialization loops and generates a
!      call to memset zero.  For example, the loop
            DO I = 1, N
              A(I) = 0
              B(I) = A(I) + I
--- 7914,7925 ----
               D(I) = E(I) * F
            ENDDO
  
! '-ftree-loop-distribute-patterns'
       Perform loop distribution of patterns that can be code generated
!      with calls to a library.  This flag is enabled by default at '-O3'.
  
!      This pass distributes the initialization loops and generates a call
!      to memset zero.  For example, the loop
            DO I = 1, N
              A(I) = 0
              B(I) = A(I) + I
*************** optimizations to be performed is desired
*** 7992,8152 ****
       and the initialization loop is transformed into a call to memset
       zero.
  
! `-ftree-loop-im'
       Perform loop invariant motion on trees.  This pass moves only
       invariants that are hard to handle at RTL level (function calls,
       operations that expand to nontrivial sequences of insns).  With
!      `-funswitch-loops' it also moves operands of conditions that are
       invariant out of the loop, so that we can use just trivial
       invariantness analysis in loop unswitching.  The pass also includes
       store motion.
  
! `-ftree-loop-ivcanon'
       Create a canonical counter for number of iterations in loops for
       which determining number of iterations requires complicated
       analysis.  Later optimizations then may determine the number
       easily.  Useful especially in connection with unrolling.
  
! `-fivopts'
       Perform induction variable optimizations (strength reduction,
       induction variable merging and induction variable elimination) on
       trees.
  
! `-ftree-parallelize-loops=n'
       Parallelize loops, i.e., split their iteration space to run in n
       threads.  This is only possible for loops whose iterations are
       independent and can be arbitrarily reordered.  The optimization is
       only profitable on multiprocessor machines, for loops that are
       CPU-intensive, rather than constrained e.g. by memory bandwidth.
!      This option implies `-pthread', and thus is only supported on
!      targets that have support for `-pthread'.
  
! `-ftree-pta'
       Perform function-local points-to analysis on trees.  This flag is
!      enabled by default at `-O' and higher.
  
! `-ftree-sra'
       Perform scalar replacement of aggregates.  This pass replaces
       structure references with scalars to prevent committing structures
!      to memory too early.  This flag is enabled by default at `-O' and
       higher.
  
! `-ftree-copyrename'
       Perform copy renaming on trees.  This pass attempts to rename
       compiler temporaries to other variables at copy locations, usually
       resulting in variable names which more closely resemble the
!      original variables.  This flag is enabled by default at `-O' and
       higher.
  
! `-ftree-coalesce-inlined-vars'
!      Tell the copyrename pass (see `-ftree-copyrename') to attempt to
       combine small user-defined variables too, but only if they are
       inlined from other functions.  It is a more limited form of
!      `-ftree-coalesce-vars'.  This may harm debug information of such
       inlined variables, but it keeps variables of the inlined-into
       function apart from each other, such that they are more likely to
       contain the expected values in a debugging session.
  
! `-ftree-coalesce-vars'
!      Tell the copyrename pass (see `-ftree-copyrename') to attempt to
       combine small user-defined variables too, instead of just compiler
       temporaries.  This may severely limit the ability to debug an
!      optimized program compiled with `-fno-var-tracking-assignments'.
       In the negated form, this flag prevents SSA coalescing of user
       variables, including inlined ones.  This option is enabled by
       default.
  
! `-ftree-ter'
       Perform temporary expression replacement during the SSA->normal
!      phase.  Single use/single def temporaries are replaced at their
!      use location with their defining expression.  This results in
!      non-GIMPLE code, but gives the expanders much more complex trees
!      to work on resulting in better RTL generation.  This is enabled by
!      default at `-O' and higher.
  
! `-ftree-slsr'
!      Perform straight-line strength reduction on trees.  This
!      recognizes related expressions involving multiplications and
!      replaces them by less expensive calculations when possible.  This
!      is enabled by default at `-O' and higher.
  
! `-ftree-vectorize'
!      Perform vectorization on trees. This flag enables
!      `-ftree-loop-vectorize' and `-ftree-slp-vectorize' if not
       explicitly specified.
  
! `-ftree-loop-vectorize'
!      Perform loop vectorization on trees. This flag is enabled by
!      default at `-O3' and when `-ftree-vectorize' is enabled.
  
! `-ftree-slp-vectorize'
!      Perform basic block vectorization on trees. This flag is enabled
!      by default at `-O3' and when `-ftree-vectorize' is enabled.
  
! `-fvect-cost-model=MODEL'
       Alter the cost model used for vectorization.  The MODEL argument
!      should be one of `unlimited', `dynamic' or `cheap'.  With the
!      `unlimited' model the vectorized code-path is assumed to be
!      profitable while with the `dynamic' model a runtime check guards
       the vectorized code-path to enable it only for iteration counts
       that will likely execute faster than when executing the original
!      scalar loop.  The `cheap' model disables vectorization of loops
       where doing so would be cost prohibitive for example due to
       required runtime checks for data dependence or alignment but
!      otherwise is equal to the `dynamic' model.  The default cost model
!      depends on other optimization flags and is either `dynamic' or
!      `cheap'.
  
! `-fsimd-cost-model=MODEL'
       Alter the cost model used for vectorization of loops marked with
       the OpenMP or Cilk Plus simd directive.  The MODEL argument should
!      be one of `unlimited', `dynamic', `cheap'.  All values of MODEL
!      have the same meaning as described in `-fvect-cost-model' and by
!      default a cost model defined with `-fvect-cost-model' is used.
  
! `-ftree-vrp'
       Perform Value Range Propagation on trees.  This is similar to the
       constant propagation pass, but instead of values, ranges of values
       are propagated.  This allows the optimizers to remove unnecessary
!      range checks like array bound checks and null pointer checks.
!      This is enabled by default at `-O2' and higher.  Null pointer check
!      elimination is only done if `-fdelete-null-pointer-checks' is
       enabled.
  
! `-fsplit-ivs-in-unroller'
       Enables expression of values of induction variables in later
       iterations of the unrolled loop using the value in the first
       iteration.  This breaks long dependency chains, thus improving
       efficiency of the scheduling passes.
  
!      A combination of `-fweb' and CSE is often sufficient to obtain the
!      same effect.  However, that is not reliable in cases where the
!      loop body is more complicated than a single basic block.  It also
!      does not work at all on some architectures due to restrictions in
!      the CSE pass.
  
       This optimization is enabled by default.
  
! `-fvariable-expansion-in-unroller'
       With this option, the compiler creates multiple copies of some
!      local variables when unrolling a loop, which can result in
!      superior code.
  
! `-fpartial-inlining'
       Inline parts of functions.  This option has any effect only when
!      inlining itself is turned on by the `-finline-functions' or
!      `-finline-small-functions' options.
  
!      Enabled at level `-O2'.
  
! `-fpredictive-commoning'
       Perform predictive commoning optimization, i.e., reusing
       computations (especially memory loads and stores) performed in
       previous iterations of loops.
  
!      This option is enabled at level `-O3'.
  
! `-fprefetch-loop-arrays'
       If supported by the target machine, generate instructions to
       prefetch memory to improve the performance of loops that access
       large arrays.
--- 7934,8094 ----
       and the initialization loop is transformed into a call to memset
       zero.
  
! '-ftree-loop-im'
       Perform loop invariant motion on trees.  This pass moves only
       invariants that are hard to handle at RTL level (function calls,
       operations that expand to nontrivial sequences of insns).  With
!      '-funswitch-loops' it also moves operands of conditions that are
       invariant out of the loop, so that we can use just trivial
       invariantness analysis in loop unswitching.  The pass also includes
       store motion.
  
! '-ftree-loop-ivcanon'
       Create a canonical counter for number of iterations in loops for
       which determining number of iterations requires complicated
       analysis.  Later optimizations then may determine the number
       easily.  Useful especially in connection with unrolling.
  
! '-fivopts'
       Perform induction variable optimizations (strength reduction,
       induction variable merging and induction variable elimination) on
       trees.
  
! '-ftree-parallelize-loops=n'
       Parallelize loops, i.e., split their iteration space to run in n
       threads.  This is only possible for loops whose iterations are
       independent and can be arbitrarily reordered.  The optimization is
       only profitable on multiprocessor machines, for loops that are
       CPU-intensive, rather than constrained e.g. by memory bandwidth.
!      This option implies '-pthread', and thus is only supported on
!      targets that have support for '-pthread'.
  
! '-ftree-pta'
       Perform function-local points-to analysis on trees.  This flag is
!      enabled by default at '-O' and higher.
  
! '-ftree-sra'
       Perform scalar replacement of aggregates.  This pass replaces
       structure references with scalars to prevent committing structures
!      to memory too early.  This flag is enabled by default at '-O' and
       higher.
  
! '-ftree-copyrename'
       Perform copy renaming on trees.  This pass attempts to rename
       compiler temporaries to other variables at copy locations, usually
       resulting in variable names which more closely resemble the
!      original variables.  This flag is enabled by default at '-O' and
       higher.
  
! '-ftree-coalesce-inlined-vars'
!      Tell the copyrename pass (see '-ftree-copyrename') to attempt to
       combine small user-defined variables too, but only if they are
       inlined from other functions.  It is a more limited form of
!      '-ftree-coalesce-vars'.  This may harm debug information of such
       inlined variables, but it keeps variables of the inlined-into
       function apart from each other, such that they are more likely to
       contain the expected values in a debugging session.
  
! '-ftree-coalesce-vars'
!      Tell the copyrename pass (see '-ftree-copyrename') to attempt to
       combine small user-defined variables too, instead of just compiler
       temporaries.  This may severely limit the ability to debug an
!      optimized program compiled with '-fno-var-tracking-assignments'.
       In the negated form, this flag prevents SSA coalescing of user
       variables, including inlined ones.  This option is enabled by
       default.
  
! '-ftree-ter'
       Perform temporary expression replacement during the SSA->normal
!      phase.  Single use/single def temporaries are replaced at their use
!      location with their defining expression.  This results in
!      non-GIMPLE code, but gives the expanders much more complex trees to
!      work on resulting in better RTL generation.  This is enabled by
!      default at '-O' and higher.
  
! '-ftree-slsr'
!      Perform straight-line strength reduction on trees.  This recognizes
!      related expressions involving multiplications and replaces them by
!      less expensive calculations when possible.  This is enabled by
!      default at '-O' and higher.
  
! '-ftree-vectorize'
!      Perform vectorization on trees.  This flag enables
!      '-ftree-loop-vectorize' and '-ftree-slp-vectorize' if not
       explicitly specified.
  
! '-ftree-loop-vectorize'
!      Perform loop vectorization on trees.  This flag is enabled by
!      default at '-O3' and when '-ftree-vectorize' is enabled.
  
! '-ftree-slp-vectorize'
!      Perform basic block vectorization on trees.  This flag is enabled
!      by default at '-O3' and when '-ftree-vectorize' is enabled.
  
! '-fvect-cost-model=MODEL'
       Alter the cost model used for vectorization.  The MODEL argument
!      should be one of 'unlimited', 'dynamic' or 'cheap'.  With the
!      'unlimited' model the vectorized code-path is assumed to be
!      profitable while with the 'dynamic' model a runtime check guards
       the vectorized code-path to enable it only for iteration counts
       that will likely execute faster than when executing the original
!      scalar loop.  The 'cheap' model disables vectorization of loops
       where doing so would be cost prohibitive for example due to
       required runtime checks for data dependence or alignment but
!      otherwise is equal to the 'dynamic' model.  The default cost model
!      depends on other optimization flags and is either 'dynamic' or
!      'cheap'.
  
! '-fsimd-cost-model=MODEL'
       Alter the cost model used for vectorization of loops marked with
       the OpenMP or Cilk Plus simd directive.  The MODEL argument should
!      be one of 'unlimited', 'dynamic', 'cheap'.  All values of MODEL
!      have the same meaning as described in '-fvect-cost-model' and by
!      default a cost model defined with '-fvect-cost-model' is used.
  
! '-ftree-vrp'
       Perform Value Range Propagation on trees.  This is similar to the
       constant propagation pass, but instead of values, ranges of values
       are propagated.  This allows the optimizers to remove unnecessary
!      range checks like array bound checks and null pointer checks.  This
!      is enabled by default at '-O2' and higher.  Null pointer check
!      elimination is only done if '-fdelete-null-pointer-checks' is
       enabled.
  
! '-fsplit-ivs-in-unroller'
       Enables expression of values of induction variables in later
       iterations of the unrolled loop using the value in the first
       iteration.  This breaks long dependency chains, thus improving
       efficiency of the scheduling passes.
  
!      A combination of '-fweb' and CSE is often sufficient to obtain the
!      same effect.  However, that is not reliable in cases where the loop
!      body is more complicated than a single basic block.  It also does
!      not work at all on some architectures due to restrictions in the
!      CSE pass.
  
       This optimization is enabled by default.
  
! '-fvariable-expansion-in-unroller'
       With this option, the compiler creates multiple copies of some
!      local variables when unrolling a loop, which can result in superior
!      code.
  
! '-fpartial-inlining'
       Inline parts of functions.  This option has any effect only when
!      inlining itself is turned on by the '-finline-functions' or
!      '-finline-small-functions' options.
  
!      Enabled at level '-O2'.
  
! '-fpredictive-commoning'
       Perform predictive commoning optimization, i.e., reusing
       computations (especially memory loads and stores) performed in
       previous iterations of loops.
  
!      This option is enabled at level '-O3'.
  
! '-fprefetch-loop-arrays'
       If supported by the target machine, generate instructions to
       prefetch memory to improve the performance of loops that access
       large arrays.
*************** optimizations to be performed is desired
*** 8154,8229 ****
       This option may generate better or worse code; results are highly
       dependent on the structure of loops within the source code.
  
!      Disabled at level `-Os'.
  
! `-fno-peephole'
! `-fno-peephole2'
       Disable any machine-specific peephole optimizations.  The
!      difference between `-fno-peephole' and `-fno-peephole2' is in how
       they are implemented in the compiler; some targets use one, some
       use the other, a few use both.
  
!      `-fpeephole' is enabled by default.  `-fpeephole2' enabled at
!      levels `-O2', `-O3', `-Os'.
  
! `-fno-guess-branch-probability'
       Do not guess branch probabilities using heuristics.
  
       GCC uses heuristics to guess branch probabilities if they are not
!      provided by profiling feedback (`-fprofile-arcs').  These
       heuristics are based on the control flow graph.  If some branch
!      probabilities are specified by `__builtin_expect', then the
       heuristics are used to guess branch probabilities for the rest of
!      the control flow graph, taking the `__builtin_expect' info into
       account.  The interactions between the heuristics and
!      `__builtin_expect' can be complex, and in some cases, it may be
       useful to disable the heuristics so that the effects of
!      `__builtin_expect' are easier to understand.
  
!      The default is `-fguess-branch-probability' at levels `-O', `-O2',
!      `-O3', `-Os'.
  
! `-freorder-blocks'
       Reorder basic blocks in the compiled function in order to reduce
       number of taken branches and improve code locality.
  
!      Enabled at levels `-O2', `-O3'.
  
! `-freorder-blocks-and-partition'
!      In addition to reordering basic blocks in the compiled function,
!      in order to reduce number of taken branches, partitions hot and
!      cold basic blocks into separate sections of the assembly and .o
!      files, to improve paging and cache locality performance.
  
       This optimization is automatically turned off in the presence of
       exception handling, for linkonce sections, for functions with a
       user-defined section attribute and on any architecture that does
       not support named sections.
  
!      Enabled for x86 at levels `-O2', `-O3'.
  
! `-freorder-functions'
       Reorder functions in the object file in order to improve code
       locality.  This is implemented by using special subsections
!      `.text.hot' for most frequently executed functions and
!      `.text.unlikely' for unlikely executed functions.  Reordering is
       done by the linker so object file format must support named
       sections and linker must place them in a reasonable way.
  
       Also profile feedback must be available to make this option
!      effective.  See `-fprofile-arcs' for details.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-fstrict-aliasing'
       Allow the compiler to assume the strictest aliasing rules
       applicable to the language being compiled.  For C (and C++), this
       activates optimizations based on the type of expressions.  In
!      particular, an object of one type is assumed never to reside at
!      the same address as an object of a different type, unless the
!      types are almost the same.  For example, an `unsigned int' can
!      alias an `int', but not a `void*' or a `double'.  A character type
!      may alias any other type.
  
       Pay special attention to code like this:
            union a_union {
--- 8096,8171 ----
       This option may generate better or worse code; results are highly
       dependent on the structure of loops within the source code.
  
!      Disabled at level '-Os'.
  
! '-fno-peephole'
! '-fno-peephole2'
       Disable any machine-specific peephole optimizations.  The
!      difference between '-fno-peephole' and '-fno-peephole2' is in how
       they are implemented in the compiler; some targets use one, some
       use the other, a few use both.
  
!      '-fpeephole' is enabled by default.  '-fpeephole2' enabled at
!      levels '-O2', '-O3', '-Os'.
  
! '-fno-guess-branch-probability'
       Do not guess branch probabilities using heuristics.
  
       GCC uses heuristics to guess branch probabilities if they are not
!      provided by profiling feedback ('-fprofile-arcs').  These
       heuristics are based on the control flow graph.  If some branch
!      probabilities are specified by '__builtin_expect', then the
       heuristics are used to guess branch probabilities for the rest of
!      the control flow graph, taking the '__builtin_expect' info into
       account.  The interactions between the heuristics and
!      '__builtin_expect' can be complex, and in some cases, it may be
       useful to disable the heuristics so that the effects of
!      '__builtin_expect' are easier to understand.
  
!      The default is '-fguess-branch-probability' at levels '-O', '-O2',
!      '-O3', '-Os'.
  
! '-freorder-blocks'
       Reorder basic blocks in the compiled function in order to reduce
       number of taken branches and improve code locality.
  
!      Enabled at levels '-O2', '-O3'.
  
! '-freorder-blocks-and-partition'
!      In addition to reordering basic blocks in the compiled function, in
!      order to reduce number of taken branches, partitions hot and cold
!      basic blocks into separate sections of the assembly and .o files,
!      to improve paging and cache locality performance.
  
       This optimization is automatically turned off in the presence of
       exception handling, for linkonce sections, for functions with a
       user-defined section attribute and on any architecture that does
       not support named sections.
  
!      Enabled for x86 at levels '-O2', '-O3'.
  
! '-freorder-functions'
       Reorder functions in the object file in order to improve code
       locality.  This is implemented by using special subsections
!      '.text.hot' for most frequently executed functions and
!      '.text.unlikely' for unlikely executed functions.  Reordering is
       done by the linker so object file format must support named
       sections and linker must place them in a reasonable way.
  
       Also profile feedback must be available to make this option
!      effective.  See '-fprofile-arcs' for details.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-fstrict-aliasing'
       Allow the compiler to assume the strictest aliasing rules
       applicable to the language being compiled.  For C (and C++), this
       activates optimizations based on the type of expressions.  In
!      particular, an object of one type is assumed never to reside at the
!      same address as an object of a different type, unless the types are
!      almost the same.  For example, an 'unsigned int' can alias an
!      'int', but not a 'void*' or a 'double'.  A character type may alias
!      any other type.
  
       Pay special attention to code like this:
            union a_union {
*************** optimizations to be performed is desired
*** 8238,8244 ****
            }
       The practice of reading from a different union member than the one
       most recently written to (called "type-punning") is common.  Even
!      with `-fstrict-aliasing', type-punning is allowed, provided the
       memory is accessed through the union type.  So, the code above
       works as expected.  *Note Structures unions enumerations and
       bit-fields implementation::.  However, this code might not:
--- 8180,8186 ----
            }
       The practice of reading from a different union member than the one
       most recently written to (called "type-punning") is common.  Even
!      with '-fstrict-aliasing', type-punning is allowed, provided the
       memory is accessed through the union type.  So, the code above
       works as expected.  *Note Structures unions enumerations and
       bit-fields implementation::.  However, this code might not:
*************** optimizations to be performed is desired
*** 8258,8275 ****
              return ((union a_union *) &d)->i;
            }
  
!      The `-fstrict-aliasing' option is enabled at levels `-O2', `-O3',
!      `-Os'.
  
! `-fstrict-overflow'
       Allow the compiler to assume strict signed overflow rules,
       depending on the language being compiled.  For C (and C++) this
       means that overflow when doing arithmetic with signed numbers is
       undefined, which means that the compiler may assume that it does
       not happen.  This permits various optimizations.  For example, the
!      compiler assumes that an expression like `i + 10 > i' is always
!      true for signed `i'.  This assumption is only valid if signed
!      overflow is undefined, as the expression is false if `i + 10'
       overflows when using twos complement arithmetic.  When this option
       is in effect any attempt to determine whether an operation on
       signed numbers overflows must be written carefully to not actually
--- 8200,8217 ----
              return ((union a_union *) &d)->i;
            }
  
!      The '-fstrict-aliasing' option is enabled at levels '-O2', '-O3',
!      '-Os'.
  
! '-fstrict-overflow'
       Allow the compiler to assume strict signed overflow rules,
       depending on the language being compiled.  For C (and C++) this
       means that overflow when doing arithmetic with signed numbers is
       undefined, which means that the compiler may assume that it does
       not happen.  This permits various optimizations.  For example, the
!      compiler assumes that an expression like 'i + 10 > i' is always
!      true for signed 'i'.  This assumption is only valid if signed
!      overflow is undefined, as the expression is false if 'i + 10'
       overflows when using twos complement arithmetic.  When this option
       is in effect any attempt to determine whether an operation on
       signed numbers overflows must be written carefully to not actually
*************** optimizations to be performed is desired
*** 8279,8383 ****
       semantics: given a pointer to an object, if adding an offset to
       that pointer does not produce a pointer to the same object, the
       addition is undefined.  This permits the compiler to conclude that
!      `p + u > p' is always true for a pointer `p' and unsigned integer
!      `u'.  This assumption is only valid because pointer wraparound is
!      undefined, as the expression is false if `p + u' overflows using
       twos complement arithmetic.
  
!      See also the `-fwrapv' option.  Using `-fwrapv' means that integer
!      signed overflow is fully defined: it wraps.  When `-fwrapv' is
!      used, there is no difference between `-fstrict-overflow' and
!      `-fno-strict-overflow' for integers.  With `-fwrapv' certain types
       of overflow are permitted.  For example, if the compiler gets an
       overflow when doing arithmetic on constants, the overflowed value
!      can still be used with `-fwrapv', but not otherwise.
  
!      The `-fstrict-overflow' option is enabled at levels `-O2', `-O3',
!      `-Os'.
  
! `-falign-functions'
! `-falign-functions=N'
       Align the start of functions to the next power-of-two greater than
!      N, skipping up to N bytes.  For instance, `-falign-functions=32'
       aligns functions to the next 32-byte boundary, but
!      `-falign-functions=24' aligns to the next 32-byte boundary only if
       this can be done by skipping 23 bytes or less.
  
!      `-fno-align-functions' and `-falign-functions=1' are equivalent
!      and mean that functions are not aligned.
  
!      Some assemblers only support this flag when N is a power of two;
!      in that case, it is rounded up.
  
       If N is not specified or is zero, use a machine-dependent default.
  
!      Enabled at levels `-O2', `-O3'.
  
! `-falign-labels'
! `-falign-labels=N'
       Align all branch targets to a power-of-two boundary, skipping up to
!      N bytes like `-falign-functions'.  This option can easily make
!      code slower, because it must insert dummy operations for when the
!      branch target is reached in the usual flow of the code.
  
!      `-fno-align-labels' and `-falign-labels=1' are equivalent and mean
       that labels are not aligned.
  
!      If `-falign-loops' or `-falign-jumps' are applicable and are
       greater than this value, then their values are used instead.
  
       If N is not specified or is zero, use a machine-dependent default
!      which is very likely to be `1', meaning no alignment.
  
!      Enabled at levels `-O2', `-O3'.
  
! `-falign-loops'
! `-falign-loops=N'
!      Align loops to a power-of-two boundary, skipping up to N bytes
!      like `-falign-functions'.  If the loops are executed many times,
!      this makes up for any execution of the dummy operations.
  
!      `-fno-align-loops' and `-falign-loops=1' are equivalent and mean
       that loops are not aligned.
  
       If N is not specified or is zero, use a machine-dependent default.
  
!      Enabled at levels `-O2', `-O3'.
  
! `-falign-jumps'
! `-falign-jumps=N'
       Align branch targets to a power-of-two boundary, for branch targets
       where the targets can only be reached by jumping, skipping up to N
!      bytes like `-falign-functions'.  In this case, no dummy operations
       need be executed.
  
!      `-fno-align-jumps' and `-falign-jumps=1' are equivalent and mean
       that loops are not aligned.
  
       If N is not specified or is zero, use a machine-dependent default.
  
!      Enabled at levels `-O2', `-O3'.
  
! `-funit-at-a-time'
!      This option is left for compatibility reasons. `-funit-at-a-time'
!      has no effect, while `-fno-unit-at-a-time' implies
!      `-fno-toplevel-reorder' and `-fno-section-anchors'.
  
       Enabled by default.
  
! `-fno-toplevel-reorder'
!      Do not reorder top-level functions, variables, and `asm'
       statements.  Output them in the same order that they appear in the
       input file.  When this option is used, unreferenced static
       variables are not removed.  This option is intended to support
       existing code that relies on a particular ordering.  For new code,
       it is better to use attributes when possible.
  
!      Enabled at level `-O0'.  When disabled explicitly, it also implies
!      `-fno-section-anchors', which is otherwise enabled at `-O0' on some
       targets.
  
! `-fweb'
       Constructs webs as commonly used for register allocation purposes
       and assign each web individual pseudo register.  This allows the
       register allocation pass to operate on pseudos directly, but also
--- 8221,8325 ----
       semantics: given a pointer to an object, if adding an offset to
       that pointer does not produce a pointer to the same object, the
       addition is undefined.  This permits the compiler to conclude that
!      'p + u > p' is always true for a pointer 'p' and unsigned integer
!      'u'.  This assumption is only valid because pointer wraparound is
!      undefined, as the expression is false if 'p + u' overflows using
       twos complement arithmetic.
  
!      See also the '-fwrapv' option.  Using '-fwrapv' means that integer
!      signed overflow is fully defined: it wraps.  When '-fwrapv' is
!      used, there is no difference between '-fstrict-overflow' and
!      '-fno-strict-overflow' for integers.  With '-fwrapv' certain types
       of overflow are permitted.  For example, if the compiler gets an
       overflow when doing arithmetic on constants, the overflowed value
!      can still be used with '-fwrapv', but not otherwise.
  
!      The '-fstrict-overflow' option is enabled at levels '-O2', '-O3',
!      '-Os'.
  
! '-falign-functions'
! '-falign-functions=N'
       Align the start of functions to the next power-of-two greater than
!      N, skipping up to N bytes.  For instance, '-falign-functions=32'
       aligns functions to the next 32-byte boundary, but
!      '-falign-functions=24' aligns to the next 32-byte boundary only if
       this can be done by skipping 23 bytes or less.
  
!      '-fno-align-functions' and '-falign-functions=1' are equivalent and
!      mean that functions are not aligned.
  
!      Some assemblers only support this flag when N is a power of two; in
!      that case, it is rounded up.
  
       If N is not specified or is zero, use a machine-dependent default.
  
!      Enabled at levels '-O2', '-O3'.
  
! '-falign-labels'
! '-falign-labels=N'
       Align all branch targets to a power-of-two boundary, skipping up to
!      N bytes like '-falign-functions'.  This option can easily make code
!      slower, because it must insert dummy operations for when the branch
!      target is reached in the usual flow of the code.
  
!      '-fno-align-labels' and '-falign-labels=1' are equivalent and mean
       that labels are not aligned.
  
!      If '-falign-loops' or '-falign-jumps' are applicable and are
       greater than this value, then their values are used instead.
  
       If N is not specified or is zero, use a machine-dependent default
!      which is very likely to be '1', meaning no alignment.
  
!      Enabled at levels '-O2', '-O3'.
  
! '-falign-loops'
! '-falign-loops=N'
!      Align loops to a power-of-two boundary, skipping up to N bytes like
!      '-falign-functions'.  If the loops are executed many times, this
!      makes up for any execution of the dummy operations.
  
!      '-fno-align-loops' and '-falign-loops=1' are equivalent and mean
       that loops are not aligned.
  
       If N is not specified or is zero, use a machine-dependent default.
  
!      Enabled at levels '-O2', '-O3'.
  
! '-falign-jumps'
! '-falign-jumps=N'
       Align branch targets to a power-of-two boundary, for branch targets
       where the targets can only be reached by jumping, skipping up to N
!      bytes like '-falign-functions'.  In this case, no dummy operations
       need be executed.
  
!      '-fno-align-jumps' and '-falign-jumps=1' are equivalent and mean
       that loops are not aligned.
  
       If N is not specified or is zero, use a machine-dependent default.
  
!      Enabled at levels '-O2', '-O3'.
  
! '-funit-at-a-time'
!      This option is left for compatibility reasons.  '-funit-at-a-time'
!      has no effect, while '-fno-unit-at-a-time' implies
!      '-fno-toplevel-reorder' and '-fno-section-anchors'.
  
       Enabled by default.
  
! '-fno-toplevel-reorder'
!      Do not reorder top-level functions, variables, and 'asm'
       statements.  Output them in the same order that they appear in the
       input file.  When this option is used, unreferenced static
       variables are not removed.  This option is intended to support
       existing code that relies on a particular ordering.  For new code,
       it is better to use attributes when possible.
  
!      Enabled at level '-O0'.  When disabled explicitly, it also implies
!      '-fno-section-anchors', which is otherwise enabled at '-O0' on some
       targets.
  
! '-fweb'
       Constructs webs as commonly used for register allocation purposes
       and assign each web individual pseudo register.  This allows the
       register allocation pass to operate on pseudos directly, but also
*************** optimizations to be performed is desired
*** 8386,8405 ****
       debugging impossible, since variables no longer stay in a "home
       register".
  
!      Enabled by default with `-funroll-loops'.
  
! `-fwhole-program'
       Assume that the current compilation unit represents the whole
       program being compiled.  All public functions and variables with
!      the exception of `main' and those merged by attribute
!      `externally_visible' become static functions and in effect are
       optimized more aggressively by interprocedural optimizers.
  
!      This option should not be used in combination with `-flto'.
       Instead relying on a linker plugin should provide safer and more
       precise information.
  
! `-flto[=N]'
       This option runs the standard link-time optimizer.  When invoked
       with source code, it generates GIMPLE (one of GCC's internal
       representations) and writes it to special ELF sections in the
--- 8328,8347 ----
       debugging impossible, since variables no longer stay in a "home
       register".
  
!      Enabled by default with '-funroll-loops'.
  
! '-fwhole-program'
       Assume that the current compilation unit represents the whole
       program being compiled.  All public functions and variables with
!      the exception of 'main' and those merged by attribute
!      'externally_visible' become static functions and in effect are
       optimized more aggressively by interprocedural optimizers.
  
!      This option should not be used in combination with '-flto'.
       Instead relying on a linker plugin should provide safer and more
       precise information.
  
! '-flto[=N]'
       This option runs the standard link-time optimizer.  When invoked
       with source code, it generates GIMPLE (one of GCC's internal
       representations) and writes it to special ELF sections in the
*************** optimizations to be performed is desired
*** 8407,8469 ****
       function bodies are read from these ELF sections and instantiated
       as if they had been part of the same translation unit.
  
!      To use the link-time optimizer, `-flto' and optimization options
!      should be specified at compile time and during the final link.
!      For example:
  
            gcc -c -O2 -flto foo.c
            gcc -c -O2 -flto bar.c
            gcc -o myprog -flto -O2 foo.o bar.o
  
       The first two invocations to GCC save a bytecode representation of
!      GIMPLE into special ELF sections inside `foo.o' and `bar.o'.  The
!      final invocation reads the GIMPLE bytecode from `foo.o' and
!      `bar.o', merges the two files into a single internal image, and
!      compiles the result as usual.  Since both `foo.o' and `bar.o' are
       merged into a single image, this causes all the interprocedural
       analyses and optimizations in GCC to work across the two files as
       if they were a single one.  This means, for example, that the
!      inliner is able to inline functions in `bar.o' into functions in
!      `foo.o' and vice-versa.
  
       Another (simpler) way to enable link-time optimization is:
  
            gcc -o myprog -flto -O2 foo.c bar.c
  
!      The above generates bytecode for `foo.c' and `bar.c', merges them
       together into a single GIMPLE representation and optimizes them as
!      usual to produce `myprog'.
  
       The only important thing to keep in mind is that to enable
       link-time optimizations you need to use the GCC driver to perform
       the link-step.  GCC then automatically performs link-time
       optimization if any of the objects involved were compiled with the
!      `-flto' command-line option.  You generally should specify the
       optimization options to be used for link-time optimization though
       GCC tries to be clever at guessing an optimization level to use
!      from the options used at compile-time if you fail to specify one
!      at link-time.  You can always override the automatic decision to
!      do link-time optimization at link-time by passing `-fno-lto' to
!      the link command.
  
       To make whole program optimization effective, it is necessary to
       make certain whole program assumptions.  The compiler needs to know
       what functions and variables can be accessed by libraries and
!      runtime outside of the link-time optimized unit.  When supported
!      by the linker, the linker plugin (see `-fuse-linker-plugin')
!      passes information to the compiler about used and externally
!      visible symbols.  When the linker plugin is not available,
!      `-fwhole-program' should be used to allow the compiler to make
       these assumptions, which leads to more aggressive optimization
       decisions.
  
!      When `-fuse-linker-plugin' is not enabled then, when a file is
!      compiled with `-flto', the generated object file is larger than a
       regular object file because it contains GIMPLE bytecodes and the
!      usual final code (see `-ffat-lto-objects'.  This means that object
!      files with LTO information can be linked as normal object files;
!      if `-fno-lto' is passed to the linker, no interprocedural
!      optimizations are applied.  Note that when `-fno-fat-lto-objects'
       is enabled the compile-stage is faster but you cannot perform a
       regular, non-LTO link on them.
  
--- 8349,8411 ----
       function bodies are read from these ELF sections and instantiated
       as if they had been part of the same translation unit.
  
!      To use the link-time optimizer, '-flto' and optimization options
!      should be specified at compile time and during the final link.  For
!      example:
  
            gcc -c -O2 -flto foo.c
            gcc -c -O2 -flto bar.c
            gcc -o myprog -flto -O2 foo.o bar.o
  
       The first two invocations to GCC save a bytecode representation of
!      GIMPLE into special ELF sections inside 'foo.o' and 'bar.o'.  The
!      final invocation reads the GIMPLE bytecode from 'foo.o' and
!      'bar.o', merges the two files into a single internal image, and
!      compiles the result as usual.  Since both 'foo.o' and 'bar.o' are
       merged into a single image, this causes all the interprocedural
       analyses and optimizations in GCC to work across the two files as
       if they were a single one.  This means, for example, that the
!      inliner is able to inline functions in 'bar.o' into functions in
!      'foo.o' and vice-versa.
  
       Another (simpler) way to enable link-time optimization is:
  
            gcc -o myprog -flto -O2 foo.c bar.c
  
!      The above generates bytecode for 'foo.c' and 'bar.c', merges them
       together into a single GIMPLE representation and optimizes them as
!      usual to produce 'myprog'.
  
       The only important thing to keep in mind is that to enable
       link-time optimizations you need to use the GCC driver to perform
       the link-step.  GCC then automatically performs link-time
       optimization if any of the objects involved were compiled with the
!      '-flto' command-line option.  You generally should specify the
       optimization options to be used for link-time optimization though
       GCC tries to be clever at guessing an optimization level to use
!      from the options used at compile-time if you fail to specify one at
!      link-time.  You can always override the automatic decision to do
!      link-time optimization at link-time by passing '-fno-lto' to the
!      link command.
  
       To make whole program optimization effective, it is necessary to
       make certain whole program assumptions.  The compiler needs to know
       what functions and variables can be accessed by libraries and
!      runtime outside of the link-time optimized unit.  When supported by
!      the linker, the linker plugin (see '-fuse-linker-plugin') passes
!      information to the compiler about used and externally visible
!      symbols.  When the linker plugin is not available,
!      '-fwhole-program' should be used to allow the compiler to make
       these assumptions, which leads to more aggressive optimization
       decisions.
  
!      When '-fuse-linker-plugin' is not enabled then, when a file is
!      compiled with '-flto', the generated object file is larger than a
       regular object file because it contains GIMPLE bytecodes and the
!      usual final code (see '-ffat-lto-objects'.  This means that object
!      files with LTO information can be linked as normal object files; if
!      '-fno-lto' is passed to the linker, no interprocedural
!      optimizations are applied.  Note that when '-fno-fat-lto-objects'
       is enabled the compile-stage is faster but you cannot perform a
       regular, non-LTO link on them.
  
*************** optimizations to be performed is desired
*** 8476,8519 ****
            gcc -o myprog -O3 foo.o bar.o
  
       This produces individual object files with unoptimized assembler
!      code, but the resulting binary `myprog' is optimized at `-O3'.
!      If, instead, the final binary is generated with `-fno-lto', then
!      `myprog' is not optimized.
  
       When producing the final binary, GCC only applies link-time
!      optimizations to those files that contain bytecode.  Therefore,
!      you can mix and match object files and libraries with GIMPLE
!      bytecodes and final object code.  GCC automatically selects which
!      files to optimize in LTO mode and which files to link without
!      further processing.
  
       There are some code generation flags preserved by GCC when
       generating bytecodes, as they need to be used during the final link
       stage.  Generally options specified at link-time override those
       specified at compile-time.
  
!      If you do not specify an optimization level option `-O' at
       link-time then GCC computes one based on the optimization levels
       used when compiling the object files.  The highest optimization
       level wins here.
  
       Currently, the following options and their setting are take from
!      the first object file that explicitely specified it: `-fPIC',
!      `-fpic', `-fpie', `-fcommon', `-fexceptions',
!      `-fnon-call-exceptions', `-fgnu-tm' and all the `-m' target flags.
  
       Certain ABI changing flags are required to match in all
       compilation-units and trying to override this at link-time with a
       conflicting value is ignored.  This includes options such as
!      `-freg-struct-return' and `-fpcc-struct-return'.
  
!      Other options such as `-ffp-contract', `-fno-strict-overflow',
!      `-fwrapv', `-fno-trapv' or `-fno-strict-aliasing' are passed
!      through to the link stage and merged conservatively for
!      conflicting translation units.  Specifically
!      `-fno-strict-overflow', `-fwrapv' and `-fno-trapv' take precedence
!      and for example `-ffp-contract=off' takes precedence over
!      `-ffp-contract=fast'.  You can override them at linke-time.
  
       It is recommended that you compile all the files participating in
       the same link with the same options and also specify those options
--- 8418,8461 ----
            gcc -o myprog -O3 foo.o bar.o
  
       This produces individual object files with unoptimized assembler
!      code, but the resulting binary 'myprog' is optimized at '-O3'.  If,
!      instead, the final binary is generated with '-fno-lto', then
!      'myprog' is not optimized.
  
       When producing the final binary, GCC only applies link-time
!      optimizations to those files that contain bytecode.  Therefore, you
!      can mix and match object files and libraries with GIMPLE bytecodes
!      and final object code.  GCC automatically selects which files to
!      optimize in LTO mode and which files to link without further
!      processing.
  
       There are some code generation flags preserved by GCC when
       generating bytecodes, as they need to be used during the final link
       stage.  Generally options specified at link-time override those
       specified at compile-time.
  
!      If you do not specify an optimization level option '-O' at
       link-time then GCC computes one based on the optimization levels
       used when compiling the object files.  The highest optimization
       level wins here.
  
       Currently, the following options and their setting are take from
!      the first object file that explicitely specified it: '-fPIC',
!      '-fpic', '-fpie', '-fcommon', '-fexceptions',
!      '-fnon-call-exceptions', '-fgnu-tm' and all the '-m' target flags.
  
       Certain ABI changing flags are required to match in all
       compilation-units and trying to override this at link-time with a
       conflicting value is ignored.  This includes options such as
!      '-freg-struct-return' and '-fpcc-struct-return'.
  
!      Other options such as '-ffp-contract', '-fno-strict-overflow',
!      '-fwrapv', '-fno-trapv' or '-fno-strict-aliasing' are passed
!      through to the link stage and merged conservatively for conflicting
!      translation units.  Specifically '-fno-strict-overflow', '-fwrapv'
!      and '-fno-trapv' take precedence and for example
!      '-ffp-contract=off' takes precedence over '-ffp-contract=fast'.
!      You can override them at linke-time.
  
       It is recommended that you compile all the files participating in
       the same link with the same options and also specify those options
*************** optimizations to be performed is desired
*** 8534,8576 ****
            gfortran -c -flto baz.f90
            g++ -o myprog -flto -O3 foo.o bar.o baz.o -lgfortran
  
!      Notice that the final link is done with `g++' to get the C++
!      runtime libraries and `-lgfortran' is added to get the Fortran
       runtime libraries.  In general, when mixing languages in LTO mode,
       you should use the same link command options as when mixing
       languages in a regular (non-LTO) compilation.
  
       If object files containing GIMPLE bytecode are stored in a library
!      archive, say `libfoo.a', it is possible to extract and use them in
       an LTO link if you are using a linker with plugin support.  To
!      create static libraries suitable for LTO, use `gcc-ar' and
!      `gcc-ranlib' instead of `ar' and `ranlib'; to show the symbols of
!      object files with GIMPLE bytecode, use `gcc-nm'.  Those commands
!      require that `ar', `ranlib' and `nm' have been compiled with
!      plugin support.  At link time, use the the flag
!      `-fuse-linker-plugin' to ensure that the library participates in
!      the LTO optimization process:
  
            gcc -o myprog -O2 -flto -fuse-linker-plugin a.o b.o -lfoo
  
       With the linker plugin enabled, the linker extracts the needed
!      GIMPLE files from `libfoo.a' and passes them on to the running GCC
       to make them part of the aggregated GIMPLE image to be optimized.
  
       If you are not using a linker with plugin support and/or do not
!      enable the linker plugin, then the objects inside `libfoo.a' are
       extracted and linked as usual, but they do not participate in the
       LTO optimization process.  In order to make a static library
       suitable for both LTO optimization and usual linkage, compile its
!      object files with `-flto' `-ffat-lto-objects'.
  
       Link-time optimizations do not require the presence of the whole
!      program to operate.  If the program does not require any symbols
!      to be exported, it is possible to combine `-flto' and
!      `-fwhole-program' to allow the interprocedural optimizers to use
!      more aggressive assumptions which may lead to improved
!      optimization opportunities.  Use of `-fwhole-program' is not
!      needed when linker plugin is active (see `-fuse-linker-plugin').
  
       The current implementation of LTO makes no attempt to generate
       bytecode that is portable between different types of hosts.  The
--- 8476,8518 ----
            gfortran -c -flto baz.f90
            g++ -o myprog -flto -O3 foo.o bar.o baz.o -lgfortran
  
!      Notice that the final link is done with 'g++' to get the C++
!      runtime libraries and '-lgfortran' is added to get the Fortran
       runtime libraries.  In general, when mixing languages in LTO mode,
       you should use the same link command options as when mixing
       languages in a regular (non-LTO) compilation.
  
       If object files containing GIMPLE bytecode are stored in a library
!      archive, say 'libfoo.a', it is possible to extract and use them in
       an LTO link if you are using a linker with plugin support.  To
!      create static libraries suitable for LTO, use 'gcc-ar' and
!      'gcc-ranlib' instead of 'ar' and 'ranlib'; to show the symbols of
!      object files with GIMPLE bytecode, use 'gcc-nm'.  Those commands
!      require that 'ar', 'ranlib' and 'nm' have been compiled with plugin
!      support.  At link time, use the the flag '-fuse-linker-plugin' to
!      ensure that the library participates in the LTO optimization
!      process:
  
            gcc -o myprog -O2 -flto -fuse-linker-plugin a.o b.o -lfoo
  
       With the linker plugin enabled, the linker extracts the needed
!      GIMPLE files from 'libfoo.a' and passes them on to the running GCC
       to make them part of the aggregated GIMPLE image to be optimized.
  
       If you are not using a linker with plugin support and/or do not
!      enable the linker plugin, then the objects inside 'libfoo.a' are
       extracted and linked as usual, but they do not participate in the
       LTO optimization process.  In order to make a static library
       suitable for both LTO optimization and usual linkage, compile its
!      object files with '-flto' '-ffat-lto-objects'.
  
       Link-time optimizations do not require the presence of the whole
!      program to operate.  If the program does not require any symbols to
!      be exported, it is possible to combine '-flto' and
!      '-fwhole-program' to allow the interprocedural optimizers to use
!      more aggressive assumptions which may lead to improved optimization
!      opportunities.  Use of '-fwhole-program' is not needed when linker
!      plugin is active (see '-fuse-linker-plugin').
  
       The current implementation of LTO makes no attempt to generate
       bytecode that is portable between different types of hosts.  The
*************** optimizations to be performed is desired
*** 8579,8677 ****
       an older or newer version of GCC.
  
       Link-time optimization does not work well with generation of
!      debugging information.  Combining `-flto' with `-g' is currently
       experimental and expected to produce unexpected results.
  
!      If you specify the optional N, the optimization and code
!      generation done at link time is executed in parallel using N
!      parallel jobs by utilizing an installed `make' program.  The
!      environment variable `MAKE' may be used to override the program
!      used.  The default value for N is 1.
  
!      You can also specify `-flto=jobserver' to use GNU make's job
!      server mode to determine the number of parallel jobs. This is
!      useful when the Makefile calling GCC is already executing in
!      parallel.  You must prepend a `+' to the command recipe in the
!      parent Makefile for this to work.  This option likely only works
!      if `MAKE' is GNU make.
  
! `-flto-partition=ALG'
       Specify the partitioning algorithm used by the link-time optimizer.
!      The value is either `1to1' to specify a partitioning mirroring the
!      original source files or `balanced' to specify partitioning into
!      equally sized chunks (whenever possible) or `max' to create new
!      partition for every symbol where possible.  Specifying `none' as
!      an algorithm disables partitioning and streaming completely.  The
!      default value is `balanced'. While `1to1' can be used as an
!      workaround for various code ordering issues, the `max'
!      partitioning is intended for internal testing only.  The value
!      `one' specifies that exactly one partition should be used while
!      the value `none' bypasses partitioning and executes the link-time
!      optimization step directly from the WPA phase.
  
! `-flto-odr-type-merging'
       Enable streaming of mangled types names of C++ types and their
       unification at linktime.  This increases size of LTO object files,
       but enable diagnostics about One Definition Rule violations.
  
! `-flto-compression-level=N'
       This option specifies the level of compression used for
       intermediate language written to LTO object files, and is only
!      meaningful in conjunction with LTO mode (`-flto').  Valid values
       are 0 (no compression) to 9 (maximum compression).  Values outside
       this range are clamped to either 0 or 9.  If the option is not
       given, a default balanced compression setting is used.
  
! `-flto-report'
       Prints a report with internal details on the workings of the
!      link-time optimizer.  The contents of this report vary from
!      version to version.  It is meant to be useful to GCC developers
!      when processing object files in LTO mode (via `-flto').
  
       Disabled by default.
  
! `-flto-report-wpa'
!      Like `-flto-report', but only print for the WPA phase of Link Time
       Optimization.
  
! `-fuse-linker-plugin'
       Enables the use of a linker plugin during link-time optimization.
       This option relies on plugin support in the linker, which is
       available in gold or in GNU ld 2.21 or newer.
  
       This option enables the extraction of object files with GIMPLE
!      bytecode out of library archives. This improves the quality of
       optimization by exposing more code to the link-time optimizer.
       This information specifies what symbols can be accessed externally
       (by non-LTO object or during dynamic linking).  Resulting code
       quality improvements on binaries (and shared libraries that use
!      hidden visibility) are similar to `-fwhole-program'.  See `-flto'
       for a description of the effect of this flag and how to use it.
  
       This option is enabled by default when LTO support in GCC is
       enabled and GCC was configured for use with a linker supporting
       plugins (GNU ld 2.21 or newer or gold).
  
! `-ffat-lto-objects'
!      Fat LTO objects are object files that contain both the
!      intermediate language and the object code. This makes them usable
!      for both LTO linking and normal linking. This option is effective
!      only when compiling with `-flto' and is ignored at link time.
  
!      `-fno-fat-lto-objects' improves compilation time over plain LTO,
!      but requires the complete toolchain to be aware of LTO. It
!      requires a linker with linker plugin support for basic
!      functionality.  Additionally, `nm', `ar' and `ranlib' need to
!      support linker plugins to allow a full-featured build environment
!      (capable of building static libraries etc).  GCC provides the
!      `gcc-ar', `gcc-nm', `gcc-ranlib' wrappers to pass the right options
!      to these tools. With non fat LTO makefiles need to be modified to
!      use them.
  
!      The default is `-fno-fat-lto-objects' on targets with linker plugin
       support.
  
! `-fcompare-elim'
       After register allocation and post-register allocation instruction
       splitting, identify arithmetic instructions that compute processor
       flags similar to a comparison operation based on that arithmetic.
--- 8521,8617 ----
       an older or newer version of GCC.
  
       Link-time optimization does not work well with generation of
!      debugging information.  Combining '-flto' with '-g' is currently
       experimental and expected to produce unexpected results.
  
!      If you specify the optional N, the optimization and code generation
!      done at link time is executed in parallel using N parallel jobs by
!      utilizing an installed 'make' program.  The environment variable
!      'MAKE' may be used to override the program used.  The default value
!      for N is 1.
  
!      You can also specify '-flto=jobserver' to use GNU make's job server
!      mode to determine the number of parallel jobs.  This is useful when
!      the Makefile calling GCC is already executing in parallel.  You
!      must prepend a '+' to the command recipe in the parent Makefile for
!      this to work.  This option likely only works if 'MAKE' is GNU make.
  
! '-flto-partition=ALG'
       Specify the partitioning algorithm used by the link-time optimizer.
!      The value is either '1to1' to specify a partitioning mirroring the
!      original source files or 'balanced' to specify partitioning into
!      equally sized chunks (whenever possible) or 'max' to create new
!      partition for every symbol where possible.  Specifying 'none' as an
!      algorithm disables partitioning and streaming completely.  The
!      default value is 'balanced'.  While '1to1' can be used as an
!      workaround for various code ordering issues, the 'max' partitioning
!      is intended for internal testing only.  The value 'one' specifies
!      that exactly one partition should be used while the value 'none'
!      bypasses partitioning and executes the link-time optimization step
!      directly from the WPA phase.
  
! '-flto-odr-type-merging'
       Enable streaming of mangled types names of C++ types and their
       unification at linktime.  This increases size of LTO object files,
       but enable diagnostics about One Definition Rule violations.
  
! '-flto-compression-level=N'
       This option specifies the level of compression used for
       intermediate language written to LTO object files, and is only
!      meaningful in conjunction with LTO mode ('-flto').  Valid values
       are 0 (no compression) to 9 (maximum compression).  Values outside
       this range are clamped to either 0 or 9.  If the option is not
       given, a default balanced compression setting is used.
  
! '-flto-report'
       Prints a report with internal details on the workings of the
!      link-time optimizer.  The contents of this report vary from version
!      to version.  It is meant to be useful to GCC developers when
!      processing object files in LTO mode (via '-flto').
  
       Disabled by default.
  
! '-flto-report-wpa'
!      Like '-flto-report', but only print for the WPA phase of Link Time
       Optimization.
  
! '-fuse-linker-plugin'
       Enables the use of a linker plugin during link-time optimization.
       This option relies on plugin support in the linker, which is
       available in gold or in GNU ld 2.21 or newer.
  
       This option enables the extraction of object files with GIMPLE
!      bytecode out of library archives.  This improves the quality of
       optimization by exposing more code to the link-time optimizer.
       This information specifies what symbols can be accessed externally
       (by non-LTO object or during dynamic linking).  Resulting code
       quality improvements on binaries (and shared libraries that use
!      hidden visibility) are similar to '-fwhole-program'.  See '-flto'
       for a description of the effect of this flag and how to use it.
  
       This option is enabled by default when LTO support in GCC is
       enabled and GCC was configured for use with a linker supporting
       plugins (GNU ld 2.21 or newer or gold).
  
! '-ffat-lto-objects'
!      Fat LTO objects are object files that contain both the intermediate
!      language and the object code.  This makes them usable for both LTO
!      linking and normal linking.  This option is effective only when
!      compiling with '-flto' and is ignored at link time.
  
!      '-fno-fat-lto-objects' improves compilation time over plain LTO,
!      but requires the complete toolchain to be aware of LTO. It requires
!      a linker with linker plugin support for basic functionality.
!      Additionally, 'nm', 'ar' and 'ranlib' need to support linker
!      plugins to allow a full-featured build environment (capable of
!      building static libraries etc).  GCC provides the 'gcc-ar',
!      'gcc-nm', 'gcc-ranlib' wrappers to pass the right options to these
!      tools.  With non fat LTO makefiles need to be modified to use them.
  
!      The default is '-fno-fat-lto-objects' on targets with linker plugin
       support.
  
! '-fcompare-elim'
       After register allocation and post-register allocation instruction
       splitting, identify arithmetic instructions that compute processor
       flags similar to a comparison operation based on that arithmetic.
*************** optimizations to be performed is desired
*** 8681,8765 ****
       represent the comparison operation before register allocation is
       complete.
  
!      Enabled at levels `-O', `-O2', `-O3', `-Os'.
  
! `-fcprop-registers'
       After register allocation and post-register allocation instruction
       splitting, perform a copy-propagation pass to try to reduce
       scheduling dependencies and occasionally eliminate the copy.
  
!      Enabled at levels `-O', `-O2', `-O3', `-Os'.
  
! `-fprofile-correction'
       Profiles collected using an instrumented binary for multi-threaded
!      programs may be inconsistent due to missed counter updates. When
       this option is specified, GCC uses heuristics to correct or smooth
!      out such inconsistencies. By default, GCC emits an error message
       when an inconsistent profile is detected.
  
! `-fprofile-dir=PATH'
       Set the directory to search for the profile data files in to PATH.
       This option affects only the profile data generated by
!      `-fprofile-generate', `-ftest-coverage', `-fprofile-arcs' and used
!      by `-fprofile-use' and `-fbranch-probabilities' and its related
       options.  Both absolute and relative paths can be used.  By
       default, GCC uses the current directory as PATH, thus the profile
       data file appears in the same directory as the object file.
  
! `-fprofile-generate'
! `-fprofile-generate=PATH'
       Enable options usually used for instrumenting application to
       produce profile useful for later recompilation with profile
!      feedback based optimization.  You must use `-fprofile-generate'
       both when compiling and when linking your program.
  
!      The following options are enabled: `-fprofile-arcs',
!      `-fprofile-values', `-fvpt'.
  
       If PATH is specified, GCC looks at the PATH to find the profile
!      feedback data files. See `-fprofile-dir'.
  
! `-fprofile-use'
! `-fprofile-use=PATH'
       Enable profile feedback-directed optimizations, and the following
       optimizations which are generally profitable only with profile
!      feedback available: `-fbranch-probabilities', `-fvpt',
!      `-funroll-loops', `-fpeel-loops', `-ftracer', `-ftree-vectorize',
!      and `ftree-loop-distribute-patterns'.
  
       By default, GCC emits an error message if the feedback profiles do
!      not match the source code.  This error can be turned into a
!      warning by using `-Wcoverage-mismatch'.  Note this may result in
!      poorly optimized code.
  
       If PATH is specified, GCC looks at the PATH to find the profile
!      feedback data files. See `-fprofile-dir'.
  
! `-fauto-profile'
! `-fauto-profile=PATH'
       Enable sampling-based feedback-directed optimizations, and the
       following optimizations which are generally profitable only with
!      profile feedback available: `-fbranch-probabilities', `-fvpt',
!      `-funroll-loops', `-fpeel-loops', `-ftracer', `-ftree-vectorize',
!      `-finline-functions', `-fipa-cp', `-fipa-cp-clone',
!      `-fpredictive-commoning', `-funswitch-loops',
!      `-fgcse-after-reload', and `-ftree-loop-distribute-patterns'.
  
       PATH is the name of a file containing AutoFDO profile information.
!      If omitted, it defaults to `fbdata.afdo' in the current directory.
  
       Producing an AutoFDO profile data file requires running your
!      program with the `perf' utility on a supported GNU/Linux target
!      system.  For more information, see `https://perf.wiki.kernel.org/'.
  
       E.g.
            perf record -e br_inst_retired:near_taken -b -o perf.data \
                -- your_program
  
!      Then use the `create_gcov' tool to convert the raw profile data to
       a format that can be used by GCC.  You must also supply the
       unstripped binary for your program to this tool.  See
!      `https://github.com/google/autofdo'.
  
       E.g.
            create_gcov --binary=your_program.unstripped --profile=perf.data \
--- 8621,8707 ----
       represent the comparison operation before register allocation is
       complete.
  
!      Enabled at levels '-O', '-O2', '-O3', '-Os'.
  
! '-fcprop-registers'
       After register allocation and post-register allocation instruction
       splitting, perform a copy-propagation pass to try to reduce
       scheduling dependencies and occasionally eliminate the copy.
  
!      Enabled at levels '-O', '-O2', '-O3', '-Os'.
  
! '-fprofile-correction'
       Profiles collected using an instrumented binary for multi-threaded
!      programs may be inconsistent due to missed counter updates.  When
       this option is specified, GCC uses heuristics to correct or smooth
!      out such inconsistencies.  By default, GCC emits an error message
       when an inconsistent profile is detected.
  
! '-fprofile-dir=PATH'
! 
       Set the directory to search for the profile data files in to PATH.
       This option affects only the profile data generated by
!      '-fprofile-generate', '-ftest-coverage', '-fprofile-arcs' and used
!      by '-fprofile-use' and '-fbranch-probabilities' and its related
       options.  Both absolute and relative paths can be used.  By
       default, GCC uses the current directory as PATH, thus the profile
       data file appears in the same directory as the object file.
  
! '-fprofile-generate'
! '-fprofile-generate=PATH'
! 
       Enable options usually used for instrumenting application to
       produce profile useful for later recompilation with profile
!      feedback based optimization.  You must use '-fprofile-generate'
       both when compiling and when linking your program.
  
!      The following options are enabled: '-fprofile-arcs',
!      '-fprofile-values', '-fvpt'.
  
       If PATH is specified, GCC looks at the PATH to find the profile
!      feedback data files.  See '-fprofile-dir'.
  
! '-fprofile-use'
! '-fprofile-use=PATH'
       Enable profile feedback-directed optimizations, and the following
       optimizations which are generally profitable only with profile
!      feedback available: '-fbranch-probabilities', '-fvpt',
!      '-funroll-loops', '-fpeel-loops', '-ftracer', '-ftree-vectorize',
!      and 'ftree-loop-distribute-patterns'.
  
       By default, GCC emits an error message if the feedback profiles do
!      not match the source code.  This error can be turned into a warning
!      by using '-Wcoverage-mismatch'.  Note this may result in poorly
!      optimized code.
  
       If PATH is specified, GCC looks at the PATH to find the profile
!      feedback data files.  See '-fprofile-dir'.
  
! '-fauto-profile'
! '-fauto-profile=PATH'
       Enable sampling-based feedback-directed optimizations, and the
       following optimizations which are generally profitable only with
!      profile feedback available: '-fbranch-probabilities', '-fvpt',
!      '-funroll-loops', '-fpeel-loops', '-ftracer', '-ftree-vectorize',
!      '-finline-functions', '-fipa-cp', '-fipa-cp-clone',
!      '-fpredictive-commoning', '-funswitch-loops',
!      '-fgcse-after-reload', and '-ftree-loop-distribute-patterns'.
  
       PATH is the name of a file containing AutoFDO profile information.
!      If omitted, it defaults to 'fbdata.afdo' in the current directory.
  
       Producing an AutoFDO profile data file requires running your
!      program with the 'perf' utility on a supported GNU/Linux target
!      system.  For more information, see <https://perf.wiki.kernel.org/>.
  
       E.g.
            perf record -e br_inst_retired:near_taken -b -o perf.data \
                -- your_program
  
!      Then use the 'create_gcov' tool to convert the raw profile data to
       a format that can be used by GCC.  You must also supply the
       unstripped binary for your program to this tool.  See
!      <https://github.com/google/autofdo>.
  
       E.g.
            create_gcov --binary=your_program.unstripped --profile=perf.data \
*************** optimizations to be performed is desired
*** 8769,9033 ****
  floating-point arithmetic.  These options trade off between speed and
  correctness.  All must be specifically enabled.
  
! `-ffloat-store'
       Do not store floating-point variables in registers, and inhibit
       other options that might change whether a floating-point value is
       taken from a register or memory.
  
       This option prevents undesirable excess precision on machines such
       as the 68000 where the floating registers (of the 68881) keep more
!      precision than a `double' is supposed to have.  Similarly for the
       x86 architecture.  For most programs, the excess precision does
       only good, but a few programs rely on the precise definition of
!      IEEE floating point.  Use `-ffloat-store' for such programs, after
       modifying them to store all pertinent intermediate computations
       into variables.
  
! `-fexcess-precision=STYLE'
       This option allows further control over excess precision on
       machines where floating-point registers have more precision than
!      the IEEE `float' and `double' types and the processor does not
       support operations rounding to those types.  By default,
!      `-fexcess-precision=fast' is in effect; this means that operations
       are carried out in the precision of the registers and that it is
       unpredictable when rounding to the types specified in the source
       code takes place.  When compiling C, if
!      `-fexcess-precision=standard' is specified then excess precision
       follows the rules specified in ISO C99; in particular, both casts
       and assignments cause values to be rounded to their semantic types
!      (whereas `-ffloat-store' only affects assignments).  This option
!      is enabled by default for C if a strict conformance option such as
!      `-std=c99' is used.
  
!      `-fexcess-precision=standard' is not implemented for languages
!      other than C, and has no effect if `-funsafe-math-optimizations'
!      or `-ffast-math' is specified.  On the x86, it also has no effect
!      if `-mfpmath=sse' or `-mfpmath=sse+387' is specified; in the
!      former case, IEEE semantics apply without excess precision, and in
!      the latter, rounding is unpredictable.
  
! `-ffast-math'
!      Sets the options `-fno-math-errno', `-funsafe-math-optimizations',
!      `-ffinite-math-only', `-fno-rounding-math', `-fno-signaling-nans'
!      and `-fcx-limited-range'.
  
!      This option causes the preprocessor macro `__FAST_MATH__' to be
       defined.
  
!      This option is not turned on by any `-O' option besides `-Ofast'
!      since it can result in incorrect output for programs that depend
!      on an exact implementation of IEEE or ISO rules/specifications for
!      math functions. It may, however, yield faster code for programs
       that do not require the guarantees of these specifications.
  
! `-fno-math-errno'
!      Do not set `errno' after calling math functions that are executed
!      with a single instruction, e.g., `sqrt'.  A program that relies on
       IEEE exceptions for math error handling may want to use this flag
       for speed while maintaining IEEE arithmetic compatibility.
  
!      This option is not turned on by any `-O' option since it can
!      result in incorrect output for programs that depend on an exact
       implementation of IEEE or ISO rules/specifications for math
!      functions. It may, however, yield faster code for programs that do
       not require the guarantees of these specifications.
  
!      The default is `-fmath-errno'.
  
!      On Darwin systems, the math library never sets `errno'.  There is
       therefore no reason for the compiler to consider the possibility
!      that it might, and `-fno-math-errno' is the default.
  
- `-funsafe-math-optimizations'
       Allow optimizations for floating-point arithmetic that (a) assume
       that arguments and results are valid and (b) may violate IEEE or
       ANSI standards.  When used at link-time, it may include libraries
       or startup files that change the default FPU control word or other
       similar optimizations.
  
!      This option is not turned on by any `-O' option since it can
!      result in incorrect output for programs that depend on an exact
       implementation of IEEE or ISO rules/specifications for math
!      functions. It may, however, yield faster code for programs that do
       not require the guarantees of these specifications.  Enables
!      `-fno-signed-zeros', `-fno-trapping-math', `-fassociative-math'
!      and `-freciprocal-math'.
  
!      The default is `-fno-unsafe-math-optimizations'.
  
- `-fassociative-math'
       Allow re-association of operands in series of floating-point
       operations.  This violates the ISO C and C++ language standard by
!      possibly changing computation result.  NOTE: re-ordering may
!      change the sign of zero as well as ignore NaNs and inhibit or
!      create underflow or overflow (and thus cannot be used on code that
!      relies on rounding behavior like `(x + 2**52) - 2**52'.  May also
!      reorder floating-point comparisons and thus may not be used when
!      ordered comparisons are required.  This option requires that both
!      `-fno-signed-zeros' and `-fno-trapping-math' be in effect.
!      Moreover, it doesn't make much sense with `-frounding-math'. For
       Fortran the option is automatically enabled when both
!      `-fno-signed-zeros' and `-fno-trapping-math' are in effect.
  
!      The default is `-fno-associative-math'.
  
- `-freciprocal-math'
       Allow the reciprocal of a value to be used instead of dividing by
!      the value if this enables optimizations.  For example `x / y' can
!      be replaced with `x * (1/y)', which is useful if `(1/y)' is
!      subject to common subexpression elimination.  Note that this loses
       precision and increases the number of flops operating on the value.
  
!      The default is `-fno-reciprocal-math'.
  
! `-ffinite-math-only'
       Allow optimizations for floating-point arithmetic that assume that
       arguments and results are not NaNs or +-Infs.
  
!      This option is not turned on by any `-O' option since it can
!      result in incorrect output for programs that depend on an exact
       implementation of IEEE or ISO rules/specifications for math
!      functions. It may, however, yield faster code for programs that do
       not require the guarantees of these specifications.
  
!      The default is `-fno-finite-math-only'.
  
! `-fno-signed-zeros'
       Allow optimizations for floating-point arithmetic that ignore the
       signedness of zero.  IEEE arithmetic specifies the behavior of
       distinct +0.0 and -0.0 values, which then prohibits simplification
       of expressions such as x+0.0 or 0.0*x (even with
!      `-ffinite-math-only').  This option implies that the sign of a
!      zero result isn't significant.
  
!      The default is `-fsigned-zeros'.
  
! `-fno-trapping-math'
       Compile code assuming that floating-point operations cannot
!      generate user-visible traps.  These traps include division by
!      zero, overflow, underflow, inexact result and invalid operation.
!      This option requires that `-fno-signaling-nans' be in effect.
!      Setting this option may allow faster code if one relies on
!      "non-stop" IEEE arithmetic, for example.
  
!      This option should never be turned on by any `-O' option since it
!      can result in incorrect output for programs that depend on an
!      exact implementation of IEEE or ISO rules/specifications for math
       functions.
  
!      The default is `-ftrapping-math'.
  
! `-frounding-math'
       Disable transformations and optimizations that assume default
       floating-point rounding behavior.  This is round-to-zero for all
!      floating point to integer conversions, and round-to-nearest for
!      all other arithmetic truncations.  This option should be specified
!      for programs that change the FP rounding mode dynamically, or that
!      may be executed with a non-default rounding mode.  This option
!      disables constant folding of floating-point expressions at compile
!      time (which may be affected by rounding mode) and arithmetic
       transformations that are unsafe in the presence of sign-dependent
       rounding modes.
  
!      The default is `-fno-rounding-math'.
  
       This option is experimental and does not currently guarantee to
       disable all GCC optimizations that are affected by rounding mode.
       Future versions of GCC may provide finer control of this setting
!      using C99's `FENV_ACCESS' pragma.  This command-line option will
!      be used to specify the default state for `FENV_ACCESS'.
  
! `-fsignaling-nans'
       Compile code assuming that IEEE signaling NaNs may generate
       user-visible traps during floating-point operations.  Setting this
       option disables optimizations that may change the number of
       exceptions visible with signaling NaNs.  This option implies
!      `-ftrapping-math'.
  
!      This option causes the preprocessor macro `__SUPPORT_SNAN__' to be
       defined.
  
!      The default is `-fno-signaling-nans'.
  
       This option is experimental and does not currently guarantee to
       disable all GCC optimizations that affect signaling NaN behavior.
  
! `-fsingle-precision-constant'
       Treat floating-point constants as single precision instead of
       implicitly converting them to double-precision constants.
  
! `-fcx-limited-range'
       When enabled, this option states that a range reduction step is not
       needed when performing complex division.  Also, there is no
!      checking whether the result of a complex multiplication or
!      division is `NaN + I*NaN', with an attempt to rescue the situation
!      in that case.  The default is `-fno-cx-limited-range', but is
!      enabled by `-ffast-math'.
  
       This option controls the default setting of the ISO C99
!      `CX_LIMITED_RANGE' pragma.  Nevertheless, the option applies to
!      all languages.
  
! `-fcx-fortran-rules'
       Complex multiplication and division follow Fortran rules.  Range
       reduction is done as part of complex division, but there is no
!      checking whether the result of a complex multiplication or
!      division is `NaN + I*NaN', with an attempt to rescue the situation
!      in that case.
! 
!      The default is `-fno-cx-fortran-rules'.
  
  
   The following options control optimizations that may improve
! performance, but are not enabled by any `-O' options.  This section
  includes experimental options that may produce broken code.
  
! `-fbranch-probabilities'
!      After running a program compiled with `-fprofile-arcs' (*note
!      Options for Debugging Your Program or `gcc': Debugging Options.),
!      you can compile it a second time using `-fbranch-probabilities',
!      to improve optimizations based on the number of times each branch
!      was taken.  When a program compiled with `-fprofile-arcs' exits,
!      it saves arc execution counts to a file called `SOURCENAME.gcda'
!      for each source file.  The information in this data file is very
       dependent on the structure of the generated code, so you must use
       the same source code and the same optimization options for both
       compilations.
  
!      With `-fbranch-probabilities', GCC puts a `REG_BR_PROB' note on
!      each `JUMP_INSN' and `CALL_INSN'.  These can be used to improve
       optimization.  Currently, they are only used in one place: in
!      `reorg.c', instead of guessing which path a branch is most likely
!      to take, the `REG_BR_PROB' values are used to exactly determine
       which path is taken more often.
  
! `-fprofile-values'
!      If combined with `-fprofile-arcs', it adds code so that some data
       about values of expressions in the program is gathered.
  
!      With `-fbranch-probabilities', it reads back the data gathered
!      from profiling values of expressions for usage in optimizations.
  
!      Enabled with `-fprofile-generate' and `-fprofile-use'.
  
! `-fprofile-reorder-functions'
!      Function reordering based on profile instrumentation collects
!      first time of execution of a function and orders these functions
!      in ascending order.
  
!      Enabled with `-fprofile-use'.
  
! `-fvpt'
!      If combined with `-fprofile-arcs', this option instructs the
       compiler to add code to gather information about values of
       expressions.
  
!      With `-fbranch-probabilities', it reads back the data gathered and
       actually performs the optimizations based on them.  Currently the
       optimizations include specialization of division operations using
       the knowledge about the value of the denominator.
  
! `-frename-registers'
       Attempt to avoid false dependencies in scheduled code by making use
       of registers left over after register allocation.  This
       optimization most benefits processors with lots of registers.
--- 8711,8977 ----
  floating-point arithmetic.  These options trade off between speed and
  correctness.  All must be specifically enabled.
  
! '-ffloat-store'
       Do not store floating-point variables in registers, and inhibit
       other options that might change whether a floating-point value is
       taken from a register or memory.
  
       This option prevents undesirable excess precision on machines such
       as the 68000 where the floating registers (of the 68881) keep more
!      precision than a 'double' is supposed to have.  Similarly for the
       x86 architecture.  For most programs, the excess precision does
       only good, but a few programs rely on the precise definition of
!      IEEE floating point.  Use '-ffloat-store' for such programs, after
       modifying them to store all pertinent intermediate computations
       into variables.
  
! '-fexcess-precision=STYLE'
       This option allows further control over excess precision on
       machines where floating-point registers have more precision than
!      the IEEE 'float' and 'double' types and the processor does not
       support operations rounding to those types.  By default,
!      '-fexcess-precision=fast' is in effect; this means that operations
       are carried out in the precision of the registers and that it is
       unpredictable when rounding to the types specified in the source
       code takes place.  When compiling C, if
!      '-fexcess-precision=standard' is specified then excess precision
       follows the rules specified in ISO C99; in particular, both casts
       and assignments cause values to be rounded to their semantic types
!      (whereas '-ffloat-store' only affects assignments).  This option is
!      enabled by default for C if a strict conformance option such as
!      '-std=c99' is used.
  
!      '-fexcess-precision=standard' is not implemented for languages
!      other than C, and has no effect if '-funsafe-math-optimizations' or
!      '-ffast-math' is specified.  On the x86, it also has no effect if
!      '-mfpmath=sse' or '-mfpmath=sse+387' is specified; in the former
!      case, IEEE semantics apply without excess precision, and in the
!      latter, rounding is unpredictable.
  
! '-ffast-math'
!      Sets the options '-fno-math-errno', '-funsafe-math-optimizations',
!      '-ffinite-math-only', '-fno-rounding-math', '-fno-signaling-nans'
!      and '-fcx-limited-range'.
  
!      This option causes the preprocessor macro '__FAST_MATH__' to be
       defined.
  
!      This option is not turned on by any '-O' option besides '-Ofast'
!      since it can result in incorrect output for programs that depend on
!      an exact implementation of IEEE or ISO rules/specifications for
!      math functions.  It may, however, yield faster code for programs
       that do not require the guarantees of these specifications.
  
! '-fno-math-errno'
!      Do not set 'errno' after calling math functions that are executed
!      with a single instruction, e.g., 'sqrt'.  A program that relies on
       IEEE exceptions for math error handling may want to use this flag
       for speed while maintaining IEEE arithmetic compatibility.
  
!      This option is not turned on by any '-O' option since it can result
!      in incorrect output for programs that depend on an exact
       implementation of IEEE or ISO rules/specifications for math
!      functions.  It may, however, yield faster code for programs that do
       not require the guarantees of these specifications.
  
!      The default is '-fmath-errno'.
  
!      On Darwin systems, the math library never sets 'errno'.  There is
       therefore no reason for the compiler to consider the possibility
!      that it might, and '-fno-math-errno' is the default.
! 
! '-funsafe-math-optimizations'
  
       Allow optimizations for floating-point arithmetic that (a) assume
       that arguments and results are valid and (b) may violate IEEE or
       ANSI standards.  When used at link-time, it may include libraries
       or startup files that change the default FPU control word or other
       similar optimizations.
  
!      This option is not turned on by any '-O' option since it can result
!      in incorrect output for programs that depend on an exact
       implementation of IEEE or ISO rules/specifications for math
!      functions.  It may, however, yield faster code for programs that do
       not require the guarantees of these specifications.  Enables
!      '-fno-signed-zeros', '-fno-trapping-math', '-fassociative-math' and
!      '-freciprocal-math'.
  
!      The default is '-fno-unsafe-math-optimizations'.
! 
! '-fassociative-math'
  
       Allow re-association of operands in series of floating-point
       operations.  This violates the ISO C and C++ language standard by
!      possibly changing computation result.  NOTE: re-ordering may change
!      the sign of zero as well as ignore NaNs and inhibit or create
!      underflow or overflow (and thus cannot be used on code that relies
!      on rounding behavior like '(x + 2**52) - 2**52'.  May also reorder
!      floating-point comparisons and thus may not be used when ordered
!      comparisons are required.  This option requires that both
!      '-fno-signed-zeros' and '-fno-trapping-math' be in effect.
!      Moreover, it doesn't make much sense with '-frounding-math'.  For
       Fortran the option is automatically enabled when both
!      '-fno-signed-zeros' and '-fno-trapping-math' are in effect.
  
!      The default is '-fno-associative-math'.
! 
! '-freciprocal-math'
  
       Allow the reciprocal of a value to be used instead of dividing by
!      the value if this enables optimizations.  For example 'x / y' can
!      be replaced with 'x * (1/y)', which is useful if '(1/y)' is subject
!      to common subexpression elimination.  Note that this loses
       precision and increases the number of flops operating on the value.
  
!      The default is '-fno-reciprocal-math'.
  
! '-ffinite-math-only'
       Allow optimizations for floating-point arithmetic that assume that
       arguments and results are not NaNs or +-Infs.
  
!      This option is not turned on by any '-O' option since it can result
!      in incorrect output for programs that depend on an exact
       implementation of IEEE or ISO rules/specifications for math
!      functions.  It may, however, yield faster code for programs that do
       not require the guarantees of these specifications.
  
!      The default is '-fno-finite-math-only'.
  
! '-fno-signed-zeros'
       Allow optimizations for floating-point arithmetic that ignore the
       signedness of zero.  IEEE arithmetic specifies the behavior of
       distinct +0.0 and -0.0 values, which then prohibits simplification
       of expressions such as x+0.0 or 0.0*x (even with
!      '-ffinite-math-only').  This option implies that the sign of a zero
!      result isn't significant.
  
!      The default is '-fsigned-zeros'.
  
! '-fno-trapping-math'
       Compile code assuming that floating-point operations cannot
!      generate user-visible traps.  These traps include division by zero,
!      overflow, underflow, inexact result and invalid operation.  This
!      option requires that '-fno-signaling-nans' be in effect.  Setting
!      this option may allow faster code if one relies on "non-stop" IEEE
!      arithmetic, for example.
  
!      This option should never be turned on by any '-O' option since it
!      can result in incorrect output for programs that depend on an exact
!      implementation of IEEE or ISO rules/specifications for math
       functions.
  
!      The default is '-ftrapping-math'.
  
! '-frounding-math'
       Disable transformations and optimizations that assume default
       floating-point rounding behavior.  This is round-to-zero for all
!      floating point to integer conversions, and round-to-nearest for all
!      other arithmetic truncations.  This option should be specified for
!      programs that change the FP rounding mode dynamically, or that may
!      be executed with a non-default rounding mode.  This option disables
!      constant folding of floating-point expressions at compile time
!      (which may be affected by rounding mode) and arithmetic
       transformations that are unsafe in the presence of sign-dependent
       rounding modes.
  
!      The default is '-fno-rounding-math'.
  
       This option is experimental and does not currently guarantee to
       disable all GCC optimizations that are affected by rounding mode.
       Future versions of GCC may provide finer control of this setting
!      using C99's 'FENV_ACCESS' pragma.  This command-line option will be
!      used to specify the default state for 'FENV_ACCESS'.
  
! '-fsignaling-nans'
       Compile code assuming that IEEE signaling NaNs may generate
       user-visible traps during floating-point operations.  Setting this
       option disables optimizations that may change the number of
       exceptions visible with signaling NaNs.  This option implies
!      '-ftrapping-math'.
  
!      This option causes the preprocessor macro '__SUPPORT_SNAN__' to be
       defined.
  
!      The default is '-fno-signaling-nans'.
  
       This option is experimental and does not currently guarantee to
       disable all GCC optimizations that affect signaling NaN behavior.
  
! '-fsingle-precision-constant'
       Treat floating-point constants as single precision instead of
       implicitly converting them to double-precision constants.
  
! '-fcx-limited-range'
       When enabled, this option states that a range reduction step is not
       needed when performing complex division.  Also, there is no
!      checking whether the result of a complex multiplication or division
!      is 'NaN + I*NaN', with an attempt to rescue the situation in that
!      case.  The default is '-fno-cx-limited-range', but is enabled by
!      '-ffast-math'.
  
       This option controls the default setting of the ISO C99
!      'CX_LIMITED_RANGE' pragma.  Nevertheless, the option applies to all
!      languages.
  
! '-fcx-fortran-rules'
       Complex multiplication and division follow Fortran rules.  Range
       reduction is done as part of complex division, but there is no
!      checking whether the result of a complex multiplication or division
!      is 'NaN + I*NaN', with an attempt to rescue the situation in that
!      case.
  
+      The default is '-fno-cx-fortran-rules'.
  
   The following options control optimizations that may improve
! performance, but are not enabled by any '-O' options.  This section
  includes experimental options that may produce broken code.
  
! '-fbranch-probabilities'
!      After running a program compiled with '-fprofile-arcs' (*note
!      Options for Debugging Your Program or 'gcc': Debugging Options.),
!      you can compile it a second time using '-fbranch-probabilities', to
!      improve optimizations based on the number of times each branch was
!      taken.  When a program compiled with '-fprofile-arcs' exits, it
!      saves arc execution counts to a file called 'SOURCENAME.gcda' for
!      each source file.  The information in this data file is very
       dependent on the structure of the generated code, so you must use
       the same source code and the same optimization options for both
       compilations.
  
!      With '-fbranch-probabilities', GCC puts a 'REG_BR_PROB' note on
!      each 'JUMP_INSN' and 'CALL_INSN'.  These can be used to improve
       optimization.  Currently, they are only used in one place: in
!      'reorg.c', instead of guessing which path a branch is most likely
!      to take, the 'REG_BR_PROB' values are used to exactly determine
       which path is taken more often.
  
! '-fprofile-values'
!      If combined with '-fprofile-arcs', it adds code so that some data
       about values of expressions in the program is gathered.
  
!      With '-fbranch-probabilities', it reads back the data gathered from
!      profiling values of expressions for usage in optimizations.
  
!      Enabled with '-fprofile-generate' and '-fprofile-use'.
  
! '-fprofile-reorder-functions'
!      Function reordering based on profile instrumentation collects first
!      time of execution of a function and orders these functions in
!      ascending order.
  
!      Enabled with '-fprofile-use'.
  
! '-fvpt'
!      If combined with '-fprofile-arcs', this option instructs the
       compiler to add code to gather information about values of
       expressions.
  
!      With '-fbranch-probabilities', it reads back the data gathered and
       actually performs the optimizations based on them.  Currently the
       optimizations include specialization of division operations using
       the knowledge about the value of the denominator.
  
! '-frename-registers'
       Attempt to avoid false dependencies in scheduled code by making use
       of registers left over after register allocation.  This
       optimization most benefits processors with lots of registers.
*************** includes experimental options that may p
*** 9035,9092 ****
       however, it can make debugging impossible, since variables no
       longer stay in a "home register".
  
!      Enabled by default with `-funroll-loops' and `-fpeel-loops'.
  
! `-fschedule-fusion'
       Performs a target dependent pass over the instruction stream to
       schedule instructions of same type together because target machine
       can execute them more efficiently if they are adjacent to each
       other in the instruction flow.
  
!      Enabled at levels `-O2', `-O3', `-Os'.
  
! `-ftracer'
       Perform tail duplication to enlarge superblock size.  This
!      transformation simplifies the control flow of the function
!      allowing other optimizations to do a better job.
  
!      Enabled with `-fprofile-use'.
  
! `-funroll-loops'
       Unroll loops whose number of iterations can be determined at
!      compile time or upon entry to the loop.  `-funroll-loops' implies
!      `-frerun-cse-after-loop', `-fweb' and `-frename-registers'.  It
!      also turns on complete loop peeling (i.e. complete removal of
!      loops with a small constant number of iterations).  This option
!      makes code larger, and may or may not make it run faster.
  
!      Enabled with `-fprofile-use'.
  
! `-funroll-all-loops'
       Unroll all loops, even if their number of iterations is uncertain
       when the loop is entered.  This usually makes programs run more
!      slowly.  `-funroll-all-loops' implies the same options as
!      `-funroll-loops'.
  
! `-fpeel-loops'
       Peels loops for which there is enough information that they do not
       roll much (from profile feedback).  It also turns on complete loop
       peeling (i.e. complete removal of loops with small constant number
       of iterations).
  
!      Enabled with `-fprofile-use'.
  
! `-fmove-loop-invariants'
       Enables the loop invariant motion pass in the RTL loop optimizer.
!      Enabled at level `-O1'
  
! `-funswitch-loops'
       Move branches with loop invariant conditions out of the loop, with
       duplicates of the loop on both branches (modified according to
       result of the condition).
  
! `-ffunction-sections'
! `-fdata-sections'
       Place each function or data item into its own section in the output
       file if the target supports arbitrary sections.  The name of the
       function or the name of the data item determines the section's name
--- 8979,9036 ----
       however, it can make debugging impossible, since variables no
       longer stay in a "home register".
  
!      Enabled by default with '-funroll-loops' and '-fpeel-loops'.
  
! '-fschedule-fusion'
       Performs a target dependent pass over the instruction stream to
       schedule instructions of same type together because target machine
       can execute them more efficiently if they are adjacent to each
       other in the instruction flow.
  
!      Enabled at levels '-O2', '-O3', '-Os'.
  
! '-ftracer'
       Perform tail duplication to enlarge superblock size.  This
!      transformation simplifies the control flow of the function allowing
!      other optimizations to do a better job.
  
!      Enabled with '-fprofile-use'.
  
! '-funroll-loops'
       Unroll loops whose number of iterations can be determined at
!      compile time or upon entry to the loop.  '-funroll-loops' implies
!      '-frerun-cse-after-loop', '-fweb' and '-frename-registers'.  It
!      also turns on complete loop peeling (i.e. complete removal of loops
!      with a small constant number of iterations).  This option makes
!      code larger, and may or may not make it run faster.
  
!      Enabled with '-fprofile-use'.
  
! '-funroll-all-loops'
       Unroll all loops, even if their number of iterations is uncertain
       when the loop is entered.  This usually makes programs run more
!      slowly.  '-funroll-all-loops' implies the same options as
!      '-funroll-loops'.
  
! '-fpeel-loops'
       Peels loops for which there is enough information that they do not
       roll much (from profile feedback).  It also turns on complete loop
       peeling (i.e. complete removal of loops with small constant number
       of iterations).
  
!      Enabled with '-fprofile-use'.
  
! '-fmove-loop-invariants'
       Enables the loop invariant motion pass in the RTL loop optimizer.
!      Enabled at level '-O1'
  
! '-funswitch-loops'
       Move branches with loop invariant conditions out of the loop, with
       duplicates of the loop on both branches (modified according to
       result of the condition).
  
! '-ffunction-sections'
! '-fdata-sections'
       Place each function or data item into its own section in the output
       file if the target supports arbitrary sections.  The name of the
       function or the name of the data item determines the section's name
*************** includes experimental options that may p
*** 9100,9163 ****
  
       Only use these options when there are significant benefits from
       doing so.  When you specify these options, the assembler and linker
!      create larger object and executable files and are also slower.
!      You cannot use `gprof' on all systems if you specify this option,
!      and you may have problems with debugging if you specify both this
!      option and `-g'.
  
! `-fbranch-target-load-optimize'
       Perform branch target register load optimization before prologue /
       epilogue threading.  The use of target registers can typically be
       exposed only during reload, thus hoisting loads out of loops and
       doing inter-block scheduling needs a separate optimization pass.
  
! `-fbranch-target-load-optimize2'
       Perform branch target register load optimization after prologue /
       epilogue threading.
  
! `-fbtr-bb-exclusive'
       When performing branch target register load optimization, don't
       reuse branch target registers within any basic block.
  
! `-fstack-protector'
       Emit extra code to check for buffer overflows, such as stack
       smashing attacks.  This is done by adding a guard variable to
       functions with vulnerable objects.  This includes functions that
!      call `alloca', and functions with buffers larger than 8 bytes.
!      The guards are initialized when a function is entered and then
!      checked when the function exits.  If a guard check fails, an error
!      message is printed and the program exits.
  
! `-fstack-protector-all'
!      Like `-fstack-protector' except that all functions are protected.
  
! `-fstack-protector-strong'
!      Like `-fstack-protector' but includes additional functions to be
       protected -- those that have local array definitions, or have
       references to local frame addresses.
  
! `-fstack-protector-explicit'
!      Like `-fstack-protector' but only protects those functions which
!      have the `stack_protect' attribute
  
! `-fstdarg-opt'
       Optimize the prologue of variadic argument functions with respect
       to usage of those arguments.
  
! `-fsection-anchors'
       Try to reduce the number of symbolic address calculations by using
       shared "anchor" symbols to address nearby objects.  This
!      transformation can help to reduce the number of GOT entries and
!      GOT accesses on some targets.
  
!      For example, the implementation of the following function `foo':
  
            static int a, b, c;
            int foo (void) { return a + b + c; }
  
       usually calculates the addresses of all three variables, but if you
!      compile it with `-fsection-anchors', it accesses the variables
!      from a common anchor point instead.  The effect is similar to the
       following pseudocode (which isn't valid C):
  
            int foo (void)
--- 9044,9107 ----
  
       Only use these options when there are significant benefits from
       doing so.  When you specify these options, the assembler and linker
!      create larger object and executable files and are also slower.  You
!      cannot use 'gprof' on all systems if you specify this option, and
!      you may have problems with debugging if you specify both this
!      option and '-g'.
  
! '-fbranch-target-load-optimize'
       Perform branch target register load optimization before prologue /
       epilogue threading.  The use of target registers can typically be
       exposed only during reload, thus hoisting loads out of loops and
       doing inter-block scheduling needs a separate optimization pass.
  
! '-fbranch-target-load-optimize2'
       Perform branch target register load optimization after prologue /
       epilogue threading.
  
! '-fbtr-bb-exclusive'
       When performing branch target register load optimization, don't
       reuse branch target registers within any basic block.
  
! '-fstack-protector'
       Emit extra code to check for buffer overflows, such as stack
       smashing attacks.  This is done by adding a guard variable to
       functions with vulnerable objects.  This includes functions that
!      call 'alloca', and functions with buffers larger than 8 bytes.  The
!      guards are initialized when a function is entered and then checked
!      when the function exits.  If a guard check fails, an error message
!      is printed and the program exits.
  
! '-fstack-protector-all'
!      Like '-fstack-protector' except that all functions are protected.
  
! '-fstack-protector-strong'
!      Like '-fstack-protector' but includes additional functions to be
       protected -- those that have local array definitions, or have
       references to local frame addresses.
  
! '-fstack-protector-explicit'
!      Like '-fstack-protector' but only protects those functions which
!      have the 'stack_protect' attribute
  
! '-fstdarg-opt'
       Optimize the prologue of variadic argument functions with respect
       to usage of those arguments.
  
! '-fsection-anchors'
       Try to reduce the number of symbolic address calculations by using
       shared "anchor" symbols to address nearby objects.  This
!      transformation can help to reduce the number of GOT entries and GOT
!      accesses on some targets.
  
!      For example, the implementation of the following function 'foo':
  
            static int a, b, c;
            int foo (void) { return a + b + c; }
  
       usually calculates the addresses of all three variables, but if you
!      compile it with '-fsection-anchors', it accesses the variables from
!      a common anchor point instead.  The effect is similar to the
       following pseudocode (which isn't valid C):
  
            int foo (void)
*************** includes experimental options that may p
*** 9168,9179 ****
  
       Not all targets support this option.
  
! `--param NAME=VALUE'
       In some places, GCC uses various constants to control the amount of
       optimization that is done.  For example, GCC does not inline
       functions that contain more than a certain number of instructions.
       You can control some of these constants on the command line using
!      the `--param' option.
  
       The names of specific parameters, and the meaning of the values,
       are tied to the internals of the compiler, and are subject to
--- 9112,9123 ----
  
       Not all targets support this option.
  
! '--param NAME=VALUE'
       In some places, GCC uses various constants to control the amount of
       optimization that is done.  For example, GCC does not inline
       functions that contain more than a certain number of instructions.
       You can control some of these constants on the command line using
!      the '--param' option.
  
       The names of specific parameters, and the meaning of the values,
       are tied to the internals of the compiler, and are subject to
*************** includes experimental options that may p
*** 9182,9213 ****
       In each case, the VALUE is an integer.  The allowable choices for
       NAME are:
  
!     `predictable-branch-outcome'
            When branch is predicted to be taken with probability lower
            than this threshold (in percent), then it is considered well
!           predictable. The default is 10.
  
!     `max-crossjump-edges'
            The maximum number of incoming edges to consider for
!           cross-jumping.  The algorithm used by `-fcrossjumping' is
            O(N^2) in the number of edges incoming to each block.
            Increasing values mean more aggressive optimization, making
            the compilation time increase with probably small improvement
            in executable size.
  
!     `min-crossjump-insns'
!           The minimum number of instructions that must be matched at
!           the end of two blocks before cross-jumping is performed on
!           them.  This value is ignored in the case where all
!           instructions in the block being cross-jumped from are
!           matched.  The default value is 5.
  
!     `max-grow-copy-bb-insns'
            The maximum code size expansion factor when copying basic
            blocks instead of jumping.  The expansion is relative to a
            jump instruction.  The default value is 8.
  
!     `max-goto-duplication-insns'
            The maximum number of instructions to duplicate to a block
            that jumps to a computed goto.  To avoid O(N^2) behavior in a
            number of passes, GCC factors computed gotos early in the
--- 9126,9157 ----
       In each case, the VALUE is an integer.  The allowable choices for
       NAME are:
  
!      'predictable-branch-outcome'
            When branch is predicted to be taken with probability lower
            than this threshold (in percent), then it is considered well
!           predictable.  The default is 10.
  
!      'max-crossjump-edges'
            The maximum number of incoming edges to consider for
!           cross-jumping.  The algorithm used by '-fcrossjumping' is
            O(N^2) in the number of edges incoming to each block.
            Increasing values mean more aggressive optimization, making
            the compilation time increase with probably small improvement
            in executable size.
  
!      'min-crossjump-insns'
!           The minimum number of instructions that must be matched at the
!           end of two blocks before cross-jumping is performed on them.
!           This value is ignored in the case where all instructions in
!           the block being cross-jumped from are matched.  The default
!           value is 5.
  
!      'max-grow-copy-bb-insns'
            The maximum code size expansion factor when copying basic
            blocks instead of jumping.  The expansion is relative to a
            jump instruction.  The default value is 8.
  
!      'max-goto-duplication-insns'
            The maximum number of instructions to duplicate to a block
            that jumps to a computed goto.  To avoid O(N^2) behavior in a
            number of passes, GCC factors computed gotos early in the
*************** includes experimental options that may p
*** 9216,9222 ****
            than max-goto-duplication-insns are unfactored.  The default
            value is 8.
  
!     `max-delay-slot-insn-search'
            The maximum number of instructions to consider when looking
            for an instruction to fill a delay slot.  If more than this
            arbitrary number of instructions are searched, the time
--- 9160,9166 ----
            than max-goto-duplication-insns are unfactored.  The default
            value is 8.
  
!      'max-delay-slot-insn-search'
            The maximum number of instructions to consider when looking
            for an instruction to fill a delay slot.  If more than this
            arbitrary number of instructions are searched, the time
*************** includes experimental options that may p
*** 9225,9413 ****
            optimization, making the compilation time increase with
            probably small improvement in execution time.
  
!     `max-delay-slot-live-search'
            When trying to fill delay slots, the maximum number of
!           instructions to consider when searching for a block with
!           valid live register information.  Increasing this arbitrarily
!           chosen value means more aggressive optimization, increasing
!           the compilation time.  This parameter should be removed when
!           the delay slot code is rewritten to maintain the control-flow
            graph.
  
!     `max-gcse-memory'
!           The approximate maximum amount of memory that can be
!           allocated in order to perform the global common subexpression
            elimination optimization.  If more memory than specified is
            required, the optimization is not done.
  
!     `max-gcse-insertion-ratio'
            If the ratio of expression insertions to deletions is larger
            than this value for any expression, then RTL PRE inserts or
            removes the expression and thus leaves partially redundant
            computations in the instruction stream.  The default value is
            20.
  
!     `max-pending-list-length'
            The maximum number of pending dependencies scheduling allows
            before flushing the current state and starting over.  Large
            functions with few branches or calls can create excessively
            large lists which needlessly consume memory and resources.
  
!     `max-modulo-backtrack-attempts'
            The maximum number of backtrack attempts the scheduler should
            make when modulo scheduling a loop.  Larger values can
            exponentially increase compilation time.
  
!     `max-inline-insns-single'
!           Several parameters control the tree inliner used in GCC.
!           This number sets the maximum number of instructions (counted
!           in GCC's internal representation) in a single function that
!           the tree inliner considers for inlining.  This only affects
            functions declared inline and methods implemented in a class
            declaration (C++).  The default value is 400.
  
!     `max-inline-insns-auto'
!           When you use `-finline-functions' (included in `-O3'), a lot
            of functions that would otherwise not be considered for
            inlining by the compiler are investigated.  To those
            functions, a different (more restrictive) limit compared to
            functions declared inline can be applied.  The default value
            is 40.
  
!     `inline-min-speedup'
            When estimated performance improvement of caller + callee
            runtime exceeds this threshold (in precent), the function can
!           be inlined regardless the limit on `--param
!           max-inline-insns-single' and `--param max-inline-insns-auto'.
  
!     `large-function-insns'
            The limit specifying really large functions.  For functions
!           larger than this limit after inlining, inlining is
!           constrained by `--param large-function-growth'.  This
!           parameter is useful primarily to avoid extreme compilation
!           time caused by non-linear algorithms used by the back end.
!           The default value is 2700.
  
!     `large-function-growth'
            Specifies maximal growth of large function caused by inlining
            in percents.  The default value is 100 which limits large
            function growth to 2.0 times the original size.
  
!     `large-unit-insns'
!           The limit specifying large translation unit.  Growth caused
!           by inlining of units larger than this limit is limited by
!           `--param inline-unit-growth'.  For small units this might be
            too tight.  For example, consider a unit consisting of
!           function A that is inline and B that just calls A three
!           times.  If B is small relative to A, the growth of unit is
!           300\% and yet such inlining is very sane.  For very large
!           units consisting of small inlineable functions, however, the
!           overall unit growth limit is needed to avoid exponential
!           explosion of code size.  Thus for smaller units, the size is
!           increased to `--param large-unit-insns' before applying
!           `--param inline-unit-growth'.  The default is 10000.
  
!     `inline-unit-growth'
            Specifies maximal overall growth of the compilation unit
!           caused by inlining.  The default value is 20 which limits
!           unit growth to 1.2 times the original size. Cold functions
!           (either marked cold via an attribute or by profile feedback)
!           are not accounted into the unit size.
  
!     `ipcp-unit-growth'
            Specifies maximal overall growth of the compilation unit
            caused by interprocedural constant propagation.  The default
!           value is 10 which limits unit growth to 1.1 times the
!           original size.
  
!     `large-stack-frame'
            The limit specifying large stack frames.  While inlining the
!           algorithm is trying to not grow past this limit too much.
!           The default value is 256 bytes.
  
!     `large-stack-frame-growth'
            Specifies maximal growth of large stack frames caused by
            inlining in percents.  The default value is 1000 which limits
            large stack frame growth to 11 times the original size.
  
!     `max-inline-insns-recursive'
!     `max-inline-insns-recursive-auto'
            Specifies the maximum number of instructions an out-of-line
            copy of a self-recursive inline function can grow into by
            performing recursive inlining.
  
!           `--param max-inline-insns-recursive' applies to functions
!           declared inline.  For functions not declared inline,
!           recursive inlining happens only when `-finline-functions'
!           (included in `-O3') is enabled; `--param
!           max-inline-insns-recursive-auto' applies instead.  The
!           default value is 450.
  
!     `max-inline-recursive-depth'
!     `max-inline-recursive-depth-auto'
            Specifies the maximum recursion depth used for recursive
            inlining.
  
!           `--param max-inline-recursive-depth' applies to functions
!           declared inline.  For functions not declared inline,
!           recursive inlining happens only when `-finline-functions'
!           (included in `-O3') is enabled; `--param
!           max-inline-recursive-depth-auto' applies instead.  The
!           default value is 8.
  
!     `min-inline-recursive-probability'
!           Recursive inlining is profitable only for function having
!           deep recursion in average and can hurt for function having
!           little recursion depth by increasing the prologue size or
!           complexity of function body to other optimizers.
  
!           When profile feedback is available (see `-fprofile-generate')
            the actual recursion depth can be guessed from probability
            that function recurses via a given call expression.  This
            parameter limits inlining only to call expressions whose
            probability exceeds the given threshold (in percents).  The
            default value is 10.
  
!     `early-inlining-insns'
            Specify growth that the early inliner can make.  In effect it
            increases the amount of inlining for code having a large
            abstraction penalty.  The default value is 14.
  
!     `max-early-inliner-iterations'
            Limit of iterations of the early inliner.  This basically
            bounds the number of nested indirect calls the early inliner
            can resolve.  Deeper chains are still handled by late
            inlining.
  
!     `comdat-sharing-probability'
            Probability (in percent) that C++ inline function with comdat
            visibility are shared across multiple compilation units.  The
            default value is 20.
  
!     `profile-func-internal-id'
            A parameter to control whether to use function internal id in
!           profile database lookup. If the value is 0, the compiler uses
            an id that is based on function assembler name and filename,
            which makes old profile data more tolerant to source changes
            such as function reordering etc.  The default value is 0.
  
!     `min-vect-loop-bound'
            The minimum number of iterations under which loops are not
!           vectorized when `-ftree-vectorize' is used.  The number of
            iterations after vectorization needs to be greater than the
            value specified by this option to allow vectorization.  The
            default value is 0.
  
!     `gcse-cost-distance-ratio'
            Scaling factor in calculation of maximum distance an
            expression can be moved by GCSE optimizations.  This is
            currently supported only in the code hoisting pass.  The
            bigger the ratio, the more aggressive code hoisting is with
            simple expressions, i.e., the expressions that have cost less
!           than `gcse-unrestricted-cost'.  Specifying 0 disables
!           hoisting of simple expressions.  The default value is 10.
  
!     `gcse-unrestricted-cost'
            Cost, roughly measured as the cost of a single typical machine
            instruction, at which GCSE optimizations do not constrain the
            distance an expression can travel.  This is currently
--- 9169,9355 ----
            optimization, making the compilation time increase with
            probably small improvement in execution time.
  
!      'max-delay-slot-live-search'
            When trying to fill delay slots, the maximum number of
!           instructions to consider when searching for a block with valid
!           live register information.  Increasing this arbitrarily chosen
!           value means more aggressive optimization, increasing the
!           compilation time.  This parameter should be removed when the
!           delay slot code is rewritten to maintain the control-flow
            graph.
  
!      'max-gcse-memory'
!           The approximate maximum amount of memory that can be allocated
!           in order to perform the global common subexpression
            elimination optimization.  If more memory than specified is
            required, the optimization is not done.
  
!      'max-gcse-insertion-ratio'
            If the ratio of expression insertions to deletions is larger
            than this value for any expression, then RTL PRE inserts or
            removes the expression and thus leaves partially redundant
            computations in the instruction stream.  The default value is
            20.
  
!      'max-pending-list-length'
            The maximum number of pending dependencies scheduling allows
            before flushing the current state and starting over.  Large
            functions with few branches or calls can create excessively
            large lists which needlessly consume memory and resources.
  
!      'max-modulo-backtrack-attempts'
            The maximum number of backtrack attempts the scheduler should
            make when modulo scheduling a loop.  Larger values can
            exponentially increase compilation time.
  
!      'max-inline-insns-single'
!           Several parameters control the tree inliner used in GCC.  This
!           number sets the maximum number of instructions (counted in
!           GCC's internal representation) in a single function that the
!           tree inliner considers for inlining.  This only affects
            functions declared inline and methods implemented in a class
            declaration (C++).  The default value is 400.
  
!      'max-inline-insns-auto'
!           When you use '-finline-functions' (included in '-O3'), a lot
            of functions that would otherwise not be considered for
            inlining by the compiler are investigated.  To those
            functions, a different (more restrictive) limit compared to
            functions declared inline can be applied.  The default value
            is 40.
  
!      'inline-min-speedup'
            When estimated performance improvement of caller + callee
            runtime exceeds this threshold (in precent), the function can
!           be inlined regardless the limit on '--param
!           max-inline-insns-single' and '--param max-inline-insns-auto'.
  
!      'large-function-insns'
            The limit specifying really large functions.  For functions
!           larger than this limit after inlining, inlining is constrained
!           by '--param large-function-growth'.  This parameter is useful
!           primarily to avoid extreme compilation time caused by
!           non-linear algorithms used by the back end.  The default value
!           is 2700.
  
!      'large-function-growth'
            Specifies maximal growth of large function caused by inlining
            in percents.  The default value is 100 which limits large
            function growth to 2.0 times the original size.
  
!      'large-unit-insns'
!           The limit specifying large translation unit.  Growth caused by
!           inlining of units larger than this limit is limited by
!           '--param inline-unit-growth'.  For small units this might be
            too tight.  For example, consider a unit consisting of
!           function A that is inline and B that just calls A three times.
!           If B is small relative to A, the growth of unit is 300\% and
!           yet such inlining is very sane.  For very large units
!           consisting of small inlineable functions, however, the overall
!           unit growth limit is needed to avoid exponential explosion of
!           code size.  Thus for smaller units, the size is increased to
!           '--param large-unit-insns' before applying '--param
!           inline-unit-growth'.  The default is 10000.
  
!      'inline-unit-growth'
            Specifies maximal overall growth of the compilation unit
!           caused by inlining.  The default value is 20 which limits unit
!           growth to 1.2 times the original size.  Cold functions (either
!           marked cold via an attribute or by profile feedback) are not
!           accounted into the unit size.
  
!      'ipcp-unit-growth'
            Specifies maximal overall growth of the compilation unit
            caused by interprocedural constant propagation.  The default
!           value is 10 which limits unit growth to 1.1 times the original
!           size.
  
!      'large-stack-frame'
            The limit specifying large stack frames.  While inlining the
!           algorithm is trying to not grow past this limit too much.  The
!           default value is 256 bytes.
  
!      'large-stack-frame-growth'
            Specifies maximal growth of large stack frames caused by
            inlining in percents.  The default value is 1000 which limits
            large stack frame growth to 11 times the original size.
  
!      'max-inline-insns-recursive'
!      'max-inline-insns-recursive-auto'
            Specifies the maximum number of instructions an out-of-line
            copy of a self-recursive inline function can grow into by
            performing recursive inlining.
  
!           '--param max-inline-insns-recursive' applies to functions
!           declared inline.  For functions not declared inline, recursive
!           inlining happens only when '-finline-functions' (included in
!           '-O3') is enabled; '--param max-inline-insns-recursive-auto'
!           applies instead.  The default value is 450.
  
!      'max-inline-recursive-depth'
!      'max-inline-recursive-depth-auto'
            Specifies the maximum recursion depth used for recursive
            inlining.
  
!           '--param max-inline-recursive-depth' applies to functions
!           declared inline.  For functions not declared inline, recursive
!           inlining happens only when '-finline-functions' (included in
!           '-O3') is enabled; '--param max-inline-recursive-depth-auto'
!           applies instead.  The default value is 8.
  
!      'min-inline-recursive-probability'
!           Recursive inlining is profitable only for function having deep
!           recursion in average and can hurt for function having little
!           recursion depth by increasing the prologue size or complexity
!           of function body to other optimizers.
  
!           When profile feedback is available (see '-fprofile-generate')
            the actual recursion depth can be guessed from probability
            that function recurses via a given call expression.  This
            parameter limits inlining only to call expressions whose
            probability exceeds the given threshold (in percents).  The
            default value is 10.
  
!      'early-inlining-insns'
            Specify growth that the early inliner can make.  In effect it
            increases the amount of inlining for code having a large
            abstraction penalty.  The default value is 14.
  
!      'max-early-inliner-iterations'
            Limit of iterations of the early inliner.  This basically
            bounds the number of nested indirect calls the early inliner
            can resolve.  Deeper chains are still handled by late
            inlining.
  
!      'comdat-sharing-probability'
            Probability (in percent) that C++ inline function with comdat
            visibility are shared across multiple compilation units.  The
            default value is 20.
  
!      'profile-func-internal-id'
            A parameter to control whether to use function internal id in
!           profile database lookup.  If the value is 0, the compiler uses
            an id that is based on function assembler name and filename,
            which makes old profile data more tolerant to source changes
            such as function reordering etc.  The default value is 0.
  
!      'min-vect-loop-bound'
            The minimum number of iterations under which loops are not
!           vectorized when '-ftree-vectorize' is used.  The number of
            iterations after vectorization needs to be greater than the
            value specified by this option to allow vectorization.  The
            default value is 0.
  
!      'gcse-cost-distance-ratio'
            Scaling factor in calculation of maximum distance an
            expression can be moved by GCSE optimizations.  This is
            currently supported only in the code hoisting pass.  The
            bigger the ratio, the more aggressive code hoisting is with
            simple expressions, i.e., the expressions that have cost less
!           than 'gcse-unrestricted-cost'.  Specifying 0 disables hoisting
!           of simple expressions.  The default value is 10.
  
!      'gcse-unrestricted-cost'
            Cost, roughly measured as the cost of a single typical machine
            instruction, at which GCSE optimizations do not constrain the
            distance an expression can travel.  This is currently
*************** includes experimental options that may p
*** 9416,9565 ****
            allows all expressions to travel unrestricted distances.  The
            default value is 3.
  
!     `max-hoist-depth'
            The depth of search in the dominator tree for expressions to
            hoist.  This is used to avoid quadratic behavior in hoisting
            algorithm.  The value of 0 does not limit on the search, but
            may slow down compilation of huge functions.  The default
            value is 30.
  
!     `max-tail-merge-comparisons'
            The maximum amount of similar bbs to compare a bb with.  This
!           is used to avoid quadratic behavior in tree tail merging.
!           The default value is 10.
  
!     `max-tail-merge-iterations'
            The maximum amount of iterations of the pass over the
!           function.  This is used to limit compilation time in tree
!           tail merging.  The default value is 2.
  
!     `max-unrolled-insns'
            The maximum number of instructions that a loop may have to be
            unrolled.  If a loop is unrolled, this parameter also
            determines how many times the loop code is unrolled.
  
!     `max-average-unrolled-insns'
            The maximum number of instructions biased by probabilities of
            their execution that a loop may have to be unrolled.  If a
            loop is unrolled, this parameter also determines how many
            times the loop code is unrolled.
  
!     `max-unroll-times'
            The maximum number of unrollings of a single loop.
  
!     `max-peeled-insns'
            The maximum number of instructions that a loop may have to be
            peeled.  If a loop is peeled, this parameter also determines
            how many times the loop code is peeled.
  
!     `max-peel-times'
            The maximum number of peelings of a single loop.
  
!     `max-peel-branches'
            The maximum number of branches on the hot path through the
            peeled sequence.
  
!     `max-completely-peeled-insns'
            The maximum number of insns of a completely peeled loop.
  
!     `max-completely-peel-times'
            The maximum number of iterations of a loop to be suitable for
            complete peeling.
  
!     `max-completely-peel-loop-nest-depth'
            The maximum depth of a loop nest suitable for complete
            peeling.
  
!     `max-unswitch-insns'
            The maximum number of insns of an unswitched loop.
  
!     `max-unswitch-level'
            The maximum number of branches unswitched in a single loop.
  
!     `lim-expensive'
            The minimum cost of an expensive expression in the loop
            invariant motion.
  
!     `iv-consider-all-candidates-bound'
            Bound on number of candidates for induction variables, below
            which all candidates are considered for each use in induction
            variable optimizations.  If there are more candidates than
            this, only the most relevant ones are considered to avoid
            quadratic time complexity.
  
!     `iv-max-considered-uses'
            The induction variable optimizations give up on loops that
            contain more induction variable uses.
  
!     `iv-always-prune-cand-set-bound'
            If the number of candidates in the set is smaller than this
            value, always try to remove unnecessary ivs from the set when
            adding a new one.
  
!     `scev-max-expr-size'
            Bound on size of expressions used in the scalar evolutions
            analyzer.  Large expressions slow the analyzer.
  
!     `scev-max-expr-complexity'
            Bound on the complexity of the expressions in the scalar
            evolutions analyzer.  Complex expressions slow the analyzer.
  
!     `omega-max-vars'
            The maximum number of variables in an Omega constraint system.
            The default value is 128.
  
!     `omega-max-geqs'
            The maximum number of inequalities in an Omega constraint
            system.  The default value is 256.
  
!     `omega-max-eqs'
            The maximum number of equalities in an Omega constraint
            system.  The default value is 128.
  
!     `omega-max-wild-cards'
!           The maximum number of wildcard variables that the Omega
!           solver is able to insert.  The default value is 18.
  
!     `omega-hash-table-size'
            The size of the hash table in the Omega solver.  The default
            value is 550.
  
!     `omega-max-keys'
            The maximal number of keys used by the Omega solver.  The
            default value is 500.
  
!     `omega-eliminate-redundant-constraints'
            When set to 1, use expensive methods to eliminate all
            redundant constraints.  The default value is 0.
  
!     `vect-max-version-for-alignment-checks'
            The maximum number of run-time checks that can be performed
            when doing loop versioning for alignment in the vectorizer.
  
!     `vect-max-version-for-alias-checks'
            The maximum number of run-time checks that can be performed
            when doing loop versioning for alias in the vectorizer.
  
!     `vect-max-peeling-for-alignment'
            The maximum number of loop peels to enhance access alignment
!           for vectorizer. Value -1 means 'no limit'.
  
!     `max-iterations-to-track'
            The maximum number of iterations of a loop the brute-force
!           algorithm for analysis of the number of iterations of the
!           loop tries to evaluate.
  
!     `hot-bb-count-ws-permille'
            A basic block profile count is considered hot if it
!           contributes to the given permillage (i.e. 0...1000) of the
            entire profiled execution.
  
!     `hot-bb-frequency-fraction'
            Select fraction of the entry block frequency of executions of
            basic block in function given basic block needs to have to be
            considered hot.
  
!     `max-predicted-iterations'
            The maximum number of loop iterations we predict statically.
            This is useful in cases where a function contains a single
            loop with known bound and another loop with unknown bound.
--- 9358,9507 ----
            allows all expressions to travel unrestricted distances.  The
            default value is 3.
  
!      'max-hoist-depth'
            The depth of search in the dominator tree for expressions to
            hoist.  This is used to avoid quadratic behavior in hoisting
            algorithm.  The value of 0 does not limit on the search, but
            may slow down compilation of huge functions.  The default
            value is 30.
  
!      'max-tail-merge-comparisons'
            The maximum amount of similar bbs to compare a bb with.  This
!           is used to avoid quadratic behavior in tree tail merging.  The
!           default value is 10.
  
!      'max-tail-merge-iterations'
            The maximum amount of iterations of the pass over the
!           function.  This is used to limit compilation time in tree tail
!           merging.  The default value is 2.
  
!      'max-unrolled-insns'
            The maximum number of instructions that a loop may have to be
            unrolled.  If a loop is unrolled, this parameter also
            determines how many times the loop code is unrolled.
  
!      'max-average-unrolled-insns'
            The maximum number of instructions biased by probabilities of
            their execution that a loop may have to be unrolled.  If a
            loop is unrolled, this parameter also determines how many
            times the loop code is unrolled.
  
!      'max-unroll-times'
            The maximum number of unrollings of a single loop.
  
!      'max-peeled-insns'
            The maximum number of instructions that a loop may have to be
            peeled.  If a loop is peeled, this parameter also determines
            how many times the loop code is peeled.
  
!      'max-peel-times'
            The maximum number of peelings of a single loop.
  
!      'max-peel-branches'
            The maximum number of branches on the hot path through the
            peeled sequence.
  
!      'max-completely-peeled-insns'
            The maximum number of insns of a completely peeled loop.
  
!      'max-completely-peel-times'
            The maximum number of iterations of a loop to be suitable for
            complete peeling.
  
!      'max-completely-peel-loop-nest-depth'
            The maximum depth of a loop nest suitable for complete
            peeling.
  
!      'max-unswitch-insns'
            The maximum number of insns of an unswitched loop.
  
!      'max-unswitch-level'
            The maximum number of branches unswitched in a single loop.
  
!      'lim-expensive'
            The minimum cost of an expensive expression in the loop
            invariant motion.
  
!      'iv-consider-all-candidates-bound'
            Bound on number of candidates for induction variables, below
            which all candidates are considered for each use in induction
            variable optimizations.  If there are more candidates than
            this, only the most relevant ones are considered to avoid
            quadratic time complexity.
  
!      'iv-max-considered-uses'
            The induction variable optimizations give up on loops that
            contain more induction variable uses.
  
!      'iv-always-prune-cand-set-bound'
            If the number of candidates in the set is smaller than this
            value, always try to remove unnecessary ivs from the set when
            adding a new one.
  
!      'scev-max-expr-size'
            Bound on size of expressions used in the scalar evolutions
            analyzer.  Large expressions slow the analyzer.
  
!      'scev-max-expr-complexity'
            Bound on the complexity of the expressions in the scalar
            evolutions analyzer.  Complex expressions slow the analyzer.
  
!      'omega-max-vars'
            The maximum number of variables in an Omega constraint system.
            The default value is 128.
  
!      'omega-max-geqs'
            The maximum number of inequalities in an Omega constraint
            system.  The default value is 256.
  
!      'omega-max-eqs'
            The maximum number of equalities in an Omega constraint
            system.  The default value is 128.
  
!      'omega-max-wild-cards'
!           The maximum number of wildcard variables that the Omega solver
!           is able to insert.  The default value is 18.
  
!      'omega-hash-table-size'
            The size of the hash table in the Omega solver.  The default
            value is 550.
  
!      'omega-max-keys'
            The maximal number of keys used by the Omega solver.  The
            default value is 500.
  
!      'omega-eliminate-redundant-constraints'
            When set to 1, use expensive methods to eliminate all
            redundant constraints.  The default value is 0.
  
!      'vect-max-version-for-alignment-checks'
            The maximum number of run-time checks that can be performed
            when doing loop versioning for alignment in the vectorizer.
  
!      'vect-max-version-for-alias-checks'
            The maximum number of run-time checks that can be performed
            when doing loop versioning for alias in the vectorizer.
  
!      'vect-max-peeling-for-alignment'
            The maximum number of loop peels to enhance access alignment
!           for vectorizer.  Value -1 means 'no limit'.
  
!      'max-iterations-to-track'
            The maximum number of iterations of a loop the brute-force
!           algorithm for analysis of the number of iterations of the loop
!           tries to evaluate.
  
!      'hot-bb-count-ws-permille'
            A basic block profile count is considered hot if it
!           contributes to the given permillage (i.e.  0...1000) of the
            entire profiled execution.
  
!      'hot-bb-frequency-fraction'
            Select fraction of the entry block frequency of executions of
            basic block in function given basic block needs to have to be
            considered hot.
  
!      'max-predicted-iterations'
            The maximum number of loop iterations we predict statically.
            This is useful in cases where a function contains a single
            loop with known bound and another loop with unknown bound.
*************** includes experimental options that may p
*** 9568,9629 ****
            means that the loop without bounds appears artificially cold
            relative to the other one.
  
!     `builtin-expect-probability'
!           Control the probability of the expression having the
!           specified value. This parameter takes a percentage (i.e. 0
!           ... 100) as input.  The default probability of 90 is obtained
            empirically.
  
!     `align-threshold'
            Select fraction of the maximal frequency of executions of a
            basic block in a function to align the basic block.
  
!     `align-loop-iterations'
            A loop expected to iterate at least the selected number of
            iterations is aligned.
  
!     `tracer-dynamic-coverage'
!     `tracer-dynamic-coverage-feedback'
            This value is used to limit superblock formation once the
            given percentage of executed instructions is covered.  This
            limits unnecessary code size expansion.
  
!           The `tracer-dynamic-coverage-feedback' parameter is used only
            when profile feedback is available.  The real profiles (as
            opposed to statically estimated ones) are much less balanced
            allowing the threshold to be larger value.
  
!     `tracer-max-code-growth'
            Stop tail duplication once code growth has reached given
!           percentage.  This is a rather artificial limit, as most of
!           the duplicates are eliminated later in cross jumping, so it
!           may be set to much higher values than is the desired code
!           growth.
  
-     `tracer-min-branch-ratio'
            Stop reverse growth when the reverse probability of best edge
            is less than this threshold (in percent).
  
!     `tracer-min-branch-ratio'
!     `tracer-min-branch-ratio-feedback'
            Stop forward growth if the best edge has probability lower
            than this threshold.
  
!           Similarly to `tracer-dynamic-coverage' two values are
!           present, one for compilation for profile feedback and one for
            compilation without.  The value for compilation with profile
            feedback needs to be more conservative (higher) in order to
            make tracer effective.
  
!     `max-cse-path-length'
            The maximum number of basic blocks on path that CSE considers.
            The default is 10.
  
!     `max-cse-insns'
            The maximum number of instructions CSE processes before
            flushing.  The default is 1000.
  
!     `ggc-min-expand'
            GCC uses a garbage collector to manage its own memory
            allocation.  This parameter specifies the minimum percentage
            by which the garbage collector's heap should be allowed to
--- 9510,9577 ----
            means that the loop without bounds appears artificially cold
            relative to the other one.
  
!      'builtin-expect-probability'
!           Control the probability of the expression having the specified
!           value.  This parameter takes a percentage (i.e.  0 ...  100)
!           as input.  The default probability of 90 is obtained
            empirically.
  
!      'align-threshold'
! 
            Select fraction of the maximal frequency of executions of a
            basic block in a function to align the basic block.
  
!      'align-loop-iterations'
! 
            A loop expected to iterate at least the selected number of
            iterations is aligned.
  
!      'tracer-dynamic-coverage'
!      'tracer-dynamic-coverage-feedback'
! 
            This value is used to limit superblock formation once the
            given percentage of executed instructions is covered.  This
            limits unnecessary code size expansion.
  
!           The 'tracer-dynamic-coverage-feedback' parameter is used only
            when profile feedback is available.  The real profiles (as
            opposed to statically estimated ones) are much less balanced
            allowing the threshold to be larger value.
  
!      'tracer-max-code-growth'
            Stop tail duplication once code growth has reached given
!           percentage.  This is a rather artificial limit, as most of the
!           duplicates are eliminated later in cross jumping, so it may be
!           set to much higher values than is the desired code growth.
! 
!      'tracer-min-branch-ratio'
  
            Stop reverse growth when the reverse probability of best edge
            is less than this threshold (in percent).
  
!      'tracer-min-branch-ratio'
!      'tracer-min-branch-ratio-feedback'
! 
            Stop forward growth if the best edge has probability lower
            than this threshold.
  
!           Similarly to 'tracer-dynamic-coverage' two values are present,
!           one for compilation for profile feedback and one for
            compilation without.  The value for compilation with profile
            feedback needs to be more conservative (higher) in order to
            make tracer effective.
  
!      'max-cse-path-length'
! 
            The maximum number of basic blocks on path that CSE considers.
            The default is 10.
  
!      'max-cse-insns'
            The maximum number of instructions CSE processes before
            flushing.  The default is 1000.
  
!      'ggc-min-expand'
! 
            GCC uses a garbage collector to manage its own memory
            allocation.  This parameter specifies the minimum percentage
            by which the garbage collector's heap should be allowed to
*************** includes experimental options that may p
*** 9631,9650 ****
            compilation speed; it has no effect on code generation.
  
            The default is 30% + 70% * (RAM/1GB) with an upper bound of
!           100% when RAM >= 1GB.  If `getrlimit' is available, the
!           notion of "RAM" is the smallest of actual RAM and
!           `RLIMIT_DATA' or `RLIMIT_AS'.  If GCC is not able to
!           calculate RAM on a particular platform, the lower bound of
!           30% is used.  Setting this parameter and `ggc-min-heapsize'
!           to zero causes a full collection to occur at every
!           opportunity.  This is extremely slow, but can be useful for
!           debugging.
  
-     `ggc-min-heapsize'
            Minimum size of the garbage collector's heap before it begins
            bothering to collect garbage.  The first collection occurs
!           after the heap expands by `ggc-min-expand'% beyond
!           `ggc-min-heapsize'.  Again, tuning this may improve
            compilation speed, and has no effect on code generation.
  
            The default is the smaller of RAM/8, RLIMIT_RSS, or a limit
--- 9579,9598 ----
            compilation speed; it has no effect on code generation.
  
            The default is 30% + 70% * (RAM/1GB) with an upper bound of
!           100% when RAM >= 1GB.  If 'getrlimit' is available, the notion
!           of "RAM" is the smallest of actual RAM and 'RLIMIT_DATA' or
!           'RLIMIT_AS'.  If GCC is not able to calculate RAM on a
!           particular platform, the lower bound of 30% is used.  Setting
!           this parameter and 'ggc-min-heapsize' to zero causes a full
!           collection to occur at every opportunity.  This is extremely
!           slow, but can be useful for debugging.
! 
!      'ggc-min-heapsize'
  
            Minimum size of the garbage collector's heap before it begins
            bothering to collect garbage.  The first collection occurs
!           after the heap expands by 'ggc-min-expand'% beyond
!           'ggc-min-heapsize'.  Again, tuning this may improve
            compilation speed, and has no effect on code generation.
  
            The default is the smaller of RAM/8, RLIMIT_RSS, or a limit
*************** includes experimental options that may p
*** 9654,9821 ****
            to calculate RAM on a particular platform, the lower bound is
            used.  Setting this parameter very large effectively disables
            garbage collection.  Setting this parameter and
!           `ggc-min-expand' to zero causes a full collection to occur at
            every opportunity.
  
!     `max-reload-search-insns'
            The maximum number of instruction reload should look backward
            for equivalent register.  Increasing values mean more
            aggressive optimization, making the compilation time increase
            with probably slightly better performance.  The default value
            is 100.
  
!     `max-cselib-memory-locations'
!           The maximum number of memory locations cselib should take
!           into account.  Increasing values mean more aggressive
!           optimization, making the compilation time increase with
!           probably slightly better performance.  The default value is
!           500.
  
-     `reorder-blocks-duplicate'
-     `reorder-blocks-duplicate-feedback'
            Used by the basic block reordering pass to decide whether to
            use unconditional branch or duplicate the code on its
            destination.  Code is duplicated when its estimated size is
            smaller than this value multiplied by the estimated size of
            unconditional jump in the hot spots of the program.
  
!           The `reorder-block-duplicate-feedback' parameter is used only
            when profile feedback is available.  It may be set to higher
!           values than `reorder-block-duplicate' since information about
            the hot spots is more accurate.
  
!     `max-sched-ready-insns'
            The maximum number of instructions ready to be issued the
            scheduler should consider at any given time during the first
            scheduling pass.  Increasing values mean more thorough
            searches, making the compilation time increase with probably
            little benefit.  The default value is 100.
  
!     `max-sched-region-blocks'
            The maximum number of blocks in a region to be considered for
            interblock scheduling.  The default value is 10.
  
!     `max-pipeline-region-blocks'
            The maximum number of blocks in a region to be considered for
            pipelining in the selective scheduler.  The default value is
            15.
  
!     `max-sched-region-insns'
            The maximum number of insns in a region to be considered for
            interblock scheduling.  The default value is 100.
  
!     `max-pipeline-region-insns'
            The maximum number of insns in a region to be considered for
            pipelining in the selective scheduler.  The default value is
            200.
  
!     `min-spec-prob'
            The minimum probability (in percents) of reaching a source
            block for interblock speculative scheduling.  The default
            value is 40.
  
!     `max-sched-extend-regions-iters'
            The maximum number of iterations through CFG to extend
            regions.  A value of 0 (the default) disables region
            extensions.
  
!     `max-sched-insn-conflict-delay'
            The maximum conflict delay for an insn to be considered for
            speculative motion.  The default value is 3.
  
!     `sched-spec-prob-cutoff'
            The minimal probability of speculation success (in percents),
!           so that speculative insns are scheduled.  The default value
!           is 40.
  
!     `sched-spec-state-edge-prob-cutoff'
!           The minimum probability an edge must have for the scheduler
!           to save its state across it.  The default value is 10.
  
!     `sched-mem-true-dep-cost'
            Minimal distance (in CPU cycles) between store and load
            targeting same memory locations.  The default value is 1.
  
!     `selsched-max-lookahead'
            The maximum size of the lookahead window of selective
            scheduling.  It is a depth of search for available
            instructions.  The default value is 50.
  
!     `selsched-max-sched-times'
            The maximum number of times that an instruction is scheduled
            during selective scheduling.  This is the limit on the number
            of iterations through which the instruction may be pipelined.
            The default value is 2.
  
!     `selsched-max-insns-to-rename'
!           The maximum number of best instructions in the ready list
!           that are considered for renaming in the selective scheduler.
!           The default value is 2.
  
!     `sms-min-sc'
            The minimum value of stage count that swing modulo scheduler
            generates.  The default value is 2.
  
!     `max-last-value-rtl'
            The maximum size measured as number of RTLs that can be
!           recorded in an expression in combiner for a pseudo register
!           as last known value of that register.  The default is 10000.
  
!     `max-combine-insns'
            The maximum number of instructions the RTL combiner tries to
!           combine.  The default value is 2 at `-Og' and 4 otherwise.
  
!     `integer-share-limit'
            Small integer constants can use a shared data structure,
!           reducing the compiler's memory usage and increasing its
!           speed.  This sets the maximum value of a shared integer
!           constant.  The default value is 256.
  
!     `ssp-buffer-size'
            The minimum size of buffers (i.e. arrays) that receive stack
!           smashing protection when `-fstack-protection' is used.
  
!     `min-size-for-stack-sharing'
            The minimum size of variables taking part in stack slot
!           sharing when not optimizing. The default value is 32.
  
!     `max-jump-thread-duplication-stmts'
            Maximum number of statements allowed in a block that needs to
            be duplicated when threading jumps.
  
!     `max-fields-for-field-sensitive'
            Maximum number of fields in a structure treated in a field
            sensitive manner during pointer analysis.  The default is zero
!           for `-O0' and `-O1', and 100 for `-Os', `-O2', and `-O3'.
  
!     `prefetch-latency'
            Estimate on average number of instructions that are executed
            before prefetch finishes.  The distance prefetched ahead is
            proportional to this constant.  Increasing this number may
            also lead to less streams being prefetched (see
!           `simultaneous-prefetches').
  
!     `simultaneous-prefetches'
            Maximum number of prefetches that can run at the same time.
  
!     `l1-cache-line-size'
            The size of cache line in L1 cache, in bytes.
  
!     `l1-cache-size'
            The size of L1 cache, in kilobytes.
  
!     `l2-cache-size'
            The size of L2 cache, in kilobytes.
  
!     `min-insn-to-prefetch-ratio'
            The minimum ratio between the number of instructions and the
            number of prefetches to enable prefetching in a loop.
  
!     `prefetch-min-insn-to-mem-ratio'
            The minimum ratio between the number of instructions and the
            number of memory references to enable prefetching in a loop.
  
!     `use-canonical-types'
            Whether the compiler should use the "canonical" type system.
            By default, this should always be 1, which uses a more
            efficient internal mechanism for comparing types in C++ and
--- 9602,9769 ----
            to calculate RAM on a particular platform, the lower bound is
            used.  Setting this parameter very large effectively disables
            garbage collection.  Setting this parameter and
!           'ggc-min-expand' to zero causes a full collection to occur at
            every opportunity.
  
!      'max-reload-search-insns'
            The maximum number of instruction reload should look backward
            for equivalent register.  Increasing values mean more
            aggressive optimization, making the compilation time increase
            with probably slightly better performance.  The default value
            is 100.
  
!      'max-cselib-memory-locations'
!           The maximum number of memory locations cselib should take into
!           account.  Increasing values mean more aggressive optimization,
!           making the compilation time increase with probably slightly
!           better performance.  The default value is 500.
! 
!      'reorder-blocks-duplicate'
!      'reorder-blocks-duplicate-feedback'
  
            Used by the basic block reordering pass to decide whether to
            use unconditional branch or duplicate the code on its
            destination.  Code is duplicated when its estimated size is
            smaller than this value multiplied by the estimated size of
            unconditional jump in the hot spots of the program.
  
!           The 'reorder-block-duplicate-feedback' parameter is used only
            when profile feedback is available.  It may be set to higher
!           values than 'reorder-block-duplicate' since information about
            the hot spots is more accurate.
  
!      'max-sched-ready-insns'
            The maximum number of instructions ready to be issued the
            scheduler should consider at any given time during the first
            scheduling pass.  Increasing values mean more thorough
            searches, making the compilation time increase with probably
            little benefit.  The default value is 100.
  
!      'max-sched-region-blocks'
            The maximum number of blocks in a region to be considered for
            interblock scheduling.  The default value is 10.
  
!      'max-pipeline-region-blocks'
            The maximum number of blocks in a region to be considered for
            pipelining in the selective scheduler.  The default value is
            15.
  
!      'max-sched-region-insns'
            The maximum number of insns in a region to be considered for
            interblock scheduling.  The default value is 100.
  
!      'max-pipeline-region-insns'
            The maximum number of insns in a region to be considered for
            pipelining in the selective scheduler.  The default value is
            200.
  
!      'min-spec-prob'
            The minimum probability (in percents) of reaching a source
            block for interblock speculative scheduling.  The default
            value is 40.
  
!      'max-sched-extend-regions-iters'
            The maximum number of iterations through CFG to extend
            regions.  A value of 0 (the default) disables region
            extensions.
  
!      'max-sched-insn-conflict-delay'
            The maximum conflict delay for an insn to be considered for
            speculative motion.  The default value is 3.
  
!      'sched-spec-prob-cutoff'
            The minimal probability of speculation success (in percents),
!           so that speculative insns are scheduled.  The default value is
!           40.
  
!      'sched-spec-state-edge-prob-cutoff'
!           The minimum probability an edge must have for the scheduler to
!           save its state across it.  The default value is 10.
  
!      'sched-mem-true-dep-cost'
            Minimal distance (in CPU cycles) between store and load
            targeting same memory locations.  The default value is 1.
  
!      'selsched-max-lookahead'
            The maximum size of the lookahead window of selective
            scheduling.  It is a depth of search for available
            instructions.  The default value is 50.
  
!      'selsched-max-sched-times'
            The maximum number of times that an instruction is scheduled
            during selective scheduling.  This is the limit on the number
            of iterations through which the instruction may be pipelined.
            The default value is 2.
  
!      'selsched-max-insns-to-rename'
!           The maximum number of best instructions in the ready list that
!           are considered for renaming in the selective scheduler.  The
!           default value is 2.
  
!      'sms-min-sc'
            The minimum value of stage count that swing modulo scheduler
            generates.  The default value is 2.
  
!      'max-last-value-rtl'
            The maximum size measured as number of RTLs that can be
!           recorded in an expression in combiner for a pseudo register as
!           last known value of that register.  The default is 10000.
  
!      'max-combine-insns'
            The maximum number of instructions the RTL combiner tries to
!           combine.  The default value is 2 at '-Og' and 4 otherwise.
  
!      'integer-share-limit'
            Small integer constants can use a shared data structure,
!           reducing the compiler's memory usage and increasing its speed.
!           This sets the maximum value of a shared integer constant.  The
!           default value is 256.
  
!      'ssp-buffer-size'
            The minimum size of buffers (i.e. arrays) that receive stack
!           smashing protection when '-fstack-protection' is used.
  
!      'min-size-for-stack-sharing'
            The minimum size of variables taking part in stack slot
!           sharing when not optimizing.  The default value is 32.
  
!      'max-jump-thread-duplication-stmts'
            Maximum number of statements allowed in a block that needs to
            be duplicated when threading jumps.
  
!      'max-fields-for-field-sensitive'
            Maximum number of fields in a structure treated in a field
            sensitive manner during pointer analysis.  The default is zero
!           for '-O0' and '-O1', and 100 for '-Os', '-O2', and '-O3'.
  
!      'prefetch-latency'
            Estimate on average number of instructions that are executed
            before prefetch finishes.  The distance prefetched ahead is
            proportional to this constant.  Increasing this number may
            also lead to less streams being prefetched (see
!           'simultaneous-prefetches').
  
!      'simultaneous-prefetches'
            Maximum number of prefetches that can run at the same time.
  
!      'l1-cache-line-size'
            The size of cache line in L1 cache, in bytes.
  
!      'l1-cache-size'
            The size of L1 cache, in kilobytes.
  
!      'l2-cache-size'
            The size of L2 cache, in kilobytes.
  
!      'min-insn-to-prefetch-ratio'
            The minimum ratio between the number of instructions and the
            number of prefetches to enable prefetching in a loop.
  
!      'prefetch-min-insn-to-mem-ratio'
            The minimum ratio between the number of instructions and the
            number of memory references to enable prefetching in a loop.
  
!      'use-canonical-types'
            Whether the compiler should use the "canonical" type system.
            By default, this should always be 1, which uses a more
            efficient internal mechanism for comparing types in C++ and
*************** includes experimental options that may p
*** 9823,9837 ****
            are causing compilation failures, set this value to 0 to
            disable canonical types.
  
!     `switch-conversion-max-branch-ratio'
!           Switch initialization conversion refuses to create arrays
!           that are bigger than `switch-conversion-max-branch-ratio'
!           times the number of branches in the switch.
  
!     `max-partial-antic-length'
            Maximum length of the partial antic set computed during the
            tree partial redundancy elimination optimization
!           (`-ftree-pre') when optimizing at `-O3' and above.  For some
            sorts of source code the enhanced partial redundancy
            elimination optimization can run away, consuming all of the
            memory available on the host machine.  This parameter sets a
--- 9771,9785 ----
            are causing compilation failures, set this value to 0 to
            disable canonical types.
  
!      'switch-conversion-max-branch-ratio'
!           Switch initialization conversion refuses to create arrays that
!           are bigger than 'switch-conversion-max-branch-ratio' times the
!           number of branches in the switch.
  
!      'max-partial-antic-length'
            Maximum length of the partial antic set computed during the
            tree partial redundancy elimination optimization
!           ('-ftree-pre') when optimizing at '-O3' and above.  For some
            sorts of source code the enhanced partial redundancy
            elimination optimization can run away, consuming all of the
            memory available on the host machine.  This parameter sets a
*************** includes experimental options that may p
*** 9839,9867 ****
            prevents the runaway behavior.  Setting a value of 0 for this
            parameter allows an unlimited set length.
  
!     `sccvn-max-scc-size'
            Maximum size of a strongly connected component (SCC) during
            SCCVN processing.  If this limit is hit, SCCVN processing for
            the whole function is not done and optimizations depending on
            it are disabled.  The default maximum SCC size is 10000.
  
!     `sccvn-max-alias-queries-per-access'
!           Maximum number of alias-oracle queries we perform when
!           looking for redundancies for loads and stores.  If this limit
!           is hit the search is aborted and the load or store is not
!           considered redundant.  The number of queries is
!           algorithmically limited to the number of stores on all paths
!           from the load to the function entry.  The default maxmimum
!           number of queries is 1000.
  
!     `ira-max-loops-num'
            IRA uses regional register allocation by default.  If a
            function contains more loops than the number given by this
            parameter, only at most the given number of the most
            frequently-executed loops form regions for regional register
            allocation.  The default value of the parameter is 100.
  
!     `ira-max-conflict-table-size'
            Although IRA uses a sophisticated algorithm to compress the
            conflict table, the table can still require excessive amounts
            of memory for huge functions.  If the conflict table for a
--- 9787,9815 ----
            prevents the runaway behavior.  Setting a value of 0 for this
            parameter allows an unlimited set length.
  
!      'sccvn-max-scc-size'
            Maximum size of a strongly connected component (SCC) during
            SCCVN processing.  If this limit is hit, SCCVN processing for
            the whole function is not done and optimizations depending on
            it are disabled.  The default maximum SCC size is 10000.
  
!      'sccvn-max-alias-queries-per-access'
!           Maximum number of alias-oracle queries we perform when looking
!           for redundancies for loads and stores.  If this limit is hit
!           the search is aborted and the load or store is not considered
!           redundant.  The number of queries is algorithmically limited
!           to the number of stores on all paths from the load to the
!           function entry.  The default maxmimum number of queries is
!           1000.
  
!      'ira-max-loops-num'
            IRA uses regional register allocation by default.  If a
            function contains more loops than the number given by this
            parameter, only at most the given number of the most
            frequently-executed loops form regions for regional register
            allocation.  The default value of the parameter is 100.
  
!      'ira-max-conflict-table-size'
            Although IRA uses a sophisticated algorithm to compress the
            conflict table, the table can still require excessive amounts
            of memory for huge functions.  If the conflict table for a
*************** includes experimental options that may p
*** 9871,9920 ****
            building a pseudo-register conflict table.  The default value
            of the parameter is 2000.
  
!     `ira-loop-reserved-regs'
!           IRA can be used to evaluate more accurate register pressure
!           in loops for decisions to move loop invariants (see `-O3').
!           The number of available registers reserved for some other
!           purposes is given by this parameter.  The default value of
!           the parameter is 2, which is the minimal number of registers
            needed by typical instructions.  This value is the best found
            from numerous experiments.
  
!     `lra-inheritance-ebb-probability-cutoff'
            LRA tries to reuse values reloaded in registers in subsequent
            insns.  This optimization is called inheritance.  EBB is used
            as a region to do this optimization.  The parameter defines a
            minimal fall-through edge probability in percentage used to
!           add BB to inheritance EBB in LRA.  The default value of the
            parameter is 40.  The value was chosen from numerous runs of
            SPEC2000 on x86-64.
  
!     `loop-invariant-max-bbs-in-loop'
            Loop invariant motion can be very expensive, both in
            compilation time and in amount of needed compile-time memory,
!           with very large loops.  Loops with more basic blocks than
!           this parameter won't have loop invariant motion optimization
!           performed on them.  The default value of the parameter is
!           1000 for `-O1' and 10000 for `-O2' and above.
  
!     `loop-max-datarefs-for-datadeps'
            Building data dapendencies is expensive for very large loops.
            This parameter limits the number of data references in loops
!           that are considered for data dependence analysis.  These
!           large loops are no handled by the optimizations using loop
!           data dependencies.  The default value is 1000.
  
!     `max-vartrack-size'
            Sets a maximum number of hash table slots to use during
            variable tracking dataflow analysis of any function.  If this
            limit is exceeded with variable tracking at assignments
            enabled, analysis for that function is retried without it,
            after removing all debug insns from the function.  If the
            limit is exceeded even without debug insns, var tracking
!           analysis is completely disabled for the function.  Setting
!           the parameter to zero makes it unlimited.
  
!     `max-vartrack-expr-depth'
            Sets a maximum number of recursion levels when attempting to
            map variable names or debug temporaries to value expressions.
            This trades compilation time for more complete debug
--- 9819,9868 ----
            building a pseudo-register conflict table.  The default value
            of the parameter is 2000.
  
!      'ira-loop-reserved-regs'
!           IRA can be used to evaluate more accurate register pressure in
!           loops for decisions to move loop invariants (see '-O3').  The
!           number of available registers reserved for some other purposes
!           is given by this parameter.  The default value of the
!           parameter is 2, which is the minimal number of registers
            needed by typical instructions.  This value is the best found
            from numerous experiments.
  
!      'lra-inheritance-ebb-probability-cutoff'
            LRA tries to reuse values reloaded in registers in subsequent
            insns.  This optimization is called inheritance.  EBB is used
            as a region to do this optimization.  The parameter defines a
            minimal fall-through edge probability in percentage used to
!           add BB to inheritance EBB in LRA. The default value of the
            parameter is 40.  The value was chosen from numerous runs of
            SPEC2000 on x86-64.
  
!      'loop-invariant-max-bbs-in-loop'
            Loop invariant motion can be very expensive, both in
            compilation time and in amount of needed compile-time memory,
!           with very large loops.  Loops with more basic blocks than this
!           parameter won't have loop invariant motion optimization
!           performed on them.  The default value of the parameter is 1000
!           for '-O1' and 10000 for '-O2' and above.
  
!      'loop-max-datarefs-for-datadeps'
            Building data dapendencies is expensive for very large loops.
            This parameter limits the number of data references in loops
!           that are considered for data dependence analysis.  These large
!           loops are no handled by the optimizations using loop data
!           dependencies.  The default value is 1000.
  
!      'max-vartrack-size'
            Sets a maximum number of hash table slots to use during
            variable tracking dataflow analysis of any function.  If this
            limit is exceeded with variable tracking at assignments
            enabled, analysis for that function is retried without it,
            after removing all debug insns from the function.  If the
            limit is exceeded even without debug insns, var tracking
!           analysis is completely disabled for the function.  Setting the
!           parameter to zero makes it unlimited.
  
!      'max-vartrack-expr-depth'
            Sets a maximum number of recursion levels when attempting to
            map variable names or debug temporaries to value expressions.
            This trades compilation time for more complete debug
*************** includes experimental options that may p
*** 9924,10159 ****
            compiler to find more complex debug expressions, but compile
            time and memory use may grow.  The default is 12.
  
!     `min-nondebug-insn-uid'
            Use uids starting at this parameter for nondebug insns.  The
            range below the parameter is reserved exclusively for debug
!           insns created by `-fvar-tracking-assignments', but debug
!           insns may get (non-overlapping) uids above it if the reserved
!           range is exhausted.
  
!     `ipa-sra-ptr-growth-factor'
            IPA-SRA replaces a pointer to an aggregate with one or more
            new parameters only when their cumulative size is less or
!           equal to `ipa-sra-ptr-growth-factor' times the size of the
            original pointer parameter.
  
!     `sra-max-scalarization-size-Ospeed'
! 
!     `sra-max-scalarization-size-Osize'
            The two Scalar Reduction of Aggregates passes (SRA and
            IPA-SRA) aim to replace scalar parts of aggregates with uses
!           of independent scalar variables.  These parameters control
!           the maximum size, in storage units, of aggregate which is
            considered for replacement when compiling for speed
!           (`sra-max-scalarization-size-Ospeed') or size
!           (`sra-max-scalarization-size-Osize') respectively.
  
!     `tm-max-aggregate-size'
!           When making copies of thread-local variables in a
!           transaction, this parameter specifies the size in bytes after
!           which variables are saved with the logging functions as
!           opposed to save/restore code sequence pairs.  This option
!           only applies when using `-fgnu-tm'.
  
!     `graphite-max-nb-scop-params'
            To avoid exponential effects in the Graphite loop transforms,
            the number of parameters in a Static Control Part (SCoP) is
            bounded.  The default value is 10 parameters.  A variable
!           whose value is unknown at compilation time and defined
!           outside a SCoP is a parameter of the SCoP.
  
!     `graphite-max-bbs-per-function'
            To avoid exponential effects in the detection of SCoPs, the
            size of the functions analyzed by Graphite is bounded.  The
            default value is 100 basic blocks.
  
!     `loop-block-tile-size'
            Loop blocking or strip mining transforms, enabled with
!           `-floop-block' or `-floop-strip-mine', strip mine each loop
!           in the loop nest by a given number of iterations.  The strip
!           length can be changed using the `loop-block-tile-size'
            parameter.  The default value is 51 iterations.
  
!     `loop-unroll-jam-size'
!           Specify the unroll factor for the `-floop-unroll-and-jam'
            option.  The default value is 4.
  
!     `loop-unroll-jam-depth'
            Specify the dimension to be unrolled (counting from the most
!           inner loop) for the  `-floop-unroll-and-jam'.  The default
            value is 2.
  
!     `ipa-cp-value-list-size'
            IPA-CP attempts to track all possible values and types passed
            to a function's parameter in order to propagate them and
!           perform devirtualization.  `ipa-cp-value-list-size' is the
            maximum number of values and types it stores per one formal
            parameter of a function.
  
!     `ipa-cp-eval-threshold'
            IPA-CP calculates its own score of cloning profitability
            heuristics and performs those cloning opportunities with
!           scores that exceed `ipa-cp-eval-threshold'.
  
!     `ipa-cp-recursion-penalty'
            Percentage penalty the recursive functions will receive when
            they are evaluated for cloning.
  
!     `ipa-cp-single-call-penalty'
            Percentage penalty functions containg a single call to another
            function will receive when they are evaluated for cloning.
  
!     `ipa-max-agg-items'
            IPA-CP is also capable to propagate a number of scalar values
!           passed in an aggregate. `ipa-max-agg-items' controls the
            maximum number of such values per one parameter.
  
!     `ipa-cp-loop-hint-bonus'
!           When IPA-CP determines that a cloning candidate would make
!           the number of iterations of a loop known, it adds a bonus of
!           `ipa-cp-loop-hint-bonus' to the profitability score of the
            candidate.
  
!     `ipa-cp-array-index-hint-bonus'
!           When IPA-CP determines that a cloning candidate would make
!           the index of an array access known, it adds a bonus of
!           `ipa-cp-array-index-hint-bonus' to the profitability score of
            the candidate.
  
!     `ipa-max-aa-steps'
            During its analysis of function bodies, IPA-CP employs alias
            analysis in order to track values pointed to by function
            parameters.  In order not spend too much time analyzing huge
!           functions, it gives up and consider all memory clobbered
!           after examining `ipa-max-aa-steps' statements modifying
!           memory.
  
!     `lto-partitions'
            Specify desired number of partitions produced during WHOPR
            compilation.  The number of partitions should exceed the
            number of CPUs used for compilation.  The default value is 32.
  
!     `lto-minpartition'
            Size of minimal partition for WHOPR (in estimated
!           instructions).  This prevents expenses of splitting very
!           small programs into too many partitions.
  
!     `cxx-max-namespaces-for-diagnostic-help'
            The maximum number of namespaces to consult for suggestions
            when C++ name lookup fails for an identifier.  The default is
            1000.
  
!     `sink-frequency-threshold'
            The maximum relative execution frequency (in percents) of the
!           target block relative to a statement's original block to
!           allow statement sinking of a statement.  Larger numbers
!           result in more aggressive statement sinking.  The default
!           value is 75.  A small positive adjustment is applied for
!           statements with memory operands as those are even more
!           profitable so sink.
  
!     `max-stores-to-sink'
            The maximum number of conditional stores paires that can be
!           sunk.  Set to 0 if either vectorization (`-ftree-vectorize')
!           or if-conversion (`-ftree-loop-if-convert') is disabled.  The
            default is 2.
  
!     `allow-store-data-races'
            Allow optimizers to introduce new data races on stores.  Set
            to 1 to allow, otherwise to 0.  This option is enabled by
!           default at optimization level `-Ofast'.
  
!     `case-values-threshold'
            The smallest number of different values for which it is best
!           to use a jump-table instead of a tree of conditional
!           branches.  If the value is 0, use the default for the
!           machine.  The default is 0.
  
!     `tree-reassoc-width'
            Set the maximum number of instructions executed in parallel in
!           reassociated tree. This parameter overrides target dependent
            heuristics used by default if has non zero value.
  
!     `sched-pressure-algorithm'
            Choose between the two available implementations of
!           `-fsched-pressure'.  Algorithm 1 is the original
            implementation and is the more likely to prevent instructions
            from being reordered.  Algorithm 2 was designed to be a
            compromise between the relatively conservative approach taken
!           by algorithm 1 and the rather aggressive approach taken by
!           the default scheduler.  It relies more heavily on having a
!           regular register file and accurate register pressure classes.
!           See `haifa-sched.c' in the GCC sources for more details.
  
            The default choice depends on the target.
  
!     `max-slsr-cand-scan'
            Set the maximum number of existing candidates that are
            considered when seeking a basis for a new straight-line
            strength reduction candidate.
  
!     `asan-globals'
            Enable buffer overflow detection for global objects.  This
            kind of protection is enabled by default if you are using
!           `-fsanitize=address' option.  To disable global objects
!           protection use `--param asan-globals=0'.
  
!     `asan-stack'
!           Enable buffer overflow detection for stack objects.  This
!           kind of protection is enabled by default when
!           using`-fsanitize=address'.  To disable stack protection use
!           `--param asan-stack=0' option.
  
!     `asan-instrument-reads'
            Enable buffer overflow detection for memory reads.  This kind
            of protection is enabled by default when using
!           `-fsanitize=address'.  To disable memory reads protection use
!           `--param asan-instrument-reads=0'.
  
!     `asan-instrument-writes'
!           Enable buffer overflow detection for memory writes.  This
!           kind of protection is enabled by default when using
!           `-fsanitize=address'.  To disable memory writes protection use
!           `--param asan-instrument-writes=0' option.
  
!     `asan-memintrin'
            Enable detection for built-in functions.  This kind of
            protection is enabled by default when using
!           `-fsanitize=address'.  To disable built-in functions
!           protection use `--param asan-memintrin=0'.
  
!     `asan-use-after-return'
            Enable detection of use-after-return.  This kind of protection
!           is enabled by default when using `-fsanitize=address' option.
!           To disable use-after-return detection use `--param
            asan-use-after-return=0'.
  
!     `asan-instrumentation-with-call-threshold'
!           If number of memory accesses in function being instrumented
!           is greater or equal to this number, use callbacks instead of
!           inline checks.  E.g. to disable inline code use `--param
            asan-instrumentation-with-call-threshold=0'.
  
!     `chkp-max-ctor-size'
            Static constructors generated by Pointer Bounds Checker may
            become very large and significantly increase compile time at
!           optimization level `-O1' and higher.  This parameter is a
            maximum nubmer of statements in a single generated
            constructor.  Default value is 5000.
  
!     `max-fsm-thread-path-insns'
!           Maximum number of instructions to copy when duplicating
!           blocks on a finite state automaton jump thread path.  The
!           default is 100.
  
!     `max-fsm-thread-length'
            Maximum number of basic blocks on a finite state automaton
            jump thread path.  The default is 10.
  
!     `max-fsm-thread-paths'
!           Maximum number of new jump thread paths to create for a
!           finite state automaton.  The default is 50.
! 
  
  
  File: gcc.info,  Node: Preprocessor Options,  Next: Assembler Options,  Prev: Optimize Options,  Up: Invoking GCC
--- 9872,10103 ----
            compiler to find more complex debug expressions, but compile
            time and memory use may grow.  The default is 12.
  
!      'min-nondebug-insn-uid'
            Use uids starting at this parameter for nondebug insns.  The
            range below the parameter is reserved exclusively for debug
!           insns created by '-fvar-tracking-assignments', but debug insns
!           may get (non-overlapping) uids above it if the reserved range
!           is exhausted.
  
!      'ipa-sra-ptr-growth-factor'
            IPA-SRA replaces a pointer to an aggregate with one or more
            new parameters only when their cumulative size is less or
!           equal to 'ipa-sra-ptr-growth-factor' times the size of the
            original pointer parameter.
  
!      'sra-max-scalarization-size-Ospeed'
!      'sra-max-scalarization-size-Osize'
            The two Scalar Reduction of Aggregates passes (SRA and
            IPA-SRA) aim to replace scalar parts of aggregates with uses
!           of independent scalar variables.  These parameters control the
!           maximum size, in storage units, of aggregate which is
            considered for replacement when compiling for speed
!           ('sra-max-scalarization-size-Ospeed') or size
!           ('sra-max-scalarization-size-Osize') respectively.
  
!      'tm-max-aggregate-size'
!           When making copies of thread-local variables in a transaction,
!           this parameter specifies the size in bytes after which
!           variables are saved with the logging functions as opposed to
!           save/restore code sequence pairs.  This option only applies
!           when using '-fgnu-tm'.
  
!      'graphite-max-nb-scop-params'
            To avoid exponential effects in the Graphite loop transforms,
            the number of parameters in a Static Control Part (SCoP) is
            bounded.  The default value is 10 parameters.  A variable
!           whose value is unknown at compilation time and defined outside
!           a SCoP is a parameter of the SCoP.
  
!      'graphite-max-bbs-per-function'
            To avoid exponential effects in the detection of SCoPs, the
            size of the functions analyzed by Graphite is bounded.  The
            default value is 100 basic blocks.
  
!      'loop-block-tile-size'
            Loop blocking or strip mining transforms, enabled with
!           '-floop-block' or '-floop-strip-mine', strip mine each loop in
!           the loop nest by a given number of iterations.  The strip
!           length can be changed using the 'loop-block-tile-size'
            parameter.  The default value is 51 iterations.
  
!      'loop-unroll-jam-size'
!           Specify the unroll factor for the '-floop-unroll-and-jam'
            option.  The default value is 4.
  
!      'loop-unroll-jam-depth'
            Specify the dimension to be unrolled (counting from the most
!           inner loop) for the '-floop-unroll-and-jam'.  The default
            value is 2.
  
!      'ipa-cp-value-list-size'
            IPA-CP attempts to track all possible values and types passed
            to a function's parameter in order to propagate them and
!           perform devirtualization.  'ipa-cp-value-list-size' is the
            maximum number of values and types it stores per one formal
            parameter of a function.
  
!      'ipa-cp-eval-threshold'
            IPA-CP calculates its own score of cloning profitability
            heuristics and performs those cloning opportunities with
!           scores that exceed 'ipa-cp-eval-threshold'.
  
!      'ipa-cp-recursion-penalty'
            Percentage penalty the recursive functions will receive when
            they are evaluated for cloning.
  
!      'ipa-cp-single-call-penalty'
            Percentage penalty functions containg a single call to another
            function will receive when they are evaluated for cloning.
  
!      'ipa-max-agg-items'
            IPA-CP is also capable to propagate a number of scalar values
!           passed in an aggregate.  'ipa-max-agg-items' controls the
            maximum number of such values per one parameter.
  
!      'ipa-cp-loop-hint-bonus'
!           When IPA-CP determines that a cloning candidate would make the
!           number of iterations of a loop known, it adds a bonus of
!           'ipa-cp-loop-hint-bonus' to the profitability score of the
            candidate.
  
!      'ipa-cp-array-index-hint-bonus'
!           When IPA-CP determines that a cloning candidate would make the
!           index of an array access known, it adds a bonus of
!           'ipa-cp-array-index-hint-bonus' to the profitability score of
            the candidate.
  
!      'ipa-max-aa-steps'
            During its analysis of function bodies, IPA-CP employs alias
            analysis in order to track values pointed to by function
            parameters.  In order not spend too much time analyzing huge
!           functions, it gives up and consider all memory clobbered after
!           examining 'ipa-max-aa-steps' statements modifying memory.
  
!      'lto-partitions'
            Specify desired number of partitions produced during WHOPR
            compilation.  The number of partitions should exceed the
            number of CPUs used for compilation.  The default value is 32.
  
!      'lto-minpartition'
            Size of minimal partition for WHOPR (in estimated
!           instructions).  This prevents expenses of splitting very small
!           programs into too many partitions.
  
!      'cxx-max-namespaces-for-diagnostic-help'
            The maximum number of namespaces to consult for suggestions
            when C++ name lookup fails for an identifier.  The default is
            1000.
  
!      'sink-frequency-threshold'
            The maximum relative execution frequency (in percents) of the
!           target block relative to a statement's original block to allow
!           statement sinking of a statement.  Larger numbers result in
!           more aggressive statement sinking.  The default value is 75.
!           A small positive adjustment is applied for statements with
!           memory operands as those are even more profitable so sink.
  
!      'max-stores-to-sink'
            The maximum number of conditional stores paires that can be
!           sunk.  Set to 0 if either vectorization ('-ftree-vectorize')
!           or if-conversion ('-ftree-loop-if-convert') is disabled.  The
            default is 2.
  
!      'allow-store-data-races'
            Allow optimizers to introduce new data races on stores.  Set
            to 1 to allow, otherwise to 0.  This option is enabled by
!           default at optimization level '-Ofast'.
  
!      'case-values-threshold'
            The smallest number of different values for which it is best
!           to use a jump-table instead of a tree of conditional branches.
!           If the value is 0, use the default for the machine.  The
!           default is 0.
  
!      'tree-reassoc-width'
            Set the maximum number of instructions executed in parallel in
!           reassociated tree.  This parameter overrides target dependent
            heuristics used by default if has non zero value.
  
!      'sched-pressure-algorithm'
            Choose between the two available implementations of
!           '-fsched-pressure'.  Algorithm 1 is the original
            implementation and is the more likely to prevent instructions
            from being reordered.  Algorithm 2 was designed to be a
            compromise between the relatively conservative approach taken
!           by algorithm 1 and the rather aggressive approach taken by the
!           default scheduler.  It relies more heavily on having a regular
!           register file and accurate register pressure classes.  See
!           'haifa-sched.c' in the GCC sources for more details.
  
            The default choice depends on the target.
  
!      'max-slsr-cand-scan'
            Set the maximum number of existing candidates that are
            considered when seeking a basis for a new straight-line
            strength reduction candidate.
  
!      'asan-globals'
            Enable buffer overflow detection for global objects.  This
            kind of protection is enabled by default if you are using
!           '-fsanitize=address' option.  To disable global objects
!           protection use '--param asan-globals=0'.
  
!      'asan-stack'
!           Enable buffer overflow detection for stack objects.  This kind
!           of protection is enabled by default when
!           using'-fsanitize=address'.  To disable stack protection use
!           '--param asan-stack=0' option.
  
!      'asan-instrument-reads'
            Enable buffer overflow detection for memory reads.  This kind
            of protection is enabled by default when using
!           '-fsanitize=address'.  To disable memory reads protection use
!           '--param asan-instrument-reads=0'.
  
!      'asan-instrument-writes'
!           Enable buffer overflow detection for memory writes.  This kind
!           of protection is enabled by default when using
!           '-fsanitize=address'.  To disable memory writes protection use
!           '--param asan-instrument-writes=0' option.
  
!      'asan-memintrin'
            Enable detection for built-in functions.  This kind of
            protection is enabled by default when using
!           '-fsanitize=address'.  To disable built-in functions
!           protection use '--param asan-memintrin=0'.
  
!      'asan-use-after-return'
            Enable detection of use-after-return.  This kind of protection
!           is enabled by default when using '-fsanitize=address' option.
!           To disable use-after-return detection use '--param
            asan-use-after-return=0'.
  
!      'asan-instrumentation-with-call-threshold'
!           If number of memory accesses in function being instrumented is
!           greater or equal to this number, use callbacks instead of
!           inline checks.  E.g.  to disable inline code use '--param
            asan-instrumentation-with-call-threshold=0'.
  
!      'chkp-max-ctor-size'
            Static constructors generated by Pointer Bounds Checker may
            become very large and significantly increase compile time at
!           optimization level '-O1' and higher.  This parameter is a
            maximum nubmer of statements in a single generated
            constructor.  Default value is 5000.
  
!      'max-fsm-thread-path-insns'
!           Maximum number of instructions to copy when duplicating blocks
!           on a finite state automaton jump thread path.  The default is
!           100.
  
!      'max-fsm-thread-length'
            Maximum number of basic blocks on a finite state automaton
            jump thread path.  The default is 10.
  
!      'max-fsm-thread-paths'
!           Maximum number of new jump thread paths to create for a finite
!           state automaton.  The default is 50.
  
  
  File: gcc.info,  Node: Preprocessor Options,  Next: Assembler Options,  Prev: Optimize Options,  Up: Invoking GCC
*************** File: gcc.info,  Node: Preprocessor Opti
*** 10164,10213 ****
  These options control the C preprocessor, which is run on each C source
  file before actual compilation.
  
!  If you use the `-E' option, nothing is done except preprocessing.
! Some of these options make sense only together with `-E' because they
! cause the preprocessor output to be unsuitable for actual compilation.
  
! `-Wp,OPTION'
!      You can use `-Wp,OPTION' to bypass the compiler driver and pass
       OPTION directly through to the preprocessor.  If OPTION contains
       commas, it is split into multiple options at the commas.  However,
       many options are modified, translated or interpreted by the
!      compiler driver before being passed to the preprocessor, and `-Wp'
       forcibly bypasses this phase.  The preprocessor's direct interface
       is undocumented and subject to change, so whenever possible you
!      should avoid using `-Wp' and let the driver handle the options
       instead.
  
! `-Xpreprocessor OPTION'
       Pass OPTION as an option to the preprocessor.  You can use this to
       supply system-specific preprocessor options that GCC does not
       recognize.
  
       If you want to pass an option that takes an argument, you must use
!      `-Xpreprocessor' twice, once for the option and once for the
       argument.
  
! `-no-integrated-cpp'
       Perform preprocessing as a separate pass before compilation.  By
       default, GCC performs preprocessing as an integrated part of input
       tokenization and parsing.  If this option is provided, the
!      appropriate language front end (`cc1', `cc1plus', or `cc1obj' for
       C, C++, and Objective-C, respectively) is instead invoked twice,
       once for preprocessing only and once for actual compilation of the
       preprocessed input.  This option may be useful in conjunction with
!      the `-B' or `-wrapper' options to specify an alternate
!      preprocessor or perform additional processing of the program
!      source between normal preprocessing and compilation.
  
! `-D NAME'
!      Predefine NAME as a macro, with definition `1'.
  
! `-D NAME=DEFINITION'
       The contents of DEFINITION are tokenized and processed as if they
!      appeared during translation phase three in a `#define' directive.
!      In particular, the definition will be truncated by embedded
!      newline characters.
  
       If you are invoking the preprocessor from a shell or shell-like
       program you may need to use the shell's quoting syntax to protect
--- 10108,10157 ----
  These options control the C preprocessor, which is run on each C source
  file before actual compilation.
  
!  If you use the '-E' option, nothing is done except preprocessing.  Some
! of these options make sense only together with '-E' because they cause
! the preprocessor output to be unsuitable for actual compilation.
  
! '-Wp,OPTION'
!      You can use '-Wp,OPTION' to bypass the compiler driver and pass
       OPTION directly through to the preprocessor.  If OPTION contains
       commas, it is split into multiple options at the commas.  However,
       many options are modified, translated or interpreted by the
!      compiler driver before being passed to the preprocessor, and '-Wp'
       forcibly bypasses this phase.  The preprocessor's direct interface
       is undocumented and subject to change, so whenever possible you
!      should avoid using '-Wp' and let the driver handle the options
       instead.
  
! '-Xpreprocessor OPTION'
       Pass OPTION as an option to the preprocessor.  You can use this to
       supply system-specific preprocessor options that GCC does not
       recognize.
  
       If you want to pass an option that takes an argument, you must use
!      '-Xpreprocessor' twice, once for the option and once for the
       argument.
  
! '-no-integrated-cpp'
       Perform preprocessing as a separate pass before compilation.  By
       default, GCC performs preprocessing as an integrated part of input
       tokenization and parsing.  If this option is provided, the
!      appropriate language front end ('cc1', 'cc1plus', or 'cc1obj' for
       C, C++, and Objective-C, respectively) is instead invoked twice,
       once for preprocessing only and once for actual compilation of the
       preprocessed input.  This option may be useful in conjunction with
!      the '-B' or '-wrapper' options to specify an alternate preprocessor
!      or perform additional processing of the program source between
!      normal preprocessing and compilation.
  
! '-D NAME'
!      Predefine NAME as a macro, with definition '1'.
  
! '-D NAME=DEFINITION'
       The contents of DEFINITION are tokenized and processed as if they
!      appeared during translation phase three in a '#define' directive.
!      In particular, the definition will be truncated by embedded newline
!      characters.
  
       If you are invoking the preprocessor from a shell or shell-like
       program you may need to use the shell's quoting syntax to protect
*************** cause the preprocessor output to be unsu
*** 10216,10289 ****
       If you wish to define a function-like macro on the command line,
       write its argument list with surrounding parentheses before the
       equals sign (if any).  Parentheses are meaningful to most shells,
!      so you will need to quote the option.  With `sh' and `csh',
!      `-D'NAME(ARGS...)=DEFINITION'' works.
  
!      `-D' and `-U' options are processed in the order they are given on
!      the command line.  All `-imacros FILE' and `-include FILE' options
!      are processed after all `-D' and `-U' options.
  
! `-U NAME'
!      Cancel any previous definition of NAME, either built in or
!      provided with a `-D' option.
  
! `-undef'
       Do not predefine any system-specific or GCC-specific macros.  The
       standard predefined macros remain defined.
  
! `-I DIR'
!      Add the directory DIR to the list of directories to be searched
!      for header files.  Directories named by `-I' are searched before
!      the standard system include directories.  If the directory DIR is
!      a standard system include directory, the option is ignored to
!      ensure that the default search order for system directories and
!      the special treatment of system headers are not defeated .  If DIR
!      begins with `=', then the `=' will be replaced by the sysroot
!      prefix; see `--sysroot' and `-isysroot'.
  
! `-o FILE'
       Write output to FILE.  This is the same as specifying FILE as the
!      second non-option argument to `cpp'.  `gcc' has a different
       interpretation of a second non-option argument, so you must use
!      `-o' to specify the output file.
  
! `-Wall'
       Turns on all optional warnings which are desirable for normal code.
!      At present this is `-Wcomment', `-Wtrigraphs', `-Wmultichar' and a
!      warning about integer promotion causing a change of sign in `#if'
       expressions.  Note that many of the preprocessor's warnings are on
       by default and have no options to control them.
  
! `-Wcomment'
! `-Wcomments'
!      Warn whenever a comment-start sequence `/*' appears in a `/*'
!      comment, or whenever a backslash-newline appears in a `//' comment.
       (Both forms have the same effect.)
  
! `-Wtrigraphs'
       Most trigraphs in comments cannot affect the meaning of the
       program.  However, a trigraph that would form an escaped newline
!      (`??/' at the end of a line) can, by changing where the comment
       begins or ends.  Therefore, only trigraphs that would form escaped
       newlines produce warnings inside a comment.
  
!      This option is implied by `-Wall'.  If `-Wall' is not given, this
       option is still enabled unless trigraphs are enabled.  To get
!      trigraph conversion without warnings, but get the other `-Wall'
!      warnings, use `-trigraphs -Wall -Wno-trigraphs'.
  
! `-Wtraditional'
       Warn about certain constructs that behave differently in
       traditional and ISO C.  Also warn about ISO C constructs that have
       no traditional C equivalent, and problematic constructs which
       should be avoided.
  
! `-Wundef'
       Warn whenever an identifier which is not a macro is encountered in
!      an `#if' directive, outside of `defined'.  Such identifiers are
       replaced with zero.
  
! `-Wunused-macros'
       Warn about macros defined in the main file that are unused.  A
       macro is "used" if it is expanded or tested for existence at least
       once.  The preprocessor will also warn if the macro has not been
--- 10160,10233 ----
       If you wish to define a function-like macro on the command line,
       write its argument list with surrounding parentheses before the
       equals sign (if any).  Parentheses are meaningful to most shells,
!      so you will need to quote the option.  With 'sh' and 'csh',
!      '-D'NAME(ARGS...)=DEFINITION'' works.
  
!      '-D' and '-U' options are processed in the order they are given on
!      the command line.  All '-imacros FILE' and '-include FILE' options
!      are processed after all '-D' and '-U' options.
  
! '-U NAME'
!      Cancel any previous definition of NAME, either built in or provided
!      with a '-D' option.
  
! '-undef'
       Do not predefine any system-specific or GCC-specific macros.  The
       standard predefined macros remain defined.
  
! '-I DIR'
!      Add the directory DIR to the list of directories to be searched for
!      header files.  Directories named by '-I' are searched before the
!      standard system include directories.  If the directory DIR is a
!      standard system include directory, the option is ignored to ensure
!      that the default search order for system directories and the
!      special treatment of system headers are not defeated .  If DIR
!      begins with '=', then the '=' will be replaced by the sysroot
!      prefix; see '--sysroot' and '-isysroot'.
  
! '-o FILE'
       Write output to FILE.  This is the same as specifying FILE as the
!      second non-option argument to 'cpp'.  'gcc' has a different
       interpretation of a second non-option argument, so you must use
!      '-o' to specify the output file.
  
! '-Wall'
       Turns on all optional warnings which are desirable for normal code.
!      At present this is '-Wcomment', '-Wtrigraphs', '-Wmultichar' and a
!      warning about integer promotion causing a change of sign in '#if'
       expressions.  Note that many of the preprocessor's warnings are on
       by default and have no options to control them.
  
! '-Wcomment'
! '-Wcomments'
!      Warn whenever a comment-start sequence '/*' appears in a '/*'
!      comment, or whenever a backslash-newline appears in a '//' comment.
       (Both forms have the same effect.)
  
! '-Wtrigraphs'
       Most trigraphs in comments cannot affect the meaning of the
       program.  However, a trigraph that would form an escaped newline
!      ('??/' at the end of a line) can, by changing where the comment
       begins or ends.  Therefore, only trigraphs that would form escaped
       newlines produce warnings inside a comment.
  
!      This option is implied by '-Wall'.  If '-Wall' is not given, this
       option is still enabled unless trigraphs are enabled.  To get
!      trigraph conversion without warnings, but get the other '-Wall'
!      warnings, use '-trigraphs -Wall -Wno-trigraphs'.
  
! '-Wtraditional'
       Warn about certain constructs that behave differently in
       traditional and ISO C.  Also warn about ISO C constructs that have
       no traditional C equivalent, and problematic constructs which
       should be avoided.
  
! '-Wundef'
       Warn whenever an identifier which is not a macro is encountered in
!      an '#if' directive, outside of 'defined'.  Such identifiers are
       replaced with zero.
  
! '-Wunused-macros'
       Warn about macros defined in the main file that are unused.  A
       macro is "used" if it is expanded or tested for existence at least
       once.  The preprocessor will also warn if the macro has not been
*************** cause the preprocessor output to be unsu
*** 10302,10310 ****
            #if defined the_macro_causing_the_warning
            #endif
  
! `-Wendif-labels'
!      Warn whenever an `#else' or an `#endif' are followed by text.
!      This usually happens in code of the form
  
            #if FOO
            ...
--- 10246,10254 ----
            #if defined the_macro_causing_the_warning
            #endif
  
! '-Wendif-labels'
!      Warn whenever an '#else' or an '#endif' are followed by text.  This
!      usually happens in code of the form
  
            #if FOO
            ...
*************** cause the preprocessor output to be unsu
*** 10312,10403 ****
            ...
            #endif FOO
  
!      The second and third `FOO' should be in comments, but often are not
       in older programs.  This warning is on by default.
  
! `-Werror'
       Make all warnings into hard errors.  Source code which triggers
       warnings will be rejected.
  
! `-Wsystem-headers'
       Issue warnings for code in system headers.  These are normally
       unhelpful in finding bugs in your own code, therefore suppressed.
       If you are responsible for the system library, you may want to see
       them.
  
! `-w'
       Suppress all warnings, including those which GNU CPP issues by
       default.
  
! `-pedantic'
!      Issue all the mandatory diagnostics listed in the C standard.
!      Some of them are left out by default, since they trigger
!      frequently on harmless code.
  
! `-pedantic-errors'
       Issue all the mandatory diagnostics, and make all mandatory
       diagnostics into errors.  This includes mandatory diagnostics that
!      GCC issues without `-pedantic' but treats as warnings.
  
! `-M'
       Instead of outputting the result of preprocessing, output a rule
!      suitable for `make' describing the dependencies of the main source
!      file.  The preprocessor outputs one `make' rule containing the
       object file name for that source file, a colon, and the names of
!      all the included files, including those coming from `-include' or
!      `-imacros' command-line options.
  
!      Unless specified explicitly (with `-MT' or `-MQ'), the object file
       name consists of the name of the source file with any suffix
       replaced with object file suffix and with any leading directory
       parts removed.  If there are many included files then the rule is
!      split into several lines using `\'-newline.  The rule has no
       commands.
  
!      This option does not suppress the preprocessor's debug output,
!      such as `-dM'.  To avoid mixing such debug output with the
!      dependency rules you should explicitly specify the dependency
!      output file with `-MF', or use an environment variable like
!      `DEPENDENCIES_OUTPUT' (*note Environment Variables::).  Debug
!      output will still be sent to the regular output stream as normal.
  
!      Passing `-M' to the driver implies `-E', and suppresses warnings
!      with an implicit `-w'.
  
! `-MM'
!      Like `-M' but do not mention header files that are found in system
!      header directories, nor header files that are included, directly
!      or indirectly, from such a header.
  
       This implies that the choice of angle brackets or double quotes in
!      an `#include' directive does not in itself determine whether that
!      header will appear in `-MM' dependency output.  This is a slight
       change in semantics from GCC versions 3.0 and earlier.
  
! `-MF FILE'
!      When used with `-M' or `-MM', specifies a file to write the
!      dependencies to.  If no `-MF' switch is given the preprocessor
       sends the rules to the same place it would have sent preprocessed
       output.
  
!      When used with the driver options `-MD' or `-MMD', `-MF' overrides
       the default dependency output file.
  
! `-MG'
!      In conjunction with an option such as `-M' requesting dependency
!      generation, `-MG' assumes missing header files are generated files
!      and adds them to the dependency list without raising an error.
!      The dependency filename is taken directly from the `#include'
!      directive without prepending any path.  `-MG' also suppresses
!      preprocessed output, as a missing header file renders this useless.
  
       This feature is used in automatic updating of makefiles.
  
! `-MP'
       This option instructs CPP to add a phony target for each dependency
       other than the main file, causing each to depend on nothing.  These
!      dummy rules work around errors `make' gives if you remove header
!      files without updating the `Makefile' to match.
  
       This is typical output:
  
--- 10256,10347 ----
            ...
            #endif FOO
  
!      The second and third 'FOO' should be in comments, but often are not
       in older programs.  This warning is on by default.
  
! '-Werror'
       Make all warnings into hard errors.  Source code which triggers
       warnings will be rejected.
  
! '-Wsystem-headers'
       Issue warnings for code in system headers.  These are normally
       unhelpful in finding bugs in your own code, therefore suppressed.
       If you are responsible for the system library, you may want to see
       them.
  
! '-w'
       Suppress all warnings, including those which GNU CPP issues by
       default.
  
! '-pedantic'
!      Issue all the mandatory diagnostics listed in the C standard.  Some
!      of them are left out by default, since they trigger frequently on
!      harmless code.
  
! '-pedantic-errors'
       Issue all the mandatory diagnostics, and make all mandatory
       diagnostics into errors.  This includes mandatory diagnostics that
!      GCC issues without '-pedantic' but treats as warnings.
  
! '-M'
       Instead of outputting the result of preprocessing, output a rule
!      suitable for 'make' describing the dependencies of the main source
!      file.  The preprocessor outputs one 'make' rule containing the
       object file name for that source file, a colon, and the names of
!      all the included files, including those coming from '-include' or
!      '-imacros' command-line options.
  
!      Unless specified explicitly (with '-MT' or '-MQ'), the object file
       name consists of the name of the source file with any suffix
       replaced with object file suffix and with any leading directory
       parts removed.  If there are many included files then the rule is
!      split into several lines using '\'-newline.  The rule has no
       commands.
  
!      This option does not suppress the preprocessor's debug output, such
!      as '-dM'.  To avoid mixing such debug output with the dependency
!      rules you should explicitly specify the dependency output file with
!      '-MF', or use an environment variable like 'DEPENDENCIES_OUTPUT'
!      (*note Environment Variables::).  Debug output will still be sent
!      to the regular output stream as normal.
  
!      Passing '-M' to the driver implies '-E', and suppresses warnings
!      with an implicit '-w'.
  
! '-MM'
!      Like '-M' but do not mention header files that are found in system
!      header directories, nor header files that are included, directly or
!      indirectly, from such a header.
  
       This implies that the choice of angle brackets or double quotes in
!      an '#include' directive does not in itself determine whether that
!      header will appear in '-MM' dependency output.  This is a slight
       change in semantics from GCC versions 3.0 and earlier.
  
! '-MF FILE'
!      When used with '-M' or '-MM', specifies a file to write the
!      dependencies to.  If no '-MF' switch is given the preprocessor
       sends the rules to the same place it would have sent preprocessed
       output.
  
!      When used with the driver options '-MD' or '-MMD', '-MF' overrides
       the default dependency output file.
  
! '-MG'
!      In conjunction with an option such as '-M' requesting dependency
!      generation, '-MG' assumes missing header files are generated files
!      and adds them to the dependency list without raising an error.  The
!      dependency filename is taken directly from the '#include' directive
!      without prepending any path.  '-MG' also suppresses preprocessed
!      output, as a missing header file renders this useless.
  
       This feature is used in automatic updating of makefiles.
  
! '-MP'
       This option instructs CPP to add a phony target for each dependency
       other than the main file, causing each to depend on nothing.  These
!      dummy rules work around errors 'make' gives if you remove header
!      files without updating the 'Makefile' to match.
  
       This is typical output:
  
*************** cause the preprocessor output to be unsu
*** 10405,10454 ****
  
            test.h:
  
! `-MT TARGET'
       Change the target of the rule emitted by dependency generation.  By
       default CPP takes the name of the main input file, deletes any
!      directory components and any file suffix such as `.c', and appends
       the platform's usual object suffix.  The result is the target.
  
!      An `-MT' option will set the target to be exactly the string you
       specify.  If you want multiple targets, you can specify them as a
!      single argument to `-MT', or use multiple `-MT' options.
  
!      For example, `-MT '$(objpfx)foo.o'' might give
  
            $(objpfx)foo.o: foo.c
  
! `-MQ TARGET'
!      Same as `-MT', but it quotes any characters which are special to
!      Make.  `-MQ '$(objpfx)foo.o'' gives
  
            $$(objpfx)foo.o: foo.c
  
       The default target is automatically quoted, as if it were given
!      with `-MQ'.
  
! `-MD'
!      `-MD' is equivalent to `-M -MF FILE', except that `-E' is not
!      implied.  The driver determines FILE based on whether an `-o'
!      option is given.  If it is, the driver uses its argument but with
!      a suffix of `.d', otherwise it takes the name of the input file,
!      removes any directory components and suffix, and applies a `.d'
       suffix.
  
!      If `-MD' is used in conjunction with `-E', any `-o' switch is
       understood to specify the dependency output file (*note -MF:
!      dashMF.), but if used without `-E', each `-o' is understood to
       specify a target object file.
  
!      Since `-E' is not implied, `-MD' can be used to generate a
       dependency output file as a side-effect of the compilation process.
  
! `-MMD'
!      Like `-MD' except mention only user header files, not system
!      header files.
  
! `-fpch-deps'
       When using precompiled headers (*note Precompiled Headers::), this
       flag will cause the dependency-output flags to also list the files
       from the precompiled header's dependencies.  If not specified only
--- 10349,10400 ----
  
            test.h:
  
! '-MT TARGET'
! 
       Change the target of the rule emitted by dependency generation.  By
       default CPP takes the name of the main input file, deletes any
!      directory components and any file suffix such as '.c', and appends
       the platform's usual object suffix.  The result is the target.
  
!      An '-MT' option will set the target to be exactly the string you
       specify.  If you want multiple targets, you can specify them as a
!      single argument to '-MT', or use multiple '-MT' options.
  
!      For example, '-MT '$(objpfx)foo.o'' might give
  
            $(objpfx)foo.o: foo.c
  
! '-MQ TARGET'
! 
!      Same as '-MT', but it quotes any characters which are special to
!      Make.  '-MQ '$(objpfx)foo.o'' gives
  
            $$(objpfx)foo.o: foo.c
  
       The default target is automatically quoted, as if it were given
!      with '-MQ'.
  
! '-MD'
!      '-MD' is equivalent to '-M -MF FILE', except that '-E' is not
!      implied.  The driver determines FILE based on whether an '-o'
!      option is given.  If it is, the driver uses its argument but with a
!      suffix of '.d', otherwise it takes the name of the input file,
!      removes any directory components and suffix, and applies a '.d'
       suffix.
  
!      If '-MD' is used in conjunction with '-E', any '-o' switch is
       understood to specify the dependency output file (*note -MF:
!      dashMF.), but if used without '-E', each '-o' is understood to
       specify a target object file.
  
!      Since '-E' is not implied, '-MD' can be used to generate a
       dependency output file as a side-effect of the compilation process.
  
! '-MMD'
!      Like '-MD' except mention only user header files, not system header
!      files.
  
! '-fpch-deps'
       When using precompiled headers (*note Precompiled Headers::), this
       flag will cause the dependency-output flags to also list the files
       from the precompiled header's dependencies.  If not specified only
*************** cause the preprocessor output to be unsu
*** 10456,10878 ****
       used to create it because those files are not consulted when a
       precompiled header is used.
  
! `-fpch-preprocess'
       This option allows use of a precompiled header (*note Precompiled
!      Headers::) together with `-E'.  It inserts a special `#pragma',
!      `#pragma GCC pch_preprocess "FILENAME"' in the output to mark the
       place where the precompiled header was found, and its FILENAME.
!      When `-fpreprocessed' is in use, GCC recognizes this `#pragma' and
       loads the PCH.
  
       This option is off by default, because the resulting preprocessed
       output is only really suitable as input to GCC.  It is switched on
!      by `-save-temps'.
  
!      You should not write this `#pragma' in your own code, but it is
       safe to edit the filename if the PCH file is available in a
       different location.  The filename may be absolute or it may be
       relative to GCC's current directory.
  
! `-x c'
! `-x c++'
! `-x objective-c'
! `-x assembler-with-cpp'
       Specify the source language: C, C++, Objective-C, or assembly.
!      This has nothing to do with standards conformance or extensions;
!      it merely selects which base syntax to expect.  If you give none
!      of these options, cpp will deduce the language from the extension
!      of the source file: `.c', `.cc', `.m', or `.S'.  Some other common
       extensions for C++ and assembly are also recognized.  If cpp does
       not recognize the extension, it will treat the file as C; this is
       the most generic mode.
  
!      _Note:_ Previous versions of cpp accepted a `-lang' option which
       selected both the language and the standards conformance level.
!      This option has been removed, because it conflicts with the `-l'
       option.
  
! `-std=STANDARD'
! `-ansi'
       Specify the standard to which the code should conform.  Currently
       CPP knows about C and C++ standards; others may be added in the
       future.
  
       STANDARD may be one of:
!     `c90'
!     `c89'
!     `iso9899:1990'
!           The ISO C standard from 1990.  `c90' is the customary
            shorthand for this version of the standard.
  
!           The `-ansi' option is equivalent to `-std=c90'.
  
!     `iso9899:199409'
            The 1990 C standard, as amended in 1994.
  
!     `iso9899:1999'
!     `c99'
!     `iso9899:199x'
!     `c9x'
            The revised ISO C standard, published in December 1999.
            Before publication, this was known as C9X.
  
!     `iso9899:2011'
!     `c11'
!     `c1x'
            The revised ISO C standard, published in December 2011.
            Before publication, this was known as C1X.
  
!     `gnu90'
!     `gnu89'
            The 1990 C standard plus GNU extensions.  This is the default.
  
!     `gnu99'
!     `gnu9x'
            The 1999 C standard plus GNU extensions.
  
!     `gnu11'
!     `gnu1x'
            The 2011 C standard plus GNU extensions.
  
!     `c++98'
            The 1998 ISO C++ standard plus amendments.
  
!     `gnu++98'
!           The same as `-std=c++98' plus GNU extensions.  This is the
            default for C++ code.
  
! `-I-'
!      Split the include path.  Any directories specified with `-I'
!      options before `-I-' are searched only for headers requested with
!      `#include "FILE"'; they are not searched for `#include <FILE>'.
!      If additional directories are specified with `-I' options after
!      the `-I-', those directories are searched for all `#include'
       directives.
  
!      In addition, `-I-' inhibits the use of the directory of the current
!      file directory as the first search directory for `#include "FILE"'.
       This option has been deprecated.
  
! `-nostdinc'
       Do not search the standard system directories for header files.
!      Only the directories you have specified with `-I' options (and the
       directory of the current file, if appropriate) are searched.
  
! `-nostdinc++'
       Do not search for header files in the C++-specific standard
       directories, but do still search the other standard directories.
       (This option is used when building the C++ library.)
  
! `-include FILE'
!      Process FILE as if `#include "file"' appeared as the first line of
!      the primary source file.  However, the first directory searched
!      for FILE is the preprocessor's working directory _instead of_ the
       directory containing the main source file.  If not found there, it
!      is searched for in the remainder of the `#include "..."' search
       chain as normal.
  
!      If multiple `-include' options are given, the files are included
!      in the order they appear on the command line.
  
! `-imacros FILE'
!      Exactly like `-include', except that any output produced by
       scanning FILE is thrown away.  Macros it defines remain defined.
       This allows you to acquire all the macros from a header without
       also processing its declarations.
  
!      All files specified by `-imacros' are processed before all files
!      specified by `-include'.
  
! `-idirafter DIR'
       Search DIR for header files, but do it _after_ all directories
!      specified with `-I' and the standard system directories have been
       exhausted.  DIR is treated as a system include directory.  If DIR
!      begins with `=', then the `=' will be replaced by the sysroot
!      prefix; see `--sysroot' and `-isysroot'.
  
! `-iprefix PREFIX'
!      Specify PREFIX as the prefix for subsequent `-iwithprefix'
!      options.  If the prefix represents a directory, you should include
!      the final `/'.
  
! `-iwithprefix DIR'
! `-iwithprefixbefore DIR'
!      Append DIR to the prefix specified previously with `-iprefix', and
       add the resulting directory to the include search path.
!      `-iwithprefixbefore' puts it in the same place `-I' would;
!      `-iwithprefix' puts it where `-idirafter' would.
  
! `-isysroot DIR'
!      This option is like the `--sysroot' option, but applies only to
       header files (except for Darwin targets, where it applies to both
!      header files and libraries).  See the `--sysroot' option for more
       information.
  
! `-imultilib DIR'
       Use DIR as a subdirectory of the directory containing
       target-specific C++ headers.
  
! `-isystem DIR'
       Search DIR for header files, after all directories specified by
!      `-I' but before the standard system directories.  Mark it as a
       system directory, so that it gets the same special treatment as is
       applied to the standard system directories.  If DIR begins with
!      `=', then the `=' will be replaced by the sysroot prefix; see
!      `--sysroot' and `-isysroot'.
  
! `-iquote DIR'
!      Search DIR only for header files requested with `#include "FILE"';
!      they are not searched for `#include <FILE>', before all
!      directories specified by `-I' and before the standard system
!      directories.  If DIR begins with `=', then the `=' will be replaced
!      by the sysroot prefix; see `--sysroot' and `-isysroot'.
  
! `-fdirectives-only'
       When preprocessing, handle directives, but do not expand macros.
  
!      The option's behavior depends on the `-E' and `-fpreprocessed'
       options.
  
!      With `-E', preprocessing is limited to the handling of directives
!      such as `#define', `#ifdef', and `#error'.  Other preprocessor
!      operations, such as macro expansion and trigraph conversion are
!      not performed.  In addition, the `-dD' option is implicitly
!      enabled.
  
!      With `-fpreprocessed', predefinition of command line and most
!      builtin macros is disabled.  Macros such as `__LINE__', which are
       contextually dependent, are handled normally.  This enables
!      compilation of files previously preprocessed with `-E
       -fdirectives-only'.
  
!      With both `-E' and `-fpreprocessed', the rules for
!      `-fpreprocessed' take precedence.  This enables full preprocessing
!      of files previously preprocessed with `-E -fdirectives-only'.
  
! `-fdollars-in-identifiers'
!      Accept `$' in identifiers.
  
! `-fextended-identifiers'
       Accept universal character names in identifiers.  This option is
       enabled by default for C99 (and later C standard versions) and C++.
  
! `-fno-canonical-system-headers'
       When preprocessing, do not shorten system header paths with
       canonicalization.
  
! `-fpreprocessed'
       Indicate to the preprocessor that the input file has already been
       preprocessed.  This suppresses things like macro expansion,
       trigraph conversion, escaped newline splicing, and processing of
       most directives.  The preprocessor still recognizes and removes
!      comments, so that you can pass a file preprocessed with `-C' to
!      the compiler without problems.  In this mode the integrated
       preprocessor is little more than a tokenizer for the front ends.
  
!      `-fpreprocessed' is implicit if the input file has one of the
!      extensions `.i', `.ii' or `.mi'.  These are the extensions that
!      GCC uses for preprocessed files created by `-save-temps'.
  
! `-ftabstop=WIDTH'
       Set the distance between tab stops.  This helps the preprocessor
       report correct column numbers in warnings or errors, even if tabs
       appear on the line.  If the value is less than 1 or greater than
       100, the option is ignored.  The default is 8.
  
! `-fdebug-cpp'
!      This option is only useful for debugging GCC.  When used with
!      `-E', dumps debugging information about location maps.  Every
!      token in the output is preceded by the dump of the map its location
!      belongs to.  The dump of the map holding the location of a token
!      would be:
!           {`P':`/file/path';`F':`/includer/path';`L':LINE_NUM;`C':COL_NUM;`S':SYSTEM_HEADER_P;`M':MAP_ADDRESS;`E':MACRO_EXPANSION_P,`loc':LOCATION}
  
!      When used without `-E', this option has no effect.
  
! `-ftrack-macro-expansion[=LEVEL]'
!      Track locations of tokens across macro expansions. This allows the
       compiler to emit diagnostic about the current macro expansion stack
!      when a compilation error occurs in a macro expansion. Using this
!      option makes the preprocessor and the compiler consume more
!      memory. The LEVEL parameter can be used to choose the level of
!      precision of token location tracking thus decreasing the memory
!      consumption if necessary. Value `0' of LEVEL de-activates this
!      option just as if no `-ftrack-macro-expansion' was present on the
!      command line. Value `1' tracks tokens locations in a degraded mode
!      for the sake of minimal memory overhead. In this mode all tokens
!      resulting from the expansion of an argument of a function-like
!      macro have the same location. Value `2' tracks tokens locations
!      completely. This value is the most memory hungry.  When this
!      option is given no argument, the default parameter value is `2'.
  
!      Note that `-ftrack-macro-expansion=2' is activated by default.
  
! `-fexec-charset=CHARSET'
       Set the execution character set, used for string and character
       constants.  The default is UTF-8.  CHARSET can be any encoding
!      supported by the system's `iconv' library routine.
  
! `-fwide-exec-charset=CHARSET'
       Set the wide execution character set, used for wide string and
       character constants.  The default is UTF-32 or UTF-16, whichever
!      corresponds to the width of `wchar_t'.  As with `-fexec-charset',
!      CHARSET can be any encoding supported by the system's `iconv'
       library routine; however, you will have problems with encodings
!      that do not fit exactly in `wchar_t'.
  
! `-finput-charset=CHARSET'
       Set the input character set, used for translation from the
!      character set of the input file to the source character set used
!      by GCC.  If the locale does not specify, or GCC cannot get this
       information from the locale, the default is UTF-8.  This can be
       overridden by either the locale or this command-line option.
       Currently the command-line option takes precedence if there's a
       conflict.  CHARSET can be any encoding supported by the system's
!      `iconv' library routine.
  
! `-fworking-directory'
       Enable generation of linemarkers in the preprocessor output that
       will let the compiler know the current working directory at the
       time of preprocessing.  When this option is enabled, the
       preprocessor will emit, after the initial linemarker, a second
       linemarker with the current working directory followed by two
       slashes.  GCC will use this directory, when it's present in the
!      preprocessed input, as the directory emitted as the current
!      working directory in some debugging information formats.  This
!      option is implicitly enabled if debugging information is enabled,
!      but this can be inhibited with the negated form
!      `-fno-working-directory'.  If the `-P' flag is present in the
!      command line, this option has no effect, since no `#line'
!      directives are emitted whatsoever.
  
! `-fno-show-column'
       Do not print column numbers in diagnostics.  This may be necessary
       if diagnostics are being scanned by a program that does not
!      understand the column numbers, such as `dejagnu'.
  
! `-A PREDICATE=ANSWER'
       Make an assertion with the predicate PREDICATE and answer ANSWER.
!      This form is preferred to the older form `-A PREDICATE(ANSWER)',
       which is still supported, because it does not use shell special
       characters.
  
! `-A -PREDICATE=ANSWER'
       Cancel an assertion with the predicate PREDICATE and answer ANSWER.
  
! `-dCHARS'
!      CHARS is a sequence of one or more of the following characters,
!      and must not be preceded by a space.  Other characters are
!      interpreted by the compiler proper, or reserved for future
!      versions of GCC, and so are silently ignored.  If you specify
!      characters whose behavior conflicts, the result is undefined.
  
!     `M'
!           Instead of the normal output, generate a list of `#define'
            directives for all the macros defined during the execution of
!           the preprocessor, including predefined macros.  This gives
!           you a way of finding out what is predefined in your version
!           of the preprocessor.  Assuming you have no file `foo.h', the
!           command
  
                 touch foo.h; cpp -dM foo.h
  
            will show all the predefined macros.
  
!           If you use `-dM' without the `-E' option, `-dM' is
!           interpreted as a synonym for `-fdump-rtl-mach'.  *Note
!           Debugging Options: (gcc)Debugging Options.
  
!     `D'
!           Like `M' except in two respects: it does _not_ include the
!           predefined macros, and it outputs _both_ the `#define'
            directives and the result of preprocessing.  Both kinds of
            output go to the standard output file.
  
!     `N'
!           Like `D', but emit only the macro names, not their expansions.
  
!     `I'
!           Output `#include' directives in addition to the result of
            preprocessing.
  
!     `U'
!           Like `D' except that only macros that are expanded, or whose
            definedness is tested in preprocessor directives, are output;
            the output is delayed until the use or test of the macro; and
!           `#undef' directives are also output for macros tested but
            undefined at the time.
  
! `-P'
       Inhibit generation of linemarkers in the output from the
       preprocessor.  This might be useful when running the preprocessor
       on something that is not C code, and will be sent to a program
       which might be confused by the linemarkers.
  
! `-C'
       Do not discard comments.  All comments are passed through to the
!      output file, except for comments in processed directives, which
!      are deleted along with the directive.
  
!      You should be prepared for side effects when using `-C'; it causes
       the preprocessor to treat comments as tokens in their own right.
       For example, comments appearing at the start of what would be a
       directive line have the effect of turning that line into an
       ordinary source line, since the first token on the line is no
!      longer a `#'.
  
! `-CC'
       Do not discard comments, including during macro expansion.  This is
!      like `-C', except that comments contained within macros are also
       passed through to the output file where the macro is expanded.
  
!      In addition to the side-effects of the `-C' option, the `-CC'
!      option causes all C++-style comments inside a macro to be
!      converted to C-style comments.  This is to prevent later use of
!      that macro from inadvertently commenting out the remainder of the
!      source line.
  
!      The `-CC' option is generally used to support lint comments.
  
! `-traditional-cpp'
       Try to imitate the behavior of old-fashioned C preprocessors, as
       opposed to ISO C preprocessors.
  
! `-trigraphs'
       Process trigraph sequences.  These are three-character sequences,
!      all starting with `??', that are defined by ISO C to stand for
!      single characters.  For example, `??/' stands for `\', so `'??/n''
       is a character constant for a newline.  By default, GCC ignores
       trigraphs, but in standard-conforming modes it converts them.  See
!      the `-std' and `-ansi' options.
  
       The nine trigraphs and their replacements are
  
            Trigraph:       ??(  ??)  ??<  ??>  ??=  ??/  ??'  ??!  ??-
            Replacement:      [    ]    {    }    #    \    ^    |    ~
  
! `-remap'
       Enable special code to work around file systems which only permit
       very short file names, such as MS-DOS.
  
! `--help'
! `--target-help'
       Print text describing all the command-line options instead of
       preprocessing anything.
  
! `-v'
       Verbose mode.  Print out GNU CPP's version number at the beginning
       of execution, and report the final form of the include path.
  
! `-H'
       Print the name of each header file used, in addition to other
       normal activities.  Each name is indented to show how deep in the
!      `#include' stack it is.  Precompiled header files are also
!      printed, even if they are found to be invalid; an invalid
!      precompiled header file is printed with `...x' and a valid one
!      with `...!' .
  
! `-version'
! `--version'
       Print out GNU CPP's version number.  With one dash, proceed to
       preprocess as normal.  With two dashes, exit immediately.
  
--- 10402,10818 ----
       used to create it because those files are not consulted when a
       precompiled header is used.
  
! '-fpch-preprocess'
       This option allows use of a precompiled header (*note Precompiled
!      Headers::) together with '-E'.  It inserts a special '#pragma',
!      '#pragma GCC pch_preprocess "FILENAME"' in the output to mark the
       place where the precompiled header was found, and its FILENAME.
!      When '-fpreprocessed' is in use, GCC recognizes this '#pragma' and
       loads the PCH.
  
       This option is off by default, because the resulting preprocessed
       output is only really suitable as input to GCC.  It is switched on
!      by '-save-temps'.
  
!      You should not write this '#pragma' in your own code, but it is
       safe to edit the filename if the PCH file is available in a
       different location.  The filename may be absolute or it may be
       relative to GCC's current directory.
  
! '-x c'
! '-x c++'
! '-x objective-c'
! '-x assembler-with-cpp'
       Specify the source language: C, C++, Objective-C, or assembly.
!      This has nothing to do with standards conformance or extensions; it
!      merely selects which base syntax to expect.  If you give none of
!      these options, cpp will deduce the language from the extension of
!      the source file: '.c', '.cc', '.m', or '.S'.  Some other common
       extensions for C++ and assembly are also recognized.  If cpp does
       not recognize the extension, it will treat the file as C; this is
       the most generic mode.
  
!      _Note:_ Previous versions of cpp accepted a '-lang' option which
       selected both the language and the standards conformance level.
!      This option has been removed, because it conflicts with the '-l'
       option.
  
! '-std=STANDARD'
! '-ansi'
       Specify the standard to which the code should conform.  Currently
       CPP knows about C and C++ standards; others may be added in the
       future.
  
       STANDARD may be one of:
!      'c90'
!      'c89'
!      'iso9899:1990'
!           The ISO C standard from 1990.  'c90' is the customary
            shorthand for this version of the standard.
  
!           The '-ansi' option is equivalent to '-std=c90'.
  
!      'iso9899:199409'
            The 1990 C standard, as amended in 1994.
  
!      'iso9899:1999'
!      'c99'
!      'iso9899:199x'
!      'c9x'
            The revised ISO C standard, published in December 1999.
            Before publication, this was known as C9X.
  
!      'iso9899:2011'
!      'c11'
!      'c1x'
            The revised ISO C standard, published in December 2011.
            Before publication, this was known as C1X.
  
!      'gnu90'
!      'gnu89'
            The 1990 C standard plus GNU extensions.  This is the default.
  
!      'gnu99'
!      'gnu9x'
            The 1999 C standard plus GNU extensions.
  
!      'gnu11'
!      'gnu1x'
            The 2011 C standard plus GNU extensions.
  
!      'c++98'
            The 1998 ISO C++ standard plus amendments.
  
!      'gnu++98'
!           The same as '-std=c++98' plus GNU extensions.  This is the
            default for C++ code.
  
! '-I-'
!      Split the include path.  Any directories specified with '-I'
!      options before '-I-' are searched only for headers requested with
!      '#include "FILE"'; they are not searched for '#include <FILE>'.  If
!      additional directories are specified with '-I' options after the
!      '-I-', those directories are searched for all '#include'
       directives.
  
!      In addition, '-I-' inhibits the use of the directory of the current
!      file directory as the first search directory for '#include "FILE"'.
       This option has been deprecated.
  
! '-nostdinc'
       Do not search the standard system directories for header files.
!      Only the directories you have specified with '-I' options (and the
       directory of the current file, if appropriate) are searched.
  
! '-nostdinc++'
       Do not search for header files in the C++-specific standard
       directories, but do still search the other standard directories.
       (This option is used when building the C++ library.)
  
! '-include FILE'
!      Process FILE as if '#include "file"' appeared as the first line of
!      the primary source file.  However, the first directory searched for
!      FILE is the preprocessor's working directory _instead of_ the
       directory containing the main source file.  If not found there, it
!      is searched for in the remainder of the '#include "..."' search
       chain as normal.
  
!      If multiple '-include' options are given, the files are included in
!      the order they appear on the command line.
  
! '-imacros FILE'
!      Exactly like '-include', except that any output produced by
       scanning FILE is thrown away.  Macros it defines remain defined.
       This allows you to acquire all the macros from a header without
       also processing its declarations.
  
!      All files specified by '-imacros' are processed before all files
!      specified by '-include'.
  
! '-idirafter DIR'
       Search DIR for header files, but do it _after_ all directories
!      specified with '-I' and the standard system directories have been
       exhausted.  DIR is treated as a system include directory.  If DIR
!      begins with '=', then the '=' will be replaced by the sysroot
!      prefix; see '--sysroot' and '-isysroot'.
  
! '-iprefix PREFIX'
!      Specify PREFIX as the prefix for subsequent '-iwithprefix' options.
!      If the prefix represents a directory, you should include the final
!      '/'.
  
! '-iwithprefix DIR'
! '-iwithprefixbefore DIR'
!      Append DIR to the prefix specified previously with '-iprefix', and
       add the resulting directory to the include search path.
!      '-iwithprefixbefore' puts it in the same place '-I' would;
!      '-iwithprefix' puts it where '-idirafter' would.
  
! '-isysroot DIR'
!      This option is like the '--sysroot' option, but applies only to
       header files (except for Darwin targets, where it applies to both
!      header files and libraries).  See the '--sysroot' option for more
       information.
  
! '-imultilib DIR'
       Use DIR as a subdirectory of the directory containing
       target-specific C++ headers.
  
! '-isystem DIR'
       Search DIR for header files, after all directories specified by
!      '-I' but before the standard system directories.  Mark it as a
       system directory, so that it gets the same special treatment as is
       applied to the standard system directories.  If DIR begins with
!      '=', then the '=' will be replaced by the sysroot prefix; see
!      '--sysroot' and '-isysroot'.
  
! '-iquote DIR'
!      Search DIR only for header files requested with '#include "FILE"';
!      they are not searched for '#include <FILE>', before all directories
!      specified by '-I' and before the standard system directories.  If
!      DIR begins with '=', then the '=' will be replaced by the sysroot
!      prefix; see '--sysroot' and '-isysroot'.
  
! '-fdirectives-only'
       When preprocessing, handle directives, but do not expand macros.
  
!      The option's behavior depends on the '-E' and '-fpreprocessed'
       options.
  
!      With '-E', preprocessing is limited to the handling of directives
!      such as '#define', '#ifdef', and '#error'.  Other preprocessor
!      operations, such as macro expansion and trigraph conversion are not
!      performed.  In addition, the '-dD' option is implicitly enabled.
  
!      With '-fpreprocessed', predefinition of command line and most
!      builtin macros is disabled.  Macros such as '__LINE__', which are
       contextually dependent, are handled normally.  This enables
!      compilation of files previously preprocessed with '-E
       -fdirectives-only'.
  
!      With both '-E' and '-fpreprocessed', the rules for '-fpreprocessed'
!      take precedence.  This enables full preprocessing of files
!      previously preprocessed with '-E -fdirectives-only'.
  
! '-fdollars-in-identifiers'
!      Accept '$' in identifiers.
  
! '-fextended-identifiers'
       Accept universal character names in identifiers.  This option is
       enabled by default for C99 (and later C standard versions) and C++.
  
! '-fno-canonical-system-headers'
       When preprocessing, do not shorten system header paths with
       canonicalization.
  
! '-fpreprocessed'
       Indicate to the preprocessor that the input file has already been
       preprocessed.  This suppresses things like macro expansion,
       trigraph conversion, escaped newline splicing, and processing of
       most directives.  The preprocessor still recognizes and removes
!      comments, so that you can pass a file preprocessed with '-C' to the
!      compiler without problems.  In this mode the integrated
       preprocessor is little more than a tokenizer for the front ends.
  
!      '-fpreprocessed' is implicit if the input file has one of the
!      extensions '.i', '.ii' or '.mi'.  These are the extensions that GCC
!      uses for preprocessed files created by '-save-temps'.
  
! '-ftabstop=WIDTH'
       Set the distance between tab stops.  This helps the preprocessor
       report correct column numbers in warnings or errors, even if tabs
       appear on the line.  If the value is less than 1 or greater than
       100, the option is ignored.  The default is 8.
  
! '-fdebug-cpp'
!      This option is only useful for debugging GCC. When used with '-E',
!      dumps debugging information about location maps.  Every token in
!      the output is preceded by the dump of the map its location belongs
!      to.  The dump of the map holding the location of a token would be:
!           {'P':/file/path;'F':/includer/path;'L':LINE_NUM;'C':COL_NUM;'S':SYSTEM_HEADER_P;'M':MAP_ADDRESS;'E':MACRO_EXPANSION_P,'loc':LOCATION}
  
!      When used without '-E', this option has no effect.
  
! '-ftrack-macro-expansion[=LEVEL]'
!      Track locations of tokens across macro expansions.  This allows the
       compiler to emit diagnostic about the current macro expansion stack
!      when a compilation error occurs in a macro expansion.  Using this
!      option makes the preprocessor and the compiler consume more memory.
!      The LEVEL parameter can be used to choose the level of precision of
!      token location tracking thus decreasing the memory consumption if
!      necessary.  Value '0' of LEVEL de-activates this option just as if
!      no '-ftrack-macro-expansion' was present on the command line.
!      Value '1' tracks tokens locations in a degraded mode for the sake
!      of minimal memory overhead.  In this mode all tokens resulting from
!      the expansion of an argument of a function-like macro have the same
!      location.  Value '2' tracks tokens locations completely.  This
!      value is the most memory hungry.  When this option is given no
!      argument, the default parameter value is '2'.
  
!      Note that '-ftrack-macro-expansion=2' is activated by default.
  
! '-fexec-charset=CHARSET'
       Set the execution character set, used for string and character
       constants.  The default is UTF-8.  CHARSET can be any encoding
!      supported by the system's 'iconv' library routine.
  
! '-fwide-exec-charset=CHARSET'
       Set the wide execution character set, used for wide string and
       character constants.  The default is UTF-32 or UTF-16, whichever
!      corresponds to the width of 'wchar_t'.  As with '-fexec-charset',
!      CHARSET can be any encoding supported by the system's 'iconv'
       library routine; however, you will have problems with encodings
!      that do not fit exactly in 'wchar_t'.
  
! '-finput-charset=CHARSET'
       Set the input character set, used for translation from the
!      character set of the input file to the source character set used by
!      GCC.  If the locale does not specify, or GCC cannot get this
       information from the locale, the default is UTF-8.  This can be
       overridden by either the locale or this command-line option.
       Currently the command-line option takes precedence if there's a
       conflict.  CHARSET can be any encoding supported by the system's
!      'iconv' library routine.
  
! '-fworking-directory'
       Enable generation of linemarkers in the preprocessor output that
       will let the compiler know the current working directory at the
       time of preprocessing.  When this option is enabled, the
       preprocessor will emit, after the initial linemarker, a second
       linemarker with the current working directory followed by two
       slashes.  GCC will use this directory, when it's present in the
!      preprocessed input, as the directory emitted as the current working
!      directory in some debugging information formats.  This option is
!      implicitly enabled if debugging information is enabled, but this
!      can be inhibited with the negated form '-fno-working-directory'.
!      If the '-P' flag is present in the command line, this option has no
!      effect, since no '#line' directives are emitted whatsoever.
  
! '-fno-show-column'
       Do not print column numbers in diagnostics.  This may be necessary
       if diagnostics are being scanned by a program that does not
!      understand the column numbers, such as 'dejagnu'.
  
! '-A PREDICATE=ANSWER'
       Make an assertion with the predicate PREDICATE and answer ANSWER.
!      This form is preferred to the older form '-A PREDICATE(ANSWER)',
       which is still supported, because it does not use shell special
       characters.
  
! '-A -PREDICATE=ANSWER'
       Cancel an assertion with the predicate PREDICATE and answer ANSWER.
  
! '-dCHARS'
!      CHARS is a sequence of one or more of the following characters, and
!      must not be preceded by a space.  Other characters are interpreted
!      by the compiler proper, or reserved for future versions of GCC, and
!      so are silently ignored.  If you specify characters whose behavior
!      conflicts, the result is undefined.
  
!      'M'
!           Instead of the normal output, generate a list of '#define'
            directives for all the macros defined during the execution of
!           the preprocessor, including predefined macros.  This gives you
!           a way of finding out what is predefined in your version of the
!           preprocessor.  Assuming you have no file 'foo.h', the command
  
                 touch foo.h; cpp -dM foo.h
  
            will show all the predefined macros.
  
!           If you use '-dM' without the '-E' option, '-dM' is interpreted
!           as a synonym for '-fdump-rtl-mach'.  *Note (gcc)Debugging
!           Options::.
  
!      'D'
!           Like 'M' except in two respects: it does _not_ include the
!           predefined macros, and it outputs _both_ the '#define'
            directives and the result of preprocessing.  Both kinds of
            output go to the standard output file.
  
!      'N'
!           Like 'D', but emit only the macro names, not their expansions.
  
!      'I'
!           Output '#include' directives in addition to the result of
            preprocessing.
  
!      'U'
!           Like 'D' except that only macros that are expanded, or whose
            definedness is tested in preprocessor directives, are output;
            the output is delayed until the use or test of the macro; and
!           '#undef' directives are also output for macros tested but
            undefined at the time.
  
! '-P'
       Inhibit generation of linemarkers in the output from the
       preprocessor.  This might be useful when running the preprocessor
       on something that is not C code, and will be sent to a program
       which might be confused by the linemarkers.
  
! '-C'
       Do not discard comments.  All comments are passed through to the
!      output file, except for comments in processed directives, which are
!      deleted along with the directive.
  
!      You should be prepared for side effects when using '-C'; it causes
       the preprocessor to treat comments as tokens in their own right.
       For example, comments appearing at the start of what would be a
       directive line have the effect of turning that line into an
       ordinary source line, since the first token on the line is no
!      longer a '#'.
  
! '-CC'
       Do not discard comments, including during macro expansion.  This is
!      like '-C', except that comments contained within macros are also
       passed through to the output file where the macro is expanded.
  
!      In addition to the side-effects of the '-C' option, the '-CC'
!      option causes all C++-style comments inside a macro to be converted
!      to C-style comments.  This is to prevent later use of that macro
!      from inadvertently commenting out the remainder of the source line.
  
!      The '-CC' option is generally used to support lint comments.
  
! '-traditional-cpp'
       Try to imitate the behavior of old-fashioned C preprocessors, as
       opposed to ISO C preprocessors.
  
! '-trigraphs'
       Process trigraph sequences.  These are three-character sequences,
!      all starting with '??', that are defined by ISO C to stand for
!      single characters.  For example, '??/' stands for '\', so ''??/n''
       is a character constant for a newline.  By default, GCC ignores
       trigraphs, but in standard-conforming modes it converts them.  See
!      the '-std' and '-ansi' options.
  
       The nine trigraphs and their replacements are
  
            Trigraph:       ??(  ??)  ??<  ??>  ??=  ??/  ??'  ??!  ??-
            Replacement:      [    ]    {    }    #    \    ^    |    ~
  
! '-remap'
       Enable special code to work around file systems which only permit
       very short file names, such as MS-DOS.
  
! '--help'
! '--target-help'
       Print text describing all the command-line options instead of
       preprocessing anything.
  
! '-v'
       Verbose mode.  Print out GNU CPP's version number at the beginning
       of execution, and report the final form of the include path.
  
! '-H'
       Print the name of each header file used, in addition to other
       normal activities.  Each name is indented to show how deep in the
!      '#include' stack it is.  Precompiled header files are also printed,
!      even if they are found to be invalid; an invalid precompiled header
!      file is printed with '...x' and a valid one with '...!' .
  
! '-version'
! '--version'
       Print out GNU CPP's version number.  With one dash, proceed to
       preprocess as normal.  With two dashes, exit immediately.
  
*************** File: gcc.info,  Node: Assembler Options
*** 10884,10901 ****
  
  You can pass options to the assembler.
  
! `-Wa,OPTION'
       Pass OPTION as an option to the assembler.  If OPTION contains
       commas, it is split into multiple options at the commas.
  
! `-Xassembler OPTION'
       Pass OPTION as an option to the assembler.  You can use this to
       supply system-specific assembler options that GCC does not
       recognize.
  
       If you want to pass an option that takes an argument, you must use
!      `-Xassembler' twice, once for the option and once for the argument.
! 
  
  
  File: gcc.info,  Node: Link Options,  Next: Directory Options,  Prev: Assembler Options,  Up: Invoking GCC
--- 10824,10840 ----
  
  You can pass options to the assembler.
  
! '-Wa,OPTION'
       Pass OPTION as an option to the assembler.  If OPTION contains
       commas, it is split into multiple options at the commas.
  
! '-Xassembler OPTION'
       Pass OPTION as an option to the assembler.  You can use this to
       supply system-specific assembler options that GCC does not
       recognize.
  
       If you want to pass an option that takes an argument, you must use
!      '-Xassembler' twice, once for the option and once for the argument.
  
  
  File: gcc.info,  Node: Link Options,  Next: Directory Options,  Prev: Assembler Options,  Up: Invoking GCC
*************** These options come into play when the co
*** 10907,11189 ****
  an executable output file.  They are meaningless if the compiler is not
  doing a link step.
  
! `OBJECT-FILE-NAME'
       A file name that does not end in a special recognized suffix is
       considered to name an object file or library.  (Object files are
       distinguished from libraries by the linker according to the file
       contents.)  If linking is done, these object files are used as
       input to the linker.
  
! `-c'
! `-S'
! `-E'
       If any of these options is used, then the linker is not run, and
       object file names should not be used as arguments.  *Note Overall
       Options::.
  
! `-fuse-ld=bfd'
!      Use the `bfd' linker instead of the default linker.
  
! `-fuse-ld=gold'
!      Use the `gold' linker instead of the default linker.
  
! `-lLIBRARY'
! `-l LIBRARY'
       Search the library named LIBRARY when linking.  (The second
       alternative with the library as a separate argument is only for
       POSIX compliance and is not recommended.)
  
       It makes a difference where in the command you write this option;
!      the linker searches and processes libraries and object files in
!      the order they are specified.  Thus, `foo.o -lz bar.o' searches
!      library `z' after file `foo.o' but before `bar.o'.  If `bar.o'
!      refers to functions in `z', those functions may not be loaded.
  
       The linker searches a standard list of directories for the library,
!      which is actually a file named `libLIBRARY.a'.  The linker then
       uses this file as if it had been specified precisely by name.
  
       The directories searched include several standard system
!      directories plus any that you specify with `-L'.
  
       Normally the files found this way are library files--archive files
!      whose members are object files.  The linker handles an archive
!      file by scanning through it for members which define symbols that
!      have so far been referenced but not defined.  But if the file that
!      is found is an ordinary object file, it is linked in the usual
!      fashion.  The only difference between using an `-l' option and
!      specifying a file name is that `-l' surrounds LIBRARY with `lib'
!      and `.a' and searches several directories.
  
! `-lobjc'
!      You need this special case of the `-l' option in order to link an
       Objective-C or Objective-C++ program.
  
! `-nostartfiles'
       Do not use the standard system startup files when linking.  The
!      standard system libraries are used normally, unless `-nostdlib' or
!      `-nodefaultlibs' is used.
  
! `-nodefaultlibs'
       Do not use the standard system libraries when linking.  Only the
       libraries you specify are passed to the linker, and options
       specifying linkage of the system libraries, such as
!      `-static-libgcc' or `-shared-libgcc', are ignored.  The standard
!      startup files are used normally, unless `-nostartfiles' is used.
  
!      The compiler may generate calls to `memcmp', `memset', `memcpy'
!      and `memmove'.  These entries are usually resolved by entries in
!      libc.  These entry points should be supplied through some other
!      mechanism when this option is specified.
  
! `-nostdlib'
       Do not use the standard system startup files or libraries when
       linking.  No startup files and only the libraries you specify are
       passed to the linker, and options specifying linkage of the system
!      libraries, such as `-static-libgcc' or `-shared-libgcc', are
       ignored.
  
!      The compiler may generate calls to `memcmp', `memset', `memcpy'
!      and `memmove'.  These entries are usually resolved by entries in
!      libc.  These entry points should be supplied through some other
!      mechanism when this option is specified.
  
!      One of the standard libraries bypassed by `-nostdlib' and
!      `-nodefaultlibs' is `libgcc.a', a library of internal subroutines
       which GCC uses to overcome shortcomings of particular machines, or
       special needs for some languages.  (*Note Interfacing to GCC
!      Output: (gccint)Interface, for more discussion of `libgcc.a'.)  In
!      most cases, you need `libgcc.a' even when you want to avoid other
!      standard libraries.  In other words, when you specify `-nostdlib'
!      or `-nodefaultlibs' you should usually specify `-lgcc' as well.
       This ensures that you have no unresolved references to internal GCC
!      library subroutines.  (An example of such an internal subroutine
!      is `__main', used to ensure C++ constructors are called; *note
!      `collect2': (gccint)Collect2.)
  
! `-pie'
       Produce a position independent executable on targets that support
!      it.  For predictable results, you must also specify the same set
!      of options used for compilation (`-fpie', `-fPIE', or model
       suboptions) when you specify this linker option.
  
! `-rdynamic'
!      Pass the flag `-export-dynamic' to the ELF linker, on targets that
!      support it. This instructs the linker to add all symbols, not only
!      used ones, to the dynamic symbol table. This option is needed for
!      some uses of `dlopen' or to allow obtaining backtraces from within
       a program.
  
! `-s'
       Remove all symbol table and relocation information from the
       executable.
  
! `-static'
!      On systems that support dynamic linking, this prevents linking
!      with the shared libraries.  On other systems, this option has no
!      effect.
  
! `-shared'
!      Produce a shared object which can then be linked with other
!      objects to form an executable.  Not all systems support this
!      option.  For predictable results, you must also specify the same
!      set of options used for compilation (`-fpic', `-fPIC', or model
!      suboptions) when you specify this linker option.(1)
  
! `-shared-libgcc'
! `-static-libgcc'
!      On systems that provide `libgcc' as a shared library, these options
       force the use of either the shared or static version, respectively.
!      If no shared version of `libgcc' was built when the compiler was
       configured, these options have no effect.
  
       There are several situations in which an application should use the
!      shared `libgcc' instead of the static version.  The most common of
       these is when the application wishes to throw and catch exceptions
       across different shared libraries.  In that case, each of the
       libraries as well as the application itself should use the shared
!      `libgcc'.
  
       Therefore, the G++ and GCJ drivers automatically add
!      `-shared-libgcc' whenever you build a shared library or a main
!      executable, because C++ and Java programs typically use
!      exceptions, so this is the right thing to do.
  
!      If, instead, you use the GCC driver to create shared libraries,
!      you may find that they are not always linked with the shared
!      `libgcc'.  If GCC finds, at its configuration time, that you have
!      a non-GNU linker or a GNU linker that does not support option
!      `--eh-frame-hdr', it links the shared version of `libgcc' into
       shared libraries by default.  Otherwise, it takes advantage of the
       linker and optimizes away the linking with the shared version of
!      `libgcc', linking with the static version of libgcc by default.
       This allows exceptions to propagate through such shared libraries,
       without incurring relocation costs at library load time.
  
       However, if a library or main executable is supposed to throw or
       catch exceptions, you must link it using the G++ or GCJ driver, as
       appropriate for the languages used in the program, or using the
!      option `-shared-libgcc', such that it is linked with the shared
!      `libgcc'.
  
! `-static-libasan'
!      When the `-fsanitize=address' option is used to link a program,
!      the GCC driver automatically links against `libasan'.  If
!      `libasan' is available as a shared library, and the `-static'
!      option is not used, then this links against the shared version of
!      `libasan'.  The `-static-libasan' option directs the GCC driver to
!      link `libasan' statically, without necessarily linking other
!      libraries statically.
  
! `-static-libtsan'
!      When the `-fsanitize=thread' option is used to link a program, the
!      GCC driver automatically links against `libtsan'.  If `libtsan' is
!      available as a shared library, and the `-static' option is not
!      used, then this links against the shared version of `libtsan'.
!      The `-static-libtsan' option directs the GCC driver to link
!      `libtsan' statically, without necessarily linking other libraries
!      statically.
  
! `-static-liblsan'
!      When the `-fsanitize=leak' option is used to link a program, the
!      GCC driver automatically links against `liblsan'.  If `liblsan' is
!      available as a shared library, and the `-static' option is not
!      used, then this links against the shared version of `liblsan'.
!      The `-static-liblsan' option directs the GCC driver to link
!      `liblsan' statically, without necessarily linking other libraries
!      statically.
  
! `-static-libubsan'
!      When the `-fsanitize=undefined' option is used to link a program,
!      the GCC driver automatically links against `libubsan'.  If
!      `libubsan' is available as a shared library, and the `-static'
       option is not used, then this links against the shared version of
!      `libubsan'.  The `-static-libubsan' option directs the GCC driver
!      to link `libubsan' statically, without necessarily linking other
       libraries statically.
  
! `-static-libmpx'
!      When the `-fcheck-pointer bounds' and `-mmpx' options are used to
       link a program, the GCC driver automatically links against
!      `libmpx'.  If `libmpx' is available as a shared library, and the
!      `-static' option is not used, then this links against the shared
!      version of `libmpx'.  The `-static-libmpx' option directs the GCC
!      driver to link `libmpx' statically, without necessarily linking
       other libraries statically.
  
! `-static-libmpxwrappers'
!      When the `-fcheck-pointer bounds' and `-mmpx' options are used to
!      link a program without also using `-fno-chkp-use-wrappers', the
!      GCC driver automatically links against `libmpxwrappers'.  If
!      `libmpxwrappers' is available as a shared library, and the
!      `-static' option is not used, then this links against the shared
!      version of `libmpxwrappers'.  The `-static-libmpxwrappers' option
!      directs the GCC driver to link `libmpxwrappers' statically,
!      without necessarily linking other libraries statically.
  
! `-static-libstdc++'
!      When the `g++' program is used to link a C++ program, it normally
!      automatically links against `libstdc++'.  If `libstdc++' is
!      available as a shared library, and the `-static' option is not
!      used, then this links against the shared version of `libstdc++'.
       That is normally fine.  However, it is sometimes useful to freeze
!      the version of `libstdc++' used by the program without going all
!      the way to a fully static link.  The `-static-libstdc++' option
!      directs the `g++' driver to link `libstdc++' statically, without
       necessarily linking other libraries statically.
  
! `-symbolic'
       Bind references to global symbols when building a shared object.
!      Warn about any unresolved references (unless overridden by the
!      link editor option `-Xlinker -z -Xlinker defs').  Only a few
!      systems support this option.
  
! `-T SCRIPT'
       Use SCRIPT as the linker script.  This option is supported by most
       systems using the GNU linker.  On some targets, such as bare-board
!      targets without an operating system, the `-T' option may be
       required when linking to avoid references to undefined symbols.
  
! `-Xlinker OPTION'
!      Pass OPTION as an option to the linker.  You can use this to
!      supply system-specific linker options that GCC does not recognize.
  
       If you want to pass an option that takes a separate argument, you
!      must use `-Xlinker' twice, once for the option and once for the
!      argument.  For example, to pass `-assert definitions', you must
!      write `-Xlinker -assert -Xlinker definitions'.  It does not work
!      to write `-Xlinker "-assert definitions"', because this passes the
       entire string as a single argument, which is not what the linker
       expects.
  
       When using the GNU linker, it is usually more convenient to pass
!      arguments to linker options using the `OPTION=VALUE' syntax than
!      as separate arguments.  For example, you can specify `-Xlinker
!      -Map=output.map' rather than `-Xlinker -Map -Xlinker output.map'.
       Other linkers may not support this syntax for command-line options.
  
! `-Wl,OPTION'
!      Pass OPTION as an option to the linker.  If OPTION contains
!      commas, it is split into multiple options at the commas.  You can
!      use this syntax to pass an argument to the option.  For example,
!      `-Wl,-Map,output.map' passes `-Map output.map' to the linker.
!      When using the GNU linker, you can also get the same effect with
!      `-Wl,-Map=output.map'.
  
! `-u SYMBOL'
!      Pretend the symbol SYMBOL is undefined, to force linking of
!      library modules to define it.  You can use `-u' multiple times with
       different symbols to force loading of additional library modules.
  
! `-z KEYWORD'
!      `-z' is passed directly on to the linker along with the keyword
!      KEYWORD. See the section in the documentation of your linker for
       permitted values and their meanings.
  
!  ---------- Footnotes ----------
  
!  (1) On some systems, `gcc -shared' needs to build supplementary stub
! code for constructors to work.  On multi-libbed systems, `gcc -shared'
  must select the correct support libraries to link against.  Failing to
  supply the correct flags may lead to subtle defects.  Supplying them in
  cases where they are not necessary is innocuous.
--- 10846,11124 ----
  an executable output file.  They are meaningless if the compiler is not
  doing a link step.
  
! 'OBJECT-FILE-NAME'
       A file name that does not end in a special recognized suffix is
       considered to name an object file or library.  (Object files are
       distinguished from libraries by the linker according to the file
       contents.)  If linking is done, these object files are used as
       input to the linker.
  
! '-c'
! '-S'
! '-E'
       If any of these options is used, then the linker is not run, and
       object file names should not be used as arguments.  *Note Overall
       Options::.
  
! '-fuse-ld=bfd'
!      Use the 'bfd' linker instead of the default linker.
  
! '-fuse-ld=gold'
!      Use the 'gold' linker instead of the default linker.
  
! '-lLIBRARY'
! '-l LIBRARY'
       Search the library named LIBRARY when linking.  (The second
       alternative with the library as a separate argument is only for
       POSIX compliance and is not recommended.)
  
       It makes a difference where in the command you write this option;
!      the linker searches and processes libraries and object files in the
!      order they are specified.  Thus, 'foo.o -lz bar.o' searches library
!      'z' after file 'foo.o' but before 'bar.o'.  If 'bar.o' refers to
!      functions in 'z', those functions may not be loaded.
  
       The linker searches a standard list of directories for the library,
!      which is actually a file named 'libLIBRARY.a'.  The linker then
       uses this file as if it had been specified precisely by name.
  
       The directories searched include several standard system
!      directories plus any that you specify with '-L'.
  
       Normally the files found this way are library files--archive files
!      whose members are object files.  The linker handles an archive file
!      by scanning through it for members which define symbols that have
!      so far been referenced but not defined.  But if the file that is
!      found is an ordinary object file, it is linked in the usual
!      fashion.  The only difference between using an '-l' option and
!      specifying a file name is that '-l' surrounds LIBRARY with 'lib'
!      and '.a' and searches several directories.
  
! '-lobjc'
!      You need this special case of the '-l' option in order to link an
       Objective-C or Objective-C++ program.
  
! '-nostartfiles'
       Do not use the standard system startup files when linking.  The
!      standard system libraries are used normally, unless '-nostdlib' or
!      '-nodefaultlibs' is used.
  
! '-nodefaultlibs'
       Do not use the standard system libraries when linking.  Only the
       libraries you specify are passed to the linker, and options
       specifying linkage of the system libraries, such as
!      '-static-libgcc' or '-shared-libgcc', are ignored.  The standard
!      startup files are used normally, unless '-nostartfiles' is used.
  
!      The compiler may generate calls to 'memcmp', 'memset', 'memcpy' and
!      'memmove'.  These entries are usually resolved by entries in libc.
!      These entry points should be supplied through some other mechanism
!      when this option is specified.
  
! '-nostdlib'
       Do not use the standard system startup files or libraries when
       linking.  No startup files and only the libraries you specify are
       passed to the linker, and options specifying linkage of the system
!      libraries, such as '-static-libgcc' or '-shared-libgcc', are
       ignored.
  
!      The compiler may generate calls to 'memcmp', 'memset', 'memcpy' and
!      'memmove'.  These entries are usually resolved by entries in libc.
!      These entry points should be supplied through some other mechanism
!      when this option is specified.
  
!      One of the standard libraries bypassed by '-nostdlib' and
!      '-nodefaultlibs' is 'libgcc.a', a library of internal subroutines
       which GCC uses to overcome shortcomings of particular machines, or
       special needs for some languages.  (*Note Interfacing to GCC
!      Output: (gccint)Interface, for more discussion of 'libgcc.a'.)  In
!      most cases, you need 'libgcc.a' even when you want to avoid other
!      standard libraries.  In other words, when you specify '-nostdlib'
!      or '-nodefaultlibs' you should usually specify '-lgcc' as well.
       This ensures that you have no unresolved references to internal GCC
!      library subroutines.  (An example of such an internal subroutine is
!      '__main', used to ensure C++ constructors are called; *note
!      'collect2': (gccint)Collect2.)
  
! '-pie'
       Produce a position independent executable on targets that support
!      it.  For predictable results, you must also specify the same set of
!      options used for compilation ('-fpie', '-fPIE', or model
       suboptions) when you specify this linker option.
  
! '-rdynamic'
!      Pass the flag '-export-dynamic' to the ELF linker, on targets that
!      support it.  This instructs the linker to add all symbols, not only
!      used ones, to the dynamic symbol table.  This option is needed for
!      some uses of 'dlopen' or to allow obtaining backtraces from within
       a program.
  
! '-s'
       Remove all symbol table and relocation information from the
       executable.
  
! '-static'
!      On systems that support dynamic linking, this prevents linking with
!      the shared libraries.  On other systems, this option has no effect.
  
! '-shared'
!      Produce a shared object which can then be linked with other objects
!      to form an executable.  Not all systems support this option.  For
!      predictable results, you must also specify the same set of options
!      used for compilation ('-fpic', '-fPIC', or model suboptions) when
!      you specify this linker option.(1)
  
! '-shared-libgcc'
! '-static-libgcc'
!      On systems that provide 'libgcc' as a shared library, these options
       force the use of either the shared or static version, respectively.
!      If no shared version of 'libgcc' was built when the compiler was
       configured, these options have no effect.
  
       There are several situations in which an application should use the
!      shared 'libgcc' instead of the static version.  The most common of
       these is when the application wishes to throw and catch exceptions
       across different shared libraries.  In that case, each of the
       libraries as well as the application itself should use the shared
!      'libgcc'.
  
       Therefore, the G++ and GCJ drivers automatically add
!      '-shared-libgcc' whenever you build a shared library or a main
!      executable, because C++ and Java programs typically use exceptions,
!      so this is the right thing to do.
  
!      If, instead, you use the GCC driver to create shared libraries, you
!      may find that they are not always linked with the shared 'libgcc'.
!      If GCC finds, at its configuration time, that you have a non-GNU
!      linker or a GNU linker that does not support option
!      '--eh-frame-hdr', it links the shared version of 'libgcc' into
       shared libraries by default.  Otherwise, it takes advantage of the
       linker and optimizes away the linking with the shared version of
!      'libgcc', linking with the static version of libgcc by default.
       This allows exceptions to propagate through such shared libraries,
       without incurring relocation costs at library load time.
  
       However, if a library or main executable is supposed to throw or
       catch exceptions, you must link it using the G++ or GCJ driver, as
       appropriate for the languages used in the program, or using the
!      option '-shared-libgcc', such that it is linked with the shared
!      'libgcc'.
  
! '-static-libasan'
!      When the '-fsanitize=address' option is used to link a program, the
!      GCC driver automatically links against 'libasan'.  If 'libasan' is
!      available as a shared library, and the '-static' option is not
!      used, then this links against the shared version of 'libasan'.  The
!      '-static-libasan' option directs the GCC driver to link 'libasan'
!      statically, without necessarily linking other libraries statically.
  
! '-static-libtsan'
!      When the '-fsanitize=thread' option is used to link a program, the
!      GCC driver automatically links against 'libtsan'.  If 'libtsan' is
!      available as a shared library, and the '-static' option is not
!      used, then this links against the shared version of 'libtsan'.  The
!      '-static-libtsan' option directs the GCC driver to link 'libtsan'
!      statically, without necessarily linking other libraries statically.
  
! '-static-liblsan'
!      When the '-fsanitize=leak' option is used to link a program, the
!      GCC driver automatically links against 'liblsan'.  If 'liblsan' is
!      available as a shared library, and the '-static' option is not
!      used, then this links against the shared version of 'liblsan'.  The
!      '-static-liblsan' option directs the GCC driver to link 'liblsan'
!      statically, without necessarily linking other libraries statically.
  
! '-static-libubsan'
!      When the '-fsanitize=undefined' option is used to link a program,
!      the GCC driver automatically links against 'libubsan'.  If
!      'libubsan' is available as a shared library, and the '-static'
       option is not used, then this links against the shared version of
!      'libubsan'.  The '-static-libubsan' option directs the GCC driver
!      to link 'libubsan' statically, without necessarily linking other
       libraries statically.
  
! '-static-libmpx'
!      When the '-fcheck-pointer bounds' and '-mmpx' options are used to
       link a program, the GCC driver automatically links against
!      'libmpx'.  If 'libmpx' is available as a shared library, and the
!      '-static' option is not used, then this links against the shared
!      version of 'libmpx'.  The '-static-libmpx' option directs the GCC
!      driver to link 'libmpx' statically, without necessarily linking
       other libraries statically.
  
! '-static-libmpxwrappers'
!      When the '-fcheck-pointer bounds' and '-mmpx' options are used to
!      link a program without also using '-fno-chkp-use-wrappers', the GCC
!      driver automatically links against 'libmpxwrappers'.  If
!      'libmpxwrappers' is available as a shared library, and the
!      '-static' option is not used, then this links against the shared
!      version of 'libmpxwrappers'.  The '-static-libmpxwrappers' option
!      directs the GCC driver to link 'libmpxwrappers' statically, without
!      necessarily linking other libraries statically.
  
! '-static-libstdc++'
!      When the 'g++' program is used to link a C++ program, it normally
!      automatically links against 'libstdc++'.  If 'libstdc++' is
!      available as a shared library, and the '-static' option is not
!      used, then this links against the shared version of 'libstdc++'.
       That is normally fine.  However, it is sometimes useful to freeze
!      the version of 'libstdc++' used by the program without going all
!      the way to a fully static link.  The '-static-libstdc++' option
!      directs the 'g++' driver to link 'libstdc++' statically, without
       necessarily linking other libraries statically.
  
! '-symbolic'
       Bind references to global symbols when building a shared object.
!      Warn about any unresolved references (unless overridden by the link
!      editor option '-Xlinker -z -Xlinker defs').  Only a few systems
!      support this option.
  
! '-T SCRIPT'
       Use SCRIPT as the linker script.  This option is supported by most
       systems using the GNU linker.  On some targets, such as bare-board
!      targets without an operating system, the '-T' option may be
       required when linking to avoid references to undefined symbols.
  
! '-Xlinker OPTION'
!      Pass OPTION as an option to the linker.  You can use this to supply
!      system-specific linker options that GCC does not recognize.
  
       If you want to pass an option that takes a separate argument, you
!      must use '-Xlinker' twice, once for the option and once for the
!      argument.  For example, to pass '-assert definitions', you must
!      write '-Xlinker -assert -Xlinker definitions'.  It does not work to
!      write '-Xlinker "-assert definitions"', because this passes the
       entire string as a single argument, which is not what the linker
       expects.
  
       When using the GNU linker, it is usually more convenient to pass
!      arguments to linker options using the 'OPTION=VALUE' syntax than as
!      separate arguments.  For example, you can specify '-Xlinker
!      -Map=output.map' rather than '-Xlinker -Map -Xlinker output.map'.
       Other linkers may not support this syntax for command-line options.
  
! '-Wl,OPTION'
!      Pass OPTION as an option to the linker.  If OPTION contains commas,
!      it is split into multiple options at the commas.  You can use this
!      syntax to pass an argument to the option.  For example,
!      '-Wl,-Map,output.map' passes '-Map output.map' to the linker.  When
!      using the GNU linker, you can also get the same effect with
!      '-Wl,-Map=output.map'.
  
! '-u SYMBOL'
!      Pretend the symbol SYMBOL is undefined, to force linking of library
!      modules to define it.  You can use '-u' multiple times with
       different symbols to force loading of additional library modules.
  
! '-z KEYWORD'
!      '-z' is passed directly on to the linker along with the keyword
!      KEYWORD.  See the section in the documentation of your linker for
       permitted values and their meanings.
  
!    ---------- Footnotes ----------
  
!    (1) On some systems, 'gcc -shared' needs to build supplementary stub
! code for constructors to work.  On multi-libbed systems, 'gcc -shared'
  must select the correct support libraries to link against.  Failing to
  supply the correct flags may lead to subtle defects.  Supplying them in
  cases where they are not necessary is innocuous.
*************** File: gcc.info,  Node: Directory Options
*** 11197,11331 ****
  These options specify directories to search for header files, for
  libraries and for parts of the compiler:
  
! `-IDIR'
       Add the directory DIR to the head of the list of directories to be
       searched for header files.  This can be used to override a system
!      header file, substituting your own version, since these
!      directories are searched before the system header file
!      directories.  However, you should not use this option to add
!      directories that contain vendor-supplied system header files (use
!      `-isystem' for that).  If you use more than one `-I' option, the
!      directories are scanned in left-to-right order; the standard
!      system directories come after.
  
       If a standard system include directory, or a directory specified
!      with `-isystem', is also specified with `-I', the `-I' option is
!      ignored.  The directory is still searched but as a system
!      directory at its normal position in the system include chain.
!      This is to ensure that GCC's procedure to fix buggy system headers
!      and the ordering for the `include_next' directive are not
!      inadvertently changed.  If you really need to change the search
!      order for system directories, use the `-nostdinc' and/or
!      `-isystem' options.
  
! `-iplugindir=DIR'
       Set the directory to search for plugins that are passed by
!      `-fplugin=NAME' instead of `-fplugin=PATH/NAME.so'.  This option
!      is not meant to be used by the user, but only passed by the driver.
  
! `-iquoteDIR'
       Add the directory DIR to the head of the list of directories to be
!      searched for header files only for the case of `#include "FILE"';
!      they are not searched for `#include <FILE>', otherwise just like
!      `-I'.
  
! `-LDIR'
       Add directory DIR to the list of directories to be searched for
!      `-l'.
  
! `-BPREFIX'
       This option specifies where to find the executables, libraries,
       include files, and data files of the compiler itself.
  
       The compiler driver program runs one or more of the subprograms
!      `cpp', `cc1', `as' and `ld'.  It tries PREFIX as a prefix for each
!      program it tries to run, both with and without `MACHINE/VERSION/'
       (*note Target Options::).
  
       For each subprogram to be run, the compiler driver first tries the
!      `-B' prefix, if any.  If that name is not found, or if `-B' is not
!      specified, the driver tries two standard prefixes, `/usr/lib/gcc/'
!      and `/usr/local/lib/gcc/'.  If neither of those results in a file
       name that is found, the unmodified program name is searched for
!      using the directories specified in your `PATH' environment
       variable.
  
!      The compiler checks to see if the path provided by `-B' refers to
!      a directory, and if necessary it adds a directory separator
!      character at the end of the path.
  
!      `-B' prefixes that effectively specify directory names also apply
       to libraries in the linker, because the compiler translates these
!      options into `-L' options for the linker.  They also apply to
       include files in the preprocessor, because the compiler translates
!      these options into `-isystem' options for the preprocessor.  In
!      this case, the compiler appends `include' to the prefix.
  
!      The runtime support file `libgcc.a' can also be searched for using
!      the `-B' prefix, if needed.  If it is not found there, the two
       standard prefixes above are tried, and that is all.  The file is
       left out of the link if it is not found by those means.
  
!      Another way to specify a prefix much like the `-B' prefix is to use
!      the environment variable `GCC_EXEC_PREFIX'.  *Note Environment
       Variables::.
  
!      As a special kludge, if the path provided by `-B' is
!      `[dir/]stageN/', where N is a number in the range 0 to 9, then it
!      is replaced by `[dir/]include'.  This is to help with
       boot-strapping the compiler.
  
! `-specs=FILE'
!      Process FILE after the compiler reads in the standard `specs'
!      file, in order to override the defaults which the `gcc' driver
!      program uses when determining what switches to pass to `cc1',
!      `cc1plus', `as', `ld', etc.  More than one `-specs=FILE' can be
!      specified on the command line, and they are processed in order,
!      from left to right.
  
! `--sysroot=DIR'
       Use DIR as the logical root directory for headers and libraries.
       For example, if the compiler normally searches for headers in
!      `/usr/include' and libraries in `/usr/lib', it instead searches
!      `DIR/usr/include' and `DIR/usr/lib'.
  
!      If you use both this option and the `-isysroot' option, then the
!      `--sysroot' option applies to libraries, but the `-isysroot'
!      option applies to header files.
  
       The GNU linker (beginning with version 2.16) has the necessary
       support for this option.  If your linker does not support this
!      option, the header file aspect of `--sysroot' still works, but the
       library aspect does not.
  
! `--no-sysroot-suffix'
       For some targets, a suffix is added to the root directory specified
!      with `--sysroot', depending on the other options used, so that
!      headers may for example be found in `DIR/SUFFIX/usr/include'
!      instead of `DIR/usr/include'.  This option disables the addition of
       such a suffix.
  
! `-I-'
!      This option has been deprecated.  Please use `-iquote' instead for
!      `-I' directories before the `-I-' and remove the `-I-' option.
!      Any directories you specify with `-I' options before the `-I-'
!      option are searched only for the case of `#include "FILE"'; they
!      are not searched for `#include <FILE>'.
  
!      If additional directories are specified with `-I' options after
!      the `-I-' option, these directories are searched for all `#include'
!      directives.  (Ordinarily _all_ `-I' directories are used this way.)
  
!      In addition, the `-I-' option inhibits the use of the current
       directory (where the current input file came from) as the first
!      search directory for `#include "FILE"'.  There is no way to
!      override this effect of `-I-'.  With `-I.' you can specify
       searching the directory that is current when the compiler is
       invoked.  That is not exactly the same as what the preprocessor
       does by default, but it is often satisfactory.
  
!      `-I-' does not inhibit the use of the standard system directories
!      for header files.  Thus, `-I-' and `-nostdinc' are independent.
  
  
  File: gcc.info,  Node: Spec Files,  Next: Target Options,  Prev: Directory Options,  Up: Invoking GCC
--- 11132,11264 ----
  These options specify directories to search for header files, for
  libraries and for parts of the compiler:
  
! '-IDIR'
       Add the directory DIR to the head of the list of directories to be
       searched for header files.  This can be used to override a system
!      header file, substituting your own version, since these directories
!      are searched before the system header file directories.  However,
!      you should not use this option to add directories that contain
!      vendor-supplied system header files (use '-isystem' for that).  If
!      you use more than one '-I' option, the directories are scanned in
!      left-to-right order; the standard system directories come after.
  
       If a standard system include directory, or a directory specified
!      with '-isystem', is also specified with '-I', the '-I' option is
!      ignored.  The directory is still searched but as a system directory
!      at its normal position in the system include chain.  This is to
!      ensure that GCC's procedure to fix buggy system headers and the
!      ordering for the 'include_next' directive are not inadvertently
!      changed.  If you really need to change the search order for system
!      directories, use the '-nostdinc' and/or '-isystem' options.
  
! '-iplugindir=DIR'
       Set the directory to search for plugins that are passed by
!      '-fplugin=NAME' instead of '-fplugin=PATH/NAME.so'.  This option is
!      not meant to be used by the user, but only passed by the driver.
  
! '-iquoteDIR'
       Add the directory DIR to the head of the list of directories to be
!      searched for header files only for the case of '#include "FILE"';
!      they are not searched for '#include <FILE>', otherwise just like
!      '-I'.
  
! '-LDIR'
       Add directory DIR to the list of directories to be searched for
!      '-l'.
  
! '-BPREFIX'
       This option specifies where to find the executables, libraries,
       include files, and data files of the compiler itself.
  
       The compiler driver program runs one or more of the subprograms
!      'cpp', 'cc1', 'as' and 'ld'.  It tries PREFIX as a prefix for each
!      program it tries to run, both with and without 'MACHINE/VERSION/'
       (*note Target Options::).
  
       For each subprogram to be run, the compiler driver first tries the
!      '-B' prefix, if any.  If that name is not found, or if '-B' is not
!      specified, the driver tries two standard prefixes, '/usr/lib/gcc/'
!      and '/usr/local/lib/gcc/'.  If neither of those results in a file
       name that is found, the unmodified program name is searched for
!      using the directories specified in your 'PATH' environment
       variable.
  
!      The compiler checks to see if the path provided by '-B' refers to a
!      directory, and if necessary it adds a directory separator character
!      at the end of the path.
  
!      '-B' prefixes that effectively specify directory names also apply
       to libraries in the linker, because the compiler translates these
!      options into '-L' options for the linker.  They also apply to
       include files in the preprocessor, because the compiler translates
!      these options into '-isystem' options for the preprocessor.  In
!      this case, the compiler appends 'include' to the prefix.
  
!      The runtime support file 'libgcc.a' can also be searched for using
!      the '-B' prefix, if needed.  If it is not found there, the two
       standard prefixes above are tried, and that is all.  The file is
       left out of the link if it is not found by those means.
  
!      Another way to specify a prefix much like the '-B' prefix is to use
!      the environment variable 'GCC_EXEC_PREFIX'.  *Note Environment
       Variables::.
  
!      As a special kludge, if the path provided by '-B' is
!      '[dir/]stageN/', where N is a number in the range 0 to 9, then it
!      is replaced by '[dir/]include'.  This is to help with
       boot-strapping the compiler.
  
! '-specs=FILE'
!      Process FILE after the compiler reads in the standard 'specs' file,
!      in order to override the defaults which the 'gcc' driver program
!      uses when determining what switches to pass to 'cc1', 'cc1plus',
!      'as', 'ld', etc.  More than one '-specs=FILE' can be specified on
!      the command line, and they are processed in order, from left to
!      right.
  
! '--sysroot=DIR'
       Use DIR as the logical root directory for headers and libraries.
       For example, if the compiler normally searches for headers in
!      '/usr/include' and libraries in '/usr/lib', it instead searches
!      'DIR/usr/include' and 'DIR/usr/lib'.
  
!      If you use both this option and the '-isysroot' option, then the
!      '--sysroot' option applies to libraries, but the '-isysroot' option
!      applies to header files.
  
       The GNU linker (beginning with version 2.16) has the necessary
       support for this option.  If your linker does not support this
!      option, the header file aspect of '--sysroot' still works, but the
       library aspect does not.
  
! '--no-sysroot-suffix'
       For some targets, a suffix is added to the root directory specified
!      with '--sysroot', depending on the other options used, so that
!      headers may for example be found in 'DIR/SUFFIX/usr/include'
!      instead of 'DIR/usr/include'.  This option disables the addition of
       such a suffix.
  
! '-I-'
!      This option has been deprecated.  Please use '-iquote' instead for
!      '-I' directories before the '-I-' and remove the '-I-' option.  Any
!      directories you specify with '-I' options before the '-I-' option
!      are searched only for the case of '#include "FILE"'; they are not
!      searched for '#include <FILE>'.
  
!      If additional directories are specified with '-I' options after the
!      '-I-' option, these directories are searched for all '#include'
!      directives.  (Ordinarily _all_ '-I' directories are used this way.)
  
!      In addition, the '-I-' option inhibits the use of the current
       directory (where the current input file came from) as the first
!      search directory for '#include "FILE"'.  There is no way to
!      override this effect of '-I-'.  With '-I.' you can specify
       searching the directory that is current when the compiler is
       invoked.  That is not exactly the same as what the preprocessor
       does by default, but it is often satisfactory.
  
!      '-I-' does not inhibit the use of the standard system directories
!      for header files.  Thus, '-I-' and '-nostdinc' are independent.
  
  
  File: gcc.info,  Node: Spec Files,  Next: Target Options,  Prev: Directory Options,  Up: Invoking GCC
*************** File: gcc.info,  Node: Spec Files,  Next
*** 11333,11371 ****
  3.15 Specifying Subprocesses and the Switches to Pass to Them
  =============================================================
  
! `gcc' is a driver program.  It performs its job by invoking a sequence
  of other programs to do the work of compiling, assembling and linking.
  GCC interprets its command-line parameters and uses these to deduce
! which programs it should invoke, and which command-line options it
! ought to place on their command lines.  This behavior is controlled by
! "spec strings".  In most cases there is one spec string for each
! program that GCC can invoke, but a few programs have multiple spec
! strings to control their behavior.  The spec strings built into GCC can
! be overridden by using the `-specs=' command-line switch to specify a
! spec file.
  
   "Spec files" are plaintext files that are used to construct spec
  strings.  They consist of a sequence of directives separated by blank
  lines.  The type of directive is determined by the first non-whitespace
  character on the line, which can be one of the following:
  
! `%COMMAND'
       Issues a COMMAND to the spec file processor.  The commands that can
       appear here are:
  
!     `%include <FILE>'
            Search for FILE and insert its text at the current point in
            the specs file.
  
!     `%include_noerr <FILE>'
!           Just like `%include', but do not generate an error message if
            the include file cannot be found.
  
!     `%rename OLD_NAME NEW_NAME'
            Rename the spec string OLD_NAME to NEW_NAME.
  
! 
! `*[SPEC_NAME]:'
       This tells the compiler to create, override or delete the named
       spec string.  All lines after this directive up to the next
       directive or blank line are considered to be the text for the spec
--- 11266,11302 ----
  3.15 Specifying Subprocesses and the Switches to Pass to Them
  =============================================================
  
! 'gcc' is a driver program.  It performs its job by invoking a sequence
  of other programs to do the work of compiling, assembling and linking.
  GCC interprets its command-line parameters and uses these to deduce
! which programs it should invoke, and which command-line options it ought
! to place on their command lines.  This behavior is controlled by "spec
! strings".  In most cases there is one spec string for each program that
! GCC can invoke, but a few programs have multiple spec strings to control
! their behavior.  The spec strings built into GCC can be overridden by
! using the '-specs=' command-line switch to specify a spec file.
  
   "Spec files" are plaintext files that are used to construct spec
  strings.  They consist of a sequence of directives separated by blank
  lines.  The type of directive is determined by the first non-whitespace
  character on the line, which can be one of the following:
  
! '%COMMAND'
       Issues a COMMAND to the spec file processor.  The commands that can
       appear here are:
  
!      '%include <FILE>'
            Search for FILE and insert its text at the current point in
            the specs file.
  
!      '%include_noerr <FILE>'
!           Just like '%include', but do not generate an error message if
            the include file cannot be found.
  
!      '%rename OLD_NAME NEW_NAME'
            Rename the spec string OLD_NAME to NEW_NAME.
  
! '*[SPEC_NAME]:'
       This tells the compiler to create, override or delete the named
       spec string.  All lines after this directive up to the next
       directive or blank line are considered to be the text for the spec
*************** character on the line, which can be one
*** 11374,11384 ****
       Otherwise, if the spec does not currently exist a new spec is
       created.  If the spec does exist then its contents are overridden
       by the text of this directive, unless the first character of that
!      text is the `+' character, in which case the text is appended to
       the spec.
  
! `[SUFFIX]:'
!      Creates a new `[SUFFIX] spec' pair.  All lines after this directive
       and up to the next directive or blank line are considered to make
       up the spec string for the indicated suffix.  When the compiler
       encounters an input file with the named suffix, it processes the
--- 11305,11315 ----
       Otherwise, if the spec does not currently exist a new spec is
       created.  If the spec does exist then its contents are overridden
       by the text of this directive, unless the first character of that
!      text is the '+' character, in which case the text is appended to
       the spec.
  
! '[SUFFIX]:'
!      Creates a new '[SUFFIX] spec' pair.  All lines after this directive
       and up to the next directive or blank line are considered to make
       up the spec string for the indicated suffix.  When the compiler
       encounters an input file with the named suffix, it processes the
*************** character on the line, which can be one
*** 11388,11404 ****
            .ZZ:
            z-compile -input %i
  
!      This says that any input file whose name ends in `.ZZ' should be
!      passed to the program `z-compile', which should be invoked with the
!      command-line switch `-input' and with the result of performing the
!      `%i' substitution.  (See below.)
  
       As an alternative to providing a spec string, the text following a
       suffix directive can be one of the following:
  
!     `@LANGUAGE'
            This says that the suffix is an alias for a known LANGUAGE.
!           This is similar to using the `-x' command-line switch to GCC
            to specify a language explicitly.  For example:
  
                 .ZZ:
--- 11319,11335 ----
            .ZZ:
            z-compile -input %i
  
!      This says that any input file whose name ends in '.ZZ' should be
!      passed to the program 'z-compile', which should be invoked with the
!      command-line switch '-input' and with the result of performing the
!      '%i' substitution.  (See below.)
  
       As an alternative to providing a spec string, the text following a
       suffix directive can be one of the following:
  
!      '@LANGUAGE'
            This says that the suffix is an alias for a known LANGUAGE.
!           This is similar to using the '-x' command-line switch to GCC
            to specify a language explicitly.  For example:
  
                 .ZZ:
*************** character on the line, which can be one
*** 11406,11412 ****
  
            Says that .ZZ files are, in fact, C++ source files.
  
!     `#NAME'
            This causes an error messages saying:
  
                 NAME compiler not installed on this system.
--- 11337,11343 ----
  
            Says that .ZZ files are, in fact, C++ source files.
  
!      '#NAME'
            This causes an error messages saying:
  
                 NAME compiler not installed on this system.
*************** character on the line, which can be one
*** 11417,11423 ****
       effectively possible to override earlier entries using this
       technique.
  
- 
   GCC has the following spec strings built into it.  Spec files can
  override these strings or create their own.  Note that individual
  targets can also add their own spec strings to this list.
--- 11348,11353 ----
*************** targets can also add their own spec stri
*** 11433,11439 ****
       libgcc       Decides which GCC support library to pass to the linker
       linker       Sets the name of the linker
       predefines   Defines to be passed to the C preprocessor
!      signed_char  Defines to pass to CPP to say whether `char' is signed
                    by default
       startfile    Object files to include at the start of the link
  
--- 11363,11369 ----
       libgcc       Decides which GCC support library to pass to the linker
       linker       Sets the name of the linker
       predefines   Defines to be passed to the C preprocessor
!      signed_char  Defines to pass to CPP to say whether char is signed
                    by default
       startfile    Object files to include at the start of the link
  
*************** targets can also add their own spec stri
*** 11444,11736 ****
       *lib:
       --start-group -lgcc -lc -leval1 --end-group %(old_lib)
  
!  This example renames the spec called `lib' to `old_lib' and then
! overrides the previous definition of `lib' with a new one.  The new
  definition adds in some extra command-line options before including the
  text of the old definition.
  
   "Spec strings" are a list of command-line options to be passed to their
  corresponding program.  In addition, the spec strings can contain
! `%'-prefixed sequences to substitute variable text or to conditionally
  insert text into the command line.  Using these constructs it is
  possible to generate quite complex command lines.
  
!  Here is a table of all defined `%'-sequences for spec strings.  Note
  that spaces are not generated automatically around the results of
  expanding these sequences.  Therefore you can concatenate them together
  or combine them with constant text in a single argument.
  
! `%%'
!      Substitute one `%' into the program name or argument.
  
! `%i'
       Substitute the name of the input file being processed.
  
! `%b'
!      Substitute the basename of the input file being processed.  This
!      is the substring up to (and not including) the last period and not
       including the directory.
  
! `%B'
!      This is the same as `%b', but include the file suffix (text after
       the last period).
  
! `%d'
!      Marks the argument containing or following the `%d' as a temporary
       file name, so that that file is deleted if GCC exits successfully.
!      Unlike `%g', this contributes no text to the argument.
  
! `%gSUFFIX'
       Substitute a file name that has suffix SUFFIX and is chosen once
!      per compilation, and mark the argument in the same way as `%d'.
!      To reduce exposure to denial-of-service attacks, the file name is
!      now chosen in a way that is hard to predict even when previously
!      chosen file names are known.  For example, `%g.s ... %g.o ... %g.s'
!      might turn into `ccUVUUAU.s ccXYAXZ12.o ccUVUUAU.s'.  SUFFIX
!      matches the regexp `[.A-Za-z]*' or the special string `%O', which
!      is treated exactly as if `%O' had been preprocessed.  Previously,
!      `%g' was simply substituted with a file name chosen once per
!      compilation, without regard to any appended suffix (which was
!      therefore treated just like ordinary text), making such attacks
!      more likely to succeed.
  
! `%uSUFFIX'
!      Like `%g', but generates a new temporary file name each time it
       appears instead of once per compilation.
  
! `%USUFFIX'
!      Substitutes the last file name generated with `%uSUFFIX',
       generating a new one if there is no such last file name.  In the
!      absence of any `%uSUFFIX', this is just like `%gSUFFIX', except
!      they don't share the same suffix _space_, so `%g.s ... %U.s ...
       %g.s ... %U.s' involves the generation of two distinct file names,
!      one for each `%g.s' and another for each `%U.s'.  Previously, `%U'
       was simply substituted with a file name chosen for the previous
!      `%u', without regard to any appended suffix.
  
! `%jSUFFIX'
!      Substitutes the name of the `HOST_BIT_BUCKET', if any, and if it is
!      writable, and if `-save-temps' is not used; otherwise, substitute
!      the name of a temporary file, just like `%u'.  This temporary file
       is not meant for communication between processes, but rather as a
       junk disposal mechanism.
  
! `%|SUFFIX'
! `%mSUFFIX'
!      Like `%g', except if `-pipe' is in effect.  In that case `%|'
!      substitutes a single dash and `%m' substitutes nothing at all.
       These are the two most common ways to instruct a program that it
       should read from standard input or write to standard output.  If
!      you need something more elaborate you can use an `%{pipe:`X'}'
!      construct: see for example `f/lang-specs.h'.
  
! `%.SUFFIX'
       Substitutes .SUFFIX for the suffixes of a matched switch's args
!      when it is subsequently output with `%*'.  SUFFIX is terminated by
       the next space or %.
  
! `%w'
!      Marks the argument containing or following the `%w' as the
       designated output file of this compilation.  This puts the argument
!      into the sequence of arguments that `%o' substitutes.
  
! `%o'
       Substitutes the names of all the output files, with spaces
       automatically placed around them.  You should write spaces around
!      the `%o' as well or the results are undefined.  `%o' is for use in
       the specs for running the linker.  Input files whose names have no
       recognized suffix are not compiled at all, but they are included
       among the output files, so they are linked.
  
! `%O'
!      Substitutes the suffix for object files.  Note that this is
!      handled specially when it immediately follows `%g, %u, or %U',
!      because of the need for those to form complete file names.  The
!      handling is such that `%O' is treated exactly as if it had already
!      been substituted, except that `%g, %u, and %U' do not currently
!      support additional SUFFIX characters following `%O' as they do
!      following, for example, `.o'.
  
! `%p'
       Substitutes the standard macro predefinitions for the current
!      target machine.  Use this when running `cpp'.
  
! `%P'
!      Like `%p', but puts `__' before and after the name of each
!      predefined macro, except for macros that start with `__' or with
!      `_L', where L is an uppercase letter.  This is for ISO C.
  
! `%I'
!      Substitute any of `-iprefix' (made from `GCC_EXEC_PREFIX'),
!      `-isysroot' (made from `TARGET_SYSTEM_ROOT'), `-isystem' (made
!      from `COMPILER_PATH' and `-B' options) and `-imultilib' as
!      necessary.
  
! `%s'
       Current argument is the name of a library or startup file of some
       sort.  Search for that file in a standard list of directories and
       substitute the full name found.  The current working directory is
       included in the list of directories scanned.
  
! `%T'
       Current argument is the name of a linker script.  Search for that
!      file in the current list of directories to scan for libraries. If
!      the file is located insert a `--script' option into the command
       line followed by the full path name found.  If the file is not
       found then generate an error message.  Note: the current working
       directory is not searched.
  
! `%eSTR'
       Print STR as an error message.  STR is terminated by a newline.
       Use this when inconsistent options are detected.
  
! `%(NAME)'
       Substitute the contents of spec string NAME at this point.
  
! `%x{OPTION}'
!      Accumulate an option for `%X'.
  
! `%X'
!      Output the accumulated linker options specified by `-Wl' or a `%x'
       spec string.
  
! `%Y'
!      Output the accumulated assembler options specified by `-Wa'.
  
! `%Z'
!      Output the accumulated preprocessor options specified by `-Wp'.
  
! `%a'
!      Process the `asm' spec.  This is used to compute the switches to
!      be passed to the assembler.
  
! `%A'
!      Process the `asm_final' spec.  This is a spec string for passing
       switches to an assembler post-processor, if such a program is
       needed.
  
! `%l'
!      Process the `link' spec.  This is the spec for computing the
       command line passed to the linker.  Typically it makes use of the
!      `%L %G %S %D and %E' sequences.
  
! `%D'
!      Dump out a `-L' option for each directory that GCC believes might
       contain startup files.  If the target supports multilibs then the
       current multilib directory is prepended to each of these paths.
  
! `%L'
!      Process the `lib' spec.  This is a spec string for deciding which
       libraries are included on the command line to the linker.
  
! `%G'
!      Process the `libgcc' spec.  This is a spec string for deciding
       which GCC support library is included on the command line to the
       linker.
  
! `%S'
!      Process the `startfile' spec.  This is a spec for deciding which
       object files are the first ones passed to the linker.  Typically
!      this might be a file named `crt0.o'.
  
! `%E'
!      Process the `endfile' spec.  This is a spec string that specifies
       the last object files that are passed to the linker.
  
! `%C'
!      Process the `cpp' spec.  This is used to construct the arguments
!      to be passed to the C preprocessor.
  
! `%1'
!      Process the `cc1' spec.  This is used to construct the options to
!      be passed to the actual C compiler (`cc1').
  
! `%2'
!      Process the `cc1plus' spec.  This is used to construct the options
!      to be passed to the actual C++ compiler (`cc1plus').
  
! `%*'
!      Substitute the variable part of a matched option.  See below.
!      Note that each comma in the substituted string is replaced by a
!      single space.
  
! `%<`S''
!      Remove all occurrences of `-S' from the command line.  Note--this
!      command is position dependent.  `%' commands in the spec string
!      before this one see `-S', `%' commands in the spec string after
       this one do not.
  
! `%:FUNCTION(ARGS)'
       Call the named function FUNCTION, passing it ARGS.  ARGS is first
       processed as a nested spec string, then split into an argument
       vector in the usual fashion.  The function returns a string which
!      is processed as if it had appeared literally as part of the
!      current spec.
  
       The following built-in spec functions are provided:
  
!     ``getenv''
!           The `getenv' spec function takes two arguments: an environment
            variable name and a string.  If the environment variable is
            not defined, a fatal error is issued.  Otherwise, the return
            value is the value of the environment variable concatenated
!           with the string.  For example, if `TOPDIR' is defined as
!           `/path/to/top', then:
  
                 %:getenv(TOPDIR /include)
  
!           expands to `/path/to/top/include'.
  
!     ``if-exists''
!           The `if-exists' spec function takes one argument, an absolute
!           pathname to a file.  If the file exists, `if-exists' returns
            the pathname.  Here is a small example of its usage:
  
                 *startfile:
                 crt0%O%s %:if-exists(crti%O%s) crtbegin%O%s
  
!     ``if-exists-else''
!           The `if-exists-else' spec function is similar to the
!           `if-exists' spec function, except that it takes two
!           arguments.  The first argument is an absolute pathname to a
!           file.  If the file exists, `if-exists-else' returns the
!           pathname.  If it does not exist, it returns the second
!           argument.  This way, `if-exists-else' can be used to select
!           one file or another, based on the existence of the first.
!           Here is a small example of its usage:
  
                 *startfile:
                 crt0%O%s %:if-exists(crti%O%s) \
                 %:if-exists-else(crtbeginT%O%s crtbegin%O%s)
  
!     ``replace-outfile''
!           The `replace-outfile' spec function takes two arguments.  It
            looks for the first argument in the outfiles array and
!           replaces it with the second argument.  Here is a small
!           example of its usage:
  
                 %{fgnu-runtime:%:replace-outfile(-lobjc -lobjc-gnu)}
  
!     ``remove-outfile''
!           The `remove-outfile' spec function takes one argument.  It
!           looks for the first argument in the outfiles array and
!           removes it.  Here is a small example its usage:
  
                 %:remove-outfile(-lm)
  
!     ``pass-through-libs''
!           The `pass-through-libs' spec function takes any number of
!           arguments.  It finds any `-l' options and any non-options
!           ending in `.a' (which it assumes are the names of linker
!           input library archive files) and returns a result containing
!           all the found arguments each prepended by
!           `-plugin-opt=-pass-through=' and joined by spaces.  This list
!           is intended to be passed to the LTO linker plugin.
  
                 %:pass-through-libs(%G %L %G)
  
!     ``print-asm-header''
!           The `print-asm-header' function takes no arguments and simply
            prints a banner like:
  
                 Assembler options
--- 11374,11665 ----
       *lib:
       --start-group -lgcc -lc -leval1 --end-group %(old_lib)
  
!  This example renames the spec called 'lib' to 'old_lib' and then
! overrides the previous definition of 'lib' with a new one.  The new
  definition adds in some extra command-line options before including the
  text of the old definition.
  
   "Spec strings" are a list of command-line options to be passed to their
  corresponding program.  In addition, the spec strings can contain
! '%'-prefixed sequences to substitute variable text or to conditionally
  insert text into the command line.  Using these constructs it is
  possible to generate quite complex command lines.
  
!  Here is a table of all defined '%'-sequences for spec strings.  Note
  that spaces are not generated automatically around the results of
  expanding these sequences.  Therefore you can concatenate them together
  or combine them with constant text in a single argument.
  
! '%%'
!      Substitute one '%' into the program name or argument.
  
! '%i'
       Substitute the name of the input file being processed.
  
! '%b'
!      Substitute the basename of the input file being processed.  This is
!      the substring up to (and not including) the last period and not
       including the directory.
  
! '%B'
!      This is the same as '%b', but include the file suffix (text after
       the last period).
  
! '%d'
!      Marks the argument containing or following the '%d' as a temporary
       file name, so that that file is deleted if GCC exits successfully.
!      Unlike '%g', this contributes no text to the argument.
  
! '%gSUFFIX'
       Substitute a file name that has suffix SUFFIX and is chosen once
!      per compilation, and mark the argument in the same way as '%d'.  To
!      reduce exposure to denial-of-service attacks, the file name is now
!      chosen in a way that is hard to predict even when previously chosen
!      file names are known.  For example, '%g.s ... %g.o ... %g.s' might
!      turn into 'ccUVUUAU.s ccXYAXZ12.o ccUVUUAU.s'.  SUFFIX matches the
!      regexp '[.A-Za-z]*' or the special string '%O', which is treated
!      exactly as if '%O' had been preprocessed.  Previously, '%g' was
!      simply substituted with a file name chosen once per compilation,
!      without regard to any appended suffix (which was therefore treated
!      just like ordinary text), making such attacks more likely to
!      succeed.
  
! '%uSUFFIX'
!      Like '%g', but generates a new temporary file name each time it
       appears instead of once per compilation.
  
! '%USUFFIX'
!      Substitutes the last file name generated with '%uSUFFIX',
       generating a new one if there is no such last file name.  In the
!      absence of any '%uSUFFIX', this is just like '%gSUFFIX', except
!      they don't share the same suffix _space_, so '%g.s ... %U.s ...
       %g.s ... %U.s' involves the generation of two distinct file names,
!      one for each '%g.s' and another for each '%U.s'.  Previously, '%U'
       was simply substituted with a file name chosen for the previous
!      '%u', without regard to any appended suffix.
  
! '%jSUFFIX'
!      Substitutes the name of the 'HOST_BIT_BUCKET', if any, and if it is
!      writable, and if '-save-temps' is not used; otherwise, substitute
!      the name of a temporary file, just like '%u'.  This temporary file
       is not meant for communication between processes, but rather as a
       junk disposal mechanism.
  
! '%|SUFFIX'
! '%mSUFFIX'
!      Like '%g', except if '-pipe' is in effect.  In that case '%|'
!      substitutes a single dash and '%m' substitutes nothing at all.
       These are the two most common ways to instruct a program that it
       should read from standard input or write to standard output.  If
!      you need something more elaborate you can use an '%{pipe:'X'}'
!      construct: see for example 'f/lang-specs.h'.
  
! '%.SUFFIX'
       Substitutes .SUFFIX for the suffixes of a matched switch's args
!      when it is subsequently output with '%*'.  SUFFIX is terminated by
       the next space or %.
  
! '%w'
!      Marks the argument containing or following the '%w' as the
       designated output file of this compilation.  This puts the argument
!      into the sequence of arguments that '%o' substitutes.
  
! '%o'
       Substitutes the names of all the output files, with spaces
       automatically placed around them.  You should write spaces around
!      the '%o' as well or the results are undefined.  '%o' is for use in
       the specs for running the linker.  Input files whose names have no
       recognized suffix are not compiled at all, but they are included
       among the output files, so they are linked.
  
! '%O'
!      Substitutes the suffix for object files.  Note that this is handled
!      specially when it immediately follows '%g, %u, or %U', because of
!      the need for those to form complete file names.  The handling is
!      such that '%O' is treated exactly as if it had already been
!      substituted, except that '%g, %u, and %U' do not currently support
!      additional SUFFIX characters following '%O' as they do following,
!      for example, '.o'.
  
! '%p'
       Substitutes the standard macro predefinitions for the current
!      target machine.  Use this when running 'cpp'.
  
! '%P'
!      Like '%p', but puts '__' before and after the name of each
!      predefined macro, except for macros that start with '__' or with
!      '_L', where L is an uppercase letter.  This is for ISO C.
  
! '%I'
!      Substitute any of '-iprefix' (made from 'GCC_EXEC_PREFIX'),
!      '-isysroot' (made from 'TARGET_SYSTEM_ROOT'), '-isystem' (made from
!      'COMPILER_PATH' and '-B' options) and '-imultilib' as necessary.
  
! '%s'
       Current argument is the name of a library or startup file of some
       sort.  Search for that file in a standard list of directories and
       substitute the full name found.  The current working directory is
       included in the list of directories scanned.
  
! '%T'
       Current argument is the name of a linker script.  Search for that
!      file in the current list of directories to scan for libraries.  If
!      the file is located insert a '--script' option into the command
       line followed by the full path name found.  If the file is not
       found then generate an error message.  Note: the current working
       directory is not searched.
  
! '%eSTR'
       Print STR as an error message.  STR is terminated by a newline.
       Use this when inconsistent options are detected.
  
! '%(NAME)'
       Substitute the contents of spec string NAME at this point.
  
! '%x{OPTION}'
!      Accumulate an option for '%X'.
  
! '%X'
!      Output the accumulated linker options specified by '-Wl' or a '%x'
       spec string.
  
! '%Y'
!      Output the accumulated assembler options specified by '-Wa'.
  
! '%Z'
!      Output the accumulated preprocessor options specified by '-Wp'.
  
! '%a'
!      Process the 'asm' spec.  This is used to compute the switches to be
!      passed to the assembler.
  
! '%A'
!      Process the 'asm_final' spec.  This is a spec string for passing
       switches to an assembler post-processor, if such a program is
       needed.
  
! '%l'
!      Process the 'link' spec.  This is the spec for computing the
       command line passed to the linker.  Typically it makes use of the
!      '%L %G %S %D and %E' sequences.
  
! '%D'
!      Dump out a '-L' option for each directory that GCC believes might
       contain startup files.  If the target supports multilibs then the
       current multilib directory is prepended to each of these paths.
  
! '%L'
!      Process the 'lib' spec.  This is a spec string for deciding which
       libraries are included on the command line to the linker.
  
! '%G'
!      Process the 'libgcc' spec.  This is a spec string for deciding
       which GCC support library is included on the command line to the
       linker.
  
! '%S'
!      Process the 'startfile' spec.  This is a spec for deciding which
       object files are the first ones passed to the linker.  Typically
!      this might be a file named 'crt0.o'.
  
! '%E'
!      Process the 'endfile' spec.  This is a spec string that specifies
       the last object files that are passed to the linker.
  
! '%C'
!      Process the 'cpp' spec.  This is used to construct the arguments to
!      be passed to the C preprocessor.
  
! '%1'
!      Process the 'cc1' spec.  This is used to construct the options to
!      be passed to the actual C compiler ('cc1').
  
! '%2'
!      Process the 'cc1plus' spec.  This is used to construct the options
!      to be passed to the actual C++ compiler ('cc1plus').
  
! '%*'
!      Substitute the variable part of a matched option.  See below.  Note
!      that each comma in the substituted string is replaced by a single
!      space.
  
! '%<S'
!      Remove all occurrences of '-S' from the command line.  Note--this
!      command is position dependent.  '%' commands in the spec string
!      before this one see '-S', '%' commands in the spec string after
       this one do not.
  
! '%:FUNCTION(ARGS)'
       Call the named function FUNCTION, passing it ARGS.  ARGS is first
       processed as a nested spec string, then split into an argument
       vector in the usual fashion.  The function returns a string which
!      is processed as if it had appeared literally as part of the current
!      spec.
  
       The following built-in spec functions are provided:
  
!      'getenv'
!           The 'getenv' spec function takes two arguments: an environment
            variable name and a string.  If the environment variable is
            not defined, a fatal error is issued.  Otherwise, the return
            value is the value of the environment variable concatenated
!           with the string.  For example, if 'TOPDIR' is defined as
!           '/path/to/top', then:
  
                 %:getenv(TOPDIR /include)
  
!           expands to '/path/to/top/include'.
  
!      'if-exists'
!           The 'if-exists' spec function takes one argument, an absolute
!           pathname to a file.  If the file exists, 'if-exists' returns
            the pathname.  Here is a small example of its usage:
  
                 *startfile:
                 crt0%O%s %:if-exists(crti%O%s) crtbegin%O%s
  
!      'if-exists-else'
!           The 'if-exists-else' spec function is similar to the
!           'if-exists' spec function, except that it takes two arguments.
!           The first argument is an absolute pathname to a file.  If the
!           file exists, 'if-exists-else' returns the pathname.  If it
!           does not exist, it returns the second argument.  This way,
!           'if-exists-else' can be used to select one file or another,
!           based on the existence of the first.  Here is a small example
!           of its usage:
  
                 *startfile:
                 crt0%O%s %:if-exists(crti%O%s) \
                 %:if-exists-else(crtbeginT%O%s crtbegin%O%s)
  
!      'replace-outfile'
!           The 'replace-outfile' spec function takes two arguments.  It
            looks for the first argument in the outfiles array and
!           replaces it with the second argument.  Here is a small example
!           of its usage:
  
                 %{fgnu-runtime:%:replace-outfile(-lobjc -lobjc-gnu)}
  
!      'remove-outfile'
!           The 'remove-outfile' spec function takes one argument.  It
!           looks for the first argument in the outfiles array and removes
!           it.  Here is a small example its usage:
  
                 %:remove-outfile(-lm)
  
!      'pass-through-libs'
!           The 'pass-through-libs' spec function takes any number of
!           arguments.  It finds any '-l' options and any non-options
!           ending in '.a' (which it assumes are the names of linker input
!           library archive files) and returns a result containing all the
!           found arguments each prepended by '-plugin-opt=-pass-through='
!           and joined by spaces.  This list is intended to be passed to
!           the LTO linker plugin.
  
                 %:pass-through-libs(%G %L %G)
  
!      'print-asm-header'
!           The 'print-asm-header' function takes no arguments and simply
            prints a banner like:
  
                 Assembler options
*************** or combine them with constant text in a
*** 11739,11815 ****
                 Use "-Wa,OPTION" to pass "OPTION" to the assembler.
  
            It is used to separate compiler options from assembler options
!           in the `--target-help' output.
  
! `%{`S'}'
!      Substitutes the `-S' switch, if that switch is given to GCC.  If
       that switch is not specified, this substitutes nothing.  Note that
       the leading dash is omitted when specifying this option, and it is
       automatically inserted if the substitution is performed.  Thus the
!      spec string `%{foo}' matches the command-line option `-foo' and
!      outputs the command-line option `-foo'.
  
! `%W{`S'}'
!      Like %{`S'} but mark last argument supplied within as a file to be
       deleted on failure.
  
! `%{`S'*}'
       Substitutes all the switches specified to GCC whose names start
!      with `-S', but which also take an argument.  This is used for
!      switches like `-o', `-D', `-I', etc.  GCC considers `-o foo' as
!      being one switch whose name starts with `o'.  %{o*} substitutes
       this text, including the space.  Thus two arguments are generated.
  
! `%{`S'*&`T'*}'
!      Like %{`S'*}, but preserve order of `S' and `T' options (the order
!      of `S' and `T' in the spec is not significant).  There can be any
       number of ampersand-separated variables; for each the wild card is
!      optional.  Useful for CPP as `%{D*&U*&A*}'.
  
! `%{`S':`X'}'
!      Substitutes `X', if the `-S' switch is given to GCC.
  
! `%{!`S':`X'}'
!      Substitutes `X', if the `-S' switch is _not_ given to GCC.
  
! `%{`S'*:`X'}'
!      Substitutes `X' if one or more switches whose names start with
!      `-S' are specified to GCC.  Normally `X' is substituted only once,
!      no matter how many such switches appeared.  However, if `%*'
!      appears somewhere in `X', then `X' is substituted once for each
!      matching switch, with the `%*' replaced by the part of that switch
!      matching the `*'.
  
!      If `%*' appears as the last part of a spec sequence then a space
!      is added after the end of the last substitution.  If there is more
       text in the sequence, however, then a space is not generated.  This
!      allows the `%*' substitution to be used as part of a larger
!      string.  For example, a spec string like this:
  
            %{mcu=*:--script=%*/memory.ld}
  
!      when matching an option like `-mcu=newchip' produces:
  
            --script=newchip/memory.ld
  
! `%{.`S':`X'}'
!      Substitutes `X', if processing a file with suffix `S'.
  
! `%{!.`S':`X'}'
!      Substitutes `X', if _not_ processing a file with suffix `S'.
  
! `%{,`S':`X'}'
!      Substitutes `X', if processing a file for language `S'.
  
! `%{!,`S':`X'}'
!      Substitutes `X', if not processing a file for language `S'.
  
! `%{`S'|`P':`X'}'
!      Substitutes `X' if either `-S' or `-P' is given to GCC.  This may
!      be combined with `!', `.', `,', and `*' sequences as well,
!      although they have a stronger binding than the `|'.  If `%*'
!      appears in `X', all of the alternatives must be starred, and only
!      the first matching alternative is substituted.
  
       For example, a spec string like this:
  
--- 11668,11744 ----
                 Use "-Wa,OPTION" to pass "OPTION" to the assembler.
  
            It is used to separate compiler options from assembler options
!           in the '--target-help' output.
  
! '%{S}'
!      Substitutes the '-S' switch, if that switch is given to GCC.  If
       that switch is not specified, this substitutes nothing.  Note that
       the leading dash is omitted when specifying this option, and it is
       automatically inserted if the substitution is performed.  Thus the
!      spec string '%{foo}' matches the command-line option '-foo' and
!      outputs the command-line option '-foo'.
  
! '%W{S}'
!      Like %{'S'} but mark last argument supplied within as a file to be
       deleted on failure.
  
! '%{S*}'
       Substitutes all the switches specified to GCC whose names start
!      with '-S', but which also take an argument.  This is used for
!      switches like '-o', '-D', '-I', etc.  GCC considers '-o foo' as
!      being one switch whose name starts with 'o'.  %{o*} substitutes
       this text, including the space.  Thus two arguments are generated.
  
! '%{S*&T*}'
!      Like %{'S'*}, but preserve order of 'S' and 'T' options (the order
!      of 'S' and 'T' in the spec is not significant).  There can be any
       number of ampersand-separated variables; for each the wild card is
!      optional.  Useful for CPP as '%{D*&U*&A*}'.
  
! '%{S:X}'
!      Substitutes 'X', if the '-S' switch is given to GCC.
  
! '%{!S:X}'
!      Substitutes 'X', if the '-S' switch is _not_ given to GCC.
  
! '%{S*:X}'
!      Substitutes 'X' if one or more switches whose names start with '-S'
!      are specified to GCC.  Normally 'X' is substituted only once, no
!      matter how many such switches appeared.  However, if '%*' appears
!      somewhere in 'X', then 'X' is substituted once for each matching
!      switch, with the '%*' replaced by the part of that switch matching
!      the '*'.
  
!      If '%*' appears as the last part of a spec sequence then a space is
!      added after the end of the last substitution.  If there is more
       text in the sequence, however, then a space is not generated.  This
!      allows the '%*' substitution to be used as part of a larger string.
!      For example, a spec string like this:
  
            %{mcu=*:--script=%*/memory.ld}
  
!      when matching an option like '-mcu=newchip' produces:
  
            --script=newchip/memory.ld
  
! '%{.S:X}'
!      Substitutes 'X', if processing a file with suffix 'S'.
  
! '%{!.S:X}'
!      Substitutes 'X', if _not_ processing a file with suffix 'S'.
  
! '%{,S:X}'
!      Substitutes 'X', if processing a file for language 'S'.
  
! '%{!,S:X}'
!      Substitutes 'X', if not processing a file for language 'S'.
  
! '%{S|P:X}'
!      Substitutes 'X' if either '-S' or '-P' is given to GCC.  This may
!      be combined with '!', '.', ',', and '*' sequences as well, although
!      they have a stronger binding than the '|'.  If '%*' appears in 'X',
!      all of the alternatives must be starred, and only the first
!      matching alternative is substituted.
  
       For example, a spec string like this:
  
*************** or combine them with constant text in a
*** 11823,11851 ****
            -d fred.c     -foo -baz -boggle
            -d jim.d      -bar -baz -boggle
  
! `%{S:X; T:Y; :D}'
!      If `S' is given to GCC, substitutes `X'; else if `T' is given to
!      GCC, substitutes `Y'; else substitutes `D'.  There can be as many
!      clauses as you need.  This may be combined with `.', `,', `!',
!      `|', and `*' as needed.
  
  
!  The conditional text `X' in a %{`S':`X'} or similar construct may
! contain other nested `%' constructs or spaces, or even newlines.  They
! are processed as usual, as described above.  Trailing white space in
! `X' is ignored.  White space may also appear anywhere on the left side
! of the colon in these constructs, except between `.' or `*' and the
  corresponding word.
  
!  The `-O', `-f', `-m', and `-W' switches are handled specifically in
! these constructs.  If another value of `-O' or the negated form of a
! `-f', `-m', or `-W' switch is found later in the command line, the
! earlier switch value is ignored, except with {`S'*} where `S' is just
  one letter, which passes all matching options.
  
!  The character `|' at the beginning of the predicate text is used to
  indicate that a command should be piped to the following command, but
! only if `-pipe' is specified.
  
   It is built into GCC which switches take arguments and which do not.
  (You might think it would be useful to generalize this to allow each
--- 11752,11780 ----
            -d fred.c     -foo -baz -boggle
            -d jim.d      -bar -baz -boggle
  
! '%{S:X; T:Y; :D}'
  
+      If 'S' is given to GCC, substitutes 'X'; else if 'T' is given to
+      GCC, substitutes 'Y'; else substitutes 'D'.  There can be as many
+      clauses as you need.  This may be combined with '.', ',', '!', '|',
+      and '*' as needed.
  
!  The conditional text 'X' in a %{'S':'X'} or similar construct may
! contain other nested '%' constructs or spaces, or even newlines.  They
! are processed as usual, as described above.  Trailing white space in 'X'
! is ignored.  White space may also appear anywhere on the left side of
! the colon in these constructs, except between '.' or '*' and the
  corresponding word.
  
!  The '-O', '-f', '-m', and '-W' switches are handled specifically in
! these constructs.  If another value of '-O' or the negated form of a
! '-f', '-m', or '-W' switch is found later in the command line, the
! earlier switch value is ignored, except with {'S'*} where 'S' is just
  one letter, which passes all matching options.
  
!  The character '|' at the beginning of the predicate text is used to
  indicate that a command should be piped to the following command, but
! only if '-pipe' is specified.
  
   It is built into GCC which switches take arguments and which do not.
  (You might think it would be useful to generalize this to allow each
*************** files have been specified without knowin
*** 11855,11861 ****
  and it must know which input files to compile in order to tell which
  compilers to run).
  
!  GCC also knows implicitly that arguments starting in `-l' are to be
  treated as compiler output files, and passed to the linker in their
  proper position among the other output files.
  
--- 11784,11790 ----
  and it must know which input files to compile in order to tell which
  compilers to run).
  
!  GCC also knows implicitly that arguments starting in '-l' are to be
  treated as compiler output files, and passed to the linker in their
  proper position among the other output files.
  
*************** File: gcc.info,  Node: Target Options,
*** 11865,11872 ****
  3.16 Specifying Target Machine and Compiler Version
  ===================================================
  
! The usual way to run GCC is to run the executable called `gcc', or
! `MACHINE-gcc' when cross-compiling, or `MACHINE-gcc-VERSION' to run a
  version other than the one that was installed last.
  
  
--- 11794,11801 ----
  3.16 Specifying Target Machine and Compiler Version
  ===================================================
  
! The usual way to run GCC is to run the executable called 'gcc', or
! 'MACHINE-gcc' when cross-compiling, or 'MACHINE-gcc-VERSION' to run a
  version other than the one that was installed last.
  
  
*************** File: gcc.info,  Node: Submodel Options,
*** 11876,11882 ****
  =======================================
  
  Each target machine types can have its own special options, starting
! with `-m', to choose among various hardware models or
  configurations--for example, 68010 vs 68020, floating coprocessor or
  none.  A single installed version of the compiler can compile for any
  model or configuration, according to the options specified.
--- 11805,11811 ----
  =======================================
  
  Each target machine types can have its own special options, starting
! with '-m', to choose among various hardware models or
  configurations--for example, 68010 vs 68020, floating coprocessor or
  none.  A single installed version of the compiler can compile for any
  model or configuration, according to the options specified.
*************** File: gcc.info,  Node: AArch64 Options,
*** 11953,12033 ****
  
  These options are defined for AArch64 implementations:
  
! `-mabi=NAME'
!      Generate code for the specified data model.  Permissible values
!      are `ilp32' for SysV-like data model where int, long int and
!      pointer are 32-bit, and `lp64' for SysV-like data model where int
!      is 32-bit, but long int and pointer are 64-bit.
  
       The default depends on the specific target configuration.  Note
       that the LP64 and ILP32 ABIs are not link-compatible; you must
       compile your entire program with the same ABI, and link with a
       compatible set of libraries.
  
! `-mbig-endian'
       Generate big-endian code.  This is the default when GCC is
!      configured for an `aarch64_be-*-*' target.
  
! `-mgeneral-regs-only'
       Generate code which uses only the general registers.
  
! `-mlittle-endian'
       Generate little-endian code.  This is the default when GCC is
!      configured for an `aarch64-*-*' but not an `aarch64_be-*-*' target.
  
! `-mcmodel=tiny'
       Generate code for the tiny code model.  The program and its
       statically defined symbols must be within 1GB of each other.
       Pointers are 64 bits.  Programs can be statically or dynamically
       linked.  This model is not fully implemented and mostly treated as
!      `small'.
  
! `-mcmodel=small'
       Generate code for the small code model.  The program and its
       statically defined symbols must be within 4GB of each other.
       Pointers are 64 bits.  Programs can be statically or dynamically
       linked.  This is the default code model.
  
! `-mcmodel=large'
       Generate code for the large code model.  This makes no assumptions
       about addresses and sizes of sections.  Pointers are 64 bits.
       Programs can be statically linked only.
  
! `-mstrict-align'
       Do not assume that unaligned memory references are handled by the
       system.
  
! `-momit-leaf-frame-pointer'
! `-mno-omit-leaf-frame-pointer'
       Omit or keep the frame pointer in leaf functions.  The former
       behaviour is the default.
  
! `-mtls-dialect=desc'
       Use TLS descriptors as the thread-local storage mechanism for
       dynamic accesses of TLS variables.  This is the default.
  
! `-mtls-dialect=traditional'
       Use traditional TLS as the thread-local storage mechanism for
       dynamic accesses of TLS variables.
  
! `-mfix-cortex-a53-835769'
! `-mno-fix-cortex-a53-835769'
       Enable or disable the workaround for the ARM Cortex-A53 erratum
       number 835769.  This involves inserting a NOP instruction between
       memory instructions and 64-bit integer multiply-accumulate
       instructions.
  
! `-mfix-cortex-a53-843419'
! `-mno-fix-cortex-a53-843419'
       Enable or disable the workaround for the ARM Cortex-A53 erratum
       number 843419.  This erratum workaround is made at link time and
       this will only pass the corresponding flag to the linker.
  
! `-march=NAME'
!      Specify the name of the target architecture, optionally suffixed
!      by one or more feature modifiers.  This option has the form
!      `-march=ARCH{+[no]FEATURE}*', where the only permissible value for
!      ARCH is `armv8-a'.  The permissible values for FEATURE are
       documented in the sub-section below.
  
       Where conflicting feature modifiers are specified, the right-most
--- 11882,11962 ----
  
  These options are defined for AArch64 implementations:
  
! '-mabi=NAME'
!      Generate code for the specified data model.  Permissible values are
!      'ilp32' for SysV-like data model where int, long int and pointer
!      are 32-bit, and 'lp64' for SysV-like data model where int is
!      32-bit, but long int and pointer are 64-bit.
  
       The default depends on the specific target configuration.  Note
       that the LP64 and ILP32 ABIs are not link-compatible; you must
       compile your entire program with the same ABI, and link with a
       compatible set of libraries.
  
! '-mbig-endian'
       Generate big-endian code.  This is the default when GCC is
!      configured for an 'aarch64_be-*-*' target.
  
! '-mgeneral-regs-only'
       Generate code which uses only the general registers.
  
! '-mlittle-endian'
       Generate little-endian code.  This is the default when GCC is
!      configured for an 'aarch64-*-*' but not an 'aarch64_be-*-*' target.
  
! '-mcmodel=tiny'
       Generate code for the tiny code model.  The program and its
       statically defined symbols must be within 1GB of each other.
       Pointers are 64 bits.  Programs can be statically or dynamically
       linked.  This model is not fully implemented and mostly treated as
!      'small'.
  
! '-mcmodel=small'
       Generate code for the small code model.  The program and its
       statically defined symbols must be within 4GB of each other.
       Pointers are 64 bits.  Programs can be statically or dynamically
       linked.  This is the default code model.
  
! '-mcmodel=large'
       Generate code for the large code model.  This makes no assumptions
       about addresses and sizes of sections.  Pointers are 64 bits.
       Programs can be statically linked only.
  
! '-mstrict-align'
       Do not assume that unaligned memory references are handled by the
       system.
  
! '-momit-leaf-frame-pointer'
! '-mno-omit-leaf-frame-pointer'
       Omit or keep the frame pointer in leaf functions.  The former
       behaviour is the default.
  
! '-mtls-dialect=desc'
       Use TLS descriptors as the thread-local storage mechanism for
       dynamic accesses of TLS variables.  This is the default.
  
! '-mtls-dialect=traditional'
       Use traditional TLS as the thread-local storage mechanism for
       dynamic accesses of TLS variables.
  
! '-mfix-cortex-a53-835769'
! '-mno-fix-cortex-a53-835769'
       Enable or disable the workaround for the ARM Cortex-A53 erratum
       number 835769.  This involves inserting a NOP instruction between
       memory instructions and 64-bit integer multiply-accumulate
       instructions.
  
! '-mfix-cortex-a53-843419'
! '-mno-fix-cortex-a53-843419'
       Enable or disable the workaround for the ARM Cortex-A53 erratum
       number 843419.  This erratum workaround is made at link time and
       this will only pass the corresponding flag to the linker.
  
! '-march=NAME'
!      Specify the name of the target architecture, optionally suffixed by
!      one or more feature modifiers.  This option has the form
!      '-march=ARCH{+[no]FEATURE}*', where the only permissible value for
!      ARCH is 'armv8-a'.  The permissible values for FEATURE are
       documented in the sub-section below.
  
       Where conflicting feature modifiers are specified, the right-most
*************** These options are defined for AArch64 im
*** 12036,12066 ****
       GCC uses this name to determine what kind of instructions it can
       emit when generating assembly code.
  
!      Where `-march' is specified without either of `-mtune' or `-mcpu'
       also being specified, the code is tuned to perform well across a
       range of target processors implementing the target architecture.
  
! `-mtune=NAME'
       Specify the name of the target processor for which GCC should tune
       the performance of the code.  Permissible values for this option
!      are: `generic', `cortex-a53', `cortex-a57', `cortex-a72',
!      `exynos-m1', `thunderx', `xgene1'.
  
       Additionally, this option can specify that GCC should tune the
       performance of the code for a big.LITTLE system.  Permissible
!      values for this option are: `cortex-a57.cortex-a53',
!      `cortex-a72.cortex-a53'.
  
!      Where none of `-mtune=', `-mcpu=' or `-march=' are specified, the
       code is tuned to perform well across a range of target processors.
  
       This option cannot be suffixed by feature modifiers.
  
! `-mcpu=NAME'
       Specify the name of the target processor, optionally suffixed by
       one or more feature modifiers.  This option has the form
!      `-mcpu=CPU{+[no]FEATURE}*', where the permissible values for CPU
!      are the same as those available for `-mtune'.
  
       The permissible values for FEATURE are documented in the
       sub-section below.
--- 11965,11995 ----
       GCC uses this name to determine what kind of instructions it can
       emit when generating assembly code.
  
!      Where '-march' is specified without either of '-mtune' or '-mcpu'
       also being specified, the code is tuned to perform well across a
       range of target processors implementing the target architecture.
  
! '-mtune=NAME'
       Specify the name of the target processor for which GCC should tune
       the performance of the code.  Permissible values for this option
!      are: 'generic', 'cortex-a53', 'cortex-a57', 'cortex-a72',
!      'exynos-m1', 'thunderx', 'xgene1'.
  
       Additionally, this option can specify that GCC should tune the
       performance of the code for a big.LITTLE system.  Permissible
!      values for this option are: 'cortex-a57.cortex-a53',
!      'cortex-a72.cortex-a53'.
  
!      Where none of '-mtune=', '-mcpu=' or '-march=' are specified, the
       code is tuned to perform well across a range of target processors.
  
       This option cannot be suffixed by feature modifiers.
  
! '-mcpu=NAME'
       Specify the name of the target processor, optionally suffixed by
       one or more feature modifiers.  This option has the form
!      '-mcpu=CPU{+[no]FEATURE}*', where the permissible values for CPU
!      are the same as those available for '-mtune'.
  
       The permissible values for FEATURE are documented in the
       sub-section below.
*************** These options are defined for AArch64 im
*** 12069,12099 ****
       feature is used.
  
       GCC uses this name to determine what kind of instructions it can
!      emit when generating assembly code (as if by `-march') and to
       determine the target processor for which to tune for performance
!      (as if by `-mtune').  Where this option is used in conjunction
!      with `-march' or `-mtune', those options take precedence over the
       appropriate part of this option.
  
! 3.17.1.1 `-march' and `-mcpu' Feature Modifiers
  ...............................................
  
! Feature modifiers used with `-march' and `-mcpu' can be one the
  following:
  
! `crc'
       Enable CRC extension.
! 
! `crypto'
       Enable Crypto extension.  This implies Advanced SIMD is enabled.
! 
! `fp'
       Enable floating-point instructions.
! 
! `simd'
       Enable Advanced SIMD instructions.  This implies floating-point
       instructions are enabled.  This is the default for all current
!      possible values for options `-march' and `-mcpu='.
  
  
  File: gcc.info,  Node: Adapteva Epiphany Options,  Next: ARC Options,  Prev: AArch64 Options,  Up: Submodel Options
--- 11998,12025 ----
       feature is used.
  
       GCC uses this name to determine what kind of instructions it can
!      emit when generating assembly code (as if by '-march') and to
       determine the target processor for which to tune for performance
!      (as if by '-mtune').  Where this option is used in conjunction with
!      '-march' or '-mtune', those options take precedence over the
       appropriate part of this option.
  
! 3.17.1.1 '-march' and '-mcpu' Feature Modifiers
  ...............................................
  
! Feature modifiers used with '-march' and '-mcpu' can be one the
  following:
  
! 'crc'
       Enable CRC extension.
! 'crypto'
       Enable Crypto extension.  This implies Advanced SIMD is enabled.
! 'fp'
       Enable floating-point instructions.
! 'simd'
       Enable Advanced SIMD instructions.  This implies floating-point
       instructions are enabled.  This is the default for all current
!      possible values for options '-march' and '-mcpu='.
  
  
  File: gcc.info,  Node: Adapteva Epiphany Options,  Next: ARC Options,  Prev: AArch64 Options,  Up: Submodel Options
*************** File: gcc.info,  Node: Adapteva Epiphany
*** 12101,12141 ****
  3.17.2 Adapteva Epiphany Options
  --------------------------------
  
! These `-m' options are defined for Adapteva Epiphany:
  
! `-mhalf-reg-file'
!      Don't allocate any register in the range `r32'...`r63'.  That
       allows code to run on hardware variants that lack these registers.
  
! `-mprefer-short-insn-regs'
       Preferrentially allocate registers that allow short instruction
       generation.  This can result in increased instruction count, so
       this may either reduce or increase overall code size.
  
! `-mbranch-cost=NUM'
       Set the cost of branches to roughly NUM "simple" instructions.
       This cost is only a heuristic and is not guaranteed to produce
       consistent results across releases.
  
! `-mcmove'
       Enable the generation of conditional moves.
  
! `-mnops=NUM'
       Emit NUM NOPs before every other generated instruction.
  
! `-mno-soft-cmpsf'
!      For single-precision floating-point comparisons, emit an `fsub'
       instruction and test the flags.  This is faster than a software
       comparison, but can get incorrect results in the presence of NaNs,
       or when two different small numbers are compared such that their
!      difference is calculated as zero.  The default is `-msoft-cmpsf',
       which uses slower, but IEEE-compliant, software comparisons.
  
! `-mstack-offset=NUM'
       Set the offset between the top of the stack and the stack pointer.
       E.g., a value of 8 means that the eight bytes in the range
!      `sp+0...sp+7' can be used by leaf functions without stack
!      allocation.  Values other than `8' or `16' are untested and
       unlikely to work.  Note also that this option changes the ABI;
       compiling a program with a different stack offset than the
       libraries have been compiled with generally does not work.  This
--- 12027,12067 ----
  3.17.2 Adapteva Epiphany Options
  --------------------------------
  
! These '-m' options are defined for Adapteva Epiphany:
  
! '-mhalf-reg-file'
!      Don't allocate any register in the range 'r32'...'r63'.  That
       allows code to run on hardware variants that lack these registers.
  
! '-mprefer-short-insn-regs'
       Preferrentially allocate registers that allow short instruction
       generation.  This can result in increased instruction count, so
       this may either reduce or increase overall code size.
  
! '-mbranch-cost=NUM'
       Set the cost of branches to roughly NUM "simple" instructions.
       This cost is only a heuristic and is not guaranteed to produce
       consistent results across releases.
  
! '-mcmove'
       Enable the generation of conditional moves.
  
! '-mnops=NUM'
       Emit NUM NOPs before every other generated instruction.
  
! '-mno-soft-cmpsf'
!      For single-precision floating-point comparisons, emit an 'fsub'
       instruction and test the flags.  This is faster than a software
       comparison, but can get incorrect results in the presence of NaNs,
       or when two different small numbers are compared such that their
!      difference is calculated as zero.  The default is '-msoft-cmpsf',
       which uses slower, but IEEE-compliant, software comparisons.
  
! '-mstack-offset=NUM'
       Set the offset between the top of the stack and the stack pointer.
       E.g., a value of 8 means that the eight bytes in the range
!      'sp+0...sp+7' can be used by leaf functions without stack
!      allocation.  Values other than '8' or '16' are untested and
       unlikely to work.  Note also that this option changes the ABI;
       compiling a program with a different stack offset than the
       libraries have been compiled with generally does not work.  This
*************** These `-m' options are defined for Adapt
*** 12143,12238 ****
       offset would give you better code, but to actually use a different
       stack offset to build working programs, it is recommended to
       configure the toolchain with the appropriate
!      `--with-stack-offset=NUM' option.
  
! `-mno-round-nearest'
       Make the scheduler assume that the rounding mode has been set to
!      truncating.  The default is `-mround-nearest'.
  
! `-mlong-calls'
       If not otherwise specified by an attribute, assume all calls might
!      be beyond the offset range of the `b' / `bl' instructions, and
       therefore load the function address into a register before
       performing a (otherwise direct) call.  This is the default.
  
! `-mshort-calls'
!      If not otherwise specified by an attribute, assume all direct
!      calls are in the range of the `b' / `bl' instructions, so use
!      these instructions for direct calls.  The default is
!      `-mlong-calls'.
  
! `-msmall16'
       Assume addresses can be loaded as 16-bit unsigned values.  This
!      does not apply to function addresses for which `-mlong-calls'
       semantics are in effect.
  
! `-mfp-mode=MODE'
       Set the prevailing mode of the floating-point unit.  This
!      determines the floating-point mode that is provided and expected
!      at function call and return time.  Making this mode match the mode
!      you predominantly need at function start can make your programs
!      smaller and faster by avoiding unnecessary mode switches.
  
       MODE can be set to one the following values:
  
!     `caller'
            Any mode at function entry is valid, and retained or restored
            when the function returns, and when it calls other functions.
            This mode is useful for compiling libraries or other
!           compilation units you might want to incorporate into
!           different programs with different prevailing FPU modes, and
!           the convenience of being able to use a single object file
            outweighs the size and speed overhead for any extra mode
            switching that might be needed, compared with what would be
            needed with a more specific choice of prevailing FPU mode.
  
!     `truncate'
            This is the mode used for floating-point calculations with
            truncating (i.e. round towards zero) rounding mode.  That
            includes conversion from floating point to integer.
  
!     `round-nearest'
            This is the mode used for floating-point calculations with
            round-to-nearest-or-even rounding mode.
  
!     `int'
            This is the mode used to perform integer calculations in the
!           FPU, e.g.  integer multiply, or integer
            multiply-and-accumulate.
  
!      The default is `-mfp-mode=caller'
  
! `-mnosplit-lohi'
! `-mno-postinc'
! `-mno-postmodify'
       Code generation tweaks that disable, respectively, splitting of
       32-bit loads, generation of post-increment addresses, and
       generation of post-modify addresses.  The defaults are
!      `msplit-lohi', `-mpost-inc', and `-mpost-modify'.
  
! `-mnovect-double'
       Change the preferred SIMD mode to SImode.  The default is
!      `-mvect-double', which uses DImode as preferred SIMD mode.
  
! `-max-vect-align=NUM'
       The maximum alignment for SIMD vector mode types.  NUM may be 4 or
!      8.  The default is 8.  Note that this is an ABI change, even
!      though many library function interfaces are unaffected if they
!      don't use SIMD vector modes in places that affect size and/or
!      alignment of relevant types.
  
! `-msplit-vecmove-early'
!      Split vector moves into single word moves before reload.  In
!      theory this can give better register allocation, but so far the
!      reverse seems to be generally the case.
  
! `-m1reg-REG'
       Specify a register to hold the constant -1, which makes loading
       small negative constants and certain bitmasks faster.  Allowable
!      values for REG are `r43' and `r63', which specify use of that
!      register as a fixed register, and `none', which means that no
!      register is used for this purpose.  The default is `-m1reg-none'.
! 
  
  
  File: gcc.info,  Node: ARC Options,  Next: ARM Options,  Prev: Adapteva Epiphany Options,  Up: Submodel Options
--- 12069,12162 ----
       offset would give you better code, but to actually use a different
       stack offset to build working programs, it is recommended to
       configure the toolchain with the appropriate
!      '--with-stack-offset=NUM' option.
  
! '-mno-round-nearest'
       Make the scheduler assume that the rounding mode has been set to
!      truncating.  The default is '-mround-nearest'.
  
! '-mlong-calls'
       If not otherwise specified by an attribute, assume all calls might
!      be beyond the offset range of the 'b' / 'bl' instructions, and
       therefore load the function address into a register before
       performing a (otherwise direct) call.  This is the default.
  
! '-mshort-calls'
!      If not otherwise specified by an attribute, assume all direct calls
!      are in the range of the 'b' / 'bl' instructions, so use these
!      instructions for direct calls.  The default is '-mlong-calls'.
  
! '-msmall16'
       Assume addresses can be loaded as 16-bit unsigned values.  This
!      does not apply to function addresses for which '-mlong-calls'
       semantics are in effect.
  
! '-mfp-mode=MODE'
       Set the prevailing mode of the floating-point unit.  This
!      determines the floating-point mode that is provided and expected at
!      function call and return time.  Making this mode match the mode you
!      predominantly need at function start can make your programs smaller
!      and faster by avoiding unnecessary mode switches.
  
       MODE can be set to one the following values:
  
!      'caller'
            Any mode at function entry is valid, and retained or restored
            when the function returns, and when it calls other functions.
            This mode is useful for compiling libraries or other
!           compilation units you might want to incorporate into different
!           programs with different prevailing FPU modes, and the
!           convenience of being able to use a single object file
            outweighs the size and speed overhead for any extra mode
            switching that might be needed, compared with what would be
            needed with a more specific choice of prevailing FPU mode.
  
!      'truncate'
            This is the mode used for floating-point calculations with
            truncating (i.e. round towards zero) rounding mode.  That
            includes conversion from floating point to integer.
  
!      'round-nearest'
            This is the mode used for floating-point calculations with
            round-to-nearest-or-even rounding mode.
  
!      'int'
            This is the mode used to perform integer calculations in the
!           FPU, e.g. integer multiply, or integer
            multiply-and-accumulate.
  
!      The default is '-mfp-mode=caller'
  
! '-mnosplit-lohi'
! '-mno-postinc'
! '-mno-postmodify'
       Code generation tweaks that disable, respectively, splitting of
       32-bit loads, generation of post-increment addresses, and
       generation of post-modify addresses.  The defaults are
!      'msplit-lohi', '-mpost-inc', and '-mpost-modify'.
  
! '-mnovect-double'
       Change the preferred SIMD mode to SImode.  The default is
!      '-mvect-double', which uses DImode as preferred SIMD mode.
  
! '-max-vect-align=NUM'
       The maximum alignment for SIMD vector mode types.  NUM may be 4 or
!      8.  The default is 8.  Note that this is an ABI change, even though
!      many library function interfaces are unaffected if they don't use
!      SIMD vector modes in places that affect size and/or alignment of
!      relevant types.
  
! '-msplit-vecmove-early'
!      Split vector moves into single word moves before reload.  In theory
!      this can give better register allocation, but so far the reverse
!      seems to be generally the case.
  
! '-m1reg-REG'
       Specify a register to hold the constant -1, which makes loading
       small negative constants and certain bitmasks faster.  Allowable
!      values for REG are 'r43' and 'r63', which specify use of that
!      register as a fixed register, and 'none', which means that no
!      register is used for this purpose.  The default is '-m1reg-none'.
  
  
  File: gcc.info,  Node: ARC Options,  Next: ARM Options,  Prev: Adapteva Epiphany Options,  Up: Submodel Options
*************** File: gcc.info,  Node: ARC Options,  Nex
*** 12240,12497 ****
  3.17.3 ARC Options
  ------------------
  
! The following options control the architecture variant for which code
! is being compiled:
  
! `-mbarrel-shifter'
       Generate instructions supported by barrel shifter.  This is the
!      default unless `-mcpu=ARC601' is in effect.
  
! `-mcpu=CPU'
       Set architecture type, register usage, and instruction scheduling
       parameters for CPU.  There are also shortcut alias options
       available for backward compatibility and convenience.  Supported
       values for CPU are
  
!     `ARC600'
!           Compile for ARC600.  Aliases: `-mA6', `-mARC600'.
  
!     `ARC601'
!           Compile for ARC601.  Alias: `-mARC601'.
  
!     `ARC700'
!           Compile for ARC700.  Aliases: `-mA7', `-mARC700'.  This is
!           the default when configured with `--with-cpu=arc700'.
  
! `-mdpfp'
! `-mdpfp-compact'
       FPX: Generate Double Precision FPX instructions, tuned for the
       compact implementation.
  
! `-mdpfp-fast'
       FPX: Generate Double Precision FPX instructions, tuned for the fast
       implementation.
  
! `-mno-dpfp-lrsr'
       Disable LR and SR instructions from using FPX extension aux
       registers.
  
! `-mea'
!      Generate Extended arithmetic instructions.  Currently only
!      `divaw', `adds', `subs', and `sat16' are supported.  This is
!      always enabled for `-mcpu=ARC700'.
  
! `-mno-mpy'
       Do not generate mpy instructions for ARC700.
  
! `-mmul32x16'
       Generate 32x16 bit multiply and mac instructions.
  
! `-mmul64'
       Generate mul64 and mulu64 instructions.  Only valid for
!      `-mcpu=ARC600'.
  
! `-mnorm'
!      Generate norm instruction.  This is the default if `-mcpu=ARC700'
       is in effect.
  
! `-mspfp'
! `-mspfp-compact'
       FPX: Generate Single Precision FPX instructions, tuned for the
       compact implementation.
  
! `-mspfp-fast'
       FPX: Generate Single Precision FPX instructions, tuned for the fast
       implementation.
  
! `-msimd'
       Enable generation of ARC SIMD instructions via target-specific
!      builtins.  Only valid for `-mcpu=ARC700'.
  
! `-msoft-float'
       This option ignored; it is provided for compatibility purposes
!      only.  Software floating point code is emitted by default, and
!      this default can overridden by FPX options; `mspfp',
!      `mspfp-compact', or `mspfp-fast' for single precision, and `mdpfp',
!      `mdpfp-compact', or `mdpfp-fast' for double precision.
  
! `-mswap'
       Generate swap instructions.
  
- 
   The following options are passed through to the assembler, and also
  define preprocessor macro symbols.
  
! `-mdsp-packa'
       Passed down to the assembler to enable the DSP Pack A extensions.
!      Also sets the preprocessor symbol `__Xdsp_packa'.
  
! `-mdvbf'
       Passed down to the assembler to enable the dual viterbi butterfly
!      extension.  Also sets the preprocessor symbol `__Xdvbf'.
  
! `-mlock'
       Passed down to the assembler to enable the Locked Load/Store
       Conditional extension.  Also sets the preprocessor symbol
!      `__Xlock'.
  
! `-mmac-d16'
       Passed down to the assembler.  Also sets the preprocessor symbol
!      `__Xxmac_d16'.
  
! `-mmac-24'
       Passed down to the assembler.  Also sets the preprocessor symbol
!      `__Xxmac_24'.
  
! `-mrtsc'
       Passed down to the assembler to enable the 64-bit Time-Stamp
       Counter extension instruction.  Also sets the preprocessor symbol
!      `__Xrtsc'.
  
! `-mswape'
       Passed down to the assembler to enable the swap byte ordering
       extension instruction.  Also sets the preprocessor symbol
!      `__Xswape'.
  
! `-mtelephony'
       Passed down to the assembler to enable dual and single operand
       instructions for telephony.  Also sets the preprocessor symbol
!      `__Xtelephony'.
  
! `-mxy'
       Passed down to the assembler to enable the XY Memory extension.
!      Also sets the preprocessor symbol `__Xxy'.
! 
  
   The following options control how the assembly code is annotated:
  
! `-misize'
       Annotate assembler instructions with estimated addresses.
  
! `-mannotate-align'
       Explain what alignment considerations lead to the decision to make
       an instruction short or long.
  
- 
   The following options are passed through to the linker:
  
! `-marclinux'
!      Passed through to the linker, to specify use of the `arclinux'
       emulation.  This option is enabled by default in tool chains built
!      for `arc-linux-uclibc' and `arceb-linux-uclibc' targets when
       profiling is not requested.
  
! `-marclinux_prof'
!      Passed through to the linker, to specify use of the
!      `arclinux_prof' emulation.  This option is enabled by default in
!      tool chains built for `arc-linux-uclibc' and `arceb-linux-uclibc'
!      targets when profiling is requested.
! 
  
   The following options control the semantics of generated code:
  
! `-mepilogue-cfi'
       Enable generation of call frame information for epilogues.
  
! `-mno-epilogue-cfi'
       Disable generation of call frame information for epilogues.
  
! `-mlong-calls'
       Generate call insns as register indirect calls, thus providing
       access to the full 32-bit address range.
  
! `-mmedium-calls'
       Don't use less than 25 bit addressing range for calls, which is the
       offset available for an unconditional branch-and-link instruction.
!      Conditional execution of function calls is suppressed, to allow
!      use of the 25-bit range, rather than the 21-bit range with
!      conditional branch-and-link.  This is the default for tool chains
!      built for `arc-linux-uclibc' and `arceb-linux-uclibc' targets.
  
! `-mno-sdata'
       Do not generate sdata references.  This is the default for tool
!      chains built for `arc-linux-uclibc' and `arceb-linux-uclibc'
       targets.
  
! `-mucb-mcount'
!      Instrument with mcount calls as used in UCB code.  I.e. do the
       counting in the callee, not the caller.  By default ARC
       instrumentation counts in the caller.
  
! `-mvolatile-cache'
       Use ordinarily cached memory accesses for volatile references.
       This is the default.
  
! `-mno-volatile-cache'
       Enable cache bypass for volatile references.
  
- 
   The following options fine tune code generation:
! `-malign-call'
       Do alignment optimizations for call instructions.
  
! `-mauto-modify-reg'
       Enable the use of pre/post modify with register displacement.
  
! `-mbbit-peephole'
       Enable bbit peephole2.
  
! `-mno-brcc'
!      This option disables a target-specific pass in `arc_reorg' to
!      generate `BRcc' instructions.  It has no effect on `BRcc'
       generation driven by the combiner pass.
  
! `-mcase-vector-pcrel'
       Use pc-relative switch case tables - this enables case table
!      shortening.  This is the default for `-Os'.
  
! `-mcompact-casesi'
!      Enable compact casesi pattern.  This is the default for `-Os'.
  
! `-mno-cond-exec'
       Disable ARCompact specific pass to generate conditional execution
       instructions.  Due to delay slot scheduling and interactions
       between operand numbers, literal sizes, instruction lengths, and
       the support for conditional execution, the target-independent pass
!      to generate conditional execution is often lacking, so the ARC
!      port has kept a special pass around that tries to find more
!      conditional execution generating opportunities after register
!      allocation, branch shortening, and delay slot scheduling have been
!      done.  This pass generally, but not always, improves performance
!      and code size, at the cost of extra compilation time, which is why
!      there is an option to switch it off.  If you have a problem with
!      call instructions exceeding their allowable offset range because
!      they are conditionalized, you should consider using
!      `-mmedium-calls' instead.
  
! `-mearly-cbranchsi'
       Enable pre-reload use of the cbranchsi pattern.
  
! `-mexpand-adddi'
!      Expand `adddi3' and `subdi3' at rtl generation time into `add.f',
!      `adc' etc.
  
! `-mindexed-loads'
       Enable the use of indexed loads.  This can be problematic because
       some optimizers then assume that indexed stores exist, which is not
       the case.
  
! `-mlra'
       Enable Local Register Allocation.  This is still experimental for
       ARC, so by default the compiler uses standard reload (i.e.
!      `-mno-lra').
  
! `-mlra-priority-none'
       Don't indicate any priority for target registers.
  
! `-mlra-priority-compact'
       Indicate target register priority for r0..r3 / r12..r15.
  
! `-mlra-priority-noncompact'
       Reduce target regsiter priority for r0..r3 / r12..r15.
  
! `-mno-millicode'
!      When optimizing for size (using `-Os'), prologues and epilogues
       that have to save or restore a large number of registers are often
       shortened by using call to a special function in libgcc; this is
       referred to as a _millicode_ call.  As these calls can pose
--- 12164,12416 ----
  3.17.3 ARC Options
  ------------------
  
! The following options control the architecture variant for which code is
! being compiled:
  
! '-mbarrel-shifter'
       Generate instructions supported by barrel shifter.  This is the
!      default unless '-mcpu=ARC601' is in effect.
  
! '-mcpu=CPU'
       Set architecture type, register usage, and instruction scheduling
       parameters for CPU.  There are also shortcut alias options
       available for backward compatibility and convenience.  Supported
       values for CPU are
  
!      'ARC600'
!           Compile for ARC600.  Aliases: '-mA6', '-mARC600'.
  
!      'ARC601'
!           Compile for ARC601.  Alias: '-mARC601'.
  
!      'ARC700'
!           Compile for ARC700.  Aliases: '-mA7', '-mARC700'.  This is the
!           default when configured with '--with-cpu=arc700'.
  
! '-mdpfp'
! '-mdpfp-compact'
       FPX: Generate Double Precision FPX instructions, tuned for the
       compact implementation.
  
! '-mdpfp-fast'
       FPX: Generate Double Precision FPX instructions, tuned for the fast
       implementation.
  
! '-mno-dpfp-lrsr'
       Disable LR and SR instructions from using FPX extension aux
       registers.
  
! '-mea'
!      Generate Extended arithmetic instructions.  Currently only 'divaw',
!      'adds', 'subs', and 'sat16' are supported.  This is always enabled
!      for '-mcpu=ARC700'.
  
! '-mno-mpy'
       Do not generate mpy instructions for ARC700.
  
! '-mmul32x16'
       Generate 32x16 bit multiply and mac instructions.
  
! '-mmul64'
       Generate mul64 and mulu64 instructions.  Only valid for
!      '-mcpu=ARC600'.
  
! '-mnorm'
!      Generate norm instruction.  This is the default if '-mcpu=ARC700'
       is in effect.
  
! '-mspfp'
! '-mspfp-compact'
       FPX: Generate Single Precision FPX instructions, tuned for the
       compact implementation.
  
! '-mspfp-fast'
       FPX: Generate Single Precision FPX instructions, tuned for the fast
       implementation.
  
! '-msimd'
       Enable generation of ARC SIMD instructions via target-specific
!      builtins.  Only valid for '-mcpu=ARC700'.
  
! '-msoft-float'
       This option ignored; it is provided for compatibility purposes
!      only.  Software floating point code is emitted by default, and this
!      default can overridden by FPX options; 'mspfp', 'mspfp-compact', or
!      'mspfp-fast' for single precision, and 'mdpfp', 'mdpfp-compact', or
!      'mdpfp-fast' for double precision.
  
! '-mswap'
       Generate swap instructions.
  
   The following options are passed through to the assembler, and also
  define preprocessor macro symbols.
  
! '-mdsp-packa'
       Passed down to the assembler to enable the DSP Pack A extensions.
!      Also sets the preprocessor symbol '__Xdsp_packa'.
  
! '-mdvbf'
       Passed down to the assembler to enable the dual viterbi butterfly
!      extension.  Also sets the preprocessor symbol '__Xdvbf'.
  
! '-mlock'
       Passed down to the assembler to enable the Locked Load/Store
       Conditional extension.  Also sets the preprocessor symbol
!      '__Xlock'.
  
! '-mmac-d16'
       Passed down to the assembler.  Also sets the preprocessor symbol
!      '__Xxmac_d16'.
  
! '-mmac-24'
       Passed down to the assembler.  Also sets the preprocessor symbol
!      '__Xxmac_24'.
  
! '-mrtsc'
       Passed down to the assembler to enable the 64-bit Time-Stamp
       Counter extension instruction.  Also sets the preprocessor symbol
!      '__Xrtsc'.
  
! '-mswape'
       Passed down to the assembler to enable the swap byte ordering
       extension instruction.  Also sets the preprocessor symbol
!      '__Xswape'.
  
! '-mtelephony'
       Passed down to the assembler to enable dual and single operand
       instructions for telephony.  Also sets the preprocessor symbol
!      '__Xtelephony'.
  
! '-mxy'
       Passed down to the assembler to enable the XY Memory extension.
!      Also sets the preprocessor symbol '__Xxy'.
  
   The following options control how the assembly code is annotated:
  
! '-misize'
       Annotate assembler instructions with estimated addresses.
  
! '-mannotate-align'
       Explain what alignment considerations lead to the decision to make
       an instruction short or long.
  
   The following options are passed through to the linker:
  
! '-marclinux'
!      Passed through to the linker, to specify use of the 'arclinux'
       emulation.  This option is enabled by default in tool chains built
!      for 'arc-linux-uclibc' and 'arceb-linux-uclibc' targets when
       profiling is not requested.
  
! '-marclinux_prof'
!      Passed through to the linker, to specify use of the 'arclinux_prof'
!      emulation.  This option is enabled by default in tool chains built
!      for 'arc-linux-uclibc' and 'arceb-linux-uclibc' targets when
!      profiling is requested.
  
   The following options control the semantics of generated code:
  
! '-mepilogue-cfi'
       Enable generation of call frame information for epilogues.
  
! '-mno-epilogue-cfi'
       Disable generation of call frame information for epilogues.
  
! '-mlong-calls'
       Generate call insns as register indirect calls, thus providing
       access to the full 32-bit address range.
  
! '-mmedium-calls'
       Don't use less than 25 bit addressing range for calls, which is the
       offset available for an unconditional branch-and-link instruction.
!      Conditional execution of function calls is suppressed, to allow use
!      of the 25-bit range, rather than the 21-bit range with conditional
!      branch-and-link.  This is the default for tool chains built for
!      'arc-linux-uclibc' and 'arceb-linux-uclibc' targets.
  
! '-mno-sdata'
       Do not generate sdata references.  This is the default for tool
!      chains built for 'arc-linux-uclibc' and 'arceb-linux-uclibc'
       targets.
  
! '-mucb-mcount'
!      Instrument with mcount calls as used in UCB code.  I.e.  do the
       counting in the callee, not the caller.  By default ARC
       instrumentation counts in the caller.
  
! '-mvolatile-cache'
       Use ordinarily cached memory accesses for volatile references.
       This is the default.
  
! '-mno-volatile-cache'
       Enable cache bypass for volatile references.
  
   The following options fine tune code generation:
! '-malign-call'
       Do alignment optimizations for call instructions.
  
! '-mauto-modify-reg'
       Enable the use of pre/post modify with register displacement.
  
! '-mbbit-peephole'
       Enable bbit peephole2.
  
! '-mno-brcc'
!      This option disables a target-specific pass in 'arc_reorg' to
!      generate 'BRcc' instructions.  It has no effect on 'BRcc'
       generation driven by the combiner pass.
  
! '-mcase-vector-pcrel'
       Use pc-relative switch case tables - this enables case table
!      shortening.  This is the default for '-Os'.
  
! '-mcompact-casesi'
!      Enable compact casesi pattern.  This is the default for '-Os'.
  
! '-mno-cond-exec'
       Disable ARCompact specific pass to generate conditional execution
       instructions.  Due to delay slot scheduling and interactions
       between operand numbers, literal sizes, instruction lengths, and
       the support for conditional execution, the target-independent pass
!      to generate conditional execution is often lacking, so the ARC port
!      has kept a special pass around that tries to find more conditional
!      execution generating opportunities after register allocation,
!      branch shortening, and delay slot scheduling have been done.  This
!      pass generally, but not always, improves performance and code size,
!      at the cost of extra compilation time, which is why there is an
!      option to switch it off.  If you have a problem with call
!      instructions exceeding their allowable offset range because they
!      are conditionalized, you should consider using '-mmedium-calls'
!      instead.
  
! '-mearly-cbranchsi'
       Enable pre-reload use of the cbranchsi pattern.
  
! '-mexpand-adddi'
!      Expand 'adddi3' and 'subdi3' at rtl generation time into 'add.f',
!      'adc' etc.
  
! '-mindexed-loads'
       Enable the use of indexed loads.  This can be problematic because
       some optimizers then assume that indexed stores exist, which is not
       the case.
  
! '-mlra'
       Enable Local Register Allocation.  This is still experimental for
       ARC, so by default the compiler uses standard reload (i.e.
!      '-mno-lra').
  
! '-mlra-priority-none'
       Don't indicate any priority for target registers.
  
! '-mlra-priority-compact'
       Indicate target register priority for r0..r3 / r12..r15.
  
! '-mlra-priority-noncompact'
       Reduce target regsiter priority for r0..r3 / r12..r15.
  
! '-mno-millicode'
!      When optimizing for size (using '-Os'), prologues and epilogues
       that have to save or restore a large number of registers are often
       shortened by using call to a special function in libgcc; this is
       referred to as a _millicode_ call.  As these calls can pose
*************** define preprocessor macro symbols.
*** 12499,12636 ****
       nonstandard way, this option is provided to turn off millicode call
       generation.
  
! `-mmixed-code'
       Tweak register allocation to help 16-bit instruction generation.
!      This generally has the effect of decreasing the average
!      instruction size while increasing the instruction count.
  
! `-mq-class'
       Enable 'q' instruction alternatives.  This is the default for
!      `-Os'.
  
! `-mRcq'
!      Enable Rcq constraint handling - most short code generation
!      depends on this.  This is the default.
  
! `-mRcw'
       Enable Rcw constraint handling - ccfsm condexec mostly depends on
       this.  This is the default.
  
! `-msize-level=LEVEL'
!      Fine-tune size optimization with regards to instruction lengths
!      and alignment.  The recognized values for LEVEL are:
!     `0'
            No size optimization.  This level is deprecated and treated
!           like `1'.
  
!     `1'
            Short instructions are used opportunistically.
  
!     `2'
!           In addition, alignment of loops and of code after barriers
!           are dropped.
  
!     `3'
            In addition, optional data alignment is dropped, and the
!           option `Os' is enabled.
! 
  
!      This defaults to `3' when `-Os' is in effect.  Otherwise, the
!      behavior when this is not set is equivalent to level `1'.
  
! `-mtune=CPU'
       Set instruction scheduling parameters for CPU, overriding any
!      implied by `-mcpu='.
  
       Supported values for CPU are
  
!     `ARC600'
            Tune for ARC600 cpu.
  
!     `ARC601'
            Tune for ARC601 cpu.
  
!     `ARC700'
            Tune for ARC700 cpu with standard multiplier block.
  
!     `ARC700-xmac'
            Tune for ARC700 cpu with XMAC block.
  
!     `ARC725D'
            Tune for ARC725D cpu.
  
!     `ARC750D'
            Tune for ARC750D cpu.
  
! 
! `-mmultcost=NUM'
!      Cost to assume for a multiply instruction, with `4' being equal to
       a normal instruction.
  
! `-munalign-prob-threshold=PROBABILITY'
!      Set probability threshold for unaligning branches.  When tuning
!      for `ARC700' and optimizing for speed, branches without filled
!      delay slot are preferably emitted unaligned and long, unless
!      profiling indicates that the probability for the branch to be taken
!      is below PROBABILITY.  *Note Cross-profiling::.  The default is
       (REG_BR_PROB_BASE/2), i.e. 5000.
  
- 
   The following options are maintained for backward compatibility, but
  are now deprecated and will be removed in a future release:
  
! `-margonaut'
       Obsolete FPX.
  
! `-mbig-endian'
! `-EB'
       Compile code for big endian targets.  Use of these options is now
       deprecated.  Users wanting big-endian code, should use the
!      `arceb-elf32' and `arceb-linux-uclibc' targets when building the
       tool chain, for which big-endian is the default.
  
! `-mlittle-endian'
! `-EL'
       Compile code for little endian targets.  Use of these options is
       now deprecated.  Users wanting little-endian code should use the
!      `arc-elf32' and `arc-linux-uclibc' targets when building the tool
       chain, for which little-endian is the default.
  
! `-mbarrel_shifter'
!      Replaced by `-mbarrel-shifter'.
  
! `-mdpfp_compact'
!      Replaced by `-mdpfp-compact'.
  
! `-mdpfp_fast'
!      Replaced by `-mdpfp-fast'.
  
! `-mdsp_packa'
!      Replaced by `-mdsp-packa'.
  
! `-mEA'
!      Replaced by `-mea'.
  
! `-mmac_24'
!      Replaced by `-mmac-24'.
  
! `-mmac_d16'
!      Replaced by `-mmac-d16'.
  
! `-mspfp_compact'
!      Replaced by `-mspfp-compact'.
  
! `-mspfp_fast'
!      Replaced by `-mspfp-fast'.
  
! `-mtune=CPU'
!      Values `arc600', `arc601', `arc700' and `arc700-xmac' for CPU are
!      replaced by `ARC600', `ARC601', `ARC700' and `ARC700-xmac'
       respectively
  
! `-multcost=NUM'
!      Replaced by `-mmultcost'.
! 
  
  
  File: gcc.info,  Node: ARM Options,  Next: AVR Options,  Prev: ARC Options,  Up: Submodel Options
--- 12418,12551 ----
       nonstandard way, this option is provided to turn off millicode call
       generation.
  
! '-mmixed-code'
       Tweak register allocation to help 16-bit instruction generation.
!      This generally has the effect of decreasing the average instruction
!      size while increasing the instruction count.
  
! '-mq-class'
       Enable 'q' instruction alternatives.  This is the default for
!      '-Os'.
  
! '-mRcq'
!      Enable Rcq constraint handling - most short code generation depends
!      on this.  This is the default.
  
! '-mRcw'
       Enable Rcw constraint handling - ccfsm condexec mostly depends on
       this.  This is the default.
  
! '-msize-level=LEVEL'
!      Fine-tune size optimization with regards to instruction lengths and
!      alignment.  The recognized values for LEVEL are:
!      '0'
            No size optimization.  This level is deprecated and treated
!           like '1'.
  
!      '1'
            Short instructions are used opportunistically.
  
!      '2'
!           In addition, alignment of loops and of code after barriers are
!           dropped.
  
!      '3'
            In addition, optional data alignment is dropped, and the
!           option 'Os' is enabled.
  
!      This defaults to '3' when '-Os' is in effect.  Otherwise, the
!      behavior when this is not set is equivalent to level '1'.
  
! '-mtune=CPU'
       Set instruction scheduling parameters for CPU, overriding any
!      implied by '-mcpu='.
  
       Supported values for CPU are
  
!      'ARC600'
            Tune for ARC600 cpu.
  
!      'ARC601'
            Tune for ARC601 cpu.
  
!      'ARC700'
            Tune for ARC700 cpu with standard multiplier block.
  
!      'ARC700-xmac'
            Tune for ARC700 cpu with XMAC block.
  
!      'ARC725D'
            Tune for ARC725D cpu.
  
!      'ARC750D'
            Tune for ARC750D cpu.
  
! '-mmultcost=NUM'
!      Cost to assume for a multiply instruction, with '4' being equal to
       a normal instruction.
  
! '-munalign-prob-threshold=PROBABILITY'
!      Set probability threshold for unaligning branches.  When tuning for
!      'ARC700' and optimizing for speed, branches without filled delay
!      slot are preferably emitted unaligned and long, unless profiling
!      indicates that the probability for the branch to be taken is below
!      PROBABILITY.  *Note Cross-profiling::.  The default is
       (REG_BR_PROB_BASE/2), i.e. 5000.
  
   The following options are maintained for backward compatibility, but
  are now deprecated and will be removed in a future release:
  
! '-margonaut'
       Obsolete FPX.
  
! '-mbig-endian'
! '-EB'
       Compile code for big endian targets.  Use of these options is now
       deprecated.  Users wanting big-endian code, should use the
!      'arceb-elf32' and 'arceb-linux-uclibc' targets when building the
       tool chain, for which big-endian is the default.
  
! '-mlittle-endian'
! '-EL'
       Compile code for little endian targets.  Use of these options is
       now deprecated.  Users wanting little-endian code should use the
!      'arc-elf32' and 'arc-linux-uclibc' targets when building the tool
       chain, for which little-endian is the default.
  
! '-mbarrel_shifter'
!      Replaced by '-mbarrel-shifter'.
  
! '-mdpfp_compact'
!      Replaced by '-mdpfp-compact'.
  
! '-mdpfp_fast'
!      Replaced by '-mdpfp-fast'.
  
! '-mdsp_packa'
!      Replaced by '-mdsp-packa'.
  
! '-mEA'
!      Replaced by '-mea'.
  
! '-mmac_24'
!      Replaced by '-mmac-24'.
  
! '-mmac_d16'
!      Replaced by '-mmac-d16'.
  
! '-mspfp_compact'
!      Replaced by '-mspfp-compact'.
  
! '-mspfp_fast'
!      Replaced by '-mspfp-fast'.
  
! '-mtune=CPU'
!      Values 'arc600', 'arc601', 'arc700' and 'arc700-xmac' for CPU are
!      replaced by 'ARC600', 'ARC601', 'ARC700' and 'ARC700-xmac'
       respectively
  
! '-multcost=NUM'
!      Replaced by '-mmultcost'.
  
  
  File: gcc.info,  Node: ARM Options,  Next: AVR Options,  Prev: ARC Options,  Up: Submodel Options
*************** File: gcc.info,  Node: ARM Options,  Nex
*** 12638,12685 ****
  3.17.4 ARM Options
  ------------------
  
! These `-m' options are defined for the ARM port:
  
! `-mabi=NAME'
       Generate code for the specified ABI.  Permissible values are:
!      `apcs-gnu', `atpcs', `aapcs', `aapcs-linux' and `iwmmxt'.
  
! `-mapcs-frame'
       Generate a stack frame that is compliant with the ARM Procedure
       Call Standard for all functions, even if this is not strictly
       necessary for correct execution of the code.  Specifying
!      `-fomit-frame-pointer' with this option causes the stack frames
!      not to be generated for leaf functions.  The default is
!      `-mno-apcs-frame'.  This option is deprecated.
  
! `-mapcs'
!      This is a synonym for `-mapcs-frame' and is deprecated.
  
! `-mthumb-interwork'
       Generate code that supports calling between the ARM and Thumb
       instruction sets.  Without this option, on pre-v5 architectures,
       the two instruction sets cannot be reliably used inside one
!      program.  The default is `-mno-thumb-interwork', since slightly
!      larger code is generated when `-mthumb-interwork' is specified.
!      In AAPCS configurations this option is meaningless.
  
! `-mno-sched-prolog'
!      Prevent the reordering of instructions in the function prologue,
!      or the merging of those instruction with the instructions in the
       function's body.  This means that all functions start with a
!      recognizable set of instructions (or in fact one of a choice from
!      a small set of different function prologues), and this information
       can be used to locate the start of functions inside an executable
!      piece of code.  The default is `-msched-prolog'.
  
! `-mfloat-abi=NAME'
!      Specifies which floating-point ABI to use.  Permissible values
!      are: `soft', `softfp' and `hard'.
  
!      Specifying `soft' causes GCC to generate output containing library
!      calls for floating-point operations.  `softfp' allows the
       generation of code using hardware floating-point instructions, but
!      still uses the soft-float calling conventions.  `hard' allows
       generation of floating-point instructions and uses FPU-specific
       calling conventions.
  
--- 12553,12600 ----
  3.17.4 ARM Options
  ------------------
  
! These '-m' options are defined for the ARM port:
  
! '-mabi=NAME'
       Generate code for the specified ABI.  Permissible values are:
!      'apcs-gnu', 'atpcs', 'aapcs', 'aapcs-linux' and 'iwmmxt'.
  
! '-mapcs-frame'
       Generate a stack frame that is compliant with the ARM Procedure
       Call Standard for all functions, even if this is not strictly
       necessary for correct execution of the code.  Specifying
!      '-fomit-frame-pointer' with this option causes the stack frames not
!      to be generated for leaf functions.  The default is
!      '-mno-apcs-frame'.  This option is deprecated.
  
! '-mapcs'
!      This is a synonym for '-mapcs-frame' and is deprecated.
  
! '-mthumb-interwork'
       Generate code that supports calling between the ARM and Thumb
       instruction sets.  Without this option, on pre-v5 architectures,
       the two instruction sets cannot be reliably used inside one
!      program.  The default is '-mno-thumb-interwork', since slightly
!      larger code is generated when '-mthumb-interwork' is specified.  In
!      AAPCS configurations this option is meaningless.
  
! '-mno-sched-prolog'
!      Prevent the reordering of instructions in the function prologue, or
!      the merging of those instruction with the instructions in the
       function's body.  This means that all functions start with a
!      recognizable set of instructions (or in fact one of a choice from a
!      small set of different function prologues), and this information
       can be used to locate the start of functions inside an executable
!      piece of code.  The default is '-msched-prolog'.
  
! '-mfloat-abi=NAME'
!      Specifies which floating-point ABI to use.  Permissible values are:
!      'soft', 'softfp' and 'hard'.
  
!      Specifying 'soft' causes GCC to generate output containing library
!      calls for floating-point operations.  'softfp' allows the
       generation of code using hardware floating-point instructions, but
!      still uses the soft-float calling conventions.  'hard' allows
       generation of floating-point instructions and uses FPU-specific
       calling conventions.
  
*************** These `-m' options are defined for the A
*** 12688,12876 ****
       you must compile your entire program with the same ABI, and link
       with a compatible set of libraries.
  
! `-mlittle-endian'
       Generate code for a processor running in little-endian mode.  This
       is the default for all standard configurations.
  
! `-mbig-endian'
       Generate code for a processor running in big-endian mode; the
       default is to compile code for a little-endian processor.
  
! `-march=NAME'
       This specifies the name of the target ARM architecture.  GCC uses
       this name to determine what kind of instructions it can emit when
       generating assembly code.  This option can be used in conjunction
!      with or instead of the `-mcpu=' option.  Permissible names are:
!      `armv2', `armv2a', `armv3', `armv3m', `armv4', `armv4t', `armv5',
!      `armv5t', `armv5e', `armv5te', `armv6', `armv6j', `armv6t2',
!      `armv6z', `armv6zk', `armv6-m', `armv7', `armv7-a', `armv7-r',
!      `armv7-m', `armv7e-m', `armv7ve', `armv8-a', `armv8-a+crc',
!      `iwmmxt', `iwmmxt2', `ep9312'.
  
!      `-march=armv7ve' is the armv7-a architecture with virtualization
       extensions.
  
!      `-march=armv8-a+crc' enables code generation for the ARMv8-A
       architecture together with the optional CRC32 extensions.
  
!      `-march=native' causes the compiler to auto-detect the architecture
       of the build computer.  At present, this feature is only supported
       on GNU/Linux, and not all architectures are recognized.  If the
       auto-detect is unsuccessful the option has no effect.
  
! `-mtune=NAME'
       This option specifies the name of the target ARM processor for
       which GCC should tune the performance of the code.  For some ARM
       implementations better performance can be obtained by using this
!      option.  Permissible names are: `arm2', `arm250', `arm3', `arm6',
!      `arm60', `arm600', `arm610', `arm620', `arm7', `arm7m', `arm7d',
!      `arm7dm', `arm7di', `arm7dmi', `arm70', `arm700', `arm700i',
!      `arm710', `arm710c', `arm7100', `arm720', `arm7500', `arm7500fe',
!      `arm7tdmi', `arm7tdmi-s', `arm710t', `arm720t', `arm740t',
!      `strongarm', `strongarm110', `strongarm1100', `strongarm1110',
!      `arm8', `arm810', `arm9', `arm9e', `arm920', `arm920t', `arm922t',
!      `arm946e-s', `arm966e-s', `arm968e-s', `arm926ej-s', `arm940t',
!      `arm9tdmi', `arm10tdmi', `arm1020t', `arm1026ej-s', `arm10e',
!      `arm1020e', `arm1022e', `arm1136j-s', `arm1136jf-s', `mpcore',
!      `mpcorenovfp', `arm1156t2-s', `arm1156t2f-s', `arm1176jz-s',
!      `arm1176jzf-s', `cortex-a5', `cortex-a7', `cortex-a8', `cortex-a9',
!      `cortex-a12', `cortex-a15', `cortex-a53', `cortex-a57',
!      `cortex-a72', `cortex-r4', `cortex-r4f', `cortex-r5', `cortex-r7',
!      `cortex-m7', `cortex-m4', `cortex-m3', `cortex-m1', `cortex-m0',
!      `cortex-m0plus', `cortex-m1.small-multiply',
!      `cortex-m0.small-multiply', `cortex-m0plus.small-multiply',
!      `exynos-m1', `marvell-pj4', `xscale', `iwmmxt', `iwmmxt2',
!      `ep9312', `fa526', `fa626', `fa606te', `fa626te', `fmp626',
!      `fa726te', `xgene1'.
  
       Additionally, this option can specify that GCC should tune the
!      performance of the code for a big.LITTLE system.  Permissible
!      names are: `cortex-a15.cortex-a7', `cortex-a57.cortex-a53',
!      `cortex-a72.cortex-a53'.
  
!      `-mtune=generic-ARCH' specifies that GCC should tune the
       performance for a blend of processors within architecture ARCH.
       The aim is to generate code that run well on the current most
       popular processors, balancing between optimizations that benefit
       some CPUs in the range, and avoiding performance pitfalls of other
!      CPUs.  The effects of this option may change in future GCC
!      versions as CPU models come and go.
  
!      `-mtune=native' causes the compiler to auto-detect the CPU of the
       build computer.  At present, this feature is only supported on
       GNU/Linux, and not all architectures are recognized.  If the
       auto-detect is unsuccessful the option has no effect.
  
! `-mcpu=NAME'
!      This specifies the name of the target ARM processor.  GCC uses
!      this name to derive the name of the target ARM architecture (as if
!      specified by `-march') and the ARM processor type for which to
!      tune for performance (as if specified by `-mtune').  Where this
!      option is used in conjunction with `-march' or `-mtune', those
!      options take precedence over the appropriate part of this option.
  
       Permissible names for this option are the same as those for
!      `-mtune'.
  
!      `-mcpu=generic-ARCH' is also permissible, and is equivalent to
!      `-march=ARCH -mtune=generic-ARCH'.  See `-mtune' for more
       information.
  
!      `-mcpu=native' causes the compiler to auto-detect the CPU of the
       build computer.  At present, this feature is only supported on
       GNU/Linux, and not all architectures are recognized.  If the
       auto-detect is unsuccessful the option has no effect.
  
! `-mfpu=NAME'
!      This specifies what floating-point hardware (or hardware
!      emulation) is available on the target.  Permissible names are:
!      `vfp', `vfpv3', `vfpv3-fp16', `vfpv3-d16', `vfpv3-d16-fp16',
!      `vfpv3xd', `vfpv3xd-fp16', `neon', `neon-fp16', `vfpv4',
!      `vfpv4-d16', `fpv4-sp-d16', `neon-vfpv4', `fpv5-d16',
!      `fpv5-sp-d16', `fp-armv8', `neon-fp-armv8', and
!      `crypto-neon-fp-armv8'.
  
!      If `-msoft-float' is specified this specifies the format of
       floating-point values.
  
       If the selected floating-point hardware includes the NEON extension
!      (e.g. `-mfpu'=`neon'), note that floating-point operations are not
       generated by GCC's auto-vectorization pass unless
!      `-funsafe-math-optimizations' is also specified.  This is because
       NEON hardware does not fully implement the IEEE 754 standard for
       floating-point arithmetic (in particular denormal values are
       treated as zero), so the use of NEON instructions may lead to a
       loss of precision.
  
! `-mfp16-format=NAME'
!      Specify the format of the `__fp16' half-precision floating-point
!      type.  Permissible names are `none', `ieee', and `alternative';
!      the default is `none', in which case the `__fp16' type is not
!      defined.  *Note Half-Precision::, for more information.
  
! `-mstructure-size-boundary=N'
       The sizes of all structures and unions are rounded up to a multiple
       of the number of bits set by this option.  Permissible values are
       8, 32 and 64.  The default value varies for different toolchains.
!      For the COFF targeted toolchain the default value is 8.  A value
!      of 64 is only allowed if the underlying ABI supports it.
  
!      Specifying a larger number can produce faster, more efficient
!      code, but can also increase the size of the program.  Different
!      values are potentially incompatible.  Code compiled with one value
!      cannot necessarily expect to work with code or libraries compiled
!      with another value, if they exchange information using structures
!      or unions.
  
! `-mabort-on-noreturn'
!      Generate a call to the function `abort' at the end of a `noreturn'
       function.  It is executed if the function tries to return.
  
! `-mlong-calls'
! `-mno-long-calls'
       Tells the compiler to perform function calls by first loading the
       address of the function into a register and then performing a
       subroutine call on this register.  This switch is needed if the
!      target function lies outside of the 64-megabyte addressing range
!      of the offset-based version of subroutine call instruction.
  
       Even if this switch is enabled, not all function calls are turned
       into long calls.  The heuristic is that static functions, functions
!      that have the `short_call' attribute, functions that are inside
!      the scope of a `#pragma no_long_calls' directive, and functions
!      whose definitions have already been compiled within the current
!      compilation unit are not turned into long calls.  The exceptions
!      to this rule are that weak function definitions, functions with
!      the `long_call' attribute or the `section' attribute, and
!      functions that are within the scope of a `#pragma long_calls'
!      directive are always turned into long calls.
  
       This feature is not enabled by default.  Specifying
!      `-mno-long-calls' restores the default behavior, as does placing
!      the function calls within the scope of a `#pragma long_calls_off'
       directive.  Note these switches have no effect on how the compiler
       generates code to handle function calls via function pointers.
  
! `-msingle-pic-base'
       Treat the register used for PIC addressing as read-only, rather
       than loading it in the prologue for each function.  The runtime
       system is responsible for initializing this register with an
       appropriate value before execution begins.
  
! `-mpic-register=REG'
       Specify the register to be used for PIC addressing.  For standard
       PIC base case, the default is any suitable register determined by
!      compiler.  For single PIC base case, the default is `R9' if target
       is EABI based or stack-checking is enabled, otherwise the default
!      is `R10'.
  
! `-mpic-data-is-text-relative'
!      Assume that each data segments are relative to text segment at
!      load time.  Therefore, it permits addressing data using
!      PC-relative operations.  This option is on by default for targets
!      other than VxWorks RTP.
  
! `-mpoke-function-name'
       Write the name of each function into the text section, directly
       preceding the function prologue.  The generated code is similar to
       this:
--- 12603,12790 ----
       you must compile your entire program with the same ABI, and link
       with a compatible set of libraries.
  
! '-mlittle-endian'
       Generate code for a processor running in little-endian mode.  This
       is the default for all standard configurations.
  
! '-mbig-endian'
       Generate code for a processor running in big-endian mode; the
       default is to compile code for a little-endian processor.
  
! '-march=NAME'
       This specifies the name of the target ARM architecture.  GCC uses
       this name to determine what kind of instructions it can emit when
       generating assembly code.  This option can be used in conjunction
!      with or instead of the '-mcpu=' option.  Permissible names are:
!      'armv2', 'armv2a', 'armv3', 'armv3m', 'armv4', 'armv4t', 'armv5',
!      'armv5t', 'armv5e', 'armv5te', 'armv6', 'armv6j', 'armv6t2',
!      'armv6z', 'armv6zk', 'armv6-m', 'armv7', 'armv7-a', 'armv7-r',
!      'armv7-m', 'armv7e-m', 'armv7ve', 'armv8-a', 'armv8-a+crc',
!      'iwmmxt', 'iwmmxt2', 'ep9312'.
  
!      '-march=armv7ve' is the armv7-a architecture with virtualization
       extensions.
  
!      '-march=armv8-a+crc' enables code generation for the ARMv8-A
       architecture together with the optional CRC32 extensions.
  
!      '-march=native' causes the compiler to auto-detect the architecture
       of the build computer.  At present, this feature is only supported
       on GNU/Linux, and not all architectures are recognized.  If the
       auto-detect is unsuccessful the option has no effect.
  
! '-mtune=NAME'
       This option specifies the name of the target ARM processor for
       which GCC should tune the performance of the code.  For some ARM
       implementations better performance can be obtained by using this
!      option.  Permissible names are: 'arm2', 'arm250', 'arm3', 'arm6',
!      'arm60', 'arm600', 'arm610', 'arm620', 'arm7', 'arm7m', 'arm7d',
!      'arm7dm', 'arm7di', 'arm7dmi', 'arm70', 'arm700', 'arm700i',
!      'arm710', 'arm710c', 'arm7100', 'arm720', 'arm7500', 'arm7500fe',
!      'arm7tdmi', 'arm7tdmi-s', 'arm710t', 'arm720t', 'arm740t',
!      'strongarm', 'strongarm110', 'strongarm1100', 'strongarm1110',
!      'arm8', 'arm810', 'arm9', 'arm9e', 'arm920', 'arm920t', 'arm922t',
!      'arm946e-s', 'arm966e-s', 'arm968e-s', 'arm926ej-s', 'arm940t',
!      'arm9tdmi', 'arm10tdmi', 'arm1020t', 'arm1026ej-s', 'arm10e',
!      'arm1020e', 'arm1022e', 'arm1136j-s', 'arm1136jf-s', 'mpcore',
!      'mpcorenovfp', 'arm1156t2-s', 'arm1156t2f-s', 'arm1176jz-s',
!      'arm1176jzf-s', 'cortex-a5', 'cortex-a7', 'cortex-a8', 'cortex-a9',
!      'cortex-a12', 'cortex-a15', 'cortex-a53', 'cortex-a57',
!      'cortex-a72', 'cortex-r4', 'cortex-r4f', 'cortex-r5', 'cortex-r7',
!      'cortex-m7', 'cortex-m4', 'cortex-m3', 'cortex-m1', 'cortex-m0',
!      'cortex-m0plus', 'cortex-m1.small-multiply',
!      'cortex-m0.small-multiply', 'cortex-m0plus.small-multiply',
!      'exynos-m1', 'marvell-pj4', 'xscale', 'iwmmxt', 'iwmmxt2',
!      'ep9312', 'fa526', 'fa626', 'fa606te', 'fa626te', 'fmp626',
!      'fa726te', 'xgene1'.
  
       Additionally, this option can specify that GCC should tune the
!      performance of the code for a big.LITTLE system.  Permissible names
!      are: 'cortex-a15.cortex-a7', 'cortex-a57.cortex-a53',
!      'cortex-a72.cortex-a53'.
  
!      '-mtune=generic-ARCH' specifies that GCC should tune the
       performance for a blend of processors within architecture ARCH.
       The aim is to generate code that run well on the current most
       popular processors, balancing between optimizations that benefit
       some CPUs in the range, and avoiding performance pitfalls of other
!      CPUs.  The effects of this option may change in future GCC versions
!      as CPU models come and go.
  
!      '-mtune=native' causes the compiler to auto-detect the CPU of the
       build computer.  At present, this feature is only supported on
       GNU/Linux, and not all architectures are recognized.  If the
       auto-detect is unsuccessful the option has no effect.
  
! '-mcpu=NAME'
!      This specifies the name of the target ARM processor.  GCC uses this
!      name to derive the name of the target ARM architecture (as if
!      specified by '-march') and the ARM processor type for which to tune
!      for performance (as if specified by '-mtune').  Where this option
!      is used in conjunction with '-march' or '-mtune', those options
!      take precedence over the appropriate part of this option.
  
       Permissible names for this option are the same as those for
!      '-mtune'.
  
!      '-mcpu=generic-ARCH' is also permissible, and is equivalent to
!      '-march=ARCH -mtune=generic-ARCH'.  See '-mtune' for more
       information.
  
!      '-mcpu=native' causes the compiler to auto-detect the CPU of the
       build computer.  At present, this feature is only supported on
       GNU/Linux, and not all architectures are recognized.  If the
       auto-detect is unsuccessful the option has no effect.
  
! '-mfpu=NAME'
!      This specifies what floating-point hardware (or hardware emulation)
!      is available on the target.  Permissible names are: 'vfp', 'vfpv3',
!      'vfpv3-fp16', 'vfpv3-d16', 'vfpv3-d16-fp16', 'vfpv3xd',
!      'vfpv3xd-fp16', 'neon', 'neon-fp16', 'vfpv4', 'vfpv4-d16',
!      'fpv4-sp-d16', 'neon-vfpv4', 'fpv5-d16', 'fpv5-sp-d16', 'fp-armv8',
!      'neon-fp-armv8', and 'crypto-neon-fp-armv8'.
  
!      If '-msoft-float' is specified this specifies the format of
       floating-point values.
  
       If the selected floating-point hardware includes the NEON extension
!      (e.g.  '-mfpu'='neon'), note that floating-point operations are not
       generated by GCC's auto-vectorization pass unless
!      '-funsafe-math-optimizations' is also specified.  This is because
       NEON hardware does not fully implement the IEEE 754 standard for
       floating-point arithmetic (in particular denormal values are
       treated as zero), so the use of NEON instructions may lead to a
       loss of precision.
  
! '-mfp16-format=NAME'
!      Specify the format of the '__fp16' half-precision floating-point
!      type.  Permissible names are 'none', 'ieee', and 'alternative'; the
!      default is 'none', in which case the '__fp16' type is not defined.
!      *Note Half-Precision::, for more information.
  
! '-mstructure-size-boundary=N'
       The sizes of all structures and unions are rounded up to a multiple
       of the number of bits set by this option.  Permissible values are
       8, 32 and 64.  The default value varies for different toolchains.
!      For the COFF targeted toolchain the default value is 8.  A value of
!      64 is only allowed if the underlying ABI supports it.
  
!      Specifying a larger number can produce faster, more efficient code,
!      but can also increase the size of the program.  Different values
!      are potentially incompatible.  Code compiled with one value cannot
!      necessarily expect to work with code or libraries compiled with
!      another value, if they exchange information using structures or
!      unions.
  
! '-mabort-on-noreturn'
!      Generate a call to the function 'abort' at the end of a 'noreturn'
       function.  It is executed if the function tries to return.
  
! '-mlong-calls'
! '-mno-long-calls'
       Tells the compiler to perform function calls by first loading the
       address of the function into a register and then performing a
       subroutine call on this register.  This switch is needed if the
!      target function lies outside of the 64-megabyte addressing range of
!      the offset-based version of subroutine call instruction.
  
       Even if this switch is enabled, not all function calls are turned
       into long calls.  The heuristic is that static functions, functions
!      that have the 'short_call' attribute, functions that are inside the
!      scope of a '#pragma no_long_calls' directive, and functions whose
!      definitions have already been compiled within the current
!      compilation unit are not turned into long calls.  The exceptions to
!      this rule are that weak function definitions, functions with the
!      'long_call' attribute or the 'section' attribute, and functions
!      that are within the scope of a '#pragma long_calls' directive are
!      always turned into long calls.
  
       This feature is not enabled by default.  Specifying
!      '-mno-long-calls' restores the default behavior, as does placing
!      the function calls within the scope of a '#pragma long_calls_off'
       directive.  Note these switches have no effect on how the compiler
       generates code to handle function calls via function pointers.
  
! '-msingle-pic-base'
       Treat the register used for PIC addressing as read-only, rather
       than loading it in the prologue for each function.  The runtime
       system is responsible for initializing this register with an
       appropriate value before execution begins.
  
! '-mpic-register=REG'
       Specify the register to be used for PIC addressing.  For standard
       PIC base case, the default is any suitable register determined by
!      compiler.  For single PIC base case, the default is 'R9' if target
       is EABI based or stack-checking is enabled, otherwise the default
!      is 'R10'.
  
! '-mpic-data-is-text-relative'
!      Assume that each data segments are relative to text segment at load
!      time.  Therefore, it permits addressing data using PC-relative
!      operations.  This option is on by default for targets other than
!      VxWorks RTP.
  
! '-mpoke-function-name'
       Write the name of each function into the text section, directly
       preceding the function prologue.  The generated code is similar to
       this:
*************** These `-m' options are defined for the A
*** 12886,12963 ****
                     sub     fp, ip, #4
  
       When performing a stack backtrace, code can inspect the value of
!      `pc' stored at `fp + 0'.  If the trace function then looks at
!      location `pc - 12' and the top 8 bits are set, then we know that
       there is a function name embedded immediately preceding this
!      location and has length `((pc[-3]) & 0xff000000)'.
  
- `-mthumb'
- `-marm'
       Select between generating code that executes in ARM and Thumb
       states.  The default for most configurations is to generate code
       that executes in ARM state, but the default can be changed by
!      configuring GCC with the `--with-mode='STATE configure option.
  
! `-mtpcs-frame'
       Generate a stack frame that is compliant with the Thumb Procedure
       Call Standard for all non-leaf functions.  (A leaf function is one
       that does not call any other functions.)  The default is
!      `-mno-tpcs-frame'.
  
! `-mtpcs-leaf-frame'
       Generate a stack frame that is compliant with the Thumb Procedure
!      Call Standard for all leaf functions.  (A leaf function is one
!      that does not call any other functions.)  The default is
!      `-mno-apcs-leaf-frame'.
  
! `-mcallee-super-interworking'
       Gives all externally visible functions in the file being compiled
       an ARM instruction set header which switches to Thumb mode before
!      executing the rest of the function.  This allows these functions
!      to be called from non-interworking code.  This option is not valid
!      in AAPCS configurations because interworking is enabled by default.
  
! `-mcaller-super-interworking'
       Allows calls via function pointers (including virtual functions) to
       execute correctly regardless of whether the target code has been
!      compiled for interworking or not.  There is a small overhead in
!      the cost of executing a function pointer if this option is
!      enabled.  This option is not valid in AAPCS configurations because
       interworking is enabled by default.
  
! `-mtp=NAME'
!      Specify the access model for the thread local storage pointer.
!      The valid models are `soft', which generates calls to
!      `__aeabi_read_tp', `cp15', which fetches the thread pointer from
!      `cp15' directly (supported in the arm6k architecture), and `auto',
       which uses the best available method for the selected processor.
!      The default setting is `auto'.
  
! `-mtls-dialect=DIALECT'
       Specify the dialect to use for accessing thread local storage.  Two
!      DIALECTs are supported--`gnu' and `gnu2'.  The `gnu' dialect
       selects the original GNU scheme for supporting local and global
!      dynamic TLS models.  The `gnu2' dialect selects the GNU descriptor
       scheme, which provides better performance for shared libraries.
       The GNU descriptor scheme is compatible with the original scheme,
       but does require new assembler, linker and library support.
!      Initial and local exec TLS models are unaffected by this option
!      and always use the original scheme.
  
! `-mword-relocations'
       Only generate absolute relocations on word-sized values (i.e.
       R_ARM_ABS32).  This is enabled by default on targets (uClinux,
       SymbianOS) where the runtime loader imposes this restriction, and
!      when `-fpic' or `-fPIC' is specified.
  
! `-mfix-cortex-m3-ldrd'
!      Some Cortex-M3 cores can cause data corruption when `ldrd'
       instructions with overlapping destination and base registers are
       used.  This option avoids generating these instructions.  This
!      option is enabled by default when `-mcpu=cortex-m3' is specified.
  
! `-munaligned-access'
! `-mno-unaligned-access'
       Enables (or disables) reading and writing of 16- and 32- bit values
       from addresses that are not 16- or 32- bit aligned.  By default
       unaligned access is disabled for all pre-ARMv6 and all ARMv6-M
--- 12800,12878 ----
                     sub     fp, ip, #4
  
       When performing a stack backtrace, code can inspect the value of
!      'pc' stored at 'fp + 0'.  If the trace function then looks at
!      location 'pc - 12' and the top 8 bits are set, then we know that
       there is a function name embedded immediately preceding this
!      location and has length '((pc[-3]) & 0xff000000)'.
! 
! '-mthumb'
! '-marm'
  
       Select between generating code that executes in ARM and Thumb
       states.  The default for most configurations is to generate code
       that executes in ARM state, but the default can be changed by
!      configuring GCC with the '--with-mode='STATE configure option.
  
! '-mtpcs-frame'
       Generate a stack frame that is compliant with the Thumb Procedure
       Call Standard for all non-leaf functions.  (A leaf function is one
       that does not call any other functions.)  The default is
!      '-mno-tpcs-frame'.
  
! '-mtpcs-leaf-frame'
       Generate a stack frame that is compliant with the Thumb Procedure
!      Call Standard for all leaf functions.  (A leaf function is one that
!      does not call any other functions.)  The default is
!      '-mno-apcs-leaf-frame'.
  
! '-mcallee-super-interworking'
       Gives all externally visible functions in the file being compiled
       an ARM instruction set header which switches to Thumb mode before
!      executing the rest of the function.  This allows these functions to
!      be called from non-interworking code.  This option is not valid in
!      AAPCS configurations because interworking is enabled by default.
  
! '-mcaller-super-interworking'
       Allows calls via function pointers (including virtual functions) to
       execute correctly regardless of whether the target code has been
!      compiled for interworking or not.  There is a small overhead in the
!      cost of executing a function pointer if this option is enabled.
!      This option is not valid in AAPCS configurations because
       interworking is enabled by default.
  
! '-mtp=NAME'
!      Specify the access model for the thread local storage pointer.  The
!      valid models are 'soft', which generates calls to
!      '__aeabi_read_tp', 'cp15', which fetches the thread pointer from
!      'cp15' directly (supported in the arm6k architecture), and 'auto',
       which uses the best available method for the selected processor.
!      The default setting is 'auto'.
  
! '-mtls-dialect=DIALECT'
       Specify the dialect to use for accessing thread local storage.  Two
!      DIALECTs are supported--'gnu' and 'gnu2'.  The 'gnu' dialect
       selects the original GNU scheme for supporting local and global
!      dynamic TLS models.  The 'gnu2' dialect selects the GNU descriptor
       scheme, which provides better performance for shared libraries.
       The GNU descriptor scheme is compatible with the original scheme,
       but does require new assembler, linker and library support.
!      Initial and local exec TLS models are unaffected by this option and
!      always use the original scheme.
  
! '-mword-relocations'
       Only generate absolute relocations on word-sized values (i.e.
       R_ARM_ABS32).  This is enabled by default on targets (uClinux,
       SymbianOS) where the runtime loader imposes this restriction, and
!      when '-fpic' or '-fPIC' is specified.
  
! '-mfix-cortex-m3-ldrd'
!      Some Cortex-M3 cores can cause data corruption when 'ldrd'
       instructions with overlapping destination and base registers are
       used.  This option avoids generating these instructions.  This
!      option is enabled by default when '-mcpu=cortex-m3' is specified.
  
! '-munaligned-access'
! '-mno-unaligned-access'
       Enables (or disables) reading and writing of 16- and 32- bit values
       from addresses that are not 16- or 32- bit aligned.  By default
       unaligned access is disabled for all pre-ARMv6 and all ARMv6-M
*************** These `-m' options are defined for the A
*** 12965,13000 ****
       unaligned access is not enabled then words in packed data
       structures are accessed a byte at a time.
  
!      The ARM attribute `Tag_CPU_unaligned_access' is set in the
       generated object file to either true or false, depending upon the
       setting of this option.  If unaligned access is enabled then the
!      preprocessor symbol `__ARM_FEATURE_UNALIGNED' is also defined.
  
! `-mneon-for-64bits'
!      Enables using Neon to handle scalar 64-bits operations. This is
       disabled by default since the cost of moving data from core
       registers to Neon is high.
  
! `-mslow-flash-data'
       Assume loading data from flash is slower than fetching instruction.
       Therefore literal load is minimized for better performance.  This
!      option is only supported when compiling for ARMv7 M-profile and
!      off by default.
  
! `-masm-syntax-unified'
       Assume inline assembler is using unified asm syntax.  The default
       is currently off which implies divided syntax.  Currently this
       option is available only for Thumb1 and has no effect on ARM state
       and Thumb2.  However, this may change in future releases of GCC.
       Divided syntax should be considered deprecated.
  
! `-mrestrict-it'
       Restricts generation of IT blocks to conform to the rules of ARMv8.
       IT blocks can only contain a single 16-bit instruction from a
!      select set of instructions. This option is on by default for ARMv8
       Thumb mode.
  
! `-mprint-tune-info'
       Print CPU tuning information as comment in assembler file.  This is
       an option used only for regression testing of the compiler and not
       intended for ordinary use in compiling code.  This option is
--- 12880,12915 ----
       unaligned access is not enabled then words in packed data
       structures are accessed a byte at a time.
  
!      The ARM attribute 'Tag_CPU_unaligned_access' is set in the
       generated object file to either true or false, depending upon the
       setting of this option.  If unaligned access is enabled then the
!      preprocessor symbol '__ARM_FEATURE_UNALIGNED' is also defined.
  
! '-mneon-for-64bits'
!      Enables using Neon to handle scalar 64-bits operations.  This is
       disabled by default since the cost of moving data from core
       registers to Neon is high.
  
! '-mslow-flash-data'
       Assume loading data from flash is slower than fetching instruction.
       Therefore literal load is minimized for better performance.  This
!      option is only supported when compiling for ARMv7 M-profile and off
!      by default.
  
! '-masm-syntax-unified'
       Assume inline assembler is using unified asm syntax.  The default
       is currently off which implies divided syntax.  Currently this
       option is available only for Thumb1 and has no effect on ARM state
       and Thumb2.  However, this may change in future releases of GCC.
       Divided syntax should be considered deprecated.
  
! '-mrestrict-it'
       Restricts generation of IT blocks to conform to the rules of ARMv8.
       IT blocks can only contain a single 16-bit instruction from a
!      select set of instructions.  This option is on by default for ARMv8
       Thumb mode.
  
! '-mprint-tune-info'
       Print CPU tuning information as comment in assembler file.  This is
       an option used only for regression testing of the compiler and not
       intended for ordinary use in compiling code.  This option is
*************** File: gcc.info,  Node: AVR Options,  Nex
*** 13008,13152 ****
  
  These options are defined for AVR implementations:
  
! `-mmcu=MCU'
       Specify Atmel AVR instruction set architectures (ISA) or MCU type.
  
!      The default for this option is `avr2'.
  
       GCC supports the following AVR devices and ISAs:
  
!     `avr2'
            "Classic" devices with up to 8 KiB of program memory.
!           MCU = `attiny22', `attiny26', `at90c8534', `at90s2313',
!           `at90s2323', `at90s2333', `at90s2343', `at90s4414',
!           `at90s4433', `at90s4434', `at90s8515', `at90s8535'.
  
!     `avr25'
            "Classic" devices with up to 8 KiB of program memory and with
!           the `MOVW' instruction.
!           MCU = `ata5272', `ata6616c', `attiny13', `attiny13a',
!           `attiny2313', `attiny2313a', `attiny24', `attiny24a',
!           `attiny25', `attiny261', `attiny261a', `attiny43u',
!           `attiny4313', `attiny44', `attiny44a', `attiny441',
!           `attiny45', `attiny461', `attiny461a', `attiny48',
!           `attiny828', `attiny84', `attiny84a', `attiny841',
!           `attiny85', `attiny861', `attiny861a', `attiny87',
!           `attiny88', `at86rf401'.
  
!     `avr3'
!           "Classic" devices with 16 KiB up to 64 KiB of  program memory.
!           MCU = `at43usb355', `at76c711'.
  
!     `avr31'
            "Classic" devices with 128 KiB of program memory.
!           MCU = `atmega103', `at43usb320'.
  
!     `avr35'
            "Classic" devices with 16 KiB up to 64 KiB of program memory
!           and with the `MOVW' instruction.
!           MCU = `ata5505', `ata6617c', `ata664251', `atmega16u2',
!           `atmega32u2', `atmega8u2', `attiny1634', `attiny167',
!           `at90usb162', `at90usb82'.
  
!     `avr4'
            "Enhanced" devices with up to 8 KiB of program memory.
!           MCU = `ata6285', `ata6286', `ata6289', `ata6612c',
!           `atmega48', `atmega48a', `atmega48p', `atmega48pa',
!           `atmega8', `atmega8a', `atmega8hva', `atmega8515',
!           `atmega8535', `atmega88', `atmega88a', `atmega88p',
!           `atmega88pa', `at90pwm1', `at90pwm2', `at90pwm2b',
!           `at90pwm3', `at90pwm3b', `at90pwm81'.
  
!     `avr5'
            "Enhanced" devices with 16 KiB up to 64 KiB of program memory.
-           MCU = `ata5702m322', `ata5782', `ata5790', `ata5790n',
-           `ata5795', `ata5831', `ata6613c', `ata6614q', `atmega16',
-           `atmega16a', `atmega16hva', `atmega16hva2', `atmega16hvb',
-           `atmega16hvbrevb', `atmega16m1', `atmega16u4', `atmega161',
-           `atmega162', `atmega163', `atmega164a', `atmega164p',
-           `atmega164pa', `atmega165', `atmega165a', `atmega165p',
-           `atmega165pa', `atmega168', `atmega168a', `atmega168p',
-           `atmega168pa', `atmega169', `atmega169a', `atmega169p',
-           `atmega169pa', `atmega32', `atmega32a', `atmega32c1',
-           `atmega32hvb', `atmega32hvbrevb', `atmega32m1', `atmega32u4',
-           `atmega32u6', `atmega323', `atmega324a', `atmega324p',
-           `atmega324pa', `atmega325', `atmega325a', `atmega325p',
-           `atmega325pa', `atmega3250', `atmega3250a', `atmega3250p',
-           `atmega3250pa', `atmega328', `atmega328p', `atmega329',
-           `atmega329a', `atmega329p', `atmega329pa', `atmega3290',
-           `atmega3290a', `atmega3290p', `atmega3290pa', `atmega406',
-           `atmega64', `atmega64a', `atmega64c1', `atmega64hve',
-           `atmega64hve2', `atmega64m1', `atmega64rfr2', `atmega640',
-           `atmega644', `atmega644a', `atmega644p', `atmega644pa',
-           `atmega644rfr2', `atmega645', `atmega645a', `atmega645p',
-           `atmega6450', `atmega6450a', `atmega6450p', `atmega649',
-           `atmega649a', `atmega649p', `atmega6490', `atmega6490a',
-           `atmega6490p', `at90can32', `at90can64', `at90pwm161',
-           `at90pwm216', `at90pwm316', `at90scr100', `at90usb646',
-           `at90usb647', `at94k', `m3000'.
  
!     `avr51'
            "Enhanced" devices with 128 KiB of program memory.
!           MCU = `atmega128', `atmega128a', `atmega128rfa1',
!           `atmega128rfr2', `atmega1280', `atmega1281', `atmega1284',
!           `atmega1284p', `atmega1284rfr2', `at90can128', `at90usb1286',
!           `at90usb1287'.
  
!     `avr6'
!           "Enhanced" devices with 3-byte PC, i.e. with more than
!           128 KiB of program memory.
!           MCU = `atmega256rfr2', `atmega2560', `atmega2561',
!           `atmega2564rfr2'.
  
!     `avrxmega2'
            "XMEGA" devices with more than 8 KiB and up to 64 KiB of
            program memory.
!           MCU = `atxmega16a4', `atxmega16a4u', `atxmega16c4',
!           `atxmega16d4', `atxmega16e5', `atxmega32a4', `atxmega32a4u',
!           `atxmega32c3', `atxmega32c4', `atxmega32d3', `atxmega32d4',
!           `atxmega32e5', `atxmega8e5'.
  
!     `avrxmega4'
            "XMEGA" devices with more than 64 KiB and up to 128 KiB of
            program memory.
!           MCU = `atxmega64a3', `atxmega64a3u', `atxmega64a4u',
!           `atxmega64b1', `atxmega64b3', `atxmega64c3', `atxmega64d3',
!           `atxmega64d4'.
  
!     `avrxmega5'
            "XMEGA" devices with more than 64 KiB and up to 128 KiB of
            program memory and more than 64 KiB of RAM.
!           MCU = `atxmega64a1', `atxmega64a1u'.
  
!     `avrxmega6'
            "XMEGA" devices with more than 128 KiB of program memory.
!           MCU = `atxmega128a3', `atxmega128a3u', `atxmega128b1',
!           `atxmega128b3', `atxmega128c3', `atxmega128d3',
!           `atxmega128d4', `atxmega192a3', `atxmega192a3u',
!           `atxmega192c3', `atxmega192d3', `atxmega256a3',
!           `atxmega256a3b', `atxmega256a3bu', `atxmega256a3u',
!           `atxmega256c3', `atxmega256d3', `atxmega384c3',
!           `atxmega384d3'.
  
!     `avrxmega7'
            "XMEGA" devices with more than 128 KiB of program memory and
            more than 64 KiB of RAM.
!           MCU = `atxmega128a1', `atxmega128a1u', `atxmega128a4u'.
  
!     `avrtiny'
            "TINY" Tiny core devices with 512 B up to 4 KiB of program
            memory.
!           MCU = `attiny10', `attiny20', `attiny4', `attiny40',
!           `attiny5', `attiny9'.
  
!     `avr1'
            This ISA is implemented by the minimal AVR core and supported
            for assembler only.
!           MCU = `attiny11', `attiny12', `attiny15', `attiny28',
!           `at90s1200'.
! 
  
! `-maccumulate-args'
       Accumulate outgoing function arguments and acquire/release the
       needed stack space for outgoing function arguments once in function
       prologue/epilogue.  Without this option, outgoing arguments are
--- 12923,13066 ----
  
  These options are defined for AVR implementations:
  
! '-mmcu=MCU'
       Specify Atmel AVR instruction set architectures (ISA) or MCU type.
  
!      The default for this option is 'avr2'.
  
       GCC supports the following AVR devices and ISAs:
  
!      'avr2'
            "Classic" devices with up to 8 KiB of program memory.
!           MCU = 'attiny22', 'attiny26', 'at90c8534', 'at90s2313',
!           'at90s2323', 'at90s2333', 'at90s2343', 'at90s4414',
!           'at90s4433', 'at90s4434', 'at90s8515', 'at90s8535'.
  
!      'avr25'
            "Classic" devices with up to 8 KiB of program memory and with
!           the 'MOVW' instruction.
!           MCU = 'ata5272', 'ata6616c', 'attiny13', 'attiny13a',
!           'attiny2313', 'attiny2313a', 'attiny24', 'attiny24a',
!           'attiny25', 'attiny261', 'attiny261a', 'attiny43u',
!           'attiny4313', 'attiny44', 'attiny44a', 'attiny441',
!           'attiny45', 'attiny461', 'attiny461a', 'attiny48',
!           'attiny828', 'attiny84', 'attiny84a', 'attiny841', 'attiny85',
!           'attiny861', 'attiny861a', 'attiny87', 'attiny88',
!           'at86rf401'.
  
!      'avr3'
!           "Classic" devices with 16 KiB up to 64 KiB of program memory.
!           MCU = 'at43usb355', 'at76c711'.
  
!      'avr31'
            "Classic" devices with 128 KiB of program memory.
!           MCU = 'atmega103', 'at43usb320'.
  
!      'avr35'
            "Classic" devices with 16 KiB up to 64 KiB of program memory
!           and with the 'MOVW' instruction.
!           MCU = 'ata5505', 'ata6617c', 'ata664251', 'atmega16u2',
!           'atmega32u2', 'atmega8u2', 'attiny1634', 'attiny167',
!           'at90usb162', 'at90usb82'.
  
!      'avr4'
            "Enhanced" devices with up to 8 KiB of program memory.
!           MCU = 'ata6285', 'ata6286', 'ata6289', 'ata6612c', 'atmega48',
!           'atmega48a', 'atmega48p', 'atmega48pa', 'atmega8', 'atmega8a',
!           'atmega8hva', 'atmega8515', 'atmega8535', 'atmega88',
!           'atmega88a', 'atmega88p', 'atmega88pa', 'at90pwm1',
!           'at90pwm2', 'at90pwm2b', 'at90pwm3', 'at90pwm3b', 'at90pwm81'.
  
!      'avr5'
            "Enhanced" devices with 16 KiB up to 64 KiB of program memory.
  
!           MCU = 'ata5702m322', 'ata5782', 'ata5790', 'ata5790n',
!           'ata5795', 'ata5831', 'ata6613c', 'ata6614q', 'atmega16',
!           'atmega16a', 'atmega16hva', 'atmega16hva2', 'atmega16hvb',
!           'atmega16hvbrevb', 'atmega16m1', 'atmega16u4', 'atmega161',
!           'atmega162', 'atmega163', 'atmega164a', 'atmega164p',
!           'atmega164pa', 'atmega165', 'atmega165a', 'atmega165p',
!           'atmega165pa', 'atmega168', 'atmega168a', 'atmega168p',
!           'atmega168pa', 'atmega169', 'atmega169a', 'atmega169p',
!           'atmega169pa', 'atmega32', 'atmega32a', 'atmega32c1',
!           'atmega32hvb', 'atmega32hvbrevb', 'atmega32m1', 'atmega32u4',
!           'atmega32u6', 'atmega323', 'atmega324a', 'atmega324p',
!           'atmega324pa', 'atmega325', 'atmega325a', 'atmega325p',
!           'atmega325pa', 'atmega3250', 'atmega3250a', 'atmega3250p',
!           'atmega3250pa', 'atmega328', 'atmega328p', 'atmega329',
!           'atmega329a', 'atmega329p', 'atmega329pa', 'atmega3290',
!           'atmega3290a', 'atmega3290p', 'atmega3290pa', 'atmega406',
!           'atmega64', 'atmega64a', 'atmega64c1', 'atmega64hve',
!           'atmega64hve2', 'atmega64m1', 'atmega64rfr2', 'atmega640',
!           'atmega644', 'atmega644a', 'atmega644p', 'atmega644pa',
!           'atmega644rfr2', 'atmega645', 'atmega645a', 'atmega645p',
!           'atmega6450', 'atmega6450a', 'atmega6450p', 'atmega649',
!           'atmega649a', 'atmega649p', 'atmega6490', 'atmega6490a',
!           'atmega6490p', 'at90can32', 'at90can64', 'at90pwm161',
!           'at90pwm216', 'at90pwm316', 'at90scr100', 'at90usb646',
!           'at90usb647', 'at94k', 'm3000'.
! 
!      'avr51'
            "Enhanced" devices with 128 KiB of program memory.
!           MCU = 'atmega128', 'atmega128a', 'atmega128rfa1',
!           'atmega128rfr2', 'atmega1280', 'atmega1281', 'atmega1284',
!           'atmega1284p', 'atmega1284rfr2', 'at90can128', 'at90usb1286',
!           'at90usb1287'.
  
!      'avr6'
!           "Enhanced" devices with 3-byte PC, i.e. with more than 128 KiB
!           of program memory.
!           MCU = 'atmega256rfr2', 'atmega2560', 'atmega2561',
!           'atmega2564rfr2'.
  
!      'avrxmega2'
            "XMEGA" devices with more than 8 KiB and up to 64 KiB of
            program memory.
!           MCU = 'atxmega16a4', 'atxmega16a4u', 'atxmega16c4',
!           'atxmega16d4', 'atxmega16e5', 'atxmega32a4', 'atxmega32a4u',
!           'atxmega32c3', 'atxmega32c4', 'atxmega32d3', 'atxmega32d4',
!           'atxmega32e5', 'atxmega8e5'.
  
!      'avrxmega4'
            "XMEGA" devices with more than 64 KiB and up to 128 KiB of
            program memory.
!           MCU = 'atxmega64a3', 'atxmega64a3u', 'atxmega64a4u',
!           'atxmega64b1', 'atxmega64b3', 'atxmega64c3', 'atxmega64d3',
!           'atxmega64d4'.
  
!      'avrxmega5'
            "XMEGA" devices with more than 64 KiB and up to 128 KiB of
            program memory and more than 64 KiB of RAM.
!           MCU = 'atxmega64a1', 'atxmega64a1u'.
  
!      'avrxmega6'
            "XMEGA" devices with more than 128 KiB of program memory.
!           MCU = 'atxmega128a3', 'atxmega128a3u', 'atxmega128b1',
!           'atxmega128b3', 'atxmega128c3', 'atxmega128d3',
!           'atxmega128d4', 'atxmega192a3', 'atxmega192a3u',
!           'atxmega192c3', 'atxmega192d3', 'atxmega256a3',
!           'atxmega256a3b', 'atxmega256a3bu', 'atxmega256a3u',
!           'atxmega256c3', 'atxmega256d3', 'atxmega384c3',
!           'atxmega384d3'.
  
!      'avrxmega7'
            "XMEGA" devices with more than 128 KiB of program memory and
            more than 64 KiB of RAM.
!           MCU = 'atxmega128a1', 'atxmega128a1u', 'atxmega128a4u'.
  
!      'avrtiny'
            "TINY" Tiny core devices with 512 B up to 4 KiB of program
            memory.
!           MCU = 'attiny10', 'attiny20', 'attiny4', 'attiny40',
!           'attiny5', 'attiny9'.
  
!      'avr1'
            This ISA is implemented by the minimal AVR core and supported
            for assembler only.
!           MCU = 'attiny11', 'attiny12', 'attiny15', 'attiny28',
!           'at90s1200'.
  
! '-maccumulate-args'
       Accumulate outgoing function arguments and acquire/release the
       needed stack space for outgoing function arguments once in function
       prologue/epilogue.  Without this option, outgoing arguments are
*************** These options are defined for AVR implem
*** 13154,13245 ****
  
       Popping the arguments after the function call can be expensive on
       AVR so that accumulating the stack space might lead to smaller
!      executables because arguments need not to be removed from the
!      stack after such a function call.
  
       This option can lead to reduced code size for functions that
       perform several calls to functions that get their arguments on the
       stack like calls to printf-like functions.
  
! `-mbranch-cost=COST'
       Set the branch costs for conditional branch instructions to COST.
!      Reasonable values for COST are small, non-negative integers. The
       default branch cost is 0.
  
! `-mcall-prologues'
       Functions prologues/epilogues are expanded as calls to appropriate
       subroutines.  Code size is smaller.
  
! `-mint8'
!      Assume `int' to be 8-bit integer.  This affects the sizes of all
!      types: a `char' is 1 byte, an `int' is 1 byte, a `long' is 2 bytes,
!      and `long long' is 4 bytes.  Please note that this option does not
       conform to the C standards, but it results in smaller code size.
  
! `-mn-flash=NUM'
       Assume that the flash memory has a size of NUM times 64 KiB.
  
! `-mno-interrupts'
       Generated code is not compatible with hardware interrupts.  Code
       size is smaller.
  
! `-mrelax'
!      Try to replace `CALL' resp. `JMP' instruction by the shorter
!      `RCALL' resp. `RJMP' instruction if applicable.  Setting `-mrelax'
!      just adds the `--mlink-relax' option to the assembler's command
!      line and the `--relax' option to the linker's command line.
  
       Jump relaxing is performed by the linker because jump offsets are
!      not known before code is located. Therefore, the assembler code
       generated by the compiler is the same, but the instructions in the
       executable may differ from instructions in the assembler code.
  
       Relaxing must be turned on if linker stubs are needed, see the
!      section on `EIND' and linker stubs below.
  
! `-mrmw'
       Assume that the device supports the Read-Modify-Write instructions
!      `XCH', `LAC', `LAS' and `LAT'.
  
! `-msp8'
       Treat the stack pointer register as an 8-bit register, i.e. assume
       the high byte of the stack pointer is zero.  In general, you don't
       need to set this option by hand.
  
       This option is used internally by the compiler to select and build
!      multilibs for architectures `avr2' and `avr25'.  These
!      architectures mix devices with and without `SPH'.  For any setting
!      other than `-mmcu=avr2' or `-mmcu=avr25' the compiler driver adds
       or removes this option from the compiler proper's command line,
       because the compiler then knows if the device or architecture has
!      an 8-bit stack pointer and thus no `SPH' register or not.
  
! `-mstrict-X'
!      Use address register `X' in a way proposed by the hardware.  This
!      means that `X' is only used in indirect, post-increment or
       pre-decrement addressing.
  
!      Without this option, the `X' register may be used in the same way
!      as `Y' or `Z' which then is emulated by additional instructions.
!      For example, loading a value with `X+const' addressing with a
!      small non-negative `const < 64' to a register RN is performed as
  
            adiw r26, const   ; X += const
            ld   RN, X        ; RN = *X
            sbiw r26, const   ; X -= const
  
! `-mtiny-stack'
       Only change the lower 8 bits of the stack pointer.
  
! `-nodevicelib'
!      Don't link against AVR-LibC's device specific library `libdev.a'.
  
! `-Waddr-space-convert'
       Warn about conversions between address spaces in the case where the
       resulting address space is not contained in the incoming address
       space.
  
! 3.17.5.1 `EIND' and Devices with More Than 128 Ki Bytes of Flash
  ................................................................
  
  Pointers in the implementation are 16 bits wide.  The address of a
--- 13068,13163 ----
  
       Popping the arguments after the function call can be expensive on
       AVR so that accumulating the stack space might lead to smaller
!      executables because arguments need not to be removed from the stack
!      after such a function call.
  
       This option can lead to reduced code size for functions that
       perform several calls to functions that get their arguments on the
       stack like calls to printf-like functions.
  
! '-mbranch-cost=COST'
       Set the branch costs for conditional branch instructions to COST.
!      Reasonable values for COST are small, non-negative integers.  The
       default branch cost is 0.
  
! '-mcall-prologues'
       Functions prologues/epilogues are expanded as calls to appropriate
       subroutines.  Code size is smaller.
  
! '-mint8'
!      Assume 'int' to be 8-bit integer.  This affects the sizes of all
!      types: a 'char' is 1 byte, an 'int' is 1 byte, a 'long' is 2 bytes,
!      and 'long long' is 4 bytes.  Please note that this option does not
       conform to the C standards, but it results in smaller code size.
  
! '-mn-flash=NUM'
       Assume that the flash memory has a size of NUM times 64 KiB.
  
! '-mno-interrupts'
       Generated code is not compatible with hardware interrupts.  Code
       size is smaller.
  
! '-mrelax'
!      Try to replace 'CALL' resp. 'JMP' instruction by the shorter
!      'RCALL' resp. 'RJMP' instruction if applicable.  Setting '-mrelax'
!      just adds the '--mlink-relax' option to the assembler's command
!      line and the '--relax' option to the linker's command line.
  
       Jump relaxing is performed by the linker because jump offsets are
!      not known before code is located.  Therefore, the assembler code
       generated by the compiler is the same, but the instructions in the
       executable may differ from instructions in the assembler code.
  
       Relaxing must be turned on if linker stubs are needed, see the
!      section on 'EIND' and linker stubs below.
  
! '-mrmw'
       Assume that the device supports the Read-Modify-Write instructions
!      'XCH', 'LAC', 'LAS' and 'LAT'.
  
! '-msp8'
       Treat the stack pointer register as an 8-bit register, i.e. assume
       the high byte of the stack pointer is zero.  In general, you don't
       need to set this option by hand.
  
       This option is used internally by the compiler to select and build
!      multilibs for architectures 'avr2' and 'avr25'.  These
!      architectures mix devices with and without 'SPH'.  For any setting
!      other than '-mmcu=avr2' or '-mmcu=avr25' the compiler driver adds
       or removes this option from the compiler proper's command line,
       because the compiler then knows if the device or architecture has
!      an 8-bit stack pointer and thus no 'SPH' register or not.
  
! '-mstrict-X'
!      Use address register 'X' in a way proposed by the hardware.  This
!      means that 'X' is only used in indirect, post-increment or
       pre-decrement addressing.
  
!      Without this option, the 'X' register may be used in the same way
!      as 'Y' or 'Z' which then is emulated by additional instructions.
!      For example, loading a value with 'X+const' addressing with a small
!      non-negative 'const < 64' to a register RN is performed as
  
            adiw r26, const   ; X += const
            ld   RN, X        ; RN = *X
            sbiw r26, const   ; X -= const
  
! '-mtiny-stack'
       Only change the lower 8 bits of the stack pointer.
  
! '-nodevicelib'
!      Don't link against AVR-LibC's device specific library 'lib<mcu>.a'.
  
! '-Waddr-space-convert'
       Warn about conversions between address spaces in the case where the
       resulting address space is not contained in the incoming address
       space.
  
! '-Wmisspelled-isr'
!      Warn if the ISR is misspelled, i.e.  without '__vector' prefix.
!      Enabled by default.
! 
! 3.17.5.1 'EIND' and Devices with More Than 128 Ki Bytes of Flash
  ................................................................
  
  Pointers in the implementation are 16 bits wide.  The address of a
*************** and calls can target any code address in
*** 13248,13297 ****
  
   In order to facilitate indirect jump on devices with more than 128 Ki
  bytes of program memory space, there is a special function register
! called `EIND' that serves as most significant part of the target address
! when `EICALL' or `EIJMP' instructions are used.
  
!  Indirect jumps and calls on these devices are handled as follows by
! the compiler and are subject to some limitations:
  
!    * The compiler never sets `EIND'.
  
!    * The compiler uses `EIND' implicitely in `EICALL'/`EIJMP'
!      instructions or might read `EIND' directly in order to emulate an
!      indirect call/jump by means of a `RET' instruction.
  
!    * The compiler assumes that `EIND' never changes during the startup
!      code or during the application. In particular, `EIND' is not
       saved/restored in function or interrupt service routine
       prologue/epilogue.
  
     * For indirect calls to functions and computed goto, the linker
!      generates _stubs_. Stubs are jump pads sometimes also called
!      _trampolines_. Thus, the indirect call/jump jumps to such a stub.
       The stub contains a direct jump to the desired address.
  
     * Linker relaxation must be turned on so that the linker generates
!      the stubs correctly in all situations. See the compiler option
!      `-mrelax' and the linker option `--relax'.  There are corner cases
       where the linker is supposed to generate stubs but aborts without
       relaxation and without a helpful error message.
  
!    * The default linker script is arranged for code with `EIND = 0'.
!      If code is supposed to work for a setup with `EIND != 0', a custom
       linker script has to be used in order to place the sections whose
!      name start with `.trampolines' into the segment where `EIND'
!      points to.
  
!    * The startup code from libgcc never sets `EIND'.  Notice that
!      startup code is a blend of code from libgcc and AVR-LibC.  For the
!      impact of AVR-LibC on `EIND', see the
       AVR-LibC user manual (http://nongnu.org/avr-libc/user-manual/).
  
!    * It is legitimate for user-specific startup code to set up `EIND'
       early, for example by means of initialization code located in
!      section `.init3'. Such code runs prior to general startup code
       that initializes RAM and calls constructors, but after the bit of
!      startup code from AVR-LibC that sets `EIND' to the segment where
       the vector table is located.
            #include <avr/io.h>
  
--- 13166,13215 ----
  
   In order to facilitate indirect jump on devices with more than 128 Ki
  bytes of program memory space, there is a special function register
! called 'EIND' that serves as most significant part of the target address
! when 'EICALL' or 'EIJMP' instructions are used.
  
!  Indirect jumps and calls on these devices are handled as follows by the
! compiler and are subject to some limitations:
  
!    * The compiler never sets 'EIND'.
  
!    * The compiler uses 'EIND' implicitely in 'EICALL'/'EIJMP'
!      instructions or might read 'EIND' directly in order to emulate an
!      indirect call/jump by means of a 'RET' instruction.
  
!    * The compiler assumes that 'EIND' never changes during the startup
!      code or during the application.  In particular, 'EIND' is not
       saved/restored in function or interrupt service routine
       prologue/epilogue.
  
     * For indirect calls to functions and computed goto, the linker
!      generates _stubs_.  Stubs are jump pads sometimes also called
!      _trampolines_.  Thus, the indirect call/jump jumps to such a stub.
       The stub contains a direct jump to the desired address.
  
     * Linker relaxation must be turned on so that the linker generates
!      the stubs correctly in all situations.  See the compiler option
!      '-mrelax' and the linker option '--relax'.  There are corner cases
       where the linker is supposed to generate stubs but aborts without
       relaxation and without a helpful error message.
  
!    * The default linker script is arranged for code with 'EIND = 0'.  If
!      code is supposed to work for a setup with 'EIND != 0', a custom
       linker script has to be used in order to place the sections whose
!      name start with '.trampolines' into the segment where 'EIND' points
!      to.
  
!    * The startup code from libgcc never sets 'EIND'.  Notice that
!      startup code is a blend of code from libgcc and AVR-LibC. For the
!      impact of AVR-LibC on 'EIND', see the
       AVR-LibC user manual (http://nongnu.org/avr-libc/user-manual/).
  
!    * It is legitimate for user-specific startup code to set up 'EIND'
       early, for example by means of initialization code located in
!      section '.init3'.  Such code runs prior to general startup code
       that initializes RAM and calls constructors, but after the bit of
!      startup code from AVR-LibC that sets 'EIND' to the segment where
       the vector table is located.
            #include <avr/io.h>
  
*************** the compiler and are subject to some lim
*** 13303,13337 ****
                              "out %i0,r24" :: "n" (&EIND) : "r24","memory");
            }
  
!      The `__trampolines_start' symbol is defined in the linker script.
  
     * Stubs are generated automatically by the linker if the following
       two conditions are met:
!         - The address of a label is taken by means of the `gs' modifier
            (short for _generate stubs_) like so:
                 LDI r24, lo8(gs(FUNC))
                 LDI r25, hi8(gs(FUNC))
- 
          - The final location of that label is in a code segment
            _outside_ the segment where the stubs are located.
  
!    * The compiler emits such `gs' modifiers for code labels in the
       following situations:
          - Taking address of a function or code label.
- 
          - Computed goto.
! 
!         - If prologue-save function is used, see `-mcall-prologues'
            command-line option.
! 
!         - Switch/case dispatch tables. If you do not want such dispatch
!           tables you can specify the `-fno-jump-tables' command-line
            option.
- 
          - C and C++ constructors/destructors called during
            startup/shutdown.
! 
!         - If the tools hit a `gs()' modifier explained above.
  
     * Jumping to non-symbolic addresses like so is _not_ supported:
  
--- 13221,13250 ----
                              "out %i0,r24" :: "n" (&EIND) : "r24","memory");
            }
  
!      The '__trampolines_start' symbol is defined in the linker script.
  
     * Stubs are generated automatically by the linker if the following
       two conditions are met:
! 
!         - The address of a label is taken by means of the 'gs' modifier
            (short for _generate stubs_) like so:
                 LDI r24, lo8(gs(FUNC))
                 LDI r25, hi8(gs(FUNC))
          - The final location of that label is in a code segment
            _outside_ the segment where the stubs are located.
  
!    * The compiler emits such 'gs' modifiers for code labels in the
       following situations:
          - Taking address of a function or code label.
          - Computed goto.
!         - If prologue-save function is used, see '-mcall-prologues'
            command-line option.
!         - Switch/case dispatch tables.  If you do not want such dispatch
!           tables you can specify the '-fno-jump-tables' command-line
            option.
          - C and C++ constructors/destructors called during
            startup/shutdown.
!         - If the tools hit a 'gs()' modifier explained above.
  
     * Jumping to non-symbolic addresses like so is _not_ supported:
  
*************** the compiler and are subject to some lim
*** 13342,13348 ****
            }
  
       Instead, a stub has to be set up, i.e. the function has to be
!      called through a symbol (`func_4' in the example):
  
            int main (void)
            {
--- 13255,13261 ----
            }
  
       Instead, a stub has to be set up, i.e. the function has to be
!      called through a symbol ('func_4' in the example):
  
            int main (void)
            {
*************** the compiler and are subject to some lim
*** 13352,13391 ****
                return func_4();
            }
  
!      and the application be linked with `-Wl,--defsym,func_4=0x4'.
!      Alternatively, `func_4' can be defined in the linker script.
  
! 3.17.5.2 Handling of the `RAMPD', `RAMPX', `RAMPY' and `RAMPZ' Special Function Registers
  .........................................................................................
  
  Some AVR devices support memories larger than the 64 KiB range that can
  be accessed with 16-bit pointers.  To access memory locations outside
! this 64 KiB range, the contentent of a `RAMP' register is used as high
! part of the address: The `X', `Y', `Z' address register is concatenated
! with the `RAMPX', `RAMPY', `RAMPZ' special function register,
! respectively, to get a wide address. Similarly, `RAMPD' is used
  together with direct addressing.
  
!    * The startup code initializes the `RAMP' special function registers
       with zero.
  
     * If a *note named address space: AVR Named Address Spaces. other
!      than generic or `__flash' is used, then `RAMPZ' is set as needed
       before the operation.
  
     * If the device supports RAM larger than 64 KiB and the compiler
!      needs to change `RAMPZ' to accomplish an operation, `RAMPZ' is
       reset to zero after the operation.
  
!    * If the device comes with a specific `RAMP' register, the ISR
       prologue/epilogue saves/restores that SFR and initializes it with
       zero in case the ISR code might (implicitly) use it.
  
!    * RAM larger than 64 KiB is not supported by GCC for AVR targets.
!      If you use inline assembler to read from locations outside the
!      16-bit address range and change one of the `RAMP' registers, you
!      must reset it to zero after the access.
! 
  
  3.17.5.3 AVR Built-in Macros
  ............................
--- 13265,13303 ----
                return func_4();
            }
  
!      and the application be linked with '-Wl,--defsym,func_4=0x4'.
!      Alternatively, 'func_4' can be defined in the linker script.
  
! 3.17.5.2 Handling of the 'RAMPD', 'RAMPX', 'RAMPY' and 'RAMPZ' Special Function Registers
  .........................................................................................
  
  Some AVR devices support memories larger than the 64 KiB range that can
  be accessed with 16-bit pointers.  To access memory locations outside
! this 64 KiB range, the contentent of a 'RAMP' register is used as high
! part of the address: The 'X', 'Y', 'Z' address register is concatenated
! with the 'RAMPX', 'RAMPY', 'RAMPZ' special function register,
! respectively, to get a wide address.  Similarly, 'RAMPD' is used
  together with direct addressing.
  
!    * The startup code initializes the 'RAMP' special function registers
       with zero.
  
     * If a *note named address space: AVR Named Address Spaces. other
!      than generic or '__flash' is used, then 'RAMPZ' is set as needed
       before the operation.
  
     * If the device supports RAM larger than 64 KiB and the compiler
!      needs to change 'RAMPZ' to accomplish an operation, 'RAMPZ' is
       reset to zero after the operation.
  
!    * If the device comes with a specific 'RAMP' register, the ISR
       prologue/epilogue saves/restores that SFR and initializes it with
       zero in case the ISR code might (implicitly) use it.
  
!    * RAM larger than 64 KiB is not supported by GCC for AVR targets.  If
!      you use inline assembler to read from locations outside the 16-bit
!      address range and change one of the 'RAMP' registers, you must
!      reset it to zero after the access.
  
  3.17.5.3 AVR Built-in Macros
  ............................
*************** together with direct addressing.
*** 13393,13523 ****
  GCC defines several built-in macros so that the user code can test for
  the presence or absence of features.  Almost any of the following
  built-in macros are deduced from device capabilities and thus triggered
! by the `-mmcu=' command-line option.
  
   For even more AVR-specific built-in macros see *note AVR Named Address
  Spaces:: and *note AVR Built-in Functions::.
  
! `__AVR_ARCH__'
       Build-in macro that resolves to a decimal number that identifies
!      the architecture and depends on the `-mmcu=MCU' option.  Possible
       values are:
  
!      `2', `25', `3', `31', `35', `4', `5', `51', `6'
  
!      for MCU=`avr2', `avr25', `avr3', `avr31', `avr35', `avr4', `avr5',
!      `avr51', `avr6',
  
       respectively and
  
!      `100', `102', `104', `105', `106', `107'
  
!      for MCU=`avrtiny', `avrxmega2', `avrxmega4', `avrxmega5',
!      `avrxmega6', `avrxmega7', respectively.  If MCU specifies a
!      device, this built-in macro is set accordingly. For example, with
!      `-mmcu=atmega8' the macro is defined to `4'.
  
! `__AVR_DEVICE__'
!      Setting `-mmcu=DEVICE' defines this built-in macro which reflects
!      the device's name. For example, `-mmcu=atmega8' defines the
!      built-in macro `__AVR_ATmega8__', `-mmcu=attiny261a' defines
!      `__AVR_ATtiny261A__', etc.
  
!      The built-in macros' names follow the scheme `__AVR_DEVICE__'
!      where DEVICE is the device name as from the AVR user manual. The
       difference between DEVICE in the built-in macro and DEVICE in
!      `-mmcu=DEVICE' is that the latter is always lowercase.
  
       If DEVICE is not a device but only a core architecture like
!      `avr51', this macro is not defined.
  
! `__AVR_DEVICE_NAME__'
!      Setting `-mmcu=DEVICE' defines this built-in macro to the device's
!      name. For example, with `-mmcu=atmega8' the macro is defined to
!      `atmega8'.
  
       If DEVICE is not a device but only a core architecture like
!      `avr51', this macro is not defined.
  
! `__AVR_XMEGA__'
       The device / architecture belongs to the XMEGA family of devices.
  
! `__AVR_HAVE_ELPM__'
!      The device has the the `ELPM' instruction.
  
! `__AVR_HAVE_ELPMX__'
!      The device has the `ELPM RN,Z' and `ELPM RN,Z+' instructions.
  
! `__AVR_HAVE_MOVW__'
!      The device has the `MOVW' instruction to perform 16-bit
       register-register moves.
  
! `__AVR_HAVE_LPMX__'
!      The device has the `LPM RN,Z' and `LPM RN,Z+' instructions.
  
! `__AVR_HAVE_MUL__'
       The device has a hardware multiplier.
  
! `__AVR_HAVE_JMP_CALL__'
!      The device has the `JMP' and `CALL' instructions.  This is the
!      case for devices with at least 16 KiB of program memory.
  
! `__AVR_HAVE_EIJMP_EICALL__'
! `__AVR_3_BYTE_PC__'
!      The device has the `EIJMP' and `EICALL' instructions.  This is the
       case for devices with more than 128 KiB of program memory.  This
       also means that the program counter (PC) is 3 bytes wide.
  
! `__AVR_2_BYTE_PC__'
!      The program counter (PC) is 2 bytes wide. This is the case for
       devices with up to 128 KiB of program memory.
  
! `__AVR_HAVE_8BIT_SP__'
! `__AVR_HAVE_16BIT_SP__'
       The stack pointer (SP) register is treated as 8-bit respectively
!      16-bit register by the compiler.  The definition of these macros
!      is affected by `-mtiny-stack'.
  
! `__AVR_HAVE_SPH__'
! `__AVR_SP8__'
       The device has the SPH (high part of stack pointer) special
!      function register or has an 8-bit stack pointer, respectively.
!      The definition of these macros is affected by `-mmcu=' and in the
!      cases of `-mmcu=avr2' and `-mmcu=avr25' also by `-msp8'.
  
! `__AVR_HAVE_RAMPD__'
! `__AVR_HAVE_RAMPX__'
! `__AVR_HAVE_RAMPY__'
! `__AVR_HAVE_RAMPZ__'
!      The device has the `RAMPD', `RAMPX', `RAMPY', `RAMPZ' special
       function register, respectively.
  
! `__NO_INTERRUPTS__'
!      This macro reflects the `-mno-interrupts' command-line option.
  
! `__AVR_ERRATA_SKIP__'
! `__AVR_ERRATA_SKIP_JMP_CALL__'
       Some AVR devices (AT90S8515, ATmega103) must not skip 32-bit
       instructions because of a hardware erratum.  Skip instructions are
!      `SBRS', `SBRC', `SBIS', `SBIC' and `CPSE'.  The second macro is
!      only defined if `__AVR_HAVE_JMP_CALL__' is also set.
  
! `__AVR_ISA_RMW__'
       The device has Read-Modify-Write instructions (XCH, LAC, LAS and
       LAT).
  
! `__AVR_SFR_OFFSET__=OFFSET'
       Instructions that can address I/O special function registers
!      directly like `IN', `OUT', `SBI', etc. may use a different address
!      as if addressed by an instruction to access RAM like `LD' or
!      `STS'. This offset depends on the device architecture and has to
!      be subtracted from the RAM address in order to get the respective
       I/O address.
  
! `__WITH_AVRLIBC__'
       The compiler is configured to be used together with AVR-Libc.  See
!      the `--with-avrlibc' configure option.
! 
  
  
  File: gcc.info,  Node: Blackfin Options,  Next: C6X Options,  Prev: AVR Options,  Up: Submodel Options
--- 13305,13434 ----
  GCC defines several built-in macros so that the user code can test for
  the presence or absence of features.  Almost any of the following
  built-in macros are deduced from device capabilities and thus triggered
! by the '-mmcu=' command-line option.
  
   For even more AVR-specific built-in macros see *note AVR Named Address
  Spaces:: and *note AVR Built-in Functions::.
  
! '__AVR_ARCH__'
       Build-in macro that resolves to a decimal number that identifies
!      the architecture and depends on the '-mmcu=MCU' option.  Possible
       values are:
  
!      '2', '25', '3', '31', '35', '4', '5', '51', '6'
  
!      for MCU='avr2', 'avr25', 'avr3', 'avr31', 'avr35', 'avr4', 'avr5',
!      'avr51', 'avr6',
  
       respectively and
  
!      '100', '102', '104', '105', '106', '107'
  
!      for MCU='avrtiny', 'avrxmega2', 'avrxmega4', 'avrxmega5',
!      'avrxmega6', 'avrxmega7', respectively.  If MCU specifies a device,
!      this built-in macro is set accordingly.  For example, with
!      '-mmcu=atmega8' the macro is defined to '4'.
  
! '__AVR_DEVICE__'
!      Setting '-mmcu=DEVICE' defines this built-in macro which reflects
!      the device's name.  For example, '-mmcu=atmega8' defines the
!      built-in macro '__AVR_ATmega8__', '-mmcu=attiny261a' defines
!      '__AVR_ATtiny261A__', etc.
  
!      The built-in macros' names follow the scheme '__AVR_DEVICE__' where
!      DEVICE is the device name as from the AVR user manual.  The
       difference between DEVICE in the built-in macro and DEVICE in
!      '-mmcu=DEVICE' is that the latter is always lowercase.
  
       If DEVICE is not a device but only a core architecture like
!      'avr51', this macro is not defined.
  
! '__AVR_DEVICE_NAME__'
!      Setting '-mmcu=DEVICE' defines this built-in macro to the device's
!      name.  For example, with '-mmcu=atmega8' the macro is defined to
!      'atmega8'.
  
       If DEVICE is not a device but only a core architecture like
!      'avr51', this macro is not defined.
  
! '__AVR_XMEGA__'
       The device / architecture belongs to the XMEGA family of devices.
  
! '__AVR_HAVE_ELPM__'
!      The device has the the 'ELPM' instruction.
  
! '__AVR_HAVE_ELPMX__'
!      The device has the 'ELPM RN,Z' and 'ELPM RN,Z+' instructions.
  
! '__AVR_HAVE_MOVW__'
!      The device has the 'MOVW' instruction to perform 16-bit
       register-register moves.
  
! '__AVR_HAVE_LPMX__'
!      The device has the 'LPM RN,Z' and 'LPM RN,Z+' instructions.
  
! '__AVR_HAVE_MUL__'
       The device has a hardware multiplier.
  
! '__AVR_HAVE_JMP_CALL__'
!      The device has the 'JMP' and 'CALL' instructions.  This is the case
!      for devices with at least 16 KiB of program memory.
  
! '__AVR_HAVE_EIJMP_EICALL__'
! '__AVR_3_BYTE_PC__'
!      The device has the 'EIJMP' and 'EICALL' instructions.  This is the
       case for devices with more than 128 KiB of program memory.  This
       also means that the program counter (PC) is 3 bytes wide.
  
! '__AVR_2_BYTE_PC__'
!      The program counter (PC) is 2 bytes wide.  This is the case for
       devices with up to 128 KiB of program memory.
  
! '__AVR_HAVE_8BIT_SP__'
! '__AVR_HAVE_16BIT_SP__'
       The stack pointer (SP) register is treated as 8-bit respectively
!      16-bit register by the compiler.  The definition of these macros is
!      affected by '-mtiny-stack'.
  
! '__AVR_HAVE_SPH__'
! '__AVR_SP8__'
       The device has the SPH (high part of stack pointer) special
!      function register or has an 8-bit stack pointer, respectively.  The
!      definition of these macros is affected by '-mmcu=' and in the cases
!      of '-mmcu=avr2' and '-mmcu=avr25' also by '-msp8'.
  
! '__AVR_HAVE_RAMPD__'
! '__AVR_HAVE_RAMPX__'
! '__AVR_HAVE_RAMPY__'
! '__AVR_HAVE_RAMPZ__'
!      The device has the 'RAMPD', 'RAMPX', 'RAMPY', 'RAMPZ' special
       function register, respectively.
  
! '__NO_INTERRUPTS__'
!      This macro reflects the '-mno-interrupts' command-line option.
  
! '__AVR_ERRATA_SKIP__'
! '__AVR_ERRATA_SKIP_JMP_CALL__'
       Some AVR devices (AT90S8515, ATmega103) must not skip 32-bit
       instructions because of a hardware erratum.  Skip instructions are
!      'SBRS', 'SBRC', 'SBIS', 'SBIC' and 'CPSE'.  The second macro is
!      only defined if '__AVR_HAVE_JMP_CALL__' is also set.
  
! '__AVR_ISA_RMW__'
       The device has Read-Modify-Write instructions (XCH, LAC, LAS and
       LAT).
  
! '__AVR_SFR_OFFSET__=OFFSET'
       Instructions that can address I/O special function registers
!      directly like 'IN', 'OUT', 'SBI', etc. may use a different address
!      as if addressed by an instruction to access RAM like 'LD' or 'STS'.
!      This offset depends on the device architecture and has to be
!      subtracted from the RAM address in order to get the respective
       I/O address.
  
! '__WITH_AVRLIBC__'
       The compiler is configured to be used together with AVR-Libc.  See
!      the '--with-avrlibc' configure option.
  
  
  File: gcc.info,  Node: Blackfin Options,  Next: C6X Options,  Prev: AVR Options,  Up: Submodel Options
*************** File: gcc.info,  Node: Blackfin Options,
*** 13525,13645 ****
  3.17.6 Blackfin Options
  -----------------------
  
! `-mcpu=CPU[-SIREVISION]'
       Specifies the name of the target Blackfin processor.  Currently,
!      CPU can be one of `bf512', `bf514', `bf516', `bf518', `bf522',
!      `bf523', `bf524', `bf525', `bf526', `bf527', `bf531', `bf532',
!      `bf533', `bf534', `bf536', `bf537', `bf538', `bf539', `bf542',
!      `bf544', `bf547', `bf548', `bf549', `bf542m', `bf544m', `bf547m',
!      `bf548m', `bf549m', `bf561', `bf592'.
  
       The optional SIREVISION specifies the silicon revision of the
       target Blackfin processor.  Any workarounds available for the
!      targeted silicon revision are enabled.  If SIREVISION is `none',
!      no workarounds are enabled.  If SIREVISION is `any', all
!      workarounds for the targeted processor are enabled.  The
!      `__SILICON_REVISION__' macro is defined to two hexadecimal digits
!      representing the major and minor numbers in the silicon revision.
!      If SIREVISION is `none', the `__SILICON_REVISION__' is not
!      defined.  If SIREVISION is `any', the `__SILICON_REVISION__' is
!      defined to be `0xffff'.  If this optional SIREVISION is not used,
!      GCC assumes the latest known silicon revision of the targeted
!      Blackfin processor.
  
       GCC defines a preprocessor macro for the specified CPU.  For the
!      `bfin-elf' toolchain, this option causes the hardware BSP provided
!      by libgloss to be linked in if `-msim' is not given.
  
!      Without this option, `bf532' is used as the processor by default.
  
!      Note that support for `bf561' is incomplete.  For `bf561', only
!      the preprocessor macro is defined.
  
! `-msim'
       Specifies that the program will be run on the simulator.  This
       causes the simulator BSP provided by libgloss to be linked in.
!      This option has effect only for `bfin-elf' toolchain.  Certain
!      other options, such as `-mid-shared-library' and `-mfdpic', imply
!      `-msim'.
  
! `-momit-leaf-frame-pointer'
       Don't keep the frame pointer in a register for leaf functions.
       This avoids the instructions to save, set up and restore frame
       pointers and makes an extra register available in leaf functions.
!      The option `-fomit-frame-pointer' removes the frame pointer for
!      all functions, which might make debugging harder.
  
! `-mspecld-anomaly'
       When enabled, the compiler ensures that the generated code does not
!      contain speculative loads after jump instructions. If this option
!      is used, `__WORKAROUND_SPECULATIVE_LOADS' is defined.
  
! `-mno-specld-anomaly'
       Don't generate extra code to prevent speculative loads from
       occurring.
  
! `-mcsync-anomaly'
       When enabled, the compiler ensures that the generated code does not
       contain CSYNC or SSYNC instructions too soon after conditional
!      branches.  If this option is used,
!      `__WORKAROUND_SPECULATIVE_SYNCS' is defined.
  
! `-mno-csync-anomaly'
       Don't generate extra code to prevent CSYNC or SSYNC instructions
       from occurring too soon after a conditional branch.
  
! `-mlow-64k'
       When enabled, the compiler is free to take advantage of the
       knowledge that the entire program fits into the low 64k of memory.
  
! `-mno-low-64k'
       Assume that the program is arbitrarily large.  This is the default.
  
! `-mstack-check-l1'
       Do stack checking using information placed into L1 scratchpad
       memory by the uClinux kernel.
  
! `-mid-shared-library'
       Generate code that supports shared libraries via the library ID
       method.  This allows for execute in place and shared libraries in
       an environment without virtual memory management.  This option
!      implies `-fPIC'.  With a `bfin-elf' target, this option implies
!      `-msim'.
  
! `-mno-id-shared-library'
       Generate code that doesn't assume ID-based shared libraries are
       being used.  This is the default.
  
! `-mleaf-id-shared-library'
       Generate code that supports shared libraries via the library ID
       method, but assumes that this library or executable won't link
!      against any other ID shared libraries.  That allows the compiler
!      to use faster code for jumps and calls.
  
! `-mno-leaf-id-shared-library'
       Do not assume that the code being compiled won't link against any
       ID shared libraries.  Slower code is generated for jump and call
       insns.
  
! `-mshared-library-id=n'
       Specifies the identification number of the ID-based shared library
       being compiled.  Specifying a value of 0 generates more compact
       code; specifying other values forces the allocation of that number
!      to the current library but is no more space- or time-efficient
!      than omitting this option.
  
! `-msep-data'
       Generate code that allows the data segment to be located in a
       different area of memory from the text segment.  This allows for
       execute in place in an environment without virtual memory
       management by eliminating relocations against the text section.
  
! `-mno-sep-data'
       Generate code that assumes that the data segment follows the text
       segment.  This is the default.
  
! `-mlong-calls'
! `-mno-long-calls'
       Tells the compiler to perform function calls by first loading the
       address of the function into a register and then performing a
       subroutine call on this register.  This switch is needed if the
--- 13436,13555 ----
  3.17.6 Blackfin Options
  -----------------------
  
! '-mcpu=CPU[-SIREVISION]'
       Specifies the name of the target Blackfin processor.  Currently,
!      CPU can be one of 'bf512', 'bf514', 'bf516', 'bf518', 'bf522',
!      'bf523', 'bf524', 'bf525', 'bf526', 'bf527', 'bf531', 'bf532',
!      'bf533', 'bf534', 'bf536', 'bf537', 'bf538', 'bf539', 'bf542',
!      'bf544', 'bf547', 'bf548', 'bf549', 'bf542m', 'bf544m', 'bf547m',
!      'bf548m', 'bf549m', 'bf561', 'bf592'.
  
       The optional SIREVISION specifies the silicon revision of the
       target Blackfin processor.  Any workarounds available for the
!      targeted silicon revision are enabled.  If SIREVISION is 'none', no
!      workarounds are enabled.  If SIREVISION is 'any', all workarounds
!      for the targeted processor are enabled.  The '__SILICON_REVISION__'
!      macro is defined to two hexadecimal digits representing the major
!      and minor numbers in the silicon revision.  If SIREVISION is
!      'none', the '__SILICON_REVISION__' is not defined.  If SIREVISION
!      is 'any', the '__SILICON_REVISION__' is defined to be '0xffff'.  If
!      this optional SIREVISION is not used, GCC assumes the latest known
!      silicon revision of the targeted Blackfin processor.
  
       GCC defines a preprocessor macro for the specified CPU.  For the
!      'bfin-elf' toolchain, this option causes the hardware BSP provided
!      by libgloss to be linked in if '-msim' is not given.
  
!      Without this option, 'bf532' is used as the processor by default.
  
!      Note that support for 'bf561' is incomplete.  For 'bf561', only the
!      preprocessor macro is defined.
  
! '-msim'
       Specifies that the program will be run on the simulator.  This
       causes the simulator BSP provided by libgloss to be linked in.
!      This option has effect only for 'bfin-elf' toolchain.  Certain
!      other options, such as '-mid-shared-library' and '-mfdpic', imply
!      '-msim'.
  
! '-momit-leaf-frame-pointer'
       Don't keep the frame pointer in a register for leaf functions.
       This avoids the instructions to save, set up and restore frame
       pointers and makes an extra register available in leaf functions.
!      The option '-fomit-frame-pointer' removes the frame pointer for all
!      functions, which might make debugging harder.
  
! '-mspecld-anomaly'
       When enabled, the compiler ensures that the generated code does not
!      contain speculative loads after jump instructions.  If this option
!      is used, '__WORKAROUND_SPECULATIVE_LOADS' is defined.
  
! '-mno-specld-anomaly'
       Don't generate extra code to prevent speculative loads from
       occurring.
  
! '-mcsync-anomaly'
       When enabled, the compiler ensures that the generated code does not
       contain CSYNC or SSYNC instructions too soon after conditional
!      branches.  If this option is used, '__WORKAROUND_SPECULATIVE_SYNCS'
!      is defined.
  
! '-mno-csync-anomaly'
       Don't generate extra code to prevent CSYNC or SSYNC instructions
       from occurring too soon after a conditional branch.
  
! '-mlow-64k'
       When enabled, the compiler is free to take advantage of the
       knowledge that the entire program fits into the low 64k of memory.
  
! '-mno-low-64k'
       Assume that the program is arbitrarily large.  This is the default.
  
! '-mstack-check-l1'
       Do stack checking using information placed into L1 scratchpad
       memory by the uClinux kernel.
  
! '-mid-shared-library'
       Generate code that supports shared libraries via the library ID
       method.  This allows for execute in place and shared libraries in
       an environment without virtual memory management.  This option
!      implies '-fPIC'.  With a 'bfin-elf' target, this option implies
!      '-msim'.
  
! '-mno-id-shared-library'
       Generate code that doesn't assume ID-based shared libraries are
       being used.  This is the default.
  
! '-mleaf-id-shared-library'
       Generate code that supports shared libraries via the library ID
       method, but assumes that this library or executable won't link
!      against any other ID shared libraries.  That allows the compiler to
!      use faster code for jumps and calls.
  
! '-mno-leaf-id-shared-library'
       Do not assume that the code being compiled won't link against any
       ID shared libraries.  Slower code is generated for jump and call
       insns.
  
! '-mshared-library-id=n'
       Specifies the identification number of the ID-based shared library
       being compiled.  Specifying a value of 0 generates more compact
       code; specifying other values forces the allocation of that number
!      to the current library but is no more space- or time-efficient than
!      omitting this option.
  
! '-msep-data'
       Generate code that allows the data segment to be located in a
       different area of memory from the text segment.  This allows for
       execute in place in an environment without virtual memory
       management by eliminating relocations against the text section.
  
! '-mno-sep-data'
       Generate code that assumes that the data segment follows the text
       segment.  This is the default.
  
! '-mlong-calls'
! '-mno-long-calls'
       Tells the compiler to perform function calls by first loading the
       address of the function into a register and then performing a
       subroutine call on this register.  This switch is needed if the
*************** File: gcc.info,  Node: Blackfin Options,
*** 13647,13702 ****
       offset-based version of subroutine call instruction.
  
       This feature is not enabled by default.  Specifying
!      `-mno-long-calls' restores the default behavior.  Note these
       switches have no effect on how the compiler generates code to
       handle function calls via function pointers.
  
! `-mfast-fp'
!      Link with the fast floating-point library. This library relaxes
       some of the IEEE floating-point standard's rules for checking
       inputs against Not-a-Number (NAN), in the interest of performance.
  
! `-minline-plt'
       Enable inlining of PLT entries in function calls to functions that
!      are not known to bind locally.  It has no effect without `-mfdpic'.
  
! `-mmulticore'
       Build a standalone application for multicore Blackfin processors.
       This option causes proper start files and link scripts supporting
!      multicore to be used, and defines the macro `__BFIN_MULTICORE'.
!      It can only be used with `-mcpu=bf561[-SIREVISION]'.
  
!      This option can be used with `-mcorea' or `-mcoreb', which selects
!      the one-application-per-core programming model.  Without `-mcorea'
!      or `-mcoreb', the single-application/dual-core programming model
!      is used. In this model, the main function of Core B should be
!      named as `coreb_main'.
  
       If this option is not used, the single-core application programming
       model is used.
  
! `-mcorea'
       Build a standalone application for Core A of BF561 when using the
!      one-application-per-core programming model. Proper start files and
       link scripts are used to support Core A, and the macro
!      `__BFIN_COREA' is defined.  This option can only be used in
!      conjunction with `-mmulticore'.
  
! `-mcoreb'
       Build a standalone application for Core B of BF561 when using the
!      one-application-per-core programming model. Proper start files and
       link scripts are used to support Core B, and the macro
!      `__BFIN_COREB' is defined. When this option is used, `coreb_main'
!      should be used instead of `main'.  This option can only be used in
!      conjunction with `-mmulticore'.
  
! `-msdram'
       Build a standalone application for SDRAM. Proper start files and
       link scripts are used to put the application into SDRAM, and the
!      macro `__BFIN_SDRAM' is defined.  The loader should initialize
       SDRAM before loading the application.
  
! `-micplb'
       Assume that ICPLBs are enabled at run time.  This has an effect on
       certain anomaly workarounds.  For Linux targets, the default is to
       assume ICPLBs are enabled; for standalone applications the default
--- 13557,13612 ----
       offset-based version of subroutine call instruction.
  
       This feature is not enabled by default.  Specifying
!      '-mno-long-calls' restores the default behavior.  Note these
       switches have no effect on how the compiler generates code to
       handle function calls via function pointers.
  
! '-mfast-fp'
!      Link with the fast floating-point library.  This library relaxes
       some of the IEEE floating-point standard's rules for checking
       inputs against Not-a-Number (NAN), in the interest of performance.
  
! '-minline-plt'
       Enable inlining of PLT entries in function calls to functions that
!      are not known to bind locally.  It has no effect without '-mfdpic'.
  
! '-mmulticore'
       Build a standalone application for multicore Blackfin processors.
       This option causes proper start files and link scripts supporting
!      multicore to be used, and defines the macro '__BFIN_MULTICORE'.  It
!      can only be used with '-mcpu=bf561[-SIREVISION]'.
  
!      This option can be used with '-mcorea' or '-mcoreb', which selects
!      the one-application-per-core programming model.  Without '-mcorea'
!      or '-mcoreb', the single-application/dual-core programming model is
!      used.  In this model, the main function of Core B should be named
!      as 'coreb_main'.
  
       If this option is not used, the single-core application programming
       model is used.
  
! '-mcorea'
       Build a standalone application for Core A of BF561 when using the
!      one-application-per-core programming model.  Proper start files and
       link scripts are used to support Core A, and the macro
!      '__BFIN_COREA' is defined.  This option can only be used in
!      conjunction with '-mmulticore'.
  
! '-mcoreb'
       Build a standalone application for Core B of BF561 when using the
!      one-application-per-core programming model.  Proper start files and
       link scripts are used to support Core B, and the macro
!      '__BFIN_COREB' is defined.  When this option is used, 'coreb_main'
!      should be used instead of 'main'.  This option can only be used in
!      conjunction with '-mmulticore'.
  
! '-msdram'
       Build a standalone application for SDRAM. Proper start files and
       link scripts are used to put the application into SDRAM, and the
!      macro '__BFIN_SDRAM' is defined.  The loader should initialize
       SDRAM before loading the application.
  
! '-micplb'
       Assume that ICPLBs are enabled at run time.  This has an effect on
       certain anomaly workarounds.  For Linux targets, the default is to
       assume ICPLBs are enabled; for standalone applications the default
*************** File: gcc.info,  Node: C6X Options,  Nex
*** 13708,13747 ****
  3.17.7 C6X Options
  ------------------
  
! `-march=NAME'
       This specifies the name of the target architecture.  GCC uses this
       name to determine what kind of instructions it can emit when
!      generating assembly code.  Permissible names are: `c62x', `c64x',
!      `c64x+', `c67x', `c67x+', `c674x'.
  
! `-mbig-endian'
       Generate code for a big-endian target.
  
! `-mlittle-endian'
       Generate code for a little-endian target.  This is the default.
  
! `-msim'
       Choose startup files and linker script suitable for the simulator.
  
! `-msdata=default'
!      Put small global and static data in the `.neardata' section, which
!      is pointed to by register `B14'.  Put small uninitialized global
!      and static data in the `.bss' section, which is adjacent to the
!      `.neardata' section.  Put small read-only data into the `.rodata'
       section.  The corresponding sections used for large pieces of data
!      are `.fardata', `.far' and `.const'.
  
! `-msdata=all'
       Put all data, not just small objects, into the sections reserved
!      for small data, and use addressing relative to the `B14' register
       to access them.
  
! `-msdata=none'
       Make no use of the sections reserved for small data, and use
       absolute addresses to access all data.  Put all initialized global
!      and static data in the `.fardata' section, and all uninitialized
!      data in the `.far' section.  Put all constant data into the
!      `.const' section.
  
  
  File: gcc.info,  Node: CRIS Options,  Next: CR16 Options,  Prev: C6X Options,  Up: Submodel Options
--- 13618,13657 ----
  3.17.7 C6X Options
  ------------------
  
! '-march=NAME'
       This specifies the name of the target architecture.  GCC uses this
       name to determine what kind of instructions it can emit when
!      generating assembly code.  Permissible names are: 'c62x', 'c64x',
!      'c64x+', 'c67x', 'c67x+', 'c674x'.
  
! '-mbig-endian'
       Generate code for a big-endian target.
  
! '-mlittle-endian'
       Generate code for a little-endian target.  This is the default.
  
! '-msim'
       Choose startup files and linker script suitable for the simulator.
  
! '-msdata=default'
!      Put small global and static data in the '.neardata' section, which
!      is pointed to by register 'B14'.  Put small uninitialized global
!      and static data in the '.bss' section, which is adjacent to the
!      '.neardata' section.  Put small read-only data into the '.rodata'
       section.  The corresponding sections used for large pieces of data
!      are '.fardata', '.far' and '.const'.
  
! '-msdata=all'
       Put all data, not just small objects, into the sections reserved
!      for small data, and use addressing relative to the 'B14' register
       to access them.
  
! '-msdata=none'
       Make no use of the sections reserved for small data, and use
       absolute addresses to access all data.  Put all initialized global
!      and static data in the '.fardata' section, and all uninitialized
!      data in the '.far' section.  Put all constant data into the
!      '.const' section.
  
  
  File: gcc.info,  Node: CRIS Options,  Next: CR16 Options,  Prev: C6X Options,  Up: Submodel Options
*************** File: gcc.info,  Node: CRIS Options,  Ne
*** 13751,13850 ****
  
  These options are defined specifically for the CRIS ports.
  
! `-march=ARCHITECTURE-TYPE'
! `-mcpu=ARCHITECTURE-TYPE'
       Generate code for the specified architecture.  The choices for
!      ARCHITECTURE-TYPE are `v3', `v8' and `v10' for respectively
!      ETRAX 4, ETRAX 100, and ETRAX 100 LX.  Default is `v0' except for
!      cris-axis-linux-gnu, where the default is `v10'.
  
! `-mtune=ARCHITECTURE-TYPE'
       Tune to ARCHITECTURE-TYPE everything applicable about the generated
       code, except for the ABI and the set of available instructions.
       The choices for ARCHITECTURE-TYPE are the same as for
!      `-march=ARCHITECTURE-TYPE'.
  
! `-mmax-stack-frame=N'
       Warn when the stack frame of a function exceeds N bytes.
  
! `-metrax4'
! `-metrax100'
!      The options `-metrax4' and `-metrax100' are synonyms for
!      `-march=v3' and `-march=v8' respectively.
  
! `-mmul-bug-workaround'
! `-mno-mul-bug-workaround'
!      Work around a bug in the `muls' and `mulu' instructions for CPU
       models where it applies.  This option is active by default.
  
! `-mpdebug'
       Enable CRIS-specific verbose debug-related information in the
       assembly code.  This option also has the effect of turning off the
!      `#NO_APP' formatted-code indicator to the assembler at the
       beginning of the assembly file.
  
! `-mcc-init'
!      Do not use condition-code results from previous instruction;
!      always emit compare and test instructions before use of condition
!      codes.
  
! `-mno-side-effects'
       Do not emit instructions with side effects in addressing modes
       other than post-increment.
  
! `-mstack-align'
! `-mno-stack-align'
! `-mdata-align'
! `-mno-data-align'
! `-mconst-align'
! `-mno-const-align'
!      These options (`no-' options) arrange (eliminate arrangements) for
       the stack frame, individual data and constants to be aligned for
       the maximum single data access size for the chosen CPU model.  The
       default is to arrange for 32-bit alignment.  ABI details such as
       structure layout are not affected by these options.
  
! `-m32-bit'
! `-m16-bit'
! `-m8-bit'
       Similar to the stack- data- and const-align options above, these
!      options arrange for stack frame, writable data and constants to
!      all be 32-bit, 16-bit or 8-bit aligned.  The default is 32-bit
       alignment.
  
! `-mno-prologue-epilogue'
! `-mprologue-epilogue'
!      With `-mno-prologue-epilogue', the normal function prologue and
       epilogue which set up the stack frame are omitted and no return
       instructions or return sequences are generated in the code.  Use
       this option only together with visual inspection of the compiled
!      code: no warnings or errors are generated when call-saved
!      registers must be saved, or storage for local variables needs to
!      be allocated.
  
! `-mno-gotplt'
! `-mgotplt'
!      With `-fpic' and `-fPIC', don't generate (do generate) instruction
       sequences that load addresses for functions from the PLT part of
       the GOT rather than (traditional on other architectures) calls to
!      the PLT.  The default is `-mgotplt'.
  
! `-melf'
       Legacy no-op option only recognized with the cris-axis-elf and
       cris-axis-linux-gnu targets.
  
! `-mlinux'
       Legacy no-op option only recognized with the cris-axis-linux-gnu
       target.
  
! `-sim'
       This option, recognized for the cris-axis-elf, arranges to link
       with input-output functions from a simulator library.  Code,
       initialized data and zero-initialized data are allocated
       consecutively.
  
! `-sim2'
!      Like `-sim', but pass linker options to locate initialized data at
       0x40000000 and zero-initialized data at 0x80000000.
  
  
--- 13661,13759 ----
  
  These options are defined specifically for the CRIS ports.
  
! '-march=ARCHITECTURE-TYPE'
! '-mcpu=ARCHITECTURE-TYPE'
       Generate code for the specified architecture.  The choices for
!      ARCHITECTURE-TYPE are 'v3', 'v8' and 'v10' for respectively
!      ETRAX 4, ETRAX 100, and ETRAX 100 LX.  Default is 'v0' except for
!      cris-axis-linux-gnu, where the default is 'v10'.
  
! '-mtune=ARCHITECTURE-TYPE'
       Tune to ARCHITECTURE-TYPE everything applicable about the generated
       code, except for the ABI and the set of available instructions.
       The choices for ARCHITECTURE-TYPE are the same as for
!      '-march=ARCHITECTURE-TYPE'.
  
! '-mmax-stack-frame=N'
       Warn when the stack frame of a function exceeds N bytes.
  
! '-metrax4'
! '-metrax100'
!      The options '-metrax4' and '-metrax100' are synonyms for
!      '-march=v3' and '-march=v8' respectively.
  
! '-mmul-bug-workaround'
! '-mno-mul-bug-workaround'
!      Work around a bug in the 'muls' and 'mulu' instructions for CPU
       models where it applies.  This option is active by default.
  
! '-mpdebug'
       Enable CRIS-specific verbose debug-related information in the
       assembly code.  This option also has the effect of turning off the
!      '#NO_APP' formatted-code indicator to the assembler at the
       beginning of the assembly file.
  
! '-mcc-init'
!      Do not use condition-code results from previous instruction; always
!      emit compare and test instructions before use of condition codes.
  
! '-mno-side-effects'
       Do not emit instructions with side effects in addressing modes
       other than post-increment.
  
! '-mstack-align'
! '-mno-stack-align'
! '-mdata-align'
! '-mno-data-align'
! '-mconst-align'
! '-mno-const-align'
!      These options ('no-' options) arrange (eliminate arrangements) for
       the stack frame, individual data and constants to be aligned for
       the maximum single data access size for the chosen CPU model.  The
       default is to arrange for 32-bit alignment.  ABI details such as
       structure layout are not affected by these options.
  
! '-m32-bit'
! '-m16-bit'
! '-m8-bit'
       Similar to the stack- data- and const-align options above, these
!      options arrange for stack frame, writable data and constants to all
!      be 32-bit, 16-bit or 8-bit aligned.  The default is 32-bit
       alignment.
  
! '-mno-prologue-epilogue'
! '-mprologue-epilogue'
!      With '-mno-prologue-epilogue', the normal function prologue and
       epilogue which set up the stack frame are omitted and no return
       instructions or return sequences are generated in the code.  Use
       this option only together with visual inspection of the compiled
!      code: no warnings or errors are generated when call-saved registers
!      must be saved, or storage for local variables needs to be
!      allocated.
  
! '-mno-gotplt'
! '-mgotplt'
!      With '-fpic' and '-fPIC', don't generate (do generate) instruction
       sequences that load addresses for functions from the PLT part of
       the GOT rather than (traditional on other architectures) calls to
!      the PLT.  The default is '-mgotplt'.
  
! '-melf'
       Legacy no-op option only recognized with the cris-axis-elf and
       cris-axis-linux-gnu targets.
  
! '-mlinux'
       Legacy no-op option only recognized with the cris-axis-linux-gnu
       target.
  
! '-sim'
       This option, recognized for the cris-axis-elf, arranges to link
       with input-output functions from a simulator library.  Code,
       initialized data and zero-initialized data are allocated
       consecutively.
  
! '-sim2'
!      Like '-sim', but pass linker options to locate initialized data at
       0x40000000 and zero-initialized data at 0x80000000.
  
  
*************** File: gcc.info,  Node: CR16 Options,  Ne
*** 13855,13883 ****
  
  These options are defined specifically for the CR16 ports.
  
! `-mmac'
!      Enable the use of multiply-accumulate instructions. Disabled by
       default.
  
! `-mcr16cplus'
! `-mcr16c'
!      Generate code for CR16C or CR16C+ architecture. CR16C+ architecture
!      is default.
  
! `-msim'
       Links the library libsim.a which is in compatible with simulator.
       Applicable to ELF compiler only.
  
! `-mint32'
       Choose integer type as 32-bit wide.
  
! `-mbit-ops'
!      Generates `sbit'/`cbit' instructions for bit manipulations.
  
! `-mdata-model=MODEL'
!      Choose a data model. The choices for MODEL are `near', `far' or
!      `medium'. `medium' is default.  However, `far' is not valid with
!      `-mcr16c', as the CR16C architecture does not support the far data
       model.
  
  
--- 13764,13792 ----
  
  These options are defined specifically for the CR16 ports.
  
! '-mmac'
!      Enable the use of multiply-accumulate instructions.  Disabled by
       default.
  
! '-mcr16cplus'
! '-mcr16c'
!      Generate code for CR16C or CR16C+ architecture.  CR16C+
!      architecture is default.
  
! '-msim'
       Links the library libsim.a which is in compatible with simulator.
       Applicable to ELF compiler only.
  
! '-mint32'
       Choose integer type as 32-bit wide.
  
! '-mbit-ops'
!      Generates 'sbit'/'cbit' instructions for bit manipulations.
  
! '-mdata-model=MODEL'
!      Choose a data model.  The choices for MODEL are 'near', 'far' or
!      'medium'.  'medium' is default.  However, 'far' is not valid with
!      '-mcr16c', as the CR16C architecture does not support the far data
       model.
  
  
*************** operating system.
*** 13891,13929 ****
  
   FSF GCC on Darwin does not create "fat" object files; it creates an
  object file for the single architecture that GCC was built to target.
! Apple's GCC on Darwin does create "fat" files if multiple `-arch'
  options are used; it does so by running the compiler or linker multiple
! times and joining the results together with `lipo'.
  
!  The subtype of the file created (like `ppc7400' or `ppc970' or `i686')
  is determined by the flags that specify the ISA that GCC is targeting,
! like `-mcpu' or `-march'.  The `-force_cpusubtype_ALL' option can be
  used to override this.
  
   The Darwin tools vary in their behavior when presented with an ISA
! mismatch.  The assembler, `as', only permits instructions to be used
  that are valid for the subtype of the file it is generating, so you
! cannot put 64-bit instructions in a `ppc750' object file.  The linker
! for shared libraries, `/usr/bin/libtool', fails and prints an error if
  asked to create a shared library with a less restrictive subtype than
! its input files (for instance, trying to put a `ppc970' object file in
! a `ppc7400' library).  The linker for executables, `ld', quietly gives
! the executable the most restrictive subtype of any of its input files.
  
! `-FDIR'
       Add the framework directory DIR to the head of the list of
       directories to be searched for header files.  These directories are
!      interleaved with those specified by `-I' options and are scanned
!      in a left-to-right order.
  
       A framework directory is a directory with frameworks in it.  A
!      framework is a directory with a `Headers' and/or `PrivateHeaders'
!      directory contained directly in it that ends in `.framework'.  The
       name of a framework is the name of this directory excluding the
!      `.framework'.  Headers associated with the framework are found in
!      one of those two directories, with `Headers' being searched first.
       A subframework is a framework directory that is in a framework's
!      `Frameworks' directory.  Includes of subframework headers can only
       appear in a header of a framework that contains the subframework,
       or in a sibling subframework header.  Two subframeworks are
       siblings if they occur in the same framework.  A subframework
--- 13800,13838 ----
  
   FSF GCC on Darwin does not create "fat" object files; it creates an
  object file for the single architecture that GCC was built to target.
! Apple's GCC on Darwin does create "fat" files if multiple '-arch'
  options are used; it does so by running the compiler or linker multiple
! times and joining the results together with 'lipo'.
  
!  The subtype of the file created (like 'ppc7400' or 'ppc970' or 'i686')
  is determined by the flags that specify the ISA that GCC is targeting,
! like '-mcpu' or '-march'.  The '-force_cpusubtype_ALL' option can be
  used to override this.
  
   The Darwin tools vary in their behavior when presented with an ISA
! mismatch.  The assembler, 'as', only permits instructions to be used
  that are valid for the subtype of the file it is generating, so you
! cannot put 64-bit instructions in a 'ppc750' object file.  The linker
! for shared libraries, '/usr/bin/libtool', fails and prints an error if
  asked to create a shared library with a less restrictive subtype than
! its input files (for instance, trying to put a 'ppc970' object file in a
! 'ppc7400' library).  The linker for executables, 'ld', quietly gives the
! executable the most restrictive subtype of any of its input files.
  
! '-FDIR'
       Add the framework directory DIR to the head of the list of
       directories to be searched for header files.  These directories are
!      interleaved with those specified by '-I' options and are scanned in
!      a left-to-right order.
  
       A framework directory is a directory with frameworks in it.  A
!      framework is a directory with a 'Headers' and/or 'PrivateHeaders'
!      directory contained directly in it that ends in '.framework'.  The
       name of a framework is the name of this directory excluding the
!      '.framework'.  Headers associated with the framework are found in
!      one of those two directories, with 'Headers' being searched first.
       A subframework is a framework directory that is in a framework's
!      'Frameworks' directory.  Includes of subframework headers can only
       appear in a header of a framework that contains the subframework,
       or in a sibling subframework header.  Two subframeworks are
       siblings if they occur in the same framework.  A subframework
*************** the executable the most restrictive subt
*** 13931,14081 ****
       if this is violated.  Currently a subframework cannot have
       subframeworks; in the future, the mechanism may be extended to
       support this.  The standard frameworks can be found in
!      `/System/Library/Frameworks' and `/Library/Frameworks'.  An
!      example include looks like `#include <Framework/header.h>', where
!      `Framework' denotes the name of the framework and `header.h' is
!      found in the `PrivateHeaders' or `Headers' directory.
  
! `-iframeworkDIR'
!      Like `-F' except the directory is a treated as a system directory.
!      The main difference between this `-iframework' and `-F' is that
!      with `-iframework' the compiler does not warn about constructs
       contained within header files found via DIR.  This option is valid
       only for the C family of languages.
  
! `-gused'
       Emit debugging information for symbols that are used.  For stabs
!      debugging format, this enables `-feliminate-unused-debug-symbols'.
       This is by default ON.
  
! `-gfull'
       Emit debugging information for all symbols and types.
  
! `-mmacosx-version-min=VERSION'
!      The earliest version of MacOS X that this executable will run on
!      is VERSION.  Typical values of VERSION include `10.1', `10.2', and
!      `10.3.9'.
  
       If the compiler was built to use the system's headers by default,
       then the default for this option is the system version on which the
       compiler is running, otherwise the default is to make choices that
       are compatible with as many systems and code bases as possible.
  
! `-mkernel'
!      Enable kernel development mode.  The `-mkernel' option sets
!      `-static', `-fno-common', `-fno-use-cxa-atexit',
!      `-fno-exceptions', `-fno-non-call-exceptions', `-fapple-kext',
!      `-fno-weak' and `-fno-rtti' where applicable.  This mode also sets
!      `-mno-altivec', `-msoft-float', `-fno-builtin' and `-mlong-branch'
!      for PowerPC targets.
  
! `-mone-byte-bool'
!      Override the defaults for `bool' so that `sizeof(bool)==1'.  By
!      default `sizeof(bool)' is `4' when compiling for Darwin/PowerPC
!      and `1' when compiling for Darwin/x86, so this option has no
!      effect on x86.
  
!      *Warning:* The `-mone-byte-bool' switch causes GCC to generate
!      code that is not binary compatible with code generated without
!      that switch.  Using this switch may require recompiling all other
       modules in a program, including system libraries.  Use this switch
       to conform to a non-default data model.
  
! `-mfix-and-continue'
! `-ffix-and-continue'
! `-findirect-data'
       Generate code suitable for fast turnaround development, such as to
!      allow GDB to dynamically load `.o' files into already-running
!      programs.  `-findirect-data' and `-ffix-and-continue' are provided
       for backwards compatibility.
  
! `-all_load'
       Loads all members of static archive libraries.  See man ld(1) for
       more information.
  
! `-arch_errors_fatal'
       Cause the errors having to do with files that have the wrong
       architecture to be fatal.
  
! `-bind_at_load'
       Causes the output file to be marked such that the dynamic linker
       will bind all undefined references when the file is loaded or
       launched.
  
! `-bundle'
       Produce a Mach-o bundle format file.  See man ld(1) for more
       information.
  
! `-bundle_loader EXECUTABLE'
       This option specifies the EXECUTABLE that will load the build
       output file being linked.  See man ld(1) for more information.
  
! `-dynamiclib'
       When passed this option, GCC produces a dynamic library instead of
!      an executable when linking, using the Darwin `libtool' command.
  
! `-force_cpusubtype_ALL'
!      This causes GCC's output file to have the `ALL' subtype, instead of
!      one controlled by the `-mcpu' or `-march' option.
  
! `-allowable_client  CLIENT_NAME'
! `-client_name'
! `-compatibility_version'
! `-current_version'
! `-dead_strip'
! `-dependency-file'
! `-dylib_file'
! `-dylinker_install_name'
! `-dynamic'
! `-exported_symbols_list'
! `-filelist'
! `-flat_namespace'
! `-force_flat_namespace'
! `-headerpad_max_install_names'
! `-image_base'
! `-init'
! `-install_name'
! `-keep_private_externs'
! `-multi_module'
! `-multiply_defined'
! `-multiply_defined_unused'
! `-noall_load'
! `-no_dead_strip_inits_and_terms'
! `-nofixprebinding'
! `-nomultidefs'
! `-noprebind'
! `-noseglinkedit'
! `-pagezero_size'
! `-prebind'
! `-prebind_all_twolevel_modules'
! `-private_bundle'
! `-read_only_relocs'
! `-sectalign'
! `-sectobjectsymbols'
! `-whyload'
! `-seg1addr'
! `-sectcreate'
! `-sectobjectsymbols'
! `-sectorder'
! `-segaddr'
! `-segs_read_only_addr'
! `-segs_read_write_addr'
! `-seg_addr_table'
! `-seg_addr_table_filename'
! `-seglinkedit'
! `-segprot'
! `-segs_read_only_addr'
! `-segs_read_write_addr'
! `-single_module'
! `-static'
! `-sub_library'
! `-sub_umbrella'
! `-twolevel_namespace'
! `-umbrella'
! `-undefined'
! `-unexported_symbols_list'
! `-weak_reference_mismatches'
! `-whatsloaded'
       These options are passed to the Darwin linker.  The Darwin linker
       man page describes them in detail.
  
--- 13840,13990 ----
       if this is violated.  Currently a subframework cannot have
       subframeworks; in the future, the mechanism may be extended to
       support this.  The standard frameworks can be found in
!      '/System/Library/Frameworks' and '/Library/Frameworks'.  An example
!      include looks like '#include <Framework/header.h>', where
!      'Framework' denotes the name of the framework and 'header.h' is
!      found in the 'PrivateHeaders' or 'Headers' directory.
  
! '-iframeworkDIR'
!      Like '-F' except the directory is a treated as a system directory.
!      The main difference between this '-iframework' and '-F' is that
!      with '-iframework' the compiler does not warn about constructs
       contained within header files found via DIR.  This option is valid
       only for the C family of languages.
  
! '-gused'
       Emit debugging information for symbols that are used.  For stabs
!      debugging format, this enables '-feliminate-unused-debug-symbols'.
       This is by default ON.
  
! '-gfull'
       Emit debugging information for all symbols and types.
  
! '-mmacosx-version-min=VERSION'
!      The earliest version of MacOS X that this executable will run on is
!      VERSION.  Typical values of VERSION include '10.1', '10.2', and
!      '10.3.9'.
  
       If the compiler was built to use the system's headers by default,
       then the default for this option is the system version on which the
       compiler is running, otherwise the default is to make choices that
       are compatible with as many systems and code bases as possible.
  
! '-mkernel'
!      Enable kernel development mode.  The '-mkernel' option sets
!      '-static', '-fno-common', '-fno-use-cxa-atexit', '-fno-exceptions',
!      '-fno-non-call-exceptions', '-fapple-kext', '-fno-weak' and
!      '-fno-rtti' where applicable.  This mode also sets '-mno-altivec',
!      '-msoft-float', '-fno-builtin' and '-mlong-branch' for PowerPC
!      targets.
  
! '-mone-byte-bool'
!      Override the defaults for 'bool' so that 'sizeof(bool)==1'.  By
!      default 'sizeof(bool)' is '4' when compiling for Darwin/PowerPC and
!      '1' when compiling for Darwin/x86, so this option has no effect on
!      x86.
  
!      *Warning:* The '-mone-byte-bool' switch causes GCC to generate code
!      that is not binary compatible with code generated without that
!      switch.  Using this switch may require recompiling all other
       modules in a program, including system libraries.  Use this switch
       to conform to a non-default data model.
  
! '-mfix-and-continue'
! '-ffix-and-continue'
! '-findirect-data'
       Generate code suitable for fast turnaround development, such as to
!      allow GDB to dynamically load '.o' files into already-running
!      programs.  '-findirect-data' and '-ffix-and-continue' are provided
       for backwards compatibility.
  
! '-all_load'
       Loads all members of static archive libraries.  See man ld(1) for
       more information.
  
! '-arch_errors_fatal'
       Cause the errors having to do with files that have the wrong
       architecture to be fatal.
  
! '-bind_at_load'
       Causes the output file to be marked such that the dynamic linker
       will bind all undefined references when the file is loaded or
       launched.
  
! '-bundle'
       Produce a Mach-o bundle format file.  See man ld(1) for more
       information.
  
! '-bundle_loader EXECUTABLE'
       This option specifies the EXECUTABLE that will load the build
       output file being linked.  See man ld(1) for more information.
  
! '-dynamiclib'
       When passed this option, GCC produces a dynamic library instead of
!      an executable when linking, using the Darwin 'libtool' command.
  
! '-force_cpusubtype_ALL'
!      This causes GCC's output file to have the 'ALL' subtype, instead of
!      one controlled by the '-mcpu' or '-march' option.
  
! '-allowable_client CLIENT_NAME'
! '-client_name'
! '-compatibility_version'
! '-current_version'
! '-dead_strip'
! '-dependency-file'
! '-dylib_file'
! '-dylinker_install_name'
! '-dynamic'
! '-exported_symbols_list'
! '-filelist'
! '-flat_namespace'
! '-force_flat_namespace'
! '-headerpad_max_install_names'
! '-image_base'
! '-init'
! '-install_name'
! '-keep_private_externs'
! '-multi_module'
! '-multiply_defined'
! '-multiply_defined_unused'
! '-noall_load'
! '-no_dead_strip_inits_and_terms'
! '-nofixprebinding'
! '-nomultidefs'
! '-noprebind'
! '-noseglinkedit'
! '-pagezero_size'
! '-prebind'
! '-prebind_all_twolevel_modules'
! '-private_bundle'
! '-read_only_relocs'
! '-sectalign'
! '-sectobjectsymbols'
! '-whyload'
! '-seg1addr'
! '-sectcreate'
! '-sectobjectsymbols'
! '-sectorder'
! '-segaddr'
! '-segs_read_only_addr'
! '-segs_read_write_addr'
! '-seg_addr_table'
! '-seg_addr_table_filename'
! '-seglinkedit'
! '-segprot'
! '-segs_read_only_addr'
! '-segs_read_write_addr'
! '-single_module'
! '-static'
! '-sub_library'
! '-sub_umbrella'
! '-twolevel_namespace'
! '-umbrella'
! '-undefined'
! '-unexported_symbols_list'
! '-weak_reference_mismatches'
! '-whatsloaded'
       These options are passed to the Darwin linker.  The Darwin linker
       man page describes them in detail.
  
*************** File: gcc.info,  Node: DEC Alpha Options
*** 14085,14227 ****
  3.17.11 DEC Alpha Options
  -------------------------
  
! These `-m' options are defined for the DEC Alpha implementations:
  
! `-mno-soft-float'
! `-msoft-float'
       Use (do not use) the hardware floating-point instructions for
!      floating-point operations.  When `-msoft-float' is specified,
!      functions in `libgcc.a' are used to perform floating-point
       operations.  Unless they are replaced by routines that emulate the
       floating-point operations, or compiled in such a way as to call
       such emulations routines, these routines issue floating-point
!      operations.   If you are compiling for an Alpha without
       floating-point operations, you must ensure that the library is
       built so as not to call them.
  
       Note that Alpha implementations without floating-point operations
       are required to have floating-point registers.
  
! `-mfp-reg'
! `-mno-fp-regs'
       Generate code that uses (does not use) the floating-point register
!      set.  `-mno-fp-regs' implies `-msoft-float'.  If the floating-point
       register set is not used, floating-point operands are passed in
       integer registers as if they were integers and floating-point
!      results are passed in `$0' instead of `$f0'.  This is a
       non-standard calling sequence, so any function with a
       floating-point argument or return value called by code compiled
!      with `-mno-fp-regs' must also be compiled with that option.
  
       A typical use of this option is building a kernel that does not
       use, and hence need not save and restore, any floating-point
       registers.
  
! `-mieee'
!      The Alpha architecture implements floating-point hardware
!      optimized for maximum performance.  It is mostly compliant with
!      the IEEE floating-point standard.  However, for full compliance,
!      software assistance is required.  This option generates code fully
       IEEE-compliant code _except_ that the INEXACT-FLAG is not
       maintained (see below).  If this option is turned on, the
!      preprocessor macro `_IEEE_FP' is defined during compilation.  The
       resulting code is less efficient but is able to correctly support
       denormalized numbers and exceptional IEEE values such as
       not-a-number and plus/minus infinity.  Other Alpha compilers call
!      this option `-ieee_with_no_inexact'.
  
! `-mieee-with-inexact'
!      This is like `-mieee' except the generated code also maintains the
       IEEE INEXACT-FLAG.  Turning on this option causes the generated
       code to implement fully-compliant IEEE math.  In addition to
!      `_IEEE_FP', `_IEEE_FP_EXACT' is defined as a preprocessor macro.
       On some Alpha implementations the resulting code may execute
       significantly slower than the code generated by default.  Since
       there is very little code that depends on the INEXACT-FLAG, you
       should normally not specify this option.  Other Alpha compilers
!      call this option `-ieee_with_inexact'.
  
! `-mfp-trap-mode=TRAP-MODE'
       This option controls what floating-point related traps are enabled.
!      Other Alpha compilers call this option `-fptm TRAP-MODE'.  The
!      trap mode can be set to one of four values:
  
!     `n'
!           This is the default (normal) setting.  The only traps that
!           are enabled are the ones that cannot be disabled in software
            (e.g., division by zero trap).
  
!     `u'
!           In addition to the traps enabled by `n', underflow traps are
            enabled as well.
  
!     `su'
!           Like `u', but the instructions are marked to be safe for
            software completion (see Alpha architecture manual for
            details).
  
!     `sui'
!           Like `su', but inexact traps are enabled as well.
  
! `-mfp-rounding-mode=ROUNDING-MODE'
       Selects the IEEE rounding mode.  Other Alpha compilers call this
!      option `-fprm ROUNDING-MODE'.  The ROUNDING-MODE can be one of:
  
!     `n'
!           Normal IEEE rounding mode.  Floating-point numbers are
!           rounded towards the nearest machine number or towards the
!           even machine number in case of a tie.
  
!     `m'
            Round towards minus infinity.
  
!     `c'
            Chopped rounding mode.  Floating-point numbers are rounded
            towards zero.
  
!     `d'
            Dynamic rounding mode.  A field in the floating-point control
            register (FPCR, see Alpha architecture reference manual)
            controls the rounding mode in effect.  The C library
            initializes this register for rounding towards plus infinity.
!           Thus, unless your program modifies the FPCR, `d' corresponds
            to round towards plus infinity.
  
! `-mtrap-precision=TRAP-PRECISION'
       In the Alpha architecture, floating-point traps are imprecise.
       This means without software assistance it is impossible to recover
       from a floating trap and program execution normally needs to be
!      terminated.  GCC can generate code that can assist operating
!      system trap handlers in determining the exact location that caused
!      a floating-point trap.  Depending on the requirements of an
       application, different levels of precisions can be selected:
  
!     `p'
            Program precision.  This option is the default and means a
            trap handler can only identify which program caused a
            floating-point exception.
  
!     `f'
            Function precision.  The trap handler can determine the
            function that caused a floating-point exception.
  
!     `i'
            Instruction precision.  The trap handler can determine the
            exact instruction that caused a floating-point exception.
  
       Other Alpha compilers provide the equivalent options called
!      `-scope_safe' and `-resumption_safe'.
  
! `-mieee-conformant'
       This option marks the generated code as IEEE conformant.  You must
!      not use this option unless you also specify `-mtrap-precision=i'
!      and either `-mfp-trap-mode=su' or `-mfp-trap-mode=sui'.  Its only
!      effect is to emit the line `.eflag 48' in the function prologue of
       the generated assembly file.
  
! `-mbuild-constants'
!      Normally GCC examines a 32- or 64-bit integer constant to see if
!      it can construct it from smaller constants in two or three
       instructions.  If it cannot, it outputs the constant as a literal
       and generates code to load it from the data segment at run time.
  
--- 13994,14136 ----
  3.17.11 DEC Alpha Options
  -------------------------
  
! These '-m' options are defined for the DEC Alpha implementations:
  
! '-mno-soft-float'
! '-msoft-float'
       Use (do not use) the hardware floating-point instructions for
!      floating-point operations.  When '-msoft-float' is specified,
!      functions in 'libgcc.a' are used to perform floating-point
       operations.  Unless they are replaced by routines that emulate the
       floating-point operations, or compiled in such a way as to call
       such emulations routines, these routines issue floating-point
!      operations.  If you are compiling for an Alpha without
       floating-point operations, you must ensure that the library is
       built so as not to call them.
  
       Note that Alpha implementations without floating-point operations
       are required to have floating-point registers.
  
! '-mfp-reg'
! '-mno-fp-regs'
       Generate code that uses (does not use) the floating-point register
!      set.  '-mno-fp-regs' implies '-msoft-float'.  If the floating-point
       register set is not used, floating-point operands are passed in
       integer registers as if they were integers and floating-point
!      results are passed in '$0' instead of '$f0'.  This is a
       non-standard calling sequence, so any function with a
       floating-point argument or return value called by code compiled
!      with '-mno-fp-regs' must also be compiled with that option.
  
       A typical use of this option is building a kernel that does not
       use, and hence need not save and restore, any floating-point
       registers.
  
! '-mieee'
!      The Alpha architecture implements floating-point hardware optimized
!      for maximum performance.  It is mostly compliant with the IEEE
!      floating-point standard.  However, for full compliance, software
!      assistance is required.  This option generates code fully
       IEEE-compliant code _except_ that the INEXACT-FLAG is not
       maintained (see below).  If this option is turned on, the
!      preprocessor macro '_IEEE_FP' is defined during compilation.  The
       resulting code is less efficient but is able to correctly support
       denormalized numbers and exceptional IEEE values such as
       not-a-number and plus/minus infinity.  Other Alpha compilers call
!      this option '-ieee_with_no_inexact'.
  
! '-mieee-with-inexact'
!      This is like '-mieee' except the generated code also maintains the
       IEEE INEXACT-FLAG.  Turning on this option causes the generated
       code to implement fully-compliant IEEE math.  In addition to
!      '_IEEE_FP', '_IEEE_FP_EXACT' is defined as a preprocessor macro.
       On some Alpha implementations the resulting code may execute
       significantly slower than the code generated by default.  Since
       there is very little code that depends on the INEXACT-FLAG, you
       should normally not specify this option.  Other Alpha compilers
!      call this option '-ieee_with_inexact'.
  
! '-mfp-trap-mode=TRAP-MODE'
       This option controls what floating-point related traps are enabled.
!      Other Alpha compilers call this option '-fptm TRAP-MODE'.  The trap
!      mode can be set to one of four values:
  
!      'n'
!           This is the default (normal) setting.  The only traps that are
!           enabled are the ones that cannot be disabled in software
            (e.g., division by zero trap).
  
!      'u'
!           In addition to the traps enabled by 'n', underflow traps are
            enabled as well.
  
!      'su'
!           Like 'u', but the instructions are marked to be safe for
            software completion (see Alpha architecture manual for
            details).
  
!      'sui'
!           Like 'su', but inexact traps are enabled as well.
  
! '-mfp-rounding-mode=ROUNDING-MODE'
       Selects the IEEE rounding mode.  Other Alpha compilers call this
!      option '-fprm ROUNDING-MODE'.  The ROUNDING-MODE can be one of:
  
!      'n'
!           Normal IEEE rounding mode.  Floating-point numbers are rounded
!           towards the nearest machine number or towards the even machine
!           number in case of a tie.
  
!      'm'
            Round towards minus infinity.
  
!      'c'
            Chopped rounding mode.  Floating-point numbers are rounded
            towards zero.
  
!      'd'
            Dynamic rounding mode.  A field in the floating-point control
            register (FPCR, see Alpha architecture reference manual)
            controls the rounding mode in effect.  The C library
            initializes this register for rounding towards plus infinity.
!           Thus, unless your program modifies the FPCR, 'd' corresponds
            to round towards plus infinity.
  
! '-mtrap-precision=TRAP-PRECISION'
       In the Alpha architecture, floating-point traps are imprecise.
       This means without software assistance it is impossible to recover
       from a floating trap and program execution normally needs to be
!      terminated.  GCC can generate code that can assist operating system
!      trap handlers in determining the exact location that caused a
!      floating-point trap.  Depending on the requirements of an
       application, different levels of precisions can be selected:
  
!      'p'
            Program precision.  This option is the default and means a
            trap handler can only identify which program caused a
            floating-point exception.
  
!      'f'
            Function precision.  The trap handler can determine the
            function that caused a floating-point exception.
  
!      'i'
            Instruction precision.  The trap handler can determine the
            exact instruction that caused a floating-point exception.
  
       Other Alpha compilers provide the equivalent options called
!      '-scope_safe' and '-resumption_safe'.
  
! '-mieee-conformant'
       This option marks the generated code as IEEE conformant.  You must
!      not use this option unless you also specify '-mtrap-precision=i'
!      and either '-mfp-trap-mode=su' or '-mfp-trap-mode=sui'.  Its only
!      effect is to emit the line '.eflag 48' in the function prologue of
       the generated assembly file.
  
! '-mbuild-constants'
!      Normally GCC examines a 32- or 64-bit integer constant to see if it
!      can construct it from smaller constants in two or three
       instructions.  If it cannot, it outputs the constant as a literal
       and generates code to load it from the data segment at run time.
  
*************** These `-m' options are defined for the D
*** 14234,14372 ****
       before it can find the variables and constants in its own data
       segment.
  
! `-mbwx'
! `-mno-bwx'
! `-mcix'
! `-mno-cix'
! `-mfix'
! `-mno-fix'
! `-mmax'
! `-mno-max'
       Indicate whether GCC should generate code to use the optional BWX,
       CIX, FIX and MAX instruction sets.  The default is to use the
!      instruction sets supported by the CPU type specified via `-mcpu='
       option or that of the CPU on which GCC was built if none is
       specified.
  
! `-mfloat-vax'
! `-mfloat-ieee'
       Generate code that uses (does not use) VAX F and G floating-point
       arithmetic instead of IEEE single and double precision.
  
! `-mexplicit-relocs'
! `-mno-explicit-relocs'
       Older Alpha assemblers provided no way to generate symbol
       relocations except via assembler macros.  Use of these macros does
       not allow optimal instruction scheduling.  GNU binutils as of
       version 2.12 supports a new syntax that allows the compiler to
       explicitly mark which relocations should apply to which
       instructions.  This option is mostly useful for debugging, as GCC
!      detects the capabilities of the assembler when it is built and
!      sets the default accordingly.
  
! `-msmall-data'
! `-mlarge-data'
!      When `-mexplicit-relocs' is in effect, static data is accessed via
!      "gp-relative" relocations.  When `-msmall-data' is used, objects 8
       bytes long or smaller are placed in a "small data area" (the
!      `.sdata' and `.sbss' sections) and are accessed via 16-bit
!      relocations off of the `$gp' register.  This limits the size of
!      the small data area to 64KB, but allows the variables to be
!      directly accessed via a single instruction.
  
!      The default is `-mlarge-data'.  With this option the data area is
       limited to just below 2GB.  Programs that require more than 2GB of
!      data must use `malloc' or `mmap' to allocate the data in the heap
       instead of in the program's data segment.
  
!      When generating code for shared libraries, `-fpic' implies
!      `-msmall-data' and `-fPIC' implies `-mlarge-data'.
  
! `-msmall-text'
! `-mlarge-text'
!      When `-msmall-text' is used, the compiler assumes that the code of
       the entire program (or shared library) fits in 4MB, and is thus
!      reachable with a branch instruction.  When `-msmall-data' is used,
!      the compiler can assume that all local symbols share the same
!      `$gp' value, and thus reduce the number of instructions required
!      for a function call from 4 to 1.
  
!      The default is `-mlarge-text'.
  
! `-mcpu=CPU_TYPE'
       Set the instruction set and instruction scheduling parameters for
!      machine type CPU_TYPE.  You can specify either the `EV' style name
       or the corresponding chip number.  GCC supports scheduling
       parameters for the EV4, EV5 and EV6 family of processors and
       chooses the default values for the instruction set from the
!      processor you specify.  If you do not specify a processor type,
!      GCC defaults to the processor on which the compiler was built.
  
       Supported values for CPU_TYPE are
  
!     `ev4'
!     `ev45'
!     `21064'
            Schedules as an EV4 and has no instruction set extensions.
  
!     `ev5'
!     `21164'
            Schedules as an EV5 and has no instruction set extensions.
  
!     `ev56'
!     `21164a'
            Schedules as an EV5 and supports the BWX extension.
  
!     `pca56'
!     `21164pc'
!     `21164PC'
            Schedules as an EV5 and supports the BWX and MAX extensions.
  
!     `ev6'
!     `21264'
            Schedules as an EV6 and supports the BWX, FIX, and MAX
            extensions.
  
!     `ev67'
!     `21264a'
            Schedules as an EV6 and supports the BWX, CIX, FIX, and MAX
            extensions.
  
!      Native toolchains also support the value `native', which selects
       the best architecture option for the host processor.
!      `-mcpu=native' has no effect if GCC does not recognize the
       processor.
  
! `-mtune=CPU_TYPE'
       Set only the instruction scheduling parameters for machine type
       CPU_TYPE.  The instruction set is not changed.
  
!      Native toolchains also support the value `native', which selects
       the best architecture option for the host processor.
!      `-mtune=native' has no effect if GCC does not recognize the
       processor.
  
! `-mmemory-latency=TIME'
       Sets the latency the scheduler should assume for typical memory
       references as seen by the application.  This number is highly
!      dependent on the memory access patterns used by the application
!      and the size of the external cache on the machine.
  
       Valid options for TIME are
  
!     `NUMBER'
            A decimal number representing clock cycles.
  
!     `L1'
!     `L2'
!     `L3'
!     `main'
            The compiler contains estimates of the number of clock cycles
            for "typical" EV4 & EV5 hardware for the Level 1, 2 & 3 caches
            (also called Dcache, Scache, and Bcache), as well as to main
            memory.  Note that L3 is only valid for EV5.
  
- 
  
  File: gcc.info,  Node: FR30 Options,  Next: FRV Options,  Prev: DEC Alpha Options,  Up: Submodel Options
  
--- 14143,14280 ----
       before it can find the variables and constants in its own data
       segment.
  
! '-mbwx'
! '-mno-bwx'
! '-mcix'
! '-mno-cix'
! '-mfix'
! '-mno-fix'
! '-mmax'
! '-mno-max'
       Indicate whether GCC should generate code to use the optional BWX,
       CIX, FIX and MAX instruction sets.  The default is to use the
!      instruction sets supported by the CPU type specified via '-mcpu='
       option or that of the CPU on which GCC was built if none is
       specified.
  
! '-mfloat-vax'
! '-mfloat-ieee'
       Generate code that uses (does not use) VAX F and G floating-point
       arithmetic instead of IEEE single and double precision.
  
! '-mexplicit-relocs'
! '-mno-explicit-relocs'
       Older Alpha assemblers provided no way to generate symbol
       relocations except via assembler macros.  Use of these macros does
       not allow optimal instruction scheduling.  GNU binutils as of
       version 2.12 supports a new syntax that allows the compiler to
       explicitly mark which relocations should apply to which
       instructions.  This option is mostly useful for debugging, as GCC
!      detects the capabilities of the assembler when it is built and sets
!      the default accordingly.
  
! '-msmall-data'
! '-mlarge-data'
!      When '-mexplicit-relocs' is in effect, static data is accessed via
!      "gp-relative" relocations.  When '-msmall-data' is used, objects 8
       bytes long or smaller are placed in a "small data area" (the
!      '.sdata' and '.sbss' sections) and are accessed via 16-bit
!      relocations off of the '$gp' register.  This limits the size of the
!      small data area to 64KB, but allows the variables to be directly
!      accessed via a single instruction.
  
!      The default is '-mlarge-data'.  With this option the data area is
       limited to just below 2GB.  Programs that require more than 2GB of
!      data must use 'malloc' or 'mmap' to allocate the data in the heap
       instead of in the program's data segment.
  
!      When generating code for shared libraries, '-fpic' implies
!      '-msmall-data' and '-fPIC' implies '-mlarge-data'.
  
! '-msmall-text'
! '-mlarge-text'
!      When '-msmall-text' is used, the compiler assumes that the code of
       the entire program (or shared library) fits in 4MB, and is thus
!      reachable with a branch instruction.  When '-msmall-data' is used,
!      the compiler can assume that all local symbols share the same '$gp'
!      value, and thus reduce the number of instructions required for a
!      function call from 4 to 1.
  
!      The default is '-mlarge-text'.
  
! '-mcpu=CPU_TYPE'
       Set the instruction set and instruction scheduling parameters for
!      machine type CPU_TYPE.  You can specify either the 'EV' style name
       or the corresponding chip number.  GCC supports scheduling
       parameters for the EV4, EV5 and EV6 family of processors and
       chooses the default values for the instruction set from the
!      processor you specify.  If you do not specify a processor type, GCC
!      defaults to the processor on which the compiler was built.
  
       Supported values for CPU_TYPE are
  
!      'ev4'
!      'ev45'
!      '21064'
            Schedules as an EV4 and has no instruction set extensions.
  
!      'ev5'
!      '21164'
            Schedules as an EV5 and has no instruction set extensions.
  
!      'ev56'
!      '21164a'
            Schedules as an EV5 and supports the BWX extension.
  
!      'pca56'
!      '21164pc'
!      '21164PC'
            Schedules as an EV5 and supports the BWX and MAX extensions.
  
!      'ev6'
!      '21264'
            Schedules as an EV6 and supports the BWX, FIX, and MAX
            extensions.
  
!      'ev67'
!      '21264a'
            Schedules as an EV6 and supports the BWX, CIX, FIX, and MAX
            extensions.
  
!      Native toolchains also support the value 'native', which selects
       the best architecture option for the host processor.
!      '-mcpu=native' has no effect if GCC does not recognize the
       processor.
  
! '-mtune=CPU_TYPE'
       Set only the instruction scheduling parameters for machine type
       CPU_TYPE.  The instruction set is not changed.
  
!      Native toolchains also support the value 'native', which selects
       the best architecture option for the host processor.
!      '-mtune=native' has no effect if GCC does not recognize the
       processor.
  
! '-mmemory-latency=TIME'
       Sets the latency the scheduler should assume for typical memory
       references as seen by the application.  This number is highly
!      dependent on the memory access patterns used by the application and
!      the size of the external cache on the machine.
  
       Valid options for TIME are
  
!      'NUMBER'
            A decimal number representing clock cycles.
  
!      'L1'
!      'L2'
!      'L3'
!      'main'
            The compiler contains estimates of the number of clock cycles
            for "typical" EV4 & EV5 hardware for the Level 1, 2 & 3 caches
            (also called Dcache, Scache, and Bcache), as well as to main
            memory.  Note that L3 is only valid for EV5.
  
  
  File: gcc.info,  Node: FR30 Options,  Next: FRV Options,  Prev: DEC Alpha Options,  Up: Submodel Options
  
*************** File: gcc.info,  Node: FR30 Options,  Ne
*** 14375,14607 ****
  
  These options are defined specifically for the FR30 port.
  
! `-msmall-model'
       Use the small address space model.  This can produce smaller code,
       but it does assume that all symbolic values and addresses fit into
       a 20-bit range.
  
! `-mno-lsim'
       Assume that runtime support has been provided and so there is no
!      need to include the simulator library (`libsim.a') on the linker
       command line.
  
- 
  
  File: gcc.info,  Node: FRV Options,  Next: GNU/Linux Options,  Prev: FR30 Options,  Up: Submodel Options
  
  3.17.13 FRV Options
  -------------------
  
! `-mgpr-32'
       Only use the first 32 general-purpose registers.
  
! `-mgpr-64'
       Use all 64 general-purpose registers.
  
! `-mfpr-32'
       Use only the first 32 floating-point registers.
  
! `-mfpr-64'
       Use all 64 floating-point registers.
  
! `-mhard-float'
       Use hardware instructions for floating-point operations.
  
! `-msoft-float'
       Use library routines for floating-point operations.
  
! `-malloc-cc'
       Dynamically allocate condition code registers.
  
! `-mfixed-cc'
       Do not try to dynamically allocate condition code registers, only
!      use `icc0' and `fcc0'.
  
- `-mdword'
       Change ABI to use double word insns.
  
! `-mno-dword'
       Do not use double word instructions.
  
! `-mdouble'
       Use floating-point double instructions.
  
! `-mno-double'
       Do not use floating-point double instructions.
  
! `-mmedia'
       Use media instructions.
  
! `-mno-media'
       Do not use media instructions.
  
! `-mmuladd'
       Use multiply and add/subtract instructions.
  
! `-mno-muladd'
       Do not use multiply and add/subtract instructions.
  
! `-mfdpic'
       Select the FDPIC ABI, which uses function descriptors to represent
       pointers to functions.  Without any PIC/PIE-related options, it
!      implies `-fPIE'.  With `-fpic' or `-fpie', it assumes GOT entries
!      and small data are within a 12-bit range from the GOT base
!      address; with `-fPIC' or `-fPIE', GOT offsets are computed with 32
!      bits.  With a `bfin-elf' target, this option implies `-msim'.
  
- `-minline-plt'
       Enable inlining of PLT entries in function calls to functions that
!      are not known to bind locally.  It has no effect without `-mfdpic'.
       It's enabled by default if optimizing for speed and compiling for
!      shared libraries (i.e., `-fPIC' or `-fpic'), or when an
!      optimization option such as `-O3' or above is present in the
       command line.
  
! `-mTLS'
       Assume a large TLS segment when generating thread-local code.
  
! `-mtls'
       Do not assume a large TLS segment when generating thread-local
       code.
  
! `-mgprel-ro'
!      Enable the use of `GPREL' relocations in the FDPIC ABI for data
       that is known to be in read-only sections.  It's enabled by
!      default, except for `-fpic' or `-fpie': even though it may help
       make the global offset table smaller, it trades 1 instruction for
!      4.  With `-fPIC' or `-fPIE', it trades 3 instructions for 4, one
!      of which may be shared by multiple symbols, and it avoids the need
!      for a GOT entry for the referenced symbol, so it's more likely to
!      be a win.  If it is not, `-mno-gprel-ro' can be used to disable it.
  
- `-multilib-library-pic'
       Link with the (library, not FD) pic libraries.  It's implied by
!      `-mlibrary-pic', as well as by `-fPIC' and `-fpic' without
!      `-mfdpic'.  You should never have to use it explicitly.
  
- `-mlinked-fp'
       Follow the EABI requirement of always creating a frame pointer
       whenever a stack frame is allocated.  This option is enabled by
!      default and can be disabled with `-mno-linked-fp'.
  
- `-mlong-calls'
       Use indirect addressing to call functions outside the current
       compilation unit.  This allows the functions to be placed anywhere
       within the 32-bit address space.
  
! `-malign-labels'
       Try to align labels to an 8-byte boundary by inserting NOPs into
       the previous packet.  This option only has an effect when VLIW
       packing is enabled.  It doesn't create new packets; it merely adds
       NOPs to existing ones.
  
! `-mlibrary-pic'
       Generate position-independent EABI code.
  
! `-macc-4'
       Use only the first four media accumulator registers.
  
! `-macc-8'
       Use all eight media accumulator registers.
  
! `-mpack'
       Pack VLIW instructions.
  
! `-mno-pack'
       Do not pack VLIW instructions.
  
! `-mno-eflags'
       Do not mark ABI switches in e_flags.
  
! `-mcond-move'
       Enable the use of conditional-move instructions (default).
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
- `-mno-cond-move'
       Disable the use of conditional-move instructions.
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
- `-mscc'
       Enable the use of conditional set instructions (default).
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
- `-mno-scc'
       Disable the use of conditional set instructions.
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
- `-mcond-exec'
       Enable the use of conditional execution (default).
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
- `-mno-cond-exec'
       Disable the use of conditional execution.
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
- `-mvliw-branch'
       Run a pass to pack branches into VLIW instructions (default).
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
- `-mno-vliw-branch'
       Do not run a pass to pack branches into VLIW instructions.
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
! `-mmulti-cond-exec'
!      Enable optimization of `&&' and `||' in conditional execution
       (default).
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
! `-mno-multi-cond-exec'
!      Disable optimization of `&&' and `||' in conditional execution.
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
- `-mnested-cond-exec'
       Enable nested conditional execution optimizations (default).
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
- `-mno-nested-cond-exec'
       Disable nested conditional execution optimizations.
  
!      This switch is mainly for debugging the compiler and will likely
!      be removed in a future version.
  
! `-moptimize-membar'
!      This switch removes redundant `membar' instructions from the
       compiler-generated code.  It is enabled by default.
  
! `-mno-optimize-membar'
!      This switch disables the automatic removal of redundant `membar'
       instructions from the generated code.
  
! `-mtomcat-stats'
       Cause gas to print out tomcat statistics.
  
! `-mcpu=CPU'
!      Select the processor type for which to generate code.  Possible
!      values are `frv', `fr550', `tomcat', `fr500', `fr450', `fr405',
!      `fr400', `fr300' and `simple'.
  
  
  
  File: gcc.info,  Node: GNU/Linux Options,  Next: H8/300 Options,  Prev: FRV Options,  Up: Submodel Options
--- 14283,14560 ----
  
  These options are defined specifically for the FR30 port.
  
! '-msmall-model'
       Use the small address space model.  This can produce smaller code,
       but it does assume that all symbolic values and addresses fit into
       a 20-bit range.
  
! '-mno-lsim'
       Assume that runtime support has been provided and so there is no
!      need to include the simulator library ('libsim.a') on the linker
       command line.
  
  
  File: gcc.info,  Node: FRV Options,  Next: GNU/Linux Options,  Prev: FR30 Options,  Up: Submodel Options
  
  3.17.13 FRV Options
  -------------------
  
! '-mgpr-32'
! 
       Only use the first 32 general-purpose registers.
  
! '-mgpr-64'
! 
       Use all 64 general-purpose registers.
  
! '-mfpr-32'
! 
       Use only the first 32 floating-point registers.
  
! '-mfpr-64'
! 
       Use all 64 floating-point registers.
  
! '-mhard-float'
! 
       Use hardware instructions for floating-point operations.
  
! '-msoft-float'
! 
       Use library routines for floating-point operations.
  
! '-malloc-cc'
! 
       Dynamically allocate condition code registers.
  
! '-mfixed-cc'
! 
       Do not try to dynamically allocate condition code registers, only
!      use 'icc0' and 'fcc0'.
! 
! '-mdword'
  
       Change ABI to use double word insns.
  
! '-mno-dword'
! 
       Do not use double word instructions.
  
! '-mdouble'
! 
       Use floating-point double instructions.
  
! '-mno-double'
! 
       Do not use floating-point double instructions.
  
! '-mmedia'
! 
       Use media instructions.
  
! '-mno-media'
! 
       Do not use media instructions.
  
! '-mmuladd'
! 
       Use multiply and add/subtract instructions.
  
! '-mno-muladd'
! 
       Do not use multiply and add/subtract instructions.
  
! '-mfdpic'
! 
       Select the FDPIC ABI, which uses function descriptors to represent
       pointers to functions.  Without any PIC/PIE-related options, it
!      implies '-fPIE'.  With '-fpic' or '-fpie', it assumes GOT entries
!      and small data are within a 12-bit range from the GOT base address;
!      with '-fPIC' or '-fPIE', GOT offsets are computed with 32 bits.
!      With a 'bfin-elf' target, this option implies '-msim'.
! 
! '-minline-plt'
  
       Enable inlining of PLT entries in function calls to functions that
!      are not known to bind locally.  It has no effect without '-mfdpic'.
       It's enabled by default if optimizing for speed and compiling for
!      shared libraries (i.e., '-fPIC' or '-fpic'), or when an
!      optimization option such as '-O3' or above is present in the
       command line.
  
! '-mTLS'
! 
       Assume a large TLS segment when generating thread-local code.
  
! '-mtls'
! 
       Do not assume a large TLS segment when generating thread-local
       code.
  
! '-mgprel-ro'
! 
!      Enable the use of 'GPREL' relocations in the FDPIC ABI for data
       that is known to be in read-only sections.  It's enabled by
!      default, except for '-fpic' or '-fpie': even though it may help
       make the global offset table smaller, it trades 1 instruction for
!      4.  With '-fPIC' or '-fPIE', it trades 3 instructions for 4, one of
!      which may be shared by multiple symbols, and it avoids the need for
!      a GOT entry for the referenced symbol, so it's more likely to be a
!      win.  If it is not, '-mno-gprel-ro' can be used to disable it.
! 
! '-multilib-library-pic'
  
       Link with the (library, not FD) pic libraries.  It's implied by
!      '-mlibrary-pic', as well as by '-fPIC' and '-fpic' without
!      '-mfdpic'.  You should never have to use it explicitly.
! 
! '-mlinked-fp'
  
       Follow the EABI requirement of always creating a frame pointer
       whenever a stack frame is allocated.  This option is enabled by
!      default and can be disabled with '-mno-linked-fp'.
! 
! '-mlong-calls'
  
       Use indirect addressing to call functions outside the current
       compilation unit.  This allows the functions to be placed anywhere
       within the 32-bit address space.
  
! '-malign-labels'
! 
       Try to align labels to an 8-byte boundary by inserting NOPs into
       the previous packet.  This option only has an effect when VLIW
       packing is enabled.  It doesn't create new packets; it merely adds
       NOPs to existing ones.
  
! '-mlibrary-pic'
! 
       Generate position-independent EABI code.
  
! '-macc-4'
! 
       Use only the first four media accumulator registers.
  
! '-macc-8'
! 
       Use all eight media accumulator registers.
  
! '-mpack'
! 
       Pack VLIW instructions.
  
! '-mno-pack'
! 
       Do not pack VLIW instructions.
  
! '-mno-eflags'
! 
       Do not mark ABI switches in e_flags.
  
! '-mcond-move'
! 
       Enable the use of conditional-move instructions (default).
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
! 
! '-mno-cond-move'
  
       Disable the use of conditional-move instructions.
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
! 
! '-mscc'
  
       Enable the use of conditional set instructions (default).
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
! 
! '-mno-scc'
  
       Disable the use of conditional set instructions.
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
! 
! '-mcond-exec'
  
       Enable the use of conditional execution (default).
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
! 
! '-mno-cond-exec'
  
       Disable the use of conditional execution.
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
! 
! '-mvliw-branch'
  
       Run a pass to pack branches into VLIW instructions (default).
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
! 
! '-mno-vliw-branch'
  
       Do not run a pass to pack branches into VLIW instructions.
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
  
! '-mmulti-cond-exec'
! 
!      Enable optimization of '&&' and '||' in conditional execution
       (default).
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
  
! '-mno-multi-cond-exec'
  
!      Disable optimization of '&&' and '||' in conditional execution.
! 
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
! 
! '-mnested-cond-exec'
  
       Enable nested conditional execution optimizations (default).
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
! 
! '-mno-nested-cond-exec'
  
       Disable nested conditional execution optimizations.
  
!      This switch is mainly for debugging the compiler and will likely be
!      removed in a future version.
  
! '-moptimize-membar'
! 
!      This switch removes redundant 'membar' instructions from the
       compiler-generated code.  It is enabled by default.
  
! '-mno-optimize-membar'
! 
!      This switch disables the automatic removal of redundant 'membar'
       instructions from the generated code.
  
! '-mtomcat-stats'
! 
       Cause gas to print out tomcat statistics.
  
! '-mcpu=CPU'
  
+      Select the processor type for which to generate code.  Possible
+      values are 'frv', 'fr550', 'tomcat', 'fr500', 'fr450', 'fr405',
+      'fr400', 'fr300' and 'simple'.
  
  
  File: gcc.info,  Node: GNU/Linux Options,  Next: H8/300 Options,  Prev: FRV Options,  Up: Submodel Options
*************** File: gcc.info,  Node: GNU/Linux Options
*** 14609,14691 ****
  3.17.14 GNU/Linux Options
  -------------------------
  
! These `-m' options are defined for GNU/Linux targets:
  
! `-mglibc'
       Use the GNU C library.  This is the default except on
!      `*-*-linux-*uclibc*' and `*-*-linux-*android*' targets.
  
! `-muclibc'
!      Use uClibc C library.  This is the default on `*-*-linux-*uclibc*'
       targets.
  
! `-mbionic'
!      Use Bionic C library.  This is the default on
!      `*-*-linux-*android*' targets.
  
! `-mandroid'
!      Compile code compatible with Android platform.  This is the
!      default on `*-*-linux-*android*' targets.
  
!      When compiling, this option enables `-mbionic', `-fPIC',
!      `-fno-exceptions' and `-fno-rtti' by default.  When linking, this
       option makes the GCC driver pass Android-specific options to the
       linker.  Finally, this option causes the preprocessor macro
!      `__ANDROID__' to be defined.
  
! `-tno-android-cc'
!      Disable compilation effects of `-mandroid', i.e., do not enable
!      `-mbionic', `-fPIC', `-fno-exceptions' and `-fno-rtti' by default.
  
! `-tno-android-ld'
!      Disable linking effects of `-mandroid', i.e., pass standard Linux
       linking options to the linker.
  
- 
  
  File: gcc.info,  Node: H8/300 Options,  Next: HPPA Options,  Prev: GNU/Linux Options,  Up: Submodel Options
  
  3.17.15 H8/300 Options
  ----------------------
  
! These `-m' options are defined for the H8/300 implementations:
  
! `-mrelax'
       Shorten some address references at link time, when possible; uses
!      the linker option `-relax'.  *Note `ld' and the H8/300:
!      (ld)H8/300, for a fuller description.
  
! `-mh'
       Generate code for the H8/300H.
  
! `-ms'
       Generate code for the H8S.
  
! `-mn'
       Generate code for the H8S and H8/300H in the normal mode.  This
!      switch must be used either with `-mh' or `-ms'.
  
! `-ms2600'
       Generate code for the H8S/2600.  This switch must be used with
!      `-ms'.
  
! `-mexr'
       Extended registers are stored on stack before execution of function
!      with monitor attribute. Default option is `-mexr'.  This option is
       valid only for H8S targets.
  
! `-mno-exr'
       Extended registers are not stored on stack before execution of
!      function with monitor attribute. Default option is `-mno-exr'.
       This option is valid only for H8S targets.
  
! `-mint32'
!      Make `int' data 32 bits by default.
  
! `-malign-300'
       On the H8/300H and H8S, use the same alignment rules as for the
       H8/300.  The default for the H8/300H and H8S is to align longs and
!      floats on 4-byte boundaries.  `-malign-300' causes them to be
       aligned on 2-byte boundaries.  This option has no effect on the
       H8/300.
  
--- 14562,14643 ----
  3.17.14 GNU/Linux Options
  -------------------------
  
! These '-m' options are defined for GNU/Linux targets:
  
! '-mglibc'
       Use the GNU C library.  This is the default except on
!      '*-*-linux-*uclibc*' and '*-*-linux-*android*' targets.
  
! '-muclibc'
!      Use uClibc C library.  This is the default on '*-*-linux-*uclibc*'
       targets.
  
! '-mbionic'
!      Use Bionic C library.  This is the default on '*-*-linux-*android*'
!      targets.
  
! '-mandroid'
!      Compile code compatible with Android platform.  This is the default
!      on '*-*-linux-*android*' targets.
  
!      When compiling, this option enables '-mbionic', '-fPIC',
!      '-fno-exceptions' and '-fno-rtti' by default.  When linking, this
       option makes the GCC driver pass Android-specific options to the
       linker.  Finally, this option causes the preprocessor macro
!      '__ANDROID__' to be defined.
  
! '-tno-android-cc'
!      Disable compilation effects of '-mandroid', i.e., do not enable
!      '-mbionic', '-fPIC', '-fno-exceptions' and '-fno-rtti' by default.
  
! '-tno-android-ld'
!      Disable linking effects of '-mandroid', i.e., pass standard Linux
       linking options to the linker.
  
  
  File: gcc.info,  Node: H8/300 Options,  Next: HPPA Options,  Prev: GNU/Linux Options,  Up: Submodel Options
  
  3.17.15 H8/300 Options
  ----------------------
  
! These '-m' options are defined for the H8/300 implementations:
  
! '-mrelax'
       Shorten some address references at link time, when possible; uses
!      the linker option '-relax'.  *Note 'ld' and the H8/300: (ld)H8/300,
!      for a fuller description.
  
! '-mh'
       Generate code for the H8/300H.
  
! '-ms'
       Generate code for the H8S.
  
! '-mn'
       Generate code for the H8S and H8/300H in the normal mode.  This
!      switch must be used either with '-mh' or '-ms'.
  
! '-ms2600'
       Generate code for the H8S/2600.  This switch must be used with
!      '-ms'.
  
! '-mexr'
       Extended registers are stored on stack before execution of function
!      with monitor attribute.  Default option is '-mexr'.  This option is
       valid only for H8S targets.
  
! '-mno-exr'
       Extended registers are not stored on stack before execution of
!      function with monitor attribute.  Default option is '-mno-exr'.
       This option is valid only for H8S targets.
  
! '-mint32'
!      Make 'int' data 32 bits by default.
  
! '-malign-300'
       On the H8/300H and H8S, use the same alignment rules as for the
       H8/300.  The default for the H8/300H and H8S is to align longs and
!      floats on 4-byte boundaries.  '-malign-300' causes them to be
       aligned on 2-byte boundaries.  This option has no effect on the
       H8/300.
  
*************** File: gcc.info,  Node: HPPA Options,  Ne
*** 14695,14835 ****
  3.17.16 HPPA Options
  --------------------
  
! These `-m' options are defined for the HPPA family of computers:
  
! `-march=ARCHITECTURE-TYPE'
       Generate code for the specified architecture.  The choices for
!      ARCHITECTURE-TYPE are `1.0' for PA 1.0, `1.1' for PA 1.1, and
!      `2.0' for PA 2.0 processors.  Refer to `/usr/lib/sched.models' on
!      an HP-UX system to determine the proper architecture option for
!      your machine.  Code compiled for lower numbered architectures runs
!      on higher numbered architectures, but not the other way around.
  
! `-mpa-risc-1-0'
! `-mpa-risc-1-1'
! `-mpa-risc-2-0'
!      Synonyms for `-march=1.0', `-march=1.1', and `-march=2.0'
       respectively.
  
! `-mjump-in-delay'
       This option is ignored and provided for compatibility purposes
       only.
  
! `-mdisable-fpregs'
       Prevent floating-point registers from being used in any manner.
       This is necessary for compiling kernels that perform lazy context
       switching of floating-point registers.  If you use this option and
       attempt to perform floating-point operations, the compiler aborts.
  
! `-mdisable-indexing'
       Prevent the compiler from using indexing address modes.  This
       avoids some rather obscure problems when compiling MIG generated
       code under MACH.
  
! `-mno-space-regs'
!      Generate code that assumes the target has no space registers.
!      This allows GCC to generate faster indirect calls and use unscaled
!      index address modes.
  
       Such code is suitable for level 0 PA systems and kernels.
  
! `-mfast-indirect-calls'
       Generate code that assumes calls never cross space boundaries.
       This allows GCC to emit code that performs faster indirect calls.
  
       This option does not work in the presence of shared libraries or
       nested functions.
  
! `-mfixed-range=REGISTER-RANGE'
       Generate code treating the given register range as fixed registers.
       A fixed register is one that the register allocator cannot use.
       This is useful when compiling kernel code.  A register range is
       specified as two registers separated by a dash.  Multiple register
       ranges can be specified separated by a comma.
  
! `-mlong-load-store'
       Generate 3-instruction load and store sequences as sometimes
!      required by the HP-UX 10 linker.  This is equivalent to the `+k'
       option to the HP compilers.
  
! `-mportable-runtime'
       Use the portable calling conventions proposed by HP for ELF
       systems.
  
! `-mgas'
       Enable the use of assembler directives only GAS understands.
  
! `-mschedule=CPU-TYPE'
       Schedule code according to the constraints for the machine type
!      CPU-TYPE.  The choices for CPU-TYPE are `700' `7100', `7100LC',
!      `7200', `7300' and `8000'.  Refer to `/usr/lib/sched.models' on an
       HP-UX system to determine the proper scheduling option for your
!      machine.  The default scheduling is `8000'.
  
! `-mlinker-opt'
       Enable the optimization pass in the HP-UX linker.  Note this makes
!      symbolic debugging impossible.  It also triggers a bug in the
!      HP-UX 8 and HP-UX 9 linkers in which they give bogus error
!      messages when linking some programs.
  
! `-msoft-float'
       Generate output containing library calls for floating point.
       *Warning:* the requisite libraries are not available for all HPPA
!      targets.  Normally the facilities of the machine's usual C
!      compiler are used, but this cannot be done directly in
!      cross-compilation.  You must make your own arrangements to provide
!      suitable library functions for cross-compilation.
  
!      `-msoft-float' changes the calling convention in the output file;
       therefore, it is only useful if you compile _all_ of a program with
!      this option.  In particular, you need to compile `libgcc.a', the
!      library that comes with GCC, with `-msoft-float' in order for this
       to work.
  
! `-msio'
!      Generate the predefine, `_SIO', for server IO.  The default is
!      `-mwsio'.  This generates the predefines, `__hp9000s700',
!      `__hp9000s700__' and `_WSIO', for workstation IO.  These options
       are available under HP-UX and HI-UX.
  
! `-mgnu-ld'
!      Use options specific to GNU `ld'.  This passes `-shared' to `ld'
       when building a shared library.  It is the default when GCC is
       configured, explicitly or implicitly, with the GNU linker.  This
!      option does not affect which `ld' is called; it only changes what
!      parameters are passed to that `ld'.  The `ld' that is called is
!      determined by the `--with-ld' configure option, GCC's program
!      search path, and finally by the user's `PATH'.  The linker used by
!      GCC can be printed using `which `gcc -print-prog-name=ld`'.  This
       option is only available on the 64-bit HP-UX GCC, i.e. configured
!      with `hppa*64*-*-hpux*'.
  
! `-mhp-ld'
!      Use options specific to HP `ld'.  This passes `-b' to `ld' when
!      building a shared library and passes `+Accept TypeMismatch' to
!      `ld' on all links.  It is the default when GCC is configured,
!      explicitly or implicitly, with the HP linker.  This option does
!      not affect which `ld' is called; it only changes what parameters
!      are passed to that `ld'.  The `ld' that is called is determined by
!      the `--with-ld' configure option, GCC's program search path, and
!      finally by the user's `PATH'.  The linker used by GCC can be
!      printed using `which `gcc -print-prog-name=ld`'.  This option is
       only available on the 64-bit HP-UX GCC, i.e. configured with
!      `hppa*64*-*-hpux*'.
  
! `-mlong-calls'
       Generate code that uses long call sequences.  This ensures that a
       call is always able to reach linker generated stubs.  The default
!      is to generate long calls only when the distance from the call
!      site to the beginning of the function or translation unit, as the
!      case may be, exceeds a predefined limit set by the branch type
!      being used.  The limits for normal calls are 7,600,000 and 240,000
!      bytes, respectively for the PA 2.0 and PA 1.X architectures.
!      Sibcalls are always limited at 240,000 bytes.
  
       Distances are measured from the beginning of functions when using
!      the `-ffunction-sections' option, or when using the `-mgas' and
!      `-mno-portable-runtime' options together under HP-UX with the SOM
       linker.
  
       It is normally not desirable to use this option as it degrades
--- 14647,14787 ----
  3.17.16 HPPA Options
  --------------------
  
! These '-m' options are defined for the HPPA family of computers:
  
! '-march=ARCHITECTURE-TYPE'
       Generate code for the specified architecture.  The choices for
!      ARCHITECTURE-TYPE are '1.0' for PA 1.0, '1.1' for PA 1.1, and '2.0'
!      for PA 2.0 processors.  Refer to '/usr/lib/sched.models' on an
!      HP-UX system to determine the proper architecture option for your
!      machine.  Code compiled for lower numbered architectures runs on
!      higher numbered architectures, but not the other way around.
  
! '-mpa-risc-1-0'
! '-mpa-risc-1-1'
! '-mpa-risc-2-0'
!      Synonyms for '-march=1.0', '-march=1.1', and '-march=2.0'
       respectively.
  
! '-mjump-in-delay'
       This option is ignored and provided for compatibility purposes
       only.
  
! '-mdisable-fpregs'
       Prevent floating-point registers from being used in any manner.
       This is necessary for compiling kernels that perform lazy context
       switching of floating-point registers.  If you use this option and
       attempt to perform floating-point operations, the compiler aborts.
  
! '-mdisable-indexing'
       Prevent the compiler from using indexing address modes.  This
       avoids some rather obscure problems when compiling MIG generated
       code under MACH.
  
! '-mno-space-regs'
!      Generate code that assumes the target has no space registers.  This
!      allows GCC to generate faster indirect calls and use unscaled index
!      address modes.
  
       Such code is suitable for level 0 PA systems and kernels.
  
! '-mfast-indirect-calls'
       Generate code that assumes calls never cross space boundaries.
       This allows GCC to emit code that performs faster indirect calls.
  
       This option does not work in the presence of shared libraries or
       nested functions.
  
! '-mfixed-range=REGISTER-RANGE'
       Generate code treating the given register range as fixed registers.
       A fixed register is one that the register allocator cannot use.
       This is useful when compiling kernel code.  A register range is
       specified as two registers separated by a dash.  Multiple register
       ranges can be specified separated by a comma.
  
! '-mlong-load-store'
       Generate 3-instruction load and store sequences as sometimes
!      required by the HP-UX 10 linker.  This is equivalent to the '+k'
       option to the HP compilers.
  
! '-mportable-runtime'
       Use the portable calling conventions proposed by HP for ELF
       systems.
  
! '-mgas'
       Enable the use of assembler directives only GAS understands.
  
! '-mschedule=CPU-TYPE'
       Schedule code according to the constraints for the machine type
!      CPU-TYPE.  The choices for CPU-TYPE are '700' '7100', '7100LC',
!      '7200', '7300' and '8000'.  Refer to '/usr/lib/sched.models' on an
       HP-UX system to determine the proper scheduling option for your
!      machine.  The default scheduling is '8000'.
  
! '-mlinker-opt'
       Enable the optimization pass in the HP-UX linker.  Note this makes
!      symbolic debugging impossible.  It also triggers a bug in the HP-UX
!      8 and HP-UX 9 linkers in which they give bogus error messages when
!      linking some programs.
  
! '-msoft-float'
       Generate output containing library calls for floating point.
       *Warning:* the requisite libraries are not available for all HPPA
!      targets.  Normally the facilities of the machine's usual C compiler
!      are used, but this cannot be done directly in cross-compilation.
!      You must make your own arrangements to provide suitable library
!      functions for cross-compilation.
  
!      '-msoft-float' changes the calling convention in the output file;
       therefore, it is only useful if you compile _all_ of a program with
!      this option.  In particular, you need to compile 'libgcc.a', the
!      library that comes with GCC, with '-msoft-float' in order for this
       to work.
  
! '-msio'
!      Generate the predefine, '_SIO', for server IO.  The default is
!      '-mwsio'.  This generates the predefines, '__hp9000s700',
!      '__hp9000s700__' and '_WSIO', for workstation IO.  These options
       are available under HP-UX and HI-UX.
  
! '-mgnu-ld'
!      Use options specific to GNU 'ld'.  This passes '-shared' to 'ld'
       when building a shared library.  It is the default when GCC is
       configured, explicitly or implicitly, with the GNU linker.  This
!      option does not affect which 'ld' is called; it only changes what
!      parameters are passed to that 'ld'.  The 'ld' that is called is
!      determined by the '--with-ld' configure option, GCC's program
!      search path, and finally by the user's 'PATH'.  The linker used by
!      GCC can be printed using 'which `gcc -print-prog-name=ld`'.  This
       option is only available on the 64-bit HP-UX GCC, i.e. configured
!      with 'hppa*64*-*-hpux*'.
  
! '-mhp-ld'
!      Use options specific to HP 'ld'.  This passes '-b' to 'ld' when
!      building a shared library and passes '+Accept TypeMismatch' to 'ld'
!      on all links.  It is the default when GCC is configured, explicitly
!      or implicitly, with the HP linker.  This option does not affect
!      which 'ld' is called; it only changes what parameters are passed to
!      that 'ld'.  The 'ld' that is called is determined by the
!      '--with-ld' configure option, GCC's program search path, and
!      finally by the user's 'PATH'.  The linker used by GCC can be
!      printed using 'which `gcc -print-prog-name=ld`'.  This option is
       only available on the 64-bit HP-UX GCC, i.e. configured with
!      'hppa*64*-*-hpux*'.
  
! '-mlong-calls'
       Generate code that uses long call sequences.  This ensures that a
       call is always able to reach linker generated stubs.  The default
!      is to generate long calls only when the distance from the call site
!      to the beginning of the function or translation unit, as the case
!      may be, exceeds a predefined limit set by the branch type being
!      used.  The limits for normal calls are 7,600,000 and 240,000 bytes,
!      respectively for the PA 2.0 and PA 1.X architectures.  Sibcalls are
!      always limited at 240,000 bytes.
  
       Distances are measured from the beginning of functions when using
!      the '-ffunction-sections' option, or when using the '-mgas' and
!      '-mno-portable-runtime' options together under HP-UX with the SOM
       linker.
  
       It is normally not desirable to use this option as it degrades
*************** These `-m' options are defined for the H
*** 14843,14892 ****
       However, an indirect call is used on 32-bit ELF systems in pic code
       and it is quite long.
  
! `-munix=UNIX-STD'
       Generate compiler predefines and select a startfile for the
!      specified UNIX standard.  The choices for UNIX-STD are `93', `95'
!      and `98'.  `93' is supported on all HP-UX versions.  `95' is
!      available on HP-UX 10.10 and later.  `98' is available on HP-UX
!      11.11 and later.  The default values are `93' for HP-UX 10.00,
!      `95' for HP-UX 10.10 though to 11.00, and `98' for HP-UX 11.11 and
       later.
  
!      `-munix=93' provides the same predefines as GCC 3.3 and 3.4.
!      `-munix=95' provides additional predefines for `XOPEN_UNIX' and
!      `_XOPEN_SOURCE_EXTENDED', and the startfile `unix95.o'.
!      `-munix=98' provides additional predefines for `_XOPEN_UNIX',
!      `_XOPEN_SOURCE_EXTENDED', `_INCLUDE__STDC_A1_SOURCE' and
!      `_INCLUDE_XOPEN_SOURCE_500', and the startfile `unix98.o'.
  
       It is _important_ to note that this option changes the interfaces
       for various library routines.  It also affects the operational
!      behavior of the C library.  Thus, _extreme_ care is needed in
!      using this option.
  
       Library code that is intended to operate with more than one UNIX
       standard must test, set and restore the variable
!      `__xpg4_extended_mask' as appropriate.  Most GNU software doesn't
       provide this capability.
  
! `-nolibdld'
       Suppress the generation of link options to search libdld.sl when
!      the `-static' option is specified on HP-UX 10 and later.
  
! `-static'
       The HP-UX implementation of setlocale in libc has a dependency on
       libdld.sl.  There isn't an archive version of libdld.sl.  Thus,
!      when the `-static' option is specified, special link options are
       needed to resolve this dependency.
  
       On HP-UX 10 and later, the GCC driver adds the necessary options to
!      link with libdld.sl when the `-static' option is specified.  This
!      causes the resulting binary to be dynamic.  On the 64-bit port,
!      the linkers generate dynamic binaries by default in any case.  The
!      `-nolibdld' option can be used to prevent the GCC driver from
       adding these link options.
  
! `-threads'
       Add support for multithreading with the "dce thread" library under
       HP-UX.  This option sets flags for both the preprocessor and
       linker.
--- 14795,14844 ----
       However, an indirect call is used on 32-bit ELF systems in pic code
       and it is quite long.
  
! '-munix=UNIX-STD'
       Generate compiler predefines and select a startfile for the
!      specified UNIX standard.  The choices for UNIX-STD are '93', '95'
!      and '98'.  '93' is supported on all HP-UX versions.  '95' is
!      available on HP-UX 10.10 and later.  '98' is available on HP-UX
!      11.11 and later.  The default values are '93' for HP-UX 10.00, '95'
!      for HP-UX 10.10 though to 11.00, and '98' for HP-UX 11.11 and
       later.
  
!      '-munix=93' provides the same predefines as GCC 3.3 and 3.4.
!      '-munix=95' provides additional predefines for 'XOPEN_UNIX' and
!      '_XOPEN_SOURCE_EXTENDED', and the startfile 'unix95.o'.
!      '-munix=98' provides additional predefines for '_XOPEN_UNIX',
!      '_XOPEN_SOURCE_EXTENDED', '_INCLUDE__STDC_A1_SOURCE' and
!      '_INCLUDE_XOPEN_SOURCE_500', and the startfile 'unix98.o'.
  
       It is _important_ to note that this option changes the interfaces
       for various library routines.  It also affects the operational
!      behavior of the C library.  Thus, _extreme_ care is needed in using
!      this option.
  
       Library code that is intended to operate with more than one UNIX
       standard must test, set and restore the variable
!      '__xpg4_extended_mask' as appropriate.  Most GNU software doesn't
       provide this capability.
  
! '-nolibdld'
       Suppress the generation of link options to search libdld.sl when
!      the '-static' option is specified on HP-UX 10 and later.
  
! '-static'
       The HP-UX implementation of setlocale in libc has a dependency on
       libdld.sl.  There isn't an archive version of libdld.sl.  Thus,
!      when the '-static' option is specified, special link options are
       needed to resolve this dependency.
  
       On HP-UX 10 and later, the GCC driver adds the necessary options to
!      link with libdld.sl when the '-static' option is specified.  This
!      causes the resulting binary to be dynamic.  On the 64-bit port, the
!      linkers generate dynamic binaries by default in any case.  The
!      '-nolibdld' option can be used to prevent the GCC driver from
       adding these link options.
  
! '-threads'
       Add support for multithreading with the "dce thread" library under
       HP-UX.  This option sets flags for both the preprocessor and
       linker.
*************** File: gcc.info,  Node: IA-64 Options,  N
*** 14897,15161 ****
  3.17.17 IA-64 Options
  ---------------------
  
! These are the `-m' options defined for the Intel IA-64 architecture.
  
! `-mbig-endian'
       Generate code for a big-endian target.  This is the default for
       HP-UX.
  
! `-mlittle-endian'
       Generate code for a little-endian target.  This is the default for
       AIX5 and GNU/Linux.
  
! `-mgnu-as'
! `-mno-gnu-as'
       Generate (or don't) code for the GNU assembler.  This is the
       default.
  
! `-mgnu-ld'
! `-mno-gnu-ld'
       Generate (or don't) code for the GNU linker.  This is the default.
  
! `-mno-pic'
       Generate code that does not use a global pointer register.  The
       result is not position independent code, and violates the IA-64
       ABI.
  
! `-mvolatile-asm-stop'
! `-mno-volatile-asm-stop'
       Generate (or don't) a stop bit immediately before and after
       volatile asm statements.
  
! `-mregister-names'
! `-mno-register-names'
!      Generate (or don't) `in', `loc', and `out' register names for the
       stacked registers.  This may make assembler output more readable.
  
! `-mno-sdata'
! `-msdata'
       Disable (or enable) optimizations that use the small data section.
       This may be useful for working around optimizer bugs.
  
! `-mconstant-gp'
       Generate code that uses a single constant global pointer value.
       This is useful when compiling kernel code.
  
! `-mauto-pic'
       Generate code that is self-relocatable.  This implies
!      `-mconstant-gp'.  This is useful when compiling firmware code.
  
! `-minline-float-divide-min-latency'
!      Generate code for inline divides of floating-point values using
!      the minimum latency algorithm.
  
! `-minline-float-divide-max-throughput'
!      Generate code for inline divides of floating-point values using
!      the maximum throughput algorithm.
  
! `-mno-inline-float-divide'
       Do not generate inline code for divides of floating-point values.
  
! `-minline-int-divide-min-latency'
       Generate code for inline divides of integer values using the
       minimum latency algorithm.
  
! `-minline-int-divide-max-throughput'
       Generate code for inline divides of integer values using the
       maximum throughput algorithm.
  
! `-mno-inline-int-divide'
       Do not generate inline code for divides of integer values.
  
! `-minline-sqrt-min-latency'
       Generate code for inline square roots using the minimum latency
       algorithm.
  
! `-minline-sqrt-max-throughput'
       Generate code for inline square roots using the maximum throughput
       algorithm.
  
! `-mno-inline-sqrt'
!      Do not generate inline code for `sqrt'.
  
! `-mfused-madd'
! `-mno-fused-madd'
       Do (don't) generate code that uses the fused multiply/add or
       multiply/subtract instructions.  The default is to use these
       instructions.
  
! `-mno-dwarf2-asm'
! `-mdwarf2-asm'
       Don't (or do) generate assembler code for the DWARF 2 line number
       debugging info.  This may be useful when not using the GNU
       assembler.
  
! `-mearly-stop-bits'
! `-mno-early-stop-bits'
       Allow stop bits to be placed earlier than immediately preceding the
       instruction that triggered the stop bit.  This can improve
       instruction scheduling, but does not always do so.
  
! `-mfixed-range=REGISTER-RANGE'
       Generate code treating the given register range as fixed registers.
       A fixed register is one that the register allocator cannot use.
       This is useful when compiling kernel code.  A register range is
       specified as two registers separated by a dash.  Multiple register
       ranges can be specified separated by a comma.
  
! `-mtls-size=TLS-SIZE'
       Specify bit size of immediate TLS offsets.  Valid values are 14,
       22, and 64.
  
! `-mtune=CPU-TYPE'
       Tune the instruction scheduling for a particular CPU, Valid values
!      are `itanium', `itanium1', `merced', `itanium2', and `mckinley'.
  
! `-milp32'
! `-mlp64'
       Generate code for a 32-bit or 64-bit environment.  The 32-bit
       environment sets int, long and pointer to 32 bits.  The 64-bit
       environment sets int to 32 bits and long and pointer to 64 bits.
       These are HP-UX specific flags.
  
! `-mno-sched-br-data-spec'
! `-msched-br-data-spec'
       (Dis/En)able data speculative scheduling before reload.  This
!      results in generation of `ld.a' instructions and the corresponding
!      check instructions (`ld.c' / `chk.a').  The default is 'disable'.
  
! `-msched-ar-data-spec'
! `-mno-sched-ar-data-spec'
       (En/Dis)able data speculative scheduling after reload.  This
!      results in generation of `ld.a' instructions and the corresponding
!      check instructions (`ld.c' / `chk.a').  The default is 'enable'.
  
! `-mno-sched-control-spec'
! `-msched-control-spec'
       (Dis/En)able control speculative scheduling.  This feature is
!      available only during region scheduling (i.e. before reload).
!      This results in generation of the `ld.s' instructions and the
!      corresponding check instructions `chk.s'.  The default is
       'disable'.
  
! `-msched-br-in-data-spec'
! `-mno-sched-br-in-data-spec'
       (En/Dis)able speculative scheduling of the instructions that are
       dependent on the data speculative loads before reload.  This is
!      effective only with `-msched-br-data-spec' enabled.  The default
!      is 'enable'.
  
! `-msched-ar-in-data-spec'
! `-mno-sched-ar-in-data-spec'
       (En/Dis)able speculative scheduling of the instructions that are
       dependent on the data speculative loads after reload.  This is
!      effective only with `-msched-ar-data-spec' enabled.  The default
!      is 'enable'.
  
! `-msched-in-control-spec'
! `-mno-sched-in-control-spec'
       (En/Dis)able speculative scheduling of the instructions that are
!      dependent on the control speculative loads.  This is effective
!      only with `-msched-control-spec' enabled.  The default is 'enable'.
  
! `-mno-sched-prefer-non-data-spec-insns'
! `-msched-prefer-non-data-spec-insns'
       If enabled, data-speculative instructions are chosen for schedule
       only if there are no other choices at the moment.  This makes the
!      use of the data speculation much more conservative.  The default
!      is 'disable'.
  
! `-mno-sched-prefer-non-control-spec-insns'
! `-msched-prefer-non-control-spec-insns'
       If enabled, control-speculative instructions are chosen for
       schedule only if there are no other choices at the moment.  This
       makes the use of the control speculation much more conservative.
       The default is 'disable'.
  
! `-mno-sched-count-spec-in-critical-path'
! `-msched-count-spec-in-critical-path'
       If enabled, speculative dependencies are considered during
       computation of the instructions priorities.  This makes the use of
       the speculation a bit more conservative.  The default is 'disable'.
  
! `-msched-spec-ldc'
       Use a simple data speculation check.  This option is on by default.
  
! `-msched-control-spec-ldc'
       Use a simple check for control speculation.  This option is on by
       default.
  
! `-msched-stop-bits-after-every-cycle'
!      Place a stop bit after every cycle when scheduling.  This option
!      is on by default.
  
! `-msched-fp-mem-deps-zero-cost'
!      Assume that floating-point stores and loads are not likely to
!      cause a conflict when placed into the same instruction group.
!      This option is disabled by default.
  
! `-msel-sched-dont-check-control-spec'
       Generate checks for control speculation in selective scheduling.
       This flag is disabled by default.
  
! `-msched-max-memory-insns=MAX-INSNS'
       Limit on the number of memory insns per instruction group, giving
!      lower priority to subsequent memory insns attempting to schedule
!      in the same instruction group. Frequently useful to prevent cache
       bank conflicts.  The default value is 1.
  
! `-msched-max-memory-insns-hard-limit'
!      Makes the limit specified by `msched-max-memory-insns' a hard
       limit, disallowing more than that number in an instruction group.
       Otherwise, the limit is "soft", meaning that non-memory operations
       are preferred when the limit is reached, but memory operations may
       still be scheduled.
  
- 
  
  File: gcc.info,  Node: LM32 Options,  Next: M32C Options,  Prev: IA-64 Options,  Up: Submodel Options
  
  3.17.18 LM32 Options
  --------------------
  
! These `-m' options are defined for the LatticeMico32 architecture:
  
! `-mbarrel-shift-enabled'
       Enable barrel-shift instructions.
  
! `-mdivide-enabled'
       Enable divide and modulus instructions.
  
! `-mmultiply-enabled'
       Enable multiply instructions.
  
! `-msign-extend-enabled'
       Enable sign extend instructions.
  
! `-muser-enabled'
       Enable user-defined instructions.
  
- 
  
  File: gcc.info,  Node: M32C Options,  Next: M32R/D Options,  Prev: LM32 Options,  Up: Submodel Options
  
  3.17.19 M32C Options
  --------------------
  
! `-mcpu=NAME'
       Select the CPU for which code is generated.  NAME may be one of
!      `r8c' for the R8C/Tiny series, `m16c' for the M16C (up to /60)
!      series, `m32cm' for the M16C/80 series, or `m32c' for the M32C/80
       series.
  
! `-msim'
       Specifies that the program will be run on the simulator.  This
!      causes an alternate runtime library to be linked in which
!      supports, for example, file I/O.  You must not use this option
!      when generating programs that will run on real hardware; you must
       provide your own runtime library for whatever I/O functions are
       needed.
  
! `-memregs=NUMBER'
       Specifies the number of memory-based pseudo-registers GCC uses
       during code generation.  These pseudo-registers are used like real
       registers, so there is a tradeoff between GCC's ability to fit the
--- 14849,15111 ----
  3.17.17 IA-64 Options
  ---------------------
  
! These are the '-m' options defined for the Intel IA-64 architecture.
  
! '-mbig-endian'
       Generate code for a big-endian target.  This is the default for
       HP-UX.
  
! '-mlittle-endian'
       Generate code for a little-endian target.  This is the default for
       AIX5 and GNU/Linux.
  
! '-mgnu-as'
! '-mno-gnu-as'
       Generate (or don't) code for the GNU assembler.  This is the
       default.
  
! '-mgnu-ld'
! '-mno-gnu-ld'
       Generate (or don't) code for the GNU linker.  This is the default.
  
! '-mno-pic'
       Generate code that does not use a global pointer register.  The
       result is not position independent code, and violates the IA-64
       ABI.
  
! '-mvolatile-asm-stop'
! '-mno-volatile-asm-stop'
       Generate (or don't) a stop bit immediately before and after
       volatile asm statements.
  
! '-mregister-names'
! '-mno-register-names'
!      Generate (or don't) 'in', 'loc', and 'out' register names for the
       stacked registers.  This may make assembler output more readable.
  
! '-mno-sdata'
! '-msdata'
       Disable (or enable) optimizations that use the small data section.
       This may be useful for working around optimizer bugs.
  
! '-mconstant-gp'
       Generate code that uses a single constant global pointer value.
       This is useful when compiling kernel code.
  
! '-mauto-pic'
       Generate code that is self-relocatable.  This implies
!      '-mconstant-gp'.  This is useful when compiling firmware code.
  
! '-minline-float-divide-min-latency'
!      Generate code for inline divides of floating-point values using the
!      minimum latency algorithm.
  
! '-minline-float-divide-max-throughput'
!      Generate code for inline divides of floating-point values using the
!      maximum throughput algorithm.
  
! '-mno-inline-float-divide'
       Do not generate inline code for divides of floating-point values.
  
! '-minline-int-divide-min-latency'
       Generate code for inline divides of integer values using the
       minimum latency algorithm.
  
! '-minline-int-divide-max-throughput'
       Generate code for inline divides of integer values using the
       maximum throughput algorithm.
  
! '-mno-inline-int-divide'
       Do not generate inline code for divides of integer values.
  
! '-minline-sqrt-min-latency'
       Generate code for inline square roots using the minimum latency
       algorithm.
  
! '-minline-sqrt-max-throughput'
       Generate code for inline square roots using the maximum throughput
       algorithm.
  
! '-mno-inline-sqrt'
!      Do not generate inline code for 'sqrt'.
  
! '-mfused-madd'
! '-mno-fused-madd'
       Do (don't) generate code that uses the fused multiply/add or
       multiply/subtract instructions.  The default is to use these
       instructions.
  
! '-mno-dwarf2-asm'
! '-mdwarf2-asm'
       Don't (or do) generate assembler code for the DWARF 2 line number
       debugging info.  This may be useful when not using the GNU
       assembler.
  
! '-mearly-stop-bits'
! '-mno-early-stop-bits'
       Allow stop bits to be placed earlier than immediately preceding the
       instruction that triggered the stop bit.  This can improve
       instruction scheduling, but does not always do so.
  
! '-mfixed-range=REGISTER-RANGE'
       Generate code treating the given register range as fixed registers.
       A fixed register is one that the register allocator cannot use.
       This is useful when compiling kernel code.  A register range is
       specified as two registers separated by a dash.  Multiple register
       ranges can be specified separated by a comma.
  
! '-mtls-size=TLS-SIZE'
       Specify bit size of immediate TLS offsets.  Valid values are 14,
       22, and 64.
  
! '-mtune=CPU-TYPE'
       Tune the instruction scheduling for a particular CPU, Valid values
!      are 'itanium', 'itanium1', 'merced', 'itanium2', and 'mckinley'.
  
! '-milp32'
! '-mlp64'
       Generate code for a 32-bit or 64-bit environment.  The 32-bit
       environment sets int, long and pointer to 32 bits.  The 64-bit
       environment sets int to 32 bits and long and pointer to 64 bits.
       These are HP-UX specific flags.
  
! '-mno-sched-br-data-spec'
! '-msched-br-data-spec'
       (Dis/En)able data speculative scheduling before reload.  This
!      results in generation of 'ld.a' instructions and the corresponding
!      check instructions ('ld.c' / 'chk.a').  The default is 'disable'.
  
! '-msched-ar-data-spec'
! '-mno-sched-ar-data-spec'
       (En/Dis)able data speculative scheduling after reload.  This
!      results in generation of 'ld.a' instructions and the corresponding
!      check instructions ('ld.c' / 'chk.a').  The default is 'enable'.
  
! '-mno-sched-control-spec'
! '-msched-control-spec'
       (Dis/En)able control speculative scheduling.  This feature is
!      available only during region scheduling (i.e. before reload).  This
!      results in generation of the 'ld.s' instructions and the
!      corresponding check instructions 'chk.s'.  The default is
       'disable'.
  
! '-msched-br-in-data-spec'
! '-mno-sched-br-in-data-spec'
       (En/Dis)able speculative scheduling of the instructions that are
       dependent on the data speculative loads before reload.  This is
!      effective only with '-msched-br-data-spec' enabled.  The default is
!      'enable'.
  
! '-msched-ar-in-data-spec'
! '-mno-sched-ar-in-data-spec'
       (En/Dis)able speculative scheduling of the instructions that are
       dependent on the data speculative loads after reload.  This is
!      effective only with '-msched-ar-data-spec' enabled.  The default is
!      'enable'.
  
! '-msched-in-control-spec'
! '-mno-sched-in-control-spec'
       (En/Dis)able speculative scheduling of the instructions that are
!      dependent on the control speculative loads.  This is effective only
!      with '-msched-control-spec' enabled.  The default is 'enable'.
  
! '-mno-sched-prefer-non-data-spec-insns'
! '-msched-prefer-non-data-spec-insns'
       If enabled, data-speculative instructions are chosen for schedule
       only if there are no other choices at the moment.  This makes the
!      use of the data speculation much more conservative.  The default is
!      'disable'.
  
! '-mno-sched-prefer-non-control-spec-insns'
! '-msched-prefer-non-control-spec-insns'
       If enabled, control-speculative instructions are chosen for
       schedule only if there are no other choices at the moment.  This
       makes the use of the control speculation much more conservative.
       The default is 'disable'.
  
! '-mno-sched-count-spec-in-critical-path'
! '-msched-count-spec-in-critical-path'
       If enabled, speculative dependencies are considered during
       computation of the instructions priorities.  This makes the use of
       the speculation a bit more conservative.  The default is 'disable'.
  
! '-msched-spec-ldc'
       Use a simple data speculation check.  This option is on by default.
  
! '-msched-control-spec-ldc'
       Use a simple check for control speculation.  This option is on by
       default.
  
! '-msched-stop-bits-after-every-cycle'
!      Place a stop bit after every cycle when scheduling.  This option is
!      on by default.
  
! '-msched-fp-mem-deps-zero-cost'
!      Assume that floating-point stores and loads are not likely to cause
!      a conflict when placed into the same instruction group.  This
!      option is disabled by default.
  
! '-msel-sched-dont-check-control-spec'
       Generate checks for control speculation in selective scheduling.
       This flag is disabled by default.
  
! '-msched-max-memory-insns=MAX-INSNS'
       Limit on the number of memory insns per instruction group, giving
!      lower priority to subsequent memory insns attempting to schedule in
!      the same instruction group.  Frequently useful to prevent cache
       bank conflicts.  The default value is 1.
  
! '-msched-max-memory-insns-hard-limit'
!      Makes the limit specified by 'msched-max-memory-insns' a hard
       limit, disallowing more than that number in an instruction group.
       Otherwise, the limit is "soft", meaning that non-memory operations
       are preferred when the limit is reached, but memory operations may
       still be scheduled.
  
  
  File: gcc.info,  Node: LM32 Options,  Next: M32C Options,  Prev: IA-64 Options,  Up: Submodel Options
  
  3.17.18 LM32 Options
  --------------------
  
! These '-m' options are defined for the LatticeMico32 architecture:
  
! '-mbarrel-shift-enabled'
       Enable barrel-shift instructions.
  
! '-mdivide-enabled'
       Enable divide and modulus instructions.
  
! '-mmultiply-enabled'
       Enable multiply instructions.
  
! '-msign-extend-enabled'
       Enable sign extend instructions.
  
! '-muser-enabled'
       Enable user-defined instructions.
  
  
  File: gcc.info,  Node: M32C Options,  Next: M32R/D Options,  Prev: LM32 Options,  Up: Submodel Options
  
  3.17.19 M32C Options
  --------------------
  
! '-mcpu=NAME'
       Select the CPU for which code is generated.  NAME may be one of
!      'r8c' for the R8C/Tiny series, 'm16c' for the M16C (up to /60)
!      series, 'm32cm' for the M16C/80 series, or 'm32c' for the M32C/80
       series.
  
! '-msim'
       Specifies that the program will be run on the simulator.  This
!      causes an alternate runtime library to be linked in which supports,
!      for example, file I/O.  You must not use this option when
!      generating programs that will run on real hardware; you must
       provide your own runtime library for whatever I/O functions are
       needed.
  
! '-memregs=NUMBER'
       Specifies the number of memory-based pseudo-registers GCC uses
       during code generation.  These pseudo-registers are used like real
       registers, so there is a tradeoff between GCC's ability to fit the
*************** File: gcc.info,  Node: M32C Options,  Ne
*** 15165,15514 ****
       that, you must not use this option with GCC's default runtime
       libraries.
  
- 
  
  File: gcc.info,  Node: M32R/D Options,  Next: M680x0 Options,  Prev: M32C Options,  Up: Submodel Options
  
  3.17.20 M32R/D Options
  ----------------------
  
! These `-m' options are defined for Renesas M32R/D architectures:
  
! `-m32r2'
       Generate code for the M32R/2.
  
! `-m32rx'
       Generate code for the M32R/X.
  
! `-m32r'
       Generate code for the M32R.  This is the default.
  
! `-mmodel=small'
       Assume all objects live in the lower 16MB of memory (so that their
!      addresses can be loaded with the `ld24' instruction), and assume
!      all subroutines are reachable with the `bl' instruction.  This is
       the default.
  
       The addressability of a particular object can be set with the
!      `model' attribute.
  
! `-mmodel=medium'
       Assume objects may be anywhere in the 32-bit address space (the
!      compiler generates `seth/add3' instructions to load their
!      addresses), and assume all subroutines are reachable with the `bl'
       instruction.
  
! `-mmodel=large'
       Assume objects may be anywhere in the 32-bit address space (the
!      compiler generates `seth/add3' instructions to load their
       addresses), and assume subroutines may not be reachable with the
!      `bl' instruction (the compiler generates the much slower
!      `seth/add3/jl' instruction sequence).
  
! `-msdata=none'
       Disable use of the small data area.  Variables are put into one of
!      `.data', `.bss', or `.rodata' (unless the `section' attribute has
       been specified).  This is the default.
  
!      The small data area consists of sections `.sdata' and `.sbss'.
       Objects may be explicitly put in the small data area with the
!      `section' attribute using one of these sections.
  
! `-msdata=sdata'
       Put small global and static data in the small data area, but do not
       generate special code to reference them.
  
! `-msdata=use'
       Put small global and static data in the small data area, and
       generate special instructions to reference them.
  
! `-G NUM'
       Put global and static objects less than or equal to NUM bytes into
       the small data or BSS sections instead of the normal data or BSS
!      sections.  The default value of NUM is 8.  The `-msdata' option
!      must be set to one of `sdata' or `use' for this option to have any
       effect.
  
!      All modules should be compiled with the same `-G NUM' value.
       Compiling with different values of NUM may or may not work; if it
       doesn't the linker gives an error message--incorrect code is not
       generated.
  
! `-mdebug'
       Makes the M32R-specific code in the compiler display some
       statistics that might help in debugging programs.
  
! `-malign-loops'
       Align all loops to a 32-byte boundary.
  
! `-mno-align-loops'
       Do not enforce a 32-byte alignment for loops.  This is the default.
  
! `-missue-rate=NUMBER'
       Issue NUMBER instructions per cycle.  NUMBER can only be 1 or 2.
  
! `-mbranch-cost=NUMBER'
       NUMBER can only be 1 or 2.  If it is 1 then branches are preferred
       over conditional code, if it is 2, then the opposite applies.
  
! `-mflush-trap=NUMBER'
       Specifies the trap number to use to flush the cache.  The default
       is 12.  Valid numbers are between 0 and 15 inclusive.
  
! `-mno-flush-trap'
       Specifies that the cache cannot be flushed by using a trap.
  
! `-mflush-func=NAME'
       Specifies the name of the operating system function to call to
!      flush the cache.  The default is `_flush_cache', but a function
       call is only used if a trap is not available.
  
! `-mno-flush-func'
       Indicates that there is no OS function for flushing the cache.
  
- 
  
  File: gcc.info,  Node: M680x0 Options,  Next: MCore Options,  Prev: M32R/D Options,  Up: Submodel Options
  
  3.17.21 M680x0 Options
  ----------------------
  
! These are the `-m' options defined for M680x0 and ColdFire processors.
  The default settings depend on which architecture was selected when the
  compiler was configured; the defaults for the most common choices are
  given below.
  
! `-march=ARCH'
       Generate code for a specific M680x0 or ColdFire instruction set
       architecture.  Permissible values of ARCH for M680x0 architectures
!      are: `68000', `68010', `68020', `68030', `68040', `68060' and
!      `cpu32'.  ColdFire architectures are selected according to
       Freescale's ISA classification and the permissible values are:
!      `isaa', `isaaplus', `isab' and `isac'.
  
!      GCC defines a macro `__mcfARCH__' whenever it is generating code
       for a ColdFire target.  The ARCH in this macro is one of the
!      `-march' arguments given above.
  
!      When used together, `-march' and `-mtune' select code that runs on
       a family of similar processors but that is optimized for a
       particular microarchitecture.
  
! `-mcpu=CPU'
       Generate code for a specific M680x0 or ColdFire processor.  The
!      M680x0 CPUs are: `68000', `68010', `68020', `68030', `68040',
!      `68060', `68302', `68332' and `cpu32'.  The ColdFire CPUs are
!      given by the table below, which also classifies the CPUs into
!      families:
  
!      *Family*      *`-mcpu' arguments*
!      `51'          `51' `51ac' `51ag' `51cn' `51em' `51je' `51jf' `51jg'
!                    `51jm' `51mm' `51qe' `51qm'
!      `5206'        `5202' `5204' `5206'
!      `5206e'       `5206e'
!      `5208'        `5207' `5208'
!      `5211a'       `5210a' `5211a'
!      `5213'        `5211' `5212' `5213'
!      `5216'        `5214' `5216'
!      `52235'       `52230' `52231' `52232' `52233' `52234' `52235'
!      `5225'        `5224' `5225'
!      `52259'       `52252' `52254' `52255' `52256' `52258' `52259'
!      `5235'        `5232' `5233' `5234' `5235' `523x'
!      `5249'        `5249'
!      `5250'        `5250'
!      `5271'        `5270' `5271'
!      `5272'        `5272'
!      `5275'        `5274' `5275'
!      `5282'        `5280' `5281' `5282' `528x'
!      `53017'       `53011' `53012' `53013' `53014' `53015' `53016'
!                    `53017'
!      `5307'        `5307'
!      `5329'        `5327' `5328' `5329' `532x'
!      `5373'        `5372' `5373' `537x'
!      `5407'        `5407'
!      `5475'        `5470' `5471' `5472' `5473' `5474' `5475' `547x'
!                    `5480' `5481' `5482' `5483' `5484' `5485'
  
!      `-mcpu=CPU' overrides `-march=ARCH' if ARCH is compatible with
!      CPU.  Other combinations of `-mcpu' and `-march' are rejected.
  
!      GCC defines the macro `__mcf_cpu_CPU' when ColdFire target CPU is
!      selected.  It also defines `__mcf_family_FAMILY', where the value
       of FAMILY is given by the table above.
  
! `-mtune=TUNE'
       Tune the code for a particular microarchitecture within the
!      constraints set by `-march' and `-mcpu'.  The M680x0
!      microarchitectures are: `68000', `68010', `68020', `68030',
!      `68040', `68060' and `cpu32'.  The ColdFire microarchitectures
!      are: `cfv1', `cfv2', `cfv3', `cfv4' and `cfv4e'.
  
!      You can also use `-mtune=68020-40' for code that needs to run
       relatively well on 68020, 68030 and 68040 targets.
!      `-mtune=68020-60' is similar but includes 68060 targets as well.
!      These two options select the same tuning decisions as `-m68020-40'
!      and `-m68020-60' respectively.
  
!      GCC defines the macros `__mcARCH' and `__mcARCH__' when tuning for
!      680x0 architecture ARCH.  It also defines `mcARCH' unless either
!      `-ansi' or a non-GNU `-std' option is used.  If GCC is tuning for
!      a range of architectures, as selected by `-mtune=68020-40' or
!      `-mtune=68020-60', it defines the macros for every architecture in
       the range.
  
!      GCC also defines the macro `__mUARCH__' when tuning for ColdFire
       microarchitecture UARCH, where UARCH is one of the arguments given
       above.
  
! `-m68000'
! `-mc68000'
!      Generate output for a 68000.  This is the default when the
!      compiler is configured for 68000-based systems.  It is equivalent
!      to `-march=68000'.
  
       Use this option for microcontrollers with a 68000 or EC000 core,
       including the 68008, 68302, 68306, 68307, 68322, 68328 and 68356.
  
! `-m68010'
!      Generate output for a 68010.  This is the default when the
!      compiler is configured for 68010-based systems.  It is equivalent
!      to `-march=68010'.
  
! `-m68020'
! `-mc68020'
!      Generate output for a 68020.  This is the default when the
!      compiler is configured for 68020-based systems.  It is equivalent
!      to `-march=68020'.
  
! `-m68030'
!      Generate output for a 68030.  This is the default when the
!      compiler is configured for 68030-based systems.  It is equivalent
!      to `-march=68030'.
  
! `-m68040'
!      Generate output for a 68040.  This is the default when the
!      compiler is configured for 68040-based systems.  It is equivalent
!      to `-march=68040'.
  
       This option inhibits the use of 68881/68882 instructions that have
       to be emulated by software on the 68040.  Use this option if your
       68040 does not have code to emulate those instructions.
  
! `-m68060'
!      Generate output for a 68060.  This is the default when the
!      compiler is configured for 68060-based systems.  It is equivalent
!      to `-march=68060'.
  
       This option inhibits the use of 68020 and 68881/68882 instructions
!      that have to be emulated by software on the 68060.  Use this
!      option if your 68060 does not have code to emulate those
!      instructions.
  
! `-mcpu32'
!      Generate output for a CPU32.  This is the default when the
!      compiler is configured for CPU32-based systems.  It is equivalent
!      to `-march=cpu32'.
  
       Use this option for microcontrollers with a CPU32 or CPU32+ core,
       including the 68330, 68331, 68332, 68333, 68334, 68336, 68340,
       68341, 68349 and 68360.
  
! `-m5200'
       Generate output for a 520X ColdFire CPU.  This is the default when
       the compiler is configured for 520X-based systems.  It is
!      equivalent to `-mcpu=5206', and is now deprecated in favor of that
       option.
  
!      Use this option for microcontroller with a 5200 core, including
!      the MCF5202, MCF5203, MCF5204 and MCF5206.
  
! `-m5206e'
       Generate output for a 5206e ColdFire CPU.  The option is now
!      deprecated in favor of the equivalent `-mcpu=5206e'.
  
! `-m528x'
       Generate output for a member of the ColdFire 528X family.  The
!      option is now deprecated in favor of the equivalent `-mcpu=528x'.
  
! `-m5307'
       Generate output for a ColdFire 5307 CPU.  The option is now
!      deprecated in favor of the equivalent `-mcpu=5307'.
  
! `-m5407'
       Generate output for a ColdFire 5407 CPU.  The option is now
!      deprecated in favor of the equivalent `-mcpu=5407'.
  
! `-mcfv4e'
       Generate output for a ColdFire V4e family CPU (e.g. 547x/548x).
       This includes use of hardware floating-point instructions.  The
!      option is equivalent to `-mcpu=547x', and is now deprecated in
       favor of that option.
  
! `-m68020-40'
       Generate output for a 68040, without using any of the new
       instructions.  This results in code that can run relatively
       efficiently on either a 68020/68881 or a 68030 or a 68040.  The
!      generated code does use the 68881 instructions that are emulated
!      on the 68040.
  
!      The option is equivalent to `-march=68020' `-mtune=68020-40'.
  
! `-m68020-60'
       Generate output for a 68060, without using any of the new
       instructions.  This results in code that can run relatively
       efficiently on either a 68020/68881 or a 68030 or a 68040.  The
!      generated code does use the 68881 instructions that are emulated
!      on the 68060.
  
!      The option is equivalent to `-march=68020' `-mtune=68020-60'.
  
! `-mhard-float'
! `-m68881'
       Generate floating-point instructions.  This is the default for
       68020 and above, and for ColdFire devices that have an FPU.  It
!      defines the macro `__HAVE_68881__' on M680x0 targets and
!      `__mcffpu__' on ColdFire targets.
  
! `-msoft-float'
       Do not generate floating-point instructions; use library calls
       instead.  This is the default for 68000, 68010, and 68832 targets.
       It is also the default for ColdFire devices that have no FPU.
  
! `-mdiv'
! `-mno-div'
       Generate (do not generate) ColdFire hardware divide and remainder
!      instructions.  If `-march' is used without `-mcpu', the default is
!      "on" for ColdFire architectures and "off" for M680x0
!      architectures.  Otherwise, the default is taken from the target CPU
!      (either the default CPU, or the one specified by `-mcpu').  For
!      example, the default is "off" for `-mcpu=5206' and "on" for
!      `-mcpu=5206e'.
  
!      GCC defines the macro `__mcfhwdiv__' when this option is enabled.
  
! `-mshort'
!      Consider type `int' to be 16 bits wide, like `short int'.
       Additionally, parameters passed on the stack are also aligned to a
       16-bit boundary even on targets whose API mandates promotion to
       32-bit.
  
! `-mno-short'
!      Do not consider type `int' to be 16 bits wide.  This is the
       default.
  
! `-mnobitfield'
! `-mno-bitfield'
!      Do not use the bit-field instructions.  The `-m68000', `-mcpu32'
!      and `-m5200' options imply `-mnobitfield'.
  
! `-mbitfield'
!      Do use the bit-field instructions.  The `-m68020' option implies
!      `-mbitfield'.  This is the default if you use a configuration
       designed for a 68020.
  
! `-mrtd'
       Use a different function-calling convention, in which functions
!      that take a fixed number of arguments return with the `rtd'
       instruction, which pops their arguments while returning.  This
       saves one instruction in the caller since there is no need to pop
       the arguments there.
--- 15115,15458 ----
       that, you must not use this option with GCC's default runtime
       libraries.
  
  
  File: gcc.info,  Node: M32R/D Options,  Next: M680x0 Options,  Prev: M32C Options,  Up: Submodel Options
  
  3.17.20 M32R/D Options
  ----------------------
  
! These '-m' options are defined for Renesas M32R/D architectures:
  
! '-m32r2'
       Generate code for the M32R/2.
  
! '-m32rx'
       Generate code for the M32R/X.
  
! '-m32r'
       Generate code for the M32R.  This is the default.
  
! '-mmodel=small'
       Assume all objects live in the lower 16MB of memory (so that their
!      addresses can be loaded with the 'ld24' instruction), and assume
!      all subroutines are reachable with the 'bl' instruction.  This is
       the default.
  
       The addressability of a particular object can be set with the
!      'model' attribute.
  
! '-mmodel=medium'
       Assume objects may be anywhere in the 32-bit address space (the
!      compiler generates 'seth/add3' instructions to load their
!      addresses), and assume all subroutines are reachable with the 'bl'
       instruction.
  
! '-mmodel=large'
       Assume objects may be anywhere in the 32-bit address space (the
!      compiler generates 'seth/add3' instructions to load their
       addresses), and assume subroutines may not be reachable with the
!      'bl' instruction (the compiler generates the much slower
!      'seth/add3/jl' instruction sequence).
  
! '-msdata=none'
       Disable use of the small data area.  Variables are put into one of
!      '.data', '.bss', or '.rodata' (unless the 'section' attribute has
       been specified).  This is the default.
  
!      The small data area consists of sections '.sdata' and '.sbss'.
       Objects may be explicitly put in the small data area with the
!      'section' attribute using one of these sections.
  
! '-msdata=sdata'
       Put small global and static data in the small data area, but do not
       generate special code to reference them.
  
! '-msdata=use'
       Put small global and static data in the small data area, and
       generate special instructions to reference them.
  
! '-G NUM'
       Put global and static objects less than or equal to NUM bytes into
       the small data or BSS sections instead of the normal data or BSS
!      sections.  The default value of NUM is 8.  The '-msdata' option
!      must be set to one of 'sdata' or 'use' for this option to have any
       effect.
  
!      All modules should be compiled with the same '-G NUM' value.
       Compiling with different values of NUM may or may not work; if it
       doesn't the linker gives an error message--incorrect code is not
       generated.
  
! '-mdebug'
       Makes the M32R-specific code in the compiler display some
       statistics that might help in debugging programs.
  
! '-malign-loops'
       Align all loops to a 32-byte boundary.
  
! '-mno-align-loops'
       Do not enforce a 32-byte alignment for loops.  This is the default.
  
! '-missue-rate=NUMBER'
       Issue NUMBER instructions per cycle.  NUMBER can only be 1 or 2.
  
! '-mbranch-cost=NUMBER'
       NUMBER can only be 1 or 2.  If it is 1 then branches are preferred
       over conditional code, if it is 2, then the opposite applies.
  
! '-mflush-trap=NUMBER'
       Specifies the trap number to use to flush the cache.  The default
       is 12.  Valid numbers are between 0 and 15 inclusive.
  
! '-mno-flush-trap'
       Specifies that the cache cannot be flushed by using a trap.
  
! '-mflush-func=NAME'
       Specifies the name of the operating system function to call to
!      flush the cache.  The default is '_flush_cache', but a function
       call is only used if a trap is not available.
  
! '-mno-flush-func'
       Indicates that there is no OS function for flushing the cache.
  
  
  File: gcc.info,  Node: M680x0 Options,  Next: MCore Options,  Prev: M32R/D Options,  Up: Submodel Options
  
  3.17.21 M680x0 Options
  ----------------------
  
! These are the '-m' options defined for M680x0 and ColdFire processors.
  The default settings depend on which architecture was selected when the
  compiler was configured; the defaults for the most common choices are
  given below.
  
! '-march=ARCH'
       Generate code for a specific M680x0 or ColdFire instruction set
       architecture.  Permissible values of ARCH for M680x0 architectures
!      are: '68000', '68010', '68020', '68030', '68040', '68060' and
!      'cpu32'.  ColdFire architectures are selected according to
       Freescale's ISA classification and the permissible values are:
!      'isaa', 'isaaplus', 'isab' and 'isac'.
  
!      GCC defines a macro '__mcfARCH__' whenever it is generating code
       for a ColdFire target.  The ARCH in this macro is one of the
!      '-march' arguments given above.
  
!      When used together, '-march' and '-mtune' select code that runs on
       a family of similar processors but that is optimized for a
       particular microarchitecture.
  
! '-mcpu=CPU'
       Generate code for a specific M680x0 or ColdFire processor.  The
!      M680x0 CPUs are: '68000', '68010', '68020', '68030', '68040',
!      '68060', '68302', '68332' and 'cpu32'.  The ColdFire CPUs are given
!      by the table below, which also classifies the CPUs into families:
  
!      *Family*       *'-mcpu' arguments*
!      '51'           '51' '51ac' '51ag' '51cn' '51em' '51je' '51jf' '51jg'
!                     '51jm' '51mm' '51qe' '51qm'
!      '5206'         '5202' '5204' '5206'
!      '5206e'        '5206e'
!      '5208'         '5207' '5208'
!      '5211a'        '5210a' '5211a'
!      '5213'         '5211' '5212' '5213'
!      '5216'         '5214' '5216'
!      '52235'        '52230' '52231' '52232' '52233' '52234' '52235'
!      '5225'         '5224' '5225'
!      '52259'        '52252' '52254' '52255' '52256' '52258' '52259'
!      '5235'         '5232' '5233' '5234' '5235' '523x'
!      '5249'         '5249'
!      '5250'         '5250'
!      '5271'         '5270' '5271'
!      '5272'         '5272'
!      '5275'         '5274' '5275'
!      '5282'         '5280' '5281' '5282' '528x'
!      '53017'        '53011' '53012' '53013' '53014' '53015' '53016' '53017'
!      '5307'         '5307'
!      '5329'         '5327' '5328' '5329' '532x'
!      '5373'         '5372' '5373' '537x'
!      '5407'         '5407'
!      '5475'         '5470' '5471' '5472' '5473' '5474' '5475' '547x' '5480'
!                     '5481' '5482' '5483' '5484' '5485'
  
!      '-mcpu=CPU' overrides '-march=ARCH' if ARCH is compatible with CPU.
!      Other combinations of '-mcpu' and '-march' are rejected.
  
!      GCC defines the macro '__mcf_cpu_CPU' when ColdFire target CPU is
!      selected.  It also defines '__mcf_family_FAMILY', where the value
       of FAMILY is given by the table above.
  
! '-mtune=TUNE'
       Tune the code for a particular microarchitecture within the
!      constraints set by '-march' and '-mcpu'.  The M680x0
!      microarchitectures are: '68000', '68010', '68020', '68030',
!      '68040', '68060' and 'cpu32'.  The ColdFire microarchitectures are:
!      'cfv1', 'cfv2', 'cfv3', 'cfv4' and 'cfv4e'.
  
!      You can also use '-mtune=68020-40' for code that needs to run
       relatively well on 68020, 68030 and 68040 targets.
!      '-mtune=68020-60' is similar but includes 68060 targets as well.
!      These two options select the same tuning decisions as '-m68020-40'
!      and '-m68020-60' respectively.
  
!      GCC defines the macros '__mcARCH' and '__mcARCH__' when tuning for
!      680x0 architecture ARCH.  It also defines 'mcARCH' unless either
!      '-ansi' or a non-GNU '-std' option is used.  If GCC is tuning for a
!      range of architectures, as selected by '-mtune=68020-40' or
!      '-mtune=68020-60', it defines the macros for every architecture in
       the range.
  
!      GCC also defines the macro '__mUARCH__' when tuning for ColdFire
       microarchitecture UARCH, where UARCH is one of the arguments given
       above.
  
! '-m68000'
! '-mc68000'
!      Generate output for a 68000.  This is the default when the compiler
!      is configured for 68000-based systems.  It is equivalent to
!      '-march=68000'.
  
       Use this option for microcontrollers with a 68000 or EC000 core,
       including the 68008, 68302, 68306, 68307, 68322, 68328 and 68356.
  
! '-m68010'
!      Generate output for a 68010.  This is the default when the compiler
!      is configured for 68010-based systems.  It is equivalent to
!      '-march=68010'.
  
! '-m68020'
! '-mc68020'
!      Generate output for a 68020.  This is the default when the compiler
!      is configured for 68020-based systems.  It is equivalent to
!      '-march=68020'.
  
! '-m68030'
!      Generate output for a 68030.  This is the default when the compiler
!      is configured for 68030-based systems.  It is equivalent to
!      '-march=68030'.
  
! '-m68040'
!      Generate output for a 68040.  This is the default when the compiler
!      is configured for 68040-based systems.  It is equivalent to
!      '-march=68040'.
  
       This option inhibits the use of 68881/68882 instructions that have
       to be emulated by software on the 68040.  Use this option if your
       68040 does not have code to emulate those instructions.
  
! '-m68060'
!      Generate output for a 68060.  This is the default when the compiler
!      is configured for 68060-based systems.  It is equivalent to
!      '-march=68060'.
  
       This option inhibits the use of 68020 and 68881/68882 instructions
!      that have to be emulated by software on the 68060.  Use this option
!      if your 68060 does not have code to emulate those instructions.
  
! '-mcpu32'
!      Generate output for a CPU32.  This is the default when the compiler
!      is configured for CPU32-based systems.  It is equivalent to
!      '-march=cpu32'.
  
       Use this option for microcontrollers with a CPU32 or CPU32+ core,
       including the 68330, 68331, 68332, 68333, 68334, 68336, 68340,
       68341, 68349 and 68360.
  
! '-m5200'
       Generate output for a 520X ColdFire CPU.  This is the default when
       the compiler is configured for 520X-based systems.  It is
!      equivalent to '-mcpu=5206', and is now deprecated in favor of that
       option.
  
!      Use this option for microcontroller with a 5200 core, including the
!      MCF5202, MCF5203, MCF5204 and MCF5206.
  
! '-m5206e'
       Generate output for a 5206e ColdFire CPU.  The option is now
!      deprecated in favor of the equivalent '-mcpu=5206e'.
  
! '-m528x'
       Generate output for a member of the ColdFire 528X family.  The
!      option is now deprecated in favor of the equivalent '-mcpu=528x'.
  
! '-m5307'
       Generate output for a ColdFire 5307 CPU.  The option is now
!      deprecated in favor of the equivalent '-mcpu=5307'.
  
! '-m5407'
       Generate output for a ColdFire 5407 CPU.  The option is now
!      deprecated in favor of the equivalent '-mcpu=5407'.
  
! '-mcfv4e'
       Generate output for a ColdFire V4e family CPU (e.g. 547x/548x).
       This includes use of hardware floating-point instructions.  The
!      option is equivalent to '-mcpu=547x', and is now deprecated in
       favor of that option.
  
! '-m68020-40'
       Generate output for a 68040, without using any of the new
       instructions.  This results in code that can run relatively
       efficiently on either a 68020/68881 or a 68030 or a 68040.  The
!      generated code does use the 68881 instructions that are emulated on
!      the 68040.
  
!      The option is equivalent to '-march=68020' '-mtune=68020-40'.
  
! '-m68020-60'
       Generate output for a 68060, without using any of the new
       instructions.  This results in code that can run relatively
       efficiently on either a 68020/68881 or a 68030 or a 68040.  The
!      generated code does use the 68881 instructions that are emulated on
!      the 68060.
  
!      The option is equivalent to '-march=68020' '-mtune=68020-60'.
  
! '-mhard-float'
! '-m68881'
       Generate floating-point instructions.  This is the default for
       68020 and above, and for ColdFire devices that have an FPU.  It
!      defines the macro '__HAVE_68881__' on M680x0 targets and
!      '__mcffpu__' on ColdFire targets.
  
! '-msoft-float'
       Do not generate floating-point instructions; use library calls
       instead.  This is the default for 68000, 68010, and 68832 targets.
       It is also the default for ColdFire devices that have no FPU.
  
! '-mdiv'
! '-mno-div'
       Generate (do not generate) ColdFire hardware divide and remainder
!      instructions.  If '-march' is used without '-mcpu', the default is
!      "on" for ColdFire architectures and "off" for M680x0 architectures.
!      Otherwise, the default is taken from the target CPU (either the
!      default CPU, or the one specified by '-mcpu').  For example, the
!      default is "off" for '-mcpu=5206' and "on" for '-mcpu=5206e'.
  
!      GCC defines the macro '__mcfhwdiv__' when this option is enabled.
  
! '-mshort'
!      Consider type 'int' to be 16 bits wide, like 'short int'.
       Additionally, parameters passed on the stack are also aligned to a
       16-bit boundary even on targets whose API mandates promotion to
       32-bit.
  
! '-mno-short'
!      Do not consider type 'int' to be 16 bits wide.  This is the
       default.
  
! '-mnobitfield'
! '-mno-bitfield'
!      Do not use the bit-field instructions.  The '-m68000', '-mcpu32'
!      and '-m5200' options imply '-mnobitfield'.
  
! '-mbitfield'
!      Do use the bit-field instructions.  The '-m68020' option implies
!      '-mbitfield'.  This is the default if you use a configuration
       designed for a 68020.
  
! '-mrtd'
       Use a different function-calling convention, in which functions
!      that take a fixed number of arguments return with the 'rtd'
       instruction, which pops their arguments while returning.  This
       saves one instruction in the caller since there is no need to pop
       the arguments there.
*************** given below.
*** 15518,15595 ****
       compiled with the Unix compiler.
  
       Also, you must provide function prototypes for all functions that
!      take variable numbers of arguments (including `printf'); otherwise
       incorrect code is generated for calls to those functions.
  
       In addition, seriously incorrect code results if you call a
       function with too many arguments.  (Normally, extra arguments are
       harmlessly ignored.)
  
!      The `rtd' instruction is supported by the 68010, 68020, 68030,
       68040, 68060 and CPU32 processors, but not by the 68000 or 5200.
  
! `-mno-rtd'
!      Do not use the calling conventions selected by `-mrtd'.  This is
       the default.
  
! `-malign-int'
! `-mno-align-int'
!      Control whether GCC aligns `int', `long', `long long', `float',
!      `double', and `long double' variables on a 32-bit boundary
!      (`-malign-int') or a 16-bit boundary (`-mno-align-int').  Aligning
       variables on 32-bit boundaries produces code that runs somewhat
       faster on processors with 32-bit busses at the expense of more
       memory.
  
!      *Warning:* if you use the `-malign-int' switch, GCC aligns
       structures containing the above types differently than most
       published application binary interface specifications for the m68k.
  
! `-mpcrel'
       Use the pc-relative addressing mode of the 68000 directly, instead
       of using a global offset table.  At present, this option implies
!      `-fpic', allowing at most a 16-bit offset for pc-relative
!      addressing.  `-fPIC' is not presently supported with `-mpcrel',
       though this could be supported for 68020 and higher processors.
  
! `-mno-strict-align'
! `-mstrict-align'
       Do not (do) assume that unaligned memory references are handled by
       the system.
  
! `-msep-data'
       Generate code that allows the data segment to be located in a
       different area of memory from the text segment.  This allows for
       execute-in-place in an environment without virtual memory
!      management.  This option implies `-fPIC'.
  
! `-mno-sep-data'
       Generate code that assumes that the data segment follows the text
       segment.  This is the default.
  
! `-mid-shared-library'
       Generate code that supports shared libraries via the library ID
       method.  This allows for execute-in-place and shared libraries in
       an environment without virtual memory management.  This option
!      implies `-fPIC'.
  
! `-mno-id-shared-library'
       Generate code that doesn't assume ID-based shared libraries are
       being used.  This is the default.
  
! `-mshared-library-id=n'
       Specifies the identification number of the ID-based shared library
       being compiled.  Specifying a value of 0 generates more compact
       code; specifying other values forces the allocation of that number
       to the current library, but is no more space- or time-efficient
       than omitting this option.
  
! `-mxgot'
! `-mno-xgot'
       When generating position-independent code for ColdFire, generate
       code that works if the GOT has more than 8192 entries.  This code
       is larger and slower than code generated without this option.  On
!      M680x0 processors, this option is not needed; `-fPIC' suffices.
  
       GCC normally uses a single instruction to load values from the GOT.
       While this is relatively efficient, it only works if the GOT is
--- 15462,15539 ----
       compiled with the Unix compiler.
  
       Also, you must provide function prototypes for all functions that
!      take variable numbers of arguments (including 'printf'); otherwise
       incorrect code is generated for calls to those functions.
  
       In addition, seriously incorrect code results if you call a
       function with too many arguments.  (Normally, extra arguments are
       harmlessly ignored.)
  
!      The 'rtd' instruction is supported by the 68010, 68020, 68030,
       68040, 68060 and CPU32 processors, but not by the 68000 or 5200.
  
! '-mno-rtd'
!      Do not use the calling conventions selected by '-mrtd'.  This is
       the default.
  
! '-malign-int'
! '-mno-align-int'
!      Control whether GCC aligns 'int', 'long', 'long long', 'float',
!      'double', and 'long double' variables on a 32-bit boundary
!      ('-malign-int') or a 16-bit boundary ('-mno-align-int').  Aligning
       variables on 32-bit boundaries produces code that runs somewhat
       faster on processors with 32-bit busses at the expense of more
       memory.
  
!      *Warning:* if you use the '-malign-int' switch, GCC aligns
       structures containing the above types differently than most
       published application binary interface specifications for the m68k.
  
! '-mpcrel'
       Use the pc-relative addressing mode of the 68000 directly, instead
       of using a global offset table.  At present, this option implies
!      '-fpic', allowing at most a 16-bit offset for pc-relative
!      addressing.  '-fPIC' is not presently supported with '-mpcrel',
       though this could be supported for 68020 and higher processors.
  
! '-mno-strict-align'
! '-mstrict-align'
       Do not (do) assume that unaligned memory references are handled by
       the system.
  
! '-msep-data'
       Generate code that allows the data segment to be located in a
       different area of memory from the text segment.  This allows for
       execute-in-place in an environment without virtual memory
!      management.  This option implies '-fPIC'.
  
! '-mno-sep-data'
       Generate code that assumes that the data segment follows the text
       segment.  This is the default.
  
! '-mid-shared-library'
       Generate code that supports shared libraries via the library ID
       method.  This allows for execute-in-place and shared libraries in
       an environment without virtual memory management.  This option
!      implies '-fPIC'.
  
! '-mno-id-shared-library'
       Generate code that doesn't assume ID-based shared libraries are
       being used.  This is the default.
  
! '-mshared-library-id=n'
       Specifies the identification number of the ID-based shared library
       being compiled.  Specifying a value of 0 generates more compact
       code; specifying other values forces the allocation of that number
       to the current library, but is no more space- or time-efficient
       than omitting this option.
  
! '-mxgot'
! '-mno-xgot'
       When generating position-independent code for ColdFire, generate
       code that works if the GOT has more than 8192 entries.  This code
       is larger and slower than code generated without this option.  On
!      M680x0 processors, this option is not needed; '-fPIC' suffices.
  
       GCC normally uses a single instruction to load values from the GOT.
       While this is relatively efficient, it only works if the GOT is
*************** given below.
*** 15598,15805 ****
  
            relocation truncated to fit: R_68K_GOT16O foobar
  
!      If this happens, you should recompile your code with `-mxgot'.  It
       should then work with very large GOTs.  However, code generated
!      with `-mxgot' is less efficient, since it takes 4 instructions to
       fetch the value of a global symbol.
  
       Note that some linkers, including newer versions of the GNU linker,
       can create multiple GOTs and sort GOT entries.  If you have such a
!      linker, you should only need to use `-mxgot' when compiling a
       single object file that accesses more than 8192 GOT entries.  Very
       few do.
  
       These options have no effect unless GCC is generating
       position-independent code.
  
- 
  
  File: gcc.info,  Node: MCore Options,  Next: MeP Options,  Prev: M680x0 Options,  Up: Submodel Options
  
  3.17.22 MCore Options
  ---------------------
  
! These are the `-m' options defined for the Motorola M*Core processors.
  
! `-mhardlit'
! `-mno-hardlit'
       Inline constants into the code stream if it can be done in two
       instructions or less.
  
! `-mdiv'
! `-mno-div'
       Use the divide instruction.  (Enabled by default).
  
! `-mrelax-immediate'
! `-mno-relax-immediate'
       Allow arbitrary-sized immediates in bit operations.
  
! `-mwide-bitfields'
! `-mno-wide-bitfields'
!      Always treat bit-fields as `int'-sized.
  
! `-m4byte-functions'
! `-mno-4byte-functions'
       Force all functions to be aligned to a 4-byte boundary.
  
! `-mcallgraph-data'
! `-mno-callgraph-data'
       Emit callgraph information.
  
! `-mslow-bytes'
! `-mno-slow-bytes'
       Prefer word access when reading byte quantities.
  
! `-mlittle-endian'
! `-mbig-endian'
       Generate code for a little-endian target.
  
! `-m210'
! `-m340'
       Generate code for the 210 processor.
  
! `-mno-lsim'
       Assume that runtime support has been provided and so omit the
!      simulator library (`libsim.a)' from the linker command line.
  
! `-mstack-increment=SIZE'
       Set the maximum amount for a single stack increment operation.
       Large values can increase the speed of programs that contain
       functions that need a large amount of stack space, but they can
       also trigger a segmentation fault if the stack is extended too
       much.  The default value is 0x1000.
  
- 
  
  File: gcc.info,  Node: MeP Options,  Next: MicroBlaze Options,  Prev: MCore Options,  Up: Submodel Options
  
  3.17.23 MeP Options
  -------------------
  
! `-mabsdiff'
!      Enables the `abs' instruction, which is the absolute difference
       between two registers.
  
! `-mall-opts'
       Enables all the optional instructions--average, multiply, divide,
       bit operations, leading zero, absolute difference, min/max, clip,
       and saturation.
  
! `-maverage'
!      Enables the `ave' instruction, which computes the average of two
       registers.
  
! `-mbased=N'
!      Variables of size N bytes or smaller are placed in the `.based'
!      section by default.  Based variables use the `$tp' register as a
!      base register, and there is a 128-byte limit to the `.based'
       section.
  
! `-mbitops'
!      Enables the bit operation instructions--bit test (`btstm'), set
!      (`bsetm'), clear (`bclrm'), invert (`bnotm'), and test-and-set
!      (`tas').
  
! `-mc=NAME'
       Selects which section constant data is placed in.  NAME may be
!      `tiny', `near', or `far'.
  
! `-mclip'
!      Enables the `clip' instruction.  Note that `-mclip' is not useful
!      unless you also provide `-mminmax'.
  
! `-mconfig=NAME'
       Selects one of the built-in core configurations.  Each MeP chip has
!      one or more modules in it; each module has a core CPU and a
!      variety of coprocessors, optional instructions, and peripherals.
!      The `MeP-Integrator' tool, not part of GCC, provides these
       configurations through this option; using this option is the same
       as using all the corresponding command-line options.  The default
!      configuration is `default'.
  
! `-mcop'
       Enables the coprocessor instructions.  By default, this is a 32-bit
       coprocessor.  Note that the coprocessor is normally enabled via the
!      `-mconfig=' option.
  
! `-mcop32'
       Enables the 32-bit coprocessor's instructions.
  
! `-mcop64'
       Enables the 64-bit coprocessor's instructions.
  
! `-mivc2'
       Enables IVC2 scheduling.  IVC2 is a 64-bit VLIW coprocessor.
  
! `-mdc'
!      Causes constant variables to be placed in the `.near' section.
  
! `-mdiv'
!      Enables the `div' and `divu' instructions.
  
! `-meb'
       Generate big-endian code.
  
! `-mel'
       Generate little-endian code.
  
! `-mio-volatile'
!      Tells the compiler that any variable marked with the `io'
!      attribute is to be considered volatile.
  
! `-ml'
!      Causes variables to be assigned to the `.far' section by default.
  
! `-mleadz'
!      Enables the `leadz' (leading zero) instruction.
  
! `-mm'
!      Causes variables to be assigned to the `.near' section by default.
  
! `-mminmax'
!      Enables the `min' and `max' instructions.
  
! `-mmult'
       Enables the multiplication and multiply-accumulate instructions.
  
! `-mno-opts'
!      Disables all the optional instructions enabled by `-mall-opts'.
  
! `-mrepeat'
!      Enables the `repeat' and `erepeat' instructions, used for
       low-overhead looping.
  
! `-ms'
!      Causes all variables to default to the `.tiny' section.  Note that
       there is a 65536-byte limit to this section.  Accesses to these
!      variables use the `%gp' base register.
  
! `-msatur'
       Enables the saturation instructions.  Note that the compiler does
       not currently generate these itself, but this option is included
!      for compatibility with other tools, like `as'.
  
! `-msdram'
       Link the SDRAM-based runtime instead of the default ROM-based
       runtime.
  
! `-msim'
       Link the simulator run-time libraries.
  
! `-msimnovec'
       Link the simulator runtime libraries, excluding built-in support
       for reset and exception vectors and tables.
  
! `-mtf'
!      Causes all functions to default to the `.far' section.  Without
!      this option, functions default to the `.near' section.
! 
! `-mtiny=N'
!      Variables that are N bytes or smaller are allocated to the `.tiny'
!      section.  These variables use the `$gp' base register.  The
!      default for this option is 4, but note that there's a 65536-byte
!      limit to the `.tiny' section.
  
  
  
  File: gcc.info,  Node: MicroBlaze Options,  Next: MIPS Options,  Prev: MeP Options,  Up: Submodel Options
--- 15542,15746 ----
  
            relocation truncated to fit: R_68K_GOT16O foobar
  
!      If this happens, you should recompile your code with '-mxgot'.  It
       should then work with very large GOTs.  However, code generated
!      with '-mxgot' is less efficient, since it takes 4 instructions to
       fetch the value of a global symbol.
  
       Note that some linkers, including newer versions of the GNU linker,
       can create multiple GOTs and sort GOT entries.  If you have such a
!      linker, you should only need to use '-mxgot' when compiling a
       single object file that accesses more than 8192 GOT entries.  Very
       few do.
  
       These options have no effect unless GCC is generating
       position-independent code.
  
  
  File: gcc.info,  Node: MCore Options,  Next: MeP Options,  Prev: M680x0 Options,  Up: Submodel Options
  
  3.17.22 MCore Options
  ---------------------
  
! These are the '-m' options defined for the Motorola M*Core processors.
  
! '-mhardlit'
! '-mno-hardlit'
       Inline constants into the code stream if it can be done in two
       instructions or less.
  
! '-mdiv'
! '-mno-div'
       Use the divide instruction.  (Enabled by default).
  
! '-mrelax-immediate'
! '-mno-relax-immediate'
       Allow arbitrary-sized immediates in bit operations.
  
! '-mwide-bitfields'
! '-mno-wide-bitfields'
!      Always treat bit-fields as 'int'-sized.
  
! '-m4byte-functions'
! '-mno-4byte-functions'
       Force all functions to be aligned to a 4-byte boundary.
  
! '-mcallgraph-data'
! '-mno-callgraph-data'
       Emit callgraph information.
  
! '-mslow-bytes'
! '-mno-slow-bytes'
       Prefer word access when reading byte quantities.
  
! '-mlittle-endian'
! '-mbig-endian'
       Generate code for a little-endian target.
  
! '-m210'
! '-m340'
       Generate code for the 210 processor.
  
! '-mno-lsim'
       Assume that runtime support has been provided and so omit the
!      simulator library ('libsim.a)' from the linker command line.
  
! '-mstack-increment=SIZE'
       Set the maximum amount for a single stack increment operation.
       Large values can increase the speed of programs that contain
       functions that need a large amount of stack space, but they can
       also trigger a segmentation fault if the stack is extended too
       much.  The default value is 0x1000.
  
  
  File: gcc.info,  Node: MeP Options,  Next: MicroBlaze Options,  Prev: MCore Options,  Up: Submodel Options
  
  3.17.23 MeP Options
  -------------------
  
! '-mabsdiff'
!      Enables the 'abs' instruction, which is the absolute difference
       between two registers.
  
! '-mall-opts'
       Enables all the optional instructions--average, multiply, divide,
       bit operations, leading zero, absolute difference, min/max, clip,
       and saturation.
  
! '-maverage'
!      Enables the 'ave' instruction, which computes the average of two
       registers.
  
! '-mbased=N'
!      Variables of size N bytes or smaller are placed in the '.based'
!      section by default.  Based variables use the '$tp' register as a
!      base register, and there is a 128-byte limit to the '.based'
       section.
  
! '-mbitops'
!      Enables the bit operation instructions--bit test ('btstm'), set
!      ('bsetm'), clear ('bclrm'), invert ('bnotm'), and test-and-set
!      ('tas').
  
! '-mc=NAME'
       Selects which section constant data is placed in.  NAME may be
!      'tiny', 'near', or 'far'.
  
! '-mclip'
!      Enables the 'clip' instruction.  Note that '-mclip' is not useful
!      unless you also provide '-mminmax'.
  
! '-mconfig=NAME'
       Selects one of the built-in core configurations.  Each MeP chip has
!      one or more modules in it; each module has a core CPU and a variety
!      of coprocessors, optional instructions, and peripherals.  The
!      'MeP-Integrator' tool, not part of GCC, provides these
       configurations through this option; using this option is the same
       as using all the corresponding command-line options.  The default
!      configuration is 'default'.
  
! '-mcop'
       Enables the coprocessor instructions.  By default, this is a 32-bit
       coprocessor.  Note that the coprocessor is normally enabled via the
!      '-mconfig=' option.
  
! '-mcop32'
       Enables the 32-bit coprocessor's instructions.
  
! '-mcop64'
       Enables the 64-bit coprocessor's instructions.
  
! '-mivc2'
       Enables IVC2 scheduling.  IVC2 is a 64-bit VLIW coprocessor.
  
! '-mdc'
!      Causes constant variables to be placed in the '.near' section.
  
! '-mdiv'
!      Enables the 'div' and 'divu' instructions.
  
! '-meb'
       Generate big-endian code.
  
! '-mel'
       Generate little-endian code.
  
! '-mio-volatile'
!      Tells the compiler that any variable marked with the 'io' attribute
!      is to be considered volatile.
  
! '-ml'
!      Causes variables to be assigned to the '.far' section by default.
  
! '-mleadz'
!      Enables the 'leadz' (leading zero) instruction.
  
! '-mm'
!      Causes variables to be assigned to the '.near' section by default.
  
! '-mminmax'
!      Enables the 'min' and 'max' instructions.
  
! '-mmult'
       Enables the multiplication and multiply-accumulate instructions.
  
! '-mno-opts'
!      Disables all the optional instructions enabled by '-mall-opts'.
  
! '-mrepeat'
!      Enables the 'repeat' and 'erepeat' instructions, used for
       low-overhead looping.
  
! '-ms'
!      Causes all variables to default to the '.tiny' section.  Note that
       there is a 65536-byte limit to this section.  Accesses to these
!      variables use the '%gp' base register.
  
! '-msatur'
       Enables the saturation instructions.  Note that the compiler does
       not currently generate these itself, but this option is included
!      for compatibility with other tools, like 'as'.
  
! '-msdram'
       Link the SDRAM-based runtime instead of the default ROM-based
       runtime.
  
! '-msim'
       Link the simulator run-time libraries.
  
! '-msimnovec'
       Link the simulator runtime libraries, excluding built-in support
       for reset and exception vectors and tables.
  
! '-mtf'
!      Causes all functions to default to the '.far' section.  Without
!      this option, functions default to the '.near' section.
  
+ '-mtiny=N'
+      Variables that are N bytes or smaller are allocated to the '.tiny'
+      section.  These variables use the '$gp' base register.  The default
+      for this option is 4, but note that there's a 65536-byte limit to
+      the '.tiny' section.
  
  
  File: gcc.info,  Node: MicroBlaze Options,  Next: MIPS Options,  Prev: MeP Options,  Up: Submodel Options
*************** File: gcc.info,  Node: MicroBlaze Option
*** 15807,15898 ****
  3.17.24 MicroBlaze Options
  --------------------------
  
! `-msoft-float'
       Use software emulation for floating point (default).
  
! `-mhard-float'
       Use hardware floating-point instructions.
  
! `-mmemcpy'
!      Do not optimize block moves, use `memcpy'.
  
! `-mno-clearbss'
!      This option is deprecated.  Use `-fno-zero-initialized-in-bss'
       instead.
  
! `-mcpu=CPU-TYPE'
!      Use features of, and schedule code for, the given CPU.  Supported
!      values are in the format `vX.YY.Z', where X is a major version, YY
       is the minor version, and Z is compatibility code.  Example values
!      are `v3.00.a', `v4.00.b', `v5.00.a', `v5.00.b', `v5.00.b',
!      `v6.00.a'.
  
! `-mxl-soft-mul'
       Use software multiply emulation (default).
  
! `-mxl-soft-div'
       Use software emulation for divides (default).
  
! `-mxl-barrel-shift'
       Use the hardware barrel shifter.
  
! `-mxl-pattern-compare'
       Use pattern compare instructions.
  
! `-msmall-divides'
       Use table lookup optimization for small signed integer divisions.
  
! `-mxl-stack-check'
!      This option is deprecated.  Use `-fstack-check' instead.
  
! `-mxl-gp-opt'
!      Use GP-relative `.sdata'/`.sbss' sections.
  
! `-mxl-multiply-high'
       Use multiply high instructions for high part of 32x32 multiply.
  
! `-mxl-float-convert'
       Use hardware floating-point conversion instructions.
  
! `-mxl-float-sqrt'
       Use hardware floating-point square root instruction.
  
! `-mbig-endian'
       Generate code for a big-endian target.
  
! `-mlittle-endian'
       Generate code for a little-endian target.
  
! `-mxl-reorder'
       Use reorder instructions (swap and byte reversed load/store).
  
! `-mxl-mode-APP-MODEL'
       Select application model APP-MODEL.  Valid models are
!     `executable'
!           normal executable (default), uses startup code `crt0.o'.
  
!     `xmdstub'
            for use with Xilinx Microprocessor Debugger (XMD) based
!           software intrusive debug agent called xmdstub. This uses
!           startup file `crt1.o' and sets the start address of the
            program to 0x800.
  
!     `bootstrap'
            for applications that are loaded using a bootloader.  This
!           model uses startup file `crt2.o' which does not contain a
!           processor reset vector handler. This is suitable for
            transferring control on a processor reset to the bootloader
            rather than the application.
  
!     `novectors'
            for applications that do not require any of the MicroBlaze
!           vectors. This option may be useful for applications running
!           within a monitoring application. This model uses `crt3.o' as
            a startup file.
  
!      Option `-xl-mode-APP-MODEL' is a deprecated alias for
!      `-mxl-mode-APP-MODEL'.
! 
  
  
  File: gcc.info,  Node: MIPS Options,  Next: MMIX Options,  Prev: MicroBlaze Options,  Up: Submodel Options
--- 15748,15838 ----
  3.17.24 MicroBlaze Options
  --------------------------
  
! '-msoft-float'
       Use software emulation for floating point (default).
  
! '-mhard-float'
       Use hardware floating-point instructions.
  
! '-mmemcpy'
!      Do not optimize block moves, use 'memcpy'.
  
! '-mno-clearbss'
!      This option is deprecated.  Use '-fno-zero-initialized-in-bss'
       instead.
  
! '-mcpu=CPU-TYPE'
!      Use features of, and schedule code for, the given CPU. Supported
!      values are in the format 'vX.YY.Z', where X is a major version, YY
       is the minor version, and Z is compatibility code.  Example values
!      are 'v3.00.a', 'v4.00.b', 'v5.00.a', 'v5.00.b', 'v5.00.b',
!      'v6.00.a'.
  
! '-mxl-soft-mul'
       Use software multiply emulation (default).
  
! '-mxl-soft-div'
       Use software emulation for divides (default).
  
! '-mxl-barrel-shift'
       Use the hardware barrel shifter.
  
! '-mxl-pattern-compare'
       Use pattern compare instructions.
  
! '-msmall-divides'
       Use table lookup optimization for small signed integer divisions.
  
! '-mxl-stack-check'
!      This option is deprecated.  Use '-fstack-check' instead.
  
! '-mxl-gp-opt'
!      Use GP-relative '.sdata'/'.sbss' sections.
  
! '-mxl-multiply-high'
       Use multiply high instructions for high part of 32x32 multiply.
  
! '-mxl-float-convert'
       Use hardware floating-point conversion instructions.
  
! '-mxl-float-sqrt'
       Use hardware floating-point square root instruction.
  
! '-mbig-endian'
       Generate code for a big-endian target.
  
! '-mlittle-endian'
       Generate code for a little-endian target.
  
! '-mxl-reorder'
       Use reorder instructions (swap and byte reversed load/store).
  
! '-mxl-mode-APP-MODEL'
       Select application model APP-MODEL.  Valid models are
!      'executable'
!           normal executable (default), uses startup code 'crt0.o'.
  
!      'xmdstub'
            for use with Xilinx Microprocessor Debugger (XMD) based
!           software intrusive debug agent called xmdstub.  This uses
!           startup file 'crt1.o' and sets the start address of the
            program to 0x800.
  
!      'bootstrap'
            for applications that are loaded using a bootloader.  This
!           model uses startup file 'crt2.o' which does not contain a
!           processor reset vector handler.  This is suitable for
            transferring control on a processor reset to the bootloader
            rather than the application.
  
!      'novectors'
            for applications that do not require any of the MicroBlaze
!           vectors.  This option may be useful for applications running
!           within a monitoring application.  This model uses 'crt3.o' as
            a startup file.
  
!      Option '-xl-mode-APP-MODEL' is a deprecated alias for
!      '-mxl-mode-APP-MODEL'.
  
  
  File: gcc.info,  Node: MIPS Options,  Next: MMIX Options,  Prev: MicroBlaze Options,  Up: Submodel Options
*************** File: gcc.info,  Node: MIPS Options,  Ne
*** 15900,16130 ****
  3.17.25 MIPS Options
  --------------------
  
! `-EB'
       Generate big-endian code.
  
! `-EL'
!      Generate little-endian code.  This is the default for `mips*el-*-*'
       configurations.
  
! `-march=ARCH'
!      Generate code that runs on ARCH, which can be the name of a
!      generic MIPS ISA, or the name of a particular processor.  The ISA
!      names are: `mips1', `mips2', `mips3', `mips4', `mips32',
!      `mips32r2', `mips32r3', `mips32r5', `mips32r6', `mips64',
!      `mips64r2', `mips64r3', `mips64r5' and `mips64r6'.  The processor
!      names are: `4kc', `4km', `4kp', `4ksc', `4kec', `4kem', `4kep',
!      `4ksd', `5kc', `5kf', `20kc', `24kc', `24kf2_1', `24kf1_1',
!      `24kec', `24kef2_1', `24kef1_1', `34kc', `34kf2_1', `34kf1_1',
!      `34kn', `74kc', `74kf2_1', `74kf1_1', `74kf3_2', `1004kc',
!      `1004kf2_1', `1004kf1_1', `loongson2e', `loongson2f', `loongson3a',
!      `m4k', `m14k', `m14kc', `m14ke', `m14kec', `octeon', `octeon+',
!      `octeon2', `octeon3', `orion', `p5600', `r2000', `r3000', `r3900',
!      `r4000', `r4400', `r4600', `r4650', `r4700', `r6000', `r8000',
!      `rm7000', `rm9000', `r10000', `r12000', `r14000', `r16000', `sb1',
!      `sr71000', `vr4100', `vr4111', `vr4120', `vr4130', `vr4300',
!      `vr5000', `vr5400', `vr5500', `xlr' and `xlp'.  The special value
!      `from-abi' selects the most compatible architecture for the
!      selected ABI (that is, `mips1' for 32-bit ABIs and `mips3' for
!      64-bit ABIs).
  
!      The native Linux/GNU toolchain also supports the value `native',
       which selects the best architecture option for the host processor.
!      `-march=native' has no effect if GCC does not recognize the
       processor.
  
!      In processor names, a final `000' can be abbreviated as `k' (for
!      example, `-march=r2k').  Prefixes are optional, and `vr' may be
!      written `r'.
  
!      Names of the form `Nf2_1' refer to processors with FPUs clocked at
!      half the rate of the core, names of the form `Nf1_1' refer to
       processors with FPUs clocked at the same rate as the core, and
!      names of the form `Nf3_2' refer to processors with FPUs clocked a
       ratio of 3:2 with respect to the core.  For compatibility reasons,
!      `Nf' is accepted as a synonym for `Nf2_1' while `Nx' and `Bfx' are
!      accepted as synonyms for `Nf1_1'.
  
       GCC defines two macros based on the value of this option.  The
!      first is `_MIPS_ARCH', which gives the name of target
!      architecture, as a string.  The second has the form
!      `_MIPS_ARCH_FOO', where FOO is the capitalized value of
!      `_MIPS_ARCH'.  For example, `-march=r2000' sets `_MIPS_ARCH' to
!      `"r2000"' and defines the macro `_MIPS_ARCH_R2000'.
  
!      Note that the `_MIPS_ARCH' macro uses the processor names given
       above.  In other words, it has the full prefix and does not
!      abbreviate `000' as `k'.  In the case of `from-abi', the macro
!      names the resolved architecture (either `"mips1"' or `"mips3"').
!      It names the default architecture when no `-march' option is given.
  
! `-mtune=ARCH'
       Optimize for ARCH.  Among other things, this option controls the
       way instructions are scheduled, and the perceived cost of
       arithmetic operations.  The list of ARCH values is the same as for
!      `-march'.
  
       When this option is not used, GCC optimizes for the processor
!      specified by `-march'.  By using `-march' and `-mtune' together,
!      it is possible to generate code that runs on a family of
!      processors, but optimize the code for one particular member of
!      that family.
  
!      `-mtune' defines the macros `_MIPS_TUNE' and `_MIPS_TUNE_FOO',
!      which work in the same way as the `-march' ones described above.
  
! `-mips1'
!      Equivalent to `-march=mips1'.
  
! `-mips2'
!      Equivalent to `-march=mips2'.
  
! `-mips3'
!      Equivalent to `-march=mips3'.
  
! `-mips4'
!      Equivalent to `-march=mips4'.
  
! `-mips32'
!      Equivalent to `-march=mips32'.
  
! `-mips32r3'
!      Equivalent to `-march=mips32r3'.
  
! `-mips32r5'
!      Equivalent to `-march=mips32r5'.
  
! `-mips32r6'
!      Equivalent to `-march=mips32r6'.
  
! `-mips64'
!      Equivalent to `-march=mips64'.
  
! `-mips64r2'
!      Equivalent to `-march=mips64r2'.
  
! `-mips64r3'
!      Equivalent to `-march=mips64r3'.
  
! `-mips64r5'
!      Equivalent to `-march=mips64r5'.
  
! `-mips64r6'
!      Equivalent to `-march=mips64r6'.
  
! `-mips16'
! `-mno-mips16'
       Generate (do not generate) MIPS16 code.  If GCC is targeting a
       MIPS32 or MIPS64 architecture, it makes use of the MIPS16e ASE.
  
       MIPS16 code generation can also be controlled on a per-function
!      basis by means of `mips16' and `nomips16' attributes.  *Note
       Function Attributes::, for more information.
  
! `-mflip-mips16'
       Generate MIPS16 code on alternating functions.  This option is
       provided for regression testing of mixed MIPS16/non-MIPS16 code
       generation, and is not intended for ordinary use in compiling user
       code.
  
! `-minterlink-compressed'
! 
! `-mno-interlink-compressed'
       Require (do not require) that code using the standard
       (uncompressed) MIPS ISA be link-compatible with MIPS16 and
       microMIPS code, and vice versa.
  
       For example, code using the standard ISA encoding cannot jump
       directly to MIPS16 or microMIPS code; it must either use a call or
!      an indirect jump.  `-minterlink-compressed' therefore disables
       direct jumps unless GCC knows that the target of the jump is not
       compressed.
  
! `-minterlink-mips16'
! `-mno-interlink-mips16'
!      Aliases of `-minterlink-compressed' and
!      `-mno-interlink-compressed'.  These options predate the microMIPS
       ASE and are retained for backwards compatibility.
  
! `-mabi=32'
! `-mabi=o64'
! `-mabi=n32'
! `-mabi=64'
! `-mabi=eabi'
       Generate code for the given ABI.
  
       Note that the EABI has a 32-bit and a 64-bit variant.  GCC normally
       generates 64-bit code when you select a 64-bit architecture, but
!      you can use `-mgp32' to get 32-bit code instead.
  
       For information about the O64 ABI, see
!      `http://gcc.gnu.org/projects/mipso64-abi.html'.
  
       GCC supports a variant of the o32 ABI in which floating-point
       registers are 64 rather than 32 bits wide.  You can select this
!      combination with `-mabi=32' `-mfp64'.  This ABI relies on the
!      `mthc1' and `mfhc1' instructions and is therefore only supported
       for MIPS32R2, MIPS32R3 and MIPS32R5 processors.
  
       The register assignments for arguments and return values remain the
       same, but each scalar value is passed in a single 64-bit register
       rather than a pair of 32-bit registers.  For example, scalar
!      floating-point values are returned in `$f0' only, not a
!      `$f0'/`$f1' pair.  The set of call-saved registers also remains
!      the same in that the even-numbered double-precision registers are
!      saved.
  
       Two additional variants of the o32 ABI are supported to enable a
       transition from 32-bit to 64-bit registers.  These are FPXX
!      (`-mfpxx') and FP64A (`-mfp64' `-mno-odd-spreg').  The FPXX
       extension mandates that all code must execute correctly when run
!      using 32-bit or 64-bit registers.  The code can be interlinked
!      with either FP32 or FP64, but not both.  The FP64A extension is
!      similar to the FP64 extension but forbids the use of odd-numbered
       single-precision registers.  This can be used in conjunction with
!      the `FRE' mode of FPUs in MIPS32R5 processors and allows both FP32
       and FP64A code to interlink and run in the same process without
       changing FPU modes.
  
! `-mabicalls'
! `-mno-abicalls'
       Generate (do not generate) code that is suitable for SVR4-style
!      dynamic objects.  `-mabicalls' is the default for SVR4-based
       systems.
  
! `-mshared'
! `-mno-shared'
       Generate (do not generate) code that is fully position-independent,
       and that can therefore be linked into shared libraries.  This
!      option only affects `-mabicalls'.
  
!      All `-mabicalls' code has traditionally been position-independent,
!      regardless of options like `-fPIC' and `-fpic'.  However, as an
       extension, the GNU toolchain allows executables to use absolute
       accesses for locally-binding symbols.  It can also use shorter GP
       initialization sequences and generate direct calls to
!      locally-defined functions.  This mode is selected by `-mno-shared'.
  
!      `-mno-shared' depends on binutils 2.16 or higher and generates
       objects that can only be linked by the GNU linker.  However, the
       option does not affect the ABI of the final executable; it only
!      affects the ABI of relocatable objects.  Using `-mno-shared'
       generally makes executables both smaller and quicker.
  
!      `-mshared' is the default.
  
! `-mplt'
! `-mno-plt'
       Assume (do not assume) that the static and dynamic linkers support
!      PLTs and copy relocations.  This option only affects `-mno-shared
       -mabicalls'.  For the n64 ABI, this option has no effect without
!      `-msym32'.
  
!      You can make `-mplt' the default by configuring GCC with
!      `--with-mips-plt'.  The default is `-mno-plt' otherwise.
  
! `-mxgot'
! `-mno-xgot'
       Lift (do not lift) the usual restrictions on the size of the global
       offset table.
  
--- 15840,16066 ----
  3.17.25 MIPS Options
  --------------------
  
! '-EB'
       Generate big-endian code.
  
! '-EL'
!      Generate little-endian code.  This is the default for 'mips*el-*-*'
       configurations.
  
! '-march=ARCH'
!      Generate code that runs on ARCH, which can be the name of a generic
!      MIPS ISA, or the name of a particular processor.  The ISA names
!      are: 'mips1', 'mips2', 'mips3', 'mips4', 'mips32', 'mips32r2',
!      'mips32r3', 'mips32r5', 'mips32r6', 'mips64', 'mips64r2',
!      'mips64r3', 'mips64r5' and 'mips64r6'.  The processor names are:
!      '4kc', '4km', '4kp', '4ksc', '4kec', '4kem', '4kep', '4ksd', '5kc',
!      '5kf', '20kc', '24kc', '24kf2_1', '24kf1_1', '24kec', '24kef2_1',
!      '24kef1_1', '34kc', '34kf2_1', '34kf1_1', '34kn', '74kc',
!      '74kf2_1', '74kf1_1', '74kf3_2', '1004kc', '1004kf2_1',
!      '1004kf1_1', 'loongson2e', 'loongson2f', 'loongson3a', 'm4k',
!      'm14k', 'm14kc', 'm14ke', 'm14kec', 'octeon', 'octeon+', 'octeon2',
!      'octeon3', 'orion', 'p5600', 'r2000', 'r3000', 'r3900', 'r4000',
!      'r4400', 'r4600', 'r4650', 'r4700', 'r6000', 'r8000', 'rm7000',
!      'rm9000', 'r10000', 'r12000', 'r14000', 'r16000', 'sb1', 'sr71000',
!      'vr4100', 'vr4111', 'vr4120', 'vr4130', 'vr4300', 'vr5000',
!      'vr5400', 'vr5500', 'xlr' and 'xlp'.  The special value 'from-abi'
!      selects the most compatible architecture for the selected ABI (that
!      is, 'mips1' for 32-bit ABIs and 'mips3' for 64-bit ABIs).
  
!      The native Linux/GNU toolchain also supports the value 'native',
       which selects the best architecture option for the host processor.
!      '-march=native' has no effect if GCC does not recognize the
       processor.
  
!      In processor names, a final '000' can be abbreviated as 'k' (for
!      example, '-march=r2k').  Prefixes are optional, and 'vr' may be
!      written 'r'.
  
!      Names of the form 'Nf2_1' refer to processors with FPUs clocked at
!      half the rate of the core, names of the form 'Nf1_1' refer to
       processors with FPUs clocked at the same rate as the core, and
!      names of the form 'Nf3_2' refer to processors with FPUs clocked a
       ratio of 3:2 with respect to the core.  For compatibility reasons,
!      'Nf' is accepted as a synonym for 'Nf2_1' while 'Nx' and 'Bfx' are
!      accepted as synonyms for 'Nf1_1'.
  
       GCC defines two macros based on the value of this option.  The
!      first is '_MIPS_ARCH', which gives the name of target architecture,
!      as a string.  The second has the form '_MIPS_ARCH_FOO', where FOO
!      is the capitalized value of '_MIPS_ARCH'.  For example,
!      '-march=r2000' sets '_MIPS_ARCH' to '"r2000"' and defines the macro
!      '_MIPS_ARCH_R2000'.
  
!      Note that the '_MIPS_ARCH' macro uses the processor names given
       above.  In other words, it has the full prefix and does not
!      abbreviate '000' as 'k'.  In the case of 'from-abi', the macro
!      names the resolved architecture (either '"mips1"' or '"mips3"').
!      It names the default architecture when no '-march' option is given.
  
! '-mtune=ARCH'
       Optimize for ARCH.  Among other things, this option controls the
       way instructions are scheduled, and the perceived cost of
       arithmetic operations.  The list of ARCH values is the same as for
!      '-march'.
  
       When this option is not used, GCC optimizes for the processor
!      specified by '-march'.  By using '-march' and '-mtune' together, it
!      is possible to generate code that runs on a family of processors,
!      but optimize the code for one particular member of that family.
  
!      '-mtune' defines the macros '_MIPS_TUNE' and '_MIPS_TUNE_FOO',
!      which work in the same way as the '-march' ones described above.
  
! '-mips1'
!      Equivalent to '-march=mips1'.
  
! '-mips2'
!      Equivalent to '-march=mips2'.
  
! '-mips3'
!      Equivalent to '-march=mips3'.
  
! '-mips4'
!      Equivalent to '-march=mips4'.
  
! '-mips32'
!      Equivalent to '-march=mips32'.
  
! '-mips32r3'
!      Equivalent to '-march=mips32r3'.
  
! '-mips32r5'
!      Equivalent to '-march=mips32r5'.
  
! '-mips32r6'
!      Equivalent to '-march=mips32r6'.
  
! '-mips64'
!      Equivalent to '-march=mips64'.
  
! '-mips64r2'
!      Equivalent to '-march=mips64r2'.
  
! '-mips64r3'
!      Equivalent to '-march=mips64r3'.
  
! '-mips64r5'
!      Equivalent to '-march=mips64r5'.
  
! '-mips64r6'
!      Equivalent to '-march=mips64r6'.
  
! '-mips16'
! '-mno-mips16'
       Generate (do not generate) MIPS16 code.  If GCC is targeting a
       MIPS32 or MIPS64 architecture, it makes use of the MIPS16e ASE.
  
       MIPS16 code generation can also be controlled on a per-function
!      basis by means of 'mips16' and 'nomips16' attributes.  *Note
       Function Attributes::, for more information.
  
! '-mflip-mips16'
       Generate MIPS16 code on alternating functions.  This option is
       provided for regression testing of mixed MIPS16/non-MIPS16 code
       generation, and is not intended for ordinary use in compiling user
       code.
  
! '-minterlink-compressed'
! '-mno-interlink-compressed'
       Require (do not require) that code using the standard
       (uncompressed) MIPS ISA be link-compatible with MIPS16 and
       microMIPS code, and vice versa.
  
       For example, code using the standard ISA encoding cannot jump
       directly to MIPS16 or microMIPS code; it must either use a call or
!      an indirect jump.  '-minterlink-compressed' therefore disables
       direct jumps unless GCC knows that the target of the jump is not
       compressed.
  
! '-minterlink-mips16'
! '-mno-interlink-mips16'
!      Aliases of '-minterlink-compressed' and
!      '-mno-interlink-compressed'.  These options predate the microMIPS
       ASE and are retained for backwards compatibility.
  
! '-mabi=32'
! '-mabi=o64'
! '-mabi=n32'
! '-mabi=64'
! '-mabi=eabi'
       Generate code for the given ABI.
  
       Note that the EABI has a 32-bit and a 64-bit variant.  GCC normally
       generates 64-bit code when you select a 64-bit architecture, but
!      you can use '-mgp32' to get 32-bit code instead.
  
       For information about the O64 ABI, see
!      <http://gcc.gnu.org/projects/mipso64-abi.html>.
  
       GCC supports a variant of the o32 ABI in which floating-point
       registers are 64 rather than 32 bits wide.  You can select this
!      combination with '-mabi=32' '-mfp64'.  This ABI relies on the
!      'mthc1' and 'mfhc1' instructions and is therefore only supported
       for MIPS32R2, MIPS32R3 and MIPS32R5 processors.
  
       The register assignments for arguments and return values remain the
       same, but each scalar value is passed in a single 64-bit register
       rather than a pair of 32-bit registers.  For example, scalar
!      floating-point values are returned in '$f0' only, not a '$f0'/'$f1'
!      pair.  The set of call-saved registers also remains the same in
!      that the even-numbered double-precision registers are saved.
  
       Two additional variants of the o32 ABI are supported to enable a
       transition from 32-bit to 64-bit registers.  These are FPXX
!      ('-mfpxx') and FP64A ('-mfp64' '-mno-odd-spreg').  The FPXX
       extension mandates that all code must execute correctly when run
!      using 32-bit or 64-bit registers.  The code can be interlinked with
!      either FP32 or FP64, but not both.  The FP64A extension is similar
!      to the FP64 extension but forbids the use of odd-numbered
       single-precision registers.  This can be used in conjunction with
!      the 'FRE' mode of FPUs in MIPS32R5 processors and allows both FP32
       and FP64A code to interlink and run in the same process without
       changing FPU modes.
  
! '-mabicalls'
! '-mno-abicalls'
       Generate (do not generate) code that is suitable for SVR4-style
!      dynamic objects.  '-mabicalls' is the default for SVR4-based
       systems.
  
! '-mshared'
! '-mno-shared'
       Generate (do not generate) code that is fully position-independent,
       and that can therefore be linked into shared libraries.  This
!      option only affects '-mabicalls'.
  
!      All '-mabicalls' code has traditionally been position-independent,
!      regardless of options like '-fPIC' and '-fpic'.  However, as an
       extension, the GNU toolchain allows executables to use absolute
       accesses for locally-binding symbols.  It can also use shorter GP
       initialization sequences and generate direct calls to
!      locally-defined functions.  This mode is selected by '-mno-shared'.
  
!      '-mno-shared' depends on binutils 2.16 or higher and generates
       objects that can only be linked by the GNU linker.  However, the
       option does not affect the ABI of the final executable; it only
!      affects the ABI of relocatable objects.  Using '-mno-shared'
       generally makes executables both smaller and quicker.
  
!      '-mshared' is the default.
  
! '-mplt'
! '-mno-plt'
       Assume (do not assume) that the static and dynamic linkers support
!      PLTs and copy relocations.  This option only affects '-mno-shared
       -mabicalls'.  For the n64 ABI, this option has no effect without
!      '-msym32'.
  
!      You can make '-mplt' the default by configuring GCC with
!      '--with-mips-plt'.  The default is '-mno-plt' otherwise.
  
! '-mxgot'
! '-mno-xgot'
       Lift (do not lift) the usual restrictions on the size of the global
       offset table.
  
*************** File: gcc.info,  Node: MIPS Options,  Ne
*** 16135,16418 ****
  
            relocation truncated to fit: R_MIPS_GOT16 foobar
  
!      If this happens, you should recompile your code with `-mxgot'.
       This works with very large GOTs, although the code is also less
       efficient, since it takes three instructions to fetch the value of
       a global symbol.
  
       Note that some linkers can create multiple GOTs.  If you have such
!      a linker, you should only need to use `-mxgot' when a single object
       file accesses more than 64k's worth of GOT entries.  Very few do.
  
       These options have no effect unless GCC is generating position
       independent code.
  
! `-mgp32'
       Assume that general-purpose registers are 32 bits wide.
  
! `-mgp64'
       Assume that general-purpose registers are 64 bits wide.
  
! `-mfp32'
       Assume that floating-point registers are 32 bits wide.
  
! `-mfp64'
       Assume that floating-point registers are 64 bits wide.
  
! `-mfpxx'
       Do not assume the width of floating-point registers.
  
! `-mhard-float'
       Use floating-point coprocessor instructions.
  
! `-msoft-float'
       Do not use floating-point coprocessor instructions.  Implement
       floating-point calculations using library calls instead.
  
! `-mno-float'
!      Equivalent to `-msoft-float', but additionally asserts that the
       program being compiled does not perform any floating-point
       operations.  This option is presently supported only by some
       bare-metal MIPS configurations, where it may select a special set
       of libraries that lack all floating-point support (including, for
!      example, the floating-point `printf' formats).  If code compiled
!      with `-mno-float' accidentally contains floating-point operations,
       it is likely to suffer a link-time or run-time failure.
  
! `-msingle-float'
       Assume that the floating-point coprocessor only supports
       single-precision operations.
  
! `-mdouble-float'
       Assume that the floating-point coprocessor supports
       double-precision operations.  This is the default.
  
! `-modd-spreg'
! `-mno-odd-spreg'
       Enable the use of odd-numbered single-precision floating-point
!      registers for the o32 ABI.  This is the default for processors
!      that are known to support these registers.  When using the o32
!      FPXX ABI, `-mno-odd-spreg' is set by default.
  
! `-mabs=2008'
! `-mabs=legacy'
       These options control the treatment of the special not-a-number
!      (NaN) IEEE 754 floating-point data with the `abs.fmt' and
!      `neg.fmt' machine instructions.
  
!      By default or when `-mabs=legacy' is used the legacy treatment is
       selected.  In this case these instructions are considered
       arithmetic and avoided where correct operation is required and the
!      input operand might be a NaN.  A longer sequence of instructions
       that manipulate the sign bit of floating-point datum manually is
!      used instead unless the `-ffinite-math-only' option has also been
       specified.
  
!      The `-mabs=2008' option selects the IEEE 754-2008 treatment.  In
       this case these instructions are considered non-arithmetic and
!      therefore operating correctly in all cases, including in
!      particular where the input operand is a NaN.  These instructions
!      are therefore always used for the respective operations.
  
! `-mnan=2008'
! `-mnan=legacy'
       These options control the encoding of the special not-a-number
       (NaN) IEEE 754 floating-point data.
  
!      The `-mnan=legacy' option selects the legacy encoding.  In this
       case quiet NaNs (qNaNs) are denoted by the first bit of their
!      trailing significand field being 0, whereas signalling NaNs
!      (sNaNs) are denoted by the first bit of their trailing significand
!      field being 1.
  
!      The `-mnan=2008' option selects the IEEE 754-2008 encoding.  In
       this case qNaNs are denoted by the first bit of their trailing
       significand field being 1, whereas sNaNs are denoted by the first
       bit of their trailing significand field being 0.
  
!      The default is `-mnan=legacy' unless GCC has been configured with
!      `--with-nan=2008'.
  
! `-mllsc'
! `-mno-llsc'
!      Use (do not use) `ll', `sc', and `sync' instructions to implement
       atomic memory built-in functions.  When neither option is
       specified, GCC uses the instructions if the target architecture
       supports them.
  
!      `-mllsc' is useful if the runtime environment can emulate the
!      instructions and `-mno-llsc' can be useful when compiling for
       nonstandard ISAs.  You can make either option the default by
!      configuring GCC with `--with-llsc' and `--without-llsc'
!      respectively.  `--with-llsc' is the default for some
       configurations; see the installation documentation for details.
  
! `-mdsp'
! `-mno-dsp'
       Use (do not use) revision 1 of the MIPS DSP ASE.  *Note MIPS DSP
       Built-in Functions::.  This option defines the preprocessor macro
!      `__mips_dsp'.  It also defines `__mips_dsp_rev' to 1.
  
! `-mdspr2'
! `-mno-dspr2'
       Use (do not use) revision 2 of the MIPS DSP ASE.  *Note MIPS DSP
       Built-in Functions::.  This option defines the preprocessor macros
!      `__mips_dsp' and `__mips_dspr2'.  It also defines `__mips_dsp_rev'
       to 2.
  
! `-msmartmips'
! `-mno-smartmips'
       Use (do not use) the MIPS SmartMIPS ASE.
  
! `-mpaired-single'
! `-mno-paired-single'
       Use (do not use) paired-single floating-point instructions.  *Note
       MIPS Paired-Single Support::.  This option requires hardware
       floating-point support to be enabled.
  
! `-mdmx'
! `-mno-mdmx'
       Use (do not use) MIPS Digital Media Extension instructions.  This
       option can only be used when generating 64-bit code and requires
       hardware floating-point support to be enabled.
  
! `-mips3d'
! `-mno-mips3d'
       Use (do not use) the MIPS-3D ASE.  *Note MIPS-3D Built-in
!      Functions::.  The option `-mips3d' implies `-mpaired-single'.
  
! `-mmicromips'
! `-mno-micromips'
       Generate (do not generate) microMIPS code.
  
       MicroMIPS code generation can also be controlled on a per-function
!      basis by means of `micromips' and `nomicromips' attributes.  *Note
       Function Attributes::, for more information.
  
! `-mmt'
! `-mno-mt'
       Use (do not use) MT Multithreading instructions.
  
! `-mmcu'
! `-mno-mcu'
       Use (do not use) the MIPS MCU ASE instructions.
  
! `-meva'
! `-mno-eva'
       Use (do not use) the MIPS Enhanced Virtual Addressing instructions.
  
! `-mvirt'
! `-mno-virt'
       Use (do not use) the MIPS Virtualization Application Specific
       instructions.
  
! `-mxpa'
! `-mno-xpa'
       Use (do not use) the MIPS eXtended Physical Address (XPA)
       instructions.
  
! `-mlong64'
!      Force `long' types to be 64 bits wide.  See `-mlong32' for an
       explanation of the default and the way that the pointer size is
       determined.
  
! `-mlong32'
!      Force `long', `int', and pointer types to be 32 bits wide.
  
!      The default size of `int's, `long's and pointers depends on the
!      ABI.  All the supported ABIs use 32-bit `int's.  The n64 ABI uses
!      64-bit `long's, as does the 64-bit EABI; the others use 32-bit
!      `long's.  Pointers are the same size as `long's, or the same size
       as integer registers, whichever is smaller.
  
! `-msym32'
! `-mno-sym32'
       Assume (do not assume) that all symbols have 32-bit values,
       regardless of the selected ABI.  This option is useful in
!      combination with `-mabi=64' and `-mno-abicalls' because it allows
       GCC to generate shorter and faster references to symbolic
       addresses.
  
! `-G NUM'
       Put definitions of externally-visible data in a small data section
       if that data is no bigger than NUM bytes.  GCC can then generate
!      more efficient accesses to the data; see `-mgpopt' for details.
  
!      The default `-G' option depends on the configuration.
  
! `-mlocal-sdata'
! `-mno-local-sdata'
!      Extend (do not extend) the `-G' behavior to local data too, such
!      as to static variables in C.  `-mlocal-sdata' is the default for
!      all configurations.
  
!      If the linker complains that an application is using too much
!      small data, you might want to try rebuilding the less
!      performance-critical parts with `-mno-local-sdata'.  You might
!      also want to build large libraries with `-mno-local-sdata', so
!      that the libraries leave more room for the main program.
  
! `-mextern-sdata'
! `-mno-extern-sdata'
       Assume (do not assume) that externally-defined data is in a small
!      data section if the size of that data is within the `-G' limit.
!      `-mextern-sdata' is the default for all configurations.
  
!      If you compile a module MOD with `-mextern-sdata' `-G NUM'
!      `-mgpopt', and MOD references a variable VAR that is no bigger
!      than NUM bytes, you must make sure that VAR is placed in a small
!      data section.  If VAR is defined by another module, you must
!      either compile that module with a high-enough `-G' setting or
!      attach a `section' attribute to VAR's definition.  If VAR is
!      common, you must link the application with a high-enough `-G'
!      setting.
  
       The easiest way of satisfying these restrictions is to compile and
!      link every module with the same `-G' option.  However, you may
!      wish to build a library that supports several different small data
       limits.  You can do this by compiling the library with the highest
!      supported `-G' setting and additionally using `-mno-extern-sdata'
       to stop the library from making assumptions about
       externally-defined data.
  
! `-mgpopt'
! `-mno-gpopt'
!      Use (do not use) GP-relative accesses for symbols that are known
!      to be in a small data section; see `-G', `-mlocal-sdata' and
!      `-mextern-sdata'.  `-mgpopt' is the default for all configurations.
  
!      `-mno-gpopt' is useful for cases where the `$gp' register might
!      not hold the value of `_gp'.  For example, if the code is part of
!      a library that might be used in a boot monitor, programs that call
!      boot monitor routines pass an unknown value in `$gp'.  (In such
       situations, the boot monitor itself is usually compiled with
!      `-G0'.)
  
!      `-mno-gpopt' implies `-mno-local-sdata' and `-mno-extern-sdata'.
  
! `-membedded-data'
! `-mno-embedded-data'
!      Allocate variables to the read-only data section first if
!      possible, then next in the small data section if possible,
!      otherwise in data.  This gives slightly slower code than the
!      default, but reduces the amount of RAM required when executing,
!      and thus may be preferred for some embedded systems.
  
! `-muninit-const-in-rodata'
! `-mno-uninit-const-in-rodata'
!      Put uninitialized `const' variables in the read-only data section.
       This option is only meaningful in conjunction with
!      `-membedded-data'.
  
! `-mcode-readable=SETTING'
       Specify whether GCC may generate code that reads from executable
       sections.  There are three possible settings:
  
!     `-mcode-readable=yes'
            Instructions may freely access executable sections.  This is
            the default setting.
  
!     `-mcode-readable=pcrel'
            MIPS16 PC-relative load instructions can access executable
            sections, but other instructions must not do so.  This option
            is useful on 4KSc and 4KSd processors when the code TLBs have
--- 16071,16353 ----
  
            relocation truncated to fit: R_MIPS_GOT16 foobar
  
!      If this happens, you should recompile your code with '-mxgot'.
       This works with very large GOTs, although the code is also less
       efficient, since it takes three instructions to fetch the value of
       a global symbol.
  
       Note that some linkers can create multiple GOTs.  If you have such
!      a linker, you should only need to use '-mxgot' when a single object
       file accesses more than 64k's worth of GOT entries.  Very few do.
  
       These options have no effect unless GCC is generating position
       independent code.
  
! '-mgp32'
       Assume that general-purpose registers are 32 bits wide.
  
! '-mgp64'
       Assume that general-purpose registers are 64 bits wide.
  
! '-mfp32'
       Assume that floating-point registers are 32 bits wide.
  
! '-mfp64'
       Assume that floating-point registers are 64 bits wide.
  
! '-mfpxx'
       Do not assume the width of floating-point registers.
  
! '-mhard-float'
       Use floating-point coprocessor instructions.
  
! '-msoft-float'
       Do not use floating-point coprocessor instructions.  Implement
       floating-point calculations using library calls instead.
  
! '-mno-float'
!      Equivalent to '-msoft-float', but additionally asserts that the
       program being compiled does not perform any floating-point
       operations.  This option is presently supported only by some
       bare-metal MIPS configurations, where it may select a special set
       of libraries that lack all floating-point support (including, for
!      example, the floating-point 'printf' formats).  If code compiled
!      with '-mno-float' accidentally contains floating-point operations,
       it is likely to suffer a link-time or run-time failure.
  
! '-msingle-float'
       Assume that the floating-point coprocessor only supports
       single-precision operations.
  
! '-mdouble-float'
       Assume that the floating-point coprocessor supports
       double-precision operations.  This is the default.
  
! '-modd-spreg'
! '-mno-odd-spreg'
       Enable the use of odd-numbered single-precision floating-point
!      registers for the o32 ABI. This is the default for processors that
!      are known to support these registers.  When using the o32 FPXX ABI,
!      '-mno-odd-spreg' is set by default.
  
! '-mabs=2008'
! '-mabs=legacy'
       These options control the treatment of the special not-a-number
!      (NaN) IEEE 754 floating-point data with the 'abs.fmt' and 'neg.fmt'
!      machine instructions.
  
!      By default or when '-mabs=legacy' is used the legacy treatment is
       selected.  In this case these instructions are considered
       arithmetic and avoided where correct operation is required and the
!      input operand might be a NaN. A longer sequence of instructions
       that manipulate the sign bit of floating-point datum manually is
!      used instead unless the '-ffinite-math-only' option has also been
       specified.
  
!      The '-mabs=2008' option selects the IEEE 754-2008 treatment.  In
       this case these instructions are considered non-arithmetic and
!      therefore operating correctly in all cases, including in particular
!      where the input operand is a NaN. These instructions are therefore
!      always used for the respective operations.
  
! '-mnan=2008'
! '-mnan=legacy'
       These options control the encoding of the special not-a-number
       (NaN) IEEE 754 floating-point data.
  
!      The '-mnan=legacy' option selects the legacy encoding.  In this
       case quiet NaNs (qNaNs) are denoted by the first bit of their
!      trailing significand field being 0, whereas signalling NaNs (sNaNs)
!      are denoted by the first bit of their trailing significand field
!      being 1.
  
!      The '-mnan=2008' option selects the IEEE 754-2008 encoding.  In
       this case qNaNs are denoted by the first bit of their trailing
       significand field being 1, whereas sNaNs are denoted by the first
       bit of their trailing significand field being 0.
  
!      The default is '-mnan=legacy' unless GCC has been configured with
!      '--with-nan=2008'.
  
! '-mllsc'
! '-mno-llsc'
!      Use (do not use) 'll', 'sc', and 'sync' instructions to implement
       atomic memory built-in functions.  When neither option is
       specified, GCC uses the instructions if the target architecture
       supports them.
  
!      '-mllsc' is useful if the runtime environment can emulate the
!      instructions and '-mno-llsc' can be useful when compiling for
       nonstandard ISAs.  You can make either option the default by
!      configuring GCC with '--with-llsc' and '--without-llsc'
!      respectively.  '--with-llsc' is the default for some
       configurations; see the installation documentation for details.
  
! '-mdsp'
! '-mno-dsp'
       Use (do not use) revision 1 of the MIPS DSP ASE.  *Note MIPS DSP
       Built-in Functions::.  This option defines the preprocessor macro
!      '__mips_dsp'.  It also defines '__mips_dsp_rev' to 1.
  
! '-mdspr2'
! '-mno-dspr2'
       Use (do not use) revision 2 of the MIPS DSP ASE.  *Note MIPS DSP
       Built-in Functions::.  This option defines the preprocessor macros
!      '__mips_dsp' and '__mips_dspr2'.  It also defines '__mips_dsp_rev'
       to 2.
  
! '-msmartmips'
! '-mno-smartmips'
       Use (do not use) the MIPS SmartMIPS ASE.
  
! '-mpaired-single'
! '-mno-paired-single'
       Use (do not use) paired-single floating-point instructions.  *Note
       MIPS Paired-Single Support::.  This option requires hardware
       floating-point support to be enabled.
  
! '-mdmx'
! '-mno-mdmx'
       Use (do not use) MIPS Digital Media Extension instructions.  This
       option can only be used when generating 64-bit code and requires
       hardware floating-point support to be enabled.
  
! '-mips3d'
! '-mno-mips3d'
       Use (do not use) the MIPS-3D ASE.  *Note MIPS-3D Built-in
!      Functions::.  The option '-mips3d' implies '-mpaired-single'.
  
! '-mmicromips'
! '-mno-micromips'
       Generate (do not generate) microMIPS code.
  
       MicroMIPS code generation can also be controlled on a per-function
!      basis by means of 'micromips' and 'nomicromips' attributes.  *Note
       Function Attributes::, for more information.
  
! '-mmt'
! '-mno-mt'
       Use (do not use) MT Multithreading instructions.
  
! '-mmcu'
! '-mno-mcu'
       Use (do not use) the MIPS MCU ASE instructions.
  
! '-meva'
! '-mno-eva'
       Use (do not use) the MIPS Enhanced Virtual Addressing instructions.
  
! '-mvirt'
! '-mno-virt'
       Use (do not use) the MIPS Virtualization Application Specific
       instructions.
  
! '-mxpa'
! '-mno-xpa'
       Use (do not use) the MIPS eXtended Physical Address (XPA)
       instructions.
  
! '-mlong64'
!      Force 'long' types to be 64 bits wide.  See '-mlong32' for an
       explanation of the default and the way that the pointer size is
       determined.
  
! '-mlong32'
!      Force 'long', 'int', and pointer types to be 32 bits wide.
  
!      The default size of 'int's, 'long's and pointers depends on the
!      ABI.  All the supported ABIs use 32-bit 'int's.  The n64 ABI uses
!      64-bit 'long's, as does the 64-bit EABI; the others use 32-bit
!      'long's.  Pointers are the same size as 'long's, or the same size
       as integer registers, whichever is smaller.
  
! '-msym32'
! '-mno-sym32'
       Assume (do not assume) that all symbols have 32-bit values,
       regardless of the selected ABI.  This option is useful in
!      combination with '-mabi=64' and '-mno-abicalls' because it allows
       GCC to generate shorter and faster references to symbolic
       addresses.
  
! '-G NUM'
       Put definitions of externally-visible data in a small data section
       if that data is no bigger than NUM bytes.  GCC can then generate
!      more efficient accesses to the data; see '-mgpopt' for details.
  
!      The default '-G' option depends on the configuration.
  
! '-mlocal-sdata'
! '-mno-local-sdata'
!      Extend (do not extend) the '-G' behavior to local data too, such as
!      to static variables in C.  '-mlocal-sdata' is the default for all
!      configurations.
  
!      If the linker complains that an application is using too much small
!      data, you might want to try rebuilding the less
!      performance-critical parts with '-mno-local-sdata'.  You might also
!      want to build large libraries with '-mno-local-sdata', so that the
!      libraries leave more room for the main program.
  
! '-mextern-sdata'
! '-mno-extern-sdata'
       Assume (do not assume) that externally-defined data is in a small
!      data section if the size of that data is within the '-G' limit.
!      '-mextern-sdata' is the default for all configurations.
  
!      If you compile a module MOD with '-mextern-sdata' '-G NUM'
!      '-mgpopt', and MOD references a variable VAR that is no bigger than
!      NUM bytes, you must make sure that VAR is placed in a small data
!      section.  If VAR is defined by another module, you must either
!      compile that module with a high-enough '-G' setting or attach a
!      'section' attribute to VAR's definition.  If VAR is common, you
!      must link the application with a high-enough '-G' setting.
  
       The easiest way of satisfying these restrictions is to compile and
!      link every module with the same '-G' option.  However, you may wish
!      to build a library that supports several different small data
       limits.  You can do this by compiling the library with the highest
!      supported '-G' setting and additionally using '-mno-extern-sdata'
       to stop the library from making assumptions about
       externally-defined data.
  
! '-mgpopt'
! '-mno-gpopt'
!      Use (do not use) GP-relative accesses for symbols that are known to
!      be in a small data section; see '-G', '-mlocal-sdata' and
!      '-mextern-sdata'.  '-mgpopt' is the default for all configurations.
  
!      '-mno-gpopt' is useful for cases where the '$gp' register might not
!      hold the value of '_gp'.  For example, if the code is part of a
!      library that might be used in a boot monitor, programs that call
!      boot monitor routines pass an unknown value in '$gp'.  (In such
       situations, the boot monitor itself is usually compiled with
!      '-G0'.)
  
!      '-mno-gpopt' implies '-mno-local-sdata' and '-mno-extern-sdata'.
  
! '-membedded-data'
! '-mno-embedded-data'
!      Allocate variables to the read-only data section first if possible,
!      then next in the small data section if possible, otherwise in data.
!      This gives slightly slower code than the default, but reduces the
!      amount of RAM required when executing, and thus may be preferred
!      for some embedded systems.
  
! '-muninit-const-in-rodata'
! '-mno-uninit-const-in-rodata'
!      Put uninitialized 'const' variables in the read-only data section.
       This option is only meaningful in conjunction with
!      '-membedded-data'.
  
! '-mcode-readable=SETTING'
       Specify whether GCC may generate code that reads from executable
       sections.  There are three possible settings:
  
!      '-mcode-readable=yes'
            Instructions may freely access executable sections.  This is
            the default setting.
  
!      '-mcode-readable=pcrel'
            MIPS16 PC-relative load instructions can access executable
            sections, but other instructions must not do so.  This option
            is useful on 4KSc and 4KSd processors when the code TLBs have
*************** File: gcc.info,  Node: MIPS Options,  Ne
*** 16421,16585 ****
            interface and that, like the M4K, automatically redirect
            PC-relative loads to the instruction RAM.
  
!     `-mcode-readable=no'
!           Instructions must not access executable sections.  This
!           option can be useful on targets that are configured to have a
!           dual instruction/data SRAM interface but that (unlike the
!           M4K) do not automatically redirect PC-relative loads to the
            instruction RAM.
  
! `-msplit-addresses'
! `-mno-split-addresses'
!      Enable (disable) use of the `%hi()' and `%lo()' assembler
       relocation operators.  This option has been superseded by
!      `-mexplicit-relocs' but is retained for backwards compatibility.
  
! `-mexplicit-relocs'
! `-mno-explicit-relocs'
       Use (do not use) assembler relocation operators when dealing with
       symbolic addresses.  The alternative, selected by
!      `-mno-explicit-relocs', is to use assembler macros instead.
  
!      `-mexplicit-relocs' is the default if GCC was configured to use an
       assembler that supports relocation operators.
  
! `-mcheck-zero-division'
! `-mno-check-zero-division'
       Trap (do not trap) on integer division by zero.
  
!      The default is `-mcheck-zero-division'.
  
! `-mdivide-traps'
! `-mdivide-breaks'
       MIPS systems check for division by zero by generating either a
       conditional trap or a break instruction.  Using traps results in
       smaller code, but is only supported on MIPS II and later.  Also,
       some versions of the Linux kernel have a bug that prevents trap
!      from generating the proper signal (`SIGFPE').  Use
!      `-mdivide-traps' to allow conditional traps on architectures that
!      support them and `-mdivide-breaks' to force the use of breaks.
  
!      The default is usually `-mdivide-traps', but this can be
!      overridden at configure time using `--with-divide=breaks'.
!      Divide-by-zero checks can be completely disabled using
!      `-mno-check-zero-division'.
  
! `-mmemcpy'
! `-mno-memcpy'
!      Force (do not force) the use of `memcpy' for non-trivial block
!      moves.  The default is `-mno-memcpy', which allows GCC to inline
       most constant-sized copies.
  
! `-mlong-calls'
! `-mno-long-calls'
!      Disable (do not disable) use of the `jal' instruction.  Calling
!      functions using `jal' is more efficient but requires the caller
!      and callee to be in the same 256 megabyte segment.
  
       This option has no effect on abicalls code.  The default is
!      `-mno-long-calls'.
  
! `-mmad'
! `-mno-mad'
!      Enable (disable) use of the `mad', `madu' and `mul' instructions,
       as provided by the R4650 ISA.
  
! `-mimadd'
! `-mno-imadd'
!      Enable (disable) use of the `madd' and `msub' integer
!      instructions.  The default is `-mimadd' on architectures that
!      support `madd' and `msub' except for the 74k architecture where it
!      was found to generate slower code.
  
! `-mfused-madd'
! `-mno-fused-madd'
       Enable (disable) use of the floating-point multiply-accumulate
       instructions, when they are available.  The default is
!      `-mfused-madd'.
  
       On the R8000 CPU when multiply-accumulate instructions are used,
!      the intermediate product is calculated to infinite precision and
!      is not subject to the FCSR Flush to Zero bit.  This may be
!      undesirable in some circumstances.  On other processors the result
!      is numerically identical to the equivalent computation using
!      separate multiply, add, subtract and negate instructions.
  
! `-nocpp'
       Tell the MIPS assembler to not run its preprocessor over user
!      assembler files (with a `.s' suffix) when assembling them.
! 
! `-mfix-24k'
  
! `-mno-fix-24k'
       Work around the 24K E48 (lost data on stores during refill) errata.
       The workarounds are implemented by the assembler rather than by
       GCC.
  
! `-mfix-r4000'
! `-mno-fix-r4000'
       Work around certain R4000 CPU errata:
!         - A double-word or a variable shift may give an incorrect
!           result if executed immediately after starting an integer
!           division.
! 
!         - A double-word or a variable shift may give an incorrect
!           result if executed while an integer multiplication is in
!           progress.
! 
!         - An integer division may give an incorrect result if started
!           in a delay slot of a taken branch or a jump.
  
! `-mfix-r4400'
! `-mno-fix-r4400'
       Work around certain R4400 CPU errata:
!         - A double-word or a variable shift may give an incorrect
!           result if executed immediately after starting an integer
!           division.
  
! `-mfix-r10000'
! `-mno-fix-r10000'
       Work around certain R10000 errata:
!         - `ll'/`sc' sequences may not behave atomically on revisions
            prior to 3.0.  They may deadlock on revisions 2.6 and earlier.
  
       This option can only be used if the target architecture supports
!      branch-likely instructions.  `-mfix-r10000' is the default when
!      `-march=r10000' is used; `-mno-fix-r10000' is the default
       otherwise.
  
! `-mfix-rm7000'
! `-mno-fix-rm7000'
!      Work around the RM7000 `dmult'/`dmultu' errata.  The workarounds
       are implemented by the assembler rather than by GCC.
  
! `-mfix-vr4120'
! `-mno-fix-vr4120'
       Work around certain VR4120 errata:
!         - `dmultu' does not always produce the correct result.
! 
!         - `div' and `ddiv' do not always produce the correct result if
            one of the operands is negative.
       The workarounds for the division errata rely on special functions
!      in `libgcc.a'.  At present, these functions are only provided by
!      the `mips64vr*-elf' configurations.
  
       Other VR4120 errata require a NOP to be inserted between certain
       pairs of instructions.  These errata are handled by the assembler,
       not by GCC itself.
  
! `-mfix-vr4130'
!      Work around the VR4130 `mflo'/`mfhi' errata.  The workarounds are
       implemented by the assembler rather than by GCC, although GCC
!      avoids using `mflo' and `mfhi' if the VR4130 `macc', `macchi',
!      `dmacc' and `dmacchi' instructions are available instead.
  
! `-mfix-sb1'
! `-mno-fix-sb1'
       Work around certain SB-1 CPU core errata.  (This flag currently
       works around the SB-1 revision 2 "F1" and "F2" floating-point
       errata.)
  
! `-mr10k-cache-barrier=SETTING'
       Specify whether GCC should insert cache barriers to avoid the
       side-effects of speculation on R10K processors.
  
--- 16356,16512 ----
            interface and that, like the M4K, automatically redirect
            PC-relative loads to the instruction RAM.
  
!      '-mcode-readable=no'
!           Instructions must not access executable sections.  This option
!           can be useful on targets that are configured to have a dual
!           instruction/data SRAM interface but that (unlike the M4K) do
!           not automatically redirect PC-relative loads to the
            instruction RAM.
  
! '-msplit-addresses'
! '-mno-split-addresses'
!      Enable (disable) use of the '%hi()' and '%lo()' assembler
       relocation operators.  This option has been superseded by
!      '-mexplicit-relocs' but is retained for backwards compatibility.
  
! '-mexplicit-relocs'
! '-mno-explicit-relocs'
       Use (do not use) assembler relocation operators when dealing with
       symbolic addresses.  The alternative, selected by
!      '-mno-explicit-relocs', is to use assembler macros instead.
  
!      '-mexplicit-relocs' is the default if GCC was configured to use an
       assembler that supports relocation operators.
  
! '-mcheck-zero-division'
! '-mno-check-zero-division'
       Trap (do not trap) on integer division by zero.
  
!      The default is '-mcheck-zero-division'.
  
! '-mdivide-traps'
! '-mdivide-breaks'
       MIPS systems check for division by zero by generating either a
       conditional trap or a break instruction.  Using traps results in
       smaller code, but is only supported on MIPS II and later.  Also,
       some versions of the Linux kernel have a bug that prevents trap
!      from generating the proper signal ('SIGFPE').  Use '-mdivide-traps'
!      to allow conditional traps on architectures that support them and
!      '-mdivide-breaks' to force the use of breaks.
  
!      The default is usually '-mdivide-traps', but this can be overridden
!      at configure time using '--with-divide=breaks'.  Divide-by-zero
!      checks can be completely disabled using '-mno-check-zero-division'.
  
! '-mmemcpy'
! '-mno-memcpy'
!      Force (do not force) the use of 'memcpy' for non-trivial block
!      moves.  The default is '-mno-memcpy', which allows GCC to inline
       most constant-sized copies.
  
! '-mlong-calls'
! '-mno-long-calls'
!      Disable (do not disable) use of the 'jal' instruction.  Calling
!      functions using 'jal' is more efficient but requires the caller and
!      callee to be in the same 256 megabyte segment.
  
       This option has no effect on abicalls code.  The default is
!      '-mno-long-calls'.
  
! '-mmad'
! '-mno-mad'
!      Enable (disable) use of the 'mad', 'madu' and 'mul' instructions,
       as provided by the R4650 ISA.
  
! '-mimadd'
! '-mno-imadd'
!      Enable (disable) use of the 'madd' and 'msub' integer instructions.
!      The default is '-mimadd' on architectures that support 'madd' and
!      'msub' except for the 74k architecture where it was found to
!      generate slower code.
  
! '-mfused-madd'
! '-mno-fused-madd'
       Enable (disable) use of the floating-point multiply-accumulate
       instructions, when they are available.  The default is
!      '-mfused-madd'.
  
       On the R8000 CPU when multiply-accumulate instructions are used,
!      the intermediate product is calculated to infinite precision and is
!      not subject to the FCSR Flush to Zero bit.  This may be undesirable
!      in some circumstances.  On other processors the result is
!      numerically identical to the equivalent computation using separate
!      multiply, add, subtract and negate instructions.
  
! '-nocpp'
       Tell the MIPS assembler to not run its preprocessor over user
!      assembler files (with a '.s' suffix) when assembling them.
  
! '-mfix-24k'
! '-mno-fix-24k'
       Work around the 24K E48 (lost data on stores during refill) errata.
       The workarounds are implemented by the assembler rather than by
       GCC.
  
! '-mfix-r4000'
! '-mno-fix-r4000'
       Work around certain R4000 CPU errata:
!         - A double-word or a variable shift may give an incorrect result
!           if executed immediately after starting an integer division.
!         - A double-word or a variable shift may give an incorrect result
!           if executed while an integer multiplication is in progress.
!         - An integer division may give an incorrect result if started in
!           a delay slot of a taken branch or a jump.
  
! '-mfix-r4400'
! '-mno-fix-r4400'
       Work around certain R4400 CPU errata:
!         - A double-word or a variable shift may give an incorrect result
!           if executed immediately after starting an integer division.
  
! '-mfix-r10000'
! '-mno-fix-r10000'
       Work around certain R10000 errata:
!         - 'll'/'sc' sequences may not behave atomically on revisions
            prior to 3.0.  They may deadlock on revisions 2.6 and earlier.
  
       This option can only be used if the target architecture supports
!      branch-likely instructions.  '-mfix-r10000' is the default when
!      '-march=r10000' is used; '-mno-fix-r10000' is the default
       otherwise.
  
! '-mfix-rm7000'
! '-mno-fix-rm7000'
!      Work around the RM7000 'dmult'/'dmultu' errata.  The workarounds
       are implemented by the assembler rather than by GCC.
  
! '-mfix-vr4120'
! '-mno-fix-vr4120'
       Work around certain VR4120 errata:
!         - 'dmultu' does not always produce the correct result.
!         - 'div' and 'ddiv' do not always produce the correct result if
            one of the operands is negative.
       The workarounds for the division errata rely on special functions
!      in 'libgcc.a'.  At present, these functions are only provided by
!      the 'mips64vr*-elf' configurations.
  
       Other VR4120 errata require a NOP to be inserted between certain
       pairs of instructions.  These errata are handled by the assembler,
       not by GCC itself.
  
! '-mfix-vr4130'
!      Work around the VR4130 'mflo'/'mfhi' errata.  The workarounds are
       implemented by the assembler rather than by GCC, although GCC
!      avoids using 'mflo' and 'mfhi' if the VR4130 'macc', 'macchi',
!      'dmacc' and 'dmacchi' instructions are available instead.
  
! '-mfix-sb1'
! '-mno-fix-sb1'
       Work around certain SB-1 CPU core errata.  (This flag currently
       works around the SB-1 revision 2 "F1" and "F2" floating-point
       errata.)
  
! '-mr10k-cache-barrier=SETTING'
       Specify whether GCC should insert cache barriers to avoid the
       side-effects of speculation on R10K processors.
  
*************** File: gcc.info,  Node: MIPS Options,  Ne
*** 16591,16609 ****
  
       This problem only affects kernel stores and, depending on the
       system, kernel loads.  As an example, a speculatively-executed
!      store may load the target memory into cache and mark the cache
!      line as dirty, even if the store itself is later aborted.  If a
!      DMA operation writes to the same area of memory before the "dirty"
!      line is flushed, the cached data overwrites the DMA-ed data.  See
!      the R10K processor manual for a full description, including other
       potential problems.
  
!      One workaround is to insert cache barrier instructions before
!      every memory access that might be speculatively executed and that
!      might have side effects even if aborted.
!      `-mr10k-cache-barrier=SETTING' controls GCC's implementation of
!      this workaround.  It assumes that aborted accesses to any byte in
!      the following regions does not have side effects:
  
         1. the memory occupied by the current function's stack frame;
  
--- 16518,16536 ----
  
       This problem only affects kernel stores and, depending on the
       system, kernel loads.  As an example, a speculatively-executed
!      store may load the target memory into cache and mark the cache line
!      as dirty, even if the store itself is later aborted.  If a DMA
!      operation writes to the same area of memory before the "dirty" line
!      is flushed, the cached data overwrites the DMA-ed data.  See the
!      R10K processor manual for a full description, including other
       potential problems.
  
!      One workaround is to insert cache barrier instructions before every
!      memory access that might be speculatively executed and that might
!      have side effects even if aborted.  '-mr10k-cache-barrier=SETTING'
!      controls GCC's implementation of this workaround.  It assumes that
!      aborted accesses to any byte in the following regions does not have
!      side effects:
  
         1. the memory occupied by the current function's stack frame;
  
*************** File: gcc.info,  Node: MIPS Options,  Ne
*** 16619,16663 ****
  
            void foo (void);
  
!      then the implementation of `foo' must allow `j foo' and `jal foo'
       to be executed speculatively.  GCC honors this restriction for
       functions it compiles itself.  It expects non-GCC functions (such
       as hand-written assembly code) to do the same.
  
       The option has three forms:
  
!     `-mr10k-cache-barrier=load-store'
            Insert a cache barrier before a load or store that might be
            speculatively executed and that might have side effects even
            if aborted.
  
!     `-mr10k-cache-barrier=store'
            Insert a cache barrier before a store that might be
            speculatively executed and that might have side effects even
            if aborted.
  
!     `-mr10k-cache-barrier=none'
            Disable the insertion of cache barriers.  This is the default
            setting.
  
! `-mflush-func=FUNC'
! `-mno-flush-func'
       Specifies the function to call to flush the I and D caches, or to
       not call any such function.  If called, the function must take the
!      same arguments as the common `_flush_func', that is, the address
!      of the memory range for which the cache is being flushed, the size
!      of the memory range, and the number 3 (to flush both caches).  The
       default depends on the target GCC was configured for, but commonly
!      is either `_flush_func' or `__cpu_flush'.
  
! `mbranch-cost=NUM'
       Set the cost of branches to roughly NUM "simple" instructions.
       This cost is only a heuristic and is not guaranteed to produce
       consistent results across releases.  A zero cost redundantly
!      selects the default, which is based on the `-mtune' setting.
  
! `-mbranch-likely'
! `-mno-branch-likely'
       Enable or disable use of Branch Likely instructions, regardless of
       the default for the selected architecture.  By default, Branch
       Likely instructions may be generated if they are supported by the
--- 16546,16590 ----
  
            void foo (void);
  
!      then the implementation of 'foo' must allow 'j foo' and 'jal foo'
       to be executed speculatively.  GCC honors this restriction for
       functions it compiles itself.  It expects non-GCC functions (such
       as hand-written assembly code) to do the same.
  
       The option has three forms:
  
!      '-mr10k-cache-barrier=load-store'
            Insert a cache barrier before a load or store that might be
            speculatively executed and that might have side effects even
            if aborted.
  
!      '-mr10k-cache-barrier=store'
            Insert a cache barrier before a store that might be
            speculatively executed and that might have side effects even
            if aborted.
  
!      '-mr10k-cache-barrier=none'
            Disable the insertion of cache barriers.  This is the default
            setting.
  
! '-mflush-func=FUNC'
! '-mno-flush-func'
       Specifies the function to call to flush the I and D caches, or to
       not call any such function.  If called, the function must take the
!      same arguments as the common '_flush_func', that is, the address of
!      the memory range for which the cache is being flushed, the size of
!      the memory range, and the number 3 (to flush both caches).  The
       default depends on the target GCC was configured for, but commonly
!      is either '_flush_func' or '__cpu_flush'.
  
! 'mbranch-cost=NUM'
       Set the cost of branches to roughly NUM "simple" instructions.
       This cost is only a heuristic and is not guaranteed to produce
       consistent results across releases.  A zero cost redundantly
!      selects the default, which is based on the '-mtune' setting.
  
! '-mbranch-likely'
! '-mno-branch-likely'
       Enable or disable use of Branch Likely instructions, regardless of
       the default for the selected architecture.  By default, Branch
       Likely instructions may be generated if they are supported by the
*************** File: gcc.info,  Node: MIPS Options,  Ne
*** 16667,16674 ****
       default because the MIPS32 and MIPS64 architectures specifically
       deprecate their use.
  
! `-mfp-exceptions'
! `-mno-fp-exceptions'
       Specifies whether FP exceptions are enabled.  This affects how FP
       instructions are scheduled for some processors.  The default is
       that FP exceptions are enabled.
--- 16594,16601 ----
       default because the MIPS32 and MIPS64 architectures specifically
       deprecate their use.
  
! '-mfp-exceptions'
! '-mno-fp-exceptions'
       Specifies whether FP exceptions are enabled.  This affects how FP
       instructions are scheduled for some processors.  The default is
       that FP exceptions are enabled.
*************** File: gcc.info,  Node: MIPS Options,  Ne
*** 16677,16684 ****
       are emitting 64-bit code, then we can use both FP pipes.
       Otherwise, we can only use one FP pipe.
  
! `-mvr4130-align'
! `-mno-vr4130-align'
       The VR4130 pipeline is two-way superscalar, but can only issue two
       instructions together if the first one is 8-byte aligned.  When
       this option is enabled, GCC aligns pairs of instructions that it
--- 16604,16611 ----
       are emitting 64-bit code, then we can use both FP pipes.
       Otherwise, we can only use one FP pipe.
  
! '-mvr4130-align'
! '-mno-vr4130-align'
       The VR4130 pipeline is two-way superscalar, but can only issue two
       instructions together if the first one is 8-byte aligned.  When
       this option is enabled, GCC aligns pairs of instructions that it
*************** File: gcc.info,  Node: MIPS Options,  Ne
*** 16686,16735 ****
  
       This option only has an effect when optimizing for the VR4130.  It
       normally makes code faster, but at the expense of making it bigger.
!      It is enabled by default at optimization level `-O3'.
  
! `-msynci'
! `-mno-synci'
!      Enable (disable) generation of `synci' instructions on
!      architectures that support it.  The `synci' instructions (if
!      enabled) are generated when `__builtin___clear_cache' is compiled.
  
!      This option defaults to `-mno-synci', but the default can be
!      overridden by configuring GCC with `--with-synci'.
  
       When compiling code for single processor systems, it is generally
!      safe to use `synci'.  However, on many multi-core (SMP) systems, it
       does not invalidate the instruction caches on all cores and may
       lead to undefined behavior.
  
! `-mrelax-pic-calls'
! `-mno-relax-pic-calls'
       Try to turn PIC calls that are normally dispatched via register
!      `$25' into direct calls.  This is only possible if the linker can
       resolve the destination at link-time and if the destination is
       within range for a direct call.
  
!      `-mrelax-pic-calls' is the default if GCC was configured to use an
!      assembler and a linker that support the `.reloc' assembly
!      directive and `-mexplicit-relocs' is in effect.  With
!      `-mno-explicit-relocs', this optimization can be performed by the
!      assembler and the linker alone without help from the compiler.
! 
! `-mmcount-ra-address'
! `-mno-mcount-ra-address'
!      Emit (do not emit) code that allows `_mcount' to modify the
!      calling function's return address.  When enabled, this option
!      extends the usual `_mcount' interface with a new RA-ADDRESS
!      parameter, which has type `intptr_t *' and is passed in register
!      `$12'.  `_mcount' can then modify the return address by doing both
!      of the following:
!         * Returning the new address in register `$31'.
  
!         * Storing the new address in `*RA-ADDRESS', if RA-ADDRESS is
            nonnull.
  
!      The default is `-mno-mcount-ra-address'.
! 
  
  
  File: gcc.info,  Node: MMIX Options,  Next: MN10300 Options,  Prev: MIPS Options,  Up: Submodel Options
--- 16613,16659 ----
  
       This option only has an effect when optimizing for the VR4130.  It
       normally makes code faster, but at the expense of making it bigger.
!      It is enabled by default at optimization level '-O3'.
  
! '-msynci'
! '-mno-synci'
!      Enable (disable) generation of 'synci' instructions on
!      architectures that support it.  The 'synci' instructions (if
!      enabled) are generated when '__builtin___clear_cache' is compiled.
  
!      This option defaults to '-mno-synci', but the default can be
!      overridden by configuring GCC with '--with-synci'.
  
       When compiling code for single processor systems, it is generally
!      safe to use 'synci'.  However, on many multi-core (SMP) systems, it
       does not invalidate the instruction caches on all cores and may
       lead to undefined behavior.
  
! '-mrelax-pic-calls'
! '-mno-relax-pic-calls'
       Try to turn PIC calls that are normally dispatched via register
!      '$25' into direct calls.  This is only possible if the linker can
       resolve the destination at link-time and if the destination is
       within range for a direct call.
  
!      '-mrelax-pic-calls' is the default if GCC was configured to use an
!      assembler and a linker that support the '.reloc' assembly directive
!      and '-mexplicit-relocs' is in effect.  With '-mno-explicit-relocs',
!      this optimization can be performed by the assembler and the linker
!      alone without help from the compiler.
  
! '-mmcount-ra-address'
! '-mno-mcount-ra-address'
!      Emit (do not emit) code that allows '_mcount' to modify the calling
!      function's return address.  When enabled, this option extends the
!      usual '_mcount' interface with a new RA-ADDRESS parameter, which
!      has type 'intptr_t *' and is passed in register '$12'.  '_mcount'
!      can then modify the return address by doing both of the following:
!         * Returning the new address in register '$31'.
!         * Storing the new address in '*RA-ADDRESS', if RA-ADDRESS is
            nonnull.
  
!      The default is '-mno-mcount-ra-address'.
  
  
  File: gcc.info,  Node: MMIX Options,  Next: MN10300 Options,  Prev: MIPS Options,  Up: Submodel Options
*************** File: gcc.info,  Node: MMIX Options,  Ne
*** 16739,16790 ****
  
  These options are defined for the MMIX:
  
! `-mlibfuncs'
! `-mno-libfuncs'
       Specify that intrinsic library functions are being compiled,
       passing all values in registers, no matter the size.
  
! `-mepsilon'
! `-mno-epsilon'
       Generate floating-point comparison instructions that compare with
!      respect to the `rE' epsilon register.
  
! `-mabi=mmixware'
! `-mabi=gnu'
       Generate code that passes function parameters and return values
!      that (in the called function) are seen as registers `$0' and up,
!      as opposed to the GNU ABI which uses global registers `$231' and
!      up.
  
! `-mzero-extend'
! `-mno-zero-extend'
       When reading data from memory in sizes shorter than 64 bits, use
       (do not use) zero-extending load instructions by default, rather
       than sign-extending ones.
  
! `-mknuthdiv'
! `-mno-knuthdiv'
       Make the result of a division yielding a remainder have the same
!      sign as the divisor.  With the default, `-mno-knuthdiv', the sign
       of the remainder follows the sign of the dividend.  Both methods
       are arithmetically valid, the latter being almost exclusively used.
  
! `-mtoplevel-symbols'
! `-mno-toplevel-symbols'
!      Prepend (do not prepend) a `:' to all global symbols, so the
!      assembly code can be used with the `PREFIX' assembly directive.
  
! `-melf'
       Generate an executable in the ELF format, rather than the default
!      `mmo' format used by the `mmix' simulator.
  
! `-mbranch-predict'
! `-mno-branch-predict'
       Use (do not use) the probable-branch instructions, when static
       branch prediction indicates a probable branch.
  
! `-mbase-addresses'
! `-mno-base-addresses'
       Generate (do not generate) code that uses _base addresses_.  Using
       a base address automatically generates a request (handled by the
       assembler and the linker) for a constant to be set up in a global
--- 16663,16713 ----
  
  These options are defined for the MMIX:
  
! '-mlibfuncs'
! '-mno-libfuncs'
       Specify that intrinsic library functions are being compiled,
       passing all values in registers, no matter the size.
  
! '-mepsilon'
! '-mno-epsilon'
       Generate floating-point comparison instructions that compare with
!      respect to the 'rE' epsilon register.
  
! '-mabi=mmixware'
! '-mabi=gnu'
       Generate code that passes function parameters and return values
!      that (in the called function) are seen as registers '$0' and up, as
!      opposed to the GNU ABI which uses global registers '$231' and up.
  
! '-mzero-extend'
! '-mno-zero-extend'
       When reading data from memory in sizes shorter than 64 bits, use
       (do not use) zero-extending load instructions by default, rather
       than sign-extending ones.
  
! '-mknuthdiv'
! '-mno-knuthdiv'
       Make the result of a division yielding a remainder have the same
!      sign as the divisor.  With the default, '-mno-knuthdiv', the sign
       of the remainder follows the sign of the dividend.  Both methods
       are arithmetically valid, the latter being almost exclusively used.
  
! '-mtoplevel-symbols'
! '-mno-toplevel-symbols'
!      Prepend (do not prepend) a ':' to all global symbols, so the
!      assembly code can be used with the 'PREFIX' assembly directive.
  
! '-melf'
       Generate an executable in the ELF format, rather than the default
!      'mmo' format used by the 'mmix' simulator.
  
! '-mbranch-predict'
! '-mno-branch-predict'
       Use (do not use) the probable-branch instructions, when static
       branch prediction indicates a probable branch.
  
! '-mbase-addresses'
! '-mno-base-addresses'
       Generate (do not generate) code that uses _base addresses_.  Using
       a base address automatically generates a request (handled by the
       assembler and the linker) for a constant to be set up in a global
*************** These options are defined for the MMIX:
*** 16792,16802 ****
       requests within the range 0 to 255 from the value held in the
       register.  The generally leads to short and fast code, but the
       number of different data items that can be addressed is limited.
!      This means that a program that uses lots of static data may
!      require `-mno-base-addresses'.
  
! `-msingle-exit'
! `-mno-single-exit'
       Force (do not force) generated code to have a single exit point in
       each function.
  
--- 16715,16725 ----
       requests within the range 0 to 255 from the value held in the
       register.  The generally leads to short and fast code, but the
       number of different data items that can be addressed is limited.
!      This means that a program that uses lots of static data may require
!      '-mno-base-addresses'.
  
! '-msingle-exit'
! '-mno-single-exit'
       Force (do not force) generated code to have a single exit point in
       each function.
  
*************** File: gcc.info,  Node: MN10300 Options,
*** 16806,16878 ****
  3.17.27 MN10300 Options
  -----------------------
  
! These `-m' options are defined for Matsushita MN10300 architectures:
  
! `-mmult-bug'
       Generate code to avoid bugs in the multiply instructions for the
       MN10300 processors.  This is the default.
  
! `-mno-mult-bug'
!      Do not generate code to avoid bugs in the multiply instructions
!      for the MN10300 processors.
  
! `-mam33'
       Generate code using features specific to the AM33 processor.
  
! `-mno-am33'
!      Do not generate code using features specific to the AM33
!      processor.  This is the default.
  
! `-mam33-2'
       Generate code using features specific to the AM33/2.0 processor.
  
! `-mam34'
       Generate code using features specific to the AM34 processor.
  
! `-mtune=CPU-TYPE'
       Use the timing characteristics of the indicated CPU type when
       scheduling instructions.  This does not change the targeted
!      processor type.  The CPU type must be one of `mn10300', `am33',
!      `am33-2' or `am34'.
  
! `-mreturn-pointer-on-d0'
       When generating a function that returns a pointer, return the
!      pointer in both `a0' and `d0'.  Otherwise, the pointer is returned
!      only in `a0', and attempts to call such functions without a
       prototype result in errors.  Note that this option is on by
!      default; use `-mno-return-pointer-on-d0' to disable it.
  
! `-mno-crt0'
       Do not link in the C run-time initialization object file.
  
! `-mrelax'
       Indicate to the linker that it should perform a relaxation
       optimization pass to shorten branches, calls and absolute memory
!      addresses.  This option only has an effect when used on the
!      command line for the final link step.
  
       This option makes symbolic debugging impossible.
  
! `-mliw'
!      Allow the compiler to generate _Long Instruction Word_
!      instructions if the target is the `AM33' or later.  This is the
!      default.  This option defines the preprocessor macro `__LIW__'.
  
! `-mnoliw'
       Do not allow the compiler to generate _Long Instruction Word_
       instructions.  This option defines the preprocessor macro
!      `__NO_LIW__'.
  
! `-msetlb'
       Allow the compiler to generate the _SETLB_ and _Lcc_ instructions
!      if the target is the `AM33' or later.  This is the default.  This
!      option defines the preprocessor macro `__SETLB__'.
  
! `-mnosetlb'
       Do not allow the compiler to generate _SETLB_ or _Lcc_
       instructions.  This option defines the preprocessor macro
!      `__NO_SETLB__'.
! 
  
  
  File: gcc.info,  Node: Moxie Options,  Next: MSP430 Options,  Prev: MN10300 Options,  Up: Submodel Options
--- 16729,16800 ----
  3.17.27 MN10300 Options
  -----------------------
  
! These '-m' options are defined for Matsushita MN10300 architectures:
  
! '-mmult-bug'
       Generate code to avoid bugs in the multiply instructions for the
       MN10300 processors.  This is the default.
  
! '-mno-mult-bug'
!      Do not generate code to avoid bugs in the multiply instructions for
!      the MN10300 processors.
  
! '-mam33'
       Generate code using features specific to the AM33 processor.
  
! '-mno-am33'
!      Do not generate code using features specific to the AM33 processor.
!      This is the default.
  
! '-mam33-2'
       Generate code using features specific to the AM33/2.0 processor.
  
! '-mam34'
       Generate code using features specific to the AM34 processor.
  
! '-mtune=CPU-TYPE'
       Use the timing characteristics of the indicated CPU type when
       scheduling instructions.  This does not change the targeted
!      processor type.  The CPU type must be one of 'mn10300', 'am33',
!      'am33-2' or 'am34'.
  
! '-mreturn-pointer-on-d0'
       When generating a function that returns a pointer, return the
!      pointer in both 'a0' and 'd0'.  Otherwise, the pointer is returned
!      only in 'a0', and attempts to call such functions without a
       prototype result in errors.  Note that this option is on by
!      default; use '-mno-return-pointer-on-d0' to disable it.
  
! '-mno-crt0'
       Do not link in the C run-time initialization object file.
  
! '-mrelax'
       Indicate to the linker that it should perform a relaxation
       optimization pass to shorten branches, calls and absolute memory
!      addresses.  This option only has an effect when used on the command
!      line for the final link step.
  
       This option makes symbolic debugging impossible.
  
! '-mliw'
!      Allow the compiler to generate _Long Instruction Word_ instructions
!      if the target is the 'AM33' or later.  This is the default.  This
!      option defines the preprocessor macro '__LIW__'.
  
! '-mnoliw'
       Do not allow the compiler to generate _Long Instruction Word_
       instructions.  This option defines the preprocessor macro
!      '__NO_LIW__'.
  
! '-msetlb'
       Allow the compiler to generate the _SETLB_ and _Lcc_ instructions
!      if the target is the 'AM33' or later.  This is the default.  This
!      option defines the preprocessor macro '__SETLB__'.
  
! '-mnosetlb'
       Do not allow the compiler to generate _SETLB_ or _Lcc_
       instructions.  This option defines the preprocessor macro
!      '__NO_SETLB__'.
  
  
  File: gcc.info,  Node: Moxie Options,  Next: MSP430 Options,  Prev: MN10300 Options,  Up: Submodel Options
*************** File: gcc.info,  Node: Moxie Options,  N
*** 16880,16900 ****
  3.17.28 Moxie Options
  ---------------------
  
! `-meb'
!      Generate big-endian code.  This is the default for `moxie-*-*'
       configurations.
  
! `-mel'
       Generate little-endian code.
  
! `-mmul.x'
       Generate mul.x and umul.x instructions.  This is the default for
!      `moxiebox-*-*' configurations.
  
! `-mno-crt0'
       Do not link in the C run-time initialization object file.
  
- 
  
  File: gcc.info,  Node: MSP430 Options,  Next: NDS32 Options,  Prev: Moxie Options,  Up: Submodel Options
  
--- 16802,16821 ----
  3.17.28 Moxie Options
  ---------------------
  
! '-meb'
!      Generate big-endian code.  This is the default for 'moxie-*-*'
       configurations.
  
! '-mel'
       Generate little-endian code.
  
! '-mmul.x'
       Generate mul.x and umul.x instructions.  This is the default for
!      'moxiebox-*-*' configurations.
  
! '-mno-crt0'
       Do not link in the C run-time initialization object file.
  
  
  File: gcc.info,  Node: MSP430 Options,  Next: NDS32 Options,  Prev: Moxie Options,  Up: Submodel Options
  
*************** File: gcc.info,  Node: MSP430 Options,
*** 16903,16969 ****
  
  These options are defined for the MSP430:
  
! `-masm-hex'
       Force assembly output to always use hex constants.  Normally such
       constants are signed decimals, but this option is available for
       testsuite and/or aesthetic purposes.
  
! `-mmcu='
       Select the MCU to target.  This is used to create a C preprocessor
       symbol based upon the MCU name, converted to upper case and pre-
!      and post-fixed with `__'.  This in turn is used by the `msp430.h'
       header file to select an MCU-specific supplementary header file.
  
       The option also sets the ISA to use.  If the MCU name is one that
       is known to only support the 430 ISA then that is selected,
!      otherwise the 430X ISA is selected.  A generic MCU name of
!      `msp430' can also be used to select the 430 ISA.  Similarly the
!      generic `msp430x' MCU name selects the 430X ISA.
  
       In addition an MCU-specific linker script is added to the linker
!      command line.  The script's name is the name of the MCU with `.ld'
!      appended.  Thus specifying `-mmcu=xxx' on the `gcc' command line
!      defines the C preprocessor symbol `__XXX__' and cause the linker
!      to search for a script called `xxx.ld'.
  
       This option is also passed on to the assembler.
  
! `-mcpu='
!      Specifies the ISA to use.  Accepted values are `msp430', `msp430x'
!      and `msp430xv2'.  This option is deprecated.  The `-mmcu=' option
       should be used to select the ISA.
  
! `-msim'
       Link to the simulator runtime libraries and linker script.
!      Overrides any scripts that would be selected by the `-mmcu='
       option.
  
! `-mlarge'
!      Use large-model addressing (20-bit pointers, 32-bit `size_t').
  
! `-msmall'
!      Use small-model addressing (16-bit pointers, 16-bit `size_t').
  
! `-mrelax'
       This option is passed to the assembler and linker, and allows the
       linker to perform certain optimizations that cannot be done until
       the final link.
  
! `mhwmult='
       Describes the type of hardware multiply supported by the target.
!      Accepted values are `none' for no hardware multiply, `16bit' for
!      the original 16-bit-only multiply supported by early MCUs.
!      `32bit' for the 16/32-bit multiply supported by later MCUs and
!      `f5series' for the 16/32-bit multiply supported by F5-series MCUs.
!      A value of `auto' can also be given.  This tells GCC to deduce the
!      hardware multiply support based upon the MCU name provided by the
!      `-mmcu' option.  If no `-mmcu' option is specified then `32bit'
!      hardware multiply support is assumed.  `auto' is the default
!      setting.
  
       Hardware multiplies are normally performed by calling a library
       routine.  This saves space in the generated code.  When compiling
!      at `-O3' or higher however the hardware multiplier is invoked
       inline.  This makes for bigger, but faster code.
  
       The hardware multiply routines disable interrupts whilst running
--- 16824,16889 ----
  
  These options are defined for the MSP430:
  
! '-masm-hex'
       Force assembly output to always use hex constants.  Normally such
       constants are signed decimals, but this option is available for
       testsuite and/or aesthetic purposes.
  
! '-mmcu='
       Select the MCU to target.  This is used to create a C preprocessor
       symbol based upon the MCU name, converted to upper case and pre-
!      and post-fixed with '__'.  This in turn is used by the 'msp430.h'
       header file to select an MCU-specific supplementary header file.
  
       The option also sets the ISA to use.  If the MCU name is one that
       is known to only support the 430 ISA then that is selected,
!      otherwise the 430X ISA is selected.  A generic MCU name of 'msp430'
!      can also be used to select the 430 ISA. Similarly the generic
!      'msp430x' MCU name selects the 430X ISA.
  
       In addition an MCU-specific linker script is added to the linker
!      command line.  The script's name is the name of the MCU with '.ld'
!      appended.  Thus specifying '-mmcu=xxx' on the 'gcc' command line
!      defines the C preprocessor symbol '__XXX__' and cause the linker to
!      search for a script called 'xxx.ld'.
  
       This option is also passed on to the assembler.
  
! '-mcpu='
!      Specifies the ISA to use.  Accepted values are 'msp430', 'msp430x'
!      and 'msp430xv2'.  This option is deprecated.  The '-mmcu=' option
       should be used to select the ISA.
  
! '-msim'
       Link to the simulator runtime libraries and linker script.
!      Overrides any scripts that would be selected by the '-mmcu='
       option.
  
! '-mlarge'
!      Use large-model addressing (20-bit pointers, 32-bit 'size_t').
  
! '-msmall'
!      Use small-model addressing (16-bit pointers, 16-bit 'size_t').
  
! '-mrelax'
       This option is passed to the assembler and linker, and allows the
       linker to perform certain optimizations that cannot be done until
       the final link.
  
! 'mhwmult='
       Describes the type of hardware multiply supported by the target.
!      Accepted values are 'none' for no hardware multiply, '16bit' for
!      the original 16-bit-only multiply supported by early MCUs.  '32bit'
!      for the 16/32-bit multiply supported by later MCUs and 'f5series'
!      for the 16/32-bit multiply supported by F5-series MCUs.  A value of
!      'auto' can also be given.  This tells GCC to deduce the hardware
!      multiply support based upon the MCU name provided by the '-mmcu'
!      option.  If no '-mmcu' option is specified then '32bit' hardware
!      multiply support is assumed.  'auto' is the default setting.
  
       Hardware multiplies are normally performed by calling a library
       routine.  This saves space in the generated code.  When compiling
!      at '-O3' or higher however the hardware multiplier is invoked
       inline.  This makes for bigger, but faster code.
  
       The hardware multiply routines disable interrupts whilst running
*************** These options are defined for the MSP430
*** 16971,16984 ****
       makes them safe to use inside interrupt handlers as well as in
       normal code.
  
! `-minrt'
       Enable the use of a minimum runtime environment - no static
       initializers or constructors.  This is intended for
       memory-constrained devices.  The compiler includes special symbols
       in some objects that tell the linker and runtime which code
       fragments are required.
  
- 
  
  File: gcc.info,  Node: NDS32 Options,  Next: Nios II Options,  Prev: MSP430 Options,  Up: Submodel Options
  
--- 16891,16903 ----
       makes them safe to use inside interrupt handlers as well as in
       normal code.
  
! '-minrt'
       Enable the use of a minimum runtime environment - no static
       initializers or constructors.  This is intended for
       memory-constrained devices.  The compiler includes special symbols
       in some objects that tell the linker and runtime which code
       fragments are required.
  
  
  File: gcc.info,  Node: NDS32 Options,  Next: Nios II Options,  Prev: MSP430 Options,  Up: Submodel Options
  
*************** File: gcc.info,  Node: NDS32 Options,  N
*** 16987,17061 ****
  
  These options are defined for NDS32 implementations:
  
! `-mbig-endian'
       Generate code in big-endian mode.
  
! `-mlittle-endian'
       Generate code in little-endian mode.
  
! `-mreduced-regs'
       Use reduced-set registers for register allocation.
  
! `-mfull-regs'
       Use full-set registers for register allocation.
  
! `-mcmov'
       Generate conditional move instructions.
  
! `-mno-cmov'
       Do not generate conditional move instructions.
  
! `-mperf-ext'
       Generate performance extension instructions.
  
! `-mno-perf-ext'
       Do not generate performance extension instructions.
  
! `-mv3push'
       Generate v3 push25/pop25 instructions.
  
! `-mno-v3push'
       Do not generate v3 push25/pop25 instructions.
  
! `-m16-bit'
       Generate 16-bit instructions.
  
! `-mno-16-bit'
       Do not generate 16-bit instructions.
  
! `-misr-vector-size=NUM'
       Specify the size of each interrupt vector, which must be 4 or 16.
  
! `-mcache-block-size=NUM'
       Specify the size of each cache block, which must be a power of 2
       between 4 and 512.
  
! `-march=ARCH'
       Specify the name of the target architecture.
  
! `-mcmodel=CODE-MODEL'
       Set the code model to one of
!     `small'
            All the data and read-only data segments must be within 512KB
            addressing space.  The text segment must be within 16MB
            addressing space.
! 
!     `medium'
!           The data segment must be within 512KB while the read-only
!           data segment can be within 4GB addressing space.  The text
!           segment should be still within 16MB addressing space.
! 
!     `large'
            All the text and data segments can be within 4GB addressing
            space.
  
! `-mctor-dtor'
       Enable constructor/destructor feature.
  
! `-mrelax'
       Guide linker to relax instructions.
  
- 
  
  File: gcc.info,  Node: Nios II Options,  Next: Nvidia PTX Options,  Prev: NDS32 Options,  Up: Submodel Options
  
--- 16906,16977 ----
  
  These options are defined for NDS32 implementations:
  
! '-mbig-endian'
       Generate code in big-endian mode.
  
! '-mlittle-endian'
       Generate code in little-endian mode.
  
! '-mreduced-regs'
       Use reduced-set registers for register allocation.
  
! '-mfull-regs'
       Use full-set registers for register allocation.
  
! '-mcmov'
       Generate conditional move instructions.
  
! '-mno-cmov'
       Do not generate conditional move instructions.
  
! '-mperf-ext'
       Generate performance extension instructions.
  
! '-mno-perf-ext'
       Do not generate performance extension instructions.
  
! '-mv3push'
       Generate v3 push25/pop25 instructions.
  
! '-mno-v3push'
       Do not generate v3 push25/pop25 instructions.
  
! '-m16-bit'
       Generate 16-bit instructions.
  
! '-mno-16-bit'
       Do not generate 16-bit instructions.
  
! '-misr-vector-size=NUM'
       Specify the size of each interrupt vector, which must be 4 or 16.
  
! '-mcache-block-size=NUM'
       Specify the size of each cache block, which must be a power of 2
       between 4 and 512.
  
! '-march=ARCH'
       Specify the name of the target architecture.
  
! '-mcmodel=CODE-MODEL'
       Set the code model to one of
!      'small'
            All the data and read-only data segments must be within 512KB
            addressing space.  The text segment must be within 16MB
            addressing space.
!      'medium'
!           The data segment must be within 512KB while the read-only data
!           segment can be within 4GB addressing space.  The text segment
!           should be still within 16MB addressing space.
!      'large'
            All the text and data segments can be within 4GB addressing
            space.
  
! '-mctor-dtor'
       Enable constructor/destructor feature.
  
! '-mrelax'
       Guide linker to relax instructions.
  
  
  File: gcc.info,  Node: Nios II Options,  Next: Nvidia PTX Options,  Prev: NDS32 Options,  Up: Submodel Options
  
*************** File: gcc.info,  Node: Nios II Options,
*** 17064,17104 ****
  
  These are the options defined for the Altera Nios II processor.
  
! `-G NUM'
       Put global and static objects less than or equal to NUM bytes into
       the small data or BSS sections instead of the normal data or BSS
       sections.  The default value of NUM is 8.
  
! `-mgpopt=OPTION'
! 
! `-mgpopt'
! `-mno-gpopt'
       Generate (do not generate) GP-relative accesses.  The following
       OPTION names are recognized:
  
!     `none'
            Do not generate GP-relative accesses.
  
!     `local'
            Generate GP-relative accesses for small data objects that are
            not external or weak.  Also use GP-relative addressing for
            objects that have been explicitly placed in a small data
!           section via a `section' attribute.
  
!     `global'
!           As for `local', but also generate GP-relative accesses for
!           small data objects that are external or weak.  If you use
!           this option, you must ensure that all parts of your program
!           (including libraries) are compiled with the same `-G' setting.
  
!     `data'
            Generate GP-relative accesses for all data objects in the
            program.  If you use this option, the entire data and BSS
            segments of your program must fit in 64K of memory and you
            must use an appropriate linker script to allocate them within
            the addressible range of the global pointer.
  
!     `all'
            Generate GP-relative addresses for function pointers as well
            as data pointers.  If you use this option, the entire text,
            data, and BSS segments of your program must fit in 64K of
--- 16980,17019 ----
  
  These are the options defined for the Altera Nios II processor.
  
! '-G NUM'
       Put global and static objects less than or equal to NUM bytes into
       the small data or BSS sections instead of the normal data or BSS
       sections.  The default value of NUM is 8.
  
! '-mgpopt=OPTION'
! '-mgpopt'
! '-mno-gpopt'
       Generate (do not generate) GP-relative accesses.  The following
       OPTION names are recognized:
  
!      'none'
            Do not generate GP-relative accesses.
  
!      'local'
            Generate GP-relative accesses for small data objects that are
            not external or weak.  Also use GP-relative addressing for
            objects that have been explicitly placed in a small data
!           section via a 'section' attribute.
  
!      'global'
!           As for 'local', but also generate GP-relative accesses for
!           small data objects that are external or weak.  If you use this
!           option, you must ensure that all parts of your program
!           (including libraries) are compiled with the same '-G' setting.
  
!      'data'
            Generate GP-relative accesses for all data objects in the
            program.  If you use this option, the entire data and BSS
            segments of your program must fit in 64K of memory and you
            must use an appropriate linker script to allocate them within
            the addressible range of the global pointer.
  
!      'all'
            Generate GP-relative addresses for function pointers as well
            as data pointers.  If you use this option, the entire text,
            data, and BSS segments of your program must fit in 64K of
*************** These are the options defined for the Al
*** 17106,17163 ****
            allocate them within the addressible range of the global
            pointer.
  
  
!      `-mgpopt' is equivalent to `-mgpopt=local', and `-mno-gpopt' is
!      equivalent to `-mgpopt=none'.
! 
!      The default is `-mgpopt' except when `-fpic' or `-fPIC' is
       specified to generate position-independent code.  Note that the
       Nios II ABI does not permit GP-relative accesses from shared
       libraries.
  
!      You may need to specify `-mno-gpopt' explicitly when building
       programs that include large amounts of small data, including large
       GOT data sections.  In this case, the 16-bit offset for GP-relative
       addressing may not be large enough to allow access to the entire
       small data section.
  
! `-mel'
! `-meb'
       Generate little-endian (default) or big-endian (experimental) code,
       respectively.
  
! `-mbypass-cache'
! `-mno-bypass-cache'
       Force all load and store instructions to always bypass cache by
!      using I/O variants of the instructions. The default is not to
       bypass the cache.
  
! `-mno-cache-volatile'
! `-mcache-volatile'
       Volatile memory access bypass the cache using the I/O variants of
!      the load and store instructions. The default is not to bypass the
       cache.
  
! `-mno-fast-sw-div'
! `-mfast-sw-div'
!      Do not use table-based fast divide for small numbers. The default
!      is to use the fast divide at `-O3' and above.
  
! `-mno-hw-mul'
! `-mhw-mul'
! `-mno-hw-mulx'
! `-mhw-mulx'
! `-mno-hw-div'
! `-mhw-div'
!      Enable or disable emitting `mul', `mulx' and `div' family of
!      instructions by the compiler. The default is to emit `mul' and not
!      emit `div' and `mulx'.
  
! `-mcustom-INSN=N'
! `-mno-custom-INSN'
!      Each `-mcustom-INSN=N' option enables use of a custom instruction
       with encoding N when generating code that uses INSN.  For example,
!      `-mcustom-fadds=253' generates custom instruction 253 for
       single-precision floating-point add operations instead of the
       default behavior of using a library call.
  
--- 17021,17077 ----
            allocate them within the addressible range of the global
            pointer.
  
+      '-mgpopt' is equivalent to '-mgpopt=local', and '-mno-gpopt' is
+      equivalent to '-mgpopt=none'.
  
!      The default is '-mgpopt' except when '-fpic' or '-fPIC' is
       specified to generate position-independent code.  Note that the
       Nios II ABI does not permit GP-relative accesses from shared
       libraries.
  
!      You may need to specify '-mno-gpopt' explicitly when building
       programs that include large amounts of small data, including large
       GOT data sections.  In this case, the 16-bit offset for GP-relative
       addressing may not be large enough to allow access to the entire
       small data section.
  
! '-mel'
! '-meb'
       Generate little-endian (default) or big-endian (experimental) code,
       respectively.
  
! '-mbypass-cache'
! '-mno-bypass-cache'
       Force all load and store instructions to always bypass cache by
!      using I/O variants of the instructions.  The default is not to
       bypass the cache.
  
! '-mno-cache-volatile'
! '-mcache-volatile'
       Volatile memory access bypass the cache using the I/O variants of
!      the load and store instructions.  The default is not to bypass the
       cache.
  
! '-mno-fast-sw-div'
! '-mfast-sw-div'
!      Do not use table-based fast divide for small numbers.  The default
!      is to use the fast divide at '-O3' and above.
  
! '-mno-hw-mul'
! '-mhw-mul'
! '-mno-hw-mulx'
! '-mhw-mulx'
! '-mno-hw-div'
! '-mhw-div'
!      Enable or disable emitting 'mul', 'mulx' and 'div' family of
!      instructions by the compiler.  The default is to emit 'mul' and not
!      emit 'div' and 'mulx'.
  
! '-mcustom-INSN=N'
! '-mno-custom-INSN'
!      Each '-mcustom-INSN=N' option enables use of a custom instruction
       with encoding N when generating code that uses INSN.  For example,
!      '-mcustom-fadds=253' generates custom instruction 253 for
       single-precision floating-point add operations instead of the
       default behavior of using a library call.
  
*************** These are the options defined for the Al
*** 17168,17299 ****
       Builtins::).
  
       Single-precision floating point:
!     `fadds', `fsubs', `fdivs', `fmuls'
            Binary arithmetic operations.
  
!     `fnegs'
            Unary negation.
  
!     `fabss'
            Unary absolute value.
  
!     `fcmpeqs', `fcmpges', `fcmpgts', `fcmples', `fcmplts', `fcmpnes'
            Comparison operations.
  
!     `fmins', `fmaxs'
            Floating-point minimum and maximum.  These instructions are
!           only generated if `-ffinite-math-only' is specified.
  
!     `fsqrts'
            Unary square root operation.
  
!     `fcoss', `fsins', `ftans', `fatans', `fexps', `flogs'
!           Floating-point trigonometric and exponential functions.
!           These instructions are only generated if
!           `-funsafe-math-optimizations' is also specified.
! 
  
       Double-precision floating point:
!     `faddd', `fsubd', `fdivd', `fmuld'
            Binary arithmetic operations.
  
!     `fnegd'
            Unary negation.
  
!     `fabsd'
            Unary absolute value.
  
!     `fcmpeqd', `fcmpged', `fcmpgtd', `fcmpled', `fcmpltd', `fcmpned'
            Comparison operations.
  
!     `fmind', `fmaxd'
            Double-precision minimum and maximum.  These instructions are
!           only generated if `-ffinite-math-only' is specified.
  
!     `fsqrtd'
            Unary square root operation.
  
!     `fcosd', `fsind', `ftand', `fatand', `fexpd', `flogd'
            Double-precision trigonometric and exponential functions.
            These instructions are only generated if
!           `-funsafe-math-optimizations' is also specified.
! 
  
       Conversions:
!     `fextsd'
            Conversion from single precision to double precision.
  
!     `ftruncds'
            Conversion from double precision to single precision.
  
!     `fixsi', `fixsu', `fixdi', `fixdu'
            Conversion from floating point to signed or unsigned integer
            types, with truncation towards zero.
  
!     `round'
            Conversion from single-precision floating point to signed
            integer, rounding to the nearest integer and ties away from
!           zero.  This corresponds to the `__builtin_lroundf' function
!           when `-fno-math-errno' is used.
  
!     `floatis', `floatus', `floatid', `floatud'
            Conversion from signed or unsigned integer types to
            floating-point types.
  
- 
       In addition, all of the following transfer instructions for
       internal registers X and Y must be provided to use any of the
       double-precision floating-point instructions.  Custom instructions
       taking two double-precision source operands expect the first
!      operand in the 64-bit register X.  The other operand (or only
       operand of a unary operation) is given to the custom arithmetic
!      instruction with the least significant half in source register
!      SRC1 and the most significant half in SRC2.  A custom instruction
!      that returns a double-precision result returns the most
!      significant 32 bits in the destination register and the other half
!      in 32-bit register Y.  GCC automatically generates the necessary
!      code sequences to write register X and/or read register Y when
       double-precision floating-point instructions are used.
  
!     `fwrx'
            Write SRC1 into the least significant half of X and SRC2 into
            the most significant half of X.
  
!     `fwry'
            Write SRC1 into Y.
  
!     `frdxhi', `frdxlo'
            Read the most or least (respectively) significant half of X
            and store it in DEST.
  
!     `frdy'
            Read the value of Y and store it into DEST.
  
       Note that you can gain more local control over generation of Nios
!      II custom instructions by using the `target("custom-INSN=N")' and
!      `target("no-custom-INSN")' function attributes (*note Function
       Attributes::) or pragmas (*note Function Specific Option
       Pragmas::).
  
! `-mcustom-fpu-cfg=NAME'
       This option enables a predefined, named set of custom instruction
!      encodings (see `-mcustom-INSN' above).  Currently, the following
       sets are defined:
  
!      `-mcustom-fpu-cfg=60-1' is equivalent to:
            -mcustom-fmuls=252
            -mcustom-fadds=253
            -mcustom-fsubs=254
            -fsingle-precision-constant
  
!      `-mcustom-fpu-cfg=60-2' is equivalent to:
            -mcustom-fmuls=252
            -mcustom-fadds=253
            -mcustom-fsubs=254
            -mcustom-fdivs=255
            -fsingle-precision-constant
  
!      `-mcustom-fpu-cfg=72-3' is equivalent to:
            -mcustom-floatus=243
            -mcustom-fixsi=244
            -mcustom-floatis=245
--- 17082,17213 ----
       Builtins::).
  
       Single-precision floating point:
! 
!      'fadds', 'fsubs', 'fdivs', 'fmuls'
            Binary arithmetic operations.
  
!      'fnegs'
            Unary negation.
  
!      'fabss'
            Unary absolute value.
  
!      'fcmpeqs', 'fcmpges', 'fcmpgts', 'fcmples', 'fcmplts', 'fcmpnes'
            Comparison operations.
  
!      'fmins', 'fmaxs'
            Floating-point minimum and maximum.  These instructions are
!           only generated if '-ffinite-math-only' is specified.
  
!      'fsqrts'
            Unary square root operation.
  
!      'fcoss', 'fsins', 'ftans', 'fatans', 'fexps', 'flogs'
!           Floating-point trigonometric and exponential functions.  These
!           instructions are only generated if
!           '-funsafe-math-optimizations' is also specified.
  
       Double-precision floating point:
! 
!      'faddd', 'fsubd', 'fdivd', 'fmuld'
            Binary arithmetic operations.
  
!      'fnegd'
            Unary negation.
  
!      'fabsd'
            Unary absolute value.
  
!      'fcmpeqd', 'fcmpged', 'fcmpgtd', 'fcmpled', 'fcmpltd', 'fcmpned'
            Comparison operations.
  
!      'fmind', 'fmaxd'
            Double-precision minimum and maximum.  These instructions are
!           only generated if '-ffinite-math-only' is specified.
  
!      'fsqrtd'
            Unary square root operation.
  
!      'fcosd', 'fsind', 'ftand', 'fatand', 'fexpd', 'flogd'
            Double-precision trigonometric and exponential functions.
            These instructions are only generated if
!           '-funsafe-math-optimizations' is also specified.
  
       Conversions:
!      'fextsd'
            Conversion from single precision to double precision.
  
!      'ftruncds'
            Conversion from double precision to single precision.
  
!      'fixsi', 'fixsu', 'fixdi', 'fixdu'
            Conversion from floating point to signed or unsigned integer
            types, with truncation towards zero.
  
!      'round'
            Conversion from single-precision floating point to signed
            integer, rounding to the nearest integer and ties away from
!           zero.  This corresponds to the '__builtin_lroundf' function
!           when '-fno-math-errno' is used.
  
!      'floatis', 'floatus', 'floatid', 'floatud'
            Conversion from signed or unsigned integer types to
            floating-point types.
  
       In addition, all of the following transfer instructions for
       internal registers X and Y must be provided to use any of the
       double-precision floating-point instructions.  Custom instructions
       taking two double-precision source operands expect the first
!      operand in the 64-bit register X. The other operand (or only
       operand of a unary operation) is given to the custom arithmetic
!      instruction with the least significant half in source register SRC1
!      and the most significant half in SRC2.  A custom instruction that
!      returns a double-precision result returns the most significant 32
!      bits in the destination register and the other half in 32-bit
!      register Y. GCC automatically generates the necessary code
!      sequences to write register X and/or read register Y when
       double-precision floating-point instructions are used.
  
!      'fwrx'
            Write SRC1 into the least significant half of X and SRC2 into
            the most significant half of X.
  
!      'fwry'
            Write SRC1 into Y.
  
!      'frdxhi', 'frdxlo'
            Read the most or least (respectively) significant half of X
            and store it in DEST.
  
!      'frdy'
            Read the value of Y and store it into DEST.
  
       Note that you can gain more local control over generation of Nios
!      II custom instructions by using the 'target("custom-INSN=N")' and
!      'target("no-custom-INSN")' function attributes (*note Function
       Attributes::) or pragmas (*note Function Specific Option
       Pragmas::).
  
! '-mcustom-fpu-cfg=NAME'
! 
       This option enables a predefined, named set of custom instruction
!      encodings (see '-mcustom-INSN' above).  Currently, the following
       sets are defined:
  
!      '-mcustom-fpu-cfg=60-1' is equivalent to:
            -mcustom-fmuls=252
            -mcustom-fadds=253
            -mcustom-fsubs=254
            -fsingle-precision-constant
  
!      '-mcustom-fpu-cfg=60-2' is equivalent to:
            -mcustom-fmuls=252
            -mcustom-fadds=253
            -mcustom-fsubs=254
            -mcustom-fdivs=255
            -fsingle-precision-constant
  
!      '-mcustom-fpu-cfg=72-3' is equivalent to:
            -mcustom-floatus=243
            -mcustom-fixsi=244
            -mcustom-floatis=245
*************** These are the options defined for the Al
*** 17307,17347 ****
            -mcustom-fdivs=255
            -fsingle-precision-constant
  
!      Custom instruction assignments given by individual
!      `-mcustom-INSN=' options override those given by
!      `-mcustom-fpu-cfg=', regardless of the order of the options on the
!      command line.
  
       Note that you can gain more local control over selection of a FPU
!      configuration by using the `target("custom-fpu-cfg=NAME")'
!      function attribute (*note Function Attributes::) or pragma (*note
!      Function Specific Option Pragmas::).
! 
  
!  These additional `-m' options are available for the Altera Nios II ELF
  (bare-metal) target:
  
! `-mhal'
!      Link with HAL BSP.  This suppresses linking with the GCC-provided
!      C runtime startup and termination code, and is typically used in
!      conjunction with `-msys-crt0=' to specify the location of the
       alternate startup code provided by the HAL BSP.
  
! `-msmallc'
!      Link with a limited version of the C library, `-lsmallc', rather
       than Newlib.
  
! `-msys-crt0=STARTFILE'
       STARTFILE is the file name of the startfile (crt0) to use when
!      linking.  This option is only useful in conjunction with `-mhal'.
  
! `-msys-lib=SYSTEMLIB'
       SYSTEMLIB is the library name of the library that provides
!      low-level system calls required by the C library, e.g. `read' and
!      `write'.  This option is typically used to link with a library
       provided by a HAL BSP.
  
- 
  
  File: gcc.info,  Node: Nvidia PTX Options,  Next: PDP-11 Options,  Prev: Nios II Options,  Up: Submodel Options
  
--- 17221,17258 ----
            -mcustom-fdivs=255
            -fsingle-precision-constant
  
!      Custom instruction assignments given by individual '-mcustom-INSN='
!      options override those given by '-mcustom-fpu-cfg=', regardless of
!      the order of the options on the command line.
  
       Note that you can gain more local control over selection of a FPU
!      configuration by using the 'target("custom-fpu-cfg=NAME")' function
!      attribute (*note Function Attributes::) or pragma (*note Function
!      Specific Option Pragmas::).
  
!  These additional '-m' options are available for the Altera Nios II ELF
  (bare-metal) target:
  
! '-mhal'
!      Link with HAL BSP. This suppresses linking with the GCC-provided C
!      runtime startup and termination code, and is typically used in
!      conjunction with '-msys-crt0=' to specify the location of the
       alternate startup code provided by the HAL BSP.
  
! '-msmallc'
!      Link with a limited version of the C library, '-lsmallc', rather
       than Newlib.
  
! '-msys-crt0=STARTFILE'
       STARTFILE is the file name of the startfile (crt0) to use when
!      linking.  This option is only useful in conjunction with '-mhal'.
  
! '-msys-lib=SYSTEMLIB'
       SYSTEMLIB is the library name of the library that provides
!      low-level system calls required by the C library, e.g.  'read' and
!      'write'.  This option is typically used to link with a library
       provided by a HAL BSP.
  
  
  File: gcc.info,  Node: Nvidia PTX Options,  Next: PDP-11 Options,  Prev: Nios II Options,  Up: Submodel Options
  
*************** File: gcc.info,  Node: Nvidia PTX Option
*** 17350,17364 ****
  
  These options are defined for Nvidia PTX:
  
! `-m32'
! `-m64'
       Generate code for 32-bit or 64-bit ABI.
  
! `-mmainkernel'
       Link in code for a __main kernel.  This is for stand-alone instead
       of offloading execution.
  
- 
  
  File: gcc.info,  Node: PDP-11 Options,  Next: picoChip Options,  Prev: Nvidia PTX Options,  Up: Submodel Options
  
--- 17261,17274 ----
  
  These options are defined for Nvidia PTX:
  
! '-m32'
! '-m64'
       Generate code for 32-bit or 64-bit ABI.
  
! '-mmainkernel'
       Link in code for a __main kernel.  This is for stand-alone instead
       of offloading execution.
  
  
  File: gcc.info,  Node: PDP-11 Options,  Next: picoChip Options,  Prev: Nvidia PTX Options,  Up: Submodel Options
  
*************** File: gcc.info,  Node: PDP-11 Options,
*** 17367,17438 ****
  
  These options are defined for the PDP-11:
  
! `-mfpu'
       Use hardware FPP floating point.  This is the default.  (FIS
       floating point on the PDP-11/40 is not supported.)
  
! `-msoft-float'
       Do not use hardware floating point.
  
! `-mac0'
       Return floating-point results in ac0 (fr0 in Unix assembler
       syntax).
  
! `-mno-ac0'
       Return floating-point results in memory.  This is the default.
  
! `-m40'
       Generate code for a PDP-11/40.
  
! `-m45'
       Generate code for a PDP-11/45.  This is the default.
  
! `-m10'
       Generate code for a PDP-11/10.
  
! `-mbcopy-builtin'
!      Use inline `movmemhi' patterns for copying memory.  This is the
       default.
  
! `-mbcopy'
!      Do not use inline `movmemhi' patterns for copying memory.
  
! `-mint16'
! `-mno-int32'
!      Use 16-bit `int'.  This is the default.
  
! `-mint32'
! `-mno-int16'
!      Use 32-bit `int'.
  
! `-mfloat64'
! `-mno-float32'
!      Use 64-bit `float'.  This is the default.
  
! `-mfloat32'
! `-mno-float64'
!      Use 32-bit `float'.
  
! `-mabshi'
!      Use `abshi2' pattern.  This is the default.
  
! `-mno-abshi'
!      Do not use `abshi2' pattern.
  
! `-mbranch-expensive'
       Pretend that branches are expensive.  This is for experimenting
       with code generation only.
  
! `-mbranch-cheap'
       Do not pretend that branches are expensive.  This is the default.
  
! `-munix-asm'
       Use Unix assembler syntax.  This is the default when configured for
!      `pdp11-*-bsd'.
  
! `-mdec-asm'
       Use DEC assembler syntax.  This is the default when configured for
!      any PDP-11 target other than `pdp11-*-bsd'.
  
  
  File: gcc.info,  Node: picoChip Options,  Next: PowerPC Options,  Prev: PDP-11 Options,  Up: Submodel Options
--- 17277,17348 ----
  
  These options are defined for the PDP-11:
  
! '-mfpu'
       Use hardware FPP floating point.  This is the default.  (FIS
       floating point on the PDP-11/40 is not supported.)
  
! '-msoft-float'
       Do not use hardware floating point.
  
! '-mac0'
       Return floating-point results in ac0 (fr0 in Unix assembler
       syntax).
  
! '-mno-ac0'
       Return floating-point results in memory.  This is the default.
  
! '-m40'
       Generate code for a PDP-11/40.
  
! '-m45'
       Generate code for a PDP-11/45.  This is the default.
  
! '-m10'
       Generate code for a PDP-11/10.
  
! '-mbcopy-builtin'
!      Use inline 'movmemhi' patterns for copying memory.  This is the
       default.
  
! '-mbcopy'
!      Do not use inline 'movmemhi' patterns for copying memory.
  
! '-mint16'
! '-mno-int32'
!      Use 16-bit 'int'.  This is the default.
  
! '-mint32'
! '-mno-int16'
!      Use 32-bit 'int'.
  
! '-mfloat64'
! '-mno-float32'
!      Use 64-bit 'float'.  This is the default.
  
! '-mfloat32'
! '-mno-float64'
!      Use 32-bit 'float'.
  
! '-mabshi'
!      Use 'abshi2' pattern.  This is the default.
  
! '-mno-abshi'
!      Do not use 'abshi2' pattern.
  
! '-mbranch-expensive'
       Pretend that branches are expensive.  This is for experimenting
       with code generation only.
  
! '-mbranch-cheap'
       Do not pretend that branches are expensive.  This is the default.
  
! '-munix-asm'
       Use Unix assembler syntax.  This is the default when configured for
!      'pdp11-*-bsd'.
  
! '-mdec-asm'
       Use DEC assembler syntax.  This is the default when configured for
!      any PDP-11 target other than 'pdp11-*-bsd'.
  
  
  File: gcc.info,  Node: picoChip Options,  Next: PowerPC Options,  Prev: PDP-11 Options,  Up: Submodel Options
*************** File: gcc.info,  Node: picoChip Options,
*** 17440,17485 ****
  3.17.34 picoChip Options
  ------------------------
  
! These `-m' options are defined for picoChip implementations:
  
! `-mae=AE_TYPE'
       Set the instruction set, register set, and instruction scheduling
       parameters for array element type AE_TYPE.  Supported values for
!      AE_TYPE are `ANY', `MUL', and `MAC'.
  
!      `-mae=ANY' selects a completely generic AE type.  Code generated
       with this option runs on any of the other AE types.  The code is
!      not as efficient as it would be if compiled for a specific AE
!      type, and some types of operation (e.g., multiplication) do not
!      work properly on all types of AE.
  
!      `-mae=MUL' selects a MUL AE type.  This is the most useful AE type
       for compiled code, and is the default.
  
!      `-mae=MAC' selects a DSP-style MAC AE.  Code compiled with this
       option may suffer from poor performance of byte (char)
       manipulation, since the DSP AE does not provide hardware support
       for byte load/stores.
  
! `-msymbol-as-address'
       Enable the compiler to directly use a symbol name as an address in
!      a load/store instruction, without first loading it into a
!      register.  Typically, the use of this option generates larger
!      programs, which run faster than when the option isn't used.
!      However, the results vary from program to program, so it is left
!      as a user option, rather than being permanently enabled.
  
! `-mno-inefficient-warnings'
       Disables warnings about the generation of inefficient code.  These
       warnings can be generated, for example, when compiling code that
       performs byte-level memory operations on the MAC AE type.  The MAC
!      AE has no hardware support for byte-level memory operations, so
!      all byte load/stores must be synthesized from word load/store
       operations.  This is inefficient and a warning is generated to
!      indicate that you should rewrite the code to avoid byte
!      operations, or to target an AE type that has the necessary
!      hardware support.  This option disables these warnings.
! 
  
  
  File: gcc.info,  Node: PowerPC Options,  Next: RL78 Options,  Prev: picoChip Options,  Up: Submodel Options
--- 17350,17394 ----
  3.17.34 picoChip Options
  ------------------------
  
! These '-m' options are defined for picoChip implementations:
  
! '-mae=AE_TYPE'
       Set the instruction set, register set, and instruction scheduling
       parameters for array element type AE_TYPE.  Supported values for
!      AE_TYPE are 'ANY', 'MUL', and 'MAC'.
  
!      '-mae=ANY' selects a completely generic AE type.  Code generated
       with this option runs on any of the other AE types.  The code is
!      not as efficient as it would be if compiled for a specific AE type,
!      and some types of operation (e.g., multiplication) do not work
!      properly on all types of AE.
  
!      '-mae=MUL' selects a MUL AE type.  This is the most useful AE type
       for compiled code, and is the default.
  
!      '-mae=MAC' selects a DSP-style MAC AE. Code compiled with this
       option may suffer from poor performance of byte (char)
       manipulation, since the DSP AE does not provide hardware support
       for byte load/stores.
  
! '-msymbol-as-address'
       Enable the compiler to directly use a symbol name as an address in
!      a load/store instruction, without first loading it into a register.
!      Typically, the use of this option generates larger programs, which
!      run faster than when the option isn't used.  However, the results
!      vary from program to program, so it is left as a user option,
!      rather than being permanently enabled.
  
! '-mno-inefficient-warnings'
       Disables warnings about the generation of inefficient code.  These
       warnings can be generated, for example, when compiling code that
       performs byte-level memory operations on the MAC AE type.  The MAC
!      AE has no hardware support for byte-level memory operations, so all
!      byte load/stores must be synthesized from word load/store
       operations.  This is inefficient and a warning is generated to
!      indicate that you should rewrite the code to avoid byte operations,
!      or to target an AE type that has the necessary hardware support.
!      This option disables these warnings.
  
  
  File: gcc.info,  Node: PowerPC Options,  Next: RL78 Options,  Prev: picoChip Options,  Up: Submodel Options
*************** File: gcc.info,  Node: RL78 Options,  Ne
*** 17495,17520 ****
  3.17.36 RL78 Options
  --------------------
  
! `-msim'
       Links in additional target libraries to support operation within a
       simulator.
  
! `-mmul=none'
! `-mmul=g13'
! `-mmul=rl78'
       Specifies the type of hardware multiplication support to be used.
!      The default is `none', which uses software multiplication
!      functions.  The `g13' option is for the hardware multiply/divide
!      peripheral only on the RL78/G13 targets.  The `rl78' option is for
       the standard hardware multiplication defined in the RL78 software
       manual.
  
! `-m64bit-doubles'
! `-m32bit-doubles'
!      Make the `double' data type be 64 bits (`-m64bit-doubles') or 32
!      bits (`-m32bit-doubles') in size.  The default is
!      `-m32bit-doubles'.
! 
  
  
  File: gcc.info,  Node: RS/6000 and PowerPC Options,  Next: RX Options,  Prev: RL78 Options,  Up: Submodel Options
--- 17404,17428 ----
  3.17.36 RL78 Options
  --------------------
  
! '-msim'
       Links in additional target libraries to support operation within a
       simulator.
  
! '-mmul=none'
! '-mmul=g13'
! '-mmul=rl78'
       Specifies the type of hardware multiplication support to be used.
!      The default is 'none', which uses software multiplication
!      functions.  The 'g13' option is for the hardware multiply/divide
!      peripheral only on the RL78/G13 targets.  The 'rl78' option is for
       the standard hardware multiplication defined in the RL78 software
       manual.
  
! '-m64bit-doubles'
! '-m32bit-doubles'
!      Make the 'double' data type be 64 bits ('-m64bit-doubles') or 32
!      bits ('-m32bit-doubles') in size.  The default is
!      '-m32bit-doubles'.
  
  
  File: gcc.info,  Node: RS/6000 and PowerPC Options,  Next: RX Options,  Prev: RL78 Options,  Up: Submodel Options
*************** File: gcc.info,  Node: RS/6000 and Power
*** 17522,17837 ****
  3.17.37 IBM RS/6000 and PowerPC Options
  ---------------------------------------
  
! These `-m' options are defined for the IBM RS/6000 and PowerPC:
! `-mpowerpc-gpopt'
! `-mno-powerpc-gpopt'
! `-mpowerpc-gfxopt'
! `-mno-powerpc-gfxopt'
! `-mpowerpc64'
! `-mno-powerpc64'
! `-mmfcrf'
! `-mno-mfcrf'
! `-mpopcntb'
! `-mno-popcntb'
! `-mpopcntd'
! `-mno-popcntd'
! `-mfprnd'
! `-mno-fprnd'
! `-mcmpb'
! `-mno-cmpb'
! `-mmfpgpr'
! `-mno-mfpgpr'
! `-mhard-dfp'
! `-mno-hard-dfp'
       You use these options to specify which instructions are available
!      on the processor you are using.  The default value of these
!      options is determined when configuring GCC.  Specifying the
!      `-mcpu=CPU_TYPE' overrides the specification of these options.  We
!      recommend you use the `-mcpu=CPU_TYPE' option rather than the
       options listed above.
  
!      Specifying `-mpowerpc-gpopt' allows GCC to use the optional
!      PowerPC architecture instructions in the General Purpose group,
!      including floating-point square root.  Specifying
!      `-mpowerpc-gfxopt' allows GCC to use the optional PowerPC
!      architecture instructions in the Graphics group, including
!      floating-point select.
  
!      The `-mmfcrf' option allows GCC to generate the move from
!      condition register field instruction implemented on the POWER4
!      processor and other processors that support the PowerPC V2.01
!      architecture.  The `-mpopcntb' option allows GCC to generate the
!      popcount and double-precision FP reciprocal estimate instruction
!      implemented on the POWER5 processor and other processors that
!      support the PowerPC V2.02 architecture.  The `-mpopcntd' option
!      allows GCC to generate the popcount instruction implemented on the
!      POWER7 processor and other processors that support the PowerPC
!      V2.06 architecture.  The `-mfprnd' option allows GCC to generate
!      the FP round to integer instructions implemented on the POWER5+
!      processor and other processors that support the PowerPC V2.03
!      architecture.  The `-mcmpb' option allows GCC to generate the
!      compare bytes instruction implemented on the POWER6 processor and
!      other processors that support the PowerPC V2.05 architecture.  The
!      `-mmfpgpr' option allows GCC to generate the FP move to/from
       general-purpose register instructions implemented on the POWER6X
       processor and other processors that support the extended PowerPC
!      V2.05 architecture.  The `-mhard-dfp' option allows GCC to
!      generate the decimal floating-point instructions implemented on
!      some POWER processors.
  
!      The `-mpowerpc64' option allows GCC to generate the additional
       64-bit instructions that are found in the full PowerPC64
       architecture and to treat GPRs as 64-bit, doubleword quantities.
!      GCC defaults to `-mno-powerpc64'.
  
! `-mcpu=CPU_TYPE'
       Set architecture type, register usage, and instruction scheduling
       parameters for machine type CPU_TYPE.  Supported values for
!      CPU_TYPE are `401', `403', `405', `405fp', `440', `440fp', `464',
!      `464fp', `476', `476fp', `505', `601', `602', `603', `603e',
!      `604', `604e', `620', `630', `740', `7400', `7450', `750', `801',
!      `821', `823', `860', `970', `8540', `a2', `e300c2', `e300c3',
!      `e500mc', `e500mc64', `e5500', `e6500', `ec603e', `G3', `G4', `G5',
!      `titan', `power3', `power4', `power5', `power5+', `power6',
!      `power6x', `power7', `power8', `powerpc', `powerpc64',
!      `powerpc64le', and `rs64'.
  
!      `-mcpu=powerpc', `-mcpu=powerpc64', and `-mcpu=powerpc64le'
!      specify pure 32-bit PowerPC (either endian), 64-bit big endian
!      PowerPC and 64-bit little endian PowerPC architecture machine
!      types, with an appropriate, generic processor model assumed for
!      scheduling purposes.
  
       The other options specify a specific processor.  Code generated
!      under those options runs best on that processor, and may not run
!      at all on others.
  
!      The `-mcpu' options automatically enable or disable the following
       options:
  
            -maltivec  -mfprnd  -mhard-float  -mmfcrf  -mmultiple
            -mpopcntb -mpopcntd  -mpowerpc64
            -mpowerpc-gpopt  -mpowerpc-gfxopt  -msingle-float -mdouble-float
            -msimple-fpu -mstring  -mmulhw  -mdlmzb  -mmfpgpr -mvsx
!           -mcrypto -mdirect-move -mpower8-fusion -mpower8-vector
            -mquad-memory -mquad-memory-atomic
  
       The particular options set for any particular CPU varies between
       compiler versions, depending on what setting seems to produce
       optimal code for that CPU; it doesn't necessarily reflect the
       actual hardware's capabilities.  If you wish to set an individual
!      option to a particular value, you may specify it after the `-mcpu'
!      option, like `-mcpu=970 -mno-altivec'.
  
!      On AIX, the `-maltivec' and `-mpowerpc64' options are not enabled
!      or disabled by the `-mcpu' option at present because AIX does not
       have full support for these options.  You may still enable or
       disable them individually if you're sure it'll work in your
       environment.
  
! `-mtune=CPU_TYPE'
       Set the instruction scheduling parameters for machine type
       CPU_TYPE, but do not set the architecture type or register usage,
!      as `-mcpu=CPU_TYPE' does.  The same values for CPU_TYPE are used
!      for `-mtune' as for `-mcpu'.  If both are specified, the code
!      generated uses the architecture and registers set by `-mcpu', but
!      the scheduling parameters set by `-mtune'.
  
! `-mcmodel=small'
       Generate PowerPC64 code for the small model: The TOC is limited to
       64k.
  
! `-mcmodel=medium'
       Generate PowerPC64 code for the medium model: The TOC and other
       static data may be up to a total of 4G in size.
  
! `-mcmodel=large'
       Generate PowerPC64 code for the large model: The TOC may be up to
       4G in size.  Other data and code is only limited by the 64-bit
       address space.
  
! `-maltivec'
! `-mno-altivec'
       Generate code that uses (does not use) AltiVec instructions, and
       also enable the use of built-in functions that allow more direct
       access to the AltiVec instruction set.  You may also need to set
!      `-mabi=altivec' to adjust the current ABI with AltiVec ABI
       enhancements.
  
!      When `-maltivec' is used, rather than `-maltivec=le' or
!      `-maltivec=be', the element order for Altivec intrinsics such as
!      `vec_splat', `vec_extract', and `vec_insert' match array element
       order corresponding to the endianness of the target.  That is,
       element zero identifies the leftmost element in a vector register
       when targeting a big-endian platform, and identifies the rightmost
       element in a vector register when targeting a little-endian
       platform.
  
! `-maltivec=be'
       Generate Altivec instructions using big-endian element order,
       regardless of whether the target is big- or little-endian.  This is
       the default when targeting a big-endian platform.
  
       The element order is used to interpret element numbers in Altivec
!      intrinsics such as `vec_splat', `vec_extract', and `vec_insert'.
       By default, these match array element order corresponding to the
       endianness for the target.
  
! `-maltivec=le'
       Generate Altivec instructions using little-endian element order,
       regardless of whether the target is big- or little-endian.  This is
       the default when targeting a little-endian platform.  This option
       is currently ignored when targeting a big-endian platform.
  
       The element order is used to interpret element numbers in Altivec
!      intrinsics such as `vec_splat', `vec_extract', and `vec_insert'.
       By default, these match array element order corresponding to the
       endianness for the target.
  
! `-mvrsave'
! `-mno-vrsave'
       Generate VRSAVE instructions when generating AltiVec code.
  
! `-mgen-cell-microcode'
       Generate Cell microcode instructions.
  
! `-mwarn-cell-microcode'
!      Warn when a Cell microcode instruction is emitted.  An example of
!      a Cell microcode instruction is a variable shift.
  
! `-msecure-plt'
!      Generate code that allows `ld' and `ld.so' to build executables
!      and shared libraries with non-executable `.plt' and `.got'
!      sections.  This is a PowerPC 32-bit SYSV ABI option.
  
! `-mbss-plt'
!      Generate code that uses a BSS `.plt' section that `ld.so' fills
!      in, and requires `.plt' and `.got' sections that are both writable
!      and executable.  This is a PowerPC 32-bit SYSV ABI option.
  
! `-misel'
! `-mno-isel'
       This switch enables or disables the generation of ISEL
       instructions.
  
! `-misel=YES/NO'
!      This switch has been deprecated.  Use `-misel' and `-mno-isel'
       instead.
  
! `-mspe'
! `-mno-spe'
       This switch enables or disables the generation of SPE simd
       instructions.
  
! `-mpaired'
! `-mno-paired'
       This switch enables or disables the generation of PAIRED simd
       instructions.
  
! `-mspe=YES/NO'
!      This option has been deprecated.  Use `-mspe' and `-mno-spe'
       instead.
  
! `-mvsx'
! `-mno-vsx'
       Generate code that uses (does not use) vector/scalar (VSX)
       instructions, and also enable the use of built-in functions that
       allow more direct access to the VSX instruction set.
  
! `-mcrypto'
! `-mno-crypto'
       Enable the use (disable) of the built-in functions that allow
       direct access to the cryptographic instructions that were added in
       version 2.07 of the PowerPC ISA.
  
! `-mdirect-move'
! `-mno-direct-move'
       Generate code that uses (does not use) the instructions to move
       data between the general purpose registers and the vector/scalar
       (VSX) registers that were added in version 2.07 of the PowerPC ISA.
  
! `-mpower8-fusion'
! `-mno-power8-fusion'
       Generate code that keeps (does not keeps) some integer operations
       adjacent so that the instructions can be fused together on power8
       and later processors.
  
! `-mpower8-vector'
! `-mno-power8-vector'
       Generate code that uses (does not use) the vector and scalar
       instructions that were added in version 2.07 of the PowerPC ISA.
       Also enable the use of built-in functions that allow more direct
       access to the vector instructions.
  
! `-mquad-memory'
! `-mno-quad-memory'
       Generate code that uses (does not use) the non-atomic quad word
!      memory instructions.  The `-mquad-memory' option requires use of
       64-bit mode.
  
! `-mquad-memory-atomic'
! `-mno-quad-memory-atomic'
       Generate code that uses (does not use) the atomic quad word memory
!      instructions.  The `-mquad-memory-atomic' option requires use of
       64-bit mode.
  
! `-mupper-regs-df'
! `-mno-upper-regs-df'
       Generate code that uses (does not use) the scalar double precision
       instructions that target all 64 registers in the vector/scalar
       floating point register set that were added in version 2.06 of the
!      PowerPC ISA.  `-mupper-regs-df' is turned on by default if you use
!      any of the `-mcpu=power7', `-mcpu=power8', or `-mvsx' options.
  
! `-mupper-regs-sf'
! `-mno-upper-regs-sf'
       Generate code that uses (does not use) the scalar single precision
       instructions that target all 64 registers in the vector/scalar
       floating point register set that were added in version 2.07 of the
!      PowerPC ISA.  `-mupper-regs-sf' is turned on by default if you use
!      either of the `-mcpu=power8' or `-mpower8-vector' options.
  
! `-mupper-regs'
! `-mno-upper-regs'
!      Generate code that uses (does not use) the scalar instructions
!      that target all 64 registers in the vector/scalar floating point
       register set, depending on the model of the machine.
  
!      If the `-mno-upper-regs' option is used, it turns off both
!      `-mupper-regs-sf' and `-mupper-regs-df' options.
  
! `-mfloat-gprs=YES/SINGLE/DOUBLE/NO'
! `-mfloat-gprs'
       This switch enables or disables the generation of floating-point
       operations on the general-purpose registers for architectures that
       support it.
  
!      The argument `yes' or `single' enables the use of single-precision
       floating-point operations.
  
!      The argument `double' enables the use of single and
       double-precision floating-point operations.
  
!      The argument `no' disables floating-point operations on the
       general-purpose registers.
  
       This option is currently only available on the MPC854x.
  
! `-m32'
! `-m64'
       Generate code for 32-bit or 64-bit environments of Darwin and SVR4
       targets (including GNU/Linux).  The 32-bit environment sets int,
       long and pointer to 32 bits and generates code that runs on any
       PowerPC variant.  The 64-bit environment sets int to 32 bits and
       long and pointer to 64 bits, and generates code for PowerPC64, as
!      for `-mpowerpc64'.
  
! `-mfull-toc'
! `-mno-fp-in-toc'
! `-mno-sum-in-toc'
! `-mminimal-toc'
       Modify generation of the TOC (Table Of Contents), which is created
!      for every executable file.  The `-mfull-toc' option is selected by
       default.  In that case, GCC allocates at least one TOC entry for
       each unique non-automatic variable reference in your program.  GCC
       also places floating-point constants in the TOC.  However, only
--- 17430,17750 ----
  3.17.37 IBM RS/6000 and PowerPC Options
  ---------------------------------------
  
! These '-m' options are defined for the IBM RS/6000 and PowerPC:
! '-mpowerpc-gpopt'
! '-mno-powerpc-gpopt'
! '-mpowerpc-gfxopt'
! '-mno-powerpc-gfxopt'
! '-mpowerpc64'
! '-mno-powerpc64'
! '-mmfcrf'
! '-mno-mfcrf'
! '-mpopcntb'
! '-mno-popcntb'
! '-mpopcntd'
! '-mno-popcntd'
! '-mfprnd'
! '-mno-fprnd'
! '-mcmpb'
! '-mno-cmpb'
! '-mmfpgpr'
! '-mno-mfpgpr'
! '-mhard-dfp'
! '-mno-hard-dfp'
       You use these options to specify which instructions are available
!      on the processor you are using.  The default value of these options
!      is determined when configuring GCC.  Specifying the
!      '-mcpu=CPU_TYPE' overrides the specification of these options.  We
!      recommend you use the '-mcpu=CPU_TYPE' option rather than the
       options listed above.
  
!      Specifying '-mpowerpc-gpopt' allows GCC to use the optional PowerPC
!      architecture instructions in the General Purpose group, including
!      floating-point square root.  Specifying '-mpowerpc-gfxopt' allows
!      GCC to use the optional PowerPC architecture instructions in the
!      Graphics group, including floating-point select.
  
!      The '-mmfcrf' option allows GCC to generate the move from condition
!      register field instruction implemented on the POWER4 processor and
!      other processors that support the PowerPC V2.01 architecture.  The
!      '-mpopcntb' option allows GCC to generate the popcount and
!      double-precision FP reciprocal estimate instruction implemented on
!      the POWER5 processor and other processors that support the PowerPC
!      V2.02 architecture.  The '-mpopcntd' option allows GCC to generate
!      the popcount instruction implemented on the POWER7 processor and
!      other processors that support the PowerPC V2.06 architecture.  The
!      '-mfprnd' option allows GCC to generate the FP round to integer
!      instructions implemented on the POWER5+ processor and other
!      processors that support the PowerPC V2.03 architecture.  The
!      '-mcmpb' option allows GCC to generate the compare bytes
!      instruction implemented on the POWER6 processor and other
!      processors that support the PowerPC V2.05 architecture.  The
!      '-mmfpgpr' option allows GCC to generate the FP move to/from
       general-purpose register instructions implemented on the POWER6X
       processor and other processors that support the extended PowerPC
!      V2.05 architecture.  The '-mhard-dfp' option allows GCC to generate
!      the decimal floating-point instructions implemented on some POWER
!      processors.
  
!      The '-mpowerpc64' option allows GCC to generate the additional
       64-bit instructions that are found in the full PowerPC64
       architecture and to treat GPRs as 64-bit, doubleword quantities.
!      GCC defaults to '-mno-powerpc64'.
  
! '-mcpu=CPU_TYPE'
       Set architecture type, register usage, and instruction scheduling
       parameters for machine type CPU_TYPE.  Supported values for
!      CPU_TYPE are '401', '403', '405', '405fp', '440', '440fp', '464',
!      '464fp', '476', '476fp', '505', '601', '602', '603', '603e', '604',
!      '604e', '620', '630', '740', '7400', '7450', '750', '801', '821',
!      '823', '860', '970', '8540', 'a2', 'e300c2', 'e300c3', 'e500mc',
!      'e500mc64', 'e5500', 'e6500', 'ec603e', 'G3', 'G4', 'G5', 'titan',
!      'power3', 'power4', 'power5', 'power5+', 'power6', 'power6x',
!      'power7', 'power8', 'powerpc', 'powerpc64', 'powerpc64le', and
!      'rs64'.
  
!      '-mcpu=powerpc', '-mcpu=powerpc64', and '-mcpu=powerpc64le' specify
!      pure 32-bit PowerPC (either endian), 64-bit big endian PowerPC and
!      64-bit little endian PowerPC architecture machine types, with an
!      appropriate, generic processor model assumed for scheduling
!      purposes.
  
       The other options specify a specific processor.  Code generated
!      under those options runs best on that processor, and may not run at
!      all on others.
  
!      The '-mcpu' options automatically enable or disable the following
       options:
  
            -maltivec  -mfprnd  -mhard-float  -mmfcrf  -mmultiple
            -mpopcntb -mpopcntd  -mpowerpc64
            -mpowerpc-gpopt  -mpowerpc-gfxopt  -msingle-float -mdouble-float
            -msimple-fpu -mstring  -mmulhw  -mdlmzb  -mmfpgpr -mvsx
!           -mcrypto -mdirect-move -mhtm -mpower8-fusion -mpower8-vector
            -mquad-memory -mquad-memory-atomic
  
       The particular options set for any particular CPU varies between
       compiler versions, depending on what setting seems to produce
       optimal code for that CPU; it doesn't necessarily reflect the
       actual hardware's capabilities.  If you wish to set an individual
!      option to a particular value, you may specify it after the '-mcpu'
!      option, like '-mcpu=970 -mno-altivec'.
  
!      On AIX, the '-maltivec' and '-mpowerpc64' options are not enabled
!      or disabled by the '-mcpu' option at present because AIX does not
       have full support for these options.  You may still enable or
       disable them individually if you're sure it'll work in your
       environment.
  
! '-mtune=CPU_TYPE'
       Set the instruction scheduling parameters for machine type
       CPU_TYPE, but do not set the architecture type or register usage,
!      as '-mcpu=CPU_TYPE' does.  The same values for CPU_TYPE are used
!      for '-mtune' as for '-mcpu'.  If both are specified, the code
!      generated uses the architecture and registers set by '-mcpu', but
!      the scheduling parameters set by '-mtune'.
  
! '-mcmodel=small'
       Generate PowerPC64 code for the small model: The TOC is limited to
       64k.
  
! '-mcmodel=medium'
       Generate PowerPC64 code for the medium model: The TOC and other
       static data may be up to a total of 4G in size.
  
! '-mcmodel=large'
       Generate PowerPC64 code for the large model: The TOC may be up to
       4G in size.  Other data and code is only limited by the 64-bit
       address space.
  
! '-maltivec'
! '-mno-altivec'
       Generate code that uses (does not use) AltiVec instructions, and
       also enable the use of built-in functions that allow more direct
       access to the AltiVec instruction set.  You may also need to set
!      '-mabi=altivec' to adjust the current ABI with AltiVec ABI
       enhancements.
  
!      When '-maltivec' is used, rather than '-maltivec=le' or
!      '-maltivec=be', the element order for Altivec intrinsics such as
!      'vec_splat', 'vec_extract', and 'vec_insert' match array element
       order corresponding to the endianness of the target.  That is,
       element zero identifies the leftmost element in a vector register
       when targeting a big-endian platform, and identifies the rightmost
       element in a vector register when targeting a little-endian
       platform.
  
! '-maltivec=be'
       Generate Altivec instructions using big-endian element order,
       regardless of whether the target is big- or little-endian.  This is
       the default when targeting a big-endian platform.
  
       The element order is used to interpret element numbers in Altivec
!      intrinsics such as 'vec_splat', 'vec_extract', and 'vec_insert'.
       By default, these match array element order corresponding to the
       endianness for the target.
  
! '-maltivec=le'
       Generate Altivec instructions using little-endian element order,
       regardless of whether the target is big- or little-endian.  This is
       the default when targeting a little-endian platform.  This option
       is currently ignored when targeting a big-endian platform.
  
       The element order is used to interpret element numbers in Altivec
!      intrinsics such as 'vec_splat', 'vec_extract', and 'vec_insert'.
       By default, these match array element order corresponding to the
       endianness for the target.
  
! '-mvrsave'
! '-mno-vrsave'
       Generate VRSAVE instructions when generating AltiVec code.
  
! '-mgen-cell-microcode'
       Generate Cell microcode instructions.
  
! '-mwarn-cell-microcode'
!      Warn when a Cell microcode instruction is emitted.  An example of a
!      Cell microcode instruction is a variable shift.
  
! '-msecure-plt'
!      Generate code that allows 'ld' and 'ld.so' to build executables and
!      shared libraries with non-executable '.plt' and '.got' sections.
!      This is a PowerPC 32-bit SYSV ABI option.
  
! '-mbss-plt'
!      Generate code that uses a BSS '.plt' section that 'ld.so' fills in,
!      and requires '.plt' and '.got' sections that are both writable and
!      executable.  This is a PowerPC 32-bit SYSV ABI option.
  
! '-misel'
! '-mno-isel'
       This switch enables or disables the generation of ISEL
       instructions.
  
! '-misel=YES/NO'
!      This switch has been deprecated.  Use '-misel' and '-mno-isel'
       instead.
  
! '-mspe'
! '-mno-spe'
       This switch enables or disables the generation of SPE simd
       instructions.
  
! '-mpaired'
! '-mno-paired'
       This switch enables or disables the generation of PAIRED simd
       instructions.
  
! '-mspe=YES/NO'
!      This option has been deprecated.  Use '-mspe' and '-mno-spe'
       instead.
  
! '-mvsx'
! '-mno-vsx'
       Generate code that uses (does not use) vector/scalar (VSX)
       instructions, and also enable the use of built-in functions that
       allow more direct access to the VSX instruction set.
  
! '-mcrypto'
! '-mno-crypto'
       Enable the use (disable) of the built-in functions that allow
       direct access to the cryptographic instructions that were added in
       version 2.07 of the PowerPC ISA.
  
! '-mdirect-move'
! '-mno-direct-move'
       Generate code that uses (does not use) the instructions to move
       data between the general purpose registers and the vector/scalar
       (VSX) registers that were added in version 2.07 of the PowerPC ISA.
  
! '-mhtm'
! '-mno-htm'
!      Enable (disable) the use of the built-in functions that allow
!      direct access to the Hardware Transactional Memory (HTM)
!      instructions that were added in version 2.07 of the PowerPC ISA.
! 
! '-mpower8-fusion'
! '-mno-power8-fusion'
       Generate code that keeps (does not keeps) some integer operations
       adjacent so that the instructions can be fused together on power8
       and later processors.
  
! '-mpower8-vector'
! '-mno-power8-vector'
       Generate code that uses (does not use) the vector and scalar
       instructions that were added in version 2.07 of the PowerPC ISA.
       Also enable the use of built-in functions that allow more direct
       access to the vector instructions.
  
! '-mquad-memory'
! '-mno-quad-memory'
       Generate code that uses (does not use) the non-atomic quad word
!      memory instructions.  The '-mquad-memory' option requires use of
       64-bit mode.
  
! '-mquad-memory-atomic'
! '-mno-quad-memory-atomic'
       Generate code that uses (does not use) the atomic quad word memory
!      instructions.  The '-mquad-memory-atomic' option requires use of
       64-bit mode.
  
! '-mupper-regs-df'
! '-mno-upper-regs-df'
       Generate code that uses (does not use) the scalar double precision
       instructions that target all 64 registers in the vector/scalar
       floating point register set that were added in version 2.06 of the
!      PowerPC ISA. '-mupper-regs-df' is turned on by default if you use
!      any of the '-mcpu=power7', '-mcpu=power8', or '-mvsx' options.
  
! '-mupper-regs-sf'
! '-mno-upper-regs-sf'
       Generate code that uses (does not use) the scalar single precision
       instructions that target all 64 registers in the vector/scalar
       floating point register set that were added in version 2.07 of the
!      PowerPC ISA. '-mupper-regs-sf' is turned on by default if you use
!      either of the '-mcpu=power8' or '-mpower8-vector' options.
  
! '-mupper-regs'
! '-mno-upper-regs'
!      Generate code that uses (does not use) the scalar instructions that
!      target all 64 registers in the vector/scalar floating point
       register set, depending on the model of the machine.
  
!      If the '-mno-upper-regs' option is used, it turns off both
!      '-mupper-regs-sf' and '-mupper-regs-df' options.
  
! '-mfloat-gprs=YES/SINGLE/DOUBLE/NO'
! '-mfloat-gprs'
       This switch enables or disables the generation of floating-point
       operations on the general-purpose registers for architectures that
       support it.
  
!      The argument 'yes' or 'single' enables the use of single-precision
       floating-point operations.
  
!      The argument 'double' enables the use of single and
       double-precision floating-point operations.
  
!      The argument 'no' disables floating-point operations on the
       general-purpose registers.
  
       This option is currently only available on the MPC854x.
  
! '-m32'
! '-m64'
       Generate code for 32-bit or 64-bit environments of Darwin and SVR4
       targets (including GNU/Linux).  The 32-bit environment sets int,
       long and pointer to 32 bits and generates code that runs on any
       PowerPC variant.  The 64-bit environment sets int to 32 bits and
       long and pointer to 64 bits, and generates code for PowerPC64, as
!      for '-mpowerpc64'.
  
! '-mfull-toc'
! '-mno-fp-in-toc'
! '-mno-sum-in-toc'
! '-mminimal-toc'
       Modify generation of the TOC (Table Of Contents), which is created
!      for every executable file.  The '-mfull-toc' option is selected by
       default.  In that case, GCC allocates at least one TOC entry for
       each unique non-automatic variable reference in your program.  GCC
       also places floating-point constants in the TOC.  However, only
*************** These `-m' options are defined for the I
*** 17839,17870 ****
  
       If you receive a linker error message that saying you have
       overflowed the available TOC space, you can reduce the amount of
!      TOC space used with the `-mno-fp-in-toc' and `-mno-sum-in-toc'
!      options.  `-mno-fp-in-toc' prevents GCC from putting floating-point
!      constants in the TOC and `-mno-sum-in-toc' forces GCC to generate
       code to calculate the sum of an address and a constant at run time
       instead of putting that sum into the TOC.  You may specify one or
       both of these options.  Each causes GCC to produce very slightly
       slower and larger code at the expense of conserving TOC space.
  
!      If you still run out of space in the TOC even when you specify
!      both of these options, specify `-mminimal-toc' instead.  This
!      option causes GCC to make only one TOC entry for every file.  When
!      you specify this option, GCC produces code that is slower and
!      larger but which uses extremely little TOC space.  You may wish to
!      use this option only on files that contain less
!      frequently-executed code.
  
! `-maix64'
! `-maix32'
       Enable 64-bit AIX ABI and calling convention: 64-bit pointers,
!      64-bit `long' type, and the infrastructure needed to support them.
!      Specifying `-maix64' implies `-mpowerpc64', while `-maix32'
!      disables the 64-bit ABI and implies `-mno-powerpc64'.  GCC
!      defaults to `-maix32'.
  
! `-mxl-compat'
! `-mno-xl-compat'
       Produce code that conforms more closely to IBM XL compiler
       semantics when using AIX-compatible ABI.  Pass floating-point
       arguments to prototyped functions beyond the register save area
--- 17752,17783 ----
  
       If you receive a linker error message that saying you have
       overflowed the available TOC space, you can reduce the amount of
!      TOC space used with the '-mno-fp-in-toc' and '-mno-sum-in-toc'
!      options.  '-mno-fp-in-toc' prevents GCC from putting floating-point
!      constants in the TOC and '-mno-sum-in-toc' forces GCC to generate
       code to calculate the sum of an address and a constant at run time
       instead of putting that sum into the TOC.  You may specify one or
       both of these options.  Each causes GCC to produce very slightly
       slower and larger code at the expense of conserving TOC space.
  
!      If you still run out of space in the TOC even when you specify both
!      of these options, specify '-mminimal-toc' instead.  This option
!      causes GCC to make only one TOC entry for every file.  When you
!      specify this option, GCC produces code that is slower and larger
!      but which uses extremely little TOC space.  You may wish to use
!      this option only on files that contain less frequently-executed
!      code.
  
! '-maix64'
! '-maix32'
       Enable 64-bit AIX ABI and calling convention: 64-bit pointers,
!      64-bit 'long' type, and the infrastructure needed to support them.
!      Specifying '-maix64' implies '-mpowerpc64', while '-maix32'
!      disables the 64-bit ABI and implies '-mno-powerpc64'.  GCC defaults
!      to '-maix32'.
  
! '-mxl-compat'
! '-mno-xl-compat'
       Produce code that conforms more closely to IBM XL compiler
       semantics when using AIX-compatible ABI.  Pass floating-point
       arguments to prototyped functions beyond the register save area
*************** These `-m' options are defined for the I
*** 17876,18311 ****
       The AIX calling convention was extended but not initially
       documented to handle an obscure K&R C case of calling a function
       that takes the address of its arguments with fewer arguments than
!      declared.  IBM XL compilers access floating-point arguments that
!      do not fit in the RSA from the stack when a subroutine is compiled
       without optimization.  Because always storing floating-point
       arguments on the stack is inefficient and rarely needed, this
!      option is not enabled by default and only is necessary when
!      calling subroutines compiled by IBM XL compilers without
!      optimization.
  
! `-mpe'
       Support "IBM RS/6000 SP" "Parallel Environment" (PE).  Link an
       application written to use message passing with special startup
       code to enable the application to run.  The system must have PE
!      installed in the standard location (`/usr/lpp/ppe.poe/'), or the
!      `specs' file must be overridden with the `-specs=' option to
       specify the appropriate directory location.  The Parallel
!      Environment does not support threads, so the `-mpe' option and the
!      `-pthread' option are incompatible.
  
! `-malign-natural'
! `-malign-power'
       On AIX, 32-bit Darwin, and 64-bit PowerPC GNU/Linux, the option
!      `-malign-natural' overrides the ABI-defined alignment of larger
       types, such as floating-point doubles, on their natural size-based
!      boundary.  The option `-malign-power' instructs GCC to follow the
       ABI-specified alignment rules.  GCC defaults to the standard
       alignment defined in the ABI.
  
       On 64-bit Darwin, natural alignment is the default, and
!      `-malign-power' is not supported.
  
! `-msoft-float'
! `-mhard-float'
       Generate code that does not use (uses) the floating-point register
       set.  Software floating-point emulation is provided if you use the
!      `-msoft-float' option, and pass the option to GCC when linking.
  
! `-msingle-float'
! `-mdouble-float'
       Generate code for single- or double-precision floating-point
!      operations.  `-mdouble-float' implies `-msingle-float'.
  
! `-msimple-fpu'
!      Do not generate `sqrt' and `div' instructions for hardware
       floating-point unit.
  
! `-mfpu=NAME'
       Specify type of floating-point unit.  Valid values for NAME are
!      `sp_lite' (equivalent to `-msingle-float -msimple-fpu'), `dp_lite'
!      (equivalent to `-mdouble-float -msimple-fpu'), `sp_full'
!      (equivalent to `-msingle-float'), and `dp_full' (equivalent to
!      `-mdouble-float').
  
! `-mxilinx-fpu'
       Perform optimizations for the floating-point unit on Xilinx PPC
       405/440.
  
! `-mmultiple'
! `-mno-multiple'
       Generate code that uses (does not use) the load multiple word
       instructions and the store multiple word instructions.  These
       instructions are generated by default on POWER systems, and not
!      generated on PowerPC systems.  Do not use `-mmultiple' on
!      little-endian PowerPC systems, since those instructions do not
!      work when the processor is in little-endian mode.  The exceptions
!      are PPC740 and PPC750 which permit these instructions in
!      little-endian mode.
  
! `-mstring'
! `-mno-string'
       Generate code that uses (does not use) the load string instructions
       and the store string word instructions to save multiple registers
       and do small block moves.  These instructions are generated by
!      default on POWER systems, and not generated on PowerPC systems.
!      Do not use `-mstring' on little-endian PowerPC systems, since those
       instructions do not work when the processor is in little-endian
       mode.  The exceptions are PPC740 and PPC750 which permit these
       instructions in little-endian mode.
  
! `-mupdate'
! `-mno-update'
       Generate code that uses (does not use) the load or store
       instructions that update the base register to the address of the
       calculated memory location.  These instructions are generated by
!      default.  If you use `-mno-update', there is a small window
!      between the time that the stack pointer is updated and the address
!      of the previous frame is stored, which means code that walks the
!      stack frame across interrupts or signals may get corrupted data.
  
! `-mavoid-indexed-addresses'
! `-mno-avoid-indexed-addresses'
       Generate code that tries to avoid (not avoid) the use of indexed
!      load or store instructions. These instructions can incur a
       performance penalty on Power6 processors in certain situations,
       such as when stepping through large arrays that cross a 16M
       boundary.  This option is enabled by default when targeting Power6
       and disabled otherwise.
  
! `-mfused-madd'
! `-mno-fused-madd'
       Generate code that uses (does not use) the floating-point multiply
       and accumulate instructions.  These instructions are generated by
       default if hardware floating point is used.  The machine-dependent
!      `-mfused-madd' option is now mapped to the machine-independent
!      `-ffp-contract=fast' option, and `-mno-fused-madd' is mapped to
!      `-ffp-contract=off'.
  
! `-mmulhw'
! `-mno-mulhw'
       Generate code that uses (does not use) the half-word multiply and
       multiply-accumulate instructions on the IBM 405, 440, 464 and 476
       processors.  These instructions are generated by default when
       targeting those processors.
  
! `-mdlmzb'
! `-mno-dlmzb'
!      Generate code that uses (does not use) the string-search `dlmzb'
       instruction on the IBM 405, 440, 464 and 476 processors.  This
       instruction is generated by default when targeting those
       processors.
  
! `-mno-bit-align'
! `-mbit-align'
       On System V.4 and embedded PowerPC systems do not (do) force
       structures and unions that contain bit-fields to be aligned to the
       base type of the bit-field.
  
       For example, by default a structure containing nothing but 8
!      `unsigned' bit-fields of length 1 is aligned to a 4-byte boundary
!      and has a size of 4 bytes.  By using `-mno-bit-align', the
       structure is aligned to a 1-byte boundary and is 1 byte in size.
  
! `-mno-strict-align'
! `-mstrict-align'
       On System V.4 and embedded PowerPC systems do not (do) assume that
       unaligned memory references are handled by the system.
  
! `-mrelocatable'
! `-mno-relocatable'
       Generate code that allows (does not allow) a static executable to
       be relocated to a different address at run time.  A simple embedded
       PowerPC system loader should relocate the entire contents of
!      `.got2' and 4-byte locations listed in the `.fixup' section, a
       table of 32-bit addresses generated by this option.  For this to
       work, all objects linked together must be compiled with
!      `-mrelocatable' or `-mrelocatable-lib'.  `-mrelocatable' code
       aligns the stack to an 8-byte boundary.
  
! `-mrelocatable-lib'
! `-mno-relocatable-lib'
!      Like `-mrelocatable', `-mrelocatable-lib' generates a `.fixup'
       section to allow static executables to be relocated at run time,
!      but `-mrelocatable-lib' does not use the smaller stack alignment
!      of `-mrelocatable'.  Objects compiled with `-mrelocatable-lib' may
!      be linked with objects compiled with any combination of the
!      `-mrelocatable' options.
  
! `-mno-toc'
! `-mtoc'
       On System V.4 and embedded PowerPC systems do not (do) assume that
       register 2 contains a pointer to a global area pointing to the
       addresses used in the program.
  
! `-mlittle'
! `-mlittle-endian'
       On System V.4 and embedded PowerPC systems compile code for the
!      processor in little-endian mode.  The `-mlittle-endian' option is
!      the same as `-mlittle'.
  
! `-mbig'
! `-mbig-endian'
       On System V.4 and embedded PowerPC systems compile code for the
!      processor in big-endian mode.  The `-mbig-endian' option is the
!      same as `-mbig'.
  
! `-mdynamic-no-pic'
       On Darwin and Mac OS X systems, compile code so that it is not
       relocatable, but that its external references are relocatable.  The
       resulting code is suitable for applications, but not shared
       libraries.
  
! `-msingle-pic-base'
       Treat the register used for PIC addressing as read-only, rather
       than loading it in the prologue for each function.  The runtime
       system is responsible for initializing this register with an
       appropriate value before execution begins.
  
! `-mprioritize-restricted-insns=PRIORITY'
!      This option controls the priority that is assigned to
!      dispatch-slot restricted instructions during the second scheduling
!      pass.  The argument PRIORITY takes the value `0', `1', or `2' to
!      assign no, highest, or second-highest (respectively) priority to
!      dispatch-slot restricted instructions.
  
! `-msched-costly-dep=DEPENDENCE_TYPE'
!      This option controls which dependences are considered costly by
!      the target during instruction scheduling.  The argument
!      DEPENDENCE_TYPE takes one of the following values:
  
!     `no'
            No dependence is costly.
  
!     `all'
            All dependences are costly.
  
!     `true_store_to_load'
            A true dependence from store to load is costly.
  
!     `store_to_load'
            Any dependence from store to load is costly.
  
!     NUMBER
            Any dependence for which the latency is greater than or equal
            to NUMBER is costly.
  
! `-minsert-sched-nops=SCHEME'
       This option controls which NOP insertion scheme is used during the
       second scheduling pass.  The argument SCHEME takes one of the
       following values:
  
!     `no'
            Don't insert NOPs.
  
!     `pad'
            Pad with NOPs any dispatch group that has vacant issue slots,
            according to the scheduler's grouping.
  
!     `regroup_exact'
            Insert NOPs to force costly dependent insns into separate
            groups.  Insert exactly as many NOPs as needed to force an
            insn to a new group, according to the estimated processor
            grouping.
  
!     NUMBER
            Insert NOPs to force costly dependent insns into separate
            groups.  Insert NUMBER NOPs to force an insn to a new group.
  
! `-mcall-sysv'
       On System V.4 and embedded PowerPC systems compile code using
       calling conventions that adhere to the March 1995 draft of the
       System V Application Binary Interface, PowerPC processor
       supplement.  This is the default unless you configured GCC using
!      `powerpc-*-eabiaix'.
  
! `-mcall-sysv-eabi'
! `-mcall-eabi'
!      Specify both `-mcall-sysv' and `-meabi' options.
  
! `-mcall-sysv-noeabi'
!      Specify both `-mcall-sysv' and `-mno-eabi' options.
  
! `-mcall-aixdesc'
       On System V.4 and embedded PowerPC systems compile code for the AIX
       operating system.
  
! `-mcall-linux'
       On System V.4 and embedded PowerPC systems compile code for the
       Linux-based GNU system.
  
! `-mcall-freebsd'
       On System V.4 and embedded PowerPC systems compile code for the
       FreeBSD operating system.
  
! `-mcall-netbsd'
       On System V.4 and embedded PowerPC systems compile code for the
       NetBSD operating system.
  
! `-mcall-openbsd'
       On System V.4 and embedded PowerPC systems compile code for the
       OpenBSD operating system.
  
! `-maix-struct-return'
       Return all structures in memory (as specified by the AIX ABI).
  
! `-msvr4-struct-return'
       Return structures smaller than 8 bytes in registers (as specified
       by the SVR4 ABI).
  
! `-mabi=ABI-TYPE'
       Extend the current ABI with a particular extension, or remove such
!      extension.  Valid values are `altivec', `no-altivec', `spe',
!      `no-spe', `ibmlongdouble', `ieeelongdouble', `elfv1', `elfv2'.
  
! `-mabi=spe'
       Extend the current ABI with SPE ABI extensions.  This does not
       change the default ABI, instead it adds the SPE ABI extensions to
       the current ABI.
  
! `-mabi=no-spe'
       Disable Book-E SPE ABI extensions for the current ABI.
  
! `-mabi=ibmlongdouble'
       Change the current ABI to use IBM extended-precision long double.
       This is a PowerPC 32-bit SYSV ABI option.
  
! `-mabi=ieeelongdouble'
       Change the current ABI to use IEEE extended-precision long double.
       This is a PowerPC 32-bit Linux ABI option.
  
! `-mabi=elfv1'
!      Change the current ABI to use the ELFv1 ABI.  This is the default
       ABI for big-endian PowerPC 64-bit Linux.  Overriding the default
       ABI requires special system support and is likely to fail in
       spectacular ways.
  
! `-mabi=elfv2'
!      Change the current ABI to use the ELFv2 ABI.  This is the default
!      ABI for little-endian PowerPC 64-bit Linux.  Overriding the
!      default ABI requires special system support and is likely to fail
!      in spectacular ways.
  
! `-mprototype'
! `-mno-prototype'
       On System V.4 and embedded PowerPC systems assume that all calls to
       variable argument functions are properly prototyped.  Otherwise,
!      the compiler must insert an instruction before every
!      non-prototyped call to set or clear bit 6 of the condition code
!      register (`CR') to indicate whether floating-point values are
!      passed in the floating-point registers in case the function takes
!      variable arguments.  With `-mprototype', only calls to prototyped
!      variable argument functions set or clear the bit.
  
! `-msim'
       On embedded PowerPC systems, assume that the startup module is
!      called `sim-crt0.o' and that the standard C libraries are
!      `libsim.a' and `libc.a'.  This is the default for
!      `powerpc-*-eabisim' configurations.
  
! `-mmvme'
       On embedded PowerPC systems, assume that the startup module is
!      called `crt0.o' and the standard C libraries are `libmvme.a' and
!      `libc.a'.
  
! `-mads'
       On embedded PowerPC systems, assume that the startup module is
!      called `crt0.o' and the standard C libraries are `libads.a' and
!      `libc.a'.
  
! `-myellowknife'
       On embedded PowerPC systems, assume that the startup module is
!      called `crt0.o' and the standard C libraries are `libyk.a' and
!      `libc.a'.
  
! `-mvxworks'
       On System V.4 and embedded PowerPC systems, specify that you are
       compiling for a VxWorks system.
  
! `-memb'
!      On embedded PowerPC systems, set the `PPC_EMB' bit in the ELF flags
!      header to indicate that `eabi' extended relocations are used.
  
! `-meabi'
! `-mno-eabi'
       On System V.4 and embedded PowerPC systems do (do not) adhere to
       the Embedded Applications Binary Interface (EABI), which is a set
       of modifications to the System V.4 specifications.  Selecting
!      `-meabi' means that the stack is aligned to an 8-byte boundary, a
!      function `__eabi' is called from `main' to set up the EABI
!      environment, and the `-msdata' option can use both `r2' and `r13'
!      to point to two separate small data areas.  Selecting `-mno-eabi'
       means that the stack is aligned to a 16-byte boundary, no EABI
!      initialization function is called from `main', and the `-msdata'
!      option only uses `r13' to point to a single small data area.  The
!      `-meabi' option is on by default if you configured GCC using one
!      of the `powerpc*-*-eabi*' options.
  
! `-msdata=eabi'
       On System V.4 and embedded PowerPC systems, put small initialized
!      `const' global and static data in the `.sdata2' section, which is
!      pointed to by register `r2'.  Put small initialized non-`const'
!      global and static data in the `.sdata' section, which is pointed
!      to by register `r13'.  Put small uninitialized global and static
!      data in the `.sbss' section, which is adjacent to the `.sdata'
!      section.  The `-msdata=eabi' option is incompatible with the
!      `-mrelocatable' option.  The `-msdata=eabi' option also sets the
!      `-memb' option.
  
! `-msdata=sysv'
       On System V.4 and embedded PowerPC systems, put small global and
!      static data in the `.sdata' section, which is pointed to by
!      register `r13'.  Put small uninitialized global and static data in
!      the `.sbss' section, which is adjacent to the `.sdata' section.
!      The `-msdata=sysv' option is incompatible with the `-mrelocatable'
       option.
  
! `-msdata=default'
! `-msdata'
!      On System V.4 and embedded PowerPC systems, if `-meabi' is used,
!      compile code the same as `-msdata=eabi', otherwise compile code the
!      same as `-msdata=sysv'.
  
! `-msdata=data'
       On System V.4 and embedded PowerPC systems, put small global data
!      in the `.sdata' section.  Put small uninitialized global data in
!      the `.sbss' section.  Do not use register `r13' to address small
!      data however.  This is the default behavior unless other `-msdata'
       options are used.
  
! `-msdata=none'
! `-mno-sdata'
       On embedded PowerPC systems, put all initialized global and static
!      data in the `.data' section, and all uninitialized data in the
!      `.bss' section.
  
! `-mblock-move-inline-limit=NUM'
!      Inline all block moves (such as calls to `memcpy' or structure
!      copies) less than or equal to NUM bytes.  The minimum value for
!      NUM is 32 bytes on 32-bit targets and 64 bytes on 64-bit targets.
!      The default value is target-specific.
  
! `-G NUM'
       On embedded PowerPC systems, put global and static items less than
       or equal to NUM bytes into the small data or BSS sections instead
!      of the normal data or BSS section.  By default, NUM is 8.  The `-G
       NUM' switch is also passed to the linker.  All modules should be
!      compiled with the same `-G NUM' value.
  
! `-mregnames'
! `-mno-regnames'
       On System V.4 and embedded PowerPC systems do (do not) emit
       register names in the assembly language output using symbolic
       forms.
  
! `-mlongcall'
! `-mno-longcall'
       By default assume that all calls are far away so that a longer and
       more expensive calling sequence is required.  This is required for
!      calls farther than 32 megabytes (33,554,432 bytes) from the
!      current location.  A short call is generated if the compiler knows
!      the call cannot be that far away.  This setting can be overridden
!      by the `shortcall' function attribute, or by `#pragma longcall(0)'.
  
       Some linkers are capable of detecting out-of-range calls and
       generating glue code on the fly.  On these systems, long calls are
--- 17789,18222 ----
       The AIX calling convention was extended but not initially
       documented to handle an obscure K&R C case of calling a function
       that takes the address of its arguments with fewer arguments than
!      declared.  IBM XL compilers access floating-point arguments that do
!      not fit in the RSA from the stack when a subroutine is compiled
       without optimization.  Because always storing floating-point
       arguments on the stack is inefficient and rarely needed, this
!      option is not enabled by default and only is necessary when calling
!      subroutines compiled by IBM XL compilers without optimization.
  
! '-mpe'
       Support "IBM RS/6000 SP" "Parallel Environment" (PE).  Link an
       application written to use message passing with special startup
       code to enable the application to run.  The system must have PE
!      installed in the standard location ('/usr/lpp/ppe.poe/'), or the
!      'specs' file must be overridden with the '-specs=' option to
       specify the appropriate directory location.  The Parallel
!      Environment does not support threads, so the '-mpe' option and the
!      '-pthread' option are incompatible.
  
! '-malign-natural'
! '-malign-power'
       On AIX, 32-bit Darwin, and 64-bit PowerPC GNU/Linux, the option
!      '-malign-natural' overrides the ABI-defined alignment of larger
       types, such as floating-point doubles, on their natural size-based
!      boundary.  The option '-malign-power' instructs GCC to follow the
       ABI-specified alignment rules.  GCC defaults to the standard
       alignment defined in the ABI.
  
       On 64-bit Darwin, natural alignment is the default, and
!      '-malign-power' is not supported.
  
! '-msoft-float'
! '-mhard-float'
       Generate code that does not use (uses) the floating-point register
       set.  Software floating-point emulation is provided if you use the
!      '-msoft-float' option, and pass the option to GCC when linking.
  
! '-msingle-float'
! '-mdouble-float'
       Generate code for single- or double-precision floating-point
!      operations.  '-mdouble-float' implies '-msingle-float'.
  
! '-msimple-fpu'
!      Do not generate 'sqrt' and 'div' instructions for hardware
       floating-point unit.
  
! '-mfpu=NAME'
       Specify type of floating-point unit.  Valid values for NAME are
!      'sp_lite' (equivalent to '-msingle-float -msimple-fpu'), 'dp_lite'
!      (equivalent to '-mdouble-float -msimple-fpu'), 'sp_full'
!      (equivalent to '-msingle-float'), and 'dp_full' (equivalent to
!      '-mdouble-float').
  
! '-mxilinx-fpu'
       Perform optimizations for the floating-point unit on Xilinx PPC
       405/440.
  
! '-mmultiple'
! '-mno-multiple'
       Generate code that uses (does not use) the load multiple word
       instructions and the store multiple word instructions.  These
       instructions are generated by default on POWER systems, and not
!      generated on PowerPC systems.  Do not use '-mmultiple' on
!      little-endian PowerPC systems, since those instructions do not work
!      when the processor is in little-endian mode.  The exceptions are
!      PPC740 and PPC750 which permit these instructions in little-endian
!      mode.
  
! '-mstring'
! '-mno-string'
       Generate code that uses (does not use) the load string instructions
       and the store string word instructions to save multiple registers
       and do small block moves.  These instructions are generated by
!      default on POWER systems, and not generated on PowerPC systems.  Do
!      not use '-mstring' on little-endian PowerPC systems, since those
       instructions do not work when the processor is in little-endian
       mode.  The exceptions are PPC740 and PPC750 which permit these
       instructions in little-endian mode.
  
! '-mupdate'
! '-mno-update'
       Generate code that uses (does not use) the load or store
       instructions that update the base register to the address of the
       calculated memory location.  These instructions are generated by
!      default.  If you use '-mno-update', there is a small window between
!      the time that the stack pointer is updated and the address of the
!      previous frame is stored, which means code that walks the stack
!      frame across interrupts or signals may get corrupted data.
  
! '-mavoid-indexed-addresses'
! '-mno-avoid-indexed-addresses'
       Generate code that tries to avoid (not avoid) the use of indexed
!      load or store instructions.  These instructions can incur a
       performance penalty on Power6 processors in certain situations,
       such as when stepping through large arrays that cross a 16M
       boundary.  This option is enabled by default when targeting Power6
       and disabled otherwise.
  
! '-mfused-madd'
! '-mno-fused-madd'
       Generate code that uses (does not use) the floating-point multiply
       and accumulate instructions.  These instructions are generated by
       default if hardware floating point is used.  The machine-dependent
!      '-mfused-madd' option is now mapped to the machine-independent
!      '-ffp-contract=fast' option, and '-mno-fused-madd' is mapped to
!      '-ffp-contract=off'.
  
! '-mmulhw'
! '-mno-mulhw'
       Generate code that uses (does not use) the half-word multiply and
       multiply-accumulate instructions on the IBM 405, 440, 464 and 476
       processors.  These instructions are generated by default when
       targeting those processors.
  
! '-mdlmzb'
! '-mno-dlmzb'
!      Generate code that uses (does not use) the string-search 'dlmzb'
       instruction on the IBM 405, 440, 464 and 476 processors.  This
       instruction is generated by default when targeting those
       processors.
  
! '-mno-bit-align'
! '-mbit-align'
       On System V.4 and embedded PowerPC systems do not (do) force
       structures and unions that contain bit-fields to be aligned to the
       base type of the bit-field.
  
       For example, by default a structure containing nothing but 8
!      'unsigned' bit-fields of length 1 is aligned to a 4-byte boundary
!      and has a size of 4 bytes.  By using '-mno-bit-align', the
       structure is aligned to a 1-byte boundary and is 1 byte in size.
  
! '-mno-strict-align'
! '-mstrict-align'
       On System V.4 and embedded PowerPC systems do not (do) assume that
       unaligned memory references are handled by the system.
  
! '-mrelocatable'
! '-mno-relocatable'
       Generate code that allows (does not allow) a static executable to
       be relocated to a different address at run time.  A simple embedded
       PowerPC system loader should relocate the entire contents of
!      '.got2' and 4-byte locations listed in the '.fixup' section, a
       table of 32-bit addresses generated by this option.  For this to
       work, all objects linked together must be compiled with
!      '-mrelocatable' or '-mrelocatable-lib'.  '-mrelocatable' code
       aligns the stack to an 8-byte boundary.
  
! '-mrelocatable-lib'
! '-mno-relocatable-lib'
!      Like '-mrelocatable', '-mrelocatable-lib' generates a '.fixup'
       section to allow static executables to be relocated at run time,
!      but '-mrelocatable-lib' does not use the smaller stack alignment of
!      '-mrelocatable'.  Objects compiled with '-mrelocatable-lib' may be
!      linked with objects compiled with any combination of the
!      '-mrelocatable' options.
  
! '-mno-toc'
! '-mtoc'
       On System V.4 and embedded PowerPC systems do not (do) assume that
       register 2 contains a pointer to a global area pointing to the
       addresses used in the program.
  
! '-mlittle'
! '-mlittle-endian'
       On System V.4 and embedded PowerPC systems compile code for the
!      processor in little-endian mode.  The '-mlittle-endian' option is
!      the same as '-mlittle'.
  
! '-mbig'
! '-mbig-endian'
       On System V.4 and embedded PowerPC systems compile code for the
!      processor in big-endian mode.  The '-mbig-endian' option is the
!      same as '-mbig'.
  
! '-mdynamic-no-pic'
       On Darwin and Mac OS X systems, compile code so that it is not
       relocatable, but that its external references are relocatable.  The
       resulting code is suitable for applications, but not shared
       libraries.
  
! '-msingle-pic-base'
       Treat the register used for PIC addressing as read-only, rather
       than loading it in the prologue for each function.  The runtime
       system is responsible for initializing this register with an
       appropriate value before execution begins.
  
! '-mprioritize-restricted-insns=PRIORITY'
!      This option controls the priority that is assigned to dispatch-slot
!      restricted instructions during the second scheduling pass.  The
!      argument PRIORITY takes the value '0', '1', or '2' to assign no,
!      highest, or second-highest (respectively) priority to dispatch-slot
!      restricted instructions.
  
! '-msched-costly-dep=DEPENDENCE_TYPE'
!      This option controls which dependences are considered costly by the
!      target during instruction scheduling.  The argument DEPENDENCE_TYPE
!      takes one of the following values:
  
!      'no'
            No dependence is costly.
  
!      'all'
            All dependences are costly.
  
!      'true_store_to_load'
            A true dependence from store to load is costly.
  
!      'store_to_load'
            Any dependence from store to load is costly.
  
!      NUMBER
            Any dependence for which the latency is greater than or equal
            to NUMBER is costly.
  
! '-minsert-sched-nops=SCHEME'
       This option controls which NOP insertion scheme is used during the
       second scheduling pass.  The argument SCHEME takes one of the
       following values:
  
!      'no'
            Don't insert NOPs.
  
!      'pad'
            Pad with NOPs any dispatch group that has vacant issue slots,
            according to the scheduler's grouping.
  
!      'regroup_exact'
            Insert NOPs to force costly dependent insns into separate
            groups.  Insert exactly as many NOPs as needed to force an
            insn to a new group, according to the estimated processor
            grouping.
  
!      NUMBER
            Insert NOPs to force costly dependent insns into separate
            groups.  Insert NUMBER NOPs to force an insn to a new group.
  
! '-mcall-sysv'
       On System V.4 and embedded PowerPC systems compile code using
       calling conventions that adhere to the March 1995 draft of the
       System V Application Binary Interface, PowerPC processor
       supplement.  This is the default unless you configured GCC using
!      'powerpc-*-eabiaix'.
  
! '-mcall-sysv-eabi'
! '-mcall-eabi'
!      Specify both '-mcall-sysv' and '-meabi' options.
  
! '-mcall-sysv-noeabi'
!      Specify both '-mcall-sysv' and '-mno-eabi' options.
  
! '-mcall-aixdesc'
       On System V.4 and embedded PowerPC systems compile code for the AIX
       operating system.
  
! '-mcall-linux'
       On System V.4 and embedded PowerPC systems compile code for the
       Linux-based GNU system.
  
! '-mcall-freebsd'
       On System V.4 and embedded PowerPC systems compile code for the
       FreeBSD operating system.
  
! '-mcall-netbsd'
       On System V.4 and embedded PowerPC systems compile code for the
       NetBSD operating system.
  
! '-mcall-openbsd'
       On System V.4 and embedded PowerPC systems compile code for the
       OpenBSD operating system.
  
! '-maix-struct-return'
       Return all structures in memory (as specified by the AIX ABI).
  
! '-msvr4-struct-return'
       Return structures smaller than 8 bytes in registers (as specified
       by the SVR4 ABI).
  
! '-mabi=ABI-TYPE'
       Extend the current ABI with a particular extension, or remove such
!      extension.  Valid values are 'altivec', 'no-altivec', 'spe',
!      'no-spe', 'ibmlongdouble', 'ieeelongdouble', 'elfv1', 'elfv2'.
  
! '-mabi=spe'
       Extend the current ABI with SPE ABI extensions.  This does not
       change the default ABI, instead it adds the SPE ABI extensions to
       the current ABI.
  
! '-mabi=no-spe'
       Disable Book-E SPE ABI extensions for the current ABI.
  
! '-mabi=ibmlongdouble'
       Change the current ABI to use IBM extended-precision long double.
       This is a PowerPC 32-bit SYSV ABI option.
  
! '-mabi=ieeelongdouble'
       Change the current ABI to use IEEE extended-precision long double.
       This is a PowerPC 32-bit Linux ABI option.
  
! '-mabi=elfv1'
!      Change the current ABI to use the ELFv1 ABI. This is the default
       ABI for big-endian PowerPC 64-bit Linux.  Overriding the default
       ABI requires special system support and is likely to fail in
       spectacular ways.
  
! '-mabi=elfv2'
!      Change the current ABI to use the ELFv2 ABI. This is the default
!      ABI for little-endian PowerPC 64-bit Linux.  Overriding the default
!      ABI requires special system support and is likely to fail in
!      spectacular ways.
  
! '-mprototype'
! '-mno-prototype'
       On System V.4 and embedded PowerPC systems assume that all calls to
       variable argument functions are properly prototyped.  Otherwise,
!      the compiler must insert an instruction before every non-prototyped
!      call to set or clear bit 6 of the condition code register ('CR') to
!      indicate whether floating-point values are passed in the
!      floating-point registers in case the function takes variable
!      arguments.  With '-mprototype', only calls to prototyped variable
!      argument functions set or clear the bit.
  
! '-msim'
       On embedded PowerPC systems, assume that the startup module is
!      called 'sim-crt0.o' and that the standard C libraries are
!      'libsim.a' and 'libc.a'.  This is the default for
!      'powerpc-*-eabisim' configurations.
  
! '-mmvme'
       On embedded PowerPC systems, assume that the startup module is
!      called 'crt0.o' and the standard C libraries are 'libmvme.a' and
!      'libc.a'.
  
! '-mads'
       On embedded PowerPC systems, assume that the startup module is
!      called 'crt0.o' and the standard C libraries are 'libads.a' and
!      'libc.a'.
  
! '-myellowknife'
       On embedded PowerPC systems, assume that the startup module is
!      called 'crt0.o' and the standard C libraries are 'libyk.a' and
!      'libc.a'.
  
! '-mvxworks'
       On System V.4 and embedded PowerPC systems, specify that you are
       compiling for a VxWorks system.
  
! '-memb'
!      On embedded PowerPC systems, set the 'PPC_EMB' bit in the ELF flags
!      header to indicate that 'eabi' extended relocations are used.
  
! '-meabi'
! '-mno-eabi'
       On System V.4 and embedded PowerPC systems do (do not) adhere to
       the Embedded Applications Binary Interface (EABI), which is a set
       of modifications to the System V.4 specifications.  Selecting
!      '-meabi' means that the stack is aligned to an 8-byte boundary, a
!      function '__eabi' is called from 'main' to set up the EABI
!      environment, and the '-msdata' option can use both 'r2' and 'r13'
!      to point to two separate small data areas.  Selecting '-mno-eabi'
       means that the stack is aligned to a 16-byte boundary, no EABI
!      initialization function is called from 'main', and the '-msdata'
!      option only uses 'r13' to point to a single small data area.  The
!      '-meabi' option is on by default if you configured GCC using one of
!      the 'powerpc*-*-eabi*' options.
  
! '-msdata=eabi'
       On System V.4 and embedded PowerPC systems, put small initialized
!      'const' global and static data in the '.sdata2' section, which is
!      pointed to by register 'r2'.  Put small initialized non-'const'
!      global and static data in the '.sdata' section, which is pointed to
!      by register 'r13'.  Put small uninitialized global and static data
!      in the '.sbss' section, which is adjacent to the '.sdata' section.
!      The '-msdata=eabi' option is incompatible with the '-mrelocatable'
!      option.  The '-msdata=eabi' option also sets the '-memb' option.
  
! '-msdata=sysv'
       On System V.4 and embedded PowerPC systems, put small global and
!      static data in the '.sdata' section, which is pointed to by
!      register 'r13'.  Put small uninitialized global and static data in
!      the '.sbss' section, which is adjacent to the '.sdata' section.
!      The '-msdata=sysv' option is incompatible with the '-mrelocatable'
       option.
  
! '-msdata=default'
! '-msdata'
!      On System V.4 and embedded PowerPC systems, if '-meabi' is used,
!      compile code the same as '-msdata=eabi', otherwise compile code the
!      same as '-msdata=sysv'.
  
! '-msdata=data'
       On System V.4 and embedded PowerPC systems, put small global data
!      in the '.sdata' section.  Put small uninitialized global data in
!      the '.sbss' section.  Do not use register 'r13' to address small
!      data however.  This is the default behavior unless other '-msdata'
       options are used.
  
! '-msdata=none'
! '-mno-sdata'
       On embedded PowerPC systems, put all initialized global and static
!      data in the '.data' section, and all uninitialized data in the
!      '.bss' section.
  
! '-mblock-move-inline-limit=NUM'
!      Inline all block moves (such as calls to 'memcpy' or structure
!      copies) less than or equal to NUM bytes.  The minimum value for NUM
!      is 32 bytes on 32-bit targets and 64 bytes on 64-bit targets.  The
!      default value is target-specific.
  
! '-G NUM'
       On embedded PowerPC systems, put global and static items less than
       or equal to NUM bytes into the small data or BSS sections instead
!      of the normal data or BSS section.  By default, NUM is 8.  The '-G
       NUM' switch is also passed to the linker.  All modules should be
!      compiled with the same '-G NUM' value.
  
! '-mregnames'
! '-mno-regnames'
       On System V.4 and embedded PowerPC systems do (do not) emit
       register names in the assembly language output using symbolic
       forms.
  
! '-mlongcall'
! '-mno-longcall'
       By default assume that all calls are far away so that a longer and
       more expensive calling sequence is required.  This is required for
!      calls farther than 32 megabytes (33,554,432 bytes) from the current
!      location.  A short call is generated if the compiler knows the call
!      cannot be that far away.  This setting can be overridden by the
!      'shortcall' function attribute, or by '#pragma longcall(0)'.
  
       Some linkers are capable of detecting out-of-range calls and
       generating glue code on the fly.  On these systems, long calls are
*************** These `-m' options are defined for the I
*** 18314,18328 ****
       planned to add this feature to the GNU linker for 32-bit PowerPC
       systems as well.
  
!      On Darwin/PPC systems, `#pragma longcall' generates `jbsr callee,
!      L42', plus a "branch island" (glue code).  The two target
!      addresses represent the callee and the branch island.  The
!      Darwin/PPC linker prefers the first address and generates a `bl
!      callee' if the PPC `bl' instruction reaches the callee directly;
!      otherwise, the linker generates `bl L42' to call the branch
!      island.  The branch island is appended to the body of the calling
!      function; it computes the full 32-bit address of the callee and
!      jumps to it.
  
       On Mach-O (Darwin) systems, this option directs the compiler emit
       to the glue for every direct call, and the Darwin linker decides
--- 18225,18238 ----
       planned to add this feature to the GNU linker for 32-bit PowerPC
       systems as well.
  
!      On Darwin/PPC systems, '#pragma longcall' generates 'jbsr callee,
!      L42', plus a "branch island" (glue code).  The two target addresses
!      represent the callee and the branch island.  The Darwin/PPC linker
!      prefers the first address and generates a 'bl callee' if the PPC
!      'bl' instruction reaches the callee directly; otherwise, the linker
!      generates 'bl L42' to call the branch island.  The branch island is
!      appended to the body of the calling function; it computes the full
!      32-bit address of the callee and jumps to it.
  
       On Mach-O (Darwin) systems, this option directs the compiler emit
       to the glue for every direct call, and the Darwin linker decides
*************** These `-m' options are defined for the I
*** 18331,18465 ****
       In the future, GCC may ignore all longcall specifications when the
       linker is known to generate glue.
  
! `-mtls-markers'
! `-mno-tls-markers'
!      Mark (do not mark) calls to `__tls_get_addr' with a relocation
!      specifying the function argument.  The relocation allows the
!      linker to reliably associate function call with argument setup
       instructions for TLS optimization, which in turn allows GCC to
       better schedule the sequence.
  
! `-pthread'
       Adds support for multithreading with the "pthreads" library.  This
       option sets flags for both the preprocessor and linker.
  
! `-mrecip'
! `-mno-recip'
       This option enables use of the reciprocal estimate and reciprocal
       square root estimate instructions with additional Newton-Raphson
       steps to increase precision instead of doing a divide or square
       root and divide for floating-point arguments.  You should use the
!      `-ffast-math' option when using `-mrecip' (or at least
!      `-funsafe-math-optimizations', `-finite-math-only',
!      `-freciprocal-math' and `-fno-trapping-math').  Note that while
!      the throughput of the sequence is generally higher than the
!      throughput of the non-reciprocal instruction, the precision of the
!      sequence can be decreased by up to 2 ulp (i.e. the inverse of 1.0
!      equals 0.99999994) for reciprocal square roots.
  
! `-mrecip=OPT'
       This option controls which reciprocal estimate instructions may be
       used.  OPT is a comma-separated list of options, which may be
!      preceded by a `!' to invert the option:
  
!     `all'
            Enable all estimate instructions.
  
!     `default'
!           Enable the default instructions, equivalent to `-mrecip'.
  
!     `none'
!           Disable all estimate instructions, equivalent to `-mno-recip'.
  
!     `div'
            Enable the reciprocal approximation instructions for both
            single and double precision.
  
!     `divf'
            Enable the single-precision reciprocal approximation
            instructions.
  
!     `divd'
            Enable the double-precision reciprocal approximation
            instructions.
  
!     `rsqrt'
            Enable the reciprocal square root approximation instructions
            for both single and double precision.
  
!     `rsqrtf'
            Enable the single-precision reciprocal square root
            approximation instructions.
  
!     `rsqrtd'
            Enable the double-precision reciprocal square root
            approximation instructions.
  
! 
!      So, for example, `-mrecip=all,!rsqrtd' enables all of the
!      reciprocal estimate instructions, except for the `FRSQRTE',
!      `XSRSQRTEDP', and `XVRSQRTEDP' instructions which handle the
       double-precision reciprocal square root calculations.
  
! `-mrecip-precision'
! `-mno-recip-precision'
       Assume (do not assume) that the reciprocal estimate instructions
       provide higher-precision estimates than is mandated by the PowerPC
!      ABI.  Selecting `-mcpu=power6', `-mcpu=power7' or `-mcpu=power8'
!      automatically selects `-mrecip-precision'.  The double-precision
       square root estimate instructions are not generated by default on
       low-precision machines, since they do not provide an estimate that
       converges after three steps.
  
! `-mveclibabi=TYPE'
       Specifies the ABI type to use for vectorizing intrinsics using an
!      external library.  The only type supported at present is `mass',
       which specifies to use IBM's Mathematical Acceleration Subsystem
       (MASS) libraries for vectorizing intrinsics using external
!      libraries.  GCC currently emits calls to `acosd2', `acosf4',
!      `acoshd2', `acoshf4', `asind2', `asinf4', `asinhd2', `asinhf4',
!      `atan2d2', `atan2f4', `atand2', `atanf4', `atanhd2', `atanhf4',
!      `cbrtd2', `cbrtf4', `cosd2', `cosf4', `coshd2', `coshf4',
!      `erfcd2', `erfcf4', `erfd2', `erff4', `exp2d2', `exp2f4', `expd2',
!      `expf4', `expm1d2', `expm1f4', `hypotd2', `hypotf4', `lgammad2',
!      `lgammaf4', `log10d2', `log10f4', `log1pd2', `log1pf4', `log2d2',
!      `log2f4', `logd2', `logf4', `powd2', `powf4', `sind2', `sinf4',
!      `sinhd2', `sinhf4', `sqrtd2', `sqrtf4', `tand2', `tanf4',
!      `tanhd2', and `tanhf4' when generating code for power7.  Both
!      `-ftree-vectorize' and `-funsafe-math-optimizations' must also be
!      enabled.  The MASS libraries must be specified at link time.
  
! `-mfriz'
! `-mno-friz'
!      Generate (do not generate) the `friz' instruction when the
!      `-funsafe-math-optimizations' option is used to optimize rounding
       of floating-point values to 64-bit integer and back to floating
!      point.  The `friz' instruction does not return the same value if
       the floating-point number is too large to fit in an integer.
  
! `-mpointers-to-nested-functions'
! `-mno-pointers-to-nested-functions'
       Generate (do not generate) code to load up the static chain
!      register (`r11') when calling through a pointer on AIX and 64-bit
       Linux systems where a function pointer points to a 3-word
       descriptor giving the function address, TOC value to be loaded in
!      register `r2', and static chain value to be loaded in register
!      `r11'.  The `-mpointers-to-nested-functions' is on by default.
!      You cannot call through pointers to nested functions or pointers
!      to functions compiled in other languages that use the static chain
!      if you use `-mno-pointers-to-nested-functions'.
  
! `-msave-toc-indirect'
! `-mno-save-toc-indirect'
       Generate (do not generate) code to save the TOC value in the
       reserved stack location in the function prologue if the function
       calls through a pointer on AIX and 64-bit Linux systems.  If the
!      TOC value is not saved in the prologue, it is saved just before
!      the call through the pointer.  The `-mno-save-toc-indirect' option
!      is the default.
  
! `-mcompat-align-parm'
! `-mno-compat-align-parm'
       Generate (do not generate) code to pass structure parameters with a
       maximum alignment of 64 bits, for compatibility with older versions
       of GCC.
--- 18241,18374 ----
       In the future, GCC may ignore all longcall specifications when the
       linker is known to generate glue.
  
! '-mtls-markers'
! '-mno-tls-markers'
!      Mark (do not mark) calls to '__tls_get_addr' with a relocation
!      specifying the function argument.  The relocation allows the linker
!      to reliably associate function call with argument setup
       instructions for TLS optimization, which in turn allows GCC to
       better schedule the sequence.
  
! '-pthread'
       Adds support for multithreading with the "pthreads" library.  This
       option sets flags for both the preprocessor and linker.
  
! '-mrecip'
! '-mno-recip'
       This option enables use of the reciprocal estimate and reciprocal
       square root estimate instructions with additional Newton-Raphson
       steps to increase precision instead of doing a divide or square
       root and divide for floating-point arguments.  You should use the
!      '-ffast-math' option when using '-mrecip' (or at least
!      '-funsafe-math-optimizations', '-finite-math-only',
!      '-freciprocal-math' and '-fno-trapping-math').  Note that while the
!      throughput of the sequence is generally higher than the throughput
!      of the non-reciprocal instruction, the precision of the sequence
!      can be decreased by up to 2 ulp (i.e. the inverse of 1.0 equals
!      0.99999994) for reciprocal square roots.
  
! '-mrecip=OPT'
       This option controls which reciprocal estimate instructions may be
       used.  OPT is a comma-separated list of options, which may be
!      preceded by a '!' to invert the option:
  
!      'all'
            Enable all estimate instructions.
  
!      'default'
!           Enable the default instructions, equivalent to '-mrecip'.
  
!      'none'
!           Disable all estimate instructions, equivalent to '-mno-recip'.
  
!      'div'
            Enable the reciprocal approximation instructions for both
            single and double precision.
  
!      'divf'
            Enable the single-precision reciprocal approximation
            instructions.
  
!      'divd'
            Enable the double-precision reciprocal approximation
            instructions.
  
!      'rsqrt'
            Enable the reciprocal square root approximation instructions
            for both single and double precision.
  
!      'rsqrtf'
            Enable the single-precision reciprocal square root
            approximation instructions.
  
!      'rsqrtd'
            Enable the double-precision reciprocal square root
            approximation instructions.
  
!      So, for example, '-mrecip=all,!rsqrtd' enables all of the
!      reciprocal estimate instructions, except for the 'FRSQRTE',
!      'XSRSQRTEDP', and 'XVRSQRTEDP' instructions which handle the
       double-precision reciprocal square root calculations.
  
! '-mrecip-precision'
! '-mno-recip-precision'
       Assume (do not assume) that the reciprocal estimate instructions
       provide higher-precision estimates than is mandated by the PowerPC
!      ABI. Selecting '-mcpu=power6', '-mcpu=power7' or '-mcpu=power8'
!      automatically selects '-mrecip-precision'.  The double-precision
       square root estimate instructions are not generated by default on
       low-precision machines, since they do not provide an estimate that
       converges after three steps.
  
! '-mveclibabi=TYPE'
       Specifies the ABI type to use for vectorizing intrinsics using an
!      external library.  The only type supported at present is 'mass',
       which specifies to use IBM's Mathematical Acceleration Subsystem
       (MASS) libraries for vectorizing intrinsics using external
!      libraries.  GCC currently emits calls to 'acosd2', 'acosf4',
!      'acoshd2', 'acoshf4', 'asind2', 'asinf4', 'asinhd2', 'asinhf4',
!      'atan2d2', 'atan2f4', 'atand2', 'atanf4', 'atanhd2', 'atanhf4',
!      'cbrtd2', 'cbrtf4', 'cosd2', 'cosf4', 'coshd2', 'coshf4', 'erfcd2',
!      'erfcf4', 'erfd2', 'erff4', 'exp2d2', 'exp2f4', 'expd2', 'expf4',
!      'expm1d2', 'expm1f4', 'hypotd2', 'hypotf4', 'lgammad2', 'lgammaf4',
!      'log10d2', 'log10f4', 'log1pd2', 'log1pf4', 'log2d2', 'log2f4',
!      'logd2', 'logf4', 'powd2', 'powf4', 'sind2', 'sinf4', 'sinhd2',
!      'sinhf4', 'sqrtd2', 'sqrtf4', 'tand2', 'tanf4', 'tanhd2', and
!      'tanhf4' when generating code for power7.  Both '-ftree-vectorize'
!      and '-funsafe-math-optimizations' must also be enabled.  The MASS
!      libraries must be specified at link time.
  
! '-mfriz'
! '-mno-friz'
!      Generate (do not generate) the 'friz' instruction when the
!      '-funsafe-math-optimizations' option is used to optimize rounding
       of floating-point values to 64-bit integer and back to floating
!      point.  The 'friz' instruction does not return the same value if
       the floating-point number is too large to fit in an integer.
  
! '-mpointers-to-nested-functions'
! '-mno-pointers-to-nested-functions'
       Generate (do not generate) code to load up the static chain
!      register ('r11') when calling through a pointer on AIX and 64-bit
       Linux systems where a function pointer points to a 3-word
       descriptor giving the function address, TOC value to be loaded in
!      register 'r2', and static chain value to be loaded in register
!      'r11'.  The '-mpointers-to-nested-functions' is on by default.  You
!      cannot call through pointers to nested functions or pointers to
!      functions compiled in other languages that use the static chain if
!      you use '-mno-pointers-to-nested-functions'.
  
! '-msave-toc-indirect'
! '-mno-save-toc-indirect'
       Generate (do not generate) code to save the TOC value in the
       reserved stack location in the function prologue if the function
       calls through a pointer on AIX and 64-bit Linux systems.  If the
!      TOC value is not saved in the prologue, it is saved just before the
!      call through the pointer.  The '-mno-save-toc-indirect' option is
!      the default.
  
! '-mcompat-align-parm'
! '-mno-compat-align-parm'
       Generate (do not generate) code to pass structure parameters with a
       maximum alignment of 64 bits, for compatibility with older versions
       of GCC.
*************** These `-m' options are defined for the I
*** 18467,18477 ****
       Older versions of GCC (prior to 4.9.0) incorrectly did not align a
       structure parameter on a 128-bit boundary when that structure
       contained a member requiring 128-bit alignment.  This is corrected
!      in more recent versions of GCC.  This option may be used to
!      generate code that is compatible with functions compiled with
!      older versions of GCC.
  
!      The `-mno-compat-align-parm' option is the default.
  
  
  File: gcc.info,  Node: RX Options,  Next: S/390 and zSeries Options,  Prev: RS/6000 and PowerPC Options,  Up: Submodel Options
--- 18376,18386 ----
       Older versions of GCC (prior to 4.9.0) incorrectly did not align a
       structure parameter on a 128-bit boundary when that structure
       contained a member requiring 128-bit alignment.  This is corrected
!      in more recent versions of GCC. This option may be used to generate
!      code that is compatible with functions compiled with older versions
!      of GCC.
  
!      The '-mno-compat-align-parm' option is the default.
  
  
  File: gcc.info,  Node: RX Options,  Next: S/390 and zSeries Options,  Prev: RS/6000 and PowerPC Options,  Up: Submodel Options
*************** File: gcc.info,  Node: RX Options,  Next
*** 18481,18531 ****
  
  These command-line options are defined for RX targets:
  
! `-m64bit-doubles'
! `-m32bit-doubles'
!      Make the `double' data type be 64 bits (`-m64bit-doubles') or 32
!      bits (`-m32bit-doubles') in size.  The default is
!      `-m32bit-doubles'.  _Note_ RX floating-point hardware only works
!      on 32-bit values, which is why the default is `-m32bit-doubles'.
  
! `-fpu'
! `-nofpu'
!      Enables (`-fpu') or disables (`-nofpu') the use of RX
       floating-point hardware.  The default is enabled for the RX600
       series and disabled for the RX200 series.
  
       Floating-point instructions are only generated for 32-bit
!      floating-point values, however, so the FPU hardware is not used
!      for doubles if the `-m64bit-doubles' option is used.
  
!      _Note_ If the `-fpu' option is enabled then
!      `-funsafe-math-optimizations' is also enabled automatically.  This
       is because the RX FPU instructions are themselves unsafe.
  
! `-mcpu=NAME'
       Selects the type of RX CPU to be targeted.  Currently three types
!      are supported, the generic `RX600' and `RX200' series hardware and
!      the specific `RX610' CPU.  The default is `RX600'.
  
!      The only difference between `RX600' and `RX610' is that the
!      `RX610' does not support the `MVTIPL' instruction.
  
!      The `RX200' series does not have a hardware floating-point unit
!      and so `-nofpu' is enabled by default when this type is selected.
  
! `-mbig-endian-data'
! `-mlittle-endian-data'
       Store data (but not code) in the big-endian format.  The default is
!      `-mlittle-endian-data', i.e. to store data in the little-endian
       format.
  
! `-msmall-data-limit=N'
       Specifies the maximum size in bytes of global and static variables
       which can be placed into the small data area.  Using the small data
       area can lead to smaller and faster code, but the size of area is
       limited and it is up to the programmer to ensure that the area does
       not overflow.  Also when the small data area is used one of the
!      RX's registers (usually `r13') is reserved for use pointing to this
       area, so it is no longer available for use by the compiler.  This
       could result in slower and/or larger code if variables are pushed
       onto the stack instead of being held in this register.
--- 18390,18440 ----
  
  These command-line options are defined for RX targets:
  
! '-m64bit-doubles'
! '-m32bit-doubles'
!      Make the 'double' data type be 64 bits ('-m64bit-doubles') or 32
!      bits ('-m32bit-doubles') in size.  The default is
!      '-m32bit-doubles'.  _Note_ RX floating-point hardware only works on
!      32-bit values, which is why the default is '-m32bit-doubles'.
  
! '-fpu'
! '-nofpu'
!      Enables ('-fpu') or disables ('-nofpu') the use of RX
       floating-point hardware.  The default is enabled for the RX600
       series and disabled for the RX200 series.
  
       Floating-point instructions are only generated for 32-bit
!      floating-point values, however, so the FPU hardware is not used for
!      doubles if the '-m64bit-doubles' option is used.
  
!      _Note_ If the '-fpu' option is enabled then
!      '-funsafe-math-optimizations' is also enabled automatically.  This
       is because the RX FPU instructions are themselves unsafe.
  
! '-mcpu=NAME'
       Selects the type of RX CPU to be targeted.  Currently three types
!      are supported, the generic 'RX600' and 'RX200' series hardware and
!      the specific 'RX610' CPU. The default is 'RX600'.
  
!      The only difference between 'RX600' and 'RX610' is that the 'RX610'
!      does not support the 'MVTIPL' instruction.
  
!      The 'RX200' series does not have a hardware floating-point unit and
!      so '-nofpu' is enabled by default when this type is selected.
  
! '-mbig-endian-data'
! '-mlittle-endian-data'
       Store data (but not code) in the big-endian format.  The default is
!      '-mlittle-endian-data', i.e. to store data in the little-endian
       format.
  
! '-msmall-data-limit=N'
       Specifies the maximum size in bytes of global and static variables
       which can be placed into the small data area.  Using the small data
       area can lead to smaller and faster code, but the size of area is
       limited and it is up to the programmer to ensure that the area does
       not overflow.  Also when the small data area is used one of the
!      RX's registers (usually 'r13') is reserved for use pointing to this
       area, so it is no longer available for use by the compiler.  This
       could result in slower and/or larger code if variables are pushed
       onto the stack instead of being held in this register.
*************** These command-line options are defined f
*** 18536,18560 ****
  
       The default value is zero, which disables this feature.  Note, this
       feature is not enabled by default with higher optimization levels
!      (`-O2' etc) because of the potentially detrimental effects of
       reserving a register.  It is up to the programmer to experiment and
       discover whether this feature is of benefit to their program.  See
!      the description of the `-mpid' option for a description of how the
       actual register to hold the small data area pointer is chosen.
  
! `-msim'
! `-mno-sim'
       Use the simulator runtime.  The default is to use the libgloss
       board-specific runtime.
  
! `-mas100-syntax'
! `-mno-as100-syntax'
       When generating assembler output use a syntax that is compatible
!      with Renesas's AS100 assembler.  This syntax can also be handled
!      by the GAS assembler, but it has some restrictions so it is not
       generated by default.
  
! `-mmax-constant-size=N'
       Specifies the maximum size, in bytes, of a constant that can be
       used as an operand in a RX instruction.  Although the RX
       instruction set does allow constants of up to 4 bytes in length to
--- 18445,18469 ----
  
       The default value is zero, which disables this feature.  Note, this
       feature is not enabled by default with higher optimization levels
!      ('-O2' etc) because of the potentially detrimental effects of
       reserving a register.  It is up to the programmer to experiment and
       discover whether this feature is of benefit to their program.  See
!      the description of the '-mpid' option for a description of how the
       actual register to hold the small data area pointer is chosen.
  
! '-msim'
! '-mno-sim'
       Use the simulator runtime.  The default is to use the libgloss
       board-specific runtime.
  
! '-mas100-syntax'
! '-mno-as100-syntax'
       When generating assembler output use a syntax that is compatible
!      with Renesas's AS100 assembler.  This syntax can also be handled by
!      the GAS assembler, but it has some restrictions so it is not
       generated by default.
  
! '-mmax-constant-size=N'
       Specifies the maximum size, in bytes, of a constant that can be
       used as an operand in a RX instruction.  Although the RX
       instruction set does allow constants of up to 4 bytes in length to
*************** These command-line options are defined f
*** 18567,18595 ****
       The value N can be between 0 and 4.  A value of 0 (the default) or
       4 means that constants of any size are allowed.
  
! `-mrelax'
       Enable linker relaxation.  Linker relaxation is a process whereby
       the linker attempts to reduce the size of a program by finding
       shorter versions of various instructions.  Disabled by default.
  
! `-mint-register=N'
       Specify the number of registers to reserve for fast interrupt
!      handler functions.  The value N can be between 0 and 4.  A value
!      of 1 means that register `r13' is reserved for the exclusive use
!      of fast interrupt handlers.  A value of 2 reserves `r13' and
!      `r12'.  A value of 3 reserves `r13', `r12' and `r11', and a value
!      of 4 reserves `r13' through `r10'.  A value of 0, the default,
!      does not reserve any registers.
  
! `-msave-acc-in-interrupts'
       Specifies that interrupt handler functions should preserve the
       accumulator register.  This is only necessary if normal code might
       use the accumulator register, for example because it performs
       64-bit multiplications.  The default is to ignore the accumulator
       as this makes the interrupt handlers faster.
  
! `-mpid'
! `-mno-pid'
       Enables the generation of position independent data.  When enabled
       any access to constant data is done via an offset from a base
       address held in a register.  This allows the location of constant
--- 18476,18504 ----
       The value N can be between 0 and 4.  A value of 0 (the default) or
       4 means that constants of any size are allowed.
  
! '-mrelax'
       Enable linker relaxation.  Linker relaxation is a process whereby
       the linker attempts to reduce the size of a program by finding
       shorter versions of various instructions.  Disabled by default.
  
! '-mint-register=N'
       Specify the number of registers to reserve for fast interrupt
!      handler functions.  The value N can be between 0 and 4.  A value of
!      1 means that register 'r13' is reserved for the exclusive use of
!      fast interrupt handlers.  A value of 2 reserves 'r13' and 'r12'.  A
!      value of 3 reserves 'r13', 'r12' and 'r11', and a value of 4
!      reserves 'r13' through 'r10'.  A value of 0, the default, does not
!      reserve any registers.
  
! '-msave-acc-in-interrupts'
       Specifies that interrupt handler functions should preserve the
       accumulator register.  This is only necessary if normal code might
       use the accumulator register, for example because it performs
       64-bit multiplications.  The default is to ignore the accumulator
       as this makes the interrupt handlers faster.
  
! '-mpid'
! '-mno-pid'
       Enables the generation of position independent data.  When enabled
       any access to constant data is done via an offset from a base
       address held in a register.  This allows the location of constant
*************** These command-line options are defined f
*** 18598,18634 ****
       tight memory constraints.  Data that can be modified is not
       affected by this option.
  
!      Note, using this feature reserves a register, usually `r13', for
       the constant data base address.  This can result in slower and/or
       larger code, especially in complicated functions.
  
       The actual register chosen to hold the constant data base address
!      depends upon whether the `-msmall-data-limit' and/or the
!      `-mint-register' command-line options are enabled.  Starting with
!      register `r13' and proceeding downwards, registers are allocated
!      first to satisfy the requirements of `-mint-register', then
!      `-mpid' and finally `-msmall-data-limit'.  Thus it is possible for
!      the small data area register to be `r8' if both `-mint-register=4'
!      and `-mpid' are specified on the command line.
  
       By default this feature is not enabled.  The default can be
!      restored via the `-mno-pid' command-line option.
  
! `-mno-warn-multiple-fast-interrupts'
! `-mwarn-multiple-fast-interrupts'
       Prevents GCC from issuing a warning message if it finds more than
       one fast interrupt handler when it is compiling a file.  The
!      default is to issue a warning for each extra fast interrupt
!      handler found, as the RX only supports one such interrupt.
! 
  
!  _Note:_ The generic GCC command-line option `-ffixed-REG' has special
! significance to the RX port when used with the `interrupt' function
! attribute.  This attribute indicates a function intended to process
! fast interrupts.  GCC ensures that it only uses the registers `r10',
! `r11', `r12' and/or `r13' and only provided that the normal use of the
! corresponding registers have been restricted via the `-ffixed-REG' or
! `-mint-register' command-line options.
  
  
  File: gcc.info,  Node: S/390 and zSeries Options,  Next: Score Options,  Prev: RX Options,  Up: Submodel Options
--- 18507,18542 ----
       tight memory constraints.  Data that can be modified is not
       affected by this option.
  
!      Note, using this feature reserves a register, usually 'r13', for
       the constant data base address.  This can result in slower and/or
       larger code, especially in complicated functions.
  
       The actual register chosen to hold the constant data base address
!      depends upon whether the '-msmall-data-limit' and/or the
!      '-mint-register' command-line options are enabled.  Starting with
!      register 'r13' and proceeding downwards, registers are allocated
!      first to satisfy the requirements of '-mint-register', then '-mpid'
!      and finally '-msmall-data-limit'.  Thus it is possible for the
!      small data area register to be 'r8' if both '-mint-register=4' and
!      '-mpid' are specified on the command line.
  
       By default this feature is not enabled.  The default can be
!      restored via the '-mno-pid' command-line option.
  
! '-mno-warn-multiple-fast-interrupts'
! '-mwarn-multiple-fast-interrupts'
       Prevents GCC from issuing a warning message if it finds more than
       one fast interrupt handler when it is compiling a file.  The
!      default is to issue a warning for each extra fast interrupt handler
!      found, as the RX only supports one such interrupt.
  
!  _Note:_ The generic GCC command-line option '-ffixed-REG' has special
! significance to the RX port when used with the 'interrupt' function
! attribute.  This attribute indicates a function intended to process fast
! interrupts.  GCC ensures that it only uses the registers 'r10', 'r11',
! 'r12' and/or 'r13' and only provided that the normal use of the
! corresponding registers have been restricted via the '-ffixed-REG' or
! '-mint-register' command-line options.
  
  
  File: gcc.info,  Node: S/390 and zSeries Options,  Next: Score Options,  Prev: RX Options,  Up: Submodel Options
*************** File: gcc.info,  Node: S/390 and zSeries
*** 18636,18819 ****
  3.17.39 S/390 and zSeries Options
  ---------------------------------
  
! These are the `-m' options defined for the S/390 and zSeries
  architecture.
  
! `-mhard-float'
! `-msoft-float'
       Use (do not use) the hardware floating-point instructions and
!      registers for floating-point operations.  When `-msoft-float' is
!      specified, functions in `libgcc.a' are used to perform
!      floating-point operations.  When `-mhard-float' is specified, the
       compiler generates IEEE floating-point instructions.  This is the
       default.
  
! `-mhard-dfp'
! `-mno-hard-dfp'
       Use (do not use) the hardware decimal-floating-point instructions
!      for decimal-floating-point operations.  When `-mno-hard-dfp' is
!      specified, functions in `libgcc.a' are used to perform
!      decimal-floating-point operations.  When `-mhard-dfp' is
!      specified, the compiler generates decimal-floating-point hardware
!      instructions.  This is the default for `-march=z9-ec' or higher.
  
! `-mlong-double-64'
! `-mlong-double-128'
!      These switches control the size of `long double' type. A size of
!      64 bits makes the `long double' type equivalent to the `double'
!      type. This is the default.
  
! `-mbackchain'
! `-mno-backchain'
!      Store (do not store) the address of the caller's frame as
!      backchain pointer into the callee's stack frame.  A backchain may
!      be needed to allow debugging using tools that do not understand
!      DWARF 2 call frame information.  When `-mno-packed-stack' is in
!      effect, the backchain pointer is stored at the bottom of the stack
!      frame; when `-mpacked-stack' is in effect, the backchain is placed
!      into the topmost word of the 96/160 byte register save area.
  
!      In general, code compiled with `-mbackchain' is call-compatible
!      with code compiled with `-mmo-backchain'; however, use of the
       backchain for debugging purposes usually requires that the whole
!      binary is built with `-mbackchain'.  Note that the combination of
!      `-mbackchain', `-mpacked-stack' and `-mhard-float' is not
!      supported.  In order to build a linux kernel use `-msoft-float'.
  
       The default is to not maintain the backchain.
  
! `-mpacked-stack'
! `-mno-packed-stack'
!      Use (do not use) the packed stack layout.  When
!      `-mno-packed-stack' is specified, the compiler uses the all fields
!      of the 96/160 byte register save area only for their default
!      purpose; unused fields still take up stack space.  When
!      `-mpacked-stack' is specified, register save slots are densely
!      packed at the top of the register save area; unused space is
!      reused for other purposes, allowing for more efficient use of the
!      available stack space.  However, when `-mbackchain' is also in
!      effect, the topmost word of the save area is always used to store
!      the backchain, and the return address register is always saved two
!      words below the backchain.
  
       As long as the stack frame backchain is not used, code generated
!      with `-mpacked-stack' is call-compatible with code generated with
!      `-mno-packed-stack'.  Note that some non-FSF releases of GCC 2.95
       for S/390 or zSeries generated code that uses the stack frame
       backchain at run time, not just for debugging purposes.  Such code
!      is not call-compatible with code compiled with `-mpacked-stack'.
!      Also, note that the combination of `-mbackchain', `-mpacked-stack'
!      and `-mhard-float' is not supported.  In order to build a linux
!      kernel use `-msoft-float'.
  
       The default is to not use the packed stack layout.
  
! `-msmall-exec'
! `-mno-small-exec'
!      Generate (or do not generate) code using the `bras' instruction to
       do subroutine calls.  This only works reliably if the total
       executable size does not exceed 64k.  The default is to use the
!      `basr' instruction instead, which does not have this limitation.
  
! `-m64'
! `-m31'
!      When `-m31' is specified, generate code compliant to the GNU/Linux
!      for S/390 ABI.  When `-m64' is specified, generate code compliant
!      to the GNU/Linux for zSeries ABI.  This allows GCC in particular
!      to generate 64-bit instructions.  For the `s390' targets, the
!      default is `-m31', while the `s390x' targets default to `-m64'.
  
! `-mzarch'
! `-mesa'
!      When `-mzarch' is specified, generate code using the instructions
!      available on z/Architecture.  When `-mesa' is specified, generate
       code using the instructions available on ESA/390.  Note that
!      `-mesa' is not possible with `-m64'.  When generating code
!      compliant to the GNU/Linux for S/390 ABI, the default is `-mesa'.
       When generating code compliant to the GNU/Linux for zSeries ABI,
!      the default is `-mzarch'.
  
! `-mmvcle'
! `-mno-mvcle'
!      Generate (or do not generate) code using the `mvcle' instruction
!      to perform block moves.  When `-mno-mvcle' is specified, use a
!      `mvc' loop instead.  This is the default unless optimizing for
!      size.
  
! `-mdebug'
! `-mno-debug'
       Print (or do not print) additional debug information when
       compiling.  The default is to not print debug information.
  
! `-march=CPU-TYPE'
       Generate code that runs on CPU-TYPE, which is the name of a system
       representing a certain processor type.  Possible values for
!      CPU-TYPE are `g5', `g6', `z900', `z990', `z9-109', `z9-ec', `z10',
!      `z196', `zEC12', and `z13'.  When generating code using the
       instructions available on z/Architecture, the default is
!      `-march=z900'.  Otherwise, the default is `-march=g5'.
  
! `-mtune=CPU-TYPE'
       Tune to CPU-TYPE everything applicable about the generated code,
!      except for the ABI and the set of available instructions.  The
!      list of CPU-TYPE values is the same as for `-march'.  The default
!      is the value used for `-march'.
  
! `-mtpf-trace'
! `-mno-tpf-trace'
       Generate code that adds (does not add) in TPF OS specific branches
       to trace routines in the operating system.  This option is off by
       default, even when compiling for the TPF OS.
  
! `-mfused-madd'
! `-mno-fused-madd'
       Generate code that uses (does not use) the floating-point multiply
       and accumulate instructions.  These instructions are generated by
       default if hardware floating point is used.
  
! `-mwarn-framesize=FRAMESIZE'
       Emit a warning if the current function exceeds the given frame
!      size.  Because this is a compile-time check it doesn't need to be
!      a real problem when the program runs.  It is intended to identify
       functions that most probably cause a stack overflow.  It is useful
!      to be used in an environment with limited stack size e.g. the
!      linux kernel.
  
! `-mwarn-dynamicstack'
!      Emit a warning if the function calls `alloca' or uses
       dynamically-sized arrays.  This is generally a bad idea with a
       limited stack size.
  
! `-mstack-guard=STACK-GUARD'
! `-mstack-size=STACK-SIZE'
       If these options are provided the S/390 back end emits additional
       instructions in the function prologue that trigger a trap if the
!      stack size is STACK-GUARD bytes above the STACK-SIZE (remember
!      that the stack on S/390 grows downward).  If the STACK-GUARD
!      option is omitted the smallest power of 2 larger than the frame
!      size of the compiled function is chosen.  These options are
!      intended to be used to help debugging stack overflow problems.
!      The additionally emitted code causes only little overhead and
!      hence can also be used in production-like systems without greater
!      performance degradation.  The given values have to be exact powers
!      of 2 and STACK-SIZE has to be greater than STACK-GUARD without
!      exceeding 64k.  In order to be efficient the extra code makes the
!      assumption that the stack starts at an address aligned to the
!      value given by STACK-SIZE.  The STACK-GUARD option can only be
!      used in conjunction with STACK-SIZE.
  
! `-mhotpatch=PRE-HALFWORDS,POST-HALFWORDS'
       If the hotpatch option is enabled, a "hot-patching" function
       prologue is generated for all functions in the compilation unit.
       The funtion label is prepended with the given number of two-byte
       NOP instructions (PRE-HALFWORDS, maximum 1000000).  After the
!      label, 2 * POST-HALFWORDS bytes are appended, using the largest
!      NOP like instructions the architecture allows (maximum 1000000).
  
       If both arguments are zero, hotpatching is disabled.
  
       This option can be overridden for individual functions with the
!      `hotpatch' attribute.
  
  
  File: gcc.info,  Node: Score Options,  Next: SH Options,  Prev: S/390 and zSeries Options,  Up: Submodel Options
--- 18544,18724 ----
  3.17.39 S/390 and zSeries Options
  ---------------------------------
  
! These are the '-m' options defined for the S/390 and zSeries
  architecture.
  
! '-mhard-float'
! '-msoft-float'
       Use (do not use) the hardware floating-point instructions and
!      registers for floating-point operations.  When '-msoft-float' is
!      specified, functions in 'libgcc.a' are used to perform
!      floating-point operations.  When '-mhard-float' is specified, the
       compiler generates IEEE floating-point instructions.  This is the
       default.
  
! '-mhard-dfp'
! '-mno-hard-dfp'
       Use (do not use) the hardware decimal-floating-point instructions
!      for decimal-floating-point operations.  When '-mno-hard-dfp' is
!      specified, functions in 'libgcc.a' are used to perform
!      decimal-floating-point operations.  When '-mhard-dfp' is specified,
!      the compiler generates decimal-floating-point hardware
!      instructions.  This is the default for '-march=z9-ec' or higher.
  
! '-mlong-double-64'
! '-mlong-double-128'
!      These switches control the size of 'long double' type.  A size of
!      64 bits makes the 'long double' type equivalent to the 'double'
!      type.  This is the default.
  
! '-mbackchain'
! '-mno-backchain'
!      Store (do not store) the address of the caller's frame as backchain
!      pointer into the callee's stack frame.  A backchain may be needed
!      to allow debugging using tools that do not understand DWARF 2 call
!      frame information.  When '-mno-packed-stack' is in effect, the
!      backchain pointer is stored at the bottom of the stack frame; when
!      '-mpacked-stack' is in effect, the backchain is placed into the
!      topmost word of the 96/160 byte register save area.
  
!      In general, code compiled with '-mbackchain' is call-compatible
!      with code compiled with '-mmo-backchain'; however, use of the
       backchain for debugging purposes usually requires that the whole
!      binary is built with '-mbackchain'.  Note that the combination of
!      '-mbackchain', '-mpacked-stack' and '-mhard-float' is not
!      supported.  In order to build a linux kernel use '-msoft-float'.
  
       The default is to not maintain the backchain.
  
! '-mpacked-stack'
! '-mno-packed-stack'
!      Use (do not use) the packed stack layout.  When '-mno-packed-stack'
!      is specified, the compiler uses the all fields of the 96/160 byte
!      register save area only for their default purpose; unused fields
!      still take up stack space.  When '-mpacked-stack' is specified,
!      register save slots are densely packed at the top of the register
!      save area; unused space is reused for other purposes, allowing for
!      more efficient use of the available stack space.  However, when
!      '-mbackchain' is also in effect, the topmost word of the save area
!      is always used to store the backchain, and the return address
!      register is always saved two words below the backchain.
  
       As long as the stack frame backchain is not used, code generated
!      with '-mpacked-stack' is call-compatible with code generated with
!      '-mno-packed-stack'.  Note that some non-FSF releases of GCC 2.95
       for S/390 or zSeries generated code that uses the stack frame
       backchain at run time, not just for debugging purposes.  Such code
!      is not call-compatible with code compiled with '-mpacked-stack'.
!      Also, note that the combination of '-mbackchain', '-mpacked-stack'
!      and '-mhard-float' is not supported.  In order to build a linux
!      kernel use '-msoft-float'.
  
       The default is to not use the packed stack layout.
  
! '-msmall-exec'
! '-mno-small-exec'
!      Generate (or do not generate) code using the 'bras' instruction to
       do subroutine calls.  This only works reliably if the total
       executable size does not exceed 64k.  The default is to use the
!      'basr' instruction instead, which does not have this limitation.
  
! '-m64'
! '-m31'
!      When '-m31' is specified, generate code compliant to the GNU/Linux
!      for S/390 ABI.  When '-m64' is specified, generate code compliant
!      to the GNU/Linux for zSeries ABI.  This allows GCC in particular to
!      generate 64-bit instructions.  For the 's390' targets, the default
!      is '-m31', while the 's390x' targets default to '-m64'.
  
! '-mzarch'
! '-mesa'
!      When '-mzarch' is specified, generate code using the instructions
!      available on z/Architecture.  When '-mesa' is specified, generate
       code using the instructions available on ESA/390.  Note that
!      '-mesa' is not possible with '-m64'.  When generating code
!      compliant to the GNU/Linux for S/390 ABI, the default is '-mesa'.
       When generating code compliant to the GNU/Linux for zSeries ABI,
!      the default is '-mzarch'.
  
! '-mmvcle'
! '-mno-mvcle'
!      Generate (or do not generate) code using the 'mvcle' instruction to
!      perform block moves.  When '-mno-mvcle' is specified, use a 'mvc'
!      loop instead.  This is the default unless optimizing for size.
  
! '-mdebug'
! '-mno-debug'
       Print (or do not print) additional debug information when
       compiling.  The default is to not print debug information.
  
! '-march=CPU-TYPE'
       Generate code that runs on CPU-TYPE, which is the name of a system
       representing a certain processor type.  Possible values for
!      CPU-TYPE are 'g5', 'g6', 'z900', 'z990', 'z9-109', 'z9-ec', 'z10',
!      'z196', 'zEC12', and 'z13'.  When generating code using the
       instructions available on z/Architecture, the default is
!      '-march=z900'.  Otherwise, the default is '-march=g5'.
  
! '-mtune=CPU-TYPE'
       Tune to CPU-TYPE everything applicable about the generated code,
!      except for the ABI and the set of available instructions.  The list
!      of CPU-TYPE values is the same as for '-march'.  The default is the
!      value used for '-march'.
  
! '-mtpf-trace'
! '-mno-tpf-trace'
       Generate code that adds (does not add) in TPF OS specific branches
       to trace routines in the operating system.  This option is off by
       default, even when compiling for the TPF OS.
  
! '-mfused-madd'
! '-mno-fused-madd'
       Generate code that uses (does not use) the floating-point multiply
       and accumulate instructions.  These instructions are generated by
       default if hardware floating point is used.
  
! '-mwarn-framesize=FRAMESIZE'
       Emit a warning if the current function exceeds the given frame
!      size.  Because this is a compile-time check it doesn't need to be a
!      real problem when the program runs.  It is intended to identify
       functions that most probably cause a stack overflow.  It is useful
!      to be used in an environment with limited stack size e.g. the linux
!      kernel.
  
! '-mwarn-dynamicstack'
!      Emit a warning if the function calls 'alloca' or uses
       dynamically-sized arrays.  This is generally a bad idea with a
       limited stack size.
  
! '-mstack-guard=STACK-GUARD'
! '-mstack-size=STACK-SIZE'
       If these options are provided the S/390 back end emits additional
       instructions in the function prologue that trigger a trap if the
!      stack size is STACK-GUARD bytes above the STACK-SIZE (remember that
!      the stack on S/390 grows downward).  If the STACK-GUARD option is
!      omitted the smallest power of 2 larger than the frame size of the
!      compiled function is chosen.  These options are intended to be used
!      to help debugging stack overflow problems.  The additionally
!      emitted code causes only little overhead and hence can also be used
!      in production-like systems without greater performance degradation.
!      The given values have to be exact powers of 2 and STACK-SIZE has to
!      be greater than STACK-GUARD without exceeding 64k.  In order to be
!      efficient the extra code makes the assumption that the stack starts
!      at an address aligned to the value given by STACK-SIZE.  The
!      STACK-GUARD option can only be used in conjunction with STACK-SIZE.
  
! '-mhotpatch=PRE-HALFWORDS,POST-HALFWORDS'
       If the hotpatch option is enabled, a "hot-patching" function
       prologue is generated for all functions in the compilation unit.
       The funtion label is prepended with the given number of two-byte
       NOP instructions (PRE-HALFWORDS, maximum 1000000).  After the
!      label, 2 * POST-HALFWORDS bytes are appended, using the largest NOP
!      like instructions the architecture allows (maximum 1000000).
  
       If both arguments are zero, hotpatching is disabled.
  
       This option can be overridden for individual functions with the
!      'hotpatch' attribute.
  
  
  File: gcc.info,  Node: Score Options,  Next: SH Options,  Prev: S/390 and zSeries Options,  Up: Submodel Options
*************** File: gcc.info,  Node: Score Options,  N
*** 18823,18854 ****
  
  These options are defined for Score implementations:
  
! `-meb'
       Compile code for big-endian mode.  This is the default.
  
! `-mel'
       Compile code for little-endian mode.
  
! `-mnhwloop'
!      Disable generation of `bcnz' instructions.
  
! `-muls'
       Enable generation of unaligned load and store instructions.
  
! `-mmac'
!      Enable the use of multiply-accumulate instructions. Disabled by
       default.
  
! `-mscore5'
       Specify the SCORE5 as the target architecture.
  
! `-mscore5u'
       Specify the SCORE5U of the target architecture.
  
! `-mscore7'
!      Specify the SCORE7 as the target architecture. This is the default.
  
! `-mscore7d'
       Specify the SCORE7D as the target architecture.
  
  
--- 18728,18760 ----
  
  These options are defined for Score implementations:
  
! '-meb'
       Compile code for big-endian mode.  This is the default.
  
! '-mel'
       Compile code for little-endian mode.
  
! '-mnhwloop'
!      Disable generation of 'bcnz' instructions.
  
! '-muls'
       Enable generation of unaligned load and store instructions.
  
! '-mmac'
!      Enable the use of multiply-accumulate instructions.  Disabled by
       default.
  
! '-mscore5'
       Specify the SCORE5 as the target architecture.
  
! '-mscore5u'
       Specify the SCORE5U of the target architecture.
  
! '-mscore7'
!      Specify the SCORE7 as the target architecture.  This is the
!      default.
  
! '-mscore7d'
       Specify the SCORE7D as the target architecture.
  
  
*************** File: gcc.info,  Node: SH Options,  Next
*** 18857,19114 ****
  3.17.41 SH Options
  ------------------
  
! These `-m' options are defined for the SH implementations:
  
! `-m1'
       Generate code for the SH1.
  
! `-m2'
       Generate code for the SH2.
  
! `-m2e'
       Generate code for the SH2e.
  
! `-m2a-nofpu'
!      Generate code for the SH2a without FPU, or for a SH2a-FPU in such
!      a way that the floating-point unit is not used.
  
! `-m2a-single-only'
       Generate code for the SH2a-FPU, in such a way that no
       double-precision floating-point operations are used.
  
! `-m2a-single'
       Generate code for the SH2a-FPU assuming the floating-point unit is
       in single-precision mode by default.
  
! `-m2a'
       Generate code for the SH2a-FPU assuming the floating-point unit is
       in double-precision mode by default.
  
! `-m3'
       Generate code for the SH3.
  
! `-m3e'
       Generate code for the SH3e.
  
! `-m4-nofpu'
       Generate code for the SH4 without a floating-point unit.
  
! `-m4-single-only'
       Generate code for the SH4 with a floating-point unit that only
       supports single-precision arithmetic.
  
! `-m4-single'
       Generate code for the SH4 assuming the floating-point unit is in
       single-precision mode by default.
  
! `-m4'
       Generate code for the SH4.
  
! `-m4-100'
       Generate code for SH4-100.
  
! `-m4-100-nofpu'
       Generate code for SH4-100 in such a way that the floating-point
       unit is not used.
  
! `-m4-100-single'
       Generate code for SH4-100 assuming the floating-point unit is in
       single-precision mode by default.
  
! `-m4-100-single-only'
       Generate code for SH4-100 in such a way that no double-precision
       floating-point operations are used.
  
! `-m4-200'
       Generate code for SH4-200.
  
! `-m4-200-nofpu'
       Generate code for SH4-200 without in such a way that the
       floating-point unit is not used.
  
! `-m4-200-single'
       Generate code for SH4-200 assuming the floating-point unit is in
       single-precision mode by default.
  
! `-m4-200-single-only'
       Generate code for SH4-200 in such a way that no double-precision
       floating-point operations are used.
  
! `-m4-300'
       Generate code for SH4-300.
  
! `-m4-300-nofpu'
       Generate code for SH4-300 without in such a way that the
       floating-point unit is not used.
  
! `-m4-300-single'
       Generate code for SH4-300 in such a way that no double-precision
       floating-point operations are used.
  
! `-m4-300-single-only'
       Generate code for SH4-300 in such a way that no double-precision
       floating-point operations are used.
  
! `-m4-340'
       Generate code for SH4-340 (no MMU, no FPU).
  
! `-m4-500'
!      Generate code for SH4-500 (no FPU).  Passes `-isa=sh4-nofpu' to the
       assembler.
  
! `-m4a-nofpu'
       Generate code for the SH4al-dsp, or for a SH4a in such a way that
       the floating-point unit is not used.
  
! `-m4a-single-only'
       Generate code for the SH4a, in such a way that no double-precision
       floating-point operations are used.
  
! `-m4a-single'
       Generate code for the SH4a assuming the floating-point unit is in
       single-precision mode by default.
  
! `-m4a'
       Generate code for the SH4a.
  
! `-m4al'
!      Same as `-m4a-nofpu', except that it implicitly passes `-dsp' to
       the assembler.  GCC doesn't generate any DSP instructions at the
       moment.
  
! `-m5-32media'
       Generate 32-bit code for SHmedia.
  
! `-m5-32media-nofpu'
       Generate 32-bit code for SHmedia in such a way that the
       floating-point unit is not used.
  
! `-m5-64media'
       Generate 64-bit code for SHmedia.
  
! `-m5-64media-nofpu'
       Generate 64-bit code for SHmedia in such a way that the
       floating-point unit is not used.
  
! `-m5-compact'
       Generate code for SHcompact.
  
! `-m5-compact-nofpu'
       Generate code for SHcompact in such a way that the floating-point
       unit is not used.
  
! `-mb'
       Compile code for the processor in big-endian mode.
  
! `-ml'
       Compile code for the processor in little-endian mode.
  
! `-mdalign'
       Align doubles at 64-bit boundaries.  Note that this changes the
       calling conventions, and thus some functions from the standard C
!      library do not work unless you recompile it first with `-mdalign'.
  
! `-mrelax'
       Shorten some address references at link time, when possible; uses
!      the linker option `-relax'.
  
! `-mbigtable'
!      Use 32-bit offsets in `switch' tables.  The default is to use
       16-bit offsets.
  
! `-mbitops'
       Enable the use of bit manipulation instructions on SH2A.
  
! `-mfmovd'
!      Enable the use of the instruction `fmovd'.  Check `-mdalign' for
       alignment constraints.
  
! `-mrenesas'
       Comply with the calling conventions defined by Renesas.
  
! `-mno-renesas'
       Comply with the calling conventions defined for GCC before the
!      Renesas conventions were available.  This option is the default
!      for all targets of the SH toolchain.
  
! `-mnomacsave'
!      Mark the `MAC' register as call-clobbered, even if `-mrenesas' is
       given.
  
! `-mieee'
! `-mno-ieee'
       Control the IEEE compliance of floating-point comparisons, which
       affects the handling of cases where the result of a comparison is
!      unordered.  By default `-mieee' is implicitly enabled.  If
!      `-ffinite-math-only' is enabled `-mno-ieee' is implicitly set,
!      which results in faster floating-point greater-equal and
!      less-equal comparisons.  The implcit settings can be overridden by
!      specifying either `-mieee' or `-mno-ieee'.
  
! `-minline-ic_invalidate'
       Inline code to invalidate instruction cache entries after setting
       up nested function trampolines.  This option has no effect if
!      `-musermode' is in effect and the selected code generation option
!      (e.g. `-m4') does not allow the use of the `icbi' instruction.  If
       the selected code generation option does not allow the use of the
!      `icbi' instruction, and `-musermode' is not in effect, the inlined
       code manipulates the instruction cache address array directly with
       an associative write.  This not only requires privileged mode at
       run time, but it also fails if the cache line had been mapped via
       the TLB and has become unmapped.
  
! `-misize'
       Dump instruction size and location in the assembly code.
  
! `-mpadstruct'
       This option is deprecated.  It pads structures to multiple of 4
       bytes, which is incompatible with the SH ABI.
  
! `-matomic-model=MODEL'
       Sets the model of atomic operations and additional parameters as a
!      comma separated list.  For details on the atomic built-in
!      functions see *note __atomic Builtins::.  The following models and
!      parameters are supported:
  
!     `none'
            Disable compiler generated atomic sequences and emit library
            calls for atomic operations.  This is the default if the
!           target is not `sh*-*-linux*'.
  
!     `soft-gusa'
            Generate GNU/Linux compatible gUSA software atomic sequences
            for the atomic built-in functions.  The generated atomic
            sequences require additional support from the
            interrupt/exception handling code of the system and are only
            suitable for SH3* and SH4* single-core systems.  This option
!           is enabled by default when the target is `sh*-*-linux*' and
            SH3* or SH4*.  When the target is SH4A, this option also
!           partially utilizes the hardware atomic instructions `movli.l'
!           and `movco.l' to create more efficient code, unless `strict'
            is specified.
  
!     `soft-tcb'
            Generate software atomic sequences that use a variable in the
            thread control block.  This is a variation of the gUSA
            sequences which can also be used on SH1* and SH2* targets.
!           The generated atomic sequences require additional support
!           from the interrupt/exception handling code of the system and
!           are only suitable for single-core systems.  When using this
!           model, the `gbr-offset=' parameter has to be specified as
!           well.
  
!     `soft-imask'
            Generate software atomic sequences that temporarily disable
!           interrupts by setting `SR.IMASK = 1111'.  This model works
            only when the program runs in privileged mode and is only
!           suitable for single-core systems.  Additional support from
!           the interrupt/exception handling code of the system is not
            required.  This model is enabled by default when the target is
!           `sh*-*-linux*' and SH1* or SH2*.
  
!     `hard-llcs'
!           Generate hardware atomic sequences using the `movli.l' and
!           `movco.l' instructions only.  This is only available on SH4A
            and is suitable for multi-core systems.  Since the hardware
            instructions support only 32 bit atomic variables access to 8
            or 16 bit variables is emulated with 32 bit accesses.  Code
--- 18763,19019 ----
  3.17.41 SH Options
  ------------------
  
! These '-m' options are defined for the SH implementations:
  
! '-m1'
       Generate code for the SH1.
  
! '-m2'
       Generate code for the SH2.
  
! '-m2e'
       Generate code for the SH2e.
  
! '-m2a-nofpu'
!      Generate code for the SH2a without FPU, or for a SH2a-FPU in such a
!      way that the floating-point unit is not used.
  
! '-m2a-single-only'
       Generate code for the SH2a-FPU, in such a way that no
       double-precision floating-point operations are used.
  
! '-m2a-single'
       Generate code for the SH2a-FPU assuming the floating-point unit is
       in single-precision mode by default.
  
! '-m2a'
       Generate code for the SH2a-FPU assuming the floating-point unit is
       in double-precision mode by default.
  
! '-m3'
       Generate code for the SH3.
  
! '-m3e'
       Generate code for the SH3e.
  
! '-m4-nofpu'
       Generate code for the SH4 without a floating-point unit.
  
! '-m4-single-only'
       Generate code for the SH4 with a floating-point unit that only
       supports single-precision arithmetic.
  
! '-m4-single'
       Generate code for the SH4 assuming the floating-point unit is in
       single-precision mode by default.
  
! '-m4'
       Generate code for the SH4.
  
! '-m4-100'
       Generate code for SH4-100.
  
! '-m4-100-nofpu'
       Generate code for SH4-100 in such a way that the floating-point
       unit is not used.
  
! '-m4-100-single'
       Generate code for SH4-100 assuming the floating-point unit is in
       single-precision mode by default.
  
! '-m4-100-single-only'
       Generate code for SH4-100 in such a way that no double-precision
       floating-point operations are used.
  
! '-m4-200'
       Generate code for SH4-200.
  
! '-m4-200-nofpu'
       Generate code for SH4-200 without in such a way that the
       floating-point unit is not used.
  
! '-m4-200-single'
       Generate code for SH4-200 assuming the floating-point unit is in
       single-precision mode by default.
  
! '-m4-200-single-only'
       Generate code for SH4-200 in such a way that no double-precision
       floating-point operations are used.
  
! '-m4-300'
       Generate code for SH4-300.
  
! '-m4-300-nofpu'
       Generate code for SH4-300 without in such a way that the
       floating-point unit is not used.
  
! '-m4-300-single'
       Generate code for SH4-300 in such a way that no double-precision
       floating-point operations are used.
  
! '-m4-300-single-only'
       Generate code for SH4-300 in such a way that no double-precision
       floating-point operations are used.
  
! '-m4-340'
       Generate code for SH4-340 (no MMU, no FPU).
  
! '-m4-500'
!      Generate code for SH4-500 (no FPU). Passes '-isa=sh4-nofpu' to the
       assembler.
  
! '-m4a-nofpu'
       Generate code for the SH4al-dsp, or for a SH4a in such a way that
       the floating-point unit is not used.
  
! '-m4a-single-only'
       Generate code for the SH4a, in such a way that no double-precision
       floating-point operations are used.
  
! '-m4a-single'
       Generate code for the SH4a assuming the floating-point unit is in
       single-precision mode by default.
  
! '-m4a'
       Generate code for the SH4a.
  
! '-m4al'
!      Same as '-m4a-nofpu', except that it implicitly passes '-dsp' to
       the assembler.  GCC doesn't generate any DSP instructions at the
       moment.
  
! '-m5-32media'
       Generate 32-bit code for SHmedia.
  
! '-m5-32media-nofpu'
       Generate 32-bit code for SHmedia in such a way that the
       floating-point unit is not used.
  
! '-m5-64media'
       Generate 64-bit code for SHmedia.
  
! '-m5-64media-nofpu'
       Generate 64-bit code for SHmedia in such a way that the
       floating-point unit is not used.
  
! '-m5-compact'
       Generate code for SHcompact.
  
! '-m5-compact-nofpu'
       Generate code for SHcompact in such a way that the floating-point
       unit is not used.
  
! '-mb'
       Compile code for the processor in big-endian mode.
  
! '-ml'
       Compile code for the processor in little-endian mode.
  
! '-mdalign'
       Align doubles at 64-bit boundaries.  Note that this changes the
       calling conventions, and thus some functions from the standard C
!      library do not work unless you recompile it first with '-mdalign'.
  
! '-mrelax'
       Shorten some address references at link time, when possible; uses
!      the linker option '-relax'.
  
! '-mbigtable'
!      Use 32-bit offsets in 'switch' tables.  The default is to use
       16-bit offsets.
  
! '-mbitops'
       Enable the use of bit manipulation instructions on SH2A.
  
! '-mfmovd'
!      Enable the use of the instruction 'fmovd'.  Check '-mdalign' for
       alignment constraints.
  
! '-mrenesas'
       Comply with the calling conventions defined by Renesas.
  
! '-mno-renesas'
       Comply with the calling conventions defined for GCC before the
!      Renesas conventions were available.  This option is the default for
!      all targets of the SH toolchain.
  
! '-mnomacsave'
!      Mark the 'MAC' register as call-clobbered, even if '-mrenesas' is
       given.
  
! '-mieee'
! '-mno-ieee'
       Control the IEEE compliance of floating-point comparisons, which
       affects the handling of cases where the result of a comparison is
!      unordered.  By default '-mieee' is implicitly enabled.  If
!      '-ffinite-math-only' is enabled '-mno-ieee' is implicitly set,
!      which results in faster floating-point greater-equal and less-equal
!      comparisons.  The implcit settings can be overridden by specifying
!      either '-mieee' or '-mno-ieee'.
  
! '-minline-ic_invalidate'
       Inline code to invalidate instruction cache entries after setting
       up nested function trampolines.  This option has no effect if
!      '-musermode' is in effect and the selected code generation option
!      (e.g.  '-m4') does not allow the use of the 'icbi' instruction.  If
       the selected code generation option does not allow the use of the
!      'icbi' instruction, and '-musermode' is not in effect, the inlined
       code manipulates the instruction cache address array directly with
       an associative write.  This not only requires privileged mode at
       run time, but it also fails if the cache line had been mapped via
       the TLB and has become unmapped.
  
! '-misize'
       Dump instruction size and location in the assembly code.
  
! '-mpadstruct'
       This option is deprecated.  It pads structures to multiple of 4
       bytes, which is incompatible with the SH ABI.
  
! '-matomic-model=MODEL'
       Sets the model of atomic operations and additional parameters as a
!      comma separated list.  For details on the atomic built-in functions
!      see *note __atomic Builtins::.  The following models and parameters
!      are supported:
  
!      'none'
            Disable compiler generated atomic sequences and emit library
            calls for atomic operations.  This is the default if the
!           target is not 'sh*-*-linux*'.
  
!      'soft-gusa'
            Generate GNU/Linux compatible gUSA software atomic sequences
            for the atomic built-in functions.  The generated atomic
            sequences require additional support from the
            interrupt/exception handling code of the system and are only
            suitable for SH3* and SH4* single-core systems.  This option
!           is enabled by default when the target is 'sh*-*-linux*' and
            SH3* or SH4*.  When the target is SH4A, this option also
!           partially utilizes the hardware atomic instructions 'movli.l'
!           and 'movco.l' to create more efficient code, unless 'strict'
            is specified.
  
!      'soft-tcb'
            Generate software atomic sequences that use a variable in the
            thread control block.  This is a variation of the gUSA
            sequences which can also be used on SH1* and SH2* targets.
!           The generated atomic sequences require additional support from
!           the interrupt/exception handling code of the system and are
!           only suitable for single-core systems.  When using this model,
!           the 'gbr-offset=' parameter has to be specified as well.
  
!      'soft-imask'
            Generate software atomic sequences that temporarily disable
!           interrupts by setting 'SR.IMASK = 1111'.  This model works
            only when the program runs in privileged mode and is only
!           suitable for single-core systems.  Additional support from the
!           interrupt/exception handling code of the system is not
            required.  This model is enabled by default when the target is
!           'sh*-*-linux*' and SH1* or SH2*.
  
!      'hard-llcs'
!           Generate hardware atomic sequences using the 'movli.l' and
!           'movco.l' instructions only.  This is only available on SH4A
            and is suitable for multi-core systems.  Since the hardware
            instructions support only 32 bit atomic variables access to 8
            or 16 bit variables is emulated with 32 bit accesses.  Code
*************** These `-m' options are defined for the S
*** 19118,19168 ****
            interrupt/exception handling code of the system is not
            required for this model.
  
!     `gbr-offset='
            This parameter specifies the offset in bytes of the variable
            in the thread control block structure that should be used by
!           the generated atomic sequences when the `soft-tcb' model has
            been selected.  For other models this parameter is ignored.
!           The specified value must be an integer multiple of four and
!           in the range 0-1020.
! 
!     `strict'
!           This parameter prevents mixed usage of multiple atomic
!           models, even if they are compatible, and makes the compiler
!           generate atomic sequences of the specified model only.
  
  
! `-mtas'
!      Generate the `tas.b' opcode for `__atomic_test_and_set'.  Notice
       that depending on the particular hardware and software
       configuration this can degrade overall performance due to the
!      operand cache line flushes that are implied by the `tas.b'
!      instruction.  On multi-core SH4A processors the `tas.b'
!      instruction must be used with caution since it can result in data
!      corruption for certain cache configurations.
  
! `-mprefergot'
       When generating position-independent code, emit function calls
       using the Global Offset Table instead of the Procedure Linkage
       Table.
  
! `-musermode'
! `-mno-usermode'
       Don't allow (allow) the compiler generating privileged mode code.
!      Specifying `-musermode' also implies `-mno-inline-ic_invalidate'
!      if the inlined code would not work in user mode.  `-musermode' is
!      the default when the target is `sh*-*-linux*'.  If the target is
!      SH1* or SH2* `-musermode' has no effect, since there is no user
!      mode.
  
! `-multcost=NUMBER'
       Set the cost to assume for a multiply insn.
  
! `-mdiv=STRATEGY'
       Set the division strategy to be used for integer division
       operations.  For SHmedia STRATEGY can be one of:
  
!     `fp'
            Performs the operation in floating point.  This has a very
            high latency, but needs only a few instructions, so it might
            be a good choice if your code has enough easily-exploitable
--- 19023,19071 ----
            interrupt/exception handling code of the system is not
            required for this model.
  
!      'gbr-offset='
            This parameter specifies the offset in bytes of the variable
            in the thread control block structure that should be used by
!           the generated atomic sequences when the 'soft-tcb' model has
            been selected.  For other models this parameter is ignored.
!           The specified value must be an integer multiple of four and in
!           the range 0-1020.
  
+      'strict'
+           This parameter prevents mixed usage of multiple atomic models,
+           even if they are compatible, and makes the compiler generate
+           atomic sequences of the specified model only.
  
! '-mtas'
!      Generate the 'tas.b' opcode for '__atomic_test_and_set'.  Notice
       that depending on the particular hardware and software
       configuration this can degrade overall performance due to the
!      operand cache line flushes that are implied by the 'tas.b'
!      instruction.  On multi-core SH4A processors the 'tas.b' instruction
!      must be used with caution since it can result in data corruption
!      for certain cache configurations.
  
! '-mprefergot'
       When generating position-independent code, emit function calls
       using the Global Offset Table instead of the Procedure Linkage
       Table.
  
! '-musermode'
! '-mno-usermode'
       Don't allow (allow) the compiler generating privileged mode code.
!      Specifying '-musermode' also implies '-mno-inline-ic_invalidate' if
!      the inlined code would not work in user mode.  '-musermode' is the
!      default when the target is 'sh*-*-linux*'.  If the target is SH1*
!      or SH2* '-musermode' has no effect, since there is no user mode.
  
! '-multcost=NUMBER'
       Set the cost to assume for a multiply insn.
  
! '-mdiv=STRATEGY'
       Set the division strategy to be used for integer division
       operations.  For SHmedia STRATEGY can be one of:
  
!      'fp'
            Performs the operation in floating point.  This has a very
            high latency, but needs only a few instructions, so it might
            be a good choice if your code has enough easily-exploitable
*************** These `-m' options are defined for the S
*** 19170,19207 ****
            instructions together with other instructions.  Division by
            zero causes a floating-point exception.
  
!     `inv'
            Uses integer operations to calculate the inverse of the
            divisor, and then multiplies the dividend with the inverse.
            This strategy allows CSE and hoisting of the inverse
            calculation.  Division by zero calculates an unspecified
            result, but does not trap.
  
!     `inv:minlat'
!           A variant of `inv' where, if no CSE or hoisting opportunities
            have been found, or if the entire operation has been hoisted
            to the same place, the last stages of the inverse calculation
            are intertwined with the final multiply to reduce the overall
            latency, at the expense of using a few more instructions, and
            thus offering fewer scheduling opportunities with other code.
  
!     `call'
            Calls a library function that usually implements the
!           `inv:minlat' strategy.  This gives high code density for
!           `m5-*media-nofpu' compilations.
  
!     `call2'
            Uses a different entry point of the same library function,
            where it assumes that a pointer to a lookup table has already
            been set up, which exposes the pointer load to CSE and code
            hoisting optimizations.
  
!     `inv:call'
!     `inv:call2'
!     `inv:fp'
!           Use the `inv' algorithm for initial code generation, but if
!           the code stays unoptimized, revert to the `call', `call2', or
!           `fp' strategies, respectively.  Note that the
            potentially-trapping side effect of division by zero is
            carried by a separate instruction, so it is possible that all
            the integer instructions are hoisted out, but the marker for
--- 19073,19110 ----
            instructions together with other instructions.  Division by
            zero causes a floating-point exception.
  
!      'inv'
            Uses integer operations to calculate the inverse of the
            divisor, and then multiplies the dividend with the inverse.
            This strategy allows CSE and hoisting of the inverse
            calculation.  Division by zero calculates an unspecified
            result, but does not trap.
  
!      'inv:minlat'
!           A variant of 'inv' where, if no CSE or hoisting opportunities
            have been found, or if the entire operation has been hoisted
            to the same place, the last stages of the inverse calculation
            are intertwined with the final multiply to reduce the overall
            latency, at the expense of using a few more instructions, and
            thus offering fewer scheduling opportunities with other code.
  
!      'call'
            Calls a library function that usually implements the
!           'inv:minlat' strategy.  This gives high code density for
!           'm5-*media-nofpu' compilations.
  
!      'call2'
            Uses a different entry point of the same library function,
            where it assumes that a pointer to a lookup table has already
            been set up, which exposes the pointer load to CSE and code
            hoisting optimizations.
  
!      'inv:call'
!      'inv:call2'
!      'inv:fp'
!           Use the 'inv' algorithm for initial code generation, but if
!           the code stays unoptimized, revert to the 'call', 'call2', or
!           'fp' strategies, respectively.  Note that the
            potentially-trapping side effect of division by zero is
            carried by a separate instruction, so it is possible that all
            the integer instructions are hoisted out, but the marker for
*************** These `-m' options are defined for the S
*** 19209,19276 ****
            floating-point operations or a call is not possible in that
            case.
  
!     `inv20u'
!     `inv20l'
!           Variants of the `inv:minlat' strategy.  In the case that the
            inverse calculation is not separated from the multiply, they
            speed up division where the dividend fits into 20 bits (plus
!           sign where applicable) by inserting a test to skip a number
!           of operations in this case; this test slows down the case of
!           larger dividends.  `inv20u' assumes the case of a such a
!           small dividend to be unlikely, and `inv20l' assumes it to be
!           likely.
! 
  
       For targets other than SHmedia STRATEGY can be one of:
  
!     `call-div1'
            Calls a library function that uses the single-step division
!           instruction `div1' to perform the operation.  Division by
!           zero calculates an unspecified result and does not trap.
!           This is the default except for SH4, SH2A and SHcompact.
  
!     `call-fp'
!           Calls a library function that performs the operation in
!           double precision floating point.  Division by zero causes a
            floating-point exception.  This is the default for SHcompact
!           with FPU.  Specifying this for targets that do not have a
!           double precision FPU defaults to `call-div1'.
  
!     `call-table'
            Calls a library function that uses a lookup table for small
!           divisors and the `div1' instruction with case distinction for
            larger divisors.  Division by zero calculates an unspecified
            result and does not trap.  This is the default for SH4.
            Specifying this for targets that do not have dynamic shift
!           instructions defaults to `call-div1'.
! 
  
       When a division strategy has not been specified the default
       strategy is selected based on the current target.  For SH2A the
!      default strategy is to use the `divs' and `divu' instructions
       instead of library function calls.
  
! `-maccumulate-outgoing-args'
       Reserve space once for outgoing arguments in the function prologue
!      rather than around each call.  Generally beneficial for
!      performance and size.  Also needed for unwinding to avoid changing
!      the stack frame around conditional code.
  
! `-mdivsi3_libfunc=NAME'
       Set the name of the library function used for 32-bit signed
!      division to NAME.  This only affects the name used in the `call'
!      and `inv:call' division strategies, and the compiler still expects
!      the same sets of input/output/clobbered registers as if this
!      option were not present.
  
! `-mfixed-range=REGISTER-RANGE'
       Generate code treating the given register range as fixed registers.
       A fixed register is one that the register allocator can not use.
       This is useful when compiling kernel code.  A register range is
       specified as two registers separated by a dash.  Multiple register
       ranges can be specified separated by a comma.
  
! `-mindexed-addressing'
       Enable the use of the indexed addressing mode for
       SHmedia32/SHcompact.  This is only safe if the hardware and/or OS
       implement 32-bit wrap-around semantics for the indexed addressing
--- 19112,19176 ----
            floating-point operations or a call is not possible in that
            case.
  
!      'inv20u'
!      'inv20l'
!           Variants of the 'inv:minlat' strategy.  In the case that the
            inverse calculation is not separated from the multiply, they
            speed up division where the dividend fits into 20 bits (plus
!           sign where applicable) by inserting a test to skip a number of
!           operations in this case; this test slows down the case of
!           larger dividends.  'inv20u' assumes the case of a such a small
!           dividend to be unlikely, and 'inv20l' assumes it to be likely.
  
       For targets other than SHmedia STRATEGY can be one of:
  
!      'call-div1'
            Calls a library function that uses the single-step division
!           instruction 'div1' to perform the operation.  Division by zero
!           calculates an unspecified result and does not trap.  This is
!           the default except for SH4, SH2A and SHcompact.
  
!      'call-fp'
!           Calls a library function that performs the operation in double
!           precision floating point.  Division by zero causes a
            floating-point exception.  This is the default for SHcompact
!           with FPU. Specifying this for targets that do not have a
!           double precision FPU defaults to 'call-div1'.
  
!      'call-table'
            Calls a library function that uses a lookup table for small
!           divisors and the 'div1' instruction with case distinction for
            larger divisors.  Division by zero calculates an unspecified
            result and does not trap.  This is the default for SH4.
            Specifying this for targets that do not have dynamic shift
!           instructions defaults to 'call-div1'.
  
       When a division strategy has not been specified the default
       strategy is selected based on the current target.  For SH2A the
!      default strategy is to use the 'divs' and 'divu' instructions
       instead of library function calls.
  
! '-maccumulate-outgoing-args'
       Reserve space once for outgoing arguments in the function prologue
!      rather than around each call.  Generally beneficial for performance
!      and size.  Also needed for unwinding to avoid changing the stack
!      frame around conditional code.
  
! '-mdivsi3_libfunc=NAME'
       Set the name of the library function used for 32-bit signed
!      division to NAME.  This only affects the name used in the 'call'
!      and 'inv:call' division strategies, and the compiler still expects
!      the same sets of input/output/clobbered registers as if this option
!      were not present.
  
! '-mfixed-range=REGISTER-RANGE'
       Generate code treating the given register range as fixed registers.
       A fixed register is one that the register allocator can not use.
       This is useful when compiling kernel code.  A register range is
       specified as two registers separated by a dash.  Multiple register
       ranges can be specified separated by a comma.
  
! '-mindexed-addressing'
       Enable the use of the indexed addressing mode for
       SHmedia32/SHcompact.  This is only safe if the hardware and/or OS
       implement 32-bit wrap-around semantics for the indexed addressing
*************** These `-m' options are defined for the S
*** 19278,19415 ****
       with 64-bit MMU, which the OS could use to get 32-bit addressing,
       but since no current hardware implementation supports this or any
       other way to make the indexed addressing mode safe to use in the
!      32-bit ABI, the default is `-mno-indexed-addressing'.
  
! `-mgettrcost=NUMBER'
!      Set the cost assumed for the `gettr' instruction to NUMBER.  The
!      default is 2 if `-mpt-fixed' is in effect, 100 otherwise.
  
! `-mpt-fixed'
!      Assume `pt*' instructions won't trap.  This generally generates
       better-scheduled code, but is unsafe on current hardware.  The
!      current architecture definition says that `ptabs' and `ptrel' trap
       when the target anded with 3 is 3.  This has the unintentional
       effect of making it unsafe to schedule these instructions before a
       branch, or hoist them out of a loop.  For example,
!      `__do_global_ctors', a part of `libgcc' that runs constructors at
       program startup, calls functions in a list which is delimited by
!      -1.  With the `-mpt-fixed' option, the `ptabs' is done before
!      testing against -1.  That means that all the constructors run a
!      bit more quickly, but when the loop comes to the end of the list,
!      the program crashes because `ptabs' loads -1 into a target
!      register.
  
       Since this option is unsafe for any hardware implementing the
!      current architecture specification, the default is
!      `-mno-pt-fixed'.  Unless specified explicitly with `-mgettrcost',
!      `-mno-pt-fixed' also implies `-mgettrcost=100'; this deters
!      register allocation from using target registers for storing
!      ordinary integers.
  
! `-minvalid-symbols'
       Assume symbols might be invalid.  Ordinary function symbols
       generated by the compiler are always valid to load with
!      `movi'/`shori'/`ptabs' or `movi'/`shori'/`ptrel', but with
       assembler and/or linker tricks it is possible to generate symbols
!      that cause `ptabs' or `ptrel' to trap.  This option is only
!      meaningful when `-mno-pt-fixed' is in effect.  It prevents
       cross-basic-block CSE, hoisting and most scheduling of symbol
!      loads.  The default is `-mno-invalid-symbols'.
  
! `-mbranch-cost=NUM'
       Assume NUM to be the cost for a branch instruction.  Higher numbers
       make the compiler try to generate more branch-free code if
       possible.  If not specified the value is selected depending on the
       processor type that is being compiled for.
  
! `-mzdcbranch'
! `-mno-zdcbranch'
       Assume (do not assume) that zero displacement conditional branch
!      instructions `bt' and `bf' are fast.  If `-mzdcbranch' is
       specified, the compiler prefers zero displacement branch code
!      sequences.  This is enabled by default when generating code for
!      SH4 and SH4A.  It can be explicitly disabled by specifying
!      `-mno-zdcbranch'.
  
! `-mcbranch-force-delay-slot'
       Force the usage of delay slots for conditional branches, which
!      stuffs the delay slot with a `nop' if a suitable instruction can't
       be found.  By default this option is disabled.  It can be enabled
       to work around hardware bugs as found in the original SH7055.
  
! `-mfused-madd'
! `-mno-fused-madd'
       Generate code that uses (does not use) the floating-point multiply
       and accumulate instructions.  These instructions are generated by
       default if hardware floating point is used.  The machine-dependent
!      `-mfused-madd' option is now mapped to the machine-independent
!      `-ffp-contract=fast' option, and `-mno-fused-madd' is mapped to
!      `-ffp-contract=off'.
  
! `-mfsca'
! `-mno-fsca'
!      Allow or disallow the compiler to emit the `fsca' instruction for
!      sine and cosine approximations.  The option `-mfsca' must be used
!      in combination with `-funsafe-math-optimizations'.  It is enabled
!      by default when generating code for SH4A.  Using `-mno-fsca'
       disables sine and cosine approximations even if
!      `-funsafe-math-optimizations' is in effect.
  
! `-mfsrra'
! `-mno-fsrra'
!      Allow or disallow the compiler to emit the `fsrra' instruction for
!      reciprocal square root approximations.  The option `-mfsrra' must
!      be used in combination with `-funsafe-math-optimizations' and
!      `-ffinite-math-only'.  It is enabled by default when generating
!      code for SH4A.  Using `-mno-fsrra' disables reciprocal square root
!      approximations even if `-funsafe-math-optimizations' and
!      `-ffinite-math-only' are in effect.
  
! `-mpretend-cmove'
       Prefer zero-displacement conditional branches for conditional move
       instruction patterns.  This can result in faster code on the SH4
       processor.
  
- 
  
  File: gcc.info,  Node: Solaris 2 Options,  Next: SPARC Options,  Prev: SH Options,  Up: Submodel Options
  
  3.17.42 Solaris 2 Options
  -------------------------
  
! These `-m' options are supported on Solaris 2:
  
! `-mclear-hwcap'
!      `-mclear-hwcap' tells the compiler to remove the hardware
       capabilities generated by the Solaris assembler.  This is only
!      necessary when object files use ISA extensions not supported by
!      the current machine, but check at runtime whether or not to use
!      them.
  
! `-mimpure-text'
!      `-mimpure-text', used in addition to `-shared', tells the compiler
!      to not pass `-z text' to the linker when linking a shared object.
       Using this option, you can link position-dependent code into a
       shared object.
  
!      `-mimpure-text' suppresses the "relocations remain against
       allocatable but non-writable sections" linker error message.
       However, the necessary relocations trigger copy-on-write, and the
       shared object is not actually shared across processes.  Instead of
!      using `-mimpure-text', you should compile all source code with
!      `-fpic' or `-fPIC'.
! 
  
   These switches are supported in addition to the above on Solaris 2:
  
! `-pthreads'
       Add support for multithreading using the POSIX threads library.
       This option sets flags for both the preprocessor and linker.  This
!      option does not affect the thread safety of object code produced
!      by the compiler or that of libraries supplied with it.
  
! `-pthread'
!      This is a synonym for `-pthreads'.
  
  
  File: gcc.info,  Node: SPARC Options,  Next: SPU Options,  Prev: Solaris 2 Options,  Up: Submodel Options
--- 19178,19310 ----
       with 64-bit MMU, which the OS could use to get 32-bit addressing,
       but since no current hardware implementation supports this or any
       other way to make the indexed addressing mode safe to use in the
!      32-bit ABI, the default is '-mno-indexed-addressing'.
  
! '-mgettrcost=NUMBER'
!      Set the cost assumed for the 'gettr' instruction to NUMBER.  The
!      default is 2 if '-mpt-fixed' is in effect, 100 otherwise.
  
! '-mpt-fixed'
!      Assume 'pt*' instructions won't trap.  This generally generates
       better-scheduled code, but is unsafe on current hardware.  The
!      current architecture definition says that 'ptabs' and 'ptrel' trap
       when the target anded with 3 is 3.  This has the unintentional
       effect of making it unsafe to schedule these instructions before a
       branch, or hoist them out of a loop.  For example,
!      '__do_global_ctors', a part of 'libgcc' that runs constructors at
       program startup, calls functions in a list which is delimited by
!      -1.  With the '-mpt-fixed' option, the 'ptabs' is done before
!      testing against -1.  That means that all the constructors run a bit
!      more quickly, but when the loop comes to the end of the list, the
!      program crashes because 'ptabs' loads -1 into a target register.
  
       Since this option is unsafe for any hardware implementing the
!      current architecture specification, the default is '-mno-pt-fixed'.
!      Unless specified explicitly with '-mgettrcost', '-mno-pt-fixed'
!      also implies '-mgettrcost=100'; this deters register allocation
!      from using target registers for storing ordinary integers.
  
! '-minvalid-symbols'
       Assume symbols might be invalid.  Ordinary function symbols
       generated by the compiler are always valid to load with
!      'movi'/'shori'/'ptabs' or 'movi'/'shori'/'ptrel', but with
       assembler and/or linker tricks it is possible to generate symbols
!      that cause 'ptabs' or 'ptrel' to trap.  This option is only
!      meaningful when '-mno-pt-fixed' is in effect.  It prevents
       cross-basic-block CSE, hoisting and most scheduling of symbol
!      loads.  The default is '-mno-invalid-symbols'.
  
! '-mbranch-cost=NUM'
       Assume NUM to be the cost for a branch instruction.  Higher numbers
       make the compiler try to generate more branch-free code if
       possible.  If not specified the value is selected depending on the
       processor type that is being compiled for.
  
! '-mzdcbranch'
! '-mno-zdcbranch'
       Assume (do not assume) that zero displacement conditional branch
!      instructions 'bt' and 'bf' are fast.  If '-mzdcbranch' is
       specified, the compiler prefers zero displacement branch code
!      sequences.  This is enabled by default when generating code for SH4
!      and SH4A. It can be explicitly disabled by specifying
!      '-mno-zdcbranch'.
  
! '-mcbranch-force-delay-slot'
       Force the usage of delay slots for conditional branches, which
!      stuffs the delay slot with a 'nop' if a suitable instruction can't
       be found.  By default this option is disabled.  It can be enabled
       to work around hardware bugs as found in the original SH7055.
  
! '-mfused-madd'
! '-mno-fused-madd'
       Generate code that uses (does not use) the floating-point multiply
       and accumulate instructions.  These instructions are generated by
       default if hardware floating point is used.  The machine-dependent
!      '-mfused-madd' option is now mapped to the machine-independent
!      '-ffp-contract=fast' option, and '-mno-fused-madd' is mapped to
!      '-ffp-contract=off'.
  
! '-mfsca'
! '-mno-fsca'
!      Allow or disallow the compiler to emit the 'fsca' instruction for
!      sine and cosine approximations.  The option '-mfsca' must be used
!      in combination with '-funsafe-math-optimizations'.  It is enabled
!      by default when generating code for SH4A. Using '-mno-fsca'
       disables sine and cosine approximations even if
!      '-funsafe-math-optimizations' is in effect.
  
! '-mfsrra'
! '-mno-fsrra'
!      Allow or disallow the compiler to emit the 'fsrra' instruction for
!      reciprocal square root approximations.  The option '-mfsrra' must
!      be used in combination with '-funsafe-math-optimizations' and
!      '-ffinite-math-only'.  It is enabled by default when generating
!      code for SH4A. Using '-mno-fsrra' disables reciprocal square root
!      approximations even if '-funsafe-math-optimizations' and
!      '-ffinite-math-only' are in effect.
  
! '-mpretend-cmove'
       Prefer zero-displacement conditional branches for conditional move
       instruction patterns.  This can result in faster code on the SH4
       processor.
  
  
  File: gcc.info,  Node: Solaris 2 Options,  Next: SPARC Options,  Prev: SH Options,  Up: Submodel Options
  
  3.17.42 Solaris 2 Options
  -------------------------
  
! These '-m' options are supported on Solaris 2:
  
! '-mclear-hwcap'
!      '-mclear-hwcap' tells the compiler to remove the hardware
       capabilities generated by the Solaris assembler.  This is only
!      necessary when object files use ISA extensions not supported by the
!      current machine, but check at runtime whether or not to use them.
  
! '-mimpure-text'
!      '-mimpure-text', used in addition to '-shared', tells the compiler
!      to not pass '-z text' to the linker when linking a shared object.
       Using this option, you can link position-dependent code into a
       shared object.
  
!      '-mimpure-text' suppresses the "relocations remain against
       allocatable but non-writable sections" linker error message.
       However, the necessary relocations trigger copy-on-write, and the
       shared object is not actually shared across processes.  Instead of
!      using '-mimpure-text', you should compile all source code with
!      '-fpic' or '-fPIC'.
  
   These switches are supported in addition to the above on Solaris 2:
  
! '-pthreads'
       Add support for multithreading using the POSIX threads library.
       This option sets flags for both the preprocessor and linker.  This
!      option does not affect the thread safety of object code produced by
!      the compiler or that of libraries supplied with it.
  
! '-pthread'
!      This is a synonym for '-pthreads'.
  
  
  File: gcc.info,  Node: SPARC Options,  Next: SPU Options,  Prev: Solaris 2 Options,  Up: Submodel Options
*************** File: gcc.info,  Node: SPARC Options,  N
*** 19417,19476 ****
  3.17.43 SPARC Options
  ---------------------
  
! These `-m' options are supported on the SPARC:
  
! `-mno-app-regs'
! `-mapp-regs'
!      Specify `-mapp-regs' to generate output using the global registers
       2 through 4, which the SPARC SVR4 ABI reserves for applications.
       Like the global register 1, each global register 2 through 4 is
!      then treated as an allocable register that is clobbered by
!      function calls.  This is the default.
  
       To be fully SVR4 ABI-compliant at the cost of some performance
!      loss, specify `-mno-app-regs'.  You should compile libraries and
       system software with this option.
  
! `-mflat'
! `-mno-flat'
!      With `-mflat', the compiler does not generate save/restore
       instructions and uses a "flat" or single register window model.
       This model is compatible with the regular register window model.
!      The local registers and the input registers (0-5) are still
!      treated as "call-saved" registers and are saved on the stack as
!      needed.
  
!      With `-mno-flat' (the default), the compiler generates save/restore
       instructions (except for leaf functions).  This is the normal
       operating mode.
  
! `-mfpu'
! `-mhard-float'
       Generate output containing floating-point instructions.  This is
       the default.
  
! `-mno-fpu'
! `-msoft-float'
       Generate output containing library calls for floating point.
       *Warning:* the requisite libraries are not available for all SPARC
!      targets.  Normally the facilities of the machine's usual C
!      compiler are used, but this cannot be done directly in
!      cross-compilation.  You must make your own arrangements to provide
!      suitable library functions for cross-compilation.  The embedded
!      targets `sparc-*-aout' and `sparclite-*-*' do provide software
       floating-point support.
  
!      `-msoft-float' changes the calling convention in the output file;
       therefore, it is only useful if you compile _all_ of a program with
!      this option.  In particular, you need to compile `libgcc.a', the
!      library that comes with GCC, with `-msoft-float' in order for this
       to work.
  
! `-mhard-quad-float'
       Generate output containing quad-word (long double) floating-point
       instructions.
  
! `-msoft-quad-float'
       Generate output containing library calls for quad-word (long
       double) floating-point instructions.  The functions called are
       those specified in the SPARC ABI.  This is the default.
--- 19312,19370 ----
  3.17.43 SPARC Options
  ---------------------
  
! These '-m' options are supported on the SPARC:
  
! '-mno-app-regs'
! '-mapp-regs'
!      Specify '-mapp-regs' to generate output using the global registers
       2 through 4, which the SPARC SVR4 ABI reserves for applications.
       Like the global register 1, each global register 2 through 4 is
!      then treated as an allocable register that is clobbered by function
!      calls.  This is the default.
  
       To be fully SVR4 ABI-compliant at the cost of some performance
!      loss, specify '-mno-app-regs'.  You should compile libraries and
       system software with this option.
  
! '-mflat'
! '-mno-flat'
!      With '-mflat', the compiler does not generate save/restore
       instructions and uses a "flat" or single register window model.
       This model is compatible with the regular register window model.
!      The local registers and the input registers (0-5) are still treated
!      as "call-saved" registers and are saved on the stack as needed.
  
!      With '-mno-flat' (the default), the compiler generates save/restore
       instructions (except for leaf functions).  This is the normal
       operating mode.
  
! '-mfpu'
! '-mhard-float'
       Generate output containing floating-point instructions.  This is
       the default.
  
! '-mno-fpu'
! '-msoft-float'
       Generate output containing library calls for floating point.
       *Warning:* the requisite libraries are not available for all SPARC
!      targets.  Normally the facilities of the machine's usual C compiler
!      are used, but this cannot be done directly in cross-compilation.
!      You must make your own arrangements to provide suitable library
!      functions for cross-compilation.  The embedded targets
!      'sparc-*-aout' and 'sparclite-*-*' do provide software
       floating-point support.
  
!      '-msoft-float' changes the calling convention in the output file;
       therefore, it is only useful if you compile _all_ of a program with
!      this option.  In particular, you need to compile 'libgcc.a', the
!      library that comes with GCC, with '-msoft-float' in order for this
       to work.
  
! '-mhard-quad-float'
       Generate output containing quad-word (long double) floating-point
       instructions.
  
! '-msoft-quad-float'
       Generate output containing library calls for quad-word (long
       double) floating-point instructions.  The functions called are
       those specified in the SPARC ABI.  This is the default.
*************** These `-m' options are supported on the
*** 19480,19493 ****
       They all invoke a trap handler for one of these instructions, and
       then the trap handler emulates the effect of the instruction.
       Because of the trap handler overhead, this is much slower than
!      calling the ABI library routines.  Thus the `-msoft-quad-float'
       option is the default.
  
! `-mno-unaligned-doubles'
! `-munaligned-doubles'
       Assume that doubles have 8-byte alignment.  This is the default.
  
!      With `-munaligned-doubles', GCC assumes that doubles have 8-byte
       alignment only if they are contained in another type, or if they
       have an absolute address.  Otherwise, it assumes they have 4-byte
       alignment.  Specifying this option avoids some rare compatibility
--- 19374,19387 ----
       They all invoke a trap handler for one of these instructions, and
       then the trap handler emulates the effect of the instruction.
       Because of the trap handler overhead, this is much slower than
!      calling the ABI library routines.  Thus the '-msoft-quad-float'
       option is the default.
  
! '-mno-unaligned-doubles'
! '-munaligned-doubles'
       Assume that doubles have 8-byte alignment.  This is the default.
  
!      With '-munaligned-doubles', GCC assumes that doubles have 8-byte
       alignment only if they are contained in another type, or if they
       have an absolute address.  Otherwise, it assumes they have 4-byte
       alignment.  Specifying this option avoids some rare compatibility
*************** These `-m' options are supported on the
*** 19495,19731 ****
       default because it results in a performance loss, especially for
       floating-point code.
  
! `-muser-mode'
! `-mno-user-mode'
!      Do not generate code that can only run in supervisor mode.  This
!      is relevant only for the `casa' instruction emitted for the LEON3
       processor.  This is the default.
  
! `-mno-faster-structs'
! `-mfaster-structs'
!      With `-mfaster-structs', the compiler assumes that structures
       should have 8-byte alignment.  This enables the use of pairs of
!      `ldd' and `std' instructions for copies in structure assignment,
!      in place of twice as many `ld' and `st' pairs.  However, the use
!      of this changed alignment directly violates the SPARC ABI.  Thus,
!      it's intended only for use on targets where the developer
!      acknowledges that their resulting code is not directly in line with
!      the rules of the ABI.
  
! `-mcpu=CPU_TYPE'
       Set the instruction set, register set, and instruction scheduling
       parameters for machine type CPU_TYPE.  Supported values for
!      CPU_TYPE are `v7', `cypress', `v8', `supersparc', `hypersparc',
!      `leon', `leon3', `leon3v7', `sparclite', `f930', `f934',
!      `sparclite86x', `sparclet', `tsc701', `v9', `ultrasparc',
!      `ultrasparc3', `niagara', `niagara2', `niagara3' and `niagara4'.
  
       Native Solaris and GNU/Linux toolchains also support the value
!      `native', which selects the best architecture option for the host
!      processor.  `-mcpu=native' has no effect if GCC does not recognize
       the processor.
  
       Default instruction scheduling parameters are used for values that
!      select an architecture and not an implementation.  These are `v7',
!      `v8', `sparclite', `sparclet', `v9'.
  
       Here is a list of each supported architecture and their supported
       implementations.
  
!     v7
            cypress, leon3v7
  
!     v8
            supersparc, hypersparc, leon, leon3
  
!     sparclite
            f930, f934, sparclite86x
  
!     sparclet
            tsc701
  
!     v9
            ultrasparc, ultrasparc3, niagara, niagara2, niagara3, niagara4
  
       By default (unless configured otherwise), GCC generates code for
!      the V7 variant of the SPARC architecture.  With `-mcpu=cypress',
       the compiler additionally optimizes it for the Cypress CY7C602
       chip, as used in the SPARCStation/SPARCServer 3xx series.  This is
       also appropriate for the older SPARCStation 1, 2, IPX etc.
  
!      With `-mcpu=v8', GCC generates code for the V8 variant of the SPARC
       architecture.  The only difference from V7 code is that the
!      compiler emits the integer multiply and integer divide
!      instructions which exist in SPARC-V8 but not in SPARC-V7.  With
!      `-mcpu=supersparc', the compiler additionally optimizes it for the
       SuperSPARC chip, as used in the SPARCStation 10, 1000 and 2000
       series.
  
!      With `-mcpu=sparclite', GCC generates code for the SPARClite
!      variant of the SPARC architecture.  This adds the integer
!      multiply, integer divide step and scan (`ffs') instructions which
!      exist in SPARClite but not in SPARC-V7.  With `-mcpu=f930', the
!      compiler additionally optimizes it for the Fujitsu MB86930 chip,
!      which is the original SPARClite, with no FPU.  With `-mcpu=f934',
!      the compiler additionally optimizes it for the Fujitsu MB86934
!      chip, which is the more recent SPARClite with FPU.
  
!      With `-mcpu=sparclet', GCC generates code for the SPARClet variant
       of the SPARC architecture.  This adds the integer multiply,
!      multiply/accumulate, integer divide step and scan (`ffs')
       instructions which exist in SPARClet but not in SPARC-V7.  With
!      `-mcpu=tsc701', the compiler additionally optimizes it for the
       TEMIC SPARClet chip.
  
!      With `-mcpu=v9', GCC generates code for the V9 variant of the SPARC
       architecture.  This adds 64-bit integer and floating-point move
       instructions, 3 additional floating-point condition code registers
!      and conditional move instructions.  With `-mcpu=ultrasparc', the
       compiler additionally optimizes it for the Sun UltraSPARC I/II/IIi
!      chips.  With `-mcpu=ultrasparc3', the compiler additionally
       optimizes it for the Sun UltraSPARC III/III+/IIIi/IIIi+/IV/IV+
!      chips.  With `-mcpu=niagara', the compiler additionally optimizes
!      it for Sun UltraSPARC T1 chips.  With `-mcpu=niagara2', the
       compiler additionally optimizes it for Sun UltraSPARC T2 chips.
!      With `-mcpu=niagara3', the compiler additionally optimizes it for
!      Sun UltraSPARC T3 chips.  With `-mcpu=niagara4', the compiler
       additionally optimizes it for Sun UltraSPARC T4 chips.
  
! `-mtune=CPU_TYPE'
       Set the instruction scheduling parameters for machine type
       CPU_TYPE, but do not set the instruction set or register set that
!      the option `-mcpu=CPU_TYPE' does.
  
!      The same values for `-mcpu=CPU_TYPE' can be used for
!      `-mtune=CPU_TYPE', but the only useful values are those that
!      select a particular CPU implementation.  Those are `cypress',
!      `supersparc', `hypersparc', `leon', `leon3', `leon3v7', `f930',
!      `f934', `sparclite86x', `tsc701', `ultrasparc', `ultrasparc3',
!      `niagara', `niagara2', `niagara3' and `niagara4'.  With native
!      Solaris and GNU/Linux toolchains, `native' can also be used.
  
! `-mv8plus'
! `-mno-v8plus'
!      With `-mv8plus', GCC generates code for the SPARC-V8+ ABI.  The
       difference from the V8 ABI is that the global and out registers are
       considered 64 bits wide.  This is enabled by default on Solaris in
       32-bit mode for all SPARC-V9 processors.
  
! `-mvis'
! `-mno-vis'
!      With `-mvis', GCC generates code that takes advantage of the
       UltraSPARC Visual Instruction Set extensions.  The default is
!      `-mno-vis'.
  
! `-mvis2'
! `-mno-vis2'
!      With `-mvis2', GCC generates code that takes advantage of version
       2.0 of the UltraSPARC Visual Instruction Set extensions.  The
!      default is `-mvis2' when targeting a cpu that supports such
!      instructions, such as UltraSPARC-III and later.  Setting `-mvis2'
!      also sets `-mvis'.
  
! `-mvis3'
! `-mno-vis3'
!      With `-mvis3', GCC generates code that takes advantage of version
       3.0 of the UltraSPARC Visual Instruction Set extensions.  The
!      default is `-mvis3' when targeting a cpu that supports such
!      instructions, such as niagara-3 and later.  Setting `-mvis3' also
!      sets `-mvis2' and `-mvis'.
  
! `-mcbcond'
! `-mno-cbcond'
!      With `-mcbcond', GCC generates code that takes advantage of
       compare-and-branch instructions, as defined in the Sparc
!      Architecture 2011.  The default is `-mcbcond' when targeting a cpu
       that supports such instructions, such as niagara-4 and later.
  
! `-mpopc'
! `-mno-popc'
!      With `-mpopc', GCC generates code that takes advantage of the
!      UltraSPARC population count instruction.  The default is `-mpopc'
       when targeting a cpu that supports such instructions, such as
       Niagara-2 and later.
  
! `-mfmaf'
! `-mno-fmaf'
!      With `-mfmaf', GCC generates code that takes advantage of the
       UltraSPARC Fused Multiply-Add Floating-point extensions.  The
!      default is `-mfmaf' when targeting a cpu that supports such
       instructions, such as Niagara-3 and later.
  
! `-mfix-at697f'
       Enable the documented workaround for the single erratum of the
       Atmel AT697F processor (which corresponds to erratum #13 of the
       AT697E processor).
  
! `-mfix-ut699'
!      Enable the documented workarounds for the floating-point errata
!      and the data cache nullify errata of the UT699 processor.
  
!  These `-m' options are supported in addition to the above on SPARC-V9
  processors in 64-bit environments:
  
! `-m32'
! `-m64'
       Generate code for a 32-bit or 64-bit environment.  The 32-bit
       environment sets int, long and pointer to 32 bits.  The 64-bit
       environment sets int to 32 bits and long and pointer to 64 bits.
  
! `-mcmodel=WHICH'
       Set the code model to one of
  
!     `medlow'
            The Medium/Low code model: 64-bit addresses, programs must be
            linked in the low 32 bits of memory.  Programs can be
            statically or dynamically linked.
  
!     `medmid'
            The Medium/Middle code model: 64-bit addresses, programs must
            be linked in the low 44 bits of memory, the text and data
            segments must be less than 2GB in size and the data segment
            must be located within 2GB of the text segment.
  
!     `medany'
!           The Medium/Anywhere code model: 64-bit addresses, programs
!           may be linked anywhere in memory, the text and data segments
!           must be less than 2GB in size and the data segment must be
!           located within 2GB of the text segment.
  
!     `embmedany'
            The Medium/Anywhere code model for embedded systems: 64-bit
            addresses, the text and data segments must be less than 2GB in
            size, both starting anywhere in memory (determined at link
!           time).  The global register %g4 points to the base of the
!           data segment.  Programs are statically linked and PIC is not
            supported.
  
! `-mmemory-model=MEM-MODEL'
       Set the memory model in force on the processor to one of
  
!     `default'
            The default memory model for the processor and operating
            system.
  
!     `rmo'
            Relaxed Memory Order
  
!     `pso'
            Partial Store Order
  
!     `tso'
            Total Store Order
  
!     `sc'
            Sequential Consistency
  
!      These memory models are formally defined in Appendix D of the
!      Sparc V9 architecture manual, as set in the processor's
!      `PSTATE.MM' field.
  
! `-mstack-bias'
! `-mno-stack-bias'
!      With `-mstack-bias', GCC assumes that the stack pointer, and frame
       pointer if present, are offset by -2047 which must be added back
       when making stack frame references.  This is the default in 64-bit
       mode.  Otherwise, assume no such offset is present.
--- 19389,19625 ----
       default because it results in a performance loss, especially for
       floating-point code.
  
! '-muser-mode'
! '-mno-user-mode'
!      Do not generate code that can only run in supervisor mode.  This is
!      relevant only for the 'casa' instruction emitted for the LEON3
       processor.  This is the default.
  
! '-mno-faster-structs'
! '-mfaster-structs'
!      With '-mfaster-structs', the compiler assumes that structures
       should have 8-byte alignment.  This enables the use of pairs of
!      'ldd' and 'std' instructions for copies in structure assignment, in
!      place of twice as many 'ld' and 'st' pairs.  However, the use of
!      this changed alignment directly violates the SPARC ABI.  Thus, it's
!      intended only for use on targets where the developer acknowledges
!      that their resulting code is not directly in line with the rules of
!      the ABI.
  
! '-mcpu=CPU_TYPE'
       Set the instruction set, register set, and instruction scheduling
       parameters for machine type CPU_TYPE.  Supported values for
!      CPU_TYPE are 'v7', 'cypress', 'v8', 'supersparc', 'hypersparc',
!      'leon', 'leon3', 'leon3v7', 'sparclite', 'f930', 'f934',
!      'sparclite86x', 'sparclet', 'tsc701', 'v9', 'ultrasparc',
!      'ultrasparc3', 'niagara', 'niagara2', 'niagara3' and 'niagara4'.
  
       Native Solaris and GNU/Linux toolchains also support the value
!      'native', which selects the best architecture option for the host
!      processor.  '-mcpu=native' has no effect if GCC does not recognize
       the processor.
  
       Default instruction scheduling parameters are used for values that
!      select an architecture and not an implementation.  These are 'v7',
!      'v8', 'sparclite', 'sparclet', 'v9'.
  
       Here is a list of each supported architecture and their supported
       implementations.
  
!      v7
            cypress, leon3v7
  
!      v8
            supersparc, hypersparc, leon, leon3
  
!      sparclite
            f930, f934, sparclite86x
  
!      sparclet
            tsc701
  
!      v9
            ultrasparc, ultrasparc3, niagara, niagara2, niagara3, niagara4
  
       By default (unless configured otherwise), GCC generates code for
!      the V7 variant of the SPARC architecture.  With '-mcpu=cypress',
       the compiler additionally optimizes it for the Cypress CY7C602
       chip, as used in the SPARCStation/SPARCServer 3xx series.  This is
       also appropriate for the older SPARCStation 1, 2, IPX etc.
  
!      With '-mcpu=v8', GCC generates code for the V8 variant of the SPARC
       architecture.  The only difference from V7 code is that the
!      compiler emits the integer multiply and integer divide instructions
!      which exist in SPARC-V8 but not in SPARC-V7.  With
!      '-mcpu=supersparc', the compiler additionally optimizes it for the
       SuperSPARC chip, as used in the SPARCStation 10, 1000 and 2000
       series.
  
!      With '-mcpu=sparclite', GCC generates code for the SPARClite
!      variant of the SPARC architecture.  This adds the integer multiply,
!      integer divide step and scan ('ffs') instructions which exist in
!      SPARClite but not in SPARC-V7.  With '-mcpu=f930', the compiler
!      additionally optimizes it for the Fujitsu MB86930 chip, which is
!      the original SPARClite, with no FPU.  With '-mcpu=f934', the
!      compiler additionally optimizes it for the Fujitsu MB86934 chip,
!      which is the more recent SPARClite with FPU.
  
!      With '-mcpu=sparclet', GCC generates code for the SPARClet variant
       of the SPARC architecture.  This adds the integer multiply,
!      multiply/accumulate, integer divide step and scan ('ffs')
       instructions which exist in SPARClet but not in SPARC-V7.  With
!      '-mcpu=tsc701', the compiler additionally optimizes it for the
       TEMIC SPARClet chip.
  
!      With '-mcpu=v9', GCC generates code for the V9 variant of the SPARC
       architecture.  This adds 64-bit integer and floating-point move
       instructions, 3 additional floating-point condition code registers
!      and conditional move instructions.  With '-mcpu=ultrasparc', the
       compiler additionally optimizes it for the Sun UltraSPARC I/II/IIi
!      chips.  With '-mcpu=ultrasparc3', the compiler additionally
       optimizes it for the Sun UltraSPARC III/III+/IIIi/IIIi+/IV/IV+
!      chips.  With '-mcpu=niagara', the compiler additionally optimizes
!      it for Sun UltraSPARC T1 chips.  With '-mcpu=niagara2', the
       compiler additionally optimizes it for Sun UltraSPARC T2 chips.
!      With '-mcpu=niagara3', the compiler additionally optimizes it for
!      Sun UltraSPARC T3 chips.  With '-mcpu=niagara4', the compiler
       additionally optimizes it for Sun UltraSPARC T4 chips.
  
! '-mtune=CPU_TYPE'
       Set the instruction scheduling parameters for machine type
       CPU_TYPE, but do not set the instruction set or register set that
!      the option '-mcpu=CPU_TYPE' does.
  
!      The same values for '-mcpu=CPU_TYPE' can be used for
!      '-mtune=CPU_TYPE', but the only useful values are those that select
!      a particular CPU implementation.  Those are 'cypress',
!      'supersparc', 'hypersparc', 'leon', 'leon3', 'leon3v7', 'f930',
!      'f934', 'sparclite86x', 'tsc701', 'ultrasparc', 'ultrasparc3',
!      'niagara', 'niagara2', 'niagara3' and 'niagara4'.  With native
!      Solaris and GNU/Linux toolchains, 'native' can also be used.
  
! '-mv8plus'
! '-mno-v8plus'
!      With '-mv8plus', GCC generates code for the SPARC-V8+ ABI.  The
       difference from the V8 ABI is that the global and out registers are
       considered 64 bits wide.  This is enabled by default on Solaris in
       32-bit mode for all SPARC-V9 processors.
  
! '-mvis'
! '-mno-vis'
!      With '-mvis', GCC generates code that takes advantage of the
       UltraSPARC Visual Instruction Set extensions.  The default is
!      '-mno-vis'.
  
! '-mvis2'
! '-mno-vis2'
!      With '-mvis2', GCC generates code that takes advantage of version
       2.0 of the UltraSPARC Visual Instruction Set extensions.  The
!      default is '-mvis2' when targeting a cpu that supports such
!      instructions, such as UltraSPARC-III and later.  Setting '-mvis2'
!      also sets '-mvis'.
  
! '-mvis3'
! '-mno-vis3'
!      With '-mvis3', GCC generates code that takes advantage of version
       3.0 of the UltraSPARC Visual Instruction Set extensions.  The
!      default is '-mvis3' when targeting a cpu that supports such
!      instructions, such as niagara-3 and later.  Setting '-mvis3' also
!      sets '-mvis2' and '-mvis'.
  
! '-mcbcond'
! '-mno-cbcond'
!      With '-mcbcond', GCC generates code that takes advantage of
       compare-and-branch instructions, as defined in the Sparc
!      Architecture 2011.  The default is '-mcbcond' when targeting a cpu
       that supports such instructions, such as niagara-4 and later.
  
! '-mpopc'
! '-mno-popc'
!      With '-mpopc', GCC generates code that takes advantage of the
!      UltraSPARC population count instruction.  The default is '-mpopc'
       when targeting a cpu that supports such instructions, such as
       Niagara-2 and later.
  
! '-mfmaf'
! '-mno-fmaf'
!      With '-mfmaf', GCC generates code that takes advantage of the
       UltraSPARC Fused Multiply-Add Floating-point extensions.  The
!      default is '-mfmaf' when targeting a cpu that supports such
       instructions, such as Niagara-3 and later.
  
! '-mfix-at697f'
       Enable the documented workaround for the single erratum of the
       Atmel AT697F processor (which corresponds to erratum #13 of the
       AT697E processor).
  
! '-mfix-ut699'
!      Enable the documented workarounds for the floating-point errata and
!      the data cache nullify errata of the UT699 processor.
  
!  These '-m' options are supported in addition to the above on SPARC-V9
  processors in 64-bit environments:
  
! '-m32'
! '-m64'
       Generate code for a 32-bit or 64-bit environment.  The 32-bit
       environment sets int, long and pointer to 32 bits.  The 64-bit
       environment sets int to 32 bits and long and pointer to 64 bits.
  
! '-mcmodel=WHICH'
       Set the code model to one of
  
!      'medlow'
            The Medium/Low code model: 64-bit addresses, programs must be
            linked in the low 32 bits of memory.  Programs can be
            statically or dynamically linked.
  
!      'medmid'
            The Medium/Middle code model: 64-bit addresses, programs must
            be linked in the low 44 bits of memory, the text and data
            segments must be less than 2GB in size and the data segment
            must be located within 2GB of the text segment.
  
!      'medany'
!           The Medium/Anywhere code model: 64-bit addresses, programs may
!           be linked anywhere in memory, the text and data segments must
!           be less than 2GB in size and the data segment must be located
!           within 2GB of the text segment.
  
!      'embmedany'
            The Medium/Anywhere code model for embedded systems: 64-bit
            addresses, the text and data segments must be less than 2GB in
            size, both starting anywhere in memory (determined at link
!           time).  The global register %g4 points to the base of the data
!           segment.  Programs are statically linked and PIC is not
            supported.
  
! '-mmemory-model=MEM-MODEL'
       Set the memory model in force on the processor to one of
  
!      'default'
            The default memory model for the processor and operating
            system.
  
!      'rmo'
            Relaxed Memory Order
  
!      'pso'
            Partial Store Order
  
!      'tso'
            Total Store Order
  
!      'sc'
            Sequential Consistency
  
!      These memory models are formally defined in Appendix D of the Sparc
!      V9 architecture manual, as set in the processor's 'PSTATE.MM'
!      field.
  
! '-mstack-bias'
! '-mno-stack-bias'
!      With '-mstack-bias', GCC assumes that the stack pointer, and frame
       pointer if present, are offset by -2047 which must be added back
       when making stack frame references.  This is the default in 64-bit
       mode.  Otherwise, assume no such offset is present.
*************** File: gcc.info,  Node: SPU Options,  Nex
*** 19736,19847 ****
  3.17.44 SPU Options
  -------------------
  
! These `-m' options are supported on the SPU:
  
- `-mwarn-reloc'
- `-merror-reloc'
       The loader for SPU does not handle dynamic relocations.  By
       default, GCC gives an error when it generates code that requires a
!      dynamic relocation.  `-mno-error-reloc' disables the error,
!      `-mwarn-reloc' generates a warning instead.
  
- `-msafe-dma'
- `-munsafe-dma'
       Instructions that initiate or test completion of DMA must not be
       reordered with respect to loads and stores of the memory that is
!      being accessed.  With `-munsafe-dma' you must use the `volatile'
       keyword to protect memory accesses, but that can lead to
!      inefficient code in places where the memory is known to not
!      change.  Rather than mark the memory as volatile, you can use
!      `-msafe-dma' to tell the compiler to treat the DMA instructions as
!      potentially affecting all memory.
  
- `-mbranch-hints'
       By default, GCC generates a branch hint instruction to avoid
       pipeline stalls for always-taken or probably-taken branches.  A
       hint is not generated closer than 8 instructions away from its
       branch.  There is little reason to disable them, except for
       debugging purposes, or to make an object a little bit smaller.
  
! `-msmall-mem'
! `-mlarge-mem'
       By default, GCC generates code assuming that addresses are never
!      larger than 18 bits.  With `-mlarge-mem' code is generated that
       assumes a full 32-bit address.
  
! `-mstdmain'
       By default, GCC links against startup code that assumes the
       SPU-style main function interface (which has an unconventional
!      parameter list).  With `-mstdmain', GCC links your program against
!      startup code that assumes a C99-style interface to `main',
!      including a local copy of `argv' strings.
  
! `-mfixed-range=REGISTER-RANGE'
       Generate code treating the given register range as fixed registers.
       A fixed register is one that the register allocator cannot use.
       This is useful when compiling kernel code.  A register range is
       specified as two registers separated by a dash.  Multiple register
       ranges can be specified separated by a comma.
  
! `-mea32'
! `-mea64'
       Compile code assuming that pointers to the PPU address space
!      accessed via the `__ea' named address space qualifier are either
!      32 or 64 bits wide.  The default is 32 bits.  As this is an
       ABI-changing option, all object code in an executable must be
       compiled with the same setting.
  
! `-maddress-space-conversion'
! `-mno-address-space-conversion'
!      Allow/disallow treating the `__ea' address space as superset of
!      the generic address space.  This enables explicit type casts
!      between `__ea' and generic pointer as well as implicit conversions
!      of generic pointers to `__ea' pointers.  The default is to allow
       address space pointer conversions.
  
! `-mcache-size=CACHE-SIZE'
       This option controls the version of libgcc that the compiler links
!      to an executable and selects a software-managed cache for
!      accessing variables in the `__ea' address space with a particular
!      cache size.  Possible options for CACHE-SIZE are `8', `16', `32',
!      `64' and `128'.  The default cache size is 64KB.
  
! `-matomic-updates'
! `-mno-atomic-updates'
       This option controls the version of libgcc that the compiler links
       to an executable and selects whether atomic updates to the
       software-managed cache of PPU-side variables are used.  If you use
       atomic updates, changes to a PPU variable from SPU code using the
!      `__ea' named address space qualifier do not interfere with changes
       to other PPU variables residing in the same cache line from PPU
       code.  If you do not use atomic updates, such interference may
       occur; however, writing back cache lines is more efficient.  The
       default behavior is to use atomic updates.
  
! `-mdual-nops'
! `-mdual-nops=N'
       By default, GCC inserts nops to increase dual issue when it expects
       it to increase performance.  N can be a value from 0 to 10.  A
       smaller N inserts fewer nops.  10 is the default, 0 is the same as
!      `-mno-dual-nops'.  Disabled with `-Os'.
  
! `-mhint-max-nops=N'
       Maximum number of nops to insert for a branch hint.  A branch hint
       must be at least 8 instructions away from the branch it is
       affecting.  GCC inserts up to N nops to enforce this, otherwise it
       does not generate the branch hint.
  
! `-mhint-max-distance=N'
       The encoding of the branch hint instruction limits the hint to be
!      within 256 instructions of the branch it is affecting.  By
!      default, GCC makes sure it is within 125.
  
! `-msafe-hints'
       Work around a hardware bug that causes the SPU to stall
!      indefinitely.  By default, GCC inserts the `hbrp' instruction to
       make sure this stall won't happen.
  
- 
  
  File: gcc.info,  Node: System V Options,  Next: TILE-Gx Options,  Prev: SPU Options,  Up: Submodel Options
  
--- 19630,19745 ----
  3.17.44 SPU Options
  -------------------
  
! These '-m' options are supported on the SPU:
! 
! '-mwarn-reloc'
! '-merror-reloc'
  
       The loader for SPU does not handle dynamic relocations.  By
       default, GCC gives an error when it generates code that requires a
!      dynamic relocation.  '-mno-error-reloc' disables the error,
!      '-mwarn-reloc' generates a warning instead.
! 
! '-msafe-dma'
! '-munsafe-dma'
  
       Instructions that initiate or test completion of DMA must not be
       reordered with respect to loads and stores of the memory that is
!      being accessed.  With '-munsafe-dma' you must use the 'volatile'
       keyword to protect memory accesses, but that can lead to
!      inefficient code in places where the memory is known to not change.
!      Rather than mark the memory as volatile, you can use '-msafe-dma'
!      to tell the compiler to treat the DMA instructions as potentially
!      affecting all memory.
! 
! '-mbranch-hints'
  
       By default, GCC generates a branch hint instruction to avoid
       pipeline stalls for always-taken or probably-taken branches.  A
       hint is not generated closer than 8 instructions away from its
       branch.  There is little reason to disable them, except for
       debugging purposes, or to make an object a little bit smaller.
  
! '-msmall-mem'
! '-mlarge-mem'
! 
       By default, GCC generates code assuming that addresses are never
!      larger than 18 bits.  With '-mlarge-mem' code is generated that
       assumes a full 32-bit address.
  
! '-mstdmain'
! 
       By default, GCC links against startup code that assumes the
       SPU-style main function interface (which has an unconventional
!      parameter list).  With '-mstdmain', GCC links your program against
!      startup code that assumes a C99-style interface to 'main',
!      including a local copy of 'argv' strings.
  
! '-mfixed-range=REGISTER-RANGE'
       Generate code treating the given register range as fixed registers.
       A fixed register is one that the register allocator cannot use.
       This is useful when compiling kernel code.  A register range is
       specified as two registers separated by a dash.  Multiple register
       ranges can be specified separated by a comma.
  
! '-mea32'
! '-mea64'
       Compile code assuming that pointers to the PPU address space
!      accessed via the '__ea' named address space qualifier are either 32
!      or 64 bits wide.  The default is 32 bits.  As this is an
       ABI-changing option, all object code in an executable must be
       compiled with the same setting.
  
! '-maddress-space-conversion'
! '-mno-address-space-conversion'
!      Allow/disallow treating the '__ea' address space as superset of the
!      generic address space.  This enables explicit type casts between
!      '__ea' and generic pointer as well as implicit conversions of
!      generic pointers to '__ea' pointers.  The default is to allow
       address space pointer conversions.
  
! '-mcache-size=CACHE-SIZE'
       This option controls the version of libgcc that the compiler links
!      to an executable and selects a software-managed cache for accessing
!      variables in the '__ea' address space with a particular cache size.
!      Possible options for CACHE-SIZE are '8', '16', '32', '64' and
!      '128'.  The default cache size is 64KB.
  
! '-matomic-updates'
! '-mno-atomic-updates'
       This option controls the version of libgcc that the compiler links
       to an executable and selects whether atomic updates to the
       software-managed cache of PPU-side variables are used.  If you use
       atomic updates, changes to a PPU variable from SPU code using the
!      '__ea' named address space qualifier do not interfere with changes
       to other PPU variables residing in the same cache line from PPU
       code.  If you do not use atomic updates, such interference may
       occur; however, writing back cache lines is more efficient.  The
       default behavior is to use atomic updates.
  
! '-mdual-nops'
! '-mdual-nops=N'
       By default, GCC inserts nops to increase dual issue when it expects
       it to increase performance.  N can be a value from 0 to 10.  A
       smaller N inserts fewer nops.  10 is the default, 0 is the same as
!      '-mno-dual-nops'.  Disabled with '-Os'.
  
! '-mhint-max-nops=N'
       Maximum number of nops to insert for a branch hint.  A branch hint
       must be at least 8 instructions away from the branch it is
       affecting.  GCC inserts up to N nops to enforce this, otherwise it
       does not generate the branch hint.
  
! '-mhint-max-distance=N'
       The encoding of the branch hint instruction limits the hint to be
!      within 256 instructions of the branch it is affecting.  By default,
!      GCC makes sure it is within 125.
  
! '-msafe-hints'
       Work around a hardware bug that causes the SPU to stall
!      indefinitely.  By default, GCC inserts the 'hbrp' instruction to
       make sure this stall won't happen.
  
  
  File: gcc.info,  Node: System V Options,  Next: TILE-Gx Options,  Prev: SPU Options,  Up: Submodel Options
  
*************** File: gcc.info,  Node: System V Options,
*** 19851,19873 ****
  These additional options are available on System V Release 4 for
  compatibility with other compilers on those systems:
  
! `-G'
!      Create a shared object.  It is recommended that `-symbolic' or
!      `-shared' be used instead.
  
! `-Qy'
       Identify the versions of each tool used by the compiler, in a
!      `.ident' assembler directive in the output.
  
! `-Qn'
!      Refrain from adding `.ident' directives to the output file (this is
       the default).
  
! `-YP,DIRS'
!      Search the directories DIRS, and no others, for libraries
!      specified with `-l'.
  
! `-Ym,DIR'
       Look in the directory DIR to find the M4 preprocessor.  The
       assembler uses this option.
  
--- 19749,19771 ----
  These additional options are available on System V Release 4 for
  compatibility with other compilers on those systems:
  
! '-G'
!      Create a shared object.  It is recommended that '-symbolic' or
!      '-shared' be used instead.
  
! '-Qy'
       Identify the versions of each tool used by the compiler, in a
!      '.ident' assembler directive in the output.
  
! '-Qn'
!      Refrain from adding '.ident' directives to the output file (this is
       the default).
  
! '-YP,DIRS'
!      Search the directories DIRS, and no others, for libraries specified
!      with '-l'.
  
! '-Ym,DIR'
       Look in the directory DIR to find the M4 preprocessor.  The
       assembler uses this option.
  
*************** File: gcc.info,  Node: TILE-Gx Options,
*** 19877,19905 ****
  3.17.46 TILE-Gx Options
  -----------------------
  
! These `-m' options are supported on the TILE-Gx:
  
! `-mcmodel=small'
       Generate code for the small model.  The distance for direct calls
       is limited to 500M in either direction.  PC-relative addresses are
       32 bits.  Absolute addresses support the full address range.
  
! `-mcmodel=large'
       Generate code for the large model.  There is no limitation on call
       distance, pc-relative addresses, or absolute addresses.
  
! `-mcpu=NAME'
       Selects the type of CPU to be targeted.  Currently the only
!      supported type is `tilegx'.
  
! `-m32'
! `-m64'
       Generate code for a 32-bit or 64-bit environment.  The 32-bit
       environment sets int, long, and pointer to 32 bits.  The 64-bit
       environment sets int to 32 bits and long and pointer to 64 bits.
  
! `-mbig-endian'
! `-mlittle-endian'
       Generate code in big/little endian mode, respectively.
  
  
--- 19775,19803 ----
  3.17.46 TILE-Gx Options
  -----------------------
  
! These '-m' options are supported on the TILE-Gx:
  
! '-mcmodel=small'
       Generate code for the small model.  The distance for direct calls
       is limited to 500M in either direction.  PC-relative addresses are
       32 bits.  Absolute addresses support the full address range.
  
! '-mcmodel=large'
       Generate code for the large model.  There is no limitation on call
       distance, pc-relative addresses, or absolute addresses.
  
! '-mcpu=NAME'
       Selects the type of CPU to be targeted.  Currently the only
!      supported type is 'tilegx'.
  
! '-m32'
! '-m64'
       Generate code for a 32-bit or 64-bit environment.  The 32-bit
       environment sets int, long, and pointer to 32 bits.  The 64-bit
       environment sets int to 32 bits and long and pointer to 64 bits.
  
! '-mbig-endian'
! '-mlittle-endian'
       Generate code in big/little endian mode, respectively.
  
  
*************** File: gcc.info,  Node: TILEPro Options,
*** 19908,19920 ****
  3.17.47 TILEPro Options
  -----------------------
  
! These `-m' options are supported on the TILEPro:
  
! `-mcpu=NAME'
       Selects the type of CPU to be targeted.  Currently the only
!      supported type is `tilepro'.
  
! `-m32'
       Generate code for a 32-bit environment, which sets int, long, and
       pointer to 32 bits.  This is the only supported behavior so the
       flag is essentially ignored.
--- 19806,19818 ----
  3.17.47 TILEPro Options
  -----------------------
  
! These '-m' options are supported on the TILEPro:
  
! '-mcpu=NAME'
       Selects the type of CPU to be targeted.  Currently the only
!      supported type is 'tilepro'.
  
! '-m32'
       Generate code for a 32-bit environment, which sets int, long, and
       pointer to 32 bits.  This is the only supported behavior so the
       flag is essentially ignored.
*************** File: gcc.info,  Node: V850 Options,  Ne
*** 19925,20052 ****
  3.17.48 V850 Options
  --------------------
  
! These `-m' options are defined for V850 implementations:
  
! `-mlong-calls'
! `-mno-long-calls'
       Treat all calls as being far away (near).  If calls are assumed to
       be far away, the compiler always loads the function's address into
       a register, and calls indirect through the pointer.
  
! `-mno-ep'
! `-mep'
       Do not optimize (do optimize) basic blocks that use the same index
!      pointer 4 or more times to copy pointer into the `ep' register, and
!      use the shorter `sld' and `sst' instructions.  The `-mep' option
!      is on by default if you optimize.
  
! `-mno-prolog-function'
! `-mprolog-function'
       Do not use (do use) external functions to save and restore
!      registers at the prologue and epilogue of a function.  The
!      external functions are slower, but use less code space if more
!      than one function saves the same number of registers.  The
!      `-mprolog-function' option is on by default if you optimize.
  
! `-mspace'
       Try to make the code as small as possible.  At present, this just
!      turns on the `-mep' and `-mprolog-function' options.
  
! `-mtda=N'
       Put static or global variables whose size is N bytes or less into
!      the tiny data area that register `ep' points to.  The tiny data
       area can hold up to 256 bytes in total (128 bytes for byte
       references).
  
! `-msda=N'
       Put static or global variables whose size is N bytes or less into
!      the small data area that register `gp' points to.  The small data
       area can hold up to 64 kilobytes.
  
! `-mzda=N'
       Put static or global variables whose size is N bytes or less into
       the first 32 kilobytes of memory.
  
! `-mv850'
       Specify that the target processor is the V850.
  
! `-mv850e3v5'
       Specify that the target processor is the V850E3V5.  The
!      preprocessor constant `__v850e3v5__' is defined if this option is
       used.
  
! `-mv850e2v4'
       Specify that the target processor is the V850E3V5.  This is an
!      alias for the `-mv850e3v5' option.
  
! `-mv850e2v3'
       Specify that the target processor is the V850E2V3.  The
!      preprocessor constant `__v850e2v3__' is defined if this option is
       used.
  
! `-mv850e2'
       Specify that the target processor is the V850E2.  The preprocessor
!      constant `__v850e2__' is defined if this option is used.
  
! `-mv850e1'
       Specify that the target processor is the V850E1.  The preprocessor
!      constants `__v850e1__' and `__v850e__' are defined if this option
       is used.
  
! `-mv850es'
!      Specify that the target processor is the V850ES.  This is an alias
!      for the `-mv850e1' option.
  
! `-mv850e'
       Specify that the target processor is the V850E.  The preprocessor
!      constant `__v850e__' is defined if this option is used.
  
!      If neither `-mv850' nor `-mv850e' nor `-mv850e1' nor `-mv850e2'
!      nor `-mv850e2v3' nor `-mv850e3v5' are defined then a default
!      target processor is chosen and the relevant `__v850*__'
!      preprocessor constant is defined.
  
!      The preprocessor constants `__v850' and `__v851__' are always
       defined, regardless of which processor variant is the target.
  
! `-mdisable-callt'
! `-mno-disable-callt'
!      This option suppresses generation of the `CALLT' instruction for
       the v850e, v850e1, v850e2, v850e2v3 and v850e3v5 flavors of the
       v850 architecture.
  
!      This option is enabled by default when the RH850 ABI is in use
!      (see `-mrh850-abi'), and disabled by default when the GCC ABI is
!      in use.  If `CALLT' instructions are being generated then the C
!      preprocessor symbol `__V850_CALLT__' is defined.
  
! `-mrelax'
! `-mno-relax'
!      Pass on (or do not pass on) the `-mrelax' command-line option to
       the assembler.
  
! `-mlong-jumps'
! `-mno-long-jumps'
       Disable (or re-enable) the generation of PC-relative jump
       instructions.
  
! `-msoft-float'
! `-mhard-float'
       Disable (or re-enable) the generation of hardware floating point
       instructions.  This option is only significant when the target
!      architecture is `V850E2V3' or higher.  If hardware floating point
       instructions are being generated then the C preprocessor symbol
!      `__FPU_OK__' is defined, otherwise the symbol `__NO_FPU__' is
       defined.
  
! `-mloop'
       Enables the use of the e3v5 LOOP instruction.  The use of this
       instruction is not enabled by default when the e3v5 architecture is
       selected because its use is still experimental.
  
! `-mrh850-abi'
! `-mghs'
!      Enables support for the RH850 version of the V850 ABI.  This is the
       default.  With this version of the ABI the following rules apply:
  
          * Integer sized structures and unions are returned via a memory
--- 19823,19950 ----
  3.17.48 V850 Options
  --------------------
  
! These '-m' options are defined for V850 implementations:
  
! '-mlong-calls'
! '-mno-long-calls'
       Treat all calls as being far away (near).  If calls are assumed to
       be far away, the compiler always loads the function's address into
       a register, and calls indirect through the pointer.
  
! '-mno-ep'
! '-mep'
       Do not optimize (do optimize) basic blocks that use the same index
!      pointer 4 or more times to copy pointer into the 'ep' register, and
!      use the shorter 'sld' and 'sst' instructions.  The '-mep' option is
!      on by default if you optimize.
  
! '-mno-prolog-function'
! '-mprolog-function'
       Do not use (do use) external functions to save and restore
!      registers at the prologue and epilogue of a function.  The external
!      functions are slower, but use less code space if more than one
!      function saves the same number of registers.  The
!      '-mprolog-function' option is on by default if you optimize.
  
! '-mspace'
       Try to make the code as small as possible.  At present, this just
!      turns on the '-mep' and '-mprolog-function' options.
  
! '-mtda=N'
       Put static or global variables whose size is N bytes or less into
!      the tiny data area that register 'ep' points to.  The tiny data
       area can hold up to 256 bytes in total (128 bytes for byte
       references).
  
! '-msda=N'
       Put static or global variables whose size is N bytes or less into
!      the small data area that register 'gp' points to.  The small data
       area can hold up to 64 kilobytes.
  
! '-mzda=N'
       Put static or global variables whose size is N bytes or less into
       the first 32 kilobytes of memory.
  
! '-mv850'
       Specify that the target processor is the V850.
  
! '-mv850e3v5'
       Specify that the target processor is the V850E3V5.  The
!      preprocessor constant '__v850e3v5__' is defined if this option is
       used.
  
! '-mv850e2v4'
       Specify that the target processor is the V850E3V5.  This is an
!      alias for the '-mv850e3v5' option.
  
! '-mv850e2v3'
       Specify that the target processor is the V850E2V3.  The
!      preprocessor constant '__v850e2v3__' is defined if this option is
       used.
  
! '-mv850e2'
       Specify that the target processor is the V850E2.  The preprocessor
!      constant '__v850e2__' is defined if this option is used.
  
! '-mv850e1'
       Specify that the target processor is the V850E1.  The preprocessor
!      constants '__v850e1__' and '__v850e__' are defined if this option
       is used.
  
! '-mv850es'
!      Specify that the target processor is the V850ES. This is an alias
!      for the '-mv850e1' option.
  
! '-mv850e'
       Specify that the target processor is the V850E.  The preprocessor
!      constant '__v850e__' is defined if this option is used.
  
!      If neither '-mv850' nor '-mv850e' nor '-mv850e1' nor '-mv850e2' nor
!      '-mv850e2v3' nor '-mv850e3v5' are defined then a default target
!      processor is chosen and the relevant '__v850*__' preprocessor
!      constant is defined.
  
!      The preprocessor constants '__v850' and '__v851__' are always
       defined, regardless of which processor variant is the target.
  
! '-mdisable-callt'
! '-mno-disable-callt'
!      This option suppresses generation of the 'CALLT' instruction for
       the v850e, v850e1, v850e2, v850e2v3 and v850e3v5 flavors of the
       v850 architecture.
  
!      This option is enabled by default when the RH850 ABI is in use (see
!      '-mrh850-abi'), and disabled by default when the GCC ABI is in use.
!      If 'CALLT' instructions are being generated then the C preprocessor
!      symbol '__V850_CALLT__' is defined.
  
! '-mrelax'
! '-mno-relax'
!      Pass on (or do not pass on) the '-mrelax' command-line option to
       the assembler.
  
! '-mlong-jumps'
! '-mno-long-jumps'
       Disable (or re-enable) the generation of PC-relative jump
       instructions.
  
! '-msoft-float'
! '-mhard-float'
       Disable (or re-enable) the generation of hardware floating point
       instructions.  This option is only significant when the target
!      architecture is 'V850E2V3' or higher.  If hardware floating point
       instructions are being generated then the C preprocessor symbol
!      '__FPU_OK__' is defined, otherwise the symbol '__NO_FPU__' is
       defined.
  
! '-mloop'
       Enables the use of the e3v5 LOOP instruction.  The use of this
       instruction is not enabled by default when the e3v5 architecture is
       selected because its use is still experimental.
  
! '-mrh850-abi'
! '-mghs'
!      Enables support for the RH850 version of the V850 ABI. This is the
       default.  With this version of the ABI the following rules apply:
  
          * Integer sized structures and unions are returned via a memory
*************** These `-m' options are defined for V850
*** 20057,20077 ****
  
          * Functions are aligned to 16-bit boundaries.
  
!         * The `-m8byte-align' command-line option is supported.
  
!         * The `-mdisable-callt' command-line option is enabled by
!           default.  The `-mno-disable-callt' command-line option is not
            supported.
  
       When this version of the ABI is enabled the C preprocessor symbol
!      `__V850_RH850_ABI__' is defined.
  
! `-mgcc-abi'
!      Enables support for the old GCC version of the V850 ABI.  With this
       version of the ABI the following rules apply:
  
          * Integer sized structures and unions are returned in register
!           `r10'.
  
          * Large structures and unions (more than 8 bytes in size) are
            passed by reference.
--- 19955,19975 ----
  
          * Functions are aligned to 16-bit boundaries.
  
!         * The '-m8byte-align' command-line option is supported.
  
!         * The '-mdisable-callt' command-line option is enabled by
!           default.  The '-mno-disable-callt' command-line option is not
            supported.
  
       When this version of the ABI is enabled the C preprocessor symbol
!      '__V850_RH850_ABI__' is defined.
  
! '-mgcc-abi'
!      Enables support for the old GCC version of the V850 ABI. With this
       version of the ABI the following rules apply:
  
          * Integer sized structures and unions are returned in register
!           'r10'.
  
          * Large structures and unions (more than 8 bytes in size) are
            passed by reference.
*************** These `-m' options are defined for V850
*** 20079,20129 ****
          * Functions are aligned to 32-bit boundaries, unless optimizing
            for size.
  
!         * The `-m8byte-align' command-line option is not supported.
  
!         * The `-mdisable-callt' command-line option is supported but not
            enabled by default.
  
       When this version of the ABI is enabled the C preprocessor symbol
!      `__V850_GCC_ABI__' is defined.
  
! `-m8byte-align'
! `-mno-8byte-align'
!      Enables support for `double' and `long long' types to be aligned
!      on 8-byte boundaries.  The default is to restrict the alignment of
!      all objects to at most 4-bytes.  When `-m8byte-align' is in effect
!      the C preprocessor symbol `__V850_8BYTE_ALIGN__' is defined.
  
! `-mbig-switch'
!      Generate code suitable for big switch tables.  Use this option
!      only if the assembler/linker complain about out of range branches
!      within a switch table.
  
! `-mapp-regs'
       This option causes r2 and r5 to be used in the code generated by
       the compiler.  This setting is the default.
  
! `-mno-app-regs'
       This option causes r2 and r5 to be treated as fixed registers.
  
- 
  
  File: gcc.info,  Node: VAX Options,  Next: Visium Options,  Prev: V850 Options,  Up: Submodel Options
  
  3.17.49 VAX Options
  -------------------
  
! These `-m' options are defined for the VAX:
  
! `-munix'
!      Do not output certain jump instructions (`aobleq' and so on) that
       the Unix assembler for the VAX cannot handle across long ranges.
  
! `-mgnu'
       Do output those jump instructions, on the assumption that the GNU
       assembler is being used.
  
! `-mg'
       Output code for G-format floating-point numbers instead of
       D-format.
  
--- 19977,20026 ----
          * Functions are aligned to 32-bit boundaries, unless optimizing
            for size.
  
!         * The '-m8byte-align' command-line option is not supported.
  
!         * The '-mdisable-callt' command-line option is supported but not
            enabled by default.
  
       When this version of the ABI is enabled the C preprocessor symbol
!      '__V850_GCC_ABI__' is defined.
  
! '-m8byte-align'
! '-mno-8byte-align'
!      Enables support for 'double' and 'long long' types to be aligned on
!      8-byte boundaries.  The default is to restrict the alignment of all
!      objects to at most 4-bytes.  When '-m8byte-align' is in effect the
!      C preprocessor symbol '__V850_8BYTE_ALIGN__' is defined.
  
! '-mbig-switch'
!      Generate code suitable for big switch tables.  Use this option only
!      if the assembler/linker complain about out of range branches within
!      a switch table.
  
! '-mapp-regs'
       This option causes r2 and r5 to be used in the code generated by
       the compiler.  This setting is the default.
  
! '-mno-app-regs'
       This option causes r2 and r5 to be treated as fixed registers.
  
  
  File: gcc.info,  Node: VAX Options,  Next: Visium Options,  Prev: V850 Options,  Up: Submodel Options
  
  3.17.49 VAX Options
  -------------------
  
! These '-m' options are defined for the VAX:
  
! '-munix'
!      Do not output certain jump instructions ('aobleq' and so on) that
       the Unix assembler for the VAX cannot handle across long ranges.
  
! '-mgnu'
       Do output those jump instructions, on the assumption that the GNU
       assembler is being used.
  
! '-mg'
       Output code for G-format floating-point numbers instead of
       D-format.
  
*************** File: gcc.info,  Node: Visium Options,
*** 20133,20189 ****
  3.17.50 Visium Options
  ----------------------
  
! `-mdebug'
       A program which performs file I/O and is destined to run on an MCM
       target should be linked with this option.  It causes the libraries
       libc.a and libdebug.a to be linked.  The program should be run on
       the target under the control of the GDB remote debugging stub.
  
! `-msim'
       A program which performs file I/O and is destined to run on the
       simulator should be linked with option.  This causes libraries
       libc.a and libsim.a to be linked.
  
! `-mfpu'
! `-mhard-float'
       Generate code containing floating-point instructions.  This is the
       default.
  
! `-mno-fpu'
! `-msoft-float'
       Generate code containing library calls for floating-point.
  
!      `-msoft-float' changes the calling convention in the output file;
       therefore, it is only useful if you compile _all_ of a program with
!      this option.  In particular, you need to compile `libgcc.a', the
!      library that comes with GCC, with `-msoft-float' in order for this
       to work.
  
! `-mcpu=CPU_TYPE'
       Set the instruction set, register set, and instruction scheduling
       parameters for machine type CPU_TYPE.  Supported values for
!      CPU_TYPE are `mcm', `gr5' and `gr6'.
  
!      `mcm' is a synonym of `gr5' present for backward compatibility.
  
       By default (unless configured otherwise), GCC generates code for
       the GR5 variant of the Visium architecture.
  
!      With `-mcpu=gr6', GCC generates code for the GR6 variant of the
!      Visium architecture.  The only difference from GR5 code is that
!      the compiler will generate block move instructions.
  
! `-mtune=CPU_TYPE'
       Set the instruction scheduling parameters for machine type
       CPU_TYPE, but do not set the instruction set or register set that
!      the option `-mcpu=CPU_TYPE' would.
  
! `-msv-mode'
       Generate code for the supervisor mode, where there are no
       restrictions on the access to general registers.  This is the
       default.
  
! `-muser-mode'
       Generate code for the user mode, where the access to some general
       registers is forbidden: on the GR5, registers r24 to r31 cannot be
       accessed in this mode; on the GR6, only registers r29 to r31 are
--- 20030,20086 ----
  3.17.50 Visium Options
  ----------------------
  
! '-mdebug'
       A program which performs file I/O and is destined to run on an MCM
       target should be linked with this option.  It causes the libraries
       libc.a and libdebug.a to be linked.  The program should be run on
       the target under the control of the GDB remote debugging stub.
  
! '-msim'
       A program which performs file I/O and is destined to run on the
       simulator should be linked with option.  This causes libraries
       libc.a and libsim.a to be linked.
  
! '-mfpu'
! '-mhard-float'
       Generate code containing floating-point instructions.  This is the
       default.
  
! '-mno-fpu'
! '-msoft-float'
       Generate code containing library calls for floating-point.
  
!      '-msoft-float' changes the calling convention in the output file;
       therefore, it is only useful if you compile _all_ of a program with
!      this option.  In particular, you need to compile 'libgcc.a', the
!      library that comes with GCC, with '-msoft-float' in order for this
       to work.
  
! '-mcpu=CPU_TYPE'
       Set the instruction set, register set, and instruction scheduling
       parameters for machine type CPU_TYPE.  Supported values for
!      CPU_TYPE are 'mcm', 'gr5' and 'gr6'.
  
!      'mcm' is a synonym of 'gr5' present for backward compatibility.
  
       By default (unless configured otherwise), GCC generates code for
       the GR5 variant of the Visium architecture.
  
!      With '-mcpu=gr6', GCC generates code for the GR6 variant of the
!      Visium architecture.  The only difference from GR5 code is that the
!      compiler will generate block move instructions.
  
! '-mtune=CPU_TYPE'
       Set the instruction scheduling parameters for machine type
       CPU_TYPE, but do not set the instruction set or register set that
!      the option '-mcpu=CPU_TYPE' would.
  
! '-msv-mode'
       Generate code for the supervisor mode, where there are no
       restrictions on the access to general registers.  This is the
       default.
  
! '-muser-mode'
       Generate code for the user mode, where the access to some general
       registers is forbidden: on the GR5, registers r24 to r31 cannot be
       accessed in this mode; on the GR6, only registers r29 to r31 are
*************** File: gcc.info,  Node: VMS Options,  Nex
*** 20195,20218 ****
  3.17.51 VMS Options
  -------------------
  
! These `-m' options are defined for the VMS implementations:
  
! `-mvms-return-codes'
!      Return VMS condition codes from `main'. The default is to return
       POSIX-style condition (e.g. error) codes.
  
! `-mdebug-main=PREFIX'
       Flag the first routine whose name starts with PREFIX as the main
       routine for the debugger.
  
! `-mmalloc64'
       Default to 64-bit memory allocation routines.
  
! `-mpointer-size=SIZE'
!      Set the default size of pointers. Possible options for SIZE are
!      `32' or `short' for 32 bit pointers, `64' or `long' for 64 bit
!      pointers, and `no' for supporting only 32 bit pointers.  The later
!      option disables `pragma pointer_size'.
  
  
  File: gcc.info,  Node: VxWorks Options,  Next: x86 Options,  Prev: VMS Options,  Up: Submodel Options
--- 20092,20115 ----
  3.17.51 VMS Options
  -------------------
  
! These '-m' options are defined for the VMS implementations:
  
! '-mvms-return-codes'
!      Return VMS condition codes from 'main'.  The default is to return
       POSIX-style condition (e.g. error) codes.
  
! '-mdebug-main=PREFIX'
       Flag the first routine whose name starts with PREFIX as the main
       routine for the debugger.
  
! '-mmalloc64'
       Default to 64-bit memory allocation routines.
  
! '-mpointer-size=SIZE'
!      Set the default size of pointers.  Possible options for SIZE are
!      '32' or 'short' for 32 bit pointers, '64' or 'long' for 64 bit
!      pointers, and 'no' for supporting only 32 bit pointers.  The later
!      option disables 'pragma pointer_size'.
  
  
  File: gcc.info,  Node: VxWorks Options,  Next: x86 Options,  Prev: VMS Options,  Up: Submodel Options
*************** The options in this section are defined
*** 20224,20251 ****
  Options specific to the target hardware are listed with the other
  options for that target.
  
! `-mrtp'
       GCC can generate code for both VxWorks kernels and real time
       processes (RTPs).  This option switches from the former to the
!      latter.  It also defines the preprocessor macro `__RTP__'.
  
! `-non-static'
       Link an RTP executable against shared libraries rather than static
!      libraries.  The options `-static' and `-shared' can also be used
!      for RTPs (*note Link Options::); `-static' is the default.
  
! `-Bstatic'
! `-Bdynamic'
       These options are passed down to the linker.  They are defined for
       compatibility with Diab.
  
! `-Xbind-lazy'
       Enable lazy binding of function calls.  This option is equivalent
!      to `-Wl,-z,now' and is defined for compatibility with Diab.
  
! `-Xbind-now'
!      Disable lazy binding of function calls.  This option is the
!      default and is defined for compatibility with Diab.
  
  
  File: gcc.info,  Node: x86 Options,  Next: x86 Windows Options,  Prev: VxWorks Options,  Up: Submodel Options
--- 20121,20148 ----
  Options specific to the target hardware are listed with the other
  options for that target.
  
! '-mrtp'
       GCC can generate code for both VxWorks kernels and real time
       processes (RTPs).  This option switches from the former to the
!      latter.  It also defines the preprocessor macro '__RTP__'.
  
! '-non-static'
       Link an RTP executable against shared libraries rather than static
!      libraries.  The options '-static' and '-shared' can also be used
!      for RTPs (*note Link Options::); '-static' is the default.
  
! '-Bstatic'
! '-Bdynamic'
       These options are passed down to the linker.  They are defined for
       compatibility with Diab.
  
! '-Xbind-lazy'
       Enable lazy binding of function calls.  This option is equivalent
!      to '-Wl,-z,now' and is defined for compatibility with Diab.
  
! '-Xbind-now'
!      Disable lazy binding of function calls.  This option is the default
!      and is defined for compatibility with Diab.
  
  
  File: gcc.info,  Node: x86 Options,  Next: x86 Windows Options,  Prev: VxWorks Options,  Up: Submodel Options
*************** File: gcc.info,  Node: x86 Options,  Nex
*** 20253,20498 ****
  3.17.53 x86 Options
  -------------------
  
! These `-m' options are defined for the x86 family of computers.
  
! `-march=CPU-TYPE'
       Generate instructions for the machine type CPU-TYPE.  In contrast
!      to `-mtune=CPU-TYPE', which merely tunes the generated code for
!      the specified CPU-TYPE, `-march=CPU-TYPE' allows GCC to generate
!      code that may not run at all on processors other than the one
!      indicated.  Specifying `-march=CPU-TYPE' implies `-mtune=CPU-TYPE'.
  
       The choices for CPU-TYPE are:
  
!     `native'
            This selects the CPU to generate code for at compilation time
            by determining the processor type of the compiling machine.
!           Using `-march=native' enables all instruction subsets
!           supported by the local machine (hence the result might not
!           run on different machines).  Using `-mtune=native' produces
!           code optimized for the local machine under the constraints of
!           the selected instruction set.
  
!     `i386'
            Original Intel i386 CPU.
  
!     `i486'
            Intel i486 CPU.  (No scheduling is implemented for this chip.)
  
!     `i586'
!     `pentium'
            Intel Pentium CPU with no MMX support.
  
!     `pentium-mmx'
            Intel Pentium MMX CPU, based on Pentium core with MMX
            instruction set support.
  
!     `pentiumpro'
            Intel Pentium Pro CPU.
  
!     `i686'
!           When used with `-march', the Pentium Pro instruction set is
            used, so the code runs on all i686 family chips.  When used
!           with `-mtune', it has the same meaning as `generic'.
  
!     `pentium2'
            Intel Pentium II CPU, based on Pentium Pro core with MMX
            instruction set support.
  
!     `pentium3'
!     `pentium3m'
            Intel Pentium III CPU, based on Pentium Pro core with MMX and
            SSE instruction set support.
  
!     `pentium-m'
            Intel Pentium M; low-power version of Intel Pentium III CPU
            with MMX, SSE and SSE2 instruction set support.  Used by
            Centrino notebooks.
  
!     `pentium4'
!     `pentium4m'
            Intel Pentium 4 CPU with MMX, SSE and SSE2 instruction set
            support.
  
!     `prescott'
            Improved version of Intel Pentium 4 CPU with MMX, SSE, SSE2
            and SSE3 instruction set support.
  
!     `nocona'
            Improved version of Intel Pentium 4 CPU with 64-bit
            extensions, MMX, SSE, SSE2 and SSE3 instruction set support.
  
!     `core2'
            Intel Core 2 CPU with 64-bit extensions, MMX, SSE, SSE2, SSE3
            and SSSE3 instruction set support.
  
!     `nehalem'
            Intel Nehalem CPU with 64-bit extensions, MMX, SSE, SSE2,
            SSE3, SSSE3, SSE4.1, SSE4.2 and POPCNT instruction set
            support.
  
!     `westmere'
            Intel Westmere CPU with 64-bit extensions, MMX, SSE, SSE2,
            SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AES and PCLMUL
            instruction set support.
  
!     `sandybridge'
!           Intel Sandy Bridge CPU with 64-bit extensions, MMX, SSE,
!           SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AES and
!           PCLMUL instruction set support.
  
!     `ivybridge'
            Intel Ivy Bridge CPU with 64-bit extensions, MMX, SSE, SSE2,
            SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AES, PCLMUL,
            FSGSBASE, RDRND and F16C instruction set support.
  
!     `haswell'
            Intel Haswell CPU with 64-bit extensions, MOVBE, MMX, SSE,
            SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES,
            PCLMUL, FSGSBASE, RDRND, FMA, BMI, BMI2 and F16C instruction
            set support.
  
!     `broadwell'
            Intel Broadwell CPU with 64-bit extensions, MOVBE, MMX, SSE,
            SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES,
            PCLMUL, FSGSBASE, RDRND, FMA, BMI, BMI2, F16C, RDSEED, ADCX
            and PREFETCHW instruction set support.
  
!     `bonnell'
            Intel Bonnell CPU with 64-bit extensions, MOVBE, MMX, SSE,
            SSE2, SSE3 and SSSE3 instruction set support.
  
!     `silvermont'
            Intel Silvermont CPU with 64-bit extensions, MOVBE, MMX, SSE,
            SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AES, PCLMUL and
            RDRND instruction set support.
  
!     `knl'
!           Intel Knight's Landing CPU with 64-bit extensions, MOVBE,
!           MMX, SSE, SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX,
!           AVX2, AES, PCLMUL, FSGSBASE, RDRND, FMA, BMI, BMI2, F16C,
!           RDSEED, ADCX, PREFETCHW, AVX512F, AVX512PF, AVX512ER and
!           AVX512CD instruction set support.
  
!     `k6'
            AMD K6 CPU with MMX instruction set support.
  
!     `k6-2'
!     `k6-3'
            Improved versions of AMD K6 CPU with MMX and 3DNow!
            instruction set support.
  
!     `athlon'
!     `athlon-tbird'
            AMD Athlon CPU with MMX, 3dNOW!, enhanced 3DNow! and SSE
            prefetch instructions support.
  
!     `athlon-4'
!     `athlon-xp'
!     `athlon-mp'
            Improved AMD Athlon CPU with MMX, 3DNow!, enhanced 3DNow! and
            full SSE instruction set support.
  
!     `k8'
!     `opteron'
!     `athlon64'
!     `athlon-fx'
            Processors based on the AMD K8 core with x86-64 instruction
            set support, including the AMD Opteron, Athlon 64, and Athlon
            64 FX processors.  (This supersets MMX, SSE, SSE2, 3DNow!,
            enhanced 3DNow! and 64-bit instruction set extensions.)
  
!     `k8-sse3'
!     `opteron-sse3'
!     `athlon64-sse3'
            Improved versions of AMD K8 cores with SSE3 instruction set
            support.
  
!     `amdfam10'
!     `barcelona'
!           CPUs based on AMD Family 10h cores with x86-64 instruction
!           set support.  (This supersets MMX, SSE, SSE2, SSE3, SSE4A,
!           3DNow!, enhanced 3DNow!, ABM and 64-bit instruction set
!           extensions.)
! 
!     `bdver1'
!           CPUs based on AMD Family 15h cores with x86-64 instruction
!           set support.  (This supersets FMA4, AVX, XOP, LWP, AES,
!           PCL_MUL, CX16, MMX, SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1,
!           SSE4.2, ABM and 64-bit instruction set extensions.)
  
!     `bdver2'
            AMD Family 15h core based CPUs with x86-64 instruction set
!           support.  (This supersets BMI, TBM, F16C, FMA, FMA4, AVX,
!           XOP, LWP, AES, PCL_MUL, CX16, MMX, SSE, SSE2, SSE3, SSE4A,
!           SSSE3, SSE4.1, SSE4.2, ABM and 64-bit instruction set
!           extensions.)
! 
!     `bdver3'
            AMD Family 15h core based CPUs with x86-64 instruction set
!           support.  (This supersets BMI, TBM, F16C, FMA, FMA4,
!           FSGSBASE, AVX, XOP, LWP, AES, PCL_MUL, CX16, MMX, SSE, SSE2,
!           SSE3, SSE4A, SSSE3, SSE4.1, SSE4.2, ABM and 64-bit
!           instruction set extensions.
! 
!     `bdver4'
            AMD Family 15h core based CPUs with x86-64 instruction set
            support.  (This supersets BMI, BMI2, TBM, F16C, FMA, FMA4,
!           FSGSBASE, AVX, AVX2, XOP, LWP, AES, PCL_MUL, CX16, MOVBE,
!           MMX, SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1, SSE4.2, ABM and
!           64-bit instruction set extensions.
  
!     `btver1'
!           CPUs based on AMD Family 14h cores with x86-64 instruction
!           set support.  (This supersets MMX, SSE, SSE2, SSE3, SSSE3,
!           SSE4A, CX16, ABM and 64-bit instruction set extensions.)
  
!     `btver2'
!           CPUs based on AMD Family 16h cores with x86-64 instruction
!           set support. This includes MOVBE, F16C, BMI, AVX, PCL_MUL,
!           AES, SSE4.2, SSE4.1, CX16, ABM, SSE4A, SSSE3, SSE3, SSE2,
!           SSE, MMX and 64-bit instruction set extensions.
  
!     `winchip-c6'
            IDT WinChip C6 CPU, dealt in same way as i486 with additional
            MMX instruction set support.
  
!     `winchip2'
            IDT WinChip 2 CPU, dealt in same way as i486 with additional
!           MMX and 3DNow!  instruction set support.
  
!     `c3'
            VIA C3 CPU with MMX and 3DNow! instruction set support.  (No
            scheduling is implemented for this chip.)
  
!     `c3-2'
            VIA C3-2 (Nehemiah/C5XL) CPU with MMX and SSE instruction set
            support.  (No scheduling is implemented for this chip.)
  
!     `geode'
            AMD Geode embedded processor with MMX and 3DNow! instruction
            set support.
  
! `-mtune=CPU-TYPE'
       Tune to CPU-TYPE everything applicable about the generated code,
       except for the ABI and the set of available instructions.  While
!      picking a specific CPU-TYPE schedules things appropriately for
!      that particular chip, the compiler does not generate any code that
       cannot run on the default machine type unless you use a
!      `-march=CPU-TYPE' option.  For example, if GCC is configured for
!      i686-pc-linux-gnu then `-mtune=pentium4' generates code that is
       tuned for Pentium 4 but still runs on i686 machines.
  
!      The choices for CPU-TYPE are the same as for `-march'.  In
!      addition, `-mtune' supports 2 extra choices for CPU-TYPE:
  
!     `generic'
            Produce code optimized for the most common IA32/AMD64/EM64T
            processors.  If you know the CPU on which your code will run,
!           then you should use the corresponding `-mtune' or `-march'
!           option instead of `-mtune=generic'.  But, if you do not know
!           exactly what CPU users of your application will have, then
!           you should use this option.
  
            As new processors are deployed in the marketplace, the
            behavior of this option will change.  Therefore, if you
--- 20150,20390 ----
  3.17.53 x86 Options
  -------------------
  
! These '-m' options are defined for the x86 family of computers.
  
! '-march=CPU-TYPE'
       Generate instructions for the machine type CPU-TYPE.  In contrast
!      to '-mtune=CPU-TYPE', which merely tunes the generated code for the
!      specified CPU-TYPE, '-march=CPU-TYPE' allows GCC to generate code
!      that may not run at all on processors other than the one indicated.
!      Specifying '-march=CPU-TYPE' implies '-mtune=CPU-TYPE'.
  
       The choices for CPU-TYPE are:
  
!      'native'
            This selects the CPU to generate code for at compilation time
            by determining the processor type of the compiling machine.
!           Using '-march=native' enables all instruction subsets
!           supported by the local machine (hence the result might not run
!           on different machines).  Using '-mtune=native' produces code
!           optimized for the local machine under the constraints of the
!           selected instruction set.
  
!      'i386'
            Original Intel i386 CPU.
  
!      'i486'
            Intel i486 CPU.  (No scheduling is implemented for this chip.)
  
!      'i586'
!      'pentium'
            Intel Pentium CPU with no MMX support.
  
!      'pentium-mmx'
            Intel Pentium MMX CPU, based on Pentium core with MMX
            instruction set support.
  
!      'pentiumpro'
            Intel Pentium Pro CPU.
  
!      'i686'
!           When used with '-march', the Pentium Pro instruction set is
            used, so the code runs on all i686 family chips.  When used
!           with '-mtune', it has the same meaning as 'generic'.
  
!      'pentium2'
            Intel Pentium II CPU, based on Pentium Pro core with MMX
            instruction set support.
  
!      'pentium3'
!      'pentium3m'
            Intel Pentium III CPU, based on Pentium Pro core with MMX and
            SSE instruction set support.
  
!      'pentium-m'
            Intel Pentium M; low-power version of Intel Pentium III CPU
            with MMX, SSE and SSE2 instruction set support.  Used by
            Centrino notebooks.
  
!      'pentium4'
!      'pentium4m'
            Intel Pentium 4 CPU with MMX, SSE and SSE2 instruction set
            support.
  
!      'prescott'
            Improved version of Intel Pentium 4 CPU with MMX, SSE, SSE2
            and SSE3 instruction set support.
  
!      'nocona'
            Improved version of Intel Pentium 4 CPU with 64-bit
            extensions, MMX, SSE, SSE2 and SSE3 instruction set support.
  
!      'core2'
            Intel Core 2 CPU with 64-bit extensions, MMX, SSE, SSE2, SSE3
            and SSSE3 instruction set support.
  
!      'nehalem'
            Intel Nehalem CPU with 64-bit extensions, MMX, SSE, SSE2,
            SSE3, SSSE3, SSE4.1, SSE4.2 and POPCNT instruction set
            support.
  
!      'westmere'
            Intel Westmere CPU with 64-bit extensions, MMX, SSE, SSE2,
            SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AES and PCLMUL
            instruction set support.
  
!      'sandybridge'
!           Intel Sandy Bridge CPU with 64-bit extensions, MMX, SSE, SSE2,
!           SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AES and PCLMUL
!           instruction set support.
  
!      'ivybridge'
            Intel Ivy Bridge CPU with 64-bit extensions, MMX, SSE, SSE2,
            SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AES, PCLMUL,
            FSGSBASE, RDRND and F16C instruction set support.
  
!      'haswell'
            Intel Haswell CPU with 64-bit extensions, MOVBE, MMX, SSE,
            SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES,
            PCLMUL, FSGSBASE, RDRND, FMA, BMI, BMI2 and F16C instruction
            set support.
  
!      'broadwell'
            Intel Broadwell CPU with 64-bit extensions, MOVBE, MMX, SSE,
            SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AVX2, AES,
            PCLMUL, FSGSBASE, RDRND, FMA, BMI, BMI2, F16C, RDSEED, ADCX
            and PREFETCHW instruction set support.
  
!      'bonnell'
            Intel Bonnell CPU with 64-bit extensions, MOVBE, MMX, SSE,
            SSE2, SSE3 and SSSE3 instruction set support.
  
!      'silvermont'
            Intel Silvermont CPU with 64-bit extensions, MOVBE, MMX, SSE,
            SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AES, PCLMUL and
            RDRND instruction set support.
  
!      'knl'
!           Intel Knight's Landing CPU with 64-bit extensions, MOVBE, MMX,
!           SSE, SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, POPCNT, AVX, AVX2,
!           AES, PCLMUL, FSGSBASE, RDRND, FMA, BMI, BMI2, F16C, RDSEED,
!           ADCX, PREFETCHW, AVX512F, AVX512PF, AVX512ER and AVX512CD
!           instruction set support.
  
!      'k6'
            AMD K6 CPU with MMX instruction set support.
  
!      'k6-2'
!      'k6-3'
            Improved versions of AMD K6 CPU with MMX and 3DNow!
            instruction set support.
  
!      'athlon'
!      'athlon-tbird'
            AMD Athlon CPU with MMX, 3dNOW!, enhanced 3DNow! and SSE
            prefetch instructions support.
  
!      'athlon-4'
!      'athlon-xp'
!      'athlon-mp'
            Improved AMD Athlon CPU with MMX, 3DNow!, enhanced 3DNow! and
            full SSE instruction set support.
  
!      'k8'
!      'opteron'
!      'athlon64'
!      'athlon-fx'
            Processors based on the AMD K8 core with x86-64 instruction
            set support, including the AMD Opteron, Athlon 64, and Athlon
            64 FX processors.  (This supersets MMX, SSE, SSE2, 3DNow!,
            enhanced 3DNow! and 64-bit instruction set extensions.)
  
!      'k8-sse3'
!      'opteron-sse3'
!      'athlon64-sse3'
            Improved versions of AMD K8 cores with SSE3 instruction set
            support.
  
!      'amdfam10'
!      'barcelona'
!           CPUs based on AMD Family 10h cores with x86-64 instruction set
!           support.  (This supersets MMX, SSE, SSE2, SSE3, SSE4A, 3DNow!,
!           enhanced 3DNow!, ABM and 64-bit instruction set extensions.)
  
!      'bdver1'
!           CPUs based on AMD Family 15h cores with x86-64 instruction set
!           support.  (This supersets FMA4, AVX, XOP, LWP, AES, PCL_MUL,
!           CX16, MMX, SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1, SSE4.2, ABM
!           and 64-bit instruction set extensions.)
!      'bdver2'
            AMD Family 15h core based CPUs with x86-64 instruction set
!           support.  (This supersets BMI, TBM, F16C, FMA, FMA4, AVX, XOP,
!           LWP, AES, PCL_MUL, CX16, MMX, SSE, SSE2, SSE3, SSE4A, SSSE3,
!           SSE4.1, SSE4.2, ABM and 64-bit instruction set extensions.)
!      'bdver3'
            AMD Family 15h core based CPUs with x86-64 instruction set
!           support.  (This supersets BMI, TBM, F16C, FMA, FMA4, FSGSBASE,
!           AVX, XOP, LWP, AES, PCL_MUL, CX16, MMX, SSE, SSE2, SSE3,
!           SSE4A, SSSE3, SSE4.1, SSE4.2, ABM and 64-bit instruction set
!           extensions.
!      'bdver4'
            AMD Family 15h core based CPUs with x86-64 instruction set
            support.  (This supersets BMI, BMI2, TBM, F16C, FMA, FMA4,
!           FSGSBASE, AVX, AVX2, XOP, LWP, AES, PCL_MUL, CX16, MOVBE, MMX,
!           SSE, SSE2, SSE3, SSE4A, SSSE3, SSE4.1, SSE4.2, ABM and 64-bit
!           instruction set extensions.
  
!      'btver1'
!           CPUs based on AMD Family 14h cores with x86-64 instruction set
!           support.  (This supersets MMX, SSE, SSE2, SSE3, SSSE3, SSE4A,
!           CX16, ABM and 64-bit instruction set extensions.)
  
!      'btver2'
!           CPUs based on AMD Family 16h cores with x86-64 instruction set
!           support.  This includes MOVBE, F16C, BMI, AVX, PCL_MUL, AES,
!           SSE4.2, SSE4.1, CX16, ABM, SSE4A, SSSE3, SSE3, SSE2, SSE, MMX
!           and 64-bit instruction set extensions.
  
!      'winchip-c6'
            IDT WinChip C6 CPU, dealt in same way as i486 with additional
            MMX instruction set support.
  
!      'winchip2'
            IDT WinChip 2 CPU, dealt in same way as i486 with additional
!           MMX and 3DNow! instruction set support.
  
!      'c3'
            VIA C3 CPU with MMX and 3DNow! instruction set support.  (No
            scheduling is implemented for this chip.)
  
!      'c3-2'
            VIA C3-2 (Nehemiah/C5XL) CPU with MMX and SSE instruction set
            support.  (No scheduling is implemented for this chip.)
  
!      'geode'
            AMD Geode embedded processor with MMX and 3DNow! instruction
            set support.
  
! '-mtune=CPU-TYPE'
       Tune to CPU-TYPE everything applicable about the generated code,
       except for the ABI and the set of available instructions.  While
!      picking a specific CPU-TYPE schedules things appropriately for that
!      particular chip, the compiler does not generate any code that
       cannot run on the default machine type unless you use a
!      '-march=CPU-TYPE' option.  For example, if GCC is configured for
!      i686-pc-linux-gnu then '-mtune=pentium4' generates code that is
       tuned for Pentium 4 but still runs on i686 machines.
  
!      The choices for CPU-TYPE are the same as for '-march'.  In
!      addition, '-mtune' supports 2 extra choices for CPU-TYPE:
  
!      'generic'
            Produce code optimized for the most common IA32/AMD64/EM64T
            processors.  If you know the CPU on which your code will run,
!           then you should use the corresponding '-mtune' or '-march'
!           option instead of '-mtune=generic'.  But, if you do not know
!           exactly what CPU users of your application will have, then you
!           should use this option.
  
            As new processors are deployed in the marketplace, the
            behavior of this option will change.  Therefore, if you
*************** These `-m' options are defined for the x
*** 20500,20518 ****
            by this option will change to reflect the processors that are
            most common at the time that version of GCC is released.
  
!           There is no `-march=generic' option because `-march'
!           indicates the instruction set the compiler can use, and there
!           is no generic instruction set applicable to all processors.
!           In contrast, `-mtune' indicates the processor (or, in this
!           case, collection of processors) for which the code is
!           optimized.
  
!     `intel'
            Produce code optimized for the most current Intel processors,
!           which are Haswell and Silvermont for this version of GCC.  If
            you know the CPU on which your code will run, then you should
!           use the corresponding `-mtune' or `-march' option instead of
!           `-mtune=intel'.  But, if you want your application performs
            better on both Haswell and Silvermont, then you should use
            this option.
  
--- 20392,20409 ----
            by this option will change to reflect the processors that are
            most common at the time that version of GCC is released.
  
!           There is no '-march=generic' option because '-march' indicates
!           the instruction set the compiler can use, and there is no
!           generic instruction set applicable to all processors.  In
!           contrast, '-mtune' indicates the processor (or, in this case,
!           collection of processors) for which the code is optimized.
  
!      'intel'
            Produce code optimized for the most current Intel processors,
!           which are Haswell and Silvermont for this version of GCC. If
            you know the CPU on which your code will run, then you should
!           use the corresponding '-mtune' or '-march' option instead of
!           '-mtune=intel'.  But, if you want your application performs
            better on both Haswell and Silvermont, then you should use
            this option.
  
*************** These `-m' options are defined for the x
*** 20522,20577 ****
            by this option will change to reflect the most current Intel
            processors at the time that version of GCC is released.
  
!           There is no `-march=intel' option because `-march' indicates
            the instruction set the compiler can use, and there is no
            common instruction set applicable to all processors.  In
!           contrast, `-mtune' indicates the processor (or, in this case,
            collection of processors) for which the code is optimized.
  
! `-mcpu=CPU-TYPE'
!      A deprecated synonym for `-mtune'.
  
! `-mfpmath=UNIT'
       Generate floating-point arithmetic for selected unit UNIT.  The
       choices for UNIT are:
  
!     `387'
!           Use the standard 387 floating-point coprocessor present on
!           the majority of chips and emulated otherwise.  Code compiled
!           with this option runs almost everywhere.  The temporary
!           results are computed in 80-bit precision instead of the
!           precision specified by the type, resulting in slightly
!           different results compared to most of other chips.  See
!           `-ffloat-store' for more detailed description.
  
            This is the default choice for x86-32 targets.
  
!     `sse'
            Use scalar floating-point instructions present in the SSE
!           instruction set.  This instruction set is supported by
!           Pentium III and newer chips, and in the AMD line by Athlon-4,
!           Athlon XP and Athlon MP chips.  The earlier version of the SSE
            instruction set supports only single-precision arithmetic,
            thus the double and extended-precision arithmetic are still
            done using 387.  A later version, present only in Pentium 4
            and AMD x86-64 chips, supports double-precision arithmetic
            too.
  
!           For the x86-32 compiler, you must use `-march=CPU-TYPE',
!           `-msse' or `-msse2' switches to enable SSE extensions and
!           make this option effective.  For the x86-64 compiler, these
            extensions are enabled by default.
  
            The resulting code should be considerably faster in the
!           majority of cases and avoid the numerical instability
!           problems of 387 code, but may break some existing code that
!           expects temporaries to be 80 bits.
  
            This is the default choice for the x86-64 compiler.
  
!     `sse,387'
!     `sse+387'
!     `both'
            Attempt to utilize both instruction sets at once.  This
            effectively doubles the amount of available registers, and on
            chips with separate execution units for 387 and SSE the
--- 20413,20468 ----
            by this option will change to reflect the most current Intel
            processors at the time that version of GCC is released.
  
!           There is no '-march=intel' option because '-march' indicates
            the instruction set the compiler can use, and there is no
            common instruction set applicable to all processors.  In
!           contrast, '-mtune' indicates the processor (or, in this case,
            collection of processors) for which the code is optimized.
  
! '-mcpu=CPU-TYPE'
!      A deprecated synonym for '-mtune'.
  
! '-mfpmath=UNIT'
       Generate floating-point arithmetic for selected unit UNIT.  The
       choices for UNIT are:
  
!      '387'
!           Use the standard 387 floating-point coprocessor present on the
!           majority of chips and emulated otherwise.  Code compiled with
!           this option runs almost everywhere.  The temporary results are
!           computed in 80-bit precision instead of the precision
!           specified by the type, resulting in slightly different results
!           compared to most of other chips.  See '-ffloat-store' for more
!           detailed description.
  
            This is the default choice for x86-32 targets.
  
!      'sse'
            Use scalar floating-point instructions present in the SSE
!           instruction set.  This instruction set is supported by Pentium
!           III and newer chips, and in the AMD line by Athlon-4, Athlon
!           XP and Athlon MP chips.  The earlier version of the SSE
            instruction set supports only single-precision arithmetic,
            thus the double and extended-precision arithmetic are still
            done using 387.  A later version, present only in Pentium 4
            and AMD x86-64 chips, supports double-precision arithmetic
            too.
  
!           For the x86-32 compiler, you must use '-march=CPU-TYPE',
!           '-msse' or '-msse2' switches to enable SSE extensions and make
!           this option effective.  For the x86-64 compiler, these
            extensions are enabled by default.
  
            The resulting code should be considerably faster in the
!           majority of cases and avoid the numerical instability problems
!           of 387 code, but may break some existing code that expects
!           temporaries to be 80 bits.
  
            This is the default choice for the x86-64 compiler.
  
!      'sse,387'
!      'sse+387'
!      'both'
            Attempt to utilize both instruction sets at once.  This
            effectively doubles the amount of available registers, and on
            chips with separate execution units for 387 and SSE the
*************** These `-m' options are defined for the x
*** 20580,20763 ****
            not model separate functional units well, resulting in
            unstable performance.
  
! `-masm=DIALECT'
       Output assembly instructions using selected DIALECT.  Also affects
!      which dialect is used for basic `asm' (*note Basic Asm::) and
!      extended `asm' (*note Extended Asm::). Supported choices (in
!      dialect order) are `att' or `intel'. The default is `att'. Darwin
!      does not support `intel'.
  
! `-mieee-fp'
! `-mno-ieee-fp'
       Control whether or not the compiler uses IEEE floating-point
       comparisons.  These correctly handle the case where the result of a
       comparison is unordered.
  
! `-msoft-float'
       Generate output containing library calls for floating point.
  
       *Warning:* the requisite libraries are not part of GCC.  Normally
!      the facilities of the machine's usual C compiler are used, but
!      this can't be done directly in cross-compilation.  You must make
!      your own arrangements to provide suitable library functions for
       cross-compilation.
  
       On machines where a function returns floating-point results in the
       80387 register stack, some floating-point opcodes may be emitted
!      even if `-msoft-float' is used.
  
! `-mno-fp-ret-in-387'
       Do not use the FPU registers for return values of functions.
  
       The usual calling convention has functions return values of types
!      `float' and `double' in an FPU register, even if there is no FPU.
       The idea is that the operating system should emulate an FPU.
  
!      The option `-mno-fp-ret-in-387' causes such values to be returned
       in ordinary CPU registers instead.
  
! `-mno-fancy-math-387'
!      Some 387 emulators do not support the `sin', `cos' and `sqrt'
       instructions for the 387.  Specify this option to avoid generating
       those instructions.  This option is the default on OpenBSD and
!      NetBSD.  This option is overridden when `-march' indicates that
!      the target CPU always has an FPU and so the instruction does not
!      need emulation.  These instructions are not generated unless you
!      also use the `-funsafe-math-optimizations' switch.
  
! `-malign-double'
! `-mno-align-double'
!      Control whether GCC aligns `double', `long double', and `long
!      long' variables on a two-word boundary or a one-word boundary.
!      Aligning `double' variables on a two-word boundary produces code
!      that runs somewhat faster on a Pentium at the expense of more
!      memory.
  
!      On x86-64, `-malign-double' is enabled by default.
  
!      *Warning:* if you use the `-malign-double' switch, structures
       containing the above types are aligned differently than the
       published application binary interface specifications for the
       x86-32 and are not binary compatible with structures in code
       compiled without that switch.
  
! `-m96bit-long-double'
! `-m128bit-long-double'
!      These switches control the size of `long double' type.  The x86-32
       application binary interface specifies the size to be 96 bits, so
!      `-m96bit-long-double' is the default in 32-bit mode.
  
!      Modern architectures (Pentium and newer) prefer `long double' to
!      be aligned to an 8- or 16-byte boundary.  In arrays or structures
       conforming to the ABI, this is not possible.  So specifying
!      `-m128bit-long-double' aligns `long double' to a 16-byte boundary
!      by padding the `long double' with an additional 32-bit zero.
  
!      In the x86-64 compiler, `-m128bit-long-double' is the default
!      choice as its ABI specifies that `long double' is aligned on
       16-byte boundary.
  
       Notice that neither of these options enable any extra precision
!      over the x87 standard of 80 bits for a `long double'.
  
       *Warning:* if you override the default value for your target ABI,
!      this changes the size of structures and arrays containing `long
       double' variables, as well as modifying the function calling
!      convention for functions taking `long double'.  Hence they are not
       binary-compatible with code compiled without that switch.
  
! `-mlong-double-64'
! `-mlong-double-80'
! `-mlong-double-128'
!      These switches control the size of `long double' type. A size of
!      64 bits makes the `long double' type equivalent to the `double'
!      type. This is the default for 32-bit Bionic C library.  A size of
!      128 bits makes the `long double' type equivalent to the
!      `__float128' type. This is the default for 64-bit Bionic C library.
  
       *Warning:* if you override the default value for your target ABI,
!      this changes the size of structures and arrays containing `long
       double' variables, as well as modifying the function calling
!      convention for functions taking `long double'.  Hence they are not
       binary-compatible with code compiled without that switch.
  
! `-malign-data=TYPE'
       Control how GCC aligns variables.  Supported values for TYPE are
!      `compat' uses increased alignment value compatible uses GCC 4.8
!      and earlier, `abi' uses alignment value as specified by the psABI,
!      and `cacheline' uses increased alignment value to match the cache
!      line size.  `compat' is the default.
  
! `-mlarge-data-threshold=THRESHOLD'
!      When `-mcmodel=medium' is specified, data objects larger than
!      THRESHOLD are placed in the large data section.  This value must
!      be the same across all objects linked into the binary, and
!      defaults to 65535.
  
! `-mrtd'
       Use a different function-calling convention, in which functions
!      that take a fixed number of arguments return with the `ret NUM'
       instruction, which pops their arguments while returning.  This
       saves one instruction in the caller since there is no need to pop
       the arguments there.
  
       You can specify that an individual function is called with this
!      calling sequence with the function attribute `stdcall'.  You can
!      also override the `-mrtd' option by using the function attribute
!      `cdecl'.  *Note Function Attributes::.
  
       *Warning:* this calling convention is incompatible with the one
       normally used on Unix, so you cannot use it if you need to call
       libraries compiled with the Unix compiler.
  
       Also, you must provide function prototypes for all functions that
!      take variable numbers of arguments (including `printf'); otherwise
       incorrect code is generated for calls to those functions.
  
       In addition, seriously incorrect code results if you call a
       function with too many arguments.  (Normally, extra arguments are
       harmlessly ignored.)
  
! `-mregparm=NUM'
       Control how many registers are used to pass integer arguments.  By
       default, no registers are used to pass arguments, and at most 3
       registers can be used.  You can control this behavior for a
!      specific function by using the function attribute `regparm'.
!      *Note Function Attributes::.
  
       *Warning:* if you use this switch, and NUM is nonzero, then you
       must build all modules with the same value, including any
       libraries.  This includes the system libraries and startup modules.
  
! `-msseregparm'
       Use SSE register passing conventions for float and double arguments
       and return values.  You can control this behavior for a specific
!      function by using the function attribute `sseregparm'.  *Note
       Function Attributes::.
  
       *Warning:* if you use this switch then you must build all modules
       with the same value, including any libraries.  This includes the
       system libraries and startup modules.
  
! `-mvect8-ret-in-mem'
       Return 8-byte vectors in memory instead of MMX registers.  This is
       the default on Solaris 8 and 9 and VxWorks to match the ABI of the
       Sun Studio compilers until version 12.  Later compiler versions
!      (starting with Studio 12 Update 1) follow the ABI used by other
!      x86 targets, which is the default on Solaris 10 and later.  _Only_
!      use this option if you need to remain compatible with existing
!      code produced by those previous compiler versions or older
!      versions of GCC.
  
- `-mpc32'
- `-mpc64'
- `-mpc80'
       Set 80387 floating-point precision to 32, 64 or 80 bits.  When
!      `-mpc32' is specified, the significands of results of
       floating-point operations are rounded to 24 bits (single
!      precision); `-mpc64' rounds the significands of results of
       floating-point operations to 53 bits (double precision) and
!      `-mpc80' rounds the significands of results of floating-point
       operations to 64 bits (extended double precision), which is the
       default.  When this option is used, floating-point operations in
       higher precisions are not available to the programmer without
--- 20471,20655 ----
            not model separate functional units well, resulting in
            unstable performance.
  
! '-masm=DIALECT'
       Output assembly instructions using selected DIALECT.  Also affects
!      which dialect is used for basic 'asm' (*note Basic Asm::) and
!      extended 'asm' (*note Extended Asm::).  Supported choices (in
!      dialect order) are 'att' or 'intel'.  The default is 'att'.  Darwin
!      does not support 'intel'.
  
! '-mieee-fp'
! '-mno-ieee-fp'
       Control whether or not the compiler uses IEEE floating-point
       comparisons.  These correctly handle the case where the result of a
       comparison is unordered.
  
! '-msoft-float'
       Generate output containing library calls for floating point.
  
       *Warning:* the requisite libraries are not part of GCC.  Normally
!      the facilities of the machine's usual C compiler are used, but this
!      can't be done directly in cross-compilation.  You must make your
!      own arrangements to provide suitable library functions for
       cross-compilation.
  
       On machines where a function returns floating-point results in the
       80387 register stack, some floating-point opcodes may be emitted
!      even if '-msoft-float' is used.
  
! '-mno-fp-ret-in-387'
       Do not use the FPU registers for return values of functions.
  
       The usual calling convention has functions return values of types
!      'float' and 'double' in an FPU register, even if there is no FPU.
       The idea is that the operating system should emulate an FPU.
  
!      The option '-mno-fp-ret-in-387' causes such values to be returned
       in ordinary CPU registers instead.
  
! '-mno-fancy-math-387'
!      Some 387 emulators do not support the 'sin', 'cos' and 'sqrt'
       instructions for the 387.  Specify this option to avoid generating
       those instructions.  This option is the default on OpenBSD and
!      NetBSD.  This option is overridden when '-march' indicates that the
!      target CPU always has an FPU and so the instruction does not need
!      emulation.  These instructions are not generated unless you also
!      use the '-funsafe-math-optimizations' switch.
  
! '-malign-double'
! '-mno-align-double'
!      Control whether GCC aligns 'double', 'long double', and 'long long'
!      variables on a two-word boundary or a one-word boundary.  Aligning
!      'double' variables on a two-word boundary produces code that runs
!      somewhat faster on a Pentium at the expense of more memory.
  
!      On x86-64, '-malign-double' is enabled by default.
  
!      *Warning:* if you use the '-malign-double' switch, structures
       containing the above types are aligned differently than the
       published application binary interface specifications for the
       x86-32 and are not binary compatible with structures in code
       compiled without that switch.
  
! '-m96bit-long-double'
! '-m128bit-long-double'
!      These switches control the size of 'long double' type.  The x86-32
       application binary interface specifies the size to be 96 bits, so
!      '-m96bit-long-double' is the default in 32-bit mode.
  
!      Modern architectures (Pentium and newer) prefer 'long double' to be
!      aligned to an 8- or 16-byte boundary.  In arrays or structures
       conforming to the ABI, this is not possible.  So specifying
!      '-m128bit-long-double' aligns 'long double' to a 16-byte boundary
!      by padding the 'long double' with an additional 32-bit zero.
  
!      In the x86-64 compiler, '-m128bit-long-double' is the default
!      choice as its ABI specifies that 'long double' is aligned on
       16-byte boundary.
  
       Notice that neither of these options enable any extra precision
!      over the x87 standard of 80 bits for a 'long double'.
  
       *Warning:* if you override the default value for your target ABI,
!      this changes the size of structures and arrays containing 'long
       double' variables, as well as modifying the function calling
!      convention for functions taking 'long double'.  Hence they are not
       binary-compatible with code compiled without that switch.
  
! '-mlong-double-64'
! '-mlong-double-80'
! '-mlong-double-128'
!      These switches control the size of 'long double' type.  A size of
!      64 bits makes the 'long double' type equivalent to the 'double'
!      type.  This is the default for 32-bit Bionic C library.  A size of
!      128 bits makes the 'long double' type equivalent to the
!      '__float128' type.  This is the default for 64-bit Bionic C
!      library.
  
       *Warning:* if you override the default value for your target ABI,
!      this changes the size of structures and arrays containing 'long
       double' variables, as well as modifying the function calling
!      convention for functions taking 'long double'.  Hence they are not
       binary-compatible with code compiled without that switch.
  
! '-malign-data=TYPE'
       Control how GCC aligns variables.  Supported values for TYPE are
!      'compat' uses increased alignment value compatible uses GCC 4.8 and
!      earlier, 'abi' uses alignment value as specified by the psABI, and
!      'cacheline' uses increased alignment value to match the cache line
!      size.  'compat' is the default.
  
! '-mlarge-data-threshold=THRESHOLD'
!      When '-mcmodel=medium' is specified, data objects larger than
!      THRESHOLD are placed in the large data section.  This value must be
!      the same across all objects linked into the binary, and defaults to
!      65535.
  
! '-mrtd'
       Use a different function-calling convention, in which functions
!      that take a fixed number of arguments return with the 'ret NUM'
       instruction, which pops their arguments while returning.  This
       saves one instruction in the caller since there is no need to pop
       the arguments there.
  
       You can specify that an individual function is called with this
!      calling sequence with the function attribute 'stdcall'.  You can
!      also override the '-mrtd' option by using the function attribute
!      'cdecl'.  *Note Function Attributes::.
  
       *Warning:* this calling convention is incompatible with the one
       normally used on Unix, so you cannot use it if you need to call
       libraries compiled with the Unix compiler.
  
       Also, you must provide function prototypes for all functions that
!      take variable numbers of arguments (including 'printf'); otherwise
       incorrect code is generated for calls to those functions.
  
       In addition, seriously incorrect code results if you call a
       function with too many arguments.  (Normally, extra arguments are
       harmlessly ignored.)
  
! '-mregparm=NUM'
       Control how many registers are used to pass integer arguments.  By
       default, no registers are used to pass arguments, and at most 3
       registers can be used.  You can control this behavior for a
!      specific function by using the function attribute 'regparm'.  *Note
!      Function Attributes::.
  
       *Warning:* if you use this switch, and NUM is nonzero, then you
       must build all modules with the same value, including any
       libraries.  This includes the system libraries and startup modules.
  
! '-msseregparm'
       Use SSE register passing conventions for float and double arguments
       and return values.  You can control this behavior for a specific
!      function by using the function attribute 'sseregparm'.  *Note
       Function Attributes::.
  
       *Warning:* if you use this switch then you must build all modules
       with the same value, including any libraries.  This includes the
       system libraries and startup modules.
  
! '-mvect8-ret-in-mem'
       Return 8-byte vectors in memory instead of MMX registers.  This is
       the default on Solaris 8 and 9 and VxWorks to match the ABI of the
       Sun Studio compilers until version 12.  Later compiler versions
!      (starting with Studio 12 Update 1) follow the ABI used by other x86
!      targets, which is the default on Solaris 10 and later.  _Only_ use
!      this option if you need to remain compatible with existing code
!      produced by those previous compiler versions or older versions of
!      GCC.
! 
! '-mpc32'
! '-mpc64'
! '-mpc80'
  
       Set 80387 floating-point precision to 32, 64 or 80 bits.  When
!      '-mpc32' is specified, the significands of results of
       floating-point operations are rounded to 24 bits (single
!      precision); '-mpc64' rounds the significands of results of
       floating-point operations to 53 bits (double precision) and
!      '-mpc80' rounds the significands of results of floating-point
       operations to 64 bits (extended double precision), which is the
       default.  When this option is used, floating-point operations in
       higher precisions are not available to the programmer without
*************** These `-m' options are defined for the x
*** 20765,20794 ****
  
       Setting the rounding of floating-point operations to less than the
       default 80 bits can speed some programs by 2% or more.  Note that
!      some mathematical libraries assume that extended-precision
!      (80-bit) floating-point operations are enabled by default;
!      routines in such libraries could suffer significant loss of
!      accuracy, typically through so-called "catastrophic cancellation",
!      when this option is used to set the precision to less than
!      extended precision.
  
! `-mstackrealign'
!      Realign the stack at entry.  On the x86, the `-mstackrealign'
       option generates an alternate prologue and epilogue that realigns
!      the run-time stack if necessary.  This supports mixing legacy
!      codes that keep 4-byte stack alignment with modern codes that keep
       16-byte stack alignment for SSE compatibility.  See also the
!      attribute `force_align_arg_pointer', applicable to individual
       functions.
  
! `-mpreferred-stack-boundary=NUM'
       Attempt to keep the stack boundary aligned to a 2 raised to NUM
!      byte boundary.  If `-mpreferred-stack-boundary' is not specified,
       the default is 4 (16 bytes or 128 bits).
  
       *Warning:* When generating code for the x86-64 architecture with
!      SSE extensions disabled, `-mpreferred-stack-boundary=3' can be
!      used to keep the stack boundary aligned to 8 byte boundary.  Since
       x86-64 ABI require 16 byte stack alignment, this is ABI
       incompatible and intended to be used in controlled environment
       where stack space is important limitation.  This option leads to
--- 20657,20685 ----
  
       Setting the rounding of floating-point operations to less than the
       default 80 bits can speed some programs by 2% or more.  Note that
!      some mathematical libraries assume that extended-precision (80-bit)
!      floating-point operations are enabled by default; routines in such
!      libraries could suffer significant loss of accuracy, typically
!      through so-called "catastrophic cancellation", when this option is
!      used to set the precision to less than extended precision.
  
! '-mstackrealign'
!      Realign the stack at entry.  On the x86, the '-mstackrealign'
       option generates an alternate prologue and epilogue that realigns
!      the run-time stack if necessary.  This supports mixing legacy codes
!      that keep 4-byte stack alignment with modern codes that keep
       16-byte stack alignment for SSE compatibility.  See also the
!      attribute 'force_align_arg_pointer', applicable to individual
       functions.
  
! '-mpreferred-stack-boundary=NUM'
       Attempt to keep the stack boundary aligned to a 2 raised to NUM
!      byte boundary.  If '-mpreferred-stack-boundary' is not specified,
       the default is 4 (16 bytes or 128 bits).
  
       *Warning:* When generating code for the x86-64 architecture with
!      SSE extensions disabled, '-mpreferred-stack-boundary=3' can be used
!      to keep the stack boundary aligned to 8 byte boundary.  Since
       x86-64 ABI require 16 byte stack alignment, this is ABI
       incompatible and intended to be used in controlled environment
       where stack space is important limitation.  This option leads to
*************** These `-m' options are defined for the x
*** 20798,20921 ****
       misaligned memory access traps.  In addition, variable arguments
       are handled incorrectly for 16 byte aligned objects (including x87
       long double and __int128), leading to wrong results.  You must
!      build all modules with `-mpreferred-stack-boundary=3', including
       any libraries.  This includes the system libraries and startup
       modules.
  
! `-mincoming-stack-boundary=NUM'
       Assume the incoming stack is aligned to a 2 raised to NUM byte
!      boundary.  If `-mincoming-stack-boundary' is not specified, the
!      one specified by `-mpreferred-stack-boundary' is used.
  
!      On Pentium and Pentium Pro, `double' and `long double' values
!      should be aligned to an 8-byte boundary (see `-malign-double') or
!      suffer significant run time performance penalties.  On Pentium
!      III, the Streaming SIMD Extension (SSE) data type `__m128' may not
!      work properly if it is not 16-byte aligned.
  
       To ensure proper alignment of this values on the stack, the stack
!      boundary must be as aligned as that required by any value stored
!      on the stack.  Further, every function must be generated such that
!      it keeps the stack aligned.  Thus calling a function compiled with
!      a higher preferred stack boundary from a function compiled with a
!      lower preferred stack boundary most likely misaligns the stack.
!      It is recommended that libraries that use callbacks always use the
       default setting.
  
       This extra alignment does consume extra stack space, and generally
       increases code size.  Code that is sensitive to stack space usage,
       such as embedded systems and operating system kernels, may want to
!      reduce the preferred alignment to `-mpreferred-stack-boundary=2'.
  
! `-mmmx'
! `-msse'
! `-msse2'
! `-msse3'
! `-mssse3'
! `-msse4'
! `-msse4a'
! `-msse4.1'
! `-msse4.2'
! `-mavx'
! `-mavx2'
! `-mavx512f'
! `-mavx512pf'
! `-mavx512er'
! `-mavx512cd'
! `-msha'
! `-maes'
! `-mpclmul'
! `-mclfushopt'
! `-mfsgsbase'
! `-mrdrnd'
! `-mf16c'
! `-mfma'
! `-mfma4'
! `-mno-fma4'
! `-mprefetchwt1'
! `-mxop'
! `-mlwp'
! `-m3dnow'
! `-mpopcnt'
! `-mabm'
! `-mbmi'
! `-mbmi2'
! `-mlzcnt'
! `-mfxsr'
! `-mxsave'
! `-mxsaveopt'
! `-mxsavec'
! `-mxsaves'
! `-mrtm'
! `-mtbm'
! `-mmpx'
! `-mmwaitx'
       These switches enable the use of instructions in the MMX, SSE,
       SSE2, SSE3, SSSE3, SSE4.1, AVX, AVX2, AVX512F, AVX512PF, AVX512ER,
       AVX512CD, SHA, AES, PCLMUL, FSGSBASE, RDRND, F16C, FMA, SSE4A,
       FMA4, XOP, LWP, ABM, BMI, BMI2, FXSR, XSAVE, XSAVEOPT, LZCNT, RTM,
!      MPX, MWAITX or 3DNow!  extended instruction sets.  Each has a
!      corresponding `-mno-' option to disable use of these instructions.
  
       These extensions are also available as built-in functions: see
       *note x86 Built-in Functions::, for details of the functions
       enabled and disabled by these switches.
  
       To generate SSE/SSE2 instructions automatically from floating-point
!      code (as opposed to 387 instructions), see `-mfpmath=sse'.
  
!      GCC depresses SSEx instructions when `-mavx' is used. Instead, it
       generates new AVX instructions or AVX equivalence for all SSEx
       instructions when needed.
  
       These options enable GCC to use these extended instructions in
!      generated code, even without `-mfpmath=sse'.  Applications that
       perform run-time CPU detection must compile separate files for each
       supported architecture, using the appropriate flags.  In
       particular, the file containing the CPU detection code should be
       compiled without these options.
  
! `-mdump-tune-features'
       This option instructs GCC to dump the names of the x86 performance
!      tuning features and default settings. The names can be used in
!      `-mtune-ctrl=FEATURE-LIST'.
  
! `-mtune-ctrl=FEATURE-LIST'
!      This option is used to do fine grain control of x86 code
!      generation features.  FEATURE-LIST is a comma separated list of
!      FEATURE names. See also `-mdump-tune-features'. When specified,
!      the FEATURE is turned on if it is not preceded with `^',
!      otherwise, it is turned off.  `-mtune-ctrl=FEATURE-LIST' is
!      intended to be used by GCC developers. Using it may lead to code
!      paths not covered by testing and can potentially result in
!      compiler ICEs or runtime errors.
  
! `-mno-default'
!      This option instructs GCC to turn off all tunable features. See
!      also `-mtune-ctrl=FEATURE-LIST' and `-mdump-tune-features'.
  
! `-mcld'
!      This option instructs GCC to emit a `cld' instruction in the
       prologue of functions that use string instructions.  String
       instructions depend on the DF flag to select between autoincrement
       or autodecrement mode.  While the ABI specifies the DF flag to be
--- 20689,20811 ----
       misaligned memory access traps.  In addition, variable arguments
       are handled incorrectly for 16 byte aligned objects (including x87
       long double and __int128), leading to wrong results.  You must
!      build all modules with '-mpreferred-stack-boundary=3', including
       any libraries.  This includes the system libraries and startup
       modules.
  
! '-mincoming-stack-boundary=NUM'
       Assume the incoming stack is aligned to a 2 raised to NUM byte
!      boundary.  If '-mincoming-stack-boundary' is not specified, the one
!      specified by '-mpreferred-stack-boundary' is used.
  
!      On Pentium and Pentium Pro, 'double' and 'long double' values
!      should be aligned to an 8-byte boundary (see '-malign-double') or
!      suffer significant run time performance penalties.  On Pentium III,
!      the Streaming SIMD Extension (SSE) data type '__m128' may not work
!      properly if it is not 16-byte aligned.
  
       To ensure proper alignment of this values on the stack, the stack
!      boundary must be as aligned as that required by any value stored on
!      the stack.  Further, every function must be generated such that it
!      keeps the stack aligned.  Thus calling a function compiled with a
!      higher preferred stack boundary from a function compiled with a
!      lower preferred stack boundary most likely misaligns the stack.  It
!      is recommended that libraries that use callbacks always use the
       default setting.
  
       This extra alignment does consume extra stack space, and generally
       increases code size.  Code that is sensitive to stack space usage,
       such as embedded systems and operating system kernels, may want to
!      reduce the preferred alignment to '-mpreferred-stack-boundary=2'.
  
! '-mmmx'
! '-msse'
! '-msse2'
! '-msse3'
! '-mssse3'
! '-msse4'
! '-msse4a'
! '-msse4.1'
! '-msse4.2'
! '-mavx'
! '-mavx2'
! '-mavx512f'
! '-mavx512pf'
! '-mavx512er'
! '-mavx512cd'
! '-msha'
! '-maes'
! '-mpclmul'
! '-mclfushopt'
! '-mfsgsbase'
! '-mrdrnd'
! '-mf16c'
! '-mfma'
! '-mfma4'
! '-mno-fma4'
! '-mprefetchwt1'
! '-mxop'
! '-mlwp'
! '-m3dnow'
! '-mpopcnt'
! '-mabm'
! '-mbmi'
! '-mbmi2'
! '-mlzcnt'
! '-mfxsr'
! '-mxsave'
! '-mxsaveopt'
! '-mxsavec'
! '-mxsaves'
! '-mrtm'
! '-mtbm'
! '-mmpx'
! '-mmwaitx'
       These switches enable the use of instructions in the MMX, SSE,
       SSE2, SSE3, SSSE3, SSE4.1, AVX, AVX2, AVX512F, AVX512PF, AVX512ER,
       AVX512CD, SHA, AES, PCLMUL, FSGSBASE, RDRND, F16C, FMA, SSE4A,
       FMA4, XOP, LWP, ABM, BMI, BMI2, FXSR, XSAVE, XSAVEOPT, LZCNT, RTM,
!      MPX, MWAITX or 3DNow! extended instruction sets.  Each has a
!      corresponding '-mno-' option to disable use of these instructions.
  
       These extensions are also available as built-in functions: see
       *note x86 Built-in Functions::, for details of the functions
       enabled and disabled by these switches.
  
       To generate SSE/SSE2 instructions automatically from floating-point
!      code (as opposed to 387 instructions), see '-mfpmath=sse'.
  
!      GCC depresses SSEx instructions when '-mavx' is used.  Instead, it
       generates new AVX instructions or AVX equivalence for all SSEx
       instructions when needed.
  
       These options enable GCC to use these extended instructions in
!      generated code, even without '-mfpmath=sse'.  Applications that
       perform run-time CPU detection must compile separate files for each
       supported architecture, using the appropriate flags.  In
       particular, the file containing the CPU detection code should be
       compiled without these options.
  
! '-mdump-tune-features'
       This option instructs GCC to dump the names of the x86 performance
!      tuning features and default settings.  The names can be used in
!      '-mtune-ctrl=FEATURE-LIST'.
  
! '-mtune-ctrl=FEATURE-LIST'
!      This option is used to do fine grain control of x86 code generation
!      features.  FEATURE-LIST is a comma separated list of FEATURE names.
!      See also '-mdump-tune-features'.  When specified, the FEATURE is
!      turned on if it is not preceded with '^', otherwise, it is turned
!      off.  '-mtune-ctrl=FEATURE-LIST' is intended to be used by GCC
!      developers.  Using it may lead to code paths not covered by testing
!      and can potentially result in compiler ICEs or runtime errors.
  
! '-mno-default'
!      This option instructs GCC to turn off all tunable features.  See
!      also '-mtune-ctrl=FEATURE-LIST' and '-mdump-tune-features'.
  
! '-mcld'
!      This option instructs GCC to emit a 'cld' instruction in the
       prologue of functions that use string instructions.  String
       instructions depend on the DF flag to select between autoincrement
       or autodecrement mode.  While the ABI specifies the DF flag to be
*************** These `-m' options are defined for the x
*** 20924,21269 ****
       dispatchers.  The exception handler can be invoked with the DF flag
       set, which leads to wrong direction mode when string instructions
       are used.  This option can be enabled by default on 32-bit x86
!      targets by configuring GCC with the `--enable-cld' configure
!      option.  Generation of `cld' instructions can be suppressed with
!      the `-mno-cld' compiler option in this case.
  
! `-mvzeroupper'
!      This option instructs GCC to emit a `vzeroupper' instruction
!      before a transfer of control flow out of the function to minimize
!      the AVX to SSE transition penalty as well as remove unnecessary
!      `zeroupper' intrinsics.
  
! `-mprefer-avx128'
       This option instructs GCC to use 128-bit AVX instructions instead
       of 256-bit AVX instructions in the auto-vectorizer.
  
! `-mcx16'
!      This option enables GCC to generate `CMPXCHG16B' instructions.
!      `CMPXCHG16B' allows for atomic operations on 128-bit double
!      quadword (or oword) data types.  This is useful for
!      high-resolution counters that can be updated by multiple
!      processors (or cores).  This instruction is generated as part of
!      atomic built-in functions: see *note __sync Builtins:: or *note
!      __atomic Builtins:: for details.
  
! `-msahf'
!      This option enables generation of `SAHF' instructions in 64-bit
       code.  Early Intel Pentium 4 CPUs with Intel 64 support, prior to
       the introduction of Pentium 4 G1 step in December 2005, lacked the
!      `LAHF' and `SAHF' instructions which are supported by AMD64.
!      These are load and store instructions, respectively, for certain
!      status flags.  In 64-bit mode, the `SAHF' instruction is used to
!      optimize `fmod', `drem', and `remainder' built-in functions; see
!      *note Other Builtins:: for details.
  
! `-mmovbe'
!      This option enables use of the `movbe' instruction to implement
!      `__builtin_bswap32' and `__builtin_bswap64'.
  
! `-mcrc32'
!      This option enables built-in functions `__builtin_ia32_crc32qi',
!      `__builtin_ia32_crc32hi', `__builtin_ia32_crc32si' and
!      `__builtin_ia32_crc32di' to generate the `crc32' machine
       instruction.
  
! `-mrecip'
!      This option enables use of `RCPSS' and `RSQRTSS' instructions (and
!      their vectorized variants `RCPPS' and `RSQRTPS') with an
!      additional Newton-Raphson step to increase precision instead of
!      `DIVSS' and `SQRTSS' (and their vectorized variants) for
!      single-precision floating-point arguments.  These instructions are
!      generated only when `-funsafe-math-optimizations' is enabled
!      together with `-finite-math-only' and `-fno-trapping-math'.  Note
!      that while the throughput of the sequence is higher than the
!      throughput of the non-reciprocal instruction, the precision of the
!      sequence can be decreased by up to 2 ulp (i.e. the inverse of 1.0
!      equals 0.99999994).
  
!      Note that GCC implements `1.0f/sqrtf(X)' in terms of `RSQRTSS' (or
!      `RSQRTPS') already with `-ffast-math' (or the above option
!      combination), and doesn't need `-mrecip'.
  
       Also note that GCC emits the above sequence with additional
       Newton-Raphson step for vectorized single-float division and
!      vectorized `sqrtf(X)' already with `-ffast-math' (or the above
!      option combination), and doesn't need `-mrecip'.
  
! `-mrecip=OPT'
       This option controls which reciprocal estimate instructions may be
       used.  OPT is a comma-separated list of options, which may be
!      preceded by a `!' to invert the option:
  
!     `all'
            Enable all estimate instructions.
  
!     `default'
!           Enable the default instructions, equivalent to `-mrecip'.
  
!     `none'
!           Disable all estimate instructions, equivalent to `-mno-recip'.
  
!     `div'
            Enable the approximation for scalar division.
  
!     `vec-div'
            Enable the approximation for vectorized division.
  
!     `sqrt'
            Enable the approximation for scalar square root.
  
!     `vec-sqrt'
            Enable the approximation for vectorized square root.
  
!      So, for example, `-mrecip=all,!sqrt' enables all of the reciprocal
       approximations, except for square root.
  
! `-mveclibabi=TYPE'
       Specifies the ABI type to use for vectorizing intrinsics using an
!      external library.  Supported values for TYPE are `svml' for the
!      Intel short vector math library and `acml' for the AMD math core
!      library.  To use this option, both `-ftree-vectorize' and
!      `-funsafe-math-optimizations' have to be enabled, and an SVML or
       ACML ABI-compatible library must be specified at link time.
  
!      GCC currently emits calls to `vmldExp2', `vmldLn2', `vmldLog102',
!      `vmldLog102', `vmldPow2', `vmldTanh2', `vmldTan2', `vmldAtan2',
!      `vmldAtanh2', `vmldCbrt2', `vmldSinh2', `vmldSin2', `vmldAsinh2',
!      `vmldAsin2', `vmldCosh2', `vmldCos2', `vmldAcosh2', `vmldAcos2',
!      `vmlsExp4', `vmlsLn4', `vmlsLog104', `vmlsLog104', `vmlsPow4',
!      `vmlsTanh4', `vmlsTan4', `vmlsAtan4', `vmlsAtanh4', `vmlsCbrt4',
!      `vmlsSinh4', `vmlsSin4', `vmlsAsinh4', `vmlsAsin4', `vmlsCosh4',
!      `vmlsCos4', `vmlsAcosh4' and `vmlsAcos4' for corresponding
!      function type when `-mveclibabi=svml' is used, and `__vrd2_sin',
!      `__vrd2_cos', `__vrd2_exp', `__vrd2_log', `__vrd2_log2',
!      `__vrd2_log10', `__vrs4_sinf', `__vrs4_cosf', `__vrs4_expf',
!      `__vrs4_logf', `__vrs4_log2f', `__vrs4_log10f' and `__vrs4_powf'
!      for the corresponding function type when `-mveclibabi=acml' is
       used.
  
! `-mabi=NAME'
       Generate code for the specified calling convention.  Permissible
!      values are `sysv' for the ABI used on GNU/Linux and other systems,
!      and `ms' for the Microsoft ABI.  The default is to use the
!      Microsoft ABI when targeting Microsoft Windows and the SysV ABI on
!      all other systems.  You can control this behavior for specific
!      functions by using the function attributes `ms_abi' and `sysv_abi'.
!      *Note Function Attributes::.
  
! `-mtls-dialect=TYPE'
!      Generate code to access thread-local storage using the `gnu' or
!      `gnu2' conventions.  `gnu' is the conservative default; `gnu2' is
       more efficient, but it may add compile- and run-time requirements
       that cannot be satisfied on all systems.
  
! `-mpush-args'
! `-mno-push-args'
       Use PUSH operations to store outgoing parameters.  This method is
!      shorter and usually equally fast as method using SUB/MOV
!      operations and is enabled by default.  In some cases disabling it
!      may improve performance because of improved scheduling and reduced
       dependencies.
  
! `-maccumulate-outgoing-args'
       If enabled, the maximum amount of space required for outgoing
       arguments is computed in the function prologue.  This is faster on
       most modern CPUs because of reduced dependencies, improved
       scheduling and reduced stack usage when the preferred stack
       boundary is not equal to 2.  The drawback is a notable increase in
!      code size.  This switch implies `-mno-push-args'.
  
! `-mthreads'
!      Support thread-safe exception handling on MinGW.  Programs that
!      rely on thread-safe exception handling must compile and link all
!      code with the `-mthreads' option.  When compiling, `-mthreads'
!      defines `-D_MT'; when linking, it links in a special thread helper
!      library `-lmingwthrd' which cleans up per-thread
!      exception-handling data.
  
! `-mno-align-stringops'
       Do not align the destination of inlined string operations.  This
       switch reduces code size and improves performance in case the
       destination is already aligned, but GCC doesn't know about it.
  
! `-minline-all-stringops'
       By default GCC inlines string operations only when the destination
       is known to be aligned to least a 4-byte boundary.  This enables
       more inlining and increases code size, but may improve performance
!      of code that depends on fast `memcpy', `strlen', and `memset' for
       short lengths.
  
! `-minline-stringops-dynamically'
       For string operations of unknown size, use run-time checks with
       inline code for small blocks and a library call for large blocks.
  
! `-mstringop-strategy=ALG'
       Override the internal decision heuristic for the particular
       algorithm to use for inlining string operations.  The allowed
       values for ALG are:
  
!     `rep_byte'
!     `rep_4byte'
!     `rep_8byte'
!           Expand using i386 `rep' prefix of the specified size.
  
!     `byte_loop'
!     `loop'
!     `unrolled_loop'
            Expand into an inline loop.
  
!     `libcall'
            Always use a library call.
  
! `-mmemcpy-strategy=STRATEGY'
       Override the internal decision heuristic to decide if
!      `__builtin_memcpy' should be inlined and what inline algorithm to
!      use when the expected size of the copy operation is known. STRATEGY
!      is a comma-separated list of ALG:MAX_SIZE:DEST_ALIGN triplets.
!      ALG is specified in `-mstringop-strategy', MAX_SIZE specifies the
!      max byte size with which inline algorithm ALG is allowed.  For the
!      last triplet, the MAX_SIZE must be `-1'. The MAX_SIZE of the
!      triplets in the list must be specified in increasing order.  The
!      minimal byte size for ALG is `0' for the first triplet and
!      `MAX_SIZE + 1' of the preceding range.
  
! `-mmemset-strategy=STRATEGY'
!      The option is similar to `-mmemcpy-strategy=' except that it is to
!      control `__builtin_memset' expansion.
  
! `-momit-leaf-frame-pointer'
       Don't keep the frame pointer in a register for leaf functions.
       This avoids the instructions to save, set up, and restore frame
       pointers and makes an extra register available in leaf functions.
!      The option `-fomit-leaf-frame-pointer' removes the frame pointer
       for leaf functions, which might make debugging harder.
  
! `-mtls-direct-seg-refs'
! `-mno-tls-direct-seg-refs'
       Controls whether TLS variables may be accessed with offsets from
!      the TLS segment register (`%gs' for 32-bit, `%fs' for 64-bit), or
       whether the thread base pointer must be added.  Whether or not this
       is valid depends on the operating system, and whether it maps the
       segment to cover the entire TLS area.
  
       For systems that use the GNU C Library, the default is on.
  
! `-msse2avx'
! `-mno-sse2avx'
       Specify that the assembler should encode SSE instructions with VEX
!      prefix.  The option `-mavx' turns this on by default.
  
! `-mfentry'
! `-mno-fentry'
!      If profiling is active (`-pg'), put the profiling counter call
       before the prologue.  Note: On x86 architectures the attribute
!      `ms_hook_prologue' isn't possible at the moment for `-mfentry' and
!      `-pg'.
  
! `-mrecord-mcount'
! `-mno-record-mcount'
!      If profiling is active (`-pg'), generate a __mcount_loc section
!      that contains pointers to each profiling call. This is useful for
       automatically patching and out calls.
  
! `-mnop-mcount'
! `-mno-nop-mcount'
!      If profiling is active (`-pg'), generate the calls to the
!      profiling functions as nops. This is useful when they should be
!      patched in later dynamically. This is likely only useful together
!      with `-mrecord-mcount'.
  
! `-mskip-rax-setup'
! `-mno-skip-rax-setup'
       When generating code for the x86-64 architecture with SSE
!      extensions disabled, `-mskip-rax-setup' can be used to skip
!      setting up RAX register when there are no variable arguments
!      passed in vector registers.
  
!      *Warning:* Since RAX register is used to avoid unnecessarily
!      saving vector registers on stack when passing variable arguments,
!      the impacts of this option are callees may waste some stack space,
       misbehave or jump to a random location.  GCC 4.4 or newer don't
       have those issues, regardless the RAX register value.
  
! `-m8bit-idiv'
! `-mno-8bit-idiv'
       On some processors, like Intel Atom, 8-bit unsigned integer divide
       is much faster than 32-bit/64-bit integer divide.  This option
       generates a run-time check.  If both dividend and divisor are
       within range of 0 to 255, 8-bit unsigned integer divide is used
       instead of 32-bit/64-bit integer divide.
  
! `-mavx256-split-unaligned-load'
! `-mavx256-split-unaligned-store'
       Split 32-byte AVX unaligned load and store.
  
! `-mstack-protector-guard=GUARD'
       Generate stack protection code using canary at GUARD.  Supported
!      locations are `global' for global canary or `tls' for per-thread
!      canary in the TLS block (the default).  This option has effect
!      only when `-fstack-protector' or `-fstack-protector-all' is
!      specified.
! 
  
!  These `-m' switches are supported in addition to the above on x86-64
  processors in 64-bit environments.
  
! `-m32'
! `-m64'
! `-mx32'
! `-m16'
       Generate code for a 16-bit, 32-bit or 64-bit environment.  The
!      `-m32' option sets `int', `long', and pointer types to 32 bits, and
       generates code that runs on any i386 system.
  
!      The `-m64' option sets `int' to 32 bits and `long' and pointer
       types to 64 bits, and generates code for the x86-64 architecture.
!      For Darwin only the `-m64' option also turns off the `-fno-pic'
!      and `-mdynamic-no-pic' options.
  
!      The `-mx32' option sets `int', `long', and pointer types to 32
       bits, and generates code for the x86-64 architecture.
  
!      The `-m16' option is the same as `-m32', except for that it
!      outputs the `.code16gcc' assembly directive at the beginning of
!      the assembly output so that the binary can run in 16-bit mode.
  
! `-mno-red-zone'
!      Do not use a so-called "red zone" for x86-64 code.  The red zone
!      is mandated by the x86-64 ABI; it is a 128-byte area beyond the
       location of the stack pointer that is not modified by signal or
       interrupt handlers and therefore can be used for temporary data
!      without adjusting the stack pointer.  The flag `-mno-red-zone'
       disables this red zone.
  
! `-mcmodel=small'
!      Generate code for the small code model: the program and its
!      symbols must be linked in the lower 2 GB of the address space.
!      Pointers are 64 bits.  Programs can be statically or dynamically
!      linked.  This is the default code model.
  
! `-mcmodel=kernel'
       Generate code for the kernel code model.  The kernel runs in the
       negative 2 GB of the address space.  This model has to be used for
       Linux kernel code.
  
! `-mcmodel=medium'
       Generate code for the medium model: the program is linked in the
       lower 2 GB of the address space.  Small symbols are also placed
!      there.  Symbols with sizes larger than `-mlarge-data-threshold'
!      are put into large data or BSS sections and can be located above
!      2GB.  Programs can be statically or dynamically linked.
  
! `-mcmodel=large'
       Generate code for the large model.  This model makes no assumptions
       about addresses and sizes of sections.
  
! `-maddress-mode=long'
       Generate code for long address mode.  This is only supported for
       64-bit and x32 environments.  It is the default address mode for
       64-bit environments.
  
! `-maddress-mode=short'
       Generate code for short address mode.  This is only supported for
       32-bit and x32 environments.  It is the default address mode for
       32-bit and x32 environments.
--- 20814,21156 ----
       dispatchers.  The exception handler can be invoked with the DF flag
       set, which leads to wrong direction mode when string instructions
       are used.  This option can be enabled by default on 32-bit x86
!      targets by configuring GCC with the '--enable-cld' configure
!      option.  Generation of 'cld' instructions can be suppressed with
!      the '-mno-cld' compiler option in this case.
  
! '-mvzeroupper'
!      This option instructs GCC to emit a 'vzeroupper' instruction before
!      a transfer of control flow out of the function to minimize the AVX
!      to SSE transition penalty as well as remove unnecessary 'zeroupper'
!      intrinsics.
  
! '-mprefer-avx128'
       This option instructs GCC to use 128-bit AVX instructions instead
       of 256-bit AVX instructions in the auto-vectorizer.
  
! '-mcx16'
!      This option enables GCC to generate 'CMPXCHG16B' instructions.
!      'CMPXCHG16B' allows for atomic operations on 128-bit double
!      quadword (or oword) data types.  This is useful for high-resolution
!      counters that can be updated by multiple processors (or cores).
!      This instruction is generated as part of atomic built-in functions:
!      see *note __sync Builtins:: or *note __atomic Builtins:: for
!      details.
  
! '-msahf'
!      This option enables generation of 'SAHF' instructions in 64-bit
       code.  Early Intel Pentium 4 CPUs with Intel 64 support, prior to
       the introduction of Pentium 4 G1 step in December 2005, lacked the
!      'LAHF' and 'SAHF' instructions which are supported by AMD64.  These
!      are load and store instructions, respectively, for certain status
!      flags.  In 64-bit mode, the 'SAHF' instruction is used to optimize
!      'fmod', 'drem', and 'remainder' built-in functions; see *note Other
!      Builtins:: for details.
  
! '-mmovbe'
!      This option enables use of the 'movbe' instruction to implement
!      '__builtin_bswap32' and '__builtin_bswap64'.
  
! '-mcrc32'
!      This option enables built-in functions '__builtin_ia32_crc32qi',
!      '__builtin_ia32_crc32hi', '__builtin_ia32_crc32si' and
!      '__builtin_ia32_crc32di' to generate the 'crc32' machine
       instruction.
  
! '-mrecip'
!      This option enables use of 'RCPSS' and 'RSQRTSS' instructions (and
!      their vectorized variants 'RCPPS' and 'RSQRTPS') with an additional
!      Newton-Raphson step to increase precision instead of 'DIVSS' and
!      'SQRTSS' (and their vectorized variants) for single-precision
!      floating-point arguments.  These instructions are generated only
!      when '-funsafe-math-optimizations' is enabled together with
!      '-finite-math-only' and '-fno-trapping-math'.  Note that while the
!      throughput of the sequence is higher than the throughput of the
!      non-reciprocal instruction, the precision of the sequence can be
!      decreased by up to 2 ulp (i.e.  the inverse of 1.0 equals
!      0.99999994).
  
!      Note that GCC implements '1.0f/sqrtf(X)' in terms of 'RSQRTSS' (or
!      'RSQRTPS') already with '-ffast-math' (or the above option
!      combination), and doesn't need '-mrecip'.
  
       Also note that GCC emits the above sequence with additional
       Newton-Raphson step for vectorized single-float division and
!      vectorized 'sqrtf(X)' already with '-ffast-math' (or the above
!      option combination), and doesn't need '-mrecip'.
  
! '-mrecip=OPT'
       This option controls which reciprocal estimate instructions may be
       used.  OPT is a comma-separated list of options, which may be
!      preceded by a '!' to invert the option:
  
!      'all'
            Enable all estimate instructions.
  
!      'default'
!           Enable the default instructions, equivalent to '-mrecip'.
  
!      'none'
!           Disable all estimate instructions, equivalent to '-mno-recip'.
  
!      'div'
            Enable the approximation for scalar division.
  
!      'vec-div'
            Enable the approximation for vectorized division.
  
!      'sqrt'
            Enable the approximation for scalar square root.
  
!      'vec-sqrt'
            Enable the approximation for vectorized square root.
  
!      So, for example, '-mrecip=all,!sqrt' enables all of the reciprocal
       approximations, except for square root.
  
! '-mveclibabi=TYPE'
       Specifies the ABI type to use for vectorizing intrinsics using an
!      external library.  Supported values for TYPE are 'svml' for the
!      Intel short vector math library and 'acml' for the AMD math core
!      library.  To use this option, both '-ftree-vectorize' and
!      '-funsafe-math-optimizations' have to be enabled, and an SVML or
       ACML ABI-compatible library must be specified at link time.
  
!      GCC currently emits calls to 'vmldExp2', 'vmldLn2', 'vmldLog102',
!      'vmldLog102', 'vmldPow2', 'vmldTanh2', 'vmldTan2', 'vmldAtan2',
!      'vmldAtanh2', 'vmldCbrt2', 'vmldSinh2', 'vmldSin2', 'vmldAsinh2',
!      'vmldAsin2', 'vmldCosh2', 'vmldCos2', 'vmldAcosh2', 'vmldAcos2',
!      'vmlsExp4', 'vmlsLn4', 'vmlsLog104', 'vmlsLog104', 'vmlsPow4',
!      'vmlsTanh4', 'vmlsTan4', 'vmlsAtan4', 'vmlsAtanh4', 'vmlsCbrt4',
!      'vmlsSinh4', 'vmlsSin4', 'vmlsAsinh4', 'vmlsAsin4', 'vmlsCosh4',
!      'vmlsCos4', 'vmlsAcosh4' and 'vmlsAcos4' for corresponding function
!      type when '-mveclibabi=svml' is used, and '__vrd2_sin',
!      '__vrd2_cos', '__vrd2_exp', '__vrd2_log', '__vrd2_log2',
!      '__vrd2_log10', '__vrs4_sinf', '__vrs4_cosf', '__vrs4_expf',
!      '__vrs4_logf', '__vrs4_log2f', '__vrs4_log10f' and '__vrs4_powf'
!      for the corresponding function type when '-mveclibabi=acml' is
       used.
  
! '-mabi=NAME'
       Generate code for the specified calling convention.  Permissible
!      values are 'sysv' for the ABI used on GNU/Linux and other systems,
!      and 'ms' for the Microsoft ABI. The default is to use the Microsoft
!      ABI when targeting Microsoft Windows and the SysV ABI on all other
!      systems.  You can control this behavior for specific functions by
!      using the function attributes 'ms_abi' and 'sysv_abi'.  *Note
!      Function Attributes::.
  
! '-mtls-dialect=TYPE'
!      Generate code to access thread-local storage using the 'gnu' or
!      'gnu2' conventions.  'gnu' is the conservative default; 'gnu2' is
       more efficient, but it may add compile- and run-time requirements
       that cannot be satisfied on all systems.
  
! '-mpush-args'
! '-mno-push-args'
       Use PUSH operations to store outgoing parameters.  This method is
!      shorter and usually equally fast as method using SUB/MOV operations
!      and is enabled by default.  In some cases disabling it may improve
!      performance because of improved scheduling and reduced
       dependencies.
  
! '-maccumulate-outgoing-args'
       If enabled, the maximum amount of space required for outgoing
       arguments is computed in the function prologue.  This is faster on
       most modern CPUs because of reduced dependencies, improved
       scheduling and reduced stack usage when the preferred stack
       boundary is not equal to 2.  The drawback is a notable increase in
!      code size.  This switch implies '-mno-push-args'.
  
! '-mthreads'
!      Support thread-safe exception handling on MinGW. Programs that rely
!      on thread-safe exception handling must compile and link all code
!      with the '-mthreads' option.  When compiling, '-mthreads' defines
!      '-D_MT'; when linking, it links in a special thread helper library
!      '-lmingwthrd' which cleans up per-thread exception-handling data.
  
! '-mno-align-stringops'
       Do not align the destination of inlined string operations.  This
       switch reduces code size and improves performance in case the
       destination is already aligned, but GCC doesn't know about it.
  
! '-minline-all-stringops'
       By default GCC inlines string operations only when the destination
       is known to be aligned to least a 4-byte boundary.  This enables
       more inlining and increases code size, but may improve performance
!      of code that depends on fast 'memcpy', 'strlen', and 'memset' for
       short lengths.
  
! '-minline-stringops-dynamically'
       For string operations of unknown size, use run-time checks with
       inline code for small blocks and a library call for large blocks.
  
! '-mstringop-strategy=ALG'
       Override the internal decision heuristic for the particular
       algorithm to use for inlining string operations.  The allowed
       values for ALG are:
  
!      'rep_byte'
!      'rep_4byte'
!      'rep_8byte'
!           Expand using i386 'rep' prefix of the specified size.
  
!      'byte_loop'
!      'loop'
!      'unrolled_loop'
            Expand into an inline loop.
  
!      'libcall'
            Always use a library call.
  
! '-mmemcpy-strategy=STRATEGY'
       Override the internal decision heuristic to decide if
!      '__builtin_memcpy' should be inlined and what inline algorithm to
!      use when the expected size of the copy operation is known.
!      STRATEGY is a comma-separated list of ALG:MAX_SIZE:DEST_ALIGN
!      triplets.  ALG is specified in '-mstringop-strategy', MAX_SIZE
!      specifies the max byte size with which inline algorithm ALG is
!      allowed.  For the last triplet, the MAX_SIZE must be '-1'.  The
!      MAX_SIZE of the triplets in the list must be specified in
!      increasing order.  The minimal byte size for ALG is '0' for the
!      first triplet and 'MAX_SIZE + 1' of the preceding range.
  
! '-mmemset-strategy=STRATEGY'
!      The option is similar to '-mmemcpy-strategy=' except that it is to
!      control '__builtin_memset' expansion.
  
! '-momit-leaf-frame-pointer'
       Don't keep the frame pointer in a register for leaf functions.
       This avoids the instructions to save, set up, and restore frame
       pointers and makes an extra register available in leaf functions.
!      The option '-fomit-leaf-frame-pointer' removes the frame pointer
       for leaf functions, which might make debugging harder.
  
! '-mtls-direct-seg-refs'
! '-mno-tls-direct-seg-refs'
       Controls whether TLS variables may be accessed with offsets from
!      the TLS segment register ('%gs' for 32-bit, '%fs' for 64-bit), or
       whether the thread base pointer must be added.  Whether or not this
       is valid depends on the operating system, and whether it maps the
       segment to cover the entire TLS area.
  
       For systems that use the GNU C Library, the default is on.
  
! '-msse2avx'
! '-mno-sse2avx'
       Specify that the assembler should encode SSE instructions with VEX
!      prefix.  The option '-mavx' turns this on by default.
  
! '-mfentry'
! '-mno-fentry'
!      If profiling is active ('-pg'), put the profiling counter call
       before the prologue.  Note: On x86 architectures the attribute
!      'ms_hook_prologue' isn't possible at the moment for '-mfentry' and
!      '-pg'.
  
! '-mrecord-mcount'
! '-mno-record-mcount'
!      If profiling is active ('-pg'), generate a __mcount_loc section
!      that contains pointers to each profiling call.  This is useful for
       automatically patching and out calls.
  
! '-mnop-mcount'
! '-mno-nop-mcount'
!      If profiling is active ('-pg'), generate the calls to the profiling
!      functions as nops.  This is useful when they should be patched in
!      later dynamically.  This is likely only useful together with
!      '-mrecord-mcount'.
  
! '-mskip-rax-setup'
! '-mno-skip-rax-setup'
       When generating code for the x86-64 architecture with SSE
!      extensions disabled, '-mskip-rax-setup' can be used to skip setting
!      up RAX register when there are no variable arguments passed in
!      vector registers.
  
!      *Warning:* Since RAX register is used to avoid unnecessarily saving
!      vector registers on stack when passing variable arguments, the
!      impacts of this option are callees may waste some stack space,
       misbehave or jump to a random location.  GCC 4.4 or newer don't
       have those issues, regardless the RAX register value.
  
! '-m8bit-idiv'
! '-mno-8bit-idiv'
       On some processors, like Intel Atom, 8-bit unsigned integer divide
       is much faster than 32-bit/64-bit integer divide.  This option
       generates a run-time check.  If both dividend and divisor are
       within range of 0 to 255, 8-bit unsigned integer divide is used
       instead of 32-bit/64-bit integer divide.
  
! '-mavx256-split-unaligned-load'
! '-mavx256-split-unaligned-store'
       Split 32-byte AVX unaligned load and store.
  
! '-mstack-protector-guard=GUARD'
       Generate stack protection code using canary at GUARD.  Supported
!      locations are 'global' for global canary or 'tls' for per-thread
!      canary in the TLS block (the default).  This option has effect only
!      when '-fstack-protector' or '-fstack-protector-all' is specified.
  
!  These '-m' switches are supported in addition to the above on x86-64
  processors in 64-bit environments.
  
! '-m32'
! '-m64'
! '-mx32'
! '-m16'
       Generate code for a 16-bit, 32-bit or 64-bit environment.  The
!      '-m32' option sets 'int', 'long', and pointer types to 32 bits, and
       generates code that runs on any i386 system.
  
!      The '-m64' option sets 'int' to 32 bits and 'long' and pointer
       types to 64 bits, and generates code for the x86-64 architecture.
!      For Darwin only the '-m64' option also turns off the '-fno-pic' and
!      '-mdynamic-no-pic' options.
  
!      The '-mx32' option sets 'int', 'long', and pointer types to 32
       bits, and generates code for the x86-64 architecture.
  
!      The '-m16' option is the same as '-m32', except for that it outputs
!      the '.code16gcc' assembly directive at the beginning of the
!      assembly output so that the binary can run in 16-bit mode.
  
! '-mno-red-zone'
!      Do not use a so-called "red zone" for x86-64 code.  The red zone is
!      mandated by the x86-64 ABI; it is a 128-byte area beyond the
       location of the stack pointer that is not modified by signal or
       interrupt handlers and therefore can be used for temporary data
!      without adjusting the stack pointer.  The flag '-mno-red-zone'
       disables this red zone.
  
! '-mcmodel=small'
!      Generate code for the small code model: the program and its symbols
!      must be linked in the lower 2 GB of the address space.  Pointers
!      are 64 bits.  Programs can be statically or dynamically linked.
!      This is the default code model.
  
! '-mcmodel=kernel'
       Generate code for the kernel code model.  The kernel runs in the
       negative 2 GB of the address space.  This model has to be used for
       Linux kernel code.
  
! '-mcmodel=medium'
       Generate code for the medium model: the program is linked in the
       lower 2 GB of the address space.  Small symbols are also placed
!      there.  Symbols with sizes larger than '-mlarge-data-threshold' are
!      put into large data or BSS sections and can be located above 2GB.
!      Programs can be statically or dynamically linked.
  
! '-mcmodel=large'
       Generate code for the large model.  This model makes no assumptions
       about addresses and sizes of sections.
  
! '-maddress-mode=long'
       Generate code for long address mode.  This is only supported for
       64-bit and x32 environments.  It is the default address mode for
       64-bit environments.
  
! '-maddress-mode=short'
       Generate code for short address mode.  This is only supported for
       32-bit and x32 environments.  It is the default address mode for
       32-bit and x32 environments.
*************** File: gcc.info,  Node: x86 Windows Optio
*** 21276,21338 ****
  
  These additional options are available for Microsoft Windows targets:
  
! `-mconsole'
       This option specifies that a console application is to be
!      generated, by instructing the linker to set the PE header
!      subsystem type required for console applications.  This option is
!      available for Cygwin and MinGW targets and is enabled by default
!      on those targets.
  
! `-mdll'
       This option is available for Cygwin and MinGW targets.  It
       specifies that a DLL--a dynamic link library--is to be generated,
       enabling the selection of the required runtime startup object and
       entry point.
  
! `-mnop-fun-dllimport'
       This option is available for Cygwin and MinGW targets.  It
!      specifies that the `dllimport' attribute should be ignored.
  
! `-mthread'
!      This option is available for MinGW targets. It specifies that
       MinGW-specific thread support is to be used.
  
! `-municode'
       This option is available for MinGW-w64 targets.  It causes the
!      `UNICODE' preprocessor macro to be predefined, and chooses
       Unicode-capable runtime startup code.
  
! `-mwin32'
       This option is available for Cygwin and MinGW targets.  It
       specifies that the typical Microsoft Windows predefined macros are
       to be set in the pre-processor, but does not influence the choice
       of runtime library/startup code.
  
! `-mwindows'
       This option is available for Cygwin and MinGW targets.  It
       specifies that a GUI application is to be generated by instructing
       the linker to set the PE header subsystem type appropriately.
  
! `-fno-set-stack-executable'
!      This option is available for MinGW targets. It specifies that the
       executable flag for the stack used by nested functions isn't set.
       This is necessary for binaries running in kernel mode of Microsoft
       Windows, as there the User32 API, which is used to set executable
       privileges, isn't available.
  
! `-fwritable-relocated-rdata'
       This option is available for MinGW and Cygwin targets.  It
       specifies that relocated-data in read-only section is put into
       .data section.  This is a necessary for older runtimes not
       supporting modification of .rdata sections for pseudo-relocation.
  
! `-mpe-aligned-commons'
       This option is available for Cygwin and MinGW targets.  It
!      specifies that the GNU extension to the PE file format that
!      permits the correct alignment of COMMON variables should be used
!      when generating code.  It is enabled by default if GCC detects
!      that the target assembler found during configuration supports the
!      feature.
  
   See also under *note x86 Options:: for standard options.
  
--- 21163,21224 ----
  
  These additional options are available for Microsoft Windows targets:
  
! '-mconsole'
       This option specifies that a console application is to be
!      generated, by instructing the linker to set the PE header subsystem
!      type required for console applications.  This option is available
!      for Cygwin and MinGW targets and is enabled by default on those
!      targets.
  
! '-mdll'
       This option is available for Cygwin and MinGW targets.  It
       specifies that a DLL--a dynamic link library--is to be generated,
       enabling the selection of the required runtime startup object and
       entry point.
  
! '-mnop-fun-dllimport'
       This option is available for Cygwin and MinGW targets.  It
!      specifies that the 'dllimport' attribute should be ignored.
  
! '-mthread'
!      This option is available for MinGW targets.  It specifies that
       MinGW-specific thread support is to be used.
  
! '-municode'
       This option is available for MinGW-w64 targets.  It causes the
!      'UNICODE' preprocessor macro to be predefined, and chooses
       Unicode-capable runtime startup code.
  
! '-mwin32'
       This option is available for Cygwin and MinGW targets.  It
       specifies that the typical Microsoft Windows predefined macros are
       to be set in the pre-processor, but does not influence the choice
       of runtime library/startup code.
  
! '-mwindows'
       This option is available for Cygwin and MinGW targets.  It
       specifies that a GUI application is to be generated by instructing
       the linker to set the PE header subsystem type appropriately.
  
! '-fno-set-stack-executable'
!      This option is available for MinGW targets.  It specifies that the
       executable flag for the stack used by nested functions isn't set.
       This is necessary for binaries running in kernel mode of Microsoft
       Windows, as there the User32 API, which is used to set executable
       privileges, isn't available.
  
! '-fwritable-relocated-rdata'
       This option is available for MinGW and Cygwin targets.  It
       specifies that relocated-data in read-only section is put into
       .data section.  This is a necessary for older runtimes not
       supporting modification of .rdata sections for pseudo-relocation.
  
! '-mpe-aligned-commons'
       This option is available for Cygwin and MinGW targets.  It
!      specifies that the GNU extension to the PE file format that permits
!      the correct alignment of COMMON variables should be used when
!      generating code.  It is enabled by default if GCC detects that the
!      target assembler found during configuration supports the feature.
  
   See also under *note x86 Options:: for standard options.
  
*************** File: gcc.info,  Node: Xstormy16 Options
*** 21344,21350 ****
  
  These options are defined for Xstormy16:
  
! `-msim'
       Choose startup files and linker script suitable for the simulator.
  
  
--- 21230,21236 ----
  
  These options are defined for Xstormy16:
  
! '-msim'
       Choose startup files and linker script suitable for the simulator.
  
  
*************** File: gcc.info,  Node: Xtensa Options,
*** 21355,21438 ****
  
  These options are supported for Xtensa targets:
  
! `-mconst16'
! `-mno-const16'
!      Enable or disable use of `CONST16' instructions for loading
!      constant values.  The `CONST16' instruction is currently not a
!      standard option from Tensilica.  When enabled, `CONST16'
!      instructions are always used in place of the standard `L32R'
!      instructions.  The use of `CONST16' is enabled by default only if
!      the `L32R' instruction is not available.
  
! `-mfused-madd'
! `-mno-fused-madd'
       Enable or disable use of fused multiply/add and multiply/subtract
       instructions in the floating-point option.  This has no effect if
       the floating-point option is not also enabled.  Disabling fused
!      multiply/add and multiply/subtract instructions forces the
!      compiler to use separate instructions for the multiply and
!      add/subtract operations.  This may be desirable in some cases
!      where strict IEEE 754-compliant results are required: the fused
!      multiply add/subtract instructions do not round the intermediate
!      result, thereby producing results with _more_ bits of precision
!      than specified by the IEEE standard.  Disabling fused multiply
!      add/subtract instructions also ensures that the program output is
!      not sensitive to the compiler's ability to combine multiply and
!      add/subtract operations.
  
! `-mserialize-volatile'
! `-mno-serialize-volatile'
!      When this option is enabled, GCC inserts `MEMW' instructions before
!      `volatile' memory references to guarantee sequential consistency.
!      The default is `-mserialize-volatile'.  Use
!      `-mno-serialize-volatile' to omit the `MEMW' instructions.
  
! `-mforce-no-pic'
       For targets, like GNU/Linux, where all user-mode Xtensa code must
       be position-independent code (PIC), this option disables PIC for
       compiling kernel code.
  
! `-mtext-section-literals'
! `-mno-text-section-literals'
       These options control the treatment of literal pools.  The default
!      is `-mno-text-section-literals', which places literals in a
       separate section in the output file.  This allows the literal pool
       to be placed in a data RAM/ROM, and it also allows the linker to
       combine literal pools from separate object files to remove
       redundant literals and improve code size.  With
!      `-mtext-section-literals', the literals are interspersed in the
       text section in order to keep them as close as possible to their
       references.  This may be necessary for large assembly files.
  
! `-mtarget-align'
! `-mno-target-align'
       When this option is enabled, GCC instructs the assembler to
       automatically align instructions to reduce branch penalties at the
       expense of some code density.  The assembler attempts to widen
       density instructions to align branch targets and the instructions
       following call instructions.  If there are not enough preceding
       safe density instructions to align a target, no widening is
!      performed.  The default is `-mtarget-align'.  These options do not
!      affect the treatment of auto-aligned instructions like `LOOP',
       which the assembler always aligns, either by widening density
       instructions or by inserting NOP instructions.
  
! `-mlongcalls'
! `-mno-longcalls'
       When this option is enabled, GCC instructs the assembler to
       translate direct calls to indirect calls unless it can determine
       that the target of a direct call is in the range allowed by the
       call instruction.  This translation typically occurs for calls to
       functions in other source files.  Specifically, the assembler
!      translates a direct `CALL' instruction into an `L32R' followed by
!      a `CALLX' instruction.  The default is `-mno-longcalls'.  This
!      option should be used in programs where the call target can
!      potentially be out of range.  This option is implemented in the
!      assembler, not the compiler, so the assembly code generated by GCC
!      still shows direct call instructions--look at the disassembled
!      object code to see the actual instructions.  Note that the
!      assembler uses an indirect call for every cross-file call, not
!      just those that really are out of range.
  
  
  File: gcc.info,  Node: zSeries Options,  Prev: Xtensa Options,  Up: Submodel Options
--- 21241,21324 ----
  
  These options are supported for Xtensa targets:
  
! '-mconst16'
! '-mno-const16'
!      Enable or disable use of 'CONST16' instructions for loading
!      constant values.  The 'CONST16' instruction is currently not a
!      standard option from Tensilica.  When enabled, 'CONST16'
!      instructions are always used in place of the standard 'L32R'
!      instructions.  The use of 'CONST16' is enabled by default only if
!      the 'L32R' instruction is not available.
  
! '-mfused-madd'
! '-mno-fused-madd'
       Enable or disable use of fused multiply/add and multiply/subtract
       instructions in the floating-point option.  This has no effect if
       the floating-point option is not also enabled.  Disabling fused
!      multiply/add and multiply/subtract instructions forces the compiler
!      to use separate instructions for the multiply and add/subtract
!      operations.  This may be desirable in some cases where strict IEEE
!      754-compliant results are required: the fused multiply add/subtract
!      instructions do not round the intermediate result, thereby
!      producing results with _more_ bits of precision than specified by
!      the IEEE standard.  Disabling fused multiply add/subtract
!      instructions also ensures that the program output is not sensitive
!      to the compiler's ability to combine multiply and add/subtract
!      operations.
  
! '-mserialize-volatile'
! '-mno-serialize-volatile'
!      When this option is enabled, GCC inserts 'MEMW' instructions before
!      'volatile' memory references to guarantee sequential consistency.
!      The default is '-mserialize-volatile'.  Use
!      '-mno-serialize-volatile' to omit the 'MEMW' instructions.
  
! '-mforce-no-pic'
       For targets, like GNU/Linux, where all user-mode Xtensa code must
       be position-independent code (PIC), this option disables PIC for
       compiling kernel code.
  
! '-mtext-section-literals'
! '-mno-text-section-literals'
       These options control the treatment of literal pools.  The default
!      is '-mno-text-section-literals', which places literals in a
       separate section in the output file.  This allows the literal pool
       to be placed in a data RAM/ROM, and it also allows the linker to
       combine literal pools from separate object files to remove
       redundant literals and improve code size.  With
!      '-mtext-section-literals', the literals are interspersed in the
       text section in order to keep them as close as possible to their
       references.  This may be necessary for large assembly files.
  
! '-mtarget-align'
! '-mno-target-align'
       When this option is enabled, GCC instructs the assembler to
       automatically align instructions to reduce branch penalties at the
       expense of some code density.  The assembler attempts to widen
       density instructions to align branch targets and the instructions
       following call instructions.  If there are not enough preceding
       safe density instructions to align a target, no widening is
!      performed.  The default is '-mtarget-align'.  These options do not
!      affect the treatment of auto-aligned instructions like 'LOOP',
       which the assembler always aligns, either by widening density
       instructions or by inserting NOP instructions.
  
! '-mlongcalls'
! '-mno-longcalls'
       When this option is enabled, GCC instructs the assembler to
       translate direct calls to indirect calls unless it can determine
       that the target of a direct call is in the range allowed by the
       call instruction.  This translation typically occurs for calls to
       functions in other source files.  Specifically, the assembler
!      translates a direct 'CALL' instruction into an 'L32R' followed by a
!      'CALLX' instruction.  The default is '-mno-longcalls'.  This option
!      should be used in programs where the call target can potentially be
!      out of range.  This option is implemented in the assembler, not the
!      compiler, so the assembly code generated by GCC still shows direct
!      call instructions--look at the disassembled object code to see the
!      actual instructions.  Note that the assembler uses an indirect call
!      for every cross-file call, not just those that really are out of
!      range.
  
  
  File: gcc.info,  Node: zSeries Options,  Prev: Xtensa Options,  Up: Submodel Options
*************** File: gcc.info,  Node: Code Gen Options,
*** 21448,21482 ****
  3.18 Options for Code Generation Conventions
  ============================================
  
! These machine-independent options control the interface conventions
! used in code generation.
  
   Most of them have both positive and negative forms; the negative form
! of `-ffoo' is `-fno-foo'.  In the table below, only one of the forms is
  listed--the one that is not the default.  You can figure out the other
! form by either removing `no-' or adding it.
  
! `-fbounds-check'
       For front ends that support it, generate additional code to check
       that indices used to access arrays are within the declared range.
       This is currently only supported by the Java and Fortran front
       ends, where this option defaults to true and false respectively.
  
! `-fstack-reuse=REUSE-LEVEL'
!      This option controls stack space reuse for user declared
!      local/auto variables and compiler generated temporaries.
!      REUSE_LEVEL can be `all', `named_vars', or `none'. `all' enables
!      stack reuse for all local variables and temporaries, `named_vars'
!      enables the reuse only for user defined local variables with
!      names, and `none' disables stack reuse completely. The default
!      value is `all'. The option is needed when the program extends the
!      lifetime of a scoped local variable or a compiler generated
!      temporary beyond the end point defined by the language.  When a
!      lifetime of a variable ends, and if the variable lives in memory,
!      the optimizing compiler has the freedom to reuse its stack space
!      with other temporaries or scoped local variables whose live range
!      does not overlap with it. Legacy code extending local lifetime is
!      likely to break with the stack reuse optimization.
  
       For example,
  
--- 21334,21368 ----
  3.18 Options for Code Generation Conventions
  ============================================
  
! These machine-independent options control the interface conventions used
! in code generation.
  
   Most of them have both positive and negative forms; the negative form
! of '-ffoo' is '-fno-foo'.  In the table below, only one of the forms is
  listed--the one that is not the default.  You can figure out the other
! form by either removing 'no-' or adding it.
  
! '-fbounds-check'
       For front ends that support it, generate additional code to check
       that indices used to access arrays are within the declared range.
       This is currently only supported by the Java and Fortran front
       ends, where this option defaults to true and false respectively.
  
! '-fstack-reuse=REUSE-LEVEL'
!      This option controls stack space reuse for user declared local/auto
!      variables and compiler generated temporaries.  REUSE_LEVEL can be
!      'all', 'named_vars', or 'none'.  'all' enables stack reuse for all
!      local variables and temporaries, 'named_vars' enables the reuse
!      only for user defined local variables with names, and 'none'
!      disables stack reuse completely.  The default value is 'all'.  The
!      option is needed when the program extends the lifetime of a scoped
!      local variable or a compiler generated temporary beyond the end
!      point defined by the language.  When a lifetime of a variable ends,
!      and if the variable lives in memory, the optimizing compiler has
!      the freedom to reuse its stack space with other temporaries or
!      scoped local variables whose live range does not overlap with it.
!      Legacy code extending local lifetime is likely to break with the
!      stack reuse optimization.
  
       For example,
  
*************** form by either removing `no-' or adding
*** 21527,21547 ****
                               // is reused with a. What is the value of ap->i?
               }
  
       The lifetime of a compiler generated temporary is well defined by
!      the C++ standard. When a lifetime of a temporary ends, and if the
       temporary lives in memory, the optimizing compiler has the freedom
       to reuse its stack space with other temporaries or scoped local
!      variables whose live range does not overlap with it. However some
       of the legacy code relies on the behavior of older compilers in
       which temporaries' stack space is not reused, the aggressive stack
!      reuse can lead to runtime errors. This option is used to control
       the temporary stack reuse optimization.
  
! `-ftrapv'
       This option generates traps for signed overflow on addition,
       subtraction, multiplication operations.
  
! `-fwrapv'
       This option instructs the compiler to assume that signed arithmetic
       overflow of addition, subtraction and multiplication wraps around
       using twos-complement representation.  This flag enables some
--- 21413,21434 ----
                               // is reused with a. What is the value of ap->i?
               }
  
+ 
       The lifetime of a compiler generated temporary is well defined by
!      the C++ standard.  When a lifetime of a temporary ends, and if the
       temporary lives in memory, the optimizing compiler has the freedom
       to reuse its stack space with other temporaries or scoped local
!      variables whose live range does not overlap with it.  However some
       of the legacy code relies on the behavior of older compilers in
       which temporaries' stack space is not reused, the aggressive stack
!      reuse can lead to runtime errors.  This option is used to control
       the temporary stack reuse optimization.
  
! '-ftrapv'
       This option generates traps for signed overflow on addition,
       subtraction, multiplication operations.
  
! '-fwrapv'
       This option instructs the compiler to assume that signed arithmetic
       overflow of addition, subtraction and multiplication wraps around
       using twos-complement representation.  This flag enables some
*************** form by either removing `no-' or adding
*** 21549,21578 ****
       default for the Java front end, as required by the Java language
       specification.
  
! `-fexceptions'
       Enable exception handling.  Generates extra code needed to
!      propagate exceptions.  For some targets, this implies GCC
!      generates frame unwind information for all functions, which can
!      produce significant data size overhead, although it does not
!      affect execution.  If you do not specify this option, GCC enables
!      it by default for languages like C++ that normally require
!      exception handling, and disables it for languages like C that do
!      not normally require it.  However, you may need to enable this
!      option when compiling C code that needs to interoperate properly
!      with exception handlers written in C++.  You may also wish to
!      disable this option if you are compiling older C++ programs that
!      don't use exception handling.
  
! `-fnon-call-exceptions'
       Generate code that allows trapping instructions to throw
       exceptions.  Note that this requires platform-specific runtime
       support that does not exist everywhere.  Moreover, it only allows
!      _trapping_ instructions to throw exceptions, i.e. memory
!      references or floating-point instructions.  It does not allow
!      exceptions to be thrown from arbitrary signal handlers such as
!      `SIGALRM'.
  
! `-fdelete-dead-exceptions'
       Consider that instructions that may throw exceptions but don't
       otherwise contribute to the execution of the program can be
       optimized away.  This option is enabled by default for the Ada
--- 21436,21464 ----
       default for the Java front end, as required by the Java language
       specification.
  
! '-fexceptions'
       Enable exception handling.  Generates extra code needed to
!      propagate exceptions.  For some targets, this implies GCC generates
!      frame unwind information for all functions, which can produce
!      significant data size overhead, although it does not affect
!      execution.  If you do not specify this option, GCC enables it by
!      default for languages like C++ that normally require exception
!      handling, and disables it for languages like C that do not normally
!      require it.  However, you may need to enable this option when
!      compiling C code that needs to interoperate properly with exception
!      handlers written in C++.  You may also wish to disable this option
!      if you are compiling older C++ programs that don't use exception
!      handling.
  
! '-fnon-call-exceptions'
       Generate code that allows trapping instructions to throw
       exceptions.  Note that this requires platform-specific runtime
       support that does not exist everywhere.  Moreover, it only allows
!      _trapping_ instructions to throw exceptions, i.e. memory references
!      or floating-point instructions.  It does not allow exceptions to be
!      thrown from arbitrary signal handlers such as 'SIGALRM'.
  
! '-fdelete-dead-exceptions'
       Consider that instructions that may throw exceptions but don't
       otherwise contribute to the execution of the program can be
       optimized away.  This option is enabled by default for the Ada
*************** form by either removing `no-' or adding
*** 21580,21617 ****
       Optimization passes that cause dead exceptions to be removed are
       enabled independently at different optimization levels.
  
! `-funwind-tables'
!      Similar to `-fexceptions', except that it just generates any needed
       static data, but does not affect the generated code in any other
       way.  You normally do not need to enable this option; instead, a
       language processor that needs this handling enables it on your
       behalf.
  
! `-fasynchronous-unwind-tables'
       Generate unwind table in DWARF 2 format, if supported by target
       machine.  The table is exact at each instruction boundary, so it
       can be used for stack unwinding from asynchronous events (such as
       debugger or garbage collector).
  
! `-fno-gnu-unique'
       On systems with recent GNU assembler and C library, the C++
!      compiler uses the `STB_GNU_UNIQUE' binding to make sure that
       definitions of template static data members and static local
       variables in inline functions are unique even in the presence of
!      `RTLD_LOCAL'; this is necessary to avoid problems with a library
!      used by two different `RTLD_LOCAL' plugins depending on a
       definition in one of them and therefore disagreeing with the other
!      one about the binding of the symbol.  But this causes `dlclose' to
       be ignored for affected DSOs; if your program relies on
!      reinitialization of a DSO via `dlclose' and `dlopen', you can use
!      `-fno-gnu-unique'.
  
! `-fpcc-struct-return'
!      Return "short" `struct' and `union' values in memory like longer
!      ones, rather than in registers.  This convention is less
!      efficient, but it has the advantage of allowing intercallability
!      between GCC-compiled files and files compiled with other
!      compilers, particularly the Portable C Compiler (pcc).
  
       The precise convention for returning structures in memory depends
       on the target configuration macros.
--- 21466,21503 ----
       Optimization passes that cause dead exceptions to be removed are
       enabled independently at different optimization levels.
  
! '-funwind-tables'
!      Similar to '-fexceptions', except that it just generates any needed
       static data, but does not affect the generated code in any other
       way.  You normally do not need to enable this option; instead, a
       language processor that needs this handling enables it on your
       behalf.
  
! '-fasynchronous-unwind-tables'
       Generate unwind table in DWARF 2 format, if supported by target
       machine.  The table is exact at each instruction boundary, so it
       can be used for stack unwinding from asynchronous events (such as
       debugger or garbage collector).
  
! '-fno-gnu-unique'
       On systems with recent GNU assembler and C library, the C++
!      compiler uses the 'STB_GNU_UNIQUE' binding to make sure that
       definitions of template static data members and static local
       variables in inline functions are unique even in the presence of
!      'RTLD_LOCAL'; this is necessary to avoid problems with a library
!      used by two different 'RTLD_LOCAL' plugins depending on a
       definition in one of them and therefore disagreeing with the other
!      one about the binding of the symbol.  But this causes 'dlclose' to
       be ignored for affected DSOs; if your program relies on
!      reinitialization of a DSO via 'dlclose' and 'dlopen', you can use
!      '-fno-gnu-unique'.
  
! '-fpcc-struct-return'
!      Return "short" 'struct' and 'union' values in memory like longer
!      ones, rather than in registers.  This convention is less efficient,
!      but it has the advantage of allowing intercallability between
!      GCC-compiled files and files compiled with other compilers,
!      particularly the Portable C Compiler (pcc).
  
       The precise convention for returning structures in memory depends
       on the target configuration macros.
*************** form by either removing `no-' or adding
*** 21619,21727 ****
       Short structures and unions are those whose size and alignment
       match that of some integer type.
  
!      *Warning:* code compiled with the `-fpcc-struct-return' switch is
       not binary compatible with code compiled with the
!      `-freg-struct-return' switch.  Use it to conform to a non-default
       application binary interface.
  
! `-freg-struct-return'
!      Return `struct' and `union' values in registers when possible.
       This is more efficient for small structures than
!      `-fpcc-struct-return'.
  
!      If you specify neither `-fpcc-struct-return' nor
!      `-freg-struct-return', GCC defaults to whichever convention is
       standard for the target.  If there is no standard convention, GCC
!      defaults to `-fpcc-struct-return', except on targets where GCC is
       the principal compiler.  In those cases, we can choose the
       standard, and we chose the more efficient register return
       alternative.
  
!      *Warning:* code compiled with the `-freg-struct-return' switch is
       not binary compatible with code compiled with the
!      `-fpcc-struct-return' switch.  Use it to conform to a non-default
       application binary interface.
  
! `-fshort-enums'
!      Allocate to an `enum' type only as many bytes as it needs for the
!      declared range of possible values.  Specifically, the `enum' type
       is equivalent to the smallest integer type that has enough room.
  
!      *Warning:* the `-fshort-enums' switch causes GCC to generate code
       that is not binary compatible with code generated without that
       switch.  Use it to conform to a non-default application binary
       interface.
  
! `-fshort-double'
!      Use the same size for `double' as for `float'.
  
!      *Warning:* the `-fshort-double' switch causes GCC to generate code
       that is not binary compatible with code generated without that
       switch.  Use it to conform to a non-default application binary
       interface.
  
! `-fshort-wchar'
!      Override the underlying type for `wchar_t' to be `short unsigned
       int' instead of the default for the target.  This option is useful
       for building programs to run under WINE.
  
!      *Warning:* the `-fshort-wchar' switch causes GCC to generate code
       that is not binary compatible with code generated without that
       switch.  Use it to conform to a non-default application binary
       interface.
  
! `-fno-common'
       In C code, controls the placement of uninitialized global
       variables.  Unix C compilers have traditionally permitted multiple
       definitions of such variables in different compilation units by
       placing the variables in a common block.  This is the behavior
!      specified by `-fcommon', and is the default for GCC on most
       targets.  On the other hand, this behavior is not required by ISO
       C, and on some targets may carry a speed or code size penalty on
!      variable references.  The `-fno-common' option specifies that the
       compiler should place uninitialized global variables in the data
       section of the object file, rather than generating them as common
       blocks.  This has the effect that if the same variable is declared
!      (without `extern') in two different compilations, you get a
       multiple-definition error when you link them.  In this case, you
!      must compile with `-fcommon' instead.  Compiling with
!      `-fno-common' is useful on targets for which it provides better
!      performance, or if you wish to verify that the program will work
!      on other systems that always treat uninitialized variable
!      declarations this way.
  
! `-fno-ident'
!      Ignore the `#ident' directive.
  
! `-finhibit-size-directive'
!      Don't output a `.size' assembler directive, or anything else that
       would cause trouble if the function is split in the middle, and the
       two halves are placed at locations far apart in memory.  This
!      option is used when compiling `crtstuff.c'; you should not need to
       use it for anything else.
  
! `-fverbose-asm'
       Put extra commentary information in the generated assembly code to
       make it more readable.  This option is generally only of use to
       those who actually need to read the generated assembly code
       (perhaps while debugging the compiler itself).
  
!      `-fno-verbose-asm', the default, causes the extra information to
!      be omitted and is useful when comparing two assembler files.
  
! `-frecord-gcc-switches'
       This switch causes the command line used to invoke the compiler to
       be recorded into the object file that is being created.  This
       switch is only implemented on some targets and the exact format of
       the recording is target and binary file format dependent, but it
       usually takes the form of a section containing ASCII text.  This
!      switch is related to the `-fverbose-asm' switch, but that switch
       only records information in the assembler output file as comments,
       so it never reaches the object file.  See also
!      `-grecord-gcc-switches' for another way of storing compiler
!      options into the object file.
  
! `-fpic'
       Generate position-independent code (PIC) suitable for use in a
       shared library, if supported for the target machine.  Such code
       accesses all constant addresses through a global offset table
--- 21505,21612 ----
       Short structures and unions are those whose size and alignment
       match that of some integer type.
  
!      *Warning:* code compiled with the '-fpcc-struct-return' switch is
       not binary compatible with code compiled with the
!      '-freg-struct-return' switch.  Use it to conform to a non-default
       application binary interface.
  
! '-freg-struct-return'
!      Return 'struct' and 'union' values in registers when possible.
       This is more efficient for small structures than
!      '-fpcc-struct-return'.
  
!      If you specify neither '-fpcc-struct-return' nor
!      '-freg-struct-return', GCC defaults to whichever convention is
       standard for the target.  If there is no standard convention, GCC
!      defaults to '-fpcc-struct-return', except on targets where GCC is
       the principal compiler.  In those cases, we can choose the
       standard, and we chose the more efficient register return
       alternative.
  
!      *Warning:* code compiled with the '-freg-struct-return' switch is
       not binary compatible with code compiled with the
!      '-fpcc-struct-return' switch.  Use it to conform to a non-default
       application binary interface.
  
! '-fshort-enums'
!      Allocate to an 'enum' type only as many bytes as it needs for the
!      declared range of possible values.  Specifically, the 'enum' type
       is equivalent to the smallest integer type that has enough room.
  
!      *Warning:* the '-fshort-enums' switch causes GCC to generate code
       that is not binary compatible with code generated without that
       switch.  Use it to conform to a non-default application binary
       interface.
  
! '-fshort-double'
!      Use the same size for 'double' as for 'float'.
  
!      *Warning:* the '-fshort-double' switch causes GCC to generate code
       that is not binary compatible with code generated without that
       switch.  Use it to conform to a non-default application binary
       interface.
  
! '-fshort-wchar'
!      Override the underlying type for 'wchar_t' to be 'short unsigned
       int' instead of the default for the target.  This option is useful
       for building programs to run under WINE.
  
!      *Warning:* the '-fshort-wchar' switch causes GCC to generate code
       that is not binary compatible with code generated without that
       switch.  Use it to conform to a non-default application binary
       interface.
  
! '-fno-common'
       In C code, controls the placement of uninitialized global
       variables.  Unix C compilers have traditionally permitted multiple
       definitions of such variables in different compilation units by
       placing the variables in a common block.  This is the behavior
!      specified by '-fcommon', and is the default for GCC on most
       targets.  On the other hand, this behavior is not required by ISO
       C, and on some targets may carry a speed or code size penalty on
!      variable references.  The '-fno-common' option specifies that the
       compiler should place uninitialized global variables in the data
       section of the object file, rather than generating them as common
       blocks.  This has the effect that if the same variable is declared
!      (without 'extern') in two different compilations, you get a
       multiple-definition error when you link them.  In this case, you
!      must compile with '-fcommon' instead.  Compiling with '-fno-common'
!      is useful on targets for which it provides better performance, or
!      if you wish to verify that the program will work on other systems
!      that always treat uninitialized variable declarations this way.
  
! '-fno-ident'
!      Ignore the '#ident' directive.
  
! '-finhibit-size-directive'
!      Don't output a '.size' assembler directive, or anything else that
       would cause trouble if the function is split in the middle, and the
       two halves are placed at locations far apart in memory.  This
!      option is used when compiling 'crtstuff.c'; you should not need to
       use it for anything else.
  
! '-fverbose-asm'
       Put extra commentary information in the generated assembly code to
       make it more readable.  This option is generally only of use to
       those who actually need to read the generated assembly code
       (perhaps while debugging the compiler itself).
  
!      '-fno-verbose-asm', the default, causes the extra information to be
!      omitted and is useful when comparing two assembler files.
  
! '-frecord-gcc-switches'
       This switch causes the command line used to invoke the compiler to
       be recorded into the object file that is being created.  This
       switch is only implemented on some targets and the exact format of
       the recording is target and binary file format dependent, but it
       usually takes the form of a section containing ASCII text.  This
!      switch is related to the '-fverbose-asm' switch, but that switch
       only records information in the assembler output file as comments,
       so it never reaches the object file.  See also
!      '-grecord-gcc-switches' for another way of storing compiler options
!      into the object file.
  
! '-fpic'
       Generate position-independent code (PIC) suitable for use in a
       shared library, if supported for the target machine.  Such code
       accesses all constant addresses through a global offset table
*************** form by either removing `no-' or adding
*** 21729,21736 ****
       program starts (the dynamic loader is not part of GCC; it is part
       of the operating system).  If the GOT size for the linked
       executable exceeds a machine-specific maximum size, you get an
!      error message from the linker indicating that `-fpic' does not
!      work; in that case, recompile with `-fPIC' instead.  (These
       maximums are 8k on the SPARC and 32k on the m68k and RS/6000.  The
       x86 has no such limit.)
  
--- 21614,21621 ----
       program starts (the dynamic loader is not part of GCC; it is part
       of the operating system).  If the GOT size for the linked
       executable exceeds a machine-specific maximum size, you get an
!      error message from the linker indicating that '-fpic' does not
!      work; in that case, recompile with '-fPIC' instead.  (These
       maximums are 8k on the SPARC and 32k on the m68k and RS/6000.  The
       x86 has no such limit.)
  
*************** form by either removing `no-' or adding
*** 21739,21791 ****
       System V but not for the Sun 386i.  Code generated for the IBM
       RS/6000 is always position-independent.
  
!      When this flag is set, the macros `__pic__' and `__PIC__' are
       defined to 1.
  
! `-fPIC'
       If supported for the target machine, emit position-independent
       code, suitable for dynamic linking and avoiding any limit on the
!      size of the global offset table.  This option makes a difference
!      on the m68k, PowerPC and SPARC.
  
       Position-independent code requires special support, and therefore
       works only on certain machines.
  
!      When this flag is set, the macros `__pic__' and `__PIC__' are
       defined to 2.
  
! `-fpie'
! `-fPIE'
!      These options are similar to `-fpic' and `-fPIC', but generated
       position independent code can be only linked into executables.
!      Usually these options are used when `-pie' GCC option is used
       during linking.
  
!      `-fpie' and `-fPIE' both define the macros `__pie__' and
!      `__PIE__'.  The macros have the value 1 for `-fpie' and 2 for
!      `-fPIE'.
  
! `-fno-jump-tables'
       Do not use jump tables for switch statements even where it would be
       more efficient than other code generation strategies.  This option
!      is of use in conjunction with `-fpic' or `-fPIC' for building code
       that forms part of a dynamic linker and cannot reference the
       address of a jump table.  On some targets, jump tables do not
       require a GOT and this option is not needed.
  
! `-ffixed-REG'
       Treat the register named REG as a fixed register; generated code
       should never refer to it (except perhaps as a stack pointer, frame
       pointer or in some other fixed role).
  
       REG must be the name of a register.  The register names accepted
!      are machine-specific and are defined in the `REGISTER_NAMES' macro
       in the machine description macro file.
  
       This flag does not have a negative form, because it specifies a
       three-way choice.
  
! `-fcall-used-REG'
       Treat the register named REG as an allocable register that is
       clobbered by function calls.  It may be allocated for temporaries
       or variables that do not live across a call.  Functions compiled
--- 21624,21675 ----
       System V but not for the Sun 386i.  Code generated for the IBM
       RS/6000 is always position-independent.
  
!      When this flag is set, the macros '__pic__' and '__PIC__' are
       defined to 1.
  
! '-fPIC'
       If supported for the target machine, emit position-independent
       code, suitable for dynamic linking and avoiding any limit on the
!      size of the global offset table.  This option makes a difference on
!      the m68k, PowerPC and SPARC.
  
       Position-independent code requires special support, and therefore
       works only on certain machines.
  
!      When this flag is set, the macros '__pic__' and '__PIC__' are
       defined to 2.
  
! '-fpie'
! '-fPIE'
!      These options are similar to '-fpic' and '-fPIC', but generated
       position independent code can be only linked into executables.
!      Usually these options are used when '-pie' GCC option is used
       during linking.
  
!      '-fpie' and '-fPIE' both define the macros '__pie__' and '__PIE__'.
!      The macros have the value 1 for '-fpie' and 2 for '-fPIE'.
  
! '-fno-jump-tables'
       Do not use jump tables for switch statements even where it would be
       more efficient than other code generation strategies.  This option
!      is of use in conjunction with '-fpic' or '-fPIC' for building code
       that forms part of a dynamic linker and cannot reference the
       address of a jump table.  On some targets, jump tables do not
       require a GOT and this option is not needed.
  
! '-ffixed-REG'
       Treat the register named REG as a fixed register; generated code
       should never refer to it (except perhaps as a stack pointer, frame
       pointer or in some other fixed role).
  
       REG must be the name of a register.  The register names accepted
!      are machine-specific and are defined in the 'REGISTER_NAMES' macro
       in the machine description macro file.
  
       This flag does not have a negative form, because it specifies a
       three-way choice.
  
! '-fcall-used-REG'
       Treat the register named REG as an allocable register that is
       clobbered by function calls.  It may be allocated for temporaries
       or variables that do not live across a call.  Functions compiled
*************** form by either removing `no-' or adding
*** 21799,21805 ****
       This flag does not have a negative form, because it specifies a
       three-way choice.
  
! `-fcall-saved-REG'
       Treat the register named REG as an allocable register saved by
       functions.  It may be allocated even for temporaries or variables
       that live across a call.  Functions compiled this way save and
--- 21683,21689 ----
       This flag does not have a negative form, because it specifies a
       three-way choice.
  
! '-fcall-saved-REG'
       Treat the register named REG as an allocable register saved by
       functions.  It may be allocated even for temporaries or variables
       that live across a call.  Functions compiled this way save and
*************** form by either removing `no-' or adding
*** 21816,21822 ****
       This flag does not have a negative form, because it specifies a
       three-way choice.
  
! `-fpack-struct[=N]'
       Without a value specified, pack all structure members together
       without holes.  When a value is specified (which must be a small
       power of two), pack structure members according to this value,
--- 21700,21706 ----
       This flag does not have a negative form, because it specifies a
       three-way choice.
  
! '-fpack-struct[=N]'
       Without a value specified, pack all structure members together
       without holes.  When a value is specified (which must be a small
       power of two), pack structure members according to this value,
*************** form by either removing `no-' or adding
*** 21824,21840 ****
       alignment requirements larger than this are output potentially
       unaligned at the next fitting location.
  
!      *Warning:* the `-fpack-struct' switch causes GCC to generate code
       that is not binary compatible with code generated without that
       switch.  Additionally, it makes the code suboptimal.  Use it to
       conform to a non-default application binary interface.
  
! `-finstrument-functions'
       Generate instrumentation calls for entry and exit to functions.
       Just after function entry and just before function exit, the
       following profiling functions are called with the address of the
       current function and its call site.  (On some platforms,
!      `__builtin_return_address' does not work beyond the current
       function, so the call site information may not be available to the
       profiling functions otherwise.)
  
--- 21708,21724 ----
       alignment requirements larger than this are output potentially
       unaligned at the next fitting location.
  
!      *Warning:* the '-fpack-struct' switch causes GCC to generate code
       that is not binary compatible with code generated without that
       switch.  Additionally, it makes the code suboptimal.  Use it to
       conform to a non-default application binary interface.
  
! '-finstrument-functions'
       Generate instrumentation calls for entry and exit to functions.
       Just after function entry and just before function exit, the
       following profiling functions are called with the address of the
       current function and its call site.  (On some platforms,
!      '__builtin_return_address' does not work beyond the current
       function, so the call site information may not be available to the
       profiling functions otherwise.)
  
*************** form by either removing `no-' or adding
*** 21847,21873 ****
       function, which may be looked up exactly in the symbol table.
  
       This instrumentation is also done for functions expanded inline in
!      other functions.  The profiling calls indicate where,
!      conceptually, the inline function is entered and exited.  This
!      means that addressable versions of such functions must be
!      available.  If all your uses of a function are expanded inline,
!      this may mean an additional expansion of code size.  If you use
!      `extern inline' in your C code, an addressable version of such
!      functions must be provided.  (This is normally the case anyway,
!      but if you get lucky and the optimizer always expands the
!      functions inline, you might have gotten away without providing
!      static copies.)
  
!      A function may be given the attribute `no_instrument_function', in
       which case this instrumentation is not done.  This can be used, for
       example, for the profiling functions listed above, high-priority
       interrupt routines, and any functions from which the profiling
       functions cannot safely be called (perhaps signal handlers, if the
       profiling routines generate output or allocate memory).
  
! `-finstrument-functions-exclude-file-list=FILE,FILE,...'
       Set the list of functions that are excluded from instrumentation
!      (see the description of `-finstrument-functions').  If the file
       that contains a function definition matches with one of FILE, then
       that function is not instrumented.  The match is done on
       substrings: if the FILE parameter is a substring of the file name,
--- 21731,21757 ----
       function, which may be looked up exactly in the symbol table.
  
       This instrumentation is also done for functions expanded inline in
!      other functions.  The profiling calls indicate where, conceptually,
!      the inline function is entered and exited.  This means that
!      addressable versions of such functions must be available.  If all
!      your uses of a function are expanded inline, this may mean an
!      additional expansion of code size.  If you use 'extern inline' in
!      your C code, an addressable version of such functions must be
!      provided.  (This is normally the case anyway, but if you get lucky
!      and the optimizer always expands the functions inline, you might
!      have gotten away without providing static copies.)
  
!      A function may be given the attribute 'no_instrument_function', in
       which case this instrumentation is not done.  This can be used, for
       example, for the profiling functions listed above, high-priority
       interrupt routines, and any functions from which the profiling
       functions cannot safely be called (perhaps signal handlers, if the
       profiling routines generate output or allocate memory).
  
! '-finstrument-functions-exclude-file-list=FILE,FILE,...'
! 
       Set the list of functions that are excluded from instrumentation
!      (see the description of '-finstrument-functions').  If the file
       that contains a function definition matches with one of FILE, then
       that function is not instrumented.  The match is done on
       substrings: if the FILE parameter is a substring of the file name,
*************** form by either removing `no-' or adding
*** 21878,21919 ****
            -finstrument-functions-exclude-file-list=/bits/stl,include/sys
  
       excludes any inline function defined in files whose pathnames
!      contain `/bits/stl' or `include/sys'.
  
!      If, for some reason, you want to include letter `,' in one of SYM,
!      write `\,'. For example,
!      `-finstrument-functions-exclude-file-list='\,\,tmp'' (note the
       single quote surrounding the option).
  
! `-finstrument-functions-exclude-function-list=SYM,SYM,...'
!      This is similar to `-finstrument-functions-exclude-file-list', but
       this option sets the list of function names to be excluded from
       instrumentation.  The function name to be matched is its
!      user-visible name, such as `vector<int> blah(const vector<int>
!      &)', not the internal mangled name (e.g.,
!      `_Z4blahRSt6vectorIiSaIiEE').  The match is done on substrings: if
!      the SYM parameter is a substring of the function name, it is
!      considered to be a match.  For C99 and C++ extended identifiers,
!      the function name must be given in UTF-8, not using universal
!      character names.
  
! `-fstack-check'
       Generate code to verify that you do not go beyond the boundary of
       the stack.  You should specify this flag if you are running in an
       environment with multiple threads, but you only rarely need to
!      specify it in a single-threaded environment since stack overflow
!      is automatically detected on nearly all systems if there is only
!      one stack.
  
       Note that this switch does not actually cause checking to be done;
       the operating system or the language runtime must do that.  The
       switch causes generation of code to ensure that they see the stack
       being extended.
  
!      You can additionally specify a string parameter: `no' means no
!      checking, `generic' means force the use of old-style checking,
!      `specific' means use the best checking method and is equivalent to
!      bare `-fstack-check'.
  
       Old-style checking is a generic mechanism that requires no specific
       target support in the compiler but comes with the following
--- 21762,21803 ----
            -finstrument-functions-exclude-file-list=/bits/stl,include/sys
  
       excludes any inline function defined in files whose pathnames
!      contain '/bits/stl' or 'include/sys'.
  
!      If, for some reason, you want to include letter ',' in one of SYM,
!      write '\,'.  For example,
!      '-finstrument-functions-exclude-file-list='\,\,tmp'' (note the
       single quote surrounding the option).
  
! '-finstrument-functions-exclude-function-list=SYM,SYM,...'
! 
!      This is similar to '-finstrument-functions-exclude-file-list', but
       this option sets the list of function names to be excluded from
       instrumentation.  The function name to be matched is its
!      user-visible name, such as 'vector<int> blah(const vector<int> &)',
!      not the internal mangled name (e.g., '_Z4blahRSt6vectorIiSaIiEE').
!      The match is done on substrings: if the SYM parameter is a
!      substring of the function name, it is considered to be a match.
!      For C99 and C++ extended identifiers, the function name must be
!      given in UTF-8, not using universal character names.
  
! '-fstack-check'
       Generate code to verify that you do not go beyond the boundary of
       the stack.  You should specify this flag if you are running in an
       environment with multiple threads, but you only rarely need to
!      specify it in a single-threaded environment since stack overflow is
!      automatically detected on nearly all systems if there is only one
!      stack.
  
       Note that this switch does not actually cause checking to be done;
       the operating system or the language runtime must do that.  The
       switch causes generation of code to ensure that they see the stack
       being extended.
  
!      You can additionally specify a string parameter: 'no' means no
!      checking, 'generic' means force the use of old-style checking,
!      'specific' means use the best checking method and is equivalent to
!      bare '-fstack-check'.
  
       Old-style checking is a generic mechanism that requires no specific
       target support in the compiler but comes with the following
*************** form by either removing `no-' or adding
*** 21923,21942 ****
            always allocated dynamically if their size exceeds a fixed
            threshold.
  
!        2. Fixed limit on the size of the static frame of functions:
!           when it is topped by a particular function, stack checking is
!           not reliable and a warning is issued by the compiler.
  
!        3. Inefficiency: because of both the modified allocation
!           strategy and the generic implementation, code performance is
!           hampered.
  
       Note that old-style stack checking is also the fallback method for
!      `specific' if no target support has been added in the compiler.
  
! `-fstack-limit-register=REG'
! `-fstack-limit-symbol=SYM'
! `-fno-stack-limit'
       Generate code to ensure that the stack does not grow beyond a
       certain value, either the value of a register or the address of a
       symbol.  If a larger stack is required, a signal is raised at run
--- 21807,21825 ----
            always allocated dynamically if their size exceeds a fixed
            threshold.
  
!        2. Fixed limit on the size of the static frame of functions: when
!           it is topped by a particular function, stack checking is not
!           reliable and a warning is issued by the compiler.
  
!        3. Inefficiency: because of both the modified allocation strategy
!           and the generic implementation, code performance is hampered.
  
       Note that old-style stack checking is also the fallback method for
!      'specific' if no target support has been added in the compiler.
  
! '-fstack-limit-register=REG'
! '-fstack-limit-symbol=SYM'
! '-fno-stack-limit'
       Generate code to ensure that the stack does not grow beyond a
       certain value, either the value of a register or the address of a
       symbol.  If a larger stack is required, a signal is raised at run
*************** form by either removing `no-' or adding
*** 21944,21956 ****
       overruns the boundary, so it is possible to catch the signal
       without taking special precautions.
  
!      For instance, if the stack starts at absolute address `0x80000000'
       and grows downwards, you can use the flags
!      `-fstack-limit-symbol=__stack_limit' and
!      `-Wl,--defsym,__stack_limit=0x7ffe0000' to enforce a stack limit
!      of 128KB.  Note that this may only work with the GNU linker.
  
! `-fsplit-stack'
       Generate code to automatically split the stack before it overflows.
       The resulting program has a discontiguous stack which can only
       overflow if the program is unable to allocate any more memory.
--- 21827,21839 ----
       overruns the boundary, so it is possible to catch the signal
       without taking special precautions.
  
!      For instance, if the stack starts at absolute address '0x80000000'
       and grows downwards, you can use the flags
!      '-fstack-limit-symbol=__stack_limit' and
!      '-Wl,--defsym,__stack_limit=0x7ffe0000' to enforce a stack limit of
!      128KB.  Note that this may only work with the GNU linker.
  
! '-fsplit-stack'
       Generate code to automatically split the stack before it overflows.
       The resulting program has a discontiguous stack which can only
       overflow if the program is unable to allocate any more memory.
*************** form by either removing `no-' or adding
*** 21959,21996 ****
       thread.  This is currently only implemented for the x86 targets
       running GNU/Linux.
  
!      When code compiled with `-fsplit-stack' calls code compiled
!      without `-fsplit-stack', there may not be much stack space
!      available for the latter code to run.  If compiling all code,
!      including library code, with `-fsplit-stack' is not an option,
!      then the linker can fix up these calls so that the code compiled
!      without `-fsplit-stack' always has a large stack.  Support for
!      this is implemented in the gold linker in GNU binutils release 2.21
!      and later.
  
! `-fleading-underscore'
!      This option and its counterpart, `-fno-leading-underscore',
       forcibly change the way C symbols are represented in the object
       file.  One use is to help link with legacy assembly code.
  
!      *Warning:* the `-fleading-underscore' switch causes GCC to
!      generate code that is not binary compatible with code generated
!      without that switch.  Use it to conform to a non-default
!      application binary interface.  Not all targets provide complete
!      support for this switch.
  
! `-ftls-model=MODEL'
       Alter the thread-local storage model to be used (*note
       Thread-Local::).  The MODEL argument should be one of
!      `global-dynamic', `local-dynamic', `initial-exec' or `local-exec'.
       Note that the choice is subject to optimization: the compiler may
       use a more efficient model for symbols not visible outside of the
!      translation unit, or if `-fpic' is not given on the command line.
  
!      The default without `-fpic' is `initial-exec'; with `-fpic' the
!      default is `global-dynamic'.
  
! `-fvisibility=[default|internal|hidden|protected]'
       Set the default ELF image symbol visibility to the specified
       option--all symbols are marked with this unless overridden within
       the code.  Using this feature can very substantially improve
--- 21842,21879 ----
       thread.  This is currently only implemented for the x86 targets
       running GNU/Linux.
  
!      When code compiled with '-fsplit-stack' calls code compiled without
!      '-fsplit-stack', there may not be much stack space available for
!      the latter code to run.  If compiling all code, including library
!      code, with '-fsplit-stack' is not an option, then the linker can
!      fix up these calls so that the code compiled without
!      '-fsplit-stack' always has a large stack.  Support for this is
!      implemented in the gold linker in GNU binutils release 2.21 and
!      later.
  
! '-fleading-underscore'
!      This option and its counterpart, '-fno-leading-underscore',
       forcibly change the way C symbols are represented in the object
       file.  One use is to help link with legacy assembly code.
  
!      *Warning:* the '-fleading-underscore' switch causes GCC to generate
!      code that is not binary compatible with code generated without that
!      switch.  Use it to conform to a non-default application binary
!      interface.  Not all targets provide complete support for this
!      switch.
  
! '-ftls-model=MODEL'
       Alter the thread-local storage model to be used (*note
       Thread-Local::).  The MODEL argument should be one of
!      'global-dynamic', 'local-dynamic', 'initial-exec' or 'local-exec'.
       Note that the choice is subject to optimization: the compiler may
       use a more efficient model for symbols not visible outside of the
!      translation unit, or if '-fpic' is not given on the command line.
  
!      The default without '-fpic' is 'initial-exec'; with '-fpic' the
!      default is 'global-dynamic'.
  
! '-fvisibility=[default|internal|hidden|protected]'
       Set the default ELF image symbol visibility to the specified
       option--all symbols are marked with this unless overridden within
       the code.  Using this feature can very substantially improve
*************** form by either removing `no-' or adding
*** 21999,22027 ****
       clashes.  It is *strongly* recommended that you use this in any
       shared objects you distribute.
  
!      Despite the nomenclature, `default' always means public; i.e.,
       available to be linked against from outside the shared object.
!      `protected' and `internal' are pretty useless in real-world usage
!      so the only other commonly used option is `hidden'.  The default
!      if `-fvisibility' isn't specified is `default', i.e., make every
       symbol public.
  
       A good explanation of the benefits offered by ensuring ELF symbols
       have the correct visibility is given by "How To Write Shared
       Libraries" by Ulrich Drepper (which can be found at
!      `http://www.akkadia.org/drepper/')--however a superior solution
       made possible by this option to marking things hidden when the
       default is public is to make the default hidden and mark things
       public.  This is the norm with DLLs on Windows and with
!      `-fvisibility=hidden' and `__attribute__
!      ((visibility("default")))' instead of `__declspec(dllexport)' you
!      get almost identical semantics with identical syntax.  This is a
!      great boon to those working with cross-platform projects.
  
       For those adding visibility support to existing code, you may find
!      `#pragma GCC visibility' of use.  This works by you enclosing the
       declarations you wish to set visibility for with (for example)
!      `#pragma GCC visibility push(hidden)' and `#pragma GCC visibility
       pop'.  Bear in mind that symbol visibility should be viewed *as
       part of the API interface contract* and thus all new code should
       always specify visibility when it is not the default; i.e.,
--- 21882,21910 ----
       clashes.  It is *strongly* recommended that you use this in any
       shared objects you distribute.
  
!      Despite the nomenclature, 'default' always means public; i.e.,
       available to be linked against from outside the shared object.
!      'protected' and 'internal' are pretty useless in real-world usage
!      so the only other commonly used option is 'hidden'.  The default if
!      '-fvisibility' isn't specified is 'default', i.e., make every
       symbol public.
  
       A good explanation of the benefits offered by ensuring ELF symbols
       have the correct visibility is given by "How To Write Shared
       Libraries" by Ulrich Drepper (which can be found at
!      <http://www.akkadia.org/drepper/>)--however a superior solution
       made possible by this option to marking things hidden when the
       default is public is to make the default hidden and mark things
       public.  This is the norm with DLLs on Windows and with
!      '-fvisibility=hidden' and '__attribute__ ((visibility("default")))'
!      instead of '__declspec(dllexport)' you get almost identical
!      semantics with identical syntax.  This is a great boon to those
!      working with cross-platform projects.
  
       For those adding visibility support to existing code, you may find
!      '#pragma GCC visibility' of use.  This works by you enclosing the
       declarations you wish to set visibility for with (for example)
!      '#pragma GCC visibility push(hidden)' and '#pragma GCC visibility
       pop'.  Bear in mind that symbol visibility should be viewed *as
       part of the API interface contract* and thus all new code should
       always specify visibility when it is not the default; i.e.,
*************** form by either removing `no-' or adding
*** 22029,22071 ****
       marked explicitly as hidden as so to avoid PLT indirection
       overheads--making this abundantly clear also aids readability and
       self-documentation of the code.  Note that due to ISO C++
!      specification requirements, `operator new' and `operator delete'
       must always be of default visibility.
  
       Be aware that headers from outside your project, in particular
       system headers and headers from any other library you use, may not
!      be expecting to be compiled with visibility other than the
!      default.  You may need to explicitly say `#pragma GCC visibility
       push(default)' before including any such headers.
  
!      `extern' declarations are not affected by `-fvisibility', so a lot
!      of code can be recompiled with `-fvisibility=hidden' with no
!      modifications.  However, this means that calls to `extern'
       functions with no explicit visibility use the PLT, so it is more
!      effective to use `__attribute ((visibility))' and/or `#pragma GCC
!      visibility' to tell the compiler which `extern' declarations
!      should be treated as hidden.
  
!      Note that `-fvisibility' does affect C++ vague linkage entities.
!      This means that, for instance, an exception class that is be
!      thrown between DSOs must be explicitly marked with default
!      visibility so that the `type_info' nodes are unified between the
!      DSOs.
  
       An overview of these techniques, their benefits and how to use them
!      is at `http://gcc.gnu.org/wiki/Visibility'.
  
! `-fstrict-volatile-bitfields'
       This option should be used if accesses to volatile bit-fields (or
       other structure fields, although the compiler usually honors those
       types anyway) should use a single access of the width of the
       field's type, aligned to a natural alignment if possible.  For
       example, targets with memory-mapped peripheral registers might
       require all such accesses to be 16 bits wide; with this flag you
!      can declare all peripheral bit-fields as `unsigned short'
!      (assuming short is 16 bits on these targets) to force GCC to use
!      16-bit accesses instead of, perhaps, a more efficient 32-bit
!      access.
  
       If this option is disabled, the compiler uses the most efficient
       instruction.  In the previous example, that might be a 32-bit load
--- 21912,21952 ----
       marked explicitly as hidden as so to avoid PLT indirection
       overheads--making this abundantly clear also aids readability and
       self-documentation of the code.  Note that due to ISO C++
!      specification requirements, 'operator new' and 'operator delete'
       must always be of default visibility.
  
       Be aware that headers from outside your project, in particular
       system headers and headers from any other library you use, may not
!      be expecting to be compiled with visibility other than the default.
!      You may need to explicitly say '#pragma GCC visibility
       push(default)' before including any such headers.
  
!      'extern' declarations are not affected by '-fvisibility', so a lot
!      of code can be recompiled with '-fvisibility=hidden' with no
!      modifications.  However, this means that calls to 'extern'
       functions with no explicit visibility use the PLT, so it is more
!      effective to use '__attribute ((visibility))' and/or '#pragma GCC
!      visibility' to tell the compiler which 'extern' declarations should
!      be treated as hidden.
  
!      Note that '-fvisibility' does affect C++ vague linkage entities.
!      This means that, for instance, an exception class that is be thrown
!      between DSOs must be explicitly marked with default visibility so
!      that the 'type_info' nodes are unified between the DSOs.
  
       An overview of these techniques, their benefits and how to use them
!      is at <http://gcc.gnu.org/wiki/Visibility>.
  
! '-fstrict-volatile-bitfields'
       This option should be used if accesses to volatile bit-fields (or
       other structure fields, although the compiler usually honors those
       types anyway) should use a single access of the width of the
       field's type, aligned to a natural alignment if possible.  For
       example, targets with memory-mapped peripheral registers might
       require all such accesses to be 16 bits wide; with this flag you
!      can declare all peripheral bit-fields as 'unsigned short' (assuming
!      short is 16 bits on these targets) to force GCC to use 16-bit
!      accesses instead of, perhaps, a more efficient 32-bit access.
  
       If this option is disabled, the compiler uses the most efficient
       instruction.  In the previous example, that might be a 32-bit load
*************** form by either removing `no-' or adding
*** 22073,22086 ****
       any portion of the bit-field, or memory-mapped registers unrelated
       to the one being updated.
  
!      In some cases, such as when the `packed' attribute is applied to a
       structure field, it may not be possible to access the field with a
       single read or write that is correctly aligned for the target
       machine.  In this case GCC falls back to generating multiple
!      accesses rather than code that will fault or truncate the result
!      at run time.
  
!      Note:  Due to restrictions of the C/C++11 memory model, write
       accesses are not allowed to touch non bit-field members.  It is
       therefore recommended to define all bits of the field's type as
       bit-field members.
--- 21954,21967 ----
       any portion of the bit-field, or memory-mapped registers unrelated
       to the one being updated.
  
!      In some cases, such as when the 'packed' attribute is applied to a
       structure field, it may not be possible to access the field with a
       single read or write that is correctly aligned for the target
       machine.  In this case GCC falls back to generating multiple
!      accesses rather than code that will fault or truncate the result at
!      run time.
  
!      Note: Due to restrictions of the C/C++11 memory model, write
       accesses are not allowed to touch non bit-field members.  It is
       therefore recommended to define all bits of the field's type as
       bit-field members.
*************** form by either removing `no-' or adding
*** 22088,22102 ****
       The default value of this option is determined by the application
       binary interface for the target processor.
  
! `-fsync-libcalls'
       This option controls whether any out-of-line instance of the
!      `__sync' family of functions may be used to implement the C++11
!      `__atomic' family of functions.
  
       The default value of this option is enabled, thus the only useful
!      form of the option is `-fno-sync-libcalls'.  This option is used in
!      the implementation of the `libatomic' runtime library.
! 
  
  
  File: gcc.info,  Node: Environment Variables,  Next: Precompiled Headers,  Prev: Code Gen Options,  Up: Invoking GCC
--- 21969,21982 ----
       The default value of this option is determined by the application
       binary interface for the target processor.
  
! '-fsync-libcalls'
       This option controls whether any out-of-line instance of the
!      '__sync' family of functions may be used to implement the C++11
!      '__atomic' family of functions.
  
       The default value of this option is enabled, thus the only useful
!      form of the option is '-fno-sync-libcalls'.  This option is used in
!      the implementation of the 'libatomic' runtime library.
  
  
  File: gcc.info,  Node: Environment Variables,  Next: Precompiled Headers,  Prev: Code Gen Options,  Up: Invoking GCC
*************** File: gcc.info,  Node: Environment Varia
*** 22106,22280 ****
  
  This section describes several environment variables that affect how GCC
  operates.  Some of them work by specifying directories or prefixes to
! use when searching for various kinds of files.  Some are used to
! specify other aspects of the compilation environment.
  
   Note that you can also specify places to search using options such as
! `-B', `-I' and `-L' (*note Directory Options::).  These take precedence
  over places specified using environment variables, which in turn take
  precedence over those specified by the configuration of GCC.  *Note
! Controlling the Compilation Driver `gcc': (gccint)Driver.
  
! `LANG'
! `LC_CTYPE'
! `LC_MESSAGES'
! `LC_ALL'
       These environment variables control the way that GCC uses
       localization information which allows GCC to work with different
       national conventions.  GCC inspects the locale categories
!      `LC_CTYPE' and `LC_MESSAGES' if it has been configured to do so.
       These locale categories can be set to any value supported by your
!      installation.  A typical value is `en_GB.UTF-8' for English in the
       United Kingdom encoded in UTF-8.
  
!      The `LC_CTYPE' environment variable specifies character
       classification.  GCC uses it to determine the character boundaries
       in a string; this is needed for some multibyte encodings that
       contain quote and escape characters that are otherwise interpreted
       as a string end or escape.
  
!      The `LC_MESSAGES' environment variable specifies the language to
       use in diagnostic messages.
  
!      If the `LC_ALL' environment variable is set, it overrides the value
!      of `LC_CTYPE' and `LC_MESSAGES'; otherwise, `LC_CTYPE' and
!      `LC_MESSAGES' default to the value of the `LANG' environment
       variable.  If none of these variables are set, GCC defaults to
       traditional C English behavior.
  
! `TMPDIR'
!      If `TMPDIR' is set, it specifies the directory to use for temporary
       files.  GCC uses temporary files to hold the output of one stage of
       compilation which is to be used as input to the next stage: for
       example, the output of the preprocessor, which is the input to the
       compiler proper.
  
! `GCC_COMPARE_DEBUG'
!      Setting `GCC_COMPARE_DEBUG' is nearly equivalent to passing
!      `-fcompare-debug' to the compiler driver.  See the documentation
!      of this option for more details.
  
! `GCC_EXEC_PREFIX'
!      If `GCC_EXEC_PREFIX' is set, it specifies a prefix to use in the
       names of the subprograms executed by the compiler.  No slash is
       added when this prefix is combined with the name of a subprogram,
       but you can specify a prefix that ends with a slash if you wish.
  
!      If `GCC_EXEC_PREFIX' is not set, GCC attempts to figure out an
       appropriate prefix to use based on the pathname it is invoked with.
  
       If GCC cannot find the subprogram using the specified prefix, it
       tries looking in the usual places for the subprogram.
  
!      The default value of `GCC_EXEC_PREFIX' is `PREFIX/lib/gcc/' where
!      PREFIX is the prefix to the installed compiler. In many cases
!      PREFIX is the value of `prefix' when you ran the `configure'
       script.
  
!      Other prefixes specified with `-B' take precedence over this
       prefix.
  
!      This prefix is also used for finding files such as `crt0.o' that
       are used for linking.
  
       In addition, the prefix is used in an unusual way in finding the
       directories to search for header files.  For each of the standard
!      directories whose name normally begins with `/usr/local/lib/gcc'
!      (more precisely, with the value of `GCC_INCLUDE_DIR'), GCC tries
       replacing that beginning with the specified prefix to produce an
!      alternate directory name.  Thus, with `-Bfoo/', GCC searches
!      `foo/bar' just before it searches the standard directory
!      `/usr/local/lib/bar'.  If a standard directory begins with the
       configured PREFIX then the value of PREFIX is replaced by
!      `GCC_EXEC_PREFIX' when looking for header files.
  
! `COMPILER_PATH'
!      The value of `COMPILER_PATH' is a colon-separated list of
!      directories, much like `PATH'.  GCC tries the directories thus
       specified when searching for subprograms, if it can't find the
!      subprograms using `GCC_EXEC_PREFIX'.
  
! `LIBRARY_PATH'
!      The value of `LIBRARY_PATH' is a colon-separated list of
!      directories, much like `PATH'.  When configured as a native
       compiler, GCC tries the directories thus specified when searching
       for special linker files, if it can't find them using
!      `GCC_EXEC_PREFIX'.  Linking using GCC also uses these directories
!      when searching for ordinary libraries for the `-l' option (but
!      directories specified with `-L' come first).
  
! `LANG'
       This variable is used to pass locale information to the compiler.
       One way in which this information is used is to determine the
       character set to be used when character literals, string literals
       and comments are parsed in C and C++.  When the compiler is
       configured to allow multibyte characters, the following values for
!      `LANG' are recognized:
  
!     `C-JIS'
            Recognize JIS characters.
! 
!     `C-SJIS'
            Recognize SJIS characters.
! 
!     `C-EUCJP'
            Recognize EUCJP characters.
  
!      If `LANG' is not defined, or if it has some other value, then the
!      compiler uses `mblen' and `mbtowc' as defined by the default
!      locale to recognize and translate multibyte characters.
  
  Some additional environment variables affect the behavior of the
  preprocessor.
  
! `CPATH'
! `C_INCLUDE_PATH'
! `CPLUS_INCLUDE_PATH'
! `OBJC_INCLUDE_PATH'
       Each variable's value is a list of directories separated by a
!      special character, much like `PATH', in which to look for header
!      files.  The special character, `PATH_SEPARATOR', is
       target-dependent and determined at GCC build time.  For Microsoft
       Windows-based targets it is a semicolon, and for almost all other
       targets it is a colon.
  
!      `CPATH' specifies a list of directories to be searched as if
!      specified with `-I', but after any paths given with `-I' options
!      on the command line.  This environment variable is used regardless
!      of which language is being preprocessed.
  
       The remaining environment variables apply only when preprocessing
       the particular language indicated.  Each specifies a list of
!      directories to be searched as if specified with `-isystem', but
!      after any paths given with `-isystem' options on the command line.
  
       In all these variables, an empty element instructs the compiler to
!      search its current working directory.  Empty elements can appear
!      at the beginning or end of a path.  For instance, if the value of
!      `CPATH' is `:/special/include', that has the same effect as
!      `-I. -I/special/include'.
  
! `DEPENDENCIES_OUTPUT'
       If this variable is set, its value specifies how to output
       dependencies for Make based on the non-system header files
       processed by the compiler.  System header files are ignored in the
       dependency output.
  
!      The value of `DEPENDENCIES_OUTPUT' can be just a file name, in
       which case the Make rules are written to that file, guessing the
       target name from the source file name.  Or the value can have the
!      form `FILE TARGET', in which case the rules are written to file
       FILE using TARGET as the target name.
  
       In other words, this environment variable is equivalent to
!      combining the options `-MM' and `-MF' (*note Preprocessor
!      Options::), with an optional `-MT' switch too.
  
! `SUNPRO_DEPENDENCIES'
!      This variable is the same as `DEPENDENCIES_OUTPUT' (see above),
!      except that system header files are not ignored, so it implies
!      `-M' rather than `-MM'.  However, the dependence on the main input
!      file is omitted.  *Note Preprocessor Options::.
  
  
  File: gcc.info,  Node: Precompiled Headers,  Prev: Environment Variables,  Up: Invoking GCC
--- 21986,22158 ----
  
  This section describes several environment variables that affect how GCC
  operates.  Some of them work by specifying directories or prefixes to
! use when searching for various kinds of files.  Some are used to specify
! other aspects of the compilation environment.
  
   Note that you can also specify places to search using options such as
! '-B', '-I' and '-L' (*note Directory Options::).  These take precedence
  over places specified using environment variables, which in turn take
  precedence over those specified by the configuration of GCC.  *Note
! Controlling the Compilation Driver 'gcc': (gccint)Driver.
  
! 'LANG'
! 'LC_CTYPE'
! 'LC_MESSAGES'
! 'LC_ALL'
       These environment variables control the way that GCC uses
       localization information which allows GCC to work with different
       national conventions.  GCC inspects the locale categories
!      'LC_CTYPE' and 'LC_MESSAGES' if it has been configured to do so.
       These locale categories can be set to any value supported by your
!      installation.  A typical value is 'en_GB.UTF-8' for English in the
       United Kingdom encoded in UTF-8.
  
!      The 'LC_CTYPE' environment variable specifies character
       classification.  GCC uses it to determine the character boundaries
       in a string; this is needed for some multibyte encodings that
       contain quote and escape characters that are otherwise interpreted
       as a string end or escape.
  
!      The 'LC_MESSAGES' environment variable specifies the language to
       use in diagnostic messages.
  
!      If the 'LC_ALL' environment variable is set, it overrides the value
!      of 'LC_CTYPE' and 'LC_MESSAGES'; otherwise, 'LC_CTYPE' and
!      'LC_MESSAGES' default to the value of the 'LANG' environment
       variable.  If none of these variables are set, GCC defaults to
       traditional C English behavior.
  
! 'TMPDIR'
!      If 'TMPDIR' is set, it specifies the directory to use for temporary
       files.  GCC uses temporary files to hold the output of one stage of
       compilation which is to be used as input to the next stage: for
       example, the output of the preprocessor, which is the input to the
       compiler proper.
  
! 'GCC_COMPARE_DEBUG'
!      Setting 'GCC_COMPARE_DEBUG' is nearly equivalent to passing
!      '-fcompare-debug' to the compiler driver.  See the documentation of
!      this option for more details.
  
! 'GCC_EXEC_PREFIX'
!      If 'GCC_EXEC_PREFIX' is set, it specifies a prefix to use in the
       names of the subprograms executed by the compiler.  No slash is
       added when this prefix is combined with the name of a subprogram,
       but you can specify a prefix that ends with a slash if you wish.
  
!      If 'GCC_EXEC_PREFIX' is not set, GCC attempts to figure out an
       appropriate prefix to use based on the pathname it is invoked with.
  
       If GCC cannot find the subprogram using the specified prefix, it
       tries looking in the usual places for the subprogram.
  
!      The default value of 'GCC_EXEC_PREFIX' is 'PREFIX/lib/gcc/' where
!      PREFIX is the prefix to the installed compiler.  In many cases
!      PREFIX is the value of 'prefix' when you ran the 'configure'
       script.
  
!      Other prefixes specified with '-B' take precedence over this
       prefix.
  
!      This prefix is also used for finding files such as 'crt0.o' that
       are used for linking.
  
       In addition, the prefix is used in an unusual way in finding the
       directories to search for header files.  For each of the standard
!      directories whose name normally begins with '/usr/local/lib/gcc'
!      (more precisely, with the value of 'GCC_INCLUDE_DIR'), GCC tries
       replacing that beginning with the specified prefix to produce an
!      alternate directory name.  Thus, with '-Bfoo/', GCC searches
!      'foo/bar' just before it searches the standard directory
!      '/usr/local/lib/bar'.  If a standard directory begins with the
       configured PREFIX then the value of PREFIX is replaced by
!      'GCC_EXEC_PREFIX' when looking for header files.
  
! 'COMPILER_PATH'
!      The value of 'COMPILER_PATH' is a colon-separated list of
!      directories, much like 'PATH'.  GCC tries the directories thus
       specified when searching for subprograms, if it can't find the
!      subprograms using 'GCC_EXEC_PREFIX'.
  
! 'LIBRARY_PATH'
!      The value of 'LIBRARY_PATH' is a colon-separated list of
!      directories, much like 'PATH'.  When configured as a native
       compiler, GCC tries the directories thus specified when searching
       for special linker files, if it can't find them using
!      'GCC_EXEC_PREFIX'.  Linking using GCC also uses these directories
!      when searching for ordinary libraries for the '-l' option (but
!      directories specified with '-L' come first).
  
! 'LANG'
       This variable is used to pass locale information to the compiler.
       One way in which this information is used is to determine the
       character set to be used when character literals, string literals
       and comments are parsed in C and C++.  When the compiler is
       configured to allow multibyte characters, the following values for
!      'LANG' are recognized:
  
!      'C-JIS'
            Recognize JIS characters.
!      'C-SJIS'
            Recognize SJIS characters.
!      'C-EUCJP'
            Recognize EUCJP characters.
  
!      If 'LANG' is not defined, or if it has some other value, then the
!      compiler uses 'mblen' and 'mbtowc' as defined by the default locale
!      to recognize and translate multibyte characters.
  
  Some additional environment variables affect the behavior of the
  preprocessor.
  
! 'CPATH'
! 'C_INCLUDE_PATH'
! 'CPLUS_INCLUDE_PATH'
! 'OBJC_INCLUDE_PATH'
       Each variable's value is a list of directories separated by a
!      special character, much like 'PATH', in which to look for header
!      files.  The special character, 'PATH_SEPARATOR', is
       target-dependent and determined at GCC build time.  For Microsoft
       Windows-based targets it is a semicolon, and for almost all other
       targets it is a colon.
  
!      'CPATH' specifies a list of directories to be searched as if
!      specified with '-I', but after any paths given with '-I' options on
!      the command line.  This environment variable is used regardless of
!      which language is being preprocessed.
  
       The remaining environment variables apply only when preprocessing
       the particular language indicated.  Each specifies a list of
!      directories to be searched as if specified with '-isystem', but
!      after any paths given with '-isystem' options on the command line.
  
       In all these variables, an empty element instructs the compiler to
!      search its current working directory.  Empty elements can appear at
!      the beginning or end of a path.  For instance, if the value of
!      'CPATH' is ':/special/include', that has the same effect as
!      '-I. -I/special/include'.
  
! 'DEPENDENCIES_OUTPUT'
       If this variable is set, its value specifies how to output
       dependencies for Make based on the non-system header files
       processed by the compiler.  System header files are ignored in the
       dependency output.
  
!      The value of 'DEPENDENCIES_OUTPUT' can be just a file name, in
       which case the Make rules are written to that file, guessing the
       target name from the source file name.  Or the value can have the
!      form 'FILE TARGET', in which case the rules are written to file
       FILE using TARGET as the target name.
  
       In other words, this environment variable is equivalent to
!      combining the options '-MM' and '-MF' (*note Preprocessor
!      Options::), with an optional '-MT' switch too.
  
! 'SUNPRO_DEPENDENCIES'
!      This variable is the same as 'DEPENDENCIES_OUTPUT' (see above),
!      except that system header files are not ignored, so it implies '-M'
!      rather than '-MM'.  However, the dependence on the main input file
!      is omitted.  *Note Preprocessor Options::.
  
  
  File: gcc.info,  Node: Precompiled Headers,  Prev: Environment Variables,  Up: Invoking GCC
*************** build the project.  To make builds faste
*** 22289,22334 ****
  "precompile" a header file.
  
   To create a precompiled header file, simply compile it as you would any
! other file, if necessary using the `-x' option to make the driver treat
! it as a C or C++ header file.  You may want to use a tool like `make'
! to keep the precompiled header up-to-date when the headers it contains
  change.
  
!  A precompiled header file is searched for when `#include' is seen in
  the compilation.  As it searches for the included file (*note Search
  Path: (cpp)Search Path.) the compiler looks for a precompiled header in
  each directory just before it looks for the include file in that
  directory.  The name searched for is the name specified in the
! `#include' with `.gch' appended.  If the precompiled header file can't
  be used, it is ignored.
  
!  For instance, if you have `#include "all.h"', and you have `all.h.gch'
! in the same directory as `all.h', then the precompiled header file is
  used if possible, and the original header is used otherwise.
  
   Alternatively, you might decide to put the precompiled header file in a
! directory and use `-I' to ensure that directory is searched before (or
  instead of) the directory containing the original header.  Then, if you
  want to check that the precompiled header file is always used, you can
  put a file of the same name as the original header in this directory
! containing an `#error' command.
  
!  This also works with `-include'.  So yet another way to use
! precompiled headers, good for projects not designed with precompiled
! header files in mind, is to simply take most of the header files used by
! a project, include them from another header file, precompile that header
! file, and `-include' the precompiled header.  If the header files have
! guards against multiple inclusion, they are skipped because they've
! already been included (in the precompiled header).
  
!  If you need to precompile the same header file for different
! languages, targets, or compiler options, you can instead make a
! _directory_ named like `all.h.gch', and put each precompiled header in
! the directory, perhaps using `-o'.  It doesn't matter what you call the
! files in the directory; every precompiled header in the directory is
! considered.  The first precompiled header encountered in the directory
! that is valid for this compilation is used; they're searched in no
! particular order.
  
   There are many other possibilities, limited only by your imagination,
  good sense, and the constraints of your build system.
--- 22167,22211 ----
  "precompile" a header file.
  
   To create a precompiled header file, simply compile it as you would any
! other file, if necessary using the '-x' option to make the driver treat
! it as a C or C++ header file.  You may want to use a tool like 'make' to
! keep the precompiled header up-to-date when the headers it contains
  change.
  
!  A precompiled header file is searched for when '#include' is seen in
  the compilation.  As it searches for the included file (*note Search
  Path: (cpp)Search Path.) the compiler looks for a precompiled header in
  each directory just before it looks for the include file in that
  directory.  The name searched for is the name specified in the
! '#include' with '.gch' appended.  If the precompiled header file can't
  be used, it is ignored.
  
!  For instance, if you have '#include "all.h"', and you have 'all.h.gch'
! in the same directory as 'all.h', then the precompiled header file is
  used if possible, and the original header is used otherwise.
  
   Alternatively, you might decide to put the precompiled header file in a
! directory and use '-I' to ensure that directory is searched before (or
  instead of) the directory containing the original header.  Then, if you
  want to check that the precompiled header file is always used, you can
  put a file of the same name as the original header in this directory
! containing an '#error' command.
  
!  This also works with '-include'.  So yet another way to use precompiled
! headers, good for projects not designed with precompiled header files in
! mind, is to simply take most of the header files used by a project,
! include them from another header file, precompile that header file, and
! '-include' the precompiled header.  If the header files have guards
! against multiple inclusion, they are skipped because they've already
! been included (in the precompiled header).
  
!  If you need to precompile the same header file for different languages,
! targets, or compiler options, you can instead make a _directory_ named
! like 'all.h.gch', and put each precompiled header in the directory,
! perhaps using '-o'.  It doesn't matter what you call the files in the
! directory; every precompiled header in the directory is considered.  The
! first precompiled header encountered in the directory that is valid for
! this compilation is used; they're searched in no particular order.
  
   There are many other possibilities, limited only by your imagination,
  good sense, and the constraints of your build system.
*************** good sense, and the constraints of your
*** 22355,22373 ****
       usually means that they don't appear in the precompiled header at
       all.
  
!      The `-D' option is one way to define a macro before a precompiled
!      header is included; using a `#define' can also do it.  There are
!      also some options that define macros implicitly, like `-O' and
!      `-Wdeprecated'; the same rule applies to macros defined this way.
  
     * If debugging information is output when using the precompiled
!      header, using `-g' or similar, the same kind of debugging
       information must have been output when building the precompiled
!      header.  However, a precompiled header built using `-g' can be
!      used in a compilation when no debugging information is being
!      output.
  
!    * The same `-m' options must generally be used when building and
       using the precompiled header.  *Note Submodel Options::, for any
       cases where this rule is relaxed.
  
--- 22232,22249 ----
       usually means that they don't appear in the precompiled header at
       all.
  
!      The '-D' option is one way to define a macro before a precompiled
!      header is included; using a '#define' can also do it.  There are
!      also some options that define macros implicitly, like '-O' and
!      '-Wdeprecated'; the same rule applies to macros defined this way.
  
     * If debugging information is output when using the precompiled
!      header, using '-g' or similar, the same kind of debugging
       information must have been output when building the precompiled
!      header.  However, a precompiled header built using '-g' can be used
!      in a compilation when no debugging information is being output.
  
!    * The same '-m' options must generally be used when building and
       using the precompiled header.  *Note Submodel Options::, for any
       cases where this rule is relaxed.
  
*************** good sense, and the constraints of your
*** 22376,22394 ****
  
            -fexceptions
  
!    * Some other command-line options starting with `-f', `-p', or `-O'
       must be defined in the same way as when the precompiled header was
       generated.  At present, it's not clear which options are safe to
       change and which are not; the safest choice is to use exactly the
!      same options when generating and using the precompiled header.
!      The following are known to be safe:
  
            -fmessage-length=  -fpreprocessed  -fsched-interblock
            -fsched-spec  -fsched-spec-load  -fsched-spec-load-dangerous
            -fsched-verbose=NUMBER  -fschedule-insns  -fvisibility=
            -pedantic-errors
  
- 
   For all of these except the last, the compiler automatically ignores
  the precompiled header if the conditions aren't met.  If you find an
  option combination that doesn't work and doesn't cause the precompiled
--- 22252,22269 ----
  
            -fexceptions
  
!    * Some other command-line options starting with '-f', '-p', or '-O'
       must be defined in the same way as when the precompiled header was
       generated.  At present, it's not clear which options are safe to
       change and which are not; the safest choice is to use exactly the
!      same options when generating and using the precompiled header.  The
!      following are known to be safe:
  
            -fmessage-length=  -fpreprocessed  -fsched-interblock
            -fsched-spec  -fsched-spec-load  -fsched-spec-load-dangerous
            -fsched-verbose=NUMBER  -fschedule-insns  -fvisibility=
            -pedantic-errors
  
   For all of these except the last, the compiler automatically ignores
  the precompiled header if the conditions aren't met.  If you find an
  option combination that doesn't work and doesn't cause the precompiled
*************** header to be ignored, please consider fi
*** 22396,22405 ****
  Bugs::.
  
   If you do use differing options when generating and using the
! precompiled header, the actual behavior is a mixture of the behavior
! for the options.  For instance, if you use `-g' to generate the
! precompiled header but not when using it, you may or may not get
! debugging information for routines in the precompiled header.
  
  
  File: gcc.info,  Node: C Implementation,  Next: C++ Implementation,  Prev: Invoking GCC,  Up: Top
--- 22271,22280 ----
  Bugs::.
  
   If you do use differing options when generating and using the
! precompiled header, the actual behavior is a mixture of the behavior for
! the options.  For instance, if you use '-g' to generate the precompiled
! header but not when using it, you may or may not get debugging
! information for routines in the precompiled header.
  
  
  File: gcc.info,  Node: C Implementation,  Next: C++ Implementation,  Prev: Invoking GCC,  Up: Top
*************** version of the standard.
*** 22417,22428 ****
   Some choices depend on the externally determined ABI for the platform
  (including standard character encodings) which GCC follows; these are
  listed as "determined by ABI" below.  *Note Binary Compatibility:
! Compatibility, and `http://gcc.gnu.org/readings.html'.  Some choices
! are documented in the preprocessor manual.  *Note
! Implementation-defined behavior: (cpp)Implementation-defined behavior.
! Some choices are made by the library and operating system (or other
! environment when compiling for a freestanding environment); refer to
! their documentation for details.
  
  * Menu:
  
--- 22292,22303 ----
   Some choices depend on the externally determined ABI for the platform
  (including standard character encodings) which GCC follows; these are
  listed as "determined by ABI" below.  *Note Binary Compatibility:
! Compatibility, and <http://gcc.gnu.org/readings.html>.  Some choices are
! documented in the preprocessor manual.  *Note Implementation-defined
! behavior: (cpp)Implementation-defined behavior.  Some choices are made
! by the library and operating system (or other environment when compiling
! for a freestanding environment); refer to their documentation for
! details.
  
  * Menu:
  
*************** File: gcc.info,  Node: Translation imple
*** 22449,22467 ****
  4.1 Translation
  ===============
  
!    * `How a diagnostic is identified (C90 3.7, C99 and C11 3.10, C90,
       C99 and C11 5.1.1.3).'
  
       Diagnostics consist of all the output sent to stderr by GCC.
  
!    * `Whether each nonempty sequence of white-space characters other
       than new-line is retained or replaced by one space character in
       translation phase 3 (C90, C99 and C11 5.1.1.2).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
- 
  
  File: gcc.info,  Node: Environment implementation,  Next: Identifiers implementation,  Prev: Translation implementation,  Up: C Implementation
  
--- 22324,22341 ----
  4.1 Translation
  ===============
  
!    * 'How a diagnostic is identified (C90 3.7, C99 and C11 3.10, C90,
       C99 and C11 5.1.1.3).'
  
       Diagnostics consist of all the output sent to stderr by GCC.
  
!    * 'Whether each nonempty sequence of white-space characters other
       than new-line is retained or replaced by one space character in
       translation phase 3 (C90, C99 and C11 5.1.1.2).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
  
  File: gcc.info,  Node: Environment implementation,  Next: Identifiers implementation,  Prev: Translation implementation,  Up: C Implementation
  
*************** File: gcc.info,  Node: Environment imple
*** 22471,22608 ****
  The behavior of most of these points are dependent on the implementation
  of the C library, and are not defined by GCC itself.
  
!    * `The mapping between physical source file multibyte characters and
       the source character set in translation phase 1 (C90, C99 and C11
       5.1.1.2).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
- 
  
  File: gcc.info,  Node: Identifiers implementation,  Next: Characters implementation,  Prev: Environment implementation,  Up: C Implementation
  
  4.3 Identifiers
  ===============
  
!    * `Which additional multibyte characters may appear in identifiers
       and their correspondence to universal character names (C99 and C11
       6.4.2).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * `The number of significant initial characters in an identifier
!      (C90 6.1.2, C90, C99 and C11 5.2.4.1, C99 and C11 6.4.2).'
  
       For internal names, all characters are significant.  For external
       names, the number of significant characters are defined by the
       linker; for almost all targets, all characters are significant.
  
!    * `Whether case distinctions are significant in an identifier with
       external linkage (C90 6.1.2).'
  
       This is a property of the linker.  C99 and C11 require that case
       distinctions are always significant in identifiers with external
       linkage and systems without this property are not supported by GCC.
  
- 
  
  File: gcc.info,  Node: Characters implementation,  Next: Integers implementation,  Prev: Identifiers implementation,  Up: C Implementation
  
  4.4 Characters
  ==============
  
!    * `The number of bits in a byte (C90 3.4, C99 and C11 3.6).'
  
       Determined by ABI.
  
!    * `The values of the members of the execution character set (C90,
!      C99 and C11 5.2.1).'
  
       Determined by ABI.
  
!    * `The unique value of the member of the execution character set
!      produced for each of the standard alphabetic escape sequences
!      (C90, C99 and C11 5.2.2).'
  
       Determined by ABI.
  
!    * `The value of a `char' object into which has been stored any
       character other than a member of the basic execution character set
       (C90 6.1.2.5, C99 and C11 6.2.5).'
  
       Determined by ABI.
  
!    * `Which of `signed char' or `unsigned char' has the same range,
!      representation, and behavior as "plain" `char' (C90 6.1.2.5, C90
       6.2.1.1, C99 and C11 6.2.5, C99 and C11 6.3.1.1).'
  
!      Determined by ABI.  The options `-funsigned-char' and
!      `-fsigned-char' change the default.  *Note Options Controlling C
       Dialect: C Dialect Options.
  
!    * `The mapping of members of the source character set (in character
       constants and string literals) to members of the execution
       character set (C90 6.1.3.4, C99 and C11 6.4.4.4, C90, C99 and C11
       5.1.1.2).'
  
       Determined by ABI.
  
!    * `The value of an integer character constant containing more than
       one character or containing a character or escape sequence that
!      does not map to a single-byte execution character (C90 6.1.3.4,
!      C99 and C11 6.4.4.4).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * `The value of a wide character constant containing more than one
       multibyte character or a single multibyte character that maps to
       multiple members of the extended execution character set, or
!      containing a multibyte character or escape sequence not
!      represented in the extended execution character set (C90 6.1.3.4,
!      C99 and C11 6.4.4.4).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * `The current locale used to convert a wide character constant
!      consisting of a single multibyte character that maps to a member
!      of the extended execution character set into a corresponding wide
       character code (C90 6.1.3.4, C99 and C11 6.4.4.4).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * `Whether differently-prefixed wide string literal tokens can be
       concatenated and, if so, the treatment of the resulting multibyte
       character sequence (C11 6.4.5).'
  
       Such tokens may not be concatenated.
  
!    * `The current locale used to convert a wide string literal into
       corresponding wide character codes (C90 6.1.4, C99 and C11 6.4.5).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * `The value of a string literal containing a multibyte character or
!      escape sequence not represented in the execution character set
!      (C90 6.1.4, C99 and C11 6.4.5).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * `The encoding of any of `wchar_t', `char16_t', and `char32_t'
!      where the corresponding standard encoding macro
!      (`__STDC_ISO_10646__', `__STDC_UTF_16__', or `__STDC_UTF_32__') is
!      not defined (C11 6.10.8.2).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
!      behavior.  `char16_t' and `char32_t' literals are always encoded
!      in UTF-16 and UTF-32 respectively.
! 
  
  
  File: gcc.info,  Node: Integers implementation,  Next: Floating point implementation,  Prev: Characters implementation,  Up: C Implementation
--- 22345,22479 ----
  The behavior of most of these points are dependent on the implementation
  of the C library, and are not defined by GCC itself.
  
!    * 'The mapping between physical source file multibyte characters and
       the source character set in translation phase 1 (C90, C99 and C11
       5.1.1.2).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
  
  File: gcc.info,  Node: Identifiers implementation,  Next: Characters implementation,  Prev: Environment implementation,  Up: C Implementation
  
  4.3 Identifiers
  ===============
  
!    * 'Which additional multibyte characters may appear in identifiers
       and their correspondence to universal character names (C99 and C11
       6.4.2).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * 'The number of significant initial characters in an identifier (C90
!      6.1.2, C90, C99 and C11 5.2.4.1, C99 and C11 6.4.2).'
  
       For internal names, all characters are significant.  For external
       names, the number of significant characters are defined by the
       linker; for almost all targets, all characters are significant.
  
!    * 'Whether case distinctions are significant in an identifier with
       external linkage (C90 6.1.2).'
  
       This is a property of the linker.  C99 and C11 require that case
       distinctions are always significant in identifiers with external
       linkage and systems without this property are not supported by GCC.
  
  
  File: gcc.info,  Node: Characters implementation,  Next: Integers implementation,  Prev: Identifiers implementation,  Up: C Implementation
  
  4.4 Characters
  ==============
  
!    * 'The number of bits in a byte (C90 3.4, C99 and C11 3.6).'
  
       Determined by ABI.
  
!    * 'The values of the members of the execution character set (C90, C99
!      and C11 5.2.1).'
  
       Determined by ABI.
  
!    * 'The unique value of the member of the execution character set
!      produced for each of the standard alphabetic escape sequences (C90,
!      C99 and C11 5.2.2).'
  
       Determined by ABI.
  
!    * 'The value of a 'char' object into which has been stored any
       character other than a member of the basic execution character set
       (C90 6.1.2.5, C99 and C11 6.2.5).'
  
       Determined by ABI.
  
!    * 'Which of 'signed char' or 'unsigned char' has the same range,
!      representation, and behavior as "plain" 'char' (C90 6.1.2.5, C90
       6.2.1.1, C99 and C11 6.2.5, C99 and C11 6.3.1.1).'
  
!      Determined by ABI.  The options '-funsigned-char' and
!      '-fsigned-char' change the default.  *Note Options Controlling C
       Dialect: C Dialect Options.
  
!    * 'The mapping of members of the source character set (in character
       constants and string literals) to members of the execution
       character set (C90 6.1.3.4, C99 and C11 6.4.4.4, C90, C99 and C11
       5.1.1.2).'
  
       Determined by ABI.
  
!    * 'The value of an integer character constant containing more than
       one character or containing a character or escape sequence that
!      does not map to a single-byte execution character (C90 6.1.3.4, C99
!      and C11 6.4.4.4).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * 'The value of a wide character constant containing more than one
       multibyte character or a single multibyte character that maps to
       multiple members of the extended execution character set, or
!      containing a multibyte character or escape sequence not represented
!      in the extended execution character set (C90 6.1.3.4, C99 and C11
!      6.4.4.4).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * 'The current locale used to convert a wide character constant
!      consisting of a single multibyte character that maps to a member of
!      the extended execution character set into a corresponding wide
       character code (C90 6.1.3.4, C99 and C11 6.4.4.4).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * 'Whether differently-prefixed wide string literal tokens can be
       concatenated and, if so, the treatment of the resulting multibyte
       character sequence (C11 6.4.5).'
  
       Such tokens may not be concatenated.
  
!    * 'The current locale used to convert a wide string literal into
       corresponding wide character codes (C90 6.1.4, C99 and C11 6.4.5).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * 'The value of a string literal containing a multibyte character or
!      escape sequence not represented in the execution character set (C90
!      6.1.4, C99 and C11 6.4.5).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
       behavior.
  
!    * 'The encoding of any of 'wchar_t', 'char16_t', and 'char32_t' where
!      the corresponding standard encoding macro ('__STDC_ISO_10646__',
!      '__STDC_UTF_16__', or '__STDC_UTF_32__') is not defined (C11
!      6.10.8.2).'
  
       *Note Implementation-defined behavior: (cpp)Implementation-defined
!      behavior.  'char16_t' and 'char32_t' literals are always encoded in
!      UTF-16 and UTF-32 respectively.
  
  
  File: gcc.info,  Node: Integers implementation,  Next: Floating point implementation,  Prev: Characters implementation,  Up: C Implementation
*************** File: gcc.info,  Node: Integers implemen
*** 22610,22621 ****
  4.5 Integers
  ============
  
!    * `Any extended integer types that exist in the implementation (C99
       and C11 6.2.5).'
  
       GCC does not support any extended integer types.
  
!    * `Whether signed integer types are represented using sign and
       magnitude, two's complement, or one's complement, and whether the
       extraordinary value is a trap representation or an ordinary value
       (C99 and C11 6.2.6.2).'
--- 22481,22492 ----
  4.5 Integers
  ============
  
!    * 'Any extended integer types that exist in the implementation (C99
       and C11 6.2.5).'
  
       GCC does not support any extended integer types.
  
!    * 'Whether signed integer types are represented using sign and
       magnitude, two's complement, or one's complement, and whether the
       extraordinary value is a trap representation or an ordinary value
       (C99 and C11 6.2.6.2).'
*************** File: gcc.info,  Node: Integers implemen
*** 22623,22748 ****
       GCC supports only two's complement integer types, and all bit
       patterns are ordinary values.
  
!    * `The rank of any extended integer type relative to another extended
       integer type with the same precision (C99 and C11 6.3.1.1).'
  
       GCC does not support any extended integer types.
  
!    * `The result of, or the signal raised by, converting an integer to a
       signed integer type when the value cannot be represented in an
       object of that type (C90 6.2.1.2, C99 and C11 6.3.1.3).'
  
       For conversion to a type of width N, the value is reduced modulo
       2^N to be within range of the type; no signal is raised.
  
!    * `The results of some bitwise operations on signed integers (C90
       6.3, C99 and C11 6.5).'
  
       Bitwise operators act on the representation of the value including
       both the sign and value bits, where the sign bit is considered
!      immediately above the highest-value value bit.  Signed `>>' acts
!      on negative numbers by sign extension.
  
       GCC does not use the latitude given in C99 and C11 only to treat
!      certain aspects of signed `<<' as undefined, but this is subject to
       change.
  
!    * `The sign of the remainder on integer division (C90 6.3.5).'
  
       GCC always follows the C99 and C11 requirement that the result of
       division is truncated towards zero.
  
- 
  
  File: gcc.info,  Node: Floating point implementation,  Next: Arrays and pointers implementation,  Prev: Integers implementation,  Up: C Implementation
  
  4.6 Floating Point
  ==================
  
!    * `The accuracy of the floating-point operations and of the library
!      functions in `<math.h>' and `<complex.h>' that return
       floating-point results (C90, C99 and C11 5.2.4.2.2).'
  
       The accuracy is unknown.
  
!    * `The rounding behaviors characterized by non-standard values of
!      `FLT_ROUNDS'  (C90, C99 and C11 5.2.4.2.2).'
  
       GCC does not use such values.
  
!    * `The evaluation methods characterized by non-standard negative
!      values of `FLT_EVAL_METHOD' (C99 and C11 5.2.4.2.2).'
  
       GCC does not use such values.
  
!    * `The direction of rounding when an integer is converted to a
       floating-point number that cannot exactly represent the original
       value (C90 6.2.1.3, C99 and C11 6.3.1.4).'
  
       C99 Annex F is followed.
  
!    * `The direction of rounding when a floating-point number is
!      converted to a narrower floating-point number (C90 6.2.1.4, C99
!      and C11 6.3.1.5).'
  
       C99 Annex F is followed.
  
!    * `How the nearest representable value or the larger or smaller
       representable value immediately adjacent to the nearest
       representable value is chosen for certain floating constants (C90
       6.1.3.1, C99 and C11 6.4.4.2).'
  
       C99 Annex F is followed.
  
!    * `Whether and how floating expressions are contracted when not
!      disallowed by the `FP_CONTRACT' pragma (C99 and C11 6.5).'
  
!      Expressions are currently only contracted if `-ffp-contract=fast',
!      `-funsafe-math-optimizations' or `-ffast-math' are used.  This is
       subject to change.
  
!    * `The default state for the `FENV_ACCESS' pragma (C99 and C11
       7.6.1).'
  
       This pragma is not implemented, but the default is to "off" unless
!      `-frounding-math' is used in which case it is "on".
  
!    * `Additional floating-point exceptions, rounding modes,
       environments, and classifications, and their macro names (C99 and
       C11 7.6, C99 and C11 7.12).'
  
       This is dependent on the implementation of the C library, and is
       not defined by GCC itself.
  
!    * `The default state for the `FP_CONTRACT' pragma (C99 and C11
       7.12.2).'
  
       This pragma is not implemented.  Expressions are currently only
!      contracted if `-ffp-contract=fast', `-funsafe-math-optimizations'
!      or `-ffast-math' are used.  This is subject to change.
  
!    * `Whether the "inexact" floating-point exception can be raised when
       the rounded result actually does equal the mathematical result in
       an IEC 60559 conformant implementation (C99 F.9).'
  
       This is dependent on the implementation of the C library, and is
       not defined by GCC itself.
  
!    * `Whether the "underflow" (and "inexact") floating-point exception
!      can be raised when a result is tiny but not inexact in an IEC
!      60559 conformant implementation (C99 F.9).'
  
       This is dependent on the implementation of the C library, and is
       not defined by GCC itself.
  
- 
  
  File: gcc.info,  Node: Arrays and pointers implementation,  Next: Hints implementation,  Prev: Floating point implementation,  Up: C Implementation
  
  4.7 Arrays and Pointers
  =======================
  
!    * `The result of converting a pointer to an integer or vice versa
       (C90 6.3.4, C99 and C11 6.3.2.3).'
  
       A cast from pointer to integer discards most-significant bits if
--- 22494,22617 ----
       GCC supports only two's complement integer types, and all bit
       patterns are ordinary values.
  
!    * 'The rank of any extended integer type relative to another extended
       integer type with the same precision (C99 and C11 6.3.1.1).'
  
       GCC does not support any extended integer types.
  
!    * 'The result of, or the signal raised by, converting an integer to a
       signed integer type when the value cannot be represented in an
       object of that type (C90 6.2.1.2, C99 and C11 6.3.1.3).'
  
       For conversion to a type of width N, the value is reduced modulo
       2^N to be within range of the type; no signal is raised.
  
!    * 'The results of some bitwise operations on signed integers (C90
       6.3, C99 and C11 6.5).'
  
       Bitwise operators act on the representation of the value including
       both the sign and value bits, where the sign bit is considered
!      immediately above the highest-value value bit.  Signed '>>' acts on
!      negative numbers by sign extension.
  
       GCC does not use the latitude given in C99 and C11 only to treat
!      certain aspects of signed '<<' as undefined, but this is subject to
       change.
  
!    * 'The sign of the remainder on integer division (C90 6.3.5).'
  
       GCC always follows the C99 and C11 requirement that the result of
       division is truncated towards zero.
  
  
  File: gcc.info,  Node: Floating point implementation,  Next: Arrays and pointers implementation,  Prev: Integers implementation,  Up: C Implementation
  
  4.6 Floating Point
  ==================
  
!    * 'The accuracy of the floating-point operations and of the library
!      functions in '<math.h>' and '<complex.h>' that return
       floating-point results (C90, C99 and C11 5.2.4.2.2).'
  
       The accuracy is unknown.
  
!    * 'The rounding behaviors characterized by non-standard values of
!      'FLT_ROUNDS' (C90, C99 and C11 5.2.4.2.2).'
  
       GCC does not use such values.
  
!    * 'The evaluation methods characterized by non-standard negative
!      values of 'FLT_EVAL_METHOD' (C99 and C11 5.2.4.2.2).'
  
       GCC does not use such values.
  
!    * 'The direction of rounding when an integer is converted to a
       floating-point number that cannot exactly represent the original
       value (C90 6.2.1.3, C99 and C11 6.3.1.4).'
  
       C99 Annex F is followed.
  
!    * 'The direction of rounding when a floating-point number is
!      converted to a narrower floating-point number (C90 6.2.1.4, C99 and
!      C11 6.3.1.5).'
  
       C99 Annex F is followed.
  
!    * 'How the nearest representable value or the larger or smaller
       representable value immediately adjacent to the nearest
       representable value is chosen for certain floating constants (C90
       6.1.3.1, C99 and C11 6.4.4.2).'
  
       C99 Annex F is followed.
  
!    * 'Whether and how floating expressions are contracted when not
!      disallowed by the 'FP_CONTRACT' pragma (C99 and C11 6.5).'
  
!      Expressions are currently only contracted if '-ffp-contract=fast',
!      '-funsafe-math-optimizations' or '-ffast-math' are used.  This is
       subject to change.
  
!    * 'The default state for the 'FENV_ACCESS' pragma (C99 and C11
       7.6.1).'
  
       This pragma is not implemented, but the default is to "off" unless
!      '-frounding-math' is used in which case it is "on".
  
!    * 'Additional floating-point exceptions, rounding modes,
       environments, and classifications, and their macro names (C99 and
       C11 7.6, C99 and C11 7.12).'
  
       This is dependent on the implementation of the C library, and is
       not defined by GCC itself.
  
!    * 'The default state for the 'FP_CONTRACT' pragma (C99 and C11
       7.12.2).'
  
       This pragma is not implemented.  Expressions are currently only
!      contracted if '-ffp-contract=fast', '-funsafe-math-optimizations'
!      or '-ffast-math' are used.  This is subject to change.
  
!    * 'Whether the "inexact" floating-point exception can be raised when
       the rounded result actually does equal the mathematical result in
       an IEC 60559 conformant implementation (C99 F.9).'
  
       This is dependent on the implementation of the C library, and is
       not defined by GCC itself.
  
!    * 'Whether the "underflow" (and "inexact") floating-point exception
!      can be raised when a result is tiny but not inexact in an IEC 60559
!      conformant implementation (C99 F.9).'
  
       This is dependent on the implementation of the C library, and is
       not defined by GCC itself.
  
  
  File: gcc.info,  Node: Arrays and pointers implementation,  Next: Hints implementation,  Prev: Floating point implementation,  Up: C Implementation
  
  4.7 Arrays and Pointers
  =======================
  
!    * 'The result of converting a pointer to an integer or vice versa
       (C90 6.3.4, C99 and C11 6.3.2.3).'
  
       A cast from pointer to integer discards most-significant bits if
*************** File: gcc.info,  Node: Arrays and pointe
*** 22762,22778 ****
       integer arithmetic to avoid the undefined behavior of pointer
       arithmetic as proscribed in C99 and C11 6.5.6/8.
  
!    * `The size of the result of subtracting two pointers to elements of
       the same array (C90 6.3.6, C99 and C11 6.5.6).'
  
       The value is as specified in the standard and the type is
       determined by the ABI.
  
  
!  ---------- Footnotes ----------
! 
!  (1) Future versions of GCC may zero-extend, or use a target-defined
! `ptr_extend' pattern.  Do not rely on sign extension.
  
  
  File: gcc.info,  Node: Hints implementation,  Next: Structures unions enumerations and bit-fields implementation,  Prev: Arrays and pointers implementation,  Up: C Implementation
--- 22631,22646 ----
       integer arithmetic to avoid the undefined behavior of pointer
       arithmetic as proscribed in C99 and C11 6.5.6/8.
  
!    * 'The size of the result of subtracting two pointers to elements of
       the same array (C90 6.3.6, C99 and C11 6.5.6).'
  
       The value is as specified in the standard and the type is
       determined by the ABI.
  
+    ---------- Footnotes ----------
  
!    (1) Future versions of GCC may zero-extend, or use a target-defined
! 'ptr_extend' pattern.  Do not rely on sign extension.
  
  
  File: gcc.info,  Node: Hints implementation,  Next: Structures unions enumerations and bit-fields implementation,  Prev: Arrays and pointers implementation,  Up: C Implementation
*************** File: gcc.info,  Node: Hints implementat
*** 22780,22873 ****
  4.8 Hints
  =========
  
!    * `The extent to which suggestions made by using the `register'
       storage-class specifier are effective (C90 6.5.1, C99 and C11
       6.7.1).'
  
!      The `register' specifier affects code generation only in these
       ways:
  
          * When used as part of the register variable extension, see
            *note Explicit Reg Vars::.
  
!         * When `-O0' is in use, the compiler allocates distinct stack
!           memory for all variables that do not have the `register'
!           storage-class specifier; if `register' is specified, the
            variable may have a shorter lifespan than the code would
            indicate and may never be placed in memory.
  
!         * On some rare x86 targets, `setjmp' doesn't save the registers
            in all circumstances.  In those cases, GCC doesn't allocate
!           any variables in registers unless they are marked `register'.
! 
  
!    * `The extent to which suggestions made by using the inline function
       specifier are effective (C99 and C11 6.7.4).'
  
!      GCC will not inline any functions if the `-fno-inline' option is
!      used or if `-O0' is used.  Otherwise, GCC may still be unable to
!      inline a function for many reasons; the `-Winline' option may be
       used to determine if a function has not been inlined and why not.
  
- 
  
  File: gcc.info,  Node: Structures unions enumerations and bit-fields implementation,  Next: Qualifiers implementation,  Prev: Hints implementation,  Up: C Implementation
  
  4.9 Structures, Unions, Enumerations, and Bit-Fields
  ====================================================
  
!    * `A member of a union object is accessed using a member of a
       different type (C90 6.3.2.3).'
  
       The relevant bytes of the representation of the object are treated
       as an object of the type used for the access.  *Note
       Type-punning::.  This may be a trap representation.
  
!    * `Whether a "plain" `int' bit-field is treated as a `signed int'
!      bit-field or as an `unsigned int' bit-field (C90 6.5.2, C90
       6.5.2.1, C99 and C11 6.7.2, C99 and C11 6.7.2.1).'
  
!      By default it is treated as `signed int' but this may be changed
!      by the `-funsigned-bitfields' option.
  
!    * `Allowable bit-field types other than `_Bool', `signed int', and
!      `unsigned int' (C99 and C11 6.7.2.1).'
  
!      Other integer types, such as `long int', and enumerated types are
       permitted even in strictly conforming mode.
  
!    * `Whether atomic types are permitted for bit-fields (C11 6.7.2.1).'
  
       Atomic types are not permitted for bit-fields.
  
!    * `Whether a bit-field can straddle a storage-unit boundary (C90
       6.5.2.1, C99 and C11 6.7.2.1).'
  
       Determined by ABI.
  
!    * `The order of allocation of bit-fields within a unit (C90 6.5.2.1,
       C99 and C11 6.7.2.1).'
  
       Determined by ABI.
  
!    * `The alignment of non-bit-field members of structures (C90
!      6.5.2.1, C99 and C11 6.7.2.1).'
  
       Determined by ABI.
  
!    * `The integer type compatible with each enumerated type (C90
       6.5.2.2, C99 and C11 6.7.2.2).'
  
!      Normally, the type is `unsigned int' if there are no negative
!      values in the enumeration, otherwise `int'.  If `-fshort-enums' is
       specified, then if there are negative values it is the first of
!      `signed char', `short' and `int' that can represent all the
!      values, otherwise it is the first of `unsigned char', `unsigned
!      short' and `unsigned int' that can represent all the values.
! 
!      On some targets, `-fshort-enums' is the default; this is
!      determined by the ABI.
  
  
  
  File: gcc.info,  Node: Qualifiers implementation,  Next: Declarators implementation,  Prev: Structures unions enumerations and bit-fields implementation,  Up: C Implementation
--- 22648,22738 ----
  4.8 Hints
  =========
  
!    * 'The extent to which suggestions made by using the 'register'
       storage-class specifier are effective (C90 6.5.1, C99 and C11
       6.7.1).'
  
!      The 'register' specifier affects code generation only in these
       ways:
  
          * When used as part of the register variable extension, see
            *note Explicit Reg Vars::.
  
!         * When '-O0' is in use, the compiler allocates distinct stack
!           memory for all variables that do not have the 'register'
!           storage-class specifier; if 'register' is specified, the
            variable may have a shorter lifespan than the code would
            indicate and may never be placed in memory.
  
!         * On some rare x86 targets, 'setjmp' doesn't save the registers
            in all circumstances.  In those cases, GCC doesn't allocate
!           any variables in registers unless they are marked 'register'.
  
!    * 'The extent to which suggestions made by using the inline function
       specifier are effective (C99 and C11 6.7.4).'
  
!      GCC will not inline any functions if the '-fno-inline' option is
!      used or if '-O0' is used.  Otherwise, GCC may still be unable to
!      inline a function for many reasons; the '-Winline' option may be
       used to determine if a function has not been inlined and why not.
  
  
  File: gcc.info,  Node: Structures unions enumerations and bit-fields implementation,  Next: Qualifiers implementation,  Prev: Hints implementation,  Up: C Implementation
  
  4.9 Structures, Unions, Enumerations, and Bit-Fields
  ====================================================
  
!    * 'A member of a union object is accessed using a member of a
       different type (C90 6.3.2.3).'
  
       The relevant bytes of the representation of the object are treated
       as an object of the type used for the access.  *Note
       Type-punning::.  This may be a trap representation.
  
!    * 'Whether a "plain" 'int' bit-field is treated as a 'signed int'
!      bit-field or as an 'unsigned int' bit-field (C90 6.5.2, C90
       6.5.2.1, C99 and C11 6.7.2, C99 and C11 6.7.2.1).'
  
!      By default it is treated as 'signed int' but this may be changed by
!      the '-funsigned-bitfields' option.
  
!    * 'Allowable bit-field types other than '_Bool', 'signed int', and
!      'unsigned int' (C99 and C11 6.7.2.1).'
  
!      Other integer types, such as 'long int', and enumerated types are
       permitted even in strictly conforming mode.
  
!    * 'Whether atomic types are permitted for bit-fields (C11 6.7.2.1).'
  
       Atomic types are not permitted for bit-fields.
  
!    * 'Whether a bit-field can straddle a storage-unit boundary (C90
       6.5.2.1, C99 and C11 6.7.2.1).'
  
       Determined by ABI.
  
!    * 'The order of allocation of bit-fields within a unit (C90 6.5.2.1,
       C99 and C11 6.7.2.1).'
  
       Determined by ABI.
  
!    * 'The alignment of non-bit-field members of structures (C90 6.5.2.1,
!      C99 and C11 6.7.2.1).'
  
       Determined by ABI.
  
!    * 'The integer type compatible with each enumerated type (C90
       6.5.2.2, C99 and C11 6.7.2.2).'
  
!      Normally, the type is 'unsigned int' if there are no negative
!      values in the enumeration, otherwise 'int'.  If '-fshort-enums' is
       specified, then if there are negative values it is the first of
!      'signed char', 'short' and 'int' that can represent all the values,
!      otherwise it is the first of 'unsigned char', 'unsigned short' and
!      'unsigned int' that can represent all the values.
  
+      On some targets, '-fshort-enums' is the default; this is determined
+      by the ABI.
  
  
  File: gcc.info,  Node: Qualifiers implementation,  Next: Declarators implementation,  Prev: Structures unions enumerations and bit-fields implementation,  Up: C Implementation
*************** File: gcc.info,  Node: Qualifiers implem
*** 22875,22886 ****
  4.10 Qualifiers
  ===============
  
!    * `What constitutes an access to an object that has
       volatile-qualified type (C90 6.5.3, C99 and C11 6.7.3).'
  
       Such an object is normally accessed by pointers and used for
!      accessing hardware.  In most expressions, it is intuitively
!      obvious what is a read and what is a write.  For example
  
            volatile int *dst = SOMEVALUE;
            volatile int *src = SOMEOTHERVALUE;
--- 22740,22751 ----
  4.10 Qualifiers
  ===============
  
!    * 'What constitutes an access to an object that has
       volatile-qualified type (C90 6.5.3, C99 and C11 6.7.3).'
  
       Such an object is normally accessed by pointers and used for
!      accessing hardware.  In most expressions, it is intuitively obvious
!      what is a read and what is a write.  For example
  
            volatile int *dst = SOMEVALUE;
            volatile int *src = SOMEOTHERVALUE;
*************** File: gcc.info,  Node: Qualifiers implem
*** 22889,22895 ****
       will cause a read of the volatile object pointed to by SRC and
       store the value into the volatile object pointed to by DST.  There
       is no guarantee that these reads and writes are atomic, especially
!      for objects larger than `int'.
  
       However, if the volatile storage is not being modified, and the
       value of the volatile storage is not used, then the situation is
--- 22754,22760 ----
       will cause a read of the volatile object pointed to by SRC and
       store the value into the volatile object pointed to by DST.  There
       is no guarantee that these reads and writes are atomic, especially
!      for objects larger than 'int'.
  
       However, if the volatile storage is not being modified, and the
       value of the volatile storage is not used, then the situation is
*************** File: gcc.info,  Node: Qualifiers implem
*** 22899,22905 ****
            *src;
  
       According to the C standard, such an expression is an rvalue whose
!      type is the unqualified version of its original type, i.e. `int'.
       Whether GCC interprets this as a read of the volatile object being
       pointed to or only as a request to evaluate the expression for its
       side-effects depends on this type.
--- 22764,22770 ----
            *src;
  
       According to the C standard, such an expression is an rvalue whose
!      type is the unqualified version of its original type, i.e.  'int'.
       Whether GCC interprets this as a read of the volatile object being
       pointed to or only as a request to evaluate the expression for its
       side-effects depends on this type.
*************** File: gcc.info,  Node: Qualifiers implem
*** 22910,22940 ****
       by GCC as a read of the volatile object; in the other cases, the
       expression is only evaluated for its side-effects.
  
- 
  
  File: gcc.info,  Node: Declarators implementation,  Next: Statements implementation,  Prev: Qualifiers implementation,  Up: C Implementation
  
  4.11 Declarators
  ================
  
!    * `The maximum number of declarators that may modify an arithmetic,
       structure or union type (C90 6.5.4).'
  
       GCC is only limited by available memory.
  
- 
  
  File: gcc.info,  Node: Statements implementation,  Next: Preprocessing directives implementation,  Prev: Declarators implementation,  Up: C Implementation
  
  4.12 Statements
  ===============
  
!    * `The maximum number of `case' values in a `switch' statement (C90
       6.6.4.2).'
  
       GCC is only limited by available memory.
  
- 
  
  File: gcc.info,  Node: Preprocessing directives implementation,  Next: Library functions implementation,  Prev: Statements implementation,  Up: C Implementation
  
--- 22775,22802 ----
       by GCC as a read of the volatile object; in the other cases, the
       expression is only evaluated for its side-effects.
  
  
  File: gcc.info,  Node: Declarators implementation,  Next: Statements implementation,  Prev: Qualifiers implementation,  Up: C Implementation
  
  4.11 Declarators
  ================
  
!    * 'The maximum number of declarators that may modify an arithmetic,
       structure or union type (C90 6.5.4).'
  
       GCC is only limited by available memory.
  
  
  File: gcc.info,  Node: Statements implementation,  Next: Preprocessing directives implementation,  Prev: Declarators implementation,  Up: C Implementation
  
  4.12 Statements
  ===============
  
!    * 'The maximum number of 'case' values in a 'switch' statement (C90
       6.6.4.2).'
  
       GCC is only limited by available memory.
  
  
  File: gcc.info,  Node: Preprocessing directives implementation,  Next: Library functions implementation,  Prev: Statements implementation,  Up: C Implementation
  
*************** File: gcc.info,  Node: Preprocessing dir
*** 22945,22995 ****
  behavior, for details of these aspects of implementation-defined
  behavior.
  
!    * `The locations within `#pragma' directives where header name
       preprocessing tokens are recognized (C11 6.4, C11 6.4.7).'
  
!    * `How sequences in both forms of header names are mapped to headers
       or external source file names (C90 6.1.7, C99 and C11 6.4.7).'
  
!    * `Whether the value of a character constant in a constant expression
       that controls conditional inclusion matches the value of the same
       character constant in the execution character set (C90 6.8.1, C99
       and C11 6.10.1).'
  
!    * `Whether the value of a single-character character constant in a
       constant expression that controls conditional inclusion may have a
       negative value (C90 6.8.1, C99 and C11 6.10.1).'
  
!    * `The places that are searched for an included `<>' delimited
       header, and how the places are specified or the header is
       identified (C90 6.8.2, C99 and C11 6.10.2).'
  
!    * `How the named source file is searched for in an included `""'
       delimited header (C90 6.8.2, C99 and C11 6.10.2).'
  
!    * `The method by which preprocessing tokens (possibly resulting from
!      macro expansion) in a `#include' directive are combined into a
       header name (C90 6.8.2, C99 and C11 6.10.2).'
  
!    * `The nesting limit for `#include' processing (C90 6.8.2, C99 and
       C11 6.10.2).'
  
!    * `Whether the `#' operator inserts a `\' character before the `\'
       character that begins a universal character name in a character
       constant or string literal (C99 and C11 6.10.3.2).'
  
!    * `The behavior on each recognized non-`STDC #pragma' directive (C90
       6.8.6, C99 and C11 6.10.6).'
  
!      *Note Pragmas: (cpp)Pragmas, for details of pragmas accepted by
!      GCC on all targets.  *Note Pragmas Accepted by GCC: Pragmas, for
       details of target-specific pragmas.
  
!    * `The definitions for `__DATE__' and `__TIME__' when respectively,
       the date and time of translation are not available (C90 6.8.8, C99
       6.10.8, C11 6.10.8.1).'
  
- 
  
  File: gcc.info,  Node: Library functions implementation,  Next: Architecture implementation,  Prev: Preprocessing directives implementation,  Up: C Implementation
  
--- 22807,22856 ----
  behavior, for details of these aspects of implementation-defined
  behavior.
  
!    * 'The locations within '#pragma' directives where header name
       preprocessing tokens are recognized (C11 6.4, C11 6.4.7).'
  
!    * 'How sequences in both forms of header names are mapped to headers
       or external source file names (C90 6.1.7, C99 and C11 6.4.7).'
  
!    * 'Whether the value of a character constant in a constant expression
       that controls conditional inclusion matches the value of the same
       character constant in the execution character set (C90 6.8.1, C99
       and C11 6.10.1).'
  
!    * 'Whether the value of a single-character character constant in a
       constant expression that controls conditional inclusion may have a
       negative value (C90 6.8.1, C99 and C11 6.10.1).'
  
!    * 'The places that are searched for an included '<>' delimited
       header, and how the places are specified or the header is
       identified (C90 6.8.2, C99 and C11 6.10.2).'
  
!    * 'How the named source file is searched for in an included '""'
       delimited header (C90 6.8.2, C99 and C11 6.10.2).'
  
!    * 'The method by which preprocessing tokens (possibly resulting from
!      macro expansion) in a '#include' directive are combined into a
       header name (C90 6.8.2, C99 and C11 6.10.2).'
  
!    * 'The nesting limit for '#include' processing (C90 6.8.2, C99 and
       C11 6.10.2).'
  
!    * 'Whether the '#' operator inserts a '\' character before the '\'
       character that begins a universal character name in a character
       constant or string literal (C99 and C11 6.10.3.2).'
  
!    * 'The behavior on each recognized non-'STDC #pragma' directive (C90
       6.8.6, C99 and C11 6.10.6).'
  
!      *Note Pragmas: (cpp)Pragmas, for details of pragmas accepted by GCC
!      on all targets.  *Note Pragmas Accepted by GCC: Pragmas, for
       details of target-specific pragmas.
  
!    * 'The definitions for '__DATE__' and '__TIME__' when respectively,
       the date and time of translation are not available (C90 6.8.8, C99
       6.10.8, C11 6.10.8.1).'
  
  
  File: gcc.info,  Node: Library functions implementation,  Next: Architecture implementation,  Prev: Preprocessing directives implementation,  Up: C Implementation
  
*************** File: gcc.info,  Node: Library functions
*** 22999,23025 ****
  The behavior of most of these points are dependent on the implementation
  of the C library, and are not defined by GCC itself.
  
!    * `The null pointer constant to which the macro `NULL' expands (C90
       7.1.6, C99 7.17, C11 7.19).'
  
!      In `<stddef.h>', `NULL' expands to `((void *)0)'.  GCC does not
!      provide the other headers which define `NULL' and some library
       implementations may use other definitions in those headers.
  
- 
  
  File: gcc.info,  Node: Architecture implementation,  Next: Locale-specific behavior implementation,  Prev: Library functions implementation,  Up: C Implementation
  
  4.15 Architecture
  =================
  
!    * `The values or expressions assigned to the macros specified in the
!      headers `<float.h>', `<limits.h>', and `<stdint.h>' (C90, C99 and
       C11 5.2.4.2, C99 7.18.2, C99 7.18.3, C11 7.20.2, C11 7.20.3).'
  
       Determined by ABI.
  
!    * `The result of attempting to indirectly access an object with
       automatic or thread storage duration from a thread other than the
       one with which it is associated (C11 6.2.4).'
  
--- 22860,22885 ----
  The behavior of most of these points are dependent on the implementation
  of the C library, and are not defined by GCC itself.
  
!    * 'The null pointer constant to which the macro 'NULL' expands (C90
       7.1.6, C99 7.17, C11 7.19).'
  
!      In '<stddef.h>', 'NULL' expands to '((void *)0)'.  GCC does not
!      provide the other headers which define 'NULL' and some library
       implementations may use other definitions in those headers.
  
  
  File: gcc.info,  Node: Architecture implementation,  Next: Locale-specific behavior implementation,  Prev: Library functions implementation,  Up: C Implementation
  
  4.15 Architecture
  =================
  
!    * 'The values or expressions assigned to the macros specified in the
!      headers '<float.h>', '<limits.h>', and '<stdint.h>' (C90, C99 and
       C11 5.2.4.2, C99 7.18.2, C99 7.18.3, C11 7.20.2, C11 7.20.3).'
  
       Determined by ABI.
  
!    * 'The result of attempting to indirectly access an object with
       automatic or thread storage duration from a thread other than the
       one with which it is associated (C11 6.2.4).'
  
*************** File: gcc.info,  Node: Architecture impl
*** 23027,23056 ****
       synchronization for concurrent accesses as for concurrent accesses
       to any object.
  
!    * `The number, order, and encoding of bytes in any object (when not
       explicitly specified in this International Standard) (C99 and C11
       6.2.6.1).'
  
       Determined by ABI.
  
!    * `Whether any extended alignments are supported and the contexts in
       which they are supported (C11 6.2.8).'
  
!      Extended alignments up to 2^28 (bytes) are supported for objects
!      of automatic storage duration.  Alignments supported for objects
!      of static and thread storage duration are determined by the ABI.
  
!    * `Valid alignment values other than those returned by an _Alignof
       expression for fundamental types, if any (C11 6.2.8).'
  
!      Valid alignments are powers of 2 up to and including 2^28.
  
!    * `The value of the result of the `sizeof' and `_Alignof' operators
       (C90 6.3.3.4, C99 and C11 6.5.3.4).'
  
       Determined by ABI.
  
- 
  
  File: gcc.info,  Node: Locale-specific behavior implementation,  Prev: Architecture implementation,  Up: C Implementation
  
--- 22887,22915 ----
       synchronization for concurrent accesses as for concurrent accesses
       to any object.
  
!    * 'The number, order, and encoding of bytes in any object (when not
       explicitly specified in this International Standard) (C99 and C11
       6.2.6.1).'
  
       Determined by ABI.
  
!    * 'Whether any extended alignments are supported and the contexts in
       which they are supported (C11 6.2.8).'
  
!      Extended alignments up to 2^{28} (bytes) are supported for objects
!      of automatic storage duration.  Alignments supported for objects of
!      static and thread storage duration are determined by the ABI.
  
!    * 'Valid alignment values other than those returned by an _Alignof
       expression for fundamental types, if any (C11 6.2.8).'
  
!      Valid alignments are powers of 2 up to and including 2^{28}.
  
!    * 'The value of the result of the 'sizeof' and '_Alignof' operators
       (C90 6.3.3.4, C99 and C11 6.5.3.4).'
  
       Determined by ABI.
  
  
  File: gcc.info,  Node: Locale-specific behavior implementation,  Prev: Architecture implementation,  Up: C Implementation
  
*************** A conforming implementation of ISO C++ i
*** 23070,23088 ****
  choice of behavior in each of the areas that are designated
  "implementation defined".  The following lists all such areas, along
  with the section numbers from the ISO/IEC 14882:1998 and ISO/IEC
! 14882:2003 standards.  Some areas are only implementation-defined in
! one version of the standard.
  
   Some choices depend on the externally determined ABI for the platform
  (including standard character encodings) which GCC follows; these are
  listed as "determined by ABI" below.  *Note Binary Compatibility:
! Compatibility, and `http://gcc.gnu.org/readings.html'.  Some choices
! are documented in the preprocessor manual.  *Note
! Implementation-defined behavior: (cpp)Implementation-defined behavior.
! Some choices are documented in the corresponding document for the C
! language.  *Note C Implementation::.  Some choices are made by the
! library and operating system (or other environment when compiling for a
! freestanding environment); refer to their documentation for details.
  
  * Menu:
  
--- 22929,22947 ----
  choice of behavior in each of the areas that are designated
  "implementation defined".  The following lists all such areas, along
  with the section numbers from the ISO/IEC 14882:1998 and ISO/IEC
! 14882:2003 standards.  Some areas are only implementation-defined in one
! version of the standard.
  
   Some choices depend on the externally determined ABI for the platform
  (including standard character encodings) which GCC follows; these are
  listed as "determined by ABI" below.  *Note Binary Compatibility:
! Compatibility, and <http://gcc.gnu.org/readings.html>.  Some choices are
! documented in the preprocessor manual.  *Note Implementation-defined
! behavior: (cpp)Implementation-defined behavior.  Some choices are
! documented in the corresponding document for the C language.  *Note C
! Implementation::.  Some choices are made by the library and operating
! system (or other environment when compiling for a freestanding
! environment); refer to their documentation for details.
  
  * Menu:
  
*************** File: gcc.info,  Node: Conditionally-sup
*** 23095,23125 ****
  5.1 Conditionally-Supported Behavior
  ====================================
  
! `Each implementation shall include documentation that identifies all
  conditionally-supported constructs that it does not support (C++0x
  1.4).'
  
!    * `Whether an argument of class type with a non-trivial copy
       constructor or destructor can be passed to ... (C++0x 5.2.2).'
  
       Such argument passing is supported, using the same
       pass-by-invisible-reference approach used for normal function
       arguments of such types.
  
- 
  
  File: gcc.info,  Node: Exception handling,  Prev: Conditionally-supported behavior,  Up: C++ Implementation
  
  5.2 Exception Handling
  ======================
  
!    * `In the situation where no matching handler is found, it is
       implementation-defined whether or not the stack is unwound before
       std::terminate() is called (C++98 15.5.1).'
  
       The stack is not unwound before std::terminate is called.
  
- 
  
  File: gcc.info,  Node: C Extensions,  Next: C++ Extensions,  Prev: C++ Implementation,  Up: Top
  
--- 22954,22982 ----
  5.1 Conditionally-Supported Behavior
  ====================================
  
! 'Each implementation shall include documentation that identifies all
  conditionally-supported constructs that it does not support (C++0x
  1.4).'
  
!    * 'Whether an argument of class type with a non-trivial copy
       constructor or destructor can be passed to ... (C++0x 5.2.2).'
  
       Such argument passing is supported, using the same
       pass-by-invisible-reference approach used for normal function
       arguments of such types.
  
  
  File: gcc.info,  Node: Exception handling,  Prev: Conditionally-supported behavior,  Up: C++ Implementation
  
  5.2 Exception Handling
  ======================
  
!    * 'In the situation where no matching handler is found, it is
       implementation-defined whether or not the stack is unwound before
       std::terminate() is called (C++98 15.5.1).'
  
       The stack is not unwound before std::terminate is called.
  
  
  File: gcc.info,  Node: C Extensions,  Next: C++ Extensions,  Prev: C++ Implementation,  Up: Top
  
*************** File: gcc.info,  Node: C Extensions,  Ne
*** 23127,23136 ****
  *************************************
  
  GNU C provides several language features not found in ISO standard C.
! (The `-pedantic' option directs GCC to print a warning message if any
! of these features is used.)  To test for the availability of these
! features in conditional compilation, check for a predefined macro
! `__GNUC__', which is always defined under GCC.
  
   These extensions are available in C and Objective-C.  Most of them are
  also available in C++.  *Note Extensions to the C++ Language: C++
--- 22984,22993 ----
  *************************************
  
  GNU C provides several language features not found in ISO standard C.
! (The '-pedantic' option directs GCC to print a warning message if any of
! these features is used.)  To test for the availability of these features
! in conditional compilation, check for a predefined macro '__GNUC__',
! which is always defined under GCC.
  
   These extensions are available in C and Objective-C.  Most of them are
  also available in C++.  *Note Extensions to the C++ Language: C++
*************** extensions, accepted by GCC in C90 mode
*** 23146,23155 ****
  * Labels as Values::    Getting pointers to labels, and computed gotos.
  * Nested Functions::    As in Algol and Pascal, lexical scoping of functions.
  * Constructing Calls::  Dispatching a call to another function.
! * Typeof::              `typeof': referring to the type of an expression.
! * Conditionals::        Omitting the middle operand of a `?:' expression.
! * __int128::		128-bit integers---`__int128'.
! * Long Long::           Double-word integers---`long long int'.
  * Complex::             Data types for complex numbers.
  * Floating Types::      Additional Floating Types.
  * Half-Precision::      Half-Precision Floating Point.
--- 23003,23012 ----
  * Labels as Values::    Getting pointers to labels, and computed gotos.
  * Nested Functions::    As in Algol and Pascal, lexical scoping of functions.
  * Constructing Calls::  Dispatching a call to another function.
! * Typeof::              'typeof': referring to the type of an expression.
! * Conditionals::        Omitting the middle operand of a '?:' expression.
! * __int128::		128-bit integers--'__int128'.
! * Long Long::           Double-word integers--'long long int'.
  * Complex::             Data types for complex numbers.
  * Floating Types::      Additional Floating Types.
  * Half-Precision::      Half-Precision Floating Point.
*************** extensions, accepted by GCC in C90 mode
*** 23163,23175 ****
  * Variadic Macros::     Macros with a variable number of arguments.
  * Escaped Newlines::    Slightly looser rules for escaped newlines.
  * Subscripting::        Any array can be subscripted, even if not an lvalue.
! * Pointer Arith::       Arithmetic on `void'-pointers and function pointers.
  * Pointers to Arrays::  Pointers to arrays with qualifiers work as expected.
  * Initializers::        Non-constant initializers.
  * Compound Literals::   Compound literals give structures, unions
                          or arrays as values.
  * Designated Inits::    Labeling elements of initializers.
! * Case Ranges::         `case 1 ... 9' and such.
  * Cast to Union::       Casting to union type from any member of the union.
  * Mixed Declarations::  Mixing declarations and code.
  * Function Attributes:: Declaring that functions have no side effects,
--- 23020,23032 ----
  * Variadic Macros::     Macros with a variable number of arguments.
  * Escaped Newlines::    Slightly looser rules for escaped newlines.
  * Subscripting::        Any array can be subscripted, even if not an lvalue.
! * Pointer Arith::       Arithmetic on 'void'-pointers and function pointers.
  * Pointers to Arrays::  Pointers to arrays with qualifiers work as expected.
  * Initializers::        Non-constant initializers.
  * Compound Literals::   Compound literals give structures, unions
                          or arrays as values.
  * Designated Inits::    Labeling elements of initializers.
! * Case Ranges::         'case 1 ... 9' and such.
  * Cast to Union::       Casting to union type from any member of the union.
  * Mixed Declarations::  Mixing declarations and code.
  * Function Attributes:: Declaring that functions have no side effects,
*************** extensions, accepted by GCC in C90 mode
*** 23179,23198 ****
  * Function Prototypes:: Prototype declarations and old-style definitions.
  * C++ Comments::        C++ comments are recognized.
  * Dollar Signs::        Dollar sign is allowed in identifiers.
! * Character Escapes::   `\e' stands for the character <ESC>.
  * Variable Attributes:: Specifying attributes of variables.
  * Type Attributes::     Specifying attributes of types.
  * Alignment::           Inquiring about the alignment of a type or variable.
  * Inline::              Defining inline functions (as fast as macros).
  * Volatiles::           What constitutes an access to a volatile object.
  * Using Assembly Language with C:: Instructions and extensions for interfacing C with assembler.
! * Alternate Keywords::  `__const__', `__asm__', etc., for header files.
! * Incomplete Enums::    `enum foo;', with details to follow.
  * Function Names::      Printable strings which are the name of the current
                          function.
  * Return Address::      Getting the return or frame address of a function.
  * Vector Extensions::   Using vector instructions through built-in functions.
! * Offsetof::            Special syntax for implementing `offsetof'.
  * __sync Builtins::     Legacy built-in functions for atomic memory access.
  * __atomic Builtins::   Atomic built-in functions with memory model.
  * Integer Overflow Builtins:: Built-in functions to perform arithmetics and
--- 23036,23055 ----
  * Function Prototypes:: Prototype declarations and old-style definitions.
  * C++ Comments::        C++ comments are recognized.
  * Dollar Signs::        Dollar sign is allowed in identifiers.
! * Character Escapes::   '\e' stands for the character <ESC>.
  * Variable Attributes:: Specifying attributes of variables.
  * Type Attributes::     Specifying attributes of types.
  * Alignment::           Inquiring about the alignment of a type or variable.
  * Inline::              Defining inline functions (as fast as macros).
  * Volatiles::           What constitutes an access to a volatile object.
  * Using Assembly Language with C:: Instructions and extensions for interfacing C with assembler.
! * Alternate Keywords::  '__const__', '__asm__', etc., for header files.
! * Incomplete Enums::    'enum foo;', with details to follow.
  * Function Names::      Printable strings which are the name of the current
                          function.
  * Return Address::      Getting the return or frame address of a function.
  * Vector Extensions::   Using vector instructions through built-in functions.
! * Offsetof::            Special syntax for implementing 'offsetof'.
  * __sync Builtins::     Legacy built-in functions for atomic memory access.
  * __atomic Builtins::   Atomic built-in functions with memory model.
  * Integer Overflow Builtins:: Built-in functions to perform arithmetics and
*************** extensions, accepted by GCC in C90 mode
*** 23208,23214 ****
  * Pragmas::             Pragmas accepted by GCC.
  * Unnamed Fields::      Unnamed struct/union fields within structs/unions.
  * Thread-Local::        Per-thread variables.
! * Binary constants::    Binary constants using the `0b' prefix.
  
  
  File: gcc.info,  Node: Statement Exprs,  Next: Local Labels,  Up: C Extensions
--- 23065,23071 ----
  * Pragmas::             Pragmas accepted by GCC.
  * Unnamed Fields::      Unnamed struct/union fields within structs/unions.
  * Thread-Local::        Per-thread variables.
! * Binary constants::    Binary constants using the '0b' prefix.
  
  
  File: gcc.info,  Node: Statement Exprs,  Next: Local Labels,  Up: C Extensions
*************** example:
*** 23230,23241 ****
          z; })
  
  is a valid (though slightly more complex than necessary) expression for
! the absolute value of `foo ()'.
  
   The last thing in the compound statement should be an expression
  followed by a semicolon; the value of this subexpression serves as the
  value of the entire construct.  (If you use some other kind of statement
! last within the braces, the construct has type `void', and thus
  effectively no value.)
  
   This feature is especially useful in making macro definitions "safe"
--- 23087,23098 ----
          z; })
  
  is a valid (though slightly more complex than necessary) expression for
! the absolute value of 'foo ()'.
  
   The last thing in the compound statement should be an expression
  followed by a semicolon; the value of this subexpression serves as the
  value of the entire construct.  (If you use some other kind of statement
! last within the braces, the construct has type 'void', and thus
  effectively no value.)
  
   This feature is especially useful in making macro definitions "safe"
*************** follows:
*** 23247,23253 ****
  
  But this definition computes either A or B twice, with bad results if
  the operand has side effects.  In GNU C, if you know the type of the
! operands (here taken as `int'), you can define the macro safely as
  follows:
  
       #define maxint(a,b) \
--- 23104,23110 ----
  
  But this definition computes either A or B twice, with bad results if
  the operand has side effects.  In GNU C, if you know the type of the
! operands (here taken as 'int'), you can define the macro safely as
  follows:
  
       #define maxint(a,b) \
*************** the value of an enumeration constant, th
*** 23258,23284 ****
  initial value of a static variable.
  
   If you don't know the type of the operand, you can still do this, but
! you must use `typeof' or `__auto_type' (*note Typeof::).
  
   In G++, the result value of a statement expression undergoes array and
  function pointer decay, and is returned by value to the enclosing
! expression.  For instance, if `A' is a class, then
  
               A a;
  
               ({a;}).Foo ()
  
! constructs a temporary `A' object to hold the result of the statement
! expression, and that is used to invoke `Foo'.  Therefore the `this'
! pointer observed by `Foo' is not the address of `a'.
  
   In a statement expression, any temporaries created within a statement
! are destroyed at that statement's end.  This makes statement
! expressions inside macros slightly different from function calls.  In
! the latter case temporaries introduced during argument evaluation are
! destroyed at the end of the statement that includes the function call.
! In the statement expression case they are destroyed during the
! statement expression.  For instance,
  
       #define macro(a)  ({__typeof__(a) b = (a); b + 3; })
       template<typename T> T function(T a) { T b = a; return b + 3; }
--- 23115,23141 ----
  initial value of a static variable.
  
   If you don't know the type of the operand, you can still do this, but
! you must use 'typeof' or '__auto_type' (*note Typeof::).
  
   In G++, the result value of a statement expression undergoes array and
  function pointer decay, and is returned by value to the enclosing
! expression.  For instance, if 'A' is a class, then
  
               A a;
  
               ({a;}).Foo ()
  
! constructs a temporary 'A' object to hold the result of the statement
! expression, and that is used to invoke 'Foo'.  Therefore the 'this'
! pointer observed by 'Foo' is not the address of 'a'.
  
   In a statement expression, any temporaries created within a statement
! are destroyed at that statement's end.  This makes statement expressions
! inside macros slightly different from function calls.  In the latter
! case temporaries introduced during argument evaluation are destroyed at
! the end of the statement that includes the function call.  In the
! statement expression case they are destroyed during the statement
! expression.  For instance,
  
       #define macro(a)  ({__typeof__(a) b = (a); b + 3; })
       template<typename T> T function(T a) { T b = a; return b + 3; }
*************** statement expression.  For instance,
*** 23289,23297 ****
         function (X ());
       }
  
! has different places where temporaries are destroyed.  For the `macro'
! case, the temporary `X' is destroyed just after the initialization of
! `b'.  In the `function' case that temporary is destroyed when the
  function returns.
  
   These considerations mean that it is probably a bad idea to use
--- 23146,23154 ----
         function (X ());
       }
  
! has different places where temporaries are destroyed.  For the 'macro'
! case, the temporary 'X' is destroyed just after the initialization of
! 'b'.  In the 'function' case that temporary is destroyed when the
  function returns.
  
   These considerations mean that it is probably a bad idea to use
*************** work with C++.  (Note that some versions
*** 23300,23309 ****
  header files using statement expressions that lead to precisely this
  bug.)
  
!  Jumping into a statement expression with `goto' or using a `switch'
! statement outside the statement expression with a `case' or `default'
  label inside the statement expression is not permitted.  Jumping into a
! statement expression with a computed `goto' (*note Labels as Values::)
  has undefined behavior.  Jumping out of a statement expression is
  permitted, but if the statement expression is part of a larger
  expression then it is unspecified which other subexpressions of that
--- 23157,23166 ----
  header files using statement expressions that lead to precisely this
  bug.)
  
!  Jumping into a statement expression with 'goto' or using a 'switch'
! statement outside the statement expression with a 'case' or 'default'
  label inside the statement expression is not permitted.  Jumping into a
! statement expression with a computed 'goto' (*note Labels as Values::)
  has undefined behavior.  Jumping out of a statement expression is
  permitted, but if the statement expression is part of a larger
  expression then it is unspecified which other subexpressions of that
*************** evaluation of other parts of the contain
*** 23315,23323 ****
  
         foo (), (({ bar1 (); goto a; 0; }) + bar2 ()), baz();
  
! calls `foo' and `bar1' and does not call `baz' but may or may not call
! `bar2'.  If `bar2' is called, it is called after `foo' and before
! `bar1'.
  
  
  File: gcc.info,  Node: Local Labels,  Next: Labels as Values,  Prev: Statement Exprs,  Up: C Extensions
--- 23172,23180 ----
  
         foo (), (({ bar1 (); goto a; 0; }) + bar2 ()), baz();
  
! calls 'foo' and 'bar1' and does not call 'baz' but may or may not call
! 'bar2'.  If 'bar2' is called, it is called after 'foo' and before
! 'bar1'.
  
  
  File: gcc.info,  Node: Local Labels,  Next: Labels as Values,  Prev: Statement Exprs,  Up: C Extensions
*************** File: gcc.info,  Node: Local Labels,  Ne
*** 23327,23333 ****
  
  GCC allows you to declare "local labels" in any nested block scope.  A
  local label is just like an ordinary label, but you can only reference
! it (with a `goto' statement, or by taking its address) within the block
  in which it is declared.
  
   A local label declaration looks like this:
--- 23184,23190 ----
  
  GCC allows you to declare "local labels" in any nested block scope.  A
  local label is just like an ordinary label, but you can only reference
! it (with a 'goto' statement, or by taking its address) within the block
  in which it is declared.
  
   A local label declaration looks like this:
*************** or
*** 23341,23352 ****
   Local label declarations must come at the beginning of the block,
  before any ordinary declarations or statements.
  
!  The label declaration defines the label _name_, but does not define
! the label itself.  You must do this in the usual way, with `LABEL:',
! within the statements of the statement expression.
  
   The local label feature is useful for complex macros.  If a macro
! contains nested loops, a `goto' can be useful for breaking out of them.
  However, an ordinary label whose scope is the whole function cannot be
  used: if the macro can be expanded several times in one function, the
  label is multiply defined in that function.  A local label avoids this
--- 23198,23209 ----
   Local label declarations must come at the beginning of the block,
  before any ordinary declarations or statements.
  
!  The label declaration defines the label _name_, but does not define the
! label itself.  You must do this in the usual way, with 'LABEL:', within
! the statements of the statement expression.
  
   The local label feature is useful for complex macros.  If a macro
! contains nested loops, a 'goto' can be useful for breaking out of them.
  However, an ordinary label whose scope is the whole function cannot be
  used: if the macro can be expanded several times in one function, the
  label is multiply defined in that function.  A local label avoids this
*************** File: gcc.info,  Node: Labels as Values,
*** 23395,23415 ****
  6.3 Labels as Values
  ====================
  
! You can get the address of a label defined in the current function (or
! a containing function) with the unary operator `&&'.  The value has
! type `void *'.  This value is a constant and can be used wherever a
! constant of that type is valid.  For example:
  
       void *ptr;
       /* ... */
       ptr = &&foo;
  
   To use these values, you need to be able to jump to one.  This is done
! with the computed goto statement(1), `goto *EXP;'.  For example,
  
       goto *ptr;
  
! Any expression of type `void *' is allowed.
  
   One way of using these constants is in initializing a static array that
  serves as a jump table:
--- 23252,23272 ----
  6.3 Labels as Values
  ====================
  
! You can get the address of a label defined in the current function (or a
! containing function) with the unary operator '&&'.  The value has type
! 'void *'.  This value is a constant and can be used wherever a constant
! of that type is valid.  For example:
  
       void *ptr;
       /* ... */
       ptr = &&foo;
  
   To use these values, you need to be able to jump to one.  This is done
! with the computed goto statement(1), 'goto *EXP;'.  For example,
  
       goto *ptr;
  
! Any expression of type 'void *' is allowed.
  
   One way of using these constants is in initializing a static array that
  serves as a jump table:
*************** Note that this does not check whether th
*** 23424,23436 ****
  indexing in C never does that.
  
   Such an array of label values serves a purpose much like that of the
! `switch' statement.  The `switch' statement is cleaner, so use that
! rather than an array unless the problem does not fit a `switch'
  statement very well.
  
   Another use of label values is in an interpreter for threaded code.
! The labels within the interpreter function can be stored in the
! threaded code for super-fast dispatching.
  
   You may not use this mechanism to jump to code in a different function.
  If you do that, totally unpredictable things happen.  The best way to
--- 23281,23293 ----
  indexing in C never does that.
  
   Such an array of label values serves a purpose much like that of the
! 'switch' statement.  The 'switch' statement is cleaner, so use that
! rather than an array unless the problem does not fit a 'switch'
  statement very well.
  
   Another use of label values is in an interpreter for threaded code.
! The labels within the interpreter function can be stored in the threaded
! code for super-fast dispatching.
  
   You may not use this mechanism to jump to code in a different function.
  If you do that, totally unpredictable things happen.  The best way to
*************** allows the data to be read-only.  This a
*** 23449,23464 ****
  differences is not supported for the AVR target, please use the first
  approach for AVR programs.
  
!  The `&&foo' expressions for the same label might have different values
! if the containing function is inlined or cloned.  If a program relies
! on them being always the same,
! `__attribute__((__noinline__,__noclone__))' should be used to prevent
! inlining and cloning.  If `&&foo' is used in a static variable
! initializer, inlining and cloning is forbidden.
  
!  ---------- Footnotes ----------
  
!  (1) The analogous feature in Fortran is called an assigned goto, but
  that name seems inappropriate in C, where one can do more than simply
  store label addresses in label variables.
  
--- 23306,23320 ----
  differences is not supported for the AVR target, please use the first
  approach for AVR programs.
  
!  The '&&foo' expressions for the same label might have different values
! if the containing function is inlined or cloned.  If a program relies on
! them being always the same, '__attribute__((__noinline__,__noclone__))'
! should be used to prevent inlining and cloning.  If '&&foo' is used in a
! static variable initializer, inlining and cloning is forbidden.
  
!    ---------- Footnotes ----------
  
!    (1) The analogous feature in Fortran is called an assigned goto, but
  that name seems inappropriate in C, where one can do more than simply
  store label addresses in label variables.
  
*************** Nested functions are supported as an ext
*** 23473,23479 ****
  supported by GNU C++.
  
   The nested function's name is local to the block where it is defined.
! For example, here we define a nested function named `square', and call
  it twice:
  
       foo (double a, double b)
--- 23329,23335 ----
  supported by GNU C++.
  
   The nested function's name is local to the block where it is defined.
! For example, here we define a nested function named 'square', and call
  it twice:
  
       foo (double a, double b)
*************** it twice:
*** 23486,23492 ****
   The nested function can access all the variables of the containing
  function that are visible at the point of its definition.  This is
  called "lexical scoping".  For example, here we show a nested function
! which uses an inherited variable named `offset':
  
       bar (int *array, int offset, int size)
       {
--- 23342,23348 ----
   The nested function can access all the variables of the containing
  function that are visible at the point of its definition.  This is
  called "lexical scoping".  For example, here we show a nested function
! which uses an inherited variable named 'offset':
  
       bar (int *array, int offset, int size)
       {
*************** function:
*** 23514,23542 ****
         intermediate (store, size);
       }
  
!  Here, the function `intermediate' receives the address of `store' as
! an argument.  If `intermediate' calls `store', the arguments given to
! `store' are used to store into `array'.  But this technique works only
! so long as the containing function (`hack', in this example) does not
  exit.
  
   If you try to call the nested function through its address after the
! containing function exits, all hell breaks loose.  If you try to call
! it after a containing scope level exits, and if it refers to some of
! the variables that are no longer in scope, you may be lucky, but it's
! not wise to take the risk.  If, however, the nested function does not
! refer to anything that has gone out of scope, you should be safe.
  
   GCC implements taking the address of a nested function using a
  technique called "trampolines".  This technique was described in
! `Lexical Closures for C++' (Thomas M. Breuel, USENIX C++ Conference
  Proceedings, October 17-21, 1988).
  
   A nested function can jump to a label inherited from a containing
  function, provided the label is explicitly declared in the containing
  function (*note Local Labels::).  Such a jump returns instantly to the
! containing function, exiting the nested function that did the `goto'
! and any intermediate functions as well.  Here is an example:
  
       bar (int *array, int offset, int size)
       {
--- 23370,23398 ----
         intermediate (store, size);
       }
  
!  Here, the function 'intermediate' receives the address of 'store' as an
! argument.  If 'intermediate' calls 'store', the arguments given to
! 'store' are used to store into 'array'.  But this technique works only
! so long as the containing function ('hack', in this example) does not
  exit.
  
   If you try to call the nested function through its address after the
! containing function exits, all hell breaks loose.  If you try to call it
! after a containing scope level exits, and if it refers to some of the
! variables that are no longer in scope, you may be lucky, but it's not
! wise to take the risk.  If, however, the nested function does not refer
! to anything that has gone out of scope, you should be safe.
  
   GCC implements taking the address of a nested function using a
  technique called "trampolines".  This technique was described in
! 'Lexical Closures for C++' (Thomas M. Breuel, USENIX C++ Conference
  Proceedings, October 17-21, 1988).
  
   A nested function can jump to a label inherited from a containing
  function, provided the label is explicitly declared in the containing
  function (*note Local Labels::).  Such a jump returns instantly to the
! containing function, exiting the nested function that did the 'goto' and
! any intermediate functions as well.  Here is an example:
  
       bar (int *array, int offset, int size)
       {
*************** and any intermediate functions as well.
*** 23554,23568 ****
         /* ... */
         return 0;
  
!       /* Control comes here from `access'
           if it detects an error.  */
        failure:
         return -1;
       }
  
!  A nested function always has no linkage.  Declaring one with `extern'
! or `static' is erroneous.  If you need to declare the nested function
! before its definition, use `auto' (which is otherwise meaningless for
  function declarations).
  
       bar (int *array, int offset, int size)
--- 23410,23424 ----
         /* ... */
         return 0;
  
!       /* Control comes here from 'access'
           if it detects an error.  */
        failure:
         return -1;
       }
  
!  A nested function always has no linkage.  Declaring one with 'extern'
! or 'static' is erroneous.  If you need to declare the nested function
! before its definition, use 'auto' (which is otherwise meaningless for
  function declarations).
  
       bar (int *array, int offset, int size)
*************** acting as mere forwarders for their argu
*** 23600,23607 ****
  
   -- Built-in Function: void * __builtin_apply_args ()
       This built-in function returns a pointer to data describing how to
!      perform a call with the same arguments as are passed to the
!      current function.
  
       The function saves the arg pointer register, structure value
       address, and all registers that might be used to pass arguments to
--- 23456,23463 ----
  
   -- Built-in Function: void * __builtin_apply_args ()
       This built-in function returns a pointer to data describing how to
!      perform a call with the same arguments as are passed to the current
!      function.
  
       The function saves the arg pointer register, structure value
       address, and all registers that might be used to pass arguments to
*************** acting as mere forwarders for their argu
*** 23614,23620 ****
       parameters described by ARGUMENTS and SIZE.
  
       The value of ARGUMENTS should be the value returned by
!      `__builtin_apply_args'.  The argument SIZE specifies the size of
       the stack argument data, in bytes.
  
       This function returns a pointer to data describing how to return
--- 23470,23476 ----
       parameters described by ARGUMENTS and SIZE.
  
       The value of ARGUMENTS should be the value returned by
!      '__builtin_apply_args'.  The argument SIZE specifies the size of
       the stack argument data, in bytes.
  
       This function returns a pointer to data describing how to return
*************** acting as mere forwarders for their argu
*** 23622,23646 ****
       block of memory allocated on the stack.
  
       It is not always simple to compute the proper value for SIZE.  The
!      value is used by `__builtin_apply' to compute the amount of data
       that should be pushed on the stack and copied from the incoming
       argument area.
  
   -- Built-in Function: void __builtin_return (void *RESULT)
       This built-in function returns the value described by RESULT from
       the containing function.  You should specify, for RESULT, a value
!      returned by `__builtin_apply'.
  
!  -- Built-in Function:  __builtin_va_arg_pack ()
       This built-in function represents all anonymous arguments of an
       inline function.  It can be used only in inline functions that are
       always inlined, never compiled as a separate function, such as
!      those using `__attribute__ ((__always_inline__))' or
!      `__attribute__ ((__gnu_inline__))' extern inline functions.  It
!      must be only passed as last argument to some other function with
!      variable arguments.  This is useful for writing small wrapper
!      inlines for variable argument functions, when using preprocessor
!      macros is undesirable.  For example:
            extern int myprintf (FILE *f, const char *format, ...);
            extern inline __attribute__ ((__gnu_inline__)) int
            myprintf (FILE *f, const char *format, ...)
--- 23478,23502 ----
       block of memory allocated on the stack.
  
       It is not always simple to compute the proper value for SIZE.  The
!      value is used by '__builtin_apply' to compute the amount of data
       that should be pushed on the stack and copied from the incoming
       argument area.
  
   -- Built-in Function: void __builtin_return (void *RESULT)
       This built-in function returns the value described by RESULT from
       the containing function.  You should specify, for RESULT, a value
!      returned by '__builtin_apply'.
  
!  -- Built-in Function: __builtin_va_arg_pack ()
       This built-in function represents all anonymous arguments of an
       inline function.  It can be used only in inline functions that are
       always inlined, never compiled as a separate function, such as
!      those using '__attribute__ ((__always_inline__))' or '__attribute__
!      ((__gnu_inline__))' extern inline functions.  It must be only
!      passed as last argument to some other function with variable
!      arguments.  This is useful for writing small wrapper inlines for
!      variable argument functions, when using preprocessor macros is
!      undesirable.  For example:
            extern int myprintf (FILE *f, const char *format, ...);
            extern inline __attribute__ ((__gnu_inline__)) int
            myprintf (FILE *f, const char *format, ...)
*************** acting as mere forwarders for their argu
*** 23658,23667 ****
       This built-in function returns the number of anonymous arguments of
       an inline function.  It can be used only in inline functions that
       are always inlined, never compiled as a separate function, such as
!      those using `__attribute__ ((__always_inline__))' or
!      `__attribute__ ((__gnu_inline__))' extern inline functions.  For
!      example following does link- or run-time checking of open
!      arguments for optimized code:
            #ifdef __OPTIMIZE__
            extern inline __attribute__((__gnu_inline__)) int
            myopen (const char *path, int oflag, ...)
--- 23514,23523 ----
       This built-in function returns the number of anonymous arguments of
       an inline function.  It can be used only in inline functions that
       are always inlined, never compiled as a separate function, such as
!      those using '__attribute__ ((__always_inline__))' or '__attribute__
!      ((__gnu_inline__))' extern inline functions.  For example following
!      does link- or run-time checking of open arguments for optimized
!      code:
            #ifdef __OPTIMIZE__
            extern inline __attribute__((__gnu_inline__)) int
            myopen (const char *path, int oflag, ...)
*************** acting as mere forwarders for their argu
*** 23689,23728 ****
  
  File: gcc.info,  Node: Typeof,  Next: Conditionals,  Prev: Constructing Calls,  Up: C Extensions
  
! 6.6 Referring to a Type with `typeof'
  =====================================
  
! Another way to refer to the type of an expression is with `typeof'.
! The syntax of using of this keyword looks like `sizeof', but the
! construct acts semantically like a type name defined with `typedef'.
  
!  There are two ways of writing the argument to `typeof': with an
  expression or with a type.  Here is an example with an expression:
  
       typeof (x[0](1))
  
! This assumes that `x' is an array of pointers to functions; the type
  described is that of the values of the functions.
  
   Here is an example with a typename as the argument:
  
       typeof (int *)
  
! Here the type described is that of pointers to `int'.
  
   If you are writing a header file that must work when included in ISO C
! programs, write `__typeof__' instead of `typeof'.  *Note Alternate
  Keywords::.
  
!  A `typeof' construct can be used anywhere a typedef name can be used.
  For example, you can use it in a declaration, in a cast, or inside of
! `sizeof' or `typeof'.
  
!  The operand of `typeof' is evaluated for its side effects if and only
  if it is an expression of variably modified type or the name of such a
  type.
  
!  `typeof' is often useful in conjunction with statement expressions
  (*note Statement Exprs::).  Here is how the two together can be used to
  define a safe "maximum" macro which operates on any arithmetic type and
  evaluates each of its arguments exactly once:
--- 23545,23584 ----
  
  File: gcc.info,  Node: Typeof,  Next: Conditionals,  Prev: Constructing Calls,  Up: C Extensions
  
! 6.6 Referring to a Type with 'typeof'
  =====================================
  
! Another way to refer to the type of an expression is with 'typeof'.  The
! syntax of using of this keyword looks like 'sizeof', but the construct
! acts semantically like a type name defined with 'typedef'.
  
!  There are two ways of writing the argument to 'typeof': with an
  expression or with a type.  Here is an example with an expression:
  
       typeof (x[0](1))
  
! This assumes that 'x' is an array of pointers to functions; the type
  described is that of the values of the functions.
  
   Here is an example with a typename as the argument:
  
       typeof (int *)
  
! Here the type described is that of pointers to 'int'.
  
   If you are writing a header file that must work when included in ISO C
! programs, write '__typeof__' instead of 'typeof'.  *Note Alternate
  Keywords::.
  
!  A 'typeof' construct can be used anywhere a typedef name can be used.
  For example, you can use it in a declaration, in a cast, or inside of
! 'sizeof' or 'typeof'.
  
!  The operand of 'typeof' is evaluated for its side effects if and only
  if it is an expression of variably modified type or the name of such a
  type.
  
!  'typeof' is often useful in conjunction with statement expressions
  (*note Statement Exprs::).  Here is how the two together can be used to
  define a safe "maximum" macro which operates on any arithmetic type and
  evaluates each of its arguments exactly once:
*************** evaluates each of its arguments exactly
*** 23734,23755 ****
  
   The reason for using names that start with underscores for the local
  variables is to avoid conflicts with variable names that occur within
! the expressions that are substituted for `a' and `b'.  Eventually we
  hope to design a new form of declaration syntax that allows you to
! declare variables whose scopes start only after their initializers;
! this will be a more reliable way to prevent such conflicts.
  
! Some more examples of the use of `typeof':
  
!    * This declares `y' with the type of what `x' points to.
  
            typeof (*x) y;
  
!    * This declares `y' as an array of such values.
  
            typeof (*x) y[4];
  
!    * This declares `y' as an array of pointers to characters:
  
            typeof (typeof (char *)[4]) y;
  
--- 23590,23611 ----
  
   The reason for using names that start with underscores for the local
  variables is to avoid conflicts with variable names that occur within
! the expressions that are substituted for 'a' and 'b'.  Eventually we
  hope to design a new form of declaration syntax that allows you to
! declare variables whose scopes start only after their initializers; this
! will be a more reliable way to prevent such conflicts.
  
! Some more examples of the use of 'typeof':
  
!    * This declares 'y' with the type of what 'x' points to.
  
            typeof (*x) y;
  
!    * This declares 'y' as an array of such values.
  
            typeof (*x) y[4];
  
!    * This declares 'y' as an array of pointers to characters:
  
            typeof (typeof (char *)[4]) y;
  
*************** Some more examples of the use of `typeof
*** 23757,23763 ****
  
            char *y[4];
  
!      To see the meaning of the declaration using `typeof', and why it
       might be a useful way to write, rewrite it with these macros:
  
            #define pointer(T)  typeof(T *)
--- 23613,23619 ----
  
            char *y[4];
  
!      To see the meaning of the declaration using 'typeof', and why it
       might be a useful way to write, rewrite it with these macros:
  
            #define pointer(T)  typeof(T *)
*************** Some more examples of the use of `typeof
*** 23767,23798 ****
  
            array (pointer (char), 4) y;
  
!      Thus, `array (pointer (char), 4)' is the type of arrays of 4
!      pointers to `char'.
  
   In GNU C, but not GNU C++, you may also declare the type of a variable
! as `__auto_type'.  In that case, the declaration must declare only one
  variable, whose declarator must just be an identifier, the declaration
  must be initialized, and the type of the variable is determined by the
  initializer; the name of the variable is not in scope until after the
! initializer.  (In C++, you should use C++11 `auto' for this purpose.)
! Using `__auto_type', the "maximum" macro above could be written as:
  
       #define max(a,b) \
         ({ __auto_type _a = (a); \
             __auto_type _b = (b); \
           _a > _b ? _a : _b; })
  
!  Using `__auto_type' instead of `typeof' has two advantages:
  
     * Each argument to the macro appears only once in the expansion of
       the macro.  This prevents the size of the macro expansion growing
!      exponentially when calls to such macros are nested inside
!      arguments of such macros.
  
     * If the argument to the macro has variably modified type, it is
!      evaluated only once when using `__auto_type', but twice if
!      `typeof' is used.
  
  
  File: gcc.info,  Node: Conditionals,  Next: __int128,  Prev: Typeof,  Up: C Extensions
--- 23623,23654 ----
  
            array (pointer (char), 4) y;
  
!      Thus, 'array (pointer (char), 4)' is the type of arrays of 4
!      pointers to 'char'.
  
   In GNU C, but not GNU C++, you may also declare the type of a variable
! as '__auto_type'.  In that case, the declaration must declare only one
  variable, whose declarator must just be an identifier, the declaration
  must be initialized, and the type of the variable is determined by the
  initializer; the name of the variable is not in scope until after the
! initializer.  (In C++, you should use C++11 'auto' for this purpose.)
! Using '__auto_type', the "maximum" macro above could be written as:
  
       #define max(a,b) \
         ({ __auto_type _a = (a); \
             __auto_type _b = (b); \
           _a > _b ? _a : _b; })
  
!  Using '__auto_type' instead of 'typeof' has two advantages:
  
     * Each argument to the macro appears only once in the expansion of
       the macro.  This prevents the size of the macro expansion growing
!      exponentially when calls to such macros are nested inside arguments
!      of such macros.
  
     * If the argument to the macro has variably modified type, it is
!      evaluated only once when using '__auto_type', but twice if 'typeof'
!      is used.
  
  
  File: gcc.info,  Node: Conditionals,  Next: __int128,  Prev: Typeof,  Up: C Extensions
*************** expression.
*** 23808,23814 ****
  
       x ? : y
  
! has the value of `x' if that is nonzero; otherwise, the value of `y'.
  
   This example is perfectly equivalent to
  
--- 23664,23670 ----
  
       x ? : y
  
! has the value of 'x' if that is nonzero; otherwise, the value of 'y'.
  
   This example is perfectly equivalent to
  
*************** has the value of `x' if that is nonzero;
*** 23817,23825 ****
  In this simple case, the ability to omit the middle operand is not
  especially useful.  When it becomes useful is when the first operand
  does, or may (if it is a macro argument), contain a side effect.  Then
! repeating the operand in the middle would perform the side effect
! twice.  Omitting the middle operand uses the value already computed
! without the undesirable effects of recomputing it.
  
  
  File: gcc.info,  Node: __int128,  Next: Long Long,  Prev: Conditionals,  Up: C Extensions
--- 23673,23681 ----
  In this simple case, the ability to omit the middle operand is not
  especially useful.  When it becomes useful is when the first operand
  does, or may (if it is a macro argument), contain a side effect.  Then
! repeating the operand in the middle would perform the side effect twice.
! Omitting the middle operand uses the value already computed without the
! undesirable effects of recomputing it.
  
  
  File: gcc.info,  Node: __int128,  Next: Long Long,  Prev: Conditionals,  Up: C Extensions
*************** File: gcc.info,  Node: __int128,  Next:
*** 23827,23838 ****
  6.8 128-bit Integers
  ====================
  
! As an extension the integer scalar type `__int128' is supported for
! targets which have an integer mode wide enough to hold 128 bits.
! Simply write `__int128' for a signed 128-bit integer, or `unsigned
! __int128' for an unsigned 128-bit integer.  There is no support in GCC
! for expressing an integer constant of type `__int128' for targets with
! `long long' integer less than 128 bits wide.
  
  
  File: gcc.info,  Node: Long Long,  Next: Complex,  Prev: __int128,  Up: C Extensions
--- 23683,23694 ----
  6.8 128-bit Integers
  ====================
  
! As an extension the integer scalar type '__int128' is supported for
! targets which have an integer mode wide enough to hold 128 bits.  Simply
! write '__int128' for a signed 128-bit integer, or 'unsigned __int128'
! for an unsigned 128-bit integer.  There is no support in GCC for
! expressing an integer constant of type '__int128' for targets with 'long
! long' integer less than 128 bits wide.
  
  
  File: gcc.info,  Node: Long Long,  Next: Complex,  Prev: __int128,  Up: C Extensions
*************** File: gcc.info,  Node: Long Long,  Next:
*** 23842,23868 ****
  
  ISO C99 supports data types for integers that are at least 64 bits wide,
  and as an extension GCC supports them in C90 mode and in C++.  Simply
! write `long long int' for a signed integer, or `unsigned long long int'
! for an unsigned integer.  To make an integer constant of type `long
! long int', add the suffix `LL' to the integer.  To make an integer
! constant of type `unsigned long long int', add the suffix `ULL' to the
! integer.
  
   You can use these types in arithmetic like any other integer types.
! Addition, subtraction, and bitwise boolean operations on these types
! are open-coded on all types of machines.  Multiplication is open-coded
! if the machine supports a fullword-to-doubleword widening multiply
  instruction.  Division and shifts are open-coded only on machines that
  provide special support.  The operations that are not open-coded use
  special library routines that come with GCC.
  
!  There may be pitfalls when you use `long long' types for function
! arguments without function prototypes.  If a function expects type
! `int' for its argument, and you pass a value of type `long long int',
  confusion results because the caller and the subroutine disagree about
! the number of bytes for the argument.  Likewise, if the function
! expects `long long int' and you pass `int'.  The best way to avoid such
! problems is to use prototypes.
  
  
  File: gcc.info,  Node: Complex,  Next: Floating Types,  Prev: Long Long,  Up: C Extensions
--- 23698,23723 ----
  
  ISO C99 supports data types for integers that are at least 64 bits wide,
  and as an extension GCC supports them in C90 mode and in C++.  Simply
! write 'long long int' for a signed integer, or 'unsigned long long int'
! for an unsigned integer.  To make an integer constant of type 'long long
! int', add the suffix 'LL' to the integer.  To make an integer constant
! of type 'unsigned long long int', add the suffix 'ULL' to the integer.
  
   You can use these types in arithmetic like any other integer types.
! Addition, subtraction, and bitwise boolean operations on these types are
! open-coded on all types of machines.  Multiplication is open-coded if
! the machine supports a fullword-to-doubleword widening multiply
  instruction.  Division and shifts are open-coded only on machines that
  provide special support.  The operations that are not open-coded use
  special library routines that come with GCC.
  
!  There may be pitfalls when you use 'long long' types for function
! arguments without function prototypes.  If a function expects type 'int'
! for its argument, and you pass a value of type 'long long int',
  confusion results because the caller and the subroutine disagree about
! the number of bytes for the argument.  Likewise, if the function expects
! 'long long int' and you pass 'int'.  The best way to avoid such problems
! is to use prototypes.
  
  
  File: gcc.info,  Node: Complex,  Next: Floating Types,  Prev: Long Long,  Up: C Extensions
*************** File: gcc.info,  Node: Complex,  Next: F
*** 23871,23907 ****
  ====================
  
  ISO C99 supports complex floating data types, and as an extension GCC
! supports them in C90 mode and in C++.  GCC also supports complex
! integer data types which are not part of ISO C99.  You can declare
! complex types using the keyword `_Complex'.  As an extension, the older
! GNU keyword `__complex__' is also supported.
  
!  For example, `_Complex double x;' declares `x' as a variable whose
! real part and imaginary part are both of type `double'.  `_Complex
! short int y;' declares `y' to have real and imaginary parts of type
! `short int'; this is not likely to be useful, but it shows that the set
! of complex types is complete.
  
!  To write a constant with a complex data type, use the suffix `i' or
! `j' (either one; they are equivalent).  For example, `2.5fi' has type
! `_Complex float' and `3i' has type `_Complex int'.  Such a constant
  always has a pure imaginary value, but you can form any complex value
  you like by adding one to a real constant.  This is a GNU extension; if
  you have an ISO C99 conforming C library (such as the GNU C Library),
  and want to construct complex constants of floating type, you should
! include `<complex.h>' and use the macros `I' or `_Complex_I' instead.
  
   To extract the real part of a complex-valued expression EXP, write
! `__real__ EXP'.  Likewise, use `__imag__' to extract the imaginary
! part.  This is a GNU extension; for values of floating type, you should
! use the ISO C99 functions `crealf', `creal', `creall', `cimagf',
! `cimag' and `cimagl', declared in `<complex.h>' and also provided as
! built-in functions by GCC.
  
!  The operator `~' performs complex conjugation when used on a value
! with a complex type.  This is a GNU extension; for values of floating
! type, you should use the ISO C99 functions `conjf', `conj' and `conjl',
! declared in `<complex.h>' and also provided as built-in functions by
  GCC.
  
   GCC can allocate complex automatic variables in a noncontiguous
--- 23726,23762 ----
  ====================
  
  ISO C99 supports complex floating data types, and as an extension GCC
! supports them in C90 mode and in C++.  GCC also supports complex integer
! data types which are not part of ISO C99.  You can declare complex types
! using the keyword '_Complex'.  As an extension, the older GNU keyword
! '__complex__' is also supported.
  
!  For example, '_Complex double x;' declares 'x' as a variable whose real
! part and imaginary part are both of type 'double'.  '_Complex short int
! y;' declares 'y' to have real and imaginary parts of type 'short int';
! this is not likely to be useful, but it shows that the set of complex
! types is complete.
  
!  To write a constant with a complex data type, use the suffix 'i' or 'j'
! (either one; they are equivalent).  For example, '2.5fi' has type
! '_Complex float' and '3i' has type '_Complex int'.  Such a constant
  always has a pure imaginary value, but you can form any complex value
  you like by adding one to a real constant.  This is a GNU extension; if
  you have an ISO C99 conforming C library (such as the GNU C Library),
  and want to construct complex constants of floating type, you should
! include '<complex.h>' and use the macros 'I' or '_Complex_I' instead.
  
   To extract the real part of a complex-valued expression EXP, write
! '__real__ EXP'.  Likewise, use '__imag__' to extract the imaginary part.
! This is a GNU extension; for values of floating type, you should use the
! ISO C99 functions 'crealf', 'creal', 'creall', 'cimagf', 'cimag' and
! 'cimagl', declared in '<complex.h>' and also provided as built-in
! functions by GCC.
  
!  The operator '~' performs complex conjugation when used on a value with
! a complex type.  This is a GNU extension; for values of floating type,
! you should use the ISO C99 functions 'conjf', 'conj' and 'conjl',
! declared in '<complex.h>' and also provided as built-in functions by
  GCC.
  
   GCC can allocate complex automatic variables in a noncontiguous
*************** the imaginary part is on the stack (or v
*** 23910,23917 ****
  debug info format can represent this, so use of DWARF 2 is recommended.
  If you are using the stabs debug info format, GCC describes a
  noncontiguous complex variable as if it were two separate variables of
! noncomplex type.  If the variable's actual name is `foo', the two
! fictitious variables are named `foo$real' and `foo$imag'.  You can
  examine and set these two fictitious variables with your debugger.
  
  
--- 23765,23772 ----
  debug info format can represent this, so use of DWARF 2 is recommended.
  If you are using the stabs debug info format, GCC describes a
  noncontiguous complex variable as if it were two separate variables of
! noncomplex type.  If the variable's actual name is 'foo', the two
! fictitious variables are named 'foo$real' and 'foo$imag'.  You can
  examine and set these two fictitious variables with your debugger.
  
  
*************** File: gcc.info,  Node: Floating Types,
*** 23920,23941 ****
  6.11 Additional Floating Types
  ==============================
  
! As an extension, GNU C supports additional floating types, `__float80'
! and `__float128' to support 80-bit (`XFmode') and 128-bit (`TFmode')
  floating types.  Support for additional types includes the arithmetic
  operators: add, subtract, multiply, divide; unary arithmetic operators;
  relational operators; equality operators; and conversions to and from
! integer and other floating types.  Use a suffix `w' or `W' in a literal
! constant of type `__float80' and `q' or `Q' for `_float128'.  You can
  declare complex types using the corresponding internal complex type,
! `XCmode' for `__float80' type and `TCmode' for `__float128' type:
  
       typedef _Complex float __attribute__((mode(TC))) _Complex128;
       typedef _Complex float __attribute__((mode(XC))) _Complex80;
  
!  Not all targets support additional floating-point types.  `__float80'
! and `__float128' types are supported on x86 and IA-64 targets.  The
! `__float128' type is supported on hppa HP-UX targets.
  
  
  File: gcc.info,  Node: Half-Precision,  Next: Decimal Float,  Prev: Floating Types,  Up: C Extensions
--- 23775,23796 ----
  6.11 Additional Floating Types
  ==============================
  
! As an extension, GNU C supports additional floating types, '__float80'
! and '__float128' to support 80-bit ('XFmode') and 128-bit ('TFmode')
  floating types.  Support for additional types includes the arithmetic
  operators: add, subtract, multiply, divide; unary arithmetic operators;
  relational operators; equality operators; and conversions to and from
! integer and other floating types.  Use a suffix 'w' or 'W' in a literal
! constant of type '__float80' and 'q' or 'Q' for '_float128'.  You can
  declare complex types using the corresponding internal complex type,
! 'XCmode' for '__float80' type and 'TCmode' for '__float128' type:
  
       typedef _Complex float __attribute__((mode(TC))) _Complex128;
       typedef _Complex float __attribute__((mode(XC))) _Complex80;
  
!  Not all targets support additional floating-point types.  '__float80'
! and '__float128' types are supported on x86 and IA-64 targets.  The
! '__float128' type is supported on hppa HP-UX targets.
  
  
  File: gcc.info,  Node: Half-Precision,  Next: Decimal Float,  Prev: Floating Types,  Up: C Extensions
*************** File: gcc.info,  Node: Half-Precision,
*** 23944,23988 ****
  ==================================
  
  On ARM targets, GCC supports half-precision (16-bit) floating point via
! the `__fp16' type.  You must enable this type explicitly with the
! `-mfp16-format' command-line option in order to use it.
  
   ARM supports two incompatible representations for half-precision
  floating-point values.  You must choose one of the representations and
  use it consistently in your program.
  
!  Specifying `-mfp16-format=ieee' selects the IEEE 754-2008 format.
! This format can represent normalized values in the range of 2^-14 to
! 65504.  There are 11 bits of significand precision, approximately 3
! decimal digits.
  
!  Specifying `-mfp16-format=alternative' selects the ARM alternative
! format.  This representation is similar to the IEEE format, but does
! not support infinities or NaNs.  Instead, the range of exponents is
  extended, so that this format can represent normalized values in the
! range of 2^-14 to 131008.
  
!  The `__fp16' type is a storage format only.  For purposes of
! arithmetic and other operations, `__fp16' values in C or C++
! expressions are automatically promoted to `float'.  In addition, you
! cannot declare a function with a return value or parameters of type
! `__fp16'.
  
!  Note that conversions from `double' to `__fp16' involve an
! intermediate conversion to `float'.  Because of rounding, this can
! sometimes produce a different result than a direct conversion.
  
!  ARM provides hardware support for conversions between `__fp16' and
! `float' values as an extension to VFP and NEON (Advanced SIMD).  GCC
  generates code using these hardware instructions if you compile with
  options to select an FPU that provides them; for example,
! `-mfpu=neon-fp16 -mfloat-abi=softfp', in addition to the
! `-mfp16-format' option to select a half-precision format.
  
!  Language-level support for the `__fp16' data type is independent of
  whether GCC generates code using hardware floating-point instructions.
  In cases where hardware support is not specified, GCC implements
! conversions between `__fp16' and `float' values as library calls.
  
  
  File: gcc.info,  Node: Decimal Float,  Next: Hex Floats,  Prev: Half-Precision,  Up: C Extensions
--- 23799,23842 ----
  ==================================
  
  On ARM targets, GCC supports half-precision (16-bit) floating point via
! the '__fp16' type.  You must enable this type explicitly with the
! '-mfp16-format' command-line option in order to use it.
  
   ARM supports two incompatible representations for half-precision
  floating-point values.  You must choose one of the representations and
  use it consistently in your program.
  
!  Specifying '-mfp16-format=ieee' selects the IEEE 754-2008 format.  This
! format can represent normalized values in the range of 2^{-14} to 65504.
! There are 11 bits of significand precision, approximately 3 decimal
! digits.
  
!  Specifying '-mfp16-format=alternative' selects the ARM alternative
! format.  This representation is similar to the IEEE format, but does not
! support infinities or NaNs.  Instead, the range of exponents is
  extended, so that this format can represent normalized values in the
! range of 2^{-14} to 131008.
  
!  The '__fp16' type is a storage format only.  For purposes of arithmetic
! and other operations, '__fp16' values in C or C++ expressions are
! automatically promoted to 'float'.  In addition, you cannot declare a
! function with a return value or parameters of type '__fp16'.
  
!  Note that conversions from 'double' to '__fp16' involve an intermediate
! conversion to 'float'.  Because of rounding, this can sometimes produce
! a different result than a direct conversion.
  
!  ARM provides hardware support for conversions between '__fp16' and
! 'float' values as an extension to VFP and NEON (Advanced SIMD). GCC
  generates code using these hardware instructions if you compile with
  options to select an FPU that provides them; for example,
! '-mfpu=neon-fp16 -mfloat-abi=softfp', in addition to the '-mfp16-format'
! option to select a half-precision format.
  
!  Language-level support for the '__fp16' data type is independent of
  whether GCC generates code using hardware floating-point instructions.
  In cases where hardware support is not specified, GCC implements
! conversions between '__fp16' and 'float' values as library calls.
  
  
  File: gcc.info,  Node: Decimal Float,  Next: Hex Floats,  Prev: Half-Precision,  Up: C Extensions
*************** File: gcc.info,  Node: Decimal Float,  N
*** 23990,24012 ****
  6.13 Decimal Floating Types
  ===========================
  
! As an extension, GNU C supports decimal floating types as defined in
! the N1312 draft of ISO/IEC WDTR24732.  Support for decimal floating
! types in GCC will evolve as the draft technical report changes.
! Calling conventions for any target might also change.  Not all targets
! support decimal floating types.
  
!  The decimal floating types are `_Decimal32', `_Decimal64', and
! `_Decimal128'.  They use a radix of ten, unlike the floating types
! `float', `double', and `long double' whose radix is not specified by
! the C standard but is usually two.
  
   Support for decimal floating types includes the arithmetic operators
  add, subtract, multiply, divide; unary arithmetic operators; relational
  operators; equality operators; and conversions to and from integer and
! other floating types.  Use a suffix `df' or `DF' in a literal constant
! of type `_Decimal32', `dd' or `DD' for `_Decimal64', and `dl' or `DL'
! for `_Decimal128'.
  
   GCC support of decimal float as specified by the draft technical report
  is incomplete:
--- 23844,23866 ----
  6.13 Decimal Floating Types
  ===========================
  
! As an extension, GNU C supports decimal floating types as defined in the
! N1312 draft of ISO/IEC WDTR24732.  Support for decimal floating types in
! GCC will evolve as the draft technical report changes.  Calling
! conventions for any target might also change.  Not all targets support
! decimal floating types.
  
!  The decimal floating types are '_Decimal32', '_Decimal64', and
! '_Decimal128'.  They use a radix of ten, unlike the floating types
! 'float', 'double', and 'long double' whose radix is not specified by the
! C standard but is usually two.
  
   Support for decimal floating types includes the arithmetic operators
  add, subtract, multiply, divide; unary arithmetic operators; relational
  operators; equality operators; and conversions to and from integer and
! other floating types.  Use a suffix 'df' or 'DF' in a literal constant
! of type '_Decimal32', 'dd' or 'DD' for '_Decimal64', and 'dl' or 'DL'
! for '_Decimal128'.
  
   GCC support of decimal float as specified by the draft technical report
  is incomplete:
*************** is incomplete:
*** 24017,24028 ****
       technical report.
  
     * GCC does not provide the C library functionality associated with
!      `math.h', `fenv.h', `stdio.h', `stdlib.h', and `wchar.h', which
       must come from a separate C library implementation.  Because of
!      this the GNU C compiler does not define macro `__STDC_DEC_FP__' to
       indicate that the implementation conforms to the technical report.
  
!  Types `_Decimal32', `_Decimal64', and `_Decimal128' are supported by
  the DWARF 2 debug information format.
  
  
--- 23871,23882 ----
       technical report.
  
     * GCC does not provide the C library functionality associated with
!      'math.h', 'fenv.h', 'stdio.h', 'stdlib.h', and 'wchar.h', which
       must come from a separate C library implementation.  Because of
!      this the GNU C compiler does not define macro '__STDC_DEC_FP__' to
       indicate that the implementation conforms to the technical report.
  
!  Types '_Decimal32', '_Decimal64', and '_Decimal128' are supported by
  the DWARF 2 debug information format.
  
  
*************** File: gcc.info,  Node: Hex Floats,  Next
*** 24032,24051 ****
  ===============
  
  ISO C99 supports floating-point numbers written not only in the usual
! decimal notation, such as `1.55e1', but also numbers such as `0x1.fp3'
! written in hexadecimal format.  As a GNU extension, GCC supports this
! in C90 mode (except in some cases when strictly conforming) and in C++.
! In that format the `0x' hex introducer and the `p' or `P' exponent
! field are mandatory.  The exponent is a decimal number that indicates
! the power of 2 by which the significant part is multiplied.  Thus
! `0x1.f' is 1 15/16, `p3' multiplies it by 8, and the value of `0x1.fp3'
! is the same as `1.55e1'.
  
   Unlike for floating-point numbers in the decimal notation the exponent
  is always required in the hexadecimal notation.  Otherwise the compiler
! would not be able to resolve the ambiguity of, e.g., `0x1.f'.  This
! could mean `1.0f' or `1.9375' since `f' is also the extension for
! floating-point constants of type `float'.
  
  
  File: gcc.info,  Node: Fixed-Point,  Next: Named Address Spaces,  Prev: Hex Floats,  Up: C Extensions
--- 23886,23905 ----
  ===============
  
  ISO C99 supports floating-point numbers written not only in the usual
! decimal notation, such as '1.55e1', but also numbers such as '0x1.fp3'
! written in hexadecimal format.  As a GNU extension, GCC supports this in
! C90 mode (except in some cases when strictly conforming) and in C++.  In
! that format the '0x' hex introducer and the 'p' or 'P' exponent field
! are mandatory.  The exponent is a decimal number that indicates the
! power of 2 by which the significant part is multiplied.  Thus '0x1.f' is
! 1 15/16, 'p3' multiplies it by 8, and the value of '0x1.fp3' is the same
! as '1.55e1'.
  
   Unlike for floating-point numbers in the decimal notation the exponent
  is always required in the hexadecimal notation.  Otherwise the compiler
! would not be able to resolve the ambiguity of, e.g., '0x1.f'.  This
! could mean '1.0f' or '1.9375' since 'f' is also the extension for
! floating-point constants of type 'float'.
  
  
  File: gcc.info,  Node: Fixed-Point,  Next: Named Address Spaces,  Prev: Hex Floats,  Up: C Extensions
*************** will evolve as the draft technical repor
*** 24059,24135 ****
  for any target might also change.  Not all targets support fixed-point
  types.
  
!  The fixed-point types are `short _Fract', `_Fract', `long _Fract',
! `long long _Fract', `unsigned short _Fract', `unsigned _Fract',
! `unsigned long _Fract', `unsigned long long _Fract', `_Sat short
! _Fract', `_Sat _Fract', `_Sat long _Fract', `_Sat long long _Fract',
! `_Sat unsigned short _Fract', `_Sat unsigned _Fract', `_Sat unsigned
! long _Fract', `_Sat unsigned long long _Fract', `short _Accum',
! `_Accum', `long _Accum', `long long _Accum', `unsigned short _Accum',
! `unsigned _Accum', `unsigned long _Accum', `unsigned long long _Accum',
! `_Sat short _Accum', `_Sat _Accum', `_Sat long _Accum', `_Sat long long
! _Accum', `_Sat unsigned short _Accum', `_Sat unsigned _Accum', `_Sat
! unsigned long _Accum', `_Sat unsigned long long _Accum'.
  
   Fixed-point data values contain fractional and optional integral parts.
  The format of fixed-point data varies and depends on the target machine.
  
   Support for fixed-point types includes:
!    * prefix and postfix increment and decrement operators (`++', `--')
! 
!    * unary arithmetic operators (`+', `-', `!')
! 
!    * binary arithmetic operators (`+', `-', `*', `/')
! 
!    * binary shift operators (`<<', `>>')
! 
!    * relational operators (`<', `<=', `>=', `>')
! 
!    * equality operators (`==', `!=')
! 
!    * assignment operators (`+=', `-=', `*=', `/=', `<<=', `>>=')
! 
     * conversions to and from integer, floating-point, or fixed-point
       types
  
   Use a suffix in a fixed-point literal constant:
!    * `hr' or `HR' for `short _Fract' and `_Sat short _Fract'
! 
!    * `r' or `R' for `_Fract' and `_Sat _Fract'
! 
!    * `lr' or `LR' for `long _Fract' and `_Sat long _Fract'
! 
!    * `llr' or `LLR' for `long long _Fract' and `_Sat long long _Fract'
! 
!    * `uhr' or `UHR' for `unsigned short _Fract' and `_Sat unsigned
!      short _Fract'
! 
!    * `ur' or `UR' for `unsigned _Fract' and `_Sat unsigned _Fract'
! 
!    * `ulr' or `ULR' for `unsigned long _Fract' and `_Sat unsigned long
       _Fract'
! 
!    * `ullr' or `ULLR' for `unsigned long long _Fract' and `_Sat
!      unsigned long long _Fract'
! 
!    * `hk' or `HK' for `short _Accum' and `_Sat short _Accum'
! 
!    * `k' or `K' for `_Accum' and `_Sat _Accum'
! 
!    * `lk' or `LK' for `long _Accum' and `_Sat long _Accum'
! 
!    * `llk' or `LLK' for `long long _Accum' and `_Sat long long _Accum'
! 
!    * `uhk' or `UHK' for `unsigned short _Accum' and `_Sat unsigned
!      short _Accum'
! 
!    * `uk' or `UK' for `unsigned _Accum' and `_Sat unsigned _Accum'
! 
!    * `ulk' or `ULK' for `unsigned long _Accum' and `_Sat unsigned long
       _Accum'
! 
!    * `ullk' or `ULLK' for `unsigned long long _Accum' and `_Sat
!      unsigned long long _Accum'
  
   GCC support of fixed-point types as specified by the draft technical
  report is incomplete:
--- 23913,23967 ----
  for any target might also change.  Not all targets support fixed-point
  types.
  
!  The fixed-point types are 'short _Fract', '_Fract', 'long _Fract',
! 'long long _Fract', 'unsigned short _Fract', 'unsigned _Fract',
! 'unsigned long _Fract', 'unsigned long long _Fract', '_Sat short
! _Fract', '_Sat _Fract', '_Sat long _Fract', '_Sat long long _Fract',
! '_Sat unsigned short _Fract', '_Sat unsigned _Fract', '_Sat unsigned
! long _Fract', '_Sat unsigned long long _Fract', 'short _Accum',
! '_Accum', 'long _Accum', 'long long _Accum', 'unsigned short _Accum',
! 'unsigned _Accum', 'unsigned long _Accum', 'unsigned long long _Accum',
! '_Sat short _Accum', '_Sat _Accum', '_Sat long _Accum', '_Sat long long
! _Accum', '_Sat unsigned short _Accum', '_Sat unsigned _Accum', '_Sat
! unsigned long _Accum', '_Sat unsigned long long _Accum'.
  
   Fixed-point data values contain fractional and optional integral parts.
  The format of fixed-point data varies and depends on the target machine.
  
   Support for fixed-point types includes:
!    * prefix and postfix increment and decrement operators ('++', '--')
!    * unary arithmetic operators ('+', '-', '!')
!    * binary arithmetic operators ('+', '-', '*', '/')
!    * binary shift operators ('<<', '>>')
!    * relational operators ('<', '<=', '>=', '>')
!    * equality operators ('==', '!=')
!    * assignment operators ('+=', '-=', '*=', '/=', '<<=', '>>=')
     * conversions to and from integer, floating-point, or fixed-point
       types
  
   Use a suffix in a fixed-point literal constant:
!    * 'hr' or 'HR' for 'short _Fract' and '_Sat short _Fract'
!    * 'r' or 'R' for '_Fract' and '_Sat _Fract'
!    * 'lr' or 'LR' for 'long _Fract' and '_Sat long _Fract'
!    * 'llr' or 'LLR' for 'long long _Fract' and '_Sat long long _Fract'
!    * 'uhr' or 'UHR' for 'unsigned short _Fract' and '_Sat unsigned short
       _Fract'
!    * 'ur' or 'UR' for 'unsigned _Fract' and '_Sat unsigned _Fract'
!    * 'ulr' or 'ULR' for 'unsigned long _Fract' and '_Sat unsigned long
!      _Fract'
!    * 'ullr' or 'ULLR' for 'unsigned long long _Fract' and '_Sat unsigned
!      long long _Fract'
!    * 'hk' or 'HK' for 'short _Accum' and '_Sat short _Accum'
!    * 'k' or 'K' for '_Accum' and '_Sat _Accum'
!    * 'lk' or 'LK' for 'long _Accum' and '_Sat long _Accum'
!    * 'llk' or 'LLK' for 'long long _Accum' and '_Sat long long _Accum'
!    * 'uhk' or 'UHK' for 'unsigned short _Accum' and '_Sat unsigned short
       _Accum'
!    * 'uk' or 'UK' for 'unsigned _Accum' and '_Sat unsigned _Accum'
!    * 'ulk' or 'ULK' for 'unsigned long _Accum' and '_Sat unsigned long
!      _Accum'
!    * 'ullk' or 'ULLK' for 'unsigned long long _Accum' and '_Sat unsigned
!      long long _Accum'
  
   GCC support of fixed-point types as specified by the draft technical
  report is incomplete:
*************** File: gcc.info,  Node: Named Address Spa
*** 24149,24160 ****
  As an extension, GNU C supports named address spaces as defined in the
  N1275 draft of ISO/IEC DTR 18037.  Support for named address spaces in
  GCC will evolve as the draft technical report changes.  Calling
! conventions for any target might also change.  At present, only the
! AVR, SPU, M32C, and RL78 targets support address spaces other than the
  generic address space.
  
   Address space identifiers may be used exactly like any other C type
! qualifier (e.g., `const' or `volatile').  See the N1275 document for
  more details.
  
  6.16.1 AVR Named Address Spaces
--- 23981,23992 ----
  As an extension, GNU C supports named address spaces as defined in the
  N1275 draft of ISO/IEC DTR 18037.  Support for named address spaces in
  GCC will evolve as the draft technical report changes.  Calling
! conventions for any target might also change.  At present, only the AVR,
! SPU, M32C, and RL78 targets support address spaces other than the
  generic address space.
  
   Address space identifiers may be used exactly like any other C type
! qualifier (e.g., 'const' or 'volatile').  See the N1275 document for
  more details.
  
  6.16.1 AVR Named Address Spaces
*************** more details.
*** 24162,24199 ****
  
  On the AVR target, there are several address spaces that can be used in
  order to put read-only data into the flash memory and access that data
! by means of the special instructions `LPM' or `ELPM' needed to read
! from flash.
  
   Per default, any data including read-only data is located in RAM (the
  generic address space) so that non-generic address spaces are needed to
  locate read-only data in flash memory _and_ to generate the right
  instructions to access this data without using (inline) assembler code.
  
! `__flash'
!      The `__flash' qualifier locates data in the `.progmem.data'
!      section. Data is read using the `LPM' instruction. Pointers to
       this address space are 16 bits wide.
  
! `__flash1'
! `__flash2'
! `__flash3'
! `__flash4'
! `__flash5'
       These are 16-bit address spaces locating data in section
!      `.progmemN.data' where N refers to address space `__flashN'.  The
!      compiler sets the `RAMPZ' segment register appropriately before
!      reading data by means of the `ELPM' instruction.
  
! `__memx'
       This is a 24-bit address space that linearizes flash and RAM: If
!      the high bit of the address is set, data is read from RAM using
!      the lower two bytes as RAM address.  If the high bit of the
!      address is clear, data is read from flash with `RAMPZ' set
!      according to the high byte of the address.  *Note
!      `__builtin_avr_flash_segment': AVR Built-in Functions.
  
!      Objects in this address space are located in `.progmemx.data'.
  
   Example
  
--- 23994,24031 ----
  
  On the AVR target, there are several address spaces that can be used in
  order to put read-only data into the flash memory and access that data
! by means of the special instructions 'LPM' or 'ELPM' needed to read from
! flash.
  
   Per default, any data including read-only data is located in RAM (the
  generic address space) so that non-generic address spaces are needed to
  locate read-only data in flash memory _and_ to generate the right
  instructions to access this data without using (inline) assembler code.
  
! '__flash'
!      The '__flash' qualifier locates data in the '.progmem.data'
!      section.  Data is read using the 'LPM' instruction.  Pointers to
       this address space are 16 bits wide.
  
! '__flash1'
! '__flash2'
! '__flash3'
! '__flash4'
! '__flash5'
       These are 16-bit address spaces locating data in section
!      '.progmemN.data' where N refers to address space '__flashN'.  The
!      compiler sets the 'RAMPZ' segment register appropriately before
!      reading data by means of the 'ELPM' instruction.
  
! '__memx'
       This is a 24-bit address space that linearizes flash and RAM: If
!      the high bit of the address is set, data is read from RAM using the
!      lower two bytes as RAM address.  If the high bit of the address is
!      clear, data is read from flash with 'RAMPZ' set according to the
!      high byte of the address.  *Note '__builtin_avr_flash_segment': AVR
!      Built-in Functions.
  
!      Objects in this address space are located in '.progmemx.data'.
  
   Example
  
*************** not:
*** 24241,24273 ****
       }
       #endif /* __FLASH */
  
! Notice that attribute *note `progmem': AVR Variable Attributes.
! locates data in flash but accesses to these data read from generic
! address space, i.e.  from RAM, so that you need special accessors like
! `pgm_read_byte' from AVR-LibC (http://nongnu.org/avr-libc/user-manual/)
! together with attribute `progmem'.
  
  Limitations and caveats
  
!    * Reading across the 64 KiB section boundary of the `__flash' or
!      `__flashN' address spaces shows undefined behavior. The only
!      address space that supports reading across the 64 KiB flash
!      segment boundaries is `__memx'.
  
!    * If you use one of the `__flashN' address spaces you must arrange
!      your linker script to locate the `.progmemN.data' sections
       according to your needs.
  
     * Any data or pointers to the non-generic address spaces must be
!      qualified as `const', i.e. as read-only data.  This still applies
       if the data in one of these address spaces like software version
!      number or calibration lookup table are intended to be changed
!      after load time by, say, a boot loader. In this case the right
!      qualification is `const' `volatile' so that the compiler must not
       optimize away known values or insert them as immediates into
       operands of instructions.
  
!    * The following code initializes a variable `pfoo' located in static
       storage with a 24-bit address:
            extern const __memx char foo;
            const __memx void *pfoo = &foo;
--- 24073,24105 ----
       }
       #endif /* __FLASH */
  
! Notice that attribute *note 'progmem': AVR Variable Attributes. locates
! data in flash but accesses to these data read from generic address
! space, i.e. from RAM, so that you need special accessors like
! 'pgm_read_byte' from AVR-LibC (http://nongnu.org/avr-libc/user-manual/)
! together with attribute 'progmem'.
  
  Limitations and caveats
  
!    * Reading across the 64 KiB section boundary of the '__flash' or
!      '__flashN' address spaces shows undefined behavior.  The only
!      address space that supports reading across the 64 KiB flash segment
!      boundaries is '__memx'.
  
!    * If you use one of the '__flashN' address spaces you must arrange
!      your linker script to locate the '.progmemN.data' sections
       according to your needs.
  
     * Any data or pointers to the non-generic address spaces must be
!      qualified as 'const', i.e. as read-only data.  This still applies
       if the data in one of these address spaces like software version
!      number or calibration lookup table are intended to be changed after
!      load time by, say, a boot loader.  In this case the right
!      qualification is 'const' 'volatile' so that the compiler must not
       optimize away known values or insert them as immediates into
       operands of instructions.
  
!    * The following code initializes a variable 'pfoo' located in static
       storage with a 24-bit address:
            extern const __memx char foo;
            const __memx void *pfoo = &foo;
*************** Limitations and caveats
*** 24275,24293 ****
       Such code requires at least binutils 2.23, see
       PR13503 (http://sourceware.org/PR13503).
  
- 
  6.16.2 M32C Named Address Spaces
  --------------------------------
  
  On the M32C target, with the R8C and M16C CPU variants, variables
! qualified with `__far' are accessed using 32-bit addresses in order to
! access memory beyond the first 64 Ki bytes.  If `__far' is used with
! the M32CM or M32C CPU variants, it has no effect.
  
  6.16.3 RL78 Named Address Spaces
  --------------------------------
  
! On the RL78 target, variables qualified with `__far' are accessed with
  32-bit pointers (20-bit addresses) rather than the default 16-bit
  addresses.  Non-far variables are assumed to appear in the topmost
  64 KiB of the address space.
--- 24107,24124 ----
       Such code requires at least binutils 2.23, see
       PR13503 (http://sourceware.org/PR13503).
  
  6.16.2 M32C Named Address Spaces
  --------------------------------
  
  On the M32C target, with the R8C and M16C CPU variants, variables
! qualified with '__far' are accessed using 32-bit addresses in order to
! access memory beyond the first 64 Ki bytes.  If '__far' is used with the
! M32CM or M32C CPU variants, it has no effect.
  
  6.16.3 RL78 Named Address Spaces
  --------------------------------
  
! On the RL78 target, variables qualified with '__far' are accessed with
  32-bit pointers (20-bit addresses) rather than the default 16-bit
  addresses.  Non-far variables are assumed to appear in the topmost
  64 KiB of the address space.
*************** addresses.  Non-far variables are assume
*** 24296,24309 ****
  -------------------------------
  
  On the SPU target variables may be declared as belonging to another
! address space by qualifying the type with the `__ea' address space
  identifier:
  
       extern int __ea i;
  
! The compiler generates special code to access the variable `i'.  It may
! use runtime library support, or generate special machine instructions
! to access that address space.
  
  
  File: gcc.info,  Node: Zero Length,  Next: Empty Structures,  Prev: Named Address Spaces,  Up: C Extensions
--- 24127,24140 ----
  -------------------------------
  
  On the SPU target variables may be declared as belonging to another
! address space by qualifying the type with the '__ea' address space
  identifier:
  
       extern int __ea i;
  
! The compiler generates special code to access the variable 'i'.  It may
! use runtime library support, or generate special machine instructions to
! access that address space.
  
  
  File: gcc.info,  Node: Zero Length,  Next: Empty Structures,  Prev: Named Address Spaces,  Up: C Extensions
*************** variable-length object:
*** 24324,24359 ****
         malloc (sizeof (struct line) + this_length);
       thisline->length = this_length;
  
!  In ISO C90, you would have to give `contents' a length of 1, which
! means either you waste space or complicate the argument to `malloc'.
  
   In ISO C99, you would use a "flexible array member", which is slightly
  different in syntax and semantics:
  
!    * Flexible array members are written as `contents[]' without the `0'.
  
!    * Flexible array members have incomplete type, and so the `sizeof'
       operator may not be applied.  As a quirk of the original
!      implementation of zero-length arrays, `sizeof' evaluates to zero.
  
     * Flexible array members may only appear as the last member of a
!      `struct' that is otherwise non-empty.
  
     * A structure containing a flexible array member, or a union
       containing such a structure (possibly recursively), may not be a
       member of a structure or an element of an array.  (However, these
       uses are permitted by GCC as extensions.)
  
!  Non-empty initialization of zero-length arrays is treated like any
! case where there are more initializer elements than the array holds, in
! that a suitable warning about "excess elements in array" is given, and
! the excess elements (all of them, in this case) are ignored.
  
   GCC allows static initialization of flexible array members.  This is
! equivalent to defining a new structure containing the original
! structure followed by an array of sufficient size to contain the data.
! E.g. in the following, `f1' is constructed as if it were declared like
! `f2'.
  
       struct f1 {
         int x; int y[];
--- 24155,24189 ----
         malloc (sizeof (struct line) + this_length);
       thisline->length = this_length;
  
!  In ISO C90, you would have to give 'contents' a length of 1, which
! means either you waste space or complicate the argument to 'malloc'.
  
   In ISO C99, you would use a "flexible array member", which is slightly
  different in syntax and semantics:
  
!    * Flexible array members are written as 'contents[]' without the '0'.
  
!    * Flexible array members have incomplete type, and so the 'sizeof'
       operator may not be applied.  As a quirk of the original
!      implementation of zero-length arrays, 'sizeof' evaluates to zero.
  
     * Flexible array members may only appear as the last member of a
!      'struct' that is otherwise non-empty.
  
     * A structure containing a flexible array member, or a union
       containing such a structure (possibly recursively), may not be a
       member of a structure or an element of an array.  (However, these
       uses are permitted by GCC as extensions.)
  
!  Non-empty initialization of zero-length arrays is treated like any case
! where there are more initializer elements than the array holds, in that
! a suitable warning about "excess elements in array" is given, and the
! excess elements (all of them, in this case) are ignored.
  
   GCC allows static initialization of flexible array members.  This is
! equivalent to defining a new structure containing the original structure
! followed by an array of sufficient size to contain the data.  E.g. in
! the following, 'f1' is constructed as if it were declared like 'f2'.
  
       struct f1 {
         int x; int y[];
*************** E.g. in the following, `f1' is construct
*** 24363,24380 ****
         struct f1 f1; int data[3];
       } f2 = { { 1 }, { 2, 3, 4 } };
  
! The convenience of this extension is that `f1' has the desired type,
! eliminating the need to consistently refer to `f2.f1'.
  
   This has symmetry with normal static arrays, in that an array of
! unknown size is also written with `[]'.
  
   Of course, this extension only makes sense if the extra data comes at
! the end of a top-level object, as otherwise we would be overwriting
! data at subsequent offsets.  To avoid undue complication and confusion
! with initialization of deeply nested arrays, we simply disallow any
! non-empty initialization except when the structure is the top-level
! object.  For example:
  
       struct foo { int x; int y[]; };
       struct bar { struct foo z; };
--- 24193,24210 ----
         struct f1 f1; int data[3];
       } f2 = { { 1 }, { 2, 3, 4 } };
  
! The convenience of this extension is that 'f1' has the desired type,
! eliminating the need to consistently refer to 'f2.f1'.
  
   This has symmetry with normal static arrays, in that an array of
! unknown size is also written with '[]'.
  
   Of course, this extension only makes sense if the extra data comes at
! the end of a top-level object, as otherwise we would be overwriting data
! at subsequent offsets.  To avoid undue complication and confusion with
! initialization of deeply nested arrays, we simply disallow any non-empty
! initialization except when the structure is the top-level object.  For
! example:
  
       struct foo { int x; int y[]; };
       struct bar { struct foo z; };
*************** GCC permits a C structure to have no mem
*** 24396,24403 ****
       };
  
   The structure has size zero.  In C++, empty structures are part of the
! language.  G++ treats empty structures as if they had a single member
! of type `char'.
  
  
  File: gcc.info,  Node: Variable Length,  Next: Variadic Macros,  Prev: Empty Structures,  Up: C Extensions
--- 24226,24233 ----
       };
  
   The structure has size zero.  In C++, empty structures are part of the
! language.  G++ treats empty structures as if they had a single member of
! type 'char'.
  
  
  File: gcc.info,  Node: Variable Length,  Next: Variadic Macros,  Prev: Empty Structures,  Up: C Extensions
*************** structure or a union.  For example:
*** 24434,24450 ****
         struct S { int x[n]; };
       }
  
!  You can use the function `alloca' to get an effect much like
! variable-length arrays.  The function `alloca' is available in many
  other C implementations (but not in all).  On the other hand,
  variable-length arrays are more elegant.
  
   There are other differences between these two methods.  Space allocated
! with `alloca' exists until the containing _function_ returns.  The
! space for a variable-length array is deallocated as soon as the array
! name's scope ends.  (If you use both variable-length arrays and
! `alloca' in the same function, deallocation of a variable-length array
! also deallocates anything more recently allocated with `alloca'.)
  
   You can also use variable-length arrays as arguments to functions:
  
--- 24264,24280 ----
         struct S { int x[n]; };
       }
  
!  You can use the function 'alloca' to get an effect much like
! variable-length arrays.  The function 'alloca' is available in many
  other C implementations (but not in all).  On the other hand,
  variable-length arrays are more elegant.
  
   There are other differences between these two methods.  Space allocated
! with 'alloca' exists until the containing _function_ returns.  The space
! for a variable-length array is deallocated as soon as the array name's
! scope ends.  (If you use both variable-length arrays and 'alloca' in the
! same function, deallocation of a variable-length array also deallocates
! anything more recently allocated with 'alloca'.)
  
   You can also use variable-length arrays as arguments to functions:
  
*************** also deallocates anything more recently
*** 24456,24462 ****
  
   The length of an array is computed once when the storage is allocated
  and is remembered for the scope of the array in case you access it with
! `sizeof'.
  
   If you want to pass the array first and the length afterward, you can
  use a forward declaration in the parameter list--another GNU extension.
--- 24286,24292 ----
  
   The length of an array is computed once when the storage is allocated
  and is remembered for the scope of the array in case you access it with
! 'sizeof'.
  
   If you want to pass the array first and the length afterward, you can
  use a forward declaration in the parameter list--another GNU extension.
*************** use a forward declaration in the paramet
*** 24467,24475 ****
         /* ... */
       }
  
!  The `int len' before the semicolon is a "parameter forward
! declaration", and it serves the purpose of making the name `len' known
! when the declaration of `data' is parsed.
  
   You can write any number of such parameter forward declarations in the
  parameter list.  They can be separated by commas or semicolons, but the
--- 24297,24305 ----
         /* ... */
       }
  
!  The 'int len' before the semicolon is a "parameter forward
! declaration", and it serves the purpose of making the name 'len' known
! when the declaration of 'data' is parsed.
  
   You can write any number of such parameter forward declarations in the
  parameter list.  They can be separated by commas or semicolons, but the
*************** example:
*** 24491,24501 ****
  
       #define debug(format, ...) fprintf (stderr, format, __VA_ARGS__)
  
! Here `...' is a "variable argument".  In the invocation of such a
! macro, it represents the zero or more tokens until the closing
! parenthesis that ends the invocation, including any commas.  This set of
! tokens replaces the identifier `__VA_ARGS__' in the macro body wherever
! it appears.  See the CPP manual for more information.
  
   GCC has long supported variadic macros, and used a different syntax
  that allowed you to give a name to the variable arguments just like any
--- 24321,24331 ----
  
       #define debug(format, ...) fprintf (stderr, format, __VA_ARGS__)
  
! Here '...' is a "variable argument".  In the invocation of such a macro,
! it represents the zero or more tokens until the closing parenthesis that
! ends the invocation, including any commas.  This set of tokens replaces
! the identifier '__VA_ARGS__' in the macro body wherever it appears.  See
! the CPP manual for more information.
  
   GCC has long supported variadic macros, and used a different syntax
  that allowed you to give a name to the variable arguments just like any
*************** be used with either of the above forms o
*** 24511,24518 ****
  
   In standard C, you are not allowed to leave the variable argument out
  entirely; but you are allowed to pass an empty argument.  For example,
! this invocation is invalid in ISO C, because there is no comma after
! the string:
  
       debug ("A message")
  
--- 24341,24348 ----
  
   In standard C, you are not allowed to leave the variable argument out
  entirely; but you are allowed to pass an empty argument.  For example,
! this invocation is invalid in ISO C, because there is no comma after the
! string:
  
       debug ("A message")
  
*************** the expansion of the macro still has the
*** 24522,24533 ****
  string.
  
   To help solve this problem, CPP behaves specially for variable
! arguments used with the token paste operator, `##'.  If instead you
  write
  
       #define debug(format, ...) fprintf (stderr, format, ## __VA_ARGS__)
  
! and if the variable arguments are omitted or empty, the `##' operator
  causes the preprocessor to remove the comma before it.  If you do
  provide some variable arguments in your macro invocation, GNU CPP does
  not complain about the paste operation and instead places the variable
--- 24352,24363 ----
  string.
  
   To help solve this problem, CPP behaves specially for variable
! arguments used with the token paste operator, '##'.  If instead you
  write
  
       #define debug(format, ...) fprintf (stderr, format, ## __VA_ARGS__)
  
! and if the variable arguments are omitted or empty, the '##' operator
  causes the preprocessor to remove the comma before it.  If you do
  provide some variable arguments in your macro invocation, GNU CPP does
  not complain about the paste operation and instead places the variable
*************** File: gcc.info,  Node: Escaped Newlines,
*** 24540,24555 ****
  6.21 Slightly Looser Rules for Escaped Newlines
  ===============================================
  
! The preprocessor treatment of escaped newlines is more relaxed than
! that specified by the C90 standard, which requires the newline to
! immediately follow a backslash.  GCC's implementation allows whitespace
! in the form of spaces, horizontal and vertical tabs, and form feeds
! between the backslash and the subsequent newline.  The preprocessor
! issues a warning, but treats it as a valid escaped newline and combines
! the two lines to form a single logical line.  This works within
! comments and tokens, as well as between tokens.  Comments are _not_
! treated as whitespace for the purposes of this relaxation, since they
! have not yet been replaced with spaces.
  
  
  File: gcc.info,  Node: Subscripting,  Next: Pointer Arith,  Prev: Escaped Newlines,  Up: C Extensions
--- 24370,24385 ----
  6.21 Slightly Looser Rules for Escaped Newlines
  ===============================================
  
! The preprocessor treatment of escaped newlines is more relaxed than that
! specified by the C90 standard, which requires the newline to immediately
! follow a backslash.  GCC's implementation allows whitespace in the form
! of spaces, horizontal and vertical tabs, and form feeds between the
! backslash and the subsequent newline.  The preprocessor issues a
! warning, but treats it as a valid escaped newline and combines the two
! lines to form a single logical line.  This works within comments and
! tokens, as well as between tokens.  Comments are _not_ treated as
! whitespace for the purposes of this relaxation, since they have not yet
! been replaced with spaces.
  
  
  File: gcc.info,  Node: Subscripting,  Next: Pointer Arith,  Prev: Escaped Newlines,  Up: C Extensions
*************** File: gcc.info,  Node: Subscripting,  Ne
*** 24557,24568 ****
  6.22 Non-Lvalue Arrays May Have Subscripts
  ==========================================
  
! In ISO C99, arrays that are not lvalues still decay to pointers, and
! may be subscripted, although they may not be modified or used after the
! next sequence point and the unary `&' operator may not be applied to
! them.  As an extension, GNU C allows such arrays to be subscripted in
! C90 mode, though otherwise they do not decay to pointers outside C99
! mode.  For example, this is valid in GNU C though not valid in C90:
  
       struct foo {int a[4];};
  
--- 24387,24398 ----
  6.22 Non-Lvalue Arrays May Have Subscripts
  ==========================================
  
! In ISO C99, arrays that are not lvalues still decay to pointers, and may
! be subscripted, although they may not be modified or used after the next
! sequence point and the unary '&' operator may not be applied to them.
! As an extension, GNU C allows such arrays to be subscripted in C90 mode,
! though otherwise they do not decay to pointers outside C99 mode.  For
! example, this is valid in GNU C though not valid in C90:
  
       struct foo {int a[4];};
  
*************** mode.  For example, this is valid in GNU
*** 24576,24593 ****
  
  File: gcc.info,  Node: Pointer Arith,  Next: Pointers to Arrays,  Prev: Subscripting,  Up: C Extensions
  
! 6.23 Arithmetic on `void'- and Function-Pointers
  ================================================
  
  In GNU C, addition and subtraction operations are supported on pointers
! to `void' and on pointers to functions.  This is done by treating the
! size of a `void' or of a function as 1.
  
!  A consequence of this is that `sizeof' is also allowed on `void' and
! on function types, and returns 1.
  
!  The option `-Wpointer-arith' requests a warning if these extensions
! are used.
  
  
  File: gcc.info,  Node: Pointers to Arrays,  Next: Initializers,  Prev: Pointer Arith,  Up: C Extensions
--- 24406,24423 ----
  
  File: gcc.info,  Node: Pointer Arith,  Next: Pointers to Arrays,  Prev: Subscripting,  Up: C Extensions
  
! 6.23 Arithmetic on 'void'- and Function-Pointers
  ================================================
  
  In GNU C, addition and subtraction operations are supported on pointers
! to 'void' and on pointers to functions.  This is done by treating the
! size of a 'void' or of a function as 1.
  
!  A consequence of this is that 'sizeof' is also allowed on 'void' and on
! function types, and returns 1.
  
!  The option '-Wpointer-arith' requests a warning if these extensions are
! used.
  
  
  File: gcc.info,  Node: Pointers to Arrays,  Next: Initializers,  Prev: Pointer Arith,  Up: C Extensions
*************** File: gcc.info,  Node: Pointers to Array
*** 24595,24606 ****
  6.24 Pointers to Arrays with Qualifiers Work as Expected
  ========================================================
  
! In GNU C, pointers to arrays with qualifiers work similar to pointers
! to other qualified types. For example, a value of type `int (*)[5]' can
! be used to initialize a variable of type `const int (*)[5]'.  These
! types are incompatible in ISO C because the `const' qualifier is
! formally attached to the element type of the array and not the array
! itself.
  
       extern void
       transpose (int N, int M, double out[M][N], const double in[N][M]);
--- 24425,24435 ----
  6.24 Pointers to Arrays with Qualifiers Work as Expected
  ========================================================
  
! In GNU C, pointers to arrays with qualifiers work similar to pointers to
! other qualified types.  For example, a value of type 'int (*)[5]' can be
! used to initialize a variable of type 'const int (*)[5]'.  These types
! are incompatible in ISO C because the 'const' qualifier is formally
! attached to the element type of the array and not the array itself.
  
       extern void
       transpose (int N, int M, double out[M][N], const double in[N][M]);
*************** File: gcc.info,  Node: Initializers,  Ne
*** 24615,24624 ****
  6.25 Non-Constant Initializers
  ==============================
  
! As in standard C++ and ISO C99, the elements of an aggregate
! initializer for an automatic variable are not required to be constant
! expressions in GNU C.  Here is an example of an initializer with
! run-time varying elements:
  
       foo (float f, float g)
       {
--- 24444,24453 ----
  6.25 Non-Constant Initializers
  ==============================
  
! As in standard C++ and ISO C99, the elements of an aggregate initializer
! for an automatic variable are not required to be constant expressions in
! GNU C.  Here is an example of an initializer with run-time varying
! elements:
  
       foo (float f, float g)
       {
*************** initializer; it is an lvalue.  As an ext
*** 24639,24650 ****
  literals in C90 mode and in C++, though the semantics are somewhat
  different in C++.
  
!  Usually, the specified type is a structure.  Assume that `struct foo'
! and `structure' are declared as shown:
  
       struct foo {int a; char b[2];} structure;
  
! Here is an example of constructing a `struct foo' with a compound
  literal:
  
       structure = ((struct foo) {x + y, 'a', 0});
--- 24468,24479 ----
  literals in C90 mode and in C++, though the semantics are somewhat
  different in C++.
  
!  Usually, the specified type is a structure.  Assume that 'struct foo'
! and 'structure' are declared as shown:
  
       struct foo {int a; char b[2];} structure;
  
! Here is an example of constructing a 'struct foo' with a compound
  literal:
  
       structure = ((struct foo) {x + y, 'a', 0});
*************** initializer, as shown here:
*** 24669,24681 ****
  but then the compound literal is equivalent to a cast.
  
   As a GNU extension, GCC allows initialization of objects with static
! storage duration by compound literals (which is not possible in ISO
! C99, because the initializer is not a constant).  It is handled as if
! the object is initialized only with the bracket enclosed list if the
! types of the compound literal and the object match.  The initializer
! list of the compound literal must be constant.  If the object being
! initialized has array type of unknown size, the size is determined by
! compound literal size.
  
       static struct foo x = (struct foo) {1, 'a', 'b'};
       static int y[] = (int []) {1, 2, 3};
--- 24498,24510 ----
  but then the compound literal is equivalent to a cast.
  
   As a GNU extension, GCC allows initialization of objects with static
! storage duration by compound literals (which is not possible in ISO C99,
! because the initializer is not a constant).  It is handled as if the
! object is initialized only with the bracket enclosed list if the types
! of the compound literal and the object match.  The initializer list of
! the compound literal must be constant.  If the object being initialized
! has array type of unknown size, the size is determined by compound
! literal size.
  
       static struct foo x = (struct foo) {1, 'a', 'b'};
       static int y[] = (int []) {1, 2, 3};
*************** The above lines are equivalent to the fo
*** 24688,24706 ****
  
   In C, a compound literal designates an unnamed object with static or
  automatic storage duration.  In C++, a compound literal designates a
! temporary object, which only lives until the end of its
! full-expression.  As a result, well-defined C code that takes the
! address of a subobject of a compound literal can be undefined in C++,
! so the C++ compiler rejects the conversion of a temporary array to a
! pointer.  For instance, if the array compound literal example above
! appeared inside a function, any subsequent use of `foo' in C++ has
! undefined behavior because the lifetime of the array ends after the
! declaration of `foo'.
  
   As an optimization, the C++ compiler sometimes gives array compound
  literals longer lifetimes: when the array either appears outside a
! function or has const-qualified type.  If `foo' and its initializer had
! elements of `char *const' type rather than `char *', or if `foo' were a
  global variable, the array would have static storage duration.  But it
  is probably safest just to avoid the use of array compound literals in
  code compiled as C++.
--- 24517,24534 ----
  
   In C, a compound literal designates an unnamed object with static or
  automatic storage duration.  In C++, a compound literal designates a
! temporary object, which only lives until the end of its full-expression.
! As a result, well-defined C code that takes the address of a subobject
! of a compound literal can be undefined in C++, so the C++ compiler
! rejects the conversion of a temporary array to a pointer.  For instance,
! if the array compound literal example above appeared inside a function,
! any subsequent use of 'foo' in C++ has undefined behavior because the
! lifetime of the array ends after the declaration of 'foo'.
  
   As an optimization, the C++ compiler sometimes gives array compound
  literals longer lifetimes: when the array either appears outside a
! function or has const-qualified type.  If 'foo' and its initializer had
! elements of 'char *const' type rather than 'char *', or if 'foo' were a
  global variable, the array would have static storage duration.  But it
  is probably safest just to avoid the use of array compound literals in
  code compiled as C++.
*************** indices or structure field names they ap
*** 24720,24726 ****
  an extension in C90 mode as well.  This extension is not implemented in
  GNU C++.
  
!  To specify an array index, write `[INDEX] =' before the element value.
  For example,
  
       int a[6] = { [4] = 29, [2] = 15 };
--- 24548,24554 ----
  an extension in C90 mode as well.  This extension is not implemented in
  GNU C++.
  
!  To specify an array index, write '[INDEX] =' before the element value.
  For example,
  
       int a[6] = { [4] = 29, [2] = 15 };
*************** The index values must be constant expres
*** 24733,24742 ****
  initialized is automatic.
  
   An alternative syntax for this that has been obsolete since GCC 2.5 but
! GCC still accepts is to write `[INDEX]' before the element value, with
! no `='.
  
!  To initialize a range of elements to the same value, write `[FIRST ...
  LAST] = VALUE'.  This is a GNU extension.  For example,
  
       int widths[] = { [0 ... 9] = 1, [10 ... 99] = 2, [100] = 3 };
--- 24561,24570 ----
  initialized is automatic.
  
   An alternative syntax for this that has been obsolete since GCC 2.5 but
! GCC still accepts is to write '[INDEX]' before the element value, with
! no '='.
  
!  To initialize a range of elements to the same value, write '[FIRST ...
  LAST] = VALUE'.  This is a GNU extension.  For example,
  
       int widths[] = { [0 ... 9] = 1, [10 ... 99] = 2, [100] = 3 };
*************** Note that the length of the array is the
*** 24748,24754 ****
  one.
  
   In a structure initializer, specify the name of a field to initialize
! with `.FIELDNAME =' before the element value.  For example, given the
  following structure,
  
       struct point { int x, y; };
--- 24576,24582 ----
  one.
  
   In a structure initializer, specify the name of a field to initialize
! with '.FIELDNAME =' before the element value.  For example, given the
  following structure,
  
       struct point { int x, y; };
*************** is equivalent to
*** 24762,24786 ****
       struct point p = { xvalue, yvalue };
  
   Another syntax that has the same meaning, obsolete since GCC 2.5, is
! `FIELDNAME:', as shown here:
  
       struct point p = { y: yvalue, x: xvalue };
  
   Omitted field members are implicitly initialized the same as objects
  that have static storage duration.
  
!  The `[INDEX]' or `.FIELDNAME' is known as a "designator".  You can
! also use a designator (or the obsolete colon syntax) when initializing
! a union, to specify which element of the union should be used.  For
  example,
  
       union foo { int i; double d; };
  
       union foo f = { .d = 4 };
  
! converts 4 to a `double' to store it in the union using the second
! element.  By contrast, casting 4 to type `union foo' stores it into the
! union as the integer `i', since it is an integer.  (*Note Cast to
  Union::.)
  
   You can combine this technique of naming elements with ordinary C
--- 24590,24614 ----
       struct point p = { xvalue, yvalue };
  
   Another syntax that has the same meaning, obsolete since GCC 2.5, is
! 'FIELDNAME:', as shown here:
  
       struct point p = { y: yvalue, x: xvalue };
  
   Omitted field members are implicitly initialized the same as objects
  that have static storage duration.
  
!  The '[INDEX]' or '.FIELDNAME' is known as a "designator".  You can also
! use a designator (or the obsolete colon syntax) when initializing a
! union, to specify which element of the union should be used.  For
  example,
  
       union foo { int i; double d; };
  
       union foo f = { .d = 4 };
  
! converts 4 to a 'double' to store it in the union using the second
! element.  By contrast, casting 4 to type 'union foo' stores it into the
! union as the integer 'i', since it is an integer.  (*Note Cast to
  Union::.)
  
   You can combine this technique of naming elements with ordinary C
*************** is equivalent to
*** 24794,24812 ****
  
       int a[6] = { 0, v1, v2, 0, v4, 0 };
  
!  Labeling the elements of an array initializer is especially useful
! when the indices are characters or belong to an `enum' type.  For
! example:
  
       int whitespace[256]
         = { [' '] = 1, ['\t'] = 1, ['\h'] = 1,
             ['\f'] = 1, ['\n'] = 1, ['\r'] = 1 };
  
!  You can also write a series of `.FIELDNAME' and `[INDEX]' designators
! before an `=' to specify a nested subobject to initialize; the list is
! taken relative to the subobject corresponding to the closest
! surrounding brace pair.  For example, with the `struct point'
! declaration above:
  
       struct point ptarray[10] = { [2].y = yv2, [2].x = xv2, [0].x = xv0 };
  
--- 24622,24638 ----
  
       int a[6] = { 0, v1, v2, 0, v4, 0 };
  
!  Labeling the elements of an array initializer is especially useful when
! the indices are characters or belong to an 'enum' type.  For example:
  
       int whitespace[256]
         = { [' '] = 1, ['\t'] = 1, ['\h'] = 1,
             ['\f'] = 1, ['\n'] = 1, ['\r'] = 1 };
  
!  You can also write a series of '.FIELDNAME' and '[INDEX]' designators
! before an '=' to specify a nested subobject to initialize; the list is
! taken relative to the subobject corresponding to the closest surrounding
! brace pair.  For example, with the 'struct point' declaration above:
  
       struct point ptarray[10] = { [2].y = yv2, [2].x = xv2, [0].x = xv0 };
  
*************** File: gcc.info,  Node: Case Ranges,  Nex
*** 24821,24839 ****
  6.28 Case Ranges
  ================
  
! You can specify a range of consecutive values in a single `case' label,
  like this:
  
       case LOW ... HIGH:
  
! This has the same effect as the proper number of individual `case'
  labels, one for each integer value from LOW to HIGH, inclusive.
  
   This feature is especially useful for ranges of ASCII character codes:
  
       case 'A' ... 'Z':
  
!  *Be careful:* Write spaces around the `...', for otherwise it may be
  parsed wrong when you use it with integer values.  For example, write
  this:
  
--- 24647,24665 ----
  6.28 Case Ranges
  ================
  
! You can specify a range of consecutive values in a single 'case' label,
  like this:
  
       case LOW ... HIGH:
  
! This has the same effect as the proper number of individual 'case'
  labels, one for each integer value from LOW to HIGH, inclusive.
  
   This feature is especially useful for ranges of ASCII character codes:
  
       case 'A' ... 'Z':
  
!  *Be careful:* Write spaces around the '...', for otherwise it may be
  parsed wrong when you use it with integer values.  For example, write
  this:
  
*************** File: gcc.info,  Node: Cast to Union,  N
*** 24850,24859 ****
  =========================
  
  A cast to union type is similar to other casts, except that the type
! specified is a union type.  You can specify the type either with `union
! TAG' or with a typedef name.  A cast to union is actually a
! constructor, not a cast, and hence does not yield an lvalue like normal
! casts.  (*Note Compound Literals::.)
  
   The types that may be cast to the union type are those of the members
  of the union.  Thus, given the following union and variables:
--- 24676,24685 ----
  =========================
  
  A cast to union type is similar to other casts, except that the type
! specified is a union type.  You can specify the type either with 'union
! TAG' or with a typedef name.  A cast to union is actually a constructor,
! not a cast, and hence does not yield an lvalue like normal casts.
! (*Note Compound Literals::.)
  
   The types that may be cast to the union type are those of the members
  of the union.  Thus, given the following union and variables:
*************** of the union.  Thus, given the following
*** 24862,24868 ****
       int x;
       double y;
  
! both `x' and `y' can be cast to type `union foo'.
  
   Using the cast as the right-hand side of an assignment to a variable of
  union type is equivalent to storing in a member of the union:
--- 24688,24694 ----
       int x;
       double y;
  
! both 'x' and 'y' can be cast to type 'union foo'.
  
   Using the cast as the right-hand side of an assignment to a variable of
  union type is equivalent to storing in a member of the union:
*************** In GNU C, you declare certain things abo
*** 24906,24999 ****
  program which help the compiler optimize function calls and check your
  code more carefully.
  
!  The keyword `__attribute__' allows you to specify special attributes
  when making a declaration.  This keyword is followed by an attribute
  specification inside double parentheses.  The following attributes are
! currently defined for functions on all targets: `aligned',
! `alloc_size', `alloc_align', `assume_aligned', `noreturn',
! `returns_twice', `noinline', `noclone', `no_icf', `always_inline',
! `flatten', `pure', `const', `nothrow', `sentinel', `format',
! `format_arg', `no_instrument_function', `no_split_stack', `section',
! `constructor', `destructor', `used', `unused', `deprecated', `weak',
! `malloc', `alias', `ifunc', `warn_unused_result', `nonnull',
! `returns_nonnull', `gnu_inline', `externally_visible', `hot', `cold',
! `artificial', `no_sanitize_address', `no_address_safety_analysis',
! `no_sanitize_thread', `no_sanitize_undefined', `no_reorder',
! `bnd_legacy', `bnd_instrument', `stack_protect', `error' and `warning'.
  Several other attributes are defined for functions on particular target
! systems.  Other attributes, including `section' are supported for
  variables declarations (*note Variable Attributes::), labels (*note
  Label Attributes::) and for types (*note Type Attributes::).
  
   GCC plugins may provide their own attributes.
  
!  You may also specify attributes with `__' preceding and following each
  keyword.  This allows you to use them in header files without being
! concerned about a possible macro of the same name.  For example, you
! may use `__noreturn__' instead of `noreturn'.
  
   *Note Attribute Syntax::, for details of the exact syntax for using
  attributes.
  
! `alias ("TARGET")'
!      The `alias' attribute causes the declaration to be emitted as an
       alias for another symbol, which must be specified.  For instance,
  
            void __f () { /* Do something. */; }
            void f () __attribute__ ((weak, alias ("__f")));
  
!      defines `f' to be a weak alias for `__f'.  In C++, the mangled
!      name for the target must be used.  It is an error if `__f' is not
       defined in the same translation unit.
  
       Not all target machines support this attribute.
  
! `aligned (ALIGNMENT)'
       This attribute specifies a minimum alignment for the function,
       measured in bytes.
  
       You cannot use this attribute to decrease the alignment of a
       function, only to increase it.  However, when you explicitly
       specify a function alignment this overrides the effect of the
!      `-falign-functions' (*note Optimize Options::) option for this
       function.
  
!      Note that the effectiveness of `aligned' attributes may be limited
       by inherent limitations in your linker.  On many systems, the
       linker is only able to arrange for functions to be aligned up to a
       certain maximum alignment.  (For some linkers, the maximum
       supported alignment may be very very small.)  See your linker
       documentation for further information.
  
!      The `aligned' attribute can also be used for variables and fields
       (*note Variable Attributes::.)
  
! `alloc_size'
!      The `alloc_size' attribute is used to tell the compiler that the
       function return value points to memory, where the size is given by
       one or two of the functions parameters.  GCC uses this information
!      to improve the correctness of `__builtin_object_size'.
  
!      The function parameter(s) denoting the allocated size are
!      specified by one or two integer arguments supplied to the
!      attribute.  The allocated size is either the value of the single
!      function argument specified or the product of the two function
!      arguments specified.  Argument numbering starts at one.
  
       For instance,
  
            void* my_calloc(size_t, size_t) __attribute__((alloc_size(1,2)))
            void* my_realloc(void*, size_t) __attribute__((alloc_size(2)))
  
!      declares that `my_calloc' returns memory of the size given by the
!      product of parameter 1 and 2 and that `my_realloc' returns memory
       of the size given by parameter 2.
  
! `alloc_align'
!      The `alloc_align' attribute is used to tell the compiler that the
       function return value points to memory, where the returned pointer
!      minimum alignment is given by one of the functions parameters.
!      GCC uses this information to improve pointer alignment analysis.
  
       The function parameter denoting the allocated alignment is
       specified by one integer argument, whose number is the argument of
--- 24732,24825 ----
  program which help the compiler optimize function calls and check your
  code more carefully.
  
!  The keyword '__attribute__' allows you to specify special attributes
  when making a declaration.  This keyword is followed by an attribute
  specification inside double parentheses.  The following attributes are
! currently defined for functions on all targets: 'aligned', 'alloc_size',
! 'alloc_align', 'assume_aligned', 'noreturn', 'returns_twice',
! 'noinline', 'noclone', 'no_icf', 'always_inline', 'flatten', 'pure',
! 'const', 'nothrow', 'sentinel', 'format', 'format_arg',
! 'no_instrument_function', 'no_split_stack', 'section', 'constructor',
! 'destructor', 'used', 'unused', 'deprecated', 'weak', 'malloc', 'alias',
! 'ifunc', 'warn_unused_result', 'nonnull', 'returns_nonnull',
! 'gnu_inline', 'externally_visible', 'hot', 'cold', 'artificial',
! 'no_sanitize_address', 'no_address_safety_analysis',
! 'no_sanitize_thread', 'no_sanitize_undefined', 'no_reorder',
! 'bnd_legacy', 'bnd_instrument', 'stack_protect', 'error' and 'warning'.
  Several other attributes are defined for functions on particular target
! systems.  Other attributes, including 'section' are supported for
  variables declarations (*note Variable Attributes::), labels (*note
  Label Attributes::) and for types (*note Type Attributes::).
  
   GCC plugins may provide their own attributes.
  
!  You may also specify attributes with '__' preceding and following each
  keyword.  This allows you to use them in header files without being
! concerned about a possible macro of the same name.  For example, you may
! use '__noreturn__' instead of 'noreturn'.
  
   *Note Attribute Syntax::, for details of the exact syntax for using
  attributes.
  
! 'alias ("TARGET")'
!      The 'alias' attribute causes the declaration to be emitted as an
       alias for another symbol, which must be specified.  For instance,
  
            void __f () { /* Do something. */; }
            void f () __attribute__ ((weak, alias ("__f")));
  
!      defines 'f' to be a weak alias for '__f'.  In C++, the mangled name
!      for the target must be used.  It is an error if '__f' is not
       defined in the same translation unit.
  
       Not all target machines support this attribute.
  
! 'aligned (ALIGNMENT)'
       This attribute specifies a minimum alignment for the function,
       measured in bytes.
  
       You cannot use this attribute to decrease the alignment of a
       function, only to increase it.  However, when you explicitly
       specify a function alignment this overrides the effect of the
!      '-falign-functions' (*note Optimize Options::) option for this
       function.
  
!      Note that the effectiveness of 'aligned' attributes may be limited
       by inherent limitations in your linker.  On many systems, the
       linker is only able to arrange for functions to be aligned up to a
       certain maximum alignment.  (For some linkers, the maximum
       supported alignment may be very very small.)  See your linker
       documentation for further information.
  
!      The 'aligned' attribute can also be used for variables and fields
       (*note Variable Attributes::.)
  
! 'alloc_size'
!      The 'alloc_size' attribute is used to tell the compiler that the
       function return value points to memory, where the size is given by
       one or two of the functions parameters.  GCC uses this information
!      to improve the correctness of '__builtin_object_size'.
  
!      The function parameter(s) denoting the allocated size are specified
!      by one or two integer arguments supplied to the attribute.  The
!      allocated size is either the value of the single function argument
!      specified or the product of the two function arguments specified.
!      Argument numbering starts at one.
  
       For instance,
  
            void* my_calloc(size_t, size_t) __attribute__((alloc_size(1,2)))
            void* my_realloc(void*, size_t) __attribute__((alloc_size(2)))
  
!      declares that 'my_calloc' returns memory of the size given by the
!      product of parameter 1 and 2 and that 'my_realloc' returns memory
       of the size given by parameter 2.
  
! 'alloc_align'
!      The 'alloc_align' attribute is used to tell the compiler that the
       function return value points to memory, where the returned pointer
!      minimum alignment is given by one of the functions parameters.  GCC
!      uses this information to improve pointer alignment analysis.
  
       The function parameter denoting the allocated alignment is
       specified by one integer argument, whose number is the argument of
*************** attributes.
*** 25003,25013 ****
  
            void* my_memalign(size_t, size_t) __attribute__((alloc_align(1)))
  
!      declares that `my_memalign' returns memory with minimum alignment
       given by parameter 1.
  
! `assume_aligned'
!      The `assume_aligned' attribute is used to tell the compiler that
       the function return value points to memory, where the returned
       pointer minimum alignment is given by the first argument.  If the
       attribute has two arguments, the second argument is misalignment
--- 24829,24839 ----
  
            void* my_memalign(size_t, size_t) __attribute__((alloc_align(1)))
  
!      declares that 'my_memalign' returns memory with minimum alignment
       given by parameter 1.
  
! 'assume_aligned'
!      The 'assume_aligned' attribute is used to tell the compiler that
       the function return value points to memory, where the returned
       pointer minimum alignment is given by the first argument.  If the
       attribute has two arguments, the second argument is misalignment
*************** attributes.
*** 25018,25027 ****
            void* my_alloc1(size_t) __attribute__((assume_aligned(16)))
            void* my_alloc2(size_t) __attribute__((assume_aligned(32, 8)))
  
!      declares that `my_alloc1' returns 16-byte aligned pointer and that
!      `my_alloc2' returns a pointer whose value modulo 32 is equal to 8.
  
! `always_inline'
       Generally, functions are not inlined unless optimization is
       specified.  For functions declared inline, this attribute inlines
       the function independent of any restrictions that otherwise apply
--- 24844,24853 ----
            void* my_alloc1(size_t) __attribute__((assume_aligned(16)))
            void* my_alloc2(size_t) __attribute__((assume_aligned(32, 8)))
  
!      declares that 'my_alloc1' returns 16-byte aligned pointer and that
!      'my_alloc2' returns a pointer whose value modulo 32 is equal to 8.
  
! 'always_inline'
       Generally, functions are not inlined unless optimization is
       specified.  For functions declared inline, this attribute inlines
       the function independent of any restrictions that otherwise apply
*************** attributes.
*** 25031,25143 ****
       and a failure to inline an indirect call may or may not be
       diagnosed.
  
! `gnu_inline'
       This attribute should be used with a function that is also declared
!      with the `inline' keyword.  It directs GCC to treat the function
!      as if it were defined in gnu90 mode even when compiling in C99 or
       gnu99 mode.
  
!      If the function is declared `extern', then this definition of the
       function is used only for inlining.  In no case is the function
       compiled as a standalone function, not even if you take its address
       explicitly.  Such an address becomes an external reference, as if
       you had only declared the function, and had not defined it.  This
       has almost the effect of a macro.  The way to use this is to put a
       function definition in a header file with this attribute, and put
!      another copy of the function, without `extern', in a library file.
!      The definition in the header file causes most calls to the
!      function to be inlined.  If any uses of the function remain, they
!      refer to the single copy in the library.  Note that the two
!      definitions of the functions need not be precisely the same,
!      although if they do not have the same effect your program may
!      behave oddly.
  
!      In C, if the function is neither `extern' nor `static', then the
       function is compiled as a standalone function, as well as being
       inlined where possible.
  
!      This is how GCC traditionally handled functions declared `inline'.
!      Since ISO C99 specifies a different semantics for `inline', this
       function attribute is provided as a transition measure and as a
       useful feature in its own right.  This attribute is available in
!      GCC 4.1.3 and later.  It is available if either of the
!      preprocessor macros `__GNUC_GNU_INLINE__' or
!      `__GNUC_STDC_INLINE__' are defined.  *Note An Inline Function is
!      As Fast As a Macro: Inline.
  
!      In C++, this attribute does not depend on `extern' in any way, but
!      it still requires the `inline' keyword to enable its special
       behavior.
  
! `artificial'
       This attribute is useful for small inline wrappers that if possible
       should appear during debugging as a unit.  Depending on the debug
       info format it either means marking the function as artificial or
       using the caller location for all instructions within the inlined
       body.
  
! `bank_switch'
       When added to an interrupt handler with the M32C port, causes the
       prologue and epilogue to use bank switching to preserve the
       registers rather than saving them on the stack.
  
! `flatten'
       Generally, inlining into a function is limited.  For a function
       marked with this attribute, every call inside this function is
       inlined, if possible.  Whether the function itself is considered
       for inlining depends on its size and the current inlining
       parameters.
  
! `error ("MESSAGE")'
       If this attribute is used on a function declaration and a call to
       such a function is not eliminated through dead code elimination or
       other optimizations, an error that includes MESSAGE is diagnosed.
       This is useful for compile-time checking, especially together with
!      `__builtin_constant_p' and inline functions where checking the
!      inline function arguments is not possible through `extern char
!      [(condition) ? 1 : -1];' tricks.  While it is possible to leave
!      the function undefined and thus invoke a link failure, when using
!      this attribute the problem is diagnosed earlier and with exact
!      location of the call even in presence of inline functions or when
!      not emitting debugging information.
  
! `warning ("MESSAGE")'
       If this attribute is used on a function declaration and a call to
       such a function is not eliminated through dead code elimination or
       other optimizations, a warning that includes MESSAGE is diagnosed.
       This is useful for compile-time checking, especially together with
!      `__builtin_constant_p' and inline functions.  While it is possible
!      to define the function with a message in `.gnu.warning*' section,
!      when using this attribute the problem is diagnosed earlier and
!      with exact location of the call even in presence of inline
!      functions or when not emitting debugging information.
  
! `cdecl'
!      On the x86-32 targets, the `cdecl' attribute causes the compiler to
       assume that the calling function pops off the stack space used to
       pass arguments.  This is useful to override the effects of the
!      `-mrtd' switch.
  
! `const'
       Many functions do not examine any values except their arguments,
       and have no effects except the return value.  Basically this is
!      just slightly more strict class than the `pure' attribute below,
       since function is not allowed to read global memory.
  
       Note that a function that has pointer arguments and examines the
!      data pointed to must _not_ be declared `const'.  Likewise, a
!      function that calls a non-`const' function usually must not be
!      `const'.  It does not make sense for a `const' function to return
!      `void'.
  
! `constructor'
! `destructor'
! `constructor (PRIORITY)'
! `destructor (PRIORITY)'
!      The `constructor' attribute causes the function to be called
!      automatically before execution enters `main ()'.  Similarly, the
!      `destructor' attribute causes the function to be called
!      automatically after `main ()' completes or `exit ()' is called.
       Functions with these attributes are useful for initializing data
       that is used implicitly during the execution of the program.
  
--- 24857,24967 ----
       and a failure to inline an indirect call may or may not be
       diagnosed.
  
! 'gnu_inline'
       This attribute should be used with a function that is also declared
!      with the 'inline' keyword.  It directs GCC to treat the function as
!      if it were defined in gnu90 mode even when compiling in C99 or
       gnu99 mode.
  
!      If the function is declared 'extern', then this definition of the
       function is used only for inlining.  In no case is the function
       compiled as a standalone function, not even if you take its address
       explicitly.  Such an address becomes an external reference, as if
       you had only declared the function, and had not defined it.  This
       has almost the effect of a macro.  The way to use this is to put a
       function definition in a header file with this attribute, and put
!      another copy of the function, without 'extern', in a library file.
!      The definition in the header file causes most calls to the function
!      to be inlined.  If any uses of the function remain, they refer to
!      the single copy in the library.  Note that the two definitions of
!      the functions need not be precisely the same, although if they do
!      not have the same effect your program may behave oddly.
  
!      In C, if the function is neither 'extern' nor 'static', then the
       function is compiled as a standalone function, as well as being
       inlined where possible.
  
!      This is how GCC traditionally handled functions declared 'inline'.
!      Since ISO C99 specifies a different semantics for 'inline', this
       function attribute is provided as a transition measure and as a
       useful feature in its own right.  This attribute is available in
!      GCC 4.1.3 and later.  It is available if either of the preprocessor
!      macros '__GNUC_GNU_INLINE__' or '__GNUC_STDC_INLINE__' are defined.
!      *Note An Inline Function is As Fast As a Macro: Inline.
  
!      In C++, this attribute does not depend on 'extern' in any way, but
!      it still requires the 'inline' keyword to enable its special
       behavior.
  
! 'artificial'
       This attribute is useful for small inline wrappers that if possible
       should appear during debugging as a unit.  Depending on the debug
       info format it either means marking the function as artificial or
       using the caller location for all instructions within the inlined
       body.
  
! 'bank_switch'
       When added to an interrupt handler with the M32C port, causes the
       prologue and epilogue to use bank switching to preserve the
       registers rather than saving them on the stack.
  
! 'flatten'
       Generally, inlining into a function is limited.  For a function
       marked with this attribute, every call inside this function is
       inlined, if possible.  Whether the function itself is considered
       for inlining depends on its size and the current inlining
       parameters.
  
! 'error ("MESSAGE")'
       If this attribute is used on a function declaration and a call to
       such a function is not eliminated through dead code elimination or
       other optimizations, an error that includes MESSAGE is diagnosed.
       This is useful for compile-time checking, especially together with
!      '__builtin_constant_p' and inline functions where checking the
!      inline function arguments is not possible through 'extern char
!      [(condition) ? 1 : -1];' tricks.  While it is possible to leave the
!      function undefined and thus invoke a link failure, when using this
!      attribute the problem is diagnosed earlier and with exact location
!      of the call even in presence of inline functions or when not
!      emitting debugging information.
  
! 'warning ("MESSAGE")'
       If this attribute is used on a function declaration and a call to
       such a function is not eliminated through dead code elimination or
       other optimizations, a warning that includes MESSAGE is diagnosed.
       This is useful for compile-time checking, especially together with
!      '__builtin_constant_p' and inline functions.  While it is possible
!      to define the function with a message in '.gnu.warning*' section,
!      when using this attribute the problem is diagnosed earlier and with
!      exact location of the call even in presence of inline functions or
!      when not emitting debugging information.
  
! 'cdecl'
!      On the x86-32 targets, the 'cdecl' attribute causes the compiler to
       assume that the calling function pops off the stack space used to
       pass arguments.  This is useful to override the effects of the
!      '-mrtd' switch.
  
! 'const'
       Many functions do not examine any values except their arguments,
       and have no effects except the return value.  Basically this is
!      just slightly more strict class than the 'pure' attribute below,
       since function is not allowed to read global memory.
  
       Note that a function that has pointer arguments and examines the
!      data pointed to must _not_ be declared 'const'.  Likewise, a
!      function that calls a non-'const' function usually must not be
!      'const'.  It does not make sense for a 'const' function to return
!      'void'.
  
! 'constructor'
! 'destructor'
! 'constructor (PRIORITY)'
! 'destructor (PRIORITY)'
!      The 'constructor' attribute causes the function to be called
!      automatically before execution enters 'main ()'.  Similarly, the
!      'destructor' attribute causes the function to be called
!      automatically after 'main ()' completes or 'exit ()' is called.
       Functions with these attributes are useful for initializing data
       that is used implicitly during the execution of the program.
  
*************** attributes.
*** 25154,25162 ****
  
       These attributes are not currently implemented for Objective-C.
  
! `deprecated'
! `deprecated (MSG)'
!      The `deprecated' attribute results in a warning if the function is
       used anywhere in the source file.  This is useful when identifying
       functions that are expected to be removed in a future version of a
       program.  The warning also includes the location of the declaration
--- 24978,24986 ----
  
       These attributes are not currently implemented for Objective-C.
  
! 'deprecated'
! 'deprecated (MSG)'
!      The 'deprecated' attribute results in a warning if the function is
       used anywhere in the source file.  This is useful when identifying
       functions that are expected to be removed in a future version of a
       program.  The warning also includes the location of the declaration
*************** attributes.
*** 25172,25206 ****
       argument, which must be a string, is printed in the warning if
       present.
  
!      The `deprecated' attribute can also be used for variables and
!      types (*note Variable Attributes::, *note Type Attributes::.)
  
! `disinterrupt'
       On Epiphany and MeP targets, this attribute causes the compiler to
       emit instructions to disable interrupts for the duration of the
       given function.
  
! `dllexport'
!      On Microsoft Windows targets and Symbian OS targets the
!      `dllexport' attribute causes the compiler to provide a global
!      pointer to a pointer in a DLL, so that it can be referenced with
!      the `dllimport' attribute.  On Microsoft Windows targets, the
!      pointer name is formed by combining `_imp__' and the function or
!      variable name.
  
!      You can use `__declspec(dllexport)' as a synonym for
!      `__attribute__ ((dllexport))' for compatibility with other
!      compilers.
  
!      On systems that support the `visibility' attribute, this attribute
       also implies "default" visibility.  It is an error to explicitly
       specify any other visibility.
  
       GCC's default behavior is to emit all inline functions with the
!      `dllexport' attribute.  Since this can cause object file-size
!      bloat, you can use `-fno-keep-inline-dllexport', which tells GCC to
       ignore the attribute for inlined functions unless the
!      `-fkeep-inline-functions' flag is used instead.
  
       The attribute is ignored for undefined symbols.
  
--- 24996,25028 ----
       argument, which must be a string, is printed in the warning if
       present.
  
!      The 'deprecated' attribute can also be used for variables and types
!      (*note Variable Attributes::, *note Type Attributes::.)
  
! 'disinterrupt'
       On Epiphany and MeP targets, this attribute causes the compiler to
       emit instructions to disable interrupts for the duration of the
       given function.
  
! 'dllexport'
!      On Microsoft Windows targets and Symbian OS targets the 'dllexport'
!      attribute causes the compiler to provide a global pointer to a
!      pointer in a DLL, so that it can be referenced with the 'dllimport'
!      attribute.  On Microsoft Windows targets, the pointer name is
!      formed by combining '_imp__' and the function or variable name.
  
!      You can use '__declspec(dllexport)' as a synonym for '__attribute__
!      ((dllexport))' for compatibility with other compilers.
  
!      On systems that support the 'visibility' attribute, this attribute
       also implies "default" visibility.  It is an error to explicitly
       specify any other visibility.
  
       GCC's default behavior is to emit all inline functions with the
!      'dllexport' attribute.  Since this can cause object file-size
!      bloat, you can use '-fno-keep-inline-dllexport', which tells GCC to
       ignore the attribute for inlined functions unless the
!      '-fkeep-inline-functions' flag is used instead.
  
       The attribute is ignored for undefined symbols.
  
*************** attributes.
*** 25211,25327 ****
  
       For Microsoft Windows targets there are alternative methods for
       including the symbol in the DLL's export table such as using a
!      `.def' file with an `EXPORTS' section or, with GNU ld, using the
!      `--export-all' linker flag.
  
! `dllimport'
!      On Microsoft Windows and Symbian OS targets, the `dllimport'
       attribute causes the compiler to reference a function or variable
       via a global pointer to a pointer that is set up by the DLL
!      exporting the symbol.  The attribute implies `extern'.  On
       Microsoft Windows targets, the pointer name is formed by combining
!      `_imp__' and the function or variable name.
  
!      You can use `__declspec(dllimport)' as a synonym for
!      `__attribute__ ((dllimport))' for compatibility with other
!      compilers.
  
!      On systems that support the `visibility' attribute, this attribute
       also implies "default" visibility.  It is an error to explicitly
       specify any other visibility.
  
       Currently, the attribute is ignored for inlined functions.  If the
       attribute is applied to a symbol _definition_, an error is
!      reported.  If a symbol previously declared `dllimport' is later
       defined, the attribute is ignored in subsequent references, and a
       warning is emitted.  The attribute is also overridden by a
!      subsequent declaration as `dllexport'.
  
!      When applied to C++ classes, the attribute marks non-inlined
!      member functions and static data members as imports.  However, the
       attribute is ignored for virtual methods to allow creation of
       vtables using thunks.
  
!      On the SH Symbian OS target the `dllimport' attribute also has
       another affect--it can cause the vtable and run-time type
       information for a class to be exported.  This happens when the
       class has a dllimported constructor or a non-inline, non-pure
!      virtual function and, for either of those two conditions, the
!      class also has an inline constructor or destructor and has a key
!      function that is defined in the current translation unit.
  
!      For Microsoft Windows targets the use of the `dllimport' attribute
       on functions is not necessary, but provides a small performance
       benefit by eliminating a thunk in the DLL.  The use of the
!      `dllimport' attribute on imported variables can be avoided by
!      passing the `--enable-auto-import' switch to the GNU linker.  As
       with functions, using the attribute for a variable eliminates a
       thunk in the DLL.
  
       One drawback to using this attribute is that a pointer to a
!      _variable_ marked as `dllimport' cannot be used as a constant
!      address. However, a pointer to a _function_ with the `dllimport'
       attribute can be used as a constant initializer; in this case, the
       address of a stub function in the import lib is referenced.  On
       Microsoft Windows targets, the attribute can be disabled for
!      functions by setting the `-mnop-fun-dllimport' flag.
  
! `exception'
       Use this attribute on the NDS32 target to indicate that the
       specified function is an exception handler.  The compiler will
       generate corresponding sections for use in an exception handler.
  
! `exception_handler'
       Use this attribute on the Blackfin to indicate that the specified
       function is an exception handler.  The compiler generates function
       entry and exit sequences suitable for use in an exception handler
       when this attribute is present.
  
! `externally_visible'
       This attribute, attached to a global variable or function,
!      nullifies the effect of the `-fwhole-program' command-line option,
       so the object remains visible outside the current compilation unit.
  
!      If `-fwhole-program' is used together with `-flto' and `gold' is
!      used as the linker plugin, `externally_visible' attributes are
!      automatically added to functions (not variable yet due to a
!      current `gold' issue) that are accessed outside of LTO objects
!      according to resolution file produced by `gold'.  For other
!      linkers that cannot generate resolution file, explicit
!      `externally_visible' attributes are still necessary.
  
- `far'
       On MeP targets this causes the compiler to use a calling convention
       that assumes the called function is too far away for the built-in
       addressing modes.
  
! `fast_interrupt'
       Use this attribute on the M32C and RX ports to indicate that the
       specified function is a fast interrupt handler.  This is just like
!      the `interrupt' attribute, except that `freit' is used to return
!      instead of `reit'.
  
! `fastcall'
!      On x86-32 targets, the `fastcall' attribute causes the compiler to
       pass the first argument (if of integral type) in the register ECX
       and the second argument (if of integral type) in the register EDX.
       Subsequent and other typed arguments are passed on the stack.  The
!      called function pops the arguments off the stack.  If the number
!      of arguments is variable all arguments are pushed on the stack.
  
! `thiscall'
!      On x86-32 targets, the `thiscall' attribute causes the compiler to
       pass the first argument (if of integral type) in the register ECX.
!      Subsequent and other typed arguments are passed on the stack. The
!      called function pops the arguments off the stack.  If the number
!      of arguments is variable all arguments are pushed on the stack.
!      The `thiscall' attribute is intended for C++ non-static member
!      functions.  As a GCC extension, this calling convention can be
!      used for C functions and for static member methods.
  
! `format (ARCHETYPE, STRING-INDEX, FIRST-TO-CHECK)'
!      The `format' attribute specifies that a function takes `printf',
!      `scanf', `strftime' or `strfmon' style arguments that should be
       type-checked against a format string.  For example, the
       declaration:
  
--- 25033,25149 ----
  
       For Microsoft Windows targets there are alternative methods for
       including the symbol in the DLL's export table such as using a
!      '.def' file with an 'EXPORTS' section or, with GNU ld, using the
!      '--export-all' linker flag.
  
! 'dllimport'
!      On Microsoft Windows and Symbian OS targets, the 'dllimport'
       attribute causes the compiler to reference a function or variable
       via a global pointer to a pointer that is set up by the DLL
!      exporting the symbol.  The attribute implies 'extern'.  On
       Microsoft Windows targets, the pointer name is formed by combining
!      '_imp__' and the function or variable name.
  
!      You can use '__declspec(dllimport)' as a synonym for '__attribute__
!      ((dllimport))' for compatibility with other compilers.
  
!      On systems that support the 'visibility' attribute, this attribute
       also implies "default" visibility.  It is an error to explicitly
       specify any other visibility.
  
       Currently, the attribute is ignored for inlined functions.  If the
       attribute is applied to a symbol _definition_, an error is
!      reported.  If a symbol previously declared 'dllimport' is later
       defined, the attribute is ignored in subsequent references, and a
       warning is emitted.  The attribute is also overridden by a
!      subsequent declaration as 'dllexport'.
  
!      When applied to C++ classes, the attribute marks non-inlined member
!      functions and static data members as imports.  However, the
       attribute is ignored for virtual methods to allow creation of
       vtables using thunks.
  
!      On the SH Symbian OS target the 'dllimport' attribute also has
       another affect--it can cause the vtable and run-time type
       information for a class to be exported.  This happens when the
       class has a dllimported constructor or a non-inline, non-pure
!      virtual function and, for either of those two conditions, the class
!      also has an inline constructor or destructor and has a key function
!      that is defined in the current translation unit.
  
!      For Microsoft Windows targets the use of the 'dllimport' attribute
       on functions is not necessary, but provides a small performance
       benefit by eliminating a thunk in the DLL.  The use of the
!      'dllimport' attribute on imported variables can be avoided by
!      passing the '--enable-auto-import' switch to the GNU linker.  As
       with functions, using the attribute for a variable eliminates a
       thunk in the DLL.
  
       One drawback to using this attribute is that a pointer to a
!      _variable_ marked as 'dllimport' cannot be used as a constant
!      address.  However, a pointer to a _function_ with the 'dllimport'
       attribute can be used as a constant initializer; in this case, the
       address of a stub function in the import lib is referenced.  On
       Microsoft Windows targets, the attribute can be disabled for
!      functions by setting the '-mnop-fun-dllimport' flag.
  
! 'exception'
       Use this attribute on the NDS32 target to indicate that the
       specified function is an exception handler.  The compiler will
       generate corresponding sections for use in an exception handler.
  
! 'exception_handler'
       Use this attribute on the Blackfin to indicate that the specified
       function is an exception handler.  The compiler generates function
       entry and exit sequences suitable for use in an exception handler
       when this attribute is present.
  
! 'externally_visible'
       This attribute, attached to a global variable or function,
!      nullifies the effect of the '-fwhole-program' command-line option,
       so the object remains visible outside the current compilation unit.
  
!      If '-fwhole-program' is used together with '-flto' and 'gold' is
!      used as the linker plugin, 'externally_visible' attributes are
!      automatically added to functions (not variable yet due to a current
!      'gold' issue) that are accessed outside of LTO objects according to
!      resolution file produced by 'gold'.  For other linkers that cannot
!      generate resolution file, explicit 'externally_visible' attributes
!      are still necessary.
! 
! 'far'
  
       On MeP targets this causes the compiler to use a calling convention
       that assumes the called function is too far away for the built-in
       addressing modes.
  
! 'fast_interrupt'
       Use this attribute on the M32C and RX ports to indicate that the
       specified function is a fast interrupt handler.  This is just like
!      the 'interrupt' attribute, except that 'freit' is used to return
!      instead of 'reit'.
  
! 'fastcall'
!      On x86-32 targets, the 'fastcall' attribute causes the compiler to
       pass the first argument (if of integral type) in the register ECX
       and the second argument (if of integral type) in the register EDX.
       Subsequent and other typed arguments are passed on the stack.  The
!      called function pops the arguments off the stack.  If the number of
!      arguments is variable all arguments are pushed on the stack.
  
! 'thiscall'
!      On x86-32 targets, the 'thiscall' attribute causes the compiler to
       pass the first argument (if of integral type) in the register ECX.
!      Subsequent and other typed arguments are passed on the stack.  The
!      called function pops the arguments off the stack.  If the number of
!      arguments is variable all arguments are pushed on the stack.  The
!      'thiscall' attribute is intended for C++ non-static member
!      functions.  As a GCC extension, this calling convention can be used
!      for C functions and for static member methods.
  
! 'format (ARCHETYPE, STRING-INDEX, FIRST-TO-CHECK)'
!      The 'format' attribute specifies that a function takes 'printf',
!      'scanf', 'strftime' or 'strfmon' style arguments that should be
       type-checked against a format string.  For example, the
       declaration:
  
*************** attributes.
*** 25329,25457 ****
            my_printf (void *my_object, const char *my_format, ...)
                  __attribute__ ((format (printf, 2, 3)));
  
!      causes the compiler to check the arguments in calls to `my_printf'
!      for consistency with the `printf' style format string argument
!      `my_format'.
  
       The parameter ARCHETYPE determines how the format string is
!      interpreted, and should be `printf', `scanf', `strftime',
!      `gnu_printf', `gnu_scanf', `gnu_strftime' or `strfmon'.  (You can
!      also use `__printf__', `__scanf__', `__strftime__' or
!      `__strfmon__'.)  On MinGW targets, `ms_printf', `ms_scanf', and
!      `ms_strftime' are also present.  ARCHETYPE values such as `printf'
       refer to the formats accepted by the system's C runtime library,
!      while values prefixed with `gnu_' always refer to the formats
       accepted by the GNU C Library.  On Microsoft Windows targets,
!      values prefixed with `ms_' refer to the formats accepted by the
!      `msvcrt.dll' library.  The parameter STRING-INDEX specifies which
       argument is the format string argument (starting from 1), while
!      FIRST-TO-CHECK is the number of the first argument to check
!      against the format string.  For functions where the arguments are
!      not available to be checked (such as `vprintf'), specify the third
       parameter as zero.  In this case the compiler only checks the
!      format string for consistency.  For `strftime' formats, the third
       parameter is required to be zero.  Since non-static C++ methods
!      have an implicit `this' argument, the arguments of such methods
       should be counted from two, not one, when giving values for
       STRING-INDEX and FIRST-TO-CHECK.
  
!      In the example above, the format string (`my_format') is the second
!      argument of the function `my_print', and the arguments to check
       start with the third argument, so the correct parameters for the
       format attribute are 2 and 3.
  
!      The `format' attribute allows you to identify your own functions
       that take format strings as arguments, so that GCC can check the
       calls to these functions for errors.  The compiler always (unless
!      `-ffreestanding' or `-fno-builtin' is used) checks formats for the
!      standard library functions `printf', `fprintf', `sprintf',
!      `scanf', `fscanf', `sscanf', `strftime', `vprintf', `vfprintf' and
!      `vsprintf' whenever such warnings are requested (using
!      `-Wformat'), so there is no need to modify the header file
!      `stdio.h'.  In C99 mode, the functions `snprintf', `vsnprintf',
!      `vscanf', `vfscanf' and `vsscanf' are also checked.  Except in
!      strictly conforming C standard modes, the X/Open function
!      `strfmon' is also checked as are `printf_unlocked' and
!      `fprintf_unlocked'.  *Note Options Controlling C Dialect: C
!      Dialect Options.
  
!      For Objective-C dialects, `NSString' (or `__NSString__') is
       recognized in the same context.  Declarations including these
!      format attributes are parsed for correct syntax, however the
!      result of checking of such format strings is not yet defined, and
!      is not carried out by this version of the compiler.
  
       The target may also provide additional types of format checks.
       *Note Format Checks Specific to Particular Target Machines: Target
       Format Checks.
  
! `format_arg (STRING-INDEX)'
!      The `format_arg' attribute specifies that a function takes a format
!      string for a `printf', `scanf', `strftime' or `strfmon' style
!      function and modifies it (for example, to translate it into
!      another language), so the result can be passed to a `printf',
!      `scanf', `strftime' or `strfmon' style function (with the
!      remaining arguments to the format function the same as they would
!      have been for the unmodified string).  For example, the
!      declaration:
  
            extern char *
            my_dgettext (char *my_domain, const char *my_format)
                  __attribute__ ((format_arg (2)));
  
!      causes the compiler to check the arguments in calls to a `printf',
!      `scanf', `strftime' or `strfmon' type function, whose format
!      string argument is a call to the `my_dgettext' function, for
!      consistency with the format string argument `my_format'.  If the
!      `format_arg' attribute had not been specified, all the compiler
!      could tell in such calls to format functions would be that the
!      format string argument is not constant; this would generate a
!      warning when `-Wformat-nonliteral' is used, but the calls could
!      not be checked without the attribute.
  
       The parameter STRING-INDEX specifies which argument is the format
       string argument (starting from one).  Since non-static C++ methods
!      have an implicit `this' argument, the arguments of such methods
       should be counted from two.
  
!      The `format_arg' attribute allows you to identify your own
       functions that modify format strings, so that GCC can check the
!      calls to `printf', `scanf', `strftime' or `strfmon' type function
       whose operands are a call to one of your own function.  The
!      compiler always treats `gettext', `dgettext', and `dcgettext' in
       this manner except when strict ISO C support is requested by
!      `-ansi' or an appropriate `-std' option, or `-ffreestanding' or
!      `-fno-builtin' is used.  *Note Options Controlling C Dialect: C
       Dialect Options.
  
!      For Objective-C dialects, the `format-arg' attribute may refer to
!      an `NSString' reference for compatibility with the `format'
       attribute above.
  
!      The target may also allow additional types in `format-arg'
       attributes.  *Note Format Checks Specific to Particular Target
       Machines: Target Format Checks.
  
! `function_vector'
!      Use this attribute on the H8/300, H8/300H, and H8S to indicate
!      that the specified function should be called through the function
       vector.  Calling a function through the function vector reduces
!      code size, however; the function vector has a limited size
!      (maximum 128 entries on the H8/300 and 64 entries on the H8/300H
!      and H8S) and shares space with the interrupt vector.
  
       On SH2A targets, this attribute declares a function to be called
       using the TBR relative addressing mode.  The argument to this
       attribute is the entry number of the same function in a vector
       table containing all the TBR relative addressable functions.  For
!      correct operation the TBR must be setup accordingly to point to
!      the start of the vector table before any functions with this
!      attribute are invoked.  Usually a good place to do the
!      initialization is the startup routine.  The TBR relative vector
!      table can have at max 256 function entries.  The jumps to these
!      functions are generated using a SH2A specific, non delayed branch
!      instruction JSR/N @(disp8,TBR).  You must use GAS and GLD from GNU
!      binutils version 2.7 or later for this attribute to work correctly.
  
       Please refer the example of M16C target, to see the use of this
       attribute while declaring a function,
--- 25151,25277 ----
            my_printf (void *my_object, const char *my_format, ...)
                  __attribute__ ((format (printf, 2, 3)));
  
!      causes the compiler to check the arguments in calls to 'my_printf'
!      for consistency with the 'printf' style format string argument
!      'my_format'.
  
       The parameter ARCHETYPE determines how the format string is
!      interpreted, and should be 'printf', 'scanf', 'strftime',
!      'gnu_printf', 'gnu_scanf', 'gnu_strftime' or 'strfmon'.  (You can
!      also use '__printf__', '__scanf__', '__strftime__' or
!      '__strfmon__'.)  On MinGW targets, 'ms_printf', 'ms_scanf', and
!      'ms_strftime' are also present.  ARCHETYPE values such as 'printf'
       refer to the formats accepted by the system's C runtime library,
!      while values prefixed with 'gnu_' always refer to the formats
       accepted by the GNU C Library.  On Microsoft Windows targets,
!      values prefixed with 'ms_' refer to the formats accepted by the
!      'msvcrt.dll' library.  The parameter STRING-INDEX specifies which
       argument is the format string argument (starting from 1), while
!      FIRST-TO-CHECK is the number of the first argument to check against
!      the format string.  For functions where the arguments are not
!      available to be checked (such as 'vprintf'), specify the third
       parameter as zero.  In this case the compiler only checks the
!      format string for consistency.  For 'strftime' formats, the third
       parameter is required to be zero.  Since non-static C++ methods
!      have an implicit 'this' argument, the arguments of such methods
       should be counted from two, not one, when giving values for
       STRING-INDEX and FIRST-TO-CHECK.
  
!      In the example above, the format string ('my_format') is the second
!      argument of the function 'my_print', and the arguments to check
       start with the third argument, so the correct parameters for the
       format attribute are 2 and 3.
  
!      The 'format' attribute allows you to identify your own functions
       that take format strings as arguments, so that GCC can check the
       calls to these functions for errors.  The compiler always (unless
!      '-ffreestanding' or '-fno-builtin' is used) checks formats for the
!      standard library functions 'printf', 'fprintf', 'sprintf', 'scanf',
!      'fscanf', 'sscanf', 'strftime', 'vprintf', 'vfprintf' and
!      'vsprintf' whenever such warnings are requested (using '-Wformat'),
!      so there is no need to modify the header file 'stdio.h'.  In C99
!      mode, the functions 'snprintf', 'vsnprintf', 'vscanf', 'vfscanf'
!      and 'vsscanf' are also checked.  Except in strictly conforming C
!      standard modes, the X/Open function 'strfmon' is also checked as
!      are 'printf_unlocked' and 'fprintf_unlocked'.  *Note Options
!      Controlling C Dialect: C Dialect Options.
  
!      For Objective-C dialects, 'NSString' (or '__NSString__') is
       recognized in the same context.  Declarations including these
!      format attributes are parsed for correct syntax, however the result
!      of checking of such format strings is not yet defined, and is not
!      carried out by this version of the compiler.
  
       The target may also provide additional types of format checks.
       *Note Format Checks Specific to Particular Target Machines: Target
       Format Checks.
  
! 'format_arg (STRING-INDEX)'
!      The 'format_arg' attribute specifies that a function takes a format
!      string for a 'printf', 'scanf', 'strftime' or 'strfmon' style
!      function and modifies it (for example, to translate it into another
!      language), so the result can be passed to a 'printf', 'scanf',
!      'strftime' or 'strfmon' style function (with the remaining
!      arguments to the format function the same as they would have been
!      for the unmodified string).  For example, the declaration:
  
            extern char *
            my_dgettext (char *my_domain, const char *my_format)
                  __attribute__ ((format_arg (2)));
  
!      causes the compiler to check the arguments in calls to a 'printf',
!      'scanf', 'strftime' or 'strfmon' type function, whose format string
!      argument is a call to the 'my_dgettext' function, for consistency
!      with the format string argument 'my_format'.  If the 'format_arg'
!      attribute had not been specified, all the compiler could tell in
!      such calls to format functions would be that the format string
!      argument is not constant; this would generate a warning when
!      '-Wformat-nonliteral' is used, but the calls could not be checked
!      without the attribute.
  
       The parameter STRING-INDEX specifies which argument is the format
       string argument (starting from one).  Since non-static C++ methods
!      have an implicit 'this' argument, the arguments of such methods
       should be counted from two.
  
!      The 'format_arg' attribute allows you to identify your own
       functions that modify format strings, so that GCC can check the
!      calls to 'printf', 'scanf', 'strftime' or 'strfmon' type function
       whose operands are a call to one of your own function.  The
!      compiler always treats 'gettext', 'dgettext', and 'dcgettext' in
       this manner except when strict ISO C support is requested by
!      '-ansi' or an appropriate '-std' option, or '-ffreestanding' or
!      '-fno-builtin' is used.  *Note Options Controlling C Dialect: C
       Dialect Options.
  
!      For Objective-C dialects, the 'format-arg' attribute may refer to
!      an 'NSString' reference for compatibility with the 'format'
       attribute above.
  
!      The target may also allow additional types in 'format-arg'
       attributes.  *Note Format Checks Specific to Particular Target
       Machines: Target Format Checks.
  
! 'function_vector'
!      Use this attribute on the H8/300, H8/300H, and H8S to indicate that
!      the specified function should be called through the function
       vector.  Calling a function through the function vector reduces
!      code size, however; the function vector has a limited size (maximum
!      128 entries on the H8/300 and 64 entries on the H8/300H and H8S)
!      and shares space with the interrupt vector.
  
       On SH2A targets, this attribute declares a function to be called
       using the TBR relative addressing mode.  The argument to this
       attribute is the entry number of the same function in a vector
       table containing all the TBR relative addressable functions.  For
!      correct operation the TBR must be setup accordingly to point to the
!      start of the vector table before any functions with this attribute
!      are invoked.  Usually a good place to do the initialization is the
!      startup routine.  The TBR relative vector table can have at max 256
!      function entries.  The jumps to these functions are generated using
!      a SH2A specific, non delayed branch instruction JSR/N @(disp8,TBR).
!      You must use GAS and GLD from GNU binutils version 2.7 or later for
!      this attribute to work correctly.
  
       Please refer the example of M16C target, to see the use of this
       attribute while declaring a function,
*************** attributes.
*** 25461,25473 ****
       being made to the same function, it saves 2 bytes of code per each
       of these calls.
  
!      On M16C/M32C targets, the `function_vector' attribute declares a
!      special page subroutine call function. Use of this attribute
       reduces the code size by 2 bytes for each call generated to the
!      subroutine. The argument to the attribute is the vector number
       entry from the special page vector table which contains the 16
!      low-order bits of the subroutine's entry address. Each vector
!      table has special page number (18 to 255) that is used in `jsrs'
       instructions.  Jump addresses of the routines are generated by
       adding 0x0F0000 (in case of M16C targets) or 0xFF0000 (in case of
       M32C targets), to the 2-byte addresses set in the vector table.
--- 25281,25293 ----
       being made to the same function, it saves 2 bytes of code per each
       of these calls.
  
!      On M16C/M32C targets, the 'function_vector' attribute declares a
!      special page subroutine call function.  Use of this attribute
       reduces the code size by 2 bytes for each call generated to the
!      subroutine.  The argument to the attribute is the vector number
       entry from the special page vector table which contains the 16
!      low-order bits of the subroutine's entry address.  Each vector
!      table has special page number (18 to 255) that is used in 'jsrs'
       instructions.  Jump addresses of the routines are generated by
       adding 0x0F0000 (in case of M16C targets) or 0xFF0000 (in case of
       M32C targets), to the 2-byte addresses set in the vector table.
*************** attributes.
*** 25476,25482 ****
       0x0FFFFF (for M16C) and 0xFF0000 to 0xFFFFFF (for M32C).
  
       In the following example 2 bytes are saved for each call to
!      function `foo'.
  
            void foo (void) __attribute__((function_vector(0x18)));
            void foo (void)
--- 25296,25302 ----
       0x0FFFFF (for M16C) and 0xFF0000 to 0xFFFFFF (for M32C).
  
       In the following example 2 bytes are saved for each call to
!      function 'foo'.
  
            void foo (void) __attribute__((function_vector(0x18)));
            void foo (void)
*************** attributes.
*** 25493,25511 ****
  
       This attribute is ignored for R8C target.
  
! `ifunc ("RESOLVER")'
!      The `ifunc' attribute is used to mark a function as an indirect
       function using the STT_GNU_IFUNC symbol type extension to the ELF
       standard.  This allows the resolution of the symbol value to be
       determined dynamically at load time, and an optimized version of
       the routine can be selected for the particular processor or other
       system characteristics determined then.  To use this attribute,
!      first define the implementation functions available, and a
!      resolver function that returns a pointer to the selected
!      implementation function.  The implementation functions'
!      declarations must match the API of the function being implemented,
!      the resolver's declaration is be a function returning pointer to
!      void function returning void:
  
            void *my_memcpy (void *dst, const void *src, size_t len)
            {
--- 25313,25331 ----
  
       This attribute is ignored for R8C target.
  
! 'ifunc ("RESOLVER")'
!      The 'ifunc' attribute is used to mark a function as an indirect
       function using the STT_GNU_IFUNC symbol type extension to the ELF
       standard.  This allows the resolution of the symbol value to be
       determined dynamically at load time, and an optimized version of
       the routine can be selected for the particular processor or other
       system characteristics determined then.  To use this attribute,
!      first define the implementation functions available, and a resolver
!      function that returns a pointer to the selected implementation
!      function.  The implementation functions' declarations must match
!      the API of the function being implemented, the resolver's
!      declaration is be a function returning pointer to void function
!      returning void:
  
            void *my_memcpy (void *dst, const void *src, size_t len)
            {
*************** attributes.
*** 25533,25565 ****
       higher and GNU C Library version 2.11.1 are required to use this
       feature.
  
! `interrupt'
       Use this attribute on the ARC, ARM, AVR, CR16, Epiphany, M32C,
       M32R/D, m68k, MeP, MIPS, MSP430, NDS32, RL78, RX, Visium and
       Xstormy16 ports to indicate that the specified function is an
       interrupt handler.  The compiler generates function entry and exit
       sequences suitable for use in an interrupt handler when this
!      attribute is present.  With Epiphany targets it may also generate
!      a special section with code to initialize the interrupt vector
!      table.
  
       Note, interrupt handlers for the Blackfin, H8/300, H8/300H, H8S,
       MicroBlaze, and SH processors can be specified via the
!      `interrupt_handler' attribute.
  
       Note, on the ARC, you must specify the kind of interrupt to be
       handled in a parameter to the interrupt attribute like this:
  
            void f () __attribute__ ((interrupt ("ilink1")));
  
!      Permissible values for this parameter are: `ilink1' and `ilink2'.
  
       Note, on the AVR, the hardware globally disables interrupts when an
       interrupt is executed.  The first instruction of an interrupt
!      handler declared with this attribute is a `SEI' instruction to
!      re-enable interrupts.  See also the `signal' function attribute
!      that does not insert a `SEI' instruction.  If both `signal' and
!      `interrupt' are specified for the same function, `signal' is
       silently ignored.
  
       Note, for the ARM, you can specify the kind of interrupt to be
--- 25353,25384 ----
       higher and GNU C Library version 2.11.1 are required to use this
       feature.
  
! 'interrupt'
       Use this attribute on the ARC, ARM, AVR, CR16, Epiphany, M32C,
       M32R/D, m68k, MeP, MIPS, MSP430, NDS32, RL78, RX, Visium and
       Xstormy16 ports to indicate that the specified function is an
       interrupt handler.  The compiler generates function entry and exit
       sequences suitable for use in an interrupt handler when this
!      attribute is present.  With Epiphany targets it may also generate a
!      special section with code to initialize the interrupt vector table.
  
       Note, interrupt handlers for the Blackfin, H8/300, H8/300H, H8S,
       MicroBlaze, and SH processors can be specified via the
!      'interrupt_handler' attribute.
  
       Note, on the ARC, you must specify the kind of interrupt to be
       handled in a parameter to the interrupt attribute like this:
  
            void f () __attribute__ ((interrupt ("ilink1")));
  
!      Permissible values for this parameter are: 'ilink1' and 'ilink2'.
  
       Note, on the AVR, the hardware globally disables interrupts when an
       interrupt is executed.  The first instruction of an interrupt
!      handler declared with this attribute is a 'SEI' instruction to
!      re-enable interrupts.  See also the 'signal' function attribute
!      that does not insert a 'SEI' instruction.  If both 'signal' and
!      'interrupt' are specified for the same function, 'signal' is
       silently ignored.
  
       Note, for the ARM, you can specify the kind of interrupt to be
*************** attributes.
*** 25568,25633 ****
  
            void f () __attribute__ ((interrupt ("IRQ")));
  
!      Permissible values for this parameter are: `IRQ', `FIQ', `SWI',
!      `ABORT' and `UNDEF'.
  
       On ARMv7-M the interrupt type is ignored, and the attribute means
       the function may be called with a word-aligned stack pointer.
  
       Note, for the MSP430 you can provide an argument to the interrupt
       attribute which specifies a name or number.  If the argument is a
!      number it indicates the slot in the interrupt vector table (0 -
!      31) to which this handler should be assigned.  If the argument is
!      a name it is treated as a symbolic name for the vector slot.
!      These names should match up with appropriate entries in the linker
!      script.  By default the names `watchdog' for vector 26, `nmi' for
!      vector 30 and `reset' for vector 31 are recognized.
  
       You can also use the following function attributes to modify how
       normal functions interact with interrupt functions:
  
!     `critical'
            Critical functions disable interrupts upon entry and restore
            the previous interrupt state upon exit.  Critical functions
!           cannot also have the `naked' or `reentrant' attributes.  They
!           can have the `interrupt' attribute.
  
!     `reentrant'
            Reentrant functions disable interrupts upon entry and enable
            them upon exit.  Reentrant functions cannot also have the
!           `naked' or `critical' attributes.  They can have the
!           `interrupt' attribute.
  
!     `wakeup'
            This attribute only applies to interrupt functions.  It is
            silently ignored if applied to a non-interrupt function.  A
            wakeup interrupt function will rouse the processor from any
            low-power state that it might be in when the function exits.
  
- 
       On Epiphany targets one or more optional parameters can be added
       like this:
  
            void __attribute__ ((interrupt ("dma0, dma1"))) universal_dma_handler ();
  
!      Permissible values for these parameters are: `reset',
!      `software_exception', `page_miss', `timer0', `timer1', `message',
!      `dma0', `dma1', `wand' and `swi'.  Multiple parameters indicate
       that multiple entries in the interrupt vector table should be
!      initialized for this function, i.e. for each parameter NAME, a
!      jump to the function is emitted in the section ivt_entry_NAME.
!      The parameter(s) may be omitted entirely, in which case no
!      interrupt vector table entry is provided.
  
       Note, on Epiphany targets, interrupts are enabled inside the
!      function unless the `disinterrupt' attribute is also specified.
  
       On Epiphany targets, you can also use the following attribute to
       modify the behavior of an interrupt handler:
!     `forwarder_section'
            The interrupt handler may be in external memory which cannot
!           be reached by a branch instruction, so generate a local
!           memory trampoline to transfer control.  The single parameter
            identifies the section where the trampoline is placed.
  
       The following examples are all valid uses of these attributes on
--- 25387,25451 ----
  
            void f () __attribute__ ((interrupt ("IRQ")));
  
!      Permissible values for this parameter are: 'IRQ', 'FIQ', 'SWI',
!      'ABORT' and 'UNDEF'.
  
       On ARMv7-M the interrupt type is ignored, and the attribute means
       the function may be called with a word-aligned stack pointer.
  
       Note, for the MSP430 you can provide an argument to the interrupt
       attribute which specifies a name or number.  If the argument is a
!      number it indicates the slot in the interrupt vector table (0 - 31)
!      to which this handler should be assigned.  If the argument is a
!      name it is treated as a symbolic name for the vector slot.  These
!      names should match up with appropriate entries in the linker
!      script.  By default the names 'watchdog' for vector 26, 'nmi' for
!      vector 30 and 'reset' for vector 31 are recognized.
  
       You can also use the following function attributes to modify how
       normal functions interact with interrupt functions:
  
!      'critical'
            Critical functions disable interrupts upon entry and restore
            the previous interrupt state upon exit.  Critical functions
!           cannot also have the 'naked' or 'reentrant' attributes.  They
!           can have the 'interrupt' attribute.
  
!      'reentrant'
            Reentrant functions disable interrupts upon entry and enable
            them upon exit.  Reentrant functions cannot also have the
!           'naked' or 'critical' attributes.  They can have the
!           'interrupt' attribute.
  
!      'wakeup'
            This attribute only applies to interrupt functions.  It is
            silently ignored if applied to a non-interrupt function.  A
            wakeup interrupt function will rouse the processor from any
            low-power state that it might be in when the function exits.
  
       On Epiphany targets one or more optional parameters can be added
       like this:
  
            void __attribute__ ((interrupt ("dma0, dma1"))) universal_dma_handler ();
  
!      Permissible values for these parameters are: 'reset',
!      'software_exception', 'page_miss', 'timer0', 'timer1', 'message',
!      'dma0', 'dma1', 'wand' and 'swi'.  Multiple parameters indicate
       that multiple entries in the interrupt vector table should be
!      initialized for this function, i.e. for each parameter NAME, a jump
!      to the function is emitted in the section ivt_entry_NAME.  The
!      parameter(s) may be omitted entirely, in which case no interrupt
!      vector table entry is provided.
  
       Note, on Epiphany targets, interrupts are enabled inside the
!      function unless the 'disinterrupt' attribute is also specified.
  
       On Epiphany targets, you can also use the following attribute to
       modify the behavior of an interrupt handler:
!      'forwarder_section'
            The interrupt handler may be in external memory which cannot
!           be reached by a branch instruction, so generate a local memory
!           trampoline to transfer control.  The single parameter
            identifies the section where the trampoline is placed.
  
       The following examples are all valid uses of these attributes on
*************** attributes.
*** 25640,25659 ****
            void __attribute__ ((interrupt ("dma0, dma1"), forwarder_section ("tramp")))
              external_dma_handler ();
  
!      On MIPS targets, you can use the following attributes to modify
!      the behavior of an interrupt handler:
!     `use_shadow_register_set'
            Assume that the handler uses a shadow register set, instead of
            the main general-purpose registers.
  
!     `keep_interrupts_masked'
            Keep interrupts masked for the whole function.  Without this
!           attribute, GCC tries to reenable interrupts for as much of
!           the function as it can.
  
!     `use_debug_exception_return'
!           Return using the `deret' instruction.  Interrupt handlers
!           that don't have this attribute return using `eret' instead.
  
       You can use any combination of these attributes, as shown below:
            void __attribute__ ((interrupt)) v0 ();
--- 25458,25477 ----
            void __attribute__ ((interrupt ("dma0, dma1"), forwarder_section ("tramp")))
              external_dma_handler ();
  
!      On MIPS targets, you can use the following attributes to modify the
!      behavior of an interrupt handler:
!      'use_shadow_register_set'
            Assume that the handler uses a shadow register set, instead of
            the main general-purpose registers.
  
!      'keep_interrupts_masked'
            Keep interrupts masked for the whole function.  Without this
!           attribute, GCC tries to reenable interrupts for as much of the
!           function as it can.
  
!      'use_debug_exception_return'
!           Return using the 'deret' instruction.  Interrupt handlers that
!           don't have this attribute return using 'eret' instead.
  
       You can use any combination of these attributes, as shown below:
            void __attribute__ ((interrupt)) v0 ();
*************** attributes.
*** 25674,25709 ****
       function is an interrupt handler.  The compiler generates
       corresponding sections for use in an interrupt handler.  You can
       use the following attributes to modify the behavior:
!     `nested'
            This interrupt service routine is interruptible.
! 
!     `not_nested'
            This interrupt service routine is not interruptible.
! 
!     `nested_ready'
            This interrupt service routine is interruptible after
!           `PSW.GIE' (global interrupt enable) is set.  This allows
            interrupt service routine to finish some short critical code
            before enabling interrupts.
! 
!     `save_all'
            The system will help save all registers into stack before
            entering interrupt handler.
! 
!     `partial_save'
            The system will help save caller registers into stack before
            entering interrupt handler.
  
!      On RL78, use `brk_interrupt' instead of `interrupt' for handlers
!      intended to be used with the `BRK' opcode (i.e. those that must
!      end with `RETB' instead of `RETI').
  
       On RX targets, you may specify one or more vector numbers as
       arguments to the attribute, as well as naming an alternate table
       name.  Parameters are handled sequentially, so one handler can be
!      assigned to multiple entries in multiple tables.  One may also
!      pass the magic string `"$default"' which causes the function to be
!      used for any unfilled slots in the current table.
  
       This example shows a simple assignment of a function to one vector
       in the default table (note that preprocessor macros may be used for
--- 25492,25523 ----
       function is an interrupt handler.  The compiler generates
       corresponding sections for use in an interrupt handler.  You can
       use the following attributes to modify the behavior:
!      'nested'
            This interrupt service routine is interruptible.
!      'not_nested'
            This interrupt service routine is not interruptible.
!      'nested_ready'
            This interrupt service routine is interruptible after
!           'PSW.GIE' (global interrupt enable) is set.  This allows
            interrupt service routine to finish some short critical code
            before enabling interrupts.
!      'save_all'
            The system will help save all registers into stack before
            entering interrupt handler.
!      'partial_save'
            The system will help save caller registers into stack before
            entering interrupt handler.
  
!      On RL78, use 'brk_interrupt' instead of 'interrupt' for handlers
!      intended to be used with the 'BRK' opcode (i.e. those that must end
!      with 'RETB' instead of 'RETI').
  
       On RX targets, you may specify one or more vector numbers as
       arguments to the attribute, as well as naming an alternate table
       name.  Parameters are handled sequentially, so one handler can be
!      assigned to multiple entries in multiple tables.  One may also pass
!      the magic string '"$default"' which causes the function to be used
!      for any unfilled slots in the current table.
  
       This example shows a simple assignment of a function to one vector
       in the default table (note that preprocessor macros may be used for
*************** attributes.
*** 25712,25912 ****
  
       This example assigns a function to two slots in the default table
       (using preprocessor macros defined elsewhere) and makes it the
!      default for the `dct' table:
            void __attribute__ ((interrupt (RXD1_VECT,RXD2_VECT,"dct","$default")))
            	txd1_handler ();
  
! `interrupt_handler'
!      Use this attribute on the Blackfin, m68k, H8/300, H8/300H, H8S,
!      and SH to indicate that the specified function is an interrupt
!      handler.  The compiler generates function entry and exit sequences
!      suitable for use in an interrupt handler when this attribute is
!      present.
  
! `interrupt_thread'
       Use this attribute on fido, a subarchitecture of the m68k, to
       indicate that the specified function is an interrupt handler that
       is designed to run as a thread.  The compiler omits generate
       prologue/epilogue sequences and replaces the return instruction
!      with a `sleep' instruction.  This attribute is available only on
       fido.
  
! `isr'
       Use this attribute on ARM to write Interrupt Service Routines.
!      This is an alias to the `interrupt' attribute above.
  
! `kspisusp'
!      When used together with `interrupt_handler', `exception_handler'
!      or `nmi_handler', code is generated to load the stack pointer from
!      the USP register in the function prologue.
  
! `l1_text'
       This attribute specifies a function to be placed into L1
!      Instruction SRAM. The function is put into a specific section
!      named `.l1.text'.  With `-mfdpic', function calls with a such
       function as the callee or caller uses inlined PLT.
  
! `l2'
       On the Blackfin, this attribute specifies a function to be placed
       into L2 SRAM. The function is put into a specific section named
!      `.l1.text'. With `-mfdpic', callers of such functions use an
       inlined PLT.
  
! `leaf'
       Calls to external functions with this attribute must return to the
       current compilation unit only by return or by exception handling.
       In particular, leaf functions are not allowed to call callback
!      function passed to it from the current compilation unit or
!      directly call functions exported by the unit or longjmp into the
!      unit.  Leaf function might still call functions from other
!      compilation units and thus they are not necessarily leaf in the
!      sense that they contain no function calls at all.
  
!      The attribute is intended for library functions to improve
!      dataflow analysis.  The compiler takes the hint that any data not
!      escaping the current compilation unit can not be used or modified
!      by the leaf function.  For example, the `sin' function is a leaf
!      function, but `qsort' is not.
  
       Note that leaf functions might invoke signals and signal handlers
       might be defined in the current compilation unit and use static
       variables.  The only compliant way to write such a signal handler
!      is to declare such variables `volatile'.
  
!      The attribute has no effect on functions defined within the
!      current compilation unit.  This is to allow easy merging of
!      multiple compilation units into one, for example, by using the
!      link-time optimization.  For this reason the attribute is not
!      allowed on types to annotate indirect calls.
  
! `long_call'
! `medium_call'
! `short_call'
       These attributes specify how a particular function is called on
!      ARC, ARM and Epiphany - with `medium_call' being specific to ARC.
!      These attributes override the `-mlong-calls' (*note ARM Options::
!      and *note ARC Options::) and `-mmedium-calls' (*note ARC Options::)
!      command-line switches and `#pragma long_calls' settings.  For ARM,
!      the `long_call' attribute indicates that the function might be far
       away from the call site and require a different (more expensive)
!      calling sequence.   The `short_call' attribute always places the
!      offset to the function from the call site into the `BL'
!      instruction directly.
  
!      For ARC, a function marked with the `long_call' attribute is
!      always called using register-indirect jump-and-link instructions,
!      thereby enabling the called function to be placed anywhere within
!      the 32-bit address space.  A function marked with the `medium_call'
       attribute will always be close enough to be called with an
       unconditional branch-and-link instruction, which has a 25-bit
!      offset from the call site.  A function marked with the `short_call'
       attribute will always be close enough to be called with a
       conditional branch-and-link instruction, which has a 21-bit offset
       from the call site.
  
! `longcall'
! `shortcall'
!      On Blackfin and PowerPC, the `longcall' attribute indicates that
       the function might be far away from the call site and require a
!      different (more expensive) calling sequence.  The `shortcall'
       attribute indicates that the function is always close enough for
!      the shorter calling sequence to be used.  These attributes
!      override both the `-mlongcall' switch and, on the RS/6000 and
!      PowerPC, the `#pragma longcall' setting.
  
       *Note RS/6000 and PowerPC Options::, for more information on
       whether long calls are necessary.
  
! `long_call'
! `near'
! `far'
       These attributes specify how a particular function is called on
!      MIPS.  The attributes override the `-mlong-calls' (*note MIPS
!      Options::) command-line switch.  The `long_call' and `far'
       attributes are synonyms, and cause the compiler to always call the
       function by first loading its address into a register, and then
!      using the contents of that register.  The `near' attribute has the
       opposite effect; it specifies that non-PIC calls should be made
!      using the more efficient `jal' instruction.
  
! `malloc'
!      This tells the compiler that a function is `malloc'-like, i.e.,
       that the pointer P returned by the function cannot alias any other
       pointer valid when the function returns, and moreover no pointers
       to valid objects occur in any storage addressed by P.
  
       Using this attribute can improve optimization.  Functions like
!      `malloc' and `calloc' have this property because they return a
       pointer to uninitialized or zeroed-out storage.  However, functions
!      like `realloc' do not have this property, as they can return a
       pointer to storage containing pointers.
  
! `mips16'
! `nomips16'
!      On MIPS targets, you can use the `mips16' and `nomips16' function
!      attributes to locally select or turn off MIPS16 code generation.
!      A function with the `mips16' attribute is emitted as MIPS16 code,
       while MIPS16 code generation is disabled for functions with the
!      `nomips16' attribute.  These attributes override the `-mips16' and
!      `-mno-mips16' options on the command line (*note MIPS Options::).
  
       When compiling files containing mixed MIPS16 and non-MIPS16 code,
!      the preprocessor symbol `__mips16' reflects the setting on the
       command line, not that within individual functions.  Mixed MIPS16
       and non-MIPS16 code may interact badly with some GCC extensions
!      such as `__builtin_apply' (*note Constructing Calls::).
  
! `micromips, MIPS'
! `nomicromips, MIPS'
!      On MIPS targets, you can use the `micromips' and `nomicromips'
       function attributes to locally select or turn off microMIPS code
!      generation.  A function with the `micromips' attribute is emitted
       as microMIPS code, while microMIPS code generation is disabled for
!      functions with the `nomicromips' attribute.  These attributes
!      override the `-mmicromips' and `-mno-micromips' options on the
       command line (*note MIPS Options::).
  
       When compiling files containing mixed microMIPS and non-microMIPS
!      code, the preprocessor symbol `__mips_micromips' reflects the
       setting on the command line, not that within individual functions.
!      Mixed microMIPS and non-microMIPS code may interact badly with
!      some GCC extensions such as `__builtin_apply' (*note Constructing
       Calls::).
  
! `model (MODEL-NAME)'
       On the M32R/D, use this attribute to set the addressability of an
       object, and of the code generated for a function.  The identifier
!      MODEL-NAME is one of `small', `medium', or `large', representing
       each of the code models.
  
       Small model objects live in the lower 16MB of memory (so that their
!      addresses can be loaded with the `ld24' instruction), and are
!      callable with the `bl' instruction.
  
       Medium model objects may live anywhere in the 32-bit address space
!      (the compiler generates `seth/add3' instructions to load their
!      addresses), and are callable with the `bl' instruction.
  
       Large model objects may live anywhere in the 32-bit address space
!      (the compiler generates `seth/add3' instructions to load their
!      addresses), and may not be reachable with the `bl' instruction
!      (the compiler generates the much slower `seth/add3/jl' instruction
       sequence).
  
! `ms_abi'
! `sysv_abi'
       On 32-bit and 64-bit x86 targets, you can use an ABI attribute to
       indicate which calling convention should be used for a function.
!      The `ms_abi' attribute tells the compiler to use the Microsoft ABI,
!      while the `sysv_abi' attribute tells the compiler to use the ABI
       used on GNU/Linux and other systems.  The default is to use the
       Microsoft ABI when targeting Windows.  On all other systems, the
       default is the x86/AMD ABI.
  
!      Note, the `ms_abi' attribute for Microsoft Windows 64-bit targets
!      currently requires the `-maccumulate-outgoing-args' option.
  
- `callee_pop_aggregate_return (NUMBER)'
       On x86-32 targets, you can use this attribute to control how
       aggregates are returned in memory.  If the caller is responsible
       for popping the hidden pointer together with the rest of the
--- 25526,25730 ----
  
       This example assigns a function to two slots in the default table
       (using preprocessor macros defined elsewhere) and makes it the
!      default for the 'dct' table:
            void __attribute__ ((interrupt (RXD1_VECT,RXD2_VECT,"dct","$default")))
            	txd1_handler ();
  
! 'interrupt_handler'
!      Use this attribute on the Blackfin, m68k, H8/300, H8/300H, H8S, and
!      SH to indicate that the specified function is an interrupt handler.
!      The compiler generates function entry and exit sequences suitable
!      for use in an interrupt handler when this attribute is present.
  
! 'interrupt_thread'
       Use this attribute on fido, a subarchitecture of the m68k, to
       indicate that the specified function is an interrupt handler that
       is designed to run as a thread.  The compiler omits generate
       prologue/epilogue sequences and replaces the return instruction
!      with a 'sleep' instruction.  This attribute is available only on
       fido.
  
! 'isr'
       Use this attribute on ARM to write Interrupt Service Routines.
!      This is an alias to the 'interrupt' attribute above.
  
! 'kspisusp'
!      When used together with 'interrupt_handler', 'exception_handler' or
!      'nmi_handler', code is generated to load the stack pointer from the
!      USP register in the function prologue.
  
! 'l1_text'
       This attribute specifies a function to be placed into L1
!      Instruction SRAM.  The function is put into a specific section
!      named '.l1.text'.  With '-mfdpic', function calls with a such
       function as the callee or caller uses inlined PLT.
  
! 'l2'
       On the Blackfin, this attribute specifies a function to be placed
       into L2 SRAM. The function is put into a specific section named
!      '.l1.text'.  With '-mfdpic', callers of such functions use an
       inlined PLT.
  
! 'leaf'
       Calls to external functions with this attribute must return to the
       current compilation unit only by return or by exception handling.
       In particular, leaf functions are not allowed to call callback
!      function passed to it from the current compilation unit or directly
!      call functions exported by the unit or longjmp into the unit.  Leaf
!      function might still call functions from other compilation units
!      and thus they are not necessarily leaf in the sense that they
!      contain no function calls at all.
  
!      The attribute is intended for library functions to improve dataflow
!      analysis.  The compiler takes the hint that any data not escaping
!      the current compilation unit can not be used or modified by the
!      leaf function.  For example, the 'sin' function is a leaf function,
!      but 'qsort' is not.
  
       Note that leaf functions might invoke signals and signal handlers
       might be defined in the current compilation unit and use static
       variables.  The only compliant way to write such a signal handler
!      is to declare such variables 'volatile'.
  
!      The attribute has no effect on functions defined within the current
!      compilation unit.  This is to allow easy merging of multiple
!      compilation units into one, for example, by using the link-time
!      optimization.  For this reason the attribute is not allowed on
!      types to annotate indirect calls.
  
! 'long_call'
! 'medium_call'
! 'short_call'
       These attributes specify how a particular function is called on
!      ARC, ARM and Epiphany - with 'medium_call' being specific to ARC.
!      These attributes override the '-mlong-calls' (*note ARM Options::
!      and *note ARC Options::) and '-mmedium-calls' (*note ARC Options::)
!      command-line switches and '#pragma long_calls' settings.  For ARM,
!      the 'long_call' attribute indicates that the function might be far
       away from the call site and require a different (more expensive)
!      calling sequence.  The 'short_call' attribute always places the
!      offset to the function from the call site into the 'BL' instruction
!      directly.
  
!      For ARC, a function marked with the 'long_call' attribute is always
!      called using register-indirect jump-and-link instructions, thereby
!      enabling the called function to be placed anywhere within the
!      32-bit address space.  A function marked with the 'medium_call'
       attribute will always be close enough to be called with an
       unconditional branch-and-link instruction, which has a 25-bit
!      offset from the call site.  A function marked with the 'short_call'
       attribute will always be close enough to be called with a
       conditional branch-and-link instruction, which has a 21-bit offset
       from the call site.
  
! 'longcall'
! 'shortcall'
!      On Blackfin and PowerPC, the 'longcall' attribute indicates that
       the function might be far away from the call site and require a
!      different (more expensive) calling sequence.  The 'shortcall'
       attribute indicates that the function is always close enough for
!      the shorter calling sequence to be used.  These attributes override
!      both the '-mlongcall' switch and, on the RS/6000 and PowerPC, the
!      '#pragma longcall' setting.
  
       *Note RS/6000 and PowerPC Options::, for more information on
       whether long calls are necessary.
  
! 'long_call'
! 'near'
! 'far'
       These attributes specify how a particular function is called on
!      MIPS.  The attributes override the '-mlong-calls' (*note MIPS
!      Options::) command-line switch.  The 'long_call' and 'far'
       attributes are synonyms, and cause the compiler to always call the
       function by first loading its address into a register, and then
!      using the contents of that register.  The 'near' attribute has the
       opposite effect; it specifies that non-PIC calls should be made
!      using the more efficient 'jal' instruction.
  
! 'malloc'
!      This tells the compiler that a function is 'malloc'-like, i.e.,
       that the pointer P returned by the function cannot alias any other
       pointer valid when the function returns, and moreover no pointers
       to valid objects occur in any storage addressed by P.
  
       Using this attribute can improve optimization.  Functions like
!      'malloc' and 'calloc' have this property because they return a
       pointer to uninitialized or zeroed-out storage.  However, functions
!      like 'realloc' do not have this property, as they can return a
       pointer to storage containing pointers.
  
! 'mips16'
! 'nomips16'
! 
!      On MIPS targets, you can use the 'mips16' and 'nomips16' function
!      attributes to locally select or turn off MIPS16 code generation.  A
!      function with the 'mips16' attribute is emitted as MIPS16 code,
       while MIPS16 code generation is disabled for functions with the
!      'nomips16' attribute.  These attributes override the '-mips16' and
!      '-mno-mips16' options on the command line (*note MIPS Options::).
  
       When compiling files containing mixed MIPS16 and non-MIPS16 code,
!      the preprocessor symbol '__mips16' reflects the setting on the
       command line, not that within individual functions.  Mixed MIPS16
       and non-MIPS16 code may interact badly with some GCC extensions
!      such as '__builtin_apply' (*note Constructing Calls::).
  
! 'micromips, MIPS'
! 'nomicromips, MIPS'
! 
!      On MIPS targets, you can use the 'micromips' and 'nomicromips'
       function attributes to locally select or turn off microMIPS code
!      generation.  A function with the 'micromips' attribute is emitted
       as microMIPS code, while microMIPS code generation is disabled for
!      functions with the 'nomicromips' attribute.  These attributes
!      override the '-mmicromips' and '-mno-micromips' options on the
       command line (*note MIPS Options::).
  
       When compiling files containing mixed microMIPS and non-microMIPS
!      code, the preprocessor symbol '__mips_micromips' reflects the
       setting on the command line, not that within individual functions.
!      Mixed microMIPS and non-microMIPS code may interact badly with some
!      GCC extensions such as '__builtin_apply' (*note Constructing
       Calls::).
  
! 'model (MODEL-NAME)'
! 
       On the M32R/D, use this attribute to set the addressability of an
       object, and of the code generated for a function.  The identifier
!      MODEL-NAME is one of 'small', 'medium', or 'large', representing
       each of the code models.
  
       Small model objects live in the lower 16MB of memory (so that their
!      addresses can be loaded with the 'ld24' instruction), and are
!      callable with the 'bl' instruction.
  
       Medium model objects may live anywhere in the 32-bit address space
!      (the compiler generates 'seth/add3' instructions to load their
!      addresses), and are callable with the 'bl' instruction.
  
       Large model objects may live anywhere in the 32-bit address space
!      (the compiler generates 'seth/add3' instructions to load their
!      addresses), and may not be reachable with the 'bl' instruction (the
!      compiler generates the much slower 'seth/add3/jl' instruction
       sequence).
  
! 'ms_abi'
! 'sysv_abi'
! 
       On 32-bit and 64-bit x86 targets, you can use an ABI attribute to
       indicate which calling convention should be used for a function.
!      The 'ms_abi' attribute tells the compiler to use the Microsoft ABI,
!      while the 'sysv_abi' attribute tells the compiler to use the ABI
       used on GNU/Linux and other systems.  The default is to use the
       Microsoft ABI when targeting Windows.  On all other systems, the
       default is the x86/AMD ABI.
  
!      Note, the 'ms_abi' attribute for Microsoft Windows 64-bit targets
!      currently requires the '-maccumulate-outgoing-args' option.
! 
! 'callee_pop_aggregate_return (NUMBER)'
  
       On x86-32 targets, you can use this attribute to control how
       aggregates are returned in memory.  If the caller is responsible
       for popping the hidden pointer together with the rest of the
*************** attributes.
*** 25917,25990 ****
       hidden pointer.  However, on x86-32 Microsoft Windows targets, the
       compiler assumes that the caller pops the stack for hidden pointer.
  
! `ms_hook_prologue'
       On 32-bit and 64-bit x86 targets, you can use this function
!      attribute to make GCC generate the "hot-patching" function
!      prologue used in Win32 API functions in Microsoft Windows XP
!      Service Pack 2 and newer.
  
- `hotpatch (HALFWORDS-BEFORE-FUNCTION-LABEL,HALFWORDS-AFTER-FUNCTION-LABEL)'
       On S/390 System z targets, you can use this function attribute to
       make GCC generate a "hot-patching" function prologue.  If the
!      `-mhotpatch=' command-line option is used at the same time, the
!      `hotpatch' attribute takes precedence.  The first of the two
       arguments specifies the number of halfwords to be added before the
       function label.  A second argument can be used to specify the
!      number of halfwords to be added after the function label.  For
!      both arguments the maximum allowed value is 1000000.
  
       If both arguments are zero, hotpatching is disabled.
  
! `naked'
       This attribute is available on the ARM, AVR, MCORE, MSP430, NDS32,
       RL78, RX and SPU ports.  It allows the compiler to construct the
       requisite function declaration, while allowing the body of the
!      function to be assembly code. The specified function will not have
!      prologue/epilogue sequences generated by the compiler. Only basic
!      `asm' statements can safely be included in naked functions (*note
!      Basic Asm::). While using extended `asm' or a mixture of basic
!      `asm' and C code may appear to work, they cannot be depended upon
       to work reliably and are not supported.
  
! `near'
       On MeP targets this attribute causes the compiler to assume the
       called function is close enough to use the normal calling
!      convention, overriding the `-mtf' command-line option.
  
! `nesting'
!      Use this attribute together with `interrupt_handler',
!      `exception_handler' or `nmi_handler' to indicate that the function
       entry code should enable nested interrupts or exceptions.
  
! `nmi_handler'
       Use this attribute on the Blackfin to indicate that the specified
       function is an NMI handler.  The compiler generates function entry
       and exit sequences suitable for use in an NMI handler when this
       attribute is present.
  
! `nocompression'
!      On MIPS targets, you can use the `nocompression' function attribute
       to locally turn off MIPS16 and microMIPS code generation.  This
!      attribute overrides the `-mips16' and `-mmicromips' options on the
       command line (*note MIPS Options::).
  
! `no_instrument_function'
!      If `-finstrument-functions' is given, profiling function calls are
       generated at entry and exit of most user-compiled functions.
       Functions with this attribute are not so instrumented.
  
! `no_split_stack'
!      If `-fsplit-stack' is given, functions have a small prologue which
       decides whether to split the stack.  Functions with the
!      `no_split_stack' attribute do not have that prologue, and thus may
       run with only a small amount of stack space available.
  
! `stack_protect'
       This function attribute make a stack protection of the function if
!      flags `fstack-protector' or `fstack-protector-strong' or
!      `fstack-protector-explicit' are set.
  
! `noinline'
       This function attribute prevents a function from being considered
       for inlining.  If the function does not have side-effects, there
       are optimizations other than inlining that cause function calls to
--- 25735,25810 ----
       hidden pointer.  However, on x86-32 Microsoft Windows targets, the
       compiler assumes that the caller pops the stack for hidden pointer.
  
! 'ms_hook_prologue'
! 
       On 32-bit and 64-bit x86 targets, you can use this function
!      attribute to make GCC generate the "hot-patching" function prologue
!      used in Win32 API functions in Microsoft Windows XP Service Pack 2
!      and newer.
! 
! 'hotpatch (HALFWORDS-BEFORE-FUNCTION-LABEL,HALFWORDS-AFTER-FUNCTION-LABEL)'
  
       On S/390 System z targets, you can use this function attribute to
       make GCC generate a "hot-patching" function prologue.  If the
!      '-mhotpatch=' command-line option is used at the same time, the
!      'hotpatch' attribute takes precedence.  The first of the two
       arguments specifies the number of halfwords to be added before the
       function label.  A second argument can be used to specify the
!      number of halfwords to be added after the function label.  For both
!      arguments the maximum allowed value is 1000000.
  
       If both arguments are zero, hotpatching is disabled.
  
! 'naked'
       This attribute is available on the ARM, AVR, MCORE, MSP430, NDS32,
       RL78, RX and SPU ports.  It allows the compiler to construct the
       requisite function declaration, while allowing the body of the
!      function to be assembly code.  The specified function will not have
!      prologue/epilogue sequences generated by the compiler.  Only basic
!      'asm' statements can safely be included in naked functions (*note
!      Basic Asm::).  While using extended 'asm' or a mixture of basic
!      'asm' and C code may appear to work, they cannot be depended upon
       to work reliably and are not supported.
  
! 'near'
       On MeP targets this attribute causes the compiler to assume the
       called function is close enough to use the normal calling
!      convention, overriding the '-mtf' command-line option.
  
! 'nesting'
!      Use this attribute together with 'interrupt_handler',
!      'exception_handler' or 'nmi_handler' to indicate that the function
       entry code should enable nested interrupts or exceptions.
  
! 'nmi_handler'
       Use this attribute on the Blackfin to indicate that the specified
       function is an NMI handler.  The compiler generates function entry
       and exit sequences suitable for use in an NMI handler when this
       attribute is present.
  
! 'nocompression'
!      On MIPS targets, you can use the 'nocompression' function attribute
       to locally turn off MIPS16 and microMIPS code generation.  This
!      attribute overrides the '-mips16' and '-mmicromips' options on the
       command line (*note MIPS Options::).
  
! 'no_instrument_function'
!      If '-finstrument-functions' is given, profiling function calls are
       generated at entry and exit of most user-compiled functions.
       Functions with this attribute are not so instrumented.
  
! 'no_split_stack'
!      If '-fsplit-stack' is given, functions have a small prologue which
       decides whether to split the stack.  Functions with the
!      'no_split_stack' attribute do not have that prologue, and thus may
       run with only a small amount of stack space available.
  
! 'stack_protect'
       This function attribute make a stack protection of the function if
!      flags 'fstack-protector' or 'fstack-protector-strong' or
!      'fstack-protector-explicit' are set.
  
! 'noinline'
       This function attribute prevents a function from being considered
       for inlining.  If the function does not have side-effects, there
       are optimizations other than inlining that cause function calls to
*************** attributes.
*** 25995,26027 ****
       (*note Extended Asm::) in the called function, to serve as a
       special side-effect.
  
! `noclone'
       This function attribute prevents a function from being considered
       for cloning--a mechanism that produces specialized copies of
       functions and which is (currently) performed by interprocedural
       constant propagation.
  
! `no_icf'
!      This function attribute prevents a functions from being merged
!      with another semantically equivalent function.
  
! `nonnull (ARG-INDEX, ...)'
!      The `nonnull' attribute specifies that some function parameters
       should be non-null pointers.  For instance, the declaration:
  
            extern void *
            my_memcpy (void *dest, const void *src, size_t len)
                    __attribute__((nonnull (1, 2)));
  
!      causes the compiler to check that, in calls to `my_memcpy',
       arguments DEST and SRC are non-null.  If the compiler determines
       that a null pointer is passed in an argument slot marked as
!      non-null, and the `-Wnonnull' option is enabled, a warning is
       issued.  The compiler may also choose to make optimizations based
       on the knowledge that certain function arguments will never be
       null.
  
!      If no argument index list is given to the `nonnull' attribute, all
       pointer arguments are marked as non-null.  To illustrate, the
       following declaration is equivalent to the previous example:
  
--- 25815,25847 ----
       (*note Extended Asm::) in the called function, to serve as a
       special side-effect.
  
! 'noclone'
       This function attribute prevents a function from being considered
       for cloning--a mechanism that produces specialized copies of
       functions and which is (currently) performed by interprocedural
       constant propagation.
  
! 'no_icf'
!      This function attribute prevents a functions from being merged with
!      another semantically equivalent function.
  
! 'nonnull (ARG-INDEX, ...)'
!      The 'nonnull' attribute specifies that some function parameters
       should be non-null pointers.  For instance, the declaration:
  
            extern void *
            my_memcpy (void *dest, const void *src, size_t len)
                    __attribute__((nonnull (1, 2)));
  
!      causes the compiler to check that, in calls to 'my_memcpy',
       arguments DEST and SRC are non-null.  If the compiler determines
       that a null pointer is passed in an argument slot marked as
!      non-null, and the '-Wnonnull' option is enabled, a warning is
       issued.  The compiler may also choose to make optimizations based
       on the knowledge that certain function arguments will never be
       null.
  
!      If no argument index list is given to the 'nonnull' attribute, all
       pointer arguments are marked as non-null.  To illustrate, the
       following declaration is equivalent to the previous example:
  
*************** attributes.
*** 26029,26044 ****
            my_memcpy (void *dest, const void *src, size_t len)
                    __attribute__((nonnull));
  
! `no_reorder'
!      Do not reorder functions or variables marked `no_reorder' against
       each other or top level assembler statements the executable.  The
!      actual order in the program will depend on the linker command
!      line. Static variables marked like this are also not removed.
!      This has a similar effect as the `-fno-toplevel-reorder' option,
!      but only applies to the marked symbols.
  
! `returns_nonnull'
!      The `returns_nonnull' attribute specifies that the function return
       value should be a non-null pointer.  For instance, the declaration:
  
            extern void *
--- 25849,25864 ----
            my_memcpy (void *dest, const void *src, size_t len)
                    __attribute__((nonnull));
  
! 'no_reorder'
!      Do not reorder functions or variables marked 'no_reorder' against
       each other or top level assembler statements the executable.  The
!      actual order in the program will depend on the linker command line.
!      Static variables marked like this are also not removed.  This has a
!      similar effect as the '-fno-toplevel-reorder' option, but only
!      applies to the marked symbols.
  
! 'returns_nonnull'
!      The 'returns_nonnull' attribute specifies that the function return
       value should be a non-null pointer.  For instance, the declaration:
  
            extern void *
*************** attributes.
*** 26047,26057 ****
       lets the compiler optimize callers based on the knowledge that the
       return value will never be null.
  
! `noreturn'
!      A few standard library functions, such as `abort' and `exit',
       cannot return.  GCC knows this automatically.  Some programs define
       their own functions that never return.  You can declare them
!      `noreturn' to tell the compiler this fact.  For example,
  
            void fatal () __attribute__ ((noreturn));
  
--- 25867,25877 ----
       lets the compiler optimize callers based on the knowledge that the
       return value will never be null.
  
! 'noreturn'
!      A few standard library functions, such as 'abort' and 'exit',
       cannot return.  GCC knows this automatically.  Some programs define
       their own functions that never return.  You can declare them
!      'noreturn' to tell the compiler this fact.  For example,
  
            void fatal () __attribute__ ((noreturn));
  
*************** attributes.
*** 26062,26106 ****
              exit (1);
            }
  
!      The `noreturn' keyword tells the compiler to assume that `fatal'
       cannot return.  It can then optimize without regard to what would
!      happen if `fatal' ever did return.  This makes slightly better
       code.  More importantly, it helps avoid spurious warnings of
       uninitialized variables.
  
!      The `noreturn' keyword does not affect the exceptional path when
!      that applies: a `noreturn'-marked function may still return to the
!      caller by throwing an exception or calling `longjmp'.
  
       Do not assume that registers saved by the calling function are
!      restored before calling the `noreturn' function.
  
!      It does not make sense for a `noreturn' function to have a return
!      type other than `void'.
  
! `nothrow'
!      The `nothrow' attribute is used to inform the compiler that a
       function cannot throw an exception.  For example, most functions in
       the standard C library can be guaranteed not to throw an exception
!      with the notable exceptions of `qsort' and `bsearch' that take
       function pointer arguments.
  
! `nosave_low_regs'
       Use this attribute on SH targets to indicate that an
!      `interrupt_handler' function should not save and restore registers
       R0..R7.  This can be used on SH3* and SH4* targets that have a
       second R0..R7 register bank for non-reentrant interrupt handlers.
  
! `optimize'
!      The `optimize' attribute is used to specify that a function is to
       be compiled with different optimization options than specified on
       the command line.  Arguments can either be numbers or strings.
       Numbers are assumed to be an optimization level.  Strings that
!      begin with `O' are assumed to be an optimization option, while
!      other options are assumed to be used with a `-f' prefix.  You can
!      also use the `#pragma GCC optimize' pragma to set the optimization
       options that affect more than one function.  *Note Function
!      Specific Option Pragmas::, for details about the `#pragma GCC
       optimize' pragma.
  
       This can be used for instance to have frequently-executed functions
--- 25882,25926 ----
              exit (1);
            }
  
!      The 'noreturn' keyword tells the compiler to assume that 'fatal'
       cannot return.  It can then optimize without regard to what would
!      happen if 'fatal' ever did return.  This makes slightly better
       code.  More importantly, it helps avoid spurious warnings of
       uninitialized variables.
  
!      The 'noreturn' keyword does not affect the exceptional path when
!      that applies: a 'noreturn'-marked function may still return to the
!      caller by throwing an exception or calling 'longjmp'.
  
       Do not assume that registers saved by the calling function are
!      restored before calling the 'noreturn' function.
  
!      It does not make sense for a 'noreturn' function to have a return
!      type other than 'void'.
  
! 'nothrow'
!      The 'nothrow' attribute is used to inform the compiler that a
       function cannot throw an exception.  For example, most functions in
       the standard C library can be guaranteed not to throw an exception
!      with the notable exceptions of 'qsort' and 'bsearch' that take
       function pointer arguments.
  
! 'nosave_low_regs'
       Use this attribute on SH targets to indicate that an
!      'interrupt_handler' function should not save and restore registers
       R0..R7.  This can be used on SH3* and SH4* targets that have a
       second R0..R7 register bank for non-reentrant interrupt handlers.
  
! 'optimize'
!      The 'optimize' attribute is used to specify that a function is to
       be compiled with different optimization options than specified on
       the command line.  Arguments can either be numbers or strings.
       Numbers are assumed to be an optimization level.  Strings that
!      begin with 'O' are assumed to be an optimization option, while
!      other options are assumed to be used with a '-f' prefix.  You can
!      also use the '#pragma GCC optimize' pragma to set the optimization
       options that affect more than one function.  *Note Function
!      Specific Option Pragmas::, for details about the '#pragma GCC
       optimize' pragma.
  
       This can be used for instance to have frequently-executed functions
*************** attributes.
*** 26108,26188 ****
       faster and larger code, while other functions can be compiled with
       less aggressive options.
  
! `OS_main'
! `OS_task'
!      On AVR, functions with the `OS_main' or `OS_task' attribute do not
       save/restore any call-saved register in their prologue/epilogue.
  
!      The `OS_main' attribute can be used when there _is guarantee_ that
       interrupts are disabled at the time when the function is entered.
       This saves resources when the stack pointer has to be changed to
       set up a frame for local variables.
  
!      The `OS_task' attribute can be used when there is _no guarantee_
       that interrupts are disabled at that time when the function is
!      entered like for, e.g. task functions in a multi-threading
!      operating system. In that case, changing the stack pointer
       register is guarded by save/clear/restore of the global interrupt
       enable flag.
  
!      The differences to the `naked' function attribute are:
!         * `naked' functions do not have a return instruction whereas
!           `OS_main' and `OS_task' functions have a `RET' or `RETI'
            return instruction.
! 
!         * `naked' functions do not set up a frame for local variables
!           or a frame pointer whereas `OS_main' and `OS_task' do this as
            needed.
  
! `pcs'
!      The `pcs' attribute can be used to control the calling convention
!      used for a function on ARM.  The attribute takes an argument that
       specifies the calling convention to use.
  
       When compiling using the AAPCS ABI (or a variant of it) then valid
!      values for the argument are `"aapcs"' and `"aapcs-vfp"'.  In order
!      to use a variant other than `"aapcs"' then the compiler must be
       permitted to use the appropriate co-processor registers (i.e., the
!      VFP registers must be available in order to use `"aapcs-vfp"').
       For example,
  
            /* Argument passed in r0, and result returned in r0+r1.  */
            double f2d (float) __attribute__((pcs("aapcs")));
  
!      Variadic functions always use the `"aapcs"' calling convention and
       the compiler rejects attempts to specify an alternative.
  
! `pure'
       Many functions have no effects except the return value and their
       return value depends only on the parameters and/or global
       variables.  Such a function can be subject to common subexpression
       elimination and loop optimization just as an arithmetic operator
       would be.  These functions should be declared with the attribute
!      `pure'.  For example,
  
            int square (int) __attribute__ ((pure));
  
!      says that the hypothetical function `square' is safe to call fewer
       times than the program says.
  
!      Some of common examples of pure functions are `strlen' or `memcmp'.
!      Interesting non-pure functions are functions with infinite loops
!      or those depending on volatile memory or other system resource,
!      that may change between two consecutive calls (such as `feof' in a
       multithreading environment).
  
! `hot'
!      The `hot' attribute on a function is used to inform the compiler
       that the function is a hot spot of the compiled program.  The
       function is optimized more aggressively and on many targets it is
       placed into a special subsection of the text section so all hot
       functions appear close together, improving locality.
  
!      When profile feedback is available, via `-fprofile-use', hot
       functions are automatically detected and this attribute is ignored.
  
! `cold'
!      The `cold' attribute on functions is used to inform the compiler
       that the function is unlikely to be executed.  The function is
       optimized for size rather than speed and on many targets it is
       placed into a special subsection of the text section so all cold
--- 25928,26008 ----
       faster and larger code, while other functions can be compiled with
       less aggressive options.
  
! 'OS_main'
! 'OS_task'
!      On AVR, functions with the 'OS_main' or 'OS_task' attribute do not
       save/restore any call-saved register in their prologue/epilogue.
  
!      The 'OS_main' attribute can be used when there _is guarantee_ that
       interrupts are disabled at the time when the function is entered.
       This saves resources when the stack pointer has to be changed to
       set up a frame for local variables.
  
!      The 'OS_task' attribute can be used when there is _no guarantee_
       that interrupts are disabled at that time when the function is
!      entered like for, e.g.  task functions in a multi-threading
!      operating system.  In that case, changing the stack pointer
       register is guarded by save/clear/restore of the global interrupt
       enable flag.
  
!      The differences to the 'naked' function attribute are:
!         * 'naked' functions do not have a return instruction whereas
!           'OS_main' and 'OS_task' functions have a 'RET' or 'RETI'
            return instruction.
!         * 'naked' functions do not set up a frame for local variables or
!           a frame pointer whereas 'OS_main' and 'OS_task' do this as
            needed.
  
! 'pcs'
! 
!      The 'pcs' attribute can be used to control the calling convention
!      used for a function on ARM. The attribute takes an argument that
       specifies the calling convention to use.
  
       When compiling using the AAPCS ABI (or a variant of it) then valid
!      values for the argument are '"aapcs"' and '"aapcs-vfp"'.  In order
!      to use a variant other than '"aapcs"' then the compiler must be
       permitted to use the appropriate co-processor registers (i.e., the
!      VFP registers must be available in order to use '"aapcs-vfp"').
       For example,
  
            /* Argument passed in r0, and result returned in r0+r1.  */
            double f2d (float) __attribute__((pcs("aapcs")));
  
!      Variadic functions always use the '"aapcs"' calling convention and
       the compiler rejects attempts to specify an alternative.
  
! 'pure'
       Many functions have no effects except the return value and their
       return value depends only on the parameters and/or global
       variables.  Such a function can be subject to common subexpression
       elimination and loop optimization just as an arithmetic operator
       would be.  These functions should be declared with the attribute
!      'pure'.  For example,
  
            int square (int) __attribute__ ((pure));
  
!      says that the hypothetical function 'square' is safe to call fewer
       times than the program says.
  
!      Some of common examples of pure functions are 'strlen' or 'memcmp'.
!      Interesting non-pure functions are functions with infinite loops or
!      those depending on volatile memory or other system resource, that
!      may change between two consecutive calls (such as 'feof' in a
       multithreading environment).
  
! 'hot'
!      The 'hot' attribute on a function is used to inform the compiler
       that the function is a hot spot of the compiled program.  The
       function is optimized more aggressively and on many targets it is
       placed into a special subsection of the text section so all hot
       functions appear close together, improving locality.
  
!      When profile feedback is available, via '-fprofile-use', hot
       functions are automatically detected and this attribute is ignored.
  
! 'cold'
!      The 'cold' attribute on functions is used to inform the compiler
       that the function is unlikely to be executed.  The function is
       optimized for size rather than speed and on many targets it is
       placed into a special subsection of the text section so all cold
*************** attributes.
*** 26190,26392 ****
       non-cold parts of program.  The paths leading to calls of cold
       functions within code are marked as unlikely by the branch
       prediction mechanism.  It is thus useful to mark functions used to
!      handle unlikely conditions, such as `perror', as cold to improve
!      optimization of hot functions that do call marked functions in
!      rare occasions.
  
!      When profile feedback is available, via `-fprofile-use', cold
       functions are automatically detected and this attribute is ignored.
  
! `no_sanitize_address'
! `no_address_safety_analysis'
!      The `no_sanitize_address' attribute on functions is used to inform
       the compiler that it should not instrument memory accesses in the
!      function when compiling with the `-fsanitize=address' option.  The
!      `no_address_safety_analysis' is a deprecated alias of the
!      `no_sanitize_address' attribute, new code should use
!      `no_sanitize_address'.
  
! `no_sanitize_thread'
!      The `no_sanitize_thread' attribute on functions is used to inform
       the compiler that it should not instrument memory accesses in the
!      function when compiling with the `-fsanitize=thread' option.
  
! `no_sanitize_undefined'
!      The `no_sanitize_undefined' attribute on functions is used to
       inform the compiler that it should not check for undefined behavior
!      in the function when compiling with the `-fsanitize=undefined'
       option.
  
! `bnd_legacy'
!      The `bnd_legacy' attribute on functions is used to inform the
       compiler that the function should not be instrumented when compiled
!      with the `-fcheck-pointer-bounds' option.
  
! `bnd_instrument'
!      The `bnd_instrument' attribute on functions is used to inform the
       compiler that the function should be instrumented when compiled
!      with the `-fchkp-instrument-marked-only' option.
  
! `regparm (NUMBER)'
!      On x86-32 targets, the `regparm' attribute causes the compiler to
!      pass arguments number one to NUMBER if they are of integral type
!      in registers EAX, EDX, and ECX instead of on the stack.  Functions
       that take a variable number of arguments continue to be passed all
       of their arguments on the stack.
  
       Beware that on some ELF systems this attribute is unsuitable for
       global functions in shared libraries with lazy binding (which is
!      the default).  Lazy binding sends the first call via resolving
!      code in the loader, which might assume EAX, EDX and ECX can be
       clobbered, as per the standard calling conventions.  Solaris 8 is
       affected by this.  Systems with the GNU C Library version 2.1 or
       higher and FreeBSD are believed to be safe since the loaders there
!      save EAX, EDX and ECX.  (Lazy binding can be disabled with the
       linker or the loader if desired, to avoid the problem.)
  
! `reset'
       Use this attribute on the NDS32 target to indicate that the
       specified function is a reset handler.  The compiler will generate
!      corresponding sections for use in a reset handler.  You can use
!      the following attributes to provide extra exception handling:
!     `nmi'
            Provide a user-defined function to handle NMI exception.
! 
!     `warm'
            Provide a user-defined function to handle warm reset
            exception.
  
! `sseregparm'
!      On x86-32 targets with SSE support, the `sseregparm' attribute
!      causes the compiler to pass up to 3 floating-point arguments in
!      SSE registers instead of on the stack.  Functions that take a
!      variable number of arguments continue to pass all of their
!      floating-point arguments on the stack.
  
! `force_align_arg_pointer'
!      On x86 targets, the `force_align_arg_pointer' attribute may be
       applied to individual function definitions, generating an alternate
       prologue and epilogue that realigns the run-time stack if
       necessary.  This supports mixing legacy codes that run with a
       4-byte aligned stack with modern codes that keep a 16-byte stack
       for SSE compatibility.
  
! `renesas'
       On SH targets this attribute specifies that the function or struct
       follows the Renesas ABI.
  
! `resbank'
       On the SH2A target, this attribute enables the high-speed register
       saving and restoration using a register bank for
!      `interrupt_handler' routines.  Saving to the bank is performed
       automatically after the CPU accepts an interrupt that uses a
       register bank.
  
       The nineteen 32-bit registers comprising general register R0 to
       R14, control register GBR, and system registers MACH, MACL, and PR
!      and the vector table address offset are saved into a register
!      bank.  Register banks are stacked in first-in last-out (FILO)
!      sequence.  Restoration from the bank is executed by issuing a
!      RESBANK instruction.
  
! `returns_twice'
!      The `returns_twice' attribute tells the compiler that a function
       may return more than one time.  The compiler ensures that all
       registers are dead before calling such a function and emits a
       warning about the variables that may be clobbered after the second
!      return from the function.  Examples of such functions are `setjmp'
!      and `vfork'.  The `longjmp'-like counterpart of such function, if
!      any, might need to be marked with the `noreturn' attribute.
  
! `saveall'
       Use this attribute on the Blackfin, H8/300, H8/300H, and H8S to
       indicate that all registers except the stack pointer should be
       saved in the prologue regardless of whether they are used or not.
  
! `save_volatiles'
       Use this attribute on the MicroBlaze to indicate that the function
       is an interrupt handler.  All volatile registers (in addition to
!      non-volatile registers) are saved in the function prologue.  If
!      the function is a leaf function, only volatiles used by the
!      function are saved.  A normal function return is generated instead
!      of a return from interrupt.
  
! `break_handler'
       Use this attribute on the MicroBlaze ports to indicate that the
       specified function is a break handler.  The compiler generates
       function entry and exit sequences suitable for use in an break
!      handler when this attribute is present. The return from
!      `break_handler' is done through the `rtbd' instead of `rtsd'.
  
            void f () __attribute__ ((break_handler));
  
! `section ("SECTION-NAME")'
!      Normally, the compiler places the code it generates in the `text'
       section.  Sometimes, however, you need additional sections, or you
       need certain particular functions to appear in special sections.
!      The `section' attribute specifies that a function lives in a
       particular section.  For example, the declaration:
  
            extern void foobar (void) __attribute__ ((section ("bar")));
  
!      puts the function `foobar' in the `bar' section.
  
       Some file formats do not support arbitrary sections so the
!      `section' attribute is not available on all platforms.  If you
!      need to map the entire contents of a module to a particular
!      section, consider using the facilities of the linker instead.
  
! `sentinel'
!      This function attribute ensures that a parameter in a function
!      call is an explicit `NULL'.  The attribute is only valid on
!      variadic functions.  By default, the sentinel is located at
!      position zero, the last parameter of the function call.  If an
!      optional integer position argument P is supplied to the attribute,
!      the sentinel must be located at position P counting backwards from
!      the end of the argument list.
  
            __attribute__ ((sentinel))
            is equivalent to
            __attribute__ ((sentinel(0)))
  
       The attribute is automatically set with a position of 0 for the
!      built-in functions `execl' and `execlp'.  The built-in function
!      `execle' has the attribute set with a position of 1.
  
!      A valid `NULL' in this context is defined as zero with any pointer
!      type.  If your system defines the `NULL' macro with an integer type
!      then you need to add an explicit cast.  GCC replaces `stddef.h'
       with a copy that redefines NULL appropriately.
  
       The warnings for missing or incorrect sentinels are enabled with
!      `-Wformat'.
  
! `short_call'
!      See `long_call'.
  
! `shortcall'
!      See `longcall'.
  
! `signal'
       Use this attribute on the AVR to indicate that the specified
       function is an interrupt handler.  The compiler generates function
       entry and exit sequences suitable for use in an interrupt handler
       when this attribute is present.
  
!      See also the `interrupt' function attribute.
  
       The AVR hardware globally disables interrupts when an interrupt is
!      executed.  Interrupt handler functions defined with the `signal'
       attribute do not re-enable interrupts.  It is save to enable
!      interrupts in a `signal' handler.  This "save" only applies to the
       code generated by the compiler and not to the IRQ layout of the
       application which is responsibility of the application.
  
!      If both `signal' and `interrupt' are specified for the same
!      function, `signal' is silently ignored.
  
! `sp_switch'
!      Use this attribute on the SH to indicate an `interrupt_handler'
       function should switch to an alternate stack.  It expects a string
       argument that names a global variable holding the address of the
       alternate stack.
--- 26010,26211 ----
       non-cold parts of program.  The paths leading to calls of cold
       functions within code are marked as unlikely by the branch
       prediction mechanism.  It is thus useful to mark functions used to
!      handle unlikely conditions, such as 'perror', as cold to improve
!      optimization of hot functions that do call marked functions in rare
!      occasions.
  
!      When profile feedback is available, via '-fprofile-use', cold
       functions are automatically detected and this attribute is ignored.
  
! 'no_sanitize_address'
! 'no_address_safety_analysis'
!      The 'no_sanitize_address' attribute on functions is used to inform
       the compiler that it should not instrument memory accesses in the
!      function when compiling with the '-fsanitize=address' option.  The
!      'no_address_safety_analysis' is a deprecated alias of the
!      'no_sanitize_address' attribute, new code should use
!      'no_sanitize_address'.
  
! 'no_sanitize_thread'
!      The 'no_sanitize_thread' attribute on functions is used to inform
       the compiler that it should not instrument memory accesses in the
!      function when compiling with the '-fsanitize=thread' option.
  
! 'no_sanitize_undefined'
!      The 'no_sanitize_undefined' attribute on functions is used to
       inform the compiler that it should not check for undefined behavior
!      in the function when compiling with the '-fsanitize=undefined'
       option.
  
! 'bnd_legacy'
!      The 'bnd_legacy' attribute on functions is used to inform the
       compiler that the function should not be instrumented when compiled
!      with the '-fcheck-pointer-bounds' option.
  
! 'bnd_instrument'
!      The 'bnd_instrument' attribute on functions is used to inform the
       compiler that the function should be instrumented when compiled
!      with the '-fchkp-instrument-marked-only' option.
  
! 'regparm (NUMBER)'
!      On x86-32 targets, the 'regparm' attribute causes the compiler to
!      pass arguments number one to NUMBER if they are of integral type in
!      registers EAX, EDX, and ECX instead of on the stack.  Functions
       that take a variable number of arguments continue to be passed all
       of their arguments on the stack.
  
       Beware that on some ELF systems this attribute is unsuitable for
       global functions in shared libraries with lazy binding (which is
!      the default).  Lazy binding sends the first call via resolving code
!      in the loader, which might assume EAX, EDX and ECX can be
       clobbered, as per the standard calling conventions.  Solaris 8 is
       affected by this.  Systems with the GNU C Library version 2.1 or
       higher and FreeBSD are believed to be safe since the loaders there
!      save EAX, EDX and ECX. (Lazy binding can be disabled with the
       linker or the loader if desired, to avoid the problem.)
  
! 'reset'
       Use this attribute on the NDS32 target to indicate that the
       specified function is a reset handler.  The compiler will generate
!      corresponding sections for use in a reset handler.  You can use the
!      following attributes to provide extra exception handling:
!      'nmi'
            Provide a user-defined function to handle NMI exception.
!      'warm'
            Provide a user-defined function to handle warm reset
            exception.
  
! 'sseregparm'
!      On x86-32 targets with SSE support, the 'sseregparm' attribute
!      causes the compiler to pass up to 3 floating-point arguments in SSE
!      registers instead of on the stack.  Functions that take a variable
!      number of arguments continue to pass all of their floating-point
!      arguments on the stack.
  
! 'force_align_arg_pointer'
!      On x86 targets, the 'force_align_arg_pointer' attribute may be
       applied to individual function definitions, generating an alternate
       prologue and epilogue that realigns the run-time stack if
       necessary.  This supports mixing legacy codes that run with a
       4-byte aligned stack with modern codes that keep a 16-byte stack
       for SSE compatibility.
  
! 'renesas'
       On SH targets this attribute specifies that the function or struct
       follows the Renesas ABI.
  
! 'resbank'
       On the SH2A target, this attribute enables the high-speed register
       saving and restoration using a register bank for
!      'interrupt_handler' routines.  Saving to the bank is performed
       automatically after the CPU accepts an interrupt that uses a
       register bank.
  
       The nineteen 32-bit registers comprising general register R0 to
       R14, control register GBR, and system registers MACH, MACL, and PR
!      and the vector table address offset are saved into a register bank.
!      Register banks are stacked in first-in last-out (FILO) sequence.
!      Restoration from the bank is executed by issuing a RESBANK
!      instruction.
  
! 'returns_twice'
!      The 'returns_twice' attribute tells the compiler that a function
       may return more than one time.  The compiler ensures that all
       registers are dead before calling such a function and emits a
       warning about the variables that may be clobbered after the second
!      return from the function.  Examples of such functions are 'setjmp'
!      and 'vfork'.  The 'longjmp'-like counterpart of such function, if
!      any, might need to be marked with the 'noreturn' attribute.
  
! 'saveall'
       Use this attribute on the Blackfin, H8/300, H8/300H, and H8S to
       indicate that all registers except the stack pointer should be
       saved in the prologue regardless of whether they are used or not.
  
! 'save_volatiles'
       Use this attribute on the MicroBlaze to indicate that the function
       is an interrupt handler.  All volatile registers (in addition to
!      non-volatile registers) are saved in the function prologue.  If the
!      function is a leaf function, only volatiles used by the function
!      are saved.  A normal function return is generated instead of a
!      return from interrupt.
  
! 'break_handler'
       Use this attribute on the MicroBlaze ports to indicate that the
       specified function is a break handler.  The compiler generates
       function entry and exit sequences suitable for use in an break
!      handler when this attribute is present.  The return from
!      'break_handler' is done through the 'rtbd' instead of 'rtsd'.
  
            void f () __attribute__ ((break_handler));
  
! 'section ("SECTION-NAME")'
!      Normally, the compiler places the code it generates in the 'text'
       section.  Sometimes, however, you need additional sections, or you
       need certain particular functions to appear in special sections.
!      The 'section' attribute specifies that a function lives in a
       particular section.  For example, the declaration:
  
            extern void foobar (void) __attribute__ ((section ("bar")));
  
!      puts the function 'foobar' in the 'bar' section.
  
       Some file formats do not support arbitrary sections so the
!      'section' attribute is not available on all platforms.  If you need
!      to map the entire contents of a module to a particular section,
!      consider using the facilities of the linker instead.
  
! 'sentinel'
!      This function attribute ensures that a parameter in a function call
!      is an explicit 'NULL'.  The attribute is only valid on variadic
!      functions.  By default, the sentinel is located at position zero,
!      the last parameter of the function call.  If an optional integer
!      position argument P is supplied to the attribute, the sentinel must
!      be located at position P counting backwards from the end of the
!      argument list.
  
            __attribute__ ((sentinel))
            is equivalent to
            __attribute__ ((sentinel(0)))
  
       The attribute is automatically set with a position of 0 for the
!      built-in functions 'execl' and 'execlp'.  The built-in function
!      'execle' has the attribute set with a position of 1.
  
!      A valid 'NULL' in this context is defined as zero with any pointer
!      type.  If your system defines the 'NULL' macro with an integer type
!      then you need to add an explicit cast.  GCC replaces 'stddef.h'
       with a copy that redefines NULL appropriately.
  
       The warnings for missing or incorrect sentinels are enabled with
!      '-Wformat'.
  
! 'short_call'
!      See 'long_call'.
  
! 'shortcall'
!      See 'longcall'.
  
! 'signal'
       Use this attribute on the AVR to indicate that the specified
       function is an interrupt handler.  The compiler generates function
       entry and exit sequences suitable for use in an interrupt handler
       when this attribute is present.
  
!      See also the 'interrupt' function attribute.
  
       The AVR hardware globally disables interrupts when an interrupt is
!      executed.  Interrupt handler functions defined with the 'signal'
       attribute do not re-enable interrupts.  It is save to enable
!      interrupts in a 'signal' handler.  This "save" only applies to the
       code generated by the compiler and not to the IRQ layout of the
       application which is responsibility of the application.
  
!      If both 'signal' and 'interrupt' are specified for the same
!      function, 'signal' is silently ignored.
  
! 'sp_switch'
!      Use this attribute on the SH to indicate an 'interrupt_handler'
       function should switch to an alternate stack.  It expects a string
       argument that names a global variable holding the address of the
       alternate stack.
*************** attributes.
*** 26395,26734 ****
            void f () __attribute__ ((interrupt_handler,
                                      sp_switch ("alt_stack")));
  
! `stdcall'
!      On x86-32 targets, the `stdcall' attribute causes the compiler to
       assume that the called function pops off the stack space used to
       pass arguments, unless it takes a variable number of arguments.
  
! `syscall_linkage'
       This attribute is used to modify the IA-64 calling convention by
       marking all input registers as live at all function exits.  This
       makes it possible to restart a system call after an interrupt
       without having to save/restore the input registers.  This also
       prevents kernel data from leaking into application code.
  
! `target'
!      The `target' attribute is used to specify that a function is to be
       compiled with different target options than specified on the
       command line.  This can be used for instance to have functions
       compiled with a different ISA (instruction set architecture) than
!      the default.  You can also use the `#pragma GCC target' pragma to
       set more than one function to be compiled with specific target
       options.  *Note Function Specific Option Pragmas::, for details
!      about the `#pragma GCC target' pragma.
  
       For instance on an x86, you could compile one function with
!      `target("sse4.1,arch=core2")' and another with
!      `target("sse4a,arch=amdfam10")'.  This is equivalent to compiling
!      the first function with `-msse4.1' and `-march=core2' options, and
!      the second function with `-msse4a' and `-march=amdfam10' options.
       It is up to the user to make sure that a function is only invoked
       on a machine that supports the particular ISA it is compiled for
!      (for example by using `cpuid' on x86 to determine what feature
!      bits and architecture family are used).
  
            int core2_func (void) __attribute__ ((__target__ ("arch=core2")));
            int sse3_func (void) __attribute__ ((__target__ ("sse3")));
  
!      You can either use multiple strings to specify multiple options,
!      or separate the options with a comma (`,').
  
!      The `target' attribute is presently implemented for x86, PowerPC,
       and Nios II targets only.  The options supported are specific to
       each target.
  
       On the x86, the following options are allowed:
  
!     `abm'
!     `no-abm'
            Enable/disable the generation of the advanced bit
            instructions.
  
!     `aes'
!     `no-aes'
            Enable/disable the generation of the AES instructions.
  
!     `default'
            *Note Function Multiversioning::, where it is used to specify
            the default function version.
  
!     `mmx'
!     `no-mmx'
            Enable/disable the generation of the MMX instructions.
  
!     `pclmul'
!     `no-pclmul'
            Enable/disable the generation of the PCLMUL instructions.
  
!     `popcnt'
!     `no-popcnt'
            Enable/disable the generation of the POPCNT instruction.
  
!     `sse'
!     `no-sse'
            Enable/disable the generation of the SSE instructions.
  
!     `sse2'
!     `no-sse2'
            Enable/disable the generation of the SSE2 instructions.
  
!     `sse3'
!     `no-sse3'
            Enable/disable the generation of the SSE3 instructions.
  
!     `sse4'
!     `no-sse4'
            Enable/disable the generation of the SSE4 instructions (both
            SSE4.1 and SSE4.2).
  
!     `sse4.1'
!     `no-sse4.1'
            Enable/disable the generation of the sse4.1 instructions.
  
!     `sse4.2'
!     `no-sse4.2'
            Enable/disable the generation of the sse4.2 instructions.
  
!     `sse4a'
!     `no-sse4a'
            Enable/disable the generation of the SSE4A instructions.
  
!     `fma4'
!     `no-fma4'
            Enable/disable the generation of the FMA4 instructions.
  
!     `xop'
!     `no-xop'
            Enable/disable the generation of the XOP instructions.
  
!     `lwp'
!     `no-lwp'
            Enable/disable the generation of the LWP instructions.
  
!     `ssse3'
!     `no-ssse3'
            Enable/disable the generation of the SSSE3 instructions.
  
!     `cld'
!     `no-cld'
            Enable/disable the generation of the CLD before string moves.
  
!     `fancy-math-387'
!     `no-fancy-math-387'
!           Enable/disable the generation of the `sin', `cos', and `sqrt'
            instructions on the 387 floating-point unit.
  
!     `fused-madd'
!     `no-fused-madd'
            Enable/disable the generation of the fused multiply/add
            instructions.
  
!     `ieee-fp'
!     `no-ieee-fp'
            Enable/disable the generation of floating point that depends
            on IEEE arithmetic.
  
!     `inline-all-stringops'
!     `no-inline-all-stringops'
            Enable/disable inlining of string operations.
  
!     `inline-stringops-dynamically'
!     `no-inline-stringops-dynamically'
            Enable/disable the generation of the inline code to do small
            string operations and calling the library routines for large
            operations.
  
!     `align-stringops'
!     `no-align-stringops'
            Do/do not align destination of inlined string operations.
  
!     `recip'
!     `no-recip'
            Enable/disable the generation of RCPSS, RCPPS, RSQRTSS and
            RSQRTPS instructions followed an additional Newton-Raphson
            step instead of doing a floating-point division.
  
!     `arch=ARCH'
!           Specify the architecture to generate code for in compiling
!           the function.
  
!     `tune=TUNE'
            Specify the architecture to tune for in compiling the
            function.
  
!     `fpmath=FPMATH'
            Specify which floating-point unit to use.  The
!           `target("fpmath=sse,387")' option must be specified as
!           `target("fpmath=sse+387")' because the comma would separate
            different options.
  
       On the PowerPC, the following options are allowed:
  
!     `altivec'
!     `no-altivec'
            Generate code that uses (does not use) AltiVec instructions.
            In 32-bit code, you cannot enable AltiVec instructions unless
!           `-mabi=altivec' is used on the command line.
  
!     `cmpb'
!     `no-cmpb'
            Generate code that uses (does not use) the compare bytes
            instruction implemented on the POWER6 processor and other
            processors that support the PowerPC V2.05 architecture.
  
!     `dlmzb'
!     `no-dlmzb'
            Generate code that uses (does not use) the string-search
!           `dlmzb' instruction on the IBM 405, 440, 464 and 476
            processors.  This instruction is generated by default when
            targeting those processors.
  
!     `fprnd'
!     `no-fprnd'
            Generate code that uses (does not use) the FP round to integer
            instructions implemented on the POWER5+ processor and other
            processors that support the PowerPC V2.03 architecture.
  
!     `hard-dfp'
!     `no-hard-dfp'
            Generate code that uses (does not use) the decimal
            floating-point instructions implemented on some POWER
            processors.
  
!     `isel'
!     `no-isel'
            Generate code that uses (does not use) ISEL instruction.
  
!     `mfcrf'
!     `no-mfcrf'
            Generate code that uses (does not use) the move from condition
!           register field instruction implemented on the POWER4
!           processor and other processors that support the PowerPC V2.01
            architecture.
  
!     `mfpgpr'
!     `no-mfpgpr'
            Generate code that uses (does not use) the FP move to/from
            general purpose register instructions implemented on the
            POWER6X processor and other processors that support the
            extended PowerPC V2.05 architecture.
  
!     `mulhw'
!     `no-mulhw'
            Generate code that uses (does not use) the half-word multiply
            and multiply-accumulate instructions on the IBM 405, 440, 464
            and 476 processors.  These instructions are generated by
            default when targeting those processors.
  
!     `multiple'
!     `no-multiple'
            Generate code that uses (does not use) the load multiple word
            instructions and the store multiple word instructions.
  
!     `update'
!     `no-update'
            Generate code that uses (does not use) the load or store
            instructions that update the base register to the address of
            the calculated memory location.
  
!     `popcntb'
!     `no-popcntb'
            Generate code that uses (does not use) the popcount and
            double-precision FP reciprocal estimate instruction
            implemented on the POWER5 processor and other processors that
            support the PowerPC V2.02 architecture.
  
!     `popcntd'
!     `no-popcntd'
            Generate code that uses (does not use) the popcount
            instruction implemented on the POWER7 processor and other
            processors that support the PowerPC V2.06 architecture.
  
!     `powerpc-gfxopt'
!     `no-powerpc-gfxopt'
            Generate code that uses (does not use) the optional PowerPC
            architecture instructions in the Graphics group, including
            floating-point select.
  
!     `powerpc-gpopt'
!     `no-powerpc-gpopt'
            Generate code that uses (does not use) the optional PowerPC
            architecture instructions in the General Purpose group,
            including floating-point square root.
  
!     `recip-precision'
!     `no-recip-precision'
            Assume (do not assume) that the reciprocal estimate
            instructions provide higher-precision estimates than is
            mandated by the PowerPC ABI.
  
!     `string'
!     `no-string'
            Generate code that uses (does not use) the load string
            instructions and the store string word instructions to save
            multiple registers and do small block moves.
  
!     `vsx'
!     `no-vsx'
            Generate code that uses (does not use) vector/scalar (VSX)
            instructions, and also enable the use of built-in functions
            that allow more direct access to the VSX instruction set.  In
            32-bit code, you cannot enable VSX or AltiVec instructions
!           unless `-mabi=altivec' is used on the command line.
  
!     `friz'
!     `no-friz'
!           Generate (do not generate) the `friz' instruction when the
!           `-funsafe-math-optimizations' option is used to optimize
            rounding a floating-point value to 64-bit integer and back to
!           floating point.  The `friz' instruction does not return the
!           same value if the floating-point number is too large to fit
!           in an integer.
  
!     `avoid-indexed-addresses'
!     `no-avoid-indexed-addresses'
            Generate code that tries to avoid (not avoid) the use of
            indexed load or store instructions.
  
!     `paired'
!     `no-paired'
            Generate code that uses (does not use) the generation of
            PAIRED simd instructions.
  
!     `longcall'
!     `no-longcall'
            Generate code that assumes (does not assume) that all calls
            are far away so that a longer more expensive calling sequence
            is required.
  
!     `cpu=CPU'
            Specify the architecture to generate code for when compiling
!           the function.  If you select the `target("cpu=power7")'
            attribute when generating 32-bit code, VSX and AltiVec
            instructions are not generated unless you use the
!           `-mabi=altivec' option on the command line.
  
!     `tune=TUNE'
            Specify the architecture to tune for when compiling the
!           function.  If you do not specify the `target("tune=TUNE")'
!           attribute and you do specify the `target("cpu=CPU")'
!           attribute, compilation tunes for the CPU architecture, and
!           not the default tuning specified on the command line.
  
       When compiling for Nios II, the following options are allowed:
  
!     `custom-INSN=N'
!     `no-custom-INSN'
!           Each `custom-INSN=N' attribute locally enables use of a
!           custom instruction with encoding N when generating code that
!           uses INSN.  Similarly, `no-custom-INSN' locally inhibits use
!           of the custom instruction INSN.  These target attributes
!           correspond to the `-mcustom-INSN=N' and `-mno-custom-INSN'
!           command-line options, and support the same set of INSN
!           keywords.  *Note Nios II Options::, for more information.
  
!     `custom-fpu-cfg=NAME'
!           This attribute corresponds to the `-mcustom-fpu-cfg=NAME'
            command-line option, to select a predefined set of custom
            instructions named NAME.  *Note Nios II Options::, for more
            information.
--- 26214,26553 ----
            void f () __attribute__ ((interrupt_handler,
                                      sp_switch ("alt_stack")));
  
! 'stdcall'
!      On x86-32 targets, the 'stdcall' attribute causes the compiler to
       assume that the called function pops off the stack space used to
       pass arguments, unless it takes a variable number of arguments.
  
! 'syscall_linkage'
       This attribute is used to modify the IA-64 calling convention by
       marking all input registers as live at all function exits.  This
       makes it possible to restart a system call after an interrupt
       without having to save/restore the input registers.  This also
       prevents kernel data from leaking into application code.
  
! 'target'
!      The 'target' attribute is used to specify that a function is to be
       compiled with different target options than specified on the
       command line.  This can be used for instance to have functions
       compiled with a different ISA (instruction set architecture) than
!      the default.  You can also use the '#pragma GCC target' pragma to
       set more than one function to be compiled with specific target
       options.  *Note Function Specific Option Pragmas::, for details
!      about the '#pragma GCC target' pragma.
  
       For instance on an x86, you could compile one function with
!      'target("sse4.1,arch=core2")' and another with
!      'target("sse4a,arch=amdfam10")'.  This is equivalent to compiling
!      the first function with '-msse4.1' and '-march=core2' options, and
!      the second function with '-msse4a' and '-march=amdfam10' options.
       It is up to the user to make sure that a function is only invoked
       on a machine that supports the particular ISA it is compiled for
!      (for example by using 'cpuid' on x86 to determine what feature bits
!      and architecture family are used).
  
            int core2_func (void) __attribute__ ((__target__ ("arch=core2")));
            int sse3_func (void) __attribute__ ((__target__ ("sse3")));
  
!      You can either use multiple strings to specify multiple options, or
!      separate the options with a comma (',').
  
!      The 'target' attribute is presently implemented for x86, PowerPC,
       and Nios II targets only.  The options supported are specific to
       each target.
  
       On the x86, the following options are allowed:
  
!      'abm'
!      'no-abm'
            Enable/disable the generation of the advanced bit
            instructions.
  
!      'aes'
!      'no-aes'
            Enable/disable the generation of the AES instructions.
  
!      'default'
            *Note Function Multiversioning::, where it is used to specify
            the default function version.
  
!      'mmx'
!      'no-mmx'
            Enable/disable the generation of the MMX instructions.
  
!      'pclmul'
!      'no-pclmul'
            Enable/disable the generation of the PCLMUL instructions.
  
!      'popcnt'
!      'no-popcnt'
            Enable/disable the generation of the POPCNT instruction.
  
!      'sse'
!      'no-sse'
            Enable/disable the generation of the SSE instructions.
  
!      'sse2'
!      'no-sse2'
            Enable/disable the generation of the SSE2 instructions.
  
!      'sse3'
!      'no-sse3'
            Enable/disable the generation of the SSE3 instructions.
  
!      'sse4'
!      'no-sse4'
            Enable/disable the generation of the SSE4 instructions (both
            SSE4.1 and SSE4.2).
  
!      'sse4.1'
!      'no-sse4.1'
            Enable/disable the generation of the sse4.1 instructions.
  
!      'sse4.2'
!      'no-sse4.2'
            Enable/disable the generation of the sse4.2 instructions.
  
!      'sse4a'
!      'no-sse4a'
            Enable/disable the generation of the SSE4A instructions.
  
!      'fma4'
!      'no-fma4'
            Enable/disable the generation of the FMA4 instructions.
  
!      'xop'
!      'no-xop'
            Enable/disable the generation of the XOP instructions.
  
!      'lwp'
!      'no-lwp'
            Enable/disable the generation of the LWP instructions.
  
!      'ssse3'
!      'no-ssse3'
            Enable/disable the generation of the SSSE3 instructions.
  
!      'cld'
!      'no-cld'
            Enable/disable the generation of the CLD before string moves.
  
!      'fancy-math-387'
!      'no-fancy-math-387'
!           Enable/disable the generation of the 'sin', 'cos', and 'sqrt'
            instructions on the 387 floating-point unit.
  
!      'fused-madd'
!      'no-fused-madd'
            Enable/disable the generation of the fused multiply/add
            instructions.
  
!      'ieee-fp'
!      'no-ieee-fp'
            Enable/disable the generation of floating point that depends
            on IEEE arithmetic.
  
!      'inline-all-stringops'
!      'no-inline-all-stringops'
            Enable/disable inlining of string operations.
  
!      'inline-stringops-dynamically'
!      'no-inline-stringops-dynamically'
            Enable/disable the generation of the inline code to do small
            string operations and calling the library routines for large
            operations.
  
!      'align-stringops'
!      'no-align-stringops'
            Do/do not align destination of inlined string operations.
  
!      'recip'
!      'no-recip'
            Enable/disable the generation of RCPSS, RCPPS, RSQRTSS and
            RSQRTPS instructions followed an additional Newton-Raphson
            step instead of doing a floating-point division.
  
!      'arch=ARCH'
!           Specify the architecture to generate code for in compiling the
!           function.
  
!      'tune=TUNE'
            Specify the architecture to tune for in compiling the
            function.
  
!      'fpmath=FPMATH'
            Specify which floating-point unit to use.  The
!           'target("fpmath=sse,387")' option must be specified as
!           'target("fpmath=sse+387")' because the comma would separate
            different options.
  
       On the PowerPC, the following options are allowed:
  
!      'altivec'
!      'no-altivec'
            Generate code that uses (does not use) AltiVec instructions.
            In 32-bit code, you cannot enable AltiVec instructions unless
!           '-mabi=altivec' is used on the command line.
  
!      'cmpb'
!      'no-cmpb'
            Generate code that uses (does not use) the compare bytes
            instruction implemented on the POWER6 processor and other
            processors that support the PowerPC V2.05 architecture.
  
!      'dlmzb'
!      'no-dlmzb'
            Generate code that uses (does not use) the string-search
!           'dlmzb' instruction on the IBM 405, 440, 464 and 476
            processors.  This instruction is generated by default when
            targeting those processors.
  
!      'fprnd'
!      'no-fprnd'
            Generate code that uses (does not use) the FP round to integer
            instructions implemented on the POWER5+ processor and other
            processors that support the PowerPC V2.03 architecture.
  
!      'hard-dfp'
!      'no-hard-dfp'
            Generate code that uses (does not use) the decimal
            floating-point instructions implemented on some POWER
            processors.
  
!      'isel'
!      'no-isel'
            Generate code that uses (does not use) ISEL instruction.
  
!      'mfcrf'
!      'no-mfcrf'
            Generate code that uses (does not use) the move from condition
!           register field instruction implemented on the POWER4 processor
!           and other processors that support the PowerPC V2.01
            architecture.
  
!      'mfpgpr'
!      'no-mfpgpr'
            Generate code that uses (does not use) the FP move to/from
            general purpose register instructions implemented on the
            POWER6X processor and other processors that support the
            extended PowerPC V2.05 architecture.
  
!      'mulhw'
!      'no-mulhw'
            Generate code that uses (does not use) the half-word multiply
            and multiply-accumulate instructions on the IBM 405, 440, 464
            and 476 processors.  These instructions are generated by
            default when targeting those processors.
  
!      'multiple'
!      'no-multiple'
            Generate code that uses (does not use) the load multiple word
            instructions and the store multiple word instructions.
  
!      'update'
!      'no-update'
            Generate code that uses (does not use) the load or store
            instructions that update the base register to the address of
            the calculated memory location.
  
!      'popcntb'
!      'no-popcntb'
            Generate code that uses (does not use) the popcount and
            double-precision FP reciprocal estimate instruction
            implemented on the POWER5 processor and other processors that
            support the PowerPC V2.02 architecture.
  
!      'popcntd'
!      'no-popcntd'
            Generate code that uses (does not use) the popcount
            instruction implemented on the POWER7 processor and other
            processors that support the PowerPC V2.06 architecture.
  
!      'powerpc-gfxopt'
!      'no-powerpc-gfxopt'
            Generate code that uses (does not use) the optional PowerPC
            architecture instructions in the Graphics group, including
            floating-point select.
  
!      'powerpc-gpopt'
!      'no-powerpc-gpopt'
            Generate code that uses (does not use) the optional PowerPC
            architecture instructions in the General Purpose group,
            including floating-point square root.
  
!      'recip-precision'
!      'no-recip-precision'
            Assume (do not assume) that the reciprocal estimate
            instructions provide higher-precision estimates than is
            mandated by the PowerPC ABI.
  
!      'string'
!      'no-string'
            Generate code that uses (does not use) the load string
            instructions and the store string word instructions to save
            multiple registers and do small block moves.
  
!      'vsx'
!      'no-vsx'
            Generate code that uses (does not use) vector/scalar (VSX)
            instructions, and also enable the use of built-in functions
            that allow more direct access to the VSX instruction set.  In
            32-bit code, you cannot enable VSX or AltiVec instructions
!           unless '-mabi=altivec' is used on the command line.
  
!      'friz'
!      'no-friz'
!           Generate (do not generate) the 'friz' instruction when the
!           '-funsafe-math-optimizations' option is used to optimize
            rounding a floating-point value to 64-bit integer and back to
!           floating point.  The 'friz' instruction does not return the
!           same value if the floating-point number is too large to fit in
!           an integer.
  
!      'avoid-indexed-addresses'
!      'no-avoid-indexed-addresses'
            Generate code that tries to avoid (not avoid) the use of
            indexed load or store instructions.
  
!      'paired'
!      'no-paired'
            Generate code that uses (does not use) the generation of
            PAIRED simd instructions.
  
!      'longcall'
!      'no-longcall'
            Generate code that assumes (does not assume) that all calls
            are far away so that a longer more expensive calling sequence
            is required.
  
!      'cpu=CPU'
            Specify the architecture to generate code for when compiling
!           the function.  If you select the 'target("cpu=power7")'
            attribute when generating 32-bit code, VSX and AltiVec
            instructions are not generated unless you use the
!           '-mabi=altivec' option on the command line.
  
!      'tune=TUNE'
            Specify the architecture to tune for when compiling the
!           function.  If you do not specify the 'target("tune=TUNE")'
!           attribute and you do specify the 'target("cpu=CPU")'
!           attribute, compilation tunes for the CPU architecture, and not
!           the default tuning specified on the command line.
  
       When compiling for Nios II, the following options are allowed:
  
!      'custom-INSN=N'
!      'no-custom-INSN'
!           Each 'custom-INSN=N' attribute locally enables use of a custom
!           instruction with encoding N when generating code that uses
!           INSN.  Similarly, 'no-custom-INSN' locally inhibits use of the
!           custom instruction INSN.  These target attributes correspond
!           to the '-mcustom-INSN=N' and '-mno-custom-INSN' command-line
!           options, and support the same set of INSN keywords.  *Note
!           Nios II Options::, for more information.
  
!      'custom-fpu-cfg=NAME'
!           This attribute corresponds to the '-mcustom-fpu-cfg=NAME'
            command-line option, to select a predefined set of custom
            instructions named NAME.  *Note Nios II Options::, for more
            information.
*************** attributes.
*** 26736,26776 ****
       On the x86 and PowerPC back ends, the inliner does not inline a
       function that has different target options than the caller, unless
       the callee has a subset of the target options of the caller.  For
!      example a function declared with `target("sse3")' can inline a
!      function with `target("sse2")', since `-msse3' implies `-msse2'.
  
! `trap_exit'
!      Use this attribute on the SH for an `interrupt_handler' to return
!      using `trapa' instead of `rte'.  This attribute expects an integer
       argument specifying the trap number to be used.
  
! `trapa_handler'
       On SH targets this function attribute is similar to
!      `interrupt_handler' but it does not save and restore all registers.
  
! `unused'
       This attribute, attached to a function, means that the function is
       meant to be possibly unused.  GCC does not produce a warning for
       this function.
  
! `used'
       This attribute, attached to a function, means that code must be
       emitted for the function even if it appears that the function is
       not referenced.  This is useful, for example, when the function is
       referenced only in inline assembly.
  
       When applied to a member function of a C++ class template, the
!      attribute also means that the function is instantiated if the
!      class itself is instantiated.
  
! `vector'
!      This RX attribute is similar to the `interrupt' attribute,
       including its parameters, but does not make the function an
!      interrupt-handler type function (i.e. it retains the normal C
!      function calling ABI).  See the `interrupt' attribute for a
       description of its arguments.
  
! `version_id'
       This IA-64 HP-UX attribute, attached to a global variable or
       function, renames a symbol to contain a version string, thus
       allowing for function level versioning.  HP-UX system header files
--- 26555,26595 ----
       On the x86 and PowerPC back ends, the inliner does not inline a
       function that has different target options than the caller, unless
       the callee has a subset of the target options of the caller.  For
!      example a function declared with 'target("sse3")' can inline a
!      function with 'target("sse2")', since '-msse3' implies '-msse2'.
  
! 'trap_exit'
!      Use this attribute on the SH for an 'interrupt_handler' to return
!      using 'trapa' instead of 'rte'.  This attribute expects an integer
       argument specifying the trap number to be used.
  
! 'trapa_handler'
       On SH targets this function attribute is similar to
!      'interrupt_handler' but it does not save and restore all registers.
  
! 'unused'
       This attribute, attached to a function, means that the function is
       meant to be possibly unused.  GCC does not produce a warning for
       this function.
  
! 'used'
       This attribute, attached to a function, means that code must be
       emitted for the function even if it appears that the function is
       not referenced.  This is useful, for example, when the function is
       referenced only in inline assembly.
  
       When applied to a member function of a C++ class template, the
!      attribute also means that the function is instantiated if the class
!      itself is instantiated.
  
! 'vector'
!      This RX attribute is similar to the 'interrupt' attribute,
       including its parameters, but does not make the function an
!      interrupt-handler type function (i.e.  it retains the normal C
!      function calling ABI). See the 'interrupt' attribute for a
       description of its arguments.
  
! 'version_id'
       This IA-64 HP-UX attribute, attached to a global variable or
       function, renames a symbol to contain a version string, thus
       allowing for function level versioning.  HP-UX system header files
*************** attributes.
*** 26780,26786 ****
  
       Calls to FOO are mapped to calls to FOO{20040821}.
  
! `visibility ("VISIBILITY_TYPE")'
       This attribute affects the linkage of the declaration to which it
       is attached.  There are four supported VISIBILITY_TYPE values:
       default, hidden, protected or internal visibility.
--- 26599,26605 ----
  
       Calls to FOO are mapped to calls to FOO{20040821}.
  
! 'visibility ("VISIBILITY_TYPE")'
       This attribute affects the linkage of the declaration to which it
       is attached.  There are four supported VISIBILITY_TYPE values:
       default, hidden, protected or internal visibility.
*************** attributes.
*** 26789,26798 ****
            f () { /* Do something. */; }
            int i __attribute__ ((visibility ("hidden")));
  
!      The possible values of VISIBILITY_TYPE correspond to the
!      visibility settings in the ELF gABI.
  
!     "default"
            Default visibility is the normal case for the object file
            format.  This value is available for the visibility attribute
            to override other options that may change the assumed
--- 26608,26617 ----
            f () { /* Do something. */; }
            int i __attribute__ ((visibility ("hidden")));
  
!      The possible values of VISIBILITY_TYPE correspond to the visibility
!      settings in the ELF gABI.
  
!      "default"
            Default visibility is the normal case for the object file
            format.  This value is available for the visibility attribute
            to override other options that may change the assumed
*************** attributes.
*** 26808,26840 ****
            Default visibility corresponds to "external linkage" in the
            language.
  
!     "hidden"
            Hidden visibility indicates that the entity declared has a new
            form of linkage, which we call "hidden linkage".  Two
            declarations of an object with hidden linkage refer to the
            same object if they are in the same shared object.
  
!     "internal"
            Internal visibility is like hidden visibility, but with
            additional processor specific semantics.  Unless otherwise
            specified by the psABI, GCC defines internal visibility to
            mean that a function is _never_ called from another module.
!           Compare this with hidden functions which, while they cannot
!           be referenced directly by other modules, can be referenced
            indirectly via function pointers.  By indicating that a
!           function cannot be called from outside the module, GCC may
!           for instance omit the load of a PIC register since it is known
            that the calling function loaded the correct value.
  
!     "protected"
            Protected visibility is like default visibility except that it
            indicates that references within the defining module bind to
            the definition in that module.  That is, the declared entity
            cannot be overridden by another module.
  
- 
       All visibilities are supported on many, but not all, ELF targets
!      (supported when the assembler supports the `.visibility'
       pseudo-op).  Default visibility is supported everywhere.  Hidden
       visibility is supported on Darwin targets.
  
--- 26627,26658 ----
            Default visibility corresponds to "external linkage" in the
            language.
  
!      "hidden"
            Hidden visibility indicates that the entity declared has a new
            form of linkage, which we call "hidden linkage".  Two
            declarations of an object with hidden linkage refer to the
            same object if they are in the same shared object.
  
!      "internal"
            Internal visibility is like hidden visibility, but with
            additional processor specific semantics.  Unless otherwise
            specified by the psABI, GCC defines internal visibility to
            mean that a function is _never_ called from another module.
!           Compare this with hidden functions which, while they cannot be
!           referenced directly by other modules, can be referenced
            indirectly via function pointers.  By indicating that a
!           function cannot be called from outside the module, GCC may for
!           instance omit the load of a PIC register since it is known
            that the calling function loaded the correct value.
  
!      "protected"
            Protected visibility is like default visibility except that it
            indicates that references within the defining module bind to
            the definition in that module.  That is, the declared entity
            cannot be overridden by another module.
  
       All visibilities are supported on many, but not all, ELF targets
!      (supported when the assembler supports the '.visibility'
       pseudo-op).  Default visibility is supported everywhere.  Hidden
       visibility is supported on Darwin targets.
  
*************** attributes.
*** 26866,26872 ****
  
       This attribute applies only to the particular namespace body, not
       to other definitions of the same namespace; it is equivalent to
!      using `#pragma GCC visibility' before and after the namespace
       definition (*note Visibility Pragmas::).
  
       In C++, if a template argument has limited visibility, this
--- 26684,26690 ----
  
       This attribute applies only to the particular namespace body, not
       to other definitions of the same namespace; it is equivalent to
!      using '#pragma GCC visibility' before and after the namespace
       definition (*note Visibility Pragmas::).
  
       In C++, if a template argument has limited visibility, this
*************** attributes.
*** 26877,26894 ****
       If both the template and enclosing class have explicit visibility,
       the visibility from the template is used.
  
! `vliw'
!      On MeP, the `vliw' attribute tells the compiler to emit
       instructions in VLIW mode instead of core mode.  Note that this
       attribute is not allowed unless a VLIW coprocessor has been
       configured and enabled through command-line options.
  
! `warn_unused_result'
!      The `warn_unused_result' attribute causes a warning to be emitted
       if a caller of the function with this attribute does not use its
       return value.  This is useful for functions where not checking the
       result is either a security problem or always a bug, such as
!      `realloc'.
  
            int fn () __attribute__ ((warn_unused_result));
            int foo ()
--- 26695,26712 ----
       If both the template and enclosing class have explicit visibility,
       the visibility from the template is used.
  
! 'vliw'
!      On MeP, the 'vliw' attribute tells the compiler to emit
       instructions in VLIW mode instead of core mode.  Note that this
       attribute is not allowed unless a VLIW coprocessor has been
       configured and enabled through command-line options.
  
! 'warn_unused_result'
!      The 'warn_unused_result' attribute causes a warning to be emitted
       if a caller of the function with this attribute does not use its
       return value.  This is useful for functions where not checking the
       result is either a security problem or always a bug, such as
!      'realloc'.
  
            int fn () __attribute__ ((warn_unused_result));
            int foo ()
*************** attributes.
*** 26900,26922 ****
  
       results in warning on line 5.
  
! `weak'
!      The `weak' attribute causes the declaration to be emitted as a weak
       symbol rather than a global.  This is primarily useful in defining
       library functions that can be overridden in user code, though it
       can also be used with non-function declarations.  Weak symbols are
       supported for ELF targets, and also for a.out targets when using
       the GNU assembler and linker.
  
! `weakref'
! `weakref ("TARGET")'
!      The `weakref' attribute marks a declaration as a weak reference.
!      Without arguments, it should be accompanied by an `alias' attribute
       naming the target symbol.  Optionally, the TARGET may be given as
!      an argument to `weakref' itself.  In either case, `weakref'
!      implicitly marks the declaration as `weak'.  Without a TARGET,
!      given as an argument to `weakref' or to `alias', `weakref' is
!      equivalent to `weak'.
  
            static int x() __attribute__ ((weakref ("y")));
            /* is equivalent to... */
--- 26718,26740 ----
  
       results in warning on line 5.
  
! 'weak'
!      The 'weak' attribute causes the declaration to be emitted as a weak
       symbol rather than a global.  This is primarily useful in defining
       library functions that can be overridden in user code, though it
       can also be used with non-function declarations.  Weak symbols are
       supported for ELF targets, and also for a.out targets when using
       the GNU assembler and linker.
  
! 'weakref'
! 'weakref ("TARGET")'
!      The 'weakref' attribute marks a declaration as a weak reference.
!      Without arguments, it should be accompanied by an 'alias' attribute
       naming the target symbol.  Optionally, the TARGET may be given as
!      an argument to 'weakref' itself.  In either case, 'weakref'
!      implicitly marks the declaration as 'weak'.  Without a TARGET,
!      given as an argument to 'weakref' or to 'alias', 'weakref' is
!      equivalent to 'weak'.
  
            static int x() __attribute__ ((weakref ("y")));
            /* is equivalent to... */
*************** attributes.
*** 26926,26934 ****
            static int x() __attribute__ ((alias ("y")));
  
       A weak reference is an alias that does not by itself require a
!      definition to be given for the target symbol.  If the target
!      symbol is only referenced through weak references, then it becomes
!      a `weak' undefined symbol.  If it is directly referenced, however,
       then such strong references prevail, and a definition is required
       for the symbol, not necessarily in the same translation unit.
  
--- 26744,26752 ----
            static int x() __attribute__ ((alias ("y")));
  
       A weak reference is an alias that does not by itself require a
!      definition to be given for the target symbol.  If the target symbol
!      is only referenced through weak references, then it becomes a
!      'weak' undefined symbol.  If it is directly referenced, however,
       then such strong references prevail, and a definition is required
       for the symbol, not necessarily in the same translation unit.
  
*************** attributes.
*** 26937,26970 ****
       symbol, declaring it as weak, compiling the two separate
       translation units and performing a reloadable link on them.
  
!      At present, a declaration to which `weakref' is attached can only
!      be `static'.
! 
  
   You can specify multiple attributes in a declaration by separating them
  by commas within the double parentheses or by immediately following an
  attribute declaration with another attribute declaration.
  
!  Some people object to the `__attribute__' feature, suggesting that ISO
! C's `#pragma' should be used instead.  At the time `__attribute__' was
  designed, there were two reasons for not doing this.
  
!   1. It is impossible to generate `#pragma' commands from a macro.
  
!   2. There is no telling what the same `#pragma' might mean in another
       compiler.
  
   These two reasons applied to almost any application that might have
! been proposed for `#pragma'.  It was basically a mistake to use
! `#pragma' for _anything_.
  
!  The ISO C99 standard includes `_Pragma', which now allows pragmas to
! be generated from macros.  In addition, a `#pragma GCC' namespace is
! now in use for GCC-specific pragmas.  However, it has been found
! convenient to use `__attribute__' to achieve a natural attachment of
! attributes to their corresponding declarations, whereas `#pragma GCC'
! is of use for constructs that do not naturally form part of the
! grammar.  *Note Pragmas Accepted by GCC: Pragmas.
  
  
  File: gcc.info,  Node: Label Attributes,  Next: Attribute Syntax,  Prev: Function Attributes,  Up: C Extensions
--- 26755,26787 ----
       symbol, declaring it as weak, compiling the two separate
       translation units and performing a reloadable link on them.
  
!      At present, a declaration to which 'weakref' is attached can only
!      be 'static'.
  
   You can specify multiple attributes in a declaration by separating them
  by commas within the double parentheses or by immediately following an
  attribute declaration with another attribute declaration.
  
!  Some people object to the '__attribute__' feature, suggesting that ISO
! C's '#pragma' should be used instead.  At the time '__attribute__' was
  designed, there were two reasons for not doing this.
  
!   1. It is impossible to generate '#pragma' commands from a macro.
  
!   2. There is no telling what the same '#pragma' might mean in another
       compiler.
  
   These two reasons applied to almost any application that might have
! been proposed for '#pragma'.  It was basically a mistake to use
! '#pragma' for _anything_.
  
!  The ISO C99 standard includes '_Pragma', which now allows pragmas to be
! generated from macros.  In addition, a '#pragma GCC' namespace is now in
! use for GCC-specific pragmas.  However, it has been found convenient to
! use '__attribute__' to achieve a natural attachment of attributes to
! their corresponding declarations, whereas '#pragma GCC' is of use for
! constructs that do not naturally form part of the grammar.  *Note
! Pragmas Accepted by GCC: Pragmas.
  
  
  File: gcc.info,  Node: Label Attributes,  Next: Attribute Syntax,  Prev: Function Attributes,  Up: C Extensions
*************** for details of the exact syntax for usin
*** 26977,26985 ****
  are available for functions (*note Function Attributes::), variables
  (*note Variable Attributes::) and for types (*note Type Attributes::).
  
!  This example uses the `cold' label attribute to indicate the
! `ErrorHandling' branch is unlikely to be taken and that the
! `ErrorHandling' label is unused:
  
  
          asm goto ("some asm" : : : : NoError);
--- 26794,26802 ----
  are available for functions (*note Function Attributes::), variables
  (*note Variable Attributes::) and for types (*note Type Attributes::).
  
!  This example uses the 'cold' label attribute to indicate the
! 'ErrorHandling' branch is unlikely to be taken and that the
! 'ErrorHandling' label is unused:
  
  
          asm goto ("some asm" : : : : NoError);
*************** are available for functions (*note Funct
*** 26994,27019 ****
          printf("no error\n");
          return 1;
  
! `unused'
       This feature is intended for program-generated code that may
!      contain unused labels, but which is compiled with `-Wall'.  It is
       not normally appropriate to use in it human-written code, though it
       could be useful in cases where the code that jumps to the label is
!      contained within an `#ifdef' conditional.
  
! `hot'
!      The `hot' attribute on a label is used to inform the compiler that
!      the path following the label is more likely than paths that are
!      not so annotated.  This attribute is used in cases where
!      `__builtin_expect' cannot be used, for instance with computed goto
!      or `asm goto'.
  
! `cold'
!      The `cold' attribute on labels is used to inform the compiler that
       the path following the label is unlikely to be executed.  This
!      attribute is used in cases where `__builtin_expect' cannot be
!      used, for instance with computed goto or `asm goto'.
! 
  
  
  File: gcc.info,  Node: Attribute Syntax,  Next: Function Prototypes,  Prev: Label Attributes,  Up: C Extensions
--- 26811,26835 ----
          printf("no error\n");
          return 1;
  
! 'unused'
       This feature is intended for program-generated code that may
!      contain unused labels, but which is compiled with '-Wall'.  It is
       not normally appropriate to use in it human-written code, though it
       could be useful in cases where the code that jumps to the label is
!      contained within an '#ifdef' conditional.
  
! 'hot'
!      The 'hot' attribute on a label is used to inform the compiler that
!      the path following the label is more likely than paths that are not
!      so annotated.  This attribute is used in cases where
!      '__builtin_expect' cannot be used, for instance with computed goto
!      or 'asm goto'.
  
! 'cold'
!      The 'cold' attribute on labels is used to inform the compiler that
       the path following the label is unlikely to be executed.  This
!      attribute is used in cases where '__builtin_expect' cannot be used,
!      for instance with computed goto or 'asm goto'.
  
  
  File: gcc.info,  Node: Attribute Syntax,  Next: Function Prototypes,  Prev: Label Attributes,  Up: C Extensions
*************** File: gcc.info,  Node: Attribute Syntax,
*** 27021,27027 ****
  6.33 Attribute Syntax
  =====================
  
! This section describes the syntax with which `__attribute__' may be
  used, and the constructs to which attribute specifiers bind, for the C
  language.  Some details may vary for C++ and Objective-C.  Because of
  infelicities in the grammar for attributes, some forms described here
--- 26837,26843 ----
  6.33 Attribute Syntax
  =====================
  
! This section describes the syntax with which '__attribute__' may be
  used, and the constructs to which attribute specifiers bind, for the C
  language.  Some details may vary for C++ and Objective-C.  Because of
  infelicities in the grammar for attributes, some forms described here
*************** may not be successfully parsed in all ca
*** 27030,27037 ****
   There are some problems with the semantics of attributes in C++.  For
  example, there are no manglings for attributes, although they may affect
  code generation, so problems may arise when attributed types are used in
! conjunction with templates or overloading.  Similarly, `typeid' does
! not distinguish between types with different attributes.  Support for
  attributes in C++ may be restricted in future to attributes on
  declarations only, but not on nested declarators.
  
--- 26846,26853 ----
   There are some problems with the semantics of attributes in C++.  For
  example, there are no manglings for attributes, although they may affect
  code generation, so problems may arise when attributed types are used in
! conjunction with templates or overloading.  Similarly, 'typeid' does not
! distinguish between types with different attributes.  Support for
  attributes in C++ may be restricted in future to attributes on
  declarations only, but not on nested declarators.
  
*************** for details of the semantics of attribut
*** 27042,27069 ****
  and enumerated types.  *Note Label Attributes::, for details of the
  semantics of attributes applying to labels.
  
!  An "attribute specifier" is of the form `__attribute__
  ((ATTRIBUTE-LIST))'.  An "attribute list" is a possibly empty
! comma-separated sequence of "attributes", where each attribute is one
! of the following:
  
     * Empty.  Empty attributes are ignored.
  
!    * A word (which may be an identifier such as `unused', or a reserved
!      word such as `const').
  
     * A word, followed by, in parentheses, parameters for the attribute.
       These parameters take one of the following forms:
  
!         * An identifier.  For example, `mode' attributes use this form.
  
          * An identifier followed by a comma and a non-empty
!           comma-separated list of expressions.  For example, `format'
            attributes use this form.
  
          * A possibly empty comma-separated list of expressions.  For
!           example, `format_arg' attributes use this form with the list
!           being a single integer constant expression, and `alias'
            attributes use this form with the list being a single string
            constant.
  
--- 26858,26885 ----
  and enumerated types.  *Note Label Attributes::, for details of the
  semantics of attributes applying to labels.
  
!  An "attribute specifier" is of the form '__attribute__
  ((ATTRIBUTE-LIST))'.  An "attribute list" is a possibly empty
! comma-separated sequence of "attributes", where each attribute is one of
! the following:
  
     * Empty.  Empty attributes are ignored.
  
!    * A word (which may be an identifier such as 'unused', or a reserved
!      word such as 'const').
  
     * A word, followed by, in parentheses, parameters for the attribute.
       These parameters take one of the following forms:
  
!         * An identifier.  For example, 'mode' attributes use this form.
  
          * An identifier followed by a comma and a non-empty
!           comma-separated list of expressions.  For example, 'format'
            attributes use this form.
  
          * A possibly empty comma-separated list of expressions.  For
!           example, 'format_arg' attributes use this form with the list
!           being a single integer constant expression, and 'alias'
            attributes use this form with the list being a single string
            constant.
  
*************** Label Attributes
*** 27074,27093 ****
  ................
  
  In GNU C, an attribute specifier list may appear after the colon
! following a label, other than a `case' or `default' label.  GNU C++
! only permits attributes on labels if the attribute specifier is
! immediately followed by a semicolon (i.e., the label applies to an empty
! statement).  If the semicolon is missing, C++ label attributes are
! ambiguous, as it is permissible for a declaration, which could begin
! with an attribute list, to be labelled in C++.  Declarations cannot be
! labelled in C90 or C99, so the ambiguity does not arise there.
  
  Type Attributes
  ...............
  
! An attribute specifier list may appear as part of a `struct', `union'
! or `enum' specifier.  It may go either immediately after the `struct',
! `union' or `enum' keyword, or after the closing brace.  The former
  syntax is preferred.  Where attribute specifiers follow the closing
  brace, they are considered to relate to the structure, union or
  enumerated type defined, not to any enclosing declaration the type
--- 26890,26909 ----
  ................
  
  In GNU C, an attribute specifier list may appear after the colon
! following a label, other than a 'case' or 'default' label.  GNU C++ only
! permits attributes on labels if the attribute specifier is immediately
! followed by a semicolon (i.e., the label applies to an empty statement).
! If the semicolon is missing, C++ label attributes are ambiguous, as it
! is permissible for a declaration, which could begin with an attribute
! list, to be labelled in C++.  Declarations cannot be labelled in C90 or
! C99, so the ambiguity does not arise there.
  
  Type Attributes
  ...............
  
! An attribute specifier list may appear as part of a 'struct', 'union' or
! 'enum' specifier.  It may go either immediately after the 'struct',
! 'union' or 'enum' keyword, or after the closing brace.  The former
  syntax is preferred.  Where attribute specifiers follow the closing
  brace, they are considered to relate to the structure, union or
  enumerated type defined, not to any enclosing declaration the type
*************** contain attribute specifiers, whether or
*** 27112,27132 ****
  context contain storage class specifiers.  (Some attributes, however,
  are essentially in the nature of storage class specifiers, and only make
  sense where storage class specifiers may be used; for example,
! `section'.)  There is one necessary limitation to this syntax: the
! first old-style parameter declaration in a function definition cannot
! begin with an attribute specifier, because such an attribute applies to
! the function instead by syntax described below (which, however, is not
! yet implemented in this case).  In some other cases, attribute
! specifiers are permitted by this grammar but not yet supported by the
! compiler.  All attribute specifiers in this place relate to the
! declaration as a whole.  In the obsolescent usage where a type of `int'
! is implied by the absence of type specifiers, such a list of specifiers
! and qualifiers may be an attribute specifier list with no other
! specifiers or qualifiers.
  
   At present, the first parameter in a function prototype must have some
  type specifier that is not an attribute specifier; this resolves an
! ambiguity in the interpretation of `void f(int (__attribute__((foo))
  x))', but is subject to change.  At present, if the parentheses of a
  function declarator contain only attributes then those attributes are
  ignored, rather than yielding an error or warning or implying a single
--- 26928,26947 ----
  context contain storage class specifiers.  (Some attributes, however,
  are essentially in the nature of storage class specifiers, and only make
  sense where storage class specifiers may be used; for example,
! 'section'.)  There is one necessary limitation to this syntax: the first
! old-style parameter declaration in a function definition cannot begin
! with an attribute specifier, because such an attribute applies to the
! function instead by syntax described below (which, however, is not yet
! implemented in this case).  In some other cases, attribute specifiers
! are permitted by this grammar but not yet supported by the compiler.
! All attribute specifiers in this place relate to the declaration as a
! whole.  In the obsolescent usage where a type of 'int' is implied by the
! absence of type specifiers, such a list of specifiers and qualifiers may
! be an attribute specifier list with no other specifiers or qualifiers.
  
   At present, the first parameter in a function prototype must have some
  type specifier that is not an attribute specifier; this resolves an
! ambiguity in the interpretation of 'void f(int (__attribute__((foo))
  x))', but is subject to change.  At present, if the parentheses of a
  function declarator contain only attributes then those attributes are
  ignored, rather than yielding an error or warning or implying a single
*************** identifier before whose declarator they
*** 27142,27163 ****
           __attribute__((format(printf, 1, 2))) d1 (const char *, ...),
            d2 (void);
  
! the `noreturn' attribute applies to all the functions declared; the
! `format' attribute only applies to `d1'.
  
   An attribute specifier list may appear immediately before the comma,
! `=' or semicolon terminating the declaration of an identifier other
! than a function definition.  Such attribute specifiers apply to the
! declared object or function.  Where an assembler name for an object or
! function is specified (*note Asm Labels::), the attribute must follow
! the `asm' specification.
  
   An attribute specifier list may, in future, be permitted to appear
  after the declarator in a function definition (before any old-style
  parameter declarations or the function body).
  
   Attribute specifiers may be mixed with type qualifiers appearing inside
! the `[]' of a parameter array declarator, in the C99 construct by which
  such qualifiers are applied to the pointer to which the array is
  implicitly converted.  Such attribute specifiers apply to the pointer,
  not to the array, but at present this is not implemented and they are
--- 26957,26978 ----
           __attribute__((format(printf, 1, 2))) d1 (const char *, ...),
            d2 (void);
  
! the 'noreturn' attribute applies to all the functions declared; the
! 'format' attribute only applies to 'd1'.
  
   An attribute specifier list may appear immediately before the comma,
! '=' or semicolon terminating the declaration of an identifier other than
! a function definition.  Such attribute specifiers apply to the declared
! object or function.  Where an assembler name for an object or function
! is specified (*note Asm Labels::), the attribute must follow the 'asm'
! specification.
  
   An attribute specifier list may, in future, be permitted to appear
  after the declarator in a function definition (before any old-style
  parameter declarations or the function body).
  
   Attribute specifiers may be mixed with type qualifiers appearing inside
! the '[]' of a parameter array declarator, in the C99 construct by which
  such qualifiers are applied to the pointer to which the array is
  implicitly converted.  Such attribute specifiers apply to the pointer,
  not to the array, but at present this is not implemented and they are
*************** ignored.
*** 27167,27193 ****
  declarator.  At present, there are some limitations in this usage: the
  attributes correctly apply to the declarator, but for most individual
  attributes the semantics this implies are not implemented.  When
! attribute specifiers follow the `*' of a pointer declarator, they may
! be mixed with any type qualifiers present.  The following describes the
  formal semantics of this syntax.  It makes the most sense if you are
  familiar with the formal specification of declarators in the ISO C
  standard.
  
!  Consider (as in C99 subclause 6.7.5 paragraph 4) a declaration `T D1',
! where `T' contains declaration specifiers that specify a type TYPE
! (such as `int') and `D1' is a declarator that contains an identifier
! IDENT.  The type specified for IDENT for derived declarators whose type
! does not include an attribute specifier is as in the ISO C standard.
  
!  If `D1' has the form `( ATTRIBUTE-SPECIFIER-LIST D )', and the
! declaration `T D' specifies the type "DERIVED-DECLARATOR-TYPE-LIST
! TYPE" for IDENT, then `T D1' specifies the type
! "DERIVED-DECLARATOR-TYPE-LIST ATTRIBUTE-SPECIFIER-LIST TYPE" for IDENT.
  
!  If `D1' has the form `* TYPE-QUALIFIER-AND-ATTRIBUTE-SPECIFIER-LIST
! D', and the declaration `T D' specifies the type
! "DERIVED-DECLARATOR-TYPE-LIST TYPE" for IDENT, then `T D1' specifies
! the type "DERIVED-DECLARATOR-TYPE-LIST
  TYPE-QUALIFIER-AND-ATTRIBUTE-SPECIFIER-LIST pointer to TYPE" for IDENT.
  
   For example,
--- 26982,27008 ----
  declarator.  At present, there are some limitations in this usage: the
  attributes correctly apply to the declarator, but for most individual
  attributes the semantics this implies are not implemented.  When
! attribute specifiers follow the '*' of a pointer declarator, they may be
! mixed with any type qualifiers present.  The following describes the
  formal semantics of this syntax.  It makes the most sense if you are
  familiar with the formal specification of declarators in the ISO C
  standard.
  
!  Consider (as in C99 subclause 6.7.5 paragraph 4) a declaration 'T D1',
! where 'T' contains declaration specifiers that specify a type TYPE (such
! as 'int') and 'D1' is a declarator that contains an identifier IDENT.
! The type specified for IDENT for derived declarators whose type does not
! include an attribute specifier is as in the ISO C standard.
  
!  If 'D1' has the form '( ATTRIBUTE-SPECIFIER-LIST D )', and the
! declaration 'T D' specifies the type "DERIVED-DECLARATOR-TYPE-LIST TYPE"
! for IDENT, then 'T D1' specifies the type "DERIVED-DECLARATOR-TYPE-LIST
! ATTRIBUTE-SPECIFIER-LIST TYPE" for IDENT.
  
!  If 'D1' has the form '* TYPE-QUALIFIER-AND-ATTRIBUTE-SPECIFIER-LIST D',
! and the declaration 'T D' specifies the type
! "DERIVED-DECLARATOR-TYPE-LIST TYPE" for IDENT, then 'T D1' specifies the
! type "DERIVED-DECLARATOR-TYPE-LIST
  TYPE-QUALIFIER-AND-ATTRIBUTE-SPECIFIER-LIST pointer to TYPE" for IDENT.
  
   For example,
*************** TYPE-QUALIFIER-AND-ATTRIBUTE-SPECIFIER-L
*** 27195,27207 ****
       void (__attribute__((noreturn)) ****f) (void);
  
  specifies the type "pointer to pointer to pointer to pointer to
! non-returning function returning `void'".  As another example,
  
       char *__attribute__((aligned(8))) *f;
  
! specifies the type "pointer to 8-byte-aligned pointer to `char'".  Note
  again that this does not work with most attributes; for example, the
! usage of `aligned' and `noreturn' attributes given above is not yet
  supported.
  
   For compatibility with existing code written for compiler versions that
--- 27010,27022 ----
       void (__attribute__((noreturn)) ****f) (void);
  
  specifies the type "pointer to pointer to pointer to pointer to
! non-returning function returning 'void'".  As another example,
  
       char *__attribute__((aligned(8))) *f;
  
! specifies the type "pointer to 8-byte-aligned pointer to 'char'".  Note
  again that this does not work with most attributes; for example, the
! usage of 'aligned' and 'noreturn' attributes given above is not yet
  supported.
  
   For compatibility with existing code written for compiler versions that
*************** the attributes immediately before the id
*** 27215,27222 ****
  attribute applied to a function return type is treated as applying to
  the function type, and such an attribute applied to an array element
  type is treated as applying to the array type.  If an attribute that
! only applies to function types is applied to a pointer-to-function
! type, it is treated as applying to the pointer target type; if such an
  attribute is applied to a function return type that is not a
  pointer-to-function type, it is treated as applying to the function
  type.
--- 27030,27037 ----
  attribute applied to a function return type is treated as applying to
  the function type, and such an attribute applied to an array element
  type is treated as applying to the array type.  If an attribute that
! only applies to function types is applied to a pointer-to-function type,
! it is treated as applying to the pointer target type; if such an
  attribute is applied to a function return type that is not a
  pointer-to-function type, it is treated as applying to the function
  type.
*************** old-style non-prototype definition.  Con
*** 27248,27268 ****
         return x == 0;
       }
  
!  Suppose the type `uid_t' happens to be `short'.  ISO C does not allow
  this example, because subword arguments in old-style non-prototype
  definitions are promoted.  Therefore in this example the function
! definition's argument is really an `int', which does not match the
! prototype argument type of `short'.
  
   This restriction of ISO C makes it hard to write code that is portable
! to traditional C compilers, because the programmer does not know
! whether the `uid_t' type is `short', `int', or `long'.  Therefore, in
! cases like these GNU C allows a prototype to override a later old-style
! definition.  More precisely, in GNU C, a function prototype argument
! type overrides the argument type specified by a later old-style
! definition if the former type is the same as the latter type before
! promotion.  Thus in GNU C the above example is equivalent to the
! following:
  
       int isroot (uid_t);
  
--- 27063,27082 ----
         return x == 0;
       }
  
!  Suppose the type 'uid_t' happens to be 'short'.  ISO C does not allow
  this example, because subword arguments in old-style non-prototype
  definitions are promoted.  Therefore in this example the function
! definition's argument is really an 'int', which does not match the
! prototype argument type of 'short'.
  
   This restriction of ISO C makes it hard to write code that is portable
! to traditional C compilers, because the programmer does not know whether
! the 'uid_t' type is 'short', 'int', or 'long'.  Therefore, in cases like
! these GNU C allows a prototype to override a later old-style definition.
! More precisely, in GNU C, a function prototype argument type overrides
! the argument type specified by a later old-style definition if the
! former type is the same as the latter type before promotion.  Thus in
! GNU C the above example is equivalent to the following:
  
       int isroot (uid_t);
  
*************** File: gcc.info,  Node: C++ Comments,  Ne
*** 27281,27292 ****
  6.35 C++ Style Comments
  =======================
  
! In GNU C, you may use C++ style comments, which start with `//' and
  continue until the end of the line.  Many other C implementations allow
  such comments, and they are included in the 1999 C standard.  However,
! C++ style comments are not recognized if you specify an `-std' option
! specifying a version of ISO C before C99, or `-ansi' (equivalent to
! `-std=c90').
  
  
  File: gcc.info,  Node: Dollar Signs,  Next: Character Escapes,  Prev: C++ Comments,  Up: C Extensions
--- 27095,27106 ----
  6.35 C++ Style Comments
  =======================
  
! In GNU C, you may use C++ style comments, which start with '//' and
  continue until the end of the line.  Many other C implementations allow
  such comments, and they are included in the 1999 C standard.  However,
! C++ style comments are not recognized if you specify an '-std' option
! specifying a version of ISO C before C99, or '-ansi' (equivalent to
! '-std=c90').
  
  
  File: gcc.info,  Node: Dollar Signs,  Next: Character Escapes,  Prev: C++ Comments,  Up: C Extensions
*************** File: gcc.info,  Node: Character Escapes
*** 27305,27312 ****
  6.37 The Character <ESC> in Constants
  =====================================
  
! You can use the sequence `\e' in a string or character constant to
! stand for the ASCII character <ESC>.
  
  
  File: gcc.info,  Node: Variable Attributes,  Next: Type Attributes,  Prev: Character Escapes,  Up: C Extensions
--- 27119,27126 ----
  6.37 The Character <ESC> in Constants
  =====================================
  
! You can use the sequence '\e' in a string or character constant to stand
! for the ASCII character <ESC>.
  
  
  File: gcc.info,  Node: Variable Attributes,  Next: Type Attributes,  Prev: Character Escapes,  Up: C Extensions
*************** File: gcc.info,  Node: Variable Attribut
*** 27314,27355 ****
  6.38 Specifying Attributes of Variables
  =======================================
  
! The keyword `__attribute__' allows you to specify special attributes of
! variables or structure fields.  This keyword is followed by an
! attribute specification inside double parentheses.  Some attributes are
! currently defined generically for variables.  Other attributes are
! defined for variables on particular target systems.  Other attributes
! are available for functions (*note Function Attributes::), labels
! (*note Label Attributes::) and for types (*note Type Attributes::).
! Other front ends might define more attributes (*note Extensions to the
! C++ Language: C++ Extensions.).
  
!  You may also specify attributes with `__' preceding and following each
  keyword.  This allows you to use them in header files without being
! concerned about a possible macro of the same name.  For example, you
! may use `__aligned__' instead of `aligned'.
  
   *Note Attribute Syntax::, for details of the exact syntax for using
  attributes.
  
! `aligned (ALIGNMENT)'
       This attribute specifies a minimum alignment for the variable or
       structure field, measured in bytes.  For example, the declaration:
  
            int x __attribute__ ((aligned (16))) = 0;
  
!      causes the compiler to allocate the global variable `x' on a
       16-byte boundary.  On a 68040, this could be used in conjunction
!      with an `asm' expression to access the `move16' instruction which
       requires 16-byte aligned operands.
  
       You can also specify the alignment of structure fields.  For
!      example, to create a double-word aligned `int' pair, you could
       write:
  
            struct foo { int x[2] __attribute__ ((aligned (8))); };
  
!      This is an alternative to creating a union with a `double' member,
       which forces the union to be double-word aligned.
  
       As in the preceding examples, you can explicitly specify the
--- 27128,27169 ----
  6.38 Specifying Attributes of Variables
  =======================================
  
! The keyword '__attribute__' allows you to specify special attributes of
! variables or structure fields.  This keyword is followed by an attribute
! specification inside double parentheses.  Some attributes are currently
! defined generically for variables.  Other attributes are defined for
! variables on particular target systems.  Other attributes are available
! for functions (*note Function Attributes::), labels (*note Label
! Attributes::) and for types (*note Type Attributes::).  Other front ends
! might define more attributes (*note Extensions to the C++ Language: C++
! Extensions.).
  
!  You may also specify attributes with '__' preceding and following each
  keyword.  This allows you to use them in header files without being
! concerned about a possible macro of the same name.  For example, you may
! use '__aligned__' instead of 'aligned'.
  
   *Note Attribute Syntax::, for details of the exact syntax for using
  attributes.
  
! 'aligned (ALIGNMENT)'
       This attribute specifies a minimum alignment for the variable or
       structure field, measured in bytes.  For example, the declaration:
  
            int x __attribute__ ((aligned (16))) = 0;
  
!      causes the compiler to allocate the global variable 'x' on a
       16-byte boundary.  On a 68040, this could be used in conjunction
!      with an 'asm' expression to access the 'move16' instruction which
       requires 16-byte aligned operands.
  
       You can also specify the alignment of structure fields.  For
!      example, to create a double-word aligned 'int' pair, you could
       write:
  
            struct foo { int x[2] __attribute__ ((aligned (8))); };
  
!      This is an alternative to creating a union with a 'double' member,
       which forces the union to be double-word aligned.
  
       As in the preceding examples, you can explicitly specify the
*************** attributes.
*** 27362,27368 ****
       supports vector operations.  The default alignment is fixed for a
       particular target ABI.
  
!      GCC also provides a target specific macro `__BIGGEST_ALIGNMENT__',
       which is the largest alignment ever used for any data type on the
       target machine you are compiling for.  For example, you could
       write:
--- 27176,27182 ----
       supports vector operations.  The default alignment is fixed for a
       particular target ABI.
  
!      GCC also provides a target specific macro '__BIGGEST_ALIGNMENT__',
       which is the largest alignment ever used for any data type on the
       target machine you are compiling for.  For example, you could
       write:
*************** attributes.
*** 27370,27429 ****
            short array[3] __attribute__ ((aligned (__BIGGEST_ALIGNMENT__)));
  
       The compiler automatically sets the alignment for the declared
!      variable or field to `__BIGGEST_ALIGNMENT__'.  Doing this can
!      often make copy operations more efficient, because the compiler can
!      use whatever instructions copy the biggest chunks of memory when
       performing copies to or from the variables or fields that you have
!      aligned this way.  Note that the value of `__BIGGEST_ALIGNMENT__'
       may change depending on command-line options.
  
!      When used on a struct, or struct member, the `aligned' attribute
       can only increase the alignment; in order to decrease it, the
!      `packed' attribute must be specified as well.  When used as part
!      of a typedef, the `aligned' attribute can both increase and
!      decrease alignment, and specifying the `packed' attribute
!      generates a warning.
  
!      Note that the effectiveness of `aligned' attributes may be limited
       by inherent limitations in your linker.  On many systems, the
       linker is only able to arrange for variables to be aligned up to a
       certain maximum alignment.  (For some linkers, the maximum
       supported alignment may be very very small.)  If your linker is
       only able to align variables up to a maximum of 8-byte alignment,
!      then specifying `aligned(16)' in an `__attribute__' still only
       provides you with 8-byte alignment.  See your linker documentation
       for further information.
  
!      The `aligned' attribute can also be used for functions (*note
       Function Attributes::.)
  
! `cleanup (CLEANUP_FUNCTION)'
!      The `cleanup' attribute runs a function when the variable goes out
       of scope.  This attribute can only be applied to auto function
       scope variables; it may not be applied to parameters or variables
       with static storage duration.  The function must take one
       parameter, a pointer to a type compatible with the variable.  The
       return value of the function (if any) is ignored.
  
!      If `-fexceptions' is enabled, then CLEANUP_FUNCTION is run during
       the stack unwinding that happens during the processing of the
!      exception.  Note that the `cleanup' attribute does not allow the
!      exception to be caught, only to perform an action.  It is
!      undefined what happens if CLEANUP_FUNCTION does not return
!      normally.
  
! `common'
! `nocommon'
!      The `common' attribute requests GCC to place a variable in
!      "common" storage.  The `nocommon' attribute requests the
!      opposite--to allocate space for it directly.
  
!      These attributes override the default chosen by the `-fno-common'
!      and `-fcommon' flags respectively.
  
! `deprecated'
! `deprecated (MSG)'
!      The `deprecated' attribute results in a warning if the variable is
       used anywhere in the source file.  This is useful when identifying
       variables that are expected to be removed in a future version of a
       program.  The warning also includes the location of the declaration
--- 27184,27242 ----
            short array[3] __attribute__ ((aligned (__BIGGEST_ALIGNMENT__)));
  
       The compiler automatically sets the alignment for the declared
!      variable or field to '__BIGGEST_ALIGNMENT__'.  Doing this can often
!      make copy operations more efficient, because the compiler can use
!      whatever instructions copy the biggest chunks of memory when
       performing copies to or from the variables or fields that you have
!      aligned this way.  Note that the value of '__BIGGEST_ALIGNMENT__'
       may change depending on command-line options.
  
!      When used on a struct, or struct member, the 'aligned' attribute
       can only increase the alignment; in order to decrease it, the
!      'packed' attribute must be specified as well.  When used as part of
!      a typedef, the 'aligned' attribute can both increase and decrease
!      alignment, and specifying the 'packed' attribute generates a
!      warning.
  
!      Note that the effectiveness of 'aligned' attributes may be limited
       by inherent limitations in your linker.  On many systems, the
       linker is only able to arrange for variables to be aligned up to a
       certain maximum alignment.  (For some linkers, the maximum
       supported alignment may be very very small.)  If your linker is
       only able to align variables up to a maximum of 8-byte alignment,
!      then specifying 'aligned(16)' in an '__attribute__' still only
       provides you with 8-byte alignment.  See your linker documentation
       for further information.
  
!      The 'aligned' attribute can also be used for functions (*note
       Function Attributes::.)
  
! 'cleanup (CLEANUP_FUNCTION)'
!      The 'cleanup' attribute runs a function when the variable goes out
       of scope.  This attribute can only be applied to auto function
       scope variables; it may not be applied to parameters or variables
       with static storage duration.  The function must take one
       parameter, a pointer to a type compatible with the variable.  The
       return value of the function (if any) is ignored.
  
!      If '-fexceptions' is enabled, then CLEANUP_FUNCTION is run during
       the stack unwinding that happens during the processing of the
!      exception.  Note that the 'cleanup' attribute does not allow the
!      exception to be caught, only to perform an action.  It is undefined
!      what happens if CLEANUP_FUNCTION does not return normally.
  
! 'common'
! 'nocommon'
!      The 'common' attribute requests GCC to place a variable in "common"
!      storage.  The 'nocommon' attribute requests the opposite--to
!      allocate space for it directly.
  
!      These attributes override the default chosen by the '-fno-common'
!      and '-fcommon' flags respectively.
  
! 'deprecated'
! 'deprecated (MSG)'
!      The 'deprecated' attribute results in a warning if the variable is
       used anywhere in the source file.  This is useful when identifying
       variables that are expected to be removed in a future version of a
       program.  The warning also includes the location of the declaration
*************** attributes.
*** 27439,27466 ****
       argument, which must be a string, is printed in the warning if
       present.
  
!      The `deprecated' attribute can also be used for functions and
!      types (*note Function Attributes::, *note Type Attributes::.)
  
! `mode (MODE)'
       This attribute specifies the data type for the
       declaration--whichever type corresponds to the mode MODE.  This in
!      effect lets you request an integer or floating-point type
!      according to its width.
  
!      You may also specify a mode of `byte' or `__byte__' to indicate
!      the mode corresponding to a one-byte integer, `word' or `__word__'
!      for the mode of a one-word integer, and `pointer' or `__pointer__'
!      for the mode used to represent pointers.
  
! `packed'
!      The `packed' attribute specifies that a variable or structure field
       should have the smallest possible alignment--one byte for a
       variable, and one bit for a field, unless you specify a larger
!      value with the `aligned' attribute.
  
!      Here is a structure in which the field `x' is packed, so that it
!      immediately follows `a':
  
            struct foo
            {
--- 27252,27279 ----
       argument, which must be a string, is printed in the warning if
       present.
  
!      The 'deprecated' attribute can also be used for functions and types
!      (*note Function Attributes::, *note Type Attributes::.)
  
! 'mode (MODE)'
       This attribute specifies the data type for the
       declaration--whichever type corresponds to the mode MODE.  This in
!      effect lets you request an integer or floating-point type according
!      to its width.
  
!      You may also specify a mode of 'byte' or '__byte__' to indicate the
!      mode corresponding to a one-byte integer, 'word' or '__word__' for
!      the mode of a one-word integer, and 'pointer' or '__pointer__' for
!      the mode used to represent pointers.
  
! 'packed'
!      The 'packed' attribute specifies that a variable or structure field
       should have the smallest possible alignment--one byte for a
       variable, and one bit for a field, unless you specify a larger
!      value with the 'aligned' attribute.
  
!      Here is a structure in which the field 'x' is packed, so that it
!      immediately follows 'a':
  
            struct foo
            {
*************** attributes.
*** 27468,27485 ****
              int x[2] __attribute__ ((packed));
            };
  
!      _Note:_ The 4.1, 4.2 and 4.3 series of GCC ignore the `packed'
!      attribute on bit-fields of type `char'.  This has been fixed in
!      GCC 4.4 but the change can lead to differences in the structure
!      layout.  See the documentation of `-Wpacked-bitfield-compat' for
!      more information.
  
! `section ("SECTION-NAME")'
       Normally, the compiler places the objects it generates in sections
!      like `data' and `bss'.  Sometimes, however, you need additional
       sections, or you need certain particular variables to appear in
       special sections, for example to map to special hardware.  The
!      `section' attribute specifies that a variable (or function) lives
       in a particular section.  For example, this small program uses
       several specific section names:
  
--- 27281,27298 ----
              int x[2] __attribute__ ((packed));
            };
  
!      _Note:_ The 4.1, 4.2 and 4.3 series of GCC ignore the 'packed'
!      attribute on bit-fields of type 'char'.  This has been fixed in GCC
!      4.4 but the change can lead to differences in the structure layout.
!      See the documentation of '-Wpacked-bitfield-compat' for more
!      information.
  
! 'section ("SECTION-NAME")'
       Normally, the compiler places the objects it generates in sections
!      like 'data' and 'bss'.  Sometimes, however, you need additional
       sections, or you need certain particular variables to appear in
       special sections, for example to map to special hardware.  The
!      'section' attribute specifies that a variable (or function) lives
       in a particular section.  For example, this small program uses
       several specific section names:
  
*************** attributes.
*** 27501,27530 ****
              init_duart (&b);
            }
  
!      Use the `section' attribute with _global_ variables and not
!      _local_ variables, as shown in the example.
  
!      You may use the `section' attribute with initialized or
       uninitialized global variables but the linker requires each object
       be defined once, with the exception that uninitialized variables
!      tentatively go in the `common' (or `bss') section and can be
!      multiply "defined".  Using the `section' attribute changes what
!      section the variable goes into and may cause the linker to issue
!      an error if an uninitialized variable has multiple definitions.
!      You can force a variable to be initialized with the `-fno-common'
!      flag or the `nocommon' attribute.
  
       Some file formats do not support arbitrary sections so the
!      `section' attribute is not available on all platforms.  If you
!      need to map the entire contents of a module to a particular
!      section, consider using the facilities of the linker instead.
  
! `shared'
       On Microsoft Windows, in addition to putting variable definitions
       in a named section, the section can also be shared among all
       running copies of an executable or DLL.  For example, this small
       program defines shared data by putting it in a named section
!      `shared' and marking the section shareable:
  
            int foo __attribute__((section ("shared"), shared)) = 0;
  
--- 27314,27343 ----
              init_duart (&b);
            }
  
!      Use the 'section' attribute with _global_ variables and not _local_
!      variables, as shown in the example.
  
!      You may use the 'section' attribute with initialized or
       uninitialized global variables but the linker requires each object
       be defined once, with the exception that uninitialized variables
!      tentatively go in the 'common' (or 'bss') section and can be
!      multiply "defined".  Using the 'section' attribute changes what
!      section the variable goes into and may cause the linker to issue an
!      error if an uninitialized variable has multiple definitions.  You
!      can force a variable to be initialized with the '-fno-common' flag
!      or the 'nocommon' attribute.
  
       Some file formats do not support arbitrary sections so the
!      'section' attribute is not available on all platforms.  If you need
!      to map the entire contents of a module to a particular section,
!      consider using the facilities of the linker instead.
  
! 'shared'
       On Microsoft Windows, in addition to putting variable definitions
       in a named section, the section can also be shared among all
       running copies of an executable or DLL.  For example, this small
       program defines shared data by putting it in a named section
!      'shared' and marking the section shareable:
  
            int foo __attribute__((section ("shared"), shared)) = 0;
  
*************** attributes.
*** 27536,27563 ****
              return 0;
            }
  
!      You may only use the `shared' attribute along with `section'
!      attribute with a fully-initialized global definition because of
!      the way linkers work.  See `section' attribute for more
!      information.
  
!      The `shared' attribute is only available on Microsoft Windows.
  
! `tls_model ("TLS_MODEL")'
!      The `tls_model' attribute sets thread-local storage model (*note
!      Thread-Local::) of a particular `__thread' variable, overriding
!      `-ftls-model=' command-line switch on a per-variable basis.  The
!      TLS_MODEL argument should be one of `global-dynamic',
!      `local-dynamic', `initial-exec' or `local-exec'.
  
       Not all targets support this attribute.
  
! `unused'
       This attribute, attached to a variable, means that the variable is
       meant to be possibly unused.  GCC does not produce a warning for
       this variable.
  
! `used'
       This attribute, attached to a variable with static storage, means
       that the variable must be emitted even if it appears that the
       variable is not referenced.
--- 27349,27375 ----
              return 0;
            }
  
!      You may only use the 'shared' attribute along with 'section'
!      attribute with a fully-initialized global definition because of the
!      way linkers work.  See 'section' attribute for more information.
  
!      The 'shared' attribute is only available on Microsoft Windows.
  
! 'tls_model ("TLS_MODEL")'
!      The 'tls_model' attribute sets thread-local storage model (*note
!      Thread-Local::) of a particular '__thread' variable, overriding
!      '-ftls-model=' command-line switch on a per-variable basis.  The
!      TLS_MODEL argument should be one of 'global-dynamic',
!      'local-dynamic', 'initial-exec' or 'local-exec'.
  
       Not all targets support this attribute.
  
! 'unused'
       This attribute, attached to a variable, means that the variable is
       meant to be possibly unused.  GCC does not produce a warning for
       this variable.
  
! 'used'
       This attribute, attached to a variable with static storage, means
       that the variable must be emitted even if it appears that the
       variable is not referenced.
*************** attributes.
*** 27566,27597 ****
       attribute also means that the member is instantiated if the class
       itself is instantiated.
  
! `vector_size (BYTES)'
!      This attribute specifies the vector size for the variable,
!      measured in bytes.  For example, the declaration:
  
            int foo __attribute__ ((vector_size (16)));
  
!      causes the compiler to set the mode for `foo', to be 16 bytes,
!      divided into `int' sized units.  Assuming a 32-bit int (a vector of
!      4 units of 4 bytes), the corresponding mode of `foo' is V4SI.
  
       This attribute is only applicable to integral and float scalars,
       although arrays, pointers, and function return values are allowed
       in conjunction with this construct.
  
!      Aggregates with this attribute are invalid, even if they are of
!      the same size as a corresponding scalar.  For example, the
!      declaration:
  
            struct S { int a; };
            struct S  __attribute__ ((vector_size (16))) foo;
  
       is invalid even if the size of the structure is the same as the
!      size of the `int'.
  
! `selectany'
!      The `selectany' attribute causes an initialized global variable to
       have link-once semantics.  When multiple definitions of the
       variable are encountered by the linker, the first is selected and
       the remainder are discarded.  Following usage by the Microsoft
--- 27378,27408 ----
       attribute also means that the member is instantiated if the class
       itself is instantiated.
  
! 'vector_size (BYTES)'
!      This attribute specifies the vector size for the variable, measured
!      in bytes.  For example, the declaration:
  
            int foo __attribute__ ((vector_size (16)));
  
!      causes the compiler to set the mode for 'foo', to be 16 bytes,
!      divided into 'int' sized units.  Assuming a 32-bit int (a vector of
!      4 units of 4 bytes), the corresponding mode of 'foo' is V4SI.
  
       This attribute is only applicable to integral and float scalars,
       although arrays, pointers, and function return values are allowed
       in conjunction with this construct.
  
!      Aggregates with this attribute are invalid, even if they are of the
!      same size as a corresponding scalar.  For example, the declaration:
  
            struct S { int a; };
            struct S  __attribute__ ((vector_size (16))) foo;
  
       is invalid even if the size of the structure is the same as the
!      size of the 'int'.
  
! 'selectany'
!      The 'selectany' attribute causes an initialized global variable to
       have link-once semantics.  When multiple definitions of the
       variable are encountered by the linker, the first is selected and
       the remainder are discarded.  Following usage by the Microsoft
*************** attributes.
*** 27606,27644 ****
       constructor and destructor are protected by a link-once guard
       variable.
  
!      The `selectany' attribute is only available on Microsoft Windows
!      targets.  You can use `__declspec (selectany)' as a synonym for
!      `__attribute__ ((selectany))' for compatibility with other
       compilers.
  
! `weak'
!      The `weak' attribute is described in *note Function Attributes::.
  
! `dllimport'
!      The `dllimport' attribute is described in *note Function
       Attributes::.
  
! `dllexport'
!      The `dllexport' attribute is described in *note Function
       Attributes::.
  
- 
  6.38.1 AVR Variable Attributes
  ------------------------------
  
! `progmem'
!      The `progmem' attribute is used on the AVR to place read-only data
!      in the non-volatile program memory (flash). The `progmem'
       attribute accomplishes this by putting respective variables into a
!      section whose name starts with `.progmem'.
  
!      This attribute works similar to the `section' attribute but adds
!      additional checking. Notice that just like the `section'
!      attribute, `progmem' affects the location of the data but not how
       this data is accessed.
  
!      In order to read data located with the `progmem' attribute
!      (inline) assembler must be used.
            /* Use custom macros from AVR-LibC (http://nongnu.org/avr-libc/user-manual/) */
            #include <avr/pgmspace.h>
  
--- 27417,27454 ----
       constructor and destructor are protected by a link-once guard
       variable.
  
!      The 'selectany' attribute is only available on Microsoft Windows
!      targets.  You can use '__declspec (selectany)' as a synonym for
!      '__attribute__ ((selectany))' for compatibility with other
       compilers.
  
! 'weak'
!      The 'weak' attribute is described in *note Function Attributes::.
  
! 'dllimport'
!      The 'dllimport' attribute is described in *note Function
       Attributes::.
  
! 'dllexport'
!      The 'dllexport' attribute is described in *note Function
       Attributes::.
  
  6.38.1 AVR Variable Attributes
  ------------------------------
  
! 'progmem'
!      The 'progmem' attribute is used on the AVR to place read-only data
!      in the non-volatile program memory (flash).  The 'progmem'
       attribute accomplishes this by putting respective variables into a
!      section whose name starts with '.progmem'.
  
!      This attribute works similar to the 'section' attribute but adds
!      additional checking.  Notice that just like the 'section'
!      attribute, 'progmem' affects the location of the data but not how
       this data is accessed.
  
!      In order to read data located with the 'progmem' attribute (inline)
!      assembler must be used.
            /* Use custom macros from AVR-LibC (http://nongnu.org/avr-libc/user-manual/) */
            #include <avr/pgmspace.h>
  
*************** attributes.
*** 27657,27668 ****
       See also the *note AVR Named Address Spaces:: section for an
       alternate way to locate and access data in flash memory.
  
! `io'
! `io (ADDR)'
!      Variables with the `io' attribute are used to address
!      memory-mapped peripherals in the io address range.  If an address
!      is specified, the variable is assigned that address, and the value
!      is interpreted as an address in the data address space.  Example:
  
            volatile int porta __attribute__((io (0x22)));
  
--- 27467,27478 ----
       See also the *note AVR Named Address Spaces:: section for an
       alternate way to locate and access data in flash memory.
  
! 'io'
! 'io (ADDR)'
!      Variables with the 'io' attribute are used to address memory-mapped
!      peripherals in the io address range.  If an address is specified,
!      the variable is assigned that address, and the value is interpreted
!      as an address in the data address space.  Example:
  
            volatile int porta __attribute__((io (0x22)));
  
*************** attributes.
*** 27675,27857 ****
  
            extern volatile int porta __attribute__((io));
  
! `io_low'
! `io_low (ADDR)'
!      This is like the `io' attribute, but additionally it informs the
       compiler that the object lies in the lower half of the I/O area,
!      allowing the use of `cbi', `sbi', `sbic' and `sbis' instructions.
  
! `address'
! `address (ADDR)'
!      Variables with the `address' attribute are used to address
       memory-mapped peripherals that may lie outside the io address
       range.
  
            volatile int porta __attribute__((address (0x600)));
  
- 
  6.38.2 Blackfin Variable Attributes
  -----------------------------------
  
  Three attributes are currently defined for the Blackfin.
  
! `l1_data'
! `l1_data_A'
! `l1_data_B'
       Use these attributes on the Blackfin to place the variable into L1
!      Data SRAM.  Variables with `l1_data' attribute are put into the
!      specific section named `.l1.data'. Those with `l1_data_A'
!      attribute are put into the specific section named `.l1.data.A'.
!      Those with `l1_data_B' attribute are put into the specific section
!      named `.l1.data.B'.
  
! `l2'
       Use this attribute on the Blackfin to place the variable into L2
!      SRAM.  Variables with `l2' attribute are put into the specific
!      section named `.l2.data'.
  
  6.38.3 H8/300 Variable Attributes
  ---------------------------------
  
  These variable attributes are available for H8/300 targets:
  
! `eightbit_data'
!      Use this attribute on the H8/300, H8/300H, and H8S to indicate
!      that the specified variable should be placed into the eight-bit
!      data section.  The compiler generates more efficient code for
!      certain operations on data in the eight-bit data area.  Note the
!      eight-bit data area is limited to 256 bytes of data.
  
       You must use GAS and GLD from GNU binutils version 2.7 or later for
       this attribute to work correctly.
  
! `tiny_data'
       Use this attribute on the H8/300H and H8S to indicate that the
       specified variable should be placed into the tiny data section.
       The compiler generates more efficient code for loads and stores on
       data in the tiny data section.  Note the tiny data area is limited
       to slightly under 32KB of data.
  
- 
  6.38.4 IA-64 Variable Attributes
  --------------------------------
  
  The IA-64 back end supports the following variable attribute:
  
! `model (MODEL-NAME)'
       On IA-64, use this attribute to set the addressability of an
       object.  At present, the only supported identifier for MODEL-NAME
!      is `small', indicating addressability via "small" (22-bit)
!      addresses (so that their addresses can be loaded with the `addl'
       instruction).  Caveat: such addressing is by definition not
       position independent and hence this attribute must not be used for
       objects defined by shared libraries.
  
- 
  6.38.5 M32R/D Variable Attributes
  ---------------------------------
  
  One attribute is currently defined for the M32R/D.
  
! `model (MODEL-NAME)'
       Use this attribute on the M32R/D to set the addressability of an
!      object.  The identifier MODEL-NAME is one of `small', `medium', or
!      `large', representing each of the code models.
  
       Small model objects live in the lower 16MB of memory (so that their
!      addresses can be loaded with the `ld24' instruction).
  
       Medium and large model objects may live anywhere in the 32-bit
!      address space (the compiler generates `seth/add3' instructions to
       load their addresses).
  
  6.38.6 MeP Variable Attributes
  ------------------------------
  
! The MeP target has a number of addressing modes and busses.  The `near'
  space spans the standard memory space's first 16 megabytes (24 bits).
! The `far' space spans the entire 32-bit memory space.  The `based'
! space is a 128-byte region in the memory space that is addressed
! relative to the `$tp' register.  The `tiny' space is a 65536-byte
! region relative to the `$gp' register.  In addition to these memory
! regions, the MeP target has a separate 16-bit control bus which is
! specified with `cb' attributes.
  
! `based'
!      Any variable with the `based' attribute is assigned to the
!      `.based' section, and is accessed with relative to the `$tp'
!      register.
  
! `tiny'
!      Likewise, the `tiny' attribute assigned variables to the `.tiny'
!      section, relative to the `$gp' register.
  
! `near'
!      Variables with the `near' attribute are assumed to have addresses
       that fit in a 24-bit addressing mode.  This is the default for
!      large variables (`-mtiny=4' is the default) but this attribute can
!      override `-mtiny=' for small variables, or override `-ml'.
  
! `far'
!      Variables with the `far' attribute are addressed using a full
       32-bit address.  Since this covers the entire memory space, this
       allows modules to make no assumptions about where variables might
       be stored.
  
! `io'
! `io (ADDR)'
!      Variables with the `io' attribute are used to address
!      memory-mapped peripherals.  If an address is specified, the
!      variable is assigned that address, else it is not assigned an
!      address (it is assumed some other module assigns an address).
!      Example:
  
            int timer_count __attribute__((io(0x123)));
  
! `cb'
! `cb (ADDR)'
!      Variables with the `cb' attribute are used to access the control
!      bus, using special instructions.  `addr' indicates the control bus
       address.  Example:
  
            int cpu_clock __attribute__((cb(0x123)));
  
- 
  6.38.7 PowerPC Variable Attributes
  ----------------------------------
  
  Three attributes currently are defined for PowerPC configurations:
! `altivec', `ms_struct' and `gcc_struct'.
  
   For full documentation of the struct attributes please see the
  documentation in *note x86 Variable Attributes::.
  
!  For documentation of `altivec' attribute please see the documentation
  in *note PowerPC Type Attributes::.
  
  6.38.8 SPU Variable Attributes
  ------------------------------
  
! The SPU supports the `spu_vector' attribute for variables.  For
  documentation of this attribute please see the documentation in *note
  SPU Type Attributes::.
  
  6.38.9 x86 Variable Attributes
  ------------------------------
  
! Two attributes are currently defined for x86 configurations:
! `ms_struct' and `gcc_struct'.
  
! `ms_struct'
! `gcc_struct'
!      If `packed' is used on a structure, or if bit-fields are used, it
       may be that the Microsoft ABI lays out the structure differently
       than the way GCC normally does.  Particularly when moving packed
       data between functions compiled with GCC and the native Microsoft
!      compiler (either via function call or as data in a file), it may
!      be necessary to access either format.
  
!      Currently `-m[no-]ms-bitfields' is provided for the Microsoft
       Windows x86 compilers to match the native Microsoft compiler.
  
       The Microsoft structure layout algorithm is fairly simple with the
--- 27485,27663 ----
  
            extern volatile int porta __attribute__((io));
  
! 'io_low'
! 'io_low (ADDR)'
!      This is like the 'io' attribute, but additionally it informs the
       compiler that the object lies in the lower half of the I/O area,
!      allowing the use of 'cbi', 'sbi', 'sbic' and 'sbis' instructions.
  
! 'address'
! 'address (ADDR)'
!      Variables with the 'address' attribute are used to address
       memory-mapped peripherals that may lie outside the io address
       range.
  
            volatile int porta __attribute__((address (0x600)));
  
  6.38.2 Blackfin Variable Attributes
  -----------------------------------
  
  Three attributes are currently defined for the Blackfin.
  
! 'l1_data'
! 'l1_data_A'
! 'l1_data_B'
       Use these attributes on the Blackfin to place the variable into L1
!      Data SRAM. Variables with 'l1_data' attribute are put into the
!      specific section named '.l1.data'.  Those with 'l1_data_A'
!      attribute are put into the specific section named '.l1.data.A'.
!      Those with 'l1_data_B' attribute are put into the specific section
!      named '.l1.data.B'.
  
! 'l2'
       Use this attribute on the Blackfin to place the variable into L2
!      SRAM. Variables with 'l2' attribute are put into the specific
!      section named '.l2.data'.
  
  6.38.3 H8/300 Variable Attributes
  ---------------------------------
  
  These variable attributes are available for H8/300 targets:
  
! 'eightbit_data'
!      Use this attribute on the H8/300, H8/300H, and H8S to indicate that
!      the specified variable should be placed into the eight-bit data
!      section.  The compiler generates more efficient code for certain
!      operations on data in the eight-bit data area.  Note the eight-bit
!      data area is limited to 256 bytes of data.
  
       You must use GAS and GLD from GNU binutils version 2.7 or later for
       this attribute to work correctly.
  
! 'tiny_data'
       Use this attribute on the H8/300H and H8S to indicate that the
       specified variable should be placed into the tiny data section.
       The compiler generates more efficient code for loads and stores on
       data in the tiny data section.  Note the tiny data area is limited
       to slightly under 32KB of data.
  
  6.38.4 IA-64 Variable Attributes
  --------------------------------
  
  The IA-64 back end supports the following variable attribute:
  
! 'model (MODEL-NAME)'
! 
       On IA-64, use this attribute to set the addressability of an
       object.  At present, the only supported identifier for MODEL-NAME
!      is 'small', indicating addressability via "small" (22-bit)
!      addresses (so that their addresses can be loaded with the 'addl'
       instruction).  Caveat: such addressing is by definition not
       position independent and hence this attribute must not be used for
       objects defined by shared libraries.
  
  6.38.5 M32R/D Variable Attributes
  ---------------------------------
  
  One attribute is currently defined for the M32R/D.
  
! 'model (MODEL-NAME)'
       Use this attribute on the M32R/D to set the addressability of an
!      object.  The identifier MODEL-NAME is one of 'small', 'medium', or
!      'large', representing each of the code models.
  
       Small model objects live in the lower 16MB of memory (so that their
!      addresses can be loaded with the 'ld24' instruction).
  
       Medium and large model objects may live anywhere in the 32-bit
!      address space (the compiler generates 'seth/add3' instructions to
       load their addresses).
  
  6.38.6 MeP Variable Attributes
  ------------------------------
  
! The MeP target has a number of addressing modes and busses.  The 'near'
  space spans the standard memory space's first 16 megabytes (24 bits).
! The 'far' space spans the entire 32-bit memory space.  The 'based' space
! is a 128-byte region in the memory space that is addressed relative to
! the '$tp' register.  The 'tiny' space is a 65536-byte region relative to
! the '$gp' register.  In addition to these memory regions, the MeP target
! has a separate 16-bit control bus which is specified with 'cb'
! attributes.
  
! 'based'
!      Any variable with the 'based' attribute is assigned to the '.based'
!      section, and is accessed with relative to the '$tp' register.
  
! 'tiny'
!      Likewise, the 'tiny' attribute assigned variables to the '.tiny'
!      section, relative to the '$gp' register.
  
! 'near'
!      Variables with the 'near' attribute are assumed to have addresses
       that fit in a 24-bit addressing mode.  This is the default for
!      large variables ('-mtiny=4' is the default) but this attribute can
!      override '-mtiny=' for small variables, or override '-ml'.
  
! 'far'
!      Variables with the 'far' attribute are addressed using a full
       32-bit address.  Since this covers the entire memory space, this
       allows modules to make no assumptions about where variables might
       be stored.
  
! 'io'
! 'io (ADDR)'
!      Variables with the 'io' attribute are used to address memory-mapped
!      peripherals.  If an address is specified, the variable is assigned
!      that address, else it is not assigned an address (it is assumed
!      some other module assigns an address).  Example:
  
            int timer_count __attribute__((io(0x123)));
  
! 'cb'
! 'cb (ADDR)'
!      Variables with the 'cb' attribute are used to access the control
!      bus, using special instructions.  'addr' indicates the control bus
       address.  Example:
  
            int cpu_clock __attribute__((cb(0x123)));
  
  6.38.7 PowerPC Variable Attributes
  ----------------------------------
  
  Three attributes currently are defined for PowerPC configurations:
! 'altivec', 'ms_struct' and 'gcc_struct'.
  
   For full documentation of the struct attributes please see the
  documentation in *note x86 Variable Attributes::.
  
!  For documentation of 'altivec' attribute please see the documentation
  in *note PowerPC Type Attributes::.
  
  6.38.8 SPU Variable Attributes
  ------------------------------
  
! The SPU supports the 'spu_vector' attribute for variables.  For
  documentation of this attribute please see the documentation in *note
  SPU Type Attributes::.
  
  6.38.9 x86 Variable Attributes
  ------------------------------
  
! Two attributes are currently defined for x86 configurations: 'ms_struct'
! and 'gcc_struct'.
  
! 'ms_struct'
! 'gcc_struct'
! 
!      If 'packed' is used on a structure, or if bit-fields are used, it
       may be that the Microsoft ABI lays out the structure differently
       than the way GCC normally does.  Particularly when moving packed
       data between functions compiled with GCC and the native Microsoft
!      compiler (either via function call or as data in a file), it may be
!      necessary to access either format.
  
!      Currently '-m[no-]ms-bitfields' is provided for the Microsoft
       Windows x86 compilers to match the native Microsoft compiler.
  
       The Microsoft structure layout algorithm is fairly simple with the
*************** Two attributes are currently defined for
*** 27863,27884 ****
            which they are declared: the first member has the lowest
            memory address and the last member the highest.
  
!        2. Every data object has an alignment requirement.  The
!           alignment requirement for all data except structures, unions,
!           and arrays is either the size of the object or the current
!           packing size (specified with either the `aligned' attribute
!           or the `pack' pragma), whichever is less.  For structures,
!           unions, and arrays, the alignment requirement is the largest
!           alignment requirement of its members.  Every object is
!           allocated an offset so that:
  
                 offset % alignment_requirement == 0
  
!        3. Adjacent bit-fields are packed into the same 1-, 2-, or
!           4-byte allocation unit if the integral types are the same
!           size and if the next bit-field fits into the current
!           allocation unit without crossing the boundary imposed by the
!           common alignment requirements of the bit-fields.
  
       MSVC interprets zero-length bit-fields in the following ways:
  
--- 27669,27690 ----
            which they are declared: the first member has the lowest
            memory address and the last member the highest.
  
!        2. Every data object has an alignment requirement.  The alignment
!           requirement for all data except structures, unions, and arrays
!           is either the size of the object or the current packing size
!           (specified with either the 'aligned' attribute or the 'pack'
!           pragma), whichever is less.  For structures, unions, and
!           arrays, the alignment requirement is the largest alignment
!           requirement of its members.  Every object is allocated an
!           offset so that:
  
                 offset % alignment_requirement == 0
  
!        3. Adjacent bit-fields are packed into the same 1-, 2-, or 4-byte
!           allocation unit if the integral types are the same size and if
!           the next bit-field fits into the current allocation unit
!           without crossing the boundary imposed by the common alignment
!           requirements of the bit-fields.
  
       MSVC interprets zero-length bit-fields in the following ways:
  
*************** Two attributes are currently defined for
*** 27894,27906 ****
                    unsigned long bf_2 : 12;
                  } t1;
  
!           The size of `t1' is 8 bytes with the zero-length bit-field.
!           If the zero-length bit-field were removed, `t1''s size would
            be 4 bytes.
  
         2. If a zero-length bit-field is inserted after a bit-field,
!           `foo', and the alignment of the zero-length bit-field is
!           greater than the member that follows it, `bar', `bar' is
            aligned as the type of the zero-length bit-field.
  
            For example:
--- 27700,27712 ----
                    unsigned long bf_2 : 12;
                  } t1;
  
!           The size of 't1' is 8 bytes with the zero-length bit-field.
!           If the zero-length bit-field were removed, 't1''s size would
            be 4 bytes.
  
         2. If a zero-length bit-field is inserted after a bit-field,
!           'foo', and the alignment of the zero-length bit-field is
!           greater than the member that follows it, 'bar', 'bar' is
            aligned as the type of the zero-length bit-field.
  
            For example:
*************** Two attributes are currently defined for
*** 27919,27927 ****
                    double bar;
                  } t3;
  
!           For `t2', `bar' is placed at offset 2, rather than offset 1.
!           Accordingly, the size of `t2' is 4.  For `t3', the zero-length
!           bit-field does not affect the alignment of `bar' or, as a
            result, the size of the structure.
  
            Taking this into account, it is important to note the
--- 27725,27733 ----
                    double bar;
                  } t3;
  
!           For 't2', 'bar' is placed at offset 2, rather than offset 1.
!           Accordingly, the size of 't2' is 4.  For 't3', the zero-length
!           bit-field does not affect the alignment of 'bar' or, as a
            result, the size of the structure.
  
            Taking this into account, it is important to note the
*************** Two attributes are currently defined for
*** 27929,27935 ****
  
              1. If a zero-length bit-field follows a normal bit-field,
                 the type of the zero-length bit-field may affect the
!                alignment of the structure as whole. For example, `t2'
                 has a size of 4 bytes, since the zero-length bit-field
                 follows a normal bit-field, and is of type short.
  
--- 27735,27741 ----
  
              1. If a zero-length bit-field follows a normal bit-field,
                 the type of the zero-length bit-field may affect the
!                alignment of the structure as whole.  For example, 't2'
                 has a size of 4 bytes, since the zero-length bit-field
                 follows a normal bit-field, and is of type short.
  
*************** Two attributes are currently defined for
*** 27943,27949 ****
                         long : 0;
                       } t4;
  
!                Here, `t4' takes up 4 bytes.
  
         3. Zero-length bit-fields following non-bit-field members are
            ignored:
--- 27749,27755 ----
                         long : 0;
                       } t4;
  
!                Here, 't4' takes up 4 bytes.
  
         3. Zero-length bit-fields following non-bit-field members are
            ignored:
*************** Two attributes are currently defined for
*** 27955,27975 ****
                    char bar;
                  } t5;
  
!           Here, `t5' takes up 2 bytes.
  
  6.38.10 Xstormy16 Variable Attributes
  -------------------------------------
  
  One attribute is currently defined for xstormy16 configurations:
! `below100'.
  
! `below100'
!      If a variable has the `below100' attribute (`BELOW100' is allowed
!      also), GCC places the variable in the first 0x100 bytes of memory
!      and use special opcodes to access it.  Such variables are placed
!      in either the `.bss_below100' section or the `.data_below100'
!      section.
  
  
  
  File: gcc.info,  Node: Type Attributes,  Next: Alignment,  Prev: Variable Attributes,  Up: C Extensions
--- 27761,27780 ----
                    char bar;
                  } t5;
  
!           Here, 't5' takes up 2 bytes.
  
  6.38.10 Xstormy16 Variable Attributes
  -------------------------------------
  
  One attribute is currently defined for xstormy16 configurations:
! 'below100'.
  
! 'below100'
  
+      If a variable has the 'below100' attribute ('BELOW100' is allowed
+      also), GCC places the variable in the first 0x100 bytes of memory
+      and use special opcodes to access it.  Such variables are placed in
+      either the '.bss_below100' section or the '.data_below100' section.
  
  
  File: gcc.info,  Node: Type Attributes,  Next: Alignment,  Prev: Variable Attributes,  Up: C Extensions
*************** File: gcc.info,  Node: Type Attributes,
*** 27977,27998 ****
  6.39 Specifying Attributes of Types
  ===================================
  
! The keyword `__attribute__' allows you to specify special attributes of
! `struct' and `union' types when you define such types.  This keyword is
! followed by an attribute specification inside double parentheses.
! Eight attributes are currently defined for types: `aligned', `packed',
! `transparent_union', `unused', `deprecated', `visibility', `may_alias'
! and `bnd_variable_size'.  Other attributes are defined for functions
! (*note Function Attributes::), labels (*note Label Attributes::) and
! for variables (*note Variable Attributes::).
  
!  You may also specify any one of these attributes with `__' preceding
  and following its keyword.  This allows you to use these attributes in
  header files without being concerned about a possible macro of the same
! name.  For example, you may use `__aligned__' instead of `aligned'.
  
   You may specify type attributes in an enum, struct or union type
! declaration or definition, or for other types in a `typedef'
  declaration.
  
   For an enum, struct or union type, you may specify attributes either
--- 27782,27803 ----
  6.39 Specifying Attributes of Types
  ===================================
  
! The keyword '__attribute__' allows you to specify special attributes of
! 'struct' and 'union' types when you define such types.  This keyword is
! followed by an attribute specification inside double parentheses.  Eight
! attributes are currently defined for types: 'aligned', 'packed',
! 'transparent_union', 'unused', 'deprecated', 'visibility', 'may_alias'
! and 'bnd_variable_size'.  Other attributes are defined for functions
! (*note Function Attributes::), labels (*note Label Attributes::) and for
! variables (*note Variable Attributes::).
  
!  You may also specify any one of these attributes with '__' preceding
  and following its keyword.  This allows you to use these attributes in
  header files without being concerned about a possible macro of the same
! name.  For example, you may use '__aligned__' instead of 'aligned'.
  
   You may specify type attributes in an enum, struct or union type
! declaration or definition, or for other types in a 'typedef'
  declaration.
  
   For an enum, struct or union type, you may specify attributes either
*************** preferred.
*** 28003,28009 ****
   *Note Attribute Syntax::, for details of the exact syntax for using
  attributes.
  
! `aligned (ALIGNMENT)'
       This attribute specifies a minimum alignment (in bytes) for
       variables of the specified type.  For example, the declarations:
  
--- 27808,27814 ----
   *Note Attribute Syntax::, for details of the exact syntax for using
  attributes.
  
! 'aligned (ALIGNMENT)'
       This attribute specifies a minimum alignment (in bytes) for
       variables of the specified type.  For example, the declarations:
  
*************** attributes.
*** 28011,28099 ****
            typedef int more_aligned_int __attribute__ ((aligned (8)));
  
       force the compiler to ensure (as far as it can) that each variable
!      whose type is `struct S' or `more_aligned_int' is allocated and
       aligned _at least_ on a 8-byte boundary.  On a SPARC, having all
!      variables of type `struct S' aligned to 8-byte boundaries allows
!      the compiler to use the `ldd' and `std' (doubleword load and
!      store) instructions when copying one variable of type `struct S' to
       another, thus improving run-time efficiency.
  
!      Note that the alignment of any given `struct' or `union' type is
       required by the ISO C standard to be at least a perfect multiple of
       the lowest common multiple of the alignments of all of the members
!      of the `struct' or `union' in question.  This means that you _can_
!      effectively adjust the alignment of a `struct' or `union' type by
!      attaching an `aligned' attribute to any one of the members of such
!      a type, but the notation illustrated in the example above is a
!      more obvious, intuitive, and readable way to request the compiler
!      to adjust the alignment of an entire `struct' or `union' type.
  
       As in the preceding example, you can explicitly specify the
       alignment (in bytes) that you wish the compiler to use for a given
!      `struct' or `union' type.  Alternatively, you can leave out the
       alignment factor and just ask the compiler to align a type to the
       maximum useful alignment for the target machine you are compiling
       for.  For example, you could write:
  
            struct S { short f[3]; } __attribute__ ((aligned));
  
!      Whenever you leave out the alignment factor in an `aligned'
       attribute specification, the compiler automatically sets the
       alignment for the type to the largest alignment that is ever used
       for any data type on the target machine you are compiling for.
       Doing this can often make copy operations more efficient, because
       the compiler can use whatever instructions copy the biggest chunks
!      of memory when performing copies to or from the variables that
!      have types that you have aligned this way.
  
!      In the example above, if the size of each `short' is 2 bytes, then
!      the size of the entire `struct S' type is 6 bytes.  The smallest
       power of two that is greater than or equal to that is 8, so the
!      compiler sets the alignment for the entire `struct S' type to 8
       bytes.
  
       Note that although you can ask the compiler to select a
       time-efficient alignment for a given type and then declare only
!      individual stand-alone objects of that type, the compiler's
!      ability to select a time-efficient alignment is primarily useful
!      only when you plan to create arrays of variables having the
!      relevant (efficiently aligned) type.  If you declare or use arrays
!      of variables of an efficiently-aligned type, then it is likely
!      that your program also does pointer arithmetic (or subscripting,
!      which amounts to the same thing) on pointers to the relevant type,
!      and the code that the compiler generates for these pointer
!      arithmetic operations is often more efficient for
!      efficiently-aligned types than for other types.
  
!      The `aligned' attribute can only increase the alignment; but you
!      can decrease it by specifying `packed' as well.  See below.
  
!      Note that the effectiveness of `aligned' attributes may be limited
       by inherent limitations in your linker.  On many systems, the
       linker is only able to arrange for variables to be aligned up to a
       certain maximum alignment.  (For some linkers, the maximum
       supported alignment may be very very small.)  If your linker is
       only able to align variables up to a maximum of 8-byte alignment,
!      then specifying `aligned(16)' in an `__attribute__' still only
       provides you with 8-byte alignment.  See your linker documentation
       for further information.
  
! `packed'
!      This attribute, attached to `struct' or `union' type definition,
       specifies that each member (other than zero-width bit-fields) of
       the structure or union is placed to minimize the memory required.
!      When attached to an `enum' definition, it indicates that the
       smallest integral type should be used.
  
!      Specifying this attribute for `struct' and `union' types is
!      equivalent to specifying the `packed' attribute on each of the
!      structure or union members.  Specifying the `-fshort-enums' flag
!      on the line is equivalent to specifying the `packed' attribute on
!      all `enum' definitions.
  
!      In the following example `struct my_packed_struct''s members are
!      packed closely together, but the internal layout of its `s' member
!      is not packed--to do that, `struct my_unpacked_struct' needs to be
       packed too.
  
            struct my_unpacked_struct
--- 27816,27904 ----
            typedef int more_aligned_int __attribute__ ((aligned (8)));
  
       force the compiler to ensure (as far as it can) that each variable
!      whose type is 'struct S' or 'more_aligned_int' is allocated and
       aligned _at least_ on a 8-byte boundary.  On a SPARC, having all
!      variables of type 'struct S' aligned to 8-byte boundaries allows
!      the compiler to use the 'ldd' and 'std' (doubleword load and store)
!      instructions when copying one variable of type 'struct S' to
       another, thus improving run-time efficiency.
  
!      Note that the alignment of any given 'struct' or 'union' type is
       required by the ISO C standard to be at least a perfect multiple of
       the lowest common multiple of the alignments of all of the members
!      of the 'struct' or 'union' in question.  This means that you _can_
!      effectively adjust the alignment of a 'struct' or 'union' type by
!      attaching an 'aligned' attribute to any one of the members of such
!      a type, but the notation illustrated in the example above is a more
!      obvious, intuitive, and readable way to request the compiler to
!      adjust the alignment of an entire 'struct' or 'union' type.
  
       As in the preceding example, you can explicitly specify the
       alignment (in bytes) that you wish the compiler to use for a given
!      'struct' or 'union' type.  Alternatively, you can leave out the
       alignment factor and just ask the compiler to align a type to the
       maximum useful alignment for the target machine you are compiling
       for.  For example, you could write:
  
            struct S { short f[3]; } __attribute__ ((aligned));
  
!      Whenever you leave out the alignment factor in an 'aligned'
       attribute specification, the compiler automatically sets the
       alignment for the type to the largest alignment that is ever used
       for any data type on the target machine you are compiling for.
       Doing this can often make copy operations more efficient, because
       the compiler can use whatever instructions copy the biggest chunks
!      of memory when performing copies to or from the variables that have
!      types that you have aligned this way.
  
!      In the example above, if the size of each 'short' is 2 bytes, then
!      the size of the entire 'struct S' type is 6 bytes.  The smallest
       power of two that is greater than or equal to that is 8, so the
!      compiler sets the alignment for the entire 'struct S' type to 8
       bytes.
  
       Note that although you can ask the compiler to select a
       time-efficient alignment for a given type and then declare only
!      individual stand-alone objects of that type, the compiler's ability
!      to select a time-efficient alignment is primarily useful only when
!      you plan to create arrays of variables having the relevant
!      (efficiently aligned) type.  If you declare or use arrays of
!      variables of an efficiently-aligned type, then it is likely that
!      your program also does pointer arithmetic (or subscripting, which
!      amounts to the same thing) on pointers to the relevant type, and
!      the code that the compiler generates for these pointer arithmetic
!      operations is often more efficient for efficiently-aligned types
!      than for other types.
  
!      The 'aligned' attribute can only increase the alignment; but you
!      can decrease it by specifying 'packed' as well.  See below.
  
!      Note that the effectiveness of 'aligned' attributes may be limited
       by inherent limitations in your linker.  On many systems, the
       linker is only able to arrange for variables to be aligned up to a
       certain maximum alignment.  (For some linkers, the maximum
       supported alignment may be very very small.)  If your linker is
       only able to align variables up to a maximum of 8-byte alignment,
!      then specifying 'aligned(16)' in an '__attribute__' still only
       provides you with 8-byte alignment.  See your linker documentation
       for further information.
  
! 'packed'
!      This attribute, attached to 'struct' or 'union' type definition,
       specifies that each member (other than zero-width bit-fields) of
       the structure or union is placed to minimize the memory required.
!      When attached to an 'enum' definition, it indicates that the
       smallest integral type should be used.
  
!      Specifying this attribute for 'struct' and 'union' types is
!      equivalent to specifying the 'packed' attribute on each of the
!      structure or union members.  Specifying the '-fshort-enums' flag on
!      the line is equivalent to specifying the 'packed' attribute on all
!      'enum' definitions.
  
!      In the following example 'struct my_packed_struct''s members are
!      packed closely together, but the internal layout of its 's' member
!      is not packed--to do that, 'struct my_unpacked_struct' needs to be
       packed too.
  
            struct my_unpacked_struct
*************** attributes.
*** 28109,28120 ****
                 struct my_unpacked_struct s;
              };
  
!      You may only specify this attribute on the definition of an `enum',
!      `struct' or `union', not on a `typedef' that does not also define
       the enumerated type, structure or union.
  
! `transparent_union'
!      This attribute, attached to a `union' type definition, indicates
       that any function parameter having that union type causes calls to
       that function to be treated in a special way.
  
--- 27914,27926 ----
                 struct my_unpacked_struct s;
              };
  
!      You may only specify this attribute on the definition of an 'enum',
!      'struct' or 'union', not on a 'typedef' that does not also define
       the enumerated type, structure or union.
  
! 'transparent_union'
! 
!      This attribute, attached to a 'union' type definition, indicates
       that any function parameter having that union type causes calls to
       that function to be treated in a special way.
  
*************** attributes.
*** 28124,28130 ****
       null pointer constant or a void pointer expression; and if the
       union contains a void pointer type, the corresponding argument can
       be any pointer expression.  If the union member type is a pointer,
!      qualifiers like `const' on the referenced type must be respected,
       just as with normal pointer conversions.
  
       Second, the argument is passed to the function using the calling
--- 27930,27936 ----
       null pointer constant or a void pointer expression; and if the
       union contains a void pointer type, the corresponding argument can
       be any pointer expression.  If the union member type is a pointer,
!      qualifiers like 'const' on the referenced type must be respected,
       just as with normal pointer conversions.
  
       Second, the argument is passed to the function using the calling
*************** attributes.
*** 28135,28147 ****
  
       Transparent unions are designed for library functions that have
       multiple interfaces for compatibility reasons.  For example,
!      suppose the `wait' function must accept either a value of type
!      `int *' to comply with POSIX, or a value of type `union wait *' to
!      comply with the 4.1BSD interface.  If `wait''s parameter were
!      `void *', `wait' would accept both kinds of arguments, but it
!      would also accept any other pointer type and this would make
!      argument type checking less useful.  Instead, `<sys/wait.h>' might
!      define the interface as follows:
  
            typedef union __attribute__ ((__transparent_union__))
              {
--- 27941,27953 ----
  
       Transparent unions are designed for library functions that have
       multiple interfaces for compatibility reasons.  For example,
!      suppose the 'wait' function must accept either a value of type 'int
!      *' to comply with POSIX, or a value of type 'union wait *' to
!      comply with the 4.1BSD interface.  If 'wait''s parameter were 'void
!      *', 'wait' would accept both kinds of arguments, but it would also
!      accept any other pointer type and this would make argument type
!      checking less useful.  Instead, '<sys/wait.h>' might define the
!      interface as follows:
  
            typedef union __attribute__ ((__transparent_union__))
              {
*************** attributes.
*** 28151,28172 ****
  
            pid_t wait (wait_status_ptr_t);
  
!      This interface allows either `int *' or `union wait *' arguments
!      to be passed, using the `int *' calling convention.  The program
!      can call `wait' with arguments of either type:
  
            int w1 () { int w; return wait (&w); }
            int w2 () { union wait w; return wait (&w); }
  
!      With this interface, `wait''s implementation might look like this:
  
            pid_t wait (wait_status_ptr_t p)
            {
              return waitpid (-1, p.__ip, 0);
            }
  
! `unused'
!      When attached to a type (including a `union' or a `struct'), this
       attribute means that variables of that type are meant to appear
       possibly unused.  GCC does not produce a warning for any variables
       of that type, even if the variable appears to do nothing.  This is
--- 27957,27978 ----
  
            pid_t wait (wait_status_ptr_t);
  
!      This interface allows either 'int *' or 'union wait *' arguments to
!      be passed, using the 'int *' calling convention.  The program can
!      call 'wait' with arguments of either type:
  
            int w1 () { int w; return wait (&w); }
            int w2 () { union wait w; return wait (&w); }
  
!      With this interface, 'wait''s implementation might look like this:
  
            pid_t wait (wait_status_ptr_t p)
            {
              return waitpid (-1, p.__ip, 0);
            }
  
! 'unused'
!      When attached to a type (including a 'union' or a 'struct'), this
       attribute means that variables of that type are meant to appear
       possibly unused.  GCC does not produce a warning for any variables
       of that type, even if the variable appears to do nothing.  This is
*************** attributes.
*** 28174,28190 ****
       defined and then not referenced, but contain constructors and
       destructors that have nontrivial bookkeeping functions.
  
! `deprecated'
! `deprecated (MSG)'
!      The `deprecated' attribute results in a warning if the type is
!      used anywhere in the source file.  This is useful when identifying
!      types that are expected to be removed in a future version of a
!      program.  If possible, the warning also includes the location of
!      the declaration of the deprecated type, to enable users to easily
!      find further information about why the type is deprecated, or what
!      they should do instead.  Note that the warnings only occur for
!      uses and then only if the type is being applied to an identifier
!      that itself is not being declared as deprecated.
  
            typedef int T1 __attribute__ ((deprecated));
            T1 x;
--- 27980,27996 ----
       defined and then not referenced, but contain constructors and
       destructors that have nontrivial bookkeeping functions.
  
! 'deprecated'
! 'deprecated (MSG)'
!      The 'deprecated' attribute results in a warning if the type is used
!      anywhere in the source file.  This is useful when identifying types
!      that are expected to be removed in a future version of a program.
!      If possible, the warning also includes the location of the
!      declaration of the deprecated type, to enable users to easily find
!      further information about why the type is deprecated, or what they
!      should do instead.  Note that the warnings only occur for uses and
!      then only if the type is being applied to an identifier that itself
!      is not being declared as deprecated.
  
            typedef int T1 __attribute__ ((deprecated));
            T1 x;
*************** attributes.
*** 28199,28215 ****
       deprecated.  Similarly for line 6.  The optional MSG argument,
       which must be a string, is printed in the warning if present.
  
!      The `deprecated' attribute can also be used for functions and
       variables (*note Function Attributes::, *note Variable
       Attributes::.)
  
! `may_alias'
       Accesses through pointers to types with this attribute are not
!      subject to type-based alias analysis, but are instead assumed to
!      be able to alias any other type of objects.  In the context of
!      section 6.5 paragraph 7 of the C99 standard, an lvalue expression
       dereferencing such a pointer is treated like having a character
!      type.  See `-fstrict-aliasing' for more information on aliasing
       issues.  This extension exists to support some vector APIs, in
       which pointers to one vector type are permitted to alias pointers
       to a different vector type.
--- 28005,28021 ----
       deprecated.  Similarly for line 6.  The optional MSG argument,
       which must be a string, is printed in the warning if present.
  
!      The 'deprecated' attribute can also be used for functions and
       variables (*note Function Attributes::, *note Variable
       Attributes::.)
  
! 'may_alias'
       Accesses through pointers to types with this attribute are not
!      subject to type-based alias analysis, but are instead assumed to be
!      able to alias any other type of objects.  In the context of section
!      6.5 paragraph 7 of the C99 standard, an lvalue expression
       dereferencing such a pointer is treated like having a character
!      type.  See '-fstrict-aliasing' for more information on aliasing
       issues.  This extension exists to support some vector APIs, in
       which pointers to one vector type are permitted to alias pointers
       to a different vector type.
*************** attributes.
*** 28235,28271 ****
              exit(0);
            }
  
!      If you replaced `short_a' with `short' in the variable
!      declaration, the above program would abort when compiled with
!      `-fstrict-aliasing', which is on by default at `-O2' or above.
  
! `visibility'
!      In C++, attribute visibility (*note Function Attributes::) can
!      also be applied to class, struct, union and enum types.  Unlike
!      other type attributes, the attribute must appear between the
!      initial keyword and the name of the type; it cannot appear after
!      the body of the type.
  
       Note that the type visibility is applied to vague linkage entities
       associated with the class (vtable, typeinfo node, etc.).  In
       particular, if a class is thrown as an exception in one shared
       object and caught in another, the class must have default
!      visibility.  Otherwise the two shared objects are unable to use
!      the same typeinfo node and exception handling will break.
  
! `designated_init'
       This attribute may only be applied to structure types.  It
       indicates that any initialization of an object of this type must
       use designated initializers rather than positional initializers.
!      The intent of this attribute is to allow the programmer to
!      indicate that a structure's layout may change, and that therefore
!      relying on positional initialization will result in future
!      breakage.
  
       GCC emits warnings based on this attribute by default; use
!      `-Wno-designated-init' to suppress them.
  
! `bnd_variable_size'
       When applied to a structure field, this attribute tells Pointer
       Bounds Checker that the size of this field should not be computed
       using static type information.  It may be used to mark
--- 28041,28076 ----
              exit(0);
            }
  
!      If you replaced 'short_a' with 'short' in the variable declaration,
!      the above program would abort when compiled with
!      '-fstrict-aliasing', which is on by default at '-O2' or above.
  
! 'visibility'
!      In C++, attribute visibility (*note Function Attributes::) can also
!      be applied to class, struct, union and enum types.  Unlike other
!      type attributes, the attribute must appear between the initial
!      keyword and the name of the type; it cannot appear after the body
!      of the type.
  
       Note that the type visibility is applied to vague linkage entities
       associated with the class (vtable, typeinfo node, etc.).  In
       particular, if a class is thrown as an exception in one shared
       object and caught in another, the class must have default
!      visibility.  Otherwise the two shared objects are unable to use the
!      same typeinfo node and exception handling will break.
  
! 'designated_init'
       This attribute may only be applied to structure types.  It
       indicates that any initialization of an object of this type must
       use designated initializers rather than positional initializers.
!      The intent of this attribute is to allow the programmer to indicate
!      that a structure's layout may change, and that therefore relying on
!      positional initialization will result in future breakage.
  
       GCC emits warnings based on this attribute by default; use
!      '-Wno-designated-init' to suppress them.
  
! 'bnd_variable_size'
       When applied to a structure field, this attribute tells Pointer
       Bounds Checker that the size of this field should not be computed
       using static type information.  It may be used to mark
*************** attributes.
*** 28291,28308 ****
            S *p = (S *)malloc (sizeof(S) + 100);
            p->data[10] = 0; //OK
  
- 
   To specify multiple attributes, separate them by commas within the
! double parentheses: for example, `__attribute__ ((aligned (16),
  packed))'.
  
  6.39.1 ARM Type Attributes
  --------------------------
  
! On those ARM targets that support `dllimport' (such as Symbian OS), you
! can use the `notshared' attribute to indicate that the virtual table
! and other similar data for a class should not be exported from a DLL.
! For example:
  
       class __declspec(notshared) C {
       public:
--- 28096,28112 ----
            S *p = (S *)malloc (sizeof(S) + 100);
            p->data[10] = 0; //OK
  
   To specify multiple attributes, separate them by commas within the
! double parentheses: for example, '__attribute__ ((aligned (16),
  packed))'.
  
  6.39.1 ARM Type Attributes
  --------------------------
  
! On those ARM targets that support 'dllimport' (such as Symbian OS), you
! can use the 'notshared' attribute to indicate that the virtual table and
! other similar data for a class should not be exported from a DLL.  For
! example:
  
       class __declspec(notshared) C {
       public:
*************** For example:
*** 28313,28376 ****
       __declspec(dllexport)
       C::C() {}
  
! In this code, `C::C' is exported from the current DLL, but the virtual
! table for `C' is not exported.  (You can use `__attribute__' instead of
! `__declspec' if you prefer, but most Symbian OS code uses `__declspec'.)
  
  6.39.2 MeP Type Attributes
  --------------------------
  
  Many of the MeP variable attributes may be applied to types as well.
! Specifically, the `based', `tiny', `near', and `far' attributes may be
! applied to either.  The `io' and `cb' attributes may not be applied to
  types.
  
  6.39.3 PowerPC Type Attributes
  ------------------------------
  
  Three attributes currently are defined for PowerPC configurations:
! `altivec', `ms_struct' and `gcc_struct'.
  
!  For full documentation of the `ms_struct' and `gcc_struct' attributes
  please see the documentation in *note x86 Type Attributes::.
  
!  The `altivec' attribute allows one to declare AltiVec vector data
! types supported by the AltiVec Programming Interface Manual.  The
! attribute requires an argument to specify one of three vector types:
! `vector__', `pixel__' (always followed by unsigned short), and `bool__'
! (always followed by unsigned).
  
       __attribute__((altivec(vector__)))
       __attribute__((altivec(pixel__))) unsigned short
       __attribute__((altivec(bool__))) unsigned
  
!  These attributes mainly are intended to support the `__vector',
! `__pixel', and `__bool' AltiVec keywords.
  
  6.39.4 SPU Type Attributes
  --------------------------
  
! The SPU supports the `spu_vector' attribute for types.  This attribute
  allows one to declare vector data types supported by the
  Sony/Toshiba/IBM SPU Language Extensions Specification.  It is intended
! to support the `__vector' keyword.
  
  6.39.5 x86 Type Attributes
  --------------------------
  
! Two attributes are currently defined for x86 configurations:
! `ms_struct' and `gcc_struct'.
  
! `ms_struct'
! `gcc_struct'
!      If `packed' is used on a structure, or if bit-fields are used it
       may be that the Microsoft ABI packs them differently than GCC
       normally packs them.  Particularly when moving packed data between
       functions compiled with GCC and the native Microsoft compiler
       (either via function call or as data in a file), it may be
       necessary to access either format.
  
!      Currently `-m[no-]ms-bitfields' is provided for the Microsoft
       Windows x86 compilers to match the native Microsoft compiler.
  
  
--- 28117,28181 ----
       __declspec(dllexport)
       C::C() {}
  
! In this code, 'C::C' is exported from the current DLL, but the virtual
! table for 'C' is not exported.  (You can use '__attribute__' instead of
! '__declspec' if you prefer, but most Symbian OS code uses '__declspec'.)
  
  6.39.2 MeP Type Attributes
  --------------------------
  
  Many of the MeP variable attributes may be applied to types as well.
! Specifically, the 'based', 'tiny', 'near', and 'far' attributes may be
! applied to either.  The 'io' and 'cb' attributes may not be applied to
  types.
  
  6.39.3 PowerPC Type Attributes
  ------------------------------
  
  Three attributes currently are defined for PowerPC configurations:
! 'altivec', 'ms_struct' and 'gcc_struct'.
  
!  For full documentation of the 'ms_struct' and 'gcc_struct' attributes
  please see the documentation in *note x86 Type Attributes::.
  
!  The 'altivec' attribute allows one to declare AltiVec vector data types
! supported by the AltiVec Programming Interface Manual.  The attribute
! requires an argument to specify one of three vector types: 'vector__',
! 'pixel__' (always followed by unsigned short), and 'bool__' (always
! followed by unsigned).
  
       __attribute__((altivec(vector__)))
       __attribute__((altivec(pixel__))) unsigned short
       __attribute__((altivec(bool__))) unsigned
  
!  These attributes mainly are intended to support the '__vector',
! '__pixel', and '__bool' AltiVec keywords.
  
  6.39.4 SPU Type Attributes
  --------------------------
  
! The SPU supports the 'spu_vector' attribute for types.  This attribute
  allows one to declare vector data types supported by the
  Sony/Toshiba/IBM SPU Language Extensions Specification.  It is intended
! to support the '__vector' keyword.
  
  6.39.5 x86 Type Attributes
  --------------------------
  
! Two attributes are currently defined for x86 configurations: 'ms_struct'
! and 'gcc_struct'.
  
! 'ms_struct'
! 'gcc_struct'
! 
!      If 'packed' is used on a structure, or if bit-fields are used it
       may be that the Microsoft ABI packs them differently than GCC
       normally packs them.  Particularly when moving packed data between
       functions compiled with GCC and the native Microsoft compiler
       (either via function call or as data in a file), it may be
       necessary to access either format.
  
!      Currently '-m[no-]ms-bitfields' is provided for the Microsoft
       Windows x86 compilers to match the native Microsoft compiler.
  
  
*************** File: gcc.info,  Node: Alignment,  Next:
*** 28379,28407 ****
  6.40 Inquiring on Alignment of Types or Variables
  =================================================
  
! The keyword `__alignof__' allows you to inquire about how an object is
  aligned, or the minimum alignment usually required by a type.  Its
! syntax is just like `sizeof'.
  
!  For example, if the target machine requires a `double' value to be
! aligned on an 8-byte boundary, then `__alignof__ (double)' is 8.  This
  is true on many RISC machines.  On more traditional machine designs,
! `__alignof__ (double)' is 4 or even 2.
  
!  Some machines never actually require alignment; they allow reference
! to any data type even at an odd address.  For these machines,
! `__alignof__' reports the smallest alignment that GCC gives the data
! type, usually as mandated by the target ABI.
  
!  If the operand of `__alignof__' is an lvalue rather than a type, its
  value is the required alignment for its type, taking into account any
! minimum alignment specified with GCC's `__attribute__' extension (*note
  Variable Attributes::).  For example, after this declaration:
  
       struct foo { int x; char y; } foo1;
  
! the value of `__alignof__ (foo1.y)' is 1, even though its actual
! alignment is probably 2 or 4, the same as `__alignof__ (int)'.
  
   It is an error to ask for the alignment of an incomplete type.
  
--- 28184,28212 ----
  6.40 Inquiring on Alignment of Types or Variables
  =================================================
  
! The keyword '__alignof__' allows you to inquire about how an object is
  aligned, or the minimum alignment usually required by a type.  Its
! syntax is just like 'sizeof'.
  
!  For example, if the target machine requires a 'double' value to be
! aligned on an 8-byte boundary, then '__alignof__ (double)' is 8.  This
  is true on many RISC machines.  On more traditional machine designs,
! '__alignof__ (double)' is 4 or even 2.
  
!  Some machines never actually require alignment; they allow reference to
! any data type even at an odd address.  For these machines, '__alignof__'
! reports the smallest alignment that GCC gives the data type, usually as
! mandated by the target ABI.
  
!  If the operand of '__alignof__' is an lvalue rather than a type, its
  value is the required alignment for its type, taking into account any
! minimum alignment specified with GCC's '__attribute__' extension (*note
  Variable Attributes::).  For example, after this declaration:
  
       struct foo { int x; char y; } foo1;
  
! the value of '__alignof__ (foo1.y)' is 1, even though its actual
! alignment is probably 2 or 4, the same as '__alignof__ (int)'.
  
   It is an error to ask for the alignment of an incomplete type.
  
*************** File: gcc.info,  Node: Inline,  Next: Vo
*** 28411,28435 ****
  6.41 An Inline Function is As Fast As a Macro
  =============================================
  
! By declaring a function inline, you can direct GCC to make calls to
! that function faster.  One way GCC can achieve this is to integrate
! that function's code into the code for its callers.  This makes
! execution faster by eliminating the function-call overhead; in
! addition, if any of the actual argument values are constant, their
! known values may permit simplifications at compile time so that not all
! of the inline function's code needs to be included.  The effect on code
! size is less predictable; object code may be larger or smaller with
! function inlining, depending on the particular case.  You can also
! direct GCC to try to integrate all "simple enough" functions into their
! callers with the option `-finline-functions'.
  
   GCC implements three different semantics of declaring a function
! inline.  One is available with `-std=gnu89' or `-fgnu89-inline' or when
! `gnu_inline' attribute is present on all inline declarations, another
! when `-std=c99', `-std=c11', `-std=gnu99' or `-std=gnu11' (without
! `-fgnu89-inline'), and the third is used when compiling C++.
  
!  To declare a function inline, use the `inline' keyword in its
  declaration, like this:
  
       static inline int
--- 28216,28240 ----
  6.41 An Inline Function is As Fast As a Macro
  =============================================
  
! By declaring a function inline, you can direct GCC to make calls to that
! function faster.  One way GCC can achieve this is to integrate that
! function's code into the code for its callers.  This makes execution
! faster by eliminating the function-call overhead; in addition, if any of
! the actual argument values are constant, their known values may permit
! simplifications at compile time so that not all of the inline function's
! code needs to be included.  The effect on code size is less predictable;
! object code may be larger or smaller with function inlining, depending
! on the particular case.  You can also direct GCC to try to integrate all
! "simple enough" functions into their callers with the option
! '-finline-functions'.
  
   GCC implements three different semantics of declaring a function
! inline.  One is available with '-std=gnu89' or '-fgnu89-inline' or when
! 'gnu_inline' attribute is present on all inline declarations, another
! when '-std=c99', '-std=c11', '-std=gnu99' or '-std=gnu11' (without
! '-fgnu89-inline'), and the third is used when compiling C++.
  
!  To declare a function inline, use the 'inline' keyword in its
  declaration, like this:
  
       static inline int
*************** declaration, like this:
*** 28439,28450 ****
       }
  
   If you are writing a header file to be included in ISO C90 programs,
! write `__inline__' instead of `inline'.  *Note Alternate Keywords::.
  
   The three types of inlining behave similarly in two important cases:
! when the `inline' keyword is used on a `static' function, like the
  example above, and when a function is first declared without using the
! `inline' keyword and then is defined with `inline', like this:
  
       extern int inc (int *a);
       inline int
--- 28244,28255 ----
       }
  
   If you are writing a header file to be included in ISO C90 programs,
! write '__inline__' instead of 'inline'.  *Note Alternate Keywords::.
  
   The three types of inlining behave similarly in two important cases:
! when the 'inline' keyword is used on a 'static' function, like the
  example above, and when a function is first declared without using the
! 'inline' keyword and then is defined with 'inline', like this:
  
       extern int inc (int *a);
       inline int
*************** example above, and when a function is fi
*** 28454,28514 ****
       }
  
   In both of these common cases, the program behaves the same as if you
! had not used the `inline' keyword, except for its speed.
  
!  When a function is both inline and `static', if all calls to the
  function are integrated into the caller, and the function's address is
  never used, then the function's own assembler code is never referenced.
  In this case, GCC does not actually output assembler code for the
! function, unless you specify the option `-fkeep-inline-functions'.
! Some calls cannot be integrated for various reasons (in particular,
! calls that precede the function's definition cannot be integrated, and
! neither can recursive calls within the definition).  If there is a
! nonintegrated call, then the function is compiled to assembler code as
! usual.  The function must also be compiled as usual if the program
! refers to its address, because that can't be inlined.
  
   Note that certain usages in a function definition can make it
  unsuitable for inline substitution.  Among these usages are: variadic
! functions, use of `alloca', use of variable-length data types (*note
! Variable Length::), use of computed goto (*note Labels as Values::),
! use of nonlocal goto, and nested functions (*note Nested Functions::).
! Using `-Winline' warns when a function marked `inline' could not be
  substituted, and gives the reason for the failure.
  
   As required by ISO C++, GCC considers member functions defined within
  the body of a class to be marked inline even if they are not explicitly
! declared with the `inline' keyword.  You can override this with
! `-fno-default-inline'; *note Options Controlling C++ Dialect: C++
  Dialect Options.
  
   GCC does not inline any functions when not optimizing unless you
! specify the `always_inline' attribute for the function, like this:
  
       /* Prototype.  */
       inline void foo (const char) __attribute__((always_inline));
  
   The remainder of this section is specific to GNU C90 inlining.
  
!  When an inline function is not `static', then the compiler must assume
  that there may be calls from other source files; since a global symbol
  can be defined only once in any program, the function must not be
  defined in the other source files, so the calls therein cannot be
! integrated.  Therefore, a non-`static' inline function is always
  compiled on its own in the usual fashion.
  
!  If you specify both `inline' and `extern' in the function definition,
  then the definition is used only for inlining.  In no case is the
  function compiled on its own, not even if you refer to its address
  explicitly.  Such an address becomes an external reference, as if you
  had only declared the function, and had not defined it.
  
!  This combination of `inline' and `extern' has almost the effect of a
  macro.  The way to use it is to put a function definition in a header
  file with these keywords, and put another copy of the definition
! (lacking `inline' and `extern') in a library file.  The definition in
! the header file causes most calls to the function to be inlined.  If
! any uses of the function remain, they refer to the single copy in the
  library.
  
  
--- 28259,28319 ----
       }
  
   In both of these common cases, the program behaves the same as if you
! had not used the 'inline' keyword, except for its speed.
  
!  When a function is both inline and 'static', if all calls to the
  function are integrated into the caller, and the function's address is
  never used, then the function's own assembler code is never referenced.
  In this case, GCC does not actually output assembler code for the
! function, unless you specify the option '-fkeep-inline-functions'.  Some
! calls cannot be integrated for various reasons (in particular, calls
! that precede the function's definition cannot be integrated, and neither
! can recursive calls within the definition).  If there is a nonintegrated
! call, then the function is compiled to assembler code as usual.  The
! function must also be compiled as usual if the program refers to its
! address, because that can't be inlined.
  
   Note that certain usages in a function definition can make it
  unsuitable for inline substitution.  Among these usages are: variadic
! functions, use of 'alloca', use of variable-length data types (*note
! Variable Length::), use of computed goto (*note Labels as Values::), use
! of nonlocal goto, and nested functions (*note Nested Functions::).
! Using '-Winline' warns when a function marked 'inline' could not be
  substituted, and gives the reason for the failure.
  
   As required by ISO C++, GCC considers member functions defined within
  the body of a class to be marked inline even if they are not explicitly
! declared with the 'inline' keyword.  You can override this with
! '-fno-default-inline'; *note Options Controlling C++ Dialect: C++
  Dialect Options.
  
   GCC does not inline any functions when not optimizing unless you
! specify the 'always_inline' attribute for the function, like this:
  
       /* Prototype.  */
       inline void foo (const char) __attribute__((always_inline));
  
   The remainder of this section is specific to GNU C90 inlining.
  
!  When an inline function is not 'static', then the compiler must assume
  that there may be calls from other source files; since a global symbol
  can be defined only once in any program, the function must not be
  defined in the other source files, so the calls therein cannot be
! integrated.  Therefore, a non-'static' inline function is always
  compiled on its own in the usual fashion.
  
!  If you specify both 'inline' and 'extern' in the function definition,
  then the definition is used only for inlining.  In no case is the
  function compiled on its own, not even if you refer to its address
  explicitly.  Such an address becomes an external reference, as if you
  had only declared the function, and had not defined it.
  
!  This combination of 'inline' and 'extern' has almost the effect of a
  macro.  The way to use it is to put a function definition in a header
  file with these keywords, and put another copy of the definition
! (lacking 'inline' and 'extern') in a library file.  The definition in
! the header file causes most calls to the function to be inlined.  If any
! uses of the function remain, they refer to the single copy in the
  library.
  
  
*************** allow you to violate the restriction on
*** 28531,28548 ****
  between two sequence points.
  
   Accesses to non-volatile objects are not ordered with respect to
! volatile accesses.  You cannot use a volatile object as a memory
! barrier to order a sequence of writes to non-volatile memory.  For
! instance:
  
       int *ptr = SOMETHING;
       volatile int vobj;
       *ptr = SOMETHING;
       vobj = 1;
  
! Unless *PTR and VOBJ can be aliased, it is not guaranteed that the
! write to *PTR occurs by the time the update of VOBJ happens.  If you
! need this guarantee, you must use a stronger memory barrier such as:
  
       int *ptr = SOMETHING;
       volatile int vobj;
--- 28336,28352 ----
  between two sequence points.
  
   Accesses to non-volatile objects are not ordered with respect to
! volatile accesses.  You cannot use a volatile object as a memory barrier
! to order a sequence of writes to non-volatile memory.  For instance:
  
       int *ptr = SOMETHING;
       volatile int vobj;
       *ptr = SOMETHING;
       vobj = 1;
  
! Unless *PTR and VOBJ can be aliased, it is not guaranteed that the write
! to *PTR occurs by the time the update of VOBJ happens.  If you need this
! guarantee, you must use a stronger memory barrier such as:
  
       int *ptr = SOMETHING;
       volatile int vobj;
*************** volatile object being pointed to.
*** 28560,28568 ****
  
   Assignments are also expressions and have an rvalue.  However when
  assigning to a scalar volatile, the volatile object is not reread,
! regardless of whether the assignment expression's rvalue is used or
! not.  If the assignment's rvalue is used, the value is that assigned to
! the volatile object.  For instance, there is no read of VOBJ in all the
  following cases:
  
       int obj;
--- 28364,28372 ----
  
   Assignments are also expressions and have an rvalue.  However when
  assigning to a scalar volatile, the volatile object is not reread,
! regardless of whether the assignment expression's rvalue is used or not.
! If the assignment's rvalue is used, the value is that assigned to the
! volatile object.  For instance, there is no read of VOBJ in all the
  following cases:
  
       int obj;
*************** File: gcc.info,  Node: Using Assembly La
*** 28589,28613 ****
  6.43 How to Use Inline Assembly Language in C Code
  ==================================================
  
! The `asm' keyword allows you to embed assembler instructions within C
! code.  GCC provides two forms of inline `asm' statements.  A "basic
! `asm'" statement is one with no operands (*note Basic Asm::), while an
! "extended `asm'" statement (*note Extended Asm::) includes one or more
  operands.  The extended form is preferred for mixing C and assembly
  language within a function, but to include assembly language at top
! level you must use basic `asm'.
  
!  You can also use the `asm' keyword to override the assembler name for
! a C symbol, or to place a C variable in a specific register.
  
  * Menu:
  
  * Basic Asm::          Inline assembler without operands.
  * Extended Asm::       Inline assembler with operands.
! * Constraints::        Constraints for `asm' operands
  * Asm Labels::         Specifying the assembler name to use for a C symbol.
  * Explicit Reg Vars::  Defining variables residing in specified registers.
! * Size of an asm::     How GCC calculates the size of an `asm' block.
  
  
  File: gcc.info,  Node: Basic Asm,  Next: Extended Asm,  Up: Using Assembly Language with C
--- 28393,28417 ----
  6.43 How to Use Inline Assembly Language in C Code
  ==================================================
  
! The 'asm' keyword allows you to embed assembler instructions within C
! code.  GCC provides two forms of inline 'asm' statements.  A "basic
! 'asm'" statement is one with no operands (*note Basic Asm::), while an
! "extended 'asm'" statement (*note Extended Asm::) includes one or more
  operands.  The extended form is preferred for mixing C and assembly
  language within a function, but to include assembly language at top
! level you must use basic 'asm'.
  
!  You can also use the 'asm' keyword to override the assembler name for a
! C symbol, or to place a C variable in a specific register.
  
  * Menu:
  
  * Basic Asm::          Inline assembler without operands.
  * Extended Asm::       Inline assembler with operands.
! * Constraints::        Constraints for 'asm' operands
  * Asm Labels::         Specifying the assembler name to use for a C symbol.
  * Explicit Reg Vars::  Defining variables residing in specified registers.
! * Size of an asm::     How GCC calculates the size of an 'asm' block.
  
  
  File: gcc.info,  Node: Basic Asm,  Next: Extended Asm,  Up: Using Assembly Language with C
*************** File: gcc.info,  Node: Basic Asm,  Next:
*** 28615,28708 ****
  6.43.1 Basic Asm -- Assembler Instructions Without Operands
  -----------------------------------------------------------
  
! A basic `asm' statement has the following syntax:
  
       asm [ volatile ] ( ASSEMBLERINSTRUCTIONS )
  
!  The `asm' keyword is a GNU extension.  When writing code that can be
! compiled with `-ansi' and the various `-std' options, use `__asm__'
! instead of `asm' (*note Alternate Keywords::).
  
  Qualifiers
  ..........
  
! `volatile'
!      The optional `volatile' qualifier has no effect.  All basic `asm'
       blocks are implicitly volatile.
  
  Parameters
  ..........
  
  ASSEMBLERINSTRUCTIONS
!      This is a literal string that specifies the assembler code. The
       string can contain any instructions recognized by the assembler,
       including directives.  GCC does not parse the assembler
       instructions themselves and does not know what they mean or even
       whether they are valid assembler input.
  
       You may place multiple assembler instructions together in a single
!      `asm' string, separated by the characters normally used in
!      assembly code for the system. A combination that works in most
!      places is a newline to break the line, plus a tab character
!      (written as `\n\t').  Some assemblers allow semicolons as a line
!      separator. However, note that some assembler dialects use
!      semicolons to start a comment.
  
  Remarks
  .......
  
! Using extended `asm' typically produces smaller, safer, and more
  efficient code, and in most cases it is a better solution than basic
! `asm'.  However, there are two situations where only basic `asm' can be
  used:
  
!    * Extended `asm' statements have to be inside a C function, so to
!      write inline assembly language at file scope ("top-level"),
!      outside of C functions, you must use basic `asm'.  You can use
!      this technique to emit assembler directives, define assembly
!      language macros that can be invoked elsewhere in the file, or
!      write entire functions in assembly language.
  
!    * Functions declared with the `naked' attribute also require basic
!      `asm' (*note Function Attributes::).
  
!  Safely accessing C data and calling functions from basic `asm' is more
! complex than it may appear. To access C data, it is better to use
! extended `asm'.
  
!  Do not expect a sequence of `asm' statements to remain perfectly
! consecutive after compilation. If certain instructions need to remain
! consecutive in the output, put them in a single multi-instruction `asm'
! statement. Note that GCC's optimizers can move `asm' statements
  relative to other code, including across jumps.
  
!  `asm' statements may not perform jumps into other `asm' statements.
  GCC does not know about these jumps, and therefore cannot take account
! of them when deciding how to optimize. Jumps from `asm' to C labels are
! only supported in extended `asm'.
  
   Under certain circumstances, GCC may duplicate (or remove duplicates
! of) your assembly code when optimizing. This can lead to unexpected
! duplicate symbol errors during compilation if your assembly code
! defines symbols or labels.
  
   Since GCC does not parse the ASSEMBLERINSTRUCTIONS, it has no
! visibility of any symbols it references. This may result in GCC
  discarding those symbols as unreferenced.
  
!  The compiler copies the assembler instructions in a basic `asm'
  verbatim to the assembly language output file, without processing
! dialects or any of the `%' operators that are available with extended
! `asm'. This results in minor differences between basic `asm' strings
! and extended `asm' templates. For example, to refer to registers you
! might use `%eax' in basic `asm' and `%%eax' in extended `asm'.
  
   On targets such as x86 that support multiple assembler dialects, all
! basic `asm' blocks use the assembler dialect specified by the `-masm'
! command-line option (*note x86 Options::).  Basic `asm' provides no
  mechanism to provide different assembler strings for different dialects.
  
!  Here is an example of basic `asm' for i386:
  
       /* Note that this code will not compile with -masm=intel */
       #define DebugBreak() asm("int $3")
--- 28419,28512 ----
  6.43.1 Basic Asm -- Assembler Instructions Without Operands
  -----------------------------------------------------------
  
! A basic 'asm' statement has the following syntax:
  
       asm [ volatile ] ( ASSEMBLERINSTRUCTIONS )
  
!  The 'asm' keyword is a GNU extension.  When writing code that can be
! compiled with '-ansi' and the various '-std' options, use '__asm__'
! instead of 'asm' (*note Alternate Keywords::).
  
  Qualifiers
  ..........
  
! 'volatile'
!      The optional 'volatile' qualifier has no effect.  All basic 'asm'
       blocks are implicitly volatile.
  
  Parameters
  ..........
  
  ASSEMBLERINSTRUCTIONS
!      This is a literal string that specifies the assembler code.  The
       string can contain any instructions recognized by the assembler,
       including directives.  GCC does not parse the assembler
       instructions themselves and does not know what they mean or even
       whether they are valid assembler input.
  
       You may place multiple assembler instructions together in a single
!      'asm' string, separated by the characters normally used in assembly
!      code for the system.  A combination that works in most places is a
!      newline to break the line, plus a tab character (written as
!      '\n\t').  Some assemblers allow semicolons as a line separator.
!      However, note that some assembler dialects use semicolons to start
!      a comment.
  
  Remarks
  .......
  
! Using extended 'asm' typically produces smaller, safer, and more
  efficient code, and in most cases it is a better solution than basic
! 'asm'.  However, there are two situations where only basic 'asm' can be
  used:
  
!    * Extended 'asm' statements have to be inside a C function, so to
!      write inline assembly language at file scope ("top-level"), outside
!      of C functions, you must use basic 'asm'.  You can use this
!      technique to emit assembler directives, define assembly language
!      macros that can be invoked elsewhere in the file, or write entire
!      functions in assembly language.
  
!    * Functions declared with the 'naked' attribute also require basic
!      'asm' (*note Function Attributes::).
  
!  Safely accessing C data and calling functions from basic 'asm' is more
! complex than it may appear.  To access C data, it is better to use
! extended 'asm'.
  
!  Do not expect a sequence of 'asm' statements to remain perfectly
! consecutive after compilation.  If certain instructions need to remain
! consecutive in the output, put them in a single multi-instruction 'asm'
! statement.  Note that GCC's optimizers can move 'asm' statements
  relative to other code, including across jumps.
  
!  'asm' statements may not perform jumps into other 'asm' statements.
  GCC does not know about these jumps, and therefore cannot take account
! of them when deciding how to optimize.  Jumps from 'asm' to C labels are
! only supported in extended 'asm'.
  
   Under certain circumstances, GCC may duplicate (or remove duplicates
! of) your assembly code when optimizing.  This can lead to unexpected
! duplicate symbol errors during compilation if your assembly code defines
! symbols or labels.
  
   Since GCC does not parse the ASSEMBLERINSTRUCTIONS, it has no
! visibility of any symbols it references.  This may result in GCC
  discarding those symbols as unreferenced.
  
!  The compiler copies the assembler instructions in a basic 'asm'
  verbatim to the assembly language output file, without processing
! dialects or any of the '%' operators that are available with extended
! 'asm'.  This results in minor differences between basic 'asm' strings
! and extended 'asm' templates.  For example, to refer to registers you
! might use '%eax' in basic 'asm' and '%%eax' in extended 'asm'.
  
   On targets such as x86 that support multiple assembler dialects, all
! basic 'asm' blocks use the assembler dialect specified by the '-masm'
! command-line option (*note x86 Options::).  Basic 'asm' provides no
  mechanism to provide different assembler strings for different dialects.
  
!  Here is an example of basic 'asm' for i386:
  
       /* Note that this code will not compile with -masm=intel */
       #define DebugBreak() asm("int $3")
*************** File: gcc.info,  Node: Extended Asm,  Ne
*** 28713,28721 ****
  6.43.2 Extended Asm - Assembler Instructions with C Expression Operands
  -----------------------------------------------------------------------
  
! With extended `asm' you can read and write C variables from assembler
! and perform jumps from assembler code to C labels.  Extended `asm'
! syntax uses colons (`:') to delimit the operand parameters after the
  assembler template:
  
       asm [volatile] ( ASSEMBLERTEMPLATE
--- 28517,28525 ----
  6.43.2 Extended Asm - Assembler Instructions with C Expression Operands
  -----------------------------------------------------------------------
  
! With extended 'asm' you can read and write C variables from assembler
! and perform jumps from assembler code to C labels.  Extended 'asm'
! syntax uses colons (':') to delimit the operand parameters after the
  assembler template:
  
       asm [volatile] ( ASSEMBLERTEMPLATE
*************** assembler template:
*** 28729,28750 ****
                             : CLOBBERS
                             : GOTOLABELS)
  
!  The `asm' keyword is a GNU extension.  When writing code that can be
! compiled with `-ansi' and the various `-std' options, use `__asm__'
! instead of `asm' (*note Alternate Keywords::).
  
  Qualifiers
  ..........
  
! `volatile'
!      The typical use of extended `asm' statements is to manipulate input
!      values to produce output values. However, your `asm' statements may
!      also produce side effects. If so, you may need to use the
!      `volatile' qualifier to disable certain optimizations. *Note
       Volatile::.
  
! `goto'
!      This qualifier informs the compiler that the `asm' statement may
       perform a jump to one of the labels listed in the GOTOLABELS.
       *Note GotoLabels::.
  
--- 28533,28554 ----
                             : CLOBBERS
                             : GOTOLABELS)
  
!  The 'asm' keyword is a GNU extension.  When writing code that can be
! compiled with '-ansi' and the various '-std' options, use '__asm__'
! instead of 'asm' (*note Alternate Keywords::).
  
  Qualifiers
  ..........
  
! 'volatile'
!      The typical use of extended 'asm' statements is to manipulate input
!      values to produce output values.  However, your 'asm' statements
!      may also produce side effects.  If so, you may need to use the
!      'volatile' qualifier to disable certain optimizations.  *Note
       Volatile::.
  
! 'goto'
!      This qualifier informs the compiler that the 'asm' statement may
       perform a jump to one of the labels listed in the GOTOLABELS.
       *Note GotoLabels::.
  
*************** Parameters
*** 28753,28769 ****
  
  ASSEMBLERTEMPLATE
       This is a literal string that is the template for the assembler
!      code. It is a combination of fixed text and tokens that refer to
!      the input, output, and goto parameters. *Note AssemblerTemplate::.
  
  OUTPUTOPERANDS
       A comma-separated list of the C variables modified by the
!      instructions in the ASSEMBLERTEMPLATE.  An empty list is
!      permitted.  *Note OutputOperands::.
  
  INPUTOPERANDS
!      A comma-separated list of C expressions read by the instructions
!      in the ASSEMBLERTEMPLATE.  An empty list is permitted.  *Note
       InputOperands::.
  
  CLOBBERS
--- 28557,28573 ----
  
  ASSEMBLERTEMPLATE
       This is a literal string that is the template for the assembler
!      code.  It is a combination of fixed text and tokens that refer to
!      the input, output, and goto parameters.  *Note AssemblerTemplate::.
  
  OUTPUTOPERANDS
       A comma-separated list of the C variables modified by the
!      instructions in the ASSEMBLERTEMPLATE.  An empty list is permitted.
!      *Note OutputOperands::.
  
  INPUTOPERANDS
!      A comma-separated list of C expressions read by the instructions in
!      the ASSEMBLERTEMPLATE.  An empty list is permitted.  *Note
       InputOperands::.
  
  CLOBBERS
*************** CLOBBERS
*** 28772,28782 ****
       is permitted.  *Note Clobbers::.
  
  GOTOLABELS
!      When you are using the `goto' form of `asm', this section contains
!      the list of all C labels to which the code in the
!      ASSEMBLERTEMPLATE may jump.  *Note GotoLabels::.
  
!      `asm' statements may not perform jumps into other `asm' statements,
       only to the listed GOTOLABELS.  GCC's optimizers do not know about
       other jumps; therefore they cannot take account of them when
       deciding how to optimize.
--- 28576,28586 ----
       is permitted.  *Note Clobbers::.
  
  GOTOLABELS
!      When you are using the 'goto' form of 'asm', this section contains
!      the list of all C labels to which the code in the ASSEMBLERTEMPLATE
!      may jump.  *Note GotoLabels::.
  
!      'asm' statements may not perform jumps into other 'asm' statements,
       only to the listed GOTOLABELS.  GCC's optimizers do not know about
       other jumps; therefore they cannot take account of them when
       deciding how to optimize.
*************** GOTOLABELS
*** 28786,28805 ****
  Remarks
  .......
  
! The `asm' statement allows you to include assembly instructions directly
! within C code. This may help you to maximize performance in
  time-sensitive code or to access assembly instructions that are not
  readily available to C programs.
  
!  Note that extended `asm' statements must be inside a function. Only
! basic `asm' may be outside functions (*note Basic Asm::).  Functions
! declared with the `naked' attribute also require basic `asm' (*note
  Function Attributes::).
  
!  While the uses of `asm' are many and varied, it may help to think of an
! `asm' statement as a series of low-level instructions that convert input
! parameters to output parameters. So a simple (if not particularly
! useful) example for i386 using `asm' might look like this:
  
       int src = 1;
       int dst;
--- 28590,28609 ----
  Remarks
  .......
  
! The 'asm' statement allows you to include assembly instructions directly
! within C code.  This may help you to maximize performance in
  time-sensitive code or to access assembly instructions that are not
  readily available to C programs.
  
!  Note that extended 'asm' statements must be inside a function.  Only
! basic 'asm' may be outside functions (*note Basic Asm::).  Functions
! declared with the 'naked' attribute also require basic 'asm' (*note
  Function Attributes::).
  
!  While the uses of 'asm' are many and varied, it may help to think of an
! 'asm' statement as a series of low-level instructions that convert input
! parameters to output parameters.  So a simple (if not particularly
! useful) example for i386 using 'asm' might look like this:
  
       int src = 1;
       int dst;
*************** useful) example for i386 using `asm' mig
*** 28811,28837 ****
  
       printf("%d\n", dst);
  
!  This code copies `src' to `dst' and add 1 to `dst'.
  
  6.43.2.1 Volatile
  .................
  
! GCC's optimizers sometimes discard `asm' statements if they determine
! there is no need for the output variables. Also, the optimizers may move
! code out of loops if they believe that the code will always return the
! same result (i.e. none of its input values change between calls). Using
! the `volatile' qualifier disables these optimizations. `asm' statements
! that have no output operands, including `asm goto' statements, are
! implicitly volatile.
  
   This i386 code demonstrates a case that does not use (or require) the
! `volatile' qualifier. If it is performing assertion checking, this code
! uses `asm' to perform the validation. Otherwise, `dwRes' is
! unreferenced by any code. As a result, the optimizers can discard the
! `asm' statement, which in turn removes the need for the entire
! `DoCheck' routine. By omitting the `volatile' qualifier when it isn't
! needed you allow the optimizers to produce the most efficient code
! possible.
  
       void DoCheck(uint32_t dwSomeValue)
       {
--- 28615,28640 ----
  
       printf("%d\n", dst);
  
!  This code copies 'src' to 'dst' and add 1 to 'dst'.
  
  6.43.2.1 Volatile
  .................
  
! GCC's optimizers sometimes discard 'asm' statements if they determine
! there is no need for the output variables.  Also, the optimizers may
! move code out of loops if they believe that the code will always return
! the same result (i.e.  none of its input values change between calls).
! Using the 'volatile' qualifier disables these optimizations.  'asm'
! statements that have no output operands, including 'asm goto'
! statements, are implicitly volatile.
  
   This i386 code demonstrates a case that does not use (or require) the
! 'volatile' qualifier.  If it is performing assertion checking, this code
! uses 'asm' to perform the validation.  Otherwise, 'dwRes' is
! unreferenced by any code.  As a result, the optimizers can discard the
! 'asm' statement, which in turn removes the need for the entire 'DoCheck'
! routine.  By omitting the 'volatile' qualifier when it isn't needed you
! allow the optimizers to produce the most efficient code possible.
  
       void DoCheck(uint32_t dwSomeValue)
       {
*************** possible.
*** 28847,28855 ****
       }
  
   The next example shows a case where the optimizers can recognize that
! the input (`dwSomeValue') never changes during the execution of the
! function and can therefore move the `asm' outside the loop to produce
! more efficient code.  Again, using `volatile' disables this type of
  optimization.
  
       void do_print(uint32_t dwSomeValue)
--- 28650,28658 ----
       }
  
   The next example shows a case where the optimizers can recognize that
! the input ('dwSomeValue') never changes during the execution of the
! function and can therefore move the 'asm' outside the loop to produce
! more efficient code.  Again, using 'volatile' disables this type of
  optimization.
  
       void do_print(uint32_t dwSomeValue)
*************** optimization.
*** 28869,28877 ****
       }
  
   The following example demonstrates a case where you need to use the
! `volatile' qualifier.  It uses the x86 `rdtsc' instruction, which reads
! the computer's time-stamp counter. Without the `volatile' qualifier,
! the optimizers might assume that the `asm' block will always return the
  same value and therefore optimize away the second call.
  
       uint64_t msr;
--- 28672,28680 ----
       }
  
   The following example demonstrates a case where you need to use the
! 'volatile' qualifier.  It uses the x86 'rdtsc' instruction, which reads
! the computer's time-stamp counter.  Without the 'volatile' qualifier,
! the optimizers might assume that the 'asm' block will always return the
  same value and therefore optimize away the second call.
  
       uint64_t msr;
*************** same value and therefore optimize away t
*** 28898,28926 ****
       printf("msr: %llx\n", msr);
  
   GCC's optimizers do not treat this code like the non-volatile code in
! the earlier examples. They do not move it out of loops or omit it on the
! assumption that the result from a previous call is still valid.
  
!  Note that the compiler can move even volatile `asm' instructions
! relative to other code, including across jump instructions. For
  example, on many targets there is a system register that controls the
! rounding mode of floating-point operations. Setting it with a volatile
! `asm', as in the following PowerPC example, does not work reliably.
  
       asm volatile("mtfsf 255, %0" : : "f" (fpenv));
       sum = x + y;
  
!  The compiler may move the addition back before the volatile `asm'. To
! make it work as expected, add an artificial dependency to the `asm' by
  referencing a variable in the subsequent code, for example:
  
       asm volatile ("mtfsf 255,%1" : "=X" (sum) : "f" (fpenv));
       sum = x + y;
  
   Under certain circumstances, GCC may duplicate (or remove duplicates
! of) your assembly code when optimizing. This can lead to unexpected
  duplicate symbol errors during compilation if your asm code defines
! symbols or labels.  Using `%=' (*note AssemblerTemplate::) may help
  resolve this problem.
  
  6.43.2.2 Assembler Template
--- 28701,28729 ----
       printf("msr: %llx\n", msr);
  
   GCC's optimizers do not treat this code like the non-volatile code in
! the earlier examples.  They do not move it out of loops or omit it on
! the assumption that the result from a previous call is still valid.
  
!  Note that the compiler can move even volatile 'asm' instructions
! relative to other code, including across jump instructions.  For
  example, on many targets there is a system register that controls the
! rounding mode of floating-point operations.  Setting it with a volatile
! 'asm', as in the following PowerPC example, does not work reliably.
  
       asm volatile("mtfsf 255, %0" : : "f" (fpenv));
       sum = x + y;
  
!  The compiler may move the addition back before the volatile 'asm'.  To
! make it work as expected, add an artificial dependency to the 'asm' by
  referencing a variable in the subsequent code, for example:
  
       asm volatile ("mtfsf 255,%1" : "=X" (sum) : "f" (fpenv));
       sum = x + y;
  
   Under certain circumstances, GCC may duplicate (or remove duplicates
! of) your assembly code when optimizing.  This can lead to unexpected
  duplicate symbol errors during compilation if your asm code defines
! symbols or labels.  Using '%=' (*note AssemblerTemplate::) may help
  resolve this problem.
  
  6.43.2.2 Assembler Template
*************** resolve this problem.
*** 28929,28963 ****
  An assembler template is a literal string containing assembler
  instructions.  The compiler replaces tokens in the template that refer
  to inputs, outputs, and goto labels, and then outputs the resulting
! string to the assembler. The string can contain any instructions
! recognized by the assembler, including directives. GCC does not parse
  the assembler instructions themselves and does not know what they mean
! or even whether they are valid assembler input. However, it does count
  the statements (*note Size of an asm::).
  
   You may place multiple assembler instructions together in a single
! `asm' string, separated by the characters normally used in assembly
! code for the system. A combination that works in most places is a
! newline to break the line, plus a tab character to move to the
! instruction field (written as `\n\t').  Some assemblers allow
! semicolons as a line separator. However, note that some assembler
! dialects use semicolons to start a comment.
  
!  Do not expect a sequence of `asm' statements to remain perfectly
! consecutive after compilation, even when you are using the `volatile'
! qualifier. If certain instructions need to remain consecutive in the
  output, put them in a single multi-instruction asm statement.
  
   Accessing data from C programs without using input/output operands
  (such as by using global symbols directly from the assembler template)
! may not work as expected. Similarly, calling functions directly from an
  assembler template requires a detailed understanding of the target
  assembler and ABI.
  
   Since GCC does not parse the assembler template, it has no visibility
! of any symbols it references. This may result in GCC discarding those
! symbols as unreferenced unless they are also listed as input, output,
! or goto operands.
  
  Special format strings
  ......................
--- 28732,28766 ----
  An assembler template is a literal string containing assembler
  instructions.  The compiler replaces tokens in the template that refer
  to inputs, outputs, and goto labels, and then outputs the resulting
! string to the assembler.  The string can contain any instructions
! recognized by the assembler, including directives.  GCC does not parse
  the assembler instructions themselves and does not know what they mean
! or even whether they are valid assembler input.  However, it does count
  the statements (*note Size of an asm::).
  
   You may place multiple assembler instructions together in a single
! 'asm' string, separated by the characters normally used in assembly code
! for the system.  A combination that works in most places is a newline to
! break the line, plus a tab character to move to the instruction field
! (written as '\n\t').  Some assemblers allow semicolons as a line
! separator.  However, note that some assembler dialects use semicolons to
! start a comment.
  
!  Do not expect a sequence of 'asm' statements to remain perfectly
! consecutive after compilation, even when you are using the 'volatile'
! qualifier.  If certain instructions need to remain consecutive in the
  output, put them in a single multi-instruction asm statement.
  
   Accessing data from C programs without using input/output operands
  (such as by using global symbols directly from the assembler template)
! may not work as expected.  Similarly, calling functions directly from an
  assembler template requires a detailed understanding of the target
  assembler and ABI.
  
   Since GCC does not parse the assembler template, it has no visibility
! of any symbols it references.  This may result in GCC discarding those
! symbols as unreferenced unless they are also listed as input, output, or
! goto operands.
  
  Special format strings
  ......................
*************** Special format strings
*** 28965,29012 ****
  In addition to the tokens described by the input, output, and goto
  operands, these tokens have special meanings in the assembler template:
  
! `%%'
!      Outputs a single `%' into the assembler code.
  
! `%='
!      Outputs a number that is unique to each instance of the `asm'
!      statement in the entire compilation. This option is useful when
       creating local labels and referring to them multiple times in a
       single template that generates multiple assembler instructions.
  
! `%{'
! `%|'
! `%}'
!      Outputs `{', `|', and `}' characters (respectively) into the
       assembler code.  When unescaped, these characters have special
       meaning to indicate multiple assembler dialects, as described
       below.
  
! Multiple assembler dialects in `asm' templates
  ..............................................
  
  On targets such as x86, GCC supports multiple assembler dialects.  The
! `-masm' option controls which dialect GCC uses as its default for
! inline assembler. The target-specific documentation for the `-masm'
! option contains the list of supported dialects, as well as the default
! dialect if the option is not specified. This information may be
! important to understand, since assembler code that works correctly when
! compiled using one dialect will likely fail if compiled using another.
! *Note x86 Options::.
  
!  If your code needs to support multiple assembler dialects (for
! example, if you are writing public headers that need to support a
! variety of compilation options), use constructs of this form:
  
       { dialect0 | dialect1 | dialect2... }
  
!  This construct outputs `dialect0' when using dialect #0 to compile the
! code, `dialect1' for dialect #1, etc. If there are fewer alternatives
! within the braces than the number of dialects the compiler supports,
! the construct outputs nothing.
  
!  For example, if an x86 compiler supports two dialects (`att',
! `intel'), an assembler template such as this:
  
       "bt{l %[Offset],%[Base] | %[Base],%[Offset]}; jc %l2"
  
--- 28768,28815 ----
  In addition to the tokens described by the input, output, and goto
  operands, these tokens have special meanings in the assembler template:
  
! '%%'
!      Outputs a single '%' into the assembler code.
  
! '%='
!      Outputs a number that is unique to each instance of the 'asm'
!      statement in the entire compilation.  This option is useful when
       creating local labels and referring to them multiple times in a
       single template that generates multiple assembler instructions.
  
! '%{'
! '%|'
! '%}'
!      Outputs '{', '|', and '}' characters (respectively) into the
       assembler code.  When unescaped, these characters have special
       meaning to indicate multiple assembler dialects, as described
       below.
  
! Multiple assembler dialects in 'asm' templates
  ..............................................
  
  On targets such as x86, GCC supports multiple assembler dialects.  The
! '-masm' option controls which dialect GCC uses as its default for inline
! assembler.  The target-specific documentation for the '-masm' option
! contains the list of supported dialects, as well as the default dialect
! if the option is not specified.  This information may be important to
! understand, since assembler code that works correctly when compiled
! using one dialect will likely fail if compiled using another.  *Note x86
! Options::.
  
!  If your code needs to support multiple assembler dialects (for example,
! if you are writing public headers that need to support a variety of
! compilation options), use constructs of this form:
  
       { dialect0 | dialect1 | dialect2... }
  
!  This construct outputs 'dialect0' when using dialect #0 to compile the
! code, 'dialect1' for dialect #1, etc.  If there are fewer alternatives
! within the braces than the number of dialects the compiler supports, the
! construct outputs nothing.
  
!  For example, if an x86 compiler supports two dialects ('att', 'intel'),
! an assembler template such as this:
  
       "bt{l %[Offset],%[Base] | %[Base],%[Offset]}; jc %l2"
  
*************** corresponds to either
*** 29029,29039 ****
  6.43.2.3 Output Operands
  ........................
  
! An `asm' statement has zero or more output operands indicating the names
  of C variables modified by the assembler code.
  
!  In this i386 example, `old' (referred to in the template string as
! `%0') and `*Base' (as `%1') are outputs and `Offset' (`%2') is an input:
  
       bool old;
  
--- 28832,28842 ----
  6.43.2.3 Output Operands
  ........................
  
! An 'asm' statement has zero or more output operands indicating the names
  of C variables modified by the assembler code.
  
!  In this i386 example, 'old' (referred to in the template string as
! '%0') and '*Base' (as '%1') are outputs and 'Offset' ('%2') is an input:
  
       bool old;
  
*************** of C variables modified by the assembler
*** 29052,29088 ****
  ASMSYMBOLICNAME
       Specifies a symbolic name for the operand.  Reference the name in
       the assembler template by enclosing it in square brackets (i.e.
!      `%[Value]'). The scope of the name is the `asm' statement that
!      contains the definition. Any valid C variable name is acceptable,
!      including names already defined in the surrounding code. No two
!      operands within the same `asm' statement can use the same symbolic
       name.
  
!      When not using an ASMSYMBOLICNAME, use the (zero-based) position
!      of the operand in the list of operands in the assembler template.
!      For example if there are three output operands, use `%0' in the
!      template to refer to the first, `%1' for the second, and `%2' for
       the third.
  
  CONSTRAINT
       A string constant specifying constraints on the placement of the
       operand; *Note Constraints::, for details.
  
!      Output constraints must begin with either `=' (a variable
!      overwriting an existing value) or `+' (when reading and writing).
!      When using `=', do not assume the location contains the existing
!      value on entry to the `asm', except when the operand is tied to an
       input; *note Input Operands: InputOperands.
  
       After the prefix, there must be one or more additional constraints
!      (*note Constraints::) that describe where the value resides. Common
!      constraints include `r' for register and `m' for memory.  When you
!      list more than one possible location (for example, `"=rm"'), the
!      compiler chooses the most efficient one based on the current
!      context.  If you list as many alternates as the `asm' statement
!      allows, you permit the optimizers to produce the best possible
!      code.  If you must use a specific register, but your Machine
!      Constraints do not provide sufficient control to select the
       specific register you want, local register variables may provide a
       solution (*note Local Reg Vars::).
  
--- 28855,28891 ----
  ASMSYMBOLICNAME
       Specifies a symbolic name for the operand.  Reference the name in
       the assembler template by enclosing it in square brackets (i.e.
!      '%[Value]').  The scope of the name is the 'asm' statement that
!      contains the definition.  Any valid C variable name is acceptable,
!      including names already defined in the surrounding code.  No two
!      operands within the same 'asm' statement can use the same symbolic
       name.
  
!      When not using an ASMSYMBOLICNAME, use the (zero-based) position of
!      the operand in the list of operands in the assembler template.  For
!      example if there are three output operands, use '%0' in the
!      template to refer to the first, '%1' for the second, and '%2' for
       the third.
  
  CONSTRAINT
       A string constant specifying constraints on the placement of the
       operand; *Note Constraints::, for details.
  
!      Output constraints must begin with either '=' (a variable
!      overwriting an existing value) or '+' (when reading and writing).
!      When using '=', do not assume the location contains the existing
!      value on entry to the 'asm', except when the operand is tied to an
       input; *note Input Operands: InputOperands.
  
       After the prefix, there must be one or more additional constraints
!      (*note Constraints::) that describe where the value resides.
!      Common constraints include 'r' for register and 'm' for memory.
!      When you list more than one possible location (for example,
!      '"=rm"'), the compiler chooses the most efficient one based on the
!      current context.  If you list as many alternates as the 'asm'
!      statement allows, you permit the optimizers to produce the best
!      possible code.  If you must use a specific register, but your
!      Machine Constraints do not provide sufficient control to select the
       specific register you want, local register variables may provide a
       solution (*note Local Reg Vars::).
  
*************** CVARIABLENAME
*** 29091,29146 ****
       variable name.  The enclosing parentheses are a required part of
       the syntax.
  
- 
   When the compiler selects the registers to use to represent the output
  operands, it does not use any of the clobbered registers (*note
  Clobbers::).
  
!  Output operand expressions must be lvalues. The compiler cannot check
  whether the operands have data types that are reasonable for the
! instruction being executed. For output expressions that are not
  directly addressable (for example a bit-field), the constraint must
! allow a register. In that case, GCC uses the register as the output of
! the `asm', and then stores that register into the output.
  
!  Operands using the `+' constraint modifier count as two operands (that
  is, both as input and output) towards the total maximum of 30 operands
! per `asm' statement.
  
!  Use the `&' constraint modifier (*note Modifiers::) on all output
  operands that must not overlap an input.  Otherwise, GCC may allocate
  the output operand in the same register as an unrelated input operand,
  on the assumption that the assembler code consumes its inputs before
! producing outputs. This assumption may be false if the assembler code
  actually consists of more than one instruction.
  
   The same problem can occur if one output parameter (A) allows a
  register constraint and another output parameter (B) allows a memory
! constraint.  The code generated by GCC to access the memory address in
! B can contain registers which _might_ be shared by A, and GCC considers
! those registers to be inputs to the asm. As above, GCC assumes that
! such input registers are consumed before any outputs are written. This
  assumption may result in incorrect behavior if the asm writes to A
! before using B. Combining the `&' modifier with the register constraint
  on A ensures that modifying A does not affect the address referenced by
! B. Otherwise, the location of B is undefined if A is modified before
  using B.
  
!  `asm' supports operand modifiers on operands (for example `%k2'
! instead of simply `%2'). Typically these qualifiers are hardware
! dependent. The list of supported modifiers for x86 is found at *note
! x86 Operand modifiers: x86Operandmodifiers.
  
!  If the C code that follows the `asm' makes no use of any of the output
! operands, use `volatile' for the `asm' statement to prevent the
! optimizers from discarding the `asm' statement as unneeded (see *note
  Volatile::).
  
!  This code makes no use of the optional ASMSYMBOLICNAME. Therefore it
! references the first output operand as `%0' (were there a second, it
! would be `%1', etc). The number of the first input operand is one
! greater than that of the last output operand. In this i386 example,
! that makes `Mask' referenced as `%1':
  
       uint32_t Mask = 1234;
       uint32_t Index;
--- 28894,28948 ----
       variable name.  The enclosing parentheses are a required part of
       the syntax.
  
   When the compiler selects the registers to use to represent the output
  operands, it does not use any of the clobbered registers (*note
  Clobbers::).
  
!  Output operand expressions must be lvalues.  The compiler cannot check
  whether the operands have data types that are reasonable for the
! instruction being executed.  For output expressions that are not
  directly addressable (for example a bit-field), the constraint must
! allow a register.  In that case, GCC uses the register as the output of
! the 'asm', and then stores that register into the output.
  
!  Operands using the '+' constraint modifier count as two operands (that
  is, both as input and output) towards the total maximum of 30 operands
! per 'asm' statement.
  
!  Use the '&' constraint modifier (*note Modifiers::) on all output
  operands that must not overlap an input.  Otherwise, GCC may allocate
  the output operand in the same register as an unrelated input operand,
  on the assumption that the assembler code consumes its inputs before
! producing outputs.  This assumption may be false if the assembler code
  actually consists of more than one instruction.
  
   The same problem can occur if one output parameter (A) allows a
  register constraint and another output parameter (B) allows a memory
! constraint.  The code generated by GCC to access the memory address in B
! can contain registers which _might_ be shared by A, and GCC considers
! those registers to be inputs to the asm.  As above, GCC assumes that
! such input registers are consumed before any outputs are written.  This
  assumption may result in incorrect behavior if the asm writes to A
! before using B.  Combining the '&' modifier with the register constraint
  on A ensures that modifying A does not affect the address referenced by
! B.  Otherwise, the location of B is undefined if A is modified before
  using B.
  
!  'asm' supports operand modifiers on operands (for example '%k2' instead
! of simply '%2').  Typically these qualifiers are hardware dependent.
! The list of supported modifiers for x86 is found at *note x86 Operand
! modifiers: x86Operandmodifiers.
  
!  If the C code that follows the 'asm' makes no use of any of the output
! operands, use 'volatile' for the 'asm' statement to prevent the
! optimizers from discarding the 'asm' statement as unneeded (see *note
  Volatile::).
  
!  This code makes no use of the optional ASMSYMBOLICNAME.  Therefore it
! references the first output operand as '%0' (were there a second, it
! would be '%1', etc).  The number of the first input operand is one
! greater than that of the last output operand.  In this i386 example,
! that makes 'Mask' referenced as '%1':
  
       uint32_t Mask = 1234;
       uint32_t Index;
*************** that makes `Mask' referenced as `%1':
*** 29150,29167 ****
            : "r" (Mask)
            : "cc");
  
!  That code overwrites the variable `Index' (`='), placing the value in
! a register (`r').  Using the generic `r' constraint instead of a
  constraint for a specific register allows the compiler to pick the
! register to use, which can result in more efficient code. This may not
  be possible if an assembler instruction requires a specific register.
  
   The following i386 example uses the ASMSYMBOLICNAME syntax.  It
  produces the same result as the code above, but some may consider it
! more readable or more maintainable since reordering index numbers is
! not necessary when adding or removing operands. The names `aIndex' and
! `aMask' are only used in this example to emphasize which names get used
! where.  It is acceptable to reuse the names `Index' and `Mask'.
  
       uint32_t Mask = 1234;
       uint32_t Index;
--- 28952,28969 ----
            : "r" (Mask)
            : "cc");
  
!  That code overwrites the variable 'Index' ('='), placing the value in a
! register ('r').  Using the generic 'r' constraint instead of a
  constraint for a specific register allows the compiler to pick the
! register to use, which can result in more efficient code.  This may not
  be possible if an assembler instruction requires a specific register.
  
   The following i386 example uses the ASMSYMBOLICNAME syntax.  It
  produces the same result as the code above, but some may consider it
! more readable or more maintainable since reordering index numbers is not
! necessary when adding or removing operands.  The names 'aIndex' and
! 'aMask' are only used in this example to emphasize which names get used
! where.  It is acceptable to reuse the names 'Index' and 'Mask'.
  
       uint32_t Mask = 1234;
       uint32_t Index;
*************** where.  It is acceptable to reuse the na
*** 29181,29196 ****
          : [d] "=rm" (d)
          : [e] "rm" (*e));
  
!  Here, `d' may either be in a register or in memory. Since the compiler
! might already have the current value of the `uint32_t' location pointed
! to by `e' in a register, you can enable it to choose the best location
! for `d' by specifying both constraints.
  
  6.43.2.4 Input Operands
  .......................
  
! Input operands make values from C variables and expressions available
! to the assembly code.
  
   Operands are separated by commas.  Each operand has this format:
  
--- 28983,28998 ----
          : [d] "=rm" (d)
          : [e] "rm" (*e));
  
!  Here, 'd' may either be in a register or in memory.  Since the compiler
! might already have the current value of the 'uint32_t' location pointed
! to by 'e' in a register, you can enable it to choose the best location
! for 'd' by specifying both constraints.
  
  6.43.2.4 Input Operands
  .......................
  
! Input operands make values from C variables and expressions available to
! the assembly code.
  
   Operands are separated by commas.  Each operand has this format:
  
*************** to the assembly code.
*** 29199,29241 ****
  ASMSYMBOLICNAME
       Specifies a symbolic name for the operand.  Reference the name in
       the assembler template by enclosing it in square brackets (i.e.
!      `%[Value]'). The scope of the name is the `asm' statement that
!      contains the definition. Any valid C variable name is acceptable,
!      including names already defined in the surrounding code. No two
!      operands within the same `asm' statement can use the same symbolic
       name.
  
!      When not using an ASMSYMBOLICNAME, use the (zero-based) position
!      of the operand in the list of operands in the assembler template.
!      For example if there are two output operands and three inputs, use
!      `%2' in the template to refer to the first input operand, `%3' for
!      the second, and `%4' for the third.
  
  CONSTRAINT
       A string constant specifying constraints on the placement of the
       operand; *Note Constraints::, for details.
  
!      Input constraint strings may not begin with either `=' or `+'.
       When you list more than one possible location (for example,
!      `"irm"'), the compiler chooses the most efficient one based on the
       current context.  If you must use a specific register, but your
!      Machine Constraints do not provide sufficient control to select
!      the specific register you want, local register variables may
!      provide a solution (*note Local Reg Vars::).
  
!      Input constraints can also be digits (for example, `"0"'). This
!      indicates that the specified input must be in the same place as
!      the output constraint at the (zero-based) index in the output
       constraint list.  When using ASMSYMBOLICNAME syntax for the output
!      operands, you may use these names (enclosed in brackets `[]')
       instead of digits.
  
  CEXPRESSION
!      This is the C variable or expression being passed to the `asm'
       statement as input.  The enclosing parentheses are a required part
       of the syntax.
  
- 
   When the compiler selects the registers to use to represent the input
  operands, it does not use any of the clobbered registers (*note
  Clobbers::).
--- 29001,29042 ----
  ASMSYMBOLICNAME
       Specifies a symbolic name for the operand.  Reference the name in
       the assembler template by enclosing it in square brackets (i.e.
!      '%[Value]').  The scope of the name is the 'asm' statement that
!      contains the definition.  Any valid C variable name is acceptable,
!      including names already defined in the surrounding code.  No two
!      operands within the same 'asm' statement can use the same symbolic
       name.
  
!      When not using an ASMSYMBOLICNAME, use the (zero-based) position of
!      the operand in the list of operands in the assembler template.  For
!      example if there are two output operands and three inputs, use '%2'
!      in the template to refer to the first input operand, '%3' for the
!      second, and '%4' for the third.
  
  CONSTRAINT
       A string constant specifying constraints on the placement of the
       operand; *Note Constraints::, for details.
  
!      Input constraint strings may not begin with either '=' or '+'.
       When you list more than one possible location (for example,
!      '"irm"'), the compiler chooses the most efficient one based on the
       current context.  If you must use a specific register, but your
!      Machine Constraints do not provide sufficient control to select the
!      specific register you want, local register variables may provide a
!      solution (*note Local Reg Vars::).
  
!      Input constraints can also be digits (for example, '"0"').  This
!      indicates that the specified input must be in the same place as the
!      output constraint at the (zero-based) index in the output
       constraint list.  When using ASMSYMBOLICNAME syntax for the output
!      operands, you may use these names (enclosed in brackets '[]')
       instead of digits.
  
  CEXPRESSION
!      This is the C variable or expression being passed to the 'asm'
       statement as input.  The enclosing parentheses are a required part
       of the syntax.
  
   When the compiler selects the registers to use to represent the input
  operands, it does not use any of the clobbered registers (*note
  Clobbers::).
*************** consecutive colons where the output oper
*** 29248,29276 ****
          : "r" (Offset / 8));
  
   *Warning:* Do _not_ modify the contents of input-only operands (except
! for inputs tied to outputs). The compiler assumes that on exit from the
! `asm' statement these operands contain the same values as they had
! before executing the statement.  It is _not_ possible to use clobbers
! to inform the compiler that the values in these inputs are changing. One
  common work-around is to tie the changing input variable to an output
! variable that never gets used. Note, however, that if the code that
! follows the `asm' statement makes no use of any of the output operands,
! the GCC optimizers may discard the `asm' statement as unneeded (see
  *note Volatile::).
  
!  `asm' supports operand modifiers on operands (for example `%k2'
! instead of simply `%2'). Typically these qualifiers are hardware
! dependent. The list of supported modifiers for x86 is found at *note
! x86 Operand modifiers: x86Operandmodifiers.
  
!  In this example using the fictitious `combine' instruction, the
! constraint `"0"' for input operand 1 says that it must occupy the same
! location as output operand 0. Only input operands may use numbers in
! constraints, and they must each refer to an output operand. Only a
  number (or the symbolic assembler name) in the constraint can guarantee
! that one operand is in the same place as another. The mere fact that
! `foo' is the value of both operands is not enough to guarantee that
! they are in the same place in the generated assembler code.
  
       asm ("combine %2, %0"
          : "=r" (foo)
--- 29049,29077 ----
          : "r" (Offset / 8));
  
   *Warning:* Do _not_ modify the contents of input-only operands (except
! for inputs tied to outputs).  The compiler assumes that on exit from the
! 'asm' statement these operands contain the same values as they had
! before executing the statement.  It is _not_ possible to use clobbers to
! inform the compiler that the values in these inputs are changing.  One
  common work-around is to tie the changing input variable to an output
! variable that never gets used.  Note, however, that if the code that
! follows the 'asm' statement makes no use of any of the output operands,
! the GCC optimizers may discard the 'asm' statement as unneeded (see
  *note Volatile::).
  
!  'asm' supports operand modifiers on operands (for example '%k2' instead
! of simply '%2').  Typically these qualifiers are hardware dependent.
! The list of supported modifiers for x86 is found at *note x86 Operand
! modifiers: x86Operandmodifiers.
  
!  In this example using the fictitious 'combine' instruction, the
! constraint '"0"' for input operand 1 says that it must occupy the same
! location as output operand 0.  Only input operands may use numbers in
! constraints, and they must each refer to an output operand.  Only a
  number (or the symbolic assembler name) in the constraint can guarantee
! that one operand is in the same place as another.  The mere fact that
! 'foo' is the value of both operands is not enough to guarantee that they
! are in the same place in the generated assembler code.
  
       asm ("combine %2, %0"
          : "=r" (foo)
*************** they are in the same place in the genera
*** 29286,29313 ****
  .................
  
  While the compiler is aware of changes to entries listed in the output
! operands, the inline `asm' code may modify more than just the outputs.
  For example, calculations may require additional registers, or the
  processor may overwrite a register as a side effect of a particular
  assembler instruction.  In order to inform the compiler of these
! changes, list them in the clobber list. Clobber list items are either
! register names or the special clobbers (listed below). Each clobber
  list item is a string constant enclosed in double quotes and separated
  by commas.
  
   Clobber descriptions may not in any way overlap with an input or output
! operand. For example, you may not have an operand describing a register
  class with one member when listing that register in the clobber list.
  Variables declared to live in specific registers (*note Explicit Reg
! Vars::) and used as `asm' input or output operands must have no part
! mentioned in the clobber description. In particular, there is no way to
! specify that input operands get modified without also specifying them
! as output operands.
  
!  When the compiler selects which registers to use to represent input
! and output operands, it does not use any of the clobbered registers. As
! a result, clobbered registers are available for any use in the
! assembler code.
  
   Here is a realistic example for the VAX showing the use of clobbered
  registers:
--- 29087,29114 ----
  .................
  
  While the compiler is aware of changes to entries listed in the output
! operands, the inline 'asm' code may modify more than just the outputs.
  For example, calculations may require additional registers, or the
  processor may overwrite a register as a side effect of a particular
  assembler instruction.  In order to inform the compiler of these
! changes, list them in the clobber list.  Clobber list items are either
! register names or the special clobbers (listed below).  Each clobber
  list item is a string constant enclosed in double quotes and separated
  by commas.
  
   Clobber descriptions may not in any way overlap with an input or output
! operand.  For example, you may not have an operand describing a register
  class with one member when listing that register in the clobber list.
  Variables declared to live in specific registers (*note Explicit Reg
! Vars::) and used as 'asm' input or output operands must have no part
! mentioned in the clobber description.  In particular, there is no way to
! specify that input operands get modified without also specifying them as
! output operands.
  
!  When the compiler selects which registers to use to represent input and
! output operands, it does not use any of the clobbered registers.  As a
! result, clobbered registers are available for any use in the assembler
! code.
  
   Here is a realistic example for the VAX showing the use of clobbered
  registers:
*************** registers:
*** 29319,29390 ****
  
   Also, there are two special clobber arguments:
  
! `"cc"'
!      The `"cc"' clobber indicates that the assembler code modifies the
!      flags register. On some machines, GCC represents the condition
!      codes as a specific hardware register; `"cc"' serves to name this
       register.  On other machines, condition code handling is different,
!      and specifying `"cc"' has no effect. But it is valid no matter
       what the target.
  
! `"memory"'
!      The `"memory"' clobber tells the compiler that the assembly code
!      performs memory reads or writes to items other than those listed
!      in the input and output operands (for example, accessing the
!      memory pointed to by one of the input parameters). To ensure
!      memory contains correct values, GCC may need to flush specific
!      register values to memory before executing the `asm'. Further, the
!      compiler does not assume that any values read from memory before an
!      `asm' remain unchanged after that `asm'; it reloads them as needed.
!      Using the `"memory"' clobber effectively forms a read/write memory
       barrier for the compiler.
  
       Note that this clobber does not prevent the _processor_ from doing
!      speculative reads past the `asm' statement. To prevent that, you
       need processor-specific fence instructions.
  
       Flushing registers to memory has performance implications and may
       be an issue for time-sensitive code.  You can use a trick to avoid
       this if the size of the memory being accessed is known at compile
!      time. For example, if accessing ten bytes of a string, use a
       memory input like:
  
!      `{"m"( ({ struct { char x[10]; } *p = (void *)ptr ; *p; }) )}'.
! 
  
  6.43.2.6 Goto Labels
  ....................
  
! `asm goto' allows assembly code to jump to one or more C labels.  The
! GOTOLABELS section in an `asm goto' statement contains a comma-separated
! list of all C labels to which the assembler code may jump. GCC assumes
! that `asm' execution falls through to the next statement (if this is
! not the case, consider using the `__builtin_unreachable' intrinsic
! after the `asm' statement). Optimization of `asm goto' may be improved
! by using the `hot' and `cold' label attributes (*note Label
! Attributes::).
  
!  An `asm goto' statement cannot have outputs.  This is due to an
  internal restriction of the compiler: control transfer instructions
  cannot have outputs.  If the assembler code does modify anything, use
! the `"memory"' clobber to force the optimizers to flush all register
! values to memory and reload them if necessary after the `asm' statement.
  
!  Also note that an `asm goto' statement is always implicitly considered
  volatile.
  
!  To reference a label in the assembler template, prefix it with `%l'
! (lowercase `L') followed by its (zero-based) position in GOTOLABELS
! plus the number of input operands.  For example, if the `asm' has three
! inputs and references two labels, refer to the first label as `%l3' and
! the second as `%l4').
  
   Alternately, you can reference labels using the actual C label name
! enclosed in brackets.  For example, to reference a label named `carry',
! you can use `%l[carry]'.  The label must still be listed in the
  GOTOLABELS section when using this approach.
  
!  Here is an example of `asm goto' for i386:
  
       asm goto (
           "btl %1, %0\n\t"
--- 29120,29189 ----
  
   Also, there are two special clobber arguments:
  
! '"cc"'
!      The '"cc"' clobber indicates that the assembler code modifies the
!      flags register.  On some machines, GCC represents the condition
!      codes as a specific hardware register; '"cc"' serves to name this
       register.  On other machines, condition code handling is different,
!      and specifying '"cc"' has no effect.  But it is valid no matter
       what the target.
  
! '"memory"'
!      The '"memory"' clobber tells the compiler that the assembly code
!      performs memory reads or writes to items other than those listed in
!      the input and output operands (for example, accessing the memory
!      pointed to by one of the input parameters).  To ensure memory
!      contains correct values, GCC may need to flush specific register
!      values to memory before executing the 'asm'.  Further, the compiler
!      does not assume that any values read from memory before an 'asm'
!      remain unchanged after that 'asm'; it reloads them as needed.
!      Using the '"memory"' clobber effectively forms a read/write memory
       barrier for the compiler.
  
       Note that this clobber does not prevent the _processor_ from doing
!      speculative reads past the 'asm' statement.  To prevent that, you
       need processor-specific fence instructions.
  
       Flushing registers to memory has performance implications and may
       be an issue for time-sensitive code.  You can use a trick to avoid
       this if the size of the memory being accessed is known at compile
!      time.  For example, if accessing ten bytes of a string, use a
       memory input like:
  
!      '{"m"( ({ struct { char x[10]; } *p = (void *)ptr ; *p; }) )}'.
  
  6.43.2.6 Goto Labels
  ....................
  
! 'asm goto' allows assembly code to jump to one or more C labels.  The
! GOTOLABELS section in an 'asm goto' statement contains a comma-separated
! list of all C labels to which the assembler code may jump.  GCC assumes
! that 'asm' execution falls through to the next statement (if this is not
! the case, consider using the '__builtin_unreachable' intrinsic after the
! 'asm' statement).  Optimization of 'asm goto' may be improved by using
! the 'hot' and 'cold' label attributes (*note Label Attributes::).
  
!  An 'asm goto' statement cannot have outputs.  This is due to an
  internal restriction of the compiler: control transfer instructions
  cannot have outputs.  If the assembler code does modify anything, use
! the '"memory"' clobber to force the optimizers to flush all register
! values to memory and reload them if necessary after the 'asm' statement.
  
!  Also note that an 'asm goto' statement is always implicitly considered
  volatile.
  
!  To reference a label in the assembler template, prefix it with '%l'
! (lowercase 'L') followed by its (zero-based) position in GOTOLABELS plus
! the number of input operands.  For example, if the 'asm' has three
! inputs and references two labels, refer to the first label as '%l3' and
! the second as '%l4').
  
   Alternately, you can reference labels using the actual C label name
! enclosed in brackets.  For example, to reference a label named 'carry',
! you can use '%l[carry]'.  The label must still be listed in the
  GOTOLABELS section when using this approach.
  
!  Here is an example of 'asm goto' for i386:
  
       asm goto (
           "btl %1, %0\n\t"
*************** GOTOLABELS section when using this appro
*** 29399,29405 ****
       carry:
       return 1;
  
!  The following example shows an `asm goto' that uses a memory clobber.
  
       int frob(int x)
       {
--- 29198,29204 ----
       carry:
       return 1;
  
!  The following example shows an 'asm goto' that uses a memory clobber.
  
       int frob(int x)
       {
*************** GOTOLABELS section when using this appro
*** 29418,29426 ****
  ..............................
  
  References to input, output, and goto operands in the assembler template
! of extended `asm' statements can use modifiers to affect the way the
! operands are formatted in the code output to the assembler. For
! example, the following code uses the `h' and `b' modifiers for x86:
  
       uint16_t  num;
       asm volatile ("xchg %h0, %b0" : "+a" (num) );
--- 29217,29225 ----
  ..............................
  
  References to input, output, and goto operands in the assembler template
! of extended 'asm' statements can use modifiers to affect the way the
! operands are formatted in the code output to the assembler.  For
! example, the following code uses the 'h' and 'b' modifiers for x86:
  
       uint16_t  num;
       asm volatile ("xchg %h0, %b0" : "+a" (num) );
*************** purposes.
*** 29446,29515 ****
       }
  
   With no modifiers, this is what the output from the operands would be
! for the `att' and `intel' dialects of assembler:
  
  Operand   masm=att   masm=intel
! --------------------------------------- 
! `%0'      `%eax'     `eax'
! `%1'      `$2'       `2'
! `%2'      `$.L2'     `OFFSET FLAT:.L2'
  
   The table below shows the list of supported modifiers and their
  effects.
  
! Modifier   Description                                  Operand   `masm=att' `masm=intel'
! ------------------------------------------------------------------------------------------ 
! `z'        Print the opcode suffix for the size of the  `%z0'     `l'        
!            current integer operand (one of                                   
!            `b'/`w'/`l'/`q').                                                 
! `b'        Print the QImode name of the register.       `%b0'     `%al'      `al'
! `h'        Print the QImode name for a "high" register. `%h0'     `%ah'      `ah'
! `w'        Print the HImode name of the register.       `%w0'     `%ax'      `ax'
! `k'        Print the SImode name of the register.       `%k0'     `%eax'     `eax'
! `q'        Print the DImode name of the register.       `%q0'     `%rax'     `rax'
! `l'        Print the label name with no punctuation.    `%l2'     `.L2'      `.L2'
! `c'        Require a constant operand and print the     `%c1'     `2'        `2'
!            constant expression with no punctuation.                          
  
! 6.43.2.8 x86 Floating-Point `asm' Operands
  ..........................................
  
  On x86 targets, there are several rules on the usage of stack-like
! registers in the operands of an `asm'.  These rules apply only to the
  operands that are stack-like registers:
  
!   1. Given a set of input registers that die in an `asm', it is
!      necessary to know which are implicitly popped by the `asm', and
       which must be explicitly popped by GCC.
  
!      An input register that is implicitly popped by the `asm' must be
       explicitly clobbered, unless it is constrained to match an output
       operand.
  
!   2. For any input register that is implicitly popped by an `asm', it is
       necessary to know how to adjust the stack to compensate for the
!      pop.  If any non-popped input is closer to the top of the
!      reg-stack than the implicitly popped register, it would not be
!      possible to know what the stack looked like--it's not clear how
!      the rest of the stack "slides up".
  
       All implicitly popped input registers must be closer to the top of
       the reg-stack than any input that is not implicitly popped.
  
!      It is possible that if an input dies in an `asm', the compiler
       might use the input register for an output reload.  Consider this
       example:
  
            asm ("foo" : "=t" (a) : "f" (b));
  
!      This code says that input `b' is not popped by the `asm', and that
!      the `asm' pushes a result onto the reg-stack, i.e., the stack is
!      one deeper after the `asm' than it was before.  But, it is
!      possible that reload may think that it can use the same register
!      for both the input and the output.
  
!      To prevent this from happening, if any input operand uses the `f'
!      constraint, all output register constraints must use the `&'
       early-clobber modifier.
  
       The example above is correctly written as:
--- 29245,29316 ----
       }
  
   With no modifiers, this is what the output from the operands would be
! for the 'att' and 'intel' dialects of assembler:
  
  Operand   masm=att   masm=intel
! ---------------------------------------
! '%0'      '%eax'     'eax'
! '%1'      '$2'       '2'
! '%2'      '$.L2'     'OFFSET
!                      FLAT:.L2'
  
   The table below shows the list of supported modifiers and their
  effects.
  
! Modifier   Description                                  Operand   'masm=att' 'masm=intel'
! ------------------------------------------------------------------------------------------
! 'z'        Print the opcode suffix for the size of      '%z0'     'l'
!            the current integer operand (one of
!            'b'/'w'/'l'/'q').
! 'b'        Print the QImode name of the register.       '%b0'     '%al'      'al'
! 'h'        Print the QImode name for a "high"           '%h0'     '%ah'      'ah'
!            register.
! 'w'        Print the HImode name of the register.       '%w0'     '%ax'      'ax'
! 'k'        Print the SImode name of the register.       '%k0'     '%eax'     'eax'
! 'q'        Print the DImode name of the register.       '%q0'     '%rax'     'rax'
! 'l'        Print the label name with no punctuation.    '%l2'     '.L2'      '.L2'
! 'c'        Require a constant operand and print the     '%c1'     '2'        '2'
!            constant expression with no punctuation.
  
! 6.43.2.8 x86 Floating-Point 'asm' Operands
  ..........................................
  
  On x86 targets, there are several rules on the usage of stack-like
! registers in the operands of an 'asm'.  These rules apply only to the
  operands that are stack-like registers:
  
!   1. Given a set of input registers that die in an 'asm', it is
!      necessary to know which are implicitly popped by the 'asm', and
       which must be explicitly popped by GCC.
  
!      An input register that is implicitly popped by the 'asm' must be
       explicitly clobbered, unless it is constrained to match an output
       operand.
  
!   2. For any input register that is implicitly popped by an 'asm', it is
       necessary to know how to adjust the stack to compensate for the
!      pop.  If any non-popped input is closer to the top of the reg-stack
!      than the implicitly popped register, it would not be possible to
!      know what the stack looked like--it's not clear how the rest of the
!      stack "slides up".
  
       All implicitly popped input registers must be closer to the top of
       the reg-stack than any input that is not implicitly popped.
  
!      It is possible that if an input dies in an 'asm', the compiler
       might use the input register for an output reload.  Consider this
       example:
  
            asm ("foo" : "=t" (a) : "f" (b));
  
!      This code says that input 'b' is not popped by the 'asm', and that
!      the 'asm' pushes a result onto the reg-stack, i.e., the stack is
!      one deeper after the 'asm' than it was before.  But, it is possible
!      that reload may think that it can use the same register for both
!      the input and the output.
  
!      To prevent this from happening, if any input operand uses the 'f'
!      constraint, all output register constraints must use the '&'
       early-clobber modifier.
  
       The example above is correctly written as:
*************** operands that are stack-like registers:
*** 29517,29571 ****
            asm ("foo" : "=&t" (a) : "f" (b));
  
    3. Some operands need to be in particular places on the stack.  All
!      output operands fall in this category--GCC has no other way to
!      know which registers the outputs appear in unless you indicate
!      this in the constraints.
  
       Output operands must specifically indicate which register an output
!      appears in after an `asm'.  `=f' is not allowed: the operand
       constraints must select a class with a single register.
  
    4. Output operands may not be "inserted" between existing stack
       registers.  Since no 387 opcode uses a read/write operand, all
!      output operands are dead before the `asm', and are pushed by the
!      `asm'.  It makes no sense to push anywhere but the top of the
       reg-stack.
  
       Output operands must start at the top of the reg-stack: output
       operands may not "skip" a register.
  
!   5. Some `asm' statements may need extra stack space for internal
       calculations.  This can be guaranteed by clobbering stack registers
       unrelated to the inputs and outputs.
  
! 
!  This `asm' takes one input, which is internally popped, and produces
  two outputs.
  
       asm ("fsincos" : "=t" (cos), "=u" (sin) : "0" (inp));
  
! This `asm' takes two inputs, which are popped by the `fyl2xp1' opcode,
! and replaces them with one output.  The `st(1)' clobber is necessary
! for the compiler to know that `fyl2xp1' pops both inputs.
  
       asm ("fyl2xp1" : "=t" (result) : "0" (x), "u" (y) : "st(1)");
  
  
  File: gcc.info,  Node: Constraints,  Next: Asm Labels,  Prev: Extended Asm,  Up: Using Assembly Language with C
  
! 6.43.3 Constraints for `asm' Operands
  -------------------------------------
  
  Here are specific details on what constraint letters you can use with
! `asm' operands.  Constraints can say whether an operand may be in a
  register, and which kinds of register; whether the operand can be a
! memory reference, and which kinds of address; whether the operand may
! be an immediate constant, and which possible values it may have.
! Constraints can also require two operands to match.  Side-effects
! aren't allowed in operands of inline `asm', unless `<' or `>'
! constraints are used, because there is no guarantee that the
! side-effects will happen exactly once in an instruction that can update
! the addressing register.
  
  * Menu:
  
--- 29318,29370 ----
            asm ("foo" : "=&t" (a) : "f" (b));
  
    3. Some operands need to be in particular places on the stack.  All
!      output operands fall in this category--GCC has no other way to know
!      which registers the outputs appear in unless you indicate this in
!      the constraints.
  
       Output operands must specifically indicate which register an output
!      appears in after an 'asm'.  '=f' is not allowed: the operand
       constraints must select a class with a single register.
  
    4. Output operands may not be "inserted" between existing stack
       registers.  Since no 387 opcode uses a read/write operand, all
!      output operands are dead before the 'asm', and are pushed by the
!      'asm'.  It makes no sense to push anywhere but the top of the
       reg-stack.
  
       Output operands must start at the top of the reg-stack: output
       operands may not "skip" a register.
  
!   5. Some 'asm' statements may need extra stack space for internal
       calculations.  This can be guaranteed by clobbering stack registers
       unrelated to the inputs and outputs.
  
!  This 'asm' takes one input, which is internally popped, and produces
  two outputs.
  
       asm ("fsincos" : "=t" (cos), "=u" (sin) : "0" (inp));
  
! This 'asm' takes two inputs, which are popped by the 'fyl2xp1' opcode,
! and replaces them with one output.  The 'st(1)' clobber is necessary for
! the compiler to know that 'fyl2xp1' pops both inputs.
  
       asm ("fyl2xp1" : "=t" (result) : "0" (x), "u" (y) : "st(1)");
  
  
  File: gcc.info,  Node: Constraints,  Next: Asm Labels,  Prev: Extended Asm,  Up: Using Assembly Language with C
  
! 6.43.3 Constraints for 'asm' Operands
  -------------------------------------
  
  Here are specific details on what constraint letters you can use with
! 'asm' operands.  Constraints can say whether an operand may be in a
  register, and which kinds of register; whether the operand can be a
! memory reference, and which kinds of address; whether the operand may be
! an immediate constant, and which possible values it may have.
! Constraints can also require two operands to match.  Side-effects aren't
! allowed in operands of inline 'asm', unless '<' or '>' constraints are
! used, because there is no guarantee that the side-effects will happen
! exactly once in an instruction that can update the addressing register.
  
  * Menu:
  
*************** whitespace
*** 29591,29603 ****
       description even if they have different number of constraints and
       modifiers.
  
! `m'
       A memory operand is allowed, with any kind of address that the
       machine supports in general.  Note that the letter used for the
!      general memory constraint can be re-defined by a back end using
!      the `TARGET_MEM_CONSTRAINT' macro.
  
! `o'
       A memory operand is allowed, but only if the address is
       "offsettable".  This means that adding a small integer (actually,
       the width in bytes of the operand, as determined by its machine
--- 29390,29402 ----
       description even if they have different number of constraints and
       modifiers.
  
! 'm'
       A memory operand is allowed, with any kind of address that the
       machine supports in general.  Note that the letter used for the
!      general memory constraint can be re-defined by a back end using the
!      'TARGET_MEM_CONSTRAINT' macro.
  
! 'o'
       A memory operand is allowed, but only if the address is
       "offsettable".  This means that adding a small integer (actually,
       the width in bytes of the operand, as determined by its machine
*************** whitespace
*** 29613,29724 ****
       on the other addressing modes that the machine supports.
  
       Note that in an output operand which can be matched by another
!      operand, the constraint letter `o' is valid only when accompanied
!      by both `<' (if the target machine has predecrement addressing)
!      and `>' (if the target machine has preincrement addressing).
  
! `V'
!      A memory operand that is not offsettable.  In other words,
!      anything that would fit the `m' constraint but not the `o'
!      constraint.
  
! `<'
!      A memory operand with autodecrement addressing (either
!      predecrement or postdecrement) is allowed.  In inline `asm' this
!      constraint is only allowed if the operand is used exactly once in
!      an instruction that can handle the side-effects.  Not using an
!      operand with `<' in constraint string in the inline `asm' pattern
!      at all or using it in multiple instructions isn't valid, because
!      the side-effects wouldn't be performed or would be performed more
!      than once.  Furthermore, on some targets the operand with `<' in
!      constraint string must be accompanied by special instruction
!      suffixes like `%U0' instruction suffix on PowerPC or `%P0' on
!      IA-64.
  
! `>'
!      A memory operand with autoincrement addressing (either
!      preincrement or postincrement) is allowed.  In inline `asm' the
!      same restrictions as for `<' apply.
  
! `r'
       A register operand is allowed provided that it is in a general
       register.
  
! `i'
       An immediate integer operand (one with constant value) is allowed.
       This includes symbolic constants whose values will be known only at
       assembly time or later.
  
! `n'
       An immediate integer operand with a known numeric value is allowed.
       Many systems cannot support assembly-time constants for operands
       less than a word wide.  Constraints for these operands should use
!      `n' rather than `i'.
  
! `I', `J', `K', ... `P'
!      Other letters in the range `I' through `P' may be defined in a
       machine-dependent fashion to permit immediate integer operands with
       explicit integer values in specified ranges.  For example, on the
!      68000, `I' is defined to stand for the range of values 1 to 8.
       This is the range permitted as a shift count in the shift
       instructions.
  
! `E'
!      An immediate floating operand (expression code `const_double') is
       allowed, but only if the target floating point format is the same
       as that of the host machine (on which the compiler is running).
  
! `F'
!      An immediate floating operand (expression code `const_double' or
!      `const_vector') is allowed.
  
! `G', `H'
!      `G' and `H' may be defined in a machine-dependent fashion to
!      permit immediate floating operands in particular ranges of values.
  
! `s'
!      An immediate integer operand whose value is not an explicit
!      integer is allowed.
  
       This might appear strange; if an insn allows a constant operand
!      with a value not known at compile time, it certainly must allow
!      any known value.  So why use `s' instead of `i'?  Sometimes it
!      allows better code to be generated.
  
       For example, on the 68000 in a fullword instruction it is possible
       to use an immediate operand; but if the immediate value is between
       -128 and 127, better code results from loading the value into a
!      register and using the register.  This is because the load into
!      the register can be done with a `moveq' instruction.  We arrange
!      for this to happen by defining the letter `K' to mean "any integer
!      outside the range -128 to 127", and then specifying `Ks' in the
       operand constraints.
  
! `g'
       Any register, memory or immediate integer operand is allowed,
       except for registers that are not general registers.
  
! `X'
       Any operand whatsoever is allowed.
  
! `0', `1', `2', ... `9'
       An operand that matches the specified operand number is allowed.
       If a digit is used together with letters within the same
       alternative, the digit should come last.
  
       This number is allowed to be more than a single digit.  If multiple
       digits are encountered consecutively, they are interpreted as a
!      single decimal integer.  There is scant chance for ambiguity,
!      since to-date it has never been desirable that `10' be interpreted
!      as matching either operand 1 _or_ operand 0.  Should this be
!      desired, one can use multiple alternatives instead.
  
       This is called a "matching constraint" and what it really means is
       that the assembler has only a single operand that fills two roles
!      which `asm' distinguishes.  For example, an add instruction uses
!      two input operands and an output operand, but on most CISC
!      machines an add instruction really has only two operands, one of
!      them an input-output operand:
  
            addl #35,r12
  
--- 29412,29521 ----
       on the other addressing modes that the machine supports.
  
       Note that in an output operand which can be matched by another
!      operand, the constraint letter 'o' is valid only when accompanied
!      by both '<' (if the target machine has predecrement addressing) and
!      '>' (if the target machine has preincrement addressing).
  
! 'V'
!      A memory operand that is not offsettable.  In other words, anything
!      that would fit the 'm' constraint but not the 'o' constraint.
  
! '<'
!      A memory operand with autodecrement addressing (either predecrement
!      or postdecrement) is allowed.  In inline 'asm' this constraint is
!      only allowed if the operand is used exactly once in an instruction
!      that can handle the side-effects.  Not using an operand with '<' in
!      constraint string in the inline 'asm' pattern at all or using it in
!      multiple instructions isn't valid, because the side-effects
!      wouldn't be performed or would be performed more than once.
!      Furthermore, on some targets the operand with '<' in constraint
!      string must be accompanied by special instruction suffixes like
!      '%U0' instruction suffix on PowerPC or '%P0' on IA-64.
  
! '>'
!      A memory operand with autoincrement addressing (either preincrement
!      or postincrement) is allowed.  In inline 'asm' the same
!      restrictions as for '<' apply.
  
! 'r'
       A register operand is allowed provided that it is in a general
       register.
  
! 'i'
       An immediate integer operand (one with constant value) is allowed.
       This includes symbolic constants whose values will be known only at
       assembly time or later.
  
! 'n'
       An immediate integer operand with a known numeric value is allowed.
       Many systems cannot support assembly-time constants for operands
       less than a word wide.  Constraints for these operands should use
!      'n' rather than 'i'.
  
! 'I', 'J', 'K', ... 'P'
!      Other letters in the range 'I' through 'P' may be defined in a
       machine-dependent fashion to permit immediate integer operands with
       explicit integer values in specified ranges.  For example, on the
!      68000, 'I' is defined to stand for the range of values 1 to 8.
       This is the range permitted as a shift count in the shift
       instructions.
  
! 'E'
!      An immediate floating operand (expression code 'const_double') is
       allowed, but only if the target floating point format is the same
       as that of the host machine (on which the compiler is running).
  
! 'F'
!      An immediate floating operand (expression code 'const_double' or
!      'const_vector') is allowed.
  
! 'G', 'H'
!      'G' and 'H' may be defined in a machine-dependent fashion to permit
!      immediate floating operands in particular ranges of values.
  
! 's'
!      An immediate integer operand whose value is not an explicit integer
!      is allowed.
  
       This might appear strange; if an insn allows a constant operand
!      with a value not known at compile time, it certainly must allow any
!      known value.  So why use 's' instead of 'i'?  Sometimes it allows
!      better code to be generated.
  
       For example, on the 68000 in a fullword instruction it is possible
       to use an immediate operand; but if the immediate value is between
       -128 and 127, better code results from loading the value into a
!      register and using the register.  This is because the load into the
!      register can be done with a 'moveq' instruction.  We arrange for
!      this to happen by defining the letter 'K' to mean "any integer
!      outside the range -128 to 127", and then specifying 'Ks' in the
       operand constraints.
  
! 'g'
       Any register, memory or immediate integer operand is allowed,
       except for registers that are not general registers.
  
! 'X'
       Any operand whatsoever is allowed.
  
! '0', '1', '2', ... '9'
       An operand that matches the specified operand number is allowed.
       If a digit is used together with letters within the same
       alternative, the digit should come last.
  
       This number is allowed to be more than a single digit.  If multiple
       digits are encountered consecutively, they are interpreted as a
!      single decimal integer.  There is scant chance for ambiguity, since
!      to-date it has never been desirable that '10' be interpreted as
!      matching either operand 1 _or_ operand 0.  Should this be desired,
!      one can use multiple alternatives instead.
  
       This is called a "matching constraint" and what it really means is
       that the assembler has only a single operand that fills two roles
!      which 'asm' distinguishes.  For example, an add instruction uses
!      two input operands and an output operand, but on most CISC machines
!      an add instruction really has only two operands, one of them an
!      input-output operand:
  
            addl #35,r12
  
*************** whitespace
*** 29728,29746 ****
       smaller number than the number of the operand that uses it in the
       constraint.
  
! `p'
       An operand that is a valid memory address is allowed.  This is for
       "load address" and "push address" instructions.
  
!      `p' in the constraint must be accompanied by `address_operand' as
!      the predicate in the `match_operand'.  This predicate interprets
!      the mode specified in the `match_operand' as the mode of the memory
       reference for which the address would be valid.
  
  OTHER-LETTERS
       Other letters can be defined in machine-dependent fashion to stand
       for particular classes of registers or other arbitrary operand
!      types.  `d', `a' and `f' are defined on the 68000/68020 to stand
       for data, address and floating point registers.
  
  
--- 29525,29543 ----
       smaller number than the number of the operand that uses it in the
       constraint.
  
! 'p'
       An operand that is a valid memory address is allowed.  This is for
       "load address" and "push address" instructions.
  
!      'p' in the constraint must be accompanied by 'address_operand' as
!      the predicate in the 'match_operand'.  This predicate interprets
!      the mode specified in the 'match_operand' as the mode of the memory
       reference for which the address would be valid.
  
  OTHER-LETTERS
       Other letters can be defined in machine-dependent fashion to stand
       for particular classes of registers or other arbitrary operand
!      types.  'd', 'a' and 'f' are defined on the 68000/68020 to stand
       for data, address and floating point registers.
  
  
*************** alternative.
*** 29764,29793 ****
  
   If all the operands fit any one alternative, the instruction is valid.
  Otherwise, for each alternative, the compiler counts how many
! instructions must be added to copy the operands so that that
! alternative applies.  The alternative requiring the least copying is
! chosen.  If two alternatives need the same amount of copying, the one
! that comes first is chosen.  These choices can be altered with the `?'
! and `!' characters:
  
! `?'
!      Disparage slightly the alternative that the `?' appears in, as a
       choice when no alternative applies exactly.  The compiler regards
!      this alternative as one unit more costly for each `?' that appears
       in it.
  
! `!'
!      Disparage severely the alternative that the `!' appears in.  This
       alternative can still be used if it fits without reloading, but if
       reloading is needed, some other alternative will be used.
  
! `^'
!      This constraint is analogous to `?' but it disparages slightly the
!      alternative only if the operand with the `^' needs a reload.
  
! `$'
!      This constraint is analogous to `!' but it disparages severely the
!      alternative only if the operand with the `$' needs a reload.
  
  
  File: gcc.info,  Node: Modifiers,  Next: Machine Constraints,  Prev: Multi-Alternative,  Up: Constraints
--- 29561,29590 ----
  
   If all the operands fit any one alternative, the instruction is valid.
  Otherwise, for each alternative, the compiler counts how many
! instructions must be added to copy the operands so that that alternative
! applies.  The alternative requiring the least copying is chosen.  If two
! alternatives need the same amount of copying, the one that comes first
! is chosen.  These choices can be altered with the '?' and '!'
! characters:
  
! '?'
!      Disparage slightly the alternative that the '?' appears in, as a
       choice when no alternative applies exactly.  The compiler regards
!      this alternative as one unit more costly for each '?' that appears
       in it.
  
! '!'
!      Disparage severely the alternative that the '!' appears in.  This
       alternative can still be used if it fits without reloading, but if
       reloading is needed, some other alternative will be used.
  
! '^'
!      This constraint is analogous to '?' but it disparages slightly the
!      alternative only if the operand with the '^' needs a reload.
  
! '$'
!      This constraint is analogous to '!' but it disparages severely the
!      alternative only if the operand with the '$' needs a reload.
  
  
  File: gcc.info,  Node: Modifiers,  Next: Machine Constraints,  Prev: Multi-Alternative,  Up: Constraints
*************** File: gcc.info,  Node: Modifiers,  Next:
*** 29797,29875 ****
  
  Here are constraint modifier characters.
  
! `='
       Means that this operand is written to by this instruction: the
       previous value is discarded and replaced by new data.
  
! `+'
       Means that this operand is both read and written by the
       instruction.
  
       When the compiler fixes up the operands to satisfy the constraints,
       it needs to know which operands are read by the instruction and
!      which are written by it.  `=' identifies an operand which is only
!      written; `+' identifies an operand that is both read and written;
       all other operands are assumed to only be read.
  
!      If you specify `=' or `+' in a constraint, you put it in the first
       character of the constraint string.
  
! `&'
       Means (in a particular alternative) that this operand is an
       "earlyclobber" operand, which is written before the instruction is
!      finished using the input operands.  Therefore, this operand may
!      not lie in a register that is read by the instruction or as part
!      of any memory address.
  
!      `&' applies only to the alternative in which it is written.  In
       constraints with multiple alternatives, sometimes one alternative
!      requires `&' while others do not.  See, for example, the `movdf'
       insn of the 68000.
  
       A operand which is read by the instruction can be tied to an
       earlyclobber operand if its only use as an input occurs before the
       early result is written.  Adding alternatives of this form often
       allows GCC to produce better code when only some of the read
!      operands can be affected by the earlyclobber. See, for example,
!      the `mulsi3' insn of the ARM.
  
       Furthermore, if the "earlyclobber" operand is also a read/write
       operand, then that operand is written only after it's used.
  
!      `&' does not obviate the need to write `=' or `+'.  As
       "earlyclobber" operands are always written, a read-only
       "earlyclobber" operand is ill-formed and will be rejected by the
       compiler.
  
! `%'
       Declares the instruction to be commutative for this operand and the
       following operand.  This means that the compiler may interchange
       the two operands if that is the cheapest way to make all operands
!      fit the constraints.  `%' applies to all alternatives and must
       appear as the first character in the constraint.  Only read-only
!      operands can use `%'.
  
       GCC can only handle one commutative pair in an asm; if you use
       more, the compiler may fail.  Note that you need not use the
!      modifier if the two alternatives are strictly identical; this
!      would only waste time in the reload pass.  The modifier is not
       operational after register allocation, so the result of
!      `define_peephole2' and `define_split's performed after reload
!      cannot rely on `%' to make the intended insn match.
  
! `#'
       Says that all following characters, up to the next comma, are to be
       ignored as a constraint.  They are significant only for choosing
       register preferences.
  
! `*'
       Says that the following character should be ignored when choosing
!      register preferences.  `*' has no effect on the meaning of the
       constraint as a constraint, and no effect on reloading.  For LRA
!      `*' additionally disparages slightly the alternative if the
       following character matches the operand.
  
- 
  
  File: gcc.info,  Node: Machine Constraints,  Prev: Modifiers,  Up: Constraints
  
--- 29594,29671 ----
  
  Here are constraint modifier characters.
  
! '='
       Means that this operand is written to by this instruction: the
       previous value is discarded and replaced by new data.
  
! '+'
       Means that this operand is both read and written by the
       instruction.
  
       When the compiler fixes up the operands to satisfy the constraints,
       it needs to know which operands are read by the instruction and
!      which are written by it.  '=' identifies an operand which is only
!      written; '+' identifies an operand that is both read and written;
       all other operands are assumed to only be read.
  
!      If you specify '=' or '+' in a constraint, you put it in the first
       character of the constraint string.
  
! '&'
       Means (in a particular alternative) that this operand is an
       "earlyclobber" operand, which is written before the instruction is
!      finished using the input operands.  Therefore, this operand may not
!      lie in a register that is read by the instruction or as part of any
!      memory address.
  
!      '&' applies only to the alternative in which it is written.  In
       constraints with multiple alternatives, sometimes one alternative
!      requires '&' while others do not.  See, for example, the 'movdf'
       insn of the 68000.
  
       A operand which is read by the instruction can be tied to an
       earlyclobber operand if its only use as an input occurs before the
       early result is written.  Adding alternatives of this form often
       allows GCC to produce better code when only some of the read
!      operands can be affected by the earlyclobber.  See, for example,
!      the 'mulsi3' insn of the ARM.
  
       Furthermore, if the "earlyclobber" operand is also a read/write
       operand, then that operand is written only after it's used.
  
!      '&' does not obviate the need to write '=' or '+'.  As
       "earlyclobber" operands are always written, a read-only
       "earlyclobber" operand is ill-formed and will be rejected by the
       compiler.
  
! '%'
       Declares the instruction to be commutative for this operand and the
       following operand.  This means that the compiler may interchange
       the two operands if that is the cheapest way to make all operands
!      fit the constraints.  '%' applies to all alternatives and must
       appear as the first character in the constraint.  Only read-only
!      operands can use '%'.
  
       GCC can only handle one commutative pair in an asm; if you use
       more, the compiler may fail.  Note that you need not use the
!      modifier if the two alternatives are strictly identical; this would
!      only waste time in the reload pass.  The modifier is not
       operational after register allocation, so the result of
!      'define_peephole2' and 'define_split's performed after reload
!      cannot rely on '%' to make the intended insn match.
  
! '#'
       Says that all following characters, up to the next comma, are to be
       ignored as a constraint.  They are significant only for choosing
       register preferences.
  
! '*'
       Says that the following character should be ignored when choosing
!      register preferences.  '*' has no effect on the meaning of the
       constraint as a constraint, and no effect on reloading.  For LRA
!      '*' additionally disparages slightly the alternative if the
       following character matches the operand.
  
  
  File: gcc.info,  Node: Machine Constraints,  Prev: Modifiers,  Up: Constraints
  
*************** File: gcc.info,  Node: Machine Constrain
*** 29877,31264 ****
  ............................................
  
  Whenever possible, you should use the general-purpose constraint letters
! in `asm' arguments, since they will convey meaning more readily to
! people reading your code.  Failing that, use the constraint letters
! that usually have very similar meanings across architectures.  The most
! commonly used constraints are `m' and `r' (for memory and
  general-purpose registers respectively; *note Simple Constraints::), and
! `I', usually the letter indicating the most common immediate-constant
  format.
  
   Each architecture defines additional constraints.  These constraints
  are used by the compiler itself for instruction generation, as well as
! for `asm' statements; therefore, some of the constraints are not
! particularly useful for `asm'.  Here is a summary of some of the
  machine-dependent constraints available on some particular machines; it
! includes both constraints that are useful for `asm' and constraints
! that aren't.  The compiler source file mentioned in the table heading
! for each architecture is the definitive reference for the meanings of
! that architecture's constraints.
! 
! _AArch64 family--`config/aarch64/constraints.md'_
  
!     `k'
!           The stack pointer register (`SP')
  
!     `w'
            Floating point or SIMD vector register
  
!     `I'
            Integer constant that is valid as an immediate operand in an
!           `ADD' instruction
  
!     `J'
            Integer constant that is valid as an immediate operand in a
!           `SUB' instruction (once negated)
  
!     `K'
            Integer constant that can be used with a 32-bit logical
            instruction
  
!     `L'
            Integer constant that can be used with a 64-bit logical
            instruction
  
!     `M'
            Integer constant that is valid as an immediate operand in a
!           32-bit `MOV' pseudo instruction. The `MOV' may be assembled
            to one of several different machine instructions depending on
            the value
  
!     `N'
            Integer constant that is valid as an immediate operand in a
!           64-bit `MOV' pseudo instruction
  
!     `S'
            An absolute symbolic address or a label reference
  
!     `Y'
            Floating point constant zero
  
!     `Z'
            Integer constant zero
  
!     `Ush'
!           The high part (bits 12 and upwards) of the pc-relative
!           address of a symbol within 4GB of the instruction
  
!     `Q'
            A memory address which uses a single base register with no
            offset
  
!     `Ump'
!           A memory address suitable for a load/store pair instruction
!           in SI, DI, SF and DF modes
! 
! 
! _ARC --`config/arc/constraints.md'_
  
!     `q'
!           Registers usable in ARCompact 16-bit instructions: `r0'-`r3',
!           `r12'-`r15'.  This constraint can only match when the `-mq'
            option is in effect.
  
!     `e'
!           Registers usable as base-regs of memory addresses in
!           ARCompact 16-bit memory instructions: `r0'-`r3', `r12'-`r15',
!           `sp'.  This constraint can only match when the `-mq' option
!           is in effect.
! 
!     `D'
!           ARC FPX (dpfp) 64-bit registers. `D0', `D1'.
  
!     `I'
            A signed 12-bit integer constant.
  
!     `Cal'
!           constant for arithmetic/logical operations.  This might be
!           any constant that can be put into a long immediate by the
!           assmbler or linker without involving a PIC relocation.
  
!     `K'
            A 3-bit unsigned integer constant.
  
!     `L'
            A 6-bit unsigned integer constant.
  
!     `CnL'
            One's complement of a 6-bit unsigned integer constant.
  
!     `CmL'
            Two's complement of a 6-bit unsigned integer constant.
  
!     `M'
            A 5-bit unsigned integer constant.
  
!     `O'
            A 7-bit unsigned integer constant.
  
!     `P'
            A 8-bit unsigned integer constant.
  
!     `H'
            Any const_double value.
  
! _ARM family--`config/arm/constraints.md'_
  
!     `h'
!           In Thumb state, the core registers `r8'-`r15'.
  
!     `k'
            The stack pointer register.
  
!     `l'
!           In Thumb State the core registers `r0'-`r7'.  In ARM state
!           this is an alias for the `r' constraint.
  
!     `t'
!           VFP floating-point registers `s0'-`s31'.  Used for 32 bit
            values.
  
!     `w'
!           VFP floating-point registers `d0'-`d31' and the appropriate
!           subset `d0'-`d15' based on command line options.  Used for 64
            bit values only.  Not valid for Thumb1.
  
!     `y'
            The iWMMX co-processor registers.
  
!     `z'
            The iWMMX GR registers.
  
!     `G'
            The floating-point constant 0.0
  
!     `I'
            Integer that is valid as an immediate operand in a data
!           processing instruction.  That is, an integer in the range 0
!           to 255 rotated by a multiple of 2
  
!     `J'
            Integer in the range -4095 to 4095
  
!     `K'
!           Integer that satisfies constraint `I' when inverted (ones
            complement)
  
!     `L'
!           Integer that satisfies constraint `I' when negated (twos
            complement)
  
!     `M'
            Integer in the range 0 to 32
  
!     `Q'
            A memory reference where the exact address is in a single
!           register (``m'' is preferable for `asm' statements)
  
!     `R'
            An item in the constant pool
  
!     `S'
            A symbol in the text segment of the current file
  
!     `Uv'
            A memory reference suitable for VFP load/store insns
            (reg+constant offset)
  
!     `Uy'
            A memory reference suitable for iWMMXt load/store
            instructions.
  
!     `Uq'
            A memory reference suitable for the ARMv4 ldrsb instruction.
  
! _AVR family--`config/avr/constraints.md'_
! 
!     `l'
            Registers from r0 to r15
  
!     `a'
            Registers from r16 to r23
  
!     `d'
            Registers from r16 to r31
  
!     `w'
            Registers from r24 to r31.  These registers can be used in
!           `adiw' command
  
!     `e'
            Pointer register (r26-r31)
  
!     `b'
            Base pointer register (r28-r31)
  
!     `q'
            Stack pointer register (SPH:SPL)
  
!     `t'
            Temporary register r0
  
!     `x'
            Register pair X (r27:r26)
  
!     `y'
            Register pair Y (r29:r28)
  
!     `z'
            Register pair Z (r31:r30)
  
!     `I'
            Constant greater than -1, less than 64
  
!     `J'
            Constant greater than -64, less than 1
  
!     `K'
            Constant integer 2
  
!     `L'
            Constant integer 0
  
!     `M'
            Constant that fits in 8 bits
  
!     `N'
            Constant integer -1
  
!     `O'
            Constant integer 8, 16, or 24
  
!     `P'
            Constant integer 1
  
!     `G'
            A floating point constant 0.0
  
!     `Q'
            A memory address based on Y or Z pointer with displacement.
  
! _Blackfin family--`config/bfin/constraints.md'_
! 
!     `a'
            P register
  
!     `d'
            D register
  
!     `z'
            A call clobbered P register.
  
!     `qN'
            A single register.  If N is in the range 0 to 7, the
!           corresponding D register.  If it is `A', then the register P0.
  
!     `D'
            Even-numbered D register
  
!     `W'
            Odd-numbered D register
  
!     `e'
            Accumulator register.
  
!     `A'
            Even-numbered accumulator register.
  
!     `B'
            Odd-numbered accumulator register.
  
!     `b'
            I register
  
!     `v'
            B register
  
!     `f'
            M register
  
!     `c'
!           Registers used for circular buffering, i.e. I, B, or L
            registers.
  
!     `C'
            The CC register.
  
!     `t'
            LT0 or LT1.
  
!     `k'
            LC0 or LC1.
  
!     `u'
            LB0 or LB1.
  
!     `x'
            Any D, P, B, M, I or L register.
  
!     `y'
            Additional registers typically used only in prologues and
            epilogues: RETS, RETN, RETI, RETX, RETE, ASTAT, SEQSTAT and
            USP.
  
!     `w'
            Any register except accumulators or CC.
  
!     `Ksh'
            Signed 16 bit integer (in the range -32768 to 32767)
  
!     `Kuh'
            Unsigned 16 bit integer (in the range 0 to 65535)
  
!     `Ks7'
            Signed 7 bit integer (in the range -64 to 63)
  
!     `Ku7'
            Unsigned 7 bit integer (in the range 0 to 127)
  
!     `Ku5'
            Unsigned 5 bit integer (in the range 0 to 31)
  
!     `Ks4'
            Signed 4 bit integer (in the range -8 to 7)
  
!     `Ks3'
            Signed 3 bit integer (in the range -3 to 4)
  
!     `Ku3'
            Unsigned 3 bit integer (in the range 0 to 7)
  
!     `PN'
            Constant N, where N is a single-digit constant in the range 0
            to 4.
  
!     `PA'
            An integer equal to one of the MACFLAG_XXX constants that is
            suitable for use with either accumulator.
  
!     `PB'
            An integer equal to one of the MACFLAG_XXX constants that is
            suitable for use only with accumulator A1.
  
!     `M1'
            Constant 255.
  
!     `M2'
            Constant 65535.
  
!     `J'
            An integer constant with exactly a single bit set.
  
!     `L'
            An integer constant with all bits set except exactly one.
  
!     `H'
  
!     `Q'
            Any SYMBOL_REF.
  
! _CR16 Architecture--`config/cr16/cr16.h'_
  
!     `b'
            Registers from r0 to r14 (registers without stack pointer)
  
!     `t'
            Register from r0 to r11 (all 16-bit registers)
  
!     `p'
            Register from r12 to r15 (all 32-bit registers)
  
!     `I'
            Signed constant that fits in 4 bits
  
!     `J'
            Signed constant that fits in 5 bits
  
!     `K'
            Signed constant that fits in 6 bits
  
!     `L'
            Unsigned constant that fits in 4 bits
  
!     `M'
            Signed constant that fits in 32 bits
  
!     `N'
            Check for 64 bits wide constants for add/sub instructions
  
!     `G'
            Floating point constant that is legal for store immediate
  
! _Epiphany--`config/epiphany/constraints.md'_
! 
!     `U16'
            An unsigned 16-bit constant.
  
!     `K'
            An unsigned 5-bit constant.
  
!     `L'
            A signed 11-bit constant.
  
!     `Cm1'
!           A signed 11-bit constant added to -1.  Can only match when
!           the `-m1reg-REG' option is active.
  
!     `Cl1'
            Left-shift of -1, i.e., a bit mask with a block of leading
            ones, the rest being a block of trailing zeroes.  Can only
!           match when the `-m1reg-REG' option is active.
  
!     `Cr1'
            Right-shift of -1, i.e., a bit mask with a trailing block of
            ones, the rest being zeroes.  Or to put it another way, one
            less than a power of two.  Can only match when the
!           `-m1reg-REG' option is active.
  
!     `Cal'
!           Constant for arithmetic/logical operations.  This is like
!           `i', except that for position independent code, no symbols /
            expressions needing relocations are allowed.
  
!     `Csy'
            Symbolic constant for call/jump instruction.
  
!     `Rcs'
            The register class usable in short insns.  This is a register
            class constraint, and can thus drive register allocation.
!           This constraint won't match unless `-mprefer-short-insn-regs'
            is in effect.
  
!     `Rsc'
            The the register class of registers that can be used to hold a
            sibcall call address.  I.e., a caller-saved register.
  
!     `Rct'
            Core control register class.
  
!     `Rgs'
            The register group usable in short insns.  This constraint
            does not use a register class, so that it only passively
            matches suitable registers, and doesn't drive register
            allocation.
  
!     `Rra'
!           Matches the return address if it can be replaced with the
!           link register.
  
!     `Rcc'
            Matches the integer condition code register.
  
!     `Sra'
            Matches the return address if it is in a stack slot.
  
!     `Cfm'
            Matches control register values to switch fp mode, which are
!           encapsulated in `UNSPEC_FP_MODE'.
! 
! _FRV--`config/frv/frv.h'_
  
!     `a'
!           Register in the class `ACC_REGS' (`acc0' to `acc7').
  
!     `b'
!           Register in the class `EVEN_ACC_REGS' (`acc0' to `acc7').
  
!     `c'
!           Register in the class `CC_REGS' (`fcc0' to `fcc3' and `icc0'
!           to `icc3').
  
!     `d'
!           Register in the class `GPR_REGS' (`gr0' to `gr63').
  
!     `e'
!           Register in the class `EVEN_REGS' (`gr0' to `gr63').  Odd
!           registers are excluded not in the class but through the use
!           of a machine mode larger than 4 bytes.
  
!     `f'
!           Register in the class `FPR_REGS' (`fr0' to `fr63').
  
!     `h'
!           Register in the class `FEVEN_REGS' (`fr0' to `fr63').  Odd
!           registers are excluded not in the class but through the use
!           of a machine mode larger than 4 bytes.
  
!     `l'
!           Register in the class `LR_REG' (the `lr' register).
  
!     `q'
!           Register in the class `QUAD_REGS' (`gr2' to `gr63').
!           Register numbers not divisible by 4 are excluded not in the
!           class but through the use of a machine mode larger than 8
!           bytes.
  
!     `t'
!           Register in the class `ICC_REGS' (`icc0' to `icc3').
  
!     `u'
!           Register in the class `FCC_REGS' (`fcc0' to `fcc3').
  
!     `v'
!           Register in the class `ICR_REGS' (`cc4' to `cc7').
  
!     `w'
!           Register in the class `FCR_REGS' (`cc0' to `cc3').
  
!     `x'
!           Register in the class `QUAD_FPR_REGS' (`fr0' to `fr63').
            Register numbers not divisible by 4 are excluded not in the
            class but through the use of a machine mode larger than 8
            bytes.
  
!     `z'
!           Register in the class `SPR_REGS' (`lcr' and `lr').
  
!     `A'
!           Register in the class `QUAD_ACC_REGS' (`acc0' to `acc7').
  
!     `B'
!           Register in the class `ACCG_REGS' (`accg0' to `accg7').
  
!     `C'
!           Register in the class `CR_REGS' (`cc0' to `cc7').
  
!     `G'
            Floating point constant zero
  
!     `I'
            6-bit signed integer constant
  
!     `J'
            10-bit signed integer constant
  
!     `L'
            16-bit signed integer constant
  
!     `M'
            16-bit unsigned integer constant
  
!     `N'
            12-bit signed integer constant that is negative--i.e. in the
            range of -2048 to -1
  
!     `O'
            Constant zero
  
!     `P'
!           12-bit signed integer constant that is greater than
!           zero--i.e. in the range of 1 to 2047.
! 
! 
! _Hewlett-Packard PA-RISC--`config/pa/pa.h'_
  
!     `a'
            General register 1
  
!     `f'
            Floating point register
  
!     `q'
            Shift amount register
  
!     `x'
            Floating point register (deprecated)
  
!     `y'
            Upper floating point register (32-bit), floating point
            register (64-bit)
  
!     `Z'
            Any register
  
!     `I'
            Signed 11-bit integer constant
  
!     `J'
            Signed 14-bit integer constant
  
!     `K'
!           Integer constant that can be deposited with a `zdepi'
            instruction
  
!     `L'
            Signed 5-bit integer constant
  
!     `M'
            Integer constant 0
  
!     `N'
!           Integer constant that can be loaded with a `ldil' instruction
  
!     `O'
            Integer constant whose value plus one is a power of 2
  
!     `P'
!           Integer constant that can be used for `and' operations in
!           `depi' and `extru' instructions
  
!     `S'
            Integer constant 31
  
!     `U'
            Integer constant 63
  
!     `G'
            Floating-point constant 0.0
  
!     `A'
!           A `lo_sum' data-linkage-table memory operand
  
!     `Q'
            A memory operand that can be used as the destination operand
            of an integer store instruction
  
!     `R'
            A scaled or unscaled indexed memory operand
  
!     `T'
            A memory operand for floating-point loads and stores
  
!     `W'
            A register indirect memory operand
  
! _Intel IA-64--`config/ia64/ia64.h'_
! 
!     `a'
!           General register `r0' to `r3' for `addl' instruction
  
!     `b'
            Branch register
  
!     `c'
!           Predicate register (`c' as in "conditional")
  
!     `d'
            Application register residing in M-unit
  
!     `e'
            Application register residing in I-unit
  
!     `f'
            Floating-point register
  
!     `m'
!           Memory operand.  If used together with `<' or `>', the
!           operand can have postincrement and postdecrement which
!           require printing with `%Pn' on IA-64.
  
!     `G'
            Floating-point constant 0.0 or 1.0
  
!     `I'
            14-bit signed integer constant
  
!     `J'
            22-bit signed integer constant
  
!     `K'
            8-bit signed integer constant for logical instructions
  
!     `L'
            8-bit adjusted signed integer constant for compare pseudo-ops
  
!     `M'
            6-bit unsigned integer constant for shift counts
  
!     `N'
            9-bit signed integer constant for load and store
            postincrements
  
!     `O'
            The constant zero
  
!     `P'
!           0 or -1 for `dep' instruction
  
!     `Q'
            Non-volatile memory for floating-point loads and stores
  
!     `R'
!           Integer constant in the range 1 to 4 for `shladd' instruction
  
!     `S'
            Memory operand except postincrement and postdecrement.  This
!           is now roughly the same as `m' when not used together with `<'
!           or `>'.
! 
! _M32C--`config/m32c/m32c.c'_
  
!     `Rsp'
!     `Rfb'
!     `Rsb'
!           `$sp', `$fb', `$sb'.
  
!     `Rcr'
            Any control register, when they're 16 bits wide (nothing if
            control registers are 24 bits wide)
  
!     `Rcl'
            Any control register, when they're 24 bits wide.
  
!     `R0w'
!     `R1w'
!     `R2w'
!     `R3w'
            $r0, $r1, $r2, $r3.
  
!     `R02'
            $r0 or $r2, or $r2r0 for 32 bit values.
  
!     `R13'
            $r1 or $r3, or $r3r1 for 32 bit values.
  
!     `Rdi'
            A register that can hold a 64 bit value.
  
!     `Rhl'
            $r0 or $r1 (registers with addressable high/low bytes)
  
!     `R23'
            $r2 or $r3
  
!     `Raa'
            Address registers
  
!     `Raw'
            Address registers when they're 16 bits wide.
  
!     `Ral'
            Address registers when they're 24 bits wide.
  
!     `Rqi'
            Registers that can hold QI values.
  
!     `Rad'
            Registers that can be used with displacements ($a0, $a1, $sb).
  
!     `Rsi'
            Registers that can hold 32 bit values.
  
!     `Rhi'
            Registers that can hold 16 bit values.
  
!     `Rhc'
            Registers chat can hold 16 bit values, including all control
            registers.
  
!     `Rra'
            $r0 through R1, plus $a0 and $a1.
  
!     `Rfl'
            The flags register.
  
!     `Rmm'
            The memory-based pseudo-registers $mem0 through $mem15.
  
!     `Rpi'
            Registers that can hold pointers (16 bit registers for r8c,
            m16c; 24 bit registers for m32cm, m32c).
  
!     `Rpa'
            Matches multiple registers in a PARALLEL to form a larger
            register.  Used to match function return values.
  
!     `Is3'
            -8 ... 7
  
!     `IS1'
            -128 ... 127
  
!     `IS2'
            -32768 ... 32767
  
!     `IU2'
            0 ... 65535
  
!     `In4'
            -8 ... -1 or 1 ... 8
  
!     `In5'
            -16 ... -1 or 1 ... 16
  
!     `In6'
            -32 ... -1 or 1 ... 32
  
!     `IM2'
            -65536 ... -1
  
!     `Ilb'
            An 8 bit value with exactly one bit set.
  
!     `Ilw'
            A 16 bit value with exactly one bit set.
  
!     `Sd'
            The common src/dest memory addressing modes.
  
!     `Sa'
            Memory addressed using $a0 or $a1.
  
!     `Si'
            Memory addressed with immediate addresses.
  
!     `Ss'
            Memory addressed using the stack pointer ($sp).
  
!     `Sf'
            Memory addressed using the frame base register ($fb).
  
!     `Ss'
            Memory addressed using the small base register ($sb).
  
!     `S1'
            $r1h
  
! _MeP--`config/mep/constraints.md'_
  
!     `a'
            The $sp register.
  
!     `b'
            The $tp register.
  
!     `c'
            Any control register.
  
!     `d'
            Either the $hi or the $lo register.
  
!     `em'
            Coprocessor registers that can be directly loaded ($c0-$c15).
  
!     `ex'
            Coprocessor registers that can be moved to each other.
  
!     `er'
            Coprocessor registers that can be moved to core registers.
  
!     `h'
            The $hi register.
  
!     `j'
            The $rpc register.
  
!     `l'
            The $lo register.
  
!     `t'
            Registers which can be used in $tp-relative addressing.
  
!     `v'
            The $gp register.
  
!     `x'
            The coprocessor registers.
  
!     `y'
            The coprocessor control registers.
  
!     `z'
            The $0 register.
  
!     `A'
            User-defined register set A.
  
!     `B'
            User-defined register set B.
  
!     `C'
            User-defined register set C.
  
!     `D'
            User-defined register set D.
  
!     `I'
            Offsets for $gp-rel addressing.
  
!     `J'
            Constants that can be used directly with boolean insns.
  
!     `K'
            Constants that can be moved directly to registers.
  
!     `L'
            Small constants that can be added to registers.
  
!     `M'
            Long shift counts.
  
!     `N'
            Small constants that can be compared to registers.
  
!     `O'
            Constants that can be loaded into the top half of registers.
  
!     `S'
            Signed 8-bit immediates.
  
!     `T'
            Symbols encoded for $tp-rel or $gp-rel addressing.
  
!     `U'
            Non-constant addresses for loading/saving coprocessor
            registers.
  
!     `W'
            The top half of a symbol's value.
  
!     `Y'
            A register indirect address without offset.
  
!     `Z'
            Symbolic references to the control bus.
  
  
! _MicroBlaze--`config/microblaze/constraints.md'_
! 
!     `d'
!           A general register (`r0' to `r31').
! 
!     `z'
!           A status register (`rmsr', `$fcc1' to `$fcc7').
! 
! 
! _MIPS--`config/mips/constraints.md'_
  
!     `d'
!           An address register.  This is equivalent to `r' unless
            generating MIPS16 code.
  
!     `f'
            A floating-point register (if available).
  
!     `h'
!           Formerly the `hi' register.  This constraint is no longer
            supported.
  
!     `l'
!           The `lo' register.  Use this register to store values that are
            no bigger than a word.
  
!     `x'
!           The concatenated `hi' and `lo' registers.  Use this register
            to store doubleword values.
  
!     `c'
            A register suitable for use in an indirect jump.  This will
!           always be `$25' for `-mabicalls'.
  
!     `v'
!           Register `$3'.  Do not use this constraint in new code; it is
            retained only for compatibility with glibc.
  
!     `y'
!           Equivalent to `r'; retained for backwards compatibility.
  
!     `z'
            A floating-point condition code register.
  
!     `I'
            A signed 16-bit constant (for arithmetic instructions).
  
!     `J'
            Integer zero.
  
!     `K'
            An unsigned 16-bit constant (for logic instructions).
  
!     `L'
            A signed 32-bit constant in which the lower 16 bits are zero.
!           Such constants can be loaded using `lui'.
  
!     `M'
!           A constant that cannot be loaded using `lui', `addiu' or
!           `ori'.
  
!     `N'
            A constant in the range -65535 to -1 (inclusive).
  
!     `O'
            A signed 15-bit constant.
  
!     `P'
            A constant in the range 1 to 65535 (inclusive).
  
!     `G'
            Floating-point zero.
  
!     `R'
            An address that can be used in a non-macro load or store.
  
!     `ZC'
            A memory operand whose address is formed by a base register
            and offset that is suitable for use in instructions with the
!           same addressing mode as `ll' and `sc'.
! 
!     `ZD'
!           An address suitable for a `prefetch' instruction, or for any
!           other instruction with the same addressing mode as `prefetch'.
  
! _Motorola 680x0--`config/m68k/constraints.md'_
  
!     `a'
            Address register
  
!     `d'
            Data register
  
!     `f'
            68881 floating-point register, if available
  
!     `I'
            Integer in the range 1 to 8
  
!     `J'
            16-bit signed number
  
!     `K'
            Signed number whose magnitude is greater than 0x80
  
!     `L'
            Integer in the range -8 to -1
  
!     `M'
            Signed number whose magnitude is greater than 0x100
  
!     `N'
            Range 24 to 31, rotatert:SI 8 to 1 expressed as rotate
  
!     `O'
            16 (for rotate using swap)
  
!     `P'
            Range 8 to 15, rotatert:HI 8 to 1 expressed as rotate
  
!     `R'
            Numbers that mov3q can handle
  
!     `G'
            Floating point constant that is not a 68881 constant
  
!     `S'
            Operands that satisfy 'm' when -mpcrel is in effect
  
!     `T'
            Operands that satisfy 's' when -mpcrel is not in effect
  
!     `Q'
            Address register indirect addressing mode
  
!     `U'
            Register offset addressing
  
!     `W'
            const_call_operand
  
!     `Cs'
            symbol_ref or const
  
!     `Ci'
            const_int
  
!     `C0'
            const_int 0
  
!     `Cj'
            Range of signed numbers that don't fit in 16 bits
  
!     `Cmvq'
            Integers valid for mvq
  
!     `Capsw'
            Integers valid for a moveq followed by a swap
  
!     `Cmvz'
            Integers valid for mvz
  
!     `Cmvs'
            Integers valid for mvs
  
!     `Ap'
            push_operand
  
!     `Ac'
            Non-register operands allowed in clr
  
! 
! _Moxie--`config/moxie/constraints.md'_
! 
!     `A'
            An absolute address
  
!     `B'
            An offset address
  
!     `W'
            A register indirect memory operand
  
!     `I'
            A constant in the range of 0 to 255.
  
!     `N'
            A constant in the range of 0 to -255.
  
  
! _MSP430-`config/msp430/constraints.md'_
! 
!     `R12'
            Register R12.
  
!     `R13'
            Register R13.
  
!     `K'
            Integer constant 1.
  
!     `L'
            Integer constant -1^20..1^19.
  
!     `M'
            Integer constant 1-4.
  
!     `Ya'
            Memory references which do not require an extended MOVX
            instruction.
  
!     `Yl'
            Memory reference, labels only.
  
!     `Ys'
            Memory reference, stack only.
  
! 
! _NDS32--`config/nds32/constraints.md'_
! 
!     `w'
            LOW register class $r0 to $r7 constraint for V3/V3M ISA.
! 
!     `l'
            LOW register class $r0 to $r7.
! 
!     `d'
            MIDDLE register class $r0 to $r11, $r16 to $r19.
! 
!     `h'
            HIGH register class $r12 to $r14, $r20 to $r31.
! 
!     `t'
            Temporary assist register $ta (i.e. $r15).
! 
!     `k'
            Stack register $sp.
! 
!     `Iu03'
            Unsigned immediate 3-bit value.
! 
!     `In03'
            Negative immediate 3-bit value in the range of -7-0.
! 
!     `Iu04'
            Unsigned immediate 4-bit value.
! 
!     `Is05'
            Signed immediate 5-bit value.
! 
!     `Iu05'
            Unsigned immediate 5-bit value.
! 
!     `In05'
            Negative immediate 5-bit value in the range of -31-0.
! 
!     `Ip05'
            Unsigned immediate 5-bit value for movpi45 instruction with
            range 16-47.
! 
!     `Iu06'
            Unsigned immediate 6-bit value constraint for addri36.sp
            instruction.
! 
!     `Iu08'
            Unsigned immediate 8-bit value.
! 
!     `Iu09'
            Unsigned immediate 9-bit value.
! 
!     `Is10'
            Signed immediate 10-bit value.
! 
!     `Is11'
            Signed immediate 11-bit value.
! 
!     `Is15'
            Signed immediate 15-bit value.
! 
!     `Iu15'
            Unsigned immediate 15-bit value.
! 
!     `Ic15'
!           A constant which is not in the range of imm15u but ok for
!           bclr instruction.
! 
!     `Ie15'
!           A constant which is not in the range of imm15u but ok for
!           bset instruction.
! 
!     `It15'
!           A constant which is not in the range of imm15u but ok for
!           btgl instruction.
! 
!     `Ii15'
            A constant whose compliment value is in the range of imm15u
            and ok for bitci instruction.
! 
!     `Is16'
            Signed immediate 16-bit value.
! 
!     `Is17'
            Signed immediate 17-bit value.
! 
!     `Is19'
            Signed immediate 19-bit value.
! 
!     `Is20'
            Signed immediate 20-bit value.
! 
!     `Ihig'
            The immediate value that can be simply set high 20-bit.
! 
!     `Izeb'
            The immediate value 0xff.
! 
!     `Izeh'
            The immediate value 0xffff.
! 
!     `Ixls'
            The immediate value 0x01.
! 
!     `Ix11'
            The immediate value 0x7ff.
! 
!     `Ibms'
            The immediate value with power of 2.
! 
!     `Ifex'
            The immediate value with power of 2 minus 1.
! 
!     `U33'
            Memory constraint for 333 format.
! 
!     `U45'
            Memory constraint for 45 format.
! 
!     `U37'
            Memory constraint for 37 format.
  
! _Nios II family--`config/nios2/constraints.md'_
  
!     `I'
            Integer that is valid as an immediate operand in an
!           instruction taking a signed 16-bit number. Range -32768 to
            32767.
  
!     `J'
            Integer that is valid as an immediate operand in an
!           instruction taking an unsigned 16-bit number. Range 0 to
            65535.
  
!     `K'
            Integer that is valid as an immediate operand in an
            instruction taking only the upper 16-bits of a 32-bit number.
            Range 32-bit numbers with the lower 16-bits being 0.
  
!     `L'
            Integer that is valid as an immediate operand for a shift
!           instruction. Range 0 to 31.
  
!     `M'
            Integer that is valid as an immediate operand for only the
!           value 0. Can be used in conjunction with the format modifier
!           `z' to use `r0' instead of `0' in the assembly output.
  
!     `N'
            Integer that is valid as an immediate operand for a custom
!           instruction opcode. Range 0 to 255.
  
!     `S'
            Matches immediates which are addresses in the small data
!           section and therefore can be added to `gp' as a 16-bit
            immediate to re-create their 32-bit value.
  
  
! _PDP-11--`config/pdp11/constraints.md'_
! 
!     `a'
!           Floating point registers AC0 through AC3.  These can be
!           loaded from/to memory with a single instruction.
! 
!     `d'
            Odd numbered general registers (R1, R3, R5).  These are used
            for 16-bit multiply operations.
  
!     `f'
            Any of the floating point registers (AC0 through AC5).
  
!     `G'
            Floating point constant 0.
  
!     `I'
            An integer constant that fits in 16 bits.
  
!     `J'
            An integer constant whose low order 16 bits are zero.
  
!     `K'
            An integer constant that does not meet the constraints for
!           codes `I' or `J'.
  
!     `L'
            The integer constant 1.
  
!     `M'
            The integer constant -1.
  
!     `N'
            The integer constant 0.
  
!     `O'
            Integer constants -4 through -1 and 1 through 4; shifts by
!           these amounts are handled as multiple single-bit shifts
!           rather than a single variable-length shift.
  
!     `Q'
            A memory reference which requires an additional word (address
            or offset) after the opcode.
  
!     `R'
            A memory reference that is encoded within the opcode.
  
! 
! _PowerPC and IBM RS6000--`config/rs6000/constraints.md'_
! 
!     `b'
            Address base register
  
!     `d'
            Floating point register (containing 64-bit value)
  
!     `f'
            Floating point register (containing 32-bit value)
  
!     `v'
            Altivec vector register
  
!     `wa'
            Any VSX register if the -mvsx option was used or NO_REGS.
  
!           When using any of the register constraints (`wa', `wd', `wf',
!           `wg', `wh', `wi', `wj', `wk', `wl', `wm', `ws', `wt', `wu',
!           `wv', `ww', or `wy') that take VSX registers, you must use
!           `%x<n>' in the template so that the correct register is used.
!           Otherwise the register number output in the assembly file
!           will be incorrect if an Altivec register is an operand of a
!           VSX instruction that expects VSX register numbering.
  
                 asm ("xvadddp %x0,%x1,%x2" : "=wa" (v1) : "wa" (v2), "wa" (v3));
  
--- 29673,30996 ----
  ............................................
  
  Whenever possible, you should use the general-purpose constraint letters
! in 'asm' arguments, since they will convey meaning more readily to
! people reading your code.  Failing that, use the constraint letters that
! usually have very similar meanings across architectures.  The most
! commonly used constraints are 'm' and 'r' (for memory and
  general-purpose registers respectively; *note Simple Constraints::), and
! 'I', usually the letter indicating the most common immediate-constant
  format.
  
   Each architecture defines additional constraints.  These constraints
  are used by the compiler itself for instruction generation, as well as
! for 'asm' statements; therefore, some of the constraints are not
! particularly useful for 'asm'.  Here is a summary of some of the
  machine-dependent constraints available on some particular machines; it
! includes both constraints that are useful for 'asm' and constraints that
! aren't.  The compiler source file mentioned in the table heading for
! each architecture is the definitive reference for the meanings of that
! architecture's constraints.
  
! _AArch64 family--'config/aarch64/constraints.md'_
!      'k'
!           The stack pointer register ('SP')
  
!      'w'
            Floating point or SIMD vector register
  
!      'I'
            Integer constant that is valid as an immediate operand in an
!           'ADD' instruction
  
!      'J'
            Integer constant that is valid as an immediate operand in a
!           'SUB' instruction (once negated)
  
!      'K'
            Integer constant that can be used with a 32-bit logical
            instruction
  
!      'L'
            Integer constant that can be used with a 64-bit logical
            instruction
  
!      'M'
            Integer constant that is valid as an immediate operand in a
!           32-bit 'MOV' pseudo instruction.  The 'MOV' may be assembled
            to one of several different machine instructions depending on
            the value
  
!      'N'
            Integer constant that is valid as an immediate operand in a
!           64-bit 'MOV' pseudo instruction
  
!      'S'
            An absolute symbolic address or a label reference
  
!      'Y'
            Floating point constant zero
  
!      'Z'
            Integer constant zero
  
!      'Ush'
!           The high part (bits 12 and upwards) of the pc-relative address
!           of a symbol within 4GB of the instruction
  
!      'Q'
            A memory address which uses a single base register with no
            offset
  
!      'Ump'
!           A memory address suitable for a load/store pair instruction in
!           SI, DI, SF and DF modes
  
! _ARC --'config/arc/constraints.md'_
!      'q'
!           Registers usable in ARCompact 16-bit instructions: 'r0'-'r3',
!           'r12'-'r15'.  This constraint can only match when the '-mq'
            option is in effect.
  
!      'e'
!           Registers usable as base-regs of memory addresses in ARCompact
!           16-bit memory instructions: 'r0'-'r3', 'r12'-'r15', 'sp'.
!           This constraint can only match when the '-mq' option is in
!           effect.
!      'D'
!           ARC FPX (dpfp) 64-bit registers.  'D0', 'D1'.
  
!      'I'
            A signed 12-bit integer constant.
  
!      'Cal'
!           constant for arithmetic/logical operations.  This might be any
!           constant that can be put into a long immediate by the assmbler
!           or linker without involving a PIC relocation.
  
!      'K'
            A 3-bit unsigned integer constant.
  
!      'L'
            A 6-bit unsigned integer constant.
  
!      'CnL'
            One's complement of a 6-bit unsigned integer constant.
  
!      'CmL'
            Two's complement of a 6-bit unsigned integer constant.
  
!      'M'
            A 5-bit unsigned integer constant.
  
!      'O'
            A 7-bit unsigned integer constant.
  
!      'P'
            A 8-bit unsigned integer constant.
  
!      'H'
            Any const_double value.
  
! _ARM family--'config/arm/constraints.md'_
  
!      'h'
!           In Thumb state, the core registers 'r8'-'r15'.
  
!      'k'
            The stack pointer register.
  
!      'l'
!           In Thumb State the core registers 'r0'-'r7'.  In ARM state
!           this is an alias for the 'r' constraint.
  
!      't'
!           VFP floating-point registers 's0'-'s31'.  Used for 32 bit
            values.
  
!      'w'
!           VFP floating-point registers 'd0'-'d31' and the appropriate
!           subset 'd0'-'d15' based on command line options.  Used for 64
            bit values only.  Not valid for Thumb1.
  
!      'y'
            The iWMMX co-processor registers.
  
!      'z'
            The iWMMX GR registers.
  
!      'G'
            The floating-point constant 0.0
  
!      'I'
            Integer that is valid as an immediate operand in a data
!           processing instruction.  That is, an integer in the range 0 to
!           255 rotated by a multiple of 2
  
!      'J'
            Integer in the range -4095 to 4095
  
!      'K'
!           Integer that satisfies constraint 'I' when inverted (ones
            complement)
  
!      'L'
!           Integer that satisfies constraint 'I' when negated (twos
            complement)
  
!      'M'
            Integer in the range 0 to 32
  
!      'Q'
            A memory reference where the exact address is in a single
!           register (''m'' is preferable for 'asm' statements)
  
!      'R'
            An item in the constant pool
  
!      'S'
            A symbol in the text segment of the current file
  
!      'Uv'
            A memory reference suitable for VFP load/store insns
            (reg+constant offset)
  
!      'Uy'
            A memory reference suitable for iWMMXt load/store
            instructions.
  
!      'Uq'
            A memory reference suitable for the ARMv4 ldrsb instruction.
  
! _AVR family--'config/avr/constraints.md'_
!      'l'
            Registers from r0 to r15
  
!      'a'
            Registers from r16 to r23
  
!      'd'
            Registers from r16 to r31
  
!      'w'
            Registers from r24 to r31.  These registers can be used in
!           'adiw' command
  
!      'e'
            Pointer register (r26-r31)
  
!      'b'
            Base pointer register (r28-r31)
  
!      'q'
            Stack pointer register (SPH:SPL)
  
!      't'
            Temporary register r0
  
!      'x'
            Register pair X (r27:r26)
  
!      'y'
            Register pair Y (r29:r28)
  
!      'z'
            Register pair Z (r31:r30)
  
!      'I'
            Constant greater than -1, less than 64
  
!      'J'
            Constant greater than -64, less than 1
  
!      'K'
            Constant integer 2
  
!      'L'
            Constant integer 0
  
!      'M'
            Constant that fits in 8 bits
  
!      'N'
            Constant integer -1
  
!      'O'
            Constant integer 8, 16, or 24
  
!      'P'
            Constant integer 1
  
!      'G'
            A floating point constant 0.0
  
!      'Q'
            A memory address based on Y or Z pointer with displacement.
  
! _Blackfin family--'config/bfin/constraints.md'_
!      'a'
            P register
  
!      'd'
            D register
  
!      'z'
            A call clobbered P register.
  
!      'qN'
            A single register.  If N is in the range 0 to 7, the
!           corresponding D register.  If it is 'A', then the register P0.
  
!      'D'
            Even-numbered D register
  
!      'W'
            Odd-numbered D register
  
!      'e'
            Accumulator register.
  
!      'A'
            Even-numbered accumulator register.
  
!      'B'
            Odd-numbered accumulator register.
  
!      'b'
            I register
  
!      'v'
            B register
  
!      'f'
            M register
  
!      'c'
!           Registers used for circular buffering, i.e.  I, B, or L
            registers.
  
!      'C'
            The CC register.
  
!      't'
            LT0 or LT1.
  
!      'k'
            LC0 or LC1.
  
!      'u'
            LB0 or LB1.
  
!      'x'
            Any D, P, B, M, I or L register.
  
!      'y'
            Additional registers typically used only in prologues and
            epilogues: RETS, RETN, RETI, RETX, RETE, ASTAT, SEQSTAT and
            USP.
  
!      'w'
            Any register except accumulators or CC.
  
!      'Ksh'
            Signed 16 bit integer (in the range -32768 to 32767)
  
!      'Kuh'
            Unsigned 16 bit integer (in the range 0 to 65535)
  
!      'Ks7'
            Signed 7 bit integer (in the range -64 to 63)
  
!      'Ku7'
            Unsigned 7 bit integer (in the range 0 to 127)
  
!      'Ku5'
            Unsigned 5 bit integer (in the range 0 to 31)
  
!      'Ks4'
            Signed 4 bit integer (in the range -8 to 7)
  
!      'Ks3'
            Signed 3 bit integer (in the range -3 to 4)
  
!      'Ku3'
            Unsigned 3 bit integer (in the range 0 to 7)
  
!      'PN'
            Constant N, where N is a single-digit constant in the range 0
            to 4.
  
!      'PA'
            An integer equal to one of the MACFLAG_XXX constants that is
            suitable for use with either accumulator.
  
!      'PB'
            An integer equal to one of the MACFLAG_XXX constants that is
            suitable for use only with accumulator A1.
  
!      'M1'
            Constant 255.
  
!      'M2'
            Constant 65535.
  
!      'J'
            An integer constant with exactly a single bit set.
  
!      'L'
            An integer constant with all bits set except exactly one.
  
!      'H'
  
!      'Q'
            Any SYMBOL_REF.
  
! _CR16 Architecture--'config/cr16/cr16.h'_
  
!      'b'
            Registers from r0 to r14 (registers without stack pointer)
  
!      't'
            Register from r0 to r11 (all 16-bit registers)
  
!      'p'
            Register from r12 to r15 (all 32-bit registers)
  
!      'I'
            Signed constant that fits in 4 bits
  
!      'J'
            Signed constant that fits in 5 bits
  
!      'K'
            Signed constant that fits in 6 bits
  
!      'L'
            Unsigned constant that fits in 4 bits
  
!      'M'
            Signed constant that fits in 32 bits
  
!      'N'
            Check for 64 bits wide constants for add/sub instructions
  
!      'G'
            Floating point constant that is legal for store immediate
  
! _Epiphany--'config/epiphany/constraints.md'_
!      'U16'
            An unsigned 16-bit constant.
  
!      'K'
            An unsigned 5-bit constant.
  
!      'L'
            A signed 11-bit constant.
  
!      'Cm1'
!           A signed 11-bit constant added to -1.  Can only match when the
!           '-m1reg-REG' option is active.
  
!      'Cl1'
            Left-shift of -1, i.e., a bit mask with a block of leading
            ones, the rest being a block of trailing zeroes.  Can only
!           match when the '-m1reg-REG' option is active.
  
!      'Cr1'
            Right-shift of -1, i.e., a bit mask with a trailing block of
            ones, the rest being zeroes.  Or to put it another way, one
            less than a power of two.  Can only match when the
!           '-m1reg-REG' option is active.
  
!      'Cal'
!           Constant for arithmetic/logical operations.  This is like 'i',
!           except that for position independent code, no symbols /
            expressions needing relocations are allowed.
  
!      'Csy'
            Symbolic constant for call/jump instruction.
  
!      'Rcs'
            The register class usable in short insns.  This is a register
            class constraint, and can thus drive register allocation.
!           This constraint won't match unless '-mprefer-short-insn-regs'
            is in effect.
  
!      'Rsc'
            The the register class of registers that can be used to hold a
            sibcall call address.  I.e., a caller-saved register.
  
!      'Rct'
            Core control register class.
  
!      'Rgs'
            The register group usable in short insns.  This constraint
            does not use a register class, so that it only passively
            matches suitable registers, and doesn't drive register
            allocation.
  
!      'Rra'
!           Matches the return address if it can be replaced with the link
!           register.
  
!      'Rcc'
            Matches the integer condition code register.
  
!      'Sra'
            Matches the return address if it is in a stack slot.
  
!      'Cfm'
            Matches control register values to switch fp mode, which are
!           encapsulated in 'UNSPEC_FP_MODE'.
  
! _FRV--'config/frv/frv.h'_
!      'a'
!           Register in the class 'ACC_REGS' ('acc0' to 'acc7').
  
!      'b'
!           Register in the class 'EVEN_ACC_REGS' ('acc0' to 'acc7').
  
!      'c'
!           Register in the class 'CC_REGS' ('fcc0' to 'fcc3' and 'icc0'
!           to 'icc3').
  
!      'd'
!           Register in the class 'GPR_REGS' ('gr0' to 'gr63').
  
!      'e'
!           Register in the class 'EVEN_REGS' ('gr0' to 'gr63').  Odd
!           registers are excluded not in the class but through the use of
!           a machine mode larger than 4 bytes.
  
!      'f'
!           Register in the class 'FPR_REGS' ('fr0' to 'fr63').
  
!      'h'
!           Register in the class 'FEVEN_REGS' ('fr0' to 'fr63').  Odd
!           registers are excluded not in the class but through the use of
!           a machine mode larger than 4 bytes.
  
!      'l'
!           Register in the class 'LR_REG' (the 'lr' register).
  
!      'q'
!           Register in the class 'QUAD_REGS' ('gr2' to 'gr63').  Register
!           numbers not divisible by 4 are excluded not in the class but
!           through the use of a machine mode larger than 8 bytes.
  
!      't'
!           Register in the class 'ICC_REGS' ('icc0' to 'icc3').
  
!      'u'
!           Register in the class 'FCC_REGS' ('fcc0' to 'fcc3').
  
!      'v'
!           Register in the class 'ICR_REGS' ('cc4' to 'cc7').
  
!      'w'
!           Register in the class 'FCR_REGS' ('cc0' to 'cc3').
  
!      'x'
!           Register in the class 'QUAD_FPR_REGS' ('fr0' to 'fr63').
            Register numbers not divisible by 4 are excluded not in the
            class but through the use of a machine mode larger than 8
            bytes.
  
!      'z'
!           Register in the class 'SPR_REGS' ('lcr' and 'lr').
  
!      'A'
!           Register in the class 'QUAD_ACC_REGS' ('acc0' to 'acc7').
  
!      'B'
!           Register in the class 'ACCG_REGS' ('accg0' to 'accg7').
  
!      'C'
!           Register in the class 'CR_REGS' ('cc0' to 'cc7').
  
!      'G'
            Floating point constant zero
  
!      'I'
            6-bit signed integer constant
  
!      'J'
            10-bit signed integer constant
  
!      'L'
            16-bit signed integer constant
  
!      'M'
            16-bit unsigned integer constant
  
!      'N'
            12-bit signed integer constant that is negative--i.e. in the
            range of -2048 to -1
  
!      'O'
            Constant zero
  
!      'P'
!           12-bit signed integer constant that is greater than zero--i.e.
!           in the range of 1 to 2047.
  
! _Hewlett-Packard PA-RISC--'config/pa/pa.h'_
!      'a'
            General register 1
  
!      'f'
            Floating point register
  
!      'q'
            Shift amount register
  
!      'x'
            Floating point register (deprecated)
  
!      'y'
            Upper floating point register (32-bit), floating point
            register (64-bit)
  
!      'Z'
            Any register
  
!      'I'
            Signed 11-bit integer constant
  
!      'J'
            Signed 14-bit integer constant
  
!      'K'
!           Integer constant that can be deposited with a 'zdepi'
            instruction
  
!      'L'
            Signed 5-bit integer constant
  
!      'M'
            Integer constant 0
  
!      'N'
!           Integer constant that can be loaded with a 'ldil' instruction
  
!      'O'
            Integer constant whose value plus one is a power of 2
  
!      'P'
!           Integer constant that can be used for 'and' operations in
!           'depi' and 'extru' instructions
  
!      'S'
            Integer constant 31
  
!      'U'
            Integer constant 63
  
!      'G'
            Floating-point constant 0.0
  
!      'A'
!           A 'lo_sum' data-linkage-table memory operand
  
!      'Q'
            A memory operand that can be used as the destination operand
            of an integer store instruction
  
!      'R'
            A scaled or unscaled indexed memory operand
  
!      'T'
            A memory operand for floating-point loads and stores
  
!      'W'
            A register indirect memory operand
  
! _Intel IA-64--'config/ia64/ia64.h'_
!      'a'
!           General register 'r0' to 'r3' for 'addl' instruction
  
!      'b'
            Branch register
  
!      'c'
!           Predicate register ('c' as in "conditional")
  
!      'd'
            Application register residing in M-unit
  
!      'e'
            Application register residing in I-unit
  
!      'f'
            Floating-point register
  
!      'm'
!           Memory operand.  If used together with '<' or '>', the operand
!           can have postincrement and postdecrement which require
!           printing with '%Pn' on IA-64.
  
!      'G'
            Floating-point constant 0.0 or 1.0
  
!      'I'
            14-bit signed integer constant
  
!      'J'
            22-bit signed integer constant
  
!      'K'
            8-bit signed integer constant for logical instructions
  
!      'L'
            8-bit adjusted signed integer constant for compare pseudo-ops
  
!      'M'
            6-bit unsigned integer constant for shift counts
  
!      'N'
            9-bit signed integer constant for load and store
            postincrements
  
!      'O'
            The constant zero
  
!      'P'
!           0 or -1 for 'dep' instruction
  
!      'Q'
            Non-volatile memory for floating-point loads and stores
  
!      'R'
!           Integer constant in the range 1 to 4 for 'shladd' instruction
  
!      'S'
            Memory operand except postincrement and postdecrement.  This
!           is now roughly the same as 'm' when not used together with '<'
!           or '>'.
  
! _M32C--'config/m32c/m32c.c'_
!      'Rsp'
!      'Rfb'
!      'Rsb'
!           '$sp', '$fb', '$sb'.
  
!      'Rcr'
            Any control register, when they're 16 bits wide (nothing if
            control registers are 24 bits wide)
  
!      'Rcl'
            Any control register, when they're 24 bits wide.
  
!      'R0w'
!      'R1w'
!      'R2w'
!      'R3w'
            $r0, $r1, $r2, $r3.
  
!      'R02'
            $r0 or $r2, or $r2r0 for 32 bit values.
  
!      'R13'
            $r1 or $r3, or $r3r1 for 32 bit values.
  
!      'Rdi'
            A register that can hold a 64 bit value.
  
!      'Rhl'
            $r0 or $r1 (registers with addressable high/low bytes)
  
!      'R23'
            $r2 or $r3
  
!      'Raa'
            Address registers
  
!      'Raw'
            Address registers when they're 16 bits wide.
  
!      'Ral'
            Address registers when they're 24 bits wide.
  
!      'Rqi'
            Registers that can hold QI values.
  
!      'Rad'
            Registers that can be used with displacements ($a0, $a1, $sb).
  
!      'Rsi'
            Registers that can hold 32 bit values.
  
!      'Rhi'
            Registers that can hold 16 bit values.
  
!      'Rhc'
            Registers chat can hold 16 bit values, including all control
            registers.
  
!      'Rra'
            $r0 through R1, plus $a0 and $a1.
  
!      'Rfl'
            The flags register.
  
!      'Rmm'
            The memory-based pseudo-registers $mem0 through $mem15.
  
!      'Rpi'
            Registers that can hold pointers (16 bit registers for r8c,
            m16c; 24 bit registers for m32cm, m32c).
  
!      'Rpa'
            Matches multiple registers in a PARALLEL to form a larger
            register.  Used to match function return values.
  
!      'Is3'
            -8 ... 7
  
!      'IS1'
            -128 ... 127
  
!      'IS2'
            -32768 ... 32767
  
!      'IU2'
            0 ... 65535
  
!      'In4'
            -8 ... -1 or 1 ... 8
  
!      'In5'
            -16 ... -1 or 1 ... 16
  
!      'In6'
            -32 ... -1 or 1 ... 32
  
!      'IM2'
            -65536 ... -1
  
!      'Ilb'
            An 8 bit value with exactly one bit set.
  
!      'Ilw'
            A 16 bit value with exactly one bit set.
  
!      'Sd'
            The common src/dest memory addressing modes.
  
!      'Sa'
            Memory addressed using $a0 or $a1.
  
!      'Si'
            Memory addressed with immediate addresses.
  
!      'Ss'
            Memory addressed using the stack pointer ($sp).
  
!      'Sf'
            Memory addressed using the frame base register ($fb).
  
!      'Ss'
            Memory addressed using the small base register ($sb).
  
!      'S1'
            $r1h
  
! _MeP--'config/mep/constraints.md'_
  
!      'a'
            The $sp register.
  
!      'b'
            The $tp register.
  
!      'c'
            Any control register.
  
!      'd'
            Either the $hi or the $lo register.
  
!      'em'
            Coprocessor registers that can be directly loaded ($c0-$c15).
  
!      'ex'
            Coprocessor registers that can be moved to each other.
  
!      'er'
            Coprocessor registers that can be moved to core registers.
  
!      'h'
            The $hi register.
  
!      'j'
            The $rpc register.
  
!      'l'
            The $lo register.
  
!      't'
            Registers which can be used in $tp-relative addressing.
  
!      'v'
            The $gp register.
  
!      'x'
            The coprocessor registers.
  
!      'y'
            The coprocessor control registers.
  
!      'z'
            The $0 register.
  
!      'A'
            User-defined register set A.
  
!      'B'
            User-defined register set B.
  
!      'C'
            User-defined register set C.
  
!      'D'
            User-defined register set D.
  
!      'I'
            Offsets for $gp-rel addressing.
  
!      'J'
            Constants that can be used directly with boolean insns.
  
!      'K'
            Constants that can be moved directly to registers.
  
!      'L'
            Small constants that can be added to registers.
  
!      'M'
            Long shift counts.
  
!      'N'
            Small constants that can be compared to registers.
  
!      'O'
            Constants that can be loaded into the top half of registers.
  
!      'S'
            Signed 8-bit immediates.
  
!      'T'
            Symbols encoded for $tp-rel or $gp-rel addressing.
  
!      'U'
            Non-constant addresses for loading/saving coprocessor
            registers.
  
!      'W'
            The top half of a symbol's value.
  
!      'Y'
            A register indirect address without offset.
  
!      'Z'
            Symbolic references to the control bus.
  
+ _MicroBlaze--'config/microblaze/constraints.md'_
+      'd'
+           A general register ('r0' to 'r31').
  
!      'z'
!           A status register ('rmsr', '$fcc1' to '$fcc7').
  
! _MIPS--'config/mips/constraints.md'_
!      'd'
!           An address register.  This is equivalent to 'r' unless
            generating MIPS16 code.
  
!      'f'
            A floating-point register (if available).
  
!      'h'
!           Formerly the 'hi' register.  This constraint is no longer
            supported.
  
!      'l'
!           The 'lo' register.  Use this register to store values that are
            no bigger than a word.
  
!      'x'
!           The concatenated 'hi' and 'lo' registers.  Use this register
            to store doubleword values.
  
!      'c'
            A register suitable for use in an indirect jump.  This will
!           always be '$25' for '-mabicalls'.
  
!      'v'
!           Register '$3'.  Do not use this constraint in new code; it is
            retained only for compatibility with glibc.
  
!      'y'
!           Equivalent to 'r'; retained for backwards compatibility.
  
!      'z'
            A floating-point condition code register.
  
!      'I'
            A signed 16-bit constant (for arithmetic instructions).
  
!      'J'
            Integer zero.
  
!      'K'
            An unsigned 16-bit constant (for logic instructions).
  
!      'L'
            A signed 32-bit constant in which the lower 16 bits are zero.
!           Such constants can be loaded using 'lui'.
  
!      'M'
!           A constant that cannot be loaded using 'lui', 'addiu' or
!           'ori'.
  
!      'N'
            A constant in the range -65535 to -1 (inclusive).
  
!      'O'
            A signed 15-bit constant.
  
!      'P'
            A constant in the range 1 to 65535 (inclusive).
  
!      'G'
            Floating-point zero.
  
!      'R'
            An address that can be used in a non-macro load or store.
  
!      'ZC'
            A memory operand whose address is formed by a base register
            and offset that is suitable for use in instructions with the
!           same addressing mode as 'll' and 'sc'.
  
!      'ZD'
!           An address suitable for a 'prefetch' instruction, or for any
!           other instruction with the same addressing mode as 'prefetch'.
  
! _Motorola 680x0--'config/m68k/constraints.md'_
!      'a'
            Address register
  
!      'd'
            Data register
  
!      'f'
            68881 floating-point register, if available
  
!      'I'
            Integer in the range 1 to 8
  
!      'J'
            16-bit signed number
  
!      'K'
            Signed number whose magnitude is greater than 0x80
  
!      'L'
            Integer in the range -8 to -1
  
!      'M'
            Signed number whose magnitude is greater than 0x100
  
!      'N'
            Range 24 to 31, rotatert:SI 8 to 1 expressed as rotate
  
!      'O'
            16 (for rotate using swap)
  
!      'P'
            Range 8 to 15, rotatert:HI 8 to 1 expressed as rotate
  
!      'R'
            Numbers that mov3q can handle
  
!      'G'
            Floating point constant that is not a 68881 constant
  
!      'S'
            Operands that satisfy 'm' when -mpcrel is in effect
  
!      'T'
            Operands that satisfy 's' when -mpcrel is not in effect
  
!      'Q'
            Address register indirect addressing mode
  
!      'U'
            Register offset addressing
  
!      'W'
            const_call_operand
  
!      'Cs'
            symbol_ref or const
  
!      'Ci'
            const_int
  
!      'C0'
            const_int 0
  
!      'Cj'
            Range of signed numbers that don't fit in 16 bits
  
!      'Cmvq'
            Integers valid for mvq
  
!      'Capsw'
            Integers valid for a moveq followed by a swap
  
!      'Cmvz'
            Integers valid for mvz
  
!      'Cmvs'
            Integers valid for mvs
  
!      'Ap'
            push_operand
  
!      'Ac'
            Non-register operands allowed in clr
  
! _Moxie--'config/moxie/constraints.md'_
!      'A'
            An absolute address
  
!      'B'
            An offset address
  
!      'W'
            A register indirect memory operand
  
!      'I'
            A constant in the range of 0 to 255.
  
!      'N'
            A constant in the range of 0 to -255.
  
+ _MSP430-'config/msp430/constraints.md'_
  
!      'R12'
            Register R12.
  
!      'R13'
            Register R13.
  
!      'K'
            Integer constant 1.
  
!      'L'
            Integer constant -1^20..1^19.
  
!      'M'
            Integer constant 1-4.
  
!      'Ya'
            Memory references which do not require an extended MOVX
            instruction.
  
!      'Yl'
            Memory reference, labels only.
  
!      'Ys'
            Memory reference, stack only.
  
! _NDS32--'config/nds32/constraints.md'_
!      'w'
            LOW register class $r0 to $r7 constraint for V3/V3M ISA.
!      'l'
            LOW register class $r0 to $r7.
!      'd'
            MIDDLE register class $r0 to $r11, $r16 to $r19.
!      'h'
            HIGH register class $r12 to $r14, $r20 to $r31.
!      't'
            Temporary assist register $ta (i.e. $r15).
!      'k'
            Stack register $sp.
!      'Iu03'
            Unsigned immediate 3-bit value.
!      'In03'
            Negative immediate 3-bit value in the range of -7-0.
!      'Iu04'
            Unsigned immediate 4-bit value.
!      'Is05'
            Signed immediate 5-bit value.
!      'Iu05'
            Unsigned immediate 5-bit value.
!      'In05'
            Negative immediate 5-bit value in the range of -31-0.
!      'Ip05'
            Unsigned immediate 5-bit value for movpi45 instruction with
            range 16-47.
!      'Iu06'
            Unsigned immediate 6-bit value constraint for addri36.sp
            instruction.
!      'Iu08'
            Unsigned immediate 8-bit value.
!      'Iu09'
            Unsigned immediate 9-bit value.
!      'Is10'
            Signed immediate 10-bit value.
!      'Is11'
            Signed immediate 11-bit value.
!      'Is15'
            Signed immediate 15-bit value.
!      'Iu15'
            Unsigned immediate 15-bit value.
!      'Ic15'
!           A constant which is not in the range of imm15u but ok for bclr
!           instruction.
!      'Ie15'
!           A constant which is not in the range of imm15u but ok for bset
!           instruction.
!      'It15'
!           A constant which is not in the range of imm15u but ok for btgl
!           instruction.
!      'Ii15'
            A constant whose compliment value is in the range of imm15u
            and ok for bitci instruction.
!      'Is16'
            Signed immediate 16-bit value.
!      'Is17'
            Signed immediate 17-bit value.
!      'Is19'
            Signed immediate 19-bit value.
!      'Is20'
            Signed immediate 20-bit value.
!      'Ihig'
            The immediate value that can be simply set high 20-bit.
!      'Izeb'
            The immediate value 0xff.
!      'Izeh'
            The immediate value 0xffff.
!      'Ixls'
            The immediate value 0x01.
!      'Ix11'
            The immediate value 0x7ff.
!      'Ibms'
            The immediate value with power of 2.
!      'Ifex'
            The immediate value with power of 2 minus 1.
!      'U33'
            Memory constraint for 333 format.
!      'U45'
            Memory constraint for 45 format.
!      'U37'
            Memory constraint for 37 format.
  
! _Nios II family--'config/nios2/constraints.md'_
  
!      'I'
            Integer that is valid as an immediate operand in an
!           instruction taking a signed 16-bit number.  Range -32768 to
            32767.
  
!      'J'
            Integer that is valid as an immediate operand in an
!           instruction taking an unsigned 16-bit number.  Range 0 to
            65535.
  
!      'K'
            Integer that is valid as an immediate operand in an
            instruction taking only the upper 16-bits of a 32-bit number.
            Range 32-bit numbers with the lower 16-bits being 0.
  
!      'L'
            Integer that is valid as an immediate operand for a shift
!           instruction.  Range 0 to 31.
  
!      'M'
            Integer that is valid as an immediate operand for only the
!           value 0.  Can be used in conjunction with the format modifier
!           'z' to use 'r0' instead of '0' in the assembly output.
  
!      'N'
            Integer that is valid as an immediate operand for a custom
!           instruction opcode.  Range 0 to 255.
  
!      'S'
            Matches immediates which are addresses in the small data
!           section and therefore can be added to 'gp' as a 16-bit
            immediate to re-create their 32-bit value.
  
+ _PDP-11--'config/pdp11/constraints.md'_
+      'a'
+           Floating point registers AC0 through AC3.  These can be loaded
+           from/to memory with a single instruction.
  
!      'd'
            Odd numbered general registers (R1, R3, R5).  These are used
            for 16-bit multiply operations.
  
!      'f'
            Any of the floating point registers (AC0 through AC5).
  
!      'G'
            Floating point constant 0.
  
!      'I'
            An integer constant that fits in 16 bits.
  
!      'J'
            An integer constant whose low order 16 bits are zero.
  
!      'K'
            An integer constant that does not meet the constraints for
!           codes 'I' or 'J'.
  
!      'L'
            The integer constant 1.
  
!      'M'
            The integer constant -1.
  
!      'N'
            The integer constant 0.
  
!      'O'
            Integer constants -4 through -1 and 1 through 4; shifts by
!           these amounts are handled as multiple single-bit shifts rather
!           than a single variable-length shift.
  
!      'Q'
            A memory reference which requires an additional word (address
            or offset) after the opcode.
  
!      'R'
            A memory reference that is encoded within the opcode.
  
! _PowerPC and IBM RS6000--'config/rs6000/constraints.md'_
!      'b'
            Address base register
  
!      'd'
            Floating point register (containing 64-bit value)
  
!      'f'
            Floating point register (containing 32-bit value)
  
!      'v'
            Altivec vector register
  
!      'wa'
            Any VSX register if the -mvsx option was used or NO_REGS.
  
!           When using any of the register constraints ('wa', 'wd', 'wf',
!           'wg', 'wh', 'wi', 'wj', 'wk', 'wl', 'wm', 'ws', 'wt', 'wu',
!           'wv', 'ww', or 'wy') that take VSX registers, you must use
!           '%x<n>' in the template so that the correct register is used.
!           Otherwise the register number output in the assembly file will
!           be incorrect if an Altivec register is an operand of a VSX
!           instruction that expects VSX register numbering.
  
                 asm ("xvadddp %x0,%x1,%x2" : "=wa" (v1) : "wa" (v2), "wa" (v3));
  
*************** _PowerPC and IBM RS6000--`config/rs6000/
*** 31268,31410 ****
  
            is not correct.
  
!     `wd'
            VSX vector register to hold vector double data or NO_REGS.
  
!     `wf'
            VSX vector register to hold vector float data or NO_REGS.
  
!     `wg'
!           If `-mmfpgpr' was used, a floating point register or NO_REGS.
  
!     `wh'
            Floating point register if direct moves are available, or
            NO_REGS.
  
!     `wi'
            FP or VSX register to hold 64-bit integers for VSX insns or
            NO_REGS.
  
!     `wj'
!           FP or VSX register to hold 64-bit integers for direct moves
!           or NO_REGS.
  
!     `wk'
            FP or VSX register to hold 64-bit doubles for direct moves or
            NO_REGS.
  
!     `wl'
            Floating point register if the LFIWAX instruction is enabled
            or NO_REGS.
  
!     `wm'
            VSX register if direct move instructions are enabled, or
            NO_REGS.
  
!     `wn'
            No register (NO_REGS).
  
!     `wr'
!           General purpose register if 64-bit instructions are enabled
!           or NO_REGS.
  
!     `ws'
            VSX vector register to hold scalar double values or NO_REGS.
  
!     `wt'
            VSX vector register to hold 128 bit integer or NO_REGS.
  
!     `wu'
!           Altivec register to use for float/32-bit int loads/stores  or
            NO_REGS.
  
!     `wv'
!           Altivec register to use for double loads/stores  or NO_REGS.
  
!     `ww'
!           FP or VSX register to perform float operations under `-mvsx'
            or NO_REGS.
  
!     `wx'
            Floating point register if the STFIWX instruction is enabled
            or NO_REGS.
  
!     `wy'
            FP or VSX register to perform ISA 2.07 float ops or NO_REGS.
  
!     `wz'
            Floating point register if the LFIWZX instruction is enabled
            or NO_REGS.
  
!     `wD'
            Int constant that is the element number of the 64-bit scalar
            in a vector.
  
!     `wQ'
!           A memory address that will work with the `lq' and `stq'
            instructions.
  
!     `h'
!           `MQ', `CTR', or `LINK' register
  
!     `q'
!           `MQ' register
  
!     `c'
!           `CTR' register
  
!     `l'
!           `LINK' register
  
!     `x'
!           `CR' register (condition register) number 0
  
!     `y'
!           `CR' register (condition register)
  
!     `z'
!           `XER[CA]' carry bit (part of the XER register)
  
!     `I'
            Signed 16-bit constant
  
!     `J'
!           Unsigned 16-bit constant shifted left 16 bits (use `L'
!           instead for `SImode' constants)
  
!     `K'
            Unsigned 16-bit constant
  
!     `L'
            Signed 16-bit constant shifted left 16 bits
  
!     `M'
            Constant larger than 31
  
!     `N'
            Exact power of 2
  
!     `O'
            Zero
  
!     `P'
            Constant whose negation is a signed 16-bit constant
  
!     `G'
            Floating point constant that can be loaded into a register
            with one instruction per word
  
!     `H'
            Integer/Floating point constant that can be loaded into a
            register using three instructions
  
!     `m'
!           Memory operand.  Normally, `m' does not allow addresses that
!           update the base register.  If `<' or `>' constraint is also
            used, they are allowed and therefore on PowerPC targets in
!           that case it is only safe to use `m<>' in an `asm' statement
!           if that `asm' statement accesses the operand exactly once.
!           The `asm' statement must also use `%U<OPNO>' as a placeholder
            for the "update" flag in the corresponding load or store
            instruction.  For example:
  
--- 31000,31142 ----
  
            is not correct.
  
!      'wd'
            VSX vector register to hold vector double data or NO_REGS.
  
!      'wf'
            VSX vector register to hold vector float data or NO_REGS.
  
!      'wg'
!           If '-mmfpgpr' was used, a floating point register or NO_REGS.
  
!      'wh'
            Floating point register if direct moves are available, or
            NO_REGS.
  
!      'wi'
            FP or VSX register to hold 64-bit integers for VSX insns or
            NO_REGS.
  
!      'wj'
!           FP or VSX register to hold 64-bit integers for direct moves or
!           NO_REGS.
  
!      'wk'
            FP or VSX register to hold 64-bit doubles for direct moves or
            NO_REGS.
  
!      'wl'
            Floating point register if the LFIWAX instruction is enabled
            or NO_REGS.
  
!      'wm'
            VSX register if direct move instructions are enabled, or
            NO_REGS.
  
!      'wn'
            No register (NO_REGS).
  
!      'wr'
!           General purpose register if 64-bit instructions are enabled or
!           NO_REGS.
  
!      'ws'
            VSX vector register to hold scalar double values or NO_REGS.
  
!      'wt'
            VSX vector register to hold 128 bit integer or NO_REGS.
  
!      'wu'
!           Altivec register to use for float/32-bit int loads/stores or
            NO_REGS.
  
!      'wv'
!           Altivec register to use for double loads/stores or NO_REGS.
  
!      'ww'
!           FP or VSX register to perform float operations under '-mvsx'
            or NO_REGS.
  
!      'wx'
            Floating point register if the STFIWX instruction is enabled
            or NO_REGS.
  
!      'wy'
            FP or VSX register to perform ISA 2.07 float ops or NO_REGS.
  
!      'wz'
            Floating point register if the LFIWZX instruction is enabled
            or NO_REGS.
  
!      'wD'
            Int constant that is the element number of the 64-bit scalar
            in a vector.
  
!      'wQ'
!           A memory address that will work with the 'lq' and 'stq'
            instructions.
  
!      'h'
!           'MQ', 'CTR', or 'LINK' register
  
!      'q'
!           'MQ' register
  
!      'c'
!           'CTR' register
  
!      'l'
!           'LINK' register
  
!      'x'
!           'CR' register (condition register) number 0
  
!      'y'
!           'CR' register (condition register)
  
!      'z'
!           'XER[CA]' carry bit (part of the XER register)
  
!      'I'
            Signed 16-bit constant
  
!      'J'
!           Unsigned 16-bit constant shifted left 16 bits (use 'L' instead
!           for 'SImode' constants)
  
!      'K'
            Unsigned 16-bit constant
  
!      'L'
            Signed 16-bit constant shifted left 16 bits
  
!      'M'
            Constant larger than 31
  
!      'N'
            Exact power of 2
  
!      'O'
            Zero
  
!      'P'
            Constant whose negation is a signed 16-bit constant
  
!      'G'
            Floating point constant that can be loaded into a register
            with one instruction per word
  
!      'H'
            Integer/Floating point constant that can be loaded into a
            register using three instructions
  
!      'm'
!           Memory operand.  Normally, 'm' does not allow addresses that
!           update the base register.  If '<' or '>' constraint is also
            used, they are allowed and therefore on PowerPC targets in
!           that case it is only safe to use 'm<>' in an 'asm' statement
!           if that 'asm' statement accesses the operand exactly once.
!           The 'asm' statement must also use '%U<OPNO>' as a placeholder
            for the "update" flag in the corresponding load or store
            instruction.  For example:
  
*************** _PowerPC and IBM RS6000--`config/rs6000/
*** 31416,32178 ****
  
            is not.
  
!     `es'
!           A "stable" memory operand; that is, one which does not
!           include any automodification of the base register.  This used
!           to be useful when `m' allowed automodification of the base
!           register, but as those are now only allowed when `<' or `>'
!           is used, `es' is basically the same as `m' without `<' and
!           `>'.
  
!     `Q'
            Memory operand that is an offset from a register (it is
!           usually better to use `m' or `es' in `asm' statements)
  
!     `Z'
            Memory operand that is an indexed or indirect from a register
!           (it is usually better to use `m' or `es' in `asm' statements)
  
!     `R'
            AIX TOC entry
  
!     `a'
!           Address operand that is an indexed or indirect from a
!           register (`p' is preferable for `asm' statements)
  
!     `S'
            Constant suitable as a 64-bit mask operand
  
!     `T'
            Constant suitable as a 32-bit mask operand
  
!     `U'
            System V Release 4 small data area reference
  
!     `t'
            AND masks that can be performed by two rldic{l, r}
            instructions
  
!     `W'
            Vector constant that does not require memory
  
!     `j'
            Vector constant that is all zeros.
  
  
! _RL78--`config/rl78/constraints.md'_
! 
!     `Int3'
            An integer constant in the range 1 ... 7.
! 
!     `Int8'
            An integer constant in the range 0 ... 255.
! 
!     `J'
            An integer constant in the range -255 ... 0
! 
!     `K'
            The integer constant 1.
! 
!     `L'
            The integer constant -1.
! 
!     `M'
            The integer constant 0.
! 
!     `N'
            The integer constant 2.
! 
!     `O'
            The integer constant -2.
! 
!     `P'
            An integer constant in the range 1 ... 15.
! 
!     `Qbi'
            The built-in compare types-eq, ne, gtu, ltu, geu, and leu.
! 
!     `Qsc'
            The synthetic compare types-gt, lt, ge, and le.
! 
!     `Wab'
            A memory reference with an absolute address.
! 
!     `Wbc'
!           A memory reference using `BC' as a base register, with an
            optional offset.
! 
!     `Wca'
!           A memory reference using `AX', `BC', `DE', or `HL' for the
            address, for calls.
! 
!     `Wcv'
            A memory reference using any 16-bit register pair for the
            address, for calls.
! 
!     `Wd2'
!           A memory reference using `DE' as a base register, with an
            optional offset.
! 
!     `Wde'
!           A memory reference using `DE' as a base register, without any
            offset.
! 
!     `Wfr'
            Any memory reference to an address in the far address space.
! 
!     `Wh1'
!           A memory reference using `HL' as a base register, with an
            optional one-byte offset.
! 
!     `Whb'
!           A memory reference using `HL' as a base register, with `B' or
!           `C' as the index register.
! 
!     `Whl'
!           A memory reference using `HL' as a base register, without any
            offset.
! 
!     `Ws1'
!           A memory reference using `SP' as a base register, with an
            optional one-byte offset.
! 
!     `Y'
            Any memory reference to an address in the near address space.
! 
!     `A'
!           The `AX' register.
! 
!     `B'
!           The `BC' register.
! 
!     `D'
!           The `DE' register.
! 
!     `R'
!           `A' through `L' registers.
! 
!     `S'
!           The `SP' register.
! 
!     `T'
!           The `HL' register.
! 
!     `Z08W'
!           The 16-bit `R8' register.
! 
!     `Z10W'
!           The 16-bit `R10' register.
! 
!     `Zint'
!           The registers reserved for interrupts (`R24' to `R31').
! 
!     `a'
!           The `A' register.
! 
!     `b'
!           The `B' register.
! 
!     `c'
!           The `C' register.
! 
!     `d'
!           The `D' register.
! 
!     `e'
!           The `E' register.
! 
!     `h'
!           The `H' register.
! 
!     `l'
!           The `L' register.
! 
!     `v'
            The virtual registers.
  
!     `w'
!           The `PSW' register.
! 
!     `x'
!           The `X' register.
! 
! 
! _RX--`config/rx/constraints.md'_
! 
!     `Q'
!           An address which does not involve register indirect
!           addressing or pre/post increment/decrement addressing.
  
!     `Symbol'
            A symbol reference.
  
!     `Int08'
            A constant in the range -256 to 255, inclusive.
  
!     `Sint08'
            A constant in the range -128 to 127, inclusive.
  
!     `Sint16'
            A constant in the range -32768 to 32767, inclusive.
  
!     `Sint24'
            A constant in the range -8388608 to 8388607, inclusive.
  
!     `Uint04'
            A constant in the range 0 to 15, inclusive.
  
! 
! _S/390 and zSeries--`config/s390/s390.h'_
! 
!     `a'
            Address register (general purpose register except r0)
  
!     `c'
            Condition code register
  
!     `d'
            Data register (arbitrary general purpose register)
  
!     `f'
            Floating-point register
  
!     `I'
            Unsigned 8-bit constant (0-255)
  
!     `J'
            Unsigned 12-bit constant (0-4095)
  
!     `K'
            Signed 16-bit constant (-32768-32767)
  
!     `L'
            Value appropriate as displacement.
!          `(0..4095)'
                 for short displacement
! 
!          `(-524288..524287)'
                 for long displacement
  
!     `M'
            Constant integer with a value of 0x7fffffff.
  
!     `N'
            Multiple letter constraint followed by 4 parameter letters.
!          `0..9:'
                 number of the part counting from most to least
                 significant
! 
!          `H,Q:'
                 mode of the part
! 
!          `D,S,H:'
                 mode of the containing operand
! 
!          `0,F:'
                 value of the other parts (F--all bits set)
!           The constraint matches if the specified part of a constant
!           has a value different from its other parts.
  
!     `Q'
            Memory reference without index register and with short
            displacement.
  
!     `R'
            Memory reference with index register and short displacement.
  
!     `S'
            Memory reference without index register but with long
            displacement.
  
!     `T'
            Memory reference with index register and long displacement.
  
!     `U'
            Pointer with short displacement.
  
!     `W'
            Pointer with long displacement.
  
!     `Y'
            Shift count operand.
  
  
! _SPARC--`config/sparc/sparc.h'_
! 
!     `f'
!           Floating-point register on the SPARC-V8 architecture and
!           lower floating-point register on the SPARC-V9 architecture.
! 
!     `e'
!           Floating-point register.  It is equivalent to `f' on the
            SPARC-V8 architecture and contains both lower and upper
            floating-point registers on the SPARC-V9 architecture.
  
!     `c'
            Floating-point condition code register.
  
!     `d'
            Lower floating-point register.  It is only valid on the
            SPARC-V9 architecture when the Visual Instruction Set is
            available.
  
!     `b'
            Floating-point register.  It is only valid on the SPARC-V9
            architecture when the Visual Instruction Set is available.
  
!     `h'
            64-bit global or out register for the SPARC-V8+ architecture.
  
!     `C'
            The constant all-ones, for floating-point.
  
!     `A'
            Signed 5-bit constant
  
!     `D'
            A vector constant
  
!     `I'
            Signed 13-bit constant
  
!     `J'
            Zero
  
!     `K'
            32-bit constant with the low 12 bits clear (a constant that
!           can be loaded with the `sethi' instruction)
  
!     `L'
!           A constant in the range supported by `movcc' instructions
            (11-bit signed immediate)
  
!     `M'
!           A constant in the range supported by `movrcc' instructions
            (10-bit signed immediate)
  
!     `N'
!           Same as `K', except that it verifies that bits that are not
!           in the lower 32-bit range are all zero.  Must be used instead
!           of `K' for modes wider than `SImode'
  
!     `O'
            The constant 4096
  
!     `G'
            Floating-point zero
  
!     `H'
            Signed 13-bit constant, sign-extended to 32 or 64 bits
  
!     `P'
            The constant -1
  
!     `Q'
            Floating-point constant whose integral representation can be
            moved into an integer register using a single sethi
            instruction
  
!     `R'
            Floating-point constant whose integral representation can be
            moved into an integer register using a single mov instruction
  
!     `S'
            Floating-point constant whose integral representation can be
!           moved into an integer register using a high/lo_sum
!           instruction sequence
  
!     `T'
            Memory address aligned to an 8-byte boundary
  
!     `U'
            Even register
  
!     `W'
!           Memory address for `e' constraint registers
  
!     `w'
            Memory address with only a base register
  
!     `Y'
            Vector zero
  
! 
! _SPU--`config/spu/spu.h'_
! 
!     `a'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is treated as a 64 bit value.
  
!     `c'
            An immediate for and/xor/or instructions.  const_int is
            treated as a 64 bit value.
  
!     `d'
!           An immediate for the `iohl' instruction.  const_int is
!           treated as a 64 bit value.
  
!     `f'
!           An immediate which can be loaded with `fsmbi'.
  
!     `A'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is treated as a 32 bit value.
  
!     `B'
            An immediate for most arithmetic instructions.  const_int is
            treated as a 32 bit value.
  
!     `C'
            An immediate for and/xor/or instructions.  const_int is
            treated as a 32 bit value.
  
!     `D'
!           An immediate for the `iohl' instruction.  const_int is
!           treated as a 32 bit value.
  
!     `I'
            A constant in the range [-64, 63] for shift/rotate
            instructions.
  
!     `J'
            An unsigned 7-bit constant for conversion/nop/channel
            instructions.
  
!     `K'
            A signed 10-bit constant for most arithmetic instructions.
  
!     `M'
!           A signed 16 bit immediate for `stop'.
  
!     `N'
!           An unsigned 16-bit constant for `iohl' and `fsmbi'.
  
!     `O'
            An unsigned 7-bit constant whose 3 least significant bits are
            0.
  
!     `P'
            An unsigned 3-bit constant for 16-byte rotates and shifts
  
!     `R'
            Call operand, reg, for indirect calls
  
!     `S'
            Call operand, symbol, for relative calls.
  
!     `T'
            Call operand, const_int, for absolute calls.
  
!     `U'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is sign extended to 128 bit.
  
!     `W'
            An immediate for shift and rotate instructions.  const_int is
            treated as a 32 bit value.
  
!     `Y'
            An immediate for and/xor/or instructions.  const_int is sign
            extended as a 128 bit.
  
!     `Z'
!           An immediate for the `iohl' instruction.  const_int is sign
            extended to 128 bit.
  
! 
! _TI C6X family--`config/c6x/constraints.md'_
! 
!     `a'
            Register file A (A0-A31).
  
!     `b'
            Register file B (B0-B31).
  
!     `A'
            Predicate registers in register file A (A0-A2 on C64X and
            higher, A1 and A2 otherwise).
  
!     `B'
            Predicate registers in register file B (B0-B2).
  
!     `C'
            A call-used register in register file B (B0-B9, B16-B31).
  
!     `Da'
            Register file A, excluding predicate registers (A3-A31, plus
            A0 if not C64X or higher).
  
!     `Db'
            Register file B, excluding predicate registers (B3-B31).
  
!     `Iu4'
            Integer constant in the range 0 ... 15.
  
!     `Iu5'
            Integer constant in the range 0 ... 31.
  
!     `In5'
            Integer constant in the range -31 ... 0.
  
!     `Is5'
            Integer constant in the range -16 ... 15.
  
!     `I5x'
            Integer constant that can be the operand of an ADDA or a SUBA
            insn.
  
!     `IuB'
            Integer constant in the range 0 ... 65535.
  
!     `IsB'
            Integer constant in the range -32768 ... 32767.
  
!     `IsC'
!           Integer constant in the range -2^20 ... 2^20 - 1.
  
!     `Jc'
            Integer constant that is a valid mask for the clr instruction.
  
!     `Js'
            Integer constant that is a valid mask for the set instruction.
  
!     `Q'
            Memory location with A base register.
  
!     `R'
            Memory location with B base register.
  
!     `Z'
            Register B14 (aka DP).
  
! 
! _TILE-Gx--`config/tilegx/constraints.md'_
! 
!     `R00'
!     `R01'
!     `R02'
!     `R03'
!     `R04'
!     `R05'
!     `R06'
!     `R07'
!     `R08'
!     `R09'
!     `R10'
            Each of these represents a register constraint for an
            individual register, from r0 to r10.
  
!     `I'
            Signed 8-bit integer constant.
  
!     `J'
            Signed 16-bit integer constant.
  
!     `K'
            Unsigned 16-bit integer constant.
  
!     `L'
!           Integer constant that fits in one signed byte when
!           incremented by one (-129 ... 126).
  
!     `m'
!           Memory operand.  If used together with `<' or `>', the
!           operand can have postincrement which requires printing with
!           `%In' and `%in' on TILE-Gx.  For example:
  
                 asm ("st_add %I0,%1,%i0" : "=m<>" (*mem) : "r" (val));
  
!     `M'
            A bit mask suitable for the BFINS instruction.
  
!     `N'
            Integer constant that is a byte tiled out eight times.
  
!     `O'
            The integer zero constant.
  
!     `P'
            Integer constant that is a sign-extended byte tiled out as
            four shorts.
  
!     `Q'
            Integer constant that fits in one signed byte when incremented
            (-129 ... 126), but excluding -1.
  
!     `S'
            Integer constant that has all 1 bits consecutive and starting
            at bit 0.
  
!     `T'
            A 16-bit fragment of a got, tls, or pc-relative reference.
  
!     `U'
!           Memory operand except postincrement.  This is roughly the
!           same as `m' when not used together with `<' or `>'.
  
!     `W'
            An 8-element vector constant with identical elements.
  
!     `Y'
            A 4-element vector constant with identical elements.
  
!     `Z0'
            The integer constant 0xffffffff.
  
!     `Z1'
            The integer constant 0xffffffff00000000.
  
! 
! _TILEPro--`config/tilepro/constraints.md'_
! 
!     `R00'
!     `R01'
!     `R02'
!     `R03'
!     `R04'
!     `R05'
!     `R06'
!     `R07'
!     `R08'
!     `R09'
!     `R10'
            Each of these represents a register constraint for an
            individual register, from r0 to r10.
  
!     `I'
            Signed 8-bit integer constant.
  
!     `J'
            Signed 16-bit integer constant.
  
!     `K'
            Nonzero integer constant with low 16 bits zero.
  
!     `L'
!           Integer constant that fits in one signed byte when
!           incremented by one (-129 ... 126).
  
!     `m'
!           Memory operand.  If used together with `<' or `>', the
!           operand can have postincrement which requires printing with
!           `%In' and `%in' on TILEPro.  For example:
  
                 asm ("swadd %I0,%1,%i0" : "=m<>" (mem) : "r" (val));
  
!     `M'
            A bit mask suitable for the MM instruction.
  
!     `N'
            Integer constant that is a byte tiled out four times.
  
!     `O'
            The integer zero constant.
  
!     `P'
!           Integer constant that is a sign-extended byte tiled out as
!           two shorts.
  
!     `Q'
            Integer constant that fits in one signed byte when incremented
            (-129 ... 126), but excluding -1.
  
!     `T'
            A symbolic operand, or a 16-bit fragment of a got, tls, or
            pc-relative reference.
  
!     `U'
!           Memory operand except postincrement.  This is roughly the
!           same as `m' when not used together with `<' or `>'.
  
!     `W'
            A 4-element vector constant with identical elements.
  
!     `Y'
            A 2-element vector constant with identical elements.
  
  
! _Visium--`config/visium/constraints.md'_
! 
!     `b'
!           EAM register `mdb'
! 
!     `c'
!           EAM register `mdc'
  
!     `f'
            Floating point register
  
!     `l'
!           General register, but not `r29', `r30' and `r31'
  
!     `t'
!           Register `r1'
  
!     `u'
!           Register `r2'
  
!     `v'
!           Register `r3'
  
!     `G'
            Floating-point constant 0.0
  
!     `J'
!           Integer constant in the range 0 .. 65535 (16-bit immediate)
  
!     `K'
!           Integer constant in the range 1 .. 31 (5-bit immediate)
  
!     `L'
!           Integer constant in the range -65535 .. -1 (16-bit negative
            immediate)
  
!     `M'
            Integer constant -1
  
!     `O'
            Integer constant 0
  
!     `P'
            Integer constant 32
  
! _x86 family--`config/i386/constraints.md'_
! 
!     `R'
            Legacy register--the eight integer registers available on all
!           i386 processors (`a', `b', `c', `d', `si', `di', `bp', `sp').
  
!     `q'
!           Any register accessible as `Rl'.  In 32-bit mode, `a', `b',
!           `c', and `d'; in 64-bit mode, any integer register.
  
!     `Q'
!           Any register accessible as `Rh': `a', `b', `c', and `d'.
  
!     `a'
!           The `a' register.
  
!     `b'
!           The `b' register.
  
!     `c'
!           The `c' register.
  
!     `d'
!           The `d' register.
  
!     `S'
!           The `si' register.
  
!     `D'
!           The `di' register.
  
!     `A'
!           The `a' and `d' registers.  This class is used for
!           instructions that return double word results in the `ax:dx'
!           register pair.  Single word values will be allocated either
!           in `ax' or `dx'.  For example on i386 the following
!           implements `rdtsc':
  
                 unsigned long long rdtsc (void)
                 {
--- 31148,31846 ----
  
            is not.
  
!      'es'
!           A "stable" memory operand; that is, one which does not include
!           any automodification of the base register.  This used to be
!           useful when 'm' allowed automodification of the base register,
!           but as those are now only allowed when '<' or '>' is used,
!           'es' is basically the same as 'm' without '<' and '>'.
  
!      'Q'
            Memory operand that is an offset from a register (it is
!           usually better to use 'm' or 'es' in 'asm' statements)
  
!      'Z'
            Memory operand that is an indexed or indirect from a register
!           (it is usually better to use 'm' or 'es' in 'asm' statements)
  
!      'R'
            AIX TOC entry
  
!      'a'
!           Address operand that is an indexed or indirect from a register
!           ('p' is preferable for 'asm' statements)
  
!      'S'
            Constant suitable as a 64-bit mask operand
  
!      'T'
            Constant suitable as a 32-bit mask operand
  
!      'U'
            System V Release 4 small data area reference
  
!      't'
            AND masks that can be performed by two rldic{l, r}
            instructions
  
!      'W'
            Vector constant that does not require memory
  
!      'j'
            Vector constant that is all zeros.
  
+ _RL78--'config/rl78/constraints.md'_
  
!      'Int3'
            An integer constant in the range 1 ... 7.
!      'Int8'
            An integer constant in the range 0 ... 255.
!      'J'
            An integer constant in the range -255 ... 0
!      'K'
            The integer constant 1.
!      'L'
            The integer constant -1.
!      'M'
            The integer constant 0.
!      'N'
            The integer constant 2.
!      'O'
            The integer constant -2.
!      'P'
            An integer constant in the range 1 ... 15.
!      'Qbi'
            The built-in compare types-eq, ne, gtu, ltu, geu, and leu.
!      'Qsc'
            The synthetic compare types-gt, lt, ge, and le.
!      'Wab'
            A memory reference with an absolute address.
!      'Wbc'
!           A memory reference using 'BC' as a base register, with an
            optional offset.
!      'Wca'
!           A memory reference using 'AX', 'BC', 'DE', or 'HL' for the
            address, for calls.
!      'Wcv'
            A memory reference using any 16-bit register pair for the
            address, for calls.
!      'Wd2'
!           A memory reference using 'DE' as a base register, with an
            optional offset.
!      'Wde'
!           A memory reference using 'DE' as a base register, without any
            offset.
!      'Wfr'
            Any memory reference to an address in the far address space.
!      'Wh1'
!           A memory reference using 'HL' as a base register, with an
            optional one-byte offset.
!      'Whb'
!           A memory reference using 'HL' as a base register, with 'B' or
!           'C' as the index register.
!      'Whl'
!           A memory reference using 'HL' as a base register, without any
            offset.
!      'Ws1'
!           A memory reference using 'SP' as a base register, with an
            optional one-byte offset.
!      'Y'
            Any memory reference to an address in the near address space.
!      'A'
!           The 'AX' register.
!      'B'
!           The 'BC' register.
!      'D'
!           The 'DE' register.
!      'R'
!           'A' through 'L' registers.
!      'S'
!           The 'SP' register.
!      'T'
!           The 'HL' register.
!      'Z08W'
!           The 16-bit 'R8' register.
!      'Z10W'
!           The 16-bit 'R10' register.
!      'Zint'
!           The registers reserved for interrupts ('R24' to 'R31').
!      'a'
!           The 'A' register.
!      'b'
!           The 'B' register.
!      'c'
!           The 'C' register.
!      'd'
!           The 'D' register.
!      'e'
!           The 'E' register.
!      'h'
!           The 'H' register.
!      'l'
!           The 'L' register.
!      'v'
            The virtual registers.
+      'w'
+           The 'PSW' register.
+      'x'
+           The 'X' register.
  
! _RX--'config/rx/constraints.md'_
!      'Q'
!           An address which does not involve register indirect addressing
!           or pre/post increment/decrement addressing.
  
!      'Symbol'
            A symbol reference.
  
!      'Int08'
            A constant in the range -256 to 255, inclusive.
  
!      'Sint08'
            A constant in the range -128 to 127, inclusive.
  
!      'Sint16'
            A constant in the range -32768 to 32767, inclusive.
  
!      'Sint24'
            A constant in the range -8388608 to 8388607, inclusive.
  
!      'Uint04'
            A constant in the range 0 to 15, inclusive.
  
! _S/390 and zSeries--'config/s390/s390.h'_
!      'a'
            Address register (general purpose register except r0)
  
!      'c'
            Condition code register
  
!      'd'
            Data register (arbitrary general purpose register)
  
!      'f'
            Floating-point register
  
!      'I'
            Unsigned 8-bit constant (0-255)
  
!      'J'
            Unsigned 12-bit constant (0-4095)
  
!      'K'
            Signed 16-bit constant (-32768-32767)
  
!      'L'
            Value appropriate as displacement.
!           '(0..4095)'
                 for short displacement
!           '(-524288..524287)'
                 for long displacement
  
!      'M'
            Constant integer with a value of 0x7fffffff.
  
!      'N'
            Multiple letter constraint followed by 4 parameter letters.
!           '0..9:'
                 number of the part counting from most to least
                 significant
!           'H,Q:'
                 mode of the part
!           'D,S,H:'
                 mode of the containing operand
!           '0,F:'
                 value of the other parts (F--all bits set)
!           The constraint matches if the specified part of a constant has
!           a value different from its other parts.
  
!      'Q'
            Memory reference without index register and with short
            displacement.
  
!      'R'
            Memory reference with index register and short displacement.
  
!      'S'
            Memory reference without index register but with long
            displacement.
  
!      'T'
            Memory reference with index register and long displacement.
  
!      'U'
            Pointer with short displacement.
  
!      'W'
            Pointer with long displacement.
  
!      'Y'
            Shift count operand.
  
+ _SPARC--'config/sparc/sparc.h'_
+      'f'
+           Floating-point register on the SPARC-V8 architecture and lower
+           floating-point register on the SPARC-V9 architecture.
  
!      'e'
!           Floating-point register.  It is equivalent to 'f' on the
            SPARC-V8 architecture and contains both lower and upper
            floating-point registers on the SPARC-V9 architecture.
  
!      'c'
            Floating-point condition code register.
  
!      'd'
            Lower floating-point register.  It is only valid on the
            SPARC-V9 architecture when the Visual Instruction Set is
            available.
  
!      'b'
            Floating-point register.  It is only valid on the SPARC-V9
            architecture when the Visual Instruction Set is available.
  
!      'h'
            64-bit global or out register for the SPARC-V8+ architecture.
  
!      'C'
            The constant all-ones, for floating-point.
  
!      'A'
            Signed 5-bit constant
  
!      'D'
            A vector constant
  
!      'I'
            Signed 13-bit constant
  
!      'J'
            Zero
  
!      'K'
            32-bit constant with the low 12 bits clear (a constant that
!           can be loaded with the 'sethi' instruction)
  
!      'L'
!           A constant in the range supported by 'movcc' instructions
            (11-bit signed immediate)
  
!      'M'
!           A constant in the range supported by 'movrcc' instructions
            (10-bit signed immediate)
  
!      'N'
!           Same as 'K', except that it verifies that bits that are not in
!           the lower 32-bit range are all zero.  Must be used instead of
!           'K' for modes wider than 'SImode'
  
!      'O'
            The constant 4096
  
!      'G'
            Floating-point zero
  
!      'H'
            Signed 13-bit constant, sign-extended to 32 or 64 bits
  
!      'P'
            The constant -1
  
!      'Q'
            Floating-point constant whose integral representation can be
            moved into an integer register using a single sethi
            instruction
  
!      'R'
            Floating-point constant whose integral representation can be
            moved into an integer register using a single mov instruction
  
!      'S'
            Floating-point constant whose integral representation can be
!           moved into an integer register using a high/lo_sum instruction
!           sequence
  
!      'T'
            Memory address aligned to an 8-byte boundary
  
!      'U'
            Even register
  
!      'W'
!           Memory address for 'e' constraint registers
  
!      'w'
            Memory address with only a base register
  
!      'Y'
            Vector zero
  
! _SPU--'config/spu/spu.h'_
!      'a'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is treated as a 64 bit value.
  
!      'c'
            An immediate for and/xor/or instructions.  const_int is
            treated as a 64 bit value.
  
!      'd'
!           An immediate for the 'iohl' instruction.  const_int is treated
!           as a 64 bit value.
  
!      'f'
!           An immediate which can be loaded with 'fsmbi'.
  
!      'A'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is treated as a 32 bit value.
  
!      'B'
            An immediate for most arithmetic instructions.  const_int is
            treated as a 32 bit value.
  
!      'C'
            An immediate for and/xor/or instructions.  const_int is
            treated as a 32 bit value.
  
!      'D'
!           An immediate for the 'iohl' instruction.  const_int is treated
!           as a 32 bit value.
  
!      'I'
            A constant in the range [-64, 63] for shift/rotate
            instructions.
  
!      'J'
            An unsigned 7-bit constant for conversion/nop/channel
            instructions.
  
!      'K'
            A signed 10-bit constant for most arithmetic instructions.
  
!      'M'
!           A signed 16 bit immediate for 'stop'.
  
!      'N'
!           An unsigned 16-bit constant for 'iohl' and 'fsmbi'.
  
!      'O'
            An unsigned 7-bit constant whose 3 least significant bits are
            0.
  
!      'P'
            An unsigned 3-bit constant for 16-byte rotates and shifts
  
!      'R'
            Call operand, reg, for indirect calls
  
!      'S'
            Call operand, symbol, for relative calls.
  
!      'T'
            Call operand, const_int, for absolute calls.
  
!      'U'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is sign extended to 128 bit.
  
!      'W'
            An immediate for shift and rotate instructions.  const_int is
            treated as a 32 bit value.
  
!      'Y'
            An immediate for and/xor/or instructions.  const_int is sign
            extended as a 128 bit.
  
!      'Z'
!           An immediate for the 'iohl' instruction.  const_int is sign
            extended to 128 bit.
  
! _TI C6X family--'config/c6x/constraints.md'_
!      'a'
            Register file A (A0-A31).
  
!      'b'
            Register file B (B0-B31).
  
!      'A'
            Predicate registers in register file A (A0-A2 on C64X and
            higher, A1 and A2 otherwise).
  
!      'B'
            Predicate registers in register file B (B0-B2).
  
!      'C'
            A call-used register in register file B (B0-B9, B16-B31).
  
!      'Da'
            Register file A, excluding predicate registers (A3-A31, plus
            A0 if not C64X or higher).
  
!      'Db'
            Register file B, excluding predicate registers (B3-B31).
  
!      'Iu4'
            Integer constant in the range 0 ... 15.
  
!      'Iu5'
            Integer constant in the range 0 ... 31.
  
!      'In5'
            Integer constant in the range -31 ... 0.
  
!      'Is5'
            Integer constant in the range -16 ... 15.
  
!      'I5x'
            Integer constant that can be the operand of an ADDA or a SUBA
            insn.
  
!      'IuB'
            Integer constant in the range 0 ... 65535.
  
!      'IsB'
            Integer constant in the range -32768 ... 32767.
  
!      'IsC'
!           Integer constant in the range -2^{20} ... 2^{20} - 1.
  
!      'Jc'
            Integer constant that is a valid mask for the clr instruction.
  
!      'Js'
            Integer constant that is a valid mask for the set instruction.
  
!      'Q'
            Memory location with A base register.
  
!      'R'
            Memory location with B base register.
  
!      'Z'
            Register B14 (aka DP).
  
! _TILE-Gx--'config/tilegx/constraints.md'_
!      'R00'
!      'R01'
!      'R02'
!      'R03'
!      'R04'
!      'R05'
!      'R06'
!      'R07'
!      'R08'
!      'R09'
!      'R10'
            Each of these represents a register constraint for an
            individual register, from r0 to r10.
  
!      'I'
            Signed 8-bit integer constant.
  
!      'J'
            Signed 16-bit integer constant.
  
!      'K'
            Unsigned 16-bit integer constant.
  
!      'L'
!           Integer constant that fits in one signed byte when incremented
!           by one (-129 ... 126).
  
!      'm'
!           Memory operand.  If used together with '<' or '>', the operand
!           can have postincrement which requires printing with '%In' and
!           '%in' on TILE-Gx.  For example:
  
                 asm ("st_add %I0,%1,%i0" : "=m<>" (*mem) : "r" (val));
  
!      'M'
            A bit mask suitable for the BFINS instruction.
  
!      'N'
            Integer constant that is a byte tiled out eight times.
  
!      'O'
            The integer zero constant.
  
!      'P'
            Integer constant that is a sign-extended byte tiled out as
            four shorts.
  
!      'Q'
            Integer constant that fits in one signed byte when incremented
            (-129 ... 126), but excluding -1.
  
!      'S'
            Integer constant that has all 1 bits consecutive and starting
            at bit 0.
  
!      'T'
            A 16-bit fragment of a got, tls, or pc-relative reference.
  
!      'U'
!           Memory operand except postincrement.  This is roughly the same
!           as 'm' when not used together with '<' or '>'.
  
!      'W'
            An 8-element vector constant with identical elements.
  
!      'Y'
            A 4-element vector constant with identical elements.
  
!      'Z0'
            The integer constant 0xffffffff.
  
!      'Z1'
            The integer constant 0xffffffff00000000.
  
! _TILEPro--'config/tilepro/constraints.md'_
!      'R00'
!      'R01'
!      'R02'
!      'R03'
!      'R04'
!      'R05'
!      'R06'
!      'R07'
!      'R08'
!      'R09'
!      'R10'
            Each of these represents a register constraint for an
            individual register, from r0 to r10.
  
!      'I'
            Signed 8-bit integer constant.
  
!      'J'
            Signed 16-bit integer constant.
  
!      'K'
            Nonzero integer constant with low 16 bits zero.
  
!      'L'
!           Integer constant that fits in one signed byte when incremented
!           by one (-129 ... 126).
  
!      'm'
!           Memory operand.  If used together with '<' or '>', the operand
!           can have postincrement which requires printing with '%In' and
!           '%in' on TILEPro.  For example:
  
                 asm ("swadd %I0,%1,%i0" : "=m<>" (mem) : "r" (val));
  
!      'M'
            A bit mask suitable for the MM instruction.
  
!      'N'
            Integer constant that is a byte tiled out four times.
  
!      'O'
            The integer zero constant.
  
!      'P'
!           Integer constant that is a sign-extended byte tiled out as two
!           shorts.
  
!      'Q'
            Integer constant that fits in one signed byte when incremented
            (-129 ... 126), but excluding -1.
  
!      'T'
            A symbolic operand, or a 16-bit fragment of a got, tls, or
            pc-relative reference.
  
!      'U'
!           Memory operand except postincrement.  This is roughly the same
!           as 'm' when not used together with '<' or '>'.
  
!      'W'
            A 4-element vector constant with identical elements.
  
!      'Y'
            A 2-element vector constant with identical elements.
  
+ _Visium--'config/visium/constraints.md'_
+      'b'
+           EAM register 'mdb'
  
!      'c'
!           EAM register 'mdc'
  
!      'f'
            Floating point register
  
!      'l'
!           General register, but not 'r29', 'r30' and 'r31'
  
!      't'
!           Register 'r1'
  
!      'u'
!           Register 'r2'
  
!      'v'
!           Register 'r3'
  
!      'G'
            Floating-point constant 0.0
  
!      'J'
!           Integer constant in the range 0 ..  65535 (16-bit immediate)
  
!      'K'
!           Integer constant in the range 1 ..  31 (5-bit immediate)
  
!      'L'
!           Integer constant in the range -65535 ..  -1 (16-bit negative
            immediate)
  
!      'M'
            Integer constant -1
  
!      'O'
            Integer constant 0
  
!      'P'
            Integer constant 32
  
! _x86 family--'config/i386/constraints.md'_
!      'R'
            Legacy register--the eight integer registers available on all
!           i386 processors ('a', 'b', 'c', 'd', 'si', 'di', 'bp', 'sp').
  
!      'q'
!           Any register accessible as 'Rl'.  In 32-bit mode, 'a', 'b',
!           'c', and 'd'; in 64-bit mode, any integer register.
  
!      'Q'
!           Any register accessible as 'Rh': 'a', 'b', 'c', and 'd'.
  
!      'a'
!           The 'a' register.
  
!      'b'
!           The 'b' register.
  
!      'c'
!           The 'c' register.
  
!      'd'
!           The 'd' register.
  
!      'S'
!           The 'si' register.
  
!      'D'
!           The 'di' register.
  
!      'A'
!           The 'a' and 'd' registers.  This class is used for
!           instructions that return double word results in the 'ax:dx'
!           register pair.  Single word values will be allocated either in
!           'ax' or 'dx'.  For example on i386 the following implements
!           'rdtsc':
  
                 unsigned long long rdtsc (void)
                 {
*************** _x86 family--`config/i386/constraints.md
*** 32182,32188 ****
                 }
  
            This is not correct on x86-64 as it would allocate tick in
!           either `ax' or `dx'.  You have to use the following variant
            instead:
  
                 unsigned long long rdtsc (void)
--- 31850,31856 ----
                 }
  
            This is not correct on x86-64 as it would allocate tick in
!           either 'ax' or 'dx'.  You have to use the following variant
            instead:
  
                 unsigned long long rdtsc (void)
*************** _x86 family--`config/i386/constraints.md
*** 32192,32346 ****
                   return ((unsigned long long)tickh << 32)|tickl;
                 }
  
!     `f'
            Any 80387 floating-point (stack) register.
  
!     `t'
!           Top of 80387 floating-point stack (`%st(0)').
  
!     `u'
!           Second from top of 80387 floating-point stack (`%st(1)').
  
!     `y'
            Any MMX register.
  
!     `x'
            Any SSE register.
  
!     `Yz'
!           First SSE register (`%xmm0').
  
!     `I'
            Integer constant in the range 0 ... 31, for 32-bit shifts.
  
!     `J'
            Integer constant in the range 0 ... 63, for 64-bit shifts.
  
!     `K'
            Signed 8-bit integer constant.
  
!     `L'
!           `0xFF' or `0xFFFF', for andsi as a zero-extending move.
  
!     `M'
!           0, 1, 2, or 3 (shifts for the `lea' instruction).
  
!     `N'
!           Unsigned 8-bit integer constant (for `in' and `out'
            instructions).
  
!     `G'
            Standard 80387 floating point constant.
  
!     `C'
            SSE constant zero operand.
  
!     `e'
            32-bit signed integer constant, or a symbolic reference known
            to fit that range (for immediate operands in sign-extending
            x86-64 instructions).
  
!     `Z'
            32-bit unsigned integer constant, or a symbolic reference
            known to fit that range (for immediate operands in
            zero-extending x86-64 instructions).
  
! 
! _Xstormy16--`config/stormy16/stormy16.h'_
! 
!     `a'
            Register r0.
  
!     `b'
            Register r1.
  
!     `c'
            Register r2.
  
!     `d'
            Register r8.
  
!     `e'
            Registers r0 through r7.
  
!     `t'
            Registers r0 and r1.
  
!     `y'
            The carry register.
  
!     `z'
            Registers r8 and r9.
  
!     `I'
            A constant between 0 and 3 inclusive.
  
!     `J'
            A constant that has exactly one bit set.
  
!     `K'
            A constant that has exactly one bit clear.
  
!     `L'
            A constant between 0 and 255 inclusive.
  
!     `M'
            A constant between -255 and 0 inclusive.
  
!     `N'
            A constant between -3 and 0 inclusive.
  
!     `O'
            A constant between 1 and 4 inclusive.
  
!     `P'
            A constant between -4 and -1 inclusive.
  
!     `Q'
            A memory reference that is a stack push.
  
!     `R'
            A memory reference that is a stack pop.
  
!     `S'
            A memory reference that refers to a constant address of known
            value.
  
!     `T'
            The register indicated by Rx (not implemented yet).
  
!     `U'
            A constant that is not between 2 and 15 inclusive.
  
!     `Z'
            The constant 0.
  
! 
! _Xtensa--`config/xtensa/constraints.md'_
! 
!     `a'
            General-purpose 32-bit register
  
!     `b'
            One-bit boolean register
  
!     `A'
            MAC16 40-bit accumulator register
  
!     `I'
            Signed 12-bit integer constant, for use in MOVI instructions
  
!     `J'
            Signed 8-bit integer constant, for use in ADDI instructions
  
!     `K'
            Integer constant valid for BccI instructions
  
!     `L'
            Unsigned constant valid for BccUI instructions
  
- 
- 
  
  File: gcc.info,  Node: Asm Labels,  Next: Explicit Reg Vars,  Prev: Constraints,  Up: Using Assembly Language with C
  
--- 31860,32008 ----
                   return ((unsigned long long)tickh << 32)|tickl;
                 }
  
!      'f'
            Any 80387 floating-point (stack) register.
  
!      't'
!           Top of 80387 floating-point stack ('%st(0)').
  
!      'u'
!           Second from top of 80387 floating-point stack ('%st(1)').
  
!      'y'
            Any MMX register.
  
!      'x'
            Any SSE register.
  
!      'Yz'
!           First SSE register ('%xmm0').
  
!      'I'
            Integer constant in the range 0 ... 31, for 32-bit shifts.
  
!      'J'
            Integer constant in the range 0 ... 63, for 64-bit shifts.
  
!      'K'
            Signed 8-bit integer constant.
  
!      'L'
!           '0xFF' or '0xFFFF', for andsi as a zero-extending move.
  
!      'M'
!           0, 1, 2, or 3 (shifts for the 'lea' instruction).
  
!      'N'
!           Unsigned 8-bit integer constant (for 'in' and 'out'
            instructions).
  
!      'G'
            Standard 80387 floating point constant.
  
!      'C'
            SSE constant zero operand.
  
!      'e'
            32-bit signed integer constant, or a symbolic reference known
            to fit that range (for immediate operands in sign-extending
            x86-64 instructions).
  
!      'Z'
            32-bit unsigned integer constant, or a symbolic reference
            known to fit that range (for immediate operands in
            zero-extending x86-64 instructions).
  
! _Xstormy16--'config/stormy16/stormy16.h'_
!      'a'
            Register r0.
  
!      'b'
            Register r1.
  
!      'c'
            Register r2.
  
!      'd'
            Register r8.
  
!      'e'
            Registers r0 through r7.
  
!      't'
            Registers r0 and r1.
  
!      'y'
            The carry register.
  
!      'z'
            Registers r8 and r9.
  
!      'I'
            A constant between 0 and 3 inclusive.
  
!      'J'
            A constant that has exactly one bit set.
  
!      'K'
            A constant that has exactly one bit clear.
  
!      'L'
            A constant between 0 and 255 inclusive.
  
!      'M'
            A constant between -255 and 0 inclusive.
  
!      'N'
            A constant between -3 and 0 inclusive.
  
!      'O'
            A constant between 1 and 4 inclusive.
  
!      'P'
            A constant between -4 and -1 inclusive.
  
!      'Q'
            A memory reference that is a stack push.
  
!      'R'
            A memory reference that is a stack pop.
  
!      'S'
            A memory reference that refers to a constant address of known
            value.
  
!      'T'
            The register indicated by Rx (not implemented yet).
  
!      'U'
            A constant that is not between 2 and 15 inclusive.
  
!      'Z'
            The constant 0.
  
! _Xtensa--'config/xtensa/constraints.md'_
!      'a'
            General-purpose 32-bit register
  
!      'b'
            One-bit boolean register
  
!      'A'
            MAC16 40-bit accumulator register
  
!      'I'
            Signed 12-bit integer constant, for use in MOVI instructions
  
!      'J'
            Signed 8-bit integer constant, for use in ADDI instructions
  
!      'K'
            Integer constant valid for BccI instructions
  
!      'L'
            Unsigned constant valid for BccUI instructions
  
  
  File: gcc.info,  Node: Asm Labels,  Next: Explicit Reg Vars,  Prev: Constraints,  Up: Using Assembly Language with C
  
*************** File: gcc.info,  Node: Asm Labels,  Next
*** 32348,32360 ****
  -----------------------------------------------
  
  You can specify the name to be used in the assembler code for a C
! function or variable by writing the `asm' (or `__asm__') keyword after
  the declarator as follows:
  
       int foo asm ("myfoo") = 2;
  
! This specifies that the name to be used for the variable `foo' in the
! assembler code should be `myfoo' rather than the usual `_foo'.
  
   On systems where an underscore is normally prepended to the name of a C
  function or variable, this feature allows you to define names for the
--- 32010,32022 ----
  -----------------------------------------------
  
  You can specify the name to be used in the assembler code for a C
! function or variable by writing the 'asm' (or '__asm__') keyword after
  the declarator as follows:
  
       int foo asm ("myfoo") = 2;
  
! This specifies that the name to be used for the variable 'foo' in the
! assembler code should be 'myfoo' rather than the usual '_foo'.
  
   On systems where an underscore is normally prepended to the name of a C
  function or variable, this feature allows you to define names for the
*************** Reg Vars::.  GCC presently accepts such
*** 32367,32375 ****
  probably be changed to issue an error, rather than a warning, in the
  future.
  
!  You cannot use `asm' in this way in a function _definition_; but you
! can get the same effect by writing a declaration for the function
! before its definition and putting `asm' there, like this:
  
       extern func () asm ("FUNC");
  
--- 32029,32037 ----
  probably be changed to issue an error, rather than a warning, in the
  future.
  
!  You cannot use 'asm' in this way in a function _definition_; but you
! can get the same effect by writing a declaration for the function before
! its definition and putting 'asm' there, like this:
  
       extern func () asm ("FUNC");
  
*************** register variable should be allocated.
*** 32400,32419 ****
  
     * Local register variables in specific registers do not reserve the
       registers, except at the point where they are used as input or
!      output operands in an `asm' statement and the `asm' statement
       itself is not deleted.  The compiler's data flow analysis is
       capable of determining where the specified registers contain live
       values, and where they are available for other uses.  Stores into
!      local register variables may be deleted when they appear to be
!      dead according to dataflow analysis.  References to local register
       variables may be deleted or moved or simplified.
  
       These local variables are sometimes convenient for use with the
!      extended `asm' feature (*note Extended Asm::), if you want to
!      write one output of the assembler instruction directly into a
!      particular register.  (This works provided the register you
!      specify fits the constraints specified for that operand in the
!      `asm'.)
  
  * Menu:
  
--- 32062,32080 ----
  
     * Local register variables in specific registers do not reserve the
       registers, except at the point where they are used as input or
!      output operands in an 'asm' statement and the 'asm' statement
       itself is not deleted.  The compiler's data flow analysis is
       capable of determining where the specified registers contain live
       values, and where they are available for other uses.  Stores into
!      local register variables may be deleted when they appear to be dead
!      according to dataflow analysis.  References to local register
       variables may be deleted or moved or simplified.
  
       These local variables are sometimes convenient for use with the
!      extended 'asm' feature (*note Extended Asm::), if you want to write
!      one output of the assembler instruction directly into a particular
!      register.  (This works provided the register you specify fits the
!      constraints specified for that operand in the 'asm'.)
  
  * Menu:
  
*************** You can define a global register variabl
*** 32430,32448 ****
  
       register int *foo asm ("a5");
  
! Here `a5' is the name of the register that should be used.  Choose a
  register that is normally saved and restored by function calls on your
  machine, so that library routines will not clobber it.
  
   Naturally the register name is CPU-dependent, so you need to
! conditionalize your program according to CPU type.  The register `a5'
! is a good choice on a 68000 for a variable of pointer type.  On
! machines with register windows, be sure to choose a "global" register
! that is not affected magically by the function call mechanism.
  
   In addition, different operating systems on the same CPU may differ in
  how they name the registers; then you need additional conditionals.  For
! example, some 68000 operating systems call this register `%a5'.
  
   Eventually there may be a way of asking the compiler to choose a
  register automatically, but first we need to figure out how it should
--- 32091,32109 ----
  
       register int *foo asm ("a5");
  
! Here 'a5' is the name of the register that should be used.  Choose a
  register that is normally saved and restored by function calls on your
  machine, so that library routines will not clobber it.
  
   Naturally the register name is CPU-dependent, so you need to
! conditionalize your program according to CPU type.  The register 'a5' is
! a good choice on a 68000 for a variable of pointer type.  On machines
! with register windows, be sure to choose a "global" register that is not
! affected magically by the function call mechanism.
  
   In addition, different operating systems on the same CPU may differ in
  how they name the registers; then you need additional conditionals.  For
! example, some 68000 operating systems call this register '%a5'.
  
   Eventually there may be a way of asking the compiler to choose a
  register automatically, but first we need to figure out how it should
*************** library routines may temporarily use the
*** 32462,32481 ****
  (unless you recompile them specially for the task at hand).
  
   It is not safe for one function that uses a global register variable to
! call another such function `foo' by way of a third function `lose' that
  is compiled without knowledge of this variable (i.e. in a different
  source file in which the variable isn't declared).  This is because
! `lose' might save the register and put some other value there.  For
  example, you can't expect a global register variable to be available in
! the comparison-function that you pass to `qsort', since `qsort' might
  have put something else in that register.  (If you are prepared to
! recompile `qsort' with the same global register variable, you can solve
  this problem.)
  
!  If you want to recompile `qsort' or other source files that do not
  actually use your global register variable, so that they do not use that
  register for any other purpose, then it suffices to specify the compiler
! option `-ffixed-REG'.  You need not actually add a global register
  declaration to their source code.
  
   A function that can alter the value of a global register variable
--- 32123,32142 ----
  (unless you recompile them specially for the task at hand).
  
   It is not safe for one function that uses a global register variable to
! call another such function 'foo' by way of a third function 'lose' that
  is compiled without knowledge of this variable (i.e. in a different
  source file in which the variable isn't declared).  This is because
! 'lose' might save the register and put some other value there.  For
  example, you can't expect a global register variable to be available in
! the comparison-function that you pass to 'qsort', since 'qsort' might
  have put something else in that register.  (If you are prepared to
! recompile 'qsort' with the same global register variable, you can solve
  this problem.)
  
!  If you want to recompile 'qsort' or other source files that do not
  actually use your global register variable, so that they do not use that
  register for any other purpose, then it suffices to specify the compiler
! option '-ffixed-REG'.  You need not actually add a global register
  declaration to their source code.
  
   A function that can alter the value of a global register variable
*************** return.  Therefore, the function that is
*** 32485,32497 ****
  of the program that uses the global register variable must explicitly
  save and restore the value that belongs to its caller.
  
!  On most machines, `longjmp' restores to each global register variable
! the value it had at the time of the `setjmp'.  On some machines,
! however, `longjmp' does not change the value of global register
! variables.  To be portable, the function that called `setjmp' should
  make other arrangements to save the values of the global register
! variables, and to restore them in a `longjmp'.  This way, the same
! thing happens regardless of what `longjmp' does.
  
   All global register variable declarations must precede all function
  definitions.  If such a declaration could appear after function
--- 32146,32158 ----
  of the program that uses the global register variable must explicitly
  save and restore the value that belongs to its caller.
  
!  On most machines, 'longjmp' restores to each global register variable
! the value it had at the time of the 'setjmp'.  On some machines,
! however, 'longjmp' does not change the value of global register
! variables.  To be portable, the function that called 'setjmp' should
  make other arrangements to save the values of the global register
! variables, and to restore them in a 'longjmp'.  This way, the same thing
! happens regardless of what 'longjmp' does.
  
   All global register variable declarations must precede all function
  definitions.  If such a declaration could appear after function
*************** from being used for other purposes in th
*** 32502,32510 ****
  executable file has no means to supply initial contents for a register.
  
   On the SPARC, there are reports that g3 ... g7 are suitable registers,
! but certain library functions, such as `getwd', as well as the
! subroutines for division and remainder, modify g3 and g4.  g1 and g2
! are local temporaries.
  
   On the 68000, a2 ... a5 should be suitable, as should d2 ... d7.  Of
  course, it does not do to use more than a few of those.
--- 32163,32171 ----
  executable file has no means to supply initial contents for a register.
  
   On the SPARC, there are reports that g3 ... g7 are suitable registers,
! but certain library functions, such as 'getwd', as well as the
! subroutines for division and remainder, modify g3 and g4.  g1 and g2 are
! local temporaries.
  
   On the 68000, a2 ... a5 should be suitable, as should d2 ... d7.  Of
  course, it does not do to use more than a few of those.
*************** this:
*** 32520,32528 ****
  
       register int *foo asm ("a5");
  
! Here `a5' is the name of the register that should be used.  Note that
! this is the same syntax used for defining global register variables,
! but for a local variable it appears within a function.
  
   Naturally the register name is CPU-dependent, but this is not a
  problem, since specific registers are most often useful with explicit
--- 32181,32189 ----
  
       register int *foo asm ("a5");
  
! Here 'a5' is the name of the register that should be used.  Note that
! this is the same syntax used for defining global register variables, but
! for a local variable it appears within a function.
  
   Naturally the register name is CPU-dependent, but this is not a
  problem, since specific registers are most often useful with explicit
*************** type.
*** 32532,32538 ****
  
   In addition, operating systems on one type of CPU may differ in how
  they name the registers; then you need additional conditionals.  For
! example, some 68000 operating systems call this register `%a5'.
  
   Defining such a register variable does not reserve the register; it
  remains available for other uses in places where flow control determines
--- 32193,32199 ----
  
   In addition, operating systems on one type of CPU may differ in how
  they name the registers; then you need additional conditionals.  For
! example, some 68000 operating systems call this register '%a5'.
  
   Defining such a register variable does not reserve the register; it
  remains available for other uses in places where flow control determines
*************** the variable's value is not live.
*** 32541,32563 ****
   This option does not guarantee that GCC generates code that has this
  variable in the register you specify at all times.  You may not code an
  explicit reference to this register in the assembler instruction
! template part of an `asm' statement and assume it always refers to this
  variable.  However, using the variable as an input or output operand to
! the `asm' guarantees that the specified register is used for that
  operand.  *Note Extended Asm::, for more information.
  
!  Stores into local register variables may be deleted when they appear
! to be dead according to dataflow analysis.  References to local
! register variables may be deleted or moved or simplified.
  
   As with global register variables, it is recommended that you choose a
  register that is normally saved and restored by function calls on your
  machine, so that library routines will not clobber it.
  
!  Sometimes when writing inline `asm' code, you need to make an operand
  be a specific register, but there's no matching constraint letter for
! that register. To force the operand into that register, create a local
! variable and specify the register in the variable's declaration. Then
  use the local variable for the asm operand and specify any constraint
  letter that matches the register:
  
--- 32202,32224 ----
   This option does not guarantee that GCC generates code that has this
  variable in the register you specify at all times.  You may not code an
  explicit reference to this register in the assembler instruction
! template part of an 'asm' statement and assume it always refers to this
  variable.  However, using the variable as an input or output operand to
! the 'asm' guarantees that the specified register is used for that
  operand.  *Note Extended Asm::, for more information.
  
!  Stores into local register variables may be deleted when they appear to
! be dead according to dataflow analysis.  References to local register
! variables may be deleted or moved or simplified.
  
   As with global register variables, it is recommended that you choose a
  register that is normally saved and restored by function calls on your
  machine, so that library routines will not clobber it.
  
!  Sometimes when writing inline 'asm' code, you need to make an operand
  be a specific register, but there's no matching constraint letter for
! that register.  To force the operand into that register, create a local
! variable and specify the register in the variable's declaration.  Then
  use the local variable for the asm operand and specify any constraint
  letter that matches the register:
  
*************** letter that matches the register:
*** 32569,32575 ****
   _Warning:_ In the above example, be aware that a register (for example
  r0) can be call-clobbered by subsequent code, including function calls
  and library calls for arithmetic operators on other variables (for
! example the initialization of p2). In this case, use temporary
  variables for expressions between the register assignments:
  
       int t1 = ...;
--- 32230,32236 ----
   _Warning:_ In the above example, be aware that a register (for example
  r0) can be call-clobbered by subsequent code, including function calls
  and library calls for arithmetic operators on other variables (for
! example the initialization of p2).  In this case, use temporary
  variables for expressions between the register assignments:
  
       int t1 = ...;
*************** variables for expressions between the re
*** 32581,32599 ****
  
  File: gcc.info,  Node: Size of an asm,  Prev: Explicit Reg Vars,  Up: Using Assembly Language with C
  
! 6.43.6 Size of an `asm'
  -----------------------
  
! Some targets require that GCC track the size of each instruction used
! in order to generate correct code.  Because the final length of the
! code produced by an `asm' statement is only known by the assembler, GCC
! must make an estimate as to how big it will be.  It does this by
! counting the number of instructions in the pattern of the `asm' and
! multiplying that by the length of the longest instruction supported by
! that processor.  (When working out the number of instructions, it
! assumes that any occurrence of a newline or of whatever statement
! separator character is supported by the assembler - typically `;' --
! indicates the end of an instruction.)
  
   Normally, GCC's estimate is adequate to ensure that correct code is
  generated, but it is possible to confuse the compiler if you use pseudo
--- 32242,32260 ----
  
  File: gcc.info,  Node: Size of an asm,  Prev: Explicit Reg Vars,  Up: Using Assembly Language with C
  
! 6.43.6 Size of an 'asm'
  -----------------------
  
! Some targets require that GCC track the size of each instruction used in
! order to generate correct code.  Because the final length of the code
! produced by an 'asm' statement is only known by the assembler, GCC must
! make an estimate as to how big it will be.  It does this by counting the
! number of instructions in the pattern of the 'asm' and multiplying that
! by the length of the longest instruction supported by that processor.
! (When working out the number of instructions, it assumes that any
! occurrence of a newline or of whatever statement separator character is
! supported by the assembler - typically ';' -- indicates the end of an
! instruction.)
  
   Normally, GCC's estimate is adequate to ensure that correct code is
  generated, but it is possible to confuse the compiler if you use pseudo
*************** File: gcc.info,  Node: Alternate Keyword
*** 32609,32628 ****
  6.44 Alternate Keywords
  =======================
  
! `-ansi' and the various `-std' options disable certain keywords.  This
  causes trouble when you want to use GNU C extensions, or a
  general-purpose header file that should be usable by all programs,
! including ISO C programs.  The keywords `asm', `typeof' and `inline'
! are not available in programs compiled with `-ansi' or `-std' (although
! `inline' can be used in a program compiled with `-std=c99' or
! `-std=c11').  The ISO C99 keyword `restrict' is only available when
! `-std=gnu99' (which will eventually be the default) or `-std=c99' (or
! the equivalent `-std=iso9899:1999'), or an option for a later standard
  version, is used.
  
!  The way to solve these problems is to put `__' at the beginning and
! end of each problematical keyword.  For example, use `__asm__' instead
! of `asm', and `__inline__' instead of `inline'.
  
   Other C compilers won't accept these alternative keywords; if you want
  to compile with another compiler, you can define the alternate keywords
--- 32270,32289 ----
  6.44 Alternate Keywords
  =======================
  
! '-ansi' and the various '-std' options disable certain keywords.  This
  causes trouble when you want to use GNU C extensions, or a
  general-purpose header file that should be usable by all programs,
! including ISO C programs.  The keywords 'asm', 'typeof' and 'inline' are
! not available in programs compiled with '-ansi' or '-std' (although
! 'inline' can be used in a program compiled with '-std=c99' or
! '-std=c11').  The ISO C99 keyword 'restrict' is only available when
! '-std=gnu99' (which will eventually be the default) or '-std=c99' (or
! the equivalent '-std=iso9899:1999'), or an option for a later standard
  version, is used.
  
!  The way to solve these problems is to put '__' at the beginning and end
! of each problematical keyword.  For example, use '__asm__' instead of
! 'asm', and '__inline__' instead of 'inline'.
  
   Other C compilers won't accept these alternative keywords; if you want
  to compile with another compiler, you can define the alternate keywords
*************** this:
*** 32633,32659 ****
       #define __asm__ asm
       #endif
  
!  `-pedantic' and other options cause warnings for many GNU C extensions.
  You can prevent such warnings within one expression by writing
! `__extension__' before the expression.  `__extension__' has no effect
  aside from this.
  
  
  File: gcc.info,  Node: Incomplete Enums,  Next: Function Names,  Prev: Alternate Keywords,  Up: C Extensions
  
! 6.45 Incomplete `enum' Types
  ============================
  
! You can define an `enum' tag without specifying its possible values.
  This results in an incomplete type, much like what you get if you write
! `struct foo' without describing the elements.  A later declaration that
  does specify the possible values completes the type.
  
   You can't allocate variables or storage using the type while it is
  incomplete.  However, you can work with pointers to that type.
  
   This extension may not be very useful, but it makes the handling of
! `enum' more consistent with the way `struct' and `union' are handled.
  
   This extension is not supported by GNU C++.
  
--- 32294,32320 ----
       #define __asm__ asm
       #endif
  
!  '-pedantic' and other options cause warnings for many GNU C extensions.
  You can prevent such warnings within one expression by writing
! '__extension__' before the expression.  '__extension__' has no effect
  aside from this.
  
  
  File: gcc.info,  Node: Incomplete Enums,  Next: Function Names,  Prev: Alternate Keywords,  Up: C Extensions
  
! 6.45 Incomplete 'enum' Types
  ============================
  
! You can define an 'enum' tag without specifying its possible values.
  This results in an incomplete type, much like what you get if you write
! 'struct foo' without describing the elements.  A later declaration that
  does specify the possible values completes the type.
  
   You can't allocate variables or storage using the type while it is
  incomplete.  However, you can work with pointers to that type.
  
   This extension may not be very useful, but it makes the handling of
! 'enum' more consistent with the way 'struct' and 'union' are handled.
  
   This extension is not supported by GNU C++.
  
*************** File: gcc.info,  Node: Function Names,
*** 32664,32686 ****
  ==============================
  
  GCC provides three magic variables that hold the name of the current
! function, as a string.  The first of these is `__func__', which is part
  of the C99 standard:
  
!  The identifier `__func__' is implicitly declared by the translator as
! if, immediately following the opening brace of each function
! definition, the declaration
  
       static const char __func__[] = "function-name";
  
  appeared, where function-name is the name of the lexically-enclosing
  function.  This name is the unadorned name of the function.
  
!  `__FUNCTION__' is another name for `__func__', provided for backward
  compatibility with old versions of GCC.
  
!  In C, `__PRETTY_FUNCTION__' is yet another name for `__func__'.
! However, in C++, `__PRETTY_FUNCTION__' contains the type signature of
  the function as well as its bare name.  For example, this program:
  
       extern "C" {
--- 32325,32347 ----
  ==============================
  
  GCC provides three magic variables that hold the name of the current
! function, as a string.  The first of these is '__func__', which is part
  of the C99 standard:
  
!  The identifier '__func__' is implicitly declared by the translator as
! if, immediately following the opening brace of each function definition,
! the declaration
  
       static const char __func__[] = "function-name";
  
  appeared, where function-name is the name of the lexically-enclosing
  function.  This name is the unadorned name of the function.
  
!  '__FUNCTION__' is another name for '__func__', provided for backward
  compatibility with old versions of GCC.
  
!  In C, '__PRETTY_FUNCTION__' is yet another name for '__func__'.
! However, in C++, '__PRETTY_FUNCTION__' contains the type signature of
  the function as well as its bare name.  For example, this program:
  
       extern "C" {
*************** gives this output:
*** 32710,32716 ****
       __PRETTY_FUNCTION__ = void a::sub(int)
  
   These identifiers are variables, not preprocessor macros, and may not
! be used to initialize `char' arrays or be concatenated with other string
  literals.
  
  
--- 32371,32377 ----
       __PRETTY_FUNCTION__ = void a::sub(int)
  
   These identifiers are variables, not preprocessor macros, and may not
! be used to initialize 'char' arrays or be concatenated with other string
  literals.
  
  
*************** function.
*** 32726,32772 ****
            LEVEL)
       This function returns the return address of the current function,
       or of one of its callers.  The LEVEL argument is number of frames
!      to scan up the call stack.  A value of `0' yields the return
!      address of the current function, a value of `1' yields the return
       address of the caller of the current function, and so forth.  When
       inlining the expected behavior is that the function returns the
       address of the function that is returned to.  To work around this
!      behavior use the `noinline' function attribute.
  
       The LEVEL argument must be a constant integer.
  
       On some machines it may be impossible to determine the return
       address of any function other than the current one; in such cases,
       or when the top of the stack has been reached, this function
!      returns `0' or a random value.  In addition,
!      `__builtin_frame_address' may be used to determine if the top of
       the stack has been reached.
  
       Additional post-processing of the returned value may be needed, see
!      `__builtin_extract_return_addr'.
  
       This function should only be used with a nonzero argument for
       debugging purposes.
  
   -- Built-in Function: void * __builtin_extract_return_addr (void *ADDR)
!      The address as returned by `__builtin_return_address' may have to
       be fed through this function to get the actual encoded address.
!      For example, on the 31-bit S/390 platform the highest bit has to
!      be masked out, or on SPARC platforms an offset has to be added for
!      the true next instruction to be executed.
  
       If no fixup is needed, this function simply passes through ADDR.
  
   -- Built-in Function: void * __builtin_frob_return_address (void *ADDR)
!      This function does the reverse of `__builtin_extract_return_addr'.
  
   -- Built-in Function: void * __builtin_frame_address (unsigned int
            LEVEL)
!      This function is similar to `__builtin_return_address', but it
       returns the address of the function frame rather than the return
!      address of the function.  Calling `__builtin_frame_address' with a
!      value of `0' yields the frame address of the current function, a
!      value of `1' yields the frame address of the caller of the current
       function, and so forth.
  
       The frame is the area on the stack that holds local variables and
--- 32387,32433 ----
            LEVEL)
       This function returns the return address of the current function,
       or of one of its callers.  The LEVEL argument is number of frames
!      to scan up the call stack.  A value of '0' yields the return
!      address of the current function, a value of '1' yields the return
       address of the caller of the current function, and so forth.  When
       inlining the expected behavior is that the function returns the
       address of the function that is returned to.  To work around this
!      behavior use the 'noinline' function attribute.
  
       The LEVEL argument must be a constant integer.
  
       On some machines it may be impossible to determine the return
       address of any function other than the current one; in such cases,
       or when the top of the stack has been reached, this function
!      returns '0' or a random value.  In addition,
!      '__builtin_frame_address' may be used to determine if the top of
       the stack has been reached.
  
       Additional post-processing of the returned value may be needed, see
!      '__builtin_extract_return_addr'.
  
       This function should only be used with a nonzero argument for
       debugging purposes.
  
   -- Built-in Function: void * __builtin_extract_return_addr (void *ADDR)
!      The address as returned by '__builtin_return_address' may have to
       be fed through this function to get the actual encoded address.
!      For example, on the 31-bit S/390 platform the highest bit has to be
!      masked out, or on SPARC platforms an offset has to be added for the
!      true next instruction to be executed.
  
       If no fixup is needed, this function simply passes through ADDR.
  
   -- Built-in Function: void * __builtin_frob_return_address (void *ADDR)
!      This function does the reverse of '__builtin_extract_return_addr'.
  
   -- Built-in Function: void * __builtin_frame_address (unsigned int
            LEVEL)
!      This function is similar to '__builtin_return_address', but it
       returns the address of the function frame rather than the return
!      address of the function.  Calling '__builtin_frame_address' with a
!      value of '0' yields the frame address of the current function, a
!      value of '1' yields the frame address of the caller of the current
       function, and so forth.
  
       The frame is the area on the stack that holds local variables and
*************** function.
*** 32775,32787 ****
       exact definition depends upon the processor and the calling
       convention.  If the processor has a dedicated frame pointer
       register, and the function has a frame, then
!      `__builtin_frame_address' returns the value of the frame pointer
       register.
  
       On some machines it may be impossible to determine the frame
       address of any function other than the current one; in such cases,
       or when the top of the stack has been reached, this function
!      returns `0' if the first frame pointer is properly initialized by
       the startup code.
  
       This function should only be used with a nonzero argument for
--- 32436,32448 ----
       exact definition depends upon the processor and the calling
       convention.  If the processor has a dedicated frame pointer
       register, and the function has a frame, then
!      '__builtin_frame_address' returns the value of the frame pointer
       register.
  
       On some machines it may be impossible to determine the frame
       address of any function other than the current one; in such cases,
       or when the top of the stack has been reached, this function
!      returns '0' if the first frame pointer is properly initialized by
       the startup code.
  
       This function should only be used with a nonzero argument for
*************** same time.  For example, on the x86 the
*** 32799,32838 ****
  can be used this way.
  
   The first step in using these extensions is to provide the necessary
! data types.  This should be done using an appropriate `typedef':
  
       typedef int v4si __attribute__ ((vector_size (16)));
  
! The `int' type specifies the base type, while the attribute specifies
  the vector size for the variable, measured in bytes.  For example, the
! declaration above causes the compiler to set the mode for the `v4si'
! type to be 16 bytes wide and divided into `int' sized units.  For a
! 32-bit `int' this means a vector of 4 units of 4 bytes, and the
! corresponding mode of `foo' is V4SI.
  
!  The `vector_size' attribute is only applicable to integral and float
  scalars, although arrays, pointers, and function return values are
! allowed in conjunction with this construct. Only sizes that are a power
  of two are currently allowed.
  
   All the basic integer types can be used as base types, both as signed
! and as unsigned: `char', `short', `int', `long', `long long'.  In
! addition, `float' and `double' can be used to build floating-point
  vector types.
  
   Specifying a combination that is not valid for the current architecture
  causes GCC to synthesize the instructions using a narrower mode.  For
! example, if you specify a variable of type `V4SI' and your architecture
  does not allow for this specific SIMD type, GCC produces code that uses
! 4 `SIs'.
  
   The types defined in this manner can be used with a subset of normal C
  operations.  Currently, GCC allows using the following operators on
! these types: `+, -, *, /, unary minus, ^, |, &, ~, %'.
  
!  The operations behave like C++ `valarrays'.  Addition is defined as
! the addition of the corresponding elements of the operands.  For
! example, in the code below, each of the 4 elements in A is added to the
  corresponding 4 elements in B and the resulting vector is stored in C.
  
       typedef int v4si __attribute__ ((vector_size (16)));
--- 32460,32499 ----
  can be used this way.
  
   The first step in using these extensions is to provide the necessary
! data types.  This should be done using an appropriate 'typedef':
  
       typedef int v4si __attribute__ ((vector_size (16)));
  
! The 'int' type specifies the base type, while the attribute specifies
  the vector size for the variable, measured in bytes.  For example, the
! declaration above causes the compiler to set the mode for the 'v4si'
! type to be 16 bytes wide and divided into 'int' sized units.  For a
! 32-bit 'int' this means a vector of 4 units of 4 bytes, and the
! corresponding mode of 'foo' is V4SI.
  
!  The 'vector_size' attribute is only applicable to integral and float
  scalars, although arrays, pointers, and function return values are
! allowed in conjunction with this construct.  Only sizes that are a power
  of two are currently allowed.
  
   All the basic integer types can be used as base types, both as signed
! and as unsigned: 'char', 'short', 'int', 'long', 'long long'.  In
! addition, 'float' and 'double' can be used to build floating-point
  vector types.
  
   Specifying a combination that is not valid for the current architecture
  causes GCC to synthesize the instructions using a narrower mode.  For
! example, if you specify a variable of type 'V4SI' and your architecture
  does not allow for this specific SIMD type, GCC produces code that uses
! 4 'SIs'.
  
   The types defined in this manner can be used with a subset of normal C
  operations.  Currently, GCC allows using the following operators on
! these types: '+, -, *, /, unary minus, ^, |, &, ~, %'.
  
!  The operations behave like C++ 'valarrays'.  Addition is defined as the
! addition of the corresponding elements of the operands.  For example, in
! the code below, each of the 4 elements in A is added to the
  corresponding 4 elements in B and the resulting vector is stored in C.
  
       typedef int v4si __attribute__ ((vector_size (16)));
*************** minus or complement operators on a vecto
*** 32847,32861 ****
  elements are the negative or complemented values of the corresponding
  elements in the operand.
  
!  It is possible to use shifting operators `<<', `>>' on integer-type
! vectors. The operation is defined as following: `{a0, a1, ..., an} >>
! {b0, b1, ..., bn} == {a0 >> b0, a1 >> b1, ..., an >> bn}'. Vector
  operands must have the same number of elements.
  
   For convenience, it is allowed to use a binary vector operation where
! one operand is a scalar. In that case the compiler transforms the
  scalar operand into a vector where each element is the scalar from the
! operation. The transformation happens only if the scalar could be
  safely converted to the vector-element type.  Consider the following
  code.
  
--- 32508,32522 ----
  elements are the negative or complemented values of the corresponding
  elements in the operand.
  
!  It is possible to use shifting operators '<<', '>>' on integer-type
! vectors.  The operation is defined as following: '{a0, a1, ..., an} >>
! {b0, b1, ..., bn} == {a0 >> b0, a1 >> b1, ..., an >> bn}'.  Vector
  operands must have the same number of elements.
  
   For convenience, it is allowed to use a binary vector operation where
! one operand is a scalar.  In that case the compiler transforms the
  scalar operand into a vector where each element is the scalar from the
! operation.  The transformation happens only if the scalar could be
  safely converted to the vector-element type.  Consider the following
  code.
  
*************** code.
*** 32869,32889 ****
  
       a = l + a;    /* Error, cannot convert long to int. */
  
!  Vectors can be subscripted as if the vector were an array with the
! same number of elements and base type.  Out of bound accesses invoke
  undefined behavior at run time.  Warnings for out of bound accesses for
! vector subscription can be enabled with `-Warray-bounds'.
  
!  Vector comparison is supported with standard comparison operators:
! `==, !=, <, <=, >, >='. Comparison operands can be vector expressions
! of integer-type or real-type. Comparison between integer-type vectors
! and real-type vectors are not supported.  The result of the comparison
! is a vector of the same width and number of elements as the comparison
  operands with a signed integral element type.
  
   Vectors are compared element-wise producing 0 when comparison is false
  and -1 (constant of the appropriate type where all bits are set)
! otherwise. Consider the following example.
  
       typedef int v4si __attribute__ ((vector_size (16)));
  
--- 32530,32550 ----
  
       a = l + a;    /* Error, cannot convert long to int. */
  
!  Vectors can be subscripted as if the vector were an array with the same
! number of elements and base type.  Out of bound accesses invoke
  undefined behavior at run time.  Warnings for out of bound accesses for
! vector subscription can be enabled with '-Warray-bounds'.
  
!  Vector comparison is supported with standard comparison operators: '==,
! !=, <, <=, >, >='.  Comparison operands can be vector expressions of
! integer-type or real-type.  Comparison between integer-type vectors and
! real-type vectors are not supported.  The result of the comparison is a
! vector of the same width and number of elements as the comparison
  operands with a signed integral element type.
  
   Vectors are compared element-wise producing 0 when comparison is false
  and -1 (constant of the appropriate type where all bits are set)
! otherwise.  Consider the following example.
  
       typedef int v4si __attribute__ ((vector_size (16)));
  
*************** otherwise. Consider the following exampl
*** 32894,32924 ****
       c = a >  b;     /* The result would be {0, 0,-1, 0}  */
       c = a == b;     /* The result would be {0,-1, 0,-1}  */
  
!  In C++, the ternary operator `?:' is available. `a?b:c', where `b' and
! `c' are vectors of the same type and `a' is an integer vector with the
! same number of elements of the same size as `b' and `c', computes all
! three arguments and creates a vector `{a[0]?b[0]:c[0], a[1]?b[1]:c[1],
! ...}'.  Note that unlike in OpenCL, `a' is thus interpreted as `a != 0'
! and not `a < 0'.  As in the case of binary operations, this syntax is
! also accepted when one of `b' or `c' is a scalar that is then
! transformed into a vector. If both `b' and `c' are scalars and the type
! of `true?b:c' has the same size as the element type of `a', then `b'
! and `c' are converted to a vector type whose elements have this type
! and with the same number of elements as `a'.
  
!  In C++, the logic operators `!, &&, ||' are available for vectors.
! `!v' is equivalent to `v == 0', `a && b' is equivalent to `a!=0 & b!=0'
! and `a || b' is equivalent to `a!=0 | b!=0'.  For mixed operations
! between a scalar `s' and a vector `v', `s && v' is equivalent to
! `s?v!=0:0' (the evaluation is short-circuit) and `v && s' is equivalent
! to `v!=0 & (s?-1:0)'.
  
!  Vector shuffling is available using functions `__builtin_shuffle (vec,
! mask)' and `__builtin_shuffle (vec0, vec1, mask)'.  Both functions
! construct a permutation of elements from one or two vectors and return
! a vector of the same type as the input vector(s).  The MASK is an
! integral vector with the same width (W) and element count (N) as the
! output vector.
  
   The elements of the input vectors are numbered in memory ordering of
  VEC0 beginning at 0 and VEC1 beginning at N.  The elements of MASK are
--- 32555,32585 ----
       c = a >  b;     /* The result would be {0, 0,-1, 0}  */
       c = a == b;     /* The result would be {0,-1, 0,-1}  */
  
!  In C++, the ternary operator '?:' is available.  'a?b:c', where 'b' and
! 'c' are vectors of the same type and 'a' is an integer vector with the
! same number of elements of the same size as 'b' and 'c', computes all
! three arguments and creates a vector '{a[0]?b[0]:c[0], a[1]?b[1]:c[1],
! ...}'.  Note that unlike in OpenCL, 'a' is thus interpreted as 'a != 0'
! and not 'a < 0'.  As in the case of binary operations, this syntax is
! also accepted when one of 'b' or 'c' is a scalar that is then
! transformed into a vector.  If both 'b' and 'c' are scalars and the type
! of 'true?b:c' has the same size as the element type of 'a', then 'b' and
! 'c' are converted to a vector type whose elements have this type and
! with the same number of elements as 'a'.
  
!  In C++, the logic operators '!, &&, ||' are available for vectors.
! '!v' is equivalent to 'v == 0', 'a && b' is equivalent to 'a!=0 & b!=0'
! and 'a || b' is equivalent to 'a!=0 | b!=0'.  For mixed operations
! between a scalar 's' and a vector 'v', 's && v' is equivalent to
! 's?v!=0:0' (the evaluation is short-circuit) and 'v && s' is equivalent
! to 'v!=0 & (s?-1:0)'.
  
!  Vector shuffling is available using functions '__builtin_shuffle (vec,
! mask)' and '__builtin_shuffle (vec0, vec1, mask)'.  Both functions
! construct a permutation of elements from one or two vectors and return a
! vector of the same type as the input vector(s).  The MASK is an integral
! vector with the same width (W) and element count (N) as the output
! vector.
  
   The elements of the input vectors are numbered in memory ordering of
  VEC0 beginning at 0 and VEC1 beginning at N.  The elements of MASK are
*************** two-operand case.
*** 32938,32949 ****
       res = __builtin_shuffle (a, mask1);       /* res is {1,2,2,4}  */
       res = __builtin_shuffle (a, b, mask2);    /* res is {1,5,3,6}  */
  
!  Note that `__builtin_shuffle' is intentionally semantically compatible
! with the OpenCL `shuffle' and `shuffle2' functions.
  
   You can declare variables and use them in function calls and returns,
! as well as in assignments and some casts.  You can specify a vector
! type as a return type for a function.  Vector types can also be used as
  function arguments.  It is possible to cast from one vector type to
  another, provided they are of the same size (in fact, you can also cast
  vectors to and from other datatypes of the same size).
--- 32599,32610 ----
       res = __builtin_shuffle (a, mask1);       /* res is {1,2,2,4}  */
       res = __builtin_shuffle (a, b, mask2);    /* res is {1,5,3,6}  */
  
!  Note that '__builtin_shuffle' is intentionally semantically compatible
! with the OpenCL 'shuffle' and 'shuffle2' functions.
  
   You can declare variables and use them in function calls and returns,
! as well as in assignments and some casts.  You can specify a vector type
! as a return type for a function.  Vector types can also be used as
  function arguments.  It is possible to cast from one vector type to
  another, provided they are of the same size (in fact, you can also cast
  vectors to and from other datatypes of the same size).
*************** signedness without a cast.
*** 32954,33003 ****
  
  File: gcc.info,  Node: Offsetof,  Next: __sync Builtins,  Prev: Vector Extensions,  Up: C Extensions
  
! 6.49 Support for `offsetof'
  ===========================
  
! GCC implements for both C and C++ a syntactic extension to implement
! the `offsetof' macro.
  
       primary:
!              "__builtin_offsetof" "(" `typename' "," offsetof_member_designator ")"
  
       offsetof_member_designator:
!                `identifier'
!              | offsetof_member_designator "." `identifier'
!              | offsetof_member_designator "[" `expr' "]"
  
   This extension is sufficient such that
  
       #define offsetof(TYPE, MEMBER)  __builtin_offsetof (TYPE, MEMBER)
  
! is a suitable definition of the `offsetof' macro.  In C++, TYPE may be
  dependent.  In either case, MEMBER may consist of a single identifier,
  or a sequence of member accesses and array references.
  
  
  File: gcc.info,  Node: __sync Builtins,  Next: __atomic Builtins,  Prev: Offsetof,  Up: C Extensions
  
! 6.50 Legacy `__sync' Built-in Functions for Atomic Memory Access
  ================================================================
  
  The following built-in functions are intended to be compatible with
! those described in the `Intel Itanium Processor-specific Application
  Binary Interface', section 7.4.  As such, they depart from the normal
! GCC practice of using the `__builtin_' prefix, and further that they
! are overloaded such that they work on multiple types.
  
!  The definition given in the Intel documentation allows only for the
! use of the types `int', `long', `long long' as well as their unsigned
! counterparts.  GCC allows any integral scalar or pointer type that is
! 1, 2, 4 or 8 bytes in length.
  
   Not all operations are supported by all target processors.  If a
  particular operation cannot be implemented on the target processor, a
  warning is generated and a call to an external function is generated.
  The external function carries the same name as the built-in version,
! with an additional suffix `_N' where N is the size of the data type.
  
   In most cases, these built-in functions are considered a "full
  barrier".  That is, no memory operand is moved across the operation,
--- 32615,32664 ----
  
  File: gcc.info,  Node: Offsetof,  Next: __sync Builtins,  Prev: Vector Extensions,  Up: C Extensions
  
! 6.49 Support for 'offsetof'
  ===========================
  
! GCC implements for both C and C++ a syntactic extension to implement the
! 'offsetof' macro.
  
       primary:
!              "__builtin_offsetof" "(" typename "," offsetof_member_designator ")"
  
       offsetof_member_designator:
!                identifier
!              | offsetof_member_designator "." identifier
!              | offsetof_member_designator "[" expr "]"
  
   This extension is sufficient such that
  
       #define offsetof(TYPE, MEMBER)  __builtin_offsetof (TYPE, MEMBER)
  
! is a suitable definition of the 'offsetof' macro.  In C++, TYPE may be
  dependent.  In either case, MEMBER may consist of a single identifier,
  or a sequence of member accesses and array references.
  
  
  File: gcc.info,  Node: __sync Builtins,  Next: __atomic Builtins,  Prev: Offsetof,  Up: C Extensions
  
! 6.50 Legacy '__sync' Built-in Functions for Atomic Memory Access
  ================================================================
  
  The following built-in functions are intended to be compatible with
! those described in the 'Intel Itanium Processor-specific Application
  Binary Interface', section 7.4.  As such, they depart from the normal
! GCC practice of using the '__builtin_' prefix, and further that they are
! overloaded such that they work on multiple types.
  
!  The definition given in the Intel documentation allows only for the use
! of the types 'int', 'long', 'long long' as well as their unsigned
! counterparts.  GCC allows any integral scalar or pointer type that is 1,
! 2, 4 or 8 bytes in length.
  
   Not all operations are supported by all target processors.  If a
  particular operation cannot be implemented on the target processor, a
  warning is generated and a call to an external function is generated.
  The external function carries the same name as the built-in version,
! with an additional suffix '_N' where N is the size of the data type.
  
   In most cases, these built-in functions are considered a "full
  barrier".  That is, no memory operand is moved across the operation,
*************** operation and from queuing stores after
*** 33007,33025 ****
  
   All of the routines are described in the Intel documentation to take
  "an optional list of variables protected by the memory barrier".  It's
! not clear what is meant by that; it could mean that _only_ the
! following variables are protected, or it could mean that these variables
! should in addition be protected.  At present GCC ignores this list and
! protects all variables that are globally accessible.  If in the future
! we make some use of this list, an empty list will continue to mean all
! globally accessible variables.
  
! `TYPE __sync_fetch_and_add (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_fetch_and_sub (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_fetch_and_or (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_fetch_and_and (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_fetch_and_xor (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_fetch_and_nand (TYPE *ptr, TYPE value, ...)'
       These built-in functions perform the operation suggested by the
       name, and returns the value that had previously been in memory.
       That is,
--- 32668,32686 ----
  
   All of the routines are described in the Intel documentation to take
  "an optional list of variables protected by the memory barrier".  It's
! not clear what is meant by that; it could mean that _only_ the following
! variables are protected, or it could mean that these variables should in
! addition be protected.  At present GCC ignores this list and protects
! all variables that are globally accessible.  If in the future we make
! some use of this list, an empty list will continue to mean all globally
! accessible variables.
  
! 'TYPE __sync_fetch_and_add (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_fetch_and_sub (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_fetch_and_or (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_fetch_and_and (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_fetch_and_xor (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_fetch_and_nand (TYPE *ptr, TYPE value, ...)'
       These built-in functions perform the operation suggested by the
       name, and returns the value that had previously been in memory.
       That is,
*************** globally accessible variables.
*** 33027,33074 ****
            { tmp = *ptr; *ptr OP= value; return tmp; }
            { tmp = *ptr; *ptr = ~(tmp & value); return tmp; }   // nand
  
!      _Note:_ GCC 4.4 and later implement `__sync_fetch_and_nand' as
!      `*ptr = ~(tmp & value)' instead of `*ptr = ~tmp & value'.
  
! `TYPE __sync_add_and_fetch (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_sub_and_fetch (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_or_and_fetch (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_and_and_fetch (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_xor_and_fetch (TYPE *ptr, TYPE value, ...)'
! `TYPE __sync_nand_and_fetch (TYPE *ptr, TYPE value, ...)'
       These built-in functions perform the operation suggested by the
       name, and return the new value.  That is,
  
            { *ptr OP= value; return *ptr; }
            { *ptr = ~(*ptr & value); return *ptr; }   // nand
  
!      _Note:_ GCC 4.4 and later implement `__sync_nand_and_fetch' as
!      `*ptr = ~(*ptr & value)' instead of `*ptr = ~*ptr & value'.
  
! `bool __sync_bool_compare_and_swap (TYPE *ptr, TYPE oldval, TYPE newval, ...)'
! `TYPE __sync_val_compare_and_swap (TYPE *ptr, TYPE oldval, TYPE newval, ...)'
       These built-in functions perform an atomic compare and swap.  That
!      is, if the current value of `*PTR' is OLDVAL, then write NEWVAL
!      into `*PTR'.
  
       The "bool" version returns true if the comparison is successful and
       NEWVAL is written.  The "val" version returns the contents of
!      `*PTR' before the operation.
  
! `__sync_synchronize (...)'
       This built-in function issues a full memory barrier.
  
! `TYPE __sync_lock_test_and_set (TYPE *ptr, TYPE value, ...)'
!      This built-in function, as described by Intel, is not a
!      traditional test-and-set operation, but rather an atomic exchange
!      operation.  It writes VALUE into `*PTR', and returns the previous
!      contents of `*PTR'.
  
       Many targets have only minimal support for such locks, and do not
       support a full exchange operation.  In this case, a target may
       support reduced functionality here by which the _only_ valid value
       to store is the immediate constant 1.  The exact value actually
!      stored in `*PTR' is implementation defined.
  
       This built-in function is not a full barrier, but rather an
       "acquire barrier".  This means that references after the operation
--- 32688,32735 ----
            { tmp = *ptr; *ptr OP= value; return tmp; }
            { tmp = *ptr; *ptr = ~(tmp & value); return tmp; }   // nand
  
!      _Note:_ GCC 4.4 and later implement '__sync_fetch_and_nand' as
!      '*ptr = ~(tmp & value)' instead of '*ptr = ~tmp & value'.
  
! 'TYPE __sync_add_and_fetch (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_sub_and_fetch (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_or_and_fetch (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_and_and_fetch (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_xor_and_fetch (TYPE *ptr, TYPE value, ...)'
! 'TYPE __sync_nand_and_fetch (TYPE *ptr, TYPE value, ...)'
       These built-in functions perform the operation suggested by the
       name, and return the new value.  That is,
  
            { *ptr OP= value; return *ptr; }
            { *ptr = ~(*ptr & value); return *ptr; }   // nand
  
!      _Note:_ GCC 4.4 and later implement '__sync_nand_and_fetch' as
!      '*ptr = ~(*ptr & value)' instead of '*ptr = ~*ptr & value'.
  
! 'bool __sync_bool_compare_and_swap (TYPE *ptr, TYPE oldval, TYPE newval, ...)'
! 'TYPE __sync_val_compare_and_swap (TYPE *ptr, TYPE oldval, TYPE newval, ...)'
       These built-in functions perform an atomic compare and swap.  That
!      is, if the current value of '*PTR' is OLDVAL, then write NEWVAL
!      into '*PTR'.
  
       The "bool" version returns true if the comparison is successful and
       NEWVAL is written.  The "val" version returns the contents of
!      '*PTR' before the operation.
  
! '__sync_synchronize (...)'
       This built-in function issues a full memory barrier.
  
! 'TYPE __sync_lock_test_and_set (TYPE *ptr, TYPE value, ...)'
!      This built-in function, as described by Intel, is not a traditional
!      test-and-set operation, but rather an atomic exchange operation.
!      It writes VALUE into '*PTR', and returns the previous contents of
!      '*PTR'.
  
       Many targets have only minimal support for such locks, and do not
       support a full exchange operation.  In this case, a target may
       support reduced functionality here by which the _only_ valid value
       to store is the immediate constant 1.  The exact value actually
!      stored in '*PTR' is implementation defined.
  
       This built-in function is not a full barrier, but rather an
       "acquire barrier".  This means that references after the operation
*************** globally accessible variables.
*** 33076,33091 ****
       previous memory stores may not be globally visible yet, and
       previous memory loads may not yet be satisfied.
  
! `void __sync_lock_release (TYPE *ptr, ...)'
       This built-in function releases the lock acquired by
!      `__sync_lock_test_and_set'.  Normally this means writing the
!      constant 0 to `*PTR'.
  
!      This built-in function is not a full barrier, but rather a
!      "release barrier".  This means that all previous memory stores are
!      globally visible, and all previous memory loads have been
!      satisfied, but following memory reads are not prevented from being
!      speculated to before the barrier.
  
  
  File: gcc.info,  Node: __atomic Builtins,  Next: Integer Overflow Builtins,  Prev: __sync Builtins,  Up: C Extensions
--- 32737,32752 ----
       previous memory stores may not be globally visible yet, and
       previous memory loads may not yet be satisfied.
  
! 'void __sync_lock_release (TYPE *ptr, ...)'
       This built-in function releases the lock acquired by
!      '__sync_lock_test_and_set'.  Normally this means writing the
!      constant 0 to '*PTR'.
  
!      This built-in function is not a full barrier, but rather a "release
!      barrier".  This means that all previous memory stores are globally
!      visible, and all previous memory loads have been satisfied, but
!      following memory reads are not prevented from being speculated to
!      before the barrier.
  
  
  File: gcc.info,  Node: __atomic Builtins,  Next: Integer Overflow Builtins,  Prev: __sync Builtins,  Up: C Extensions
*************** File: gcc.info,  Node: __atomic Builtins
*** 33094,33111 ****
  ================================================================
  
  The following built-in functions approximately match the requirements
! for C++11 memory model. Many are similar to the `__sync' prefixed
  built-in functions, but all also have a memory model parameter.  These
! are all identified by being prefixed with `__atomic', and most are
  overloaded such that they work with multiple types.
  
   GCC allows any integral scalar or pointer type that is 1, 2, 4, or 8
! bytes in length. 16-byte integral types are also allowed if `__int128'
  (*note __int128::) is supported by the architecture.
  
   Target architectures are encouraged to provide their own patterns for
  each of these built-in functions.  If no target is provided, the
! original non-memory model set of `__sync' atomic built-in functions are
  utilized, along with any required synchronization fences surrounding it
  in order to achieve the proper behavior.  Execution in this case is
  subject to the same restrictions as those built-in functions.
--- 32755,32772 ----
  ================================================================
  
  The following built-in functions approximately match the requirements
! for C++11 memory model.  Many are similar to the '__sync' prefixed
  built-in functions, but all also have a memory model parameter.  These
! are all identified by being prefixed with '__atomic', and most are
  overloaded such that they work with multiple types.
  
   GCC allows any integral scalar or pointer type that is 1, 2, 4, or 8
! bytes in length.  16-byte integral types are also allowed if '__int128'
  (*note __int128::) is supported by the architecture.
  
   Target architectures are encouraged to provide their own patterns for
  each of these built-in functions.  If no target is provided, the
! original non-memory model set of '__sync' atomic built-in functions are
  utilized, along with any required synchronization fences surrounding it
  in order to achieve the proper behavior.  Execution in this case is
  subject to the same restrictions as those built-in functions.
*************** to be resolved at run time.
*** 33118,33172 ****
  compare_exchange) all have a generic version as well.  This generic
  version works on any data type.  If the data type size maps to one of
  the integral sizes that may have lock free support, the generic version
! utilizes the lock free built-in function.  Otherwise an external call
! is left to be resolved at run time.  This external call is the same
! format with the addition of a `size_t' parameter inserted as the first
  parameter indicating the size of the object being pointed to.  All
  objects must be the same size.
  
   There are 6 different memory models that can be specified.  These map
! to the same names in the C++11 standard.  Refer there or to the GCC
! wiki on atomic synchronization
  (http://gcc.gnu.org/wiki/Atomic/GCCMM/AtomicSync) for more detailed
! definitions.  These memory models integrate both barriers to code
! motion as well as synchronization requirements with other threads.
! These are listed in approximately ascending order of strength. It is
! also possible to use target specific flags for memory model flags, like
  Hardware Lock Elision.
  
! `__ATOMIC_RELAXED'
       No barriers or synchronization.
! 
! `__ATOMIC_CONSUME'
       Data dependency only for both barrier and synchronization with
       another thread.
! 
! `__ATOMIC_ACQUIRE'
       Barrier to hoisting of code and synchronizes with release (or
       stronger) semantic stores from another thread.
! 
! `__ATOMIC_RELEASE'
       Barrier to sinking of code and synchronizes with acquire (or
       stronger) semantic loads from another thread.
! 
! `__ATOMIC_ACQ_REL'
!      Full barrier in both directions and synchronizes with acquire
!      loads and release stores in another thread.
! 
! `__ATOMIC_SEQ_CST'
!      Full barrier in both directions and synchronizes with acquire
!      loads and release stores in all threads.
  
   When implementing patterns for these built-in functions, the memory
  model parameter can be ignored as long as the pattern implements the
! most restrictive `__ATOMIC_SEQ_CST' model.  Any of the other memory
! models execute correctly with this memory model but they may not
! execute as efficiently as they could with a more appropriate
! implementation of the relaxed requirements.
  
   Note that the C++11 standard allows for the memory model parameter to
  be determined at run time rather than at compile time.  These built-in
! functions map any run-time value to `__ATOMIC_SEQ_CST' rather than
  invoke a runtime library call or inline a switch statement.  This is
  standard compliant, safe, and the simplest approach for now.
  
--- 32779,32828 ----
  compare_exchange) all have a generic version as well.  This generic
  version works on any data type.  If the data type size maps to one of
  the integral sizes that may have lock free support, the generic version
! utilizes the lock free built-in function.  Otherwise an external call is
! left to be resolved at run time.  This external call is the same format
! with the addition of a 'size_t' parameter inserted as the first
  parameter indicating the size of the object being pointed to.  All
  objects must be the same size.
  
   There are 6 different memory models that can be specified.  These map
! to the same names in the C++11 standard.  Refer there or to the GCC wiki
! on atomic synchronization
  (http://gcc.gnu.org/wiki/Atomic/GCCMM/AtomicSync) for more detailed
! definitions.  These memory models integrate both barriers to code motion
! as well as synchronization requirements with other threads.  These are
! listed in approximately ascending order of strength.  It is also
! possible to use target specific flags for memory model flags, like
  Hardware Lock Elision.
  
! '__ATOMIC_RELAXED'
       No barriers or synchronization.
! '__ATOMIC_CONSUME'
       Data dependency only for both barrier and synchronization with
       another thread.
! '__ATOMIC_ACQUIRE'
       Barrier to hoisting of code and synchronizes with release (or
       stronger) semantic stores from another thread.
! '__ATOMIC_RELEASE'
       Barrier to sinking of code and synchronizes with acquire (or
       stronger) semantic loads from another thread.
! '__ATOMIC_ACQ_REL'
!      Full barrier in both directions and synchronizes with acquire loads
!      and release stores in another thread.
! '__ATOMIC_SEQ_CST'
!      Full barrier in both directions and synchronizes with acquire loads
!      and release stores in all threads.
  
   When implementing patterns for these built-in functions, the memory
  model parameter can be ignored as long as the pattern implements the
! most restrictive '__ATOMIC_SEQ_CST' model.  Any of the other memory
! models execute correctly with this memory model but they may not execute
! as efficiently as they could with a more appropriate implementation of
! the relaxed requirements.
  
   Note that the C++11 standard allows for the memory model parameter to
  be determined at run time rather than at compile time.  These built-in
! functions map any run-time value to '__ATOMIC_SEQ_CST' rather than
  invoke a runtime library call or inline a switch statement.  This is
  standard compliant, safe, and the simplest approach for now.
  
*************** values ensures proper usage.
*** 33177,33339 ****
  
   -- Built-in Function: TYPE __atomic_load_n (TYPE *ptr, int memmodel)
       This built-in function implements an atomic load operation.  It
!      returns the contents of `*PTR'.
! 
!      The valid memory model variants are `__ATOMIC_RELAXED',
!      `__ATOMIC_SEQ_CST', `__ATOMIC_ACQUIRE', and `__ATOMIC_CONSUME'.
  
  
   -- Built-in Function: void __atomic_load (TYPE *ptr, TYPE *ret, int
            memmodel)
       This is the generic version of an atomic load.  It returns the
!      contents of `*PTR' in `*RET'.
! 
  
   -- Built-in Function: void __atomic_store_n (TYPE *ptr, TYPE val, int
            memmodel)
       This built-in function implements an atomic store operation.  It
!      writes `VAL' into `*PTR'.
! 
!      The valid memory model variants are `__ATOMIC_RELAXED',
!      `__ATOMIC_SEQ_CST', and `__ATOMIC_RELEASE'.
  
  
   -- Built-in Function: void __atomic_store (TYPE *ptr, TYPE *val, int
            memmodel)
       This is the generic version of an atomic store.  It stores the
!      value of `*VAL' into `*PTR'.
! 
  
   -- Built-in Function: TYPE __atomic_exchange_n (TYPE *ptr, TYPE val,
            int memmodel)
!      This built-in function implements an atomic exchange operation.
!      It writes VAL into `*PTR', and returns the previous contents of
!      `*PTR'.
! 
!      The valid memory model variants are `__ATOMIC_RELAXED',
!      `__ATOMIC_SEQ_CST', `__ATOMIC_ACQUIRE', `__ATOMIC_RELEASE', and
!      `__ATOMIC_ACQ_REL'.
  
  
   -- Built-in Function: void __atomic_exchange (TYPE *ptr, TYPE *val,
            TYPE *ret, int memmodel)
       This is the generic version of an atomic exchange.  It stores the
!      contents of `*VAL' into `*PTR'. The original value of `*PTR' is
!      copied into `*RET'.
! 
  
!  -- Built-in Function: bool __atomic_compare_exchange_n (TYPE *ptr,
!           TYPE *expected, TYPE desired, bool weak, int
!           success_memmodel, int failure_memmodel)
       This built-in function implements an atomic compare and exchange
!      operation.  This compares the contents of `*PTR' with the contents
!      of `*EXPECTED' and if equal, writes DESIRED into `*PTR'.  If they
!      are not equal, the current contents of `*PTR' is written into
!      `*EXPECTED'.  WEAK is true for weak compare_exchange, and false
!      for the strong variation.  Many targets only offer the strong
!      variation and ignore the parameter.  When in doubt, use the strong
!      variation.
  
!      True is returned if DESIRED is written into `*PTR' and the
!      execution is considered to conform to the memory model specified
!      by SUCCESS_MEMMODEL.  There are no restrictions on what memory
!      model can be used here.
  
       False is returned otherwise, and the execution is considered to
!      conform to FAILURE_MEMMODEL. This memory model cannot be
!      `__ATOMIC_RELEASE' nor `__ATOMIC_ACQ_REL'.  It also cannot be a
       stronger model than that specified by SUCCESS_MEMMODEL.
  
- 
   -- Built-in Function: bool __atomic_compare_exchange (TYPE *ptr, TYPE
!           *expected, TYPE *desired, bool weak, int success_memmodel,
!           int failure_memmodel)
       This built-in function implements the generic version of
!      `__atomic_compare_exchange'.  The function is virtually identical
!      to `__atomic_compare_exchange_n', except the desired value is also
       a pointer.
  
! 
!  -- Built-in Function: TYPE __atomic_add_fetch (TYPE *ptr, TYPE val,
!           int memmodel)
!  -- Built-in Function: TYPE __atomic_sub_fetch (TYPE *ptr, TYPE val,
!           int memmodel)
!  -- Built-in Function: TYPE __atomic_and_fetch (TYPE *ptr, TYPE val,
!           int memmodel)
!  -- Built-in Function: TYPE __atomic_xor_fetch (TYPE *ptr, TYPE val,
!           int memmodel)
   -- Built-in Function: TYPE __atomic_or_fetch (TYPE *ptr, TYPE val, int
            memmodel)
   -- Built-in Function: TYPE __atomic_nand_fetch (TYPE *ptr, TYPE val,
            int memmodel)
       These built-in functions perform the operation suggested by the
!      name, and return the result of the operation. That is,
  
            { *ptr OP= val; return *ptr; }
  
       All memory models are valid.
  
! 
!  -- Built-in Function: TYPE __atomic_fetch_add (TYPE *ptr, TYPE val,
!           int memmodel)
!  -- Built-in Function: TYPE __atomic_fetch_sub (TYPE *ptr, TYPE val,
!           int memmodel)
!  -- Built-in Function: TYPE __atomic_fetch_and (TYPE *ptr, TYPE val,
!           int memmodel)
!  -- Built-in Function: TYPE __atomic_fetch_xor (TYPE *ptr, TYPE val,
!           int memmodel)
   -- Built-in Function: TYPE __atomic_fetch_or (TYPE *ptr, TYPE val, int
            memmodel)
   -- Built-in Function: TYPE __atomic_fetch_nand (TYPE *ptr, TYPE val,
            int memmodel)
       These built-in functions perform the operation suggested by the
!      name, and return the value that had previously been in `*PTR'.
       That is,
  
            { tmp = *ptr; *ptr OP= val; return tmp; }
  
       All memory models are valid.
  
- 
   -- Built-in Function: bool __atomic_test_and_set (void *ptr, int
            memmodel)
       This built-in function performs an atomic test-and-set operation on
!      the byte at `*PTR'.  The byte is set to some implementation
!      defined nonzero "set" value and the return value is `true' if and
!      only if the previous contents were "set".  It should be only used
!      for operands of type `bool' or `char'. For other types only part
!      of the value may be set.
  
       All memory models are valid.
  
- 
   -- Built-in Function: void __atomic_clear (bool *ptr, int memmodel)
-      This built-in function performs an atomic clear operation on
-      `*PTR'.  After the operation, `*PTR' contains 0.  It should be
-      only used for operands of type `bool' or `char' and in conjunction
-      with `__atomic_test_and_set'.  For other types it may only clear
-      partially. If the type is not `bool' prefer using `__atomic_store'.
  
!      The valid memory model variants are `__ATOMIC_RELAXED',
!      `__ATOMIC_SEQ_CST', and `__ATOMIC_RELEASE'.
  
  
   -- Built-in Function: void __atomic_thread_fence (int memmodel)
       This built-in function acts as a synchronization fence between
       threads based on the specified memory model.
  
       All memory orders are valid.
  
- 
   -- Built-in Function: void __atomic_signal_fence (int memmodel)
       This built-in function acts as a synchronization fence between a
       thread and signal handlers based in the same thread.
  
       All memory orders are valid.
  
  
-  -- Built-in Function: bool __atomic_always_lock_free (size_t size,
-           void *ptr)
       This built-in function returns true if objects of SIZE bytes always
       generate lock free atomic instructions for the target architecture.
       SIZE must resolve to a compile-time constant and the result also
--- 32833,32986 ----
  
   -- Built-in Function: TYPE __atomic_load_n (TYPE *ptr, int memmodel)
       This built-in function implements an atomic load operation.  It
!      returns the contents of '*PTR'.
  
+      The valid memory model variants are '__ATOMIC_RELAXED',
+      '__ATOMIC_SEQ_CST', '__ATOMIC_ACQUIRE', and '__ATOMIC_CONSUME'.
  
   -- Built-in Function: void __atomic_load (TYPE *ptr, TYPE *ret, int
            memmodel)
       This is the generic version of an atomic load.  It returns the
!      contents of '*PTR' in '*RET'.
  
   -- Built-in Function: void __atomic_store_n (TYPE *ptr, TYPE val, int
            memmodel)
       This built-in function implements an atomic store operation.  It
!      writes 'VAL' into '*PTR'.
  
+      The valid memory model variants are '__ATOMIC_RELAXED',
+      '__ATOMIC_SEQ_CST', and '__ATOMIC_RELEASE'.
  
   -- Built-in Function: void __atomic_store (TYPE *ptr, TYPE *val, int
            memmodel)
       This is the generic version of an atomic store.  It stores the
!      value of '*VAL' into '*PTR'.
  
   -- Built-in Function: TYPE __atomic_exchange_n (TYPE *ptr, TYPE val,
            int memmodel)
!      This built-in function implements an atomic exchange operation.  It
!      writes VAL into '*PTR', and returns the previous contents of
!      '*PTR'.
  
+      The valid memory model variants are '__ATOMIC_RELAXED',
+      '__ATOMIC_SEQ_CST', '__ATOMIC_ACQUIRE', '__ATOMIC_RELEASE', and
+      '__ATOMIC_ACQ_REL'.
  
   -- Built-in Function: void __atomic_exchange (TYPE *ptr, TYPE *val,
            TYPE *ret, int memmodel)
       This is the generic version of an atomic exchange.  It stores the
!      contents of '*VAL' into '*PTR'.  The original value of '*PTR' is
!      copied into '*RET'.
  
!  -- Built-in Function: bool __atomic_compare_exchange_n (TYPE *ptr, TYPE
!           *expected, TYPE desired, bool weak, int success_memmodel, int
!           failure_memmodel)
       This built-in function implements an atomic compare and exchange
!      operation.  This compares the contents of '*PTR' with the contents
!      of '*EXPECTED' and if equal, writes DESIRED into '*PTR'.  If they
!      are not equal, the current contents of '*PTR' is written into
!      '*EXPECTED'.  WEAK is true for weak compare_exchange, and false for
!      the strong variation.  Many targets only offer the strong variation
!      and ignore the parameter.  When in doubt, use the strong variation.
  
!      True is returned if DESIRED is written into '*PTR' and the
!      execution is considered to conform to the memory model specified by
!      SUCCESS_MEMMODEL.  There are no restrictions on what memory model
!      can be used here.
  
       False is returned otherwise, and the execution is considered to
!      conform to FAILURE_MEMMODEL.  This memory model cannot be
!      '__ATOMIC_RELEASE' nor '__ATOMIC_ACQ_REL'.  It also cannot be a
       stronger model than that specified by SUCCESS_MEMMODEL.
  
   -- Built-in Function: bool __atomic_compare_exchange (TYPE *ptr, TYPE
!           *expected, TYPE *desired, bool weak, int success_memmodel, int
!           failure_memmodel)
       This built-in function implements the generic version of
!      '__atomic_compare_exchange'.  The function is virtually identical
!      to '__atomic_compare_exchange_n', except the desired value is also
       a pointer.
  
!  -- Built-in Function: TYPE __atomic_add_fetch (TYPE *ptr, TYPE val, int
!           memmodel)
!  -- Built-in Function: TYPE __atomic_sub_fetch (TYPE *ptr, TYPE val, int
!           memmodel)
!  -- Built-in Function: TYPE __atomic_and_fetch (TYPE *ptr, TYPE val, int
!           memmodel)
!  -- Built-in Function: TYPE __atomic_xor_fetch (TYPE *ptr, TYPE val, int
!           memmodel)
   -- Built-in Function: TYPE __atomic_or_fetch (TYPE *ptr, TYPE val, int
            memmodel)
   -- Built-in Function: TYPE __atomic_nand_fetch (TYPE *ptr, TYPE val,
            int memmodel)
       These built-in functions perform the operation suggested by the
!      name, and return the result of the operation.  That is,
  
            { *ptr OP= val; return *ptr; }
  
       All memory models are valid.
  
!  -- Built-in Function: TYPE __atomic_fetch_add (TYPE *ptr, TYPE val, int
!           memmodel)
!  -- Built-in Function: TYPE __atomic_fetch_sub (TYPE *ptr, TYPE val, int
!           memmodel)
!  -- Built-in Function: TYPE __atomic_fetch_and (TYPE *ptr, TYPE val, int
!           memmodel)
!  -- Built-in Function: TYPE __atomic_fetch_xor (TYPE *ptr, TYPE val, int
!           memmodel)
   -- Built-in Function: TYPE __atomic_fetch_or (TYPE *ptr, TYPE val, int
            memmodel)
   -- Built-in Function: TYPE __atomic_fetch_nand (TYPE *ptr, TYPE val,
            int memmodel)
       These built-in functions perform the operation suggested by the
!      name, and return the value that had previously been in '*PTR'.
       That is,
  
            { tmp = *ptr; *ptr OP= val; return tmp; }
  
       All memory models are valid.
  
   -- Built-in Function: bool __atomic_test_and_set (void *ptr, int
            memmodel)
+ 
       This built-in function performs an atomic test-and-set operation on
!      the byte at '*PTR'.  The byte is set to some implementation defined
!      nonzero "set" value and the return value is 'true' if and only if
!      the previous contents were "set".  It should be only used for
!      operands of type 'bool' or 'char'.  For other types only part of
!      the value may be set.
  
       All memory models are valid.
  
   -- Built-in Function: void __atomic_clear (bool *ptr, int memmodel)
  
!      This built-in function performs an atomic clear operation on
!      '*PTR'.  After the operation, '*PTR' contains 0.  It should be only
!      used for operands of type 'bool' or 'char' and in conjunction with
!      '__atomic_test_and_set'.  For other types it may only clear
!      partially.  If the type is not 'bool' prefer using
!      '__atomic_store'.
  
+      The valid memory model variants are '__ATOMIC_RELAXED',
+      '__ATOMIC_SEQ_CST', and '__ATOMIC_RELEASE'.
  
   -- Built-in Function: void __atomic_thread_fence (int memmodel)
+ 
       This built-in function acts as a synchronization fence between
       threads based on the specified memory model.
  
       All memory orders are valid.
  
   -- Built-in Function: void __atomic_signal_fence (int memmodel)
+ 
       This built-in function acts as a synchronization fence between a
       thread and signal handlers based in the same thread.
  
       All memory orders are valid.
  
+  -- Built-in Function: bool __atomic_always_lock_free (size_t size, void
+           *ptr)
  
       This built-in function returns true if objects of SIZE bytes always
       generate lock free atomic instructions for the target architecture.
       SIZE must resolve to a compile-time constant and the result also
*************** values ensures proper usage.
*** 33345,33357 ****
  
            if (_atomic_always_lock_free (sizeof (long long), 0))
  
- 
   -- Built-in Function: bool __atomic_is_lock_free (size_t size, void
            *ptr)
       This built-in function returns true if objects of SIZE bytes always
!      generate lock free atomic instructions for the target
!      architecture.  If it is not known to be lock free a call is made
!      to a runtime routine named `__atomic_is_lock_free'.
  
       PTR is an optional pointer to the object that may be used to
       determine alignment.  A value of 0 indicates typical alignment
--- 32992,33004 ----
  
            if (_atomic_always_lock_free (sizeof (long long), 0))
  
   -- Built-in Function: bool __atomic_is_lock_free (size_t size, void
            *ptr)
+ 
       This built-in function returns true if objects of SIZE bytes always
!      generate lock free atomic instructions for the target architecture.
!      If it is not known to be lock free a call is made to a runtime
!      routine named '__atomic_is_lock_free'.
  
       PTR is an optional pointer to the object that may be used to
       determine alignment.  A value of 0 indicates typical alignment
*************** operations together with checking whethe
*** 33373,33385 ****
   -- Built-in Function: bool __builtin_saddl_overflow (long int a, long
            int b, long int *res)
   -- Built-in Function: bool __builtin_saddll_overflow (long long int a,
!           long long int b, long int *res)
   -- Built-in Function: bool __builtin_uadd_overflow (unsigned int a,
            unsigned int b, unsigned int *res)
   -- Built-in Function: bool __builtin_uaddl_overflow (unsigned long int
            a, unsigned long int b, unsigned long int *res)
   -- Built-in Function: bool __builtin_uaddll_overflow (unsigned long
!           long int a, unsigned long long int b, unsigned long int *res)
       These built-in functions promote the first two operands into
       infinite precision signed type and perform addition on those
       promoted operands.  The result is then cast to the type the third
--- 33020,33034 ----
   -- Built-in Function: bool __builtin_saddl_overflow (long int a, long
            int b, long int *res)
   -- Built-in Function: bool __builtin_saddll_overflow (long long int a,
!           long long int b, long long int *res)
   -- Built-in Function: bool __builtin_uadd_overflow (unsigned int a,
            unsigned int b, unsigned int *res)
   -- Built-in Function: bool __builtin_uaddl_overflow (unsigned long int
            a, unsigned long int b, unsigned long int *res)
   -- Built-in Function: bool __builtin_uaddll_overflow (unsigned long
!           long int a, unsigned long long int b, unsigned long long int
!           *res)
! 
       These built-in functions promote the first two operands into
       infinite precision signed type and perform addition on those
       promoted operands.  The result is then cast to the type the third
*************** operations together with checking whethe
*** 33397,33403 ****
       these built-in functions where possible, like conditional jump on
       overflow after addition, conditional jump on carry etc.
  
- 
   -- Built-in Function: bool __builtin_sub_overflow (TYPE1 a, TYPE2 b,
            TYPE3 *res)
   -- Built-in Function: bool __builtin_ssub_overflow (int a, int b, int
--- 33046,33051 ----
*************** operations together with checking whethe
*** 33405,33422 ****
   -- Built-in Function: bool __builtin_ssubl_overflow (long int a, long
            int b, long int *res)
   -- Built-in Function: bool __builtin_ssubll_overflow (long long int a,
!           long long int b, long int *res)
   -- Built-in Function: bool __builtin_usub_overflow (unsigned int a,
            unsigned int b, unsigned int *res)
   -- Built-in Function: bool __builtin_usubl_overflow (unsigned long int
            a, unsigned long int b, unsigned long int *res)
   -- Built-in Function: bool __builtin_usubll_overflow (unsigned long
!           long int a, unsigned long long int b, unsigned long int *res)
!      These built-in functions are similar to the add overflow checking
!      built-in functions above, except they perform subtraction,
!      subtract the second argument from the first one, instead of
!      addition.
  
  
   -- Built-in Function: bool __builtin_mul_overflow (TYPE1 a, TYPE2 b,
            TYPE3 *res)
--- 33053,33070 ----
   -- Built-in Function: bool __builtin_ssubl_overflow (long int a, long
            int b, long int *res)
   -- Built-in Function: bool __builtin_ssubll_overflow (long long int a,
!           long long int b, long long int *res)
   -- Built-in Function: bool __builtin_usub_overflow (unsigned int a,
            unsigned int b, unsigned int *res)
   -- Built-in Function: bool __builtin_usubl_overflow (unsigned long int
            a, unsigned long int b, unsigned long int *res)
   -- Built-in Function: bool __builtin_usubll_overflow (unsigned long
!           long int a, unsigned long long int b, unsigned long long int
!           *res)
  
+      These built-in functions are similar to the add overflow checking
+      built-in functions above, except they perform subtraction, subtract
+      the second argument from the first one, instead of addition.
  
   -- Built-in Function: bool __builtin_mul_overflow (TYPE1 a, TYPE2 b,
            TYPE3 *res)
*************** operations together with checking whethe
*** 33425,33442 ****
   -- Built-in Function: bool __builtin_smull_overflow (long int a, long
            int b, long int *res)
   -- Built-in Function: bool __builtin_smulll_overflow (long long int a,
!           long long int b, long int *res)
   -- Built-in Function: bool __builtin_umul_overflow (unsigned int a,
            unsigned int b, unsigned int *res)
   -- Built-in Function: bool __builtin_umull_overflow (unsigned long int
            a, unsigned long int b, unsigned long int *res)
   -- Built-in Function: bool __builtin_umulll_overflow (unsigned long
!           long int a, unsigned long long int b, unsigned long int *res)
       These built-in functions are similar to the add overflow checking
       built-in functions above, except they perform multiplication,
       instead of addition.
  
- 
  
  File: gcc.info,  Node: x86 specific memory model extensions for transactional memory,  Next: Object Size Checking,  Prev: Integer Overflow Builtins,  Up: C Extensions
  
--- 33073,33091 ----
   -- Built-in Function: bool __builtin_smull_overflow (long int a, long
            int b, long int *res)
   -- Built-in Function: bool __builtin_smulll_overflow (long long int a,
!           long long int b, long long int *res)
   -- Built-in Function: bool __builtin_umul_overflow (unsigned int a,
            unsigned int b, unsigned int *res)
   -- Built-in Function: bool __builtin_umull_overflow (unsigned long int
            a, unsigned long int b, unsigned long int *res)
   -- Built-in Function: bool __builtin_umulll_overflow (unsigned long
!           long int a, unsigned long long int b, unsigned long long int
!           *res)
! 
       These built-in functions are similar to the add overflow checking
       built-in functions above, except they perform multiplication,
       instead of addition.
  
  
  File: gcc.info,  Node: x86 specific memory model extensions for transactional memory,  Next: Object Size Checking,  Prev: Integer Overflow Builtins,  Up: C Extensions
  
*************** The x86 architecture supports additional
*** 33447,33462 ****
  lock critical sections for hardware lock elision.  These must be
  specified in addition to an existing memory model to atomic intrinsics.
  
! `__ATOMIC_HLE_ACQUIRE'
       Start lock elision on a lock variable.  Memory model must be
!      `__ATOMIC_ACQUIRE' or stronger.
! 
! `__ATOMIC_HLE_RELEASE'
       End lock elision on a lock variable.  Memory model must be
!      `__ATOMIC_RELEASE' or stronger.
  
   When a lock acquire fails it is required for good performance to abort
! the transaction quickly. This can be done with a `_mm_pause'
  
       #include <immintrin.h> // For _mm_pause
  
--- 33096,33110 ----
  lock critical sections for hardware lock elision.  These must be
  specified in addition to an existing memory model to atomic intrinsics.
  
! '__ATOMIC_HLE_ACQUIRE'
       Start lock elision on a lock variable.  Memory model must be
!      '__ATOMIC_ACQUIRE' or stronger.
! '__ATOMIC_HLE_RELEASE'
       End lock elision on a lock variable.  Memory model must be
!      '__ATOMIC_RELEASE' or stronger.
  
   When a lock acquire fails it is required for good performance to abort
! the transaction quickly.  This can be done with a '_mm_pause'
  
       #include <immintrin.h> // For _mm_pause
  
*************** prevent some buffer overflow attacks.
*** 33482,33497 ****
            TYPE)
       is a built-in construct that returns a constant number of bytes
       from PTR to the end of the object PTR pointer points to (if known
!      at compile time).  `__builtin_object_size' never evaluates its
!      arguments for side-effects.  If there are any side-effects in
!      them, it returns `(size_t) -1' for TYPE 0 or 1 and `(size_t) 0'
!      for TYPE 2 or 3.  If there are multiple objects PTR can point to
!      and all of them are known at compile time, the returned number is
!      the maximum of remaining byte counts in those objects if TYPE & 2
!      is 0 and minimum if nonzero.  If it is not possible to determine
!      which objects PTR points to at compile time,
!      `__builtin_object_size' should return `(size_t) -1' for TYPE 0 or
!      1 and `(size_t) 0' for TYPE 2 or 3.
  
       TYPE is an integer constant from 0 to 3.  If the least significant
       bit is clear, objects are whole variables, if it is set, a closest
--- 33130,33145 ----
            TYPE)
       is a built-in construct that returns a constant number of bytes
       from PTR to the end of the object PTR pointer points to (if known
!      at compile time).  '__builtin_object_size' never evaluates its
!      arguments for side-effects.  If there are any side-effects in them,
!      it returns '(size_t) -1' for TYPE 0 or 1 and '(size_t) 0' for TYPE
!      2 or 3.  If there are multiple objects PTR can point to and all of
!      them are known at compile time, the returned number is the maximum
!      of remaining byte counts in those objects if TYPE & 2 is 0 and
!      minimum if nonzero.  If it is not possible to determine which
!      objects PTR points to at compile time, '__builtin_object_size'
!      should return '(size_t) -1' for TYPE 0 or 1 and '(size_t) 0' for
!      TYPE 2 or 3.
  
       TYPE is an integer constant from 0 to 3.  If the least significant
       bit is clear, objects are whole variables, if it is set, a closest
*************** prevent some buffer overflow attacks.
*** 33513,33527 ****
            assert (__builtin_object_size (q, 1) == sizeof (var.b));
  
   There are built-in functions added for many common string operation
! functions, e.g., for `memcpy' `__builtin___memcpy_chk' built-in is
  provided.  This built-in has an additional last argument, which is the
  number of bytes remaining in object the DEST argument points to or
! `(size_t) -1' if the size is not known.
  
   The built-in functions are optimized into the normal string functions
! like `memcpy' if the last argument is `(size_t) -1' or if it is known
! at compile time that the destination object will not be overflown.  If
! the compiler can determine at compile time the object will be always
  overflown, it issues a warning.
  
   The intended use can be e.g.
--- 33161,33175 ----
            assert (__builtin_object_size (q, 1) == sizeof (var.b));
  
   There are built-in functions added for many common string operation
! functions, e.g., for 'memcpy' '__builtin___memcpy_chk' built-in is
  provided.  This built-in has an additional last argument, which is the
  number of bytes remaining in object the DEST argument points to or
! '(size_t) -1' if the size is not known.
  
   The built-in functions are optimized into the normal string functions
! like 'memcpy' if the last argument is '(size_t) -1' or if it is known at
! compile time that the destination object will not be overflown.  If the
! compiler can determine at compile time the object will be always
  overflown, it issues a warning.
  
   The intended use can be e.g.
*************** overflown, it issues a warning.
*** 33548,33556 ****
          will abort the program at run time.  */
       memcpy (&buf[6], "abcde", 5);
  
!  Such built-in functions are provided for `memcpy', `mempcpy',
! `memmove', `memset', `strcpy', `stpcpy', `strncpy', `strcat' and
! `strncat'.
  
   There are also checking built-in functions for formatted output
  functions.
--- 33196,33204 ----
          will abort the program at run time.  */
       memcpy (&buf[6], "abcde", 5);
  
!  Such built-in functions are provided for 'memcpy', 'mempcpy',
! 'memmove', 'memset', 'strcpy', 'stpcpy', 'strncpy', 'strcat' and
! 'strncat'.
  
   There are also checking built-in functions for formatted output
  functions.
*************** functions.
*** 33562,33583 ****
       int __builtin___vsnprintf_chk (char *s, size_t maxlen, int flag, size_t os,
                                      const char *fmt, va_list ap);
  
!  The added FLAG argument is passed unchanged to `__sprintf_chk' etc.
  functions and can contain implementation specific flags on what
  additional security measures the checking function might take, such as
! handling `%n' differently.
  
   The OS argument is the object size S points to, like in the other
! built-in functions.  There is a small difference in the behavior
! though, if OS is `(size_t) -1', the built-in functions are optimized
! into the non-checking functions only if FLAG is 0, otherwise the
! checking function is called with OS argument set to `(size_t) -1'.
  
   In addition to this, there are checking built-in functions
! `__builtin___printf_chk', `__builtin___vprintf_chk',
! `__builtin___fprintf_chk' and `__builtin___vfprintf_chk'.  These have
  just one additional argument, FLAG, right before format string FMT.  If
! the compiler is able to optimize them to `fputc' etc. functions, it
  does, otherwise the checking function is called and the FLAG argument
  passed to it.
  
--- 33210,33231 ----
       int __builtin___vsnprintf_chk (char *s, size_t maxlen, int flag, size_t os,
                                      const char *fmt, va_list ap);
  
!  The added FLAG argument is passed unchanged to '__sprintf_chk' etc.
  functions and can contain implementation specific flags on what
  additional security measures the checking function might take, such as
! handling '%n' differently.
  
   The OS argument is the object size S points to, like in the other
! built-in functions.  There is a small difference in the behavior though,
! if OS is '(size_t) -1', the built-in functions are optimized into the
! non-checking functions only if FLAG is 0, otherwise the checking
! function is called with OS argument set to '(size_t) -1'.
  
   In addition to this, there are checking built-in functions
! '__builtin___printf_chk', '__builtin___vprintf_chk',
! '__builtin___fprintf_chk' and '__builtin___vfprintf_chk'.  These have
  just one additional argument, FLAG, right before format string FMT.  If
! the compiler is able to optimize them to 'fputc' etc. functions, it
  does, otherwise the checking function is called and the FLAG argument
  passed to it.
  
*************** File: gcc.info,  Node: Pointer Bounds Ch
*** 33590,33600 ****
  GCC provides a set of built-in functions to control Pointer Bounds
  Checker instrumentation.  Note that all Pointer Bounds Checker builtins
  can be used even if you compile with Pointer Bounds Checker off
! (`-fno-check-pointer-bounds').  The behavior may differ in such case as
  documented below.
  
!  -- Built-in Function: void * __builtin___bnd_set_ptr_bounds (const
!           void *Q, size_t SIZE)
       This built-in function returns a new pointer with the value of Q,
       and associate it with the bounds [Q, Q+SIZE-1].  With Pointer
       Bounds Checker off, the built-in function just returns the first
--- 33238,33249 ----
  GCC provides a set of built-in functions to control Pointer Bounds
  Checker instrumentation.  Note that all Pointer Bounds Checker builtins
  can be used even if you compile with Pointer Bounds Checker off
! ('-fno-check-pointer-bounds').  The behavior may differ in such case as
  documented below.
  
!  -- Built-in Function: void * __builtin___bnd_set_ptr_bounds (const void
!           *Q, size_t SIZE)
! 
       This built-in function returns a new pointer with the value of Q,
       and associate it with the bounds [Q, Q+SIZE-1].  With Pointer
       Bounds Checker off, the built-in function just returns the first
*************** documented below.
*** 33607,33615 ****
              return __builtin___bnd_set_ptr_bounds (p, n);
            }
  
- 
   -- Built-in Function: void * __builtin___bnd_narrow_ptr_bounds (const
            void *P, const void *Q, size_t SIZE)
       This built-in function returns a new pointer with the value of P
       and associates it with the narrowed bounds formed by the
       intersection of bounds associated with Q and the bounds [P, P +
--- 33256,33264 ----
              return __builtin___bnd_set_ptr_bounds (p, n);
            }
  
   -- Built-in Function: void * __builtin___bnd_narrow_ptr_bounds (const
            void *P, const void *Q, size_t SIZE)
+ 
       This built-in function returns a new pointer with the value of P
       and associates it with the narrowed bounds formed by the
       intersection of bounds associated with Q and the bounds [P, P +
*************** documented below.
*** 33626,33634 ****
                                                                sizeof(object)));
            }
  
- 
   -- Built-in Function: void * __builtin___bnd_copy_ptr_bounds (const
            void *Q, const void *R)
       This built-in function returns a new pointer with the value of Q,
       and associates it with the bounds already associated with pointer
       R.  With Pointer Bounds Checker off, the built-in function just
--- 33275,33283 ----
                                                                sizeof(object)));
            }
  
   -- Built-in Function: void * __builtin___bnd_copy_ptr_bounds (const
            void *Q, const void *R)
+ 
       This built-in function returns a new pointer with the value of Q,
       and associates it with the bounds already associated with pointer
       R.  With Pointer Bounds Checker off, the built-in function just
*************** documented below.
*** 33639,33663 ****
            int *field_ptr = __builtin___bnd_copy_ptr_bounds (&objptr->int_field,
                                                              objptr);
  
- 
   -- Built-in Function: void * __builtin___bnd_init_ptr_bounds (const
            void *Q)
       This built-in function returns a new pointer with the value of Q,
       and associates it with INIT (allowing full memory access) bounds.
!      With Pointer Bounds Checker off, the built-in function just
!      returns the first argument.
! 
  
   -- Built-in Function: void * __builtin___bnd_null_ptr_bounds (const
            void *Q)
       This built-in function returns a new pointer with the value of Q,
       and associates it with NULL (allowing no memory access) bounds.
!      With Pointer Bounds Checker off, the built-in function just
!      returns the first argument.
  
  
-  -- Built-in Function: void __builtin___bnd_store_ptr_bounds (const
-           void **PTR_ADDR, const void *PTR_VAL)
       This built-in function stores the bounds associated with pointer
       PTR_VAL and location PTR_ADDR into Bounds Table.  This can be
       useful to propagate bounds from legacy code without touching the
--- 33288,33312 ----
            int *field_ptr = __builtin___bnd_copy_ptr_bounds (&objptr->int_field,
                                                              objptr);
  
   -- Built-in Function: void * __builtin___bnd_init_ptr_bounds (const
            void *Q)
+ 
       This built-in function returns a new pointer with the value of Q,
       and associates it with INIT (allowing full memory access) bounds.
!      With Pointer Bounds Checker off, the built-in function just returns
!      the first argument.
  
   -- Built-in Function: void * __builtin___bnd_null_ptr_bounds (const
            void *Q)
+ 
       This built-in function returns a new pointer with the value of Q,
       and associates it with NULL (allowing no memory access) bounds.
!      With Pointer Bounds Checker off, the built-in function just returns
!      the first argument.
  
+  -- Built-in Function: void __builtin___bnd_store_ptr_bounds (const void
+           **PTR_ADDR, const void *PTR_VAL)
  
       This built-in function stores the bounds associated with pointer
       PTR_VAL and location PTR_ADDR into Bounds Table.  This can be
       useful to propagate bounds from legacy code without touching the
*************** documented below.
*** 33665,33673 ****
       With Pointer Bounds Checker off, the built-in function call is
       ignored.
  
- 
   -- Built-in Function: void __builtin___bnd_chk_ptr_lbounds (const void
            *Q)
       This built-in function checks if the pointer Q is within the lower
       bound of its associated bounds.  With Pointer Bounds Checker off,
       the built-in function call is ignored.
--- 33314,33322 ----
       With Pointer Bounds Checker off, the built-in function call is
       ignored.
  
   -- Built-in Function: void __builtin___bnd_chk_ptr_lbounds (const void
            *Q)
+ 
       This built-in function checks if the pointer Q is within the lower
       bound of its associated bounds.  With Pointer Bounds Checker off,
       the built-in function call is ignored.
*************** documented below.
*** 33683,33698 ****
              return dst;
            }
  
- 
   -- Built-in Function: void __builtin___bnd_chk_ptr_ubounds (const void
            *Q)
       This built-in function checks if the pointer Q is within the upper
       bound of its associated bounds.  With Pointer Bounds Checker off,
       the built-in function call is ignored.
  
- 
   -- Built-in Function: void __builtin___bnd_chk_ptr_bounds (const void
            *Q, size_t SIZE)
       This built-in function checks if [Q, Q + SIZE - 1] is within the
       lower and upper bounds associated with Q.  With Pointer Bounds
       Checker off, the built-in function call is ignored.
--- 33332,33347 ----
              return dst;
            }
  
   -- Built-in Function: void __builtin___bnd_chk_ptr_ubounds (const void
            *Q)
+ 
       This built-in function checks if the pointer Q is within the upper
       bound of its associated bounds.  With Pointer Bounds Checker off,
       the built-in function call is ignored.
  
   -- Built-in Function: void __builtin___bnd_chk_ptr_bounds (const void
            *Q, size_t SIZE)
+ 
       This built-in function checks if [Q, Q + SIZE - 1] is within the
       lower and upper bounds associated with Q.  With Pointer Bounds
       Checker off, the built-in function call is ignored.
*************** documented below.
*** 33708,33732 ****
              return dst;
            }
  
- 
   -- Built-in Function: const void * __builtin___bnd_get_ptr_lbound
            (const void *Q)
       This built-in function returns the lower bound associated with the
       pointer Q, as a pointer value.  This is useful for debugging using
!      `printf'.  With Pointer Bounds Checker off, the built-in function
       returns 0.
  
            void *lb = __builtin___bnd_get_ptr_lbound (q);
            void *ub = __builtin___bnd_get_ptr_ubound (q);
            printf ("q = %p  lb(q) = %p  ub(q) = %p", q, lb, ub);
  
- 
   -- Built-in Function: const void * __builtin___bnd_get_ptr_ubound
            (const void *Q)
-      This built-in function returns the upper bound (which is a
-      pointer) associated with the pointer Q.  With Pointer Bounds
-      Checker off, the built-in function returns -1.
  
  
  
  File: gcc.info,  Node: Cilk Plus Builtins,  Next: Other Builtins,  Prev: Pointer Bounds Checker builtins,  Up: C Extensions
--- 33357,33380 ----
              return dst;
            }
  
   -- Built-in Function: const void * __builtin___bnd_get_ptr_lbound
            (const void *Q)
+ 
       This built-in function returns the lower bound associated with the
       pointer Q, as a pointer value.  This is useful for debugging using
!      'printf'.  With Pointer Bounds Checker off, the built-in function
       returns 0.
  
            void *lb = __builtin___bnd_get_ptr_lbound (q);
            void *ub = __builtin___bnd_get_ptr_ubound (q);
            printf ("q = %p  lb(q) = %p  ub(q) = %p", q, lb, ub);
  
   -- Built-in Function: const void * __builtin___bnd_get_ptr_ubound
            (const void *Q)
  
+      This built-in function returns the upper bound (which is a pointer)
+      associated with the pointer Q.  With Pointer Bounds Checker off,
+      the built-in function returns -1.
  
  
  File: gcc.info,  Node: Cilk Plus Builtins,  Next: Other Builtins,  Prev: Pointer Bounds Checker builtins,  Up: C Extensions
*************** File: gcc.info,  Node: Cilk Plus Builtin
*** 33735,33772 ****
  ==========================================================
  
  GCC provides support for the following built-in reduction functions if
! Cilk Plus is enabled. Cilk Plus can be enabled using the `-fcilkplus'
  flag.
  
!    * `__sec_implicit_index'
! 
!    * `__sec_reduce'
! 
!    * `__sec_reduce_add'
! 
!    * `__sec_reduce_all_nonzero'
! 
!    * `__sec_reduce_all_zero'
! 
!    * `__sec_reduce_any_nonzero'
! 
!    * `__sec_reduce_any_zero'
! 
!    * `__sec_reduce_max'
! 
!    * `__sec_reduce_min'
! 
!    * `__sec_reduce_max_ind'
! 
!    * `__sec_reduce_min_ind'
! 
!    * `__sec_reduce_mul'
! 
!    * `__sec_reduce_mutating'
  
   Further details and examples about these built-in functions are
  described in the Cilk Plus language manual which can be found at
! `http://www.cilkplus.org'.
  
  
  File: gcc.info,  Node: Other Builtins,  Next: Target Builtins,  Prev: Cilk Plus Builtins,  Up: C Extensions
--- 33383,33408 ----
  ==========================================================
  
  GCC provides support for the following built-in reduction functions if
! Cilk Plus is enabled.  Cilk Plus can be enabled using the '-fcilkplus'
  flag.
  
!    * '__sec_implicit_index'
!    * '__sec_reduce'
!    * '__sec_reduce_add'
!    * '__sec_reduce_all_nonzero'
!    * '__sec_reduce_all_zero'
!    * '__sec_reduce_any_nonzero'
!    * '__sec_reduce_any_zero'
!    * '__sec_reduce_max'
!    * '__sec_reduce_min'
!    * '__sec_reduce_max_ind'
!    * '__sec_reduce_min_ind'
!    * '__sec_reduce_mul'
!    * '__sec_reduce_mutating'
  
   Further details and examples about these built-in functions are
  described in the Cilk Plus language manual which can be found at
! <https://www.cilkplus.org>.
  
  
  File: gcc.info,  Node: Other Builtins,  Next: Target Builtins,  Prev: Cilk Plus Builtins,  Up: C Extensions
*************** general use of these functions.
*** 33783,33885 ****
   The remaining functions are provided for optimization purposes.
  
   GCC includes built-in versions of many of the functions in the standard
! C library.  The versions prefixed with `__builtin_' are always treated
! as having the same meaning as the C library function even if you
! specify the `-fno-builtin' option.  (*note C Dialect Options::) Many of
! these functions are only optimized in certain cases; if they are not
! optimized in a particular case, a call to the library function is
! emitted.
  
!  Outside strict ISO C mode (`-ansi', `-std=c90', `-std=c99' or
! `-std=c11'), the functions `_exit', `alloca', `bcmp', `bzero',
! `dcgettext', `dgettext', `dremf', `dreml', `drem', `exp10f', `exp10l',
! `exp10', `ffsll', `ffsl', `ffs', `fprintf_unlocked', `fputs_unlocked',
! `gammaf', `gammal', `gamma', `gammaf_r', `gammal_r', `gamma_r',
! `gettext', `index', `isascii', `j0f', `j0l', `j0', `j1f', `j1l', `j1',
! `jnf', `jnl', `jn', `lgammaf_r', `lgammal_r', `lgamma_r', `mempcpy',
! `pow10f', `pow10l', `pow10', `printf_unlocked', `rindex', `scalbf',
! `scalbl', `scalb', `signbit', `signbitf', `signbitl', `signbitd32',
! `signbitd64', `signbitd128', `significandf', `significandl',
! `significand', `sincosf', `sincosl', `sincos', `stpcpy', `stpncpy',
! `strcasecmp', `strdup', `strfmon', `strncasecmp', `strndup', `toascii',
! `y0f', `y0l', `y0', `y1f', `y1l', `y1', `ynf', `ynl' and `yn' may be
  handled as built-in functions.  All these functions have corresponding
! versions prefixed with `__builtin_', which may be used even in strict
  C90 mode.
  
!  The ISO C99 functions `_Exit', `acoshf', `acoshl', `acosh', `asinhf',
! `asinhl', `asinh', `atanhf', `atanhl', `atanh', `cabsf', `cabsl',
! `cabs', `cacosf', `cacoshf', `cacoshl', `cacosh', `cacosl', `cacos',
! `cargf', `cargl', `carg', `casinf', `casinhf', `casinhl', `casinh',
! `casinl', `casin', `catanf', `catanhf', `catanhl', `catanh', `catanl',
! `catan', `cbrtf', `cbrtl', `cbrt', `ccosf', `ccoshf', `ccoshl',
! `ccosh', `ccosl', `ccos', `cexpf', `cexpl', `cexp', `cimagf', `cimagl',
! `cimag', `clogf', `clogl', `clog', `conjf', `conjl', `conj',
! `copysignf', `copysignl', `copysign', `cpowf', `cpowl', `cpow',
! `cprojf', `cprojl', `cproj', `crealf', `creall', `creal', `csinf',
! `csinhf', `csinhl', `csinh', `csinl', `csin', `csqrtf', `csqrtl',
! `csqrt', `ctanf', `ctanhf', `ctanhl', `ctanh', `ctanl', `ctan',
! `erfcf', `erfcl', `erfc', `erff', `erfl', `erf', `exp2f', `exp2l',
! `exp2', `expm1f', `expm1l', `expm1', `fdimf', `fdiml', `fdim', `fmaf',
! `fmal', `fmaxf', `fmaxl', `fmax', `fma', `fminf', `fminl', `fmin',
! `hypotf', `hypotl', `hypot', `ilogbf', `ilogbl', `ilogb', `imaxabs',
! `isblank', `iswblank', `lgammaf', `lgammal', `lgamma', `llabs',
! `llrintf', `llrintl', `llrint', `llroundf', `llroundl', `llround',
! `log1pf', `log1pl', `log1p', `log2f', `log2l', `log2', `logbf',
! `logbl', `logb', `lrintf', `lrintl', `lrint', `lroundf', `lroundl',
! `lround', `nearbyintf', `nearbyintl', `nearbyint', `nextafterf',
! `nextafterl', `nextafter', `nexttowardf', `nexttowardl', `nexttoward',
! `remainderf', `remainderl', `remainder', `remquof', `remquol',
! `remquo', `rintf', `rintl', `rint', `roundf', `roundl', `round',
! `scalblnf', `scalblnl', `scalbln', `scalbnf', `scalbnl', `scalbn',
! `snprintf', `tgammaf', `tgammal', `tgamma', `truncf', `truncl', `trunc',
! `vfscanf', `vscanf', `vsnprintf' and `vsscanf' are handled as built-in
! functions except in strict ISO C90 mode (`-ansi' or `-std=c90').
  
!  There are also built-in versions of the ISO C99 functions `acosf',
! `acosl', `asinf', `asinl', `atan2f', `atan2l', `atanf', `atanl',
! `ceilf', `ceill', `cosf', `coshf', `coshl', `cosl', `expf', `expl',
! `fabsf', `fabsl', `floorf', `floorl', `fmodf', `fmodl', `frexpf',
! `frexpl', `ldexpf', `ldexpl', `log10f', `log10l', `logf', `logl',
! `modfl', `modf', `powf', `powl', `sinf', `sinhf', `sinhl', `sinl',
! `sqrtf', `sqrtl', `tanf', `tanhf', `tanhl' and `tanl' that are
  recognized in any mode since ISO C90 reserves these names for the
  purpose to which ISO C99 puts them.  All these functions have
! corresponding versions prefixed with `__builtin_'.
  
!  The ISO C94 functions `iswalnum', `iswalpha', `iswcntrl', `iswdigit',
! `iswgraph', `iswlower', `iswprint', `iswpunct', `iswspace', `iswupper',
! `iswxdigit', `towlower' and `towupper' are handled as built-in functions
! except in strict ISO C90 mode (`-ansi' or `-std=c90').
  
!  The ISO C90 functions `abort', `abs', `acos', `asin', `atan2', `atan',
! `calloc', `ceil', `cosh', `cos', `exit', `exp', `fabs', `floor', `fmod',
! `fprintf', `fputs', `frexp', `fscanf', `isalnum', `isalpha', `iscntrl',
! `isdigit', `isgraph', `islower', `isprint', `ispunct', `isspace',
! `isupper', `isxdigit', `tolower', `toupper', `labs', `ldexp', `log10',
! `log', `malloc', `memchr', `memcmp', `memcpy', `memset', `modf', `pow',
! `printf', `putchar', `puts', `scanf', `sinh', `sin', `snprintf',
! `sprintf', `sqrt', `sscanf', `strcat', `strchr', `strcmp', `strcpy',
! `strcspn', `strlen', `strncat', `strncmp', `strncpy', `strpbrk',
! `strrchr', `strspn', `strstr', `tanh', `tan', `vfprintf', `vprintf' and
! `vsprintf' are all recognized as built-in functions unless
! `-fno-builtin' is specified (or `-fno-builtin-FUNCTION' is specified
! for an individual function).  All of these functions have corresponding
! versions prefixed with `__builtin_'.
  
   GCC provides built-in versions of the ISO C99 floating-point comparison
  macros that avoid raising exceptions for unordered operands.  They have
! the same names as the standard macros ( `isgreater', `isgreaterequal',
! `isless', `islessequal', `islessgreater', and `isunordered') , with
! `__builtin_' prefixed.  We intend for a library implementor to be able
! to simply `#define' each standard macro to its built-in equivalent.  In
! the same fashion, GCC provides `fpclassify', `isfinite', `isinf_sign'
! and `isnormal' built-ins used with `__builtin_' prefixed.  The `isinf'
! and `isnan' built-in functions appear both with and without the
! `__builtin_' prefix.
  
   -- Built-in Function: int __builtin_types_compatible_p (TYPE1, TYPE2)
!      You can use the built-in function `__builtin_types_compatible_p' to
       determine whether two types are the same.
  
       This built-in function returns 1 if the unqualified versions of the
--- 33419,33521 ----
   The remaining functions are provided for optimization purposes.
  
   GCC includes built-in versions of many of the functions in the standard
! C library.  The versions prefixed with '__builtin_' are always treated
! as having the same meaning as the C library function even if you specify
! the '-fno-builtin' option.  (*note C Dialect Options::) Many of these
! functions are only optimized in certain cases; if they are not optimized
! in a particular case, a call to the library function is emitted.
  
!  Outside strict ISO C mode ('-ansi', '-std=c90', '-std=c99' or
! '-std=c11'), the functions '_exit', 'alloca', 'bcmp', 'bzero',
! 'dcgettext', 'dgettext', 'dremf', 'dreml', 'drem', 'exp10f', 'exp10l',
! 'exp10', 'ffsll', 'ffsl', 'ffs', 'fprintf_unlocked', 'fputs_unlocked',
! 'gammaf', 'gammal', 'gamma', 'gammaf_r', 'gammal_r', 'gamma_r',
! 'gettext', 'index', 'isascii', 'j0f', 'j0l', 'j0', 'j1f', 'j1l', 'j1',
! 'jnf', 'jnl', 'jn', 'lgammaf_r', 'lgammal_r', 'lgamma_r', 'mempcpy',
! 'pow10f', 'pow10l', 'pow10', 'printf_unlocked', 'rindex', 'scalbf',
! 'scalbl', 'scalb', 'signbit', 'signbitf', 'signbitl', 'signbitd32',
! 'signbitd64', 'signbitd128', 'significandf', 'significandl',
! 'significand', 'sincosf', 'sincosl', 'sincos', 'stpcpy', 'stpncpy',
! 'strcasecmp', 'strdup', 'strfmon', 'strncasecmp', 'strndup', 'toascii',
! 'y0f', 'y0l', 'y0', 'y1f', 'y1l', 'y1', 'ynf', 'ynl' and 'yn' may be
  handled as built-in functions.  All these functions have corresponding
! versions prefixed with '__builtin_', which may be used even in strict
  C90 mode.
  
!  The ISO C99 functions '_Exit', 'acoshf', 'acoshl', 'acosh', 'asinhf',
! 'asinhl', 'asinh', 'atanhf', 'atanhl', 'atanh', 'cabsf', 'cabsl',
! 'cabs', 'cacosf', 'cacoshf', 'cacoshl', 'cacosh', 'cacosl', 'cacos',
! 'cargf', 'cargl', 'carg', 'casinf', 'casinhf', 'casinhl', 'casinh',
! 'casinl', 'casin', 'catanf', 'catanhf', 'catanhl', 'catanh', 'catanl',
! 'catan', 'cbrtf', 'cbrtl', 'cbrt', 'ccosf', 'ccoshf', 'ccoshl', 'ccosh',
! 'ccosl', 'ccos', 'cexpf', 'cexpl', 'cexp', 'cimagf', 'cimagl', 'cimag',
! 'clogf', 'clogl', 'clog', 'conjf', 'conjl', 'conj', 'copysignf',
! 'copysignl', 'copysign', 'cpowf', 'cpowl', 'cpow', 'cprojf', 'cprojl',
! 'cproj', 'crealf', 'creall', 'creal', 'csinf', 'csinhf', 'csinhl',
! 'csinh', 'csinl', 'csin', 'csqrtf', 'csqrtl', 'csqrt', 'ctanf',
! 'ctanhf', 'ctanhl', 'ctanh', 'ctanl', 'ctan', 'erfcf', 'erfcl', 'erfc',
! 'erff', 'erfl', 'erf', 'exp2f', 'exp2l', 'exp2', 'expm1f', 'expm1l',
! 'expm1', 'fdimf', 'fdiml', 'fdim', 'fmaf', 'fmal', 'fmaxf', 'fmaxl',
! 'fmax', 'fma', 'fminf', 'fminl', 'fmin', 'hypotf', 'hypotl', 'hypot',
! 'ilogbf', 'ilogbl', 'ilogb', 'imaxabs', 'isblank', 'iswblank',
! 'lgammaf', 'lgammal', 'lgamma', 'llabs', 'llrintf', 'llrintl', 'llrint',
! 'llroundf', 'llroundl', 'llround', 'log1pf', 'log1pl', 'log1p', 'log2f',
! 'log2l', 'log2', 'logbf', 'logbl', 'logb', 'lrintf', 'lrintl', 'lrint',
! 'lroundf', 'lroundl', 'lround', 'nearbyintf', 'nearbyintl', 'nearbyint',
! 'nextafterf', 'nextafterl', 'nextafter', 'nexttowardf', 'nexttowardl',
! 'nexttoward', 'remainderf', 'remainderl', 'remainder', 'remquof',
! 'remquol', 'remquo', 'rintf', 'rintl', 'rint', 'roundf', 'roundl',
! 'round', 'scalblnf', 'scalblnl', 'scalbln', 'scalbnf', 'scalbnl',
! 'scalbn', 'snprintf', 'tgammaf', 'tgammal', 'tgamma', 'truncf',
! 'truncl', 'trunc', 'vfscanf', 'vscanf', 'vsnprintf' and 'vsscanf' are
! handled as built-in functions except in strict ISO C90 mode ('-ansi' or
! '-std=c90').
  
!  There are also built-in versions of the ISO C99 functions 'acosf',
! 'acosl', 'asinf', 'asinl', 'atan2f', 'atan2l', 'atanf', 'atanl',
! 'ceilf', 'ceill', 'cosf', 'coshf', 'coshl', 'cosl', 'expf', 'expl',
! 'fabsf', 'fabsl', 'floorf', 'floorl', 'fmodf', 'fmodl', 'frexpf',
! 'frexpl', 'ldexpf', 'ldexpl', 'log10f', 'log10l', 'logf', 'logl',
! 'modfl', 'modf', 'powf', 'powl', 'sinf', 'sinhf', 'sinhl', 'sinl',
! 'sqrtf', 'sqrtl', 'tanf', 'tanhf', 'tanhl' and 'tanl' that are
  recognized in any mode since ISO C90 reserves these names for the
  purpose to which ISO C99 puts them.  All these functions have
! corresponding versions prefixed with '__builtin_'.
  
!  The ISO C94 functions 'iswalnum', 'iswalpha', 'iswcntrl', 'iswdigit',
! 'iswgraph', 'iswlower', 'iswprint', 'iswpunct', 'iswspace', 'iswupper',
! 'iswxdigit', 'towlower' and 'towupper' are handled as built-in functions
! except in strict ISO C90 mode ('-ansi' or '-std=c90').
  
!  The ISO C90 functions 'abort', 'abs', 'acos', 'asin', 'atan2', 'atan',
! 'calloc', 'ceil', 'cosh', 'cos', 'exit', 'exp', 'fabs', 'floor', 'fmod',
! 'fprintf', 'fputs', 'frexp', 'fscanf', 'isalnum', 'isalpha', 'iscntrl',
! 'isdigit', 'isgraph', 'islower', 'isprint', 'ispunct', 'isspace',
! 'isupper', 'isxdigit', 'tolower', 'toupper', 'labs', 'ldexp', 'log10',
! 'log', 'malloc', 'memchr', 'memcmp', 'memcpy', 'memset', 'modf', 'pow',
! 'printf', 'putchar', 'puts', 'scanf', 'sinh', 'sin', 'snprintf',
! 'sprintf', 'sqrt', 'sscanf', 'strcat', 'strchr', 'strcmp', 'strcpy',
! 'strcspn', 'strlen', 'strncat', 'strncmp', 'strncpy', 'strpbrk',
! 'strrchr', 'strspn', 'strstr', 'tanh', 'tan', 'vfprintf', 'vprintf' and
! 'vsprintf' are all recognized as built-in functions unless
! '-fno-builtin' is specified (or '-fno-builtin-FUNCTION' is specified for
! an individual function).  All of these functions have corresponding
! versions prefixed with '__builtin_'.
  
   GCC provides built-in versions of the ISO C99 floating-point comparison
  macros that avoid raising exceptions for unordered operands.  They have
! the same names as the standard macros ( 'isgreater', 'isgreaterequal',
! 'isless', 'islessequal', 'islessgreater', and 'isunordered') , with
! '__builtin_' prefixed.  We intend for a library implementor to be able
! to simply '#define' each standard macro to its built-in equivalent.  In
! the same fashion, GCC provides 'fpclassify', 'isfinite', 'isinf_sign'
! and 'isnormal' built-ins used with '__builtin_' prefixed.  The 'isinf'
! and 'isnan' built-in functions appear both with and without the
! '__builtin_' prefix.
  
   -- Built-in Function: int __builtin_types_compatible_p (TYPE1, TYPE2)
! 
!      You can use the built-in function '__builtin_types_compatible_p' to
       determine whether two types are the same.
  
       This built-in function returns 1 if the unqualified versions of the
*************** and `isnan' built-in functions appear bo
*** 33887,33907 ****
       compatible, 0 otherwise.  The result of this built-in function can
       be used in integer constant expressions.
  
!      This built-in function ignores top level qualifiers (e.g., `const',
!      `volatile').  For example, `int' is equivalent to `const int'.
  
!      The type `int[]' and `int[5]' are compatible.  On the other hand,
!      `int' and `char *' are not compatible, even if the size of their
       types, on the particular architecture are the same.  Also, the
       amount of pointer indirection is taken into account when
!      determining similarity.  Consequently, `short *' is not similar to
!      `short **'.  Furthermore, two types that are typedefed are
       considered compatible if their underlying types are compatible.
  
!      An `enum' type is not considered to be compatible with another
!      `enum' type even if both are compatible with the same integer
!      type; this is what the C standard specifies.  For example, `enum
!      {foo, bar}' is not similar to `enum {hot, dog}'.
  
       You typically use this function in code whose execution varies
       depending on the arguments' types.  For example:
--- 33523,33543 ----
       compatible, 0 otherwise.  The result of this built-in function can
       be used in integer constant expressions.
  
!      This built-in function ignores top level qualifiers (e.g., 'const',
!      'volatile').  For example, 'int' is equivalent to 'const int'.
  
!      The type 'int[]' and 'int[5]' are compatible.  On the other hand,
!      'int' and 'char *' are not compatible, even if the size of their
       types, on the particular architecture are the same.  Also, the
       amount of pointer indirection is taken into account when
!      determining similarity.  Consequently, 'short *' is not similar to
!      'short **'.  Furthermore, two types that are typedefed are
       considered compatible if their underlying types are compatible.
  
!      An 'enum' type is not considered to be compatible with another
!      'enum' type even if both are compatible with the same integer type;
!      this is what the C standard specifies.  For example, 'enum {foo,
!      bar}' is not similar to 'enum {hot, dog}'.
  
       You typically use this function in code whose execution varies
       depending on the arguments' types.  For example:
*************** and `isnan' built-in functions appear bo
*** 33922,33930 ****
  
       _Note:_ This construct is only available for C.
  
- 
   -- Built-in Function: TYPE __builtin_call_with_static_chain (CALL_EXP,
            POINTER_EXP)
       The CALL_EXP expression must be a function call, and the
       POINTER_EXP expression must be a pointer.  The POINTER_EXP is
       passed to the function call in the target's static chain location.
--- 33558,33566 ----
  
       _Note:_ This construct is only available for C.
  
   -- Built-in Function: TYPE __builtin_call_with_static_chain (CALL_EXP,
            POINTER_EXP)
+ 
       The CALL_EXP expression must be a function call, and the
       POINTER_EXP expression must be a pointer.  The POINTER_EXP is
       passed to the function call in the target's static chain location.
*************** and `isnan' built-in functions appear bo
*** 33933,33953 ****
       _Note:_ This builtin is only available for C.  This builtin can be
       used to call Go closures from C.
  
- 
   -- Built-in Function: TYPE __builtin_choose_expr (CONST_EXP, EXP1,
            EXP2)
!      You can use the built-in function `__builtin_choose_expr' to
       evaluate code depending on the value of a constant expression.
       This built-in function returns EXP1 if CONST_EXP, which is an
       integer constant expression, is nonzero.  Otherwise it returns
       EXP2.
  
!      This built-in function is analogous to the `? :' operator in C,
       except that the expression returned has its type unaltered by
!      promotion rules.  Also, the built-in function does not evaluate
!      the expression that is not chosen.  For example, if CONST_EXP
!      evaluates to true, EXP2 is not evaluated even if it has
!      side-effects.
  
       This built-in function can return an lvalue if the chosen argument
       is an lvalue.
--- 33569,33588 ----
       _Note:_ This builtin is only available for C.  This builtin can be
       used to call Go closures from C.
  
   -- Built-in Function: TYPE __builtin_choose_expr (CONST_EXP, EXP1,
            EXP2)
! 
!      You can use the built-in function '__builtin_choose_expr' to
       evaluate code depending on the value of a constant expression.
       This built-in function returns EXP1 if CONST_EXP, which is an
       integer constant expression, is nonzero.  Otherwise it returns
       EXP2.
  
!      This built-in function is analogous to the '? :' operator in C,
       except that the expression returned has its type unaltered by
!      promotion rules.  Also, the built-in function does not evaluate the
!      expression that is not chosen.  For example, if CONST_EXP evaluates
!      to true, EXP2 is not evaluated even if it has side-effects.
  
       This built-in function can return an lvalue if the chosen argument
       is an lvalue.
*************** and `isnan' built-in functions appear bo
*** 33974,34006 ****
       CONST_EXP) may still generate syntax errors.  This may change in
       future revisions.
  
- 
   -- Built-in Function: TYPE __builtin_complex (REAL, IMAG)
-      The built-in function `__builtin_complex' is provided for use in
-      implementing the ISO C11 macros `CMPLXF', `CMPLX' and `CMPLXL'.
-      REAL and IMAG must have the same type, a real binary
-      floating-point type, and the result has the corresponding complex
-      type with real and imaginary parts REAL and IMAG.  Unlike `REAL +
-      I * IMAG', this works even when infinities, NaNs and negative
-      zeros are involved.
  
  
   -- Built-in Function: int __builtin_constant_p (EXP)
!      You can use the built-in function `__builtin_constant_p' to
       determine if a value is known to be constant at compile time and
       hence that GCC can perform constant-folding on expressions
!      involving that value.  The argument of the function is the value
!      to test.  The function returns the integer 1 if the argument is
!      known to be a compile-time constant and 0 if it is not known to be
!      a compile-time constant.  A return of 0 does not indicate that the
!      value is _not_ a constant, but merely that GCC cannot prove it is
!      a constant with the specified value of the `-O' option.
  
       You typically use this function in an embedded application where
       memory is a critical resource.  If you have some complex
!      calculation, you may want it to be folded if it involves
!      constants, but need to call a function if it does not.  For
!      example:
  
            #define Scale_Value(X)      \
              (__builtin_constant_p (X) \
--- 33609,33638 ----
       CONST_EXP) may still generate syntax errors.  This may change in
       future revisions.
  
   -- Built-in Function: TYPE __builtin_complex (REAL, IMAG)
  
+      The built-in function '__builtin_complex' is provided for use in
+      implementing the ISO C11 macros 'CMPLXF', 'CMPLX' and 'CMPLXL'.
+      REAL and IMAG must have the same type, a real binary floating-point
+      type, and the result has the corresponding complex type with real
+      and imaginary parts REAL and IMAG.  Unlike 'REAL + I * IMAG', this
+      works even when infinities, NaNs and negative zeros are involved.
  
   -- Built-in Function: int __builtin_constant_p (EXP)
!      You can use the built-in function '__builtin_constant_p' to
       determine if a value is known to be constant at compile time and
       hence that GCC can perform constant-folding on expressions
!      involving that value.  The argument of the function is the value to
!      test.  The function returns the integer 1 if the argument is known
!      to be a compile-time constant and 0 if it is not known to be a
!      compile-time constant.  A return of 0 does not indicate that the
!      value is _not_ a constant, but merely that GCC cannot prove it is a
!      constant with the specified value of the '-O' option.
  
       You typically use this function in an embedded application where
       memory is a critical resource.  If you have some complex
!      calculation, you may want it to be folded if it involves constants,
!      but need to call a function if it does not.  For example:
  
            #define Scale_Value(X)      \
              (__builtin_constant_p (X) \
*************** and `isnan' built-in functions appear bo
*** 34012,34020 ****
       never returns 1 when you call the inline function with a string
       constant or compound literal (*note Compound Literals::) and does
       not return 1 when you pass a constant numeric value to the inline
!      function unless you specify the `-O' option.
  
!      You may also use `__builtin_constant_p' in initializers for static
       data.  For instance, you can write
  
            static const int table[] = {
--- 33644,33652 ----
       never returns 1 when you call the inline function with a string
       constant or compound literal (*note Compound Literals::) and does
       not return 1 when you pass a constant numeric value to the inline
!      function unless you specify the '-O' option.
  
!      You may also use '__builtin_constant_p' in initializers for static
       data.  For instance, you can write
  
            static const int table[] = {
*************** and `isnan' built-in functions appear bo
*** 34024,34043 ****
  
       This is an acceptable initializer even if EXPRESSION is not a
       constant expression, including the case where
!      `__builtin_constant_p' returns 1 because EXPRESSION can be folded
       to a constant but EXPRESSION contains operands that are not
!      otherwise permitted in a static initializer (for example, `0 &&
!      foo ()').  GCC must be more conservative about evaluating the
!      built-in in this case, because it has no opportunity to perform
       optimization.
  
   -- Built-in Function: long __builtin_expect (long EXP, long C)
!      You may use `__builtin_expect' to provide the compiler with branch
       prediction information.  In general, you should prefer to use
!      actual profile feedback for this (`-fprofile-arcs'), as
!      programmers are notoriously bad at predicting how their programs
!      actually perform.  However, there are applications in which this
!      data is hard to collect.
  
       The return value is the value of EXP, which should be an integral
       expression.  The semantics of the built-in are that it is expected
--- 33656,33675 ----
  
       This is an acceptable initializer even if EXPRESSION is not a
       constant expression, including the case where
!      '__builtin_constant_p' returns 1 because EXPRESSION can be folded
       to a constant but EXPRESSION contains operands that are not
!      otherwise permitted in a static initializer (for example, '0 && foo
!      ()').  GCC must be more conservative about evaluating the built-in
!      in this case, because it has no opportunity to perform
       optimization.
  
   -- Built-in Function: long __builtin_expect (long EXP, long C)
!      You may use '__builtin_expect' to provide the compiler with branch
       prediction information.  In general, you should prefer to use
!      actual profile feedback for this ('-fprofile-arcs'), as programmers
!      are notoriously bad at predicting how their programs actually
!      perform.  However, there are applications in which this data is
!      hard to collect.
  
       The return value is the value of EXP, which should be an integral
       expression.  The semantics of the built-in are that it is expected
*************** and `isnan' built-in functions appear bo
*** 34046,34054 ****
            if (__builtin_expect (x, 0))
              foo ();
  
!      indicates that we do not expect to call `foo', since we expect `x'
!      to be zero.  Since you are limited to integral expressions for
!      EXP, you should use constructions such as
  
            if (__builtin_expect (ptr != NULL, 1))
              foo (*ptr);
--- 33678,33686 ----
            if (__builtin_expect (x, 0))
              foo ();
  
!      indicates that we do not expect to call 'foo', since we expect 'x'
!      to be zero.  Since you are limited to integral expressions for EXP,
!      you should use constructions such as
  
            if (__builtin_expect (ptr != NULL, 1))
              foo (*ptr);
*************** and `isnan' built-in functions appear bo
*** 34059,34078 ****
       This function causes the program to exit abnormally.  GCC
       implements this function by using a target-dependent mechanism
       (such as intentionally executing an illegal instruction) or by
!      calling `abort'.  The mechanism used may vary from release to
       release so you should not rely on any particular implementation.
  
   -- Built-in Function: void __builtin_unreachable (void)
!      If control flow reaches the point of the `__builtin_unreachable',
       the program is undefined.  It is useful in situations where the
       compiler cannot deduce the unreachability of the code.
  
!      One such case is immediately following an `asm' statement that
       either never terminates, or one that transfers control elsewhere
       and never returns.  In this example, without the
!      `__builtin_unreachable', GCC issues a warning that control reaches
       the end of a non-void function.  It also generates code to return
!      after the `asm'.
  
            int f (int c, int v)
            {
--- 33691,33710 ----
       This function causes the program to exit abnormally.  GCC
       implements this function by using a target-dependent mechanism
       (such as intentionally executing an illegal instruction) or by
!      calling 'abort'.  The mechanism used may vary from release to
       release so you should not rely on any particular implementation.
  
   -- Built-in Function: void __builtin_unreachable (void)
!      If control flow reaches the point of the '__builtin_unreachable',
       the program is undefined.  It is useful in situations where the
       compiler cannot deduce the unreachability of the code.
  
!      One such case is immediately following an 'asm' statement that
       either never terminates, or one that transfers control elsewhere
       and never returns.  In this example, without the
!      '__builtin_unreachable', GCC issues a warning that control reaches
       the end of a non-void function.  It also generates code to return
!      after the 'asm'.
  
            int f (int c, int v)
            {
*************** and `isnan' built-in functions appear bo
*** 34087,34100 ****
                }
            }
  
!      Because the `asm' statement unconditionally transfers control out
       of the function, control never reaches the end of the function
!      body.  The `__builtin_unreachable' is in fact unreachable and
       communicates this fact to the compiler.
  
!      Another use for `__builtin_unreachable' is following a call a
       function that never returns but that is not declared
!      `__attribute__((noreturn))', as in this example:
  
            void function_that_never_returns (void);
  
--- 33719,33732 ----
                }
            }
  
!      Because the 'asm' statement unconditionally transfers control out
       of the function, control never reaches the end of the function
!      body.  The '__builtin_unreachable' is in fact unreachable and
       communicates this fact to the compiler.
  
!      Another use for '__builtin_unreachable' is following a call a
       function that never returns but that is not declared
!      '__attribute__((noreturn))', as in this example:
  
            void function_that_never_returns (void);
  
*************** and `isnan' built-in functions appear bo
*** 34111,34117 ****
                }
            }
  
- 
   -- Built-in Function: void *__builtin_assume_aligned (const void *EXP,
            size_t ALIGN, ...)
       This function returns its first argument, and allows the compiler
--- 33743,33748 ----
*************** and `isnan' built-in functions appear bo
*** 34122,34148 ****
  
            void *x = __builtin_assume_aligned (arg, 16);
  
!      means that the compiler can assume `x', set to `arg', is at least
       16-byte aligned, while:
  
            void *x = __builtin_assume_aligned (arg, 32, 8);
  
!      means that the compiler can assume for `x', set to `arg', that
!      `(char *) x - 8' is 32-byte aligned.
  
   -- Built-in Function: int __builtin_LINE ()
!      This function is the equivalent to the preprocessor `__LINE__'
       macro and returns the line number of the invocation of the
       built-in.  In a C++ default argument for a function F, it gets the
       line number of the call to F.
  
   -- Built-in Function: const char * __builtin_FUNCTION ()
!      This function is the equivalent to the preprocessor `__FUNCTION__'
       macro and returns the function name the invocation of the built-in
       is in.
  
   -- Built-in Function: const char * __builtin_FILE ()
!      This function is the equivalent to the preprocessor `__FILE__'
       macro and returns the file name the invocation of the built-in is
       in.  In a C++ default argument for a function F, it gets the file
       name of the call to F.
--- 33753,33779 ----
  
            void *x = __builtin_assume_aligned (arg, 16);
  
!      means that the compiler can assume 'x', set to 'arg', is at least
       16-byte aligned, while:
  
            void *x = __builtin_assume_aligned (arg, 32, 8);
  
!      means that the compiler can assume for 'x', set to 'arg', that
!      '(char *) x - 8' is 32-byte aligned.
  
   -- Built-in Function: int __builtin_LINE ()
!      This function is the equivalent to the preprocessor '__LINE__'
       macro and returns the line number of the invocation of the
       built-in.  In a C++ default argument for a function F, it gets the
       line number of the call to F.
  
   -- Built-in Function: const char * __builtin_FUNCTION ()
!      This function is the equivalent to the preprocessor '__FUNCTION__'
       macro and returns the function name the invocation of the built-in
       is in.
  
   -- Built-in Function: const char * __builtin_FILE ()
!      This function is the equivalent to the preprocessor '__FILE__'
       macro and returns the file name the invocation of the built-in is
       in.  In a C++ default argument for a function F, it gets the file
       name of the call to F.
*************** and `isnan' built-in functions appear bo
*** 34150,34170 ****
   -- Built-in Function: void __builtin___clear_cache (char *BEGIN, char
            *END)
       This function is used to flush the processor's instruction cache
!      for the region of memory between BEGIN inclusive and END
!      exclusive.  Some targets require that the instruction cache be
!      flushed, after modifying memory containing code, in order to obtain
!      deterministic behavior.
  
       If the target does not require instruction cache flushes,
!      `__builtin___clear_cache' has no effect.  Otherwise either
       instructions are emitted in-line to clear the instruction cache or
!      a call to the `__clear_cache' function in libgcc is made.
  
   -- Built-in Function: void __builtin_prefetch (const void *ADDR, ...)
!      This function is used to minimize cache-miss latency by moving
!      data into a cache before it is accessed.  You can insert calls to
!      `__builtin_prefetch' into code for which you know addresses of
!      data in memory that is likely to be accessed soon.  If the target
       supports them, data prefetch instructions are generated.  If the
       prefetch is done early enough before the access then the data will
       be in the cache by the time it is accessed.
--- 33781,33801 ----
   -- Built-in Function: void __builtin___clear_cache (char *BEGIN, char
            *END)
       This function is used to flush the processor's instruction cache
!      for the region of memory between BEGIN inclusive and END exclusive.
!      Some targets require that the instruction cache be flushed, after
!      modifying memory containing code, in order to obtain deterministic
!      behavior.
  
       If the target does not require instruction cache flushes,
!      '__builtin___clear_cache' has no effect.  Otherwise either
       instructions are emitted in-line to clear the instruction cache or
!      a call to the '__clear_cache' function in libgcc is made.
  
   -- Built-in Function: void __builtin_prefetch (const void *ADDR, ...)
!      This function is used to minimize cache-miss latency by moving data
!      into a cache before it is accessed.  You can insert calls to
!      '__builtin_prefetch' into code for which you know addresses of data
!      in memory that is likely to be accessed soon.  If the target
       supports them, data prefetch instructions are generated.  If the
       prefetch is done early enough before the access then the data will
       be in the cache by the time it is accessed.
*************** and `isnan' built-in functions appear bo
*** 34192,34199 ****
  
       Data prefetch does not generate faults if ADDR is invalid, but the
       address expression itself must be valid.  For example, a prefetch
!      of `p->next' does not fault if `p->next' is not a valid address,
!      but evaluation faults if `p' is not a valid address.
  
       If the target does not support data prefetch, the address
       expression is evaluated if it includes side effects but no other
--- 33823,33830 ----
  
       Data prefetch does not generate faults if ADDR is invalid, but the
       address expression itself must be valid.  For example, a prefetch
!      of 'p->next' does not fault if 'p->next' is not a valid address,
!      but evaluation faults if 'p' is not a valid address.
  
       If the target does not support data prefetch, the address
       expression is evaluated if it includes side effects but no other
*************** and `isnan' built-in functions appear bo
*** 34201,34214 ****
  
   -- Built-in Function: double __builtin_huge_val (void)
       Returns a positive infinity, if supported by the floating-point
!      format, else `DBL_MAX'.  This function is suitable for
!      implementing the ISO C macro `HUGE_VAL'.
  
   -- Built-in Function: float __builtin_huge_valf (void)
!      Similar to `__builtin_huge_val', except the return type is `float'.
  
   -- Built-in Function: long double __builtin_huge_vall (void)
!      Similar to `__builtin_huge_val', except the return type is `long
       double'.
  
   -- Built-in Function: int __builtin_fpclassify (int, int, int, int,
--- 33832,33845 ----
  
   -- Built-in Function: double __builtin_huge_val (void)
       Returns a positive infinity, if supported by the floating-point
!      format, else 'DBL_MAX'.  This function is suitable for implementing
!      the ISO C macro 'HUGE_VAL'.
  
   -- Built-in Function: float __builtin_huge_valf (void)
!      Similar to '__builtin_huge_val', except the return type is 'float'.
  
   -- Built-in Function: long double __builtin_huge_vall (void)
!      Similar to '__builtin_huge_val', except the return type is 'long
       double'.
  
   -- Built-in Function: int __builtin_fpclassify (int, int, int, int,
*************** and `isnan' built-in functions appear bo
*** 34216,34300 ****
       This built-in implements the C99 fpclassify functionality.  The
       first five int arguments should be the target library's notion of
       the possible FP classes and are used for return values.  They must
!      be constant values and they must appear in this order: `FP_NAN',
!      `FP_INFINITE', `FP_NORMAL', `FP_SUBNORMAL' and `FP_ZERO'.  The
       ellipsis is for exactly one floating-point value to classify.  GCC
       treats the last argument as type-generic, which means it does not
       do default promotion from float to double.
  
   -- Built-in Function: double __builtin_inf (void)
!      Similar to `__builtin_huge_val', except a warning is generated if
       the target floating-point format does not support infinities.
  
   -- Built-in Function: _Decimal32 __builtin_infd32 (void)
!      Similar to `__builtin_inf', except the return type is `_Decimal32'.
  
   -- Built-in Function: _Decimal64 __builtin_infd64 (void)
!      Similar to `__builtin_inf', except the return type is `_Decimal64'.
  
   -- Built-in Function: _Decimal128 __builtin_infd128 (void)
!      Similar to `__builtin_inf', except the return type is
!      `_Decimal128'.
  
   -- Built-in Function: float __builtin_inff (void)
!      Similar to `__builtin_inf', except the return type is `float'.
       This function is suitable for implementing the ISO C99 macro
!      `INFINITY'.
  
   -- Built-in Function: long double __builtin_infl (void)
!      Similar to `__builtin_inf', except the return type is `long
       double'.
  
   -- Built-in Function: int __builtin_isinf_sign (...)
!      Similar to `isinf', except the return value is -1 for an argument
!      of `-Inf' and 1 for an argument of `+Inf'.  Note while the
       parameter list is an ellipsis, this function only accepts exactly
       one floating-point argument.  GCC treats this parameter as
       type-generic, which means it does not do default promotion from
       float to double.
  
   -- Built-in Function: double __builtin_nan (const char *str)
!      This is an implementation of the ISO C99 function `nan'.
  
!      Since ISO C99 defines this function in terms of `strtod', which we
       do not implement, a description of the parsing is in order.  The
!      string is parsed as by `strtol'; that is, the base is recognized by
!      leading `0' or `0x' prefixes.  The number parsed is placed in the
!      significand such that the least significant bit of the number is
!      at the least significant bit of the significand.  The number is
       truncated to fit the significand field provided.  The significand
       is forced to be a quiet NaN.
  
       This function, if given a string literal all of which would have
!      been consumed by `strtol', is evaluated early enough that it is
       considered a compile-time constant.
  
   -- Built-in Function: _Decimal32 __builtin_nand32 (const char *str)
!      Similar to `__builtin_nan', except the return type is `_Decimal32'.
  
   -- Built-in Function: _Decimal64 __builtin_nand64 (const char *str)
!      Similar to `__builtin_nan', except the return type is `_Decimal64'.
  
   -- Built-in Function: _Decimal128 __builtin_nand128 (const char *str)
!      Similar to `__builtin_nan', except the return type is
!      `_Decimal128'.
  
   -- Built-in Function: float __builtin_nanf (const char *str)
!      Similar to `__builtin_nan', except the return type is `float'.
  
   -- Built-in Function: long double __builtin_nanl (const char *str)
!      Similar to `__builtin_nan', except the return type is `long
       double'.
  
   -- Built-in Function: double __builtin_nans (const char *str)
!      Similar to `__builtin_nan', except the significand is forced to be
!      a signaling NaN.  The `nans' function is proposed by WG14 N965.
  
   -- Built-in Function: float __builtin_nansf (const char *str)
!      Similar to `__builtin_nans', except the return type is `float'.
  
   -- Built-in Function: long double __builtin_nansl (const char *str)
!      Similar to `__builtin_nans', except the return type is `long
       double'.
  
   -- Built-in Function: int __builtin_ffs (int x)
--- 33847,33931 ----
       This built-in implements the C99 fpclassify functionality.  The
       first five int arguments should be the target library's notion of
       the possible FP classes and are used for return values.  They must
!      be constant values and they must appear in this order: 'FP_NAN',
!      'FP_INFINITE', 'FP_NORMAL', 'FP_SUBNORMAL' and 'FP_ZERO'.  The
       ellipsis is for exactly one floating-point value to classify.  GCC
       treats the last argument as type-generic, which means it does not
       do default promotion from float to double.
  
   -- Built-in Function: double __builtin_inf (void)
!      Similar to '__builtin_huge_val', except a warning is generated if
       the target floating-point format does not support infinities.
  
   -- Built-in Function: _Decimal32 __builtin_infd32 (void)
!      Similar to '__builtin_inf', except the return type is '_Decimal32'.
  
   -- Built-in Function: _Decimal64 __builtin_infd64 (void)
!      Similar to '__builtin_inf', except the return type is '_Decimal64'.
  
   -- Built-in Function: _Decimal128 __builtin_infd128 (void)
!      Similar to '__builtin_inf', except the return type is
!      '_Decimal128'.
  
   -- Built-in Function: float __builtin_inff (void)
!      Similar to '__builtin_inf', except the return type is 'float'.
       This function is suitable for implementing the ISO C99 macro
!      'INFINITY'.
  
   -- Built-in Function: long double __builtin_infl (void)
!      Similar to '__builtin_inf', except the return type is 'long
       double'.
  
   -- Built-in Function: int __builtin_isinf_sign (...)
!      Similar to 'isinf', except the return value is -1 for an argument
!      of '-Inf' and 1 for an argument of '+Inf'.  Note while the
       parameter list is an ellipsis, this function only accepts exactly
       one floating-point argument.  GCC treats this parameter as
       type-generic, which means it does not do default promotion from
       float to double.
  
   -- Built-in Function: double __builtin_nan (const char *str)
!      This is an implementation of the ISO C99 function 'nan'.
  
!      Since ISO C99 defines this function in terms of 'strtod', which we
       do not implement, a description of the parsing is in order.  The
!      string is parsed as by 'strtol'; that is, the base is recognized by
!      leading '0' or '0x' prefixes.  The number parsed is placed in the
!      significand such that the least significant bit of the number is at
!      the least significant bit of the significand.  The number is
       truncated to fit the significand field provided.  The significand
       is forced to be a quiet NaN.
  
       This function, if given a string literal all of which would have
!      been consumed by 'strtol', is evaluated early enough that it is
       considered a compile-time constant.
  
   -- Built-in Function: _Decimal32 __builtin_nand32 (const char *str)
!      Similar to '__builtin_nan', except the return type is '_Decimal32'.
  
   -- Built-in Function: _Decimal64 __builtin_nand64 (const char *str)
!      Similar to '__builtin_nan', except the return type is '_Decimal64'.
  
   -- Built-in Function: _Decimal128 __builtin_nand128 (const char *str)
!      Similar to '__builtin_nan', except the return type is
!      '_Decimal128'.
  
   -- Built-in Function: float __builtin_nanf (const char *str)
!      Similar to '__builtin_nan', except the return type is 'float'.
  
   -- Built-in Function: long double __builtin_nanl (const char *str)
!      Similar to '__builtin_nan', except the return type is 'long
       double'.
  
   -- Built-in Function: double __builtin_nans (const char *str)
!      Similar to '__builtin_nan', except the significand is forced to be
!      a signaling NaN.  The 'nans' function is proposed by WG14 N965.
  
   -- Built-in Function: float __builtin_nansf (const char *str)
!      Similar to '__builtin_nans', except the return type is 'float'.
  
   -- Built-in Function: long double __builtin_nansl (const char *str)
!      Similar to '__builtin_nans', except the return type is 'long
       double'.
  
   -- Built-in Function: int __builtin_ffs (int x)
*************** and `isnan' built-in functions appear bo
*** 34321,34394 ****
       Returns the parity of X, i.e. the number of 1-bits in X modulo 2.
  
   -- Built-in Function: int __builtin_ffsl (long)
!      Similar to `__builtin_ffs', except the argument type is `long'.
  
   -- Built-in Function: int __builtin_clzl (unsigned long)
!      Similar to `__builtin_clz', except the argument type is `unsigned
       long'.
  
   -- Built-in Function: int __builtin_ctzl (unsigned long)
!      Similar to `__builtin_ctz', except the argument type is `unsigned
       long'.
  
   -- Built-in Function: int __builtin_clrsbl (long)
!      Similar to `__builtin_clrsb', except the argument type is `long'.
  
   -- Built-in Function: int __builtin_popcountl (unsigned long)
!      Similar to `__builtin_popcount', except the argument type is
!      `unsigned long'.
  
   -- Built-in Function: int __builtin_parityl (unsigned long)
!      Similar to `__builtin_parity', except the argument type is
!      `unsigned long'.
  
   -- Built-in Function: int __builtin_ffsll (long long)
!      Similar to `__builtin_ffs', except the argument type is `long
       long'.
  
   -- Built-in Function: int __builtin_clzll (unsigned long long)
!      Similar to `__builtin_clz', except the argument type is `unsigned
       long long'.
  
   -- Built-in Function: int __builtin_ctzll (unsigned long long)
!      Similar to `__builtin_ctz', except the argument type is `unsigned
       long long'.
  
   -- Built-in Function: int __builtin_clrsbll (long long)
!      Similar to `__builtin_clrsb', except the argument type is `long
       long'.
  
   -- Built-in Function: int __builtin_popcountll (unsigned long long)
!      Similar to `__builtin_popcount', except the argument type is
!      `unsigned long long'.
  
   -- Built-in Function: int __builtin_parityll (unsigned long long)
!      Similar to `__builtin_parity', except the argument type is
!      `unsigned long long'.
  
   -- Built-in Function: double __builtin_powi (double, int)
       Returns the first argument raised to the power of the second.
!      Unlike the `pow' function no guarantees about precision and
       rounding are made.
  
   -- Built-in Function: float __builtin_powif (float, int)
!      Similar to `__builtin_powi', except the argument and return types
!      are `float'.
  
   -- Built-in Function: long double __builtin_powil (long double, int)
!      Similar to `__builtin_powi', except the argument and return types
!      are `long double'.
  
   -- Built-in Function: uint16_t __builtin_bswap16 (uint16_t x)
       Returns X with the order of the bytes reversed; for example,
!      `0xaabb' becomes `0xbbaa'.  Byte here always means exactly 8 bits.
  
   -- Built-in Function: uint32_t __builtin_bswap32 (uint32_t x)
!      Similar to `__builtin_bswap16', except the argument and return
       types are 32 bit.
  
   -- Built-in Function: uint64_t __builtin_bswap64 (uint64_t x)
!      Similar to `__builtin_bswap32', except the argument and return
       types are 64 bit.
  
  
--- 33952,34025 ----
       Returns the parity of X, i.e. the number of 1-bits in X modulo 2.
  
   -- Built-in Function: int __builtin_ffsl (long)
!      Similar to '__builtin_ffs', except the argument type is 'long'.
  
   -- Built-in Function: int __builtin_clzl (unsigned long)
!      Similar to '__builtin_clz', except the argument type is 'unsigned
       long'.
  
   -- Built-in Function: int __builtin_ctzl (unsigned long)
!      Similar to '__builtin_ctz', except the argument type is 'unsigned
       long'.
  
   -- Built-in Function: int __builtin_clrsbl (long)
!      Similar to '__builtin_clrsb', except the argument type is 'long'.
  
   -- Built-in Function: int __builtin_popcountl (unsigned long)
!      Similar to '__builtin_popcount', except the argument type is
!      'unsigned long'.
  
   -- Built-in Function: int __builtin_parityl (unsigned long)
!      Similar to '__builtin_parity', except the argument type is
!      'unsigned long'.
  
   -- Built-in Function: int __builtin_ffsll (long long)
!      Similar to '__builtin_ffs', except the argument type is 'long
       long'.
  
   -- Built-in Function: int __builtin_clzll (unsigned long long)
!      Similar to '__builtin_clz', except the argument type is 'unsigned
       long long'.
  
   -- Built-in Function: int __builtin_ctzll (unsigned long long)
!      Similar to '__builtin_ctz', except the argument type is 'unsigned
       long long'.
  
   -- Built-in Function: int __builtin_clrsbll (long long)
!      Similar to '__builtin_clrsb', except the argument type is 'long
       long'.
  
   -- Built-in Function: int __builtin_popcountll (unsigned long long)
!      Similar to '__builtin_popcount', except the argument type is
!      'unsigned long long'.
  
   -- Built-in Function: int __builtin_parityll (unsigned long long)
!      Similar to '__builtin_parity', except the argument type is
!      'unsigned long long'.
  
   -- Built-in Function: double __builtin_powi (double, int)
       Returns the first argument raised to the power of the second.
!      Unlike the 'pow' function no guarantees about precision and
       rounding are made.
  
   -- Built-in Function: float __builtin_powif (float, int)
!      Similar to '__builtin_powi', except the argument and return types
!      are 'float'.
  
   -- Built-in Function: long double __builtin_powil (long double, int)
!      Similar to '__builtin_powi', except the argument and return types
!      are 'long double'.
  
   -- Built-in Function: uint16_t __builtin_bswap16 (uint16_t x)
       Returns X with the order of the bytes reversed; for example,
!      '0xaabb' becomes '0xbbaa'.  Byte here always means exactly 8 bits.
  
   -- Built-in Function: uint32_t __builtin_bswap32 (uint32_t x)
!      Similar to '__builtin_bswap16', except the argument and return
       types are 32 bit.
  
   -- Built-in Function: uint64_t __builtin_bswap64 (uint64_t x)
!      Similar to '__builtin_bswap32', except the argument and return
       types are 64 bit.
  
  
*************** generate the machine instruction that is
*** 34489,34497 ****
       long __builtin_alpha_zap (long, long)
       long __builtin_alpha_zapnot (long, long)
  
!  The following built-in functions are always with `-mmax' or
! `-mcpu=CPU' where CPU is `pca56' or later.  They all generate the
! machine instruction that is part of the name.
  
       long __builtin_alpha_pklb (long)
       long __builtin_alpha_pkwb (long)
--- 34120,34128 ----
       long __builtin_alpha_zap (long, long)
       long __builtin_alpha_zapnot (long, long)
  
!  The following built-in functions are always with '-mmax' or '-mcpu=CPU'
! where CPU is 'pca56' or later.  They all generate the machine
! instruction that is part of the name.
  
       long __builtin_alpha_pklb (long)
       long __builtin_alpha_pkwb (long)
*************** machine instruction that is part of the
*** 34507,34524 ****
       long __builtin_alpha_maxsw4 (long, long)
       long __builtin_alpha_perr (long, long)
  
!  The following built-in functions are always with `-mcix' or
! `-mcpu=CPU' where CPU is `ev67' or later.  They all generate the
! machine instruction that is part of the name.
  
       long __builtin_alpha_cttz (long)
       long __builtin_alpha_ctlz (long)
       long __builtin_alpha_ctpop (long)
  
   The following built-in functions are available on systems that use the
! OSF/1 PALcode.  Normally they invoke the `rduniq' and `wruniq' PAL
! calls, but when invoked with `-mtls-kernel', they invoke `rdval' and
! `wrval'.
  
       void *__builtin_thread_pointer (void)
       void __builtin_set_thread_pointer (void *)
--- 34138,34155 ----
       long __builtin_alpha_maxsw4 (long, long)
       long __builtin_alpha_perr (long, long)
  
!  The following built-in functions are always with '-mcix' or '-mcpu=CPU'
! where CPU is 'ev67' or later.  They all generate the machine instruction
! that is part of the name.
  
       long __builtin_alpha_cttz (long)
       long __builtin_alpha_ctlz (long)
       long __builtin_alpha_ctpop (long)
  
   The following built-in functions are available on systems that use the
! OSF/1 PALcode.  Normally they invoke the 'rduniq' and 'wruniq' PAL
! calls, but when invoked with '-mtls-kernel', they invoke 'rdval' and
! 'wrval'.
  
       void *__builtin_thread_pointer (void)
       void __builtin_set_thread_pointer (void *)
*************** generate the machine instruction that is
*** 34548,34573 ****
       void __builtin_wrctl (int, int)
  
   The following built-in functions are always available.  They all
! generate a Nios II Custom Instruction. The name of the function
! represents the types that the function takes and returns. The letter
! before the `n' is the return type or void if absent. The `n' represents
  the first parameter to all the custom instructions, the custom
! instruction number.  The two letters after the `n' represent the up to
  two parameters to the function.
  
   The letters represent the following data types:
! `<no letter>'
!      `void' for return type and no parameter for parameter types.
! 
! `i'
!      `int' for return type and parameter type
  
! `f'
!      `float' for return type and parameter type
  
! `p'
!      `void *' for return type and parameter type
  
  
   And the function names are:
       void __builtin_custom_n (void)
--- 34179,34203 ----
       void __builtin_wrctl (int, int)
  
   The following built-in functions are always available.  They all
! generate a Nios II Custom Instruction.  The name of the function
! represents the types that the function takes and returns.  The letter
! before the 'n' is the return type or void if absent.  The 'n' represents
  the first parameter to all the custom instructions, the custom
! instruction number.  The two letters after the 'n' represent the up to
  two parameters to the function.
  
   The letters represent the following data types:
! '<no letter>'
!      'void' for return type and no parameter for parameter types.
  
! 'i'
!      'int' for return type and parameter type
  
! 'f'
!      'float' for return type and parameter type
  
+ 'p'
+      'void *' for return type and parameter type
  
   And the function names are:
       void __builtin_custom_n (void)
*************** generated to ensure this is true, but fo
*** 34637,34643 ****
  in each case.
  
   _Note:_ Using a built-in to generate an instruction not supported by a
! target may cause problems. At present the compiler is not guaranteed to
  detect such misuse, and as a result an internal compiler error may be
  generated.
  
--- 34267,34273 ----
  in each case.
  
   _Note:_ Using a built-in to generate an instruction not supported by a
! target may cause problems.  At present the compiler is not guaranteed to
  detect such misuse, and as a result an internal compiler error may be
  generated.
  
*************** generated.
*** 34670,34676 ****
            mov  rREGNO, VAL
  
   -- Built-in Function: int __builtin_arc_divaw (int A, int B)
!      Only available if either `-mcpu=ARC700' or `-meA' is set.
       Generates:
            divaw  DEST, A, B
       where the value in DEST will be the result returned from the
--- 34300,34306 ----
            mov  rREGNO, VAL
  
   -- Built-in Function: int __builtin_arc_divaw (int A, int B)
!      Only available if either '-mcpu=ARC700' or '-meA' is set.
       Generates:
            divaw  DEST, A, B
       where the value in DEST will be the result returned from the
*************** generated.
*** 34681,34699 ****
            flag  A
  
   -- Built-in Function: unsigned int __builtin_arc_lr (unsigned int AUXR)
!      The operand, AUXV, is the address of an auxiliary register and
!      must be a compile time constant.  Generates:
            lr  DEST, [AUXR]
       Where the value in DEST will be the result returned from the
       built-in.
  
   -- Built-in Function: void __builtin_arc_mul64 (int A, int B)
!      Only available with `-mmul64'.  Generates:
            mul64  A, B
  
   -- Built-in Function: void __builtin_arc_mulu64 (unsigned int A,
            unsigned int B)
!      Only available with `-mmul64'.  Generates:
            mulu64  A, B
  
   -- Built-in Function: void __builtin_arc_nop (void)
--- 34311,34329 ----
            flag  A
  
   -- Built-in Function: unsigned int __builtin_arc_lr (unsigned int AUXR)
!      The operand, AUXV, is the address of an auxiliary register and must
!      be a compile time constant.  Generates:
            lr  DEST, [AUXR]
       Where the value in DEST will be the result returned from the
       built-in.
  
   -- Built-in Function: void __builtin_arc_mul64 (int A, int B)
!      Only available with '-mmul64'.  Generates:
            mul64  A, B
  
   -- Built-in Function: void __builtin_arc_mulu64 (unsigned int A,
            unsigned int B)
!      Only available with '-mmul64'.  Generates:
            mulu64  A, B
  
   -- Built-in Function: void __builtin_arc_nop (void)
*************** generated.
*** 34701,34715 ****
            nop
  
   -- Built-in Function: int __builtin_arc_norm (int SRC)
!      Only valid if the `norm' instruction is available through the
!      `-mnorm' option or by default with `-mcpu=ARC700'.  Generates:
            norm  DEST, SRC
       Where the value in DEST will be the result returned from the
       built-in.
  
   -- Built-in Function: short int __builtin_arc_normw (short int SRC)
!      Only valid if the `normw' instruction is available through the
!      `-mnorm' option or by default with `-mcpu=ARC700'.  Generates:
            normw  DEST, SRC
       Where the value in DEST will be the result returned from the
       built-in.
--- 34331,34345 ----
            nop
  
   -- Built-in Function: int __builtin_arc_norm (int SRC)
!      Only valid if the 'norm' instruction is available through the
!      '-mnorm' option or by default with '-mcpu=ARC700'.  Generates:
            norm  DEST, SRC
       Where the value in DEST will be the result returned from the
       built-in.
  
   -- Built-in Function: short int __builtin_arc_normw (short int SRC)
!      Only valid if the 'normw' instruction is available through the
!      '-mnorm' option or by default with '-mcpu=ARC700'.  Generates:
            normw  DEST, SRC
       Where the value in DEST will be the result returned from the
       built-in.
*************** generated.
*** 34730,34736 ****
            sr  AUXR, [VAL]
  
   -- Built-in Function: int __builtin_arc_swap (int SRC)
!      Only valid with `-mswap'.  Generates:
            swap  DEST, SRC
       Where the value in DEST will be the result returned from the
       built-in.
--- 34360,34366 ----
            sr  AUXR, [VAL]
  
   -- Built-in Function: int __builtin_arc_swap (int SRC)
!      Only valid with '-mswap'.  Generates:
            swap  DEST, SRC
       Where the value in DEST will be the result returned from the
       built-in.
*************** generated.
*** 34740,34760 ****
            swi
  
   -- Built-in Function: void __builtin_arc_sync (void)
!      Only available with `-mcpu=ARC700'.  Generates:
            sync
  
   -- Built-in Function: void __builtin_arc_trap_s (unsigned int C)
!      Only available with `-mcpu=ARC700'.  Generates:
            trap_s  C
  
   -- Built-in Function: void __builtin_arc_unimp_s (void)
!      Only available with `-mcpu=ARC700'.  Generates:
            unimp_s
  
!  The instructions generated by the following builtins are not
! considered as candidates for scheduling.  They are not moved around by
! the compiler during scheduling, and thus can be expected to appear
! where they are put in the C code:
       __builtin_arc_brk()
       __builtin_arc_core_read()
       __builtin_arc_core_write()
--- 34370,34390 ----
            swi
  
   -- Built-in Function: void __builtin_arc_sync (void)
!      Only available with '-mcpu=ARC700'.  Generates:
            sync
  
   -- Built-in Function: void __builtin_arc_trap_s (unsigned int C)
!      Only available with '-mcpu=ARC700'.  Generates:
            trap_s  C
  
   -- Built-in Function: void __builtin_arc_unimp_s (void)
!      Only available with '-mcpu=ARC700'.  Generates:
            unimp_s
  
!  The instructions generated by the following builtins are not considered
! as candidates for scheduling.  They are not moved around by the compiler
! during scheduling, and thus can be expected to appear where they are put
! in the C code:
       __builtin_arc_brk()
       __builtin_arc_core_read()
       __builtin_arc_core_write()
*************** File: gcc.info,  Node: ARC SIMD Built-in
*** 34772,34799 ****
  
  SIMD builtins provided by the compiler can be used to generate the
  vector instructions.  This section describes the available builtins and
! their usage in programs.  With the `-msimd' option, the compiler
  provides 128-bit vector types, which can be specified using the
! `vector_size' attribute.  The header file `arc-simd.h' can be included
  to use the following predefined types:
       typedef int __v4si   __attribute__((vector_size(16)));
       typedef short __v8hi __attribute__((vector_size(16)));
  
   These types can be used to define 128-bit variables.  The built-in
! functions listed in the following section can be used on these
! variables to generate the vector operations.
  
!  For all builtins, `__builtin_arc_SOMEINSN', the header file
! `arc-simd.h' also provides equivalent macros called `_SOMEINSN' that
! can be used for programming ease and improved readability.  The
! following macros for DMA control are also provided:
       #define _setup_dma_in_channel_reg _vdiwr
       #define _setup_dma_out_channel_reg _vdowr
  
!  The following is a complete list of all the SIMD built-ins provided
! for ARC, grouped by calling signature.
  
!  The following take two `__v8hi' arguments and return a `__v8hi' result:
       __v8hi __builtin_arc_vaddaw (__v8hi, __v8hi)
       __v8hi __builtin_arc_vaddw (__v8hi, __v8hi)
       __v8hi __builtin_arc_vand (__v8hi, __v8hi)
--- 34402,34429 ----
  
  SIMD builtins provided by the compiler can be used to generate the
  vector instructions.  This section describes the available builtins and
! their usage in programs.  With the '-msimd' option, the compiler
  provides 128-bit vector types, which can be specified using the
! 'vector_size' attribute.  The header file 'arc-simd.h' can be included
  to use the following predefined types:
       typedef int __v4si   __attribute__((vector_size(16)));
       typedef short __v8hi __attribute__((vector_size(16)));
  
   These types can be used to define 128-bit variables.  The built-in
! functions listed in the following section can be used on these variables
! to generate the vector operations.
  
!  For all builtins, '__builtin_arc_SOMEINSN', the header file
! 'arc-simd.h' also provides equivalent macros called '_SOMEINSN' that can
! be used for programming ease and improved readability.  The following
! macros for DMA control are also provided:
       #define _setup_dma_in_channel_reg _vdiwr
       #define _setup_dma_out_channel_reg _vdowr
  
!  The following is a complete list of all the SIMD built-ins provided for
! ARC, grouped by calling signature.
  
!  The following take two '__v8hi' arguments and return a '__v8hi' result:
       __v8hi __builtin_arc_vaddaw (__v8hi, __v8hi)
       __v8hi __builtin_arc_vaddw (__v8hi, __v8hi)
       __v8hi __builtin_arc_vand (__v8hi, __v8hi)
*************** for ARC, grouped by calling signature.
*** 34843,34850 ****
       __v8hi __builtin_arc_vxor (__v8hi, __v8hi)
       __v8hi __builtin_arc_vxoraw (__v8hi, __v8hi)
  
!  The following take one `__v8hi' and one `int' argument and return a
! `__v8hi' result:
  
       __v8hi __builtin_arc_vbaddw (__v8hi, int)
       __v8hi __builtin_arc_vbmaxw (__v8hi, int)
--- 34473,34480 ----
       __v8hi __builtin_arc_vxor (__v8hi, __v8hi)
       __v8hi __builtin_arc_vxoraw (__v8hi, __v8hi)
  
!  The following take one '__v8hi' and one 'int' argument and return a
! '__v8hi' result:
  
       __v8hi __builtin_arc_vbaddw (__v8hi, int)
       __v8hi __builtin_arc_vbmaxw (__v8hi, int)
*************** for ARC, grouped by calling signature.
*** 34855,34869 ****
       __v8hi __builtin_arc_vbrsubw (__v8hi, int)
       __v8hi __builtin_arc_vbsubw (__v8hi, int)
  
!  The following take one `__v8hi' argument and one `int' argument which
  must be a 3-bit compile time constant indicating a register number
! I0-I7.  They return a `__v8hi' result.
       __v8hi __builtin_arc_vasrw (__v8hi, const int)
       __v8hi __builtin_arc_vsr8 (__v8hi, const int)
       __v8hi __builtin_arc_vsr8aw (__v8hi, const int)
  
!  The following take one `__v8hi' argument and one `int' argument which
! must be a 6-bit compile time constant.  They return a `__v8hi' result.
       __v8hi __builtin_arc_vasrpwbi (__v8hi, const int)
       __v8hi __builtin_arc_vasrrpwbi (__v8hi, const int)
       __v8hi __builtin_arc_vasrrwi (__v8hi, const int)
--- 34485,34499 ----
       __v8hi __builtin_arc_vbrsubw (__v8hi, int)
       __v8hi __builtin_arc_vbsubw (__v8hi, int)
  
!  The following take one '__v8hi' argument and one 'int' argument which
  must be a 3-bit compile time constant indicating a register number
! I0-I7.  They return a '__v8hi' result.
       __v8hi __builtin_arc_vasrw (__v8hi, const int)
       __v8hi __builtin_arc_vsr8 (__v8hi, const int)
       __v8hi __builtin_arc_vsr8aw (__v8hi, const int)
  
!  The following take one '__v8hi' argument and one 'int' argument which
! must be a 6-bit compile time constant.  They return a '__v8hi' result.
       __v8hi __builtin_arc_vasrpwbi (__v8hi, const int)
       __v8hi __builtin_arc_vasrrpwbi (__v8hi, const int)
       __v8hi __builtin_arc_vasrrwi (__v8hi, const int)
*************** must be a 6-bit compile time constant.
*** 34872,34891 ****
       __v8hi __builtin_arc_vsr8awi (__v8hi, const int)
       __v8hi __builtin_arc_vsr8i (__v8hi, const int)
  
!  The following take one `__v8hi' argument and one `int' argument which
! must be a 8-bit compile time constant.  They return a `__v8hi' result.
       __v8hi __builtin_arc_vd6tapf (__v8hi, const int)
       __v8hi __builtin_arc_vmvaw (__v8hi, const int)
       __v8hi __builtin_arc_vmvw (__v8hi, const int)
       __v8hi __builtin_arc_vmvzw (__v8hi, const int)
  
!  The following take two `int' arguments, the second of which which must
! be a 8-bit compile time constant.  They return a `__v8hi' result:
       __v8hi __builtin_arc_vmovaw (int, const int)
       __v8hi __builtin_arc_vmovw (int, const int)
       __v8hi __builtin_arc_vmovzw (int, const int)
  
!  The following take a single `__v8hi' argument and return a `__v8hi'
  result:
       __v8hi __builtin_arc_vabsaw (__v8hi)
       __v8hi __builtin_arc_vabsw (__v8hi)
--- 34502,34521 ----
       __v8hi __builtin_arc_vsr8awi (__v8hi, const int)
       __v8hi __builtin_arc_vsr8i (__v8hi, const int)
  
!  The following take one '__v8hi' argument and one 'int' argument which
! must be a 8-bit compile time constant.  They return a '__v8hi' result.
       __v8hi __builtin_arc_vd6tapf (__v8hi, const int)
       __v8hi __builtin_arc_vmvaw (__v8hi, const int)
       __v8hi __builtin_arc_vmvw (__v8hi, const int)
       __v8hi __builtin_arc_vmvzw (__v8hi, const int)
  
!  The following take two 'int' arguments, the second of which which must
! be a 8-bit compile time constant.  They return a '__v8hi' result:
       __v8hi __builtin_arc_vmovaw (int, const int)
       __v8hi __builtin_arc_vmovw (int, const int)
       __v8hi __builtin_arc_vmovzw (int, const int)
  
!  The following take a single '__v8hi' argument and return a '__v8hi'
  result:
       __v8hi __builtin_arc_vabsaw (__v8hi)
       __v8hi __builtin_arc_vabsw (__v8hi)
*************** result:
*** 34899,34936 ****
       __v8hi __builtin_arc_vupsbaw (__v8hi)
       __v8hi __builtin_arc_vupsbw (__v8hi)
  
!  The following take two `int' arguments and return no result:
       void __builtin_arc_vdirun (int, int)
       void __builtin_arc_vdorun (int, int)
  
!  The following take two `int' arguments and return no result.  The
! first argument must a 3-bit compile time constant indicating one of the
  DR0-DR7 DMA setup channels:
       void __builtin_arc_vdiwr (const int, int)
       void __builtin_arc_vdowr (const int, int)
  
!  The following take an `int' argument and return no result:
       void __builtin_arc_vendrec (int)
       void __builtin_arc_vrec (int)
       void __builtin_arc_vrecrun (int)
       void __builtin_arc_vrun (int)
  
!  The following take a `__v8hi' argument and two `int' arguments and
! return a `__v8hi' result.  The second argument must be a 3-bit compile
  time constants, indicating one the registers I0-I7, and the third
  argument must be an 8-bit compile time constant.
  
   _Note:_ Although the equivalent hardware instructions do not take an
  SIMD register as an operand, these builtins overwrite the relevant bits
! of the `__v8hi' register provided as the first argument with the value
! loaded from the `[Ib, u8]' location in the SDM.
  
       __v8hi __builtin_arc_vld32 (__v8hi, const int, const int)
       __v8hi __builtin_arc_vld32wh (__v8hi, const int, const int)
       __v8hi __builtin_arc_vld32wl (__v8hi, const int, const int)
       __v8hi __builtin_arc_vld64 (__v8hi, const int, const int)
  
!  The following take two `int' arguments and return a `__v8hi' result.
  The first argument must be a 3-bit compile time constants, indicating
  one the registers I0-I7, and the second argument must be an 8-bit
  compile time constant.
--- 34529,34566 ----
       __v8hi __builtin_arc_vupsbaw (__v8hi)
       __v8hi __builtin_arc_vupsbw (__v8hi)
  
!  The following take two 'int' arguments and return no result:
       void __builtin_arc_vdirun (int, int)
       void __builtin_arc_vdorun (int, int)
  
!  The following take two 'int' arguments and return no result.  The first
! argument must a 3-bit compile time constant indicating one of the
  DR0-DR7 DMA setup channels:
       void __builtin_arc_vdiwr (const int, int)
       void __builtin_arc_vdowr (const int, int)
  
!  The following take an 'int' argument and return no result:
       void __builtin_arc_vendrec (int)
       void __builtin_arc_vrec (int)
       void __builtin_arc_vrecrun (int)
       void __builtin_arc_vrun (int)
  
!  The following take a '__v8hi' argument and two 'int' arguments and
! return a '__v8hi' result.  The second argument must be a 3-bit compile
  time constants, indicating one the registers I0-I7, and the third
  argument must be an 8-bit compile time constant.
  
   _Note:_ Although the equivalent hardware instructions do not take an
  SIMD register as an operand, these builtins overwrite the relevant bits
! of the '__v8hi' register provided as the first argument with the value
! loaded from the '[Ib, u8]' location in the SDM.
  
       __v8hi __builtin_arc_vld32 (__v8hi, const int, const int)
       __v8hi __builtin_arc_vld32wh (__v8hi, const int, const int)
       __v8hi __builtin_arc_vld32wl (__v8hi, const int, const int)
       __v8hi __builtin_arc_vld64 (__v8hi, const int, const int)
  
!  The following take two 'int' arguments and return a '__v8hi' result.
  The first argument must be a 3-bit compile time constants, indicating
  one the registers I0-I7, and the second argument must be an 8-bit
  compile time constant.
*************** compile time constant.
*** 34938,34944 ****
       __v8hi __builtin_arc_vld128 (const int, const int)
       __v8hi __builtin_arc_vld64w (const int, const int)
  
!  The following take a `__v8hi' argument and two `int' arguments and
  return no result.  The second argument must be a 3-bit compile time
  constants, indicating one the registers I0-I7, and the third argument
  must be an 8-bit compile time constant.
--- 34568,34574 ----
       __v8hi __builtin_arc_vld128 (const int, const int)
       __v8hi __builtin_arc_vld64w (const int, const int)
  
!  The following take a '__v8hi' argument and two 'int' arguments and
  return no result.  The second argument must be a 3-bit compile time
  constants, indicating one the registers I0-I7, and the third argument
  must be an 8-bit compile time constant.
*************** must be an 8-bit compile time constant.
*** 34946,34952 ****
       void __builtin_arc_vst128 (__v8hi, const int, const int)
       void __builtin_arc_vst64 (__v8hi, const int, const int)
  
!  The following take a `__v8hi' argument and three `int' arguments and
  return no result.  The second argument must be a 3-bit compile-time
  constant, identifying the 16-bit sub-register to be stored, the third
  argument must be a 3-bit compile time constants, indicating one the
--- 34576,34582 ----
       void __builtin_arc_vst128 (__v8hi, const int, const int)
       void __builtin_arc_vst64 (__v8hi, const int, const int)
  
!  The following take a '__v8hi' argument and three 'int' arguments and
  return no result.  The second argument must be a 3-bit compile-time
  constant, identifying the 16-bit sub-register to be stored, the third
  argument must be a 3-bit compile time constants, indicating one the
*************** File: gcc.info,  Node: ARM iWMMXt Built-
*** 34963,34969 ****
  ------------------------------------
  
  These built-in functions are available for the ARM family of processors
! when the `-mcpu=iwmmxt' switch is used:
  
       typedef int v2si __attribute__ ((vector_size (8)));
       typedef short v4hi __attribute__ ((vector_size (8)));
--- 34593,34599 ----
  ------------------------------------
  
  These built-in functions are available for the ARM family of processors
! when the '-mcpu=iwmmxt' switch is used:
  
       typedef int v2si __attribute__ ((vector_size (8)));
       typedef short v4hi __attribute__ ((vector_size (8)));
*************** File: gcc.info,  Node: ARM C Language Ex
*** 35118,35137 ****
  
  GCC implements extensions for C as described in the ARM C Language
  Extensions (ACLE) specification, which can be found at
! `http://infocenter.arm.com/help/topic/com.arm.doc.ihi0053c/IHI0053C_acle_2_0.pdf'.
  
   As a part of ACLE, GCC implements extensions for Advanced SIMD as
  described in the ARM C Language Extensions Specification.  The complete
  list of Advanced SIMD intrinsics can be found at
! `http://infocenter.arm.com/help/topic/com.arm.doc.ihi0073a/IHI0073A_arm_neon_intrinsics_ref.pdf'.
  The built-in intrinsics for the Advanced SIMD extension are available
  when NEON is enabled.
  
   Currently, ARM and AArch64 back ends do not support ACLE 2.0 fully.
! Both back ends support CRC32 intrinsics from `arm_acle.h'.  The ARM
! back end's 16-bit floating-point Advanced SIMD intrinsics currently
! comply to ACLE v1.1.  AArch64's back end does not have support for
! 16-bit floating point Advanced SIMD intrinsics yet.
  
   See *note ARM Options:: and *note AArch64 Options:: for more
  information on the availability of extensions.
--- 34748,34767 ----
  
  GCC implements extensions for C as described in the ARM C Language
  Extensions (ACLE) specification, which can be found at
! <http://infocenter.arm.com/help/topic/com.arm.doc.ihi0053c/IHI0053C_acle_2_0.pdf>.
  
   As a part of ACLE, GCC implements extensions for Advanced SIMD as
  described in the ARM C Language Extensions Specification.  The complete
  list of Advanced SIMD intrinsics can be found at
! <http://infocenter.arm.com/help/topic/com.arm.doc.ihi0073a/IHI0073A_arm_neon_intrinsics_ref.pdf>.
  The built-in intrinsics for the Advanced SIMD extension are available
  when NEON is enabled.
  
   Currently, ARM and AArch64 back ends do not support ACLE 2.0 fully.
! Both back ends support CRC32 intrinsics from 'arm_acle.h'.  The ARM back
! end's 16-bit floating-point Advanced SIMD intrinsics currently comply to
! ACLE v1.1.  AArch64's back end does not have support for 16-bit floating
! point Advanced SIMD intrinsics yet.
  
   See *note ARM Options:: and *note AArch64 Options:: for more
  information on the availability of extensions.
*************** File: gcc.info,  Node: AVR Built-in Func
*** 35154,35168 ****
  6.58.9 AVR Built-in Functions
  -----------------------------
  
! For each built-in function for AVR, there is an equally named,
! uppercase built-in macro defined. That way users can easily query if or
! if not a specific built-in is implemented or not. For example, if
! `__builtin_avr_nop' is available the macro `__BUILTIN_AVR_NOP' is
! defined to `1' and undefined otherwise.
  
   The following built-in functions map to the respective machine
! instruction, i.e. `nop', `sei', `cli', `sleep', `wdr', `swap', `fmul',
! `fmuls' resp. `fmulsu'. The three `fmul*' built-ins are implemented as
  library call if no hardware multiplier is available.
  
       void __builtin_avr_nop (void)
--- 34784,34798 ----
  6.58.9 AVR Built-in Functions
  -----------------------------
  
! For each built-in function for AVR, there is an equally named, uppercase
! built-in macro defined.  That way users can easily query if or if not a
! specific built-in is implemented or not.  For example, if
! '__builtin_avr_nop' is available the macro '__BUILTIN_AVR_NOP' is
! defined to '1' and undefined otherwise.
  
   The following built-in functions map to the respective machine
! instruction, i.e. 'nop', 'sei', 'cli', 'sleep', 'wdr', 'swap', 'fmul',
! 'fmuls' resp.  'fmulsu'.  The three 'fmul*' built-ins are implemented as
  library call if no hardware multiplier is available.
  
       void __builtin_avr_nop (void)
*************** library call if no hardware multiplier i
*** 35179,35212 ****
  implements
       void __builtin_avr_delay_cycles (unsigned long ticks)
  
! `ticks' is the number of ticks to delay execution. Note that this
  built-in does not take into account the effect of interrupts that might
! increase delay time. `ticks' must be a compile-time integer constant;
  delays with a variable number of cycles are not supported.
  
       char __builtin_avr_flash_segment (const __memx void*)
  
  This built-in takes a byte address to the 24-bit *note address space:
! AVR Named Address Spaces. `__memx' and returns the number of the flash
! segment (the 64 KiB chunk) where the address points to.  Counting
! starts at `0'.  If the address does not point to flash memory, return
! `-1'.
  
       unsigned char __builtin_avr_insert_bits (unsigned long map, unsigned char bits, unsigned char val)
  
! Insert bits from BITS into VAL and return the resulting value. The
  nibbles of MAP determine how the insertion is performed: Let X be the
  N-th nibble of MAP
!   1. If X is `0xf', then the N-th bit of VAL is returned unaltered.
  
    2. If X is in the range 0...7, then the N-th result bit is set to the
       X-th bit of BITS
  
!   3. If X is in the range 8...`0xe', then the N-th result bit is
       undefined.
  
  One typical use case for this built-in is adjusting input and output
! values to non-contiguous port layouts. Some examples:
  
       // same as val, bits is unused
       __builtin_avr_insert_bits (0xffffffff, bits, val)
--- 34809,34841 ----
  implements
       void __builtin_avr_delay_cycles (unsigned long ticks)
  
! 'ticks' is the number of ticks to delay execution.  Note that this
  built-in does not take into account the effect of interrupts that might
! increase delay time.  'ticks' must be a compile-time integer constant;
  delays with a variable number of cycles are not supported.
  
       char __builtin_avr_flash_segment (const __memx void*)
  
  This built-in takes a byte address to the 24-bit *note address space:
! AVR Named Address Spaces. '__memx' and returns the number of the flash
! segment (the 64 KiB chunk) where the address points to.  Counting starts
! at '0'.  If the address does not point to flash memory, return '-1'.
  
       unsigned char __builtin_avr_insert_bits (unsigned long map, unsigned char bits, unsigned char val)
  
! Insert bits from BITS into VAL and return the resulting value.  The
  nibbles of MAP determine how the insertion is performed: Let X be the
  N-th nibble of MAP
!   1. If X is '0xf', then the N-th bit of VAL is returned unaltered.
  
    2. If X is in the range 0...7, then the N-th result bit is set to the
       X-th bit of BITS
  
!   3. If X is in the range 8...'0xe', then the N-th result bit is
       undefined.
  
  One typical use case for this built-in is adjusting input and output
! values to non-contiguous port layouts.  Some examples:
  
       // same as val, bits is unused
       __builtin_avr_insert_bits (0xffffffff, bits, val)
*************** File: gcc.info,  Node: Blackfin Built-in
*** 35231,35237 ****
  -----------------------------------
  
  Currently, there are two Blackfin-specific built-in functions.  These
! are used for generating `CSYNC' and `SSYNC' machine insns without using
  inline assembly; by using these built-in functions the compiler can
  automatically add workarounds for hardware errata involving these
  instructions.  These functions are named as follows:
--- 34860,34866 ----
  -----------------------------------
  
  Currently, there are two Blackfin-specific built-in functions.  These
! are used for generating 'CSYNC' and 'SSYNC' machine insns without using
  inline assembly; by using these built-in functions the compiler can
  automatically add workarounds for hardware errata involving these
  instructions.  These functions are named as follows:
*************** File: gcc.info,  Node: FR-V Built-in Fun
*** 35246,35259 ****
  -------------------------------
  
  GCC provides many FR-V-specific built-in functions.  In general, these
! functions are intended to be compatible with those described by `FR-V
! Family, Softune C/C++ Compiler Manual (V6), Fujitsu Semiconductor'.
! The two exceptions are `__MDUNPACKH' and `__MBTOHE', the GCC forms of
! which pass 128-bit values by pointer rather than by value.
  
!  Most of the functions are named after specific FR-V instructions.
! Such functions are said to be "directly mapped" and are summarized here
! in tabular form.
  
  * Menu:
  
--- 34875,34888 ----
  -------------------------------
  
  GCC provides many FR-V-specific built-in functions.  In general, these
! functions are intended to be compatible with those described by 'FR-V
! Family, Softune C/C++ Compiler Manual (V6), Fujitsu Semiconductor'.  The
! two exceptions are '__MDUNPACKH' and '__MBTOHE', the GCC forms of which
! pass 128-bit values by pointer rather than by value.
  
!  Most of the functions are named after specific FR-V instructions.  Such
! functions are said to be "directly mapped" and are summarized here in
! tabular form.
  
  * Menu:
  
*************** In order to make this classification cle
*** 35275,35304 ****
  and return values are given the following pseudo types:
  
  Pseudo type    Real C type            Constant?   Description
! `uh'           `unsigned short'       No          an unsigned halfword
! `uw1'          `unsigned int'         No          an unsigned word
! `sw1'          `int'                  No          a signed word
! `uw2'          `unsigned long long'   No          an unsigned doubleword
! `sw2'          `long long'            No          a signed doubleword
! `const'        `int'                  Yes         an integer constant
! `acc'          `int'                  Yes         an ACC register number
! `iacc'         `int'                  Yes         an IACC register number
  
   These pseudo types are not defined by GCC, they are simply a notational
  convenience used in this manual.
  
!  Arguments of type `uh', `uw1', `sw1', `uw2' and `sw2' are evaluated at
  run time.  They correspond to register operands in the underlying FR-V
  instructions.
  
!  `const' arguments represent immediate operands in the underlying FR-V
  instructions.  They must be compile-time constants.
  
!  `acc' arguments are evaluated at compile time and specify the number
! of an accumulator register.  For example, an `acc' argument of 2
! selects the ACC2 register.
  
!  `iacc' arguments are similar to `acc' arguments but specify the number
  of an IACC register.  See *note Other Built-in Functions:: for more
  details.
  
--- 34904,34933 ----
  and return values are given the following pseudo types:
  
  Pseudo type    Real C type            Constant?   Description
! 'uh'           'unsigned short'       No          an unsigned halfword
! 'uw1'          'unsigned int'         No          an unsigned word
! 'sw1'          'int'                  No          a signed word
! 'uw2'          'unsigned long long'   No          an unsigned doubleword
! 'sw2'          'long long'            No          a signed doubleword
! 'const'        'int'                  Yes         an integer constant
! 'acc'          'int'                  Yes         an ACC register number
! 'iacc'         'int'                  Yes         an IACC register number
  
   These pseudo types are not defined by GCC, they are simply a notational
  convenience used in this manual.
  
!  Arguments of type 'uh', 'uw1', 'sw1', 'uw2' and 'sw2' are evaluated at
  run time.  They correspond to register operands in the underlying FR-V
  instructions.
  
!  'const' arguments represent immediate operands in the underlying FR-V
  instructions.  They must be compile-time constants.
  
!  'acc' arguments are evaluated at compile time and specify the number of
! an accumulator register.  For example, an 'acc' argument of 2 selects
! the ACC2 register.
  
!  'iacc' arguments are similar to 'acc' arguments but specify the number
  of an IACC register.  See *note Other Built-in Functions:: for more
  details.
  
*************** File: gcc.info,  Node: Directly-mapped I
*** 35311,35326 ****
  The functions listed below map directly to FR-V I-type instructions.
  
  Function prototype               Example usage           Assembly output
! `sw1 __ADDSS (sw1, sw1)'         `C = __ADDSS (A, B)'    `ADDSS A,B,C'
! `sw1 __SCAN (sw1, sw1)'          `C = __SCAN (A, B)'     `SCAN A,B,C'
! `sw1 __SCUTSS (sw1)'             `B = __SCUTSS (A)'      `SCUTSS A,B'
! `sw1 __SLASS (sw1, sw1)'         `C = __SLASS (A, B)'    `SLASS A,B,C'
! `void __SMASS (sw1, sw1)'        `__SMASS (A, B)'        `SMASS A,B'
! `void __SMSSS (sw1, sw1)'        `__SMSSS (A, B)'        `SMSSS A,B'
! `void __SMU (sw1, sw1)'          `__SMU (A, B)'          `SMU A,B'
! `sw2 __SMUL (sw1, sw1)'          `C = __SMUL (A, B)'     `SMUL A,B,C'
! `sw1 __SUBSS (sw1, sw1)'         `C = __SUBSS (A, B)'    `SUBSS A,B,C'
! `uw2 __UMUL (uw1, uw1)'          `C = __UMUL (A, B)'     `UMUL A,B,C'
  
  
  File: gcc.info,  Node: Directly-mapped Media Functions,  Next: Raw read/write Functions,  Prev: Directly-mapped Integer Functions,  Up: FR-V Built-in Functions
--- 34940,34955 ----
  The functions listed below map directly to FR-V I-type instructions.
  
  Function prototype               Example usage           Assembly output
! 'sw1 __ADDSS (sw1, sw1)'         'C = __ADDSS (A, B)'    'ADDSS A,B,C'
! 'sw1 __SCAN (sw1, sw1)'          'C = __SCAN (A, B)'     'SCAN A,B,C'
! 'sw1 __SCUTSS (sw1)'             'B = __SCUTSS (A)'      'SCUTSS A,B'
! 'sw1 __SLASS (sw1, sw1)'         'C = __SLASS (A, B)'    'SLASS A,B,C'
! 'void __SMASS (sw1, sw1)'        '__SMASS (A, B)'        'SMASS A,B'
! 'void __SMSSS (sw1, sw1)'        '__SMSSS (A, B)'        'SMSSS A,B'
! 'void __SMU (sw1, sw1)'          '__SMU (A, B)'          'SMU A,B'
! 'sw2 __SMUL (sw1, sw1)'          'C = __SMUL (A, B)'     'SMUL A,B,C'
! 'sw1 __SUBSS (sw1, sw1)'         'C = __SUBSS (A, B)'    'SUBSS A,B,C'
! 'uw2 __UMUL (uw1, uw1)'          'C = __UMUL (A, B)'     'UMUL A,B,C'
  
  
  File: gcc.info,  Node: Directly-mapped Media Functions,  Next: Raw read/write Functions,  Prev: Directly-mapped Integer Functions,  Up: FR-V Built-in Functions
*************** File: gcc.info,  Node: Directly-mapped M
*** 35331,35429 ****
  The functions listed below map directly to FR-V M-type instructions.
  
  Function prototype               Example usage           Assembly output
! `uw1 __MABSHS (sw1)'             `B = __MABSHS (A)'      `MABSHS A,B'
! `void __MADDACCS (acc, acc)'     `__MADDACCS (B, A)'     `MADDACCS A,B'
! `sw1 __MADDHSS (sw1, sw1)'       `C = __MADDHSS (A, B)'  `MADDHSS A,B,C'
! `uw1 __MADDHUS (uw1, uw1)'       `C = __MADDHUS (A, B)'  `MADDHUS A,B,C'
! `uw1 __MAND (uw1, uw1)'          `C = __MAND (A, B)'     `MAND A,B,C'
! `void __MASACCS (acc, acc)'      `__MASACCS (B, A)'      `MASACCS A,B'
! `uw1 __MAVEH (uw1, uw1)'         `C = __MAVEH (A, B)'    `MAVEH A,B,C'
! `uw2 __MBTOH (uw1)'              `B = __MBTOH (A)'       `MBTOH A,B'
! `void __MBTOHE (uw1 *, uw1)'     `__MBTOHE (&B, A)'      `MBTOHE A,B'
! `void __MCLRACC (acc)'           `__MCLRACC (A)'         `MCLRACC A'
! `void __MCLRACCA (void)'         `__MCLRACCA ()'         `MCLRACCA'
! `uw1 __Mcop1 (uw1, uw1)'         `C = __Mcop1 (A, B)'    `Mcop1 A,B,C'
! `uw1 __Mcop2 (uw1, uw1)'         `C = __Mcop2 (A, B)'    `Mcop2 A,B,C'
! `uw1 __MCPLHI (uw2, const)'      `C = __MCPLHI (A, B)'   `MCPLHI A,#B,C'
! `uw1 __MCPLI (uw2, const)'       `C = __MCPLI (A, B)'    `MCPLI A,#B,C'
! `void __MCPXIS (acc, sw1, sw1)'  `__MCPXIS (C, A, B)'    `MCPXIS A,B,C'
! `void __MCPXIU (acc, uw1, uw1)'  `__MCPXIU (C, A, B)'    `MCPXIU A,B,C'
! `void __MCPXRS (acc, sw1, sw1)'  `__MCPXRS (C, A, B)'    `MCPXRS A,B,C'
! `void __MCPXRU (acc, uw1, uw1)'  `__MCPXRU (C, A, B)'    `MCPXRU A,B,C'
! `uw1 __MCUT (acc, uw1)'          `C = __MCUT (A, B)'     `MCUT A,B,C'
! `uw1 __MCUTSS (acc, sw1)'        `C = __MCUTSS (A, B)'   `MCUTSS A,B,C'
! `void __MDADDACCS (acc, acc)'    `__MDADDACCS (B, A)'    `MDADDACCS A,B'
! `void __MDASACCS (acc, acc)'     `__MDASACCS (B, A)'     `MDASACCS A,B'
! `uw2 __MDCUTSSI (acc, const)'    `C = __MDCUTSSI (A, B)' `MDCUTSSI A,#B,C'
! `uw2 __MDPACKH (uw2, uw2)'       `C = __MDPACKH (A, B)'  `MDPACKH A,B,C'
! `uw2 __MDROTLI (uw2, const)'     `C = __MDROTLI (A, B)'  `MDROTLI A,#B,C'
! `void __MDSUBACCS (acc, acc)'    `__MDSUBACCS (B, A)'    `MDSUBACCS A,B'
! `void __MDUNPACKH (uw1 *, uw2)'  `__MDUNPACKH (&B, A)'   `MDUNPACKH A,B'
! `uw2 __MEXPDHD (uw1, const)'     `C = __MEXPDHD (A, B)'  `MEXPDHD A,#B,C'
! `uw1 __MEXPDHW (uw1, const)'     `C = __MEXPDHW (A, B)'  `MEXPDHW A,#B,C'
! `uw1 __MHDSETH (uw1, const)'     `C = __MHDSETH (A, B)'  `MHDSETH A,#B,C'
! `sw1 __MHDSETS (const)'          `B = __MHDSETS (A)'     `MHDSETS #A,B'
! `uw1 __MHSETHIH (uw1, const)'    `B = __MHSETHIH (B, A)' `MHSETHIH #A,B'
! `sw1 __MHSETHIS (sw1, const)'    `B = __MHSETHIS (B, A)' `MHSETHIS #A,B'
! `uw1 __MHSETLOH (uw1, const)'    `B = __MHSETLOH (B, A)' `MHSETLOH #A,B'
! `sw1 __MHSETLOS (sw1, const)'    `B = __MHSETLOS (B, A)' `MHSETLOS #A,B'
! `uw1 __MHTOB (uw2)'              `B = __MHTOB (A)'       `MHTOB A,B'
! `void __MMACHS (acc, sw1, sw1)'  `__MMACHS (C, A, B)'    `MMACHS A,B,C'
! `void __MMACHU (acc, uw1, uw1)'  `__MMACHU (C, A, B)'    `MMACHU A,B,C'
! `void __MMRDHS (acc, sw1, sw1)'  `__MMRDHS (C, A, B)'    `MMRDHS A,B,C'
! `void __MMRDHU (acc, uw1, uw1)'  `__MMRDHU (C, A, B)'    `MMRDHU A,B,C'
! `void __MMULHS (acc, sw1, sw1)'  `__MMULHS (C, A, B)'    `MMULHS A,B,C'
! `void __MMULHU (acc, uw1, uw1)'  `__MMULHU (C, A, B)'    `MMULHU A,B,C'
! `void __MMULXHS (acc, sw1, sw1)' `__MMULXHS (C, A, B)'   `MMULXHS A,B,C'
! `void __MMULXHU (acc, uw1, uw1)' `__MMULXHU (C, A, B)'   `MMULXHU A,B,C'
! `uw1 __MNOT (uw1)'               `B = __MNOT (A)'        `MNOT A,B'
! `uw1 __MOR (uw1, uw1)'           `C = __MOR (A, B)'      `MOR A,B,C'
! `uw1 __MPACKH (uh, uh)'          `C = __MPACKH (A, B)'   `MPACKH A,B,C'
! `sw2 __MQADDHSS (sw2, sw2)'      `C = __MQADDHSS (A, B)' `MQADDHSS A,B,C'
! `uw2 __MQADDHUS (uw2, uw2)'      `C = __MQADDHUS (A, B)' `MQADDHUS A,B,C'
! `void __MQCPXIS (acc, sw2, sw2)' `__MQCPXIS (C, A, B)'   `MQCPXIS A,B,C'
! `void __MQCPXIU (acc, uw2, uw2)' `__MQCPXIU (C, A, B)'   `MQCPXIU A,B,C'
! `void __MQCPXRS (acc, sw2, sw2)' `__MQCPXRS (C, A, B)'   `MQCPXRS A,B,C'
! `void __MQCPXRU (acc, uw2, uw2)' `__MQCPXRU (C, A, B)'   `MQCPXRU A,B,C'
! `sw2 __MQLCLRHS (sw2, sw2)'      `C = __MQLCLRHS (A, B)' `MQLCLRHS A,B,C'
! `sw2 __MQLMTHS (sw2, sw2)'       `C = __MQLMTHS (A, B)'  `MQLMTHS A,B,C'
! `void __MQMACHS (acc, sw2, sw2)' `__MQMACHS (C, A, B)'   `MQMACHS A,B,C'
! `void __MQMACHU (acc, uw2, uw2)' `__MQMACHU (C, A, B)'   `MQMACHU A,B,C'
! `void __MQMACXHS (acc, sw2,      `__MQMACXHS (C, A, B)'  `MQMACXHS A,B,C'
! sw2)'                                                    
! `void __MQMULHS (acc, sw2, sw2)' `__MQMULHS (C, A, B)'   `MQMULHS A,B,C'
! `void __MQMULHU (acc, uw2, uw2)' `__MQMULHU (C, A, B)'   `MQMULHU A,B,C'
! `void __MQMULXHS (acc, sw2,      `__MQMULXHS (C, A, B)'  `MQMULXHS A,B,C'
! sw2)'                                                    
! `void __MQMULXHU (acc, uw2,      `__MQMULXHU (C, A, B)'  `MQMULXHU A,B,C'
! uw2)'                                                    
! `sw2 __MQSATHS (sw2, sw2)'       `C = __MQSATHS (A, B)'  `MQSATHS A,B,C'
! `uw2 __MQSLLHI (uw2, int)'       `C = __MQSLLHI (A, B)'  `MQSLLHI A,B,C'
! `sw2 __MQSRAHI (sw2, int)'       `C = __MQSRAHI (A, B)'  `MQSRAHI A,B,C'
! `sw2 __MQSUBHSS (sw2, sw2)'      `C = __MQSUBHSS (A, B)' `MQSUBHSS A,B,C'
! `uw2 __MQSUBHUS (uw2, uw2)'      `C = __MQSUBHUS (A, B)' `MQSUBHUS A,B,C'
! `void __MQXMACHS (acc, sw2,      `__MQXMACHS (C, A, B)'  `MQXMACHS A,B,C'
! sw2)'                                                    
! `void __MQXMACXHS (acc, sw2,     `__MQXMACXHS (C, A, B)' `MQXMACXHS A,B,C'
! sw2)'                                                    
! `uw1 __MRDACC (acc)'             `B = __MRDACC (A)'      `MRDACC A,B'
! `uw1 __MRDACCG (acc)'            `B = __MRDACCG (A)'     `MRDACCG A,B'
! `uw1 __MROTLI (uw1, const)'      `C = __MROTLI (A, B)'   `MROTLI A,#B,C'
! `uw1 __MROTRI (uw1, const)'      `C = __MROTRI (A, B)'   `MROTRI A,#B,C'
! `sw1 __MSATHS (sw1, sw1)'        `C = __MSATHS (A, B)'   `MSATHS A,B,C'
! `uw1 __MSATHU (uw1, uw1)'        `C = __MSATHU (A, B)'   `MSATHU A,B,C'
! `uw1 __MSLLHI (uw1, const)'      `C = __MSLLHI (A, B)'   `MSLLHI A,#B,C'
! `sw1 __MSRAHI (sw1, const)'      `C = __MSRAHI (A, B)'   `MSRAHI A,#B,C'
! `uw1 __MSRLHI (uw1, const)'      `C = __MSRLHI (A, B)'   `MSRLHI A,#B,C'
! `void __MSUBACCS (acc, acc)'     `__MSUBACCS (B, A)'     `MSUBACCS A,B'
! `sw1 __MSUBHSS (sw1, sw1)'       `C = __MSUBHSS (A, B)'  `MSUBHSS A,B,C'
! `uw1 __MSUBHUS (uw1, uw1)'       `C = __MSUBHUS (A, B)'  `MSUBHUS A,B,C'
! `void __MTRAP (void)'            `__MTRAP ()'            `MTRAP'
! `uw2 __MUNPACKH (uw1)'           `B = __MUNPACKH (A)'    `MUNPACKH A,B'
! `uw1 __MWCUT (uw2, uw1)'         `C = __MWCUT (A, B)'    `MWCUT A,B,C'
! `void __MWTACC (acc, uw1)'       `__MWTACC (B, A)'       `MWTACC A,B'
! `void __MWTACCG (acc, uw1)'      `__MWTACCG (B, A)'      `MWTACCG A,B'
! `uw1 __MXOR (uw1, uw1)'          `C = __MXOR (A, B)'     `MXOR A,B,C'
  
  
  File: gcc.info,  Node: Raw read/write Functions,  Next: Other Built-in Functions,  Prev: Directly-mapped Media Functions,  Up: FR-V Built-in Functions
--- 34960,35102 ----
  The functions listed below map directly to FR-V M-type instructions.
  
  Function prototype               Example usage           Assembly output
! 'uw1 __MABSHS (sw1)'             'B = __MABSHS (A)'      'MABSHS A,B'
! 'void __MADDACCS (acc, acc)'     '__MADDACCS (B, A)'     'MADDACCS A,B'
! 'sw1 __MADDHSS (sw1, sw1)'       'C = __MADDHSS (A,      'MADDHSS A,B,C'
!                                  B)'
! 'uw1 __MADDHUS (uw1, uw1)'       'C = __MADDHUS (A,      'MADDHUS A,B,C'
!                                  B)'
! 'uw1 __MAND (uw1, uw1)'          'C = __MAND (A, B)'     'MAND A,B,C'
! 'void __MASACCS (acc, acc)'      '__MASACCS (B, A)'      'MASACCS A,B'
! 'uw1 __MAVEH (uw1, uw1)'         'C = __MAVEH (A, B)'    'MAVEH A,B,C'
! 'uw2 __MBTOH (uw1)'              'B = __MBTOH (A)'       'MBTOH A,B'
! 'void __MBTOHE (uw1 *, uw1)'     '__MBTOHE (&B, A)'      'MBTOHE A,B'
! 'void __MCLRACC (acc)'           '__MCLRACC (A)'         'MCLRACC A'
! 'void __MCLRACCA (void)'         '__MCLRACCA ()'         'MCLRACCA'
! 'uw1 __Mcop1 (uw1, uw1)'         'C = __Mcop1 (A, B)'    'Mcop1 A,B,C'
! 'uw1 __Mcop2 (uw1, uw1)'         'C = __Mcop2 (A, B)'    'Mcop2 A,B,C'
! 'uw1 __MCPLHI (uw2, const)'      'C = __MCPLHI (A, B)'   'MCPLHI A,#B,C'
! 'uw1 __MCPLI (uw2, const)'       'C = __MCPLI (A, B)'    'MCPLI A,#B,C'
! 'void __MCPXIS (acc, sw1,        '__MCPXIS (C, A, B)'    'MCPXIS A,B,C'
! sw1)'
! 'void __MCPXIU (acc, uw1,        '__MCPXIU (C, A, B)'    'MCPXIU A,B,C'
! uw1)'
! 'void __MCPXRS (acc, sw1,        '__MCPXRS (C, A, B)'    'MCPXRS A,B,C'
! sw1)'
! 'void __MCPXRU (acc, uw1,        '__MCPXRU (C, A, B)'    'MCPXRU A,B,C'
! uw1)'
! 'uw1 __MCUT (acc, uw1)'          'C = __MCUT (A, B)'     'MCUT A,B,C'
! 'uw1 __MCUTSS (acc, sw1)'        'C = __MCUTSS (A, B)'   'MCUTSS A,B,C'
! 'void __MDADDACCS (acc, acc)'    '__MDADDACCS (B, A)'    'MDADDACCS A,B'
! 'void __MDASACCS (acc, acc)'     '__MDASACCS (B, A)'     'MDASACCS A,B'
! 'uw2 __MDCUTSSI (acc, const)'    'C = __MDCUTSSI (A,     'MDCUTSSI
!                                  B)'                     A,#B,C'
! 'uw2 __MDPACKH (uw2, uw2)'       'C = __MDPACKH (A,      'MDPACKH A,B,C'
!                                  B)'
! 'uw2 __MDROTLI (uw2, const)'     'C = __MDROTLI (A,      'MDROTLI
!                                  B)'                     A,#B,C'
! 'void __MDSUBACCS (acc, acc)'    '__MDSUBACCS (B, A)'    'MDSUBACCS A,B'
! 'void __MDUNPACKH (uw1 *,        '__MDUNPACKH (&B, A)'   'MDUNPACKH A,B'
! uw2)'
! 'uw2 __MEXPDHD (uw1, const)'     'C = __MEXPDHD (A,      'MEXPDHD
!                                  B)'                     A,#B,C'
! 'uw1 __MEXPDHW (uw1, const)'     'C = __MEXPDHW (A,      'MEXPDHW
!                                  B)'                     A,#B,C'
! 'uw1 __MHDSETH (uw1, const)'     'C = __MHDSETH (A,      'MHDSETH
!                                  B)'                     A,#B,C'
! 'sw1 __MHDSETS (const)'          'B = __MHDSETS (A)'     'MHDSETS #A,B'
! 'uw1 __MHSETHIH (uw1, const)'    'B = __MHSETHIH (B,     'MHSETHIH #A,B'
!                                  A)'
! 'sw1 __MHSETHIS (sw1, const)'    'B = __MHSETHIS (B,     'MHSETHIS #A,B'
!                                  A)'
! 'uw1 __MHSETLOH (uw1, const)'    'B = __MHSETLOH (B,     'MHSETLOH #A,B'
!                                  A)'
! 'sw1 __MHSETLOS (sw1, const)'    'B = __MHSETLOS (B,     'MHSETLOS #A,B'
!                                  A)'
! 'uw1 __MHTOB (uw2)'              'B = __MHTOB (A)'       'MHTOB A,B'
! 'void __MMACHS (acc, sw1,        '__MMACHS (C, A, B)'    'MMACHS A,B,C'
! sw1)'
! 'void __MMACHU (acc, uw1,        '__MMACHU (C, A, B)'    'MMACHU A,B,C'
! uw1)'
! 'void __MMRDHS (acc, sw1,        '__MMRDHS (C, A, B)'    'MMRDHS A,B,C'
! sw1)'
! 'void __MMRDHU (acc, uw1,        '__MMRDHU (C, A, B)'    'MMRDHU A,B,C'
! uw1)'
! 'void __MMULHS (acc, sw1,        '__MMULHS (C, A, B)'    'MMULHS A,B,C'
! sw1)'
! 'void __MMULHU (acc, uw1,        '__MMULHU (C, A, B)'    'MMULHU A,B,C'
! uw1)'
! 'void __MMULXHS (acc, sw1,       '__MMULXHS (C, A, B)'   'MMULXHS A,B,C'
! sw1)'
! 'void __MMULXHU (acc, uw1,       '__MMULXHU (C, A, B)'   'MMULXHU A,B,C'
! uw1)'
! 'uw1 __MNOT (uw1)'               'B = __MNOT (A)'        'MNOT A,B'
! 'uw1 __MOR (uw1, uw1)'           'C = __MOR (A, B)'      'MOR A,B,C'
! 'uw1 __MPACKH (uh, uh)'          'C = __MPACKH (A, B)'   'MPACKH A,B,C'
! 'sw2 __MQADDHSS (sw2, sw2)'      'C = __MQADDHSS (A,     'MQADDHSS
!                                  B)'                     A,B,C'
! 'uw2 __MQADDHUS (uw2, uw2)'      'C = __MQADDHUS (A,     'MQADDHUS
!                                  B)'                     A,B,C'
! 'void __MQCPXIS (acc, sw2,       '__MQCPXIS (C, A, B)'   'MQCPXIS A,B,C'
! sw2)'
! 'void __MQCPXIU (acc, uw2,       '__MQCPXIU (C, A, B)'   'MQCPXIU A,B,C'
! uw2)'
! 'void __MQCPXRS (acc, sw2,       '__MQCPXRS (C, A, B)'   'MQCPXRS A,B,C'
! sw2)'
! 'void __MQCPXRU (acc, uw2,       '__MQCPXRU (C, A, B)'   'MQCPXRU A,B,C'
! uw2)'
! 'sw2 __MQLCLRHS (sw2, sw2)'      'C = __MQLCLRHS (A,     'MQLCLRHS
!                                  B)'                     A,B,C'
! 'sw2 __MQLMTHS (sw2, sw2)'       'C = __MQLMTHS (A,      'MQLMTHS A,B,C'
!                                  B)'
! 'void __MQMACHS (acc, sw2,       '__MQMACHS (C, A, B)'   'MQMACHS A,B,C'
! sw2)'
! 'void __MQMACHU (acc, uw2,       '__MQMACHU (C, A, B)'   'MQMACHU A,B,C'
! uw2)'
! 'void __MQMACXHS (acc, sw2,      '__MQMACXHS (C, A,      'MQMACXHS
! sw2)'                            B)'                     A,B,C'
! 'void __MQMULHS (acc, sw2,       '__MQMULHS (C, A, B)'   'MQMULHS A,B,C'
! sw2)'
! 'void __MQMULHU (acc, uw2,       '__MQMULHU (C, A, B)'   'MQMULHU A,B,C'
! uw2)'
! 'void __MQMULXHS (acc, sw2,      '__MQMULXHS (C, A,      'MQMULXHS
! sw2)'                            B)'                     A,B,C'
! 'void __MQMULXHU (acc, uw2,      '__MQMULXHU (C, A,      'MQMULXHU
! uw2)'                            B)'                     A,B,C'
! 'sw2 __MQSATHS (sw2, sw2)'       'C = __MQSATHS (A,      'MQSATHS A,B,C'
!                                  B)'
! 'uw2 __MQSLLHI (uw2, int)'       'C = __MQSLLHI (A,      'MQSLLHI A,B,C'
!                                  B)'
! 'sw2 __MQSRAHI (sw2, int)'       'C = __MQSRAHI (A,      'MQSRAHI A,B,C'
!                                  B)'
! 'sw2 __MQSUBHSS (sw2, sw2)'      'C = __MQSUBHSS (A,     'MQSUBHSS
!                                  B)'                     A,B,C'
! 'uw2 __MQSUBHUS (uw2, uw2)'      'C = __MQSUBHUS (A,     'MQSUBHUS
!                                  B)'                     A,B,C'
! 'void __MQXMACHS (acc, sw2,      '__MQXMACHS (C, A,      'MQXMACHS
! sw2)'                            B)'                     A,B,C'
! 'void __MQXMACXHS (acc, sw2,     '__MQXMACXHS (C, A,     'MQXMACXHS
! sw2)'                            B)'                     A,B,C'
! 'uw1 __MRDACC (acc)'             'B = __MRDACC (A)'      'MRDACC A,B'
! 'uw1 __MRDACCG (acc)'            'B = __MRDACCG (A)'     'MRDACCG A,B'
! 'uw1 __MROTLI (uw1, const)'      'C = __MROTLI (A, B)'   'MROTLI A,#B,C'
! 'uw1 __MROTRI (uw1, const)'      'C = __MROTRI (A, B)'   'MROTRI A,#B,C'
! 'sw1 __MSATHS (sw1, sw1)'        'C = __MSATHS (A, B)'   'MSATHS A,B,C'
! 'uw1 __MSATHU (uw1, uw1)'        'C = __MSATHU (A, B)'   'MSATHU A,B,C'
! 'uw1 __MSLLHI (uw1, const)'      'C = __MSLLHI (A, B)'   'MSLLHI A,#B,C'
! 'sw1 __MSRAHI (sw1, const)'      'C = __MSRAHI (A, B)'   'MSRAHI A,#B,C'
! 'uw1 __MSRLHI (uw1, const)'      'C = __MSRLHI (A, B)'   'MSRLHI A,#B,C'
! 'void __MSUBACCS (acc, acc)'     '__MSUBACCS (B, A)'     'MSUBACCS A,B'
! 'sw1 __MSUBHSS (sw1, sw1)'       'C = __MSUBHSS (A,      'MSUBHSS A,B,C'
!                                  B)'
! 'uw1 __MSUBHUS (uw1, uw1)'       'C = __MSUBHUS (A,      'MSUBHUS A,B,C'
!                                  B)'
! 'void __MTRAP (void)'            '__MTRAP ()'            'MTRAP'
! 'uw2 __MUNPACKH (uw1)'           'B = __MUNPACKH (A)'    'MUNPACKH A,B'
! 'uw1 __MWCUT (uw2, uw1)'         'C = __MWCUT (A, B)'    'MWCUT A,B,C'
! 'void __MWTACC (acc, uw1)'       '__MWTACC (B, A)'       'MWTACC A,B'
! 'void __MWTACCG (acc, uw1)'      '__MWTACCG (B, A)'      'MWTACCG A,B'
! 'uw1 __MXOR (uw1, uw1)'          'C = __MXOR (A, B)'     'MXOR A,B,C'
  
  
  File: gcc.info,  Node: Raw read/write Functions,  Next: Other Built-in Functions,  Prev: Directly-mapped Media Functions,  Up: FR-V Built-in Functions
*************** File: gcc.info,  Node: Raw read/write Fu
*** 35432,35456 ****
  ..................................
  
  This sections describes built-in functions related to read and write
! instructions to access memory.  These functions generate `membar'
  instructions to flush the I/O load and stores where appropriate, as
  described in Fujitsu's manual described above.
  
! `unsigned char __builtin_read8 (void *DATA)'
! 
! `unsigned short __builtin_read16 (void *DATA)'
! 
! `unsigned long __builtin_read32 (void *DATA)'
! 
! `unsigned long long __builtin_read64 (void *DATA)'
! 
! `void __builtin_write8 (void *DATA, unsigned char DATUM)'
! 
! `void __builtin_write16 (void *DATA, unsigned short DATUM)'
! 
! `void __builtin_write32 (void *DATA, unsigned long DATUM)'
  
! `void __builtin_write64 (void *DATA, unsigned long long DATUM)'
  
  
  File: gcc.info,  Node: Other Built-in Functions,  Prev: Raw read/write Functions,  Up: FR-V Built-in Functions
--- 35105,35123 ----
  ..................................
  
  This sections describes built-in functions related to read and write
! instructions to access memory.  These functions generate 'membar'
  instructions to flush the I/O load and stores where appropriate, as
  described in Fujitsu's manual described above.
  
! 'unsigned char __builtin_read8 (void *DATA)'
! 'unsigned short __builtin_read16 (void *DATA)'
! 'unsigned long __builtin_read32 (void *DATA)'
! 'unsigned long long __builtin_read64 (void *DATA)'
  
! 'void __builtin_write8 (void *DATA, unsigned char DATUM)'
! 'void __builtin_write16 (void *DATA, unsigned short DATUM)'
! 'void __builtin_write32 (void *DATA, unsigned long DATUM)'
! 'void __builtin_write64 (void *DATA, unsigned long long DATUM)'
  
  
  File: gcc.info,  Node: Other Built-in Functions,  Prev: Raw read/write Functions,  Up: FR-V Built-in Functions
*************** File: gcc.info,  Node: Other Built-in Fu
*** 35461,35488 ****
  This section describes built-in functions that are not named after a
  specific FR-V instruction.
  
! `sw2 __IACCreadll (iacc REG)'
       Return the full 64-bit value of IACC0.  The REG argument is
       reserved for future expansion and must be 0.
  
! `sw1 __IACCreadl (iacc REG)'
       Return the value of IACC0H if REG is 0 and IACC0L if REG is 1.
       Other values of REG are rejected as invalid.
  
! `void __IACCsetll (iacc REG, sw2 X)'
       Set the full 64-bit value of IACC0 to X.  The REG argument is
       reserved for future expansion and must be 0.
  
! `void __IACCsetl (iacc REG, sw1 X)'
       Set IACC0H to X if REG is 0 and IACC0L to X if REG is 1.  Other
       values of REG are rejected as invalid.
  
! `void __data_prefetch0 (const void *X)'
!      Use the `dcpl' instruction to load the contents of address X into
       the data cache.
  
! `void __data_prefetch (const void *X)'
!      Use the `nldub' instruction to load the contents of address X into
       the data cache.  The instruction is issued in slot I1.
  
  
--- 35128,35155 ----
  This section describes built-in functions that are not named after a
  specific FR-V instruction.
  
! 'sw2 __IACCreadll (iacc REG)'
       Return the full 64-bit value of IACC0.  The REG argument is
       reserved for future expansion and must be 0.
  
! 'sw1 __IACCreadl (iacc REG)'
       Return the value of IACC0H if REG is 0 and IACC0L if REG is 1.
       Other values of REG are rejected as invalid.
  
! 'void __IACCsetll (iacc REG, sw2 X)'
       Set the full 64-bit value of IACC0 to X.  The REG argument is
       reserved for future expansion and must be 0.
  
! 'void __IACCsetl (iacc REG, sw1 X)'
       Set IACC0H to X if REG is 0 and IACC0L to X if REG is 1.  Other
       values of REG are rejected as invalid.
  
! 'void __data_prefetch0 (const void *X)'
!      Use the 'dcpl' instruction to load the contents of address X into
       the data cache.
  
! 'void __data_prefetch (const void *X)'
!      Use the 'nldub' instruction to load the contents of address X into
       the data cache.  The instruction is issued in slot I1.
  
  
*************** media applications.  It provides instruc
*** 35497,35530 ****
  8-bit/16-bit integer data, Q7, Q15 and Q31 fractional data.
  
   GCC supports MIPS DSP operations using both the generic vector
! extensions (*note Vector Extensions::) and a collection of
! MIPS-specific built-in functions.  Both kinds of support are enabled by
! the `-mdsp' command-line option.
  
   Revision 2 of the ASE was introduced in the second half of 2006.  This
  revision adds extra instructions to the original ASE, but is otherwise
  backwards-compatible with it.  You can select revision 2 using the
! command-line option `-mdspr2'; this option implies `-mdsp'.
  
   The SCOUNT and POS bits of the DSP control register are global.  The
! WRDSP, EXTPDP, EXTPDPV and MTHLIP instructions modify the SCOUNT and
! POS bits.  During optimization, the compiler does not delete these
  instructions and it does not delete calls to functions containing these
  instructions.
  
!  At present, GCC only provides support for operations on 32-bit
! vectors.  The vector type associated with 8-bit integer data is usually
! called `v4i8', the vector type associated with Q7 is usually called
! `v4q7', the vector type associated with 16-bit integer data is usually
! called `v2i16', and the vector type associated with Q15 is usually
! called `v2q15'.  They can be defined in C as follows:
  
       typedef signed char v4i8 __attribute__ ((vector_size(4)));
       typedef signed char v4q7 __attribute__ ((vector_size(4)));
       typedef short v2i16 __attribute__ ((vector_size(4)));
       typedef short v2q15 __attribute__ ((vector_size(4)));
  
!  `v4i8', `v4q7', `v2i16' and `v2q15' values are initialized in the same
  way as aggregates.  For example:
  
       v4i8 a = {1, 2, 3, 4};
--- 35164,35197 ----
  8-bit/16-bit integer data, Q7, Q15 and Q31 fractional data.
  
   GCC supports MIPS DSP operations using both the generic vector
! extensions (*note Vector Extensions::) and a collection of MIPS-specific
! built-in functions.  Both kinds of support are enabled by the '-mdsp'
! command-line option.
  
   Revision 2 of the ASE was introduced in the second half of 2006.  This
  revision adds extra instructions to the original ASE, but is otherwise
  backwards-compatible with it.  You can select revision 2 using the
! command-line option '-mdspr2'; this option implies '-mdsp'.
  
   The SCOUNT and POS bits of the DSP control register are global.  The
! WRDSP, EXTPDP, EXTPDPV and MTHLIP instructions modify the SCOUNT and POS
! bits.  During optimization, the compiler does not delete these
  instructions and it does not delete calls to functions containing these
  instructions.
  
!  At present, GCC only provides support for operations on 32-bit vectors.
! The vector type associated with 8-bit integer data is usually called
! 'v4i8', the vector type associated with Q7 is usually called 'v4q7', the
! vector type associated with 16-bit integer data is usually called
! 'v2i16', and the vector type associated with Q15 is usually called
! 'v2q15'.  They can be defined in C as follows:
  
       typedef signed char v4i8 __attribute__ ((vector_size(4)));
       typedef signed char v4q7 __attribute__ ((vector_size(4)));
       typedef short v2i16 __attribute__ ((vector_size(4)));
       typedef short v2q15 __attribute__ ((vector_size(4)));
  
!  'v4i8', 'v4q7', 'v2i16' and 'v2q15' values are initialized in the same
  way as aggregates.  For example:
  
       v4i8 a = {1, 2, 3, 4};
*************** way as aggregates.  For example:
*** 35539,35568 ****
  packed.  On little-endian targets, the first value is the least
  significant and the last value is the most significant.  The opposite
  order applies to big-endian targets.  For example, the code above sets
! the lowest byte of `a' to `1' on little-endian targets and `4' on
  big-endian targets.
  
   _Note:_ Q7, Q15 and Q31 values must be initialized with their integer
! representation.  As shown in this example, the integer representation
! of a Q7 value can be obtained by multiplying the fractional value by
! `0x1.0p7'.  The equivalent for Q15 values is to multiply by `0x1.0p15'.
! The equivalent for Q31 values is to multiply by `0x1.0p31'.
  
!  The table below lists the `v4i8' and `v2q15' operations for which
! hardware support exists.  `a' and `b' are `v4i8' values, and `c' and
! `d' are `v2q15' values.
  
  C code                               MIPS instruction
! `a + b'                              `addu.qb'
! `c + d'                              `addq.ph'
! `a - b'                              `subu.qb'
! `c - d'                              `subq.ph'
  
!  The table below lists the `v2i16' operation for which hardware support
! exists for the DSP ASE REV 2.  `e' and `f' are `v2i16' values.
  
  C code                               MIPS instruction
! `e * f'                              `mul.ph'
  
   It is easier to describe the DSP built-in functions if we first define
  the following types:
--- 35206,35235 ----
  packed.  On little-endian targets, the first value is the least
  significant and the last value is the most significant.  The opposite
  order applies to big-endian targets.  For example, the code above sets
! the lowest byte of 'a' to '1' on little-endian targets and '4' on
  big-endian targets.
  
   _Note:_ Q7, Q15 and Q31 values must be initialized with their integer
! representation.  As shown in this example, the integer representation of
! a Q7 value can be obtained by multiplying the fractional value by
! '0x1.0p7'.  The equivalent for Q15 values is to multiply by '0x1.0p15'.
! The equivalent for Q31 values is to multiply by '0x1.0p31'.
  
!  The table below lists the 'v4i8' and 'v2q15' operations for which
! hardware support exists.  'a' and 'b' are 'v4i8' values, and 'c' and 'd'
! are 'v2q15' values.
  
  C code                               MIPS instruction
! 'a + b'                              'addu.qb'
! 'c + d'                              'addq.ph'
! 'a - b'                              'subu.qb'
! 'c - d'                              'subq.ph'
  
!  The table below lists the 'v2i16' operation for which hardware support
! exists for the DSP ASE REV 2.  'e' and 'f' are 'v2i16' values.
  
  C code                               MIPS instruction
! 'e * f'                              'mul.ph'
  
   It is easier to describe the DSP built-in functions if we first define
  the following types:
*************** the following types:
*** 35572,35582 ****
       typedef unsigned int ui32;
       typedef long long a64;
  
!  `q31' and `i32' are actually the same as `int', but we use `q31' to
! indicate a Q31 fractional value and `i32' to indicate a 32-bit integer
! value.  Similarly, `a64' is the same as `long long', but we use `a64'
! to indicate values that are placed in one of the four DSP accumulators
! (`$ac0', `$ac1', `$ac2' or `$ac3').
  
   Also, some built-in functions prefer or require immediate numbers as
  parameters, because the corresponding DSP instructions accept both
--- 35239,35249 ----
       typedef unsigned int ui32;
       typedef long long a64;
  
!  'q31' and 'i32' are actually the same as 'int', but we use 'q31' to
! indicate a Q31 fractional value and 'i32' to indicate a 32-bit integer
! value.  Similarly, 'a64' is the same as 'long long', but we use 'a64' to
! indicate values that are placed in one of the four DSP accumulators
! ('$ac0', '$ac1', '$ac2' or '$ac3').
  
   Also, some built-in functions prefer or require immediate numbers as
  parameters, because the corresponding DSP instructions accept both
*************** only.  The immediate parameters are list
*** 35593,35600 ****
       imm_n512_511: -512 to 511.
  
   The following built-in functions map directly to a particular MIPS DSP
! instruction.  Please refer to the architecture specification for
! details on what each instruction does.
  
       v2q15 __builtin_mips_addq_ph (v2q15, v2q15)
       v2q15 __builtin_mips_addq_s_ph (v2q15, v2q15)
--- 35260,35267 ----
       imm_n512_511: -512 to 511.
  
   The following built-in functions map directly to a particular MIPS DSP
! instruction.  Please refer to the architecture specification for details
! on what each instruction does.
  
       v2q15 __builtin_mips_addq_ph (v2q15, v2q15)
       v2q15 __builtin_mips_addq_s_ph (v2q15, v2q15)
*************** File: gcc.info,  Node: MIPS Paired-Singl
*** 35765,35786 ****
  ----------------------------------
  
  The MIPS64 architecture includes a number of instructions that operate
! on pairs of single-precision floating-point values.  Each pair is
! packed into a 64-bit floating-point register, with one element being
! designated the "upper half" and the other being designated the "lower
! half".
  
   GCC supports paired-single operations using both the generic vector
! extensions (*note Vector Extensions::) and a collection of
! MIPS-specific built-in functions.  Both kinds of support are enabled by
! the `-mpaired-single' command-line option.
  
   The vector type associated with paired-single values is usually called
! `v2sf'.  It can be defined in C as follows:
  
       typedef float v2sf __attribute__ ((vector_size (8)));
  
!  `v2sf' values are initialized in the same way as aggregates.  For
  example:
  
       v2sf a = {1.5, 9.1};
--- 35432,35452 ----
  ----------------------------------
  
  The MIPS64 architecture includes a number of instructions that operate
! on pairs of single-precision floating-point values.  Each pair is packed
! into a 64-bit floating-point register, with one element being designated
! the "upper half" and the other being designated the "lower half".
  
   GCC supports paired-single operations using both the generic vector
! extensions (*note Vector Extensions::) and a collection of MIPS-specific
! built-in functions.  Both kinds of support are enabled by the
! '-mpaired-single' command-line option.
  
   The vector type associated with paired-single values is usually called
! 'v2sf'.  It can be defined in C as follows:
  
       typedef float v2sf __attribute__ ((vector_size (8)));
  
!  'v2sf' values are initialized in the same way as aggregates.  For
  example:
  
       v2sf a = {1.5, 9.1};
*************** example:
*** 35791,35799 ****
   _Note:_ The CPU's endianness determines which value is stored in the
  upper half of a register and which value is stored in the lower half.
  On little-endian targets, the first value is the lower one and the
! second value is the upper one.  The opposite order applies to
! big-endian targets.  For example, the code above sets the lower half of
! `a' to `1.5' on little-endian targets and `9.1' on big-endian targets.
  
  
  File: gcc.info,  Node: MIPS Loongson Built-in Functions,  Next: Other MIPS Built-in Functions,  Prev: MIPS Paired-Single Support,  Up: Target Builtins
--- 35457,35465 ----
   _Note:_ The CPU's endianness determines which value is stored in the
  upper half of a register and which value is stored in the lower half.
  On little-endian targets, the first value is the lower one and the
! second value is the upper one.  The opposite order applies to big-endian
! targets.  For example, the code above sets the lower half of 'a' to
! '1.5' on little-endian targets and '9.1' on big-endian targets.
  
  
  File: gcc.info,  Node: MIPS Loongson Built-in Functions,  Next: Other MIPS Built-in Functions,  Prev: MIPS Paired-Single Support,  Up: Target Builtins
*************** File: gcc.info,  Node: MIPS Loongson Bui
*** 35803,35822 ****
  
  GCC provides intrinsics to access the SIMD instructions provided by the
  ST Microelectronics Loongson-2E and -2F processors.  These intrinsics,
! available after inclusion of the `loongson.h' header file, operate on
  the following 64-bit vector types:
  
!    * `uint8x8_t', a vector of eight unsigned 8-bit integers;
! 
!    * `uint16x4_t', a vector of four unsigned 16-bit integers;
! 
!    * `uint32x2_t', a vector of two unsigned 32-bit integers;
! 
!    * `int8x8_t', a vector of eight signed 8-bit integers;
! 
!    * `int16x4_t', a vector of four signed 16-bit integers;
! 
!    * `int32x2_t', a vector of two signed 32-bit integers.
  
   The intrinsics provided are listed below; each is named after the
  machine instruction to which it corresponds, with suffixes added as
--- 35469,35483 ----
  
  GCC provides intrinsics to access the SIMD instructions provided by the
  ST Microelectronics Loongson-2E and -2F processors.  These intrinsics,
! available after inclusion of the 'loongson.h' header file, operate on
  the following 64-bit vector types:
  
!    * 'uint8x8_t', a vector of eight unsigned 8-bit integers;
!    * 'uint16x4_t', a vector of four unsigned 16-bit integers;
!    * 'uint32x2_t', a vector of two unsigned 32-bit integers;
!    * 'int8x8_t', a vector of eight signed 8-bit integers;
!    * 'int16x4_t', a vector of four signed 16-bit integers;
!    * 'int32x2_t', a vector of two signed 32-bit integers.
  
   The intrinsics provided are listed below; each is named after the
  machine instruction to which it corresponds, with suffixes added as
*************** File: gcc.info,  Node: Paired-Single Ari
*** 35937,35959 ****
  6.58.14.1 Paired-Single Arithmetic
  ..................................
  
! The table below lists the `v2sf' operations for which hardware support
! exists.  `a', `b' and `c' are `v2sf' values and `x' is an integral
  value.
  
  C code                               MIPS instruction
! `a + b'                              `add.ps'
! `a - b'                              `sub.ps'
! `-a'                                 `neg.ps'
! `a * b'                              `mul.ps'
! `a * b + c'                          `madd.ps'
! `a * b - c'                          `msub.ps'
! `-(a * b + c)'                       `nmadd.ps'
! `-(a * b - c)'                       `nmsub.ps'
! `x ? a : b'                          `movn.ps'/`movz.ps'
  
   Note that the multiply-accumulate instructions can be disabled using
! the command-line option `-mno-fused-madd'.
  
  
  File: gcc.info,  Node: Paired-Single Built-in Functions,  Next: MIPS-3D Built-in Functions,  Prev: Paired-Single Arithmetic,  Up: MIPS Loongson Built-in Functions
--- 35598,35620 ----
  6.58.14.1 Paired-Single Arithmetic
  ..................................
  
! The table below lists the 'v2sf' operations for which hardware support
! exists.  'a', 'b' and 'c' are 'v2sf' values and 'x' is an integral
  value.
  
  C code                               MIPS instruction
! 'a + b'                              'add.ps'
! 'a - b'                              'sub.ps'
! '-a'                                 'neg.ps'
! 'a * b'                              'mul.ps'
! 'a * b + c'                          'madd.ps'
! 'a * b - c'                          'msub.ps'
! '-(a * b + c)'                       'nmadd.ps'
! '-(a * b - c)'                       'nmsub.ps'
! 'x ? a : b'                          'movn.ps'/'movz.ps'
  
   Note that the multiply-accumulate instructions can be disabled using
! the command-line option '-mno-fused-madd'.
  
  
  File: gcc.info,  Node: Paired-Single Built-in Functions,  Next: MIPS-3D Built-in Functions,  Prev: Paired-Single Arithmetic,  Up: MIPS Loongson Built-in Functions
*************** File: gcc.info,  Node: Paired-Single Bui
*** 35962,36027 ****
  ..........................................
  
  The following paired-single functions map directly to a particular MIPS
! instruction.  Please refer to the architecture specification for
! details on what each instruction does.
  
! `v2sf __builtin_mips_pll_ps (v2sf, v2sf)'
!      Pair lower lower (`pll.ps').
  
! `v2sf __builtin_mips_pul_ps (v2sf, v2sf)'
!      Pair upper lower (`pul.ps').
  
! `v2sf __builtin_mips_plu_ps (v2sf, v2sf)'
!      Pair lower upper (`plu.ps').
  
! `v2sf __builtin_mips_puu_ps (v2sf, v2sf)'
!      Pair upper upper (`puu.ps').
  
! `v2sf __builtin_mips_cvt_ps_s (float, float)'
!      Convert pair to paired single (`cvt.ps.s').
  
! `float __builtin_mips_cvt_s_pl (v2sf)'
!      Convert pair lower to single (`cvt.s.pl').
  
! `float __builtin_mips_cvt_s_pu (v2sf)'
!      Convert pair upper to single (`cvt.s.pu').
  
! `v2sf __builtin_mips_abs_ps (v2sf)'
!      Absolute value (`abs.ps').
  
! `v2sf __builtin_mips_alnv_ps (v2sf, v2sf, int)'
!      Align variable (`alnv.ps').
  
       _Note:_ The value of the third parameter must be 0 or 4 modulo 8,
!      otherwise the result is unpredictable.  Please read the
!      instruction description for details.
  
   The following multi-instruction functions are also available.  In each
! case, COND can be any of the 16 floating-point conditions: `f', `un',
! `eq', `ueq', `olt', `ult', `ole', `ule', `sf', `ngle', `seq', `ngl',
! `lt', `nge', `le' or `ngt'.
  
! `v2sf __builtin_mips_movt_c_COND_ps (v2sf A, v2sf B, v2sf C, v2sf D)'
! `v2sf __builtin_mips_movf_c_COND_ps (v2sf A, v2sf B, v2sf C, v2sf D)'
!      Conditional move based on floating-point comparison (`c.COND.ps',
!      `movt.ps'/`movf.ps').
  
!      The `movt' functions return the value X computed by:
  
            c.COND.ps CC,A,B
            mov.ps X,C
            movt.ps X,D,CC
  
!      The `movf' functions are similar but use `movf.ps' instead of
!      `movt.ps'.
  
! `int __builtin_mips_upper_c_COND_ps (v2sf A, v2sf B)'
! `int __builtin_mips_lower_c_COND_ps (v2sf A, v2sf B)'
!      Comparison of two paired-single values (`c.COND.ps',
!      `bc1t'/`bc1f').
  
!      These functions compare A and B using `c.COND.ps' and return
!      either the upper or lower half of the result.  For example:
  
            v2sf a, b;
            if (__builtin_mips_upper_c_eq_ps (a, b))
--- 35623,35688 ----
  ..........................................
  
  The following paired-single functions map directly to a particular MIPS
! instruction.  Please refer to the architecture specification for details
! on what each instruction does.
  
! 'v2sf __builtin_mips_pll_ps (v2sf, v2sf)'
!      Pair lower lower ('pll.ps').
  
! 'v2sf __builtin_mips_pul_ps (v2sf, v2sf)'
!      Pair upper lower ('pul.ps').
  
! 'v2sf __builtin_mips_plu_ps (v2sf, v2sf)'
!      Pair lower upper ('plu.ps').
  
! 'v2sf __builtin_mips_puu_ps (v2sf, v2sf)'
!      Pair upper upper ('puu.ps').
  
! 'v2sf __builtin_mips_cvt_ps_s (float, float)'
!      Convert pair to paired single ('cvt.ps.s').
  
! 'float __builtin_mips_cvt_s_pl (v2sf)'
!      Convert pair lower to single ('cvt.s.pl').
  
! 'float __builtin_mips_cvt_s_pu (v2sf)'
!      Convert pair upper to single ('cvt.s.pu').
  
! 'v2sf __builtin_mips_abs_ps (v2sf)'
!      Absolute value ('abs.ps').
  
! 'v2sf __builtin_mips_alnv_ps (v2sf, v2sf, int)'
!      Align variable ('alnv.ps').
  
       _Note:_ The value of the third parameter must be 0 or 4 modulo 8,
!      otherwise the result is unpredictable.  Please read the instruction
!      description for details.
  
   The following multi-instruction functions are also available.  In each
! case, COND can be any of the 16 floating-point conditions: 'f', 'un',
! 'eq', 'ueq', 'olt', 'ult', 'ole', 'ule', 'sf', 'ngle', 'seq', 'ngl',
! 'lt', 'nge', 'le' or 'ngt'.
  
! 'v2sf __builtin_mips_movt_c_COND_ps (v2sf A, v2sf B, v2sf C, v2sf D)'
! 'v2sf __builtin_mips_movf_c_COND_ps (v2sf A, v2sf B, v2sf C, v2sf D)'
!      Conditional move based on floating-point comparison ('c.COND.ps',
!      'movt.ps'/'movf.ps').
  
!      The 'movt' functions return the value X computed by:
  
            c.COND.ps CC,A,B
            mov.ps X,C
            movt.ps X,D,CC
  
!      The 'movf' functions are similar but use 'movf.ps' instead of
!      'movt.ps'.
  
! 'int __builtin_mips_upper_c_COND_ps (v2sf A, v2sf B)'
! 'int __builtin_mips_lower_c_COND_ps (v2sf A, v2sf B)'
!      Comparison of two paired-single values ('c.COND.ps',
!      'bc1t'/'bc1f').
  
!      These functions compare A and B using 'c.COND.ps' and return either
!      the upper or lower half of the result.  For example:
  
            v2sf a, b;
            if (__builtin_mips_upper_c_eq_ps (a, b))
*************** File: gcc.info,  Node: MIPS-3D Built-in
*** 36043,36100 ****
  The MIPS-3D Application-Specific Extension (ASE) includes additional
  paired-single instructions that are designed to improve the performance
  of 3D graphics operations.  Support for these instructions is controlled
! by the `-mips3d' command-line option.
  
   The functions listed below map directly to a particular MIPS-3D
  instruction.  Please refer to the architecture specification for more
  details on what each instruction does.
  
! `v2sf __builtin_mips_addr_ps (v2sf, v2sf)'
!      Reduction add (`addr.ps').
  
! `v2sf __builtin_mips_mulr_ps (v2sf, v2sf)'
!      Reduction multiply (`mulr.ps').
  
! `v2sf __builtin_mips_cvt_pw_ps (v2sf)'
!      Convert paired single to paired word (`cvt.pw.ps').
  
! `v2sf __builtin_mips_cvt_ps_pw (v2sf)'
!      Convert paired word to paired single (`cvt.ps.pw').
  
! `float __builtin_mips_recip1_s (float)'
! `double __builtin_mips_recip1_d (double)'
! `v2sf __builtin_mips_recip1_ps (v2sf)'
!      Reduced-precision reciprocal (sequence step 1) (`recip1.FMT').
  
! `float __builtin_mips_recip2_s (float, float)'
! `double __builtin_mips_recip2_d (double, double)'
! `v2sf __builtin_mips_recip2_ps (v2sf, v2sf)'
!      Reduced-precision reciprocal (sequence step 2) (`recip2.FMT').
  
! `float __builtin_mips_rsqrt1_s (float)'
! `double __builtin_mips_rsqrt1_d (double)'
! `v2sf __builtin_mips_rsqrt1_ps (v2sf)'
       Reduced-precision reciprocal square root (sequence step 1)
!      (`rsqrt1.FMT').
  
! `float __builtin_mips_rsqrt2_s (float, float)'
! `double __builtin_mips_rsqrt2_d (double, double)'
! `v2sf __builtin_mips_rsqrt2_ps (v2sf, v2sf)'
       Reduced-precision reciprocal square root (sequence step 2)
!      (`rsqrt2.FMT').
  
   The following multi-instruction functions are also available.  In each
! case, COND can be any of the 16 floating-point conditions: `f', `un',
! `eq', `ueq', `olt', `ult', `ole', `ule', `sf', `ngle', `seq', `ngl',
! `lt', `nge', `le' or `ngt'.
  
! `int __builtin_mips_cabs_COND_s (float A, float B)'
! `int __builtin_mips_cabs_COND_d (double A, double B)'
!      Absolute comparison of two scalar values (`cabs.COND.FMT',
!      `bc1t'/`bc1f').
  
!      These functions compare A and B using `cabs.COND.s' or
!      `cabs.COND.d' and return the result as a boolean value.  For
       example:
  
            float a, b;
--- 35704,35761 ----
  The MIPS-3D Application-Specific Extension (ASE) includes additional
  paired-single instructions that are designed to improve the performance
  of 3D graphics operations.  Support for these instructions is controlled
! by the '-mips3d' command-line option.
  
   The functions listed below map directly to a particular MIPS-3D
  instruction.  Please refer to the architecture specification for more
  details on what each instruction does.
  
! 'v2sf __builtin_mips_addr_ps (v2sf, v2sf)'
!      Reduction add ('addr.ps').
  
! 'v2sf __builtin_mips_mulr_ps (v2sf, v2sf)'
!      Reduction multiply ('mulr.ps').
  
! 'v2sf __builtin_mips_cvt_pw_ps (v2sf)'
!      Convert paired single to paired word ('cvt.pw.ps').
  
! 'v2sf __builtin_mips_cvt_ps_pw (v2sf)'
!      Convert paired word to paired single ('cvt.ps.pw').
  
! 'float __builtin_mips_recip1_s (float)'
! 'double __builtin_mips_recip1_d (double)'
! 'v2sf __builtin_mips_recip1_ps (v2sf)'
!      Reduced-precision reciprocal (sequence step 1) ('recip1.FMT').
  
! 'float __builtin_mips_recip2_s (float, float)'
! 'double __builtin_mips_recip2_d (double, double)'
! 'v2sf __builtin_mips_recip2_ps (v2sf, v2sf)'
!      Reduced-precision reciprocal (sequence step 2) ('recip2.FMT').
  
! 'float __builtin_mips_rsqrt1_s (float)'
! 'double __builtin_mips_rsqrt1_d (double)'
! 'v2sf __builtin_mips_rsqrt1_ps (v2sf)'
       Reduced-precision reciprocal square root (sequence step 1)
!      ('rsqrt1.FMT').
  
! 'float __builtin_mips_rsqrt2_s (float, float)'
! 'double __builtin_mips_rsqrt2_d (double, double)'
! 'v2sf __builtin_mips_rsqrt2_ps (v2sf, v2sf)'
       Reduced-precision reciprocal square root (sequence step 2)
!      ('rsqrt2.FMT').
  
   The following multi-instruction functions are also available.  In each
! case, COND can be any of the 16 floating-point conditions: 'f', 'un',
! 'eq', 'ueq', 'olt', 'ult', 'ole', 'ule', 'sf', 'ngle', 'seq', 'ngl',
! 'lt', 'nge', 'le' or 'ngt'.
  
! 'int __builtin_mips_cabs_COND_s (float A, float B)'
! 'int __builtin_mips_cabs_COND_d (double A, double B)'
!      Absolute comparison of two scalar values ('cabs.COND.FMT',
!      'bc1t'/'bc1f').
  
!      These functions compare A and B using 'cabs.COND.s' or
!      'cabs.COND.d' and return the result as a boolean value.  For
       example:
  
            float a, b;
*************** case, COND can be any of the 16 floating
*** 36103,36114 ****
            else
              false ();
  
! `int __builtin_mips_upper_cabs_COND_ps (v2sf A, v2sf B)'
! `int __builtin_mips_lower_cabs_COND_ps (v2sf A, v2sf B)'
!      Absolute comparison of two paired-single values (`cabs.COND.ps',
!      `bc1t'/`bc1f').
  
!      These functions compare A and B using `cabs.COND.ps' and return
       either the upper or lower half of the result.  For example:
  
            v2sf a, b;
--- 35764,35775 ----
            else
              false ();
  
! 'int __builtin_mips_upper_cabs_COND_ps (v2sf A, v2sf B)'
! 'int __builtin_mips_lower_cabs_COND_ps (v2sf A, v2sf B)'
!      Absolute comparison of two paired-single values ('cabs.COND.ps',
!      'bc1t'/'bc1f').
  
!      These functions compare A and B using 'cabs.COND.ps' and return
       either the upper or lower half of the result.  For example:
  
            v2sf a, b;
*************** case, COND can be any of the 16 floating
*** 36122,36152 ****
            else
              lower_halves_are_unequal ();
  
! `v2sf __builtin_mips_movt_cabs_COND_ps (v2sf A, v2sf B, v2sf C, v2sf D)'
! `v2sf __builtin_mips_movf_cabs_COND_ps (v2sf A, v2sf B, v2sf C, v2sf D)'
!      Conditional move based on absolute comparison (`cabs.COND.ps',
!      `movt.ps'/`movf.ps').
  
!      The `movt' functions return the value X computed by:
  
            cabs.COND.ps CC,A,B
            mov.ps X,C
            movt.ps X,D,CC
  
!      The `movf' functions are similar but use `movf.ps' instead of
!      `movt.ps'.
  
! `int __builtin_mips_any_c_COND_ps (v2sf A, v2sf B)'
! `int __builtin_mips_all_c_COND_ps (v2sf A, v2sf B)'
! `int __builtin_mips_any_cabs_COND_ps (v2sf A, v2sf B)'
! `int __builtin_mips_all_cabs_COND_ps (v2sf A, v2sf B)'
!      Comparison of two paired-single values (`c.COND.ps'/`cabs.COND.ps',
!      `bc1any2t'/`bc1any2f').
  
!      These functions compare A and B using `c.COND.ps' or
!      `cabs.COND.ps'.  The `any' forms return true if either result is
!      true and the `all' forms return true if both results are true.
!      For example:
  
            v2sf a, b;
            if (__builtin_mips_any_c_eq_ps (a, b))
--- 35783,35813 ----
            else
              lower_halves_are_unequal ();
  
! 'v2sf __builtin_mips_movt_cabs_COND_ps (v2sf A, v2sf B, v2sf C, v2sf D)'
! 'v2sf __builtin_mips_movf_cabs_COND_ps (v2sf A, v2sf B, v2sf C, v2sf D)'
!      Conditional move based on absolute comparison ('cabs.COND.ps',
!      'movt.ps'/'movf.ps').
  
!      The 'movt' functions return the value X computed by:
  
            cabs.COND.ps CC,A,B
            mov.ps X,C
            movt.ps X,D,CC
  
!      The 'movf' functions are similar but use 'movf.ps' instead of
!      'movt.ps'.
  
! 'int __builtin_mips_any_c_COND_ps (v2sf A, v2sf B)'
! 'int __builtin_mips_all_c_COND_ps (v2sf A, v2sf B)'
! 'int __builtin_mips_any_cabs_COND_ps (v2sf A, v2sf B)'
! 'int __builtin_mips_all_cabs_COND_ps (v2sf A, v2sf B)'
!      Comparison of two paired-single values ('c.COND.ps'/'cabs.COND.ps',
!      'bc1any2t'/'bc1any2f').
  
!      These functions compare A and B using 'c.COND.ps' or
!      'cabs.COND.ps'.  The 'any' forms return true if either result is
!      true and the 'all' forms return true if both results are true.  For
!      example:
  
            v2sf a, b;
            if (__builtin_mips_any_c_eq_ps (a, b))
*************** case, COND can be any of the 16 floating
*** 36159,36175 ****
            else
              one_is_false ();
  
! `int __builtin_mips_any_c_COND_4s (v2sf A, v2sf B, v2sf C, v2sf D)'
! `int __builtin_mips_all_c_COND_4s (v2sf A, v2sf B, v2sf C, v2sf D)'
! `int __builtin_mips_any_cabs_COND_4s (v2sf A, v2sf B, v2sf C, v2sf D)'
! `int __builtin_mips_all_cabs_COND_4s (v2sf A, v2sf B, v2sf C, v2sf D)'
       Comparison of four paired-single values
!      (`c.COND.ps'/`cabs.COND.ps', `bc1any4t'/`bc1any4f').
  
!      These functions use `c.COND.ps' or `cabs.COND.ps' to compare A
!      with B and to compare C with D.  The `any' forms return true if
!      any of the four results are true and the `all' forms return true
!      if all four results are true.  For example:
  
            v2sf a, b, c, d;
            if (__builtin_mips_any_c_eq_4s (a, b, c, d))
--- 35820,35836 ----
            else
              one_is_false ();
  
! 'int __builtin_mips_any_c_COND_4s (v2sf A, v2sf B, v2sf C, v2sf D)'
! 'int __builtin_mips_all_c_COND_4s (v2sf A, v2sf B, v2sf C, v2sf D)'
! 'int __builtin_mips_any_cabs_COND_4s (v2sf A, v2sf B, v2sf C, v2sf D)'
! 'int __builtin_mips_all_cabs_COND_4s (v2sf A, v2sf B, v2sf C, v2sf D)'
       Comparison of four paired-single values
!      ('c.COND.ps'/'cabs.COND.ps', 'bc1any4t'/'bc1any4f').
  
!      These functions use 'c.COND.ps' or 'cabs.COND.ps' to compare A with
!      B and to compare C with D.  The 'any' forms return true if any of
!      the four results are true and the 'all' forms return true if all
!      four results are true.  For example:
  
            v2sf a, b, c, d;
            if (__builtin_mips_any_c_eq_4s (a, b, c, d))
*************** File: gcc.info,  Node: Other MIPS Built-
*** 36190,36208 ****
  
  GCC provides other MIPS-specific built-in functions:
  
! `void __builtin_mips_cache (int OP, const volatile void *ADDR)'
!      Insert a `cache' instruction with operands OP and ADDR.  GCC
!      defines the preprocessor macro `___GCC_HAVE_BUILTIN_MIPS_CACHE'
       when this function is available.
  
! `unsigned int __builtin_mips_get_fcsr (void)'
! `void __builtin_mips_set_fcsr (unsigned int VALUE)'
       Get and set the contents of the floating-point control and status
       register (FPU control register 31).  These functions are only
       available in hard-float code but can be called in both MIPS16 and
       non-MIPS16 contexts.
  
!      `__builtin_mips_set_fcsr' can be used to change any bit of the
       register except the condition codes, which GCC assumes are
       preserved.
  
--- 35851,35869 ----
  
  GCC provides other MIPS-specific built-in functions:
  
! 'void __builtin_mips_cache (int OP, const volatile void *ADDR)'
!      Insert a 'cache' instruction with operands OP and ADDR.  GCC
!      defines the preprocessor macro '___GCC_HAVE_BUILTIN_MIPS_CACHE'
       when this function is available.
  
! 'unsigned int __builtin_mips_get_fcsr (void)'
! 'void __builtin_mips_set_fcsr (unsigned int VALUE)'
       Get and set the contents of the floating-point control and status
       register (FPU control register 31).  These functions are only
       available in hard-float code but can be called in both MIPS16 and
       non-MIPS16 contexts.
  
!      '__builtin_mips_set_fcsr' can be used to change any bit of the
       register except the condition codes, which GCC assumes are
       preserved.
  
*************** File: gcc.info,  Node: MSP430 Built-in F
*** 36212,36233 ****
  6.58.16 MSP430 Built-in Functions
  ---------------------------------
  
! GCC provides a couple of special builtin functions to aid in the
! writing of interrupt handlers in C.
  
! `__bic_SR_register_on_exit (int MASK)'
       This clears the indicated bits in the saved copy of the status
       register currently residing on the stack.  This only works inside
!      interrupt handlers and the changes to the status register will
!      only take affect once the handler returns.
  
! `__bis_SR_register_on_exit (int MASK)'
       This sets the indicated bits in the saved copy of the status
       register currently residing on the stack.  This only works inside
!      interrupt handlers and the changes to the status register will
!      only take affect once the handler returns.
  
! `__delay_cycles (long long CYCLES)'
       This inserts an instruction sequence that takes exactly CYCLES
       cycles (between 0 and about 17E9) to complete.  The inserted
       sequence may use jumps, loops, or no-ops, and does not interfere
--- 35873,35894 ----
  6.58.16 MSP430 Built-in Functions
  ---------------------------------
  
! GCC provides a couple of special builtin functions to aid in the writing
! of interrupt handlers in C.
  
! '__bic_SR_register_on_exit (int MASK)'
       This clears the indicated bits in the saved copy of the status
       register currently residing on the stack.  This only works inside
!      interrupt handlers and the changes to the status register will only
!      take affect once the handler returns.
  
! '__bis_SR_register_on_exit (int MASK)'
       This sets the indicated bits in the saved copy of the status
       register currently residing on the stack.  This only works inside
!      interrupt handlers and the changes to the status register will only
!      take affect once the handler returns.
  
! '__delay_cycles (long long CYCLES)'
       This inserts an instruction sequence that takes exactly CYCLES
       cycles (between 0 and about 17E9) to complete.  The inserted
       sequence may use jumps, loops, or no-ops, and does not interfere
*************** File: gcc.info,  Node: picoChip Built-in
*** 36278,36311 ****
  GCC provides an interface to selected machine instructions from the
  picoChip instruction set.
  
! `int __builtin_sbc (int VALUE)'
       Sign bit count.  Return the number of consecutive bits in VALUE
!      that have the same value as the sign bit.  The result is the
!      number of leading sign bits minus one, giving the number of
!      redundant sign bits in VALUE.
  
! `int __builtin_byteswap (int VALUE)'
!      Byte swap.  Return the result of swapping the upper and lower
!      bytes of VALUE.
  
! `int __builtin_brev (int VALUE)'
       Bit reversal.  Return the result of reversing the bits in VALUE.
       Bit 15 is swapped with bit 0, bit 14 is swapped with bit 1, and so
       on.
  
! `int __builtin_adds (int X, int Y)'
       Saturating addition.  Return the result of adding X and Y, storing
       the value 32767 if the result overflows.
  
! `int __builtin_subs (int X, int Y)'
!      Saturating subtraction.  Return the result of subtracting Y from
!      X, storing the value -32768 if the result overflows.
  
! `void __builtin_halt (void)'
       Halt.  The processor stops execution.  This built-in is useful for
       implementing assertions.
  
- 
  
  File: gcc.info,  Node: PowerPC Built-in Functions,  Next: PowerPC AltiVec/VSX Built-in Functions,  Prev: picoChip Built-in Functions,  Up: Target Builtins
  
--- 35939,35971 ----
  GCC provides an interface to selected machine instructions from the
  picoChip instruction set.
  
! 'int __builtin_sbc (int VALUE)'
       Sign bit count.  Return the number of consecutive bits in VALUE
!      that have the same value as the sign bit.  The result is the number
!      of leading sign bits minus one, giving the number of redundant sign
!      bits in VALUE.
  
! 'int __builtin_byteswap (int VALUE)'
!      Byte swap.  Return the result of swapping the upper and lower bytes
!      of VALUE.
  
! 'int __builtin_brev (int VALUE)'
       Bit reversal.  Return the result of reversing the bits in VALUE.
       Bit 15 is swapped with bit 0, bit 14 is swapped with bit 1, and so
       on.
  
! 'int __builtin_adds (int X, int Y)'
       Saturating addition.  Return the result of adding X and Y, storing
       the value 32767 if the result overflows.
  
! 'int __builtin_subs (int X, int Y)'
!      Saturating subtraction.  Return the result of subtracting Y from X,
!      storing the value -32768 if the result overflows.
  
! 'void __builtin_halt (void)'
       Halt.  The processor stops execution.  This built-in is useful for
       implementing assertions.
  
  
  File: gcc.info,  Node: PowerPC Built-in Functions,  Next: PowerPC AltiVec/VSX Built-in Functions,  Prev: picoChip Built-in Functions,  Up: Target Builtins
  
*************** processors:
*** 36323,36347 ****
       double __builtin_unpack_longdouble (long double, int);
       long double __builtin_pack_longdouble (double, double);
  
!  The `vec_rsqrt', `__builtin_rsqrt', and `__builtin_rsqrtf' functions
  generate multiple instructions to implement the reciprocal sqrt
  functionality using reciprocal sqrt estimate instructions.
  
!  The `__builtin_recipdiv', and `__builtin_recipdivf' functions generate
  multiple instructions to implement division using the reciprocal
  estimate instructions.
  
!  The `__builtin_ppc_get_timebase' and `__builtin_ppc_mftb' functions
  generate instructions to read the Time Base Register.  The
! `__builtin_ppc_get_timebase' function may generate multiple
! instructions and always returns the 64 bits of the Time Base Register.
! The `__builtin_ppc_mftb' function always generates one instruction and
  returns the Time Base Register value as an unsigned long, throwing away
  the most significant word on 32-bit environments.
  
   The following built-in functions are available for the PowerPC family
! of processors, starting with ISA 2.06 or later (`-mcpu=power7' or
! `-mpopcntd'):
       long __builtin_bpermd (long, long);
       int __builtin_divwe (int, int);
       int __builtin_divweo (int, int);
--- 35983,36007 ----
       double __builtin_unpack_longdouble (long double, int);
       long double __builtin_pack_longdouble (double, double);
  
!  The 'vec_rsqrt', '__builtin_rsqrt', and '__builtin_rsqrtf' functions
  generate multiple instructions to implement the reciprocal sqrt
  functionality using reciprocal sqrt estimate instructions.
  
!  The '__builtin_recipdiv', and '__builtin_recipdivf' functions generate
  multiple instructions to implement division using the reciprocal
  estimate instructions.
  
!  The '__builtin_ppc_get_timebase' and '__builtin_ppc_mftb' functions
  generate instructions to read the Time Base Register.  The
! '__builtin_ppc_get_timebase' function may generate multiple instructions
! and always returns the 64 bits of the Time Base Register.  The
! '__builtin_ppc_mftb' function always generates one instruction and
  returns the Time Base Register value as an unsigned long, throwing away
  the most significant word on 32-bit environments.
  
   The following built-in functions are available for the PowerPC family
! of processors, starting with ISA 2.06 or later ('-mcpu=power7' or
! '-mpopcntd'):
       long __builtin_bpermd (long, long);
       int __builtin_divwe (int, int);
       int __builtin_divweo (int, int);
*************** of processors, starting with ISA 2.06 or
*** 36355,36375 ****
       unsigned int cbcdtd (unsigned int);
       unsigned int addg6s (unsigned int, unsigned int);
  
!  The `__builtin_divde', `__builtin_divdeo', `__builtin_divdeu',
! `__builtin_divdeou' functions require a 64-bit environment support ISA
  2.06 or later.
  
   The following built-in functions are available for the PowerPC family
! of processors when hardware decimal floating point (`-mhard-dfp') is
  available:
!      _Decimal64 __builtin_dxex (_Decimal64);
!      _Decimal128 __builtin_dxexq (_Decimal128);
       _Decimal64 __builtin_ddedpd (int, _Decimal64);
       _Decimal128 __builtin_ddedpdq (int, _Decimal128);
       _Decimal64 __builtin_denbcd (int, _Decimal64);
       _Decimal128 __builtin_denbcdq (int, _Decimal128);
!      _Decimal64 __builtin_diex (_Decimal64, _Decimal64);
!      _Decimal128 _builtin_diexq (_Decimal128, _Decimal128);
       _Decimal64 __builtin_dscli (_Decimal64, int);
       _Decimal128 __builtin_dscliq (_Decimal128, int);
       _Decimal64 __builtin_dscri (_Decimal64, int);
--- 36015,36035 ----
       unsigned int cbcdtd (unsigned int);
       unsigned int addg6s (unsigned int, unsigned int);
  
!  The '__builtin_divde', '__builtin_divdeo', '__builtin_divdeu',
! '__builtin_divdeou' functions require a 64-bit environment support ISA
  2.06 or later.
  
   The following built-in functions are available for the PowerPC family
! of processors when hardware decimal floating point ('-mhard-dfp') is
  available:
!      long long __builtin_dxex (_Decimal64);
!      long long __builtin_dxexq (_Decimal128);
       _Decimal64 __builtin_ddedpd (int, _Decimal64);
       _Decimal128 __builtin_ddedpdq (int, _Decimal128);
       _Decimal64 __builtin_denbcd (int, _Decimal64);
       _Decimal128 __builtin_denbcdq (int, _Decimal128);
!      _Decimal64 __builtin_diex (long long, _Decimal64);
!      _Decimal128 _builtin_diexq (long long, _Decimal128);
       _Decimal64 __builtin_dscli (_Decimal64, int);
       _Decimal128 __builtin_dscliq (_Decimal128, int);
       _Decimal64 __builtin_dscri (_Decimal64, int);
*************** File: gcc.info,  Node: PowerPC AltiVec/V
*** 36392,36398 ****
  GCC provides an interface for the PowerPC family of processors to access
  the AltiVec operations described in Motorola's AltiVec Programming
  Interface Manual.  The interface is made available by including
! `<altivec.h>' and using `-maltivec' and `-mabi=altivec'.  The interface
  supports the following vector types.
  
       vector unsigned char
--- 36052,36058 ----
  GCC provides an interface for the PowerPC family of processors to access
  the AltiVec operations described in Motorola's AltiVec Programming
  Interface Manual.  The interface is made available by including
! '<altivec.h>' and using '-maltivec' and '-mabi=altivec'.  The interface
  supports the following vector types.
  
       vector unsigned char
*************** supports the following vector types.
*** 36409,36423 ****
       vector bool int
       vector float
  
!  If `-mvsx' is used the following additional vector types are
  implemented.
  
       vector unsigned long
       vector signed long
       vector double
  
!  The long types are only implemented for 64-bit code generation, and
! the long type is only used in the floating point/integer conversion
  instructions.
  
   GCC's implementation of the high-level language interface available
--- 36069,36083 ----
       vector bool int
       vector float
  
!  If '-mvsx' is used the following additional vector types are
  implemented.
  
       vector unsigned long
       vector signed long
       vector double
  
!  The long types are only implemented for 64-bit code generation, and the
! long type is only used in the floating point/integer conversion
  instructions.
  
   GCC's implementation of the high-level language interface available
*************** ways.
*** 36430,36447 ****
     * A vector initializer requires no cast if the vector constant is of
       the same type as the variable it is initializing.
  
!    * If `signed' or `unsigned' is omitted, the signedness of the vector
       type is the default signedness of the base type.  The default
       varies depending on the operating system, so a portable program
       should always specify the signedness.
  
!    * Compiling with `-maltivec' adds keywords `__vector', `vector',
!      `__pixel', `pixel', `__bool' and `bool'.  When compiling ISO C,
!      the context-sensitive substitution of the keywords `vector',
!      `pixel' and `bool' is disabled.  To use them, you must include
!      `<altivec.h>' instead.
  
!    * GCC allows using a `typedef' name as the type specifier for a
       vector type.
  
     * For C, overloaded functions are implemented with macros so the
--- 36090,36107 ----
     * A vector initializer requires no cast if the vector constant is of
       the same type as the variable it is initializing.
  
!    * If 'signed' or 'unsigned' is omitted, the signedness of the vector
       type is the default signedness of the base type.  The default
       varies depending on the operating system, so a portable program
       should always specify the signedness.
  
!    * Compiling with '-maltivec' adds keywords '__vector', 'vector',
!      '__pixel', 'pixel', '__bool' and 'bool'.  When compiling ISO C, the
!      context-sensitive substitution of the keywords 'vector', 'pixel'
!      and 'bool' is disabled.  To use them, you must include
!      '<altivec.h>' instead.
  
!    * GCC allows using a 'typedef' name as the type specifier for a
       vector type.
  
     * For C, overloaded functions are implemented with macros so the
*************** ways.
*** 36449,36460 ****
  
              vec_add ((vector signed int){1, 2, 3, 4}, foo);
  
!      Since `vec_add' is a macro, the vector constant in the example is
       treated as four separate arguments.  Wrap the entire argument in
       parentheses for this to work.
  
!  _Note:_ Only the `<altivec.h>' interface is supported.  Internally,
! GCC uses built-in functions to achieve the functionality in the
  aforementioned header file, but they are not supported and are subject
  to change without notice.
  
--- 36109,36120 ----
  
              vec_add ((vector signed int){1, 2, 3, 4}, foo);
  
!      Since 'vec_add' is a macro, the vector constant in the example is
       treated as four separate arguments.  Wrap the entire argument in
       parentheses for this to work.
  
!  _Note:_ Only the '<altivec.h>' interface is supported.  Internally, GCC
! uses built-in functions to achieve the functionality in the
  aforementioned header file, but they are not supported and are subject
  to change without notice.
  
*************** a direct mapping between generic and spe
*** 36464,36470 ****
  generic names are shown here, although the specific operations can also
  be used.
  
!  Arguments that are documented as `const int' require literal integral
  values within the range required for that operation.
  
       vector signed char vec_abs (vector signed char);
--- 36124,36130 ----
  generic names are shown here, although the specific operations can also
  be used.
  
!  Arguments that are documented as 'const int' require literal integral
  values within the range required for that operation.
  
       vector signed char vec_abs (vector signed char);
*************** additional functions are available:
*** 38495,38514 ****
       void vec_vsx_st (vector bool char, int, unsigned char *);
       void vec_vsx_st (vector bool char, int, signed char *);
  
!      vector double vec_xxpermdi (vector double, vector double, int);
!      vector float vec_xxpermdi (vector float, vector float, int);
!      vector long long vec_xxpermdi (vector long long, vector long long, int);
       vector unsigned long long vec_xxpermdi (vector unsigned long long,
!                                              vector unsigned long long, int);
!      vector int vec_xxpermdi (vector int, vector int, int);
       vector unsigned int vec_xxpermdi (vector unsigned int,
!                                        vector unsigned int, int);
!      vector short vec_xxpermdi (vector short, vector short, int);
       vector unsigned short vec_xxpermdi (vector unsigned short,
!                                          vector unsigned short, int);
!      vector signed char vec_xxpermdi (vector signed char, vector signed char, int);
       vector unsigned char vec_xxpermdi (vector unsigned char,
!                                         vector unsigned char, int);
  
       vector double vec_xxsldi (vector double, vector double, int);
       vector float vec_xxsldi (vector float, vector float, int);
--- 38155,38175 ----
       void vec_vsx_st (vector bool char, int, unsigned char *);
       void vec_vsx_st (vector bool char, int, signed char *);
  
!      vector double vec_xxpermdi (vector double, vector double, const int);
!      vector float vec_xxpermdi (vector float, vector float, const int);
!      vector long long vec_xxpermdi (vector long long, vector long long, const int);
       vector unsigned long long vec_xxpermdi (vector unsigned long long,
!                                              vector unsigned long long, const int);
!      vector int vec_xxpermdi (vector int, vector int, const int);
       vector unsigned int vec_xxpermdi (vector unsigned int,
!                                        vector unsigned int, const int);
!      vector short vec_xxpermdi (vector short, vector short, const int);
       vector unsigned short vec_xxpermdi (vector unsigned short,
!                                          vector unsigned short, const int);
!      vector signed char vec_xxpermdi (vector signed char, vector signed char,
!                                       const int);
       vector unsigned char vec_xxpermdi (vector unsigned char,
!                                         vector unsigned char, const int);
  
       vector double vec_xxsldi (vector double, vector double, int);
       vector float vec_xxsldi (vector float, vector float, int);
*************** additional functions are available:
*** 38524,38533 ****
       vector unsigned char vec_xxsldi (vector unsigned char,
                                        vector unsigned char, int);
  
!  Note that the `vec_ld' and `vec_st' built-in functions always generate
! the AltiVec `LVX' and `STVX' instructions even if the VSX instruction
! set is available.  The `vec_vsx_ld' and `vec_vsx_st' built-in functions
! always generate the VSX `LXVD2X', `LXVW4X', `STXVD2X', and `STXVW4X'
  instructions.
  
   If the ISA 2.07 additions to the vector/scalar (power8-vector)
--- 38185,38194 ----
       vector unsigned char vec_xxsldi (vector unsigned char,
                                        vector unsigned char, int);
  
!  Note that the 'vec_ld' and 'vec_st' built-in functions always generate
! the AltiVec 'LVX' and 'STVX' instructions even if the VSX instruction
! set is available.  The 'vec_vsx_ld' and 'vec_vsx_st' built-in functions
! always generate the VSX 'LXVD2X', 'LXVW4X', 'STXVD2X', and 'STXVW4X'
  instructions.
  
   If the ISA 2.07 additions to the vector/scalar (power8-vector)
*************** VECTOR UNSIGNED LONG LONG.
*** 38844,38854 ****
   If the ISA 2.07 additions to the vector/scalar (power8-vector)
  instruction set is available, the following additional functions are
  available for 64-bit targets.  New vector types (VECTOR __INT128_T and
! VECTOR __UINT128_T) are available to hold the __INT128_T and
! __UINT128_T types to use these builtins.
  
!  The normal vector extract, and set operations work on VECTOR
! __INT128_T and VECTOR __UINT128_T types, but the index value must be 0.
  
       vector __int128_t vec_vaddcuq (vector __int128_t, vector __int128_t);
       vector __uint128_t vec_vaddcuq (vector __uint128_t, vector __uint128_t);
--- 38505,38515 ----
   If the ISA 2.07 additions to the vector/scalar (power8-vector)
  instruction set is available, the following additional functions are
  available for 64-bit targets.  New vector types (VECTOR __INT128_T and
! VECTOR __UINT128_T) are available to hold the __INT128_T and __UINT128_T
! types to use these builtins.
  
!  The normal vector extract, and set operations work on VECTOR __INT128_T
! and VECTOR __UINT128_T types, but the index value must be 0.
  
       vector __int128_t vec_vaddcuq (vector __int128_t, vector __int128_t);
       vector __uint128_t vec_vaddcuq (vector __uint128_t, vector __uint128_t);
*************** __INT128_T and VECTOR __UINT128_T types,
*** 38893,38900 ****
       int __builtin_bcdsub_gt (vector __int128_t, vector__int128_t);
       int __builtin_bcdsub_ov (vector __int128_t, vector__int128_t);
  
!  If the cryptographic instructions are enabled (`-mcrypto' or
! `-mcpu=power8'), the following builtins are enabled.
  
       vector unsigned long long __builtin_crypto_vsbox (vector unsigned long long);
  
--- 38554,38561 ----
       int __builtin_bcdsub_gt (vector __int128_t, vector__int128_t);
       int __builtin_bcdsub_ov (vector __int128_t, vector__int128_t);
  
!  If the cryptographic instructions are enabled ('-mcrypto' or
! '-mcpu=power8'), the following builtins are enabled.
  
       vector unsigned long long __builtin_crypto_vsbox (vector unsigned long long);
  
*************** __INT128_T and VECTOR __UINT128_T types,
*** 38947,38955 ****
                                                        int, int);
  
   The second argument to the __BUILTIN_CRYPTO_VSHASIGMAD and
! __BUILTIN_CRYPTO_VSHASIGMAW builtin functions must be a constant
! integer that is 0 or 1.  The third argument to these builtin functions
! must be a constant integer in the range of 0 to 15.
  
  
  File: gcc.info,  Node: PowerPC Hardware Transactional Memory Built-in Functions,  Next: RX Built-in Functions,  Prev: PowerPC AltiVec/VSX Built-in Functions,  Up: Target Builtins
--- 38608,38616 ----
                                                        int, int);
  
   The second argument to the __BUILTIN_CRYPTO_VSHASIGMAD and
! __BUILTIN_CRYPTO_VSHASIGMAW builtin functions must be a constant integer
! that is 0 or 1.  The third argument to these builtin functions must be a
! constant integer in the range of 0 to 15.
  
  
  File: gcc.info,  Node: PowerPC Hardware Transactional Memory Built-in Functions,  Next: RX Built-in Functions,  Prev: PowerPC AltiVec/VSX Built-in Functions,  Up: Target Builtins
*************** between PowerPC and S/390.
*** 38967,38986 ****
  6.58.21.1 PowerPC HTM Low Level Built-in Functions
  ..................................................
  
! The following low level built-in functions are available with `-mhtm'
! or `-mcpu=CPU' where CPU is `power8' or later.  They all generate the
  machine instruction that is part of the name.
  
!  The HTM builtins (with the exception of `__builtin_tbegin') return the
  full 4-bit condition register value set by their associated hardware
! instruction.  The header file `htmintrin.h' defines some macros that can
! be used to decipher the return value.  The `__builtin_tbegin' builtin
  returns a simple true or false value depending on whether a transaction
  was successfully started or not.  The arguments of the builtins match
  exactly the type and order of the associated hardware instruction's
! operands, except for the `__builtin_tcheck' builtin, which does not
! take any input arguments.  Refer to the ISA manual for a description of
! each instruction's operands.
  
       unsigned int __builtin_tbegin (unsigned int)
       unsigned int __builtin_tend (unsigned int)
--- 38628,38647 ----
  6.58.21.1 PowerPC HTM Low Level Built-in Functions
  ..................................................
  
! The following low level built-in functions are available with '-mhtm' or
! '-mcpu=CPU' where CPU is 'power8' or later.  They all generate the
  machine instruction that is part of the name.
  
!  The HTM builtins (with the exception of '__builtin_tbegin') return the
  full 4-bit condition register value set by their associated hardware
! instruction.  The header file 'htmintrin.h' defines some macros that can
! be used to decipher the return value.  The '__builtin_tbegin' builtin
  returns a simple true or false value depending on whether a transaction
  was successfully started or not.  The arguments of the builtins match
  exactly the type and order of the associated hardware instruction's
! operands, except for the '__builtin_tcheck' builtin, which does not take
! any input arguments.  Refer to the ISA manual for a description of each
! instruction's operands.
  
       unsigned int __builtin_tbegin (unsigned int)
       unsigned int __builtin_tend (unsigned int)
*************** some common extended mnemonics of the HT
*** 39005,39013 ****
  
   Note that the semantics of the above HTM builtins are required to mimic
  the locking semantics used for critical sections.  Builtins that are
! used to create a new transaction or restart a suspended transaction
! must have lock acquisition like semantics while those builtins that end
! or suspend a transaction must have lock release like semantics.
  Specifically, this must mimic lock semantics as specified by C++11, for
  example: Lock acquisition is as-if an execution of
  __atomic_exchange_n(&globallock,1,__ATOMIC_ACQUIRE) that returns 0, and
--- 38666,38674 ----
  
   Note that the semantics of the above HTM builtins are required to mimic
  the locking semantics used for critical sections.  Builtins that are
! used to create a new transaction or restart a suspended transaction must
! have lock acquisition like semantics while those builtins that end or
! suspend a transaction must have lock release like semantics.
  Specifically, this must mimic lock semantics as specified by C++11, for
  example: Lock acquisition is as-if an execution of
  __atomic_exchange_n(&globallock,1,__ATOMIC_ACQUIRE) that returns 0, and
*************** the builtins in a way that would violate
*** 39021,39034 ****
  accomplished by adding memory barriers to the associated HTM
  instructions (which is a conservative approach to provide acquire and
  release semantics).  Earlier versions of the compiler did not treat the
! HTM instructions as memory barriers.  A `__TM_FENCE__' macro has been
  added, which can be used to determine whether the current compiler
! treats HTM instructions as memory barriers or not.  This allows the
! user to explicitly add memory barriers to their code when using an
! older version of the compiler.
  
!  The following set of built-in functions are available to gain access
! to the HTM specific special purpose registers.
  
       unsigned long __builtin_get_texasr (void)
       unsigned long __builtin_get_texasru (void)
--- 38682,38695 ----
  accomplished by adding memory barriers to the associated HTM
  instructions (which is a conservative approach to provide acquire and
  release semantics).  Earlier versions of the compiler did not treat the
! HTM instructions as memory barriers.  A '__TM_FENCE__' macro has been
  added, which can be used to determine whether the current compiler
! treats HTM instructions as memory barriers or not.  This allows the user
! to explicitly add memory barriers to their code when using an older
! version of the compiler.
  
!  The following set of built-in functions are available to gain access to
! the HTM specific special purpose registers.
  
       unsigned long __builtin_get_texasr (void)
       unsigned long __builtin_get_texasru (void)
*************** to the HTM specific special purpose regi
*** 39074,39080 ****
  
   One final built-in function has been added that returns the value of
  the 2-bit Transaction State field of the Machine Status Register (MSR)
! as stored in `CR0'.
  
       unsigned long __builtin_ttest (void)
  
--- 38735,38741 ----
  
   One final built-in function has been added that returns the value of
  the 2-bit Transaction State field of the Machine Status Register (MSR)
! as stored in 'CR0'.
  
       unsigned long __builtin_ttest (void)
  
*************** using the following code example:
*** 39102,39111 ****
  .................................................
  
  The following high level HTM interface is made available by including
! `<htmxlintrin.h>' and using `-mhtm' or `-mcpu=CPU' where CPU is
! `power8' or later.  This interface is common between PowerPC and S/390,
! allowing users to write one HTM source implementation that can be
! compiled and executed on either system.
  
       long __TM_simple_begin (void)
       long __TM_begin (void* const TM_buff)
--- 38763,38772 ----
  .................................................
  
  The following high level HTM interface is made available by including
! '<htmxlintrin.h>' and using '-mhtm' or '-mcpu=CPU' where CPU is 'power8'
! or later.  This interface is common between PowerPC and S/390, allowing
! users to write one HTM source implementation that can be compiled and
! executed on either system.
  
       long __TM_simple_begin (void)
       long __TM_begin (void* const TM_buff)
*************** the C programming language via the use o
*** 39172,39263 ****
  following functions are supported:
  
   -- Built-in Function: void __builtin_rx_brk (void)
!      Generates the `brk' machine instruction.
  
   -- Built-in Function: void __builtin_rx_clrpsw (int)
!      Generates the `clrpsw' machine instruction to clear the specified
       bit in the processor status word.
  
   -- Built-in Function: void __builtin_rx_int (int)
!      Generates the `int' machine instruction to generate an interrupt
       with the specified value.
  
   -- Built-in Function: void __builtin_rx_machi (int, int)
!      Generates the `machi' machine instruction to add the result of
       multiplying the top 16 bits of the two arguments into the
       accumulator.
  
   -- Built-in Function: void __builtin_rx_maclo (int, int)
!      Generates the `maclo' machine instruction to add the result of
       multiplying the bottom 16 bits of the two arguments into the
       accumulator.
  
   -- Built-in Function: void __builtin_rx_mulhi (int, int)
!      Generates the `mulhi' machine instruction to place the result of
       multiplying the top 16 bits of the two arguments into the
       accumulator.
  
   -- Built-in Function: void __builtin_rx_mullo (int, int)
!      Generates the `mullo' machine instruction to place the result of
       multiplying the bottom 16 bits of the two arguments into the
       accumulator.
  
   -- Built-in Function: int __builtin_rx_mvfachi (void)
!      Generates the `mvfachi' machine instruction to read the top 32
!      bits of the accumulator.
  
   -- Built-in Function: int __builtin_rx_mvfacmi (void)
!      Generates the `mvfacmi' machine instruction to read the middle 32
       bits of the accumulator.
  
   -- Built-in Function: int __builtin_rx_mvfc (int)
!      Generates the `mvfc' machine instruction which reads the control
       register specified in its argument and returns its value.
  
   -- Built-in Function: void __builtin_rx_mvtachi (int)
!      Generates the `mvtachi' machine instruction to set the top 32 bits
       of the accumulator.
  
   -- Built-in Function: void __builtin_rx_mvtaclo (int)
!      Generates the `mvtaclo' machine instruction to set the bottom 32
       bits of the accumulator.
  
   -- Built-in Function: void __builtin_rx_mvtc (int reg, int val)
!      Generates the `mvtc' machine instruction which sets control
!      register number `reg' to `val'.
  
   -- Built-in Function: void __builtin_rx_mvtipl (int)
!      Generates the `mvtipl' machine instruction set the interrupt
       priority level.
  
   -- Built-in Function: void __builtin_rx_racw (int)
!      Generates the `racw' machine instruction to round the accumulator
       according to the specified mode.
  
   -- Built-in Function: int __builtin_rx_revw (int)
!      Generates the `revw' machine instruction which swaps the bytes in
       the argument so that bits 0-7 now occupy bits 8-15 and vice versa,
       and also bits 16-23 occupy bits 24-31 and vice versa.
  
   -- Built-in Function: void __builtin_rx_rmpa (void)
!      Generates the `rmpa' machine instruction which initiates a
!      repeated multiply and accumulate sequence.
  
   -- Built-in Function: void __builtin_rx_round (float)
!      Generates the `round' machine instruction which returns the
       floating-point argument rounded according to the current rounding
       mode set in the floating-point status word register.
  
   -- Built-in Function: int __builtin_rx_sat (int)
!      Generates the `sat' machine instruction which returns the
!      saturated value of the argument.
  
   -- Built-in Function: void __builtin_rx_setpsw (int)
!      Generates the `setpsw' machine instruction to set the specified
!      bit in the processor status word.
  
   -- Built-in Function: void __builtin_rx_wait (void)
!      Generates the `wait' machine instruction.
  
  
  File: gcc.info,  Node: S/390 System z Built-in Functions,  Next: SH Built-in Functions,  Prev: RX Built-in Functions,  Up: Target Builtins
--- 38833,38924 ----
  following functions are supported:
  
   -- Built-in Function: void __builtin_rx_brk (void)
!      Generates the 'brk' machine instruction.
  
   -- Built-in Function: void __builtin_rx_clrpsw (int)
!      Generates the 'clrpsw' machine instruction to clear the specified
       bit in the processor status word.
  
   -- Built-in Function: void __builtin_rx_int (int)
!      Generates the 'int' machine instruction to generate an interrupt
       with the specified value.
  
   -- Built-in Function: void __builtin_rx_machi (int, int)
!      Generates the 'machi' machine instruction to add the result of
       multiplying the top 16 bits of the two arguments into the
       accumulator.
  
   -- Built-in Function: void __builtin_rx_maclo (int, int)
!      Generates the 'maclo' machine instruction to add the result of
       multiplying the bottom 16 bits of the two arguments into the
       accumulator.
  
   -- Built-in Function: void __builtin_rx_mulhi (int, int)
!      Generates the 'mulhi' machine instruction to place the result of
       multiplying the top 16 bits of the two arguments into the
       accumulator.
  
   -- Built-in Function: void __builtin_rx_mullo (int, int)
!      Generates the 'mullo' machine instruction to place the result of
       multiplying the bottom 16 bits of the two arguments into the
       accumulator.
  
   -- Built-in Function: int __builtin_rx_mvfachi (void)
!      Generates the 'mvfachi' machine instruction to read the top 32 bits
!      of the accumulator.
  
   -- Built-in Function: int __builtin_rx_mvfacmi (void)
!      Generates the 'mvfacmi' machine instruction to read the middle 32
       bits of the accumulator.
  
   -- Built-in Function: int __builtin_rx_mvfc (int)
!      Generates the 'mvfc' machine instruction which reads the control
       register specified in its argument and returns its value.
  
   -- Built-in Function: void __builtin_rx_mvtachi (int)
!      Generates the 'mvtachi' machine instruction to set the top 32 bits
       of the accumulator.
  
   -- Built-in Function: void __builtin_rx_mvtaclo (int)
!      Generates the 'mvtaclo' machine instruction to set the bottom 32
       bits of the accumulator.
  
   -- Built-in Function: void __builtin_rx_mvtc (int reg, int val)
!      Generates the 'mvtc' machine instruction which sets control
!      register number 'reg' to 'val'.
  
   -- Built-in Function: void __builtin_rx_mvtipl (int)
!      Generates the 'mvtipl' machine instruction set the interrupt
       priority level.
  
   -- Built-in Function: void __builtin_rx_racw (int)
!      Generates the 'racw' machine instruction to round the accumulator
       according to the specified mode.
  
   -- Built-in Function: int __builtin_rx_revw (int)
!      Generates the 'revw' machine instruction which swaps the bytes in
       the argument so that bits 0-7 now occupy bits 8-15 and vice versa,
       and also bits 16-23 occupy bits 24-31 and vice versa.
  
   -- Built-in Function: void __builtin_rx_rmpa (void)
!      Generates the 'rmpa' machine instruction which initiates a repeated
!      multiply and accumulate sequence.
  
   -- Built-in Function: void __builtin_rx_round (float)
!      Generates the 'round' machine instruction which returns the
       floating-point argument rounded according to the current rounding
       mode set in the floating-point status word register.
  
   -- Built-in Function: int __builtin_rx_sat (int)
!      Generates the 'sat' machine instruction which returns the saturated
!      value of the argument.
  
   -- Built-in Function: void __builtin_rx_setpsw (int)
!      Generates the 'setpsw' machine instruction to set the specified bit
!      in the processor status word.
  
   -- Built-in Function: void __builtin_rx_wait (void)
!      Generates the 'wait' machine instruction.
  
  
  File: gcc.info,  Node: S/390 System z Built-in Functions,  Next: SH Built-in Functions,  Prev: RX Built-in Functions,  Up: Target Builtins
*************** File: gcc.info,  Node: S/390 System z Bu
*** 39266,39286 ****
  -----------------------------------------
  
   -- Built-in Function: int __builtin_tbegin (void*)
!      Generates the `tbegin' machine instruction starting a
       non-constraint hardware transaction.  If the parameter is non-NULL
       the memory area is used to store the transaction diagnostic buffer
!      and will be passed as first operand to `tbegin'.  This buffer can
!      be defined using the `struct __htm_tdb' C struct defined in
!      `htmintrin.h' and must reside on a double-word boundary.  The
!      second tbegin operand is set to `0xff0c'. This enables
       save/restore of all GPRs and disables aborts for FPR and AR
       manipulations inside the transaction body.  The condition code set
       by the tbegin instruction is returned as integer value.  The tbegin
       instruction by definition overwrites the content of all FPRs.  The
       compiler will generate code which saves and restores the FPRs.  For
!      soft-float code it is recommended to used the `*_nofloat' variant.
!      In order to prevent a TDB from being written it is required to
!      pass an constant zero value as parameter.  Passing the zero value
       through a variable is not sufficient.  Although modifications of
       access registers inside the transaction will not trigger an
       transaction abort it is not supported to actually modify them.
--- 38927,38947 ----
  -----------------------------------------
  
   -- Built-in Function: int __builtin_tbegin (void*)
!      Generates the 'tbegin' machine instruction starting a
       non-constraint hardware transaction.  If the parameter is non-NULL
       the memory area is used to store the transaction diagnostic buffer
!      and will be passed as first operand to 'tbegin'.  This buffer can
!      be defined using the 'struct __htm_tdb' C struct defined in
!      'htmintrin.h' and must reside on a double-word boundary.  The
!      second tbegin operand is set to '0xff0c'.  This enables
       save/restore of all GPRs and disables aborts for FPR and AR
       manipulations inside the transaction body.  The condition code set
       by the tbegin instruction is returned as integer value.  The tbegin
       instruction by definition overwrites the content of all FPRs.  The
       compiler will generate code which saves and restores the FPRs.  For
!      soft-float code it is recommended to used the '*_nofloat' variant.
!      In order to prevent a TDB from being written it is required to pass
!      an constant zero value as parameter.  Passing the zero value
       through a variable is not sufficient.  Although modifications of
       access registers inside the transaction will not trigger an
       transaction abort it is not supported to actually modify them.
*************** File: gcc.info,  Node: S/390 System z Bu
*** 39288,39369 ****
       They will have undefined state when reaching the abort code.
  
   Macros for the possible return codes of tbegin are defined in the
! `htmintrin.h' header file:
  
! `_HTM_TBEGIN_STARTED'
!      `tbegin' has been executed as part of normal processing.  The
       transaction body is supposed to be executed.
! 
! `_HTM_TBEGIN_INDETERMINATE'
       The transaction was aborted due to an indeterminate condition which
       might be persistent.
! 
! `_HTM_TBEGIN_TRANSIENT'
       The transaction aborted due to a transient failure.  The
       transaction should be re-executed in that case.
! 
! `_HTM_TBEGIN_PERSISTENT'
       The transaction aborted due to a persistent failure.  Re-execution
       under same circumstances will not be productive.
  
   -- Macro: _HTM_FIRST_USER_ABORT_CODE
!      The `_HTM_FIRST_USER_ABORT_CODE' defined in `htmintrin.h'
!      specifies the first abort code which can be used for
!      `__builtin_tabort'.  Values below this threshold are reserved for
!      machine use.
  
   -- Data type: struct __htm_tdb
!      The `struct __htm_tdb' defined in `htmintrin.h' describes the
       structure of the transaction diagnostic block as specified in the
       Principles of Operation manual chapter 5-91.
  
   -- Built-in Function: int __builtin_tbegin_nofloat (void*)
!      Same as `__builtin_tbegin' but without FPR saves and restores.
       Using this variant in code making use of FPRs will leave the FPRs
       in undefined state when entering the transaction abort handler
       code.
  
   -- Built-in Function: int __builtin_tbegin_retry (void*, int)
!      In addition to `__builtin_tbegin' a loop for transient failures is
       generated.  If tbegin returns a condition code of 2 the transaction
       will be retried as often as specified in the second argument.  The
       perform processor assist instruction is used to tell the CPU about
       the number of fails so far.
  
   -- Built-in Function: int __builtin_tbegin_retry_nofloat (void*, int)
!      Same as `__builtin_tbegin_retry' but without FPR saves and
       restores.  Using this variant in code making use of FPRs will leave
       the FPRs in undefined state when entering the transaction abort
       handler code.
  
   -- Built-in Function: void __builtin_tbeginc (void)
!      Generates the `tbeginc' machine instruction starting a constraint
!      hardware transaction.  The second operand is set to `0xff08'.
  
   -- Built-in Function: int __builtin_tend (void)
!      Generates the `tend' machine instruction finishing a transaction
       and making the changes visible to other threads.  The condition
       code generated by tend is returned as integer value.
  
   -- Built-in Function: void __builtin_tabort (int)
!      Generates the `tabort' machine instruction with the specified
!      abort code.  Abort codes from 0 through 255 are reserved and will
!      result in an error message.
  
   -- Built-in Function: void __builtin_tx_assist (int)
!      Generates the `ppa rX,rY,1' machine instruction.  Where the
!      integer parameter is loaded into rX and a value of zero is loaded
!      into rY.  The integer parameter specifies the number of times the
!      transaction repeatedly aborted.
  
   -- Built-in Function: int __builtin_tx_nesting_depth (void)
!      Generates the `etnd' machine instruction.  The current nesting
       depth is returned as integer value.  For a nesting depth of 0 the
       code is not executed as part of an transaction.
  
   -- Built-in Function: void __builtin_non_tx_store (uint64_t *,
            uint64_t)
!      Generates the `ntstg' machine instruction.  The second argument is
       written to the first arguments location.  The store operation will
       not be rolled-back in case of an transaction abort.
  
--- 38949,39027 ----
       They will have undefined state when reaching the abort code.
  
   Macros for the possible return codes of tbegin are defined in the
! 'htmintrin.h' header file:
  
! '_HTM_TBEGIN_STARTED'
!      'tbegin' has been executed as part of normal processing.  The
       transaction body is supposed to be executed.
! '_HTM_TBEGIN_INDETERMINATE'
       The transaction was aborted due to an indeterminate condition which
       might be persistent.
! '_HTM_TBEGIN_TRANSIENT'
       The transaction aborted due to a transient failure.  The
       transaction should be re-executed in that case.
! '_HTM_TBEGIN_PERSISTENT'
       The transaction aborted due to a persistent failure.  Re-execution
       under same circumstances will not be productive.
  
   -- Macro: _HTM_FIRST_USER_ABORT_CODE
!      The '_HTM_FIRST_USER_ABORT_CODE' defined in 'htmintrin.h' specifies
!      the first abort code which can be used for '__builtin_tabort'.
!      Values below this threshold are reserved for machine use.
  
   -- Data type: struct __htm_tdb
!      The 'struct __htm_tdb' defined in 'htmintrin.h' describes the
       structure of the transaction diagnostic block as specified in the
       Principles of Operation manual chapter 5-91.
  
   -- Built-in Function: int __builtin_tbegin_nofloat (void*)
!      Same as '__builtin_tbegin' but without FPR saves and restores.
       Using this variant in code making use of FPRs will leave the FPRs
       in undefined state when entering the transaction abort handler
       code.
  
   -- Built-in Function: int __builtin_tbegin_retry (void*, int)
!      In addition to '__builtin_tbegin' a loop for transient failures is
       generated.  If tbegin returns a condition code of 2 the transaction
       will be retried as often as specified in the second argument.  The
       perform processor assist instruction is used to tell the CPU about
       the number of fails so far.
  
   -- Built-in Function: int __builtin_tbegin_retry_nofloat (void*, int)
!      Same as '__builtin_tbegin_retry' but without FPR saves and
       restores.  Using this variant in code making use of FPRs will leave
       the FPRs in undefined state when entering the transaction abort
       handler code.
  
   -- Built-in Function: void __builtin_tbeginc (void)
!      Generates the 'tbeginc' machine instruction starting a constraint
!      hardware transaction.  The second operand is set to '0xff08'.
  
   -- Built-in Function: int __builtin_tend (void)
!      Generates the 'tend' machine instruction finishing a transaction
       and making the changes visible to other threads.  The condition
       code generated by tend is returned as integer value.
  
   -- Built-in Function: void __builtin_tabort (int)
!      Generates the 'tabort' machine instruction with the specified abort
!      code.  Abort codes from 0 through 255 are reserved and will result
!      in an error message.
  
   -- Built-in Function: void __builtin_tx_assist (int)
!      Generates the 'ppa rX,rY,1' machine instruction.  Where the integer
!      parameter is loaded into rX and a value of zero is loaded into rY.
!      The integer parameter specifies the number of times the transaction
!      repeatedly aborted.
  
   -- Built-in Function: int __builtin_tx_nesting_depth (void)
!      Generates the 'etnd' machine instruction.  The current nesting
       depth is returned as integer value.  For a nesting depth of 0 the
       code is not executed as part of an transaction.
  
   -- Built-in Function: void __builtin_non_tx_store (uint64_t *,
            uint64_t)
! 
!      Generates the 'ntstg' machine instruction.  The second argument is
       written to the first arguments location.  The store operation will
       not be rolled-back in case of an transaction abort.
  
*************** The following built-in functions are sup
*** 39377,39395 ****
  SH4 families of processors:
  
   -- Built-in Function: void __builtin_set_thread_pointer (void *PTR)
!      Sets the `GBR' register to the specified value PTR.  This is
       usually used by system code that manages threads and execution
       contexts.  The compiler normally does not generate code that
!      modifies the contents of `GBR' and thus the value is preserved
!      across function calls.  Changing the `GBR' value in user code must
!      be done with caution, since the compiler might use `GBR' in order
       to access thread local variables.
  
- 
   -- Built-in Function: void * __builtin_thread_pointer (void)
!      Returns the value that is currently set in the `GBR' register.
       Memory loads and stores that use the thread pointer as a base
!      address are turned into `GBR' based displacement loads and stores,
       if possible.  For example:
            struct my_tcb
            {
--- 39035,39052 ----
  SH4 families of processors:
  
   -- Built-in Function: void __builtin_set_thread_pointer (void *PTR)
!      Sets the 'GBR' register to the specified value PTR.  This is
       usually used by system code that manages threads and execution
       contexts.  The compiler normally does not generate code that
!      modifies the contents of 'GBR' and thus the value is preserved
!      across function calls.  Changing the 'GBR' value in user code must
!      be done with caution, since the compiler might use 'GBR' in order
       to access thread local variables.
  
   -- Built-in Function: void * __builtin_thread_pointer (void)
!      Returns the value that is currently set in the 'GBR' register.
       Memory loads and stores that use the thread pointer as a base
!      address are turned into 'GBR' based displacement loads and stores,
       if possible.  For example:
            struct my_tcb
            {
*************** SH4 families of processors:
*** 39398,39412 ****
  
            int get_tcb_value (void)
            {
!             // Generate `mov.l @(8,gbr),r0' instruction
              return ((my_tcb*)__builtin_thread_pointer ())->c;
            }
  
   -- Built-in Function: unsigned int __builtin_sh_get_fpscr (void)
!      Returns the value that is currently set in the `FPSCR' register.
  
   -- Built-in Function: void __builtin_sh_set_fpscr (unsigned int VAL)
!      Sets the `FPSCR' register to the specified value VAL, while
       preserving the current values of the FR, SZ and PR bits.
  
  
--- 39055,39070 ----
  
            int get_tcb_value (void)
            {
!             // Generate 'mov.l @(8,gbr),r0' instruction
              return ((my_tcb*)__builtin_thread_pointer ())->c;
            }
  
+ 
   -- Built-in Function: unsigned int __builtin_sh_get_fpscr (void)
!      Returns the value that is currently set in the 'FPSCR' register.
  
   -- Built-in Function: void __builtin_sh_set_fpscr (unsigned int VAL)
!      Sets the 'FPSCR' register to the specified value VAL, while
       preserving the current values of the FR, SZ and PR bits.
  
  
*************** File: gcc.info,  Node: SPARC VIS Built-i
*** 39417,39425 ****
  
  GCC supports SIMD operations on the SPARC using both the generic vector
  extensions (*note Vector Extensions::) as well as built-in functions for
! the SPARC Visual Instruction Set (VIS).  When you use the `-mvis'
! switch, the VIS extension is exposed as the following built-in
! functions:
  
       typedef int v1si __attribute__ ((vector_size (4)));
       typedef int v2si __attribute__ ((vector_size (8)));
--- 39075,39082 ----
  
  GCC supports SIMD operations on the SPARC using both the generic vector
  extensions (*note Vector Extensions::) as well as built-in functions for
! the SPARC Visual Instruction Set (VIS). When you use the '-mvis' switch,
! the VIS extension is exposed as the following built-in functions:
  
       typedef int v1si __attribute__ ((vector_size (4)));
       typedef int v2si __attribute__ ((vector_size (8)));
*************** functions:
*** 39484,39490 ****
       long __builtin_vis_array16 (long, long);
       long __builtin_vis_array32 (long, long);
  
!  When you use the `-mvis2' switch, the VIS version 2.0 built-in
  functions also become available:
  
       long __builtin_vis_bmask (long, long);
--- 39141,39147 ----
       long __builtin_vis_array16 (long, long);
       long __builtin_vis_array32 (long, long);
  
!  When you use the '-mvis2' switch, the VIS version 2.0 built-in
  functions also become available:
  
       long __builtin_vis_bmask (long, long);
*************** functions also become available:
*** 39500,39506 ****
       long __builtin_vis_edge32n (void *, void *);
       long __builtin_vis_edge32ln (void *, void *);
  
!  When you use the `-mvis3' switch, the VIS version 3.0 built-in
  functions also become available:
  
       void __builtin_vis_cmask8 (long);
--- 39157,39163 ----
       long __builtin_vis_edge32n (void *, void *);
       long __builtin_vis_edge32ln (void *, void *);
  
!  When you use the '-mvis3' switch, the VIS version 3.0 built-in
  functions also become available:
  
       void __builtin_vis_cmask8 (long);
*************** File: gcc.info,  Node: SPU Built-in Func
*** 39558,39565 ****
  
  GCC provides extensions for the SPU processor as described in the
  Sony/Toshiba/IBM SPU Language Extensions Specification, which can be
! found at `http://cell.scei.co.jp/' or
! `http://www.ibm.com/developerworks/power/cell/'.  GCC's implementation
  differs in several ways.
  
     * The optional extension of specifying vector constants in
--- 39215,39222 ----
  
  GCC provides extensions for the SPU processor as described in the
  Sony/Toshiba/IBM SPU Language Extensions Specification, which can be
! found at <http://cell.scei.co.jp/> or
! <http://www.ibm.com/developerworks/power/cell/>.  GCC's implementation
  differs in several ways.
  
     * The optional extension of specifying vector constants in
*************** differs in several ways.
*** 39568,39582 ****
     * A vector initializer requires no cast if the vector constant is of
       the same type as the variable it is initializing.
  
!    * If `signed' or `unsigned' is omitted, the signedness of the vector
       type is the default signedness of the base type.  The default
       varies depending on the operating system, so a portable program
       should always specify the signedness.
  
!    * By default, the keyword `__vector' is added. The macro `vector' is
!      defined in `<spu_intrinsics.h>' and can be undefined.
  
!    * GCC allows using a `typedef' name as the type specifier for a
       vector type.
  
     * For C, overloaded functions are implemented with macros so the
--- 39225,39239 ----
     * A vector initializer requires no cast if the vector constant is of
       the same type as the variable it is initializing.
  
!    * If 'signed' or 'unsigned' is omitted, the signedness of the vector
       type is the default signedness of the base type.  The default
       varies depending on the operating system, so a portable program
       should always specify the signedness.
  
!    * By default, the keyword '__vector' is added.  The macro 'vector' is
!      defined in '<spu_intrinsics.h>' and can be undefined.
  
!    * GCC allows using a 'typedef' name as the type specifier for a
       vector type.
  
     * For C, overloaded functions are implemented with macros so the
*************** differs in several ways.
*** 39584,39598 ****
  
              spu_add ((vector signed int){1, 2, 3, 4}, foo);
  
!      Since `spu_add' is a macro, the vector constant in the example is
       treated as four separate arguments.  Wrap the entire argument in
       parentheses for this to work.
  
!    * The extended version of `__builtin_expect' is not supported.
! 
  
   _Note:_ Only the interface described in the aforementioned
! specification is supported. Internally, GCC uses built-in functions to
  implement the required functionality, but these are not supported and
  are subject to change without notice.
  
--- 39241,39254 ----
  
              spu_add ((vector signed int){1, 2, 3, 4}, foo);
  
!      Since 'spu_add' is a macro, the vector constant in the example is
       treated as four separate arguments.  Wrap the entire argument in
       parentheses for this to work.
  
!    * The extended version of '__builtin_expect' is not supported.
  
   _Note:_ Only the interface described in the aforementioned
! specification is supported.  Internally, GCC uses built-in functions to
  implement the required functionality, but these are not supported and
  are subject to change without notice.
  
*************** File: gcc.info,  Node: TI C6X Built-in F
*** 39604,39610 ****
  
  GCC provides intrinsics to access certain instructions of the TI C6X
  processors.  These intrinsics, listed below, are available after
! inclusion of the `c6x_intrinsics.h' header file.  They map directly to
  C6X instructions.
  
  
--- 39260,39266 ----
  
  GCC provides intrinsics to access certain instructions of the TI C6X
  processors.  These intrinsics, listed below, are available after
! inclusion of the 'c6x_intrinsics.h' header file.  They map directly to
  C6X instructions.
  
  
*************** C6X instructions.
*** 39635,39640 ****
--- 39291,39297 ----
       int _abs (int)
       int _abs2 (int)
  
+ 
  
  File: gcc.info,  Node: TILE-Gx Built-in Functions,  Next: TILEPro Built-in Functions,  Prev: TI C6X Built-in Functions,  Up: Target Builtins
  
*************** processor.  The intrinsics are of the fo
*** 39647,39652 ****
--- 39304,39310 ----
  
       unsigned long long __insn_OP (...)
  
+ 
   Where OP is the name of the instruction.  Refer to the ISA manual for
  the complete list of instructions.
  
*************** The intrinsics are:
*** 39663,39671 ****
       void __tile_idn_send (unsigned long long)
       void __tile_udn_send (unsigned long long)
  
!  The intrinsic `void __tile_network_barrier (void)' is used to
! guarantee that no network operations before it are reordered with those
! after it.
  
  
  File: gcc.info,  Node: TILEPro Built-in Functions,  Next: x86 Built-in Functions,  Prev: TILE-Gx Built-in Functions,  Up: Target Builtins
--- 39321,39329 ----
       void __tile_idn_send (unsigned long long)
       void __tile_udn_send (unsigned long long)
  
! 
!  The intrinsic 'void __tile_network_barrier (void)' is used to guarantee
! that no network operations before it are reordered with those after it.
  
  
  File: gcc.info,  Node: TILEPro Built-in Functions,  Next: x86 Built-in Functions,  Prev: TILE-Gx Built-in Functions,  Up: Target Builtins
*************** processor.  The intrinsics are of the fo
*** 39679,39684 ****
--- 39337,39343 ----
  
       unsigned __insn_OP (...)
  
+ 
  where OP is the name of the instruction.  Refer to the ISA manual for
  the complete list of instructions.
  
*************** The intrinsics are:
*** 39697,39705 ****
       void __tile_sn_send (unsigned)
       void __tile_udn_send (unsigned)
  
!  The intrinsic `void __tile_network_barrier (void)' is used to
! guarantee that no network operations before it are reordered with those
! after it.
  
  
  File: gcc.info,  Node: x86 Built-in Functions,  Next: x86 transactional memory intrinsics,  Prev: TILEPro Built-in Functions,  Up: Target Builtins
--- 39356,39364 ----
       void __tile_sn_send (unsigned)
       void __tile_udn_send (unsigned)
  
! 
!  The intrinsic 'void __tile_network_barrier (void)' is used to guarantee
! that no network operations before it are reordered with those after it.
  
  
  File: gcc.info,  Node: x86 Built-in Functions,  Next: x86 transactional memory intrinsics,  Prev: TILEPro Built-in Functions,  Up: Target Builtins
*************** File: gcc.info,  Node: x86 Built-in Func
*** 39710,39742 ****
  These built-in functions are available for the x86-32 and x86-64 family
  of computers, depending on the command-line switches used.
  
!  If you specify command-line switches such as `-msse', the compiler
  could use the extended instruction sets even if the built-ins are not
  used explicitly in the program.  For this reason, applications that
  perform run-time CPU detection must compile separate files for each
! supported architecture, using the appropriate flags.  In particular,
! the file containing the CPU detection code should be compiled without
! these options.
  
   The following machine modes are available for use with MMX built-in
! functions (*note Vector Extensions::): `V2SI' for a vector of two
! 32-bit integers, `V4HI' for a vector of four 16-bit integers, and
! `V8QI' for a vector of eight 8-bit integers.  Some of the built-in
! functions operate on MMX registers as a whole 64-bit entity, these use
! `V1DI' as their mode.
  
!  If 3DNow! extensions are enabled, `V2SF' is used as a mode for a vector
  of two 32-bit floating-point values.
  
!  If SSE extensions are enabled, `V4SF' is used for a vector of four
  32-bit floating-point values.  Some instructions use a vector of four
! 32-bit integers, these use `V4SI'.  Finally, some instructions operate
  on an entire vector register, interpreting it as a 128-bit integer,
! these use mode `TI'.
  
   In 64-bit mode, the x86-64 family of processors uses additional
! built-in functions for efficient use of `TF' (`__float128') 128-bit
! floating point and `TC' 128-bit complex floating-point values.
  
   The following floating-point built-in functions are available in 64-bit
  mode.  All of them implement the function that is part of the name.
--- 39369,39401 ----
  These built-in functions are available for the x86-32 and x86-64 family
  of computers, depending on the command-line switches used.
  
!  If you specify command-line switches such as '-msse', the compiler
  could use the extended instruction sets even if the built-ins are not
  used explicitly in the program.  For this reason, applications that
  perform run-time CPU detection must compile separate files for each
! supported architecture, using the appropriate flags.  In particular, the
! file containing the CPU detection code should be compiled without these
! options.
  
   The following machine modes are available for use with MMX built-in
! functions (*note Vector Extensions::): 'V2SI' for a vector of two 32-bit
! integers, 'V4HI' for a vector of four 16-bit integers, and 'V8QI' for a
! vector of eight 8-bit integers.  Some of the built-in functions operate
! on MMX registers as a whole 64-bit entity, these use 'V1DI' as their
! mode.
  
!  If 3DNow! extensions are enabled, 'V2SF' is used as a mode for a vector
  of two 32-bit floating-point values.
  
!  If SSE extensions are enabled, 'V4SF' is used for a vector of four
  32-bit floating-point values.  Some instructions use a vector of four
! 32-bit integers, these use 'V4SI'.  Finally, some instructions operate
  on an entire vector register, interpreting it as a 128-bit integer,
! these use mode 'TI'.
  
   In 64-bit mode, the x86-64 family of processors uses additional
! built-in functions for efficient use of 'TF' ('__float128') 128-bit
! floating point and 'TC' 128-bit complex floating-point values.
  
   The following floating-point built-in functions are available in 64-bit
  mode.  All of them implement the function that is part of the name.
*************** mode.  All of them implement the functio
*** 39746,39764 ****
  
   The following built-in function is always available.
  
! `void __builtin_ia32_pause (void)'
!      Generates the `pause' machine instruction with a compiler memory
       barrier.
  
   The following floating-point built-in functions are made available in
  the 64-bit mode.
  
! `__float128 __builtin_infq (void)'
!      Similar to `__builtin_inf', except the return type is `__float128'.  
  
! `__float128 __builtin_huge_valq (void)'
!      Similar to `__builtin_huge_val', except the return type is
!      `__float128'.  
  
   The following built-in functions are always available and can be used
  to check the target platform type.
--- 39405,39423 ----
  
   The following built-in function is always available.
  
! 'void __builtin_ia32_pause (void)'
!      Generates the 'pause' machine instruction with a compiler memory
       barrier.
  
   The following floating-point built-in functions are made available in
  the 64-bit mode.
  
! '__float128 __builtin_infq (void)'
!      Similar to '__builtin_inf', except the return type is '__float128'.
  
! '__float128 __builtin_huge_valq (void)'
!      Similar to '__builtin_huge_val', except the return type is
!      '__float128'.
  
   The following built-in functions are always available and can be used
  to check the target platform type.
*************** to check the target platform type.
*** 39767,39780 ****
       This function runs the CPU detection code to check the type of CPU
       and the features supported.  This built-in function needs to be
       invoked along with the built-in functions to check CPU type and
!      features, `__builtin_cpu_is' and `__builtin_cpu_supports', only
       when used in a function that is executed before any constructors
       are called.  The CPU detection code is automatically executed in a
       very high priority constructor.
  
!      For example, this function has to be used in `ifunc' resolvers that
!      check for CPU type using the built-in functions `__builtin_cpu_is'
!      and `__builtin_cpu_supports', or in constructors on targets that
       don't support constructor priority.
  
            static void (*resolve_memcpy (void)) (void)
--- 39426,39439 ----
       This function runs the CPU detection code to check the type of CPU
       and the features supported.  This built-in function needs to be
       invoked along with the built-in functions to check CPU type and
!      features, '__builtin_cpu_is' and '__builtin_cpu_supports', only
       when used in a function that is executed before any constructors
       are called.  The CPU detection code is automatically executed in a
       very high priority constructor.
  
!      For example, this function has to be used in 'ifunc' resolvers that
!      check for CPU type using the built-in functions '__builtin_cpu_is'
!      and '__builtin_cpu_supports', or in constructors on targets that
       don't support constructor priority.
  
            static void (*resolve_memcpy (void)) (void)
*************** to check the target platform type.
*** 39791,39857 ****
            void *memcpy (void *, const void *, size_t)
                 __attribute__ ((ifunc ("resolve_memcpy")));
  
- 
   -- Built-in Function: int __builtin_cpu_is (const char *CPUNAME)
       This function returns a positive integer if the run-time CPU is of
!      type CPUNAME and returns `0' otherwise. The following CPU names
       can be detected:
  
!     `intel'
            Intel CPU.
  
!     `atom'
            Intel Atom CPU.
  
!     `core2'
            Intel Core 2 CPU.
  
!     `corei7'
            Intel Core i7 CPU.
  
!     `nehalem'
            Intel Core i7 Nehalem CPU.
  
!     `westmere'
            Intel Core i7 Westmere CPU.
  
!     `sandybridge'
            Intel Core i7 Sandy Bridge CPU.
  
!     `amd'
            AMD CPU.
  
!     `amdfam10h'
            AMD Family 10h CPU.
  
!     `barcelona'
            AMD Family 10h Barcelona CPU.
  
!     `shanghai'
            AMD Family 10h Shanghai CPU.
  
!     `istanbul'
            AMD Family 10h Istanbul CPU.
  
!     `btver1'
            AMD Family 14h CPU.
  
!     `amdfam15h'
            AMD Family 15h CPU.
  
!     `bdver1'
            AMD Family 15h Bulldozer version 1.
  
!     `bdver2'
            AMD Family 15h Bulldozer version 2.
  
!     `bdver3'
            AMD Family 15h Bulldozer version 3.
  
!     `bdver4'
            AMD Family 15h Bulldozer version 4.
  
!     `btver2'
            AMD Family 16h CPU.
  
       Here is an example:
--- 39450,39515 ----
            void *memcpy (void *, const void *, size_t)
                 __attribute__ ((ifunc ("resolve_memcpy")));
  
   -- Built-in Function: int __builtin_cpu_is (const char *CPUNAME)
       This function returns a positive integer if the run-time CPU is of
!      type CPUNAME and returns '0' otherwise.  The following CPU names
       can be detected:
  
!      'intel'
            Intel CPU.
  
!      'atom'
            Intel Atom CPU.
  
!      'core2'
            Intel Core 2 CPU.
  
!      'corei7'
            Intel Core i7 CPU.
  
!      'nehalem'
            Intel Core i7 Nehalem CPU.
  
!      'westmere'
            Intel Core i7 Westmere CPU.
  
!      'sandybridge'
            Intel Core i7 Sandy Bridge CPU.
  
!      'amd'
            AMD CPU.
  
!      'amdfam10h'
            AMD Family 10h CPU.
  
!      'barcelona'
            AMD Family 10h Barcelona CPU.
  
!      'shanghai'
            AMD Family 10h Shanghai CPU.
  
!      'istanbul'
            AMD Family 10h Istanbul CPU.
  
!      'btver1'
            AMD Family 14h CPU.
  
!      'amdfam15h'
            AMD Family 15h CPU.
  
!      'bdver1'
            AMD Family 15h Bulldozer version 1.
  
!      'bdver2'
            AMD Family 15h Bulldozer version 2.
  
!      'bdver3'
            AMD Family 15h Bulldozer version 3.
  
!      'bdver4'
            AMD Family 15h Bulldozer version 4.
  
!      'btver2'
            AMD Family 16h CPU.
  
       Here is an example:
*************** to check the target platform type.
*** 39866,39908 ****
  
   -- Built-in Function: int __builtin_cpu_supports (const char *FEATURE)
       This function returns a positive integer if the run-time CPU
!      supports FEATURE and returns `0' otherwise. The following features
       can be detected:
  
!     `cmov'
            CMOV instruction.
! 
!     `mmx'
            MMX instructions.
! 
!     `popcnt'
            POPCNT instruction.
! 
!     `sse'
            SSE instructions.
! 
!     `sse2'
            SSE2 instructions.
! 
!     `sse3'
            SSE3 instructions.
! 
!     `ssse3'
            SSSE3 instructions.
! 
!     `sse4.1'
            SSE4.1 instructions.
! 
!     `sse4.2'
            SSE4.2 instructions.
! 
!     `avx'
            AVX instructions.
! 
!     `avx2'
            AVX2 instructions.
! 
!     `avx512f'
            AVX512F instructions.
  
       Here is an example:
--- 39524,39555 ----
  
   -- Built-in Function: int __builtin_cpu_supports (const char *FEATURE)
       This function returns a positive integer if the run-time CPU
!      supports FEATURE and returns '0' otherwise.  The following features
       can be detected:
  
!      'cmov'
            CMOV instruction.
!      'mmx'
            MMX instructions.
!      'popcnt'
            POPCNT instruction.
!      'sse'
            SSE instructions.
!      'sse2'
            SSE2 instructions.
!      'sse3'
            SSE3 instructions.
!      'ssse3'
            SSSE3 instructions.
!      'sse4.1'
            SSE4.1 instructions.
!      'sse4.2'
            SSE4.2 instructions.
!      'avx'
            AVX instructions.
!      'avx2'
            AVX2 instructions.
!      'avx512f'
            AVX512F instructions.
  
       Here is an example:
*************** to check the target platform type.
*** 39915,39922 ****
                 count = generic_countbits (n); //generic implementation.
              }
  
!  The following built-in functions are made available by `-mmmx'.  All
! of them generate the machine instruction that is part of the name.
  
       v8qi __builtin_ia32_paddb (v8qi, v8qi)
       v4hi __builtin_ia32_paddw (v4hi, v4hi)
--- 39562,39569 ----
                 count = generic_countbits (n); //generic implementation.
              }
  
!  The following built-in functions are made available by '-mmmx'.  All of
! them generate the machine instruction that is part of the name.
  
       v8qi __builtin_ia32_paddb (v8qi, v8qi)
       v4hi __builtin_ia32_paddw (v4hi, v4hi)
*************** of them generate the machine instruction
*** 39971,39979 ****
       v4hi __builtin_ia32_psrawi (v4hi, int)
       v2si __builtin_ia32_psradi (v2si, int)
  
   The following built-in functions are made available either with
! `-msse', or with a combination of `-m3dnow' and `-march=athlon'.  All
! of them generate the machine instruction that is part of the name.
  
       v4hi __builtin_ia32_pmulhuw (v4hi, v4hi)
       v8qi __builtin_ia32_pavgb (v8qi, v8qi)
--- 39618,39627 ----
       v4hi __builtin_ia32_psrawi (v4hi, int)
       v2si __builtin_ia32_psradi (v2si, int)
  
+ 
   The following built-in functions are made available either with
! '-msse', or with a combination of '-m3dnow' and '-march=athlon'.  All of
! them generate the machine instruction that is part of the name.
  
       v4hi __builtin_ia32_pmulhuw (v4hi, v4hi)
       v8qi __builtin_ia32_pavgb (v8qi, v8qi)
*************** of them generate the machine instruction
*** 39988,39994 ****
       void __builtin_ia32_movntq (di *, di)
       void __builtin_ia32_sfence (void)
  
!  The following built-in functions are available when `-msse' is used.
  All of them generate the machine instruction that is part of the name.
  
       int __builtin_ia32_comieq (v4sf, v4sf)
--- 39636,39642 ----
       void __builtin_ia32_movntq (di *, di)
       void __builtin_ia32_sfence (void)
  
!  The following built-in functions are available when '-msse' is used.
  All of them generate the machine instruction that is part of the name.
  
       int __builtin_ia32_comieq (v4sf, v4sf)
*************** All of them generate the machine instruc
*** 40060,40089 ****
       void __builtin_ia32_movntps (float *, v4sf)
       int __builtin_ia32_movmskps (v4sf)
  
!  The following built-in functions are available when `-msse' is used.
! 
! `v4sf __builtin_ia32_loadups (float *)'
!      Generates the `movups' machine instruction as a load from memory.
! 
! `void __builtin_ia32_storeups (float *, v4sf)'
!      Generates the `movups' machine instruction as a store to memory.
! 
! `v4sf __builtin_ia32_loadss (float *)'
!      Generates the `movss' machine instruction as a load from memory.
! 
! `v4sf __builtin_ia32_loadhps (v4sf, const v2sf *)'
!      Generates the `movhps' machine instruction as a load from memory.
! 
! `v4sf __builtin_ia32_loadlps (v4sf, const v2sf *)'
!      Generates the `movlps' machine instruction as a load from memory
! 
! `void __builtin_ia32_storehps (v2sf *, v4sf)'
!      Generates the `movhps' machine instruction as a store to memory.
  
! `void __builtin_ia32_storelps (v2sf *, v4sf)'
!      Generates the `movlps' machine instruction as a store to memory.
  
!  The following built-in functions are available when `-msse2' is used.
  All of them generate the machine instruction that is part of the name.
  
       int __builtin_ia32_comisdeq (v2df, v2df)
--- 39708,39731 ----
       void __builtin_ia32_movntps (float *, v4sf)
       int __builtin_ia32_movmskps (v4sf)
  
!  The following built-in functions are available when '-msse' is used.
  
! 'v4sf __builtin_ia32_loadups (float *)'
!      Generates the 'movups' machine instruction as a load from memory.
! 'void __builtin_ia32_storeups (float *, v4sf)'
!      Generates the 'movups' machine instruction as a store to memory.
! 'v4sf __builtin_ia32_loadss (float *)'
!      Generates the 'movss' machine instruction as a load from memory.
! 'v4sf __builtin_ia32_loadhps (v4sf, const v2sf *)'
!      Generates the 'movhps' machine instruction as a load from memory.
! 'v4sf __builtin_ia32_loadlps (v4sf, const v2sf *)'
!      Generates the 'movlps' machine instruction as a load from memory
! 'void __builtin_ia32_storehps (v2sf *, v4sf)'
!      Generates the 'movhps' machine instruction as a store to memory.
! 'void __builtin_ia32_storelps (v2sf *, v4sf)'
!      Generates the 'movlps' machine instruction as a store to memory.
  
!  The following built-in functions are available when '-msse2' is used.
  All of them generate the machine instruction that is part of the name.
  
       int __builtin_ia32_comisdeq (v2df, v2df)
*************** All of them generate the machine instruc
*** 40242,40248 ****
       v4si __builtin_ia32_pmaddwd128 (v8hi, v8hi)
       v2di __builtin_ia32_movq128 (v2di)
  
!  The following built-in functions are available when `-msse3' is used.
  All of them generate the machine instruction that is part of the name.
  
       v2df __builtin_ia32_addsubpd (v2df, v2df)
--- 39884,39890 ----
       v4si __builtin_ia32_pmaddwd128 (v8hi, v8hi)
       v2di __builtin_ia32_movq128 (v2di)
  
!  The following built-in functions are available when '-msse3' is used.
  All of them generate the machine instruction that is part of the name.
  
       v2df __builtin_ia32_addsubpd (v2df, v2df)
*************** All of them generate the machine instruc
*** 40257,40263 ****
       v4sf __builtin_ia32_movsldup (v4sf)
       void __builtin_ia32_mwait (unsigned int, unsigned int)
  
!  The following built-in functions are available when `-mssse3' is used.
  All of them generate the machine instruction that is part of the name.
  
       v2si __builtin_ia32_phaddd (v2si, v2si)
--- 39899,39905 ----
       v4sf __builtin_ia32_movsldup (v4sf)
       void __builtin_ia32_mwait (unsigned int, unsigned int)
  
!  The following built-in functions are available when '-mssse3' is used.
  All of them generate the machine instruction that is part of the name.
  
       v2si __builtin_ia32_phaddd (v2si, v2si)
*************** All of them generate the machine instruc
*** 40277,40283 ****
       v2si __builtin_ia32_pabsd (v2si)
       v4hi __builtin_ia32_pabsw (v4hi)
  
!  The following built-in functions are available when `-mssse3' is used.
  All of them generate the machine instruction that is part of the name.
  
       v4si __builtin_ia32_phaddd128 (v4si, v4si)
--- 39919,39925 ----
       v2si __builtin_ia32_pabsd (v2si)
       v4hi __builtin_ia32_pabsw (v4hi)
  
!  The following built-in functions are available when '-mssse3' is used.
  All of them generate the machine instruction that is part of the name.
  
       v4si __builtin_ia32_phaddd128 (v4si, v4si)
*************** All of them generate the machine instruc
*** 40297,40305 ****
       v4si __builtin_ia32_pabsd128 (v4si)
       v8hi __builtin_ia32_pabsw128 (v8hi)
  
!  The following built-in functions are available when `-msse4.1' is
! used.  All of them generate the machine instruction that is part of the
! name.
  
       v2df __builtin_ia32_blendpd (v2df, v2df, const int)
       v4sf __builtin_ia32_blendps (v4sf, v4sf, const int)
--- 39939,39946 ----
       v4si __builtin_ia32_pabsd128 (v4si)
       v8hi __builtin_ia32_pabsw128 (v8hi)
  
!  The following built-in functions are available when '-msse4.1' is used.
! All of them generate the machine instruction that is part of the name.
  
       v2df __builtin_ia32_blendpd (v2df, v2df, const int)
       v4sf __builtin_ia32_blendps (v4sf, v4sf, const int)
*************** name.
*** 40345,40382 ****
       v2df __builtin_ia32_roundsd (v2df, v2df, const int)
       v4sf __builtin_ia32_roundss (v4sf, v4sf, const int)
  
!  The following built-in functions are available when `-msse4.1' is used.
! 
! `v4sf __builtin_ia32_vec_set_v4sf (v4sf, float, const int)'
!      Generates the `insertps' machine instruction.
! 
! `int __builtin_ia32_vec_ext_v16qi (v16qi, const int)'
!      Generates the `pextrb' machine instruction.
! 
! `v16qi __builtin_ia32_vec_set_v16qi (v16qi, int, const int)'
!      Generates the `pinsrb' machine instruction.
! 
! `v4si __builtin_ia32_vec_set_v4si (v4si, int, const int)'
!      Generates the `pinsrd' machine instruction.
  
! `v2di __builtin_ia32_vec_set_v2di (v2di, long long, const int)'
!      Generates the `pinsrq' machine instruction in 64bit mode.
  
   The following built-in functions are changed to generate new SSE4.1
! instructions when `-msse4.1' is used.
! 
! `float __builtin_ia32_vec_ext_v4sf (v4sf, const int)'
!      Generates the `extractps' machine instruction.
! 
! `int __builtin_ia32_vec_ext_v4si (v4si, const int)'
!      Generates the `pextrd' machine instruction.
  
! `long long __builtin_ia32_vec_ext_v2di (v2di, const int)'
!      Generates the `pextrq' machine instruction in 64bit mode.
  
!  The following built-in functions are available when `-msse4.2' is
! used.  All of them generate the machine instruction that is part of the
! name.
  
       v16qi __builtin_ia32_pcmpestrm128 (v16qi, int, v16qi, int, const int)
       int __builtin_ia32_pcmpestri128 (v16qi, int, v16qi, int, const int)
--- 39986,40016 ----
       v2df __builtin_ia32_roundsd (v2df, v2df, const int)
       v4sf __builtin_ia32_roundss (v4sf, v4sf, const int)
  
!  The following built-in functions are available when '-msse4.1' is used.
  
! 'v4sf __builtin_ia32_vec_set_v4sf (v4sf, float, const int)'
!      Generates the 'insertps' machine instruction.
! 'int __builtin_ia32_vec_ext_v16qi (v16qi, const int)'
!      Generates the 'pextrb' machine instruction.
! 'v16qi __builtin_ia32_vec_set_v16qi (v16qi, int, const int)'
!      Generates the 'pinsrb' machine instruction.
! 'v4si __builtin_ia32_vec_set_v4si (v4si, int, const int)'
!      Generates the 'pinsrd' machine instruction.
! 'v2di __builtin_ia32_vec_set_v2di (v2di, long long, const int)'
!      Generates the 'pinsrq' machine instruction in 64bit mode.
  
   The following built-in functions are changed to generate new SSE4.1
! instructions when '-msse4.1' is used.
  
! 'float __builtin_ia32_vec_ext_v4sf (v4sf, const int)'
!      Generates the 'extractps' machine instruction.
! 'int __builtin_ia32_vec_ext_v4si (v4si, const int)'
!      Generates the 'pextrd' machine instruction.
! 'long long __builtin_ia32_vec_ext_v2di (v2di, const int)'
!      Generates the 'pextrq' machine instruction in 64bit mode.
  
!  The following built-in functions are available when '-msse4.2' is used.
! All of them generate the machine instruction that is part of the name.
  
       v16qi __builtin_ia32_pcmpestrm128 (v16qi, int, v16qi, int, const int)
       int __builtin_ia32_pcmpestri128 (v16qi, int, v16qi, int, const int)
*************** name.
*** 40394,40427 ****
       int __builtin_ia32_pcmpistriz128 (v16qi, v16qi, const int)
       v2di __builtin_ia32_pcmpgtq (v2di, v2di)
  
!  The following built-in functions are available when `-msse4.2' is used.
! 
! `unsigned int __builtin_ia32_crc32qi (unsigned int, unsigned char)'
!      Generates the `crc32b' machine instruction.
! 
! `unsigned int __builtin_ia32_crc32hi (unsigned int, unsigned short)'
!      Generates the `crc32w' machine instruction.
! 
! `unsigned int __builtin_ia32_crc32si (unsigned int, unsigned int)'
!      Generates the `crc32l' machine instruction.
  
! `unsigned long long __builtin_ia32_crc32di (unsigned long long, unsigned long long)'
!      Generates the `crc32q' machine instruction.
  
   The following built-in functions are changed to generate new SSE4.2
! instructions when `-msse4.2' is used.
! 
! `int __builtin_popcount (unsigned int)'
!      Generates the `popcntl' machine instruction.
! 
! `int __builtin_popcountl (unsigned long)'
!      Generates the `popcntl' or `popcntq' machine instruction,
!      depending on the size of `unsigned long'.
  
! `int __builtin_popcountll (unsigned long long)'
!      Generates the `popcntq' machine instruction.
  
!  The following built-in functions are available when `-mavx' is used.
  All of them generate the machine instruction that is part of the name.
  
       v4df __builtin_ia32_addpd256 (v4df,v4df)
--- 40028,40056 ----
       int __builtin_ia32_pcmpistriz128 (v16qi, v16qi, const int)
       v2di __builtin_ia32_pcmpgtq (v2di, v2di)
  
!  The following built-in functions are available when '-msse4.2' is used.
  
! 'unsigned int __builtin_ia32_crc32qi (unsigned int, unsigned char)'
!      Generates the 'crc32b' machine instruction.
! 'unsigned int __builtin_ia32_crc32hi (unsigned int, unsigned short)'
!      Generates the 'crc32w' machine instruction.
! 'unsigned int __builtin_ia32_crc32si (unsigned int, unsigned int)'
!      Generates the 'crc32l' machine instruction.
! 'unsigned long long __builtin_ia32_crc32di (unsigned long long, unsigned long long)'
!      Generates the 'crc32q' machine instruction.
  
   The following built-in functions are changed to generate new SSE4.2
! instructions when '-msse4.2' is used.
  
! 'int __builtin_popcount (unsigned int)'
!      Generates the 'popcntl' machine instruction.
! 'int __builtin_popcountl (unsigned long)'
!      Generates the 'popcntl' or 'popcntq' machine instruction, depending
!      on the size of 'unsigned long'.
! 'int __builtin_popcountll (unsigned long long)'
!      Generates the 'popcntq' machine instruction.
  
!  The following built-in functions are available when '-mavx' is used.
  All of them generate the machine instruction that is part of the name.
  
       v4df __builtin_ia32_addpd256 (v4df,v4df)
*************** All of them generate the machine instruc
*** 40553,40559 ****
       v4df __builtin_ia32_xorpd256 (v4df,v4df)
       v8sf __builtin_ia32_xorps256 (v8sf,v8sf)
  
!  The following built-in functions are available when `-mavx2' is used.
  All of them generate the machine instruction that is part of the name.
  
       v32qi __builtin_ia32_mpsadbw256 (v32qi,v32qi,int)
--- 40182,40188 ----
       v4df __builtin_ia32_xorpd256 (v4df,v4df)
       v8sf __builtin_ia32_xorps256 (v8sf,v8sf)
  
!  The following built-in functions are available when '-mavx2' is used.
  All of them generate the machine instruction that is part of the name.
  
       v32qi __builtin_ia32_mpsadbw256 (v32qi,v32qi,int)
*************** All of them generate the machine instruc
*** 40728,40734 ****
       v4si __builtin_ia32_gatherdiv4si (v4si, pcint,v2di,v4si,int)
       v4si __builtin_ia32_gatherdiv4si256 (v4si, pcint,v4di,v4si,int)
  
!  The following built-in functions are available when `-maes' is used.
  All of them generate the machine instruction that is part of the name.
  
       v2di __builtin_ia32_aesenc128 (v2di, v2di)
--- 40357,40363 ----
       v4si __builtin_ia32_gatherdiv4si (v4si, pcint,v2di,v4si,int)
       v4si __builtin_ia32_gatherdiv4si256 (v4si, pcint,v4di,v4si,int)
  
!  The following built-in functions are available when '-maes' is used.
  All of them generate the machine instruction that is part of the name.
  
       v2di __builtin_ia32_aesenc128 (v2di, v2di)
*************** All of them generate the machine instruc
*** 40738,40751 ****
       v2di __builtin_ia32_aeskeygenassist128 (v2di, const int)
       v2di __builtin_ia32_aesimc128 (v2di)
  
!  The following built-in function is available when `-mpclmul' is used.
  
! `v2di __builtin_ia32_pclmulqdq128 (v2di, v2di, const int)'
!      Generates the `pclmulqdq' machine instruction.
  
!  The following built-in function is available when `-mfsgsbase' is
! used.  All of them generate the machine instruction that is part of the
! name.
  
       unsigned int __builtin_ia32_rdfsbase32 (void)
       unsigned long long __builtin_ia32_rdfsbase64 (void)
--- 40367,40379 ----
       v2di __builtin_ia32_aeskeygenassist128 (v2di, const int)
       v2di __builtin_ia32_aesimc128 (v2di)
  
!  The following built-in function is available when '-mpclmul' is used.
  
! 'v2di __builtin_ia32_pclmulqdq128 (v2di, v2di, const int)'
!      Generates the 'pclmulqdq' machine instruction.
  
!  The following built-in function is available when '-mfsgsbase' is used.
! All of them generate the machine instruction that is part of the name.
  
       unsigned int __builtin_ia32_rdfsbase32 (void)
       unsigned long long __builtin_ia32_rdfsbase64 (void)
*************** name.
*** 40756,40769 ****
       void _writegsbase_u32 (unsigned int)
       void _writegsbase_u64 (unsigned long long)
  
!  The following built-in function is available when `-mrdrnd' is used.
  All of them generate the machine instruction that is part of the name.
  
       unsigned int __builtin_ia32_rdrand16_step (unsigned short *)
       unsigned int __builtin_ia32_rdrand32_step (unsigned int *)
       unsigned int __builtin_ia32_rdrand64_step (unsigned long long *)
  
!  The following built-in functions are available when `-msse4a' is used.
  All of them generate the machine instruction that is part of the name.
  
       void __builtin_ia32_movntsd (double *, v2df)
--- 40384,40397 ----
       void _writegsbase_u32 (unsigned int)
       void _writegsbase_u64 (unsigned long long)
  
!  The following built-in function is available when '-mrdrnd' is used.
  All of them generate the machine instruction that is part of the name.
  
       unsigned int __builtin_ia32_rdrand16_step (unsigned short *)
       unsigned int __builtin_ia32_rdrand32_step (unsigned int *)
       unsigned int __builtin_ia32_rdrand64_step (unsigned long long *)
  
!  The following built-in functions are available when '-msse4a' is used.
  All of them generate the machine instruction that is part of the name.
  
       void __builtin_ia32_movntsd (double *, v2df)
*************** All of them generate the machine instruc
*** 40773,40779 ****
       v2di __builtin_ia32_insertq (v2di, v2di)
       v2di __builtin_ia32_insertqi (v2di, v2di, const unsigned int, const unsigned int)
  
!  The following built-in functions are available when `-mxop' is used.
       v2df __builtin_ia32_vfrczpd (v2df)
       v4sf __builtin_ia32_vfrczps (v4sf)
       v2df __builtin_ia32_vfrczsd (v2df)
--- 40401,40407 ----
       v2di __builtin_ia32_insertq (v2di, v2di)
       v2di __builtin_ia32_insertqi (v2di, v2di, const unsigned int, const unsigned int)
  
!  The following built-in functions are available when '-mxop' is used.
       v2df __builtin_ia32_vfrczpd (v2df)
       v4sf __builtin_ia32_vfrczps (v4sf)
       v2df __builtin_ia32_vfrczsd (v2df)
*************** All of them generate the machine instruc
*** 40899,40905 ****
       v2di __builtin_ia32_vpshlq (v2di, v2di)
       v8hi __builtin_ia32_vpshlw (v8hi, v8hi)
  
!  The following built-in functions are available when `-mfma4' is used.
  All of them generate the machine instruction that is part of the name.
  
       v2df __builtin_ia32_vfmaddpd (v2df, v2df, v2df)
--- 40527,40533 ----
       v2di __builtin_ia32_vpshlq (v2di, v2di)
       v8hi __builtin_ia32_vpshlw (v8hi, v8hi)
  
!  The following built-in functions are available when '-mfma4' is used.
  All of them generate the machine instruction that is part of the name.
  
       v2df __builtin_ia32_vfmaddpd (v2df, v2df, v2df)
*************** All of them generate the machine instruc
*** 40935,40941 ****
       v4df __builtin_ia32_vfmsubaddpd256 (v4df, v4df, v4df)
       v8sf __builtin_ia32_vfmsubaddps256 (v8sf, v8sf, v8sf)
  
!  The following built-in functions are available when `-mlwp' is used.
  
       void __builtin_ia32_llwpcb16 (void *);
       void __builtin_ia32_llwpcb32 (void *);
--- 40563,40570 ----
       v4df __builtin_ia32_vfmsubaddpd256 (v4df, v4df, v4df)
       v8sf __builtin_ia32_vfmsubaddps256 (v8sf, v8sf, v8sf)
  
! 
!  The following built-in functions are available when '-mlwp' is used.
  
       void __builtin_ia32_llwpcb16 (void *);
       void __builtin_ia32_llwpcb32 (void *);
*************** All of them generate the machine instruc
*** 40950,40961 ****
       unsigned char __builtin_ia32_lwpins32 (unsigned int, unsigned int, unsigned int)
       unsigned char __builtin_ia32_lwpins64 (unsigned __int64, unsigned int, unsigned int)
  
!  The following built-in functions are available when `-mbmi' is used.
  All of them generate the machine instruction that is part of the name.
       unsigned int __builtin_ia32_bextr_u32(unsigned int, unsigned int);
       unsigned long long __builtin_ia32_bextr_u64 (unsigned long long, unsigned long long);
  
!  The following built-in functions are available when `-mbmi2' is used.
  All of them generate the machine instruction that is part of the name.
       unsigned int _bzhi_u32 (unsigned int, unsigned int)
       unsigned int _pdep_u32 (unsigned int, unsigned int)
--- 40579,40590 ----
       unsigned char __builtin_ia32_lwpins32 (unsigned int, unsigned int, unsigned int)
       unsigned char __builtin_ia32_lwpins64 (unsigned __int64, unsigned int, unsigned int)
  
!  The following built-in functions are available when '-mbmi' is used.
  All of them generate the machine instruction that is part of the name.
       unsigned int __builtin_ia32_bextr_u32(unsigned int, unsigned int);
       unsigned long long __builtin_ia32_bextr_u64 (unsigned long long, unsigned long long);
  
!  The following built-in functions are available when '-mbmi2' is used.
  All of them generate the machine instruction that is part of the name.
       unsigned int _bzhi_u32 (unsigned int, unsigned int)
       unsigned int _pdep_u32 (unsigned int, unsigned int)
*************** All of them generate the machine instruc
*** 40964,41002 ****
       unsigned long long _pdep_u64 (unsigned long long, unsigned long long)
       unsigned long long _pext_u64 (unsigned long long, unsigned long long)
  
!  The following built-in functions are available when `-mlzcnt' is used.
  All of them generate the machine instruction that is part of the name.
!      unsigned short __builtin_ia32_lzcnt_16(unsigned short);
       unsigned int __builtin_ia32_lzcnt_u32(unsigned int);
       unsigned long long __builtin_ia32_lzcnt_u64 (unsigned long long);
  
!  The following built-in functions are available when `-mfxsr' is used.
  All of them generate the machine instruction that is part of the name.
       void __builtin_ia32_fxsave (void *)
       void __builtin_ia32_fxrstor (void *)
       void __builtin_ia32_fxsave64 (void *)
       void __builtin_ia32_fxrstor64 (void *)
  
!  The following built-in functions are available when `-mxsave' is used.
  All of them generate the machine instruction that is part of the name.
       void __builtin_ia32_xsave (void *, long long)
       void __builtin_ia32_xrstor (void *, long long)
       void __builtin_ia32_xsave64 (void *, long long)
       void __builtin_ia32_xrstor64 (void *, long long)
  
!  The following built-in functions are available when `-mxsaveopt' is
  used.  All of them generate the machine instruction that is part of the
  name.
       void __builtin_ia32_xsaveopt (void *, long long)
       void __builtin_ia32_xsaveopt64 (void *, long long)
  
!  The following built-in functions are available when `-mtbm' is used.
  Both of them generate the immediate form of the bextr machine
  instruction.
       unsigned int __builtin_ia32_bextri_u32 (unsigned int, const unsigned int);
       unsigned long long __builtin_ia32_bextri_u64 (unsigned long long, const unsigned long long);
  
!  The following built-in functions are available when `-m3dnow' is used.
  All of them generate the machine instruction that is part of the name.
  
       void __builtin_ia32_femms (void)
--- 40593,40631 ----
       unsigned long long _pdep_u64 (unsigned long long, unsigned long long)
       unsigned long long _pext_u64 (unsigned long long, unsigned long long)
  
!  The following built-in functions are available when '-mlzcnt' is used.
  All of them generate the machine instruction that is part of the name.
!      unsigned short __builtin_ia32_lzcnt_u16(unsigned short);
       unsigned int __builtin_ia32_lzcnt_u32(unsigned int);
       unsigned long long __builtin_ia32_lzcnt_u64 (unsigned long long);
  
!  The following built-in functions are available when '-mfxsr' is used.
  All of them generate the machine instruction that is part of the name.
       void __builtin_ia32_fxsave (void *)
       void __builtin_ia32_fxrstor (void *)
       void __builtin_ia32_fxsave64 (void *)
       void __builtin_ia32_fxrstor64 (void *)
  
!  The following built-in functions are available when '-mxsave' is used.
  All of them generate the machine instruction that is part of the name.
       void __builtin_ia32_xsave (void *, long long)
       void __builtin_ia32_xrstor (void *, long long)
       void __builtin_ia32_xsave64 (void *, long long)
       void __builtin_ia32_xrstor64 (void *, long long)
  
!  The following built-in functions are available when '-mxsaveopt' is
  used.  All of them generate the machine instruction that is part of the
  name.
       void __builtin_ia32_xsaveopt (void *, long long)
       void __builtin_ia32_xsaveopt64 (void *, long long)
  
!  The following built-in functions are available when '-mtbm' is used.
  Both of them generate the immediate form of the bextr machine
  instruction.
       unsigned int __builtin_ia32_bextri_u32 (unsigned int, const unsigned int);
       unsigned long long __builtin_ia32_bextri_u64 (unsigned long long, const unsigned long long);
  
!  The following built-in functions are available when '-m3dnow' is used.
  All of them generate the machine instruction that is part of the name.
  
       void __builtin_ia32_femms (void)
*************** All of them generate the machine instruc
*** 41019,41026 ****
       v2sf __builtin_ia32_pi2fd (v2si)
       v4hi __builtin_ia32_pmulhrw (v4hi, v4hi)
  
!  The following built-in functions are available when both `-m3dnow' and
! `-march=athlon' are used.  All of them generate the machine instruction
  that is part of the name.
  
       v2si __builtin_ia32_pf2iw (v2sf)
--- 40648,40655 ----
       v2sf __builtin_ia32_pi2fd (v2si)
       v4hi __builtin_ia32_pmulhrw (v4hi, v4hi)
  
!  The following built-in functions are available when both '-m3dnow' and
! '-march=athlon' are used.  All of them generate the machine instruction
  that is part of the name.
  
       v2si __builtin_ia32_pf2iw (v2sf)
*************** that is part of the name.
*** 41030,41038 ****
       v2sf __builtin_ia32_pswapdsf (v2sf)
       v2si __builtin_ia32_pswapdsi (v2si)
  
!  The following built-in functions are available when `-mrtm' is used
! They are used for restricted transactional memory. These are the
! internal low level functions. Normally the functions in *note x86
  transactional memory intrinsics:: should be used instead.
  
       int __builtin_ia32_xbegin ()
--- 40659,40667 ----
       v2sf __builtin_ia32_pswapdsf (v2sf)
       v2si __builtin_ia32_pswapdsi (v2si)
  
!  The following built-in functions are available when '-mrtm' is used
! They are used for restricted transactional memory.  These are the
! internal low level functions.  Normally the functions in *note x86
  transactional memory intrinsics:: should be used instead.
  
       int __builtin_ia32_xbegin ()
*************** transactional memory intrinsics:: should
*** 41040,41046 ****
       void __builtin_ia32_xabort (status)
       int __builtin_ia32_xtest ()
  
!  The following built-in functions are available when `-mmwaitx' is used.
  All of them generate the machine instruction that is part of the name.
       void __builtin_ia32_monitorx (void *, unsigned int, unsigned int)
       void __builtin_ia32_mwaitx (unsigned int, unsigned int, unsigned int)
--- 40669,40675 ----
       void __builtin_ia32_xabort (status)
       int __builtin_ia32_xtest ()
  
!  The following built-in functions are available when '-mmwaitx' is used.
  All of them generate the machine instruction that is part of the name.
       void __builtin_ia32_monitorx (void *, unsigned int, unsigned int)
       void __builtin_ia32_mwaitx (unsigned int, unsigned int, unsigned int)
*************** File: gcc.info,  Node: x86 transactional
*** 41053,41106 ****
  
  These hardware transactional memory intrinsics for x86 allow you to use
  memory transactions with RTM (Restricted Transactional Memory).  This
! support is enabled with the `-mrtm' option.  For using HLE (Hardware
  Lock Elision) see *note x86 specific memory model extensions for
  transactional memory:: instead.
  
!  A memory transaction commits all changes to memory in an atomic way,
! as visible to other threads. If the transaction fails it is rolled back
  and all side effects discarded.
  
   Generally there is no guarantee that a memory transaction ever succeeds
  and suitable fallback code always needs to be supplied.
  
   -- RTM Function: unsigned _xbegin ()
!      Start a RTM (Restricted Transactional Memory) transaction.
!      Returns `_XBEGIN_STARTED' when the transaction started
!      successfully (note this is not 0, so the constant has to be
!      explicitly tested).
! 
!      If the transaction aborts, all side-effects are undone and an
!      abort code encoded as a bit mask is returned.  The following
!      macros are defined:
  
!     `_XABORT_EXPLICIT'
!           Transaction was explicitly aborted with `_xabort'.  The
!           parameter passed to `_xabort' is available with
!           `_XABORT_CODE(status)'.
  
!     `_XABORT_RETRY'
            Transaction retry is possible.
! 
!     `_XABORT_CONFLICT'
            Transaction abort due to a memory conflict with another
            thread.
! 
!     `_XABORT_CAPACITY'
            Transaction abort due to the transaction using too much
            memory.
! 
!     `_XABORT_DEBUG'
            Transaction abort due to a debug trap.
! 
!     `_XABORT_NESTED'
            Transaction abort in an inner nested transaction.
  
       There is no guarantee any transaction ever succeeds, so there
       always needs to be a valid fallback path.
  
   -- RTM Function: void _xend ()
!      Commit the current transaction. When no transaction is active this
       faults.  All memory side-effects of the transaction become visible
       to other threads in an atomic manner.
  
--- 40682,40729 ----
  
  These hardware transactional memory intrinsics for x86 allow you to use
  memory transactions with RTM (Restricted Transactional Memory).  This
! support is enabled with the '-mrtm' option.  For using HLE (Hardware
  Lock Elision) see *note x86 specific memory model extensions for
  transactional memory:: instead.
  
!  A memory transaction commits all changes to memory in an atomic way, as
! visible to other threads.  If the transaction fails it is rolled back
  and all side effects discarded.
  
   Generally there is no guarantee that a memory transaction ever succeeds
  and suitable fallback code always needs to be supplied.
  
   -- RTM Function: unsigned _xbegin ()
!      Start a RTM (Restricted Transactional Memory) transaction.  Returns
!      '_XBEGIN_STARTED' when the transaction started successfully (note
!      this is not 0, so the constant has to be explicitly tested).
  
!      If the transaction aborts, all side-effects are undone and an abort
!      code encoded as a bit mask is returned.  The following macros are
!      defined:
  
!      '_XABORT_EXPLICIT'
!           Transaction was explicitly aborted with '_xabort'.  The
!           parameter passed to '_xabort' is available with
!           '_XABORT_CODE(status)'.
!      '_XABORT_RETRY'
            Transaction retry is possible.
!      '_XABORT_CONFLICT'
            Transaction abort due to a memory conflict with another
            thread.
!      '_XABORT_CAPACITY'
            Transaction abort due to the transaction using too much
            memory.
!      '_XABORT_DEBUG'
            Transaction abort due to a debug trap.
!      '_XABORT_NESTED'
            Transaction abort in an inner nested transaction.
  
       There is no guarantee any transaction ever succeeds, so there
       always needs to be a valid fallback path.
  
   -- RTM Function: void _xend ()
!      Commit the current transaction.  When no transaction is active this
       faults.  All memory side-effects of the transaction become visible
       to other threads in an atomic manner.
  
*************** and suitable fallback code always needs
*** 41109,41119 ****
       otherwise 0.
  
   -- RTM Function: void _xabort (status)
!      Abort the current transaction. When no transaction is active this
       is a no-op.  The STATUS is an 8-bit constant; its value is encoded
!      in the return value from `_xbegin'.
  
!  Here is an example showing handling for `_XABORT_RETRY' and a fallback
  path for other failures:
  
       #include <immintrin.h>
--- 40732,40742 ----
       otherwise 0.
  
   -- RTM Function: void _xabort (status)
!      Abort the current transaction.  When no transaction is active this
       is a no-op.  The STATUS is an 8-bit constant; its value is encoded
!      in the return value from '_xbegin'.
  
!  Here is an example showing handling for '_XABORT_RETRY' and a fallback
  path for other failures:
  
       #include <immintrin.h>
*************** File: gcc.info,  Node: Solaris Format Ch
*** 41162,41171 ****
  6.59.1 Solaris Format Checks
  ----------------------------
  
! Solaris targets support the `cmn_err' (or `__cmn_err__') format check.
! `cmn_err' accepts a subset of the standard `printf' conversions, and
! the two-argument `%b' conversion for displaying bit-fields.  See the
! Solaris man page for `cmn_err' for more information.
  
  
  File: gcc.info,  Node: Darwin Format Checks,  Prev: Solaris Format Checks,  Up: Target Format Checks
--- 40785,40794 ----
  6.59.1 Solaris Format Checks
  ----------------------------
  
! Solaris targets support the 'cmn_err' (or '__cmn_err__') format check.
! 'cmn_err' accepts a subset of the standard 'printf' conversions, and the
! two-argument '%b' conversion for displaying bit-fields.  See the Solaris
! man page for 'cmn_err' for more information.
  
  
  File: gcc.info,  Node: Darwin Format Checks,  Prev: Solaris Format Checks,  Up: Target Format Checks
*************** File: gcc.info,  Node: Darwin Format Che
*** 41173,41189 ****
  6.59.2 Darwin Format Checks
  ---------------------------
  
! Darwin targets support the `CFString' (or `__CFString__') in the format
  attribute context.  Declarations made with such attribution are parsed
  for correct syntax and format argument types.  However, parsing of the
  format string itself is currently undefined and is not carried out by
  this version of the compiler.
  
!  Additionally, `CFStringRefs' (defined by the `CoreFoundation' headers)
  may also be used as format arguments.  Note that the relevant headers
  are only likely to be available on Darwin (OSX) installations.  On such
  installations, the XCode and system documentation provide descriptions
! of `CFString', `CFStringRefs' and associated functions.
  
  
  File: gcc.info,  Node: Pragmas,  Next: Unnamed Fields,  Prev: Target Format Checks,  Up: C Extensions
--- 40796,40812 ----
  6.59.2 Darwin Format Checks
  ---------------------------
  
! Darwin targets support the 'CFString' (or '__CFString__') in the format
  attribute context.  Declarations made with such attribution are parsed
  for correct syntax and format argument types.  However, parsing of the
  format string itself is currently undefined and is not carried out by
  this version of the compiler.
  
!  Additionally, 'CFStringRefs' (defined by the 'CoreFoundation' headers)
  may also be used as format arguments.  Note that the relevant headers
  are only likely to be available on Darwin (OSX) installations.  On such
  installations, the XCode and system documentation provide descriptions
! of 'CFString', 'CFStringRefs' and associated functions.
  
  
  File: gcc.info,  Node: Pragmas,  Next: Unnamed Fields,  Prev: Target Format Checks,  Up: C Extensions
*************** File: gcc.info,  Node: Pragmas,  Next: U
*** 41192,41199 ****
  ============================
  
  GCC supports several types of pragmas, primarily in order to compile
! code originally written for other compilers.  Note that in general we
! do not recommend the use of pragmas; *Note Function Attributes::, for
  further explanation.
  
  * Menu:
--- 40815,40822 ----
  ============================
  
  GCC supports several types of pragmas, primarily in order to compile
! code originally written for other compilers.  Note that in general we do
! not recommend the use of pragmas; *Note Function Attributes::, for
  further explanation.
  
  * Menu:
*************** File: gcc.info,  Node: ARM Pragmas,  Nex
*** 41220,41236 ****
  ------------------
  
  The ARM target defines pragmas for controlling the default addition of
! `long_call' and `short_call' attributes to functions.  *Note Function
  Attributes::, for information about the effects of these attributes.
  
! `long_calls'
!      Set all subsequent functions to have the `long_call' attribute.
  
! `no_long_calls'
!      Set all subsequent functions to have the `short_call' attribute.
  
! `long_calls_off'
!      Do not affect the `long_call' or `short_call' attributes of
       subsequent functions.
  
  
--- 40843,40859 ----
  ------------------
  
  The ARM target defines pragmas for controlling the default addition of
! 'long_call' and 'short_call' attributes to functions.  *Note Function
  Attributes::, for information about the effects of these attributes.
  
! 'long_calls'
!      Set all subsequent functions to have the 'long_call' attribute.
  
! 'no_long_calls'
!      Set all subsequent functions to have the 'short_call' attribute.
  
! 'long_calls_off'
!      Do not affect the 'long_call' or 'short_call' attributes of
       subsequent functions.
  
  
*************** File: gcc.info,  Node: M32C Pragmas,  Ne
*** 41239,41285 ****
  6.60.2 M32C Pragmas
  -------------------
  
! `GCC memregs NUMBER'
!      Overrides the command-line option `-memregs=' for the current
!      file.  Use with care!  This pragma must be before any function in
!      the file, and mixing different memregs values in different objects
!      may make them incompatible.  This pragma is useful when a
       performance-critical function uses a memreg for temporary values,
       as it may allow you to reduce the number of memregs used.
  
! `ADDRESS NAME ADDRESS'
       For any declared symbols matching NAME, this does three things to
       that symbol: it forces the symbol to be located at the given
       address (a number), it forces the symbol to be volatile, and it
       changes the symbol's scope to be static.  This pragma exists for
       compatibility with other compilers, but note that the common
!      `1234H' numeric syntax is not supported (use `0x1234' instead).
       Example:
  
            #pragma ADDRESS port3 0x103
            char port3;
  
- 
  
  File: gcc.info,  Node: MeP Pragmas,  Next: RS/6000 and PowerPC Pragmas,  Prev: M32C Pragmas,  Up: Pragmas
  
  6.60.3 MeP Pragmas
  ------------------
  
! `custom io_volatile (on|off)'
!      Overrides the command-line option `-mio-volatile' for the current
       file.  Note that for compatibility with future GCC releases, this
!      option should only be used once before any `io' variables in each
       file.
  
! `GCC coprocessor available REGISTERS'
       Specifies which coprocessor registers are available to the register
       allocator.  REGISTERS may be a single register, register range
       separated by ellipses, or comma-separated list of those.  Example:
  
            #pragma GCC coprocessor available $c0...$c10, $c28
  
! `GCC coprocessor call_saved REGISTERS'
       Specifies which coprocessor registers are to be saved and restored
       by any function using them.  REGISTERS may be a single register,
       register range separated by ellipses, or comma-separated list of
--- 40862,40907 ----
  6.60.2 M32C Pragmas
  -------------------
  
! 'GCC memregs NUMBER'
!      Overrides the command-line option '-memregs=' for the current file.
!      Use with care!  This pragma must be before any function in the
!      file, and mixing different memregs values in different objects may
!      make them incompatible.  This pragma is useful when a
       performance-critical function uses a memreg for temporary values,
       as it may allow you to reduce the number of memregs used.
  
! 'ADDRESS NAME ADDRESS'
       For any declared symbols matching NAME, this does three things to
       that symbol: it forces the symbol to be located at the given
       address (a number), it forces the symbol to be volatile, and it
       changes the symbol's scope to be static.  This pragma exists for
       compatibility with other compilers, but note that the common
!      '1234H' numeric syntax is not supported (use '0x1234' instead).
       Example:
  
            #pragma ADDRESS port3 0x103
            char port3;
  
  
  File: gcc.info,  Node: MeP Pragmas,  Next: RS/6000 and PowerPC Pragmas,  Prev: M32C Pragmas,  Up: Pragmas
  
  6.60.3 MeP Pragmas
  ------------------
  
! 'custom io_volatile (on|off)'
!      Overrides the command-line option '-mio-volatile' for the current
       file.  Note that for compatibility with future GCC releases, this
!      option should only be used once before any 'io' variables in each
       file.
  
! 'GCC coprocessor available REGISTERS'
       Specifies which coprocessor registers are available to the register
       allocator.  REGISTERS may be a single register, register range
       separated by ellipses, or comma-separated list of those.  Example:
  
            #pragma GCC coprocessor available $c0...$c10, $c28
  
! 'GCC coprocessor call_saved REGISTERS'
       Specifies which coprocessor registers are to be saved and restored
       by any function using them.  REGISTERS may be a single register,
       register range separated by ellipses, or comma-separated list of
*************** File: gcc.info,  Node: MeP Pragmas,  Nex
*** 41287,41295 ****
  
            #pragma GCC coprocessor call_saved $c4...$c6, $c31
  
! `GCC coprocessor subclass '(A|B|C|D)' = REGISTERS'
       Creates and defines a register class.  These register classes can
!      be used by inline `asm' constructs.  REGISTERS may be a single
       register, register range separated by ellipses, or comma-separated
       list of those.  Example:
  
--- 40909,40917 ----
  
            #pragma GCC coprocessor call_saved $c4...$c6, $c31
  
! 'GCC coprocessor subclass '(A|B|C|D)' = REGISTERS'
       Creates and defines a register class.  These register classes can
!      be used by inline 'asm' constructs.  REGISTERS may be a single
       register, register range separated by ellipses, or comma-separated
       list of those.  Example:
  
*************** File: gcc.info,  Node: MeP Pragmas,  Nex
*** 41297,41303 ****
  
            asm ("cpfoo %0" : "=B" (x));
  
! `GCC disinterrupt NAME , NAME ...'
       For the named functions, the compiler adds code to disable
       interrupts for the duration of those functions.  If any functions
       so named are not encountered in the source, a warning is emitted
--- 40919,40925 ----
  
            asm ("cpfoo %0" : "=B" (x));
  
! 'GCC disinterrupt NAME , NAME ...'
       For the named functions, the compiler adds code to disable
       interrupts for the duration of those functions.  If any functions
       so named are not encountered in the source, a warning is emitted
*************** File: gcc.info,  Node: MeP Pragmas,  Nex
*** 41307,41313 ****
            #pragma disinterrupt bar, grill
            int foo () { ... }
  
! `GCC call NAME , NAME ...'
       For the named functions, the compiler always uses a
       register-indirect call model when calling the named functions.
       Examples:
--- 40929,40935 ----
            #pragma disinterrupt bar, grill
            int foo () { ... }
  
! 'GCC call NAME , NAME ...'
       For the named functions, the compiler always uses a
       register-indirect call model when calling the named functions.
       Examples:
*************** File: gcc.info,  Node: MeP Pragmas,  Nex
*** 41315,41321 ****
            extern int foo ();
            #pragma call foo
  
- 
  
  File: gcc.info,  Node: RS/6000 and PowerPC Pragmas,  Next: Darwin Pragmas,  Prev: MeP Pragmas,  Up: Pragmas
  
--- 40937,40942 ----
*************** File: gcc.info,  Node: RS/6000 and Power
*** 41323,41340 ****
  ----------------------------------
  
  The RS/6000 and PowerPC targets define one pragma for controlling
! whether or not the `longcall' attribute is added to function
! declarations by default.  This pragma overrides the `-mlongcall'
! option, but not the `longcall' and `shortcall' attributes.  *Note
! RS/6000 and PowerPC Options::, for more information about when long
! calls are and are not necessary.
  
! `longcall (1)'
!      Apply the `longcall' attribute to all subsequent function
       declarations.
  
! `longcall (0)'
!      Do not apply the `longcall' attribute to subsequent function
       declarations.
  
  
--- 40944,40961 ----
  ----------------------------------
  
  The RS/6000 and PowerPC targets define one pragma for controlling
! whether or not the 'longcall' attribute is added to function
! declarations by default.  This pragma overrides the '-mlongcall' option,
! but not the 'longcall' and 'shortcall' attributes.  *Note RS/6000 and
! PowerPC Options::, for more information about when long calls are and
! are not necessary.
  
! 'longcall (1)'
!      Apply the 'longcall' attribute to all subsequent function
       declarations.
  
! 'longcall (0)'
!      Do not apply the 'longcall' attribute to subsequent function
       declarations.
  
  
*************** The following pragmas are available for
*** 41347,41369 ****
  Darwin operating system.  These are useful for compatibility with other
  Mac OS compilers.
  
! `mark TOKENS...'
       This pragma is accepted, but has no effect.
  
! `options align=ALIGNMENT'
!      This pragma sets the alignment of fields in structures.  The
!      values of ALIGNMENT may be `mac68k', to emulate m68k alignment, or
!      `power', to emulate PowerPC alignment.  Uses of this pragma nest
!      properly; to restore the previous setting, use `reset' for the
       ALIGNMENT.
  
! `segment TOKENS...'
       This pragma is accepted, but has no effect.
  
! `unused (VAR [, VAR]...)'
       This pragma declares variables to be possibly unused.  GCC does not
       produce warnings for the listed variables.  The effect is similar
!      to that of the `unused' attribute, except that this pragma may
       appear anywhere within the variables' scopes.
  
  
--- 40968,40990 ----
  Darwin operating system.  These are useful for compatibility with other
  Mac OS compilers.
  
! 'mark TOKENS...'
       This pragma is accepted, but has no effect.
  
! 'options align=ALIGNMENT'
!      This pragma sets the alignment of fields in structures.  The values
!      of ALIGNMENT may be 'mac68k', to emulate m68k alignment, or
!      'power', to emulate PowerPC alignment.  Uses of this pragma nest
!      properly; to restore the previous setting, use 'reset' for the
       ALIGNMENT.
  
! 'segment TOKENS...'
       This pragma is accepted, but has no effect.
  
! 'unused (VAR [, VAR]...)'
       This pragma declares variables to be possibly unused.  GCC does not
       produce warnings for the listed variables.  The effect is similar
!      to that of the 'unused' attribute, except that this pragma may
       appear anywhere within the variables' scopes.
  
  
*************** File: gcc.info,  Node: Solaris Pragmas,
*** 41372,41399 ****
  6.60.6 Solaris Pragmas
  ----------------------
  
! The Solaris target supports `#pragma redefine_extname' (*note
! Symbol-Renaming Pragmas::).  It also supports additional `#pragma'
  directives for compatibility with the system compiler.
  
! `align ALIGNMENT (VARIABLE [, VARIABLE]...)'
!      Increase the minimum alignment of each VARIABLE to ALIGNMENT.
!      This is the same as GCC's `aligned' attribute *note Variable
       Attributes::).  Macro expansion occurs on the arguments to this
       pragma when compiling C and Objective-C.  It does not currently
!      occur when compiling C++, but this is a bug which may be fixed in
!      a future release.
  
! `fini (FUNCTION [, FUNCTION]...)'
!      This pragma causes each listed FUNCTION to be called after main,
!      or during shared module unloading, by adding a call to the `.fini'
       section.
  
! `init (FUNCTION [, FUNCTION]...)'
!      This pragma causes each listed FUNCTION to be called during
!      initialization (before `main') or during shared module loading, by
!      adding a call to the `.init' section.
  
  
  
  File: gcc.info,  Node: Symbol-Renaming Pragmas,  Next: Structure-Packing Pragmas,  Prev: Solaris Pragmas,  Up: Pragmas
--- 40993,41022 ----
  6.60.6 Solaris Pragmas
  ----------------------
  
! The Solaris target supports '#pragma redefine_extname' (*note
! Symbol-Renaming Pragmas::).  It also supports additional '#pragma'
  directives for compatibility with the system compiler.
  
! 'align ALIGNMENT (VARIABLE [, VARIABLE]...)'
! 
!      Increase the minimum alignment of each VARIABLE to ALIGNMENT.  This
!      is the same as GCC's 'aligned' attribute *note Variable
       Attributes::).  Macro expansion occurs on the arguments to this
       pragma when compiling C and Objective-C.  It does not currently
!      occur when compiling C++, but this is a bug which may be fixed in a
!      future release.
  
! 'fini (FUNCTION [, FUNCTION]...)'
! 
!      This pragma causes each listed FUNCTION to be called after main, or
!      during shared module unloading, by adding a call to the '.fini'
       section.
  
! 'init (FUNCTION [, FUNCTION]...)'
  
+      This pragma causes each listed FUNCTION to be called during
+      initialization (before 'main') or during shared module loading, by
+      adding a call to the '.init' section.
  
  
  File: gcc.info,  Node: Symbol-Renaming Pragmas,  Next: Structure-Packing Pragmas,  Prev: Solaris Pragmas,  Up: Pragmas
*************** File: gcc.info,  Node: Symbol-Renaming P
*** 41401,41415 ****
  6.60.7 Symbol-Renaming Pragmas
  ------------------------------
  
! GCC supports a `#pragma' directive that changes the name used in
! assembly for a given declaration. While this pragma is supported on all
  platforms, it is intended primarily to provide compatibility with the
! Solaris system headers. This effect can also be achieved using the asm
  labels extension (*note Asm Labels::).
  
! `redefine_extname OLDNAME NEWNAME'
       This pragma gives the C function OLDNAME the assembly symbol
!      NEWNAME.  The preprocessor macro `__PRAGMA_REDEFINE_EXTNAME' is
       defined if this pragma is available (currently on all platforms).
  
   This pragma and the asm labels extension interact in a complicated
--- 41024,41039 ----
  6.60.7 Symbol-Renaming Pragmas
  ------------------------------
  
! GCC supports a '#pragma' directive that changes the name used in
! assembly for a given declaration.  While this pragma is supported on all
  platforms, it is intended primarily to provide compatibility with the
! Solaris system headers.  This effect can also be achieved using the asm
  labels extension (*note Asm Labels::).
  
! 'redefine_extname OLDNAME NEWNAME'
! 
       This pragma gives the C function OLDNAME the assembly symbol
!      NEWNAME.  The preprocessor macro '__PRAGMA_REDEFINE_EXTNAME' is
       defined if this pragma is available (currently on all platforms).
  
   This pragma and the asm labels extension interact in a complicated
*************** manner.  Here are some corner cases you
*** 41424,41434 ****
    3. If either of the ways of changing the assembly name of a
       declaration are applied to a declaration whose assembly name has
       already been determined (either by a previous use of one of these
!      features, or because the compiler needed the assembly name in
!      order to generate code), and the new name is different, a warning
!      issues and the name does not change.
  
!   4. The OLDNAME used by `#pragma redefine_extname' is always the
       C-language name.
  
  
--- 41048,41058 ----
    3. If either of the ways of changing the assembly name of a
       declaration are applied to a declaration whose assembly name has
       already been determined (either by a previous use of one of these
!      features, or because the compiler needed the assembly name in order
!      to generate code), and the new name is different, a warning issues
!      and the name does not change.
  
!   4. The OLDNAME used by '#pragma redefine_extname' is always the
       C-language name.
  
  
*************** File: gcc.info,  Node: Structure-Packing
*** 41438,41473 ****
  --------------------------------
  
  For compatibility with Microsoft Windows compilers, GCC supports a set
! of `#pragma' directives that change the maximum alignment of members of
  structures (other than zero-width bit-fields), unions, and classes
! subsequently defined. The N value below always is required to be a
  small power of two and specifies the new alignment in bytes.
  
!   1. `#pragma pack(N)' simply sets the new alignment.
! 
!   2. `#pragma pack()' sets the alignment to the one that was in effect
       when compilation started (see also command-line option
!      `-fpack-struct[=N]' *note Code Gen Options::).
! 
!   3. `#pragma pack(push[,N])' pushes the current alignment setting on
!      an internal stack and then optionally sets the new alignment.
! 
!   4. `#pragma pack(pop)' restores the alignment setting to the one
!      saved at the top of the internal stack (and removes that stack
!      entry).  Note that `#pragma pack([N])' does not influence this
!      internal stack; thus it is possible to have `#pragma pack(push)'
!      followed by multiple `#pragma pack(N)' instances and finalized by
!      a single `#pragma pack(pop)'.
  
!  Some targets, e.g. x86 and PowerPC, support the `ms_struct' `#pragma'
! which lays out a structure as the documented `__attribute__
  ((ms_struct))'.
!   1. `#pragma ms_struct on' turns on the layout for structures declared.
! 
!   2. `#pragma ms_struct off' turns off the layout for structures
       declared.
! 
!   3. `#pragma ms_struct reset' goes back to the default layout.
  
  
  File: gcc.info,  Node: Weak Pragmas,  Next: Diagnostic Pragmas,  Prev: Structure-Packing Pragmas,  Up: Pragmas
--- 41062,41092 ----
  --------------------------------
  
  For compatibility with Microsoft Windows compilers, GCC supports a set
! of '#pragma' directives that change the maximum alignment of members of
  structures (other than zero-width bit-fields), unions, and classes
! subsequently defined.  The N value below always is required to be a
  small power of two and specifies the new alignment in bytes.
  
!   1. '#pragma pack(N)' simply sets the new alignment.
!   2. '#pragma pack()' sets the alignment to the one that was in effect
       when compilation started (see also command-line option
!      '-fpack-struct[=N]' *note Code Gen Options::).
!   3. '#pragma pack(push[,N])' pushes the current alignment setting on an
!      internal stack and then optionally sets the new alignment.
!   4. '#pragma pack(pop)' restores the alignment setting to the one saved
!      at the top of the internal stack (and removes that stack entry).
!      Note that '#pragma pack([N])' does not influence this internal
!      stack; thus it is possible to have '#pragma pack(push)' followed by
!      multiple '#pragma pack(N)' instances and finalized by a single
!      '#pragma pack(pop)'.
  
!  Some targets, e.g. x86 and PowerPC, support the 'ms_struct' '#pragma'
! which lays out a structure as the documented '__attribute__
  ((ms_struct))'.
!   1. '#pragma ms_struct on' turns on the layout for structures declared.
!   2. '#pragma ms_struct off' turns off the layout for structures
       declared.
!   3. '#pragma ms_struct reset' goes back to the default layout.
  
  
  File: gcc.info,  Node: Weak Pragmas,  Next: Diagnostic Pragmas,  Prev: Structure-Packing Pragmas,  Up: Pragmas
*************** File: gcc.info,  Node: Weak Pragmas,  Ne
*** 41475,41490 ****
  6.60.9 Weak Pragmas
  -------------------
  
! For compatibility with SVR4, GCC supports a set of `#pragma' directives
  for declaring symbols to be weak, and defining weak aliases.
  
! `#pragma weak SYMBOL'
       This pragma declares SYMBOL to be weak, as if the declaration had
       the attribute of the same name.  The pragma may appear before or
       after the declaration of SYMBOL.  It is not an error for SYMBOL to
       never be defined at all.
  
! `#pragma weak SYMBOL1 = SYMBOL2'
       This pragma declares SYMBOL1 to be a weak alias of SYMBOL2.  It is
       an error if SYMBOL2 is not defined in the current translation unit.
  
--- 41094,41109 ----
  6.60.9 Weak Pragmas
  -------------------
  
! For compatibility with SVR4, GCC supports a set of '#pragma' directives
  for declaring symbols to be weak, and defining weak aliases.
  
! '#pragma weak SYMBOL'
       This pragma declares SYMBOL to be weak, as if the declaration had
       the attribute of the same name.  The pragma may appear before or
       after the declaration of SYMBOL.  It is not an error for SYMBOL to
       never be defined at all.
  
! '#pragma weak SYMBOL1 = SYMBOL2'
       This pragma declares SYMBOL1 to be a weak alias of SYMBOL2.  It is
       an error if SYMBOL2 is not defined in the current translation unit.
  
*************** File: gcc.info,  Node: Diagnostic Pragma
*** 41496,41516 ****
  
  GCC allows the user to selectively enable or disable certain types of
  diagnostics, and change the kind of the diagnostic.  For example, a
! project's policy might require that all sources compile with `-Werror'
  but certain files might have exceptions allowing specific types of
  warnings.  Or, a project might selectively enable diagnostics and treat
  them as errors depending on which preprocessor macros are defined.
  
! `#pragma GCC diagnostic KIND OPTION'
       Modifies the disposition of a diagnostic.  Note that not all
       diagnostics are modifiable; at the moment only warnings (normally
!      controlled by `-W...') can be controlled, and not all of them.
!      Use `-fdiagnostics-show-option' to determine which diagnostics are
       controllable and which option controls them.
  
!      KIND is `error' to treat this diagnostic as an error, `warning' to
!      treat it like a warning (even if `-Werror' is in effect), or
!      `ignored' if the diagnostic is to be ignored.  OPTION is a double
       quoted string that matches the command-line option.
  
            #pragma GCC diagnostic warning "-Wformat"
--- 41115,41136 ----
  
  GCC allows the user to selectively enable or disable certain types of
  diagnostics, and change the kind of the diagnostic.  For example, a
! project's policy might require that all sources compile with '-Werror'
  but certain files might have exceptions allowing specific types of
  warnings.  Or, a project might selectively enable diagnostics and treat
  them as errors depending on which preprocessor macros are defined.
  
! '#pragma GCC diagnostic KIND OPTION'
! 
       Modifies the disposition of a diagnostic.  Note that not all
       diagnostics are modifiable; at the moment only warnings (normally
!      controlled by '-W...') can be controlled, and not all of them.  Use
!      '-fdiagnostics-show-option' to determine which diagnostics are
       controllable and which option controls them.
  
!      KIND is 'error' to treat this diagnostic as an error, 'warning' to
!      treat it like a warning (even if '-Werror' is in effect), or
!      'ignored' if the diagnostic is to be ignored.  OPTION is a double
       quoted string that matches the command-line option.
  
            #pragma GCC diagnostic warning "-Wformat"
*************** them as errors depending on which prepro
*** 41523,41533 ****
       pragmas occurring after a line do not affect diagnostics caused by
       that line.
  
! `#pragma GCC diagnostic push'
! `#pragma GCC diagnostic pop'
       Causes GCC to remember the state of the diagnostics as of each
!      `push', and restore to that point at each `pop'.  If a `pop' has
!      no matching `push', the command-line options are restored.
  
            #pragma GCC diagnostic error "-Wuninitialized"
              foo(a);                       /* error is given for this one */
--- 41143,41154 ----
       pragmas occurring after a line do not affect diagnostics caused by
       that line.
  
! '#pragma GCC diagnostic push'
! '#pragma GCC diagnostic pop'
! 
       Causes GCC to remember the state of the diagnostics as of each
!      'push', and restore to that point at each 'pop'.  If a 'pop' has no
!      matching 'push', the command-line options are restored.
  
            #pragma GCC diagnostic error "-Wuninitialized"
              foo(a);                       /* error is given for this one */
*************** them as errors depending on which prepro
*** 41539,41551 ****
            #pragma GCC diagnostic pop
              foo(d);                       /* depends on command-line options */
  
- 
   GCC also offers a simple mechanism for printing messages during
  compilation.
  
! `#pragma message STRING'
!      Prints STRING as a compiler message on compilation.  The message
!      is informational only, and is neither a compilation warning nor an
       error.
  
            #pragma message "Compiling " __FILE__ "..."
--- 41160,41172 ----
            #pragma GCC diagnostic pop
              foo(d);                       /* depends on command-line options */
  
   GCC also offers a simple mechanism for printing messages during
  compilation.
  
! '#pragma message STRING'
! 
!      Prints STRING as a compiler message on compilation.  The message is
!      informational only, and is neither a compilation warning nor an
       error.
  
            #pragma message "Compiling " __FILE__ "..."
*************** compilation.
*** 41558,41585 ****
  
            TODO(Remember to fix this)
  
!      prints `/tmp/file.c:4: note: #pragma message: TODO - Remember to
       fix this'.
  
- 
  
  File: gcc.info,  Node: Visibility Pragmas,  Next: Push/Pop Macro Pragmas,  Prev: Diagnostic Pragmas,  Up: Pragmas
  
  6.60.11 Visibility Pragmas
  --------------------------
  
! `#pragma GCC visibility push(VISIBILITY)'
! `#pragma GCC visibility pop'
       This pragma allows the user to set the visibility for multiple
       declarations without having to give each a visibility attribute
       (*note Function Attributes::).
  
!      In C++, `#pragma GCC visibility' affects only namespace-scope
       declarations.  Class members and template specializations are not
       affected; if you want to override the visibility for a particular
       member or instantiation, you must use an attribute.
  
- 
  
  File: gcc.info,  Node: Push/Pop Macro Pragmas,  Next: Function Specific Option Pragmas,  Prev: Visibility Pragmas,  Up: Pragmas
  
--- 41179,41205 ----
  
            TODO(Remember to fix this)
  
!      prints '/tmp/file.c:4: note: #pragma message: TODO - Remember to
       fix this'.
  
  
  File: gcc.info,  Node: Visibility Pragmas,  Next: Push/Pop Macro Pragmas,  Prev: Diagnostic Pragmas,  Up: Pragmas
  
  6.60.11 Visibility Pragmas
  --------------------------
  
! '#pragma GCC visibility push(VISIBILITY)'
! '#pragma GCC visibility pop'
! 
       This pragma allows the user to set the visibility for multiple
       declarations without having to give each a visibility attribute
       (*note Function Attributes::).
  
!      In C++, '#pragma GCC visibility' affects only namespace-scope
       declarations.  Class members and template specializations are not
       affected; if you want to override the visibility for a particular
       member or instantiation, you must use an attribute.
  
  
  File: gcc.info,  Node: Push/Pop Macro Pragmas,  Next: Function Specific Option Pragmas,  Prev: Visibility Pragmas,  Up: Pragmas
  
*************** File: gcc.info,  Node: Push/Pop Macro Pr
*** 41587,41602 ****
  ------------------------------
  
  For compatibility with Microsoft Windows compilers, GCC supports
! `#pragma push_macro("MACRO_NAME")' and `#pragma
  pop_macro("MACRO_NAME")'.
  
! `#pragma push_macro("MACRO_NAME")'
!      This pragma saves the value of the macro named as MACRO_NAME to
!      the top of the stack for this macro.
  
! `#pragma pop_macro("MACRO_NAME")'
       This pragma sets the value of the macro named as MACRO_NAME to the
!      value on top of the stack for this macro. If the stack for
       MACRO_NAME is empty, the value of the macro remains unchanged.
  
   For example:
--- 41207,41222 ----
  ------------------------------
  
  For compatibility with Microsoft Windows compilers, GCC supports
! '#pragma push_macro("MACRO_NAME")' and '#pragma
  pop_macro("MACRO_NAME")'.
  
! '#pragma push_macro("MACRO_NAME")'
!      This pragma saves the value of the macro named as MACRO_NAME to the
!      top of the stack for this macro.
  
! '#pragma pop_macro("MACRO_NAME")'
       This pragma sets the value of the macro named as MACRO_NAME to the
!      value on top of the stack for this macro.  If the stack for
       MACRO_NAME is empty, the value of the macro remains unchanged.
  
   For example:
*************** pop_macro("MACRO_NAME")'.
*** 41608,41615 ****
       #pragma pop_macro("X")
       int x [X];
  
! In this example, the definition of X as 1 is saved by `#pragma
! push_macro' and restored by `#pragma pop_macro'.
  
  
  File: gcc.info,  Node: Function Specific Option Pragmas,  Next: Loop-Specific Pragmas,  Prev: Push/Pop Macro Pragmas,  Up: Pragmas
--- 41228,41235 ----
       #pragma pop_macro("X")
       int x [X];
  
! In this example, the definition of X as 1 is saved by '#pragma
! push_macro' and restored by '#pragma pop_macro'.
  
  
  File: gcc.info,  Node: Function Specific Option Pragmas,  Next: Loop-Specific Pragmas,  Prev: Push/Pop Macro Pragmas,  Up: Pragmas
*************** File: gcc.info,  Node: Function Specific
*** 41617,41653 ****
  6.60.13 Function Specific Option Pragmas
  ----------------------------------------
  
! `#pragma GCC target ("STRING"...)'
       This pragma allows you to set target specific options for functions
       defined later in the source file.  One or more strings can be
!      specified.  Each function that is defined after this point is as
!      if `attribute((target("STRING")))' was specified for that
!      function.  The parenthesis around the options is optional.  *Note
!      Function Attributes::, for more information about the `target'
!      attribute and the attribute syntax.
  
!      The `#pragma GCC target' pragma is presently implemented for x86,
       PowerPC, and Nios II targets only.
  
! `#pragma GCC optimize ("STRING"...)'
       This pragma allows you to set global optimization options for
       functions defined later in the source file.  One or more strings
       can be specified.  Each function that is defined after this point
!      is as if `attribute((optimize("STRING")))' was specified for that
       function.  The parenthesis around the options is optional.  *Note
!      Function Attributes::, for more information about the `optimize'
       attribute and the attribute syntax.
  
! `#pragma GCC push_options'
! `#pragma GCC pop_options'
       These pragmas maintain a stack of the current target and
       optimization options.  It is intended for include files where you
!      temporarily want to switch to using a different `#pragma GCC
!      target' or `#pragma GCC optimize' and then to pop back to the
       previous options.
  
! `#pragma GCC reset_options'
!      This pragma clears the current `#pragma GCC target' and `#pragma
       GCC optimize' to use the default switches as specified on the
       command line.
  
--- 41237,41277 ----
  6.60.13 Function Specific Option Pragmas
  ----------------------------------------
  
! '#pragma GCC target ("STRING"...)'
! 
       This pragma allows you to set target specific options for functions
       defined later in the source file.  One or more strings can be
!      specified.  Each function that is defined after this point is as if
!      'attribute((target("STRING")))' was specified for that function.
!      The parenthesis around the options is optional.  *Note Function
!      Attributes::, for more information about the 'target' attribute and
!      the attribute syntax.
  
!      The '#pragma GCC target' pragma is presently implemented for x86,
       PowerPC, and Nios II targets only.
  
! '#pragma GCC optimize ("STRING"...)'
! 
       This pragma allows you to set global optimization options for
       functions defined later in the source file.  One or more strings
       can be specified.  Each function that is defined after this point
!      is as if 'attribute((optimize("STRING")))' was specified for that
       function.  The parenthesis around the options is optional.  *Note
!      Function Attributes::, for more information about the 'optimize'
       attribute and the attribute syntax.
  
! '#pragma GCC push_options'
! '#pragma GCC pop_options'
! 
       These pragmas maintain a stack of the current target and
       optimization options.  It is intended for include files where you
!      temporarily want to switch to using a different '#pragma GCC
!      target' or '#pragma GCC optimize' and then to pop back to the
       previous options.
  
! '#pragma GCC reset_options'
! 
!      This pragma clears the current '#pragma GCC target' and '#pragma
       GCC optimize' to use the default switches as specified on the
       command line.
  
*************** File: gcc.info,  Node: Loop-Specific Pra
*** 41657,41668 ****
  6.60.14 Loop-Specific Pragmas
  -----------------------------
  
! `#pragma GCC ivdep'
  
   With this pragma, the programmer asserts that there are no loop-carried
! dependencies which would prevent consecutive iterations of the
! following loop from executing concurrently with SIMD (single
! instruction multiple data) instructions.
  
   For example, the compiler can only unconditionally vectorize the
  following loop with the pragma:
--- 41281,41292 ----
  6.60.14 Loop-Specific Pragmas
  -----------------------------
  
! '#pragma GCC ivdep'
  
   With this pragma, the programmer asserts that there are no loop-carried
! dependencies which would prevent consecutive iterations of the following
! loop from executing concurrently with SIMD (single instruction multiple
! data) instructions.
  
   For example, the compiler can only unconditionally vectorize the
  following loop with the pragma:
*************** following loop with the pragma:
*** 41675,41683 ****
           a[i] = b[i] + c[i];
       }
  
! In this example, using the `restrict' qualifier had the same effect. In
! the following example, that would not be possible. Assume k < -m or k
! >= m. Only with the pragma, the compiler knows that it can
  unconditionally vectorize the following loop:
  
       void ignore_vec_dep (int *a, int k, int c, int m)
--- 41299,41307 ----
           a[i] = b[i] + c[i];
       }
  
! In this example, using the 'restrict' qualifier had the same effect.  In
! the following example, that would not be possible.  Assume k < -m or k
! >= m.  Only with the pragma, the compiler knows that it can
  unconditionally vectorize the following loop:
  
       void ignore_vec_dep (int *a, int k, int c, int m)
*************** structures and unions without names.  Fo
*** 41707,41714 ****
       } foo;
  
  In this example, you are able to access members of the unnamed union
! with code like `foo.b'.  Note that only unnamed structs and unions are
! allowed, you may not have, for example, an unnamed `int'.
  
   You must never create such structures that cause ambiguous field
  definitions.  For example, in this structure:
--- 41331,41338 ----
       } foo;
  
  In this example, you are able to access members of the unnamed union
! with code like 'foo.b'.  Note that only unnamed structs and unions are
! allowed, you may not have, for example, an unnamed 'int'.
  
   You must never create such structures that cause ambiguous field
  definitions.  For example, in this structure:
*************** definitions.  For example, in this struc
*** 41720,41737 ****
         };
       } foo;
  
! it is ambiguous which `a' is being referred to with `foo.a'.  The
  compiler gives errors for such constructs.
  
!  Unless `-fms-extensions' is used, the unnamed field must be a
! structure or union definition without a tag (for example, `struct { int
! a; };').  If `-fms-extensions' is used, the field may also be a
! definition with a tag such as `struct foo { int a; };', a reference to
! a previously defined structure or union such as `struct foo;', or a
! reference to a `typedef' name for a previously defined structure or
! union type.
  
!  The option `-fplan9-extensions' enables `-fms-extensions' as well as
  two other extensions.  First, a pointer to a structure is automatically
  converted to a pointer to an anonymous field for assignments and
  function calls.  For example:
--- 41344,41360 ----
         };
       } foo;
  
! it is ambiguous which 'a' is being referred to with 'foo.a'.  The
  compiler gives errors for such constructs.
  
!  Unless '-fms-extensions' is used, the unnamed field must be a structure
! or union definition without a tag (for example, 'struct { int a; };').
! If '-fms-extensions' is used, the field may also be a definition with a
! tag such as 'struct foo { int a; };', a reference to a previously
! defined structure or union such as 'struct foo;', or a reference to a
! 'typedef' name for a previously defined structure or union type.
  
!  The option '-fplan9-extensions' enables '-fms-extensions' as well as
  two other extensions.  First, a pointer to a structure is automatically
  converted to a pointer to an anonymous field for assignments and
  function calls.  For example:
*************** function calls.  For example:
*** 41741,41752 ****
       extern void f1 (struct s1 *);
       void f2 (struct s2 *p) { f1 (p); }
  
! In the call to `f1' inside `f2', the pointer `p' is converted into a
  pointer to the anonymous field.
  
!  Second, when the type of an anonymous field is a `typedef' for a
! `struct' or `union', code may refer to the field using the name of the
! `typedef'.
  
       typedef struct { int a; } s1;
       struct s2 { s1; };
--- 41364,41375 ----
       extern void f1 (struct s1 *);
       void f2 (struct s2 *p) { f1 (p); }
  
! In the call to 'f1' inside 'f2', the pointer 'p' is converted into a
  pointer to the anonymous field.
  
!  Second, when the type of an anonymous field is a 'typedef' for a
! 'struct' or 'union', code may refer to the field using the name of the
! 'typedef'.
  
       typedef struct { int a; } s1;
       struct s2 { s1; };
*************** allocated such that there is one instanc
*** 41765,41786 ****
  thread.  The runtime model GCC uses to implement this originates in the
  IA-64 processor-specific ABI, but has since been migrated to other
  processors as well.  It requires significant support from the linker
! (`ld'), dynamic linker (`ld.so'), and system libraries (`libc.so' and
! `libpthread.so'), so it is not available everywhere.
  
   At the user level, the extension is visible with a new storage class
! keyword: `__thread'.  For example:
  
       __thread int i;
       extern __thread struct state s;
       static __thread char *p;
  
!  The `__thread' specifier may be used alone, with the `extern' or
! `static' specifiers, but with no other storage class specifier.  When
! used with `extern' or `static', `__thread' must appear immediately
! after the other storage class specifier.
  
!  The `__thread' specifier may be applied to any global, file-scoped
  static, function-scoped static, or static data member of a class.  It
  may not be applied to block-scoped automatic or non-static data member.
  
--- 41388,41409 ----
  thread.  The runtime model GCC uses to implement this originates in the
  IA-64 processor-specific ABI, but has since been migrated to other
  processors as well.  It requires significant support from the linker
! ('ld'), dynamic linker ('ld.so'), and system libraries ('libc.so' and
! 'libpthread.so'), so it is not available everywhere.
  
   At the user level, the extension is visible with a new storage class
! keyword: '__thread'.  For example:
  
       __thread int i;
       extern __thread struct state s;
       static __thread char *p;
  
!  The '__thread' specifier may be used alone, with the 'extern' or
! 'static' specifiers, but with no other storage class specifier.  When
! used with 'extern' or 'static', '__thread' must appear immediately after
! the other storage class specifier.
  
!  The '__thread' specifier may be applied to any global, file-scoped
  static, function-scoped static, or static data member of a class.  It
  may not be applied to block-scoped automatic or non-static data member.
  
*************** File: gcc.info,  Node: C99 Thread-Local
*** 41816,41822 ****
  The following are a set of changes to ISO/IEC 9899:1999 (aka C99) that
  document the exact semantics of the language extension.
  
!    * `5.1.2  Execution environments'
  
       Add new text after paragraph 1
  
--- 41439,41445 ----
  The following are a set of changes to ISO/IEC 9899:1999 (aka C99) that
  document the exact semantics of the language extension.
  
!    * '5.1.2 Execution environments'
  
       Add new text after paragraph 1
  
*************** document the exact semantics of the lang
*** 41829,41866 ****
            terminated.  However, objects with thread storage duration
            shall be initialized before thread startup.
  
!    * `6.2.4  Storage durations of objects'
  
       Add new text before paragraph 3
  
            An object whose identifier is declared with the storage-class
!           specifier `__thread' has "thread storage duration".  Its
!           lifetime is the entire execution of the thread, and its
!           stored value is initialized only once, prior to thread
!           startup.
  
!    * `6.4.1  Keywords'
  
!      Add `__thread'.
  
!    * `6.7.1  Storage-class specifiers'
  
!      Add `__thread' to the list of storage class specifiers in
!      paragraph 1.
  
       Change paragraph 2 to
  
!           With the exception of `__thread', at most one storage-class
!           specifier may be given [...].  The `__thread' specifier may
!           be used alone, or immediately following `extern' or `static'.
  
       Add new text after paragraph 6
  
!           The declaration of an identifier for a variable that has
!           block scope that specifies `__thread' shall also specify
!           either `extern' or `static'.
  
!           The `__thread' specifier shall be used only with variables.
  
  
  File: gcc.info,  Node: C++98 Thread-Local Edits,  Prev: C99 Thread-Local Edits,  Up: Thread-Local
--- 41452,41488 ----
            terminated.  However, objects with thread storage duration
            shall be initialized before thread startup.
  
!    * '6.2.4 Storage durations of objects'
  
       Add new text before paragraph 3
  
            An object whose identifier is declared with the storage-class
!           specifier '__thread' has "thread storage duration".  Its
!           lifetime is the entire execution of the thread, and its stored
!           value is initialized only once, prior to thread startup.
  
!    * '6.4.1 Keywords'
  
!      Add '__thread'.
  
!    * '6.7.1 Storage-class specifiers'
  
!      Add '__thread' to the list of storage class specifiers in paragraph
!      1.
  
       Change paragraph 2 to
  
!           With the exception of '__thread', at most one storage-class
!           specifier may be given [...].  The '__thread' specifier may be
!           used alone, or immediately following 'extern' or 'static'.
  
       Add new text after paragraph 6
  
!           The declaration of an identifier for a variable that has block
!           scope that specifies '__thread' shall also specify either
!           'extern' or 'static'.
  
!           The '__thread' specifier shall be used only with variables.
  
  
  File: gcc.info,  Node: C++98 Thread-Local Edits,  Prev: C99 Thread-Local Edits,  Up: Thread-Local
*************** that document the exact semantics of the
*** 41887,41906 ****
  
     * [lex.key]
  
!      Add `__thread'.
  
     * [basic.start.main]
  
       Add after paragraph 5
  
!           The thread that begins execution at the `main' function is
            called the "main thread".  It is implementation defined how
            functions beginning threads other than the main thread are
!           designated or typed.  A function so designated, as well as
!           the `main' function, is called a "thread startup function".
!           It is implementation defined what happens if a thread startup
            function returns.  It is implementation defined what happens
!           to other threads when any thread calls `exit'.
  
     * [basic.start.init]
  
--- 41509,41528 ----
  
     * [lex.key]
  
!      Add '__thread'.
  
     * [basic.start.main]
  
       Add after paragraph 5
  
!           The thread that begins execution at the 'main' function is
            called the "main thread".  It is implementation defined how
            functions beginning threads other than the main thread are
!           designated or typed.  A function so designated, as well as the
!           'main' function, is called a "thread startup function".  It is
!           implementation defined what happens if a thread startup
            function returns.  It is implementation defined what happens
!           to other threads when any thread calls 'exit'.
  
     * [basic.start.init]
  
*************** that document the exact semantics of the
*** 41908,41915 ****
  
            The storage for an object of thread storage duration shall be
            statically initialized before the first statement of the
!           thread startup function.  An object of thread storage
!           duration shall not require dynamic initialization.
  
     * [basic.start.term]
  
--- 41530,41537 ----
  
            The storage for an object of thread storage duration shall be
            statically initialized before the first statement of the
!           thread startup function.  An object of thread storage duration
!           shall not require dynamic initialization.
  
     * [basic.start.term]
  
*************** that document the exact semantics of the
*** 41926,41945 ****
  
       Change paragraph 2
  
!           Thread, static, and automatic storage durations are
!           associated with objects introduced by declarations [...].
  
!      Add `__thread' to the list of specifiers in paragraph 3.
  
     * [basic.stc.thread]
  
       New section before [basic.stc.static]
  
!           The keyword `__thread' applied to a non-local object gives the
            object thread storage duration.
  
!           A local variable or class data member declared both `static'
!           and `__thread' gives the variable or member thread storage
            duration.
  
     * [basic.stc.static]
--- 41548,41567 ----
  
       Change paragraph 2
  
!           Thread, static, and automatic storage durations are associated
!           with objects introduced by declarations [...].
  
!      Add '__thread' to the list of specifiers in paragraph 3.
  
     * [basic.stc.thread]
  
       New section before [basic.stc.static]
  
!           The keyword '__thread' applied to a non-local object gives the
            object thread storage duration.
  
!           A local variable or class data member declared both 'static'
!           and '__thread' gives the variable or member thread storage
            duration.
  
     * [basic.stc.static]
*************** that document the exact semantics of the
*** 41951,41985 ****
  
     * [dcl.stc]
  
!      Add `__thread' to the list in paragraph 1.
  
       Change paragraph 1
  
!           With the exception of `__thread', at most one
            STORAGE-CLASS-SPECIFIER shall appear in a given
!           DECL-SPECIFIER-SEQ.  The `__thread' specifier may be used
!           alone, or immediately following the `extern' or `static'
            specifiers.  [...]
  
       Add after paragraph 5
  
!           The `__thread' specifier can be applied only to the names of
            objects and to anonymous unions.
  
     * [class.mem]
  
       Add after paragraph 6
  
!           Non-`static' members shall not be `__thread'.
  
  
  File: gcc.info,  Node: Binary constants,  Prev: Thread-Local,  Up: C Extensions
  
! 6.63 Binary Constants using the `0b' Prefix
  ===========================================
  
  Integer constants can be written as binary constants, consisting of a
! sequence of `0' and `1' digits, prefixed by `0b' or `0B'.  This is
  particularly useful in environments that operate a lot on the bit level
  (like microcontrollers).
  
--- 41573,41607 ----
  
     * [dcl.stc]
  
!      Add '__thread' to the list in paragraph 1.
  
       Change paragraph 1
  
!           With the exception of '__thread', at most one
            STORAGE-CLASS-SPECIFIER shall appear in a given
!           DECL-SPECIFIER-SEQ.  The '__thread' specifier may be used
!           alone, or immediately following the 'extern' or 'static'
            specifiers.  [...]
  
       Add after paragraph 5
  
!           The '__thread' specifier can be applied only to the names of
            objects and to anonymous unions.
  
     * [class.mem]
  
       Add after paragraph 6
  
!           Non-'static' members shall not be '__thread'.
  
  
  File: gcc.info,  Node: Binary constants,  Prev: Thread-Local,  Up: C Extensions
  
! 6.63 Binary Constants using the '0b' Prefix
  ===========================================
  
  Integer constants can be written as binary constants, consisting of a
! sequence of '0' and '1' digits, prefixed by '0b' or '0B'.  This is
  particularly useful in environments that operate a lot on the bit level
  (like microcontrollers).
  
*************** particularly useful in environments that
*** 41991,41997 ****
       i = 0b101010;
  
   The type of these constants follows the same rules as for octal or
! hexadecimal integer constants, so suffixes like `L' or `UL' can be
  applied.
  
  
--- 41613,41619 ----
       i = 0b101010;
  
   The type of these constants follows the same rules as for octal or
! hexadecimal integer constants, so suffixes like 'L' or 'UL' can be
  applied.
  
  
*************** The GNU compiler provides these extensio
*** 42004,42011 ****
  can also use most of the C language extensions in your C++ programs).
  If you want to write code that checks whether these features are
  available, you can test for the GNU compiler the same way as for C
! programs: check for a predefined macro `__GNUC__'.  You can also use
! `__GNUG__' to test specifically for GNU C++ (*note Predefined Macros:
  (cpp)Common Predefined Macros.).
  
  * Menu:
--- 41626,41633 ----
  can also use most of the C language extensions in your C++ programs).
  If you want to write code that checks whether these features are
  available, you can test for the GNU compiler the same way as for C
! programs: check for a predefined macro '__GNUC__'.  You can also use
! '__GNUG__' to test specifically for GNU C++ (*note Predefined Macros:
  (cpp)Common Predefined Macros.).
  
  * Menu:
*************** programs: check for a predefined macro `
*** 42018,42024 ****
  * Template Instantiation:: Methods for ensuring that exactly one copy of
                          each needed template instantiation is emitted.
  * Bound member functions:: You can extract a function pointer to the
!                         method denoted by a `->*' or `.*' expression.
  * C++ Attributes::      Variable, function, and type attributes for C++ only.
  * Function Multiversioning::   Declaring multiple function versions.
  * Namespace Association:: Strong using-directives for namespace association.
--- 41640,41646 ----
  * Template Instantiation:: Methods for ensuring that exactly one copy of
                          each needed template instantiation is emitted.
  * Bound member functions:: You can extract a function pointer to the
!                         method denoted by a '->*' or '.*' expression.
  * C++ Attributes::      Variable, function, and type attributes for C++ only.
  * Function Multiversioning::   Declaring multiple function versions.
  * Namespace Association:: Strong using-directives for namespace association.
*************** lvalueness of expressions between C and
*** 42041,42048 ****
  G++ behaves the same as GCC for volatile access, *Note Volatiles: C
  Extensions, for a description of GCC's behavior.
  
!  The C and C++ language specifications differ when an object is
! accessed in a void context:
  
       volatile int *src = SOMEVALUE;
       *src;
--- 41663,41670 ----
  G++ behaves the same as GCC for volatile access, *Note Volatiles: C
  Extensions, for a description of GCC's behavior.
  
!  The C and C++ language specifications differ when an object is accessed
! in a void context:
  
       volatile int *src = SOMEVALUE;
       *src;
*************** File: gcc.info,  Node: Restricted Pointe
*** 42084,42092 ****
  ================================
  
  As with the C front end, G++ understands the C99 feature of restricted
! pointers, specified with the `__restrict__', or `__restrict' type
! qualifier.  Because you cannot compile C++ by specifying the `-std=c99'
! language flag, `restrict' is not a keyword in C++.
  
   In addition to allowing restricted pointers, you can specify restricted
  references, which indicate that the reference is not aliased in the
--- 41706,41714 ----
  ================================
  
  As with the C front end, G++ understands the C99 feature of restricted
! pointers, specified with the '__restrict__', or '__restrict' type
! qualifier.  Because you cannot compile C++ by specifying the '-std=c99'
! language flag, 'restrict' is not a keyword in C++.
  
   In addition to allowing restricted pointers, you can specify restricted
  references, which indicate that the reference is not aliased in the
*************** local context.
*** 42097,42123 ****
         /* ... */
       }
  
! In the body of `fn', RPTR points to an unaliased integer and RREF
! refers to a (different) unaliased integer.
  
   You may also specify whether a member function's THIS pointer is
! unaliased by using `__restrict__' as a member function qualifier.
  
       void T::fn () __restrict__
       {
         /* ... */
       }
  
! Within the body of `T::fn', THIS has the effective definition `T
  *__restrict__ const this'.  Notice that the interpretation of a
! `__restrict__' member function qualifier is different to that of
! `const' or `volatile' qualifier, in that it is applied to the pointer
! rather than the object.  This is consistent with other compilers that
! implement restricted pointers.
  
!  As with all outermost parameter qualifiers, `__restrict__' is ignored
  in function definition matching.  This means you only need to specify
! `__restrict__' in a function definition, rather than in a function
  prototype as well.
  
  
--- 41719,41745 ----
         /* ... */
       }
  
! In the body of 'fn', RPTR points to an unaliased integer and RREF refers
! to a (different) unaliased integer.
  
   You may also specify whether a member function's THIS pointer is
! unaliased by using '__restrict__' as a member function qualifier.
  
       void T::fn () __restrict__
       {
         /* ... */
       }
  
! Within the body of 'T::fn', THIS has the effective definition 'T
  *__restrict__ const this'.  Notice that the interpretation of a
! '__restrict__' member function qualifier is different to that of 'const'
! or 'volatile' qualifier, in that it is applied to the pointer rather
! than the object.  This is consistent with other compilers that implement
! restricted pointers.
  
!  As with all outermost parameter qualifiers, '__restrict__' is ignored
  in function definition matching.  This means you only need to specify
! '__restrict__' in a function definition, rather than in a function
  prototype as well.
  
  
*************** clever.
*** 42135,42150 ****
  Inline Functions
       Inline functions are typically defined in a header file which can
       be included in many different compilations.  Hopefully they can
!      usually be inlined, but sometimes an out-of-line copy is
!      necessary, if the address of the function is taken or if inlining
!      fails.  In general, we emit an out-of-line copy in all translation
!      units where one is needed.  As an exception, we only emit inline
!      virtual functions with the vtable, since it always requires a copy.
  
       Local static variables and string constants used in an inline
!      function are also considered to have vague linkage, since they
!      must be shared between all inlined and out-of-line instances of
!      the function.
  
  VTables
       C++ virtual functions are implemented in most compilers using a
--- 41757,41772 ----
  Inline Functions
       Inline functions are typically defined in a header file which can
       be included in many different compilations.  Hopefully they can
!      usually be inlined, but sometimes an out-of-line copy is necessary,
!      if the address of the function is taken or if inlining fails.  In
!      general, we emit an out-of-line copy in all translation units where
!      one is needed.  As an exception, we only emit inline virtual
!      functions with the vtable, since it always requires a copy.
  
       Local static variables and string constants used in an inline
!      function are also considered to have vague linkage, since they must
!      be shared between all inlined and out-of-line instances of the
!      function.
  
  VTables
       C++ virtual functions are implemented in most compilers using a
*************** VTables
*** 42161,42182 ****
       Make sure that any inline virtuals are declared inline in the class
       body, even if they are not defined there.
  
! `type_info' objects
       C++ requires information about types to be written out in order to
!      implement `dynamic_cast', `typeid' and exception handling.  For
       polymorphic classes (classes with virtual functions), the
!      `type_info' object is written out along with the vtable so that
!      `dynamic_cast' can determine the dynamic type of a class object at
!      run time.  For all other types, we write out the `type_info'
!      object when it is used: when applying `typeid' to an expression,
!      throwing an object, or referring to a type in a catch clause or
!      exception specification.
  
  Template Instantiations
       Most everything in this section also applies to template
!      instantiations, but there are other options as well.  *Note
!      Where's the Template?: Template Instantiation.
! 
  
   When used with GNU ld version 2.8 or later on an ELF system such as
  GNU/Linux or Solaris 2, or on Microsoft Windows, duplicate copies of
--- 41783,41803 ----
       Make sure that any inline virtuals are declared inline in the class
       body, even if they are not defined there.
  
! 'type_info' objects
       C++ requires information about types to be written out in order to
!      implement 'dynamic_cast', 'typeid' and exception handling.  For
       polymorphic classes (classes with virtual functions), the
!      'type_info' object is written out along with the vtable so that
!      'dynamic_cast' can determine the dynamic type of a class object at
!      run time.  For all other types, we write out the 'type_info' object
!      when it is used: when applying 'typeid' to an expression, throwing
!      an object, or referring to a type in a catch clause or exception
!      specification.
  
  Template Instantiations
       Most everything in this section also applies to template
!      instantiations, but there are other options as well.  *Note Where's
!      the Template?: Template Instantiation.
  
   When used with GNU ld version 2.8 or later on an ELF system such as
  GNU/Linux or Solaris 2, or on Microsoft Windows, duplicate copies of
*************** File: gcc.info,  Node: C++ Interface,  N
*** 42202,42279 ****
  7.4 C++ Interface and Implementation Pragmas
  ============================================
  
! `#pragma interface' and `#pragma implementation' provide the user with
! a way of explicitly directing the compiler to emit entities with vague
  linkage (and debugging information) in a particular translation unit.
  
!  _Note:_ These `#pragma's have been superceded as of GCC 2.7.2 by
! COMDAT support and the "key method" heuristic mentioned in *note Vague
  Linkage::.  Using them can actually cause your program to grow due to
  unnecessary out-of-line copies of inline functions.
  
! `#pragma interface'
! `#pragma interface "SUBDIR/OBJECTS.h"'
!      Use this directive in _header files_ that define object classes,
!      to save space in most of the object files that use those classes.
       Normally, local copies of certain information (backup copies of
       inline member functions, debugging information, and the internal
       tables that implement virtual functions) must be kept in each
       object file that includes class definitions.  You can use this
       pragma to avoid such duplication.  When a header file containing
!      `#pragma interface' is included in a compilation, this auxiliary
       information is not generated (unless the main input source file
!      itself uses `#pragma implementation').  Instead, the object files
       contain references to be resolved at link time.
  
       The second form of this directive is useful for the case where you
       have multiple headers with the same name in different directories.
!      If you use this form, you must specify the same string to `#pragma
       implementation'.
  
! `#pragma implementation'
! `#pragma implementation "OBJECTS.h"'
       Use this pragma in a _main input file_, when you want full output
       from included header files to be generated (and made globally
!      visible).  The included header file, in turn, should use `#pragma
       interface'.  Backup copies of inline member functions, debugging
       information, and the internal tables used to implement virtual
       functions are all generated in implementation files.
  
!      If you use `#pragma implementation' with no argument, it applies to
!      an include file with the same basename(1) as your source file.
!      For example, in `allclass.cc', giving just `#pragma implementation'
!      by itself is equivalent to `#pragma implementation "allclass.h"'.
  
       Use the string argument if you want a single implementation file to
       include code from multiple header files.  (You must also use
!      `#include' to include the header file; `#pragma implementation'
       only specifies how to use the file--it doesn't actually include
       it.)
  
       There is no way to split up the contents of a single header file
       into multiple implementation files.
  
!  `#pragma implementation' and `#pragma interface' also have an effect
! on function inlining.
  
!  If you define a class in a header file marked with `#pragma
! interface', the effect on an inline function defined in that class is
! similar to an explicit `extern' declaration--the compiler emits no code
! at all to define an independent version of the function.  Its
! definition is used only for inlining with its callers.
  
   Conversely, when you include the same header file in a main source file
! that declares it as `#pragma implementation', the compiler emits code
! for the function itself; this defines a version of the function that
! can be found via pointers (or by callers compiled without inlining).
! If all calls to the function can be inlined, you can avoid emitting the
! function by compiling with `-fno-implement-inlines'.  If any calls are
  not inlined, you will get linker errors.
  
!  ---------- Footnotes ----------
  
!  (1) A file's "basename" is the name stripped of all leading path
! information and of trailing suffixes, such as `.h' or `.C' or `.cc'.
  
  
  File: gcc.info,  Node: Template Instantiation,  Next: Bound member functions,  Prev: C++ Interface,  Up: C++ Extensions
--- 41823,41900 ----
  7.4 C++ Interface and Implementation Pragmas
  ============================================
  
! '#pragma interface' and '#pragma implementation' provide the user with a
! way of explicitly directing the compiler to emit entities with vague
  linkage (and debugging information) in a particular translation unit.
  
!  _Note:_ These '#pragma's have been superceded as of GCC 2.7.2 by COMDAT
! support and the "key method" heuristic mentioned in *note Vague
  Linkage::.  Using them can actually cause your program to grow due to
  unnecessary out-of-line copies of inline functions.
  
! '#pragma interface'
! '#pragma interface "SUBDIR/OBJECTS.h"'
!      Use this directive in _header files_ that define object classes, to
!      save space in most of the object files that use those classes.
       Normally, local copies of certain information (backup copies of
       inline member functions, debugging information, and the internal
       tables that implement virtual functions) must be kept in each
       object file that includes class definitions.  You can use this
       pragma to avoid such duplication.  When a header file containing
!      '#pragma interface' is included in a compilation, this auxiliary
       information is not generated (unless the main input source file
!      itself uses '#pragma implementation').  Instead, the object files
       contain references to be resolved at link time.
  
       The second form of this directive is useful for the case where you
       have multiple headers with the same name in different directories.
!      If you use this form, you must specify the same string to '#pragma
       implementation'.
  
! '#pragma implementation'
! '#pragma implementation "OBJECTS.h"'
       Use this pragma in a _main input file_, when you want full output
       from included header files to be generated (and made globally
!      visible).  The included header file, in turn, should use '#pragma
       interface'.  Backup copies of inline member functions, debugging
       information, and the internal tables used to implement virtual
       functions are all generated in implementation files.
  
!      If you use '#pragma implementation' with no argument, it applies to
!      an include file with the same basename(1) as your source file.  For
!      example, in 'allclass.cc', giving just '#pragma implementation' by
!      itself is equivalent to '#pragma implementation "allclass.h"'.
  
       Use the string argument if you want a single implementation file to
       include code from multiple header files.  (You must also use
!      '#include' to include the header file; '#pragma implementation'
       only specifies how to use the file--it doesn't actually include
       it.)
  
       There is no way to split up the contents of a single header file
       into multiple implementation files.
  
!  '#pragma implementation' and '#pragma interface' also have an effect on
! function inlining.
  
!  If you define a class in a header file marked with '#pragma interface',
! the effect on an inline function defined in that class is similar to an
! explicit 'extern' declaration--the compiler emits no code at all to
! define an independent version of the function.  Its definition is used
! only for inlining with its callers.
  
   Conversely, when you include the same header file in a main source file
! that declares it as '#pragma implementation', the compiler emits code
! for the function itself; this defines a version of the function that can
! be found via pointers (or by callers compiled without inlining).  If all
! calls to the function can be inlined, you can avoid emitting the
! function by compiling with '-fno-implement-inlines'.  If any calls are
  not inlined, you will get linker errors.
  
!    ---------- Footnotes ----------
  
!    (1) A file's "basename" is the name stripped of all leading path
! information and of trailing suffixes, such as '.h' or '.C' or '.cc'.
  
  
  File: gcc.info,  Node: Template Instantiation,  Next: Bound member functions,  Prev: C++ Interface,  Up: C++ Extensions
*************** problem, which are referred to as the Bo
*** 42290,42297 ****
  model.
  
  Borland model
!      Borland C++ solved the template instantiation problem by adding
!      the code equivalent of common blocks to their linker; the compiler
       emits template instances in each translation unit that uses them,
       and the linker collapses them together.  The advantage of this
       model is that the linker only has to consider the object files
--- 41911,41918 ----
  model.
  
  Borland model
!      Borland C++ solved the template instantiation problem by adding the
!      code equivalent of common blocks to their linker; the compiler
       emits template instances in each translation unit that uses them,
       and the linker collapses them together.  The advantage of this
       model is that the linker only has to consider the object files
*************** Borland model
*** 42304,42325 ****
  Cfront model
       The AT&T C++ translator, Cfront, solved the template instantiation
       problem by creating the notion of a template repository, an
!      automatically maintained place where template instances are
!      stored.  A more modern version of the repository works as follows:
!      As individual object files are built, the compiler places any
!      template definitions and instantiations encountered in the
!      repository.  At link time, the link wrapper adds in the objects in
!      the repository and compiles any needed instances that were not
!      previously emitted.  The advantages of this model are more optimal
!      compilation speed and the ability to use the system linker; to
!      implement the Borland model a compiler vendor also needs to
!      replace the linker.  The disadvantages are vastly increased
!      complexity, and thus potential for error; for some code this can be
!      just as transparent, but in practice it can been very difficult to
!      build multiple programs in one directory and one program in
!      multiple directories.  Code written for this model tends to
!      separate definitions of non-inline member templates into a
!      separate file, which should be compiled separately.
  
   When used with GNU ld version 2.8 or later on an ELF system such as
  GNU/Linux or Solaris 2, or on Microsoft Windows, G++ supports the
--- 41925,41946 ----
  Cfront model
       The AT&T C++ translator, Cfront, solved the template instantiation
       problem by creating the notion of a template repository, an
!      automatically maintained place where template instances are stored.
!      A more modern version of the repository works as follows: As
!      individual object files are built, the compiler places any template
!      definitions and instantiations encountered in the repository.  At
!      link time, the link wrapper adds in the objects in the repository
!      and compiles any needed instances that were not previously emitted.
!      The advantages of this model are more optimal compilation speed and
!      the ability to use the system linker; to implement the Borland
!      model a compiler vendor also needs to replace the linker.  The
!      disadvantages are vastly increased complexity, and thus potential
!      for error; for some code this can be just as transparent, but in
!      practice it can been very difficult to build multiple programs in
!      one directory and one program in multiple directories.  Code
!      written for this model tends to separate definitions of non-inline
!      member templates into a separate file, which should be compiled
!      separately.
  
   When used with GNU ld version 2.8 or later on an ELF system such as
  GNU/Linux or Solaris 2, or on Microsoft Windows, G++ supports the
*************** model.
*** 42329,42359 ****
   You have the following options for dealing with template
  instantiations:
  
!   1. Compile your template-using code with `-frepo'.  The compiler
!      generates files with the extension `.rpo' listing all of the
       template instantiations used in the corresponding object files that
!      could be instantiated there; the link wrapper, `collect2', then
!      updates the `.rpo' files to tell the compiler where to place those
       instantiations and rebuild any affected object files.  The
       link-time overhead is negligible after the first pass, as the
       compiler continues to place the instantiations in the same files.
  
       This is your best option for application code written for the
       Borland model, as it just works.  Code written for the Cfront model
!      needs to be modified so that the template definitions are
!      available at one or more points of instantiation; usually this is
!      as simple as adding `#include <tmethods.cc>' to the end of each
!      template header.
  
       For library code, if you want the library to provide all of the
       template instantiations it needs, just try to link all of its
       object files together; the link will fail, but cause the
       instantiations to be generated as a side effect.  Be warned,
!      however, that this may cause conflicts if multiple libraries try
!      to provide the same instantiations.  For greater control, use
!      explicit instantiation as described in the next option.
  
!   2. Compile your code with `-fno-implicit-templates' to disable the
       implicit generation of template instances, and explicitly
       instantiate all the ones you use.  This approach requires more
       knowledge of exactly which instances you need than do the others,
--- 41950,41980 ----
   You have the following options for dealing with template
  instantiations:
  
!   1. Compile your template-using code with '-frepo'.  The compiler
!      generates files with the extension '.rpo' listing all of the
       template instantiations used in the corresponding object files that
!      could be instantiated there; the link wrapper, 'collect2', then
!      updates the '.rpo' files to tell the compiler where to place those
       instantiations and rebuild any affected object files.  The
       link-time overhead is negligible after the first pass, as the
       compiler continues to place the instantiations in the same files.
  
       This is your best option for application code written for the
       Borland model, as it just works.  Code written for the Cfront model
!      needs to be modified so that the template definitions are available
!      at one or more points of instantiation; usually this is as simple
!      as adding '#include <tmethods.cc>' to the end of each template
!      header.
  
       For library code, if you want the library to provide all of the
       template instantiations it needs, just try to link all of its
       object files together; the link will fail, but cause the
       instantiations to be generated as a side effect.  Be warned,
!      however, that this may cause conflicts if multiple libraries try to
!      provide the same instantiations.  For greater control, use explicit
!      instantiation as described in the next option.
  
!   2. Compile your code with '-fno-implicit-templates' to disable the
       implicit generation of template instances, and explicitly
       instantiate all the ones you use.  This approach requires more
       knowledge of exactly which instances you need than do the others,
*************** instantiations:
*** 42361,42368 ****
       scatter the explicit instantiations throughout your program,
       perhaps putting them in the translation units where the instances
       are used or the translation units that define the templates
!      themselves; you can put all of the explicit instantiations you
!      need into one big file; or you can create small files like
  
            #include "Foo.h"
            #include "Foo.cc"
--- 41982,41989 ----
       scatter the explicit instantiations throughout your program,
       perhaps putting them in the translation units where the instances
       are used or the translation units that define the templates
!      themselves; you can put all of the explicit instantiations you need
!      into one big file; or you can create small files like
  
            #include "Foo.h"
            #include "Foo.cc"
*************** instantiations:
*** 42375,42396 ****
       instantiation library from those.
  
       If you are using Cfront-model code, you can probably get away with
!      not using `-fno-implicit-templates' when compiling files that don't
!      `#include' the member template definitions.
  
       If you use one big file to do the instantiations, you may want to
!      compile it without `-fno-implicit-templates' so you get all of the
       instances required by your explicit instantiations (but not by any
       other files) without having to specify them as well.
  
       The ISO C++ 2011 standard allows forward declaration of explicit
!      instantiations (with `extern'). G++ supports explicit instantiation
!      declarations in C++98 mode and has extended the template
!      instantiation syntax to support instantiation of the compiler
!      support data for a template class (i.e. the vtable) without
!      instantiating any of its members (with `inline'), and
       instantiation of only the static data members of a template class,
!      without the support data or member functions (with `static'):
  
            extern template int max (int, int);
            inline template class Foo<int>;
--- 41996,42017 ----
       instantiation library from those.
  
       If you are using Cfront-model code, you can probably get away with
!      not using '-fno-implicit-templates' when compiling files that don't
!      '#include' the member template definitions.
  
       If you use one big file to do the instantiations, you may want to
!      compile it without '-fno-implicit-templates' so you get all of the
       instances required by your explicit instantiations (but not by any
       other files) without having to specify them as well.
  
       The ISO C++ 2011 standard allows forward declaration of explicit
!      instantiations (with 'extern').  G++ supports explicit
!      instantiation declarations in C++98 mode and has extended the
!      template instantiation syntax to support instantiation of the
!      compiler support data for a template class (i.e. the vtable)
!      without instantiating any of its members (with 'inline'), and
       instantiation of only the static data members of a template class,
!      without the support data or member functions (with 'static'):
  
            extern template int max (int, int);
            inline template class Foo<int>;
*************** File: gcc.info,  Node: Bound member func
*** 42410,42416 ****
  
  In C++, pointer to member functions (PMFs) are implemented using a wide
  pointer of sorts to handle all the possible call mechanisms; the PMF
! needs to store information about how to adjust the `this' pointer, and
  if the function pointed to is virtual, where to find the vtable, and
  where in the vtable to look for the member function.  If you are using
  PMFs in an inner loop, you should really reconsider that decision.  If
--- 42031,42037 ----
  
  In C++, pointer to member functions (PMFs) are implemented using a wide
  pointer of sorts to handle all the possible call mechanisms; the PMF
! needs to store information about how to adjust the 'this' pointer, and
  if the function pointed to is virtual, where to find the vtable, and
  where in the vtable to look for the member function.  If you are using
  PMFs in an inner loop, you should really reconsider that decision.  If
*************** function calls.
*** 42431,42443 ****
  
       fptr p = (fptr)(a.*fp);
  
!  For PMF constants (i.e. expressions of the form `&Klasse::Member'), no
  object is needed to obtain the address of the function.  They can be
  converted to function pointers directly:
  
       fptr p1 = (fptr)(&A::foo);
  
!  You must specify `-Wno-pmf-conversions' to use this extension.
  
  
  File: gcc.info,  Node: C++ Attributes,  Next: Function Multiversioning,  Prev: Bound member functions,  Up: C++ Extensions
--- 42052,42064 ----
  
       fptr p = (fptr)(a.*fp);
  
!  For PMF constants (i.e. expressions of the form '&Klasse::Member'), no
  object is needed to obtain the address of the function.  They can be
  converted to function pointers directly:
  
       fptr p1 = (fptr)(&A::foo);
  
!  You must specify '-Wno-pmf-conversions' to use this extension.
  
  
  File: gcc.info,  Node: C++ Attributes,  Next: Function Multiversioning,  Prev: Bound member functions,  Up: C++ Extensions
*************** File: gcc.info,  Node: C++ Attributes,
*** 42447,42463 ****
  
  Some attributes only make sense for C++ programs.
  
! `abi_tag ("TAG", ...)'
!      The `abi_tag' attribute can be applied to a function, variable, or
       class declaration.  It modifies the mangled name of the entity to
       incorporate the tag name, in order to distinguish the function or
       class from an earlier version with a different ABI; perhaps the
!      class has changed size, or the function has a different return
!      type that is not encoded in the mangled name.
  
       The attribute can also be applied to an inline namespace, but does
       not affect the mangled name of the namespace; in this case it is
!      only used for `-Wabi-tag' warnings and automatic tagging of
       functions and variables.  Tagging inline namespaces is generally
       preferable to tagging individual declarations, but the latter is
       sometimes necessary, such as when only certain members of a class
--- 42068,42084 ----
  
  Some attributes only make sense for C++ programs.
  
! 'abi_tag ("TAG", ...)'
!      The 'abi_tag' attribute can be applied to a function, variable, or
       class declaration.  It modifies the mangled name of the entity to
       incorporate the tag name, in order to distinguish the function or
       class from an earlier version with a different ABI; perhaps the
!      class has changed size, or the function has a different return type
!      that is not encoded in the mangled name.
  
       The attribute can also be applied to an inline namespace, but does
       not affect the mangled name of the namespace; in this case it is
!      only used for '-Wabi-tag' warnings and automatic tagging of
       functions and variables.  Tagging inline namespaces is generally
       preferable to tagging individual declarations, but the latter is
       sometimes necessary, such as when only certain members of a class
*************** Some attributes only make sense for C++
*** 42467,42506 ****
       strings are sorted on output, so the order of the list is
       unimportant.
  
!      A redeclaration of an entity must not add new ABI tags, since
!      doing so would change the mangled name.
  
       The ABI tags apply to a name, so all instantiations and
       specializations of a template have the same tags.  The attribute
       will be ignored if applied to an explicit specialization or
       instantiation.
  
!      The `-Wabi-tag' flag enables a warning about a class which does
!      not have all the ABI tags used by its subobjects and virtual
!      functions; for users with code that needs to coexist with an
!      earlier ABI, using this option can help to find all affected types
!      that need to be tagged.
  
       When a type involving an ABI tag is used as the type of a variable
       or return type of a function where that tag is not already present
       in the signature of the function, the tag is automatically applied
!      to the variable or function.  `-Wabi-tag' also warns about this
       situation; this warning can be avoided by explicitly tagging the
       variable or function or moving it into a tagged inline namespace.
  
! `init_priority (PRIORITY)'
       In Standard C++, objects defined at namespace scope are guaranteed
       to be initialized in an order in strict accordance with that of
       their definitions _in a given translation unit_.  No guarantee is
       made for initializations across translation units.  However, GNU
       C++ allows users to control the order of initialization of objects
!      defined at namespace scope with the `init_priority' attribute by
       specifying a relative PRIORITY, a constant integral expression
       currently bounded between 101 and 65535 inclusive.  Lower numbers
       indicate a higher priority.
  
!      In the following example, `A' would normally be created before
!      `B', but the `init_priority' attribute reverses that order:
  
            Some_Class  A  __attribute__ ((init_priority (2000)));
            Some_Class  B  __attribute__ ((init_priority (543)));
--- 42088,42128 ----
       strings are sorted on output, so the order of the list is
       unimportant.
  
!      A redeclaration of an entity must not add new ABI tags, since doing
!      so would change the mangled name.
  
       The ABI tags apply to a name, so all instantiations and
       specializations of a template have the same tags.  The attribute
       will be ignored if applied to an explicit specialization or
       instantiation.
  
!      The '-Wabi-tag' flag enables a warning about a class which does not
!      have all the ABI tags used by its subobjects and virtual functions;
!      for users with code that needs to coexist with an earlier ABI,
!      using this option can help to find all affected types that need to
!      be tagged.
  
       When a type involving an ABI tag is used as the type of a variable
       or return type of a function where that tag is not already present
       in the signature of the function, the tag is automatically applied
!      to the variable or function.  '-Wabi-tag' also warns about this
       situation; this warning can be avoided by explicitly tagging the
       variable or function or moving it into a tagged inline namespace.
  
! 'init_priority (PRIORITY)'
! 
       In Standard C++, objects defined at namespace scope are guaranteed
       to be initialized in an order in strict accordance with that of
       their definitions _in a given translation unit_.  No guarantee is
       made for initializations across translation units.  However, GNU
       C++ allows users to control the order of initialization of objects
!      defined at namespace scope with the 'init_priority' attribute by
       specifying a relative PRIORITY, a constant integral expression
       currently bounded between 101 and 65535 inclusive.  Lower numbers
       indicate a higher priority.
  
!      In the following example, 'A' would normally be created before 'B',
!      but the 'init_priority' attribute reverses that order:
  
            Some_Class  A  __attribute__ ((init_priority (2000)));
            Some_Class  B  __attribute__ ((init_priority (543)));
*************** Some attributes only make sense for C++
*** 42508,42535 ****
       Note that the particular values of PRIORITY do not matter; only
       their relative ordering.
  
! `java_interface'
!      This type attribute informs C++ that the class is a Java
!      interface.  It may only be applied to classes declared within an
!      `extern "Java"' block.  Calls to methods declared in this
!      interface are dispatched using GCJ's interface table mechanism,
!      instead of regular virtual table dispatch.
  
- `warn_unused'
       For C++ types with non-trivial constructors and/or destructors it
       is impossible for the compiler to determine whether a variable of
!      this type is truly unused if it is not referenced. This type
       attribute informs the compiler that variables of this type should
!      be warned about if they appear to be unused, just like variables
!      of fundamental types.
  
       This attribute is appropriate for types which just represent a
!      value, such as `std::string'; it is not appropriate for types which
!      control a resource, such as `std::mutex'.
! 
!      This attribute is also accepted in C, but it is unnecessary
!      because C does not have constructors or destructors.
  
  
   See also *note Namespace Association::.
  
--- 42130,42158 ----
       Note that the particular values of PRIORITY do not matter; only
       their relative ordering.
  
! 'java_interface'
! 
!      This type attribute informs C++ that the class is a Java interface.
!      It may only be applied to classes declared within an 'extern
!      "Java"' block.  Calls to methods declared in this interface are
!      dispatched using GCJ's interface table mechanism, instead of
!      regular virtual table dispatch.
! 
! 'warn_unused'
  
       For C++ types with non-trivial constructors and/or destructors it
       is impossible for the compiler to determine whether a variable of
!      this type is truly unused if it is not referenced.  This type
       attribute informs the compiler that variables of this type should
!      be warned about if they appear to be unused, just like variables of
!      fundamental types.
  
       This attribute is appropriate for types which just represent a
!      value, such as 'std::string'; it is not appropriate for types which
!      control a resource, such as 'std::mutex'.
  
+      This attribute is also accepted in C, but it is unnecessary because
+      C does not have constructors or destructors.
  
   See also *note Namespace Association::.
  
*************** the execution platform.  Here is an exam
*** 42580,42594 ****
         return 0;
       }
  
!  In the above example, four versions of function foo are created. The
  first version of foo with the target attribute "default" is the default
  version.  This version gets executed when no other target specific
! version qualifies for execution on a particular platform. A new version
  of foo is created by using the same function signature but with a
  different target string.  Function foo is called or a pointer to it is
  taken just like a regular function.  GCC takes care of doing the
! dispatching to call the right version at runtime.  Refer to the GCC
! wiki on Function Multiversioning
  (http://gcc.gnu.org/wiki/FunctionMultiVersioning) for more details.
  
  
--- 42203,42217 ----
         return 0;
       }
  
!  In the above example, four versions of function foo are created.  The
  first version of foo with the target attribute "default" is the default
  version.  This version gets executed when no other target specific
! version qualifies for execution on a particular platform.  A new version
  of foo is created by using the same function signature but with a
  different target string.  Function foo is called or a pointer to it is
  taken just like a regular function.  GCC takes care of doing the
! dispatching to call the right version at runtime.  Refer to the GCC wiki
! on Function Multiversioning
  (http://gcc.gnu.org/wiki/FunctionMultiVersioning) for more details.
  
  
*************** File: gcc.info,  Node: Namespace Associa
*** 42601,42607 ****
  inline namespaces.  Users should use inline namespaces instead as this
  extension will be removed in future versions of G++.
  
!  A using-directive with `__attribute ((strong))' is stronger than a
  normal using-directive in two ways:
  
     * Templates from the used namespace can be specialized and explicitly
--- 42224,42230 ----
  inline namespaces.  Users should use inline namespaces instead as this
  extension will be removed in future versions of G++.
  
!  A using-directive with '__attribute ((strong))' is stronger than a
  normal using-directive in two ways:
  
     * Templates from the used namespace can be specialized and explicitly
*************** The C++ front end implements syntactic e
*** 42643,42776 ****
  compile-time determination of various characteristics of a type (or of a
  pair of types).
  
! `__has_nothrow_assign (type)'
!      If `type' is const qualified or is a reference type then the trait
!      is false.  Otherwise if `__has_trivial_assign (type)' is true then
!      the trait is true, else if `type' is a cv class or union type with
       copy assignment operators that are known not to throw an exception
!      then the trait is true, else it is false.  Requires: `type' shall
!      be a complete type, (possibly cv-qualified) `void', or an array of
       unknown bound.
  
! `__has_nothrow_copy (type)'
!      If `__has_trivial_copy (type)' is true then the trait is true,
!      else if `type' is a cv class or union type with copy constructors
!      that are known not to throw an exception then the trait is true,
!      else it is false.  Requires: `type' shall be a complete type,
!      (possibly cv-qualified) `void', or an array of unknown bound.
  
! `__has_nothrow_constructor (type)'
!      If `__has_trivial_constructor (type)' is true then the trait is
!      true, else if `type' is a cv class or union type (or array
!      thereof) with a default constructor that is known not to throw an
!      exception then the trait is true, else it is false.  Requires:
!      `type' shall be a complete type, (possibly cv-qualified) `void',
!      or an array of unknown bound.
  
! `__has_trivial_assign (type)'
!      If `type' is const qualified or is a reference type then the trait
!      is false.  Otherwise if `__is_pod (type)' is true then the trait is
!      true, else if `type' is a cv class or union type with a trivial
       copy assignment ([class.copy]) then the trait is true, else it is
!      false.  Requires: `type' shall be a complete type, (possibly
!      cv-qualified) `void', or an array of unknown bound.
  
! `__has_trivial_copy (type)'
!      If `__is_pod (type)' is true or `type' is a reference type then
!      the trait is true, else if `type' is a cv class or union type with
!      a trivial copy constructor ([class.copy]) then the trait is true,
!      else it is false.  Requires: `type' shall be a complete type,
!      (possibly cv-qualified) `void', or an array of unknown bound.
  
! `__has_trivial_constructor (type)'
!      If `__is_pod (type)' is true then the trait is true, else if
!      `type' is a cv class or union type (or array thereof) with a
!      trivial default constructor ([class.ctor]) then the trait is true,
!      else it is false.  Requires: `type' shall be a complete type,
!      (possibly cv-qualified) `void', or an array of unknown bound.
  
! `__has_trivial_destructor (type)'
!      If `__is_pod (type)' is true or `type' is a reference type then
!      the trait is true, else if `type' is a cv class or union type (or
!      array thereof) with a trivial destructor ([class.dtor]) then the
!      trait is true, else it is false.  Requires: `type' shall be a
!      complete type, (possibly cv-qualified) `void', or an array of
!      unknown bound.
  
! `__has_virtual_destructor (type)'
!      If `type' is a class type with a virtual destructor ([class.dtor])
!      then the trait is true, else it is false.  Requires: `type' shall
!      be a complete type, (possibly cv-qualified) `void', or an array of
       unknown bound.
  
! `__is_abstract (type)'
!      If `type' is an abstract class ([class.abstract]) then the trait
!      is true, else it is false.  Requires: `type' shall be a complete
!      type, (possibly cv-qualified) `void', or an array of unknown bound.
  
! `__is_base_of (base_type, derived_type)'
!      If `base_type' is a base class of `derived_type' ([class.derived])
       then the trait is true, otherwise it is false.  Top-level cv
!      qualifications of `base_type' and `derived_type' are ignored.  For
!      the purposes of this trait, a class type is considered is own
!      base.  Requires: if `__is_class (base_type)' and `__is_class
!      (derived_type)' are true and `base_type' and `derived_type' are
!      not the same type (disregarding cv-qualifiers), `derived_type'
!      shall be a complete type.  Diagnostic is produced if this
!      requirement is not met.
  
! `__is_class (type)'
!      If `type' is a cv class type, and not a union type
       ([basic.compound]) the trait is true, else it is false.
  
! `__is_empty (type)'
!      If `__is_class (type)' is false then the trait is false.
!      Otherwise `type' is considered empty if and only if: `type' has no
!      non-static data members, or all non-static data members, if any,
!      are bit-fields of length 0, and `type' has no virtual members, and
!      `type' has no virtual base classes, and `type' has no base classes
!      `base_type' for which `__is_empty (base_type)' is false.
!      Requires: `type' shall be a complete type, (possibly cv-qualified)
!      `void', or an array of unknown bound.
  
! `__is_enum (type)'
!      If `type' is a cv enumeration type ([basic.compound]) the trait is
       true, else it is false.
  
! `__is_literal_type (type)'
!      If `type' is a literal type ([basic.types]) the trait is true,
!      else it is false.  Requires: `type' shall be a complete type,
!      (possibly cv-qualified) `void', or an array of unknown bound.
  
! `__is_pod (type)'
!      If `type' is a cv POD type ([basic.types]) then the trait is true,
!      else it is false.  Requires: `type' shall be a complete type,
!      (possibly cv-qualified) `void', or an array of unknown bound.
  
! `__is_polymorphic (type)'
!      If `type' is a polymorphic class ([class.virtual]) then the trait
!      is true, else it is false.  Requires: `type' shall be a complete
!      type, (possibly cv-qualified) `void', or an array of unknown bound.
  
! `__is_standard_layout (type)'
!      If `type' is a standard-layout type ([basic.types]) the trait is
!      true, else it is false.  Requires: `type' shall be a complete
!      type, (possibly cv-qualified) `void', or an array of unknown bound.
  
! `__is_trivial (type)'
!      If `type' is a trivial type ([basic.types]) the trait is true,
!      else it is false.  Requires: `type' shall be a complete type,
!      (possibly cv-qualified) `void', or an array of unknown bound.
  
! `__is_union (type)'
!      If `type' is a cv union type ([basic.compound]) the trait is true,
       else it is false.
  
! `__underlying_type (type)'
!      The underlying type of `type'.  Requires: `type' shall be an
       enumeration type ([dcl.enum]).
  
- 
  
  File: gcc.info,  Node: Java Exceptions,  Next: Deprecated Features,  Prev: Type Traits,  Up: C++ Extensions
  
--- 42266,42397 ----
  compile-time determination of various characteristics of a type (or of a
  pair of types).
  
! '__has_nothrow_assign (type)'
!      If 'type' is const qualified or is a reference type then the trait
!      is false.  Otherwise if '__has_trivial_assign (type)' is true then
!      the trait is true, else if 'type' is a cv class or union type with
       copy assignment operators that are known not to throw an exception
!      then the trait is true, else it is false.  Requires: 'type' shall
!      be a complete type, (possibly cv-qualified) 'void', or an array of
       unknown bound.
  
! '__has_nothrow_copy (type)'
!      If '__has_trivial_copy (type)' is true then the trait is true, else
!      if 'type' is a cv class or union type with copy constructors that
!      are known not to throw an exception then the trait is true, else it
!      is false.  Requires: 'type' shall be a complete type, (possibly
!      cv-qualified) 'void', or an array of unknown bound.
  
! '__has_nothrow_constructor (type)'
!      If '__has_trivial_constructor (type)' is true then the trait is
!      true, else if 'type' is a cv class or union type (or array thereof)
!      with a default constructor that is known not to throw an exception
!      then the trait is true, else it is false.  Requires: 'type' shall
!      be a complete type, (possibly cv-qualified) 'void', or an array of
!      unknown bound.
  
! '__has_trivial_assign (type)'
!      If 'type' is const qualified or is a reference type then the trait
!      is false.  Otherwise if '__is_pod (type)' is true then the trait is
!      true, else if 'type' is a cv class or union type with a trivial
       copy assignment ([class.copy]) then the trait is true, else it is
!      false.  Requires: 'type' shall be a complete type, (possibly
!      cv-qualified) 'void', or an array of unknown bound.
  
! '__has_trivial_copy (type)'
!      If '__is_pod (type)' is true or 'type' is a reference type then the
!      trait is true, else if 'type' is a cv class or union type with a
!      trivial copy constructor ([class.copy]) then the trait is true,
!      else it is false.  Requires: 'type' shall be a complete type,
!      (possibly cv-qualified) 'void', or an array of unknown bound.
  
! '__has_trivial_constructor (type)'
!      If '__is_pod (type)' is true then the trait is true, else if 'type'
!      is a cv class or union type (or array thereof) with a trivial
!      default constructor ([class.ctor]) then the trait is true, else it
!      is false.  Requires: 'type' shall be a complete type, (possibly
!      cv-qualified) 'void', or an array of unknown bound.
  
! '__has_trivial_destructor (type)'
!      If '__is_pod (type)' is true or 'type' is a reference type then the
!      trait is true, else if 'type' is a cv class or union type (or array
!      thereof) with a trivial destructor ([class.dtor]) then the trait is
!      true, else it is false.  Requires: 'type' shall be a complete type,
!      (possibly cv-qualified) 'void', or an array of unknown bound.
  
! '__has_virtual_destructor (type)'
!      If 'type' is a class type with a virtual destructor ([class.dtor])
!      then the trait is true, else it is false.  Requires: 'type' shall
!      be a complete type, (possibly cv-qualified) 'void', or an array of
       unknown bound.
  
! '__is_abstract (type)'
!      If 'type' is an abstract class ([class.abstract]) then the trait is
!      true, else it is false.  Requires: 'type' shall be a complete type,
!      (possibly cv-qualified) 'void', or an array of unknown bound.
  
! '__is_base_of (base_type, derived_type)'
!      If 'base_type' is a base class of 'derived_type' ([class.derived])
       then the trait is true, otherwise it is false.  Top-level cv
!      qualifications of 'base_type' and 'derived_type' are ignored.  For
!      the purposes of this trait, a class type is considered is own base.
!      Requires: if '__is_class (base_type)' and '__is_class
!      (derived_type)' are true and 'base_type' and 'derived_type' are not
!      the same type (disregarding cv-qualifiers), 'derived_type' shall be
!      a complete type.  Diagnostic is produced if this requirement is not
!      met.
  
! '__is_class (type)'
!      If 'type' is a cv class type, and not a union type
       ([basic.compound]) the trait is true, else it is false.
  
! '__is_empty (type)'
!      If '__is_class (type)' is false then the trait is false.  Otherwise
!      'type' is considered empty if and only if: 'type' has no non-static
!      data members, or all non-static data members, if any, are
!      bit-fields of length 0, and 'type' has no virtual members, and
!      'type' has no virtual base classes, and 'type' has no base classes
!      'base_type' for which '__is_empty (base_type)' is false.  Requires:
!      'type' shall be a complete type, (possibly cv-qualified) 'void', or
!      an array of unknown bound.
  
! '__is_enum (type)'
!      If 'type' is a cv enumeration type ([basic.compound]) the trait is
       true, else it is false.
  
! '__is_literal_type (type)'
!      If 'type' is a literal type ([basic.types]) the trait is true, else
!      it is false.  Requires: 'type' shall be a complete type, (possibly
!      cv-qualified) 'void', or an array of unknown bound.
  
! '__is_pod (type)'
!      If 'type' is a cv POD type ([basic.types]) then the trait is true,
!      else it is false.  Requires: 'type' shall be a complete type,
!      (possibly cv-qualified) 'void', or an array of unknown bound.
  
! '__is_polymorphic (type)'
!      If 'type' is a polymorphic class ([class.virtual]) then the trait
!      is true, else it is false.  Requires: 'type' shall be a complete
!      type, (possibly cv-qualified) 'void', or an array of unknown bound.
  
! '__is_standard_layout (type)'
!      If 'type' is a standard-layout type ([basic.types]) the trait is
!      true, else it is false.  Requires: 'type' shall be a complete type,
!      (possibly cv-qualified) 'void', or an array of unknown bound.
  
! '__is_trivial (type)'
!      If 'type' is a trivial type ([basic.types]) the trait is true, else
!      it is false.  Requires: 'type' shall be a complete type, (possibly
!      cv-qualified) 'void', or an array of unknown bound.
  
! '__is_union (type)'
!      If 'type' is a cv union type ([basic.compound]) the trait is true,
       else it is false.
  
! '__underlying_type (type)'
!      The underlying type of 'type'.  Requires: 'type' shall be an
       enumeration type ([dcl.enum]).
  
  
  File: gcc.info,  Node: Java Exceptions,  Next: Deprecated Features,  Prev: Type Traits,  Up: C++ Extensions
  
*************** problematic code is:
*** 42793,42803 ****
         }
  
  The usual effect of an incorrect guess is a link failure, complaining of
! a missing routine called `__gxx_personality_v0'.
  
   You can inform the compiler that Java exceptions are to be used in a
  translation unit, irrespective of what it might think, by writing
! `#pragma GCC java_exceptions' at the head of the file.  This `#pragma'
  must appear before any functions that throw or catch exceptions, or run
  destructors when exceptions are thrown through them.
  
--- 42414,42424 ----
         }
  
  The usual effect of an incorrect guess is a link failure, complaining of
! a missing routine called '__gxx_personality_v0'.
  
   You can inform the compiler that Java exceptions are to be used in a
  translation unit, irrespective of what it might think, by writing
! '#pragma GCC java_exceptions' at the head of the file.  This '#pragma'
  must appear before any functions that throw or catch exceptions, or run
  destructors when exceptions are thrown through them.
  
*************** cases, the feature might be gone already
*** 42822,42852 ****
   While the list below is not exhaustive, it documents some of the
  options that are now deprecated:
  
! `-fexternal-templates'
! `-falt-external-templates'
       These are two of the many ways for G++ to implement template
       instantiation.  *Note Template Instantiation::.  The C++ standard
       clearly defines how template definitions have to be organized
       across implementation units.  G++ has an implicit instantiation
       mechanism that should work just fine for standard-conforming code.
  
! `-fstrict-prototype'
! `-fno-strict-prototype'
!      Previously it was possible to use an empty prototype parameter
!      list to indicate an unspecified number of parameters (like C),
!      rather than no parameters, as C++ demands.  This feature has been
!      removed, except where it is required for backwards compatibility.
!      *Note Backwards Compatibility::.
  
!  G++ allows a virtual function returning `void *' to be overridden by
! one returning a different pointer type.  This extension to the
! covariant return type rules is now deprecated and will be removed from a
! future version.
  
!  The G++ minimum and maximum operators (`<?' and `>?') and their
! compound forms (`<?=') and `>?=') have been deprecated and are now
  removed from G++.  Code using these operators should be modified to use
! `std::min' and `std::max' instead.
  
   The named return value extension has been deprecated, and is now
  removed from G++.
--- 42443,42473 ----
   While the list below is not exhaustive, it documents some of the
  options that are now deprecated:
  
! '-fexternal-templates'
! '-falt-external-templates'
       These are two of the many ways for G++ to implement template
       instantiation.  *Note Template Instantiation::.  The C++ standard
       clearly defines how template definitions have to be organized
       across implementation units.  G++ has an implicit instantiation
       mechanism that should work just fine for standard-conforming code.
  
! '-fstrict-prototype'
! '-fno-strict-prototype'
!      Previously it was possible to use an empty prototype parameter list
!      to indicate an unspecified number of parameters (like C), rather
!      than no parameters, as C++ demands.  This feature has been removed,
!      except where it is required for backwards compatibility.  *Note
!      Backwards Compatibility::.
  
!  G++ allows a virtual function returning 'void *' to be overridden by
! one returning a different pointer type.  This extension to the covariant
! return type rules is now deprecated and will be removed from a future
! version.
  
!  The G++ minimum and maximum operators ('<?' and '>?') and their
! compound forms ('<?=') and '>?=') have been deprecated and are now
  removed from G++.  Code using these operators should be modified to use
! 'std::min' and 'std::max' instead.
  
   The named return value extension has been deprecated, and is now
  removed from G++.
*************** and other places where they are not perm
*** 42865,42875 ****
  deprecated and will be removed from a future version of G++.
  
   G++ allows floating-point literals to appear in integral constant
! expressions, e.g. ` enum E { e = int(2.2 * 3.7) } ' This extension is
  deprecated and will be removed from a future version.
  
   G++ allows static data members of const floating-point type to be
! declared with an initializer in a class definition. The standard only
  allows initializers for static members of const integral types and const
  enumeration types so this extension has been deprecated and will be
  removed from a future version.
--- 42486,42496 ----
  deprecated and will be removed from a future version of G++.
  
   G++ allows floating-point literals to appear in integral constant
! expressions, e.g. ' enum E { e = int(2.2 * 3.7) } ' This extension is
  deprecated and will be removed from a future version.
  
   G++ allows static data members of const floating-point type to be
! declared with an initializer in a class definition.  The standard only
  allows initializers for static members of const integral types and const
  enumeration types so this extension has been deprecated and will be
  removed from a future version.
*************** used to be acceptable in previous drafts
*** 42886,42906 ****
  ARM [Annotated C++ Reference Manual], are no longer accepted.  In order
  to allow compilation of C++ written to such drafts, G++ contains some
  backwards compatibilities.  _All such backwards compatibility features
! are liable to disappear in future versions of G++._ They should be
! considered deprecated.   *Note Deprecated Features::.
  
! `For scope'
       If a variable is declared at for scope, it used to remain in scope
!      until the end of the scope that contained the for statement
!      (rather than just within the for scope).  G++ retains this, but
!      issues a warning, if such a variable is accessed outside the for
!      scope.
  
! `Implicit C language'
!      Old C system header files did not contain an `extern "C" {...}'
       scope to set the language.  On such systems, all header files are
       implicitly scoped inside a C language scope.  Also, an empty
!      prototype `()' is treated as an unspecified number of arguments,
       rather than no arguments, as C++ demands.
  
  
--- 42507,42526 ----
  ARM [Annotated C++ Reference Manual], are no longer accepted.  In order
  to allow compilation of C++ written to such drafts, G++ contains some
  backwards compatibilities.  _All such backwards compatibility features
! are liable to disappear in future versions of G++._  They should be
! considered deprecated.  *Note Deprecated Features::.
  
! 'For scope'
       If a variable is declared at for scope, it used to remain in scope
!      until the end of the scope that contained the for statement (rather
!      than just within the for scope).  G++ retains this, but issues a
!      warning, if such a variable is accessed outside the for scope.
  
! 'Implicit C language'
!      Old C system header files did not contain an 'extern "C" {...}'
       scope to set the language.  On such systems, all header files are
       implicitly scoped inside a C language scope.  Also, an empty
!      prototype '()' is treated as an unspecified number of arguments,
       rather than no arguments, as C++ demands.
  
  
*************** File: gcc.info,  Node: Objective-C,  Nex
*** 42909,42917 ****
  8 GNU Objective-C Features
  **************************
  
! This document is meant to describe some of the GNU Objective-C
! features.  It is not intended to teach you Objective-C.  There are
! several resources on the Internet that present the language.
  
  * Menu:
  
--- 42529,42537 ----
  8 GNU Objective-C Features
  **************************
  
! This document is meant to describe some of the GNU Objective-C features.
! It is not intended to teach you Objective-C. There are several resources
! on the Internet that present the language.
  
  * Menu:
  
*************** File: gcc.info,  Node: GNU Objective-C r
*** 42935,42942 ****
  This section is specific for the GNU Objective-C runtime.  If you are
  using a different runtime, you can skip it.
  
!  The GNU Objective-C runtime provides an API that allows you to
! interact with the Objective-C runtime system, querying the live runtime
  structures and even manipulating them.  This allows you for example to
  inspect and navigate classes, methods and protocols; to define new
  classes or new methods, and even to modify existing classes or
--- 42555,42562 ----
  This section is specific for the GNU Objective-C runtime.  If you are
  using a different runtime, you can skip it.
  
!  The GNU Objective-C runtime provides an API that allows you to interact
! with the Objective-C runtime system, querying the live runtime
  structures and even manipulating them.  This allows you for example to
  inspect and navigate classes, methods and protocols; to define new
  classes or new methods, and even to modify existing classes or
*************** provided by the "Objective-C 2.0" Apple/
*** 42963,43005 ****
  API is documented in the public header files of the GNU Objective-C
  runtime:
  
!    * `objc/objc.h': this is the basic Objective-C header file, defining
!      the basic Objective-C types such as `id', `Class' and `BOOL'.  You
       have to include this header to do almost anything with Objective-C.
  
!    * `objc/runtime.h': this header declares most of the public runtime
       API functions allowing you to inspect and manipulate the
       Objective-C runtime data structures.  These functions are fairly
       standardized across Objective-C runtimes and are almost identical
       to the Apple/NeXT Objective-C runtime ones.  It does not declare
       functions in some specialized areas (constructing and forwarding
       message invocations, threading) which are in the other headers
!      below.  You have to include `objc/objc.h' and `objc/runtime.h' to
!      use any of the functions, such as `class_getName()', declared in
!      `objc/runtime.h'.
  
!    * `objc/message.h': this header declares public functions used to
       construct, deconstruct and forward message invocations.  Because
       messaging is done in quite a different way on different runtimes,
       functions in this header are specific to the GNU Objective-C
       runtime implementation.
  
!    * `objc/objc-exception.h': this header declares some public
!      functions related to Objective-C exceptions.  For example
!      functions in this header allow you to throw an Objective-C
!      exception from plain C/C++ code.
  
!    * `objc/objc-sync.h': this header declares some public functions
!      related to the Objective-C `@synchronized()' syntax, allowing you
!      to emulate an Objective-C `@synchronized()' block in plain C/C++
       code.
  
!    * `objc/thr.h': this header declares a public runtime API threading
       layer that is only provided by the GNU Objective-C runtime.  It
!      declares functions such as `objc_mutex_lock()', which provide a
       platform-independent set of threading functions.
  
- 
   The header files contain detailed documentation for each function in
  the GNU Objective-C runtime API.
  
--- 42583,42624 ----
  API is documented in the public header files of the GNU Objective-C
  runtime:
  
!    * 'objc/objc.h': this is the basic Objective-C header file, defining
!      the basic Objective-C types such as 'id', 'Class' and 'BOOL'.  You
       have to include this header to do almost anything with Objective-C.
  
!    * 'objc/runtime.h': this header declares most of the public runtime
       API functions allowing you to inspect and manipulate the
       Objective-C runtime data structures.  These functions are fairly
       standardized across Objective-C runtimes and are almost identical
       to the Apple/NeXT Objective-C runtime ones.  It does not declare
       functions in some specialized areas (constructing and forwarding
       message invocations, threading) which are in the other headers
!      below.  You have to include 'objc/objc.h' and 'objc/runtime.h' to
!      use any of the functions, such as 'class_getName()', declared in
!      'objc/runtime.h'.
  
!    * 'objc/message.h': this header declares public functions used to
       construct, deconstruct and forward message invocations.  Because
       messaging is done in quite a different way on different runtimes,
       functions in this header are specific to the GNU Objective-C
       runtime implementation.
  
!    * 'objc/objc-exception.h': this header declares some public functions
!      related to Objective-C exceptions.  For example functions in this
!      header allow you to throw an Objective-C exception from plain C/C++
!      code.
  
!    * 'objc/objc-sync.h': this header declares some public functions
!      related to the Objective-C '@synchronized()' syntax, allowing you
!      to emulate an Objective-C '@synchronized()' block in plain C/C++
       code.
  
!    * 'objc/thr.h': this header declares a public runtime API threading
       layer that is only provided by the GNU Objective-C runtime.  It
!      declares functions such as 'objc_mutex_lock()', which provide a
       platform-independent set of threading functions.
  
   The header files contain detailed documentation for each function in
  the GNU Objective-C runtime API.
  
*************** File: gcc.info,  Node: Traditional GNU O
*** 43010,43021 ****
  ---------------------------------------------
  
  The GNU Objective-C runtime used to provide a different API, which we
! call the "traditional" GNU Objective-C runtime API.  Functions
! belonging to this API are easy to recognize because they use a
! different naming convention, such as `class_get_super_class()'
! (traditional API) instead of `class_getSuperclass()' (modern API).
! Software using this API includes the file `objc/objc-api.h' where it is
! declared.
  
   Starting with GCC 4.7.0, the traditional GNU runtime API is no longer
  available.
--- 42629,42639 ----
  ---------------------------------------------
  
  The GNU Objective-C runtime used to provide a different API, which we
! call the "traditional" GNU Objective-C runtime API. Functions belonging
! to this API are easy to recognize because they use a different naming
! convention, such as 'class_get_super_class()' (traditional API) instead
! of 'class_getSuperclass()' (modern API). Software using this API
! includes the file 'objc/objc-api.h' where it is declared.
  
   Starting with GCC 4.7.0, the traditional GNU runtime API is no longer
  available.
*************** available.
*** 43023,43048 ****
  
  File: gcc.info,  Node: Executing code before main,  Next: Type encoding,  Prev: GNU Objective-C runtime API,  Up: Objective-C
  
! 8.2 `+load': Executing Code before `main'
  =========================================
  
  This section is specific for the GNU Objective-C runtime.  If you are
  using a different runtime, you can skip it.
  
   The GNU Objective-C runtime provides a way that allows you to execute
! code before the execution of the program enters the `main' function.
  The code is executed on a per-class and a per-category basis, through a
! special class method `+load'.
  
   This facility is very useful if you want to initialize global variables
  which can be accessed by the program directly, without sending a message
  to the class first.  The usual way to initialize global variables, in
! the `+initialize' method, might not be useful because `+initialize' is
  only called when the first message is sent to a class object, which in
  some cases could be too late.
  
!  Suppose for example you have a `FileStream' class that declares
! `Stdin', `Stdout' and `Stderr' as global variables, like below:
  
  
       FileStream *Stdin = nil;
--- 42641,42666 ----
  
  File: gcc.info,  Node: Executing code before main,  Next: Type encoding,  Prev: GNU Objective-C runtime API,  Up: Objective-C
  
! 8.2 '+load': Executing Code before 'main'
  =========================================
  
  This section is specific for the GNU Objective-C runtime.  If you are
  using a different runtime, you can skip it.
  
   The GNU Objective-C runtime provides a way that allows you to execute
! code before the execution of the program enters the 'main' function.
  The code is executed on a per-class and a per-category basis, through a
! special class method '+load'.
  
   This facility is very useful if you want to initialize global variables
  which can be accessed by the program directly, without sending a message
  to the class first.  The usual way to initialize global variables, in
! the '+initialize' method, might not be useful because '+initialize' is
  only called when the first message is sent to a class object, which in
  some cases could be too late.
  
!  Suppose for example you have a 'FileStream' class that declares
! 'Stdin', 'Stdout' and 'Stderr' as global variables, like below:
  
  
       FileStream *Stdin = nil;
*************** some cases could be too late.
*** 43061,43076 ****
       /* Other methods here */
       @end
  
-  In this example, the initialization of `Stdin', `Stdout' and `Stderr'
- in `+initialize' occurs too late.  The programmer can send a message to
- one of these objects before the variables are actually initialized,
- thus sending messages to the `nil' object.  The `+initialize' method
- which actually initializes the global variables is not invoked until
- the first message is sent to the class object.  The solution would
- require these variables to be initialized just before entering `main'.
  
!  The correct solution of the above problem is to use the `+load' method
! instead of `+initialize':
  
  
       @implementation FileStream
--- 42679,42695 ----
       /* Other methods here */
       @end
  
  
!  In this example, the initialization of 'Stdin', 'Stdout' and 'Stderr'
! in '+initialize' occurs too late.  The programmer can send a message to
! one of these objects before the variables are actually initialized, thus
! sending messages to the 'nil' object.  The '+initialize' method which
! actually initializes the global variables is not invoked until the first
! message is sent to the class object.  The solution would require these
! variables to be initialized just before entering 'main'.
! 
!  The correct solution of the above problem is to use the '+load' method
! instead of '+initialize':
  
  
       @implementation FileStream
*************** instead of `+initialize':
*** 43085,43098 ****
       /* Other methods here */
       @end
  
!  The `+load' is a method that is not overridden by categories.  If a
! class and a category of it both implement `+load', both methods are
  invoked.  This allows some additional initializations to be performed in
  a category.
  
!  This mechanism is not intended to be a replacement for `+initialize'.
! You should be aware of its limitations when you decide to use it
! instead of `+initialize'.
  
  * Menu:
  
--- 42704,42718 ----
       /* Other methods here */
       @end
  
! 
!  The '+load' is a method that is not overridden by categories.  If a
! class and a category of it both implement '+load', both methods are
  invoked.  This allows some additional initializations to be performed in
  a category.
  
!  This mechanism is not intended to be a replacement for '+initialize'.
! You should be aware of its limitations when you decide to use it instead
! of '+initialize'.
  
  * Menu:
  
*************** instead of `+initialize'.
*** 43101,43115 ****
  
  File: gcc.info,  Node: What you can and what you cannot do in +load,  Up: Executing code before main
  
! 8.2.1 What You Can and Cannot Do in `+load'
  -------------------------------------------
  
! `+load' is to be used only as a last resort.  Because it is executed
  very early, most of the Objective-C runtime machinery will not be ready
! when `+load' is executed; hence `+load' works best for executing C code
  that is independent on the Objective-C runtime.
  
!  The `+load' implementation in the GNU runtime guarantees you the
  following things:
  
     * you can write whatever C code you like;
--- 42721,42735 ----
  
  File: gcc.info,  Node: What you can and what you cannot do in +load,  Up: Executing code before main
  
! 8.2.1 What You Can and Cannot Do in '+load'
  -------------------------------------------
  
! '+load' is to be used only as a last resort.  Because it is executed
  very early, most of the Objective-C runtime machinery will not be ready
! when '+load' is executed; hence '+load' works best for executing C code
  that is independent on the Objective-C runtime.
  
!  The '+load' implementation in the GNU runtime guarantees you the
  following things:
  
     * you can write whatever C code you like;
*************** following things:
*** 43117,43128 ****
     * you can allocate and send messages to objects whose class is
       implemented in the same file;
  
!    * the `+load' implementation of all super classes of a class are
!      executed before the `+load' of that class is executed;
! 
!    * the `+load' implementation of a class is executed before the
!      `+load' implementation of any category.
  
  
   In particular, the following things, even if they can work in a
  particular case, are not guaranteed:
--- 42737,42747 ----
     * you can allocate and send messages to objects whose class is
       implemented in the same file;
  
!    * the '+load' implementation of all super classes of a class are
!      executed before the '+load' of that class is executed;
  
+    * the '+load' implementation of a class is executed before the
+      '+load' implementation of any category.
  
   In particular, the following things, even if they can work in a
  particular case, are not guaranteed:
*************** particular case, are not guaranteed:
*** 43132,43157 ****
     * allocation of or sending messages to objects whose classes have a
       category implemented in the same file;
  
!    * sending messages to Objective-C constant strings (`@"this is a
       constant string"');
  
  
!  You should make no assumptions about receiving `+load' in sibling
! classes when you write `+load' of a class.  The order in which sibling
! classes receive `+load' is not guaranteed.
! 
!  The order in which `+load' and `+initialize' are called could be
  problematic if this matters.  If you don't allocate objects inside
! `+load', it is guaranteed that `+load' is called before `+initialize'.
! If you create an object inside `+load' the `+initialize' method of
! object's class is invoked even if `+load' was not invoked.  Note if you
! explicitly call `+load' on a class, `+initialize' will be called first.
  To avoid possible problems try to implement only one of these methods.
  
!  The `+load' method is also invoked when a bundle is dynamically loaded
  into your running program.  This happens automatically without any
  intervening operation from you.  When you write bundles and you need to
! write `+load' you can safely create and send messages to objects whose
  classes already exist in the running program.  The same restrictions as
  above apply to classes defined in bundle.
  
--- 42751,42775 ----
     * allocation of or sending messages to objects whose classes have a
       category implemented in the same file;
  
!    * sending messages to Objective-C constant strings ('@"this is a
       constant string"');
  
+  You should make no assumptions about receiving '+load' in sibling
+ classes when you write '+load' of a class.  The order in which sibling
+ classes receive '+load' is not guaranteed.
  
!  The order in which '+load' and '+initialize' are called could be
  problematic if this matters.  If you don't allocate objects inside
! '+load', it is guaranteed that '+load' is called before '+initialize'.
! If you create an object inside '+load' the '+initialize' method of
! object's class is invoked even if '+load' was not invoked.  Note if you
! explicitly call '+load' on a class, '+initialize' will be called first.
  To avoid possible problems try to implement only one of these methods.
  
!  The '+load' method is also invoked when a bundle is dynamically loaded
  into your running program.  This happens automatically without any
  intervening operation from you.  When you write bundles and you need to
! write '+load' you can safely create and send messages to objects whose
  classes already exist in the running program.  The same restrictions as
  above apply to classes defined in bundle.
  
*************** File: gcc.info,  Node: Type encoding,  N
*** 43161,43169 ****
  8.3 Type Encoding
  =================
  
! This is an advanced section.  Type encodings are used extensively by
! the compiler and by the runtime, but you generally do not need to know
! about them to use Objective-C.
  
   The Objective-C compiler generates type encodings for all the types.
  These type encodings are used at runtime to find out information about
--- 42779,42787 ----
  8.3 Type Encoding
  =================
  
! This is an advanced section.  Type encodings are used extensively by the
! compiler and by the runtime, but you generally do not need to know about
! them to use Objective-C.
  
   The Objective-C compiler generates type encodings for all the types.
  These type encodings are used at runtime to find out information about
*************** selectors and methods and about objects
*** 43171,43204 ****
  
   The types are encoded in the following way:
  
! `_Bool'            `B'
! `char'             `c'
! `unsigned char'    `C'
! `short'            `s'
! `unsigned short'   `S'
! `int'              `i'
! `unsigned int'     `I'
! `long'             `l'
! `unsigned long'    `L'
! `long long'        `q'
! `unsigned long     `Q'
! long'              
! `float'            `f'
! `double'           `d'
! `long double'      `D'
! `void'             `v'
! `id'               `@'
! `Class'            `#'
! `SEL'              `:'
! `char*'            `*'
! `enum'             an `enum' is encoded exactly as the integer type that
!                    the compiler uses for it, which depends on the
                     enumeration values.  Often the compiler users
!                    `unsigned int', which is then encoded as `I'.
! unknown type       `?'
! Complex types      `j' followed by the inner type.  For example
!                    `_Complex double' is encoded as "jd".
! bit-fields         `b' followed by the starting position of the
                     bit-field, the type of the bit-field and the size of
                     the bit-field (the bit-fields encoding was changed
                     from the NeXT's compiler encoding, see below)
--- 42789,42822 ----
  
   The types are encoded in the following way:
  
! '_Bool'            'B'
! 'char'             'c'
! 'unsigned char'    'C'
! 'short'            's'
! 'unsigned short'   'S'
! 'int'              'i'
! 'unsigned int'     'I'
! 'long'             'l'
! 'unsigned long'    'L'
! 'long long'        'q'
! 'unsigned long     'Q'
! long'
! 'float'            'f'
! 'double'           'd'
! 'long double'      'D'
! 'void'             'v'
! 'id'               '@'
! 'Class'            '#'
! 'SEL'              ':'
! 'char*'            '*'
! 'enum'             an 'enum' is encoded exactly as the integer type
!                    that the compiler uses for it, which depends on the
                     enumeration values.  Often the compiler users
!                    'unsigned int', which is then encoded as 'I'.
! unknown type       '?'
! Complex types      'j' followed by the inner type.  For example
!                    '_Complex double' is encoded as "jd".
! bit-fields         'b' followed by the starting position of the
                     bit-field, the type of the bit-field and the size of
                     the bit-field (the bit-fields encoding was changed
                     from the NeXT's compiler encoding, see below)
*************** bit closest to the beginning of the stru
*** 43219,43295 ****
  
   The non-atomic types are encoded as follows:
  
! pointers       `^' followed by the pointed type.
! arrays         `[' followed by the number of elements in the array
!                followed by the type of the elements followed by `]'
! structures     `{' followed by the name of the structure (or `?' if the
!                structure is unnamed), the `=' sign, the type of the
!                members and by `}'
! unions         `(' followed by the name of the structure (or `?' if the
!                union is unnamed), the `=' sign, the type of the members
!                followed by `)'
! vectors        `![' followed by the vector_size (the number of bytes
                 composing the vector) followed by a comma, followed by
                 the alignment (in bytes) of the vector, followed by the
!                type of the elements followed by `]'
  
   Here are some types and their encodings, as they are generated by the
  compiler on an i386 machine:
  
  
  Objective-C type   Compiler encoding
!      int a[10];    `[10i]'
!      struct {      `{?=i[3f]b128i3b131i2c}'
!        int i;      
!        float f[3]; 
!        int a:3;    
!        int b:2;    
!        char c;     
!      }             
!      int a __attribute__ ((vector_size (16)));`![16,16i]' (alignment would depend on the machine)
  
  
!  In addition to the types the compiler also encodes the type
! specifiers.  The table below describes the encoding of the current
! Objective-C type specifiers:
  
  
  Specifier          Encoding
! `const'            `r'
! `in'               `n'
! `inout'            `N'
! `out'              `o'
! `bycopy'           `O'
! `byref'            `R'
! `oneway'           `V'
  
  
   The type specifiers are encoded just before the type.  Unlike types
  however, the type specifiers are only encoded when they appear in method
  argument types.
  
!  Note how `const' interacts with pointers:
  
  
  Objective-C type   Compiler encoding
!      const int     `ri'
!      const int*    `^ri'
!      int *const    `r^i'
  
  
!  `const int*' is a pointer to a `const int', and so is encoded as
! `^ri'.  `int* const', instead, is a `const' pointer to an `int', and so
! is encoded as `r^i'.
  
!  Finally, there is a complication when encoding `const char *' versus
! `char * const'.  Because `char *' is encoded as `*' and not as `^c',
! there is no way to express the fact that `r' applies to the pointer or
  to the pointee.
  
!  Hence, it is assumed as a convention that `r*' means `const char *'
  (since it is what is most often meant), and there is no way to encode
! `char *const'.  `char *const' would simply be encoded as `*', and the
! `const' is lost.
  
  * Menu:
  
--- 42837,42913 ----
  
   The non-atomic types are encoded as follows:
  
! pointers       '^' followed by the pointed type.
! arrays         '[' followed by the number of elements in the array
!                followed by the type of the elements followed by ']'
! structures     '{' followed by the name of the structure (or '?' if the
!                structure is unnamed), the '=' sign, the type of the
!                members and by '}'
! unions         '(' followed by the name of the structure (or '?' if the
!                union is unnamed), the '=' sign, the type of the members
!                followed by ')'
! vectors        '![' followed by the vector_size (the number of bytes
                 composing the vector) followed by a comma, followed by
                 the alignment (in bytes) of the vector, followed by the
!                type of the elements followed by ']'
  
   Here are some types and their encodings, as they are generated by the
  compiler on an i386 machine:
  
  
  Objective-C type   Compiler encoding
!      int a[10];    '[10i]'
!      struct {      '{?=i[3f]b128i3b131i2c}'
!        int i;
!        float f[3];
!        int a:3;
!        int b:2;
!        char c;
!      }
!      int a __attribute__ ((vector_size (16)));'![16,16i]' (alignment would depend on the machine)
  
  
!  In addition to the types the compiler also encodes the type specifiers.
! The table below describes the encoding of the current Objective-C type
! specifiers:
  
  
  Specifier          Encoding
! 'const'            'r'
! 'in'               'n'
! 'inout'            'N'
! 'out'              'o'
! 'bycopy'           'O'
! 'byref'            'R'
! 'oneway'           'V'
  
  
   The type specifiers are encoded just before the type.  Unlike types
  however, the type specifiers are only encoded when they appear in method
  argument types.
  
!  Note how 'const' interacts with pointers:
  
  
  Objective-C type   Compiler encoding
!      const int     'ri'
!      const int*    '^ri'
!      int *const    'r^i'
  
  
!  'const int*' is a pointer to a 'const int', and so is encoded as '^ri'.
! 'int* const', instead, is a 'const' pointer to an 'int', and so is
! encoded as 'r^i'.
  
!  Finally, there is a complication when encoding 'const char *' versus
! 'char * const'.  Because 'char *' is encoded as '*' and not as '^c',
! there is no way to express the fact that 'r' applies to the pointer or
  to the pointee.
  
!  Hence, it is assumed as a convention that 'r*' means 'const char *'
  (since it is what is most often meant), and there is no way to encode
! 'char *const'.  'char *const' would simply be encoded as '*', and the
! 'const' is lost.
  
  * Menu:
  
*************** File: gcc.info,  Node: Legacy type encod
*** 43305,43313 ****
  
  Unfortunately, historically GCC used to have a number of bugs in its
  encoding code.  The NeXT runtime expects GCC to emit type encodings in
! this historical format (compatible with GCC-3.3), so when using the
! NeXT runtime, GCC will introduce on purpose a number of incorrect
! encodings:
  
     * the read-only qualifier of the pointee gets emitted before the '^'.
       The read-only qualifier of the pointer itself gets ignored, unless
--- 42923,42930 ----
  
  Unfortunately, historically GCC used to have a number of bugs in its
  encoding code.  The NeXT runtime expects GCC to emit type encodings in
! this historical format (compatible with GCC-3.3), so when using the NeXT
! runtime, GCC will introduce on purpose a number of incorrect encodings:
  
     * the read-only qualifier of the pointee gets emitted before the '^'.
       The read-only qualifier of the pointer itself gets ignored, unless
*************** encodings:
*** 43315,43344 ****
       type.
  
     * 32-bit longs are encoded as 'l' or 'L', but not always.  For
!      typedefs, the compiler uses 'i' or 'I' instead if encoding a
!      struct field or a pointer.
  
!    * `enum's are always encoded as 'i' (int) even if they are actually
       unsigned or long.
  
- 
   In addition to that, the NeXT runtime uses a different encoding for
! bitfields.  It encodes them as `b' followed by the size, without a bit
  offset or the underlying field type.
  
  
  File: gcc.info,  Node: @encode,  Next: Method signatures,  Prev: Legacy type encoding,  Up: Type encoding
  
! 8.3.2 `@encode'
  ---------------
  
! GNU Objective-C supports the `@encode' syntax that allows you to create
! a type encoding from a C/Objective-C type.  For example, `@encode(int)'
! is compiled by the compiler into `"i"'.
  
!  `@encode' does not support type qualifiers other than `const'.  For
! example, `@encode(const char*)' is valid and is compiled into `"r*"',
! while `@encode(bycopy char *)' is invalid and will cause a compilation
  error.
  
  
--- 42932,42960 ----
       type.
  
     * 32-bit longs are encoded as 'l' or 'L', but not always.  For
!      typedefs, the compiler uses 'i' or 'I' instead if encoding a struct
!      field or a pointer.
  
!    * 'enum's are always encoded as 'i' (int) even if they are actually
       unsigned or long.
  
   In addition to that, the NeXT runtime uses a different encoding for
! bitfields.  It encodes them as 'b' followed by the size, without a bit
  offset or the underlying field type.
  
  
  File: gcc.info,  Node: @encode,  Next: Method signatures,  Prev: Legacy type encoding,  Up: Type encoding
  
! 8.3.2 '@encode'
  ---------------
  
! GNU Objective-C supports the '@encode' syntax that allows you to create
! a type encoding from a C/Objective-C type.  For example, '@encode(int)'
! is compiled by the compiler into '"i"'.
  
!  '@encode' does not support type qualifiers other than 'const'.  For
! example, '@encode(const char*)' is valid and is compiled into '"r*"',
! while '@encode(bycopy char *)' is invalid and will cause a compilation
  error.
  
  
*************** File: gcc.info,  Node: Method signatures
*** 43348,43354 ****
  -----------------------
  
  This section documents the encoding of method types, which is rarely
! needed to use Objective-C.  You should skip it at a first reading; the
  runtime provides functions that will work on methods and can walk
  through the list of parameters and interpret them for you.  These
  functions are part of the public "API" and are the preferred way to
--- 42964,42970 ----
  -----------------------
  
  This section documents the encoding of method types, which is rarely
! needed to use Objective-C. You should skip it at a first reading; the
  runtime provides functions that will work on methods and can walk
  through the list of parameters and interpret them for you.  These
  functions are part of the public "API" and are the preferred way to
*************** arguments.
*** 43365,43391 ****
   The "signature" is a null-terminated string, composed of the following:
  
     * The return type, including type qualifiers.  For example, a method
!      returning `int' would have `i' here.
  
     * The total size (in bytes) required to pass all the parameters.
!      This includes the two hidden parameters (the object `self' and the
!      method selector `_cmd').
  
     * Each argument, with the type encoding, followed by the offset (in
       bytes) of the argument in the list of parameters.
  
! 
!  For example, a method with no arguments and returning `int' would have
! the signature `i8@0:4' if the size of a pointer is 4.  The signature is
! interpreted as follows: the `i' is the return type (an `int'), the `8'
  is the total size of the parameters in bytes (two pointers each of size
! 4), the `@0' is the first parameter (an object at byte offset `0') and
! `:4' is the second parameter (a `SEL' at byte offset `4').
  
   You can easily find more examples by running the "strings" program on
! an Objective-C object file compiled by GCC.  You'll see a lot of
! strings that look very much like `i8@0:4'.  They are signatures of
! Objective-C methods.
  
  
  File: gcc.info,  Node: Garbage Collection,  Next: Constant string objects,  Prev: Type encoding,  Up: Objective-C
--- 42981,43006 ----
   The "signature" is a null-terminated string, composed of the following:
  
     * The return type, including type qualifiers.  For example, a method
!      returning 'int' would have 'i' here.
  
     * The total size (in bytes) required to pass all the parameters.
!      This includes the two hidden parameters (the object 'self' and the
!      method selector '_cmd').
  
     * Each argument, with the type encoding, followed by the offset (in
       bytes) of the argument in the list of parameters.
  
!  For example, a method with no arguments and returning 'int' would have
! the signature 'i8@0:4' if the size of a pointer is 4.  The signature is
! interpreted as follows: the 'i' is the return type (an 'int'), the '8'
  is the total size of the parameters in bytes (two pointers each of size
! 4), the '@0' is the first parameter (an object at byte offset '0') and
! ':4' is the second parameter (a 'SEL' at byte offset '4').
  
   You can easily find more examples by running the "strings" program on
! an Objective-C object file compiled by GCC. You'll see a lot of strings
! that look very much like 'i8@0:4'.  They are signatures of Objective-C
! methods.
  
  
  File: gcc.info,  Node: Garbage Collection,  Next: Constant string objects,  Prev: Type encoding,  Up: Objective-C
*************** using a powerful conservative garbage co
*** 43401,43410 ****
  Boehm-Demers-Weiser conservative garbage collector.
  
   To enable the support for it you have to configure the compiler using
! an additional argument, `--enable-objc-gc'.  This will build the
  boehm-gc library, and build an additional runtime library which has
  several enhancements to support the garbage collector.  The new library
! has a new name, `libobjc_gc.a' to not conflict with the
  non-garbage-collected library.
  
   When the garbage collector is used, the objects are allocated using the
--- 43016,43025 ----
  Boehm-Demers-Weiser conservative garbage collector.
  
   To enable the support for it you have to configure the compiler using
! an additional argument, '--enable-objc-gc'.  This will build the
  boehm-gc library, and build an additional runtime library which has
  several enhancements to support the garbage collector.  The new library
! has a new name, 'libobjc_gc.a' to not conflict with the
  non-garbage-collected library.
  
   When the garbage collector is used, the objects are allocated using the
*************** on where pointers are located inside obj
*** 43414,43427 ****
  computed once per class, immediately after the class has been
  initialized.
  
!  There is a new runtime function `class_ivar_set_gcinvisible()' which
  can be used to declare a so-called "weak pointer" reference.  Such a
  pointer is basically hidden for the garbage collector; this can be
  useful in certain situations, especially when you want to keep track of
  the allocated objects, yet allow them to be collected.  This kind of
  pointers can only be members of objects, you cannot declare a global
  pointer as a weak reference.  Every type which is a pointer type can be
! declared a weak pointer, including `id', `Class' and `SEL'.
  
   Here is an example of how to use this feature.  Suppose you want to
  implement a class whose instances hold a weak pointer reference; the
--- 43029,43042 ----
  computed once per class, immediately after the class has been
  initialized.
  
!  There is a new runtime function 'class_ivar_set_gcinvisible()' which
  can be used to declare a so-called "weak pointer" reference.  Such a
  pointer is basically hidden for the garbage collector; this can be
  useful in certain situations, especially when you want to keep track of
  the allocated objects, yet allow them to be collected.  This kind of
  pointers can only be members of objects, you cannot declare a global
  pointer as a weak reference.  Every type which is a pointer type can be
! declared a weak pointer, including 'id', 'Class' and 'SEL'.
  
   Here is an example of how to use this feature.  Suppose you want to
  implement a class whose instances hold a weak pointer reference; the
*************** following class does this:
*** 43459,43466 ****
  
       @end
  
   Weak pointers are supported through a new type character specifier
! represented by the `!' character.  The `class_ivar_set_gcinvisible()'
  function adds or removes this specifier to the string type description
  of the instance variable named as argument.
  
--- 43074,43082 ----
  
       @end
  
+ 
   Weak pointers are supported through a new type character specifier
! represented by the '!' character.  The 'class_ivar_set_gcinvisible()'
  function adds or removes this specifier to the string type description
  of the instance variable named as argument.
  
*************** File: gcc.info,  Node: Constant string o
*** 43472,43491 ****
  
  GNU Objective-C provides constant string objects that are generated
  directly by the compiler.  You declare a constant string object by
! prefixing a C constant string with the character `@':
  
         id myString = @"this is a constant string object";
  
   The constant string objects are by default instances of the
! `NXConstantString' class which is provided by the GNU Objective-C
  runtime.  To get the definition of this class you must include the
! `objc/NXConstStr.h' header file.
  
   User defined libraries may want to implement their own constant string
  class.  To be able to support them, the GNU Objective-C compiler
  provides a new command line options
! `-fconstant-string-class=CLASS-NAME'.  The provided class should adhere
! to a strict structure, the same as `NXConstantString''s structure:
  
  
       @interface MyConstantStringClass
--- 43088,43107 ----
  
  GNU Objective-C provides constant string objects that are generated
  directly by the compiler.  You declare a constant string object by
! prefixing a C constant string with the character '@':
  
         id myString = @"this is a constant string object";
  
   The constant string objects are by default instances of the
! 'NXConstantString' class which is provided by the GNU Objective-C
  runtime.  To get the definition of this class you must include the
! 'objc/NXConstStr.h' header file.
  
   User defined libraries may want to implement their own constant string
  class.  To be able to support them, the GNU Objective-C compiler
  provides a new command line options
! '-fconstant-string-class=CLASS-NAME'.  The provided class should adhere
! to a strict structure, the same as 'NXConstantString''s structure:
  
  
       @interface MyConstantStringClass
*************** to a strict structure, the same as `NXCo
*** 43496,43547 ****
       }
       @end
  
!  `NXConstantString' inherits from `Object'; user class libraries may
  choose to inherit the customized constant string class from a different
! class than `Object'.  There is no requirement in the methods the
! constant string class has to implement, but the final ivar layout of
! the class must be the compatible with the given structure.
  
   When the compiler creates the statically allocated constant string
! object, the `c_string' field will be filled by the compiler with the
! string; the `length' field will be filled by the compiler with the
! string length; the `isa' pointer will be filled with `NULL' by the
  compiler, and it will later be fixed up automatically at runtime by the
  GNU Objective-C runtime library to point to the class which was set by
! the `-fconstant-string-class' option when the object file is loaded (if
! you wonder how it works behind the scenes, the name of the class to
! use, and the list of static objects to fixup, are stored by the
! compiler in the object file in a place where the GNU runtime library
! will find them at runtime).
  
!  As a result, when a file is compiled with the
! `-fconstant-string-class' option, all the constant string objects will
! be instances of the class specified as argument to this option.  It is
! possible to have multiple compilation units referring to different
! constant string classes, neither the compiler nor the linker impose any
! restrictions in doing this.
  
  
  File: gcc.info,  Node: compatibility_alias,  Next: Exceptions,  Prev: Constant string objects,  Up: Objective-C
  
! 8.6 `compatibility_alias'
  =========================
  
! The keyword `@compatibility_alias' allows you to define a class name as
  equivalent to another class name.  For example:
  
       @compatibility_alias WOApplication GSWApplication;
  
!  tells the compiler that each time it encounters `WOApplication' as a
! class name, it should replace it with `GSWApplication' (that is,
! `WOApplication' is just an alias for `GSWApplication').
  
   There are some constraints on how this can be used--
  
!    * `WOApplication' (the alias) must not be an existing class;
! 
!    * `GSWApplication' (the real class) must be an existing class.
  
  
  
  File: gcc.info,  Node: Exceptions,  Next: Synchronization,  Prev: compatibility_alias,  Up: Objective-C
--- 43112,43163 ----
       }
       @end
  
! 
!  'NXConstantString' inherits from 'Object'; user class libraries may
  choose to inherit the customized constant string class from a different
! class than 'Object'.  There is no requirement in the methods the
! constant string class has to implement, but the final ivar layout of the
! class must be the compatible with the given structure.
  
   When the compiler creates the statically allocated constant string
! object, the 'c_string' field will be filled by the compiler with the
! string; the 'length' field will be filled by the compiler with the
! string length; the 'isa' pointer will be filled with 'NULL' by the
  compiler, and it will later be fixed up automatically at runtime by the
  GNU Objective-C runtime library to point to the class which was set by
! the '-fconstant-string-class' option when the object file is loaded (if
! you wonder how it works behind the scenes, the name of the class to use,
! and the list of static objects to fixup, are stored by the compiler in
! the object file in a place where the GNU runtime library will find them
! at runtime).
  
!  As a result, when a file is compiled with the '-fconstant-string-class'
! option, all the constant string objects will be instances of the class
! specified as argument to this option.  It is possible to have multiple
! compilation units referring to different constant string classes,
! neither the compiler nor the linker impose any restrictions in doing
! this.
  
  
  File: gcc.info,  Node: compatibility_alias,  Next: Exceptions,  Prev: Constant string objects,  Up: Objective-C
  
! 8.6 'compatibility_alias'
  =========================
  
! The keyword '@compatibility_alias' allows you to define a class name as
  equivalent to another class name.  For example:
  
       @compatibility_alias WOApplication GSWApplication;
  
!  tells the compiler that each time it encounters 'WOApplication' as a
! class name, it should replace it with 'GSWApplication' (that is,
! 'WOApplication' is just an alias for 'GSWApplication').
  
   There are some constraints on how this can be used--
  
!    * 'WOApplication' (the alias) must not be an existing class;
  
+    * 'GSWApplication' (the real class) must be an existing class.
  
  
  File: gcc.info,  Node: Exceptions,  Next: Synchronization,  Prev: compatibility_alias,  Up: Objective-C
*************** in the following example:
*** 43576,43621 ****
           ...
         }
  
!  The `@throw' statement may appear anywhere in an Objective-C or
! Objective-C++ program; when used inside of a `@catch' block, the
! `@throw' may appear without an argument (as shown above), in which case
! the object caught by the `@catch' will be rethrown.
  
   Note that only (pointers to) Objective-C objects may be thrown and
  caught using this scheme.  When an object is thrown, it will be caught
! by the nearest `@catch' clause capable of handling objects of that
! type, analogously to how `catch' blocks work in C++ and Java.  A
! `@catch(id ...)' clause (as shown above) may also be provided to catch
! any and all Objective-C exceptions not caught by previous `@catch'
! clauses (if any).
  
!  The `@finally' clause, if present, will be executed upon exit from the
! immediately preceding `@try ... @catch' section.  This will happen
  regardless of whether any exceptions are thrown, caught or rethrown
! inside the `@try ... @catch' section, analogously to the behavior of
! the `finally' clause in Java.
  
   There are several caveats to using the new exception mechanism:
  
!    * The `-fobjc-exceptions' command line option must be used when
       compiling Objective-C files that use exceptions.
  
     * With the GNU runtime, exceptions are always implemented as "native"
!      exceptions and it is recommended that the `-fexceptions' and
!      `-shared-libgcc' options are used when linking.
  
     * With the NeXT runtime, although currently designed to be binary
!      compatible with `NS_HANDLER'-style idioms provided by the
!      `NSException' class, the new exceptions can only be used on Mac OS
       X 10.3 (Panther) and later systems, due to additional functionality
       needed in the NeXT Objective-C runtime.
  
     * As mentioned above, the new exceptions do not support handling
!      types other than Objective-C objects.   Furthermore, when used from
       Objective-C++, the Objective-C exception model does not
       interoperate with C++ exceptions at this time.  This means you
!      cannot `@throw' an exception from Objective-C and `catch' it in
!      C++, or vice versa (i.e., `throw ... @catch').
  
  
  File: gcc.info,  Node: Synchronization,  Next: Fast enumeration,  Prev: Exceptions,  Up: Objective-C
--- 43192,43236 ----
           ...
         }
  
!  The '@throw' statement may appear anywhere in an Objective-C or
! Objective-C++ program; when used inside of a '@catch' block, the
! '@throw' may appear without an argument (as shown above), in which case
! the object caught by the '@catch' will be rethrown.
  
   Note that only (pointers to) Objective-C objects may be thrown and
  caught using this scheme.  When an object is thrown, it will be caught
! by the nearest '@catch' clause capable of handling objects of that type,
! analogously to how 'catch' blocks work in C++ and Java.  A '@catch(id
! ...)' clause (as shown above) may also be provided to catch any and all
! Objective-C exceptions not caught by previous '@catch' clauses (if any).
  
!  The '@finally' clause, if present, will be executed upon exit from the
! immediately preceding '@try ... @catch' section.  This will happen
  regardless of whether any exceptions are thrown, caught or rethrown
! inside the '@try ... @catch' section, analogously to the behavior of the
! 'finally' clause in Java.
  
   There are several caveats to using the new exception mechanism:
  
!    * The '-fobjc-exceptions' command line option must be used when
       compiling Objective-C files that use exceptions.
  
     * With the GNU runtime, exceptions are always implemented as "native"
!      exceptions and it is recommended that the '-fexceptions' and
!      '-shared-libgcc' options are used when linking.
  
     * With the NeXT runtime, although currently designed to be binary
!      compatible with 'NS_HANDLER'-style idioms provided by the
!      'NSException' class, the new exceptions can only be used on Mac OS
       X 10.3 (Panther) and later systems, due to additional functionality
       needed in the NeXT Objective-C runtime.
  
     * As mentioned above, the new exceptions do not support handling
!      types other than Objective-C objects.  Furthermore, when used from
       Objective-C++, the Objective-C exception model does not
       interoperate with C++ exceptions at this time.  This means you
!      cannot '@throw' an exception from Objective-C and 'catch' it in
!      C++, or vice versa (i.e., 'throw ... @catch').
  
  
  File: gcc.info,  Node: Synchronization,  Next: Fast enumeration,  Prev: Exceptions,  Up: Objective-C
*************** GNU Objective-C provides support for syn
*** 43629,43651 ****
           ...
         }
  
!  Upon entering the `@synchronized' block, a thread of execution shall
! first check whether a lock has been placed on the corresponding `guard'
  object by another thread.  If it has, the current thread shall wait
! until the other thread relinquishes its lock.  Once `guard' becomes
! available, the current thread will place its own lock on it, execute
! the code contained in the `@synchronized' block, and finally relinquish
! the lock (thereby making `guard' available to other threads).
  
!  Unlike Java, Objective-C does not allow for entire methods to be
! marked `@synchronized'.  Note that throwing exceptions out of
! `@synchronized' blocks is allowed, and will cause the guarding object
! to be unlocked properly.
  
   Because of the interactions between synchronization and exception
! handling, you can only use `@synchronized' when compiling with
  exceptions enabled, that is with the command line option
! `-fobjc-exceptions'.
  
  
  File: gcc.info,  Node: Fast enumeration,  Next: Messaging with the GNU Objective-C runtime,  Prev: Synchronization,  Up: Objective-C
--- 43244,43266 ----
           ...
         }
  
!  Upon entering the '@synchronized' block, a thread of execution shall
! first check whether a lock has been placed on the corresponding 'guard'
  object by another thread.  If it has, the current thread shall wait
! until the other thread relinquishes its lock.  Once 'guard' becomes
! available, the current thread will place its own lock on it, execute the
! code contained in the '@synchronized' block, and finally relinquish the
! lock (thereby making 'guard' available to other threads).
  
!  Unlike Java, Objective-C does not allow for entire methods to be marked
! '@synchronized'.  Note that throwing exceptions out of '@synchronized'
! blocks is allowed, and will cause the guarding object to be unlocked
! properly.
  
   Because of the interactions between synchronization and exception
! handling, you can only use '@synchronized' when compiling with
  exceptions enabled, that is with the command line option
! '-fobjc-exceptions'.
  
  
  File: gcc.info,  Node: Fast enumeration,  Next: Messaging with the GNU Objective-C runtime,  Prev: Synchronization,  Up: Objective-C
*************** GNU Objective-C provides support for the
*** 43676,43694 ****
           /* Do something with 'object' */
         }
  
!  `array' needs to be an Objective-C object (usually a collection
! object, for example an array, a dictionary or a set) which implements
! the "Fast Enumeration Protocol" (see below).  If you are using a
! Foundation library such as GNUstep Base or Apple Cocoa Foundation, all
! collection objects in the library implement this protocol and can be
! used in this way.
  
!  The code above would iterate over all objects in `array'.  For each of
! them, it assigns it to `object', then executes the `Do something with
  'object'' statements.
  
   Here is a fully worked-out example using a Foundation library (which
! provides the implementation of `NSArray', `NSString' and `NSLog'):
  
         NSArray *array = [NSArray arrayWithObjects: @"1", @"2", @"3", nil];
         NSString *object;
--- 43291,43309 ----
           /* Do something with 'object' */
         }
  
!  'array' needs to be an Objective-C object (usually a collection object,
! for example an array, a dictionary or a set) which implements the "Fast
! Enumeration Protocol" (see below).  If you are using a Foundation
! library such as GNUstep Base or Apple Cocoa Foundation, all collection
! objects in the library implement this protocol and can be used in this
! way.
  
!  The code above would iterate over all objects in 'array'.  For each of
! them, it assigns it to 'object', then executes the 'Do something with
  'object'' statements.
  
   Here is a fully worked-out example using a Foundation library (which
! provides the implementation of 'NSArray', 'NSString' and 'NSLog'):
  
         NSArray *array = [NSArray arrayWithObjects: @"1", @"2", @"3", nil];
         NSString *object;
*************** A c99-like declaration syntax is also al
*** 43725,43732 ****
  
   but can save some typing.
  
!  Note that the option `-std=c99' is not required to allow this syntax
! in Objective-C.
  
  
  File: gcc.info,  Node: Fast enumeration details,  Next: Fast enumeration protocol,  Prev: c99-like fast enumeration syntax,  Up: Fast enumeration
--- 43340,43347 ----
  
   but can save some typing.
  
!  Note that the option '-std=c99' is not required to allow this syntax in
! Objective-C.
  
  
  File: gcc.info,  Node: Fast enumeration details,  Next: Fast enumeration protocol,  Prev: c99-like fast enumeration syntax,  Up: Fast enumeration
*************** the code
*** 43744,43752 ****
  
   here is what happens when you run it:
  
!    * `COLLECTION EXPRESSION' is evaluated exactly once and the result
!      is used as the collection object to iterate over.  This means it
!      is safe to write code such as `for (object in [NSDictionary
       keyEnumerator]) ...'.
  
     * the iteration is implemented by the compiler by repeatedly getting
--- 43359,43367 ----
  
   here is what happens when you run it:
  
!    * 'COLLECTION EXPRESSION' is evaluated exactly once and the result is
!      used as the collection object to iterate over.  This means it is
!      safe to write code such as 'for (object in [NSDictionary
       keyEnumerator]) ...'.
  
     * the iteration is implemented by the compiler by repeatedly getting
*************** the code
*** 43756,43788 ****
       objects are retrieved one by one (hence the name "fast
       enumeration").
  
!    * if there are no objects in the collection, then `OBJECT
!      EXPRESSION' is set to `nil' and the loop immediately terminates.
  
     * if there are objects in the collection, then for each object in the
!      collection (in the order they are returned) `OBJECT EXPRESSION' is
!      set to the object, then `STATEMENTS' are executed.
  
!    * `STATEMENTS' can contain `break' and `continue' commands, which
       will abort the iteration or skip to the next loop iteration as
       expected.
  
     * when the iteration ends because there are no more objects to
!      iterate over, `OBJECT EXPRESSION' is set to `nil'.  This allows
!      you to determine whether the iteration finished because a `break'
!      command was used (in which case `OBJECT EXPRESSION' will remain
!      set to the last object that was iterated over) or because it
!      iterated over all the objects (in which case `OBJECT EXPRESSION'
!      will be set to `nil').
  
!    * `STATEMENTS' must not make any changes to the collection object;
!      if they do, it is a hard error and the fast enumeration terminates
!      by invoking `objc_enumerationMutation', a runtime function that
       normally aborts the program but which can be customized by
!      Foundation libraries via `objc_set_mutation_handler' to do
       something different, such as raising an exception.
  
- 
  
  File: gcc.info,  Node: Fast enumeration protocol,  Prev: Fast enumeration details,  Up: Fast enumeration
  
--- 43371,43402 ----
       objects are retrieved one by one (hence the name "fast
       enumeration").
  
!    * if there are no objects in the collection, then 'OBJECT EXPRESSION'
!      is set to 'nil' and the loop immediately terminates.
  
     * if there are objects in the collection, then for each object in the
!      collection (in the order they are returned) 'OBJECT EXPRESSION' is
!      set to the object, then 'STATEMENTS' are executed.
  
!    * 'STATEMENTS' can contain 'break' and 'continue' commands, which
       will abort the iteration or skip to the next loop iteration as
       expected.
  
     * when the iteration ends because there are no more objects to
!      iterate over, 'OBJECT EXPRESSION' is set to 'nil'.  This allows you
!      to determine whether the iteration finished because a 'break'
!      command was used (in which case 'OBJECT EXPRESSION' will remain set
!      to the last object that was iterated over) or because it iterated
!      over all the objects (in which case 'OBJECT EXPRESSION' will be set
!      to 'nil').
  
!    * 'STATEMENTS' must not make any changes to the collection object; if
!      they do, it is a hard error and the fast enumeration terminates by
!      invoking 'objc_enumerationMutation', a runtime function that
       normally aborts the program but which can be customized by
!      Foundation libraries via 'objc_set_mutation_handler' to do
       something different, such as raising an exception.
  
  
  File: gcc.info,  Node: Fast enumeration protocol,  Prev: Fast enumeration details,  Up: Fast enumeration
  
*************** enumeration, you need to have it impleme
*** 43796,43802 ****
                                             objects: (id *)objects
                                               count: (unsigned long)len;
  
!  where `NSFastEnumerationState' must be defined in your code as follows:
  
       typedef struct
       {
--- 43410,43416 ----
                                             objects: (id *)objects
                                               count: (unsigned long)len;
  
!  where 'NSFastEnumerationState' must be defined in your code as follows:
  
       typedef struct
       {
*************** enumeration, you need to have it impleme
*** 43806,43816 ****
         unsigned long extra[5];
       } NSFastEnumerationState;
  
!  If no `NSFastEnumerationState' is defined in your code, the compiler
! will automatically replace `NSFastEnumerationState *' with `struct
  __objcFastEnumerationState *', where that type is silently defined by
  the compiler in an identical way.  This can be confusing and we
! recommend that you define `NSFastEnumerationState' (as shown above)
  instead.
  
   The method is called repeatedly during a fast enumeration to retrieve
--- 43420,43430 ----
         unsigned long extra[5];
       } NSFastEnumerationState;
  
!  If no 'NSFastEnumerationState' is defined in your code, the compiler
! will automatically replace 'NSFastEnumerationState *' with 'struct
  __objcFastEnumerationState *', where that type is silently defined by
  the compiler in an identical way.  This can be confusing and we
! recommend that you define 'NSFastEnumerationState' (as shown above)
  instead.
  
   The method is called repeatedly during a fast enumeration to retrieve
*************** batches of objects.  Each invocation of
*** 43818,43855 ****
  next batch of objects.
  
   The return value of the method is the number of objects in the current
! batch; this should not exceed `len', which is the maximum size of a
  batch as requested by the caller.  The batch itself is returned in the
! `itemsPtr' field of the `NSFastEnumerationState' struct.
  
!  To help with returning the objects, the `objects' array is a C array
! preallocated by the caller (on the stack) of size `len'.  In many cases
! you can put the objects you want to return in that `objects' array,
! then do `itemsPtr = objects'.  But you don't have to; if your
! collection already has the objects to return in some form of C array,
! it could return them from there instead.
  
!  The `state' and `extra' fields of the `NSFastEnumerationState'
  structure allows your collection object to keep track of the state of
! the enumeration.  In a simple array implementation, `state' may keep
! track of the index of the last object that was returned, and `extra'
! may be unused.
  
!  The `mutationsPtr' field of the `NSFastEnumerationState' is used to
! keep track of mutations.  It should point to a number; before working
! on each object, the fast enumeration loop will check that this number
! has not changed.  If it has, a mutation has happened and the fast
! enumeration will abort.  So, `mutationsPtr' could be set to point to
  some sort of version number of your collection, which is increased by
! one every time there is a change (for example when an object is added
! or removed).  Or, if you are content with less strict mutation checks,
! it could point to the number of objects in your collection or some
! other value that can be checked to perform an approximate check that
! the collection has not been mutated.
  
!  Finally, note how we declared the `len' argument and the return value
! to be of type `unsigned long'.  They could also be declared to be of
! type `unsigned int' and everything would still work.
  
  
  File: gcc.info,  Node: Messaging with the GNU Objective-C runtime,  Prev: Fast enumeration,  Up: Objective-C
--- 43432,43469 ----
  next batch of objects.
  
   The return value of the method is the number of objects in the current
! batch; this should not exceed 'len', which is the maximum size of a
  batch as requested by the caller.  The batch itself is returned in the
! 'itemsPtr' field of the 'NSFastEnumerationState' struct.
  
!  To help with returning the objects, the 'objects' array is a C array
! preallocated by the caller (on the stack) of size 'len'.  In many cases
! you can put the objects you want to return in that 'objects' array, then
! do 'itemsPtr = objects'.  But you don't have to; if your collection
! already has the objects to return in some form of C array, it could
! return them from there instead.
  
!  The 'state' and 'extra' fields of the 'NSFastEnumerationState'
  structure allows your collection object to keep track of the state of
! the enumeration.  In a simple array implementation, 'state' may keep
! track of the index of the last object that was returned, and 'extra' may
! be unused.
  
!  The 'mutationsPtr' field of the 'NSFastEnumerationState' is used to
! keep track of mutations.  It should point to a number; before working on
! each object, the fast enumeration loop will check that this number has
! not changed.  If it has, a mutation has happened and the fast
! enumeration will abort.  So, 'mutationsPtr' could be set to point to
  some sort of version number of your collection, which is increased by
! one every time there is a change (for example when an object is added or
! removed).  Or, if you are content with less strict mutation checks, it
! could point to the number of objects in your collection or some other
! value that can be checked to perform an approximate check that the
! collection has not been mutated.
  
!  Finally, note how we declared the 'len' argument and the return value
! to be of type 'unsigned long'.  They could also be declared to be of
! type 'unsigned int' and everything would still work.
  
  
  File: gcc.info,  Node: Messaging with the GNU Objective-C runtime,  Prev: Fast enumeration,  Up: Objective-C
*************** designed to be portable, and so is based
*** 43865,43882 ****
  
   Sending a message in the GNU Objective-C runtime is composed of two
  separate steps.  First, there is a call to the lookup function,
! `objc_msg_lookup ()' (or, in the case of messages to super,
! `objc_msg_lookup_super ()').  This runtime function takes as argument
! the receiver and the selector of the method to be called; it returns
! the `IMP', that is a pointer to the function implementing the method.
! The second step of method invocation consists of casting this pointer
  function to the appropriate function pointer type, and calling the
  function pointed to it with the right arguments.
  
   For example, when the compiler encounters a method invocation such as
! `[object init]', it compiles it into a call to `objc_msg_lookup
! (object, @selector(init))' followed by a cast of the returned value to
! the appropriate function pointer type, and then it calls it.
  
  * Menu:
  
--- 43479,43496 ----
  
   Sending a message in the GNU Objective-C runtime is composed of two
  separate steps.  First, there is a call to the lookup function,
! 'objc_msg_lookup ()' (or, in the case of messages to super,
! 'objc_msg_lookup_super ()').  This runtime function takes as argument
! the receiver and the selector of the method to be called; it returns the
! 'IMP', that is a pointer to the function implementing the method.  The
! second step of method invocation consists of casting this pointer
  function to the appropriate function pointer type, and calling the
  function pointed to it with the right arguments.
  
   For example, when the compiler encounters a method invocation such as
! '[object init]', it compiles it into a call to 'objc_msg_lookup (object,
! @selector(init))' followed by a cast of the returned value to the
! appropriate function pointer type, and then it calls it.
  
  * Menu:
  
*************** File: gcc.info,  Node: Dynamically regis
*** 43889,43897 ****
  8.10.1 Dynamically Registering Methods
  --------------------------------------
  
! If `objc_msg_lookup()' does not find a suitable method implementation,
! because the receiver does not implement the required method, it tries
! to see if the class can dynamically register the method.
  
   To do so, the runtime checks if the class of the receiver implements
  the method
--- 43503,43511 ----
  8.10.1 Dynamically Registering Methods
  --------------------------------------
  
! If 'objc_msg_lookup()' does not find a suitable method implementation,
! because the receiver does not implement the required method, it tries to
! see if the class can dynamically register the method.
  
   To do so, the runtime checks if the class of the receiver implements
  the method
*************** the method
*** 43902,43925 ****
  
       + (BOOL) resolveClassMethod: (SEL)selector;
  
!  in the case of a class method.  If the class implements it, the
! runtime invokes it, passing as argument the selector of the original
! method, and if it returns `YES', the runtime tries the lookup again,
! which could now succeed if a matching method was added dynamically by
! `+resolveInstanceMethod:' or `+resolveClassMethod:'.
  
   This allows classes to dynamically register methods (by adding them to
! the class using `class_addMethod') when they are first called.  To do
! so, a class should implement `+resolveInstanceMethod:' (or, depending
! on the case, `+resolveClassMethod:') and have it recognize the
! selectors of methods that can be registered dynamically at runtime,
! register them, and return `YES'.  It should return `NO' for methods
! that it does not dynamically registered at runtime.
  
!  If `+resolveInstanceMethod:' (or `+resolveClassMethod:') is not
! implemented or returns `NO', the runtime then tries the forwarding hook.
  
!  Support for `+resolveInstanceMethod:' and `resolveClassMethod:' was
  added to the GNU Objective-C runtime in GCC version 4.6.
  
  
--- 43516,43539 ----
  
       + (BOOL) resolveClassMethod: (SEL)selector;
  
!  in the case of a class method.  If the class implements it, the runtime
! invokes it, passing as argument the selector of the original method, and
! if it returns 'YES', the runtime tries the lookup again, which could now
! succeed if a matching method was added dynamically by
! '+resolveInstanceMethod:' or '+resolveClassMethod:'.
  
   This allows classes to dynamically register methods (by adding them to
! the class using 'class_addMethod') when they are first called.  To do
! so, a class should implement '+resolveInstanceMethod:' (or, depending on
! the case, '+resolveClassMethod:') and have it recognize the selectors of
! methods that can be registered dynamically at runtime, register them,
! and return 'YES'.  It should return 'NO' for methods that it does not
! dynamically registered at runtime.
  
!  If '+resolveInstanceMethod:' (or '+resolveClassMethod:') is not
! implemented or returns 'NO', the runtime then tries the forwarding hook.
  
!  Support for '+resolveInstanceMethod:' and 'resolveClassMethod:' was
  added to the GNU Objective-C runtime in GCC version 4.6.
  
  
*************** File: gcc.info,  Node: Forwarding hook,
*** 43929,43981 ****
  ----------------------
  
  The GNU Objective-C runtime provides a hook, called
! `__objc_msg_forward2', which is called by `objc_msg_lookup()' when it
  can't find a method implementation in the runtime tables and after
! calling `+resolveInstanceMethod:' and `+resolveClassMethod:' has been
  attempted and did not succeed in dynamically registering the method.
  
   To configure the hook, you set the global variable
! `__objc_msg_forward2' to a function with the same argument and return
! types of `objc_msg_lookup()'.  When `objc_msg_lookup()' can not find a
  method implementation, it invokes the hook function you provided to get
  a method implementation to return.  So, in practice
! `__objc_msg_forward2' allows you to extend `objc_msg_lookup()' by
! adding some custom code that is called to do a further lookup when no
! standard method implementation can be found using the normal lookup.
  
   This hook is generally reserved for "Foundation" libraries such as
  GNUstep Base, which use it to implement their high-level method
! forwarding API, typically based around the `forwardInvocation:' method.
  So, unless you are implementing your own "Foundation" library, you
  should not set this hook.
  
!  In a typical forwarding implementation, the `__objc_msg_forward2' hook
  function determines the argument and return type of the method that is
  being looked up, and then creates a function that takes these arguments
  and has that return type, and returns it to the caller.  Creating this
  function is non-trivial and is typically performed using a dedicated
! library such as `libffi'.
  
   The forwarding method implementation thus created is returned by
! `objc_msg_lookup()' and is executed as if it was a normal method
! implementation.  When the forwarding method implementation is called,
! it is usually expected to pack all arguments into some sort of object
! (typically, an `NSInvocation' in a "Foundation" library), and hand it
! over to the programmer (`forwardInvocation:') who is then allowed to
  manipulate the method invocation using a high-level API provided by the
  "Foundation" library.  For example, the programmer may want to examine
  the method invocation arguments and name and potentially change them
  before forwarding the method invocation to one or more local objects
! (`performInvocation:') or even to remote objects (by using Distributed
  Objects or some other mechanism).  When all this completes, the return
  value is passed back and must be returned correctly to the original
  caller.
  
!  Note that the GNU Objective-C runtime currently provides no support
! for method forwarding or method invocations other than the
! `__objc_msg_forward2' hook.
  
!  If the forwarding hook does not exist or returns `NULL', the runtime
  currently attempts forwarding using an older, deprecated API, and if
  that fails, it aborts the program.  In future versions of the GNU
  Objective-C runtime, the runtime will immediately abort.
--- 43543,43595 ----
  ----------------------
  
  The GNU Objective-C runtime provides a hook, called
! '__objc_msg_forward2', which is called by 'objc_msg_lookup()' when it
  can't find a method implementation in the runtime tables and after
! calling '+resolveInstanceMethod:' and '+resolveClassMethod:' has been
  attempted and did not succeed in dynamically registering the method.
  
   To configure the hook, you set the global variable
! '__objc_msg_forward2' to a function with the same argument and return
! types of 'objc_msg_lookup()'.  When 'objc_msg_lookup()' can not find a
  method implementation, it invokes the hook function you provided to get
  a method implementation to return.  So, in practice
! '__objc_msg_forward2' allows you to extend 'objc_msg_lookup()' by adding
! some custom code that is called to do a further lookup when no standard
! method implementation can be found using the normal lookup.
  
   This hook is generally reserved for "Foundation" libraries such as
  GNUstep Base, which use it to implement their high-level method
! forwarding API, typically based around the 'forwardInvocation:' method.
  So, unless you are implementing your own "Foundation" library, you
  should not set this hook.
  
!  In a typical forwarding implementation, the '__objc_msg_forward2' hook
  function determines the argument and return type of the method that is
  being looked up, and then creates a function that takes these arguments
  and has that return type, and returns it to the caller.  Creating this
  function is non-trivial and is typically performed using a dedicated
! library such as 'libffi'.
  
   The forwarding method implementation thus created is returned by
! 'objc_msg_lookup()' and is executed as if it was a normal method
! implementation.  When the forwarding method implementation is called, it
! is usually expected to pack all arguments into some sort of object
! (typically, an 'NSInvocation' in a "Foundation" library), and hand it
! over to the programmer ('forwardInvocation:') who is then allowed to
  manipulate the method invocation using a high-level API provided by the
  "Foundation" library.  For example, the programmer may want to examine
  the method invocation arguments and name and potentially change them
  before forwarding the method invocation to one or more local objects
! ('performInvocation:') or even to remote objects (by using Distributed
  Objects or some other mechanism).  When all this completes, the return
  value is passed back and must be returned correctly to the original
  caller.
  
!  Note that the GNU Objective-C runtime currently provides no support for
! method forwarding or method invocations other than the
! '__objc_msg_forward2' hook.
  
!  If the forwarding hook does not exist or returns 'NULL', the runtime
  currently attempts forwarding using an older, deprecated API, and if
  that fails, it aborts the program.  In future versions of the GNU
  Objective-C runtime, the runtime will immediately abort.
*************** Binary compatibility encompasses several
*** 43990,44005 ****
  
  "application binary interface (ABI)"
       The set of runtime conventions followed by all of the tools that
!      deal with binary representations of a program, including
!      compilers, assemblers, linkers, and language runtime support.
!      Some ABIs are formal with a written specification, possibly
!      designed by multiple interested parties.  Others are simply the
!      way things are actually done by a particular set of tools.
  
  "ABI conformance"
!      A compiler conforms to an ABI if it generates code that follows
!      all of the specifications enumerated by that ABI.  A library
!      conforms to an ABI if it is implemented according to that ABI.  An
       application conforms to an ABI if it is built using tools that
       conform to that ABI and does not contain source code that
       specifically changes behavior specified by the ABI.
--- 43604,43619 ----
  
  "application binary interface (ABI)"
       The set of runtime conventions followed by all of the tools that
!      deal with binary representations of a program, including compilers,
!      assemblers, linkers, and language runtime support.  Some ABIs are
!      formal with a written specification, possibly designed by multiple
!      interested parties.  Others are simply the way things are actually
!      done by a particular set of tools.
  
  "ABI conformance"
!      A compiler conforms to an ABI if it generates code that follows all
!      of the specifications enumerated by that ABI.  A library conforms
!      to an ABI if it is implemented according to that ABI.  An
       application conforms to an ABI if it is built using tools that
       conform to that ABI and does not contain source code that
       specifically changes behavior specified by the ABI.
*************** Binary compatibility encompasses several
*** 44012,44021 ****
       Different sets of tools are interoperable if they generate files
       that can be used in the same program.  The set of tools includes
       compilers, assemblers, linkers, libraries, header files, startup
!      files, and debuggers.  Binaries produced by different sets of
!      tools are not interoperable unless they implement the same ABI.
!      This applies to different versions of the same tools as well as
!      tools from different vendors.
  
  "intercallability"
       Whether a function in a binary built by one set of tools can call a
--- 43626,43635 ----
       Different sets of tools are interoperable if they generate files
       that can be used in the same program.  The set of tools includes
       compilers, assemblers, linkers, libraries, header files, startup
!      files, and debuggers.  Binaries produced by different sets of tools
!      are not interoperable unless they implement the same ABI.  This
!      applies to different versions of the same tools as well as tools
!      from different vendors.
  
  "intercallability"
       Whether a function in a binary built by one set of tools can call a
*************** Binary compatibility encompasses several
*** 44023,44034 ****
       of interoperability.
  
  "implementation-defined features"
!      Language standards include lists of implementation-defined
!      features whose behavior can vary from one implementation to
!      another.  Some of these features are normally covered by a
!      platform's ABI and others are not.  The features that are not
!      covered by an ABI generally affect how a program behaves, but not
!      intercallability.
  
  "compatibility"
       Conformance to the same ABI and the same behavior of
--- 43637,43647 ----
       of interoperability.
  
  "implementation-defined features"
!      Language standards include lists of implementation-defined features
!      whose behavior can vary from one implementation to another.  Some
!      of these features are normally covered by a platform's ABI and
!      others are not.  The features that are not covered by an ABI
!      generally affect how a program behaves, but not intercallability.
  
  "compatibility"
       Conformance to the same ABI and the same behavior of
*************** Binary compatibility encompasses several
*** 44039,44065 ****
  affects code generation and runtime support for:
  
     * size and alignment of data types
- 
     * layout of structured types
- 
     * calling conventions
- 
     * register usage conventions
- 
     * interfaces for runtime arithmetic support
- 
     * object file formats
  
   In addition, the application binary interface implemented by a C++
  compiler affects code generation and runtime support for:
     * name mangling
- 
     * exception handling
- 
     * invoking constructors and destructors
- 
     * layout, alignment, and padding of classes
- 
     * layout and alignment of virtual tables
  
   Some GCC compilation options cause the compiler to generate code that
--- 43652,43669 ----
*************** GCC releases, but it is possible that we
*** 44083,44089 ****
  make this difficult.  Such problems could include different
  interpretations of the C++ ABI by different vendors, bugs in the ABI, or
  bugs in the implementation of the ABI in different compilers.  GCC's
! `-Wabi' switch warns when G++ generates code that is probably not
  compatible with the C++ ABI.
  
   The C++ library used with a C++ compiler includes the Standard C++
--- 43687,43693 ----
  make this difficult.  Such problems could include different
  interpretations of the C++ ABI by different vendors, bugs in the ABI, or
  bugs in the implementation of the ABI in different compilers.  GCC's
! '-Wabi' switch warns when G++ generates code that is probably not
  compatible with the C++ ABI.
  
   The C++ library used with a C++ compiler includes the Standard C++
*************** compiler and runtime support.
*** 44097,44110 ****
  
   When G++ and another C++ compiler conform to the same C++ ABI, but the
  implementations of the Standard C++ Library that they normally use do
! not follow the same ABI for the Standard C++ Library, object files
! built with those compilers can be used in the same program only if they
! use the same C++ library.  This requires specifying the location of the
! C++ library header files when invoking the compiler whose usual library
! is not being used.  The location of GCC's C++ header files depends on
! how the GCC build was configured, but can be seen by using the G++ `-v'
! option.  With default configuration options for G++ 3.3 the compile
! line for a different C++ compiler needs to include
  
           -IGCC_INSTALL_DIRECTORY/include/c++/3.3
  
--- 43701,43714 ----
  
   When G++ and another C++ compiler conform to the same C++ ABI, but the
  implementations of the Standard C++ Library that they normally use do
! not follow the same ABI for the Standard C++ Library, object files built
! with those compilers can be used in the same program only if they use
! the same C++ library.  This requires specifying the location of the C++
! library header files when invoking the compiler whose usual library is
! not being used.  The location of GCC's C++ header files depends on how
! the GCC build was configured, but can be seen by using the G++ '-v'
! option.  With default configuration options for G++ 3.3 the compile line
! for a different C++ compiler needs to include
  
           -IGCC_INSTALL_DIRECTORY/include/c++/3.3
  
*************** files for that other library.
*** 44114,44138 ****
  
   The most straightforward way to link a program to use a particular C++
  library is to use a C++ driver that specifies that C++ library by
! default.  The `g++' driver, for example, tells the linker where to find
! GCC's C++ library (`libstdc++') plus the other libraries and startup
  files it needs, in the proper order.
  
   If a program must use a different C++ library and it's not possible to
  do the final link using a C++ driver that uses that library by default,
! it is necessary to tell `g++' the location and name of that library.
! It might also be necessary to specify different startup files and other
  runtime support libraries, and to suppress the use of GCC's support
! libraries with one or more of the options `-nostdlib', `-nostartfiles',
! and `-nodefaultlibs'.
  
  
  File: gcc.info,  Node: Gcov,  Next: Gcov-tool,  Prev: Compatibility,  Up: Top
  
! 10 `gcov'--a Test Coverage Program
  **********************************
  
! `gcov' is a tool you can use in conjunction with GCC to test code
  coverage in your programs.
  
  * Menu:
--- 43718,43742 ----
  
   The most straightforward way to link a program to use a particular C++
  library is to use a C++ driver that specifies that C++ library by
! default.  The 'g++' driver, for example, tells the linker where to find
! GCC's C++ library ('libstdc++') plus the other libraries and startup
  files it needs, in the proper order.
  
   If a program must use a different C++ library and it's not possible to
  do the final link using a C++ driver that uses that library by default,
! it is necessary to tell 'g++' the location and name of that library.  It
! might also be necessary to specify different startup files and other
  runtime support libraries, and to suppress the use of GCC's support
! libraries with one or more of the options '-nostdlib', '-nostartfiles',
! and '-nodefaultlibs'.
  
  
  File: gcc.info,  Node: Gcov,  Next: Gcov-tool,  Prev: Compatibility,  Up: Top
  
! 10 'gcov'--a Test Coverage Program
  **********************************
  
! 'gcov' is a tool you can use in conjunction with GCC to test code
  coverage in your programs.
  
  * Menu:
*************** coverage in your programs.
*** 44146,44164 ****
  
  File: gcc.info,  Node: Gcov Intro,  Next: Invoking Gcov,  Up: Gcov
  
! 10.1 Introduction to `gcov'
  ===========================
  
! `gcov' is a test coverage program.  Use it in concert with GCC to
! analyze your programs to help create more efficient, faster running
! code and to discover untested parts of your program.  You can use
! `gcov' as a profiling tool to help discover where your optimization
! efforts will best affect your code.  You can also use `gcov' along with
! the other profiling tool, `gprof', to assess which parts of your code
! use the greatest amount of computing time.
  
   Profiling tools help you analyze your code's performance.  Using a
! profiler such as `gcov' or `gprof', you can find out some basic
  performance statistics, such as:
  
     * how often each line of code executes
--- 43750,43768 ----
  
  File: gcc.info,  Node: Gcov Intro,  Next: Invoking Gcov,  Up: Gcov
  
! 10.1 Introduction to 'gcov'
  ===========================
  
! 'gcov' is a test coverage program.  Use it in concert with GCC to
! analyze your programs to help create more efficient, faster running code
! and to discover untested parts of your program.  You can use 'gcov' as a
! profiling tool to help discover where your optimization efforts will
! best affect your code.  You can also use 'gcov' along with the other
! profiling tool, 'gprof', to assess which parts of your code use the
! greatest amount of computing time.
  
   Profiling tools help you analyze your code's performance.  Using a
! profiler such as 'gcov' or 'gprof', you can find out some basic
  performance statistics, such as:
  
     * how often each line of code executes
*************** performance statistics, such as:
*** 44169,44175 ****
  
   Once you know these things about how your code works when compiled, you
  can look at each module to see which modules should be optimized.
! `gcov' helps you determine where to work on optimization.
  
   Software developers also use coverage testing in concert with
  testsuites, to make sure software is actually good enough for a release.
--- 43773,43779 ----
  
   Once you know these things about how your code works when compiled, you
  can look at each module to see which modules should be optimized.
! 'gcov' helps you determine where to work on optimization.
  
   Software developers also use coverage testing in concert with
  testsuites, to make sure software is actually good enough for a release.
*************** to be added to the testsuites to create
*** 44180,44317 ****
  final product.
  
   You should compile your code without optimization if you plan to use
! `gcov' because the optimization, by combining some lines of code into
  one function, may not give you as much information as you need to look
! for `hot spots' where the code is using a great deal of computer time.
! Likewise, because `gcov' accumulates statistics by line (at the lowest
! resolution), it works best with a programming style that places only
! one statement on each line.  If you use complicated macros that expand
! to loops or to other control structures, the statistics are less
  helpful--they only report on the line where the macro call appears.  If
  your complex macros behave like functions, you can replace them with
  inline functions to solve this problem.
  
!  `gcov' creates a logfile called `SOURCEFILE.gcov' which indicates how
! many times each line of a source file `SOURCEFILE.c' has executed.  You
! can use these logfiles along with `gprof' to aid in fine-tuning the
! performance of your programs.  `gprof' gives timing information you can
! use along with the information you get from `gcov'.
  
!  `gcov' works only on code compiled with GCC.  It is not compatible
! with any other profiling or test coverage mechanism.
  
  
  File: gcc.info,  Node: Invoking Gcov,  Next: Gcov and Optimization,  Prev: Gcov Intro,  Up: Gcov
  
! 10.2 Invoking `gcov'
  ====================
  
       gcov [OPTIONS] FILES
  
!  `gcov' accepts the following options:
! 
! `-h'
! `--help'
!      Display help about using `gcov' (on the standard output), and exit
!      without doing any further processing.
! 
! `-v'
! `--version'
!      Display the `gcov' version number (on the standard output), and
!      exit without doing any further processing.
  
! `-a'
! `--all-blocks'
       Write individual execution counts for every basic block.  Normally
       gcov outputs execution counts only for the main blocks of a line.
       With this option you can determine if blocks within a single line
       are not being executed.
  
! `-b'
! `--branch-probabilities'
       Write branch frequencies to the output file, and write branch
!      summary info to the standard output.  This option allows you to
!      see how often each branch in your program was taken.
!      Unconditional branches will not be shown, unless the `-u' option
!      is given.
  
! `-c'
! `--branch-counts'
       Write branch frequencies as the number of branches taken, rather
       than the percentage of branches taken.
  
! `-n'
! `--no-output'
!      Do not create the `gcov' output file.
! 
! `-l'
! `--long-file-names'
!      Create long file names for included source files.  For example, if
!      the header file `x.h' contains code, and was included in the file
!      `a.c', then running `gcov' on the file `a.c' will produce an
!      output file called `a.c##x.h.gcov' instead of `x.h.gcov'.  This
!      can be useful if `x.h' is included in multiple source files and
!      you want to see the individual contributions.  If you use the `-p'
!      option, both the including and included file names will be
!      complete path names.
! 
! `-p'
! `--preserve-paths'
!      Preserve complete path information in the names of generated
!      `.gcov' files.  Without this option, just the filename component is
!      used.  With this option, all directories are used, with `/'
!      characters translated to `#' characters, `.' directory components
!      removed and unremoveable `..' components renamed to `^'.  This is
!      useful if sourcefiles are in several different directories.
! 
! `-r'
! `--relative-only'
!      Only output information about source files with a relative pathname
!      (after source prefix elision).  Absolute paths are usually system
!      header files and coverage of any inline functions therein is
!      normally uninteresting.
  
! `-f'
! `--function-summaries'
       Output summaries for each function in addition to the file level
       summary.
  
! `-o DIRECTORY|FILE'
! `--object-directory DIRECTORY'
! `--object-file FILE'
!      Specify either the directory containing the gcov data files, or the
!      object path name.  The `.gcno', and `.gcda' data files are
!      searched for using this option.  If a directory is specified, the
!      data files are in that directory and named after the input file
!      name, without its extension.  If a file is specified here, the
!      data files are named after that file, without its extension.
! 
! `-s DIRECTORY'
! `--source-prefix DIRECTORY'
!      A prefix for source file names to remove when generating the output
!      coverage files.  This option is useful when building in a separate
!      directory, and the pathname to the source directory is not wanted
!      when determining the output file names.  Note that this prefix
!      detection is applied before determining whether the source file is
!      absolute.
! 
! `-u'
! `--unconditional-branches'
!      When branch probabilities are given, include those of
!      unconditional branches.  Unconditional branches are normally not
!      interesting.
! 
! `-d'
! `--display-progress'
!      Display the progress on the standard output.
  
! `-i'
! `--intermediate-format'
       Output gcov file in an easy-to-parse intermediate text format that
!      can be used by `lcov' or other tools. The output is a single
!      `.gcov' file per `.gcda' file. No source code is required.
  
!      The format of the intermediate `.gcov' file is plain text with one
       entry per line
  
            file:SOURCE_FILE_NAME
--- 43784,43859 ----
  final product.
  
   You should compile your code without optimization if you plan to use
! 'gcov' because the optimization, by combining some lines of code into
  one function, may not give you as much information as you need to look
! for 'hot spots' where the code is using a great deal of computer time.
! Likewise, because 'gcov' accumulates statistics by line (at the lowest
! resolution), it works best with a programming style that places only one
! statement on each line.  If you use complicated macros that expand to
! loops or to other control structures, the statistics are less
  helpful--they only report on the line where the macro call appears.  If
  your complex macros behave like functions, you can replace them with
  inline functions to solve this problem.
  
!  'gcov' creates a logfile called 'SOURCEFILE.gcov' which indicates how
! many times each line of a source file 'SOURCEFILE.c' has executed.  You
! can use these logfiles along with 'gprof' to aid in fine-tuning the
! performance of your programs.  'gprof' gives timing information you can
! use along with the information you get from 'gcov'.
  
!  'gcov' works only on code compiled with GCC.  It is not compatible with
! any other profiling or test coverage mechanism.
  
  
  File: gcc.info,  Node: Invoking Gcov,  Next: Gcov and Optimization,  Prev: Gcov Intro,  Up: Gcov
  
! 10.2 Invoking 'gcov'
  ====================
  
       gcov [OPTIONS] FILES
  
!  'gcov' accepts the following options:
  
! '-a'
! '--all-blocks'
       Write individual execution counts for every basic block.  Normally
       gcov outputs execution counts only for the main blocks of a line.
       With this option you can determine if blocks within a single line
       are not being executed.
  
! '-b'
! '--branch-probabilities'
       Write branch frequencies to the output file, and write branch
!      summary info to the standard output.  This option allows you to see
!      how often each branch in your program was taken.  Unconditional
!      branches will not be shown, unless the '-u' option is given.
  
! '-c'
! '--branch-counts'
       Write branch frequencies as the number of branches taken, rather
       than the percentage of branches taken.
  
! '-d'
! '--display-progress'
!      Display the progress on the standard output.
  
! '-f'
! '--function-summaries'
       Output summaries for each function in addition to the file level
       summary.
  
! '-h'
! '--help'
!      Display help about using 'gcov' (on the standard output), and exit
!      without doing any further processing.
  
! '-i'
! '--intermediate-format'
       Output gcov file in an easy-to-parse intermediate text format that
!      can be used by 'lcov' or other tools.  The output is a single
!      '.gcov' file per '.gcda' file.  No source code is required.
  
!      The format of the intermediate '.gcov' file is plain text with one
       entry per line
  
            file:SOURCE_FILE_NAME
*************** File: gcc.info,  Node: Invoking Gcov,  N
*** 44328,44334 ****
            file. All entries following a FILE pertain to that source file
            until the next FILE entry.
  
!      Here is a sample when `-i' is used in conjunction with `-b' option:
  
            file:array.cc
            function:11,1,_Z3sumRKSt6vectorIPiSaIS0_EE
--- 43870,43876 ----
            file. All entries following a FILE pertain to that source file
            until the next FILE entry.
  
!      Here is a sample when '-i' is used in conjunction with '-b' option:
  
            file:array.cc
            function:11,1,_Z3sumRKSt6vectorIPiSaIS0_EE
*************** File: gcc.info,  Node: Invoking Gcov,  N
*** 44340,44414 ****
            lcount:26,1
            branch:28,nottaken
  
! `-m'
! `--demangled-names'
!      Display demangled function names in output. The default is to show
       mangled function names.
  
  
!  `gcov' should be run with the current directory the same as that when
  you invoked the compiler.  Otherwise it will not be able to locate the
! source files.  `gcov' produces files called `MANGLEDNAME.gcov' in the
! current directory.  These contain the coverage information of the
! source file they correspond to.  One `.gcov' file is produced for each
! source (or header) file containing code, which was compiled to produce
! the data files.  The MANGLEDNAME part of the output file name is
! usually simply the source file name, but can be something more
! complicated if the `-l' or `-p' options are given.  Refer to those
! options for details.
  
!  If you invoke `gcov' with multiple input files, the contributions from
! each input file are summed.  Typically you would invoke it with the
! same list of files as the final link of your executable.
  
!  The `.gcov' files contain the `:' separated fields along with program
  source code.  The format is
  
       EXECUTION_COUNT:LINE_NUMBER:SOURCE LINE TEXT
  
   Additional block information may succeed each line, when requested by
! command line option.  The EXECUTION_COUNT is `-' for lines containing
! no code.  Unexecuted lines are marked `#####' or `====', depending on
  whether they are reachable by non-exceptional paths or only exceptional
! paths such as C++ exception handlers, respectively.
  
!  Some lines of information at the start have LINE_NUMBER of zero.
! These preamble lines are of the form
  
       -:0:TAG:VALUE
  
   The ordering and number of these preamble lines will be augmented as
! `gcov' development progresses -- do not rely on them remaining
  unchanged.  Use TAG to locate a particular preamble line.
  
   The additional block information is of the form
  
       TAG INFORMATION
  
!  The INFORMATION is human readable, but designed to be simple enough
! for machine parsing too.
  
   When printing percentages, 0% and 100% are only printed when the values
  are _exactly_ 0% and 100% respectively.  Other values which would
  conventionally be rounded to 0% or 100% are instead printed as the
  nearest non-boundary value.
  
!  When using `gcov', you must first compile your program with two
! special GCC options: `-fprofile-arcs -ftest-coverage'.  This tells the
! compiler to generate additional information needed by gcov (basically a
! flow graph of the program) and also includes additional code in the
! object files for generating the extra profiling information needed by
! gcov.  These additional files are placed in the directory where the
! object file is located.
  
   Running the program will cause profile output to be generated.  For
! each source file compiled with `-fprofile-arcs', an accompanying
! `.gcda' file will be placed in the object file directory.
  
!  Running `gcov' with your program's source file names as arguments will
  now produce a listing of the code along with frequency of execution for
! each line.  For example, if your program is called `tmp.c', this is
! what you see when you use the basic `gcov' facility:
  
       $ gcc -fprofile-arcs -ftest-coverage tmp.c
       $ a.out
--- 43882,44029 ----
            lcount:26,1
            branch:28,nottaken
  
! '-l'
! '--long-file-names'
!      Create long file names for included source files.  For example, if
!      the header file 'x.h' contains code, and was included in the file
!      'a.c', then running 'gcov' on the file 'a.c' will produce an output
!      file called 'a.c##x.h.gcov' instead of 'x.h.gcov'.  This can be
!      useful if 'x.h' is included in multiple source files and you want
!      to see the individual contributions.  If you use the '-p' option,
!      both the including and included file names will be complete path
!      names.
! 
! '-m'
! '--demangled-names'
!      Display demangled function names in output.  The default is to show
       mangled function names.
  
+ '-n'
+ '--no-output'
+      Do not create the 'gcov' output file.
  
! '-o DIRECTORY|FILE'
! '--object-directory DIRECTORY'
! '--object-file FILE'
!      Specify either the directory containing the gcov data files, or the
!      object path name.  The '.gcno', and '.gcda' data files are searched
!      for using this option.  If a directory is specified, the data files
!      are in that directory and named after the input file name, without
!      its extension.  If a file is specified here, the data files are
!      named after that file, without its extension.
! 
! '-p'
! '--preserve-paths'
!      Preserve complete path information in the names of generated
!      '.gcov' files.  Without this option, just the filename component is
!      used.  With this option, all directories are used, with '/'
!      characters translated to '#' characters, '.' directory components
!      removed and unremoveable '..' components renamed to '^'.  This is
!      useful if sourcefiles are in several different directories.
! 
! '-r'
! '--relative-only'
!      Only output information about source files with a relative pathname
!      (after source prefix elision).  Absolute paths are usually system
!      header files and coverage of any inline functions therein is
!      normally uninteresting.
! 
! '-s DIRECTORY'
! '--source-prefix DIRECTORY'
!      A prefix for source file names to remove when generating the output
!      coverage files.  This option is useful when building in a separate
!      directory, and the pathname to the source directory is not wanted
!      when determining the output file names.  Note that this prefix
!      detection is applied before determining whether the source file is
!      absolute.
! 
! '-u'
! '--unconditional-branches'
!      When branch probabilities are given, include those of unconditional
!      branches.  Unconditional branches are normally not interesting.
! 
! '-v'
! '--version'
!      Display the 'gcov' version number (on the standard output), and
!      exit without doing any further processing.
! 
! '-w'
! '--verbose'
!      Print verbose informations related to basic blocks and arcs.
! 
! '-x'
! '--hash-filenames'
!      By default, gcov uses the full pathname of the source files to to
!      create an output filename.  This can lead to long filenames that
!      can overflow filesystem limits.  This option creates names of the
!      form 'SOURCE-FILE##MD5.gcov', where the SOURCE-FILE component is
!      the final filename part and the MD5 component is calculated from
!      the full mangled name that would have been used otherwise.
! 
!  'gcov' should be run with the current directory the same as that when
  you invoked the compiler.  Otherwise it will not be able to locate the
! source files.  'gcov' produces files called 'MANGLEDNAME.gcov' in the
! current directory.  These contain the coverage information of the source
! file they correspond to.  One '.gcov' file is produced for each source
! (or header) file containing code, which was compiled to produce the data
! files.  The MANGLEDNAME part of the output file name is usually simply
! the source file name, but can be something more complicated if the '-l'
! or '-p' options are given.  Refer to those options for details.
  
!  If you invoke 'gcov' with multiple input files, the contributions from
! each input file are summed.  Typically you would invoke it with the same
! list of files as the final link of your executable.
  
!  The '.gcov' files contain the ':' separated fields along with program
  source code.  The format is
  
       EXECUTION_COUNT:LINE_NUMBER:SOURCE LINE TEXT
  
   Additional block information may succeed each line, when requested by
! command line option.  The EXECUTION_COUNT is '-' for lines containing no
! code.  Unexecuted lines are marked '#####' or '====', depending on
  whether they are reachable by non-exceptional paths or only exceptional
! paths such as C++ exception handlers, respectively.  Given '-a' option,
! unexecuted blocks are marked '$$$$$' or '%%%%%', depending on whether a
! basic block is reachable via non-exceptional or exceptional paths.
  
!  Some lines of information at the start have LINE_NUMBER of zero.  These
! preamble lines are of the form
  
       -:0:TAG:VALUE
  
   The ordering and number of these preamble lines will be augmented as
! 'gcov' development progresses -- do not rely on them remaining
  unchanged.  Use TAG to locate a particular preamble line.
  
   The additional block information is of the form
  
       TAG INFORMATION
  
!  The INFORMATION is human readable, but designed to be simple enough for
! machine parsing too.
  
   When printing percentages, 0% and 100% are only printed when the values
  are _exactly_ 0% and 100% respectively.  Other values which would
  conventionally be rounded to 0% or 100% are instead printed as the
  nearest non-boundary value.
  
!  When using 'gcov', you must first compile your program with two special
! GCC options: '-fprofile-arcs -ftest-coverage'.  This tells the compiler
! to generate additional information needed by gcov (basically a flow
! graph of the program) and also includes additional code in the object
! files for generating the extra profiling information needed by gcov.
! These additional files are placed in the directory where the object file
! is located.
  
   Running the program will cause profile output to be generated.  For
! each source file compiled with '-fprofile-arcs', an accompanying '.gcda'
! file will be placed in the object file directory.
  
!  Running 'gcov' with your program's source file names as arguments will
  now produce a listing of the code along with frequency of execution for
! each line.  For example, if your program is called 'tmp.c', this is what
! you see when you use the basic 'gcov' facility:
  
       $ gcc -fprofile-arcs -ftest-coverage tmp.c
       $ a.out
*************** what you see when you use the basic `gco
*** 44416,44422 ****
       90.00% of 10 source lines executed in file tmp.c
       Creating tmp.c.gcov.
  
!  The file `tmp.c.gcov' contains output from `gcov'.  Here is a sample:
  
               -:    0:Source:tmp.c
               -:    0:Graph:tmp.gcno
--- 44031,44037 ----
       90.00% of 10 source lines executed in file tmp.c
       Creating tmp.c.gcov.
  
!  The file 'tmp.c.gcov' contains output from 'gcov'.  Here is a sample:
  
               -:    0:Source:tmp.c
               -:    0:Graph:tmp.gcno
*************** what you see when you use the basic `gco
*** 44441,44448 ****
               1:   16:  return 0;
               -:   17:}
  
!  When you use the `-a' option, you will get individual block counts,
! and the output looks like this:
  
               -:    0:Source:tmp.c
               -:    0:Graph:tmp.gcno
--- 44056,44063 ----
               1:   16:  return 0;
               -:   17:}
  
!  When you use the '-a' option, you will get individual block counts, and
! the output looks like this:
  
               -:    0:Source:tmp.c
               -:    0:Graph:tmp.gcno
*************** contain code, unless previous blocks end
*** 44481,44493 ****
  execution count of a line is shown and subsequent lines show the
  execution counts for individual blocks that end on that line.  After
  each block, the branch and call counts of the block will be shown, if
! the `-b' option is given.
  
   Because of the way GCC instruments calls, a call count can be shown
  after a line with no individual blocks.  As you can see, line 13
  contains a basic block that was not executed.
  
!  When you use the `-b' option, your output looks like this:
  
       $ gcov -b tmp.c
       90.00% of 10 source lines executed in file tmp.c
--- 44096,44108 ----
  execution count of a line is shown and subsequent lines show the
  execution counts for individual blocks that end on that line.  After
  each block, the branch and call counts of the block will be shown, if
! the '-b' option is given.
  
   Because of the way GCC instruments calls, a call count can be shown
  after a line with no individual blocks.  As you can see, line 13
  contains a basic block that was not executed.
  
!  When you use the '-b' option, your output looks like this:
  
       $ gcov -b tmp.c
       90.00% of 10 source lines executed in file tmp.c
*************** contains a basic block that was not exec
*** 44496,44502 ****
       50.00% of 2 calls executed in file tmp.c
       Creating tmp.c.gcov.
  
!  Here is a sample of a resulting `tmp.c.gcov' file:
  
               -:    0:Source:tmp.c
               -:    0:Graph:tmp.gcno
--- 44111,44117 ----
       50.00% of 2 calls executed in file tmp.c
       Creating tmp.c.gcov.
  
!  Here is a sample of a resulting 'tmp.c.gcov' file:
  
               -:    0:Source:tmp.c
               -:    0:Graph:tmp.gcno
*************** function's blocks were executed.
*** 44534,44545 ****
  
   For each basic block, a line is printed after the last line of the
  basic block describing the branch or call that ends the basic block.
! There can be multiple branches and calls listed for a single source
! line if there are multiple basic blocks that end on that line.  In this
! case, the branches and calls are each given a number.  There is no
! simple way to map these branches and calls back to source constructs.
! In general, though, the lowest numbered branch or call will correspond
! to the leftmost construct on the source line.
  
   For a branch, if it was executed at least once, then a percentage
  indicating the number of times the branch was taken divided by the
--- 44149,44160 ----
  
   For each basic block, a line is printed after the last line of the
  basic block describing the branch or call that ends the basic block.
! There can be multiple branches and calls listed for a single source line
! if there are multiple basic blocks that end on that line.  In this case,
! the branches and calls are each given a number.  There is no simple way
! to map these branches and calls back to source constructs.  In general,
! though, the lowest numbered branch or call will correspond to the
! leftmost construct on the source line.
  
   For a branch, if it was executed at least once, then a percentage
  indicating the number of times the branch was taken divided by the
*************** message "never executed" is printed.
*** 44549,44559 ****
   For a call, if it was executed at least once, then a percentage
  indicating the number of times the call returned divided by the number
  of times the call was executed will be printed.  This will usually be
! 100%, but may be less for functions that call `exit' or `longjmp', and
  thus may not return every time they are called.
  
   The execution counts are cumulative.  If the example program were
! executed again without removing the `.gcda' file, the count for the
  number of times each line in the source was executed would be added to
  the results of the previous run(s).  This is potentially useful in
  several ways.  For example, it could be used to accumulate data over a
--- 44164,44174 ----
   For a call, if it was executed at least once, then a percentage
  indicating the number of times the call returned divided by the number
  of times the call was executed will be printed.  This will usually be
! 100%, but may be less for functions that call 'exit' or 'longjmp', and
  thus may not return every time they are called.
  
   The execution counts are cumulative.  If the example program were
! executed again without removing the '.gcda' file, the count for the
  number of times each line in the source was executed would be added to
  the results of the previous run(s).  This is potentially useful in
  several ways.  For example, it could be used to accumulate data over a
*************** number of program runs as part of a test
*** 44561,44569 ****
  provide more accurate long-term information over a large number of
  program runs.
  
!  The data in the `.gcda' files is saved immediately before the program
! exits.  For each source file compiled with `-fprofile-arcs', the
! profiling code first attempts to read in an existing `.gcda' file; if
  the file doesn't match the executable (differing number of basic block
  counts) it will ignore the contents of the file.  It then adds in the
  new execution counts and finally writes the data to the file.
--- 44176,44184 ----
  provide more accurate long-term information over a large number of
  program runs.
  
!  The data in the '.gcda' files is saved immediately before the program
! exits.  For each source file compiled with '-fprofile-arcs', the
! profiling code first attempts to read in an existing '.gcda' file; if
  the file doesn't match the executable (differing number of basic block
  counts) it will ignore the contents of the file.  It then adds in the
  new execution counts and finally writes the data to the file.
*************** new execution counts and finally writes
*** 44571,44585 ****
  
  File: gcc.info,  Node: Gcov and Optimization,  Next: Gcov Data Files,  Prev: Invoking Gcov,  Up: Gcov
  
! 10.3 Using `gcov' with GCC Optimization
  =======================================
  
! If you plan to use `gcov' to help optimize your code, you must first
! compile your program with two special GCC options: `-fprofile-arcs
  -ftest-coverage'.  Aside from that, you can use any other GCC options;
  but if you want to prove that every single line in your program was
! executed, you should not compile with optimization at the same time.
! On some machines the optimizer can eliminate some simple code lines by
  combining them with other lines.  For example, code like this:
  
       if (a != b)
--- 44186,44200 ----
  
  File: gcc.info,  Node: Gcov and Optimization,  Next: Gcov Data Files,  Prev: Invoking Gcov,  Up: Gcov
  
! 10.3 Using 'gcov' with GCC Optimization
  =======================================
  
! If you plan to use 'gcov' to help optimize your code, you must first
! compile your program with two special GCC options: '-fprofile-arcs
  -ftest-coverage'.  Aside from that, you can use any other GCC options;
  but if you want to prove that every single line in your program was
! executed, you should not compile with optimization at the same time.  On
! some machines the optimizer can eliminate some simple code lines by
  combining them with other lines.  For example, code like this:
  
       if (a != b)
*************** combining them with other lines.  For ex
*** 44588,44596 ****
         c = 0;
  
  can be compiled into one instruction on some machines.  In this case,
! there is no way for `gcov' to calculate separate execution counts for
  each line because there isn't separate code for each line.  Hence the
! `gcov' output looks like this if you compiled the program with
  optimization:
  
             100:   12:if (a != b)
--- 44203,44211 ----
         c = 0;
  
  can be compiled into one instruction on some machines.  In this case,
! there is no way for 'gcov' to calculate separate execution counts for
  each line because there isn't separate code for each line.  Hence the
! 'gcov' output looks like this if you compiled the program with
  optimization:
  
             100:   12:if (a != b)
*************** shown depends on where the function is i
*** 44610,44624 ****
  at all.
  
   If the function is not inlined, the compiler must emit an out of line
! copy of the function, in any object file that needs it.  If `fileA.o'
! and `fileB.o' both contain out of line bodies of a particular
! inlineable function, they will also both contain coverage counts for
! that function.  When `fileA.o' and `fileB.o' are linked together, the
! linker will, on many systems, select one of those out of line bodies
! for all calls to that function, and remove or ignore the other.
! Unfortunately, it will not remove the coverage counters for the unused
! function body.  Hence when instrumented, all but one use of that
! function will show zero counts.
  
   If the function is inlined in several places, the block structure in
  each location might not be the same.  For instance, a condition might
--- 44225,44239 ----
  at all.
  
   If the function is not inlined, the compiler must emit an out of line
! copy of the function, in any object file that needs it.  If 'fileA.o'
! and 'fileB.o' both contain out of line bodies of a particular inlineable
! function, they will also both contain coverage counts for that function.
! When 'fileA.o' and 'fileB.o' are linked together, the linker will, on
! many systems, select one of those out of line bodies for all calls to
! that function, and remove or ignore the other.  Unfortunately, it will
! not remove the coverage counters for the unused function body.  Hence
! when instrumented, all but one use of that function will show zero
! counts.
  
   If the function is inlined in several places, the block structure in
  each location might not be the same.  For instance, a condition might
*************** now be calculable at compile time in som
*** 44626,44665 ****
  coverage of all the uses of the inline function will be shown for the
  same source lines, the line counts themselves might seem inconsistent.
  
!  Long-running applications can use the `_gcov_reset' and `_gcov_dump'
  facilities to restrict profile collection to the program region of
! interest. Calling `_gcov_reset(void)' will clear all profile counters
! to zero, and calling `_gcov_dump(void)' will cause the profile
! information collected at that point to be dumped to `.gcda' output
  files.
  
  
  File: gcc.info,  Node: Gcov Data Files,  Next: Cross-profiling,  Prev: Gcov and Optimization,  Up: Gcov
  
! 10.4 Brief Description of `gcov' Data Files
  ===========================================
  
! `gcov' uses two files for profiling.  The names of these files are
  derived from the original _object_ file by substituting the file suffix
! with either `.gcno', or `.gcda'.  The files contain coverage and
! profile data stored in a platform-independent format.  The `.gcno'
! files are placed in the same directory as the object file.  By default,
! the `.gcda' files are also stored in the same directory as the object
! file, but the GCC `-fprofile-dir' option may be used to store the
! `.gcda' files in a separate directory.
  
!  The `.gcno' notes file is generated when the source file is compiled
! with the GCC `-ftest-coverage' option.  It contains information to
  reconstruct the basic block graphs and assign source line numbers to
  blocks.
  
!  The `.gcda' count data file is generated when a program containing
! object files built with the GCC `-fprofile-arcs' option is executed.  A
! separate `.gcda' file is created for each object file compiled with
! this option.  It contains arc transition counts, value profile counts,
! and some summary information.
  
!  The full details of the file format is specified in `gcov-io.h', and
  functions provided in that header file should be used to access the
  coverage files.
  
--- 44241,44280 ----
  coverage of all the uses of the inline function will be shown for the
  same source lines, the line counts themselves might seem inconsistent.
  
!  Long-running applications can use the '_gcov_reset' and '_gcov_dump'
  facilities to restrict profile collection to the program region of
! interest.  Calling '_gcov_reset(void)' will clear all profile counters
! to zero, and calling '_gcov_dump(void)' will cause the profile
! information collected at that point to be dumped to '.gcda' output
  files.
  
  
  File: gcc.info,  Node: Gcov Data Files,  Next: Cross-profiling,  Prev: Gcov and Optimization,  Up: Gcov
  
! 10.4 Brief Description of 'gcov' Data Files
  ===========================================
  
! 'gcov' uses two files for profiling.  The names of these files are
  derived from the original _object_ file by substituting the file suffix
! with either '.gcno', or '.gcda'.  The files contain coverage and profile
! data stored in a platform-independent format.  The '.gcno' files are
! placed in the same directory as the object file.  By default, the
! '.gcda' files are also stored in the same directory as the object file,
! but the GCC '-fprofile-dir' option may be used to store the '.gcda'
! files in a separate directory.
  
!  The '.gcno' notes file is generated when the source file is compiled
! with the GCC '-ftest-coverage' option.  It contains information to
  reconstruct the basic block graphs and assign source line numbers to
  blocks.
  
!  The '.gcda' count data file is generated when a program containing
! object files built with the GCC '-fprofile-arcs' option is executed.  A
! separate '.gcda' file is created for each object file compiled with this
! option.  It contains arc transition counts, value profile counts, and
! some summary information.
  
!  The full details of the file format is specified in 'gcov-io.h', and
  functions provided in that header file should be used to access the
  coverage files.
  
*************** File: gcc.info,  Node: Cross-profiling,
*** 44670,44715 ****
  ====================================================
  
  Running the program will cause profile output to be generated.  For each
! source file compiled with `-fprofile-arcs', an accompanying `.gcda'
! file will be placed in the object file directory. That implicitly
! requires running the program on the same system as it was built or
! having the same absolute directory structure on the target system. The
! program will try to create the needed directory structure, if it is not
! already present.
  
!  To support cross-profiling, a program compiled with `-fprofile-arcs'
  can relocate the data files based on two environment variables:
  
!    * GCOV_PREFIX contains the prefix to add to the absolute paths in
!      the object file. Prefix can be absolute, or relative.  The default
!      is no prefix.
  
!    * GCOV_PREFIX_STRIP indicates the how many initial directory names
!      to strip off the hardwired absolute paths. Default value is 0.
  
       _Note:_ If GCOV_PREFIX_STRIP is set without GCOV_PREFIX is
!      undefined,  then a relative path is made out of the hardwired
       absolute paths.
  
!  For example, if the object file `/user/build/foo.o' was built with
! `-fprofile-arcs', the final executable will try to create the data file
! `/user/build/foo.gcda' when running on the target system.  This will
  fail if the corresponding directory does not exist and it is unable to
  create it.  This can be overcome by, for example, setting the
! environment as `GCOV_PREFIX=/target/run' and `GCOV_PREFIX_STRIP=1'.
! Such a setting will name the data file `/target/run/build/foo.gcda'.
  
   You must move the data files to the expected directory tree in order to
! use them for profile directed optimizations (`--use-profile'), or to
! use the `gcov' tool.
  
  
! File: gcc.info,  Node: Gcov-tool,  Next: Trouble,  Prev: Gcov,  Up: Top
  
! 11 `gcov-tool'--an Offline Gcda Profile Processing Tool
  *******************************************************
  
! `gcov-tool' is a tool you can use in conjunction with GCC to manipulate
  or process gcda profile files offline.
  
  * Menu:
--- 44285,44330 ----
  ====================================================
  
  Running the program will cause profile output to be generated.  For each
! source file compiled with '-fprofile-arcs', an accompanying '.gcda' file
! will be placed in the object file directory.  That implicitly requires
! running the program on the same system as it was built or having the
! same absolute directory structure on the target system.  The program
! will try to create the needed directory structure, if it is not already
! present.
  
!  To support cross-profiling, a program compiled with '-fprofile-arcs'
  can relocate the data files based on two environment variables:
  
!    * GCOV_PREFIX contains the prefix to add to the absolute paths in the
!      object file.  Prefix can be absolute, or relative.  The default is
!      no prefix.
  
!    * GCOV_PREFIX_STRIP indicates the how many initial directory names to
!      strip off the hardwired absolute paths.  Default value is 0.
  
       _Note:_ If GCOV_PREFIX_STRIP is set without GCOV_PREFIX is
!      undefined, then a relative path is made out of the hardwired
       absolute paths.
  
!  For example, if the object file '/user/build/foo.o' was built with
! '-fprofile-arcs', the final executable will try to create the data file
! '/user/build/foo.gcda' when running on the target system.  This will
  fail if the corresponding directory does not exist and it is unable to
  create it.  This can be overcome by, for example, setting the
! environment as 'GCOV_PREFIX=/target/run' and 'GCOV_PREFIX_STRIP=1'.
! Such a setting will name the data file '/target/run/build/foo.gcda'.
  
   You must move the data files to the expected directory tree in order to
! use them for profile directed optimizations ('-fprofile-use'), or to use
! the 'gcov' tool.
  
  
! File: gcc.info,  Node: Gcov-tool,  Next: Gcov-dump,  Prev: Gcov,  Up: Top
  
! 11 'gcov-tool'--an Offline Gcda Profile Processing Tool
  *******************************************************
  
! 'gcov-tool' is a tool you can use in conjunction with GCC to manipulate
  or process gcda profile files offline.
  
  * Menu:
*************** or process gcda profile files offline.
*** 44720,44740 ****
  
  File: gcc.info,  Node: Gcov-tool Intro,  Next: Invoking Gcov-tool,  Up: Gcov-tool
  
! 11.1 Introduction to `gcov-tool'
  ================================
  
! `gcov-tool' is an offline tool to process gcc's gcda profile files.
  
   Current gcov-tool supports the following functionalities:
  
     * merge two sets of profiles with weights.
  
!    * read one set of profile and rewrite profile contents. One can
       scale or normalize the count values.
  
   Examples of the use cases for this tool are:
!    * Collect the profiles for different set of inputs, and use this
!      tool to merge them. One can specify the weight to factor in the
       relative importance of each input.
  
     * Rewrite the profile after removing a subset of the gcda files,
--- 44335,44355 ----
  
  File: gcc.info,  Node: Gcov-tool Intro,  Next: Invoking Gcov-tool,  Up: Gcov-tool
  
! 11.1 Introduction to 'gcov-tool'
  ================================
  
! 'gcov-tool' is an offline tool to process gcc's gcda profile files.
  
   Current gcov-tool supports the following functionalities:
  
     * merge two sets of profiles with weights.
  
!    * read one set of profile and rewrite profile contents.  One can
       scale or normalize the count values.
  
   Examples of the use cases for this tool are:
!    * Collect the profiles for different set of inputs, and use this tool
!      to merge them.  One can specify the weight to factor in the
       relative importance of each input.
  
     * Rewrite the profile after removing a subset of the gcda files,
*************** File: gcc.info,  Node: Gcov-tool Intro,
*** 44744,44873 ****
       the majority code as the runtime library.
  
   Note that for the merging operation, this profile generated offline may
! contain slight different values from the online merged profile. Here are
! a list of typical differences:
  
     * histogram difference: This offline tool recomputes the histogram
!      after merging the counters. The resulting histogram, therefore, is
!      precise. The online merging does not have this capability - the
       histogram is merged from two histograms and the result is an
       approximation.
  
     * summary checksum difference: Summary checksum uses a CRC32
!      operation. The value depends on the link list order of gcov-info
!      objects. This order is different in gcov-tool from that in the
!      online merge. It's expected to have different summary checksums.
       It does not really matter as the compiler does not use this
       checksum anywhere.
  
     * value profile counter values difference: Some counter values for
!      value profile are runtime dependent, like heap addresses. It's
       normal to see some difference in these kind of counters.
  
  
  File: gcc.info,  Node: Invoking Gcov-tool,  Prev: Gcov-tool Intro,  Up: Gcov-tool
  
! 11.2 Invoking `gcov-tool'
  =========================
  
       gcov-tool [GLOBAL-OPTIONS] SUB_COMMAND [SUB_COMMAND-OPTIONS] PROFILE_DIR
  
!  `gcov-tool' accepts the following options:
  
! `-h'
! `--help'
!      Display help about using `gcov-tool' (on the standard output), and
       exit without doing any further processing.
  
! `-v'
! `--version'
!      Display the `gcov-tool' version number (on the standard output),
       and exit without doing any further processing.
  
! `merge'
       Merge two profile directories.
  
!     `-v'
!     `--verbose'
!           Set the verbose mode.
! 
!     `-o DIRECTORY'
!     `--output DIRECTORY'
!           Set the output profile directory. Default output directory
            name is MERGED_PROFILE.
  
!     `-w W1,W2'
!     `--weight W1,W2'
            Set the merge weights of the DIRECTORY1 and DIRECTORY2,
!           respectively. The default weights are 1 for both.
  
! `rewrite'
       Read the specified profile directory and rewrite to a new
       directory.
  
!     `-v'
!     `--verbose'
!           Set the verbose mode.
  
!     `-o DIRECTORY'
!     `--output DIRECTORY'
!           Set the output profile directory. Default output name is
            REWRITE_PROFILE.
  
!     `-s FLOAT_OR_SIMPLE-FRAC_VALUE'
!     `--scale FLOAT_OR_SIMPLE-FRAC_VALUE'
!           Scale the profile counters. The specified value can be in
            floating point value, or simple fraction value form, such 1,
            2, 2/3, and 5/3.
  
!     `-n LONG_LONG_VALUE'
!     `--normalize <long_long_value>'
!           Normalize the profile. The specified value is the max counter
!           value in the new profile.
  
! `overlap'
       Computer the overlap score between the two specified profile
       directories.  The overlap score is computed based on the arc
!      profiles. It is defined as the sum of min (p1_counter[i] /
       p1_sum_all, p2_counter[i] / p2_sum_all), for all arc counter i,
       where p1_counter[i] and p2_counter[i] are two matched counters and
       p1_sum_all and p2_sum_all are the sum of counter values in profile
       1 and profile 2, respectively.
  
!     `-v'
!     `--verbose'
!           Set the verbose mode.
! 
!     `-h'
!     `--hotonly'
!           Only print info for hot objects/functions.
! 
!     `-f'
!     `--function'
            Print function level overlap score.
  
!     `-F'
!     `--fullname'
            Print full gcda filename.
  
!     `-o'
!     `--object'
            Print object level overlap score.
  
!     `-t FLOAT'
!     `--hot_threshold <float>'
            Set the threshold for hot counter value.
  
  
  
! File: gcc.info,  Node: Trouble,  Next: Bugs,  Prev: Gcov-tool,  Up: Top
  
! 12 Known Causes of Trouble with GCC
  ***********************************
  
! This section describes known problems that affect users of GCC.  Most
! of these are not GCC bugs per se--if they were, we would fix them.  But
! the result for a user may be like the result of a bug.
  
   Some of these problems are due to bugs in other software, some are
  missing features that are too much work to add, and some are places
--- 44359,44539 ----
       the majority code as the runtime library.
  
   Note that for the merging operation, this profile generated offline may
! contain slight different values from the online merged profile.  Here
! are a list of typical differences:
  
     * histogram difference: This offline tool recomputes the histogram
!      after merging the counters.  The resulting histogram, therefore, is
!      precise.  The online merging does not have this capability - the
       histogram is merged from two histograms and the result is an
       approximation.
  
     * summary checksum difference: Summary checksum uses a CRC32
!      operation.  The value depends on the link list order of gcov-info
!      objects.  This order is different in gcov-tool from that in the
!      online merge.  It's expected to have different summary checksums.
       It does not really matter as the compiler does not use this
       checksum anywhere.
  
     * value profile counter values difference: Some counter values for
!      value profile are runtime dependent, like heap addresses.  It's
       normal to see some difference in these kind of counters.
  
  
  File: gcc.info,  Node: Invoking Gcov-tool,  Prev: Gcov-tool Intro,  Up: Gcov-tool
  
! 11.2 Invoking 'gcov-tool'
  =========================
  
       gcov-tool [GLOBAL-OPTIONS] SUB_COMMAND [SUB_COMMAND-OPTIONS] PROFILE_DIR
  
!  'gcov-tool' accepts the following options:
  
! '-h'
! '--help'
!      Display help about using 'gcov-tool' (on the standard output), and
       exit without doing any further processing.
  
! '-v'
! '--version'
!      Display the 'gcov-tool' version number (on the standard output),
       and exit without doing any further processing.
  
! 'merge'
       Merge two profile directories.
  
!      '-o DIRECTORY'
!      '--output DIRECTORY'
!           Set the output profile directory.  Default output directory
            name is MERGED_PROFILE.
  
!      '-v'
!      '--verbose'
!           Set the verbose mode.
! 
!      '-w W1,W2'
!      '--weight W1,W2'
            Set the merge weights of the DIRECTORY1 and DIRECTORY2,
!           respectively.  The default weights are 1 for both.
  
! 'rewrite'
       Read the specified profile directory and rewrite to a new
       directory.
  
!      '-n LONG_LONG_VALUE'
!      '--normalize <long_long_value>'
!           Normalize the profile.  The specified value is the max counter
!           value in the new profile.
  
!      '-o DIRECTORY'
!      '--output DIRECTORY'
!           Set the output profile directory.  Default output name is
            REWRITE_PROFILE.
  
!      '-s FLOAT_OR_SIMPLE-FRAC_VALUE'
!      '--scale FLOAT_OR_SIMPLE-FRAC_VALUE'
!           Scale the profile counters.  The specified value can be in
            floating point value, or simple fraction value form, such 1,
            2, 2/3, and 5/3.
  
!      '-v'
!      '--verbose'
!           Set the verbose mode.
  
! 'overlap'
       Computer the overlap score between the two specified profile
       directories.  The overlap score is computed based on the arc
!      profiles.  It is defined as the sum of min (p1_counter[i] /
       p1_sum_all, p2_counter[i] / p2_sum_all), for all arc counter i,
       where p1_counter[i] and p2_counter[i] are two matched counters and
       p1_sum_all and p2_sum_all are the sum of counter values in profile
       1 and profile 2, respectively.
  
!      '-f'
!      '--function'
            Print function level overlap score.
  
!      '-F'
!      '--fullname'
            Print full gcda filename.
  
!      '-h'
!      '--hotonly'
!           Only print info for hot objects/functions.
! 
!      '-o'
!      '--object'
            Print object level overlap score.
  
!      '-t FLOAT'
!      '--hot_threshold <float>'
            Set the threshold for hot counter value.
  
+      '-v'
+      '--verbose'
+           Set the verbose mode.
  
  
! File: gcc.info,  Node: Gcov-dump,  Next: Trouble,  Prev: Gcov-tool,  Up: Top
  
! 12 'gcov-dump'--an Offline Gcda and Gcno Profile Dump Tool
! **********************************************************
! 
! * Menu:
! 
! * Gcov-dump Intro::             Introduction to gcov-dump.
! * Invoking Gcov-dump::          How to use gcov-dump.
! 
! 
! File: gcc.info,  Node: Gcov-dump Intro,  Next: Invoking Gcov-dump,  Up: Gcov-dump
! 
! 12.1 Introduction to 'gcov-dump'
! ================================
! 
! 'gcov-dump' is a tool you can use in conjunction with GCC to dump
! content of gcda and gcno profile files offline.
! 
! 
! File: gcc.info,  Node: Invoking Gcov-dump,  Prev: Gcov-dump Intro,  Up: Gcov-dump
! 
! 12.2 Invoking 'gcov-dump'
! =========================
! 
!      Usage: gcov-dump [OPTION] ... GCOVFILES
! 
!  'gcov-dump' accepts the following options:
! 
! '-h'
! '--help'
!      Display help about using 'gcov-dump' (on the standard output), and
!      exit without doing any further processing.
! 
! '-l'
! '--long'
!      Dump content of records.
! 
! '-p'
! '--positions'
!      Dump positions of records.
! 
! '-v'
! '--version'
!      Display the 'gcov-dump' version number (on the standard output),
!      and exit without doing any further processing.
! 
! '-w'
! '--working-sets'
!      Dump working set computed from summary.
! 
! 
! File: gcc.info,  Node: Trouble,  Next: Bugs,  Prev: Gcov-dump,  Up: Top
! 
! 13 Known Causes of Trouble with GCC
  ***********************************
  
! This section describes known problems that affect users of GCC.  Most of
! these are not GCC bugs per se--if they were, we would fix them.  But the
! result for a user may be like the result of a bug.
  
   Some of these problems are due to bugs in other software, some are
  missing features that are too much work to add, and some are places
*************** where people's opinions differ as to wha
*** 44892,44919 ****
  
  File: gcc.info,  Node: Actual Bugs,  Next: Interoperation,  Up: Trouble
  
! 12.1 Actual Bugs We Haven't Fixed Yet
  =====================================
  
!    * The `fixincludes' script interacts badly with automounters; if the
       directory of system header files is automounted, it tends to be
!      unmounted while `fixincludes' is running.  This would seem to be a
       bug in the automounter.  We don't know any good way to work around
       it.
  
  
  File: gcc.info,  Node: Interoperation,  Next: Incompatibilities,  Prev: Actual Bugs,  Up: Trouble
  
! 12.2 Interoperation
  ===================
  
  This section lists various difficulties encountered in using GCC
! together with other compilers or with the assemblers, linkers,
! libraries and debuggers on certain systems.
  
     * On many platforms, GCC supports a different ABI for C++ than do
!      other compilers, so the object files compiled by GCC cannot be
!      used with object files generated by another C++ compiler.
  
       An area where the difference is most apparent is name mangling.
       The use of different name mangling is intentional, to protect you
--- 44558,44585 ----
  
  File: gcc.info,  Node: Actual Bugs,  Next: Interoperation,  Up: Trouble
  
! 13.1 Actual Bugs We Haven't Fixed Yet
  =====================================
  
!    * The 'fixincludes' script interacts badly with automounters; if the
       directory of system header files is automounted, it tends to be
!      unmounted while 'fixincludes' is running.  This would seem to be a
       bug in the automounter.  We don't know any good way to work around
       it.
  
  
  File: gcc.info,  Node: Interoperation,  Next: Incompatibilities,  Prev: Actual Bugs,  Up: Trouble
  
! 13.2 Interoperation
  ===================
  
  This section lists various difficulties encountered in using GCC
! together with other compilers or with the assemblers, linkers, libraries
! and debuggers on certain systems.
  
     * On many platforms, GCC supports a different ABI for C++ than do
!      other compilers, so the object files compiled by GCC cannot be used
!      with object files generated by another C++ compiler.
  
       An area where the difference is most apparent is name mangling.
       The use of different name mangling is intentional, to protect you
*************** libraries and debuggers on certain syste
*** 44930,44943 ****
       profiling causes static variable destructors (currently used only
       in C++) not to be run.
  
!    * On a SPARC, GCC aligns all values of type `double' on an 8-byte
!      boundary, and it expects every `double' to be so aligned.  The Sun
!      compiler usually gives `double' values 8-byte alignment, with one
!      exception: function arguments of type `double' may not be aligned.
  
       As a result, if a function compiled with Sun CC takes the address
!      of an argument of type `double' and passes this pointer of type
!      `double *' to a function compiled with GCC, dereferencing the
       pointer may cause a fatal signal.
  
       One way to solve this problem is to compile your entire program
--- 44596,44609 ----
       profiling causes static variable destructors (currently used only
       in C++) not to be run.
  
!    * On a SPARC, GCC aligns all values of type 'double' on an 8-byte
!      boundary, and it expects every 'double' to be so aligned.  The Sun
!      compiler usually gives 'double' values 8-byte alignment, with one
!      exception: function arguments of type 'double' may not be aligned.
  
       As a result, if a function compiled with Sun CC takes the address
!      of an argument of type 'double' and passes this pointer of type
!      'double *' to a function compiled with GCC, dereferencing the
       pointer may cause a fatal signal.
  
       One way to solve this problem is to compile your entire program
*************** libraries and debuggers on certain syste
*** 44945,44952 ****
       compiled with Sun CC to copy the argument into a local variable;
       local variables are always properly aligned.  A third solution is
       to modify the function that uses the pointer to dereference it via
!      the following function `access_double' instead of directly with
!      `*':
  
            inline double
            access_double (double *unaligned_ptr)
--- 44611,44618 ----
       compiled with Sun CC to copy the argument into a local variable;
       local variables are always properly aligned.  A third solution is
       to modify the function that uses the pointer to dereference it via
!      the following function 'access_double' instead of directly with
!      '*':
  
            inline double
            access_double (double *unaligned_ptr)
*************** libraries and debuggers on certain syste
*** 44964,44990 ****
  
       Storing into the pointer can be done likewise with the same union.
  
!    * On Solaris, the `malloc' function in the `libmalloc.a' library may
       allocate memory that is only 4 byte aligned.  Since GCC on the
       SPARC assumes that doubles are 8 byte aligned, this may result in a
       fatal signal if doubles are stored in memory allocated by the
!      `libmalloc.a' library.
  
!      The solution is to not use the `libmalloc.a' library.  Use instead
!      `malloc' and related functions from `libc.a'; they do not have
!      this problem.
  
     * On the HP PA machine, ADB sometimes fails to work on functions
       compiled with GCC.  Specifically, it fails to work on functions
!      that use `alloca' or variable-size arrays.  This is because GCC
       doesn't generate HP-UX unwind descriptors for such functions.  It
       may even be impossible to generate them.
  
!    * Debugging (`-g') is not supported on the HP PA machine, unless you
       use the preliminary GNU tools.
  
!    * Taking the address of a label may generate errors from the HP-UX
!      PA assembler.  GAS for the PA does not have this problem.
  
     * Using floating point parameters for indirect calls to static
       functions will not work when using the HP assembler.  There simply
--- 44630,44656 ----
  
       Storing into the pointer can be done likewise with the same union.
  
!    * On Solaris, the 'malloc' function in the 'libmalloc.a' library may
       allocate memory that is only 4 byte aligned.  Since GCC on the
       SPARC assumes that doubles are 8 byte aligned, this may result in a
       fatal signal if doubles are stored in memory allocated by the
!      'libmalloc.a' library.
  
!      The solution is to not use the 'libmalloc.a' library.  Use instead
!      'malloc' and related functions from 'libc.a'; they do not have this
!      problem.
  
     * On the HP PA machine, ADB sometimes fails to work on functions
       compiled with GCC.  Specifically, it fails to work on functions
!      that use 'alloca' or variable-size arrays.  This is because GCC
       doesn't generate HP-UX unwind descriptors for such functions.  It
       may even be impossible to generate them.
  
!    * Debugging ('-g') is not supported on the HP PA machine, unless you
       use the preliminary GNU tools.
  
!    * Taking the address of a label may generate errors from the HP-UX PA
!      assembler.  GAS for the PA does not have this problem.
  
     * Using floating point parameters for indirect calls to static
       functions will not work when using the HP assembler.  There simply
*************** libraries and debuggers on certain syste
*** 44995,45006 ****
     * In extremely rare cases involving some very large functions you may
       receive errors from the HP linker complaining about an out of
       bounds unconditional branch offset.  This used to occur more often
!      in previous versions of GCC, but is now exceptionally rare.  If
!      you should run into it, you can work around by making your
!      function smaller.
  
!    * GCC compiled code sometimes emits warnings from the HP-UX
!      assembler of the form:
  
            (warning) Use of GR3 when
              frame >= 8192 may cause conflict.
--- 44661,44672 ----
     * In extremely rare cases involving some very large functions you may
       receive errors from the HP linker complaining about an out of
       bounds unconditional branch offset.  This used to occur more often
!      in previous versions of GCC, but is now exceptionally rare.  If you
!      should run into it, you can work around by making your function
!      smaller.
  
!    * GCC compiled code sometimes emits warnings from the HP-UX assembler
!      of the form:
  
            (warning) Use of GR3 when
              frame >= 8192 may cause conflict.
*************** libraries and debuggers on certain syste
*** 45009,45056 ****
  
     * In extremely rare cases involving some very large functions you may
       receive errors from the AIX Assembler complaining about a
!      displacement that is too large.  If you should run into it, you
!      can work around by making your function smaller.
  
!    * The `libstdc++.a' library in GCC relies on the SVR4 dynamic linker
       semantics which merges global symbols between libraries and
       applications, especially necessary for C++ streams functionality.
       This is not the default behavior of AIX shared libraries and
!      dynamic linking.  `libstdc++.a' is built on AIX with
       "runtime-linking" enabled so that symbol merging can occur.  To
!      utilize this feature, the application linked with `libstdc++.a'
!      must include the `-Wl,-brtl' flag on the link line.  G++ cannot
!      impose this because this option may interfere with the semantics
!      of the user program and users may not always use `g++' to link his
!      or her application.  Applications are not required to use the
!      `-Wl,-brtl' flag on the link line--the rest of the `libstdc++.a'
!      library which is not dependent on the symbol merging semantics
!      will continue to function correctly.
  
     * An application can interpose its own definition of functions for
!      functions invoked by `libstdc++.a' with "runtime-linking" enabled
       on AIX.  To accomplish this the application must be linked with
       "runtime-linking" option and the functions explicitly must be
!      exported by the application (`-Wl,-brtl,-bE:exportfile').
  
     * AIX on the RS/6000 provides support (NLS) for environments outside
       of the United States.  Compilers and assemblers use NLS to support
       locale-specific representations of various objects including
!      floating-point numbers (`.' vs `,' for separating decimal
       fractions).  There have been problems reported where the library
       linked with GCC does not produce the same floating-point formats
       that the assembler accepts.  If you have this problem, set the
!      `LANG' environment variable to `C' or `En_US'.
  
!    * Even if you specify `-fdollars-in-identifiers', you cannot
!      successfully use `$' in identifiers on the RS/6000 due to a
       restriction in the IBM assembler.  GAS supports these identifiers.
  
- 
  
  File: gcc.info,  Node: Incompatibilities,  Next: Fixed Headers,  Prev: Interoperation,  Up: Trouble
  
! 12.3 Incompatibilities of GCC
  =============================
  
  There are several noteworthy incompatibilities between GNU C and K&R
--- 44675,44721 ----
  
     * In extremely rare cases involving some very large functions you may
       receive errors from the AIX Assembler complaining about a
!      displacement that is too large.  If you should run into it, you can
!      work around by making your function smaller.
  
!    * The 'libstdc++.a' library in GCC relies on the SVR4 dynamic linker
       semantics which merges global symbols between libraries and
       applications, especially necessary for C++ streams functionality.
       This is not the default behavior of AIX shared libraries and
!      dynamic linking.  'libstdc++.a' is built on AIX with
       "runtime-linking" enabled so that symbol merging can occur.  To
!      utilize this feature, the application linked with 'libstdc++.a'
!      must include the '-Wl,-brtl' flag on the link line.  G++ cannot
!      impose this because this option may interfere with the semantics of
!      the user program and users may not always use 'g++' to link his or
!      her application.  Applications are not required to use the
!      '-Wl,-brtl' flag on the link line--the rest of the 'libstdc++.a'
!      library which is not dependent on the symbol merging semantics will
!      continue to function correctly.
  
     * An application can interpose its own definition of functions for
!      functions invoked by 'libstdc++.a' with "runtime-linking" enabled
       on AIX.  To accomplish this the application must be linked with
       "runtime-linking" option and the functions explicitly must be
!      exported by the application ('-Wl,-brtl,-bE:exportfile').
  
     * AIX on the RS/6000 provides support (NLS) for environments outside
       of the United States.  Compilers and assemblers use NLS to support
       locale-specific representations of various objects including
!      floating-point numbers ('.' vs ',' for separating decimal
       fractions).  There have been problems reported where the library
       linked with GCC does not produce the same floating-point formats
       that the assembler accepts.  If you have this problem, set the
!      'LANG' environment variable to 'C' or 'En_US'.
  
!    * Even if you specify '-fdollars-in-identifiers', you cannot
!      successfully use '$' in identifiers on the RS/6000 due to a
       restriction in the IBM assembler.  GAS supports these identifiers.
  
  
  File: gcc.info,  Node: Incompatibilities,  Next: Fixed Headers,  Prev: Interoperation,  Up: Trouble
  
! 13.3 Incompatibilities of GCC
  =============================
  
  There are several noteworthy incompatibilities between GNU C and K&R
*************** There are several noteworthy incompatibi
*** 45060,45082 ****
       identical-looking string constants are used, GCC stores only one
       copy of the string.
  
!      One consequence is that you cannot call `mktemp' with a string
!      constant argument.  The function `mktemp' always alters the string
       its argument points to.
  
!      Another consequence is that `sscanf' does not work on some very
!      old systems when passed a string constant as its format control
!      string or input.  This is because `sscanf' incorrectly tries to
!      write into the string constant.  Likewise `fscanf' and `scanf'.
  
       The solution to these problems is to change the program to use
!      `char'-array variables with initialization strings for these
       purposes instead of string constants.
  
!    * `-2147483648' is positive.
  
!      This is because 2147483648 cannot fit in the type `int', so
!      (following the ISO C rules) its data type is `unsigned long int'.
       Negating this value yields 2147483648 again.
  
     * GCC does not substitute macro arguments when they appear inside of
--- 44725,44747 ----
       identical-looking string constants are used, GCC stores only one
       copy of the string.
  
!      One consequence is that you cannot call 'mktemp' with a string
!      constant argument.  The function 'mktemp' always alters the string
       its argument points to.
  
!      Another consequence is that 'sscanf' does not work on some very old
!      systems when passed a string constant as its format control string
!      or input.  This is because 'sscanf' incorrectly tries to write into
!      the string constant.  Likewise 'fscanf' and 'scanf'.
  
       The solution to these problems is to change the program to use
!      'char'-array variables with initialization strings for these
       purposes instead of string constants.
  
!    * '-2147483648' is positive.
  
!      This is because 2147483648 cannot fit in the type 'int', so
!      (following the ISO C rules) its data type is 'unsigned long int'.
       Negating this value yields 2147483648 again.
  
     * GCC does not substitute macro arguments when they appear inside of
*************** There are several noteworthy incompatibi
*** 45084,45093 ****
  
            #define foo(a) "a"
  
!      will produce output `"a"' regardless of what the argument A is.
  
!    * When you use `setjmp' and `longjmp', the only automatic variables
!      guaranteed to remain valid are those declared `volatile'.  This is
       a consequence of automatic register allocation.  Consider this
       function:
  
--- 44749,44758 ----
  
            #define foo(a) "a"
  
!      will produce output '"a"' regardless of what the argument A is.
  
!    * When you use 'setjmp' and 'longjmp', the only automatic variables
!      guaranteed to remain valid are those declared 'volatile'.  This is
       a consequence of automatic register allocation.  Consider this
       function:
  
*************** There are several noteworthy incompatibi
*** 45102,45117 ****
                return a;
  
              a = fun2 ();
!             /* `longjmp (j)' may occur in `fun3'. */
              return a + fun3 ();
            }
  
!      Here `a' may or may not be restored to its first value when the
!      `longjmp' occurs.  If `a' is allocated in a register, then its
       first value is restored; otherwise, it keeps the last value stored
       in it.
  
!      If you use the `-W' option with the `-O' option, you will get a
       warning when GCC thinks such a problem might be possible.
  
     * Programs that use preprocessing directives in the middle of macro
--- 44767,44782 ----
                return a;
  
              a = fun2 ();
!             /* 'longjmp (j)' may occur in 'fun3'. */
              return a + fun3 ();
            }
  
!      Here 'a' may or may not be restored to its first value when the
!      'longjmp' occurs.  If 'a' is allocated in a register, then its
       first value is restored; otherwise, it keeps the last value stored
       in it.
  
!      If you use the '-W' option with the '-O' option, you will get a
       warning when GCC thinks such a problem might be possible.
  
     * Programs that use preprocessing directives in the middle of macro
*************** There are several noteworthy incompatibi
*** 45132,45148 ****
       words, they have the same scope as any other declaration in the
       same place.
  
!      In some other C compilers, an `extern' declaration affects all the
       rest of the file even if it happens within a block.
  
!    * In traditional C, you can combine `long', etc., with a typedef
       name, as shown here:
  
            typedef int foo;
            typedef long foo bar;
  
!      In ISO C, this is not allowed: `long' and other type modifiers
!      require an explicit `int'.
  
     * PCC allows typedef names to be used as function parameters.
  
--- 44797,44813 ----
       words, they have the same scope as any other declaration in the
       same place.
  
!      In some other C compilers, an 'extern' declaration affects all the
       rest of the file even if it happens within a block.
  
!    * In traditional C, you can combine 'long', etc., with a typedef
       name, as shown here:
  
            typedef int foo;
            typedef long foo bar;
  
!      In ISO C, this is not allowed: 'long' and other type modifiers
!      require an explicit 'int'.
  
     * PCC allows typedef names to be used as function parameters.
  
*************** There are several noteworthy incompatibi
*** 45152,45166 ****
            typedef int foo;
            typedef foo foo;
  
!    * GCC treats all characters of identifiers as significant.
!      According to K&R-1 (2.2), "No more than the first eight characters
!      are significant, although more may be used.".  Also according to
!      K&R-1 (2.2), "An identifier is a sequence of letters and digits;
!      the first character must be a letter.  The underscore _ counts as
!      a letter.", but GCC also allows dollar signs in identifiers.
  
     * PCC allows whitespace in the middle of compound assignment
!      operators such as `+='.  GCC, following the ISO standard, does not
       allow this.
  
     * GCC complains about unterminated character constants inside of
--- 44817,44831 ----
            typedef int foo;
            typedef foo foo;
  
!    * GCC treats all characters of identifiers as significant.  According
!      to K&R-1 (2.2), "No more than the first eight characters are
!      significant, although more may be used.".  Also according to K&R-1
!      (2.2), "An identifier is a sequence of letters and digits; the
!      first character must be a letter.  The underscore _ counts as a
!      letter.", but GCC also allows dollar signs in identifiers.
  
     * PCC allows whitespace in the middle of compound assignment
!      operators such as '+='.  GCC, following the ISO standard, does not
       allow this.
  
     * GCC complains about unterminated character constants inside of
*************** There are several noteworthy incompatibi
*** 45174,45197 ****
            #endif
  
       The best solution to such a problem is to put the text into an
!      actual C comment delimited by `/*...*/'.
  
!    * Many user programs contain the declaration `long time ();'.  In the
       past, the system header files on many systems did not actually
!      declare `time', so it did not matter what type your program
!      declared it to return.  But in systems with ISO C headers, `time'
!      is declared to return `time_t', and if that is not the same as
!      `long', then `long time ();' is erroneous.
  
       The solution is to change your program to use appropriate system
!      headers (`<time.h>' on systems with ISO C headers) and not to
!      declare `time' if the system header files declare it, or failing
!      that to use `time_t' as the return type of `time'.
  
!    * When compiling functions that return `float', PCC converts it to a
!      double.  GCC actually returns a `float'.  If you are concerned
!      with PCC compatibility, you should declare your functions to return
!      `double'; you might as well say what you mean.
  
     * When compiling functions that return structures or unions, GCC
       output code normally uses a method different from that used on most
--- 44839,44862 ----
            #endif
  
       The best solution to such a problem is to put the text into an
!      actual C comment delimited by '/*...*/'.
  
!    * Many user programs contain the declaration 'long time ();'.  In the
       past, the system header files on many systems did not actually
!      declare 'time', so it did not matter what type your program
!      declared it to return.  But in systems with ISO C headers, 'time'
!      is declared to return 'time_t', and if that is not the same as
!      'long', then 'long time ();' is erroneous.
  
       The solution is to change your program to use appropriate system
!      headers ('<time.h>' on systems with ISO C headers) and not to
!      declare 'time' if the system header files declare it, or failing
!      that to use 'time_t' as the return type of 'time'.
  
!    * When compiling functions that return 'float', PCC converts it to a
!      double.  GCC actually returns a 'float'.  If you are concerned with
!      PCC compatibility, you should declare your functions to return
!      'double'; you might as well say what you mean.
  
     * When compiling functions that return structures or unions, GCC
       output code normally uses a method different from that used on most
*************** There are several noteworthy incompatibi
*** 45200,45209 ****
  
       The method used by GCC is as follows: a structure or union which is
       1, 2, 4 or 8 bytes long is returned like a scalar.  A structure or
!      union with any other size is stored into an address supplied by
!      the caller (usually in a special, fixed register, but on some
!      machines it is passed on the stack).  The target hook
!      `TARGET_STRUCT_VALUE_RTX' tells GCC where to pass this address.
  
       By contrast, PCC on most target machines returns structures and
       unions of any size by copying the data into an area of static
--- 44865,44874 ----
  
       The method used by GCC is as follows: a structure or union which is
       1, 2, 4 or 8 bytes long is returned like a scalar.  A structure or
!      union with any other size is stored into an address supplied by the
!      caller (usually in a special, fixed register, but on some machines
!      it is passed on the stack).  The target hook
!      'TARGET_STRUCT_VALUE_RTX' tells GCC where to pass this address.
  
       By contrast, PCC on most target machines returns structures and
       unions of any size by copying the data into an area of static
*************** There are several noteworthy incompatibi
*** 45218,45247 ****
       memory, but still returns small structures and unions in registers.
  
       You can tell GCC to use a compatible convention for all structure
!      and union returning with the option `-fpcc-struct-return'.
  
!    * GCC complains about program fragments such as `0x74ae-0x4000'
!      which appear to be two hexadecimal constants separated by the minus
       operator.  Actually, this string is a single "preprocessing token".
!      Each such token must correspond to one token in C.  Since this
!      does not, GCC prints an error message.  Although it may appear
!      obvious that what is meant is an operator and two values, the ISO
!      C standard specifically requires that this be treated as erroneous.
  
       A "preprocessing token" is a "preprocessing number" if it begins
       with a digit and is followed by letters, underscores, digits,
!      periods and `e+', `e-', `E+', `E-', `p+', `p-', `P+', or `P-'
!      character sequences.  (In strict C90 mode, the sequences `p+',
!      `p-', `P+' and `P-' cannot appear in preprocessing numbers.)
  
!      To make the above program fragment valid, place whitespace in
!      front of the minus sign.  This whitespace will end the
!      preprocessing number.
  
  
  File: gcc.info,  Node: Fixed Headers,  Next: Standard Libraries,  Prev: Incompatibilities,  Up: Trouble
  
! 12.4 Fixed Header Files
  =======================
  
  GCC needs to install corrected versions of some system header files.
--- 44883,44912 ----
       memory, but still returns small structures and unions in registers.
  
       You can tell GCC to use a compatible convention for all structure
!      and union returning with the option '-fpcc-struct-return'.
  
!    * GCC complains about program fragments such as '0x74ae-0x4000' which
!      appear to be two hexadecimal constants separated by the minus
       operator.  Actually, this string is a single "preprocessing token".
!      Each such token must correspond to one token in C.  Since this does
!      not, GCC prints an error message.  Although it may appear obvious
!      that what is meant is an operator and two values, the ISO C
!      standard specifically requires that this be treated as erroneous.
  
       A "preprocessing token" is a "preprocessing number" if it begins
       with a digit and is followed by letters, underscores, digits,
!      periods and 'e+', 'e-', 'E+', 'E-', 'p+', 'p-', 'P+', or 'P-'
!      character sequences.  (In strict C90 mode, the sequences 'p+',
!      'p-', 'P+' and 'P-' cannot appear in preprocessing numbers.)
  
!      To make the above program fragment valid, place whitespace in front
!      of the minus sign.  This whitespace will end the preprocessing
!      number.
  
  
  File: gcc.info,  Node: Fixed Headers,  Next: Standard Libraries,  Prev: Incompatibilities,  Up: Trouble
  
! 13.4 Fixed Header Files
  =======================
  
  GCC needs to install corrected versions of some system header files.
*************** incompatible with ISO C, and some depend
*** 45251,45264 ****
  compilers.
  
   Installing GCC automatically creates and installs the fixed header
! files, by running a program called `fixincludes'.  Normally, you don't
  need to pay attention to this.  But there are cases where it doesn't do
  the right thing automatically.
  
     * If you update the system's header files, such as by installing a
       new system version, the fixed header files of GCC are not
!      automatically updated.  They can be updated using the `mkheaders'
!      script installed in `LIBEXECDIR/gcc/TARGET/VERSION/install-tools/'.
  
     * On some systems, header file directories contain machine-specific
       symbolic links in certain places.  This makes it possible to share
--- 44916,44929 ----
  compilers.
  
   Installing GCC automatically creates and installs the fixed header
! files, by running a program called 'fixincludes'.  Normally, you don't
  need to pay attention to this.  But there are cases where it doesn't do
  the right thing automatically.
  
     * If you update the system's header files, such as by installing a
       new system version, the fixed header files of GCC are not
!      automatically updated.  They can be updated using the 'mkheaders'
!      script installed in 'LIBEXECDIR/gcc/TARGET/VERSION/install-tools/'.
  
     * On some systems, header file directories contain machine-specific
       symbolic links in certain places.  This makes it possible to share
*************** the right thing automatically.
*** 45267,45284 ****
  
       The programs that fix the header files do not understand this
       special way of using symbolic links; therefore, the directory of
!      fixed header files is good only for the machine model used to
!      build it.
  
       It is possible to make separate sets of fixed header files for the
!      different machine models, and arrange a structure of symbolic
!      links so as to use the proper set, but you'll have to do this by
!      hand.
  
  
  File: gcc.info,  Node: Standard Libraries,  Next: Disappointments,  Prev: Fixed Headers,  Up: Trouble
  
! 12.5 Standard Libraries
  =======================
  
  GCC by itself attempts to be a conforming freestanding implementation.
--- 44932,44948 ----
  
       The programs that fix the header files do not understand this
       special way of using symbolic links; therefore, the directory of
!      fixed header files is good only for the machine model used to build
!      it.
  
       It is possible to make separate sets of fixed header files for the
!      different machine models, and arrange a structure of symbolic links
!      so as to use the proper set, but you'll have to do this by hand.
  
  
  File: gcc.info,  Node: Standard Libraries,  Next: Disappointments,  Prev: Fixed Headers,  Up: Trouble
  
! 13.5 Standard Libraries
  =======================
  
  GCC by itself attempts to be a conforming freestanding implementation.
*************** what this means.  Beyond the library fac
*** 45287,45312 ****
  implementation, the rest of the C library is supplied by the vendor of
  the operating system.  If that C library doesn't conform to the C
  standards, then your programs might get warnings (especially when using
! `-Wall') that you don't expect.
  
!  For example, the `sprintf' function on SunOS 4.1.3 returns `char *'
! while the C standard says that `sprintf' returns an `int'.  The
! `fixincludes' program could make the prototype for this function match
  the Standard, but that would be wrong, since the function will still
! return `char *'.
  
   If you need a Standard compliant library, then you need to find one, as
! GCC does not provide one.  The GNU C library (called `glibc') provides
  ISO C, POSIX, BSD, SystemV and X/Open compatibility for GNU/Linux and
  HURD-based GNU systems; no recent version of it supports other systems,
  though some very old versions did.  Version 2.2 of the GNU C library
! includes nearly complete C99 support.  You could also ask your
! operating system vendor if newer libraries are available.
  
  
  File: gcc.info,  Node: Disappointments,  Next: C++ Misunderstandings,  Prev: Standard Libraries,  Up: Trouble
  
! 12.6 Disappointments and Misunderstandings
  ==========================================
  
  These problems are perhaps regrettable, but we don't know any practical
--- 44951,44976 ----
  implementation, the rest of the C library is supplied by the vendor of
  the operating system.  If that C library doesn't conform to the C
  standards, then your programs might get warnings (especially when using
! '-Wall') that you don't expect.
  
!  For example, the 'sprintf' function on SunOS 4.1.3 returns 'char *'
! while the C standard says that 'sprintf' returns an 'int'.  The
! 'fixincludes' program could make the prototype for this function match
  the Standard, but that would be wrong, since the function will still
! return 'char *'.
  
   If you need a Standard compliant library, then you need to find one, as
! GCC does not provide one.  The GNU C library (called 'glibc') provides
  ISO C, POSIX, BSD, SystemV and X/Open compatibility for GNU/Linux and
  HURD-based GNU systems; no recent version of it supports other systems,
  though some very old versions did.  Version 2.2 of the GNU C library
! includes nearly complete C99 support.  You could also ask your operating
! system vendor if newer libraries are available.
  
  
  File: gcc.info,  Node: Disappointments,  Next: C++ Misunderstandings,  Prev: Standard Libraries,  Up: Trouble
  
! 13.6 Disappointments and Misunderstandings
  ==========================================
  
  These problems are perhaps regrettable, but we don't know any practical
*************** way around them.
*** 45334,45360 ****
            int foo (struct mumble *x)
            { ... }
  
!      This code really is erroneous, because the scope of `struct
!      mumble' in the prototype is limited to the argument list
!      containing it.  It does not refer to the `struct mumble' defined
!      with file scope immediately below--they are two unrelated types
!      with similar names in different scopes.
  
!      But in the definition of `foo', the file-scope type is used
!      because that is available to be inherited.  Thus, the definition
!      and the prototype do not match, and you get an error.
  
       This behavior may seem silly, but it's what the ISO standard
       specifies.  It is easy enough for you to make your code work by
!      moving the definition of `struct mumble' above the prototype.
!      It's not worth being incompatible with ISO C just to avoid an
!      error for the example shown above.
  
     * Accesses to bit-fields even in volatile objects works by accessing
       larger objects, such as a byte or a word.  You cannot rely on what
!      size of object is accessed in order to read or write the
!      bit-field; it may even vary for a given bit-field according to the
!      precise usage.
  
       If you care about controlling the amount of memory that is
       accessed, use volatile but do not use bit-fields.
--- 44998,45024 ----
            int foo (struct mumble *x)
            { ... }
  
!      This code really is erroneous, because the scope of 'struct mumble'
!      in the prototype is limited to the argument list containing it.  It
!      does not refer to the 'struct mumble' defined with file scope
!      immediately below--they are two unrelated types with similar names
!      in different scopes.
  
!      But in the definition of 'foo', the file-scope type is used because
!      that is available to be inherited.  Thus, the definition and the
!      prototype do not match, and you get an error.
  
       This behavior may seem silly, but it's what the ISO standard
       specifies.  It is easy enough for you to make your code work by
!      moving the definition of 'struct mumble' above the prototype.  It's
!      not worth being incompatible with ISO C just to avoid an error for
!      the example shown above.
  
     * Accesses to bit-fields even in volatile objects works by accessing
       larger objects, such as a byte or a word.  You cannot rely on what
!      size of object is accessed in order to read or write the bit-field;
!      it may even vary for a given bit-field according to the precise
!      usage.
  
       If you care about controlling the amount of memory that is
       accessed, use volatile but do not use bit-fields.
*************** way around them.
*** 45367,45386 ****
       about.
  
       If new system header files are installed, nothing automatically
!      arranges to update the corrected header files.  They can be
!      updated using the `mkheaders' script installed in
!      `LIBEXECDIR/gcc/TARGET/VERSION/install-tools/'.
  
     * On 68000 and x86 systems, for instance, you can get paradoxical
       results if you test the precise values of floating point numbers.
       For example, you can find that a floating point value which is not
       a NaN is not equal to itself.  This results from the fact that the
!      floating point registers hold a few more bits of precision than
!      fit in a `double' in memory.  Compiled code moves values between
!      memory and floating point registers at its convenience, and moving
!      them into memory truncates them.
  
!      You can partially avoid this problem by using the `-ffloat-store'
       option (*note Optimize Options::).
  
     * On AIX and other platforms without weak symbol support, templates
--- 45031,45050 ----
       about.
  
       If new system header files are installed, nothing automatically
!      arranges to update the corrected header files.  They can be updated
!      using the 'mkheaders' script installed in
!      'LIBEXECDIR/gcc/TARGET/VERSION/install-tools/'.
  
     * On 68000 and x86 systems, for instance, you can get paradoxical
       results if you test the precise values of floating point numbers.
       For example, you can find that a floating point value which is not
       a NaN is not equal to itself.  This results from the fact that the
!      floating point registers hold a few more bits of precision than fit
!      in a 'double' in memory.  Compiled code moves values between memory
!      and floating point registers at its convenience, and moving them
!      into memory truncates them.
  
!      You can partially avoid this problem by using the '-ffloat-store'
       option (*note Optimize Options::).
  
     * On AIX and other platforms without weak symbol support, templates
*************** way around them.
*** 45400,45406 ****
  
  File: gcc.info,  Node: C++ Misunderstandings,  Next: Non-bugs,  Prev: Disappointments,  Up: Trouble
  
! 12.7 Common Misunderstandings with GNU C++
  ==========================================
  
  C++ is a complex language and an evolving one, and its standard
--- 45064,45070 ----
  
  File: gcc.info,  Node: C++ Misunderstandings,  Next: Non-bugs,  Prev: Disappointments,  Up: Trouble
  
! 13.7 Common Misunderstandings with GNU C++
  ==========================================
  
  C++ is a complex language and an evolving one, and its standard
*************** give rise to questions of this sort.
*** 45419,45425 ****
  
  File: gcc.info,  Node: Static Definitions,  Next: Name lookup,  Up: C++ Misunderstandings
  
! 12.7.1 Declare _and_ Define Static Members
  ------------------------------------------
  
  When a class has static data members, it is not enough to _declare_ the
--- 45083,45089 ----
  
  File: gcc.info,  Node: Static Definitions,  Next: Name lookup,  Up: C++ Misunderstandings
  
! 13.7.1 Declare _and_ Define Static Members
  ------------------------------------------
  
  When a class has static data members, it is not enough to _declare_ the
*************** static member; you must also _define_ it
*** 45432,45455 ****
         static int bar;
       };
  
!  This declaration only establishes that the class `Foo' has an `int'
! named `Foo::bar', and a member function named `Foo::method'.  But you
! still need to define _both_ `method' and `bar' elsewhere.  According to
  the ISO standard, you must supply an initializer in one (and only one)
  source file, such as:
  
       int Foo::bar = 0;
  
   Other C++ compilers may not correctly implement the standard behavior.
! As a result, when you switch to `g++' from one of these compilers, you
! may discover that a program that appeared to work correctly in fact
! does not conform to the standard: `g++' reports as undefined symbols
! any static data members that lack definitions.
  
  
  File: gcc.info,  Node: Name lookup,  Next: Temporaries,  Prev: Static Definitions,  Up: C++ Misunderstandings
  
! 12.7.2 Name Lookup, Templates, and Accessing Members of Base Classes
  --------------------------------------------------------------------
  
  The C++ standard prescribes that all names that are not dependent on
--- 45096,45119 ----
         static int bar;
       };
  
!  This declaration only establishes that the class 'Foo' has an 'int'
! named 'Foo::bar', and a member function named 'Foo::method'.  But you
! still need to define _both_ 'method' and 'bar' elsewhere.  According to
  the ISO standard, you must supply an initializer in one (and only one)
  source file, such as:
  
       int Foo::bar = 0;
  
   Other C++ compilers may not correctly implement the standard behavior.
! As a result, when you switch to 'g++' from one of these compilers, you
! may discover that a program that appeared to work correctly in fact does
! not conform to the standard: 'g++' reports as undefined symbols any
! static data members that lack definitions.
  
  
  File: gcc.info,  Node: Name lookup,  Next: Temporaries,  Prev: Static Definitions,  Up: C++ Misunderstandings
  
! 13.7.2 Name Lookup, Templates, and Accessing Members of Base Classes
  --------------------------------------------------------------------
  
  The C++ standard prescribes that all names that are not dependent on
*************** looked up at the point of instantiation.
*** 45472,45491 ****
           static const int N;
         };
  
!  Here, the names `foo' and `N' appear in a context that does not depend
! on the type of `T'.  The compiler will thus require that they are
! defined in the context of use in the template, not only before the
! point of instantiation, and will here use `::foo(double)' and `A::N',
  respectively.  In particular, it will convert the integer value to a
! `double' when passing it to `::foo(double)'.
  
!  Conversely, `bar' and the call to `foo' in the fourth marked line are
! used in contexts that do depend on the type of `T', so they are only
  looked up at the point of instantiation, and you can provide
  declarations for them after declaring the template, but before
! instantiating it.  In particular, if you instantiate `A::f<int>', the
! last line will call an overloaded `::foo(int)' if one was provided,
! even if after the declaration of `struct A'.
  
   This distinction between lookup of dependent and non-dependent names is
  called two-stage (or dependent) name lookup.  G++ implements it since
--- 45136,45155 ----
           static const int N;
         };
  
!  Here, the names 'foo' and 'N' appear in a context that does not depend
! on the type of 'T'.  The compiler will thus require that they are
! defined in the context of use in the template, not only before the point
! of instantiation, and will here use '::foo(double)' and 'A::N',
  respectively.  In particular, it will convert the integer value to a
! 'double' when passing it to '::foo(double)'.
  
!  Conversely, 'bar' and the call to 'foo' in the fourth marked line are
! used in contexts that do depend on the type of 'T', so they are only
  looked up at the point of instantiation, and you can provide
  declarations for them after declaring the template, but before
! instantiating it.  In particular, if you instantiate 'A::f<int>', the
! last line will call an overloaded '::foo(int)' if one was provided, even
! if after the declaration of 'struct A'.
  
   This distinction between lookup of dependent and non-dependent names is
  called two-stage (or dependent) name lookup.  G++ implements it since
*************** different from non-template codes.  The
*** 45502,45522 ****
           int get_i() { return i; }
         };
  
!  In `get_i()', `i' is not used in a dependent context, so the compiler
! will look for a name declared at the enclosing namespace scope (which
! is the global scope here).  It will not look into the base class, since
! that is dependent and you may declare specializations of `Base' even
! after declaring `Derived', so the compiler can't really know what `i'
! would refer to.  If there is no global variable `i', then you will get
  an error message.
  
   In order to make it clear that you want the member of the base class,
  you need to defer lookup until instantiation time, at which the base
! class is known.  For this, you need to access `i' in a dependent
! context, by either using `this->i' (remember that `this' is of type
! `Derived<T>*', so is obviously dependent), or using `Base<T>::i'.
! Alternatively, `Base<T>::i' might be brought into scope by a
! `using'-declaration.
  
   Another, similar example involves calling member functions of a base
  class:
--- 45166,45186 ----
           int get_i() { return i; }
         };
  
!  In 'get_i()', 'i' is not used in a dependent context, so the compiler
! will look for a name declared at the enclosing namespace scope (which is
! the global scope here).  It will not look into the base class, since
! that is dependent and you may declare specializations of 'Base' even
! after declaring 'Derived', so the compiler can't really know what 'i'
! would refer to.  If there is no global variable 'i', then you will get
  an error message.
  
   In order to make it clear that you want the member of the base class,
  you need to defer lookup until instantiation time, at which the base
! class is known.  For this, you need to access 'i' in a dependent
! context, by either using 'this->i' (remember that 'this' is of type
! 'Derived<T>*', so is obviously dependent), or using 'Base<T>::i'.
! Alternatively, 'Base<T>::i' might be brought into scope by a
! 'using'-declaration.
  
   Another, similar example involves calling member functions of a base
  class:
*************** class:
*** 45529,45536 ****
             int g() { return f(); };
         };
  
!  Again, the call to `f()' is not dependent on template arguments (there
! are no arguments that depend on the type `T', and it is also not
  otherwise specified that the call should be in a dependent context).
  Thus a global declaration of such a function must be available, since
  the one in the base class is not visible until instantiation time.  The
--- 45193,45200 ----
             int g() { return f(); };
         };
  
!  Again, the call to 'f()' is not dependent on template arguments (there
! are no arguments that depend on the type 'T', and it is also not
  otherwise specified that the call should be in a dependent context).
  Thus a global declaration of such a function must be available, since
  the one in the base class is not visible until instantiation time.  The
*************** compiler will consequently produce the f
*** 45542,45585 ****
         x.cc:6: error: (if you use `-fpermissive', G++ will accept your code, but
            allowing the use of an undeclared name is deprecated)
  
!  To make the code valid either use `this->f()', or `Base<T>::f()'.
! Using the `-fpermissive' flag will also let the compiler accept the
  code, by marking all function calls for which no declaration is visible
  at the time of definition of the template for later lookup at
! instantiation time, as if it were a dependent call.  We do not
! recommend using `-fpermissive' to work around invalid code, and it will
! also only catch cases where functions in base classes are called, not
! where variables in base classes are used (as in the example above).
  
   Note that some compilers (including G++ versions prior to 3.4) get
  these examples wrong and accept above code without an error.  Those
  compilers do not implement two-stage name lookup correctly.
  
!  ---------- Footnotes ----------
  
!  (1) The C++ standard just uses the term "dependent" for names that
  depend on the type or value of template parameters.  This shorter term
  will also be used in the rest of this section.
  
  
  File: gcc.info,  Node: Temporaries,  Next: Copy Assignment,  Prev: Name lookup,  Up: C++ Misunderstandings
  
! 12.7.3 Temporaries May Vanish Before You Expect
  -----------------------------------------------
  
  It is dangerous to use pointers or references to _portions_ of a
  temporary object.  The compiler may very well delete the object before
  you expect it to, leaving a pointer to garbage.  The most common place
  where this problem crops up is in classes like string classes,
! especially ones that define a conversion function to type `char *' or
! `const char *'--which is one reason why the standard `string' class
! requires you to call the `c_str' member function.  However, any class
! that returns a pointer to some internal structure is potentially
! subject to this problem.
  
!  For example, a program may use a function `strfunc' that returns
! `string' objects, and another function `charfunc' that operates on
! pointers to `char':
  
       string strfunc ();
       void charfunc (const char *);
--- 45206,45249 ----
         x.cc:6: error: (if you use `-fpermissive', G++ will accept your code, but
            allowing the use of an undeclared name is deprecated)
  
!  To make the code valid either use 'this->f()', or 'Base<T>::f()'.
! Using the '-fpermissive' flag will also let the compiler accept the
  code, by marking all function calls for which no declaration is visible
  at the time of definition of the template for later lookup at
! instantiation time, as if it were a dependent call.  We do not recommend
! using '-fpermissive' to work around invalid code, and it will also only
! catch cases where functions in base classes are called, not where
! variables in base classes are used (as in the example above).
  
   Note that some compilers (including G++ versions prior to 3.4) get
  these examples wrong and accept above code without an error.  Those
  compilers do not implement two-stage name lookup correctly.
  
!    ---------- Footnotes ----------
  
!    (1) The C++ standard just uses the term "dependent" for names that
  depend on the type or value of template parameters.  This shorter term
  will also be used in the rest of this section.
  
  
  File: gcc.info,  Node: Temporaries,  Next: Copy Assignment,  Prev: Name lookup,  Up: C++ Misunderstandings
  
! 13.7.3 Temporaries May Vanish Before You Expect
  -----------------------------------------------
  
  It is dangerous to use pointers or references to _portions_ of a
  temporary object.  The compiler may very well delete the object before
  you expect it to, leaving a pointer to garbage.  The most common place
  where this problem crops up is in classes like string classes,
! especially ones that define a conversion function to type 'char *' or
! 'const char *'--which is one reason why the standard 'string' class
! requires you to call the 'c_str' member function.  However, any class
! that returns a pointer to some internal structure is potentially subject
! to this problem.
  
!  For example, a program may use a function 'strfunc' that returns
! 'string' objects, and another function 'charfunc' that operates on
! pointers to 'char':
  
       string strfunc ();
       void charfunc (const char *);
*************** pointers to `char':
*** 45595,45604 ****
       }
  
  In this situation, it may seem reasonable to save a pointer to the C
! string returned by the `c_str' member function and use that rather than
! call `c_str' repeatedly.  However, the temporary string created by the
! call to `strfunc' is destroyed after `p' is initialized, at which point
! `p' is left pointing to freed memory.
  
   Code like this may run successfully under some other compilers,
  particularly obsolete cfront-based compilers that delete temporaries
--- 45259,45268 ----
       }
  
  In this situation, it may seem reasonable to save a pointer to the C
! string returned by the 'c_str' member function and use that rather than
! call 'c_str' repeatedly.  However, the temporary string created by the
! call to 'strfunc' is destroyed after 'p' is initialized, at which point
! 'p' is left pointing to freed memory.
  
   Code like this may run successfully under some other compilers,
  particularly obsolete cfront-based compilers that delete temporaries
*************** example:
*** 45616,45622 ****
  
  File: gcc.info,  Node: Copy Assignment,  Prev: Temporaries,  Up: C++ Misunderstandings
  
! 12.7.4 Implicit Copy-Assignment for Virtual Bases
  -------------------------------------------------
  
  When a base class is virtual, only one subobject of the base class
--- 45280,45286 ----
  
  File: gcc.info,  Node: Copy Assignment,  Prev: Temporaries,  Up: C++ Misunderstandings
  
! 13.7.4 Implicit Copy-Assignment for Virtual Bases
  -------------------------------------------------
  
  When a base class is virtual, only one subobject of the base class
*************** such objects behave unspecified when bei
*** 45652,45668 ****
         d1 = d2;
       }
  
!  The C++ standard specifies that `Base::Base' is only called once when
  constructing or copy-constructing a Derived object.  It is unspecified
! whether `Base::operator=' is called more than once when the implicit
! copy-assignment for Derived objects is invoked (as it is inside `func'
  in the example).
  
   G++ implements the "intuitive" algorithm for copy-assignment: assign
  all direct bases, then assign all members.  In that algorithm, the
  virtual base subobject can be encountered more than once.  In the
! example, copying proceeds in the following order: `val', `name' (via
! `strdup'), `bval', and `name' again.
  
   If application code relies on copy-assignment, a user-defined
  copy-assignment operator removes any uncertainties.  With such an
--- 45316,45332 ----
         d1 = d2;
       }
  
!  The C++ standard specifies that 'Base::Base' is only called once when
  constructing or copy-constructing a Derived object.  It is unspecified
! whether 'Base::operator=' is called more than once when the implicit
! copy-assignment for Derived objects is invoked (as it is inside 'func'
  in the example).
  
   G++ implements the "intuitive" algorithm for copy-assignment: assign
  all direct bases, then assign all members.  In that algorithm, the
  virtual base subobject can be encountered more than once.  In the
! example, copying proceeds in the following order: 'val', 'name' (via
! 'strdup'), 'bval', and 'name' again.
  
   If application code relies on copy-assignment, a user-defined
  copy-assignment operator removes any uncertainties.  With such an
*************** subobject is assigned.
*** 45672,45678 ****
  
  File: gcc.info,  Node: Non-bugs,  Next: Warnings and Errors,  Prev: C++ Misunderstandings,  Up: Trouble
  
! 12.8 Certain Changes We Don't Want to Make
  ==========================================
  
  This section lists changes that people frequently request, but which we
--- 45336,45342 ----
  
  File: gcc.info,  Node: Non-bugs,  Next: Warnings and Errors,  Prev: C++ Misunderstandings,  Up: Trouble
  
! 13.8 Certain Changes We Don't Want to Make
  ==========================================
  
  This section lists changes that people frequently request, but which we
*************** do not make because we think GCC is bett
*** 45701,45717 ****
     * Warning when a non-void function value is ignored.
  
       C contains many standard functions that return a value that most
!      programs choose to ignore.  One obvious example is `printf'.
       Warning about this practice only leads the defensive programmer to
!      clutter programs with dozens of casts to `void'.  Such casts are
       required so frequently that they become visual noise.  Writing
       those casts becomes so automatic that they no longer convey useful
       information about the intentions of the programmer.  For functions
       where the return value should never be ignored, use the
!      `warn_unused_result' function attribute (*note Function
       Attributes::).
  
!    * Making `-fshort-enums' the default.
  
       This would cause storage layout to be incompatible with most other
       C compilers.  And it doesn't seem very important, given that you
--- 45365,45381 ----
     * Warning when a non-void function value is ignored.
  
       C contains many standard functions that return a value that most
!      programs choose to ignore.  One obvious example is 'printf'.
       Warning about this practice only leads the defensive programmer to
!      clutter programs with dozens of casts to 'void'.  Such casts are
       required so frequently that they become visual noise.  Writing
       those casts becomes so automatic that they no longer convey useful
       information about the intentions of the programmer.  For functions
       where the return value should never be ignored, use the
!      'warn_unused_result' function attribute (*note Function
       Attributes::).
  
!    * Making '-fshort-enums' the default.
  
       This would cause storage layout to be incompatible with most other
       C compilers.  And it doesn't seem very important, given that you
*************** do not make because we think GCC is bett
*** 45723,45738 ****
       "the ABI standard" says to do so.
  
       The ISO C standard leaves it up to the implementation whether a
!      bit-field declared plain `int' is signed or not.  This in effect
       creates two alternative dialects of C.
  
       The GNU C compiler supports both dialects; you can specify the
!      signed dialect with `-fsigned-bitfields' and the unsigned dialect
!      with `-funsigned-bitfields'.  However, this leaves open the
       question of which dialect to use by default.
  
       Currently, the preferred dialect makes plain bit-fields signed,
!      because this is simplest.  Since `int' is the same as `signed int'
       in every other context, it is cleanest for them to be the same in
       bit-fields as well.
  
--- 45387,45402 ----
       "the ABI standard" says to do so.
  
       The ISO C standard leaves it up to the implementation whether a
!      bit-field declared plain 'int' is signed or not.  This in effect
       creates two alternative dialects of C.
  
       The GNU C compiler supports both dialects; you can specify the
!      signed dialect with '-fsigned-bitfields' and the unsigned dialect
!      with '-funsigned-bitfields'.  However, this leaves open the
       question of which dialect to use by default.
  
       Currently, the preferred dialect makes plain bit-fields signed,
!      because this is simplest.  Since 'int' is the same as 'signed int'
       in every other context, it is cleanest for them to be the same in
       bit-fields as well.
  
*************** do not make because we think GCC is bett
*** 45753,45767 ****
  
       Many users appreciate the GNU C compiler because it provides an
       environment that is uniform across machines.  These users would be
!      inconvenienced if the compiler treated plain bit-fields
!      differently on certain machines.
  
       Occasionally users write programs intended only for a particular
       machine type.  On these occasions, the users would benefit if the
       GNU C compiler were to support by default the same dialect as the
       other compilers on that machine.  But such applications are rare.
!      And users writing a program to run on more than one type of
!      machine cannot possibly benefit from this kind of compatibility.
  
       This is why GCC does and will treat plain bit-fields in the same
       fashion on all types of machines (by default).
--- 45417,45431 ----
  
       Many users appreciate the GNU C compiler because it provides an
       environment that is uniform across machines.  These users would be
!      inconvenienced if the compiler treated plain bit-fields differently
!      on certain machines.
  
       Occasionally users write programs intended only for a particular
       machine type.  On these occasions, the users would benefit if the
       GNU C compiler were to support by default the same dialect as the
       other compilers on that machine.  But such applications are rare.
!      And users writing a program to run on more than one type of machine
!      cannot possibly benefit from this kind of compatibility.
  
       This is why GCC does and will treat plain bit-fields in the same
       fashion on all types of machines (by default).
*************** do not make because we think GCC is bett
*** 45776,45835 ****
       In this way, they write programs which have the same meaning in
       both C dialects.)
  
!    * Undefining `__STDC__' when `-ansi' is not used.
  
!      Currently, GCC defines `__STDC__' unconditionally.  This provides
       good results in practice.
  
!      Programmers normally use conditionals on `__STDC__' to ask whether
       it is safe to use certain features of ISO C, such as function
!      prototypes or ISO token concatenation.  Since plain `gcc' supports
       all the features of ISO C, the correct answer to these questions is
       "yes".
  
!      Some users try to use `__STDC__' to check for the availability of
!      certain library facilities.  This is actually incorrect usage in
!      an ISO C program, because the ISO C standard says that a conforming
!      freestanding implementation should define `__STDC__' even though it
!      does not have the library facilities.  `gcc -ansi -pedantic' is a
       conforming freestanding implementation, and it is therefore
!      required to define `__STDC__', even though it does not come with
!      an ISO C library.
  
!      Sometimes people say that defining `__STDC__' in a compiler that
       does not completely conform to the ISO C standard somehow violates
       the standard.  This is illogical.  The standard is a standard for
!      compilers that claim to support ISO C, such as `gcc -ansi'--not
!      for other compilers such as plain `gcc'.  Whatever the ISO C
!      standard says is relevant to the design of plain `gcc' without
!      `-ansi' only for pragmatic reasons, not as a requirement.
  
!      GCC normally defines `__STDC__' to be 1, and in addition defines
!      `__STRICT_ANSI__' if you specify the `-ansi' option, or a `-std'
       option for strict conformance to some version of ISO C.  On some
       hosts, system include files use a different convention, where
!      `__STDC__' is normally 0, but is 1 if the user specifies strict
       conformance to the C Standard.  GCC follows the host convention
       when processing system include files, but when processing user
       files it follows the usual GNU C convention.
  
!    * Undefining `__STDC__' in C++.
  
!      Programs written to compile with C++-to-C translators get the
!      value of `__STDC__' that goes with the C compiler that is
!      subsequently used.  These programs must test `__STDC__' to
!      determine what kind of C preprocessor that compiler uses: whether
!      they should concatenate tokens in the ISO C fashion or in the
!      traditional fashion.
  
!      These programs work properly with GNU C++ if `__STDC__' is defined.
       They would not work otherwise.
  
!      In addition, many header files are written to provide prototypes
!      in ISO C but not in traditional C.  Many of these header files can
!      work without change in C++ provided `__STDC__' is defined.  If
!      `__STDC__' is not defined, they will all fail, and will all need
!      to be changed to test explicitly for C++ as well.
  
     * Deleting "empty" loops.
  
--- 45440,45499 ----
       In this way, they write programs which have the same meaning in
       both C dialects.)
  
!    * Undefining '__STDC__' when '-ansi' is not used.
  
!      Currently, GCC defines '__STDC__' unconditionally.  This provides
       good results in practice.
  
!      Programmers normally use conditionals on '__STDC__' to ask whether
       it is safe to use certain features of ISO C, such as function
!      prototypes or ISO token concatenation.  Since plain 'gcc' supports
       all the features of ISO C, the correct answer to these questions is
       "yes".
  
!      Some users try to use '__STDC__' to check for the availability of
!      certain library facilities.  This is actually incorrect usage in an
!      ISO C program, because the ISO C standard says that a conforming
!      freestanding implementation should define '__STDC__' even though it
!      does not have the library facilities.  'gcc -ansi -pedantic' is a
       conforming freestanding implementation, and it is therefore
!      required to define '__STDC__', even though it does not come with an
!      ISO C library.
  
!      Sometimes people say that defining '__STDC__' in a compiler that
       does not completely conform to the ISO C standard somehow violates
       the standard.  This is illogical.  The standard is a standard for
!      compilers that claim to support ISO C, such as 'gcc -ansi'--not for
!      other compilers such as plain 'gcc'.  Whatever the ISO C standard
!      says is relevant to the design of plain 'gcc' without '-ansi' only
!      for pragmatic reasons, not as a requirement.
  
!      GCC normally defines '__STDC__' to be 1, and in addition defines
!      '__STRICT_ANSI__' if you specify the '-ansi' option, or a '-std'
       option for strict conformance to some version of ISO C.  On some
       hosts, system include files use a different convention, where
!      '__STDC__' is normally 0, but is 1 if the user specifies strict
       conformance to the C Standard.  GCC follows the host convention
       when processing system include files, but when processing user
       files it follows the usual GNU C convention.
  
!    * Undefining '__STDC__' in C++.
  
!      Programs written to compile with C++-to-C translators get the value
!      of '__STDC__' that goes with the C compiler that is subsequently
!      used.  These programs must test '__STDC__' to determine what kind
!      of C preprocessor that compiler uses: whether they should
!      concatenate tokens in the ISO C fashion or in the traditional
!      fashion.
  
!      These programs work properly with GNU C++ if '__STDC__' is defined.
       They would not work otherwise.
  
!      In addition, many header files are written to provide prototypes in
!      ISO C but not in traditional C.  Many of these header files can
!      work without change in C++ provided '__STDC__' is defined.  If
!      '__STDC__' is not defined, they will all fail, and will all need to
!      be changed to test explicitly for C++ as well.
  
     * Deleting "empty" loops.
  
*************** do not make because we think GCC is bett
*** 45839,45845 ****
       programs run any faster.
  
       However, the rationale here is that optimization of a nonempty loop
!      cannot produce an empty one. This held for carefully written C
       compiled with less powerful optimizers but is not always the case
       for carefully written C++ or with more powerful optimizers.  Thus
       GCC will remove operations from loops whenever it can determine
--- 45503,45509 ----
       programs run any faster.
  
       However, the rationale here is that optimization of a nonempty loop
!      cannot produce an empty one.  This held for carefully written C
       compiled with less powerful optimizers but is not always the case
       for carefully written C++ or with more powerful optimizers.  Thus
       GCC will remove operations from loops whenever it can determine
*************** do not make because we think GCC is bett
*** 45849,45855 ****
  
       Be aware of this when performing timing tests, for instance the
       following loop can be completely removed, provided
!      `some_expression' can provably not change any global state.
  
            {
               int sum = 0;
--- 45513,45519 ----
  
       Be aware of this when performing timing tests, for instance the
       following loop can be completely removed, provided
!      'some_expression' can provably not change any global state.
  
            {
               int sum = 0;
*************** do not make because we think GCC is bett
*** 45859,45865 ****
                  sum += some_expression;
            }
  
!      Even though `sum' is accumulated in the loop, no use is made of
       that summation, so the accumulation can be removed.
  
     * Making side effects happen in the same order as in some other
--- 45523,45529 ----
                  sum += some_expression;
            }
  
!      Even though 'sum' is accumulated in the loop, no use is made of
       that summation, so the accumulation can be removed.
  
     * Making side effects happen in the same order as in some other
*************** do not make because we think GCC is bett
*** 45876,45884 ****
  
       There is no guarantee (in either the C or the C++ standard language
       definitions) that the increments will be evaluated in any
!      particular order.  Either increment might happen first.  `func'
!      might get the arguments `2, 3', or it might get `3, 2', or even
!      `2, 2'.
  
     * Making certain warnings into errors by default.
  
--- 45540,45548 ----
  
       There is no guarantee (in either the C or the C++ standard language
       definitions) that the increments will be evaluated in any
!      particular order.  Either increment might happen first.  'func'
!      might get the arguments '2, 3', or it might get '3, 2', or even '2,
!      2'.
  
     * Making certain warnings into errors by default.
  
*************** do not make because we think GCC is bett
*** 45886,45902 ****
       produce an error message for a certain program.
  
       ISO C requires a "diagnostic" message for certain kinds of invalid
!      programs, but a warning is defined by GCC to count as a
!      diagnostic.  If GCC produces a warning but not an error, that is
!      correct ISO C support.  If testsuites call this "failure", they
!      should be run with the GCC option `-pedantic-errors', which will
!      turn these warnings into errors.
! 
  
  
  File: gcc.info,  Node: Warnings and Errors,  Prev: Non-bugs,  Up: Trouble
  
! 12.9 Warning Messages and Error Messages
  ========================================
  
  The GNU compiler can produce two kinds of diagnostics: errors and
--- 45550,45565 ----
       produce an error message for a certain program.
  
       ISO C requires a "diagnostic" message for certain kinds of invalid
!      programs, but a warning is defined by GCC to count as a diagnostic.
!      If GCC produces a warning but not an error, that is correct ISO C
!      support.  If testsuites call this "failure", they should be run
!      with the GCC option '-pedantic-errors', which will turn these
!      warnings into errors.
  
  
  File: gcc.info,  Node: Warnings and Errors,  Prev: Non-bugs,  Up: Trouble
  
! 13.9 Warning Messages and Error Messages
  ========================================
  
  The GNU compiler can produce two kinds of diagnostics: errors and
*************** warnings.  Each kind has a different pur
*** 45909,45931 ****
       "Warnings" report other unusual conditions in your code that _may_
       indicate a problem, although compilation can (and does) proceed.
       Warning messages also report the source file name and line number,
!      but include the text `warning:' to distinguish them from error
       messages.
  
   Warnings may indicate danger points where you should check to make sure
  that your program really does what you intend; or the use of obsolete
  features; or the use of nonstandard features of GNU C or C++.  Many
! warnings are issued only if you ask for them, with one of the `-W'
! options (for instance, `-Wall' requests a variety of useful warnings).
  
   GCC always tries to compile your program if possible; it never
  gratuitously rejects a program whose meaning is clear merely because
  (for instance) it fails to conform to a standard.  In some cases,
  however, the C and C++ standards specify that certain extensions are
  forbidden, and a diagnostic _must_ be issued by a conforming compiler.
! The `-pedantic' option tells GCC to issue warnings in such cases;
! `-pedantic-errors' says to make them errors instead.  This does not
! mean that _all_ non-ISO constructs get warnings or errors.
  
   *Note Options to Request or Suppress Warnings: Warning Options, for
  more detail on these and related command-line options.
--- 45572,45594 ----
       "Warnings" report other unusual conditions in your code that _may_
       indicate a problem, although compilation can (and does) proceed.
       Warning messages also report the source file name and line number,
!      but include the text 'warning:' to distinguish them from error
       messages.
  
   Warnings may indicate danger points where you should check to make sure
  that your program really does what you intend; or the use of obsolete
  features; or the use of nonstandard features of GNU C or C++.  Many
! warnings are issued only if you ask for them, with one of the '-W'
! options (for instance, '-Wall' requests a variety of useful warnings).
  
   GCC always tries to compile your program if possible; it never
  gratuitously rejects a program whose meaning is clear merely because
  (for instance) it fails to conform to a standard.  In some cases,
  however, the C and C++ standards specify that certain extensions are
  forbidden, and a diagnostic _must_ be issued by a conforming compiler.
! The '-pedantic' option tells GCC to issue warnings in such cases;
! '-pedantic-errors' says to make them errors instead.  This does not mean
! that _all_ non-ISO constructs get warnings or errors.
  
   *Note Options to Request or Suppress Warnings: Warning Options, for
  more detail on these and related command-line options.
*************** more detail on these and related command
*** 45933,45939 ****
  
  File: gcc.info,  Node: Bugs,  Next: Service,  Prev: Trouble,  Up: Top
  
! 13 Reporting Bugs
  *****************
  
  Your bug reports play an essential role in making GCC reliable.
--- 45596,45602 ----
  
  File: gcc.info,  Node: Bugs,  Next: Service,  Prev: Trouble,  Up: Top
  
! 14 Reporting Bugs
  *****************
  
  Your bug reports play an essential role in making GCC reliable.
*************** report the problem.
*** 45950,45956 ****
  
  File: gcc.info,  Node: Bug Criteria,  Next: Bug Reporting,  Up: Bugs
  
! 13.1 Have You Found a Bug?
  ==========================
  
  If you are not sure whether you have found a bug, here are some
--- 45613,45619 ----
  
  File: gcc.info,  Node: Bug Criteria,  Next: Bug Reporting,  Up: Bugs
  
! 14.1 Have You Found a Bug?
  ==========================
  
  If you are not sure whether you have found a bug, here are some
*************** guidelines:
*** 45960,45966 ****
       is a compiler bug.  Reliable compilers never crash.
  
     * If the compiler produces invalid assembly code, for any input
!      whatever (except an `asm' statement), that is a compiler bug,
       unless the compiler reports errors (not just warnings) which would
       ordinarily prevent the assembler from being run.
  
--- 45623,45629 ----
       is a compiler bug.  Reliable compilers never crash.
  
     * If the compiler produces invalid assembly code, for any input
!      whatever (except an 'asm' statement), that is a compiler bug,
       unless the compiler reports errors (not just warnings) which would
       ordinarily prevent the assembler from being run.
  
*************** guidelines:
*** 45971,45983 ****
       program whose behavior is undefined, which happened by chance to
       give the desired results with another C or C++ compiler.
  
!      For example, in many nonoptimizing compilers, you can write `x;'
!      at the end of a function instead of `return x;', with the same
!      results.  But the value of the function is undefined if `return'
!      is omitted; it is not a bug when GCC produces different results.
  
       Problems often result from expressions with two increment
!      operators, as in `f (*p++, *p++)'.  Your previous compiler might
       have interpreted that expression the way you intended; GCC might
       interpret it another way.  Neither compiler is wrong.  The bug is
       in your code.
--- 45634,45646 ----
       program whose behavior is undefined, which happened by chance to
       give the desired results with another C or C++ compiler.
  
!      For example, in many nonoptimizing compilers, you can write 'x;' at
!      the end of a function instead of 'return x;', with the same
!      results.  But the value of the function is undefined if 'return' is
!      omitted; it is not a bug when GCC produces different results.
  
       Problems often result from expressions with two increment
!      operators, as in 'f (*p++, *p++)'.  Your previous compiler might
       have interpreted that expression the way you intended; GCC might
       interpret it another way.  Neither compiler is wrong.  The bug is
       in your code.
*************** guidelines:
*** 46001,46016 ****
  
  File: gcc.info,  Node: Bug Reporting,  Prev: Bug Criteria,  Up: Bugs
  
! 13.2 How and Where to Report Bugs
  =================================
  
  Bugs should be reported to the bug database at
! `http://gcc.gnu.org/bugs.html'.
  
  
  File: gcc.info,  Node: Service,  Next: Contributing,  Prev: Bugs,  Up: Top
  
! 14 How To Get Help with GCC
  ***************************
  
  If you need help installing, using or changing GCC, there are two ways
--- 45664,45679 ----
  
  File: gcc.info,  Node: Bug Reporting,  Prev: Bug Criteria,  Up: Bugs
  
! 14.2 How and Where to Report Bugs
  =================================
  
  Bugs should be reported to the bug database at
! <http://gcc.gnu.org/bugs.html>.
  
  
  File: gcc.info,  Node: Service,  Next: Contributing,  Prev: Bugs,  Up: Top
  
! 15 How To Get Help with GCC
  ***************************
  
  If you need help installing, using or changing GCC, there are two ways
*************** to find it:
*** 46025,46054 ****
  
     * Look in the service directory for someone who might help you for a
       fee.  The service directory is found at
!      `http://www.fsf.org/resources/service'.
  
!  For further information, see `http://gcc.gnu.org/faq.html#support'.
  
  
  File: gcc.info,  Node: Contributing,  Next: Funding,  Prev: Service,  Up: Top
  
! 15 Contributing to GCC Development
  **********************************
  
  If you would like to help pretest GCC releases to assure they work well,
  current development sources are available by SVN (see
! `http://gcc.gnu.org/svn.html').  Source and binary snapshots are also
! available for FTP; see `http://gcc.gnu.org/snapshots.html'.
  
   If you would like to work on improvements to GCC, please read the
  advice at these URLs:
  
!      `http://gcc.gnu.org/contribute.html'
!      `http://gcc.gnu.org/contributewhy.html'
  
  for information on how to make useful contributions and avoid
  duplication of effort.  Suggested projects are listed at
! `http://gcc.gnu.org/projects/'.
  
  
  File: gcc.info,  Node: Funding,  Next: GNU Project,  Prev: Contributing,  Up: Top
--- 45688,45717 ----
  
     * Look in the service directory for someone who might help you for a
       fee.  The service directory is found at
!      <http://www.fsf.org/resources/service>.
  
!  For further information, see <http://gcc.gnu.org/faq.html#support>.
  
  
  File: gcc.info,  Node: Contributing,  Next: Funding,  Prev: Service,  Up: Top
  
! 16 Contributing to GCC Development
  **********************************
  
  If you would like to help pretest GCC releases to assure they work well,
  current development sources are available by SVN (see
! <http://gcc.gnu.org/svn.html>).  Source and binary snapshots are also
! available for FTP; see <http://gcc.gnu.org/snapshots.html>.
  
   If you would like to work on improvements to GCC, please read the
  advice at these URLs:
  
!      <http://gcc.gnu.org/contribute.html>
!      <http://gcc.gnu.org/contributewhy.html>
  
  for information on how to make useful contributions and avoid
  duplication of effort.  Suggested projects are listed at
! <http://gcc.gnu.org/projects/>.
  
  
  File: gcc.info,  Node: Funding,  Next: GNU Project,  Prev: Contributing,  Up: Top
*************** to free software developers--the Free So
*** 46067,46074 ****
  
   The way to convince distributors to do this is to demand it and expect
  it from them.  So when you compare distributors, judge them partly by
! how much they give to free software development.  Show distributors
! they must compete to be the one who gives the most.
  
   To make this approach work, you must insist on numbers that you can
  compare, such as, "We will donate ten dollars to the Frobnitz project
--- 45730,45737 ----
  
   The way to convince distributors to do this is to demand it and expect
  it from them.  So when you compare distributors, judge them partly by
! how much they give to free software development.  Show distributors they
! must compete to be the one who gives the most.
  
   To make this approach work, you must insist on numbers that you can
  compare, such as, "We will donate ten dollars to the Frobnitz project
*************** for comparison.
*** 46078,46085 ****
  
   Even a precise fraction "of the profits from this disk" is not very
  meaningful, since creative accounting and unrelated business decisions
! can greatly alter what fraction of the sales price counts as profit.
! If the price you pay is $50, ten percent of the profit is probably less
  than a dollar; it might be a few cents, or nothing at all.
  
   Some redistributors do development work themselves.  This is useful
--- 45741,45748 ----
  
   Even a precise fraction "of the profits from this disk" is not very
  meaningful, since creative accounting and unrelated business decisions
! can greatly alter what fraction of the sales price counts as profit.  If
! the price you pay is $50, ten percent of the profit is probably less
  than a dollar; it might be a few cents, or nothing at all.
  
   Some redistributors do development work themselves.  This is useful
*************** difference than others.  For example, ma
*** 46089,46096 ****
  a program contributes very little; maintaining the standard version of a
  program for the whole community contributes much.  Easy new ports
  contribute little, since someone else would surely do them; difficult
! ports such as adding a new CPU to the GNU Compiler Collection
! contribute more; major new features or packages contribute the most.
  
   By establishing the idea that supporting further development is "the
  proper thing to do" when distributing free software for a fee, we can
--- 45752,45759 ----
  a program contributes very little; maintaining the standard version of a
  program for the whole community contributes much.  Easy new ports
  contribute little, since someone else would surely do them; difficult
! ports such as adding a new CPU to the GNU Compiler Collection contribute
! more; major new features or packages contribute the most.
  
   By establishing the idea that supporting further development is "the
  proper thing to do" when distributing free software for a fee, we can
*************** now widely used; though these systems ar
*** 46114,46121 ****
  they are more accurately called GNU/Linux systems.
  
   For more information, see:
!      `http://www.gnu.org/'
!      `http://www.gnu.org/gnu/linux-and-gnu.html'
  
  
  File: gcc.info,  Node: Copying,  Next: GNU Free Documentation License,  Prev: GNU Project,  Up: Top
--- 45777,45784 ----
  they are more accurately called GNU/Linux systems.
  
   For more information, see:
!      <http://www.gnu.org/>
!      <http://www.gnu.org/gnu/linux-and-gnu.html>
  
  
  File: gcc.info,  Node: Copying,  Next: GNU Free Documentation License,  Prev: GNU Project,  Up: Top
*************** GNU General Public License
*** 46125,46131 ****
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
--- 45788,45794 ----
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
*************** GNU General Public License for most of o
*** 46145,46171 ****
  any other work released this way by its authors.  You can apply it to
  your programs, too.
  
!  When we speak of free software, we are referring to freedom, not
! price.  Our General Public Licenses are designed to make sure that you
! have the freedom to distribute copies of free software (and charge for
! them if you wish), that you receive source code or can get it if you
! want it, that you can change the software or use pieces of it in new
! free programs, and that you know you can do these things.
  
   To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you
! have certain responsibilities if you distribute copies of the software,
! or if you modify it: responsibilities to respect the freedom of others.
  
!  For example, if you distribute copies of such a program, whether
! gratis or for a fee, you must pass on to the recipients the same
! freedoms that you received.  You must make sure that they, too, receive
! or can get the source code.  And you must show them these terms so they
! know their rights.
  
!  Developers that use the GNU GPL protect your rights with two steps:
! (1) assert copyright on the software, and (2) offer you this License
! giving you legal permission to copy, distribute and/or modify it.
  
   For the developers' and authors' protection, the GPL clearly explains
  that there is no warranty for this free software.  For both users' and
--- 45808,45834 ----
  any other work released this way by its authors.  You can apply it to
  your programs, too.
  
!  When we speak of free software, we are referring to freedom, not price.
! Our General Public Licenses are designed to make sure that you have the
! freedom to distribute copies of free software (and charge for them if
! you wish), that you receive source code or can get it if you want it,
! that you can change the software or use pieces of it in new free
! programs, and that you know you can do these things.
  
   To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you have
! certain responsibilities if you distribute copies of the software, or if
! you modify it: responsibilities to respect the freedom of others.
  
!  For example, if you distribute copies of such a program, whether gratis
! or for a fee, you must pass on to the recipients the same freedoms that
! you received.  You must make sure that they, too, receive or can get the
! source code.  And you must show them these terms so they know their
! rights.
  
!  Developers that use the GNU GPL protect your rights with two steps: (1)
! assert copyright on the software, and (2) offer you this License giving
! you legal permission to copy, distribute and/or modify it.
  
   For the developers' and authors' protection, the GPL clearly explains
  that there is no warranty for this free software.  For both users' and
*************** changed, so that their problems will not
*** 46174,46189 ****
  authors of previous versions.
  
   Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the
! manufacturer can do so.  This is fundamentally incompatible with the
! aim of protecting users' freedom to change the software.  The
! systematic pattern of such abuse occurs in the area of products for
! individuals to use, which is precisely where it is most unacceptable.
! Therefore, we have designed this version of the GPL to prohibit the
! practice for those products.  If such problems arise substantially in
! other domains, we stand ready to extend this provision to those domains
! in future versions of the GPL, as needed to protect the freedom of
! users.
  
   Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
--- 45837,45851 ----
  authors of previous versions.
  
   Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the manufacturer
! can do so.  This is fundamentally incompatible with the aim of
! protecting users' freedom to change the software.  The systematic
! pattern of such abuse occurs in the area of products for individuals to
! use, which is precisely where it is most unacceptable.  Therefore, we
! have designed this version of the GPL to prohibit the practice for those
! products.  If such problems arise substantially in other domains, we
! stand ready to extend this provision to those domains in future versions
! of the GPL, as needed to protect the freedom of users.
  
   Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
*************** TERMS AND CONDITIONS
*** 46220,46227 ****
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it
!      on a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
--- 45882,45889 ----
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it on
!      a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
*************** TERMS AND CONDITIONS
*** 46235,46242 ****
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may
!      convey the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
--- 45897,45904 ----
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may convey
!      the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
*************** TERMS AND CONDITIONS
*** 46244,46251 ****
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any
!      non-source form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
--- 45906,45913 ----
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any non-source
!      form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
*************** TERMS AND CONDITIONS
*** 46256,46265 ****
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work
!      with that Major Component, or to implement a Standard Interface
!      for which an implementation is available to the public in source
!      code form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
--- 45918,45927 ----
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work with
!      that Major Component, or to implement a Standard Interface for
!      which an implementation is available to the public in source code
!      form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
*************** TERMS AND CONDITIONS
*** 46267,46281 ****
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including
!      scripts to control those activities.  However, it does not include
!      the work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files
!      associated with source files for the work, and the source code for
!      shared libraries and dynamically linked subprograms that the work
!      is specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
--- 45929,45943 ----
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including scripts
!      to control those activities.  However, it does not include the
!      work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files associated
!      with source files for the work, and the source code for shared
!      libraries and dynamically linked subprograms that the work is
!      specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
*************** TERMS AND CONDITIONS
*** 46292,46313 ****
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output,
!      given its content, constitutes a covered work.  This License
!      acknowledges your rights of fair use or other equivalent, as
!      provided by copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for
!      you, or provide you with facilities for running those works,
!      provided that you comply with the terms of this License in
!      conveying all material for which you do not control copyright.
!      Those thus making or running the covered works for you must do so
!      exclusively on your behalf, under your direction and control, on
!      terms that prohibit them from making any copies of your
!      copyrighted material outside their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
--- 45954,45975 ----
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output, given
!      its content, constitutes a covered work.  This License acknowledges
!      your rights of fair use or other equivalent, as provided by
!      copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for you,
!      or provide you with facilities for running those works, provided
!      that you comply with the terms of this License in conveying all
!      material for which you do not control copyright.  Those thus making
!      or running the covered works for you must do so exclusively on your
!      behalf, under your direction and control, on terms that prohibit
!      them from making any copies of your copyrighted material outside
!      their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
*************** TERMS AND CONDITIONS
*** 46324,46331 ****
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention
!      to limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
--- 45986,45993 ----
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention to
!      limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
*************** TERMS AND CONDITIONS
*** 46395,46402 ****
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for
!           as long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
--- 46057,46064 ----
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for as
!           long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
*************** TERMS AND CONDITIONS
*** 46406,46437 ****
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of
!           the written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access
!           to the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated
!           by you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to
!           the object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long
!           as needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
- 
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
--- 46068,46098 ----
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of the
!           written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access to
!           the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated by
!           you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to the
!           object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long as
!           needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
*************** TERMS AND CONDITIONS
*** 46439,46446 ****
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product
!      is a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
--- 46100,46107 ----
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product is
!      a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
*************** TERMS AND CONDITIONS
*** 46471,46481 ****
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or
!      installed by the recipient, or for the User Product in which it
!      has been modified or installed.  Access to a network may be denied
!      when the modification itself materially and adversely affects the
!      operation of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
--- 46132,46142 ----
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or installed
!      by the recipient, or for the User Product in which it has been
!      modified or installed.  Access to a network may be denied when the
!      modification itself materially and adversely affects the operation
!      of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
*************** TERMS AND CONDITIONS
*** 46505,46512 ****
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License
!      with terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
--- 46166,46173 ----
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License with
!      terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
*************** TERMS AND CONDITIONS
*** 46516,46524 ****
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be
!           marked in reasonable ways as different from the original
!           version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
--- 46177,46184 ----
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be marked
!           in reasonable ways as different from the original version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
*************** TERMS AND CONDITIONS
*** 46537,46547 ****
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or
!      conveying under this License, you may add to a covered work
!      material governed by the terms of that license document, provided
!      that the further restriction does not survive such relicensing or
!      conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
--- 46197,46206 ----
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or conveying
!      under this License, you may add to a covered work material governed
!      by the terms of that license document, provided that the further
!      restriction does not survive such relicensing or conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
*************** TERMS AND CONDITIONS
*** 46557,46569 ****
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under
!      the third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 46216,46228 ----
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under the
!      third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** TERMS AND CONDITIONS
*** 46575,46584 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, you do not qualify to receive new
!      licenses for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
--- 46234,46243 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, you do not qualify to receive new licenses
!      for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
*************** TERMS AND CONDITIONS
*** 46592,46598 ****
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!  10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
--- 46251,46257 ----
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!   10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
*************** TERMS AND CONDITIONS
*** 46606,46626 ****
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to
!      possession of the Corresponding Source of the work from the
!      predecessor in interest, if the predecessor has it or can get it
!      with reasonable efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for
!      exercise of rights granted under this License, and you may not
!      initiate litigation (including a cross-claim or counterclaim in a
!      lawsuit) alleging that any patent claim is infringed by making,
!      using, selling, offering for sale, or importing the Program or any
!      portion of it.
  
!  11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
--- 46265,46285 ----
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to possession
!      of the Corresponding Source of the work from the predecessor in
!      interest, if the predecessor has it or can get it with reasonable
!      efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for exercise
!      of rights granted under this License, and you may not initiate
!      litigation (including a cross-claim or counterclaim in a lawsuit)
!      alleging that any patent claim is infringed by making, using,
!      selling, offering for sale, or importing the Program or any portion
!      of it.
  
!   11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
*************** TERMS AND CONDITIONS
*** 46640,46654 ****
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its
!      contributor version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To
!      "grant" such a patent license to a party means to make such an
!      agreement or commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
--- 46299,46313 ----
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its contributor
!      version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To "grant"
!      such a patent license to a party means to make such an agreement or
!      commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
*************** TERMS AND CONDITIONS
*** 46678,46713 ****
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under
!      which you make payment to the third party based on the extent of
!      your activity of conveying the work, and under which the third
!      party grants, to any of the parties who would receive the covered
!      work from you, a discriminatory patent license (a) in connection
!      with copies of the covered work conveyed by you (or copies made
!      from those copies), or (b) primarily for and in connection with
!      specific products or compilations that contain the covered work,
!      unless you entered into that arrangement, or that patent license
!      was granted, prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!  12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order,
!      agreement or otherwise) that contradict the conditions of this
!      License, they do not excuse you from the conditions of this
!      License.  If you cannot convey a covered work so as to satisfy
!      simultaneously your obligations under this License and any other
!      pertinent obligations, then as a consequence you may not convey it
!      at all.  For example, if you agree to terms that obligate you to
!      collect a royalty for further conveying from those to whom you
!      convey the Program, the only way you could satisfy both those
!      terms and this License would be to refrain entirely from conveying
!      the Program.
  
!  13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
--- 46337,46371 ----
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under which
!      you make payment to the third party based on the extent of your
!      activity of conveying the work, and under which the third party
!      grants, to any of the parties who would receive the covered work
!      from you, a discriminatory patent license (a) in connection with
!      copies of the covered work conveyed by you (or copies made from
!      those copies), or (b) primarily for and in connection with specific
!      products or compilations that contain the covered work, unless you
!      entered into that arrangement, or that patent license was granted,
!      prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!   12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order, agreement
!      or otherwise) that contradict the conditions of this License, they
!      do not excuse you from the conditions of this License.  If you
!      cannot convey a covered work so as to satisfy simultaneously your
!      obligations under this License and any other pertinent obligations,
!      then as a consequence you may not convey it at all.  For example,
!      if you agree to terms that obligate you to collect a royalty for
!      further conveying from those to whom you convey the Program, the
!      only way you could satisfy both those terms and this License would
!      be to refrain entirely from conveying the Program.
  
!   13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
*************** TERMS AND CONDITIONS
*** 46718,46739 ****
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!  14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.
!      Such new versions will be similar in spirit to the present
!      version, but may differ in detail to address new problems or
!      concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the
!      Free Software Foundation.  If the Program does not specify a
!      version number of the GNU General Public License, you may choose
!      any version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
--- 46376,46396 ----
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!   14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.  Such
!      new versions will be similar in spirit to the present version, but
!      may differ in detail to address new problems or concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the Free
!      Software Foundation.  If the Program does not specify a version
!      number of the GNU General Public License, you may choose any
!      version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
*************** TERMS AND CONDITIONS
*** 46745,46768 ****
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!  15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!  16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU
!      FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
--- 46402,46425 ----
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!   15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!   16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR
!      DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
*************** TERMS AND CONDITIONS
*** 46770,46776 ****
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!  17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
--- 46427,46433 ----
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!   17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
*************** TERMS AND CONDITIONS
*** 46779,46785 ****
       connection with the Program, unless a warranty or assumption of
       liability accompanies a copy of the Program in return for a fee.
  
- 
  END OF TERMS AND CONDITIONS
  ===========================
  
--- 46436,46441 ----
*************** possible use to the public, the best way
*** 46791,46799 ****
  free software which everyone can redistribute and change under these
  terms.
  
!  To do so, attach the following notices to the program.  It is safest
! to attach them to the start of each source file to most effectively
! state the exclusion of warranty; and each file should have at least the
  "copyright" line and a pointer to where the full notice is found.
  
       ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES.
--- 46447,46455 ----
  free software which everyone can redistribute and change under these
  terms.
  
!  To do so, attach the following notices to the program.  It is safest to
! attach them to the start of each source file to most effectively state
! the exclusion of warranty; and each file should have at least the
  "copyright" line and a pointer to where the full notice is found.
  
       ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES.
*************** state the exclusion of warranty; and eac
*** 46810,46829 ****
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see `http://www.gnu.org/licenses/'.
  
   Also add information on how to contact you by electronic and paper
  mail.
  
!  If the program does terminal interaction, make it output a short
! notice like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type `show c' for details.
  
!  The hypothetical commands `show w' and `show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
--- 46466,46485 ----
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see <http://www.gnu.org/licenses/>.
  
   Also add information on how to contact you by electronic and paper
  mail.
  
!  If the program does terminal interaction, make it output a short notice
! like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type 'show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type 'show c' for details.
  
!  The hypothetical commands 'show w' and 'show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
*************** use an "about box".
*** 46831,46844 ****
   You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see `http://www.gnu.org/licenses/'.
  
   The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read `http://www.gnu.org/philosophy/why-not-lgpl.html'.
  
  
  File: gcc.info,  Node: GNU Free Documentation License,  Next: Contributors,  Prev: Copying,  Up: Top
--- 46487,46500 ----
   You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see <http://www.gnu.org/licenses/>.
  
   The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read <http://www.gnu.org/philosophy/why-not-lgpl.html>.
  
  
  File: gcc.info,  Node: GNU Free Documentation License,  Next: Contributors,  Prev: Copying,  Up: Top
*************** GNU Free Documentation License
*** 46849,46855 ****
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
--- 46505,46511 ----
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
*************** GNU Free Documentation License
*** 46874,46894 ****
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.
!      We recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it
!      can be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You
!      accept the license if you copy, modify or distribute the work in a
!      way requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
--- 46530,46550 ----
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.  We
!      recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it can
!      be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You accept
!      the license if you copy, modify or distribute the work in a way
!      requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
*************** GNU Free Documentation License
*** 46906,46917 ****
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in
!      the notice that says that the Document is released under this
!      License.  If a section does not fit the above definition of
!      Secondary then it is not allowed to be designated as Invariant.
!      The Document may contain zero Invariant Sections.  If the Document
!      does not identify any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
--- 46562,46573 ----
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in the
!      notice that says that the Document is released under this License.
!      If a section does not fit the above definition of Secondary then it
!      is not allowed to be designated as Invariant.  The Document may
!      contain zero Invariant Sections.  If the Document does not identify
!      any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
*************** GNU Free Documentation License
*** 46922,46948 ****
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images
!      composed of pixels) generic paint programs or (for drawings) some
!      widely available drawing editor, and that is suitable for input to
!      text formatters or for automatic translation to a variety of
!      formats suitable for input to text formatters.  A copy made in an
!      otherwise Transparent file format whose markup, or absence of
!      markup, has been arranged to thwart or discourage subsequent
!      modification by readers is not Transparent.  An image format is
!      not Transparent if used for any substantial amount of text.  A
!      copy that is not "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and
!      standard-conforming simple HTML, PostScript or PDF designed for
!      human modification.  Examples of transparent image formats include
!      PNG, XCF and JPG.  Opaque formats include proprietary formats that
!      can be read and edited only by proprietary word processors, SGML or
!      XML for which the DTD and/or processing tools are not generally
!      available, and the machine-generated HTML, PostScript or PDF
!      produced by some word processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
--- 46578,46604 ----
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images composed
!      of pixels) generic paint programs or (for drawings) some widely
!      available drawing editor, and that is suitable for input to text
!      formatters or for automatic translation to a variety of formats
!      suitable for input to text formatters.  A copy made in an otherwise
!      Transparent file format whose markup, or absence of markup, has
!      been arranged to thwart or discourage subsequent modification by
!      readers is not Transparent.  An image format is not Transparent if
!      used for any substantial amount of text.  A copy that is not
!      "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and standard-conforming
!      simple HTML, PostScript or PDF designed for human modification.
!      Examples of transparent image formats include PNG, XCF and JPG.
!      Opaque formats include proprietary formats that can be read and
!      edited only by proprietary word processors, SGML or XML for which
!      the DTD and/or processing tools are not generally available, and
!      the machine-generated HTML, PostScript or PDF produced by some word
!      processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
*************** GNU Free Documentation License
*** 46980,46987 ****
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow
!      the conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
--- 46636,46643 ----
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow the
!      conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
*************** GNU Free Documentation License
*** 46995,47006 ****
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the
!      title equally prominent and visible.  You may add other material
!      on the covers in addition.  Copying with changes limited to the
!      covers, as long as they preserve the title of the Document and
!      satisfy these conditions, can be treated as verbatim copying in
!      other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
--- 46651,46661 ----
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the title
!      equally prominent and visible.  You may add other material on the
!      covers in addition.  Copying with changes limited to the covers, as
!      long as they preserve the title of the Document and satisfy these
!      conditions, can be treated as verbatim copying in other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
*************** GNU Free Documentation License
*** 47008,47047 ****
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a
!      machine-readable Transparent copy along with each Opaque copy, or
!      state in or with each Opaque copy a computer-network location from
!      which the general network-using public has access to download
!      using public-standard network protocols a complete Transparent
!      copy of the Document, free of added material.  If you use the
!      latter option, you must take reasonably prudent steps, when you
!      begin distribution of Opaque copies in quantity, to ensure that
!      this Transparent copy will remain thus accessible at the stated
!      location until at least one year after the last time you
!      distribute an Opaque copy (directly or through your agents or
!      retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of
!      copies, to give them a chance to provide you with an updated
!      version of the Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with
!      the Modified Version filling the role of the Document, thus
!      licensing distribution and modification of the Modified Version to
!      whoever possesses a copy of it.  In addition, you must do these
!      things in the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of
!           previous versions (which should, if there were any, be listed
!           in the History section of the Document).  You may use the
!           same title as a previous version if the original publisher of
!           that version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
--- 46663,46701 ----
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a machine-readable
!      Transparent copy along with each Opaque copy, or state in or with
!      each Opaque copy a computer-network location from which the general
!      network-using public has access to download using public-standard
!      network protocols a complete Transparent copy of the Document, free
!      of added material.  If you use the latter option, you must take
!      reasonably prudent steps, when you begin distribution of Opaque
!      copies in quantity, to ensure that this Transparent copy will
!      remain thus accessible at the stated location until at least one
!      year after the last time you distribute an Opaque copy (directly or
!      through your agents or retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of copies,
!      to give them a chance to provide you with an updated version of the
!      Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with the
!      Modified Version filling the role of the Document, thus licensing
!      distribution and modification of the Modified Version to whoever
!      possesses a copy of it.  In addition, you must do these things in
!      the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of previous
!           versions (which should, if there were any, be listed in the
!           History section of the Document).  You may use the same title
!           as a previous version if the original publisher of that
!           version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
*************** GNU Free Documentation License
*** 47071,47101 ****
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on
!           the Title Page.  If there is no section Entitled "History" in
!           the Document, create one stating the title, year, authors,
!           and publisher of the Document as given on its Title Page,
!           then add an item describing the Modified Version as stated in
!           the previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in
!           the "History" section.  You may omit a network location for a
!           work that was published at least four years before the
!           Document itself, or if the original publisher of the version
!           it refers to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the
!           section all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document,
!           unaltered in their text and in their titles.  Section numbers
!           or the equivalent are not considered part of the section
!           titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
--- 46725,46754 ----
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on the
!           Title Page.  If there is no section Entitled "History" in the
!           Document, create one stating the title, year, authors, and
!           publisher of the Document as given on its Title Page, then add
!           an item describing the Modified Version as stated in the
!           previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in the
!           "History" section.  You may omit a network location for a work
!           that was published at least four years before the Document
!           itself, or if the original publisher of the version it refers
!           to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the section
!           all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document, unaltered
!           in their text and in their titles.  Section numbers or the
!           equivalent are not considered part of the section titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
*************** GNU Free Documentation License
*** 47108,47118 ****
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option
!      designate some or all of these sections as invariant.  To do this,
!      add their titles to the list of Invariant Sections in the Modified
!      Version's license notice.  These titles must be distinct from any
!      other section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
--- 46761,46771 ----
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option designate
!      some or all of these sections as invariant.  To do this, add their
!      titles to the list of Invariant Sections in the Modified Version's
!      license notice.  These titles must be distinct from any other
!      section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
*************** GNU Free Documentation License
*** 47121,47135 ****
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end
!      of the list of Cover Texts in the Modified Version.  Only one
!      passage of Front-Cover Text and one of Back-Cover Text may be
!      added by (or through arrangements made by) any one entity.  If the
!      Document already includes a cover text for the same cover,
!      previously added by you or by arrangement made by the same entity
!      you are acting on behalf of, you may not add another; but you may
!      replace the old one, on explicit permission from the previous
!      publisher that added the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
--- 46774,46788 ----
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end of
!      the list of Cover Texts in the Modified Version.  Only one passage
!      of Front-Cover Text and one of Back-Cover Text may be added by (or
!      through arrangements made by) any one entity.  If the Document
!      already includes a cover text for the same cover, previously added
!      by you or by arrangement made by the same entity you are acting on
!      behalf of, you may not add another; but you may replace the old
!      one, on explicit permission from the previous publisher that added
!      the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
*************** GNU Free Documentation License
*** 47139,47146 ****
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination
!      all of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
--- 46792,46799 ----
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination all
!      of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
*************** GNU Free Documentation License
*** 47167,47186 ****
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the
!      documents in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow
!      this License in all other respects regarding verbatim copying of
!      that document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of
!      a storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
--- 46820,46839 ----
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the documents
!      in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow this
!      License in all other respects regarding verbatim copying of that
!      document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of a
!      storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
*************** GNU Free Documentation License
*** 47225,47232 ****
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 46878,46885 ----
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** GNU Free Documentation License
*** 47238,47270 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, receipt of a copy of some or all of
!      the same material does not give you any rights to use it.
  
!  10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      `http://www.gnu.org/copyleft/'.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If
!      the Document does not specify a version number of this License,
!      you may choose any version ever published (not as a draft) by the
!      Free Software Foundation.  If the Document specifies that a proxy
!      can decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!  11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
--- 46891,46923 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, receipt of a copy of some or all of the
!      same material does not give you any rights to use it.
  
!   10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      <http://www.gnu.org/copyleft/>.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If the
!      Document does not specify a version number of this License, you may
!      choose any version ever published (not as a draft) by the Free
!      Software Foundation.  If the Document specifies that a proxy can
!      decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!   11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
*************** GNU Free Documentation License
*** 47294,47300 ****
       site under CC-BY-SA on the same site at any time before August 1,
       2009, provided the MMC is eligible for relicensing.
  
- 
  ADDENDUM: How to use this License for your documents
  ====================================================
  
--- 46947,46952 ----
*************** notices just after the title page:
*** 47311,47317 ****
         Free Documentation License''.
  
   If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
! replace the "with...Texts." line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
--- 46963,46969 ----
         Free Documentation License''.
  
   If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
! replace the "with...Texts."  line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
*************** combination of the three, merge those tw
*** 47322,47330 ****
  situation.
  
   If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of
! free software license, such as the GNU General Public License, to
! permit their use in free software.
  
  
  File: gcc.info,  Node: Contributors,  Next: Option Index,  Prev: GNU Free Documentation License,  Up: Top
--- 46974,46982 ----
  situation.
  
   If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of free
! software license, such as the GNU General Public License, to permit
! their use in free software.
  
  
  File: gcc.info,  Node: Contributors,  Next: Option Index,  Prev: GNU Free Documentation License,  Up: Top
*************** File: gcc.info,  Node: Contributors,  Ne
*** 47332,47340 ****
  Contributors to GCC
  *******************
  
! The GCC project would like to thank its many contributors.  Without
! them the project would not have been nearly as successful as it has
! been.  Any omissions in this list are accidental.  Feel free to contact
  <law@redhat.com> or <gerald@pfeifer.com> if you have been left out or
  some of your contributions are not listed.  Please keep this list in
  alphabetical order.
--- 46984,46992 ----
  Contributors to GCC
  *******************
  
! The GCC project would like to thank its many contributors.  Without them
! the project would not have been nearly as successful as it has been.
! Any omissions in this list are accidental.  Feel free to contact
  <law@redhat.com> or <gerald@pfeifer.com> if you have been left out or
  some of your contributions are not listed.  Please keep this list in
  alphabetical order.
*************** alphabetical order.
*** 47467,47473 ****
     * The GNU Classpath project for all of their merged runtime code.
  
     * Nick Clifton for arm, mcore, fr30, v850, m32r, msp430 rx work,
!      `--help', and other random hacking.
  
     * Michael Cook for libstdc++ cleanup patches to reduce warnings.
  
--- 47119,47125 ----
     * The GNU Classpath project for all of their merged runtime code.
  
     * Nick Clifton for arm, mcore, fr30, v850, m32r, msp430 rx work,
!      '--help', and other random hacking.
  
     * Michael Cook for libstdc++ cleanup patches to reduce warnings.
  
*************** alphabetical order.
*** 47487,47494 ****
     * Paul Dale for his work to add uClinux platform support to the m68k
       backend.
  
!    * Dario Dariol contributed the four varieties of sample programs
!      that print a copy of their source.
  
     * Russell Davidson for fstream and stringstream fixes in libstdc++.
  
--- 47139,47146 ----
     * Paul Dale for his work to add uClinux platform support to the m68k
       backend.
  
!    * Dario Dariol contributed the four varieties of sample programs that
!      print a copy of their source.
  
     * Russell Davidson for fstream and stringstream fixes in libstdc++.
  
*************** alphabetical order.
*** 47503,47521 ****
  
     * Gabriel Dos Reis for contributions to G++, contributions and
       maintenance of GCC diagnostics infrastructure, libstdc++-v3,
!      including `valarray<>', `complex<>', maintaining the numerics
!      library (including that pesky `<limits>' :-) and keeping
!      up-to-date anything to do with numbers.
  
     * Ulrich Drepper for his work on glibc, testing of GCC using glibc,
!      ISO C99 support, CFG dumping support, etc., plus support of the
!      C++ runtime libraries including for all kinds of C interface
!      issues, contributing and maintaining `complex<>', sanity checking
!      and disbursement, configuration architecture, libio maintenance,
!      and early math work.
  
     * Franc,ois Dumont for his work on libstdc++-v3, especially
!      maintaining and improving `debug-mode' and associative and
       unordered containers.
  
     * Zdenek Dvorak for a new loop unroller and various fixes.
--- 47155,47173 ----
  
     * Gabriel Dos Reis for contributions to G++, contributions and
       maintenance of GCC diagnostics infrastructure, libstdc++-v3,
!      including 'valarray<>', 'complex<>', maintaining the numerics
!      library (including that pesky '<limits>' :-) and keeping up-to-date
!      anything to do with numbers.
  
     * Ulrich Drepper for his work on glibc, testing of GCC using glibc,
!      ISO C99 support, CFG dumping support, etc., plus support of the C++
!      runtime libraries including for all kinds of C interface issues,
!      contributing and maintaining 'complex<>', sanity checking and
!      disbursement, configuration architecture, libio maintenance, and
!      early math work.
  
     * Franc,ois Dumont for his work on libstdc++-v3, especially
!      maintaining and improving 'debug-mode' and associative and
       unordered containers.
  
     * Zdenek Dvorak for a new loop unroller and various fixes.
*************** alphabetical order.
*** 47567,47577 ****
     * Peter Gerwinski for various bug fixes and the Pascal front end.
  
     * Kaveh R. Ghazi for his direction via the steering committee,
!      amazing work to make `-W -Wall -W* -Werror' useful, and testing
!      GCC on a plethora of platforms.  Kaveh extends his gratitude to
!      the CAIP Center at Rutgers University for providing him with
!      computing resources to work on Free Software from the late 1980s
!      to 2010.
  
     * John Gilmore for a donation to the FSF earmarked improving GNU
       Java.
--- 47219,47228 ----
     * Peter Gerwinski for various bug fixes and the Pascal front end.
  
     * Kaveh R. Ghazi for his direction via the steering committee,
!      amazing work to make '-W -Wall -W* -Werror' useful, and testing GCC
!      on a plethora of platforms.  Kaveh extends his gratitude to the
!      CAIP Center at Rutgers University for providing him with computing
!      resources to work on Free Software from the late 1980s to 2010.
  
     * John Gilmore for a donation to the FSF earmarked improving GNU
       Java.
*************** alphabetical order.
*** 47583,47603 ****
       support, improved leaf function register allocation, and his
       direction via the steering committee.
  
!    * Jonny Grant for improvements to `collect2's' `--help'
       documentation.
  
!    * Anthony Green for his `-Os' contributions, the moxie port, and
!      Java front end work.
  
!    * Stu Grossman for gdb hacking, allowing GCJ developers to debug
!      Java code.
  
     * Michael K. Gschwind contributed the port to the PDP-11.
  
     * Richard Biener for his ongoing middle-end contributions and bug
       fixes and for release management.
  
!    * Ron Guilmette implemented the `protoize' and `unprotoize' tools,
       the support for Dwarf symbolic debugging information, and much of
       the support for System V Release 4.  He has also worked heavily on
       the Intel 386 and 860 support.
--- 47234,47254 ----
       support, improved leaf function register allocation, and his
       direction via the steering committee.
  
!    * Jonny Grant for improvements to 'collect2's' '--help'
       documentation.
  
!    * Anthony Green for his '-Os' contributions, the moxie port, and Java
!      front end work.
  
!    * Stu Grossman for gdb hacking, allowing GCJ developers to debug Java
!      code.
  
     * Michael K. Gschwind contributed the port to the PDP-11.
  
     * Richard Biener for his ongoing middle-end contributions and bug
       fixes and for release management.
  
!    * Ron Guilmette implemented the 'protoize' and 'unprotoize' tools,
       the support for Dwarf symbolic debugging information, and much of
       the support for System V Release 4.  He has also worked heavily on
       the Intel 386 and 860 support.
*************** alphabetical order.
*** 47616,47623 ****
       series 300.
  
     * Michael Hayes for various thankless work he's done trying to get
!      the c30/c40 ports functional.  Lots of loop and unroll
!      improvements and fixes.
  
     * Dara Hazeghi for wading through myriads of target-specific bug
       reports.
--- 47267,47274 ----
       series 300.
  
     * Michael Hayes for various thankless work he's done trying to get
!      the c30/c40 ports functional.  Lots of loop and unroll improvements
!      and fixes.
  
     * Dara Hazeghi for wading through myriads of target-specific bug
       reports.
*************** alphabetical order.
*** 47651,47658 ****
  
     * Falk Hueffner for working on C and optimization bug reports.
  
!    * Bernardo Innocenti for his m68k work, including merging of
!      ColdFire improvements and uClinux support.
  
     * Christian Iseli for various bug fixes.
  
--- 47302,47309 ----
  
     * Falk Hueffner for working on C and optimization bug reports.
  
!    * Bernardo Innocenti for his m68k work, including merging of ColdFire
!      improvements and uClinux support.
  
     * Christian Iseli for various bug fixes.
  
*************** alphabetical order.
*** 47705,47717 ****
     * Richard Kenner of the New York University Ultracomputer Research
       Laboratory wrote the machine descriptions for the AMD 29000, the
       DEC Alpha, the IBM RT PC, and the IBM RS/6000 as well as the
!      support for instruction attributes.  He also made changes to
!      better support RISC processors including changes to common
!      subexpression elimination, strength reduction, function calling
!      sequence handling, and condition code support, in addition to
!      generalizing the code for frame pointer elimination and delay slot
!      scheduling.  Richard Kenner was also the head maintainer of GCC
!      for several years.
  
     * Mumit Khan for various contributions to the Cygwin and Mingw32
       ports and maintaining binary releases for Microsoft Windows hosts,
--- 47356,47368 ----
     * Richard Kenner of the New York University Ultracomputer Research
       Laboratory wrote the machine descriptions for the AMD 29000, the
       DEC Alpha, the IBM RT PC, and the IBM RS/6000 as well as the
!      support for instruction attributes.  He also made changes to better
!      support RISC processors including changes to common subexpression
!      elimination, strength reduction, function calling sequence
!      handling, and condition code support, in addition to generalizing
!      the code for frame pointer elimination and delay slot scheduling.
!      Richard Kenner was also the head maintainer of GCC for several
!      years.
  
     * Mumit Khan for various contributions to the Cygwin and Mingw32
       ports and maintaining binary releases for Microsoft Windows hosts,
*************** alphabetical order.
*** 47737,47747 ****
     * Asher Langton and Mike Kumbera for contributing Cray pointer
       support to GNU Fortran, and for other GNU Fortran improvements.
  
!    * Jeff Law for his direction via the steering committee,
!      coordinating the entire egcs project and GCC 2.95, rolling out
!      snapshots and releases, handling merges from GCC2, reviewing tons
!      of patches that might have fallen through the cracks else, and
!      random but extensive hacking.
  
     * Walter Lee for work on the TILE-Gx and TILEPro ports.
  
--- 47388,47398 ----
     * Asher Langton and Mike Kumbera for contributing Cray pointer
       support to GNU Fortran, and for other GNU Fortran improvements.
  
!    * Jeff Law for his direction via the steering committee, coordinating
!      the entire egcs project and GCC 2.95, rolling out snapshots and
!      releases, handling merges from GCC2, reviewing tons of patches that
!      might have fallen through the cracks else, and random but extensive
!      hacking.
  
     * Walter Lee for work on the TILE-Gx and TILEPro ports.
  
*************** alphabetical order.
*** 47770,47776 ****
  
     * Weiwen Liu for testing and various bug fixes.
  
!    * Manuel Lo'pez-Iba'n~ez for improving `-Wconversion' and many other
       diagnostics fixes and improvements.
  
     * Dave Love for his ongoing work with the Fortran front end and
--- 47421,47427 ----
  
     * Weiwen Liu for testing and various bug fixes.
  
!    * Manuel Lo'pez-Iba'n~ez for improving '-Wconversion' and many other
       diagnostics fixes and improvements.
  
     * Dave Love for his ongoing work with the Fortran front end and
*************** alphabetical order.
*** 47787,47800 ****
     * Greg McGary for random fixes and (someday) bounded pointers.
  
     * Andrew MacLeod for his ongoing work in building a real EH system,
!      various code generation improvements, work on the global
!      optimizer, etc.
  
     * Vladimir Makarov for hacking some ugly i960 problems, PowerPC
!      hacking improvements to compile-time performance, overall
!      knowledge and direction in the area of instruction scheduling, and
!      design and implementation of the automaton based instruction
!      scheduler.
  
     * Bob Manson for his behind the scenes work on dejagnu.
  
--- 47438,47450 ----
     * Greg McGary for random fixes and (someday) bounded pointers.
  
     * Andrew MacLeod for his ongoing work in building a real EH system,
!      various code generation improvements, work on the global optimizer,
!      etc.
  
     * Vladimir Makarov for hacking some ugly i960 problems, PowerPC
!      hacking improvements to compile-time performance, overall knowledge
!      and direction in the area of instruction scheduling, and design and
!      implementation of the automaton based instruction scheduler.
  
     * Bob Manson for his behind the scenes work on dejagnu.
  
*************** alphabetical order.
*** 47833,47839 ****
  
     * Mark Mitchell for his direction via the steering committee,
       mountains of C++ work, load/store hoisting out of loops, alias
!      analysis improvements, ISO C `restrict' support, and serving as
       release manager from 2000 to 2011.
  
     * Alan Modra for various GNU/Linux bits and testing.
--- 47483,47489 ----
  
     * Mark Mitchell for his direction via the steering committee,
       mountains of C++ work, load/store hoisting out of loops, alias
!      analysis improvements, ISO C 'restrict' support, and serving as
       release manager from 2000 to 2011.
  
     * Alan Modra for various GNU/Linux bits and testing.
*************** alphabetical order.
*** 47843,47851 ****
  
     * Jason Molenda for major help in the care and feeding of all the
       services on the gcc.gnu.org (formerly egcs.cygnus.com)
!      machine--mail, web services, ftp services, etc etc.  Doing all
!      this work on scrap paper and the backs of envelopes would have
!      been... difficult.
  
     * Catherine Moore for fixing various ugly problems we have sent her
       way, including the haifa bug which was killing the Alpha & PowerPC
--- 47493,47501 ----
  
     * Jason Molenda for major help in the care and feeding of all the
       services on the gcc.gnu.org (formerly egcs.cygnus.com)
!      machine--mail, web services, ftp services, etc etc.  Doing all this
!      work on scrap paper and the backs of envelopes would have been...
!      difficult.
  
     * Catherine Moore for fixing various ugly problems we have sent her
       way, including the haifa bug which was killing the Alpha & PowerPC
*************** alphabetical order.
*** 47857,47864 ****
       initial IA-64 port.
  
     * Stephen Moshier contributed the floating point emulator that
!      assists in cross-compilation and permits support for floating
!      point numbers wider than 64 bits and for ISO C99 support.
  
     * Bill Moyer for his behind the scenes work on various issues.
  
--- 47507,47514 ----
       initial IA-64 port.
  
     * Stephen Moshier contributed the floating point emulator that
!      assists in cross-compilation and permits support for floating point
!      numbers wider than 64 bits and for ISO C99 support.
  
     * Bill Moyer for his behind the scenes work on various issues.
  
*************** alphabetical order.
*** 47881,47889 ****
     * NeXT, Inc. donated the front end that supports the Objective-C
       language.
  
!    * Hans-Peter Nilsson for the CRIS and MMIX ports, improvements to
!      the search engine setup, various documentation fixes and other
!      small fixes.
  
     * Geoff Noer for his work on getting cygwin native builds working.
  
--- 47531,47539 ----
     * NeXT, Inc. donated the front end that supports the Objective-C
       language.
  
!    * Hans-Peter Nilsson for the CRIS and MMIX ports, improvements to the
!      search engine setup, various documentation fixes and other small
!      fixes.
  
     * Geoff Noer for his work on getting cygwin native builds working.
  
*************** alphabetical order.
*** 47891,47898 ****
       tracking web pages, GIMPLE tuples, and assorted fixes.
  
     * David O'Brien for the FreeBSD/alpha, FreeBSD/AMD x86-64,
!      FreeBSD/ARM, FreeBSD/PowerPC, and FreeBSD/SPARC64 ports and
!      related infrastructure improvements.
  
     * Alexandre Oliva for various build infrastructure improvements,
       scripts and amazing testing work, including keeping libtool issues
--- 47541,47548 ----
       tracking web pages, GIMPLE tuples, and assorted fixes.
  
     * David O'Brien for the FreeBSD/alpha, FreeBSD/AMD x86-64,
!      FreeBSD/ARM, FreeBSD/PowerPC, and FreeBSD/SPARC64 ports and related
!      infrastructure improvements.
  
     * Alexandre Oliva for various build infrastructure improvements,
       scripts and amazing testing work, including keeping libtool issues
*************** alphabetical order.
*** 47904,47911 ****
  
     * Rainer Orth for random MIPS work, including improvements to GCC's
       o32 ABI support, improvements to dejagnu's MIPS support, Java
!      configuration clean-ups and porting work, and maintaining the
!      IRIX, Solaris 2, and Tru64 UNIX ports.
  
     * Hartmut Penner for work on the s390 port.
  
--- 47554,47561 ----
  
     * Rainer Orth for random MIPS work, including improvements to GCC's
       o32 ABI support, improvements to dejagnu's MIPS support, Java
!      configuration clean-ups and porting work, and maintaining the IRIX,
!      Solaris 2, and Tru64 UNIX ports.
  
     * Hartmut Penner for work on the s390 port.
  
*************** alphabetical order.
*** 47955,47961 ****
  
     * David Ronis inspired and encouraged Craig to rewrite the G77
       documentation in texinfo format by contributing a first pass at a
!      translation of the old `g77-0.5.16/f/DOC' file.
  
     * Ken Rose for fixes to GCC's delay slot filling code.
  
--- 47605,47611 ----
  
     * David Ronis inspired and encouraged Craig to rewrite the G77
       documentation in texinfo format by contributing a first pass at a
!      translation of the old 'g77-0.5.16/f/DOC' file.
  
     * Ken Rose for fixes to GCC's delay slot filling code.
  
*************** alphabetical order.
*** 47987,47994 ****
     * Tobias Schlu"ter for work on GNU Fortran.
  
     * Bernd Schmidt for various code generation improvements and major
!      work in the reload pass, serving as release manager for GCC
!      2.95.3, and work on the Blackfin and C6X ports.
  
     * Peter Schmid for constant testing of libstdc++--especially
       application testing, going above and beyond what was requested for
--- 47637,47644 ----
     * Tobias Schlu"ter for work on GNU Fortran.
  
     * Bernd Schmidt for various code generation improvements and major
!      work in the reload pass, serving as release manager for GCC 2.95.3,
!      and work on the Blackfin and C6X ports.
  
     * Peter Schmid for constant testing of libstdc++--especially
       application testing, going above and beyond what was requested for
*************** alphabetical order.
*** 48003,48009 ****
     * Dodji Seketeli for numerous C++ bug fixes and debug info
       improvements.
  
!    * Tim Shen for major work on `<regex>'.
  
     * Joel Sherrill for his direction via the steering committee, RTEMS
       contributions and RTEMS testing.
--- 47653,47659 ----
     * Dodji Seketeli for numerous C++ bug fixes and debug info
       improvements.
  
!    * Tim Shen for major work on '<regex>'.
  
     * Joel Sherrill for his direction via the steering committee, RTEMS
       contributions and RTEMS testing.
*************** alphabetical order.
*** 48018,48025 ****
       from the LWG (thereby keeping GCC in line with updates from the
       ISO).
  
!    * Franz Sirl for his ongoing work with making the PPC port stable
!      for GNU/Linux.
  
     * Andrey Slepuhin for assorted AIX hacking.
  
--- 47668,47675 ----
       from the LWG (thereby keeping GCC in line with updates from the
       ISO).
  
!    * Franz Sirl for his ongoing work with making the PPC port stable for
!      GNU/Linux.
  
     * Andrey Slepuhin for assorted AIX hacking.
  
*************** alphabetical order.
*** 48034,48045 ****
     * Randy Smith finished the Sun FPA support.
  
     * Ed Smith-Rowland for his continuous work on libstdc++-v3, special
!      functions, `<random>', and various improvements to C++11 features.
  
     * Scott Snyder for queue, iterator, istream, and string fixes and
       libstdc++ testsuite entries.  Also for providing the patch to G77
!      to add rudimentary support for `INTEGER*1', `INTEGER*2', and
!      `LOGICAL*1'.
  
     * Zdenek Sojka for running automated regression testing of GCC and
       reporting numerous bugs.
--- 47684,47695 ----
     * Randy Smith finished the Sun FPA support.
  
     * Ed Smith-Rowland for his continuous work on libstdc++-v3, special
!      functions, '<random>', and various improvements to C++11 features.
  
     * Scott Snyder for queue, iterator, istream, and string fixes and
       libstdc++ testsuite entries.  Also for providing the patch to G77
!      to add rudimentary support for 'INTEGER*1', 'INTEGER*2', and
!      'LOGICAL*1'.
  
     * Zdenek Sojka for running automated regression testing of GCC and
       reporting numerous bugs.
*************** alphabetical order.
*** 48063,48070 ****
  
     * John Stracke for his Java HTTP protocol fixes.
  
!    * Mike Stump for his Elxsi port, G++ contributions over the years
!      and more recently his vxworks contributions
  
     * Jeff Sturm for Java porting help, bug fixes, and encouragement.
  
--- 47713,47720 ----
  
     * John Stracke for his Java HTTP protocol fixes.
  
!    * Mike Stump for his Elxsi port, G++ contributions over the years and
!      more recently his vxworks contributions
  
     * Jeff Sturm for Java porting help, bug fixes, and encouragement.
  
*************** alphabetical order.
*** 48118,48125 ****
     * Jonathan Wakely for contributing libstdc++ Doxygen notes and XHTML
       guidance.
  
!    * Dean Wakerley for converting the install documentation from HTML
!      to texinfo in time for GCC 3.0.
  
     * Krister Walfridsson for random bug fixes.
  
--- 47768,47775 ----
     * Jonathan Wakely for contributing libstdc++ Doxygen notes and XHTML
       guidance.
  
!    * Dean Wakerley for converting the install documentation from HTML to
!      texinfo in time for GCC 3.0.
  
     * Krister Walfridsson for random bug fixes.
  
*************** alphabetical order.
*** 48127,48134 ****
  
     * Stephen M. Webb for time and effort on making libstdc++ shadow
       files work with the tricky Solaris 8+ headers, and for pushing the
!      build-time header tree. Also, for starting and driving the
!      `<regex>' effort.
  
     * John Wehle for various improvements for the x86 code generator,
       related infrastructure improvements to help x86 code generation,
--- 47777,47784 ----
  
     * Stephen M. Webb for time and effort on making libstdc++ shadow
       files work with the tricky Solaris 8+ headers, and for pushing the
!      build-time header tree.  Also, for starting and driving the
!      '<regex>' effort.
  
     * John Wehle for various improvements for the x86 code generator,
       related infrastructure improvements to help x86 code generation,
*************** alphabetical order.
*** 48150,48157 ****
     * Bob Wilson from Tensilica, Inc. for the Xtensa port.
  
     * Jim Wilson for his direction via the steering committee, tackling
!      hard problems in various places that nobody else wanted to work
!      on, strength reduction and other loop optimizations.
  
     * Paul Woegerer and Tal Agmon for the CRX port.
  
--- 47800,47807 ----
     * Bob Wilson from Tensilica, Inc. for the Xtensa port.
  
     * Jim Wilson for his direction via the steering committee, tackling
!      hard problems in various places that nobody else wanted to work on,
!      strength reduction and other loop optimizations.
  
     * Paul Woegerer and Tal Agmon for the CRX port.
  
*************** alphabetical order.
*** 48174,48180 ****
  
     * Gilles Zunino for help porting Java to Irix.
  
- 
   The following people are recognized for their contributions to GNAT,
  the Ada front end of GCC:
     * Bernard Banner
--- 47824,47829 ----
*************** the Ada front end of GCC:
*** 48271,48372 ****
  
     * Samuel Tardieu
  
- 
   The following people are recognized for their contributions of new
  features, bug reports, testing and integration of classpath/libgcj for
  GCC version 4.1:
!    * Lillian Angel for `JTree' implementation and lots Free Swing
       additions and bug fixes.
  
!    * Wolfgang Baer for `GapContent' bug fixes.
  
!    * Anthony Balkissoon for `JList', Free Swing 1.5 updates and mouse
!      event fixes, lots of Free Swing work including `JTable' editing.
  
     * Stuart Ballard for RMI constant fixes.
  
!    * Goffredo Baroncelli for `HTTPURLConnection' fixes.
  
!    * Gary Benson for `MessageFormat' fixes.
  
!    * Daniel Bonniot for `Serialization' fixes.
  
!    * Chris Burdess for lots of gnu.xml and http protocol fixes, `StAX'
!      and `DOM xml:id' support.
  
!    * Ka-Hing Cheung for `TreePath' and `TreeSelection' fixes.
  
     * Archie Cobbs for build fixes, VM interface updates,
!      `URLClassLoader' updates.
  
     * Kelley Cook for build fixes.
  
!    * Martin Cordova for Suggestions for better `SocketTimeoutException'.
  
!    * David Daney for `BitSet' bug fixes, `HttpURLConnection' rewrite
!      and improvements.
  
     * Thomas Fitzsimmons for lots of upgrades to the gtk+ AWT and Cairo
!      2D support. Lots of imageio framework additions, lots of AWT and
       Free Swing bug fixes.
  
!    * Jeroen Frijters for `ClassLoader' and nio cleanups, serialization
!      fixes, better `Proxy' support, bug fixes and IKVM integration.
  
!    * Santiago Gala for `AccessControlContext' fixes.
  
!    * Nicolas Geoffray for `VMClassLoader' and `AccessController'
       improvements.
  
!    * David Gilbert for `basic' and `metal' icon and plaf support and
       lots of documenting, Lots of Free Swing and metal theme additions.
!      `MetalIconFactory' implementation.
  
!    * Anthony Green for `MIDI' framework, `ALSA' and `DSSI' providers.
  
!    * Andrew Haley for `Serialization' and `URLClassLoader' fixes, gcj
       build speedups.
  
!    * Kim Ho for `JFileChooser' implementation.
  
!    * Andrew John Hughes for `Locale' and net fixes, URI RFC2986
!      updates, `Serialization' fixes, `Properties' XML support and
!      generic branch work, VMIntegration guide update.
  
!    * Bastiaan Huisman for `TimeZone' bug fixing.
  
     * Andreas Jaeger for mprec updates.
  
!    * Paul Jenner for better `-Werror' support.
  
!    * Ito Kazumitsu for `NetworkInterface' implementation and updates.
  
!    * Roman Kennke for `BoxLayout', `GrayFilter' and `SplitPane', plus
!      bug fixes all over. Lots of Free Swing work including styled text.
  
!    * Simon Kitching for `String' cleanups and optimization suggestions.
  
!    * Michael Koch for configuration fixes, `Locale' updates, bug and
       build fixes.
  
     * Guilhem Lavaux for configuration, thread and channel fixes and
!      Kaffe integration. JCL native `Pointer' updates. Logger bug fixes.
  
     * David Lichteblau for JCL support library global/local reference
       cleanups.
  
     * Aaron Luchko for JDWP updates and documentation fixes.
  
!    * Ziga Mahkovec for `Graphics2D' upgraded to Cairo 0.5 and new regex
       features.
  
!    * Sven de Marothy for BMP imageio support, CSS and `TextLayout'
!      fixes. `GtkImage' rewrite, 2D, awt, free swing and date/time fixes
       and implementing the Qt4 peers.
  
!    * Casey Marshall for crypto algorithm fixes, `FileChannel' lock,
!      `SystemLogger' and `FileHandler' rotate implementations, NIO
!      `FileChannel.map' support, security and policy updates.
  
     * Bryce McKinlay for RMI work.
  
--- 47920,48021 ----
  
     * Samuel Tardieu
  
   The following people are recognized for their contributions of new
  features, bug reports, testing and integration of classpath/libgcj for
  GCC version 4.1:
!    * Lillian Angel for 'JTree' implementation and lots Free Swing
       additions and bug fixes.
  
!    * Wolfgang Baer for 'GapContent' bug fixes.
  
!    * Anthony Balkissoon for 'JList', Free Swing 1.5 updates and mouse
!      event fixes, lots of Free Swing work including 'JTable' editing.
  
     * Stuart Ballard for RMI constant fixes.
  
!    * Goffredo Baroncelli for 'HTTPURLConnection' fixes.
  
!    * Gary Benson for 'MessageFormat' fixes.
  
!    * Daniel Bonniot for 'Serialization' fixes.
  
!    * Chris Burdess for lots of gnu.xml and http protocol fixes, 'StAX'
!      and 'DOM xml:id' support.
  
!    * Ka-Hing Cheung for 'TreePath' and 'TreeSelection' fixes.
  
     * Archie Cobbs for build fixes, VM interface updates,
!      'URLClassLoader' updates.
  
     * Kelley Cook for build fixes.
  
!    * Martin Cordova for Suggestions for better 'SocketTimeoutException'.
  
!    * David Daney for 'BitSet' bug fixes, 'HttpURLConnection' rewrite and
!      improvements.
  
     * Thomas Fitzsimmons for lots of upgrades to the gtk+ AWT and Cairo
!      2D support.  Lots of imageio framework additions, lots of AWT and
       Free Swing bug fixes.
  
!    * Jeroen Frijters for 'ClassLoader' and nio cleanups, serialization
!      fixes, better 'Proxy' support, bug fixes and IKVM integration.
  
!    * Santiago Gala for 'AccessControlContext' fixes.
  
!    * Nicolas Geoffray for 'VMClassLoader' and 'AccessController'
       improvements.
  
!    * David Gilbert for 'basic' and 'metal' icon and plaf support and
       lots of documenting, Lots of Free Swing and metal theme additions.
!      'MetalIconFactory' implementation.
  
!    * Anthony Green for 'MIDI' framework, 'ALSA' and 'DSSI' providers.
  
!    * Andrew Haley for 'Serialization' and 'URLClassLoader' fixes, gcj
       build speedups.
  
!    * Kim Ho for 'JFileChooser' implementation.
  
!    * Andrew John Hughes for 'Locale' and net fixes, URI RFC2986 updates,
!      'Serialization' fixes, 'Properties' XML support and generic branch
!      work, VMIntegration guide update.
  
!    * Bastiaan Huisman for 'TimeZone' bug fixing.
  
     * Andreas Jaeger for mprec updates.
  
!    * Paul Jenner for better '-Werror' support.
  
!    * Ito Kazumitsu for 'NetworkInterface' implementation and updates.
  
!    * Roman Kennke for 'BoxLayout', 'GrayFilter' and 'SplitPane', plus
!      bug fixes all over.  Lots of Free Swing work including styled text.
  
!    * Simon Kitching for 'String' cleanups and optimization suggestions.
  
!    * Michael Koch for configuration fixes, 'Locale' updates, bug and
       build fixes.
  
     * Guilhem Lavaux for configuration, thread and channel fixes and
!      Kaffe integration.  JCL native 'Pointer' updates.  Logger bug
!      fixes.
  
     * David Lichteblau for JCL support library global/local reference
       cleanups.
  
     * Aaron Luchko for JDWP updates and documentation fixes.
  
!    * Ziga Mahkovec for 'Graphics2D' upgraded to Cairo 0.5 and new regex
       features.
  
!    * Sven de Marothy for BMP imageio support, CSS and 'TextLayout'
!      fixes.  'GtkImage' rewrite, 2D, awt, free swing and date/time fixes
       and implementing the Qt4 peers.
  
!    * Casey Marshall for crypto algorithm fixes, 'FileChannel' lock,
!      'SystemLogger' and 'FileHandler' rotate implementations, NIO
!      'FileChannel.map' support, security and policy updates.
  
     * Bryce McKinlay for RMI work.
  
*************** GCC version 4.1:
*** 48377,48422 ****
  
     * Rainer Orth for build fixes.
  
!    * Andrew Overholt for `File' locking fixes.
  
!    * Ingo Proetel for `Image', `Logger' and `URLClassLoader' updates.
  
!    * Olga Rodimina for `MenuSelectionManager' implementation.
  
!    * Jan Roehrich for `BasicTreeUI' and `JTree' fixes.
  
     * Julian Scheid for documentation updates and gjdoc support.
  
     * Christian Schlichtherle for zip fixes and cleanups.
  
     * Robert Schuster for documentation updates and beans fixes,
!      `TreeNode' enumerations and `ActionCommand' and various fixes, XML
       and URL, AWT and Free Swing bug fixes.
  
     * Keith Seitz for lots of JDWP work.
  
     * Christian Thalinger for 64-bit cleanups, Configuration and VM
!      interface fixes and `CACAO' integration, `fdlibm' updates.
  
!    * Gael Thomas for `VMClassLoader' boot packages support suggestions.
  
!    * Andreas Tobler for Darwin and Solaris testing and fixing, `Qt4'
!      support for Darwin/OS X, `Graphics2D' support, `gtk+' updates.
  
!    * Dalibor Topic for better `DEBUG' support, build cleanups and Kaffe
!      integration. `Qt4' build infrastructure, `SHA1PRNG' and
!      `GdkPixbugDecoder' updates.
  
     * Tom Tromey for Eclipse integration, generics work, lots of bug
       fixes and gcj integration including coordinating The Big Merge.
  
     * Mark Wielaard for bug fixes, packaging and release management,
!      `Clipboard' implementation, system call interrupts and network
!      timeouts and `GdkPixpufDecoder' fixes.
! 
  
!  In addition to the above, all of which also contributed time and
! energy in testing GCC, we would like to thank the following for their
  contributions to testing:
  
     * Michael Abd-El-Malek
--- 48026,48070 ----
  
     * Rainer Orth for build fixes.
  
!    * Andrew Overholt for 'File' locking fixes.
  
!    * Ingo Proetel for 'Image', 'Logger' and 'URLClassLoader' updates.
  
!    * Olga Rodimina for 'MenuSelectionManager' implementation.
  
!    * Jan Roehrich for 'BasicTreeUI' and 'JTree' fixes.
  
     * Julian Scheid for documentation updates and gjdoc support.
  
     * Christian Schlichtherle for zip fixes and cleanups.
  
     * Robert Schuster for documentation updates and beans fixes,
!      'TreeNode' enumerations and 'ActionCommand' and various fixes, XML
       and URL, AWT and Free Swing bug fixes.
  
     * Keith Seitz for lots of JDWP work.
  
     * Christian Thalinger for 64-bit cleanups, Configuration and VM
!      interface fixes and 'CACAO' integration, 'fdlibm' updates.
  
!    * Gael Thomas for 'VMClassLoader' boot packages support suggestions.
  
!    * Andreas Tobler for Darwin and Solaris testing and fixing, 'Qt4'
!      support for Darwin/OS X, 'Graphics2D' support, 'gtk+' updates.
  
!    * Dalibor Topic for better 'DEBUG' support, build cleanups and Kaffe
!      integration.  'Qt4' build infrastructure, 'SHA1PRNG' and
!      'GdkPixbugDecoder' updates.
  
     * Tom Tromey for Eclipse integration, generics work, lots of bug
       fixes and gcj integration including coordinating The Big Merge.
  
     * Mark Wielaard for bug fixes, packaging and release management,
!      'Clipboard' implementation, system call interrupts and network
!      timeouts and 'GdkPixpufDecoder' fixes.
  
!  In addition to the above, all of which also contributed time and energy
! in testing GCC, we would like to thank the following for their
  contributions to testing:
  
     * Michael Abd-El-Malek
*************** File: gcc.info,  Node: Option Index,  Ne
*** 48585,48593 ****
  Option Index
  ************
  
! GCC's command line options are indexed here without any initial `-' or
! `--'.  Where an option has both positive and negative forms (such as
! `-fOPTION' and `-fno-OPTION'), relevant entries in the manual are
  indexed under the most appropriate form; it may sometimes be useful to
  look up both forms.
  
--- 48233,48241 ----
  Option Index
  ************
  
! GCC's command line options are indexed here without any initial '-' or
! '--'.  Where an option has both positive and negative forms (such as
! '-fOPTION' and '-fno-OPTION'), relevant entries in the manual are
  indexed under the most appropriate form; it may sometimes be useful to
  look up both forms.
  
*************** look up both forms.
*** 48595,48748 ****
  * Menu:
  
  * ###:                                   Overall Options.    (line  209)
! * -fipa-cp-alignment:                    Optimize Options.   (line  991)
  * -Wabi-tag:                             C++ Dialect Options.
!                                                              (line  531)
  * A:                                     Preprocessor Options.
!                                                              (line  596)
! * all_load:                              Darwin Options.     (line  110)
  * allowable_client:                      Darwin Options.     (line  196)
! * ansi <1>:                              Non-bugs.           (line  107)
! * ansi <2>:                              Other Builtins.     (line   22)
! * ansi <3>:                              Preprocessor Options.
!                                                              (line  338)
! * ansi <4>:                              C Dialect Options.  (line   11)
  * ansi:                                  Standards.          (line   16)
  * arch_errors_fatal:                     Darwin Options.     (line  114)
! * aux-info:                              C Dialect Options.  (line  176)
! * B:                                     Directory Options.  (line   46)
  * Bdynamic:                              VxWorks Options.    (line   22)
  * bind_at_load:                          Darwin Options.     (line  118)
  * Bstatic:                               VxWorks Options.    (line   22)
  * bundle:                                Darwin Options.     (line  123)
  * bundle_loader:                         Darwin Options.     (line  127)
- * c:                                     Link Options.       (line   20)
- * C:                                     Preprocessor Options.
-                                                              (line  654)
  * c:                                     Overall Options.    (line  164)
  * client_name:                           Darwin Options.     (line  196)
  * compatibility_version:                 Darwin Options.     (line  196)
! * coverage:                              Debugging Options.  (line  724)
  * current_version:                       Darwin Options.     (line  196)
  * D:                                     Preprocessor Options.
                                                               (line   46)
! * d:                                     Debugging Options.  (line  856)
! * dA:                                    Debugging Options.  (line 1061)
! * da:                                    Debugging Options.  (line 1058)
  * dD <1>:                                Preprocessor Options.
!                                                              (line  628)
! * dD:                                    Debugging Options.  (line 1065)
  * dead_strip:                            Darwin Options.     (line  196)
  * dependency-file:                       Darwin Options.     (line  196)
! * dH:                                    Debugging Options.  (line 1069)
  * dI:                                    Preprocessor Options.
!                                                              (line  637)
  * dM:                                    Preprocessor Options.
!                                                              (line  612)
  * dN:                                    Preprocessor Options.
!                                                              (line  634)
! * dP:                                    Debugging Options.  (line 1077)
! * dp:                                    Debugging Options.  (line 1072)
  * dU:                                    Preprocessor Options.
!                                                              (line  641)
! * dumpmachine:                           Debugging Options.  (line 1679)
! * dumpspecs:                             Debugging Options.  (line 1687)
! * dumpversion:                           Debugging Options.  (line 1683)
! * dx:                                    Debugging Options.  (line 1081)
  * dylib_file:                            Darwin Options.     (line  196)
  * dylinker_install_name:                 Darwin Options.     (line  196)
  * dynamic:                               Darwin Options.     (line  196)
  * dynamiclib:                            Darwin Options.     (line  131)
- * E <1>:                                 Link Options.       (line   20)
  * E:                                     Overall Options.    (line  185)
  * EB <1>:                                MIPS Options.       (line    7)
! * EB:                                    ARC Options.        (line  350)
  * EL <1>:                                MIPS Options.       (line   10)
- * EL:                                    ARC Options.        (line  357)
  * exported_symbols_list:                 Darwin Options.     (line  196)
  * F:                                     Darwin Options.     (line   31)
  * fabi-compat-version:                   C++ Dialect Options.
!                                                              (line   62)
  * fabi-version:                          C++ Dialect Options.
!                                                              (line   20)
! * fada-spec-parent:                      Overall Options.    (line  369)
! * faggressive-loop-optimizations:        Optimize Options.   (line  506)
! * falign-functions:                      Optimize Options.   (line 1566)
! * falign-jumps:                          Optimize Options.   (line 1615)
! * falign-labels:                         Optimize Options.   (line 1584)
! * falign-loops:                          Optimize Options.   (line 1602)
  * fallow-parameterless-variadic-functions: C Dialect Options.
!                                                              (line  192)
! * fasan-shadow-offset:                   Debugging Options.  (line  349)
! * fassociative-math:                     Optimize Options.   (line 2125)
  * fasynchronous-unwind-tables:           Code Gen Options.   (line  146)
! * fauto-inc-dec:                         Optimize Options.   (line  530)
! * fauto-profile:                         Optimize Options.   (line 2006)
  * fbounds-check:                         Code Gen Options.   (line   15)
! * fbranch-probabilities:                 Optimize Options.   (line 2252)
! * fbranch-target-load-optimize:          Optimize Options.   (line 2375)
! * fbranch-target-load-optimize2:         Optimize Options.   (line 2381)
! * fbtr-bb-exclusive:                     Optimize Options.   (line 2385)
! * fcall-saved:                           Code Gen Options.   (line  358)
! * fcall-used:                            Code Gen Options.   (line  344)
! * fcaller-saves:                         Optimize Options.   (line  880)
! * fcheck-data-deps:                      Optimize Options.   (line 1201)
  * fcheck-new:                            C++ Dialect Options.
!                                                              (line   77)
! * fcheck-pointer-bounds:                 Debugging Options.  (line  388)
! * fchkp-check-incomplete-type:           Debugging Options.  (line  428)
! * fchkp-check-read:                      Debugging Options.  (line  478)
! * fchkp-check-write:                     Debugging Options.  (line  482)
! * fchkp-first-field-has-own-bounds:      Debugging Options.  (line  439)
! * fchkp-instrument-calls:                Debugging Options.  (line  490)
! * fchkp-instrument-marked-only:          Debugging Options.  (line  494)
! * fchkp-narrow-bounds:                   Debugging Options.  (line  432)
! * fchkp-narrow-to-innermost-array:       Debugging Options.  (line  445)
! * fchkp-optimize:                        Debugging Options.  (line  450)
! * fchkp-store-bounds:                    Debugging Options.  (line  486)
  * fchkp-treat-zero-dynamic-size-as-infinite: Debugging Options.
!                                                              (line  471)
! * fchkp-use-fast-string-functions:       Debugging Options.  (line  454)
! * fchkp-use-nochk-string-functions:      Debugging Options.  (line  458)
! * fchkp-use-static-bounds:               Debugging Options.  (line  462)
! * fchkp-use-static-const-bounds:         Debugging Options.  (line  466)
! * fchkp-use-wrappers:                    Debugging Options.  (line  499)
! * fcilkplus:                             C Dialect Options.  (line  288)
! * fcombine-stack-adjustments:            Optimize Options.   (line  892)
  * fcommon:                               Variable Attributes.
!                                                              (line  106)
! * fcompare-debug:                        Debugging Options.  (line  512)
! * fcompare-debug-second:                 Debugging Options.  (line  538)
! * fcompare-elim:                         Optimize Options.   (line 1941)
! * fcond-mismatch:                        C Dialect Options.  (line  352)
! * fconserve-stack:                       Optimize Options.   (line  907)
  * fconstant-string-class:                Objective-C and Objective-C++ Dialect Options.
                                                               (line   30)
  * fconstexpr-depth:                      C++ Dialect Options.
!                                                              (line   87)
! * fcprop-registers:                      Optimize Options.   (line 1953)
! * fcrossjumping:                         Optimize Options.   (line  523)
! * fcse-follow-jumps:                     Optimize Options.   (line  442)
! * fcse-skip-blocks:                      Optimize Options.   (line  451)
! * fcx-fortran-rules:                     Optimize Options.   (line 2238)
! * fcx-limited-range:                     Optimize Options.   (line 2226)
! * fdata-sections:                        Optimize Options.   (line 2356)
! * fdbg-cnt:                              Debugging Options.  (line  777)
! * fdbg-cnt-list:                         Debugging Options.  (line  774)
! * fdce:                                  Optimize Options.   (line  536)
  * fdebug-cpp:                            Preprocessor Options.
!                                                              (line  525)
! * fdebug-prefix-map:                     Debugging Options.  (line  632)
  * fdebug-types-section:                  Debugging Options.  (line   79)
! * fdeclone-ctor-dtor:                    Optimize Options.   (line  559)
  * fdeduce-init-list:                     C++ Dialect Options.
!                                                              (line   93)
! * fdelayed-branch:                       Optimize Options.   (line  710)
  * fdelete-dead-exceptions:               Code Gen Options.   (line  131)
! * fdelete-null-pointer-checks:           Optimize Options.   (line  570)
! * fdevirtualize:                         Optimize Options.   (line  588)
! * fdevirtualize-at-ltrans:               Optimize Options.   (line  605)
! * fdevirtualize-speculatively:           Optimize Options.   (line  595)
  * fdiagnostics-color:                    Language Independent Options.
                                                               (line   35)
  * fdiagnostics-show-caret:               Language Independent Options.
--- 48243,48396 ----
  * Menu:
  
  * ###:                                   Overall Options.    (line  209)
! * -fipa-cp-alignment:                    Optimize Options.   (line  986)
  * -Wabi-tag:                             C++ Dialect Options.
!                                                              (line  527)
  * A:                                     Preprocessor Options.
!                                                              (line  595)
  * allowable_client:                      Darwin Options.     (line  196)
! * all_load:                              Darwin Options.     (line  110)
  * ansi:                                  Standards.          (line   16)
+ * ansi <1>:                              C Dialect Options.  (line   11)
+ * ansi <2>:                              Preprocessor Options.
+                                                              (line  340)
+ * ansi <3>:                              Other Builtins.     (line   21)
+ * ansi <4>:                              Non-bugs.           (line  107)
  * arch_errors_fatal:                     Darwin Options.     (line  114)
! * aux-info:                              C Dialect Options.  (line  173)
! * B:                                     Directory Options.  (line   44)
  * Bdynamic:                              VxWorks Options.    (line   22)
  * bind_at_load:                          Darwin Options.     (line  118)
  * Bstatic:                               VxWorks Options.    (line   22)
  * bundle:                                Darwin Options.     (line  123)
  * bundle_loader:                         Darwin Options.     (line  127)
  * c:                                     Overall Options.    (line  164)
+ * C:                                     Preprocessor Options.
+                                                              (line  652)
+ * c <1>:                                 Link Options.       (line   20)
  * client_name:                           Darwin Options.     (line  196)
  * compatibility_version:                 Darwin Options.     (line  196)
! * coverage:                              Debugging Options.  (line  726)
  * current_version:                       Darwin Options.     (line  196)
+ * d:                                     Debugging Options.  (line  858)
  * D:                                     Preprocessor Options.
                                                               (line   46)
! * da:                                    Debugging Options.  (line 1060)
! * dA:                                    Debugging Options.  (line 1063)
! * dD:                                    Debugging Options.  (line 1067)
  * dD <1>:                                Preprocessor Options.
!                                                              (line  626)
  * dead_strip:                            Darwin Options.     (line  196)
  * dependency-file:                       Darwin Options.     (line  196)
! * dH:                                    Debugging Options.  (line 1071)
  * dI:                                    Preprocessor Options.
!                                                              (line  635)
  * dM:                                    Preprocessor Options.
!                                                              (line  611)
  * dN:                                    Preprocessor Options.
!                                                              (line  632)
! * dp:                                    Debugging Options.  (line 1074)
! * dP:                                    Debugging Options.  (line 1079)
  * dU:                                    Preprocessor Options.
!                                                              (line  639)
! * dumpmachine:                           Debugging Options.  (line 1655)
! * dumpspecs:                             Debugging Options.  (line 1663)
! * dumpversion:                           Debugging Options.  (line 1659)
! * dx:                                    Debugging Options.  (line 1083)
  * dylib_file:                            Darwin Options.     (line  196)
  * dylinker_install_name:                 Darwin Options.     (line  196)
  * dynamic:                               Darwin Options.     (line  196)
  * dynamiclib:                            Darwin Options.     (line  131)
  * E:                                     Overall Options.    (line  185)
+ * E <1>:                                 Link Options.       (line   20)
+ * EB:                                    ARC Options.        (line  344)
  * EB <1>:                                MIPS Options.       (line    7)
! * EL:                                    ARC Options.        (line  352)
  * EL <1>:                                MIPS Options.       (line   10)
  * exported_symbols_list:                 Darwin Options.     (line  196)
  * F:                                     Darwin Options.     (line   31)
  * fabi-compat-version:                   C++ Dialect Options.
!                                                              (line   61)
  * fabi-version:                          C++ Dialect Options.
!                                                              (line   19)
! * fada-spec-parent:                      Overall Options.    (line  367)
! * faggressive-loop-optimizations:        Optimize Options.   (line  502)
! * falign-functions:                      Optimize Options.   (line 1560)
! * falign-jumps:                          Optimize Options.   (line 1609)
! * falign-labels:                         Optimize Options.   (line 1578)
! * falign-loops:                          Optimize Options.   (line 1596)
  * fallow-parameterless-variadic-functions: C Dialect Options.
!                                                              (line  189)
! * fasan-shadow-offset:                   Debugging Options.  (line  354)
! * fassociative-math:                     Optimize Options.   (line 2120)
  * fasynchronous-unwind-tables:           Code Gen Options.   (line  146)
! * fauto-inc-dec:                         Optimize Options.   (line  526)
! * fauto-profile:                         Optimize Options.   (line 2000)
  * fbounds-check:                         Code Gen Options.   (line   15)
! * fbranch-probabilities:                 Optimize Options.   (line 2248)
! * fbranch-target-load-optimize:          Optimize Options.   (line 2371)
! * fbranch-target-load-optimize2:         Optimize Options.   (line 2377)
! * fbtr-bb-exclusive:                     Optimize Options.   (line 2381)
! * fcall-saved:                           Code Gen Options.   (line  356)
! * fcall-used:                            Code Gen Options.   (line  342)
! * fcaller-saves:                         Optimize Options.   (line  875)
! * fcheck-data-deps:                      Optimize Options.   (line 1195)
  * fcheck-new:                            C++ Dialect Options.
!                                                              (line   76)
! * fcheck-pointer-bounds:                 Debugging Options.  (line  393)
! * fchkp-check-incomplete-type:           Debugging Options.  (line  433)
! * fchkp-check-read:                      Debugging Options.  (line  483)
! * fchkp-check-write:                     Debugging Options.  (line  487)
! * fchkp-first-field-has-own-bounds:      Debugging Options.  (line  444)
! * fchkp-instrument-calls:                Debugging Options.  (line  495)
! * fchkp-instrument-marked-only:          Debugging Options.  (line  499)
! * fchkp-narrow-bounds:                   Debugging Options.  (line  437)
! * fchkp-narrow-to-innermost-array:       Debugging Options.  (line  450)
! * fchkp-optimize:                        Debugging Options.  (line  455)
! * fchkp-store-bounds:                    Debugging Options.  (line  491)
  * fchkp-treat-zero-dynamic-size-as-infinite: Debugging Options.
!                                                              (line  476)
! * fchkp-use-fast-string-functions:       Debugging Options.  (line  459)
! * fchkp-use-nochk-string-functions:      Debugging Options.  (line  463)
! * fchkp-use-static-bounds:               Debugging Options.  (line  467)
! * fchkp-use-static-const-bounds:         Debugging Options.  (line  471)
! * fchkp-use-wrappers:                    Debugging Options.  (line  504)
! * fcilkplus:                             C Dialect Options.  (line  289)
! * fcombine-stack-adjustments:            Optimize Options.   (line  887)
  * fcommon:                               Variable Attributes.
!                                                              (line  105)
! * fcompare-debug:                        Debugging Options.  (line  517)
! * fcompare-debug-second:                 Debugging Options.  (line  543)
! * fcompare-elim:                         Optimize Options.   (line 1933)
! * fcond-mismatch:                        C Dialect Options.  (line  353)
! * fconserve-stack:                       Optimize Options.   (line  902)
  * fconstant-string-class:                Objective-C and Objective-C++ Dialect Options.
                                                               (line   30)
  * fconstexpr-depth:                      C++ Dialect Options.
!                                                              (line   86)
! * fcprop-registers:                      Optimize Options.   (line 1945)
! * fcrossjumping:                         Optimize Options.   (line  519)
! * fcse-follow-jumps:                     Optimize Options.   (line  438)
! * fcse-skip-blocks:                      Optimize Options.   (line  447)
! * fcx-fortran-rules:                     Optimize Options.   (line 2235)
! * fcx-limited-range:                     Optimize Options.   (line 2223)
! * fdata-sections:                        Optimize Options.   (line 2352)
! * fdbg-cnt:                              Debugging Options.  (line  778)
! * fdbg-cnt-list:                         Debugging Options.  (line  775)
! * fdce:                                  Optimize Options.   (line  532)
  * fdebug-cpp:                            Preprocessor Options.
!                                                              (line  526)
! * fdebug-prefix-map:                     Debugging Options.  (line  637)
  * fdebug-types-section:                  Debugging Options.  (line   79)
! * fdeclone-ctor-dtor:                    Optimize Options.   (line  555)
  * fdeduce-init-list:                     C++ Dialect Options.
!                                                              (line   92)
! * fdelayed-branch:                       Optimize Options.   (line  705)
  * fdelete-dead-exceptions:               Code Gen Options.   (line  131)
! * fdelete-null-pointer-checks:           Optimize Options.   (line  566)
! * fdevirtualize:                         Optimize Options.   (line  584)
! * fdevirtualize-at-ltrans:               Optimize Options.   (line  601)
! * fdevirtualize-speculatively:           Optimize Options.   (line  591)
  * fdiagnostics-color:                    Language Independent Options.
                                                               (line   35)
  * fdiagnostics-show-caret:               Language Independent Options.
*************** look up both forms.
*** 48752,49117 ****
  * fdiagnostics-show-option:              Language Independent Options.
                                                               (line   88)
  * fdirectives-only:                      Preprocessor Options.
!                                                              (line  473)
! * fdisable-:                             Debugging Options.  (line  787)
! * fdollars-in-identifiers <1>:           Interoperation.     (line  141)
  * fdollars-in-identifiers:               Preprocessor Options.
!                                                              (line  495)
! * fdse:                                  Optimize Options.   (line  540)
! * fdump-ada-spec:                        Overall Options.    (line  363)
! * fdump-class-hierarchy:                 Debugging Options.  (line 1116)
! * fdump-final-insns:                     Debugging Options.  (line  506)
! * fdump-go-spec:                         Overall Options.    (line  373)
! * fdump-ipa:                             Debugging Options.  (line 1124)
! * fdump-noaddr:                          Debugging Options.  (line 1085)
! * fdump-passes:                          Debugging Options.  (line 1142)
! * fdump-rtl-alignments:                  Debugging Options.  (line  877)
! * fdump-rtl-all:                         Debugging Options.  (line 1058)
! * fdump-rtl-asmcons:                     Debugging Options.  (line  880)
! * fdump-rtl-auto_inc_dec:                Debugging Options.  (line  884)
! * fdump-rtl-barriers:                    Debugging Options.  (line  888)
! * fdump-rtl-bbpart:                      Debugging Options.  (line  891)
! * fdump-rtl-bbro:                        Debugging Options.  (line  894)
! * fdump-rtl-btl2:                        Debugging Options.  (line  898)
! * fdump-rtl-bypass:                      Debugging Options.  (line  902)
! * fdump-rtl-ce1:                         Debugging Options.  (line  913)
! * fdump-rtl-ce2:                         Debugging Options.  (line  913)
! * fdump-rtl-ce3:                         Debugging Options.  (line  913)
! * fdump-rtl-combine:                     Debugging Options.  (line  905)
! * fdump-rtl-compgotos:                   Debugging Options.  (line  908)
! * fdump-rtl-cprop_hardreg:               Debugging Options.  (line  917)
! * fdump-rtl-csa:                         Debugging Options.  (line  920)
! * fdump-rtl-cse1:                        Debugging Options.  (line  924)
! * fdump-rtl-cse2:                        Debugging Options.  (line  924)
! * fdump-rtl-dbr:                         Debugging Options.  (line  931)
! * fdump-rtl-dce:                         Debugging Options.  (line  928)
! * fdump-rtl-dce1:                        Debugging Options.  (line  935)
! * fdump-rtl-dce2:                        Debugging Options.  (line  935)
! * fdump-rtl-dfinish:                     Debugging Options.  (line 1054)
! * fdump-rtl-dfinit:                      Debugging Options.  (line 1054)
! * fdump-rtl-eh:                          Debugging Options.  (line  939)
! * fdump-rtl-eh_ranges:                   Debugging Options.  (line  942)
! * fdump-rtl-expand:                      Debugging Options.  (line  945)
! * fdump-rtl-fwprop1:                     Debugging Options.  (line  949)
! * fdump-rtl-fwprop2:                     Debugging Options.  (line  949)
! * fdump-rtl-gcse1:                       Debugging Options.  (line  954)
! * fdump-rtl-gcse2:                       Debugging Options.  (line  954)
! * fdump-rtl-init-regs:                   Debugging Options.  (line  958)
! * fdump-rtl-initvals:                    Debugging Options.  (line  961)
! * fdump-rtl-into_cfglayout:              Debugging Options.  (line  964)
! * fdump-rtl-ira:                         Debugging Options.  (line  967)
! * fdump-rtl-jump:                        Debugging Options.  (line  970)
! * fdump-rtl-loop2:                       Debugging Options.  (line  973)
! * fdump-rtl-mach:                        Debugging Options.  (line  977)
! * fdump-rtl-mode_sw:                     Debugging Options.  (line  981)
! * fdump-rtl-outof_cfglayout:             Debugging Options.  (line  987)
! * fdump-rtl-PASS:                        Debugging Options.  (line  856)
! * fdump-rtl-peephole2:                   Debugging Options.  (line  990)
! * fdump-rtl-postreload:                  Debugging Options.  (line  993)
! * fdump-rtl-pro_and_epilogue:            Debugging Options.  (line  996)
! * fdump-rtl-ree:                         Debugging Options.  (line 1004)
! * fdump-rtl-regclass:                    Debugging Options.  (line 1054)
! * fdump-rtl-rnreg:                       Debugging Options.  (line  984)
! * fdump-rtl-sched1:                      Debugging Options.  (line 1000)
! * fdump-rtl-sched2:                      Debugging Options.  (line 1000)
! * fdump-rtl-seqabstr:                    Debugging Options.  (line 1007)
! * fdump-rtl-shorten:                     Debugging Options.  (line 1010)
! * fdump-rtl-sibling:                     Debugging Options.  (line 1013)
! * fdump-rtl-sms:                         Debugging Options.  (line 1024)
! * fdump-rtl-split1:                      Debugging Options.  (line 1020)
! * fdump-rtl-split2:                      Debugging Options.  (line 1020)
! * fdump-rtl-split3:                      Debugging Options.  (line 1020)
! * fdump-rtl-split4:                      Debugging Options.  (line 1020)
! * fdump-rtl-split5:                      Debugging Options.  (line 1020)
! * fdump-rtl-stack:                       Debugging Options.  (line 1028)
! * fdump-rtl-subreg1:                     Debugging Options.  (line 1034)
! * fdump-rtl-subreg2:                     Debugging Options.  (line 1034)
! * fdump-rtl-subregs_of_mode_finish:      Debugging Options.  (line 1054)
! * fdump-rtl-subregs_of_mode_init:        Debugging Options.  (line 1054)
! * fdump-rtl-unshare:                     Debugging Options.  (line 1038)
! * fdump-rtl-vartrack:                    Debugging Options.  (line 1041)
! * fdump-rtl-vregs:                       Debugging Options.  (line 1044)
! * fdump-rtl-web:                         Debugging Options.  (line 1047)
! * fdump-statistics:                      Debugging Options.  (line 1146)
! * fdump-translation-unit:                Debugging Options.  (line 1107)
! * fdump-tree:                            Debugging Options.  (line 1158)
! * fdump-tree-alias:                      Debugging Options.  (line 1297)
! * fdump-tree-all:                        Debugging Options.  (line 1382)
! * fdump-tree-ccp:                        Debugging Options.  (line 1301)
! * fdump-tree-cfg:                        Debugging Options.  (line 1285)
! * fdump-tree-ch:                         Debugging Options.  (line 1289)
! * fdump-tree-copyprop:                   Debugging Options.  (line 1317)
! * fdump-tree-copyrename:                 Debugging Options.  (line 1358)
! * fdump-tree-dce:                        Debugging Options.  (line 1325)
! * fdump-tree-dom:                        Debugging Options.  (line 1338)
! * fdump-tree-dse:                        Debugging Options.  (line 1343)
! * fdump-tree-forwprop:                   Debugging Options.  (line 1353)
! * fdump-tree-fre:                        Debugging Options.  (line 1313)
! * fdump-tree-gimple:                     Debugging Options.  (line 1280)
! * fdump-tree-nrv:                        Debugging Options.  (line 1363)
! * fdump-tree-optimized:                  Debugging Options.  (line 1277)
! * fdump-tree-original:                   Debugging Options.  (line 1274)
! * fdump-tree-phiopt:                     Debugging Options.  (line 1348)
! * fdump-tree-pre:                        Debugging Options.  (line 1309)
! * fdump-tree-sink:                       Debugging Options.  (line 1334)
! * fdump-tree-slp:                        Debugging Options.  (line 1373)
! * fdump-tree-sra:                        Debugging Options.  (line 1329)
! * fdump-tree-ssa:                        Debugging Options.  (line 1293)
! * fdump-tree-store_copyprop:             Debugging Options.  (line 1321)
! * fdump-tree-storeccp:                   Debugging Options.  (line 1305)
! * fdump-tree-vect:                       Debugging Options.  (line 1368)
! * fdump-tree-vrp:                        Debugging Options.  (line 1378)
! * fdump-unnumbered:                      Debugging Options.  (line 1095)
! * fdump-unnumbered-links:                Debugging Options.  (line 1101)
! * fdwarf2-cfi-asm:                       Debugging Options.  (line  636)
! * fearly-inlining:                       Optimize Options.   (line  292)
! * feliminate-dwarf2-dups:                Debugging Options.  (line  551)
  * feliminate-unused-debug-symbols:       Debugging Options.  (line   67)
! * feliminate-unused-debug-types:         Debugging Options.  (line 1691)
  * femit-class-debug-always:              Debugging Options.  (line   71)
! * femit-struct-debug-baseonly:           Debugging Options.  (line  556)
! * femit-struct-debug-detailed:           Debugging Options.  (line  583)
! * femit-struct-debug-reduced:            Debugging Options.  (line  569)
! * fenable-:                              Debugging Options.  (line  787)
! * fexceptions:                           Code Gen Options.   (line  108)
! * fexcess-precision:                     Optimize Options.   (line 2053)
  * fexec-charset:                         Preprocessor Options.
                                                               (line  553)
! * fexpensive-optimizations:              Optimize Options.   (line  612)
  * fext-numeric-literals:                 C++ Dialect Options.
!                                                              (line  612)
  * fextended-identifiers:                 Preprocessor Options.
!                                                              (line  498)
  * fextern-tls-init:                      C++ Dialect Options.
!                                                              (line  143)
! * ffast-math:                            Optimize Options.   (line 2076)
! * ffat-lto-objects:                      Optimize Options.   (line 1922)
! * ffinite-math-only:                     Optimize Options.   (line 2150)
  * ffix-and-continue:                     Darwin Options.     (line  104)
! * ffixed:                                Code Gen Options.   (line  332)
  * ffloat-store <1>:                      Disappointments.    (line   77)
- * ffloat-store:                          Optimize Options.   (line 2039)
  * ffor-scope:                            C++ Dialect Options.
!                                                              (line  164)
! * fforward-propagate:                    Optimize Options.   (line  195)
! * ffp-contract:                          Optimize Options.   (line  204)
! * ffreestanding <1>:                     Function Attributes.
!                                                              (line  464)
! * ffreestanding <2>:                     Warning Options.    (line  270)
! * ffreestanding <3>:                     C Dialect Options.  (line  254)
! * ffreestanding:                         Standards.          (line   92)
  * ffriend-injection:                     C++ Dialect Options.
!                                                              (line  114)
! * ffunction-sections:                    Optimize Options.   (line 2356)
! * fgcse:                                 Optimize Options.   (line  465)
! * fgcse-after-reload:                    Optimize Options.   (line  501)
! * fgcse-las:                             Optimize Options.   (line  494)
! * fgcse-lm:                              Optimize Options.   (line  476)
! * fgcse-sm:                              Optimize Options.   (line  485)
  * fgnu-runtime:                          Objective-C and Objective-C++ Dialect Options.
                                                               (line   39)
! * fgnu-tm:                               C Dialect Options.  (line  298)
! * fgnu89-inline:                         C Dialect Options.  (line  159)
! * fgraphite-identity:                    Optimize Options.   (line 1174)
! * fhoist-adjacent-loads:                 Optimize Options.   (line  940)
! * fhosted:                               C Dialect Options.  (line  247)
! * fif-conversion:                        Optimize Options.   (line  544)
! * fif-conversion2:                       Optimize Options.   (line  553)
  * filelist:                              Darwin Options.     (line  196)
  * findirect-data:                        Darwin Options.     (line  104)
! * findirect-inlining:                    Optimize Options.   (line  265)
! * finhibit-size-directive:               Code Gen Options.   (line  252)
! * finline-functions:                     Optimize Options.   (line  273)
! * finline-functions-called-once:         Optimize Options.   (line  284)
! * finline-limit:                         Optimize Options.   (line  309)
! * finline-small-functions:               Optimize Options.   (line  256)
  * finput-charset:                        Preprocessor Options.
                                                               (line  566)
  * finstrument-functions <1>:             Function Attributes.
!                                                              (line 1073)
! * finstrument-functions:                 Code Gen Options.   (line  388)
! * finstrument-functions-exclude-file-list: Code Gen Options. (line  424)
  * finstrument-functions-exclude-function-list: Code Gen Options.
!                                                              (line  444)
! * fipa-cp:                               Optimize Options.   (line  973)
! * fipa-cp-clone:                         Optimize Options.   (line  981)
! * fipa-icf:                              Optimize Options.   (line  998)
! * fipa-profile:                          Optimize Options.   (line  965)
! * fipa-pta:                              Optimize Options.   (line  959)
! * fipa-pure-const:                       Optimize Options.   (line  951)
! * fipa-ra:                               Optimize Options.   (line  898)
! * fipa-reference:                        Optimize Options.   (line  955)
! * fipa-sra:                              Optimize Options.   (line  302)
! * fira-algorithm:                        Optimize Options.   (line  640)
! * fira-hoist-pressure:                   Optimize Options.   (line  670)
! * fira-loop-pressure:                    Optimize Options.   (line  677)
! * fira-region:                           Optimize Options.   (line  648)
! * fira-verbose:                          Optimize Options.   (line  697)
! * fisolate-erroneous-paths-attribute:    Optimize Options.   (line 1019)
! * fisolate-erroneous-paths-dereference:  Optimize Options.   (line 1012)
  * fivar-visibility:                      Objective-C and Objective-C++ Dialect Options.
                                                               (line  162)
! * fivopts:                               Optimize Options.   (line 1277)
  * fkeep-inline-functions <1>:            Inline.             (line   51)
! * fkeep-inline-functions:                Optimize Options.   (line  341)
! * fkeep-static-consts:                   Optimize Options.   (line  348)
  * flat_namespace:                        Darwin Options.     (line  196)
! * flax-vector-conversions:               C Dialect Options.  (line  357)
! * fleading-underscore:                   Code Gen Options.   (line  527)
! * flive-range-shrinkage:                 Optimize Options.   (line  635)
  * flocal-ivars:                          Objective-C and Objective-C++ Dialect Options.
                                                               (line  153)
! * floop-block:                           Optimize Options.   (line 1145)
! * floop-interchange:                     Optimize Options.   (line 1100)
! * floop-nest-optimize:                   Optimize Options.   (line 1182)
! * floop-parallelize-all:                 Optimize Options.   (line 1195)
! * floop-strip-mine:                      Optimize Options.   (line 1124)
! * floop-unroll-and-jam:                  Optimize Options.   (line 1188)
! * flra-remat:                            Optimize Options.   (line  703)
! * flto:                                  Optimize Options.   (line 1669)
! * flto-compression-level:                Optimize Options.   (line 1884)
! * flto-odr-type-merging:                 Optimize Options.   (line 1879)
! * flto-partition:                        Optimize Options.   (line 1865)
! * flto-report:                           Optimize Options.   (line 1892)
! * flto-report-wpa:                       Optimize Options.   (line 1900)
  * fmax-errors:                           Warning Options.    (line   18)
! * fmem-report:                           Debugging Options.  (line  660)
! * fmem-report-wpa:                       Debugging Options.  (line  664)
! * fmerge-all-constants:                  Optimize Options.   (line  367)
! * fmerge-constants:                      Optimize Options.   (line  357)
! * fmerge-debug-strings:                  Debugging Options.  (line  625)
  * fmessage-length:                       Language Independent Options.
                                                               (line   14)
! * fmodulo-sched:                         Optimize Options.   (line  378)
! * fmodulo-sched-allow-regmoves:          Optimize Options.   (line  383)
! * fmove-loop-invariants:                 Optimize Options.   (line 2346)
! * fms-extensions <1>:                    Unnamed Fields.     (line   36)
! * fms-extensions <2>:                    C++ Dialect Options.
!                                                              (line  198)
! * fms-extensions:                        C Dialect Options.  (line  313)
  * fnext-runtime:                         Objective-C and Objective-C++ Dialect Options.
                                                               (line   43)
  * fno-access-control:                    C++ Dialect Options.
!                                                              (line   73)
! * fno-asm:                               C Dialect Options.  (line  199)
! * fno-branch-count-reg:                  Optimize Options.   (line  390)
! * fno-builtin <1>:                       Other Builtins.     (line   14)
  * fno-builtin <2>:                       Function Attributes.
!                                                              (line  464)
! * fno-builtin <3>:                       Warning Options.    (line  270)
! * fno-builtin:                           C Dialect Options.  (line  213)
  * fno-canonical-system-headers:          Preprocessor Options.
!                                                              (line  502)
! * fno-check-pointer-bounds:              Debugging Options.  (line  388)
! * fno-chkp-check-incomplete-type:        Debugging Options.  (line  428)
! * fno-chkp-check-read:                   Debugging Options.  (line  478)
! * fno-chkp-check-write:                  Debugging Options.  (line  482)
! * fno-chkp-first-field-has-own-bounds:   Debugging Options.  (line  439)
! * fno-chkp-instrument-calls:             Debugging Options.  (line  490)
! * fno-chkp-instrument-marked-only:       Debugging Options.  (line  494)
! * fno-chkp-narrow-bounds:                Debugging Options.  (line  432)
! * fno-chkp-narrow-to-innermost-array:    Debugging Options.  (line  445)
! * fno-chkp-optimize:                     Debugging Options.  (line  450)
! * fno-chkp-store-bounds:                 Debugging Options.  (line  486)
  * fno-chkp-treat-zero-dynamic-size-as-infinite: Debugging Options.
!                                                              (line  471)
! * fno-chkp-use-fast-string-functions:    Debugging Options.  (line  454)
! * fno-chkp-use-nochk-string-functions:   Debugging Options.  (line  458)
! * fno-chkp-use-static-bounds:            Debugging Options.  (line  462)
! * fno-chkp-use-static-const-bounds:      Debugging Options.  (line  466)
! * fno-chkp-use-wrappers:                 Debugging Options.  (line  499)
! * fno-common <1>:                        Variable Attributes.
!                                                              (line  106)
  * fno-common:                            Code Gen Options.   (line  229)
! * fno-compare-debug:                     Debugging Options.  (line  512)
  * fno-debug-types-section:               Debugging Options.  (line   79)
  * fno-default-inline:                    Inline.             (line   71)
! * fno-defer-pop:                         Optimize Options.   (line  187)
  * fno-diagnostics-show-caret:            Language Independent Options.
                                                               (line   94)
  * fno-diagnostics-show-option:           Language Independent Options.
                                                               (line   88)
! * fno-dwarf2-cfi-asm:                    Debugging Options.  (line  636)
  * fno-elide-constructors:                C++ Dialect Options.
!                                                              (line  126)
! * fno-eliminate-unused-debug-types:      Debugging Options.  (line 1691)
  * fno-enforce-eh-specs:                  C++ Dialect Options.
!                                                              (line  132)
  * fno-ext-numeric-literals:              C++ Dialect Options.
!                                                              (line  612)
  * fno-extern-tls-init:                   C++ Dialect Options.
!                                                              (line  143)
  * fno-for-scope:                         C++ Dialect Options.
!                                                              (line  164)
! * fno-function-cse:                      Optimize Options.   (line  402)
  * fno-gnu-keywords:                      C++ Dialect Options.
!                                                              (line  176)
  * fno-gnu-unique:                        Code Gen Options.   (line  152)
! * fno-guess-branch-probability:          Optimize Options.   (line 1436)
! * fno-ident:                             Code Gen Options.   (line  249)
! * fno-implement-inlines <1>:             C++ Interface.      (line   66)
  * fno-implement-inlines:                 C++ Dialect Options.
!                                                              (line  193)
  * fno-implicit-inline-templates:         C++ Dialect Options.
!                                                              (line  187)
  * fno-implicit-templates <1>:            Template Instantiation.
                                                               (line   78)
! * fno-implicit-templates:                C++ Dialect Options.
!                                                              (line  181)
! * fno-inline:                            Optimize Options.   (line  248)
! * fno-ira-share-save-slots:              Optimize Options.   (line  685)
! * fno-ira-share-spill-slots:             Optimize Options.   (line  691)
! * fno-jump-tables:                       Code Gen Options.   (line  324)
! * fno-keep-inline-dllexport:             Optimize Options.   (line  335)
! * fno-lifetime-dse:                      Optimize Options.   (line  626)
  * fno-local-ivars:                       Objective-C and Objective-C++ Dialect Options.
                                                               (line  153)
! * fno-math-errno:                        Optimize Options.   (line 2090)
! * fno-merge-debug-strings:               Debugging Options.  (line  625)
  * fno-nil-receivers:                     Objective-C and Objective-C++ Dialect Options.
                                                               (line   49)
  * fno-nonansi-builtins:                  C++ Dialect Options.
!                                                              (line  203)
  * fno-operator-names:                    C++ Dialect Options.
!                                                              (line  219)
  * fno-optional-diags:                    C++ Dialect Options.
!                                                              (line  223)
! * fno-peephole:                          Optimize Options.   (line 1427)
! * fno-peephole2:                         Optimize Options.   (line 1427)
  * fno-pretty-templates:                  C++ Dialect Options.
!                                                              (line  233)
  * fno-rtti:                              C++ Dialect Options.
!                                                              (line  250)
! * fno-sanitize-recover:                  Debugging Options.  (line  354)
! * fno-sanitize=all:                      Debugging Options.  (line  344)
! * fno-sched-interblock:                  Optimize Options.   (line  736)
! * fno-sched-spec:                        Optimize Options.   (line  741)
  * fno-set-stack-executable:              x86 Windows Options.
                                                               (line   46)
  * fno-show-column:                       Preprocessor Options.
!                                                              (line  591)
! * fno-signed-bitfields:                  C Dialect Options.  (line  390)
! * fno-signed-zeros:                      Optimize Options.   (line 2162)
! * fno-stack-limit:                       Code Gen Options.   (line  495)
  * fno-threadsafe-statics:                C++ Dialect Options.
!                                                              (line  297)
! * fno-toplevel-reorder:                  Optimize Options.   (line 1635)
! * fno-trapping-math:                     Optimize Options.   (line 2172)
! * fno-unsigned-bitfields:                C Dialect Options.  (line  390)
  * fno-use-cxa-get-exception-ptr:         C++ Dialect Options.
!                                                              (line  310)
! * fno-var-tracking-assignments:          Debugging Options.  (line 1597)
! * fno-var-tracking-assignments-toggle:   Debugging Options.  (line 1608)
  * fno-weak:                              C++ Dialect Options.
!                                                              (line  424)
  * fno-working-directory:                 Preprocessor Options.
                                                               (line  576)
  * fno-writable-relocated-rdata:          x86 Windows Options.
                                                               (line   53)
! * fno-zero-initialized-in-bss:           Optimize Options.   (line  413)
! * fnon-call-exceptions:                  Code Gen Options.   (line  122)
  * fnothrow-opt:                          C++ Dialect Options.
!                                                              (line  208)
  * fobjc-abi-version:                     Objective-C and Objective-C++ Dialect Options.
                                                               (line   56)
  * fobjc-call-cxx-cdtors:                 Objective-C and Objective-C++ Dialect Options.
--- 48400,48766 ----
  * fdiagnostics-show-option:              Language Independent Options.
                                                               (line   88)
  * fdirectives-only:                      Preprocessor Options.
!                                                              (line  475)
! * fdisable-:                             Debugging Options.  (line  788)
  * fdollars-in-identifiers:               Preprocessor Options.
!                                                              (line  496)
! * fdollars-in-identifiers <1>:           Interoperation.     (line  141)
! * fdse:                                  Optimize Options.   (line  536)
! * fdump-ada-spec:                        Overall Options.    (line  362)
! * fdump-class-hierarchy:                 Debugging Options.  (line 1118)
! * fdump-final-insns:                     Debugging Options.  (line  511)
! * fdump-go-spec:                         Overall Options.    (line  371)
! * fdump-ipa:                             Debugging Options.  (line 1126)
! * fdump-noaddr:                          Debugging Options.  (line 1087)
! * fdump-passes:                          Debugging Options.  (line 1143)
! * fdump-rtl-alignments:                  Debugging Options.  (line  879)
! * fdump-rtl-all:                         Debugging Options.  (line 1060)
! * fdump-rtl-asmcons:                     Debugging Options.  (line  882)
! * fdump-rtl-auto_inc_dec:                Debugging Options.  (line  886)
! * fdump-rtl-barriers:                    Debugging Options.  (line  890)
! * fdump-rtl-bbpart:                      Debugging Options.  (line  893)
! * fdump-rtl-bbro:                        Debugging Options.  (line  896)
! * fdump-rtl-btl2:                        Debugging Options.  (line  900)
! * fdump-rtl-btl2 <1>:                    Debugging Options.  (line  900)
! * fdump-rtl-bypass:                      Debugging Options.  (line  904)
! * fdump-rtl-ce1:                         Debugging Options.  (line  915)
! * fdump-rtl-ce2:                         Debugging Options.  (line  915)
! * fdump-rtl-ce3:                         Debugging Options.  (line  915)
! * fdump-rtl-combine:                     Debugging Options.  (line  907)
! * fdump-rtl-compgotos:                   Debugging Options.  (line  910)
! * fdump-rtl-cprop_hardreg:               Debugging Options.  (line  919)
! * fdump-rtl-csa:                         Debugging Options.  (line  922)
! * fdump-rtl-cse1:                        Debugging Options.  (line  926)
! * fdump-rtl-cse2:                        Debugging Options.  (line  926)
! * fdump-rtl-dbr:                         Debugging Options.  (line  933)
! * fdump-rtl-dce:                         Debugging Options.  (line  930)
! * fdump-rtl-dce1:                        Debugging Options.  (line  937)
! * fdump-rtl-dce2:                        Debugging Options.  (line  937)
! * fdump-rtl-dfinish:                     Debugging Options.  (line 1056)
! * fdump-rtl-dfinit:                      Debugging Options.  (line 1056)
! * fdump-rtl-eh:                          Debugging Options.  (line  941)
! * fdump-rtl-eh_ranges:                   Debugging Options.  (line  944)
! * fdump-rtl-expand:                      Debugging Options.  (line  947)
! * fdump-rtl-fwprop1:                     Debugging Options.  (line  951)
! * fdump-rtl-fwprop2:                     Debugging Options.  (line  951)
! * fdump-rtl-gcse1:                       Debugging Options.  (line  956)
! * fdump-rtl-gcse2:                       Debugging Options.  (line  956)
! * fdump-rtl-init-regs:                   Debugging Options.  (line  960)
! * fdump-rtl-initvals:                    Debugging Options.  (line  963)
! * fdump-rtl-into_cfglayout:              Debugging Options.  (line  966)
! * fdump-rtl-ira:                         Debugging Options.  (line  969)
! * fdump-rtl-jump:                        Debugging Options.  (line  972)
! * fdump-rtl-loop2:                       Debugging Options.  (line  975)
! * fdump-rtl-mach:                        Debugging Options.  (line  979)
! * fdump-rtl-mode_sw:                     Debugging Options.  (line  983)
! * fdump-rtl-outof_cfglayout:             Debugging Options.  (line  989)
! * fdump-rtl-PASS:                        Debugging Options.  (line  858)
! * fdump-rtl-peephole2:                   Debugging Options.  (line  992)
! * fdump-rtl-postreload:                  Debugging Options.  (line  995)
! * fdump-rtl-pro_and_epilogue:            Debugging Options.  (line  998)
! * fdump-rtl-ree:                         Debugging Options.  (line 1006)
! * fdump-rtl-regclass:                    Debugging Options.  (line 1056)
! * fdump-rtl-rnreg:                       Debugging Options.  (line  986)
! * fdump-rtl-sched1:                      Debugging Options.  (line 1002)
! * fdump-rtl-sched2:                      Debugging Options.  (line 1002)
! * fdump-rtl-seqabstr:                    Debugging Options.  (line 1009)
! * fdump-rtl-shorten:                     Debugging Options.  (line 1012)
! * fdump-rtl-sibling:                     Debugging Options.  (line 1015)
! * fdump-rtl-sms:                         Debugging Options.  (line 1026)
! * fdump-rtl-split1:                      Debugging Options.  (line 1022)
! * fdump-rtl-split2:                      Debugging Options.  (line 1022)
! * fdump-rtl-split3:                      Debugging Options.  (line 1022)
! * fdump-rtl-split4:                      Debugging Options.  (line 1022)
! * fdump-rtl-split5:                      Debugging Options.  (line 1022)
! * fdump-rtl-stack:                       Debugging Options.  (line 1030)
! * fdump-rtl-subreg1:                     Debugging Options.  (line 1036)
! * fdump-rtl-subreg2:                     Debugging Options.  (line 1036)
! * fdump-rtl-subregs_of_mode_finish:      Debugging Options.  (line 1056)
! * fdump-rtl-subregs_of_mode_init:        Debugging Options.  (line 1056)
! * fdump-rtl-unshare:                     Debugging Options.  (line 1040)
! * fdump-rtl-vartrack:                    Debugging Options.  (line 1043)
! * fdump-rtl-vregs:                       Debugging Options.  (line 1046)
! * fdump-rtl-web:                         Debugging Options.  (line 1049)
! * fdump-statistics:                      Debugging Options.  (line 1147)
! * fdump-translation-unit:                Debugging Options.  (line 1109)
! * fdump-tree:                            Debugging Options.  (line 1159)
! * fdump-tree-alias:                      Debugging Options.  (line 1281)
! * fdump-tree-all:                        Debugging Options.  (line 1365)
! * fdump-tree-ccp:                        Debugging Options.  (line 1285)
! * fdump-tree-cfg:                        Debugging Options.  (line 1269)
! * fdump-tree-ch:                         Debugging Options.  (line 1273)
! * fdump-tree-copyprop:                   Debugging Options.  (line 1301)
! * fdump-tree-copyrename:                 Debugging Options.  (line 1341)
! * fdump-tree-dce:                        Debugging Options.  (line 1309)
! * fdump-tree-dom:                        Debugging Options.  (line 1322)
! * fdump-tree-dse:                        Debugging Options.  (line 1327)
! * fdump-tree-forwprop:                   Debugging Options.  (line 1336)
! * fdump-tree-fre:                        Debugging Options.  (line 1297)
! * fdump-tree-gimple:                     Debugging Options.  (line 1264)
! * fdump-tree-nrv:                        Debugging Options.  (line 1346)
! * fdump-tree-optimized:                  Debugging Options.  (line 1261)
! * fdump-tree-original:                   Debugging Options.  (line 1258)
! * fdump-tree-phiopt:                     Debugging Options.  (line 1331)
! * fdump-tree-pre:                        Debugging Options.  (line 1293)
! * fdump-tree-sink:                       Debugging Options.  (line 1318)
! * fdump-tree-slp:                        Debugging Options.  (line 1356)
! * fdump-tree-sra:                        Debugging Options.  (line 1313)
! * fdump-tree-ssa:                        Debugging Options.  (line 1277)
! * fdump-tree-storeccp:                   Debugging Options.  (line 1289)
! * fdump-tree-store_copyprop:             Debugging Options.  (line 1305)
! * fdump-tree-vect:                       Debugging Options.  (line 1351)
! * fdump-tree-vrp:                        Debugging Options.  (line 1361)
! * fdump-unnumbered:                      Debugging Options.  (line 1097)
! * fdump-unnumbered-links:                Debugging Options.  (line 1103)
! * fdwarf2-cfi-asm:                       Debugging Options.  (line  641)
! * fearly-inlining:                       Optimize Options.   (line  290)
! * feliminate-dwarf2-dups:                Debugging Options.  (line  556)
  * feliminate-unused-debug-symbols:       Debugging Options.  (line   67)
! * feliminate-unused-debug-types:         Debugging Options.  (line 1667)
  * femit-class-debug-always:              Debugging Options.  (line   71)
! * femit-struct-debug-baseonly:           Debugging Options.  (line  561)
! * femit-struct-debug-detailed:           Debugging Options.  (line  588)
! * femit-struct-debug-reduced:            Debugging Options.  (line  574)
! * fenable-:                              Debugging Options.  (line  788)
! * fexceptions:                           Code Gen Options.   (line  109)
! * fexcess-precision:                     Optimize Options.   (line 2047)
  * fexec-charset:                         Preprocessor Options.
                                                               (line  553)
! * fexpensive-optimizations:              Optimize Options.   (line  608)
  * fext-numeric-literals:                 C++ Dialect Options.
!                                                              (line  608)
  * fextended-identifiers:                 Preprocessor Options.
!                                                              (line  499)
  * fextern-tls-init:                      C++ Dialect Options.
!                                                              (line  141)
! * ffast-math:                            Optimize Options.   (line 2070)
! * ffat-lto-objects:                      Optimize Options.   (line 1915)
! * ffinite-math-only:                     Optimize Options.   (line 2147)
  * ffix-and-continue:                     Darwin Options.     (line  104)
! * ffixed:                                Code Gen Options.   (line  330)
! * ffloat-store:                          Optimize Options.   (line 2033)
  * ffloat-store <1>:                      Disappointments.    (line   77)
  * ffor-scope:                            C++ Dialect Options.
!                                                              (line  162)
! * fforward-propagate:                    Optimize Options.   (line  194)
! * ffp-contract:                          Optimize Options.   (line  203)
! * ffreestanding:                         Standards.          (line   91)
! * ffreestanding <1>:                     C Dialect Options.  (line  252)
! * ffreestanding <2>:                     Warning Options.    (line  272)
! * ffreestanding <3>:                     Function Attributes.
!                                                              (line  460)
  * ffriend-injection:                     C++ Dialect Options.
!                                                              (line  113)
! * ffunction-sections:                    Optimize Options.   (line 2352)
! * fgcse:                                 Optimize Options.   (line  461)
! * fgcse-after-reload:                    Optimize Options.   (line  497)
! * fgcse-las:                             Optimize Options.   (line  490)
! * fgcse-lm:                              Optimize Options.   (line  472)
! * fgcse-sm:                              Optimize Options.   (line  481)
  * fgnu-runtime:                          Objective-C and Objective-C++ Dialect Options.
                                                               (line   39)
! * fgnu-tm:                               C Dialect Options.  (line  299)
! * fgnu89-inline:                         C Dialect Options.  (line  156)
! * fgraphite-identity:                    Optimize Options.   (line 1169)
! * fhoist-adjacent-loads:                 Optimize Options.   (line  935)
! * fhosted:                               C Dialect Options.  (line  244)
! * fif-conversion:                        Optimize Options.   (line  540)
! * fif-conversion2:                       Optimize Options.   (line  549)
  * filelist:                              Darwin Options.     (line  196)
  * findirect-data:                        Darwin Options.     (line  104)
! * findirect-inlining:                    Optimize Options.   (line  263)
! * finhibit-size-directive:               Code Gen Options.   (line  251)
! * finline-functions:                     Optimize Options.   (line  271)
! * finline-functions-called-once:         Optimize Options.   (line  282)
! * finline-limit:                         Optimize Options.   (line  306)
! * finline-small-functions:               Optimize Options.   (line  254)
  * finput-charset:                        Preprocessor Options.
                                                               (line  566)
+ * finstrument-functions:                 Code Gen Options.   (line  386)
  * finstrument-functions <1>:             Function Attributes.
!                                                              (line 1067)
! * finstrument-functions-exclude-file-list: Code Gen Options. (line  421)
  * finstrument-functions-exclude-function-list: Code Gen Options.
!                                                              (line  442)
! * fipa-cp:                               Optimize Options.   (line  968)
! * fipa-cp-clone:                         Optimize Options.   (line  976)
! * fipa-icf:                              Optimize Options.   (line  993)
! * fipa-profile:                          Optimize Options.   (line  960)
! * fipa-pta:                              Optimize Options.   (line  954)
! * fipa-pure-const:                       Optimize Options.   (line  946)
! * fipa-ra:                               Optimize Options.   (line  893)
! * fipa-reference:                        Optimize Options.   (line  950)
! * fipa-sra:                              Optimize Options.   (line  299)
! * fira-algorithm:                        Optimize Options.   (line  636)
! * fira-hoist-pressure:                   Optimize Options.   (line  665)
! * fira-loop-pressure:                    Optimize Options.   (line  672)
! * fira-region:                           Optimize Options.   (line  644)
! * fira-verbose:                          Optimize Options.   (line  692)
! * fisolate-erroneous-paths-attribute:    Optimize Options.   (line 1014)
! * fisolate-erroneous-paths-dereference:  Optimize Options.   (line 1007)
  * fivar-visibility:                      Objective-C and Objective-C++ Dialect Options.
                                                               (line  162)
! * fivopts:                               Optimize Options.   (line 1271)
! * fkeep-inline-functions:                Optimize Options.   (line  337)
  * fkeep-inline-functions <1>:            Inline.             (line   51)
! * fkeep-static-consts:                   Optimize Options.   (line  344)
  * flat_namespace:                        Darwin Options.     (line  196)
! * flax-vector-conversions:               C Dialect Options.  (line  358)
! * fleading-underscore:                   Code Gen Options.   (line  524)
! * flive-range-shrinkage:                 Optimize Options.   (line  631)
  * flocal-ivars:                          Objective-C and Objective-C++ Dialect Options.
                                                               (line  153)
! * floop-block:                           Optimize Options.   (line 1140)
! * floop-interchange:                     Optimize Options.   (line 1095)
! * floop-nest-optimize:                   Optimize Options.   (line 1177)
! * floop-parallelize-all:                 Optimize Options.   (line 1189)
! * floop-strip-mine:                      Optimize Options.   (line 1119)
! * floop-unroll-and-jam:                  Optimize Options.   (line 1183)
! * flra-remat:                            Optimize Options.   (line  698)
! * flto:                                  Optimize Options.   (line 1663)
! * flto-compression-level:                Optimize Options.   (line 1877)
! * flto-odr-type-merging:                 Optimize Options.   (line 1872)
! * flto-partition:                        Optimize Options.   (line 1858)
! * flto-report:                           Optimize Options.   (line 1885)
! * flto-report-wpa:                       Optimize Options.   (line 1893)
  * fmax-errors:                           Warning Options.    (line   18)
! * fmem-report:                           Debugging Options.  (line  665)
! * fmem-report-wpa:                       Debugging Options.  (line  669)
! * fmerge-all-constants:                  Optimize Options.   (line  363)
! * fmerge-constants:                      Optimize Options.   (line  353)
! * fmerge-debug-strings:                  Debugging Options.  (line  630)
  * fmessage-length:                       Language Independent Options.
                                                               (line   14)
! * fmodulo-sched:                         Optimize Options.   (line  374)
! * fmodulo-sched-allow-regmoves:          Optimize Options.   (line  379)
! * fmove-loop-invariants:                 Optimize Options.   (line 2342)
! * fms-extensions:                        C Dialect Options.  (line  314)
! * fms-extensions <1>:                    C++ Dialect Options.
!                                                              (line  196)
! * fms-extensions <2>:                    Unnamed Fields.     (line   36)
  * fnext-runtime:                         Objective-C and Objective-C++ Dialect Options.
                                                               (line   43)
  * fno-access-control:                    C++ Dialect Options.
!                                                              (line   72)
! * fno-asm:                               C Dialect Options.  (line  196)
! * fno-branch-count-reg:                  Optimize Options.   (line  386)
! * fno-builtin:                           C Dialect Options.  (line  210)
! * fno-builtin <1>:                       Warning Options.    (line  272)
  * fno-builtin <2>:                       Function Attributes.
!                                                              (line  460)
! * fno-builtin <3>:                       Other Builtins.     (line   14)
  * fno-canonical-system-headers:          Preprocessor Options.
!                                                              (line  503)
! * fno-check-pointer-bounds:              Debugging Options.  (line  393)
! * fno-chkp-check-incomplete-type:        Debugging Options.  (line  433)
! * fno-chkp-check-read:                   Debugging Options.  (line  483)
! * fno-chkp-check-write:                  Debugging Options.  (line  487)
! * fno-chkp-first-field-has-own-bounds:   Debugging Options.  (line  444)
! * fno-chkp-instrument-calls:             Debugging Options.  (line  495)
! * fno-chkp-instrument-marked-only:       Debugging Options.  (line  499)
! * fno-chkp-narrow-bounds:                Debugging Options.  (line  437)
! * fno-chkp-narrow-to-innermost-array:    Debugging Options.  (line  450)
! * fno-chkp-optimize:                     Debugging Options.  (line  455)
! * fno-chkp-store-bounds:                 Debugging Options.  (line  491)
  * fno-chkp-treat-zero-dynamic-size-as-infinite: Debugging Options.
!                                                              (line  476)
! * fno-chkp-use-fast-string-functions:    Debugging Options.  (line  459)
! * fno-chkp-use-nochk-string-functions:   Debugging Options.  (line  463)
! * fno-chkp-use-static-bounds:            Debugging Options.  (line  467)
! * fno-chkp-use-static-const-bounds:      Debugging Options.  (line  471)
! * fno-chkp-use-wrappers:                 Debugging Options.  (line  504)
  * fno-common:                            Code Gen Options.   (line  229)
! * fno-common <1>:                        Variable Attributes.
!                                                              (line  105)
! * fno-compare-debug:                     Debugging Options.  (line  517)
  * fno-debug-types-section:               Debugging Options.  (line   79)
  * fno-default-inline:                    Inline.             (line   71)
! * fno-defer-pop:                         Optimize Options.   (line  186)
  * fno-diagnostics-show-caret:            Language Independent Options.
                                                               (line   94)
  * fno-diagnostics-show-option:           Language Independent Options.
                                                               (line   88)
! * fno-dwarf2-cfi-asm:                    Debugging Options.  (line  641)
  * fno-elide-constructors:                C++ Dialect Options.
!                                                              (line  125)
! * fno-eliminate-unused-debug-types:      Debugging Options.  (line 1667)
  * fno-enforce-eh-specs:                  C++ Dialect Options.
!                                                              (line  131)
  * fno-ext-numeric-literals:              C++ Dialect Options.
!                                                              (line  608)
  * fno-extern-tls-init:                   C++ Dialect Options.
!                                                              (line  141)
  * fno-for-scope:                         C++ Dialect Options.
!                                                              (line  162)
! * fno-function-cse:                      Optimize Options.   (line  398)
  * fno-gnu-keywords:                      C++ Dialect Options.
!                                                              (line  174)
  * fno-gnu-unique:                        Code Gen Options.   (line  152)
! * fno-guess-branch-probability:          Optimize Options.   (line 1430)
! * fno-ident:                             Code Gen Options.   (line  248)
  * fno-implement-inlines:                 C++ Dialect Options.
!                                                              (line  191)
! * fno-implement-inlines <1>:             C++ Interface.      (line   66)
  * fno-implicit-inline-templates:         C++ Dialect Options.
!                                                              (line  185)
! * fno-implicit-templates:                C++ Dialect Options.
!                                                              (line  179)
  * fno-implicit-templates <1>:            Template Instantiation.
                                                               (line   78)
! * fno-inline:                            Optimize Options.   (line  246)
! * fno-ira-share-save-slots:              Optimize Options.   (line  680)
! * fno-ira-share-spill-slots:             Optimize Options.   (line  686)
! * fno-jump-tables:                       Code Gen Options.   (line  322)
! * fno-keep-inline-dllexport:             Optimize Options.   (line  331)
! * fno-lifetime-dse:                      Optimize Options.   (line  622)
  * fno-local-ivars:                       Objective-C and Objective-C++ Dialect Options.
                                                               (line  153)
! * fno-math-errno:                        Optimize Options.   (line 2084)
! * fno-merge-debug-strings:               Debugging Options.  (line  630)
  * fno-nil-receivers:                     Objective-C and Objective-C++ Dialect Options.
                                                               (line   49)
  * fno-nonansi-builtins:                  C++ Dialect Options.
!                                                              (line  201)
  * fno-operator-names:                    C++ Dialect Options.
!                                                              (line  217)
  * fno-optional-diags:                    C++ Dialect Options.
!                                                              (line  221)
! * fno-peephole:                          Optimize Options.   (line 1421)
! * fno-peephole2:                         Optimize Options.   (line 1421)
  * fno-pretty-templates:                  C++ Dialect Options.
!                                                              (line  231)
  * fno-rtti:                              C++ Dialect Options.
!                                                              (line  248)
! * fno-sanitize-recover:                  Debugging Options.  (line  359)
! * fno-sanitize=all:                      Debugging Options.  (line  348)
! * fno-sched-interblock:                  Optimize Options.   (line  731)
! * fno-sched-spec:                        Optimize Options.   (line  736)
  * fno-set-stack-executable:              x86 Windows Options.
                                                               (line   46)
  * fno-show-column:                       Preprocessor Options.
!                                                              (line  590)
! * fno-signed-bitfields:                  C Dialect Options.  (line  391)
! * fno-signed-zeros:                      Optimize Options.   (line 2159)
! * fno-stack-limit:                       Code Gen Options.   (line  492)
  * fno-threadsafe-statics:                C++ Dialect Options.
!                                                              (line  295)
! * fno-toplevel-reorder:                  Optimize Options.   (line 1629)
! * fno-trapping-math:                     Optimize Options.   (line 2169)
! * fno-unsigned-bitfields:                C Dialect Options.  (line  391)
  * fno-use-cxa-get-exception-ptr:         C++ Dialect Options.
!                                                              (line  308)
! * fno-var-tracking-assignments:          Debugging Options.  (line 1573)
! * fno-var-tracking-assignments-toggle:   Debugging Options.  (line 1584)
  * fno-weak:                              C++ Dialect Options.
!                                                              (line  422)
  * fno-working-directory:                 Preprocessor Options.
                                                               (line  576)
  * fno-writable-relocated-rdata:          x86 Windows Options.
                                                               (line   53)
! * fno-zero-initialized-in-bss:           Optimize Options.   (line  409)
! * fnon-call-exceptions:                  Code Gen Options.   (line  123)
  * fnothrow-opt:                          C++ Dialect Options.
!                                                              (line  206)
  * fobjc-abi-version:                     Objective-C and Objective-C++ Dialect Options.
                                                               (line   56)
  * fobjc-call-cxx-cdtors:                 Objective-C and Objective-C++ Dialect Options.
*************** look up both forms.
*** 49126,49387 ****
                                                               (line  111)
  * fobjc-std:                             Objective-C and Objective-C++ Dialect Options.
                                                               (line  120)
! * fomit-frame-pointer:                   Optimize Options.   (line  215)
! * fopenacc:                              C Dialect Options.  (line  264)
  * fopenmp:                               C Dialect Options.  (line  276)
! * fopenmp-simd:                          C Dialect Options.  (line  284)
! * fopt-info:                             Debugging Options.  (line 1388)
! * foptimize-sibling-calls:               Optimize Options.   (line  236)
! * foptimize-strlen:                      Optimize Options.   (line  241)
  * force_cpusubtype_ALL:                  Darwin Options.     (line  135)
  * force_flat_namespace:                  Darwin Options.     (line  196)
! * fpack-struct:                          Code Gen Options.   (line  375)
! * fpartial-inlining:                     Optimize Options.   (line 1402)
! * fpcc-struct-return <1>:                Incompatibilities.  (line  170)
  * fpcc-struct-return:                    Code Gen Options.   (line  165)
  * fpch-deps:                             Preprocessor Options.
!                                                              (line  294)
  * fpch-preprocess:                       Preprocessor Options.
!                                                              (line  302)
! * fpeel-loops:                           Optimize Options.   (line 2338)
  * fpermissive:                           C++ Dialect Options.
!                                                              (line  228)
! * fPIC:                                  Code Gen Options.   (line  301)
! * fpic:                                  Code Gen Options.   (line  280)
! * fPIE:                                  Code Gen Options.   (line  314)
! * fpie:                                  Code Gen Options.   (line  314)
! * fplan9-extensions <1>:                 Unnamed Fields.     (line   44)
! * fplan9-extensions:                     C Dialect Options.  (line  331)
  * fplugin:                               Overall Options.    (line  351)
! * fplugin-arg:                           Overall Options.    (line  359)
! * fpost-ipa-mem-report:                  Debugging Options.  (line  670)
! * fpre-ipa-mem-report:                   Debugging Options.  (line  668)
! * fpredictive-commoning:                 Optimize Options.   (line 1409)
! * fprefetch-loop-arrays:                 Optimize Options.   (line 1416)
  * fpreprocessed:                         Preprocessor Options.
!                                                              (line  506)
! * fprofile-arcs <1>:                     Other Builtins.     (line  264)
! * fprofile-arcs:                         Debugging Options.  (line  709)
! * fprofile-correction:                   Optimize Options.   (line 1960)
! * fprofile-dir:                          Optimize Options.   (line 1967)
! * fprofile-generate:                     Optimize Options.   (line 1977)
! * fprofile-reorder-functions:            Optimize Options.   (line 2280)
! * fprofile-report:                       Debugging Options.  (line  674)
! * fprofile-use:                          Optimize Options.   (line 1990)
! * fprofile-values:                       Optimize Options.   (line 2271)
  * fpu:                                   RX Options.         (line   17)
! * frandom-seed:                          Debugging Options.  (line 1487)
! * freciprocal-math:                      Optimize Options.   (line 2141)
! * frecord-gcc-switches:                  Code Gen Options.   (line  268)
! * free:                                  Optimize Options.   (line  618)
  * freg-struct-return:                    Code Gen Options.   (line  183)
! * frename-registers:                     Optimize Options.   (line 2297)
! * freorder-blocks:                       Optimize Options.   (line 1453)
! * freorder-blocks-and-partition:         Optimize Options.   (line 1459)
! * freorder-functions:                    Optimize Options.   (line 1472)
  * freplace-objc-classes:                 Objective-C and Objective-C++ Dialect Options.
                                                               (line  131)
  * frepo <1>:                             Template Instantiation.
                                                               (line   54)
! * frepo:                                 C++ Dialect Options.
!                                                              (line  245)
! * freport-bug:                           Debugging Options.  (line 1091)
! * frerun-cse-after-loop:                 Optimize Options.   (line  459)
! * freschedule-modulo-scheduled-loops:    Optimize Options.   (line  835)
! * frounding-math:                        Optimize Options.   (line 2187)
! * fsanitize-recover:                     Debugging Options.  (line  354)
! * fsanitize-undefined-trap-on-error:     Debugging Options.  (line  381)
  * fsanitize=address:                     Debugging Options.  (line  199)
  * fsanitize=alignment:                   Debugging Options.  (line  288)
! * fsanitize=bool:                        Debugging Options.  (line  324)
  * fsanitize=bounds:                      Debugging Options.  (line  282)
! * fsanitize=enum:                        Debugging Options.  (line  328)
! * fsanitize=float-cast-overflow:         Debugging Options.  (line  305)
! * fsanitize=float-divide-by-zero:        Debugging Options.  (line  299)
  * fsanitize=integer-divide-by-zero:      Debugging Options.  (line  245)
  * fsanitize=kernel-address:              Debugging Options.  (line  211)
  * fsanitize=leak:                        Debugging Options.  (line  224)
! * fsanitize=nonnull-attribute:           Debugging Options.  (line  313)
  * fsanitize=null:                        Debugging Options.  (line  259)
! * fsanitize=object-size:                 Debugging Options.  (line  294)
  * fsanitize=return:                      Debugging Options.  (line  267)
! * fsanitize=returns-nonnull-attribute:   Debugging Options.  (line  319)
  * fsanitize=shift:                       Debugging Options.  (line  239)
  * fsanitize=signed-integer-overflow:     Debugging Options.  (line  273)
  * fsanitize=thread:                      Debugging Options.  (line  215)
  * fsanitize=undefined:                   Debugging Options.  (line  234)
  * fsanitize=unreachable:                 Debugging Options.  (line  249)
  * fsanitize=vla-bound:                   Debugging Options.  (line  255)
! * fsanitize=vptr:                        Debugging Options.  (line  333)
! * fsched-critical-path-heuristic:        Optimize Options.   (line  801)
! * fsched-dep-count-heuristic:            Optimize Options.   (line  828)
! * fsched-group-heuristic:                Optimize Options.   (line  795)
! * fsched-last-insn-heuristic:            Optimize Options.   (line  821)
! * fsched-pressure:                       Optimize Options.   (line  746)
! * fsched-rank-heuristic:                 Optimize Options.   (line  814)
! * fsched-spec-insn-heuristic:            Optimize Options.   (line  807)
! * fsched-spec-load:                      Optimize Options.   (line  755)
! * fsched-spec-load-dangerous:            Optimize Options.   (line  760)
! * fsched-stalled-insns:                  Optimize Options.   (line  766)
! * fsched-stalled-insns-dep:              Optimize Options.   (line  776)
! * fsched-verbose:                        Debugging Options.  (line 1501)
! * fsched2-use-superblocks:               Optimize Options.   (line  785)
! * fschedule-fusion:                      Optimize Options.   (line 2307)
! * fschedule-insns:                       Optimize Options.   (line  717)
! * fschedule-insns2:                      Optimize Options.   (line  727)
! * fsection-anchors:                      Optimize Options.   (line 2414)
! * fsel-sched-pipelining:                 Optimize Options.   (line  848)
! * fsel-sched-pipelining-outer-loops:     Optimize Options.   (line  853)
! * fselective-scheduling:                 Optimize Options.   (line  840)
! * fselective-scheduling2:                Optimize Options.   (line  844)
! * fsemantic-interposition:               Optimize Options.   (line  858)
  * fshort-double:                         Code Gen Options.   (line  211)
- * fshort-enums <1>:                      Non-bugs.           (line   42)
- * fshort-enums <2>:                      Type Attributes.    (line  114)
- * fshort-enums <3>:                      Structures unions enumerations and bit-fields implementation.
-                                                              (line   48)
  * fshort-enums:                          Code Gen Options.   (line  201)
  * fshort-wchar:                          Code Gen Options.   (line  219)
! * fshrink-wrap:                          Optimize Options.   (line  875)
! * fsignaling-nans:                       Optimize Options.   (line 2207)
  * fsigned-bitfields <1>:                 Non-bugs.           (line   57)
! * fsigned-bitfields:                     C Dialect Options.  (line  390)
  * fsigned-char <1>:                      Characters implementation.
                                                               (line   31)
! * fsigned-char:                          C Dialect Options.  (line  380)
! * fsimd-cost-model:                      Optimize Options.   (line 1367)
! * fsingle-precision-constant:            Optimize Options.   (line 2222)
  * fsized-deallocation:                   C++ Dialect Options.
!                                                              (line  260)
! * fsplit-ivs-in-unroller:                Optimize Options.   (line 1383)
  * fsplit-stack <1>:                      Function Attributes.
!                                                              (line 1078)
! * fsplit-stack:                          Code Gen Options.   (line  509)
! * fsplit-wide-types:                     Optimize Options.   (line  434)
! * fssa-phiopt:                           Optimize Options.   (line 1042)
! * fstack-check:                          Code Gen Options.   (line  456)
! * fstack-limit-register:                 Code Gen Options.   (line  495)
! * fstack-limit-symbol:                   Code Gen Options.   (line  495)
! * fstack-protector:                      Optimize Options.   (line 2389)
! * fstack-protector-all:                  Optimize Options.   (line 2398)
! * fstack-protector-explicit:             Optimize Options.   (line 2406)
! * fstack-protector-strong:               Optimize Options.   (line 2401)
! * fstack-usage:                          Debugging Options.  (line  678)
  * fstack_reuse:                          Code Gen Options.   (line   21)
  * fstats:                                C++ Dialect Options.
!                                                              (line  270)
! * fstdarg-opt:                           Optimize Options.   (line 2410)
! * fstrict-aliasing:                      Optimize Options.   (line 1485)
  * fstrict-enums:                         C++ Dialect Options.
!                                                              (line  275)
! * fstrict-overflow:                      Optimize Options.   (line 1531)
! * fstrict-volatile-bitfields:            Code Gen Options.   (line  614)
! * fsync-libcalls:                        Code Gen Options.   (line  647)
  * fsyntax-only:                          Warning Options.    (line   14)
  * ftabstop:                              Preprocessor Options.
!                                                              (line  519)
  * ftemplate-backtrace-limit:             C++ Dialect Options.
!                                                              (line  284)
  * ftemplate-depth:                       C++ Dialect Options.
!                                                              (line  288)
! * ftest-coverage:                        Debugging Options.  (line  765)
! * fthread-jumps:                         Optimize Options.   (line  425)
! * ftime-report:                          Debugging Options.  (line  656)
! * ftls-model:                            Code Gen Options.   (line  538)
! * ftracer:                               Optimize Options.   (line 2315)
  * ftrack-macro-expansion:                Preprocessor Options.
                                                               (line  535)
! * ftrapv:                                Code Gen Options.   (line   96)
! * ftree-bit-ccp:                         Optimize Options.   (line 1031)
! * ftree-builtin-call-dce:                Optimize Options.   (line 1063)
! * ftree-ccp:                             Optimize Options.   (line 1037)
! * ftree-ch:                              Optimize Options.   (line 1083)
! * ftree-coalesce-inlined-vars:           Optimize Options.   (line 1308)
! * ftree-coalesce-vars:                   Optimize Options.   (line 1317)
! * ftree-copy-prop:                       Optimize Options.   (line  946)
! * ftree-copyrename:                      Optimize Options.   (line 1301)
! * ftree-dce:                             Optimize Options.   (line 1059)
! * ftree-dominator-opts:                  Optimize Options.   (line 1069)
! * ftree-dse:                             Optimize Options.   (line 1076)
! * ftree-forwprop:                        Optimize Options.   (line  925)
! * ftree-fre:                             Optimize Options.   (line  929)
! * ftree-loop-distribute-patterns:        Optimize Options.   (line 1242)
! * ftree-loop-distribution:               Optimize Options.   (line 1225)
! * ftree-loop-if-convert:                 Optimize Options.   (line 1205)
! * ftree-loop-if-convert-stores:          Optimize Options.   (line 1212)
! * ftree-loop-im:                         Optimize Options.   (line 1262)
! * ftree-loop-ivcanon:                    Optimize Options.   (line 1271)
! * ftree-loop-linear:                     Optimize Options.   (line 1094)
! * ftree-loop-optimize:                   Optimize Options.   (line 1090)
! * ftree-loop-vectorize:                  Optimize Options.   (line 1345)
! * ftree-parallelize-loops:               Optimize Options.   (line 1282)
! * ftree-partial-pre:                     Optimize Options.   (line  921)
! * ftree-phiprop:                         Optimize Options.   (line  936)
! * ftree-pre:                             Optimize Options.   (line  917)
! * ftree-pta:                             Optimize Options.   (line 1291)
! * ftree-reassoc:                         Optimize Options.   (line  913)
! * ftree-sink:                            Optimize Options.   (line 1027)
! * ftree-slp-vectorize:                   Optimize Options.   (line 1349)
! * ftree-slsr:                            Optimize Options.   (line 1334)
! * ftree-sra:                             Optimize Options.   (line 1295)
! * ftree-switch-conversion:               Optimize Options.   (line 1046)
! * ftree-tail-merge:                      Optimize Options.   (line 1051)
! * ftree-ter:                             Optimize Options.   (line 1326)
! * ftree-vectorize:                       Optimize Options.   (line 1340)
! * ftree-vrp:                             Optimize Options.   (line 1374)
! * funit-at-a-time:                       Optimize Options.   (line 1628)
! * funroll-all-loops:                     Optimize Options.   (line 2332)
! * funroll-loops:                         Optimize Options.   (line 2322)
! * funsafe-loop-optimizations:            Optimize Options.   (line  515)
! * funsafe-math-optimizations:            Optimize Options.   (line 2108)
! * funsigned-bitfields <1>:               Non-bugs.           (line   57)
! * funsigned-bitfields <2>:               Structures unions enumerations and bit-fields implementation.
                                                               (line   17)
! * funsigned-bitfields:                   C Dialect Options.  (line  390)
  * funsigned-char <1>:                    Characters implementation.
                                                               (line   31)
! * funsigned-char:                        C Dialect Options.  (line  362)
! * funswitch-loops:                       Optimize Options.   (line 2350)
  * funwind-tables:                        Code Gen Options.   (line  139)
  * fuse-cxa-atexit:                       C++ Dialect Options.
!                                                              (line  303)
  * fuse-ld=bfd:                           Link Options.       (line   25)
  * fuse-ld=gold:                          Link Options.       (line   28)
! * fuse-linker-plugin:                    Optimize Options.   (line 1904)
! * fvar-tracking:                         Debugging Options.  (line 1587)
! * fvar-tracking-assignments:             Debugging Options.  (line 1597)
! * fvar-tracking-assignments-toggle:      Debugging Options.  (line 1608)
! * fvariable-expansion-in-unroller:       Optimize Options.   (line 1397)
! * fvect-cost-model:                      Optimize Options.   (line 1353)
! * fverbose-asm:                          Code Gen Options.   (line  259)
! * fvisibility:                           Code Gen Options.   (line  549)
  * fvisibility-inlines-hidden:            C++ Dialect Options.
!                                                              (line  315)
  * fvisibility-ms-compat:                 C++ Dialect Options.
!                                                              (line  343)
! * fvpt:                                  Optimize Options.   (line 2287)
  * fvtable-verify:                        C++ Dialect Options.
!                                                              (line  372)
  * fvtv-counts:                           C++ Dialect Options.
!                                                              (line  407)
  * fvtv-debug:                            C++ Dialect Options.
!                                                              (line  394)
! * fweb:                                  Optimize Options.   (line 1647)
! * fwhole-program:                        Optimize Options.   (line 1658)
  * fwide-exec-charset:                    Preprocessor Options.
                                                               (line  558)
  * fworking-directory:                    Preprocessor Options.
                                                               (line  576)
! * fwrapv:                                Code Gen Options.   (line  100)
  * fzero-link:                            Objective-C and Objective-C++ Dialect Options.
                                                               (line  141)
- * G <1>:                                 System V Options.   (line   10)
- * G <2>:                                 RS/6000 and PowerPC Options.
-                                                              (line  770)
- * G <3>:                                 Nios II Options.    (line    9)
- * G <4>:                                 MIPS Options.       (line  440)
- * G:                                     M32R/D Options.     (line   57)
  * g:                                     Debugging Options.  (line   10)
  * gcoff:                                 Debugging Options.  (line   94)
  * gdwarf-VERSION:                        Debugging Options.  (line  112)
  * gen-decls:                             Objective-C and Objective-C++ Dialect Options.
--- 48775,49036 ----
                                                               (line  111)
  * fobjc-std:                             Objective-C and Objective-C++ Dialect Options.
                                                               (line  120)
! * fomit-frame-pointer:                   Optimize Options.   (line  214)
! * fopenacc:                              C Dialect Options.  (line  263)
  * fopenmp:                               C Dialect Options.  (line  276)
! * fopenmp-simd:                          C Dialect Options.  (line  285)
! * fopt-info:                             Debugging Options.  (line 1371)
! * foptimize-sibling-calls:               Optimize Options.   (line  234)
! * foptimize-strlen:                      Optimize Options.   (line  239)
  * force_cpusubtype_ALL:                  Darwin Options.     (line  135)
  * force_flat_namespace:                  Darwin Options.     (line  196)
! * fpack-struct:                          Code Gen Options.   (line  373)
! * fpartial-inlining:                     Optimize Options.   (line 1396)
  * fpcc-struct-return:                    Code Gen Options.   (line  165)
+ * fpcc-struct-return <1>:                Incompatibilities.  (line  170)
  * fpch-deps:                             Preprocessor Options.
!                                                              (line  296)
  * fpch-preprocess:                       Preprocessor Options.
!                                                              (line  304)
! * fpeel-loops:                           Optimize Options.   (line 2334)
  * fpermissive:                           C++ Dialect Options.
!                                                              (line  226)
! * fpic:                                  Code Gen Options.   (line  279)
! * fPIC:                                  Code Gen Options.   (line  300)
! * fpie:                                  Code Gen Options.   (line  313)
! * fPIE:                                  Code Gen Options.   (line  313)
! * fplan9-extensions:                     C Dialect Options.  (line  332)
! * fplan9-extensions <1>:                 Unnamed Fields.     (line   43)
  * fplugin:                               Overall Options.    (line  351)
! * fplugin-arg:                           Overall Options.    (line  358)
! * fpost-ipa-mem-report:                  Debugging Options.  (line  674)
! * fpre-ipa-mem-report:                   Debugging Options.  (line  673)
! * fpredictive-commoning:                 Optimize Options.   (line 1403)
! * fprefetch-loop-arrays:                 Optimize Options.   (line 1410)
  * fpreprocessed:                         Preprocessor Options.
!                                                              (line  507)
! * fprofile-arcs:                         Debugging Options.  (line  711)
! * fprofile-arcs <1>:                     Other Builtins.     (line  260)
! * fprofile-correction:                   Optimize Options.   (line 1952)
! * fprofile-dir:                          Optimize Options.   (line 1959)
! * fprofile-generate:                     Optimize Options.   (line 1970)
! * fprofile-reorder-functions:            Optimize Options.   (line 2276)
! * fprofile-report:                       Debugging Options.  (line  678)
! * fprofile-use:                          Optimize Options.   (line 1984)
! * fprofile-values:                       Optimize Options.   (line 2267)
  * fpu:                                   RX Options.         (line   17)
! * frandom-seed:                          Debugging Options.  (line 1463)
! * freciprocal-math:                      Optimize Options.   (line 2137)
! * frecord-gcc-switches:                  Code Gen Options.   (line  267)
! * free:                                  Optimize Options.   (line  614)
  * freg-struct-return:                    Code Gen Options.   (line  183)
! * frename-registers:                     Optimize Options.   (line 2293)
! * freorder-blocks:                       Optimize Options.   (line 1447)
! * freorder-blocks-and-partition:         Optimize Options.   (line 1453)
! * freorder-functions:                    Optimize Options.   (line 1466)
  * freplace-objc-classes:                 Objective-C and Objective-C++ Dialect Options.
                                                               (line  131)
+ * frepo:                                 C++ Dialect Options.
+                                                              (line  243)
  * frepo <1>:                             Template Instantiation.
                                                               (line   54)
! * freport-bug:                           Debugging Options.  (line 1093)
! * frerun-cse-after-loop:                 Optimize Options.   (line  455)
! * freschedule-modulo-scheduled-loops:    Optimize Options.   (line  830)
! * frounding-math:                        Optimize Options.   (line 2184)
! * fsanitize-recover:                     Debugging Options.  (line  359)
! * fsanitize-undefined-trap-on-error:     Debugging Options.  (line  386)
  * fsanitize=address:                     Debugging Options.  (line  199)
  * fsanitize=alignment:                   Debugging Options.  (line  288)
! * fsanitize=bool:                        Debugging Options.  (line  326)
  * fsanitize=bounds:                      Debugging Options.  (line  282)
! * fsanitize=enum:                        Debugging Options.  (line  331)
! * fsanitize=float-cast-overflow:         Debugging Options.  (line  306)
! * fsanitize=float-divide-by-zero:        Debugging Options.  (line  300)
  * fsanitize=integer-divide-by-zero:      Debugging Options.  (line  245)
  * fsanitize=kernel-address:              Debugging Options.  (line  211)
  * fsanitize=leak:                        Debugging Options.  (line  224)
! * fsanitize=nonnull-attribute:           Debugging Options.  (line  314)
  * fsanitize=null:                        Debugging Options.  (line  259)
! * fsanitize=object-size:                 Debugging Options.  (line  295)
  * fsanitize=return:                      Debugging Options.  (line  267)
! * fsanitize=returns-nonnull-attribute:   Debugging Options.  (line  320)
  * fsanitize=shift:                       Debugging Options.  (line  239)
  * fsanitize=signed-integer-overflow:     Debugging Options.  (line  273)
  * fsanitize=thread:                      Debugging Options.  (line  215)
  * fsanitize=undefined:                   Debugging Options.  (line  234)
  * fsanitize=unreachable:                 Debugging Options.  (line  249)
  * fsanitize=vla-bound:                   Debugging Options.  (line  255)
! * fsanitize=vptr:                        Debugging Options.  (line  337)
! * fsched-critical-path-heuristic:        Optimize Options.   (line  796)
! * fsched-dep-count-heuristic:            Optimize Options.   (line  823)
! * fsched-group-heuristic:                Optimize Options.   (line  790)
! * fsched-last-insn-heuristic:            Optimize Options.   (line  816)
! * fsched-pressure:                       Optimize Options.   (line  741)
! * fsched-rank-heuristic:                 Optimize Options.   (line  809)
! * fsched-spec-insn-heuristic:            Optimize Options.   (line  802)
! * fsched-spec-load:                      Optimize Options.   (line  750)
! * fsched-spec-load-dangerous:            Optimize Options.   (line  755)
! * fsched-stalled-insns:                  Optimize Options.   (line  761)
! * fsched-stalled-insns-dep:              Optimize Options.   (line  771)
! * fsched-verbose:                        Debugging Options.  (line 1477)
! * fsched2-use-superblocks:               Optimize Options.   (line  780)
! * fschedule-fusion:                      Optimize Options.   (line 2303)
! * fschedule-insns:                       Optimize Options.   (line  712)
! * fschedule-insns2:                      Optimize Options.   (line  722)
! * fsection-anchors:                      Optimize Options.   (line 2410)
! * fsel-sched-pipelining:                 Optimize Options.   (line  843)
! * fsel-sched-pipelining-outer-loops:     Optimize Options.   (line  848)
! * fselective-scheduling:                 Optimize Options.   (line  835)
! * fselective-scheduling2:                Optimize Options.   (line  839)
! * fsemantic-interposition:               Optimize Options.   (line  853)
  * fshort-double:                         Code Gen Options.   (line  211)
  * fshort-enums:                          Code Gen Options.   (line  201)
+ * fshort-enums <1>:                      Structures unions enumerations and bit-fields implementation.
+                                                              (line   48)
+ * fshort-enums <2>:                      Type Attributes.    (line  114)
+ * fshort-enums <3>:                      Non-bugs.           (line   42)
  * fshort-wchar:                          Code Gen Options.   (line  219)
! * fshrink-wrap:                          Optimize Options.   (line  870)
! * fsignaling-nans:                       Optimize Options.   (line 2204)
! * fsigned-bitfields:                     C Dialect Options.  (line  391)
  * fsigned-bitfields <1>:                 Non-bugs.           (line   57)
! * fsigned-char:                          C Dialect Options.  (line  381)
  * fsigned-char <1>:                      Characters implementation.
                                                               (line   31)
! * fsimd-cost-model:                      Optimize Options.   (line 1361)
! * fsingle-precision-constant:            Optimize Options.   (line 2219)
  * fsized-deallocation:                   C++ Dialect Options.
!                                                              (line  258)
! * fsplit-ivs-in-unroller:                Optimize Options.   (line 1377)
! * fsplit-stack:                          Code Gen Options.   (line  506)
  * fsplit-stack <1>:                      Function Attributes.
!                                                              (line 1072)
! * fsplit-wide-types:                     Optimize Options.   (line  430)
! * fssa-phiopt:                           Optimize Options.   (line 1037)
! * fstack-check:                          Code Gen Options.   (line  454)
! * fstack-limit-register:                 Code Gen Options.   (line  492)
! * fstack-limit-symbol:                   Code Gen Options.   (line  492)
! * fstack-protector:                      Optimize Options.   (line 2385)
! * fstack-protector-all:                  Optimize Options.   (line 2394)
! * fstack-protector-explicit:             Optimize Options.   (line 2402)
! * fstack-protector-strong:               Optimize Options.   (line 2397)
! * fstack-usage:                          Debugging Options.  (line  682)
  * fstack_reuse:                          Code Gen Options.   (line   21)
  * fstats:                                C++ Dialect Options.
!                                                              (line  268)
! * fstdarg-opt:                           Optimize Options.   (line 2406)
! * fstrict-aliasing:                      Optimize Options.   (line 1479)
  * fstrict-enums:                         C++ Dialect Options.
!                                                              (line  273)
! * fstrict-overflow:                      Optimize Options.   (line 1525)
! * fstrict-volatile-bitfields:            Code Gen Options.   (line  611)
! * fsync-libcalls:                        Code Gen Options.   (line  643)
  * fsyntax-only:                          Warning Options.    (line   14)
  * ftabstop:                              Preprocessor Options.
!                                                              (line  520)
  * ftemplate-backtrace-limit:             C++ Dialect Options.
!                                                              (line  282)
  * ftemplate-depth:                       C++ Dialect Options.
!                                                              (line  286)
! * ftest-coverage:                        Debugging Options.  (line  766)
! * fthread-jumps:                         Optimize Options.   (line  421)
! * ftime-report:                          Debugging Options.  (line  661)
! * ftls-model:                            Code Gen Options.   (line  535)
! * ftracer:                               Optimize Options.   (line 2311)
  * ftrack-macro-expansion:                Preprocessor Options.
                                                               (line  535)
! * ftrapv:                                Code Gen Options.   (line   97)
! * ftree-bit-ccp:                         Optimize Options.   (line 1026)
! * ftree-builtin-call-dce:                Optimize Options.   (line 1058)
! * ftree-ccp:                             Optimize Options.   (line 1032)
! * ftree-ch:                              Optimize Options.   (line 1078)
! * ftree-coalesce-inlined-vars:           Optimize Options.   (line 1302)
! * ftree-coalesce-vars:                   Optimize Options.   (line 1311)
! * ftree-copy-prop:                       Optimize Options.   (line  941)
! * ftree-copyrename:                      Optimize Options.   (line 1295)
! * ftree-dce:                             Optimize Options.   (line 1054)
! * ftree-dominator-opts:                  Optimize Options.   (line 1064)
! * ftree-dse:                             Optimize Options.   (line 1071)
! * ftree-forwprop:                        Optimize Options.   (line  920)
! * ftree-fre:                             Optimize Options.   (line  924)
! * ftree-loop-distribute-patterns:        Optimize Options.   (line 1236)
! * ftree-loop-distribution:               Optimize Options.   (line 1219)
! * ftree-loop-if-convert:                 Optimize Options.   (line 1199)
! * ftree-loop-if-convert-stores:          Optimize Options.   (line 1206)
! * ftree-loop-im:                         Optimize Options.   (line 1256)
! * ftree-loop-ivcanon:                    Optimize Options.   (line 1265)
! * ftree-loop-linear:                     Optimize Options.   (line 1089)
! * ftree-loop-optimize:                   Optimize Options.   (line 1085)
! * ftree-loop-vectorize:                  Optimize Options.   (line 1339)
! * ftree-parallelize-loops:               Optimize Options.   (line 1276)
! * ftree-partial-pre:                     Optimize Options.   (line  916)
! * ftree-phiprop:                         Optimize Options.   (line  931)
! * ftree-pre:                             Optimize Options.   (line  912)
! * ftree-pta:                             Optimize Options.   (line 1285)
! * ftree-reassoc:                         Optimize Options.   (line  908)
! * ftree-sink:                            Optimize Options.   (line 1022)
! * ftree-slp-vectorize:                   Optimize Options.   (line 1343)
! * ftree-slsr:                            Optimize Options.   (line 1328)
! * ftree-sra:                             Optimize Options.   (line 1289)
! * ftree-switch-conversion:               Optimize Options.   (line 1041)
! * ftree-tail-merge:                      Optimize Options.   (line 1046)
! * ftree-ter:                             Optimize Options.   (line 1320)
! * ftree-vectorize:                       Optimize Options.   (line 1334)
! * ftree-vrp:                             Optimize Options.   (line 1368)
! * funit-at-a-time:                       Optimize Options.   (line 1622)
! * funroll-all-loops:                     Optimize Options.   (line 2328)
! * funroll-loops:                         Optimize Options.   (line 2318)
! * funsafe-loop-optimizations:            Optimize Options.   (line  511)
! * funsafe-math-optimizations:            Optimize Options.   (line 2102)
! * funsigned-bitfields:                   C Dialect Options.  (line  391)
! * funsigned-bitfields <1>:               Structures unions enumerations and bit-fields implementation.
                                                               (line   17)
! * funsigned-bitfields <2>:               Non-bugs.           (line   57)
! * funsigned-char:                        C Dialect Options.  (line  363)
  * funsigned-char <1>:                    Characters implementation.
                                                               (line   31)
! * funswitch-loops:                       Optimize Options.   (line 2346)
  * funwind-tables:                        Code Gen Options.   (line  139)
  * fuse-cxa-atexit:                       C++ Dialect Options.
!                                                              (line  301)
  * fuse-ld=bfd:                           Link Options.       (line   25)
  * fuse-ld=gold:                          Link Options.       (line   28)
! * fuse-linker-plugin:                    Optimize Options.   (line 1897)
! * fvar-tracking:                         Debugging Options.  (line 1563)
! * fvar-tracking-assignments:             Debugging Options.  (line 1573)
! * fvar-tracking-assignments-toggle:      Debugging Options.  (line 1584)
! * fvariable-expansion-in-unroller:       Optimize Options.   (line 1391)
! * fvect-cost-model:                      Optimize Options.   (line 1347)
! * fverbose-asm:                          Code Gen Options.   (line  258)
! * fvisibility:                           Code Gen Options.   (line  546)
  * fvisibility-inlines-hidden:            C++ Dialect Options.
!                                                              (line  313)
  * fvisibility-ms-compat:                 C++ Dialect Options.
!                                                              (line  341)
! * fvpt:                                  Optimize Options.   (line 2283)
  * fvtable-verify:                        C++ Dialect Options.
!                                                              (line  370)
  * fvtv-counts:                           C++ Dialect Options.
!                                                              (line  405)
  * fvtv-debug:                            C++ Dialect Options.
!                                                              (line  392)
! * fweb:                                  Optimize Options.   (line 1641)
! * fwhole-program:                        Optimize Options.   (line 1652)
  * fwide-exec-charset:                    Preprocessor Options.
                                                               (line  558)
  * fworking-directory:                    Preprocessor Options.
                                                               (line  576)
! * fwrapv:                                Code Gen Options.   (line  101)
  * fzero-link:                            Objective-C and Objective-C++ Dialect Options.
                                                               (line  141)
  * g:                                     Debugging Options.  (line   10)
+ * G:                                     M32R/D Options.     (line   57)
+ * G <1>:                                 MIPS Options.       (line  436)
+ * G <2>:                                 Nios II Options.    (line    9)
+ * G <3>:                                 RS/6000 and PowerPC Options.
+                                                              (line  773)
+ * G <4>:                                 System V Options.   (line   10)
  * gcoff:                                 Debugging Options.  (line   94)
  * gdwarf-VERSION:                        Debugging Options.  (line  112)
  * gen-decls:                             Objective-C and Objective-C++ Dialect Options.
*************** look up both forms.
*** 49404,49462 ****
  * gxcoff+:                               Debugging Options.  (line  104)
  * gz:                                    Debugging Options.  (line  147)
  * H:                                     Preprocessor Options.
!                                                              (line  709)
  * headerpad_max_install_names:           Darwin Options.     (line  196)
- * help <1>:                              Preprocessor Options.
-                                                              (line  701)
  * help:                                  Overall Options.    (line  221)
! * I <1>:                                 Directory Options.  (line   10)
  * I:                                     Preprocessor Options.
                                                               (line   77)
! * I- <1>:                                Directory Options.  (line  118)
  * I-:                                    Preprocessor Options.
!                                                              (line  387)
  * idirafter:                             Preprocessor Options.
!                                                              (line  429)
  * iframework:                            Darwin Options.     (line   57)
  * imacros:                               Preprocessor Options.
!                                                              (line  420)
  * image_base:                            Darwin Options.     (line  196)
  * imultilib:                             Preprocessor Options.
!                                                              (line  454)
  * include:                               Preprocessor Options.
!                                                              (line  409)
  * init:                                  Darwin Options.     (line  196)
  * install_name:                          Darwin Options.     (line  196)
! * iplugindir=:                           Directory Options.  (line   31)
  * iprefix:                               Preprocessor Options.
!                                                              (line  436)
! * iquote <1>:                            Directory Options.  (line   36)
  * iquote:                                Preprocessor Options.
!                                                              (line  466)
  * isysroot:                              Preprocessor Options.
!                                                              (line  448)
  * isystem:                               Preprocessor Options.
!                                                              (line  458)
  * iwithprefix:                           Preprocessor Options.
!                                                              (line  442)
  * iwithprefixbefore:                     Preprocessor Options.
!                                                              (line  442)
  * keep_private_externs:                  Darwin Options.     (line  196)
- * L:                                     Directory Options.  (line   42)
  * l:                                     Link Options.       (line   32)
  * lobjc:                                 Link Options.       (line   59)
- * m:                                     RS/6000 and PowerPC Options.
-                                                              (line  611)
  * M:                                     Preprocessor Options.
                                                               (line  185)
  * m1:                                    SH Options.         (line    9)
  * m10:                                   PDP-11 Options.     (line   29)
! * m128bit-long-double:                   x86 Options.        (line  396)
! * m16:                                   x86 Options.        (line  965)
! * m16-bit <1>:                           NDS32 Options.      (line   39)
  * m16-bit:                               CRIS Options.       (line   64)
  * m1reg-:                                Adapteva Epiphany Options.
!                                                              (line  132)
  * m2:                                    SH Options.         (line   12)
  * m210:                                  MCore Options.      (line   43)
  * m2a:                                   SH Options.         (line   30)
--- 49053,49111 ----
  * gxcoff+:                               Debugging Options.  (line  104)
  * gz:                                    Debugging Options.  (line  147)
  * H:                                     Preprocessor Options.
!                                                              (line  706)
  * headerpad_max_install_names:           Darwin Options.     (line  196)
  * help:                                  Overall Options.    (line  221)
! * help <1>:                              Preprocessor Options.
!                                                              (line  698)
  * I:                                     Preprocessor Options.
                                                               (line   77)
! * I <1>:                                 Directory Options.  (line   10)
  * I-:                                    Preprocessor Options.
!                                                              (line  389)
! * I- <1>:                                Directory Options.  (line  116)
  * idirafter:                             Preprocessor Options.
!                                                              (line  431)
  * iframework:                            Darwin Options.     (line   57)
  * imacros:                               Preprocessor Options.
!                                                              (line  422)
  * image_base:                            Darwin Options.     (line  196)
  * imultilib:                             Preprocessor Options.
!                                                              (line  456)
  * include:                               Preprocessor Options.
!                                                              (line  411)
  * init:                                  Darwin Options.     (line  196)
  * install_name:                          Darwin Options.     (line  196)
! * iplugindir=:                           Directory Options.  (line   29)
  * iprefix:                               Preprocessor Options.
!                                                              (line  438)
  * iquote:                                Preprocessor Options.
!                                                              (line  468)
! * iquote <1>:                            Directory Options.  (line   34)
  * isysroot:                              Preprocessor Options.
!                                                              (line  450)
  * isystem:                               Preprocessor Options.
!                                                              (line  460)
  * iwithprefix:                           Preprocessor Options.
!                                                              (line  444)
  * iwithprefixbefore:                     Preprocessor Options.
!                                                              (line  444)
  * keep_private_externs:                  Darwin Options.     (line  196)
  * l:                                     Link Options.       (line   32)
+ * L:                                     Directory Options.  (line   40)
  * lobjc:                                 Link Options.       (line   59)
  * M:                                     Preprocessor Options.
                                                               (line  185)
+ * m:                                     RS/6000 and PowerPC Options.
+                                                              (line  615)
  * m1:                                    SH Options.         (line    9)
  * m10:                                   PDP-11 Options.     (line   29)
! * m128bit-long-double:                   x86 Options.        (line  389)
! * m16:                                   x86 Options.        (line  955)
  * m16-bit:                               CRIS Options.       (line   64)
+ * m16-bit <1>:                           NDS32 Options.      (line   39)
  * m1reg-:                                Adapteva Epiphany Options.
!                                                              (line  131)
  * m2:                                    SH Options.         (line   12)
  * m210:                                  MCore Options.      (line   43)
  * m2a:                                   SH Options.         (line   30)
*************** look up both forms.
*** 49465,49486 ****
  * m2a-single-only:                       SH Options.         (line   22)
  * m3:                                    SH Options.         (line   34)
  * m31:                                   S/390 and zSeries Options.
!                                                              (line   87)
! * m32 <1>:                               x86 Options.        (line  965)
! * m32 <2>:                               TILEPro Options.    (line   13)
! * m32 <3>:                               TILE-Gx Options.    (line   23)
! * m32 <4>:                               SPARC Options.      (line  257)
! * m32 <5>:                               RS/6000 and PowerPC Options.
!                                                              (line  303)
  * m32:                                   Nvidia PTX Options. (line   10)
  * m32-bit:                               CRIS Options.       (line   64)
- * m32bit-doubles <1>:                    RX Options.         (line   10)
  * m32bit-doubles:                        RL78 Options.       (line   22)
  * m32r:                                  M32R/D Options.     (line   15)
  * m32r2:                                 M32R/D Options.     (line    9)
  * m32rx:                                 M32R/D Options.     (line   12)
  * m340:                                  MCore Options.      (line   43)
! * m3dnow:                                x86 Options.        (line  609)
  * m3e:                                   SH Options.         (line   37)
  * m4:                                    SH Options.         (line   51)
  * m4-100:                                SH Options.         (line   54)
--- 49114,49135 ----
  * m2a-single-only:                       SH Options.         (line   22)
  * m3:                                    SH Options.         (line   34)
  * m31:                                   S/390 and zSeries Options.
!                                                              (line   86)
  * m32:                                   Nvidia PTX Options. (line   10)
+ * m32 <1>:                               RS/6000 and PowerPC Options.
+                                                              (line  308)
+ * m32 <2>:                               SPARC Options.      (line  256)
+ * m32 <3>:                               TILE-Gx Options.    (line   23)
+ * m32 <4>:                               TILEPro Options.    (line   13)
+ * m32 <5>:                               x86 Options.        (line  955)
  * m32-bit:                               CRIS Options.       (line   64)
  * m32bit-doubles:                        RL78 Options.       (line   22)
+ * m32bit-doubles <1>:                    RX Options.         (line   10)
  * m32r:                                  M32R/D Options.     (line   15)
  * m32r2:                                 M32R/D Options.     (line    9)
  * m32rx:                                 M32R/D Options.     (line   12)
  * m340:                                  MCore Options.      (line   43)
! * m3dnow:                                x86 Options.        (line  603)
  * m3e:                                   SH Options.         (line   37)
  * m4:                                    SH Options.         (line   51)
  * m4-100:                                SH Options.         (line   54)
*************** look up both forms.
*** 49514,49776 ****
  * m5-64media-nofpu:                      SH Options.         (line  136)
  * m5-compact:                            SH Options.         (line  140)
  * m5-compact-nofpu:                      SH Options.         (line  143)
! * m5200:                                 M680x0 Options.     (line  147)
! * m5206e:                                M680x0 Options.     (line  156)
! * m528x:                                 M680x0 Options.     (line  160)
! * m5307:                                 M680x0 Options.     (line  164)
! * m5407:                                 M680x0 Options.     (line  168)
! * m64 <1>:                               x86 Options.        (line  965)
! * m64 <2>:                               TILE-Gx Options.    (line   23)
! * m64 <3>:                               SPARC Options.      (line  257)
! * m64 <4>:                               S/390 and zSeries Options.
!                                                              (line   87)
! * m64 <5>:                               RS/6000 and PowerPC Options.
!                                                              (line  303)
  * m64:                                   Nvidia PTX Options. (line   10)
! * m64bit-doubles <1>:                    RX Options.         (line   10)
  * m64bit-doubles:                        RL78 Options.       (line   22)
! * m68000:                                M680x0 Options.     (line   95)
! * m68010:                                M680x0 Options.     (line  103)
! * m68020:                                M680x0 Options.     (line  109)
! * m68020-40:                             M680x0 Options.     (line  178)
! * m68020-60:                             M680x0 Options.     (line  187)
! * m68030:                                M680x0 Options.     (line  114)
! * m68040:                                M680x0 Options.     (line  119)
! * m68060:                                M680x0 Options.     (line  128)
! * m68881:                                M680x0 Options.     (line  197)
  * m8-bit:                                CRIS Options.       (line   64)
! * m8bit-idiv:                            x86 Options.        (line  940)
  * m8byte-align:                          V850 Options.       (line  170)
! * m96bit-long-double:                    x86 Options.        (line  396)
  * mA6:                                   ARC Options.        (line   19)
  * mA7:                                   ARC Options.        (line   26)
- * mabi <1>:                              x86 Options.        (line  795)
- * mabi <2>:                              RS/6000 and PowerPC Options.
-                                                              (line  638)
- * mabi <3>:                              ARM Options.        (line    9)
  * mabi:                                  AArch64 Options.    (line    9)
! * mabi=32:                               MIPS Options.       (line  157)
! * mabi=64:                               MIPS Options.       (line  157)
! * mabi=eabi:                             MIPS Options.       (line  157)
  * mabi=elfv1:                            RS/6000 and PowerPC Options.
!                                                              (line  659)
  * mabi=elfv2:                            RS/6000 and PowerPC Options.
!                                                              (line  665)
  * mabi=gnu:                              MMIX Options.       (line   20)
  * mabi=ibmlongdouble:                    RS/6000 and PowerPC Options.
-                                                              (line  651)
- * mabi=ieeelongdouble:                   RS/6000 and PowerPC Options.
                                                               (line  655)
  * mabi=mmixware:                         MMIX Options.       (line   20)
! * mabi=n32:                              MIPS Options.       (line  157)
  * mabi=no-spe:                           RS/6000 and PowerPC Options.
!                                                              (line  648)
! * mabi=o64:                              MIPS Options.       (line  157)
  * mabi=spe:                              RS/6000 and PowerPC Options.
!                                                              (line  643)
! * mabicalls:                             MIPS Options.       (line  194)
! * mabm:                                  x86 Options.        (line  611)
! * mabort-on-noreturn:                    ARM Options.        (line  191)
! * mabs=2008:                             MIPS Options.       (line  302)
! * mabs=legacy:                           MIPS Options.       (line  302)
  * mabsdiff:                              MeP Options.        (line    7)
  * mabshi:                                PDP-11 Options.     (line   55)
  * mac0:                                  PDP-11 Options.     (line   16)
! * macc-4:                                FRV Options.        (line  113)
! * macc-8:                                FRV Options.        (line  116)
! * maccumulate-args:                      AVR Options.        (line  147)
! * maccumulate-outgoing-args <1>:         x86 Options.        (line  818)
! * maccumulate-outgoing-args:             SH Options.         (line  400)
! * maddress-mode=long:                    x86 Options.        (line 1012)
! * maddress-mode=short:                   x86 Options.        (line 1017)
! * maddress-space-conversion:             SPU Options.        (line   63)
  * mads:                                  RS/6000 and PowerPC Options.
!                                                              (line  693)
! * maes:                                  x86 Options.        (line  597)
  * maix-struct-return:                    RS/6000 and PowerPC Options.
!                                                              (line  631)
  * maix32:                                RS/6000 and PowerPC Options.
!                                                              (line  341)
  * maix64:                                RS/6000 and PowerPC Options.
!                                                              (line  341)
  * malign-300:                            H8/300 Options.     (line   41)
! * malign-call:                           ARC Options.        (line  194)
! * malign-data:                           x86 Options.        (line  435)
! * malign-double:                         x86 Options.        (line  380)
! * malign-int:                            M680x0 Options.     (line  267)
! * malign-labels:                         FRV Options.        (line  104)
  * malign-loops:                          M32R/D Options.     (line   73)
  * malign-natural:                        RS/6000 and PowerPC Options.
!                                                              (line  380)
  * malign-power:                          RS/6000 and PowerPC Options.
!                                                              (line  380)
  * mall-opts:                             MeP Options.        (line   11)
! * malloc-cc:                             FRV Options.        (line   25)
  * maltivec:                              RS/6000 and PowerPC Options.
!                                                              (line  136)
  * maltivec=be:                           RS/6000 and PowerPC Options.
!                                                              (line  152)
  * maltivec=le:                           RS/6000 and PowerPC Options.
!                                                              (line  162)
  * mam33:                                 MN10300 Options.    (line   17)
  * mam33-2:                               MN10300 Options.    (line   24)
  * mam34:                                 MN10300 Options.    (line   27)
  * mandroid:                              GNU/Linux Options.  (line   21)
! * mannotate-align:                       ARC Options.        (line  135)
  * mapcs:                                 ARM Options.        (line   21)
  * mapcs-frame:                           ARM Options.        (line   13)
- * mapp-regs <1>:                         V850 Options.       (line  181)
  * mapp-regs:                             SPARC Options.      (line   10)
  * mARC600:                               ARC Options.        (line   19)
  * mARC601:                               ARC Options.        (line   23)
  * mARC700:                               ARC Options.        (line   26)
- * march <1>:                             x86 Options.        (line    9)
- * march <2>:                             S/390 and zSeries Options.
-                                                              (line  116)
- * march <3>:                             NDS32 Options.      (line   52)
- * march <4>:                             MIPS Options.       (line   14)
- * march <5>:                             M680x0 Options.     (line   12)
- * march <6>:                             HPPA Options.       (line    9)
- * march <7>:                             CRIS Options.       (line   10)
- * march <8>:                             C6X Options.        (line    7)
- * march <9>:                             ARM Options.        (line   65)
  * march:                                 AArch64 Options.    (line   79)
! * marclinux:                             ARC Options.        (line  142)
! * marclinux_prof:                        ARC Options.        (line  148)
! * margonaut:                             ARC Options.        (line  346)
! * marm:                                  ARM Options.        (line  261)
  * mas100-syntax:                         RX Options.         (line   76)
  * masm-hex:                              MSP430 Options.     (line    9)
  * masm-syntax-unified:                   ARM Options.        (line  350)
! * masm=DIALECT:                          x86 Options.        (line  334)
  * matomic-model=MODEL:                   SH Options.         (line  214)
! * matomic-updates:                       SPU Options.        (line   78)
! * mauto-modify-reg:                      ARC Options.        (line  197)
  * mauto-pic:                             IA-64 Options.      (line   50)
  * maverage:                              MeP Options.        (line   16)
  * mavoid-indexed-addresses:              RS/6000 and PowerPC Options.
!                                                              (line  450)
! * mavx:                                  x86 Options.        (line  590)
! * mavx256-split-unaligned-load:          x86 Options.        (line  948)
! * mavx256-split-unaligned-store:         x86 Options.        (line  948)
  * max-vect-align:                        Adapteva Epiphany Options.
!                                                              (line  120)
  * mb:                                    SH Options.         (line  147)
  * mbackchain:                            S/390 and zSeries Options.
                                                               (line   35)
  * mbarrel-shift-enabled:                 LM32 Options.       (line    9)
  * mbarrel-shifter:                       ARC Options.        (line   10)
! * mbarrel_shifter:                       ARC Options.        (line  363)
! * mbase-addresses:                       MMIX Options.       (line   54)
  * mbased=:                               MeP Options.        (line   20)
! * mbbit-peephole:                        ARC Options.        (line  200)
  * mbcopy:                                PDP-11 Options.     (line   36)
  * mbcopy-builtin:                        PDP-11 Options.     (line   32)
  * mbig:                                  RS/6000 and PowerPC Options.
!                                                              (line  530)
! * mbig-endian <1>:                       TILE-Gx Options.    (line   29)
! * mbig-endian <2>:                       RS/6000 and PowerPC Options.
!                                                              (line  530)
! * mbig-endian <3>:                       NDS32 Options.      (line    9)
! * mbig-endian <4>:                       MicroBlaze Options. (line   57)
! * mbig-endian <5>:                       MCore Options.      (line   39)
! * mbig-endian <6>:                       IA-64 Options.      (line    9)
! * mbig-endian <7>:                       C6X Options.        (line   13)
! * mbig-endian <8>:                       ARM Options.        (line   61)
! * mbig-endian <9>:                       ARC Options.        (line  349)
  * mbig-endian:                           AArch64 Options.    (line   20)
  * mbig-endian-data:                      RX Options.         (line   42)
  * mbig-switch:                           V850 Options.       (line  176)
  * mbigtable:                             SH Options.         (line  162)
  * mbionic:                               GNU/Linux Options.  (line   17)
  * mbit-align:                            RS/6000 and PowerPC Options.
!                                                              (line  482)
  * mbit-ops:                              CR16 Options.       (line   25)
! * mbitfield:                             M680x0 Options.     (line  235)
! * mbitops <1>:                           SH Options.         (line  166)
  * mbitops:                               MeP Options.        (line   26)
  * mblock-move-inline-limit:              RS/6000 and PowerPC Options.
!                                                              (line  764)
! * mbmi:                                  x86 Options.        (line  612)
  * mbranch-cheap:                         PDP-11 Options.     (line   65)
- * mbranch-cost <1>:                      MIPS Options.       (line  757)
- * mbranch-cost <2>:                      AVR Options.        (line  162)
  * mbranch-cost:                          Adapteva Epiphany Options.
                                                               (line   18)
! * mbranch-cost=NUM:                      SH Options.         (line  466)
  * mbranch-cost=NUMBER:                   M32R/D Options.     (line   82)
  * mbranch-expensive:                     PDP-11 Options.     (line   61)
! * mbranch-hints:                         SPU Options.        (line   27)
! * mbranch-likely:                        MIPS Options.       (line  764)
! * mbranch-predict:                       MMIX Options.       (line   49)
  * mbss-plt:                              RS/6000 and PowerPC Options.
!                                                              (line  189)
  * mbuild-constants:                      DEC Alpha Options.  (line  141)
  * mbwx:                                  DEC Alpha Options.  (line  163)
! * mbypass-cache:                         Nios II Options.    (line   72)
! * mc68000:                               M680x0 Options.     (line   95)
! * mc68020:                               M680x0 Options.     (line  109)
  * mc=:                                   MeP Options.        (line   31)
  * mcache-block-size:                     NDS32 Options.      (line   48)
! * mcache-size:                           SPU Options.        (line   70)
! * mcache-volatile:                       Nios II Options.    (line   78)
  * mcall-eabi:                            RS/6000 and PowerPC Options.
!                                                              (line  605)
  * mcall-freebsd:                         RS/6000 and PowerPC Options.
!                                                              (line  619)
  * mcall-linux:                           RS/6000 and PowerPC Options.
!                                                              (line  615)
  * mcall-netbsd:                          RS/6000 and PowerPC Options.
!                                                              (line  623)
! * mcall-prologues:                       AVR Options.        (line  167)
  * mcall-sysv:                            RS/6000 and PowerPC Options.
!                                                              (line  597)
  * mcall-sysv-eabi:                       RS/6000 and PowerPC Options.
!                                                              (line  605)
  * mcall-sysv-noeabi:                     RS/6000 and PowerPC Options.
!                                                              (line  608)
  * mcallee-super-interworking:            ARM Options.        (line  279)
  * mcaller-super-interworking:            ARM Options.        (line  286)
  * mcallgraph-data:                       MCore Options.      (line   31)
! * mcase-vector-pcrel:                    ARC Options.        (line  208)
! * mcbcond:                               SPARC Options.      (line  224)
! * mcbranch-force-delay-slot:             SH Options.         (line  481)
! * mcc-init:                              CRIS Options.       (line   41)
! * mcfv4e:                                M680x0 Options.     (line  172)
! * mcheck-zero-division:                  MIPS Options.       (line  551)
  * mcix:                                  DEC Alpha Options.  (line  163)
! * mcld:                                  x86 Options.        (line  668)
  * mclear-hwcap:                          Solaris 2 Options.  (line    9)
! * mclfushopt:                            x86 Options.        (line  599)
  * mclip:                                 MeP Options.        (line   35)
- * mcmodel <1>:                           SPARC Options.      (line  262)
  * mcmodel:                               NDS32 Options.      (line   55)
! * mcmodel=kernel:                        x86 Options.        (line  996)
! * mcmodel=large <1>:                     x86 Options.        (line 1008)
! * mcmodel=large <2>:                     TILE-Gx Options.    (line   14)
! * mcmodel=large <3>:                     RS/6000 and PowerPC Options.
!                                                              (line  130)
  * mcmodel=large:                         AArch64 Options.    (line   44)
! * mcmodel=medium <1>:                    x86 Options.        (line 1001)
  * mcmodel=medium:                        RS/6000 and PowerPC Options.
!                                                              (line  126)
! * mcmodel=small <1>:                     x86 Options.        (line  990)
! * mcmodel=small <2>:                     TILE-Gx Options.    (line    9)
! * mcmodel=small <3>:                     RS/6000 and PowerPC Options.
!                                                              (line  122)
  * mcmodel=small:                         AArch64 Options.    (line   38)
  * mcmodel=tiny:                          AArch64 Options.    (line   31)
  * mcmov:                                 NDS32 Options.      (line   21)
  * mcmove:                                Adapteva Epiphany Options.
                                                               (line   23)
  * mcmpb:                                 RS/6000 and PowerPC Options.
                                                               (line   27)
! * mcode-readable:                        MIPS Options.       (line  511)
! * mcompact-casesi:                       ARC Options.        (line  212)
  * mcompat-align-parm:                    RS/6000 and PowerPC Options.
!                                                              (line  944)
! * mcond-exec:                            FRV Options.        (line  152)
! * mcond-move:                            FRV Options.        (line  128)
  * mconfig=:                              MeP Options.        (line   39)
  * mconsole:                              x86 Windows Options.
                                                               (line    9)
--- 49163,49428 ----
  * m5-64media-nofpu:                      SH Options.         (line  136)
  * m5-compact:                            SH Options.         (line  140)
  * m5-compact-nofpu:                      SH Options.         (line  143)
! * m5200:                                 M680x0 Options.     (line  144)
! * m5206e:                                M680x0 Options.     (line  153)
! * m528x:                                 M680x0 Options.     (line  157)
! * m5307:                                 M680x0 Options.     (line  161)
! * m5407:                                 M680x0 Options.     (line  165)
  * m64:                                   Nvidia PTX Options. (line   10)
! * m64 <1>:                               RS/6000 and PowerPC Options.
!                                                              (line  308)
! * m64 <2>:                               S/390 and zSeries Options.
!                                                              (line   86)
! * m64 <3>:                               SPARC Options.      (line  256)
! * m64 <4>:                               TILE-Gx Options.    (line   23)
! * m64 <5>:                               x86 Options.        (line  955)
  * m64bit-doubles:                        RL78 Options.       (line   22)
! * m64bit-doubles <1>:                    RX Options.         (line   10)
! * m68000:                                M680x0 Options.     (line   93)
! * m68010:                                M680x0 Options.     (line  101)
! * m68020:                                M680x0 Options.     (line  107)
! * m68020-40:                             M680x0 Options.     (line  175)
! * m68020-60:                             M680x0 Options.     (line  184)
! * m68030:                                M680x0 Options.     (line  112)
! * m68040:                                M680x0 Options.     (line  117)
! * m68060:                                M680x0 Options.     (line  126)
! * m68881:                                M680x0 Options.     (line  194)
  * m8-bit:                                CRIS Options.       (line   64)
! * m8bit-idiv:                            x86 Options.        (line  932)
  * m8byte-align:                          V850 Options.       (line  170)
! * m96bit-long-double:                    x86 Options.        (line  389)
  * mA6:                                   ARC Options.        (line   19)
  * mA7:                                   ARC Options.        (line   26)
  * mabi:                                  AArch64 Options.    (line    9)
! * mabi <1>:                              ARM Options.        (line    9)
! * mabi <2>:                              RS/6000 and PowerPC Options.
!                                                              (line  642)
! * mabi <3>:                              x86 Options.        (line  788)
! * mabi=32:                               MIPS Options.       (line  154)
! * mabi=64:                               MIPS Options.       (line  154)
! * mabi=eabi:                             MIPS Options.       (line  154)
  * mabi=elfv1:                            RS/6000 and PowerPC Options.
!                                                              (line  663)
  * mabi=elfv2:                            RS/6000 and PowerPC Options.
!                                                              (line  669)
  * mabi=gnu:                              MMIX Options.       (line   20)
  * mabi=ibmlongdouble:                    RS/6000 and PowerPC Options.
                                                               (line  655)
+ * mabi=ieeelongdouble:                   RS/6000 and PowerPC Options.
+                                                              (line  659)
  * mabi=mmixware:                         MMIX Options.       (line   20)
! * mabi=n32:                              MIPS Options.       (line  154)
  * mabi=no-spe:                           RS/6000 and PowerPC Options.
!                                                              (line  652)
! * mabi=o64:                              MIPS Options.       (line  154)
  * mabi=spe:                              RS/6000 and PowerPC Options.
!                                                              (line  647)
! * mabicalls:                             MIPS Options.       (line  190)
! * mabm:                                  x86 Options.        (line  605)
! * mabort-on-noreturn:                    ARM Options.        (line  190)
! * mabs=2008:                             MIPS Options.       (line  298)
! * mabs=legacy:                           MIPS Options.       (line  298)
  * mabsdiff:                              MeP Options.        (line    7)
  * mabshi:                                PDP-11 Options.     (line   55)
  * mac0:                                  PDP-11 Options.     (line   16)
! * macc-4:                                FRV Options.        (line  139)
! * macc-8:                                FRV Options.        (line  143)
! * maccumulate-args:                      AVR Options.        (line  148)
! * maccumulate-outgoing-args:             SH Options.         (line  394)
! * maccumulate-outgoing-args <1>:         x86 Options.        (line  811)
! * maddress-mode=long:                    x86 Options.        (line 1002)
! * maddress-mode=short:                   x86 Options.        (line 1007)
! * maddress-space-conversion:             SPU Options.        (line   68)
  * mads:                                  RS/6000 and PowerPC Options.
!                                                              (line  697)
! * maes:                                  x86 Options.        (line  591)
  * maix-struct-return:                    RS/6000 and PowerPC Options.
!                                                              (line  635)
  * maix32:                                RS/6000 and PowerPC Options.
!                                                              (line  346)
  * maix64:                                RS/6000 and PowerPC Options.
!                                                              (line  346)
  * malign-300:                            H8/300 Options.     (line   41)
! * malign-call:                           ARC Options.        (line  191)
! * malign-data:                           x86 Options.        (line  429)
! * malign-double:                         x86 Options.        (line  374)
! * malign-int:                            M680x0 Options.     (line  263)
! * malign-labels:                         FRV Options.        (line  128)
  * malign-loops:                          M32R/D Options.     (line   73)
  * malign-natural:                        RS/6000 and PowerPC Options.
!                                                              (line  384)
  * malign-power:                          RS/6000 and PowerPC Options.
!                                                              (line  384)
  * mall-opts:                             MeP Options.        (line   11)
! * malloc-cc:                             FRV Options.        (line   31)
  * maltivec:                              RS/6000 and PowerPC Options.
!                                                              (line  135)
  * maltivec=be:                           RS/6000 and PowerPC Options.
!                                                              (line  151)
  * maltivec=le:                           RS/6000 and PowerPC Options.
!                                                              (line  161)
  * mam33:                                 MN10300 Options.    (line   17)
  * mam33-2:                               MN10300 Options.    (line   24)
  * mam34:                                 MN10300 Options.    (line   27)
  * mandroid:                              GNU/Linux Options.  (line   21)
! * mannotate-align:                       ARC Options.        (line  133)
  * mapcs:                                 ARM Options.        (line   21)
  * mapcs-frame:                           ARM Options.        (line   13)
  * mapp-regs:                             SPARC Options.      (line   10)
+ * mapp-regs <1>:                         V850 Options.       (line  181)
  * mARC600:                               ARC Options.        (line   19)
  * mARC601:                               ARC Options.        (line   23)
  * mARC700:                               ARC Options.        (line   26)
  * march:                                 AArch64 Options.    (line   79)
! * march <1>:                             ARM Options.        (line   65)
! * march <2>:                             C6X Options.        (line    7)
! * march <3>:                             CRIS Options.       (line   10)
! * march <4>:                             HPPA Options.       (line    9)
! * march <5>:                             HPPA Options.       (line  155)
! * march <6>:                             M680x0 Options.     (line   12)
! * march <7>:                             MIPS Options.       (line   14)
! * march <8>:                             NDS32 Options.      (line   52)
! * march <9>:                             S/390 and zSeries Options.
!                                                              (line  114)
! * march <10>:                            x86 Options.        (line    9)
! * marclinux:                             ARC Options.        (line  139)
! * marclinux_prof:                        ARC Options.        (line  146)
! * margonaut:                             ARC Options.        (line  340)
! * marm:                                  ARM Options.        (line  260)
  * mas100-syntax:                         RX Options.         (line   76)
  * masm-hex:                              MSP430 Options.     (line    9)
  * masm-syntax-unified:                   ARM Options.        (line  350)
! * masm=DIALECT:                          x86 Options.        (line  328)
  * matomic-model=MODEL:                   SH Options.         (line  214)
! * matomic-updates:                       SPU Options.        (line   83)
! * mauto-modify-reg:                      ARC Options.        (line  194)
  * mauto-pic:                             IA-64 Options.      (line   50)
  * maverage:                              MeP Options.        (line   16)
  * mavoid-indexed-addresses:              RS/6000 and PowerPC Options.
!                                                              (line  454)
! * mavx:                                  x86 Options.        (line  584)
! * mavx256-split-unaligned-load:          x86 Options.        (line  940)
! * mavx256-split-unaligned-store:         x86 Options.        (line  940)
  * max-vect-align:                        Adapteva Epiphany Options.
!                                                              (line  119)
  * mb:                                    SH Options.         (line  147)
  * mbackchain:                            S/390 and zSeries Options.
                                                               (line   35)
  * mbarrel-shift-enabled:                 LM32 Options.       (line    9)
  * mbarrel-shifter:                       ARC Options.        (line   10)
! * mbarrel_shifter:                       ARC Options.        (line  358)
! * mbase-addresses:                       MMIX Options.       (line   53)
  * mbased=:                               MeP Options.        (line   20)
! * mbbit-peephole:                        ARC Options.        (line  197)
  * mbcopy:                                PDP-11 Options.     (line   36)
  * mbcopy-builtin:                        PDP-11 Options.     (line   32)
  * mbig:                                  RS/6000 and PowerPC Options.
!                                                              (line  534)
  * mbig-endian:                           AArch64 Options.    (line   20)
+ * mbig-endian <1>:                       ARC Options.        (line  343)
+ * mbig-endian <2>:                       ARM Options.        (line   61)
+ * mbig-endian <3>:                       C6X Options.        (line   13)
+ * mbig-endian <4>:                       IA-64 Options.      (line    9)
+ * mbig-endian <5>:                       MCore Options.      (line   39)
+ * mbig-endian <6>:                       MicroBlaze Options. (line   57)
+ * mbig-endian <7>:                       NDS32 Options.      (line    9)
+ * mbig-endian <8>:                       RS/6000 and PowerPC Options.
+                                                              (line  534)
+ * mbig-endian <9>:                       TILE-Gx Options.    (line   29)
  * mbig-endian-data:                      RX Options.         (line   42)
  * mbig-switch:                           V850 Options.       (line  176)
  * mbigtable:                             SH Options.         (line  162)
  * mbionic:                               GNU/Linux Options.  (line   17)
  * mbit-align:                            RS/6000 and PowerPC Options.
!                                                              (line  486)
  * mbit-ops:                              CR16 Options.       (line   25)
! * mbitfield:                             M680x0 Options.     (line  231)
  * mbitops:                               MeP Options.        (line   26)
+ * mbitops <1>:                           SH Options.         (line  166)
  * mblock-move-inline-limit:              RS/6000 and PowerPC Options.
!                                                              (line  767)
! * mbmi:                                  x86 Options.        (line  606)
  * mbranch-cheap:                         PDP-11 Options.     (line   65)
  * mbranch-cost:                          Adapteva Epiphany Options.
                                                               (line   18)
! * mbranch-cost <1>:                      AVR Options.        (line  163)
! * mbranch-cost <2>:                      MIPS Options.       (line  744)
! * mbranch-cost=NUM:                      SH Options.         (line  458)
  * mbranch-cost=NUMBER:                   M32R/D Options.     (line   82)
  * mbranch-expensive:                     PDP-11 Options.     (line   61)
! * mbranch-hints:                         SPU Options.        (line   29)
! * mbranch-likely:                        MIPS Options.       (line  751)
! * mbranch-predict:                       MMIX Options.       (line   48)
  * mbss-plt:                              RS/6000 and PowerPC Options.
!                                                              (line  188)
  * mbuild-constants:                      DEC Alpha Options.  (line  141)
  * mbwx:                                  DEC Alpha Options.  (line  163)
! * mbypass-cache:                         Nios II Options.    (line   70)
! * mc68000:                               M680x0 Options.     (line   93)
! * mc68020:                               M680x0 Options.     (line  107)
  * mc=:                                   MeP Options.        (line   31)
  * mcache-block-size:                     NDS32 Options.      (line   48)
! * mcache-size:                           SPU Options.        (line   75)
! * mcache-volatile:                       Nios II Options.    (line   76)
  * mcall-eabi:                            RS/6000 and PowerPC Options.
!                                                              (line  609)
  * mcall-freebsd:                         RS/6000 and PowerPC Options.
!                                                              (line  623)
  * mcall-linux:                           RS/6000 and PowerPC Options.
!                                                              (line  619)
  * mcall-netbsd:                          RS/6000 and PowerPC Options.
!                                                              (line  627)
! * mcall-netbsd <1>:                      RS/6000 and PowerPC Options.
!                                                              (line  631)
! * mcall-prologues:                       AVR Options.        (line  168)
  * mcall-sysv:                            RS/6000 and PowerPC Options.
!                                                              (line  601)
  * mcall-sysv-eabi:                       RS/6000 and PowerPC Options.
!                                                              (line  609)
  * mcall-sysv-noeabi:                     RS/6000 and PowerPC Options.
!                                                              (line  612)
  * mcallee-super-interworking:            ARM Options.        (line  279)
  * mcaller-super-interworking:            ARM Options.        (line  286)
  * mcallgraph-data:                       MCore Options.      (line   31)
! * mcase-vector-pcrel:                    ARC Options.        (line  205)
! * mcbcond:                               SPARC Options.      (line  223)
! * mcbranch-force-delay-slot:             SH Options.         (line  473)
! * mcc-init:                              CRIS Options.       (line   42)
! * mcfv4e:                                M680x0 Options.     (line  169)
! * mcheck-zero-division:                  MIPS Options.       (line  546)
  * mcix:                                  DEC Alpha Options.  (line  163)
! * mcld:                                  x86 Options.        (line  661)
  * mclear-hwcap:                          Solaris 2 Options.  (line    9)
! * mclfushopt:                            x86 Options.        (line  593)
  * mclip:                                 MeP Options.        (line   35)
  * mcmodel:                               NDS32 Options.      (line   55)
! * mcmodel <1>:                           SPARC Options.      (line  261)
! * mcmodel=kernel:                        x86 Options.        (line  986)
  * mcmodel=large:                         AArch64 Options.    (line   44)
! * mcmodel=large <1>:                     RS/6000 and PowerPC Options.
!                                                              (line  129)
! * mcmodel=large <2>:                     TILE-Gx Options.    (line   14)
! * mcmodel=large <3>:                     x86 Options.        (line  998)
  * mcmodel=medium:                        RS/6000 and PowerPC Options.
!                                                              (line  125)
! * mcmodel=medium <1>:                    x86 Options.        (line  991)
  * mcmodel=small:                         AArch64 Options.    (line   38)
+ * mcmodel=small <1>:                     RS/6000 and PowerPC Options.
+                                                              (line  121)
+ * mcmodel=small <2>:                     TILE-Gx Options.    (line    9)
+ * mcmodel=small <3>:                     x86 Options.        (line  980)
  * mcmodel=tiny:                          AArch64 Options.    (line   31)
  * mcmov:                                 NDS32 Options.      (line   21)
  * mcmove:                                Adapteva Epiphany Options.
                                                               (line   23)
  * mcmpb:                                 RS/6000 and PowerPC Options.
                                                               (line   27)
! * mcode-readable:                        MIPS Options.       (line  506)
! * mcompact-casesi:                       ARC Options.        (line  209)
  * mcompat-align-parm:                    RS/6000 and PowerPC Options.
!                                                              (line  945)
! * mcond-exec:                            FRV Options.        (line  187)
! * mcond-move:                            FRV Options.        (line  159)
  * mconfig=:                              MeP Options.        (line   39)
  * mconsole:                              x86 Windows Options.
                                                               (line    9)
*************** look up both forms.
*** 49780,50453 ****
  * mcop:                                  MeP Options.        (line   48)
  * mcop32:                                MeP Options.        (line   53)
  * mcop64:                                MeP Options.        (line   56)
! * mcorea:                                Blackfin Options.   (line  157)
! * mcoreb:                                Blackfin Options.   (line  164)
! * mcpu <1>:                              x86 Options.        (line  282)
! * mcpu <2>:                              Visium Options.     (line   33)
! * mcpu <3>:                              TILEPro Options.    (line    9)
! * mcpu <4>:                              TILE-Gx Options.    (line   18)
! * mcpu <5>:                              SPARC Options.      (line  102)
! * mcpu <6>:                              RX Options.         (line   30)
! * mcpu <7>:                              RS/6000 and PowerPC Options.
!                                                              (line   69)
! * mcpu <8>:                              picoChip Options.   (line    9)
! * mcpu <9>:                              M680x0 Options.     (line   28)
! * mcpu <10>:                             FRV Options.        (line  212)
! * mcpu <11>:                             DEC Alpha Options.  (line  215)
! * mcpu <12>:                             CRIS Options.       (line   10)
! * mcpu <13>:                             ARM Options.        (line  130)
! * mcpu <14>:                             ARC Options.        (line   14)
  * mcpu:                                  AArch64 Options.    (line  112)
! * mcpu32:                                M680x0 Options.     (line  138)
! * mcpu= <1>:                             MSP430 Options.     (line   34)
! * mcpu= <2>:                             MicroBlaze Options. (line   20)
! * mcpu= <3>:                             M32C Options.       (line    7)
  * mcpu=:                                 Blackfin Options.   (line    7)
  * mcr16c:                                CR16 Options.       (line   14)
  * mcr16cplus:                            CR16 Options.       (line   14)
! * mcrc32:                                x86 Options.        (line  715)
  * mcrypto:                               RS/6000 and PowerPC Options.
!                                                              (line  224)
! * mcsync-anomaly:                        Blackfin Options.   (line   60)
! * mctor-dtor:                            NDS32 Options.      (line   71)
! * mcustom-fpu-cfg:                       Nios II Options.    (line  220)
! * mcustom-INSN:                          Nios II Options.    (line   99)
! * mcx16:                                 x86 Options.        (line  692)
  * MD:                                    Preprocessor Options.
!                                                              (line  274)
  * mdalign:                               SH Options.         (line  153)
  * mdata-align:                           CRIS Options.       (line   55)
  * mdata-model:                           CR16 Options.       (line   28)
  * mdc:                                   MeP Options.        (line   62)
- * mdebug <1>:                            Visium Options.     (line    7)
- * mdebug <2>:                            S/390 and zSeries Options.
-                                                              (line  112)
  * mdebug:                                M32R/D Options.     (line   69)
  * mdebug-main=PREFIX:                    VMS Options.        (line   13)
  * mdec-asm:                              PDP-11 Options.     (line   72)
  * mdirect-move:                          RS/6000 and PowerPC Options.
!                                                              (line  230)
  * mdisable-callt:                        V850 Options.       (line   92)
  * mdisable-fpregs:                       HPPA Options.       (line   27)
  * mdisable-indexing:                     HPPA Options.       (line   33)
! * mdiv <1>:                              MeP Options.        (line   65)
! * mdiv <2>:                              MCore Options.      (line   15)
! * mdiv:                                  M680x0 Options.     (line  209)
! * mdiv=STRATEGY:                         SH Options.         (line  308)
! * mdivide-breaks:                        MIPS Options.       (line  557)
  * mdivide-enabled:                       LM32 Options.       (line   12)
! * mdivide-traps:                         MIPS Options.       (line  557)
! * mdivsi3_libfunc=NAME:                  SH Options.         (line  406)
  * mdll:                                  x86 Windows Options.
                                                               (line   16)
  * mdlmzb:                                RS/6000 and PowerPC Options.
!                                                              (line  475)
! * mdmx:                                  MIPS Options.       (line  378)
! * mdouble:                               FRV Options.        (line   38)
  * mdouble-float <1>:                     RS/6000 and PowerPC Options.
!                                                              (line  398)
! * mdouble-float:                         MIPS Options.       (line  290)
  * mdpfp:                                 ARC Options.        (line   30)
  * mdpfp-compact:                         ARC Options.        (line   31)
  * mdpfp-fast:                            ARC Options.        (line   35)
! * mdpfp_compact:                         ARC Options.        (line  366)
! * mdpfp_fast:                            ARC Options.        (line  369)
! * mdsp:                                  MIPS Options.       (line  355)
! * mdsp-packa:                            ARC Options.        (line   89)
! * mdsp_packa:                            ARC Options.        (line  372)
! * mdspr2:                                MIPS Options.       (line  361)
! * mdual-nops:                            SPU Options.        (line   90)
! * mdump-tune-features:                   x86 Options.        (line  649)
! * mdvbf:                                 ARC Options.        (line   93)
  * mdwarf2-asm:                           IA-64 Options.      (line   94)
! * mdword:                                FRV Options.        (line   32)
  * mdynamic-no-pic:                       RS/6000 and PowerPC Options.
!                                                              (line  535)
! * mEA:                                   ARC Options.        (line  375)
  * mea:                                   ARC Options.        (line   43)
! * mea32:                                 SPU Options.        (line   55)
! * mea64:                                 SPU Options.        (line   55)
  * meabi:                                 RS/6000 and PowerPC Options.
!                                                              (line  712)
! * mearly-cbranchsi:                      ARC Options.        (line  231)
  * mearly-stop-bits:                      IA-64 Options.      (line  100)
- * meb <1>:                               Score Options.      (line    9)
- * meb <2>:                               Nios II Options.    (line   67)
- * meb <3>:                               Moxie Options.      (line    7)
  * meb:                                   MeP Options.        (line   68)
! * mel <1>:                               Score Options.      (line   12)
! * mel <2>:                               Nios II Options.    (line   67)
! * mel <3>:                               Moxie Options.      (line   11)
  * mel:                                   MeP Options.        (line   71)
! * melf <1>:                              MMIX Options.       (line   44)
  * melf:                                  CRIS Options.       (line   87)
  * memb:                                  RS/6000 and PowerPC Options.
!                                                              (line  707)
! * membedded-data:                        MIPS Options.       (line  498)
  * memregs=:                              M32C Options.       (line   21)
  * mep:                                   V850 Options.       (line   16)
! * mepilogue-cfi:                         ARC Options.        (line  157)
  * mepsilon:                              MMIX Options.       (line   15)
  * merror-reloc:                          SPU Options.        (line   10)
  * mesa:                                  S/390 and zSeries Options.
!                                                              (line   95)
! * metrax100:                             CRIS Options.       (line   26)
! * metrax4:                               CRIS Options.       (line   26)
! * meva:                                  MIPS Options.       (line  405)
! * mexpand-adddi:                         ARC Options.        (line  234)
! * mexplicit-relocs <1>:                  MIPS Options.       (line  542)
  * mexplicit-relocs:                      DEC Alpha Options.  (line  176)
  * mexr:                                  H8/300 Options.     (line   28)
! * mextern-sdata:                         MIPS Options.       (line  460)
  * MF:                                    Preprocessor Options.
                                                               (line  220)
! * mf16c:                                 x86 Options.        (line  602)
! * mfast-fp:                              Blackfin Options.   (line  133)
  * mfast-indirect-calls:                  HPPA Options.       (line   45)
! * mfast-sw-div:                          Nios II Options.    (line   84)
! * mfaster-structs:                       SPARC Options.      (line   92)
! * mfdpic:                                FRV Options.        (line   56)
! * mfentry:                               x86 Options.        (line  907)
  * mfix:                                  DEC Alpha Options.  (line  163)
! * mfix-24k:                              MIPS Options.       (line  617)
  * mfix-and-continue:                     Darwin Options.     (line  104)
! * mfix-at697f:                           SPARC Options.      (line  244)
  * mfix-cortex-a53-835769:                AArch64 Options.    (line   67)
  * mfix-cortex-a53-843419:                AArch64 Options.    (line   74)
  * mfix-cortex-m3-ldrd:                   ARM Options.        (line  319)
! * mfix-r10000:                           MIPS Options.       (line  644)
! * mfix-r4000:                            MIPS Options.       (line  623)
! * mfix-r4400:                            MIPS Options.       (line  637)
! * mfix-rm7000:                           MIPS Options.       (line  655)
! * mfix-sb1:                              MIPS Options.       (line  681)
! * mfix-ut699:                            SPARC Options.      (line  249)
! * mfix-vr4120:                           MIPS Options.       (line  660)
! * mfix-vr4130:                           MIPS Options.       (line  674)
! * mfixed-cc:                             FRV Options.        (line   28)
! * mfixed-range <1>:                      SPU Options.        (line   47)
! * mfixed-range <2>:                      SH Options.         (line  413)
! * mfixed-range <3>:                      IA-64 Options.      (line  105)
  * mfixed-range:                          HPPA Options.       (line   52)
  * mflat:                                 SPARC Options.      (line   22)
! * mflip-mips16:                          MIPS Options.       (line  128)
  * mfloat-abi:                            ARM Options.        (line   41)
  * mfloat-gprs:                           RS/6000 and PowerPC Options.
!                                                              (line  286)
  * mfloat-ieee:                           DEC Alpha Options.  (line  171)
  * mfloat-vax:                            DEC Alpha Options.  (line  171)
  * mfloat32:                              PDP-11 Options.     (line   52)
  * mfloat64:                              PDP-11 Options.     (line   48)
! * mflush-func:                           MIPS Options.       (line  748)
  * mflush-func=NAME:                      M32R/D Options.     (line   93)
  * mflush-trap=NUMBER:                    M32R/D Options.     (line   86)
! * mfma:                                  x86 Options.        (line  603)
! * mfmaf:                                 SPARC Options.      (line  238)
  * mfmovd:                                SH Options.         (line  169)
  * mforce-no-pic:                         Xtensa Options.     (line   41)
! * mfp-exceptions:                        MIPS Options.       (line  775)
  * mfp-mode:                              Adapteva Epiphany Options.
!                                                              (line   72)
  * mfp-reg:                               DEC Alpha Options.  (line   25)
  * mfp-rounding-mode:                     DEC Alpha Options.  (line   85)
  * mfp-trap-mode:                         DEC Alpha Options.  (line   63)
! * mfp16-format:                          ARM Options.        (line  171)
! * mfp32:                                 MIPS Options.       (line  260)
! * mfp64:                                 MIPS Options.       (line  263)
! * mfpmath <1>:                           x86 Options.        (line  285)
! * mfpmath:                               Optimize Options.   (line 2068)
! * mfpr-32:                               FRV Options.        (line   13)
! * mfpr-64:                               FRV Options.        (line   16)
  * mfprnd:                                RS/6000 and PowerPC Options.
                                                               (line   27)
- * mfpu <1>:                              Visium Options.     (line   19)
- * mfpu <2>:                              SPARC Options.      (line   35)
- * mfpu <3>:                              RS/6000 and PowerPC Options.
-                                                              (line  406)
- * mfpu <4>:                              PDP-11 Options.     (line    9)
  * mfpu:                                  ARM Options.        (line  150)
! * mfpxx:                                 MIPS Options.       (line  266)
  * mfriz:                                 RS/6000 and PowerPC Options.
!                                                              (line  915)
! * mfsca:                                 SH Options.         (line  497)
! * mfsgsbase:                             x86 Options.        (line  600)
! * mfsrra:                                SH Options.         (line  506)
  * mfull-regs:                            NDS32 Options.      (line   18)
  * mfull-toc:                             RS/6000 and PowerPC Options.
!                                                              (line  314)
! * mfused-madd <1>:                       Xtensa Options.     (line   19)
! * mfused-madd <2>:                       SH Options.         (line  488)
! * mfused-madd <3>:                       S/390 and zSeries Options.
!                                                              (line  137)
! * mfused-madd <4>:                       RS/6000 and PowerPC Options.
!                                                              (line  459)
! * mfused-madd <5>:                       MIPS Options.       (line  599)
  * mfused-madd:                           IA-64 Options.      (line   88)
! * mfxsr:                                 x86 Options.        (line  615)
! * mg:                                    VAX Options.        (line   17)
  * MG:                                    Preprocessor Options.
                                                               (line  229)
  * mgas:                                  HPPA Options.       (line   68)
  * mgcc-abi:                              V850 Options.       (line  148)
  * mgen-cell-microcode:                   RS/6000 and PowerPC Options.
!                                                              (line  177)
  * mgeneral-regs-only:                    AArch64 Options.    (line   24)
! * mgettrcost=NUMBER:                     SH Options.         (line  430)
  * mghs:                                  V850 Options.       (line  127)
  * mglibc:                                GNU/Linux Options.  (line    9)
  * mgnu:                                  VAX Options.        (line   13)
  * mgnu-as:                               IA-64 Options.      (line   18)
- * mgnu-ld <1>:                           IA-64 Options.      (line   23)
  * mgnu-ld:                               HPPA Options.       (line  104)
  * mgotplt:                               CRIS Options.       (line   81)
! * mgp32:                                 MIPS Options.       (line  254)
! * mgp64:                                 MIPS Options.       (line  257)
! * mgpopt <1>:                            Nios II Options.    (line   17)
! * mgpopt:                                MIPS Options.       (line  483)
  * mgpr-32:                               FRV Options.        (line    7)
! * mgpr-64:                               FRV Options.        (line   10)
! * mgprel-ro:                             FRV Options.        (line   79)
  * mh:                                    H8/300 Options.     (line   14)
! * mhal:                                  Nios II Options.    (line  266)
  * mhalf-reg-file:                        Adapteva Epiphany Options.
                                                               (line    9)
- * mhard-dfp <1>:                         S/390 and zSeries Options.
-                                                              (line   20)
  * mhard-dfp:                             RS/6000 and PowerPC Options.
                                                               (line   27)
! * mhard-float <1>:                       Visium Options.     (line   19)
! * mhard-float <2>:                       V850 Options.       (line  113)
! * mhard-float <3>:                       SPARC Options.      (line   35)
! * mhard-float <4>:                       S/390 and zSeries Options.
                                                               (line   11)
! * mhard-float <5>:                       RS/6000 and PowerPC Options.
!                                                              (line  392)
! * mhard-float <6>:                       MIPS Options.       (line  269)
! * mhard-float <7>:                       MicroBlaze Options. (line   10)
! * mhard-float <8>:                       M680x0 Options.     (line  197)
! * mhard-float:                           FRV Options.        (line   19)
! * mhard-quad-float:                      SPARC Options.      (line   56)
  * mhardlit:                              MCore Options.      (line   10)
! * mhint-max-distance:                    SPU Options.        (line  102)
! * mhint-max-nops:                        SPU Options.        (line   96)
  * mhotpatch:                             S/390 and zSeries Options.
!                                                              (line  173)
  * mhp-ld:                                HPPA Options.       (line  116)
! * mhw-div:                               Nios II Options.    (line   93)
! * mhw-mul:                               Nios II Options.    (line   93)
! * mhw-mulx:                              Nios II Options.    (line   93)
  * mhwmult=:                              MSP430 Options.     (line   55)
! * micplb:                                Blackfin Options.   (line  178)
! * mid-shared-library:                    Blackfin Options.   (line   81)
! * mieee <1>:                             SH Options.         (line  186)
  * mieee:                                 DEC Alpha Options.  (line   39)
  * mieee-conformant:                      DEC Alpha Options.  (line  134)
! * mieee-fp:                              x86 Options.        (line  342)
  * mieee-with-inexact:                    DEC Alpha Options.  (line   52)
  * milp32:                                IA-64 Options.      (line  121)
! * mimadd:                                MIPS Options.       (line  592)
! * mimpure-text:                          Solaris 2 Options.  (line   16)
! * mincoming-stack-boundary:              x86 Options.        (line  556)
! * mindexed-addressing:                   SH Options.         (line  420)
! * mindexed-loads:                        ARC Options.        (line  238)
! * minline-all-stringops:                 x86 Options.        (line  839)
  * minline-float-divide-max-throughput:   IA-64 Options.      (line   58)
  * minline-float-divide-min-latency:      IA-64 Options.      (line   54)
  * minline-ic_invalidate:                 SH Options.         (line  195)
  * minline-int-divide-max-throughput:     IA-64 Options.      (line   69)
  * minline-int-divide-min-latency:        IA-64 Options.      (line   65)
! * minline-plt <1>:                       FRV Options.        (line   64)
! * minline-plt:                           Blackfin Options.   (line  138)
  * minline-sqrt-max-throughput:           IA-64 Options.      (line   80)
  * minline-sqrt-min-latency:              IA-64 Options.      (line   76)
! * minline-stringops-dynamically:         x86 Options.        (line  846)
! * minrt:                                 MSP430 Options.     (line   77)
  * minsert-sched-nops:                    RS/6000 and PowerPC Options.
!                                                              (line  575)
  * mint-register:                         RX Options.         (line  100)
  * mint16:                                PDP-11 Options.     (line   40)
- * mint32 <1>:                            PDP-11 Options.     (line   44)
- * mint32 <2>:                            H8/300 Options.     (line   38)
  * mint32:                                CR16 Options.       (line   22)
! * mint8:                                 AVR Options.        (line  171)
! * minterlink-compressed:                 MIPS Options.       (line  136)
! * minterlink-mips16:                     MIPS Options.       (line  148)
! * minvalid-symbols:                      SH Options.         (line  456)
  * mio-volatile:                          MeP Options.        (line   74)
! * mips1:                                 MIPS Options.       (line   80)
! * mips16:                                MIPS Options.       (line  120)
! * mips2:                                 MIPS Options.       (line   83)
! * mips3:                                 MIPS Options.       (line   86)
! * mips32:                                MIPS Options.       (line   92)
! * mips32r3:                              MIPS Options.       (line   95)
! * mips32r5:                              MIPS Options.       (line   98)
! * mips32r6:                              MIPS Options.       (line  101)
! * mips3d:                                MIPS Options.       (line  384)
! * mips4:                                 MIPS Options.       (line   89)
! * mips64:                                MIPS Options.       (line  104)
! * mips64r2:                              MIPS Options.       (line  107)
! * mips64r3:                              MIPS Options.       (line  110)
! * mips64r5:                              MIPS Options.       (line  113)
! * mips64r6:                              MIPS Options.       (line  116)
  * misel:                                 RS/6000 and PowerPC Options.
!                                                              (line  195)
  * misize <1>:                            SH Options.         (line  207)
- * misize:                                ARC Options.        (line  132)
  * misr-vector-size:                      NDS32 Options.      (line   45)
  * missue-rate=NUMBER:                    M32R/D Options.     (line   79)
  * mivc2:                                 MeP Options.        (line   59)
  * mjump-in-delay:                        HPPA Options.       (line   23)
  * mkernel:                               Darwin Options.     (line   82)
! * mknuthdiv:                             MMIX Options.       (line   33)
! * ml <1>:                                SH Options.         (line  150)
  * ml:                                    MeP Options.        (line   78)
  * mlarge:                                MSP430 Options.     (line   44)
  * mlarge-data:                           DEC Alpha Options.  (line  187)
! * mlarge-data-threshold:                 x86 Options.        (line  442)
! * mlarge-mem:                            SPU Options.        (line   35)
  * mlarge-text:                           DEC Alpha Options.  (line  205)
  * mleadz:                                MeP Options.        (line   81)
! * mleaf-id-shared-library:               Blackfin Options.   (line   92)
  * mlibfuncs:                             MMIX Options.       (line   10)
! * mlibrary-pic:                          FRV Options.        (line  110)
! * mlinked-fp:                            FRV Options.        (line   94)
  * mlinker-opt:                           HPPA Options.       (line   78)
  * mlinux:                                CRIS Options.       (line   91)
  * mlittle:                               RS/6000 and PowerPC Options.
!                                                              (line  524)
! * mlittle-endian <1>:                    TILE-Gx Options.    (line   29)
! * mlittle-endian <2>:                    RS/6000 and PowerPC Options.
!                                                              (line  524)
! * mlittle-endian <3>:                    NDS32 Options.      (line   12)
! * mlittle-endian <4>:                    MicroBlaze Options. (line   60)
! * mlittle-endian <5>:                    MCore Options.      (line   39)
! * mlittle-endian <6>:                    IA-64 Options.      (line   13)
! * mlittle-endian <7>:                    C6X Options.        (line   16)
! * mlittle-endian <8>:                    ARM Options.        (line   57)
! * mlittle-endian <9>:                    ARC Options.        (line  356)
  * mlittle-endian:                        AArch64 Options.    (line   27)
  * mlittle-endian-data:                   RX Options.         (line   42)
  * mliw:                                  MN10300 Options.    (line   54)
! * mllsc:                                 MIPS Options.       (line  341)
! * mlocal-sdata:                          MIPS Options.       (line  448)
! * mlock:                                 ARC Options.        (line   97)
! * mlong-calls <1>:                       V850 Options.       (line   10)
! * mlong-calls <2>:                       MIPS Options.       (line  578)
! * mlong-calls <3>:                       FRV Options.        (line   99)
! * mlong-calls <4>:                       Blackfin Options.   (line  121)
! * mlong-calls <5>:                       ARM Options.        (line  196)
! * mlong-calls <6>:                       ARC Options.        (line  163)
  * mlong-calls:                           Adapteva Epiphany Options.
                                                               (line   55)
! * mlong-double-128 <1>:                  x86 Options.        (line  422)
  * mlong-double-128:                      S/390 and zSeries Options.
                                                               (line   29)
! * mlong-double-64 <1>:                   x86 Options.        (line  422)
  * mlong-double-64:                       S/390 and zSeries Options.
                                                               (line   29)
! * mlong-double-80:                       x86 Options.        (line  422)
  * mlong-jumps:                           V850 Options.       (line  108)
  * mlong-load-store:                      HPPA Options.       (line   59)
! * mlong32:                               MIPS Options.       (line  423)
! * mlong64:                               MIPS Options.       (line  418)
  * mlongcall:                             RS/6000 and PowerPC Options.
!                                                              (line  784)
  * mlongcalls:                            Xtensa Options.     (line   72)
  * mloop:                                 V850 Options.       (line  121)
! * mlow-64k:                              Blackfin Options.   (line   70)
  * mlp64:                                 IA-64 Options.      (line  121)
! * mlra:                                  ARC Options.        (line  243)
! * mlra-priority-compact:                 ARC Options.        (line  251)
! * mlra-priority-noncompact:              ARC Options.        (line  254)
! * mlra-priority-none:                    ARC Options.        (line  248)
! * mlwp:                                  x86 Options.        (line  608)
! * mlzcnt:                                x86 Options.        (line  614)
! * mm:                                    MeP Options.        (line   84)
  * MM:                                    Preprocessor Options.
                                                               (line  210)
! * mmac <1>:                              Score Options.      (line   21)
  * mmac:                                  CR16 Options.       (line    9)
! * mmac-24:                               ARC Options.        (line  106)
! * mmac-d16:                              ARC Options.        (line  102)
! * mmac_24:                               ARC Options.        (line  378)
! * mmac_d16:                              ARC Options.        (line  381)
! * mmad:                                  MIPS Options.       (line  587)
  * mmainkernel:                           Nvidia PTX Options. (line   13)
  * mmalloc64:                             VMS Options.        (line   17)
  * mmax:                                  DEC Alpha Options.  (line  163)
  * mmax-constant-size:                    RX Options.         (line   82)
! * mmax-stack-frame:                      CRIS Options.       (line   22)
! * mmcount-ra-address:                    MIPS Options.       (line  823)
! * mmcu <1>:                              MIPS Options.       (line  401)
  * mmcu:                                  AVR Options.        (line    9)
  * mmcu=:                                 MSP430 Options.     (line   14)
  * MMD:                                   Preprocessor Options.
!                                                              (line  290)
! * mmedia:                                FRV Options.        (line   44)
! * mmedium-calls:                         ARC Options.        (line  167)
! * mmemcpy <1>:                           MIPS Options.       (line  572)
  * mmemcpy:                               MicroBlaze Options. (line   13)
! * mmemcpy-strategy=STRATEGY:             x86 Options.        (line  868)
  * mmemory-latency:                       DEC Alpha Options.  (line  268)
! * mmemory-model:                         SPARC Options.      (line  290)
! * mmemset-strategy=STRATEGY:             x86 Options.        (line  880)
  * mmfcrf:                                RS/6000 and PowerPC Options.
                                                               (line   27)
  * mmfpgpr:                               RS/6000 and PowerPC Options.
                                                               (line   27)
! * mmicromips:                            MIPS Options.       (line  389)
  * mminimal-toc:                          RS/6000 and PowerPC Options.
!                                                              (line  314)
  * mminmax:                               MeP Options.        (line   87)
! * mmixed-code:                           ARC Options.        (line  266)
! * mmmx:                                  x86 Options.        (line  581)
  * mmodel=large:                          M32R/D Options.     (line   33)
  * mmodel=medium:                         M32R/D Options.     (line   27)
  * mmodel=small:                          M32R/D Options.     (line   18)
! * mmovbe:                                x86 Options.        (line  711)
! * mmpx:                                  x86 Options.        (line  622)
! * mmt:                                   MIPS Options.       (line  397)
  * mmul:                                  RL78 Options.       (line   13)
! * mmul-bug-workaround:                   CRIS Options.       (line   31)
  * mmul.x:                                Moxie Options.      (line   14)
  * mmul32x16:                             ARC Options.        (line   51)
  * mmul64:                                ARC Options.        (line   54)
! * mmuladd:                               FRV Options.        (line   50)
  * mmulhw:                                RS/6000 and PowerPC Options.
!                                                              (line  468)
  * mmult:                                 MeP Options.        (line   90)
  * mmult-bug:                             MN10300 Options.    (line    9)
! * mmultcost:                             ARC Options.        (line  330)
! * mmulti-cond-exec:                      FRV Options.        (line  176)
! * mmulticore:                            Blackfin Options.   (line  142)
  * mmultiple:                             RS/6000 and PowerPC Options.
!                                                              (line  418)
  * mmvcle:                                S/390 and zSeries Options.
!                                                              (line  105)
  * mmvme:                                 RS/6000 and PowerPC Options.
!                                                              (line  688)
! * mmwaitx:                               x86 Options.        (line  623)
  * mn:                                    H8/300 Options.     (line   20)
! * mn-flash:                              AVR Options.        (line  177)
! * mnan=2008:                             MIPS Options.       (line  322)
! * mnan=legacy:                           MIPS Options.       (line  322)
  * mneon-for-64bits:                      ARM Options.        (line  339)
! * mnested-cond-exec:                     FRV Options.        (line  189)
  * mnhwloop:                              Score Options.      (line   15)
  * mno-16-bit:                            NDS32 Options.      (line   42)
  * mno-4byte-functions:                   MCore Options.      (line   27)
  * mno-8byte-align:                       V850 Options.       (line  170)
! * mno-abicalls:                          MIPS Options.       (line  194)
  * mno-abshi:                             PDP-11 Options.     (line   58)
  * mno-ac0:                               PDP-11 Options.     (line   20)
! * mno-address-space-conversion:          SPU Options.        (line   63)
! * mno-align-double:                      x86 Options.        (line  380)
! * mno-align-int:                         M680x0 Options.     (line  267)
  * mno-align-loops:                       M32R/D Options.     (line   76)
! * mno-align-stringops:                   x86 Options.        (line  834)
  * mno-altivec:                           RS/6000 and PowerPC Options.
!                                                              (line  136)
  * mno-am33:                              MN10300 Options.    (line   20)
- * mno-app-regs <1>:                      V850 Options.       (line  185)
  * mno-app-regs:                          SPARC Options.      (line   10)
  * mno-as100-syntax:                      RX Options.         (line   76)
! * mno-atomic-updates:                    SPU Options.        (line   78)
  * mno-avoid-indexed-addresses:           RS/6000 and PowerPC Options.
!                                                              (line  450)
  * mno-backchain:                         S/390 and zSeries Options.
                                                               (line   35)
! * mno-base-addresses:                    MMIX Options.       (line   54)
  * mno-bit-align:                         RS/6000 and PowerPC Options.
!                                                              (line  482)
! * mno-bitfield:                          M680x0 Options.     (line  231)
! * mno-branch-likely:                     MIPS Options.       (line  764)
! * mno-branch-predict:                    MMIX Options.       (line   49)
! * mno-brcc:                              ARC Options.        (line  203)
  * mno-bwx:                               DEC Alpha Options.  (line  163)
! * mno-bypass-cache:                      Nios II Options.    (line   72)
! * mno-cache-volatile:                    Nios II Options.    (line   78)
  * mno-callgraph-data:                    MCore Options.      (line   31)
! * mno-cbcond:                            SPARC Options.      (line  224)
! * mno-check-zero-division:               MIPS Options.       (line  551)
  * mno-cix:                               DEC Alpha Options.  (line  163)
  * mno-clearbss:                          MicroBlaze Options. (line   16)
  * mno-cmov:                              NDS32 Options.      (line   24)
  * mno-cmpb:                              RS/6000 and PowerPC Options.
                                                               (line   27)
! * mno-cond-exec <1>:                     FRV Options.        (line  158)
! * mno-cond-exec:                         ARC Options.        (line  215)
! * mno-cond-move:                         FRV Options.        (line  134)
  * mno-const-align:                       CRIS Options.       (line   55)
  * mno-const16:                           Xtensa Options.     (line   10)
- * mno-crt0 <1>:                          Moxie Options.      (line   18)
  * mno-crt0:                              MN10300 Options.    (line   43)
  * mno-crypto:                            RS/6000 and PowerPC Options.
!                                                              (line  224)
! * mno-csync-anomaly:                     Blackfin Options.   (line   66)
! * mno-custom-INSN:                       Nios II Options.    (line   99)
  * mno-data-align:                        CRIS Options.       (line   55)
  * mno-debug:                             S/390 and zSeries Options.
!                                                              (line  112)
! * mno-default:                           x86 Options.        (line  664)
  * mno-direct-move:                       RS/6000 and PowerPC Options.
!                                                              (line  230)
  * mno-disable-callt:                     V850 Options.       (line   92)
  * mno-div <1>:                           MCore Options.      (line   15)
- * mno-div:                               M680x0 Options.     (line  209)
  * mno-dlmzb:                             RS/6000 and PowerPC Options.
!                                                              (line  475)
! * mno-double:                            FRV Options.        (line   41)
  * mno-dpfp-lrsr:                         ARC Options.        (line   39)
! * mno-dsp:                               MIPS Options.       (line  355)
! * mno-dspr2:                             MIPS Options.       (line  361)
  * mno-dwarf2-asm:                        IA-64 Options.      (line   94)
! * mno-dword:                             FRV Options.        (line   35)
  * mno-eabi:                              RS/6000 and PowerPC Options.
!                                                              (line  712)
  * mno-early-stop-bits:                   IA-64 Options.      (line  100)
! * mno-eflags:                            FRV Options.        (line  125)
! * mno-embedded-data:                     MIPS Options.       (line  498)
  * mno-ep:                                V850 Options.       (line   16)
! * mno-epilogue-cfi:                      ARC Options.        (line  160)
  * mno-epsilon:                           MMIX Options.       (line   15)
! * mno-eva:                               MIPS Options.       (line  405)
! * mno-explicit-relocs <1>:               MIPS Options.       (line  542)
  * mno-explicit-relocs:                   DEC Alpha Options.  (line  176)
  * mno-exr:                               H8/300 Options.     (line   33)
! * mno-extern-sdata:                      MIPS Options.       (line  460)
! * mno-fancy-math-387:                    x86 Options.        (line  370)
! * mno-fast-sw-div:                       Nios II Options.    (line   84)
! * mno-faster-structs:                    SPARC Options.      (line   92)
  * mno-fix:                               DEC Alpha Options.  (line  163)
! * mno-fix-24k:                           MIPS Options.       (line  617)
  * mno-fix-cortex-a53-835769:             AArch64 Options.    (line   67)
  * mno-fix-cortex-a53-843419:             AArch64 Options.    (line   74)
! * mno-fix-r10000:                        MIPS Options.       (line  644)
! * mno-fix-r4000:                         MIPS Options.       (line  623)
! * mno-fix-r4400:                         MIPS Options.       (line  637)
  * mno-flat:                              SPARC Options.      (line   22)
! * mno-float:                             MIPS Options.       (line  276)
  * mno-float32:                           PDP-11 Options.     (line   48)
  * mno-float64:                           PDP-11 Options.     (line   52)
  * mno-flush-func:                        M32R/D Options.     (line   98)
  * mno-flush-trap:                        M32R/D Options.     (line   90)
! * mno-fmaf:                              SPARC Options.      (line  238)
  * mno-fp-in-toc:                         RS/6000 and PowerPC Options.
!                                                              (line  314)
  * mno-fp-regs:                           DEC Alpha Options.  (line   25)
! * mno-fp-ret-in-387:                     x86 Options.        (line  360)
  * mno-fprnd:                             RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-fpu <1>:                           Visium Options.     (line   24)
! * mno-fpu:                               SPARC Options.      (line   40)
! * mno-fsca:                              SH Options.         (line  497)
! * mno-fsrra:                             SH Options.         (line  506)
! * mno-fused-madd <1>:                    Xtensa Options.     (line   19)
! * mno-fused-madd <2>:                    SH Options.         (line  488)
! * mno-fused-madd <3>:                    S/390 and zSeries Options.
!                                                              (line  137)
! * mno-fused-madd <4>:                    RS/6000 and PowerPC Options.
!                                                              (line  459)
! * mno-fused-madd <5>:                    MIPS Options.       (line  599)
  * mno-fused-madd:                        IA-64 Options.      (line   88)
  * mno-gnu-as:                            IA-64 Options.      (line   18)
  * mno-gnu-ld:                            IA-64 Options.      (line   23)
  * mno-gotplt:                            CRIS Options.       (line   81)
! * mno-gpopt <1>:                         Nios II Options.    (line   17)
! * mno-gpopt:                             MIPS Options.       (line  483)
! * mno-hard-dfp <1>:                      S/390 and zSeries Options.
!                                                              (line   20)
  * mno-hard-dfp:                          RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-hardlit:                           MCore Options.      (line   10)
! * mno-hw-div:                            Nios II Options.    (line   93)
! * mno-hw-mul:                            Nios II Options.    (line   93)
! * mno-hw-mulx:                           Nios II Options.    (line   93)
! * mno-id-shared-library:                 Blackfin Options.   (line   88)
  * mno-ieee:                              SH Options.         (line  186)
! * mno-ieee-fp:                           x86 Options.        (line  342)
! * mno-imadd:                             MIPS Options.       (line  592)
  * mno-inline-float-divide:               IA-64 Options.      (line   62)
  * mno-inline-int-divide:                 IA-64 Options.      (line   73)
  * mno-inline-sqrt:                       IA-64 Options.      (line   84)
  * mno-int16:                             PDP-11 Options.     (line   44)
  * mno-int32:                             PDP-11 Options.     (line   40)
! * mno-interlink-compressed:              MIPS Options.       (line  136)
! * mno-interlink-mips16:                  MIPS Options.       (line  148)
! * mno-interrupts:                        AVR Options.        (line  180)
  * mno-isel:                              RS/6000 and PowerPC Options.
!                                                              (line  195)
! * mno-knuthdiv:                          MMIX Options.       (line   33)
! * mno-leaf-id-shared-library:            Blackfin Options.   (line   98)
  * mno-libfuncs:                          MMIX Options.       (line   10)
! * mno-llsc:                              MIPS Options.       (line  341)
! * mno-local-sdata:                       MIPS Options.       (line  448)
! * mno-long-calls <1>:                    V850 Options.       (line   10)
! * mno-long-calls <2>:                    MIPS Options.       (line  578)
! * mno-long-calls <3>:                    HPPA Options.       (line  129)
! * mno-long-calls <4>:                    Blackfin Options.   (line  121)
! * mno-long-calls:                        ARM Options.        (line  196)
  * mno-long-jumps:                        V850 Options.       (line  108)
  * mno-longcall:                          RS/6000 and PowerPC Options.
!                                                              (line  784)
  * mno-longcalls:                         Xtensa Options.     (line   72)
! * mno-low-64k:                           Blackfin Options.   (line   74)
! * mno-lsim <1>:                          MCore Options.      (line   46)
  * mno-lsim:                              FR30 Options.       (line   14)
! * mno-mad:                               MIPS Options.       (line  587)
  * mno-max:                               DEC Alpha Options.  (line  163)
! * mno-mcount-ra-address:                 MIPS Options.       (line  823)
! * mno-mcu:                               MIPS Options.       (line  401)
! * mno-mdmx:                              MIPS Options.       (line  378)
! * mno-media:                             FRV Options.        (line   47)
! * mno-memcpy:                            MIPS Options.       (line  572)
  * mno-mfcrf:                             RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-mfpgpr:                            RS/6000 and PowerPC Options.
                                                               (line   27)
! * mno-millicode:                         ARC Options.        (line  257)
! * mno-mips16:                            MIPS Options.       (line  120)
! * mno-mips3d:                            MIPS Options.       (line  384)
! * mno-mmicromips:                        MIPS Options.       (line  389)
  * mno-mpy:                               ARC Options.        (line   48)
! * mno-mt:                                MIPS Options.       (line  397)
! * mno-mul-bug-workaround:                CRIS Options.       (line   31)
! * mno-muladd:                            FRV Options.        (line   53)
  * mno-mulhw:                             RS/6000 and PowerPC Options.
!                                                              (line  468)
  * mno-mult-bug:                          MN10300 Options.    (line   13)
! * mno-multi-cond-exec:                   FRV Options.        (line  183)
  * mno-multiple:                          RS/6000 and PowerPC Options.
!                                                              (line  418)
  * mno-mvcle:                             S/390 and zSeries Options.
!                                                              (line  105)
! * mno-nested-cond-exec:                  FRV Options.        (line  195)
! * mno-odd-spreg:                         MIPS Options.       (line  295)
  * mno-omit-leaf-frame-pointer:           AArch64 Options.    (line   54)
! * mno-optimize-membar:                   FRV Options.        (line  205)
  * mno-opts:                              MeP Options.        (line   93)
! * mno-pack:                              FRV Options.        (line  122)
  * mno-packed-stack:                      S/390 and zSeries Options.
                                                               (line   54)
  * mno-paired:                            RS/6000 and PowerPC Options.
!                                                              (line  209)
! * mno-paired-single:                     MIPS Options.       (line  372)
  * mno-perf-ext:                          NDS32 Options.      (line   30)
  * mno-pic:                               IA-64 Options.      (line   26)
  * mno-pid:                               RX Options.         (line  117)
! * mno-plt:                               MIPS Options.       (line  221)
! * mno-popc:                              SPARC Options.      (line  231)
  * mno-popcntb:                           RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-popcntd:                           RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-postinc:                           Adapteva Epiphany Options.
!                                                              (line  110)
  * mno-postmodify:                        Adapteva Epiphany Options.
!                                                              (line  110)
  * mno-power8-fusion:                     RS/6000 and PowerPC Options.
!                                                              (line  236)
  * mno-power8-vector:                     RS/6000 and PowerPC Options.
!                                                              (line  242)
  * mno-powerpc-gfxopt:                    RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-powerpc-gpopt:                     RS/6000 and PowerPC Options.
--- 49432,50109 ----
  * mcop:                                  MeP Options.        (line   48)
  * mcop32:                                MeP Options.        (line   53)
  * mcop64:                                MeP Options.        (line   56)
! * mcorea:                                Blackfin Options.   (line  156)
! * mcoreb:                                Blackfin Options.   (line  163)
  * mcpu:                                  AArch64 Options.    (line  112)
! * mcpu <1>:                              ARC Options.        (line   14)
! * mcpu <2>:                              ARM Options.        (line  130)
! * mcpu <3>:                              CRIS Options.       (line   10)
! * mcpu <4>:                              DEC Alpha Options.  (line  215)
! * mcpu <5>:                              FRV Options.        (line  258)
! * mcpu <6>:                              M680x0 Options.     (line   28)
! * mcpu <7>:                              picoChip Options.   (line    9)
! * mcpu <8>:                              RS/6000 and PowerPC Options.
!                                                              (line   68)
! * mcpu <9>:                              RX Options.         (line   30)
! * mcpu <10>:                             SPARC Options.      (line  101)
! * mcpu <11>:                             TILE-Gx Options.    (line   18)
! * mcpu <12>:                             TILEPro Options.    (line    9)
! * mcpu <13>:                             Visium Options.     (line   33)
! * mcpu <14>:                             x86 Options.        (line  276)
! * mcpu32:                                M680x0 Options.     (line  135)
  * mcpu=:                                 Blackfin Options.   (line    7)
+ * mcpu= <1>:                             M32C Options.       (line    7)
+ * mcpu= <2>:                             MicroBlaze Options. (line   20)
+ * mcpu= <3>:                             MSP430 Options.     (line   34)
  * mcr16c:                                CR16 Options.       (line   14)
  * mcr16cplus:                            CR16 Options.       (line   14)
! * mcrc32:                                x86 Options.        (line  708)
  * mcrypto:                               RS/6000 and PowerPC Options.
!                                                              (line  223)
! * mcsync-anomaly:                        Blackfin Options.   (line   59)
! * mctor-dtor:                            NDS32 Options.      (line   69)
! * mcustom-fpu-cfg:                       Nios II Options.    (line  217)
! * mcustom-INSN:                          Nios II Options.    (line   97)
! * mcx16:                                 x86 Options.        (line  685)
  * MD:                                    Preprocessor Options.
!                                                              (line  276)
  * mdalign:                               SH Options.         (line  153)
  * mdata-align:                           CRIS Options.       (line   55)
  * mdata-model:                           CR16 Options.       (line   28)
  * mdc:                                   MeP Options.        (line   62)
  * mdebug:                                M32R/D Options.     (line   69)
+ * mdebug <1>:                            S/390 and zSeries Options.
+                                                              (line  110)
+ * mdebug <2>:                            Visium Options.     (line    7)
  * mdebug-main=PREFIX:                    VMS Options.        (line   13)
  * mdec-asm:                              PDP-11 Options.     (line   72)
  * mdirect-move:                          RS/6000 and PowerPC Options.
!                                                              (line  229)
  * mdisable-callt:                        V850 Options.       (line   92)
  * mdisable-fpregs:                       HPPA Options.       (line   27)
  * mdisable-indexing:                     HPPA Options.       (line   33)
! * mdiv:                                  M680x0 Options.     (line  206)
! * mdiv <1>:                              MCore Options.      (line   15)
! * mdiv <2>:                              MeP Options.        (line   65)
! * mdiv=STRATEGY:                         SH Options.         (line  305)
! * mdivide-breaks:                        MIPS Options.       (line  552)
  * mdivide-enabled:                       LM32 Options.       (line   12)
! * mdivide-traps:                         MIPS Options.       (line  552)
! * mdivsi3_libfunc=NAME:                  SH Options.         (line  400)
  * mdll:                                  x86 Windows Options.
                                                               (line   16)
  * mdlmzb:                                RS/6000 and PowerPC Options.
!                                                              (line  479)
! * mdmx:                                  MIPS Options.       (line  374)
! * mdouble:                               FRV Options.        (line   48)
! * mdouble-float:                         MIPS Options.       (line  286)
  * mdouble-float <1>:                     RS/6000 and PowerPC Options.
!                                                              (line  402)
  * mdpfp:                                 ARC Options.        (line   30)
  * mdpfp-compact:                         ARC Options.        (line   31)
  * mdpfp-fast:                            ARC Options.        (line   35)
! * mdpfp_compact:                         ARC Options.        (line  361)
! * mdpfp_fast:                            ARC Options.        (line  364)
! * mdsp:                                  MIPS Options.       (line  351)
! * mdsp-packa:                            ARC Options.        (line   88)
! * mdspr2:                                MIPS Options.       (line  357)
! * mdsp_packa:                            ARC Options.        (line  367)
! * mdual-nops:                            SPU Options.        (line   95)
! * mdump-tune-features:                   x86 Options.        (line  643)
! * mdvbf:                                 ARC Options.        (line   92)
  * mdwarf2-asm:                           IA-64 Options.      (line   94)
! * mdword:                                FRV Options.        (line   40)
  * mdynamic-no-pic:                       RS/6000 and PowerPC Options.
!                                                              (line  539)
  * mea:                                   ARC Options.        (line   43)
! * mEA:                                   ARC Options.        (line  370)
! * mea32:                                 SPU Options.        (line   60)
! * mea64:                                 SPU Options.        (line   60)
  * meabi:                                 RS/6000 and PowerPC Options.
!                                                              (line  716)
! * mearly-cbranchsi:                      ARC Options.        (line  228)
  * mearly-stop-bits:                      IA-64 Options.      (line  100)
  * meb:                                   MeP Options.        (line   68)
! * meb <1>:                               Moxie Options.      (line    7)
! * meb <2>:                               Nios II Options.    (line   65)
! * meb <3>:                               Score Options.      (line    9)
  * mel:                                   MeP Options.        (line   71)
! * mel <1>:                               Moxie Options.      (line   11)
! * mel <2>:                               Nios II Options.    (line   65)
! * mel <3>:                               Score Options.      (line   12)
  * melf:                                  CRIS Options.       (line   87)
+ * melf <1>:                              MMIX Options.       (line   43)
  * memb:                                  RS/6000 and PowerPC Options.
!                                                              (line  711)
! * membedded-data:                        MIPS Options.       (line  493)
  * memregs=:                              M32C Options.       (line   21)
  * mep:                                   V850 Options.       (line   16)
! * mepilogue-cfi:                         ARC Options.        (line  155)
  * mepsilon:                              MMIX Options.       (line   15)
  * merror-reloc:                          SPU Options.        (line   10)
  * mesa:                                  S/390 and zSeries Options.
!                                                              (line   94)
! * metrax100:                             CRIS Options.       (line   27)
! * metrax4:                               CRIS Options.       (line   27)
! * meva:                                  MIPS Options.       (line  401)
! * mexpand-adddi:                         ARC Options.        (line  231)
  * mexplicit-relocs:                      DEC Alpha Options.  (line  176)
+ * mexplicit-relocs <1>:                  MIPS Options.       (line  537)
  * mexr:                                  H8/300 Options.     (line   28)
! * mextern-sdata:                         MIPS Options.       (line  456)
  * MF:                                    Preprocessor Options.
                                                               (line  220)
! * mf16c:                                 x86 Options.        (line  596)
! * mfast-fp:                              Blackfin Options.   (line  132)
  * mfast-indirect-calls:                  HPPA Options.       (line   45)
! * mfast-sw-div:                          Nios II Options.    (line   82)
! * mfaster-structs:                       SPARC Options.      (line   91)
! * mfdpic:                                FRV Options.        (line   72)
! * mfentry:                               x86 Options.        (line  899)
  * mfix:                                  DEC Alpha Options.  (line  163)
! * mfix-24k:                              MIPS Options.       (line  610)
  * mfix-and-continue:                     Darwin Options.     (line  104)
! * mfix-at697f:                           SPARC Options.      (line  243)
  * mfix-cortex-a53-835769:                AArch64 Options.    (line   67)
  * mfix-cortex-a53-843419:                AArch64 Options.    (line   74)
  * mfix-cortex-m3-ldrd:                   ARM Options.        (line  319)
! * mfix-r10000:                           MIPS Options.       (line  632)
! * mfix-r4000:                            MIPS Options.       (line  616)
! * mfix-r4400:                            MIPS Options.       (line  626)
! * mfix-rm7000:                           MIPS Options.       (line  643)
! * mfix-sb1:                              MIPS Options.       (line  668)
! * mfix-ut699:                            SPARC Options.      (line  248)
! * mfix-vr4120:                           MIPS Options.       (line  648)
! * mfix-vr4130:                           MIPS Options.       (line  661)
! * mfixed-cc:                             FRV Options.        (line   35)
  * mfixed-range:                          HPPA Options.       (line   52)
+ * mfixed-range <1>:                      IA-64 Options.      (line  105)
+ * mfixed-range <2>:                      SH Options.         (line  407)
+ * mfixed-range <3>:                      SPU Options.        (line   52)
  * mflat:                                 SPARC Options.      (line   22)
! * mflip-mips16:                          MIPS Options.       (line  126)
  * mfloat-abi:                            ARM Options.        (line   41)
  * mfloat-gprs:                           RS/6000 and PowerPC Options.
!                                                              (line  291)
  * mfloat-ieee:                           DEC Alpha Options.  (line  171)
  * mfloat-vax:                            DEC Alpha Options.  (line  171)
  * mfloat32:                              PDP-11 Options.     (line   52)
  * mfloat64:                              PDP-11 Options.     (line   48)
! * mflush-func:                           MIPS Options.       (line  735)
  * mflush-func=NAME:                      M32R/D Options.     (line   93)
  * mflush-trap=NUMBER:                    M32R/D Options.     (line   86)
! * mfma:                                  x86 Options.        (line  597)
! * mfmaf:                                 SPARC Options.      (line  237)
  * mfmovd:                                SH Options.         (line  169)
  * mforce-no-pic:                         Xtensa Options.     (line   41)
! * mfp-exceptions:                        MIPS Options.       (line  762)
  * mfp-mode:                              Adapteva Epiphany Options.
!                                                              (line   71)
  * mfp-reg:                               DEC Alpha Options.  (line   25)
  * mfp-rounding-mode:                     DEC Alpha Options.  (line   85)
  * mfp-trap-mode:                         DEC Alpha Options.  (line   63)
! * mfp16-format:                          ARM Options.        (line  170)
! * mfp32:                                 MIPS Options.       (line  256)
! * mfp64:                                 MIPS Options.       (line  259)
! * mfpmath:                               Optimize Options.   (line 2062)
! * mfpmath <1>:                           x86 Options.        (line  279)
! * mfpr-32:                               FRV Options.        (line   15)
! * mfpr-64:                               FRV Options.        (line   19)
  * mfprnd:                                RS/6000 and PowerPC Options.
                                                               (line   27)
  * mfpu:                                  ARM Options.        (line  150)
! * mfpu <1>:                              PDP-11 Options.     (line    9)
! * mfpu <2>:                              RS/6000 and PowerPC Options.
!                                                              (line  410)
! * mfpu <3>:                              SPARC Options.      (line   34)
! * mfpu <4>:                              Visium Options.     (line   19)
! * mfpxx:                                 MIPS Options.       (line  262)
  * mfriz:                                 RS/6000 and PowerPC Options.
!                                                              (line  916)
! * mfsca:                                 SH Options.         (line  489)
! * mfsgsbase:                             x86 Options.        (line  594)
! * mfsrra:                                SH Options.         (line  498)
  * mfull-regs:                            NDS32 Options.      (line   18)
  * mfull-toc:                             RS/6000 and PowerPC Options.
!                                                              (line  319)
  * mfused-madd:                           IA-64 Options.      (line   88)
! * mfused-madd <1>:                       MIPS Options.       (line  593)
! * mfused-madd <2>:                       RS/6000 and PowerPC Options.
!                                                              (line  463)
! * mfused-madd <3>:                       S/390 and zSeries Options.
!                                                              (line  135)
! * mfused-madd <4>:                       SH Options.         (line  480)
! * mfused-madd <5>:                       Xtensa Options.     (line   19)
! * mfxsr:                                 x86 Options.        (line  609)
  * MG:                                    Preprocessor Options.
                                                               (line  229)
+ * mg:                                    VAX Options.        (line   17)
  * mgas:                                  HPPA Options.       (line   68)
  * mgcc-abi:                              V850 Options.       (line  148)
  * mgen-cell-microcode:                   RS/6000 and PowerPC Options.
!                                                              (line  176)
  * mgeneral-regs-only:                    AArch64 Options.    (line   24)
! * mgettrcost=NUMBER:                     SH Options.         (line  424)
  * mghs:                                  V850 Options.       (line  127)
  * mglibc:                                GNU/Linux Options.  (line    9)
  * mgnu:                                  VAX Options.        (line   13)
  * mgnu-as:                               IA-64 Options.      (line   18)
  * mgnu-ld:                               HPPA Options.       (line  104)
+ * mgnu-ld <1>:                           IA-64 Options.      (line   23)
  * mgotplt:                               CRIS Options.       (line   81)
! * mgp32:                                 MIPS Options.       (line  250)
! * mgp64:                                 MIPS Options.       (line  253)
! * mgpopt:                                MIPS Options.       (line  478)
! * mgpopt <1>:                            Nios II Options.    (line   16)
  * mgpr-32:                               FRV Options.        (line    7)
! * mgpr-64:                               FRV Options.        (line   11)
! * mgprel-ro:                             FRV Options.        (line   99)
  * mh:                                    H8/300 Options.     (line   14)
! * mhal:                                  Nios II Options.    (line  262)
  * mhalf-reg-file:                        Adapteva Epiphany Options.
                                                               (line    9)
  * mhard-dfp:                             RS/6000 and PowerPC Options.
                                                               (line   27)
! * mhard-dfp <1>:                         S/390 and zSeries Options.
!                                                              (line   20)
! * mhard-float:                           FRV Options.        (line   23)
! * mhard-float <1>:                       M680x0 Options.     (line  194)
! * mhard-float <2>:                       MicroBlaze Options. (line   10)
! * mhard-float <3>:                       MIPS Options.       (line  265)
! * mhard-float <4>:                       RS/6000 and PowerPC Options.
!                                                              (line  396)
! * mhard-float <5>:                       S/390 and zSeries Options.
                                                               (line   11)
! * mhard-float <6>:                       SPARC Options.      (line   34)
! * mhard-float <7>:                       V850 Options.       (line  113)
! * mhard-float <8>:                       Visium Options.     (line   19)
! * mhard-quad-float:                      SPARC Options.      (line   55)
  * mhardlit:                              MCore Options.      (line   10)
! * mhint-max-distance:                    SPU Options.        (line  107)
! * mhint-max-nops:                        SPU Options.        (line  101)
  * mhotpatch:                             S/390 and zSeries Options.
!                                                              (line  170)
  * mhp-ld:                                HPPA Options.       (line  116)
! * mhtm:                                  RS/6000 and PowerPC Options.
!                                                              (line  235)
! * mhw-div:                               Nios II Options.    (line   91)
! * mhw-mul:                               Nios II Options.    (line   91)
! * mhw-mulx:                              Nios II Options.    (line   91)
  * mhwmult=:                              MSP430 Options.     (line   55)
! * micplb:                                Blackfin Options.   (line  177)
! * mid-shared-library:                    Blackfin Options.   (line   80)
  * mieee:                                 DEC Alpha Options.  (line   39)
+ * mieee <1>:                             SH Options.         (line  186)
  * mieee-conformant:                      DEC Alpha Options.  (line  134)
! * mieee-fp:                              x86 Options.        (line  336)
  * mieee-with-inexact:                    DEC Alpha Options.  (line   52)
  * milp32:                                IA-64 Options.      (line  121)
! * mimadd:                                MIPS Options.       (line  586)
! * mimpure-text:                          Solaris 2 Options.  (line   15)
! * mincoming-stack-boundary:              x86 Options.        (line  550)
! * mindexed-addressing:                   SH Options.         (line  414)
! * mindexed-loads:                        ARC Options.        (line  235)
! * minline-all-stringops:                 x86 Options.        (line  831)
  * minline-float-divide-max-throughput:   IA-64 Options.      (line   58)
  * minline-float-divide-min-latency:      IA-64 Options.      (line   54)
  * minline-ic_invalidate:                 SH Options.         (line  195)
  * minline-int-divide-max-throughput:     IA-64 Options.      (line   69)
  * minline-int-divide-min-latency:        IA-64 Options.      (line   65)
! * minline-plt:                           Blackfin Options.   (line  137)
! * minline-plt <1>:                       FRV Options.        (line   81)
  * minline-sqrt-max-throughput:           IA-64 Options.      (line   80)
  * minline-sqrt-min-latency:              IA-64 Options.      (line   76)
! * minline-stringops-dynamically:         x86 Options.        (line  838)
! * minrt:                                 MSP430 Options.     (line   76)
  * minsert-sched-nops:                    RS/6000 and PowerPC Options.
!                                                              (line  579)
  * mint-register:                         RX Options.         (line  100)
  * mint16:                                PDP-11 Options.     (line   40)
  * mint32:                                CR16 Options.       (line   22)
! * mint32 <1>:                            H8/300 Options.     (line   38)
! * mint32 <2>:                            PDP-11 Options.     (line   44)
! * mint8:                                 AVR Options.        (line  172)
! * minterlink-compressed:                 MIPS Options.       (line  133)
! * minterlink-mips16:                     MIPS Options.       (line  145)
! * minvalid-symbols:                      SH Options.         (line  448)
  * mio-volatile:                          MeP Options.        (line   74)
! * mips1:                                 MIPS Options.       (line   78)
! * mips16:                                MIPS Options.       (line  118)
! * mips2:                                 MIPS Options.       (line   81)
! * mips3:                                 MIPS Options.       (line   84)
! * mips32:                                MIPS Options.       (line   90)
! * mips32r3:                              MIPS Options.       (line   93)
! * mips32r5:                              MIPS Options.       (line   96)
! * mips32r6:                              MIPS Options.       (line   99)
! * mips3d:                                MIPS Options.       (line  380)
! * mips4:                                 MIPS Options.       (line   87)
! * mips64:                                MIPS Options.       (line  102)
! * mips64r2:                              MIPS Options.       (line  105)
! * mips64r3:                              MIPS Options.       (line  108)
! * mips64r5:                              MIPS Options.       (line  111)
! * mips64r6:                              MIPS Options.       (line  114)
  * misel:                                 RS/6000 and PowerPC Options.
!                                                              (line  194)
! * misize:                                ARC Options.        (line  130)
  * misize <1>:                            SH Options.         (line  207)
  * misr-vector-size:                      NDS32 Options.      (line   45)
  * missue-rate=NUMBER:                    M32R/D Options.     (line   79)
  * mivc2:                                 MeP Options.        (line   59)
  * mjump-in-delay:                        HPPA Options.       (line   23)
  * mkernel:                               Darwin Options.     (line   82)
! * mknuthdiv:                             MMIX Options.       (line   32)
  * ml:                                    MeP Options.        (line   78)
+ * ml <1>:                                SH Options.         (line  150)
  * mlarge:                                MSP430 Options.     (line   44)
  * mlarge-data:                           DEC Alpha Options.  (line  187)
! * mlarge-data-threshold:                 x86 Options.        (line  436)
! * mlarge-mem:                            SPU Options.        (line   38)
  * mlarge-text:                           DEC Alpha Options.  (line  205)
  * mleadz:                                MeP Options.        (line   81)
! * mleaf-id-shared-library:               Blackfin Options.   (line   91)
  * mlibfuncs:                             MMIX Options.       (line   10)
! * mlibrary-pic:                          FRV Options.        (line  135)
! * mlinked-fp:                            FRV Options.        (line  116)
  * mlinker-opt:                           HPPA Options.       (line   78)
  * mlinux:                                CRIS Options.       (line   91)
  * mlittle:                               RS/6000 and PowerPC Options.
!                                                              (line  528)
  * mlittle-endian:                        AArch64 Options.    (line   27)
+ * mlittle-endian <1>:                    ARC Options.        (line  351)
+ * mlittle-endian <2>:                    ARM Options.        (line   57)
+ * mlittle-endian <3>:                    C6X Options.        (line   16)
+ * mlittle-endian <4>:                    IA-64 Options.      (line   13)
+ * mlittle-endian <5>:                    MCore Options.      (line   39)
+ * mlittle-endian <6>:                    MicroBlaze Options. (line   60)
+ * mlittle-endian <7>:                    NDS32 Options.      (line   12)
+ * mlittle-endian <8>:                    RS/6000 and PowerPC Options.
+                                                              (line  528)
+ * mlittle-endian <9>:                    TILE-Gx Options.    (line   29)
  * mlittle-endian-data:                   RX Options.         (line   42)
  * mliw:                                  MN10300 Options.    (line   54)
! * mllsc:                                 MIPS Options.       (line  337)
! * mlocal-sdata:                          MIPS Options.       (line  444)
! * mlock:                                 ARC Options.        (line   96)
  * mlong-calls:                           Adapteva Epiphany Options.
                                                               (line   55)
! * mlong-calls <1>:                       ARC Options.        (line  161)
! * mlong-calls <2>:                       ARM Options.        (line  195)
! * mlong-calls <3>:                       Blackfin Options.   (line  120)
! * mlong-calls <4>:                       FRV Options.        (line  122)
! * mlong-calls <5>:                       MIPS Options.       (line  572)
! * mlong-calls <6>:                       V850 Options.       (line   10)
  * mlong-double-128:                      S/390 and zSeries Options.
                                                               (line   29)
! * mlong-double-128 <1>:                  x86 Options.        (line  415)
  * mlong-double-64:                       S/390 and zSeries Options.
                                                               (line   29)
! * mlong-double-64 <1>:                   x86 Options.        (line  415)
! * mlong-double-80:                       x86 Options.        (line  415)
  * mlong-jumps:                           V850 Options.       (line  108)
  * mlong-load-store:                      HPPA Options.       (line   59)
! * mlong32:                               MIPS Options.       (line  419)
! * mlong64:                               MIPS Options.       (line  414)
  * mlongcall:                             RS/6000 and PowerPC Options.
!                                                              (line  787)
  * mlongcalls:                            Xtensa Options.     (line   72)
  * mloop:                                 V850 Options.       (line  121)
! * mlow-64k:                              Blackfin Options.   (line   69)
  * mlp64:                                 IA-64 Options.      (line  121)
! * mlra:                                  ARC Options.        (line  240)
! * mlra-priority-compact:                 ARC Options.        (line  248)
! * mlra-priority-noncompact:              ARC Options.        (line  251)
! * mlra-priority-none:                    ARC Options.        (line  245)
! * mlwp:                                  x86 Options.        (line  602)
! * mlzcnt:                                x86 Options.        (line  608)
  * MM:                                    Preprocessor Options.
                                                               (line  210)
! * mm:                                    MeP Options.        (line   84)
  * mmac:                                  CR16 Options.       (line    9)
! * mmac <1>:                              Score Options.      (line   21)
! * mmac-24:                               ARC Options.        (line  105)
! * mmac-d16:                              ARC Options.        (line  101)
! * mmac_24:                               ARC Options.        (line  373)
! * mmac_d16:                              ARC Options.        (line  376)
! * mmad:                                  MIPS Options.       (line  581)
  * mmainkernel:                           Nvidia PTX Options. (line   13)
  * mmalloc64:                             VMS Options.        (line   17)
  * mmax:                                  DEC Alpha Options.  (line  163)
  * mmax-constant-size:                    RX Options.         (line   82)
! * mmax-stack-frame:                      CRIS Options.       (line   23)
! * mmcount-ra-address:                    MIPS Options.       (line  810)
  * mmcu:                                  AVR Options.        (line    9)
+ * mmcu <1>:                              MIPS Options.       (line  397)
  * mmcu=:                                 MSP430 Options.     (line   14)
  * MMD:                                   Preprocessor Options.
!                                                              (line  292)
! * mmedia:                                FRV Options.        (line   56)
! * mmedium-calls:                         ARC Options.        (line  165)
  * mmemcpy:                               MicroBlaze Options. (line   13)
! * mmemcpy <1>:                           MIPS Options.       (line  566)
! * mmemcpy-strategy=STRATEGY:             x86 Options.        (line  860)
  * mmemory-latency:                       DEC Alpha Options.  (line  268)
! * mmemory-model:                         SPARC Options.      (line  289)
! * mmemset-strategy=STRATEGY:             x86 Options.        (line  872)
  * mmfcrf:                                RS/6000 and PowerPC Options.
                                                               (line   27)
  * mmfpgpr:                               RS/6000 and PowerPC Options.
                                                               (line   27)
! * mmicromips:                            MIPS Options.       (line  385)
  * mminimal-toc:                          RS/6000 and PowerPC Options.
!                                                              (line  319)
  * mminmax:                               MeP Options.        (line   87)
! * mmixed-code:                           ARC Options.        (line  263)
! * mmmx:                                  x86 Options.        (line  575)
  * mmodel=large:                          M32R/D Options.     (line   33)
  * mmodel=medium:                         M32R/D Options.     (line   27)
  * mmodel=small:                          M32R/D Options.     (line   18)
! * mmovbe:                                x86 Options.        (line  704)
! * mmpx:                                  x86 Options.        (line  616)
! * mmt:                                   MIPS Options.       (line  393)
  * mmul:                                  RL78 Options.       (line   13)
! * mmul-bug-workaround:                   CRIS Options.       (line   32)
  * mmul.x:                                Moxie Options.      (line   14)
  * mmul32x16:                             ARC Options.        (line   51)
  * mmul64:                                ARC Options.        (line   54)
! * mmuladd:                               FRV Options.        (line   64)
  * mmulhw:                                RS/6000 and PowerPC Options.
!                                                              (line  472)
  * mmult:                                 MeP Options.        (line   90)
  * mmult-bug:                             MN10300 Options.    (line    9)
! * mmultcost:                             ARC Options.        (line  325)
! * mmulti-cond-exec:                      FRV Options.        (line  215)
! * mmulticore:                            Blackfin Options.   (line  141)
  * mmultiple:                             RS/6000 and PowerPC Options.
!                                                              (line  422)
  * mmvcle:                                S/390 and zSeries Options.
!                                                              (line  104)
  * mmvme:                                 RS/6000 and PowerPC Options.
!                                                              (line  692)
! * mmwaitx:                               x86 Options.        (line  617)
  * mn:                                    H8/300 Options.     (line   20)
! * mn-flash:                              AVR Options.        (line  178)
! * mnan=2008:                             MIPS Options.       (line  318)
! * mnan=legacy:                           MIPS Options.       (line  318)
  * mneon-for-64bits:                      ARM Options.        (line  339)
! * mnested-cond-exec:                     FRV Options.        (line  230)
  * mnhwloop:                              Score Options.      (line   15)
  * mno-16-bit:                            NDS32 Options.      (line   42)
  * mno-4byte-functions:                   MCore Options.      (line   27)
  * mno-8byte-align:                       V850 Options.       (line  170)
! * mno-abicalls:                          MIPS Options.       (line  190)
  * mno-abshi:                             PDP-11 Options.     (line   58)
  * mno-ac0:                               PDP-11 Options.     (line   20)
! * mno-address-space-conversion:          SPU Options.        (line   68)
! * mno-align-double:                      x86 Options.        (line  374)
! * mno-align-int:                         M680x0 Options.     (line  263)
  * mno-align-loops:                       M32R/D Options.     (line   76)
! * mno-align-stringops:                   x86 Options.        (line  826)
  * mno-altivec:                           RS/6000 and PowerPC Options.
!                                                              (line  135)
  * mno-am33:                              MN10300 Options.    (line   20)
  * mno-app-regs:                          SPARC Options.      (line   10)
+ * mno-app-regs <1>:                      V850 Options.       (line  185)
  * mno-as100-syntax:                      RX Options.         (line   76)
! * mno-atomic-updates:                    SPU Options.        (line   83)
  * mno-avoid-indexed-addresses:           RS/6000 and PowerPC Options.
!                                                              (line  454)
  * mno-backchain:                         S/390 and zSeries Options.
                                                               (line   35)
! * mno-base-addresses:                    MMIX Options.       (line   53)
  * mno-bit-align:                         RS/6000 and PowerPC Options.
!                                                              (line  486)
! * mno-bitfield:                          M680x0 Options.     (line  227)
! * mno-branch-likely:                     MIPS Options.       (line  751)
! * mno-branch-predict:                    MMIX Options.       (line   48)
! * mno-brcc:                              ARC Options.        (line  200)
  * mno-bwx:                               DEC Alpha Options.  (line  163)
! * mno-bypass-cache:                      Nios II Options.    (line   70)
! * mno-cache-volatile:                    Nios II Options.    (line   76)
  * mno-callgraph-data:                    MCore Options.      (line   31)
! * mno-cbcond:                            SPARC Options.      (line  223)
! * mno-check-zero-division:               MIPS Options.       (line  546)
  * mno-cix:                               DEC Alpha Options.  (line  163)
  * mno-clearbss:                          MicroBlaze Options. (line   16)
  * mno-cmov:                              NDS32 Options.      (line   24)
  * mno-cmpb:                              RS/6000 and PowerPC Options.
                                                               (line   27)
! * mno-cond-exec:                         ARC Options.        (line  212)
! * mno-cond-exec <1>:                     FRV Options.        (line  194)
! * mno-cond-move:                         FRV Options.        (line  166)
  * mno-const-align:                       CRIS Options.       (line   55)
  * mno-const16:                           Xtensa Options.     (line   10)
  * mno-crt0:                              MN10300 Options.    (line   43)
+ * mno-crt0 <1>:                          Moxie Options.      (line   18)
  * mno-crypto:                            RS/6000 and PowerPC Options.
!                                                              (line  223)
! * mno-csync-anomaly:                     Blackfin Options.   (line   65)
! * mno-custom-INSN:                       Nios II Options.    (line   97)
  * mno-data-align:                        CRIS Options.       (line   55)
  * mno-debug:                             S/390 and zSeries Options.
!                                                              (line  110)
! * mno-default:                           x86 Options.        (line  657)
  * mno-direct-move:                       RS/6000 and PowerPC Options.
!                                                              (line  229)
  * mno-disable-callt:                     V850 Options.       (line   92)
+ * mno-div:                               M680x0 Options.     (line  206)
  * mno-div <1>:                           MCore Options.      (line   15)
  * mno-dlmzb:                             RS/6000 and PowerPC Options.
!                                                              (line  479)
! * mno-double:                            FRV Options.        (line   52)
  * mno-dpfp-lrsr:                         ARC Options.        (line   39)
! * mno-dsp:                               MIPS Options.       (line  351)
! * mno-dspr2:                             MIPS Options.       (line  357)
  * mno-dwarf2-asm:                        IA-64 Options.      (line   94)
! * mno-dword:                             FRV Options.        (line   44)
  * mno-eabi:                              RS/6000 and PowerPC Options.
!                                                              (line  716)
  * mno-early-stop-bits:                   IA-64 Options.      (line  100)
! * mno-eflags:                            FRV Options.        (line  155)
! * mno-embedded-data:                     MIPS Options.       (line  493)
  * mno-ep:                                V850 Options.       (line   16)
! * mno-epilogue-cfi:                      ARC Options.        (line  158)
  * mno-epsilon:                           MMIX Options.       (line   15)
! * mno-eva:                               MIPS Options.       (line  401)
  * mno-explicit-relocs:                   DEC Alpha Options.  (line  176)
+ * mno-explicit-relocs <1>:               MIPS Options.       (line  537)
  * mno-exr:                               H8/300 Options.     (line   33)
! * mno-extern-sdata:                      MIPS Options.       (line  456)
! * mno-fancy-math-387:                    x86 Options.        (line  364)
! * mno-fast-sw-div:                       Nios II Options.    (line   82)
! * mno-faster-structs:                    SPARC Options.      (line   91)
  * mno-fix:                               DEC Alpha Options.  (line  163)
! * mno-fix-24k:                           MIPS Options.       (line  610)
  * mno-fix-cortex-a53-835769:             AArch64 Options.    (line   67)
  * mno-fix-cortex-a53-843419:             AArch64 Options.    (line   74)
! * mno-fix-r10000:                        MIPS Options.       (line  632)
! * mno-fix-r4000:                         MIPS Options.       (line  616)
! * mno-fix-r4400:                         MIPS Options.       (line  626)
  * mno-flat:                              SPARC Options.      (line   22)
! * mno-float:                             MIPS Options.       (line  272)
  * mno-float32:                           PDP-11 Options.     (line   48)
  * mno-float64:                           PDP-11 Options.     (line   52)
  * mno-flush-func:                        M32R/D Options.     (line   98)
  * mno-flush-trap:                        M32R/D Options.     (line   90)
! * mno-fmaf:                              SPARC Options.      (line  237)
  * mno-fp-in-toc:                         RS/6000 and PowerPC Options.
!                                                              (line  319)
  * mno-fp-regs:                           DEC Alpha Options.  (line   25)
! * mno-fp-ret-in-387:                     x86 Options.        (line  354)
  * mno-fprnd:                             RS/6000 and PowerPC Options.
                                                               (line   27)
+ * mno-fpu:                               SPARC Options.      (line   39)
  * mno-fpu <1>:                           Visium Options.     (line   24)
! * mno-fsca:                              SH Options.         (line  489)
! * mno-fsrra:                             SH Options.         (line  498)
  * mno-fused-madd:                        IA-64 Options.      (line   88)
+ * mno-fused-madd <1>:                    MIPS Options.       (line  593)
+ * mno-fused-madd <2>:                    RS/6000 and PowerPC Options.
+                                                              (line  463)
+ * mno-fused-madd <3>:                    S/390 and zSeries Options.
+                                                              (line  135)
+ * mno-fused-madd <4>:                    SH Options.         (line  480)
+ * mno-fused-madd <5>:                    Xtensa Options.     (line   19)
  * mno-gnu-as:                            IA-64 Options.      (line   18)
  * mno-gnu-ld:                            IA-64 Options.      (line   23)
  * mno-gotplt:                            CRIS Options.       (line   81)
! * mno-gpopt:                             MIPS Options.       (line  478)
! * mno-gpopt <1>:                         Nios II Options.    (line   16)
  * mno-hard-dfp:                          RS/6000 and PowerPC Options.
                                                               (line   27)
+ * mno-hard-dfp <1>:                      S/390 and zSeries Options.
+                                                              (line   20)
  * mno-hardlit:                           MCore Options.      (line   10)
! * mno-htm:                               RS/6000 and PowerPC Options.
!                                                              (line  235)
! * mno-hw-div:                            Nios II Options.    (line   91)
! * mno-hw-mul:                            Nios II Options.    (line   91)
! * mno-hw-mulx:                           Nios II Options.    (line   91)
! * mno-id-shared-library:                 Blackfin Options.   (line   87)
  * mno-ieee:                              SH Options.         (line  186)
! * mno-ieee-fp:                           x86 Options.        (line  336)
! * mno-imadd:                             MIPS Options.       (line  586)
  * mno-inline-float-divide:               IA-64 Options.      (line   62)
  * mno-inline-int-divide:                 IA-64 Options.      (line   73)
  * mno-inline-sqrt:                       IA-64 Options.      (line   84)
  * mno-int16:                             PDP-11 Options.     (line   44)
  * mno-int32:                             PDP-11 Options.     (line   40)
! * mno-interlink-compressed:              MIPS Options.       (line  133)
! * mno-interlink-mips16:                  MIPS Options.       (line  145)
! * mno-interrupts:                        AVR Options.        (line  181)
  * mno-isel:                              RS/6000 and PowerPC Options.
!                                                              (line  194)
! * mno-knuthdiv:                          MMIX Options.       (line   32)
! * mno-leaf-id-shared-library:            Blackfin Options.   (line   97)
  * mno-libfuncs:                          MMIX Options.       (line   10)
! * mno-llsc:                              MIPS Options.       (line  337)
! * mno-local-sdata:                       MIPS Options.       (line  444)
! * mno-long-calls:                        ARM Options.        (line  195)
! * mno-long-calls <1>:                    Blackfin Options.   (line  120)
! * mno-long-calls <2>:                    HPPA Options.       (line  129)
! * mno-long-calls <3>:                    MIPS Options.       (line  572)
! * mno-long-calls <4>:                    V850 Options.       (line   10)
  * mno-long-jumps:                        V850 Options.       (line  108)
  * mno-longcall:                          RS/6000 and PowerPC Options.
!                                                              (line  787)
  * mno-longcalls:                         Xtensa Options.     (line   72)
! * mno-low-64k:                           Blackfin Options.   (line   73)
  * mno-lsim:                              FR30 Options.       (line   14)
! * mno-lsim <1>:                          MCore Options.      (line   46)
! * mno-mad:                               MIPS Options.       (line  581)
  * mno-max:                               DEC Alpha Options.  (line  163)
! * mno-mcount-ra-address:                 MIPS Options.       (line  810)
! * mno-mcu:                               MIPS Options.       (line  397)
! * mno-mdmx:                              MIPS Options.       (line  374)
! * mno-media:                             FRV Options.        (line   60)
! * mno-memcpy:                            MIPS Options.       (line  566)
  * mno-mfcrf:                             RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-mfpgpr:                            RS/6000 and PowerPC Options.
                                                               (line   27)
! * mno-millicode:                         ARC Options.        (line  254)
! * mno-mips16:                            MIPS Options.       (line  118)
! * mno-mips3d:                            MIPS Options.       (line  380)
! * mno-mmicromips:                        MIPS Options.       (line  385)
  * mno-mpy:                               ARC Options.        (line   48)
! * mno-mt:                                MIPS Options.       (line  393)
! * mno-mul-bug-workaround:                CRIS Options.       (line   32)
! * mno-muladd:                            FRV Options.        (line   68)
  * mno-mulhw:                             RS/6000 and PowerPC Options.
!                                                              (line  472)
  * mno-mult-bug:                          MN10300 Options.    (line   13)
! * mno-multi-cond-exec:                   FRV Options.        (line  223)
  * mno-multiple:                          RS/6000 and PowerPC Options.
!                                                              (line  422)
  * mno-mvcle:                             S/390 and zSeries Options.
!                                                              (line  104)
! * mno-nested-cond-exec:                  FRV Options.        (line  237)
! * mno-odd-spreg:                         MIPS Options.       (line  291)
  * mno-omit-leaf-frame-pointer:           AArch64 Options.    (line   54)
! * mno-optimize-membar:                   FRV Options.        (line  249)
  * mno-opts:                              MeP Options.        (line   93)
! * mno-pack:                              FRV Options.        (line  151)
  * mno-packed-stack:                      S/390 and zSeries Options.
                                                               (line   54)
  * mno-paired:                            RS/6000 and PowerPC Options.
!                                                              (line  208)
! * mno-paired-single:                     MIPS Options.       (line  368)
  * mno-perf-ext:                          NDS32 Options.      (line   30)
  * mno-pic:                               IA-64 Options.      (line   26)
  * mno-pid:                               RX Options.         (line  117)
! * mno-plt:                               MIPS Options.       (line  217)
! * mno-popc:                              SPARC Options.      (line  230)
  * mno-popcntb:                           RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-popcntd:                           RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-postinc:                           Adapteva Epiphany Options.
!                                                              (line  109)
  * mno-postmodify:                        Adapteva Epiphany Options.
!                                                              (line  109)
  * mno-power8-fusion:                     RS/6000 and PowerPC Options.
!                                                              (line  241)
  * mno-power8-vector:                     RS/6000 and PowerPC Options.
!                                                              (line  247)
  * mno-powerpc-gfxopt:                    RS/6000 and PowerPC Options.
                                                               (line   27)
  * mno-powerpc-gpopt:                     RS/6000 and PowerPC Options.
*************** look up both forms.
*** 50457,50483 ****
  * mno-prolog-function:                   V850 Options.       (line   23)
  * mno-prologue-epilogue:                 CRIS Options.       (line   71)
  * mno-prototype:                         RS/6000 and PowerPC Options.
!                                                              (line  672)
! * mno-push-args:                         x86 Options.        (line  811)
  * mno-quad-memory:                       RS/6000 and PowerPC Options.
!                                                              (line  249)
  * mno-quad-memory-atomic:                RS/6000 and PowerPC Options.
!                                                              (line  255)
! * mno-red-zone:                          x86 Options.        (line  982)
  * mno-register-names:                    IA-64 Options.      (line   37)
  * mno-regnames:                          RS/6000 and PowerPC Options.
!                                                              (line  778)
  * mno-relax:                             V850 Options.       (line  103)
  * mno-relax-immediate:                   MCore Options.      (line   19)
  * mno-relocatable:                       RS/6000 and PowerPC Options.
!                                                              (line  498)
  * mno-relocatable-lib:                   RS/6000 and PowerPC Options.
!                                                              (line  509)
  * mno-renesas:                           SH Options.         (line  176)
  * mno-round-nearest:                     Adapteva Epiphany Options.
                                                               (line   51)
! * mno-rtd:                               M680x0 Options.     (line  262)
! * mno-scc:                               FRV Options.        (line  146)
  * mno-sched-ar-data-spec:                IA-64 Options.      (line  134)
  * mno-sched-ar-in-data-spec:             IA-64 Options.      (line  155)
  * mno-sched-br-data-spec:                IA-64 Options.      (line  128)
--- 50113,50139 ----
  * mno-prolog-function:                   V850 Options.       (line   23)
  * mno-prologue-epilogue:                 CRIS Options.       (line   71)
  * mno-prototype:                         RS/6000 and PowerPC Options.
!                                                              (line  676)
! * mno-push-args:                         x86 Options.        (line  804)
  * mno-quad-memory:                       RS/6000 and PowerPC Options.
!                                                              (line  254)
  * mno-quad-memory-atomic:                RS/6000 and PowerPC Options.
!                                                              (line  260)
! * mno-red-zone:                          x86 Options.        (line  972)
  * mno-register-names:                    IA-64 Options.      (line   37)
  * mno-regnames:                          RS/6000 and PowerPC Options.
!                                                              (line  781)
  * mno-relax:                             V850 Options.       (line  103)
  * mno-relax-immediate:                   MCore Options.      (line   19)
  * mno-relocatable:                       RS/6000 and PowerPC Options.
!                                                              (line  502)
  * mno-relocatable-lib:                   RS/6000 and PowerPC Options.
!                                                              (line  513)
  * mno-renesas:                           SH Options.         (line  176)
  * mno-round-nearest:                     Adapteva Epiphany Options.
                                                               (line   51)
! * mno-rtd:                               M680x0 Options.     (line  258)
! * mno-scc:                               FRV Options.        (line  180)
  * mno-sched-ar-data-spec:                IA-64 Options.      (line  134)
  * mno-sched-ar-in-data-spec:             IA-64 Options.      (line  155)
  * mno-sched-br-data-spec:                IA-64 Options.      (line  128)
*************** look up both forms.
*** 50488,50723 ****
  * mno-sched-prefer-non-control-spec-insns: IA-64 Options.    (line  175)
  * mno-sched-prefer-non-data-spec-insns:  IA-64 Options.      (line  168)
  * mno-sched-prolog:                      ARM Options.        (line   32)
! * mno-sdata <1>:                         RS/6000 and PowerPC Options.
!                                                              (line  759)
! * mno-sdata <2>:                         IA-64 Options.      (line   42)
! * mno-sdata:                             ARC Options.        (line  175)
! * mno-sep-data:                          Blackfin Options.   (line  116)
  * mno-serialize-volatile:                Xtensa Options.     (line   35)
! * mno-short:                             M680x0 Options.     (line  226)
  * mno-side-effects:                      CRIS Options.       (line   46)
  * mno-sim:                               RX Options.         (line   71)
! * mno-single-exit:                       MMIX Options.       (line   66)
  * mno-slow-bytes:                        MCore Options.      (line   35)
  * mno-small-exec:                        S/390 and zSeries Options.
!                                                              (line   80)
! * mno-smartmips:                         MIPS Options.       (line  368)
  * mno-soft-cmpsf:                        Adapteva Epiphany Options.
                                                               (line   29)
  * mno-soft-float:                        DEC Alpha Options.  (line   10)
  * mno-space-regs:                        HPPA Options.       (line   38)
  * mno-spe:                               RS/6000 and PowerPC Options.
!                                                              (line  204)
! * mno-specld-anomaly:                    Blackfin Options.   (line   56)
! * mno-split-addresses:                   MIPS Options.       (line  536)
  * mno-stack-align:                       CRIS Options.       (line   55)
! * mno-stack-bias:                        SPARC Options.      (line  314)
  * mno-strict-align <1>:                  RS/6000 and PowerPC Options.
!                                                              (line  493)
! * mno-strict-align:                      M680x0 Options.     (line  287)
  * mno-string:                            RS/6000 and PowerPC Options.
!                                                              (line  429)
  * mno-sum-in-toc:                        RS/6000 and PowerPC Options.
!                                                              (line  314)
! * mno-sym32:                             MIPS Options.       (line  433)
  * mno-target-align:                      Xtensa Options.     (line   59)
  * mno-text-section-literals:             Xtensa Options.     (line   47)
  * mno-tls-markers:                       RS/6000 and PowerPC Options.
!                                                              (line  817)
  * mno-toc:                               RS/6000 and PowerPC Options.
!                                                              (line  518)
! * mno-toplevel-symbols:                  MMIX Options.       (line   40)
  * mno-tpf-trace:                         S/390 and zSeries Options.
!                                                              (line  131)
  * mno-unaligned-access:                  ARM Options.        (line  326)
! * mno-unaligned-doubles:                 SPARC Options.      (line   74)
! * mno-uninit-const-in-rodata:            MIPS Options.       (line  506)
  * mno-update:                            RS/6000 and PowerPC Options.
!                                                              (line  440)
  * mno-upper-regs:                        RS/6000 and PowerPC Options.
!                                                              (line  277)
  * mno-upper-regs-df:                     RS/6000 and PowerPC Options.
!                                                              (line  261)
  * mno-upper-regs-sf:                     RS/6000 and PowerPC Options.
!                                                              (line  269)
! * mno-user-mode:                         SPARC Options.      (line   86)
! * mno-usermode:                          SH Options.         (line  297)
  * mno-v3push:                            NDS32 Options.      (line   36)
! * mno-v8plus:                            SPARC Options.      (line  195)
  * mno-vect-double:                       Adapteva Epiphany Options.
!                                                              (line  116)
! * mno-virt:                              MIPS Options.       (line  409)
! * mno-vis:                               SPARC Options.      (line  202)
! * mno-vis2:                              SPARC Options.      (line  208)
! * mno-vis3:                              SPARC Options.      (line  216)
! * mno-vliw-branch:                       FRV Options.        (line  170)
  * mno-volatile-asm-stop:                 IA-64 Options.      (line   32)
! * mno-volatile-cache:                    ARC Options.        (line  189)
  * mno-vrsave:                            RS/6000 and PowerPC Options.
!                                                              (line  174)
  * mno-vsx:                               RS/6000 and PowerPC Options.
!                                                              (line  218)
  * mno-warn-multiple-fast-interrupts:     RX Options.         (line  143)
  * mno-wide-bitfields:                    MCore Options.      (line   23)
! * mno-xgot <1>:                          MIPS Options.       (line  231)
! * mno-xgot:                              M680x0 Options.     (line  319)
  * mno-xl-compat:                         RS/6000 and PowerPC Options.
!                                                              (line  349)
! * mno-xpa:                               MIPS Options.       (line  414)
! * mno-zdcbranch:                         SH Options.         (line  473)
! * mno-zero-extend:                       MMIX Options.       (line   27)
! * mnobitfield:                           M680x0 Options.     (line  231)
  * mnoliw:                                MN10300 Options.    (line   59)
  * mnomacsave:                            SH Options.         (line  181)
  * mnop-fun-dllimport:                    x86 Windows Options.
                                                               (line   22)
! * mnop-mcount:                           x86 Options.        (line  920)
  * mnops:                                 Adapteva Epiphany Options.
                                                               (line   26)
  * mnorm:                                 ARC Options.        (line   58)
  * mnosetlb:                              MN10300 Options.    (line   69)
  * mnosplit-lohi:                         Adapteva Epiphany Options.
!                                                              (line  110)
! * modd-spreg:                            MIPS Options.       (line  295)
! * momit-leaf-frame-pointer <1>:          x86 Options.        (line  884)
! * momit-leaf-frame-pointer <2>:          Blackfin Options.   (line   44)
  * momit-leaf-frame-pointer:              AArch64 Options.    (line   54)
  * mone-byte-bool:                        Darwin Options.     (line   90)
! * moptimize-membar:                      FRV Options.        (line  201)
  * MP:                                    Preprocessor Options.
                                                               (line  239)
  * mpa-risc-1-0:                          HPPA Options.       (line   19)
  * mpa-risc-1-1:                          HPPA Options.       (line   19)
  * mpa-risc-2-0:                          HPPA Options.       (line   19)
! * mpack:                                 FRV Options.        (line  119)
  * mpacked-stack:                         S/390 and zSeries Options.
                                                               (line   54)
  * mpadstruct:                            SH Options.         (line  210)
  * mpaired:                               RS/6000 and PowerPC Options.
!                                                              (line  209)
! * mpaired-single:                        MIPS Options.       (line  372)
! * mpc32:                                 x86 Options.        (line  505)
! * mpc64:                                 x86 Options.        (line  505)
! * mpc80:                                 x86 Options.        (line  505)
! * mpclmul:                               x86 Options.        (line  598)
! * mpcrel:                                M680x0 Options.     (line  279)
! * mpdebug:                               CRIS Options.       (line   35)
  * mpe:                                   RS/6000 and PowerPC Options.
!                                                              (line  369)
  * mpe-aligned-commons:                   x86 Windows Options.
                                                               (line   59)
  * mperf-ext:                             NDS32 Options.      (line   27)
! * mpic-data-is-text-relative:            ARM Options.        (line  233)
! * mpic-register:                         ARM Options.        (line  226)
  * mpid:                                  RX Options.         (line  117)
! * mplt:                                  MIPS Options.       (line  221)
  * mpointer-size=SIZE:                    VMS Options.        (line   20)
  * mpointers-to-nested-functions:         RS/6000 and PowerPC Options.
!                                                              (line  923)
! * mpoke-function-name:                   ARM Options.        (line  239)
! * mpopc:                                 SPARC Options.      (line  231)
! * mpopcnt:                               x86 Options.        (line  610)
  * mpopcntb:                              RS/6000 and PowerPC Options.
                                                               (line   27)
  * mpopcntd:                              RS/6000 and PowerPC Options.
                                                               (line   27)
  * mportable-runtime:                     HPPA Options.       (line   64)
  * mpower8-fusion:                        RS/6000 and PowerPC Options.
!                                                              (line  236)
  * mpower8-vector:                        RS/6000 and PowerPC Options.
!                                                              (line  242)
  * mpowerpc-gfxopt:                       RS/6000 and PowerPC Options.
                                                               (line   27)
  * mpowerpc-gpopt:                        RS/6000 and PowerPC Options.
                                                               (line   27)
  * mpowerpc64:                            RS/6000 and PowerPC Options.
                                                               (line   27)
! * mprefer-avx128:                        x86 Options.        (line  688)
  * mprefer-short-insn-regs:               Adapteva Epiphany Options.
                                                               (line   13)
! * mprefergot:                            SH Options.         (line  291)
! * mpreferred-stack-boundary:             x86 Options.        (line  535)
! * mprefetchwt1:                          x86 Options.        (line  606)
! * mpretend-cmove:                        SH Options.         (line  515)
  * mprint-tune-info:                      ARM Options.        (line  363)
  * mprioritize-restricted-insns:          RS/6000 and PowerPC Options.
!                                                              (line  547)
  * mprolog-function:                      V850 Options.       (line   23)
  * mprologue-epilogue:                    CRIS Options.       (line   71)
  * mprototype:                            RS/6000 and PowerPC Options.
!                                                              (line  672)
! * mpt-fixed:                             SH Options.         (line  434)
! * mpush-args:                            x86 Options.        (line  811)
  * MQ:                                    Preprocessor Options.
!                                                              (line  265)
! * mq-class:                              ARC Options.        (line  271)
  * mquad-memory:                          RS/6000 and PowerPC Options.
!                                                              (line  249)
  * mquad-memory-atomic:                   RS/6000 and PowerPC Options.
!                                                              (line  255)
! * mr10k-cache-barrier:                   MIPS Options.       (line  686)
! * mRcq:                                  ARC Options.        (line  275)
! * mRcw:                                  ARC Options.        (line  279)
! * mrdrnd:                                x86 Options.        (line  601)
! * mrecip <1>:                            x86 Options.        (line  721)
  * mrecip:                                RS/6000 and PowerPC Options.
!                                                              (line  829)
  * mrecip-precision:                      RS/6000 and PowerPC Options.
!                                                              (line  887)
! * mrecip=opt <1>:                        x86 Options.        (line  743)
  * mrecip=opt:                            RS/6000 and PowerPC Options.
!                                                              (line  842)
! * mrecord-mcount:                        x86 Options.        (line  914)
  * mreduced-regs:                         NDS32 Options.      (line   15)
  * mregister-names:                       IA-64 Options.      (line   37)
  * mregnames:                             RS/6000 and PowerPC Options.
!                                                              (line  778)
! * mregparm:                              x86 Options.        (line  472)
! * mrelax <1>:                            V850 Options.       (line  103)
! * mrelax <2>:                            SH Options.         (line  158)
! * mrelax <3>:                            RX Options.         (line   95)
! * mrelax <4>:                            NDS32 Options.      (line   74)
! * mrelax <5>:                            MSP430 Options.     (line   50)
! * mrelax <6>:                            MN10300 Options.    (line   46)
! * mrelax <7>:                            H8/300 Options.     (line    9)
! * mrelax:                                AVR Options.        (line  184)
  * mrelax-immediate:                      MCore Options.      (line   19)
! * mrelax-pic-calls:                      MIPS Options.       (line  810)
  * mrelocatable:                          RS/6000 and PowerPC Options.
!                                                              (line  498)
  * mrelocatable-lib:                      RS/6000 and PowerPC Options.
!                                                              (line  509)
  * mrenesas:                              SH Options.         (line  173)
  * mrepeat:                               MeP Options.        (line   96)
  * mrestrict-it:                          ARM Options.        (line  357)
  * mreturn-pointer-on-d0:                 MN10300 Options.    (line   36)
  * mrh850-abi:                            V850 Options.       (line  127)
! * mrmw:                                  AVR Options.        (line  198)
! * mrtd <1>:                              Function Attributes.
!                                                              (line  217)
! * mrtd <2>:                              x86 Options.        (line  448)
! * mrtd:                                  M680x0 Options.     (line  240)
! * mrtm:                                  x86 Options.        (line  620)
  * mrtp:                                  VxWorks Options.    (line   11)
! * mrtsc:                                 ARC Options.        (line  110)
! * ms <1>:                                MeP Options.        (line  100)
  * ms:                                    H8/300 Options.     (line   17)
  * ms2600:                                H8/300 Options.     (line   24)
! * msafe-dma:                             SPU Options.        (line   17)
! * msafe-hints:                           SPU Options.        (line  107)
! * msahf:                                 x86 Options.        (line  701)
  * msatur:                                MeP Options.        (line  105)
  * msave-acc-in-interrupts:               RX Options.         (line  109)
  * msave-toc-indirect:                    RS/6000 and PowerPC Options.
!                                                              (line  935)
! * mscc:                                  FRV Options.        (line  140)
  * msched-ar-data-spec:                   IA-64 Options.      (line  134)
  * msched-ar-in-data-spec:                IA-64 Options.      (line  155)
  * msched-br-data-spec:                   IA-64 Options.      (line  128)
  * msched-br-in-data-spec:                IA-64 Options.      (line  148)
  * msched-control-spec:                   IA-64 Options.      (line  140)
  * msched-costly-dep:                     RS/6000 and PowerPC Options.
!                                                              (line  554)
  * msched-count-spec-in-critical-path:    IA-64 Options.      (line  182)
  * msched-fp-mem-deps-zero-cost:          IA-64 Options.      (line  198)
  * msched-in-control-spec:                IA-64 Options.      (line  162)
--- 50144,50379 ----
  * mno-sched-prefer-non-control-spec-insns: IA-64 Options.    (line  175)
  * mno-sched-prefer-non-data-spec-insns:  IA-64 Options.      (line  168)
  * mno-sched-prolog:                      ARM Options.        (line   32)
! * mno-sdata:                             ARC Options.        (line  173)
! * mno-sdata <1>:                         IA-64 Options.      (line   42)
! * mno-sdata <2>:                         RS/6000 and PowerPC Options.
!                                                              (line  762)
! * mno-sep-data:                          Blackfin Options.   (line  115)
  * mno-serialize-volatile:                Xtensa Options.     (line   35)
! * mno-short:                             M680x0 Options.     (line  222)
  * mno-side-effects:                      CRIS Options.       (line   46)
  * mno-sim:                               RX Options.         (line   71)
! * mno-single-exit:                       MMIX Options.       (line   65)
  * mno-slow-bytes:                        MCore Options.      (line   35)
  * mno-small-exec:                        S/390 and zSeries Options.
!                                                              (line   79)
! * mno-smartmips:                         MIPS Options.       (line  364)
  * mno-soft-cmpsf:                        Adapteva Epiphany Options.
                                                               (line   29)
  * mno-soft-float:                        DEC Alpha Options.  (line   10)
  * mno-space-regs:                        HPPA Options.       (line   38)
  * mno-spe:                               RS/6000 and PowerPC Options.
!                                                              (line  203)
! * mno-specld-anomaly:                    Blackfin Options.   (line   55)
! * mno-split-addresses:                   MIPS Options.       (line  531)
  * mno-stack-align:                       CRIS Options.       (line   55)
! * mno-stack-bias:                        SPARC Options.      (line  313)
! * mno-strict-align:                      M680x0 Options.     (line  283)
  * mno-strict-align <1>:                  RS/6000 and PowerPC Options.
!                                                              (line  497)
  * mno-string:                            RS/6000 and PowerPC Options.
!                                                              (line  433)
  * mno-sum-in-toc:                        RS/6000 and PowerPC Options.
!                                                              (line  319)
! * mno-sym32:                             MIPS Options.       (line  429)
  * mno-target-align:                      Xtensa Options.     (line   59)
  * mno-text-section-literals:             Xtensa Options.     (line   47)
  * mno-tls-markers:                       RS/6000 and PowerPC Options.
!                                                              (line  819)
  * mno-toc:                               RS/6000 and PowerPC Options.
!                                                              (line  522)
! * mno-toplevel-symbols:                  MMIX Options.       (line   39)
  * mno-tpf-trace:                         S/390 and zSeries Options.
!                                                              (line  129)
  * mno-unaligned-access:                  ARM Options.        (line  326)
! * mno-unaligned-doubles:                 SPARC Options.      (line   73)
! * mno-uninit-const-in-rodata:            MIPS Options.       (line  501)
  * mno-update:                            RS/6000 and PowerPC Options.
!                                                              (line  444)
  * mno-upper-regs:                        RS/6000 and PowerPC Options.
!                                                              (line  282)
  * mno-upper-regs-df:                     RS/6000 and PowerPC Options.
!                                                              (line  266)
  * mno-upper-regs-sf:                     RS/6000 and PowerPC Options.
!                                                              (line  274)
! * mno-user-mode:                         SPARC Options.      (line   85)
! * mno-usermode:                          SH Options.         (line  295)
  * mno-v3push:                            NDS32 Options.      (line   36)
! * mno-v8plus:                            SPARC Options.      (line  194)
  * mno-vect-double:                       Adapteva Epiphany Options.
!                                                              (line  115)
! * mno-virt:                              MIPS Options.       (line  405)
! * mno-vis:                               SPARC Options.      (line  201)
! * mno-vis2:                              SPARC Options.      (line  207)
! * mno-vis3:                              SPARC Options.      (line  215)
! * mno-vliw-branch:                       FRV Options.        (line  208)
  * mno-volatile-asm-stop:                 IA-64 Options.      (line   32)
! * mno-volatile-cache:                    ARC Options.        (line  187)
  * mno-vrsave:                            RS/6000 and PowerPC Options.
!                                                              (line  173)
  * mno-vsx:                               RS/6000 and PowerPC Options.
!                                                              (line  217)
  * mno-warn-multiple-fast-interrupts:     RX Options.         (line  143)
  * mno-wide-bitfields:                    MCore Options.      (line   23)
! * mno-xgot:                              M680x0 Options.     (line  315)
! * mno-xgot <1>:                          MIPS Options.       (line  227)
  * mno-xl-compat:                         RS/6000 and PowerPC Options.
!                                                              (line  354)
! * mno-xpa:                               MIPS Options.       (line  410)
! * mno-zdcbranch:                         SH Options.         (line  465)
! * mno-zero-extend:                       MMIX Options.       (line   26)
! * mnobitfield:                           M680x0 Options.     (line  227)
  * mnoliw:                                MN10300 Options.    (line   59)
  * mnomacsave:                            SH Options.         (line  181)
  * mnop-fun-dllimport:                    x86 Windows Options.
                                                               (line   22)
! * mnop-mcount:                           x86 Options.        (line  912)
  * mnops:                                 Adapteva Epiphany Options.
                                                               (line   26)
  * mnorm:                                 ARC Options.        (line   58)
  * mnosetlb:                              MN10300 Options.    (line   69)
  * mnosplit-lohi:                         Adapteva Epiphany Options.
!                                                              (line  109)
! * modd-spreg:                            MIPS Options.       (line  291)
  * momit-leaf-frame-pointer:              AArch64 Options.    (line   54)
+ * momit-leaf-frame-pointer <1>:          Blackfin Options.   (line   43)
+ * momit-leaf-frame-pointer <2>:          x86 Options.        (line  876)
  * mone-byte-bool:                        Darwin Options.     (line   90)
! * moptimize-membar:                      FRV Options.        (line  244)
  * MP:                                    Preprocessor Options.
                                                               (line  239)
  * mpa-risc-1-0:                          HPPA Options.       (line   19)
  * mpa-risc-1-1:                          HPPA Options.       (line   19)
  * mpa-risc-2-0:                          HPPA Options.       (line   19)
! * mpack:                                 FRV Options.        (line  147)
  * mpacked-stack:                         S/390 and zSeries Options.
                                                               (line   54)
  * mpadstruct:                            SH Options.         (line  210)
  * mpaired:                               RS/6000 and PowerPC Options.
!                                                              (line  208)
! * mpaired-single:                        MIPS Options.       (line  368)
! * mpc32:                                 x86 Options.        (line  499)
! * mpc64:                                 x86 Options.        (line  499)
! * mpc80:                                 x86 Options.        (line  499)
! * mpclmul:                               x86 Options.        (line  592)
! * mpcrel:                                M680x0 Options.     (line  275)
! * mpdebug:                               CRIS Options.       (line   36)
  * mpe:                                   RS/6000 and PowerPC Options.
!                                                              (line  373)
  * mpe-aligned-commons:                   x86 Windows Options.
                                                               (line   59)
  * mperf-ext:                             NDS32 Options.      (line   27)
! * mpic-data-is-text-relative:            ARM Options.        (line  232)
! * mpic-register:                         ARM Options.        (line  225)
  * mpid:                                  RX Options.         (line  117)
! * mplt:                                  MIPS Options.       (line  217)
  * mpointer-size=SIZE:                    VMS Options.        (line   20)
  * mpointers-to-nested-functions:         RS/6000 and PowerPC Options.
!                                                              (line  924)
! * mpoke-function-name:                   ARM Options.        (line  238)
! * mpopc:                                 SPARC Options.      (line  230)
! * mpopcnt:                               x86 Options.        (line  604)
  * mpopcntb:                              RS/6000 and PowerPC Options.
                                                               (line   27)
  * mpopcntd:                              RS/6000 and PowerPC Options.
                                                               (line   27)
  * mportable-runtime:                     HPPA Options.       (line   64)
  * mpower8-fusion:                        RS/6000 and PowerPC Options.
!                                                              (line  241)
  * mpower8-vector:                        RS/6000 and PowerPC Options.
!                                                              (line  247)
  * mpowerpc-gfxopt:                       RS/6000 and PowerPC Options.
                                                               (line   27)
  * mpowerpc-gpopt:                        RS/6000 and PowerPC Options.
                                                               (line   27)
  * mpowerpc64:                            RS/6000 and PowerPC Options.
                                                               (line   27)
! * mprefer-avx128:                        x86 Options.        (line  681)
  * mprefer-short-insn-regs:               Adapteva Epiphany Options.
                                                               (line   13)
! * mprefergot:                            SH Options.         (line  289)
! * mpreferred-stack-boundary:             x86 Options.        (line  529)
! * mprefetchwt1:                          x86 Options.        (line  600)
! * mpretend-cmove:                        SH Options.         (line  507)
  * mprint-tune-info:                      ARM Options.        (line  363)
  * mprioritize-restricted-insns:          RS/6000 and PowerPC Options.
!                                                              (line  551)
  * mprolog-function:                      V850 Options.       (line   23)
  * mprologue-epilogue:                    CRIS Options.       (line   71)
  * mprototype:                            RS/6000 and PowerPC Options.
!                                                              (line  676)
! * mpt-fixed:                             SH Options.         (line  428)
! * mpush-args:                            x86 Options.        (line  804)
  * MQ:                                    Preprocessor Options.
!                                                              (line  266)
! * mq-class:                              ARC Options.        (line  268)
  * mquad-memory:                          RS/6000 and PowerPC Options.
!                                                              (line  254)
  * mquad-memory-atomic:                   RS/6000 and PowerPC Options.
!                                                              (line  260)
! * mr10k-cache-barrier:                   MIPS Options.       (line  673)
! * mRcq:                                  ARC Options.        (line  272)
! * mRcw:                                  ARC Options.        (line  276)
! * mrdrnd:                                x86 Options.        (line  595)
  * mrecip:                                RS/6000 and PowerPC Options.
!                                                              (line  831)
! * mrecip <1>:                            x86 Options.        (line  714)
  * mrecip-precision:                      RS/6000 and PowerPC Options.
!                                                              (line  888)
  * mrecip=opt:                            RS/6000 and PowerPC Options.
!                                                              (line  844)
! * mrecip=opt <1>:                        x86 Options.        (line  736)
! * mrecord-mcount:                        x86 Options.        (line  906)
  * mreduced-regs:                         NDS32 Options.      (line   15)
  * mregister-names:                       IA-64 Options.      (line   37)
  * mregnames:                             RS/6000 and PowerPC Options.
!                                                              (line  781)
! * mregparm:                              x86 Options.        (line  466)
! * mrelax:                                AVR Options.        (line  185)
! * mrelax <1>:                            H8/300 Options.     (line    9)
! * mrelax <2>:                            MN10300 Options.    (line   46)
! * mrelax <3>:                            MSP430 Options.     (line   50)
! * mrelax <4>:                            NDS32 Options.      (line   72)
! * mrelax <5>:                            RX Options.         (line   95)
! * mrelax <6>:                            SH Options.         (line  158)
! * mrelax <7>:                            V850 Options.       (line  103)
  * mrelax-immediate:                      MCore Options.      (line   19)
! * mrelax-pic-calls:                      MIPS Options.       (line  797)
  * mrelocatable:                          RS/6000 and PowerPC Options.
!                                                              (line  502)
  * mrelocatable-lib:                      RS/6000 and PowerPC Options.
!                                                              (line  513)
  * mrenesas:                              SH Options.         (line  173)
  * mrepeat:                               MeP Options.        (line   96)
  * mrestrict-it:                          ARM Options.        (line  357)
  * mreturn-pointer-on-d0:                 MN10300 Options.    (line   36)
  * mrh850-abi:                            V850 Options.       (line  127)
! * mrmw:                                  AVR Options.        (line  199)
! * mrtd:                                  M680x0 Options.     (line  236)
! * mrtd <1>:                              x86 Options.        (line  442)
! * mrtd <2>:                              Function Attributes.
!                                                              (line  215)
! * mrtm:                                  x86 Options.        (line  614)
  * mrtp:                                  VxWorks Options.    (line   11)
! * mrtsc:                                 ARC Options.        (line  109)
  * ms:                                    H8/300 Options.     (line   17)
+ * ms <1>:                                MeP Options.        (line  100)
  * ms2600:                                H8/300 Options.     (line   24)
! * msafe-dma:                             SPU Options.        (line   18)
! * msafe-hints:                           SPU Options.        (line  112)
! * msahf:                                 x86 Options.        (line  694)
  * msatur:                                MeP Options.        (line  105)
  * msave-acc-in-interrupts:               RX Options.         (line  109)
  * msave-toc-indirect:                    RS/6000 and PowerPC Options.
!                                                              (line  936)
! * mscc:                                  FRV Options.        (line  173)
  * msched-ar-data-spec:                   IA-64 Options.      (line  134)
  * msched-ar-in-data-spec:                IA-64 Options.      (line  155)
  * msched-br-data-spec:                   IA-64 Options.      (line  128)
  * msched-br-in-data-spec:                IA-64 Options.      (line  148)
  * msched-control-spec:                   IA-64 Options.      (line  140)
  * msched-costly-dep:                     RS/6000 and PowerPC Options.
!                                                              (line  558)
  * msched-count-spec-in-critical-path:    IA-64 Options.      (line  182)
  * msched-fp-mem-deps-zero-cost:          IA-64 Options.      (line  198)
  * msched-in-control-spec:                IA-64 Options.      (line  162)
*************** look up both forms.
*** 50726,50795 ****
  * msched-prefer-non-control-spec-insns:  IA-64 Options.      (line  175)
  * msched-prefer-non-data-spec-insns:     IA-64 Options.      (line  168)
  * msched-spec-ldc:                       IA-64 Options.      (line  187)
  * msched-stop-bits-after-every-cycle:    IA-64 Options.      (line  194)
  * mschedule:                             HPPA Options.       (line   71)
  * mscore5:                               Score Options.      (line   25)
  * mscore5u:                              Score Options.      (line   28)
  * mscore7:                               Score Options.      (line   31)
! * mscore7d:                              Score Options.      (line   34)
  * msda:                                  V850 Options.       (line   40)
- * msdata <1>:                            RS/6000 and PowerPC Options.
-                                                              (line  746)
  * msdata:                                IA-64 Options.      (line   42)
  * msdata=all:                            C6X Options.        (line   30)
  * msdata=data:                           RS/6000 and PowerPC Options.
!                                                              (line  751)
! * msdata=default <1>:                    RS/6000 and PowerPC Options.
!                                                              (line  746)
  * msdata=default:                        C6X Options.        (line   22)
  * msdata=eabi:                           RS/6000 and PowerPC Options.
!                                                              (line  726)
! * msdata=none <1>:                       RS/6000 and PowerPC Options.
!                                                              (line  759)
! * msdata=none <2>:                       M32R/D Options.     (line   40)
  * msdata=none:                           C6X Options.        (line   35)
  * msdata=sdata:                          M32R/D Options.     (line   49)
  * msdata=sysv:                           RS/6000 and PowerPC Options.
!                                                              (line  737)
  * msdata=use:                            M32R/D Options.     (line   53)
  * msdram <1>:                            MeP Options.        (line  110)
- * msdram:                                Blackfin Options.   (line  172)
  * msecure-plt:                           RS/6000 and PowerPC Options.
!                                                              (line  184)
  * msel-sched-dont-check-control-spec:    IA-64 Options.      (line  203)
! * msep-data:                             Blackfin Options.   (line  110)
  * mserialize-volatile:                   Xtensa Options.     (line   35)
  * msetlb:                                MN10300 Options.    (line   64)
! * msha:                                  x86 Options.        (line  596)
! * mshared-library-id:                    Blackfin Options.   (line  103)
! * mshort:                                M680x0 Options.     (line  220)
  * msign-extend-enabled:                  LM32 Options.       (line   18)
! * msim <1>:                              Xstormy16 Options.  (line    9)
! * msim <2>:                              Visium Options.     (line   13)
! * msim <3>:                              RX Options.         (line   71)
! * msim <4>:                              RS/6000 and PowerPC Options.
!                                                              (line  682)
! * msim <5>:                              RL78 Options.       (line    7)
! * msim <6>:                              MSP430 Options.     (line   39)
! * msim <7>:                              MeP Options.        (line  114)
! * msim <8>:                              M32C Options.       (line   13)
! * msim <9>:                              CR16 Options.       (line   18)
! * msim <10>:                             C6X Options.        (line   19)
! * msim:                                  Blackfin Options.   (line   37)
  * msimd:                                 ARC Options.        (line   71)
  * msimnovec:                             MeP Options.        (line  117)
  * msimple-fpu:                           RS/6000 and PowerPC Options.
!                                                              (line  402)
! * msingle-exit:                          MMIX Options.       (line   66)
  * msingle-float <1>:                     RS/6000 and PowerPC Options.
!                                                              (line  398)
! * msingle-float:                         MIPS Options.       (line  286)
  * msingle-pic-base <1>:                  RS/6000 and PowerPC Options.
!                                                              (line  541)
! * msingle-pic-base:                      ARM Options.        (line  220)
  * msio:                                  HPPA Options.       (line   98)
! * msize-level:                           ARC Options.        (line  283)
! * mskip-rax-setup:                       x86 Options.        (line  927)
  * mslow-bytes:                           MCore Options.      (line   35)
  * mslow-flash-data:                      ARM Options.        (line  344)
  * msmall:                                MSP430 Options.     (line   47)
--- 50382,50452 ----
  * msched-prefer-non-control-spec-insns:  IA-64 Options.      (line  175)
  * msched-prefer-non-data-spec-insns:     IA-64 Options.      (line  168)
  * msched-spec-ldc:                       IA-64 Options.      (line  187)
+ * msched-spec-ldc <1>:                   IA-64 Options.      (line  190)
  * msched-stop-bits-after-every-cycle:    IA-64 Options.      (line  194)
  * mschedule:                             HPPA Options.       (line   71)
  * mscore5:                               Score Options.      (line   25)
  * mscore5u:                              Score Options.      (line   28)
  * mscore7:                               Score Options.      (line   31)
! * mscore7d:                              Score Options.      (line   35)
  * msda:                                  V850 Options.       (line   40)
  * msdata:                                IA-64 Options.      (line   42)
+ * msdata <1>:                            RS/6000 and PowerPC Options.
+                                                              (line  749)
  * msdata=all:                            C6X Options.        (line   30)
  * msdata=data:                           RS/6000 and PowerPC Options.
!                                                              (line  754)
  * msdata=default:                        C6X Options.        (line   22)
+ * msdata=default <1>:                    RS/6000 and PowerPC Options.
+                                                              (line  749)
  * msdata=eabi:                           RS/6000 and PowerPC Options.
!                                                              (line  730)
  * msdata=none:                           C6X Options.        (line   35)
+ * msdata=none <1>:                       M32R/D Options.     (line   40)
+ * msdata=none <2>:                       RS/6000 and PowerPC Options.
+                                                              (line  762)
  * msdata=sdata:                          M32R/D Options.     (line   49)
  * msdata=sysv:                           RS/6000 and PowerPC Options.
!                                                              (line  740)
  * msdata=use:                            M32R/D Options.     (line   53)
+ * msdram:                                Blackfin Options.   (line  171)
  * msdram <1>:                            MeP Options.        (line  110)
  * msecure-plt:                           RS/6000 and PowerPC Options.
!                                                              (line  183)
  * msel-sched-dont-check-control-spec:    IA-64 Options.      (line  203)
! * msep-data:                             Blackfin Options.   (line  109)
  * mserialize-volatile:                   Xtensa Options.     (line   35)
  * msetlb:                                MN10300 Options.    (line   64)
! * msha:                                  x86 Options.        (line  590)
! * mshared-library-id:                    Blackfin Options.   (line  102)
! * mshort:                                M680x0 Options.     (line  216)
  * msign-extend-enabled:                  LM32 Options.       (line   18)
! * msim:                                  Blackfin Options.   (line   36)
! * msim <1>:                              C6X Options.        (line   19)
! * msim <2>:                              CR16 Options.       (line   18)
! * msim <3>:                              M32C Options.       (line   13)
! * msim <4>:                              MeP Options.        (line  114)
! * msim <5>:                              MSP430 Options.     (line   39)
! * msim <6>:                              RL78 Options.       (line    7)
! * msim <7>:                              RS/6000 and PowerPC Options.
!                                                              (line  686)
! * msim <8>:                              RX Options.         (line   71)
! * msim <9>:                              Visium Options.     (line   13)
! * msim <10>:                             Xstormy16 Options.  (line    9)
  * msimd:                                 ARC Options.        (line   71)
  * msimnovec:                             MeP Options.        (line  117)
  * msimple-fpu:                           RS/6000 and PowerPC Options.
!                                                              (line  406)
! * msingle-exit:                          MMIX Options.       (line   65)
! * msingle-float:                         MIPS Options.       (line  282)
  * msingle-float <1>:                     RS/6000 and PowerPC Options.
!                                                              (line  402)
! * msingle-pic-base:                      ARM Options.        (line  219)
  * msingle-pic-base <1>:                  RS/6000 and PowerPC Options.
!                                                              (line  545)
  * msio:                                  HPPA Options.       (line   98)
! * msize-level:                           ARC Options.        (line  280)
! * mskip-rax-setup:                       x86 Options.        (line  919)
  * mslow-bytes:                           MCore Options.      (line   35)
  * mslow-flash-data:                      ARM Options.        (line  344)
  * msmall:                                MSP430 Options.     (line   47)
*************** look up both forms.
*** 50797,50958 ****
  * msmall-data-limit:                     RX Options.         (line   47)
  * msmall-divides:                        MicroBlaze Options. (line   39)
  * msmall-exec:                           S/390 and zSeries Options.
!                                                              (line   80)
! * msmall-mem:                            SPU Options.        (line   35)
  * msmall-model:                          FR30 Options.       (line    9)
  * msmall-text:                           DEC Alpha Options.  (line  205)
  * msmall16:                              Adapteva Epiphany Options.
!                                                              (line   67)
! * msmallc:                               Nios II Options.    (line  272)
! * msmartmips:                            MIPS Options.       (line  368)
! * msoft-float <1>:                       x86 Options.        (line  347)
! * msoft-float <2>:                       Visium Options.     (line   24)
! * msoft-float <3>:                       V850 Options.       (line  113)
! * msoft-float <4>:                       SPARC Options.      (line   40)
! * msoft-float <5>:                       S/390 and zSeries Options.
!                                                              (line   11)
! * msoft-float <6>:                       RS/6000 and PowerPC Options.
!                                                              (line  392)
! * msoft-float <7>:                       PDP-11 Options.     (line   13)
! * msoft-float <8>:                       MIPS Options.       (line  272)
! * msoft-float <9>:                       MicroBlaze Options. (line    7)
! * msoft-float <10>:                      M680x0 Options.     (line  203)
! * msoft-float <11>:                      HPPA Options.       (line   84)
! * msoft-float <12>:                      FRV Options.        (line   22)
! * msoft-float <13>:                      DEC Alpha Options.  (line   10)
  * msoft-float:                           ARC Options.        (line   75)
! * msoft-quad-float:                      SPARC Options.      (line   60)
! * msp8:                                  AVR Options.        (line  202)
  * mspace:                                V850 Options.       (line   30)
  * mspe:                                  RS/6000 and PowerPC Options.
!                                                              (line  204)
! * mspecld-anomaly:                       Blackfin Options.   (line   51)
  * mspfp:                                 ARC Options.        (line   62)
  * mspfp-compact:                         ARC Options.        (line   63)
  * mspfp-fast:                            ARC Options.        (line   67)
! * mspfp_compact:                         ARC Options.        (line  384)
! * mspfp_fast:                            ARC Options.        (line  387)
! * msplit-addresses:                      MIPS Options.       (line  536)
  * msplit-vecmove-early:                  Adapteva Epiphany Options.
!                                                              (line  127)
! * msse:                                  x86 Options.        (line  582)
! * msse2avx:                              x86 Options.        (line  902)
! * msseregparm:                           x86 Options.        (line  483)
  * mstack-align:                          CRIS Options.       (line   55)
! * mstack-bias:                           SPARC Options.      (line  314)
! * mstack-check-l1:                       Blackfin Options.   (line   77)
  * mstack-guard:                          S/390 and zSeries Options.
!                                                              (line  156)
  * mstack-increment:                      MCore Options.      (line   50)
  * mstack-offset:                         Adapteva Epiphany Options.
                                                               (line   37)
! * mstack-protector-guard=GUARD:          x86 Options.        (line  951)
  * mstack-size:                           S/390 and zSeries Options.
!                                                              (line  156)
! * mstackrealign:                         x86 Options.        (line  526)
! * mstdmain:                              SPU Options.        (line   40)
! * mstrict-align <1>:                     RS/6000 and PowerPC Options.
!                                                              (line  493)
! * mstrict-align <2>:                     M680x0 Options.     (line  287)
  * mstrict-align:                         AArch64 Options.    (line   49)
! * mstrict-X:                             AVR Options.        (line  215)
  * mstring:                               RS/6000 and PowerPC Options.
!                                                              (line  429)
! * mstringop-strategy=ALG:                x86 Options.        (line  850)
! * mstructure-size-boundary:              ARM Options.        (line  177)
  * msv-mode:                              Visium Options.     (line   52)
  * msvr4-struct-return:                   RS/6000 and PowerPC Options.
!                                                              (line  634)
  * mswap:                                 ARC Options.        (line   82)
! * mswape:                                ARC Options.        (line  115)
! * msym32:                                MIPS Options.       (line  433)
! * msynci:                                MIPS Options.       (line  796)
! * msys-crt0:                             Nios II Options.    (line  276)
! * msys-lib:                              Nios II Options.    (line  280)
  * MT:                                    Preprocessor Options.
                                                               (line  251)
  * mtarget-align:                         Xtensa Options.     (line   59)
! * mtas:                                  SH Options.         (line  282)
! * mtbm:                                  x86 Options.        (line  621)
  * mtda:                                  V850 Options.       (line   34)
! * mtelephony:                            ARC Options.        (line  120)
  * mtext-section-literals:                Xtensa Options.     (line   47)
  * mtf:                                   MeP Options.        (line  121)
  * mthread:                               x86 Windows Options.
                                                               (line   26)
! * mthreads:                              x86 Options.        (line  826)
! * mthumb:                                ARM Options.        (line  261)
  * mthumb-interwork:                      ARM Options.        (line   24)
! * mtiny-stack:                           AVR Options.        (line  229)
  * mtiny=:                                MeP Options.        (line  125)
! * mtls:                                  FRV Options.        (line   75)
! * mTLS:                                  FRV Options.        (line   72)
! * mtls-dialect <1>:                      x86 Options.        (line  804)
  * mtls-dialect:                          ARM Options.        (line  302)
  * mtls-dialect=desc:                     AArch64 Options.    (line   58)
  * mtls-dialect=traditional:              AArch64 Options.    (line   62)
! * mtls-direct-seg-refs:                  x86 Options.        (line  892)
  * mtls-markers:                          RS/6000 and PowerPC Options.
!                                                              (line  817)
  * mtls-size:                             IA-64 Options.      (line  112)
  * mtoc:                                  RS/6000 and PowerPC Options.
!                                                              (line  518)
! * mtomcat-stats:                         FRV Options.        (line  209)
! * mtoplevel-symbols:                     MMIX Options.       (line   40)
  * mtp:                                   ARM Options.        (line  294)
  * mtpcs-frame:                           ARM Options.        (line  267)
  * mtpcs-leaf-frame:                      ARM Options.        (line  273)
  * mtpf-trace:                            S/390 and zSeries Options.
!                                                              (line  131)
  * mtrap-precision:                       DEC Alpha Options.  (line  109)
- * mtune <1>:                             x86 Options.        (line  227)
- * mtune <2>:                             Visium Options.     (line   47)
- * mtune <3>:                             SPARC Options.      (line  181)
- * mtune <4>:                             S/390 and zSeries Options.
-                                                              (line  124)
- * mtune <5>:                             RS/6000 and PowerPC Options.
-                                                              (line  114)
- * mtune <6>:                             MN10300 Options.    (line   30)
- * mtune <7>:                             MIPS Options.       (line   65)
- * mtune <8>:                             M680x0 Options.     (line   70)
- * mtune <9>:                             IA-64 Options.      (line  116)
- * mtune <10>:                            DEC Alpha Options.  (line  259)
- * mtune <11>:                            CRIS Options.       (line   16)
- * mtune <12>:                            ARM Options.        (line   87)
- * mtune <13>:                            ARC Options.        (line  305)
  * mtune:                                 AArch64 Options.    (line   96)
! * mtune-ctrl=FEATURE-LIST:               x86 Options.        (line  654)
! * mucb-mcount:                           ARC Options.        (line  180)
  * muclibc:                               GNU/Linux Options.  (line   13)
  * muls:                                  Score Options.      (line   18)
! * multcost:                              ARC Options.        (line  395)
! * multcost=NUMBER:                       SH Options.         (line  305)
! * multi_module:                          Darwin Options.     (line  196)
! * multilib-library-pic:                  FRV Options.        (line   89)
  * multiply-enabled:                      LM32 Options.       (line   15)
  * multiply_defined:                      Darwin Options.     (line  196)
  * multiply_defined_unused:               Darwin Options.     (line  196)
! * munalign-prob-threshold:               ARC Options.        (line  334)
  * munaligned-access:                     ARM Options.        (line  326)
! * munaligned-doubles:                    SPARC Options.      (line   74)
  * municode:                              x86 Windows Options.
                                                               (line   30)
! * muninit-const-in-rodata:               MIPS Options.       (line  506)
  * munix:                                 VAX Options.        (line    9)
  * munix-asm:                             PDP-11 Options.     (line   68)
! * munsafe-dma:                           SPU Options.        (line   17)
  * mupdate:                               RS/6000 and PowerPC Options.
!                                                              (line  440)
  * mupper-regs:                           RS/6000 and PowerPC Options.
!                                                              (line  277)
  * mupper-regs-df:                        RS/6000 and PowerPC Options.
!                                                              (line  261)
  * mupper-regs-sf:                        RS/6000 and PowerPC Options.
!                                                              (line  269)
  * muser-enabled:                         LM32 Options.       (line   21)
  * muser-mode <1>:                        Visium Options.     (line   57)
! * muser-mode:                            SPARC Options.      (line   86)
! * musermode:                             SH Options.         (line  297)
  * mv3push:                               NDS32 Options.      (line   33)
  * mv850:                                 V850 Options.       (line   49)
  * mv850e:                                V850 Options.       (line   79)
--- 50454,50616 ----
  * msmall-data-limit:                     RX Options.         (line   47)
  * msmall-divides:                        MicroBlaze Options. (line   39)
  * msmall-exec:                           S/390 and zSeries Options.
!                                                              (line   79)
! * msmall-mem:                            SPU Options.        (line   38)
  * msmall-model:                          FR30 Options.       (line    9)
  * msmall-text:                           DEC Alpha Options.  (line  205)
  * msmall16:                              Adapteva Epiphany Options.
!                                                              (line   66)
! * msmallc:                               Nios II Options.    (line  268)
! * msmartmips:                            MIPS Options.       (line  364)
  * msoft-float:                           ARC Options.        (line   75)
! * msoft-float <1>:                       DEC Alpha Options.  (line   10)
! * msoft-float <2>:                       FRV Options.        (line   27)
! * msoft-float <3>:                       HPPA Options.       (line   84)
! * msoft-float <4>:                       M680x0 Options.     (line  200)
! * msoft-float <5>:                       MicroBlaze Options. (line    7)
! * msoft-float <6>:                       MIPS Options.       (line  268)
! * msoft-float <7>:                       PDP-11 Options.     (line   13)
! * msoft-float <8>:                       RS/6000 and PowerPC Options.
!                                                              (line  396)
! * msoft-float <9>:                       S/390 and zSeries Options.
!                                                              (line   11)
! * msoft-float <10>:                      SPARC Options.      (line   39)
! * msoft-float <11>:                      V850 Options.       (line  113)
! * msoft-float <12>:                      Visium Options.     (line   24)
! * msoft-float <13>:                      x86 Options.        (line  341)
! * msoft-quad-float:                      SPARC Options.      (line   59)
! * msp8:                                  AVR Options.        (line  203)
  * mspace:                                V850 Options.       (line   30)
  * mspe:                                  RS/6000 and PowerPC Options.
!                                                              (line  203)
! * mspecld-anomaly:                       Blackfin Options.   (line   50)
  * mspfp:                                 ARC Options.        (line   62)
  * mspfp-compact:                         ARC Options.        (line   63)
  * mspfp-fast:                            ARC Options.        (line   67)
! * mspfp_compact:                         ARC Options.        (line  379)
! * mspfp_fast:                            ARC Options.        (line  382)
! * msplit-addresses:                      MIPS Options.       (line  531)
  * msplit-vecmove-early:                  Adapteva Epiphany Options.
!                                                              (line  126)
! * msse:                                  x86 Options.        (line  576)
! * msse2avx:                              x86 Options.        (line  894)
! * msseregparm:                           x86 Options.        (line  477)
  * mstack-align:                          CRIS Options.       (line   55)
! * mstack-bias:                           SPARC Options.      (line  313)
! * mstack-check-l1:                       Blackfin Options.   (line   76)
  * mstack-guard:                          S/390 and zSeries Options.
!                                                              (line  154)
  * mstack-increment:                      MCore Options.      (line   50)
  * mstack-offset:                         Adapteva Epiphany Options.
                                                               (line   37)
! * mstack-protector-guard=GUARD:          x86 Options.        (line  943)
  * mstack-size:                           S/390 and zSeries Options.
!                                                              (line  154)
! * mstackrealign:                         x86 Options.        (line  520)
! * mstdmain:                              SPU Options.        (line   44)
  * mstrict-align:                         AArch64 Options.    (line   49)
! * mstrict-align <1>:                     M680x0 Options.     (line  283)
! * mstrict-align <2>:                     RS/6000 and PowerPC Options.
!                                                              (line  497)
! * mstrict-X:                             AVR Options.        (line  216)
  * mstring:                               RS/6000 and PowerPC Options.
!                                                              (line  433)
! * mstringop-strategy=ALG:                x86 Options.        (line  842)
! * mstructure-size-boundary:              ARM Options.        (line  176)
  * msv-mode:                              Visium Options.     (line   52)
  * msvr4-struct-return:                   RS/6000 and PowerPC Options.
!                                                              (line  638)
  * mswap:                                 ARC Options.        (line   82)
! * mswape:                                ARC Options.        (line  114)
! * msym32:                                MIPS Options.       (line  429)
! * msynci:                                MIPS Options.       (line  783)
! * msys-crt0:                             Nios II Options.    (line  272)
! * msys-lib:                              Nios II Options.    (line  276)
  * MT:                                    Preprocessor Options.
                                                               (line  251)
  * mtarget-align:                         Xtensa Options.     (line   59)
! * mtas:                                  SH Options.         (line  280)
! * mtbm:                                  x86 Options.        (line  615)
  * mtda:                                  V850 Options.       (line   34)
! * mtelephony:                            ARC Options.        (line  119)
  * mtext-section-literals:                Xtensa Options.     (line   47)
  * mtf:                                   MeP Options.        (line  121)
  * mthread:                               x86 Windows Options.
                                                               (line   26)
! * mthreads:                              x86 Options.        (line  819)
! * mthumb:                                ARM Options.        (line  260)
  * mthumb-interwork:                      ARM Options.        (line   24)
! * mtiny-stack:                           AVR Options.        (line  230)
  * mtiny=:                                MeP Options.        (line  125)
! * mTLS:                                  FRV Options.        (line   90)
! * mtls:                                  FRV Options.        (line   94)
  * mtls-dialect:                          ARM Options.        (line  302)
+ * mtls-dialect <1>:                      x86 Options.        (line  797)
  * mtls-dialect=desc:                     AArch64 Options.    (line   58)
  * mtls-dialect=traditional:              AArch64 Options.    (line   62)
! * mtls-direct-seg-refs:                  x86 Options.        (line  884)
  * mtls-markers:                          RS/6000 and PowerPC Options.
!                                                              (line  819)
  * mtls-size:                             IA-64 Options.      (line  112)
  * mtoc:                                  RS/6000 and PowerPC Options.
!                                                              (line  522)
! * mtomcat-stats:                         FRV Options.        (line  254)
! * mtoplevel-symbols:                     MMIX Options.       (line   39)
  * mtp:                                   ARM Options.        (line  294)
  * mtpcs-frame:                           ARM Options.        (line  267)
  * mtpcs-leaf-frame:                      ARM Options.        (line  273)
  * mtpf-trace:                            S/390 and zSeries Options.
!                                                              (line  129)
  * mtrap-precision:                       DEC Alpha Options.  (line  109)
  * mtune:                                 AArch64 Options.    (line   96)
! * mtune <1>:                             ARC Options.        (line  301)
! * mtune <2>:                             ARC Options.        (line  385)
! * mtune <3>:                             ARM Options.        (line   87)
! * mtune <4>:                             CRIS Options.       (line   17)
! * mtune <5>:                             DEC Alpha Options.  (line  259)
! * mtune <6>:                             IA-64 Options.      (line  116)
! * mtune <7>:                             M680x0 Options.     (line   68)
! * mtune <8>:                             MIPS Options.       (line   64)
! * mtune <9>:                             MN10300 Options.    (line   30)
! * mtune <10>:                            RS/6000 and PowerPC Options.
!                                                              (line  113)
! * mtune <11>:                            S/390 and zSeries Options.
!                                                              (line  122)
! * mtune <12>:                            SPARC Options.      (line  180)
! * mtune <13>:                            Visium Options.     (line   47)
! * mtune <14>:                            x86 Options.        (line  222)
! * mtune-ctrl=FEATURE-LIST:               x86 Options.        (line  648)
! * mucb-mcount:                           ARC Options.        (line  178)
  * muclibc:                               GNU/Linux Options.  (line   13)
  * muls:                                  Score Options.      (line   18)
! * multcost:                              ARC Options.        (line  390)
! * multcost=NUMBER:                       SH Options.         (line  302)
! * multilib-library-pic:                  FRV Options.        (line  110)
  * multiply-enabled:                      LM32 Options.       (line   15)
  * multiply_defined:                      Darwin Options.     (line  196)
  * multiply_defined_unused:               Darwin Options.     (line  196)
! * multi_module:                          Darwin Options.     (line  196)
! * munalign-prob-threshold:               ARC Options.        (line  329)
  * munaligned-access:                     ARM Options.        (line  326)
! * munaligned-doubles:                    SPARC Options.      (line   73)
  * municode:                              x86 Windows Options.
                                                               (line   30)
! * muninit-const-in-rodata:               MIPS Options.       (line  501)
  * munix:                                 VAX Options.        (line    9)
  * munix-asm:                             PDP-11 Options.     (line   68)
! * munsafe-dma:                           SPU Options.        (line   18)
  * mupdate:                               RS/6000 and PowerPC Options.
!                                                              (line  444)
  * mupper-regs:                           RS/6000 and PowerPC Options.
!                                                              (line  282)
  * mupper-regs-df:                        RS/6000 and PowerPC Options.
!                                                              (line  266)
  * mupper-regs-sf:                        RS/6000 and PowerPC Options.
!                                                              (line  274)
  * muser-enabled:                         LM32 Options.       (line   21)
+ * muser-mode:                            SPARC Options.      (line   85)
  * muser-mode <1>:                        Visium Options.     (line   57)
! * musermode:                             SH Options.         (line  295)
  * mv3push:                               NDS32 Options.      (line   33)
  * mv850:                                 V850 Options.       (line   49)
  * mv850e:                                V850 Options.       (line   79)
*************** look up both forms.
*** 50962,50994 ****
  * mv850e2v4:                             V850 Options.       (line   57)
  * mv850e3v5:                             V850 Options.       (line   52)
  * mv850es:                               V850 Options.       (line   75)
! * mv8plus:                               SPARC Options.      (line  195)
! * mveclibabi <1>:                        x86 Options.        (line  772)
  * mveclibabi:                            RS/6000 and PowerPC Options.
!                                                              (line  896)
! * mvect8-ret-in-mem:                     x86 Options.        (line  493)
! * mvirt:                                 MIPS Options.       (line  409)
! * mvis:                                  SPARC Options.      (line  202)
! * mvis2:                                 SPARC Options.      (line  208)
! * mvis3:                                 SPARC Options.      (line  216)
! * mvliw-branch:                          FRV Options.        (line  164)
  * mvms-return-codes:                     VMS Options.        (line    9)
  * mvolatile-asm-stop:                    IA-64 Options.      (line   32)
! * mvolatile-cache:                       ARC Options.        (line  185)
! * mvr4130-align:                         MIPS Options.       (line  785)
  * mvrsave:                               RS/6000 and PowerPC Options.
!                                                              (line  174)
  * mvsx:                                  RS/6000 and PowerPC Options.
!                                                              (line  218)
  * mvxworks:                              RS/6000 and PowerPC Options.
!                                                              (line  703)
! * mvzeroupper:                           x86 Options.        (line  682)
  * mwarn-cell-microcode:                  RS/6000 and PowerPC Options.
!                                                              (line  180)
  * mwarn-dynamicstack:                    S/390 and zSeries Options.
!                                                              (line  150)
  * mwarn-framesize:                       S/390 and zSeries Options.
!                                                              (line  142)
  * mwarn-multiple-fast-interrupts:        RX Options.         (line  143)
  * mwarn-reloc:                           SPU Options.        (line   10)
  * mwide-bitfields:                       MCore Options.      (line   23)
--- 50620,50652 ----
  * mv850e2v4:                             V850 Options.       (line   57)
  * mv850e3v5:                             V850 Options.       (line   52)
  * mv850es:                               V850 Options.       (line   75)
! * mv8plus:                               SPARC Options.      (line  194)
  * mveclibabi:                            RS/6000 and PowerPC Options.
!                                                              (line  897)
! * mveclibabi <1>:                        x86 Options.        (line  765)
! * mvect8-ret-in-mem:                     x86 Options.        (line  487)
! * mvirt:                                 MIPS Options.       (line  405)
! * mvis:                                  SPARC Options.      (line  201)
! * mvis2:                                 SPARC Options.      (line  207)
! * mvis3:                                 SPARC Options.      (line  215)
! * mvliw-branch:                          FRV Options.        (line  201)
  * mvms-return-codes:                     VMS Options.        (line    9)
  * mvolatile-asm-stop:                    IA-64 Options.      (line   32)
! * mvolatile-cache:                       ARC Options.        (line  183)
! * mvr4130-align:                         MIPS Options.       (line  772)
  * mvrsave:                               RS/6000 and PowerPC Options.
!                                                              (line  173)
  * mvsx:                                  RS/6000 and PowerPC Options.
!                                                              (line  217)
  * mvxworks:                              RS/6000 and PowerPC Options.
!                                                              (line  707)
! * mvzeroupper:                           x86 Options.        (line  675)
  * mwarn-cell-microcode:                  RS/6000 and PowerPC Options.
!                                                              (line  179)
  * mwarn-dynamicstack:                    S/390 and zSeries Options.
!                                                              (line  148)
  * mwarn-framesize:                       S/390 and zSeries Options.
!                                                              (line  140)
  * mwarn-multiple-fast-interrupts:        RX Options.         (line  143)
  * mwarn-reloc:                           SPU Options.        (line   10)
  * mwide-bitfields:                       MCore Options.      (line   23)
*************** look up both forms.
*** 50997,51010 ****
  * mwindows:                              x86 Windows Options.
                                                               (line   41)
  * mword-relocations:                     ARM Options.        (line  313)
! * mx32:                                  x86 Options.        (line  965)
! * mxgot <1>:                             MIPS Options.       (line  231)
! * mxgot:                                 M680x0 Options.     (line  319)
  * mxilinx-fpu:                           RS/6000 and PowerPC Options.
!                                                              (line  413)
  * mxl-barrel-shift:                      MicroBlaze Options. (line   33)
  * mxl-compat:                            RS/6000 and PowerPC Options.
!                                                              (line  349)
  * mxl-float-convert:                     MicroBlaze Options. (line   51)
  * mxl-float-sqrt:                        MicroBlaze Options. (line   54)
  * mxl-gp-opt:                            MicroBlaze Options. (line   45)
--- 50655,50668 ----
  * mwindows:                              x86 Windows Options.
                                                               (line   41)
  * mword-relocations:                     ARM Options.        (line  313)
! * mx32:                                  x86 Options.        (line  955)
! * mxgot:                                 M680x0 Options.     (line  315)
! * mxgot <1>:                             MIPS Options.       (line  227)
  * mxilinx-fpu:                           RS/6000 and PowerPC Options.
!                                                              (line  417)
  * mxl-barrel-shift:                      MicroBlaze Options. (line   33)
  * mxl-compat:                            RS/6000 and PowerPC Options.
!                                                              (line  354)
  * mxl-float-convert:                     MicroBlaze Options. (line   51)
  * mxl-float-sqrt:                        MicroBlaze Options. (line   54)
  * mxl-gp-opt:                            MicroBlaze Options. (line   45)
*************** look up both forms.
*** 51014,51042 ****
  * mxl-soft-div:                          MicroBlaze Options. (line   30)
  * mxl-soft-mul:                          MicroBlaze Options. (line   27)
  * mxl-stack-check:                       MicroBlaze Options. (line   42)
! * mxop:                                  x86 Options.        (line  607)
! * mxpa:                                  MIPS Options.       (line  414)
! * mxsave:                                x86 Options.        (line  616)
! * mxsavec:                               x86 Options.        (line  618)
! * mxsaveopt:                             x86 Options.        (line  617)
! * mxsaves:                               x86 Options.        (line  619)
! * mxy:                                   ARC Options.        (line  125)
  * myellowknife:                          RS/6000 and PowerPC Options.
!                                                              (line  698)
  * mzarch:                                S/390 and zSeries Options.
!                                                              (line   95)
  * mzda:                                  V850 Options.       (line   45)
! * mzdcbranch:                            SH Options.         (line  473)
! * mzero-extend:                          MMIX Options.       (line   27)
  * no-canonical-prefixes:                 Overall Options.    (line  334)
  * no-integrated-cpp:                     Preprocessor Options.
                                                               (line   34)
! * no-sysroot-suffix:                     Directory Options.  (line  111)
! * no_dead_strip_inits_and_terms:         Darwin Options.     (line  196)
  * noall_load:                            Darwin Options.     (line  196)
! * nocpp:                                 MIPS Options.       (line  611)
  * nodefaultlibs:                         Link Options.       (line   68)
! * nodevicelib:                           AVR Options.        (line  232)
  * nofixprebinding:                       Darwin Options.     (line  196)
  * nofpu:                                 RX Options.         (line   17)
  * nolibdld:                              HPPA Options.       (line  181)
--- 50672,50699 ----
  * mxl-soft-div:                          MicroBlaze Options. (line   30)
  * mxl-soft-mul:                          MicroBlaze Options. (line   27)
  * mxl-stack-check:                       MicroBlaze Options. (line   42)
! * mxop:                                  x86 Options.        (line  601)
! * mxpa:                                  MIPS Options.       (line  410)
! * mxsave:                                x86 Options.        (line  610)
! * mxsavec:                               x86 Options.        (line  612)
! * mxsaveopt:                             x86 Options.        (line  611)
! * mxsaves:                               x86 Options.        (line  613)
! * mxy:                                   ARC Options.        (line  124)
  * myellowknife:                          RS/6000 and PowerPC Options.
!                                                              (line  702)
  * mzarch:                                S/390 and zSeries Options.
!                                                              (line   94)
  * mzda:                                  V850 Options.       (line   45)
! * mzdcbranch:                            SH Options.         (line  465)
! * mzero-extend:                          MMIX Options.       (line   26)
  * no-canonical-prefixes:                 Overall Options.    (line  334)
  * no-integrated-cpp:                     Preprocessor Options.
                                                               (line   34)
! * no-sysroot-suffix:                     Directory Options.  (line  109)
  * noall_load:                            Darwin Options.     (line  196)
! * nocpp:                                 MIPS Options.       (line  605)
  * nodefaultlibs:                         Link Options.       (line   68)
! * nodevicelib:                           AVR Options.        (line  233)
  * nofixprebinding:                       Darwin Options.     (line  196)
  * nofpu:                                 RX Options.         (line   17)
  * nolibdld:                              HPPA Options.       (line  181)
*************** look up both forms.
*** 51046,51647 ****
  * noseglinkedit:                         Darwin Options.     (line  196)
  * nostartfiles:                          Link Options.       (line   63)
  * nostdinc:                              Preprocessor Options.
!                                                              (line  399)
! * nostdinc++ <1>:                        Preprocessor Options.
!                                                              (line  404)
  * nostdinc++:                            C++ Dialect Options.
!                                                              (line  431)
  * nostdlib:                              Link Options.       (line   80)
! * o:                                     Preprocessor Options.
!                                                              (line   87)
! * O:                                     Optimize Options.   (line   39)
  * o:                                     Overall Options.    (line  192)
  * O0:                                    Optimize Options.   (line  145)
  * O1:                                    Optimize Options.   (line   39)
  * O2:                                    Optimize Options.   (line   91)
  * O3:                                    Optimize Options.   (line  136)
  * Ofast:                                 Optimize Options.   (line  159)
! * Og:                                    Optimize Options.   (line  166)
  * Os:                                    Optimize Options.   (line  149)
  * P:                                     Preprocessor Options.
!                                                              (line  648)
! * p:                                     Debugging Options.  (line  640)
  * pagezero_size:                         Darwin Options.     (line  196)
! * param:                                 Optimize Options.   (line 2438)
  * pass-exit-codes:                       Overall Options.    (line  150)
- * pedantic <1>:                          Warnings and Errors.
-                                                              (line   25)
- * pedantic <2>:                          Alternate Keywords. (line   30)
- * pedantic <3>:                          C Extensions.       (line    6)
- * pedantic <4>:                          Preprocessor Options.
-                                                              (line  175)
- * pedantic <5>:                          Warning Options.    (line   82)
  * pedantic:                              Standards.          (line   16)
! * pedantic-errors <1>:                   Warnings and Errors.
                                                               (line   25)
- * pedantic-errors <2>:                   Non-bugs.           (line  216)
- * pedantic-errors <3>:                   Preprocessor Options.
-                                                              (line  180)
- * pedantic-errors <4>:                   Warning Options.    (line  124)
  * pedantic-errors:                       Standards.          (line   16)
! * pg:                                    Debugging Options.  (line  646)
  * pie:                                   Link Options.       (line  105)
  * pipe:                                  Overall Options.    (line  215)
  * prebind:                               Darwin Options.     (line  196)
  * prebind_all_twolevel_modules:          Darwin Options.     (line  196)
! * print-file-name:                       Debugging Options.  (line 1612)
! * print-libgcc-file-name:                Debugging Options.  (line 1646)
! * print-multi-directory:                 Debugging Options.  (line 1618)
! * print-multi-lib:                       Debugging Options.  (line 1623)
! * print-multi-os-directory:              Debugging Options.  (line 1630)
! * print-multiarch:                       Debugging Options.  (line 1639)
  * print-objc-runtime-info:               Objective-C and Objective-C++ Dialect Options.
                                                               (line  217)
! * print-prog-name:                       Debugging Options.  (line 1643)
! * print-search-dirs:                     Debugging Options.  (line 1654)
! * print-sysroot:                         Debugging Options.  (line 1667)
! * print-sysroot-headers-suffix:          Debugging Options.  (line 1674)
  * private_bundle:                        Darwin Options.     (line  196)
- * pthread <1>:                           Solaris 2 Options.  (line   38)
  * pthread:                               RS/6000 and PowerPC Options.
!                                                              (line  824)
! * pthreads:                              Solaris 2 Options.  (line   32)
! * Q:                                     Debugging Options.  (line  652)
  * Qn:                                    System V Options.   (line   18)
  * Qy:                                    System V Options.   (line   14)
  * rdynamic:                              Link Options.       (line  111)
  * read_only_relocs:                      Darwin Options.     (line  196)
  * remap:                                 Preprocessor Options.
!                                                              (line  696)
! * s:                                     Link Options.       (line  118)
! * S <1>:                                 Link Options.       (line   20)
  * S:                                     Overall Options.    (line  175)
! * save-temps:                            Debugging Options.  (line 1519)
! * save-temps=obj:                        Debugging Options.  (line 1545)
  * sectalign:                             Darwin Options.     (line  196)
  * sectcreate:                            Darwin Options.     (line  196)
  * sectobjectsymbols:                     Darwin Options.     (line  196)
  * sectorder:                             Darwin Options.     (line  196)
  * seg1addr:                              Darwin Options.     (line  196)
- * seg_addr_table:                        Darwin Options.     (line  196)
- * seg_addr_table_filename:               Darwin Options.     (line  196)
  * segaddr:                               Darwin Options.     (line  196)
  * seglinkedit:                           Darwin Options.     (line  196)
  * segprot:                               Darwin Options.     (line  196)
  * segs_read_only_addr:                   Darwin Options.     (line  196)
  * segs_read_write_addr:                  Darwin Options.     (line  196)
! * shared:                                Link Options.       (line  127)
! * shared-libgcc:                         Link Options.       (line  135)
  * short-calls:                           Adapteva Epiphany Options.
                                                               (line   61)
  * sim:                                   CRIS Options.       (line   95)
  * sim2:                                  CRIS Options.       (line  101)
  * single_module:                         Darwin Options.     (line  196)
! * specs:                                 Directory Options.  (line   88)
! * static <1>:                            HPPA Options.       (line  185)
! * static <2>:                            Darwin Options.     (line  196)
  * static:                                Link Options.       (line  122)
! * static-libasan:                        Link Options.       (line  170)
! * static-libgcc:                         Link Options.       (line  135)
! * static-liblsan:                        Link Options.       (line  188)
! * static-libmpx:                         Link Options.       (line  206)
! * static-libmpxwrappers:                 Link Options.       (line  215)
! * static-libstdc++:                      Link Options.       (line  225)
! * static-libtsan:                        Link Options.       (line  179)
! * static-libubsan:                       Link Options.       (line  197)
! * std <1>:                               Non-bugs.           (line  107)
! * std <2>:                               Other Builtins.     (line   22)
! * std <3>:                               C Dialect Options.  (line   47)
  * std:                                   Standards.          (line   16)
  * std=:                                  Preprocessor Options.
!                                                              (line  338)
  * sub_library:                           Darwin Options.     (line  196)
  * sub_umbrella:                          Darwin Options.     (line  196)
! * symbolic:                              Link Options.       (line  236)
! * sysroot:                               Directory Options.  (line   96)
! * T:                                     Link Options.       (line  242)
! * target-help <1>:                       Preprocessor Options.
!                                                              (line  701)
  * target-help:                           Overall Options.    (line  230)
  * threads:                               HPPA Options.       (line  198)
! * time:                                  Debugging Options.  (line 1560)
  * tno-android-cc:                        GNU/Linux Options.  (line   31)
  * tno-android-ld:                        GNU/Linux Options.  (line   35)
  * traditional <1>:                       Incompatibilities.  (line    6)
! * traditional:                           C Dialect Options.  (line  346)
  * traditional-cpp <1>:                   Preprocessor Options.
!                                                              (line  679)
! * traditional-cpp:                       C Dialect Options.  (line  346)
  * trigraphs <1>:                         Preprocessor Options.
!                                                              (line  683)
! * trigraphs:                             C Dialect Options.  (line  341)
  * twolevel_namespace:                    Darwin Options.     (line  196)
- * u:                                     Link Options.       (line  274)
  * U:                                     Preprocessor Options.
                                                               (line   69)
  * umbrella:                              Darwin Options.     (line  196)
  * undef:                                 Preprocessor Options.
                                                               (line   73)
  * undefined:                             Darwin Options.     (line  196)
  * unexported_symbols_list:               Darwin Options.     (line  196)
- * v <1>:                                 Preprocessor Options.
-                                                              (line  705)
  * v:                                     Overall Options.    (line  203)
! * version <1>:                           Preprocessor Options.
!                                                              (line  718)
  * version:                               Overall Options.    (line  338)
! * W:                                     Incompatibilities.  (line   64)
! * w:                                     Preprocessor Options.
!                                                              (line  171)
! * W:                                     Warning Options.    (line  183)
  * w:                                     Warning Options.    (line   25)
  * Wa:                                    Assembler Options.  (line    9)
  * Wabi:                                  C++ Dialect Options.
!                                                              (line  439)
  * Wabi-tag:                              C++ Dialect Options.
!                                                              (line  531)
! * Waddr-space-convert:                   AVR Options.        (line  235)
! * Waddress:                              Warning Options.    (line 1353)
! * Waggregate-return:                     Warning Options.    (line 1386)
! * Waggressive-loop-optimizations:        Warning Options.    (line 1391)
! * Wall <1>:                              Standard Libraries. (line    6)
! * Wall <2>:                              Preprocessor Options.
                                                               (line   93)
! * Wall:                                  Warning Options.    (line  133)
! * Warray-bounds:                         Warning Options.    (line  895)
  * Wassign-intercept:                     Objective-C and Objective-C++ Dialect Options.
                                                               (line  171)
! * Wattributes:                           Warning Options.    (line 1396)
! * Wbad-function-cast:                    Warning Options.    (line 1160)
! * Wbool-compare:                         Warning Options.    (line  911)
! * Wbuiltin-macro-redefined:              Warning Options.    (line 1402)
! * Wc++-compat:                           Warning Options.    (line 1182)
! * Wc++11-compat:                         Warning Options.    (line 1187)
! * Wc++14-compat:                         Warning Options.    (line 1193)
! * Wc90-c99-compat:                       Warning Options.    (line 1165)
! * Wc99-c11-compat:                       Warning Options.    (line 1173)
! * Wcast-align:                           Warning Options.    (line 1213)
! * Wcast-qual:                            Warning Options.    (line 1197)
! * Wchar-subscripts:                      Warning Options.    (line  222)
! * Wclobbered:                            Warning Options.    (line 1233)
  * Wcomment <1>:                          Preprocessor Options.
                                                               (line  101)
- * Wcomment:                              Warning Options.    (line  227)
  * Wcomments:                             Preprocessor Options.
                                                               (line  101)
! * Wconditionally-supported:              Warning Options.    (line 1237)
! * Wconversion:                           Warning Options.    (line 1240)
! * Wconversion-null:                      Warning Options.    (line 1258)
  * Wctor-dtor-privacy:                    C++ Dialect Options.
!                                                              (line  536)
! * Wdate-time:                            Warning Options.    (line 1266)
! * Wdeclaration-after-statement:          Warning Options.    (line 1071)
! * Wdelete-incomplete:                    Warning Options.    (line 1271)
  * Wdelete-non-virtual-dtor:              C++ Dialect Options.
!                                                              (line  543)
! * Wdeprecated:                           Warning Options.    (line 1525)
! * Wdeprecated-declarations:              Warning Options.    (line 1529)
! * Wdisabled-optimization:                Warning Options.    (line 1693)
! * Wdiscarded-array-qualifiers:           Warning Options.    (line  926)
! * Wdiscarded-qualifiers:                 Warning Options.    (line  920)
! * Wdiv-by-zero:                          Warning Options.    (line  944)
! * Wdouble-promotion:                     Warning Options.    (line  251)
  * weak_reference_mismatches:             Darwin Options.     (line  196)
  * Weffc++:                               C++ Dialect Options.
!                                                              (line  623)
! * Wempty-body:                           Warning Options.    (line 1278)
  * Wendif-labels <1>:                     Preprocessor Options.
                                                               (line  148)
! * Wendif-labels:                         Warning Options.    (line 1080)
! * Wenum-compare:                         Warning Options.    (line 1282)
  * Werror <1>:                            Preprocessor Options.
                                                               (line  161)
- * Werror:                                Warning Options.    (line   28)
  * Werror=:                               Warning Options.    (line   31)
! * Wextra:                                Warning Options.    (line  183)
  * Wfatal-errors:                         Warning Options.    (line   48)
! * Wfloat-conversion:                     Warning Options.    (line 1312)
! * Wfloat-equal:                          Warning Options.    (line  970)
! * Wformat <1>:                           Function Attributes.
!                                                              (line  424)
! * Wformat:                               Warning Options.    (line  270)
! * Wformat-contains-nul:                  Warning Options.    (line  307)
! * Wformat-extra-args:                    Warning Options.    (line  311)
  * Wformat-nonliteral <1>:                Function Attributes.
!                                                              (line  490)
! * Wformat-nonliteral:                    Warning Options.    (line  335)
! * Wformat-security:                      Warning Options.    (line  340)
! * Wformat-signedness:                    Warning Options.    (line  352)
! * Wformat-y2k:                           Warning Options.    (line  357)
! * Wformat-zero-length:                   Warning Options.    (line  325)
! * Wformat=:                              Warning Options.    (line  270)
  * Wformat=1:                             Warning Options.    (line  297)
! * Wformat=2:                             Warning Options.    (line  330)
! * Wframe-larger-than:                    Warning Options.    (line 1099)
! * Wfree-nonheap-object:                  Warning Options.    (line 1108)
  * whatsloaded:                           Darwin Options.     (line  196)
  * whyload:                               Darwin Options.     (line  196)
! * Wignored-qualifiers:                   Warning Options.    (line  397)
! * Wimplicit:                             Warning Options.    (line  393)
! * Wimplicit-function-declaration:        Warning Options.    (line  387)
! * Wimplicit-int:                         Warning Options.    (line  383)
! * Wincompatible-pointer-types:           Warning Options.    (line  932)
! * Winherited-variadic-ctor:              Warning Options.    (line 1605)
! * Winit-self:                            Warning Options.    (line  368)
  * Winline <1>:                           Inline.             (line   63)
! * Winline:                               Warning Options.    (line 1610)
! * Wint-conversion:                       Warning Options.    (line  938)
! * Wint-to-pointer-cast:                  Warning Options.    (line 1635)
! * Winvalid-offsetof:                     Warning Options.    (line 1623)
! * Winvalid-pch:                          Warning Options.    (line 1644)
! * Wjump-misses-init:                     Warning Options.    (line 1288)
! * Wl:                                    Link Options.       (line  266)
! * Wlarger-than-LEN:                      Warning Options.    (line 1096)
! * Wlarger-than=LEN:                      Warning Options.    (line 1096)
  * Wliteral-suffix:                       C++ Dialect Options.
!                                                              (line  550)
! * Wlogical-not-parentheses:              Warning Options.    (line 1371)
! * Wlogical-op:                           Warning Options.    (line 1366)
! * Wlong-long:                            Warning Options.    (line 1648)
! * Wmain:                                 Warning Options.    (line  408)
! * Wmaybe-uninitialized:                  Warning Options.    (line  686)
! * Wmemset-transposed-args:               Warning Options.    (line 1342)
! * Wmissing-braces:                       Warning Options.    (line  415)
! * Wmissing-declarations:                 Warning Options.    (line 1441)
! * Wmissing-field-initializers:           Warning Options.    (line 1451)
! * Wmissing-format-attribute:             Warning Options.    (line  850)
! * Wmissing-include-dirs:                 Warning Options.    (line  426)
! * Wmissing-parameter-type:               Warning Options.    (line 1423)
! * Wmissing-prototypes:                   Warning Options.    (line 1431)
! * Wmultichar:                            Warning Options.    (line 1475)
  * Wnarrowing:                            C++ Dialect Options.
!                                                              (line  571)
! * Wnested-externs:                       Warning Options.    (line 1602)
  * Wno-abi:                               C++ Dialect Options.
!                                                              (line  439)
! * Wno-address:                           Warning Options.    (line 1353)
! * Wno-aggregate-return:                  Warning Options.    (line 1386)
! * Wno-aggressive-loop-optimizations:     Warning Options.    (line 1391)
! * Wno-all:                               Warning Options.    (line  133)
! * Wno-array-bounds:                      Warning Options.    (line  895)
  * Wno-assign-intercept:                  Objective-C and Objective-C++ Dialect Options.
                                                               (line  171)
! * Wno-attributes:                        Warning Options.    (line 1396)
! * Wno-bad-function-cast:                 Warning Options.    (line 1160)
! * Wno-bool-compare:                      Warning Options.    (line  911)
! * Wno-builtin-macro-redefined:           Warning Options.    (line 1402)
! * Wno-c90-c99-compat:                    Warning Options.    (line 1165)
! * Wno-c99-c11-compat:                    Warning Options.    (line 1173)
! * Wno-cast-align:                        Warning Options.    (line 1213)
! * Wno-cast-qual:                         Warning Options.    (line 1197)
! * Wno-char-subscripts:                   Warning Options.    (line  222)
! * Wno-clobbered:                         Warning Options.    (line 1233)
! * Wno-comment:                           Warning Options.    (line  227)
! * Wno-conditionally-supported:           Warning Options.    (line 1237)
! * Wno-conversion:                        Warning Options.    (line 1240)
! * Wno-conversion-null:                   Warning Options.    (line 1258)
! * Wno-coverage-mismatch:                 Warning Options.    (line  232)
  * Wno-ctor-dtor-privacy:                 C++ Dialect Options.
!                                                              (line  536)
! * Wno-date-time:                         Warning Options.    (line 1266)
! * Wno-declaration-after-statement:       Warning Options.    (line 1071)
! * Wno-delete-incomplete:                 Warning Options.    (line 1271)
  * Wno-delete-non-virtual-dtor:           C++ Dialect Options.
!                                                              (line  543)
! * Wno-deprecated:                        Warning Options.    (line 1525)
! * Wno-deprecated-declarations:           Warning Options.    (line 1529)
! * Wno-disabled-optimization:             Warning Options.    (line 1693)
! * Wno-discarded-array-qualifiers:        Warning Options.    (line  926)
! * Wno-discarded-qualifiers:              Warning Options.    (line  920)
! * Wno-div-by-zero:                       Warning Options.    (line  944)
! * Wno-double-promotion:                  Warning Options.    (line  251)
  * Wno-effc++:                            C++ Dialect Options.
!                                                              (line  623)
! * Wno-empty-body:                        Warning Options.    (line 1278)
! * Wno-endif-labels:                      Warning Options.    (line 1080)
! * Wno-enum-compare:                      Warning Options.    (line 1282)
  * Wno-error:                             Warning Options.    (line   28)
  * Wno-error=:                            Warning Options.    (line   31)
! * Wno-extra:                             Warning Options.    (line  183)
  * Wno-fatal-errors:                      Warning Options.    (line   48)
! * Wno-float-conversion:                  Warning Options.    (line 1312)
! * Wno-float-equal:                       Warning Options.    (line  970)
! * Wno-format:                            Warning Options.    (line  270)
! * Wno-format-contains-nul:               Warning Options.    (line  307)
! * Wno-format-extra-args:                 Warning Options.    (line  311)
! * Wno-format-nonliteral:                 Warning Options.    (line  335)
! * Wno-format-security:                   Warning Options.    (line  340)
! * Wno-format-signedness:                 Warning Options.    (line  352)
! * Wno-format-y2k:                        Warning Options.    (line  357)
! * Wno-format-zero-length:                Warning Options.    (line  325)
! * Wno-free-nonheap-object:               Warning Options.    (line 1108)
! * Wno-ignored-qualifiers:                Warning Options.    (line  397)
! * Wno-implicit:                          Warning Options.    (line  393)
! * Wno-implicit-function-declaration:     Warning Options.    (line  387)
! * Wno-implicit-int:                      Warning Options.    (line  383)
! * Wno-incompatible-pointer-types:        Warning Options.    (line  932)
! * Wno-inherited-variadic-ctor:           Warning Options.    (line 1605)
! * Wno-init-self:                         Warning Options.    (line  368)
! * Wno-inline:                            Warning Options.    (line 1610)
! * Wno-int-conversion:                    Warning Options.    (line  938)
! * Wno-int-to-pointer-cast:               Warning Options.    (line 1635)
! * Wno-invalid-offsetof:                  Warning Options.    (line 1623)
! * Wno-invalid-pch:                       Warning Options.    (line 1644)
! * Wno-jump-misses-init:                  Warning Options.    (line 1288)
  * Wno-literal-suffix:                    C++ Dialect Options.
!                                                              (line  550)
! * Wno-logical-not-parentheses:           Warning Options.    (line 1371)
! * Wno-logical-op:                        Warning Options.    (line 1366)
! * Wno-long-long:                         Warning Options.    (line 1648)
! * Wno-main:                              Warning Options.    (line  408)
! * Wno-maybe-uninitialized:               Warning Options.    (line  686)
! * Wno-memset-transposed-args:            Warning Options.    (line 1342)
! * Wno-missing-braces:                    Warning Options.    (line  415)
! * Wno-missing-declarations:              Warning Options.    (line 1441)
! * Wno-missing-field-initializers:        Warning Options.    (line 1451)
! * Wno-missing-format-attribute:          Warning Options.    (line  850)
! * Wno-missing-include-dirs:              Warning Options.    (line  426)
! * Wno-missing-parameter-type:            Warning Options.    (line 1423)
! * Wno-missing-prototypes:                Warning Options.    (line 1431)
! * Wno-multichar:                         Warning Options.    (line 1475)
  * Wno-narrowing:                         C++ Dialect Options.
!                                                              (line  571)
! * Wno-nested-externs:                    Warning Options.    (line 1602)
  * Wno-noexcept:                          C++ Dialect Options.
!                                                              (line  584)
  * Wno-non-template-friend:               C++ Dialect Options.
!                                                              (line  660)
  * Wno-non-virtual-dtor:                  C++ Dialect Options.
!                                                              (line  590)
! * Wno-nonnull:                           Warning Options.    (line  361)
! * Wno-normalized:                        Warning Options.    (line 1481)
! * Wno-odr:                               Warning Options.    (line 1538)
  * Wno-old-style-cast:                    C++ Dialect Options.
!                                                              (line  676)
! * Wno-old-style-declaration:             Warning Options.    (line 1413)
! * Wno-old-style-definition:              Warning Options.    (line 1419)
! * Wno-overflow:                          Warning Options.    (line 1535)
! * Wno-overlength-strings:                Warning Options.    (line 1713)
  * Wno-overloaded-virtual:                C++ Dialect Options.
!                                                              (line  682)
! * Wno-override-init:                     Warning Options.    (line 1548)
! * Wno-packed:                            Warning Options.    (line 1556)
! * Wno-packed-bitfield-compat:            Warning Options.    (line 1573)
! * Wno-padded:                            Warning Options.    (line 1590)
! * Wno-parentheses:                       Warning Options.    (line  429)
! * Wno-pedantic-ms-format:                Warning Options.    (line 1140)
  * Wno-pmf-conversions <1>:               Bound member functions.
                                                               (line   35)
! * Wno-pmf-conversions:                   C++ Dialect Options.
!                                                              (line  701)
! * Wno-pointer-arith:                     Warning Options.    (line 1146)
! * Wno-pointer-sign:                      Warning Options.    (line 1702)
! * Wno-pointer-to-int-cast:               Warning Options.    (line 1640)
! * Wno-pragmas:                           Warning Options.    (line  736)
  * Wno-protocol:                          Objective-C and Objective-C++ Dialect Options.
                                                               (line  175)
! * Wno-redundant-decls:                   Warning Options.    (line 1597)
  * Wno-reorder:                           C++ Dialect Options.
!                                                              (line  598)
! * Wno-return-local-addr:                 Warning Options.    (line  524)
! * Wno-return-type:                       Warning Options.    (line  528)
  * Wno-selector:                          Objective-C and Objective-C++ Dialect Options.
                                                               (line  185)
! * Wno-sequence-point:                    Warning Options.    (line  478)
! * Wno-shadow:                            Warning Options.    (line 1084)
! * Wno-shadow-ivar:                       Warning Options.    (line 1092)
! * Wno-shift-count-negative:              Warning Options.    (line  543)
! * Wno-shift-count-overflow:              Warning Options.    (line  547)
! * Wno-sign-compare:                      Warning Options.    (line 1299)
! * Wno-sign-conversion:                   Warning Options.    (line 1306)
  * Wno-sign-promo:                        C++ Dialect Options.
!                                                              (line  705)
! * Wno-sized-deallocation:                Warning Options.    (line 1318)
! * Wno-sizeof-array-argument:             Warning Options.    (line 1337)
! * Wno-sizeof-pointer-memaccess:          Warning Options.    (line 1329)
! * Wno-stack-protector:                   Warning Options.    (line 1708)
! * Wno-strict-aliasing:                   Warning Options.    (line  741)
  * Wno-strict-null-sentinel:              C++ Dialect Options.
!                                                              (line  652)
! * Wno-strict-overflow:                   Warning Options.    (line  781)
! * Wno-strict-prototypes:                 Warning Options.    (line 1407)
  * Wno-strict-selector-match:             Objective-C and Objective-C++ Dialect Options.
                                                               (line  197)
! * Wno-suggest-attribute=:                Warning Options.    (line  831)
! * Wno-suggest-attribute=const:           Warning Options.    (line  837)
! * Wno-suggest-attribute=format:          Warning Options.    (line  850)
! * Wno-suggest-attribute=noreturn:        Warning Options.    (line  837)
! * Wno-suggest-attribute=pure:            Warning Options.    (line  837)
! * Wno-suggest-final-methods:             Warning Options.    (line  880)
! * Wno-suggest-final-types:               Warning Options.    (line  871)
! * Wno-switch:                            Warning Options.    (line  551)
! * Wno-switch-bool:                       Warning Options.    (line  571)
! * Wno-switch-default:                    Warning Options.    (line  559)
! * Wno-switch-enum:                       Warning Options.    (line  562)
! * Wno-sync-nand:                         Warning Options.    (line  581)
! * Wno-system-headers:                    Warning Options.    (line  949)
! * Wno-traditional:                       Warning Options.    (line  985)
! * Wno-traditional-conversion:            Warning Options.    (line 1063)
! * Wno-trampolines:                       Warning Options.    (line  960)
! * Wno-trigraphs:                         Warning Options.    (line  586)
! * Wno-type-limits:                       Warning Options.    (line 1153)
  * Wno-undeclared-selector:               Objective-C and Objective-C++ Dialect Options.
                                                               (line  205)
! * Wno-undef:                             Warning Options.    (line 1077)
! * Wno-uninitialized:                     Warning Options.    (line  663)
! * Wno-unknown-pragmas:                   Warning Options.    (line  729)
! * Wno-unsafe-loop-optimizations:         Warning Options.    (line 1134)
! * Wno-unused:                            Warning Options.    (line  656)
! * Wno-unused-but-set-parameter:          Warning Options.    (line  591)
! * Wno-unused-but-set-variable:           Warning Options.    (line  600)
! * Wno-unused-function:                   Warning Options.    (line  610)
! * Wno-unused-label:                      Warning Options.    (line  615)
! * Wno-unused-parameter:                  Warning Options.    (line  626)
! * Wno-unused-result:                     Warning Options.    (line  633)
! * Wno-unused-value:                      Warning Options.    (line  646)
! * Wno-unused-variable:                   Warning Options.    (line  638)
! * Wno-useless-cast:                      Warning Options.    (line 1275)
! * Wno-varargs:                           Warning Options.    (line 1659)
! * Wno-variadic-macros:                   Warning Options.    (line 1653)
! * Wno-vector-operation-performance:      Warning Options.    (line 1664)
! * Wno-virtual-move-assign:               Warning Options.    (line 1674)
! * Wno-vla:                               Warning Options.    (line 1683)
! * Wno-volatile-register-var:             Warning Options.    (line 1687)
! * Wno-write-strings:                     Warning Options.    (line 1219)
! * Wno-zero-as-null-pointer-constant:     Warning Options.    (line 1262)
  * Wnoexcept:                             C++ Dialect Options.
!                                                              (line  584)
  * Wnon-template-friend:                  C++ Dialect Options.
!                                                              (line  660)
  * Wnon-virtual-dtor:                     C++ Dialect Options.
!                                                              (line  590)
! * Wnonnull:                              Warning Options.    (line  361)
! * Wnormalized:                           Warning Options.    (line 1481)
! * Wnormalized=:                          Warning Options.    (line 1481)
! * Wodr:                                  Warning Options.    (line 1538)
  * Wold-style-cast:                       C++ Dialect Options.
!                                                              (line  676)
! * Wold-style-declaration:                Warning Options.    (line 1413)
! * Wold-style-definition:                 Warning Options.    (line 1419)
! * Wopenm-simd:                           Warning Options.    (line 1543)
! * Woverflow:                             Warning Options.    (line 1535)
! * Woverlength-strings:                   Warning Options.    (line 1713)
  * Woverloaded-virtual:                   C++ Dialect Options.
!                                                              (line  682)
! * Woverride-init:                        Warning Options.    (line 1548)
  * Wp:                                    Preprocessor Options.
                                                               (line   14)
! * Wpacked:                               Warning Options.    (line 1556)
! * Wpacked-bitfield-compat:               Warning Options.    (line 1573)
! * Wpadded:                               Warning Options.    (line 1590)
! * Wparentheses:                          Warning Options.    (line  429)
! * Wpedantic:                             Warning Options.    (line   82)
! * Wpedantic-ms-format:                   Warning Options.    (line 1140)
  * Wpmf-conversions:                      C++ Dialect Options.
!                                                              (line  701)
  * Wpointer-arith <1>:                    Pointer Arith.      (line   13)
! * Wpointer-arith:                        Warning Options.    (line 1146)
! * Wpointer-sign:                         Warning Options.    (line 1702)
! * Wpointer-to-int-cast:                  Warning Options.    (line 1640)
! * Wpragmas:                              Warning Options.    (line  736)
  * Wprotocol:                             Objective-C and Objective-C++ Dialect Options.
                                                               (line  175)
  * wrapper:                               Overall Options.    (line  341)
! * Wredundant-decls:                      Warning Options.    (line 1597)
  * Wreorder:                              C++ Dialect Options.
!                                                              (line  598)
! * Wreturn-local-addr:                    Warning Options.    (line  524)
! * Wreturn-type:                          Warning Options.    (line  528)
  * Wselector:                             Objective-C and Objective-C++ Dialect Options.
                                                               (line  185)
! * Wsequence-point:                       Warning Options.    (line  478)
! * Wshadow:                               Warning Options.    (line 1084)
! * Wshadow-ivar:                          Warning Options.    (line 1092)
! * Wshift-count-negative:                 Warning Options.    (line  543)
! * Wshift-count-overflow:                 Warning Options.    (line  547)
! * Wsign-compare:                         Warning Options.    (line 1299)
! * Wsign-conversion:                      Warning Options.    (line 1306)
  * Wsign-promo:                           C++ Dialect Options.
!                                                              (line  705)
! * Wsized-deallocation:                   Warning Options.    (line 1318)
! * Wsizeof-array-argument:                Warning Options.    (line 1337)
! * Wsizeof-pointer-memaccess:             Warning Options.    (line 1329)
! * Wstack-protector:                      Warning Options.    (line 1708)
! * Wstack-usage:                          Warning Options.    (line 1112)
! * Wstrict-aliasing:                      Warning Options.    (line  741)
! * Wstrict-aliasing=n:                    Warning Options.    (line  749)
  * Wstrict-null-sentinel:                 C++ Dialect Options.
!                                                              (line  652)
! * Wstrict-overflow:                      Warning Options.    (line  781)
! * Wstrict-prototypes:                    Warning Options.    (line 1407)
  * Wstrict-selector-match:                Objective-C and Objective-C++ Dialect Options.
                                                               (line  197)
! * Wsuggest-attribute=:                   Warning Options.    (line  831)
! * Wsuggest-attribute=const:              Warning Options.    (line  837)
! * Wsuggest-attribute=format:             Warning Options.    (line  850)
! * Wsuggest-attribute=noreturn:           Warning Options.    (line  837)
! * Wsuggest-attribute=pure:               Warning Options.    (line  837)
! * Wsuggest-final-methods:                Warning Options.    (line  880)
! * Wsuggest-final-types:                  Warning Options.    (line  871)
! * Wswitch:                               Warning Options.    (line  551)
! * Wswitch-bool:                          Warning Options.    (line  571)
! * Wswitch-default:                       Warning Options.    (line  559)
! * Wswitch-enum:                          Warning Options.    (line  562)
! * Wsync-nand:                            Warning Options.    (line  581)
  * Wsystem-headers <1>:                   Preprocessor Options.
                                                               (line  165)
! * Wsystem-headers:                       Warning Options.    (line  949)
  * Wtraditional <1>:                      Preprocessor Options.
                                                               (line  118)
! * Wtraditional:                          Warning Options.    (line  985)
! * Wtraditional-conversion:               Warning Options.    (line 1063)
! * Wtrampolines:                          Warning Options.    (line  960)
  * Wtrigraphs <1>:                        Preprocessor Options.
                                                               (line  106)
! * Wtrigraphs:                            Warning Options.    (line  586)
! * Wtype-limits:                          Warning Options.    (line 1153)
  * Wundeclared-selector:                  Objective-C and Objective-C++ Dialect Options.
                                                               (line  205)
  * Wundef <1>:                            Preprocessor Options.
                                                               (line  124)
! * Wundef:                                Warning Options.    (line 1077)
! * Wuninitialized:                        Warning Options.    (line  663)
! * Wunknown-pragmas:                      Warning Options.    (line  729)
! * Wunsafe-loop-optimizations:            Warning Options.    (line 1134)
! * Wunsuffixed-float-constants:           Warning Options.    (line 1728)
! * Wunused:                               Warning Options.    (line  656)
! * Wunused-but-set-parameter:             Warning Options.    (line  591)
! * Wunused-but-set-variable:              Warning Options.    (line  600)
! * Wunused-function:                      Warning Options.    (line  610)
! * Wunused-label:                         Warning Options.    (line  615)
! * Wunused-local-typedefs:                Warning Options.    (line  622)
  * Wunused-macros:                        Preprocessor Options.
                                                               (line  129)
! * Wunused-parameter:                     Warning Options.    (line  626)
! * Wunused-result:                        Warning Options.    (line  633)
! * Wunused-value:                         Warning Options.    (line  646)
! * Wunused-variable:                      Warning Options.    (line  638)
! * Wuseless-cast:                         Warning Options.    (line 1275)
! * Wvarargs:                              Warning Options.    (line 1659)
! * Wvariadic-macros:                      Warning Options.    (line 1653)
! * Wvector-operation-performance:         Warning Options.    (line 1664)
! * Wvirtual-move-assign:                  Warning Options.    (line 1674)
! * Wvla:                                  Warning Options.    (line 1683)
! * Wvolatile-register-var:                Warning Options.    (line 1687)
! * Wwrite-strings:                        Warning Options.    (line 1219)
! * Wzero-as-null-pointer-constant:        Warning Options.    (line 1262)
! * x <1>:                                 Preprocessor Options.
!                                                              (line  322)
  * x:                                     Overall Options.    (line  126)
  * Xassembler:                            Assembler Options.  (line   13)
  * Xbind-lazy:                            VxWorks Options.    (line   26)
  * Xbind-now:                             VxWorks Options.    (line   30)
! * Xlinker:                               Link Options.       (line  248)
  * Xpreprocessor:                         Preprocessor Options.
                                                               (line   25)
  * Ym:                                    System V Options.   (line   26)
  * YP:                                    System V Options.   (line   22)
! * z:                                     Link Options.       (line  279)
  
  
  File: gcc.info,  Node: Keyword Index,  Prev: Option Index,  Up: Top
--- 50703,51319 ----
  * noseglinkedit:                         Darwin Options.     (line  196)
  * nostartfiles:                          Link Options.       (line   63)
  * nostdinc:                              Preprocessor Options.
!                                                              (line  401)
  * nostdinc++:                            C++ Dialect Options.
!                                                              (line  429)
! * nostdinc++ <1>:                        Preprocessor Options.
!                                                              (line  406)
  * nostdlib:                              Link Options.       (line   80)
! * no_dead_strip_inits_and_terms:         Darwin Options.     (line  196)
  * o:                                     Overall Options.    (line  192)
+ * O:                                     Optimize Options.   (line   39)
+ * o <1>:                                 Preprocessor Options.
+                                                              (line   87)
  * O0:                                    Optimize Options.   (line  145)
  * O1:                                    Optimize Options.   (line   39)
  * O2:                                    Optimize Options.   (line   91)
  * O3:                                    Optimize Options.   (line  136)
  * Ofast:                                 Optimize Options.   (line  159)
! * Og:                                    Optimize Options.   (line  165)
  * Os:                                    Optimize Options.   (line  149)
+ * p:                                     Debugging Options.  (line  645)
  * P:                                     Preprocessor Options.
!                                                              (line  646)
  * pagezero_size:                         Darwin Options.     (line  196)
! * param:                                 Optimize Options.   (line 2434)
  * pass-exit-codes:                       Overall Options.    (line  150)
  * pedantic:                              Standards.          (line   16)
! * pedantic <1>:                          Warning Options.    (line   80)
! * pedantic <2>:                          Preprocessor Options.
!                                                              (line  175)
! * pedantic <3>:                          C Extensions.       (line    6)
! * pedantic <4>:                          Alternate Keywords. (line   30)
! * pedantic <5>:                          Warnings and Errors.
                                                               (line   25)
  * pedantic-errors:                       Standards.          (line   16)
! * pedantic-errors <1>:                   Warning Options.    (line  121)
! * pedantic-errors <2>:                   Preprocessor Options.
!                                                              (line  180)
! * pedantic-errors <3>:                   Non-bugs.           (line  216)
! * pedantic-errors <4>:                   Warnings and Errors.
!                                                              (line   25)
! * pg:                                    Debugging Options.  (line  651)
  * pie:                                   Link Options.       (line  105)
  * pipe:                                  Overall Options.    (line  215)
  * prebind:                               Darwin Options.     (line  196)
  * prebind_all_twolevel_modules:          Darwin Options.     (line  196)
! * print-file-name:                       Debugging Options.  (line 1588)
! * print-libgcc-file-name:                Debugging Options.  (line 1622)
! * print-multi-directory:                 Debugging Options.  (line 1594)
! * print-multi-lib:                       Debugging Options.  (line 1599)
! * print-multi-os-directory:              Debugging Options.  (line 1606)
! * print-multiarch:                       Debugging Options.  (line 1615)
  * print-objc-runtime-info:               Objective-C and Objective-C++ Dialect Options.
                                                               (line  217)
! * print-prog-name:                       Debugging Options.  (line 1619)
! * print-search-dirs:                     Debugging Options.  (line 1630)
! * print-sysroot:                         Debugging Options.  (line 1643)
! * print-sysroot-headers-suffix:          Debugging Options.  (line 1650)
  * private_bundle:                        Darwin Options.     (line  196)
  * pthread:                               RS/6000 and PowerPC Options.
!                                                              (line  826)
! * pthread <1>:                           Solaris 2 Options.  (line   36)
! * pthreads:                              Solaris 2 Options.  (line   30)
! * Q:                                     Debugging Options.  (line  657)
  * Qn:                                    System V Options.   (line   18)
  * Qy:                                    System V Options.   (line   14)
  * rdynamic:                              Link Options.       (line  111)
  * read_only_relocs:                      Darwin Options.     (line  196)
  * remap:                                 Preprocessor Options.
!                                                              (line  693)
  * S:                                     Overall Options.    (line  175)
! * S <1>:                                 Link Options.       (line   20)
! * s:                                     Link Options.       (line  118)
! * save-temps:                            Debugging Options.  (line 1495)
! * save-temps=obj:                        Debugging Options.  (line 1521)
  * sectalign:                             Darwin Options.     (line  196)
  * sectcreate:                            Darwin Options.     (line  196)
  * sectobjectsymbols:                     Darwin Options.     (line  196)
+ * sectobjectsymbols <1>:                 Darwin Options.     (line  196)
  * sectorder:                             Darwin Options.     (line  196)
  * seg1addr:                              Darwin Options.     (line  196)
  * segaddr:                               Darwin Options.     (line  196)
  * seglinkedit:                           Darwin Options.     (line  196)
  * segprot:                               Darwin Options.     (line  196)
  * segs_read_only_addr:                   Darwin Options.     (line  196)
+ * segs_read_only_addr <1>:               Darwin Options.     (line  196)
  * segs_read_write_addr:                  Darwin Options.     (line  196)
! * segs_read_write_addr <1>:              Darwin Options.     (line  196)
! * seg_addr_table:                        Darwin Options.     (line  196)
! * seg_addr_table_filename:               Darwin Options.     (line  196)
! * shared:                                Link Options.       (line  126)
! * shared-libgcc:                         Link Options.       (line  134)
  * short-calls:                           Adapteva Epiphany Options.
                                                               (line   61)
  * sim:                                   CRIS Options.       (line   95)
  * sim2:                                  CRIS Options.       (line  101)
  * single_module:                         Darwin Options.     (line  196)
! * specs:                                 Directory Options.  (line   86)
  * static:                                Link Options.       (line  122)
! * static <1>:                            Darwin Options.     (line  196)
! * static <2>:                            HPPA Options.       (line  185)
! * static-libasan:                        Link Options.       (line  169)
! * static-libgcc:                         Link Options.       (line  134)
! * static-liblsan:                        Link Options.       (line  185)
! * static-libmpx:                         Link Options.       (line  202)
! * static-libmpxwrappers:                 Link Options.       (line  211)
! * static-libstdc++:                      Link Options.       (line  221)
! * static-libtsan:                        Link Options.       (line  177)
! * static-libubsan:                       Link Options.       (line  193)
  * std:                                   Standards.          (line   16)
+ * std <1>:                               C Dialect Options.  (line   46)
+ * std <2>:                               Other Builtins.     (line   21)
+ * std <3>:                               Non-bugs.           (line  107)
  * std=:                                  Preprocessor Options.
!                                                              (line  340)
  * sub_library:                           Darwin Options.     (line  196)
  * sub_umbrella:                          Darwin Options.     (line  196)
! * symbolic:                              Link Options.       (line  232)
! * sysroot:                               Directory Options.  (line   94)
! * T:                                     Link Options.       (line  238)
  * target-help:                           Overall Options.    (line  230)
+ * target-help <1>:                       Preprocessor Options.
+                                                              (line  698)
  * threads:                               HPPA Options.       (line  198)
! * time:                                  Debugging Options.  (line 1536)
  * tno-android-cc:                        GNU/Linux Options.  (line   31)
  * tno-android-ld:                        GNU/Linux Options.  (line   35)
+ * traditional:                           C Dialect Options.  (line  347)
  * traditional <1>:                       Incompatibilities.  (line    6)
! * traditional-cpp:                       C Dialect Options.  (line  347)
  * traditional-cpp <1>:                   Preprocessor Options.
!                                                              (line  676)
! * trigraphs:                             C Dialect Options.  (line  342)
  * trigraphs <1>:                         Preprocessor Options.
!                                                              (line  680)
  * twolevel_namespace:                    Darwin Options.     (line  196)
  * U:                                     Preprocessor Options.
                                                               (line   69)
+ * u:                                     Link Options.       (line  270)
  * umbrella:                              Darwin Options.     (line  196)
  * undef:                                 Preprocessor Options.
                                                               (line   73)
  * undefined:                             Darwin Options.     (line  196)
  * unexported_symbols_list:               Darwin Options.     (line  196)
  * v:                                     Overall Options.    (line  203)
! * v <1>:                                 Preprocessor Options.
!                                                              (line  702)
  * version:                               Overall Options.    (line  338)
! * version <1>:                           Preprocessor Options.
!                                                              (line  714)
  * w:                                     Warning Options.    (line   25)
+ * W:                                     Warning Options.    (line  181)
+ * W <1>:                                 Warning Options.    (line 1441)
+ * W <2>:                                 Warning Options.    (line 1537)
+ * w <1>:                                 Preprocessor Options.
+                                                              (line  171)
+ * W <3>:                                 Incompatibilities.  (line   64)
  * Wa:                                    Assembler Options.  (line    9)
  * Wabi:                                  C++ Dialect Options.
!                                                              (line  437)
  * Wabi-tag:                              C++ Dialect Options.
!                                                              (line  527)
! * Waddr-space-convert:                   AVR Options.        (line  236)
! * Waddress:                              Warning Options.    (line 1343)
! * Waggregate-return:                     Warning Options.    (line 1376)
! * Waggressive-loop-optimizations:        Warning Options.    (line 1381)
! * Wall:                                  Warning Options.    (line  130)
! * Wall <1>:                              Preprocessor Options.
                                                               (line   93)
! * Wall <2>:                              Standard Libraries. (line    6)
! * Warray-bounds:                         Warning Options.    (line  891)
  * Wassign-intercept:                     Objective-C and Objective-C++ Dialect Options.
                                                               (line  171)
! * Wattributes:                           Warning Options.    (line 1386)
! * Wbad-function-cast:                    Warning Options.    (line 1153)
! * Wbool-compare:                         Warning Options.    (line  907)
! * Wbuiltin-macro-redefined:              Warning Options.    (line 1392)
! * Wc++-compat:                           Warning Options.    (line 1173)
! * Wc++11-compat:                         Warning Options.    (line 1178)
! * Wc++14-compat:                         Warning Options.    (line 1184)
! * Wc90-c99-compat:                       Warning Options.    (line 1158)
! * Wc99-c11-compat:                       Warning Options.    (line 1165)
! * Wcast-align:                           Warning Options.    (line 1204)
! * Wcast-qual:                            Warning Options.    (line 1188)
! * Wchar-subscripts:                      Warning Options.    (line  220)
! * Wchkp:                                 Warning Options.    (line  230)
! * Wclobbered:                            Warning Options.    (line 1223)
! * Wcomment:                              Warning Options.    (line  225)
  * Wcomment <1>:                          Preprocessor Options.
                                                               (line  101)
  * Wcomments:                             Preprocessor Options.
                                                               (line  101)
! * Wconditionally-supported:              Warning Options.    (line 1227)
! * Wconversion:                           Warning Options.    (line 1230)
! * Wconversion-null:                      Warning Options.    (line 1248)
  * Wctor-dtor-privacy:                    C++ Dialect Options.
!                                                              (line  532)
! * Wdate-time:                            Warning Options.    (line 1256)
! * Wdeclaration-after-statement:          Warning Options.    (line 1066)
! * Wdelete-incomplete:                    Warning Options.    (line 1261)
  * Wdelete-non-virtual-dtor:              C++ Dialect Options.
!                                                              (line  539)
! * Wdeprecated:                           Warning Options.    (line 1514)
! * Wdeprecated-declarations:              Warning Options.    (line 1518)
! * Wdisabled-optimization:                Warning Options.    (line 1681)
! * Wdiscarded-array-qualifiers:           Warning Options.    (line  922)
! * Wdiscarded-qualifiers:                 Warning Options.    (line  916)
! * Wdiv-by-zero:                          Warning Options.    (line  940)
! * Wdouble-promotion:                     Warning Options.    (line  253)
  * weak_reference_mismatches:             Darwin Options.     (line  196)
  * Weffc++:                               C++ Dialect Options.
!                                                              (line  619)
! * Wempty-body:                           Warning Options.    (line 1268)
! * Wendif-labels:                         Warning Options.    (line 1075)
  * Wendif-labels <1>:                     Preprocessor Options.
                                                               (line  148)
! * Wenum-compare:                         Warning Options.    (line 1272)
! * Werror:                                Warning Options.    (line   28)
  * Werror <1>:                            Preprocessor Options.
                                                               (line  161)
  * Werror=:                               Warning Options.    (line   31)
! * Wextra:                                Warning Options.    (line  181)
! * Wextra <1>:                            Warning Options.    (line 1441)
! * Wextra <2>:                            Warning Options.    (line 1537)
  * Wfatal-errors:                         Warning Options.    (line   48)
! * Wfloat-conversion:                     Warning Options.    (line 1302)
! * Wfloat-equal:                          Warning Options.    (line  966)
! * Wformat:                               Warning Options.    (line  272)
! * Wformat <1>:                           Warning Options.    (line  297)
! * Wformat <2>:                           Warning Options.    (line  846)
! * Wformat <3>:                           Function Attributes.
!                                                              (line  420)
! * Wformat-contains-nul:                  Warning Options.    (line  306)
! * Wformat-extra-args:                    Warning Options.    (line  310)
! * Wformat-nonliteral:                    Warning Options.    (line  334)
  * Wformat-nonliteral <1>:                Function Attributes.
!                                                              (line  485)
! * Wformat-security:                      Warning Options.    (line  339)
! * Wformat-signedness:                    Warning Options.    (line  351)
! * Wformat-y2k:                           Warning Options.    (line  356)
! * Wformat-zero-length:                   Warning Options.    (line  324)
! * Wformat=:                              Warning Options.    (line  272)
  * Wformat=1:                             Warning Options.    (line  297)
! * Wformat=2:                             Warning Options.    (line  329)
! * Wframe-larger-than:                    Warning Options.    (line 1094)
! * Wfree-nonheap-object:                  Warning Options.    (line 1103)
  * whatsloaded:                           Darwin Options.     (line  196)
  * whyload:                               Darwin Options.     (line  196)
! * Wignored-qualifiers:                   Warning Options.    (line  396)
! * Wimplicit:                             Warning Options.    (line  392)
! * Wimplicit-function-declaration:        Warning Options.    (line  386)
! * Wimplicit-int:                         Warning Options.    (line  382)
! * Wincompatible-pointer-types:           Warning Options.    (line  928)
! * Winherited-variadic-ctor:              Warning Options.    (line 1593)
! * Winit-self:                            Warning Options.    (line  367)
! * Winline:                               Warning Options.    (line 1598)
  * Winline <1>:                           Inline.             (line   63)
! * Wint-conversion:                       Warning Options.    (line  934)
! * Wint-to-pointer-cast:                  Warning Options.    (line 1623)
! * Winvalid-offsetof:                     Warning Options.    (line 1611)
! * Winvalid-pch:                          Warning Options.    (line 1632)
! * Wjump-misses-init:                     Warning Options.    (line 1278)
! * Wl:                                    Link Options.       (line  262)
! * Wlarger-than-LEN:                      Warning Options.    (line 1091)
! * Wlarger-than=LEN:                      Warning Options.    (line 1091)
  * Wliteral-suffix:                       C++ Dialect Options.
!                                                              (line  546)
! * Wlogical-not-parentheses:              Warning Options.    (line 1361)
! * Wlogical-op:                           Warning Options.    (line 1356)
! * Wlong-long:                            Warning Options.    (line 1636)
! * Wmain:                                 Warning Options.    (line  407)
! * Wmaybe-uninitialized:                  Warning Options.    (line  683)
! * Wmemset-transposed-args:               Warning Options.    (line 1332)
! * Wmissing-braces:                       Warning Options.    (line  414)
! * Wmissing-declarations:                 Warning Options.    (line 1431)
! * Wmissing-field-initializers:           Warning Options.    (line 1441)
! * Wmissing-format-attribute:             Warning Options.    (line  846)
! * Wmissing-include-dirs:                 Warning Options.    (line  425)
! * Wmissing-parameter-type:               Warning Options.    (line 1413)
! * Wmissing-prototypes:                   Warning Options.    (line 1421)
! * Wmisspelled-isr:                       AVR Options.        (line  241)
! * Wmultichar:                            Warning Options.    (line 1465)
  * Wnarrowing:                            C++ Dialect Options.
!                                                              (line  567)
! * Wnested-externs:                       Warning Options.    (line 1590)
  * Wno-abi:                               C++ Dialect Options.
!                                                              (line  437)
! * Wno-address:                           Warning Options.    (line 1343)
! * Wno-aggregate-return:                  Warning Options.    (line 1376)
! * Wno-aggressive-loop-optimizations:     Warning Options.    (line 1381)
! * Wno-all:                               Warning Options.    (line  130)
! * Wno-array-bounds:                      Warning Options.    (line  891)
  * Wno-assign-intercept:                  Objective-C and Objective-C++ Dialect Options.
                                                               (line  171)
! * Wno-attributes:                        Warning Options.    (line 1386)
! * Wno-bad-function-cast:                 Warning Options.    (line 1153)
! * Wno-bool-compare:                      Warning Options.    (line  907)
! * Wno-builtin-macro-redefined:           Warning Options.    (line 1392)
! * Wno-c90-c99-compat:                    Warning Options.    (line 1158)
! * Wno-c99-c11-compat:                    Warning Options.    (line 1165)
! * Wno-cast-align:                        Warning Options.    (line 1204)
! * Wno-cast-qual:                         Warning Options.    (line 1188)
! * Wno-char-subscripts:                   Warning Options.    (line  220)
! * Wno-clobbered:                         Warning Options.    (line 1223)
! * Wno-comment:                           Warning Options.    (line  225)
! * Wno-conditionally-supported:           Warning Options.    (line 1227)
! * Wno-conversion:                        Warning Options.    (line 1230)
! * Wno-conversion-null:                   Warning Options.    (line 1248)
! * Wno-coverage-mismatch:                 Warning Options.    (line  234)
  * Wno-ctor-dtor-privacy:                 C++ Dialect Options.
!                                                              (line  532)
! * Wno-date-time:                         Warning Options.    (line 1256)
! * Wno-declaration-after-statement:       Warning Options.    (line 1066)
! * Wno-delete-incomplete:                 Warning Options.    (line 1261)
  * Wno-delete-non-virtual-dtor:           C++ Dialect Options.
!                                                              (line  539)
! * Wno-deprecated:                        Warning Options.    (line 1514)
! * Wno-deprecated-declarations:           Warning Options.    (line 1518)
! * Wno-disabled-optimization:             Warning Options.    (line 1681)
! * Wno-discarded-array-qualifiers:        Warning Options.    (line  922)
! * Wno-discarded-qualifiers:              Warning Options.    (line  916)
! * Wno-div-by-zero:                       Warning Options.    (line  940)
! * Wno-double-promotion:                  Warning Options.    (line  253)
  * Wno-effc++:                            C++ Dialect Options.
!                                                              (line  619)
! * Wno-empty-body:                        Warning Options.    (line 1268)
! * Wno-endif-labels:                      Warning Options.    (line 1075)
! * Wno-enum-compare:                      Warning Options.    (line 1272)
  * Wno-error:                             Warning Options.    (line   28)
  * Wno-error=:                            Warning Options.    (line   31)
! * Wno-extra:                             Warning Options.    (line  181)
! * Wno-extra <1>:                         Warning Options.    (line 1441)
! * Wno-extra <2>:                         Warning Options.    (line 1537)
  * Wno-fatal-errors:                      Warning Options.    (line   48)
! * Wno-float-conversion:                  Warning Options.    (line 1302)
! * Wno-float-equal:                       Warning Options.    (line  966)
! * Wno-format:                            Warning Options.    (line  272)
! * Wno-format <1>:                        Warning Options.    (line  846)
! * Wno-format-contains-nul:               Warning Options.    (line  306)
! * Wno-format-extra-args:                 Warning Options.    (line  310)
! * Wno-format-nonliteral:                 Warning Options.    (line  334)
! * Wno-format-security:                   Warning Options.    (line  339)
! * Wno-format-signedness:                 Warning Options.    (line  351)
! * Wno-format-y2k:                        Warning Options.    (line  356)
! * Wno-format-zero-length:                Warning Options.    (line  324)
! * Wno-free-nonheap-object:               Warning Options.    (line 1103)
! * Wno-ignored-qualifiers:                Warning Options.    (line  396)
! * Wno-implicit:                          Warning Options.    (line  392)
! * Wno-implicit-function-declaration:     Warning Options.    (line  386)
! * Wno-implicit-int:                      Warning Options.    (line  382)
! * Wno-incompatible-pointer-types:        Warning Options.    (line  928)
! * Wno-inherited-variadic-ctor:           Warning Options.    (line 1593)
! * Wno-init-self:                         Warning Options.    (line  367)
! * Wno-inline:                            Warning Options.    (line 1598)
! * Wno-int-conversion:                    Warning Options.    (line  934)
! * Wno-int-to-pointer-cast:               Warning Options.    (line 1623)
! * Wno-invalid-offsetof:                  Warning Options.    (line 1611)
! * Wno-invalid-pch:                       Warning Options.    (line 1632)
! * Wno-jump-misses-init:                  Warning Options.    (line 1278)
  * Wno-literal-suffix:                    C++ Dialect Options.
!                                                              (line  546)
! * Wno-logical-not-parentheses:           Warning Options.    (line 1361)
! * Wno-logical-op:                        Warning Options.    (line 1356)
! * Wno-long-long:                         Warning Options.    (line 1636)
! * Wno-main:                              Warning Options.    (line  407)
! * Wno-maybe-uninitialized:               Warning Options.    (line  683)
! * Wno-memset-transposed-args:            Warning Options.    (line 1332)
! * Wno-missing-braces:                    Warning Options.    (line  414)
! * Wno-missing-declarations:              Warning Options.    (line 1431)
! * Wno-missing-field-initializers:        Warning Options.    (line 1441)
! * Wno-missing-format-attribute:          Warning Options.    (line  846)
! * Wno-missing-include-dirs:              Warning Options.    (line  425)
! * Wno-missing-parameter-type:            Warning Options.    (line 1413)
! * Wno-missing-prototypes:                Warning Options.    (line 1421)
! * Wno-multichar:                         Warning Options.    (line 1465)
  * Wno-narrowing:                         C++ Dialect Options.
!                                                              (line  567)
! * Wno-nested-externs:                    Warning Options.    (line 1590)
  * Wno-noexcept:                          C++ Dialect Options.
!                                                              (line  580)
  * Wno-non-template-friend:               C++ Dialect Options.
!                                                              (line  654)
  * Wno-non-virtual-dtor:                  C++ Dialect Options.
!                                                              (line  586)
! * Wno-nonnull:                           Warning Options.    (line  360)
! * Wno-normalized:                        Warning Options.    (line 1471)
! * Wno-odr:                               Warning Options.    (line 1527)
  * Wno-old-style-cast:                    C++ Dialect Options.
!                                                              (line  670)
! * Wno-old-style-declaration:             Warning Options.    (line 1403)
! * Wno-old-style-definition:              Warning Options.    (line 1409)
! * Wno-overflow:                          Warning Options.    (line 1524)
! * Wno-overlength-strings:                Warning Options.    (line 1701)
  * Wno-overloaded-virtual:                C++ Dialect Options.
!                                                              (line  676)
! * Wno-override-init:                     Warning Options.    (line 1537)
! * Wno-packed:                            Warning Options.    (line 1545)
! * Wno-packed-bitfield-compat:            Warning Options.    (line 1562)
! * Wno-padded:                            Warning Options.    (line 1579)
! * Wno-parentheses:                       Warning Options.    (line  428)
! * Wno-pedantic-ms-format:                Warning Options.    (line 1133)
! * Wno-pmf-conversions:                   C++ Dialect Options.
!                                                              (line  695)
  * Wno-pmf-conversions <1>:               Bound member functions.
                                                               (line   35)
! * Wno-pointer-arith:                     Warning Options.    (line 1139)
! * Wno-pointer-sign:                      Warning Options.    (line 1690)
! * Wno-pointer-to-int-cast:               Warning Options.    (line 1628)
! * Wno-pragmas:                           Warning Options.    (line  733)
  * Wno-protocol:                          Objective-C and Objective-C++ Dialect Options.
                                                               (line  175)
! * Wno-redundant-decls:                   Warning Options.    (line 1586)
  * Wno-reorder:                           C++ Dialect Options.
!                                                              (line  594)
! * Wno-return-local-addr:                 Warning Options.    (line  523)
! * Wno-return-type:                       Warning Options.    (line  527)
  * Wno-selector:                          Objective-C and Objective-C++ Dialect Options.
                                                               (line  185)
! * Wno-sequence-point:                    Warning Options.    (line  477)
! * Wno-shadow:                            Warning Options.    (line 1079)
! * Wno-shadow-ivar:                       Warning Options.    (line 1087)
! * Wno-shift-count-negative:              Warning Options.    (line  541)
! * Wno-shift-count-overflow:              Warning Options.    (line  545)
! * Wno-sign-compare:                      Warning Options.    (line 1289)
! * Wno-sign-conversion:                   Warning Options.    (line 1296)
  * Wno-sign-promo:                        C++ Dialect Options.
!                                                              (line  699)
! * Wno-sized-deallocation:                Warning Options.    (line 1308)
! * Wno-sizeof-array-argument:             Warning Options.    (line 1327)
! * Wno-sizeof-pointer-memaccess:          Warning Options.    (line 1319)
! * Wno-stack-protector:                   Warning Options.    (line 1696)
! * Wno-strict-aliasing:                   Warning Options.    (line  738)
  * Wno-strict-null-sentinel:              C++ Dialect Options.
!                                                              (line  647)
! * Wno-strict-overflow:                   Warning Options.    (line  777)
! * Wno-strict-prototypes:                 Warning Options.    (line 1397)
  * Wno-strict-selector-match:             Objective-C and Objective-C++ Dialect Options.
                                                               (line  197)
! * Wno-suggest-attribute=:                Warning Options.    (line  826)
! * Wno-suggest-attribute=const:           Warning Options.    (line  832)
! * Wno-suggest-attribute=format:          Warning Options.    (line  846)
! * Wno-suggest-attribute=noreturn:        Warning Options.    (line  832)
! * Wno-suggest-attribute=pure:            Warning Options.    (line  832)
! * Wno-suggest-final-methods:             Warning Options.    (line  876)
! * Wno-suggest-final-types:               Warning Options.    (line  867)
! * Wno-switch:                            Warning Options.    (line  549)
! * Wno-switch-bool:                       Warning Options.    (line  569)
! * Wno-switch-default:                    Warning Options.    (line  557)
! * Wno-switch-enum:                       Warning Options.    (line  560)
! * Wno-sync-nand:                         Warning Options.    (line  579)
! * Wno-system-headers:                    Warning Options.    (line  945)
! * Wno-traditional:                       Warning Options.    (line  981)
! * Wno-traditional-conversion:            Warning Options.    (line 1058)
! * Wno-trampolines:                       Warning Options.    (line  956)
! * Wno-trigraphs:                         Warning Options.    (line  584)
! * Wno-type-limits:                       Warning Options.    (line 1146)
  * Wno-undeclared-selector:               Objective-C and Objective-C++ Dialect Options.
                                                               (line  205)
! * Wno-undef:                             Warning Options.    (line 1072)
! * Wno-uninitialized:                     Warning Options.    (line  661)
! * Wno-unknown-pragmas:                   Warning Options.    (line  726)
! * Wno-unsafe-loop-optimizations:         Warning Options.    (line 1127)
! * Wno-unused:                            Warning Options.    (line  654)
! * Wno-unused-but-set-parameter:          Warning Options.    (line  589)
! * Wno-unused-but-set-variable:           Warning Options.    (line  598)
! * Wno-unused-function:                   Warning Options.    (line  608)
! * Wno-unused-label:                      Warning Options.    (line  613)
! * Wno-unused-parameter:                  Warning Options.    (line  624)
! * Wno-unused-result:                     Warning Options.    (line  631)
! * Wno-unused-value:                      Warning Options.    (line  644)
! * Wno-unused-variable:                   Warning Options.    (line  636)
! * Wno-useless-cast:                      Warning Options.    (line 1265)
! * Wno-varargs:                           Warning Options.    (line 1647)
! * Wno-variadic-macros:                   Warning Options.    (line 1641)
! * Wno-vector-operation-performance:      Warning Options.    (line 1652)
! * Wno-virtual-move-assign:               Warning Options.    (line 1662)
! * Wno-vla:                               Warning Options.    (line 1671)
! * Wno-volatile-register-var:             Warning Options.    (line 1675)
! * Wno-write-strings:                     Warning Options.    (line 1210)
! * Wno-zero-as-null-pointer-constant:     Warning Options.    (line 1252)
  * Wnoexcept:                             C++ Dialect Options.
!                                                              (line  580)
  * Wnon-template-friend:                  C++ Dialect Options.
!                                                              (line  654)
  * Wnon-virtual-dtor:                     C++ Dialect Options.
!                                                              (line  586)
! * Wnonnull:                              Warning Options.    (line  360)
! * Wnormalized:                           Warning Options.    (line 1471)
! * Wnormalized=:                          Warning Options.    (line 1471)
! * Wodr:                                  Warning Options.    (line 1527)
  * Wold-style-cast:                       C++ Dialect Options.
!                                                              (line  670)
! * Wold-style-declaration:                Warning Options.    (line 1403)
! * Wold-style-definition:                 Warning Options.    (line 1409)
! * Wopenm-simd:                           Warning Options.    (line 1532)
! * Woverflow:                             Warning Options.    (line 1524)
! * Woverlength-strings:                   Warning Options.    (line 1701)
  * Woverloaded-virtual:                   C++ Dialect Options.
!                                                              (line  676)
! * Woverride-init:                        Warning Options.    (line 1537)
  * Wp:                                    Preprocessor Options.
                                                               (line   14)
! * Wpacked:                               Warning Options.    (line 1545)
! * Wpacked-bitfield-compat:               Warning Options.    (line 1562)
! * Wpadded:                               Warning Options.    (line 1579)
! * Wparentheses:                          Warning Options.    (line  428)
! * Wpedantic:                             Warning Options.    (line   80)
! * Wpedantic-ms-format:                   Warning Options.    (line 1133)
  * Wpmf-conversions:                      C++ Dialect Options.
!                                                              (line  695)
! * Wpointer-arith:                        Warning Options.    (line 1139)
  * Wpointer-arith <1>:                    Pointer Arith.      (line   13)
! * Wpointer-sign:                         Warning Options.    (line 1690)
! * Wpointer-to-int-cast:                  Warning Options.    (line 1628)
! * Wpragmas:                              Warning Options.    (line  733)
  * Wprotocol:                             Objective-C and Objective-C++ Dialect Options.
                                                               (line  175)
  * wrapper:                               Overall Options.    (line  341)
! * Wredundant-decls:                      Warning Options.    (line 1586)
  * Wreorder:                              C++ Dialect Options.
!                                                              (line  594)
! * Wreturn-local-addr:                    Warning Options.    (line  523)
! * Wreturn-type:                          Warning Options.    (line  527)
  * Wselector:                             Objective-C and Objective-C++ Dialect Options.
                                                               (line  185)
! * Wsequence-point:                       Warning Options.    (line  477)
! * Wshadow:                               Warning Options.    (line 1079)
! * Wshadow-ivar:                          Warning Options.    (line 1087)
! * Wshift-count-negative:                 Warning Options.    (line  541)
! * Wshift-count-overflow:                 Warning Options.    (line  545)
! * Wsign-compare:                         Warning Options.    (line 1289)
! * Wsign-conversion:                      Warning Options.    (line 1296)
  * Wsign-promo:                           C++ Dialect Options.
!                                                              (line  699)
! * Wsized-deallocation:                   Warning Options.    (line 1308)
! * Wsizeof-array-argument:                Warning Options.    (line 1327)
! * Wsizeof-pointer-memaccess:             Warning Options.    (line 1319)
! * Wstack-protector:                      Warning Options.    (line 1696)
! * Wstack-usage:                          Warning Options.    (line 1107)
! * Wstrict-aliasing:                      Warning Options.    (line  738)
! * Wstrict-aliasing=n:                    Warning Options.    (line  745)
  * Wstrict-null-sentinel:                 C++ Dialect Options.
!                                                              (line  647)
! * Wstrict-overflow:                      Warning Options.    (line  777)
! * Wstrict-prototypes:                    Warning Options.    (line 1397)
  * Wstrict-selector-match:                Objective-C and Objective-C++ Dialect Options.
                                                               (line  197)
! * Wsuggest-attribute=:                   Warning Options.    (line  826)
! * Wsuggest-attribute=const:              Warning Options.    (line  832)
! * Wsuggest-attribute=format:             Warning Options.    (line  846)
! * Wsuggest-attribute=noreturn:           Warning Options.    (line  832)
! * Wsuggest-attribute=pure:               Warning Options.    (line  832)
! * Wsuggest-final-methods:                Warning Options.    (line  876)
! * Wsuggest-final-types:                  Warning Options.    (line  867)
! * Wswitch:                               Warning Options.    (line  549)
! * Wswitch-bool:                          Warning Options.    (line  569)
! * Wswitch-default:                       Warning Options.    (line  557)
! * Wswitch-enum:                          Warning Options.    (line  560)
! * Wsync-nand:                            Warning Options.    (line  579)
! * Wsystem-headers:                       Warning Options.    (line  945)
  * Wsystem-headers <1>:                   Preprocessor Options.
                                                               (line  165)
! * Wtraditional:                          Warning Options.    (line  981)
  * Wtraditional <1>:                      Preprocessor Options.
                                                               (line  118)
! * Wtraditional-conversion:               Warning Options.    (line 1058)
! * Wtrampolines:                          Warning Options.    (line  956)
! * Wtrigraphs:                            Warning Options.    (line  584)
  * Wtrigraphs <1>:                        Preprocessor Options.
                                                               (line  106)
! * Wtype-limits:                          Warning Options.    (line 1146)
  * Wundeclared-selector:                  Objective-C and Objective-C++ Dialect Options.
                                                               (line  205)
+ * Wundef:                                Warning Options.    (line 1072)
  * Wundef <1>:                            Preprocessor Options.
                                                               (line  124)
! * Wuninitialized:                        Warning Options.    (line  661)
! * Wunknown-pragmas:                      Warning Options.    (line  726)
! * Wunsafe-loop-optimizations:            Warning Options.    (line 1127)
! * Wunsuffixed-float-constants:           Warning Options.    (line 1716)
! * Wunused:                               Warning Options.    (line  654)
! * Wunused-but-set-parameter:             Warning Options.    (line  589)
! * Wunused-but-set-variable:              Warning Options.    (line  598)
! * Wunused-function:                      Warning Options.    (line  608)
! * Wunused-label:                         Warning Options.    (line  613)
! * Wunused-local-typedefs:                Warning Options.    (line  620)
  * Wunused-macros:                        Preprocessor Options.
                                                               (line  129)
! * Wunused-parameter:                     Warning Options.    (line  624)
! * Wunused-result:                        Warning Options.    (line  631)
! * Wunused-value:                         Warning Options.    (line  644)
! * Wunused-variable:                      Warning Options.    (line  636)
! * Wuseless-cast:                         Warning Options.    (line 1265)
! * Wvarargs:                              Warning Options.    (line 1647)
! * Wvariadic-macros:                      Warning Options.    (line 1641)
! * Wvector-operation-performance:         Warning Options.    (line 1652)
! * Wvirtual-move-assign:                  Warning Options.    (line 1662)
! * Wvla:                                  Warning Options.    (line 1671)
! * Wvolatile-register-var:                Warning Options.    (line 1675)
! * Wwrite-strings:                        Warning Options.    (line 1210)
! * Wzero-as-null-pointer-constant:        Warning Options.    (line 1252)
  * x:                                     Overall Options.    (line  126)
+ * x <1>:                                 Preprocessor Options.
+                                                              (line  324)
  * Xassembler:                            Assembler Options.  (line   13)
  * Xbind-lazy:                            VxWorks Options.    (line   26)
  * Xbind-now:                             VxWorks Options.    (line   30)
! * Xlinker:                               Link Options.       (line  244)
  * Xpreprocessor:                         Preprocessor Options.
                                                               (line   25)
  * Ym:                                    System V Options.   (line   26)
  * YP:                                    System V Options.   (line   22)
! * z:                                     Link Options.       (line  275)
  
  
  File: gcc.info,  Node: Keyword Index,  Prev: Option Index,  Up: Top
*************** Keyword Index
*** 51659,51675 ****
  * #pragma implementation, implied:       C++ Interface.      (line   43)
  * #pragma interface:                     C++ Interface.      (line   17)
  * #pragma, reason for not using:         Function Attributes.
!                                                              (line 2049)
  * $:                                     Dollar Signs.       (line    6)
  * $ in constraint:                       Multi-Alternative.  (line   42)
  * % in constraint:                       Modifiers.          (line   52)
! * %include:                              Spec Files.         (line   27)
! * %include_noerr:                        Spec Files.         (line   31)
! * %rename:                               Spec Files.         (line   35)
  * & in constraint:                       Modifiers.          (line   25)
  * ':                                     Incompatibilities.  (line  116)
  * * in constraint:                       Modifiers.          (line   73)
! * *__builtin_assume_aligned:             Other Builtins.     (line  346)
  * + in constraint:                       Modifiers.          (line   12)
  * -lgcc, use with -nodefaultlibs:        Link Options.       (line   91)
  * -lgcc, use with -nostdlib:             Link Options.       (line   91)
--- 51331,51347 ----
  * #pragma implementation, implied:       C++ Interface.      (line   43)
  * #pragma interface:                     C++ Interface.      (line   17)
  * #pragma, reason for not using:         Function Attributes.
!                                                              (line 2040)
  * $:                                     Dollar Signs.       (line    6)
  * $ in constraint:                       Multi-Alternative.  (line   42)
  * % in constraint:                       Modifiers.          (line   52)
! * %include:                              Spec Files.         (line   26)
! * %include_noerr:                        Spec Files.         (line   30)
! * %rename:                               Spec Files.         (line   34)
  * & in constraint:                       Modifiers.          (line   25)
  * ':                                     Incompatibilities.  (line  116)
  * * in constraint:                       Modifiers.          (line   73)
! * *__builtin_assume_aligned:             Other Builtins.     (line  339)
  * + in constraint:                       Modifiers.          (line   12)
  * -lgcc, use with -nodefaultlibs:        Link Options.       (line   91)
  * -lgcc, use with -nostdlib:             Link Options.       (line   91)
*************** Keyword Index
*** 51678,52041 ****
  * -nodefaultlibs and unresolved references: Link Options.    (line   91)
  * -nostdlib and unresolved references:   Link Options.       (line   91)
  * .sdata/.sdata2 references (PowerPC):   RS/6000 and PowerPC Options.
!                                                              (line  770)
  * //:                                    C++ Comments.       (line    6)
! * 0 in constraint:                       Simple Constraints. (line  127)
! * < in constraint:                       Simple Constraints. (line   48)
  * = in constraint:                       Modifiers.          (line    8)
! * > in constraint:                       Simple Constraints. (line   61)
  * ? in constraint:                       Multi-Alternative.  (line   27)
  * ?: extensions:                         Conditionals.       (line    6)
  * ?: side effect:                        Conditionals.       (line   20)
  * ^ in constraint:                       Multi-Alternative.  (line   38)
  * _ in variables in macros:              Typeof.             (line   46)
! * __atomic_add_fetch:                    __atomic Builtins.  (line  169)
! * __atomic_always_lock_free:             __atomic Builtins.  (line  247)
! * __atomic_and_fetch:                    __atomic Builtins.  (line  173)
! * __atomic_clear:                        __atomic Builtins.  (line  221)
! * __atomic_compare_exchange:             __atomic Builtins.  (line  161)
! * __atomic_compare_exchange_n:           __atomic Builtins.  (line  138)
! * __atomic_exchange:                     __atomic Builtins.  (line  130)
! * __atomic_exchange_n:                   __atomic Builtins.  (line  119)
! * __atomic_fetch_add:                    __atomic Builtins.  (line  189)
! * __atomic_fetch_and:                    __atomic Builtins.  (line  193)
! * __atomic_fetch_nand:                   __atomic Builtins.  (line  199)
! * __atomic_fetch_or:                     __atomic Builtins.  (line  197)
! * __atomic_fetch_sub:                    __atomic Builtins.  (line  191)
! * __atomic_fetch_xor:                    __atomic Builtins.  (line  195)
! * __atomic_is_lock_free:                 __atomic Builtins.  (line  261)
! * __atomic_load:                         __atomic Builtins.  (line   98)
! * __atomic_load_n:                       __atomic Builtins.  (line   89)
! * __atomic_nand_fetch:                   __atomic Builtins.  (line  179)
! * __atomic_or_fetch:                     __atomic Builtins.  (line  177)
! * __atomic_signal_fence:                 __atomic Builtins.  (line  239)
! * __atomic_store:                        __atomic Builtins.  (line  113)
! * __atomic_store_n:                      __atomic Builtins.  (line  104)
! * __atomic_sub_fetch:                    __atomic Builtins.  (line  171)
! * __atomic_test_and_set:                 __atomic Builtins.  (line  210)
! * __atomic_thread_fence:                 __atomic Builtins.  (line  232)
! * __atomic_xor_fetch:                    __atomic Builtins.  (line  175)
! * __builtin___bnd_chk_ptr_bounds:        Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_chk_ptr_lbounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_chk_ptr_ubounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_copy_ptr_bounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_get_ptr_lbound:        Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_get_ptr_ubound:        Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_init_ptr_bounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_narrow_ptr_bounds:     Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_null_ptr_bounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_set_ptr_bounds:        Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_store_ptr_bounds:      Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___clear_cache:               Other Builtins.     (line  381)
! * __builtin___fprintf_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___memcpy_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___memmove_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___mempcpy_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___memset_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___printf_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___snprintf_chk:              Object Size Checking.
!                                                              (line    6)
! * __builtin___sprintf_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___stpcpy_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___strcat_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___strcpy_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___strncat_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___strncpy_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___vfprintf_chk:              Object Size Checking.
!                                                              (line    6)
! * __builtin___vprintf_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___vsnprintf_chk:             Object Size Checking.
!                                                              (line    6)
! * __builtin___vsprintf_chk:              Object Size Checking.
!                                                              (line    6)
  * __builtin_add_overflow:                Integer Overflow Builtins.
!                                                              (line   11)
! * __builtin_apply:                       Constructing Calls. (line   31)
! * __builtin_apply_args:                  Constructing Calls. (line   20)
  * __builtin_arc_aligned:                 ARC Built-in Functions.
!                                                              (line   20)
  * __builtin_arc_brk:                     ARC Built-in Functions.
!                                                              (line   29)
  * __builtin_arc_core_read:               ARC Built-in Functions.
!                                                              (line   34)
  * __builtin_arc_core_write:              ARC Built-in Functions.
!                                                              (line   41)
  * __builtin_arc_divaw:                   ARC Built-in Functions.
!                                                              (line   47)
  * __builtin_arc_flag:                    ARC Built-in Functions.
!                                                              (line   54)
  * __builtin_arc_lr:                      ARC Built-in Functions.
!                                                              (line   58)
  * __builtin_arc_mul64:                   ARC Built-in Functions.
!                                                              (line   65)
  * __builtin_arc_mulu64:                  ARC Built-in Functions.
!                                                              (line   70)
  * __builtin_arc_nop:                     ARC Built-in Functions.
!                                                              (line   74)
  * __builtin_arc_norm:                    ARC Built-in Functions.
!                                                              (line   78)
  * __builtin_arc_normw:                   ARC Built-in Functions.
!                                                              (line   85)
  * __builtin_arc_rtie:                    ARC Built-in Functions.
!                                                              (line   92)
  * __builtin_arc_sleep:                   ARC Built-in Functions.
!                                                              (line   96)
  * __builtin_arc_sr:                      ARC Built-in Functions.
!                                                              (line  101)
  * __builtin_arc_swap:                    ARC Built-in Functions.
!                                                              (line  107)
  * __builtin_arc_swi:                     ARC Built-in Functions.
!                                                              (line  113)
  * __builtin_arc_sync:                    ARC Built-in Functions.
!                                                              (line  117)
  * __builtin_arc_trap_s:                  ARC Built-in Functions.
!                                                              (line  121)
  * __builtin_arc_unimp_s:                 ARC Built-in Functions.
!                                                              (line  125)
! * __builtin_bswap16:                     Other Builtins.     (line  612)
! * __builtin_bswap32:                     Other Builtins.     (line  616)
! * __builtin_bswap64:                     Other Builtins.     (line  620)
  * __builtin_call_with_static_chain:      Other Builtins.     (line    6)
! * __builtin_choose_expr:                 Other Builtins.     (line  168)
! * __builtin_clrsb:                       Other Builtins.     (line  542)
! * __builtin_clrsbl:                      Other Builtins.     (line  564)
! * __builtin_clrsbll:                     Other Builtins.     (line  587)
! * __builtin_clz:                         Other Builtins.     (line  534)
! * __builtin_clzl:                        Other Builtins.     (line  556)
! * __builtin_clzll:                       Other Builtins.     (line  579)
! * __builtin_complex:                     Other Builtins.     (line  208)
! * __builtin_constant_p:                  Other Builtins.     (line  218)
  * __builtin_cpu_init:                    x86 Built-in Functions.
!                                                              (line   63)
  * __builtin_cpu_is:                      x86 Built-in Functions.
!                                                              (line   92)
  * __builtin_cpu_supports:                x86 Built-in Functions.
!                                                              (line  164)
! * __builtin_ctz:                         Other Builtins.     (line  538)
! * __builtin_ctzl:                        Other Builtins.     (line  560)
! * __builtin_ctzll:                       Other Builtins.     (line  583)
! * __builtin_expect:                      Other Builtins.     (line  264)
! * __builtin_extract_return_addr:         Return Address.     (line   36)
! * __builtin_ffs:                         Other Builtins.     (line  530)
! * __builtin_ffsl:                        Other Builtins.     (line  553)
! * __builtin_ffsll:                       Other Builtins.     (line  575)
! * __builtin_FILE:                        Other Builtins.     (line  374)
  * __builtin_fpclassify:                  Other Builtins.     (line    6)
! * __builtin_frame_address:               Return Address.     (line   49)
! * __builtin_frob_return_address:         Return Address.     (line   45)
! * __builtin_FUNCTION:                    Other Builtins.     (line  369)
! * __builtin_huge_val:                    Other Builtins.     (line  432)
! * __builtin_huge_valf:                   Other Builtins.     (line  437)
! * __builtin_huge_vall:                   Other Builtins.     (line  440)
  * __builtin_huge_valq:                   x86 Built-in Functions.
                                                               (line   57)
! * __builtin_inf:                         Other Builtins.     (line  455)
! * __builtin_infd128:                     Other Builtins.     (line  465)
! * __builtin_infd32:                      Other Builtins.     (line  459)
! * __builtin_infd64:                      Other Builtins.     (line  462)
! * __builtin_inff:                        Other Builtins.     (line  469)
! * __builtin_infl:                        Other Builtins.     (line  474)
  * __builtin_infq:                        x86 Built-in Functions.
!                                                              (line   53)
  * __builtin_isfinite:                    Other Builtins.     (line    6)
  * __builtin_isgreater:                   Other Builtins.     (line    6)
  * __builtin_isgreaterequal:              Other Builtins.     (line    6)
  * __builtin_isinf_sign:                  Other Builtins.     (line    6)
  * __builtin_isless:                      Other Builtins.     (line    6)
  * __builtin_islessequal:                 Other Builtins.     (line    6)
  * __builtin_islessgreater:               Other Builtins.     (line    6)
  * __builtin_isnormal:                    Other Builtins.     (line    6)
  * __builtin_isunordered:                 Other Builtins.     (line    6)
! * __builtin_LINE:                        Other Builtins.     (line  363)
  * __builtin_mul_overflow:                Integer Overflow Builtins.
!                                                              (line   63)
! * __builtin_nan:                         Other Builtins.     (line  486)
! * __builtin_nand128:                     Other Builtins.     (line  508)
! * __builtin_nand32:                      Other Builtins.     (line  502)
! * __builtin_nand64:                      Other Builtins.     (line  505)
! * __builtin_nanf:                        Other Builtins.     (line  512)
! * __builtin_nanl:                        Other Builtins.     (line  515)
! * __builtin_nans:                        Other Builtins.     (line  519)
! * __builtin_nansf:                       Other Builtins.     (line  523)
! * __builtin_nansl:                       Other Builtins.     (line  526)
  * __builtin_nds32_isb:                   NDS32 Built-in Functions.
!                                                              (line   13)
  * __builtin_nds32_isync:                 NDS32 Built-in Functions.
!                                                              (line    9)
  * __builtin_nds32_mfsr:                  NDS32 Built-in Functions.
!                                                              (line   16)
  * __builtin_nds32_mfusr:                 NDS32 Built-in Functions.
!                                                              (line   19)
  * __builtin_nds32_mtsr:                  NDS32 Built-in Functions.
!                                                              (line   22)
  * __builtin_nds32_mtusr:                 NDS32 Built-in Functions.
!                                                              (line   25)
  * __builtin_nds32_setgie_dis:            NDS32 Built-in Functions.
!                                                              (line   31)
  * __builtin_nds32_setgie_en:             NDS32 Built-in Functions.
!                                                              (line   28)
  * __builtin_non_tx_store:                S/390 System z Built-in Functions.
!                                                              (line  104)
  * __builtin_object_size:                 Object Size Checking.
                                                               (line    6)
  * __builtin_offsetof:                    Offsetof.           (line    6)
! * __builtin_parity:                      Other Builtins.     (line  550)
! * __builtin_parityl:                     Other Builtins.     (line  571)
! * __builtin_parityll:                    Other Builtins.     (line  595)
! * __builtin_popcount:                    Other Builtins.     (line  547)
! * __builtin_popcountl:                   Other Builtins.     (line  567)
! * __builtin_popcountll:                  Other Builtins.     (line  591)
  * __builtin_powi:                        Other Builtins.     (line    6)
  * __builtin_powif:                       Other Builtins.     (line    6)
  * __builtin_powil:                       Other Builtins.     (line    6)
! * __builtin_prefetch:                    Other Builtins.     (line  393)
! * __builtin_return:                      Constructing Calls. (line   48)
! * __builtin_return_address:              Return Address.     (line   11)
  * __builtin_rx_brk:                      RX Built-in Functions.
!                                                              (line   11)
  * __builtin_rx_clrpsw:                   RX Built-in Functions.
!                                                              (line   14)
  * __builtin_rx_int:                      RX Built-in Functions.
!                                                              (line   18)
  * __builtin_rx_machi:                    RX Built-in Functions.
!                                                              (line   22)
  * __builtin_rx_maclo:                    RX Built-in Functions.
!                                                              (line   27)
  * __builtin_rx_mulhi:                    RX Built-in Functions.
!                                                              (line   32)
  * __builtin_rx_mullo:                    RX Built-in Functions.
!                                                              (line   37)
  * __builtin_rx_mvfachi:                  RX Built-in Functions.
!                                                              (line   42)
  * __builtin_rx_mvfacmi:                  RX Built-in Functions.
!                                                              (line   46)
  * __builtin_rx_mvfc:                     RX Built-in Functions.
!                                                              (line   50)
  * __builtin_rx_mvtachi:                  RX Built-in Functions.
!                                                              (line   54)
  * __builtin_rx_mvtaclo:                  RX Built-in Functions.
!                                                              (line   58)
  * __builtin_rx_mvtc:                     RX Built-in Functions.
!                                                              (line   62)
  * __builtin_rx_mvtipl:                   RX Built-in Functions.
!                                                              (line   66)
  * __builtin_rx_racw:                     RX Built-in Functions.
!                                                              (line   70)
  * __builtin_rx_revw:                     RX Built-in Functions.
!                                                              (line   74)
  * __builtin_rx_rmpa:                     RX Built-in Functions.
!                                                              (line   79)
  * __builtin_rx_round:                    RX Built-in Functions.
!                                                              (line   83)
  * __builtin_rx_sat:                      RX Built-in Functions.
!                                                              (line   88)
  * __builtin_rx_setpsw:                   RX Built-in Functions.
!                                                              (line   92)
  * __builtin_rx_wait:                     RX Built-in Functions.
!                                                              (line   96)
! * __builtin_sadd_overflow:               Integer Overflow Builtins.
!                                                              (line   13)
! * __builtin_saddl_overflow:              Integer Overflow Builtins.
!                                                              (line   15)
  * __builtin_saddll_overflow:             Integer Overflow Builtins.
!                                                              (line   17)
  * __builtin_set_thread_pointer:          SH Built-in Functions.
!                                                              (line   10)
  * __builtin_sh_get_fpscr:                SH Built-in Functions.
!                                                              (line   36)
  * __builtin_sh_set_fpscr:                SH Built-in Functions.
!                                                              (line   39)
! * __builtin_smul_overflow:               Integer Overflow Builtins.
!                                                              (line   65)
! * __builtin_smull_overflow:              Integer Overflow Builtins.
!                                                              (line   67)
  * __builtin_smulll_overflow:             Integer Overflow Builtins.
!                                                              (line   69)
! * __builtin_ssub_overflow:               Integer Overflow Builtins.
!                                                              (line   45)
! * __builtin_ssubl_overflow:              Integer Overflow Builtins.
!                                                              (line   47)
  * __builtin_ssubll_overflow:             Integer Overflow Builtins.
!                                                              (line   49)
  * __builtin_sub_overflow:                Integer Overflow Builtins.
!                                                              (line   43)
  * __builtin_tabort:                      S/390 System z Built-in Functions.
!                                                              (line   87)
  * __builtin_tbegin:                      S/390 System z Built-in Functions.
!                                                              (line    7)
  * __builtin_tbegin_nofloat:              S/390 System z Built-in Functions.
!                                                              (line   59)
  * __builtin_tbegin_retry:                S/390 System z Built-in Functions.
!                                                              (line   65)
  * __builtin_tbegin_retry_nofloat:        S/390 System z Built-in Functions.
!                                                              (line   72)
! * __builtin_tbeginc:                     S/390 System z Built-in Functions.
!                                                              (line   78)
  * __builtin_tend:                        S/390 System z Built-in Functions.
!                                                              (line   82)
  * __builtin_thread_pointer:              SH Built-in Functions.
!                                                              (line   20)
! * __builtin_trap:                        Other Builtins.     (line  288)
  * __builtin_tx_assist:                   S/390 System z Built-in Functions.
!                                                              (line   92)
  * __builtin_tx_nesting_depth:            S/390 System z Built-in Functions.
!                                                              (line   98)
! * __builtin_types_compatible_p:          Other Builtins.     (line  111)
! * __builtin_uadd_overflow:               Integer Overflow Builtins.
!                                                              (line   19)
! * __builtin_uaddl_overflow:              Integer Overflow Builtins.
!                                                              (line   21)
  * __builtin_uaddll_overflow:             Integer Overflow Builtins.
!                                                              (line   23)
! * __builtin_umul_overflow:               Integer Overflow Builtins.
!                                                              (line   71)
! * __builtin_umull_overflow:              Integer Overflow Builtins.
!                                                              (line   73)
  * __builtin_umulll_overflow:             Integer Overflow Builtins.
!                                                              (line   75)
! * __builtin_unreachable:                 Other Builtins.     (line  295)
! * __builtin_usub_overflow:               Integer Overflow Builtins.
!                                                              (line   51)
! * __builtin_usubl_overflow:              Integer Overflow Builtins.
!                                                              (line   53)
  * __builtin_usubll_overflow:             Integer Overflow Builtins.
!                                                              (line   55)
! * __builtin_va_arg_pack:                 Constructing Calls. (line   53)
! * __builtin_va_arg_pack_len:             Constructing Calls. (line   76)
  * __complex__ keyword:                   Complex.            (line    6)
  * __declspec(dllexport):                 Function Attributes.
!                                                              (line  285)
  * __declspec(dllimport):                 Function Attributes.
!                                                              (line  319)
  * __ea SPU Named Address Spaces:         Named Address Spaces.
                                                               (line  155)
  * __extension__:                         Alternate Keywords. (line   30)
  * __far M32C Named Address Spaces:       Named Address Spaces.
!                                                              (line  139)
  * __far RL78 Named Address Spaces:       Named Address Spaces.
                                                               (line  147)
  * __flash AVR Named Address Spaces:      Named Address Spaces.
--- 51350,51762 ----
  * -nodefaultlibs and unresolved references: Link Options.    (line   91)
  * -nostdlib and unresolved references:   Link Options.       (line   91)
  * .sdata/.sdata2 references (PowerPC):   RS/6000 and PowerPC Options.
!                                                              (line  773)
  * //:                                    C++ Comments.       (line    6)
! * 0 in constraint:                       Simple Constraints. (line  125)
! * < in constraint:                       Simple Constraints. (line   47)
  * = in constraint:                       Modifiers.          (line    8)
! * > in constraint:                       Simple Constraints. (line   59)
  * ? in constraint:                       Multi-Alternative.  (line   27)
  * ?: extensions:                         Conditionals.       (line    6)
  * ?: side effect:                        Conditionals.       (line   20)
  * ^ in constraint:                       Multi-Alternative.  (line   38)
  * _ in variables in macros:              Typeof.             (line   46)
! * _Accum data type:                      Fixed-Point.        (line    6)
! * _Complex keyword:                      Complex.            (line    6)
! * _Decimal128 data type:                 Decimal Float.      (line    6)
! * _Decimal32 data type:                  Decimal Float.      (line    6)
! * _Decimal64 data type:                  Decimal Float.      (line    6)
! * _Exit:                                 Other Builtins.     (line    6)
! * _exit:                                 Other Builtins.     (line    6)
! * _Fract data type:                      Fixed-Point.        (line    6)
! * _HTM_FIRST_USER_ABORT_CODE:            S/390 System z Built-in Functions.
!                                                              (line   44)
! * _Sat data type:                        Fixed-Point.        (line    6)
! * _xabort:                               x86 transactional memory intrinsics.
!                                                              (line   57)
! * _xbegin:                               x86 transactional memory intrinsics.
!                                                              (line   19)
! * _xend:                                 x86 transactional memory intrinsics.
!                                                              (line   48)
! * _xtest:                                x86 transactional memory intrinsics.
!                                                              (line   53)
! * __atomic_add_fetch:                    __atomic Builtins.  (line  153)
! * __atomic_always_lock_free:             __atomic Builtins.  (line  230)
! * __atomic_and_fetch:                    __atomic Builtins.  (line  157)
! * __atomic_clear:                        __atomic Builtins.  (line  204)
! * __atomic_compare_exchange:             __atomic Builtins.  (line  145)
! * __atomic_compare_exchange_n:           __atomic Builtins.  (line  124)
! * __atomic_exchange:                     __atomic Builtins.  (line  118)
! * __atomic_exchange_n:                   __atomic Builtins.  (line  108)
! * __atomic_fetch_add:                    __atomic Builtins.  (line  172)
! * __atomic_fetch_and:                    __atomic Builtins.  (line  176)
! * __atomic_fetch_nand:                   __atomic Builtins.  (line  182)
! * __atomic_fetch_or:                     __atomic Builtins.  (line  180)
! * __atomic_fetch_sub:                    __atomic Builtins.  (line  174)
! * __atomic_fetch_xor:                    __atomic Builtins.  (line  178)
! * __atomic_is_lock_free:                 __atomic Builtins.  (line  244)
! * __atomic_load:                         __atomic Builtins.  (line   90)
! * __atomic_load_n:                       __atomic Builtins.  (line   83)
! * __atomic_nand_fetch:                   __atomic Builtins.  (line  163)
! * __atomic_or_fetch:                     __atomic Builtins.  (line  161)
! * __atomic_signal_fence:                 __atomic Builtins.  (line  223)
! * __atomic_store:                        __atomic Builtins.  (line  103)
! * __atomic_store_n:                      __atomic Builtins.  (line   95)
! * __atomic_sub_fetch:                    __atomic Builtins.  (line  155)
! * __atomic_test_and_set:                 __atomic Builtins.  (line  192)
! * __atomic_thread_fence:                 __atomic Builtins.  (line  216)
! * __atomic_xor_fetch:                    __atomic Builtins.  (line  159)
  * __builtin_add_overflow:                Integer Overflow Builtins.
!                                                              (line    9)
! * __builtin_apply:                       Constructing Calls. (line   29)
! * __builtin_apply_args:                  Constructing Calls. (line   19)
  * __builtin_arc_aligned:                 ARC Built-in Functions.
!                                                              (line   18)
  * __builtin_arc_brk:                     ARC Built-in Functions.
!                                                              (line   28)
  * __builtin_arc_core_read:               ARC Built-in Functions.
!                                                              (line   32)
  * __builtin_arc_core_write:              ARC Built-in Functions.
!                                                              (line   39)
  * __builtin_arc_divaw:                   ARC Built-in Functions.
!                                                              (line   46)
  * __builtin_arc_flag:                    ARC Built-in Functions.
!                                                              (line   53)
  * __builtin_arc_lr:                      ARC Built-in Functions.
!                                                              (line   57)
  * __builtin_arc_mul64:                   ARC Built-in Functions.
!                                                              (line   64)
  * __builtin_arc_mulu64:                  ARC Built-in Functions.
!                                                              (line   68)
  * __builtin_arc_nop:                     ARC Built-in Functions.
!                                                              (line   73)
  * __builtin_arc_norm:                    ARC Built-in Functions.
!                                                              (line   77)
  * __builtin_arc_normw:                   ARC Built-in Functions.
!                                                              (line   84)
  * __builtin_arc_rtie:                    ARC Built-in Functions.
!                                                              (line   91)
  * __builtin_arc_sleep:                   ARC Built-in Functions.
!                                                              (line   95)
  * __builtin_arc_sr:                      ARC Built-in Functions.
!                                                              (line   99)
  * __builtin_arc_swap:                    ARC Built-in Functions.
!                                                              (line  106)
  * __builtin_arc_swi:                     ARC Built-in Functions.
!                                                              (line  112)
  * __builtin_arc_sync:                    ARC Built-in Functions.
!                                                              (line  116)
  * __builtin_arc_trap_s:                  ARC Built-in Functions.
!                                                              (line  120)
  * __builtin_arc_unimp_s:                 ARC Built-in Functions.
!                                                              (line  124)
! * __builtin_bswap16:                     Other Builtins.     (line  606)
! * __builtin_bswap32:                     Other Builtins.     (line  610)
! * __builtin_bswap64:                     Other Builtins.     (line  614)
  * __builtin_call_with_static_chain:      Other Builtins.     (line    6)
! * __builtin_call_with_static_chain <1>:  Other Builtins.     (line  154)
! * __builtin_choose_expr:                 Other Builtins.     (line  165)
! * __builtin_clrsb:                       Other Builtins.     (line  536)
! * __builtin_clrsbl:                      Other Builtins.     (line  558)
! * __builtin_clrsbll:                     Other Builtins.     (line  581)
! * __builtin_clz:                         Other Builtins.     (line  528)
! * __builtin_clzl:                        Other Builtins.     (line  550)
! * __builtin_clzll:                       Other Builtins.     (line  573)
! * __builtin_complex:                     Other Builtins.     (line  205)
! * __builtin_constant_p:                  Other Builtins.     (line  214)
  * __builtin_cpu_init:                    x86 Built-in Functions.
!                                                              (line   62)
  * __builtin_cpu_is:                      x86 Built-in Functions.
!                                                              (line   90)
  * __builtin_cpu_supports:                x86 Built-in Functions.
!                                                              (line  162)
! * __builtin_ctz:                         Other Builtins.     (line  532)
! * __builtin_ctzl:                        Other Builtins.     (line  554)
! * __builtin_ctzll:                       Other Builtins.     (line  577)
! * __builtin_expect:                      Other Builtins.     (line  259)
! * __builtin_extract_return_addr:         Return Address.     (line   35)
! * __builtin_ffs:                         Other Builtins.     (line  524)
! * __builtin_ffsl:                        Other Builtins.     (line  547)
! * __builtin_ffsll:                       Other Builtins.     (line  569)
! * __builtin_FILE:                        Other Builtins.     (line  368)
  * __builtin_fpclassify:                  Other Builtins.     (line    6)
! * __builtin_fpclassify <1>:              Other Builtins.     (line  438)
! * __builtin_frame_address:               Return Address.     (line   47)
! * __builtin_frob_return_address:         Return Address.     (line   44)
! * __builtin_FUNCTION:                    Other Builtins.     (line  363)
! * __builtin_huge_val:                    Other Builtins.     (line  426)
! * __builtin_huge_valf:                   Other Builtins.     (line  431)
! * __builtin_huge_vall:                   Other Builtins.     (line  434)
  * __builtin_huge_valq:                   x86 Built-in Functions.
                                                               (line   57)
! * __builtin_inf:                         Other Builtins.     (line  449)
! * __builtin_infd128:                     Other Builtins.     (line  459)
! * __builtin_infd32:                      Other Builtins.     (line  453)
! * __builtin_infd64:                      Other Builtins.     (line  456)
! * __builtin_inff:                        Other Builtins.     (line  463)
! * __builtin_infl:                        Other Builtins.     (line  468)
  * __builtin_infq:                        x86 Built-in Functions.
!                                                              (line   54)
  * __builtin_isfinite:                    Other Builtins.     (line    6)
  * __builtin_isgreater:                   Other Builtins.     (line    6)
  * __builtin_isgreaterequal:              Other Builtins.     (line    6)
  * __builtin_isinf_sign:                  Other Builtins.     (line    6)
+ * __builtin_isinf_sign <1>:              Other Builtins.     (line  472)
  * __builtin_isless:                      Other Builtins.     (line    6)
  * __builtin_islessequal:                 Other Builtins.     (line    6)
  * __builtin_islessgreater:               Other Builtins.     (line    6)
  * __builtin_isnormal:                    Other Builtins.     (line    6)
  * __builtin_isunordered:                 Other Builtins.     (line    6)
! * __builtin_LINE:                        Other Builtins.     (line  357)
  * __builtin_mul_overflow:                Integer Overflow Builtins.
!                                                              (line   62)
! * __builtin_nan:                         Other Builtins.     (line  480)
! * __builtin_nand128:                     Other Builtins.     (line  502)
! * __builtin_nand32:                      Other Builtins.     (line  496)
! * __builtin_nand64:                      Other Builtins.     (line  499)
! * __builtin_nanf:                        Other Builtins.     (line  506)
! * __builtin_nanl:                        Other Builtins.     (line  509)
! * __builtin_nans:                        Other Builtins.     (line  513)
! * __builtin_nansf:                       Other Builtins.     (line  517)
! * __builtin_nansl:                       Other Builtins.     (line  520)
  * __builtin_nds32_isb:                   NDS32 Built-in Functions.
!                                                              (line   12)
  * __builtin_nds32_isync:                 NDS32 Built-in Functions.
!                                                              (line    8)
  * __builtin_nds32_mfsr:                  NDS32 Built-in Functions.
!                                                              (line   15)
  * __builtin_nds32_mfusr:                 NDS32 Built-in Functions.
!                                                              (line   18)
  * __builtin_nds32_mtsr:                  NDS32 Built-in Functions.
!                                                              (line   21)
  * __builtin_nds32_mtusr:                 NDS32 Built-in Functions.
!                                                              (line   24)
  * __builtin_nds32_setgie_dis:            NDS32 Built-in Functions.
!                                                              (line   30)
  * __builtin_nds32_setgie_en:             NDS32 Built-in Functions.
!                                                              (line   27)
  * __builtin_non_tx_store:                S/390 System z Built-in Functions.
!                                                              (line   98)
  * __builtin_object_size:                 Object Size Checking.
                                                               (line    6)
+ * __builtin_object_size <1>:             Object Size Checking.
+                                                              (line    9)
  * __builtin_offsetof:                    Offsetof.           (line    6)
! * __builtin_parity:                      Other Builtins.     (line  544)
! * __builtin_parityl:                     Other Builtins.     (line  565)
! * __builtin_parityll:                    Other Builtins.     (line  589)
! * __builtin_popcount:                    Other Builtins.     (line  541)
! * __builtin_popcountl:                   Other Builtins.     (line  561)
! * __builtin_popcountll:                  Other Builtins.     (line  585)
  * __builtin_powi:                        Other Builtins.     (line    6)
+ * __builtin_powi <1>:                    Other Builtins.     (line  593)
  * __builtin_powif:                       Other Builtins.     (line    6)
+ * __builtin_powif <1>:                   Other Builtins.     (line  598)
  * __builtin_powil:                       Other Builtins.     (line    6)
! * __builtin_powil <1>:                   Other Builtins.     (line  602)
! * __builtin_prefetch:                    Other Builtins.     (line  387)
! * __builtin_return:                      Constructing Calls. (line   47)
! * __builtin_return_address:              Return Address.     (line    9)
  * __builtin_rx_brk:                      RX Built-in Functions.
!                                                              (line   10)
  * __builtin_rx_clrpsw:                   RX Built-in Functions.
!                                                              (line   13)
  * __builtin_rx_int:                      RX Built-in Functions.
!                                                              (line   17)
  * __builtin_rx_machi:                    RX Built-in Functions.
!                                                              (line   21)
  * __builtin_rx_maclo:                    RX Built-in Functions.
!                                                              (line   26)
  * __builtin_rx_mulhi:                    RX Built-in Functions.
!                                                              (line   31)
  * __builtin_rx_mullo:                    RX Built-in Functions.
!                                                              (line   36)
  * __builtin_rx_mvfachi:                  RX Built-in Functions.
!                                                              (line   41)
  * __builtin_rx_mvfacmi:                  RX Built-in Functions.
!                                                              (line   45)
  * __builtin_rx_mvfc:                     RX Built-in Functions.
!                                                              (line   49)
  * __builtin_rx_mvtachi:                  RX Built-in Functions.
!                                                              (line   53)
  * __builtin_rx_mvtaclo:                  RX Built-in Functions.
!                                                              (line   57)
  * __builtin_rx_mvtc:                     RX Built-in Functions.
!                                                              (line   61)
  * __builtin_rx_mvtipl:                   RX Built-in Functions.
!                                                              (line   65)
  * __builtin_rx_racw:                     RX Built-in Functions.
!                                                              (line   69)
  * __builtin_rx_revw:                     RX Built-in Functions.
!                                                              (line   73)
  * __builtin_rx_rmpa:                     RX Built-in Functions.
!                                                              (line   78)
  * __builtin_rx_round:                    RX Built-in Functions.
!                                                              (line   82)
  * __builtin_rx_sat:                      RX Built-in Functions.
!                                                              (line   87)
  * __builtin_rx_setpsw:                   RX Built-in Functions.
!                                                              (line   91)
  * __builtin_rx_wait:                     RX Built-in Functions.
!                                                              (line   95)
  * __builtin_saddll_overflow:             Integer Overflow Builtins.
!                                                              (line   15)
! * __builtin_saddl_overflow:              Integer Overflow Builtins.
!                                                              (line   13)
! * __builtin_sadd_overflow:               Integer Overflow Builtins.
!                                                              (line   11)
  * __builtin_set_thread_pointer:          SH Built-in Functions.
!                                                              (line    9)
  * __builtin_sh_get_fpscr:                SH Built-in Functions.
!                                                              (line   35)
  * __builtin_sh_set_fpscr:                SH Built-in Functions.
!                                                              (line   38)
  * __builtin_smulll_overflow:             Integer Overflow Builtins.
!                                                              (line   68)
! * __builtin_smull_overflow:              Integer Overflow Builtins.
!                                                              (line   66)
! * __builtin_smul_overflow:               Integer Overflow Builtins.
!                                                              (line   64)
  * __builtin_ssubll_overflow:             Integer Overflow Builtins.
!                                                              (line   48)
! * __builtin_ssubl_overflow:              Integer Overflow Builtins.
!                                                              (line   46)
! * __builtin_ssub_overflow:               Integer Overflow Builtins.
!                                                              (line   44)
  * __builtin_sub_overflow:                Integer Overflow Builtins.
!                                                              (line   42)
  * __builtin_tabort:                      S/390 System z Built-in Functions.
!                                                              (line   82)
  * __builtin_tbegin:                      S/390 System z Built-in Functions.
!                                                              (line    6)
! * __builtin_tbeginc:                     S/390 System z Built-in Functions.
!                                                              (line   73)
  * __builtin_tbegin_nofloat:              S/390 System z Built-in Functions.
!                                                              (line   54)
  * __builtin_tbegin_retry:                S/390 System z Built-in Functions.
!                                                              (line   60)
  * __builtin_tbegin_retry_nofloat:        S/390 System z Built-in Functions.
!                                                              (line   67)
  * __builtin_tend:                        S/390 System z Built-in Functions.
!                                                              (line   77)
  * __builtin_thread_pointer:              SH Built-in Functions.
!                                                              (line   18)
! * __builtin_trap:                        Other Builtins.     (line  283)
  * __builtin_tx_assist:                   S/390 System z Built-in Functions.
!                                                              (line   87)
  * __builtin_tx_nesting_depth:            S/390 System z Built-in Functions.
!                                                              (line   93)
! * __builtin_types_compatible_p:          Other Builtins.     (line  109)
  * __builtin_uaddll_overflow:             Integer Overflow Builtins.
!                                                              (line   21)
! * __builtin_uaddl_overflow:              Integer Overflow Builtins.
!                                                              (line   19)
! * __builtin_uadd_overflow:               Integer Overflow Builtins.
!                                                              (line   17)
  * __builtin_umulll_overflow:             Integer Overflow Builtins.
!                                                              (line   74)
! * __builtin_umull_overflow:              Integer Overflow Builtins.
!                                                              (line   72)
! * __builtin_umul_overflow:               Integer Overflow Builtins.
!                                                              (line   70)
! * __builtin_unreachable:                 Other Builtins.     (line  290)
  * __builtin_usubll_overflow:             Integer Overflow Builtins.
!                                                              (line   54)
! * __builtin_usubl_overflow:              Integer Overflow Builtins.
!                                                              (line   52)
! * __builtin_usub_overflow:               Integer Overflow Builtins.
!                                                              (line   50)
! * __builtin_va_arg_pack:                 Constructing Calls. (line   52)
! * __builtin_va_arg_pack_len:             Constructing Calls. (line   75)
! * __builtin___bnd_chk_ptr_bounds:        Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_chk_ptr_bounds <1>:    Pointer Bounds Checker builtins.
!                                                              (line  110)
! * __builtin___bnd_chk_ptr_lbounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_chk_ptr_lbounds <1>:   Pointer Bounds Checker builtins.
!                                                              (line   85)
! * __builtin___bnd_chk_ptr_ubounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_chk_ptr_ubounds <1>:   Pointer Bounds Checker builtins.
!                                                              (line  103)
! * __builtin___bnd_copy_ptr_bounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_copy_ptr_bounds <1>:   Pointer Bounds Checker builtins.
!                                                              (line   46)
! * __builtin___bnd_get_ptr_lbound:        Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_get_ptr_lbound <1>:    Pointer Bounds Checker builtins.
!                                                              (line  128)
! * __builtin___bnd_get_ptr_ubound:        Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_get_ptr_ubound <1>:    Pointer Bounds Checker builtins.
!                                                              (line  140)
! * __builtin___bnd_init_ptr_bounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_init_ptr_bounds <1>:   Pointer Bounds Checker builtins.
!                                                              (line   59)
! * __builtin___bnd_narrow_ptr_bounds:     Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_narrow_ptr_bounds <1>: Pointer Bounds Checker builtins.
!                                                              (line   27)
! * __builtin___bnd_null_ptr_bounds:       Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_null_ptr_bounds <1>:   Pointer Bounds Checker builtins.
!                                                              (line   67)
! * __builtin___bnd_set_ptr_bounds:        Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_set_ptr_bounds <1>:    Pointer Bounds Checker builtins.
!                                                              (line   12)
! * __builtin___bnd_store_ptr_bounds:      Pointer Bounds Checker builtins.
!                                                              (line    6)
! * __builtin___bnd_store_ptr_bounds <1>:  Pointer Bounds Checker builtins.
!                                                              (line   75)
! * __builtin___clear_cache:               Other Builtins.     (line  374)
! * __builtin___fprintf_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___memcpy_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___memmove_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___mempcpy_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___memset_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___printf_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___snprintf_chk:              Object Size Checking.
!                                                              (line    6)
! * __builtin___sprintf_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___stpcpy_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___strcat_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___strcpy_chk:                Object Size Checking.
!                                                              (line    6)
! * __builtin___strncat_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___strncpy_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___vfprintf_chk:              Object Size Checking.
!                                                              (line    6)
! * __builtin___vprintf_chk:               Object Size Checking.
!                                                              (line    6)
! * __builtin___vsnprintf_chk:             Object Size Checking.
!                                                              (line    6)
! * __builtin___vsprintf_chk:              Object Size Checking.
!                                                              (line    6)
  * __complex__ keyword:                   Complex.            (line    6)
  * __declspec(dllexport):                 Function Attributes.
!                                                              (line  283)
  * __declspec(dllimport):                 Function Attributes.
!                                                              (line  315)
  * __ea SPU Named Address Spaces:         Named Address Spaces.
                                                               (line  155)
  * __extension__:                         Alternate Keywords. (line   30)
  * __far M32C Named Address Spaces:       Named Address Spaces.
!                                                              (line  138)
  * __far RL78 Named Address Spaces:       Named Address Spaces.
                                                               (line  147)
  * __flash AVR Named Address Spaces:      Named Address Spaces.
*************** Keyword Index
*** 52053,52060 ****
  * __float128 data type:                  Floating Types.     (line    6)
  * __float80 data type:                   Floating Types.     (line    6)
  * __fp16 data type:                      Half-Precision.     (line    6)
- * __func__ identifier:                   Function Names.     (line    6)
  * __FUNCTION__ identifier:               Function Names.     (line    6)
  * __imag__ keyword:                      Complex.            (line   27)
  * __int128 data types:                   __int128.           (line    6)
  * __memx AVR Named Address Spaces:       Named Address Spaces.
--- 51774,51781 ----
  * __float128 data type:                  Floating Types.     (line    6)
  * __float80 data type:                   Floating Types.     (line    6)
  * __fp16 data type:                      Half-Precision.     (line    6)
  * __FUNCTION__ identifier:               Function Names.     (line    6)
+ * __func__ identifier:                   Function Names.     (line    6)
  * __imag__ keyword:                      Complex.            (line   27)
  * __int128 data types:                   __int128.           (line    6)
  * __memx AVR Named Address Spaces:       Named Address Spaces.
*************** Keyword Index
*** 52080,52104 ****
  * __sync_val_compare_and_swap:           __sync Builtins.    (line   71)
  * __sync_xor_and_fetch:                  __sync Builtins.    (line   60)
  * __thread:                              Thread-Local.       (line    6)
- * _Accum data type:                      Fixed-Point.        (line    6)
- * _Complex keyword:                      Complex.            (line    6)
- * _Decimal128 data type:                 Decimal Float.      (line    6)
- * _Decimal32 data type:                  Decimal Float.      (line    6)
- * _Decimal64 data type:                  Decimal Float.      (line    6)
- * _exit:                                 Other Builtins.     (line    6)
- * _Exit:                                 Other Builtins.     (line    6)
- * _Fract data type:                      Fixed-Point.        (line    6)
- * _HTM_FIRST_USER_ABORT_CODE:            S/390 System z Built-in Functions.
-                                                              (line   48)
- * _Sat data type:                        Fixed-Point.        (line    6)
- * _xabort:                               x86 transactional memory intrinsics.
-                                                              (line   64)
- * _xbegin:                               x86 transactional memory intrinsics.
-                                                              (line   20)
- * _xend:                                 x86 transactional memory intrinsics.
-                                                              (line   55)
- * _xtest:                                x86 transactional memory intrinsics.
-                                                              (line   60)
  * AArch64 Options:                       AArch64 Options.    (line    6)
  * ABI:                                   Compatibility.      (line    6)
  * abi_tag function attribute:            C++ Attributes.     (line    9)
--- 51801,51806 ----
*************** Keyword Index
*** 52106,52113 ****
  * abi_tag variable attribute:            C++ Attributes.     (line    9)
  * abort:                                 Other Builtins.     (line    6)
  * abs:                                   Other Builtins.     (line    6)
- * accessing volatiles <1>:               C++ Volatiles.      (line    6)
  * accessing volatiles:                   Volatiles.          (line    6)
  * acos:                                  Other Builtins.     (line    6)
  * acosf:                                 Other Builtins.     (line    6)
  * acosh:                                 Other Builtins.     (line    6)
--- 51808,51815 ----
  * abi_tag variable attribute:            C++ Attributes.     (line    9)
  * abort:                                 Other Builtins.     (line    6)
  * abs:                                   Other Builtins.     (line    6)
  * accessing volatiles:                   Volatiles.          (line    6)
+ * accessing volatiles <1>:               C++ Volatiles.      (line    6)
  * acos:                                  Other Builtins.     (line    6)
  * acosf:                                 Other Builtins.     (line    6)
  * acosh:                                 Other Builtins.     (line    6)
*************** Keyword Index
*** 52115,52126 ****
  * acoshl:                                Other Builtins.     (line    6)
  * acosl:                                 Other Builtins.     (line    6)
  * Ada:                                   G++ and GCC.        (line    6)
  * additional floating types:             Floating Types.     (line    6)
! * address constraints:                   Simple Constraints. (line  154)
  * address of a label:                    Labels as Values.   (line    6)
  * address variable attribute, AVR:       Variable Attributes.
!                                                              (line  375)
! * address_operand:                       Simple Constraints. (line  158)
  * alias function attribute:              Function Attributes.
                                                               (line   40)
  * aligned function attribute:            Function Attributes.
--- 51817,51829 ----
  * acoshl:                                Other Builtins.     (line    6)
  * acosl:                                 Other Builtins.     (line    6)
  * Ada:                                   G++ and GCC.        (line    6)
+ * Ada <1>:                               G++ and GCC.        (line   30)
  * additional floating types:             Floating Types.     (line    6)
! * address constraints:                   Simple Constraints. (line  152)
  * address of a label:                    Labels as Values.   (line    6)
  * address variable attribute, AVR:       Variable Attributes.
!                                                              (line  371)
! * address_operand:                       Simple Constraints. (line  156)
  * alias function attribute:              Function Attributes.
                                                               (line   40)
  * aligned function attribute:            Function Attributes.
*************** Keyword Index
*** 52129,52147 ****
  * aligned variable attribute:            Variable Attributes.
                                                               (line   24)
  * alignment:                             Alignment.          (line    6)
  * alloc_align function attribute:        Function Attributes.
                                                               (line   94)
  * alloc_size function attribute:         Function Attributes.
                                                               (line   73)
- * alloca:                                Other Builtins.     (line    6)
- * alloca vs variable-length arrays:      Variable Length.    (line   35)
  * Allow nesting in an interrupt handler on the Blackfin processor: Function Attributes.
!                                                              (line 1056)
  * Altera Nios II options:                Nios II Options.    (line    6)
  * alternate keywords:                    Alternate Keywords. (line    6)
! * altivec type attribute, PowerPC:       Type Attributes.    (line  363)
  * altivec variable attribute, PowerPC:   Variable Attributes.
!                                                              (line  518)
  * always_inline function attribute:      Function Attributes.
                                                               (line  126)
  * AMD1:                                  Standards.          (line   13)
--- 51832,51850 ----
  * aligned variable attribute:            Variable Attributes.
                                                               (line   24)
  * alignment:                             Alignment.          (line    6)
+ * alloca:                                Other Builtins.     (line    6)
+ * alloca vs variable-length arrays:      Variable Length.    (line   35)
  * alloc_align function attribute:        Function Attributes.
                                                               (line   94)
  * alloc_size function attribute:         Function Attributes.
                                                               (line   73)
  * Allow nesting in an interrupt handler on the Blackfin processor: Function Attributes.
!                                                              (line 1050)
  * Altera Nios II options:                Nios II Options.    (line    6)
  * alternate keywords:                    Alternate Keywords. (line    6)
! * altivec type attribute, PowerPC:       Type Attributes.    (line  362)
  * altivec variable attribute, PowerPC:   Variable Attributes.
!                                                              (line  509)
  * always_inline function attribute:      Function Attributes.
                                                               (line  126)
  * AMD1:                                  Standards.          (line   13)
*************** Keyword Index
*** 52153,52181 ****
  * apostrophes:                           Incompatibilities.  (line  116)
  * application binary interface:          Compatibility.      (line    6)
  * ARC options:                           ARC Options.        (line    6)
  * ARM [Annotated C++ Reference Manual]:  Backwards Compatibility.
                                                               (line    6)
- * ARM options:                           ARM Options.        (line    6)
  * arrays of length zero:                 Zero Length.        (line    6)
  * arrays of variable length:             Variable Length.    (line    6)
  * arrays, non-lvalue:                    Subscripting.       (line    6)
  * artificial function attribute:         Function Attributes.
!                                                              (line  174)
  * asin:                                  Other Builtins.     (line    6)
  * asinf:                                 Other Builtins.     (line    6)
  * asinh:                                 Other Builtins.     (line    6)
  * asinhf:                                Other Builtins.     (line    6)
  * asinhl:                                Other Builtins.     (line    6)
  * asinl:                                 Other Builtins.     (line    6)
! * asm assembler template:                Extended Asm.       (line  219)
! * asm clobbers:                          Extended Asm.       (line  578)
  * asm constraints:                       Constraints.        (line    6)
! * asm expressions:                       Extended Asm.       (line  482)
! * asm goto labels:                       Extended Asm.       (line  648)
! * asm input operands:                    Extended Asm.       (line  482)
  * asm keyword:                           Using Assembly Language with C.
                                                               (line    6)
! * asm output operands:                   Extended Asm.       (line  322)
  * asm volatile:                          Extended Asm.       (line  109)
  * assembler names for identifiers:       Asm Labels.         (line    6)
  * assembly code, invalid:                Bug Criteria.       (line   12)
--- 51856,51884 ----
  * apostrophes:                           Incompatibilities.  (line  116)
  * application binary interface:          Compatibility.      (line    6)
  * ARC options:                           ARC Options.        (line    6)
+ * ARM options:                           ARM Options.        (line    6)
  * ARM [Annotated C++ Reference Manual]:  Backwards Compatibility.
                                                               (line    6)
  * arrays of length zero:                 Zero Length.        (line    6)
  * arrays of variable length:             Variable Length.    (line    6)
  * arrays, non-lvalue:                    Subscripting.       (line    6)
  * artificial function attribute:         Function Attributes.
!                                                              (line  172)
  * asin:                                  Other Builtins.     (line    6)
  * asinf:                                 Other Builtins.     (line    6)
  * asinh:                                 Other Builtins.     (line    6)
  * asinhf:                                Other Builtins.     (line    6)
  * asinhl:                                Other Builtins.     (line    6)
  * asinl:                                 Other Builtins.     (line    6)
! * asm assembler template:                Extended Asm.       (line  218)
! * asm clobbers:                          Extended Asm.       (line  575)
  * asm constraints:                       Constraints.        (line    6)
! * asm expressions:                       Extended Asm.       (line  480)
! * asm goto labels:                       Extended Asm.       (line  644)
! * asm input operands:                    Extended Asm.       (line  480)
  * asm keyword:                           Using Assembly Language with C.
                                                               (line    6)
! * asm output operands:                   Extended Asm.       (line  321)
  * asm volatile:                          Extended Asm.       (line  109)
  * assembler names for identifiers:       Asm Labels.         (line    6)
  * assembly code, invalid:                Bug Criteria.       (line   12)
*************** Keyword Index
*** 52204,52244 ****
  * Backwards Compatibility:               Backwards Compatibility.
                                                               (line    6)
  * bank_switch function attribute, M32C:  Function Attributes.
!                                                              (line  181)
  * base class members:                    Name lookup.        (line    6)
! * based type attribute, MeP:             Type Attributes.    (line  349)
  * based variable attribute, MeP:         Variable Attributes.
!                                                              (line  470)
  * basic asm:                             Basic Asm.          (line    6)
  * bcmp:                                  Other Builtins.     (line    6)
  * below100 variable attribute, Xstormy16: Variable Attributes.
!                                                              (line  656)
  * binary compatibility:                  Compatibility.      (line    6)
  * Binary constants using the 0b prefix:  Binary constants.   (line    6)
  * Blackfin Options:                      Blackfin Options.   (line    6)
  * bnd_instrument function attribute:     Function Attributes.
!                                                              (line 1327)
  * bnd_legacy function attribute:         Function Attributes.
!                                                              (line 1322)
  * bnd_variable_size type attribute:      Type Attributes.    (line  295)
  * bound pointer to member function:      Bound member functions.
                                                               (line    6)
  * break handler functions:               Function Attributes.
!                                                              (line 1416)
  * break_handler function attribute, MicroBlaze: Function Attributes.
!                                                              (line 1416)
  * brk_interrupt function attribute, RL78: Function Attributes.
!                                                              (line  798)
  * bug criteria:                          Bug Criteria.       (line    6)
  * bugs:                                  Bugs.               (line    6)
  * bugs, known:                           Trouble.            (line    6)
  * built-in functions <1>:                Other Builtins.     (line    6)
- * built-in functions:                    C Dialect Options.  (line  213)
  * bzero:                                 Other Builtins.     (line    6)
  * C compilation options:                 Invoking GCC.       (line   17)
  * C intermediate output, nonexistent:    G++ and GCC.        (line   35)
  * C language extensions:                 C Extensions.       (line    6)
! * C language, traditional:               C Dialect Options.  (line  344)
  * C standard:                            Standards.          (line   13)
  * C standards:                           Standards.          (line   13)
  * c++:                                   Invoking G++.       (line   14)
--- 51907,51947 ----
  * Backwards Compatibility:               Backwards Compatibility.
                                                               (line    6)
  * bank_switch function attribute, M32C:  Function Attributes.
!                                                              (line  179)
  * base class members:                    Name lookup.        (line    6)
! * based type attribute, MeP:             Type Attributes.    (line  348)
  * based variable attribute, MeP:         Variable Attributes.
!                                                              (line  464)
  * basic asm:                             Basic Asm.          (line    6)
  * bcmp:                                  Other Builtins.     (line    6)
  * below100 variable attribute, Xstormy16: Variable Attributes.
!                                                              (line  648)
  * binary compatibility:                  Compatibility.      (line    6)
  * Binary constants using the 0b prefix:  Binary constants.   (line    6)
  * Blackfin Options:                      Blackfin Options.   (line    6)
  * bnd_instrument function attribute:     Function Attributes.
!                                                              (line 1321)
  * bnd_legacy function attribute:         Function Attributes.
!                                                              (line 1316)
  * bnd_variable_size type attribute:      Type Attributes.    (line  295)
  * bound pointer to member function:      Bound member functions.
                                                               (line    6)
  * break handler functions:               Function Attributes.
!                                                              (line 1409)
  * break_handler function attribute, MicroBlaze: Function Attributes.
!                                                              (line 1409)
  * brk_interrupt function attribute, RL78: Function Attributes.
!                                                              (line  786)
  * bug criteria:                          Bug Criteria.       (line    6)
  * bugs:                                  Bugs.               (line    6)
  * bugs, known:                           Trouble.            (line    6)
+ * built-in functions:                    C Dialect Options.  (line  210)
  * built-in functions <1>:                Other Builtins.     (line    6)
  * bzero:                                 Other Builtins.     (line    6)
  * C compilation options:                 Invoking GCC.       (line   17)
  * C intermediate output, nonexistent:    G++ and GCC.        (line   35)
  * C language extensions:                 C Extensions.       (line    6)
! * C language, traditional:               C Dialect Options.  (line  345)
  * C standard:                            Standards.          (line   13)
  * C standards:                           Standards.          (line   13)
  * c++:                                   Invoking G++.       (line   14)
*************** Keyword Index
*** 52265,52272 ****
  * C95:                                   Standards.          (line   13)
  * C99:                                   Standards.          (line   13)
  * C9X:                                   Standards.          (line   13)
- * C_INCLUDE_PATH:                        Environment Variables.
-                                                              (line  130)
  * cabs:                                  Other Builtins.     (line    6)
  * cabsf:                                 Other Builtins.     (line    6)
  * cabsl:                                 Other Builtins.     (line    6)
--- 51968,51973 ----
*************** Keyword Index
*** 52277,52285 ****
  * cacoshl:                               Other Builtins.     (line    6)
  * cacosl:                                Other Builtins.     (line    6)
  * callee_pop_aggregate_return function attribute, x86: Function Attributes.
!                                                              (line 1011)
  * calling functions through the function vector on H8/300, M16C, M32C and SH2A processors: Function Attributes.
!                                                              (line  537)
  * calloc:                                Other Builtins.     (line    6)
  * caret:                                 Multi-Alternative.  (line   38)
  * caret GCC_COLORS capability:           Language Independent Options.
--- 51978,51986 ----
  * cacoshl:                               Other Builtins.     (line    6)
  * cacosl:                                Other Builtins.     (line    6)
  * callee_pop_aggregate_return function attribute, x86: Function Attributes.
!                                                              (line 1002)
  * calling functions through the function vector on H8/300, M16C, M32C and SH2A processors: Function Attributes.
!                                                              (line  531)
  * calloc:                                Other Builtins.     (line    6)
  * caret:                                 Multi-Alternative.  (line   38)
  * caret GCC_COLORS capability:           Language Independent Options.
*************** Keyword Index
*** 52303,52309 ****
  * catanhl:                               Other Builtins.     (line    6)
  * catanl:                                Other Builtins.     (line    6)
  * cb variable attribute, MeP:            Variable Attributes.
!                                                              (line  502)
  * cbrt:                                  Other Builtins.     (line    6)
  * cbrtf:                                 Other Builtins.     (line    6)
  * cbrtl:                                 Other Builtins.     (line    6)
--- 52004,52010 ----
  * catanhl:                               Other Builtins.     (line    6)
  * catanl:                                Other Builtins.     (line    6)
  * cb variable attribute, MeP:            Variable Attributes.
!                                                              (line  494)
  * cbrt:                                  Other Builtins.     (line    6)
  * cbrtf:                                 Other Builtins.     (line    6)
  * cbrtl:                                 Other Builtins.     (line    6)
*************** Keyword Index
*** 52314,52320 ****
  * ccoshl:                                Other Builtins.     (line    6)
  * ccosl:                                 Other Builtins.     (line    6)
  * cdecl function attribute, x86-32:      Function Attributes.
!                                                              (line  217)
  * ceil:                                  Other Builtins.     (line    6)
  * ceilf:                                 Other Builtins.     (line    6)
  * ceill:                                 Other Builtins.     (line    6)
--- 52015,52021 ----
  * ccoshl:                                Other Builtins.     (line    6)
  * ccosl:                                 Other Builtins.     (line    6)
  * cdecl function attribute, x86-32:      Function Attributes.
!                                                              (line  215)
  * ceil:                                  Other Builtins.     (line    6)
  * ceilf:                                 Other Builtins.     (line    6)
  * ceill:                                 Other Builtins.     (line    6)
*************** Keyword Index
*** 52325,52331 ****
                                                               (line  553)
  * character set, input:                  Preprocessor Options.
                                                               (line  566)
! * character set, input normalization:    Warning Options.    (line 1481)
  * character set, wide execution:         Preprocessor Options.
                                                               (line  558)
  * cimag:                                 Other Builtins.     (line    6)
--- 52026,52032 ----
                                                               (line  553)
  * character set, input:                  Preprocessor Options.
                                                               (line  566)
! * character set, input normalization:    Warning Options.    (line 1471)
  * character set, wide execution:         Preprocessor Options.
                                                               (line  558)
  * cimag:                                 Other Builtins.     (line    6)
*************** Keyword Index
*** 52340,52353 ****
  * code generation conventions:           Code Gen Options.   (line    6)
  * code, mixed with declarations:         Mixed Declarations. (line    6)
  * cold function attribute:               Function Attributes.
!                                                              (line 1286)
  * cold label attribute:                  Label Attributes.   (line   43)
  * command options:                       Invoking GCC.       (line    6)
  * comments, C++ style:                   C++ Comments.       (line    6)
  * common variable attribute:             Variable Attributes.
!                                                              (line  106)
  * comparison of signed and unsigned values, warning: Warning Options.
!                                                              (line 1299)
  * compiler bugs, reporting:              Bug Reporting.      (line    6)
  * compiler compared to C++ preprocessor: G++ and GCC.        (line   35)
  * compiler options, C++:                 C++ Dialect Options.
--- 52041,52054 ----
  * code generation conventions:           Code Gen Options.   (line    6)
  * code, mixed with declarations:         Mixed Declarations. (line    6)
  * cold function attribute:               Function Attributes.
!                                                              (line 1280)
  * cold label attribute:                  Label Attributes.   (line   43)
  * command options:                       Invoking GCC.       (line    6)
  * comments, C++ style:                   C++ Comments.       (line    6)
  * common variable attribute:             Variable Attributes.
!                                                              (line  105)
  * comparison of signed and unsigned values, warning: Warning Options.
!                                                              (line 1289)
  * compiler bugs, reporting:              Bug Reporting.      (line    6)
  * compiler compared to C++ preprocessor: G++ and GCC.        (line   35)
  * compiler options, C++:                 C++ Dialect Options.
*************** Keyword Index
*** 52369,52386 ****
  * const applied to function:             Function Attributes.
                                                               (line    6)
  * const function attribute:              Function Attributes.
!                                                              (line  223)
  * const qualifier:                       Pointers to Arrays. (line    6)
! * constants in constraints:              Simple Constraints. (line   70)
  * constraint modifier characters:        Modifiers.          (line    6)
! * constraint, matching:                  Simple Constraints. (line  139)
  * constraints, asm:                      Constraints.        (line    6)
  * constraints, machine specific:         Machine Constraints.
                                                               (line    6)
  * constructing calls:                    Constructing Calls. (line    6)
  * constructor expressions:               Compound Literals.  (line    6)
  * constructor function attribute:        Function Attributes.
!                                                              (line  238)
  * contributors:                          Contributors.       (line    6)
  * copysign:                              Other Builtins.     (line    6)
  * copysignf:                             Other Builtins.     (line    6)
--- 52070,52087 ----
  * const applied to function:             Function Attributes.
                                                               (line    6)
  * const function attribute:              Function Attributes.
!                                                              (line  221)
  * const qualifier:                       Pointers to Arrays. (line    6)
! * constants in constraints:              Simple Constraints. (line   68)
  * constraint modifier characters:        Modifiers.          (line    6)
! * constraint, matching:                  Simple Constraints. (line  137)
  * constraints, asm:                      Constraints.        (line    6)
  * constraints, machine specific:         Machine Constraints.
                                                               (line    6)
  * constructing calls:                    Constructing Calls. (line    6)
  * constructor expressions:               Compound Literals.  (line    6)
  * constructor function attribute:        Function Attributes.
!                                                              (line  236)
  * contributors:                          Contributors.       (line    6)
  * copysign:                              Other Builtins.     (line    6)
  * copysignf:                             Other Builtins.     (line    6)
*************** Keyword Index
*** 52393,52401 ****
  * coshl:                                 Other Builtins.     (line    6)
  * cosl:                                  Other Builtins.     (line    6)
  * CPATH:                                 Environment Variables.
!                                                              (line  129)
  * CPLUS_INCLUDE_PATH:                    Environment Variables.
!                                                              (line  131)
  * cpow:                                  Other Builtins.     (line    6)
  * cpowf:                                 Other Builtins.     (line    6)
  * cpowl:                                 Other Builtins.     (line    6)
--- 52094,52102 ----
  * coshl:                                 Other Builtins.     (line    6)
  * cosl:                                  Other Builtins.     (line    6)
  * CPATH:                                 Environment Variables.
!                                                              (line  127)
  * CPLUS_INCLUDE_PATH:                    Environment Variables.
!                                                              (line  129)
  * cpow:                                  Other Builtins.     (line    6)
  * cpowf:                                 Other Builtins.     (line    6)
  * cpowl:                                 Other Builtins.     (line    6)
*************** Keyword Index
*** 52408,52414 ****
  * creall:                                Other Builtins.     (line    6)
  * CRIS Options:                          CRIS Options.       (line    6)
  * critical function attribute, MSP430:   Function Attributes.
!                                                              (line  691)
  * cross compiling:                       Target Options.     (line    6)
  * csin:                                  Other Builtins.     (line    6)
  * csinf:                                 Other Builtins.     (line    6)
--- 52109,52115 ----
  * creall:                                Other Builtins.     (line    6)
  * CRIS Options:                          CRIS Options.       (line    6)
  * critical function attribute, MSP430:   Function Attributes.
!                                                              (line  684)
  * cross compiling:                       Target Options.     (line    6)
  * csin:                                  Other Builtins.     (line    6)
  * csinf:                                 Other Builtins.     (line    6)
*************** Keyword Index
*** 52425,52434 ****
  * ctanhf:                                Other Builtins.     (line    6)
  * ctanhl:                                Other Builtins.     (line    6)
  * ctanl:                                 Other Builtins.     (line    6)
  * Darwin options:                        Darwin Options.     (line    6)
  * dcgettext:                             Other Builtins.     (line    6)
- * DD integer suffix:                     Decimal Float.      (line    6)
  * dd integer suffix:                     Decimal Float.      (line    6)
  * deallocating variable length arrays:   Variable Length.    (line   22)
  * debugging information options:         Debugging Options.  (line    6)
  * decimal floating types:                Decimal Float.      (line    6)
--- 52126,52137 ----
  * ctanhf:                                Other Builtins.     (line    6)
  * ctanhl:                                Other Builtins.     (line    6)
  * ctanl:                                 Other Builtins.     (line    6)
+ * C_INCLUDE_PATH:                        Environment Variables.
+                                                              (line  128)
  * Darwin options:                        Darwin Options.     (line    6)
  * dcgettext:                             Other Builtins.     (line    6)
  * dd integer suffix:                     Decimal Float.      (line    6)
+ * DD integer suffix:                     Decimal Float.      (line    6)
  * deallocating variable length arrays:   Variable Length.    (line   22)
  * debugging information options:         Debugging Options.  (line    6)
  * decimal floating types:                Decimal Float.      (line    6)
*************** Keyword Index
*** 52440,52484 ****
  * declaring static data in C++:          Static Definitions. (line    6)
  * defining static data in C++:           Static Definitions. (line    6)
  * dependencies for make as output:       Environment Variables.
!                                                              (line  157)
  * dependencies, make:                    Preprocessor Options.
                                                               (line  185)
  * DEPENDENCIES_OUTPUT:                   Environment Variables.
!                                                              (line  156)
  * dependent name lookup:                 Name lookup.        (line    6)
  * deprecated function attribute:         Function Attributes.
!                                                              (line  260)
! * deprecated type attribute:             Type Attributes.    (line  205)
  * deprecated variable attribute:         Variable Attributes.
!                                                              (line  115)
  * designated initializers:               Designated Inits.   (line    6)
! * designated_init type attribute:        Type Attributes.    (line  283)
! * designator lists:                      Designated Inits.   (line   97)
  * designators:                           Designated Inits.   (line   64)
  * destructor function attribute:         Function Attributes.
!                                                              (line  238)
! * DF integer suffix:                     Decimal Float.      (line    6)
  * df integer suffix:                     Decimal Float.      (line    6)
  * dgettext:                              Other Builtins.     (line    6)
  * diagnostic messages:                   Language Independent Options.
                                                               (line    6)
  * dialect options:                       C Dialect Options.  (line    6)
! * digits in constraint:                  Simple Constraints. (line  127)
  * directory options:                     Directory Options.  (line    6)
  * disinterrupt function attribute, Epiphany: Function Attributes.
!                                                              (line  280)
  * disinterrupt function attribute, MeP:  Function Attributes.
!                                                              (line  280)
! * DL integer suffix:                     Decimal Float.      (line    6)
  * dl integer suffix:                     Decimal Float.      (line    6)
  * dllexport function attribute:          Function Attributes.
!                                                              (line  285)
  * dllexport variable attribute:          Variable Attributes.
!                                                              (line  311)
  * dllimport function attribute:          Function Attributes.
!                                                              (line  319)
  * dllimport variable attribute:          Variable Attributes.
!                                                              (line  307)
  * dollar sign:                           Multi-Alternative.  (line   42)
  * dollar signs in identifier names:      Dollar Signs.       (line    6)
  * double-word arithmetic:                Long Long.          (line    6)
--- 52143,52189 ----
  * declaring static data in C++:          Static Definitions. (line    6)
  * defining static data in C++:           Static Definitions. (line    6)
  * dependencies for make as output:       Environment Variables.
!                                                              (line  156)
! * dependencies for make as output <1>:   Environment Variables.
!                                                              (line  172)
  * dependencies, make:                    Preprocessor Options.
                                                               (line  185)
  * DEPENDENCIES_OUTPUT:                   Environment Variables.
!                                                              (line  155)
  * dependent name lookup:                 Name lookup.        (line    6)
  * deprecated function attribute:         Function Attributes.
!                                                              (line  258)
! * deprecated type attribute:             Type Attributes.    (line  206)
  * deprecated variable attribute:         Variable Attributes.
!                                                              (line  114)
  * designated initializers:               Designated Inits.   (line    6)
! * designated_init type attribute:        Type Attributes.    (line  284)
! * designator lists:                      Designated Inits.   (line   96)
  * designators:                           Designated Inits.   (line   64)
  * destructor function attribute:         Function Attributes.
!                                                              (line  236)
  * df integer suffix:                     Decimal Float.      (line    6)
+ * DF integer suffix:                     Decimal Float.      (line    6)
  * dgettext:                              Other Builtins.     (line    6)
  * diagnostic messages:                   Language Independent Options.
                                                               (line    6)
  * dialect options:                       C Dialect Options.  (line    6)
! * digits in constraint:                  Simple Constraints. (line  125)
  * directory options:                     Directory Options.  (line    6)
  * disinterrupt function attribute, Epiphany: Function Attributes.
!                                                              (line  278)
  * disinterrupt function attribute, MeP:  Function Attributes.
!                                                              (line  278)
  * dl integer suffix:                     Decimal Float.      (line    6)
+ * DL integer suffix:                     Decimal Float.      (line    6)
  * dllexport function attribute:          Function Attributes.
!                                                              (line  283)
  * dllexport variable attribute:          Variable Attributes.
!                                                              (line  308)
  * dllimport function attribute:          Function Attributes.
!                                                              (line  315)
  * dllimport variable attribute:          Variable Attributes.
!                                                              (line  304)
  * dollar sign:                           Multi-Alternative.  (line   42)
  * dollar signs in identifier names:      Dollar Signs.       (line    6)
  * double-word arithmetic:                Long Long.          (line    6)
*************** Keyword Index
*** 52486,52500 ****
  * drem:                                  Other Builtins.     (line    6)
  * dremf:                                 Other Builtins.     (line    6)
  * dreml:                                 Other Builtins.     (line    6)
! * E in constraint:                       Simple Constraints. (line   89)
  * earlyclobber operand:                  Modifiers.          (line   25)
  * eight-bit data on the H8/300, H8/300H, and H8S: Variable Attributes.
!                                                              (line  408)
  * eightbit_data variable attribute, H8/300: Variable Attributes.
!                                                              (line  408)
! * EIND:                                  AVR Options.        (line  242)
  * empty structures:                      Empty Structures.   (line    6)
! * Enable Cilk Plus:                      C Dialect Options.  (line  288)
  * environment variables:                 Environment Variables.
                                                               (line    6)
  * erf:                                   Other Builtins.     (line    6)
--- 52191,52205 ----
  * drem:                                  Other Builtins.     (line    6)
  * dremf:                                 Other Builtins.     (line    6)
  * dreml:                                 Other Builtins.     (line    6)
! * E in constraint:                       Simple Constraints. (line   87)
  * earlyclobber operand:                  Modifiers.          (line   25)
  * eight-bit data on the H8/300, H8/300H, and H8S: Variable Attributes.
!                                                              (line  403)
  * eightbit_data variable attribute, H8/300: Variable Attributes.
!                                                              (line  403)
! * EIND:                                  AVR Options.        (line  247)
  * empty structures:                      Empty Structures.   (line    6)
! * Enable Cilk Plus:                      C Dialect Options.  (line  289)
  * environment variables:                 Environment Variables.
                                                               (line    6)
  * erf:                                   Other Builtins.     (line    6)
*************** Keyword Index
*** 52504,52523 ****
  * erff:                                  Other Builtins.     (line    6)
  * erfl:                                  Other Builtins.     (line    6)
  * error function attribute:              Function Attributes.
!                                                              (line  193)
  * error GCC_COLORS capability:           Language Independent Options.
                                                               (line   69)
  * error messages:                        Warnings and Errors.
                                                               (line    6)
  * escaped newlines:                      Escaped Newlines.   (line    6)
  * exception function attribute:          Function Attributes.
!                                                              (line  371)
  * exception handler functions, Blackfin: Function Attributes.
-                                                              (line  376)
- * exception handler functions, NDS32:    Function Attributes.
                                                               (line  371)
  * exception_handler function attribute:  Function Attributes.
!                                                              (line  376)
  * exclamation point:                     Multi-Alternative.  (line   33)
  * exit:                                  Other Builtins.     (line    6)
  * exp:                                   Other Builtins.     (line    6)
--- 52209,52228 ----
  * erff:                                  Other Builtins.     (line    6)
  * erfl:                                  Other Builtins.     (line    6)
  * error function attribute:              Function Attributes.
!                                                              (line  191)
  * error GCC_COLORS capability:           Language Independent Options.
                                                               (line   69)
  * error messages:                        Warnings and Errors.
                                                               (line    6)
  * escaped newlines:                      Escaped Newlines.   (line    6)
  * exception function attribute:          Function Attributes.
!                                                              (line  366)
  * exception handler functions, Blackfin: Function Attributes.
                                                               (line  371)
+ * exception handler functions, NDS32:    Function Attributes.
+                                                              (line  366)
  * exception_handler function attribute:  Function Attributes.
!                                                              (line  371)
  * exclamation point:                     Multi-Alternative.  (line   33)
  * exit:                                  Other Builtins.     (line    6)
  * exp:                                   Other Builtins.     (line    6)
*************** Keyword Index
*** 52536,52565 ****
  * expressions containing statements:     Statement Exprs.    (line    6)
  * expressions, constructor:              Compound Literals.  (line    6)
  * extended asm:                          Extended Asm.       (line    6)
! * extensible constraints:                Simple Constraints. (line  163)
  * extensions, ?::                        Conditionals.       (line    6)
  * extensions, C language:                C Extensions.       (line    6)
  * extensions, C++ language:              C++ Extensions.     (line    6)
  * external declaration scope:            Incompatibilities.  (line   80)
  * externally_visible function attribute: Function Attributes.
!                                                              (line  382)
! * F in constraint:                       Simple Constraints. (line   94)
  * fabs:                                  Other Builtins.     (line    6)
  * fabsf:                                 Other Builtins.     (line    6)
  * fabsl:                                 Other Builtins.     (line    6)
  * far function attribute:                Function Attributes.
!                                                              (line  395)
  * far function attribute, MIPS:          Function Attributes.
!                                                              (line  924)
! * far type attribute, MeP:               Type Attributes.    (line  349)
  * far variable attribute, MeP:           Variable Attributes.
!                                                              (line  485)
  * fast_interrupt function attribute, M32C: Function Attributes.
!                                                              (line  400)
  * fast_interrupt function attribute, RX: Function Attributes.
!                                                              (line  400)
! * fastcall function attribute, x86-32:   Function Attributes.
!                                                              (line  406)
  * fatal signal:                          Bug Criteria.       (line    9)
  * fdim:                                  Other Builtins.     (line    6)
  * fdimf:                                 Other Builtins.     (line    6)
--- 52241,52270 ----
  * expressions containing statements:     Statement Exprs.    (line    6)
  * expressions, constructor:              Compound Literals.  (line    6)
  * extended asm:                          Extended Asm.       (line    6)
! * extensible constraints:                Simple Constraints. (line  161)
  * extensions, ?::                        Conditionals.       (line    6)
  * extensions, C language:                C Extensions.       (line    6)
  * extensions, C++ language:              C++ Extensions.     (line    6)
  * external declaration scope:            Incompatibilities.  (line   80)
  * externally_visible function attribute: Function Attributes.
!                                                              (line  377)
! * F in constraint:                       Simple Constraints. (line   92)
  * fabs:                                  Other Builtins.     (line    6)
  * fabsf:                                 Other Builtins.     (line    6)
  * fabsl:                                 Other Builtins.     (line    6)
  * far function attribute:                Function Attributes.
!                                                              (line  390)
  * far function attribute, MIPS:          Function Attributes.
!                                                              (line  911)
! * far type attribute, MeP:               Type Attributes.    (line  348)
  * far variable attribute, MeP:           Variable Attributes.
!                                                              (line  478)
! * fastcall function attribute, x86-32:   Function Attributes.
!                                                              (line  402)
  * fast_interrupt function attribute, M32C: Function Attributes.
!                                                              (line  396)
  * fast_interrupt function attribute, RX: Function Attributes.
!                                                              (line  396)
  * fatal signal:                          Bug Criteria.       (line    9)
  * fdim:                                  Other Builtins.     (line    6)
  * fdimf:                                 Other Builtins.     (line    6)
*************** Keyword Index
*** 52571,52581 ****
  * file names:                            Link Options.       (line   10)
  * fixed-point types:                     Fixed-Point.        (line    6)
  * flatten function attribute:            Function Attributes.
!                                                              (line  186)
  * flexible array members:                Zero Length.        (line    6)
  * float as function value type:          Incompatibilities.  (line  141)
  * floating point precision:              Disappointments.    (line   68)
! * floating-point precision:              Optimize Options.   (line 2043)
  * floor:                                 Other Builtins.     (line    6)
  * floorf:                                Other Builtins.     (line    6)
  * floorl:                                Other Builtins.     (line    6)
--- 52276,52286 ----
  * file names:                            Link Options.       (line   10)
  * fixed-point types:                     Fixed-Point.        (line    6)
  * flatten function attribute:            Function Attributes.
!                                                              (line  184)
  * flexible array members:                Zero Length.        (line    6)
  * float as function value type:          Incompatibilities.  (line  141)
  * floating point precision:              Disappointments.    (line   68)
! * floating-point precision:              Optimize Options.   (line 2037)
  * floor:                                 Other Builtins.     (line    6)
  * floorf:                                Other Builtins.     (line    6)
  * floorl:                                Other Builtins.     (line    6)
*************** Keyword Index
*** 52592,52605 ****
  * fmodf:                                 Other Builtins.     (line    6)
  * fmodl:                                 Other Builtins.     (line    6)
  * force_align_arg_pointer function attribute, x86: Function Attributes.
!                                                              (line 1368)
  * format function attribute:             Function Attributes.
!                                                              (line  424)
  * format_arg function attribute:         Function Attributes.
!                                                              (line  490)
  * Fortran:                               G++ and GCC.        (line    6)
  * forwarder_section function attribute, Epiphany: Function Attributes.
!                                                              (line  729)
  * forwarding calls:                      Constructing Calls. (line    6)
  * fprintf:                               Other Builtins.     (line    6)
  * fprintf_unlocked:                      Other Builtins.     (line    6)
--- 52297,52310 ----
  * fmodf:                                 Other Builtins.     (line    6)
  * fmodl:                                 Other Builtins.     (line    6)
  * force_align_arg_pointer function attribute, x86: Function Attributes.
!                                                              (line 1361)
  * format function attribute:             Function Attributes.
!                                                              (line  420)
  * format_arg function attribute:         Function Attributes.
!                                                              (line  485)
  * Fortran:                               G++ and GCC.        (line    6)
  * forwarder_section function attribute, Epiphany: Function Attributes.
!                                                              (line  721)
  * forwarding calls:                      Constructing Calls. (line    6)
  * fprintf:                               Other Builtins.     (line    6)
  * fprintf_unlocked:                      Other Builtins.     (line    6)
*************** Keyword Index
*** 52615,52621 ****
  * fscanf:                                Other Builtins.     (line    6)
  * fscanf, and constant strings:          Incompatibilities.  (line   17)
  * function addressability on the M32R/D: Function Attributes.
!                                                              (line  978)
  * function attributes:                   Function Attributes.
                                                               (line    6)
  * function pointers, arithmetic:         Pointer Arith.      (line    6)
--- 52320,52326 ----
  * fscanf:                                Other Builtins.     (line    6)
  * fscanf, and constant strings:          Incompatibilities.  (line   17)
  * function addressability on the M32R/D: Function Attributes.
!                                                              (line  967)
  * function attributes:                   Function Attributes.
                                                               (line    6)
  * function pointers, arithmetic:         Pointer Arith.      (line    6)
*************** Keyword Index
*** 52624,52651 ****
  * function versions:                     Function Multiversioning.
                                                               (line    6)
  * function without prologue/epilogue code: Function Attributes.
!                                                              (line 1040)
  * function, size of pointer to:          Pointer Arith.      (line    6)
- * function_vector function attribute, H8/300: Function Attributes.
-                                                              (line  537)
- * function_vector function attribute, M16C/M32C: Function Attributes.
-                                                              (line  537)
- * function_vector function attribute, SH: Function Attributes.
-                                                              (line  537)
  * functions in arbitrary sections:       Function Attributes.
                                                               (line    6)
  * functions that are dynamically resolved: Function Attributes.
                                                               (line    6)
  * functions that are passed arguments in registers on x86-32: Function Attributes.
                                                               (line    6)
  * functions that behave like malloc:     Function Attributes.
                                                               (line    6)
  * functions that do not handle memory bank switching on 68HC11/68HC12: Function Attributes.
!                                                              (line 1051)
  * functions that do not pop the argument stack on x86-32: Function Attributes.
                                                               (line    6)
  * functions that do pop the argument stack on x86-32: Function Attributes.
!                                                              (line  217)
  * functions that have different compilation options on x86-32: Function Attributes.
                                                               (line    6)
  * functions that have different optimization options: Function Attributes.
--- 52329,52352 ----
  * function versions:                     Function Multiversioning.
                                                               (line    6)
  * function without prologue/epilogue code: Function Attributes.
!                                                              (line 1034)
  * function, size of pointer to:          Pointer Arith.      (line    6)
  * functions in arbitrary sections:       Function Attributes.
                                                               (line    6)
  * functions that are dynamically resolved: Function Attributes.
                                                               (line    6)
  * functions that are passed arguments in registers on x86-32: Function Attributes.
                                                               (line    6)
+ * functions that are passed arguments in registers on x86-32 <1>: Function Attributes.
+                                                              (line 1326)
  * functions that behave like malloc:     Function Attributes.
                                                               (line    6)
  * functions that do not handle memory bank switching on 68HC11/68HC12: Function Attributes.
!                                                              (line 1045)
  * functions that do not pop the argument stack on x86-32: Function Attributes.
                                                               (line    6)
  * functions that do pop the argument stack on x86-32: Function Attributes.
!                                                              (line  215)
  * functions that have different compilation options on x86-32: Function Attributes.
                                                               (line    6)
  * functions that have different optimization options: Function Attributes.
*************** Keyword Index
*** 52656,52677 ****
                                                               (line    6)
  * functions that pop the argument stack on x86-32: Function Attributes.
                                                               (line    6)
  * functions that return more than once:  Function Attributes.
                                                               (line    6)
  * functions with non-null pointer arguments: Function Attributes.
                                                               (line    6)
  * functions with printf, scanf, strftime or strfmon style arguments: Function Attributes.
                                                               (line    6)
! * g in constraint:                       Simple Constraints. (line  120)
! * G in constraint:                       Simple Constraints. (line   98)
  * g++:                                   Invoking G++.       (line   14)
  * G++:                                   G++ and GCC.        (line   30)
  * gamma:                                 Other Builtins.     (line    6)
- * gamma_r:                               Other Builtins.     (line    6)
  * gammaf:                                Other Builtins.     (line    6)
  * gammaf_r:                              Other Builtins.     (line    6)
  * gammal:                                Other Builtins.     (line    6)
  * gammal_r:                              Other Builtins.     (line    6)
  * GCC:                                   G++ and GCC.        (line    6)
  * GCC command options:                   Invoking GCC.       (line    6)
  * GCC_COLORS environment variable:       Language Independent Options.
--- 52357,52390 ----
                                                               (line    6)
  * functions that pop the argument stack on x86-32: Function Attributes.
                                                               (line    6)
+ * functions that pop the argument stack on x86-32 <1>: Function Attributes.
+                                                              (line  402)
+ * functions that pop the argument stack on x86-32 <2>: Function Attributes.
+                                                              (line  410)
+ * functions that pop the argument stack on x86-32 <3>: Function Attributes.
+                                                              (line 1493)
  * functions that return more than once:  Function Attributes.
                                                               (line    6)
  * functions with non-null pointer arguments: Function Attributes.
                                                               (line    6)
  * functions with printf, scanf, strftime or strfmon style arguments: Function Attributes.
                                                               (line    6)
! * function_vector function attribute, H8/300: Function Attributes.
!                                                              (line  531)
! * function_vector function attribute, M16C/M32C: Function Attributes.
!                                                              (line  531)
! * function_vector function attribute, SH: Function Attributes.
!                                                              (line  531)
! * G in constraint:                       Simple Constraints. (line   96)
! * g in constraint:                       Simple Constraints. (line  118)
  * g++:                                   Invoking G++.       (line   14)
  * G++:                                   G++ and GCC.        (line   30)
  * gamma:                                 Other Builtins.     (line    6)
  * gammaf:                                Other Builtins.     (line    6)
  * gammaf_r:                              Other Builtins.     (line    6)
  * gammal:                                Other Builtins.     (line    6)
  * gammal_r:                              Other Builtins.     (line    6)
+ * gamma_r:                               Other Builtins.     (line    6)
  * GCC:                                   G++ and GCC.        (line    6)
  * GCC command options:                   Invoking GCC.       (line    6)
  * GCC_COLORS environment variable:       Language Independent Options.
*************** Keyword Index
*** 52680,52694 ****
                                                               (line   52)
  * GCC_EXEC_PREFIX:                       Environment Variables.
                                                               (line   57)
! * gcc_struct type attribute, PowerPC:    Type Attributes.    (line  360)
! * gcc_struct type attribute, x86:        Type Attributes.    (line  392)
  * gcc_struct variable attribute, PowerPC: Variable Attributes.
!                                                              (line  515)
  * gcc_struct variable attribute, x86:    Variable Attributes.
!                                                              (line  536)
! * gcov:                                  Debugging Options.  (line  723)
  * gettext:                               Other Builtins.     (line    6)
! * global offset table:                   Code Gen Options.   (line  280)
  * global register after longjmp:         Global Reg Vars.    (line   65)
  * global register variables:             Global Reg Vars.    (line    6)
  * GNAT:                                  G++ and GCC.        (line   30)
--- 52393,52407 ----
                                                               (line   52)
  * GCC_EXEC_PREFIX:                       Environment Variables.
                                                               (line   57)
! * gcc_struct type attribute, PowerPC:    Type Attributes.    (line  359)
! * gcc_struct type attribute, x86:        Type Attributes.    (line  391)
  * gcc_struct variable attribute, PowerPC: Variable Attributes.
!                                                              (line  506)
  * gcc_struct variable attribute, x86:    Variable Attributes.
!                                                              (line  527)
! * gcov:                                  Debugging Options.  (line  725)
  * gettext:                               Other Builtins.     (line    6)
! * global offset table:                   Code Gen Options.   (line  279)
  * global register after longjmp:         Global Reg Vars.    (line   65)
  * global register variables:             Global Reg Vars.    (line    6)
  * GNAT:                                  G++ and GCC.        (line   30)
*************** Keyword Index
*** 52698,52737 ****
                                                               (line  136)
  * Go:                                    G++ and GCC.        (line    6)
  * goto with computed label:              Labels as Values.   (line    6)
! * gprof:                                 Debugging Options.  (line  645)
  * grouping options:                      Invoking GCC.       (line   26)
! * H in constraint:                       Simple Constraints. (line   98)
  * half-precision floating point:         Half-Precision.     (line    6)
  * hardware models and configurations, specifying: Submodel Options.
                                                               (line    6)
  * hex floats:                            Hex Floats.         (line    6)
  * highlight, color, colour:              Language Independent Options.
                                                               (line   35)
- * HK fixed-suffix:                       Fixed-Point.        (line    6)
  * hk fixed-suffix:                       Fixed-Point.        (line    6)
! * hosted environment <1>:                C Dialect Options.  (line  247)
  * hosted environment:                    Standards.          (line   13)
  * hosted implementation:                 Standards.          (line   13)
  * hot function attribute:                Function Attributes.
!                                                              (line 1276)
  * hot label attribute:                   Label Attributes.   (line   36)
  * hotpatch function attribute, S/390:    Function Attributes.
!                                                              (line 1028)
  * HPPA Options:                          HPPA Options.       (line    6)
- * HR fixed-suffix:                       Fixed-Point.        (line    6)
  * hr fixed-suffix:                       Fixed-Point.        (line    6)
  * hypot:                                 Other Builtins.     (line    6)
  * hypotf:                                Other Builtins.     (line    6)
  * hypotl:                                Other Builtins.     (line    6)
! * I in constraint:                       Simple Constraints. (line   81)
! * i in constraint:                       Simple Constraints. (line   70)
  * IA-64 Options:                         IA-64 Options.      (line    6)
  * IBM RS/6000 and PowerPC Options:       RS/6000 and PowerPC Options.
                                                               (line    6)
  * identifier names, dollar signs in:     Dollar Signs.       (line    6)
  * identifiers, names in assembler code:  Asm Labels.         (line    6)
  * ifunc function attribute:              Function Attributes.
!                                                              (line  598)
  * ilogb:                                 Other Builtins.     (line    6)
  * ilogbf:                                Other Builtins.     (line    6)
  * ilogbl:                                Other Builtins.     (line    6)
--- 52411,52451 ----
                                                               (line  136)
  * Go:                                    G++ and GCC.        (line    6)
  * goto with computed label:              Labels as Values.   (line    6)
! * gprof:                                 Debugging Options.  (line  650)
  * grouping options:                      Invoking GCC.       (line   26)
! * H in constraint:                       Simple Constraints. (line   96)
  * half-precision floating point:         Half-Precision.     (line    6)
  * hardware models and configurations, specifying: Submodel Options.
                                                               (line    6)
  * hex floats:                            Hex Floats.         (line    6)
  * highlight, color, colour:              Language Independent Options.
                                                               (line   35)
  * hk fixed-suffix:                       Fixed-Point.        (line    6)
! * HK fixed-suffix:                       Fixed-Point.        (line    6)
  * hosted environment:                    Standards.          (line   13)
+ * hosted environment <1>:                C Dialect Options.  (line  244)
+ * hosted environment <2>:                C Dialect Options.  (line  252)
  * hosted implementation:                 Standards.          (line   13)
  * hot function attribute:                Function Attributes.
!                                                              (line 1270)
  * hot label attribute:                   Label Attributes.   (line   36)
  * hotpatch function attribute, S/390:    Function Attributes.
!                                                              (line 1021)
  * HPPA Options:                          HPPA Options.       (line    6)
  * hr fixed-suffix:                       Fixed-Point.        (line    6)
+ * HR fixed-suffix:                       Fixed-Point.        (line    6)
  * hypot:                                 Other Builtins.     (line    6)
  * hypotf:                                Other Builtins.     (line    6)
  * hypotl:                                Other Builtins.     (line    6)
! * i in constraint:                       Simple Constraints. (line   68)
! * I in constraint:                       Simple Constraints. (line   79)
  * IA-64 Options:                         IA-64 Options.      (line    6)
  * IBM RS/6000 and PowerPC Options:       RS/6000 and PowerPC Options.
                                                               (line    6)
  * identifier names, dollar signs in:     Dollar Signs.       (line    6)
  * identifiers, names in assembler code:  Asm Labels.         (line    6)
  * ifunc function attribute:              Function Attributes.
!                                                              (line  592)
  * ilogb:                                 Other Builtins.     (line    6)
  * ilogbf:                                Other Builtins.     (line    6)
  * ilogbl:                                Other Builtins.     (line    6)
*************** Keyword Index
*** 52745,52765 ****
  * increment operators:                   Bug Criteria.       (line   17)
  * index:                                 Other Builtins.     (line    6)
  * indirect calls, ARC:                   Function Attributes.
!                                                              (line  886)
  * indirect calls, ARM:                   Function Attributes.
!                                                              (line  886)
  * indirect calls, Blackfin:              Function Attributes.
!                                                              (line  910)
  * indirect calls, Epiphany:              Function Attributes.
!                                                              (line  886)
  * indirect calls, MIPS:                  Function Attributes.
!                                                              (line  924)
  * indirect calls, PowerPC:               Function Attributes.
!                                                              (line  910)
! * init_priority variable attribute:      C++ Attributes.     (line   50)
  * initializations in expressions:        Compound Literals.  (line    6)
  * initializers with labeled elements:    Designated Inits.   (line    6)
  * initializers, non-constant:            Initializers.       (line    6)
  * inline assembly language:              Using Assembly Language with C.
                                                               (line    6)
  * inline automatic for C++ member fns:   Inline.             (line   71)
--- 52459,52479 ----
  * increment operators:                   Bug Criteria.       (line   17)
  * index:                                 Other Builtins.     (line    6)
  * indirect calls, ARC:                   Function Attributes.
!                                                              (line  873)
  * indirect calls, ARM:                   Function Attributes.
!                                                              (line  873)
  * indirect calls, Blackfin:              Function Attributes.
!                                                              (line  897)
  * indirect calls, Epiphany:              Function Attributes.
!                                                              (line  873)
  * indirect calls, MIPS:                  Function Attributes.
!                                                              (line  911)
  * indirect calls, PowerPC:               Function Attributes.
!                                                              (line  897)
  * initializations in expressions:        Compound Literals.  (line    6)
  * initializers with labeled elements:    Designated Inits.   (line    6)
  * initializers, non-constant:            Initializers.       (line    6)
+ * init_priority variable attribute:      C++ Attributes.     (line   50)
  * inline assembly language:              Using Assembly Language with C.
                                                               (line    6)
  * inline automatic for C++ member fns:   Inline.             (line   71)
*************** Keyword Index
*** 52771,52827 ****
  * interface and implementation headers, C++: C++ Interface.  (line    6)
  * intermediate C version, nonexistent:   G++ and GCC.        (line   35)
  * interrupt function attribute, ARC:     Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, ARM:     Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, AVR:     Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, CR16:    Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, Epiphany: Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, M32C:    Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, M32R/D:  Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, m68k:    Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, MeP:     Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, MIPS:    Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, MSP430:  Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, NDS32:   Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, RL78:    Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, RX:      Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, Visium:  Function Attributes.
!                                                              (line  638)
  * interrupt function attribute, Xstormy16: Function Attributes.
!                                                              (line  638)
  * interrupt_handler function attribute, Blackfin: Function Attributes.
!                                                              (line  821)
  * interrupt_handler function attribute, H8/300: Function Attributes.
!                                                              (line  821)
  * interrupt_handler function attribute, m68k: Function Attributes.
!                                                              (line  821)
  * interrupt_handler function attribute, SH: Function Attributes.
!                                                              (line  821)
  * interrupt_thread function attribute, fido: Function Attributes.
!                                                              (line  828)
  * introduction:                          Top.                (line    6)
  * invalid assembly code:                 Bug Criteria.       (line   12)
  * invalid input:                         Bug Criteria.       (line   42)
  * invoking g++:                          Invoking G++.       (line   22)
  * io variable attribute, AVR:            Variable Attributes.
!                                                              (line  351)
  * io variable attribute, MeP:            Variable Attributes.
!                                                              (line  491)
  * io_low variable attribute, AVR:        Variable Attributes.
!                                                              (line  369)
  * isalnum:                               Other Builtins.     (line    6)
  * isalpha:                               Other Builtins.     (line    6)
  * isascii:                               Other Builtins.     (line    6)
--- 52485,52541 ----
  * interface and implementation headers, C++: C++ Interface.  (line    6)
  * intermediate C version, nonexistent:   G++ and GCC.        (line   35)
  * interrupt function attribute, ARC:     Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, ARM:     Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, AVR:     Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, CR16:    Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, Epiphany: Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, M32C:    Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, M32R/D:  Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, m68k:    Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, MeP:     Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, MIPS:    Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, MSP430:  Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, NDS32:   Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, RL78:    Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, RX:      Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, Visium:  Function Attributes.
!                                                              (line  632)
  * interrupt function attribute, Xstormy16: Function Attributes.
!                                                              (line  632)
  * interrupt_handler function attribute, Blackfin: Function Attributes.
!                                                              (line  809)
  * interrupt_handler function attribute, H8/300: Function Attributes.
!                                                              (line  809)
  * interrupt_handler function attribute, m68k: Function Attributes.
!                                                              (line  809)
  * interrupt_handler function attribute, SH: Function Attributes.
!                                                              (line  809)
  * interrupt_thread function attribute, fido: Function Attributes.
!                                                              (line  815)
  * introduction:                          Top.                (line    6)
  * invalid assembly code:                 Bug Criteria.       (line   12)
  * invalid input:                         Bug Criteria.       (line   42)
  * invoking g++:                          Invoking G++.       (line   22)
  * io variable attribute, AVR:            Variable Attributes.
!                                                              (line  347)
  * io variable attribute, MeP:            Variable Attributes.
!                                                              (line  484)
  * io_low variable attribute, AVR:        Variable Attributes.
!                                                              (line  365)
  * isalnum:                               Other Builtins.     (line    6)
  * isalpha:                               Other Builtins.     (line    6)
  * isascii:                               Other Builtins.     (line    6)
*************** Keyword Index
*** 52845,52851 ****
  * isprint:                               Other Builtins.     (line    6)
  * ispunct:                               Other Builtins.     (line    6)
  * isr function attribute, ARM:           Function Attributes.
!                                                              (line  836)
  * isspace:                               Other Builtins.     (line    6)
  * isupper:                               Other Builtins.     (line    6)
  * iswalnum:                              Other Builtins.     (line    6)
--- 52559,52565 ----
  * isprint:                               Other Builtins.     (line    6)
  * ispunct:                               Other Builtins.     (line    6)
  * isr function attribute, ARM:           Function Attributes.
!                                                              (line  823)
  * isspace:                               Other Builtins.     (line    6)
  * isupper:                               Other Builtins.     (line    6)
  * iswalnum:                              Other Builtins.     (line    6)
*************** Keyword Index
*** 52868,52903 ****
  * j1f:                                   Other Builtins.     (line    6)
  * j1l:                                   Other Builtins.     (line    6)
  * Java:                                  G++ and GCC.        (line    6)
! * java_interface type attribute:         C++ Attributes.     (line   70)
  * jn:                                    Other Builtins.     (line    6)
  * jnf:                                   Other Builtins.     (line    6)
  * jnl:                                   Other Builtins.     (line    6)
- * K fixed-suffix:                        Fixed-Point.        (line    6)
  * k fixed-suffix:                        Fixed-Point.        (line    6)
  * keep_interrupts_masked function attribute, MIPS: Function Attributes.
!                                                              (line  751)
  * keywords, alternate:                   Alternate Keywords. (line    6)
  * known causes of trouble:               Trouble.            (line    6)
  * kspisusp function attribute, Blackfin: Function Attributes.
!                                                              (line  840)
  * l1_data variable attribute, Blackfin:  Variable Attributes.
!                                                              (line  390)
  * l1_data_A variable attribute, Blackfin: Variable Attributes.
!                                                              (line  390)
  * l1_data_B variable attribute, Blackfin: Variable Attributes.
!                                                              (line  390)
  * l1_text function attribute, Blackfin:  Function Attributes.
!                                                              (line  845)
  * l2 function attribute, Blackfin:       Function Attributes.
!                                                              (line  851)
  * l2 variable attribute, Blackfin:       Variable Attributes.
!                                                              (line  398)
  * Label Attributes:                      Label Attributes.   (line    6)
  * labeled elements in initializers:      Designated Inits.   (line    6)
  * labels as values:                      Labels as Values.   (line    6)
  * labs:                                  Other Builtins.     (line    6)
  * LANG:                                  Environment Variables.
                                                               (line   21)
  * language dialect options:              C Dialect Options.  (line    6)
  * LC_ALL:                                Environment Variables.
                                                               (line   21)
--- 52582,52619 ----
  * j1f:                                   Other Builtins.     (line    6)
  * j1l:                                   Other Builtins.     (line    6)
  * Java:                                  G++ and GCC.        (line    6)
! * java_interface type attribute:         C++ Attributes.     (line   71)
  * jn:                                    Other Builtins.     (line    6)
  * jnf:                                   Other Builtins.     (line    6)
  * jnl:                                   Other Builtins.     (line    6)
  * k fixed-suffix:                        Fixed-Point.        (line    6)
+ * K fixed-suffix:                        Fixed-Point.        (line    6)
  * keep_interrupts_masked function attribute, MIPS: Function Attributes.
!                                                              (line  743)
  * keywords, alternate:                   Alternate Keywords. (line    6)
  * known causes of trouble:               Trouble.            (line    6)
  * kspisusp function attribute, Blackfin: Function Attributes.
!                                                              (line  827)
  * l1_data variable attribute, Blackfin:  Variable Attributes.
!                                                              (line  385)
  * l1_data_A variable attribute, Blackfin: Variable Attributes.
!                                                              (line  385)
  * l1_data_B variable attribute, Blackfin: Variable Attributes.
!                                                              (line  385)
  * l1_text function attribute, Blackfin:  Function Attributes.
!                                                              (line  832)
  * l2 function attribute, Blackfin:       Function Attributes.
!                                                              (line  838)
  * l2 variable attribute, Blackfin:       Variable Attributes.
!                                                              (line  393)
  * Label Attributes:                      Label Attributes.   (line    6)
  * labeled elements in initializers:      Designated Inits.   (line    6)
  * labels as values:                      Labels as Values.   (line    6)
  * labs:                                  Other Builtins.     (line    6)
  * LANG:                                  Environment Variables.
                                                               (line   21)
+ * LANG <1>:                              Environment Variables.
+                                                              (line  106)
  * language dialect options:              C Dialect Options.  (line    6)
  * LC_ALL:                                Environment Variables.
                                                               (line   21)
*************** Keyword Index
*** 52909,52935 ****
  * ldexpf:                                Other Builtins.     (line    6)
  * ldexpl:                                Other Builtins.     (line    6)
  * leaf function attribute:               Function Attributes.
!                                                              (line  857)
  * length-zero arrays:                    Zero Length.        (line    6)
  * lgamma:                                Other Builtins.     (line    6)
- * lgamma_r:                              Other Builtins.     (line    6)
  * lgammaf:                               Other Builtins.     (line    6)
  * lgammaf_r:                             Other Builtins.     (line    6)
  * lgammal:                               Other Builtins.     (line    6)
  * lgammal_r:                             Other Builtins.     (line    6)
  * Libraries:                             Link Options.       (line   30)
  * LIBRARY_PATH:                          Environment Variables.
                                                               (line   97)
  * link options:                          Link Options.       (line    6)
! * linker script:                         Link Options.       (line  242)
! * LK fixed-suffix:                       Fixed-Point.        (line    6)
  * lk fixed-suffix:                       Fixed-Point.        (line    6)
  * LL integer suffix:                     Long Long.          (line    6)
  * llabs:                                 Other Builtins.     (line    6)
- * LLK fixed-suffix:                      Fixed-Point.        (line    6)
  * llk fixed-suffix:                      Fixed-Point.        (line    6)
! * LLR fixed-suffix:                      Fixed-Point.        (line    6)
  * llr fixed-suffix:                      Fixed-Point.        (line    6)
  * llrint:                                Other Builtins.     (line    6)
  * llrintf:                               Other Builtins.     (line    6)
  * llrintl:                               Other Builtins.     (line    6)
--- 52625,52651 ----
  * ldexpf:                                Other Builtins.     (line    6)
  * ldexpl:                                Other Builtins.     (line    6)
  * leaf function attribute:               Function Attributes.
!                                                              (line  844)
  * length-zero arrays:                    Zero Length.        (line    6)
  * lgamma:                                Other Builtins.     (line    6)
  * lgammaf:                               Other Builtins.     (line    6)
  * lgammaf_r:                             Other Builtins.     (line    6)
  * lgammal:                               Other Builtins.     (line    6)
  * lgammal_r:                             Other Builtins.     (line    6)
+ * lgamma_r:                              Other Builtins.     (line    6)
  * Libraries:                             Link Options.       (line   30)
  * LIBRARY_PATH:                          Environment Variables.
                                                               (line   97)
  * link options:                          Link Options.       (line    6)
! * linker script:                         Link Options.       (line  238)
  * lk fixed-suffix:                       Fixed-Point.        (line    6)
+ * LK fixed-suffix:                       Fixed-Point.        (line    6)
  * LL integer suffix:                     Long Long.          (line    6)
  * llabs:                                 Other Builtins.     (line    6)
  * llk fixed-suffix:                      Fixed-Point.        (line    6)
! * LLK fixed-suffix:                      Fixed-Point.        (line    6)
  * llr fixed-suffix:                      Fixed-Point.        (line    6)
+ * LLR fixed-suffix:                      Fixed-Point.        (line    6)
  * llrint:                                Other Builtins.     (line    6)
  * llrintf:                               Other Builtins.     (line    6)
  * llrintl:                               Other Builtins.     (line    6)
*************** Keyword Index
*** 52937,52943 ****
  * llroundf:                              Other Builtins.     (line    6)
  * llroundl:                              Other Builtins.     (line    6)
  * LM32 options:                          LM32 Options.       (line    6)
! * load address instruction:              Simple Constraints. (line  154)
  * local labels:                          Local Labels.       (line    6)
  * local variables in macros:             Typeof.             (line   46)
  * local variables, specifying registers: Local Reg Vars.     (line    6)
--- 52653,52659 ----
  * llroundf:                              Other Builtins.     (line    6)
  * llroundl:                              Other Builtins.     (line    6)
  * LM32 options:                          LM32 Options.       (line    6)
! * load address instruction:              Simple Constraints. (line  152)
  * local labels:                          Local Labels.       (line    6)
  * local variables in macros:             Typeof.             (line   46)
  * local variables, specifying registers: Local Reg Vars.     (line    6)
*************** Keyword Index
*** 52963,52985 ****
  * logf:                                  Other Builtins.     (line    6)
  * logl:                                  Other Builtins.     (line    6)
  * long long data types:                  Long Long.          (line    6)
- * long_call function attribute, ARC:     Function Attributes.
-                                                              (line  886)
- * long_call function attribute, ARM:     Function Attributes.
-                                                              (line  886)
- * long_call function attribute, Epiphany: Function Attributes.
-                                                              (line  886)
- * long_call function attribute, MIPS:    Function Attributes.
-                                                              (line  924)
  * longcall function attribute, Blackfin: Function Attributes.
!                                                              (line  910)
  * longcall function attribute, PowerPC:  Function Attributes.
!                                                              (line  910)
  * longjmp:                               Global Reg Vars.    (line   65)
  * longjmp incompatibilities:             Incompatibilities.  (line   39)
! * longjmp warnings:                      Warning Options.    (line  712)
! * LR fixed-suffix:                       Fixed-Point.        (line    6)
  * lr fixed-suffix:                       Fixed-Point.        (line    6)
  * lrint:                                 Other Builtins.     (line    6)
  * lrintf:                                Other Builtins.     (line    6)
  * lrintl:                                Other Builtins.     (line    6)
--- 52679,52701 ----
  * logf:                                  Other Builtins.     (line    6)
  * logl:                                  Other Builtins.     (line    6)
  * long long data types:                  Long Long.          (line    6)
  * longcall function attribute, Blackfin: Function Attributes.
!                                                              (line  897)
  * longcall function attribute, PowerPC:  Function Attributes.
!                                                              (line  897)
  * longjmp:                               Global Reg Vars.    (line   65)
  * longjmp incompatibilities:             Incompatibilities.  (line   39)
! * longjmp warnings:                      Warning Options.    (line  709)
! * long_call function attribute, ARC:     Function Attributes.
!                                                              (line  873)
! * long_call function attribute, ARM:     Function Attributes.
!                                                              (line  873)
! * long_call function attribute, Epiphany: Function Attributes.
!                                                              (line  873)
! * long_call function attribute, MIPS:    Function Attributes.
!                                                              (line  911)
  * lr fixed-suffix:                       Fixed-Point.        (line    6)
+ * LR fixed-suffix:                       Fixed-Point.        (line    6)
  * lrint:                                 Other Builtins.     (line    6)
  * lrintf:                                Other Builtins.     (line    6)
  * lrintl:                                Other Builtins.     (line    6)
*************** Keyword Index
*** 53003,53014 ****
                                                               (line  185)
  * malloc:                                Other Builtins.     (line    6)
  * malloc function attribute:             Function Attributes.
!                                                              (line  934)
! * matching constraint:                   Simple Constraints. (line  139)
! * may_alias type attribute:              Type Attributes.    (line  233)
  * MCore options:                         MCore Options.      (line    6)
  * medium_call function attribute, ARC:   Function Attributes.
!                                                              (line  886)
  * member fns, automatically inline:      Inline.             (line   71)
  * memchr:                                Other Builtins.     (line    6)
  * memcmp:                                Other Builtins.     (line    6)
--- 52719,52730 ----
                                                               (line  185)
  * malloc:                                Other Builtins.     (line    6)
  * malloc function attribute:             Function Attributes.
!                                                              (line  921)
! * matching constraint:                   Simple Constraints. (line  137)
! * may_alias type attribute:              Type Attributes.    (line  234)
  * MCore options:                         MCore Options.      (line    6)
  * medium_call function attribute, ARC:   Function Attributes.
!                                                              (line  873)
  * member fns, automatically inline:      Inline.             (line   71)
  * memchr:                                Other Builtins.     (line    6)
  * memcmp:                                Other Builtins.     (line    6)
*************** Keyword Index
*** 53025,53035 ****
                                                               (line    6)
  * MicroBlaze Options:                    MicroBlaze Options. (line    6)
  * micromips function attribute:          Function Attributes.
!                                                              (line  962)
  * middle-operands, omitted:              Conditionals.       (line    6)
  * MIPS options:                          MIPS Options.       (line    6)
  * mips16 function attribute, MIPS:       Function Attributes.
!                                                              (line  947)
  * misunderstandings in C++:              C++ Misunderstandings.
                                                               (line    6)
  * mixed declarations and code:           Mixed Declarations. (line    6)
--- 52741,52751 ----
                                                               (line    6)
  * MicroBlaze Options:                    MicroBlaze Options. (line    6)
  * micromips function attribute:          Function Attributes.
!                                                              (line  950)
  * middle-operands, omitted:              Conditionals.       (line    6)
  * MIPS options:                          MIPS Options.       (line    6)
  * mips16 function attribute, MIPS:       Function Attributes.
!                                                              (line  934)
  * misunderstandings in C++:              C++ Misunderstandings.
                                                               (line    6)
  * mixed declarations and code:           Mixed Declarations. (line    6)
*************** Keyword Index
*** 53039,53108 ****
  * MMIX Options:                          MMIX Options.       (line    6)
  * MN10300 options:                       MN10300 Options.    (line    6)
  * mode variable attribute:               Variable Attributes.
!                                                              (line  135)
  * model function attribute, M32R/D:      Function Attributes.
!                                                              (line  978)
  * model variable attribute, IA-64:       Variable Attributes.
!                                                              (line  431)
  * model-name variable attribute, M32R/D: Variable Attributes.
!                                                              (line  446)
  * modf:                                  Other Builtins.     (line    6)
  * modff:                                 Other Builtins.     (line    6)
  * modfl:                                 Other Builtins.     (line    6)
  * modifiers in constraints:              Modifiers.          (line    6)
  * Moxie Options:                         Moxie Options.      (line    6)
  * ms_abi function attribute, x86:        Function Attributes.
!                                                              (line  999)
  * ms_hook_prologue function attribute, x86: Function Attributes.
!                                                              (line 1022)
! * ms_struct type attribute, PowerPC:     Type Attributes.    (line  360)
! * ms_struct type attribute, x86:         Type Attributes.    (line  392)
  * ms_struct variable attribute, PowerPC: Variable Attributes.
!                                                              (line  515)
  * ms_struct variable attribute, x86:     Variable Attributes.
!                                                              (line  536)
! * MSP430 Options:                        MSP430 Options.     (line    6)
  * multiple alternative constraints:      Multi-Alternative.  (line    6)
  * multiprecision arithmetic:             Long Long.          (line    6)
! * n in constraint:                       Simple Constraints. (line   75)
  * naked function attribute, ARM:         Function Attributes.
!                                                              (line 1040)
  * naked function attribute, AVR:         Function Attributes.
!                                                              (line 1040)
  * naked function attribute, MCORE:       Function Attributes.
!                                                              (line 1040)
  * naked function attribute, MSP430:      Function Attributes.
!                                                              (line 1040)
  * naked function attribute, NDS32:       Function Attributes.
!                                                              (line 1040)
  * naked function attribute, RL78:        Function Attributes.
!                                                              (line 1040)
  * naked function attribute, RX:          Function Attributes.
!                                                              (line 1040)
  * naked function attribute, SPU:         Function Attributes.
!                                                              (line 1040)
  * Named Address Spaces:                  Named Address Spaces.
                                                               (line    6)
  * names used in assembler code:          Asm Labels.         (line    6)
  * naming convention, implementation headers: C++ Interface.  (line   43)
  * NDS32 Options:                         NDS32 Options.      (line    6)
  * near function attribute, MeP:          Function Attributes.
!                                                              (line 1051)
  * near function attribute, MIPS:         Function Attributes.
!                                                              (line  924)
! * near type attribute, MeP:              Type Attributes.    (line  349)
  * near variable attribute, MeP:          Variable Attributes.
!                                                              (line  479)
  * nearbyint:                             Other Builtins.     (line    6)
  * nearbyintf:                            Other Builtins.     (line    6)
  * nearbyintl:                            Other Builtins.     (line    6)
  * nested function attribute, NDS32:      Function Attributes.
!                                                              (line  779)
  * nested functions:                      Nested Functions.   (line    6)
  * nested_ready function attribute, NDS32: Function Attributes.
!                                                              (line  785)
  * nesting function attribute, Blackfin:  Function Attributes.
!                                                              (line 1056)
  * newlines (escaped):                    Escaped Newlines.   (line    6)
  * nextafter:                             Other Builtins.     (line    6)
  * nextafterf:                            Other Builtins.     (line    6)
--- 52755,52824 ----
  * MMIX Options:                          MMIX Options.       (line    6)
  * MN10300 options:                       MN10300 Options.    (line    6)
  * mode variable attribute:               Variable Attributes.
!                                                              (line  134)
  * model function attribute, M32R/D:      Function Attributes.
!                                                              (line  967)
  * model variable attribute, IA-64:       Variable Attributes.
!                                                              (line  425)
  * model-name variable attribute, M32R/D: Variable Attributes.
!                                                              (line  440)
  * modf:                                  Other Builtins.     (line    6)
  * modff:                                 Other Builtins.     (line    6)
  * modfl:                                 Other Builtins.     (line    6)
  * modifiers in constraints:              Modifiers.          (line    6)
  * Moxie Options:                         Moxie Options.      (line    6)
+ * MSP430 Options:                        MSP430 Options.     (line    6)
  * ms_abi function attribute, x86:        Function Attributes.
!                                                              (line  989)
  * ms_hook_prologue function attribute, x86: Function Attributes.
!                                                              (line 1014)
! * ms_struct type attribute, PowerPC:     Type Attributes.    (line  359)
! * ms_struct type attribute, x86:         Type Attributes.    (line  391)
  * ms_struct variable attribute, PowerPC: Variable Attributes.
!                                                              (line  506)
  * ms_struct variable attribute, x86:     Variable Attributes.
!                                                              (line  527)
  * multiple alternative constraints:      Multi-Alternative.  (line    6)
  * multiprecision arithmetic:             Long Long.          (line    6)
! * n in constraint:                       Simple Constraints. (line   73)
  * naked function attribute, ARM:         Function Attributes.
!                                                              (line 1034)
  * naked function attribute, AVR:         Function Attributes.
!                                                              (line 1034)
  * naked function attribute, MCORE:       Function Attributes.
!                                                              (line 1034)
  * naked function attribute, MSP430:      Function Attributes.
!                                                              (line 1034)
  * naked function attribute, NDS32:       Function Attributes.
!                                                              (line 1034)
  * naked function attribute, RL78:        Function Attributes.
!                                                              (line 1034)
  * naked function attribute, RX:          Function Attributes.
!                                                              (line 1034)
  * naked function attribute, SPU:         Function Attributes.
!                                                              (line 1034)
  * Named Address Spaces:                  Named Address Spaces.
                                                               (line    6)
  * names used in assembler code:          Asm Labels.         (line    6)
  * naming convention, implementation headers: C++ Interface.  (line   43)
  * NDS32 Options:                         NDS32 Options.      (line    6)
  * near function attribute, MeP:          Function Attributes.
!                                                              (line 1045)
  * near function attribute, MIPS:         Function Attributes.
!                                                              (line  911)
! * near type attribute, MeP:              Type Attributes.    (line  348)
  * near variable attribute, MeP:          Variable Attributes.
!                                                              (line  472)
  * nearbyint:                             Other Builtins.     (line    6)
  * nearbyintf:                            Other Builtins.     (line    6)
  * nearbyintl:                            Other Builtins.     (line    6)
  * nested function attribute, NDS32:      Function Attributes.
!                                                              (line  771)
  * nested functions:                      Nested Functions.   (line    6)
  * nested_ready function attribute, NDS32: Function Attributes.
!                                                              (line  775)
  * nesting function attribute, Blackfin:  Function Attributes.
!                                                              (line 1050)
  * newlines (escaped):                    Escaped Newlines.   (line    6)
  * nextafter:                             Other Builtins.     (line    6)
  * nextafterf:                            Other Builtins.     (line    6)
*************** Keyword Index
*** 53110,53187 ****
  * nexttoward:                            Other Builtins.     (line    6)
  * nexttowardf:                           Other Builtins.     (line    6)
  * nexttowardl:                           Other Builtins.     (line    6)
! * NFC:                                   Warning Options.    (line 1481)
! * NFKC:                                  Warning Options.    (line 1481)
  * Nios II options:                       Nios II Options.    (line    6)
  * nmi function attribute, NDS32:         Function Attributes.
!                                                              (line 1354)
  * NMI handler functions on the Blackfin processor: Function Attributes.
!                                                              (line 1061)
  * nmi_handler function attribute, Blackfin: Function Attributes.
!                                                              (line 1061)
! * no_icf function attribute:             Function Attributes.
!                                                              (line 1106)
! * no_instrument_function function attribute: Function Attributes.
!                                                              (line 1073)
! * no_reorder function attribute:         Function Attributes.
!                                                              (line 1134)
! * no_sanitize_address function attribute: Function Attributes.
!                                                              (line 1303)
! * no_sanitize_thread function attribute: Function Attributes.
!                                                              (line 1311)
! * no_sanitize_undefined function attribute: Function Attributes.
!                                                              (line 1316)
! * no_split_stack function attribute:     Function Attributes.
!                                                              (line 1078)
  * noclone function attribute:            Function Attributes.
!                                                              (line 1100)
  * nocommon variable attribute:           Variable Attributes.
!                                                              (line  106)
  * nocompression function attribute, MIPS: Function Attributes.
!                                                              (line 1067)
  * noinline function attribute:           Function Attributes.
!                                                              (line 1089)
  * nomicromips function attribute:        Function Attributes.
!                                                              (line  962)
  * nomips16 function attribute, MIPS:     Function Attributes.
!                                                              (line  947)
  * non-constant initializers:             Initializers.       (line    6)
  * non-static inline function:            Inline.             (line   85)
  * nonnull function attribute:            Function Attributes.
!                                                              (line 1110)
  * noreturn function attribute:           Function Attributes.
!                                                              (line 1152)
  * nosave_low_regs function attribute, SH: Function Attributes.
!                                                              (line 1190)
! * not_nested function attribute, NDS32:  Function Attributes.
!                                                              (line  782)
  * note GCC_COLORS capability:            Language Independent Options.
                                                               (line   75)
  * nothrow function attribute:            Function Attributes.
!                                                              (line 1183)
! * notshared type attribute, ARM:         Type Attributes.    (line  328)
  * Nvidia PTX options:                    Nvidia PTX Options. (line    6)
  * nvptx options:                         Nvidia PTX Options. (line    6)
  * o in constraint:                       Simple Constraints. (line   23)
  * OBJC_INCLUDE_PATH:                     Environment Variables.
!                                                              (line  132)
! * Objective-C <1>:                       Standards.          (line  163)
  * Objective-C:                           G++ and GCC.        (line    6)
  * Objective-C and Objective-C++ options, command-line: Objective-C and Objective-C++ Dialect Options.
                                                               (line    6)
- * Objective-C++ <1>:                     Standards.          (line  163)
  * Objective-C++:                         G++ and GCC.        (line    6)
  * offsettable address:                   Simple Constraints. (line   23)
  * old-style function definitions:        Function Prototypes.
                                                               (line    6)
  * omitted middle-operands:               Conditionals.       (line    6)
  * open coding:                           Inline.             (line    6)
! * OpenACC accelerator programming:       C Dialect Options.  (line  264)
  * OpenMP parallel:                       C Dialect Options.  (line  276)
! * OpenMP SIMD:                           C Dialect Options.  (line  284)
  * operand constraints, asm:              Constraints.        (line    6)
  * optimize function attribute:           Function Attributes.
!                                                              (line 1196)
  * optimize options:                      Optimize Options.   (line    6)
  * options to control diagnostics formatting: Language Independent Options.
                                                               (line    6)
--- 52826,52903 ----
  * nexttoward:                            Other Builtins.     (line    6)
  * nexttowardf:                           Other Builtins.     (line    6)
  * nexttowardl:                           Other Builtins.     (line    6)
! * NFC:                                   Warning Options.    (line 1471)
! * NFKC:                                  Warning Options.    (line 1471)
  * Nios II options:                       Nios II Options.    (line    6)
  * nmi function attribute, NDS32:         Function Attributes.
!                                                              (line 1348)
  * NMI handler functions on the Blackfin processor: Function Attributes.
!                                                              (line 1055)
  * nmi_handler function attribute, Blackfin: Function Attributes.
!                                                              (line 1055)
  * noclone function attribute:            Function Attributes.
!                                                              (line 1094)
  * nocommon variable attribute:           Variable Attributes.
!                                                              (line  105)
  * nocompression function attribute, MIPS: Function Attributes.
!                                                              (line 1061)
  * noinline function attribute:           Function Attributes.
!                                                              (line 1083)
  * nomicromips function attribute:        Function Attributes.
!                                                              (line  950)
  * nomips16 function attribute, MIPS:     Function Attributes.
!                                                              (line  934)
  * non-constant initializers:             Initializers.       (line    6)
  * non-static inline function:            Inline.             (line   85)
  * nonnull function attribute:            Function Attributes.
!                                                              (line 1104)
  * noreturn function attribute:           Function Attributes.
!                                                              (line 1146)
  * nosave_low_regs function attribute, SH: Function Attributes.
!                                                              (line 1184)
  * note GCC_COLORS capability:            Language Independent Options.
                                                               (line   75)
  * nothrow function attribute:            Function Attributes.
!                                                              (line 1177)
! * notshared type attribute, ARM:         Type Attributes.    (line  327)
! * not_nested function attribute, NDS32:  Function Attributes.
!                                                              (line  773)
! * no_icf function attribute:             Function Attributes.
!                                                              (line 1100)
! * no_instrument_function function attribute: Function Attributes.
!                                                              (line 1067)
! * no_reorder function attribute:         Function Attributes.
!                                                              (line 1128)
! * no_sanitize_address function attribute: Function Attributes.
!                                                              (line 1297)
! * no_sanitize_thread function attribute: Function Attributes.
!                                                              (line 1305)
! * no_sanitize_undefined function attribute: Function Attributes.
!                                                              (line 1310)
! * no_split_stack function attribute:     Function Attributes.
!                                                              (line 1072)
  * Nvidia PTX options:                    Nvidia PTX Options. (line    6)
  * nvptx options:                         Nvidia PTX Options. (line    6)
  * o in constraint:                       Simple Constraints. (line   23)
  * OBJC_INCLUDE_PATH:                     Environment Variables.
!                                                              (line  130)
  * Objective-C:                           G++ and GCC.        (line    6)
+ * Objective-C <1>:                       Standards.          (line  161)
  * Objective-C and Objective-C++ options, command-line: Objective-C and Objective-C++ Dialect Options.
                                                               (line    6)
  * Objective-C++:                         G++ and GCC.        (line    6)
+ * Objective-C++ <1>:                     Standards.          (line  161)
  * offsettable address:                   Simple Constraints. (line   23)
  * old-style function definitions:        Function Prototypes.
                                                               (line    6)
  * omitted middle-operands:               Conditionals.       (line    6)
  * open coding:                           Inline.             (line    6)
! * OpenACC accelerator programming:       C Dialect Options.  (line  263)
  * OpenMP parallel:                       C Dialect Options.  (line  276)
! * OpenMP SIMD:                           C Dialect Options.  (line  285)
  * operand constraints, asm:              Constraints.        (line    6)
  * optimize function attribute:           Function Attributes.
!                                                              (line 1190)
  * optimize options:                      Optimize Options.   (line    6)
  * options to control diagnostics formatting: Language Independent Options.
                                                               (line    6)
*************** Keyword Index
*** 53204,53239 ****
  * order of evaluation, side effects:     Non-bugs.           (line  196)
  * order of options:                      Invoking GCC.       (line   30)
  * OS_main function attribute, AVR:       Function Attributes.
!                                                              (line 1214)
  * OS_task function attribute, AVR:       Function Attributes.
!                                                              (line 1214)
! * other register constraints:            Simple Constraints. (line  163)
  * output file option:                    Overall Options.    (line  191)
  * overloaded virtual function, warning:  C++ Dialect Options.
!                                                              (line  682)
! * p in constraint:                       Simple Constraints. (line  154)
  * packed type attribute:                 Type Attributes.    (line  108)
  * packed variable attribute:             Variable Attributes.
!                                                              (line  146)
  * parameter forward declaration:         Variable Length.    (line   68)
  * partial_save function attribute, NDS32: Function Attributes.
!                                                              (line  795)
  * Pascal:                                G++ and GCC.        (line   23)
  * pcs function attribute, ARM:           Function Attributes.
!                                                              (line 1239)
  * PDP-11 Options:                        PDP-11 Options.     (line    6)
! * PIC:                                   Code Gen Options.   (line  280)
  * picoChip options:                      picoChip Options.   (line    6)
  * pmf:                                   Bound member functions.
                                                               (line    6)
  * pointer arguments:                     Function Attributes.
!                                                              (line  228)
! * Pointer Bounds Checker attributes <1>: Type Attributes.    (line  295)
  * Pointer Bounds Checker attributes:     Function Attributes.
!                                                              (line 1322)
  * Pointer Bounds Checker builtins:       Pointer Bounds Checker builtins.
                                                               (line    6)
! * Pointer Bounds Checker options:        Debugging Options.  (line  388)
  * pointer to member function:            Bound member functions.
                                                               (line    6)
  * pointers to arrays:                    Pointers to Arrays. (line    6)
--- 52920,52955 ----
  * order of evaluation, side effects:     Non-bugs.           (line  196)
  * order of options:                      Invoking GCC.       (line   30)
  * OS_main function attribute, AVR:       Function Attributes.
!                                                              (line 1208)
  * OS_task function attribute, AVR:       Function Attributes.
!                                                              (line 1208)
! * other register constraints:            Simple Constraints. (line  161)
  * output file option:                    Overall Options.    (line  191)
  * overloaded virtual function, warning:  C++ Dialect Options.
!                                                              (line  676)
! * p in constraint:                       Simple Constraints. (line  152)
  * packed type attribute:                 Type Attributes.    (line  108)
  * packed variable attribute:             Variable Attributes.
!                                                              (line  145)
  * parameter forward declaration:         Variable Length.    (line   68)
  * partial_save function attribute, NDS32: Function Attributes.
!                                                              (line  783)
  * Pascal:                                G++ and GCC.        (line   23)
  * pcs function attribute, ARM:           Function Attributes.
!                                                              (line 1232)
  * PDP-11 Options:                        PDP-11 Options.     (line    6)
! * PIC:                                   Code Gen Options.   (line  279)
  * picoChip options:                      picoChip Options.   (line    6)
  * pmf:                                   Bound member functions.
                                                               (line    6)
  * pointer arguments:                     Function Attributes.
!                                                              (line  226)
  * Pointer Bounds Checker attributes:     Function Attributes.
!                                                              (line 1316)
! * Pointer Bounds Checker attributes <1>: Type Attributes.    (line  295)
  * Pointer Bounds Checker builtins:       Pointer Bounds Checker builtins.
                                                               (line    6)
! * Pointer Bounds Checker options:        Debugging Options.  (line  393)
  * pointer to member function:            Bound member functions.
                                                               (line    6)
  * pointers to arrays:                    Pointers to Arrays. (line    6)
*************** Keyword Index
*** 53248,53260 ****
  * pragma GCC ivdep:                      Loop-Specific Pragmas.
                                                               (line    7)
  * pragma GCC optimize:                   Function Specific Option Pragmas.
!                                                              (line   19)
  * pragma GCC pop_options:                Function Specific Option Pragmas.
!                                                              (line   29)
  * pragma GCC push_options:               Function Specific Option Pragmas.
!                                                              (line   29)
  * pragma GCC reset_options:              Function Specific Option Pragmas.
!                                                              (line   36)
  * pragma GCC target:                     Function Specific Option Pragmas.
                                                               (line    7)
  * pragma, address:                       M32C Pragmas.       (line   15)
--- 52964,52976 ----
  * pragma GCC ivdep:                      Loop-Specific Pragmas.
                                                               (line    7)
  * pragma GCC optimize:                   Function Specific Option Pragmas.
!                                                              (line   20)
  * pragma GCC pop_options:                Function Specific Option Pragmas.
!                                                              (line   31)
  * pragma GCC push_options:               Function Specific Option Pragmas.
!                                                              (line   31)
  * pragma GCC reset_options:              Function Specific Option Pragmas.
!                                                              (line   39)
  * pragma GCC target:                     Function Specific Option Pragmas.
                                                               (line    7)
  * pragma, address:                       M32C Pragmas.       (line   15)
*************** Keyword Index
*** 53265,53277 ****
  * pragma, coprocessor subclass:          MeP Pragmas.        (line   28)
  * pragma, custom io_volatile:            MeP Pragmas.        (line    7)
  * pragma, diagnostic:                    Diagnostic Pragmas. (line   14)
  * pragma, disinterrupt:                  MeP Pragmas.        (line   38)
! * pragma, fini:                          Solaris Pragmas.    (line   19)
! * pragma, init:                          Solaris Pragmas.    (line   24)
! * pragma, long_calls:                    ARM Pragmas.        (line   11)
! * pragma, long_calls_off:                ARM Pragmas.        (line   17)
  * pragma, longcall:                      RS/6000 and PowerPC Pragmas.
                                                               (line   14)
  * pragma, mark:                          Darwin Pragmas.     (line   11)
  * pragma, memregs:                       M32C Pragmas.       (line    7)
  * pragma, no_long_calls:                 ARM Pragmas.        (line   14)
--- 52981,52994 ----
  * pragma, coprocessor subclass:          MeP Pragmas.        (line   28)
  * pragma, custom io_volatile:            MeP Pragmas.        (line    7)
  * pragma, diagnostic:                    Diagnostic Pragmas. (line   14)
+ * pragma, diagnostic <1>:                Diagnostic Pragmas. (line   57)
  * pragma, disinterrupt:                  MeP Pragmas.        (line   38)
! * pragma, fini:                          Solaris Pragmas.    (line   20)
! * pragma, init:                          Solaris Pragmas.    (line   26)
  * pragma, longcall:                      RS/6000 and PowerPC Pragmas.
                                                               (line   14)
+ * pragma, long_calls:                    ARM Pragmas.        (line   11)
+ * pragma, long_calls_off:                ARM Pragmas.        (line   17)
  * pragma, mark:                          Darwin Pragmas.     (line   11)
  * pragma, memregs:                       M32C Pragmas.       (line    7)
  * pragma, no_long_calls:                 ARM Pragmas.        (line   14)
*************** Keyword Index
*** 53281,53287 ****
  * pragma, push_macro:                    Push/Pop Macro Pragmas.
                                                               (line   11)
  * pragma, reason for not using:          Function Attributes.
!                                                              (line 2049)
  * pragma, redefine_extname:              Symbol-Renaming Pragmas.
                                                               (line   13)
  * pragma, segment:                       Darwin Pragmas.     (line   21)
--- 52998,53004 ----
  * pragma, push_macro:                    Push/Pop Macro Pragmas.
                                                               (line   11)
  * pragma, reason for not using:          Function Attributes.
!                                                              (line 2040)
  * pragma, redefine_extname:              Symbol-Renaming Pragmas.
                                                               (line   13)
  * pragma, segment:                       Darwin Pragmas.     (line   21)
*************** Keyword Index
*** 53291,53297 ****
  * pragmas:                               Pragmas.            (line    6)
  * pragmas in C++, effect on inlining:    C++ Interface.      (line   57)
  * pragmas, interface and implementation: C++ Interface.      (line    6)
! * pragmas, warning of unknown:           Warning Options.    (line  729)
  * precompiled headers:                   Precompiled Headers.
                                                               (line    6)
  * preprocessing numbers:                 Incompatibilities.  (line  173)
--- 53008,53014 ----
  * pragmas:                               Pragmas.            (line    6)
  * pragmas in C++, effect on inlining:    C++ Interface.      (line   57)
  * pragmas, interface and implementation: C++ Interface.      (line    6)
! * pragmas, warning of unknown:           Warning Options.    (line  726)
  * precompiled headers:                   Precompiled Headers.
                                                               (line    6)
  * preprocessing numbers:                 Incompatibilities.  (line  173)
*************** Keyword Index
*** 53300,53324 ****
                                                               (line    6)
  * printf:                                Other Builtins.     (line    6)
  * printf_unlocked:                       Other Builtins.     (line    6)
! * prof:                                  Debugging Options.  (line  639)
  * progmem variable attribute, AVR:       Variable Attributes.
!                                                              (line  319)
  * promotion of formal parameters:        Function Prototypes.
                                                               (line    6)
  * pure function attribute:               Function Attributes.
!                                                              (line 1257)
! * push address instruction:              Simple Constraints. (line  154)
  * putchar:                               Other Builtins.     (line    6)
  * puts:                                  Other Builtins.     (line    6)
- * Q floating point suffix:               Floating Types.     (line    6)
  * q floating point suffix:               Floating Types.     (line    6)
  * qsort, and global register variables:  Global Reg Vars.    (line   41)
  * question mark:                         Multi-Alternative.  (line   27)
  * quote GCC_COLORS capability:           Language Independent Options.
                                                               (line   85)
- * R fixed-suffix:                        Fixed-Point.        (line    6)
  * r fixed-suffix:                        Fixed-Point.        (line    6)
! * r in constraint:                       Simple Constraints. (line   66)
  * RAMPD:                                 AVR Options.        (line  358)
  * RAMPX:                                 AVR Options.        (line  358)
  * RAMPY:                                 AVR Options.        (line  358)
--- 53017,53041 ----
                                                               (line    6)
  * printf:                                Other Builtins.     (line    6)
  * printf_unlocked:                       Other Builtins.     (line    6)
! * prof:                                  Debugging Options.  (line  644)
  * progmem variable attribute, AVR:       Variable Attributes.
!                                                              (line  315)
  * promotion of formal parameters:        Function Prototypes.
                                                               (line    6)
  * pure function attribute:               Function Attributes.
!                                                              (line 1251)
! * push address instruction:              Simple Constraints. (line  152)
  * putchar:                               Other Builtins.     (line    6)
  * puts:                                  Other Builtins.     (line    6)
  * q floating point suffix:               Floating Types.     (line    6)
+ * Q floating point suffix:               Floating Types.     (line    6)
  * qsort, and global register variables:  Global Reg Vars.    (line   41)
  * question mark:                         Multi-Alternative.  (line   27)
  * quote GCC_COLORS capability:           Language Independent Options.
                                                               (line   85)
  * r fixed-suffix:                        Fixed-Point.        (line    6)
! * R fixed-suffix:                        Fixed-Point.        (line    6)
! * r in constraint:                       Simple Constraints. (line   64)
  * RAMPD:                                 AVR Options.        (line  358)
  * RAMPX:                                 AVR Options.        (line  358)
  * RAMPY:                                 AVR Options.        (line  358)
*************** Keyword Index
*** 53326,53341 ****
  * ranges in case statements:             Case Ranges.        (line    6)
  * read-only strings:                     Incompatibilities.  (line    9)
  * reentrant function attribute, MSP430:  Function Attributes.
!                                                              (line  697)
  * register variable after longjmp:       Global Reg Vars.    (line   65)
  * registers for local variables:         Local Reg Vars.     (line    6)
! * registers in constraints:              Simple Constraints. (line   66)
  * registers, global allocation:          Explicit Reg Vars.  (line    6)
  * registers, global variables in:        Global Reg Vars.    (line    6)
  * regparm function attribute, x86:       Function Attributes.
!                                                              (line 1332)
! * relocation truncated to fit (ColdFire): M680x0 Options.    (line  329)
! * relocation truncated to fit (MIPS):    MIPS Options.       (line  239)
  * remainder:                             Other Builtins.     (line    6)
  * remainderf:                            Other Builtins.     (line    6)
  * remainderl:                            Other Builtins.     (line    6)
--- 53043,53058 ----
  * ranges in case statements:             Case Ranges.        (line    6)
  * read-only strings:                     Incompatibilities.  (line    9)
  * reentrant function attribute, MSP430:  Function Attributes.
!                                                              (line  690)
  * register variable after longjmp:       Global Reg Vars.    (line   65)
  * registers for local variables:         Local Reg Vars.     (line    6)
! * registers in constraints:              Simple Constraints. (line   64)
  * registers, global allocation:          Explicit Reg Vars.  (line    6)
  * registers, global variables in:        Global Reg Vars.    (line    6)
  * regparm function attribute, x86:       Function Attributes.
!                                                              (line 1326)
! * relocation truncated to fit (ColdFire): M680x0 Options.    (line  325)
! * relocation truncated to fit (MIPS):    MIPS Options.       (line  235)
  * remainder:                             Other Builtins.     (line    6)
  * remainderf:                            Other Builtins.     (line    6)
  * remainderl:                            Other Builtins.     (line    6)
*************** Keyword Index
*** 53343,53358 ****
  * remquof:                               Other Builtins.     (line    6)
  * remquol:                               Other Builtins.     (line    6)
  * renesas function attribute, SH:        Function Attributes.
!                                                              (line 1376)
  * reordering, warning:                   C++ Dialect Options.
!                                                              (line  598)
  * reporting bugs:                        Bugs.               (line    6)
  * resbank function attribute, SH:        Function Attributes.
!                                                              (line 1380)
  * reset function attribute, NDS32:       Function Attributes.
!                                                              (line 1349)
  * reset handler functions:               Function Attributes.
!                                                              (line 1349)
  * rest argument (in macro):              Variadic Macros.    (line    6)
  * restricted pointers:                   Restricted Pointers.
                                                               (line    6)
--- 53060,53075 ----
  * remquof:                               Other Builtins.     (line    6)
  * remquol:                               Other Builtins.     (line    6)
  * renesas function attribute, SH:        Function Attributes.
!                                                              (line 1369)
  * reordering, warning:                   C++ Dialect Options.
!                                                              (line  594)
  * reporting bugs:                        Bugs.               (line    6)
  * resbank function attribute, SH:        Function Attributes.
!                                                              (line 1373)
  * reset function attribute, NDS32:       Function Attributes.
!                                                              (line 1343)
  * reset handler functions:               Function Attributes.
!                                                              (line 1343)
  * rest argument (in macro):              Variadic Macros.    (line    6)
  * restricted pointers:                   Restricted Pointers.
                                                               (line    6)
*************** Keyword Index
*** 53361,53369 ****
  * restricted this pointer:               Restricted Pointers.
                                                               (line    6)
  * returns_nonnull function attribute:    Function Attributes.
!                                                              (line 1142)
  * returns_twice function attribute:      Function Attributes.
!                                                              (line 1394)
  * rindex:                                Other Builtins.     (line    6)
  * rint:                                  Other Builtins.     (line    6)
  * rintf:                                 Other Builtins.     (line    6)
--- 53078,53086 ----
  * restricted this pointer:               Restricted Pointers.
                                                               (line    6)
  * returns_nonnull function attribute:    Function Attributes.
!                                                              (line 1136)
  * returns_twice function attribute:      Function Attributes.
!                                                              (line 1387)
  * rindex:                                Other Builtins.     (line    6)
  * rint:                                  Other Builtins.     (line    6)
  * rintf:                                 Other Builtins.     (line    6)
*************** Keyword Index
*** 53377,53400 ****
  * RTTI:                                  Vague Linkage.      (line   42)
  * run-time options:                      Code Gen Options.   (line    6)
  * RX Options:                            RX Options.         (line    6)
! * s in constraint:                       Simple Constraints. (line  102)
  * S/390 and zSeries Options:             S/390 and zSeries Options.
                                                               (line    6)
  * save all registers on the Blackfin, H8/300, H8/300H, and H8S: Function Attributes.
!                                                              (line 1403)
! * save_all function attribute, NDS32:    Function Attributes.
!                                                              (line  791)
! * save_volatiles function attribute, MicroBlaze: Function Attributes.
!                                                              (line 1408)
  * saveall function attribute, Blackfin:  Function Attributes.
!                                                              (line 1403)
  * saveall function attribute, H8/300:    Function Attributes.
!                                                              (line 1403)
  * scalb:                                 Other Builtins.     (line    6)
  * scalbf:                                Other Builtins.     (line    6)
  * scalbl:                                Other Builtins.     (line    6)
  * scalbln:                               Other Builtins.     (line    6)
  * scalblnf:                              Other Builtins.     (line    6)
  * scalbn:                                Other Builtins.     (line    6)
  * scalbnf:                               Other Builtins.     (line    6)
  * scanf, and constant strings:           Incompatibilities.  (line   17)
--- 53094,53118 ----
  * RTTI:                                  Vague Linkage.      (line   42)
  * run-time options:                      Code Gen Options.   (line    6)
  * RX Options:                            RX Options.         (line    6)
! * s in constraint:                       Simple Constraints. (line  100)
  * S/390 and zSeries Options:             S/390 and zSeries Options.
                                                               (line    6)
  * save all registers on the Blackfin, H8/300, H8/300H, and H8S: Function Attributes.
!                                                              (line 1396)
  * saveall function attribute, Blackfin:  Function Attributes.
!                                                              (line 1396)
  * saveall function attribute, H8/300:    Function Attributes.
!                                                              (line 1396)
! * save_all function attribute, NDS32:    Function Attributes.
!                                                              (line  780)
! * save_volatiles function attribute, MicroBlaze: Function Attributes.
!                                                              (line 1401)
  * scalb:                                 Other Builtins.     (line    6)
  * scalbf:                                Other Builtins.     (line    6)
  * scalbl:                                Other Builtins.     (line    6)
  * scalbln:                               Other Builtins.     (line    6)
  * scalblnf:                              Other Builtins.     (line    6)
+ * scalblnf <1>:                          Other Builtins.     (line    6)
  * scalbn:                                Other Builtins.     (line    6)
  * scalbnf:                               Other Builtins.     (line    6)
  * scanf, and constant strings:           Incompatibilities.  (line   17)
*************** Keyword Index
*** 53405,53437 ****
  * Score Options:                         Score Options.      (line    6)
  * search path:                           Directory Options.  (line    6)
  * section function attribute:            Function Attributes.
!                                                              (line 1425)
  * section variable attribute:            Variable Attributes.
!                                                              (line  167)
  * selectany variable attribute:          Variable Attributes.
!                                                              (line  283)
  * sentinel function attribute:           Function Attributes.
!                                                              (line 1441)
  * setjmp:                                Global Reg Vars.    (line   65)
  * setjmp incompatibilities:              Incompatibilities.  (line   39)
  * shared strings:                        Incompatibilities.  (line    9)
  * shared variable attribute:             Variable Attributes.
!                                                              (line  212)
  * short_call function attribute, ARC:    Function Attributes.
!                                                              (line  886)
  * short_call function attribute, ARM:    Function Attributes.
!                                                              (line  886)
  * short_call function attribute, Epiphany: Function Attributes.
!                                                              (line  886)
! * shortcall function attribute, Blackfin: Function Attributes.
!                                                              (line  910)
! * shortcall function attribute, PowerPC: Function Attributes.
!                                                              (line  910)
  * side effect in ?::                     Conditionals.       (line   20)
  * side effects, macro argument:          Statement Exprs.    (line   35)
  * side effects, order of evaluation:     Non-bugs.           (line  196)
  * signal function attribute, AVR:        Function Attributes.
!                                                              (line 1472)
  * signbit:                               Other Builtins.     (line    6)
  * signbitd128:                           Other Builtins.     (line    6)
  * signbitd32:                            Other Builtins.     (line    6)
--- 53123,53155 ----
  * Score Options:                         Score Options.      (line    6)
  * search path:                           Directory Options.  (line    6)
  * section function attribute:            Function Attributes.
!                                                              (line 1418)
  * section variable attribute:            Variable Attributes.
!                                                              (line  166)
  * selectany variable attribute:          Variable Attributes.
!                                                              (line  280)
  * sentinel function attribute:           Function Attributes.
!                                                              (line 1434)
  * setjmp:                                Global Reg Vars.    (line   65)
  * setjmp incompatibilities:              Incompatibilities.  (line   39)
  * shared strings:                        Incompatibilities.  (line    9)
  * shared variable attribute:             Variable Attributes.
!                                                              (line  211)
! * shortcall function attribute, Blackfin: Function Attributes.
!                                                              (line  897)
! * shortcall function attribute, PowerPC: Function Attributes.
!                                                              (line  897)
  * short_call function attribute, ARC:    Function Attributes.
!                                                              (line  873)
  * short_call function attribute, ARM:    Function Attributes.
!                                                              (line  873)
  * short_call function attribute, Epiphany: Function Attributes.
!                                                              (line  873)
  * side effect in ?::                     Conditionals.       (line   20)
  * side effects, macro argument:          Statement Exprs.    (line   35)
  * side effects, order of evaluation:     Non-bugs.           (line  196)
  * signal function attribute, AVR:        Function Attributes.
!                                                              (line 1465)
  * signbit:                               Other Builtins.     (line    6)
  * signbitd128:                           Other Builtins.     (line    6)
  * signbitd32:                            Other Builtins.     (line    6)
*************** Keyword Index
*** 53439,53449 ****
  * signbitf:                              Other Builtins.     (line    6)
  * signbitl:                              Other Builtins.     (line    6)
  * signed and unsigned values, comparison warning: Warning Options.
!                                                              (line 1299)
  * significand:                           Other Builtins.     (line    6)
  * significandf:                          Other Builtins.     (line    6)
  * significandl:                          Other Builtins.     (line    6)
! * SIMD:                                  C Dialect Options.  (line  284)
  * simple constraints:                    Simple Constraints. (line    6)
  * sin:                                   Other Builtins.     (line    6)
  * sincos:                                Other Builtins.     (line    6)
--- 53157,53167 ----
  * signbitf:                              Other Builtins.     (line    6)
  * signbitl:                              Other Builtins.     (line    6)
  * signed and unsigned values, comparison warning: Warning Options.
!                                                              (line 1289)
  * significand:                           Other Builtins.     (line    6)
  * significandf:                          Other Builtins.     (line    6)
  * significandl:                          Other Builtins.     (line    6)
! * SIMD:                                  C Dialect Options.  (line  285)
  * simple constraints:                    Simple Constraints. (line    6)
  * sin:                                   Other Builtins.     (line    6)
  * sincos:                                Other Builtins.     (line    6)
*************** Keyword Index
*** 53455,53468 ****
  * sinhl:                                 Other Builtins.     (line    6)
  * sinl:                                  Other Builtins.     (line    6)
  * sizeof:                                Typeof.             (line    6)
- * smaller data references <1>:           Nios II Options.    (line    9)
  * smaller data references:               M32R/D Options.     (line   57)
  * smaller data references (PowerPC):     RS/6000 and PowerPC Options.
!                                                              (line  770)
  * snprintf:                              Other Builtins.     (line    6)
  * Solaris 2 options:                     Solaris 2 Options.  (line    6)
- * sp_switch function attribute, SH:      Function Attributes.
-                                                              (line 1490)
  * SPARC options:                         SPARC Options.      (line    6)
  * Spec Files:                            Spec Files.         (line    6)
  * specified registers:                   Explicit Reg Vars.  (line    6)
--- 53173,53184 ----
  * sinhl:                                 Other Builtins.     (line    6)
  * sinl:                                  Other Builtins.     (line    6)
  * sizeof:                                Typeof.             (line    6)
  * smaller data references:               M32R/D Options.     (line   57)
+ * smaller data references <1>:           Nios II Options.    (line    9)
  * smaller data references (PowerPC):     RS/6000 and PowerPC Options.
!                                                              (line  773)
  * snprintf:                              Other Builtins.     (line    6)
  * Solaris 2 options:                     Solaris 2 Options.  (line    6)
  * SPARC options:                         SPARC Options.      (line    6)
  * Spec Files:                            Spec Files.         (line    6)
  * specified registers:                   Explicit Reg Vars.  (line    6)
*************** Keyword Index
*** 53475,53497 ****
                                                               (line    6)
  * sprintf:                               Other Builtins.     (line    6)
  * SPU options:                           SPU Options.        (line    6)
! * spu_vector type attribute, SPU:        Type Attributes.    (line  379)
  * spu_vector variable attribute, SPU:    Variable Attributes.
!                                                              (line  524)
  * sqrt:                                  Other Builtins.     (line    6)
  * sqrtf:                                 Other Builtins.     (line    6)
  * sqrtl:                                 Other Builtins.     (line    6)
  * sscanf:                                Other Builtins.     (line    6)
  * sscanf, and constant strings:          Incompatibilities.  (line   17)
  * sseregparm function attribute, x86:    Function Attributes.
!                                                              (line 1361)
  * stack_protect function attribute:      Function Attributes.
!                                                              (line 1084)
  * statements inside expressions:         Statement Exprs.    (line    6)
  * static data in C++, declaring and defining: Static Definitions.
                                                               (line    6)
  * stdcall function attribute, x86-32:    Function Attributes.
!                                                              (line 1500)
  * stpcpy:                                Other Builtins.     (line    6)
  * stpncpy:                               Other Builtins.     (line    6)
  * strcasecmp:                            Other Builtins.     (line    6)
--- 53191,53215 ----
                                                               (line    6)
  * sprintf:                               Other Builtins.     (line    6)
  * SPU options:                           SPU Options.        (line    6)
! * spu_vector type attribute, SPU:        Type Attributes.    (line  378)
  * spu_vector variable attribute, SPU:    Variable Attributes.
!                                                              (line  515)
! * sp_switch function attribute, SH:      Function Attributes.
!                                                              (line 1483)
  * sqrt:                                  Other Builtins.     (line    6)
  * sqrtf:                                 Other Builtins.     (line    6)
  * sqrtl:                                 Other Builtins.     (line    6)
  * sscanf:                                Other Builtins.     (line    6)
  * sscanf, and constant strings:          Incompatibilities.  (line   17)
  * sseregparm function attribute, x86:    Function Attributes.
!                                                              (line 1354)
  * stack_protect function attribute:      Function Attributes.
!                                                              (line 1078)
  * statements inside expressions:         Statement Exprs.    (line    6)
  * static data in C++, declaring and defining: Static Definitions.
                                                               (line    6)
  * stdcall function attribute, x86-32:    Function Attributes.
!                                                              (line 1493)
  * stpcpy:                                Other Builtins.     (line    6)
  * stpncpy:                               Other Builtins.     (line    6)
  * strcasecmp:                            Other Builtins.     (line    6)
*************** Keyword Index
*** 53516,53522 ****
  * strstr:                                Other Builtins.     (line    6)
  * struct:                                Unnamed Fields.     (line    6)
  * struct __htm_tdb:                      S/390 System z Built-in Functions.
!                                                              (line   54)
  * structures:                            Incompatibilities.  (line  146)
  * structures, constructor expression:    Compound Literals.  (line    6)
  * submodel options:                      Submodel Options.   (line    6)
--- 53234,53240 ----
  * strstr:                                Other Builtins.     (line    6)
  * struct:                                Unnamed Fields.     (line    6)
  * struct __htm_tdb:                      S/390 System z Built-in Functions.
!                                                              (line   49)
  * structures:                            Incompatibilities.  (line  146)
  * structures, constructor expression:    Compound Literals.  (line    6)
  * submodel options:                      Submodel Options.   (line    6)
*************** Keyword Index
*** 53524,53539 ****
  * subscripting and function values:      Subscripting.       (line    6)
  * suffixes for C++ source:               Invoking G++.       (line    6)
  * SUNPRO_DEPENDENCIES:                   Environment Variables.
!                                                              (line  172)
  * suppressing warnings:                  Warning Options.    (line    6)
  * surprises in C++:                      C++ Misunderstandings.
                                                               (line    6)
  * syntax checking:                       Warning Options.    (line   13)
  * syscall_linkage function attribute, IA-64: Function Attributes.
!                                                              (line 1505)
! * system headers, warnings from:         Warning Options.    (line  949)
  * sysv_abi function attribute, x86:      Function Attributes.
!                                                              (line  999)
  * tan:                                   Other Builtins.     (line    6)
  * tanf:                                  Other Builtins.     (line    6)
  * tanh:                                  Other Builtins.     (line    6)
--- 53242,53257 ----
  * subscripting and function values:      Subscripting.       (line    6)
  * suffixes for C++ source:               Invoking G++.       (line    6)
  * SUNPRO_DEPENDENCIES:                   Environment Variables.
!                                                              (line  171)
  * suppressing warnings:                  Warning Options.    (line    6)
  * surprises in C++:                      C++ Misunderstandings.
                                                               (line    6)
  * syntax checking:                       Warning Options.    (line   13)
  * syscall_linkage function attribute, IA-64: Function Attributes.
!                                                              (line 1498)
! * system headers, warnings from:         Warning Options.    (line  945)
  * sysv_abi function attribute, x86:      Function Attributes.
!                                                              (line  989)
  * tan:                                   Other Builtins.     (line    6)
  * tanf:                                  Other Builtins.     (line    6)
  * tanh:                                  Other Builtins.     (line    6)
*************** Keyword Index
*** 53541,53659 ****
  * tanhl:                                 Other Builtins.     (line    6)
  * tanl:                                  Other Builtins.     (line    6)
  * target function attribute:             Function Attributes.
!                                                              (line 1512)
  * target machine, specifying:            Target Options.     (line    6)
  * target options:                        Target Options.     (line    6)
  * target("abm") function attribute, x86: Function Attributes.
!                                                              (line 1545)
  * target("aes") function attribute, x86: Function Attributes.
!                                                              (line 1550)
  * target("align-stringops") function attribute, x86: Function Attributes.
!                                                              (line 1644)
  * target("altivec") function attribute, PowerPC: Function Attributes.
!                                                              (line 1670)
  * target("arch=ARCH") function attribute, x86: Function Attributes.
!                                                              (line 1653)
  * target("avoid-indexed-addresses") function attribute, PowerPC: Function Attributes.
!                                                              (line 1791)
  * target("cld") function attribute, x86: Function Attributes.
!                                                              (line 1615)
  * target("cmpb") function attribute, PowerPC: Function Attributes.
!                                                              (line 1676)
  * target("cpu=CPU") function attribute, PowerPC: Function Attributes.
!                                                              (line 1806)
  * target("custom-fpu-cfg=NAME") function attribute, Nios II: Function Attributes.
!                                                              (line 1832)
  * target("custom-INSN=N") function attribute, Nios II: Function Attributes.
!                                                              (line 1823)
  * target("default") function attribute, x86: Function Attributes.
!                                                              (line 1553)
  * target("dlmzb") function attribute, PowerPC: Function Attributes.
!                                                              (line 1682)
  * target("fancy-math-387") function attribute, x86: Function Attributes.
!                                                              (line 1619)
  * target("fma4") function attribute, x86: Function Attributes.
!                                                              (line 1599)
  * target("fpmath=FPMATH") function attribute, x86: Function Attributes.
!                                                              (line 1661)
  * target("fprnd") function attribute, PowerPC: Function Attributes.
!                                                              (line 1689)
  * target("friz") function attribute, PowerPC: Function Attributes.
!                                                              (line 1782)
  * target("fused-madd") function attribute, x86: Function Attributes.
!                                                              (line 1624)
  * target("hard-dfp") function attribute, PowerPC: Function Attributes.
!                                                              (line 1695)
  * target("ieee-fp") function attribute, x86: Function Attributes.
!                                                              (line 1629)
  * target("inline-all-stringops") function attribute, x86: Function Attributes.
!                                                              (line 1634)
  * target("inline-stringops-dynamically") function attribute, x86: Function Attributes.
!                                                              (line 1638)
  * target("isel") function attribute, PowerPC: Function Attributes.
!                                                              (line 1701)
  * target("longcall") function attribute, PowerPC: Function Attributes.
!                                                              (line 1801)
  * target("lwp") function attribute, x86: Function Attributes.
!                                                              (line 1607)
  * target("mfcrf") function attribute, PowerPC: Function Attributes.
!                                                              (line 1705)
  * target("mfpgpr") function attribute, PowerPC: Function Attributes.
!                                                              (line 1712)
  * target("mmx") function attribute, x86: Function Attributes.
!                                                              (line 1558)
  * target("mulhw") function attribute, PowerPC: Function Attributes.
!                                                              (line 1719)
  * target("multiple") function attribute, PowerPC: Function Attributes.
!                                                              (line 1726)
  * target("no-custom-INSN") function attribute, Nios II: Function Attributes.
!                                                              (line 1823)
  * target("paired") function attribute, PowerPC: Function Attributes.
!                                                              (line 1796)
  * target("pclmul") function attribute, x86: Function Attributes.
!                                                              (line 1562)
  * target("popcnt") function attribute, x86: Function Attributes.
!                                                              (line 1566)
  * target("popcntb") function attribute, PowerPC: Function Attributes.
!                                                              (line 1737)
  * target("popcntd") function attribute, PowerPC: Function Attributes.
!                                                              (line 1744)
  * target("powerpc-gfxopt") function attribute, PowerPC: Function Attributes.
!                                                              (line 1750)
  * target("powerpc-gpopt") function attribute, PowerPC: Function Attributes.
!                                                              (line 1756)
  * target("recip") function attribute, x86: Function Attributes.
!                                                              (line 1648)
  * target("recip-precision") function attribute, PowerPC: Function Attributes.
!                                                              (line 1762)
  * target("sse") function attribute, x86: Function Attributes.
!                                                              (line 1570)
  * target("sse2") function attribute, x86: Function Attributes.
!                                                              (line 1574)
  * target("sse3") function attribute, x86: Function Attributes.
!                                                              (line 1578)
  * target("sse4") function attribute, x86: Function Attributes.
!                                                              (line 1582)
  * target("sse4.1") function attribute, x86: Function Attributes.
!                                                              (line 1587)
  * target("sse4.2") function attribute, x86: Function Attributes.
!                                                              (line 1591)
  * target("sse4a") function attribute, x86: Function Attributes.
!                                                              (line 1595)
  * target("ssse3") function attribute, x86: Function Attributes.
!                                                              (line 1611)
  * target("string") function attribute, PowerPC: Function Attributes.
!                                                              (line 1768)
  * target("tune=TUNE") function attribute, PowerPC: Function Attributes.
!                                                              (line 1813)
  * target("tune=TUNE") function attribute, x86: Function Attributes.
!                                                              (line 1657)
  * target("update") function attribute, PowerPC: Function Attributes.
!                                                              (line 1731)
  * target("vsx") function attribute, PowerPC: Function Attributes.
!                                                              (line 1774)
  * target("xop") function attribute, x86: Function Attributes.
!                                                              (line 1603)
  * TC1:                                   Standards.          (line   13)
  * TC2:                                   Standards.          (line   13)
  * TC3:                                   Standards.          (line   13)
--- 53259,53377 ----
  * tanhl:                                 Other Builtins.     (line    6)
  * tanl:                                  Other Builtins.     (line    6)
  * target function attribute:             Function Attributes.
!                                                              (line 1505)
  * target machine, specifying:            Target Options.     (line    6)
  * target options:                        Target Options.     (line    6)
  * target("abm") function attribute, x86: Function Attributes.
!                                                              (line 1538)
  * target("aes") function attribute, x86: Function Attributes.
!                                                              (line 1543)
  * target("align-stringops") function attribute, x86: Function Attributes.
!                                                              (line 1637)
  * target("altivec") function attribute, PowerPC: Function Attributes.
!                                                              (line 1663)
  * target("arch=ARCH") function attribute, x86: Function Attributes.
!                                                              (line 1646)
  * target("avoid-indexed-addresses") function attribute, PowerPC: Function Attributes.
!                                                              (line 1784)
  * target("cld") function attribute, x86: Function Attributes.
!                                                              (line 1608)
  * target("cmpb") function attribute, PowerPC: Function Attributes.
!                                                              (line 1669)
  * target("cpu=CPU") function attribute, PowerPC: Function Attributes.
!                                                              (line 1799)
  * target("custom-fpu-cfg=NAME") function attribute, Nios II: Function Attributes.
!                                                              (line 1825)
  * target("custom-INSN=N") function attribute, Nios II: Function Attributes.
!                                                              (line 1816)
  * target("default") function attribute, x86: Function Attributes.
!                                                              (line 1546)
  * target("dlmzb") function attribute, PowerPC: Function Attributes.
!                                                              (line 1675)
  * target("fancy-math-387") function attribute, x86: Function Attributes.
!                                                              (line 1612)
  * target("fma4") function attribute, x86: Function Attributes.
!                                                              (line 1592)
  * target("fpmath=FPMATH") function attribute, x86: Function Attributes.
!                                                              (line 1654)
  * target("fprnd") function attribute, PowerPC: Function Attributes.
!                                                              (line 1682)
  * target("friz") function attribute, PowerPC: Function Attributes.
!                                                              (line 1775)
  * target("fused-madd") function attribute, x86: Function Attributes.
!                                                              (line 1617)
  * target("hard-dfp") function attribute, PowerPC: Function Attributes.
!                                                              (line 1688)
  * target("ieee-fp") function attribute, x86: Function Attributes.
!                                                              (line 1622)
  * target("inline-all-stringops") function attribute, x86: Function Attributes.
!                                                              (line 1627)
  * target("inline-stringops-dynamically") function attribute, x86: Function Attributes.
!                                                              (line 1631)
  * target("isel") function attribute, PowerPC: Function Attributes.
!                                                              (line 1694)
  * target("longcall") function attribute, PowerPC: Function Attributes.
!                                                              (line 1794)
  * target("lwp") function attribute, x86: Function Attributes.
!                                                              (line 1600)
  * target("mfcrf") function attribute, PowerPC: Function Attributes.
!                                                              (line 1698)
  * target("mfpgpr") function attribute, PowerPC: Function Attributes.
!                                                              (line 1705)
  * target("mmx") function attribute, x86: Function Attributes.
!                                                              (line 1551)
  * target("mulhw") function attribute, PowerPC: Function Attributes.
!                                                              (line 1712)
  * target("multiple") function attribute, PowerPC: Function Attributes.
!                                                              (line 1719)
  * target("no-custom-INSN") function attribute, Nios II: Function Attributes.
!                                                              (line 1816)
  * target("paired") function attribute, PowerPC: Function Attributes.
!                                                              (line 1789)
  * target("pclmul") function attribute, x86: Function Attributes.
!                                                              (line 1555)
  * target("popcnt") function attribute, x86: Function Attributes.
!                                                              (line 1559)
  * target("popcntb") function attribute, PowerPC: Function Attributes.
!                                                              (line 1730)
  * target("popcntd") function attribute, PowerPC: Function Attributes.
!                                                              (line 1737)
  * target("powerpc-gfxopt") function attribute, PowerPC: Function Attributes.
!                                                              (line 1743)
  * target("powerpc-gpopt") function attribute, PowerPC: Function Attributes.
!                                                              (line 1749)
  * target("recip") function attribute, x86: Function Attributes.
!                                                              (line 1641)
  * target("recip-precision") function attribute, PowerPC: Function Attributes.
!                                                              (line 1755)
  * target("sse") function attribute, x86: Function Attributes.
!                                                              (line 1563)
  * target("sse2") function attribute, x86: Function Attributes.
!                                                              (line 1567)
  * target("sse3") function attribute, x86: Function Attributes.
!                                                              (line 1571)
  * target("sse4") function attribute, x86: Function Attributes.
!                                                              (line 1575)
  * target("sse4.1") function attribute, x86: Function Attributes.
!                                                              (line 1580)
  * target("sse4.2") function attribute, x86: Function Attributes.
!                                                              (line 1584)
  * target("sse4a") function attribute, x86: Function Attributes.
!                                                              (line 1588)
  * target("ssse3") function attribute, x86: Function Attributes.
!                                                              (line 1604)
  * target("string") function attribute, PowerPC: Function Attributes.
!                                                              (line 1761)
  * target("tune=TUNE") function attribute, PowerPC: Function Attributes.
!                                                              (line 1806)
  * target("tune=TUNE") function attribute, x86: Function Attributes.
!                                                              (line 1650)
  * target("update") function attribute, PowerPC: Function Attributes.
!                                                              (line 1724)
  * target("vsx") function attribute, PowerPC: Function Attributes.
!                                                              (line 1767)
  * target("xop") function attribute, x86: Function Attributes.
!                                                              (line 1596)
  * TC1:                                   Standards.          (line   13)
  * TC2:                                   Standards.          (line   13)
  * TC3:                                   Standards.          (line   13)
*************** Keyword Index
*** 53668,53688 ****
  * tgammaf:                               Other Builtins.     (line    6)
  * tgammal:                               Other Builtins.     (line    6)
  * thiscall function attribute, x86-32:   Function Attributes.
!                                                              (line  414)
  * Thread-Local Storage:                  Thread-Local.       (line    6)
  * thunks:                                Nested Functions.   (line    6)
  * TILE-Gx options:                       TILE-Gx Options.    (line    6)
  * TILEPro options:                       TILEPro Options.    (line    6)
  * tiny data section on the H8/300H and H8S: Variable Attributes.
!                                                              (line  418)
! * tiny type attribute, MeP:              Type Attributes.    (line  349)
  * tiny variable attribute, MeP:          Variable Attributes.
!                                                              (line  475)
  * tiny_data variable attribute, H8/300:  Variable Attributes.
!                                                              (line  418)
  * TLS:                                   Thread-Local.       (line    6)
  * tls_model variable attribute:          Variable Attributes.
!                                                              (line  236)
  * TMPDIR:                                Environment Variables.
                                                               (line   45)
  * toascii:                               Other Builtins.     (line    6)
--- 53386,53406 ----
  * tgammaf:                               Other Builtins.     (line    6)
  * tgammal:                               Other Builtins.     (line    6)
  * thiscall function attribute, x86-32:   Function Attributes.
!                                                              (line  410)
  * Thread-Local Storage:                  Thread-Local.       (line    6)
  * thunks:                                Nested Functions.   (line    6)
  * TILE-Gx options:                       TILE-Gx Options.    (line    6)
  * TILEPro options:                       TILEPro Options.    (line    6)
  * tiny data section on the H8/300H and H8S: Variable Attributes.
!                                                              (line  413)
! * tiny type attribute, MeP:              Type Attributes.    (line  348)
  * tiny variable attribute, MeP:          Variable Attributes.
!                                                              (line  468)
  * tiny_data variable attribute, H8/300:  Variable Attributes.
!                                                              (line  413)
  * TLS:                                   Thread-Local.       (line    6)
  * tls_model variable attribute:          Variable Attributes.
!                                                              (line  234)
  * TMPDIR:                                Environment Variables.
                                                               (line   45)
  * toascii:                               Other Builtins.     (line    6)
*************** Keyword Index
*** 53690,53758 ****
  * toupper:                               Other Builtins.     (line    6)
  * towlower:                              Other Builtins.     (line    6)
  * towupper:                              Other Builtins.     (line    6)
! * traditional C language:                C Dialect Options.  (line  344)
  * transparent_union type attribute:      Type Attributes.    (line  143)
- * trap_exit function attribute, SH:      Function Attributes.
-                                                              (line 1844)
  * trapa_handler function attribute, SH:  Function Attributes.
!                                                              (line 1849)
  * trunc:                                 Other Builtins.     (line    6)
  * truncf:                                Other Builtins.     (line    6)
  * truncl:                                Other Builtins.     (line    6)
  * two-stage name lookup:                 Name lookup.        (line    6)
  * type alignment:                        Alignment.          (line    6)
  * type attributes:                       Type Attributes.    (line    6)
- * type_info:                             Vague Linkage.      (line   42)
  * typedef names as function parameters:  Incompatibilities.  (line   97)
  * typeof:                                Typeof.             (line    6)
! * UHK fixed-suffix:                      Fixed-Point.        (line    6)
  * uhk fixed-suffix:                      Fixed-Point.        (line    6)
! * UHR fixed-suffix:                      Fixed-Point.        (line    6)
  * uhr fixed-suffix:                      Fixed-Point.        (line    6)
! * UK fixed-suffix:                       Fixed-Point.        (line    6)
  * uk fixed-suffix:                       Fixed-Point.        (line    6)
! * ULK fixed-suffix:                      Fixed-Point.        (line    6)
  * ulk fixed-suffix:                      Fixed-Point.        (line    6)
  * ULL integer suffix:                    Long Long.          (line    6)
- * ULLK fixed-suffix:                     Fixed-Point.        (line    6)
  * ullk fixed-suffix:                     Fixed-Point.        (line    6)
! * ULLR fixed-suffix:                     Fixed-Point.        (line    6)
  * ullr fixed-suffix:                     Fixed-Point.        (line    6)
! * ULR fixed-suffix:                      Fixed-Point.        (line    6)
  * ulr fixed-suffix:                      Fixed-Point.        (line    6)
  * undefined behavior:                    Bug Criteria.       (line   17)
  * undefined function value:              Bug Criteria.       (line   17)
  * underscores in variables in macros:    Typeof.             (line   46)
  * union:                                 Unnamed Fields.     (line    6)
  * union, casting to a:                   Cast to Union.      (line    6)
  * unions:                                Incompatibilities.  (line  146)
! * unknown pragmas, warning:              Warning Options.    (line  729)
  * unresolved references and -nodefaultlibs: Link Options.    (line   91)
  * unresolved references and -nostdlib:   Link Options.       (line   91)
  * unused function attribute:             Function Attributes.
!                                                              (line 1853)
  * unused label attribute:                Label Attributes.   (line   29)
! * unused type attribute:                 Type Attributes.    (line  195)
  * unused variable attribute:             Variable Attributes.
!                                                              (line  245)
! * UR fixed-suffix:                       Fixed-Point.        (line    6)
  * ur fixed-suffix:                       Fixed-Point.        (line    6)
! * use_debug_exception_return function attribute, MIPS: Function Attributes.
!                                                              (line  756)
! * use_shadow_register_set function attribute, MIPS: Function Attributes.
!                                                              (line  747)
  * used function attribute:               Function Attributes.
!                                                              (line 1858)
  * used variable attribute:               Variable Attributes.
!                                                              (line  250)
  * User stack pointer in interrupts on the Blackfin: Function Attributes.
!                                                              (line  840)
  * V in constraint:                       Simple Constraints. (line   43)
  * V850 Options:                          V850 Options.       (line    6)
  * vague linkage:                         Vague Linkage.      (line    6)
  * value after longjmp:                   Global Reg Vars.    (line   65)
  * variable addressability on the M32R/D: Variable Attributes.
!                                                              (line  446)
  * variable alignment:                    Alignment.          (line    6)
  * variable attributes:                   Variable Attributes.
                                                               (line    6)
--- 53408,53476 ----
  * toupper:                               Other Builtins.     (line    6)
  * towlower:                              Other Builtins.     (line    6)
  * towupper:                              Other Builtins.     (line    6)
! * traditional C language:                C Dialect Options.  (line  345)
  * transparent_union type attribute:      Type Attributes.    (line  143)
  * trapa_handler function attribute, SH:  Function Attributes.
!                                                              (line 1842)
! * trap_exit function attribute, SH:      Function Attributes.
!                                                              (line 1837)
  * trunc:                                 Other Builtins.     (line    6)
  * truncf:                                Other Builtins.     (line    6)
  * truncl:                                Other Builtins.     (line    6)
  * two-stage name lookup:                 Name lookup.        (line    6)
  * type alignment:                        Alignment.          (line    6)
  * type attributes:                       Type Attributes.    (line    6)
  * typedef names as function parameters:  Incompatibilities.  (line   97)
  * typeof:                                Typeof.             (line    6)
! * type_info:                             Vague Linkage.      (line   42)
  * uhk fixed-suffix:                      Fixed-Point.        (line    6)
! * UHK fixed-suffix:                      Fixed-Point.        (line    6)
  * uhr fixed-suffix:                      Fixed-Point.        (line    6)
! * UHR fixed-suffix:                      Fixed-Point.        (line    6)
  * uk fixed-suffix:                       Fixed-Point.        (line    6)
! * UK fixed-suffix:                       Fixed-Point.        (line    6)
  * ulk fixed-suffix:                      Fixed-Point.        (line    6)
+ * ULK fixed-suffix:                      Fixed-Point.        (line    6)
  * ULL integer suffix:                    Long Long.          (line    6)
  * ullk fixed-suffix:                     Fixed-Point.        (line    6)
! * ULLK fixed-suffix:                     Fixed-Point.        (line    6)
  * ullr fixed-suffix:                     Fixed-Point.        (line    6)
! * ULLR fixed-suffix:                     Fixed-Point.        (line    6)
  * ulr fixed-suffix:                      Fixed-Point.        (line    6)
+ * ULR fixed-suffix:                      Fixed-Point.        (line    6)
  * undefined behavior:                    Bug Criteria.       (line   17)
  * undefined function value:              Bug Criteria.       (line   17)
  * underscores in variables in macros:    Typeof.             (line   46)
  * union:                                 Unnamed Fields.     (line    6)
  * union, casting to a:                   Cast to Union.      (line    6)
  * unions:                                Incompatibilities.  (line  146)
! * unknown pragmas, warning:              Warning Options.    (line  726)
  * unresolved references and -nodefaultlibs: Link Options.    (line   91)
  * unresolved references and -nostdlib:   Link Options.       (line   91)
  * unused function attribute:             Function Attributes.
!                                                              (line 1846)
  * unused label attribute:                Label Attributes.   (line   29)
! * unused type attribute:                 Type Attributes.    (line  196)
  * unused variable attribute:             Variable Attributes.
!                                                              (line  243)
  * ur fixed-suffix:                       Fixed-Point.        (line    6)
! * UR fixed-suffix:                       Fixed-Point.        (line    6)
  * used function attribute:               Function Attributes.
!                                                              (line 1851)
  * used variable attribute:               Variable Attributes.
!                                                              (line  248)
  * User stack pointer in interrupts on the Blackfin: Function Attributes.
!                                                              (line  827)
! * use_debug_exception_return function attribute, MIPS: Function Attributes.
!                                                              (line  748)
! * use_shadow_register_set function attribute, MIPS: Function Attributes.
!                                                              (line  739)
  * V in constraint:                       Simple Constraints. (line   43)
  * V850 Options:                          V850 Options.       (line    6)
  * vague linkage:                         Vague Linkage.      (line    6)
  * value after longjmp:                   Global Reg Vars.    (line   65)
  * variable addressability on the M32R/D: Variable Attributes.
!                                                              (line  440)
  * variable alignment:                    Alignment.          (line    6)
  * variable attributes:                   Variable Attributes.
                                                               (line    6)
*************** Keyword Index
*** 53765,53795 ****
  * variadic macros:                       Variadic Macros.    (line    6)
  * VAX options:                           VAX Options.        (line    6)
  * vector function attribute, RX:         Function Attributes.
!                                                              (line 1868)
  * vector_size variable attribute:        Variable Attributes.
!                                                              (line  259)
  * version_id function attribute, IA-64:  Function Attributes.
!                                                              (line 1875)
  * vfprintf:                              Other Builtins.     (line    6)
  * vfscanf:                               Other Builtins.     (line    6)
  * visibility function attribute:         Function Attributes.
!                                                              (line 1885)
! * visibility type attribute:             Type Attributes.    (line  269)
  * Visium options:                        Visium Options.     (line    6)
  * VLAs:                                  Variable Length.    (line    6)
  * vliw function attribute, MeP:          Function Attributes.
!                                                              (line 1982)
  * void pointers, arithmetic:             Pointer Arith.      (line    6)
  * void, size of pointer to:              Pointer Arith.      (line    6)
- * volatile access <1>:                   C++ Volatiles.      (line    6)
  * volatile access:                       Volatiles.          (line    6)
  * volatile applied to function:          Function Attributes.
                                                               (line    6)
  * volatile asm:                          Extended Asm.       (line  109)
- * volatile read <1>:                     C++ Volatiles.      (line    6)
  * volatile read:                         Volatiles.          (line    6)
! * volatile write <1>:                    C++ Volatiles.      (line    6)
  * volatile write:                        Volatiles.          (line    6)
  * vprintf:                               Other Builtins.     (line    6)
  * vscanf:                                Other Builtins.     (line    6)
  * vsnprintf:                             Other Builtins.     (line    6)
--- 53483,53513 ----
  * variadic macros:                       Variadic Macros.    (line    6)
  * VAX options:                           VAX Options.        (line    6)
  * vector function attribute, RX:         Function Attributes.
!                                                              (line 1861)
  * vector_size variable attribute:        Variable Attributes.
!                                                              (line  257)
  * version_id function attribute, IA-64:  Function Attributes.
!                                                              (line 1868)
  * vfprintf:                              Other Builtins.     (line    6)
  * vfscanf:                               Other Builtins.     (line    6)
  * visibility function attribute:         Function Attributes.
!                                                              (line 1878)
! * visibility type attribute:             Type Attributes.    (line  270)
  * Visium options:                        Visium Options.     (line    6)
  * VLAs:                                  Variable Length.    (line    6)
  * vliw function attribute, MeP:          Function Attributes.
!                                                              (line 1974)
  * void pointers, arithmetic:             Pointer Arith.      (line    6)
  * void, size of pointer to:              Pointer Arith.      (line    6)
  * volatile access:                       Volatiles.          (line    6)
+ * volatile access <1>:                   C++ Volatiles.      (line    6)
  * volatile applied to function:          Function Attributes.
                                                               (line    6)
  * volatile asm:                          Extended Asm.       (line  109)
  * volatile read:                         Volatiles.          (line    6)
! * volatile read <1>:                     C++ Volatiles.      (line    6)
  * volatile write:                        Volatiles.          (line    6)
+ * volatile write <1>:                    C++ Volatiles.      (line    6)
  * vprintf:                               Other Builtins.     (line    6)
  * vscanf:                                Other Builtins.     (line    6)
  * vsnprintf:                             Other Builtins.     (line    6)
*************** Keyword Index
*** 53797,53836 ****
  * vsscanf:                               Other Builtins.     (line    6)
  * vtable:                                Vague Linkage.      (line   27)
  * VxWorks Options:                       VxWorks Options.    (line    6)
- * W floating point suffix:               Floating Types.     (line    6)
  * w floating point suffix:               Floating Types.     (line    6)
  * wakeup function attribute, MSP430:     Function Attributes.
!                                                              (line  703)
  * warm function attribute, NDS32:        Function Attributes.
!                                                              (line 1357)
! * warn_unused type attribute:            C++ Attributes.     (line   77)
! * warn_unused_result function attribute: Function Attributes.
!                                                              (line 1988)
  * warning for comparison of signed and unsigned values: Warning Options.
!                                                              (line 1299)
  * warning for overloaded virtual function: C++ Dialect Options.
!                                                              (line  682)
  * warning for reordering of member initializers: C++ Dialect Options.
!                                                              (line  598)
! * warning for unknown pragmas:           Warning Options.    (line  729)
  * warning function attribute:            Function Attributes.
!                                                              (line  206)
  * warning GCC_COLORS capability:         Language Independent Options.
                                                               (line   72)
  * warning messages:                      Warning Options.    (line    6)
! * warnings from system headers:          Warning Options.    (line  949)
  * warnings vs errors:                    Warnings and Errors.
                                                               (line    6)
  * weak function attribute:               Function Attributes.
!                                                              (line 2005)
  * weak variable attribute:               Variable Attributes.
!                                                              (line  304)
  * weakref function attribute:            Function Attributes.
!                                                              (line 2014)
  * whitespace:                            Incompatibilities.  (line  112)
  * Windows Options for x86:               x86 Windows Options.
                                                               (line    6)
! * X in constraint:                       Simple Constraints. (line  124)
  * X3.159-1989:                           Standards.          (line   13)
  * x86 Options:                           x86 Options.        (line    6)
  * x86 Windows Options:                   x86 Windows Options.
--- 53515,53554 ----
  * vsscanf:                               Other Builtins.     (line    6)
  * vtable:                                Vague Linkage.      (line   27)
  * VxWorks Options:                       VxWorks Options.    (line    6)
  * w floating point suffix:               Floating Types.     (line    6)
+ * W floating point suffix:               Floating Types.     (line    6)
  * wakeup function attribute, MSP430:     Function Attributes.
!                                                              (line  696)
  * warm function attribute, NDS32:        Function Attributes.
!                                                              (line 1350)
  * warning for comparison of signed and unsigned values: Warning Options.
!                                                              (line 1289)
  * warning for overloaded virtual function: C++ Dialect Options.
!                                                              (line  676)
  * warning for reordering of member initializers: C++ Dialect Options.
!                                                              (line  594)
! * warning for unknown pragmas:           Warning Options.    (line  726)
  * warning function attribute:            Function Attributes.
!                                                              (line  204)
  * warning GCC_COLORS capability:         Language Independent Options.
                                                               (line   72)
  * warning messages:                      Warning Options.    (line    6)
! * warnings from system headers:          Warning Options.    (line  945)
  * warnings vs errors:                    Warnings and Errors.
                                                               (line    6)
+ * warn_unused type attribute:            C++ Attributes.     (line   79)
+ * warn_unused_result function attribute: Function Attributes.
+                                                              (line 1980)
  * weak function attribute:               Function Attributes.
!                                                              (line 1997)
  * weak variable attribute:               Variable Attributes.
!                                                              (line  301)
  * weakref function attribute:            Function Attributes.
!                                                              (line 2006)
  * whitespace:                            Incompatibilities.  (line  112)
  * Windows Options for x86:               x86 Windows Options.
                                                               (line    6)
! * X in constraint:                       Simple Constraints. (line  122)
  * X3.159-1989:                           Standards.          (line   13)
  * x86 Options:                           x86 Options.        (line    6)
  * x86 Windows Options:                   x86 Windows Options.
*************** Keyword Index
*** 53853,54189 ****
  
  
  Tag Table:
! Node: Top2022
! Node: G++ and GCC3849
! Node: Standards5918
! Node: Invoking GCC18008
! Node: Option Summary21753
! Node: Overall Options66091
! Node: Invoking G++80329
! Node: C Dialect Options81852
! Node: C++ Dialect Options99118
! Node: Objective-C and Objective-C++ Dialect Options131104
! Node: Language Independent Options142340
! Node: Warning Options147158
! Node: Debugging Options225591
! Node: Optimize Options297069
! Ref: Type-punning360332
! Node: Preprocessor Options449123
! Ref: Wtrigraphs453905
! Ref: dashMF458653
! Ref: fdollars-in-identifiers469517
! Node: Assembler Options479760
! Node: Link Options480452
! Ref: Link Options-Footnote-1493980
! Node: Directory Options494314
! Node: Spec Files500876
! Node: Target Options522747
! Node: Submodel Options523146
! Node: AArch64 Options524911
! Node: Adapteva Epiphany Options530651
! Node: ARC Options536602
! Node: ARM Options549041
! Node: AVR Options566728
! Node: Blackfin Options588022
! Node: C6X Options596037
! Node: CRIS Options597580
! Node: CR16 Options601324
! Node: Darwin Options602231
! Node: DEC Alpha Options609672
! Node: FR30 Options621260
! Node: FRV Options621825
! Node: GNU/Linux Options628544
! Node: H8/300 Options629805
! Node: HPPA Options631255
! Node: IA-64 Options640444
! Node: LM32 Options648489
! Node: M32C Options649013
! Node: M32R/D Options650287
! Node: M680x0 Options653833
! Node: MCore Options667879
! Node: MeP Options669382
! Node: MicroBlaze Options673342
! Node: MIPS Options676138
! Node: MMIX Options709659
! Node: MN10300 Options712141
! Node: Moxie Options714684
! Node: MSP430 Options715172
! Node: NDS32 Options718676
! Node: Nios II Options720570
! Node: Nvidia PTX Options730747
! Node: PDP-11 Options731139
! Node: picoChip Options732836
! Node: PowerPC Options734977
! Node: RL78 Options735198
! Node: RS/6000 and PowerPC Options736046
! Node: RX Options776374
! Node: S/390 and zSeries Options783724
! Node: Score Options792282
! Node: SH Options793124
! Node: Solaris 2 Options814018
! Node: SPARC Options815546
! Node: SPU Options828815
! Node: System V Options833752
! Node: TILE-Gx Options834578
! Node: TILEPro Options835596
! Node: V850 Options836100
! Node: VAX Options842792
! Node: Visium Options843330
! Node: VMS Options845638
! Node: VxWorks Options846452
! Node: x86 Options847604
! Node: x86 Windows Options891188
! Node: Xstormy16 Options893988
! Node: Xtensa Options894282
! Node: zSeries Options898607
! Node: Code Gen Options898803
! Node: Environment Variables929627
! Node: Precompiled Headers937628
! Node: C Implementation943636
! Node: Translation implementation945325
! Node: Environment implementation945917
! Node: Identifiers implementation946472
! Node: Characters implementation947559
! Node: Integers implementation951210
! Node: Floating point implementation953096
! Node: Arrays and pointers implementation956161
! Ref: Arrays and pointers implementation-Footnote-1957620
! Node: Hints implementation957744
! Node: Structures unions enumerations and bit-fields implementation959231
! Node: Qualifiers implementation961456
! Node: Declarators implementation963236
! Node: Statements implementation963578
! Node: Preprocessing directives implementation963905
! Node: Library functions implementation966227
! Node: Architecture implementation966877
! Node: Locale-specific behavior implementation968519
! Node: C++ Implementation968824
! Node: Conditionally-supported behavior970106
! Node: Exception handling970724
! Node: C Extensions971133
! Node: Statement Exprs976291
! Node: Local Labels980767
! Node: Labels as Values983740
! Ref: Labels as Values-Footnote-1986265
! Node: Nested Functions986448
! Node: Constructing Calls990406
! Node: Typeof995124
! Node: Conditionals999052
! Node: __int128999942
! Node: Long Long1000466
! Node: Complex1001942
! Node: Floating Types1004531
! Node: Half-Precision1005651
! Node: Decimal Float1007833
! Node: Hex Floats1009688
! Node: Fixed-Point1010724
! Node: Named Address Spaces1014006
! Ref: AVR Named Address Spaces1014687
! Node: Zero Length1019893
! Node: Empty Structures1022932
! Node: Variable Length1023338
! Node: Variadic Macros1026194
! Node: Escaped Newlines1028572
! Node: Subscripting1029433
! Node: Pointer Arith1030159
! Node: Pointers to Arrays1030733
! Node: Initializers1031477
! Node: Compound Literals1031978
! Node: Designated Inits1035325
! Node: Case Ranges1039063
! Node: Cast to Union1039744
! Node: Mixed Declarations1040835
! Node: Function Attributes1041345
! Node: Label Attributes1135193
! Node: Attribute Syntax1137037
! Node: Function Prototypes1147251
! Node: C++ Comments1149032
! Node: Dollar Signs1149551
! Node: Character Escapes1150016
! Node: Variable Attributes1150310
! Ref: AVR Variable Attributes1164031
! Ref: MeP Variable Attributes1169396
! Ref: x86 Variable Attributes1171966
! Node: Type Attributes1177005
! Ref: MeP Type Attributes1192254
! Ref: PowerPC Type Attributes1192528
! Ref: SPU Type Attributes1193389
! Ref: x86 Type Attributes1193680
! Node: Alignment1194368
! Node: Inline1195738
! Node: Volatiles1200713
! Node: Using Assembly Language with C1203613
! Node: Basic Asm1204817
! Node: Extended Asm1208951
! Ref: Volatile1212748
! Ref: AssemblerTemplate1216820
! Ref: OutputOperands1221045
! Ref: InputOperands1227947
! Ref: Clobbers1232172
! Ref: GotoLabels1235468
! Ref: x86Operandmodifiers1237601
! Ref: x86floatingpointasmoperands1239845
! Node: Constraints1243175
! Node: Simple Constraints1244281
! Node: Multi-Alternative1251606
! Node: Modifiers1253613
! Node: Machine Constraints1257117
! Node: Asm Labels1313569
! Node: Explicit Reg Vars1315267
! Node: Global Reg Vars1316888
! Node: Local Reg Vars1321388
! Node: Size of an asm1324508
! Node: Alternate Keywords1325753
! Node: Incomplete Enums1327252
! Node: Function Names1328008
! Node: Return Address1329611
! Node: Vector Extensions1333118
! Node: Offsetof1340403
! Node: __sync Builtins1341244
! Node: __atomic Builtins1346720
! Node: Integer Overflow Builtins1358324
! Node: x86 specific memory model extensions for transactional memory1362454
! Node: Object Size Checking1363723
! Node: Pointer Bounds Checker builtins1369229
! Node: Cilk Plus Builtins1375235
! Node: Other Builtins1376151
! Node: Target Builtins1405795
! Node: AArch64 Built-in Functions1407287
! Node: Alpha Built-in Functions1407742
! Node: Altera Nios II Built-in Functions1410790
! Node: ARC Built-in Functions1414775
! Node: ARC SIMD Built-in Functions1419986
! Node: ARM iWMMXt Built-in Functions1428882
! Node: ARM C Language Extensions (ACLE)1435878
! Node: ARM Floating Point Status and Control Intrinsics1437155
! Node: AVR Built-in Functions1437631
! Node: Blackfin Built-in Functions1440730
! Node: FR-V Built-in Functions1441349
! Node: Argument Types1442215
! Node: Directly-mapped Integer Functions1443969
! Node: Directly-mapped Media Functions1445053
! Node: Raw read/write Functions1452087
! Node: Other Built-in Functions1453001
! Node: MIPS DSP Built-in Functions1454187
! Node: MIPS Paired-Single Support1466685
! Node: MIPS Loongson Built-in Functions1468184
! Node: Paired-Single Arithmetic1474704
! Node: Paired-Single Built-in Functions1475652
! Node: MIPS-3D Built-in Functions1478319
! Node: Other MIPS Built-in Functions1483696
! Node: MSP430 Built-in Functions1484701
! Node: NDS32 Built-in Functions1486102
! Node: picoChip Built-in Functions1487395
! Node: PowerPC Built-in Functions1488739
! Node: PowerPC AltiVec/VSX Built-in Functions1492446
! Node: PowerPC Hardware Transactional Memory Built-in Functions1632237
! Node: RX Built-in Functions1640728
! Node: S/390 System z Built-in Functions1644761
! Node: SH Built-in Functions1649998
! Node: SPARC VIS Built-in Functions1651726
! Node: SPU Built-in Functions1657330
! Node: TI C6X Built-in Functions1659146
! Node: TILE-Gx Built-in Functions1660170
! Node: TILEPro Built-in Functions1661287
! Node: x86 Built-in Functions1662385
! Node: x86 transactional memory intrinsics1721920
! Node: Target Format Checks1725140
! Node: Solaris Format Checks1725572
! Node: Darwin Format Checks1725998
! Node: Pragmas1726816
! Node: ARM Pragmas1727552
! Node: M32C Pragmas1728155
! Node: MeP Pragmas1729229
! Node: RS/6000 and PowerPC Pragmas1731298
! Node: Darwin Pragmas1732039
! Node: Solaris Pragmas1733106
! Node: Symbol-Renaming Pragmas1734267
! Node: Structure-Packing Pragmas1735881
! Node: Weak Pragmas1737530
! Node: Diagnostic Pragmas1738264
! Node: Visibility Pragmas1741371
! Node: Push/Pop Macro Pragmas1742056
! Node: Function Specific Option Pragmas1743028
! Node: Loop-Specific Pragmas1744873
! Node: Unnamed Fields1745963
! Node: Thread-Local1748161
! Node: C99 Thread-Local Edits1750266
! Node: C++98 Thread-Local Edits1752278
! Node: Binary constants1755722
! Node: C++ Extensions1756393
! Node: C++ Volatiles1758104
! Node: Restricted Pointers1760452
! Node: Vague Linkage1762043
! Node: C++ Interface1765667
! Ref: C++ Interface-Footnote-11769460
! Node: Template Instantiation1769596
! Node: Bound member functions1776182
! Node: C++ Attributes1777714
! Node: Function Multiversioning1782151
! Node: Namespace Association1783966
! Node: Type Traits1785346
! Node: Java Exceptions1791834
! Node: Deprecated Features1793224
! Node: Backwards Compatibility1796189
! Node: Objective-C1797541
! Node: GNU Objective-C runtime API1798150
! Node: Modern GNU Objective-C runtime API1799157
! Node: Traditional GNU Objective-C runtime API1801594
! Node: Executing code before main1802322
! Node: What you can and what you cannot do in +load1805064
! Node: Type encoding1807436
! Node: Legacy type encoding1812512
! Node: @encode1813603
! Node: Method signatures1814148
! Node: Garbage Collection1816143
! Node: Constant string objects1818832
! Node: compatibility_alias1821340
! Node: Exceptions1822066
! Node: Synchronization1824777
! Node: Fast enumeration1825961
! Node: Using fast enumeration1826273
! Node: c99-like fast enumeration syntax1827484
! Node: Fast enumeration details1828187
! Node: Fast enumeration protocol1830528
! Node: Messaging with the GNU Objective-C runtime1833680
! Node: Dynamically registering methods1835051
! Node: Forwarding hook1836742
! Node: Compatibility1839782
! Node: Gcov1846349
! Node: Gcov Intro1846884
! Node: Invoking Gcov1849602
! Node: Gcov and Optimization1863848
! Node: Gcov Data Files1866848
! Node: Cross-profiling1868243
! Node: Gcov-tool1870094
! Node: Gcov-tool Intro1870517
! Node: Invoking Gcov-tool1872478
! Node: Trouble1875026
! Node: Actual Bugs1876443
! Node: Interoperation1876890
! Node: Incompatibilities1883782
! Node: Fixed Headers1891933
! Node: Standard Libraries1893596
! Node: Disappointments1894968
! Node: C++ Misunderstandings1899326
! Node: Static Definitions1900137
! Node: Name lookup1901190
! Ref: Name lookup-Footnote-11905968
! Node: Temporaries1906155
! Node: Copy Assignment1908131
! Node: Non-bugs1909938
! Node: Warnings and Errors1920445
! Node: Bugs1922207
! Node: Bug Criteria1922674
! Node: Bug Reporting1924884
! Node: Service1925105
! Node: Contributing1925924
! Node: Funding1926664
! Node: GNU Project1929153
! Node: Copying1929799
! Node: GNU Free Documentation License1967327
! Node: Contributors1992464
! Node: Option Index2031232
! Node: Keyword Index2251989
  
  End Tag Table
--- 53571,53910 ----
  
  
  Tag Table:
! Node: Top2057
! Node: G++ and GCC3959
! Node: Standards6016
! Node: Invoking GCC18108
! Node: Option Summary21853
! Node: Overall Options66239
! Node: Invoking G++80426
! Node: C Dialect Options81949
! Node: C++ Dialect Options99203
! Node: Objective-C and Objective-C++ Dialect Options131168
! Node: Language Independent Options142403
! Node: Warning Options147227
! Node: Debugging Options225733
! Node: Optimize Options297330
! Ref: Type-punning360573
! Node: Preprocessor Options449492
! Ref: Wtrigraphs454275
! Ref: dashMF459025
! Ref: fdollars-in-identifiers469906
! Node: Assembler Options480107
! Node: Link Options480798
! Ref: Link Options-Footnote-1494311
! Node: Directory Options494647
! Node: Spec Files501201
! Node: Target Options523017
! Node: Submodel Options523416
! Node: AArch64 Options525181
! Node: Adapteva Epiphany Options530918
! Node: ARC Options536866
! Node: ARM Options549310
! Node: AVR Options566996
! Node: Blackfin Options588420
! Node: C6X Options596438
! Node: CRIS Options597981
! Node: CR16 Options601720
! Node: Darwin Options602631
! Node: DEC Alpha Options610071
! Node: FR30 Options621687
! Node: FRV Options622251
! Node: GNU/Linux Options629015
! Node: H8/300 Options630275
! Node: HPPA Options631727
! Node: IA-64 Options640917
! Node: LM32 Options648964
! Node: M32C Options649487
! Node: M32R/D Options650760
! Node: M680x0 Options654305
! Node: MCore Options668340
! Node: MeP Options669842
! Node: MicroBlaze Options673802
! Node: MIPS Options676604
! Node: MMIX Options710061
! Node: MN10300 Options712538
! Node: Moxie Options715079
! Node: MSP430 Options715566
! Node: NDS32 Options719065
! Node: Nios II Options720959
! Node: Nvidia PTX Options731158
! Node: PDP-11 Options731549
! Node: picoChip Options733246
! Node: PowerPC Options735384
! Node: RL78 Options735605
! Node: RS/6000 and PowerPC Options736452
! Node: RX Options776998
! Node: S/390 and zSeries Options784346
! Node: Score Options792891
! Node: SH Options793740
! Node: Solaris 2 Options814611
! Node: SPARC Options816133
! Node: SPU Options829410
! Node: System V Options834349
! Node: TILE-Gx Options835175
! Node: TILEPro Options836193
! Node: V850 Options836697
! Node: VAX Options843384
! Node: Visium Options843922
! Node: VMS Options846230
! Node: VxWorks Options847046
! Node: x86 Options848198
! Node: x86 Windows Options891820
! Node: Xstormy16 Options894617
! Node: Xtensa Options894911
! Node: zSeries Options899236
! Node: Code Gen Options899432
! Node: Environment Variables930216
! Node: Precompiled Headers938219
! Node: C Implementation944222
! Node: Translation implementation945912
! Node: Environment implementation946503
! Node: Identifiers implementation947057
! Node: Characters implementation948143
! Node: Integers implementation951793
! Node: Floating point implementation953678
! Node: Arrays and pointers implementation956741
! Ref: Arrays and pointers implementation-Footnote-1958201
! Node: Hints implementation958327
! Node: Structures unions enumerations and bit-fields implementation959812
! Node: Qualifiers implementation962036
! Node: Declarators implementation963816
! Node: Statements implementation964157
! Node: Preprocessing directives implementation964483
! Node: Library functions implementation966804
! Node: Architecture implementation967453
! Node: Locale-specific behavior implementation969098
! Node: C++ Implementation969403
! Node: Conditionally-supported behavior970686
! Node: Exception handling971303
! Node: C Extensions971711
! Node: Statement Exprs976867
! Node: Local Labels981344
! Node: Labels as Values984317
! Ref: Labels as Values-Footnote-1986844
! Node: Nested Functions987029
! Node: Constructing Calls990987
! Node: Typeof995704
! Node: Conditionals999633
! Node: __int1281000522
! Node: Long Long1001047
! Node: Complex1002523
! Node: Floating Types1005111
! Node: Half-Precision1006231
! Node: Decimal Float1008416
! Node: Hex Floats1010272
! Node: Fixed-Point1011309
! Node: Named Address Spaces1014569
! Ref: AVR Named Address Spaces1015250
! Node: Zero Length1020458
! Node: Empty Structures1023498
! Node: Variable Length1023904
! Node: Variadic Macros1026760
! Node: Escaped Newlines1029138
! Node: Subscripting1029999
! Node: Pointer Arith1030724
! Node: Pointers to Arrays1031298
! Node: Initializers1032043
! Node: Compound Literals1032544
! Node: Designated Inits1035890
! Node: Case Ranges1039628
! Node: Cast to Union1040309
! Node: Mixed Declarations1041399
! Node: Function Attributes1041909
! Node: Label Attributes1135841
! Node: Attribute Syntax1137684
! Node: Function Prototypes1147895
! Node: C++ Comments1149675
! Node: Dollar Signs1150194
! Node: Character Escapes1150659
! Node: Variable Attributes1150953
! Ref: AVR Variable Attributes1164659
! Ref: MeP Variable Attributes1170023
! Ref: x86 Variable Attributes1172583
! Node: Type Attributes1177619
! Ref: MeP Type Attributes1192864
! Ref: PowerPC Type Attributes1193138
! Ref: SPU Type Attributes1193999
! Ref: x86 Type Attributes1194290
! Node: Alignment1194979
! Node: Inline1196349
! Node: Volatiles1201325
! Node: Using Assembly Language with C1204224
! Node: Basic Asm1205428
! Node: Extended Asm1209572
! Ref: Volatile1213376
! Ref: AssemblerTemplate1217461
! Ref: OutputOperands1221699
! Ref: InputOperands1228618
! Ref: Clobbers1232854
! Ref: GotoLabels1236160
! Ref: x86Operandmodifiers1238295
! Ref: x86floatingpointasmoperands1240466
! Node: Constraints1243795
! Node: Simple Constraints1244901
! Node: Multi-Alternative1252215
! Node: Modifiers1254222
! Node: Machine Constraints1257726
! Node: Asm Labels1314752
! Node: Explicit Reg Vars1316450
! Node: Global Reg Vars1318066
! Node: Local Reg Vars1322566
! Node: Size of an asm1325689
! Node: Alternate Keywords1326933
! Node: Incomplete Enums1328432
! Node: Function Names1329188
! Node: Return Address1330791
! Node: Vector Extensions1334298
! Node: Offsetof1341593
! Node: __sync Builtins1342426
! Node: __atomic Builtins1347901
! Node: Integer Overflow Builtins1359500
! Node: x86 specific memory model extensions for transactional memory1363685
! Node: Object Size Checking1364954
! Node: Pointer Bounds Checker builtins1370460
! Node: Cilk Plus Builtins1376466
! Node: Other Builtins1377372
! Node: Target Builtins1406999
! Node: AArch64 Built-in Functions1408491
! Node: Alpha Built-in Functions1408946
! Node: Altera Nios II Built-in Functions1411994
! Node: ARC Built-in Functions1415981
! Node: ARC SIMD Built-in Functions1421193
! Node: ARM iWMMXt Built-in Functions1430089
! Node: ARM C Language Extensions (ACLE)1437085
! Node: ARM Floating Point Status and Control Intrinsics1438362
! Node: AVR Built-in Functions1438838
! Node: Blackfin Built-in Functions1441945
! Node: FR-V Built-in Functions1442564
! Node: Argument Types1443432
! Node: Directly-mapped Integer Functions1445186
! Node: Directly-mapped Media Functions1446270
! Node: Raw read/write Functions1454476
! Node: Other Built-in Functions1455384
! Node: MIPS DSP Built-in Functions1456570
! Node: MIPS Paired-Single Support1469067
! Node: MIPS Loongson Built-in Functions1470566
! Node: Paired-Single Arithmetic1477081
! Node: Paired-Single Built-in Functions1478029
! Node: MIPS-3D Built-in Functions1480696
! Node: Other MIPS Built-in Functions1486074
! Node: MSP430 Built-in Functions1487079
! Node: NDS32 Built-in Functions1488480
! Node: picoChip Built-in Functions1489773
! Node: PowerPC Built-in Functions1491116
! Node: PowerPC AltiVec/VSX Built-in Functions1494818
! Node: PowerPC Hardware Transactional Memory Built-in Functions1634707
! Node: RX Built-in Functions1643198
! Node: S/390 System z Built-in Functions1647231
! Node: SH Built-in Functions1652460
! Node: SPARC VIS Built-in Functions1654188
! Node: SPU Built-in Functions1659791
! Node: TI C6X Built-in Functions1661608
! Node: TILE-Gx Built-in Functions1662633
! Node: TILEPro Built-in Functions1663752
! Node: x86 Built-in Functions1664852
! Node: x86 transactional memory intrinsics1724389
! Node: Target Format Checks1727609
! Node: Solaris Format Checks1728041
! Node: Darwin Format Checks1728467
! Node: Pragmas1729285
! Node: ARM Pragmas1730021
! Node: M32C Pragmas1730624
! Node: MeP Pragmas1731696
! Node: RS/6000 and PowerPC Pragmas1733764
! Node: Darwin Pragmas1734505
! Node: Solaris Pragmas1735572
! Node: Symbol-Renaming Pragmas1736736
! Node: Structure-Packing Pragmas1738353
! Node: Weak Pragmas1739997
! Node: Diagnostic Pragmas1740731
! Node: Visibility Pragmas1743840
! Node: Push/Pop Macro Pragmas1744525
! Node: Function Specific Option Pragmas1745498
! Node: Loop-Specific Pragmas1747346
! Node: Unnamed Fields1748439
! Node: Thread-Local1750636
! Node: C99 Thread-Local Edits1752741
! Node: C++98 Thread-Local Edits1754739
! Node: Binary constants1758184
! Node: C++ Extensions1758855
! Node: C++ Volatiles1760566
! Node: Restricted Pointers1762914
! Node: Vague Linkage1764505
! Node: C++ Interface1768128
! Ref: C++ Interface-Footnote-11771925
! Node: Template Instantiation1772063
! Node: Bound member functions1778648
! Node: C++ Attributes1780180
! Node: Function Multiversioning1784619
! Node: Namespace Association1786436
! Node: Type Traits1787816
! Node: Java Exceptions1794299
! Node: Deprecated Features1795689
! Node: Backwards Compatibility1798656
! Node: Objective-C1800003
! Node: GNU Objective-C runtime API1800610
! Node: Modern GNU Objective-C runtime API1801617
! Node: Traditional GNU Objective-C runtime API1804053
! Node: Executing code before main1804780
! Node: What you can and what you cannot do in +load1807524
! Node: Type encoding1809894
! Node: Legacy type encoding1814921
! Node: @encode1816011
! Node: Method signatures1816556
! Node: Garbage Collection1818548
! Node: Constant string objects1821238
! Node: compatibility_alias1823747
! Node: Exceptions1824472
! Node: Synchronization1827182
! Node: Fast enumeration1828366
! Node: Using fast enumeration1828678
! Node: c99-like fast enumeration syntax1829889
! Node: Fast enumeration details1830592
! Node: Fast enumeration protocol1832932
! Node: Messaging with the GNU Objective-C runtime1836084
! Node: Dynamically registering methods1837456
! Node: Forwarding hook1839147
! Node: Compatibility1842187
! Node: Gcov1848743
! Node: Gcov Intro1849278
! Node: Invoking Gcov1851996
! Node: Gcov and Optimization1866920
! Node: Gcov Data Files1869922
! Node: Cross-profiling1871317
! Node: Gcov-tool1873171
! Node: Gcov-tool Intro1873596
! Node: Invoking Gcov-tool1875566
! Node: Gcov-dump1878145
! Node: Gcov-dump Intro1878467
! Node: Invoking Gcov-dump1878734
! Node: Trouble1879403
! Node: Actual Bugs1880820
! Node: Interoperation1881267
! Node: Incompatibilities1888158
! Node: Fixed Headers1896310
! Node: Standard Libraries1897968
! Node: Disappointments1899340
! Node: C++ Misunderstandings1903699
! Node: Static Definitions1904510
! Node: Name lookup1905563
! Ref: Name lookup-Footnote-11910343
! Node: Temporaries1910532
! Node: Copy Assignment1912508
! Node: Non-bugs1914315
! Node: Warnings and Errors1924821
! Node: Bugs1926583
! Node: Bug Criteria1927050
! Node: Bug Reporting1929260
! Node: Service1929481
! Node: Contributing1930300
! Node: Funding1931040
! Node: GNU Project1933530
! Node: Copying1934176
! Node: GNU Free Documentation License1971685
! Node: Contributors1996803
! Node: Option Index2035568
! Node: Keyword Index2258068
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/gcc/doc/gcc.texi gcc-5.5.0/gcc/doc/gcc.texi
*** gcc-5.4.0/gcc/doc/gcc.texi	Mon Jan  5 12:05:46 2015
--- gcc-5.5.0/gcc/doc/gcc.texi	Wed Mar 22 12:32:56 2017
*************** Texts being (a) (see below), and with th
*** 67,72 ****
--- 67,73 ----
  * g++: (gcc).                  The GNU C++ compiler.
  * gcov: (gcc) Gcov.            @command{gcov}---a test coverage program.
  * gcov-tool: (gcc) Gcov-tool.  @command{gcov-tool}---an offline gcda profile processing program.
+ * gcov-dump: (gcc) Gcov-dump.  @command{gcov-dump}---an offline gcda and gcno profile dump tool.
  @end direntry
  This file documents the use of the GNU compilers.
  @sp 1
*************** Introduction, gccint, GNU Compiler Colle
*** 140,145 ****
--- 141,147 ----
  * Compatibility::   Binary Compatibility
  * Gcov::            @command{gcov}---a test coverage program.
  * Gcov-tool::       @command{gcov-tool}---an offline gcda profile processing program.
+ * Gcov-dump::       @command{gcov-dump}---an offline gcda and gcno profile dump tool.
  * Trouble::         If you have trouble using GCC.
  * Bugs::            How, why and where to report bugs.
  * Service::         How To Get Help with GCC
*************** Introduction, gccint, GNU Compiler Colle
*** 167,172 ****
--- 169,175 ----
  @include compat.texi
  @include gcov.texi
  @include gcov-tool.texi
+ @include gcov-dump.texi
  @include trouble.texi
  @include bugreport.texi
  @include service.texi
diff -Nrcpad gcc-5.4.0/gcc/doc/gccinstall.info gcc-5.5.0/gcc/doc/gccinstall.info
*** gcc-5.4.0/gcc/doc/gccinstall.info	Fri Jun  3 10:32:21 2016
--- gcc-5.5.0/gcc/doc/gccinstall.info	Tue Oct 10 09:40:20 2017
***************
*** 1,5 ****
! This is doc/gccinstall.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/doc/install.texi.
  
  Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
--- 1,5 ----
! This is gccinstall.info, produced by makeinfo version 6.1 from
! install.texi.
  
  Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
*************** is included in the section entitled "GNU
*** 17,24 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
  
     Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
--- 17,28 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
! INFO-DIR-SECTION Software development
! START-INFO-DIR-ENTRY
! * gccinstall: (gccinstall).    Installing the GNU Compiler Collection.
! END-INFO-DIR-ENTRY
  
     Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
*************** is included in the section entitled "GNU
*** 36,48 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
! 
! INFO-DIR-SECTION Software development
! START-INFO-DIR-ENTRY
! * gccinstall: (gccinstall).    Installing the GNU Compiler Collection.
! END-INFO-DIR-ENTRY
  
  
  File: gccinstall.info,  Node: Top,  Up: (dir)
--- 40,47 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
  
  
  File: gccinstall.info,  Node: Top,  Up: (dir)
*************** File: gccinstall.info,  Node: Installing
*** 67,79 ****
  1 Installing GCC
  ****************
  
!    The latest version of this document is always available at
  http://gcc.gnu.org/install/.  It refers to the current development
  sources, instructions for specific released versions are included with
  the sources.
  
!    This document describes the generic installation procedure for GCC
! as well as detailing some target specific installation instructions.
  
     GCC includes several components that previously were separate
  distributions with their own installation instructions.  This document
--- 66,78 ----
  1 Installing GCC
  ****************
  
! The latest version of this document is always available at
  http://gcc.gnu.org/install/.  It refers to the current development
  sources, instructions for specific released versions are included with
  the sources.
  
!    This document describes the generic installation procedure for GCC as
! well as detailing some target specific installation instructions.
  
     GCC includes several components that previously were separate
  distributions with their own installation instructions.  This document
*************** supersedes all package-specific installa
*** 83,91 ****
  host/target specific installation notes: Specific.  We recommend you
  browse the entire generic installation instructions before you proceed.
  
!    Lists of successful builds for released versions of GCC are
! available at `http://gcc.gnu.org/buildstat.html'.  These lists are
! updated as new information becomes available.
  
     The installation procedure itself is broken into five steps.
  
--- 82,90 ----
  host/target specific installation notes: Specific.  We recommend you
  browse the entire generic installation instructions before you proceed.
  
!    Lists of successful builds for released versions of GCC are available
! at <http://gcc.gnu.org/buildstat.html>.  These lists are updated as new
! information becomes available.
  
     The installation procedure itself is broken into five steps.
  
*************** updated as new information becomes avail
*** 98,109 ****
  * Testing:: (optional)
  * Final install::
  
!    Please note that GCC does not support `make uninstall' and probably
  won't do so in the near future as this would open a can of worms.
! Instead, we suggest that you install GCC into a directory of its own
! and simply remove that directory when you do not need that specific
! version of GCC any longer, and, if shared libraries are installed there
! as well, no more binaries exist that use them.
  
  
  File: gccinstall.info,  Node: Prerequisites,  Next: Downloading the source,  Up: Installing GCC
--- 97,108 ----
  * Testing:: (optional)
  * Final install::
  
!    Please note that GCC does not support 'make uninstall' and probably
  won't do so in the near future as this would open a can of worms.
! Instead, we suggest that you install GCC into a directory of its own and
! simply remove that directory when you do not need that specific version
! of GCC any longer, and, if shared libraries are installed there as well,
! no more binaries exist that use them.
  
  
  File: gccinstall.info,  Node: Prerequisites,  Next: Downloading the source,  Up: Installing GCC
*************** File: gccinstall.info,  Node: Prerequisi
*** 111,118 ****
  2 Prerequisites
  ***************
  
!    GCC requires that various tools and packages be available for use in
! the build procedure.  Modifying GCC sources requires additional tools
  described below.
  
  Tools/packages necessary for building GCC
--- 110,117 ----
  2 Prerequisites
  ***************
  
! GCC requires that various tools and packages be available for use in the
! build procedure.  Modifying GCC sources requires additional tools
  described below.
  
  Tools/packages necessary for building GCC
*************** ISO C++98 compiler
*** 125,369 ****
       C compiler.
  
       To build all languages in a cross-compiler or other configuration
!      where 3-stage bootstrap is not performed, you need to start with
!      an existing GCC binary (version 3.4 or later) because source code
!      for language frontends other than C might use GCC extensions.
  
       Note that to bootstrap GCC with versions of GCC earlier than 3.4,
!      you may need to use `--disable-stage1-checking', though
       bootstrapping the compiler with such earlier compilers is strongly
       discouraged.
  
  C standard library and headers
       In order to build GCC, the C standard library and headers must be
       present for all target variants for which target libraries will be
       built (and not only the variant of the host C++ compiler).
  
!      This affects the popular `x86_64-unknown-linux-gnu' platform (among
!      other multilib targets), for which 64-bit (`x86_64') and 32-bit
!      (`i386') libc headers are usually packaged separately. If you do a
!      build of a native compiler on `x86_64-unknown-linux-gnu', make
!      sure you either have the 32-bit libc developer package properly
!      installed (the exact name of the package depends on your distro)
!      or you must build GCC as a 64-bit only compiler by configuring
!      with the option `--disable-multilib'.  Otherwise, you may
!      encounter an error such as `fatal error: gnu/stubs-32.h: No such
!      file'
  
  GNAT
       In order to build the Ada compiler (GNAT) you must already have
       GNAT installed because portions of the Ada frontend are written in
       Ada (with GNAT extensions.)  Refer to the Ada installation
       instructions for more specific information.
  
  A "working" POSIX compatible shell, or GNU bash
!      Necessary when running `configure' because some `/bin/sh' shells
       have bugs and may crash when configuring the target libraries.  In
!      other cases, `/bin/sh' or `ksh' have disastrous corner-case
!      performance problems.  This can cause target `configure' runs to
       literally take days to complete in some cases.
  
!      So on some platforms `/bin/ksh' is sufficient, on others it isn't.
!      See the host/target specific instructions for your platform, or
!      use `bash' to be sure.  Then set `CONFIG_SHELL' in your
!      environment to your "good" shell prior to running
!      `configure'/`make'.
  
!      `zsh' is not a fully compliant POSIX shell and will not work when
       configuring GCC.
  
  A POSIX or SVR4 awk
       Necessary for creating some of the generated source files for GCC.
       If in doubt, use a recent GNU awk version, as some of the older
       ones are broken.  GNU awk version 3.1.5 is known to work.
  
  GNU binutils
       Necessary in some circumstances, optional in others.  See the
       host/target specific instructions for your platform for the exact
       requirements.
  
  gzip version 1.2.4 (or later) or
  bzip2 version 1.0.2 (or later)
!      Necessary to uncompress GCC `tar' files when source code is
       obtained via FTP mirror sites.
  
  GNU make version 3.80 (or later)
       You must have GNU make installed to build GCC.
  
  GNU tar version 1.14 (or later)
       Necessary (only on some platforms) to untar the source code.  Many
!      systems' `tar' programs will also work, only try GNU `tar' if you
       have problems.
  
  Perl version 5.6.1 (or later)
-      Necessary when targeting Darwin, building `libstdc++', and not
-      using `--disable-symvers'.  Necessary when targeting Solaris 2
-      with Sun `ld' and not using `--disable-symvers'.  The bundled
-      `perl' in Solaris 8 and up works.
  
!      Necessary when regenerating `Makefile' dependencies in libiberty.
!      Necessary when regenerating `libiberty/functions.texi'.  Necessary
       when generating manpages from Texinfo manuals.  Used by various
       scripts to generate some files included in SVN (mainly
       Unicode-related and rarely changing) from source tables.
  
! `jar', or InfoZIP (`zip' and `unzip')
!      Necessary to build libgcj, the GCJ runtime.
  
  
     Several support libraries are necessary to build GCC, some are
  required, others optional.  While any sufficiently new version of
  required tools usually work, library requirements are generally
  stricter.  Newer versions may work in some cases, but it's safer to use
! the exact versions documented.  We appreciate bug reports about
! problems with newer versions, though.  If your OS vendor provides
! packages for the support libraries then using those packages may be the
! simplest way to install the libraries.
  
  GNU Multiple Precision Library (GMP) version 4.3.2 (or later)
       Necessary to build GCC.  If a GMP source distribution is found in a
!      subdirectory of your GCC sources named `gmp', it will be built
!      together with GCC.  Alternatively, if GMP is already installed but
       it is not in your library search path, you will have to configure
!      with the `--with-gmp' configure option.  See also `--with-gmp-lib'
!      and `--with-gmp-include'.
  
  MPFR Library version 2.4.2 (or later)
       Necessary to build GCC.  It can be downloaded from
!      `http://www.mpfr.org/'.  If an MPFR source distribution is found
!      in a subdirectory of your GCC sources named `mpfr', it will be
!      built together with GCC.  Alternatively, if MPFR is already
!      installed but it is not in your default library search path, the
!      `--with-mpfr' configure option should be used.  See also
!      `--with-mpfr-lib' and `--with-mpfr-include'.
  
  MPC Library version 0.8.1 (or later)
       Necessary to build GCC.  It can be downloaded from
!      `http://www.multiprecision.org/'.  If an MPC source distribution
!      is found in a subdirectory of your GCC sources named `mpc', it
!      will be built together with GCC.  Alternatively, if MPC is already
!      installed but it is not in your default library search path, the
!      `--with-mpc' configure option should be used.  See also
!      `--with-mpc-lib' and `--with-mpc-include'.
  
  ISL Library version 0.14 (or 0.12.2)
-      Necessary to build GCC with the Graphite loop optimizations.  It
-      can be downloaded from `ftp://gcc.gnu.org/pub/gcc/infrastructure/'
-      as `isl-0.12.2.tar.bz2'.  If an ISL source distribution is found
-      in a subdirectory of your GCC sources named `isl', it will be
-      built together with GCC.  Alternatively, the `--with-isl' configure
-      option should be used if ISL is not installed in your default
-      library search path.
  
  
  Tools/packages necessary for modifying GCC
  ==========================================
  
  autoconf version 2.64
  GNU m4 version 1.4.6 (or later)
!      Necessary when modifying `configure.ac', `aclocal.m4', etc.  to
!      regenerate `configure' and `config.in' files.
  
  automake version 1.11.1
!      Necessary when modifying a `Makefile.am' file to regenerate its
!      associated `Makefile.in'.
  
       Much of GCC does not use automake, so directly edit the
!      `Makefile.in' file.  Specifically this applies to the `gcc',
!      `intl', `libcpp', `libiberty', `libobjc' directories as well as
!      any of their subdirectories.
  
       For directories that use automake, GCC requires the latest release
!      in the 1.11 series, which is currently 1.11.1.  When regenerating
!      a directory to a newer version, please update all the directories
       using an older 1.11 to the latest released version.
  
  gettext version 0.14.5 (or later)
!      Needed to regenerate `gcc.pot'.
  
  gperf version 2.7.2 (or later)
!      Necessary when modifying `gperf' input files, e.g.
!      `gcc/cp/cfns.gperf' to regenerate its associated header file, e.g.
!      `gcc/cp/cfns.h'.
  
  DejaGnu 1.4.4
  Expect
  Tcl
       Necessary to run the GCC testsuite; see the section on testing for
       details.  Tcl 8.6 has a known regression in RE pattern handling
       that make parts of the testsuite fail.  See
!      `http://core.tcl.tk/tcl/tktview/267b7e2334ee2e9de34c4b00d6e72e2f1997085f'
       for more information.  This bug has been fixed in 8.6.1.
  
  autogen version 5.5.4 (or later) and
  guile version 1.4.1 (or later)
-      Necessary to regenerate `fixinc/fixincl.x' from
-      `fixinc/inclhack.def' and `fixinc/*.tpl'.
  
!      Necessary to run `make check' for `fixinc'.
  
!      Necessary to regenerate the top level `Makefile.in' file from
!      `Makefile.tpl' and `Makefile.def'.
  
  Flex version 2.5.4 (or later)
!      Necessary when modifying `*.l' files.
  
       Necessary to build GCC during development because the generated
       output files are not included in the SVN repository.  They are
       included in releases.
  
  Texinfo version 4.7 (or later)
!      Necessary for running `makeinfo' when modifying `*.texi' files to
       test your changes.
  
!      Necessary for running `make dvi' or `make pdf' to create printable
       documentation in DVI or PDF format.  Texinfo version 4.8 or later
!      is required for `make pdf'.
  
       Necessary to build GCC documentation during development because the
       generated output files are not included in the SVN repository.
       They are included in releases.
  
  TeX (any working version)
!      Necessary for running `texi2dvi' and `texi2pdf', which are used
!      when running `make dvi' or `make pdf' to create DVI or PDF files,
       respectively.
  
  Sphinx version 1.0 (or later)
!      Necessary to regenerate `jit/docs/_build/texinfo' from the `.rst'
!      files in the directories below `jit/docs'.
  
  SVN (any version)
  SSH (any version)
       Necessary to access the SVN repository.  Public releases and weekly
       snapshots of the development sources are also available via FTP.
  
  GNU diffutils version 2.7 (or later)
       Useful when submitting patches for the GCC source code.
  
  patch version 2.5.4 (or later)
!      Necessary when applying patches, created with `diff', to one's own
       sources.
  
  ecj1
  gjavah
!      If you wish to modify `.java' files in libjava, you will need to
!      configure with `--enable-java-maintainer-mode', and you will need
!      to have executables named `ecj1' and `gjavah' in your path.  The
!      `ecj1' executable should run the Eclipse Java compiler via the
       GCC-specific entry point.  You can download a suitable jar from
!      `ftp://sourceware.org/pub/java/', or by running the script
!      `contrib/download_ecj'.
  
  antlr.jar version 2.7.1 (or later)
  antlr binary
-      If you wish to build the `gjdoc' binary in libjava, you will need
-      to have an `antlr.jar' library available. The library is searched
-      for in system locations but can be specified with
-      `--with-antlr-jar=' instead.  When configuring with
-      `--enable-java-maintainer-mode', you will need to have one of the
-      executables named `cantlr', `runantlr' or `antlr' in your path.
  
  
  
  File: gccinstall.info,  Node: Downloading the source,  Next: Configuration,  Prev: Prerequisites,  Up: Installing GCC
--- 124,392 ----
       C compiler.
  
       To build all languages in a cross-compiler or other configuration
!      where 3-stage bootstrap is not performed, you need to start with an
!      existing GCC binary (version 3.4 or later) because source code for
!      language frontends other than C might use GCC extensions.
  
       Note that to bootstrap GCC with versions of GCC earlier than 3.4,
!      you may need to use '--disable-stage1-checking', though
       bootstrapping the compiler with such earlier compilers is strongly
       discouraged.
  
  C standard library and headers
+ 
       In order to build GCC, the C standard library and headers must be
       present for all target variants for which target libraries will be
       built (and not only the variant of the host C++ compiler).
  
!      This affects the popular 'x86_64-unknown-linux-gnu' platform (among
!      other multilib targets), for which 64-bit ('x86_64') and 32-bit
!      ('i386') libc headers are usually packaged separately.  If you do a
!      build of a native compiler on 'x86_64-unknown-linux-gnu', make sure
!      you either have the 32-bit libc developer package properly
!      installed (the exact name of the package depends on your distro) or
!      you must build GCC as a 64-bit only compiler by configuring with
!      the option '--disable-multilib'.  Otherwise, you may encounter an
!      error such as 'fatal error: gnu/stubs-32.h: No such file'
  
  GNAT
+ 
       In order to build the Ada compiler (GNAT) you must already have
       GNAT installed because portions of the Ada frontend are written in
       Ada (with GNAT extensions.)  Refer to the Ada installation
       instructions for more specific information.
  
  A "working" POSIX compatible shell, or GNU bash
! 
!      Necessary when running 'configure' because some '/bin/sh' shells
       have bugs and may crash when configuring the target libraries.  In
!      other cases, '/bin/sh' or 'ksh' have disastrous corner-case
!      performance problems.  This can cause target 'configure' runs to
       literally take days to complete in some cases.
  
!      So on some platforms '/bin/ksh' is sufficient, on others it isn't.
!      See the host/target specific instructions for your platform, or use
!      'bash' to be sure.  Then set 'CONFIG_SHELL' in your environment to
!      your "good" shell prior to running 'configure'/'make'.
  
!      'zsh' is not a fully compliant POSIX shell and will not work when
       configuring GCC.
  
  A POSIX or SVR4 awk
+ 
       Necessary for creating some of the generated source files for GCC.
       If in doubt, use a recent GNU awk version, as some of the older
       ones are broken.  GNU awk version 3.1.5 is known to work.
  
  GNU binutils
+ 
       Necessary in some circumstances, optional in others.  See the
       host/target specific instructions for your platform for the exact
       requirements.
  
  gzip version 1.2.4 (or later) or
  bzip2 version 1.0.2 (or later)
! 
!      Necessary to uncompress GCC 'tar' files when source code is
       obtained via FTP mirror sites.
  
  GNU make version 3.80 (or later)
+ 
       You must have GNU make installed to build GCC.
  
  GNU tar version 1.14 (or later)
+ 
       Necessary (only on some platforms) to untar the source code.  Many
!      systems' 'tar' programs will also work, only try GNU 'tar' if you
       have problems.
  
  Perl version 5.6.1 (or later)
  
!      Necessary when targeting Darwin, building 'libstdc++', and not
!      using '--disable-symvers'.  Necessary when targeting Solaris 2 with
!      Sun 'ld' and not using '--disable-symvers'.  The bundled 'perl' in
!      Solaris 8 and up works.
! 
!      Necessary when regenerating 'Makefile' dependencies in libiberty.
!      Necessary when regenerating 'libiberty/functions.texi'.  Necessary
       when generating manpages from Texinfo manuals.  Used by various
       scripts to generate some files included in SVN (mainly
       Unicode-related and rarely changing) from source tables.
  
! 'jar', or InfoZIP ('zip' and 'unzip')
  
+      Necessary to build libgcj, the GCJ runtime.
  
     Several support libraries are necessary to build GCC, some are
  required, others optional.  While any sufficiently new version of
  required tools usually work, library requirements are generally
  stricter.  Newer versions may work in some cases, but it's safer to use
! the exact versions documented.  We appreciate bug reports about problems
! with newer versions, though.  If your OS vendor provides packages for
! the support libraries then using those packages may be the simplest way
! to install the libraries.
  
  GNU Multiple Precision Library (GMP) version 4.3.2 (or later)
+ 
       Necessary to build GCC.  If a GMP source distribution is found in a
!      subdirectory of your GCC sources named 'gmp', it will be built
!      together with GCC. Alternatively, if GMP is already installed but
       it is not in your library search path, you will have to configure
!      with the '--with-gmp' configure option.  See also '--with-gmp-lib'
!      and '--with-gmp-include'.
  
  MPFR Library version 2.4.2 (or later)
+ 
       Necessary to build GCC.  It can be downloaded from
!      <http://www.mpfr.org/>.  If an MPFR source distribution is found in
!      a subdirectory of your GCC sources named 'mpfr', it will be built
!      together with GCC. Alternatively, if MPFR is already installed but
!      it is not in your default library search path, the '--with-mpfr'
!      configure option should be used.  See also '--with-mpfr-lib' and
!      '--with-mpfr-include'.
  
  MPC Library version 0.8.1 (or later)
+ 
       Necessary to build GCC.  It can be downloaded from
!      <http://www.multiprecision.org/>.  If an MPC source distribution is
!      found in a subdirectory of your GCC sources named 'mpc', it will be
!      built together with GCC. Alternatively, if MPC is already installed
!      but it is not in your default library search path, the '--with-mpc'
!      configure option should be used.  See also '--with-mpc-lib' and
!      '--with-mpc-include'.
  
  ISL Library version 0.14 (or 0.12.2)
  
+      Necessary to build GCC with the Graphite loop optimizations.  It
+      can be downloaded from <ftp://gcc.gnu.org/pub/gcc/infrastructure/>
+      as 'isl-0.12.2.tar.bz2'.  If an ISL source distribution is found in
+      a subdirectory of your GCC sources named 'isl', it will be built
+      together with GCC. Alternatively, the '--with-isl' configure option
+      should be used if ISL is not installed in your default library
+      search path.
  
  Tools/packages necessary for modifying GCC
  ==========================================
  
  autoconf version 2.64
  GNU m4 version 1.4.6 (or later)
! 
!      Necessary when modifying 'configure.ac', 'aclocal.m4', etc. to
!      regenerate 'configure' and 'config.in' files.
  
  automake version 1.11.1
! 
!      Necessary when modifying a 'Makefile.am' file to regenerate its
!      associated 'Makefile.in'.
  
       Much of GCC does not use automake, so directly edit the
!      'Makefile.in' file.  Specifically this applies to the 'gcc',
!      'intl', 'libcpp', 'libiberty', 'libobjc' directories as well as any
!      of their subdirectories.
  
       For directories that use automake, GCC requires the latest release
!      in the 1.11 series, which is currently 1.11.1.  When regenerating a
!      directory to a newer version, please update all the directories
       using an older 1.11 to the latest released version.
  
  gettext version 0.14.5 (or later)
! 
!      Needed to regenerate 'gcc.pot'.
  
  gperf version 2.7.2 (or later)
! 
!      Necessary when modifying 'gperf' input files, e.g.
!      'gcc/cp/cfns.gperf' to regenerate its associated header file, e.g.
!      'gcc/cp/cfns.h'.
  
  DejaGnu 1.4.4
  Expect
  Tcl
+ 
       Necessary to run the GCC testsuite; see the section on testing for
       details.  Tcl 8.6 has a known regression in RE pattern handling
       that make parts of the testsuite fail.  See
!      <http://core.tcl.tk/tcl/tktview/267b7e2334ee2e9de34c4b00d6e72e2f1997085f>
       for more information.  This bug has been fixed in 8.6.1.
  
  autogen version 5.5.4 (or later) and
  guile version 1.4.1 (or later)
  
!      Necessary to regenerate 'fixinc/fixincl.x' from
!      'fixinc/inclhack.def' and 'fixinc/*.tpl'.
  
!      Necessary to run 'make check' for 'fixinc'.
! 
!      Necessary to regenerate the top level 'Makefile.in' file from
!      'Makefile.tpl' and 'Makefile.def'.
  
  Flex version 2.5.4 (or later)
! 
!      Necessary when modifying '*.l' files.
  
       Necessary to build GCC during development because the generated
       output files are not included in the SVN repository.  They are
       included in releases.
  
  Texinfo version 4.7 (or later)
! 
!      Necessary for running 'makeinfo' when modifying '*.texi' files to
       test your changes.
  
!      Necessary for running 'make dvi' or 'make pdf' to create printable
       documentation in DVI or PDF format.  Texinfo version 4.8 or later
!      is required for 'make pdf'.
  
       Necessary to build GCC documentation during development because the
       generated output files are not included in the SVN repository.
       They are included in releases.
  
  TeX (any working version)
! 
!      Necessary for running 'texi2dvi' and 'texi2pdf', which are used
!      when running 'make dvi' or 'make pdf' to create DVI or PDF files,
       respectively.
  
  Sphinx version 1.0 (or later)
! 
!      Necessary to regenerate 'jit/docs/_build/texinfo' from the '.rst'
!      files in the directories below 'jit/docs'.
  
  SVN (any version)
  SSH (any version)
+ 
       Necessary to access the SVN repository.  Public releases and weekly
       snapshots of the development sources are also available via FTP.
  
  GNU diffutils version 2.7 (or later)
+ 
       Useful when submitting patches for the GCC source code.
  
  patch version 2.5.4 (or later)
! 
!      Necessary when applying patches, created with 'diff', to one's own
       sources.
  
  ecj1
  gjavah
! 
!      If you wish to modify '.java' files in libjava, you will need to
!      configure with '--enable-java-maintainer-mode', and you will need
!      to have executables named 'ecj1' and 'gjavah' in your path.  The
!      'ecj1' executable should run the Eclipse Java compiler via the
       GCC-specific entry point.  You can download a suitable jar from
!      <ftp://sourceware.org/pub/java/>, or by running the script
!      'contrib/download_ecj'.
  
  antlr.jar version 2.7.1 (or later)
  antlr binary
  
+      If you wish to build the 'gjdoc' binary in libjava, you will need
+      to have an 'antlr.jar' library available.  The library is searched
+      for in system locations but can be specified with
+      '--with-antlr-jar=' instead.  When configuring with
+      '--enable-java-maintainer-mode', you will need to have one of the
+      executables named 'cantlr', 'runantlr' or 'antlr' in your path.
  
  
  File: gccinstall.info,  Node: Downloading the source,  Next: Configuration,  Prev: Prerequisites,  Up: Installing GCC
*************** File: gccinstall.info,  Node: Downloadin
*** 371,403 ****
  3 Downloading GCC
  *****************
  
!    GCC is distributed via SVN and FTP tarballs compressed with `gzip' or
! `bzip2'.
  
     Please refer to the releases web page for information on how to
  obtain GCC.
  
     The source distribution includes the C, C++, Objective-C, Fortran,
  Java, and Ada (in the case of GCC 3.1 and later) compilers, as well as
! runtime libraries for C++, Objective-C, Fortran, and Java.  For
! previous versions these were downloadable as separate components such
! as the core GCC distribution, which included the C language front end
! and shared components, and language-specific distributions including the
! language front end and the language runtime (where appropriate).
  
     If you also intend to build binutils (either to upgrade an existing
! installation or for use in place of the corresponding tools of your
! OS), unpack the binutils distribution either in the same directory or a
  separate one.  In the latter case, add symbolic links to any components
! of the binutils you intend to build alongside the compiler (`bfd',
! `binutils', `gas', `gprof', `ld', `opcodes', ...) to the directory
  containing the GCC sources.
  
     Likewise the GMP, MPFR and MPC libraries can be automatically built
! together with GCC.  Unpack the GMP, MPFR and/or MPC source
! distributions in the directory containing the GCC sources and rename
! their directories to `gmp', `mpfr' and `mpc', respectively (or use
! symbolic links with the same name).
  
  
  File: gccinstall.info,  Node: Configuration,  Next: Building,  Prev: Downloading the source,  Up: Installing GCC
--- 394,426 ----
  3 Downloading GCC
  *****************
  
! GCC is distributed via SVN and FTP tarballs compressed with 'gzip' or
! 'bzip2'.
  
     Please refer to the releases web page for information on how to
  obtain GCC.
  
     The source distribution includes the C, C++, Objective-C, Fortran,
  Java, and Ada (in the case of GCC 3.1 and later) compilers, as well as
! runtime libraries for C++, Objective-C, Fortran, and Java.  For previous
! versions these were downloadable as separate components such as the core
! GCC distribution, which included the C language front end and shared
! components, and language-specific distributions including the language
! front end and the language runtime (where appropriate).
  
     If you also intend to build binutils (either to upgrade an existing
! installation or for use in place of the corresponding tools of your OS),
! unpack the binutils distribution either in the same directory or a
  separate one.  In the latter case, add symbolic links to any components
! of the binutils you intend to build alongside the compiler ('bfd',
! 'binutils', 'gas', 'gprof', 'ld', 'opcodes', ...) to the directory
  containing the GCC sources.
  
     Likewise the GMP, MPFR and MPC libraries can be automatically built
! together with GCC. Unpack the GMP, MPFR and/or MPC source distributions
! in the directory containing the GCC sources and rename their directories
! to 'gmp', 'mpfr' and 'mpc', respectively (or use symbolic links with the
! same name).
  
  
  File: gccinstall.info,  Node: Configuration,  Next: Building,  Prev: Downloading the source,  Up: Installing GCC
*************** File: gccinstall.info,  Node: Configurat
*** 405,426 ****
  4 Installing GCC: Configuration
  *******************************
  
!    Like most GNU software, GCC must be configured before it can be
! built.  This document describes the recommended configuration procedure
! for both native and cross targets.
  
     We use SRCDIR to refer to the toplevel source directory for GCC; we
  use OBJDIR to refer to the toplevel build/object directory.
  
     If you obtained the sources via SVN, SRCDIR must refer to the top
! `gcc' directory, the one where the `MAINTAINERS' file can be found, and
! not its `gcc' subdirectory, otherwise the build will fail.
  
     If either SRCDIR or OBJDIR is located on an automounted NFS file
! system, the shell's built-in `pwd' command will return temporary
! pathnames.  Using these can lead to various sorts of build problems.
! To avoid this issue, set the `PWDCMD' environment variable to an
! automounter-aware `pwd' command, e.g., `pawd' or `amq -w', during the
  configuration and build phases.
  
     First, we *highly* recommend that GCC be built into a separate
--- 428,449 ----
  4 Installing GCC: Configuration
  *******************************
  
! Like most GNU software, GCC must be configured before it can be built.
! This document describes the recommended configuration procedure for both
! native and cross targets.
  
     We use SRCDIR to refer to the toplevel source directory for GCC; we
  use OBJDIR to refer to the toplevel build/object directory.
  
     If you obtained the sources via SVN, SRCDIR must refer to the top
! 'gcc' directory, the one where the 'MAINTAINERS' file can be found, and
! not its 'gcc' subdirectory, otherwise the build will fail.
  
     If either SRCDIR or OBJDIR is located on an automounted NFS file
! system, the shell's built-in 'pwd' command will return temporary
! pathnames.  Using these can lead to various sorts of build problems.  To
! avoid this issue, set the 'PWDCMD' environment variable to an
! automounter-aware 'pwd' command, e.g., 'pawd' or 'amq -w', during the
  configuration and build phases.
  
     First, we *highly* recommend that GCC be built into a separate
*************** OBJDIR should still work, but doesn't ge
*** 430,445 ****
  where OBJDIR is a subdirectory of SRCDIR is unsupported.
  
     If you have previously built GCC in the same directory for a
! different target machine, do `make distclean' to delete all files that
! might be invalid.  One of the files this deletes is `Makefile'; if
! `make distclean' complains that `Makefile' does not exist or issues a
! message like "don't know how to make distclean" it probably means that
! the directory is already suitably clean.  However, with the recommended
  method of building in a separate OBJDIR, you should simply use a
  different OBJDIR for each target.
  
!    Second, when configuring a native system, either `cc' or `gcc' must
! be in your path or you must set `CC' in your environment before running
  configure.  Otherwise the configuration scripts may fail.
  
     To configure GCC:
--- 453,468 ----
  where OBJDIR is a subdirectory of SRCDIR is unsupported.
  
     If you have previously built GCC in the same directory for a
! different target machine, do 'make distclean' to delete all files that
! might be invalid.  One of the files this deletes is 'Makefile'; if 'make
! distclean' complains that 'Makefile' does not exist or issues a message
! like "don't know how to make distclean" it probably means that the
! directory is already suitably clean.  However, with the recommended
  method of building in a separate OBJDIR, you should simply use a
  different OBJDIR for each target.
  
!    Second, when configuring a native system, either 'cc' or 'gcc' must
! be in your path or you must set 'CC' in your environment before running
  configure.  Otherwise the configuration scripts may fail.
  
     To configure GCC:
*************** Distributor options
*** 452,469 ****
  ===================
  
  If you will be distributing binary versions of GCC, with modifications
! to the source code, you should use the options described in this
! section to make clear that your version contains modifications.
  
! `--with-pkgversion=VERSION'
       Specify a string that identifies your package.  You may wish to
       include a build number or build date.  This version string will be
!      included in the output of `gcc --version'.  This suffix does not
!      replace the default version string, only the `GCC' part.
  
!      The default value is `GCC'.
  
! `--with-bugurl=URL'
       Specify the URL that users should visit if they wish to report a
       bug.  You are of course welcome to forward bugs reported to you to
       the FSF, if you determine that they are not bugs in your
--- 475,492 ----
  ===================
  
  If you will be distributing binary versions of GCC, with modifications
! to the source code, you should use the options described in this section
! to make clear that your version contains modifications.
  
! '--with-pkgversion=VERSION'
       Specify a string that identifies your package.  You may wish to
       include a build number or build date.  This version string will be
!      included in the output of 'gcc --version'.  This suffix does not
!      replace the default version string, only the 'GCC' part.
  
!      The default value is 'GCC'.
  
! '--with-bugurl=URL'
       Specify the URL that users should visit if they wish to report a
       bug.  You are of course welcome to forward bugs reported to you to
       the FSF, if you determine that they are not bugs in your
*************** section to make clear that your version
*** 471,477 ****
  
       The default value refers to the FSF's GCC bug tracker.
  
- 
  Target specification
  ====================
  
--- 494,499 ----
*************** Target specification
*** 480,616 ****
       do not provide a configure target when configuring a native
       compiler.
  
!    * TARGET must be specified as `--target=TARGET' when configuring a
       cross compiler; examples of valid targets would be m68k-elf,
       sh-elf, etc.
  
!    * Specifying just TARGET instead of `--target=TARGET' implies that
       the host defaults to TARGET.
  
  Options specification
  =====================
  
  Use OPTIONS to override several configure time options for GCC.  A list
! of supported OPTIONS follows; `configure --help' may list other
! options, but those not listed below may not work and should not
! normally be used.
  
!    Note that each `--enable' option has a corresponding `--disable'
! option and that each `--with' option has a corresponding `--without'
  option.
  
! `--prefix=DIRNAME'
       Specify the toplevel installation directory.  This is the
       recommended way to install the tools into a directory other than
       the default.  The toplevel installation directory defaults to
!      `/usr/local'.
  
       We *highly* recommend against DIRNAME being the same or a
       subdirectory of OBJDIR or vice versa.  If specifying a directory
       beneath a user's home directory tree, some shells will not expand
!      DIRNAME correctly if it contains the `~' metacharacter; use
!      `$HOME' instead.
  
!      The following standard `autoconf' options are supported.  Normally
       you should not need to use these options.
!     `--exec-prefix=DIRNAME'
            Specify the toplevel installation directory for
!           architecture-dependent files.  The default is `PREFIX'.
  
!     `--bindir=DIRNAME'
            Specify the installation directory for the executables called
!           by users (such as `gcc' and `g++').  The default is
!           `EXEC-PREFIX/bin'.
  
!     `--libdir=DIRNAME'
            Specify the installation directory for object code libraries
            and internal data files of GCC.  The default is
!           `EXEC-PREFIX/lib'.
  
!     `--libexecdir=DIRNAME'
!           Specify the installation directory for internal executables
!           of GCC.  The default is `EXEC-PREFIX/libexec'.
  
!     `--with-slibdir=DIRNAME'
            Specify the installation directory for the shared libgcc
!           library.  The default is `LIBDIR'.
  
!     `--datarootdir=DIRNAME'
            Specify the root of the directory tree for read-only
            architecture-independent data files referenced by GCC.  The
!           default is `PREFIX/share'.
  
!     `--infodir=DIRNAME'
            Specify the installation directory for documentation in info
!           format.  The default is `DATAROOTDIR/info'.
  
!     `--datadir=DIRNAME'
            Specify the installation directory for some
            architecture-independent data files referenced by GCC.  The
!           default is `DATAROOTDIR'.
  
!     `--docdir=DIRNAME'
            Specify the installation directory for documentation files
!           (other than Info) for GCC.  The default is `DATAROOTDIR/doc'.
  
!     `--htmldir=DIRNAME'
            Specify the installation directory for HTML documentation
!           files.  The default is `DOCDIR'.
  
!     `--pdfdir=DIRNAME'
            Specify the installation directory for PDF documentation
!           files.  The default is `DOCDIR'.
  
!     `--mandir=DIRNAME'
            Specify the installation directory for manual pages.  The
!           default is `DATAROOTDIR/man'.  (Note that the manual pages
!           are only extracts from the full GCC manuals, which are
!           provided in Texinfo format.  The manpages are derived by an
!           automatic conversion process from parts of the full manual.)
  
!     `--with-gxx-include-dir=DIRNAME'
            Specify the installation directory for G++ header files.  The
            default depends on other configuration options, and differs
            between cross and native configurations.
  
!     `--with-specs=SPECS'
!           Specify additional command line driver SPECS.  This can be
            useful if you need to turn on a non-standard feature by
            default without modifying the compiler's source code, for
            instance
!           `--with-specs=%{!fcommon:%{!fno-common:-fno-common}}'.  *Note
            Specifying subprocesses and the switches to pass to them:
            (gcc)Spec Files,
  
! 
! `--program-prefix=PREFIX'
       GCC supports some transformations of the names of its programs when
       installing them.  This option prepends PREFIX to the names of
       programs to install in BINDIR (see above).  For example, specifying
!      `--program-prefix=foo-' would result in `gcc' being installed as
!      `/usr/local/bin/foo-gcc'.
  
! `--program-suffix=SUFFIX'
       Appends SUFFIX to the names of programs to install in BINDIR (see
!      above).  For example, specifying `--program-suffix=-3.1' would
!      result in `gcc' being installed as `/usr/local/bin/gcc-3.1'.
  
! `--program-transform-name=PATTERN'
!      Applies the `sed' script PATTERN to be applied to the names of
       programs to install in BINDIR (see above).  PATTERN has to consist
!      of one or more basic `sed' editing commands, separated by
!      semicolons.  For example, if you want the `gcc' program name to be
!      transformed to the installed program `/usr/local/bin/myowngcc' and
!      the `g++' program name to be transformed to
!      `/usr/local/bin/gspecial++' without changing other program names,
       you could use the pattern
!      `--program-transform-name='s/^gcc$/myowngcc/; s/^g++$/gspecial++/''
       to achieve this effect.
  
       All three options can be combined and used together, resulting in
       more complex conversion patterns.  As a basic rule, PREFIX (and
!      SUFFIX) are prepended (appended) before further transformations
!      can happen with a special transformation script PATTERN.
  
       As currently implemented, this option only takes effect for native
       builds; cross compiler binaries' names are not transformed even
--- 502,636 ----
       do not provide a configure target when configuring a native
       compiler.
  
!    * TARGET must be specified as '--target=TARGET' when configuring a
       cross compiler; examples of valid targets would be m68k-elf,
       sh-elf, etc.
  
!    * Specifying just TARGET instead of '--target=TARGET' implies that
       the host defaults to TARGET.
  
  Options specification
  =====================
  
  Use OPTIONS to override several configure time options for GCC.  A list
! of supported OPTIONS follows; 'configure --help' may list other options,
! but those not listed below may not work and should not normally be used.
  
!    Note that each '--enable' option has a corresponding '--disable'
! option and that each '--with' option has a corresponding '--without'
  option.
  
! '--prefix=DIRNAME'
       Specify the toplevel installation directory.  This is the
       recommended way to install the tools into a directory other than
       the default.  The toplevel installation directory defaults to
!      '/usr/local'.
  
       We *highly* recommend against DIRNAME being the same or a
       subdirectory of OBJDIR or vice versa.  If specifying a directory
       beneath a user's home directory tree, some shells will not expand
!      DIRNAME correctly if it contains the '~' metacharacter; use '$HOME'
!      instead.
  
!      The following standard 'autoconf' options are supported.  Normally
       you should not need to use these options.
!      '--exec-prefix=DIRNAME'
            Specify the toplevel installation directory for
!           architecture-dependent files.  The default is 'PREFIX'.
  
!      '--bindir=DIRNAME'
            Specify the installation directory for the executables called
!           by users (such as 'gcc' and 'g++').  The default is
!           'EXEC-PREFIX/bin'.
  
!      '--libdir=DIRNAME'
            Specify the installation directory for object code libraries
            and internal data files of GCC.  The default is
!           'EXEC-PREFIX/lib'.
  
!      '--libexecdir=DIRNAME'
!           Specify the installation directory for internal executables of
!           GCC.  The default is 'EXEC-PREFIX/libexec'.
  
!      '--with-slibdir=DIRNAME'
            Specify the installation directory for the shared libgcc
!           library.  The default is 'LIBDIR'.
  
!      '--datarootdir=DIRNAME'
            Specify the root of the directory tree for read-only
            architecture-independent data files referenced by GCC.  The
!           default is 'PREFIX/share'.
  
!      '--infodir=DIRNAME'
            Specify the installation directory for documentation in info
!           format.  The default is 'DATAROOTDIR/info'.
  
!      '--datadir=DIRNAME'
            Specify the installation directory for some
            architecture-independent data files referenced by GCC.  The
!           default is 'DATAROOTDIR'.
  
!      '--docdir=DIRNAME'
            Specify the installation directory for documentation files
!           (other than Info) for GCC.  The default is 'DATAROOTDIR/doc'.
  
!      '--htmldir=DIRNAME'
            Specify the installation directory for HTML documentation
!           files.  The default is 'DOCDIR'.
  
!      '--pdfdir=DIRNAME'
            Specify the installation directory for PDF documentation
!           files.  The default is 'DOCDIR'.
  
!      '--mandir=DIRNAME'
            Specify the installation directory for manual pages.  The
!           default is 'DATAROOTDIR/man'.  (Note that the manual pages are
!           only extracts from the full GCC manuals, which are provided in
!           Texinfo format.  The manpages are derived by an automatic
!           conversion process from parts of the full manual.)
  
!      '--with-gxx-include-dir=DIRNAME'
            Specify the installation directory for G++ header files.  The
            default depends on other configuration options, and differs
            between cross and native configurations.
  
!      '--with-specs=SPECS'
!           Specify additional command line driver SPECS. This can be
            useful if you need to turn on a non-standard feature by
            default without modifying the compiler's source code, for
            instance
!           '--with-specs=%{!fcommon:%{!fno-common:-fno-common}}'.  *Note
            Specifying subprocesses and the switches to pass to them:
            (gcc)Spec Files,
  
! '--program-prefix=PREFIX'
       GCC supports some transformations of the names of its programs when
       installing them.  This option prepends PREFIX to the names of
       programs to install in BINDIR (see above).  For example, specifying
!      '--program-prefix=foo-' would result in 'gcc' being installed as
!      '/usr/local/bin/foo-gcc'.
  
! '--program-suffix=SUFFIX'
       Appends SUFFIX to the names of programs to install in BINDIR (see
!      above).  For example, specifying '--program-suffix=-3.1' would
!      result in 'gcc' being installed as '/usr/local/bin/gcc-3.1'.
  
! '--program-transform-name=PATTERN'
!      Applies the 'sed' script PATTERN to be applied to the names of
       programs to install in BINDIR (see above).  PATTERN has to consist
!      of one or more basic 'sed' editing commands, separated by
!      semicolons.  For example, if you want the 'gcc' program name to be
!      transformed to the installed program '/usr/local/bin/myowngcc' and
!      the 'g++' program name to be transformed to
!      '/usr/local/bin/gspecial++' without changing other program names,
       you could use the pattern
!      '--program-transform-name='s/^gcc$/myowngcc/; s/^g++$/gspecial++/''
       to achieve this effect.
  
       All three options can be combined and used together, resulting in
       more complex conversion patterns.  As a basic rule, PREFIX (and
!      SUFFIX) are prepended (appended) before further transformations can
!      happen with a special transformation script PATTERN.
  
       As currently implemented, this option only takes effect for native
       builds; cross compiler binaries' names are not transformed even
*************** option.
*** 619,713 ****
  
       For native builds, some of the installed programs are also
       installed with the target alias in front of their name, as in
!      `i686-pc-linux-gnu-gcc'.  All of the above transformations happen
       before the target alias is prepended to the name--so, specifying
!      `--program-prefix=foo-' and `program-suffix=-3.1', the resulting
       binary would be installed as
!      `/usr/local/bin/i686-pc-linux-gnu-foo-gcc-3.1'.
  
       As a last shortcoming, none of the installed Ada programs are
       transformed yet, which will be fixed in some time.
  
! `--with-local-prefix=DIRNAME'
       Specify the installation directory for local include files.  The
!      default is `/usr/local'.  Specify this option if you want the
!      compiler to search directory `DIRNAME/include' for locally
!      installed header files _instead_ of `/usr/local/include'.
  
!      You should specify `--with-local-prefix' *only* if your site has a
!      different convention (not `/usr/local') for where to put
       site-specific files.
  
!      The default value for `--with-local-prefix' is `/usr/local'
!      regardless of the value of `--prefix'.  Specifying `--prefix' has
       no effect on which directory GCC searches for local header files.
       This may seem counterintuitive, but actually it is logical.
  
!      The purpose of `--prefix' is to specify where to _install GCC_.
!      The local header files in `/usr/local/include'--if you put any in
!      that directory--are not part of GCC.  They are part of other
       programs--perhaps many others.  (GCC installs its own header files
!      in another directory which is based on the `--prefix' value.)
  
       Both the local-prefix include directory and the GCC-prefix include
!      directory are part of GCC's "system include" directories.
!      Although these two directories are not fixed, they need to be
!      searched in the proper order for the correct processing of the
!      include_next directive.  The local-prefix include directory is
!      searched before the GCC-prefix include directory.  Another
!      characteristic of system include directories is that pedantic
!      warnings are turned off for headers in these directories.
  
!      Some autoconf macros add `-I DIRECTORY' options to the compiler
       command line, to ensure that directories containing installed
       packages' headers are searched.  When DIRECTORY is one of GCC's
       system include directories, GCC will ignore the option so that
       system directories continue to be processed in the correct order.
!      This may result in a search order different from what was
!      specified but the directory will still be searched.
  
       GCC automatically searches for ordinary libraries using
!      `GCC_EXEC_PREFIX'.  Thus, when the same installation prefix is
!      used for both GCC and packages, GCC will automatically search for
!      both headers and libraries.  This provides a configuration that is
!      easy to use.  GCC behaves in a manner similar to that when it is
!      installed as a system compiler in `/usr'.
  
       Sites that need to install multiple versions of GCC may not want to
       use the above simple configuration.  It is possible to use the
!      `--program-prefix', `--program-suffix' and
!      `--program-transform-name' options to install multiple versions
       into a single directory, but it may be simpler to use different
!      prefixes and the `--with-local-prefix' option to specify the
!      location of the site-specific files for each version.  It will
!      then be necessary for users to specify explicitly the location of
!      local site libraries (e.g., with `LIBRARY_PATH').
  
!      The same value can be used for both `--with-local-prefix' and
!      `--prefix' provided it is not `/usr'.  This can be used to avoid
!      the default search of `/usr/local/include'.
  
!      *Do not* specify `/usr' as the `--with-local-prefix'!  The
!      directory you use for `--with-local-prefix' *must not* contain any
       of the system's standard header files.  If it did contain them,
       certain programs would be miscompiled (including GNU Emacs, on
       certain targets), because this would override and nullify the
!      header file corrections made by the `fixincludes' script.
  
       Indications are that people who use this option use it based on
!      mistaken ideas of what it is for.  People use it as if it
!      specified where to install part of GCC.  Perhaps they make this
!      assumption because installing GCC creates the directory.
  
! `--with-native-system-header-dir=DIRNAME'
       Specifies that DIRNAME is the directory that contains native system
!      header files, rather than `/usr/include'.  This option is most
       useful if you are creating a compiler that should be isolated from
       the system as much as possible.  It is most commonly used with the
!      `--with-sysroot' option and will cause GCC to search DIRNAME
!      inside the system root specified by that option.
  
! `--enable-shared[=PACKAGE[,...]]'
       Build shared versions of libraries, if shared libraries are
       supported on the target platform.  Unlike GCC 2.95.x and earlier,
       shared libraries are enabled by default on all platforms that
--- 639,733 ----
  
       For native builds, some of the installed programs are also
       installed with the target alias in front of their name, as in
!      'i686-pc-linux-gnu-gcc'.  All of the above transformations happen
       before the target alias is prepended to the name--so, specifying
!      '--program-prefix=foo-' and 'program-suffix=-3.1', the resulting
       binary would be installed as
!      '/usr/local/bin/i686-pc-linux-gnu-foo-gcc-3.1'.
  
       As a last shortcoming, none of the installed Ada programs are
       transformed yet, which will be fixed in some time.
  
! '--with-local-prefix=DIRNAME'
       Specify the installation directory for local include files.  The
!      default is '/usr/local'.  Specify this option if you want the
!      compiler to search directory 'DIRNAME/include' for locally
!      installed header files _instead_ of '/usr/local/include'.
  
!      You should specify '--with-local-prefix' *only* if your site has a
!      different convention (not '/usr/local') for where to put
       site-specific files.
  
!      The default value for '--with-local-prefix' is '/usr/local'
!      regardless of the value of '--prefix'.  Specifying '--prefix' has
       no effect on which directory GCC searches for local header files.
       This may seem counterintuitive, but actually it is logical.
  
!      The purpose of '--prefix' is to specify where to _install GCC_. The
!      local header files in '/usr/local/include'--if you put any in that
!      directory--are not part of GCC.  They are part of other
       programs--perhaps many others.  (GCC installs its own header files
!      in another directory which is based on the '--prefix' value.)
  
       Both the local-prefix include directory and the GCC-prefix include
!      directory are part of GCC's "system include" directories.  Although
!      these two directories are not fixed, they need to be searched in
!      the proper order for the correct processing of the include_next
!      directive.  The local-prefix include directory is searched before
!      the GCC-prefix include directory.  Another characteristic of system
!      include directories is that pedantic warnings are turned off for
!      headers in these directories.
  
!      Some autoconf macros add '-I DIRECTORY' options to the compiler
       command line, to ensure that directories containing installed
       packages' headers are searched.  When DIRECTORY is one of GCC's
       system include directories, GCC will ignore the option so that
       system directories continue to be processed in the correct order.
!      This may result in a search order different from what was specified
!      but the directory will still be searched.
  
       GCC automatically searches for ordinary libraries using
!      'GCC_EXEC_PREFIX'.  Thus, when the same installation prefix is used
!      for both GCC and packages, GCC will automatically search for both
!      headers and libraries.  This provides a configuration that is easy
!      to use.  GCC behaves in a manner similar to that when it is
!      installed as a system compiler in '/usr'.
  
       Sites that need to install multiple versions of GCC may not want to
       use the above simple configuration.  It is possible to use the
!      '--program-prefix', '--program-suffix' and
!      '--program-transform-name' options to install multiple versions
       into a single directory, but it may be simpler to use different
!      prefixes and the '--with-local-prefix' option to specify the
!      location of the site-specific files for each version.  It will then
!      be necessary for users to specify explicitly the location of local
!      site libraries (e.g., with 'LIBRARY_PATH').
  
!      The same value can be used for both '--with-local-prefix' and
!      '--prefix' provided it is not '/usr'.  This can be used to avoid
!      the default search of '/usr/local/include'.
  
!      *Do not* specify '/usr' as the '--with-local-prefix'!  The
!      directory you use for '--with-local-prefix' *must not* contain any
       of the system's standard header files.  If it did contain them,
       certain programs would be miscompiled (including GNU Emacs, on
       certain targets), because this would override and nullify the
!      header file corrections made by the 'fixincludes' script.
  
       Indications are that people who use this option use it based on
!      mistaken ideas of what it is for.  People use it as if it specified
!      where to install part of GCC.  Perhaps they make this assumption
!      because installing GCC creates the directory.
  
! '--with-native-system-header-dir=DIRNAME'
       Specifies that DIRNAME is the directory that contains native system
!      header files, rather than '/usr/include'.  This option is most
       useful if you are creating a compiler that should be isolated from
       the system as much as possible.  It is most commonly used with the
!      '--with-sysroot' option and will cause GCC to search DIRNAME inside
!      the system root specified by that option.
  
! '--enable-shared[=PACKAGE[,...]]'
       Build shared versions of libraries, if shared libraries are
       supported on the target platform.  Unlike GCC 2.95.x and earlier,
       shared libraries are enabled by default on all platforms that
*************** option.
*** 715,733 ****
  
       If a list of packages is given as an argument, build shared
       libraries only for the listed packages.  For other packages, only
!      static libraries will be built.  Package names currently
!      recognized in the GCC tree are `libgcc' (also known as `gcc'),
!      `libstdc++' (not `libstdc++-v3'), `libffi', `zlib', `boehm-gc',
!      `ada', `libada', `libjava', `libgo', and `libobjc'.  Note
!      `libiberty' does not support shared libraries at all.
  
!      Use `--disable-shared' to build only static libraries.  Note that
!      `--disable-shared' does not accept a list of package names as
!      argument, only `--enable-shared' does.
  
!      Contrast with `--enable-host-shared', which affects _host_ code.
  
! `--enable-host-shared'
       Specify that the _host_ code should be built into
       position-independent machine code (with -fPIC), allowing it to be
       used within shared libraries, but yielding a slightly slower
--- 735,753 ----
  
       If a list of packages is given as an argument, build shared
       libraries only for the listed packages.  For other packages, only
!      static libraries will be built.  Package names currently recognized
!      in the GCC tree are 'libgcc' (also known as 'gcc'), 'libstdc++'
!      (not 'libstdc++-v3'), 'libffi', 'zlib', 'boehm-gc', 'ada',
!      'libada', 'libjava', 'libgo', and 'libobjc'.  Note 'libiberty' does
!      not support shared libraries at all.
  
!      Use '--disable-shared' to build only static libraries.  Note that
!      '--disable-shared' does not accept a list of package names as
!      argument, only '--enable-shared' does.
  
!      Contrast with '--enable-host-shared', which affects _host_ code.
  
! '--enable-host-shared'
       Specify that the _host_ code should be built into
       position-independent machine code (with -fPIC), allowing it to be
       used within shared libraries, but yielding a slightly slower
*************** option.
*** 735,904 ****
  
       This option is required when building the libgccjit.so library.
  
!      Contrast with `--enable-shared', which affects _target_ libraries.
  
! `--with-gnu-as'
!      Specify that the compiler should assume that the assembler it
!      finds is the GNU assembler.  However, this does not modify the
!      rules to find an assembler and will result in confusion if the
!      assembler found is not actually the GNU assembler.  (Confusion may
!      also result if the compiler finds the GNU assembler but has not
!      been configured with `--with-gnu-as'.)  If you have more than one
!      assembler installed on your system, you may want to use this
!      option in connection with `--with-as=PATHNAME' or
!      `--with-build-time-tools=PATHNAME'.
  
       The following systems are the only ones where it makes a difference
       whether you use the GNU assembler.  On any other system,
!      `--with-gnu-as' has no effect.
! 
!         * `hppa1.0-ANY-ANY'
! 
!         * `hppa1.1-ANY-ANY'
! 
!         * `sparc-sun-solaris2.ANY'
  
!         * `sparc64-ANY-solaris2.ANY'
  
! `--with-as=PATHNAME'
       Specify that the compiler should use the assembler pointed to by
       PATHNAME, rather than the one found by the standard rules to find
       an assembler, which are:
          * Unless GCC is being built with a cross compiler, check the
!           `LIBEXEC/gcc/TARGET/VERSION' directory.  LIBEXEC defaults to
!           `EXEC-PREFIX/libexec'; EXEC-PREFIX defaults to PREFIX, which
!           defaults to `/usr/local' unless overridden by the
!           `--prefix=PATHNAME' switch described above.  TARGET is the
!           target system triple, such as `sparc-sun-solaris2.7', and
            VERSION denotes the GCC version, such as 3.0.
  
          * If the target system is the same that you are building on,
            check operating system specific directories (e.g.
!           `/usr/ccs/bin' on Sun Solaris 2).
  
!         * Check in the `PATH' for a tool whose name is prefixed by the
            target system triple.
  
!         * Check in the `PATH' for a tool whose name is not prefixed by
!           the target system triple, if the host and target system
!           triple are the same (in other words, we use a host tool if it
!           can be used for the target as well).
  
!      You may want to use `--with-as' if no assembler is installed in
!      the directories listed above, or if you have multiple assemblers
       installed and want to choose one that is not found by the above
       rules.
  
! `--with-gnu-ld'
!      Same as `--with-gnu-as' but for the linker.
  
! `--with-ld=PATHNAME'
!      Same as `--with-as' but for the linker.
  
! `--with-stabs'
       Specify that stabs debugging information should be used instead of
!      whatever format the host normally uses.  Normally GCC uses the
!      same debug format as the host system.
  
       On MIPS based systems and on Alphas, you must specify whether you
       want GCC to create the normal ECOFF debugging format, or to use
       BSD-style stabs passed through the ECOFF symbol table.  The normal
!      ECOFF debug format cannot fully handle languages other than C.
!      BSD stabs format can handle other languages, but it only works
!      with the GNU debugger GDB.
  
       Normally, GCC uses the ECOFF debugging format by default; if you
!      prefer BSD stabs, specify `--with-stabs' when you configure GCC.
  
       No matter which default you choose when you configure GCC, the user
!      can use the `-gcoff' and `-gstabs+' options to specify explicitly
       the debug format for a particular compilation.
  
!      `--with-stabs' is meaningful on the ISC system on the 386, also, if
!      `--with-gas' is used.  It selects use of stabs debugging
       information embedded in COFF output.  This kind of debugging
       information supports C++ well; ordinary COFF debugging information
       does not.
  
!      `--with-stabs' is also meaningful on 386 systems running SVR4.  It
       selects use of stabs debugging information embedded in ELF output.
       The C++ compiler currently (2.6.0) does not support the DWARF
       debugging information normally used on 386 SVR4 platforms; stabs
       provide a workable alternative.  This requires gas and gdb, as the
       normal SVR4 tools can not generate or interpret stabs.
  
! `--with-tls=DIALECT'
       Specify the default TLS dialect, for systems were there is a
!      choice.  For ARM targets, possible values for DIALECT are `gnu' or
!      `gnu2', which select between the original GNU dialect and the GNU
       TLS descriptor-based dialect.
  
! `--enable-multiarch'
       Specify whether to enable or disable multiarch support.  The
       default is to check for glibc start files in a multiarch location,
       and enable it if the files are found.  The auto detection is
       enabled for native builds, and for cross builds configured with
!      `--with-sysroot', and without `--with-native-system-header-dir'.
       More documentation about multiarch can be found at
!      `http://wiki.debian.org/Multiarch'.
  
! `--enable-vtable-verify'
       Specify whether to enable or disable the vtable verification
       feature.  Enabling this feature causes libstdc++ to be built with
!      its virtual calls in verifiable mode.  This means that, when
!      linked with libvtv, every virtual call in libstdc++ will verify
!      the vtable pointer through which the call will be made before
!      actually making the call.  If not linked with libvtv, the verifier
!      will call stub functions (in libstdc++ itself) and do nothing.  If
!      vtable verification is disabled, then libstdc++ is not built with
!      its virtual calls in verifiable mode at all.  However the libvtv
!      library will still be built (see `--disable-libvtv' to turn off
!      building libvtv).  `--disable-vtable-verify' is the default.
  
! `--disable-multilib'
       Specify that multiple target libraries to support different target
       variants, calling conventions, etc. should not be built.  The
       default is to build a predefined set of them.
  
!      Some targets provide finer-grained control over which multilibs
!      are built (e.g., `--disable-softfloat'):
!     `arm-*-*'
            fpu, 26bit, underscore, interwork, biendian, nofmult.
  
!     `m68*-*-*'
            softfloat, m68881, m68000, m68020.
  
!     `mips*-*-*'
            single-float, biendian, softfloat.
  
!     `powerpc*-*-*, rs6000*-*-*'
            aix64, pthread, softfloat, powercpu, powerpccpu, powerpcos,
            biendian, sysv, aix.
  
! 
! `--with-multilib-list=LIST'
! `--without-multilib-list'
       Specify what multilibs to build.  Currently only implemented for
       sh*-*-* and x86-64-*-linux*.
  
!     `sh*-*-*'
!           LIST is a comma separated list of CPU names.  These must be
!           of the form `sh*' or `m*' (in which case they match the
!           compiler option for that processor).  The list should not
!           contain any endian options - these are handled by
!           `--with-endian'.
  
            If LIST is empty, then there will be no multilibs for extra
            processors.  The multilib for the secondary endian remains
            enabled.
  
!           As a special case, if an entry in the list starts with a `!'
            (exclamation point), then it is added to the list of excluded
            multilibs.  Entries of this sort should be compatible with
!           `MULTILIB_EXCLUDES' (once the leading `!' has been stripped).
  
!           If `--with-multilib-list' is not given, then a default set of
!           multilibs is selected based on the value of `--target'.  This
            is usually the complete set of libraries, but some targets
            imply a more specialized subset.
  
--- 755,925 ----
  
       This option is required when building the libgccjit.so library.
  
!      Contrast with '--enable-shared', which affects _target_ libraries.
  
! '--with-gnu-as'
!      Specify that the compiler should assume that the assembler it finds
!      is the GNU assembler.  However, this does not modify the rules to
!      find an assembler and will result in confusion if the assembler
!      found is not actually the GNU assembler.  (Confusion may also
!      result if the compiler finds the GNU assembler but has not been
!      configured with '--with-gnu-as'.)  If you have more than one
!      assembler installed on your system, you may want to use this option
!      in connection with '--with-as=PATHNAME' or
!      '--with-build-time-tools=PATHNAME'.
  
       The following systems are the only ones where it makes a difference
       whether you use the GNU assembler.  On any other system,
!      '--with-gnu-as' has no effect.
  
!         * 'hppa1.0-ANY-ANY'
!         * 'hppa1.1-ANY-ANY'
!         * 'sparc-sun-solaris2.ANY'
!         * 'sparc64-ANY-solaris2.ANY'
  
! '--with-as=PATHNAME'
       Specify that the compiler should use the assembler pointed to by
       PATHNAME, rather than the one found by the standard rules to find
       an assembler, which are:
          * Unless GCC is being built with a cross compiler, check the
!           'LIBEXEC/gcc/TARGET/VERSION' directory.  LIBEXEC defaults to
!           'EXEC-PREFIX/libexec'; EXEC-PREFIX defaults to PREFIX, which
!           defaults to '/usr/local' unless overridden by the
!           '--prefix=PATHNAME' switch described above.  TARGET is the
!           target system triple, such as 'sparc-sun-solaris2.7', and
            VERSION denotes the GCC version, such as 3.0.
  
          * If the target system is the same that you are building on,
            check operating system specific directories (e.g.
!           '/usr/ccs/bin' on Sun Solaris 2).
  
!         * Check in the 'PATH' for a tool whose name is prefixed by the
            target system triple.
  
!         * Check in the 'PATH' for a tool whose name is not prefixed by
!           the target system triple, if the host and target system triple
!           are the same (in other words, we use a host tool if it can be
!           used for the target as well).
  
!      You may want to use '--with-as' if no assembler is installed in the
!      directories listed above, or if you have multiple assemblers
       installed and want to choose one that is not found by the above
       rules.
  
! '--with-gnu-ld'
!      Same as '--with-gnu-as' but for the linker.
  
! '--with-ld=PATHNAME'
!      Same as '--with-as' but for the linker.
  
! '--with-stabs'
       Specify that stabs debugging information should be used instead of
!      whatever format the host normally uses.  Normally GCC uses the same
!      debug format as the host system.
  
       On MIPS based systems and on Alphas, you must specify whether you
       want GCC to create the normal ECOFF debugging format, or to use
       BSD-style stabs passed through the ECOFF symbol table.  The normal
!      ECOFF debug format cannot fully handle languages other than C.  BSD
!      stabs format can handle other languages, but it only works with the
!      GNU debugger GDB.
  
       Normally, GCC uses the ECOFF debugging format by default; if you
!      prefer BSD stabs, specify '--with-stabs' when you configure GCC.
  
       No matter which default you choose when you configure GCC, the user
!      can use the '-gcoff' and '-gstabs+' options to specify explicitly
       the debug format for a particular compilation.
  
!      '--with-stabs' is meaningful on the ISC system on the 386, also, if
!      '--with-gas' is used.  It selects use of stabs debugging
       information embedded in COFF output.  This kind of debugging
       information supports C++ well; ordinary COFF debugging information
       does not.
  
!      '--with-stabs' is also meaningful on 386 systems running SVR4.  It
       selects use of stabs debugging information embedded in ELF output.
       The C++ compiler currently (2.6.0) does not support the DWARF
       debugging information normally used on 386 SVR4 platforms; stabs
       provide a workable alternative.  This requires gas and gdb, as the
       normal SVR4 tools can not generate or interpret stabs.
  
! '--with-tls=DIALECT'
       Specify the default TLS dialect, for systems were there is a
!      choice.  For ARM targets, possible values for DIALECT are 'gnu' or
!      'gnu2', which select between the original GNU dialect and the GNU
       TLS descriptor-based dialect.
  
! '--enable-multiarch'
       Specify whether to enable or disable multiarch support.  The
       default is to check for glibc start files in a multiarch location,
       and enable it if the files are found.  The auto detection is
       enabled for native builds, and for cross builds configured with
!      '--with-sysroot', and without '--with-native-system-header-dir'.
       More documentation about multiarch can be found at
!      <http://wiki.debian.org/Multiarch>.
  
! '--enable-sjlj-exceptions'
!      Force use of the 'setjmp'/'longjmp'-based scheme for exceptions.
!      'configure' ordinarily picks the correct value based on the
!      platform.  Only use this option if you are sure you need a
!      different setting.
! 
! '--enable-vtable-verify'
       Specify whether to enable or disable the vtable verification
       feature.  Enabling this feature causes libstdc++ to be built with
!      its virtual calls in verifiable mode.  This means that, when linked
!      with libvtv, every virtual call in libstdc++ will verify the vtable
!      pointer through which the call will be made before actually making
!      the call.  If not linked with libvtv, the verifier will call stub
!      functions (in libstdc++ itself) and do nothing.  If vtable
!      verification is disabled, then libstdc++ is not built with its
!      virtual calls in verifiable mode at all.  However the libvtv
!      library will still be built (see '--disable-libvtv' to turn off
!      building libvtv).  '--disable-vtable-verify' is the default.
  
! '--disable-multilib'
       Specify that multiple target libraries to support different target
       variants, calling conventions, etc. should not be built.  The
       default is to build a predefined set of them.
  
!      Some targets provide finer-grained control over which multilibs are
!      built (e.g., '--disable-softfloat'):
!      'arm-*-*'
            fpu, 26bit, underscore, interwork, biendian, nofmult.
  
!      'm68*-*-*'
            softfloat, m68881, m68000, m68020.
  
!      'mips*-*-*'
            single-float, biendian, softfloat.
  
!      'powerpc*-*-*, rs6000*-*-*'
            aix64, pthread, softfloat, powercpu, powerpccpu, powerpcos,
            biendian, sysv, aix.
  
! '--with-multilib-list=LIST'
! '--without-multilib-list'
       Specify what multilibs to build.  Currently only implemented for
       sh*-*-* and x86-64-*-linux*.
  
!      'sh*-*-*'
!           LIST is a comma separated list of CPU names.  These must be of
!           the form 'sh*' or 'm*' (in which case they match the compiler
!           option for that processor).  The list should not contain any
!           endian options - these are handled by '--with-endian'.
  
            If LIST is empty, then there will be no multilibs for extra
            processors.  The multilib for the secondary endian remains
            enabled.
  
!           As a special case, if an entry in the list starts with a '!'
            (exclamation point), then it is added to the list of excluded
            multilibs.  Entries of this sort should be compatible with
!           'MULTILIB_EXCLUDES' (once the leading '!' has been stripped).
  
!           If '--with-multilib-list' is not given, then a default set of
!           multilibs is selected based on the value of '--target'.  This
            is usually the complete set of libraries, but some targets
            imply a more specialized subset.
  
*************** option.
*** 911,946 ****
                 --with-cpu=sh4a --with-endian=little,big \
                 --with-multilib-list=sh4al,!mb/m4al
  
!     `x86-64-*-linux*'
!           LIST is a comma separated list of `m32', `m64' and `mx32' to
            enable 32-bit, 64-bit and x32 run-time libraries,
            respectively.  If LIST is empty, then there will be no
            multilibs and only the default run-time library will be
            enabled.
  
!           If `--with-multilib-list' is not given, then only 32-bit and
            64-bit run-time libraries will be enabled.
  
! `--with-endian=ENDIANS'
       Specify what endians to use.  Currently only implemented for
       sh*-*-*.
  
       ENDIANS may be one of the following:
!     `big'
            Use big endian exclusively.
! 
!     `little'
            Use little endian exclusively.
! 
!     `big,little'
            Use big endian by default.  Provide a multilib for little
            endian.
! 
!     `little,big'
            Use little endian by default.  Provide a multilib for big
            endian.
  
! `--enable-threads'
       Specify that the target supports threads.  This affects the
       Objective-C compiler and runtime library, and exception handling
       for other languages like C++ and Java.  On some systems, this is
--- 932,964 ----
                 --with-cpu=sh4a --with-endian=little,big \
                 --with-multilib-list=sh4al,!mb/m4al
  
!      'x86-64-*-linux*'
!           LIST is a comma separated list of 'm32', 'm64' and 'mx32' to
            enable 32-bit, 64-bit and x32 run-time libraries,
            respectively.  If LIST is empty, then there will be no
            multilibs and only the default run-time library will be
            enabled.
  
!           If '--with-multilib-list' is not given, then only 32-bit and
            64-bit run-time libraries will be enabled.
  
! '--with-endian=ENDIANS'
       Specify what endians to use.  Currently only implemented for
       sh*-*-*.
  
       ENDIANS may be one of the following:
!      'big'
            Use big endian exclusively.
!      'little'
            Use little endian exclusively.
!      'big,little'
            Use big endian by default.  Provide a multilib for little
            endian.
!      'little,big'
            Use little endian by default.  Provide a multilib for big
            endian.
  
! '--enable-threads'
       Specify that the target supports threads.  This affects the
       Objective-C compiler and runtime library, and exception handling
       for other languages like C++ and Java.  On some systems, this is
*************** option.
*** 950,1192 ****
       model available will be configured for use.  Beware that on some
       systems, GCC has not been taught what threading models are
       generally available for the system.  In this case,
!      `--enable-threads' is an alias for `--enable-threads=single'.
  
! `--disable-threads'
       Specify that threading support should be disabled for the system.
!      This is an alias for `--enable-threads=single'.
  
! `--enable-threads=LIB'
       Specify that LIB is the thread support library.  This affects the
       Objective-C compiler and runtime library, and exception handling
       for other languages like C++ and Java.  The possibilities for LIB
       are:
  
!     `aix'
            AIX thread support.
! 
!     `dce'
            DCE thread support.
! 
!     `lynx'
            LynxOS thread support.
! 
!     `mipssde'
            MIPS SDE thread support.
! 
!     `no'
!           This is an alias for `single'.
! 
!     `posix'
            Generic POSIX/Unix98 thread support.
! 
!     `rtems'
            RTEMS thread support.
! 
!     `single'
            Disable thread support, should work for all platforms.
! 
!     `tpf'
            TPF thread support.
! 
!     `vxworks'
            VxWorks thread support.
! 
!     `win32'
            Microsoft Win32 API thread support.
  
! `--enable-tls'
       Specify that the target supports TLS (Thread Local Storage).
       Usually configure can correctly determine if TLS is supported.  In
       cases where it guesses incorrectly, TLS can be explicitly enabled
!      or disabled with `--enable-tls' or `--disable-tls'.  This can
!      happen if the assembler supports TLS but the C library does not,
!      or if the assumptions made by the configure test are incorrect.
  
! `--disable-tls'
!      Specify that the target does not support TLS.  This is an alias
!      for `--enable-tls=no'.
  
! `--with-cpu=CPU'
! `--with-cpu-32=CPU'
! `--with-cpu-64=CPU'
       Specify which cpu variant the compiler should generate code for by
!      default.  CPU will be used as the default value of the `-mcpu='
       switch.  This option is only supported on some targets, including
!      ARC, ARM, i386, M68k, PowerPC, and SPARC.  It is mandatory for
!      ARC.  The `--with-cpu-32' and `--with-cpu-64' options specify
!      separate default CPUs for 32-bit and 64-bit modes; these options
!      are only supported for i386, x86-64 and PowerPC.
  
! `--with-schedule=CPU'
! `--with-arch=CPU'
! `--with-arch-32=CPU'
! `--with-arch-64=CPU'
! `--with-tune=CPU'
! `--with-tune-32=CPU'
! `--with-tune-64=CPU'
! `--with-abi=ABI'
! `--with-fpu=TYPE'
! `--with-float=TYPE'
       These configure options provide default values for the
!      `-mschedule=', `-march=', `-mtune=', `-mabi=', and `-mfpu='
!      options and for `-mhard-float' or `-msoft-float'.  As with
!      `--with-cpu', which switches will be accepted and acceptable values
!      of the arguments depend on the target.
  
! `--with-mode=MODE'
!      Specify if the compiler should default to `-marm' or `-mthumb'.
       This option is only supported on ARM targets.
  
! `--with-stack-offset=NUM'
!      This option sets the default for the -mstack-offset=NUM option,
!      and will thus generally also control the setting of this option for
       libraries.  This option is only supported on Epiphany targets.
  
! `--with-fpmath=ISA'
!      This options sets `-mfpmath=sse' by default and specifies the
       default ISA for floating-point arithmetics.  You can select either
!      `sse' which enables `-msse2' or `avx' which enables `-mavx' by
       default.  This option is only supported on i386 and x86-64 targets.
  
! `--with-fp-32=MODE'
!      On MIPS targets, set the default value for the `-mfp' option when
!      using the o32 ABI.  The possibilities for MODE are:
!     `32'
!           Use the o32 FP32 ABI extension, as with the `-mfp32'
            command-line option.
! 
!     `xx'
!           Use the o32 FPXX ABI extension, as with the `-mfpxx'
            command-line option.
! 
!     `64'
!           Use the o32 FP64 ABI extension, as with the `-mfp64'
            command-line option.
       In the absence of this configuration option the default is to use
       the o32 FP32 ABI extension.
  
! `--with-odd-spreg-32'
!      On MIPS targets, set the `-modd-spreg' option by default when using
       the o32 ABI.
  
! `--without-odd-spreg-32'
!      On MIPS targets, set the `-mno-odd-spreg' option by default when
!      using the o32 ABI.  This is normally used in conjunction with
!      `--with-fp-32=64' in order to target the o32 FP64A ABI extension.
  
! `--with-nan=ENCODING'
       On MIPS targets, set the default encoding convention to use for the
       special not-a-number (NaN) IEEE 754 floating-point data.  The
       possibilities for ENCODING are:
!     `legacy'
!           Use the legacy encoding, as with the `-mnan=legacy'
            command-line option.
! 
!     `2008'
!           Use the 754-2008 encoding, as with the `-mnan=2008'
            command-line option.
       To use this configuration option you must have an assembler version
!      installed that supports the `-mnan=' command-line option too.  In
       the absence of this configuration option the default convention is
!      the legacy encoding, as when neither of the `-mnan=2008' and
!      `-mnan=legacy' command-line options has been used.
  
! `--with-divide=TYPE'
       Specify how the compiler should generate code for checking for
       division by zero.  This option is only supported on the MIPS
       target.  The possibilities for TYPE are:
!     `traps'
            Division by zero checks use conditional traps (this is the
            default on systems that support conditional traps).
! 
!     `breaks'
            Division by zero checks use the break instruction.
  
! `--with-llsc'
!      On MIPS targets, make `-mllsc' the default when no `-mno-llsc'
       option is passed.  This is the default for Linux-based targets, as
       the kernel will emulate them if the ISA does not provide them.
  
! `--without-llsc'
!      On MIPS targets, make `-mno-llsc' the default when no `-mllsc'
       option is passed.
  
! `--with-synci'
!      On MIPS targets, make `-msynci' the default when no `-mno-synci'
       option is passed.
  
! `--without-synci'
!      On MIPS targets, make `-mno-synci' the default when no `-msynci'
       option is passed.  This is the default.
  
! `--with-mips-plt'
       On MIPS targets, make use of copy relocations and PLTs.  These
!      features are extensions to the traditional SVR4-based MIPS ABIs
!      and require support from GNU binutils and the runtime C library.
  
! `--enable-__cxa_atexit'
       Define if you want to use __cxa_atexit, rather than atexit, to
       register C++ destructors for local statics and global objects.
       This is essential for fully standards-compliant handling of
       destructors, but requires __cxa_atexit in libc.  This option is
       currently only available on systems with GNU libc.  When enabled,
!      this will cause `-fuse-cxa-atexit' to be passed by default.
  
! `--enable-gnu-indirect-function'
!      Define if you want to enable the `ifunc' attribute.  This option is
       currently only available on systems with GNU libc on certain
       targets.
  
! `--enable-target-optspace'
       Specify that target libraries should be optimized for code space
       instead of code speed.  This is the default for the m32r platform.
  
! `--with-cpp-install-dir=DIRNAME'
!      Specify that the user visible `cpp' program should be installed in
!      `PREFIX/DIRNAME/cpp', in addition to BINDIR.
  
! `--enable-comdat'
       Enable COMDAT group support.  This is primarily used to override
       the automatically detected value.
  
! `--enable-initfini-array'
!      Force the use of sections `.init_array' and `.fini_array' (instead
!      of `.init' and `.fini') for constructors and destructors.  Option
!      `--disable-initfini-array' has the opposite effect.  If neither
!      option is specified, the configure script will try to guess
!      whether the `.init_array' and `.fini_array' sections are supported
!      and, if they are, use them.
  
! `--enable-link-mutex'
       When building GCC, use a mutex to avoid linking the compilers for
       multiple languages at the same time, to avoid thrashing on build
!      systems with limited free memory.  The default is not to use such
!      a mutex.
  
! `--enable-maintainer-mode'
       The build rules that regenerate the Autoconf and Automake output
!      files as well as the GCC master message catalog `gcc.pot' are
       normally disabled.  This is because it can only be rebuilt if the
       complete source tree is present.  If you have changed the sources
       and want to rebuild the catalog, configuring with
!      `--enable-maintainer-mode' will enable this.  Note that you need a
!      recent version of the `gettext' tools to do so.
  
! `--disable-bootstrap'
       For a native build, the default configuration is to perform a
!      3-stage bootstrap of the compiler when `make' is invoked, testing
!      that GCC can compile itself correctly.  If you want to disable
!      this process, you can configure with `--disable-bootstrap'.
  
! `--enable-bootstrap'
       In special cases, you may want to perform a 3-stage build even if
       the target and host triplets are different.  This is possible when
       the host can run code compiled for the target (e.g. host is
       i686-linux, target is i486-linux).  Starting from GCC 4.2, to do
!      this you have to configure explicitly with `--enable-bootstrap'.
  
! `--enable-generated-files-in-srcdir'
       Neither the .c and .h files that are generated from Bison and flex
       nor the info manuals and man pages that are built from the .texi
       files are present in the SVN development tree.  When building GCC
--- 968,1196 ----
       model available will be configured for use.  Beware that on some
       systems, GCC has not been taught what threading models are
       generally available for the system.  In this case,
!      '--enable-threads' is an alias for '--enable-threads=single'.
  
! '--disable-threads'
       Specify that threading support should be disabled for the system.
!      This is an alias for '--enable-threads=single'.
  
! '--enable-threads=LIB'
       Specify that LIB is the thread support library.  This affects the
       Objective-C compiler and runtime library, and exception handling
       for other languages like C++ and Java.  The possibilities for LIB
       are:
  
!      'aix'
            AIX thread support.
!      'dce'
            DCE thread support.
!      'lynx'
            LynxOS thread support.
!      'mipssde'
            MIPS SDE thread support.
!      'no'
!           This is an alias for 'single'.
!      'posix'
            Generic POSIX/Unix98 thread support.
!      'rtems'
            RTEMS thread support.
!      'single'
            Disable thread support, should work for all platforms.
!      'tpf'
            TPF thread support.
!      'vxworks'
            VxWorks thread support.
!      'win32'
            Microsoft Win32 API thread support.
  
! '--enable-tls'
       Specify that the target supports TLS (Thread Local Storage).
       Usually configure can correctly determine if TLS is supported.  In
       cases where it guesses incorrectly, TLS can be explicitly enabled
!      or disabled with '--enable-tls' or '--disable-tls'.  This can
!      happen if the assembler supports TLS but the C library does not, or
!      if the assumptions made by the configure test are incorrect.
  
! '--disable-tls'
!      Specify that the target does not support TLS. This is an alias for
!      '--enable-tls=no'.
  
! '--with-cpu=CPU'
! '--with-cpu-32=CPU'
! '--with-cpu-64=CPU'
       Specify which cpu variant the compiler should generate code for by
!      default.  CPU will be used as the default value of the '-mcpu='
       switch.  This option is only supported on some targets, including
!      ARC, ARM, i386, M68k, PowerPC, and SPARC.  It is mandatory for ARC.
!      The '--with-cpu-32' and '--with-cpu-64' options specify separate
!      default CPUs for 32-bit and 64-bit modes; these options are only
!      supported for i386, x86-64 and PowerPC.
  
! '--with-schedule=CPU'
! '--with-arch=CPU'
! '--with-arch-32=CPU'
! '--with-arch-64=CPU'
! '--with-tune=CPU'
! '--with-tune-32=CPU'
! '--with-tune-64=CPU'
! '--with-abi=ABI'
! '--with-fpu=TYPE'
! '--with-float=TYPE'
       These configure options provide default values for the
!      '-mschedule=', '-march=', '-mtune=', '-mabi=', and '-mfpu=' options
!      and for '-mhard-float' or '-msoft-float'.  As with '--with-cpu',
!      which switches will be accepted and acceptable values of the
!      arguments depend on the target.
  
! '--with-mode=MODE'
!      Specify if the compiler should default to '-marm' or '-mthumb'.
       This option is only supported on ARM targets.
  
! '--with-stack-offset=NUM'
!      This option sets the default for the -mstack-offset=NUM option, and
!      will thus generally also control the setting of this option for
       libraries.  This option is only supported on Epiphany targets.
  
! '--with-fpmath=ISA'
!      This options sets '-mfpmath=sse' by default and specifies the
       default ISA for floating-point arithmetics.  You can select either
!      'sse' which enables '-msse2' or 'avx' which enables '-mavx' by
       default.  This option is only supported on i386 and x86-64 targets.
  
! '--with-fp-32=MODE'
!      On MIPS targets, set the default value for the '-mfp' option when
!      using the o32 ABI. The possibilities for MODE are:
!      '32'
!           Use the o32 FP32 ABI extension, as with the '-mfp32'
            command-line option.
!      'xx'
!           Use the o32 FPXX ABI extension, as with the '-mfpxx'
            command-line option.
!      '64'
!           Use the o32 FP64 ABI extension, as with the '-mfp64'
            command-line option.
       In the absence of this configuration option the default is to use
       the o32 FP32 ABI extension.
  
! '--with-odd-spreg-32'
!      On MIPS targets, set the '-modd-spreg' option by default when using
       the o32 ABI.
  
! '--without-odd-spreg-32'
!      On MIPS targets, set the '-mno-odd-spreg' option by default when
!      using the o32 ABI. This is normally used in conjunction with
!      '--with-fp-32=64' in order to target the o32 FP64A ABI extension.
  
! '--with-nan=ENCODING'
       On MIPS targets, set the default encoding convention to use for the
       special not-a-number (NaN) IEEE 754 floating-point data.  The
       possibilities for ENCODING are:
!      'legacy'
!           Use the legacy encoding, as with the '-mnan=legacy'
            command-line option.
!      '2008'
!           Use the 754-2008 encoding, as with the '-mnan=2008'
            command-line option.
       To use this configuration option you must have an assembler version
!      installed that supports the '-mnan=' command-line option too.  In
       the absence of this configuration option the default convention is
!      the legacy encoding, as when neither of the '-mnan=2008' and
!      '-mnan=legacy' command-line options has been used.
  
! '--with-divide=TYPE'
       Specify how the compiler should generate code for checking for
       division by zero.  This option is only supported on the MIPS
       target.  The possibilities for TYPE are:
!      'traps'
            Division by zero checks use conditional traps (this is the
            default on systems that support conditional traps).
!      'breaks'
            Division by zero checks use the break instruction.
  
! '--with-llsc'
!      On MIPS targets, make '-mllsc' the default when no '-mno-llsc'
       option is passed.  This is the default for Linux-based targets, as
       the kernel will emulate them if the ISA does not provide them.
  
! '--without-llsc'
!      On MIPS targets, make '-mno-llsc' the default when no '-mllsc'
       option is passed.
  
! '--with-synci'
!      On MIPS targets, make '-msynci' the default when no '-mno-synci'
       option is passed.
  
! '--without-synci'
!      On MIPS targets, make '-mno-synci' the default when no '-msynci'
       option is passed.  This is the default.
  
! '--with-mips-plt'
       On MIPS targets, make use of copy relocations and PLTs.  These
!      features are extensions to the traditional SVR4-based MIPS ABIs and
!      require support from GNU binutils and the runtime C library.
  
! '--enable-__cxa_atexit'
       Define if you want to use __cxa_atexit, rather than atexit, to
       register C++ destructors for local statics and global objects.
       This is essential for fully standards-compliant handling of
       destructors, but requires __cxa_atexit in libc.  This option is
       currently only available on systems with GNU libc.  When enabled,
!      this will cause '-fuse-cxa-atexit' to be passed by default.
  
! '--enable-gnu-indirect-function'
!      Define if you want to enable the 'ifunc' attribute.  This option is
       currently only available on systems with GNU libc on certain
       targets.
  
! '--enable-target-optspace'
       Specify that target libraries should be optimized for code space
       instead of code speed.  This is the default for the m32r platform.
  
! '--with-cpp-install-dir=DIRNAME'
!      Specify that the user visible 'cpp' program should be installed in
!      'PREFIX/DIRNAME/cpp', in addition to BINDIR.
  
! '--enable-comdat'
       Enable COMDAT group support.  This is primarily used to override
       the automatically detected value.
  
! '--enable-initfini-array'
!      Force the use of sections '.init_array' and '.fini_array' (instead
!      of '.init' and '.fini') for constructors and destructors.  Option
!      '--disable-initfini-array' has the opposite effect.  If neither
!      option is specified, the configure script will try to guess whether
!      the '.init_array' and '.fini_array' sections are supported and, if
!      they are, use them.
  
! '--enable-link-mutex'
       When building GCC, use a mutex to avoid linking the compilers for
       multiple languages at the same time, to avoid thrashing on build
!      systems with limited free memory.  The default is not to use such a
!      mutex.
  
! '--enable-maintainer-mode'
       The build rules that regenerate the Autoconf and Automake output
!      files as well as the GCC master message catalog 'gcc.pot' are
       normally disabled.  This is because it can only be rebuilt if the
       complete source tree is present.  If you have changed the sources
       and want to rebuild the catalog, configuring with
!      '--enable-maintainer-mode' will enable this.  Note that you need a
!      recent version of the 'gettext' tools to do so.
  
! '--disable-bootstrap'
       For a native build, the default configuration is to perform a
!      3-stage bootstrap of the compiler when 'make' is invoked, testing
!      that GCC can compile itself correctly.  If you want to disable this
!      process, you can configure with '--disable-bootstrap'.
  
! '--enable-bootstrap'
       In special cases, you may want to perform a 3-stage build even if
       the target and host triplets are different.  This is possible when
       the host can run code compiled for the target (e.g. host is
       i686-linux, target is i486-linux).  Starting from GCC 4.2, to do
!      this you have to configure explicitly with '--enable-bootstrap'.
  
! '--enable-generated-files-in-srcdir'
       Neither the .c and .h files that are generated from Bison and flex
       nor the info manuals and man pages that are built from the .texi
       files are present in the SVN development tree.  When building GCC
*************** option.
*** 1194,1396 ****
       generated files are placed in your build directory, which allows
       for the source to be in a readonly directory.
  
!      If you configure with `--enable-generated-files-in-srcdir' then
       those generated files will go into the source directory.  This is
       mainly intended for generating release or prerelease tarballs of
       the GCC sources, since it is not a requirement that the users of
       source releases to have flex, Bison, or makeinfo.
  
! `--enable-version-specific-runtime-libs'
       Specify that runtime libraries should be installed in the compiler
!      specific subdirectory (`LIBDIR/gcc') rather than the usual places.
!      In addition, `libstdc++''s include files will be installed into
!      `LIBDIR' unless you overruled it by using
!      `--with-gxx-include-dir=DIRNAME'.  Using this option is
       particularly useful if you intend to use several versions of GCC in
!      parallel.  This is currently supported by `libgfortran',
!      `libjava', `libstdc++', and `libobjc'.
  
! `--with-aix-soname=`aix', `svr4' or `both''
!      Traditional AIX shared library versioning (versioned `Shared
!      Object' files as members of unversioned `Archive Library' files
!      named `lib.a') causes numerous headaches for package managers.
!      However, `Import Files' as members of `Archive Library' files
!      allow for *filename-based versioning* of shared libraries as seen
!      on Linux/SVR4, where this is called the "SONAME". But as they
!      prevent static linking, `Import Files' may be used with `Runtime
!      Linking' only, where the linker does search for `libNAME.so'
!      before `libNAME.a' library filenames with the `-lNAME' linker flag.
  
       For detailed information please refer to the AIX ld Command
       reference.
  
       As long as shared library creation is enabled, upon:
!     `--with-aix-soname=aix'
! 
!     `--with-aix-soname=both'
!           A (traditional AIX) `Shared Archive Library' file is created:
!              * using the `libNAME.a' filename scheme
! 
!              * with the `Shared Object' file as archive member named
!                `libNAME.so.V' (except for `libgcc_s', where the `Shared
!                 Object' file is named `shr.o' for backwards
                 compatibility), which
                    - is used for runtime loading from inside the
!                     `libNAME.a' file
! 
                    - is used for dynamic loading via
!                     `dlopen("libNAME.a(libNAME.so.V)", RTLD_MEMBER)'
! 
                    - is used for shared linking
! 
!                   - is used for static linking, so no separate `Static
!                     Archive    Library' file is needed
! 
! 
!     `--with-aix-soname=both'
! 
!     `--with-aix-soname=svr4'
!           A (second) `Shared Archive Library' file is created:
!              * using the `libNAME.so.V' filename scheme
! 
!              * with the `Shared Object' file as archive member named
!                `shr.o', which
!                   - is created with the `-G linker flag'
! 
!                   - has the `F_LOADONLY' flag set
! 
                    - is used for runtime loading from inside the
!                     `libNAME.so.V' file
! 
                    - is used for dynamic loading via
!                     `dlopen("libNAME.so.V(shr.o)",    RTLD_MEMBER)'
! 
! 
!              * with the `Import File' as archive member named `shr.imp',
                 which
!                   - refers to `libNAME.so.V(shr.o)' as the "SONAME", to
!                     be recorded    in the `Loader Section' of
!                     subsequent binaries
! 
!                   - indicates whether `libNAME.so.V(shr.o)' is 32 or 64
                      bit
- 
                    - lists all the public symbols exported by
!                     `lib.so.V(shr.o)',    eventually decorated with the
!                     ``weak' Keyword'
! 
                    - is necessary for shared linking against
!                     `lib.so.V(shr.o)'
! 
!             A symbolic link using the `libNAME.so' filename scheme is
            created:
!              * pointing to the `libNAME.so.V' `Shared Archive Library'
                 file
! 
!              * to permit the `ld Command' to find `lib.so.V(shr.imp)'
!                via   the `-lNAME' argument (requires `Runtime Linking'
!                to be enabled)
! 
!              * to permit dynamic loading of `lib.so.V(shr.o)' without
!                the need   to specify the version number via
!                `dlopen("libNAME.so(shr.o)",   RTLD_MEMBER)'
  
       As long as static library creation is enabled, upon:
!     `--with-aix-soname=svr4'
!           A `Static Archive Library' is created:
!              * using the `libNAME.a' filename scheme
! 
!              * with all the `Static Object' files as archive members,
                 which
                    - are used for static linking
  
! 
!      While the aix-soname=`svr4' option does not create `Shared Object'
!      files as members of unversioned `Archive Library' files any more,
!      package managers still are responsible to transfer `Shared Object'
       files found as member of a previously installed unversioned
!      `Archive Library' file into the newly installed `Archive Library'
       file with the same filename.
  
!      _WARNING:_ Creating `Shared Object' files with `Runtime Linking'
!      enabled may bloat the TOC, eventually leading to `TOC overflow'
!      errors, requiring the use of either the `-Wl,-bbigtoc' linker flag
!      (seen to break with the `GDB' debugger) or some of the TOC-related
!      compiler flags, *Note RS/6000 and PowerPC Options: (gcc)RS/6000
!      and PowerPC Options.
  
!      `--with-aix-soname' is currently supported by `libgcc_s' only, so
       this option is still experimental and not for normal use yet.
  
!      Default is the traditional behaviour `--with-aix-soname=`aix''.
  
! `--enable-languages=LANG1,LANG2,...'
       Specify that only a particular subset of compilers and their
       runtime libraries should be built.  For a list of valid values for
!      LANGN you can issue the following command in the `gcc' directory
!      of your GCC source tree:
            grep language= */config-lang.in
!      Currently, you can use any of the following: `all', `ada', `c',
!      `c++', `fortran', `go', `java', `objc', `obj-c++'.  Building the
       Ada compiler has special requirements, see below.  If you do not
!      pass this flag, or specify the option `all', then all default
!      languages available in the `gcc' sub-tree will be configured.
!      Ada, Go and Objective-C++ are not default languages; the rest are.
  
! `--enable-stage1-languages=LANG1,LANG2,...'
       Specify that a particular subset of compilers and their runtime
!      libraries should be built with the system C compiler during stage
!      1 of the bootstrap process, rather than only in later stages with
!      the bootstrapped C compiler.  The list of valid values is the same
!      as for `--enable-languages', and the option `all' will select all
!      of the languages enabled by `--enable-languages'.  This option is
       primarily useful for GCC development; for instance, when a
       development version of the compiler cannot bootstrap due to
!      compiler bugs, or when one is debugging front ends other than the
!      C front end.  When this option is used, one can then build the
!      target libraries for the specified languages with the stage-1
!      compiler by using `make stage1-bubble all-target', or run the
!      testsuite on the stage-1 compiler for the specified languages
!      using `make stage1-start check-gcc'.
  
! `--disable-libada'
       Specify that the run-time libraries and tools used by GNAT should
       not be built.  This can be useful for debugging, or for
       compatibility with previous Ada build procedures, when it was
!      required to explicitly do a `make -C gcc gnatlib_and_tools'.
  
! `--disable-libsanitizer'
       Specify that the run-time libraries for the various sanitizers
       should not be built.
  
! `--disable-libssp'
       Specify that the run-time libraries for stack smashing protection
       should not be built.
  
! `--disable-libquadmath'
       Specify that the GCC quad-precision math library should not be
       built.  On some systems, the library is required to be linkable
       when building the Fortran front end, unless
!      `--disable-libquadmath-support' is used.
  
! `--disable-libquadmath-support'
!      Specify that the Fortran front end and `libgfortran' do not add
!      support for `libquadmath' on systems supporting it.
  
! `--disable-libgomp'
       Specify that the GNU Offloading and Multi Processing Runtime
       Library should not be built.
  
! `--disable-libvtv'
       Specify that the run-time libraries used by vtable verification
       should not be built.
  
! `--with-dwarf2'
       Specify that the compiler should use DWARF 2 debugging information
       as the default.
  
! `--enable-targets=all'
! `--enable-targets=TARGET_LIST'
       Some GCC targets, e.g. powerpc64-linux, build bi-arch compilers.
       These are compilers that are able to generate either 64-bit or
       32-bit code.  Typically, the corresponding 32-bit target, e.g.
--- 1198,1378 ----
       generated files are placed in your build directory, which allows
       for the source to be in a readonly directory.
  
!      If you configure with '--enable-generated-files-in-srcdir' then
       those generated files will go into the source directory.  This is
       mainly intended for generating release or prerelease tarballs of
       the GCC sources, since it is not a requirement that the users of
       source releases to have flex, Bison, or makeinfo.
  
! '--enable-version-specific-runtime-libs'
       Specify that runtime libraries should be installed in the compiler
!      specific subdirectory ('LIBDIR/gcc') rather than the usual places.
!      In addition, 'libstdc++''s include files will be installed into
!      'LIBDIR' unless you overruled it by using
!      '--with-gxx-include-dir=DIRNAME'.  Using this option is
       particularly useful if you intend to use several versions of GCC in
!      parallel.  This is currently supported by 'libgfortran', 'libjava',
!      'libstdc++', and 'libobjc'.
  
! '--with-aix-soname='aix', 'svr4' or 'both''
!      Traditional AIX shared library versioning (versioned 'Shared
!      Object' files as members of unversioned 'Archive Library' files
!      named 'lib.a') causes numerous headaches for package managers.
!      However, 'Import Files' as members of 'Archive Library' files allow
!      for *filename-based versioning* of shared libraries as seen on
!      Linux/SVR4, where this is called the "SONAME". But as they prevent
!      static linking, 'Import Files' may be used with 'Runtime Linking'
!      only, where the linker does search for 'libNAME.so' before
!      'libNAME.a' library filenames with the '-lNAME' linker flag.
  
       For detailed information please refer to the AIX ld Command
       reference.
  
       As long as shared library creation is enabled, upon:
!      '--with-aix-soname=aix'
!      '--with-aix-soname=both'
!           A (traditional AIX) 'Shared Archive Library' file is created:
!              * using the 'libNAME.a' filename scheme
!              * with the 'Shared Object' file as archive member named
!                'libNAME.so.V' (except for 'libgcc_s', where the 'Shared
!                Object' file is named 'shr.o' for backwards
                 compatibility), which
                    - is used for runtime loading from inside the
!                     'libNAME.a' file
                    - is used for dynamic loading via
!                     'dlopen("libNAME.a(libNAME.so.V)", RTLD_MEMBER)'
                    - is used for shared linking
!                   - is used for static linking, so no separate 'Static
!                     Archive Library' file is needed
!      '--with-aix-soname=both'
!      '--with-aix-soname=svr4'
!           A (second) 'Shared Archive Library' file is created:
!              * using the 'libNAME.so.V' filename scheme
!              * with the 'Shared Object' file as archive member named
!                'shr.o', which
!                   - is created with the '-G linker flag'
!                   - has the 'F_LOADONLY' flag set
                    - is used for runtime loading from inside the
!                     'libNAME.so.V' file
                    - is used for dynamic loading via
!                     'dlopen("libNAME.so.V(shr.o)", RTLD_MEMBER)'
!              * with the 'Import File' as archive member named 'shr.imp',
                 which
!                   - refers to 'libNAME.so.V(shr.o)' as the "SONAME", to
!                     be recorded in the 'Loader Section' of subsequent
!                     binaries
!                   - indicates whether 'libNAME.so.V(shr.o)' is 32 or 64
                      bit
                    - lists all the public symbols exported by
!                     'lib.so.V(shr.o)', eventually decorated with the
!                     ''weak' Keyword'
                    - is necessary for shared linking against
!                     'lib.so.V(shr.o)'
!           A symbolic link using the 'libNAME.so' filename scheme is
            created:
!              * pointing to the 'libNAME.so.V' 'Shared Archive Library'
                 file
!              * to permit the 'ld Command' to find 'lib.so.V(shr.imp)'
!                via the '-lNAME' argument (requires 'Runtime Linking' to
!                be enabled)
!              * to permit dynamic loading of 'lib.so.V(shr.o)' without
!                the need to specify the version number via
!                'dlopen("libNAME.so(shr.o)", RTLD_MEMBER)'
  
       As long as static library creation is enabled, upon:
!      '--with-aix-soname=svr4'
!           A 'Static Archive Library' is created:
!              * using the 'libNAME.a' filename scheme
!              * with all the 'Static Object' files as archive members,
                 which
                    - are used for static linking
  
!      While the aix-soname='svr4' option does not create 'Shared Object'
!      files as members of unversioned 'Archive Library' files any more,
!      package managers still are responsible to transfer 'Shared Object'
       files found as member of a previously installed unversioned
!      'Archive Library' file into the newly installed 'Archive Library'
       file with the same filename.
  
!      _WARNING:_ Creating 'Shared Object' files with 'Runtime Linking'
!      enabled may bloat the TOC, eventually leading to 'TOC overflow'
!      errors, requiring the use of either the '-Wl,-bbigtoc' linker flag
!      (seen to break with the 'GDB' debugger) or some of the TOC-related
!      compiler flags, *Note RS/6000 and PowerPC Options: (gcc)RS/6000 and
!      PowerPC Options.
  
!      '--with-aix-soname' is currently supported by 'libgcc_s' only, so
       this option is still experimental and not for normal use yet.
  
!      Default is the traditional behaviour '--with-aix-soname='aix''.
  
! '--enable-languages=LANG1,LANG2,...'
       Specify that only a particular subset of compilers and their
       runtime libraries should be built.  For a list of valid values for
!      LANGN you can issue the following command in the 'gcc' directory of
!      your GCC source tree:
            grep language= */config-lang.in
!      Currently, you can use any of the following: 'all', 'ada', 'c',
!      'c++', 'fortran', 'go', 'java', 'objc', 'obj-c++'.  Building the
       Ada compiler has special requirements, see below.  If you do not
!      pass this flag, or specify the option 'all', then all default
!      languages available in the 'gcc' sub-tree will be configured.  Ada,
!      Go and Objective-C++ are not default languages; the rest are.
  
! '--enable-stage1-languages=LANG1,LANG2,...'
       Specify that a particular subset of compilers and their runtime
!      libraries should be built with the system C compiler during stage 1
!      of the bootstrap process, rather than only in later stages with the
!      bootstrapped C compiler.  The list of valid values is the same as
!      for '--enable-languages', and the option 'all' will select all of
!      the languages enabled by '--enable-languages'.  This option is
       primarily useful for GCC development; for instance, when a
       development version of the compiler cannot bootstrap due to
!      compiler bugs, or when one is debugging front ends other than the C
!      front end.  When this option is used, one can then build the target
!      libraries for the specified languages with the stage-1 compiler by
!      using 'make stage1-bubble all-target', or run the testsuite on the
!      stage-1 compiler for the specified languages using 'make
!      stage1-start check-gcc'.
  
! '--disable-libada'
       Specify that the run-time libraries and tools used by GNAT should
       not be built.  This can be useful for debugging, or for
       compatibility with previous Ada build procedures, when it was
!      required to explicitly do a 'make -C gcc gnatlib_and_tools'.
  
! '--disable-libsanitizer'
       Specify that the run-time libraries for the various sanitizers
       should not be built.
  
! '--disable-libssp'
       Specify that the run-time libraries for stack smashing protection
       should not be built.
  
! '--disable-libquadmath'
       Specify that the GCC quad-precision math library should not be
       built.  On some systems, the library is required to be linkable
       when building the Fortran front end, unless
!      '--disable-libquadmath-support' is used.
  
! '--disable-libquadmath-support'
!      Specify that the Fortran front end and 'libgfortran' do not add
!      support for 'libquadmath' on systems supporting it.
  
! '--disable-libgomp'
       Specify that the GNU Offloading and Multi Processing Runtime
       Library should not be built.
  
! '--disable-libvtv'
       Specify that the run-time libraries used by vtable verification
       should not be built.
  
! '--with-dwarf2'
       Specify that the compiler should use DWARF 2 debugging information
       as the default.
  
! '--enable-targets=all'
! '--enable-targets=TARGET_LIST'
       Some GCC targets, e.g. powerpc64-linux, build bi-arch compilers.
       These are compilers that are able to generate either 64-bit or
       32-bit code.  Typically, the corresponding 32-bit target, e.g.
*************** option.
*** 1403,1699 ****
       affects sparc-linux, powerpc-linux, x86-linux, mips-linux and
       s390-linux.
  
! `--enable-secureplt'
!      This option enables `-msecure-plt' by default for powerpc-linux.
       *Note RS/6000 and PowerPC Options: (gcc)RS/6000 and PowerPC
       Options,
  
! `--enable-cld'
!      This option enables `-mcld' by default for 32-bit x86 targets.
       *Note i386 and x86-64 Options: (gcc)i386 and x86-64 Options,
  
! `--enable-win32-registry'
! `--enable-win32-registry=KEY'
! `--disable-win32-registry'
!      The `--enable-win32-registry' option enables Microsoft
       Windows-hosted GCC to look up installations paths in the registry
       using the following key:
  
!           `HKEY_LOCAL_MACHINE\SOFTWARE\Free Software Foundation\KEY'
  
       KEY defaults to GCC version number, and can be overridden by the
!      `--enable-win32-registry=KEY' option.  Vendors and distributors
!      who use custom installers are encouraged to provide a different
!      key, perhaps one comprised of vendor name and GCC version number,
!      to avoid conflict with existing installations.  This feature is
       enabled by default, and can be disabled by
!      `--disable-win32-registry' option.  This option has no effect on
       the other hosts.
  
! `--nfp'
       Specify that the machine does not have a floating point unit.  This
!      option only applies to `m68k-sun-sunosN'.  On any other system,
!      `--nfp' has no effect.
  
! `--enable-werror'
! `--disable-werror'
! `--enable-werror=yes'
! `--enable-werror=no'
       When you specify this option, it controls whether certain files in
!      the compiler are built with `-Werror' in bootstrap stage2 and
!      later.  If you don't specify it, `-Werror' is turned on for the
       main development trunk.  However it defaults to off for release
       branches and final releases.  The specific files which get
!      `-Werror' are controlled by the Makefiles.
  
! `--enable-checking'
! `--enable-checking=LIST'
       When you specify this option, the compiler is built to perform
!      internal consistency checks of the requested complexity.  This
!      does not change the generated code, but adds error checking within
!      the compiler.  This will slow down the compiler and may only work
!      properly if you are building the compiler with GCC.  This is `yes'
!      by default when building from SVN or snapshots, but `release' for
!      releases.  The default for building the stage1 compiler is `yes'.
       More control over the checks may be had by specifying LIST.  The
!      categories of checks available are `yes' (most common checks
!      `assert,misc,tree,gc,rtlflag,runtime'), `no' (no checks at all),
!      `all' (all but `valgrind'), `release' (cheapest checks
!      `assert,runtime') or `none' (same as `no').  Individual checks can
!      be enabled with these flags `assert', `df', `fold', `gc', `gcac'
!      `misc', `rtl', `rtlflag', `runtime', `tree', and `valgrind'.
  
!      The `valgrind' check requires the external `valgrind' simulator,
!      available from `http://valgrind.org/'.  The `df', `rtl', `gcac'
!      and `valgrind' checks are very expensive.  To disable all
!      checking, `--disable-checking' or `--enable-checking=none' must be
!      explicitly requested.  Disabling assertions will make the compiler
!      and runtime slightly faster but increase the risk of undetected
!      internal errors causing wrong code to be generated.
  
! `--disable-stage1-checking'
! `--enable-stage1-checking'
! `--enable-stage1-checking=LIST'
!      If no `--enable-checking' option is specified the stage1 compiler
!      will be built with `yes' checking enabled, otherwise the stage1
!      checking flags are the same as specified by `--enable-checking'.
       To build the stage1 compiler with different checking options use
!      `--enable-stage1-checking'.  The list of checking options is the
!      same as for `--enable-checking'.  If your system is too slow or
!      too small to bootstrap a released compiler with checking for
!      stage1 enabled, you can use `--disable-stage1-checking' to disable
       checking for the stage1 compiler.
  
! `--enable-coverage'
! `--enable-coverage=LEVEL'
       With this option, the compiler is built to collect self coverage
       information, every time it is run.  This is for internal
       development purposes, and only works when the compiler is being
       built with gcc.  The LEVEL argument controls whether the compiler
!      is built optimized or not, values are `opt' and `noopt'.  For
!      coverage analysis you want to disable optimization, for
!      performance analysis you want to enable optimization.  When
!      coverage is enabled, the default level is without optimization.
  
! `--enable-gather-detailed-mem-stats'
       When this option is specified more detailed information on memory
       allocation is gathered.  This information is printed when using
!      `-fmem-report'.
  
! `--enable-nls'
! `--disable-nls'
!      The `--enable-nls' option enables Native Language Support (NLS),
       which lets GCC output diagnostics in languages other than American
       English.  Native Language Support is enabled by default if not
!      doing a canadian cross build.  The `--disable-nls' option disables
       NLS.
  
! `--with-included-gettext'
!      If NLS is enabled, the `--with-included-gettext' option causes the
!      build procedure to prefer its copy of GNU `gettext'.
  
! `--with-catgets'
!      If NLS is enabled, and if the host lacks `gettext' but has the
!      inferior `catgets' interface, the GCC build procedure normally
!      ignores `catgets' and instead uses GCC's copy of the GNU `gettext'
!      library.  The `--with-catgets' option causes the build procedure
!      to use the host's `catgets' in this situation.
  
! `--with-libiconv-prefix=DIR'
!      Search for libiconv header files in `DIR/include' and libiconv
!      library files in `DIR/lib'.
  
! `--enable-obsolete'
       Enable configuration for an obsoleted system.  If you attempt to
       configure GCC for a system (build, host, or target) which has been
       obsoleted, and you do not specify this flag, configure will halt
       with an error message.
  
!      All support for systems which have been obsoleted in one release
!      of GCC is removed entirely in the next major release, unless
!      someone steps forward to maintain the port.
  
! `--enable-decimal-float'
! `--enable-decimal-float=yes'
! `--enable-decimal-float=no'
! `--enable-decimal-float=bid'
! `--enable-decimal-float=dpd'
! `--disable-decimal-float'
       Enable (or disable) support for the C decimal floating point
       extension that is in the IEEE 754-2008 standard.  This is enabled
       by default only on PowerPC, i386, and x86_64 GNU/Linux systems.
       Other systems may also support it, but require the user to
       specifically enable it.  You can optionally control which decimal
!      floating point format is used (either `bid' or `dpd').  The `bid'
       (binary integer decimal) format is default on i386 and x86_64
!      systems, and the `dpd' (densely packed decimal) format is default
       on PowerPC systems.
  
! `--enable-fixed-point'
! `--disable-fixed-point'
       Enable (or disable) support for C fixed-point arithmetic.  This
       option is enabled by default for some targets (such as MIPS) which
       have hardware-support for fixed-point operations.  On other
       targets, you may enable this option manually.
  
! `--with-long-double-128'
!      Specify if `long double' type should be 128-bit by default on
       selected GNU/Linux architectures.  If using
!      `--without-long-double-128', `long double' will be by default
!      64-bit, the same as `double' type.  When neither of these
!      configure options are used, the default will be 128-bit `long
!      double' when built against GNU C Library 2.4 and later, 64-bit
!      `long double' otherwise.
  
! `--with-gmp=PATHNAME'
! `--with-gmp-include=PATHNAME'
! `--with-gmp-lib=PATHNAME'
! `--with-mpfr=PATHNAME'
! `--with-mpfr-include=PATHNAME'
! `--with-mpfr-lib=PATHNAME'
! `--with-mpc=PATHNAME'
! `--with-mpc-include=PATHNAME'
! `--with-mpc-lib=PATHNAME'
       If you want to build GCC but do not have the GMP library, the MPFR
       library and/or the MPC library installed in a standard location and
       do not have their sources present in the GCC source tree then you
       can explicitly specify the directory where they are installed
!      (`--with-gmp=GMPINSTALLDIR', `--with-mpfr=MPFRINSTALLDIR',
!      `--with-mpc=MPCINSTALLDIR').  The `--with-gmp=GMPINSTALLDIR'
!      option is shorthand for `--with-gmp-lib=GMPINSTALLDIR/lib' and
!      `--with-gmp-include=GMPINSTALLDIR/include'.  Likewise the
!      `--with-mpfr=MPFRINSTALLDIR' option is shorthand for
!      `--with-mpfr-lib=MPFRINSTALLDIR/lib' and
!      `--with-mpfr-include=MPFRINSTALLDIR/include', also the
!      `--with-mpc=MPCINSTALLDIR' option is shorthand for
!      `--with-mpc-lib=MPCINSTALLDIR/lib' and
!      `--with-mpc-include=MPCINSTALLDIR/include'.  If these shorthand
       assumptions are not correct, you can use the explicit include and
       lib options directly.  You might also need to ensure the shared
       libraries can be found by the dynamic linker when building and
       using GCC, for example by setting the runtime shared library path
!      variable (`LD_LIBRARY_PATH' on GNU/Linux and Solaris systems).
  
       These flags are applicable to the host platform only.  When
       building a cross compiler, they will not be used to configure
       target libraries.
  
! `--with-isl=PATHNAME'
! `--with-isl-include=PATHNAME'
! `--with-isl-lib=PATHNAME'
!      If you do not have the ISL library installed in a standard
!      location and you want to build GCC, you can explicitly specify the
!      directory where it is installed (`--with-isl=ISLINSTALLDIR'). The
!      `--with-isl=ISLINSTALLDIR' option is shorthand for
!      `--with-isl-lib=ISLINSTALLDIR/lib' and
!      `--with-isl-include=ISLINSTALLDIR/include'. If this shorthand
!      assumption is not correct, you can use the explicit include and
!      lib options directly.
  
       These flags are applicable to the host platform only.  When
       building a cross compiler, they will not be used to configure
       target libraries.
  
! `--with-host-libstdcxx=LINKER-ARGS'
       If you are linking with a static copy of PPL, you can use this
       option to specify how the linker should find the standard C++
!      library used internally by PPL.  Typical values of LINKER-ARGS
!      might be `-lstdc++' or `-Wl,-Bstatic,-lstdc++,-Bdynamic -lm'.  If
!      you are linking with a shared copy of PPL, you probably do not
!      need this option; shared library dependencies will cause the
!      linker to search for the standard C++ library automatically.
  
! `--with-stage1-ldflags=FLAGS'
       This option may be used to set linker flags to be used when linking
!      stage 1 of GCC.  These are also used when linking GCC if
!      configured with `--disable-bootstrap'.  By default no special
!      flags are used.
  
! `--with-stage1-libs=LIBS'
       This option may be used to set libraries to be used when linking
!      stage 1 of GCC.  These are also used when linking GCC if
!      configured with `--disable-bootstrap'.  The default is the
!      argument to `--with-host-libstdcxx', if specified.
  
! `--with-boot-ldflags=FLAGS'
       This option may be used to set linker flags to be used when linking
!      stage 2 and later when bootstrapping GCC.  If neither
       -with-boot-libs nor -with-host-libstdcxx is set to a value, then
!      the default is `-static-libstdc++ -static-libgcc'.
  
! `--with-boot-libs=LIBS'
       This option may be used to set libraries to be used when linking
!      stage 2 and later when bootstrapping GCC.  The default is the
!      argument to `--with-host-libstdcxx', if specified.
  
! `--with-debug-prefix-map=MAP'
!      Convert source directory names using `-fdebug-prefix-map' when
!      building runtime libraries.  `MAP' is a space-separated list of
!      maps of the form `OLD=NEW'.
  
! `--enable-linker-build-id'
!      Tells GCC to pass `--build-id' option to the linker for all final
!      links (links performed without the `-r' or `--relocatable'
!      option), if the linker supports it.  If you specify
!      `--enable-linker-build-id', but your linker does not support
!      `--build-id' option, a warning is issued and the
!      `--enable-linker-build-id' option is ignored.  The default is off.
  
! `--with-linker-hash-style=CHOICE'
!      Tells GCC to pass `--hash-style=CHOICE' option to the linker for
!      all final links. CHOICE can be one of `sysv', `gnu', and `both'
!      where `sysv' is the default.
  
! `--enable-gnu-unique-object'
! `--disable-gnu-unique-object'
       Tells GCC to use the gnu_unique_object relocation for C++ template
       static data members and inline function local statics.  Enabled by
!      default for a toolchain with an assembler that accepts it and
!      GLIBC 2.11 or above, otherwise disabled.
  
! `--with-diagnostics-color=CHOICE'
!      Tells GCC to use CHOICE as the default for `-fdiagnostics-color='
!      option (if not used explicitly on the command line).  CHOICE can
!      be one of `never', `auto', `always', and `auto-if-env' where
!      `auto' is the default.  `auto-if-env' means that
!      `-fdiagnostics-color=auto' will be the default if `GCC_COLORS' is
!      present and non-empty in the environment, and
!      `-fdiagnostics-color=never' otherwise.
  
! `--enable-lto'
! `--disable-lto'
!      Enable support for link-time optimization (LTO).  This is enabled
!      by default, and may be disabled using `--disable-lto'.
  
! `--enable-linker-plugin-configure-flags=FLAGS'
! `--enable-linker-plugin-flags=FLAGS'
       By default, linker plugins (such as the LTO plugin) are built for
       the host system architecture.  For the case that the linker has a
       different (but run-time compatible) architecture, these flags can
       be specified to build plugins that are compatible to the linker.
       For example, if you are building GCC for a 64-bit x86_64
!      (`x86_64-unknown-linux-gnu') host system, but have a 32-bit x86
!      GNU/Linux (`i686-pc-linux-gnu') linker executable (which is
       executable on the former system), you can configure GCC as follows
       for getting compatible linker plugins:
  
--- 1385,1679 ----
       affects sparc-linux, powerpc-linux, x86-linux, mips-linux and
       s390-linux.
  
! '--enable-secureplt'
!      This option enables '-msecure-plt' by default for powerpc-linux.
       *Note RS/6000 and PowerPC Options: (gcc)RS/6000 and PowerPC
       Options,
  
! '--enable-cld'
!      This option enables '-mcld' by default for 32-bit x86 targets.
       *Note i386 and x86-64 Options: (gcc)i386 and x86-64 Options,
  
! '--enable-win32-registry'
! '--enable-win32-registry=KEY'
! '--disable-win32-registry'
!      The '--enable-win32-registry' option enables Microsoft
       Windows-hosted GCC to look up installations paths in the registry
       using the following key:
  
!           HKEY_LOCAL_MACHINE\SOFTWARE\Free Software Foundation\KEY
  
       KEY defaults to GCC version number, and can be overridden by the
!      '--enable-win32-registry=KEY' option.  Vendors and distributors who
!      use custom installers are encouraged to provide a different key,
!      perhaps one comprised of vendor name and GCC version number, to
!      avoid conflict with existing installations.  This feature is
       enabled by default, and can be disabled by
!      '--disable-win32-registry' option.  This option has no effect on
       the other hosts.
  
! '--nfp'
       Specify that the machine does not have a floating point unit.  This
!      option only applies to 'm68k-sun-sunosN'.  On any other system,
!      '--nfp' has no effect.
  
! '--enable-werror'
! '--disable-werror'
! '--enable-werror=yes'
! '--enable-werror=no'
       When you specify this option, it controls whether certain files in
!      the compiler are built with '-Werror' in bootstrap stage2 and
!      later.  If you don't specify it, '-Werror' is turned on for the
       main development trunk.  However it defaults to off for release
       branches and final releases.  The specific files which get
!      '-Werror' are controlled by the Makefiles.
  
! '--enable-checking'
! '--enable-checking=LIST'
       When you specify this option, the compiler is built to perform
!      internal consistency checks of the requested complexity.  This does
!      not change the generated code, but adds error checking within the
!      compiler.  This will slow down the compiler and may only work
!      properly if you are building the compiler with GCC.  This is 'yes'
!      by default when building from SVN or snapshots, but 'release' for
!      releases.  The default for building the stage1 compiler is 'yes'.
       More control over the checks may be had by specifying LIST.  The
!      categories of checks available are 'yes' (most common checks
!      'assert,misc,tree,gc,rtlflag,runtime'), 'no' (no checks at all),
!      'all' (all but 'valgrind'), 'release' (cheapest checks
!      'assert,runtime') or 'none' (same as 'no').  Individual checks can
!      be enabled with these flags 'assert', 'df', 'fold', 'gc', 'gcac'
!      'misc', 'rtl', 'rtlflag', 'runtime', 'tree', and 'valgrind'.
  
!      The 'valgrind' check requires the external 'valgrind' simulator,
!      available from <http://valgrind.org/>.  The 'df', 'rtl', 'gcac' and
!      'valgrind' checks are very expensive.  To disable all checking,
!      '--disable-checking' or '--enable-checking=none' must be explicitly
!      requested.  Disabling assertions will make the compiler and runtime
!      slightly faster but increase the risk of undetected internal errors
!      causing wrong code to be generated.
  
! '--disable-stage1-checking'
! '--enable-stage1-checking'
! '--enable-stage1-checking=LIST'
!      If no '--enable-checking' option is specified the stage1 compiler
!      will be built with 'yes' checking enabled, otherwise the stage1
!      checking flags are the same as specified by '--enable-checking'.
       To build the stage1 compiler with different checking options use
!      '--enable-stage1-checking'.  The list of checking options is the
!      same as for '--enable-checking'.  If your system is too slow or too
!      small to bootstrap a released compiler with checking for stage1
!      enabled, you can use '--disable-stage1-checking' to disable
       checking for the stage1 compiler.
  
! '--enable-coverage'
! '--enable-coverage=LEVEL'
       With this option, the compiler is built to collect self coverage
       information, every time it is run.  This is for internal
       development purposes, and only works when the compiler is being
       built with gcc.  The LEVEL argument controls whether the compiler
!      is built optimized or not, values are 'opt' and 'noopt'.  For
!      coverage analysis you want to disable optimization, for performance
!      analysis you want to enable optimization.  When coverage is
!      enabled, the default level is without optimization.
  
! '--enable-gather-detailed-mem-stats'
       When this option is specified more detailed information on memory
       allocation is gathered.  This information is printed when using
!      '-fmem-report'.
  
! '--enable-nls'
! '--disable-nls'
!      The '--enable-nls' option enables Native Language Support (NLS),
       which lets GCC output diagnostics in languages other than American
       English.  Native Language Support is enabled by default if not
!      doing a canadian cross build.  The '--disable-nls' option disables
       NLS.
  
! '--with-included-gettext'
!      If NLS is enabled, the '--with-included-gettext' option causes the
!      build procedure to prefer its copy of GNU 'gettext'.
  
! '--with-catgets'
!      If NLS is enabled, and if the host lacks 'gettext' but has the
!      inferior 'catgets' interface, the GCC build procedure normally
!      ignores 'catgets' and instead uses GCC's copy of the GNU 'gettext'
!      library.  The '--with-catgets' option causes the build procedure to
!      use the host's 'catgets' in this situation.
  
! '--with-libiconv-prefix=DIR'
!      Search for libiconv header files in 'DIR/include' and libiconv
!      library files in 'DIR/lib'.
  
! '--enable-obsolete'
       Enable configuration for an obsoleted system.  If you attempt to
       configure GCC for a system (build, host, or target) which has been
       obsoleted, and you do not specify this flag, configure will halt
       with an error message.
  
!      All support for systems which have been obsoleted in one release of
!      GCC is removed entirely in the next major release, unless someone
!      steps forward to maintain the port.
  
! '--enable-decimal-float'
! '--enable-decimal-float=yes'
! '--enable-decimal-float=no'
! '--enable-decimal-float=bid'
! '--enable-decimal-float=dpd'
! '--disable-decimal-float'
       Enable (or disable) support for the C decimal floating point
       extension that is in the IEEE 754-2008 standard.  This is enabled
       by default only on PowerPC, i386, and x86_64 GNU/Linux systems.
       Other systems may also support it, but require the user to
       specifically enable it.  You can optionally control which decimal
!      floating point format is used (either 'bid' or 'dpd').  The 'bid'
       (binary integer decimal) format is default on i386 and x86_64
!      systems, and the 'dpd' (densely packed decimal) format is default
       on PowerPC systems.
  
! '--enable-fixed-point'
! '--disable-fixed-point'
       Enable (or disable) support for C fixed-point arithmetic.  This
       option is enabled by default for some targets (such as MIPS) which
       have hardware-support for fixed-point operations.  On other
       targets, you may enable this option manually.
  
! '--with-long-double-128'
!      Specify if 'long double' type should be 128-bit by default on
       selected GNU/Linux architectures.  If using
!      '--without-long-double-128', 'long double' will be by default
!      64-bit, the same as 'double' type.  When neither of these configure
!      options are used, the default will be 128-bit 'long double' when
!      built against GNU C Library 2.4 and later, 64-bit 'long double'
!      otherwise.
  
! '--with-gmp=PATHNAME'
! '--with-gmp-include=PATHNAME'
! '--with-gmp-lib=PATHNAME'
! '--with-mpfr=PATHNAME'
! '--with-mpfr-include=PATHNAME'
! '--with-mpfr-lib=PATHNAME'
! '--with-mpc=PATHNAME'
! '--with-mpc-include=PATHNAME'
! '--with-mpc-lib=PATHNAME'
       If you want to build GCC but do not have the GMP library, the MPFR
       library and/or the MPC library installed in a standard location and
       do not have their sources present in the GCC source tree then you
       can explicitly specify the directory where they are installed
!      ('--with-gmp=GMPINSTALLDIR', '--with-mpfr=MPFRINSTALLDIR',
!      '--with-mpc=MPCINSTALLDIR').  The '--with-gmp=GMPINSTALLDIR' option
!      is shorthand for '--with-gmp-lib=GMPINSTALLDIR/lib' and
!      '--with-gmp-include=GMPINSTALLDIR/include'.  Likewise the
!      '--with-mpfr=MPFRINSTALLDIR' option is shorthand for
!      '--with-mpfr-lib=MPFRINSTALLDIR/lib' and
!      '--with-mpfr-include=MPFRINSTALLDIR/include', also the
!      '--with-mpc=MPCINSTALLDIR' option is shorthand for
!      '--with-mpc-lib=MPCINSTALLDIR/lib' and
!      '--with-mpc-include=MPCINSTALLDIR/include'.  If these shorthand
       assumptions are not correct, you can use the explicit include and
       lib options directly.  You might also need to ensure the shared
       libraries can be found by the dynamic linker when building and
       using GCC, for example by setting the runtime shared library path
!      variable ('LD_LIBRARY_PATH' on GNU/Linux and Solaris systems).
  
       These flags are applicable to the host platform only.  When
       building a cross compiler, they will not be used to configure
       target libraries.
  
! '--with-isl=PATHNAME'
! '--with-isl-include=PATHNAME'
! '--with-isl-lib=PATHNAME'
!      If you do not have the ISL library installed in a standard location
!      and you want to build GCC, you can explicitly specify the directory
!      where it is installed ('--with-isl=ISLINSTALLDIR').  The
!      '--with-isl=ISLINSTALLDIR' option is shorthand for
!      '--with-isl-lib=ISLINSTALLDIR/lib' and
!      '--with-isl-include=ISLINSTALLDIR/include'.  If this shorthand
!      assumption is not correct, you can use the explicit include and lib
!      options directly.
  
       These flags are applicable to the host platform only.  When
       building a cross compiler, they will not be used to configure
       target libraries.
  
! '--with-host-libstdcxx=LINKER-ARGS'
       If you are linking with a static copy of PPL, you can use this
       option to specify how the linker should find the standard C++
!      library used internally by PPL. Typical values of LINKER-ARGS might
!      be '-lstdc++' or '-Wl,-Bstatic,-lstdc++,-Bdynamic -lm'.  If you are
!      linking with a shared copy of PPL, you probably do not need this
!      option; shared library dependencies will cause the linker to search
!      for the standard C++ library automatically.
  
! '--with-stage1-ldflags=FLAGS'
       This option may be used to set linker flags to be used when linking
!      stage 1 of GCC. These are also used when linking GCC if configured
!      with '--disable-bootstrap'.  By default no special flags are used.
  
! '--with-stage1-libs=LIBS'
       This option may be used to set libraries to be used when linking
!      stage 1 of GCC. These are also used when linking GCC if configured
!      with '--disable-bootstrap'.  The default is the argument to
!      '--with-host-libstdcxx', if specified.
  
! '--with-boot-ldflags=FLAGS'
       This option may be used to set linker flags to be used when linking
!      stage 2 and later when bootstrapping GCC. If neither
       -with-boot-libs nor -with-host-libstdcxx is set to a value, then
!      the default is '-static-libstdc++ -static-libgcc'.
  
! '--with-boot-libs=LIBS'
       This option may be used to set libraries to be used when linking
!      stage 2 and later when bootstrapping GCC. The default is the
!      argument to '--with-host-libstdcxx', if specified.
  
! '--with-debug-prefix-map=MAP'
!      Convert source directory names using '-fdebug-prefix-map' when
!      building runtime libraries.  'MAP' is a space-separated list of
!      maps of the form 'OLD=NEW'.
  
! '--enable-linker-build-id'
!      Tells GCC to pass '--build-id' option to the linker for all final
!      links (links performed without the '-r' or '--relocatable' option),
!      if the linker supports it.  If you specify
!      '--enable-linker-build-id', but your linker does not support
!      '--build-id' option, a warning is issued and the
!      '--enable-linker-build-id' option is ignored.  The default is off.
  
! '--with-linker-hash-style=CHOICE'
!      Tells GCC to pass '--hash-style=CHOICE' option to the linker for
!      all final links.  CHOICE can be one of 'sysv', 'gnu', and 'both'
!      where 'sysv' is the default.
  
! '--enable-gnu-unique-object'
! '--disable-gnu-unique-object'
       Tells GCC to use the gnu_unique_object relocation for C++ template
       static data members and inline function local statics.  Enabled by
!      default for a toolchain with an assembler that accepts it and GLIBC
!      2.11 or above, otherwise disabled.
  
! '--with-diagnostics-color=CHOICE'
!      Tells GCC to use CHOICE as the default for '-fdiagnostics-color='
!      option (if not used explicitly on the command line).  CHOICE can be
!      one of 'never', 'auto', 'always', and 'auto-if-env' where 'auto' is
!      the default.  'auto-if-env' means that '-fdiagnostics-color=auto'
!      will be the default if 'GCC_COLORS' is present and non-empty in the
!      environment, and '-fdiagnostics-color=never' otherwise.
  
! '--enable-lto'
! '--disable-lto'
!      Enable support for link-time optimization (LTO). This is enabled by
!      default, and may be disabled using '--disable-lto'.
  
! '--enable-linker-plugin-configure-flags=FLAGS'
! '--enable-linker-plugin-flags=FLAGS'
       By default, linker plugins (such as the LTO plugin) are built for
       the host system architecture.  For the case that the linker has a
       different (but run-time compatible) architecture, these flags can
       be specified to build plugins that are compatible to the linker.
       For example, if you are building GCC for a 64-bit x86_64
!      ('x86_64-unknown-linux-gnu') host system, but have a 32-bit x86
!      GNU/Linux ('i686-pc-linux-gnu') linker executable (which is
       executable on the former system), you can configure GCC as follows
       for getting compatible linker plugins:
  
*************** option.
*** 1702,1723 ****
                --enable-linker-plugin-configure-flags=--host=i686-pc-linux-gnu \
                --enable-linker-plugin-flags='CC=gcc\ -m32\ -Wl,-rpath,[...]/i686-pc-linux-gnu/lib'
  
! `--with-plugin-ld=PATHNAME'
       Enable an alternate linker to be used at link-time optimization
!      (LTO) link time when `-fuse-linker-plugin' is enabled.  This
!      linker should have plugin support such as gold starting with
!      version 2.20 or GNU ld starting with version 2.21.  See
!      `-fuse-linker-plugin' for details.
  
! `--enable-canonical-system-headers'
! `--disable-canonical-system-headers'
!      Enable system header path canonicalization for `libcpp'.  This can
       produce shorter header file paths in diagnostics and dependency
!      output files, but these changed header paths may conflict with
!      some compilation environments.  Enabled by default, and may be
!      disabled using `--disable-canonical-system-headers'.
  
! `--with-glibc-version=MAJOR.MINOR'
       Tell GCC that when the GNU C Library (glibc) is used on the target
       it will be version MAJOR.MINOR or later.  Normally this can be
       detected from the C library's header files, but this option may be
--- 1682,1703 ----
                --enable-linker-plugin-configure-flags=--host=i686-pc-linux-gnu \
                --enable-linker-plugin-flags='CC=gcc\ -m32\ -Wl,-rpath,[...]/i686-pc-linux-gnu/lib'
  
! '--with-plugin-ld=PATHNAME'
       Enable an alternate linker to be used at link-time optimization
!      (LTO) link time when '-fuse-linker-plugin' is enabled.  This linker
!      should have plugin support such as gold starting with version 2.20
!      or GNU ld starting with version 2.21.  See '-fuse-linker-plugin'
!      for details.
  
! '--enable-canonical-system-headers'
! '--disable-canonical-system-headers'
!      Enable system header path canonicalization for 'libcpp'.  This can
       produce shorter header file paths in diagnostics and dependency
!      output files, but these changed header paths may conflict with some
!      compilation environments.  Enabled by default, and may be disabled
!      using '--disable-canonical-system-headers'.
  
! '--with-glibc-version=MAJOR.MINOR'
       Tell GCC that when the GNU C Library (glibc) is used on the target
       it will be version MAJOR.MINOR or later.  Normally this can be
       detected from the C library's header files, but this option may be
*************** option.
*** 1729,1743 ****
       glibc.  However, such configurations may not work well as not all
       the relevant configuration in GCC is on a per-multilib basis.
  
! `--enable-as-accelerator-for=TARGET'
!      Build as offload target compiler. Specify offload host triple by
       TARGET.
  
! `--enable-offload-targets=TARGET1[=PATH1],...,TARGETN[=PATHN]'
       Enable offloading to targets TARGET1, ..., TARGETN.  Offload
       compilers are expected to be already installed.  Default search
!      path for them is `EXEC-PREFIX', but it can be changed by
!      specifying paths PATH1, ..., PATHN.
  
            % SRCDIR/configure \
                --enable-offload-target=i686-unknown-linux-gnu=/path/to/i686/compiler,x86_64-pc-linux-gnu
--- 1709,1723 ----
       glibc.  However, such configurations may not work well as not all
       the relevant configuration in GCC is on a per-multilib basis.
  
! '--enable-as-accelerator-for=TARGET'
!      Build as offload target compiler.  Specify offload host triple by
       TARGET.
  
! '--enable-offload-targets=TARGET1[=PATH1],...,TARGETN[=PATHN]'
       Enable offloading to targets TARGET1, ..., TARGETN.  Offload
       compilers are expected to be already installed.  Default search
!      path for them is 'EXEC-PREFIX', but it can be changed by specifying
!      paths PATH1, ..., PATHN.
  
            % SRCDIR/configure \
                --enable-offload-target=i686-unknown-linux-gnu=/path/to/i686/compiler,x86_64-pc-linux-gnu
*************** Cross-Compiler-Specific Options
*** 1747,2125 ****
  
  The following options only apply to building cross compilers.
  
! `--with-sysroot'
! `--with-sysroot=DIR'
       Tells GCC to consider DIR as the root of a tree that contains (a
       subset of) the root filesystem of the target operating system.
       Target system headers, libraries and run-time object files will be
       searched for in there.  More specifically, this acts as if
!      `--sysroot=DIR' was added to the default options of the built
       compiler.  The specified directory is not copied into the install
!      tree, unlike the options `--with-headers' and `--with-libs' that
!      this option obsoletes.  The default value, in case
!      `--with-sysroot' is not given an argument, is
!      `${gcc_tooldir}/sys-root'.  If the specified directory is a
!      subdirectory of `${exec_prefix}', then it will be found relative to
!      the GCC binaries if the installation tree is moved.
  
       This option affects the system root for the compiler used to build
       target libraries (which runs on the build system) and the compiler
!      newly installed with `make install'; it does not affect the
       compiler which is used to build GCC itself.
  
!      If you specify the `--with-native-system-header-dir=DIRNAME'
!      option then the compiler will search that directory within DIRNAME
!      for native system headers rather than the default `/usr/include'.
  
! `--with-build-sysroot'
! `--with-build-sysroot=DIR'
!      Tells GCC to consider DIR as the system root (see
!      `--with-sysroot') while building target libraries, instead of the
!      directory specified with `--with-sysroot'.  This option is only
!      useful when you are already using `--with-sysroot'.  You can use
!      `--with-build-sysroot' when you are configuring with `--prefix'
!      set to a directory that is different from the one in which you are
!      installing GCC and your target libraries.
  
       This option affects the system root for the compiler used to build
       target libraries (which runs on the build system); it does not
       affect the compiler which is used to build GCC itself.
  
!      If you specify the `--with-native-system-header-dir=DIRNAME'
!      option then the compiler will search that directory within DIRNAME
!      for native system headers rather than the default `/usr/include'.
  
! `--with-headers'
! `--with-headers=DIR'
!      Deprecated in favor of `--with-sysroot'.  Specifies that target
       headers are available when building a cross compiler.  The DIR
       argument specifies a directory which has the target include files.
!      These include files will be copied into the `gcc' install
       directory.  _This option with the DIR argument is required_ when
!      building a cross compiler, if `PREFIX/TARGET/sys-include' doesn't
!      pre-exist.  If `PREFIX/TARGET/sys-include' does pre-exist, the DIR
!      argument may be omitted.  `fixincludes' will be run on these files
       to make them compatible with GCC.
  
! `--without-headers'
       Tells GCC not use any target headers from a libc when building a
       cross compiler.  When crossing to GNU/Linux, you need the headers
       so GCC can build the exception handling for libgcc.
  
! `--with-libs'
! `--with-libs="DIR1 DIR2 ... DIRN"'
!      Deprecated in favor of `--with-sysroot'.  Specifies a list of
       directories which contain the target runtime libraries.  These
!      libraries will be copied into the `gcc' install directory.  If the
       directory list is omitted, this option has no effect.
  
! `--with-newlib'
!      Specifies that `newlib' is being used as the target C library.
!      This causes `__eprintf' to be omitted from `libgcc.a' on the
!      assumption that it will be provided by `newlib'.
  
! `--with-avrlibc'
!      Specifies that `AVR-Libc' is being used as the target C library.
!      This causes float support functions like `__addsf3' to be omitted
!      from `libgcc.a' on the assumption that it will be provided by
!      `libm.a'.  For more technical details, cf. PR54461.  This option
       is only supported for the AVR target.  It is not supported for
       RTEMS configurations, which currently use newlib.  The option is
       supported since version 4.7.2 and is the default in 4.8.0 and
       newer.
  
! `--with-nds32-lib=LIBRARY'
!      Specifies that LIBRARY setting is used for building `libgcc.a'.
!      Currently, the valid LIBRARY is `newlib' or `mculib'.  This option
       is only supported for the NDS32 target.
  
! `--with-build-time-tools=DIR'
!      Specifies where to find the set of target tools (assembler,
!      linker, etc.)  that will be used while building GCC itself.  This
!      option can be useful if the directory layouts are different
!      between the system you are building GCC on, and the system where
!      you will deploy it.
  
!      For example, on an `ia64-hp-hpux' system, you may have the GNU
!      assembler and linker in `/usr/bin', and the native tools in a
       different path, and build a toolchain that expects to find the
!      native tools in `/usr/bin'.
  
!      When you use this option, you should ensure that DIR includes
!      `ar', `as', `ld', `nm', `ranlib' and `strip' if necessary, and
!      possibly `objdump'.  Otherwise, GCC may use an inconsistent set of
!      tools.
  
  Java-Specific Options
  ---------------------
  
  The following option applies to the build of the Java front end.
  
! `--disable-libgcj'
       Specify that the run-time libraries used by GCJ should not be
       built.  This is useful in case you intend to use GCJ with some
       other run-time, or you're going to install it separately, or it
       just happens not to build on your particular machine.  In general,
!      if the Java front end is enabled, the GCJ libraries will be
!      enabled too, unless they're known to not work on the target
!      platform.  If GCJ is enabled but `libgcj' isn't built, you may
!      need to port it; in this case, before modifying the top-level
!      `configure.in' so that `libgcj' is enabled by default on this
!      platform, you may use `--enable-libgcj' to override the default.
! 
  
!    The following options apply to building `libgcj'.
  
  General Options
  ...............
  
! `--enable-java-maintainer-mode'
!      By default the `libjava' build will not attempt to compile the
!      `.java' source files to `.class'.  Instead, it will use the
!      `.class' files from the source tree.  If you use this option you
!      must have executables named `ecj1' and `gjavah' in your path for
!      use by the build.  You must use this option if you intend to
!      modify any `.java' files in `libjava'.
  
! `--with-java-home=DIRNAME'
!      This `libjava' option overrides the default value of the
!      `java.home' system property.  It is also used to set
!      `sun.boot.class.path' to `DIRNAME/lib/rt.jar'.  By default
!      `java.home' is set to `PREFIX' and `sun.boot.class.path' to
!      `DATADIR/java/libgcj-VERSION.jar'.
  
! `--with-ecj-jar=FILENAME'
       This option can be used to specify the location of an external jar
       file containing the Eclipse Java compiler.  A specially modified
!      version of this compiler is used by `gcj' to parse `.java' source
!      files.  If this option is given, the `libjava' build will create
!      and install an `ecj1' executable which uses this jar file at
       runtime.
  
!      If this option is not given, but an `ecj.jar' file is found in the
!      topmost source tree at configure time, then the `libgcj' build
!      will create and install `ecj1', and will also install the
!      discovered `ecj.jar' into a suitable place in the install tree.
  
!      If `ecj1' is not installed, then the user will have to supply one
!      on his path in order for `gcj' to properly parse `.java' source
       files.  A suitable jar is available from
!      `ftp://sourceware.org/pub/java/'.
  
! `--disable-getenv-properties'
!      Don't set system properties from `GCJ_PROPERTIES'.
  
! `--enable-hash-synchronization'
!      Use a global hash table for monitor locks.  Ordinarily, `libgcj''s
!      `configure' script automatically makes the correct choice for this
       option for your platform.  Only use this if you know you need the
       library to be configured differently.
  
! `--enable-interpreter'
       Enable the Java interpreter.  The interpreter is automatically
       enabled by default on all platforms that support it.  This option
!      is really only useful if you want to disable the interpreter
!      (using `--disable-interpreter').
  
! `--disable-java-net'
       Disable java.net.  This disables the native part of java.net only,
       using non-functional stubs for native method implementations.
  
! `--disable-jvmpi'
       Disable JVMPI support.
  
! `--disable-libgcj-bc'
       Disable BC ABI compilation of certain parts of libgcj.  By default,
!      some portions of libgcj are compiled with `-findirect-dispatch'
!      and `-fno-indirect-classes', allowing them to be overridden at
       run-time.
  
!      If `--disable-libgcj-bc' is specified, libgcj is built without
       these options.  This allows the compile-time linker to resolve
       dependencies when statically linking to libgcj.  However it makes
       it impossible to override the affected portions of libgcj at
       run-time.
  
! `--enable-reduced-reflection'
!      Build most of libgcj with `-freduced-reflection'.  This reduces
!      the size of libgcj at the expense of not being able to do accurate
       reflection on the classes it contains.  This option is safe if you
       know that code using libgcj will never use reflection on the
       standard runtime classes in libgcj (including using serialization,
       RMI or CORBA).
  
! `--with-ecos'
       Enable runtime eCos target support.
  
! `--without-libffi'
!      Don't use `libffi'.  This will disable the interpreter and JNI
!      support as well, as these require `libffi' to work.
  
! `--enable-libgcj-debug'
       Enable runtime debugging code.
  
! `--enable-libgcj-multifile'
!      If specified, causes all `.java' source files to be compiled into
!      `.class' files in one invocation of `gcj'.  This can speed up
!      build time, but is more resource-intensive.  If this option is
!      unspecified or disabled, `gcj' is invoked once for each `.java'
!      file to compile into a `.class' file.
! 
! `--with-libiconv-prefix=DIR'
!      Search for libiconv in `DIR/include' and `DIR/lib'.
  
! `--enable-sjlj-exceptions'
!      Force use of the `setjmp'/`longjmp'-based scheme for exceptions.
!      `configure' ordinarily picks the correct value based on the
!      platform.  Only use this option if you are sure you need a
!      different setting.
  
! `--with-system-zlib'
!      Use installed `zlib' rather than that included with GCC.
  
! `--with-win32-nlsapi=ansi, unicows or unicode'
!      Indicates how MinGW `libgcj' translates between UNICODE characters
       and the Win32 API.
  
! `--enable-java-home'
       If enabled, this creates a JPackage compatible SDK environment
       during install.  Note that if -enable-java-home is used,
       -with-arch-directory=ARCH must also be specified.
  
! `--with-arch-directory=ARCH'
!      Specifies the name to use for the `jre/lib/ARCH' directory in the
!      SDK environment created when -enable-java-home is passed. Typical
       names for this directory include i386, amd64, ia64, etc.
  
! `--with-os-directory=DIR'
!      Specifies the OS directory for the SDK include directory. This is
       set to auto detect, and is typically 'linux'.
  
! `--with-origin-name=NAME'
!      Specifies the JPackage origin name. This defaults to the 'gcj' in
       java-1.5.0-gcj.
  
! `--with-arch-suffix=SUFFIX'
!      Specifies the suffix for the sdk directory. Defaults to the empty
       string.  Examples include '.x86_64' in
       'java-1.5.0-gcj-1.5.0.0.x86_64'.
  
! `--with-jvm-root-dir=DIR'
       Specifies where to install the SDK. Default is $(prefix)/lib/jvm.
  
! `--with-jvm-jar-dir=DIR'
!      Specifies where to install jars. Default is
       $(prefix)/lib/jvm-exports.
  
! `--with-python-dir=DIR'
!      Specifies where to install the Python modules used for
!      aot-compile. DIR should not include the prefix used in
!      installation. For example, if the Python modules are to be
!      installed in /usr/lib/python2.5/site-packages, then
!      -with-python-dir=/lib/python2.5/site-packages should be passed. If
       this is not specified, then the Python modules are installed in
       $(prefix)/share/python.
  
! `--enable-aot-compile-rpm'
       Adds aot-compile-rpm to the list of installed scripts.
  
! `--enable-browser-plugin'
       Build the gcjwebplugin web browser plugin.
  
! `--enable-static-libjava'
!      Build static libraries in libjava. The default is to only build
       shared libraries.
  
!     `ansi'
!           Use the single-byte `char' and the Win32 A functions natively,
            translating to and from UNICODE when using these functions.
            If unspecified, this is the default.
  
!     `unicows'
!           Use the `WCHAR' and Win32 W functions natively.  Adds
!           `-lunicows' to `libgcj.spec' to link with `libunicows'.
!           `unicows.dll' needs to be deployed on Microsoft Windows 9X
!           machines running built executables.  `libunicows.a', an
!           open-source import library around Microsoft's `unicows.dll',
!           is obtained from `http://libunicows.sourceforge.net/', which
!           also gives details on getting `unicows.dll' from Microsoft.
  
!     `unicode'
!           Use the `WCHAR' and Win32 W functions natively.  Does _not_
!           add `-lunicows' to `libgcj.spec'.  The built executables will
            only run on Microsoft Windows NT and above.
  
  AWT-Specific Options
  ....................
  
! `--with-x'
       Use the X Window System.
  
! `--enable-java-awt=PEER(S)'
       Specifies the AWT peer library or libraries to build alongside
!      `libgcj'.  If this option is unspecified or disabled, AWT will be
!      non-functional.  Current valid values are `gtk' and `xlib'.
       Multiple libraries should be separated by a comma (i.e.
!      `--enable-java-awt=gtk,xlib').
  
! `--enable-gtk-cairo'
       Build the cairo Graphics2D implementation on GTK.
  
! `--enable-java-gc=TYPE'
!      Choose garbage collector.  Defaults to `boehm' if unspecified.
  
! `--disable-gtktest'
       Do not try to compile and run a test GTK+ program.
  
! `--disable-glibtest'
       Do not try to compile and run a test GLIB program.
  
! `--with-libart-prefix=PFX'
       Prefix where libart is installed (optional).
  
! `--with-libart-exec-prefix=PFX'
       Exec prefix where libart is installed (optional).
  
! `--disable-libarttest'
       Do not try to compile and run a test libart program.
  
- 
- Overriding `configure' test results
- ...................................
- 
- Sometimes, it might be necessary to override the result of some
- `configure' test, for example in order to ease porting to a new system
- or work around a bug in a test.  The toplevel `configure' script
- provides three variables for this:
- 
- `build_configargs'
-      The contents of this variable is passed to all build `configure'
-      scripts.
- 
- `host_configargs'
-      The contents of this variable is passed to all host `configure'
-      scripts.
- 
- `target_configargs'
-      The contents of this variable is passed to all target `configure'
-      scripts.
- 
- 
-    In order to avoid shell and `make' quoting issues for complex
- overrides, you can pass a setting for `CONFIG_SITE' and set variables
- in the site file.
- 
  
  File: gccinstall.info,  Node: Building,  Next: Testing,  Prev: Configuration,  Up: Installing GCC
  
  5 Building
  **********
  
!    Now that GCC is configured, you are ready to build the compiler and
  runtime libraries.
  
     Some commands executed when making the compiler may fail (return a
! nonzero status) and be ignored by `make'.  These failures, which are
  often due to files that were not found, are expected, and can safely be
  ignored.
  
--- 1727,2095 ----
  
  The following options only apply to building cross compilers.
  
! '--with-sysroot'
! '--with-sysroot=DIR'
       Tells GCC to consider DIR as the root of a tree that contains (a
       subset of) the root filesystem of the target operating system.
       Target system headers, libraries and run-time object files will be
       searched for in there.  More specifically, this acts as if
!      '--sysroot=DIR' was added to the default options of the built
       compiler.  The specified directory is not copied into the install
!      tree, unlike the options '--with-headers' and '--with-libs' that
!      this option obsoletes.  The default value, in case '--with-sysroot'
!      is not given an argument, is '${gcc_tooldir}/sys-root'.  If the
!      specified directory is a subdirectory of '${exec_prefix}', then it
!      will be found relative to the GCC binaries if the installation tree
!      is moved.
  
       This option affects the system root for the compiler used to build
       target libraries (which runs on the build system) and the compiler
!      newly installed with 'make install'; it does not affect the
       compiler which is used to build GCC itself.
  
!      If you specify the '--with-native-system-header-dir=DIRNAME' option
!      then the compiler will search that directory within DIRNAME for
!      native system headers rather than the default '/usr/include'.
  
! '--with-build-sysroot'
! '--with-build-sysroot=DIR'
!      Tells GCC to consider DIR as the system root (see '--with-sysroot')
!      while building target libraries, instead of the directory specified
!      with '--with-sysroot'.  This option is only useful when you are
!      already using '--with-sysroot'.  You can use '--with-build-sysroot'
!      when you are configuring with '--prefix' set to a directory that is
!      different from the one in which you are installing GCC and your
!      target libraries.
  
       This option affects the system root for the compiler used to build
       target libraries (which runs on the build system); it does not
       affect the compiler which is used to build GCC itself.
  
!      If you specify the '--with-native-system-header-dir=DIRNAME' option
!      then the compiler will search that directory within DIRNAME for
!      native system headers rather than the default '/usr/include'.
  
! '--with-headers'
! '--with-headers=DIR'
!      Deprecated in favor of '--with-sysroot'.  Specifies that target
       headers are available when building a cross compiler.  The DIR
       argument specifies a directory which has the target include files.
!      These include files will be copied into the 'gcc' install
       directory.  _This option with the DIR argument is required_ when
!      building a cross compiler, if 'PREFIX/TARGET/sys-include' doesn't
!      pre-exist.  If 'PREFIX/TARGET/sys-include' does pre-exist, the DIR
!      argument may be omitted.  'fixincludes' will be run on these files
       to make them compatible with GCC.
  
! '--without-headers'
       Tells GCC not use any target headers from a libc when building a
       cross compiler.  When crossing to GNU/Linux, you need the headers
       so GCC can build the exception handling for libgcc.
  
! '--with-libs'
! '--with-libs="DIR1 DIR2 ... DIRN"'
!      Deprecated in favor of '--with-sysroot'.  Specifies a list of
       directories which contain the target runtime libraries.  These
!      libraries will be copied into the 'gcc' install directory.  If the
       directory list is omitted, this option has no effect.
  
! '--with-newlib'
!      Specifies that 'newlib' is being used as the target C library.
!      This causes '__eprintf' to be omitted from 'libgcc.a' on the
!      assumption that it will be provided by 'newlib'.
  
! '--with-avrlibc'
!      Specifies that 'AVR-Libc' is being used as the target C library.
!      This causes float support functions like '__addsf3' to be omitted
!      from 'libgcc.a' on the assumption that it will be provided by
!      'libm.a'.  For more technical details, cf.  PR54461.  This option
       is only supported for the AVR target.  It is not supported for
       RTEMS configurations, which currently use newlib.  The option is
       supported since version 4.7.2 and is the default in 4.8.0 and
       newer.
  
! '--with-nds32-lib=LIBRARY'
!      Specifies that LIBRARY setting is used for building 'libgcc.a'.
!      Currently, the valid LIBRARY is 'newlib' or 'mculib'.  This option
       is only supported for the NDS32 target.
  
! '--with-build-time-tools=DIR'
!      Specifies where to find the set of target tools (assembler, linker,
!      etc.)  that will be used while building GCC itself.  This option
!      can be useful if the directory layouts are different between the
!      system you are building GCC on, and the system where you will
!      deploy it.
  
!      For example, on an 'ia64-hp-hpux' system, you may have the GNU
!      assembler and linker in '/usr/bin', and the native tools in a
       different path, and build a toolchain that expects to find the
!      native tools in '/usr/bin'.
  
!      When you use this option, you should ensure that DIR includes 'ar',
!      'as', 'ld', 'nm', 'ranlib' and 'strip' if necessary, and possibly
!      'objdump'.  Otherwise, GCC may use an inconsistent set of tools.
! 
! Overriding 'configure' test results
! ...................................
! 
! Sometimes, it might be necessary to override the result of some
! 'configure' test, for example in order to ease porting to a new system
! or work around a bug in a test.  The toplevel 'configure' script
! provides three variables for this:
! 
! 'build_configargs'
!      The contents of this variable is passed to all build 'configure'
!      scripts.
! 
! 'host_configargs'
!      The contents of this variable is passed to all host 'configure'
!      scripts.
! 
! 'target_configargs'
!      The contents of this variable is passed to all target 'configure'
!      scripts.
! 
!    In order to avoid shell and 'make' quoting issues for complex
! overrides, you can pass a setting for 'CONFIG_SITE' and set variables in
! the site file.
  
  Java-Specific Options
  ---------------------
  
  The following option applies to the build of the Java front end.
  
! '--disable-libgcj'
       Specify that the run-time libraries used by GCJ should not be
       built.  This is useful in case you intend to use GCJ with some
       other run-time, or you're going to install it separately, or it
       just happens not to build on your particular machine.  In general,
!      if the Java front end is enabled, the GCJ libraries will be enabled
!      too, unless they're known to not work on the target platform.  If
!      GCJ is enabled but 'libgcj' isn't built, you may need to port it;
!      in this case, before modifying the top-level 'configure.in' so that
!      'libgcj' is enabled by default on this platform, you may use
!      '--enable-libgcj' to override the default.
  
!    The following options apply to building 'libgcj'.
  
  General Options
  ...............
  
! '--enable-java-maintainer-mode'
!      By default the 'libjava' build will not attempt to compile the
!      '.java' source files to '.class'.  Instead, it will use the
!      '.class' files from the source tree.  If you use this option you
!      must have executables named 'ecj1' and 'gjavah' in your path for
!      use by the build.  You must use this option if you intend to modify
!      any '.java' files in 'libjava'.
  
! '--with-java-home=DIRNAME'
!      This 'libjava' option overrides the default value of the
!      'java.home' system property.  It is also used to set
!      'sun.boot.class.path' to 'DIRNAME/lib/rt.jar'.  By default
!      'java.home' is set to 'PREFIX' and 'sun.boot.class.path' to
!      'DATADIR/java/libgcj-VERSION.jar'.
  
! '--with-ecj-jar=FILENAME'
       This option can be used to specify the location of an external jar
       file containing the Eclipse Java compiler.  A specially modified
!      version of this compiler is used by 'gcj' to parse '.java' source
!      files.  If this option is given, the 'libjava' build will create
!      and install an 'ecj1' executable which uses this jar file at
       runtime.
  
!      If this option is not given, but an 'ecj.jar' file is found in the
!      topmost source tree at configure time, then the 'libgcj' build will
!      create and install 'ecj1', and will also install the discovered
!      'ecj.jar' into a suitable place in the install tree.
  
!      If 'ecj1' is not installed, then the user will have to supply one
!      on his path in order for 'gcj' to properly parse '.java' source
       files.  A suitable jar is available from
!      <ftp://sourceware.org/pub/java/>.
  
! '--disable-getenv-properties'
!      Don't set system properties from 'GCJ_PROPERTIES'.
  
! '--enable-hash-synchronization'
!      Use a global hash table for monitor locks.  Ordinarily, 'libgcj''s
!      'configure' script automatically makes the correct choice for this
       option for your platform.  Only use this if you know you need the
       library to be configured differently.
  
! '--enable-interpreter'
       Enable the Java interpreter.  The interpreter is automatically
       enabled by default on all platforms that support it.  This option
!      is really only useful if you want to disable the interpreter (using
!      '--disable-interpreter').
  
! '--disable-java-net'
       Disable java.net.  This disables the native part of java.net only,
       using non-functional stubs for native method implementations.
  
! '--disable-jvmpi'
       Disable JVMPI support.
  
! '--disable-libgcj-bc'
       Disable BC ABI compilation of certain parts of libgcj.  By default,
!      some portions of libgcj are compiled with '-findirect-dispatch' and
!      '-fno-indirect-classes', allowing them to be overridden at
       run-time.
  
!      If '--disable-libgcj-bc' is specified, libgcj is built without
       these options.  This allows the compile-time linker to resolve
       dependencies when statically linking to libgcj.  However it makes
       it impossible to override the affected portions of libgcj at
       run-time.
  
! '--enable-reduced-reflection'
!      Build most of libgcj with '-freduced-reflection'.  This reduces the
!      size of libgcj at the expense of not being able to do accurate
       reflection on the classes it contains.  This option is safe if you
       know that code using libgcj will never use reflection on the
       standard runtime classes in libgcj (including using serialization,
       RMI or CORBA).
  
! '--with-ecos'
       Enable runtime eCos target support.
  
! '--without-libffi'
!      Don't use 'libffi'.  This will disable the interpreter and JNI
!      support as well, as these require 'libffi' to work.
  
! '--enable-libgcj-debug'
       Enable runtime debugging code.
  
! '--enable-libgcj-multifile'
!      If specified, causes all '.java' source files to be compiled into
!      '.class' files in one invocation of 'gcj'.  This can speed up build
!      time, but is more resource-intensive.  If this option is
!      unspecified or disabled, 'gcj' is invoked once for each '.java'
!      file to compile into a '.class' file.
  
! '--with-libiconv-prefix=DIR'
!      Search for libiconv in 'DIR/include' and 'DIR/lib'.
  
! '--with-system-zlib'
!      Use installed 'zlib' rather than that included with GCC.
  
! '--with-win32-nlsapi=ansi, unicows or unicode'
!      Indicates how MinGW 'libgcj' translates between UNICODE characters
       and the Win32 API.
  
! '--enable-java-home'
       If enabled, this creates a JPackage compatible SDK environment
       during install.  Note that if -enable-java-home is used,
       -with-arch-directory=ARCH must also be specified.
  
! '--with-arch-directory=ARCH'
!      Specifies the name to use for the 'jre/lib/ARCH' directory in the
!      SDK environment created when -enable-java-home is passed.  Typical
       names for this directory include i386, amd64, ia64, etc.
  
! '--with-os-directory=DIR'
!      Specifies the OS directory for the SDK include directory.  This is
       set to auto detect, and is typically 'linux'.
  
! '--with-origin-name=NAME'
!      Specifies the JPackage origin name.  This defaults to the 'gcj' in
       java-1.5.0-gcj.
  
! '--with-arch-suffix=SUFFIX'
!      Specifies the suffix for the sdk directory.  Defaults to the empty
       string.  Examples include '.x86_64' in
       'java-1.5.0-gcj-1.5.0.0.x86_64'.
  
! '--with-jvm-root-dir=DIR'
       Specifies where to install the SDK. Default is $(prefix)/lib/jvm.
  
! '--with-jvm-jar-dir=DIR'
!      Specifies where to install jars.  Default is
       $(prefix)/lib/jvm-exports.
  
! '--with-python-dir=DIR'
!      Specifies where to install the Python modules used for aot-compile.
!      DIR should not include the prefix used in installation.  For
!      example, if the Python modules are to be installed in
!      /usr/lib/python2.5/site-packages, then
!      -with-python-dir=/lib/python2.5/site-packages should be passed.  If
       this is not specified, then the Python modules are installed in
       $(prefix)/share/python.
  
! '--enable-aot-compile-rpm'
       Adds aot-compile-rpm to the list of installed scripts.
  
! '--enable-browser-plugin'
       Build the gcjwebplugin web browser plugin.
  
! '--enable-static-libjava'
!      Build static libraries in libjava.  The default is to only build
       shared libraries.
  
!      'ansi'
!           Use the single-byte 'char' and the Win32 A functions natively,
            translating to and from UNICODE when using these functions.
            If unspecified, this is the default.
  
!      'unicows'
!           Use the 'WCHAR' and Win32 W functions natively.  Adds
!           '-lunicows' to 'libgcj.spec' to link with 'libunicows'.
!           'unicows.dll' needs to be deployed on Microsoft Windows 9X
!           machines running built executables.  'libunicows.a', an
!           open-source import library around Microsoft's 'unicows.dll',
!           is obtained from <http://libunicows.sourceforge.net/>, which
!           also gives details on getting 'unicows.dll' from Microsoft.
  
!      'unicode'
!           Use the 'WCHAR' and Win32 W functions natively.  Does _not_
!           add '-lunicows' to 'libgcj.spec'.  The built executables will
            only run on Microsoft Windows NT and above.
  
  AWT-Specific Options
  ....................
  
! '--with-x'
       Use the X Window System.
  
! '--enable-java-awt=PEER(S)'
       Specifies the AWT peer library or libraries to build alongside
!      'libgcj'.  If this option is unspecified or disabled, AWT will be
!      non-functional.  Current valid values are 'gtk' and 'xlib'.
       Multiple libraries should be separated by a comma (i.e.
!      '--enable-java-awt=gtk,xlib').
  
! '--enable-gtk-cairo'
       Build the cairo Graphics2D implementation on GTK.
  
! '--enable-java-gc=TYPE'
!      Choose garbage collector.  Defaults to 'boehm' if unspecified.
  
! '--disable-gtktest'
       Do not try to compile and run a test GTK+ program.
  
! '--disable-glibtest'
       Do not try to compile and run a test GLIB program.
  
! '--with-libart-prefix=PFX'
       Prefix where libart is installed (optional).
  
! '--with-libart-exec-prefix=PFX'
       Exec prefix where libart is installed (optional).
  
! '--disable-libarttest'
       Do not try to compile and run a test libart program.
  
  
  File: gccinstall.info,  Node: Building,  Next: Testing,  Prev: Configuration,  Up: Installing GCC
  
  5 Building
  **********
  
! Now that GCC is configured, you are ready to build the compiler and
  runtime libraries.
  
     Some commands executed when making the compiler may fail (return a
! nonzero status) and be ignored by 'make'.  These failures, which are
  often due to files that were not found, are expected, and can safely be
  ignored.
  
*************** ignored.
*** 2127,2136 ****
  Unless you are a GCC developer, you can generally ignore these warnings
  unless they cause compilation to fail.  Developers should attempt to fix
  any warnings encountered, however they can temporarily continue past
! warnings-as-errors by specifying the configure flag `--disable-werror'.
  
     On certain old systems, defining certain environment variables such
! as `CC' can interfere with the functioning of `make'.
  
     If you encounter seemingly strange errors when trying to build the
  compiler in a directory other than the source directory, it could be
--- 2097,2106 ----
  Unless you are a GCC developer, you can generally ignore these warnings
  unless they cause compilation to fail.  Developers should attempt to fix
  any warnings encountered, however they can temporarily continue past
! warnings-as-errors by specifying the configure flag '--disable-werror'.
  
     On certain old systems, defining certain environment variables such
! as 'CC' can interfere with the functioning of 'make'.
  
     If you encounter seemingly strange errors when trying to build the
  compiler in a directory other than the source directory, it could be
*************** because you have previously configured t
*** 2138,2157 ****
  directory.  Make sure you have done all the necessary preparations.
  
     If you build GCC on a BSD system using a directory stored in an old
! System V file system, problems may occur in running `fixincludes' if the
  System V file system doesn't support symbolic links.  These problems
! result in a failure to fix the declaration of `size_t' in
! `sys/types.h'.  If you find that `size_t' is a signed type and that
! type mismatches occur, this could be the cause.
  
     The solution is not to use such a directory for building GCC.
  
     Similarly, when building from SVN or snapshots, or if you modify
! `*.l' files, you need the Flex lexical analyzer generator installed.
! If you do not modify `*.l' files, releases contain the Flex-generated
! files and you do not need Flex installed to build them.  There is still
! one Flex-based lexical analyzer (part of the build machinery, not of
! GCC itself) that is used even if you only build the C front end.
  
     When building from SVN or snapshots, or if you modify Texinfo
  documentation, you need version 4.7 or later of Texinfo installed if you
--- 2108,2127 ----
  directory.  Make sure you have done all the necessary preparations.
  
     If you build GCC on a BSD system using a directory stored in an old
! System V file system, problems may occur in running 'fixincludes' if the
  System V file system doesn't support symbolic links.  These problems
! result in a failure to fix the declaration of 'size_t' in 'sys/types.h'.
! If you find that 'size_t' is a signed type and that type mismatches
! occur, this could be the cause.
  
     The solution is not to use such a directory for building GCC.
  
     Similarly, when building from SVN or snapshots, or if you modify
! '*.l' files, you need the Flex lexical analyzer generator installed.  If
! you do not modify '*.l' files, releases contain the Flex-generated files
! and you do not need Flex installed to build them.  There is still one
! Flex-based lexical analyzer (part of the build machinery, not of GCC
! itself) that is used even if you only build the C front end.
  
     When building from SVN or snapshots, or if you modify Texinfo
  documentation, you need version 4.7 or later of Texinfo installed if you
*************** documentation pre-built for the unmodifi
*** 2162,2171 ****
  ==============================
  
  For a native build, the default configuration is to perform a 3-stage
! bootstrap of the compiler when `make' is invoked.  This will build the
  entire GCC system and ensure that it compiles itself correctly.  It can
! be disabled with the `--disable-bootstrap' parameter to `configure',
! but bootstrapping is suggested because the compiler will be tested more
  completely and could also have better performance.
  
     The bootstrapping process will complete the following steps:
--- 2132,2141 ----
  ==============================
  
  For a native build, the default configuration is to perform a 3-stage
! bootstrap of the compiler when 'make' is invoked.  This will build the
  entire GCC system and ensure that it compiles itself correctly.  It can
! be disabled with the '--disable-bootstrap' parameter to 'configure', but
! bootstrapping is suggested because the compiler will be tested more
  completely and could also have better performance.
  
     The bootstrapping process will complete the following steps:
*************** completely and could also have better pe
*** 2180,2198 ****
  
     * Perform a comparison test of the stage2 and stage3 compilers.
  
!    * Build runtime libraries using the stage3 compiler from the
!      previous step.
! 
  
!    If you are short on disk space you might consider `make
  bootstrap-lean' instead.  The sequence of compilation is the same
  described above, but object files from the stage1 and stage2 of the
  3-stage bootstrap of the compiler are deleted as soon as they are no
  longer needed.
  
     If you wish to use non-default GCC flags when compiling the stage2
! and stage3 compilers, set `BOOT_CFLAGS' on the command line when doing
! `make'.  For example, if you want to save additional space during the
  bootstrap and in the final installation as well, you can build the
  compiler binaries without debugging information as in the following
  example.  This will save roughly 40% of disk space both for the
--- 2150,2167 ----
  
     * Perform a comparison test of the stage2 and stage3 compilers.
  
!    * Build runtime libraries using the stage3 compiler from the previous
!      step.
  
!    If you are short on disk space you might consider 'make
  bootstrap-lean' instead.  The sequence of compilation is the same
  described above, but object files from the stage1 and stage2 of the
  3-stage bootstrap of the compiler are deleted as soon as they are no
  longer needed.
  
     If you wish to use non-default GCC flags when compiling the stage2
! and stage3 compilers, set 'BOOT_CFLAGS' on the command line when doing
! 'make'.  For example, if you want to save additional space during the
  bootstrap and in the final installation as well, you can build the
  compiler binaries without debugging information as in the following
  example.  This will save roughly 40% of disk space both for the
*************** debugging information.)
*** 2201,2331 ****
  
       make BOOT_CFLAGS='-O' bootstrap
  
!    You can place non-default optimization flags into `BOOT_CFLAGS'; they
! are less well tested here than the default of `-g -O2', but should
! still work.  In a few cases, you may find that you need to specify
! special flags such as `-msoft-float' here to complete the bootstrap; or,
! if the native compiler miscompiles the stage1 compiler, you may need to
! work around this, by choosing `BOOT_CFLAGS' to avoid the parts of the
! stage1 compiler that were miscompiled, or by using `make bootstrap4' to
  increase the number of stages of bootstrap.
  
!    `BOOT_CFLAGS' does not apply to bootstrapped target libraries.
! Since these are always compiled with the compiler currently being
! bootstrapped, you can use `CFLAGS_FOR_TARGET' to modify their
  compilation flags, as for non-bootstrapped target libraries.  Again, if
  the native compiler miscompiles the stage1 compiler, you may need to
  work around this by avoiding non-working parts of the stage1 compiler.
! Use `STAGE1_TFLAGS' to this end.
  
!    If you used the flag `--enable-languages=...' to restrict the
! compilers to be built, only those you've actually enabled will be
! built.  This will of course only build those runtime libraries, for
! which the particular compiler has been built.  Please note, that
! re-defining `LANGUAGES' when calling `make' *does not* work anymore!
  
     If the comparison of stage2 and stage3 fails, this normally indicates
  that the stage2 compiler has compiled GCC incorrectly, and is therefore
  a potentially serious bug which you should investigate and report.  (On
  a few systems, meaningful comparison of object files is impossible; they
! always appear "different".  If you encounter this problem, you will
! need to disable comparison in the `Makefile'.)
  
     If you do not want to bootstrap your compiler, you can configure with
! `--disable-bootstrap'.  In particular cases, you may want to bootstrap
  your compiler even if the target system is not the same as the one you
  are building on: for example, you could build a
! `powerpc-unknown-linux-gnu' toolchain on a
! `powerpc64-unknown-linux-gnu' host.  In this case, pass
! `--enable-bootstrap' to the configure script.
  
!    `BUILD_CONFIG' can be used to bring in additional customization to
  the build.  It can be set to a whitespace-separated list of names.  For
! each such `NAME', top-level `config/`NAME'.mk' will be included by the
! top-level `Makefile', bringing in any settings it contains.  The
! default `BUILD_CONFIG' can be set using the configure option
! `--with-build-config=`NAME'...'.  Some examples of supported build
  configurations are:
  
! `bootstrap-O1'
!      Removes any `-O'-started option from `BOOT_CFLAGS', and adds `-O1'
!      to it.  `BUILD_CONFIG=bootstrap-O1' is equivalent to
!      `BOOT_CFLAGS='-g -O1''.
  
! `bootstrap-O3'
!      Analogous to `bootstrap-O1'.
  
! `bootstrap-lto'
       Enables Link-Time Optimization for host tools during bootstrapping.
!      `BUILD_CONFIG=bootstrap-lto' is equivalent to adding `-flto' to
!      `BOOT_CFLAGS'.  This option assumes that the host supports the
!      linker plugin (e.g. GNU ld version 2.21 or later or GNU gold
       version 2.21 or later).
  
! `bootstrap-lto-noplugin'
!      This option is similar to `bootstrap-lto', but is intended for
       hosts that do not support the linker plugin.  Without the linker
       plugin static libraries are not compiled with link-time
       optimizations.  Since the GCC middle end and back end are in
!      `libbackend.a' this means that only the front end is actually LTO
       optimized.
  
! `bootstrap-debug'
       Verifies that the compiler generates the same executable code,
!      whether or not it is asked to emit debug information.  To this
!      end, this option builds stage2 host programs without debug
!      information, and uses `contrib/compare-debug' to compare them with
!      the stripped stage3 object files.  If `BOOT_CFLAGS' is overridden
!      so as to not enable debug information, stage2 will have it, and
!      stage3 won't.  This option is enabled by default when GCC
!      bootstrapping is enabled, if `strip' can turn object files
!      compiled with and without debug info into identical object files.
!      In addition to better test coverage, this option makes default
!      bootstraps faster and leaner.
  
! `bootstrap-debug-big'
       Rather than comparing stripped object files, as in
!      `bootstrap-debug', this option saves internal compiler dumps
!      during stage2 and stage3 and compares them as well, which helps
!      catch additional potential problems, but at a great cost in terms
!      of disk space.  It can be specified in addition to
!      `bootstrap-debug'.
  
! `bootstrap-debug-lean'
!      This option saves disk space compared with `bootstrap-debug-big',
       but at the expense of some recompilation.  Instead of saving the
       dumps of stage2 and stage3 until the final compare, it uses
!      `-fcompare-debug' to generate, compare and remove the dumps during
       stage3, repeating the compilation that already took place in
       stage2, whose dumps were not saved.
  
! `bootstrap-debug-lib'
       This option tests executable code invariance over debug information
!      generation on target libraries, just like `bootstrap-debug-lean'
       tests it on host programs.  It builds stage3 libraries with
!      `-fcompare-debug', and it can be used along with any of the
!      `bootstrap-debug' options above.
  
!      There aren't `-lean' or `-big' counterparts to this option because
       most libraries are only build in stage3, so bootstrap compares
       would not get significant coverage.  Moreover, the few libraries
       built in stage2 are used in stage3 host programs, so we wouldn't
       want to compile stage2 libraries with different options for
       comparison purposes.
  
! `bootstrap-debug-ckovw'
       Arranges for error messages to be issued if the compiler built on
!      any stage is run without the option `-fcompare-debug'.  This is
!      useful to verify the full `-fcompare-debug' testing coverage.  It
!      must be used along with `bootstrap-debug-lean' and
!      `bootstrap-debug-lib'.
  
! `bootstrap-time'
       Arranges for the run time of each program started by the GCC
!      driver, built in any stage, to be logged to `time.log', in the top
       level of the build tree.
  
- 
  5.2 Building a cross compiler
  =============================
  
--- 2170,2296 ----
  
       make BOOT_CFLAGS='-O' bootstrap
  
!    You can place non-default optimization flags into 'BOOT_CFLAGS'; they
! are less well tested here than the default of '-g -O2', but should still
! work.  In a few cases, you may find that you need to specify special
! flags such as '-msoft-float' here to complete the bootstrap; or, if the
! native compiler miscompiles the stage1 compiler, you may need to work
! around this, by choosing 'BOOT_CFLAGS' to avoid the parts of the stage1
! compiler that were miscompiled, or by using 'make bootstrap4' to
  increase the number of stages of bootstrap.
  
!    'BOOT_CFLAGS' does not apply to bootstrapped target libraries.  Since
! these are always compiled with the compiler currently being
! bootstrapped, you can use 'CFLAGS_FOR_TARGET' to modify their
  compilation flags, as for non-bootstrapped target libraries.  Again, if
  the native compiler miscompiles the stage1 compiler, you may need to
  work around this by avoiding non-working parts of the stage1 compiler.
! Use 'STAGE1_TFLAGS' to this end.
  
!    If you used the flag '--enable-languages=...' to restrict the
! compilers to be built, only those you've actually enabled will be built.
! This will of course only build those runtime libraries, for which the
! particular compiler has been built.  Please note, that re-defining
! 'LANGUAGES' when calling 'make' *does not* work anymore!
  
     If the comparison of stage2 and stage3 fails, this normally indicates
  that the stage2 compiler has compiled GCC incorrectly, and is therefore
  a potentially serious bug which you should investigate and report.  (On
  a few systems, meaningful comparison of object files is impossible; they
! always appear "different".  If you encounter this problem, you will need
! to disable comparison in the 'Makefile'.)
  
     If you do not want to bootstrap your compiler, you can configure with
! '--disable-bootstrap'.  In particular cases, you may want to bootstrap
  your compiler even if the target system is not the same as the one you
  are building on: for example, you could build a
! 'powerpc-unknown-linux-gnu' toolchain on a 'powerpc64-unknown-linux-gnu'
! host.  In this case, pass '--enable-bootstrap' to the configure script.
  
!    'BUILD_CONFIG' can be used to bring in additional customization to
  the build.  It can be set to a whitespace-separated list of names.  For
! each such 'NAME', top-level 'config/NAME.mk' will be included by the
! top-level 'Makefile', bringing in any settings it contains.  The default
! 'BUILD_CONFIG' can be set using the configure option
! '--with-build-config=NAME...'.  Some examples of supported build
  configurations are:
  
! 'bootstrap-O1'
!      Removes any '-O'-started option from 'BOOT_CFLAGS', and adds '-O1'
!      to it.  'BUILD_CONFIG=bootstrap-O1' is equivalent to
!      'BOOT_CFLAGS='-g -O1''.
  
! 'bootstrap-O3'
!      Analogous to 'bootstrap-O1'.
  
! 'bootstrap-lto'
       Enables Link-Time Optimization for host tools during bootstrapping.
!      'BUILD_CONFIG=bootstrap-lto' is equivalent to adding '-flto' to
!      'BOOT_CFLAGS'.  This option assumes that the host supports the
!      linker plugin (e.g.  GNU ld version 2.21 or later or GNU gold
       version 2.21 or later).
  
! 'bootstrap-lto-noplugin'
!      This option is similar to 'bootstrap-lto', but is intended for
       hosts that do not support the linker plugin.  Without the linker
       plugin static libraries are not compiled with link-time
       optimizations.  Since the GCC middle end and back end are in
!      'libbackend.a' this means that only the front end is actually LTO
       optimized.
  
! 'bootstrap-debug'
       Verifies that the compiler generates the same executable code,
!      whether or not it is asked to emit debug information.  To this end,
!      this option builds stage2 host programs without debug information,
!      and uses 'contrib/compare-debug' to compare them with the stripped
!      stage3 object files.  If 'BOOT_CFLAGS' is overridden so as to not
!      enable debug information, stage2 will have it, and stage3 won't.
!      This option is enabled by default when GCC bootstrapping is
!      enabled, if 'strip' can turn object files compiled with and without
!      debug info into identical object files.  In addition to better test
!      coverage, this option makes default bootstraps faster and leaner.
  
! 'bootstrap-debug-big'
       Rather than comparing stripped object files, as in
!      'bootstrap-debug', this option saves internal compiler dumps during
!      stage2 and stage3 and compares them as well, which helps catch
!      additional potential problems, but at a great cost in terms of disk
!      space.  It can be specified in addition to 'bootstrap-debug'.
  
! 'bootstrap-debug-lean'
!      This option saves disk space compared with 'bootstrap-debug-big',
       but at the expense of some recompilation.  Instead of saving the
       dumps of stage2 and stage3 until the final compare, it uses
!      '-fcompare-debug' to generate, compare and remove the dumps during
       stage3, repeating the compilation that already took place in
       stage2, whose dumps were not saved.
  
! 'bootstrap-debug-lib'
       This option tests executable code invariance over debug information
!      generation on target libraries, just like 'bootstrap-debug-lean'
       tests it on host programs.  It builds stage3 libraries with
!      '-fcompare-debug', and it can be used along with any of the
!      'bootstrap-debug' options above.
  
!      There aren't '-lean' or '-big' counterparts to this option because
       most libraries are only build in stage3, so bootstrap compares
       would not get significant coverage.  Moreover, the few libraries
       built in stage2 are used in stage3 host programs, so we wouldn't
       want to compile stage2 libraries with different options for
       comparison purposes.
  
! 'bootstrap-debug-ckovw'
       Arranges for error messages to be issued if the compiler built on
!      any stage is run without the option '-fcompare-debug'.  This is
!      useful to verify the full '-fcompare-debug' testing coverage.  It
!      must be used along with 'bootstrap-debug-lean' and
!      'bootstrap-debug-lib'.
  
! 'bootstrap-time'
       Arranges for the run time of each program started by the GCC
!      driver, built in any stage, to be logged to 'time.log', in the top
       level of the build tree.
  
  5.2 Building a cross compiler
  =============================
  
*************** When building a cross compiler, it is no
*** 2333,2352 ****
  3-stage bootstrap of the compiler.  This makes for an interesting
  problem as parts of GCC can only be built with GCC.
  
!    To build a cross compiler, we recommend first building and
! installing a native compiler.  You can then use the native GCC compiler
! to build the cross compiler.  The installed native compiler needs to be
! GCC version 2.95 or later.
  
     If the cross compiler is to be built with support for the Java
  programming language and the ability to compile .java source files is
  desired, the installed native compiler used to build the cross compiler
! needs to be the same GCC version as the cross compiler.  In addition
! the cross compiler needs to be configured with `--with-ecj-jar=...'.
  
     Assuming you have already installed a native copy of GCC and
! configured your cross compiler, issue the command `make', which
! performs the following steps:
  
     * Build host tools necessary to build the compiler.
  
--- 2298,2317 ----
  3-stage bootstrap of the compiler.  This makes for an interesting
  problem as parts of GCC can only be built with GCC.
  
!    To build a cross compiler, we recommend first building and installing
! a native compiler.  You can then use the native GCC compiler to build
! the cross compiler.  The installed native compiler needs to be GCC
! version 2.95 or later.
  
     If the cross compiler is to be built with support for the Java
  programming language and the ability to compile .java source files is
  desired, the installed native compiler used to build the cross compiler
! needs to be the same GCC version as the cross compiler.  In addition the
! cross compiler needs to be configured with '--with-ecj-jar=...'.
  
     Assuming you have already installed a native copy of GCC and
! configured your cross compiler, issue the command 'make', which performs
! the following steps:
  
     * Build host tools necessary to build the compiler.
  
*************** performs the following steps:
*** 2363,2382 ****
  
     If you are not building GNU binutils in the same source tree as GCC,
  you will need a cross-assembler and cross-linker installed before
! configuring GCC.  Put them in the directory `PREFIX/TARGET/bin'.  Here
  is a table of the tools you should put in this directory:
  
! `as'
       This should be the cross-assembler.
  
! `ld'
       This should be the cross-linker.
  
! `ar'
       This should be the cross-archiver: a program which can manipulate
       archive files (linker libraries) in the target machine's format.
  
! `ranlib'
       This should be a program to construct a symbol table in an archive
       file.
  
--- 2328,2347 ----
  
     If you are not building GNU binutils in the same source tree as GCC,
  you will need a cross-assembler and cross-linker installed before
! configuring GCC.  Put them in the directory 'PREFIX/TARGET/bin'.  Here
  is a table of the tools you should put in this directory:
  
! 'as'
       This should be the cross-assembler.
  
! 'ld'
       This should be the cross-linker.
  
! 'ar'
       This should be the cross-archiver: a program which can manipulate
       archive files (linker libraries) in the target machine's format.
  
! 'ranlib'
       This should be a program to construct a symbol table in an archive
       file.
  
*************** and copy or link them to the proper plac
*** 2385,2456 ****
  find them when run later.
  
     The easiest way to provide these files is to build the Binutils
! package.  Configure it with the same `--host' and `--target' options
  that you use for configuring GCC, then build and install them.  They
  install their executables automatically into the proper directory.
  Alas, they do not support all the targets that GCC supports.
  
     If you are not building a C library in the same source tree as GCC,
  you should also provide the target libraries and headers before
! configuring GCC, specifying the directories with `--with-sysroot' or
! `--with-headers' and `--with-libs'.  Many targets also require "start
! files" such as `crt0.o' and `crtn.o' which are linked into each
! executable.  There may be several alternatives for `crt0.o', for use
  with profiling or other compilation options.  Check your target's
! definition of `STARTFILE_SPEC' to find out what start files it uses.
  
  5.3 Building in parallel
  ========================
  
  GNU Make 3.80 and above, which is necessary to build GCC, support
! building in parallel.  To activate this, you can use `make -j 2'
! instead of `make'.  You can also specify a bigger number, and in most
! cases using a value greater than the number of processors in your
! machine will result in fewer and shorter I/O latency hits, thus
! improving overall throughput; this is especially true for slow drives
! and network filesystems.
  
  5.4 Building the Ada compiler
  =============================
  
  In order to build GNAT, the Ada compiler, you need a working GNAT
  compiler (GCC version 4.0 or later).  This includes GNAT tools such as
! `gnatmake' and `gnatlink', since the Ada front end is written in Ada and
  uses some GNAT-specific extensions.
  
     In order to build a cross compiler, it is suggested to install the
  new compiler as native first, and then use it to build the cross
  compiler.
  
!    `configure' does not test whether the GNAT installation works and
! has a sufficiently recent version; if too old a GNAT version is
! installed, the build will fail unless `--enable-languages' is used to
! disable building the Ada front end.
  
!    `ADA_INCLUDE_PATH' and `ADA_OBJECT_PATH' environment variables must
  not be set when building the Ada compiler, the Ada tools, or the Ada
! runtime libraries. You can check that your build environment is clean
! by verifying that `gnatls -v' lists only one explicit path in each
  section.
  
  5.5 Building with profile feedback
  ==================================
  
  It is possible to use profile feedback to optimize the compiler itself.
! This should result in a faster compiler binary.  Experiments done on
! x86 using gcc 3.3 showed approximately 7 percent speedup on compiling C
! programs.  To bootstrap the compiler with profile feedback, use `make
  profiledbootstrap'.
  
!    When `make profiledbootstrap' is run, it will first build a `stage1'
! compiler.  This compiler is used to build a `stageprofile' compiler
  instrumented to collect execution counts of instruction and branch
  probabilities.  Then runtime libraries are compiled with profile
! collected.  Finally a `stagefeedback' compiler is built using the
  information collected.
  
     Unlike standard bootstrap, several additional restrictions apply.
! The compiler used to build `stage1' needs to support a 64-bit integral
  type.  It is recommended to only use GCC for this.
  
  
--- 2350,2421 ----
  find them when run later.
  
     The easiest way to provide these files is to build the Binutils
! package.  Configure it with the same '--host' and '--target' options
  that you use for configuring GCC, then build and install them.  They
  install their executables automatically into the proper directory.
  Alas, they do not support all the targets that GCC supports.
  
     If you are not building a C library in the same source tree as GCC,
  you should also provide the target libraries and headers before
! configuring GCC, specifying the directories with '--with-sysroot' or
! '--with-headers' and '--with-libs'.  Many targets also require "start
! files" such as 'crt0.o' and 'crtn.o' which are linked into each
! executable.  There may be several alternatives for 'crt0.o', for use
  with profiling or other compilation options.  Check your target's
! definition of 'STARTFILE_SPEC' to find out what start files it uses.
  
  5.3 Building in parallel
  ========================
  
  GNU Make 3.80 and above, which is necessary to build GCC, support
! building in parallel.  To activate this, you can use 'make -j 2' instead
! of 'make'.  You can also specify a bigger number, and in most cases
! using a value greater than the number of processors in your machine will
! result in fewer and shorter I/O latency hits, thus improving overall
! throughput; this is especially true for slow drives and network
! filesystems.
  
  5.4 Building the Ada compiler
  =============================
  
  In order to build GNAT, the Ada compiler, you need a working GNAT
  compiler (GCC version 4.0 or later).  This includes GNAT tools such as
! 'gnatmake' and 'gnatlink', since the Ada front end is written in Ada and
  uses some GNAT-specific extensions.
  
     In order to build a cross compiler, it is suggested to install the
  new compiler as native first, and then use it to build the cross
  compiler.
  
!    'configure' does not test whether the GNAT installation works and has
! a sufficiently recent version; if too old a GNAT version is installed,
! the build will fail unless '--enable-languages' is used to disable
! building the Ada front end.
  
!    'ADA_INCLUDE_PATH' and 'ADA_OBJECT_PATH' environment variables must
  not be set when building the Ada compiler, the Ada tools, or the Ada
! runtime libraries.  You can check that your build environment is clean
! by verifying that 'gnatls -v' lists only one explicit path in each
  section.
  
  5.5 Building with profile feedback
  ==================================
  
  It is possible to use profile feedback to optimize the compiler itself.
! This should result in a faster compiler binary.  Experiments done on x86
! using gcc 3.3 showed approximately 7 percent speedup on compiling C
! programs.  To bootstrap the compiler with profile feedback, use 'make
  profiledbootstrap'.
  
!    When 'make profiledbootstrap' is run, it will first build a 'stage1'
! compiler.  This compiler is used to build a 'stageprofile' compiler
  instrumented to collect execution counts of instruction and branch
  probabilities.  Then runtime libraries are compiled with profile
! collected.  Finally a 'stagefeedback' compiler is built using the
  information collected.
  
     Unlike standard bootstrap, several additional restrictions apply.
! The compiler used to build 'stage1' needs to support a 64-bit integral
  type.  It is recommended to only use GCC for this.
  
  
*************** File: gccinstall.info,  Node: Testing,
*** 2459,2472 ****
  6 Installing GCC: Testing
  *************************
  
!    Before you install GCC, we encourage you to run the testsuites and to
  compare your results with results from a similar configuration that have
  been submitted to the gcc-testresults mailing list.  Some of these
  archived results are linked from the build status lists at
! `http://gcc.gnu.org/buildstat.html', although not everyone who reports
! a successful build runs the testsuites and submits the results.  This
! step is optional and may require you to download additional software,
! but it can give you confidence in your new GCC installation or point out
  problems before you install and start using your new GCC.
  
     First, you must have downloaded the testsuites.  These are part of
--- 2424,2437 ----
  6 Installing GCC: Testing
  *************************
  
! Before you install GCC, we encourage you to run the testsuites and to
  compare your results with results from a similar configuration that have
  been submitted to the gcc-testresults mailing list.  Some of these
  archived results are linked from the build status lists at
! <http://gcc.gnu.org/buildstat.html>, although not everyone who reports a
! successful build runs the testsuites and submits the results.  This step
! is optional and may require you to download additional software, but it
! can give you confidence in your new GCC installation or point out
  problems before you install and start using your new GCC.
  
     First, you must have downloaded the testsuites.  These are part of
*************** any front ends, you must download the te
*** 2476,2485 ****
     Second, you must have the testing tools installed.  This includes
  DejaGnu, Tcl, and Expect; the DejaGnu site has links to these.
  
!    If the directories where `runtest' and `expect' were installed are
! not in the `PATH', you may need to set the following environment
! variables appropriately, as in the following example (which assumes
! that DejaGnu has been installed under `/usr/local'):
  
       TCL_LIBRARY = /usr/local/share/tcl8.0
       DEJAGNULIBS = /usr/local/share/dejagnu
--- 2441,2450 ----
     Second, you must have the testing tools installed.  This includes
  DejaGnu, Tcl, and Expect; the DejaGnu site has links to these.
  
!    If the directories where 'runtest' and 'expect' were installed are
! not in the 'PATH', you may need to set the following environment
! variables appropriately, as in the following example (which assumes that
! DejaGnu has been installed under '/usr/local'):
  
       TCL_LIBRARY = /usr/local/share/tcl8.0
       DEJAGNULIBS = /usr/local/share/dejagnu
*************** portability in the DejaGnu code.)
*** 2491,2546 ****
     Finally, you can run the testsuite (which may take a long time):
       cd OBJDIR; make -k check
  
!    This will test various components of GCC, such as compiler front
! ends and runtime libraries.  While running the testsuite, DejaGnu might
! emit some harmless messages resembling `WARNING: Couldn't find the
! global config file.' or `WARNING: Couldn't find tool init file' that
! can be ignored.
  
     If you are testing a cross-compiler, you may want to run the
  testsuite on a simulator as described at
! `http://gcc.gnu.org/simtest-howto.html'.
  
  6.1 How can you run the testsuite on selected tests?
  ====================================================
  
! In order to run sets of tests selectively, there are targets `make
! check-gcc' and language specific `make check-c', `make check-c++',
! `make check-fortran', `make check-java', `make check-ada', `make
! check-objc', `make check-obj-c++', `make check-lto' in the `gcc'
! subdirectory of the object directory.  You can also just run `make
! check' in a subdirectory of the object directory.
  
!    A more selective way to just run all `gcc' execute tests in the
  testsuite is to use
  
       make check-gcc RUNTESTFLAGS="execute.exp OTHER-OPTIONS"
  
!    Likewise, in order to run only the `g++' "old-deja" tests in the
! testsuite with filenames matching `9805*', you would use
  
       make check-g++ RUNTESTFLAGS="old-deja.exp=9805* OTHER-OPTIONS"
  
!    The `*.exp' files are located in the testsuite directories of the GCC
! source, the most important ones being `compile.exp', `execute.exp',
! `dg.exp' and `old-deja.exp'.  To get a list of the possible `*.exp'
! files, pipe the output of `make check' into a file and look at the
! `Running ...  .exp' lines.
  
  6.2 Passing options and running multiple testsuites
  ===================================================
  
  You can pass multiple options to the testsuite using the
! `--target_board' option of DejaGNU, either passed as part of
! `RUNTESTFLAGS', or directly to `runtest' if you prefer to work outside
  the makefiles.  For example,
  
       make check-g++ RUNTESTFLAGS="--target_board=unix/-O3/-fmerge-constants"
  
!    will run the standard `g++' testsuites ("unix" is the target name
! for a standard native testsuite situation), passing `-O3
! -fmerge-constants' to the compiler on every test, i.e., slashes
! separate options.
  
     You can run the testsuites multiple times using combinations of
  options with a syntax similar to the brace expansion of popular shells:
--- 2456,2510 ----
     Finally, you can run the testsuite (which may take a long time):
       cd OBJDIR; make -k check
  
!    This will test various components of GCC, such as compiler front ends
! and runtime libraries.  While running the testsuite, DejaGnu might emit
! some harmless messages resembling 'WARNING: Couldn't find the global
! config file.' or 'WARNING: Couldn't find tool init file' that can be
! ignored.
  
     If you are testing a cross-compiler, you may want to run the
  testsuite on a simulator as described at
! <http://gcc.gnu.org/simtest-howto.html>.
  
  6.1 How can you run the testsuite on selected tests?
  ====================================================
  
! In order to run sets of tests selectively, there are targets 'make
! check-gcc' and language specific 'make check-c', 'make check-c++', 'make
! check-fortran', 'make check-java', 'make check-ada', 'make check-objc',
! 'make check-obj-c++', 'make check-lto' in the 'gcc' subdirectory of the
! object directory.  You can also just run 'make check' in a subdirectory
! of the object directory.
  
!    A more selective way to just run all 'gcc' execute tests in the
  testsuite is to use
  
       make check-gcc RUNTESTFLAGS="execute.exp OTHER-OPTIONS"
  
!    Likewise, in order to run only the 'g++' "old-deja" tests in the
! testsuite with filenames matching '9805*', you would use
  
       make check-g++ RUNTESTFLAGS="old-deja.exp=9805* OTHER-OPTIONS"
  
!    The '*.exp' files are located in the testsuite directories of the GCC
! source, the most important ones being 'compile.exp', 'execute.exp',
! 'dg.exp' and 'old-deja.exp'.  To get a list of the possible '*.exp'
! files, pipe the output of 'make check' into a file and look at the
! 'Running ... .exp' lines.
  
  6.2 Passing options and running multiple testsuites
  ===================================================
  
  You can pass multiple options to the testsuite using the
! '--target_board' option of DejaGNU, either passed as part of
! 'RUNTESTFLAGS', or directly to 'runtest' if you prefer to work outside
  the makefiles.  For example,
  
       make check-g++ RUNTESTFLAGS="--target_board=unix/-O3/-fmerge-constants"
  
!    will run the standard 'g++' testsuites ("unix" is the target name for
! a standard native testsuite situation), passing '-O3 -fmerge-constants'
! to the compiler on every test, i.e., slashes separate options.
  
     You can run the testsuites multiple times using combinations of
  options with a syntax similar to the brace expansion of popular shells:
*************** options with a syntax similar to the bra
*** 2549,2555 ****
  
     (Note the empty option caused by the trailing comma in the final
  group.)  The following will run each testsuite eight times using the
! `arm-sim' target, as if you had specified all possible combinations
  yourself:
  
       --target_board='arm-sim/-mhard-float/-O1 \
--- 2513,2519 ----
  
     (Note the empty option caused by the trailing comma in the final
  group.)  The following will run each testsuite eight times using the
! 'arm-sim' target, as if you had specified all possible combinations
  yourself:
  
       --target_board='arm-sim/-mhard-float/-O1 \
*************** This list:
*** 2566,2578 ****
  
       ..."--target_board=unix/-Wextra\{-O3,-fno-strength\}\{-fomit-frame,\}"
  
!    will generate four combinations, all involving `-Wextra'.
  
     The disadvantage to this method is that the testsuites are run in
  serial, which is a waste on multiprocessor systems.  For users with GNU
  Make and a shell which performs brace expansion, you can run the
  testsuites in parallel by having the shell perform the combinations and
! `make' do the parallel runs.  Instead of using `--target_board', use a
  special makefile target:
  
       make -jN check-TESTSUITE//TEST-TARGET/OPTION1/OPTION2/...
--- 2530,2542 ----
  
       ..."--target_board=unix/-Wextra\{-O3,-fno-strength\}\{-fomit-frame,\}"
  
!    will generate four combinations, all involving '-Wextra'.
  
     The disadvantage to this method is that the testsuites are run in
  serial, which is a waste on multiprocessor systems.  For users with GNU
  Make and a shell which performs brace expansion, you can run the
  testsuites in parallel by having the shell perform the combinations and
! 'make' do the parallel runs.  Instead of using '--target_board', use a
  special makefile target:
  
       make -jN check-TESTSUITE//TEST-TARGET/OPTION1/OPTION2/...
*************** special makefile target:
*** 2583,2624 ****
  
     will run three concurrent "make-gcc" testsuites, eventually testing
  all ten combinations as described above.  Note that this is currently
! only supported in the `gcc' subdirectory.  (To see how this works, try
! typing `echo' before the example given here.)
  
  6.3 Additional testing for Java Class Libraries
  ===============================================
  
! The Java runtime tests can be executed via `make check' in the
! `TARGET/libjava/testsuite' directory in the build tree.
  
     The Mauve Project provides a suite of tests for the Java Class
  Libraries.  This suite can be run as part of libgcj testing by placing
  the Mauve tree within the libjava testsuite at
! `libjava/testsuite/libjava.mauve/mauve', or by specifying the location
! of that tree when invoking `make', as in `make MAUVEDIR=~/mauve check'.
  
  6.4 How to interpret test results
  =================================
  
! The result of running the testsuite are various `*.sum' and `*.log'
! files in the testsuite subdirectories.  The `*.log' files contain a
  detailed log of the compiler invocations and the corresponding results,
! the `*.sum' files summarize the results.  These summaries contain
! status codes for all tests:
  
     * PASS: the test passed as expected
- 
     * XPASS: the test unexpectedly passed
- 
     * FAIL: the test unexpectedly failed
- 
     * XFAIL: the test failed as expected
- 
     * UNSUPPORTED: the test is not supported on this platform
- 
     * ERROR: the testsuite detected an error
- 
     * WARNING: the testsuite detected a possible problem
  
     It is normal for some tests to report unexpected failures.  At the
--- 2547,2582 ----
  
     will run three concurrent "make-gcc" testsuites, eventually testing
  all ten combinations as described above.  Note that this is currently
! only supported in the 'gcc' subdirectory.  (To see how this works, try
! typing 'echo' before the example given here.)
  
  6.3 Additional testing for Java Class Libraries
  ===============================================
  
! The Java runtime tests can be executed via 'make check' in the
! 'TARGET/libjava/testsuite' directory in the build tree.
  
     The Mauve Project provides a suite of tests for the Java Class
  Libraries.  This suite can be run as part of libgcj testing by placing
  the Mauve tree within the libjava testsuite at
! 'libjava/testsuite/libjava.mauve/mauve', or by specifying the location
! of that tree when invoking 'make', as in 'make MAUVEDIR=~/mauve check'.
  
  6.4 How to interpret test results
  =================================
  
! The result of running the testsuite are various '*.sum' and '*.log'
! files in the testsuite subdirectories.  The '*.log' files contain a
  detailed log of the compiler invocations and the corresponding results,
! the '*.sum' files summarize the results.  These summaries contain status
! codes for all tests:
  
     * PASS: the test passed as expected
     * XPASS: the test unexpectedly passed
     * FAIL: the test unexpectedly failed
     * XFAIL: the test failed as expected
     * UNSUPPORTED: the test is not supported on this platform
     * ERROR: the testsuite detected an error
     * WARNING: the testsuite detected a possible problem
  
     It is normal for some tests to report unexpected failures.  At the
*************** fixed in future releases.
*** 2630,2644 ****
  ===========================
  
  If you want to report the results to the GCC project, use the
! `contrib/test_summary' shell script.  Start it in the OBJDIR with
  
       SRCDIR/contrib/test_summary -p your_commentary.txt \
           -m gcc-testresults@gcc.gnu.org |sh
  
!    This script uses the `Mail' program to send the results, so make
! sure it is in your `PATH'.  The file `your_commentary.txt' is prepended
! to the testsuite summary and should contain any special remarks you
! have on your results or your build environment.  Please do not edit the
  testsuite result block or the subject line, as these messages may be
  automatically processed.
  
--- 2588,2602 ----
  ===========================
  
  If you want to report the results to the GCC project, use the
! 'contrib/test_summary' shell script.  Start it in the OBJDIR with
  
       SRCDIR/contrib/test_summary -p your_commentary.txt \
           -m gcc-testresults@gcc.gnu.org |sh
  
!    This script uses the 'Mail' program to send the results, so make sure
! it is in your 'PATH'.  The file 'your_commentary.txt' is prepended to
! the testsuite summary and should contain any special remarks you have on
! your results or your build environment.  Please do not edit the
  testsuite result block or the subject line, as these messages may be
  automatically processed.
  
*************** File: gccinstall.info,  Node: Final inst
*** 2648,2655 ****
  7 Installing GCC: Final installation
  ************************************
  
!    Now that GCC has been built (and optionally tested), you can install
! it with
       cd OBJDIR && make install
  
     We strongly recommend to install into a target directory where there
--- 2606,2613 ----
  7 Installing GCC: Final installation
  ************************************
  
! Now that GCC has been built (and optionally tested), you can install it
! with
       cd OBJDIR && make install
  
     We strongly recommend to install into a target directory where there
*************** that depend on this debugging informatio
*** 2659,2696 ****
  instance).
  
     That step completes the installation of GCC; user level binaries can
! be found in `PREFIX/bin' where PREFIX is the value you specified with
! the `--prefix' to configure (or `/usr/local' by default).  (If you
! specified `--bindir', that directory will be used instead; otherwise,
! if you specified `--exec-prefix', `EXEC-PREFIX/bin' will be used.)
! Headers for the C++ and Java libraries are installed in
! `PREFIX/include'; libraries in `LIBDIR' (normally `PREFIX/lib');
! internal parts of the compiler in `LIBDIR/gcc' and `LIBEXECDIR/gcc';
! documentation in info format in `INFODIR' (normally `PREFIX/info').
  
     When installing cross-compilers, GCC's executables are not only
! installed into `BINDIR', that is, `EXEC-PREFIX/bin', but additionally
! into `EXEC-PREFIX/TARGET-ALIAS/bin', if that directory exists.
  Typically, such "tooldirs" hold target-specific binutils, including
  assembler and linker.
  
!    Installation into a temporary staging area or into a `chroot' jail
  can be achieved with the command
  
       make DESTDIR=PATH-TO-ROOTDIR install
  
  where PATH-TO-ROOTDIR is the absolute path of a directory relative to
  which all installation paths will be interpreted.  Note that the
! directory specified by `DESTDIR' need not exist yet; it will be created
  if necessary.
  
!    There is a subtle point with tooldirs and `DESTDIR': If you relocate
! a cross-compiler installation with e.g. `DESTDIR=ROOTDIR', then the
! directory `ROOTDIR/EXEC-PREFIX/TARGET-ALIAS/bin' will be filled with
  duplicated GCC executables only if it already exists, it will not be
! created otherwise.  This is regarded as a feature, not as a bug,
! because it gives slightly more control to the packagers using the
! `DESTDIR' feature.
  
     You can install stripped programs and libraries with
  
--- 2617,2654 ----
  instance).
  
     That step completes the installation of GCC; user level binaries can
! be found in 'PREFIX/bin' where PREFIX is the value you specified with
! the '--prefix' to configure (or '/usr/local' by default).  (If you
! specified '--bindir', that directory will be used instead; otherwise, if
! you specified '--exec-prefix', 'EXEC-PREFIX/bin' will be used.)  Headers
! for the C++ and Java libraries are installed in 'PREFIX/include';
! libraries in 'LIBDIR' (normally 'PREFIX/lib'); internal parts of the
! compiler in 'LIBDIR/gcc' and 'LIBEXECDIR/gcc'; documentation in info
! format in 'INFODIR' (normally 'PREFIX/info').
  
     When installing cross-compilers, GCC's executables are not only
! installed into 'BINDIR', that is, 'EXEC-PREFIX/bin', but additionally
! into 'EXEC-PREFIX/TARGET-ALIAS/bin', if that directory exists.
  Typically, such "tooldirs" hold target-specific binutils, including
  assembler and linker.
  
!    Installation into a temporary staging area or into a 'chroot' jail
  can be achieved with the command
  
       make DESTDIR=PATH-TO-ROOTDIR install
  
  where PATH-TO-ROOTDIR is the absolute path of a directory relative to
  which all installation paths will be interpreted.  Note that the
! directory specified by 'DESTDIR' need not exist yet; it will be created
  if necessary.
  
!    There is a subtle point with tooldirs and 'DESTDIR': If you relocate
! a cross-compiler installation with e.g. 'DESTDIR=ROOTDIR', then the
! directory 'ROOTDIR/EXEC-PREFIX/TARGET-ALIAS/bin' will be filled with
  duplicated GCC executables only if it already exists, it will not be
! created otherwise.  This is regarded as a feature, not as a bug, because
! it gives slightly more control to the packagers using the 'DESTDIR'
! feature.
  
     You can install stripped programs and libraries with
  
*************** because it gives slightly more control t
*** 2698,2763 ****
  
     If you are bootstrapping a released version of GCC then please
  quickly review the build status page for your release, available from
! `http://gcc.gnu.org/buildstat.html'.  If your system is not listed for
  the version of GCC that you built, send a note to <gcc@gcc.gnu.org>
  indicating that you successfully built and installed GCC.  Include the
  following information:
  
!    * Output from running `SRCDIR/config.guess'.  Do not send that file
       itself, just the one-line output from running it.
  
!    * The output of `gcc -v' for your newly installed `gcc'.  This tells
       us which version of GCC you built and the options you passed to
       configure.
  
!    * Whether you enabled all languages or a subset of them.  If you
!      used a full distribution then this information is part of the
!      configure options in the output of `gcc -v', but if you downloaded
!      the "core" compiler plus additional front ends then it isn't
!      apparent which ones you built unless you tell us about it.
  
     * If the build was for GNU/Linux, also include:
!         * The distribution name and version (e.g., Red Hat 7.1 or
!           Debian 2.2.3); this information should be available from
!           `/etc/issue'.
  
!         * The version of the Linux kernel, available from `uname
!           --version' or `uname -a'.
  
          * The version of glibc you used; for RPM-based systems like Red
!           Hat, Mandrake, and SuSE type `rpm -q glibc' to get the glibc
!           version, and on systems like Debian and Progeny use `dpkg -l
            libc6'.
!      For other systems, you can include similar information if you
!      think it is relevant.
  
     * Any other information that you think would be useful to people
!      building GCC on the same configuration.  The new entry in the
!      build status list will include a link to the archived copy of your
       message.
  
!    We'd also like to know if the *note host/target specific
! installation notes: Specific.  didn't include your host/target
! information or if that information is incomplete or out of date.  Send
! a note to <gcc@gcc.gnu.org> detailing how the information should be
! changed.
  
     If you find a bug, please report it following the bug reporting
  guidelines.
  
!    If you want to print the GCC manuals, do `cd OBJDIR; make dvi'.  You
! will need to have `texi2dvi' (version at least 4.7) and TeX installed.
! This creates a number of `.dvi' files in subdirectories of `OBJDIR';
! these may be converted for printing with programs such as `dvips'.
! Alternately, by using `make pdf' in place of `make dvi', you can create
! documentation in the form of `.pdf' files; this requires `texi2pdf',
  which is included with Texinfo version 4.8 and later.  You can also buy
  printed manuals from the Free Software Foundation, though such manuals
  may not be for the most recent version of GCC.
  
!    If you would like to generate online HTML documentation, do `cd
  OBJDIR; make html' and HTML will be generated for the gcc manuals in
! `OBJDIR/gcc/HTML'.
  
  
  File: gccinstall.info,  Node: Binaries,  Next: Specific,  Prev: Installing GCC,  Up: Top
--- 2656,2720 ----
  
     If you are bootstrapping a released version of GCC then please
  quickly review the build status page for your release, available from
! <http://gcc.gnu.org/buildstat.html>.  If your system is not listed for
  the version of GCC that you built, send a note to <gcc@gcc.gnu.org>
  indicating that you successfully built and installed GCC.  Include the
  following information:
  
!    * Output from running 'SRCDIR/config.guess'.  Do not send that file
       itself, just the one-line output from running it.
  
!    * The output of 'gcc -v' for your newly installed 'gcc'.  This tells
       us which version of GCC you built and the options you passed to
       configure.
  
!    * Whether you enabled all languages or a subset of them.  If you used
!      a full distribution then this information is part of the configure
!      options in the output of 'gcc -v', but if you downloaded the "core"
!      compiler plus additional front ends then it isn't apparent which
!      ones you built unless you tell us about it.
  
     * If the build was for GNU/Linux, also include:
!         * The distribution name and version (e.g., Red Hat 7.1 or Debian
!           2.2.3); this information should be available from
!           '/etc/issue'.
  
!         * The version of the Linux kernel, available from 'uname
!           --version' or 'uname -a'.
  
          * The version of glibc you used; for RPM-based systems like Red
!           Hat, Mandrake, and SuSE type 'rpm -q glibc' to get the glibc
!           version, and on systems like Debian and Progeny use 'dpkg -l
            libc6'.
!      For other systems, you can include similar information if you think
!      it is relevant.
  
     * Any other information that you think would be useful to people
!      building GCC on the same configuration.  The new entry in the build
!      status list will include a link to the archived copy of your
       message.
  
!    We'd also like to know if the *note host/target specific installation
! notes: Specific. didn't include your host/target information or if that
! information is incomplete or out of date.  Send a note to
! <gcc@gcc.gnu.org> detailing how the information should be changed.
  
     If you find a bug, please report it following the bug reporting
  guidelines.
  
!    If you want to print the GCC manuals, do 'cd OBJDIR; make dvi'.  You
! will need to have 'texi2dvi' (version at least 4.7) and TeX installed.
! This creates a number of '.dvi' files in subdirectories of 'OBJDIR';
! these may be converted for printing with programs such as 'dvips'.
! Alternately, by using 'make pdf' in place of 'make dvi', you can create
! documentation in the form of '.pdf' files; this requires 'texi2pdf',
  which is included with Texinfo version 4.8 and later.  You can also buy
  printed manuals from the Free Software Foundation, though such manuals
  may not be for the most recent version of GCC.
  
!    If you would like to generate online HTML documentation, do 'cd
  OBJDIR; make html' and HTML will be generated for the gcc manuals in
! 'OBJDIR/gcc/HTML'.
  
  
  File: gccinstall.info,  Node: Binaries,  Next: Specific,  Prev: Installing GCC,  Up: Top
*************** File: gccinstall.info,  Node: Binaries,
*** 2765,2774 ****
  8 Installing GCC: Binaries
  **************************
  
!    We are often asked about pre-compiled versions of GCC.  While we
! cannot provide these for all platforms, below you'll find links to
! binaries for various platforms where creating them by yourself is not
! easy due to various reasons.
  
     Please note that we did not create these binaries, nor do we support
  them.  If you have any problems installing them, please contact their
--- 2722,2731 ----
  8 Installing GCC: Binaries
  **************************
  
! We are often asked about pre-compiled versions of GCC.  While we cannot
! provide these for all platforms, below you'll find links to binaries for
! various platforms where creating them by yourself is not easy due to
! various reasons.
  
     Please note that we did not create these binaries, nor do we support
  them.  If you have any problems installing them, please contact their
*************** makers.
*** 2801,2807 ****
  
     * Microsoft Windows:
          * The Cygwin project;
- 
          * The MinGW project.
  
     * The Written Word offers binaries for AIX 4.3.3, 5.1 and 5.2,
--- 2758,2763 ----
*************** File: gccinstall.info,  Node: Specific,
*** 2819,2826 ****
  9 Host/target specific installation notes for GCC
  *************************************************
  
!    Please read this document carefully _before_ installing the GNU
! Compiler Collection on your machine.
  
     Note that this list of install notes is _not_ a list of supported
  hosts or targets.  Not all supported hosts and targets are listed here,
--- 2775,2782 ----
  9 Host/target specific installation notes for GCC
  *************************************************
  
! Please read this document carefully _before_ installing the GNU Compiler
! Collection on your machine.
  
     Note that this list of install notes is _not_ a list of supported
  hosts or targets.  Not all supported hosts and targets are listed here,
*************** have to.
*** 2830,2859 ****
  aarch64*-*-*
  ============
  
! Binutils pre 2.24 does not have support for selecting `-mabi' and does
  not support ILP32.  If it is used to build GCC 4.9 or later, GCC will
! not support option `-mabi=ilp32'.
  
     To enable a workaround for the Cortex-A53 erratum number 835769 by
  default (for all CPUs regardless of -mcpu option given) at configure
! time use the `--enable-fix-cortex-a53-835769' option.  This will enable
  the fix by default and can be explicitly disabled during compilation by
! passing the `-mno-fix-cortex-a53-835769' option.  Conversely,
! `--disable-fix-cortex-a53-835769' will disable the workaround by
  default.  The workaround is disabled by default if neither of
! `--enable-fix-cortex-a53-835769' or `--disable-fix-cortex-a53-835769'
! is given at configure time.
  
     To enable a workaround for the Cortex-A53 erratum number 843419 by
  default (for all CPUs regardless of -mcpu option given) at configure
! time use the `--enable-fix-cortex-a53-843419' option.  This workaround
! is applied at link time.  Enabling the workaround will cause GCC to
! pass the relevant option to the linker.  It can be explicitly disabled
! during compilation by passing the `-mno-fix-cortex-a53-843419' option.
! Conversely, `--disable-fix-cortex-a53-843419' will disable the
! workaround by default.  The workaround is disabled by default if
! neither of `--enable-fix-cortex-a53-843419' or
! `--disable-fix-cortex-a53-843419' is given at configure time.
  
  alpha*-*-*
  ==========
--- 2786,2815 ----
  aarch64*-*-*
  ============
  
! Binutils pre 2.24 does not have support for selecting '-mabi' and does
  not support ILP32.  If it is used to build GCC 4.9 or later, GCC will
! not support option '-mabi=ilp32'.
  
     To enable a workaround for the Cortex-A53 erratum number 835769 by
  default (for all CPUs regardless of -mcpu option given) at configure
! time use the '--enable-fix-cortex-a53-835769' option.  This will enable
  the fix by default and can be explicitly disabled during compilation by
! passing the '-mno-fix-cortex-a53-835769' option.  Conversely,
! '--disable-fix-cortex-a53-835769' will disable the workaround by
  default.  The workaround is disabled by default if neither of
! '--enable-fix-cortex-a53-835769' or '--disable-fix-cortex-a53-835769' is
! given at configure time.
  
     To enable a workaround for the Cortex-A53 erratum number 843419 by
  default (for all CPUs regardless of -mcpu option given) at configure
! time use the '--enable-fix-cortex-a53-843419' option.  This workaround
! is applied at link time.  Enabling the workaround will cause GCC to pass
! the relevant option to the linker.  It can be explicitly disabled during
! compilation by passing the '-mno-fix-cortex-a53-843419' option.
! Conversely, '--disable-fix-cortex-a53-843419' will disable the
! workaround by default.  The workaround is disabled by default if neither
! of '--enable-fix-cortex-a53-843419' or '--disable-fix-cortex-a53-843419'
! is given at configure time.
  
  alpha*-*-*
  ==========
*************** systems.
*** 2877,2901 ****
  
     Support for Tru64 UNIX V5.1 has been removed in GCC 4.8.  As of GCC
  4.6, support for Tru64 UNIX V4.0 and V5.0 has been removed.  As of GCC
! 3.2, versions before `alpha*-dec-osf4' are no longer supported.  (These
  are the versions which identify themselves as DEC OSF/1.)
  
  amd64-*-solaris2.1[0-9]*
  ========================
  
! This is a synonym for `x86_64-*-solaris2.1[0-9]*'.
  
  arc-*-elf32
  ===========
  
! Use `configure --target=arc-elf32 --with-cpu=CPU
  --enable-languages="c,c++"' to configure GCC, with CPU being one of
! `arc600', `arc601', or `arc700'.
  
  arc-linux-uclibc
  ================
  
! Use `configure --target=arc-linux-uclibc --with-cpu=arc700
  --enable-languages="c,c++"' to configure GCC.
  
  arm-*-eabi
--- 2833,2857 ----
  
     Support for Tru64 UNIX V5.1 has been removed in GCC 4.8.  As of GCC
  4.6, support for Tru64 UNIX V4.0 and V5.0 has been removed.  As of GCC
! 3.2, versions before 'alpha*-dec-osf4' are no longer supported.  (These
  are the versions which identify themselves as DEC OSF/1.)
  
  amd64-*-solaris2.1[0-9]*
  ========================
  
! This is a synonym for 'x86_64-*-solaris2.1[0-9]*'.
  
  arc-*-elf32
  ===========
  
! Use 'configure --target=arc-elf32 --with-cpu=CPU
  --enable-languages="c,c++"' to configure GCC, with CPU being one of
! 'arc600', 'arc601', or 'arc700'.
  
  arc-linux-uclibc
  ================
  
! Use 'configure --target=arc-linux-uclibc --with-cpu=arc700
  --enable-languages="c,c++"' to configure GCC.
  
  arm-*-eabi
*************** arm-*-eabi
*** 2903,2909 ****
  
  ARM-family processors.  Subtargets that use the ELF object format
  require GNU binutils 2.13 or newer.  Such subtargets include:
! `arm-*-netbsdelf', `arm-*-*linux-*' and `arm-*-rtemseabi'.
  
  avr
  ===
--- 2859,2865 ----
  
  ARM-family processors.  Subtargets that use the ELF object format
  require GNU binutils 2.13 or newer.  Such subtargets include:
! 'arm-*-netbsdelf', 'arm-*-*linux-*' and 'arm-*-rtemseabi'.
  
  avr
  ===
*************** ATMEL AVR-family micro controllers.  The
*** 2912,2924 ****
  applications.  There are no standard Unix configurations.  *Note AVR
  Options: (gcc)AVR Options, for the list of supported MCU types.
  
!    Use `configure --target=avr --enable-languages="c"' to configure GCC.
  
     Further installation notes and other useful information about AVR
  tools can also be obtained from:
  
     * http://www.nongnu.org/avr/
- 
     * http://www.amelek.gda.pl/avr/
  
     We _strongly_ recommend using binutils 2.13 or newer.
--- 2868,2879 ----
  applications.  There are no standard Unix configurations.  *Note AVR
  Options: (gcc)AVR Options, for the list of supported MCU types.
  
!    Use 'configure --target=avr --enable-languages="c"' to configure GCC.
  
     Further installation notes and other useful information about AVR
  tools can also be obtained from:
  
     * http://www.nongnu.org/avr/
     * http://www.amelek.gda.pl/avr/
  
     We _strongly_ recommend using binutils 2.13 or newer.
*************** tools can also be obtained from:
*** 2931,2954 ****
  Blackfin
  ========
  
! The Blackfin processor, an Analog Devices DSP.  *Note Blackfin Options:
  (gcc)Blackfin Options,
  
     More information, and a version of binutils with support for this
! processor, is available at `http://blackfin.uclinux.org'
  
  CR16
  ====
  
! The CR16 CompactRISC architecture is a 16-bit architecture. This
  architecture is used in embedded applications.
  
     *Note CR16 Options: (gcc)CR16 Options,
  
!    Use `configure --target=cr16-elf --enable-languages=c,c++' to
  configure GCC for building a CR16 elf cross-compiler.
  
!    Use `configure --target=cr16-uclinux --enable-languages=c,c++' to
  configure GCC for building a CR16 uclinux cross-compiler.
  
  CRIS
--- 2886,2909 ----
  Blackfin
  ========
  
! The Blackfin processor, an Analog Devices DSP. *Note Blackfin Options:
  (gcc)Blackfin Options,
  
     More information, and a version of binutils with support for this
! processor, is available at <http://blackfin.uclinux.org>
  
  CR16
  ====
  
! The CR16 CompactRISC architecture is a 16-bit architecture.  This
  architecture is used in embedded applications.
  
     *Note CR16 Options: (gcc)CR16 Options,
  
!    Use 'configure --target=cr16-elf --enable-languages=c,c++' to
  configure GCC for building a CR16 elf cross-compiler.
  
!    Use 'configure --target=cr16-uclinux --enable-languages=c,c++' to
  configure GCC for building a CR16 uclinux cross-compiler.
  
  CRIS
*************** system-on-a-chip series.  These are used
*** 2961,2981 ****
  options.
  
     There are a few different CRIS targets:
! `cris-axis-elf'
       Mainly for monolithic embedded systems.  Includes a multilib for
!      the `v10' core used in `ETRAX 100 LX'.
! 
! `cris-axis-linux-gnu'
       A GNU/Linux port for the CRIS architecture, currently targeting
!      `ETRAX 100 LX' by default.
  
!    For `cris-axis-elf' you need binutils 2.11 or newer.  For
! `cris-axis-linux-gnu' you need binutils 2.12 or newer.
  
     Pre-packaged tools can be obtained from
! `ftp://ftp.axis.com/pub/axis/tools/cris/compiler-kit/'.  More
  information about this platform is available at
! `http://developer.axis.com/'.
  
  DOS
  ===
--- 2916,2935 ----
  options.
  
     There are a few different CRIS targets:
! 'cris-axis-elf'
       Mainly for monolithic embedded systems.  Includes a multilib for
!      the 'v10' core used in 'ETRAX 100 LX'.
! 'cris-axis-linux-gnu'
       A GNU/Linux port for the CRIS architecture, currently targeting
!      'ETRAX 100 LX' by default.
  
!    For 'cris-axis-elf' you need binutils 2.11 or newer.  For
! 'cris-axis-linux-gnu' you need binutils 2.12 or newer.
  
     Pre-packaged tools can be obtained from
! <ftp://ftp.axis.com/pub/axis/tools/cris/compiler-kit/>.  More
  information about this platform is available at
! <http://developer.axis.com/>.
  
  DOS
  ===
*************** Support for FreeBSD 1 was discontinued i
*** 3002,3032 ****
     In order to better utilize FreeBSD base system functionality and
  match the configuration of the system compiler, GCC 4.5 and above as
  well as GCC 4.4 past 2010-06-20 leverage SSP support in libc (which is
! present on FreeBSD 7 or later) and the use of `__cxa_atexit' by default
! (on FreeBSD 6 or later).  The use of `dl_iterate_phdr' inside
! `libgcc_s.so.1' and boehm-gc (on FreeBSD 7 or later) is enabled by GCC
  4.5 and above.
  
     We support FreeBSD using the ELF file format with DWARF 2 debugging
! for all CPU architectures.  You may use `-gstabs' instead of `-g', if
  you really want the old debugging format.  There are no known issues
! with mixing object files and libraries with different debugging
! formats.  Otherwise, this release of GCC should now match more of the
  configuration used in the stock FreeBSD configuration of GCC.  In
! particular, `--enable-threads' is now configured by default.  However,
  as a general user, do not attempt to replace the system compiler with
! this release.  Known to bootstrap and check with good results on
! FreeBSD 7.2-STABLE.  In the past, known to bootstrap and check with
! good results on FreeBSD 3.0, 3.4, 4.0, 4.2, 4.3, 4.4, 4.5, 4.8, 4.9 and
! 5-CURRENT.
  
!    The version of binutils installed in `/usr/bin' probably works with
  this release of GCC.  Bootstrapping against the latest GNU binutils
! and/or the version found in `/usr/ports/devel/binutils' has been known
  to enable additional features and improve overall testsuite results.
  However, it is currently known that boehm-gc (which itself is required
! for java) may not configure properly on FreeBSD prior to the FreeBSD
! 7.0 release with GNU binutils after 2.16.1.
  
  h8300-hms
  =========
--- 2956,2985 ----
     In order to better utilize FreeBSD base system functionality and
  match the configuration of the system compiler, GCC 4.5 and above as
  well as GCC 4.4 past 2010-06-20 leverage SSP support in libc (which is
! present on FreeBSD 7 or later) and the use of '__cxa_atexit' by default
! (on FreeBSD 6 or later).  The use of 'dl_iterate_phdr' inside
! 'libgcc_s.so.1' and boehm-gc (on FreeBSD 7 or later) is enabled by GCC
  4.5 and above.
  
     We support FreeBSD using the ELF file format with DWARF 2 debugging
! for all CPU architectures.  You may use '-gstabs' instead of '-g', if
  you really want the old debugging format.  There are no known issues
! with mixing object files and libraries with different debugging formats.
! Otherwise, this release of GCC should now match more of the
  configuration used in the stock FreeBSD configuration of GCC.  In
! particular, '--enable-threads' is now configured by default.  However,
  as a general user, do not attempt to replace the system compiler with
! this release.  Known to bootstrap and check with good results on FreeBSD
! 7.2-STABLE.  In the past, known to bootstrap and check with good results
! on FreeBSD 3.0, 3.4, 4.0, 4.2, 4.3, 4.4, 4.5, 4.8, 4.9 and 5-CURRENT.
  
!    The version of binutils installed in '/usr/bin' probably works with
  this release of GCC.  Bootstrapping against the latest GNU binutils
! and/or the version found in '/usr/ports/devel/binutils' has been known
  to enable additional features and improve overall testsuite results.
  However, it is currently known that boehm-gc (which itself is required
! for java) may not configure properly on FreeBSD prior to the FreeBSD 7.0
! release with GNU binutils after 2.16.1.
  
  h8300-hms
  =========
*************** Support for HP-UX version 9 and older wa
*** 3048,3065 ****
     We require using gas/binutils on all hppa platforms.  Version 2.19 or
  later is recommended.
  
!    It may be helpful to configure GCC with the `--with-gnu-as' and
! `--with-as=...' options to ensure that GCC can find GAS.
  
!    The HP assembler should not be used with GCC.  It is rarely tested
! and may not work.  It shouldn't be used with any languages other than C
! due to its many limitations.
  
!    Specifically, `-g' does not work (HP-UX uses a peculiar debugging
  format which GCC does not know about).  It also inserts timestamps into
! each object file it creates, causing the 3-stage comparison test to
! fail during a bootstrap.  You should be able to continue by saying
! `make all-host all-target' after getting the failure from `make'.
  
     Various GCC features are not supported.  For example, it does not
  support weak symbols or alias definitions.  As a result, explicit
--- 3001,3018 ----
     We require using gas/binutils on all hppa platforms.  Version 2.19 or
  later is recommended.
  
!    It may be helpful to configure GCC with the '--with-gnu-as' and
! '--with-as=...' options to ensure that GCC can find GAS.
  
!    The HP assembler should not be used with GCC. It is rarely tested and
! may not work.  It shouldn't be used with any languages other than C due
! to its many limitations.
  
!    Specifically, '-g' does not work (HP-UX uses a peculiar debugging
  format which GCC does not know about).  It also inserts timestamps into
! each object file it creates, causing the 3-stage comparison test to fail
! during a bootstrap.  You should be able to continue by saying 'make
! all-host all-target' after getting the failure from 'make'.
  
     Various GCC features are not supported.  For example, it does not
  support weak symbols or alias definitions.  As a result, explicit
*************** difficult if not impossible to build man
*** 3070,3076 ****
  PROCESSOR_7100LC and PROCESSOR_8000.  They are selected from the pa-risc
  architecture specified for the target machine when configuring.
  PROCESSOR_8000 is the default.  PROCESSOR_7100LC is selected when the
! target is a `hppa1*' machine.
  
     The PROCESSOR_8000 model is not well suited to older processors.
  Thus, it is important to completely specify the machine architecture
--- 3023,3029 ----
  PROCESSOR_7100LC and PROCESSOR_8000.  They are selected from the pa-risc
  architecture specified for the target machine when configuring.
  PROCESSOR_8000 is the default.  PROCESSOR_7100LC is selected when the
! target is a 'hppa1*' machine.
  
     The PROCESSOR_8000 model is not well suited to older processors.
  Thus, it is important to completely specify the machine architecture
*************** when configuring if you want a model oth
*** 3078,3100 ****
  macro TARGET_SCHED_DEFAULT can be defined in BOOT_CFLAGS if a different
  default scheduling model is desired.
  
!    As of GCC 4.0, GCC uses the UNIX 95 namespace for HP-UX 10.10
! through 11.00, and the UNIX 98 namespace for HP-UX 11.11 and later.
! This namespace change might cause problems when bootstrapping with an
! earlier version of GCC or the HP compiler as essentially the same
! namespace is required for an entire build.  This problem can be avoided
! in a number of ways.  With HP cc, `UNIX_STD' can be set to `95' or
! `98'.  Another way is to add an appropriate set of predefines to `CC'.
! The description for the `munix=' option contains a list of the
! predefines used with each standard.
  
!    More specific information to `hppa*-hp-hpux*' targets follows.
  
  hppa*-hp-hpux10
  ===============
  
  For hpux10.20, we _highly_ recommend you pick up the latest sed patch
! `PHCO_19798' from HP.
  
     The C++ ABI has changed incompatibly in GCC 4.0.  COMDAT subspaces
  are used for one-only code and data.  This resolves many of the previous
--- 3031,3053 ----
  macro TARGET_SCHED_DEFAULT can be defined in BOOT_CFLAGS if a different
  default scheduling model is desired.
  
!    As of GCC 4.0, GCC uses the UNIX 95 namespace for HP-UX 10.10 through
! 11.00, and the UNIX 98 namespace for HP-UX 11.11 and later.  This
! namespace change might cause problems when bootstrapping with an earlier
! version of GCC or the HP compiler as essentially the same namespace is
! required for an entire build.  This problem can be avoided in a number
! of ways.  With HP cc, 'UNIX_STD' can be set to '95' or '98'.  Another
! way is to add an appropriate set of predefines to 'CC'.  The description
! for the 'munix=' option contains a list of the predefines used with each
! standard.
  
!    More specific information to 'hppa*-hp-hpux*' targets follows.
  
  hppa*-hp-hpux10
  ===============
  
  For hpux10.20, we _highly_ recommend you pick up the latest sed patch
! 'PHCO_19798' from HP.
  
     The C++ ABI has changed incompatibly in GCC 4.0.  COMDAT subspaces
  are used for one-only code and data.  This resolves many of the previous
*************** hppa*-hp-hpux11
*** 3108,3120 ****
  GCC 3.0 and up support HP-UX 11.  GCC 2.95.x is not supported and cannot
  be used to compile GCC 3.0 and up.
  
!    The libffi and libjava libraries haven't been ported to 64-bit HP-UX
! and don't build.
  
     Refer to binaries for information about obtaining precompiled GCC
  binaries for HP-UX.  Precompiled binaries must be obtained to build the
! Ada language as it can't be bootstrapped using C.  Ada is only
! available for the 32-bit PA-RISC runtime.
  
     Starting with GCC 3.4 an ISO C compiler is required to bootstrap.
  The bundled compiler supports only traditional C; you will need either
--- 3061,3073 ----
  GCC 3.0 and up support HP-UX 11.  GCC 2.95.x is not supported and cannot
  be used to compile GCC 3.0 and up.
  
!    The libffi and libjava libraries haven't been ported to 64-bit
! HP-UX and don't build.
  
     Refer to binaries for information about obtaining precompiled GCC
  binaries for HP-UX.  Precompiled binaries must be obtained to build the
! Ada language as it can't be bootstrapped using C.  Ada is only available
! for the 32-bit PA-RISC runtime.
  
     Starting with GCC 3.4 an ISO C compiler is required to bootstrap.
  The bundled compiler supports only traditional C; you will need either
*************** compiler, but the process requires sever
*** 3125,3131 ****
  used to build later versions.  The fastjar program contains ISO C code
  and can't be built with the HP bundled compiler.  This problem can be
  avoided by not building the Java language.  For example, use the
! `--enable-languages="c,c++,f77,objc"' option in your configure command.
  
     There are several possible approaches to building the distribution.
  Binutils can be built first using the HP tools.  Then, the GCC
--- 3078,3084 ----
  used to build later versions.  The fastjar program contains ISO C code
  and can't be built with the HP bundled compiler.  This problem can be
  avoided by not building the Java language.  For example, use the
! '--enable-languages="c,c++,f77,objc"' option in your configure command.
  
     There are several possible approaches to building the distribution.
  Binutils can be built first using the HP tools.  Then, the GCC
*************** start from a binary distribution.
*** 3136,3214 ****
  
     On 64-bit capable systems, there are two distinct targets.  Different
  installation prefixes must be used if both are to be installed on the
! same system.  The `hppa[1-2]*-hp-hpux11*' target generates code for the
  32-bit PA-RISC runtime architecture and uses the HP linker.  The
! `hppa64-hp-hpux11*' target generates 64-bit code for the PA-RISC 2.0
  architecture.
  
     The script config.guess now selects the target type based on the
! compiler detected during configuration.  You must define `PATH' or `CC'
  so that configure finds an appropriate compiler for the initial
! bootstrap.  When `CC' is used, the definition should contain the
! options that are needed whenever `CC' is used.
  
     Specifically, options that determine the runtime architecture must be
! in `CC' to correctly select the target for the build.  It is also
! convenient to place many other compiler options in `CC'.  For example,
! `CC="cc -Ac +DA2.0W -Wp,-H16376 -D_CLASSIC_TYPES -D_HPUX_SOURCE"' can
! be used to bootstrap the GCC 3.3 branch with the HP compiler in 64-bit
! K&R/bundled mode.  The `+DA2.0W' option will result in the automatic
! selection of the `hppa64-hp-hpux11*' target.  The macro definition
! table of cpp needs to be increased for a successful build with the HP
  compiler.  _CLASSIC_TYPES and _HPUX_SOURCE need to be defined when
! building with the bundled compiler, or when using the `-Ac' option.
! These defines aren't necessary with `-Ae'.
  
!    It is best to explicitly configure the `hppa64-hp-hpux11*' target
! with the `--with-ld=...' option.  This overrides the standard search
! for ld.  The two linkers supported on this target require different
  commands.  The default linker is determined during configuration.  As a
  result, it's not possible to switch linkers in the middle of a GCC
  build.  This has been reported to sometimes occur in unified builds of
  binutils and GCC.
  
     A recent linker patch must be installed for the correct operation of
! GCC 3.3 and later.  `PHSS_26559' and `PHSS_24304' are the oldest linker
  patches that are known to work.  They are for HP-UX 11.00 and 11.11,
! respectively.  `PHSS_24303', the companion to `PHSS_24304', might be
  usable but it hasn't been tested.  These patches have been superseded.
! Consult the HP patch database to obtain the currently recommended
! linker patch for your system.
  
     The patches are necessary for the support of weak symbols on the
  32-bit port, and for the running of initializers and finalizers.  Weak
  symbols are implemented using SOM secondary definition symbols.  Prior
  to HP-UX 11, there are bugs in the linker support for secondary symbols.
  The patches correct a problem of linker core dumps creating shared
! libraries containing secondary symbols, as well as various other
! linking issues involving secondary symbols.
  
     GCC 3.3 uses the ELF DT_INIT_ARRAY and DT_FINI_ARRAY capabilities to
  run initializers and finalizers on the 64-bit port.  The 32-bit port
! uses the linker `+init' and `+fini' options for the same purpose.  The
! patches correct various problems with the +init/+fini options,
! including program core dumps.  Binutils 2.14 corrects a problem on the
! 64-bit port resulting from HP's non-standard use of the .init and .fini
! sections for array initializers and finalizers.
  
     Although the HP and GNU linkers are both supported for the
! `hppa64-hp-hpux11*' target, it is strongly recommended that the HP
  linker be used for link editing on this target.
  
     At this time, the GNU linker does not support the creation of long
  branch stubs.  As a result, it can't successfully link binaries
  containing branch offsets larger than 8 megabytes.  In addition, there
  are problems linking shared libraries, linking executables with
! `-static', and with dwarf2 unwind and exception support.  It also
  doesn't provide stubs for internal calls to global functions in shared
  libraries, so these calls can't be overloaded.
  
     The HP dynamic loader does not support GNU symbol versioning, so
  symbol versioning is not supported.  It may be necessary to disable
! symbol versioning with `--disable-symvers' when using GNU ld.
  
     POSIX threads are the default.  The optional DCE thread library is
! not supported, so `--enable-threads=dce' does not work.
  
  *-*-linux-gnu
  =============
--- 3089,3167 ----
  
     On 64-bit capable systems, there are two distinct targets.  Different
  installation prefixes must be used if both are to be installed on the
! same system.  The 'hppa[1-2]*-hp-hpux11*' target generates code for the
  32-bit PA-RISC runtime architecture and uses the HP linker.  The
! 'hppa64-hp-hpux11*' target generates 64-bit code for the PA-RISC 2.0
  architecture.
  
     The script config.guess now selects the target type based on the
! compiler detected during configuration.  You must define 'PATH' or 'CC'
  so that configure finds an appropriate compiler for the initial
! bootstrap.  When 'CC' is used, the definition should contain the options
! that are needed whenever 'CC' is used.
  
     Specifically, options that determine the runtime architecture must be
! in 'CC' to correctly select the target for the build.  It is also
! convenient to place many other compiler options in 'CC'.  For example,
! 'CC="cc -Ac +DA2.0W -Wp,-H16376 -D_CLASSIC_TYPES -D_HPUX_SOURCE"' can be
! used to bootstrap the GCC 3.3 branch with the HP compiler in 64-bit
! K&R/bundled mode.  The '+DA2.0W' option will result in the automatic
! selection of the 'hppa64-hp-hpux11*' target.  The macro definition table
! of cpp needs to be increased for a successful build with the HP
  compiler.  _CLASSIC_TYPES and _HPUX_SOURCE need to be defined when
! building with the bundled compiler, or when using the '-Ac' option.
! These defines aren't necessary with '-Ae'.
  
!    It is best to explicitly configure the 'hppa64-hp-hpux11*' target
! with the '--with-ld=...' option.  This overrides the standard search for
! ld.  The two linkers supported on this target require different
  commands.  The default linker is determined during configuration.  As a
  result, it's not possible to switch linkers in the middle of a GCC
  build.  This has been reported to sometimes occur in unified builds of
  binutils and GCC.
  
     A recent linker patch must be installed for the correct operation of
! GCC 3.3 and later.  'PHSS_26559' and 'PHSS_24304' are the oldest linker
  patches that are known to work.  They are for HP-UX 11.00 and 11.11,
! respectively.  'PHSS_24303', the companion to 'PHSS_24304', might be
  usable but it hasn't been tested.  These patches have been superseded.
! Consult the HP patch database to obtain the currently recommended linker
! patch for your system.
  
     The patches are necessary for the support of weak symbols on the
  32-bit port, and for the running of initializers and finalizers.  Weak
  symbols are implemented using SOM secondary definition symbols.  Prior
  to HP-UX 11, there are bugs in the linker support for secondary symbols.
  The patches correct a problem of linker core dumps creating shared
! libraries containing secondary symbols, as well as various other linking
! issues involving secondary symbols.
  
     GCC 3.3 uses the ELF DT_INIT_ARRAY and DT_FINI_ARRAY capabilities to
  run initializers and finalizers on the 64-bit port.  The 32-bit port
! uses the linker '+init' and '+fini' options for the same purpose.  The
! patches correct various problems with the +init/+fini options, including
! program core dumps.  Binutils 2.14 corrects a problem on the 64-bit port
! resulting from HP's non-standard use of the .init and .fini sections for
! array initializers and finalizers.
  
     Although the HP and GNU linkers are both supported for the
! 'hppa64-hp-hpux11*' target, it is strongly recommended that the HP
  linker be used for link editing on this target.
  
     At this time, the GNU linker does not support the creation of long
  branch stubs.  As a result, it can't successfully link binaries
  containing branch offsets larger than 8 megabytes.  In addition, there
  are problems linking shared libraries, linking executables with
! '-static', and with dwarf2 unwind and exception support.  It also
  doesn't provide stubs for internal calls to global functions in shared
  libraries, so these calls can't be overloaded.
  
     The HP dynamic loader does not support GNU symbol versioning, so
  symbol versioning is not supported.  It may be necessary to disable
! symbol versioning with '--disable-symvers' when using GNU ld.
  
     POSIX threads are the default.  The optional DCE thread library is
! not supported, so '--enable-threads=dce' does not work.
  
  *-*-linux-gnu
  =============
*************** i?86-*-solaris2.10
*** 3231,3287 ****
  ==================
  
  Use this for Solaris 10 or later on x86 and x86-64 systems.  Starting
! with GCC 4.7, there is also a 64-bit `amd64-*-solaris2.1[0-9]*' or
! `x86_64-*-solaris2.1[0-9]*' configuration that corresponds to
! `sparcv9-sun-solaris2*'.
  
     It is recommended that you configure GCC to use the GNU assembler, in
! `/usr/sfw/bin/gas'.  The versions included in Solaris 10, from GNU
  binutils 2.15, and Solaris 11, from GNU binutils 2.19, work fine,
  although the current version, from GNU binutils 2.22, is known to work,
! too.  Recent versions of the Sun assembler in `/usr/ccs/bin/as' work
  almost as well, though.
  
     For linking, the Sun linker, is preferred.  If you want to use the
! GNU linker instead, which is available in `/usr/sfw/bin/gld', note that
  due to a packaging bug the version in Solaris 10, from GNU binutils
  2.15, cannot be used, while the version in Solaris 11, from GNU binutils
  2.19, works, as does the latest version, from GNU binutils 2.22.
  
!    To use GNU `as', configure with the options `--with-gnu-as
  --with-as=/usr/sfw/bin/gas'.  It may be necessary to configure with
! `--without-gnu-ld --with-ld=/usr/ccs/bin/ld' to guarantee use of Sun
! `ld'.
  
  ia64-*-linux
  ============
  
! IA-64 processor (also known as IPF, or Itanium Processor Family)
! running GNU/Linux.
  
     If you are using the installed system libunwind library with
! `--with-system-libunwind', then you must use libunwind 0.98 or later.
  
     None of the following versions of GCC has an ABI that is compatible
! with any of the other versions in this list, with the exception that
! Red Hat 2.96 and Trillian 000171 are compatible with each other: 3.1,
! 3.0.2, 3.0.1, 3.0, Red Hat 2.96, and Trillian 000717.  This primarily
! affects C++ programs and programs that create shared libraries.  GCC
! 3.1 or later is recommended for compiling linux, the kernel.  As of
! version 3.1 GCC is believed to be fully ABI compliant, and hence no
! more major ABI changes are expected.
  
  ia64-*-hpux*
  ============
  
  Building GCC on this target requires the GNU Assembler.  The bundled HP
  assembler will not work.  To prevent GCC from using the wrong assembler,
! the option `--with-gnu-as' may be necessary.
  
     The GCC libunwind library has not been ported to HPUX.  This means
! that for GCC versions 3.2.3 and earlier, `--enable-libunwind-exceptions'
  is required to build GCC.  For GCC 3.3 and later, this is the default.
! For gcc 3.4.3 and later, `--enable-libunwind-exceptions' is removed and
  the system libunwind library will always be used.
  
  *-ibm-aix*
--- 3184,3240 ----
  ==================
  
  Use this for Solaris 10 or later on x86 and x86-64 systems.  Starting
! with GCC 4.7, there is also a 64-bit 'amd64-*-solaris2.1[0-9]*' or
! 'x86_64-*-solaris2.1[0-9]*' configuration that corresponds to
! 'sparcv9-sun-solaris2*'.
  
     It is recommended that you configure GCC to use the GNU assembler, in
! '/usr/sfw/bin/gas'.  The versions included in Solaris 10, from GNU
  binutils 2.15, and Solaris 11, from GNU binutils 2.19, work fine,
  although the current version, from GNU binutils 2.22, is known to work,
! too.  Recent versions of the Sun assembler in '/usr/ccs/bin/as' work
  almost as well, though.
  
     For linking, the Sun linker, is preferred.  If you want to use the
! GNU linker instead, which is available in '/usr/sfw/bin/gld', note that
  due to a packaging bug the version in Solaris 10, from GNU binutils
  2.15, cannot be used, while the version in Solaris 11, from GNU binutils
  2.19, works, as does the latest version, from GNU binutils 2.22.
  
!    To use GNU 'as', configure with the options '--with-gnu-as
  --with-as=/usr/sfw/bin/gas'.  It may be necessary to configure with
! '--without-gnu-ld --with-ld=/usr/ccs/bin/ld' to guarantee use of Sun
! 'ld'.
  
  ia64-*-linux
  ============
  
! IA-64 processor (also known as IPF, or Itanium Processor Family) running
! GNU/Linux.
  
     If you are using the installed system libunwind library with
! '--with-system-libunwind', then you must use libunwind 0.98 or later.
  
     None of the following versions of GCC has an ABI that is compatible
! with any of the other versions in this list, with the exception that Red
! Hat 2.96 and Trillian 000171 are compatible with each other: 3.1, 3.0.2,
! 3.0.1, 3.0, Red Hat 2.96, and Trillian 000717.  This primarily affects
! C++ programs and programs that create shared libraries.  GCC 3.1 or
! later is recommended for compiling linux, the kernel.  As of version 3.1
! GCC is believed to be fully ABI compliant, and hence no more major ABI
! changes are expected.
  
  ia64-*-hpux*
  ============
  
  Building GCC on this target requires the GNU Assembler.  The bundled HP
  assembler will not work.  To prevent GCC from using the wrong assembler,
! the option '--with-gnu-as' may be necessary.
  
     The GCC libunwind library has not been ported to HPUX.  This means
! that for GCC versions 3.2.3 and earlier, '--enable-libunwind-exceptions'
  is required to build GCC.  For GCC 3.3 and later, this is the default.
! For gcc 3.4.3 and later, '--enable-libunwind-exceptions' is removed and
  the system libunwind library will always be used.
  
  *-ibm-aix*
*************** Support for AIX version 4.2 and older wa
*** 3292,3298 ****
  
     "out of memory" bootstrap failures may indicate a problem with
  process resource limits (ulimit).  Hard limits are configured in the
! `/etc/security/limits' system configuration file.
  
     GCC can bootstrap with recent versions of IBM XLC, but bootstrapping
  with an earlier release of GCC is recommended.  Bootstrapping with XLC
--- 3245,3251 ----
  
     "out of memory" bootstrap failures may indicate a problem with
  process resource limits (ulimit).  Hard limits are configured in the
! '/etc/security/limits' system configuration file.
  
     GCC can bootstrap with recent versions of IBM XLC, but bootstrapping
  with an earlier release of GCC is recommended.  Bootstrapping with XLC
*************** LDR_CNTRL environment variable, e.g.,
*** 3303,3313 ****
       % export LDR_CNTRL
  
     One can start with a pre-compiled version of GCC to build from
! sources.  One may delete GCC's "fixed" header files when starting with
! a version of GCC built for an earlier release of AIX.
  
     To speed up the configuration phases of bootstrapping and installing
! GCC, one may use GNU Bash instead of AIX `/bin/sh', e.g.,
  
       % CONFIG_SHELL=/opt/freeware/bin/bash
       % export CONFIG_SHELL
--- 3256,3266 ----
       % export LDR_CNTRL
  
     One can start with a pre-compiled version of GCC to build from
! sources.  One may delete GCC's "fixed" header files when starting with a
! version of GCC built for an earlier release of AIX.
  
     To speed up the configuration phases of bootstrapping and installing
! GCC, one may use GNU Bash instead of AIX '/bin/sh', e.g.,
  
       % CONFIG_SHELL=/opt/freeware/bin/bash
       % export CONFIG_SHELL
*************** SRCDIR/configure.
*** 3318,3337 ****
  
     Because GCC on AIX is built as a 32-bit executable by default,
  (although it can generate 64-bit programs) the GMP and MPFR libraries
! required by gfortran must be 32-bit libraries.  Building GMP and MPFR
! as static archive libraries works better than shared libraries.
  
!    Errors involving `alloca' when building GCC generally are due to an
! incorrect definition of `CC' in the Makefile or mixing files compiled
  with the native C compiler and GCC.  During the stage1 phase of the
! build, the native AIX compiler *must* be invoked as `cc' (not `xlc').
! Once `configure' has been informed of `xlc', one needs to use `make
! distclean' to remove the configure cache files and ensure that `CC'
  environment variable does not provide a definition that will confuse
! `configure'.  If this error occurs during stage2 or later, then the
  problem most likely is the version of Make (see above).
  
!    The native `as' and `ld' are recommended for bootstrapping on AIX.
  The GNU Assembler, GNU Linker, and GNU Binutils version 2.20 is the
  minimum level that supports bootstrap on AIX 5.  The GNU Assembler has
  not been updated to support AIX 6 or AIX 7.  The native AIX tools do
--- 3271,3290 ----
  
     Because GCC on AIX is built as a 32-bit executable by default,
  (although it can generate 64-bit programs) the GMP and MPFR libraries
! required by gfortran must be 32-bit libraries.  Building GMP and MPFR as
! static archive libraries works better than shared libraries.
  
!    Errors involving 'alloca' when building GCC generally are due to an
! incorrect definition of 'CC' in the Makefile or mixing files compiled
  with the native C compiler and GCC.  During the stage1 phase of the
! build, the native AIX compiler *must* be invoked as 'cc' (not 'xlc').
! Once 'configure' has been informed of 'xlc', one needs to use 'make
! distclean' to remove the configure cache files and ensure that 'CC'
  environment variable does not provide a definition that will confuse
! 'configure'.  If this error occurs during stage2 or later, then the
  problem most likely is the version of Make (see above).
  
!    The native 'as' and 'ld' are recommended for bootstrapping on AIX.
  The GNU Assembler, GNU Linker, and GNU Binutils version 2.20 is the
  minimum level that supports bootstrap on AIX 5.  The GNU Assembler has
  not been updated to support AIX 6 or AIX 7.  The native AIX tools do
*************** assembler change that sometimes produces
*** 3342,3380 ****
  AIX linker errors.  The bug breaks GCC bootstrap on AIX and can cause
  compilation failures with existing GCC installations.  An AIX iFix for
  AIX 5.3 is available (APAR IZ98385 for AIX 5.3 TL10, APAR IZ98477 for
! AIX 5.3 TL11 and IZ98134 for AIX 5.3 TL12). AIX 5.3 TL11 SP8, AIX 5.3
! TL12 SP5, AIX 6.1 TL04 SP11, AIX 6.1 TL05 SP7, AIX 6.1 TL06 SP6, AIX
! 6.1 TL07 and AIX 7.1 TL01 should include the fix.
  
!    Building `libstdc++.a' requires a fix for an AIX Assembler bug APAR
! IY26685 (AIX 4.3) or APAR IY25528 (AIX 5.1).  It also requires a fix
! for another AIX Assembler bug and a co-dependent AIX Archiver fix
! referenced as APAR IY53606 (AIX 5.2) or as APAR IY54774 (AIX 5.1)
  
!    `libstdc++' in GCC 3.4 increments the major version number of the
! shared object and GCC installation places the `libstdc++.a' shared
  library in a common location which will overwrite the and GCC 3.3
! version of the shared library.  Applications either need to be
! re-linked against the new shared library or the GCC 3.1 and GCC 3.3
! versions of the `libstdc++' shared object needs to be available to the
! AIX runtime loader.  The GCC 3.1 `libstdc++.so.4', if present, and GCC
! 3.3 `libstdc++.so.5' shared objects can be installed for runtime
! dynamic loading using the following steps to set the `F_LOADONLY' flag
! in the shared object for _each_ multilib `libstdc++.a' installed:
  
!    Extract the shared objects from the currently installed
! `libstdc++.a' archive:
       % ar -x libstdc++.a libstdc++.so.4 libstdc++.so.5
  
!    Enable the `F_LOADONLY' flag so that the shared object will be
  available for runtime dynamic loading, but not linking:
       % strip -e libstdc++.so.4 libstdc++.so.5
  
!    Archive the runtime-only shared object in the GCC 3.4 `libstdc++.a'
  archive:
       % ar -q libstdc++.a libstdc++.so.4 libstdc++.so.5
  
!    Eventually, the `--with-aix-soname=svr4' configure option may drop
  the need for this procedure for libraries that support it.
  
     Linking executables and shared libraries may produce warnings of
--- 3295,3333 ----
  AIX linker errors.  The bug breaks GCC bootstrap on AIX and can cause
  compilation failures with existing GCC installations.  An AIX iFix for
  AIX 5.3 is available (APAR IZ98385 for AIX 5.3 TL10, APAR IZ98477 for
! AIX 5.3 TL11 and IZ98134 for AIX 5.3 TL12).  AIX 5.3 TL11 SP8, AIX 5.3
! TL12 SP5, AIX 6.1 TL04 SP11, AIX 6.1 TL05 SP7, AIX 6.1 TL06 SP6, AIX 6.1
! TL07 and AIX 7.1 TL01 should include the fix.
  
!    Building 'libstdc++.a' requires a fix for an AIX Assembler bug APAR
! IY26685 (AIX 4.3) or APAR IY25528 (AIX 5.1).  It also requires a fix for
! another AIX Assembler bug and a co-dependent AIX Archiver fix referenced
! as APAR IY53606 (AIX 5.2) or as APAR IY54774 (AIX 5.1)
  
!    'libstdc++' in GCC 3.4 increments the major version number of the
! shared object and GCC installation places the 'libstdc++.a' shared
  library in a common location which will overwrite the and GCC 3.3
! version of the shared library.  Applications either need to be re-linked
! against the new shared library or the GCC 3.1 and GCC 3.3 versions of
! the 'libstdc++' shared object needs to be available to the AIX runtime
! loader.  The GCC 3.1 'libstdc++.so.4', if present, and GCC 3.3
! 'libstdc++.so.5' shared objects can be installed for runtime dynamic
! loading using the following steps to set the 'F_LOADONLY' flag in the
! shared object for _each_ multilib 'libstdc++.a' installed:
  
!    Extract the shared objects from the currently installed 'libstdc++.a'
! archive:
       % ar -x libstdc++.a libstdc++.so.4 libstdc++.so.5
  
!    Enable the 'F_LOADONLY' flag so that the shared object will be
  available for runtime dynamic loading, but not linking:
       % strip -e libstdc++.so.4 libstdc++.so.5
  
!    Archive the runtime-only shared object in the GCC 3.4 'libstdc++.a'
  archive:
       % ar -q libstdc++.a libstdc++.so.4 libstdc++.so.5
  
!    Eventually, the '--with-aix-soname=svr4' configure option may drop
  the need for this procedure for libraries that support it.
  
     Linking executables and shared libraries may produce warnings of
*************** executable.
*** 3389,3401 ****
  to parse archive libraries did not handle the new format correctly.
  These routines are used by GCC and result in error messages during
  linking such as "not a COFF file".  The version of the routines shipped
! with AIX 4.3.1 should work for a 32-bit environment.  The `-g' option
! of the archive command may be used to create archives of 32-bit objects
! using the original "small format".  A correct version of the routines
! is shipped with AIX 4.3.2 and above.
  
     Some versions of the AIX binder (linker) can fail with a relocation
! overflow severe error when the `-bbigtoc' option is used to link
  GCC-produced object files into an executable that overflows the TOC.  A
  fix for APAR IX75823 (OVERFLOW DURING LINK WHEN USING GCC AND -BBIGTOC)
  is available from IBM Customer Support and from its
--- 3342,3354 ----
  to parse archive libraries did not handle the new format correctly.
  These routines are used by GCC and result in error messages during
  linking such as "not a COFF file".  The version of the routines shipped
! with AIX 4.3.1 should work for a 32-bit environment.  The '-g' option of
! the archive command may be used to create archives of 32-bit objects
! using the original "small format".  A correct version of the routines is
! shipped with AIX 4.3.2 and above.
  
     Some versions of the AIX binder (linker) can fail with a relocation
! overflow severe error when the '-bbigtoc' option is used to link
  GCC-produced object files into an executable that overflows the TOC.  A
  fix for APAR IX75823 (OVERFLOW DURING LINK WHEN USING GCC AND -BBIGTOC)
  is available from IBM Customer Support and from its
*************** and from its techsupport.services.ibm.co
*** 3414,3428 ****
  fix is incorporated in AIX 4.3.1 and above.
  
     AIX provides National Language Support (NLS).  Compilers and
! assemblers use NLS to support locale-specific representations of
! various data formats including floating-point numbers (e.g., `.'  vs
! `,' for separating decimal fractions).  There have been problems
! reported where GCC does not produce the same floating-point formats
! that the assembler expects.  If one encounters this problem, set the
! `LANG' environment variable to `C' or `En_US'.
  
!    A default can be specified with the `-mcpu=CPU_TYPE' switch and
! using the configure option `--with-cpu-CPU_TYPE'.
  
  iq2000-*-elf
  ============
--- 3367,3381 ----
  fix is incorporated in AIX 4.3.1 and above.
  
     AIX provides National Language Support (NLS).  Compilers and
! assemblers use NLS to support locale-specific representations of various
! data formats including floating-point numbers (e.g., '.' vs ',' for
! separating decimal fractions).  There have been problems reported where
! GCC does not produce the same floating-point formats that the assembler
! expects.  If one encounters this problem, set the 'LANG' environment
! variable to 'C' or 'En_US'.
  
!    A default can be specified with the '-mcpu=CPU_TYPE' switch and using
! the configure option '--with-cpu-CPU_TYPE'.
  
  iq2000-*-elf
  ============
*************** systems.
*** 3457,3479 ****
  m68k-*-*
  ========
  
! By default, `m68k-*-elf*', `m68k-*-rtems',  `m68k-*-uclinux' and
! `m68k-*-linux' build libraries for both M680x0 and ColdFire processors.
! If you only need the M680x0 libraries, you can omit the ColdFire ones
! by passing `--with-arch=m68k' to `configure'.  Alternatively, you can
! omit the M680x0 libraries by passing `--with-arch=cf' to `configure'.
! These targets default to 5206 or 5475 code as appropriate for the
! target system when configured with `--with-arch=cf' and 68020 code
! otherwise.
  
!    The `m68k-*-netbsd' and `m68k-*-openbsd' targets also support the
! `--with-arch' option.  They will generate ColdFire CFV4e code when
! configured with `--with-arch=cf' and 68020 code otherwise.
  
     You can override the default processors listed above by configuring
! with `--with-cpu=TARGET'.  This TARGET can either be a `-mcpu' argument
! or one of the following values: `m68000', `m68010', `m68020', `m68030',
! `m68040', `m68060', `m68020-40' and `m68020-60'.
  
     GCC requires at least binutils version 2.17 on these targets.
  
--- 3410,3431 ----
  m68k-*-*
  ========
  
! By default, 'm68k-*-elf*', 'm68k-*-rtems', 'm68k-*-uclinux' and
! 'm68k-*-linux' build libraries for both M680x0 and ColdFire processors.
! If you only need the M680x0 libraries, you can omit the ColdFire ones by
! passing '--with-arch=m68k' to 'configure'.  Alternatively, you can omit
! the M680x0 libraries by passing '--with-arch=cf' to 'configure'.  These
! targets default to 5206 or 5475 code as appropriate for the target
! system when configured with '--with-arch=cf' and 68020 code otherwise.
  
!    The 'm68k-*-netbsd' and 'm68k-*-openbsd' targets also support the
! '--with-arch' option.  They will generate ColdFire CFV4e code when
! configured with '--with-arch=cf' and 68020 code otherwise.
  
     You can override the default processors listed above by configuring
! with '--with-cpu=TARGET'.  This TARGET can either be a '-mcpu' argument
! or one of the following values: 'm68000', 'm68010', 'm68020', 'm68030',
! 'm68040', 'm68060', 'm68020-40' and 'm68020-60'.
  
     GCC requires at least binutils version 2.17 on these targets.
  
*************** m68k-*-uclinux
*** 3481,3487 ****
  ==============
  
  GCC 4.3 changed the uClinux configuration so that it uses the
! `m68k-linux-gnu' ABI rather than the `m68k-elf' ABI.  It also added
  improved support for C++ and flat shared libraries, both of which were
  ABI changes.
  
--- 3433,3439 ----
  ==============
  
  GCC 4.3 changed the uClinux configuration so that it uses the
! 'm68k-linux-gnu' ABI rather than the 'm68k-elf' ABI. It also added
  improved support for C++ and flat shared libraries, both of which were
  ABI changes.
  
*************** optional, and there should not be a warn
*** 3511,3546 ****
  
     The libstdc++ atomic locking routines for MIPS targets requires MIPS
  II and later.  A patch went in just after the GCC 3.3 release to make
! `mips*-*-*' use the generic implementation instead.  You can also
! configure for `mipsel-elf' as a workaround.  The `mips*-*-linux*'
! target continues to use the MIPS II routines.  More work on this is
! expected in future releases.
  
!    The built-in `__sync_*' functions are available on MIPS II and later
! systems and others that support the `ll', `sc' and `sync' instructions.
! This can be overridden by passing `--with-llsc' or `--without-llsc'
! when configuring GCC.  Since the Linux kernel emulates these
! instructions if they are missing, the default for `mips*-*-linux*'
! targets is `--with-llsc'.  The `--with-llsc' and `--without-llsc'
! configure options may be overridden at compile time by passing the
! `-mllsc' or `-mno-llsc' options to the compiler.
  
     MIPS systems check for division by zero (unless
! `-mno-check-zero-division' is passed to the compiler) by generating
! either a conditional trap or a break instruction.  Using trap results
! in smaller code, but is only supported on MIPS II and later.  Also,
! some versions of the Linux kernel have a bug that prevents trap from
! generating the proper signal (`SIGFPE').  To enable the use of break,
! use the `--with-divide=breaks' `configure' option when configuring GCC.
  The default is to use traps on systems that support them.
  
     The assembler from GNU binutils 2.17 and earlier has a bug in the way
! it sorts relocations for REL targets (o32, o64, EABI).  This can cause
  bad code to be generated for simple C++ programs.  Also the linker from
  GNU binutils versions prior to 2.17 has a bug which causes the runtime
! linker stubs in very large programs, like `libgcj.so', to be
! incorrectly generated.  GNU Binutils 2.18 and later (and snapshots made
! after Nov. 9, 2006) should be free from both of these problems.
  
  mips-sgi-irix5
  ==============
--- 3463,3498 ----
  
     The libstdc++ atomic locking routines for MIPS targets requires MIPS
  II and later.  A patch went in just after the GCC 3.3 release to make
! 'mips*-*-*' use the generic implementation instead.  You can also
! configure for 'mipsel-elf' as a workaround.  The 'mips*-*-linux*' target
! continues to use the MIPS II routines.  More work on this is expected in
! future releases.
  
!    The built-in '__sync_*' functions are available on MIPS II and later
! systems and others that support the 'll', 'sc' and 'sync' instructions.
! This can be overridden by passing '--with-llsc' or '--without-llsc' when
! configuring GCC. Since the Linux kernel emulates these instructions if
! they are missing, the default for 'mips*-*-linux*' targets is
! '--with-llsc'.  The '--with-llsc' and '--without-llsc' configure options
! may be overridden at compile time by passing the '-mllsc' or '-mno-llsc'
! options to the compiler.
  
     MIPS systems check for division by zero (unless
! '-mno-check-zero-division' is passed to the compiler) by generating
! either a conditional trap or a break instruction.  Using trap results in
! smaller code, but is only supported on MIPS II and later.  Also, some
! versions of the Linux kernel have a bug that prevents trap from
! generating the proper signal ('SIGFPE').  To enable the use of break,
! use the '--with-divide=breaks' 'configure' option when configuring GCC.
  The default is to use traps on systems that support them.
  
     The assembler from GNU binutils 2.17 and earlier has a bug in the way
! it sorts relocations for REL targets (o32, o64, EABI). This can cause
  bad code to be generated for simple C++ programs.  Also the linker from
  GNU binutils versions prior to 2.17 has a bug which causes the runtime
! linker stubs in very large programs, like 'libgcj.so', to be incorrectly
! generated.  GNU Binutils 2.18 and later (and snapshots made after Nov.
! 9, 2006) should be free from both of these problems.
  
  mips-sgi-irix5
  ==============
*************** Nvidia PTX target.
*** 3582,3602 ****
  
     Instead of GNU binutils, you will need to install nvptx-tools.  Tell
  GCC where to find it:
! `--with-build-time-tools=[install-nvptx-tools]/nvptx-none/bin'.
  
     A nvptx port of newlib is available at nvptx-newlib.  It can be
! automatically built together with GCC.  For this, add a symbolic link
! to nvptx-newlib's `newlib' directory to the directory containing the
! GCC sources.
  
!    Use the `--disable-sjlj-exceptions' and
! `--enable-newlib-io-long-long' options when configuring.
  
  powerpc-*-*
  ===========
  
! You can specify a default version for the `-mcpu=CPU_TYPE' switch by
! using the configure option `--with-cpu-CPU_TYPE'.
  
     You will need binutils 2.15 or newer for a working GCC.
  
--- 3534,3554 ----
  
     Instead of GNU binutils, you will need to install nvptx-tools.  Tell
  GCC where to find it:
! '--with-build-time-tools=[install-nvptx-tools]/nvptx-none/bin'.
  
     A nvptx port of newlib is available at nvptx-newlib.  It can be
! automatically built together with GCC.  For this, add a symbolic link to
! nvptx-newlib's 'newlib' directory to the directory containing the GCC
! sources.
  
!    Use the '--disable-sjlj-exceptions' and
! '--enable-newlib-io-long-long' options when configuring.
  
  powerpc-*-*
  ===========
  
! You can specify a default version for the '-mcpu=CPU_TYPE' switch by
! using the configure option '--with-cpu-CPU_TYPE'.
  
     You will need binutils 2.15 or newer for a working GCC.
  
*************** PowerPC running Darwin (Mac OS X kernel)
*** 3607,3617 ****
  
     Pre-installed versions of Mac OS X may not include any developer
  tools, meaning that you will not be able to build GCC from source.  Tool
! binaries are available at `http://opensource.apple.com/'.
  
     This version of GCC requires at least cctools-590.36.  The
  cctools-590.36 package referenced from
! `http://gcc.gnu.org/ml/gcc/2006-03/msg00507.html' will not work on
  systems older than 10.3.9 (aka darwin7.9.0).
  
  powerpc-*-elf
--- 3559,3569 ----
  
     Pre-installed versions of Mac OS X may not include any developer
  tools, meaning that you will not be able to build GCC from source.  Tool
! binaries are available at <http://opensource.apple.com/>.
  
     This version of GCC requires at least cctools-590.36.  The
  cctools-590.36 package referenced from
! <http://gcc.gnu.org/ml/gcc/2006-03/msg00507.html> will not work on
  systems older than 10.3.9 (aka darwin7.9.0).
  
  powerpc-*-elf
*************** Embedded PowerPC system in little endian
*** 3659,3672 ****
  rl78-*-elf
  ==========
  
! The Renesas RL78 processor.  This configuration is intended for
! embedded systems.
  
  rx-*-elf
  ========
  
  The Renesas RX processor.  See
! `http://eu.renesas.com/fmwk.jsp?cnt=rx600_series_landing.jsp&fp=/products/mpumcu/rx_family/rx600_series'
  for more information about this processor.
  
  s390-*-linux*
--- 3611,3624 ----
  rl78-*-elf
  ==========
  
! The Renesas RL78 processor.  This configuration is intended for embedded
! systems.
  
  rx-*-elf
  ========
  
  The Renesas RX processor.  See
! <http://eu.renesas.com/fmwk.jsp?cnt=rx600_series_landing.jsp&fp=/products/mpumcu/rx_family/rx600_series>
  for more information about this processor.
  
  s390-*-linux*
*************** cross-compilation target only.
*** 3688,3706 ****
  *-*-solaris2*
  =============
  
! Support for Solaris 9 has been removed in GCC 4.10.  Support for Solaris
! 8 has been removed in GCC 4.8.  Support for Solaris 7 has been removed
! in GCC 4.6.
  
     Sun does not ship a C compiler with Solaris 2 before Solaris 10,
  though you can download the Sun Studio compilers for free.  In Solaris
! 10 and 11, GCC 3.4.3 is available as `/usr/sfw/bin/gcc'.  Solaris 11
! also provides GCC 4.5.2 as `/usr/gcc/4.5/bin/gcc'.  Alternatively, you
! can install a pre-built GCC to bootstrap and install GCC.  See the
  binaries page for details.
  
!    The Solaris 2 `/bin/sh' will often fail to configure `libstdc++-v3',
! `boehm-gc' or `libjava'.  We therefore recommend using the following
  initial sequence of commands
  
       % CONFIG_SHELL=/bin/ksh
--- 3640,3658 ----
  *-*-solaris2*
  =============
  
! Support for Solaris 9 has been removed in GCC 5.  Support for Solaris 8
! has been removed in GCC 4.8.  Support for Solaris 7 has been removed in
! GCC 4.6.
  
     Sun does not ship a C compiler with Solaris 2 before Solaris 10,
  though you can download the Sun Studio compilers for free.  In Solaris
! 10 and 11, GCC 3.4.3 is available as '/usr/sfw/bin/gcc'.  Solaris 11
! also provides GCC 4.5.2 as '/usr/gcc/4.5/bin/gcc'.  Alternatively, you
! can install a pre-built GCC to bootstrap and install GCC. See the
  binaries page for details.
  
!    The Solaris 2 '/bin/sh' will often fail to configure 'libstdc++-v3',
! 'boehm-gc' or 'libjava'.  We therefore recommend using the following
  initial sequence of commands
  
       % CONFIG_SHELL=/bin/ksh
*************** initial sequence of commands
*** 3708,3773 ****
  
  and proceed as described in the configure instructions.  In addition we
  strongly recommend specifying an absolute path to invoke
! `SRCDIR/configure'.
  
     Solaris 2 comes with a number of optional OS packages.  Some of these
! are needed to use GCC fully, namely `SUNWarc', `SUNWbtool', `SUNWesu',
! `SUNWhea', `SUNWlibm', `SUNWsprot', and `SUNWtoo'.  If you did not
  install all optional packages when installing Solaris 2, you will need
  to verify that the packages that GCC needs are installed.
  
!    To check whether an optional package is installed, use the `pkginfo'
! command.  To add an optional package, use the `pkgadd' command.  For
  further details, see the Solaris 2 documentation.
  
!    Trying to use the linker and other tools in `/usr/ucb' to install
! GCC has been observed to cause trouble.  For example, the linker may
! hang indefinitely.  The fix is to remove `/usr/ucb' from your `PATH'.
  
     The build process works more smoothly with the legacy Sun tools so,
! if you have `/usr/xpg4/bin' in your `PATH', we recommend that you place
! `/usr/bin' before `/usr/xpg4/bin' for the duration of the build.
  
     We recommend the use of the Sun assembler or the GNU assembler, in
! conjunction with the Sun linker.  The GNU `as' versions included in
  Solaris 10, from GNU binutils 2.15, and Solaris 11, from GNU binutils
! 2.19, are known to work.  They can be found in `/usr/sfw/bin/gas'.
! Current versions of GNU binutils (2.22) are known to work as well.
! Note that your mileage may vary if you use a combination of the GNU
! tools and the Sun tools: while the combination GNU `as' + Sun `ld'
! should reasonably work, the reverse combination Sun `as' + GNU `ld' may
! fail to build or cause memory corruption at runtime in some cases for
! C++ programs.  GNU `ld' usually works as well, although the version
! included in Solaris 10 cannot be used due to several bugs.  Again, the
! current version (2.22) is known to work, but generally lacks platform
! specific features, so better stay with Sun `ld'.  To use the LTO linker
! plugin (`-fuse-linker-plugin') with GNU `ld', GNU binutils _must_ be
! configured with `--enable-largefile'.
  
!    To enable symbol versioning in `libstdc++' with Sun `ld', you need
! to have any version of GNU `c++filt', which is part of GNU binutils.
! `libstdc++' symbol versioning will be disabled if no appropriate
! version is found.  Sun `c++filt' from the Sun Studio compilers does
! _not_ work.
  
     Sun bug 4296832 turns up when compiling X11 headers with GCC 2.95 or
! newer: `g++' will complain that types are missing.  These headers
! assume that omitting the type means `int'; this assumption worked for
! C90 but is wrong for C++, and is now wrong for C99 also.
  
     Sun bug 4927647 sometimes causes random spurious testsuite failures
  related to missing diagnostic output.  This bug doesn't affect GCC
! itself, rather it is a kernel bug triggered by the `expect' program
! which is used only by the GCC testsuite driver.  When the bug causes
! the `expect' program to miss anticipated output, extra testsuite
! failures appear.
  
  sparc*-*-*
  ==========
  
  This section contains general configuration information for all
! SPARC-based platforms.  In addition to reading this section, please
! read all other sections that match your target.
  
     Newer versions of the GNU Multiple Precision Library (GMP), the MPFR
  library and the MPC library are known to be miscompiled by earlier
--- 3660,3728 ----
  
  and proceed as described in the configure instructions.  In addition we
  strongly recommend specifying an absolute path to invoke
! 'SRCDIR/configure'.
  
     Solaris 2 comes with a number of optional OS packages.  Some of these
! are needed to use GCC fully, namely 'SUNWarc', 'SUNWbtool', 'SUNWesu',
! 'SUNWhea', 'SUNWlibm', 'SUNWsprot', and 'SUNWtoo'.  If you did not
  install all optional packages when installing Solaris 2, you will need
  to verify that the packages that GCC needs are installed.
  
!    To check whether an optional package is installed, use the 'pkginfo'
! command.  To add an optional package, use the 'pkgadd' command.  For
  further details, see the Solaris 2 documentation.
  
!    Trying to use the linker and other tools in '/usr/ucb' to install GCC
! has been observed to cause trouble.  For example, the linker may hang
! indefinitely.  The fix is to remove '/usr/ucb' from your 'PATH'.
  
     The build process works more smoothly with the legacy Sun tools so,
! if you have '/usr/xpg4/bin' in your 'PATH', we recommend that you place
! '/usr/bin' before '/usr/xpg4/bin' for the duration of the build.
  
     We recommend the use of the Sun assembler or the GNU assembler, in
! conjunction with the Sun linker.  The GNU 'as' versions included in
  Solaris 10, from GNU binutils 2.15, and Solaris 11, from GNU binutils
! 2.19, are known to work.  They can be found in '/usr/sfw/bin/gas'.
! Current versions of GNU binutils (2.22) are known to work as well.  Note
! that your mileage may vary if you use a combination of the GNU tools and
! the Sun tools: while the combination GNU 'as' + Sun 'ld' should
! reasonably work, the reverse combination Sun 'as' + GNU 'ld' may fail to
! build or cause memory corruption at runtime in some cases for C++
! programs.  GNU 'ld' usually works as well, although the version included
! in Solaris 10 cannot be used due to several bugs.  Again, the current
! version (2.22) is known to work, but generally lacks platform specific
! features, so better stay with Sun 'ld'.  To use the LTO linker plugin
! ('-fuse-linker-plugin') with GNU 'ld', GNU binutils _must_ be configured
! with '--enable-largefile'.
  
!    To enable symbol versioning in 'libstdc++' with the Sun linker, you
! need to have any version of GNU 'c++filt', which is part of GNU
! binutils.  'libstdc++' symbol versioning will be disabled if no
! appropriate version is found.  Sun 'c++filt' from the Sun Studio
! compilers does _not_ work.
! 
!    GNU 'make' version 3.81 or later is required to build libjava with
! the Sun linker.
  
     Sun bug 4296832 turns up when compiling X11 headers with GCC 2.95 or
! newer: 'g++' will complain that types are missing.  These headers assume
! that omitting the type means 'int'; this assumption worked for C90 but
! is wrong for C++, and is now wrong for C99 also.
  
     Sun bug 4927647 sometimes causes random spurious testsuite failures
  related to missing diagnostic output.  This bug doesn't affect GCC
! itself, rather it is a kernel bug triggered by the 'expect' program
! which is used only by the GCC testsuite driver.  When the bug causes the
! 'expect' program to miss anticipated output, extra testsuite failures
! appear.
  
  sparc*-*-*
  ==========
  
  This section contains general configuration information for all
! SPARC-based platforms.  In addition to reading this section, please read
! all other sections that match your target.
  
     Newer versions of the GNU Multiple Precision Library (GMP), the MPFR
  library and the MPC library are known to be miscompiled by earlier
*************** this difference is quite significant for
*** 3784,3798 ****
  information.
  
     Starting with Solaris 7, the operating system is capable of executing
! 64-bit SPARC V9 binaries.  GCC 3.1 and later properly supports this;
! the `-m64' option enables 64-bit code generation.  However, if all you
! want is code tuned for the UltraSPARC CPU, you should try the
! `-mtune=ultrasparc' option instead, which produces code that, unlike
  full 64-bit code, can still run on non-UltraSPARC machines.
  
     When configuring on a Solaris 7 or later system that is running a
  kernel that supports only 32-bit binaries, one must configure with
! `--disable-multilib', since we will not be able to build the 64-bit
  target libraries.
  
     GCC 3.3 and GCC 3.4 trigger code generation bugs in earlier versions
--- 3739,3753 ----
  information.
  
     Starting with Solaris 7, the operating system is capable of executing
! 64-bit SPARC V9 binaries.  GCC 3.1 and later properly supports this; the
! '-m64' option enables 64-bit code generation.  However, if all you want
! is code tuned for the UltraSPARC CPU, you should try the
! '-mtune=ultrasparc' option instead, which produces code that, unlike
  full 64-bit code, can still run on non-UltraSPARC machines.
  
     When configuring on a Solaris 7 or later system that is running a
  kernel that supports only 32-bit binaries, one must configure with
! '--disable-multilib', since we will not be able to build the 64-bit
  target libraries.
  
     GCC 3.3 and GCC 3.4 trigger code generation bugs in earlier versions
*************** stage, i.e. to bootstrap that compiler w
*** 3803,3834 ****
  use it to bootstrap the final compiler.
  
     GCC 3.4 triggers a code generation bug in versions 5.4 (Sun ONE
! Studio 7) and 5.5 (Sun ONE Studio 8) of the Sun compiler, which causes
! a bootstrap failure in form of a miscompilation of the stage1 compiler
! by the Sun compiler.  This is Sun bug 4974440.  This is fixed with
! patch 112760-07.
  
     GCC 3.4 changed the default debugging format from Stabs to DWARF-2
  for 32-bit code on Solaris 7 and later.  If you use the Sun assembler,
  this change apparently runs afoul of Sun bug 4910101 (which is
  referenced as an x86-only problem by Sun, probably because they do not
  use DWARF-2).  A symptom of the problem is that you cannot compile C++
! programs like `groff' 1.19.1 without getting messages similar to the
  following:
  
       ld: warning: relocation error: R_SPARC_UA32: ...
         external symbolic relocation against non-allocatable section
         .debug_info cannot be processed at runtime: relocation ignored.
  
! To work around this problem, compile with `-gstabs+' instead of plain
! `-g'.
  
     When configuring the GNU Multiple Precision Library (GMP), the MPFR
  library or the MPC library on a Solaris 7 or later system, the canonical
! target triplet must be specified as the `build' parameter on the
  configure line.  This target triplet can be obtained by invoking
! `./config.guess' in the toplevel source directory of GCC (and not that
! of GMP or MPFR or MPC).  For example on a Solaris 9 system:
  
       % ./configure --build=sparc-sun-solaris2.9 --prefix=xxx
  
--- 3758,3789 ----
  use it to bootstrap the final compiler.
  
     GCC 3.4 triggers a code generation bug in versions 5.4 (Sun ONE
! Studio 7) and 5.5 (Sun ONE Studio 8) of the Sun compiler, which causes a
! bootstrap failure in form of a miscompilation of the stage1 compiler by
! the Sun compiler.  This is Sun bug 4974440.  This is fixed with patch
! 112760-07.
  
     GCC 3.4 changed the default debugging format from Stabs to DWARF-2
  for 32-bit code on Solaris 7 and later.  If you use the Sun assembler,
  this change apparently runs afoul of Sun bug 4910101 (which is
  referenced as an x86-only problem by Sun, probably because they do not
  use DWARF-2).  A symptom of the problem is that you cannot compile C++
! programs like 'groff' 1.19.1 without getting messages similar to the
  following:
  
       ld: warning: relocation error: R_SPARC_UA32: ...
         external symbolic relocation against non-allocatable section
         .debug_info cannot be processed at runtime: relocation ignored.
  
! To work around this problem, compile with '-gstabs+' instead of plain
! '-g'.
  
     When configuring the GNU Multiple Precision Library (GMP), the MPFR
  library or the MPC library on a Solaris 7 or later system, the canonical
! target triplet must be specified as the 'build' parameter on the
  configure line.  This target triplet can be obtained by invoking
! './config.guess' in the toplevel source directory of GCC (and not that
! of GMP or MPFR or MPC). For example on a Solaris 9 system:
  
       % ./configure --build=sparc-sun-solaris2.9 --prefix=xxx
  
*************** sparc-sun-solaris2.10
*** 3836,3842 ****
  =====================
  
  There is a bug in older versions of the Sun assembler which breaks
! thread-local storage (TLS).  A typical error message is
  
       ld: fatal: relocation error: R_SPARC_TLS_LE_HIX22: file /var/tmp//ccamPA1v.o:
         symbol <unknown>: bad symbol type SECT: symbol type must be TLS
--- 3791,3797 ----
  =====================
  
  There is a bug in older versions of the Sun assembler which breaks
! thread-local storage (TLS). A typical error message is
  
       ld: fatal: relocation error: R_SPARC_TLS_LE_HIX22: file /var/tmp//ccamPA1v.o:
         symbol <unknown>: bad symbol type SECT: symbol type must be TLS
*************** sparc-*-linux*
*** 3848,3861 ****
  
  GCC versions 3.0 and higher require binutils 2.11.2 and glibc 2.2.4 or
  newer on this platform.  All earlier binutils and glibc releases
! mishandled unaligned relocations on `sparc-*-*' targets.
  
  sparc64-*-solaris2*
  ===================
  
  When configuring the GNU Multiple Precision Library (GMP), the MPFR
  library or the MPC library, the canonical target triplet must be
! specified as the `build' parameter on the configure line.  For example
  on a Solaris 9 system:
  
       % ./configure --build=sparc64-sun-solaris2.9 --prefix=xxx
--- 3803,3816 ----
  
  GCC versions 3.0 and higher require binutils 2.11.2 and glibc 2.2.4 or
  newer on this platform.  All earlier binutils and glibc releases
! mishandled unaligned relocations on 'sparc-*-*' targets.
  
  sparc64-*-solaris2*
  ===================
  
  When configuring the GNU Multiple Precision Library (GMP), the MPFR
  library or the MPC library, the canonical target triplet must be
! specified as the 'build' parameter on the configure line.  For example
  on a Solaris 9 system:
  
       % ./configure --build=sparc64-sun-solaris2.9 --prefix=xxx
*************** in order to bootstrap this target with t
*** 3865,3882 ****
  
       % CC="cc -xarch=v9 -xildoff" SRCDIR/configure [OPTIONS] [TARGET]
  
! `-xarch=v9' specifies the SPARC-V9 architecture to the Sun toolchain
! and `-xildoff' turns off the incremental linker.
  
  sparcv9-*-solaris2*
  ===================
  
! This is a synonym for `sparc64-*-solaris2*'.
  
  c6x-*-*
  =======
  
! The C6X family of processors. This port requires binutils-2.22 or newer.
  
  tilegx-*-linux*
  ===============
--- 3820,3838 ----
  
       % CC="cc -xarch=v9 -xildoff" SRCDIR/configure [OPTIONS] [TARGET]
  
! '-xarch=v9' specifies the SPARC-V9 architecture to the Sun toolchain and
! '-xildoff' turns off the incremental linker.
  
  sparcv9-*-solaris2*
  ===================
  
! This is a synonym for 'sparc64-*-solaris2*'.
  
  c6x-*-*
  =======
  
! The C6X family of processors.  This port requires binutils-2.22 or
! newer.
  
  tilegx-*-linux*
  ===============
*************** systems.
*** 3905,3935 ****
  *-*-vxworks*
  ============
  
! Support for VxWorks is in flux.  At present GCC supports _only_ the
! very recent VxWorks 5.5 (aka Tornado 2.2) release, and only on PowerPC.
! We welcome patches for other architectures supported by VxWorks 5.5.
  Support for VxWorks AE would also be welcome; we believe this is merely
  a matter of writing an appropriate "configlette" (see below).  We are
  not interested in supporting older, a.out or COFF-based, versions of
  VxWorks in GCC 3.
  
     VxWorks comes with an older version of GCC installed in
! `$WIND_BASE/host'; we recommend you do not overwrite it.  Choose an
  installation PREFIX entirely outside $WIND_BASE.  Before running
! `configure', create the directories `PREFIX' and `PREFIX/bin'.  Link or
! copy the appropriate assembler, linker, etc. into `PREFIX/bin', and set
! your PATH to include that directory while running both `configure' and
! `make'.
  
!    You must give `configure' the `--with-headers=$WIND_BASE/target/h'
! switch so that it can find the VxWorks system headers.  Since VxWorks
! is a cross compilation target only, you must also specify
! `--target=TARGET'.  `configure' will attempt to create the directory
! `PREFIX/TARGET/sys-include' and copy files into it; make sure the user
! running `configure' has sufficient privilege to do so.
  
     GCC's exception handling runtime requires a special "configlette"
! module, `contrib/gthr_supp_vxw_5x.c'.  Follow the instructions in that
  file to add the module to your kernel build.  (Future versions of
  VxWorks will incorporate this module.)
  
--- 3861,3891 ----
  *-*-vxworks*
  ============
  
! Support for VxWorks is in flux.  At present GCC supports _only_ the very
! recent VxWorks 5.5 (aka Tornado 2.2) release, and only on PowerPC.  We
! welcome patches for other architectures supported by VxWorks 5.5.
  Support for VxWorks AE would also be welcome; we believe this is merely
  a matter of writing an appropriate "configlette" (see below).  We are
  not interested in supporting older, a.out or COFF-based, versions of
  VxWorks in GCC 3.
  
     VxWorks comes with an older version of GCC installed in
! '$WIND_BASE/host'; we recommend you do not overwrite it.  Choose an
  installation PREFIX entirely outside $WIND_BASE.  Before running
! 'configure', create the directories 'PREFIX' and 'PREFIX/bin'.  Link or
! copy the appropriate assembler, linker, etc. into 'PREFIX/bin', and set
! your PATH to include that directory while running both 'configure' and
! 'make'.
  
!    You must give 'configure' the '--with-headers=$WIND_BASE/target/h'
! switch so that it can find the VxWorks system headers.  Since VxWorks is
! a cross compilation target only, you must also specify
! '--target=TARGET'.  'configure' will attempt to create the directory
! 'PREFIX/TARGET/sys-include' and copy files into it; make sure the user
! running 'configure' has sufficient privilege to do so.
  
     GCC's exception handling runtime requires a special "configlette"
! module, 'contrib/gthr_supp_vxw_5x.c'.  Follow the instructions in that
  file to add the module to your kernel build.  (Future versions of
  VxWorks will incorporate this module.)
  
*************** x86_64-*-*, amd64-*-*
*** 3939,3982 ****
  GCC supports the x86-64 architecture implemented by the AMD64 processor
  (amd64-*-* is an alias for x86_64-*-*) on GNU/Linux, FreeBSD and NetBSD.
  On GNU/Linux the default is a bi-arch compiler which is able to generate
! both 64-bit x86-64 and 32-bit x86 code (via the `-m32' switch).
  
  x86_64-*-solaris2.1[0-9]*
  =========================
  
  GCC also supports the x86-64 architecture implemented by the AMD64
! processor (`amd64-*-*' is an alias for `x86_64-*-*') on Solaris 10 or
! later.  Unlike other systems, without special options a bi-arch
! compiler is built which generates 32-bit code by default, but can
! generate 64-bit x86-64 code with the `-m64' switch.  Since GCC 4.7,
! there is also configuration that defaults to 64-bit code, but can
! generate 32-bit code with `-m32'.  To configure and build this way, you
! have to provide all support libraries like `libgmp' as 64-bit code,
! configure with `--target=x86_64-pc-solaris2.1x' and `CC=gcc -m64'.
  
  xtensa*-*-elf
  =============
  
! This target is intended for embedded Xtensa systems using the `newlib'
! C library.  It uses ELF but does not support shared objects.
  Designed-defined instructions specified via the Tensilica Instruction
  Extension (TIE) language are only supported through inline assembly.
  
     The Xtensa configuration information must be specified prior to
! building GCC.  The `include/xtensa-config.h' header file contains the
! configuration information.  If you created your own Xtensa
! configuration with the Xtensa Processor Generator, the downloaded files
! include a customized copy of this header file, which you can use to
! replace the default header file.
  
  xtensa*-*-linux*
  ================
  
  This target is for Xtensa systems running GNU/Linux.  It supports ELF
  shared objects and the GNU C library (glibc).  It also generates
! position-independent code (PIC) regardless of whether the `-fpic' or
! `-fPIC' options are used.  In other respects, this target is the same
! as the `xtensa*-*-elf' target.
  
  Microsoft Windows
  =================
--- 3895,3938 ----
  GCC supports the x86-64 architecture implemented by the AMD64 processor
  (amd64-*-* is an alias for x86_64-*-*) on GNU/Linux, FreeBSD and NetBSD.
  On GNU/Linux the default is a bi-arch compiler which is able to generate
! both 64-bit x86-64 and 32-bit x86 code (via the '-m32' switch).
  
  x86_64-*-solaris2.1[0-9]*
  =========================
  
  GCC also supports the x86-64 architecture implemented by the AMD64
! processor ('amd64-*-*' is an alias for 'x86_64-*-*') on Solaris 10 or
! later.  Unlike other systems, without special options a bi-arch compiler
! is built which generates 32-bit code by default, but can generate 64-bit
! x86-64 code with the '-m64' switch.  Since GCC 4.7, there is also
! configuration that defaults to 64-bit code, but can generate 32-bit code
! with '-m32'.  To configure and build this way, you have to provide all
! support libraries like 'libgmp' as 64-bit code, configure with
! '--target=x86_64-pc-solaris2.1x' and 'CC=gcc -m64'.
  
  xtensa*-*-elf
  =============
  
! This target is intended for embedded Xtensa systems using the 'newlib' C
! library.  It uses ELF but does not support shared objects.
  Designed-defined instructions specified via the Tensilica Instruction
  Extension (TIE) language are only supported through inline assembly.
  
     The Xtensa configuration information must be specified prior to
! building GCC.  The 'include/xtensa-config.h' header file contains the
! configuration information.  If you created your own Xtensa configuration
! with the Xtensa Processor Generator, the downloaded files include a
! customized copy of this header file, which you can use to replace the
! default header file.
  
  xtensa*-*-linux*
  ================
  
  This target is for Xtensa systems running GNU/Linux.  It supports ELF
  shared objects and the GNU C library (glibc).  It also generates
! position-independent code (PIC) regardless of whether the '-fpic' or
! '-fPIC' options are used.  In other respects, this target is the same as
! the 'xtensa*-*-elf' target.
  
  Microsoft Windows
  =================
*************** Windows XP, and Windows Vista, are suppo
*** 3998,4021 ****
  platforms.  These targets differ in which Windows subsystem they target
  and which C libraries are used.
  
!    * Cygwin *-*-cygwin: Cygwin provides a user-space Linux API
!      emulation layer in the Win32 subsystem.
! 
     * Interix *-*-interix: The Interix subsystem provides native support
       for POSIX.
- 
     * MinGW *-*-mingw32: MinGW is a native GCC port for the Win32
       subsystem that provides a subset of POSIX.
! 
!    * MKS i386-pc-mks: NuTCracker from MKS.  See
!      `http://www.mkssoftware.com/' for more information.
  
  Intel 64-bit versions
  ---------------------
  
  GCC contains support for x86-64 using the mingw-w64 runtime library,
! available from `http://mingw-w64.sourceforge.net/'.  This library
! should be used with the target triple x86_64-pc-mingw32.
  
     Presently Windows for Itanium is not supported.
  
--- 3954,3974 ----
  platforms.  These targets differ in which Windows subsystem they target
  and which C libraries are used.
  
!    * Cygwin *-*-cygwin: Cygwin provides a user-space Linux API emulation
!      layer in the Win32 subsystem.
     * Interix *-*-interix: The Interix subsystem provides native support
       for POSIX.
     * MinGW *-*-mingw32: MinGW is a native GCC port for the Win32
       subsystem that provides a subset of POSIX.
!    * MKS i386-pc-mks: NuTCracker from MKS. See
!      <http://www.mkssoftware.com/> for more information.
  
  Intel 64-bit versions
  ---------------------
  
  GCC contains support for x86-64 using the mingw-w64 runtime library,
! available from <http://mingw-w64.sourceforge.net/>.  This library should
! be used with the target triple x86_64-pc-mingw32.
  
     Presently Windows for Itanium is not supported.
  
*************** support the Interix subsystem.  See abov
*** 4037,4043 ****
  used.
  
     PW32 (i386-pc-pw32) support was never completed, and the project
! seems to be inactive.  See `http://pw32.sourceforge.net/' for more
  information.
  
     UWIN support has been removed due to a lack of maintenance.
--- 3990,3996 ----
  used.
  
     PW32 (i386-pc-pw32) support was never completed, and the project
! seems to be inactive.  See <http://pw32.sourceforge.net/> for more
  information.
  
     UWIN support has been removed due to a lack of maintenance.
*************** version 2.20 or above if building your o
*** 4060,4066 ****
  ===========
  
  The Interix target is used by OpenNT, Interix, Services For UNIX (SFU),
! and Subsystem for UNIX-based Applications (SUA).  Applications compiled
  with this target run in the Interix subsystem, which is separate from
  the Win32 subsystem.  This target was last known to work in GCC 3.3.
  
--- 4013,4019 ----
  ===========
  
  The Interix target is used by OpenNT, Interix, Services For UNIX (SFU),
! and Subsystem for UNIX-based Applications (SUA). Applications compiled
  with this target run in the Interix subsystem, which is separate from
  the Win32 subsystem.  This target was last known to work in GCC 3.3.
  
*************** the Win32 subsystem.  This target was la
*** 4069,4075 ****
  
  GCC will build with and support only MinGW runtime 3.12 and later.
  Earlier versions of headers are incompatible with the new default
! semantics of `extern inline' in `-std=c99' and `-std=gnu99' modes.
  
  Older systems
  =============
--- 4022,4028 ----
  
  GCC will build with and support only MinGW runtime 3.12 and later.
  Earlier versions of headers are incompatible with the new default
! semantics of 'extern inline' in '-std=c99' and '-std=gnu99' modes.
  
  Older systems
  =============
*************** and may suffer from bitrot.
*** 4081,4087 ****
  
     Starting with GCC 3.1, each release has a list of "obsoleted"
  systems.  Support for these systems is still present in that release,
! but `configure' will fail unless the `--enable-obsolete' option is
  given.  Unless a maintainer steps forward, support for these systems
  will be removed from the next release of GCC.
  
--- 4034,4040 ----
  
     Starting with GCC 3.1, each release has a list of "obsoleted"
  systems.  Support for these systems is still present in that release,
! but 'configure' will fail unless the '--enable-obsolete' option is
  given.  Unless a maintainer steps forward, support for these systems
  will be removed from the next release of GCC.
  
*************** bring GCC up on such a system, if still
*** 4092,4124 ****
  require first installing an old version of GCC which did work on that
  system, and using it to compile a more recent GCC, to avoid bugs in the
  vendor compiler.  Old releases of GCC 1 and GCC 2 are available in the
! `old-releases' directory on the GCC mirror sites.  Header bugs may
! generally be avoided using `fixincludes', but bugs or deficiencies in
  libraries and the operating system may still cause problems.
  
     Support for older systems as targets for cross-compilation is less
  problematic than support for them as hosts for GCC; if an enthusiast
  wishes to make such a target work again (including resurrecting any of
! the targets that never worked with GCC 2, starting from the last
! version before they were removed), patches following the usual
! requirements would be likely to be accepted, since they should not
! affect the support for more modern targets.
  
     For some systems, old versions of GNU binutils may also be useful,
! and are available from `pub/binutils/old-releases' on sourceware.org
  mirror sites.
  
     Some of the information on specific systems above relates to such
  older systems, but much of the information about GCC on such systems
! (which may no longer be applicable to current GCC) is to be found in
! the GCC texinfo manual.
  
  all ELF targets (SVR4, Solaris 2, etc.)
  =======================================
  
  C++ support is significantly better on ELF targets if you use the GNU
! linker; duplicate copies of inlines, vtables and template
! instantiations will be discarded automatically.
  
  
  File: gccinstall.info,  Node: Old,  Next: GNU Free Documentation License,  Prev: Specific,  Up: Top
--- 4045,4077 ----
  require first installing an old version of GCC which did work on that
  system, and using it to compile a more recent GCC, to avoid bugs in the
  vendor compiler.  Old releases of GCC 1 and GCC 2 are available in the
! 'old-releases' directory on the GCC mirror sites.  Header bugs may
! generally be avoided using 'fixincludes', but bugs or deficiencies in
  libraries and the operating system may still cause problems.
  
     Support for older systems as targets for cross-compilation is less
  problematic than support for them as hosts for GCC; if an enthusiast
  wishes to make such a target work again (including resurrecting any of
! the targets that never worked with GCC 2, starting from the last version
! before they were removed), patches following the usual requirements
! would be likely to be accepted, since they should not affect the support
! for more modern targets.
  
     For some systems, old versions of GNU binutils may also be useful,
! and are available from 'pub/binutils/old-releases' on sourceware.org
  mirror sites.
  
     Some of the information on specific systems above relates to such
  older systems, but much of the information about GCC on such systems
! (which may no longer be applicable to current GCC) is to be found in the
! GCC texinfo manual.
  
  all ELF targets (SVR4, Solaris 2, etc.)
  =======================================
  
  C++ support is significantly better on ELF targets if you use the GNU
! linker; duplicate copies of inlines, vtables and template instantiations
! will be discarded automatically.
  
  
  File: gccinstall.info,  Node: Old,  Next: GNU Free Documentation License,  Prev: Specific,  Up: Top
*************** File: gccinstall.info,  Node: Old,  Next
*** 4126,4132 ****
  10 Old installation documentation
  *********************************
  
!    Note most of this information is out of date and superseded by the
  previous chapters of this manual.  It is provided for historical
  reference only, because of a lack of volunteers to merge it into the
  main manual.
--- 4079,4085 ----
  10 Old installation documentation
  *********************************
  
! Note most of this information is out of date and superseded by the
  previous chapters of this manual.  It is provided for historical
  reference only, because of a lack of volunteers to merge it into the
  main manual.
*************** main manual.
*** 4140,4153 ****
    1. If you have chosen a configuration for GCC which requires other GNU
       tools (such as GAS or the GNU linker) instead of the standard
       system tools, install the required tools in the build directory
!      under the names `as', `ld' or whatever is appropriate.
  
       Alternatively, you can do subsequent compilation using a value of
!      the `PATH' environment variable such that the necessary GNU tools
       come before the standard system tools.
  
    2. Specify the host, build and target machine configurations.  You do
!      this when you run the `configure' script.
  
       The "build" machine is the system which you are using, the "host"
       machine is the system where you want to run the resulting compiler
--- 4093,4106 ----
    1. If you have chosen a configuration for GCC which requires other GNU
       tools (such as GAS or the GNU linker) instead of the standard
       system tools, install the required tools in the build directory
!      under the names 'as', 'ld' or whatever is appropriate.
  
       Alternatively, you can do subsequent compilation using a value of
!      the 'PATH' environment variable such that the necessary GNU tools
       come before the standard system tools.
  
    2. Specify the host, build and target machine configurations.  You do
!      this when you run the 'configure' script.
  
       The "build" machine is the system which you are using, the "host"
       machine is the system where you want to run the resulting compiler
*************** main manual.
*** 4156,4169 ****
  
       If you are building a compiler to produce code for the machine it
       runs on (a native compiler), you normally do not need to specify
!      any operands to `configure'; it will try to guess the type of
       machine you are on and use that as the build, host and target
       machines.  So you don't need to specify a configuration when
!      building a native compiler unless `configure' cannot figure out
       what your configuration is or guesses wrong.
  
       In those cases, specify the build machine's "configuration name"
!      with the `--host' option; the host and target will default to be
       the same as the host machine.
  
       Here is an example:
--- 4109,4122 ----
  
       If you are building a compiler to produce code for the machine it
       runs on (a native compiler), you normally do not need to specify
!      any operands to 'configure'; it will try to guess the type of
       machine you are on and use that as the build, host and target
       machines.  So you don't need to specify a configuration when
!      building a native compiler unless 'configure' cannot figure out
       what your configuration is or guesses wrong.
  
       In those cases, specify the build machine's "configuration name"
!      with the '--host' option; the host and target will default to be
       the same as the host machine.
  
       Here is an example:
*************** main manual.
*** 4174,4225 ****
       abbreviated.
  
       A canonical configuration name has three parts, separated by
!      dashes.  It looks like this: `CPU-COMPANY-SYSTEM'.  (The three
!      parts may themselves contain dashes; `configure' can figure out
       which dashes serve which purpose.)  For example,
!      `m68k-sun-sunos4.1' specifies a Sun 3.
  
       You can also replace parts of the configuration by nicknames or
!      aliases.  For example, `sun3' stands for `m68k-sun', so
!      `sun3-sunos4.1' is another way to specify a Sun 3.
  
!      You can specify a version number after any of the system types,
!      and some of the CPU types.  In most cases, the version is
!      irrelevant, and will be ignored.  So you might as well specify the
!      version if you know it.
  
       See *note Configurations::, for a list of supported configuration
       names and notes on many of the configurations.  You should check
       the notes in that section before proceeding any further with the
       installation of GCC.
  
- 
  
  File: gccinstall.info,  Node: Configurations,  Up: Old
  
  10.1 Configurations Supported by GCC
  ====================================
  
!    Here are the possible CPU types:
  
       1750a, a29k, alpha, arm, avr, cN, clipper, dsp16xx, elxsi, fr30,
       h8300, hppa1.0, hppa1.1, i370, i386, i486, i586, i686, i786, i860,
       i960, ip2k, m32r, m68000, m68k, m88k, mcore, mips, mipsel, mips64,
!      mips64el, mn10200, mn10300, ns32k, pdp11, powerpc, powerpcle,
!      romp, rs6000, sh, sparc, sparclite, sparc64, v850, vax, we32k.
  
     Here are the recognized company names.  As you can see, customary
  abbreviations are used rather than the longer official names.
  
       acorn, alliant, altos, apollo, apple, att, bull, cbm, convergent,
!      convex, crds, dec, dg, dolphin, elxsi, encore, harris, hitachi,
!      hp, ibm, intergraph, isi, mips, motorola, ncr, next, ns, omron,
!      plexus, sequent, sgi, sony, sun, tti, unicom, wrs.
  
     The company name is meaningful only to disambiguate when the rest of
! the information supplied is insufficient.  You can omit it, writing
! just `CPU-SYSTEM', if it is not needed.  For example, `vax-ultrix4.2'
! is equivalent to `vax-dec-ultrix4.2'.
  
     Here is a list of system types:
  
--- 4127,4177 ----
       abbreviated.
  
       A canonical configuration name has three parts, separated by
!      dashes.  It looks like this: 'CPU-COMPANY-SYSTEM'.  (The three
!      parts may themselves contain dashes; 'configure' can figure out
       which dashes serve which purpose.)  For example,
!      'm68k-sun-sunos4.1' specifies a Sun 3.
  
       You can also replace parts of the configuration by nicknames or
!      aliases.  For example, 'sun3' stands for 'm68k-sun', so
!      'sun3-sunos4.1' is another way to specify a Sun 3.
  
!      You can specify a version number after any of the system types, and
!      some of the CPU types.  In most cases, the version is irrelevant,
!      and will be ignored.  So you might as well specify the version if
!      you know it.
  
       See *note Configurations::, for a list of supported configuration
       names and notes on many of the configurations.  You should check
       the notes in that section before proceeding any further with the
       installation of GCC.
  
  
  File: gccinstall.info,  Node: Configurations,  Up: Old
  
  10.1 Configurations Supported by GCC
  ====================================
  
! Here are the possible CPU types:
  
       1750a, a29k, alpha, arm, avr, cN, clipper, dsp16xx, elxsi, fr30,
       h8300, hppa1.0, hppa1.1, i370, i386, i486, i586, i686, i786, i860,
       i960, ip2k, m32r, m68000, m68k, m88k, mcore, mips, mipsel, mips64,
!      mips64el, mn10200, mn10300, ns32k, pdp11, powerpc, powerpcle, romp,
!      rs6000, sh, sparc, sparclite, sparc64, v850, vax, we32k.
  
     Here are the recognized company names.  As you can see, customary
  abbreviations are used rather than the longer official names.
  
       acorn, alliant, altos, apollo, apple, att, bull, cbm, convergent,
!      convex, crds, dec, dg, dolphin, elxsi, encore, harris, hitachi, hp,
!      ibm, intergraph, isi, mips, motorola, ncr, next, ns, omron, plexus,
!      sequent, sgi, sony, sun, tti, unicom, wrs.
  
     The company name is meaningful only to disambiguate when the rest of
! the information supplied is insufficient.  You can omit it, writing just
! 'CPU-SYSTEM', if it is not needed.  For example, 'vax-ultrix4.2' is
! equivalent to 'vax-dec-ultrix4.2'.
  
     Here is a list of system types:
  
*************** is equivalent to `vax-dec-ultrix4.2'.
*** 4231,4259 ****
       sysv, udi, ultrix, unicos, uniplus, unos, vms, vsta, vxworks,
       winnt, xenix.
  
! You can omit the system type; then `configure' guesses the operating
  system from the CPU and company.
  
     You can add a version number to the system type; this may or may not
! make a difference.  For example, you can write `bsd4.3' or `bsd4.4' to
  distinguish versions of BSD.  In practice, the version number is most
! needed for `sysv3' and `sysv4', which are often treated differently.
  
!    `linux-gnu' is the canonical name for the GNU/Linux target; however
! GCC will also accept `linux'.  The version of the kernel in use is not
! relevant on these systems.  A suffix such as `libc1' or `aout'
  distinguishes major versions of the C library; all of the suffixed
  versions are obsolete.
  
!    If you specify an impossible combination such as `i860-dg-vms', then
! you may get an error message from `configure', or it may ignore part of
! the information and do the best it can with the rest.  `configure'
  always prints the canonical name for the alternative that it used.  GCC
  does not support all possible alternatives.
  
     Often a particular model of machine has a name.  Many machine names
  are recognized as aliases for CPU/company combinations.  Thus, the
! machine name `sun3', mentioned above, is an alias for `m68k-sun'.
  Sometimes we accept a company name as a machine name, when the name is
  popularly used for a particular machine.  Here is a table of the known
  machine names:
--- 4183,4211 ----
       sysv, udi, ultrix, unicos, uniplus, unos, vms, vsta, vxworks,
       winnt, xenix.
  
! You can omit the system type; then 'configure' guesses the operating
  system from the CPU and company.
  
     You can add a version number to the system type; this may or may not
! make a difference.  For example, you can write 'bsd4.3' or 'bsd4.4' to
  distinguish versions of BSD.  In practice, the version number is most
! needed for 'sysv3' and 'sysv4', which are often treated differently.
  
!    'linux-gnu' is the canonical name for the GNU/Linux target; however
! GCC will also accept 'linux'.  The version of the kernel in use is not
! relevant on these systems.  A suffix such as 'libc1' or 'aout'
  distinguishes major versions of the C library; all of the suffixed
  versions are obsolete.
  
!    If you specify an impossible combination such as 'i860-dg-vms', then
! you may get an error message from 'configure', or it may ignore part of
! the information and do the best it can with the rest.  'configure'
  always prints the canonical name for the alternative that it used.  GCC
  does not support all possible alternatives.
  
     Often a particular model of machine has a name.  Many machine names
  are recognized as aliases for CPU/company combinations.  Thus, the
! machine name 'sun3', mentioned above, is an alias for 'm68k-sun'.
  Sometimes we accept a company name as a machine name, when the name is
  popularly used for a particular machine.  Here is a table of the known
  machine names:
*************** machine names:
*** 4263,4270 ****
       encore, fx2800, gmicro, hp7NN, hp8NN, hp9k2NN, hp9k3NN, hp9k7NN,
       hp9k8NN, iris4d, iris, isi68, m3230, magnum, merlin, miniframe,
       mmax, news-3600, news800, news, next, pbd, pc532, pmax, powerpc,
!      powerpcle, ps2, risc-news, rtpc, sun2, sun386i, sun386, sun3,
!      sun4, symmetry, tower-32, tower.
  
  Remember that a machine name specifies both the cpu type and the company
  name.
--- 4215,4222 ----
       encore, fx2800, gmicro, hp7NN, hp8NN, hp9k2NN, hp9k3NN, hp9k7NN,
       hp9k8NN, iris4d, iris, isi68, m3230, magnum, merlin, miniframe,
       mmax, news-3600, news800, news, next, pbd, pc532, pmax, powerpc,
!      powerpcle, ps2, risc-news, rtpc, sun2, sun386i, sun386, sun3, sun4,
!      symmetry, tower-32, tower.
  
  Remember that a machine name specifies both the cpu type and the company
  name.
*************** GNU Free Documentation License
*** 4278,4284 ****
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
--- 4230,4236 ----
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
*************** GNU Free Documentation License
*** 4303,4323 ****
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.
!      We recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it
!      can be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You
!      accept the license if you copy, modify or distribute the work in a
!      way requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
--- 4255,4275 ----
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.  We
!      recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it can
!      be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You accept
!      the license if you copy, modify or distribute the work in a way
!      requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
*************** GNU Free Documentation License
*** 4335,4346 ****
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in
!      the notice that says that the Document is released under this
!      License.  If a section does not fit the above definition of
!      Secondary then it is not allowed to be designated as Invariant.
!      The Document may contain zero Invariant Sections.  If the Document
!      does not identify any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
--- 4287,4298 ----
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in the
!      notice that says that the Document is released under this License.
!      If a section does not fit the above definition of Secondary then it
!      is not allowed to be designated as Invariant.  The Document may
!      contain zero Invariant Sections.  If the Document does not identify
!      any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
*************** GNU Free Documentation License
*** 4351,4377 ****
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images
!      composed of pixels) generic paint programs or (for drawings) some
!      widely available drawing editor, and that is suitable for input to
!      text formatters or for automatic translation to a variety of
!      formats suitable for input to text formatters.  A copy made in an
!      otherwise Transparent file format whose markup, or absence of
!      markup, has been arranged to thwart or discourage subsequent
!      modification by readers is not Transparent.  An image format is
!      not Transparent if used for any substantial amount of text.  A
!      copy that is not "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and
!      standard-conforming simple HTML, PostScript or PDF designed for
!      human modification.  Examples of transparent image formats include
!      PNG, XCF and JPG.  Opaque formats include proprietary formats that
!      can be read and edited only by proprietary word processors, SGML or
!      XML for which the DTD and/or processing tools are not generally
!      available, and the machine-generated HTML, PostScript or PDF
!      produced by some word processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
--- 4303,4329 ----
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images composed
!      of pixels) generic paint programs or (for drawings) some widely
!      available drawing editor, and that is suitable for input to text
!      formatters or for automatic translation to a variety of formats
!      suitable for input to text formatters.  A copy made in an otherwise
!      Transparent file format whose markup, or absence of markup, has
!      been arranged to thwart or discourage subsequent modification by
!      readers is not Transparent.  An image format is not Transparent if
!      used for any substantial amount of text.  A copy that is not
!      "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and standard-conforming
!      simple HTML, PostScript or PDF designed for human modification.
!      Examples of transparent image formats include PNG, XCF and JPG.
!      Opaque formats include proprietary formats that can be read and
!      edited only by proprietary word processors, SGML or XML for which
!      the DTD and/or processing tools are not generally available, and
!      the machine-generated HTML, PostScript or PDF produced by some word
!      processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
*************** GNU Free Documentation License
*** 4409,4416 ****
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow
!      the conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
--- 4361,4368 ----
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow the
!      conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
*************** GNU Free Documentation License
*** 4424,4435 ****
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the
!      title equally prominent and visible.  You may add other material
!      on the covers in addition.  Copying with changes limited to the
!      covers, as long as they preserve the title of the Document and
!      satisfy these conditions, can be treated as verbatim copying in
!      other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
--- 4376,4386 ----
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the title
!      equally prominent and visible.  You may add other material on the
!      covers in addition.  Copying with changes limited to the covers, as
!      long as they preserve the title of the Document and satisfy these
!      conditions, can be treated as verbatim copying in other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
*************** GNU Free Documentation License
*** 4437,4476 ****
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a
!      machine-readable Transparent copy along with each Opaque copy, or
!      state in or with each Opaque copy a computer-network location from
!      which the general network-using public has access to download
!      using public-standard network protocols a complete Transparent
!      copy of the Document, free of added material.  If you use the
!      latter option, you must take reasonably prudent steps, when you
!      begin distribution of Opaque copies in quantity, to ensure that
!      this Transparent copy will remain thus accessible at the stated
!      location until at least one year after the last time you
!      distribute an Opaque copy (directly or through your agents or
!      retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of
!      copies, to give them a chance to provide you with an updated
!      version of the Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with
!      the Modified Version filling the role of the Document, thus
!      licensing distribution and modification of the Modified Version to
!      whoever possesses a copy of it.  In addition, you must do these
!      things in the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of
!           previous versions (which should, if there were any, be listed
!           in the History section of the Document).  You may use the
!           same title as a previous version if the original publisher of
!           that version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
--- 4388,4426 ----
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a machine-readable
!      Transparent copy along with each Opaque copy, or state in or with
!      each Opaque copy a computer-network location from which the general
!      network-using public has access to download using public-standard
!      network protocols a complete Transparent copy of the Document, free
!      of added material.  If you use the latter option, you must take
!      reasonably prudent steps, when you begin distribution of Opaque
!      copies in quantity, to ensure that this Transparent copy will
!      remain thus accessible at the stated location until at least one
!      year after the last time you distribute an Opaque copy (directly or
!      through your agents or retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of copies,
!      to give them a chance to provide you with an updated version of the
!      Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with the
!      Modified Version filling the role of the Document, thus licensing
!      distribution and modification of the Modified Version to whoever
!      possesses a copy of it.  In addition, you must do these things in
!      the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of previous
!           versions (which should, if there were any, be listed in the
!           History section of the Document).  You may use the same title
!           as a previous version if the original publisher of that
!           version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
*************** GNU Free Documentation License
*** 4500,4530 ****
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on
!           the Title Page.  If there is no section Entitled "History" in
!           the Document, create one stating the title, year, authors,
!           and publisher of the Document as given on its Title Page,
!           then add an item describing the Modified Version as stated in
!           the previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in
!           the "History" section.  You may omit a network location for a
!           work that was published at least four years before the
!           Document itself, or if the original publisher of the version
!           it refers to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the
!           section all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document,
!           unaltered in their text and in their titles.  Section numbers
!           or the equivalent are not considered part of the section
!           titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
--- 4450,4479 ----
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on the
!           Title Page.  If there is no section Entitled "History" in the
!           Document, create one stating the title, year, authors, and
!           publisher of the Document as given on its Title Page, then add
!           an item describing the Modified Version as stated in the
!           previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in the
!           "History" section.  You may omit a network location for a work
!           that was published at least four years before the Document
!           itself, or if the original publisher of the version it refers
!           to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the section
!           all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document, unaltered
!           in their text and in their titles.  Section numbers or the
!           equivalent are not considered part of the section titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
*************** GNU Free Documentation License
*** 4537,4547 ****
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option
!      designate some or all of these sections as invariant.  To do this,
!      add their titles to the list of Invariant Sections in the Modified
!      Version's license notice.  These titles must be distinct from any
!      other section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
--- 4486,4496 ----
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option designate
!      some or all of these sections as invariant.  To do this, add their
!      titles to the list of Invariant Sections in the Modified Version's
!      license notice.  These titles must be distinct from any other
!      section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
*************** GNU Free Documentation License
*** 4550,4564 ****
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end
!      of the list of Cover Texts in the Modified Version.  Only one
!      passage of Front-Cover Text and one of Back-Cover Text may be
!      added by (or through arrangements made by) any one entity.  If the
!      Document already includes a cover text for the same cover,
!      previously added by you or by arrangement made by the same entity
!      you are acting on behalf of, you may not add another; but you may
!      replace the old one, on explicit permission from the previous
!      publisher that added the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
--- 4499,4513 ----
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end of
!      the list of Cover Texts in the Modified Version.  Only one passage
!      of Front-Cover Text and one of Back-Cover Text may be added by (or
!      through arrangements made by) any one entity.  If the Document
!      already includes a cover text for the same cover, previously added
!      by you or by arrangement made by the same entity you are acting on
!      behalf of, you may not add another; but you may replace the old
!      one, on explicit permission from the previous publisher that added
!      the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
*************** GNU Free Documentation License
*** 4568,4575 ****
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination
!      all of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
--- 4517,4524 ----
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination all
!      of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
*************** GNU Free Documentation License
*** 4596,4615 ****
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the
!      documents in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow
!      this License in all other respects regarding verbatim copying of
!      that document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of
!      a storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
--- 4545,4564 ----
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the documents
!      in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow this
!      License in all other respects regarding verbatim copying of that
!      document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of a
!      storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
*************** GNU Free Documentation License
*** 4654,4661 ****
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 4603,4610 ----
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** GNU Free Documentation License
*** 4667,4699 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, receipt of a copy of some or all of
!      the same material does not give you any rights to use it.
  
!  10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      `http://www.gnu.org/copyleft/'.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If
!      the Document does not specify a version number of this License,
!      you may choose any version ever published (not as a draft) by the
!      Free Software Foundation.  If the Document specifies that a proxy
!      can decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!  11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
--- 4616,4648 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, receipt of a copy of some or all of the
!      same material does not give you any rights to use it.
  
!   10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      <http://www.gnu.org/copyleft/>.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If the
!      Document does not specify a version number of this License, you may
!      choose any version ever published (not as a draft) by the Free
!      Software Foundation.  If the Document specifies that a proxy can
!      decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!   11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
*************** GNU Free Documentation License
*** 4723,4729 ****
       site under CC-BY-SA on the same site at any time before August 1,
       2009, provided the MMC is eligible for relicensing.
  
- 
  ADDENDUM: How to use this License for your documents
  ====================================================
  
--- 4672,4677 ----
*************** notices just after the title page:
*** 4740,4746 ****
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts." line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
--- 4688,4694 ----
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts."  line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
*************** combination of the three, merge those tw
*** 4751,4759 ****
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of
! free software license, such as the GNU General Public License, to
! permit their use in free software.
  
  
  File: gccinstall.info,  Node: Concept Index,  Prev: GNU Free Documentation License,  Up: Top
--- 4699,4707 ----
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of free
! software license, such as the GNU General Public License, to permit
! their use in free software.
  
  
  File: gccinstall.info,  Node: Concept Index,  Prev: GNU Free Documentation License,  Up: Top
*************** Concept Index
*** 4765,4771 ****
  * Menu:
  
  * Binaries:                              Binaries.           (line    6)
! * build_configargs:                      Configuration.      (line 1694)
  * Configuration:                         Configuration.      (line    6)
  * configurations supported by GCC:       Configurations.     (line    6)
  * Downloading GCC:                       Downloading the source.
--- 4713,4719 ----
  * Menu:
  
  * Binaries:                              Binaries.           (line    6)
! * build_configargs:                      Configuration.      (line 1416)
  * Configuration:                         Configuration.      (line    6)
  * configurations supported by GCC:       Configurations.     (line    6)
  * Downloading GCC:                       Downloading the source.
*************** Concept Index
*** 4775,4781 ****
  * FDL, GNU Free Documentation License:   GNU Free Documentation License.
                                                               (line    6)
  * Host specific installation:            Specific.           (line    6)
! * host_configargs:                       Configuration.      (line 1698)
  * Installing GCC: Binaries:              Binaries.           (line    6)
  * Installing GCC: Building:              Building.           (line    6)
  * Installing GCC: Configuration:         Configuration.      (line    6)
--- 4723,4729 ----
  * FDL, GNU Free Documentation License:   GNU Free Documentation License.
                                                               (line    6)
  * Host specific installation:            Specific.           (line    6)
! * host_configargs:                       Configuration.      (line 1420)
  * Installing GCC: Binaries:              Binaries.           (line    6)
  * Installing GCC: Building:              Building.           (line    6)
  * Installing GCC: Configuration:         Configuration.      (line    6)
*************** Concept Index
*** 4785,4895 ****
  * Specific installation notes:           Specific.           (line    6)
  * Target specific installation:          Specific.           (line    6)
  * Target specific installation notes:    Specific.           (line    6)
! * target_configargs:                     Configuration.      (line 1702)
  * Testing:                               Testing.            (line    6)
  * Testsuite:                             Testing.            (line    6)
  
  
  
  Tag Table:
! Node: Top1747
! Node: Installing GCC2305
! Node: Prerequisites3942
! Node: Downloading the source15088
! Node: Configuration16642
! Ref: with-gnu-as32093
! Ref: with-as32991
! Ref: with-gnu-ld34404
! Ref: WithAixSoname51698
! Ref: AixLdCommand52359
! Node: Building91523
! Node: Testing107432
! Node: Final install115304
! Node: Binaries120618
! Node: Specific122086
! Ref: aarch64-x-x122596
! Ref: alpha-x-x124028
! Ref: alpha-dec-osf51124517
! Ref: amd64-x-solaris210125042
! Ref: arc-x-elf32125145
! Ref: arc-linux-uclibc125321
! Ref: arm-x-eabi125462
! Ref: avr125673
! Ref: bfin126313
! Ref: cr16126555
! Ref: cris126970
! Ref: dos127786
! Ref: epiphany-x-elf128109
! Ref: x-x-freebsd128214
! Ref: h8300-hms130051
! Ref: hppa-hp-hpux130403
! Ref: hppa-hp-hpux10132774
! Ref: hppa-hp-hpux11133187
! Ref: x-x-linux-gnu138846
! Ref: ix86-x-linux139039
! Ref: ix86-x-solaris210139352
! Ref: ia64-x-linux140543
! Ref: ia64-x-hpux141313
! Ref: x-ibm-aix141868
! Ref: TransferAixShobj145050
! Ref: iq2000-x-elf148861
! Ref: lm32-x-elf149001
! Ref: lm32-x-uclinux149105
! Ref: m32c-x-elf149233
! Ref: m32r-x-elf149335
! Ref: m68k-x-x149437
! Ref: m68k-x-uclinux150475
! Ref: mep-x-elf150721
! Ref: microblaze-x-elf150831
! Ref: mips-x-x150950
! Ref: mips-sgi-irix5153346
! Ref: mips-sgi-irix6153426
! Ref: moxie-x-elf153613
! Ref: msp430-x-elf153660
! Ref: nds32le-x-elf153763
! Ref: nds32be-x-elf153835
! Ref: nvptx-x-none153904
! Ref: powerpc-x-x154431
! Ref: powerpc-x-darwin154636
! Ref: powerpc-x-elf155130
! Ref: powerpc-x-linux-gnu155215
! Ref: powerpc-x-netbsd155310
! Ref: powerpc-x-eabisim155398
! Ref: powerpc-x-eabi155524
! Ref: powerpcle-x-elf155600
! Ref: powerpcle-x-eabisim155692
! Ref: powerpcle-x-eabi155825
! Ref: rl78-x-elf155908
! Ref: rx-x-elf156014
! Ref: s390-x-linux156213
! Ref: s390x-x-linux156285
! Ref: s390x-ibm-tpf156372
! Ref: x-x-solaris2156503
! Ref: sparc-x-x160309
! Ref: sparc-sun-solaris2160811
! Ref: sparc-sun-solaris210163565
! Ref: sparc-x-linux163941
! Ref: sparc64-x-solaris2164166
! Ref: sparcv9-x-solaris2164819
! Ref: c6x-x-x164906
! Ref: tilegx-*-linux164997
! Ref: tilegxbe-*-linux165139
! Ref: tilepro-*-linux165282
! Ref: visium-x-elf165403
! Ref: x-x-vxworks165511
! Ref: x86-64-x-x167033
! Ref: x86-64-x-solaris210167361
! Ref: xtensa-x-elf168023
! Ref: xtensa-x-linux168694
! Ref: windows169035
! Ref: x-x-cygwin170972
! Ref: x-x-interix171525
! Ref: x-x-mingw32171834
! Ref: older172060
! Ref: elf174177
! Node: Old174435
! Node: Configurations177572
! Node: GNU Free Documentation License181113
! Node: Concept Index206260
  
  End Tag Table
--- 4733,4843 ----
  * Specific installation notes:           Specific.           (line    6)
  * Target specific installation:          Specific.           (line    6)
  * Target specific installation notes:    Specific.           (line    6)
! * target_configargs:                     Configuration.      (line 1424)
  * Testing:                               Testing.            (line    6)
  * Testsuite:                             Testing.            (line    6)
  
  
  
  Tag Table:
! Node: Top1696
! Node: Installing GCC2254
! Node: Prerequisites3888
! Node: Downloading the source15044
! Node: Configuration16594
! Ref: with-gnu-as32054
! Ref: with-as32949
! Ref: with-gnu-ld34362
! Ref: WithAixSoname51904
! Ref: AixLdCommand52565
! Node: Building91431
! Node: Testing107323
! Node: Final install115185
! Node: Binaries120496
! Node: Specific121960
! Ref: aarch64-x-x122467
! Ref: alpha-x-x123899
! Ref: alpha-dec-osf51124388
! Ref: amd64-x-solaris210124913
! Ref: arc-x-elf32125016
! Ref: arc-linux-uclibc125192
! Ref: arm-x-eabi125333
! Ref: avr125544
! Ref: bfin126183
! Ref: cr16126424
! Ref: cris126840
! Ref: dos127655
! Ref: epiphany-x-elf127978
! Ref: x-x-freebsd128083
! Ref: h8300-hms129919
! Ref: hppa-hp-hpux130271
! Ref: hppa-hp-hpux10132643
! Ref: hppa-hp-hpux11133056
! Ref: x-x-linux-gnu138715
! Ref: ix86-x-linux138908
! Ref: ix86-x-solaris210139221
! Ref: ia64-x-linux140412
! Ref: ia64-x-hpux141182
! Ref: x-ibm-aix141737
! Ref: TransferAixShobj144920
! Ref: iq2000-x-elf148730
! Ref: lm32-x-elf148870
! Ref: lm32-x-uclinux148974
! Ref: m32c-x-elf149102
! Ref: m32r-x-elf149204
! Ref: m68k-x-x149306
! Ref: m68k-x-uclinux150344
! Ref: mep-x-elf150589
! Ref: microblaze-x-elf150699
! Ref: mips-x-x150818
! Ref: mips-sgi-irix5153212
! Ref: mips-sgi-irix6153292
! Ref: moxie-x-elf153479
! Ref: msp430-x-elf153526
! Ref: nds32le-x-elf153629
! Ref: nds32be-x-elf153701
! Ref: nvptx-x-none153770
! Ref: powerpc-x-x154297
! Ref: powerpc-x-darwin154502
! Ref: powerpc-x-elf154996
! Ref: powerpc-x-linux-gnu155081
! Ref: powerpc-x-netbsd155176
! Ref: powerpc-x-eabisim155264
! Ref: powerpc-x-eabi155390
! Ref: powerpcle-x-elf155466
! Ref: powerpcle-x-eabisim155558
! Ref: powerpcle-x-eabi155691
! Ref: rl78-x-elf155774
! Ref: rx-x-elf155880
! Ref: s390-x-linux156079
! Ref: s390x-x-linux156151
! Ref: s390x-ibm-tpf156238
! Ref: x-x-solaris2156369
! Ref: sparc-x-x160266
! Ref: sparc-sun-solaris2160768
! Ref: sparc-sun-solaris210163521
! Ref: sparc-x-linux163896
! Ref: sparc64-x-solaris2164121
! Ref: sparcv9-x-solaris2164774
! Ref: c6x-x-x164861
! Ref: tilegx-*-linux164953
! Ref: tilegxbe-*-linux165095
! Ref: tilepro-*-linux165238
! Ref: visium-x-elf165359
! Ref: x-x-vxworks165467
! Ref: x86-64-x-x166990
! Ref: x86-64-x-solaris210167318
! Ref: xtensa-x-elf167980
! Ref: xtensa-x-linux168651
! Ref: windows168992
! Ref: x-x-cygwin170925
! Ref: x-x-interix171478
! Ref: x-x-mingw32171786
! Ref: older172012
! Ref: elf174129
! Node: Old174387
! Node: Configurations177520
! Node: GNU Free Documentation License181058
! Node: Concept Index206186
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/gcc/doc/gccint.info gcc-5.5.0/gcc/doc/gccint.info
*** gcc-5.4.0/gcc/doc/gccint.info	Fri Jun  3 10:32:21 2016
--- gcc-5.5.0/gcc/doc/gccint.info	Tue Oct 10 09:40:19 2017
***************
*** 1,5 ****
! This is doc/gccint.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/doc/gccint.texi.
  
  Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
--- 1,4 ----
! This is gccint.info, produced by makeinfo version 6.1 from gccint.texi.
  
  Copyright (C) 1988-2015 Free Software Foundation, Inc.
  
*************** Free Documentation License".
*** 17,30 ****
  
   (b) The FSF's Back-Cover Text is:
  
!  You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
! 
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * gccint: (gccint).            Internals of the GNU Compiler Collection.
  END-INFO-DIR-ENTRY
   This file documents the internals of the GNU compilers.
  
   Copyright (C) 1988-2015 Free Software Foundation, Inc.
--- 16,29 ----
  
   (b) The FSF's Back-Cover Text is:
  
!  You have freedom to copy and modify this GNU Manual, like GNU software.
! Copies published by the Free Software Foundation raise funds for GNU
! development.
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * gccint: (gccint).            Internals of the GNU Compiler Collection.
  END-INFO-DIR-ENTRY
+ 
   This file documents the internals of the GNU compilers.
  
   Copyright (C) 1988-2015 Free Software Foundation, Inc.
*************** Free Documentation License".
*** 43,52 ****
  
   (b) The FSF's Back-Cover Text is:
  
!  You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
! 
  
  
  File: gccint.info,  Node: Top,  Next: Contributing,  Up: (DIR)
--- 42,50 ----
  
   (b) The FSF's Back-Cover Text is:
  
!  You have freedom to copy and modify this GNU Manual, like GNU software.
! Copies published by the Free Software Foundation raise funds for GNU
! development.
  
  
  File: gccint.info,  Node: Top,  Next: Contributing,  Up: (DIR)
*************** Introduction
*** 56,64 ****
  
  This manual documents the internals of the GNU compilers, including how
  to port them to new targets and some information about how to write
! front ends for new languages.  It corresponds to the compilers
! (GCC) version 5.4.0.  The use of the GNU compilers is documented in a
! separate manual.  *Note Introduction: (gcc)Top.
  
   This manual is mainly a reference manual rather than a tutorial.  It
  discusses how to contribute to GCC (*note Contributing::), the
--- 54,62 ----
  
  This manual documents the internals of the GNU compilers, including how
  to port them to new targets and some information about how to write
! front ends for new languages.  It corresponds to the compilers (GCC)
! version 5.5.0.  The use of the GNU compilers is documented in a separate
! manual.  *Note Introduction: (gcc)Top.
  
   This manual is mainly a reference manual rather than a tutorial.  It
  discusses how to contribute to GCC (*note Contributing::), the
*************** GCC front ends, and how support for a ta
*** 71,77 ****
  GCC.
  
   Additional tutorial information is linked to from
! `http://gcc.gnu.org/readings.html'.
  
  * Menu:
  
--- 69,75 ----
  GCC.
  
   Additional tutorial information is linked to from
! <http://gcc.gnu.org/readings.html>.
  
  * Menu:
  
*************** GCC.
*** 92,100 ****
  * Loop Analysis and Representation:: Analysis and representation of loops
  * Machine Desc::    How to write machine description instruction patterns.
  * Target Macros::   How to write the machine description C macros and functions.
! * Host Config::     Writing the `xm-MACHINE.h' file.
! * Fragments::       Writing the `t-TARGET' and `x-HOST' files.
! * Collect2::        How `collect2' works; how it finds `ld'.
  * Header Dirs::     Understanding the standard header file directories.
  * Type Information:: GCC's memory management; generating type information.
  * Plugins::         Extending the compiler with plugins.
--- 90,98 ----
  * Loop Analysis and Representation:: Analysis and representation of loops
  * Machine Desc::    How to write machine description instruction patterns.
  * Target Macros::   How to write the machine description C macros and functions.
! * Host Config::     Writing the 'xm-MACHINE.h' file.
! * Fragments::       Writing the 't-TARGET' and 'x-HOST' files.
! * Collect2::        How 'collect2' works; how it finds 'ld'.
  * Header Dirs::     Understanding the standard header file directories.
  * Type Information:: GCC's memory management; generating type information.
  * Plugins::         Extending the compiler with plugins.
*************** GCC.
*** 113,137 ****
  * Concept Index::   Index of concepts and symbol names.
  
  
! File: gccint.info,  Node: Contributing,  Next: Portability,  Prev: Top,  Up: Top
  
  1 Contributing to GCC Development
  *********************************
  
  If you would like to help pretest GCC releases to assure they work well,
  current development sources are available by SVN (see
! `http://gcc.gnu.org/svn.html').  Source and binary snapshots are also
! available for FTP; see `http://gcc.gnu.org/snapshots.html'.
  
   If you would like to work on improvements to GCC, please read the
  advice at these URLs:
  
!      `http://gcc.gnu.org/contribute.html'
!      `http://gcc.gnu.org/contributewhy.html'
  
  for information on how to make useful contributions and avoid
  duplication of effort.  Suggested projects are listed at
! `http://gcc.gnu.org/projects/'.
  
  
  File: gccint.info,  Node: Portability,  Next: Interface,  Prev: Contributing,  Up: Top
--- 111,135 ----
  * Concept Index::   Index of concepts and symbol names.
  
  
! File: gccint.info,  Node: Contributing,  Next: Portability,  Up: Top
  
  1 Contributing to GCC Development
  *********************************
  
  If you would like to help pretest GCC releases to assure they work well,
  current development sources are available by SVN (see
! <http://gcc.gnu.org/svn.html>).  Source and binary snapshots are also
! available for FTP; see <http://gcc.gnu.org/snapshots.html>.
  
   If you would like to work on improvements to GCC, please read the
  advice at these URLs:
  
!      <http://gcc.gnu.org/contribute.html>
!      <http://gcc.gnu.org/contributewhy.html>
  
  for information on how to make useful contributions and avoid
  duplication of effort.  Suggested projects are listed at
! <http://gcc.gnu.org/projects/>.
  
  
  File: gccint.info,  Node: Portability,  Next: Interface,  Prev: Contributing,  Up: Top
*************** File: gccint.info,  Node: Portability,
*** 139,158 ****
  2 GCC and Portability
  *********************
  
! GCC itself aims to be portable to any machine where `int' is at least a
  32-bit type.  It aims to target machines with a flat (non-segmented)
  byte addressed data address space (the code address space can be
! separate).  Target ABIs may have 8, 16, 32 or 64-bit `int' type.  `char'
  can be wider than 8 bits.
  
   GCC gets most of the information about the target machine from a
  machine description which gives an algebraic formula for each of the
  machine's instructions.  This is a very clean way to describe the
  target.  But when the compiler needs information that is difficult to
! express in this fashion, ad-hoc parameters have been defined for
! machine descriptions.  The purpose of portability is to reduce the
! total work needed on the compiler; it was not of interest for its own
! sake.
  
   GCC does not contain machine dependent code, but it does contain code
  that depends on machine parameters such as endianness (whether the most
--- 137,155 ----
  2 GCC and Portability
  *********************
  
! GCC itself aims to be portable to any machine where 'int' is at least a
  32-bit type.  It aims to target machines with a flat (non-segmented)
  byte addressed data address space (the code address space can be
! separate).  Target ABIs may have 8, 16, 32 or 64-bit 'int' type.  'char'
  can be wider than 8 bits.
  
   GCC gets most of the information about the target machine from a
  machine description which gives an algebraic formula for each of the
  machine's instructions.  This is a very clean way to describe the
  target.  But when the compiler needs information that is difficult to
! express in this fashion, ad-hoc parameters have been defined for machine
! descriptions.  The purpose of portability is to reduce the total work
! needed on the compiler; it was not of interest for its own sake.
  
   GCC does not contain machine dependent code, but it does contain code
  that depends on machine parameters such as endianness (whether the most
*************** word) and the availability of autoincrem
*** 161,172 ****
  RTL-generation pass, it is often necessary to have multiple strategies
  for generating code for a particular kind of syntax tree, strategies
  that are usable for different combinations of parameters.  Often, not
! all possible cases have been addressed, but only the common ones or
! only the ones that have been encountered.  As a result, a new target
! may require additional strategies.  You will know if this happens
! because the compiler will call `abort'.  Fortunately, the new
! strategies can be added in a machine-independent fashion, and will
! affect only the target machines that need them.
  
  
  File: gccint.info,  Node: Interface,  Next: Libgcc,  Prev: Portability,  Up: Top
--- 158,169 ----
  RTL-generation pass, it is often necessary to have multiple strategies
  for generating code for a particular kind of syntax tree, strategies
  that are usable for different combinations of parameters.  Often, not
! all possible cases have been addressed, but only the common ones or only
! the ones that have been encountered.  As a result, a new target may
! require additional strategies.  You will know if this happens because
! the compiler will call 'abort'.  Fortunately, the new strategies can be
! added in a machine-independent fashion, and will affect only the target
! machines that need them.
  
  
  File: gccint.info,  Node: Interface,  Next: Libgcc,  Prev: Portability,  Up: Top
*************** returning such types cannot be called fr
*** 184,195 ****
  vice versa.  This does not cause trouble often because few Unix library
  routines return structures or unions.
  
!  GCC code returns structures and unions that are 1, 2, 4 or 8 bytes
! long in the same registers used for `int' or `double' return values.
! (GCC typically allocates variables of such types in registers also.)
  Structures and unions of other sizes are returned by storing them into
  an address passed by the caller (usually in a register).  The target
! hook `TARGET_STRUCT_VALUE_RTX' tells GCC where to pass this address.
  
   By contrast, PCC on most target machines returns structures and unions
  of any size by copying the data into an area of static storage, and then
--- 181,192 ----
  vice versa.  This does not cause trouble often because few Unix library
  routines return structures or unions.
  
!  GCC code returns structures and unions that are 1, 2, 4 or 8 bytes long
! in the same registers used for 'int' or 'double' return values.  (GCC
! typically allocates variables of such types in registers also.)
  Structures and unions of other sizes are returned by storing them into
  an address passed by the caller (usually in a register).  The target
! hook 'TARGET_STRUCT_VALUE_RTX' tells GCC where to pass this address.
  
   By contrast, PCC on most target machines returns structures and unions
  of any size by copying the data into an area of static storage, and then
*************** are passed "by invisible reference".  Th
*** 220,231 ****
  stored in memory, and the address of the memory location is passed to
  the subroutine.
  
!  If you use `longjmp', beware of automatic variables.  ISO C says that
! automatic variables that are not declared `volatile' have undefined
! values after a `longjmp'.  And this is all GCC promises to do, because
! it is very difficult to restore register variables correctly, and one
! of GCC's features is that it can put variables in registers without
! your asking it to.
  
  
  File: gccint.info,  Node: Libgcc,  Next: Languages,  Prev: Interface,  Up: Top
--- 217,228 ----
  stored in memory, and the address of the memory location is passed to
  the subroutine.
  
!  If you use 'longjmp', beware of automatic variables.  ISO C says that
! automatic variables that are not declared 'volatile' have undefined
! values after a 'longjmp'.  And this is all GCC promises to do, because
! it is very difficult to restore register variables correctly, and one of
! GCC's features is that it can put variables in registers without your
! asking it to.
  
  
  File: gccint.info,  Node: Libgcc,  Next: Languages,  Prev: Interface,  Up: Top
*************** File: gccint.info,  Node: Libgcc,  Next:
*** 233,266 ****
  4 The GCC low-level runtime library
  ***********************************
  
! GCC provides a low-level runtime library, `libgcc.a' or `libgcc_s.so.1'
  on some platforms.  GCC generates calls to routines in this library
  automatically, whenever it needs to perform some operation that is too
  complicated to emit inline code for.
  
!  Most of the routines in `libgcc' handle arithmetic operations that the
  target processor cannot perform directly.  This includes integer
  multiply and divide on some machines, and all floating-point and
! fixed-point operations on other machines.  `libgcc' also includes
  routines for exception handling, and a handful of miscellaneous
  operations.
  
   Some of these routines can be defined in mostly machine-independent C.
! Others must be hand-written in assembly language for each processor
! that needs them.
  
!  GCC will also generate calls to C library routines, such as `memcpy'
! and `memset', in some cases.  The set of routines that GCC may possibly
! use is documented in *note Other Builtins: (gcc)Other Builtins.
  
   These routines take arguments and return values of a specific machine
  mode, not a specific C type.  *Note Machine Modes::, for an explanation
  of this concept.  For illustrative purposes, in this chapter the
! floating point type `float' is assumed to correspond to `SFmode';
! `double' to `DFmode'; and `long double' to both `TFmode' and `XFmode'.
! Similarly, the integer types `int' and `unsigned int' correspond to
! `SImode'; `long' and `unsigned long' to `DImode'; and `long long' and
! `unsigned long long' to `TImode'.
  
  * Menu:
  
--- 230,263 ----
  4 The GCC low-level runtime library
  ***********************************
  
! GCC provides a low-level runtime library, 'libgcc.a' or 'libgcc_s.so.1'
  on some platforms.  GCC generates calls to routines in this library
  automatically, whenever it needs to perform some operation that is too
  complicated to emit inline code for.
  
!  Most of the routines in 'libgcc' handle arithmetic operations that the
  target processor cannot perform directly.  This includes integer
  multiply and divide on some machines, and all floating-point and
! fixed-point operations on other machines.  'libgcc' also includes
  routines for exception handling, and a handful of miscellaneous
  operations.
  
   Some of these routines can be defined in mostly machine-independent C.
! Others must be hand-written in assembly language for each processor that
! needs them.
  
!  GCC will also generate calls to C library routines, such as 'memcpy'
! and 'memset', in some cases.  The set of routines that GCC may possibly
! use is documented in *note (gcc)Other Builtins::.
  
   These routines take arguments and return values of a specific machine
  mode, not a specific C type.  *Note Machine Modes::, for an explanation
  of this concept.  For illustrative purposes, in this chapter the
! floating point type 'float' is assumed to correspond to 'SFmode';
! 'double' to 'DFmode'; and 'long double' to both 'TFmode' and 'XFmode'.
! Similarly, the integer types 'int' and 'unsigned int' correspond to
! 'SImode'; 'long' and 'unsigned long' to 'DImode'; and 'long long' and
! 'unsigned long long' to 'TImode'.
  
  * Menu:
  
*************** hardware support for arithmetic operatio
*** 323,330 ****
  
   -- Runtime Function: unsigned int __udivsi3 (unsigned int A, unsigned
            int B)
!  -- Runtime Function: unsigned long __udivdi3 (unsigned long A,
!           unsigned long B)
   -- Runtime Function: unsigned long long __udivti3 (unsigned long long
            A, unsigned long long B)
       These functions return the quotient of the unsigned division of A
--- 320,327 ----
  
   -- Runtime Function: unsigned int __udivsi3 (unsigned int A, unsigned
            int B)
!  -- Runtime Function: unsigned long __udivdi3 (unsigned long A, unsigned
!           long B)
   -- Runtime Function: unsigned long long __udivti3 (unsigned long long
            A, unsigned long long B)
       These functions return the quotient of the unsigned division of A
*************** hardware support for arithmetic operatio
*** 340,347 ****
  
   -- Runtime Function: unsigned int __umodsi3 (unsigned int A, unsigned
            int B)
!  -- Runtime Function: unsigned long __umoddi3 (unsigned long A,
!           unsigned long B)
   -- Runtime Function: unsigned long long __umodti3 (unsigned long long
            A, unsigned long long B)
       These functions return the remainder of the unsigned division of A
--- 337,344 ----
  
   -- Runtime Function: unsigned int __umodsi3 (unsigned int A, unsigned
            int B)
!  -- Runtime Function: unsigned long __umoddi3 (unsigned long A, unsigned
!           long B)
   -- Runtime Function: unsigned long long __umodti3 (unsigned long long
            A, unsigned long long B)
       These functions return the remainder of the unsigned division of A
*************** result using either signed or unsigned c
*** 364,380 ****
       and if A and B are equal they return 1.
  
   -- Runtime Function: int __ucmpdi2 (unsigned long A, unsigned long B)
!  -- Runtime Function: int __ucmpti2 (unsigned long long A, unsigned
!           long long B)
!      These functions perform an unsigned comparison of A and B.  If A
!      is less than B, they return 0; if A is greater than B, they return
!      2; and if A and B are equal they return 1.
  
  4.1.3 Trapping arithmetic functions
  -----------------------------------
  
  The following functions implement trapping arithmetic.  These functions
! call the libc function `abort' upon signed arithmetic overflow.
  
   -- Runtime Function: int __absvsi2 (int A)
   -- Runtime Function: long __absvdi2 (long A)
--- 361,377 ----
       and if A and B are equal they return 1.
  
   -- Runtime Function: int __ucmpdi2 (unsigned long A, unsigned long B)
!  -- Runtime Function: int __ucmpti2 (unsigned long long A, unsigned long
!           long B)
!      These functions perform an unsigned comparison of A and B.  If A is
!      less than B, they return 0; if A is greater than B, they return 2;
!      and if A and B are equal they return 1.
  
  4.1.3 Trapping arithmetic functions
  -----------------------------------
  
  The following functions implement trapping arithmetic.  These functions
! call the libc function 'abort' upon signed arithmetic overflow.
  
   -- Runtime Function: int __absvsi2 (int A)
   -- Runtime Function: long __absvdi2 (long A)
*************** call the libc function `abort' upon sign
*** 382,401 ****
  
   -- Runtime Function: int __addvsi3 (int A, int B)
   -- Runtime Function: long __addvdi3 (long A, long B)
!      These functions return the sum of A and B; that is `A + B'.
  
   -- Runtime Function: int __mulvsi3 (int A, int B)
   -- Runtime Function: long __mulvdi3 (long A, long B)
!      The functions return the product of A and B; that is `A * B'.
  
   -- Runtime Function: int __negvsi2 (int A)
   -- Runtime Function: long __negvdi2 (long A)
!      These functions return the negation of A; that is `-A'.
  
   -- Runtime Function: int __subvsi3 (int A, int B)
   -- Runtime Function: long __subvdi3 (long A, long B)
!      These functions return the difference between B and A; that is `A
!      - B'.
  
  4.1.4 Bit operations
  --------------------
--- 379,398 ----
  
   -- Runtime Function: int __addvsi3 (int A, int B)
   -- Runtime Function: long __addvdi3 (long A, long B)
!      These functions return the sum of A and B; that is 'A + B'.
  
   -- Runtime Function: int __mulvsi3 (int A, int B)
   -- Runtime Function: long __mulvdi3 (long A, long B)
!      The functions return the product of A and B; that is 'A * B'.
  
   -- Runtime Function: int __negvsi2 (int A)
   -- Runtime Function: long __negvdi2 (long A)
!      These functions return the negation of A; that is '-A'.
  
   -- Runtime Function: int __subvsi3 (int A, int B)
   -- Runtime Function: long __subvdi3 (long A, long B)
!      These functions return the difference between B and A; that is 'A -
!      B'.
  
  4.1.4 Bit operations
  --------------------
*************** File: gccint.info,  Node: Soft float lib
*** 443,457 ****
  
  The software floating point library is used on machines which do not
  have hardware support for floating point.  It is also used whenever
! `-msoft-float' is used to disable generation of floating point
  instructions.  (Not all targets support this switch.)
  
   For compatibility with other compilers, the floating point emulation
! routines can be renamed with the `DECLARE_LIBRARY_RENAMES' macro (*note
  Library Calls::).  In this section, the default names are used.
  
!  Presently the library does not support `XFmode', which is used for
! `long double' on some architectures.
  
  4.2.1 Arithmetic functions
  --------------------------
--- 440,454 ----
  
  The software floating point library is used on machines which do not
  have hardware support for floating point.  It is also used whenever
! '-msoft-float' is used to disable generation of floating point
  instructions.  (Not all targets support this switch.)
  
   For compatibility with other compilers, the floating point emulation
! routines can be renamed with the 'DECLARE_LIBRARY_RENAMES' macro (*note
  Library Calls::).  In this section, the default names are used.
  
!  Presently the library does not support 'XFmode', which is used for
! 'long double' on some architectures.
  
  4.2.1 Arithmetic functions
  --------------------------
*************** Library Calls::).  In this section, the
*** 552,559 ****
   -- Runtime Function: unsigned long long __fixunsdfti (double A)
   -- Runtime Function: unsigned long long __fixunstfti (long double A)
   -- Runtime Function: unsigned long long __fixunsxfti (long double A)
!      These functions convert A to an unsigned long long, rounding
!      toward zero.  Negative values all become zero.
  
   -- Runtime Function: float __floatsisf (int I)
   -- Runtime Function: double __floatsidf (int I)
--- 549,556 ----
   -- Runtime Function: unsigned long long __fixunsdfti (double A)
   -- Runtime Function: unsigned long long __fixunstfti (long double A)
   -- Runtime Function: unsigned long long __fixunsxfti (long double A)
!      These functions convert A to an unsigned long long, rounding toward
!      zero.  Negative values all become zero.
  
   -- Runtime Function: float __floatsisf (int I)
   -- Runtime Function: double __floatsidf (int I)
*************** There are two sets of basic comparison f
*** 601,610 ****
   -- Runtime Function: int __cmpdf2 (double A, double B)
   -- Runtime Function: int __cmptf2 (long double A, long double B)
       These functions calculate a <=> b.  That is, if A is less than B,
!      they return -1; if A is greater than B, they return 1; and if A
!      and B are equal they return 0.  If either argument is NaN they
!      return 1, but you should not rely on this; if NaN is a
!      possibility, use one of the higher-level comparison functions.
  
   -- Runtime Function: int __unordsf2 (float A, float B)
   -- Runtime Function: int __unorddf2 (double A, double B)
--- 598,607 ----
   -- Runtime Function: int __cmpdf2 (double A, double B)
   -- Runtime Function: int __cmptf2 (long double A, long double B)
       These functions calculate a <=> b.  That is, if A is less than B,
!      they return -1; if A is greater than B, they return 1; and if A and
!      B are equal they return 0.  If either argument is NaN they return
!      1, but you should not rely on this; if NaN is a possibility, use
!      one of the higher-level comparison functions.
  
   -- Runtime Function: int __unordsf2 (float A, float B)
   -- Runtime Function: int __unorddf2 (double A, double B)
*************** hood, all of these routines are implemen
*** 622,637 ****
           return E;
         return __cmpXf2 (a, b);
  
! where E is a constant chosen to give the proper behavior for NaN.
! Thus, the meaning of the return value is different for each set.  Do
! not rely on this implementation; only the semantics documented below
! are guaranteed.
  
   -- Runtime Function: int __eqsf2 (float A, float B)
   -- Runtime Function: int __eqdf2 (double A, double B)
   -- Runtime Function: int __eqtf2 (long double A, long double B)
!      These functions return zero if neither argument is NaN, and A and
!      B are equal.
  
   -- Runtime Function: int __nesf2 (float A, float B)
   -- Runtime Function: int __nedf2 (double A, double B)
--- 619,634 ----
           return E;
         return __cmpXf2 (a, b);
  
! where E is a constant chosen to give the proper behavior for NaN.  Thus,
! the meaning of the return value is different for each set.  Do not rely
! on this implementation; only the semantics documented below are
! guaranteed.
  
   -- Runtime Function: int __eqsf2 (float A, float B)
   -- Runtime Function: int __eqdf2 (double A, double B)
   -- Runtime Function: int __eqtf2 (long double A, long double B)
!      These functions return zero if neither argument is NaN, and A and B
!      are equal.
  
   -- Runtime Function: int __nesf2 (float A, float B)
   -- Runtime Function: int __nedf2 (double A, double B)
*************** are guaranteed.
*** 672,679 ****
   -- Runtime Function: long double __powixf2 (long double A, int B)
       These functions convert raise A to the power B.
  
!  -- Runtime Function: complex float __mulsc3 (float A, float B, float
!           C, float D)
   -- Runtime Function: complex double __muldc3 (double A, double B,
            double C, double D)
   -- Runtime Function: complex long double __multc3 (long double A, long
--- 669,676 ----
   -- Runtime Function: long double __powixf2 (long double A, int B)
       These functions convert raise A to the power B.
  
!  -- Runtime Function: complex float __mulsc3 (float A, float B, float C,
!           float D)
   -- Runtime Function: complex double __muldc3 (double A, double B,
            double C, double D)
   -- Runtime Function: complex long double __multc3 (long double A, long
*************** are guaranteed.
*** 683,690 ****
       These functions return the product of A + iB and C + iD, following
       the rules of C99 Annex G.
  
!  -- Runtime Function: complex float __divsc3 (float A, float B, float
!           C, float D)
   -- Runtime Function: complex double __divdc3 (double A, double B,
            double C, double D)
   -- Runtime Function: complex long double __divtc3 (long double A, long
--- 680,687 ----
       These functions return the product of A + iB and C + iD, following
       the rules of C99 Annex G.
  
!  -- Runtime Function: complex float __divsc3 (float A, float B, float C,
!           float D)
   -- Runtime Function: complex double __divdc3 (double A, double B,
            double C, double D)
   -- Runtime Function: complex long double __divtc3 (long double A, long
*************** selected at configure time.
*** 883,890 ****
   -- Runtime Function: unsigned long __bid_fixunsdddi (_Decimal64 A)
   -- Runtime Function: unsigned long __dpd_fixunstddi (_Decimal128 A)
   -- Runtime Function: unsigned long __bid_fixunstddi (_Decimal128 A)
!      These functions convert A to an unsigned long.  Negative values
!      all become zero.
  
   -- Runtime Function: _Decimal32 __dpd_floatsisd (int I)
   -- Runtime Function: _Decimal32 __bid_floatsisd (int I)
--- 880,887 ----
   -- Runtime Function: unsigned long __bid_fixunsdddi (_Decimal64 A)
   -- Runtime Function: unsigned long __dpd_fixunstddi (_Decimal128 A)
   -- Runtime Function: unsigned long __bid_fixunstddi (_Decimal128 A)
!      These functions convert A to an unsigned long.  Negative values all
!      become zero.
  
   -- Runtime Function: _Decimal32 __dpd_floatsisd (int I)
   -- Runtime Function: _Decimal32 __bid_floatsisd (int I)
*************** selected at configure time.
*** 910,917 ****
   -- Runtime Function: _Decimal64 __bid_floatunssidd (unsigned int I)
   -- Runtime Function: _Decimal128 __dpd_floatunssitd (unsigned int I)
   -- Runtime Function: _Decimal128 __bid_floatunssitd (unsigned int I)
!      These functions convert I, an unsigned integer, to decimal
!      floating point.
  
   -- Runtime Function: _Decimal32 __dpd_floatunsdisd (unsigned long I)
   -- Runtime Function: _Decimal32 __bid_floatunsdisd (unsigned long I)
--- 907,914 ----
   -- Runtime Function: _Decimal64 __bid_floatunssidd (unsigned int I)
   -- Runtime Function: _Decimal128 __dpd_floatunssitd (unsigned int I)
   -- Runtime Function: _Decimal128 __bid_floatunssitd (unsigned int I)
!      These functions convert I, an unsigned integer, to decimal floating
!      point.
  
   -- Runtime Function: _Decimal32 __dpd_floatunsdisd (unsigned long I)
   -- Runtime Function: _Decimal32 __bid_floatunsdisd (unsigned long I)
*************** hood, all of these routines are implemen
*** 944,953 ****
           return E;
         return __bid_cmpXd2 (a, b);
  
! where E is a constant chosen to give the proper behavior for NaN.
! Thus, the meaning of the return value is different for each set.  Do
! not rely on this implementation; only the semantics documented below
! are guaranteed.
  
   -- Runtime Function: int __dpd_eqsd2 (_Decimal32 A, _Decimal32 B)
   -- Runtime Function: int __bid_eqsd2 (_Decimal32 A, _Decimal32 B)
--- 941,950 ----
           return E;
         return __bid_cmpXd2 (a, b);
  
! where E is a constant chosen to give the proper behavior for NaN.  Thus,
! the meaning of the return value is different for each set.  Do not rely
! on this implementation; only the semantics documented below are
! guaranteed.
  
   -- Runtime Function: int __dpd_eqsd2 (_Decimal32 A, _Decimal32 B)
   -- Runtime Function: int __bid_eqsd2 (_Decimal32 A, _Decimal32 B)
*************** are guaranteed.
*** 955,962 ****
   -- Runtime Function: int __bid_eqdd2 (_Decimal64 A, _Decimal64 B)
   -- Runtime Function: int __dpd_eqtd2 (_Decimal128 A, _Decimal128 B)
   -- Runtime Function: int __bid_eqtd2 (_Decimal128 A, _Decimal128 B)
!      These functions return zero if neither argument is NaN, and A and
!      B are equal.
  
   -- Runtime Function: int __dpd_nesd2 (_Decimal32 A, _Decimal32 B)
   -- Runtime Function: int __bid_nesd2 (_Decimal32 A, _Decimal32 B)
--- 952,959 ----
   -- Runtime Function: int __bid_eqdd2 (_Decimal64 A, _Decimal64 B)
   -- Runtime Function: int __dpd_eqtd2 (_Decimal128 A, _Decimal128 B)
   -- Runtime Function: int __bid_eqtd2 (_Decimal128 A, _Decimal128 B)
!      These functions return zero if neither argument is NaN, and A and B
!      are equal.
  
   -- Runtime Function: int __dpd_nesd2 (_Decimal32 A, _Decimal32 B)
   -- Runtime Function: int __bid_nesd2 (_Decimal32 A, _Decimal32 B)
*************** File: gccint.info,  Node: Fixed-point fr
*** 1012,1031 ****
  The software fixed-point library implements fixed-point fractional
  arithmetic, and is only activated on selected targets.
  
!  For ease of comprehension `fract' is an alias for the `_Fract' type,
! `accum' an alias for `_Accum', and `sat' an alias for `_Sat'.
  
   For illustrative purposes, in this section the fixed-point fractional
! type `short fract' is assumed to correspond to machine mode `QQmode';
! `unsigned short fract' to `UQQmode'; `fract' to `HQmode';
! `unsigned fract' to `UHQmode'; `long fract' to `SQmode';
! `unsigned long fract' to `USQmode'; `long long fract' to `DQmode'; and
! `unsigned long long fract' to `UDQmode'.  Similarly the fixed-point
! accumulator type `short accum' corresponds to `HAmode';
! `unsigned short accum' to `UHAmode'; `accum' to `SAmode';
! `unsigned accum' to `USAmode'; `long accum' to `DAmode';
! `unsigned long accum' to `UDAmode'; `long long accum' to `TAmode'; and
! `unsigned long long accum' to `UTAmode'.
  
  4.4.1 Arithmetic functions
  --------------------------
--- 1009,1028 ----
  The software fixed-point library implements fixed-point fractional
  arithmetic, and is only activated on selected targets.
  
!  For ease of comprehension 'fract' is an alias for the '_Fract' type,
! 'accum' an alias for '_Accum', and 'sat' an alias for '_Sat'.
  
   For illustrative purposes, in this section the fixed-point fractional
! type 'short fract' is assumed to correspond to machine mode 'QQmode';
! 'unsigned short fract' to 'UQQmode'; 'fract' to 'HQmode';
! 'unsigned fract' to 'UHQmode'; 'long fract' to 'SQmode';
! 'unsigned long fract' to 'USQmode'; 'long long fract' to 'DQmode'; and
! 'unsigned long long fract' to 'UDQmode'.  Similarly the fixed-point
! accumulator type 'short accum' corresponds to 'HAmode';
! 'unsigned short accum' to 'UHAmode'; 'accum' to 'SAmode';
! 'unsigned accum' to 'USAmode'; 'long accum' to 'DAmode';
! 'unsigned long accum' to 'UDAmode'; 'long long accum' to 'TAmode'; and
! 'unsigned long long accum' to 'UTAmode'.
  
  4.4.1 Arithmetic functions
  --------------------------
*************** accumulator type `short accum' correspon
*** 1040,1047 ****
            fract A, unsigned short fract B)
   -- Runtime Function: unsigned fract __adduhq3 (unsigned fract A,
            unsigned fract B)
!  -- Runtime Function: unsigned long fract __addusq3 (unsigned long
!           fract A, unsigned long fract B)
   -- Runtime Function: unsigned long long fract __addudq3 (unsigned long
            long fract A, unsigned long long fract B)
   -- Runtime Function: short accum __addha3 (short accum A, short accum
--- 1037,1044 ----
            fract A, unsigned short fract B)
   -- Runtime Function: unsigned fract __adduhq3 (unsigned fract A,
            unsigned fract B)
!  -- Runtime Function: unsigned long fract __addusq3 (unsigned long fract
!           A, unsigned long fract B)
   -- Runtime Function: unsigned long long fract __addudq3 (unsigned long
            long fract A, unsigned long long fract B)
   -- Runtime Function: short accum __addha3 (short accum A, short accum
*************** accumulator type `short accum' correspon
*** 1054,1073 ****
            accum A, unsigned short accum B)
   -- Runtime Function: unsigned accum __addusa3 (unsigned accum A,
            unsigned accum B)
!  -- Runtime Function: unsigned long accum __adduda3 (unsigned long
!           accum A, unsigned long accum B)
   -- Runtime Function: unsigned long long accum __adduta3 (unsigned long
            long accum A, unsigned long long accum B)
       These functions return the sum of A and B.
  
!  -- Runtime Function: short fract __ssaddqq3 (short fract A, short
!           fract B)
   -- Runtime Function: fract __ssaddhq3 (fract A, fract B)
   -- Runtime Function: long fract __ssaddsq3 (long fract A, long fract B)
   -- Runtime Function: long long fract __ssadddq3 (long long fract A,
            long long fract B)
!  -- Runtime Function: short accum __ssaddha3 (short accum A, short
!           accum B)
   -- Runtime Function: accum __ssaddsa3 (accum A, accum B)
   -- Runtime Function: long accum __ssaddda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __ssaddta3 (long long accum A,
--- 1051,1070 ----
            accum A, unsigned short accum B)
   -- Runtime Function: unsigned accum __addusa3 (unsigned accum A,
            unsigned accum B)
!  -- Runtime Function: unsigned long accum __adduda3 (unsigned long accum
!           A, unsigned long accum B)
   -- Runtime Function: unsigned long long accum __adduta3 (unsigned long
            long accum A, unsigned long long accum B)
       These functions return the sum of A and B.
  
!  -- Runtime Function: short fract __ssaddqq3 (short fract A, short fract
!           B)
   -- Runtime Function: fract __ssaddhq3 (fract A, fract B)
   -- Runtime Function: long fract __ssaddsq3 (long fract A, long fract B)
   -- Runtime Function: long long fract __ssadddq3 (long long fract A,
            long long fract B)
!  -- Runtime Function: short accum __ssaddha3 (short accum A, short accum
!           B)
   -- Runtime Function: accum __ssaddsa3 (accum A, accum B)
   -- Runtime Function: long accum __ssaddda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __ssaddta3 (long long accum A,
*************** accumulator type `short accum' correspon
*** 1102,1109 ****
            fract A, unsigned short fract B)
   -- Runtime Function: unsigned fract __subuhq3 (unsigned fract A,
            unsigned fract B)
!  -- Runtime Function: unsigned long fract __subusq3 (unsigned long
!           fract A, unsigned long fract B)
   -- Runtime Function: unsigned long long fract __subudq3 (unsigned long
            long fract A, unsigned long long fract B)
   -- Runtime Function: short accum __subha3 (short accum A, short accum
--- 1099,1106 ----
            fract A, unsigned short fract B)
   -- Runtime Function: unsigned fract __subuhq3 (unsigned fract A,
            unsigned fract B)
!  -- Runtime Function: unsigned long fract __subusq3 (unsigned long fract
!           A, unsigned long fract B)
   -- Runtime Function: unsigned long long fract __subudq3 (unsigned long
            long fract A, unsigned long long fract B)
   -- Runtime Function: short accum __subha3 (short accum A, short accum
*************** accumulator type `short accum' correspon
*** 1116,1141 ****
            accum A, unsigned short accum B)
   -- Runtime Function: unsigned accum __subusa3 (unsigned accum A,
            unsigned accum B)
!  -- Runtime Function: unsigned long accum __subuda3 (unsigned long
!           accum A, unsigned long accum B)
   -- Runtime Function: unsigned long long accum __subuta3 (unsigned long
            long accum A, unsigned long long accum B)
!      These functions return the difference of A and B; that is, `A - B'.
  
!  -- Runtime Function: short fract __sssubqq3 (short fract A, short
!           fract B)
   -- Runtime Function: fract __sssubhq3 (fract A, fract B)
   -- Runtime Function: long fract __sssubsq3 (long fract A, long fract B)
   -- Runtime Function: long long fract __sssubdq3 (long long fract A,
            long long fract B)
!  -- Runtime Function: short accum __sssubha3 (short accum A, short
!           accum B)
   -- Runtime Function: accum __sssubsa3 (accum A, accum B)
   -- Runtime Function: long accum __sssubda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __sssubta3 (long long accum A,
            long long accum B)
       These functions return the difference of A and B with signed
!      saturation;  that is, `A - B'.
  
   -- Runtime Function: unsigned short fract __ussubuqq3 (unsigned short
            fract A, unsigned short fract B)
--- 1113,1138 ----
            accum A, unsigned short accum B)
   -- Runtime Function: unsigned accum __subusa3 (unsigned accum A,
            unsigned accum B)
!  -- Runtime Function: unsigned long accum __subuda3 (unsigned long accum
!           A, unsigned long accum B)
   -- Runtime Function: unsigned long long accum __subuta3 (unsigned long
            long accum A, unsigned long long accum B)
!      These functions return the difference of A and B; that is, 'A - B'.
  
!  -- Runtime Function: short fract __sssubqq3 (short fract A, short fract
!           B)
   -- Runtime Function: fract __sssubhq3 (fract A, fract B)
   -- Runtime Function: long fract __sssubsq3 (long fract A, long fract B)
   -- Runtime Function: long long fract __sssubdq3 (long long fract A,
            long long fract B)
!  -- Runtime Function: short accum __sssubha3 (short accum A, short accum
!           B)
   -- Runtime Function: accum __sssubsa3 (accum A, accum B)
   -- Runtime Function: long accum __sssubda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __sssubta3 (long long accum A,
            long long accum B)
       These functions return the difference of A and B with signed
!      saturation; that is, 'A - B'.
  
   -- Runtime Function: unsigned short fract __ussubuqq3 (unsigned short
            fract A, unsigned short fract B)
*************** accumulator type `short accum' correspon
*** 1154,1160 ****
   -- Runtime Function: unsigned long long accum __ussubuta3 (unsigned
            long long accum A, unsigned long long accum B)
       These functions return the difference of A and B with unsigned
!      saturation;  that is, `A - B'.
  
   -- Runtime Function: short fract __mulqq3 (short fract A, short fract
            B)
--- 1151,1157 ----
   -- Runtime Function: unsigned long long accum __ussubuta3 (unsigned
            long long accum A, unsigned long long accum B)
       These functions return the difference of A and B with unsigned
!      saturation; that is, 'A - B'.
  
   -- Runtime Function: short fract __mulqq3 (short fract A, short fract
            B)
*************** accumulator type `short accum' correspon
*** 1166,1173 ****
            fract A, unsigned short fract B)
   -- Runtime Function: unsigned fract __muluhq3 (unsigned fract A,
            unsigned fract B)
!  -- Runtime Function: unsigned long fract __mulusq3 (unsigned long
!           fract A, unsigned long fract B)
   -- Runtime Function: unsigned long long fract __muludq3 (unsigned long
            long fract A, unsigned long long fract B)
   -- Runtime Function: short accum __mulha3 (short accum A, short accum
--- 1163,1170 ----
            fract A, unsigned short fract B)
   -- Runtime Function: unsigned fract __muluhq3 (unsigned fract A,
            unsigned fract B)
!  -- Runtime Function: unsigned long fract __mulusq3 (unsigned long fract
!           A, unsigned long fract B)
   -- Runtime Function: unsigned long long fract __muludq3 (unsigned long
            long fract A, unsigned long long fract B)
   -- Runtime Function: short accum __mulha3 (short accum A, short accum
*************** accumulator type `short accum' correspon
*** 1180,1199 ****
            accum A, unsigned short accum B)
   -- Runtime Function: unsigned accum __mulusa3 (unsigned accum A,
            unsigned accum B)
!  -- Runtime Function: unsigned long accum __muluda3 (unsigned long
!           accum A, unsigned long accum B)
   -- Runtime Function: unsigned long long accum __muluta3 (unsigned long
            long accum A, unsigned long long accum B)
       These functions return the product of A and B.
  
!  -- Runtime Function: short fract __ssmulqq3 (short fract A, short
!           fract B)
   -- Runtime Function: fract __ssmulhq3 (fract A, fract B)
   -- Runtime Function: long fract __ssmulsq3 (long fract A, long fract B)
   -- Runtime Function: long long fract __ssmuldq3 (long long fract A,
            long long fract B)
!  -- Runtime Function: short accum __ssmulha3 (short accum A, short
!           accum B)
   -- Runtime Function: accum __ssmulsa3 (accum A, accum B)
   -- Runtime Function: long accum __ssmulda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __ssmulta3 (long long accum A,
--- 1177,1196 ----
            accum A, unsigned short accum B)
   -- Runtime Function: unsigned accum __mulusa3 (unsigned accum A,
            unsigned accum B)
!  -- Runtime Function: unsigned long accum __muluda3 (unsigned long accum
!           A, unsigned long accum B)
   -- Runtime Function: unsigned long long accum __muluta3 (unsigned long
            long accum A, unsigned long long accum B)
       These functions return the product of A and B.
  
!  -- Runtime Function: short fract __ssmulqq3 (short fract A, short fract
!           B)
   -- Runtime Function: fract __ssmulhq3 (fract A, fract B)
   -- Runtime Function: long fract __ssmulsq3 (long fract A, long fract B)
   -- Runtime Function: long long fract __ssmuldq3 (long long fract A,
            long long fract B)
!  -- Runtime Function: short accum __ssmulha3 (short accum A, short accum
!           B)
   -- Runtime Function: accum __ssmulsa3 (accum A, accum B)
   -- Runtime Function: long accum __ssmulda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __ssmulta3 (long long accum A,
*************** accumulator type `short accum' correspon
*** 1232,1239 ****
   -- Runtime Function: long accum __divda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __divta3 (long long accum A, long
            long accum B)
!      These functions return the quotient of the signed division of A
!      and B.
  
   -- Runtime Function: unsigned short fract __udivuqq3 (unsigned short
            fract A, unsigned short fract B)
--- 1229,1236 ----
   -- Runtime Function: long accum __divda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __divta3 (long long accum A, long
            long accum B)
!      These functions return the quotient of the signed division of A and
!      B.
  
   -- Runtime Function: unsigned short fract __udivuqq3 (unsigned short
            fract A, unsigned short fract B)
*************** accumulator type `short accum' correspon
*** 1241,1273 ****
            unsigned fract B)
   -- Runtime Function: unsigned long fract __udivusq3 (unsigned long
            fract A, unsigned long fract B)
!  -- Runtime Function: unsigned long long fract __udivudq3 (unsigned
!           long long fract A, unsigned long long fract B)
   -- Runtime Function: unsigned short accum __udivuha3 (unsigned short
            accum A, unsigned short accum B)
   -- Runtime Function: unsigned accum __udivusa3 (unsigned accum A,
            unsigned accum B)
   -- Runtime Function: unsigned long accum __udivuda3 (unsigned long
            accum A, unsigned long accum B)
!  -- Runtime Function: unsigned long long accum __udivuta3 (unsigned
!           long long accum A, unsigned long long accum B)
       These functions return the quotient of the unsigned division of A
       and B.
  
!  -- Runtime Function: short fract __ssdivqq3 (short fract A, short
!           fract B)
   -- Runtime Function: fract __ssdivhq3 (fract A, fract B)
   -- Runtime Function: long fract __ssdivsq3 (long fract A, long fract B)
   -- Runtime Function: long long fract __ssdivdq3 (long long fract A,
            long long fract B)
!  -- Runtime Function: short accum __ssdivha3 (short accum A, short
!           accum B)
   -- Runtime Function: accum __ssdivsa3 (accum A, accum B)
   -- Runtime Function: long accum __ssdivda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __ssdivta3 (long long accum A,
            long long accum B)
!      These functions return the quotient of the signed division of A
!      and B with signed saturation.
  
   -- Runtime Function: unsigned short fract __usdivuqq3 (unsigned short
            fract A, unsigned short fract B)
--- 1238,1270 ----
            unsigned fract B)
   -- Runtime Function: unsigned long fract __udivusq3 (unsigned long
            fract A, unsigned long fract B)
!  -- Runtime Function: unsigned long long fract __udivudq3 (unsigned long
!           long fract A, unsigned long long fract B)
   -- Runtime Function: unsigned short accum __udivuha3 (unsigned short
            accum A, unsigned short accum B)
   -- Runtime Function: unsigned accum __udivusa3 (unsigned accum A,
            unsigned accum B)
   -- Runtime Function: unsigned long accum __udivuda3 (unsigned long
            accum A, unsigned long accum B)
!  -- Runtime Function: unsigned long long accum __udivuta3 (unsigned long
!           long accum A, unsigned long long accum B)
       These functions return the quotient of the unsigned division of A
       and B.
  
!  -- Runtime Function: short fract __ssdivqq3 (short fract A, short fract
!           B)
   -- Runtime Function: fract __ssdivhq3 (fract A, fract B)
   -- Runtime Function: long fract __ssdivsq3 (long fract A, long fract B)
   -- Runtime Function: long long fract __ssdivdq3 (long long fract A,
            long long fract B)
!  -- Runtime Function: short accum __ssdivha3 (short accum A, short accum
!           B)
   -- Runtime Function: accum __ssdivsa3 (accum A, accum B)
   -- Runtime Function: long accum __ssdivda3 (long accum A, long accum B)
   -- Runtime Function: long long accum __ssdivta3 (long long accum A,
            long long accum B)
!      These functions return the quotient of the signed division of A and
!      B with signed saturation.
  
   -- Runtime Function: unsigned short fract __usdivuqq3 (unsigned short
            fract A, unsigned short fract B)
*************** accumulator type `short accum' correspon
*** 1295,1302 ****
   -- Runtime Function: unsigned short fract __neguqq2 (unsigned short
            fract A)
   -- Runtime Function: unsigned fract __neguhq2 (unsigned fract A)
!  -- Runtime Function: unsigned long fract __negusq2 (unsigned long
!           fract A)
   -- Runtime Function: unsigned long long fract __negudq2 (unsigned long
            long fract A)
   -- Runtime Function: short accum __negha2 (short accum A)
--- 1292,1299 ----
   -- Runtime Function: unsigned short fract __neguqq2 (unsigned short
            fract A)
   -- Runtime Function: unsigned fract __neguhq2 (unsigned fract A)
!  -- Runtime Function: unsigned long fract __negusq2 (unsigned long fract
!           A)
   -- Runtime Function: unsigned long long fract __negudq2 (unsigned long
            long fract A)
   -- Runtime Function: short accum __negha2 (short accum A)
*************** accumulator type `short accum' correspon
*** 1306,1313 ****
   -- Runtime Function: unsigned short accum __neguha2 (unsigned short
            accum A)
   -- Runtime Function: unsigned accum __negusa2 (unsigned accum A)
!  -- Runtime Function: unsigned long accum __neguda2 (unsigned long
!           accum A)
   -- Runtime Function: unsigned long long accum __neguta2 (unsigned long
            long accum A)
       These functions return the negation of A.
--- 1303,1310 ----
   -- Runtime Function: unsigned short accum __neguha2 (unsigned short
            accum A)
   -- Runtime Function: unsigned accum __negusa2 (unsigned accum A)
!  -- Runtime Function: unsigned long accum __neguda2 (unsigned long accum
!           A)
   -- Runtime Function: unsigned long long accum __neguta2 (unsigned long
            long accum A)
       These functions return the negation of A.
*************** accumulator type `short accum' correspon
*** 1349,1356 ****
            B)
   -- Runtime Function: unsigned long fract __ashlusq3 (unsigned long
            fract A, int B)
!  -- Runtime Function: unsigned long long fract __ashludq3 (unsigned
!           long long fract A, int B)
   -- Runtime Function: short accum __ashlha3 (short accum A, int B)
   -- Runtime Function: accum __ashlsa3 (accum A, int B)
   -- Runtime Function: long accum __ashlda3 (long accum A, int B)
--- 1346,1353 ----
            B)
   -- Runtime Function: unsigned long fract __ashlusq3 (unsigned long
            fract A, int B)
!  -- Runtime Function: unsigned long long fract __ashludq3 (unsigned long
!           long fract A, int B)
   -- Runtime Function: short accum __ashlha3 (short accum A, int B)
   -- Runtime Function: accum __ashlsa3 (accum A, int B)
   -- Runtime Function: long accum __ashlda3 (long accum A, int B)
*************** accumulator type `short accum' correspon
*** 1362,1369 ****
            B)
   -- Runtime Function: unsigned long accum __ashluda3 (unsigned long
            accum A, int B)
!  -- Runtime Function: unsigned long long accum __ashluta3 (unsigned
!           long long accum A, int B)
       These functions return the result of shifting A left by B bits.
  
   -- Runtime Function: short fract __ashrqq3 (short fract A, int B)
--- 1359,1366 ----
            B)
   -- Runtime Function: unsigned long accum __ashluda3 (unsigned long
            accum A, int B)
!  -- Runtime Function: unsigned long long accum __ashluta3 (unsigned long
!           long accum A, int B)
       These functions return the result of shifting A left by B bits.
  
   -- Runtime Function: short fract __ashrqq3 (short fract A, int B)
*************** accumulator type `short accum' correspon
*** 1385,1400 ****
            B)
   -- Runtime Function: unsigned long fract __lshrusq3 (unsigned long
            fract A, int B)
!  -- Runtime Function: unsigned long long fract __lshrudq3 (unsigned
!           long long fract A, int B)
   -- Runtime Function: unsigned short accum __lshruha3 (unsigned short
            accum A, int B)
   -- Runtime Function: unsigned accum __lshrusa3 (unsigned accum A, int
            B)
   -- Runtime Function: unsigned long accum __lshruda3 (unsigned long
            accum A, int B)
!  -- Runtime Function: unsigned long long accum __lshruta3 (unsigned
!           long long accum A, int B)
       These functions return the result of logically shifting A right by
       B bits.
  
--- 1382,1397 ----
            B)
   -- Runtime Function: unsigned long fract __lshrusq3 (unsigned long
            fract A, int B)
!  -- Runtime Function: unsigned long long fract __lshrudq3 (unsigned long
!           long fract A, int B)
   -- Runtime Function: unsigned short accum __lshruha3 (unsigned short
            accum A, int B)
   -- Runtime Function: unsigned accum __lshrusa3 (unsigned accum A, int
            B)
   -- Runtime Function: unsigned long accum __lshruda3 (unsigned long
            accum A, int B)
!  -- Runtime Function: unsigned long long accum __lshruta3 (unsigned long
!           long accum A, int B)
       These functions return the result of logically shifting A right by
       B bits.
  
*************** accumulator type `short accum' correspon
*** 1407,1433 ****
   -- Runtime Function: long accum __ssashlda3 (long accum A, int B)
   -- Runtime Function: long long accum __ssashlta3 (long long accum A,
            int B)
!      These functions return the result of shifting A left by B bits
!      with signed saturation.
  
   -- Runtime Function: unsigned short fract __usashluqq3 (unsigned short
            fract A, int B)
!  -- Runtime Function: unsigned fract __usashluhq3 (unsigned fract A,
!           int B)
   -- Runtime Function: unsigned long fract __usashlusq3 (unsigned long
            fract A, int B)
   -- Runtime Function: unsigned long long fract __usashludq3 (unsigned
            long long fract A, int B)
   -- Runtime Function: unsigned short accum __usashluha3 (unsigned short
            accum A, int B)
!  -- Runtime Function: unsigned accum __usashlusa3 (unsigned accum A,
!           int B)
   -- Runtime Function: unsigned long accum __usashluda3 (unsigned long
            accum A, int B)
   -- Runtime Function: unsigned long long accum __usashluta3 (unsigned
            long long accum A, int B)
!      These functions return the result of shifting A left by B bits
!      with unsigned saturation.
  
  4.4.2 Comparison functions
  --------------------------
--- 1404,1430 ----
   -- Runtime Function: long accum __ssashlda3 (long accum A, int B)
   -- Runtime Function: long long accum __ssashlta3 (long long accum A,
            int B)
!      These functions return the result of shifting A left by B bits with
!      signed saturation.
  
   -- Runtime Function: unsigned short fract __usashluqq3 (unsigned short
            fract A, int B)
!  -- Runtime Function: unsigned fract __usashluhq3 (unsigned fract A, int
!           B)
   -- Runtime Function: unsigned long fract __usashlusq3 (unsigned long
            fract A, int B)
   -- Runtime Function: unsigned long long fract __usashludq3 (unsigned
            long long fract A, int B)
   -- Runtime Function: unsigned short accum __usashluha3 (unsigned short
            accum A, int B)
!  -- Runtime Function: unsigned accum __usashlusa3 (unsigned accum A, int
!           B)
   -- Runtime Function: unsigned long accum __usashluda3 (unsigned long
            accum A, int B)
   -- Runtime Function: unsigned long long accum __usashluta3 (unsigned
            long long accum A, int B)
!      These functions return the result of shifting A left by B bits with
!      unsigned saturation.
  
  4.4.2 Comparison functions
  --------------------------
*************** returned result using either signed or u
*** 1481,1493 ****
   -- Runtime Function: unsigned short fract __fractqquqq (short fract A)
   -- Runtime Function: unsigned fract __fractqquhq (short fract A)
   -- Runtime Function: unsigned long fract __fractqqusq (short fract A)
!  -- Runtime Function: unsigned long long fract __fractqqudq (short
!           fract A)
   -- Runtime Function: unsigned short accum __fractqquha (short fract A)
   -- Runtime Function: unsigned accum __fractqqusa (short fract A)
   -- Runtime Function: unsigned long accum __fractqquda (short fract A)
!  -- Runtime Function: unsigned long long accum __fractqquta (short
!           fract A)
   -- Runtime Function: signed char __fractqqqi (short fract A)
   -- Runtime Function: short __fractqqhi (short fract A)
   -- Runtime Function: int __fractqqsi (short fract A)
--- 1478,1490 ----
   -- Runtime Function: unsigned short fract __fractqquqq (short fract A)
   -- Runtime Function: unsigned fract __fractqquhq (short fract A)
   -- Runtime Function: unsigned long fract __fractqqusq (short fract A)
!  -- Runtime Function: unsigned long long fract __fractqqudq (short fract
!           A)
   -- Runtime Function: unsigned short accum __fractqquha (short fract A)
   -- Runtime Function: unsigned accum __fractqqusa (short fract A)
   -- Runtime Function: unsigned long accum __fractqquda (short fract A)
!  -- Runtime Function: unsigned long long accum __fractqquta (short fract
!           A)
   -- Runtime Function: signed char __fractqqqi (short fract A)
   -- Runtime Function: short __fractqqhi (short fract A)
   -- Runtime Function: int __fractqqsi (short fract A)
*************** returned result using either signed or u
*** 1548,1562 ****
   -- Runtime Function: accum __fractdqsa (long long fract A)
   -- Runtime Function: long accum __fractdqda (long long fract A)
   -- Runtime Function: long long accum __fractdqta (long long fract A)
!  -- Runtime Function: unsigned short fract __fractdquqq (long long
!           fract A)
   -- Runtime Function: unsigned fract __fractdquhq (long long fract A)
   -- Runtime Function: unsigned long fract __fractdqusq (long long fract
            A)
   -- Runtime Function: unsigned long long fract __fractdqudq (long long
            fract A)
!  -- Runtime Function: unsigned short accum __fractdquha (long long
!           fract A)
   -- Runtime Function: unsigned accum __fractdqusa (long long fract A)
   -- Runtime Function: unsigned long accum __fractdquda (long long fract
            A)
--- 1545,1559 ----
   -- Runtime Function: accum __fractdqsa (long long fract A)
   -- Runtime Function: long accum __fractdqda (long long fract A)
   -- Runtime Function: long long accum __fractdqta (long long fract A)
!  -- Runtime Function: unsigned short fract __fractdquqq (long long fract
!           A)
   -- Runtime Function: unsigned fract __fractdquhq (long long fract A)
   -- Runtime Function: unsigned long fract __fractdqusq (long long fract
            A)
   -- Runtime Function: unsigned long long fract __fractdqudq (long long
            fract A)
!  -- Runtime Function: unsigned short accum __fractdquha (long long fract
!           A)
   -- Runtime Function: unsigned accum __fractdqusa (long long fract A)
   -- Runtime Function: unsigned long accum __fractdquda (long long fract
            A)
*************** returned result using either signed or u
*** 1579,1591 ****
   -- Runtime Function: unsigned short fract __fracthauqq (short accum A)
   -- Runtime Function: unsigned fract __fracthauhq (short accum A)
   -- Runtime Function: unsigned long fract __fracthausq (short accum A)
!  -- Runtime Function: unsigned long long fract __fracthaudq (short
!           accum A)
   -- Runtime Function: unsigned short accum __fracthauha (short accum A)
   -- Runtime Function: unsigned accum __fracthausa (short accum A)
   -- Runtime Function: unsigned long accum __fracthauda (short accum A)
!  -- Runtime Function: unsigned long long accum __fracthauta (short
!           accum A)
   -- Runtime Function: signed char __fracthaqi (short accum A)
   -- Runtime Function: short __fracthahi (short accum A)
   -- Runtime Function: int __fracthasi (short accum A)
--- 1576,1588 ----
   -- Runtime Function: unsigned short fract __fracthauqq (short accum A)
   -- Runtime Function: unsigned fract __fracthauhq (short accum A)
   -- Runtime Function: unsigned long fract __fracthausq (short accum A)
!  -- Runtime Function: unsigned long long fract __fracthaudq (short accum
!           A)
   -- Runtime Function: unsigned short accum __fracthauha (short accum A)
   -- Runtime Function: unsigned accum __fracthausa (short accum A)
   -- Runtime Function: unsigned long accum __fracthauda (short accum A)
!  -- Runtime Function: unsigned long long accum __fracthauta (short accum
!           A)
   -- Runtime Function: signed char __fracthaqi (short accum A)
   -- Runtime Function: short __fracthahi (short accum A)
   -- Runtime Function: int __fracthasi (short accum A)
*************** returned result using either signed or u
*** 1646,1660 ****
   -- Runtime Function: short accum __fracttaha2 (long long accum A)
   -- Runtime Function: accum __fracttasa2 (long long accum A)
   -- Runtime Function: long accum __fracttada2 (long long accum A)
!  -- Runtime Function: unsigned short fract __fracttauqq (long long
!           accum A)
   -- Runtime Function: unsigned fract __fracttauhq (long long accum A)
   -- Runtime Function: unsigned long fract __fracttausq (long long accum
            A)
   -- Runtime Function: unsigned long long fract __fracttaudq (long long
            accum A)
!  -- Runtime Function: unsigned short accum __fracttauha (long long
!           accum A)
   -- Runtime Function: unsigned accum __fracttausa (long long accum A)
   -- Runtime Function: unsigned long accum __fracttauda (long long accum
            A)
--- 1643,1657 ----
   -- Runtime Function: short accum __fracttaha2 (long long accum A)
   -- Runtime Function: accum __fracttasa2 (long long accum A)
   -- Runtime Function: long accum __fracttada2 (long long accum A)
!  -- Runtime Function: unsigned short fract __fracttauqq (long long accum
!           A)
   -- Runtime Function: unsigned fract __fracttauhq (long long accum A)
   -- Runtime Function: unsigned long fract __fracttausq (long long accum
            A)
   -- Runtime Function: unsigned long long fract __fracttaudq (long long
            accum A)
!  -- Runtime Function: unsigned short accum __fracttauha (long long accum
!           A)
   -- Runtime Function: unsigned accum __fracttausa (long long accum A)
   -- Runtime Function: unsigned long accum __fracttauda (long long accum
            A)
*************** returned result using either signed or u
*** 1670,1692 ****
   -- Runtime Function: short fract __fractuqqqq (unsigned short fract A)
   -- Runtime Function: fract __fractuqqhq (unsigned short fract A)
   -- Runtime Function: long fract __fractuqqsq (unsigned short fract A)
!  -- Runtime Function: long long fract __fractuqqdq (unsigned short
!           fract A)
   -- Runtime Function: short accum __fractuqqha (unsigned short fract A)
   -- Runtime Function: accum __fractuqqsa (unsigned short fract A)
   -- Runtime Function: long accum __fractuqqda (unsigned short fract A)
!  -- Runtime Function: long long accum __fractuqqta (unsigned short
!           fract A)
   -- Runtime Function: unsigned fract __fractuqquhq2 (unsigned short
            fract A)
!  -- Runtime Function: unsigned long fract __fractuqqusq2 (unsigned
!           short fract A)
   -- Runtime Function: unsigned long long fract __fractuqqudq2 (unsigned
            short fract A)
!  -- Runtime Function: unsigned short accum __fractuqquha (unsigned
!           short fract A)
!  -- Runtime Function: unsigned accum __fractuqqusa (unsigned short
            fract A)
   -- Runtime Function: unsigned long accum __fractuqquda (unsigned short
            fract A)
   -- Runtime Function: unsigned long long accum __fractuqquta (unsigned
--- 1667,1689 ----
   -- Runtime Function: short fract __fractuqqqq (unsigned short fract A)
   -- Runtime Function: fract __fractuqqhq (unsigned short fract A)
   -- Runtime Function: long fract __fractuqqsq (unsigned short fract A)
!  -- Runtime Function: long long fract __fractuqqdq (unsigned short fract
!           A)
   -- Runtime Function: short accum __fractuqqha (unsigned short fract A)
   -- Runtime Function: accum __fractuqqsa (unsigned short fract A)
   -- Runtime Function: long accum __fractuqqda (unsigned short fract A)
!  -- Runtime Function: long long accum __fractuqqta (unsigned short fract
!           A)
   -- Runtime Function: unsigned fract __fractuqquhq2 (unsigned short
            fract A)
!  -- Runtime Function: unsigned long fract __fractuqqusq2 (unsigned short
!           fract A)
   -- Runtime Function: unsigned long long fract __fractuqqudq2 (unsigned
            short fract A)
!  -- Runtime Function: unsigned short accum __fractuqquha (unsigned short
            fract A)
+  -- Runtime Function: unsigned accum __fractuqqusa (unsigned short fract
+           A)
   -- Runtime Function: unsigned long accum __fractuqquda (unsigned short
            fract A)
   -- Runtime Function: unsigned long long accum __fractuqquta (unsigned
*************** returned result using either signed or u
*** 1708,1719 ****
   -- Runtime Function: long long accum __fractuhqta (unsigned fract A)
   -- Runtime Function: unsigned short fract __fractuhquqq2 (unsigned
            fract A)
!  -- Runtime Function: unsigned long fract __fractuhqusq2 (unsigned
!           fract A)
   -- Runtime Function: unsigned long long fract __fractuhqudq2 (unsigned
            fract A)
!  -- Runtime Function: unsigned short accum __fractuhquha (unsigned
!           fract A)
   -- Runtime Function: unsigned accum __fractuhqusa (unsigned fract A)
   -- Runtime Function: unsigned long accum __fractuhquda (unsigned fract
            A)
--- 1705,1716 ----
   -- Runtime Function: long long accum __fractuhqta (unsigned fract A)
   -- Runtime Function: unsigned short fract __fractuhquqq2 (unsigned
            fract A)
!  -- Runtime Function: unsigned long fract __fractuhqusq2 (unsigned fract
!           A)
   -- Runtime Function: unsigned long long fract __fractuhqudq2 (unsigned
            fract A)
!  -- Runtime Function: unsigned short accum __fractuhquha (unsigned fract
!           A)
   -- Runtime Function: unsigned accum __fractuhqusa (unsigned fract A)
   -- Runtime Function: unsigned long accum __fractuhquda (unsigned fract
            A)
*************** returned result using either signed or u
*** 1736,1745 ****
   -- Runtime Function: long accum __fractusqda (unsigned long fract A)
   -- Runtime Function: long long accum __fractusqta (unsigned long fract
            A)
!  -- Runtime Function: unsigned short fract __fractusquqq2 (unsigned
!           long fract A)
!  -- Runtime Function: unsigned fract __fractusquhq2 (unsigned long
            fract A)
   -- Runtime Function: unsigned long long fract __fractusqudq2 (unsigned
            long fract A)
   -- Runtime Function: unsigned short accum __fractusquha (unsigned long
--- 1733,1742 ----
   -- Runtime Function: long accum __fractusqda (unsigned long fract A)
   -- Runtime Function: long long accum __fractusqta (unsigned long fract
            A)
!  -- Runtime Function: unsigned short fract __fractusquqq2 (unsigned long
            fract A)
+  -- Runtime Function: unsigned fract __fractusquhq2 (unsigned long fract
+           A)
   -- Runtime Function: unsigned long long fract __fractusqudq2 (unsigned
            long fract A)
   -- Runtime Function: unsigned short accum __fractusquha (unsigned long
*************** returned result using either signed or u
*** 1757,1778 ****
   -- Runtime Function: long long __fractusqti (unsigned long fract A)
   -- Runtime Function: float __fractusqsf (unsigned long fract A)
   -- Runtime Function: double __fractusqdf (unsigned long fract A)
!  -- Runtime Function: short fract __fractudqqq (unsigned long long
!           fract A)
   -- Runtime Function: fract __fractudqhq (unsigned long long fract A)
   -- Runtime Function: long fract __fractudqsq (unsigned long long fract
            A)
   -- Runtime Function: long long fract __fractudqdq (unsigned long long
            fract A)
!  -- Runtime Function: short accum __fractudqha (unsigned long long
!           fract A)
   -- Runtime Function: accum __fractudqsa (unsigned long long fract A)
   -- Runtime Function: long accum __fractudqda (unsigned long long fract
            A)
   -- Runtime Function: long long accum __fractudqta (unsigned long long
            fract A)
!  -- Runtime Function: unsigned short fract __fractudquqq2 (unsigned
!           long long fract A)
   -- Runtime Function: unsigned fract __fractudquhq2 (unsigned long long
            fract A)
   -- Runtime Function: unsigned long fract __fractudqusq2 (unsigned long
--- 1754,1775 ----
   -- Runtime Function: long long __fractusqti (unsigned long fract A)
   -- Runtime Function: float __fractusqsf (unsigned long fract A)
   -- Runtime Function: double __fractusqdf (unsigned long fract A)
!  -- Runtime Function: short fract __fractudqqq (unsigned long long fract
!           A)
   -- Runtime Function: fract __fractudqhq (unsigned long long fract A)
   -- Runtime Function: long fract __fractudqsq (unsigned long long fract
            A)
   -- Runtime Function: long long fract __fractudqdq (unsigned long long
            fract A)
!  -- Runtime Function: short accum __fractudqha (unsigned long long fract
!           A)
   -- Runtime Function: accum __fractudqsa (unsigned long long fract A)
   -- Runtime Function: long accum __fractudqda (unsigned long long fract
            A)
   -- Runtime Function: long long accum __fractudqta (unsigned long long
            fract A)
!  -- Runtime Function: unsigned short fract __fractudquqq2 (unsigned long
!           long fract A)
   -- Runtime Function: unsigned fract __fractudquhq2 (unsigned long long
            fract A)
   -- Runtime Function: unsigned long fract __fractudqusq2 (unsigned long
*************** returned result using either signed or u
*** 1785,1792 ****
            long fract A)
   -- Runtime Function: unsigned long long accum __fractudquta (unsigned
            long long fract A)
!  -- Runtime Function: signed char __fractudqqi (unsigned long long
!           fract A)
   -- Runtime Function: short __fractudqhi (unsigned long long fract A)
   -- Runtime Function: int __fractudqsi (unsigned long long fract A)
   -- Runtime Function: long __fractudqdi (unsigned long long fract A)
--- 1782,1789 ----
            long fract A)
   -- Runtime Function: unsigned long long accum __fractudquta (unsigned
            long long fract A)
!  -- Runtime Function: signed char __fractudqqi (unsigned long long fract
!           A)
   -- Runtime Function: short __fractudqhi (unsigned long long fract A)
   -- Runtime Function: int __fractudqsi (unsigned long long fract A)
   -- Runtime Function: long __fractudqdi (unsigned long long fract A)
*************** returned result using either signed or u
*** 1797,1821 ****
   -- Runtime Function: short fract __fractuhaqq (unsigned short accum A)
   -- Runtime Function: fract __fractuhahq (unsigned short accum A)
   -- Runtime Function: long fract __fractuhasq (unsigned short accum A)
!  -- Runtime Function: long long fract __fractuhadq (unsigned short
!           accum A)
   -- Runtime Function: short accum __fractuhaha (unsigned short accum A)
   -- Runtime Function: accum __fractuhasa (unsigned short accum A)
   -- Runtime Function: long accum __fractuhada (unsigned short accum A)
!  -- Runtime Function: long long accum __fractuhata (unsigned short
!           accum A)
!  -- Runtime Function: unsigned short fract __fractuhauqq (unsigned
!           short accum A)
!  -- Runtime Function: unsigned fract __fractuhauhq (unsigned short
            accum A)
   -- Runtime Function: unsigned long fract __fractuhausq (unsigned short
            accum A)
   -- Runtime Function: unsigned long long fract __fractuhaudq (unsigned
            short accum A)
   -- Runtime Function: unsigned accum __fractuhausa2 (unsigned short
            accum A)
!  -- Runtime Function: unsigned long accum __fractuhauda2 (unsigned
!           short accum A)
   -- Runtime Function: unsigned long long accum __fractuhauta2 (unsigned
            short accum A)
   -- Runtime Function: signed char __fractuhaqi (unsigned short accum A)
--- 1794,1818 ----
   -- Runtime Function: short fract __fractuhaqq (unsigned short accum A)
   -- Runtime Function: fract __fractuhahq (unsigned short accum A)
   -- Runtime Function: long fract __fractuhasq (unsigned short accum A)
!  -- Runtime Function: long long fract __fractuhadq (unsigned short accum
!           A)
   -- Runtime Function: short accum __fractuhaha (unsigned short accum A)
   -- Runtime Function: accum __fractuhasa (unsigned short accum A)
   -- Runtime Function: long accum __fractuhada (unsigned short accum A)
!  -- Runtime Function: long long accum __fractuhata (unsigned short accum
!           A)
!  -- Runtime Function: unsigned short fract __fractuhauqq (unsigned short
            accum A)
+  -- Runtime Function: unsigned fract __fractuhauhq (unsigned short accum
+           A)
   -- Runtime Function: unsigned long fract __fractuhausq (unsigned short
            accum A)
   -- Runtime Function: unsigned long long fract __fractuhaudq (unsigned
            short accum A)
   -- Runtime Function: unsigned accum __fractuhausa2 (unsigned short
            accum A)
!  -- Runtime Function: unsigned long accum __fractuhauda2 (unsigned short
!           accum A)
   -- Runtime Function: unsigned long long accum __fractuhauta2 (unsigned
            short accum A)
   -- Runtime Function: signed char __fractuhaqi (unsigned short accum A)
*************** returned result using either signed or u
*** 1833,1840 ****
   -- Runtime Function: accum __fractusasa (unsigned accum A)
   -- Runtime Function: long accum __fractusada (unsigned accum A)
   -- Runtime Function: long long accum __fractusata (unsigned accum A)
!  -- Runtime Function: unsigned short fract __fractusauqq (unsigned
!           accum A)
   -- Runtime Function: unsigned fract __fractusauhq (unsigned accum A)
   -- Runtime Function: unsigned long fract __fractusausq (unsigned accum
            A)
--- 1830,1837 ----
   -- Runtime Function: accum __fractusasa (unsigned accum A)
   -- Runtime Function: long accum __fractusada (unsigned accum A)
   -- Runtime Function: long long accum __fractusata (unsigned accum A)
!  -- Runtime Function: unsigned short fract __fractusauqq (unsigned accum
!           A)
   -- Runtime Function: unsigned fract __fractusauhq (unsigned accum A)
   -- Runtime Function: unsigned long fract __fractusausq (unsigned accum
            A)
*************** returned result using either signed or u
*** 1842,1849 ****
            accum A)
   -- Runtime Function: unsigned short accum __fractusauha2 (unsigned
            accum A)
!  -- Runtime Function: unsigned long accum __fractusauda2 (unsigned
!           accum A)
   -- Runtime Function: unsigned long long accum __fractusauta2 (unsigned
            accum A)
   -- Runtime Function: signed char __fractusaqi (unsigned accum A)
--- 1839,1846 ----
            accum A)
   -- Runtime Function: unsigned short accum __fractusauha2 (unsigned
            accum A)
!  -- Runtime Function: unsigned long accum __fractusauda2 (unsigned accum
!           A)
   -- Runtime Function: unsigned long long accum __fractusauta2 (unsigned
            accum A)
   -- Runtime Function: signed char __fractusaqi (unsigned accum A)
*************** returned result using either signed or u
*** 1871,1880 ****
            accum A)
   -- Runtime Function: unsigned long long fract __fractudaudq (unsigned
            long accum A)
!  -- Runtime Function: unsigned short accum __fractudauha2 (unsigned
!           long accum A)
!  -- Runtime Function: unsigned accum __fractudausa2 (unsigned long
            accum A)
   -- Runtime Function: unsigned long long accum __fractudauta2 (unsigned
            long accum A)
   -- Runtime Function: signed char __fractudaqi (unsigned long accum A)
--- 1868,1877 ----
            accum A)
   -- Runtime Function: unsigned long long fract __fractudaudq (unsigned
            long accum A)
!  -- Runtime Function: unsigned short accum __fractudauha2 (unsigned long
            accum A)
+  -- Runtime Function: unsigned accum __fractudausa2 (unsigned long accum
+           A)
   -- Runtime Function: unsigned long long accum __fractudauta2 (unsigned
            long accum A)
   -- Runtime Function: signed char __fractudaqi (unsigned long accum A)
*************** returned result using either signed or u
*** 1884,1898 ****
   -- Runtime Function: long long __fractudati (unsigned long accum A)
   -- Runtime Function: float __fractudasf (unsigned long accum A)
   -- Runtime Function: double __fractudadf (unsigned long accum A)
!  -- Runtime Function: short fract __fractutaqq (unsigned long long
!           accum A)
   -- Runtime Function: fract __fractutahq (unsigned long long accum A)
   -- Runtime Function: long fract __fractutasq (unsigned long long accum
            A)
   -- Runtime Function: long long fract __fractutadq (unsigned long long
            accum A)
!  -- Runtime Function: short accum __fractutaha (unsigned long long
!           accum A)
   -- Runtime Function: accum __fractutasa (unsigned long long accum A)
   -- Runtime Function: long accum __fractutada (unsigned long long accum
            A)
--- 1881,1895 ----
   -- Runtime Function: long long __fractudati (unsigned long accum A)
   -- Runtime Function: float __fractudasf (unsigned long accum A)
   -- Runtime Function: double __fractudadf (unsigned long accum A)
!  -- Runtime Function: short fract __fractutaqq (unsigned long long accum
!           A)
   -- Runtime Function: fract __fractutahq (unsigned long long accum A)
   -- Runtime Function: long fract __fractutasq (unsigned long long accum
            A)
   -- Runtime Function: long long fract __fractutadq (unsigned long long
            accum A)
!  -- Runtime Function: short accum __fractutaha (unsigned long long accum
!           A)
   -- Runtime Function: accum __fractutasa (unsigned long long accum A)
   -- Runtime Function: long accum __fractutada (unsigned long long accum
            A)
*************** returned result using either signed or u
*** 1906,1919 ****
            long accum A)
   -- Runtime Function: unsigned long long fract __fractutaudq (unsigned
            long long accum A)
!  -- Runtime Function: unsigned short accum __fractutauha2 (unsigned
!           long long accum A)
   -- Runtime Function: unsigned accum __fractutausa2 (unsigned long long
            accum A)
   -- Runtime Function: unsigned long accum __fractutauda2 (unsigned long
            long accum A)
!  -- Runtime Function: signed char __fractutaqi (unsigned long long
!           accum A)
   -- Runtime Function: short __fractutahi (unsigned long long accum A)
   -- Runtime Function: int __fractutasi (unsigned long long accum A)
   -- Runtime Function: long __fractutadi (unsigned long long accum A)
--- 1903,1916 ----
            long accum A)
   -- Runtime Function: unsigned long long fract __fractutaudq (unsigned
            long long accum A)
!  -- Runtime Function: unsigned short accum __fractutauha2 (unsigned long
!           long accum A)
   -- Runtime Function: unsigned accum __fractutausa2 (unsigned long long
            accum A)
   -- Runtime Function: unsigned long accum __fractutauda2 (unsigned long
            long accum A)
!  -- Runtime Function: signed char __fractutaqi (unsigned long long accum
!           A)
   -- Runtime Function: short __fractutahi (unsigned long long accum A)
   -- Runtime Function: int __fractutasi (unsigned long long accum A)
   -- Runtime Function: long __fractutadi (unsigned long long accum A)
*************** returned result using either signed or u
*** 1932,1944 ****
   -- Runtime Function: unsigned short fract __fractqiuqq (signed char A)
   -- Runtime Function: unsigned fract __fractqiuhq (signed char A)
   -- Runtime Function: unsigned long fract __fractqiusq (signed char A)
!  -- Runtime Function: unsigned long long fract __fractqiudq (signed
!           char A)
   -- Runtime Function: unsigned short accum __fractqiuha (signed char A)
   -- Runtime Function: unsigned accum __fractqiusa (signed char A)
   -- Runtime Function: unsigned long accum __fractqiuda (signed char A)
!  -- Runtime Function: unsigned long long accum __fractqiuta (signed
!           char A)
   -- Runtime Function: short fract __fracthiqq (short A)
   -- Runtime Function: fract __fracthihq (short A)
   -- Runtime Function: long fract __fracthisq (short A)
--- 1929,1941 ----
   -- Runtime Function: unsigned short fract __fractqiuqq (signed char A)
   -- Runtime Function: unsigned fract __fractqiuhq (signed char A)
   -- Runtime Function: unsigned long fract __fractqiusq (signed char A)
!  -- Runtime Function: unsigned long long fract __fractqiudq (signed char
!           A)
   -- Runtime Function: unsigned short accum __fractqiuha (signed char A)
   -- Runtime Function: unsigned accum __fractqiusa (signed char A)
   -- Runtime Function: unsigned long accum __fractqiuda (signed char A)
!  -- Runtime Function: unsigned long long accum __fractqiuta (signed char
!           A)
   -- Runtime Function: short fract __fracthiqq (short A)
   -- Runtime Function: fract __fracthihq (short A)
   -- Runtime Function: long fract __fracthisq (short A)
*************** returned result using either signed or u
*** 2542,2549 ****
   -- Runtime Function: unsigned short __fractunsdqhi (long long fract A)
   -- Runtime Function: unsigned int __fractunsdqsi (long long fract A)
   -- Runtime Function: unsigned long __fractunsdqdi (long long fract A)
!  -- Runtime Function: unsigned long long __fractunsdqti (long long
!           fract A)
   -- Runtime Function: unsigned char __fractunshaqi (short accum A)
   -- Runtime Function: unsigned short __fractunshahi (short accum A)
   -- Runtime Function: unsigned int __fractunshasi (short accum A)
--- 2539,2546 ----
   -- Runtime Function: unsigned short __fractunsdqhi (long long fract A)
   -- Runtime Function: unsigned int __fractunsdqsi (long long fract A)
   -- Runtime Function: unsigned long __fractunsdqdi (long long fract A)
!  -- Runtime Function: unsigned long long __fractunsdqti (long long fract
!           A)
   -- Runtime Function: unsigned char __fractunshaqi (short accum A)
   -- Runtime Function: unsigned short __fractunshahi (short accum A)
   -- Runtime Function: unsigned int __fractunshasi (short accum A)
*************** returned result using either signed or u
*** 2563,2600 ****
   -- Runtime Function: unsigned short __fractunstahi (long long accum A)
   -- Runtime Function: unsigned int __fractunstasi (long long accum A)
   -- Runtime Function: unsigned long __fractunstadi (long long accum A)
!  -- Runtime Function: unsigned long long __fractunstati (long long
!           accum A)
   -- Runtime Function: unsigned char __fractunsuqqqi (unsigned short
            fract A)
   -- Runtime Function: unsigned short __fractunsuqqhi (unsigned short
            fract A)
!  -- Runtime Function: unsigned int __fractunsuqqsi (unsigned short
!           fract A)
   -- Runtime Function: unsigned long __fractunsuqqdi (unsigned short
            fract A)
!  -- Runtime Function: unsigned long long __fractunsuqqti (unsigned
!           short fract A)
   -- Runtime Function: unsigned char __fractunsuhqqi (unsigned fract A)
   -- Runtime Function: unsigned short __fractunsuhqhi (unsigned fract A)
   -- Runtime Function: unsigned int __fractunsuhqsi (unsigned fract A)
   -- Runtime Function: unsigned long __fractunsuhqdi (unsigned fract A)
!  -- Runtime Function: unsigned long long __fractunsuhqti (unsigned
!           fract A)
!  -- Runtime Function: unsigned char __fractunsusqqi (unsigned long
!           fract A)
   -- Runtime Function: unsigned short __fractunsusqhi (unsigned long
            fract A)
   -- Runtime Function: unsigned int __fractunsusqsi (unsigned long fract
            A)
!  -- Runtime Function: unsigned long __fractunsusqdi (unsigned long
!           fract A)
   -- Runtime Function: unsigned long long __fractunsusqti (unsigned long
            fract A)
   -- Runtime Function: unsigned char __fractunsudqqi (unsigned long long
            fract A)
!  -- Runtime Function: unsigned short __fractunsudqhi (unsigned long
!           long fract A)
   -- Runtime Function: unsigned int __fractunsudqsi (unsigned long long
            fract A)
   -- Runtime Function: unsigned long __fractunsudqdi (unsigned long long
--- 2560,2597 ----
   -- Runtime Function: unsigned short __fractunstahi (long long accum A)
   -- Runtime Function: unsigned int __fractunstasi (long long accum A)
   -- Runtime Function: unsigned long __fractunstadi (long long accum A)
!  -- Runtime Function: unsigned long long __fractunstati (long long accum
!           A)
   -- Runtime Function: unsigned char __fractunsuqqqi (unsigned short
            fract A)
   -- Runtime Function: unsigned short __fractunsuqqhi (unsigned short
            fract A)
!  -- Runtime Function: unsigned int __fractunsuqqsi (unsigned short fract
!           A)
   -- Runtime Function: unsigned long __fractunsuqqdi (unsigned short
            fract A)
!  -- Runtime Function: unsigned long long __fractunsuqqti (unsigned short
!           fract A)
   -- Runtime Function: unsigned char __fractunsuhqqi (unsigned fract A)
   -- Runtime Function: unsigned short __fractunsuhqhi (unsigned fract A)
   -- Runtime Function: unsigned int __fractunsuhqsi (unsigned fract A)
   -- Runtime Function: unsigned long __fractunsuhqdi (unsigned fract A)
!  -- Runtime Function: unsigned long long __fractunsuhqti (unsigned fract
!           A)
!  -- Runtime Function: unsigned char __fractunsusqqi (unsigned long fract
!           A)
   -- Runtime Function: unsigned short __fractunsusqhi (unsigned long
            fract A)
   -- Runtime Function: unsigned int __fractunsusqsi (unsigned long fract
            A)
!  -- Runtime Function: unsigned long __fractunsusqdi (unsigned long fract
!           A)
   -- Runtime Function: unsigned long long __fractunsusqti (unsigned long
            fract A)
   -- Runtime Function: unsigned char __fractunsudqqi (unsigned long long
            fract A)
!  -- Runtime Function: unsigned short __fractunsudqhi (unsigned long long
!           fract A)
   -- Runtime Function: unsigned int __fractunsudqsi (unsigned long long
            fract A)
   -- Runtime Function: unsigned long __fractunsudqdi (unsigned long long
*************** returned result using either signed or u
*** 2605,2636 ****
            accum A)
   -- Runtime Function: unsigned short __fractunsuhahi (unsigned short
            accum A)
!  -- Runtime Function: unsigned int __fractunsuhasi (unsigned short
!           accum A)
   -- Runtime Function: unsigned long __fractunsuhadi (unsigned short
            accum A)
!  -- Runtime Function: unsigned long long __fractunsuhati (unsigned
!           short accum A)
   -- Runtime Function: unsigned char __fractunsusaqi (unsigned accum A)
   -- Runtime Function: unsigned short __fractunsusahi (unsigned accum A)
   -- Runtime Function: unsigned int __fractunsusasi (unsigned accum A)
   -- Runtime Function: unsigned long __fractunsusadi (unsigned accum A)
!  -- Runtime Function: unsigned long long __fractunsusati (unsigned
!           accum A)
!  -- Runtime Function: unsigned char __fractunsudaqi (unsigned long
!           accum A)
   -- Runtime Function: unsigned short __fractunsudahi (unsigned long
            accum A)
   -- Runtime Function: unsigned int __fractunsudasi (unsigned long accum
            A)
!  -- Runtime Function: unsigned long __fractunsudadi (unsigned long
!           accum A)
   -- Runtime Function: unsigned long long __fractunsudati (unsigned long
            accum A)
   -- Runtime Function: unsigned char __fractunsutaqi (unsigned long long
            accum A)
!  -- Runtime Function: unsigned short __fractunsutahi (unsigned long
!           long accum A)
   -- Runtime Function: unsigned int __fractunsutasi (unsigned long long
            accum A)
   -- Runtime Function: unsigned long __fractunsutadi (unsigned long long
--- 2602,2633 ----
            accum A)
   -- Runtime Function: unsigned short __fractunsuhahi (unsigned short
            accum A)
!  -- Runtime Function: unsigned int __fractunsuhasi (unsigned short accum
!           A)
   -- Runtime Function: unsigned long __fractunsuhadi (unsigned short
            accum A)
!  -- Runtime Function: unsigned long long __fractunsuhati (unsigned short
!           accum A)
   -- Runtime Function: unsigned char __fractunsusaqi (unsigned accum A)
   -- Runtime Function: unsigned short __fractunsusahi (unsigned accum A)
   -- Runtime Function: unsigned int __fractunsusasi (unsigned accum A)
   -- Runtime Function: unsigned long __fractunsusadi (unsigned accum A)
!  -- Runtime Function: unsigned long long __fractunsusati (unsigned accum
!           A)
!  -- Runtime Function: unsigned char __fractunsudaqi (unsigned long accum
!           A)
   -- Runtime Function: unsigned short __fractunsudahi (unsigned long
            accum A)
   -- Runtime Function: unsigned int __fractunsudasi (unsigned long accum
            A)
!  -- Runtime Function: unsigned long __fractunsudadi (unsigned long accum
!           A)
   -- Runtime Function: unsigned long long __fractunsudati (unsigned long
            accum A)
   -- Runtime Function: unsigned char __fractunsutaqi (unsigned long long
            accum A)
!  -- Runtime Function: unsigned short __fractunsutahi (unsigned long long
!           accum A)
   -- Runtime Function: unsigned int __fractunsutasi (unsigned long long
            accum A)
   -- Runtime Function: unsigned long __fractunsutadi (unsigned long long
*************** returned result using either signed or u
*** 2648,2664 ****
   -- Runtime Function: unsigned short fract __fractunsqiuqq (unsigned
            char A)
   -- Runtime Function: unsigned fract __fractunsqiuhq (unsigned char A)
!  -- Runtime Function: unsigned long fract __fractunsqiusq (unsigned
            char A)
-  -- Runtime Function: unsigned long long fract __fractunsqiudq
-           (unsigned char A)
   -- Runtime Function: unsigned short accum __fractunsqiuha (unsigned
            char A)
   -- Runtime Function: unsigned accum __fractunsqiusa (unsigned char A)
!  -- Runtime Function: unsigned long accum __fractunsqiuda (unsigned
            char A)
-  -- Runtime Function: unsigned long long accum __fractunsqiuta
-           (unsigned char A)
   -- Runtime Function: short fract __fractunshiqq (unsigned short A)
   -- Runtime Function: fract __fractunshihq (unsigned short A)
   -- Runtime Function: long fract __fractunshisq (unsigned short A)
--- 2645,2661 ----
   -- Runtime Function: unsigned short fract __fractunsqiuqq (unsigned
            char A)
   -- Runtime Function: unsigned fract __fractunsqiuhq (unsigned char A)
!  -- Runtime Function: unsigned long fract __fractunsqiusq (unsigned char
!           A)
!  -- Runtime Function: unsigned long long fract __fractunsqiudq (unsigned
            char A)
   -- Runtime Function: unsigned short accum __fractunsqiuha (unsigned
            char A)
   -- Runtime Function: unsigned accum __fractunsqiusa (unsigned char A)
!  -- Runtime Function: unsigned long accum __fractunsqiuda (unsigned char
!           A)
!  -- Runtime Function: unsigned long long accum __fractunsqiuta (unsigned
            char A)
   -- Runtime Function: short fract __fractunshiqq (unsigned short A)
   -- Runtime Function: fract __fractunshihq (unsigned short A)
   -- Runtime Function: long fract __fractunshisq (unsigned short A)
*************** returned result using either signed or u
*** 2672,2686 ****
   -- Runtime Function: unsigned fract __fractunshiuhq (unsigned short A)
   -- Runtime Function: unsigned long fract __fractunshiusq (unsigned
            short A)
!  -- Runtime Function: unsigned long long fract __fractunshiudq
!           (unsigned short A)
   -- Runtime Function: unsigned short accum __fractunshiuha (unsigned
            short A)
   -- Runtime Function: unsigned accum __fractunshiusa (unsigned short A)
   -- Runtime Function: unsigned long accum __fractunshiuda (unsigned
            short A)
!  -- Runtime Function: unsigned long long accum __fractunshiuta
!           (unsigned short A)
   -- Runtime Function: short fract __fractunssiqq (unsigned int A)
   -- Runtime Function: fract __fractunssihq (unsigned int A)
   -- Runtime Function: long fract __fractunssisq (unsigned int A)
--- 2669,2683 ----
   -- Runtime Function: unsigned fract __fractunshiuhq (unsigned short A)
   -- Runtime Function: unsigned long fract __fractunshiusq (unsigned
            short A)
!  -- Runtime Function: unsigned long long fract __fractunshiudq (unsigned
!           short A)
   -- Runtime Function: unsigned short accum __fractunshiuha (unsigned
            short A)
   -- Runtime Function: unsigned accum __fractunshiusa (unsigned short A)
   -- Runtime Function: unsigned long accum __fractunshiuda (unsigned
            short A)
!  -- Runtime Function: unsigned long long accum __fractunshiuta (unsigned
!           short A)
   -- Runtime Function: short fract __fractunssiqq (unsigned int A)
   -- Runtime Function: fract __fractunssihq (unsigned int A)
   -- Runtime Function: long fract __fractunssisq (unsigned int A)
*************** returned result using either signed or u
*** 2689,2708 ****
   -- Runtime Function: accum __fractunssisa (unsigned int A)
   -- Runtime Function: long accum __fractunssida (unsigned int A)
   -- Runtime Function: long long accum __fractunssita (unsigned int A)
!  -- Runtime Function: unsigned short fract __fractunssiuqq (unsigned
!           int A)
   -- Runtime Function: unsigned fract __fractunssiuhq (unsigned int A)
   -- Runtime Function: unsigned long fract __fractunssiusq (unsigned int
            A)
!  -- Runtime Function: unsigned long long fract __fractunssiudq
!           (unsigned int A)
!  -- Runtime Function: unsigned short accum __fractunssiuha (unsigned
            int A)
   -- Runtime Function: unsigned accum __fractunssiusa (unsigned int A)
   -- Runtime Function: unsigned long accum __fractunssiuda (unsigned int
            A)
!  -- Runtime Function: unsigned long long accum __fractunssiuta
!           (unsigned int A)
   -- Runtime Function: short fract __fractunsdiqq (unsigned long A)
   -- Runtime Function: fract __fractunsdihq (unsigned long A)
   -- Runtime Function: long fract __fractunsdisq (unsigned long A)
--- 2686,2705 ----
   -- Runtime Function: accum __fractunssisa (unsigned int A)
   -- Runtime Function: long accum __fractunssida (unsigned int A)
   -- Runtime Function: long long accum __fractunssita (unsigned int A)
!  -- Runtime Function: unsigned short fract __fractunssiuqq (unsigned int
!           A)
   -- Runtime Function: unsigned fract __fractunssiuhq (unsigned int A)
   -- Runtime Function: unsigned long fract __fractunssiusq (unsigned int
            A)
!  -- Runtime Function: unsigned long long fract __fractunssiudq (unsigned
            int A)
+  -- Runtime Function: unsigned short accum __fractunssiuha (unsigned int
+           A)
   -- Runtime Function: unsigned accum __fractunssiusa (unsigned int A)
   -- Runtime Function: unsigned long accum __fractunssiuda (unsigned int
            A)
!  -- Runtime Function: unsigned long long accum __fractunssiuta (unsigned
!           int A)
   -- Runtime Function: short fract __fractunsdiqq (unsigned long A)
   -- Runtime Function: fract __fractunsdihq (unsigned long A)
   -- Runtime Function: long fract __fractunsdisq (unsigned long A)
*************** returned result using either signed or u
*** 2714,2756 ****
   -- Runtime Function: unsigned short fract __fractunsdiuqq (unsigned
            long A)
   -- Runtime Function: unsigned fract __fractunsdiuhq (unsigned long A)
!  -- Runtime Function: unsigned long fract __fractunsdiusq (unsigned
            long A)
-  -- Runtime Function: unsigned long long fract __fractunsdiudq
-           (unsigned long A)
   -- Runtime Function: unsigned short accum __fractunsdiuha (unsigned
            long A)
   -- Runtime Function: unsigned accum __fractunsdiusa (unsigned long A)
!  -- Runtime Function: unsigned long accum __fractunsdiuda (unsigned
            long A)
-  -- Runtime Function: unsigned long long accum __fractunsdiuta
-           (unsigned long A)
   -- Runtime Function: short fract __fractunstiqq (unsigned long long A)
   -- Runtime Function: fract __fractunstihq (unsigned long long A)
   -- Runtime Function: long fract __fractunstisq (unsigned long long A)
!  -- Runtime Function: long long fract __fractunstidq (unsigned long
!           long A)
   -- Runtime Function: short accum __fractunstiha (unsigned long long A)
   -- Runtime Function: accum __fractunstisa (unsigned long long A)
   -- Runtime Function: long accum __fractunstida (unsigned long long A)
!  -- Runtime Function: long long accum __fractunstita (unsigned long
!           long A)
   -- Runtime Function: unsigned short fract __fractunstiuqq (unsigned
            long long A)
!  -- Runtime Function: unsigned fract __fractunstiuhq (unsigned long
            long A)
!  -- Runtime Function: unsigned long fract __fractunstiusq (unsigned
            long long A)
-  -- Runtime Function: unsigned long long fract __fractunstiudq
-           (unsigned long long A)
   -- Runtime Function: unsigned short accum __fractunstiuha (unsigned
            long long A)
!  -- Runtime Function: unsigned accum __fractunstiusa (unsigned long
            long A)
!  -- Runtime Function: unsigned long accum __fractunstiuda (unsigned
            long long A)
-  -- Runtime Function: unsigned long long accum __fractunstiuta
-           (unsigned long long A)
       These functions convert from fractionals to unsigned
       non-fractionals; and from unsigned non-fractionals to fractionals,
       without saturation.
--- 2711,2753 ----
   -- Runtime Function: unsigned short fract __fractunsdiuqq (unsigned
            long A)
   -- Runtime Function: unsigned fract __fractunsdiuhq (unsigned long A)
!  -- Runtime Function: unsigned long fract __fractunsdiusq (unsigned long
!           A)
!  -- Runtime Function: unsigned long long fract __fractunsdiudq (unsigned
            long A)
   -- Runtime Function: unsigned short accum __fractunsdiuha (unsigned
            long A)
   -- Runtime Function: unsigned accum __fractunsdiusa (unsigned long A)
!  -- Runtime Function: unsigned long accum __fractunsdiuda (unsigned long
!           A)
!  -- Runtime Function: unsigned long long accum __fractunsdiuta (unsigned
            long A)
   -- Runtime Function: short fract __fractunstiqq (unsigned long long A)
   -- Runtime Function: fract __fractunstihq (unsigned long long A)
   -- Runtime Function: long fract __fractunstisq (unsigned long long A)
!  -- Runtime Function: long long fract __fractunstidq (unsigned long long
!           A)
   -- Runtime Function: short accum __fractunstiha (unsigned long long A)
   -- Runtime Function: accum __fractunstisa (unsigned long long A)
   -- Runtime Function: long accum __fractunstida (unsigned long long A)
!  -- Runtime Function: long long accum __fractunstita (unsigned long long
!           A)
   -- Runtime Function: unsigned short fract __fractunstiuqq (unsigned
            long long A)
!  -- Runtime Function: unsigned fract __fractunstiuhq (unsigned long long
!           A)
!  -- Runtime Function: unsigned long fract __fractunstiusq (unsigned long
            long A)
!  -- Runtime Function: unsigned long long fract __fractunstiudq (unsigned
            long long A)
   -- Runtime Function: unsigned short accum __fractunstiuha (unsigned
            long long A)
!  -- Runtime Function: unsigned accum __fractunstiusa (unsigned long long
!           A)
!  -- Runtime Function: unsigned long accum __fractunstiuda (unsigned long
            long A)
!  -- Runtime Function: unsigned long long accum __fractunstiuta (unsigned
            long long A)
       These functions convert from fractionals to unsigned
       non-fractionals; and from unsigned non-fractionals to fractionals,
       without saturation.
*************** File: gccint.info,  Node: Miscellaneous
*** 2943,2949 ****
   -- Runtime Function: void * __splitstack_find (void *SEGMENT_ARG, void
            *SP, size_t LEN, void **NEXT_SEGMENT, void **NEXT_SP, void
            **INITIAL_SP)
!      When using `-fsplit-stack', this call may be used to iterate over
       the stack segments.  It may be called like this:
              void *next_segment = NULL;
              void *next_sp = NULL;
--- 2940,2946 ----
   -- Runtime Function: void * __splitstack_find (void *SEGMENT_ARG, void
            *SP, size_t LEN, void **NEXT_SEGMENT, void **NEXT_SP, void
            **INITIAL_SP)
!      When using '-fsplit-stack', this call may be used to iterate over
       the stack segments.  It may be called like this:
              void *next_segment = NULL;
              void *next_sp = NULL;
*************** File: gccint.info,  Node: Miscellaneous
*** 2964,2978 ****
       with the SEGMENT_ARG and SP arguments NULL, to pass NEXT_SEGMENT,
       NEXT_SP, and INITIAL_SP to a different thread, and then to suspend
       one way or another.  A different thread may run the subsequent
!      `__splitstack_find' iterations.  Of course, this will only work if
       the first thread is suspended while the second thread is calling
!      `__splitstack_find'.  If not, the second thread could be looking
!      at the stack while it is changing, and anything could happen.
  
   -- Variable: __morestack_segments
   -- Variable: __morestack_current_segment
   -- Variable: __morestack_initial_sp
!      Internal variables used by the `-fsplit-stack' implementation.
  
  
  File: gccint.info,  Node: Languages,  Next: Source Tree,  Prev: Libgcc,  Up: Top
--- 2961,2975 ----
       with the SEGMENT_ARG and SP arguments NULL, to pass NEXT_SEGMENT,
       NEXT_SP, and INITIAL_SP to a different thread, and then to suspend
       one way or another.  A different thread may run the subsequent
!      '__splitstack_find' iterations.  Of course, this will only work if
       the first thread is suspended while the second thread is calling
!      '__splitstack_find'.  If not, the second thread could be looking at
!      the stack while it is changing, and anything could happen.
  
   -- Variable: __morestack_segments
   -- Variable: __morestack_current_segment
   -- Variable: __morestack_initial_sp
!      Internal variables used by the '-fsplit-stack' implementation.
  
  
  File: gccint.info,  Node: Languages,  Next: Source Tree,  Prev: Libgcc,  Up: Top
*************** File: gccint.info,  Node: Languages,  Ne
*** 2981,2987 ****
  ****************************
  
  The interface to front ends for languages in GCC, and in particular the
! `tree' structure (*note GENERIC::), was initially designed for C, and
  many aspects of it are still somewhat biased towards C and C-like
  languages.  It is, however, reasonably well suited to other procedural
  languages, and front ends for many such languages have been written for
--- 2978,2984 ----
  ****************************
  
  The interface to front ends for languages in GCC, and in particular the
! 'tree' structure (*note GENERIC::), was initially designed for C, and
  many aspects of it are still somewhat biased towards C and C-like
  languages.  It is, however, reasonably well suited to other procedural
  languages, and front ends for many such languages have been written for
*************** GCC, has several advantages:
*** 2993,3009 ****
  
     * GCC front ends benefit from the support for many different target
       machines already present in GCC.
- 
     * GCC front ends benefit from all the optimizations in GCC.  Some of
       these, such as alias analysis, may work better when GCC is
       compiling directly from source code then when it is compiling from
       generated C code.
- 
     * Better debugging information is generated when compiling directly
       from source code than when going via intermediate generated C code.
  
!  Because of the advantages of writing a compiler as a GCC front end,
! GCC front ends have also been created for languages very different from
  those for which GCC was designed, such as the declarative
  logic/functional language Mercury.  For these reasons, it may also be
  useful to implement compilers created for specialized purposes (for
--- 2990,3004 ----
  
     * GCC front ends benefit from the support for many different target
       machines already present in GCC.
     * GCC front ends benefit from all the optimizations in GCC.  Some of
       these, such as alias analysis, may work better when GCC is
       compiling directly from source code then when it is compiling from
       generated C code.
     * Better debugging information is generated when compiling directly
       from source code than when going via intermediate generated C code.
  
!  Because of the advantages of writing a compiler as a GCC front end, GCC
! front ends have also been created for languages very different from
  those for which GCC was designed, such as the declarative
  logic/functional language Mercury.  For these reasons, it may also be
  useful to implement compilers created for specialized purposes (for
*************** File: gccint.info,  Node: Source Tree,
*** 3015,3030 ****
  6 Source Tree Structure and Build System
  ****************************************
  
! This chapter describes the structure of the GCC source tree, and how
! GCC is built.  The user documentation for building and installing GCC
! is in a separate manual (`http://gcc.gnu.org/install/'), with which it
! is presumed that you are familiar.
  
  * Menu:
  
  * Configure Terms:: Configuration terminology and history.
  * Top Level::       The top level source directory.
! * gcc Directory::   The `gcc' subdirectory.
  
  
  File: gccint.info,  Node: Configure Terms,  Next: Top Level,  Up: Source Tree
--- 3010,3025 ----
  6 Source Tree Structure and Build System
  ****************************************
  
! This chapter describes the structure of the GCC source tree, and how GCC
! is built.  The user documentation for building and installing GCC is in
! a separate manual (<http://gcc.gnu.org/install/>), with which it is
! presumed that you are familiar.
  
  * Menu:
  
  * Configure Terms:: Configuration terminology and history.
  * Top Level::       The top level source directory.
! * gcc Directory::   The 'gcc' subdirectory.
  
  
  File: gccint.info,  Node: Configure Terms,  Next: Top Level,  Up: Source Tree
*************** know.
*** 3041,3087 ****
   There are three system names that the build knows about: the machine
  you are building on ("build"), the machine that you are building for
  ("host"), and the machine that GCC will produce code for ("target").
! When you configure GCC, you specify these with `--build=', `--host=',
! and `--target='.
  
   Specifying the host without specifying the build should be avoided, as
! `configure' may (and once did) assume that the host you specify is also
  the build, which may not be true.
  
!  If build, host, and target are all the same, this is called a
! "native".  If build and host are the same but target is different, this
! is called a "cross".  If build, host, and target are all different this
! is called a "canadian" (for obscure reasons dealing with Canada's
! political party and the background of the person working on the build
! at that time).  If host and target are the same, but build is
! different, you are using a cross-compiler to build a native for a
! different system.  Some people call this a "host-x-host", "crossed
! native", or "cross-built native".  If build and target are the same,
! but host is different, you are using a cross compiler to build a cross
! compiler that produces code for the machine you're building on.  This
! is rare, so there is no common way of describing it.  There is a
! proposal to call this a "crossback".
  
   If build and host are the same, the GCC you are building will also be
! used to build the target libraries (like `libstdc++').  If build and
  host are different, you must have already built and installed a cross
  compiler that will be used to build the target libraries (if you
! configured with `--target=foo-bar', this compiler will be called
! `foo-bar-gcc').
  
   In the case of target libraries, the machine you're building for is the
! machine you specified with `--target'.  So, build is the machine you're
  building on (no change there), host is the machine you're building for
  (the target libraries are built for the target, so host is the target
  you specified), and target doesn't apply (because you're not building a
  compiler, you're building libraries).  The configure/make process will
! adjust these variables as needed.  It also sets `$with_cross_host' to
! the original `--host' value in case you need it.
  
!  The `libiberty' support library is built up to three times: once for
  the host, once for the target (even if they are the same), and once for
! the build if build and host are different.  This allows it to be used
! by all programs which are generated in the course of the build process.
  
  
  File: gccint.info,  Node: Top Level,  Next: gcc Directory,  Prev: Configure Terms,  Up: Source Tree
--- 3036,3081 ----
   There are three system names that the build knows about: the machine
  you are building on ("build"), the machine that you are building for
  ("host"), and the machine that GCC will produce code for ("target").
! When you configure GCC, you specify these with '--build=', '--host=',
! and '--target='.
  
   Specifying the host without specifying the build should be avoided, as
! 'configure' may (and once did) assume that the host you specify is also
  the build, which may not be true.
  
!  If build, host, and target are all the same, this is called a "native".
! If build and host are the same but target is different, this is called a
! "cross".  If build, host, and target are all different this is called a
! "canadian" (for obscure reasons dealing with Canada's political party
! and the background of the person working on the build at that time).  If
! host and target are the same, but build is different, you are using a
! cross-compiler to build a native for a different system.  Some people
! call this a "host-x-host", "crossed native", or "cross-built native".
! If build and target are the same, but host is different, you are using a
! cross compiler to build a cross compiler that produces code for the
! machine you're building on.  This is rare, so there is no common way of
! describing it.  There is a proposal to call this a "crossback".
  
   If build and host are the same, the GCC you are building will also be
! used to build the target libraries (like 'libstdc++').  If build and
  host are different, you must have already built and installed a cross
  compiler that will be used to build the target libraries (if you
! configured with '--target=foo-bar', this compiler will be called
! 'foo-bar-gcc').
  
   In the case of target libraries, the machine you're building for is the
! machine you specified with '--target'.  So, build is the machine you're
  building on (no change there), host is the machine you're building for
  (the target libraries are built for the target, so host is the target
  you specified), and target doesn't apply (because you're not building a
  compiler, you're building libraries).  The configure/make process will
! adjust these variables as needed.  It also sets '$with_cross_host' to
! the original '--host' value in case you need it.
  
!  The 'libiberty' support library is built up to three times: once for
  the host, once for the target (even if they are the same), and once for
! the build if build and host are different.  This allows it to be used by
! all programs which are generated in the course of the build process.
  
  
  File: gccint.info,  Node: Top Level,  Next: gcc Directory,  Prev: Configure Terms,  Up: Source Tree
*************** files and directories that are shared wi
*** 3094,3223 ****
  such as that of GNU Binutils.  It also contains several subdirectories
  that contain parts of GCC and its runtime libraries:
  
! `boehm-gc'
       The Boehm conservative garbage collector, used as part of the Java
       runtime library.
  
! `config'
       Autoconf macros and Makefile fragments used throughout the tree.
  
! `contrib'
       Contributed scripts that may be found useful in conjunction with
!      GCC.  One of these, `contrib/texi2pod.pl', is used to generate man
       pages from Texinfo manuals as part of the GCC build process.
  
! `fixincludes'
       The support for fixing system headers to work with GCC.  See
!      `fixincludes/README' for more information.  The headers fixed by
!      this mechanism are installed in `LIBSUBDIR/include-fixed'.  Along
!      with those headers, `README-fixinc' is also installed, as
!      `LIBSUBDIR/include-fixed/README'.
  
! `gcc'
       The main sources of GCC itself (except for runtime libraries),
       including optimizers, support for different target architectures,
!      language front ends, and testsuites.  *Note The `gcc'
!      Subdirectory: gcc Directory, for details.
  
! `gnattools'
       Support tools for GNAT.
  
! `include'
!      Headers for the `libiberty' library.
  
! `intl'
!      GNU `libintl', from GNU `gettext', for systems which do not
!      include it in `libc'.
  
! `libada'
       The Ada runtime library.
  
! `libatomic'
!      The runtime support library for atomic operations (e.g. for
!      `__sync' and `__atomic').
  
! `libcpp'
       The C preprocessor library.
  
! `libdecnumber'
       The Decimal Float support library.
  
! `libffi'
!      The `libffi' library, used as part of the Java runtime library.
  
! `libgcc'
       The GCC runtime library.
  
! `libgfortran'
       The Fortran runtime library.
  
! `libgo'
       The Go runtime library.  The bulk of this library is mirrored from
       the master Go repository (http://code.google.com/p/go/).
  
! `libgomp'
       The GNU Offloading and Multi Processing Runtime Library.
  
! `libiberty'
!      The `libiberty' library, used for portability and for some
       generally useful data structures and algorithms.  *Note
       Introduction: (libiberty)Top, for more information about this
       library.
  
! `libitm'
       The runtime support library for transactional memory.
  
! `libjava'
       The Java runtime library.
  
! `libobjc'
       The Objective-C and Objective-C++ runtime library.
  
! `libquadmath'
       The runtime support library for quad-precision math operations.
  
! `libssp'
       The Stack protector runtime library.
  
! `libstdc++-v3'
       The C++ runtime library.
  
! `lto-plugin'
       Plugin used by the linker if link-time optimizations are enabled.
  
! `maintainer-scripts'
!      Scripts used by the `gccadmin' account on `gcc.gnu.org'.
  
! `zlib'
!      The `zlib' compression library, used by the Java front end, as
!      part of the Java runtime library, and for compressing and
!      uncompressing GCC's intermediate language in LTO object files.
  
   The build system in the top level directory, including how recursion
  into subdirectories works and how building runtime libraries for
  multilibs is handled, is documented in a separate manual, included with
! GNU Binutils.  *Note GNU configure and build system: (configure)Top,
! for details.
  
  
  File: gccint.info,  Node: gcc Directory,  Prev: Top Level,  Up: Source Tree
  
! 6.3 The `gcc' Subdirectory
  ==========================
  
! The `gcc' directory contains many files that are part of the C sources
! of GCC, other files used as part of the configuration and build
! process, and subdirectories including documentation and a testsuite.
! The files that are sources of GCC are documented in a separate chapter.
! *Note Passes and Files of the Compiler: Passes.
  
  * Menu:
  
! * Subdirectories:: Subdirectories of `gcc'.
  * Configuration::  The configuration process, and the files it uses.
! * Build::          The build system in the `gcc' directory.
! * Makefile::       Targets in `gcc/Makefile'.
! * Library Files::  Library source files and headers under `gcc/'.
  * Headers::        Headers installed by GCC.
  * Documentation::  Building documentation in GCC.
  * Front End::      Anatomy of a language front end.
--- 3088,3217 ----
  such as that of GNU Binutils.  It also contains several subdirectories
  that contain parts of GCC and its runtime libraries:
  
! 'boehm-gc'
       The Boehm conservative garbage collector, used as part of the Java
       runtime library.
  
! 'config'
       Autoconf macros and Makefile fragments used throughout the tree.
  
! 'contrib'
       Contributed scripts that may be found useful in conjunction with
!      GCC.  One of these, 'contrib/texi2pod.pl', is used to generate man
       pages from Texinfo manuals as part of the GCC build process.
  
! 'fixincludes'
       The support for fixing system headers to work with GCC.  See
!      'fixincludes/README' for more information.  The headers fixed by
!      this mechanism are installed in 'LIBSUBDIR/include-fixed'.  Along
!      with those headers, 'README-fixinc' is also installed, as
!      'LIBSUBDIR/include-fixed/README'.
  
! 'gcc'
       The main sources of GCC itself (except for runtime libraries),
       including optimizers, support for different target architectures,
!      language front ends, and testsuites.  *Note The 'gcc' Subdirectory:
!      gcc Directory, for details.
  
! 'gnattools'
       Support tools for GNAT.
  
! 'include'
!      Headers for the 'libiberty' library.
  
! 'intl'
!      GNU 'libintl', from GNU 'gettext', for systems which do not include
!      it in 'libc'.
  
! 'libada'
       The Ada runtime library.
  
! 'libatomic'
!      The runtime support library for atomic operations (e.g.  for
!      '__sync' and '__atomic').
  
! 'libcpp'
       The C preprocessor library.
  
! 'libdecnumber'
       The Decimal Float support library.
  
! 'libffi'
!      The 'libffi' library, used as part of the Java runtime library.
  
! 'libgcc'
       The GCC runtime library.
  
! 'libgfortran'
       The Fortran runtime library.
  
! 'libgo'
       The Go runtime library.  The bulk of this library is mirrored from
       the master Go repository (http://code.google.com/p/go/).
  
! 'libgomp'
       The GNU Offloading and Multi Processing Runtime Library.
  
! 'libiberty'
!      The 'libiberty' library, used for portability and for some
       generally useful data structures and algorithms.  *Note
       Introduction: (libiberty)Top, for more information about this
       library.
  
! 'libitm'
       The runtime support library for transactional memory.
  
! 'libjava'
       The Java runtime library.
  
! 'libobjc'
       The Objective-C and Objective-C++ runtime library.
  
! 'libquadmath'
       The runtime support library for quad-precision math operations.
  
! 'libssp'
       The Stack protector runtime library.
  
! 'libstdc++-v3'
       The C++ runtime library.
  
! 'lto-plugin'
       Plugin used by the linker if link-time optimizations are enabled.
  
! 'maintainer-scripts'
!      Scripts used by the 'gccadmin' account on 'gcc.gnu.org'.
  
! 'zlib'
!      The 'zlib' compression library, used by the Java front end, as part
!      of the Java runtime library, and for compressing and uncompressing
!      GCC's intermediate language in LTO object files.
  
   The build system in the top level directory, including how recursion
  into subdirectories works and how building runtime libraries for
  multilibs is handled, is documented in a separate manual, included with
! GNU Binutils.  *Note GNU configure and build system: (configure)Top, for
! details.
  
  
  File: gccint.info,  Node: gcc Directory,  Prev: Top Level,  Up: Source Tree
  
! 6.3 The 'gcc' Subdirectory
  ==========================
  
! The 'gcc' directory contains many files that are part of the C sources
! of GCC, other files used as part of the configuration and build process,
! and subdirectories including documentation and a testsuite.  The files
! that are sources of GCC are documented in a separate chapter.  *Note
! Passes and Files of the Compiler: Passes.
  
  * Menu:
  
! * Subdirectories:: Subdirectories of 'gcc'.
  * Configuration::  The configuration process, and the files it uses.
! * Build::          The build system in the 'gcc' directory.
! * Makefile::       Targets in 'gcc/Makefile'.
! * Library Files::  Library source files and headers under 'gcc/'.
  * Headers::        Headers installed by GCC.
  * Documentation::  Building documentation in GCC.
  * Front End::      Anatomy of a language front end.
*************** The files that are sources of GCC are do
*** 3226,3347 ****
  
  File: gccint.info,  Node: Subdirectories,  Next: Configuration,  Up: gcc Directory
  
! 6.3.1 Subdirectories of `gcc'
  -----------------------------
  
! The `gcc' directory contains the following subdirectories:
  
! `LANGUAGE'
       Subdirectories for various languages.  Directories containing a
!      file `config-lang.in' are language subdirectories.  The contents of
!      the subdirectories `c' (for C), `cp' (for C++), `objc' (for
!      Objective-C), `objcp' (for Objective-C++), and `lto' (for LTO) are
       documented in this manual (*note Passes and Files of the Compiler:
       Passes.); those for other languages are not.  *Note Anatomy of a
       Language Front End: Front End, for details of the files in these
       directories.
  
! `common'
!      Source files shared between the compiler drivers (such as `gcc')
!      and the compilers proper (such as `cc1').  If an architecture
       defines target hooks shared between those places, it also has a
!      subdirectory in `common/config'.  *Note Target Structure::.
  
! `config'
       Configuration files for supported architectures and operating
!      systems.  *Note Anatomy of a Target Back End: Back End, for
!      details of the files in this directory.
  
! `doc'
       Texinfo documentation for GCC, together with automatically
       generated man pages and support for converting the installation
       manual to HTML.  *Note Documentation::.
  
! `ginclude'
       System headers installed by GCC, mainly those required by the C
       standard of freestanding implementations.  *Note Headers Installed
       by GCC: Headers, for details of when these and other headers are
       installed.
  
! `po'
       Message catalogs with translations of messages produced by GCC into
!      various languages, `LANGUAGE.po'.  This directory also contains
!      `gcc.pot', the template for these message catalogues, `exgettext',
!      a wrapper around `gettext' to extract the messages from the GCC
!      sources and create `gcc.pot', which is run by `make gcc.pot', and
!      `EXCLUDES', a list of files from which messages should not be
       extracted.
  
! `testsuite'
!      The GCC testsuites (except for those for runtime libraries).
!      *Note Testsuites::.
  
  
  File: gccint.info,  Node: Configuration,  Next: Build,  Prev: Subdirectories,  Up: gcc Directory
  
! 6.3.2 Configuration in the `gcc' Directory
  ------------------------------------------
  
! The `gcc' directory is configured with an Autoconf-generated script
! `configure'.  The `configure' script is generated from `configure.ac'
! and `aclocal.m4'.  From the files `configure.ac' and `acconfig.h',
! Autoheader generates the file `config.in'.  The file `cstamp-h.in' is
  used as a timestamp.
  
  * Menu:
  
! * Config Fragments::     Scripts used by `configure'.
! * System Config::        The `config.build', `config.host', and
!                          `config.gcc' files.
! * Configuration Files::  Files created by running `configure'.
  
  
  File: gccint.info,  Node: Config Fragments,  Next: System Config,  Up: Configuration
  
! 6.3.2.1 Scripts Used by `configure'
  ...................................
  
! `configure' uses some other scripts to help in its work:
  
!    * The standard GNU `config.sub' and `config.guess' files, kept in
!      the top level directory, are used.
  
!    * The file `config.gcc' is used to handle configuration specific to
!      the particular target machine.  The file `config.build' is used to
!      handle configuration specific to the particular build machine.
!      The file `config.host' is used to handle configuration specific to
!      the particular host machine.  (In general, these should only be
!      used for features that cannot reasonably be tested in Autoconf
!      feature tests.)  *Note The `config.build'; `config.host'; and
!      `config.gcc' Files: System Config, for details of the contents of
!      these files.
  
!    * Each language subdirectory has a file `LANGUAGE/config-lang.in'
!      that is used for front-end-specific configuration.  *Note The
!      Front End `config-lang.in' File: Front End Config, for details of
!      this file.
  
!    * A helper script `configure.frag' is used as part of creating the
!      output of `configure'.
  
  
  File: gccint.info,  Node: System Config,  Next: Configuration Files,  Prev: Config Fragments,  Up: Configuration
  
! 6.3.2.2 The `config.build'; `config.host'; and `config.gcc' Files
  .................................................................
  
! The `config.build' file contains specific rules for particular systems
  which GCC is built on.  This should be used as rarely as possible, as
  the behavior of the build system can always be detected by autoconf.
  
!  The `config.host' file contains specific rules for particular systems
  which GCC will run on.  This is rarely needed.
  
!  The `config.gcc' file contains specific rules for particular systems
  which GCC will generate code for.  This is usually needed.
  
!  Each file has a list of the shell variables it sets, with
! descriptions, at the top of the file.
  
   FIXME: document the contents of these files, and what variables should
  be set to control build, host and target configuration.
--- 3220,3340 ----
  
  File: gccint.info,  Node: Subdirectories,  Next: Configuration,  Up: gcc Directory
  
! 6.3.1 Subdirectories of 'gcc'
  -----------------------------
  
! The 'gcc' directory contains the following subdirectories:
  
! 'LANGUAGE'
       Subdirectories for various languages.  Directories containing a
!      file 'config-lang.in' are language subdirectories.  The contents of
!      the subdirectories 'c' (for C), 'cp' (for C++), 'objc' (for
!      Objective-C), 'objcp' (for Objective-C++), and 'lto' (for LTO) are
       documented in this manual (*note Passes and Files of the Compiler:
       Passes.); those for other languages are not.  *Note Anatomy of a
       Language Front End: Front End, for details of the files in these
       directories.
  
! 'common'
!      Source files shared between the compiler drivers (such as 'gcc')
!      and the compilers proper (such as 'cc1').  If an architecture
       defines target hooks shared between those places, it also has a
!      subdirectory in 'common/config'.  *Note Target Structure::.
  
! 'config'
       Configuration files for supported architectures and operating
!      systems.  *Note Anatomy of a Target Back End: Back End, for details
!      of the files in this directory.
  
! 'doc'
       Texinfo documentation for GCC, together with automatically
       generated man pages and support for converting the installation
       manual to HTML.  *Note Documentation::.
  
! 'ginclude'
       System headers installed by GCC, mainly those required by the C
       standard of freestanding implementations.  *Note Headers Installed
       by GCC: Headers, for details of when these and other headers are
       installed.
  
! 'po'
       Message catalogs with translations of messages produced by GCC into
!      various languages, 'LANGUAGE.po'.  This directory also contains
!      'gcc.pot', the template for these message catalogues, 'exgettext',
!      a wrapper around 'gettext' to extract the messages from the GCC
!      sources and create 'gcc.pot', which is run by 'make gcc.pot', and
!      'EXCLUDES', a list of files from which messages should not be
       extracted.
  
! 'testsuite'
!      The GCC testsuites (except for those for runtime libraries).  *Note
!      Testsuites::.
  
  
  File: gccint.info,  Node: Configuration,  Next: Build,  Prev: Subdirectories,  Up: gcc Directory
  
! 6.3.2 Configuration in the 'gcc' Directory
  ------------------------------------------
  
! The 'gcc' directory is configured with an Autoconf-generated script
! 'configure'.  The 'configure' script is generated from 'configure.ac'
! and 'aclocal.m4'.  From the files 'configure.ac' and 'acconfig.h',
! Autoheader generates the file 'config.in'.  The file 'cstamp-h.in' is
  used as a timestamp.
  
  * Menu:
  
! * Config Fragments::     Scripts used by 'configure'.
! * System Config::        The 'config.build', 'config.host', and
!                          'config.gcc' files.
! * Configuration Files::  Files created by running 'configure'.
  
  
  File: gccint.info,  Node: Config Fragments,  Next: System Config,  Up: Configuration
  
! 6.3.2.1 Scripts Used by 'configure'
  ...................................
  
! 'configure' uses some other scripts to help in its work:
  
!    * The standard GNU 'config.sub' and 'config.guess' files, kept in the
!      top level directory, are used.
  
!    * The file 'config.gcc' is used to handle configuration specific to
!      the particular target machine.  The file 'config.build' is used to
!      handle configuration specific to the particular build machine.  The
!      file 'config.host' is used to handle configuration specific to the
!      particular host machine.  (In general, these should only be used
!      for features that cannot reasonably be tested in Autoconf feature
!      tests.)  *Note The 'config.build'; 'config.host'; and 'config.gcc'
!      Files: System Config, for details of the contents of these files.
  
!    * Each language subdirectory has a file 'LANGUAGE/config-lang.in'
!      that is used for front-end-specific configuration.  *Note The Front
!      End 'config-lang.in' File: Front End Config, for details of this
!      file.
  
!    * A helper script 'configure.frag' is used as part of creating the
!      output of 'configure'.
  
  
  File: gccint.info,  Node: System Config,  Next: Configuration Files,  Prev: Config Fragments,  Up: Configuration
  
! 6.3.2.2 The 'config.build'; 'config.host'; and 'config.gcc' Files
  .................................................................
  
! The 'config.build' file contains specific rules for particular systems
  which GCC is built on.  This should be used as rarely as possible, as
  the behavior of the build system can always be detected by autoconf.
  
!  The 'config.host' file contains specific rules for particular systems
  which GCC will run on.  This is rarely needed.
  
!  The 'config.gcc' file contains specific rules for particular systems
  which GCC will generate code for.  This is usually needed.
  
!  Each file has a list of the shell variables it sets, with descriptions,
! at the top of the file.
  
   FIXME: document the contents of these files, and what variables should
  be set to control build, host and target configuration.
*************** be set to control build, host and target
*** 3349,3417 ****
  
  File: gccint.info,  Node: Configuration Files,  Prev: System Config,  Up: Configuration
  
! 6.3.2.3 Files Created by `configure'
  ....................................
  
! Here we spell out what files will be set up by `configure' in the `gcc'
  directory.  Some other files are created as temporary files in the
  configuration process, and are not used in the subsequent build; these
  are not documented.
  
!    * `Makefile' is constructed from `Makefile.in', together with the
       host and target fragments (*note Makefile Fragments: Fragments.)
!      `t-TARGET' and `x-HOST' from `config', if any, and language
!      Makefile fragments `LANGUAGE/Make-lang.in'.
! 
!    * `auto-host.h' contains information about the host machine
!      determined by `configure'.  If the host machine is different from
!      the build machine, then `auto-build.h' is also created, containing
       such information about the build machine.
! 
!    * `config.status' is a script that may be run to recreate the
!      current configuration.
! 
!    * `configargs.h' is a header containing details of the arguments
!      passed to `configure' to configure GCC, and of the thread model
       used.
! 
!    * `cstamp-h' is used as a timestamp.
! 
!    * If a language `config-lang.in' file (*note The Front End
!      `config-lang.in' File: Front End Config.) sets `outputs', then the
!      files listed in `outputs' there are also generated.
  
   The following configuration headers are created from the Makefile,
! using `mkconfig.sh', rather than directly by `configure'.  `config.h',
! `bconfig.h' and `tconfig.h' all contain the `xm-MACHINE.h' header, if
  any, appropriate to the host, build and target machines respectively,
  the configuration headers for the target, and some definitions; for the
  host and build machines, these include the autoconfigured headers
! generated by `configure'.  The other configuration headers are
! determined by `config.gcc'.  They also contain the typedefs for `rtx',
! `rtvec' and `tree'.
! 
!    * `config.h', for use in programs that run on the host machine.
! 
!    * `bconfig.h', for use in programs that run on the build machine.
  
!    * `tconfig.h', for use in programs and libraries for the target
       machine.
! 
!    * `tm_p.h', which includes the header `MACHINE-protos.h' that
!      contains prototypes for functions in the target `MACHINE.c' file.
!      The header `MACHINE-protos.h' can include prototypes of functions
!      that use rtl and tree data structures inside appropriate `#ifdef
!      RTX_CODE' and `#ifdef TREE_CODE' conditional code segements.  The
!      `MACHINE-protos.h' is included after the `rtl.h' and/or `tree.h'
!      would have been included.  The `tm_p.h' also includes the header
!      `tm-preds.h' which is generated by `genpreds' program during the
       build to define the declarations and inline functions for the
       predicate functions.
  
  
  File: gccint.info,  Node: Build,  Next: Makefile,  Prev: Configuration,  Up: gcc Directory
  
! 6.3.3 Build System in the `gcc' Directory
  -----------------------------------------
  
  FIXME: describe the build system, including what is built in what
--- 3342,3402 ----
  
  File: gccint.info,  Node: Configuration Files,  Prev: System Config,  Up: Configuration
  
! 6.3.2.3 Files Created by 'configure'
  ....................................
  
! Here we spell out what files will be set up by 'configure' in the 'gcc'
  directory.  Some other files are created as temporary files in the
  configuration process, and are not used in the subsequent build; these
  are not documented.
  
!    * 'Makefile' is constructed from 'Makefile.in', together with the
       host and target fragments (*note Makefile Fragments: Fragments.)
!      't-TARGET' and 'x-HOST' from 'config', if any, and language
!      Makefile fragments 'LANGUAGE/Make-lang.in'.
!    * 'auto-host.h' contains information about the host machine
!      determined by 'configure'.  If the host machine is different from
!      the build machine, then 'auto-build.h' is also created, containing
       such information about the build machine.
!    * 'config.status' is a script that may be run to recreate the current
!      configuration.
!    * 'configargs.h' is a header containing details of the arguments
!      passed to 'configure' to configure GCC, and of the thread model
       used.
!    * 'cstamp-h' is used as a timestamp.
!    * If a language 'config-lang.in' file (*note The Front End
!      'config-lang.in' File: Front End Config.) sets 'outputs', then the
!      files listed in 'outputs' there are also generated.
  
   The following configuration headers are created from the Makefile,
! using 'mkconfig.sh', rather than directly by 'configure'.  'config.h',
! 'bconfig.h' and 'tconfig.h' all contain the 'xm-MACHINE.h' header, if
  any, appropriate to the host, build and target machines respectively,
  the configuration headers for the target, and some definitions; for the
  host and build machines, these include the autoconfigured headers
! generated by 'configure'.  The other configuration headers are
! determined by 'config.gcc'.  They also contain the typedefs for 'rtx',
! 'rtvec' and 'tree'.
  
!    * 'config.h', for use in programs that run on the host machine.
!    * 'bconfig.h', for use in programs that run on the build machine.
!    * 'tconfig.h', for use in programs and libraries for the target
       machine.
!    * 'tm_p.h', which includes the header 'MACHINE-protos.h' that
!      contains prototypes for functions in the target 'MACHINE.c' file.
!      The header 'MACHINE-protos.h' can include prototypes of functions
!      that use rtl and tree data structures inside appropriate '#ifdef
!      RTX_CODE' and '#ifdef TREE_CODE' conditional code segements.  The
!      'MACHINE-protos.h' is included after the 'rtl.h' and/or 'tree.h'
!      would have been included.  The 'tm_p.h' also includes the header
!      'tm-preds.h' which is generated by 'genpreds' program during the
       build to define the declarations and inline functions for the
       predicate functions.
  
  
  File: gccint.info,  Node: Build,  Next: Makefile,  Prev: Configuration,  Up: gcc Directory
  
! 6.3.3 Build System in the 'gcc' Directory
  -----------------------------------------
  
  FIXME: describe the build system, including what is built in what
*************** File: gccint.info,  Node: Makefile,  Nex
*** 3425,3492 ****
  6.3.4 Makefile Targets
  ----------------------
  
! These targets are available from the `gcc' directory:
  
! `all'
       This is the default target.  Depending on what your
       build/host/target configuration is, it coordinates all the things
       that need to be built.
  
! `doc'
       Produce info-formatted documentation and man pages.  Essentially it
!      calls `make man' and `make info'.
  
! `dvi'
       Produce DVI-formatted documentation.
  
! `pdf'
       Produce PDF-formatted documentation.
  
! `html'
       Produce HTML-formatted documentation.
  
! `man'
       Generate man pages.
  
! `info'
       Generate info-formatted pages.
  
! `mostlyclean'
       Delete the files made while building the compiler.
  
! `clean'
!      That, and all the other files built by `make all'.
  
! `distclean'
!      That, and all the files created by `configure'.
  
! `maintainer-clean'
       Distclean plus any file that can be generated from other files.
       Note that additional tools may be required beyond what is normally
       needed to build GCC.
  
! `srcextra'
       Generates files in the source directory that are not
       version-controlled but should go into a release tarball.
  
! `srcinfo'
! `srcman'
       Copies the info-formatted and manpage documentation into the source
       directory usually for the purpose of generating a release tarball.
  
! `install'
       Installs GCC.
  
! `uninstall'
       Deletes installed files, though this is not supported.
  
! `check'
!      Run the testsuite.  This creates a `testsuite' subdirectory that
!      has various `.sum' and `.log' files containing the results of the
!      testing.  You can run subsets with, for example, `make check-gcc'.
!      You can specify specific tests by setting `RUNTESTFLAGS' to be the
!      name of the `.exp' file, optionally followed by (for some tests)
!      an equals and a file wildcard, like:
  
            make check-gcc RUNTESTFLAGS="execute.exp=19980413-*"
  
--- 3410,3477 ----
  6.3.4 Makefile Targets
  ----------------------
  
! These targets are available from the 'gcc' directory:
  
! 'all'
       This is the default target.  Depending on what your
       build/host/target configuration is, it coordinates all the things
       that need to be built.
  
! 'doc'
       Produce info-formatted documentation and man pages.  Essentially it
!      calls 'make man' and 'make info'.
  
! 'dvi'
       Produce DVI-formatted documentation.
  
! 'pdf'
       Produce PDF-formatted documentation.
  
! 'html'
       Produce HTML-formatted documentation.
  
! 'man'
       Generate man pages.
  
! 'info'
       Generate info-formatted pages.
  
! 'mostlyclean'
       Delete the files made while building the compiler.
  
! 'clean'
!      That, and all the other files built by 'make all'.
  
! 'distclean'
!      That, and all the files created by 'configure'.
  
! 'maintainer-clean'
       Distclean plus any file that can be generated from other files.
       Note that additional tools may be required beyond what is normally
       needed to build GCC.
  
! 'srcextra'
       Generates files in the source directory that are not
       version-controlled but should go into a release tarball.
  
! 'srcinfo'
! 'srcman'
       Copies the info-formatted and manpage documentation into the source
       directory usually for the purpose of generating a release tarball.
  
! 'install'
       Installs GCC.
  
! 'uninstall'
       Deletes installed files, though this is not supported.
  
! 'check'
!      Run the testsuite.  This creates a 'testsuite' subdirectory that
!      has various '.sum' and '.log' files containing the results of the
!      testing.  You can run subsets with, for example, 'make check-gcc'.
!      You can specify specific tests by setting 'RUNTESTFLAGS' to be the
!      name of the '.exp' file, optionally followed by (for some tests) an
!      equals and a file wildcard, like:
  
            make check-gcc RUNTESTFLAGS="execute.exp=19980413-*"
  
*************** steps of the build, including bootstrapp
*** 3499,3590 ****
  new compiler to build target libraries.
  
   When GCC is configured for a native configuration, the default action
! for `make' is to do a full three-stage bootstrap.  This means that GCC
  is built three times--once with the native compiler, once with the
! native-built compiler it just built, and once with the compiler it
! built the second time.  In theory, the last two should produce the same
! results, which `make compare' can check.  Each stage is configured
  separately and compiled into a separate directory, to minimize problems
  due to ABI incompatibilities between the native compiler and GCC.
  
!  If you do a change, rebuilding will also start from the first stage
! and "bubble" up the change through the three stages.  Each stage is
! taken from its build directory (if it had been built previously),
! rebuilt, and copied to its subdirectory.  This will allow you to, for
! example, continue a bootstrap after fixing a bug which causes the
! stage2 build to crash.  It does not provide as good coverage of the
! compiler as bootstrapping from scratch, but it ensures that the new
! code is syntactically correct (e.g., that you did not use GCC extensions
! by mistake), and avoids spurious bootstrap comparison failures(1).
  
   Other targets available from the top level include:
  
! `bootstrap-lean'
!      Like `bootstrap', except that the various stages are removed once
       they're no longer needed.  This saves disk space.
  
! `bootstrap2'
! `bootstrap2-lean'
       Performs only the first two stages of bootstrap.  Unlike a
       three-stage bootstrap, this does not perform a comparison to test
       that the compiler is running properly.  Note that the disk space
       required by a "lean" bootstrap is approximately independent of the
       number of stages.
  
! `stageN-bubble (N = 1...4, profile, feedback)'
       Rebuild all the stages up to N, with the appropriate flags,
       "bubbling" the changes as described above.
  
! `all-stageN (N = 1...4, profile, feedback)'
       Assuming that stage N has already been built, rebuild it with the
       appropriate flags.  This is rarely needed.
  
! `cleanstrap'
!      Remove everything (`make clean') and rebuilds (`make bootstrap').
  
! `compare'
       Compares the results of stages 2 and 3.  This ensures that the
       compiler is running properly, since it should produce the same
       object files regardless of how it itself was compiled.
  
! `profiledbootstrap'
       Builds a compiler with profiling feedback information.  In this
!      case, the second and third stages are named `profile' and
!      `feedback', respectively.  For more information, see *note
!      Building with profile feedback: (gccinstall)Building.
  
! `restrap'
!      Restart a bootstrap, so that everything that was not built with
!      the system compiler is rebuilt.
  
! `stageN-start (N = 1...4, profile, feedback)'
       For each package that is bootstrapped, rename directories so that,
!      for example, `gcc' points to the stageN GCC, compiled with the
       stageN-1 GCC(2).
  
!      You will invoke this target if you need to test or debug the
!      stageN GCC.  If you only need to execute GCC (but you need not run
!      `make' either to rebuild it or to run test suites), you should be
!      able to work directly in the `stageN-gcc' directory.  This makes
!      it easier to debug multiple stages in parallel.
  
! `stage'
       For each package that is bootstrapped, relocate its build directory
!      to indicate its stage.  For example, if the `gcc' directory points
!      to the stage2 GCC, after invoking this target it will be renamed
!      to `stage2-gcc'.
! 
  
   If you wish to use non-default GCC flags when compiling the stage2 and
! stage3 compilers, set `BOOT_CFLAGS' on the command line when doing
! `make'.
  
!  Usually, the first stage only builds the languages that the compiler
! is written in: typically, C and maybe Ada.  If you are debugging a
  miscompilation of a different stage2 front-end (for example, of the
  Fortran front-end), you may want to have front-ends for other languages
! in the first stage as well.  To do so, set `STAGE1_LANGUAGES' on the
! command line when doing `make'.
  
   For example, in the aforementioned scenario of debugging a Fortran
  front-end miscompilation caused by the stage1 compiler, you may need a
--- 3484,3574 ----
  new compiler to build target libraries.
  
   When GCC is configured for a native configuration, the default action
! for 'make' is to do a full three-stage bootstrap.  This means that GCC
  is built three times--once with the native compiler, once with the
! native-built compiler it just built, and once with the compiler it built
! the second time.  In theory, the last two should produce the same
! results, which 'make compare' can check.  Each stage is configured
  separately and compiled into a separate directory, to minimize problems
  due to ABI incompatibilities between the native compiler and GCC.
  
!  If you do a change, rebuilding will also start from the first stage and
! "bubble" up the change through the three stages.  Each stage is taken
! from its build directory (if it had been built previously), rebuilt, and
! copied to its subdirectory.  This will allow you to, for example,
! continue a bootstrap after fixing a bug which causes the stage2 build to
! crash.  It does not provide as good coverage of the compiler as
! bootstrapping from scratch, but it ensures that the new code is
! syntactically correct (e.g., that you did not use GCC extensions by
! mistake), and avoids spurious bootstrap comparison failures(1).
  
   Other targets available from the top level include:
  
! 'bootstrap-lean'
!      Like 'bootstrap', except that the various stages are removed once
       they're no longer needed.  This saves disk space.
  
! 'bootstrap2'
! 'bootstrap2-lean'
       Performs only the first two stages of bootstrap.  Unlike a
       three-stage bootstrap, this does not perform a comparison to test
       that the compiler is running properly.  Note that the disk space
       required by a "lean" bootstrap is approximately independent of the
       number of stages.
  
! 'stageN-bubble (N = 1...4, profile, feedback)'
       Rebuild all the stages up to N, with the appropriate flags,
       "bubbling" the changes as described above.
  
! 'all-stageN (N = 1...4, profile, feedback)'
       Assuming that stage N has already been built, rebuild it with the
       appropriate flags.  This is rarely needed.
  
! 'cleanstrap'
!      Remove everything ('make clean') and rebuilds ('make bootstrap').
  
! 'compare'
       Compares the results of stages 2 and 3.  This ensures that the
       compiler is running properly, since it should produce the same
       object files regardless of how it itself was compiled.
  
! 'profiledbootstrap'
       Builds a compiler with profiling feedback information.  In this
!      case, the second and third stages are named 'profile' and
!      'feedback', respectively.  For more information, see *note Building
!      with profile feedback: (gccinstall)Building.
  
! 'restrap'
!      Restart a bootstrap, so that everything that was not built with the
!      system compiler is rebuilt.
  
! 'stageN-start (N = 1...4, profile, feedback)'
       For each package that is bootstrapped, rename directories so that,
!      for example, 'gcc' points to the stageN GCC, compiled with the
       stageN-1 GCC(2).
  
!      You will invoke this target if you need to test or debug the stageN
!      GCC.  If you only need to execute GCC (but you need not run 'make'
!      either to rebuild it or to run test suites), you should be able to
!      work directly in the 'stageN-gcc' directory.  This makes it easier
!      to debug multiple stages in parallel.
  
! 'stage'
       For each package that is bootstrapped, relocate its build directory
!      to indicate its stage.  For example, if the 'gcc' directory points
!      to the stage2 GCC, after invoking this target it will be renamed to
!      'stage2-gcc'.
  
   If you wish to use non-default GCC flags when compiling the stage2 and
! stage3 compilers, set 'BOOT_CFLAGS' on the command line when doing
! 'make'.
  
!  Usually, the first stage only builds the languages that the compiler is
! written in: typically, C and maybe Ada.  If you are debugging a
  miscompilation of a different stage2 front-end (for example, of the
  Fortran front-end), you may want to have front-ends for other languages
! in the first stage as well.  To do so, set 'STAGE1_LANGUAGES' on the
! command line when doing 'make'.
  
   For example, in the aforementioned scenario of debugging a Fortran
  front-end miscompilation caused by the stage1 compiler, you may need a
*************** command like
*** 3593,3620 ****
       make stage2-bubble STAGE1_LANGUAGES=c,fortran
  
   Alternatively, you can use per-language targets to build and test
! languages that are not enabled by default in stage1.  For example,
! `make f951' will build a Fortran compiler even in the stage1 build
! directory.
  
!  ---------- Footnotes ----------
  
!  (1) Except if the compiler was buggy and miscompiled some of the files
! that were not modified.  In this case, it's best to use `make restrap'.
  
!  (2) Customarily, the system compiler is also termed the `stage0' GCC.
  
  
  File: gccint.info,  Node: Library Files,  Next: Headers,  Prev: Makefile,  Up: gcc Directory
  
! 6.3.5 Library Source Files and Headers under the `gcc' Directory
  ----------------------------------------------------------------
  
  FIXME: list here, with explanation, all the C source files and headers
! under the `gcc' directory that aren't built into the GCC executable but
  rather are part of runtime libraries and object files, such as
! `crtstuff.c' and `unwind-dw2.c'.  *Note Headers Installed by GCC:
! Headers, for more information about the `ginclude' directory.
  
  
  File: gccint.info,  Node: Headers,  Next: Documentation,  Prev: Library Files,  Up: gcc Directory
--- 3577,3604 ----
       make stage2-bubble STAGE1_LANGUAGES=c,fortran
  
   Alternatively, you can use per-language targets to build and test
! languages that are not enabled by default in stage1.  For example, 'make
! f951' will build a Fortran compiler even in the stage1 build directory.
  
!    ---------- Footnotes ----------
  
!    (1) Except if the compiler was buggy and miscompiled some of the
! files that were not modified.  In this case, it's best to use 'make
! restrap'.
  
!    (2) Customarily, the system compiler is also termed the 'stage0' GCC.
  
  
  File: gccint.info,  Node: Library Files,  Next: Headers,  Prev: Makefile,  Up: gcc Directory
  
! 6.3.5 Library Source Files and Headers under the 'gcc' Directory
  ----------------------------------------------------------------
  
  FIXME: list here, with explanation, all the C source files and headers
! under the 'gcc' directory that aren't built into the GCC executable but
  rather are part of runtime libraries and object files, such as
! 'crtstuff.c' and 'unwind-dw2.c'.  *Note Headers Installed by GCC:
! Headers, for more information about the 'ginclude' directory.
  
  
  File: gccint.info,  Node: Headers,  Next: Documentation,  Prev: Library Files,  Up: gcc Directory
*************** In general, GCC expects the system C lib
*** 3626,3663 ****
  headers to be used with it.  However, GCC will fix those headers if
  necessary to make them work with GCC, and will install some headers
  required of freestanding implementations.  These headers are installed
! in `LIBSUBDIR/include'.  Headers for non-C runtime libraries are also
  installed by GCC; these are not documented here.  (FIXME: document them
  somewhere.)
  
!  Several of the headers GCC installs are in the `ginclude' directory.
! These headers, `iso646.h', `stdarg.h', `stdbool.h', and `stddef.h', are
! installed in `LIBSUBDIR/include', unless the target Makefile fragment
! (*note Target Fragment::) overrides this by setting `USER_H'.
  
   In addition to these headers and those generated by fixing system
  headers to work with GCC, some other headers may also be installed in
! `LIBSUBDIR/include'.  `config.gcc' may set `extra_headers'; this
! specifies additional headers under `config' to be installed on some
  systems.
  
!  GCC installs its own version of `<float.h>', from `ginclude/float.h'.
  This is done to cope with command-line options that change the
  representation of floating point numbers.
  
!  GCC also installs its own version of `<limits.h>'; this is generated
! from `glimits.h', together with `limitx.h' and `limity.h' if the system
! also has its own version of `<limits.h>'.  (GCC provides its own header
  because it is required of ISO C freestanding implementations, but needs
  to include the system header from its own header as well because other
  standards such as POSIX specify additional values to be defined in
! `<limits.h>'.)  The system's `<limits.h>' header is used via
! `LIBSUBDIR/include/syslimits.h', which is copied from `gsyslimits.h' if
  it does not need fixing to work with GCC; if it needs fixing,
! `syslimits.h' is the fixed copy.
  
!  GCC can also install `<tgmath.h>'.  It will do this when `config.gcc'
! sets `use_gcc_tgmath' to `yes'.
  
  
  File: gccint.info,  Node: Documentation,  Next: Front End,  Prev: Headers,  Up: gcc Directory
--- 3610,3647 ----
  headers to be used with it.  However, GCC will fix those headers if
  necessary to make them work with GCC, and will install some headers
  required of freestanding implementations.  These headers are installed
! in 'LIBSUBDIR/include'.  Headers for non-C runtime libraries are also
  installed by GCC; these are not documented here.  (FIXME: document them
  somewhere.)
  
!  Several of the headers GCC installs are in the 'ginclude' directory.
! These headers, 'iso646.h', 'stdarg.h', 'stdbool.h', and 'stddef.h', are
! installed in 'LIBSUBDIR/include', unless the target Makefile fragment
! (*note Target Fragment::) overrides this by setting 'USER_H'.
  
   In addition to these headers and those generated by fixing system
  headers to work with GCC, some other headers may also be installed in
! 'LIBSUBDIR/include'.  'config.gcc' may set 'extra_headers'; this
! specifies additional headers under 'config' to be installed on some
  systems.
  
!  GCC installs its own version of '<float.h>', from 'ginclude/float.h'.
  This is done to cope with command-line options that change the
  representation of floating point numbers.
  
!  GCC also installs its own version of '<limits.h>'; this is generated
! from 'glimits.h', together with 'limitx.h' and 'limity.h' if the system
! also has its own version of '<limits.h>'.  (GCC provides its own header
  because it is required of ISO C freestanding implementations, but needs
  to include the system header from its own header as well because other
  standards such as POSIX specify additional values to be defined in
! '<limits.h>'.)  The system's '<limits.h>' header is used via
! 'LIBSUBDIR/include/syslimits.h', which is copied from 'gsyslimits.h' if
  it does not need fixing to work with GCC; if it needs fixing,
! 'syslimits.h' is the fixed copy.
  
!  GCC can also install '<tgmath.h>'.  It will do this when 'config.gcc'
! sets 'use_gcc_tgmath' to 'yes'.
  
  
  File: gccint.info,  Node: Documentation,  Next: Front End,  Prev: Headers,  Up: gcc Directory
*************** File: gccint.info,  Node: Documentation,
*** 3667,3677 ****
  
  The main GCC documentation is in the form of manuals in Texinfo format.
  These are installed in Info format; DVI versions may be generated by
! `make dvi', PDF versions by `make pdf', and HTML versions by `make
  html'.  In addition, some man pages are generated from the Texinfo
  manuals, there are some other text files with miscellaneous
  documentation, and runtime libraries have their own documentation
! outside the `gcc' directory.  FIXME: document the documentation for
  runtime libraries somewhere.
  
  * Menu:
--- 3651,3661 ----
  
  The main GCC documentation is in the form of manuals in Texinfo format.
  These are installed in Info format; DVI versions may be generated by
! 'make dvi', PDF versions by 'make pdf', and HTML versions by 'make
  html'.  In addition, some man pages are generated from the Texinfo
  manuals, there are some other text files with miscellaneous
  documentation, and runtime libraries have their own documentation
! outside the 'gcc' directory.  FIXME: document the documentation for
  runtime libraries somewhere.
  
  * Menu:
*************** File: gccint.info,  Node: Texinfo Manual
*** 3687,3739 ****
  .......................
  
  The manuals for GCC as a whole, and the C and C++ front ends, are in
! files `doc/*.texi'.  Other front ends have their own manuals in files
! `LANGUAGE/*.texi'.  Common files `doc/include/*.texi' are provided
! which may be included in multiple manuals; the following files are in
! `doc/include':
  
! `fdl.texi'
       The GNU Free Documentation License.
! 
! `funding.texi'
       The section "Funding Free Software".
! 
! `gcc-common.texi'
       Common definitions for manuals.
! 
! `gpl_v3.texi'
       The GNU General Public License.
  
! `texinfo.tex'
!      A copy of `texinfo.tex' known to work with the GCC manuals.
! 
!  DVI-formatted manuals are generated by `make dvi', which uses
! `texi2dvi' (via the Makefile macro `$(TEXI2DVI)').  PDF-formatted
! manuals are generated by `make pdf', which uses `texi2pdf' (via the
! Makefile macro `$(TEXI2PDF)').  HTML formatted manuals are generated by
! `make html'.  Info manuals are generated by `make info' (which is run
! as part of a bootstrap); this generates the manuals in the source
! directory, using `makeinfo' via the Makefile macro `$(MAKEINFO)', and
  they are included in release distributions.
  
   Manuals are also provided on the GCC web site, in both HTML and
  PostScript forms.  This is done via the script
! `maintainer-scripts/update_web_docs_svn'.  Each manual to be provided
! online must be listed in the definition of `MANUALS' in that file; a
! file `NAME.texi' must only appear once in the source tree, and the
  output manual must have the same name as the source file.  (However,
  other Texinfo files, included in manuals but not themselves the root
  files of manuals, may have names that appear more than once in the
! source tree.)  The manual file `NAME.texi' should only include other
! files in its own directory or in `doc/include'.  HTML manuals will be
! generated by `makeinfo --html', PostScript manuals by `texi2dvi' and
! `dvips', and PDF manuals by `texi2pdf'.  All Texinfo files that are
  parts of manuals must be version-controlled, even if they are generated
  files, for the generation of online manuals to work.
  
!  The installation manual, `doc/install.texi', is also provided on the
  GCC web site.  The HTML version is generated by the script
! `doc/install.texi2html'.
  
  
  File: gccint.info,  Node: Man Page Generation,  Next: Miscellaneous Docs,  Prev: Texinfo Manuals,  Up: Documentation
--- 3671,3719 ----
  .......................
  
  The manuals for GCC as a whole, and the C and C++ front ends, are in
! files 'doc/*.texi'.  Other front ends have their own manuals in files
! 'LANGUAGE/*.texi'.  Common files 'doc/include/*.texi' are provided which
! may be included in multiple manuals; the following files are in
! 'doc/include':
  
! 'fdl.texi'
       The GNU Free Documentation License.
! 'funding.texi'
       The section "Funding Free Software".
! 'gcc-common.texi'
       Common definitions for manuals.
! 'gpl_v3.texi'
       The GNU General Public License.
+ 'texinfo.tex'
+      A copy of 'texinfo.tex' known to work with the GCC manuals.
  
!  DVI-formatted manuals are generated by 'make dvi', which uses
! 'texi2dvi' (via the Makefile macro '$(TEXI2DVI)').  PDF-formatted
! manuals are generated by 'make pdf', which uses 'texi2pdf' (via the
! Makefile macro '$(TEXI2PDF)').  HTML formatted manuals are generated by
! 'make html'.  Info manuals are generated by 'make info' (which is run as
! part of a bootstrap); this generates the manuals in the source
! directory, using 'makeinfo' via the Makefile macro '$(MAKEINFO)', and
  they are included in release distributions.
  
   Manuals are also provided on the GCC web site, in both HTML and
  PostScript forms.  This is done via the script
! 'maintainer-scripts/update_web_docs_svn'.  Each manual to be provided
! online must be listed in the definition of 'MANUALS' in that file; a
! file 'NAME.texi' must only appear once in the source tree, and the
  output manual must have the same name as the source file.  (However,
  other Texinfo files, included in manuals but not themselves the root
  files of manuals, may have names that appear more than once in the
! source tree.)  The manual file 'NAME.texi' should only include other
! files in its own directory or in 'doc/include'.  HTML manuals will be
! generated by 'makeinfo --html', PostScript manuals by 'texi2dvi' and
! 'dvips', and PDF manuals by 'texi2pdf'.  All Texinfo files that are
  parts of manuals must be version-controlled, even if they are generated
  files, for the generation of online manuals to work.
  
!  The installation manual, 'doc/install.texi', is also provided on the
  GCC web site.  The HTML version is generated by the script
! 'doc/install.texi2html'.
  
  
  File: gccint.info,  Node: Man Page Generation,  Next: Miscellaneous Docs,  Prev: Texinfo Manuals,  Up: Documentation
*************** File: gccint.info,  Node: Man Page Gener
*** 3742,3781 ****
  ...........................
  
  Because of user demand, in addition to full Texinfo manuals, man pages
! are provided which contain extracts from those manuals.  These man
! pages are generated from the Texinfo manuals using
! `contrib/texi2pod.pl' and `pod2man'.  (The man page for `g++',
! `cp/g++.1', just contains a `.so' reference to `gcc.1', but all the
! other man pages are generated from Texinfo manuals.)
  
   Because many systems may not have the necessary tools installed to
! generate the man pages, they are only generated if the `configure'
! script detects that recent enough tools are installed, and the
! Makefiles allow generating man pages to fail without aborting the
! build.  Man pages are also included in release distributions.  They are
! generated in the source directory.
  
!  Magic comments in Texinfo files starting `@c man' control what parts
! of a Texinfo file go into a man page.  Only a subset of Texinfo is
! supported by `texi2pod.pl', and it may be necessary to add support for
  more Texinfo features to this script when generating new man pages.  To
! improve the man page output, some special Texinfo macros are provided
! in `doc/include/gcc-common.texi' which `texi2pod.pl' understands:
! 
! `@gcctabopt'
!      Use in the form `@table @gcctabopt' for tables of options, where
!      for printed output the effect of `@code' is better than that of
!      `@option' but for man page output a different effect is wanted.
  
! `@gccoptlist'
       Use for summary lists of options in manuals.
! 
! `@gol'
!      Use at the end of each line inside `@gccoptlist'.  This is
       necessary to avoid problems with differences in how the
!      `@gccoptlist' macro is handled by different Texinfo formatters.
  
!  FIXME: describe the `texi2pod.pl' input language and magic comments in
  more detail.
  
  
--- 3722,3759 ----
  ...........................
  
  Because of user demand, in addition to full Texinfo manuals, man pages
! are provided which contain extracts from those manuals.  These man pages
! are generated from the Texinfo manuals using 'contrib/texi2pod.pl' and
! 'pod2man'.  (The man page for 'g++', 'cp/g++.1', just contains a '.so'
! reference to 'gcc.1', but all the other man pages are generated from
! Texinfo manuals.)
  
   Because many systems may not have the necessary tools installed to
! generate the man pages, they are only generated if the 'configure'
! script detects that recent enough tools are installed, and the Makefiles
! allow generating man pages to fail without aborting the build.  Man
! pages are also included in release distributions.  They are generated in
! the source directory.
  
!  Magic comments in Texinfo files starting '@c man' control what parts of
! a Texinfo file go into a man page.  Only a subset of Texinfo is
! supported by 'texi2pod.pl', and it may be necessary to add support for
  more Texinfo features to this script when generating new man pages.  To
! improve the man page output, some special Texinfo macros are provided in
! 'doc/include/gcc-common.texi' which 'texi2pod.pl' understands:
  
! '@gcctabopt'
!      Use in the form '@table @gcctabopt' for tables of options, where
!      for printed output the effect of '@code' is better than that of
!      '@option' but for man page output a different effect is wanted.
! '@gccoptlist'
       Use for summary lists of options in manuals.
! '@gol'
!      Use at the end of each line inside '@gccoptlist'.  This is
       necessary to avoid problems with differences in how the
!      '@gccoptlist' macro is handled by different Texinfo formatters.
  
!  FIXME: describe the 'texi2pod.pl' input language and magic comments in
  more detail.
  
  
*************** File: gccint.info,  Node: Miscellaneous
*** 3785,3828 ****
  ...................................
  
  In addition to the formal documentation that is installed by GCC, there
! are several other text files in the `gcc' subdirectory with
  miscellaneous documentation:
  
! `ABOUT-GCC-NLS'
!      Notes on GCC's Native Language Support.  FIXME: this should be
!      part of this manual rather than a separate file.
! 
! `ABOUT-NLS'
       Notes on the Free Translation Project.
! 
! `COPYING'
! `COPYING3'
       The GNU General Public License, Versions 2 and 3.
! 
! `COPYING.LIB'
! `COPYING3.LIB'
       The GNU Lesser General Public License, Versions 2.1 and 3.
! 
! `*ChangeLog*'
! `*/ChangeLog*'
       Change log files for various parts of GCC.
! 
! `LANGUAGES'
       Details of a few changes to the GCC front-end interface.  FIXME:
       the information in this file should be part of general
       documentation of the front-end interface in this manual.
! 
! `ONEWS'
       Information about new features in old versions of GCC.  (For recent
       versions, the information is on the GCC web site.)
! 
! `README.Portability'
       Information about portability issues when writing code in GCC.
       FIXME: why isn't this part of this manual or of the GCC Coding
       Conventions?
  
!  FIXME: document such files in subdirectories, at least `config', `c',
! `cp', `objc', `testsuite'.
  
  
  File: gccint.info,  Node: Front End,  Next: Back End,  Prev: Documentation,  Up: gcc Directory
--- 3763,3799 ----
  ...................................
  
  In addition to the formal documentation that is installed by GCC, there
! are several other text files in the 'gcc' subdirectory with
  miscellaneous documentation:
  
! 'ABOUT-GCC-NLS'
!      Notes on GCC's Native Language Support.  FIXME: this should be part
!      of this manual rather than a separate file.
! 'ABOUT-NLS'
       Notes on the Free Translation Project.
! 'COPYING'
! 'COPYING3'
       The GNU General Public License, Versions 2 and 3.
! 'COPYING.LIB'
! 'COPYING3.LIB'
       The GNU Lesser General Public License, Versions 2.1 and 3.
! '*ChangeLog*'
! '*/ChangeLog*'
       Change log files for various parts of GCC.
! 'LANGUAGES'
       Details of a few changes to the GCC front-end interface.  FIXME:
       the information in this file should be part of general
       documentation of the front-end interface in this manual.
! 'ONEWS'
       Information about new features in old versions of GCC.  (For recent
       versions, the information is on the GCC web site.)
! 'README.Portability'
       Information about portability issues when writing code in GCC.
       FIXME: why isn't this part of this manual or of the GCC Coding
       Conventions?
  
!  FIXME: document such files in subdirectories, at least 'config', 'c',
! 'cp', 'objc', 'testsuite'.
  
  
  File: gccint.info,  Node: Front End,  Next: Back End,  Prev: Documentation,  Up: gcc Directory
*************** File: gccint.info,  Node: Front End,  Ne
*** 3832,3880 ****
  
  A front end for a language in GCC has the following parts:
  
!    * A directory `LANGUAGE' under `gcc' containing source files for
!      that front end.  *Note The Front End `LANGUAGE' Directory: Front
!      End Directory, for details.
! 
     * A mention of the language in the list of supported languages in
!      `gcc/doc/install.texi'.
! 
     * A mention of the name under which the language's runtime library is
!      recognized by `--enable-shared=PACKAGE' in the documentation of
!      that option in `gcc/doc/install.texi'.
! 
     * A mention of any special prerequisites for building the front end
!      in the documentation of prerequisites in `gcc/doc/install.texi'.
! 
     * Details of contributors to that front end in
!      `gcc/doc/contrib.texi'.  If the details are in that front end's
!      own manual then there should be a link to that manual's list in
!      `contrib.texi'.
! 
     * Information about support for that language in
!      `gcc/doc/frontends.texi'.
! 
     * Information about standards for that language, and the front end's
!      support for them, in `gcc/doc/standards.texi'.  This may be a link
       to such information in the front end's own manual.
! 
!    * Details of source file suffixes for that language and `-x LANG'
!      options supported, in `gcc/doc/invoke.texi'.
! 
!    * Entries in `default_compilers' in `gcc.c' for source file suffixes
       for that language.
! 
!    * Preferably testsuites, which may be under `gcc/testsuite' or
       runtime library directories.  FIXME: document somewhere how to
       write testsuite harnesses.
! 
!    * Probably a runtime library for the language, outside the `gcc'
       directory.  FIXME: document this further.
- 
     * Details of the directories of any runtime libraries in
!      `gcc/doc/sourcebuild.texi'.
! 
!    * Check targets in `Makefile.def' for the top-level `Makefile' to
       check just the compiler or the compiler and runtime library for the
       language.
  
--- 3803,3839 ----
  
  A front end for a language in GCC has the following parts:
  
!    * A directory 'LANGUAGE' under 'gcc' containing source files for that
!      front end.  *Note The Front End 'LANGUAGE' Directory: Front End
!      Directory, for details.
     * A mention of the language in the list of supported languages in
!      'gcc/doc/install.texi'.
     * A mention of the name under which the language's runtime library is
!      recognized by '--enable-shared=PACKAGE' in the documentation of
!      that option in 'gcc/doc/install.texi'.
     * A mention of any special prerequisites for building the front end
!      in the documentation of prerequisites in 'gcc/doc/install.texi'.
     * Details of contributors to that front end in
!      'gcc/doc/contrib.texi'.  If the details are in that front end's own
!      manual then there should be a link to that manual's list in
!      'contrib.texi'.
     * Information about support for that language in
!      'gcc/doc/frontends.texi'.
     * Information about standards for that language, and the front end's
!      support for them, in 'gcc/doc/standards.texi'.  This may be a link
       to such information in the front end's own manual.
!    * Details of source file suffixes for that language and '-x LANG'
!      options supported, in 'gcc/doc/invoke.texi'.
!    * Entries in 'default_compilers' in 'gcc.c' for source file suffixes
       for that language.
!    * Preferably testsuites, which may be under 'gcc/testsuite' or
       runtime library directories.  FIXME: document somewhere how to
       write testsuite harnesses.
!    * Probably a runtime library for the language, outside the 'gcc'
       directory.  FIXME: document this further.
     * Details of the directories of any runtime libraries in
!      'gcc/doc/sourcebuild.texi'.
!    * Check targets in 'Makefile.def' for the top-level 'Makefile' to
       check just the compiler or the compiler and runtime library for the
       language.
  
*************** A front end for a language in GCC has th
*** 3882,4126 ****
  following are also necessary:
  
     * At least one Bugzilla component for bugs in that front end and
!      runtime libraries.  This category needs to be added to the
!      Bugzilla database.
! 
     * Normally, one or more maintainers of that front end listed in
!      `MAINTAINERS'.
! 
!    * Mentions on the GCC web site in `index.html' and `frontends.html',
!      with any relevant links on `readings.html'.  (Front ends that are
!      not an official part of GCC may also be listed on
!      `frontends.html', with relevant links.)
! 
!    * A news item on `index.html', and possibly an announcement on the
       <gcc-announce@gcc.gnu.org> mailing list.
- 
     * The front end's manuals should be mentioned in
!      `maintainer-scripts/update_web_docs_svn' (*note Texinfo Manuals::)
       and the online manuals should be linked to from
!      `onlinedocs/index.html'.
! 
     * Any old releases or CVS repositories of the front end, before its
       inclusion in GCC, should be made available on the GCC FTP site
!      `ftp://gcc.gnu.org/pub/gcc/old-releases/'.
! 
!    * The release and snapshot script `maintainer-scripts/gcc_release'
       should be updated to generate appropriate tarballs for this front
       end.
- 
     * If this front end includes its own version files that include the
!      current date, `maintainer-scripts/update_version' should be
!      updated accordingly.
  
  * Menu:
  
! * Front End Directory::  The front end `LANGUAGE' directory.
! * Front End Config::     The front end `config-lang.in' file.
! * Front End Makefile::   The front end `Make-lang.in' file.
  
  
  File: gccint.info,  Node: Front End Directory,  Next: Front End Config,  Up: Front End
  
! 6.3.8.1 The Front End `LANGUAGE' Directory
  ..........................................
  
! A front end `LANGUAGE' directory contains the source files of that
! front end (but not of any runtime libraries, which should be outside
! the `gcc' directory).  This includes documentation, and possibly some
! subsidiary programs built alongside the front end.  Certain files are
! special and other parts of the compiler depend on their names:
  
! `config-lang.in'
       This file is required in all language subdirectories.  *Note The
!      Front End `config-lang.in' File: Front End Config, for details of
       its contents
! 
! `Make-lang.in'
       This file is required in all language subdirectories.  *Note The
!      Front End `Make-lang.in' File: Front End Makefile, for details of
       its contents.
! 
! `lang.opt'
       This file registers the set of switches that the front end accepts
!      on the command line, and their `--help' text.  *Note Options::.
! 
! `lang-specs.h'
!      This file provides entries for `default_compilers' in `gcc.c'
!      which override the default of giving an error that a compiler for
!      that language is not installed.
! 
! `LANGUAGE-tree.def'
       This file, which need not exist, defines any language-specific tree
       codes.
  
  
  File: gccint.info,  Node: Front End Config,  Next: Front End Makefile,  Prev: Front End Directory,  Up: Front End
  
! 6.3.8.2 The Front End `config-lang.in' File
  ...........................................
  
! Each language subdirectory contains a `config-lang.in' file.  This file
  is a shell script that may define some variables describing the
  language:
  
! `language'
       This definition must be present, and gives the name of the language
!      for some purposes such as arguments to `--enable-languages'.
! 
! `lang_requires'
       If defined, this variable lists (space-separated) language front
       ends other than C that this front end requires to be enabled (with
!      the names given being their `language' settings).  For example, the
       Java front end depends on the C++ front end, so sets
!      `lang_requires=c++'.
! 
! `subdir_requires'
       If defined, this variable lists (space-separated) front end
       directories other than C that this front end requires to be
       present.  For example, the Objective-C++ front end uses source
       files from the C++ and Objective-C front ends, so sets
!      `subdir_requires="cp objc"'.
! 
! `target_libs'
       If defined, this variable lists (space-separated) targets in the
!      top level `Makefile' to build the runtime libraries for this
!      language, such as `target-libobjc'.
! 
! `lang_dirs'
       If defined, this variable lists (space-separated) top level
!      directories (parallel to `gcc'), apart from the runtime libraries,
       that should not be configured if this front end is not built.
! 
! `build_by_default'
!      If defined to `no', this language front end is not built unless
!      enabled in a `--enable-languages' argument.  Otherwise, front ends
       are built by default, subject to any special logic in
!      `configure.ac' (as is present to disable the Ada front end if the
       Ada compiler is not already installed).
! 
! `boot_language'
!      If defined to `yes', this front end is built in stage1 of the
       bootstrap.  This is only relevant to front ends written in their
       own languages.
! 
! `compilers'
       If defined, a space-separated list of compiler executables that
       will be run by the driver.  The names here will each end with
!      `\$(exeext)'.
! 
! `outputs'
       If defined, a space-separated list of files that should be
!      generated by `configure' substituting values in them.  This
!      mechanism can be used to create a file `LANGUAGE/Makefile' from
!      `LANGUAGE/Makefile.in', but this is deprecated, building
!      everything from the single `gcc/Makefile' is preferred.
! 
! `gtfiles'
       If defined, a space-separated list of files that should be scanned
!      by `gengtype.c' to generate the garbage collection tables and
       routines for this language.  This excludes the files that are
       common to all front ends.  *Note Type Information::.
  
- 
  
  File: gccint.info,  Node: Front End Makefile,  Prev: Front End Config,  Up: Front End
  
! 6.3.8.3 The Front End `Make-lang.in' File
  .........................................
  
! Each language subdirectory contains a `Make-lang.in' file.  It contains
! targets `LANG.HOOK' (where `LANG' is the setting of `language' in
! `config-lang.in') for the following values of `HOOK', and any other
  Makefile rules required to build those targets (which may if necessary
! use other Makefiles specified in `outputs' in `config-lang.in',
! although this is deprecated).  It also adds any testsuite targets that
! can use the standard rule in `gcc/Makefile.in' to the variable
! `lang_checks'.
  
! `all.cross'
! `start.encap'
! `rest.encap'
       FIXME: exactly what goes in each of these targets?
! 
! `tags'
!      Build an `etags' `TAGS' file in the language subdirectory in the
       source tree.
! 
! `info'
       Build info documentation for the front end, in the build directory.
!      This target is only called by `make bootstrap' if a suitable
!      version of `makeinfo' is available, so does not need to check for
       this, and should fail if an error occurs.
! 
! `dvi'
       Build DVI documentation for the front end, in the build directory.
!      This should be done using `$(TEXI2DVI)', with appropriate `-I'
       arguments pointing to directories of included files.
! 
! `pdf'
       Build PDF documentation for the front end, in the build directory.
!      This should be done using `$(TEXI2PDF)', with appropriate `-I'
       arguments pointing to directories of included files.
! 
! `html'
       Build HTML documentation for the front end, in the build directory.
! 
! `man'
       Build generated man pages for the front end from Texinfo manuals
       (*note Man Page Generation::), in the build directory.  This target
       is only called if the necessary tools are available, but should
       ignore errors so as not to stop the build if errors occur; man
       pages are optional and the tools involved may be installed in a
       broken way.
! 
! `install-common'
       Install everything that is part of the front end, apart from the
!      compiler executables listed in `compilers' in `config-lang.in'.
! 
! `install-info'
       Install info documentation for the front end, if it is present in
!      the source directory.  This target should have dependencies on
!      info files that should be installed.
! 
! `install-man'
       Install man pages for the front end.  This target should ignore
       errors.
! 
! `install-plugin'
       Install headers needed for plugins.
! 
! `srcextra'
       Copies its dependencies into the source directory.  This generally
!      should be used for generated files such as Bison output files
!      which are not version-controlled, but should be included in any
!      release tarballs.  This target will be executed during a bootstrap
!      if `--enable-generated-files-in-srcdir' was specified as a
!      `configure' option.
! 
! `srcinfo'
! `srcman'
       Copies its dependencies into the source directory.  These targets
       will be executed during a bootstrap if
!      `--enable-generated-files-in-srcdir' was specified as a
!      `configure' option.
! 
! `uninstall'
       Uninstall files installed by installing the compiler.  This is
       currently documented not to be supported, so the hook need not do
       anything.
! 
! `mostlyclean'
! `clean'
! `distclean'
! `maintainer-clean'
!      The language parts of the standard GNU `*clean' targets.  *Note
       Standard Targets for Users: (standards)Standard Targets, for
!      details of the standard targets.  For GCC, `maintainer-clean'
       should delete all generated files in the source directory that are
       not version-controlled, but should not delete anything that is.
  
!  `Make-lang.in' must also define a variable `LANG_OBJS' to a list of
  host object files that are used by that language.
  
  
--- 3841,4049 ----
  following are also necessary:
  
     * At least one Bugzilla component for bugs in that front end and
!      runtime libraries.  This category needs to be added to the Bugzilla
!      database.
     * Normally, one or more maintainers of that front end listed in
!      'MAINTAINERS'.
!    * Mentions on the GCC web site in 'index.html' and 'frontends.html',
!      with any relevant links on 'readings.html'.  (Front ends that are
!      not an official part of GCC may also be listed on 'frontends.html',
!      with relevant links.)
!    * A news item on 'index.html', and possibly an announcement on the
       <gcc-announce@gcc.gnu.org> mailing list.
     * The front end's manuals should be mentioned in
!      'maintainer-scripts/update_web_docs_svn' (*note Texinfo Manuals::)
       and the online manuals should be linked to from
!      'onlinedocs/index.html'.
     * Any old releases or CVS repositories of the front end, before its
       inclusion in GCC, should be made available on the GCC FTP site
!      <ftp://gcc.gnu.org/pub/gcc/old-releases/>.
!    * The release and snapshot script 'maintainer-scripts/gcc_release'
       should be updated to generate appropriate tarballs for this front
       end.
     * If this front end includes its own version files that include the
!      current date, 'maintainer-scripts/update_version' should be updated
!      accordingly.
  
  * Menu:
  
! * Front End Directory::  The front end 'LANGUAGE' directory.
! * Front End Config::     The front end 'config-lang.in' file.
! * Front End Makefile::   The front end 'Make-lang.in' file.
  
  
  File: gccint.info,  Node: Front End Directory,  Next: Front End Config,  Up: Front End
  
! 6.3.8.1 The Front End 'LANGUAGE' Directory
  ..........................................
  
! A front end 'LANGUAGE' directory contains the source files of that front
! end (but not of any runtime libraries, which should be outside the 'gcc'
! directory).  This includes documentation, and possibly some subsidiary
! programs built alongside the front end.  Certain files are special and
! other parts of the compiler depend on their names:
  
! 'config-lang.in'
       This file is required in all language subdirectories.  *Note The
!      Front End 'config-lang.in' File: Front End Config, for details of
       its contents
! 'Make-lang.in'
       This file is required in all language subdirectories.  *Note The
!      Front End 'Make-lang.in' File: Front End Makefile, for details of
       its contents.
! 'lang.opt'
       This file registers the set of switches that the front end accepts
!      on the command line, and their '--help' text.  *Note Options::.
! 'lang-specs.h'
!      This file provides entries for 'default_compilers' in 'gcc.c' which
!      override the default of giving an error that a compiler for that
!      language is not installed.
! 'LANGUAGE-tree.def'
       This file, which need not exist, defines any language-specific tree
       codes.
  
  
  File: gccint.info,  Node: Front End Config,  Next: Front End Makefile,  Prev: Front End Directory,  Up: Front End
  
! 6.3.8.2 The Front End 'config-lang.in' File
  ...........................................
  
! Each language subdirectory contains a 'config-lang.in' file.  This file
  is a shell script that may define some variables describing the
  language:
  
! 'language'
       This definition must be present, and gives the name of the language
!      for some purposes such as arguments to '--enable-languages'.
! 'lang_requires'
       If defined, this variable lists (space-separated) language front
       ends other than C that this front end requires to be enabled (with
!      the names given being their 'language' settings).  For example, the
       Java front end depends on the C++ front end, so sets
!      'lang_requires=c++'.
! 'subdir_requires'
       If defined, this variable lists (space-separated) front end
       directories other than C that this front end requires to be
       present.  For example, the Objective-C++ front end uses source
       files from the C++ and Objective-C front ends, so sets
!      'subdir_requires="cp objc"'.
! 'target_libs'
       If defined, this variable lists (space-separated) targets in the
!      top level 'Makefile' to build the runtime libraries for this
!      language, such as 'target-libobjc'.
! 'lang_dirs'
       If defined, this variable lists (space-separated) top level
!      directories (parallel to 'gcc'), apart from the runtime libraries,
       that should not be configured if this front end is not built.
! 'build_by_default'
!      If defined to 'no', this language front end is not built unless
!      enabled in a '--enable-languages' argument.  Otherwise, front ends
       are built by default, subject to any special logic in
!      'configure.ac' (as is present to disable the Ada front end if the
       Ada compiler is not already installed).
! 'boot_language'
!      If defined to 'yes', this front end is built in stage1 of the
       bootstrap.  This is only relevant to front ends written in their
       own languages.
! 'compilers'
       If defined, a space-separated list of compiler executables that
       will be run by the driver.  The names here will each end with
!      '\$(exeext)'.
! 'outputs'
       If defined, a space-separated list of files that should be
!      generated by 'configure' substituting values in them.  This
!      mechanism can be used to create a file 'LANGUAGE/Makefile' from
!      'LANGUAGE/Makefile.in', but this is deprecated, building everything
!      from the single 'gcc/Makefile' is preferred.
! 'gtfiles'
       If defined, a space-separated list of files that should be scanned
!      by 'gengtype.c' to generate the garbage collection tables and
       routines for this language.  This excludes the files that are
       common to all front ends.  *Note Type Information::.
  
  
  File: gccint.info,  Node: Front End Makefile,  Prev: Front End Config,  Up: Front End
  
! 6.3.8.3 The Front End 'Make-lang.in' File
  .........................................
  
! Each language subdirectory contains a 'Make-lang.in' file.  It contains
! targets 'LANG.HOOK' (where 'LANG' is the setting of 'language' in
! 'config-lang.in') for the following values of 'HOOK', and any other
  Makefile rules required to build those targets (which may if necessary
! use other Makefiles specified in 'outputs' in 'config-lang.in', although
! this is deprecated).  It also adds any testsuite targets that can use
! the standard rule in 'gcc/Makefile.in' to the variable 'lang_checks'.
  
! 'all.cross'
! 'start.encap'
! 'rest.encap'
       FIXME: exactly what goes in each of these targets?
! 'tags'
!      Build an 'etags' 'TAGS' file in the language subdirectory in the
       source tree.
! 'info'
       Build info documentation for the front end, in the build directory.
!      This target is only called by 'make bootstrap' if a suitable
!      version of 'makeinfo' is available, so does not need to check for
       this, and should fail if an error occurs.
! 'dvi'
       Build DVI documentation for the front end, in the build directory.
!      This should be done using '$(TEXI2DVI)', with appropriate '-I'
       arguments pointing to directories of included files.
! 'pdf'
       Build PDF documentation for the front end, in the build directory.
!      This should be done using '$(TEXI2PDF)', with appropriate '-I'
       arguments pointing to directories of included files.
! 'html'
       Build HTML documentation for the front end, in the build directory.
! 'man'
       Build generated man pages for the front end from Texinfo manuals
       (*note Man Page Generation::), in the build directory.  This target
       is only called if the necessary tools are available, but should
       ignore errors so as not to stop the build if errors occur; man
       pages are optional and the tools involved may be installed in a
       broken way.
! 'install-common'
       Install everything that is part of the front end, apart from the
!      compiler executables listed in 'compilers' in 'config-lang.in'.
! 'install-info'
       Install info documentation for the front end, if it is present in
!      the source directory.  This target should have dependencies on info
!      files that should be installed.
! 'install-man'
       Install man pages for the front end.  This target should ignore
       errors.
! 'install-plugin'
       Install headers needed for plugins.
! 'srcextra'
       Copies its dependencies into the source directory.  This generally
!      should be used for generated files such as Bison output files which
!      are not version-controlled, but should be included in any release
!      tarballs.  This target will be executed during a bootstrap if
!      '--enable-generated-files-in-srcdir' was specified as a 'configure'
!      option.
! 'srcinfo'
! 'srcman'
       Copies its dependencies into the source directory.  These targets
       will be executed during a bootstrap if
!      '--enable-generated-files-in-srcdir' was specified as a 'configure'
!      option.
! 'uninstall'
       Uninstall files installed by installing the compiler.  This is
       currently documented not to be supported, so the hook need not do
       anything.
! 'mostlyclean'
! 'clean'
! 'distclean'
! 'maintainer-clean'
!      The language parts of the standard GNU '*clean' targets.  *Note
       Standard Targets for Users: (standards)Standard Targets, for
!      details of the standard targets.  For GCC, 'maintainer-clean'
       should delete all generated files in the source directory that are
       not version-controlled, but should not delete anything that is.
  
!  'Make-lang.in' must also define a variable 'LANG_OBJS' to a list of
  host object files that are used by that language.
  
  
*************** File: gccint.info,  Node: Back End,  Pre
*** 4131,4214 ****
  
  A back end for a target architecture in GCC has the following parts:
  
!    * A directory `MACHINE' under `gcc/config', containing a machine
!      description `MACHINE.md' file (*note Machine Descriptions: Machine
!      Desc.), header files `MACHINE.h' and `MACHINE-protos.h' and a
!      source file `MACHINE.c' (*note Target Description Macros and
       Functions: Target Macros.), possibly a target Makefile fragment
!      `t-MACHINE' (*note The Target Makefile Fragment: Target
!      Fragment.), and maybe some other files.  The names of these files
!      may be changed from the defaults given by explicit specifications
!      in `config.gcc'.
! 
!    * If necessary, a file `MACHINE-modes.def' in the `MACHINE'
       directory, containing additional machine modes to represent
       condition codes.  *Note Condition Code::, for further details.
! 
!    * An optional `MACHINE.opt' file in the `MACHINE' directory,
       containing a list of target-specific options.  You can also add
!      other option files using the `extra_options' variable in
!      `config.gcc'.  *Note Options::.
! 
!    * Entries in `config.gcc' (*note The `config.gcc' File: System
       Config.) for the systems with this target architecture.
! 
!    * Documentation in `gcc/doc/invoke.texi' for any command-line
!      options supported by this target (*note Run-time Target
!      Specification: Run-time Target.).  This means both entries in the
!      summary table of options and details of the individual options.
! 
!    * Documentation in `gcc/doc/extend.texi' for any target-specific
       attributes supported (*note Defining target-specific uses of
!      `__attribute__': Target Attributes.), including where the same
       attribute is already supported on some targets, which are
       enumerated in the manual.
! 
!    * Documentation in `gcc/doc/extend.texi' for any target-specific
       pragmas supported.
! 
!    * Documentation in `gcc/doc/extend.texi' of any target-specific
       built-in functions supported.
! 
!    * Documentation in `gcc/doc/extend.texi' of any target-specific
       format checking styles supported.
! 
!    * Documentation in `gcc/doc/md.texi' of any target-specific
       constraint letters (*note Constraints for Particular Machines:
       Machine Constraints.).
! 
!    * A note in `gcc/doc/contrib.texi' under the person or people who
       contributed the target support.
! 
!    * Entries in `gcc/doc/install.texi' for all target triplets
!      supported with this target architecture, giving details of any
!      special notes about installation for this target, or saying that
!      there are no special notes if there are none.
! 
!    * Possibly other support outside the `gcc' directory for runtime
!      libraries.  FIXME: reference docs for this.  The `libstdc++'
       porting manual needs to be installed as info for this to work, or
       to be a chapter of this manual.
  
   If the back end is added to the official GCC source repository, the
  following are also necessary:
  
!    * An entry for the target architecture in `readings.html' on the GCC
       web site, with any relevant links.
- 
     * Details of the properties of the back end and target architecture
!      in `backends.html' on the GCC web site.
! 
     * A news item about the contribution of support for that target
!      architecture, in `index.html' on the GCC web site.
! 
     * Normally, one or more maintainers of that target listed in
!      `MAINTAINERS'.  Some existing architectures may be unmaintained,
       but it would be unusual to add support for a target that does not
       have a maintainer when support is added.
! 
!    * Target triplets covering all `config.gcc' stanzas for the target,
!      in the list in `contrib/config-list.mk'.
  
  
  File: gccint.info,  Node: Testsuites,  Next: Options,  Prev: Source Tree,  Up: Top
--- 4054,4121 ----
  
  A back end for a target architecture in GCC has the following parts:
  
!    * A directory 'MACHINE' under 'gcc/config', containing a machine
!      description 'MACHINE.md' file (*note Machine Descriptions: Machine
!      Desc.), header files 'MACHINE.h' and 'MACHINE-protos.h' and a
!      source file 'MACHINE.c' (*note Target Description Macros and
       Functions: Target Macros.), possibly a target Makefile fragment
!      't-MACHINE' (*note The Target Makefile Fragment: Target Fragment.),
!      and maybe some other files.  The names of these files may be
!      changed from the defaults given by explicit specifications in
!      'config.gcc'.
!    * If necessary, a file 'MACHINE-modes.def' in the 'MACHINE'
       directory, containing additional machine modes to represent
       condition codes.  *Note Condition Code::, for further details.
!    * An optional 'MACHINE.opt' file in the 'MACHINE' directory,
       containing a list of target-specific options.  You can also add
!      other option files using the 'extra_options' variable in
!      'config.gcc'.  *Note Options::.
!    * Entries in 'config.gcc' (*note The 'config.gcc' File: System
       Config.) for the systems with this target architecture.
!    * Documentation in 'gcc/doc/invoke.texi' for any command-line options
!      supported by this target (*note Run-time Target Specification:
!      Run-time Target.).  This means both entries in the summary table of
!      options and details of the individual options.
!    * Documentation in 'gcc/doc/extend.texi' for any target-specific
       attributes supported (*note Defining target-specific uses of
!      '__attribute__': Target Attributes.), including where the same
       attribute is already supported on some targets, which are
       enumerated in the manual.
!    * Documentation in 'gcc/doc/extend.texi' for any target-specific
       pragmas supported.
!    * Documentation in 'gcc/doc/extend.texi' of any target-specific
       built-in functions supported.
!    * Documentation in 'gcc/doc/extend.texi' of any target-specific
       format checking styles supported.
!    * Documentation in 'gcc/doc/md.texi' of any target-specific
       constraint letters (*note Constraints for Particular Machines:
       Machine Constraints.).
!    * A note in 'gcc/doc/contrib.texi' under the person or people who
       contributed the target support.
!    * Entries in 'gcc/doc/install.texi' for all target triplets supported
!      with this target architecture, giving details of any special notes
!      about installation for this target, or saying that there are no
!      special notes if there are none.
!    * Possibly other support outside the 'gcc' directory for runtime
!      libraries.  FIXME: reference docs for this.  The 'libstdc++'
       porting manual needs to be installed as info for this to work, or
       to be a chapter of this manual.
  
   If the back end is added to the official GCC source repository, the
  following are also necessary:
  
!    * An entry for the target architecture in 'readings.html' on the GCC
       web site, with any relevant links.
     * Details of the properties of the back end and target architecture
!      in 'backends.html' on the GCC web site.
     * A news item about the contribution of support for that target
!      architecture, in 'index.html' on the GCC web site.
     * Normally, one or more maintainers of that target listed in
!      'MAINTAINERS'.  Some existing architectures may be unmaintained,
       but it would be unusual to add support for a target that does not
       have a maintainer when support is added.
!    * Target triplets covering all 'config.gcc' stanzas for the target,
!      in the list in 'contrib/config-list.mk'.
  
  
  File: gccint.info,  Node: Testsuites,  Next: Options,  Prev: Source Tree,  Up: Top
*************** File: gccint.info,  Node: Testsuites,  N
*** 4216,4225 ****
  7 Testsuites
  ************
  
! GCC contains several testsuites to help maintain compiler quality.
! Most of the runtime libraries and language front ends in GCC have
! testsuites.  Currently only the C language testsuites are documented
! here; FIXME: document the others.
  
  * Menu:
  
--- 4123,4132 ----
  7 Testsuites
  ************
  
! GCC contains several testsuites to help maintain compiler quality.  Most
! of the runtime libraries and language front ends in GCC have testsuites.
! Currently only the C language testsuites are documented here; FIXME:
! document the others.
  
  * Menu:
  
*************** File: gccint.info,  Node: Test Idioms,
*** 4240,4281 ****
  7.1 Idioms Used in Testsuite Code
  =================================
  
! In general, C testcases have a trailing `-N.c', starting with `-1.c',
! in case other testcases with similar names are added later.  If the
! test is a test of some well-defined feature, it should have a name
! referring to that feature such as `FEATURE-1.c'.  If it does not test a
! well-defined feature but just happens to exercise a bug somewhere in
! the compiler, and a bug report has been filed for this bug in the GCC
! bug database, `prBUG-NUMBER-1.c' is the appropriate form of name.
! Otherwise (for miscellaneous bugs not filed in the GCC bug database),
! and previously more generally, test cases are named after the date on
! which they were added.  This allows people to tell at a glance whether
! a test failure is because of a recently found bug that has not yet been
! fixed, or whether it may be a regression, but does not give any other
! information about the bug or where discussion of it may be found.  Some
! other language testsuites follow similar conventions.
  
!  In the `gcc.dg' testsuite, it is often necessary to test that an error
  is indeed a hard error and not just a warning--for example, where it is
  a constraint violation in the C standard, which must become an error
! with `-pedantic-errors'.  The following idiom, where the first line
! shown is line LINE of the file and the line that generates the error,
! is used for this:
  
       /* { dg-bogus "warning" "warning in place of error" } */
       /* { dg-error "REGEXP" "MESSAGE" { target *-*-* } LINE } */
  
   It may be necessary to check that an expression is an integer constant
! expression and has a certain value.  To check that `E' has value `V',
! an idiom similar to the following is used:
  
       char x[((E) == (V) ? 1 : -1)];
  
!  In `gcc.dg' tests, `__typeof__' is sometimes used to make assertions
  about the types of expressions.  See, for example,
! `gcc.dg/c99-condexpr-1.c'.  The more subtle uses depend on the exact
  rules for the types of conditional expressions in the C standard; see,
! for example, `gcc.dg/c99-intconst-1.c'.
  
   It is useful to be able to test that optimizations are being made
  properly.  This cannot be done in all cases, but it can be done where
--- 4147,4188 ----
  7.1 Idioms Used in Testsuite Code
  =================================
  
! In general, C testcases have a trailing '-N.c', starting with '-1.c', in
! case other testcases with similar names are added later.  If the test is
! a test of some well-defined feature, it should have a name referring to
! that feature such as 'FEATURE-1.c'.  If it does not test a well-defined
! feature but just happens to exercise a bug somewhere in the compiler,
! and a bug report has been filed for this bug in the GCC bug database,
! 'prBUG-NUMBER-1.c' is the appropriate form of name.  Otherwise (for
! miscellaneous bugs not filed in the GCC bug database), and previously
! more generally, test cases are named after the date on which they were
! added.  This allows people to tell at a glance whether a test failure is
! because of a recently found bug that has not yet been fixed, or whether
! it may be a regression, but does not give any other information about
! the bug or where discussion of it may be found.  Some other language
! testsuites follow similar conventions.
  
!  In the 'gcc.dg' testsuite, it is often necessary to test that an error
  is indeed a hard error and not just a warning--for example, where it is
  a constraint violation in the C standard, which must become an error
! with '-pedantic-errors'.  The following idiom, where the first line
! shown is line LINE of the file and the line that generates the error, is
! used for this:
  
       /* { dg-bogus "warning" "warning in place of error" } */
       /* { dg-error "REGEXP" "MESSAGE" { target *-*-* } LINE } */
  
   It may be necessary to check that an expression is an integer constant
! expression and has a certain value.  To check that 'E' has value 'V', an
! idiom similar to the following is used:
  
       char x[((E) == (V) ? 1 : -1)];
  
!  In 'gcc.dg' tests, '__typeof__' is sometimes used to make assertions
  about the types of expressions.  See, for example,
! 'gcc.dg/c99-condexpr-1.c'.  The more subtle uses depend on the exact
  rules for the types of conditional expressions in the C standard; see,
! for example, 'gcc.dg/c99-intconst-1.c'.
  
   It is useful to be able to test that optimizations are being made
  properly.  This cannot be done in all cases, but it can be done where
*************** the optimization will lead to code being
*** 4283,4290 ****
  where flow analysis or alias analysis should show that certain code
  cannot be called) or to functions not being called because they have
  been expanded as built-in functions.  Such tests go in
! `gcc.c-torture/execute'.  Where code should be optimized away, a call
! to a nonexistent function such as `link_failure ()' may be inserted; a
  definition
  
       #ifndef __OPTIMIZE__
--- 4190,4197 ----
  where flow analysis or alias analysis should show that certain code
  cannot be called) or to functions not being called because they have
  been expanded as built-in functions.  Such tests go in
! 'gcc.c-torture/execute'.  Where code should be optimized away, a call to
! a nonexistent function such as 'link_failure ()' may be inserted; a
  definition
  
       #ifndef __OPTIMIZE__
*************** definition
*** 4296,4306 ****
       #endif
  
  will also be needed so that linking still succeeds when the test is run
! without optimization.  When all calls to a built-in function should
! have been optimized and no calls to the non-built-in version of the
! function should remain, that function may be defined as `static' to
! call `abort ()' (although redeclaring a function as static may not work
! on all targets).
  
   All testcases must be portable.  Target-specific testcases must have
  appropriate code to avoid causing failures on unsupported systems;
--- 4203,4213 ----
       #endif
  
  will also be needed so that linking still succeeds when the test is run
! without optimization.  When all calls to a built-in function should have
! been optimized and no calls to the non-built-in version of the function
! should remain, that function may be defined as 'static' to call 'abort
! ()' (although redeclaring a function as static may not work on all
! targets).
  
   All testcases must be portable.  Target-specific testcases must have
  appropriate code to avoid causing failures on unsupported systems;
*************** File: gccint.info,  Node: Test Directive
*** 4319,4327 ****
  * Directives::  Syntax and descriptions of test directives.
  * Selectors:: Selecting targets to which a test applies.
  * Effective-Target Keywords:: Keywords describing target attributes.
! * Add Options:: Features for `dg-add-options'
! * Require Support:: Variants of `dg-require-SUPPORT'
! * Final Actions:: Commands for use in `dg-final'
  
  
  File: gccint.info,  Node: Directives,  Next: Selectors,  Up: Test Directives
--- 4226,4234 ----
  * Directives::  Syntax and descriptions of test directives.
  * Selectors:: Selecting targets to which a test applies.
  * Effective-Target Keywords:: Keywords describing target attributes.
! * Add Options:: Features for 'dg-add-options'
! * Require Support:: Variants of 'dg-require-SUPPORT'
! * Final Actions:: Commands for use in 'dg-final'
  
  
  File: gccint.info,  Node: Directives,  Next: Selectors,  Up: Test Directives
*************** File: gccint.info,  Node: Directives,  N
*** 4330,4336 ****
  ------------------------------------------------
  
  Test directives appear within comments in a test source file and begin
! with `dg-'.  Some of these are defined within DejaGnu and others are
  local to the GCC testsuite.
  
   The order in which test directives appear in a test can be important:
--- 4237,4243 ----
  ------------------------------------------------
  
  Test directives appear within comments in a test source file and begin
! with 'dg-'.  Some of these are defined within DejaGnu and others are
  local to the GCC testsuite.
  
   The order in which test directives appear in a test can be important:
*************** directives local to GCC sometimes overri
*** 4338,4398 ****
  DejaGnu directives, which know nothing about the GCC directives, so the
  DejaGnu directives must precede GCC directives.
  
!  Several test directives include selectors (*note Selectors::) which
! are usually preceded by the keyword `target' or `xfail'.
  
  7.2.1.1 Specify how to build the test
  .....................................
  
! `{ dg-do DO-WHAT-KEYWORD [{ target/xfail SELECTOR }] }'
       DO-WHAT-KEYWORD specifies how the test is compiled and whether it
       is executed.  It is one of:
  
!     `preprocess'
!           Compile with `-E' to run only the preprocessor.
! 
!     `compile'
!           Compile with `-S' to produce an assembly code file.
! 
!     `assemble'
!           Compile with `-c' to produce a relocatable object file.
! 
!     `link'
            Compile, assemble, and link to produce an executable file.
! 
!     `run'
            Produce and run an executable file, which is expected to
            return an exit code of 0.
  
!      The default is `compile'.  That can be overridden for a set of
!      tests by redefining `dg-do-what-default' within the `.exp' file
!      for those tests.
  
!      If the directive includes the optional `{ target SELECTOR }' then
       the test is skipped unless the target system matches the SELECTOR.
  
!      If DO-WHAT-KEYWORD is `run' and the directive includes the
!      optional `{ xfail SELECTOR }' and the selector is met then the
!      test is expected to fail.  The `xfail' clause is ignored for other
!      values of DO-WHAT-KEYWORD; those tests can use directive
!      `dg-xfail-if'.
  
  7.2.1.2 Specify additional compiler options
  ...........................................
  
! `{ dg-options OPTIONS [{ target SELECTOR }] }'
       This DejaGnu directive provides a list of compiler options, to be
       used if the target system matches SELECTOR, that replace the
       default options used for this set of tests.
  
! `{ dg-add-options FEATURE ... }'
       Add any compiler options that are needed to access certain
       features.  This directive does nothing on targets that enable the
       features by default, or that don't provide them at all.  It must
!      come after all `dg-options' directives.  For supported values of
       FEATURE see *note Add Options::.
  
! `{ dg-additional-options OPTIONS [{ target SELECTOR }] }'
       This directive provides a list of compiler options, to be used if
       the target system matches SELECTOR, that are added to the default
       options used for this set of tests.
--- 4245,4300 ----
  DejaGnu directives, which know nothing about the GCC directives, so the
  DejaGnu directives must precede GCC directives.
  
!  Several test directives include selectors (*note Selectors::) which are
! usually preceded by the keyword 'target' or 'xfail'.
  
  7.2.1.1 Specify how to build the test
  .....................................
  
! '{ dg-do DO-WHAT-KEYWORD [{ target/xfail SELECTOR }] }'
       DO-WHAT-KEYWORD specifies how the test is compiled and whether it
       is executed.  It is one of:
  
!      'preprocess'
!           Compile with '-E' to run only the preprocessor.
!      'compile'
!           Compile with '-S' to produce an assembly code file.
!      'assemble'
!           Compile with '-c' to produce a relocatable object file.
!      'link'
            Compile, assemble, and link to produce an executable file.
!      'run'
            Produce and run an executable file, which is expected to
            return an exit code of 0.
  
!      The default is 'compile'.  That can be overridden for a set of
!      tests by redefining 'dg-do-what-default' within the '.exp' file for
!      those tests.
  
!      If the directive includes the optional '{ target SELECTOR }' then
       the test is skipped unless the target system matches the SELECTOR.
  
!      If DO-WHAT-KEYWORD is 'run' and the directive includes the optional
!      '{ xfail SELECTOR }' and the selector is met then the test is
!      expected to fail.  The 'xfail' clause is ignored for other values
!      of DO-WHAT-KEYWORD; those tests can use directive 'dg-xfail-if'.
  
  7.2.1.2 Specify additional compiler options
  ...........................................
  
! '{ dg-options OPTIONS [{ target SELECTOR }] }'
       This DejaGnu directive provides a list of compiler options, to be
       used if the target system matches SELECTOR, that replace the
       default options used for this set of tests.
  
! '{ dg-add-options FEATURE ... }'
       Add any compiler options that are needed to access certain
       features.  This directive does nothing on targets that enable the
       features by default, or that don't provide them at all.  It must
!      come after all 'dg-options' directives.  For supported values of
       FEATURE see *note Add Options::.
  
! '{ dg-additional-options OPTIONS [{ target SELECTOR }] }'
       This directive provides a list of compiler options, to be used if
       the target system matches SELECTOR, that are added to the default
       options used for this set of tests.
*************** are usually preceded by the keyword `tar
*** 4403,4409 ****
  The normal timeout limit, in seconds, is found by searching the
  following in order:
  
!    * the value defined by an earlier `dg-timeout' directive in the test
  
     * variable TOOL_TIMEOUT defined by the set of tests
  
--- 4305,4311 ----
  The normal timeout limit, in seconds, is found by searching the
  following in order:
  
!    * the value defined by an earlier 'dg-timeout' directive in the test
  
     * variable TOOL_TIMEOUT defined by the set of tests
  
*************** following in order:
*** 4411,4428 ****
  
     * 300
  
! `{ dg-timeout N [{target SELECTOR }] }'
!      Set the time limit for the compilation and for the execution of
!      the test to the specified number of seconds.
  
! `{ dg-timeout-factor X [{ target SELECTOR }] }'
!      Multiply the normal time limit for compilation and execution of
!      the test by the specified floating-point factor.
  
  7.2.1.4 Skip a test for some targets
  ....................................
  
! `{ dg-skip-if COMMENT { SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]] }'
       Arguments INCLUDE-OPTS and EXCLUDE-OPTS are lists in which each
       element is a string of zero or more GCC options.  Skip the test if
       all of the following conditions are met:
--- 4313,4330 ----
  
     * 300
  
! '{ dg-timeout N [{target SELECTOR }] }'
!      Set the time limit for the compilation and for the execution of the
!      test to the specified number of seconds.
  
! '{ dg-timeout-factor X [{ target SELECTOR }] }'
!      Multiply the normal time limit for compilation and execution of the
!      test by the specified floating-point factor.
  
  7.2.1.4 Skip a test for some targets
  ....................................
  
! '{ dg-skip-if COMMENT { SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]] }'
       Arguments INCLUDE-OPTS and EXCLUDE-OPTS are lists in which each
       element is a string of zero or more GCC options.  Skip the test if
       all of the following conditions are met:
*************** following in order:
*** 4430,4479 ****
  
          * for at least one of the option strings in INCLUDE-OPTS, every
            option from that string is in the set of options with which
!           the test would be compiled; use `"*"' for an INCLUDE-OPTS list
            that matches any options; that is the default if INCLUDE-OPTS
            is not specified
  
          * for each of the option strings in EXCLUDE-OPTS, at least one
            option from that string is not in the set of options with
!           which the test would be compiled; use `""' for an empty
            EXCLUDE-OPTS list; that is the default if EXCLUDE-OPTS is not
            specified
  
!      For example, to skip a test if option `-Os' is present:
  
            /* { dg-skip-if "" { *-*-* }  { "-Os" } { "" } } */
  
!      To skip a test if both options `-O2' and `-g' are present:
  
            /* { dg-skip-if "" { *-*-* }  { "-O2 -g" } { "" } } */
  
!      To skip a test if either `-O2' or `-O3' is present:
  
            /* { dg-skip-if "" { *-*-* }  { "-O2" "-O3" } { "" } } */
  
!      To skip a test unless option `-Os' is present:
  
            /* { dg-skip-if "" { *-*-* }  { "*" } { "-Os" } } */
  
!      To skip a test if either `-O2' or `-O3' is used with `-g' but not
!      if `-fpic' is also present:
  
            /* { dg-skip-if "" { *-*-* }  { "-O2 -g" "-O3 -g" } { "-fpic" } } */
  
! `{ dg-require-effective-target KEYWORD [{ SELECTOR }] }'
       Skip the test if the test target, including current multilib flags,
       is not covered by the effective-target keyword.  If the directive
!      includes the optional `{ SELECTOR }' then the effective-target
!      test is only performed if the target system matches the SELECTOR.
!      This directive must appear after any `dg-do' directive in the test
!      and before any `dg-additional-sources' directive.  *Note
       Effective-Target Keywords::.
  
! `{ dg-require-SUPPORT args }'
       Skip the test if the target does not provide the required support.
!      These directives must appear after any `dg-do' directive in the
!      test and before any `dg-additional-sources' directive.  They
       require at least one argument, which can be an empty string if the
       specific procedure does not examine the argument.  *Note Require
       Support::, for a complete list of these directives.
--- 4332,4381 ----
  
          * for at least one of the option strings in INCLUDE-OPTS, every
            option from that string is in the set of options with which
!           the test would be compiled; use '"*"' for an INCLUDE-OPTS list
            that matches any options; that is the default if INCLUDE-OPTS
            is not specified
  
          * for each of the option strings in EXCLUDE-OPTS, at least one
            option from that string is not in the set of options with
!           which the test would be compiled; use '""' for an empty
            EXCLUDE-OPTS list; that is the default if EXCLUDE-OPTS is not
            specified
  
!      For example, to skip a test if option '-Os' is present:
  
            /* { dg-skip-if "" { *-*-* }  { "-Os" } { "" } } */
  
!      To skip a test if both options '-O2' and '-g' are present:
  
            /* { dg-skip-if "" { *-*-* }  { "-O2 -g" } { "" } } */
  
!      To skip a test if either '-O2' or '-O3' is present:
  
            /* { dg-skip-if "" { *-*-* }  { "-O2" "-O3" } { "" } } */
  
!      To skip a test unless option '-Os' is present:
  
            /* { dg-skip-if "" { *-*-* }  { "*" } { "-Os" } } */
  
!      To skip a test if either '-O2' or '-O3' is used with '-g' but not
!      if '-fpic' is also present:
  
            /* { dg-skip-if "" { *-*-* }  { "-O2 -g" "-O3 -g" } { "-fpic" } } */
  
! '{ dg-require-effective-target KEYWORD [{ SELECTOR }] }'
       Skip the test if the test target, including current multilib flags,
       is not covered by the effective-target keyword.  If the directive
!      includes the optional '{ SELECTOR }' then the effective-target test
!      is only performed if the target system matches the SELECTOR.  This
!      directive must appear after any 'dg-do' directive in the test and
!      before any 'dg-additional-sources' directive.  *Note
       Effective-Target Keywords::.
  
! '{ dg-require-SUPPORT args }'
       Skip the test if the target does not provide the required support.
!      These directives must appear after any 'dg-do' directive in the
!      test and before any 'dg-additional-sources' directive.  They
       require at least one argument, which can be an empty string if the
       specific procedure does not examine the argument.  *Note Require
       Support::, for a complete list of these directives.
*************** following in order:
*** 4481,4571 ****
  7.2.1.5 Expect a test to fail for some targets
  ..............................................
  
! `{ dg-xfail-if COMMENT { SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]] }'
       Expect the test to fail if the conditions (which are the same as
!      for `dg-skip-if') are met.  This does not affect the execute step.
  
! `{ dg-xfail-run-if COMMENT { SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]] }'
       Expect the execute step of a test to fail if the conditions (which
!      are the same as for `dg-skip-if') are met.
  
  7.2.1.6 Expect the test executable to fail
  ..........................................
  
! `{ dg-shouldfail COMMENT [{ SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]]] }'
       Expect the test executable to return a nonzero exit status if the
!      conditions (which are the same as for `dg-skip-if') are met.
  
  7.2.1.7 Verify compiler messages
  ................................
  
! `{ dg-error REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] }]] }'
!      This DejaGnu directive appears on a source line that is expected
!      to get an error message, or else specifies the source line
!      associated with the message.  If there is no message for that line
!      or if the text of that message is not matched by REGEXP then the
!      check fails and COMMENT is included in the `FAIL' message.  The
!      check does not look for the string `error' unless it is part of
!      REGEXP.
  
! `{ dg-warning REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] }]] }'
!      This DejaGnu directive appears on a source line that is expected
!      to get a warning message, or else specifies the source line
!      associated with the message.  If there is no message for that line
!      or if the text of that message is not matched by REGEXP then the
!      check fails and COMMENT is included in the `FAIL' message.  The
!      check does not look for the string `warning' unless it is part of
!      REGEXP.
  
! `{ dg-message REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] }]] }'
       The line is expected to get a message other than an error or
       warning.  If there is no message for that line or if the text of
       that message is not matched by REGEXP then the check fails and
!      COMMENT is included in the `FAIL' message.
  
! `{ dg-bogus REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] }]] }'
!      This DejaGnu directive appears on a source line that should not
!      get a message matching REGEXP, or else specifies the source line
!      associated with the bogus message.  It is usually used with `xfail'
       to indicate that the message is a known problem for a particular
       set of targets.
  
! `{ dg-excess-errors COMMENT [{ target/xfail SELECTOR }] }'
       This DejaGnu directive indicates that the test is expected to fail
!      due to compiler messages that are not handled by `dg-error',
!      `dg-warning' or `dg-bogus'.  For this directive `xfail' has the
!      same effect as `target'.
  
! `{ dg-prune-output REGEXP }'
       Prune messages matching REGEXP from the test output.
  
  7.2.1.8 Verify output of the test executable
  ............................................
  
! `{ dg-output REGEXP [{ target/xfail SELECTOR }] }'
       This DejaGnu directive compares REGEXP to the combined output that
!      the test executable writes to `stdout' and `stderr'.
  
  7.2.1.9 Specify additional files for a test
  ...........................................
  
! `{ dg-additional-files "FILELIST" }'
       Specify additional files, other than source files, that must be
       copied to the system where the compiler runs.
  
! `{ dg-additional-sources "FILELIST" }'
       Specify additional source files to appear in the compile line
       following the main test file.
  
  7.2.1.10 Add checks at the end of a test
  ........................................
  
! `{ dg-final { LOCAL-DIRECTIVE } }'
       This DejaGnu directive is placed within a comment anywhere in the
       source file and is processed after the test has been compiled and
!      run.  Multiple `dg-final' commands are processed in the order in
!      which they appear in the source file.  *Note Final Actions::, for
!      a list of directives that can be used within `dg-final'.
  
  
  File: gccint.info,  Node: Selectors,  Next: Effective-Target Keywords,  Prev: Directives,  Up: Test Directives
--- 4383,4471 ----
  7.2.1.5 Expect a test to fail for some targets
  ..............................................
  
! '{ dg-xfail-if COMMENT { SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]] }'
       Expect the test to fail if the conditions (which are the same as
!      for 'dg-skip-if') are met.  This does not affect the execute step.
  
! '{ dg-xfail-run-if COMMENT { SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]] }'
       Expect the execute step of a test to fail if the conditions (which
!      are the same as for 'dg-skip-if') are met.
  
  7.2.1.6 Expect the test executable to fail
  ..........................................
  
! '{ dg-shouldfail COMMENT [{ SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]]] }'
       Expect the test executable to return a nonzero exit status if the
!      conditions (which are the same as for 'dg-skip-if') are met.
  
  7.2.1.7 Verify compiler messages
  ................................
  
! '{ dg-error REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] }]] }'
!      This DejaGnu directive appears on a source line that is expected to
!      get an error message, or else specifies the source line associated
!      with the message.  If there is no message for that line or if the
!      text of that message is not matched by REGEXP then the check fails
!      and COMMENT is included in the 'FAIL' message.  The check does not
!      look for the string 'error' unless it is part of REGEXP.
  
! '{ dg-warning REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] }]] }'
!      This DejaGnu directive appears on a source line that is expected to
!      get a warning message, or else specifies the source line associated
!      with the message.  If there is no message for that line or if the
!      text of that message is not matched by REGEXP then the check fails
!      and COMMENT is included in the 'FAIL' message.  The check does not
!      look for the string 'warning' unless it is part of REGEXP.
  
! '{ dg-message REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] }]] }'
       The line is expected to get a message other than an error or
       warning.  If there is no message for that line or if the text of
       that message is not matched by REGEXP then the check fails and
!      COMMENT is included in the 'FAIL' message.
  
! '{ dg-bogus REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] }]] }'
!      This DejaGnu directive appears on a source line that should not get
!      a message matching REGEXP, or else specifies the source line
!      associated with the bogus message.  It is usually used with 'xfail'
       to indicate that the message is a known problem for a particular
       set of targets.
  
! '{ dg-excess-errors COMMENT [{ target/xfail SELECTOR }] }'
       This DejaGnu directive indicates that the test is expected to fail
!      due to compiler messages that are not handled by 'dg-error',
!      'dg-warning' or 'dg-bogus'.  For this directive 'xfail' has the
!      same effect as 'target'.
  
! '{ dg-prune-output REGEXP }'
       Prune messages matching REGEXP from the test output.
  
  7.2.1.8 Verify output of the test executable
  ............................................
  
! '{ dg-output REGEXP [{ target/xfail SELECTOR }] }'
       This DejaGnu directive compares REGEXP to the combined output that
!      the test executable writes to 'stdout' and 'stderr'.
  
  7.2.1.9 Specify additional files for a test
  ...........................................
  
! '{ dg-additional-files "FILELIST" }'
       Specify additional files, other than source files, that must be
       copied to the system where the compiler runs.
  
! '{ dg-additional-sources "FILELIST" }'
       Specify additional source files to appear in the compile line
       following the main test file.
  
  7.2.1.10 Add checks at the end of a test
  ........................................
  
! '{ dg-final { LOCAL-DIRECTIVE } }'
       This DejaGnu directive is placed within a comment anywhere in the
       source file and is processed after the test has been compiled and
!      run.  Multiple 'dg-final' commands are processed in the order in
!      which they appear in the source file.  *Note Final Actions::, for a
!      list of directives that can be used within 'dg-final'.
  
  
  File: gccint.info,  Node: Selectors,  Next: Effective-Target Keywords,  Prev: Directives,  Up: Test Directives
*************** File: gccint.info,  Node: Selectors,  Ne
*** 4573,4599 ****
  7.2.2 Selecting targets to which a test applies
  -----------------------------------------------
  
! Several test directives include SELECTORs to limit the targets for
! which a test is run or to declare that a test is expected to fail on
  particular targets.
  
   A selector is:
     * one or more target triplets, possibly including wildcard
!      characters; use `*-*-*' to match any target
! 
     * a single effective-target keyword (*note Effective-Target
       Keywords::)
- 
     * a logical expression
  
   Depending on the context, the selector specifies whether a test is
  skipped and reported as unsupported or is expected to fail.  A context
! that allows either `target' or `xfail' also allows `{ target SELECTOR1
  xfail SELECTOR2 }' to skip the test for targets that don't match
  SELECTOR1 and the test to fail for targets that match SELECTOR2.
  
   A selector expression appears within curly braces and uses a single
! logical operator: one of `!', `&&', or `||'.  An operand is another
  selector expression, an effective-target keyword, a single target
  triplet, or a list of target triplets within quotes or curly braces.
  For example:
--- 4473,4497 ----
  7.2.2 Selecting targets to which a test applies
  -----------------------------------------------
  
! Several test directives include SELECTORs to limit the targets for which
! a test is run or to declare that a test is expected to fail on
  particular targets.
  
   A selector is:
     * one or more target triplets, possibly including wildcard
!      characters; use '*-*-*' to match any target
     * a single effective-target keyword (*note Effective-Target
       Keywords::)
     * a logical expression
  
   Depending on the context, the selector specifies whether a test is
  skipped and reported as unsupported or is expected to fail.  A context
! that allows either 'target' or 'xfail' also allows '{ target SELECTOR1
  xfail SELECTOR2 }' to skip the test for targets that don't match
  SELECTOR1 and the test to fail for targets that match SELECTOR2.
  
   A selector expression appears within curly braces and uses a single
! logical operator: one of '!', '&&', or '||'.  An operand is another
  selector expression, an effective-target keyword, a single target
  triplet, or a list of target triplets within quotes or curly braces.
  For example:
*************** particular functionality.  They are used
*** 4613,5561 ****
  for particular targets, or to specify that particular sets of targets
  are expected to fail some tests.
  
!  Effective-target keywords are defined in `lib/target-supports.exp' in
  the GCC testsuite, with the exception of those that are documented as
  being local to a particular test directory.
  
!  The `effective target' takes into account all of the compiler options
  with which the test will be compiled, including the multilib options.
! By convention, keywords ending in `_nocache' can also include options
! specified for the particular test in an earlier `dg-options' or
! `dg-add-options' directive.
  
  7.2.3.1 Data type sizes
  .......................
  
! `ilp32'
!      Target has 32-bit `int', `long', and pointers.
  
! `lp64'
!      Target has 32-bit `int', 64-bit `long' and pointers.
  
! `llp64'
!      Target has 32-bit `int' and `long', 64-bit `long long' and
       pointers.
  
! `double64'
!      Target has 64-bit `double'.
  
! `double64plus'
!      Target has `double' that is 64 bits or longer.
  
! `longdouble128'
!      Target has 128-bit `long double'.
  
! `int32plus'
!      Target has `int' that is at 32 bits or longer.
  
! `int16'
!      Target has `int' that is 16 bits or shorter.
  
! `long_neq_int'
!      Target has `int' and `long' with different sizes.
  
! `large_double'
!      Target supports `double' that is longer than `float'.
  
! `large_long_double'
!      Target supports `long double' that is longer than `double'.
  
! `ptr32plus'
       Target has pointers that are 32 bits or longer.
  
! `size32plus'
       Target supports array and structure sizes that are 32 bits or
       longer.
  
! `4byte_wchar_t'
!      Target has `wchar_t' that is at least 4 bytes.
  
  7.2.3.2 Fortran-specific attributes
  ...................................
  
! `fortran_integer_16'
!      Target supports Fortran `integer' that is 16 bytes or longer.
  
! `fortran_large_int'
!      Target supports Fortran `integer' kinds larger than `integer(8)'.
  
! `fortran_large_real'
!      Target supports Fortran `real' kinds larger than `real(8)'.
  
  7.2.3.3 Vector-specific attributes
  ..................................
  
! `vect_condition'
       Target supports vector conditional operations.
  
! `vect_double'
!      Target supports hardware vectors of `double'.
  
! `vect_float'
!      Target supports hardware vectors of `float'.
  
! `vect_int'
!      Target supports hardware vectors of `int'.
  
! `vect_long'
!      Target supports hardware vectors of `long'.
  
! `vect_long_long'
!      Target supports hardware vectors of `long long'.
  
! `vect_aligned_arrays'
       Target aligns arrays to vector alignment boundary.
  
! `vect_hw_misalign'
       Target supports a vector misalign access.
  
! `vect_no_align'
       Target does not support a vector alignment mechanism.
  
! `vect_no_int_max'
!      Target does not support a vector max instruction on `int'.
  
! `vect_no_int_add'
!      Target does not support a vector add instruction on `int'.
  
! `vect_no_bitwise'
       Target does not support vector bitwise instructions.
  
! `vect_char_mult'
!      Target supports `vector char' multiplication.
  
! `vect_short_mult'
!      Target supports `vector short' multiplication.
  
! `vect_int_mult'
!      Target supports `vector int' multiplication.
  
! `vect_extract_even_odd'
       Target supports vector even/odd element extraction.
  
! `vect_extract_even_odd_wide'
       Target supports vector even/odd element extraction of vectors with
!      elements `SImode' or larger.
  
! `vect_interleave'
       Target supports vector interleaving.
  
! `vect_strided'
       Target supports vector interleaving and extract even/odd.
  
! `vect_strided_wide'
       Target supports vector interleaving and extract even/odd for wide
       element types.
  
! `vect_perm'
       Target supports vector permutation.
  
! `vect_shift'
       Target supports a hardware vector shift operation.
  
! `vect_widen_sum_hi_to_si'
!      Target supports a vector widening summation of `short' operands
!      into `int' results, or can promote (unpack) from `short' to `int'.
  
! `vect_widen_sum_qi_to_hi'
!      Target supports a vector widening summation of `char' operands
!      into `short' results, or can promote (unpack) from `char' to
!      `short'.
  
! `vect_widen_sum_qi_to_si'
!      Target supports a vector widening summation of `char' operands
!      into `int' results.
  
! `vect_widen_mult_qi_to_hi'
!      Target supports a vector widening multiplication of `char' operands
!      into `short' results, or can promote (unpack) from `char' to
!      `short' and perform non-widening multiplication of `short'.
  
! `vect_widen_mult_hi_to_si'
!      Target supports a vector widening multiplication of `short'
!      operands into `int' results, or can promote (unpack) from `short'
!      to `int' and perform non-widening multiplication of `int'.
  
! `vect_widen_mult_si_to_di_pattern'
!      Target supports a vector widening multiplication of `int' operands
!      into `long' results.
  
! `vect_sdot_qi'
!      Target supports a vector dot-product of `signed char'.
  
! `vect_udot_qi'
!      Target supports a vector dot-product of `unsigned char'.
  
! `vect_sdot_hi'
!      Target supports a vector dot-product of `signed short'.
  
! `vect_udot_hi'
!      Target supports a vector dot-product of `unsigned short'.
  
! `vect_pack_trunc'
!      Target supports a vector demotion (packing) of `short' to `char'
!      and from `int' to `short' using modulo arithmetic.
  
! `vect_unpack'
!      Target supports a vector promotion (unpacking) of `char' to `short'
!      and from `char' to `int'.
  
! `vect_intfloat_cvt'
!      Target supports conversion from `signed int' to `float'.
  
! `vect_uintfloat_cvt'
!      Target supports conversion from `unsigned int' to `float'.
  
! `vect_floatint_cvt'
!      Target supports conversion from `float' to `signed int'.
  
! `vect_floatuint_cvt'
!      Target supports conversion from `float' to `unsigned int'.
  
  7.2.3.4 Thread Local Storage attributes
  .......................................
  
! `tls'
       Target supports thread-local storage.
  
! `tls_native'
       Target supports native (rather than emulated) thread-local storage.
  
! `tls_runtime'
       Test system supports executing TLS executables.
  
  7.2.3.5 Decimal floating point attributes
  .........................................
  
! `dfp'
       Targets supports compiling decimal floating point extension to C.
  
! `dfp_nocache'
       Including the options used to compile this particular test, the
       target supports compiling decimal floating point extension to C.
  
! `dfprt'
       Test system can execute decimal floating point tests.
  
! `dfprt_nocache'
       Including the options used to compile this particular test, the
       test system can execute decimal floating point tests.
  
! `hard_dfp'
       Target generates decimal floating point instructions with current
       options.
  
  7.2.3.6 ARM-specific attributes
  ...............................
  
! `arm32'
       ARM target generates 32-bit code.
  
! `arm_eabi'
       ARM target adheres to the ABI for the ARM Architecture.
  
! `arm_hf_eabi'
       ARM target adheres to the VFP and Advanced SIMD Register Arguments
       variant of the ABI for the ARM Architecture (as selected with
!      `-mfloat-abi=hard').
  
! `arm_hard_vfp_ok'
!      ARM target supports `-mfpu=vfp -mfloat-abi=hard'.  Some multilibs
       may be incompatible with these options.
  
! `arm_iwmmxt_ok'
!      ARM target supports `-mcpu=iwmmxt'.  Some multilibs may be
       incompatible with this option.
  
! `arm_neon'
       ARM target supports generating NEON instructions.
  
! `arm_tune_string_ops_prefer_neon'
       Test CPU tune supports inlining string operations with NEON
       instructions.
  
! `arm_neon_hw'
       Test system supports executing NEON instructions.
  
! `arm_neonv2_hw'
       Test system supports executing NEON v2 instructions.
  
! `arm_neon_ok'
!      ARM Target supports `-mfpu=neon -mfloat-abi=softfp' or compatible
       options.  Some multilibs may be incompatible with these options.
  
! `arm_neonv2_ok'
!      ARM Target supports `-mfpu=neon-vfpv4 -mfloat-abi=softfp' or
       compatible options.  Some multilibs may be incompatible with these
       options.
  
! `arm_neon_fp16_ok'
!      ARM Target supports `-mfpu=neon-fp16 -mfloat-abi=softfp' or
       compatible options.  Some multilibs may be incompatible with these
       options.
  
! `arm_thumb1_ok'
!      ARM target generates Thumb-1 code for `-mthumb'.
  
! `arm_thumb2_ok'
!      ARM target generates Thumb-2 code for `-mthumb'.
  
! `arm_vfp_ok'
!      ARM target supports `-mfpu=vfp -mfloat-abi=softfp'.  Some
!      multilibs may be incompatible with these options.
  
! `arm_vfp3_ok'
!      ARM target supports `-mfpu=vfp3 -mfloat-abi=softfp'.  Some
       multilibs may be incompatible with these options.
  
! `arm_v8_vfp_ok'
!      ARM target supports `-mfpu=fp-armv8 -mfloat-abi=softfp'.  Some
       multilibs may be incompatible with these options.
  
! `arm_v8_neon_ok'
!      ARM target supports `-mfpu=neon-fp-armv8 -mfloat-abi=softfp'.
!      Some multilibs may be incompatible with these options.
! 
! `arm_prefer_ldrd_strd'
!      ARM target prefers `LDRD' and `STRD' instructions over `LDM' and
!      `STM' instructions.
  
  
  7.2.3.7 MIPS-specific attributes
  ................................
  
! `mips64'
       MIPS target supports 64-bit instructions.
  
! `nomips16'
       MIPS target does not produce MIPS16 code.
  
! `mips16_attribute'
       MIPS target can generate MIPS16 code.
  
! `mips_loongson'
       MIPS target is a Loongson-2E or -2F target using an ABI that
       supports the Loongson vector modes.
  
! `mips_newabi_large_long_double'
!      MIPS target supports `long double' larger than `double' when using
       the new ABI.
  
! `mpaired_single'
!      MIPS target supports `-mpaired-single'.
  
  7.2.3.8 PowerPC-specific attributes
  ...................................
  
! `dfp_hw'
       PowerPC target supports executing hardware DFP instructions.
  
! `p8vector_hw'
       PowerPC target supports executing VSX instructions (ISA 2.07).
  
! `powerpc64'
       Test system supports executing 64-bit instructions.
  
! `powerpc_altivec'
       PowerPC target supports AltiVec.
  
! `powerpc_altivec_ok'
!      PowerPC target supports `-maltivec'.
  
! `powerpc_eabi_ok'
!      PowerPC target supports `-meabi'.
  
! `powerpc_elfv2'
!      PowerPC target supports `-mabi=elfv2'.
  
! `powerpc_fprs'
       PowerPC target supports floating-point registers.
  
! `powerpc_hard_double'
       PowerPC target supports hardware double-precision floating-point.
  
! `powerpc_htm_ok'
!      PowerPC target supports `-mhtm'
  
! `powerpc_p8vector_ok'
!      PowerPC target supports `-mpower8-vector'
  
! `powerpc_ppu_ok'
!      PowerPC target supports `-mcpu=cell'.
  
! `powerpc_spe'
       PowerPC target supports PowerPC SPE.
  
! `powerpc_spe_nocache'
       Including the options used to compile this particular test, the
       PowerPC target supports PowerPC SPE.
  
! `powerpc_spu'
       PowerPC target supports PowerPC SPU.
  
! `powerpc_vsx_ok'
!      PowerPC target supports `-mvsx'.
  
! `powerpc_405_nocache'
       Including the options used to compile this particular test, the
       PowerPC target supports PowerPC 405.
  
! `ppc_recip_hw'
       PowerPC target supports executing reciprocal estimate instructions.
  
! `spu_auto_overlay'
       SPU target has toolchain that supports automatic overlay
       generation.
  
! `vmx_hw'
       PowerPC target supports executing AltiVec instructions.
  
! `vsx_hw'
       PowerPC target supports executing VSX instructions (ISA 2.06).
  
  7.2.3.9 Other hardware attributes
  .................................
  
! `avx'
!      Target supports compiling `avx' instructions.
  
! `avx_runtime'
!      Target supports the execution of `avx' instructions.
  
! `cell_hw'
       Test system can execute AltiVec and Cell PPU instructions.
  
! `coldfire_fpu'
       Target uses a ColdFire FPU.
  
! `hard_float'
       Target supports FPU instructions.
  
! `non_strict_align'
       Target does not require strict alignment.
  
! `sse'
!      Target supports compiling `sse' instructions.
  
! `sse_runtime'
!      Target supports the execution of `sse' instructions.
  
! `sse2'
!      Target supports compiling `sse2' instructions.
  
! `sse2_runtime'
!      Target supports the execution of `sse2' instructions.
  
! `sync_char_short'
!      Target supports atomic operations on `char' and `short'.
  
! `sync_int_long'
!      Target supports atomic operations on `int' and `long'.
  
! `ultrasparc_hw'
       Test environment appears to run executables on a simulator that
!      accepts only `EM_SPARC' executables and chokes on `EM_SPARC32PLUS'
!      or `EM_SPARCV9' executables.
  
! `vect_cmdline_needed'
       Target requires a command line argument to enable a SIMD
       instruction set.
  
! `pie_copyreloc'
       The x86-64 target linker supports PIE with copy reloc.
  
  7.2.3.10 Environment attributes
  ...............................
  
! `c'
       The language for the compiler under test is C.
  
! `c++'
       The language for the compiler under test is C++.
  
! `c99_runtime'
       Target provides a full C99 runtime.
  
! `correct_iso_cpp_string_wchar_protos'
!      Target `string.h' and `wchar.h' headers provide C++ required
!      overloads for `strchr' etc. functions.
  
! `dummy_wcsftime'
!      Target uses a dummy `wcsftime' function that always returns zero.
  
! `fd_truncate'
       Target can truncate a file from a file descriptor, as used by
!      `libgfortran/io/unix.c:fd_truncate'; i.e. `ftruncate' or `chsize'.
  
! `freestanding'
!      Target is `freestanding' as defined in section 4 of the C99
       standard.  Effectively, it is a target which supports no extra
       headers or libraries other than what is considered essential.
  
! `init_priority'
       Target supports constructors with initialization priority
       arguments.
  
! `inttypes_types'
!      Target has the basic signed and unsigned types in `inttypes.h'.
       This is for tests that GCC's notions of these types agree with
!      those in the header, as some systems have only `inttypes.h'.
  
! `lax_strtofp'
       Target might have errors of a few ULP in string to floating-point
       conversion functions and overflow is not always detected correctly
       by those functions.
  
! `mempcpy'
!      Target provides `mempcpy' function.
  
! `mmap'
!      Target supports `mmap'.
  
! `newlib'
       Target supports Newlib.
  
! `pow10'
!      Target provides `pow10' function.
  
! `pthread'
!      Target can compile using `pthread.h' with no errors or warnings.
  
! `pthread_h'
!      Target has `pthread.h'.
  
! `run_expensive_tests'
       Expensive testcases (usually those that consume excessive amounts
       of CPU time) should be run on this target.  This can be enabled by
!      setting the `GCC_TEST_RUN_EXPENSIVE' environment variable to a
       non-empty string.
  
! `simulator'
!      Test system runs executables on a simulator (i.e. slowly) rather
!      than hardware (i.e. fast).
  
! `stabs'
       Target supports the stabs debugging format.
  
! `stdint_types'
!      Target has the basic signed and unsigned C types in `stdint.h'.
!      This will be obsolete when GCC ensures a working `stdint.h' for
!      all targets.
  
! `stpcpy'
!      Target provides `stpcpy' function.
  
! `trampolines'
       Target supports trampolines.
  
! `uclibc'
       Target supports uClibc.
  
! `unwrapped'
       Target does not use a status wrapper.
  
! `vxworks_kernel'
       Target is a VxWorks kernel.
  
! `vxworks_rtp'
       Target is a VxWorks RTP.
  
! `wchar'
       Target supports wide characters.
  
  7.2.3.11 Other attributes
  .........................
  
! `automatic_stack_alignment'
       Target supports automatic stack alignment.
  
! `cxa_atexit'
!      Target uses `__cxa_atexit'.
  
! `default_packed'
       Target has packed layout of structure members by default.
  
! `fgraphite'
       Target supports Graphite optimizations.
  
! `fixed_point'
       Target supports fixed-point extension to C.
  
! `fopenacc'
!      Target supports OpenACC via `-fopenacc'.
  
! `fopenmp'
!      Target supports OpenMP via `-fopenmp'.
  
! `fpic'
!      Target supports `-fpic' and `-fPIC'.
  
! `freorder'
!      Target supports `-freorder-blocks-and-partition'.
  
! `fstack_protector'
!      Target supports `-fstack-protector'.
  
! `gas'
!      Target uses GNU `as'.
  
! `gc_sections'
!      Target supports `--gc-sections'.
  
! `gld'
!      Target uses GNU `ld'.
  
! `keeps_null_pointer_checks'
       Target keeps null pointer checks, either due to the use of
!      `-fno-delete-null-pointer-checks' or hardwired into the target.
  
! `lto'
       Compiler has been configured to support link-time optimization
       (LTO).
  
! `naked_functions'
!      Target supports the `naked' function attribute.
  
! `named_sections'
       Target supports named sections.
  
! `natural_alignment_32'
       Target uses natural alignment (aligned to type size) for types of
       32 bits or less.
  
! `target_natural_alignment_64'
       Target uses natural alignment (aligned to type size) for types of
       64 bits or less.
  
! `nonpic'
       Target does not generate PIC by default.
  
! `pie_enabled'
       Target generates PIE by default.
  
! `pcc_bitfield_type_matters'
!      Target defines `PCC_BITFIELD_TYPE_MATTERS'.
  
! `pe_aligned_commons'
!      Target supports `-mpe-aligned-commons'.
  
! `pie'
!      Target supports `-pie', `-fpie' and `-fPIE'.
  
! `section_anchors'
       Target supports section anchors.
  
! `short_enums'
       Target defaults to short enums.
  
! `static'
!      Target supports `-static'.
  
! `static_libgfortran'
!      Target supports statically linking `libgfortran'.
  
! `string_merging'
       Target supports merging string constants at link time.
  
! `ucn'
       Target supports compiling and assembling UCN.
  
! `ucn_nocache'
       Including the options used to compile this particular test, the
       target supports compiling and assembling UCN.
  
! `unaligned_stack'
!      Target does not guarantee that its `STACK_BOUNDARY' is greater than
       or equal to the required vector alignment.
  
! `vector_alignment_reachable'
       Vector alignment is reachable for types of 32 bits or less.
  
! `vector_alignment_reachable_for_64bit'
       Vector alignment is reachable for types of 64 bits or less.
  
! `wchar_t_char16_t_compatible'
!      Target supports `wchar_t' that is compatible with `char16_t'.
  
! `wchar_t_char32_t_compatible'
!      Target supports `wchar_t' that is compatible with `char32_t'.
  
! `comdat_group'
       Target uses comdat groups.
  
! 7.2.3.12 Local to tests in `gcc.target/i386'
  ............................................
  
! `3dnow'
!      Target supports compiling `3dnow' instructions.
  
! `aes'
!      Target supports compiling `aes' instructions.
  
! `fma4'
!      Target supports compiling `fma4' instructions.
  
! `ms_hook_prologue'
!      Target supports attribute `ms_hook_prologue'.
  
! `pclmul'
!      Target supports compiling `pclmul' instructions.
  
! `sse3'
!      Target supports compiling `sse3' instructions.
  
! `sse4'
!      Target supports compiling `sse4' instructions.
  
! `sse4a'
!      Target supports compiling `sse4a' instructions.
  
! `ssse3'
!      Target supports compiling `ssse3' instructions.
  
! `vaes'
!      Target supports compiling `vaes' instructions.
  
! `vpclmul'
!      Target supports compiling `vpclmul' instructions.
  
! `xop'
!      Target supports compiling `xop' instructions.
  
! 7.2.3.13 Local to tests in `gcc.target/spu/ea'
  ..............................................
  
! `ealib'
!      Target `__ea' library functions are available.
  
! 7.2.3.14 Local to tests in `gcc.test-framework'
  ...............................................
  
! `no'
       Always returns 0.
  
! `yes'
       Always returns 1.
  
  
  File: gccint.info,  Node: Add Options,  Next: Require Support,  Prev: Effective-Target Keywords,  Up: Test Directives
  
! 7.2.4 Features for `dg-add-options'
  -----------------------------------
  
! The supported values of FEATURE for directive `dg-add-options' are:
  
! `arm_neon'
       NEON support.  Only ARM targets support this feature, and only then
       in certain modes; see the *note arm_neon_ok effective target
       keyword: arm_neon_ok.
  
! `arm_neon_fp16'
       NEON and half-precision floating point support.  Only ARM targets
!      support this feature, and only then in certain modes; see the
!      *note arm_neon_fp16_ok effective target keyword: arm_neon_ok.
  
! `arm_vfp3'
       arm vfp3 floating point support; see the *note arm_vfp3_ok
       effective target keyword: arm_vfp3_ok.
  
! `bind_pic_locally'
       Add the target-specific flags needed to enable functions to bind
       locally when using pic/PIC passes in the testsuite.
  
! `c99_runtime'
       Add the target-specific flags needed to access the C99 runtime.
  
! `ieee'
!      Add the target-specific flags needed to enable full IEEE
!      compliance mode.
  
! `mips16_attribute'
!      `mips16' function attributes.  Only MIPS targets support this
       feature, and only then in certain modes.
  
! `tls'
       Add the target-specific flags needed to use thread-local storage.
  
  
  File: gccint.info,  Node: Require Support,  Next: Final Actions,  Prev: Add Options,  Up: Test Directives
  
! 7.2.5 Variants of `dg-require-SUPPORT'
  --------------------------------------
  
! A few of the `dg-require' directives take arguments.
  
! `dg-require-iconv CODESET'
!      Skip the test if the target does not support iconv.  CODESET is
!      the codeset to convert to.
  
! `dg-require-profiling PROFOPT'
       Skip the test if the target does not support profiling with option
       PROFOPT.
  
! `dg-require-visibility VIS'
!      Skip the test if the target does not support the `visibility'
!      attribute.  If VIS is `""', support for `visibility("hidden")' is
!      checked, for `visibility("VIS")' otherwise.
  
!  The original `dg-require' directives were defined before there was
  support for effective-target keywords.  The directives that do not take
  arguments could be replaced with effective-target keywords.
  
! `dg-require-alias ""'
!      Skip the test if the target does not support the `alias' attribute.
  
! `dg-require-ascii-locale ""'
       Skip the test if the host does not support an ASCII locale.
  
! `dg-require-compat-dfp ""'
!      Skip this test unless both compilers in a `compat' testsuite
       support decimal floating point.
  
! `dg-require-cxa-atexit ""'
!      Skip the test if the target does not support `__cxa_atexit'.  This
!      is equivalent to `dg-require-effective-target cxa_atexit'.
  
! `dg-require-dll ""'
       Skip the test if the target does not support DLL attributes.
  
! `dg-require-fork ""'
!      Skip the test if the target does not support `fork'.
  
! `dg-require-gc-sections ""'
       Skip the test if the target's linker does not support the
!      `--gc-sections' flags.  This is equivalent to
!      `dg-require-effective-target gc-sections'.
  
! `dg-require-host-local ""'
       Skip the test if the host is remote, rather than the same as the
       build system.  Some tests are incompatible with DejaGnu's handling
!      of remote hosts, which involves copying the source file to the
!      host and compiling it with a relative path and "`-o a.out'".
  
! `dg-require-mkfifo ""'
!      Skip the test if the target does not support `mkfifo'.
  
! `dg-require-named-sections ""'
       Skip the test is the target does not support named sections.  This
!      is equivalent to `dg-require-effective-target named_sections'.
  
! `dg-require-weak ""'
       Skip the test if the target does not support weak symbols.
  
! `dg-require-weak-override ""'
       Skip the test if the target does not support overriding weak
       symbols.
  
  
  File: gccint.info,  Node: Final Actions,  Prev: Require Support,  Up: Test Directives
  
! 7.2.6 Commands for use in `dg-final'
  ------------------------------------
  
  The GCC testsuite defines the following directives to be used within
! `dg-final'.
  
  7.2.6.1 Scan a particular file
  ..............................
  
! `scan-file FILENAME REGEXP [{ target/xfail SELECTOR }]'
       Passes if REGEXP matches text in FILENAME.
! 
! `scan-file-not FILENAME REGEXP [{ target/xfail SELECTOR }]'
       Passes if REGEXP does not match text in FILENAME.
! 
! `scan-module MODULE REGEXP [{ target/xfail SELECTOR }]'
       Passes if REGEXP matches in Fortran module MODULE.
  
  7.2.6.2 Scan the assembly output
  ................................
  
! `scan-assembler REGEX [{ target/xfail SELECTOR }]'
       Passes if REGEX matches text in the test's assembler output.
  
! `scan-assembler-not REGEX [{ target/xfail SELECTOR }]'
       Passes if REGEX does not match text in the test's assembler output.
  
! `scan-assembler-times REGEX NUM [{ target/xfail SELECTOR }]'
       Passes if REGEX is matched exactly NUM times in the test's
       assembler output.
  
! `scan-assembler-dem REGEX [{ target/xfail SELECTOR }]'
       Passes if REGEX matches text in the test's demangled assembler
       output.
  
! `scan-assembler-dem-not REGEX [{ target/xfail SELECTOR }]'
       Passes if REGEX does not match text in the test's demangled
       assembler output.
  
! `scan-hidden SYMBOL [{ target/xfail SELECTOR }]'
       Passes if SYMBOL is defined as a hidden symbol in the test's
       assembly output.
  
! `scan-not-hidden SYMBOL [{ target/xfail SELECTOR }]'
       Passes if SYMBOL is not defined as a hidden symbol in the test's
       assembly output.
  
  7.2.6.3 Scan optimization dump files
  ....................................
  
! These commands are available for KIND of `tree', `rtl', and `ipa'.
  
! `scan-KIND-dump REGEX SUFFIX [{ target/xfail SELECTOR }]'
       Passes if REGEX matches text in the dump file with suffix SUFFIX.
  
! `scan-KIND-dump-not REGEX SUFFIX [{ target/xfail SELECTOR }]'
       Passes if REGEX does not match text in the dump file with suffix
       SUFFIX.
  
! `scan-KIND-dump-times REGEX NUM SUFFIX [{ target/xfail SELECTOR }]'
       Passes if REGEX is found exactly NUM times in the dump file with
       suffix SUFFIX.
  
! `scan-KIND-dump-dem REGEX SUFFIX [{ target/xfail SELECTOR }]'
!      Passes if REGEX matches demangled text in the dump file with
!      suffix SUFFIX.
  
! `scan-KIND-dump-dem-not REGEX SUFFIX [{ target/xfail SELECTOR }]'
       Passes if REGEX does not match demangled text in the dump file with
       suffix SUFFIX.
  
  7.2.6.4 Verify that an output files exists or not
  .................................................
  
! `output-exists [{ target/xfail SELECTOR }]'
       Passes if compiler output file exists.
  
! `output-exists-not [{ target/xfail SELECTOR }]'
       Passes if compiler output file does not exist.
  
  7.2.6.5 Check for LTO tests
  ...........................
  
! `scan-symbol REGEXP [{ target/xfail SELECTOR }]'
       Passes if the pattern is present in the final executable.
  
! 7.2.6.6 Checks for `gcov' tests
  ...............................
  
! `run-gcov SOURCEFILE'
!      Check line counts in `gcov' tests.
  
! `run-gcov [branches] [calls] { OPTS SOURCEFILE }'
       Check branch and/or call counts, in addition to line counts, in
!      `gcov' tests.
  
  7.2.6.7 Clean up generated test files
  .....................................
  
! `cleanup-coverage-files'
       Removes coverage data files generated for this test.
  
! `cleanup-ipa-dump SUFFIX'
       Removes IPA dump files generated for this test.
  
! `cleanup-modules "LIST-OF-EXTRA-MODULES"'
       Removes Fortran module files generated for this test, excluding the
       module names listed in keep-modules.  Cleaning up module files is
       usually done automatically by the testsuite by looking at the
--- 4511,5455 ----
  for particular targets, or to specify that particular sets of targets
  are expected to fail some tests.
  
!  Effective-target keywords are defined in 'lib/target-supports.exp' in
  the GCC testsuite, with the exception of those that are documented as
  being local to a particular test directory.
  
!  The 'effective target' takes into account all of the compiler options
  with which the test will be compiled, including the multilib options.
! By convention, keywords ending in '_nocache' can also include options
! specified for the particular test in an earlier 'dg-options' or
! 'dg-add-options' directive.
  
  7.2.3.1 Data type sizes
  .......................
  
! 'ilp32'
!      Target has 32-bit 'int', 'long', and pointers.
  
! 'lp64'
!      Target has 32-bit 'int', 64-bit 'long' and pointers.
  
! 'llp64'
!      Target has 32-bit 'int' and 'long', 64-bit 'long long' and
       pointers.
  
! 'double64'
!      Target has 64-bit 'double'.
  
! 'double64plus'
!      Target has 'double' that is 64 bits or longer.
  
! 'longdouble128'
!      Target has 128-bit 'long double'.
  
! 'int32plus'
!      Target has 'int' that is at 32 bits or longer.
  
! 'int16'
!      Target has 'int' that is 16 bits or shorter.
  
! 'long_neq_int'
!      Target has 'int' and 'long' with different sizes.
  
! 'large_double'
!      Target supports 'double' that is longer than 'float'.
  
! 'large_long_double'
!      Target supports 'long double' that is longer than 'double'.
  
! 'ptr32plus'
       Target has pointers that are 32 bits or longer.
  
! 'size32plus'
       Target supports array and structure sizes that are 32 bits or
       longer.
  
! '4byte_wchar_t'
!      Target has 'wchar_t' that is at least 4 bytes.
  
  7.2.3.2 Fortran-specific attributes
  ...................................
  
! 'fortran_integer_16'
!      Target supports Fortran 'integer' that is 16 bytes or longer.
  
! 'fortran_large_int'
!      Target supports Fortran 'integer' kinds larger than 'integer(8)'.
  
! 'fortran_large_real'
!      Target supports Fortran 'real' kinds larger than 'real(8)'.
  
  7.2.3.3 Vector-specific attributes
  ..................................
  
! 'vect_condition'
       Target supports vector conditional operations.
  
! 'vect_double'
!      Target supports hardware vectors of 'double'.
  
! 'vect_float'
!      Target supports hardware vectors of 'float'.
  
! 'vect_int'
!      Target supports hardware vectors of 'int'.
  
! 'vect_long'
!      Target supports hardware vectors of 'long'.
  
! 'vect_long_long'
!      Target supports hardware vectors of 'long long'.
  
! 'vect_aligned_arrays'
       Target aligns arrays to vector alignment boundary.
  
! 'vect_hw_misalign'
       Target supports a vector misalign access.
  
! 'vect_no_align'
       Target does not support a vector alignment mechanism.
  
! 'vect_no_int_max'
!      Target does not support a vector max instruction on 'int'.
  
! 'vect_no_int_add'
!      Target does not support a vector add instruction on 'int'.
  
! 'vect_no_bitwise'
       Target does not support vector bitwise instructions.
  
! 'vect_char_mult'
!      Target supports 'vector char' multiplication.
  
! 'vect_short_mult'
!      Target supports 'vector short' multiplication.
  
! 'vect_int_mult'
!      Target supports 'vector int' multiplication.
  
! 'vect_extract_even_odd'
       Target supports vector even/odd element extraction.
  
! 'vect_extract_even_odd_wide'
       Target supports vector even/odd element extraction of vectors with
!      elements 'SImode' or larger.
  
! 'vect_interleave'
       Target supports vector interleaving.
  
! 'vect_strided'
       Target supports vector interleaving and extract even/odd.
  
! 'vect_strided_wide'
       Target supports vector interleaving and extract even/odd for wide
       element types.
  
! 'vect_perm'
       Target supports vector permutation.
  
! 'vect_shift'
       Target supports a hardware vector shift operation.
  
! 'vect_widen_sum_hi_to_si'
!      Target supports a vector widening summation of 'short' operands
!      into 'int' results, or can promote (unpack) from 'short' to 'int'.
  
! 'vect_widen_sum_qi_to_hi'
!      Target supports a vector widening summation of 'char' operands into
!      'short' results, or can promote (unpack) from 'char' to 'short'.
  
! 'vect_widen_sum_qi_to_si'
!      Target supports a vector widening summation of 'char' operands into
!      'int' results.
  
! 'vect_widen_mult_qi_to_hi'
!      Target supports a vector widening multiplication of 'char' operands
!      into 'short' results, or can promote (unpack) from 'char' to
!      'short' and perform non-widening multiplication of 'short'.
  
! 'vect_widen_mult_hi_to_si'
!      Target supports a vector widening multiplication of 'short'
!      operands into 'int' results, or can promote (unpack) from 'short'
!      to 'int' and perform non-widening multiplication of 'int'.
  
! 'vect_widen_mult_si_to_di_pattern'
!      Target supports a vector widening multiplication of 'int' operands
!      into 'long' results.
  
! 'vect_sdot_qi'
!      Target supports a vector dot-product of 'signed char'.
  
! 'vect_udot_qi'
!      Target supports a vector dot-product of 'unsigned char'.
  
! 'vect_sdot_hi'
!      Target supports a vector dot-product of 'signed short'.
  
! 'vect_udot_hi'
!      Target supports a vector dot-product of 'unsigned short'.
  
! 'vect_pack_trunc'
!      Target supports a vector demotion (packing) of 'short' to 'char'
!      and from 'int' to 'short' using modulo arithmetic.
  
! 'vect_unpack'
!      Target supports a vector promotion (unpacking) of 'char' to 'short'
!      and from 'char' to 'int'.
  
! 'vect_intfloat_cvt'
!      Target supports conversion from 'signed int' to 'float'.
  
! 'vect_uintfloat_cvt'
!      Target supports conversion from 'unsigned int' to 'float'.
  
! 'vect_floatint_cvt'
!      Target supports conversion from 'float' to 'signed int'.
  
! 'vect_floatuint_cvt'
!      Target supports conversion from 'float' to 'unsigned int'.
  
  7.2.3.4 Thread Local Storage attributes
  .......................................
  
! 'tls'
       Target supports thread-local storage.
  
! 'tls_native'
       Target supports native (rather than emulated) thread-local storage.
  
! 'tls_runtime'
       Test system supports executing TLS executables.
  
  7.2.3.5 Decimal floating point attributes
  .........................................
  
! 'dfp'
       Targets supports compiling decimal floating point extension to C.
  
! 'dfp_nocache'
       Including the options used to compile this particular test, the
       target supports compiling decimal floating point extension to C.
  
! 'dfprt'
       Test system can execute decimal floating point tests.
  
! 'dfprt_nocache'
       Including the options used to compile this particular test, the
       test system can execute decimal floating point tests.
  
! 'hard_dfp'
       Target generates decimal floating point instructions with current
       options.
  
  7.2.3.6 ARM-specific attributes
  ...............................
  
! 'arm32'
       ARM target generates 32-bit code.
  
! 'arm_eabi'
       ARM target adheres to the ABI for the ARM Architecture.
  
! 'arm_hf_eabi'
       ARM target adheres to the VFP and Advanced SIMD Register Arguments
       variant of the ABI for the ARM Architecture (as selected with
!      '-mfloat-abi=hard').
  
! 'arm_hard_vfp_ok'
!      ARM target supports '-mfpu=vfp -mfloat-abi=hard'.  Some multilibs
       may be incompatible with these options.
  
! 'arm_iwmmxt_ok'
!      ARM target supports '-mcpu=iwmmxt'.  Some multilibs may be
       incompatible with this option.
  
! 'arm_neon'
       ARM target supports generating NEON instructions.
  
! 'arm_tune_string_ops_prefer_neon'
       Test CPU tune supports inlining string operations with NEON
       instructions.
  
! 'arm_neon_hw'
       Test system supports executing NEON instructions.
  
! 'arm_neonv2_hw'
       Test system supports executing NEON v2 instructions.
  
! 'arm_neon_ok'
!      ARM Target supports '-mfpu=neon -mfloat-abi=softfp' or compatible
       options.  Some multilibs may be incompatible with these options.
  
! 'arm_neonv2_ok'
!      ARM Target supports '-mfpu=neon-vfpv4 -mfloat-abi=softfp' or
       compatible options.  Some multilibs may be incompatible with these
       options.
  
! 'arm_neon_fp16_ok'
!      ARM Target supports '-mfpu=neon-fp16 -mfloat-abi=softfp' or
       compatible options.  Some multilibs may be incompatible with these
       options.
  
! 'arm_thumb1_ok'
!      ARM target generates Thumb-1 code for '-mthumb'.
  
! 'arm_thumb2_ok'
!      ARM target generates Thumb-2 code for '-mthumb'.
  
! 'arm_vfp_ok'
!      ARM target supports '-mfpu=vfp -mfloat-abi=softfp'.  Some multilibs
!      may be incompatible with these options.
  
! 'arm_vfp3_ok'
!      ARM target supports '-mfpu=vfp3 -mfloat-abi=softfp'.  Some
       multilibs may be incompatible with these options.
  
! 'arm_v8_vfp_ok'
!      ARM target supports '-mfpu=fp-armv8 -mfloat-abi=softfp'.  Some
       multilibs may be incompatible with these options.
  
! 'arm_v8_neon_ok'
!      ARM target supports '-mfpu=neon-fp-armv8 -mfloat-abi=softfp'.  Some
!      multilibs may be incompatible with these options.
  
+ 'arm_prefer_ldrd_strd'
+      ARM target prefers 'LDRD' and 'STRD' instructions over 'LDM' and
+      'STM' instructions.
  
  7.2.3.7 MIPS-specific attributes
  ................................
  
! 'mips64'
       MIPS target supports 64-bit instructions.
  
! 'nomips16'
       MIPS target does not produce MIPS16 code.
  
! 'mips16_attribute'
       MIPS target can generate MIPS16 code.
  
! 'mips_loongson'
       MIPS target is a Loongson-2E or -2F target using an ABI that
       supports the Loongson vector modes.
  
! 'mips_newabi_large_long_double'
!      MIPS target supports 'long double' larger than 'double' when using
       the new ABI.
  
! 'mpaired_single'
!      MIPS target supports '-mpaired-single'.
  
  7.2.3.8 PowerPC-specific attributes
  ...................................
  
! 'dfp_hw'
       PowerPC target supports executing hardware DFP instructions.
  
! 'p8vector_hw'
       PowerPC target supports executing VSX instructions (ISA 2.07).
  
! 'powerpc64'
       Test system supports executing 64-bit instructions.
  
! 'powerpc_altivec'
       PowerPC target supports AltiVec.
  
! 'powerpc_altivec_ok'
!      PowerPC target supports '-maltivec'.
  
! 'powerpc_eabi_ok'
!      PowerPC target supports '-meabi'.
  
! 'powerpc_elfv2'
!      PowerPC target supports '-mabi=elfv2'.
  
! 'powerpc_fprs'
       PowerPC target supports floating-point registers.
  
! 'powerpc_hard_double'
       PowerPC target supports hardware double-precision floating-point.
  
! 'powerpc_htm_ok'
!      PowerPC target supports '-mhtm'
  
! 'powerpc_p8vector_ok'
!      PowerPC target supports '-mpower8-vector'
  
! 'powerpc_ppu_ok'
!      PowerPC target supports '-mcpu=cell'.
  
! 'powerpc_spe'
       PowerPC target supports PowerPC SPE.
  
! 'powerpc_spe_nocache'
       Including the options used to compile this particular test, the
       PowerPC target supports PowerPC SPE.
  
! 'powerpc_spu'
       PowerPC target supports PowerPC SPU.
  
! 'powerpc_vsx_ok'
!      PowerPC target supports '-mvsx'.
  
! 'powerpc_405_nocache'
       Including the options used to compile this particular test, the
       PowerPC target supports PowerPC 405.
  
! 'ppc_recip_hw'
       PowerPC target supports executing reciprocal estimate instructions.
  
! 'spu_auto_overlay'
       SPU target has toolchain that supports automatic overlay
       generation.
  
! 'vmx_hw'
       PowerPC target supports executing AltiVec instructions.
  
! 'vsx_hw'
       PowerPC target supports executing VSX instructions (ISA 2.06).
  
  7.2.3.9 Other hardware attributes
  .................................
  
! 'avx'
!      Target supports compiling 'avx' instructions.
  
! 'avx_runtime'
!      Target supports the execution of 'avx' instructions.
  
! 'cell_hw'
       Test system can execute AltiVec and Cell PPU instructions.
  
! 'coldfire_fpu'
       Target uses a ColdFire FPU.
  
! 'hard_float'
       Target supports FPU instructions.
  
! 'non_strict_align'
       Target does not require strict alignment.
  
! 'sse'
!      Target supports compiling 'sse' instructions.
  
! 'sse_runtime'
!      Target supports the execution of 'sse' instructions.
  
! 'sse2'
!      Target supports compiling 'sse2' instructions.
  
! 'sse2_runtime'
!      Target supports the execution of 'sse2' instructions.
  
! 'sync_char_short'
!      Target supports atomic operations on 'char' and 'short'.
  
! 'sync_int_long'
!      Target supports atomic operations on 'int' and 'long'.
  
! 'ultrasparc_hw'
       Test environment appears to run executables on a simulator that
!      accepts only 'EM_SPARC' executables and chokes on 'EM_SPARC32PLUS'
!      or 'EM_SPARCV9' executables.
  
! 'vect_cmdline_needed'
       Target requires a command line argument to enable a SIMD
       instruction set.
  
! 'pie_copyreloc'
       The x86-64 target linker supports PIE with copy reloc.
  
  7.2.3.10 Environment attributes
  ...............................
  
! 'c'
       The language for the compiler under test is C.
  
! 'c++'
       The language for the compiler under test is C++.
  
! 'c99_runtime'
       Target provides a full C99 runtime.
  
! 'correct_iso_cpp_string_wchar_protos'
!      Target 'string.h' and 'wchar.h' headers provide C++ required
!      overloads for 'strchr' etc.  functions.
  
! 'dummy_wcsftime'
!      Target uses a dummy 'wcsftime' function that always returns zero.
  
! 'fd_truncate'
       Target can truncate a file from a file descriptor, as used by
!      'libgfortran/io/unix.c:fd_truncate'; i.e.  'ftruncate' or 'chsize'.
  
! 'freestanding'
!      Target is 'freestanding' as defined in section 4 of the C99
       standard.  Effectively, it is a target which supports no extra
       headers or libraries other than what is considered essential.
  
! 'init_priority'
       Target supports constructors with initialization priority
       arguments.
  
! 'inttypes_types'
!      Target has the basic signed and unsigned types in 'inttypes.h'.
       This is for tests that GCC's notions of these types agree with
!      those in the header, as some systems have only 'inttypes.h'.
  
! 'lax_strtofp'
       Target might have errors of a few ULP in string to floating-point
       conversion functions and overflow is not always detected correctly
       by those functions.
  
! 'mempcpy'
!      Target provides 'mempcpy' function.
  
! 'mmap'
!      Target supports 'mmap'.
  
! 'newlib'
       Target supports Newlib.
  
! 'pow10'
!      Target provides 'pow10' function.
  
! 'pthread'
!      Target can compile using 'pthread.h' with no errors or warnings.
  
! 'pthread_h'
!      Target has 'pthread.h'.
  
! 'run_expensive_tests'
       Expensive testcases (usually those that consume excessive amounts
       of CPU time) should be run on this target.  This can be enabled by
!      setting the 'GCC_TEST_RUN_EXPENSIVE' environment variable to a
       non-empty string.
  
! 'simulator'
!      Test system runs executables on a simulator (i.e.  slowly) rather
!      than hardware (i.e.  fast).
  
! 'stabs'
       Target supports the stabs debugging format.
  
! 'stdint_types'
!      Target has the basic signed and unsigned C types in 'stdint.h'.
!      This will be obsolete when GCC ensures a working 'stdint.h' for all
!      targets.
  
! 'stpcpy'
!      Target provides 'stpcpy' function.
  
! 'trampolines'
       Target supports trampolines.
  
! 'uclibc'
       Target supports uClibc.
  
! 'unwrapped'
       Target does not use a status wrapper.
  
! 'vxworks_kernel'
       Target is a VxWorks kernel.
  
! 'vxworks_rtp'
       Target is a VxWorks RTP.
  
! 'wchar'
       Target supports wide characters.
  
  7.2.3.11 Other attributes
  .........................
  
! 'automatic_stack_alignment'
       Target supports automatic stack alignment.
  
! 'cxa_atexit'
!      Target uses '__cxa_atexit'.
  
! 'default_packed'
       Target has packed layout of structure members by default.
  
! 'fgraphite'
       Target supports Graphite optimizations.
  
! 'fixed_point'
       Target supports fixed-point extension to C.
  
! 'fopenacc'
!      Target supports OpenACC via '-fopenacc'.
  
! 'fopenmp'
!      Target supports OpenMP via '-fopenmp'.
  
! 'fpic'
!      Target supports '-fpic' and '-fPIC'.
  
! 'freorder'
!      Target supports '-freorder-blocks-and-partition'.
  
! 'fstack_protector'
!      Target supports '-fstack-protector'.
  
! 'gas'
!      Target uses GNU 'as'.
  
! 'gc_sections'
!      Target supports '--gc-sections'.
  
! 'gld'
!      Target uses GNU 'ld'.
  
! 'keeps_null_pointer_checks'
       Target keeps null pointer checks, either due to the use of
!      '-fno-delete-null-pointer-checks' or hardwired into the target.
  
! 'lto'
       Compiler has been configured to support link-time optimization
       (LTO).
  
! 'naked_functions'
!      Target supports the 'naked' function attribute.
  
! 'named_sections'
       Target supports named sections.
  
! 'natural_alignment_32'
       Target uses natural alignment (aligned to type size) for types of
       32 bits or less.
  
! 'target_natural_alignment_64'
       Target uses natural alignment (aligned to type size) for types of
       64 bits or less.
  
! 'nonpic'
       Target does not generate PIC by default.
  
! 'pie_enabled'
       Target generates PIE by default.
  
! 'pcc_bitfield_type_matters'
!      Target defines 'PCC_BITFIELD_TYPE_MATTERS'.
  
! 'pe_aligned_commons'
!      Target supports '-mpe-aligned-commons'.
  
! 'pie'
!      Target supports '-pie', '-fpie' and '-fPIE'.
  
! 'section_anchors'
       Target supports section anchors.
  
! 'short_enums'
       Target defaults to short enums.
  
! 'static'
!      Target supports '-static'.
  
! 'static_libgfortran'
!      Target supports statically linking 'libgfortran'.
  
! 'string_merging'
       Target supports merging string constants at link time.
  
! 'ucn'
       Target supports compiling and assembling UCN.
  
! 'ucn_nocache'
       Including the options used to compile this particular test, the
       target supports compiling and assembling UCN.
  
! 'unaligned_stack'
!      Target does not guarantee that its 'STACK_BOUNDARY' is greater than
       or equal to the required vector alignment.
  
! 'vector_alignment_reachable'
       Vector alignment is reachable for types of 32 bits or less.
  
! 'vector_alignment_reachable_for_64bit'
       Vector alignment is reachable for types of 64 bits or less.
  
! 'wchar_t_char16_t_compatible'
!      Target supports 'wchar_t' that is compatible with 'char16_t'.
  
! 'wchar_t_char32_t_compatible'
!      Target supports 'wchar_t' that is compatible with 'char32_t'.
  
! 'comdat_group'
       Target uses comdat groups.
  
! 7.2.3.12 Local to tests in 'gcc.target/i386'
  ............................................
  
! '3dnow'
!      Target supports compiling '3dnow' instructions.
  
! 'aes'
!      Target supports compiling 'aes' instructions.
  
! 'fma4'
!      Target supports compiling 'fma4' instructions.
  
! 'ms_hook_prologue'
!      Target supports attribute 'ms_hook_prologue'.
  
! 'pclmul'
!      Target supports compiling 'pclmul' instructions.
  
! 'sse3'
!      Target supports compiling 'sse3' instructions.
  
! 'sse4'
!      Target supports compiling 'sse4' instructions.
  
! 'sse4a'
!      Target supports compiling 'sse4a' instructions.
  
! 'ssse3'
!      Target supports compiling 'ssse3' instructions.
  
! 'vaes'
!      Target supports compiling 'vaes' instructions.
  
! 'vpclmul'
!      Target supports compiling 'vpclmul' instructions.
  
! 'xop'
!      Target supports compiling 'xop' instructions.
  
! 7.2.3.13 Local to tests in 'gcc.target/spu/ea'
  ..............................................
  
! 'ealib'
!      Target '__ea' library functions are available.
  
! 7.2.3.14 Local to tests in 'gcc.test-framework'
  ...............................................
  
! 'no'
       Always returns 0.
  
! 'yes'
       Always returns 1.
  
  
  File: gccint.info,  Node: Add Options,  Next: Require Support,  Prev: Effective-Target Keywords,  Up: Test Directives
  
! 7.2.4 Features for 'dg-add-options'
  -----------------------------------
  
! The supported values of FEATURE for directive 'dg-add-options' are:
  
! 'arm_neon'
       NEON support.  Only ARM targets support this feature, and only then
       in certain modes; see the *note arm_neon_ok effective target
       keyword: arm_neon_ok.
  
! 'arm_neon_fp16'
       NEON and half-precision floating point support.  Only ARM targets
!      support this feature, and only then in certain modes; see the *note
!      arm_neon_fp16_ok effective target keyword: arm_neon_ok.
  
! 'arm_vfp3'
       arm vfp3 floating point support; see the *note arm_vfp3_ok
       effective target keyword: arm_vfp3_ok.
  
! 'bind_pic_locally'
       Add the target-specific flags needed to enable functions to bind
       locally when using pic/PIC passes in the testsuite.
  
! 'c99_runtime'
       Add the target-specific flags needed to access the C99 runtime.
  
! 'ieee'
!      Add the target-specific flags needed to enable full IEEE compliance
!      mode.
  
! 'mips16_attribute'
!      'mips16' function attributes.  Only MIPS targets support this
       feature, and only then in certain modes.
  
! 'tls'
       Add the target-specific flags needed to use thread-local storage.
  
  
  File: gccint.info,  Node: Require Support,  Next: Final Actions,  Prev: Add Options,  Up: Test Directives
  
! 7.2.5 Variants of 'dg-require-SUPPORT'
  --------------------------------------
  
! A few of the 'dg-require' directives take arguments.
  
! 'dg-require-iconv CODESET'
!      Skip the test if the target does not support iconv.  CODESET is the
!      codeset to convert to.
  
! 'dg-require-profiling PROFOPT'
       Skip the test if the target does not support profiling with option
       PROFOPT.
  
! 'dg-require-visibility VIS'
!      Skip the test if the target does not support the 'visibility'
!      attribute.  If VIS is '""', support for 'visibility("hidden")' is
!      checked, for 'visibility("VIS")' otherwise.
  
!  The original 'dg-require' directives were defined before there was
  support for effective-target keywords.  The directives that do not take
  arguments could be replaced with effective-target keywords.
  
! 'dg-require-alias ""'
!      Skip the test if the target does not support the 'alias' attribute.
  
! 'dg-require-ascii-locale ""'
       Skip the test if the host does not support an ASCII locale.
  
! 'dg-require-compat-dfp ""'
!      Skip this test unless both compilers in a 'compat' testsuite
       support decimal floating point.
  
! 'dg-require-cxa-atexit ""'
!      Skip the test if the target does not support '__cxa_atexit'.  This
!      is equivalent to 'dg-require-effective-target cxa_atexit'.
  
! 'dg-require-dll ""'
       Skip the test if the target does not support DLL attributes.
  
! 'dg-require-fork ""'
!      Skip the test if the target does not support 'fork'.
  
! 'dg-require-gc-sections ""'
       Skip the test if the target's linker does not support the
!      '--gc-sections' flags.  This is equivalent to
!      'dg-require-effective-target gc-sections'.
  
! 'dg-require-host-local ""'
       Skip the test if the host is remote, rather than the same as the
       build system.  Some tests are incompatible with DejaGnu's handling
!      of remote hosts, which involves copying the source file to the host
!      and compiling it with a relative path and "'-o a.out'".
  
! 'dg-require-mkfifo ""'
!      Skip the test if the target does not support 'mkfifo'.
  
! 'dg-require-named-sections ""'
       Skip the test is the target does not support named sections.  This
!      is equivalent to 'dg-require-effective-target named_sections'.
  
! 'dg-require-weak ""'
       Skip the test if the target does not support weak symbols.
  
! 'dg-require-weak-override ""'
       Skip the test if the target does not support overriding weak
       symbols.
  
  
  File: gccint.info,  Node: Final Actions,  Prev: Require Support,  Up: Test Directives
  
! 7.2.6 Commands for use in 'dg-final'
  ------------------------------------
  
  The GCC testsuite defines the following directives to be used within
! 'dg-final'.
  
  7.2.6.1 Scan a particular file
  ..............................
  
! 'scan-file FILENAME REGEXP [{ target/xfail SELECTOR }]'
       Passes if REGEXP matches text in FILENAME.
! 'scan-file-not FILENAME REGEXP [{ target/xfail SELECTOR }]'
       Passes if REGEXP does not match text in FILENAME.
! 'scan-module MODULE REGEXP [{ target/xfail SELECTOR }]'
       Passes if REGEXP matches in Fortran module MODULE.
  
  7.2.6.2 Scan the assembly output
  ................................
  
! 'scan-assembler REGEX [{ target/xfail SELECTOR }]'
       Passes if REGEX matches text in the test's assembler output.
  
! 'scan-assembler-not REGEX [{ target/xfail SELECTOR }]'
       Passes if REGEX does not match text in the test's assembler output.
  
! 'scan-assembler-times REGEX NUM [{ target/xfail SELECTOR }]'
       Passes if REGEX is matched exactly NUM times in the test's
       assembler output.
  
! 'scan-assembler-dem REGEX [{ target/xfail SELECTOR }]'
       Passes if REGEX matches text in the test's demangled assembler
       output.
  
! 'scan-assembler-dem-not REGEX [{ target/xfail SELECTOR }]'
       Passes if REGEX does not match text in the test's demangled
       assembler output.
  
! 'scan-hidden SYMBOL [{ target/xfail SELECTOR }]'
       Passes if SYMBOL is defined as a hidden symbol in the test's
       assembly output.
  
! 'scan-not-hidden SYMBOL [{ target/xfail SELECTOR }]'
       Passes if SYMBOL is not defined as a hidden symbol in the test's
       assembly output.
  
  7.2.6.3 Scan optimization dump files
  ....................................
  
! These commands are available for KIND of 'tree', 'rtl', and 'ipa'.
  
! 'scan-KIND-dump REGEX SUFFIX [{ target/xfail SELECTOR }]'
       Passes if REGEX matches text in the dump file with suffix SUFFIX.
  
! 'scan-KIND-dump-not REGEX SUFFIX [{ target/xfail SELECTOR }]'
       Passes if REGEX does not match text in the dump file with suffix
       SUFFIX.
  
! 'scan-KIND-dump-times REGEX NUM SUFFIX [{ target/xfail SELECTOR }]'
       Passes if REGEX is found exactly NUM times in the dump file with
       suffix SUFFIX.
  
! 'scan-KIND-dump-dem REGEX SUFFIX [{ target/xfail SELECTOR }]'
!      Passes if REGEX matches demangled text in the dump file with suffix
!      SUFFIX.
  
! 'scan-KIND-dump-dem-not REGEX SUFFIX [{ target/xfail SELECTOR }]'
       Passes if REGEX does not match demangled text in the dump file with
       suffix SUFFIX.
  
  7.2.6.4 Verify that an output files exists or not
  .................................................
  
! 'output-exists [{ target/xfail SELECTOR }]'
       Passes if compiler output file exists.
  
! 'output-exists-not [{ target/xfail SELECTOR }]'
       Passes if compiler output file does not exist.
  
  7.2.6.5 Check for LTO tests
  ...........................
  
! 'scan-symbol REGEXP [{ target/xfail SELECTOR }]'
       Passes if the pattern is present in the final executable.
  
! 7.2.6.6 Checks for 'gcov' tests
  ...............................
  
! 'run-gcov SOURCEFILE'
!      Check line counts in 'gcov' tests.
  
! 'run-gcov [branches] [calls] { OPTS SOURCEFILE }'
       Check branch and/or call counts, in addition to line counts, in
!      'gcov' tests.
  
  7.2.6.7 Clean up generated test files
  .....................................
  
! 'cleanup-coverage-files'
       Removes coverage data files generated for this test.
  
! 'cleanup-ipa-dump SUFFIX'
       Removes IPA dump files generated for this test.
  
! 'cleanup-modules "LIST-OF-EXTRA-MODULES"'
       Removes Fortran module files generated for this test, excluding the
       module names listed in keep-modules.  Cleaning up module files is
       usually done automatically by the testsuite by looking at the
*************** These commands are available for KIND of
*** 5572,5578 ****
            ! { dg-final { cleanup-modules "mod1 mod2" } } ! redundant
            ! { dg-final { keep-modules "mod3 mod4" } }
  
! `keep-modules "LIST-OF-MODULES-NOT-TO-DELETE"'
       Whitespace separated list of module names that should not be
       deleted by cleanup-modules.  If the list of modules is empty, all
       modules defined in this file are kept.
--- 5466,5472 ----
            ! { dg-final { cleanup-modules "mod1 mod2" } } ! redundant
            ! { dg-final { keep-modules "mod3 mod4" } }
  
! 'keep-modules "LIST-OF-MODULES-NOT-TO-DELETE"'
       Whitespace separated list of module names that should not be
       deleted by cleanup-modules.  If the list of modules is empty, all
       modules defined in this file are kept.
*************** These commands are available for KIND of
*** 5585,5604 ****
            ! { dg-final { keep-modules "keep1 keep2" } } ! just keep these two
            ! { dg-final { keep-modules "" } } ! keep all
  
! `cleanup-profile-file'
       Removes profiling files generated for this test.
  
! `cleanup-repo-files'
!      Removes files generated for this test for `-frepo'.
  
! `cleanup-rtl-dump SUFFIX'
       Removes RTL dump files generated for this test.
  
! `cleanup-saved-temps'
       Removes files for the current test which were kept for
!      `-save-temps'.
  
! `cleanup-tree-dump SUFFIX'
       Removes tree dump files matching SUFFIX which were generated for
       this test.
  
--- 5479,5498 ----
            ! { dg-final { keep-modules "keep1 keep2" } } ! just keep these two
            ! { dg-final { keep-modules "" } } ! keep all
  
! 'cleanup-profile-file'
       Removes profiling files generated for this test.
  
! 'cleanup-repo-files'
!      Removes files generated for this test for '-frepo'.
  
! 'cleanup-rtl-dump SUFFIX'
       Removes RTL dump files generated for this test.
  
! 'cleanup-saved-temps'
       Removes files for the current test which were kept for
!      '-save-temps'.
  
! 'cleanup-tree-dump SUFFIX'
       Removes tree dump files matching SUFFIX which were generated for
       this test.
  
*************** File: gccint.info,  Node: Ada Tests,  Ne
*** 5609,5640 ****
  ===========================
  
  The Ada testsuite includes executable tests from the ACATS testsuite,
! publicly available at `http://www.ada-auth.org/acats.html'.
  
!  These tests are integrated in the GCC testsuite in the `ada/acats'
! directory, and enabled automatically when running `make check', assuming
  the Ada language has been enabled when configuring GCC.
  
!  You can also run the Ada testsuite independently, using `make
  check-ada', or run a subset of the tests by specifying which chapter to
  run, e.g.:
  
       $ make check-ada CHAPTERS="c3 c9"
  
!  The tests are organized by directory, each directory corresponding to
! a chapter of the Ada Reference Manual.  So for example, `c9' corresponds
  to chapter 9, which deals with tasking features of the language.
  
!  There is also an extra chapter called `gcc' containing a template for
  creating new executable tests, although this is deprecated in favor of
! the `gnat.dg' testsuite.
  
!  The tests are run using two `sh' scripts: `run_acats' and
! `run_all.sh'.  To run the tests using a simulator or a cross target,
! see the small customization section at the top of `run_all.sh'.
  
   These tests are run using the build tree: they can be run without doing
! a `make install'.
  
  
  File: gccint.info,  Node: C Tests,  Next: libgcj Tests,  Prev: Ada Tests,  Up: Testsuites
--- 5503,5534 ----
  ===========================
  
  The Ada testsuite includes executable tests from the ACATS testsuite,
! publicly available at <http://www.ada-auth.org/acats.html>.
  
!  These tests are integrated in the GCC testsuite in the 'ada/acats'
! directory, and enabled automatically when running 'make check', assuming
  the Ada language has been enabled when configuring GCC.
  
!  You can also run the Ada testsuite independently, using 'make
  check-ada', or run a subset of the tests by specifying which chapter to
  run, e.g.:
  
       $ make check-ada CHAPTERS="c3 c9"
  
!  The tests are organized by directory, each directory corresponding to a
! chapter of the Ada Reference Manual.  So for example, 'c9' corresponds
  to chapter 9, which deals with tasking features of the language.
  
!  There is also an extra chapter called 'gcc' containing a template for
  creating new executable tests, although this is deprecated in favor of
! the 'gnat.dg' testsuite.
  
!  The tests are run using two 'sh' scripts: 'run_acats' and 'run_all.sh'.
! To run the tests using a simulator or a cross target, see the small
! customization section at the top of 'run_all.sh'.
  
   These tests are run using the build tree: they can be run without doing
! a 'make install'.
  
  
  File: gccint.info,  Node: C Tests,  Next: libgcj Tests,  Prev: Ada Tests,  Up: Testsuites
*************** File: gccint.info,  Node: C Tests,  Next
*** 5642,5757 ****
  7.4 C Language Testsuites
  =========================
  
! GCC contains the following C language testsuites, in the
! `gcc/testsuite' directory:
  
! `gcc.dg'
!      This contains tests of particular features of the C compiler,
!      using the more modern `dg' harness.  Correctness tests for various
       compiler features should go here if possible.
  
       Magic comments determine whether the file is preprocessed,
!      compiled, linked or run.  In these tests, error and warning
!      message texts are compared against expected texts or regular
!      expressions given in comments.  These tests are run with the
!      options `-ansi -pedantic' unless other options are given in the
!      test.  Except as noted below they are not run with multiple
!      optimization options.
! 
! `gcc.dg/compat'
       This subdirectory contains tests for binary compatibility using
!      `lib/compat.exp', which in turn uses the language-independent
       support (*note Support for testing binary compatibility: compat
       Testing.).
! 
! `gcc.dg/cpp'
       This subdirectory contains tests of the preprocessor.
! 
! `gcc.dg/debug'
       This subdirectory contains tests for debug formats.  Tests in this
       subdirectory are run for each debug format that the compiler
       supports.
! 
! `gcc.dg/format'
!      This subdirectory contains tests of the `-Wformat' format
!      checking.  Tests in this directory are run with and without
!      `-DWIDE'.
! 
! `gcc.dg/noncompile'
       This subdirectory contains tests of code that should not compile
       and does not need any special compilation options.  They are run
       with multiple optimization options, since sometimes invalid code
       crashes the compiler with optimization.
! 
! `gcc.dg/special'
       FIXME: describe this.
  
! `gcc.c-torture'
       This contains particular code fragments which have historically
       broken easily.  These tests are run with multiple optimization
       options, so tests for features which only break at some
!      optimization levels belong here.  This also contains tests to
!      check that certain optimizations occur.  It might be worthwhile to
!      separate the correctness tests cleanly from the code quality
!      tests, but it hasn't been done yet.
  
! `gcc.c-torture/compat'
       FIXME: describe this.
  
       This directory should probably not be used for new tests.
! 
! `gcc.c-torture/compile'
       This testsuite contains test cases that should compile, but do not
       need to link or run.  These test cases are compiled with several
       different combinations of optimization options.  All warnings are
       disabled for these test cases, so this directory is not suitable if
       you wish to test for the presence or absence of compiler warnings.
       While special options can be set, and tests disabled on specific
!      platforms, by the use of `.x' files, mostly these test cases
!      should not contain platform dependencies.  FIXME: discuss how
!      defines such as `NO_LABEL_VALUES' and `STACK_SIZE' are used.
! 
! `gcc.c-torture/execute'
       This testsuite contains test cases that should compile, link and
!      run; otherwise the same comments as for `gcc.c-torture/compile'
       apply.
! 
! `gcc.c-torture/execute/ieee'
       This contains tests which are specific to IEEE floating point.
! 
! `gcc.c-torture/unsorted'
       FIXME: describe this.
  
       This directory should probably not be used for new tests.
! 
! `gcc.misc-tests'
       This directory contains C tests that require special handling.
       Some of these tests have individual expect files, and others share
       special-purpose expect files:
  
!     ``bprob*.c''
!           Test `-fbranch-probabilities' using
!           `gcc.misc-tests/bprob.exp', which in turn uses the generic,
            language-independent framework (*note Support for testing
            profile-directed optimizations: profopt Testing.).
  
!     ``gcov*.c''
!           Test `gcov' output using `gcov.exp', which in turn uses the
            language-independent support (*note Support for testing gcov:
            gcov Testing.).
  
!     ``i386-pf-*.c''
            Test i386-specific support for data prefetch using
!           `i386-prefetch.exp'.
! 
! `gcc.test-framework'
  
!     ``dg-*.c''
            Test the testsuite itself using
!           `gcc.test-framework/test-framework.exp'.
! 
  
!  FIXME: merge in `testsuite/README.gcc' and discuss the format of test
  cases and magic comments more.
  
  
--- 5536,5636 ----
  7.4 C Language Testsuites
  =========================
  
! GCC contains the following C language testsuites, in the 'gcc/testsuite'
! directory:
  
! 'gcc.dg'
!      This contains tests of particular features of the C compiler, using
!      the more modern 'dg' harness.  Correctness tests for various
       compiler features should go here if possible.
  
       Magic comments determine whether the file is preprocessed,
!      compiled, linked or run.  In these tests, error and warning message
!      texts are compared against expected texts or regular expressions
!      given in comments.  These tests are run with the options '-ansi
!      -pedantic' unless other options are given in the test.  Except as
!      noted below they are not run with multiple optimization options.
! 'gcc.dg/compat'
       This subdirectory contains tests for binary compatibility using
!      'lib/compat.exp', which in turn uses the language-independent
       support (*note Support for testing binary compatibility: compat
       Testing.).
! 'gcc.dg/cpp'
       This subdirectory contains tests of the preprocessor.
! 'gcc.dg/debug'
       This subdirectory contains tests for debug formats.  Tests in this
       subdirectory are run for each debug format that the compiler
       supports.
! 'gcc.dg/format'
!      This subdirectory contains tests of the '-Wformat' format checking.
!      Tests in this directory are run with and without '-DWIDE'.
! 'gcc.dg/noncompile'
       This subdirectory contains tests of code that should not compile
       and does not need any special compilation options.  They are run
       with multiple optimization options, since sometimes invalid code
       crashes the compiler with optimization.
! 'gcc.dg/special'
       FIXME: describe this.
  
! 'gcc.c-torture'
       This contains particular code fragments which have historically
       broken easily.  These tests are run with multiple optimization
       options, so tests for features which only break at some
!      optimization levels belong here.  This also contains tests to check
!      that certain optimizations occur.  It might be worthwhile to
!      separate the correctness tests cleanly from the code quality tests,
!      but it hasn't been done yet.
  
! 'gcc.c-torture/compat'
       FIXME: describe this.
  
       This directory should probably not be used for new tests.
! 'gcc.c-torture/compile'
       This testsuite contains test cases that should compile, but do not
       need to link or run.  These test cases are compiled with several
       different combinations of optimization options.  All warnings are
       disabled for these test cases, so this directory is not suitable if
       you wish to test for the presence or absence of compiler warnings.
       While special options can be set, and tests disabled on specific
!      platforms, by the use of '.x' files, mostly these test cases should
!      not contain platform dependencies.  FIXME: discuss how defines such
!      as 'NO_LABEL_VALUES' and 'STACK_SIZE' are used.
! 'gcc.c-torture/execute'
       This testsuite contains test cases that should compile, link and
!      run; otherwise the same comments as for 'gcc.c-torture/compile'
       apply.
! 'gcc.c-torture/execute/ieee'
       This contains tests which are specific to IEEE floating point.
! 'gcc.c-torture/unsorted'
       FIXME: describe this.
  
       This directory should probably not be used for new tests.
! 'gcc.misc-tests'
       This directory contains C tests that require special handling.
       Some of these tests have individual expect files, and others share
       special-purpose expect files:
  
!      'bprob*.c'
!           Test '-fbranch-probabilities' using
!           'gcc.misc-tests/bprob.exp', which in turn uses the generic,
            language-independent framework (*note Support for testing
            profile-directed optimizations: profopt Testing.).
  
!      'gcov*.c'
!           Test 'gcov' output using 'gcov.exp', which in turn uses the
            language-independent support (*note Support for testing gcov:
            gcov Testing.).
  
!      'i386-pf-*.c'
            Test i386-specific support for data prefetch using
!           'i386-prefetch.exp'.
  
! 'gcc.test-framework'
!      'dg-*.c'
            Test the testsuite itself using
!           'gcc.test-framework/test-framework.exp'.
  
!  FIXME: merge in 'testsuite/README.gcc' and discuss the format of test
  cases and magic comments more.
  
  
*************** File: gccint.info,  Node: libgcj Tests,
*** 5760,5779 ****
  7.5 The Java library testsuites.
  ================================
  
! Runtime tests are executed via `make check' in the
! `TARGET/libjava/testsuite' directory in the build tree.  Additional
  runtime tests can be checked into this testsuite.
  
   Regression testing of the core packages in libgcj is also covered by
  the Mauve testsuite.  The Mauve Project develops tests for the Java
  Class Libraries.  These tests are run as part of libgcj testing by
  placing the Mauve tree within the libjava testsuite sources at
! `libjava/testsuite/libjava.mauve/mauve', or by specifying the location
! of that tree when invoking `make', as in `make MAUVEDIR=~/mauve check'.
  
!  To detect regressions, a mechanism in `mauve.exp' compares the
! failures for a test run against the list of expected failures in
! `libjava/testsuite/libjava.mauve/xfails' from the source hierarchy.
  Update this file when adding new failing tests to Mauve, or when fixing
  bugs in libgcj that had caused Mauve test failures.
  
--- 5639,5658 ----
  7.5 The Java library testsuites.
  ================================
  
! Runtime tests are executed via 'make check' in the
! 'TARGET/libjava/testsuite' directory in the build tree.  Additional
  runtime tests can be checked into this testsuite.
  
   Regression testing of the core packages in libgcj is also covered by
  the Mauve testsuite.  The Mauve Project develops tests for the Java
  Class Libraries.  These tests are run as part of libgcj testing by
  placing the Mauve tree within the libjava testsuite sources at
! 'libjava/testsuite/libjava.mauve/mauve', or by specifying the location
! of that tree when invoking 'make', as in 'make MAUVEDIR=~/mauve check'.
  
!  To detect regressions, a mechanism in 'mauve.exp' compares the failures
! for a test run against the list of expected failures in
! 'libjava/testsuite/libjava.mauve/xfails' from the source hierarchy.
  Update this file when adding new failing tests to Mauve, or when fixing
  bugs in libgcj that had caused Mauve test failures.
  
*************** Tests for link-time optimizations usuall
*** 5789,5868 ****
  that are compiled separately, perhaps with different sets of options.
  There are several special-purpose test directives used for these tests.
  
! `{ dg-lto-do DO-WHAT-KEYWORD }'
       DO-WHAT-KEYWORD specifies how the test is compiled and whether it
       is executed.  It is one of:
  
!     `assemble'
!           Compile with `-c' to produce a relocatable object file.
! 
!     `link'
            Compile, assemble, and link to produce an executable file.
! 
!     `run'
            Produce and run an executable file, which is expected to
            return an exit code of 0.
  
!      The default is `assemble'.  That can be overridden for a set of
!      tests by redefining `dg-do-what-default' within the `.exp' file
!      for those tests.
  
!      Unlike `dg-do', `dg-lto-do' does not support an optional `target'
!      or `xfail' list.  Use `dg-skip-if', `dg-xfail-if', or
!      `dg-xfail-run-if'.
  
! `{ dg-lto-options { { OPTIONS } [{ OPTIONS }] } [{ target SELECTOR }]}'
       This directive provides a list of one or more sets of compiler
       options to override LTO_OPTIONS.  Each test will be compiled and
       run with each of these sets of options.
  
! `{ dg-extra-ld-options OPTIONS [{ target SELECTOR }]}'
       This directive adds OPTIONS to the linker options used.
  
! `{ dg-suppress-ld-options OPTIONS [{ target SELECTOR }]}'
       This directive removes OPTIONS from the set of linker options used.
  
  
  File: gccint.info,  Node: gcov Testing,  Next: profopt Testing,  Prev: LTO Testing,  Up: Testsuites
  
! 7.7 Support for testing `gcov'
  ==============================
  
! Language-independent support for testing `gcov', and for checking that
  branch profiling produces expected values, is provided by the expect
! file `lib/gcov.exp'.  `gcov' tests also rely on procedures in
! `lib/gcc-dg.exp' to compile and run the test program.  A typical `gcov'
  test contains the following DejaGnu commands within comments:
  
       { dg-options "-fprofile-arcs -ftest-coverage" }
       { dg-do run { target native } }
       { dg-final { run-gcov sourcefile } }
  
!  Checks of `gcov' output can include line counts, branch percentages,
  and call return percentages.  All of these checks are requested via
! commands that appear in comments in the test's source file.  Commands
! to check line counts are processed by default.  Commands to check
! branch percentages and call return percentages are processed if the
! `run-gcov' command has arguments `branches' or `calls', respectively.
! For example, the following specifies checking both, as well as passing
! `-b' to `gcov':
  
       { dg-final { run-gcov branches calls { -b sourcefile } } }
  
   A line count command appears within a comment on the source line that
! is expected to get the specified count and has the form `count(CNT)'.
! A test should only check line counts for lines that will get the same
  count for any architecture.
  
!  Commands to check branch percentages (`branch') and call return
! percentages (`returns') are very similar to each other.  A beginning
  command appears on or before the first of a range of lines that will
  report the percentage, and the ending command follows that range of
  lines.  The beginning command can include a list of percentages, all of
  which are expected to be found within the range.  A range is terminated
! by the next command of the same kind.  A command `branch(end)' or
! `returns(end)' marks the end of a range without starting a new one.
! For example:
  
       if (i > 10 && j > i && j < 20)  /* branch(27 50 75) */
                                       /* branch(end) */
--- 5668,5745 ----
  that are compiled separately, perhaps with different sets of options.
  There are several special-purpose test directives used for these tests.
  
! '{ dg-lto-do DO-WHAT-KEYWORD }'
       DO-WHAT-KEYWORD specifies how the test is compiled and whether it
       is executed.  It is one of:
  
!      'assemble'
!           Compile with '-c' to produce a relocatable object file.
!      'link'
            Compile, assemble, and link to produce an executable file.
!      'run'
            Produce and run an executable file, which is expected to
            return an exit code of 0.
  
!      The default is 'assemble'.  That can be overridden for a set of
!      tests by redefining 'dg-do-what-default' within the '.exp' file for
!      those tests.
  
!      Unlike 'dg-do', 'dg-lto-do' does not support an optional 'target'
!      or 'xfail' list.  Use 'dg-skip-if', 'dg-xfail-if', or
!      'dg-xfail-run-if'.
  
! '{ dg-lto-options { { OPTIONS } [{ OPTIONS }] } [{ target SELECTOR }]}'
       This directive provides a list of one or more sets of compiler
       options to override LTO_OPTIONS.  Each test will be compiled and
       run with each of these sets of options.
  
! '{ dg-extra-ld-options OPTIONS [{ target SELECTOR }]}'
       This directive adds OPTIONS to the linker options used.
  
! '{ dg-suppress-ld-options OPTIONS [{ target SELECTOR }]}'
       This directive removes OPTIONS from the set of linker options used.
  
  
  File: gccint.info,  Node: gcov Testing,  Next: profopt Testing,  Prev: LTO Testing,  Up: Testsuites
  
! 7.7 Support for testing 'gcov'
  ==============================
  
! Language-independent support for testing 'gcov', and for checking that
  branch profiling produces expected values, is provided by the expect
! file 'lib/gcov.exp'.  'gcov' tests also rely on procedures in
! 'lib/gcc-dg.exp' to compile and run the test program.  A typical 'gcov'
  test contains the following DejaGnu commands within comments:
  
       { dg-options "-fprofile-arcs -ftest-coverage" }
       { dg-do run { target native } }
       { dg-final { run-gcov sourcefile } }
  
!  Checks of 'gcov' output can include line counts, branch percentages,
  and call return percentages.  All of these checks are requested via
! commands that appear in comments in the test's source file.  Commands to
! check line counts are processed by default.  Commands to check branch
! percentages and call return percentages are processed if the 'run-gcov'
! command has arguments 'branches' or 'calls', respectively.  For example,
! the following specifies checking both, as well as passing '-b' to
! 'gcov':
  
       { dg-final { run-gcov branches calls { -b sourcefile } } }
  
   A line count command appears within a comment on the source line that
! is expected to get the specified count and has the form 'count(CNT)'.  A
! test should only check line counts for lines that will get the same
  count for any architecture.
  
!  Commands to check branch percentages ('branch') and call return
! percentages ('returns') are very similar to each other.  A beginning
  command appears on or before the first of a range of lines that will
  report the percentage, and the ending command follows that range of
  lines.  The beginning command can include a list of percentages, all of
  which are expected to be found within the range.  A range is terminated
! by the next command of the same kind.  A command 'branch(end)' or
! 'returns(end)' marks the end of a range without starting a new one.  For
! example:
  
       if (i > 10 && j > i && j < 20)  /* branch(27 50 75) */
                                       /* branch(end) */
*************** calls reported to return.  For a branch
*** 5873,5882 ****
  the expected percentage or 100 minus that value, since the direction of
  a branch can differ depending on the target or the optimization level.
  
!  Not all branches and calls need to be checked.  A test should not
! check for branches that might be optimized away or replaced with
! predicated instructions.  Don't check for calls inserted by the
! compiler or ones that might be inlined or optimized away.
  
   A single test can check for combinations of line counts, branch
  percentages, and call return percentages.  The command to check a line
--- 5750,5759 ----
  the expected percentage or 100 minus that value, since the direction of
  a branch can differ depending on the target or the optimization level.
  
!  Not all branches and calls need to be checked.  A test should not check
! for branches that might be optimized away or replaced with predicated
! instructions.  Don't check for calls inserted by the compiler or ones
! that might be inlined or optimized away.
  
   A single test can check for combinations of line counts, branch
  percentages, and call return percentages.  The command to check a line
*************** File: gccint.info,  Node: profopt Testin
*** 5890,5933 ****
  7.8 Support for testing profile-directed optimizations
  ======================================================
  
! The file `profopt.exp' provides language-independent support for
  checking correct execution of a test built with profile-directed
  optimization.  This testing requires that a test program be built and
! executed twice.  The first time it is compiled to generate profile
! data, and the second time it is compiled to use the data that was
! generated during the first execution.  The second execution is to
! verify that the test produces the expected results.
  
   To check that the optimization actually generated better code, a test
  can be built and run a third time with normal optimizations to verify
  that the performance is better with the profile-directed optimizations.
! `profopt.exp' has the beginnings of this kind of support.
  
!  `profopt.exp' provides generic support for profile-directed
  optimizations.  Each set of tests that uses it provides information
  about a specific optimization:
  
! `tool'
!      tool being tested, e.g., `gcc'
  
! `profile_option'
       options used to generate profile data
  
! `feedback_option'
       options used to optimize using that profile data
  
! `prof_ext'
       suffix of profile data files
  
! `PROFOPT_OPTIONS'
       list of options with which to run each test, similar to the lists
       for torture tests
  
! `{ dg-final-generate { LOCAL-DIRECTIVE } }'
!      This directive is similar to `dg-final', but the LOCAL-DIRECTIVE
!      is run after the generation of profile data.
  
! `{ dg-final-use { LOCAL-DIRECTIVE } }'
       The LOCAL-DIRECTIVE is run after the profile data have been used.
  
  
--- 5767,5810 ----
  7.8 Support for testing profile-directed optimizations
  ======================================================
  
! The file 'profopt.exp' provides language-independent support for
  checking correct execution of a test built with profile-directed
  optimization.  This testing requires that a test program be built and
! executed twice.  The first time it is compiled to generate profile data,
! and the second time it is compiled to use the data that was generated
! during the first execution.  The second execution is to verify that the
! test produces the expected results.
  
   To check that the optimization actually generated better code, a test
  can be built and run a third time with normal optimizations to verify
  that the performance is better with the profile-directed optimizations.
! 'profopt.exp' has the beginnings of this kind of support.
  
!  'profopt.exp' provides generic support for profile-directed
  optimizations.  Each set of tests that uses it provides information
  about a specific optimization:
  
! 'tool'
!      tool being tested, e.g., 'gcc'
  
! 'profile_option'
       options used to generate profile data
  
! 'feedback_option'
       options used to optimize using that profile data
  
! 'prof_ext'
       suffix of profile data files
  
! 'PROFOPT_OPTIONS'
       list of options with which to run each test, similar to the lists
       for torture tests
  
! '{ dg-final-generate { LOCAL-DIRECTIVE } }'
!      This directive is similar to 'dg-final', but the LOCAL-DIRECTIVE is
!      run after the generation of profile data.
  
! '{ dg-final-use { LOCAL-DIRECTIVE } }'
       The LOCAL-DIRECTIVE is run after the profile data have been used.
  
  
*************** File: gccint.info,  Node: compat Testing
*** 5936,5960 ****
  7.9 Support for testing binary compatibility
  ============================================
  
! The file `compat.exp' provides language-independent support for binary
  compatibility testing.  It supports testing interoperability of two
  compilers that follow the same ABI, or of multiple sets of compiler
  options that should not affect binary compatibility.  It is intended to
  be used for testsuites that complement ABI testsuites.
  
   A test supported by this framework has three parts, each in a separate
! source file: a main program and two pieces that interact with each
! other to split up the functionality being tested.
  
! `TESTNAME_main.SUFFIX'
       Contains the main program, which calls a function in file
!      `TESTNAME_x.SUFFIX'.
  
! `TESTNAME_x.SUFFIX'
!      Contains at least one call to a function in `TESTNAME_y.SUFFIX'.
  
! `TESTNAME_y.SUFFIX'
!      Shares data with, or gets arguments from, `TESTNAME_x.SUFFIX'.
  
   Within each test, the main program and one functional piece are
  compiled by the GCC under test.  The other piece can be compiled by an
--- 5813,5837 ----
  7.9 Support for testing binary compatibility
  ============================================
  
! The file 'compat.exp' provides language-independent support for binary
  compatibility testing.  It supports testing interoperability of two
  compilers that follow the same ABI, or of multiple sets of compiler
  options that should not affect binary compatibility.  It is intended to
  be used for testsuites that complement ABI testsuites.
  
   A test supported by this framework has three parts, each in a separate
! source file: a main program and two pieces that interact with each other
! to split up the functionality being tested.
  
! 'TESTNAME_main.SUFFIX'
       Contains the main program, which calls a function in file
!      'TESTNAME_x.SUFFIX'.
  
! 'TESTNAME_x.SUFFIX'
!      Contains at least one call to a function in 'TESTNAME_y.SUFFIX'.
  
! 'TESTNAME_y.SUFFIX'
!      Shares data with, or gets arguments from, 'TESTNAME_x.SUFFIX'.
  
   Within each test, the main program and one functional piece are
  compiled by the GCC under test.  The other piece can be compiled by an
*************** pair specifies options used with the GCC
*** 5965,5997 ****
  element of the pair specifies options used with the alternate compiler.
  Each test is compiled with each pair of options.
  
!  `compat.exp' defines default pairs of compiler options.  These can be
! overridden by defining the environment variable `COMPAT_OPTIONS' as:
  
       COMPAT_OPTIONS="[list [list {TST1} {ALT1}]
         ...[list {TSTN} {ALTN}]]"
  
   where TSTI and ALTI are lists of options, with TSTI used by the
  compiler under test and ALTI used by the alternate compiler.  For
! example, with `[list [list {-g -O0} {-O3}] [list {-fpic} {-fPIC -O2}]]',
! the test is first built with `-g -O0' by the compiler under test and
! with `-O3' by the alternate compiler.  The test is built a second time
! using `-fpic' by the compiler under test and `-fPIC -O2' by the
  alternate compiler.
  
   An alternate compiler is specified by defining an environment variable
  to be the full pathname of an installed compiler; for C define
! `ALT_CC_UNDER_TEST', and for C++ define `ALT_CXX_UNDER_TEST'.  These
! will be written to the `site.exp' file used by DejaGnu.  The default is
  to build each test with the compiler under test using the first of each
! pair of compiler options from `COMPAT_OPTIONS'.  When
! `ALT_CC_UNDER_TEST' or `ALT_CXX_UNDER_TEST' is `same', each test is
! built using the compiler under test but with combinations of the
! options from `COMPAT_OPTIONS'.
  
   To run only the C++ compatibility suite using the compiler under test
  and another version of GCC using specific compiler options, do the
! following from `OBJDIR/gcc':
  
       rm site.exp
       make -k \
--- 5842,5874 ----
  element of the pair specifies options used with the alternate compiler.
  Each test is compiled with each pair of options.
  
!  'compat.exp' defines default pairs of compiler options.  These can be
! overridden by defining the environment variable 'COMPAT_OPTIONS' as:
  
       COMPAT_OPTIONS="[list [list {TST1} {ALT1}]
         ...[list {TSTN} {ALTN}]]"
  
   where TSTI and ALTI are lists of options, with TSTI used by the
  compiler under test and ALTI used by the alternate compiler.  For
! example, with '[list [list {-g -O0} {-O3}] [list {-fpic} {-fPIC -O2}]]',
! the test is first built with '-g -O0' by the compiler under test and
! with '-O3' by the alternate compiler.  The test is built a second time
! using '-fpic' by the compiler under test and '-fPIC -O2' by the
  alternate compiler.
  
   An alternate compiler is specified by defining an environment variable
  to be the full pathname of an installed compiler; for C define
! 'ALT_CC_UNDER_TEST', and for C++ define 'ALT_CXX_UNDER_TEST'.  These
! will be written to the 'site.exp' file used by DejaGnu.  The default is
  to build each test with the compiler under test using the first of each
! pair of compiler options from 'COMPAT_OPTIONS'.  When
! 'ALT_CC_UNDER_TEST' or 'ALT_CXX_UNDER_TEST' is 'same', each test is
! built using the compiler under test but with combinations of the options
! from 'COMPAT_OPTIONS'.
  
   To run only the C++ compatibility suite using the compiler under test
  and another version of GCC using specific compiler options, do the
! following from 'OBJDIR/gcc':
  
       rm site.exp
       make -k \
*************** compiler under test but is present in th
*** 6010,6026 ****
   The binary compatibility tests support a small number of test framework
  commands that appear within comments in a test file.
  
! `dg-require-*'
!      These commands can be used in `TESTNAME_main.SUFFIX' to skip the
       test if specific support is not available on the target.
  
! `dg-options'
       The specified options are used for compiling this particular source
!      file, appended to the options from `COMPAT_OPTIONS'.  When this
!      command appears in `TESTNAME_main.SUFFIX' the options are also
!      used to link the test program.
  
! `dg-xfail-if'
       This command can be used in a secondary source file to specify that
       compilation is expected to fail for particular options on
       particular targets.
--- 5887,5903 ----
   The binary compatibility tests support a small number of test framework
  commands that appear within comments in a test file.
  
! 'dg-require-*'
!      These commands can be used in 'TESTNAME_main.SUFFIX' to skip the
       test if specific support is not available on the target.
  
! 'dg-options'
       The specified options are used for compiling this particular source
!      file, appended to the options from 'COMPAT_OPTIONS'.  When this
!      command appears in 'TESTNAME_main.SUFFIX' the options are also used
!      to link the test program.
  
! 'dg-xfail-if'
       This command can be used in a secondary source file to specify that
       compilation is expected to fail for particular options on
       particular targets.
*************** File: gccint.info,  Node: Torture Tests,
*** 6033,6070 ****
  
  Throughout the compiler testsuite there are several directories whose
  tests are run multiple times, each with a different set of options.
! These are known as torture tests.  `lib/torture-options.exp' defines
  procedures to set up these lists:
  
! `torture-init'
       Initialize use of torture lists.
! 
! `set-torture-options'
       Set lists of torture options to use for tests with and without
       loops.  Optionally combine a set of torture options with a set of
       other options, as is done with Objective-C runtime options.
! 
! `torture-finish'
       Finalize use of torture lists.
  
!  The `.exp' file for a set of tests that use torture options must
  include calls to these three procedures if:
  
!    * It calls `gcc-dg-runtest' and overrides DG_TORTURE_OPTIONS.
  
!    * It calls ${TOOL}`-torture' or ${TOOL}`-torture-execute', where
!      TOOL is `c', `fortran', or `objc'.
  
!    * It calls `dg-pch'.
  
!  It is not necessary for a `.exp' file that calls `gcc-dg-runtest' to
  call the torture procedures if the tests should use the list in
! DG_TORTURE_OPTIONS defined in `gcc-dg.exp'.
  
   Most uses of torture options can override the default lists by defining
  TORTURE_OPTIONS or add to the default list by defining
! ADDITIONAL_TORTURE_OPTIONS.  Define these in a `.dejagnurc' file or add
! them to the `site.exp' file; for example
  
       set ADDITIONAL_TORTURE_OPTIONS  [list \
         { -O2 -ftree-loop-linear } \
--- 5910,5945 ----
  
  Throughout the compiler testsuite there are several directories whose
  tests are run multiple times, each with a different set of options.
! These are known as torture tests.  'lib/torture-options.exp' defines
  procedures to set up these lists:
  
! 'torture-init'
       Initialize use of torture lists.
! 'set-torture-options'
       Set lists of torture options to use for tests with and without
       loops.  Optionally combine a set of torture options with a set of
       other options, as is done with Objective-C runtime options.
! 'torture-finish'
       Finalize use of torture lists.
  
!  The '.exp' file for a set of tests that use torture options must
  include calls to these three procedures if:
  
!    * It calls 'gcc-dg-runtest' and overrides DG_TORTURE_OPTIONS.
  
!    * It calls ${TOOL}'-torture' or ${TOOL}'-torture-execute', where TOOL
!      is 'c', 'fortran', or 'objc'.
  
!    * It calls 'dg-pch'.
  
!  It is not necessary for a '.exp' file that calls 'gcc-dg-runtest' to
  call the torture procedures if the tests should use the list in
! DG_TORTURE_OPTIONS defined in 'gcc-dg.exp'.
  
   Most uses of torture options can override the default lists by defining
  TORTURE_OPTIONS or add to the default list by defining
! ADDITIONAL_TORTURE_OPTIONS.  Define these in a '.dejagnurc' file or add
! them to the 'site.exp' file; for example
  
       set ADDITIONAL_TORTURE_OPTIONS  [list \
         { -O2 -ftree-loop-linear } \
*************** File: gccint.info,  Node: Options,  Next
*** 6076,6084 ****
  8 Option specification files
  ****************************
  
! Most GCC command-line options are described by special option
! definition files, the names of which conventionally end in `.opt'.
! This chapter describes the format of these files.
  
  * Menu:
  
--- 5951,5959 ----
  8 Option specification files
  ****************************
  
! Most GCC command-line options are described by special option definition
! files, the names of which conventionally end in '.opt'.  This chapter
! describes the format of these files.
  
  * Menu:
  
*************** semicolon.
*** 6100,6228 ****
   The files can contain the following types of record:
  
     * A language definition record.  These records have two fields: the
!      string `Language' and the name of the language.  Once a language
       has been declared in this way, it can be used as an option
       property.  *Note Option properties::.
  
!    * A target specific save record to save additional information. These
!      records have two fields: the string `TargetSave', and a
!      declaration type to go in the `cl_target_option' structure.
  
     * A variable record to define a variable used to store option
!      information.  These records have two fields: the string
!      `Variable', and a declaration of the type and name of the
!      variable, optionally with an initializer (but without any trailing
!      `;').  These records may be used for variables used for many
!      options where declaring the initializer in a single option
!      definition record, or duplicating it in many records, would be
!      inappropriate, or for variables set in option handlers rather than
!      referenced by `Var' properties.
  
     * A variable record to define a variable used to store option
       information.  These records have two fields: the string
!      `TargetVariable', and a declaration of the type and name of the
       variable, optionally with an initializer (but without any trailing
!      `;').  `TargetVariable' is a combination of `Variable' and
!      `TargetSave' records in that the variable is defined in the
!      `gcc_options' structure, but these variables are also stored in
!      the `cl_target_option' structure.  The variables are saved in the
       target save code and restored in the target restore code.
  
     * A variable record to record any additional files that the
!      `options.h' file should include.  This is useful to provide
       enumeration or structure definitions needed for target variables.
!      These records have two fields: the string `HeaderInclude' and the
       name of the include file.
  
     * A variable record to record any additional files that the
!      `options.c' or `options-save.c' file should include.  This is
       useful to provide inline functions needed for target variables
!      and/or `#ifdef' sequences to properly set up the initialization.
!      These records have two fields: the string `SourceInclude' and the
       name of the include file.
  
     * An enumeration record to define a set of strings that may be used
       as arguments to an option or options.  These records have three
!      fields: the string `Enum', a space-separated list of properties
!      and help text used to describe the set of strings in `--help'
!      output.  Properties use the same format as option properties; the
!      following are valid:
!     `Name(NAME)'
            This property is required; NAME must be a name (suitable for
            use in C identifiers) used to identify the set of strings in
!           `Enum' option properties.
  
!     `Type(TYPE)'
            This property is required; TYPE is the C type for variables
!           set by options using this enumeration together with `Var'.
  
!     `UnknownError(MESSAGE)'
            The message MESSAGE will be used as an error message if the
!           argument is invalid; for enumerations without `UnknownError',
            a generic error message is used.  MESSAGE should contain a
!           single `%qs' format, which will be used to format the invalid
            argument.
  
     * An enumeration value record to define one of the strings in a set
!      given in an `Enum' record.  These records have two fields: the
!      string `EnumValue' and a space-separated list of properties.
       Properties use the same format as option properties; the following
       are valid:
!     `Enum(NAME)'
!           This property is required; NAME says which `Enum' record this
!           `EnumValue' record corresponds to.
  
!     `String(STRING)'
            This property is required; STRING is the string option
            argument being described by this record.
  
!     `Value(VALUE)'
            This property is required; it says what value (representable
!           as `int') should be used for the given string.
  
!     `Canonical'
            This property is optional.  If present, it says the present
            string is the canonical one among all those with the given
            value.  Other strings yielding that value will be mapped to
            this one so specs do not need to handle them.
  
!     `DriverOnly'
            This property is optional.  If present, the present string
            will only be accepted by the driver.  This is used for cases
!           such as `-march=native' that are processed by the driver so
!           that `gcc -v' shows how the options chosen depended on the
            system on which the compiler was run.
  
     * An option definition record.  These records have the following
       fields:
         1. the name of the option, with the leading "-" removed
- 
         2. a space-separated list of option properties (*note Option
            properties::)
! 
!        3. the help text to use for `--help' (omitted if the second field
!           contains the `Undocumented' property).
  
       By default, all options beginning with "f", "W" or "m" are
       implicitly assumed to take a "no-" form.  This form should not be
       listed separately.  If an option beginning with one of these
       letters does not have a "no-" form, you can use the
!      `RejectNegative' property to reject it.
  
       The help text is automatically line-wrapped before being displayed.
       Normally the name of the option is printed on the left-hand side of
       the output and the help text is printed on the right.  However, if
!      the help text contains a tab character, the text to the left of
!      the tab is used instead of the option's name and the text to the
!      right of the tab forms the help text.  This allows you to
!      elaborate on what type of argument the option takes.
  
     * A target mask record.  These records have one field of the form
!      `Mask(X)'.  The options-processing script will automatically
!      allocate a bit in `target_flags' (*note Run-time Target::) for
!      each mask name X and set the macro `MASK_X' to the appropriate
!      bitmask.  It will also declare a `TARGET_X' macro that has the
!      value 1 when bit `MASK_X' is set and 0 otherwise.
  
       They are primarily intended to declare target masks that are not
       associated with user options, either because these masks represent
--- 5975,6100 ----
   The files can contain the following types of record:
  
     * A language definition record.  These records have two fields: the
!      string 'Language' and the name of the language.  Once a language
       has been declared in this way, it can be used as an option
       property.  *Note Option properties::.
  
!    * A target specific save record to save additional information.
!      These records have two fields: the string 'TargetSave', and a
!      declaration type to go in the 'cl_target_option' structure.
  
     * A variable record to define a variable used to store option
!      information.  These records have two fields: the string 'Variable',
!      and a declaration of the type and name of the variable, optionally
!      with an initializer (but without any trailing ';').  These records
!      may be used for variables used for many options where declaring the
!      initializer in a single option definition record, or duplicating it
!      in many records, would be inappropriate, or for variables set in
!      option handlers rather than referenced by 'Var' properties.
  
     * A variable record to define a variable used to store option
       information.  These records have two fields: the string
!      'TargetVariable', and a declaration of the type and name of the
       variable, optionally with an initializer (but without any trailing
!      ';').  'TargetVariable' is a combination of 'Variable' and
!      'TargetSave' records in that the variable is defined in the
!      'gcc_options' structure, but these variables are also stored in the
!      'cl_target_option' structure.  The variables are saved in the
       target save code and restored in the target restore code.
  
     * A variable record to record any additional files that the
!      'options.h' file should include.  This is useful to provide
       enumeration or structure definitions needed for target variables.
!      These records have two fields: the string 'HeaderInclude' and the
       name of the include file.
  
     * A variable record to record any additional files that the
!      'options.c' or 'options-save.c' file should include.  This is
       useful to provide inline functions needed for target variables
!      and/or '#ifdef' sequences to properly set up the initialization.
!      These records have two fields: the string 'SourceInclude' and the
       name of the include file.
  
     * An enumeration record to define a set of strings that may be used
       as arguments to an option or options.  These records have three
!      fields: the string 'Enum', a space-separated list of properties and
!      help text used to describe the set of strings in '--help' output.
!      Properties use the same format as option properties; the following
!      are valid:
!      'Name(NAME)'
            This property is required; NAME must be a name (suitable for
            use in C identifiers) used to identify the set of strings in
!           'Enum' option properties.
  
!      'Type(TYPE)'
            This property is required; TYPE is the C type for variables
!           set by options using this enumeration together with 'Var'.
  
!      'UnknownError(MESSAGE)'
            The message MESSAGE will be used as an error message if the
!           argument is invalid; for enumerations without 'UnknownError',
            a generic error message is used.  MESSAGE should contain a
!           single '%qs' format, which will be used to format the invalid
            argument.
  
     * An enumeration value record to define one of the strings in a set
!      given in an 'Enum' record.  These records have two fields: the
!      string 'EnumValue' and a space-separated list of properties.
       Properties use the same format as option properties; the following
       are valid:
!      'Enum(NAME)'
!           This property is required; NAME says which 'Enum' record this
!           'EnumValue' record corresponds to.
  
!      'String(STRING)'
            This property is required; STRING is the string option
            argument being described by this record.
  
!      'Value(VALUE)'
            This property is required; it says what value (representable
!           as 'int') should be used for the given string.
  
!      'Canonical'
            This property is optional.  If present, it says the present
            string is the canonical one among all those with the given
            value.  Other strings yielding that value will be mapped to
            this one so specs do not need to handle them.
  
!      'DriverOnly'
            This property is optional.  If present, the present string
            will only be accepted by the driver.  This is used for cases
!           such as '-march=native' that are processed by the driver so
!           that 'gcc -v' shows how the options chosen depended on the
            system on which the compiler was run.
  
     * An option definition record.  These records have the following
       fields:
         1. the name of the option, with the leading "-" removed
         2. a space-separated list of option properties (*note Option
            properties::)
!        3. the help text to use for '--help' (omitted if the second field
!           contains the 'Undocumented' property).
  
       By default, all options beginning with "f", "W" or "m" are
       implicitly assumed to take a "no-" form.  This form should not be
       listed separately.  If an option beginning with one of these
       letters does not have a "no-" form, you can use the
!      'RejectNegative' property to reject it.
  
       The help text is automatically line-wrapped before being displayed.
       Normally the name of the option is printed on the left-hand side of
       the output and the help text is printed on the right.  However, if
!      the help text contains a tab character, the text to the left of the
!      tab is used instead of the option's name and the text to the right
!      of the tab forms the help text.  This allows you to elaborate on
!      what type of argument the option takes.
  
     * A target mask record.  These records have one field of the form
!      'Mask(X)'.  The options-processing script will automatically
!      allocate a bit in 'target_flags' (*note Run-time Target::) for each
!      mask name X and set the macro 'MASK_X' to the appropriate bitmask.
!      It will also declare a 'TARGET_X' macro that has the value 1 when
!      bit 'MASK_X' is set and 0 otherwise.
  
       They are primarily intended to declare target masks that are not
       associated with user options, either because these masks represent
*************** File: gccint.info,  Node: Option propert
*** 6237,6545 ****
  
  The second field of an option record can specify any of the following
  properties.  When an option takes an argument, it is enclosed in
! parentheses following the option property name.  The parser that
! handles option files is quite simplistic, and will be tricked by any
! nested parentheses within the argument text itself; in this case, the
! entire option argument can be wrapped in curly braces within the
! parentheses to demarcate it, e.g.:
  
       Condition({defined (USE_CYGWIN_LIBSTDCXX_WRAPPERS)})
  
! `Common'
       The option is available for all languages and targets.
  
! `Target'
       The option is available for all languages but is target-specific.
  
! `Driver'
       The option is handled by the compiler driver using code not shared
!      with the compilers proper (`cc1' etc.).
  
! `LANGUAGE'
       The option is available when compiling for the given language.
  
       It is possible to specify several different languages for the same
       option.  Each LANGUAGE must have been declared by an earlier
!      `Language' record.  *Note Option file format::.
  
! `RejectDriver'
!      The option is only handled by the compilers proper (`cc1' etc.)
!      and should not be accepted by the driver.
  
! `RejectNegative'
       The option does not have a "no-" form.  All options beginning with
       "f", "W" or "m" are assumed to have a "no-" form unless this
       property is used.
  
! `Negative(OTHERNAME)'
       The option will turn off another option OTHERNAME, which is the
       option name with the leading "-" removed.  This chain action will
!      propagate through the `Negative' property of the option to be
       turned off.
  
       As a consequence, if you have a group of mutually-exclusive
!      options, their `Negative' properties should form a circular chain.
!      For example, if options `-A', `-B' and `-C' are mutually
!      exclusive, their respective `Negative' properties should be
!      `Negative(B)', `Negative(C)' and `Negative(A)'.
  
! `Joined'
! `Separate'
!      The option takes a mandatory argument.  `Joined' indicates that
!      the option and argument can be included in the same `argv' entry
!      (as with `-mflush-func=NAME', for example).  `Separate' indicates
!      that the option and argument can be separate `argv' entries (as
!      with `-o').  An option is allowed to have both of these properties.
  
! `JoinedOrMissing'
       The option takes an optional argument.  If the argument is given,
!      it will be part of the same `argv' entry as the option itself.
  
!      This property cannot be used alongside `Joined' or `Separate'.
  
! `MissingArgError(MESSAGE)'
!      For an option marked `Joined' or `Separate', the message MESSAGE
       will be used as an error message if the mandatory argument is
!      missing; for options without `MissingArgError', a generic error
!      message is used.  MESSAGE should contain a single `%qs' format,
       which will be used to format the name of the option passed.
  
! `Args(N)'
!      For an option marked `Separate', indicate that it takes N
       arguments.  The default is 1.
  
! `UInteger'
       The option's argument is a non-negative integer.  The option parser
       will check and convert the argument before passing it to the
!      relevant option handler.  `UInteger' should also be used on
!      options like `-falign-loops' where both `-falign-loops' and
!      `-falign-loops'=N are supported to make sure the saved options are
       given a full integer.
  
! `ToLower'
       The option's argument should be converted to lowercase as part of
       putting it in canonical form, and before comparing with the strings
!      indicated by any `Enum' property.
  
! `NoDriverArg'
!      For an option marked `Separate', the option only takes an argument
       in the compiler proper, not in the driver.  This is for
       compatibility with existing options that are used both directly and
!      via `-Wp,'; new options should not have this property.
  
! `Var(VAR)'
!      The state of this option should be stored in variable VAR
!      (actually a macro for `global_options.x_VAR').  The way that the
!      state is stored depends on the type of option:
  
!         * If the option uses the `Mask' or `InverseMask' properties,
!           VAR is the integer variable that contains the mask.
  
          * If the option is a normal on/off switch, VAR is an integer
            variable that is nonzero when the option is enabled.  The
            options parser will set the variable to 1 when the positive
            form of the option is used and 0 when the "no-" form is used.
  
!         * If the option takes an argument and has the `UInteger'
            property, VAR is an integer variable that stores the value of
            the argument.
  
!         * If the option takes an argument and has the `Enum' property,
!           VAR is a variable (type given in the `Type' property of the
!           `Enum' record whose `Name' property has the same argument as
!           the `Enum' property of this option) that stores the value of
            the argument.
  
!         * If the option has the `Defer' property, VAR is a pointer to a
!           `VEC(cl_deferred_option,heap)' that stores the option for
!           later processing.  (VAR is declared with type `void *' and
!           needs to be cast to `VEC(cl_deferred_option,heap)' before
            use.)
  
          * Otherwise, if the option takes an argument, VAR is a pointer
            to the argument string.  The pointer will be null if the
            argument is optional and wasn't given.
  
!      The option-processing script will usually zero-initialize VAR.
!      You can modify this behavior using `Init'.
  
! `Var(VAR, SET)'
       The option controls an integer variable VAR and is active when VAR
       equals SET.  The option parser will set VAR to SET when the
!      positive form of the option is used and `!SET' when the "no-" form
       is used.
  
       VAR is declared in the same way as for the single-argument form
       described above.
  
! `Init(VALUE)'
!      The variable specified by the `Var' property should be statically
       initialized to VALUE.  If more than one option using the same
!      variable specifies `Init', all must specify the same initializer.
  
! `Mask(NAME)'
!      The option is associated with a bit in the `target_flags' variable
       (*note Run-time Target::) and is active when that bit is set.  You
!      may also specify `Var' to select a variable other than
!      `target_flags'.
  
       The options-processing script will automatically allocate a unique
!      bit for the option.  If the option is attached to `target_flags',
!      the script will set the macro `MASK_NAME' to the appropriate
!      bitmask.  It will also declare a `TARGET_NAME' macro that has the
       value 1 when the option is active and 0 otherwise.  If you use
!      `Var' to attach the option to a different variable, the bitmask
!      macro with be called `OPTION_MASK_NAME'.
  
! `InverseMask(OTHERNAME)'
! `InverseMask(OTHERNAME, THISNAME)'
       The option is the inverse of another option that has the
!      `Mask(OTHERNAME)' property.  If THISNAME is given, the
!      options-processing script will declare a `TARGET_THISNAME' macro
       that is 1 when the option is active and 0 otherwise.
  
! `Enum(NAME)'
       The option's argument is a string from the set of strings
!      associated with the corresponding `Enum' record.  The string is
       checked and converted to the integer specified in the corresponding
!      `EnumValue' record before being passed to option handlers.
  
! `Defer'
!      The option should be stored in a vector, specified with `Var', for
       later processing.
  
! `Alias(OPT)'
! `Alias(OPT, ARG)'
! `Alias(OPT, POSARG, NEGARG)'
!      The option is an alias for `-OPT' (or the negative form of that
!      option, depending on `NegativeAlias').  In the first form, any
!      argument passed to the alias is considered to be passed to `-OPT',
!      and `-OPT' is considered to be negated if the alias is used in
       negated form.  In the second form, the alias may not be negated or
       have an argument, and POSARG is considered to be passed as an
!      argument to `-OPT'.  In the third form, the alias may not have an
       argument, if the alias is used in the positive form then POSARG is
!      considered to be passed to `-OPT', and if the alias is used in the
!      negative form then NEGARG is considered to be passed to `-OPT'.
  
!      Aliases should not specify `Var' or `Mask' or `UInteger'.  Aliases
       should normally specify the same languages as the target of the
       alias; the flags on the target will be used to determine any
!      diagnostic for use of an option for the wrong language, while
!      those on the alias will be used to identify what command-line text
!      is the option and what text is any argument to that option.
  
!      When an `Alias' definition is used for an option, driver specs do
!      not need to handle it and no `OPT_' enumeration value is defined
       for it; only the canonical form of the option will be seen in those
       places.
  
! `NegativeAlias'
!      For an option marked with `Alias(OPT)', the option is considered
!      to be an alias for the positive form of `-OPT' if negated and for
!      the negative form of `-OPT' if not negated.  `NegativeAlias' may
!      not be used with the forms of `Alias' taking more than one
!      argument.
  
! `Ignore'
       This option is ignored apart from printing any warning specified
!      using `Warn'.  The option will not be seen by specs and no `OPT_'
       enumeration value is defined for it.
  
! `SeparateAlias'
!      For an option marked with `Joined', `Separate' and `Alias', the
       option only acts as an alias when passed a separate argument; with
!      a joined argument it acts as a normal option, with an `OPT_'
!      enumeration value.  This is for compatibility with the Java `-d'
       option and should not be used for new options.
  
! `Warn(MESSAGE)'
       If this option is used, output the warning MESSAGE.  MESSAGE is a
!      format string, either taking a single operand with a `%qs' format
       which is the option name, or not taking any operands, which is
!      passed to the `warning' function.  If an alias is marked `Warn',
!      the target of the alias must not also be marked `Warn'.
  
! `Report'
!      The state of the option should be printed by `-fverbose-asm'.
  
! `Warning'
!      This is a warning option and should be shown as such in `--help'
       output.  This flag does not currently affect anything other than
!      `--help'.
  
! `Optimization'
       This is an optimization option.  It should be shown as such in
!      `--help' output, and any associated variable named using `Var'
!      should be saved and restored when the optimization level is
!      changed with `optimize' attributes.
  
! `Undocumented'
       The option is deliberately missing documentation and should not be
!      included in the `--help' output.
  
! `Condition(COND)'
       The option should only be accepted if preprocessor condition COND
       is true.  Note that any C declarations associated with the option
!      will be present even if COND is false; COND simply controls
!      whether the option is accepted and whether it is printed in the
!      `--help' output.
  
! `Save'
!      Build the `cl_target_option' structure to hold a copy of the
!      option, add the functions `cl_target_option_save' and
!      `cl_target_option_restore' to save and restore the options.
  
! `SetByCombined'
       The option may also be set by a combined option such as
!      `-ffast-math'.  This causes the `gcc_options' struct to have a
!      field `frontend_set_NAME', where `NAME' is the name of the field
!      holding the value of this option (without the leading `x_').  This
       gives the front end a way to indicate that the value has been set
       explicitly and should not be changed by the combined option.  For
!      example, some front ends use this to prevent `-ffast-math' and
!      `-fno-fast-math' from changing the value of `-fmath-errno' for
!      languages that do not use `errno'.
  
! `EnabledBy(OPT)'
! `EnabledBy(OPT || OPT2)'
! `EnabledBy(OPT && OPT2)'
!      If not explicitly set, the option is set to the value of `-OPT';
!      multiple options can be given, separated by `||'.  The third form
!      using `&&' specifies that the option is only set if both OPT and
       OPT2 are set.
  
! `LangEnabledBy(LANGUAGE, OPT)'
! `LangEnabledBy(LANGUAGE, OPT, POSARG, NEGARG)'
       When compiling for the given language, the option is set to the
!      value of `-OPT', if not explicitly set. OPT can be also a list of
!      `||' separated options. In the second form, if OPT is used in the
!      positive form then POSARG is considered to be passed to the
!      option, and if OPT is used in the negative form then NEGARG is
!      considered to be passed to the option.  It is possible to specify
!      several different languages.  Each LANGUAGE must have been
!      declared by an earlier `Language' record.  *Note Option file
!      format::.
  
! `NoDWARFRecord'
       The option is omitted from the producer string written by
!      `-grecord-gcc-switches'.
  
! `PchIgnore'
!      Even if this is a target option, this option will not be recorded
!      / compared to determine if a precompiled header file matches.
  
! `CPP(VAR)'
       The state of this option should be kept in sync with the
       preprocessor option VAR.  If this property is set, then properties
!      `Var' and `Init' must be set as well.
  
! `CppReason(CPP_W_ENUM)'
!      This warning option corresponds to `cpplib.h' warning reason code
       CPP_W_ENUM.  This should only be used for warning options of the
       C-family front-ends.
  
- 
  
  File: gccint.info,  Node: Passes,  Next: GENERIC,  Prev: Options,  Up: Top
  
--- 6109,6414 ----
  
  The second field of an option record can specify any of the following
  properties.  When an option takes an argument, it is enclosed in
! parentheses following the option property name.  The parser that handles
! option files is quite simplistic, and will be tricked by any nested
! parentheses within the argument text itself; in this case, the entire
! option argument can be wrapped in curly braces within the parentheses to
! demarcate it, e.g.:
  
       Condition({defined (USE_CYGWIN_LIBSTDCXX_WRAPPERS)})
  
! 'Common'
       The option is available for all languages and targets.
  
! 'Target'
       The option is available for all languages but is target-specific.
  
! 'Driver'
       The option is handled by the compiler driver using code not shared
!      with the compilers proper ('cc1' etc.).
  
! 'LANGUAGE'
       The option is available when compiling for the given language.
  
       It is possible to specify several different languages for the same
       option.  Each LANGUAGE must have been declared by an earlier
!      'Language' record.  *Note Option file format::.
  
! 'RejectDriver'
!      The option is only handled by the compilers proper ('cc1' etc.) and
!      should not be accepted by the driver.
  
! 'RejectNegative'
       The option does not have a "no-" form.  All options beginning with
       "f", "W" or "m" are assumed to have a "no-" form unless this
       property is used.
  
! 'Negative(OTHERNAME)'
       The option will turn off another option OTHERNAME, which is the
       option name with the leading "-" removed.  This chain action will
!      propagate through the 'Negative' property of the option to be
       turned off.
  
       As a consequence, if you have a group of mutually-exclusive
!      options, their 'Negative' properties should form a circular chain.
!      For example, if options '-A', '-B' and '-C' are mutually exclusive,
!      their respective 'Negative' properties should be 'Negative(B)',
!      'Negative(C)' and 'Negative(A)'.
  
! 'Joined'
! 'Separate'
!      The option takes a mandatory argument.  'Joined' indicates that the
!      option and argument can be included in the same 'argv' entry (as
!      with '-mflush-func=NAME', for example).  'Separate' indicates that
!      the option and argument can be separate 'argv' entries (as with
!      '-o').  An option is allowed to have both of these properties.
  
! 'JoinedOrMissing'
       The option takes an optional argument.  If the argument is given,
!      it will be part of the same 'argv' entry as the option itself.
  
!      This property cannot be used alongside 'Joined' or 'Separate'.
  
! 'MissingArgError(MESSAGE)'
!      For an option marked 'Joined' or 'Separate', the message MESSAGE
       will be used as an error message if the mandatory argument is
!      missing; for options without 'MissingArgError', a generic error
!      message is used.  MESSAGE should contain a single '%qs' format,
       which will be used to format the name of the option passed.
  
! 'Args(N)'
!      For an option marked 'Separate', indicate that it takes N
       arguments.  The default is 1.
  
! 'UInteger'
       The option's argument is a non-negative integer.  The option parser
       will check and convert the argument before passing it to the
!      relevant option handler.  'UInteger' should also be used on options
!      like '-falign-loops' where both '-falign-loops' and
!      '-falign-loops'=N are supported to make sure the saved options are
       given a full integer.
  
! 'ToLower'
       The option's argument should be converted to lowercase as part of
       putting it in canonical form, and before comparing with the strings
!      indicated by any 'Enum' property.
  
! 'NoDriverArg'
!      For an option marked 'Separate', the option only takes an argument
       in the compiler proper, not in the driver.  This is for
       compatibility with existing options that are used both directly and
!      via '-Wp,'; new options should not have this property.
  
! 'Var(VAR)'
!      The state of this option should be stored in variable VAR (actually
!      a macro for 'global_options.x_VAR').  The way that the state is
!      stored depends on the type of option:
  
!         * If the option uses the 'Mask' or 'InverseMask' properties, VAR
!           is the integer variable that contains the mask.
  
          * If the option is a normal on/off switch, VAR is an integer
            variable that is nonzero when the option is enabled.  The
            options parser will set the variable to 1 when the positive
            form of the option is used and 0 when the "no-" form is used.
  
!         * If the option takes an argument and has the 'UInteger'
            property, VAR is an integer variable that stores the value of
            the argument.
  
!         * If the option takes an argument and has the 'Enum' property,
!           VAR is a variable (type given in the 'Type' property of the
!           'Enum' record whose 'Name' property has the same argument as
!           the 'Enum' property of this option) that stores the value of
            the argument.
  
!         * If the option has the 'Defer' property, VAR is a pointer to a
!           'VEC(cl_deferred_option,heap)' that stores the option for
!           later processing.  (VAR is declared with type 'void *' and
!           needs to be cast to 'VEC(cl_deferred_option,heap)' before
            use.)
  
          * Otherwise, if the option takes an argument, VAR is a pointer
            to the argument string.  The pointer will be null if the
            argument is optional and wasn't given.
  
!      The option-processing script will usually zero-initialize VAR.  You
!      can modify this behavior using 'Init'.
  
! 'Var(VAR, SET)'
       The option controls an integer variable VAR and is active when VAR
       equals SET.  The option parser will set VAR to SET when the
!      positive form of the option is used and '!SET' when the "no-" form
       is used.
  
       VAR is declared in the same way as for the single-argument form
       described above.
  
! 'Init(VALUE)'
!      The variable specified by the 'Var' property should be statically
       initialized to VALUE.  If more than one option using the same
!      variable specifies 'Init', all must specify the same initializer.
  
! 'Mask(NAME)'
!      The option is associated with a bit in the 'target_flags' variable
       (*note Run-time Target::) and is active when that bit is set.  You
!      may also specify 'Var' to select a variable other than
!      'target_flags'.
  
       The options-processing script will automatically allocate a unique
!      bit for the option.  If the option is attached to 'target_flags',
!      the script will set the macro 'MASK_NAME' to the appropriate
!      bitmask.  It will also declare a 'TARGET_NAME' macro that has the
       value 1 when the option is active and 0 otherwise.  If you use
!      'Var' to attach the option to a different variable, the bitmask
!      macro with be called 'OPTION_MASK_NAME'.
  
! 'InverseMask(OTHERNAME)'
! 'InverseMask(OTHERNAME, THISNAME)'
       The option is the inverse of another option that has the
!      'Mask(OTHERNAME)' property.  If THISNAME is given, the
!      options-processing script will declare a 'TARGET_THISNAME' macro
       that is 1 when the option is active and 0 otherwise.
  
! 'Enum(NAME)'
       The option's argument is a string from the set of strings
!      associated with the corresponding 'Enum' record.  The string is
       checked and converted to the integer specified in the corresponding
!      'EnumValue' record before being passed to option handlers.
  
! 'Defer'
!      The option should be stored in a vector, specified with 'Var', for
       later processing.
  
! 'Alias(OPT)'
! 'Alias(OPT, ARG)'
! 'Alias(OPT, POSARG, NEGARG)'
!      The option is an alias for '-OPT' (or the negative form of that
!      option, depending on 'NegativeAlias').  In the first form, any
!      argument passed to the alias is considered to be passed to '-OPT',
!      and '-OPT' is considered to be negated if the alias is used in
       negated form.  In the second form, the alias may not be negated or
       have an argument, and POSARG is considered to be passed as an
!      argument to '-OPT'.  In the third form, the alias may not have an
       argument, if the alias is used in the positive form then POSARG is
!      considered to be passed to '-OPT', and if the alias is used in the
!      negative form then NEGARG is considered to be passed to '-OPT'.
  
!      Aliases should not specify 'Var' or 'Mask' or 'UInteger'.  Aliases
       should normally specify the same languages as the target of the
       alias; the flags on the target will be used to determine any
!      diagnostic for use of an option for the wrong language, while those
!      on the alias will be used to identify what command-line text is the
!      option and what text is any argument to that option.
  
!      When an 'Alias' definition is used for an option, driver specs do
!      not need to handle it and no 'OPT_' enumeration value is defined
       for it; only the canonical form of the option will be seen in those
       places.
  
! 'NegativeAlias'
!      For an option marked with 'Alias(OPT)', the option is considered to
!      be an alias for the positive form of '-OPT' if negated and for the
!      negative form of '-OPT' if not negated.  'NegativeAlias' may not be
!      used with the forms of 'Alias' taking more than one argument.
  
! 'Ignore'
       This option is ignored apart from printing any warning specified
!      using 'Warn'.  The option will not be seen by specs and no 'OPT_'
       enumeration value is defined for it.
  
! 'SeparateAlias'
!      For an option marked with 'Joined', 'Separate' and 'Alias', the
       option only acts as an alias when passed a separate argument; with
!      a joined argument it acts as a normal option, with an 'OPT_'
!      enumeration value.  This is for compatibility with the Java '-d'
       option and should not be used for new options.
  
! 'Warn(MESSAGE)'
       If this option is used, output the warning MESSAGE.  MESSAGE is a
!      format string, either taking a single operand with a '%qs' format
       which is the option name, or not taking any operands, which is
!      passed to the 'warning' function.  If an alias is marked 'Warn',
!      the target of the alias must not also be marked 'Warn'.
  
! 'Report'
!      The state of the option should be printed by '-fverbose-asm'.
  
! 'Warning'
!      This is a warning option and should be shown as such in '--help'
       output.  This flag does not currently affect anything other than
!      '--help'.
  
! 'Optimization'
       This is an optimization option.  It should be shown as such in
!      '--help' output, and any associated variable named using 'Var'
!      should be saved and restored when the optimization level is changed
!      with 'optimize' attributes.
  
! 'Undocumented'
       The option is deliberately missing documentation and should not be
!      included in the '--help' output.
  
! 'Condition(COND)'
       The option should only be accepted if preprocessor condition COND
       is true.  Note that any C declarations associated with the option
!      will be present even if COND is false; COND simply controls whether
!      the option is accepted and whether it is printed in the '--help'
!      output.
  
! 'Save'
!      Build the 'cl_target_option' structure to hold a copy of the
!      option, add the functions 'cl_target_option_save' and
!      'cl_target_option_restore' to save and restore the options.
  
! 'SetByCombined'
       The option may also be set by a combined option such as
!      '-ffast-math'.  This causes the 'gcc_options' struct to have a
!      field 'frontend_set_NAME', where 'NAME' is the name of the field
!      holding the value of this option (without the leading 'x_').  This
       gives the front end a way to indicate that the value has been set
       explicitly and should not be changed by the combined option.  For
!      example, some front ends use this to prevent '-ffast-math' and
!      '-fno-fast-math' from changing the value of '-fmath-errno' for
!      languages that do not use 'errno'.
  
! 'EnabledBy(OPT)'
! 'EnabledBy(OPT || OPT2)'
! 'EnabledBy(OPT && OPT2)'
!      If not explicitly set, the option is set to the value of '-OPT';
!      multiple options can be given, separated by '||'.  The third form
!      using '&&' specifies that the option is only set if both OPT and
       OPT2 are set.
  
! 'LangEnabledBy(LANGUAGE, OPT)'
! 'LangEnabledBy(LANGUAGE, OPT, POSARG, NEGARG)'
       When compiling for the given language, the option is set to the
!      value of '-OPT', if not explicitly set.  OPT can be also a list of
!      '||' separated options.  In the second form, if OPT is used in the
!      positive form then POSARG is considered to be passed to the option,
!      and if OPT is used in the negative form then NEGARG is considered
!      to be passed to the option.  It is possible to specify several
!      different languages.  Each LANGUAGE must have been declared by an
!      earlier 'Language' record.  *Note Option file format::.
  
! 'NoDWARFRecord'
       The option is omitted from the producer string written by
!      '-grecord-gcc-switches'.
  
! 'PchIgnore'
!      Even if this is a target option, this option will not be recorded /
!      compared to determine if a precompiled header file matches.
  
! 'CPP(VAR)'
       The state of this option should be kept in sync with the
       preprocessor option VAR.  If this property is set, then properties
!      'Var' and 'Init' must be set as well.
  
! 'CppReason(CPP_W_ENUM)'
!      This warning option corresponds to 'cpplib.h' warning reason code
       CPP_W_ENUM.  This should only be used for warning options of the
       C-family front-ends.
  
  
  File: gccint.info,  Node: Passes,  Next: GENERIC,  Prev: Options,  Up: Top
  
*************** File: gccint.info,  Node: Parsing pass,
*** 6568,6606 ****
  ================
  
  The language front end is invoked only once, via
! `lang_hooks.parse_file', to parse the entire input.  The language front
! end may use any intermediate language representation deemed
! appropriate.  The C front end uses GENERIC trees (*note GENERIC::), plus
! a double handful of language specific tree codes defined in
! `c-common.def'.  The Fortran front end uses a completely different
! private representation.
  
   At some point the front end must translate the representation used in
  the front end to a representation understood by the language-independent
! portions of the compiler.  Current practice takes one of two forms.
! The C front end manually invokes the gimplifier (*note GIMPLE::) on
! each function, and uses the gimplifier callbacks to convert the
  language-specific tree nodes directly to GIMPLE before passing the
  function off to be compiled.  The Fortran front end converts from a
! private representation to GENERIC, which is later lowered to GIMPLE
! when the function is compiled.  Which route to choose probably depends
! on how well GENERIC (plus extensions) can be made to match up with the
! source language and necessary parsing data structures.
  
   BUG: Gimplification must occur before nested function lowering, and
  nested function lowering must be done by the front end before passing
  the data off to cgraph.
  
!  TODO: Cgraph should control nested function lowering.  It would only
! be invoked when it is certain that the outer-most function is used.
  
   TODO: Cgraph needs a gimplify_function callback.  It should be invoked
  when (1) it is certain that the function is used, (2) warning flags
  specified by the user require some amount of compilation in order to
! honor, (3) the language indicates that semantic analysis is not
! complete until gimplification occurs.  Hum... this sounds overly
! complicated.  Perhaps we should just have the front end gimplify
! always; in most cases it's only one function call.
  
   The front end needs to pass all function definitions and top level
  declarations off to the middle-end so that they can be compiled and
--- 6437,6474 ----
  ================
  
  The language front end is invoked only once, via
! 'lang_hooks.parse_file', to parse the entire input.  The language front
! end may use any intermediate language representation deemed appropriate.
! The C front end uses GENERIC trees (*note GENERIC::), plus a double
! handful of language specific tree codes defined in 'c-common.def'.  The
! Fortran front end uses a completely different private representation.
  
   At some point the front end must translate the representation used in
  the front end to a representation understood by the language-independent
! portions of the compiler.  Current practice takes one of two forms.  The
! C front end manually invokes the gimplifier (*note GIMPLE::) on each
! function, and uses the gimplifier callbacks to convert the
  language-specific tree nodes directly to GIMPLE before passing the
  function off to be compiled.  The Fortran front end converts from a
! private representation to GENERIC, which is later lowered to GIMPLE when
! the function is compiled.  Which route to choose probably depends on how
! well GENERIC (plus extensions) can be made to match up with the source
! language and necessary parsing data structures.
  
   BUG: Gimplification must occur before nested function lowering, and
  nested function lowering must be done by the front end before passing
  the data off to cgraph.
  
!  TODO: Cgraph should control nested function lowering.  It would only be
! invoked when it is certain that the outer-most function is used.
  
   TODO: Cgraph needs a gimplify_function callback.  It should be invoked
  when (1) it is certain that the function is used, (2) warning flags
  specified by the user require some amount of compilation in order to
! honor, (3) the language indicates that semantic analysis is not complete
! until gimplification occurs.  Hum... this sounds overly complicated.
! Perhaps we should just have the front end gimplify always; in most cases
! it's only one function call.
  
   The front end needs to pass all function definitions and top level
  declarations off to the middle-end so that they can be compiled and
*************** all be passed as well.
*** 6615,6631 ****
  
   In any case, the front end needs each complete top-level function or
  data declaration, and each data definition should be passed to
! `rest_of_decl_compilation'.  Each complete type definition should be
! passed to `rest_of_type_compilation'.  Each function definition should
! be passed to `cgraph_finalize_function'.
  
   TODO: I know rest_of_compilation currently has all sorts of RTL
  generation semantics.  I plan to move all code generation bits (both
! Tree and RTL) to compile_function.  Should we hide cgraph from the
! front ends and move back to rest_of_compilation as the official
! interface?  Possibly we should rename all three interfaces such that
! the names match in some meaningful way and that is more descriptive
! than "rest_of".
  
   The middle-end will, at its option, emit the function and data
  definitions immediately or queue them for later processing.
--- 6483,6498 ----
  
   In any case, the front end needs each complete top-level function or
  data declaration, and each data definition should be passed to
! 'rest_of_decl_compilation'.  Each complete type definition should be
! passed to 'rest_of_type_compilation'.  Each function definition should
! be passed to 'cgraph_finalize_function'.
  
   TODO: I know rest_of_compilation currently has all sorts of RTL
  generation semantics.  I plan to move all code generation bits (both
! Tree and RTL) to compile_function.  Should we hide cgraph from the front
! ends and move back to rest_of_compilation as the official interface?
! Possibly we should rename all three interfaces such that the names match
! in some meaningful way and that is more descriptive than "rest_of".
  
   The middle-end will, at its option, emit the function and data
  definitions immediately or queue them for later processing.
*************** File: gccint.info,  Node: Cilk Plus Tran
*** 6636,6695 ****
  9.2 Cilk Plus Transformation
  ============================
  
! If Cilk Plus generation (flag `-fcilkplus') is enabled, all the Cilk
  Plus code is transformed into equivalent C and C++ functions.  Majority
  of this transformation occurs toward the end of the parsing and right
  before the gimplification pass.
  
   These are the major components to the Cilk Plus language extension:
     * Array Notations: During parsing phase, all the array notation
!      specific information is stored in `ARRAY_NOTATION_REF' tree using
!      the function `c_parser_array_notation'.  During the end of
!      parsing, we check the entire function to see if there are any
!      array notation specific code (using the function
!      `contains_array_notation_expr').  If this function returns true,
!      then we expand them using either `expand_array_notation_exprs' or
!      `build_array_notation_expr'.  For the cases where array notations
!      are inside conditions, they are transformed using the function
!      `fix_conditional_array_notations'.  The C language-specific
!      routines are located in `c/c-array-notation.c' and the equivalent
!      C++ routines are in the file `cp/cp-array-notation.c'.  Common
!      routines such as functions to initialize built-in functions are
!      stored in `array-notation-common.c'.
  
     * Cilk keywords:
!         * `_Cilk_spawn': The `_Cilk_spawn' keyword is parsed and the
            function it contains is marked as a spawning function.  The
            spawning function is called the spawner.  At the end of the
!           parsing phase, appropriate built-in functions are added to
!           the spawner that are defined in the Cilk runtime.  The
!           appropriate locations of these functions, and the internal
!           structures are detailed in `cilk_init_builtins' in the file
!           `cilk-common.c'.  The pointers to Cilk functions and fields
!           of internal structures are described in `cilk.h'.  The
!           built-in functions are described in `cilk-builtins.def'.
  
            During gimplification, a new "spawn-helper" function is
!           created.  The spawned function is replaced with a spawn
!           helper function in the spawner.  The spawned function-call is
!           moved into the spawn helper.  The main function that does
!           these transformations is `gimplify_cilk_spawn' in
!           `c-family/cilk.c'.  In the spawn-helper, the gimplification
!           function `gimplify_call_expr', inserts a function call
!           `__cilkrts_detach'.  This function is expanded by
!           `builtin_expand_cilk_detach' located in `c-family/cilk.c'.
  
!         * `_Cilk_sync': `_Cilk_sync' is parsed like a keyword.  During
!           gimplification, the function `gimplify_cilk_sync' in
!           `c-family/cilk.c', will replace this keyword with a set of
            functions that are stored in the Cilk runtime.  One of the
            internal functions inserted during gimplification,
!           `__cilkrts_pop_frame' must be expanded by the compiler and is
!           done by `builtin_expand_cilk_pop_frame' in `cilk-common.c'.
! 
  
   Documentation about Cilk Plus and language specification is provided
! under the "Learn" section in `http://www.cilkplus.org/'.  It is worth
  mentioning that the current implementation follows ABI 1.1.
  
  
--- 6503,6561 ----
  9.2 Cilk Plus Transformation
  ============================
  
! If Cilk Plus generation (flag '-fcilkplus') is enabled, all the Cilk
  Plus code is transformed into equivalent C and C++ functions.  Majority
  of this transformation occurs toward the end of the parsing and right
  before the gimplification pass.
  
   These are the major components to the Cilk Plus language extension:
     * Array Notations: During parsing phase, all the array notation
!      specific information is stored in 'ARRAY_NOTATION_REF' tree using
!      the function 'c_parser_array_notation'.  During the end of parsing,
!      we check the entire function to see if there are any array notation
!      specific code (using the function 'contains_array_notation_expr').
!      If this function returns true, then we expand them using either
!      'expand_array_notation_exprs' or 'build_array_notation_expr'.  For
!      the cases where array notations are inside conditions, they are
!      transformed using the function 'fix_conditional_array_notations'.
!      The C language-specific routines are located in
!      'c/c-array-notation.c' and the equivalent C++ routines are in the
!      file 'cp/cp-array-notation.c'.  Common routines such as functions
!      to initialize built-in functions are stored in
!      'array-notation-common.c'.
  
     * Cilk keywords:
!         * '_Cilk_spawn': The '_Cilk_spawn' keyword is parsed and the
            function it contains is marked as a spawning function.  The
            spawning function is called the spawner.  At the end of the
!           parsing phase, appropriate built-in functions are added to the
!           spawner that are defined in the Cilk runtime.  The appropriate
!           locations of these functions, and the internal structures are
!           detailed in 'cilk_init_builtins' in the file 'cilk-common.c'.
!           The pointers to Cilk functions and fields of internal
!           structures are described in 'cilk.h'.  The built-in functions
!           are described in 'cilk-builtins.def'.
  
            During gimplification, a new "spawn-helper" function is
!           created.  The spawned function is replaced with a spawn helper
!           function in the spawner.  The spawned function-call is moved
!           into the spawn helper.  The main function that does these
!           transformations is 'gimplify_cilk_spawn' in 'c-family/cilk.c'.
!           In the spawn-helper, the gimplification function
!           'gimplify_call_expr', inserts a function call
!           '__cilkrts_detach'.  This function is expanded by
!           'builtin_expand_cilk_detach' located in 'c-family/cilk.c'.
  
!         * '_Cilk_sync': '_Cilk_sync' is parsed like a keyword.  During
!           gimplification, the function 'gimplify_cilk_sync' in
!           'c-family/cilk.c', will replace this keyword with a set of
            functions that are stored in the Cilk runtime.  One of the
            internal functions inserted during gimplification,
!           '__cilkrts_pop_frame' must be expanded by the compiler and is
!           done by 'builtin_expand_cilk_pop_frame' in 'cilk-common.c'.
  
   Documentation about Cilk Plus and language specification is provided
! under the "Learn" section in <https://www.cilkplus.org>.  It is worth
  mentioning that the current implementation follows ABI 1.1.
  
  
*************** intermediate language used by the front
*** 6710,6732 ****
  Usually it is easier to generate GENERIC trees plus extensions and let
  the language-independent gimplifier do most of the work.
  
!  The main entry point to this pass is `gimplify_function_tree' located
! in `gimplify.c'.  From here we process the entire function gimplifying
  each statement in turn.  The main workhorse for this pass is
! `gimplify_expr'.  Approximately everything passes through here at least
! once, and it is from here that we invoke the `lang_hooks.gimplify_expr'
  callback.
  
   The callback should examine the expression in question and return
! `GS_UNHANDLED' if the expression is not a language specific construct
  that requires attention.  Otherwise it should alter the expression in
  some way to such that forward progress is made toward producing valid
  GIMPLE.  If the callback is certain that the transformation is complete
! and the expression is valid GIMPLE, it should return `GS_ALL_DONE'.
! Otherwise it should return `GS_OK', which will cause the expression to
  be processed again.  If the callback encounters an error during the
  transformation (because the front end is relying on the gimplification
! process to finish semantic checks), it should return `GS_ERROR'.
  
  
  File: gccint.info,  Node: Pass manager,  Next: Tree SSA passes,  Prev: Gimplification pass,  Up: Passes
--- 6576,6598 ----
  Usually it is easier to generate GENERIC trees plus extensions and let
  the language-independent gimplifier do most of the work.
  
!  The main entry point to this pass is 'gimplify_function_tree' located
! in 'gimplify.c'.  From here we process the entire function gimplifying
  each statement in turn.  The main workhorse for this pass is
! 'gimplify_expr'.  Approximately everything passes through here at least
! once, and it is from here that we invoke the 'lang_hooks.gimplify_expr'
  callback.
  
   The callback should examine the expression in question and return
! 'GS_UNHANDLED' if the expression is not a language specific construct
  that requires attention.  Otherwise it should alter the expression in
  some way to such that forward progress is made toward producing valid
  GIMPLE.  If the callback is certain that the transformation is complete
! and the expression is valid GIMPLE, it should return 'GS_ALL_DONE'.
! Otherwise it should return 'GS_OK', which will cause the expression to
  be processed again.  If the callback encounters an error during the
  transformation (because the front end is relying on the gimplification
! process to finish semantic checks), it should return 'GS_ERROR'.
  
  
  File: gccint.info,  Node: Pass manager,  Next: Tree SSA passes,  Prev: Gimplification pass,  Up: Passes
*************** File: gccint.info,  Node: Pass manager,
*** 6734,6753 ****
  9.4 Pass manager
  ================
  
! The pass manager is located in `passes.c', `tree-optimize.c' and
! `tree-pass.h'.  It processes passes as described in `passes.def'.  Its
  job is to run all of the individual passes in the correct order, and
  take care of standard bookkeeping that applies to every pass.
  
   The theory of operation is that each pass defines a structure that
! represents everything we need to know about that pass--when it should
! be run, how it should be run, what intermediate language form or
! on-the-side data structures it needs.  We register the pass to be run
! in some particular order, and the pass manager arranges for everything
! to happen in the correct order.
  
   The actuality doesn't completely live up to the theory at present.
! Command-line switches and `timevar_id_t' enumerations must still be
  defined elsewhere.  The pass manager validates constraints but does not
  attempt to (re-)generate data structures or lower intermediate language
  form based on the requirements of the next pass.  Nevertheless, what is
--- 6600,6619 ----
  9.4 Pass manager
  ================
  
! The pass manager is located in 'passes.c', 'tree-optimize.c' and
! 'tree-pass.h'.  It processes passes as described in 'passes.def'.  Its
  job is to run all of the individual passes in the correct order, and
  take care of standard bookkeeping that applies to every pass.
  
   The theory of operation is that each pass defines a structure that
! represents everything we need to know about that pass--when it should be
! run, how it should be run, what intermediate language form or
! on-the-side data structures it needs.  We register the pass to be run in
! some particular order, and the pass manager arranges for everything to
! happen in the correct order.
  
   The actuality doesn't completely live up to the theory at present.
! Command-line switches and 'timevar_id_t' enumerations must still be
  defined elsewhere.  The pass manager validates constraints but does not
  attempt to (re-)generate data structures or lower intermediate language
  form based on the requirements of the next pass.  Nevertheless, what is
*************** present is useful, and a far sight bette
*** 6757,6765 ****
  file (for GCC debugging purposes).  Passes with a name starting with a
  star do not dump anything.  Sometimes passes are supposed to share a
  dump file / option name.  To still give these unique names, you can use
! a prefix that is delimited by a space from the part that is used for
! the dump file / option name.  E.g. When the pass name is "ud dce", the
! name used for dump file/options is "dce".
  
   TODO: describe the global variables set up by the pass manager, and a
  brief description of how a new pass should use it.  I need to look at
--- 6623,6631 ----
  file (for GCC debugging purposes).  Passes with a name starting with a
  star do not dump anything.  Sometimes passes are supposed to share a
  dump file / option name.  To still give these unique names, you can use
! a prefix that is delimited by a space from the part that is used for the
! dump file / option name.  E.g.  When the pass name is "ud dce", the name
! used for dump file/options is "dce".
  
   TODO: describe the global variables set up by the pass manager, and a
  brief description of how a new pass should use it.  I need to look at
*************** run after gimplification and what source
*** 6778,6941 ****
  
       This pass is an extremely simple sweep across the gimple code in
       which we identify obviously dead code and remove it.  Here we do
!      things like simplify `if' statements with constant conditions,
       remove exception handling constructs surrounding code that
       obviously cannot throw, remove lexical bindings that contain no
       variables, and other assorted simplistic cleanups.  The idea is to
       get rid of the obvious stuff quickly rather than wait until later
       when it's more work to get rid of it.  This pass is located in
!      `tree-cfg.c' and described by `pass_remove_useless_stmts'.
  
     * OpenMP lowering
  
!      If OpenMP generation (`-fopenmp') is enabled, this pass lowers
       OpenMP constructs into GIMPLE.
  
       Lowering of OpenMP constructs involves creating replacement
       expressions for local variables that have been mapped using data
       sharing clauses, exposing the control flow of most synchronization
       directives and adding region markers to facilitate the creation of
!      the control flow graph.  The pass is located in `omp-low.c' and is
!      described by `pass_lower_omp'.
  
     * OpenMP expansion
  
!      If OpenMP generation (`-fopenmp') is enabled, this pass expands
       parallel regions into their own functions to be invoked by the
!      thread library.  The pass is located in `omp-low.c' and is
!      described by `pass_expand_omp'.
  
     * Lower control flow
  
!      This pass flattens `if' statements (`COND_EXPR') and moves lexical
!      bindings (`BIND_EXPR') out of line.  After this pass, all `if'
!      statements will have exactly two `goto' statements in its `then'
!      and `else' arms.  Lexical binding information for each statement
!      will be found in `TREE_BLOCK' rather than being inferred from its
!      position under a `BIND_EXPR'.  This pass is found in
!      `gimple-low.c' and is described by `pass_lower_cf'.
  
     * Lower exception handling control flow
  
       This pass decomposes high-level exception handling constructs
!      (`TRY_FINALLY_EXPR' and `TRY_CATCH_EXPR') into a form that
       explicitly represents the control flow involved.  After this pass,
!      `lookup_stmt_eh_region' will return a non-negative number for any
       statement that may have EH control flow semantics; examine
!      `tree_can_throw_internal' or `tree_can_throw_external' for exact
       semantics.  Exact control flow may be extracted from
!      `foreach_reachable_handler'.  The EH region nesting tree is defined
!      in `except.h' and built in `except.c'.  The lowering pass itself
!      is in `tree-eh.c' and is described by `pass_lower_eh'.
  
     * Build the control flow graph
  
       This pass decomposes a function into basic blocks and creates all
!      of the edges that connect them.  It is located in `tree-cfg.c' and
!      is described by `pass_build_cfg'.
  
     * Find all referenced variables
  
       This pass walks the entire function and collects an array of all
!      variables referenced in the function, `referenced_vars'.  The
!      index at which a variable is found in the array is used as a UID
!      for the variable within this function.  This data is needed by the
!      SSA rewriting routines.  The pass is located in `tree-dfa.c' and
!      is described by `pass_referenced_vars'.
  
     * Enter static single assignment form
  
       This pass rewrites the function such that it is in SSA form.  After
!      this pass, all `is_gimple_reg' variables will be referenced by
!      `SSA_NAME', and all occurrences of other variables will be
!      annotated with `VDEFS' and `VUSES'; PHI nodes will have been
       inserted as necessary for each basic block.  This pass is located
!      in `tree-ssa.c' and is described by `pass_build_ssa'.
  
     * Warn for uninitialized variables
  
!      This pass scans the function for uses of `SSA_NAME's that are fed
       by default definition.  For non-parameter variables, such uses are
       uninitialized.  The pass is run twice, before and after
       optimization (if turned on).  In the first pass we only warn for
       uses that are positively uninitialized; in the second pass we warn
       for uses that are possibly uninitialized.  The pass is located in
!      `tree-ssa.c' and is defined by `pass_early_warn_uninitialized' and
!      `pass_late_warn_uninitialized'.
  
     * Dead code elimination
  
       This pass scans the function for statements without side effects
       whose result is unused.  It does not do memory life analysis, so
!      any value that is stored in memory is considered used.  The pass
!      is run multiple times throughout the optimization process.  It is
!      located in `tree-ssa-dce.c' and is described by `pass_dce'.
  
     * Dominator optimizations
  
       This pass performs trivial dominator-based copy and constant
       propagation, expression simplification, and jump threading.  It is
       run multiple times throughout the optimization process.  It is
!      located in `tree-ssa-dom.c' and is described by `pass_dominator'.
  
     * Forward propagation of single-use variables
  
       This pass attempts to remove redundant computation by substituting
       variables that are used once into the expression that uses them and
       seeing if the result can be simplified.  It is located in
!      `tree-ssa-forwprop.c' and is described by `pass_forwprop'.
  
     * Copy Renaming
  
       This pass attempts to change the name of compiler temporaries
       involved in copy operations such that SSA->normal can coalesce the
!      copy away.  When compiler temporaries are copies of user
!      variables, it also renames the compiler temporary to the user
!      variable resulting in better use of user symbols.  It is located
!      in `tree-ssa-copyrename.c' and is described by `pass_copyrename'.
  
     * PHI node optimizations
  
       This pass recognizes forms of PHI inputs that can be represented as
       conditional expressions and rewrites them into straight line code.
!      It is located in `tree-ssa-phiopt.c' and is described by
!      `pass_phiopt'.
  
     * May-alias optimization
  
       This pass performs a flow sensitive SSA-based points-to analysis.
       The resulting may-alias, must-alias, and escape analysis
!      information is used to promote variables from in-memory
!      addressable objects to non-aliased variables that can be renamed
!      into SSA form.  We also update the `VDEF'/`VUSE' memory tags for
!      non-renameable aggregates so that we get fewer false kills.  The
!      pass is located in `tree-ssa-alias.c' and is described by
!      `pass_may_alias'.
  
       Interprocedural points-to information is located in
!      `tree-ssa-structalias.c' and described by `pass_ipa_pta'.
  
     * Profiling
  
       This pass instruments the function in order to collect runtime
!      block and value profiling data.  Such data may be fed back into
!      the compiler on a subsequent run so as to allow optimization based
!      on expected execution frequencies.  The pass is located in
!      `tree-profile.c' and is described by `pass_ipa_tree_profile'.
  
     * Static profile estimation
  
       This pass implements series of heuristics to guess propababilities
       of branches.  The resulting predictions are turned into edge
       profile by propagating branches across the control flow graphs.
!      The pass is located in `tree-profile.c' and is described by
!      `pass_profile'.
  
     * Lower complex arithmetic
  
       This pass rewrites complex arithmetic operations into their
       component scalar arithmetic operations.  The pass is located in
!      `tree-complex.c' and is described by `pass_lower_complex'.
  
     * Scalar replacement of aggregates
  
--- 6644,6806 ----
  
       This pass is an extremely simple sweep across the gimple code in
       which we identify obviously dead code and remove it.  Here we do
!      things like simplify 'if' statements with constant conditions,
       remove exception handling constructs surrounding code that
       obviously cannot throw, remove lexical bindings that contain no
       variables, and other assorted simplistic cleanups.  The idea is to
       get rid of the obvious stuff quickly rather than wait until later
       when it's more work to get rid of it.  This pass is located in
!      'tree-cfg.c' and described by 'pass_remove_useless_stmts'.
  
     * OpenMP lowering
  
!      If OpenMP generation ('-fopenmp') is enabled, this pass lowers
       OpenMP constructs into GIMPLE.
  
       Lowering of OpenMP constructs involves creating replacement
       expressions for local variables that have been mapped using data
       sharing clauses, exposing the control flow of most synchronization
       directives and adding region markers to facilitate the creation of
!      the control flow graph.  The pass is located in 'omp-low.c' and is
!      described by 'pass_lower_omp'.
  
     * OpenMP expansion
  
!      If OpenMP generation ('-fopenmp') is enabled, this pass expands
       parallel regions into their own functions to be invoked by the
!      thread library.  The pass is located in 'omp-low.c' and is
!      described by 'pass_expand_omp'.
  
     * Lower control flow
  
!      This pass flattens 'if' statements ('COND_EXPR') and moves lexical
!      bindings ('BIND_EXPR') out of line.  After this pass, all 'if'
!      statements will have exactly two 'goto' statements in its 'then'
!      and 'else' arms.  Lexical binding information for each statement
!      will be found in 'TREE_BLOCK' rather than being inferred from its
!      position under a 'BIND_EXPR'.  This pass is found in 'gimple-low.c'
!      and is described by 'pass_lower_cf'.
  
     * Lower exception handling control flow
  
       This pass decomposes high-level exception handling constructs
!      ('TRY_FINALLY_EXPR' and 'TRY_CATCH_EXPR') into a form that
       explicitly represents the control flow involved.  After this pass,
!      'lookup_stmt_eh_region' will return a non-negative number for any
       statement that may have EH control flow semantics; examine
!      'tree_can_throw_internal' or 'tree_can_throw_external' for exact
       semantics.  Exact control flow may be extracted from
!      'foreach_reachable_handler'.  The EH region nesting tree is defined
!      in 'except.h' and built in 'except.c'.  The lowering pass itself is
!      in 'tree-eh.c' and is described by 'pass_lower_eh'.
  
     * Build the control flow graph
  
       This pass decomposes a function into basic blocks and creates all
!      of the edges that connect them.  It is located in 'tree-cfg.c' and
!      is described by 'pass_build_cfg'.
  
     * Find all referenced variables
  
       This pass walks the entire function and collects an array of all
!      variables referenced in the function, 'referenced_vars'.  The index
!      at which a variable is found in the array is used as a UID for the
!      variable within this function.  This data is needed by the SSA
!      rewriting routines.  The pass is located in 'tree-dfa.c' and is
!      described by 'pass_referenced_vars'.
  
     * Enter static single assignment form
  
       This pass rewrites the function such that it is in SSA form.  After
!      this pass, all 'is_gimple_reg' variables will be referenced by
!      'SSA_NAME', and all occurrences of other variables will be
!      annotated with 'VDEFS' and 'VUSES'; PHI nodes will have been
       inserted as necessary for each basic block.  This pass is located
!      in 'tree-ssa.c' and is described by 'pass_build_ssa'.
  
     * Warn for uninitialized variables
  
!      This pass scans the function for uses of 'SSA_NAME's that are fed
       by default definition.  For non-parameter variables, such uses are
       uninitialized.  The pass is run twice, before and after
       optimization (if turned on).  In the first pass we only warn for
       uses that are positively uninitialized; in the second pass we warn
       for uses that are possibly uninitialized.  The pass is located in
!      'tree-ssa.c' and is defined by 'pass_early_warn_uninitialized' and
!      'pass_late_warn_uninitialized'.
  
     * Dead code elimination
  
       This pass scans the function for statements without side effects
       whose result is unused.  It does not do memory life analysis, so
!      any value that is stored in memory is considered used.  The pass is
!      run multiple times throughout the optimization process.  It is
!      located in 'tree-ssa-dce.c' and is described by 'pass_dce'.
  
     * Dominator optimizations
  
       This pass performs trivial dominator-based copy and constant
       propagation, expression simplification, and jump threading.  It is
       run multiple times throughout the optimization process.  It is
!      located in 'tree-ssa-dom.c' and is described by 'pass_dominator'.
  
     * Forward propagation of single-use variables
  
       This pass attempts to remove redundant computation by substituting
       variables that are used once into the expression that uses them and
       seeing if the result can be simplified.  It is located in
!      'tree-ssa-forwprop.c' and is described by 'pass_forwprop'.
  
     * Copy Renaming
  
       This pass attempts to change the name of compiler temporaries
       involved in copy operations such that SSA->normal can coalesce the
!      copy away.  When compiler temporaries are copies of user variables,
!      it also renames the compiler temporary to the user variable
!      resulting in better use of user symbols.  It is located in
!      'tree-ssa-copyrename.c' and is described by 'pass_copyrename'.
  
     * PHI node optimizations
  
       This pass recognizes forms of PHI inputs that can be represented as
       conditional expressions and rewrites them into straight line code.
!      It is located in 'tree-ssa-phiopt.c' and is described by
!      'pass_phiopt'.
  
     * May-alias optimization
  
       This pass performs a flow sensitive SSA-based points-to analysis.
       The resulting may-alias, must-alias, and escape analysis
!      information is used to promote variables from in-memory addressable
!      objects to non-aliased variables that can be renamed into SSA form.
!      We also update the 'VDEF'/'VUSE' memory tags for non-renameable
!      aggregates so that we get fewer false kills.  The pass is located
!      in 'tree-ssa-alias.c' and is described by 'pass_may_alias'.
  
       Interprocedural points-to information is located in
!      'tree-ssa-structalias.c' and described by 'pass_ipa_pta'.
  
     * Profiling
  
       This pass instruments the function in order to collect runtime
!      block and value profiling data.  Such data may be fed back into the
!      compiler on a subsequent run so as to allow optimization based on
!      expected execution frequencies.  The pass is located in
!      'tree-profile.c' and is described by 'pass_ipa_tree_profile'.
  
     * Static profile estimation
  
       This pass implements series of heuristics to guess propababilities
       of branches.  The resulting predictions are turned into edge
       profile by propagating branches across the control flow graphs.
!      The pass is located in 'tree-profile.c' and is described by
!      'pass_profile'.
  
     * Lower complex arithmetic
  
       This pass rewrites complex arithmetic operations into their
       component scalar arithmetic operations.  The pass is located in
!      'tree-complex.c' and is described by 'pass_lower_complex'.
  
     * Scalar replacement of aggregates
  
*************** run after gimplification and what source
*** 6943,7052 ****
       into a set of scalar variables.  The resulting scalar variables are
       rewritten into SSA form, which allows subsequent optimization
       passes to do a significantly better job with them.  The pass is
!      located in `tree-sra.c' and is described by `pass_sra'.
  
     * Dead store elimination
  
       This pass eliminates stores to memory that are subsequently
       overwritten by another store, without any intervening loads.  The
!      pass is located in `tree-ssa-dse.c' and is described by `pass_dse'.
  
     * Tail recursion elimination
  
       This pass transforms tail recursion into a loop.  It is located in
!      `tree-tailcall.c' and is described by `pass_tail_recursion'.
  
     * Forward store motion
  
!      This pass sinks stores and assignments down the flowgraph closer
!      to their use point.  The pass is located in `tree-ssa-sink.c' and
!      is described by `pass_sink_code'.
  
     * Partial redundancy elimination
  
       This pass eliminates partially redundant computations, as well as
!      performing load motion.  The pass is located in `tree-ssa-pre.c'
!      and is described by `pass_pre'.
  
       Just before partial redundancy elimination, if
!      `-funsafe-math-optimizations' is on, GCC tries to convert
!      divisions to multiplications by the reciprocal.  The pass is
!      located in `tree-ssa-math-opts.c' and is described by
!      `pass_cse_reciprocal'.
  
     * Full redundancy elimination
  
       This is a simpler form of PRE that only eliminates redundancies
!      that occur on all paths.  It is located in `tree-ssa-pre.c' and
!      described by `pass_fre'.
  
     * Loop optimization
  
!      The main driver of the pass is placed in `tree-ssa-loop.c' and
!      described by `pass_loop'.
  
       The optimizations performed by this pass are:
  
       Loop invariant motion.  This pass moves only invariants that would
       be hard to handle on RTL level (function calls, operations that
!      expand to nontrivial sequences of insns).  With `-funswitch-loops'
       it also moves operands of conditions that are invariant out of the
       loop, so that we can use just trivial invariantness analysis in
       loop unswitching.  The pass also includes store motion.  The pass
!      is implemented in `tree-ssa-loop-im.c'.
  
       Canonical induction variable creation.  This pass creates a simple
       counter for number of iterations of the loop and replaces the exit
!      condition of the loop using it, in case when a complicated
!      analysis is necessary to determine the number of iterations.
!      Later optimizations then may determine the number easily.  The
!      pass is implemented in `tree-ssa-loop-ivcanon.c'.
  
       Induction variable optimizations.  This pass performs standard
       induction variable optimizations, including strength reduction,
!      induction variable merging and induction variable elimination.
!      The pass is implemented in `tree-ssa-loop-ivopts.c'.
  
       Loop unswitching.  This pass moves the conditional jumps that are
       invariant out of the loops.  To achieve this, a duplicate of the
       loop is created for each possible outcome of conditional jump(s).
!      The pass is implemented in `tree-ssa-loop-unswitch.c'.
  
       The optimizations also use various utility functions contained in
!      `tree-ssa-loop-manip.c', `cfgloop.c', `cfgloopanal.c' and
!      `cfgloopmanip.c'.
  
       Vectorization.  This pass transforms loops to operate on vector
       types instead of scalar types.  Data parallelism across loop
       iterations is exploited to group data elements from consecutive
       iterations into a vector and operate on them in parallel.
       Depending on available target support the loop is conceptually
!      unrolled by a factor `VF' (vectorization factor), which is the
!      number of elements operated upon in parallel in each iteration,
!      and the `VF' copies of each scalar operation are fused to form a
!      vector operation.  Additional loop transformations such as peeling
!      and versioning may take place to align the number of iterations,
!      and to align the memory accesses in the loop.  The pass is
!      implemented in `tree-vectorizer.c' (the main driver),
!      `tree-vect-loop.c' and `tree-vect-loop-manip.c' (loop specific
!      parts and general loop utilities), `tree-vect-slp' (loop-aware SLP
!      functionality), `tree-vect-stmts.c' and `tree-vect-data-refs.c'.
!      Analysis of data references is in `tree-data-ref.c'.
  
       SLP Vectorization.  This pass performs vectorization of
!      straight-line code. The pass is implemented in `tree-vectorizer.c'
!      (the main driver), `tree-vect-slp.c', `tree-vect-stmts.c' and
!      `tree-vect-data-refs.c'.
  
       Autoparallelization.  This pass splits the loop iteration space to
       run into several threads.  The pass is implemented in
!      `tree-parloops.c'.
  
       Graphite is a loop transformation framework based on the polyhedral
       model.  Graphite stands for Gimple Represented as Polyhedra.  The
       internals of this infrastructure are documented in
!      `http://gcc.gnu.org/wiki/Graphite'.  The passes working on this
!      representation are implemented in the various `graphite-*' files.
  
     * Tree level if-conversion for vectorizer
  
--- 6808,6916 ----
       into a set of scalar variables.  The resulting scalar variables are
       rewritten into SSA form, which allows subsequent optimization
       passes to do a significantly better job with them.  The pass is
!      located in 'tree-sra.c' and is described by 'pass_sra'.
  
     * Dead store elimination
  
       This pass eliminates stores to memory that are subsequently
       overwritten by another store, without any intervening loads.  The
!      pass is located in 'tree-ssa-dse.c' and is described by 'pass_dse'.
  
     * Tail recursion elimination
  
       This pass transforms tail recursion into a loop.  It is located in
!      'tree-tailcall.c' and is described by 'pass_tail_recursion'.
  
     * Forward store motion
  
!      This pass sinks stores and assignments down the flowgraph closer to
!      their use point.  The pass is located in 'tree-ssa-sink.c' and is
!      described by 'pass_sink_code'.
  
     * Partial redundancy elimination
  
       This pass eliminates partially redundant computations, as well as
!      performing load motion.  The pass is located in 'tree-ssa-pre.c'
!      and is described by 'pass_pre'.
  
       Just before partial redundancy elimination, if
!      '-funsafe-math-optimizations' is on, GCC tries to convert divisions
!      to multiplications by the reciprocal.  The pass is located in
!      'tree-ssa-math-opts.c' and is described by 'pass_cse_reciprocal'.
  
     * Full redundancy elimination
  
       This is a simpler form of PRE that only eliminates redundancies
!      that occur on all paths.  It is located in 'tree-ssa-pre.c' and
!      described by 'pass_fre'.
  
     * Loop optimization
  
!      The main driver of the pass is placed in 'tree-ssa-loop.c' and
!      described by 'pass_loop'.
  
       The optimizations performed by this pass are:
  
       Loop invariant motion.  This pass moves only invariants that would
       be hard to handle on RTL level (function calls, operations that
!      expand to nontrivial sequences of insns).  With '-funswitch-loops'
       it also moves operands of conditions that are invariant out of the
       loop, so that we can use just trivial invariantness analysis in
       loop unswitching.  The pass also includes store motion.  The pass
!      is implemented in 'tree-ssa-loop-im.c'.
  
       Canonical induction variable creation.  This pass creates a simple
       counter for number of iterations of the loop and replaces the exit
!      condition of the loop using it, in case when a complicated analysis
!      is necessary to determine the number of iterations.  Later
!      optimizations then may determine the number easily.  The pass is
!      implemented in 'tree-ssa-loop-ivcanon.c'.
  
       Induction variable optimizations.  This pass performs standard
       induction variable optimizations, including strength reduction,
!      induction variable merging and induction variable elimination.  The
!      pass is implemented in 'tree-ssa-loop-ivopts.c'.
  
       Loop unswitching.  This pass moves the conditional jumps that are
       invariant out of the loops.  To achieve this, a duplicate of the
       loop is created for each possible outcome of conditional jump(s).
!      The pass is implemented in 'tree-ssa-loop-unswitch.c'.
  
       The optimizations also use various utility functions contained in
!      'tree-ssa-loop-manip.c', 'cfgloop.c', 'cfgloopanal.c' and
!      'cfgloopmanip.c'.
  
       Vectorization.  This pass transforms loops to operate on vector
       types instead of scalar types.  Data parallelism across loop
       iterations is exploited to group data elements from consecutive
       iterations into a vector and operate on them in parallel.
       Depending on available target support the loop is conceptually
!      unrolled by a factor 'VF' (vectorization factor), which is the
!      number of elements operated upon in parallel in each iteration, and
!      the 'VF' copies of each scalar operation are fused to form a vector
!      operation.  Additional loop transformations such as peeling and
!      versioning may take place to align the number of iterations, and to
!      align the memory accesses in the loop.  The pass is implemented in
!      'tree-vectorizer.c' (the main driver), 'tree-vect-loop.c' and
!      'tree-vect-loop-manip.c' (loop specific parts and general loop
!      utilities), 'tree-vect-slp' (loop-aware SLP functionality),
!      'tree-vect-stmts.c' and 'tree-vect-data-refs.c'.  Analysis of data
!      references is in 'tree-data-ref.c'.
  
       SLP Vectorization.  This pass performs vectorization of
!      straight-line code.  The pass is implemented in 'tree-vectorizer.c'
!      (the main driver), 'tree-vect-slp.c', 'tree-vect-stmts.c' and
!      'tree-vect-data-refs.c'.
  
       Autoparallelization.  This pass splits the loop iteration space to
       run into several threads.  The pass is implemented in
!      'tree-parloops.c'.
  
       Graphite is a loop transformation framework based on the polyhedral
       model.  Graphite stands for Gimple Represented as Polyhedra.  The
       internals of this infrastructure are documented in
!      <http://gcc.gnu.org/wiki/Graphite>.  The passes working on this
!      representation are implemented in the various 'graphite-*' files.
  
     * Tree level if-conversion for vectorizer
  
*************** run after gimplification and what source
*** 7055,7083 ****
       basic blocks in one big block.  The idea is to present loop in such
       form so that vectorizer can have one to one mapping between
       statements and available vector operations.  This pass is located
!      in `tree-if-conv.c' and is described by `pass_if_conversion'.
  
     * Conditional constant propagation
  
       This pass relaxes a lattice of values in order to identify those
       that must be constant even in the presence of conditional branches.
!      The pass is located in `tree-ssa-ccp.c' and is described by
!      `pass_ccp'.
  
       A related pass that works on memory loads and stores, and not just
!      register values, is located in `tree-ssa-ccp.c' and described by
!      `pass_store_ccp'.
  
     * Conditional copy propagation
  
       This is similar to constant propagation but the lattice of values
       is the "copy-of" relation.  It eliminates redundant copies from the
!      code.  The pass is located in `tree-ssa-copy.c' and described by
!      `pass_copy_prop'.
  
       A related pass that works on memory copies, and not just register
!      copies, is located in `tree-ssa-copy.c' and described by
!      `pass_store_copy_prop'.
  
     * Value range propagation
  
--- 6919,6947 ----
       basic blocks in one big block.  The idea is to present loop in such
       form so that vectorizer can have one to one mapping between
       statements and available vector operations.  This pass is located
!      in 'tree-if-conv.c' and is described by 'pass_if_conversion'.
  
     * Conditional constant propagation
  
       This pass relaxes a lattice of values in order to identify those
       that must be constant even in the presence of conditional branches.
!      The pass is located in 'tree-ssa-ccp.c' and is described by
!      'pass_ccp'.
  
       A related pass that works on memory loads and stores, and not just
!      register values, is located in 'tree-ssa-ccp.c' and described by
!      'pass_store_ccp'.
  
     * Conditional copy propagation
  
       This is similar to constant propagation but the lattice of values
       is the "copy-of" relation.  It eliminates redundant copies from the
!      code.  The pass is located in 'tree-ssa-copy.c' and described by
!      'pass_copy_prop'.
  
       A related pass that works on memory copies, and not just register
!      copies, is located in 'tree-ssa-copy.c' and described by
!      'pass_store_copy_prop'.
  
     * Value range propagation
  
*************** run after gimplification and what source
*** 7088,7115 ****
       Range Propagation, J. R. C. Patterson, PLDI '95).  In contrast to
       Patterson's algorithm, this implementation does not propagate
       branch probabilities nor it uses more than a single range per SSA
!      name. This means that the current implementation cannot be used
       for branch prediction (though adapting it would not be difficult).
!      The pass is located in `tree-vrp.c' and is described by `pass_vrp'.
  
     * Folding built-in functions
  
       This pass simplifies built-in functions, as applicable, with
!      constant arguments or with inferable string lengths.  It is
!      located in `tree-ssa-ccp.c' and is described by
!      `pass_fold_builtins'.
  
     * Split critical edges
  
       This pass identifies critical edges and inserts empty basic blocks
       such that the edge is no longer critical.  The pass is located in
!      `tree-cfg.c' and is described by `pass_split_crit_edges'.
  
     * Control dependence dead code elimination
  
       This pass is a stronger form of dead code elimination that can
!      eliminate unnecessary control flow statements.   It is located in
!      `tree-ssa-dce.c' and is described by `pass_cd_dce'.
  
     * Tail call elimination
  
--- 6952,6978 ----
       Range Propagation, J. R. C. Patterson, PLDI '95).  In contrast to
       Patterson's algorithm, this implementation does not propagate
       branch probabilities nor it uses more than a single range per SSA
!      name.  This means that the current implementation cannot be used
       for branch prediction (though adapting it would not be difficult).
!      The pass is located in 'tree-vrp.c' and is described by 'pass_vrp'.
  
     * Folding built-in functions
  
       This pass simplifies built-in functions, as applicable, with
!      constant arguments or with inferable string lengths.  It is located
!      in 'tree-ssa-ccp.c' and is described by 'pass_fold_builtins'.
  
     * Split critical edges
  
       This pass identifies critical edges and inserts empty basic blocks
       such that the edge is no longer critical.  The pass is located in
!      'tree-cfg.c' and is described by 'pass_split_crit_edges'.
  
     * Control dependence dead code elimination
  
       This pass is a stronger form of dead code elimination that can
!      eliminate unnecessary control flow statements.  It is located in
!      'tree-ssa-dce.c' and is described by 'pass_cd_dce'.
  
     * Tail call elimination
  
*************** run after gimplification and what source
*** 7117,7126 ****
       jumps.  No code transformation is actually applied here, but the
       data and control flow problem is solved.  The code transformation
       requires target support, and so is delayed until RTL.  In the
!      meantime `CALL_EXPR_TAILCALL' is set indicating the possibility.
!      The pass is located in `tree-tailcall.c' and is described by
!      `pass_tail_calls'.  The RTL transformation is handled by
!      `fixup_tail_calls' in `calls.c'.
  
     * Warn for function return without value
  
--- 6980,6989 ----
       jumps.  No code transformation is actually applied here, but the
       data and control flow problem is solved.  The code transformation
       requires target support, and so is delayed until RTL.  In the
!      meantime 'CALL_EXPR_TAILCALL' is set indicating the possibility.
!      The pass is located in 'tree-tailcall.c' and is described by
!      'pass_tail_calls'.  The RTL transformation is handled by
!      'fixup_tail_calls' in 'calls.c'.
  
     * Warn for function return without value
  
*************** run after gimplification and what source
*** 7128,7180 ****
       not specify a value and issues a warning.  Such a statement may
       have been injected by falling off the end of the function.  This
       pass is run last so that we have as much time as possible to prove
!      that the statement is not reachable.  It is located in
!      `tree-cfg.c' and is described by `pass_warn_function_return'.
  
     * Leave static single assignment form
  
       This pass rewrites the function such that it is in normal form.  At
       the same time, we eliminate as many single-use temporaries as
       possible, so the intermediate language is no longer GIMPLE, but
!      GENERIC.  The pass is located in `tree-outof-ssa.c' and is
!      described by `pass_del_ssa'.
  
     * Merge PHI nodes that feed into one another
  
       This is part of the CFG cleanup passes.  It attempts to join PHI
!      nodes from a forwarder CFG block into another block with PHI
!      nodes.  The pass is located in `tree-cfgcleanup.c' and is
!      described by `pass_merge_phi'.
  
     * Return value optimization
  
       If a function always returns the same local variable, and that
       local variable is an aggregate type, then the variable is replaced
       with the return value for the function (i.e., the function's
!      DECL_RESULT).  This is equivalent to the C++ named return value
       optimization applied to GIMPLE.  The pass is located in
!      `tree-nrv.c' and is described by `pass_nrv'.
  
     * Return slot optimization
  
!      If a function returns a memory object and is called as `var =
       foo()', this pass tries to change the call so that the address of
!      `var' is sent to the caller to avoid an extra memory copy.  This
!      pass is located in `tree-nrv.c' and is described by
!      `pass_return_slot'.
  
!    * Optimize calls to `__builtin_object_size'
  
       This is a propagation pass similar to CCP that tries to remove
!      calls to `__builtin_object_size' when the size of the object can be
       computed at compile-time.  This pass is located in
!      `tree-object-size.c' and is described by `pass_object_sizes'.
  
     * Loop invariant motion
  
       This pass removes expensive loop-invariant computations out of
!      loops.  The pass is located in `tree-ssa-loop.c' and described by
!      `pass_lim'.
  
     * Loop nest optimizations
  
--- 6991,7043 ----
       not specify a value and issues a warning.  Such a statement may
       have been injected by falling off the end of the function.  This
       pass is run last so that we have as much time as possible to prove
!      that the statement is not reachable.  It is located in 'tree-cfg.c'
!      and is described by 'pass_warn_function_return'.
  
     * Leave static single assignment form
  
       This pass rewrites the function such that it is in normal form.  At
       the same time, we eliminate as many single-use temporaries as
       possible, so the intermediate language is no longer GIMPLE, but
!      GENERIC.  The pass is located in 'tree-outof-ssa.c' and is
!      described by 'pass_del_ssa'.
  
     * Merge PHI nodes that feed into one another
  
       This is part of the CFG cleanup passes.  It attempts to join PHI
!      nodes from a forwarder CFG block into another block with PHI nodes.
!      The pass is located in 'tree-cfgcleanup.c' and is described by
!      'pass_merge_phi'.
  
     * Return value optimization
  
       If a function always returns the same local variable, and that
       local variable is an aggregate type, then the variable is replaced
       with the return value for the function (i.e., the function's
!      DECL_RESULT). This is equivalent to the C++ named return value
       optimization applied to GIMPLE.  The pass is located in
!      'tree-nrv.c' and is described by 'pass_nrv'.
  
     * Return slot optimization
  
!      If a function returns a memory object and is called as 'var =
       foo()', this pass tries to change the call so that the address of
!      'var' is sent to the caller to avoid an extra memory copy.  This
!      pass is located in 'tree-nrv.c' and is described by
!      'pass_return_slot'.
  
!    * Optimize calls to '__builtin_object_size'
  
       This is a propagation pass similar to CCP that tries to remove
!      calls to '__builtin_object_size' when the size of the object can be
       computed at compile-time.  This pass is located in
!      'tree-object-size.c' and is described by 'pass_object_sizes'.
  
     * Loop invariant motion
  
       This pass removes expensive loop-invariant computations out of
!      loops.  The pass is located in 'tree-ssa-loop.c' and described by
!      'pass_lim'.
  
     * Loop nest optimizations
  
*************** run after gimplification and what source
*** 7183,7238 ****
       they are all geared to the optimization of data locality in array
       traversals and the removal of dependencies that hamper
       optimizations such as loop parallelization and vectorization.  The
!      pass is located in `tree-loop-linear.c' and described by
!      `pass_linear_transform'.
  
     * Removal of empty loops
  
       This pass removes loops with no code in them.  The pass is located
!      in `tree-ssa-loop-ivcanon.c' and described by `pass_empty_loop'.
  
     * Unrolling of small loops
  
       This pass completely unrolls loops with few iterations.  The pass
!      is located in `tree-ssa-loop-ivcanon.c' and described by
!      `pass_complete_unroll'.
  
     * Predictive commoning
  
       This pass makes the code reuse the computations from the previous
!      iterations of the loops, especially loads and stores to memory.
!      It does so by storing the values of these computations to a bank
!      of temporary variables that are rotated at the end of loop.  To
!      avoid the need for this rotation, the loop is then unrolled and
!      the copies of the loop body are rewritten to use the appropriate
       version of the temporary variable.  This pass is located in
!      `tree-predcom.c' and described by `pass_predcom'.
  
     * Array prefetching
  
       This pass issues prefetch instructions for array references inside
!      loops.  The pass is located in `tree-ssa-loop-prefetch.c' and
!      described by `pass_loop_prefetch'.
  
     * Reassociation
  
       This pass rewrites arithmetic expressions to enable optimizations
       that operate on them, like redundancy elimination and
!      vectorization.  The pass is located in `tree-ssa-reassoc.c' and
!      described by `pass_reassoc'.
  
!    * Optimization of `stdarg' functions
  
       This pass tries to avoid the saving of register arguments into the
!      stack on entry to `stdarg' functions.  If the function doesn't use
!      any `va_start' macros, no registers need to be saved.  If
!      `va_start' macros are used, the `va_list' variables don't escape
       the function, it is only necessary to save registers that will be
!      used in `va_arg' macros.  For instance, if `va_arg' is only used
!      with integral types in the function, floating point registers
!      don't need to be saved.  This pass is located in `tree-stdarg.c'
!      and described by `pass_stdarg'.
! 
  
  
  File: gccint.info,  Node: RTL passes,  Next: Optimization info,  Prev: Tree SSA passes,  Up: Passes
--- 7046,7100 ----
       they are all geared to the optimization of data locality in array
       traversals and the removal of dependencies that hamper
       optimizations such as loop parallelization and vectorization.  The
!      pass is located in 'tree-loop-linear.c' and described by
!      'pass_linear_transform'.
  
     * Removal of empty loops
  
       This pass removes loops with no code in them.  The pass is located
!      in 'tree-ssa-loop-ivcanon.c' and described by 'pass_empty_loop'.
  
     * Unrolling of small loops
  
       This pass completely unrolls loops with few iterations.  The pass
!      is located in 'tree-ssa-loop-ivcanon.c' and described by
!      'pass_complete_unroll'.
  
     * Predictive commoning
  
       This pass makes the code reuse the computations from the previous
!      iterations of the loops, especially loads and stores to memory.  It
!      does so by storing the values of these computations to a bank of
!      temporary variables that are rotated at the end of loop.  To avoid
!      the need for this rotation, the loop is then unrolled and the
!      copies of the loop body are rewritten to use the appropriate
       version of the temporary variable.  This pass is located in
!      'tree-predcom.c' and described by 'pass_predcom'.
  
     * Array prefetching
  
       This pass issues prefetch instructions for array references inside
!      loops.  The pass is located in 'tree-ssa-loop-prefetch.c' and
!      described by 'pass_loop_prefetch'.
  
     * Reassociation
  
       This pass rewrites arithmetic expressions to enable optimizations
       that operate on them, like redundancy elimination and
!      vectorization.  The pass is located in 'tree-ssa-reassoc.c' and
!      described by 'pass_reassoc'.
  
!    * Optimization of 'stdarg' functions
  
       This pass tries to avoid the saving of register arguments into the
!      stack on entry to 'stdarg' functions.  If the function doesn't use
!      any 'va_start' macros, no registers need to be saved.  If
!      'va_start' macros are used, the 'va_list' variables don't escape
       the function, it is only necessary to save registers that will be
!      used in 'va_arg' macros.  For instance, if 'va_arg' is only used
!      with integral types in the function, floating point registers don't
!      need to be saved.  This pass is located in 'tree-stdarg.c' and
!      described by 'pass_stdarg'.
  
  
  File: gccint.info,  Node: RTL passes,  Next: Optimization info,  Prev: Tree SSA passes,  Up: Passes
*************** passes that are run after the Tree optim
*** 7245,7278 ****
  
     * RTL generation
  
!      The source files for RTL generation include `stmt.c', `calls.c',
!      `expr.c', `explow.c', `expmed.c', `function.c', `optabs.c' and
!      `emit-rtl.c'.  Also, the file `insn-emit.c', generated from the
!      machine description by the program `genemit', is used in this
!      pass.  The header file `expr.h' is used for communication within
!      this pass.
  
!      The header files `insn-flags.h' and `insn-codes.h', generated from
!      the machine description by the programs `genflags' and `gencodes',
!      tell this pass which standard names are available for use and
!      which patterns correspond to them.
  
     * Generation of exception landing pads
  
       This pass generates the glue that handles communication between the
       exception handling library routines and the exception handlers
!      within the function.  Entry points in the function that are
!      invoked by the exception handling library are called "landing
!      pads".  The code for this pass is located in `except.c'.
  
     * Control flow graph cleanup
  
!      This pass removes unreachable code, simplifies jumps to next,
!      jumps to jump, jumps across jumps, etc.  The pass is run multiple
!      times.  For historical reasons, it is occasionally referred to as
!      the "jump optimization pass".  The bulk of the code for this pass
!      is in `cfgcleanup.c', and there are support routines in `cfgrtl.c'
!      and `jump.c'.
  
     * Forward propagation of single-def values
  
--- 7107,7140 ----
  
     * RTL generation
  
!      The source files for RTL generation include 'stmt.c', 'calls.c',
!      'expr.c', 'explow.c', 'expmed.c', 'function.c', 'optabs.c' and
!      'emit-rtl.c'.  Also, the file 'insn-emit.c', generated from the
!      machine description by the program 'genemit', is used in this pass.
!      The header file 'expr.h' is used for communication within this
!      pass.
  
!      The header files 'insn-flags.h' and 'insn-codes.h', generated from
!      the machine description by the programs 'genflags' and 'gencodes',
!      tell this pass which standard names are available for use and which
!      patterns correspond to them.
  
     * Generation of exception landing pads
  
       This pass generates the glue that handles communication between the
       exception handling library routines and the exception handlers
!      within the function.  Entry points in the function that are invoked
!      by the exception handling library are called "landing pads".  The
!      code for this pass is located in 'except.c'.
  
     * Control flow graph cleanup
  
!      This pass removes unreachable code, simplifies jumps to next, jumps
!      to jump, jumps across jumps, etc.  The pass is run multiple times.
!      For historical reasons, it is occasionally referred to as the "jump
!      optimization pass".  The bulk of the code for this pass is in
!      'cfgcleanup.c', and there are support routines in 'cfgrtl.c' and
!      'jump.c'.
  
     * Forward propagation of single-def values
  
*************** passes that are run after the Tree optim
*** 7281,7330 ****
       result can be simplified.  It performs copy propagation and
       addressing mode selection.  The pass is run twice, with values
       being propagated into loops only on the second run.  The code is
!      located in `fwprop.c'.
  
     * Common subexpression elimination
  
       This pass removes redundant computation within basic blocks, and
       optimizes addressing modes based on cost.  The pass is run twice.
!      The code for this pass is located in `cse.c'.
  
     * Global common subexpression elimination
  
!      This pass performs two different types of GCSE  depending on
!      whether you are optimizing for size or not (LCM based GCSE tends
!      to increase code size for a gain in speed, while Morel-Renvoise
!      based GCSE does not).  When optimizing for size, GCSE is done
!      using Morel-Renvoise Partial Redundancy Elimination, with the
!      exception that it does not try to move invariants out of
!      loops--that is left to  the loop optimization pass.  If MR PRE
!      GCSE is done, code hoisting (aka unification) is also done, as
!      well as load motion.  If you are optimizing for speed, LCM (lazy
!      code motion) based GCSE is done.  LCM is based on the work of
!      Knoop, Ruthing, and Steffen.  LCM based GCSE also does loop
!      invariant code motion.  We also perform load and store motion when
!      optimizing for speed.  Regardless of which type of GCSE is used,
!      the GCSE pass also performs global constant and  copy propagation.
!      The source file for this pass is `gcse.c', and the LCM routines
!      are in `lcm.c'.
  
     * Loop optimization
  
       This pass performs several loop related optimizations.  The source
!      files `cfgloopanal.c' and `cfgloopmanip.c' contain generic loop
!      analysis and manipulation code.  Initialization and finalization
!      of loop structures is handled by `loop-init.c'.  A loop invariant
!      motion pass is implemented in `loop-invariant.c'.  Basic block
!      level optimizations--unrolling, and peeling loops-- are
!      implemented in `loop-unroll.c'.  Replacing of the exit condition
!      of loops by special machine-dependent instructions is handled by
!      `loop-doloop.c'.
  
     * Jump bypassing
  
       This pass is an aggressive form of GCSE that transforms the control
       flow graph of a function by propagating constants into conditional
!      branch instructions.  The source file for this pass is `gcse.c'.
  
     * If conversion
  
--- 7143,7191 ----
       result can be simplified.  It performs copy propagation and
       addressing mode selection.  The pass is run twice, with values
       being propagated into loops only on the second run.  The code is
!      located in 'fwprop.c'.
  
     * Common subexpression elimination
  
       This pass removes redundant computation within basic blocks, and
       optimizes addressing modes based on cost.  The pass is run twice.
!      The code for this pass is located in 'cse.c'.
  
     * Global common subexpression elimination
  
!      This pass performs two different types of GCSE depending on whether
!      you are optimizing for size or not (LCM based GCSE tends to
!      increase code size for a gain in speed, while Morel-Renvoise based
!      GCSE does not).  When optimizing for size, GCSE is done using
!      Morel-Renvoise Partial Redundancy Elimination, with the exception
!      that it does not try to move invariants out of loops--that is left
!      to the loop optimization pass.  If MR PRE GCSE is done, code
!      hoisting (aka unification) is also done, as well as load motion.
!      If you are optimizing for speed, LCM (lazy code motion) based GCSE
!      is done.  LCM is based on the work of Knoop, Ruthing, and Steffen.
!      LCM based GCSE also does loop invariant code motion.  We also
!      perform load and store motion when optimizing for speed.
!      Regardless of which type of GCSE is used, the GCSE pass also
!      performs global constant and copy propagation.  The source file for
!      this pass is 'gcse.c', and the LCM routines are in 'lcm.c'.
  
     * Loop optimization
  
       This pass performs several loop related optimizations.  The source
!      files 'cfgloopanal.c' and 'cfgloopmanip.c' contain generic loop
!      analysis and manipulation code.  Initialization and finalization of
!      loop structures is handled by 'loop-init.c'.  A loop invariant
!      motion pass is implemented in 'loop-invariant.c'.  Basic block
!      level optimizations--unrolling, and peeling loops-- are implemented
!      in 'loop-unroll.c'.  Replacing of the exit condition of loops by
!      special machine-dependent instructions is handled by
!      'loop-doloop.c'.
  
     * Jump bypassing
  
       This pass is an aggressive form of GCSE that transforms the control
       flow graph of a function by propagating constants into conditional
!      branch instructions.  The source file for this pass is 'gcse.c'.
  
     * If conversion
  
*************** passes that are run after the Tree optim
*** 7333,7381 ****
       instructions, and conditional move instructions.  In the very last
       invocation after reload/LRA, it will generate predicated
       instructions when supported by the target.  The code is located in
!      `ifcvt.c'.
  
     * Web construction
  
       This pass splits independent uses of each pseudo-register.  This
       can improve effect of the other transformation, such as CSE or
!      register allocation.  The code for this pass is located in `web.c'.
  
     * Instruction combination
  
       This pass attempts to combine groups of two or three instructions
       that are related by data flow into single instructions.  It
       combines the RTL expressions for the instructions by substitution,
!      simplifies the result using algebra, and then attempts to match
!      the result against the machine description.  The code is located
!      in `combine.c'.
  
     * Mode switching optimization
  
       This pass looks for instructions that require the processor to be
       in a specific "mode" and minimizes the number of mode changes
!      required to satisfy all users.  What these modes are, and what
!      they apply to are completely target-specific.  The code for this
!      pass is located in `mode-switching.c'.
  
     * Modulo scheduling
  
       This pass looks at innermost loops and reorders their instructions
       by overlapping different iterations.  Modulo scheduling is
       performed immediately before instruction scheduling.  The code for
!      this pass is located in `modulo-sched.c'.
  
     * Instruction scheduling
  
!      This pass looks for instructions whose output will not be
!      available by the time that it is used in subsequent instructions.
!      Memory loads and floating point instructions often have this
!      behavior on RISC machines.  It re-orders instructions within a
!      basic block to try to separate the definition and use of items
!      that otherwise would cause pipeline stalls.  This pass is
!      performed twice, before and after register allocation.  The code
!      for this pass is located in `haifa-sched.c', `sched-deps.c',
!      `sched-ebb.c', `sched-rgn.c' and `sched-vis.c'.
  
     * Register allocation
  
--- 7194,7242 ----
       instructions, and conditional move instructions.  In the very last
       invocation after reload/LRA, it will generate predicated
       instructions when supported by the target.  The code is located in
!      'ifcvt.c'.
  
     * Web construction
  
       This pass splits independent uses of each pseudo-register.  This
       can improve effect of the other transformation, such as CSE or
!      register allocation.  The code for this pass is located in 'web.c'.
  
     * Instruction combination
  
       This pass attempts to combine groups of two or three instructions
       that are related by data flow into single instructions.  It
       combines the RTL expressions for the instructions by substitution,
!      simplifies the result using algebra, and then attempts to match the
!      result against the machine description.  The code is located in
!      'combine.c'.
  
     * Mode switching optimization
  
       This pass looks for instructions that require the processor to be
       in a specific "mode" and minimizes the number of mode changes
!      required to satisfy all users.  What these modes are, and what they
!      apply to are completely target-specific.  The code for this pass is
!      located in 'mode-switching.c'.
  
     * Modulo scheduling
  
       This pass looks at innermost loops and reorders their instructions
       by overlapping different iterations.  Modulo scheduling is
       performed immediately before instruction scheduling.  The code for
!      this pass is located in 'modulo-sched.c'.
  
     * Instruction scheduling
  
!      This pass looks for instructions whose output will not be available
!      by the time that it is used in subsequent instructions.  Memory
!      loads and floating point instructions often have this behavior on
!      RISC machines.  It re-orders instructions within a basic block to
!      try to separate the definition and use of items that otherwise
!      would cause pipeline stalls.  This pass is performed twice, before
!      and after register allocation.  The code for this pass is located
!      in 'haifa-sched.c', 'sched-deps.c', 'sched-ebb.c', 'sched-rgn.c'
!      and 'sched-vis.c'.
  
     * Register allocation
  
*************** passes that are run after the Tree optim
*** 7399,7409 ****
            regions using register pressure but the user can force it to
            use one region or regions corresponding to all loops.
  
!           Source files of the allocator are `ira.c', `ira-build.c',
!           `ira-costs.c', `ira-conflicts.c', `ira-color.c',
!           `ira-emit.c', `ira-lives', plus header files `ira.h' and
!           `ira-int.h' used for the communication between the allocator
!           and the rest of the compiler and between the IRA files.
  
          * Reloading.  This pass renumbers pseudo registers with the
            hardware registers numbers they were allocated.  Pseudo
--- 7260,7270 ----
            regions using register pressure but the user can force it to
            use one region or regions corresponding to all loops.
  
!           Source files of the allocator are 'ira.c', 'ira-build.c',
!           'ira-costs.c', 'ira-conflicts.c', 'ira-color.c', 'ira-emit.c',
!           'ira-lives', plus header files 'ira.h' and 'ira-int.h' used
!           for the communication between the allocator and the rest of
!           the compiler and between the IRA files.
  
          * Reloading.  This pass renumbers pseudo registers with the
            hardware registers numbers they were allocated.  Pseudo
*************** passes that are run after the Tree optim
*** 7411,7438 ****
            stack slots.  Then it finds instructions that are invalid
            because a value has failed to end up in a register, or has
            ended up in a register of the wrong kind.  It fixes up these
!           instructions by reloading the problematical values
!           temporarily into registers.  Additional instructions are
!           generated to do the copying.
  
            The reload pass also optionally eliminates the frame pointer
            and inserts instructions to save and restore call-clobbered
            registers around calls.
  
!           Source files are `reload.c' and `reload1.c', plus the header
!           `reload.h' used for communication between them.
  
          * This pass is a modern replacement of the reload pass.  Source
!           files are `lra.c', `lra-assign.c', `lra-coalesce.c',
!           `lra-constraints.c', `lra-eliminations.c', `lra-lives.c',
!           `lra-remat.c', `lra-spills.c', the header `lra-int.h' used
!           for communication between them, and the header `lra.h' used
!           for communication between LRA and the rest of compiler.
  
            Unlike the reload pass, intermediate LRA decisions are
!           reflected in RTL as much as possible.  This reduces the
!           number of target-dependent macros and hooks, leaving
!           instruction constraints as the primary source of control.
  
            LRA is run on targets for which TARGET_LRA_P returns true.
  
--- 7272,7299 ----
            stack slots.  Then it finds instructions that are invalid
            because a value has failed to end up in a register, or has
            ended up in a register of the wrong kind.  It fixes up these
!           instructions by reloading the problematical values temporarily
!           into registers.  Additional instructions are generated to do
!           the copying.
  
            The reload pass also optionally eliminates the frame pointer
            and inserts instructions to save and restore call-clobbered
            registers around calls.
  
!           Source files are 'reload.c' and 'reload1.c', plus the header
!           'reload.h' used for communication between them.
  
          * This pass is a modern replacement of the reload pass.  Source
!           files are 'lra.c', 'lra-assign.c', 'lra-coalesce.c',
!           'lra-constraints.c', 'lra-eliminations.c', 'lra-lives.c',
!           'lra-remat.c', 'lra-spills.c', the header 'lra-int.h' used for
!           communication between them, and the header 'lra.h' used for
!           communication between LRA and the rest of compiler.
  
            Unlike the reload pass, intermediate LRA decisions are
!           reflected in RTL as much as possible.  This reduces the number
!           of target-dependent macros and hooks, leaving instruction
!           constraints as the primary source of control.
  
            LRA is run on targets for which TARGET_LRA_P returns true.
  
*************** passes that are run after the Tree optim
*** 7442,7449 ****
       information is not available, various types of static analysis are
       performed to make the predictions normally coming from the profile
       feedback (IE execution frequency, branch probability, etc).  It is
!      implemented in the file `bb-reorder.c', and the various prediction
!      routines are in `predict.c'.
  
     * Variable tracking
  
--- 7303,7310 ----
       information is not available, various types of static analysis are
       performed to make the predictions normally coming from the profile
       feedback (IE execution frequency, branch probability, etc).  It is
!      implemented in the file 'bb-reorder.c', and the various prediction
!      routines are in 'predict.c'.
  
     * Variable tracking
  
*************** passes that are run after the Tree optim
*** 7451,7499 ****
       in code and generates notes describing the variable locations to
       RTL code.  The location lists are then generated according to these
       notes to debug information if the debugging information format
!      supports location lists.  The code is located in `var-tracking.c'.
  
     * Delayed branch scheduling
  
       This optional pass attempts to find instructions that can go into
       the delay slots of other instructions, usually jumps and calls.
!      The code for this pass is located in `reorg.c'.
  
     * Branch shortening
  
       On many RISC machines, branch instructions have a limited range.
       Thus, longer sequences of instructions must be used for long
!      branches.  In this pass, the compiler figures out what how far
!      each instruction will be from each other instruction, and
!      therefore whether the usual instructions, or the longer sequences,
!      must be used for each branch.  The code for this pass is located
!      in `final.c'.
  
     * Register-to-stack conversion
  
       Conversion from usage of some hard registers to usage of a register
       stack may be done at this point.  Currently, this is supported only
       for the floating-point registers of the Intel 80387 coprocessor.
!      The code for this pass is located in `reg-stack.c'.
  
     * Final
  
       This pass outputs the assembler code for the function.  The source
!      files are `final.c' plus `insn-output.c'; the latter is generated
!      automatically from the machine description by the tool `genoutput'.
!      The header file `conditions.h' is used for communication between
       these files.
  
     * Debugging information output
  
       This is run after final because it must output the stack slot
       offsets for pseudo registers that did not get hard registers.
!      Source files are `dbxout.c' for DBX symbol table format,
!      `sdbout.c' for SDB symbol table format, `dwarfout.c' for DWARF
!      symbol table format, files `dwarf2out.c' and `dwarf2asm.c' for
!      DWARF2 symbol table format, and `vmsdbgout.c' for VMS debug symbol
!      table format.
! 
  
  
  File: gccint.info,  Node: Optimization info,  Prev: RTL passes,  Up: Passes
--- 7312,7358 ----
       in code and generates notes describing the variable locations to
       RTL code.  The location lists are then generated according to these
       notes to debug information if the debugging information format
!      supports location lists.  The code is located in 'var-tracking.c'.
  
     * Delayed branch scheduling
  
       This optional pass attempts to find instructions that can go into
       the delay slots of other instructions, usually jumps and calls.
!      The code for this pass is located in 'reorg.c'.
  
     * Branch shortening
  
       On many RISC machines, branch instructions have a limited range.
       Thus, longer sequences of instructions must be used for long
!      branches.  In this pass, the compiler figures out what how far each
!      instruction will be from each other instruction, and therefore
!      whether the usual instructions, or the longer sequences, must be
!      used for each branch.  The code for this pass is located in
!      'final.c'.
  
     * Register-to-stack conversion
  
       Conversion from usage of some hard registers to usage of a register
       stack may be done at this point.  Currently, this is supported only
       for the floating-point registers of the Intel 80387 coprocessor.
!      The code for this pass is located in 'reg-stack.c'.
  
     * Final
  
       This pass outputs the assembler code for the function.  The source
!      files are 'final.c' plus 'insn-output.c'; the latter is generated
!      automatically from the machine description by the tool 'genoutput'.
!      The header file 'conditions.h' is used for communication between
       these files.
  
     * Debugging information output
  
       This is run after final because it must output the stack slot
       offsets for pseudo registers that did not get hard registers.
!      Source files are 'dbxout.c' for DBX symbol table format, 'sdbout.c'
!      for SDB symbol table format, 'dwarfout.c' for DWARF symbol table
!      format, files 'dwarf2out.c' and 'dwarf2asm.c' for DWARF2 symbol
!      table format, and 'vmsdbgout.c' for VMS debug symbol table format.
  
  
  File: gccint.info,  Node: Optimization info,  Prev: RTL passes,  Up: Passes
*************** File: gccint.info,  Node: Optimization i
*** 7502,7508 ****
  =====================
  
  This section is describes dump infrastructure which is common to both
! pass dumps as well as optimization dumps. The goal for this
  infrastructure is to provide both gcc developers and users detailed
  information about various compiler transformations and optimizations.
  
--- 7361,7367 ----
  =====================
  
  This section is describes dump infrastructure which is common to both
! pass dumps as well as optimization dumps.  The goal for this
  infrastructure is to provide both gcc developers and users detailed
  information about various compiler transformations and optimizations.
  
*************** File: gccint.info,  Node: Dump setup,  N
*** 7521,7544 ****
  9.7.1 Dump setup
  ----------------
  
! A dump_manager class is defined in `dumpfile.h'. Various passes
! register dumping pass-specific information via `dump_register' in
! `passes.c'. During the registration, an optimization pass can select
! its optimization group (*note Optimization groups::). After that
  optimization information corresponding to the entire group (presumably
! from multiple passes) can be output via command-line switches. Note
  that if a pass does not fit into any of the pre-defined groups, it can
! select `OPTGROUP_NONE'.
  
   Note that in general, a pass need not know its dump output file name,
! whether certain flags are enabled, etc. However, for legacy reasons,
! passes could also call `dump_begin' which returns a stream in case the
! particular pass has optimization dumps enabled. A pass could call
! `dump_end' when the dump has ended. These methods should go away once
  all the passes are converted to use the new dump infrastructure.
  
!  The recommended way to setup the dump output is via `dump_start' and
! `dump_end'.
  
  
  File: gccint.info,  Node: Optimization groups,  Next: Dump files and streams,  Prev: Dump setup,  Up: Optimization info
--- 7380,7403 ----
  9.7.1 Dump setup
  ----------------
  
! A dump_manager class is defined in 'dumpfile.h'.  Various passes
! register dumping pass-specific information via 'dump_register' in
! 'passes.c'.  During the registration, an optimization pass can select
! its optimization group (*note Optimization groups::).  After that
  optimization information corresponding to the entire group (presumably
! from multiple passes) can be output via command-line switches.  Note
  that if a pass does not fit into any of the pre-defined groups, it can
! select 'OPTGROUP_NONE'.
  
   Note that in general, a pass need not know its dump output file name,
! whether certain flags are enabled, etc.  However, for legacy reasons,
! passes could also call 'dump_begin' which returns a stream in case the
! particular pass has optimization dumps enabled.  A pass could call
! 'dump_end' when the dump has ended.  These methods should go away once
  all the passes are converted to use the new dump infrastructure.
  
!  The recommended way to setup the dump output is via 'dump_start' and
! 'dump_end'.
  
  
  File: gccint.info,  Node: Optimization groups,  Next: Dump files and streams,  Prev: Dump setup,  Up: Optimization info
*************** File: gccint.info,  Node: Optimization g
*** 7546,7576 ****
  9.7.2 Optimization groups
  -------------------------
  
! The optimization passes are grouped into several categories. Currently
! defined categories in `dumpfile.h' are
  
! `OPTGROUP_IPA'
!      IPA optimization passes. Enabled by `-ipa'
  
! `OPTGROUP_LOOP'
!      Loop optimization passes. Enabled by `-loop'.
  
! `OPTGROUP_INLINE'
!      Inlining passes. Enabled by `-inline'.
  
! `OPTGROUP_VEC'
!      Vectorization passes. Enabled by `-vec'.
  
! `OPTGROUP_OTHER'
       All other optimization passes which do not fall into one of the
       above.
  
! `OPTGROUP_ALL'
!      All optimization passes. Enabled by `-all'.
! 
  
   By using groups a user could selectively enable optimization
! information only for a group of passes. By default, the optimization
  information for all the passes is dumped.
  
  
--- 7405,7434 ----
  9.7.2 Optimization groups
  -------------------------
  
! The optimization passes are grouped into several categories.  Currently
! defined categories in 'dumpfile.h' are
  
! 'OPTGROUP_IPA'
!      IPA optimization passes.  Enabled by '-ipa'
  
! 'OPTGROUP_LOOP'
!      Loop optimization passes.  Enabled by '-loop'.
  
! 'OPTGROUP_INLINE'
!      Inlining passes.  Enabled by '-inline'.
  
! 'OPTGROUP_VEC'
!      Vectorization passes.  Enabled by '-vec'.
  
! 'OPTGROUP_OTHER'
       All other optimization passes which do not fall into one of the
       above.
  
! 'OPTGROUP_ALL'
!      All optimization passes.  Enabled by '-all'.
  
   By using groups a user could selectively enable optimization
! information only for a group of passes.  By default, the optimization
  information for all the passes is dumped.
  
  
*************** File: gccint.info,  Node: Dump files and
*** 7580,7603 ****
  ----------------------------
  
  There are two separate output streams available for outputting
! optimization information from passes. Note that both these streams
! accept `stderr' and `stdout' as valid streams and thus it is possible
! to dump output to standard output or error. This is specially handy for
  outputting all available information in a single file by redirecting
! `stderr'.
  
! ``pstream''
!      This stream is for pass-specific dump output. For example,
!      `-fdump-tree-vect=foo.v' dumps tree vectorization pass output into
!      the given file name `foo.v'. If the file name is not provided, the
!      default file name is based on the source file and pass number. Note
!      that one could also use special file names `stdout' and `stderr'
!      for dumping to standard output and standard error respectively.
  
! ``alt_stream''
       This steam is used for printing optimization specific output in
!      response to the `-fopt-info'. Again a file name can be given. If
!      the file name is not given, it defaults to `stderr'.
  
  
  File: gccint.info,  Node: Dump output verbosity,  Next: Dump types,  Prev: Dump files and streams,  Up: Optimization info
--- 7438,7462 ----
  ----------------------------
  
  There are two separate output streams available for outputting
! optimization information from passes.  Note that both these streams
! accept 'stderr' and 'stdout' as valid streams and thus it is possible to
! dump output to standard output or error.  This is specially handy for
  outputting all available information in a single file by redirecting
! 'stderr'.
  
! 'pstream'
!      This stream is for pass-specific dump output.  For example,
!      '-fdump-tree-vect=foo.v' dumps tree vectorization pass output into
!      the given file name 'foo.v'.  If the file name is not provided, the
!      default file name is based on the source file and pass number.
!      Note that one could also use special file names 'stdout' and
!      'stderr' for dumping to standard output and standard error
!      respectively.
  
! 'alt_stream'
       This steam is used for printing optimization specific output in
!      response to the '-fopt-info'.  Again a file name can be given.  If
!      the file name is not given, it defaults to 'stderr'.
  
  
  File: gccint.info,  Node: Dump output verbosity,  Next: Dump types,  Prev: Dump files and streams,  Up: Optimization info
*************** File: gccint.info,  Node: Dump output ve
*** 7607,7633 ****
  
  The dump verbosity has the following options
  
! `optimized'
!      Print information when an optimization is successfully applied. It
!      is up to a pass to decide which information is relevant. For
       example, the vectorizer passes print the source location of loops
       which got successfully vectorized.
  
! `missed'
!      Print information about missed optimizations. Individual passes
!      control which information to include in the output. For example,
  
            gcc -O2 -ftree-vectorize -fopt-info-vec-missed
  
       will print information about missed optimization opportunities from
       vectorization passes on stderr.
  
! `note'
       Print verbose information about optimizations, such as certain
       transformations, more detailed messages about decisions etc.
  
! `all'
!      Print detailed optimization information. This includes OPTIMIZED,
       MISSED, and NOTE.
  
  
--- 7466,7492 ----
  
  The dump verbosity has the following options
  
! 'optimized'
!      Print information when an optimization is successfully applied.  It
!      is up to a pass to decide which information is relevant.  For
       example, the vectorizer passes print the source location of loops
       which got successfully vectorized.
  
! 'missed'
!      Print information about missed optimizations.  Individual passes
!      control which information to include in the output.  For example,
  
            gcc -O2 -ftree-vectorize -fopt-info-vec-missed
  
       will print information about missed optimization opportunities from
       vectorization passes on stderr.
  
! 'note'
       Print verbose information about optimizations, such as certain
       transformations, more detailed messages about decisions etc.
  
! 'all'
!      Print detailed optimization information.  This includes OPTIMIZED,
       MISSED, and NOTE.
  
  
*************** File: gccint.info,  Node: Dump types,  N
*** 7636,7679 ****
  9.7.5 Dump types
  ----------------
  
! `dump_printf'
!      This is a generic method for doing formatted output. It takes an
!      additional argument `dump_kind' which signifies the type of dump.
!      This method outputs information only when the dumps are enabled
!      for this particular `dump_kind'. Note that the caller doesn't need
!      to know if the particular dump is enabled or not, or even the file
!      name. The caller only needs to decide which dump output
!      information is relevant, and under what conditions. This determines
!      the associated flags.
  
!      Consider the following example from `loop-unroll.c' where an
       informative message about a loop (along with its location) is
       printed when any of the following flags is enabled
-         - optimization messages
  
          - RTL dumps
- 
          - detailed dumps
  
- 
            int report_flags = MSG_OPTIMIZED_LOCATIONS | TDF_RTL | TDF_DETAILS;
            dump_printf_loc (report_flags, locus,
                             "loop turned into non-loop; it never loops.\n");
  
! `dump_basic_block'
       Output basic block.
! 
! `dump_generic_expr'
       Output generic expression.
! 
! `dump_gimple_stmt'
       Output gimple statement.
  
       Note that the above methods also have variants prefixed with
!      `_loc', such as `dump_printf_loc', which are similar except they
       also output the source location information.
  
- 
  
  File: gccint.info,  Node: Dump examples,  Prev: Dump types,  Up: Optimization info
  
--- 7495,7534 ----
  9.7.5 Dump types
  ----------------
  
! 'dump_printf'
  
!      This is a generic method for doing formatted output.  It takes an
!      additional argument 'dump_kind' which signifies the type of dump.
!      This method outputs information only when the dumps are enabled for
!      this particular 'dump_kind'.  Note that the caller doesn't need to
!      know if the particular dump is enabled or not, or even the file
!      name.  The caller only needs to decide which dump output
!      information is relevant, and under what conditions.  This
!      determines the associated flags.
! 
!      Consider the following example from 'loop-unroll.c' where an
       informative message about a loop (along with its location) is
       printed when any of the following flags is enabled
  
+         - optimization messages
          - RTL dumps
          - detailed dumps
  
            int report_flags = MSG_OPTIMIZED_LOCATIONS | TDF_RTL | TDF_DETAILS;
            dump_printf_loc (report_flags, locus,
                             "loop turned into non-loop; it never loops.\n");
  
! 'dump_basic_block'
       Output basic block.
! 'dump_generic_expr'
       Output generic expression.
! 'dump_gimple_stmt'
       Output gimple statement.
  
       Note that the above methods also have variants prefixed with
!      '_loc', such as 'dump_printf_loc', which are similar except they
       also output the source location information.
  
  
  File: gccint.info,  Node: Dump examples,  Prev: Dump types,  Up: Optimization info
  
*************** File: gccint.info,  Node: Dump examples,
*** 7683,7716 ****
       gcc -O3 -fopt-info-missed=missed.all
  
   outputs missed optimization report from all the passes into
! `missed.all'.
  
   As another example,
       gcc -O3 -fopt-info-inline-optimized-missed=inline.txt
  
!  will output information about missed optimizations as well as
! optimized locations from all the inlining passes into `inline.txt'.
  
   If the FILENAME is provided, then the dumps from all the applicable
! optimizations are concatenated into the `filename'.  Otherwise the dump
! is output onto `stderr'. If OPTIONS is omitted, it defaults to
! `all-all', which means dump all available optimization info from all
! the passes. In the following example, all optimization info is output
! on to `stderr'.
  
       gcc -O3 -fopt-info
  
!  Note that `-fopt-info-vec-missed' behaves the same as
! `-fopt-info-missed-vec'.
  
   As another example, consider
  
       gcc -fopt-info-vec-missed=vec.miss -fopt-info-loop-optimized=loop.opt
  
!  Here the two output file names `vec.miss' and `loop.opt' are in
! conflict since only one output file is allowed. In this case, only the
! first option takes effect and the subsequent options are ignored. Thus
! only the `vec.miss' is produced which containts dumps from the
  vectorizer about missed opportunities.
  
  
--- 7538,7571 ----
       gcc -O3 -fopt-info-missed=missed.all
  
   outputs missed optimization report from all the passes into
! 'missed.all'.
  
   As another example,
       gcc -O3 -fopt-info-inline-optimized-missed=inline.txt
  
!  will output information about missed optimizations as well as optimized
! locations from all the inlining passes into 'inline.txt'.
  
   If the FILENAME is provided, then the dumps from all the applicable
! optimizations are concatenated into the 'filename'.  Otherwise the dump
! is output onto 'stderr'.  If OPTIONS is omitted, it defaults to
! 'all-all', which means dump all available optimization info from all the
! passes.  In the following example, all optimization info is output on to
! 'stderr'.
  
       gcc -O3 -fopt-info
  
!  Note that '-fopt-info-vec-missed' behaves the same as
! '-fopt-info-missed-vec'.
  
   As another example, consider
  
       gcc -fopt-info-vec-missed=vec.miss -fopt-info-loop-optimized=loop.opt
  
!  Here the two output file names 'vec.miss' and 'loop.opt' are in
! conflict since only one output file is allowed.  In this case, only the
! first option takes effect and the subsequent options are ignored.  Thus
! only the 'vec.miss' is produced which containts dumps from the
  vectorizer about missed opportunities.
  
  
*************** The purpose of GENERIC is simply to prov
*** 7723,7748 ****
  of representing an entire function in trees.  To this end, it was
  necessary to add a few new tree codes to the back end, but almost
  everything was already there.  If you can express it with the codes in
! `gcc/tree.def', it's GENERIC.
  
   Early on, there was a great deal of debate about how to think about
  statements in a tree IL.  In GENERIC, a statement is defined as any
  expression whose value, if any, is ignored.  A statement will always
! have `TREE_SIDE_EFFECTS' set (or it will be discarded), but a
! non-statement expression may also have side effects.  A `CALL_EXPR',
! for instance.
  
   It would be possible for some local optimizations to work on the
  GENERIC form of a function; indeed, the adapted tree inliner works fine
! on GENERIC, but the current compiler performs inlining after lowering
! to GIMPLE (a restricted form described in the next section). Indeed,
  currently the frontends perform this lowering before handing off to
! `tree_rest_of_compilation', but this seems inelegant.
  
  * Menu:
  
  * Deficiencies::                Topics net yet covered in this document.
! * Tree overview::               All about `tree's.
  * Types::                       Fundamental and aggregate types.
  * Declarations::                Type declarations and variables.
  * Attributes::                  Declaration and type attributes.
--- 7578,7603 ----
  of representing an entire function in trees.  To this end, it was
  necessary to add a few new tree codes to the back end, but almost
  everything was already there.  If you can express it with the codes in
! 'gcc/tree.def', it's GENERIC.
  
   Early on, there was a great deal of debate about how to think about
  statements in a tree IL.  In GENERIC, a statement is defined as any
  expression whose value, if any, is ignored.  A statement will always
! have 'TREE_SIDE_EFFECTS' set (or it will be discarded), but a
! non-statement expression may also have side effects.  A 'CALL_EXPR', for
! instance.
  
   It would be possible for some local optimizations to work on the
  GENERIC form of a function; indeed, the adapted tree inliner works fine
! on GENERIC, but the current compiler performs inlining after lowering to
! GIMPLE (a restricted form described in the next section).  Indeed,
  currently the frontends perform this lowering before handing off to
! 'tree_rest_of_compilation', but this seems inelegant.
  
  * Menu:
  
  * Deficiencies::                Topics net yet covered in this document.
! * Tree overview::               All about 'tree's.
  * Types::                       Fundamental and aggregate types.
  * Declarations::                Type declarations and variables.
  * Attributes::                  Declaration and type attributes.
*************** File: gccint.info,  Node: Tree overview,
*** 7769,7806 ****
  =============
  
  The central data structure used by the internal representation is the
! `tree'.  These nodes, while all of the C type `tree', are of many
! varieties.  A `tree' is a pointer type, but the object to which it
  points may be of a variety of types.  From this point forward, we will
! refer to trees in ordinary type, rather than in `this font', except
! when talking about the actual C type `tree'.
  
   You can tell what kind of node a particular tree is by using the
! `TREE_CODE' macro.  Many, many macros take trees as input and return
  trees as output.  However, most macros require a certain kind of tree
! node as input.  In other words, there is a type-system for trees, but
! it is not reflected in the C type-system.
  
!  For safety, it is useful to configure GCC with `--enable-checking'.
  Although this results in a significant performance penalty (since all
  tree types are checked at run-time), and is therefore inappropriate in a
  release version, it is extremely helpful during the development process.
  
   Many macros behave as predicates.  Many, although not all, of these
! predicates end in `_P'.  Do not rely on the result type of these macros
  being of any particular type.  You may, however, rely on the fact that
! the type can be compared to `0', so that statements like
       if (TEST_P (t) && !TEST_P (y))
         x = 1;
!  and
       int i = (TEST_P (t) != 0);
!  are legal.  Macros that return `int' values now may be changed to
! return `tree' values, or other pointers in the future.  Even those that
! continue to return `int' may return multiple nonzero codes where
  previously they returned only zero and one.  Therefore, you should not
  write code like
       if (TEST_P (t) == 1)
!  as this code is not guaranteed to work correctly in the future.
  
   You should not take the address of values returned by the macros or
  functions described here.  In particular, no guarantee is given that the
--- 7624,7661 ----
  =============
  
  The central data structure used by the internal representation is the
! 'tree'.  These nodes, while all of the C type 'tree', are of many
! varieties.  A 'tree' is a pointer type, but the object to which it
  points may be of a variety of types.  From this point forward, we will
! refer to trees in ordinary type, rather than in 'this font', except when
! talking about the actual C type 'tree'.
  
   You can tell what kind of node a particular tree is by using the
! 'TREE_CODE' macro.  Many, many macros take trees as input and return
  trees as output.  However, most macros require a certain kind of tree
! node as input.  In other words, there is a type-system for trees, but it
! is not reflected in the C type-system.
  
!  For safety, it is useful to configure GCC with '--enable-checking'.
  Although this results in a significant performance penalty (since all
  tree types are checked at run-time), and is therefore inappropriate in a
  release version, it is extremely helpful during the development process.
  
   Many macros behave as predicates.  Many, although not all, of these
! predicates end in '_P'.  Do not rely on the result type of these macros
  being of any particular type.  You may, however, rely on the fact that
! the type can be compared to '0', so that statements like
       if (TEST_P (t) && !TEST_P (y))
         x = 1;
! and
       int i = (TEST_P (t) != 0);
! are legal.  Macros that return 'int' values now may be changed to return
! 'tree' values, or other pointers in the future.  Even those that
! continue to return 'int' may return multiple nonzero codes where
  previously they returned only zero and one.  Therefore, you should not
  write code like
       if (TEST_P (t) == 1)
! as this code is not guaranteed to work correctly in the future.
  
   You should not take the address of values returned by the macros or
  functions described here.  In particular, no guarantee is given that the
*************** made up entirely of uppercase letters ma
*** 7813,7837 ****
  than once.  You may assume that a macro or function whose name is made
  up entirely of lowercase letters will evaluate its arguments only once.
  
!  The `error_mark_node' is a special tree.  Its tree code is
! `ERROR_MARK', but since there is only ever one node with that code, the
! usual practice is to compare the tree against `error_mark_node'.  (This
  test is just a test for pointer equality.)  If an error has occurred
! during front-end processing the flag `errorcount' will be set.  If the
! front end has encountered code it cannot handle, it will issue a
! message to the user and set `sorrycount'.  When these flags are set,
! any macro or function which normally returns a tree of a particular
! kind may instead return the `error_mark_node'.  Thus, if you intend to
! do any processing of erroneous code, you must be prepared to deal with
! the `error_mark_node'.
  
   Occasionally, a particular tree slot (like an operand to an expression,
! or a particular field in a declaration) will be referred to as
! "reserved for the back end".  These slots are used to store RTL when
! the tree is converted to RTL for use by the GCC back end.  However, if
! that process is not taking place (e.g., if the front end is being hooked
! up to an intelligent editor), then those slots may be used by the back
! end presently in use.
  
   If you encounter situations that do not match this documentation, such
  as tree nodes of types not mentioned here, or macros documented to
--- 7668,7692 ----
  than once.  You may assume that a macro or function whose name is made
  up entirely of lowercase letters will evaluate its arguments only once.
  
!  The 'error_mark_node' is a special tree.  Its tree code is
! 'ERROR_MARK', but since there is only ever one node with that code, the
! usual practice is to compare the tree against 'error_mark_node'.  (This
  test is just a test for pointer equality.)  If an error has occurred
! during front-end processing the flag 'errorcount' will be set.  If the
! front end has encountered code it cannot handle, it will issue a message
! to the user and set 'sorrycount'.  When these flags are set, any macro
! or function which normally returns a tree of a particular kind may
! instead return the 'error_mark_node'.  Thus, if you intend to do any
! processing of erroneous code, you must be prepared to deal with the
! 'error_mark_node'.
  
   Occasionally, a particular tree slot (like an operand to an expression,
! or a particular field in a declaration) will be referred to as "reserved
! for the back end".  These slots are used to store RTL when the tree is
! converted to RTL for use by the GCC back end.  However, if that process
! is not taking place (e.g., if the front end is being hooked up to an
! intelligent editor), then those slots may be used by the back end
! presently in use.
  
   If you encounter situations that do not match this documentation, such
  as tree nodes of types not mentioned here, or macros documented to
*************** File: gccint.info,  Node: Macros and Fun
*** 7851,7920 ****
  10.2.1 Trees
  ------------
  
! All GENERIC trees have two fields in common.  First, `TREE_CHAIN' is a
  pointer that can be used as a singly-linked list to other trees.  The
! other is `TREE_TYPE'.  Many trees store the type of an expression or
  declaration in this field.
  
   These are some other functions for handling trees:
  
! `tree_size'
       Return the number of bytes a tree takes.
  
! `build0'
! `build1'
! `build2'
! `build3'
! `build4'
! `build5'
! `build6'
       These functions build a tree and supply values to put in each
!      parameter.  The basic signature is `code, type, [operands]'.
!      `code' is the `TREE_CODE', and `type' is a tree representing the
!      `TREE_TYPE'.  These are followed by the operands, each of which is
       also a tree.
  
- 
  
  File: gccint.info,  Node: Identifiers,  Next: Containers,  Prev: Macros and Functions,  Up: Tree overview
  
  10.2.2 Identifiers
  ------------------
  
! An `IDENTIFIER_NODE' represents a slightly more general concept than
! the standard C or C++ concept of identifier.  In particular, an
! `IDENTIFIER_NODE' may contain a `$', or other extraordinary characters.
  
!  There are never two distinct `IDENTIFIER_NODE's representing the same
  identifier.  Therefore, you may use pointer equality to compare
! `IDENTIFIER_NODE's, rather than using a routine like `strcmp'.  Use
! `get_identifier' to obtain the unique `IDENTIFIER_NODE' for a supplied
  string.
  
   You can use the following macros to access identifiers:
! `IDENTIFIER_POINTER'
!      The string represented by the identifier, represented as a
!      `char*'.  This string is always `NUL'-terminated, and contains no
!      embedded `NUL' characters.
  
! `IDENTIFIER_LENGTH'
!      The length of the string returned by `IDENTIFIER_POINTER', not
!      including the trailing `NUL'.  This value of `IDENTIFIER_LENGTH
!      (x)' is always the same as `strlen (IDENTIFIER_POINTER (x))'.
  
! `IDENTIFIER_OPNAME_P'
       This predicate holds if the identifier represents the name of an
       overloaded operator.  In this case, you should not depend on the
!      contents of either the `IDENTIFIER_POINTER' or the
!      `IDENTIFIER_LENGTH'.
  
! `IDENTIFIER_TYPENAME_P'
       This predicate holds if the identifier represents the name of a
!      user-defined conversion operator.  In this case, the `TREE_TYPE' of
!      the `IDENTIFIER_NODE' holds the type to which the conversion
       operator converts.
  
- 
  
  File: gccint.info,  Node: Containers,  Prev: Identifiers,  Up: Tree overview
  
--- 7706,7774 ----
  10.2.1 Trees
  ------------
  
! All GENERIC trees have two fields in common.  First, 'TREE_CHAIN' is a
  pointer that can be used as a singly-linked list to other trees.  The
! other is 'TREE_TYPE'.  Many trees store the type of an expression or
  declaration in this field.
  
   These are some other functions for handling trees:
  
! 'tree_size'
       Return the number of bytes a tree takes.
  
! 'build0'
! 'build1'
! 'build2'
! 'build3'
! 'build4'
! 'build5'
! 'build6'
! 
       These functions build a tree and supply values to put in each
!      parameter.  The basic signature is 'code, type, [operands]'.
!      'code' is the 'TREE_CODE', and 'type' is a tree representing the
!      'TREE_TYPE'.  These are followed by the operands, each of which is
       also a tree.
  
  
  File: gccint.info,  Node: Identifiers,  Next: Containers,  Prev: Macros and Functions,  Up: Tree overview
  
  10.2.2 Identifiers
  ------------------
  
! An 'IDENTIFIER_NODE' represents a slightly more general concept than the
! standard C or C++ concept of identifier.  In particular, an
! 'IDENTIFIER_NODE' may contain a '$', or other extraordinary characters.
  
!  There are never two distinct 'IDENTIFIER_NODE's representing the same
  identifier.  Therefore, you may use pointer equality to compare
! 'IDENTIFIER_NODE's, rather than using a routine like 'strcmp'.  Use
! 'get_identifier' to obtain the unique 'IDENTIFIER_NODE' for a supplied
  string.
  
   You can use the following macros to access identifiers:
! 'IDENTIFIER_POINTER'
!      The string represented by the identifier, represented as a 'char*'.
!      This string is always 'NUL'-terminated, and contains no embedded
!      'NUL' characters.
  
! 'IDENTIFIER_LENGTH'
!      The length of the string returned by 'IDENTIFIER_POINTER', not
!      including the trailing 'NUL'.  This value of 'IDENTIFIER_LENGTH
!      (x)' is always the same as 'strlen (IDENTIFIER_POINTER (x))'.
  
! 'IDENTIFIER_OPNAME_P'
       This predicate holds if the identifier represents the name of an
       overloaded operator.  In this case, you should not depend on the
!      contents of either the 'IDENTIFIER_POINTER' or the
!      'IDENTIFIER_LENGTH'.
  
! 'IDENTIFIER_TYPENAME_P'
       This predicate holds if the identifier represents the name of a
!      user-defined conversion operator.  In this case, the 'TREE_TYPE' of
!      the 'IDENTIFIER_NODE' holds the type to which the conversion
       operator converts.
  
  
  File: gccint.info,  Node: Containers,  Prev: Identifiers,  Up: Tree overview
  
*************** File: gccint.info,  Node: Containers,  P
*** 7922,7943 ****
  -----------------
  
  Two common container data structures can be represented directly with
! tree nodes.  A `TREE_LIST' is a singly linked list containing two trees
! per node.  These are the `TREE_PURPOSE' and `TREE_VALUE' of each node.
! (Often, the `TREE_PURPOSE' contains some kind of tag, or additional
! information, while the `TREE_VALUE' contains the majority of the
! payload.  In other cases, the `TREE_PURPOSE' is simply `NULL_TREE',
! while in still others both the `TREE_PURPOSE' and `TREE_VALUE' are of
! equal stature.)  Given one `TREE_LIST' node, the next node is found by
! following the `TREE_CHAIN'.  If the `TREE_CHAIN' is `NULL_TREE', then
  you have reached the end of the list.
  
!  A `TREE_VEC' is a simple vector.  The `TREE_VEC_LENGTH' is an integer
  (not a tree) giving the number of nodes in the vector.  The nodes
! themselves are accessed using the `TREE_VEC_ELT' macro, which takes two
! arguments.  The first is the `TREE_VEC' in question; the second is an
! integer indicating which element in the vector is desired.  The
! elements are indexed from zero.
  
  
  File: gccint.info,  Node: Types,  Next: Declarations,  Prev: Tree overview,  Up: GENERIC
--- 7776,7797 ----
  -----------------
  
  Two common container data structures can be represented directly with
! tree nodes.  A 'TREE_LIST' is a singly linked list containing two trees
! per node.  These are the 'TREE_PURPOSE' and 'TREE_VALUE' of each node.
! (Often, the 'TREE_PURPOSE' contains some kind of tag, or additional
! information, while the 'TREE_VALUE' contains the majority of the
! payload.  In other cases, the 'TREE_PURPOSE' is simply 'NULL_TREE',
! while in still others both the 'TREE_PURPOSE' and 'TREE_VALUE' are of
! equal stature.)  Given one 'TREE_LIST' node, the next node is found by
! following the 'TREE_CHAIN'.  If the 'TREE_CHAIN' is 'NULL_TREE', then
  you have reached the end of the list.
  
!  A 'TREE_VEC' is a simple vector.  The 'TREE_VEC_LENGTH' is an integer
  (not a tree) giving the number of nodes in the vector.  The nodes
! themselves are accessed using the 'TREE_VEC_ELT' macro, which takes two
! arguments.  The first is the 'TREE_VEC' in question; the second is an
! integer indicating which element in the vector is desired.  The elements
! are indexed from zero.
  
  
  File: gccint.info,  Node: Types,  Next: Declarations,  Prev: Tree overview,  Up: GENERIC
*************** that there is exactly one tree node corr
*** 7950,8201 ****
  are often multiple nodes corresponding to the same type.
  
   For the most part, different kinds of types have different tree codes.
! (For example, pointer types use a `POINTER_TYPE' code while arrays use
! an `ARRAY_TYPE' code.)  However, pointers to member functions use the
! `RECORD_TYPE' code.  Therefore, when writing a `switch' statement that
  depends on the code associated with a particular type, you should take
! care to handle pointers to member functions under the `RECORD_TYPE'
! case label.
  
   The following functions and macros deal with cv-qualification of types:
! `TYPE_MAIN_VARIANT'
       This macro returns the unqualified version of a type.  It may be
       applied to an unqualified type, but it is not always the identity
       function in that case.
  
   A few other macros and functions are usable with all types:
! `TYPE_SIZE'
       The number of bits required to represent the type, represented as
!      an `INTEGER_CST'.  For an incomplete type, `TYPE_SIZE' will be
!      `NULL_TREE'.
  
! `TYPE_ALIGN'
!      The alignment of the type, in bits, represented as an `int'.
  
! `TYPE_NAME'
!      This macro returns a declaration (in the form of a `TYPE_DECL') for
!      the type.  (Note this macro does _not_ return an
!      `IDENTIFIER_NODE', as you might expect, given its name!)  You can
!      look at the `DECL_NAME' of the `TYPE_DECL' to obtain the actual
!      name of the type.  The `TYPE_NAME' will be `NULL_TREE' for a type
!      that is not a built-in type, the result of a typedef, or a named
!      class type.
  
! `TYPE_CANONICAL'
       This macro returns the "canonical" type for the given type node.
       Canonical types are used to improve performance in the C++ and
       Objective-C++ front ends by allowing efficient comparison between
!      two type nodes in `same_type_p': if the `TYPE_CANONICAL' values of
       the types are equal, the types are equivalent; otherwise, the types
!      are not equivalent. The notion of equivalence for canonical types
       is the same as the notion of type equivalence in the language
!      itself. For instance,
  
!      When `TYPE_CANONICAL' is `NULL_TREE', there is no canonical type
!      for the given type node. In this case, comparison between this
       type and any other type requires the compiler to perform a deep,
       "structural" comparison to see if the two type nodes have the same
       form and properties.
  
       The canonical type for a node is always the most fundamental type
!      in the equivalence class of types. For instance, `int' is its own
!      canonical type. A typedef `I' of `int' will have `int' as its
!      canonical type. Similarly, `I*' and a typedef `IP' (defined to
!      `I*') will has `int*' as their canonical type. When building a new
!      type node, be sure to set `TYPE_CANONICAL' to the appropriate
!      canonical type. If the new type is a compound type (built from
       other types), and any of those other types require structural
!      equality, use `SET_TYPE_STRUCTURAL_EQUALITY' to ensure that the
!      new type also requires structural equality. Finally, if for some
!      reason you cannot guarantee that `TYPE_CANONICAL' will point to
!      the canonical type, use `SET_TYPE_STRUCTURAL_EQUALITY' to make
!      sure that the new type-and any type constructed based on
!      it-requires structural equality. If you suspect that the canonical
!      type system is miscomparing types, pass `--param
!      verify-canonical-types=1' to the compiler or configure with
!      `--enable-checking' to force the compiler to verify its
!      canonical-type comparisons against the structural comparisons; the
!      compiler will then print any warnings if the canonical types
!      miscompare.
  
! `TYPE_STRUCTURAL_EQUALITY_P'
       This predicate holds when the node requires structural equality
!      checks, e.g., when `TYPE_CANONICAL' is `NULL_TREE'.
  
! `SET_TYPE_STRUCTURAL_EQUALITY'
       This macro states that the type node it is given requires
!      structural equality checks, e.g., it sets `TYPE_CANONICAL' to
!      `NULL_TREE'.
  
! `same_type_p'
       This predicate takes two types as input, and holds if they are the
!      same type.  For example, if one type is a `typedef' for the other,
!      or both are `typedef's for the same type.  This predicate also
       holds if the two trees given as input are simply copies of one
       another; i.e., there is no difference between them at the source
       level, but, for whatever reason, a duplicate has been made in the
!      representation.  You should never use `==' (pointer equality) to
!      compare types; always use `same_type_p' instead.
  
   Detailed below are the various kinds of types, and the macros that can
  be used to access them.  Although other kinds of types are used
  elsewhere in G++, the types described here are the only ones that you
  will encounter while examining the intermediate representation.
  
! `VOID_TYPE'
!      Used to represent the `void' type.
  
! `INTEGER_TYPE'
!      Used to represent the various integral types, including `char',
!      `short', `int', `long', and `long long'.  This code is not used
!      for enumeration types, nor for the `bool' type.  The
!      `TYPE_PRECISION' is the number of bits used in the representation,
!      represented as an `unsigned int'.  (Note that in the general case
!      this is not the same value as `TYPE_SIZE'; suppose that there were
!      a 24-bit integer type, but that alignment requirements for the ABI
!      required 32-bit alignment.  Then, `TYPE_SIZE' would be an
!      `INTEGER_CST' for 32, while `TYPE_PRECISION' would be 24.)  The
!      integer type is unsigned if `TYPE_UNSIGNED' holds; otherwise, it
!      is signed.
  
!      The `TYPE_MIN_VALUE' is an `INTEGER_CST' for the smallest integer
       that may be represented by this type.  Similarly, the
!      `TYPE_MAX_VALUE' is an `INTEGER_CST' for the largest integer that
       may be represented by this type.
  
! `REAL_TYPE'
!      Used to represent the `float', `double', and `long double' types.
!      The number of bits in the floating-point representation is given
!      by `TYPE_PRECISION', as in the `INTEGER_TYPE' case.
  
! `FIXED_POINT_TYPE'
!      Used to represent the `short _Fract', `_Fract', `long _Fract',
!      `long long _Fract', `short _Accum', `_Accum', `long _Accum', and
!      `long long _Accum' types.  The number of bits in the fixed-point
!      representation is given by `TYPE_PRECISION', as in the
!      `INTEGER_TYPE' case.  There may be padding bits, fractional bits
       and integral bits.  The number of fractional bits is given by
!      `TYPE_FBIT', and the number of integral bits is given by
!      `TYPE_IBIT'.  The fixed-point type is unsigned if `TYPE_UNSIGNED'
!      holds; otherwise, it is signed.  The fixed-point type is
!      saturating if `TYPE_SATURATING' holds; otherwise, it is not
!      saturating.
  
! `COMPLEX_TYPE'
!      Used to represent GCC built-in `__complex__' data types.  The
!      `TREE_TYPE' is the type of the real and imaginary parts.
  
! `ENUMERAL_TYPE'
!      Used to represent an enumeration type.  The `TYPE_PRECISION' gives
!      (as an `int'), the number of bits used to represent the type.  If
!      there are no negative enumeration constants, `TYPE_UNSIGNED' will
       hold.  The minimum and maximum enumeration constants may be
!      obtained with `TYPE_MIN_VALUE' and `TYPE_MAX_VALUE', respectively;
!      each of these macros returns an `INTEGER_CST'.
  
       The actual enumeration constants themselves may be obtained by
!      looking at the `TYPE_VALUES'.  This macro will return a
!      `TREE_LIST', containing the constants.  The `TREE_PURPOSE' of each
!      node will be an `IDENTIFIER_NODE' giving the name of the constant;
!      the `TREE_VALUE' will be an `INTEGER_CST' giving the value
!      assigned to that constant.  These constants will appear in the
!      order in which they were declared.  The `TREE_TYPE' of each of
!      these constants will be the type of enumeration type itself.
  
! `BOOLEAN_TYPE'
!      Used to represent the `bool' type.
  
! `POINTER_TYPE'
       Used to represent pointer types, and pointer to data member types.
!      The `TREE_TYPE' gives the type to which this type points.
  
! `REFERENCE_TYPE'
!      Used to represent reference types.  The `TREE_TYPE' gives the type
       to which this type refers.
  
! `FUNCTION_TYPE'
       Used to represent the type of non-member functions and of static
!      member functions.  The `TREE_TYPE' gives the return type of the
!      function.  The `TYPE_ARG_TYPES' are a `TREE_LIST' of the argument
!      types.  The `TREE_VALUE' of each node in this list is the type of
!      the corresponding argument; the `TREE_PURPOSE' is an expression
!      for the default argument value, if any.  If the last node in the
!      list is `void_list_node' (a `TREE_LIST' node whose `TREE_VALUE' is
!      the `void_type_node'), then functions of this type do not take
!      variable arguments.  Otherwise, they do take a variable number of
!      arguments.
  
!      Note that in C (but not in C++) a function declared like `void f()'
       is an unprototyped function taking a variable number of arguments;
!      the `TYPE_ARG_TYPES' of such a function will be `NULL'.
  
! `METHOD_TYPE'
       Used to represent the type of a non-static member function.  Like a
!      `FUNCTION_TYPE', the return type is given by the `TREE_TYPE'.  The
!      type of `*this', i.e., the class of which functions of this type
!      are a member, is given by the `TYPE_METHOD_BASETYPE'.  The
!      `TYPE_ARG_TYPES' is the parameter list, as for a `FUNCTION_TYPE',
!      and includes the `this' argument.
  
! `ARRAY_TYPE'
!      Used to represent array types.  The `TREE_TYPE' gives the type of
       the elements in the array.  If the array-bound is present in the
!      type, the `TYPE_DOMAIN' is an `INTEGER_TYPE' whose
!      `TYPE_MIN_VALUE' and `TYPE_MAX_VALUE' will be the lower and upper
!      bounds of the array, respectively.  The `TYPE_MIN_VALUE' will
!      always be an `INTEGER_CST' for zero, while the `TYPE_MAX_VALUE'
!      will be one less than the number of elements in the array, i.e.,
!      the highest value which may be used to index an element in the
!      array.
  
! `RECORD_TYPE'
!      Used to represent `struct' and `class' types, as well as pointers
       to member functions and similar constructs in other languages.
!      `TYPE_FIELDS' contains the items contained in this type, each of
!      which can be a `FIELD_DECL', `VAR_DECL', `CONST_DECL', or
!      `TYPE_DECL'.  You may not make any assumptions about the ordering
       of the fields in the type or whether one or more of them overlap.
  
! `UNION_TYPE'
!      Used to represent `union' types.  Similar to `RECORD_TYPE' except
!      that all `FIELD_DECL' nodes in `TYPE_FIELD' start at bit position
       zero.
  
! `QUAL_UNION_TYPE'
       Used to represent part of a variant record in Ada.  Similar to
!      `UNION_TYPE' except that each `FIELD_DECL' has a `DECL_QUALIFIER'
       field, which contains a boolean expression that indicates whether
       the field is present in the object.  The type will only have one
!      field, so each field's `DECL_QUALIFIER' is only evaluated if none
!      of the expressions in the previous fields in `TYPE_FIELDS' are
       nonzero.  Normally these expressions will reference a field in the
!      outer object using a `PLACEHOLDER_EXPR'.
  
! `LANG_TYPE'
       This node is used to represent a language-specific type.  The front
       end must handle it.
  
! `OFFSET_TYPE'
       This node is used to represent a pointer-to-data member.  For a
!      data member `X::m' the `TYPE_OFFSET_BASETYPE' is `X' and the
!      `TREE_TYPE' is the type of `m'.
! 
  
   There are variables whose values represent some of the basic types.
  These include:
! `void_type_node'
!      A node for `void'.
  
! `integer_type_node'
!      A node for `int'.
  
! `unsigned_type_node.'
!      A node for `unsigned int'.
  
! `char_type_node.'
!      A node for `char'.
!  It may sometimes be useful to compare one of these variables with a
! type in hand, using `same_type_p'.
  
  
  File: gccint.info,  Node: Declarations,  Next: Attributes,  Prev: Types,  Up: GENERIC
--- 7804,8048 ----
  are often multiple nodes corresponding to the same type.
  
   For the most part, different kinds of types have different tree codes.
! (For example, pointer types use a 'POINTER_TYPE' code while arrays use
! an 'ARRAY_TYPE' code.)  However, pointers to member functions use the
! 'RECORD_TYPE' code.  Therefore, when writing a 'switch' statement that
  depends on the code associated with a particular type, you should take
! care to handle pointers to member functions under the 'RECORD_TYPE' case
! label.
  
   The following functions and macros deal with cv-qualification of types:
! 'TYPE_MAIN_VARIANT'
       This macro returns the unqualified version of a type.  It may be
       applied to an unqualified type, but it is not always the identity
       function in that case.
  
   A few other macros and functions are usable with all types:
! 'TYPE_SIZE'
       The number of bits required to represent the type, represented as
!      an 'INTEGER_CST'.  For an incomplete type, 'TYPE_SIZE' will be
!      'NULL_TREE'.
  
! 'TYPE_ALIGN'
!      The alignment of the type, in bits, represented as an 'int'.
  
! 'TYPE_NAME'
!      This macro returns a declaration (in the form of a 'TYPE_DECL') for
!      the type.  (Note this macro does _not_ return an 'IDENTIFIER_NODE',
!      as you might expect, given its name!)  You can look at the
!      'DECL_NAME' of the 'TYPE_DECL' to obtain the actual name of the
!      type.  The 'TYPE_NAME' will be 'NULL_TREE' for a type that is not a
!      built-in type, the result of a typedef, or a named class type.
  
! 'TYPE_CANONICAL'
       This macro returns the "canonical" type for the given type node.
       Canonical types are used to improve performance in the C++ and
       Objective-C++ front ends by allowing efficient comparison between
!      two type nodes in 'same_type_p': if the 'TYPE_CANONICAL' values of
       the types are equal, the types are equivalent; otherwise, the types
!      are not equivalent.  The notion of equivalence for canonical types
       is the same as the notion of type equivalence in the language
!      itself.  For instance,
  
!      When 'TYPE_CANONICAL' is 'NULL_TREE', there is no canonical type
!      for the given type node.  In this case, comparison between this
       type and any other type requires the compiler to perform a deep,
       "structural" comparison to see if the two type nodes have the same
       form and properties.
  
       The canonical type for a node is always the most fundamental type
!      in the equivalence class of types.  For instance, 'int' is its own
!      canonical type.  A typedef 'I' of 'int' will have 'int' as its
!      canonical type.  Similarly, 'I*' and a typedef 'IP' (defined to
!      'I*') will has 'int*' as their canonical type.  When building a new
!      type node, be sure to set 'TYPE_CANONICAL' to the appropriate
!      canonical type.  If the new type is a compound type (built from
       other types), and any of those other types require structural
!      equality, use 'SET_TYPE_STRUCTURAL_EQUALITY' to ensure that the new
!      type also requires structural equality.  Finally, if for some
!      reason you cannot guarantee that 'TYPE_CANONICAL' will point to the
!      canonical type, use 'SET_TYPE_STRUCTURAL_EQUALITY' to make sure
!      that the new type-and any type constructed based on it-requires
!      structural equality.  If you suspect that the canonical type system
!      is miscomparing types, pass '--param verify-canonical-types=1' to
!      the compiler or configure with '--enable-checking' to force the
!      compiler to verify its canonical-type comparisons against the
!      structural comparisons; the compiler will then print any warnings
!      if the canonical types miscompare.
  
! 'TYPE_STRUCTURAL_EQUALITY_P'
       This predicate holds when the node requires structural equality
!      checks, e.g., when 'TYPE_CANONICAL' is 'NULL_TREE'.
  
! 'SET_TYPE_STRUCTURAL_EQUALITY'
       This macro states that the type node it is given requires
!      structural equality checks, e.g., it sets 'TYPE_CANONICAL' to
!      'NULL_TREE'.
  
! 'same_type_p'
       This predicate takes two types as input, and holds if they are the
!      same type.  For example, if one type is a 'typedef' for the other,
!      or both are 'typedef's for the same type.  This predicate also
       holds if the two trees given as input are simply copies of one
       another; i.e., there is no difference between them at the source
       level, but, for whatever reason, a duplicate has been made in the
!      representation.  You should never use '==' (pointer equality) to
!      compare types; always use 'same_type_p' instead.
  
   Detailed below are the various kinds of types, and the macros that can
  be used to access them.  Although other kinds of types are used
  elsewhere in G++, the types described here are the only ones that you
  will encounter while examining the intermediate representation.
  
! 'VOID_TYPE'
!      Used to represent the 'void' type.
  
! 'INTEGER_TYPE'
!      Used to represent the various integral types, including 'char',
!      'short', 'int', 'long', and 'long long'.  This code is not used for
!      enumeration types, nor for the 'bool' type.  The 'TYPE_PRECISION'
!      is the number of bits used in the representation, represented as an
!      'unsigned int'.  (Note that in the general case this is not the
!      same value as 'TYPE_SIZE'; suppose that there were a 24-bit integer
!      type, but that alignment requirements for the ABI required 32-bit
!      alignment.  Then, 'TYPE_SIZE' would be an 'INTEGER_CST' for 32,
!      while 'TYPE_PRECISION' would be 24.)  The integer type is unsigned
!      if 'TYPE_UNSIGNED' holds; otherwise, it is signed.
  
!      The 'TYPE_MIN_VALUE' is an 'INTEGER_CST' for the smallest integer
       that may be represented by this type.  Similarly, the
!      'TYPE_MAX_VALUE' is an 'INTEGER_CST' for the largest integer that
       may be represented by this type.
  
! 'REAL_TYPE'
!      Used to represent the 'float', 'double', and 'long double' types.
!      The number of bits in the floating-point representation is given by
!      'TYPE_PRECISION', as in the 'INTEGER_TYPE' case.
  
! 'FIXED_POINT_TYPE'
!      Used to represent the 'short _Fract', '_Fract', 'long _Fract',
!      'long long _Fract', 'short _Accum', '_Accum', 'long _Accum', and
!      'long long _Accum' types.  The number of bits in the fixed-point
!      representation is given by 'TYPE_PRECISION', as in the
!      'INTEGER_TYPE' case.  There may be padding bits, fractional bits
       and integral bits.  The number of fractional bits is given by
!      'TYPE_FBIT', and the number of integral bits is given by
!      'TYPE_IBIT'.  The fixed-point type is unsigned if 'TYPE_UNSIGNED'
!      holds; otherwise, it is signed.  The fixed-point type is saturating
!      if 'TYPE_SATURATING' holds; otherwise, it is not saturating.
  
! 'COMPLEX_TYPE'
!      Used to represent GCC built-in '__complex__' data types.  The
!      'TREE_TYPE' is the type of the real and imaginary parts.
  
! 'ENUMERAL_TYPE'
!      Used to represent an enumeration type.  The 'TYPE_PRECISION' gives
!      (as an 'int'), the number of bits used to represent the type.  If
!      there are no negative enumeration constants, 'TYPE_UNSIGNED' will
       hold.  The minimum and maximum enumeration constants may be
!      obtained with 'TYPE_MIN_VALUE' and 'TYPE_MAX_VALUE', respectively;
!      each of these macros returns an 'INTEGER_CST'.
  
       The actual enumeration constants themselves may be obtained by
!      looking at the 'TYPE_VALUES'.  This macro will return a
!      'TREE_LIST', containing the constants.  The 'TREE_PURPOSE' of each
!      node will be an 'IDENTIFIER_NODE' giving the name of the constant;
!      the 'TREE_VALUE' will be an 'INTEGER_CST' giving the value assigned
!      to that constant.  These constants will appear in the order in
!      which they were declared.  The 'TREE_TYPE' of each of these
!      constants will be the type of enumeration type itself.
  
! 'BOOLEAN_TYPE'
!      Used to represent the 'bool' type.
  
! 'POINTER_TYPE'
       Used to represent pointer types, and pointer to data member types.
!      The 'TREE_TYPE' gives the type to which this type points.
  
! 'REFERENCE_TYPE'
!      Used to represent reference types.  The 'TREE_TYPE' gives the type
       to which this type refers.
  
! 'FUNCTION_TYPE'
       Used to represent the type of non-member functions and of static
!      member functions.  The 'TREE_TYPE' gives the return type of the
!      function.  The 'TYPE_ARG_TYPES' are a 'TREE_LIST' of the argument
!      types.  The 'TREE_VALUE' of each node in this list is the type of
!      the corresponding argument; the 'TREE_PURPOSE' is an expression for
!      the default argument value, if any.  If the last node in the list
!      is 'void_list_node' (a 'TREE_LIST' node whose 'TREE_VALUE' is the
!      'void_type_node'), then functions of this type do not take variable
!      arguments.  Otherwise, they do take a variable number of arguments.
  
!      Note that in C (but not in C++) a function declared like 'void f()'
       is an unprototyped function taking a variable number of arguments;
!      the 'TYPE_ARG_TYPES' of such a function will be 'NULL'.
  
! 'METHOD_TYPE'
       Used to represent the type of a non-static member function.  Like a
!      'FUNCTION_TYPE', the return type is given by the 'TREE_TYPE'.  The
!      type of '*this', i.e., the class of which functions of this type
!      are a member, is given by the 'TYPE_METHOD_BASETYPE'.  The
!      'TYPE_ARG_TYPES' is the parameter list, as for a 'FUNCTION_TYPE',
!      and includes the 'this' argument.
  
! 'ARRAY_TYPE'
!      Used to represent array types.  The 'TREE_TYPE' gives the type of
       the elements in the array.  If the array-bound is present in the
!      type, the 'TYPE_DOMAIN' is an 'INTEGER_TYPE' whose 'TYPE_MIN_VALUE'
!      and 'TYPE_MAX_VALUE' will be the lower and upper bounds of the
!      array, respectively.  The 'TYPE_MIN_VALUE' will always be an
!      'INTEGER_CST' for zero, while the 'TYPE_MAX_VALUE' will be one less
!      than the number of elements in the array, i.e., the highest value
!      which may be used to index an element in the array.
  
! 'RECORD_TYPE'
!      Used to represent 'struct' and 'class' types, as well as pointers
       to member functions and similar constructs in other languages.
!      'TYPE_FIELDS' contains the items contained in this type, each of
!      which can be a 'FIELD_DECL', 'VAR_DECL', 'CONST_DECL', or
!      'TYPE_DECL'.  You may not make any assumptions about the ordering
       of the fields in the type or whether one or more of them overlap.
  
! 'UNION_TYPE'
!      Used to represent 'union' types.  Similar to 'RECORD_TYPE' except
!      that all 'FIELD_DECL' nodes in 'TYPE_FIELD' start at bit position
       zero.
  
! 'QUAL_UNION_TYPE'
       Used to represent part of a variant record in Ada.  Similar to
!      'UNION_TYPE' except that each 'FIELD_DECL' has a 'DECL_QUALIFIER'
       field, which contains a boolean expression that indicates whether
       the field is present in the object.  The type will only have one
!      field, so each field's 'DECL_QUALIFIER' is only evaluated if none
!      of the expressions in the previous fields in 'TYPE_FIELDS' are
       nonzero.  Normally these expressions will reference a field in the
!      outer object using a 'PLACEHOLDER_EXPR'.
  
! 'LANG_TYPE'
       This node is used to represent a language-specific type.  The front
       end must handle it.
  
! 'OFFSET_TYPE'
       This node is used to represent a pointer-to-data member.  For a
!      data member 'X::m' the 'TYPE_OFFSET_BASETYPE' is 'X' and the
!      'TREE_TYPE' is the type of 'm'.
  
   There are variables whose values represent some of the basic types.
  These include:
! 'void_type_node'
!      A node for 'void'.
  
! 'integer_type_node'
!      A node for 'int'.
  
! 'unsigned_type_node.'
!      A node for 'unsigned int'.
  
! 'char_type_node.'
!      A node for 'char'.
! It may sometimes be useful to compare one of these variables with a type
! in hand, using 'same_type_p'.
  
  
  File: gccint.info,  Node: Declarations,  Next: Attributes,  Prev: Types,  Up: GENERIC
*************** File: gccint.info,  Node: Declarations,
*** 8205,8211 ****
  
  This section covers the various kinds of declarations that appear in the
  internal representation, except for declarations of functions
! (represented by `FUNCTION_DECL' nodes), which are described in *note
  Functions::.
  
  * Menu:
--- 8052,8058 ----
  
  This section covers the various kinds of declarations that appear in the
  internal representation, except for declarations of functions
! (represented by 'FUNCTION_DECL' nodes), which are described in *note
  Functions::.
  
  * Menu:
*************** File: gccint.info,  Node: Working with d
*** 8221,8345 ****
  --------------------------------
  
  Some macros can be used with any kind of declaration.  These include:
! `DECL_NAME'
!      This macro returns an `IDENTIFIER_NODE' giving the name of the
       entity.
  
! `TREE_TYPE'
       This macro returns the type of the entity declared.
  
! `EXPR_FILENAME'
       This macro returns the name of the file in which the entity was
!      declared, as a `char*'.  For an entity declared implicitly by the
!      compiler (like `__builtin_memcpy'), this will be the string
!      `"<internal>"'.
  
! `EXPR_LINENO'
       This macro returns the line number at which the entity was
!      declared, as an `int'.
  
! `DECL_ARTIFICIAL'
!      This predicate holds if the declaration was implicitly generated
!      by the compiler.  For example, this predicate will hold of an
!      implicitly declared member function, or of the `TYPE_DECL'
       implicitly generated for a class type.  Recall that in C++ code
       like:
            struct S {};
       is roughly equivalent to C code like:
            struct S {};
            typedef struct S S;
!      The implicitly generated `typedef' declaration is represented by a
!      `TYPE_DECL' for which `DECL_ARTIFICIAL' holds.
! 
  
   The various kinds of declarations include:
! `LABEL_DECL'
       These nodes are used to represent labels in function bodies.  For
       more information, see *note Functions::.  These nodes only appear
       in block scopes.
  
! `CONST_DECL'
!      These nodes are used to represent enumeration constants.  The
!      value of the constant is given by `DECL_INITIAL' which will be an
!      `INTEGER_CST' with the same type as the `TREE_TYPE' of the
!      `CONST_DECL', i.e., an `ENUMERAL_TYPE'.
  
! `RESULT_DECL'
       These nodes represent the value returned by a function.  When a
!      value is assigned to a `RESULT_DECL', that indicates that the
!      value should be returned, via bitwise copy, by the function.  You
!      can use `DECL_SIZE' and `DECL_ALIGN' on a `RESULT_DECL', just as
!      with a `VAR_DECL'.
  
! `TYPE_DECL'
!      These nodes represent `typedef' declarations.  The `TREE_TYPE' is
!      the type declared to have the name given by `DECL_NAME'.  In some
       cases, there is no associated name.
  
! `VAR_DECL'
       These nodes represent variables with namespace or block scope, as
!      well as static data members.  The `DECL_SIZE' and `DECL_ALIGN' are
!      analogous to `TYPE_SIZE' and `TYPE_ALIGN'.  For a declaration, you
!      should always use the `DECL_SIZE' and `DECL_ALIGN' rather than the
!      `TYPE_SIZE' and `TYPE_ALIGN' given by the `TREE_TYPE', since
!      special attributes may have been applied to the variable to give
!      it a particular size and alignment.  You may use the predicates
!      `DECL_THIS_STATIC' or `DECL_THIS_EXTERN' to test whether the
!      storage class specifiers `static' or `extern' were used to declare
       a variable.
  
       If this variable is initialized (but does not require a
!      constructor), the `DECL_INITIAL' will be an expression for the
       initializer.  The initializer should be evaluated, and a bitwise
!      copy into the variable performed.  If the `DECL_INITIAL' is the
!      `error_mark_node', there is an initializer, but it is given by an
       explicit statement later in the code; no bitwise copy is required.
  
       GCC provides an extension that allows either automatic variables,
       or global variables, to be placed in particular registers.  This
!      extension is being used for a particular `VAR_DECL' if
!      `DECL_REGISTER' holds for the `VAR_DECL', and if
!      `DECL_ASSEMBLER_NAME' is not equal to `DECL_NAME'.  In that case,
!      `DECL_ASSEMBLER_NAME' is the name of the register into which the
       variable will be placed.
  
! `PARM_DECL'
       Used to represent a parameter to a function.  Treat these nodes
!      similarly to `VAR_DECL' nodes.  These nodes only appear in the
!      `DECL_ARGUMENTS' for a `FUNCTION_DECL'.
  
!      The `DECL_ARG_TYPE' for a `PARM_DECL' is the type that will
       actually be used when a value is passed to this function.  It may
!      be a wider type than the `TREE_TYPE' of the parameter; for
!      example, the ordinary type might be `short' while the
!      `DECL_ARG_TYPE' is `int'.
  
! `DEBUG_EXPR_DECL'
       Used to represent an anonymous debug-information temporary created
       to hold an expression as it is optimized away, so that its value
       can be referenced in debug bind statements.
  
! `FIELD_DECL'
!      These nodes represent non-static data members.  The `DECL_SIZE' and
!      `DECL_ALIGN' behave as for `VAR_DECL' nodes.  The position of the
       field within the parent record is specified by a combination of
!      three attributes.  `DECL_FIELD_OFFSET' is the position, counting
!      in bytes, of the `DECL_OFFSET_ALIGN'-bit sized word containing the
!      bit of the field closest to the beginning of the structure.
!      `DECL_FIELD_BIT_OFFSET' is the bit offset of the first bit of the
       field within this word; this may be nonzero even for fields that
!      are not bit-fields, since `DECL_OFFSET_ALIGN' may be greater than
       the natural alignment of the field's type.
  
!      If `DECL_C_BIT_FIELD' holds, this field is a bit-field.  In a
!      bit-field, `DECL_BIT_FIELD_TYPE' also contains the type that was
!      originally specified for it, while DECL_TYPE may be a modified
!      type with lesser precision, according to the size of the bit field.
  
! `NAMESPACE_DECL'
       Namespaces provide a name hierarchy for other declarations.  They
!      appear in the `DECL_CONTEXT' of other `_DECL' nodes.
! 
  
  
  File: gccint.info,  Node: Internal structure,  Prev: Working with declarations,  Up: Declarations
--- 8068,8190 ----
  --------------------------------
  
  Some macros can be used with any kind of declaration.  These include:
! 'DECL_NAME'
!      This macro returns an 'IDENTIFIER_NODE' giving the name of the
       entity.
  
! 'TREE_TYPE'
       This macro returns the type of the entity declared.
  
! 'EXPR_FILENAME'
       This macro returns the name of the file in which the entity was
!      declared, as a 'char*'.  For an entity declared implicitly by the
!      compiler (like '__builtin_memcpy'), this will be the string
!      '"<internal>"'.
  
! 'EXPR_LINENO'
       This macro returns the line number at which the entity was
!      declared, as an 'int'.
  
! 'DECL_ARTIFICIAL'
!      This predicate holds if the declaration was implicitly generated by
!      the compiler.  For example, this predicate will hold of an
!      implicitly declared member function, or of the 'TYPE_DECL'
       implicitly generated for a class type.  Recall that in C++ code
       like:
            struct S {};
       is roughly equivalent to C code like:
            struct S {};
            typedef struct S S;
!      The implicitly generated 'typedef' declaration is represented by a
!      'TYPE_DECL' for which 'DECL_ARTIFICIAL' holds.
  
   The various kinds of declarations include:
! 'LABEL_DECL'
       These nodes are used to represent labels in function bodies.  For
       more information, see *note Functions::.  These nodes only appear
       in block scopes.
  
! 'CONST_DECL'
!      These nodes are used to represent enumeration constants.  The value
!      of the constant is given by 'DECL_INITIAL' which will be an
!      'INTEGER_CST' with the same type as the 'TREE_TYPE' of the
!      'CONST_DECL', i.e., an 'ENUMERAL_TYPE'.
  
! 'RESULT_DECL'
       These nodes represent the value returned by a function.  When a
!      value is assigned to a 'RESULT_DECL', that indicates that the value
!      should be returned, via bitwise copy, by the function.  You can use
!      'DECL_SIZE' and 'DECL_ALIGN' on a 'RESULT_DECL', just as with a
!      'VAR_DECL'.
  
! 'TYPE_DECL'
!      These nodes represent 'typedef' declarations.  The 'TREE_TYPE' is
!      the type declared to have the name given by 'DECL_NAME'.  In some
       cases, there is no associated name.
  
! 'VAR_DECL'
       These nodes represent variables with namespace or block scope, as
!      well as static data members.  The 'DECL_SIZE' and 'DECL_ALIGN' are
!      analogous to 'TYPE_SIZE' and 'TYPE_ALIGN'.  For a declaration, you
!      should always use the 'DECL_SIZE' and 'DECL_ALIGN' rather than the
!      'TYPE_SIZE' and 'TYPE_ALIGN' given by the 'TREE_TYPE', since
!      special attributes may have been applied to the variable to give it
!      a particular size and alignment.  You may use the predicates
!      'DECL_THIS_STATIC' or 'DECL_THIS_EXTERN' to test whether the
!      storage class specifiers 'static' or 'extern' were used to declare
       a variable.
  
       If this variable is initialized (but does not require a
!      constructor), the 'DECL_INITIAL' will be an expression for the
       initializer.  The initializer should be evaluated, and a bitwise
!      copy into the variable performed.  If the 'DECL_INITIAL' is the
!      'error_mark_node', there is an initializer, but it is given by an
       explicit statement later in the code; no bitwise copy is required.
  
       GCC provides an extension that allows either automatic variables,
       or global variables, to be placed in particular registers.  This
!      extension is being used for a particular 'VAR_DECL' if
!      'DECL_REGISTER' holds for the 'VAR_DECL', and if
!      'DECL_ASSEMBLER_NAME' is not equal to 'DECL_NAME'.  In that case,
!      'DECL_ASSEMBLER_NAME' is the name of the register into which the
       variable will be placed.
  
! 'PARM_DECL'
       Used to represent a parameter to a function.  Treat these nodes
!      similarly to 'VAR_DECL' nodes.  These nodes only appear in the
!      'DECL_ARGUMENTS' for a 'FUNCTION_DECL'.
  
!      The 'DECL_ARG_TYPE' for a 'PARM_DECL' is the type that will
       actually be used when a value is passed to this function.  It may
!      be a wider type than the 'TREE_TYPE' of the parameter; for example,
!      the ordinary type might be 'short' while the 'DECL_ARG_TYPE' is
!      'int'.
  
! 'DEBUG_EXPR_DECL'
       Used to represent an anonymous debug-information temporary created
       to hold an expression as it is optimized away, so that its value
       can be referenced in debug bind statements.
  
! 'FIELD_DECL'
!      These nodes represent non-static data members.  The 'DECL_SIZE' and
!      'DECL_ALIGN' behave as for 'VAR_DECL' nodes.  The position of the
       field within the parent record is specified by a combination of
!      three attributes.  'DECL_FIELD_OFFSET' is the position, counting in
!      bytes, of the 'DECL_OFFSET_ALIGN'-bit sized word containing the bit
!      of the field closest to the beginning of the structure.
!      'DECL_FIELD_BIT_OFFSET' is the bit offset of the first bit of the
       field within this word; this may be nonzero even for fields that
!      are not bit-fields, since 'DECL_OFFSET_ALIGN' may be greater than
       the natural alignment of the field's type.
  
!      If 'DECL_C_BIT_FIELD' holds, this field is a bit-field.  In a
!      bit-field, 'DECL_BIT_FIELD_TYPE' also contains the type that was
!      originally specified for it, while DECL_TYPE may be a modified type
!      with lesser precision, according to the size of the bit field.
  
! 'NAMESPACE_DECL'
       Namespaces provide a name hierarchy for other declarations.  They
!      appear in the 'DECL_CONTEXT' of other '_DECL' nodes.
  
  
  File: gccint.info,  Node: Internal structure,  Prev: Working with declarations,  Up: Declarations
*************** File: gccint.info,  Node: Internal struc
*** 8347,8353 ****
  10.4.2 Internal structure
  -------------------------
  
! `DECL' nodes are represented internally as a hierarchy of structures.
  
  * Menu:
  
--- 8192,8198 ----
  10.4.2 Internal structure
  -------------------------
  
! 'DECL' nodes are represented internally as a hierarchy of structures.
  
  * Menu:
  
*************** File: gccint.info,  Node: Current struct
*** 8362,8419 ****
  10.4.2.1 Current structure hierarchy
  ....................................
  
! `struct tree_decl_minimal'
       This is the minimal structure to inherit from in order for common
!      `DECL' macros to work.  The fields it contains are a unique ID,
       source location, context, and name.
  
! `struct tree_decl_common'
!      This structure inherits from `struct tree_decl_minimal'.  It
!      contains fields that most `DECL' nodes need, such as a field to
       store alignment, machine mode, size, and attributes.
  
! `struct tree_field_decl'
!      This structure inherits from `struct tree_decl_common'.  It is
!      used to represent `FIELD_DECL'.
  
! `struct tree_label_decl'
!      This structure inherits from `struct tree_decl_common'.  It is
!      used to represent `LABEL_DECL'.
  
! `struct tree_translation_unit_decl'
!      This structure inherits from `struct tree_decl_common'.  It is
!      used to represent `TRANSLATION_UNIT_DECL'.
  
! `struct tree_decl_with_rtl'
!      This structure inherits from `struct tree_decl_common'.  It
       contains a field to store the low-level RTL associated with a
!      `DECL' node.
  
! `struct tree_result_decl'
!      This structure inherits from `struct tree_decl_with_rtl'.  It is
!      used to represent `RESULT_DECL'.
  
! `struct tree_const_decl'
!      This structure inherits from `struct tree_decl_with_rtl'.  It is
!      used to represent `CONST_DECL'.
  
! `struct tree_parm_decl'
!      This structure inherits from `struct tree_decl_with_rtl'.  It is
!      used to represent `PARM_DECL'.
  
! `struct tree_decl_with_vis'
!      This structure inherits from `struct tree_decl_with_rtl'.  It
       contains fields necessary to store visibility information, as well
       as a section name and assembler name.
  
! `struct tree_var_decl'
!      This structure inherits from `struct tree_decl_with_vis'.  It is
!      used to represent `VAR_DECL'.
! 
! `struct tree_function_decl'
!      This structure inherits from `struct tree_decl_with_vis'.  It is
!      used to represent `FUNCTION_DECL'.
  
  
  
  File: gccint.info,  Node: Adding new DECL node types,  Prev: Current structure hierarchy,  Up: Internal structure
--- 8207,8263 ----
  10.4.2.1 Current structure hierarchy
  ....................................
  
! 'struct tree_decl_minimal'
       This is the minimal structure to inherit from in order for common
!      'DECL' macros to work.  The fields it contains are a unique ID,
       source location, context, and name.
  
! 'struct tree_decl_common'
!      This structure inherits from 'struct tree_decl_minimal'.  It
!      contains fields that most 'DECL' nodes need, such as a field to
       store alignment, machine mode, size, and attributes.
  
! 'struct tree_field_decl'
!      This structure inherits from 'struct tree_decl_common'.  It is used
!      to represent 'FIELD_DECL'.
  
! 'struct tree_label_decl'
!      This structure inherits from 'struct tree_decl_common'.  It is used
!      to represent 'LABEL_DECL'.
  
! 'struct tree_translation_unit_decl'
!      This structure inherits from 'struct tree_decl_common'.  It is used
!      to represent 'TRANSLATION_UNIT_DECL'.
  
! 'struct tree_decl_with_rtl'
!      This structure inherits from 'struct tree_decl_common'.  It
       contains a field to store the low-level RTL associated with a
!      'DECL' node.
  
! 'struct tree_result_decl'
!      This structure inherits from 'struct tree_decl_with_rtl'.  It is
!      used to represent 'RESULT_DECL'.
  
! 'struct tree_const_decl'
!      This structure inherits from 'struct tree_decl_with_rtl'.  It is
!      used to represent 'CONST_DECL'.
  
! 'struct tree_parm_decl'
!      This structure inherits from 'struct tree_decl_with_rtl'.  It is
!      used to represent 'PARM_DECL'.
  
! 'struct tree_decl_with_vis'
!      This structure inherits from 'struct tree_decl_with_rtl'.  It
       contains fields necessary to store visibility information, as well
       as a section name and assembler name.
  
! 'struct tree_var_decl'
!      This structure inherits from 'struct tree_decl_with_vis'.  It is
!      used to represent 'VAR_DECL'.
  
+ 'struct tree_function_decl'
+      This structure inherits from 'struct tree_decl_with_vis'.  It is
+      used to represent 'FUNCTION_DECL'.
  
  
  File: gccint.info,  Node: Adding new DECL node types,  Prev: Current structure hierarchy,  Up: Internal structure
*************** File: gccint.info,  Node: Adding new DEC
*** 8421,8496 ****
  10.4.2.2 Adding new DECL node types
  ...................................
  
! Adding a new `DECL' tree consists of the following steps
  
! Add a new tree code for the `DECL' node
!      For language specific `DECL' nodes, there is a `.def' file in each
!      frontend directory where the tree code should be added.  For
!      `DECL' nodes that are part of the middle-end, the code should be
!      added to `tree.def'.
  
! Create a new structure type for the `DECL' node
!      These structures should inherit from one of the existing
!      structures in the language hierarchy by using that structure as
!      the first member.
  
            struct tree_foo_decl
            {
               struct tree_decl_with_vis common;
            }
  
!      Would create a structure name `tree_foo_decl' that inherits from
!      `struct tree_decl_with_vis'.
  
!      For language specific `DECL' nodes, this new structure type should
!      go in the appropriate `.h' file.  For `DECL' nodes that are part
!      of the middle-end, the structure type should go in `tree.h'.
  
  Add a member to the tree structure enumerator for the node
!      For garbage collection and dynamic checking purposes, each `DECL'
       node structure type is required to have a unique enumerator value
!      specified with it.  For language specific `DECL' nodes, this new
!      enumerator value should go in the appropriate `.def' file.  For
!      `DECL' nodes that are part of the middle-end, the enumerator
!      values are specified in `treestruct.def'.
  
! Update `union tree_node'
       In order to make your new structure type usable, it must be added
!      to `union tree_node'.  For language specific `DECL' nodes, a new
!      entry should be added to the appropriate `.h' file of the form
              struct tree_foo_decl GTY ((tag ("TS_VAR_DECL"))) foo_decl;
!      For `DECL' nodes that are part of the middle-end, the additional
!      member goes directly into `union tree_node' in `tree.h'.
  
  Update dynamic checking info
       In order to be able to check whether accessing a named portion of
!      `union tree_node' is legal, and whether a certain `DECL' node
!      contains one of the enumerated `DECL' node structures in the
       hierarchy, a simple lookup table is used.  This lookup table needs
       to be kept up to date with the tree structure hierarchy, or else
       checking and containment macros will fail inappropriately.
  
!      For language specific `DECL' nodes, their is an `init_ts' function
!      in an appropriate `.c' file, which initializes the lookup table.
!      Code setting up the table for new `DECL' nodes should be added
!      there.  For each `DECL' tree code and enumerator value
!      representing a member of the inheritance  hierarchy, the table
!      should contain 1 if that tree code inherits (directly or
!      indirectly) from that member.  Thus, a `FOO_DECL' node derived
!      from `struct decl_with_rtl', and enumerator value `TS_FOO_DECL',
!      would be set up as follows
            tree_contains_struct[FOO_DECL][TS_FOO_DECL] = 1;
            tree_contains_struct[FOO_DECL][TS_DECL_WRTL] = 1;
            tree_contains_struct[FOO_DECL][TS_DECL_COMMON] = 1;
            tree_contains_struct[FOO_DECL][TS_DECL_MINIMAL] = 1;
  
!      For `DECL' nodes that are part of the middle-end, the setup code
!      goes into `tree.c'.
  
  Add macros to access any new fields and flags
       Each added field or flag should have a macro that is used to access
       it, that performs appropriate checking to ensure only the right
!      type of `DECL' nodes access the field.
  
       These macros generally take the following form
            #define FOO_DECL_FIELDNAME(NODE) FOO_DECL_CHECK(NODE)->foo_decl.fieldname
--- 8265,8341 ----
  10.4.2.2 Adding new DECL node types
  ...................................
  
! Adding a new 'DECL' tree consists of the following steps
  
! Add a new tree code for the 'DECL' node
!      For language specific 'DECL' nodes, there is a '.def' file in each
!      frontend directory where the tree code should be added.  For 'DECL'
!      nodes that are part of the middle-end, the code should be added to
!      'tree.def'.
  
! Create a new structure type for the 'DECL' node
!      These structures should inherit from one of the existing structures
!      in the language hierarchy by using that structure as the first
!      member.
  
            struct tree_foo_decl
            {
               struct tree_decl_with_vis common;
            }
  
!      Would create a structure name 'tree_foo_decl' that inherits from
!      'struct tree_decl_with_vis'.
  
!      For language specific 'DECL' nodes, this new structure type should
!      go in the appropriate '.h' file.  For 'DECL' nodes that are part of
!      the middle-end, the structure type should go in 'tree.h'.
  
  Add a member to the tree structure enumerator for the node
!      For garbage collection and dynamic checking purposes, each 'DECL'
       node structure type is required to have a unique enumerator value
!      specified with it.  For language specific 'DECL' nodes, this new
!      enumerator value should go in the appropriate '.def' file.  For
!      'DECL' nodes that are part of the middle-end, the enumerator values
!      are specified in 'treestruct.def'.
  
! Update 'union tree_node'
       In order to make your new structure type usable, it must be added
!      to 'union tree_node'.  For language specific 'DECL' nodes, a new
!      entry should be added to the appropriate '.h' file of the form
              struct tree_foo_decl GTY ((tag ("TS_VAR_DECL"))) foo_decl;
!      For 'DECL' nodes that are part of the middle-end, the additional
!      member goes directly into 'union tree_node' in 'tree.h'.
  
  Update dynamic checking info
       In order to be able to check whether accessing a named portion of
!      'union tree_node' is legal, and whether a certain 'DECL' node
!      contains one of the enumerated 'DECL' node structures in the
       hierarchy, a simple lookup table is used.  This lookup table needs
       to be kept up to date with the tree structure hierarchy, or else
       checking and containment macros will fail inappropriately.
  
!      For language specific 'DECL' nodes, their is an 'init_ts' function
!      in an appropriate '.c' file, which initializes the lookup table.
!      Code setting up the table for new 'DECL' nodes should be added
!      there.  For each 'DECL' tree code and enumerator value representing
!      a member of the inheritance hierarchy, the table should contain 1
!      if that tree code inherits (directly or indirectly) from that
!      member.  Thus, a 'FOO_DECL' node derived from 'struct
!      decl_with_rtl', and enumerator value 'TS_FOO_DECL', would be set up
!      as follows
            tree_contains_struct[FOO_DECL][TS_FOO_DECL] = 1;
            tree_contains_struct[FOO_DECL][TS_DECL_WRTL] = 1;
            tree_contains_struct[FOO_DECL][TS_DECL_COMMON] = 1;
            tree_contains_struct[FOO_DECL][TS_DECL_MINIMAL] = 1;
  
!      For 'DECL' nodes that are part of the middle-end, the setup code
!      goes into 'tree.c'.
  
  Add macros to access any new fields and flags
+ 
       Each added field or flag should have a macro that is used to access
       it, that performs appropriate checking to ensure only the right
!      type of 'DECL' nodes access the field.
  
       These macros generally take the following form
            #define FOO_DECL_FIELDNAME(NODE) FOO_DECL_CHECK(NODE)->foo_decl.fieldname
*************** Add macros to access any new fields and
*** 8500,8509 ****
            #define BASE_STRUCT_FIELDNAME(NODE) \
               (BASE_STRUCT_CHECK(NODE)->base_struct.fieldname
  
!      Reading them from the generated `all-tree.def' file (which in turn
!      includes all the `tree.def' files), `gencheck.c' is used during
!      GCC's build to generate the `*_CHECK' macros for all tree codes.
! 
  
  
  File: gccint.info,  Node: Attributes,  Next: Expression trees,  Prev: Declarations,  Up: GENERIC
--- 8345,8353 ----
            #define BASE_STRUCT_FIELDNAME(NODE) \
               (BASE_STRUCT_CHECK(NODE)->base_struct.fieldname
  
!      Reading them from the generated 'all-tree.def' file (which in turn
!      includes all the 'tree.def' files), 'gencheck.c' is used during
!      GCC's build to generate the '*_CHECK' macros for all tree codes.
  
  
  File: gccint.info,  Node: Attributes,  Next: Expression trees,  Prev: Declarations,  Up: GENERIC
*************** File: gccint.info,  Node: Attributes,  N
*** 8511,8525 ****
  10.5 Attributes in trees
  ========================
  
! Attributes, as specified using the `__attribute__' keyword, are
! represented internally as a `TREE_LIST'.  The `TREE_PURPOSE' is the
! name of the attribute, as an `IDENTIFIER_NODE'.  The `TREE_VALUE' is a
! `TREE_LIST' of the arguments of the attribute, if any, or `NULL_TREE'
! if there are no arguments; the arguments are stored as the `TREE_VALUE'
! of successive entries in the list, and may be identifiers or
! expressions.  The `TREE_CHAIN' of the attribute is the next attribute
! in a list of attributes applying to the same declaration or type, or
! `NULL_TREE' if there are no further attributes in the list.
  
   Attributes may be attached to declarations and to types; these
  attributes may be accessed with the following macros.  All attributes
--- 8355,8369 ----
  10.5 Attributes in trees
  ========================
  
! Attributes, as specified using the '__attribute__' keyword, are
! represented internally as a 'TREE_LIST'.  The 'TREE_PURPOSE' is the name
! of the attribute, as an 'IDENTIFIER_NODE'.  The 'TREE_VALUE' is a
! 'TREE_LIST' of the arguments of the attribute, if any, or 'NULL_TREE' if
! there are no arguments; the arguments are stored as the 'TREE_VALUE' of
! successive entries in the list, and may be identifiers or expressions.
! The 'TREE_CHAIN' of the attribute is the next attribute in a list of
! attributes applying to the same declaration or type, or 'NULL_TREE' if
! there are no further attributes in the list.
  
   Attributes may be attached to declarations and to types; these
  attributes may be accessed with the following macros.  All attributes
*************** mind.  In particular, the expression "tr
*** 8544,8561 ****
  acyclic graph.  (For example there may be many references to the integer
  constant zero throughout the source program; many of these will be
  represented by the same expression node.)  You should not rely on
! certain kinds of node being shared, nor should you rely on certain
! kinds of nodes being unshared.
  
   The following macros can be used with all expression nodes:
  
! `TREE_TYPE'
       Returns the type of the expression.  This value may not be
       precisely the same type that would be given the expression in the
       original program.
  
   In what follows, some nodes that one might expect to always have type
! `bool' are documented to have either integral or boolean type.  At some
  point in the future, the C front end may also make use of this same
  intermediate representation, and at this point these nodes will
  certainly have integral type.  The previous sentence is not meant to
--- 8388,8405 ----
  acyclic graph.  (For example there may be many references to the integer
  constant zero throughout the source program; many of these will be
  represented by the same expression node.)  You should not rely on
! certain kinds of node being shared, nor should you rely on certain kinds
! of nodes being unshared.
  
   The following macros can be used with all expression nodes:
  
! 'TREE_TYPE'
       Returns the type of the expression.  This value may not be
       precisely the same type that would be given the expression in the
       original program.
  
   In what follows, some nodes that one might expect to always have type
! 'bool' are documented to have either integral or boolean type.  At some
  point in the future, the C front end may also make use of this same
  intermediate representation, and at this point these nodes will
  certainly have integral type.  The previous sentence is not meant to
*************** integral type.
*** 8564,8573 ****
  
   Below, we list the various kinds of expression nodes.  Except where
  noted otherwise, the operands to an expression are accessed using the
! `TREE_OPERAND' macro.  For example, to access the first operand to a
! binary plus expression `expr', use:
  
       TREE_OPERAND (expr, 0)
   As this example indicates, the operands are zero-indexed.
  
  * Menu:
--- 8408,8418 ----
  
   Below, we list the various kinds of expression nodes.  Except where
  noted otherwise, the operands to an expression are accessed using the
! 'TREE_OPERAND' macro.  For example, to access the first operand to a
! binary plus expression 'expr', use:
  
       TREE_OPERAND (expr, 0)
+ 
   As this example indicates, the operands are zero-indexed.
  
  * Menu:
*************** The table below begins with constants, m
*** 8587,8662 ****
  then proceeds to binary expressions, and concludes with various other
  kinds of expressions:
  
! `INTEGER_CST'
       These nodes represent integer constants.  Note that the type of
!      these constants is obtained with `TREE_TYPE'; they are not always
!      of type `int'.  In particular, `char' constants are represented
!      with `INTEGER_CST' nodes.  The value of the integer constant `e' is
!      represented in an array of HOST_WIDE_INT.   There are enough
!      elements in the array to represent the value without taking extra
!      elements for redundant 0s or -1.  The number of elements used to
!      represent `e' is available via `TREE_INT_CST_NUNITS'. Element `i'
!      can be extracted by using `TREE_INT_CST_ELT (e, i)'.
!      `TREE_INT_CST_LOW' is a shorthand for `TREE_INT_CST_ELT (e, 0)'.
  
!      The functions `tree_fits_shwi_p' and `tree_fits_uhwi_p' can be
!      used to tell if the value is small enough to fit in a signed
!      HOST_WIDE_INT or an unsigned HOST_WIDE_INT respectively.  The
!      value can then be extracted using `tree_to_shwi' and
!      `tree_to_uhwi'.
  
- `REAL_CST'
       FIXME: Talk about how to obtain representations of this constant,
       do comparisons, and so forth.
  
! `FIXED_CST'
       These nodes represent fixed-point constants.  The type of these
!      constants is obtained with `TREE_TYPE'.  `TREE_FIXED_CST_PTR'
!      points to a `struct fixed_value';  `TREE_FIXED_CST' returns the
!      structure itself.  `struct fixed_value' contains `data' with the
!      size of two `HOST_BITS_PER_WIDE_INT' and `mode' as the associated
!      fixed-point machine mode for `data'.
  
! `COMPLEX_CST'
!      These nodes are used to represent complex number constants, that
!      is a `__complex__' whose parts are constant nodes.  The
!      `TREE_REALPART' and `TREE_IMAGPART' return the real and the
       imaginary parts respectively.
  
! `VECTOR_CST'
       These nodes are used to represent vector constants, whose parts are
!      constant nodes.  Each individual constant node is either an
!      integer or a double constant node.  The first operand is a
!      `TREE_LIST' of the constant nodes and is accessed through
!      `TREE_VECTOR_CST_ELTS'.
  
! `STRING_CST'
!      These nodes represent string-constants.  The `TREE_STRING_LENGTH'
!      returns the length of the string, as an `int'.  The
!      `TREE_STRING_POINTER' is a `char*' containing the string itself.
!      The string may not be `NUL'-terminated, and it may contain
!      embedded `NUL' characters.  Therefore, the `TREE_STRING_LENGTH'
!      includes the trailing `NUL' if it is present.
  
!      For wide string constants, the `TREE_STRING_LENGTH' is the number
!      of bytes in the string, and the `TREE_STRING_POINTER' points to an
       array of the bytes of the string, as represented on the target
       system (that is, as integers in the target endianness).  Wide and
!      non-wide string constants are distinguished only by the `TREE_TYPE'
!      of the `STRING_CST'.
  
       FIXME: The formats of string constants are not well-defined when
       the target system bytes are not the same width as host system
       bytes.
  
- 
  
  File: gccint.info,  Node: Storage References,  Next: Unary and Binary Expressions,  Prev: Constant expressions,  Up: Expression trees
  
  10.6.2 References to storage
  ----------------------------
  
! `ARRAY_REF'
       These nodes represent array accesses.  The first operand is the
       array; the second is the index.  To calculate the address of the
       memory accessed, you must scale the index by the size of the type
--- 8432,8506 ----
  then proceeds to binary expressions, and concludes with various other
  kinds of expressions:
  
! 'INTEGER_CST'
       These nodes represent integer constants.  Note that the type of
!      these constants is obtained with 'TREE_TYPE'; they are not always
!      of type 'int'.  In particular, 'char' constants are represented
!      with 'INTEGER_CST' nodes.  The value of the integer constant 'e' is
!      represented in an array of HOST_WIDE_INT. There are enough elements
!      in the array to represent the value without taking extra elements
!      for redundant 0s or -1.  The number of elements used to represent
!      'e' is available via 'TREE_INT_CST_NUNITS'.  Element 'i' can be
!      extracted by using 'TREE_INT_CST_ELT (e, i)'.  'TREE_INT_CST_LOW'
!      is a shorthand for 'TREE_INT_CST_ELT (e, 0)'.
  
!      The functions 'tree_fits_shwi_p' and 'tree_fits_uhwi_p' can be used
!      to tell if the value is small enough to fit in a signed
!      HOST_WIDE_INT or an unsigned HOST_WIDE_INT respectively.  The value
!      can then be extracted using 'tree_to_shwi' and 'tree_to_uhwi'.
! 
! 'REAL_CST'
  
       FIXME: Talk about how to obtain representations of this constant,
       do comparisons, and so forth.
  
! 'FIXED_CST'
! 
       These nodes represent fixed-point constants.  The type of these
!      constants is obtained with 'TREE_TYPE'.  'TREE_FIXED_CST_PTR'
!      points to a 'struct fixed_value'; 'TREE_FIXED_CST' returns the
!      structure itself.  'struct fixed_value' contains 'data' with the
!      size of two 'HOST_BITS_PER_WIDE_INT' and 'mode' as the associated
!      fixed-point machine mode for 'data'.
  
! 'COMPLEX_CST'
!      These nodes are used to represent complex number constants, that is
!      a '__complex__' whose parts are constant nodes.  The
!      'TREE_REALPART' and 'TREE_IMAGPART' return the real and the
       imaginary parts respectively.
  
! 'VECTOR_CST'
       These nodes are used to represent vector constants, whose parts are
!      constant nodes.  Each individual constant node is either an integer
!      or a double constant node.  The first operand is a 'TREE_LIST' of
!      the constant nodes and is accessed through 'TREE_VECTOR_CST_ELTS'.
  
! 'STRING_CST'
!      These nodes represent string-constants.  The 'TREE_STRING_LENGTH'
!      returns the length of the string, as an 'int'.  The
!      'TREE_STRING_POINTER' is a 'char*' containing the string itself.
!      The string may not be 'NUL'-terminated, and it may contain embedded
!      'NUL' characters.  Therefore, the 'TREE_STRING_LENGTH' includes the
!      trailing 'NUL' if it is present.
  
!      For wide string constants, the 'TREE_STRING_LENGTH' is the number
!      of bytes in the string, and the 'TREE_STRING_POINTER' points to an
       array of the bytes of the string, as represented on the target
       system (that is, as integers in the target endianness).  Wide and
!      non-wide string constants are distinguished only by the 'TREE_TYPE'
!      of the 'STRING_CST'.
  
       FIXME: The formats of string constants are not well-defined when
       the target system bytes are not the same width as host system
       bytes.
  
  
  File: gccint.info,  Node: Storage References,  Next: Unary and Binary Expressions,  Prev: Constant expressions,  Up: Expression trees
  
  10.6.2 References to storage
  ----------------------------
  
! 'ARRAY_REF'
       These nodes represent array accesses.  The first operand is the
       array; the second is the index.  To calculate the address of the
       memory accessed, you must scale the index by the size of the type
*************** File: gccint.info,  Node: Storage Refere
*** 8664,8728 ****
       type of a component of the array.  The third and fourth operands
       are used after gimplification to represent the lower bound and
       component size but should not be used directly; call
!      `array_ref_low_bound' and `array_ref_element_size' instead.
  
! `ARRAY_RANGE_REF'
       These nodes represent access to a range (or "slice") of an array.
!      The operands are the same as that for `ARRAY_REF' and have the same
       meanings.  The type of these expressions must be an array whose
!      component type is the same as that of the first operand.  The
!      range of that array type determines the amount of data these
!      expressions access.
  
! `TARGET_MEM_REF'
       These nodes represent memory accesses whose address directly map to
       an addressing mode of the target architecture.  The first argument
!      is `TMR_SYMBOL' and must be a `VAR_DECL' of an object with a fixed
!      address.  The second argument is `TMR_BASE' and the third one is
!      `TMR_INDEX'.  The fourth argument is `TMR_STEP' and must be an
!      `INTEGER_CST'.  The fifth argument is `TMR_OFFSET' and must be an
!      `INTEGER_CST'.  Any of the arguments may be NULL if the
!      appropriate component does not appear in the address.  Address of
!      the `TARGET_MEM_REF' is determined in the following way.
  
            &TMR_SYMBOL + TMR_BASE + TMR_INDEX * TMR_STEP + TMR_OFFSET
  
       The sixth argument is the reference to the original memory access,
!      which is preserved for the purposes of the RTL alias analysis.
!      The seventh argument is a tag representing the results of tree
!      level alias analysis.
  
! `ADDR_EXPR'
       These nodes are used to represent the address of an object.  (These
       expressions will always have pointer or reference type.)  The
       operand may be another expression, or it may be a declaration.
  
       As an extension, GCC allows users to take the address of a label.
!      In this case, the operand of the `ADDR_EXPR' will be a
!      `LABEL_DECL'.  The type of such an expression is `void*'.
  
       If the object addressed is not an lvalue, a temporary is created,
       and the address of the temporary is used.
  
! `INDIRECT_REF'
       These nodes are used to represent the object pointed to by a
       pointer.  The operand is the pointer being dereferenced; it will
       always have pointer or reference type.
  
! `MEM_REF'
       These nodes are used to represent the object pointed to by a
       pointer offset by a constant.  The first operand is the pointer
       being dereferenced; it will always have pointer or reference type.
       The second operand is a pointer constant.  Its type is specifying
       the type to be used for type-based alias analysis.
  
! `COMPONENT_REF'
       These nodes represent non-static data member accesses.  The first
       operand is the object (rather than a pointer to it); the second
!      operand is the `FIELD_DECL' for the data member.  The third
!      operand represents the byte offset of the field, but should not be
!      used directly; call `component_ref_field_offset' instead.
! 
  
  
  File: gccint.info,  Node: Unary and Binary Expressions,  Next: Vectors,  Prev: Storage References,  Up: Expression trees
--- 8508,8571 ----
       type of a component of the array.  The third and fourth operands
       are used after gimplification to represent the lower bound and
       component size but should not be used directly; call
!      'array_ref_low_bound' and 'array_ref_element_size' instead.
  
! 'ARRAY_RANGE_REF'
       These nodes represent access to a range (or "slice") of an array.
!      The operands are the same as that for 'ARRAY_REF' and have the same
       meanings.  The type of these expressions must be an array whose
!      component type is the same as that of the first operand.  The range
!      of that array type determines the amount of data these expressions
!      access.
  
! 'TARGET_MEM_REF'
       These nodes represent memory accesses whose address directly map to
       an addressing mode of the target architecture.  The first argument
!      is 'TMR_SYMBOL' and must be a 'VAR_DECL' of an object with a fixed
!      address.  The second argument is 'TMR_BASE' and the third one is
!      'TMR_INDEX'.  The fourth argument is 'TMR_STEP' and must be an
!      'INTEGER_CST'.  The fifth argument is 'TMR_OFFSET' and must be an
!      'INTEGER_CST'.  Any of the arguments may be NULL if the appropriate
!      component does not appear in the address.  Address of the
!      'TARGET_MEM_REF' is determined in the following way.
  
            &TMR_SYMBOL + TMR_BASE + TMR_INDEX * TMR_STEP + TMR_OFFSET
  
       The sixth argument is the reference to the original memory access,
!      which is preserved for the purposes of the RTL alias analysis.  The
!      seventh argument is a tag representing the results of tree level
!      alias analysis.
  
! 'ADDR_EXPR'
       These nodes are used to represent the address of an object.  (These
       expressions will always have pointer or reference type.)  The
       operand may be another expression, or it may be a declaration.
  
       As an extension, GCC allows users to take the address of a label.
!      In this case, the operand of the 'ADDR_EXPR' will be a
!      'LABEL_DECL'.  The type of such an expression is 'void*'.
  
       If the object addressed is not an lvalue, a temporary is created,
       and the address of the temporary is used.
  
! 'INDIRECT_REF'
       These nodes are used to represent the object pointed to by a
       pointer.  The operand is the pointer being dereferenced; it will
       always have pointer or reference type.
  
! 'MEM_REF'
       These nodes are used to represent the object pointed to by a
       pointer offset by a constant.  The first operand is the pointer
       being dereferenced; it will always have pointer or reference type.
       The second operand is a pointer constant.  Its type is specifying
       the type to be used for type-based alias analysis.
  
! 'COMPONENT_REF'
       These nodes represent non-static data member accesses.  The first
       operand is the object (rather than a pointer to it); the second
!      operand is the 'FIELD_DECL' for the data member.  The third operand
!      represents the byte offset of the field, but should not be used
!      directly; call 'component_ref_field_offset' instead.
  
  
  File: gccint.info,  Node: Unary and Binary Expressions,  Next: Vectors,  Prev: Storage References,  Up: Expression trees
*************** File: gccint.info,  Node: Unary and Bina
*** 8730,8889 ****
  10.6.3 Unary and Binary Expressions
  -----------------------------------
  
! `NEGATE_EXPR'
       These nodes represent unary negation of the single operand, for
       both integer and floating-point types.  The type of negation can be
       determined by looking at the type of the expression.
  
       The behavior of this operation on signed arithmetic overflow is
!      controlled by the `flag_wrapv' and `flag_trapv' variables.
  
! `ABS_EXPR'
       These nodes represent the absolute value of the single operand, for
       both integer and floating-point types.  This is typically used to
!      implement the `abs', `labs' and `llabs' builtins for integer
!      types, and the `fabs', `fabsf' and `fabsl' builtins for floating
!      point types.  The type of abs operation can be determined by
!      looking at the type of the expression.
  
       This node is not used for complex types.  To represent the modulus
!      or complex abs of a complex value, use the `BUILT_IN_CABS',
!      `BUILT_IN_CABSF' or `BUILT_IN_CABSL' builtins, as used to
!      implement the C99 `cabs', `cabsf' and `cabsl' built-in functions.
  
! `BIT_NOT_EXPR'
       These nodes represent bitwise complement, and will always have
       integral type.  The only operand is the value to be complemented.
  
! `TRUTH_NOT_EXPR'
       These nodes represent logical negation, and will always have
       integral (or boolean) type.  The operand is the value being
!      negated.  The type of the operand and that of the result are
!      always of `BOOLEAN_TYPE' or `INTEGER_TYPE'.
  
! `PREDECREMENT_EXPR'
! `PREINCREMENT_EXPR'
! `POSTDECREMENT_EXPR'
! `POSTINCREMENT_EXPR'
       These nodes represent increment and decrement expressions.  The
       value of the single operand is computed, and the operand
!      incremented or decremented.  In the case of `PREDECREMENT_EXPR' and
!      `PREINCREMENT_EXPR', the value of the expression is the value
       resulting after the increment or decrement; in the case of
!      `POSTDECREMENT_EXPR' and `POSTINCREMENT_EXPR' is the value before
       the increment or decrement occurs.  The type of the operand, like
       that of the result, will be either integral, boolean, or
       floating-point.
  
! `FIX_TRUNC_EXPR'
       These nodes represent conversion of a floating-point value to an
       integer.  The single operand will have a floating-point type, while
       the complete expression will have an integral (or boolean) type.
       The operand is rounded towards zero.
  
! `FLOAT_EXPR'
       These nodes represent conversion of an integral (or boolean) value
       to a floating-point value.  The single operand will have integral
       type, while the complete expression will have a floating-point
       type.
  
       FIXME: How is the operand supposed to be rounded?  Is this
!      dependent on `-mieee'?
  
! `COMPLEX_EXPR'
       These nodes are used to represent complex numbers constructed from
       two expressions of the same (integer or real) type.  The first
       operand is the real part and the second operand is the imaginary
       part.
  
! `CONJ_EXPR'
       These nodes represent the conjugate of their operand.
  
! `REALPART_EXPR'
! `IMAGPART_EXPR'
       These nodes represent respectively the real and the imaginary parts
       of complex numbers (their sole argument).
  
! `NON_LVALUE_EXPR'
       These nodes indicate that their one and only operand is not an
       lvalue.  A back end can treat these identically to the single
       operand.
  
! `NOP_EXPR'
       These nodes are used to represent conversions that do not require
!      any code-generation.  For example, conversion of a `char*' to an
!      `int*' does not require any code be generated; such a conversion is
!      represented by a `NOP_EXPR'.  The single operand is the expression
       to be converted.  The conversion from a pointer to a reference is
!      also represented with a `NOP_EXPR'.
  
! `CONVERT_EXPR'
!      These nodes are similar to `NOP_EXPR's, but are used in those
       situations where code may need to be generated.  For example, if an
!      `int*' is converted to an `int' code may need to be generated on
       some platforms.  These nodes are never used for C++-specific
!      conversions, like conversions between pointers to different
!      classes in an inheritance hierarchy.  Any adjustments that need to
!      be made in such cases are always indicated explicitly.  Similarly,
!      a user-defined conversion is never represented by a
!      `CONVERT_EXPR'; instead, the function calls are made explicit.
  
! `FIXED_CONVERT_EXPR'
       These nodes are used to represent conversions that involve
       fixed-point values.  For example, from a fixed-point value to
       another fixed-point value, from an integer to a fixed-point value,
!      from a fixed-point value to an integer, from a floating-point
!      value to a fixed-point value, or from a fixed-point value to a
       floating-point value.
  
! `LSHIFT_EXPR'
! `RSHIFT_EXPR'
       These nodes represent left and right shifts, respectively.  The
       first operand is the value to shift; it will always be of integral
       type.  The second operand is an expression for the number of bits
       by which to shift.  Right shift should be treated as arithmetic,
!      i.e., the high-order bits should be zero-filled when the
!      expression has unsigned type and filled with the sign bit when the
!      expression has signed type.  Note that the result is undefined if
!      the second operand is larger than or equal to the first operand's
!      type size. Unlike most nodes, these can have a vector as first
!      operand and a scalar as second operand.
  
! `BIT_IOR_EXPR'
! `BIT_XOR_EXPR'
! `BIT_AND_EXPR'
       These nodes represent bitwise inclusive or, bitwise exclusive or,
       and bitwise and, respectively.  Both operands will always have
       integral type.
  
! `TRUTH_ANDIF_EXPR'
! `TRUTH_ORIF_EXPR'
       These nodes represent logical "and" and logical "or", respectively.
       These operators are not strict; i.e., the second operand is
       evaluated only if the value of the expression is not determined by
!      evaluation of the first operand.  The type of the operands and
!      that of the result are always of `BOOLEAN_TYPE' or `INTEGER_TYPE'.
  
! `TRUTH_AND_EXPR'
! `TRUTH_OR_EXPR'
! `TRUTH_XOR_EXPR'
       These nodes represent logical and, logical or, and logical
       exclusive or.  They are strict; both arguments are always
       evaluated.  There are no corresponding operators in C or C++, but
       the front end will sometimes generate these expressions anyhow, if
       it can tell that strictness does not matter.  The type of the
!      operands and that of the result are always of `BOOLEAN_TYPE' or
!      `INTEGER_TYPE'.
  
! `POINTER_PLUS_EXPR'
       This node represents pointer arithmetic.  The first operand is
       always a pointer/reference type.  The second operand is always an
       unsigned integer type compatible with sizetype.  This is the only
       binary arithmetic operand that can operate on pointer types.
  
! `PLUS_EXPR'
! `MINUS_EXPR'
! `MULT_EXPR'
       These nodes represent various binary arithmetic operations.
       Respectively, these operations are addition, subtraction (of the
       second operand from the first) and multiplication.  Their operands
--- 8573,8732 ----
  10.6.3 Unary and Binary Expressions
  -----------------------------------
  
! 'NEGATE_EXPR'
       These nodes represent unary negation of the single operand, for
       both integer and floating-point types.  The type of negation can be
       determined by looking at the type of the expression.
  
       The behavior of this operation on signed arithmetic overflow is
!      controlled by the 'flag_wrapv' and 'flag_trapv' variables.
  
! 'ABS_EXPR'
       These nodes represent the absolute value of the single operand, for
       both integer and floating-point types.  This is typically used to
!      implement the 'abs', 'labs' and 'llabs' builtins for integer types,
!      and the 'fabs', 'fabsf' and 'fabsl' builtins for floating point
!      types.  The type of abs operation can be determined by looking at
!      the type of the expression.
  
       This node is not used for complex types.  To represent the modulus
!      or complex abs of a complex value, use the 'BUILT_IN_CABS',
!      'BUILT_IN_CABSF' or 'BUILT_IN_CABSL' builtins, as used to implement
!      the C99 'cabs', 'cabsf' and 'cabsl' built-in functions.
  
! 'BIT_NOT_EXPR'
       These nodes represent bitwise complement, and will always have
       integral type.  The only operand is the value to be complemented.
  
! 'TRUTH_NOT_EXPR'
       These nodes represent logical negation, and will always have
       integral (or boolean) type.  The operand is the value being
!      negated.  The type of the operand and that of the result are always
!      of 'BOOLEAN_TYPE' or 'INTEGER_TYPE'.
  
! 'PREDECREMENT_EXPR'
! 'PREINCREMENT_EXPR'
! 'POSTDECREMENT_EXPR'
! 'POSTINCREMENT_EXPR'
       These nodes represent increment and decrement expressions.  The
       value of the single operand is computed, and the operand
!      incremented or decremented.  In the case of 'PREDECREMENT_EXPR' and
!      'PREINCREMENT_EXPR', the value of the expression is the value
       resulting after the increment or decrement; in the case of
!      'POSTDECREMENT_EXPR' and 'POSTINCREMENT_EXPR' is the value before
       the increment or decrement occurs.  The type of the operand, like
       that of the result, will be either integral, boolean, or
       floating-point.
  
! 'FIX_TRUNC_EXPR'
       These nodes represent conversion of a floating-point value to an
       integer.  The single operand will have a floating-point type, while
       the complete expression will have an integral (or boolean) type.
       The operand is rounded towards zero.
  
! 'FLOAT_EXPR'
       These nodes represent conversion of an integral (or boolean) value
       to a floating-point value.  The single operand will have integral
       type, while the complete expression will have a floating-point
       type.
  
       FIXME: How is the operand supposed to be rounded?  Is this
!      dependent on '-mieee'?
  
! 'COMPLEX_EXPR'
       These nodes are used to represent complex numbers constructed from
       two expressions of the same (integer or real) type.  The first
       operand is the real part and the second operand is the imaginary
       part.
  
! 'CONJ_EXPR'
       These nodes represent the conjugate of their operand.
  
! 'REALPART_EXPR'
! 'IMAGPART_EXPR'
       These nodes represent respectively the real and the imaginary parts
       of complex numbers (their sole argument).
  
! 'NON_LVALUE_EXPR'
       These nodes indicate that their one and only operand is not an
       lvalue.  A back end can treat these identically to the single
       operand.
  
! 'NOP_EXPR'
       These nodes are used to represent conversions that do not require
!      any code-generation.  For example, conversion of a 'char*' to an
!      'int*' does not require any code be generated; such a conversion is
!      represented by a 'NOP_EXPR'.  The single operand is the expression
       to be converted.  The conversion from a pointer to a reference is
!      also represented with a 'NOP_EXPR'.
  
! 'CONVERT_EXPR'
!      These nodes are similar to 'NOP_EXPR's, but are used in those
       situations where code may need to be generated.  For example, if an
!      'int*' is converted to an 'int' code may need to be generated on
       some platforms.  These nodes are never used for C++-specific
!      conversions, like conversions between pointers to different classes
!      in an inheritance hierarchy.  Any adjustments that need to be made
!      in such cases are always indicated explicitly.  Similarly, a
!      user-defined conversion is never represented by a 'CONVERT_EXPR';
!      instead, the function calls are made explicit.
  
! 'FIXED_CONVERT_EXPR'
       These nodes are used to represent conversions that involve
       fixed-point values.  For example, from a fixed-point value to
       another fixed-point value, from an integer to a fixed-point value,
!      from a fixed-point value to an integer, from a floating-point value
!      to a fixed-point value, or from a fixed-point value to a
       floating-point value.
  
! 'LSHIFT_EXPR'
! 'RSHIFT_EXPR'
       These nodes represent left and right shifts, respectively.  The
       first operand is the value to shift; it will always be of integral
       type.  The second operand is an expression for the number of bits
       by which to shift.  Right shift should be treated as arithmetic,
!      i.e., the high-order bits should be zero-filled when the expression
!      has unsigned type and filled with the sign bit when the expression
!      has signed type.  Note that the result is undefined if the second
!      operand is larger than or equal to the first operand's type size.
!      Unlike most nodes, these can have a vector as first operand and a
!      scalar as second operand.
  
! 'BIT_IOR_EXPR'
! 'BIT_XOR_EXPR'
! 'BIT_AND_EXPR'
       These nodes represent bitwise inclusive or, bitwise exclusive or,
       and bitwise and, respectively.  Both operands will always have
       integral type.
  
! 'TRUTH_ANDIF_EXPR'
! 'TRUTH_ORIF_EXPR'
       These nodes represent logical "and" and logical "or", respectively.
       These operators are not strict; i.e., the second operand is
       evaluated only if the value of the expression is not determined by
!      evaluation of the first operand.  The type of the operands and that
!      of the result are always of 'BOOLEAN_TYPE' or 'INTEGER_TYPE'.
  
! 'TRUTH_AND_EXPR'
! 'TRUTH_OR_EXPR'
! 'TRUTH_XOR_EXPR'
       These nodes represent logical and, logical or, and logical
       exclusive or.  They are strict; both arguments are always
       evaluated.  There are no corresponding operators in C or C++, but
       the front end will sometimes generate these expressions anyhow, if
       it can tell that strictness does not matter.  The type of the
!      operands and that of the result are always of 'BOOLEAN_TYPE' or
!      'INTEGER_TYPE'.
  
! 'POINTER_PLUS_EXPR'
       This node represents pointer arithmetic.  The first operand is
       always a pointer/reference type.  The second operand is always an
       unsigned integer type compatible with sizetype.  This is the only
       binary arithmetic operand that can operate on pointer types.
  
! 'PLUS_EXPR'
! 'MINUS_EXPR'
! 'MULT_EXPR'
       These nodes represent various binary arithmetic operations.
       Respectively, these operations are addition, subtraction (of the
       second operand from the first) and multiplication.  Their operands
*************** File: gccint.info,  Node: Unary and Bina
*** 8892,8965 ****
       integral type.
  
       The behavior of these operations on signed arithmetic overflow is
!      controlled by the `flag_wrapv' and `flag_trapv' variables.
  
! `MULT_HIGHPART_EXPR'
       This node represents the "high-part" of a widening multiplication.
       For an integral type with B bits of precision, the result is the
       most significant B bits of the full 2B product.
  
! `RDIV_EXPR'
       This node represents a floating point division operation.
  
! `TRUNC_DIV_EXPR'
! `FLOOR_DIV_EXPR'
! `CEIL_DIV_EXPR'
! `ROUND_DIV_EXPR'
       These nodes represent integer division operations that return an
!      integer result.  `TRUNC_DIV_EXPR' rounds towards zero,
!      `FLOOR_DIV_EXPR' rounds towards negative infinity, `CEIL_DIV_EXPR'
!      rounds towards positive infinity and `ROUND_DIV_EXPR' rounds to
!      the closest integer.  Integer division in C and C++ is truncating,
!      i.e. `TRUNC_DIV_EXPR'.
  
       The behavior of these operations on signed arithmetic overflow,
       when dividing the minimum signed integer by minus one, is
!      controlled by the `flag_wrapv' and `flag_trapv' variables.
  
! `TRUNC_MOD_EXPR'
! `FLOOR_MOD_EXPR'
! `CEIL_MOD_EXPR'
! `ROUND_MOD_EXPR'
       These nodes represent the integer remainder or modulus operation.
!      The integer modulus of two operands `a' and `b' is defined as `a -
       (a/b)*b' where the division calculated using the corresponding
!      division operator.  Hence for `TRUNC_MOD_EXPR' this definition
       assumes division using truncation towards zero, i.e.
!      `TRUNC_DIV_EXPR'.  Integer remainder in C and C++ uses truncating
!      division, i.e. `TRUNC_MOD_EXPR'.
  
! `EXACT_DIV_EXPR'
!      The `EXACT_DIV_EXPR' code is used to represent integer divisions
       where the numerator is known to be an exact multiple of the
       denominator.  This allows the backend to choose between the faster
!      of `TRUNC_DIV_EXPR', `CEIL_DIV_EXPR' and `FLOOR_DIV_EXPR' for the
       current target.
  
! `LT_EXPR'
! `LE_EXPR'
! `GT_EXPR'
! `GE_EXPR'
! `EQ_EXPR'
! `NE_EXPR'
       These nodes represent the less than, less than or equal to, greater
       than, greater than or equal to, equal, and not equal comparison
       operators.  The first and second operands will either be both of
       integral type, both of floating type or both of vector type.  The
       result type of these expressions will always be of integral,
       boolean or signed integral vector type.  These operations return
!      the result type's zero value for false, the result type's one
!      value for true, and a vector whose elements are zero (false) or
!      minus one (true) for vectors.
  
       For floating point comparisons, if we honor IEEE NaNs and either
!      operand is NaN, then `NE_EXPR' always returns true and the
       remaining operators always return false.  On some targets,
       comparisons against an IEEE NaN, other than equality and
       inequality, may generate a floating point exception.
  
! `ORDERED_EXPR'
! `UNORDERED_EXPR'
       These nodes represent non-trapping ordered and unordered comparison
       operators.  These operations take two floating point operands and
       determine whether they are ordered or unordered relative to each
--- 8735,8808 ----
       integral type.
  
       The behavior of these operations on signed arithmetic overflow is
!      controlled by the 'flag_wrapv' and 'flag_trapv' variables.
  
! 'MULT_HIGHPART_EXPR'
       This node represents the "high-part" of a widening multiplication.
       For an integral type with B bits of precision, the result is the
       most significant B bits of the full 2B product.
  
! 'RDIV_EXPR'
       This node represents a floating point division operation.
  
! 'TRUNC_DIV_EXPR'
! 'FLOOR_DIV_EXPR'
! 'CEIL_DIV_EXPR'
! 'ROUND_DIV_EXPR'
       These nodes represent integer division operations that return an
!      integer result.  'TRUNC_DIV_EXPR' rounds towards zero,
!      'FLOOR_DIV_EXPR' rounds towards negative infinity, 'CEIL_DIV_EXPR'
!      rounds towards positive infinity and 'ROUND_DIV_EXPR' rounds to the
!      closest integer.  Integer division in C and C++ is truncating, i.e.
!      'TRUNC_DIV_EXPR'.
  
       The behavior of these operations on signed arithmetic overflow,
       when dividing the minimum signed integer by minus one, is
!      controlled by the 'flag_wrapv' and 'flag_trapv' variables.
  
! 'TRUNC_MOD_EXPR'
! 'FLOOR_MOD_EXPR'
! 'CEIL_MOD_EXPR'
! 'ROUND_MOD_EXPR'
       These nodes represent the integer remainder or modulus operation.
!      The integer modulus of two operands 'a' and 'b' is defined as 'a -
       (a/b)*b' where the division calculated using the corresponding
!      division operator.  Hence for 'TRUNC_MOD_EXPR' this definition
       assumes division using truncation towards zero, i.e.
!      'TRUNC_DIV_EXPR'.  Integer remainder in C and C++ uses truncating
!      division, i.e. 'TRUNC_MOD_EXPR'.
  
! 'EXACT_DIV_EXPR'
!      The 'EXACT_DIV_EXPR' code is used to represent integer divisions
       where the numerator is known to be an exact multiple of the
       denominator.  This allows the backend to choose between the faster
!      of 'TRUNC_DIV_EXPR', 'CEIL_DIV_EXPR' and 'FLOOR_DIV_EXPR' for the
       current target.
  
! 'LT_EXPR'
! 'LE_EXPR'
! 'GT_EXPR'
! 'GE_EXPR'
! 'EQ_EXPR'
! 'NE_EXPR'
       These nodes represent the less than, less than or equal to, greater
       than, greater than or equal to, equal, and not equal comparison
       operators.  The first and second operands will either be both of
       integral type, both of floating type or both of vector type.  The
       result type of these expressions will always be of integral,
       boolean or signed integral vector type.  These operations return
!      the result type's zero value for false, the result type's one value
!      for true, and a vector whose elements are zero (false) or minus one
!      (true) for vectors.
  
       For floating point comparisons, if we honor IEEE NaNs and either
!      operand is NaN, then 'NE_EXPR' always returns true and the
       remaining operators always return false.  On some targets,
       comparisons against an IEEE NaN, other than equality and
       inequality, may generate a floating point exception.
  
! 'ORDERED_EXPR'
! 'UNORDERED_EXPR'
       These nodes represent non-trapping ordered and unordered comparison
       operators.  These operations take two floating point operands and
       determine whether they are ordered or unordered relative to each
*************** File: gccint.info,  Node: Unary and Bina
*** 8970,9019 ****
       type's zero value for false, and the result type's one value for
       true.
  
! `UNLT_EXPR'
! `UNLE_EXPR'
! `UNGT_EXPR'
! `UNGE_EXPR'
! `UNEQ_EXPR'
! `LTGT_EXPR'
       These nodes represent the unordered comparison operators.  These
       operations take two floating point operands and determine whether
       the operands are unordered or are less than, less than or equal to,
       greater than, greater than or equal to, or equal respectively.  For
!      example, `UNLT_EXPR' returns true if either operand is an IEEE NaN
       or the first operand is less than the second.  With the possible
!      exception of `LTGT_EXPR', all of these operations are guaranteed
       not to generate a floating point exception.  The result type of
       these expressions will always be of integral or boolean type.
!      These operations return the result type's zero value for false,
!      and the result type's one value for true.
  
! `MODIFY_EXPR'
       These nodes represent assignment.  The left-hand side is the first
       operand; the right-hand side is the second operand.  The left-hand
!      side will be a `VAR_DECL', `INDIRECT_REF', `COMPONENT_REF', or
       other lvalue.
  
!      These nodes are used to represent not only assignment with `=' but
!      also compound assignments (like `+='), by reduction to `='
!      assignment.  In other words, the representation for `i += 3' looks
!      just like that for `i = i + 3'.
  
! `INIT_EXPR'
!      These nodes are just like `MODIFY_EXPR', but are used only when a
       variable is initialized, rather than assigned to subsequently.
!      This means that we can assume that the target of the
!      initialization is not used in computing its own value; any
!      reference to the lhs in computing the rhs is undefined.
  
! `COMPOUND_EXPR'
       These nodes represent comma-expressions.  The first operand is an
       expression whose value is computed and thrown away prior to the
       evaluation of the second operand.  The value of the entire
       expression is the value of the second operand.
  
! `COND_EXPR'
!      These nodes represent `?:' expressions.  The first operand is of
       boolean or integral type.  If it evaluates to a nonzero value, the
       second operand should be evaluated, and returned as the value of
       the expression.  Otherwise, the third operand is evaluated, and
--- 8813,8862 ----
       type's zero value for false, and the result type's one value for
       true.
  
! 'UNLT_EXPR'
! 'UNLE_EXPR'
! 'UNGT_EXPR'
! 'UNGE_EXPR'
! 'UNEQ_EXPR'
! 'LTGT_EXPR'
       These nodes represent the unordered comparison operators.  These
       operations take two floating point operands and determine whether
       the operands are unordered or are less than, less than or equal to,
       greater than, greater than or equal to, or equal respectively.  For
!      example, 'UNLT_EXPR' returns true if either operand is an IEEE NaN
       or the first operand is less than the second.  With the possible
!      exception of 'LTGT_EXPR', all of these operations are guaranteed
       not to generate a floating point exception.  The result type of
       these expressions will always be of integral or boolean type.
!      These operations return the result type's zero value for false, and
!      the result type's one value for true.
  
! 'MODIFY_EXPR'
       These nodes represent assignment.  The left-hand side is the first
       operand; the right-hand side is the second operand.  The left-hand
!      side will be a 'VAR_DECL', 'INDIRECT_REF', 'COMPONENT_REF', or
       other lvalue.
  
!      These nodes are used to represent not only assignment with '=' but
!      also compound assignments (like '+='), by reduction to '='
!      assignment.  In other words, the representation for 'i += 3' looks
!      just like that for 'i = i + 3'.
  
! 'INIT_EXPR'
!      These nodes are just like 'MODIFY_EXPR', but are used only when a
       variable is initialized, rather than assigned to subsequently.
!      This means that we can assume that the target of the initialization
!      is not used in computing its own value; any reference to the lhs in
!      computing the rhs is undefined.
  
! 'COMPOUND_EXPR'
       These nodes represent comma-expressions.  The first operand is an
       expression whose value is computed and thrown away prior to the
       evaluation of the second operand.  The value of the entire
       expression is the value of the second operand.
  
! 'COND_EXPR'
!      These nodes represent '?:' expressions.  The first operand is of
       boolean or integral type.  If it evaluates to a nonzero value, the
       second operand should be evaluated, and returned as the value of
       the expression.  Otherwise, the third operand is evaluated, and
*************** File: gccint.info,  Node: Unary and Bina
*** 9023,9055 ****
       expression, unless it unconditionally throws an exception or calls
       a noreturn function, in which case it should have void type.  The
       same constraints apply to the third operand.  This allows array
!      bounds checks to be represented conveniently as `(i >= 0 && i <
!      10) ? i : abort()'.
  
       As a GNU extension, the C language front-ends allow the second
!      operand of the `?:' operator may be omitted in the source.  For
!      example, `x ? : 3' is equivalent to `x ? x : 3', assuming that `x'
!      is an expression without side-effects.  In the tree
!      representation, however, the second operand is always present,
!      possibly protected by `SAVE_EXPR' if the first argument does cause
!      side-effects.
  
! `CALL_EXPR'
       These nodes are used to represent calls to functions, including
!      non-static member functions.  `CALL_EXPR's are implemented as
       expression nodes with a variable number of operands.  Rather than
!      using `TREE_OPERAND' to extract them, it is preferable to use the
!      specialized accessor macros and functions that operate
!      specifically on `CALL_EXPR' nodes.
  
!      `CALL_EXPR_FN' returns a pointer to the function to call; it is
!      always an expression whose type is a `POINTER_TYPE'.
  
       The number of arguments to the call is returned by
!      `call_expr_nargs', while the arguments themselves can be accessed
!      with the `CALL_EXPR_ARG' macro.  The arguments are zero-indexed
!      and numbered left-to-right.  You can iterate over the arguments
!      using `FOR_EACH_CALL_EXPR_ARG', as in:
  
            tree call, arg;
            call_expr_arg_iterator iter;
--- 8866,8897 ----
       expression, unless it unconditionally throws an exception or calls
       a noreturn function, in which case it should have void type.  The
       same constraints apply to the third operand.  This allows array
!      bounds checks to be represented conveniently as '(i >= 0 && i < 10)
!      ? i : abort()'.
  
       As a GNU extension, the C language front-ends allow the second
!      operand of the '?:' operator may be omitted in the source.  For
!      example, 'x ? : 3' is equivalent to 'x ? x : 3', assuming that 'x'
!      is an expression without side-effects.  In the tree representation,
!      however, the second operand is always present, possibly protected
!      by 'SAVE_EXPR' if the first argument does cause side-effects.
  
! 'CALL_EXPR'
       These nodes are used to represent calls to functions, including
!      non-static member functions.  'CALL_EXPR's are implemented as
       expression nodes with a variable number of operands.  Rather than
!      using 'TREE_OPERAND' to extract them, it is preferable to use the
!      specialized accessor macros and functions that operate specifically
!      on 'CALL_EXPR' nodes.
  
!      'CALL_EXPR_FN' returns a pointer to the function to call; it is
!      always an expression whose type is a 'POINTER_TYPE'.
  
       The number of arguments to the call is returned by
!      'call_expr_nargs', while the arguments themselves can be accessed
!      with the 'CALL_EXPR_ARG' macro.  The arguments are zero-indexed and
!      numbered left-to-right.  You can iterate over the arguments using
!      'FOR_EACH_CALL_EXPR_ARG', as in:
  
            tree call, arg;
            call_expr_arg_iterator iter;
*************** File: gccint.info,  Node: Unary and Bina
*** 9058,9160 ****
              ...;
  
       For non-static member functions, there will be an operand
!      corresponding to the `this' pointer.  There will always be
       expressions corresponding to all of the arguments, even if the
       function is declared with default arguments and some arguments are
       not explicitly provided at the call sites.
  
!      `CALL_EXPR's also have a `CALL_EXPR_STATIC_CHAIN' operand that is
       used to implement nested functions.  This operand is otherwise
       null.
  
! `CLEANUP_POINT_EXPR'
       These nodes represent full-expressions.  The single operand is an
       expression to evaluate.  Any destructor calls engendered by the
       creation of temporaries during the evaluation of that expression
       should be performed immediately after the expression is evaluated.
  
! `CONSTRUCTOR'
       These nodes represent the brace-enclosed initializers for a
!      structure or an array.  They contain a sequence of component
!      values made out of a vector of constructor_elt, which is a
!      (`INDEX', `VALUE') pair.
  
!      If the `TREE_TYPE' of the `CONSTRUCTOR' is a `RECORD_TYPE',
!      `UNION_TYPE' or `QUAL_UNION_TYPE' then the `INDEX' of each node in
!      the sequence will be a `FIELD_DECL' and the `VALUE' will be the
       expression used to initialize that field.
  
!      If the `TREE_TYPE' of the `CONSTRUCTOR' is an `ARRAY_TYPE', then
!      the `INDEX' of each node in the sequence will be an `INTEGER_CST'
!      or a `RANGE_EXPR' of two `INTEGER_CST's.  A single `INTEGER_CST'
       indicates which element of the array is being assigned to.  A
!      `RANGE_EXPR' indicates an inclusive range of elements to
!      initialize.  In both cases the `VALUE' is the corresponding
       initializer.  It is re-evaluated for each element of a
!      `RANGE_EXPR'.  If the `INDEX' is `NULL_TREE', then the initializer
       is for the next available array element.
  
       In the front end, you should not depend on the fields appearing in
       any particular order.  However, in the middle end, fields must
!      appear in declaration order.  You should not assume that all
!      fields will be represented.  Unrepresented fields will be cleared
       (zeroed), unless the CONSTRUCTOR_NO_CLEARING flag is set, in which
       case their value becomes undefined.
  
! `COMPOUND_LITERAL_EXPR'
       These nodes represent ISO C99 compound literals.  The
!      `COMPOUND_LITERAL_EXPR_DECL_EXPR' is a `DECL_EXPR' containing an
!      anonymous `VAR_DECL' for the unnamed object represented by the
!      compound literal; the `DECL_INITIAL' of that `VAR_DECL' is a
!      `CONSTRUCTOR' representing the brace-enclosed list of initializers
!      in the compound literal.  That anonymous `VAR_DECL' can also be
!      accessed directly by the `COMPOUND_LITERAL_EXPR_DECL' macro.
  
! `SAVE_EXPR'
!      A `SAVE_EXPR' represents an expression (possibly involving
       side-effects) that is used more than once.  The side-effects should
       occur only the first time the expression is evaluated.  Subsequent
       uses should just reuse the computed value.  The first operand to
!      the `SAVE_EXPR' is the expression to evaluate.  The side-effects
!      should be executed where the `SAVE_EXPR' is first encountered in a
       depth-first preorder traversal of the expression tree.
  
! `TARGET_EXPR'
!      A `TARGET_EXPR' represents a temporary object.  The first operand
!      is a `VAR_DECL' for the temporary variable.  The second operand is
       the initializer for the temporary.  The initializer is evaluated
       and, if non-void, copied (bitwise) into the temporary.  If the
       initializer is void, that means that it will perform the
       initialization itself.
  
!      Often, a `TARGET_EXPR' occurs on the right-hand side of an
       assignment, or as the second operand to a comma-expression which is
!      itself the right-hand side of an assignment, etc.  In this case,
!      we say that the `TARGET_EXPR' is "normal"; otherwise, we say it is
!      "orphaned".  For a normal `TARGET_EXPR' the temporary variable
       should be treated as an alias for the left-hand side of the
       assignment, rather than as a new temporary variable.
  
!      The third operand to the `TARGET_EXPR', if present, is a
       cleanup-expression (i.e., destructor call) for the temporary.  If
       this expression is orphaned, then this expression must be executed
       when the statement containing this expression is complete.  These
       cleanups must always be executed in the order opposite to that in
       which they were encountered.  Note that if a temporary is created
       on one branch of a conditional operator (i.e., in the second or
!      third operand to a `COND_EXPR'), the cleanup must be run only if
       that branch is actually executed.
  
! `VA_ARG_EXPR'
       This node is used to implement support for the C/C++ variable
!      argument-list mechanism.  It represents expressions like `va_arg
!      (ap, type)'.  Its `TREE_TYPE' yields the tree representation for
!      `type' and its sole argument yields the representation for `ap'.
  
! `ANNOTATE_EXPR'
!      This node is used to attach markers to an expression. The first
!      operand is the annotated expression, the second is an
!      `INTEGER_CST' with a value from `enum annot_expr_kind'.
  
  
  File: gccint.info,  Node: Vectors,  Prev: Unary and Binary Expressions,  Up: Expression trees
--- 8900,9003 ----
              ...;
  
       For non-static member functions, there will be an operand
!      corresponding to the 'this' pointer.  There will always be
       expressions corresponding to all of the arguments, even if the
       function is declared with default arguments and some arguments are
       not explicitly provided at the call sites.
  
!      'CALL_EXPR's also have a 'CALL_EXPR_STATIC_CHAIN' operand that is
       used to implement nested functions.  This operand is otherwise
       null.
  
! 'CLEANUP_POINT_EXPR'
       These nodes represent full-expressions.  The single operand is an
       expression to evaluate.  Any destructor calls engendered by the
       creation of temporaries during the evaluation of that expression
       should be performed immediately after the expression is evaluated.
  
! 'CONSTRUCTOR'
       These nodes represent the brace-enclosed initializers for a
!      structure or an array.  They contain a sequence of component values
!      made out of a vector of constructor_elt, which is a ('INDEX',
!      'VALUE') pair.
  
!      If the 'TREE_TYPE' of the 'CONSTRUCTOR' is a 'RECORD_TYPE',
!      'UNION_TYPE' or 'QUAL_UNION_TYPE' then the 'INDEX' of each node in
!      the sequence will be a 'FIELD_DECL' and the 'VALUE' will be the
       expression used to initialize that field.
  
!      If the 'TREE_TYPE' of the 'CONSTRUCTOR' is an 'ARRAY_TYPE', then
!      the 'INDEX' of each node in the sequence will be an 'INTEGER_CST'
!      or a 'RANGE_EXPR' of two 'INTEGER_CST's.  A single 'INTEGER_CST'
       indicates which element of the array is being assigned to.  A
!      'RANGE_EXPR' indicates an inclusive range of elements to
!      initialize.  In both cases the 'VALUE' is the corresponding
       initializer.  It is re-evaluated for each element of a
!      'RANGE_EXPR'.  If the 'INDEX' is 'NULL_TREE', then the initializer
       is for the next available array element.
  
       In the front end, you should not depend on the fields appearing in
       any particular order.  However, in the middle end, fields must
!      appear in declaration order.  You should not assume that all fields
!      will be represented.  Unrepresented fields will be cleared
       (zeroed), unless the CONSTRUCTOR_NO_CLEARING flag is set, in which
       case their value becomes undefined.
  
! 'COMPOUND_LITERAL_EXPR'
       These nodes represent ISO C99 compound literals.  The
!      'COMPOUND_LITERAL_EXPR_DECL_EXPR' is a 'DECL_EXPR' containing an
!      anonymous 'VAR_DECL' for the unnamed object represented by the
!      compound literal; the 'DECL_INITIAL' of that 'VAR_DECL' is a
!      'CONSTRUCTOR' representing the brace-enclosed list of initializers
!      in the compound literal.  That anonymous 'VAR_DECL' can also be
!      accessed directly by the 'COMPOUND_LITERAL_EXPR_DECL' macro.
  
! 'SAVE_EXPR'
! 
!      A 'SAVE_EXPR' represents an expression (possibly involving
       side-effects) that is used more than once.  The side-effects should
       occur only the first time the expression is evaluated.  Subsequent
       uses should just reuse the computed value.  The first operand to
!      the 'SAVE_EXPR' is the expression to evaluate.  The side-effects
!      should be executed where the 'SAVE_EXPR' is first encountered in a
       depth-first preorder traversal of the expression tree.
  
! 'TARGET_EXPR'
!      A 'TARGET_EXPR' represents a temporary object.  The first operand
!      is a 'VAR_DECL' for the temporary variable.  The second operand is
       the initializer for the temporary.  The initializer is evaluated
       and, if non-void, copied (bitwise) into the temporary.  If the
       initializer is void, that means that it will perform the
       initialization itself.
  
!      Often, a 'TARGET_EXPR' occurs on the right-hand side of an
       assignment, or as the second operand to a comma-expression which is
!      itself the right-hand side of an assignment, etc.  In this case, we
!      say that the 'TARGET_EXPR' is "normal"; otherwise, we say it is
!      "orphaned".  For a normal 'TARGET_EXPR' the temporary variable
       should be treated as an alias for the left-hand side of the
       assignment, rather than as a new temporary variable.
  
!      The third operand to the 'TARGET_EXPR', if present, is a
       cleanup-expression (i.e., destructor call) for the temporary.  If
       this expression is orphaned, then this expression must be executed
       when the statement containing this expression is complete.  These
       cleanups must always be executed in the order opposite to that in
       which they were encountered.  Note that if a temporary is created
       on one branch of a conditional operator (i.e., in the second or
!      third operand to a 'COND_EXPR'), the cleanup must be run only if
       that branch is actually executed.
  
! 'VA_ARG_EXPR'
       This node is used to implement support for the C/C++ variable
!      argument-list mechanism.  It represents expressions like 'va_arg
!      (ap, type)'.  Its 'TREE_TYPE' yields the tree representation for
!      'type' and its sole argument yields the representation for 'ap'.
  
! 'ANNOTATE_EXPR'
!      This node is used to attach markers to an expression.  The first
!      operand is the annotated expression, the second is an 'INTEGER_CST'
!      with a value from 'enum annot_expr_kind'.
  
  
  File: gccint.info,  Node: Vectors,  Prev: Unary and Binary Expressions,  Up: Expression trees
*************** File: gccint.info,  Node: Vectors,  Prev
*** 9162,9169 ****
  10.6.4 Vectors
  --------------
  
! `VEC_LSHIFT_EXPR'
! `VEC_RSHIFT_EXPR'
       These nodes represent whole vector left and right shifts,
       respectively.  The first operand is the vector to shift; it will
       always be of vector type.  The second operand is an expression for
--- 9005,9012 ----
  10.6.4 Vectors
  --------------
  
! 'VEC_LSHIFT_EXPR'
! 'VEC_RSHIFT_EXPR'
       These nodes represent whole vector left and right shifts,
       respectively.  The first operand is the vector to shift; it will
       always be of vector type.  The second operand is an expression for
*************** File: gccint.info,  Node: Vectors,  Prev
*** 9171,9223 ****
       undefined if the second operand is larger than or equal to the
       first operand's type size.
  
! `VEC_WIDEN_MULT_HI_EXPR'
! `VEC_WIDEN_MULT_LO_EXPR'
       These nodes represent widening vector multiplication of the high
       and low parts of the two input vectors, respectively.  Their
!      operands are vectors that contain the same number of elements
!      (`N') of the same integral type.  The result is a vector that
!      contains half as many elements, of an integral type whose size is
!      twice as wide.  In the case of `VEC_WIDEN_MULT_HI_EXPR' the high
!      `N/2' elements of the two vector are multiplied to produce the
!      vector of `N/2' products. In the case of `VEC_WIDEN_MULT_LO_EXPR'
!      the low `N/2' elements of the two vector are multiplied to produce
!      the vector of `N/2' products.
  
! `VEC_UNPACK_HI_EXPR'
! `VEC_UNPACK_LO_EXPR'
       These nodes represent unpacking of the high and low parts of the
       input vector, respectively.  The single operand is a vector that
!      contains `N' elements of the same integral or floating point type.
       The result is a vector that contains half as many elements, of an
       integral or floating point type whose size is twice as wide.  In
!      the case of `VEC_UNPACK_HI_EXPR' the high `N/2' elements of the
       vector are extracted and widened (promoted).  In the case of
!      `VEC_UNPACK_LO_EXPR' the low `N/2' elements of the vector are
       extracted and widened (promoted).
  
! `VEC_UNPACK_FLOAT_HI_EXPR'
! `VEC_UNPACK_FLOAT_LO_EXPR'
       These nodes represent unpacking of the high and low parts of the
       input vector, where the values are converted from fixed point to
!      floating point.  The single operand is a vector that contains `N'
       elements of the same integral type.  The result is a vector that
       contains half as many elements of a floating point type whose size
!      is twice as wide.  In the case of `VEC_UNPACK_HI_EXPR' the high
!      `N/2' elements of the vector are extracted, converted and widened.
!      In the case of `VEC_UNPACK_LO_EXPR' the low `N/2' elements of the
       vector are extracted, converted and widened.
  
! `VEC_PACK_TRUNC_EXPR'
!      This node represents packing of truncated elements of the two
!      input vectors into the output vector.  Input operands are vectors
!      that contain the same number of elements of the same integral or
!      floating point type.  The result is a vector that contains twice
!      as many elements of an integral or floating point type whose size
!      is half as wide. The elements of the two vectors are demoted and
       merged (concatenated) to form the output vector.
  
! `VEC_PACK_SAT_EXPR'
       This node represents packing of elements of the two input vectors
       into the output vector using saturation.  Input operands are
       vectors that contain the same number of elements of the same
--- 9014,9066 ----
       undefined if the second operand is larger than or equal to the
       first operand's type size.
  
! 'VEC_WIDEN_MULT_HI_EXPR'
! 'VEC_WIDEN_MULT_LO_EXPR'
       These nodes represent widening vector multiplication of the high
       and low parts of the two input vectors, respectively.  Their
!      operands are vectors that contain the same number of elements ('N')
!      of the same integral type.  The result is a vector that contains
!      half as many elements, of an integral type whose size is twice as
!      wide.  In the case of 'VEC_WIDEN_MULT_HI_EXPR' the high 'N/2'
!      elements of the two vector are multiplied to produce the vector of
!      'N/2' products.  In the case of 'VEC_WIDEN_MULT_LO_EXPR' the low
!      'N/2' elements of the two vector are multiplied to produce the
!      vector of 'N/2' products.
  
! 'VEC_UNPACK_HI_EXPR'
! 'VEC_UNPACK_LO_EXPR'
       These nodes represent unpacking of the high and low parts of the
       input vector, respectively.  The single operand is a vector that
!      contains 'N' elements of the same integral or floating point type.
       The result is a vector that contains half as many elements, of an
       integral or floating point type whose size is twice as wide.  In
!      the case of 'VEC_UNPACK_HI_EXPR' the high 'N/2' elements of the
       vector are extracted and widened (promoted).  In the case of
!      'VEC_UNPACK_LO_EXPR' the low 'N/2' elements of the vector are
       extracted and widened (promoted).
  
! 'VEC_UNPACK_FLOAT_HI_EXPR'
! 'VEC_UNPACK_FLOAT_LO_EXPR'
       These nodes represent unpacking of the high and low parts of the
       input vector, where the values are converted from fixed point to
!      floating point.  The single operand is a vector that contains 'N'
       elements of the same integral type.  The result is a vector that
       contains half as many elements of a floating point type whose size
!      is twice as wide.  In the case of 'VEC_UNPACK_HI_EXPR' the high
!      'N/2' elements of the vector are extracted, converted and widened.
!      In the case of 'VEC_UNPACK_LO_EXPR' the low 'N/2' elements of the
       vector are extracted, converted and widened.
  
! 'VEC_PACK_TRUNC_EXPR'
!      This node represents packing of truncated elements of the two input
!      vectors into the output vector.  Input operands are vectors that
!      contain the same number of elements of the same integral or
!      floating point type.  The result is a vector that contains twice as
!      many elements of an integral or floating point type whose size is
!      half as wide.  The elements of the two vectors are demoted and
       merged (concatenated) to form the output vector.
  
! 'VEC_PACK_SAT_EXPR'
       This node represents packing of elements of the two input vectors
       into the output vector using saturation.  Input operands are
       vectors that contain the same number of elements of the same
*************** File: gccint.info,  Node: Vectors,  Prev
*** 9226,9232 ****
       elements of the two vectors are demoted and merged (concatenated)
       to form the output vector.
  
! `VEC_PACK_FIX_TRUNC_EXPR'
       This node represents packing of elements of the two input vectors
       into the output vector, where the values are converted from
       floating point to fixed point.  Input operands are vectors that
--- 9069,9075 ----
       elements of the two vectors are demoted and merged (concatenated)
       to form the output vector.
  
! 'VEC_PACK_FIX_TRUNC_EXPR'
       This node represents packing of elements of the two input vectors
       into the output vector, where the values are converted from
       floating point to fixed point.  Input operands are vectors that
*************** File: gccint.info,  Node: Vectors,  Prev
*** 9235,9262 ****
       integral type whose size is half as wide.  The elements of the two
       vectors are merged (concatenated) to form the output vector.
  
! `VEC_COND_EXPR'
!      These nodes represent `?:' expressions.  The three operands must be
       vectors of the same size and number of elements.  The second and
       third operands must have the same type as the entire expression.
!      The first operand is of signed integral vector type.  If an
!      element of the first operand evaluates to a zero value, the
!      corresponding element of the result is taken from the third
!      operand. If it evaluates to a minus one value, it is taken from
!      the second operand. It should never evaluate to any other value
!      currently, but optimizations should not rely on that property. In
!      contrast with a `COND_EXPR', all operands are always evaluated.
  
! `SAD_EXPR'
       This node represents the Sum of Absolute Differences operation.
       The three operands must be vectors of integral types.  The first
!      and second operand must have the same type.  The size of the
!      vector element of the third operand must be at lease twice of the
!      size of the vector element of the first and second one.  The SAD
!      is calculated between the first and second operands, added to the
       third operand, and returned.
  
- 
  
  File: gccint.info,  Node: Statements,  Next: Functions,  Prev: Expression trees,  Up: GENERIC
  
--- 9078,9104 ----
       integral type whose size is half as wide.  The elements of the two
       vectors are merged (concatenated) to form the output vector.
  
! 'VEC_COND_EXPR'
!      These nodes represent '?:' expressions.  The three operands must be
       vectors of the same size and number of elements.  The second and
       third operands must have the same type as the entire expression.
!      The first operand is of signed integral vector type.  If an element
!      of the first operand evaluates to a zero value, the corresponding
!      element of the result is taken from the third operand.  If it
!      evaluates to a minus one value, it is taken from the second
!      operand.  It should never evaluate to any other value currently,
!      but optimizations should not rely on that property.  In contrast
!      with a 'COND_EXPR', all operands are always evaluated.
  
! 'SAD_EXPR'
       This node represents the Sum of Absolute Differences operation.
       The three operands must be vectors of integral types.  The first
!      and second operand must have the same type.  The size of the vector
!      element of the third operand must be at lease twice of the size of
!      the vector element of the first and second one.  The SAD is
!      calculated between the first and second operands, added to the
       third operand, and returned.
  
  
  File: gccint.info,  Node: Statements,  Next: Functions,  Prev: Expression trees,  Up: GENERIC
  
*************** File: gccint.info,  Node: Statements,  N
*** 9264,9271 ****
  ===============
  
  Most statements in GIMPLE are assignment statements, represented by
! `GIMPLE_ASSIGN'.  No other C expressions can appear at statement level;
! a reference to a volatile object is converted into a `GIMPLE_ASSIGN'.
  
   There are also several varieties of complex statements.
  
--- 9106,9113 ----
  ===============
  
  Most statements in GIMPLE are assignment statements, represented by
! 'GIMPLE_ASSIGN'.  No other C expressions can appear at statement level;
! a reference to a volatile object is converted into a 'GIMPLE_ASSIGN'.
  
   There are also several varieties of complex statements.
  
*************** File: gccint.info,  Node: Basic Statemen
*** 9286,9381 ****
  10.7.1 Basic Statements
  -----------------------
  
! `ASM_EXPR'
       Used to represent an inline assembly statement.  For an inline
       assembly statement like:
            asm ("mov x, y");
!      The `ASM_STRING' macro will return a `STRING_CST' node for `"mov
!      x, y"'.  If the original statement made use of the
!      extended-assembly syntax, then `ASM_OUTPUTS', `ASM_INPUTS', and
!      `ASM_CLOBBERS' will be the outputs, inputs, and clobbers for the
!      statement, represented as `STRING_CST' nodes.  The
!      extended-assembly syntax looks like:
            asm ("fsinx %1,%0" : "=f" (result) : "f" (angle));
!      The first string is the `ASM_STRING', containing the instruction
       template.  The next two strings are the output and inputs,
       respectively; this statement has no clobbers.  As this example
!      indicates, "plain" assembly statements are merely a special case
!      of extended assembly statements; they have no cv-qualifiers,
!      outputs, inputs, or clobbers.  All of the strings will be
!      `NUL'-terminated, and will contain no embedded `NUL'-characters.
  
!      If the assembly statement is declared `volatile', or if the
       statement was not an extended assembly statement, and is therefore
!      implicitly volatile, then the predicate `ASM_VOLATILE_P' will hold
!      of the `ASM_EXPR'.
  
! `DECL_EXPR'
!      Used to represent a local declaration.  The `DECL_EXPR_DECL' macro
!      can be used to obtain the entity declared.  This declaration may
!      be a `LABEL_DECL', indicating that the label declared is a local
!      label.  (As an extension, GCC allows the declaration of labels
!      with scope.)  In C, this declaration may be a `FUNCTION_DECL',
       indicating the use of the GCC nested function extension.  For more
       information, *note Functions::.
  
! `LABEL_EXPR'
!      Used to represent a label.  The `LABEL_DECL' declared by this
!      statement can be obtained with the `LABEL_EXPR_LABEL' macro.  The
!      `IDENTIFIER_NODE' giving the name of the label can be obtained from
!      the `LABEL_DECL' with `DECL_NAME'.
  
! `GOTO_EXPR'
!      Used to represent a `goto' statement.  The `GOTO_DESTINATION' will
!      usually be a `LABEL_DECL'.  However, if the "computed goto"
!      extension has been used, the `GOTO_DESTINATION' will be an
       arbitrary expression indicating the destination.  This expression
       will always have pointer type.
  
! `RETURN_EXPR'
!      Used to represent a `return' statement.  Operand 0 represents the
!      value to return.  It should either be the `RESULT_DECL' for the
!      containing function, or a `MODIFY_EXPR' or `INIT_EXPR' setting the
!      function's `RESULT_DECL'.  It will be `NULL_TREE' if the statement
       was just
            return;
  
! `LOOP_EXPR'
!      These nodes represent "infinite" loops.  The `LOOP_EXPR_BODY'
       represents the body of the loop.  It should be executed forever,
!      unless an `EXIT_EXPR' is encountered.
  
! `EXIT_EXPR'
       These nodes represent conditional exits from the nearest enclosing
!      `LOOP_EXPR'.  The single operand is the condition; if it is
!      nonzero, then the loop should be exited.  An `EXIT_EXPR' will only
!      appear within a `LOOP_EXPR'.
  
! `SWITCH_STMT'
!      Used to represent a `switch' statement.  The `SWITCH_STMT_COND' is
       the expression on which the switch is occurring.  See the
!      documentation for an `IF_STMT' for more information on the
!      representation used for the condition.  The `SWITCH_STMT_BODY' is
!      the body of the switch statement.   The `SWITCH_STMT_TYPE' is the
       original type of switch expression as given in the source, before
       any compiler conversions.
  
! `CASE_LABEL_EXPR'
!      Use to represent a `case' label, range of `case' labels, or a
!      `default' label.  If `CASE_LOW' is `NULL_TREE', then this is a
!      `default' label.  Otherwise, if `CASE_HIGH' is `NULL_TREE', then
!      this is an ordinary `case' label.  In this case, `CASE_LOW' is an
!      expression giving the value of the label.  Both `CASE_LOW' and
!      `CASE_HIGH' are `INTEGER_CST' nodes.  These values will have the
       same type as the condition expression in the switch statement.
  
!      Otherwise, if both `CASE_LOW' and `CASE_HIGH' are defined, the
       statement is a range of case labels.  Such statements originate
       with the extension that allows users to write things of the form:
            case 2 ... 5:
!      The first value will be `CASE_LOW', while the second will be
!      `CASE_HIGH'.
! 
  
  
  File: gccint.info,  Node: Blocks,  Next: Statement Sequences,  Prev: Basic Statements,  Up: Statements
--- 9128,9228 ----
  10.7.1 Basic Statements
  -----------------------
  
! 'ASM_EXPR'
! 
       Used to represent an inline assembly statement.  For an inline
       assembly statement like:
            asm ("mov x, y");
!      The 'ASM_STRING' macro will return a 'STRING_CST' node for '"mov x,
!      y"'.  If the original statement made use of the extended-assembly
!      syntax, then 'ASM_OUTPUTS', 'ASM_INPUTS', and 'ASM_CLOBBERS' will
!      be the outputs, inputs, and clobbers for the statement, represented
!      as 'STRING_CST' nodes.  The extended-assembly syntax looks like:
            asm ("fsinx %1,%0" : "=f" (result) : "f" (angle));
!      The first string is the 'ASM_STRING', containing the instruction
       template.  The next two strings are the output and inputs,
       respectively; this statement has no clobbers.  As this example
!      indicates, "plain" assembly statements are merely a special case of
!      extended assembly statements; they have no cv-qualifiers, outputs,
!      inputs, or clobbers.  All of the strings will be 'NUL'-terminated,
!      and will contain no embedded 'NUL'-characters.
  
!      If the assembly statement is declared 'volatile', or if the
       statement was not an extended assembly statement, and is therefore
!      implicitly volatile, then the predicate 'ASM_VOLATILE_P' will hold
!      of the 'ASM_EXPR'.
  
! 'DECL_EXPR'
! 
!      Used to represent a local declaration.  The 'DECL_EXPR_DECL' macro
!      can be used to obtain the entity declared.  This declaration may be
!      a 'LABEL_DECL', indicating that the label declared is a local
!      label.  (As an extension, GCC allows the declaration of labels with
!      scope.)  In C, this declaration may be a 'FUNCTION_DECL',
       indicating the use of the GCC nested function extension.  For more
       information, *note Functions::.
  
! 'LABEL_EXPR'
  
!      Used to represent a label.  The 'LABEL_DECL' declared by this
!      statement can be obtained with the 'LABEL_EXPR_LABEL' macro.  The
!      'IDENTIFIER_NODE' giving the name of the label can be obtained from
!      the 'LABEL_DECL' with 'DECL_NAME'.
! 
! 'GOTO_EXPR'
! 
!      Used to represent a 'goto' statement.  The 'GOTO_DESTINATION' will
!      usually be a 'LABEL_DECL'.  However, if the "computed goto"
!      extension has been used, the 'GOTO_DESTINATION' will be an
       arbitrary expression indicating the destination.  This expression
       will always have pointer type.
  
! 'RETURN_EXPR'
! 
!      Used to represent a 'return' statement.  Operand 0 represents the
!      value to return.  It should either be the 'RESULT_DECL' for the
!      containing function, or a 'MODIFY_EXPR' or 'INIT_EXPR' setting the
!      function's 'RESULT_DECL'.  It will be 'NULL_TREE' if the statement
       was just
            return;
  
! 'LOOP_EXPR'
!      These nodes represent "infinite" loops.  The 'LOOP_EXPR_BODY'
       represents the body of the loop.  It should be executed forever,
!      unless an 'EXIT_EXPR' is encountered.
  
! 'EXIT_EXPR'
       These nodes represent conditional exits from the nearest enclosing
!      'LOOP_EXPR'.  The single operand is the condition; if it is
!      nonzero, then the loop should be exited.  An 'EXIT_EXPR' will only
!      appear within a 'LOOP_EXPR'.
  
! 'SWITCH_STMT'
! 
!      Used to represent a 'switch' statement.  The 'SWITCH_STMT_COND' is
       the expression on which the switch is occurring.  See the
!      documentation for an 'IF_STMT' for more information on the
!      representation used for the condition.  The 'SWITCH_STMT_BODY' is
!      the body of the switch statement.  The 'SWITCH_STMT_TYPE' is the
       original type of switch expression as given in the source, before
       any compiler conversions.
  
! 'CASE_LABEL_EXPR'
! 
!      Use to represent a 'case' label, range of 'case' labels, or a
!      'default' label.  If 'CASE_LOW' is 'NULL_TREE', then this is a
!      'default' label.  Otherwise, if 'CASE_HIGH' is 'NULL_TREE', then
!      this is an ordinary 'case' label.  In this case, 'CASE_LOW' is an
!      expression giving the value of the label.  Both 'CASE_LOW' and
!      'CASE_HIGH' are 'INTEGER_CST' nodes.  These values will have the
       same type as the condition expression in the switch statement.
  
!      Otherwise, if both 'CASE_LOW' and 'CASE_HIGH' are defined, the
       statement is a range of case labels.  Such statements originate
       with the extension that allows users to write things of the form:
            case 2 ... 5:
!      The first value will be 'CASE_LOW', while the second will be
!      'CASE_HIGH'.
  
  
  File: gccint.info,  Node: Blocks,  Next: Statement Sequences,  Prev: Basic Statements,  Up: Statements
*************** File: gccint.info,  Node: Blocks,  Next:
*** 9384,9410 ****
  -------------
  
  Block scopes and the variables they declare in GENERIC are expressed
! using the `BIND_EXPR' code, which in previous versions of GCC was
  primarily used for the C statement-expression extension.
  
!  Variables in a block are collected into `BIND_EXPR_VARS' in
! declaration order through their `TREE_CHAIN' field.  Any runtime
! initialization is moved out of `DECL_INITIAL' and into a statement in
! the controlled block.  When gimplifying from C or C++, this
! initialization replaces the `DECL_STMT'.  These variables will never
! require cleanups.  The scope of these variables is just the body
  
   Variable-length arrays (VLAs) complicate this process, as their size
  often refers to variables initialized earlier in the block.  To handle
  this, we currently split the block at that point, and move the VLA into
! a new, inner `BIND_EXPR'.  This strategy may change in the future.
  
!  A C++ program will usually contain more `BIND_EXPR's than there are
  syntactic blocks in the source code, since several C++ constructs have
  implicit scopes associated with them.  On the other hand, although the
  C++ front end uses pseudo-scopes to handle cleanups for objects with
  destructors, these don't translate into the GIMPLE form; multiple
! declarations at the same level use the same `BIND_EXPR'.
  
  
  File: gccint.info,  Node: Statement Sequences,  Next: Empty Statements,  Prev: Blocks,  Up: Statements
--- 9231,9257 ----
  -------------
  
  Block scopes and the variables they declare in GENERIC are expressed
! using the 'BIND_EXPR' code, which in previous versions of GCC was
  primarily used for the C statement-expression extension.
  
!  Variables in a block are collected into 'BIND_EXPR_VARS' in declaration
! order through their 'TREE_CHAIN' field.  Any runtime initialization is
! moved out of 'DECL_INITIAL' and into a statement in the controlled
! block.  When gimplifying from C or C++, this initialization replaces the
! 'DECL_STMT'.  These variables will never require cleanups.  The scope of
! these variables is just the body
  
   Variable-length arrays (VLAs) complicate this process, as their size
  often refers to variables initialized earlier in the block.  To handle
  this, we currently split the block at that point, and move the VLA into
! a new, inner 'BIND_EXPR'.  This strategy may change in the future.
  
!  A C++ program will usually contain more 'BIND_EXPR's than there are
  syntactic blocks in the source code, since several C++ constructs have
  implicit scopes associated with them.  On the other hand, although the
  C++ front end uses pseudo-scopes to handle cleanups for objects with
  destructors, these don't translate into the GIMPLE form; multiple
! declarations at the same level use the same 'BIND_EXPR'.
  
  
  File: gccint.info,  Node: Statement Sequences,  Next: Empty Statements,  Prev: Blocks,  Up: Statements
*************** File: gccint.info,  Node: Statement Sequ
*** 9413,9420 ****
  --------------------------
  
  Multiple statements at the same nesting level are collected into a
! `STATEMENT_LIST'.  Statement lists are modified and traversed using the
! interface in `tree-iterator.h'.
  
  
  File: gccint.info,  Node: Empty Statements,  Next: Jumps,  Prev: Statement Sequences,  Up: Statements
--- 9260,9267 ----
  --------------------------
  
  Multiple statements at the same nesting level are collected into a
! 'STATEMENT_LIST'.  Statement lists are modified and traversed using the
! interface in 'tree-iterator.h'.
  
  
  File: gccint.info,  Node: Empty Statements,  Next: Jumps,  Prev: Statement Sequences,  Up: Statements
*************** File: gccint.info,  Node: Empty Statemen
*** 9422,9435 ****
  10.7.4 Empty Statements
  -----------------------
  
! Whenever possible, statements with no effect are discarded.  But if
! they are nested within another construct which cannot be discarded for
! some reason, they are instead replaced with an empty statement,
! generated by `build_empty_stmt'.  Initially, all empty statements were
! shared, after the pattern of the Java front end, but this caused a lot
! of trouble in practice.
  
!  An empty statement is represented as `(void)0'.
  
  
  File: gccint.info,  Node: Jumps,  Next: Cleanups,  Prev: Empty Statements,  Up: Statements
--- 9269,9282 ----
  10.7.4 Empty Statements
  -----------------------
  
! Whenever possible, statements with no effect are discarded.  But if they
! are nested within another construct which cannot be discarded for some
! reason, they are instead replaced with an empty statement, generated by
! 'build_empty_stmt'.  Initially, all empty statements were shared, after
! the pattern of the Java front end, but this caused a lot of trouble in
! practice.
  
!  An empty statement is represented as '(void)0'.
  
  
  File: gccint.info,  Node: Jumps,  Next: Cleanups,  Prev: Empty Statements,  Up: Statements
*************** File: gccint.info,  Node: Jumps,  Next:
*** 9437,9453 ****
  10.7.5 Jumps
  ------------
  
! Other jumps are expressed by either `GOTO_EXPR' or `RETURN_EXPR'.
  
!  The operand of a `GOTO_EXPR' must be either a label or a variable
  containing the address to jump to.
  
!  The operand of a `RETURN_EXPR' is either `NULL_TREE', `RESULT_DECL',
! or a `MODIFY_EXPR' which sets the return value.  It would be nice to
! move the `MODIFY_EXPR' into a separate statement, but the special
! return semantics in `expand_return' make that difficult.  It may still
! happen in the future, perhaps by moving most of that logic into
! `expand_assignment'.
  
  
  File: gccint.info,  Node: Cleanups,  Next: OpenMP,  Prev: Jumps,  Up: Statements
--- 9284,9300 ----
  10.7.5 Jumps
  ------------
  
! Other jumps are expressed by either 'GOTO_EXPR' or 'RETURN_EXPR'.
  
!  The operand of a 'GOTO_EXPR' must be either a label or a variable
  containing the address to jump to.
  
!  The operand of a 'RETURN_EXPR' is either 'NULL_TREE', 'RESULT_DECL', or
! a 'MODIFY_EXPR' which sets the return value.  It would be nice to move
! the 'MODIFY_EXPR' into a separate statement, but the special return
! semantics in 'expand_return' make that difficult.  It may still happen
! in the future, perhaps by moving most of that logic into
! 'expand_assignment'.
  
  
  File: gccint.info,  Node: Cleanups,  Next: OpenMP,  Prev: Jumps,  Up: Statements
*************** File: gccint.info,  Node: Cleanups,  Nex
*** 9456,9462 ****
  ---------------
  
  Destructors for local C++ objects and similar dynamic cleanups are
! represented in GIMPLE by a `TRY_FINALLY_EXPR'.  `TRY_FINALLY_EXPR' has
  two operands, both of which are a sequence of statements to execute.
  The first sequence is executed.  When it completes the second sequence
  is executed.
--- 9303,9309 ----
  ---------------
  
  Destructors for local C++ objects and similar dynamic cleanups are
! represented in GIMPLE by a 'TRY_FINALLY_EXPR'.  'TRY_FINALLY_EXPR' has
  two operands, both of which are a sequence of statements to execute.
  The first sequence is executed.  When it completes the second sequence
  is executed.
*************** is executed.
*** 9465,9496 ****
  
    1. Execute the last statement in the sequence and fall off the end.
  
!   2. Execute a goto statement (`GOTO_EXPR') to an ordinary label
!      outside the sequence.
  
!   3. Execute a return statement (`RETURN_EXPR').
  
    4. Throw an exception.  This is currently not explicitly represented
       in GIMPLE.
  
- 
   The second sequence is not executed if the first sequence completes by
! calling `setjmp' or `exit' or any other function that does not return.
! The second sequence is also not executed if the first sequence
! completes via a non-local goto or a computed goto (in general the
! compiler does not know whether such a goto statement exits the first
! sequence or not, so we assume that it doesn't).
  
   After the second sequence is executed, if it completes normally by
  falling off the end, execution continues wherever the first sequence
  would have continued, by falling off the end, or doing a goto, etc.
  
!  `TRY_FINALLY_EXPR' complicates the flow graph, since the cleanup needs
  to appear on every edge out of the controlled block; this reduces the
  freedom to move code across these edges.  Therefore, the EH lowering
  pass which runs before most of the optimization passes eliminates these
  expressions by explicitly adding the cleanup to each edge.  Rethrowing
! the exception is represented using `RESX_EXPR'.
  
  
  File: gccint.info,  Node: OpenMP,  Next: OpenACC,  Prev: Cleanups,  Up: Statements
--- 9312,9342 ----
  
    1. Execute the last statement in the sequence and fall off the end.
  
!   2. Execute a goto statement ('GOTO_EXPR') to an ordinary label outside
!      the sequence.
  
!   3. Execute a return statement ('RETURN_EXPR').
  
    4. Throw an exception.  This is currently not explicitly represented
       in GIMPLE.
  
   The second sequence is not executed if the first sequence completes by
! calling 'setjmp' or 'exit' or any other function that does not return.
! The second sequence is also not executed if the first sequence completes
! via a non-local goto or a computed goto (in general the compiler does
! not know whether such a goto statement exits the first sequence or not,
! so we assume that it doesn't).
  
   After the second sequence is executed, if it completes normally by
  falling off the end, execution continues wherever the first sequence
  would have continued, by falling off the end, or doing a goto, etc.
  
!  'TRY_FINALLY_EXPR' complicates the flow graph, since the cleanup needs
  to appear on every edge out of the controlled block; this reduces the
  freedom to move code across these edges.  Therefore, the EH lowering
  pass which runs before most of the optimization passes eliminates these
  expressions by explicitly adding the cleanup to each edge.  Rethrowing
! the exception is represented using 'RESX_EXPR'.
  
  
  File: gccint.info,  Node: OpenMP,  Next: OpenACC,  Prev: Cleanups,  Up: Statements
*************** File: gccint.info,  Node: OpenMP,  Next:
*** 9498,9619 ****
  10.7.7 OpenMP
  -------------
  
! All the statements starting with `OMP_' represent directives and
! clauses used by the OpenMP API `http://www.openmp.org/'.
  
! `OMP_PARALLEL'
!      Represents `#pragma omp parallel [clause1 ... clauseN]'. It has
       four operands:
  
!      Operand `OMP_PARALLEL_BODY' is valid while in GENERIC and High
       GIMPLE forms.  It contains the body of code to be executed by all
!      the threads.  During GIMPLE lowering, this operand becomes `NULL'
!      and the body is emitted linearly after `OMP_PARALLEL'.
  
!      Operand `OMP_PARALLEL_CLAUSES' is the list of clauses associated
       with the directive.
  
!      Operand `OMP_PARALLEL_FN' is created by `pass_lower_omp', it
!      contains the `FUNCTION_DECL' for the function that will contain
!      the body of the parallel region.
  
!      Operand `OMP_PARALLEL_DATA_ARG' is also created by
!      `pass_lower_omp'. If there are shared variables to be communicated
!      to the children threads, this operand will contain the `VAR_DECL'
       that contains all the shared values and variables.
  
! `OMP_FOR'
!      Represents `#pragma omp for [clause1 ... clauseN]'.  It has six
       operands:
  
!      Operand `OMP_FOR_BODY' contains the loop body.
  
!      Operand `OMP_FOR_CLAUSES' is the list of clauses associated with
       the directive.
  
!      Operand `OMP_FOR_INIT' is the loop initialization code of the form
!      `VAR = N1'.
  
!      Operand `OMP_FOR_COND' is the loop conditional expression of the
!      form `VAR {<,>,<=,>=} N2'.
  
!      Operand `OMP_FOR_INCR' is the loop index increment of the form
!      `VAR {+=,-=} INCR'.
  
!      Operand `OMP_FOR_PRE_BODY' contains side-effect code from operands
!      `OMP_FOR_INIT', `OMP_FOR_COND' and `OMP_FOR_INC'.  These
!      side-effects are part of the `OMP_FOR' block but must be evaluated
       before the start of loop body.
  
!      The loop index variable `VAR' must be a signed integer variable,
!      which is implicitly private to each thread.  Bounds `N1' and `N2'
!      and the increment expression `INCR' are required to be loop
       invariant integer expressions that are evaluated without any
!      synchronization. The evaluation order, frequency of evaluation and
       side-effects are unspecified by the standard.
  
! `OMP_SECTIONS'
!      Represents `#pragma omp sections [clause1 ... clauseN]'.
  
!      Operand `OMP_SECTIONS_BODY' contains the sections body, which in
!      turn contains a set of `OMP_SECTION' nodes for each of the
!      concurrent sections delimited by `#pragma omp section'.
  
!      Operand `OMP_SECTIONS_CLAUSES' is the list of clauses associated
       with the directive.
  
! `OMP_SECTION'
!      Section delimiter for `OMP_SECTIONS'.
  
! `OMP_SINGLE'
!      Represents `#pragma omp single'.
  
!      Operand `OMP_SINGLE_BODY' contains the body of code to be executed
       by a single thread.
  
!      Operand `OMP_SINGLE_CLAUSES' is the list of clauses associated
!      with the directive.
  
! `OMP_MASTER'
!      Represents `#pragma omp master'.
  
!      Operand `OMP_MASTER_BODY' contains the body of code to be executed
       by the master thread.
  
! `OMP_ORDERED'
!      Represents `#pragma omp ordered'.
  
!      Operand `OMP_ORDERED_BODY' contains the body of code to be
!      executed in the sequential order dictated by the loop index
!      variable.
  
! `OMP_CRITICAL'
!      Represents `#pragma omp critical [name]'.
  
!      Operand `OMP_CRITICAL_BODY' is the critical section.
  
!      Operand `OMP_CRITICAL_NAME' is an optional identifier to label the
       critical section.
  
! `OMP_RETURN'
       This does not represent any OpenMP directive, it is an artificial
!      marker to indicate the end of the body of an OpenMP. It is used by
!      the flow graph (`tree-cfg.c') and OpenMP region building code
!      (`omp-low.c').
  
! `OMP_CONTINUE'
!      Similarly, this instruction does not represent an OpenMP
!      directive, it is used by `OMP_FOR' (and similar codes) as well as
!      `OMP_SECTIONS' to mark the place where the code needs to loop to
       the next iteration, or the next section, respectively.
  
!      In some cases, `OMP_CONTINUE' is placed right before `OMP_RETURN'.
       But if there are cleanups that need to occur right after the
!      looping body, it will be emitted between `OMP_CONTINUE' and
!      `OMP_RETURN'.
  
! `OMP_ATOMIC'
!      Represents `#pragma omp atomic'.
  
       Operand 0 is the address at which the atomic operation is to be
       performed.
--- 9344,9475 ----
  10.7.7 OpenMP
  -------------
  
! All the statements starting with 'OMP_' represent directives and clauses
! used by the OpenMP API <http://www.openmp.org/>.
  
! 'OMP_PARALLEL'
! 
!      Represents '#pragma omp parallel [clause1 ... clauseN]'.  It has
       four operands:
  
!      Operand 'OMP_PARALLEL_BODY' is valid while in GENERIC and High
       GIMPLE forms.  It contains the body of code to be executed by all
!      the threads.  During GIMPLE lowering, this operand becomes 'NULL'
!      and the body is emitted linearly after 'OMP_PARALLEL'.
  
!      Operand 'OMP_PARALLEL_CLAUSES' is the list of clauses associated
       with the directive.
  
!      Operand 'OMP_PARALLEL_FN' is created by 'pass_lower_omp', it
!      contains the 'FUNCTION_DECL' for the function that will contain the
!      body of the parallel region.
  
!      Operand 'OMP_PARALLEL_DATA_ARG' is also created by
!      'pass_lower_omp'.  If there are shared variables to be communicated
!      to the children threads, this operand will contain the 'VAR_DECL'
       that contains all the shared values and variables.
  
! 'OMP_FOR'
! 
!      Represents '#pragma omp for [clause1 ... clauseN]'.  It has six
       operands:
  
!      Operand 'OMP_FOR_BODY' contains the loop body.
  
!      Operand 'OMP_FOR_CLAUSES' is the list of clauses associated with
       the directive.
  
!      Operand 'OMP_FOR_INIT' is the loop initialization code of the form
!      'VAR = N1'.
  
!      Operand 'OMP_FOR_COND' is the loop conditional expression of the
!      form 'VAR {<,>,<=,>=} N2'.
  
!      Operand 'OMP_FOR_INCR' is the loop index increment of the form 'VAR
!      {+=,-=} INCR'.
  
!      Operand 'OMP_FOR_PRE_BODY' contains side-effect code from operands
!      'OMP_FOR_INIT', 'OMP_FOR_COND' and 'OMP_FOR_INC'.  These
!      side-effects are part of the 'OMP_FOR' block but must be evaluated
       before the start of loop body.
  
!      The loop index variable 'VAR' must be a signed integer variable,
!      which is implicitly private to each thread.  Bounds 'N1' and 'N2'
!      and the increment expression 'INCR' are required to be loop
       invariant integer expressions that are evaluated without any
!      synchronization.  The evaluation order, frequency of evaluation and
       side-effects are unspecified by the standard.
  
! 'OMP_SECTIONS'
  
!      Represents '#pragma omp sections [clause1 ... clauseN]'.
  
!      Operand 'OMP_SECTIONS_BODY' contains the sections body, which in
!      turn contains a set of 'OMP_SECTION' nodes for each of the
!      concurrent sections delimited by '#pragma omp section'.
! 
!      Operand 'OMP_SECTIONS_CLAUSES' is the list of clauses associated
       with the directive.
  
! 'OMP_SECTION'
  
!      Section delimiter for 'OMP_SECTIONS'.
  
! 'OMP_SINGLE'
! 
!      Represents '#pragma omp single'.
! 
!      Operand 'OMP_SINGLE_BODY' contains the body of code to be executed
       by a single thread.
  
!      Operand 'OMP_SINGLE_CLAUSES' is the list of clauses associated with
!      the directive.
  
! 'OMP_MASTER'
  
!      Represents '#pragma omp master'.
! 
!      Operand 'OMP_MASTER_BODY' contains the body of code to be executed
       by the master thread.
  
! 'OMP_ORDERED'
  
!      Represents '#pragma omp ordered'.
  
!      Operand 'OMP_ORDERED_BODY' contains the body of code to be executed
!      in the sequential order dictated by the loop index variable.
  
! 'OMP_CRITICAL'
  
!      Represents '#pragma omp critical [name]'.
! 
!      Operand 'OMP_CRITICAL_BODY' is the critical section.
! 
!      Operand 'OMP_CRITICAL_NAME' is an optional identifier to label the
       critical section.
  
! 'OMP_RETURN'
! 
       This does not represent any OpenMP directive, it is an artificial
!      marker to indicate the end of the body of an OpenMP.  It is used by
!      the flow graph ('tree-cfg.c') and OpenMP region building code
!      ('omp-low.c').
  
! 'OMP_CONTINUE'
! 
!      Similarly, this instruction does not represent an OpenMP directive,
!      it is used by 'OMP_FOR' (and similar codes) as well as
!      'OMP_SECTIONS' to mark the place where the code needs to loop to
       the next iteration, or the next section, respectively.
  
!      In some cases, 'OMP_CONTINUE' is placed right before 'OMP_RETURN'.
       But if there are cleanups that need to occur right after the
!      looping body, it will be emitted between 'OMP_CONTINUE' and
!      'OMP_RETURN'.
  
! 'OMP_ATOMIC'
! 
!      Represents '#pragma omp atomic'.
  
       Operand 0 is the address at which the atomic operation is to be
       performed.
*************** clauses used by the OpenMP API `http://w
*** 9624,9649 ****
       compare-and-swap loop is attempted.  If that also fails, a regular
       critical section around the expression is used.
  
! `OMP_CLAUSE'
!      Represents clauses associated with one of the `OMP_' directives.
!      Clauses are represented by separate subcodes defined in `tree.h'.
!      Clauses codes can be one of: `OMP_CLAUSE_PRIVATE',
!      `OMP_CLAUSE_SHARED', `OMP_CLAUSE_FIRSTPRIVATE',
!      `OMP_CLAUSE_LASTPRIVATE', `OMP_CLAUSE_COPYIN',
!      `OMP_CLAUSE_COPYPRIVATE', `OMP_CLAUSE_IF',
!      `OMP_CLAUSE_NUM_THREADS', `OMP_CLAUSE_SCHEDULE',
!      `OMP_CLAUSE_NOWAIT', `OMP_CLAUSE_ORDERED', `OMP_CLAUSE_DEFAULT',
!      `OMP_CLAUSE_REDUCTION', `OMP_CLAUSE_COLLAPSE', `OMP_CLAUSE_UNTIED',
!      `OMP_CLAUSE_FINAL', and `OMP_CLAUSE_MERGEABLE'.  Each code
!      represents the corresponding OpenMP clause.
  
!      Clauses associated with the same directive are chained together
!      via `OMP_CLAUSE_CHAIN'. Those clauses that accept a list of
!      variables are restricted to exactly one, accessed with
!      `OMP_CLAUSE_VAR'.  Therefore, multiple variables under the same
!      clause `C' need to be represented as multiple `C' clauses chained
!      together.  This facilitates adding new clauses during compilation.
  
  
  
  File: gccint.info,  Node: OpenACC,  Prev: OpenMP,  Up: Statements
--- 9480,9505 ----
       compare-and-swap loop is attempted.  If that also fails, a regular
       critical section around the expression is used.
  
! 'OMP_CLAUSE'
  
!      Represents clauses associated with one of the 'OMP_' directives.
!      Clauses are represented by separate subcodes defined in 'tree.h'.
!      Clauses codes can be one of: 'OMP_CLAUSE_PRIVATE',
!      'OMP_CLAUSE_SHARED', 'OMP_CLAUSE_FIRSTPRIVATE',
!      'OMP_CLAUSE_LASTPRIVATE', 'OMP_CLAUSE_COPYIN',
!      'OMP_CLAUSE_COPYPRIVATE', 'OMP_CLAUSE_IF',
!      'OMP_CLAUSE_NUM_THREADS', 'OMP_CLAUSE_SCHEDULE',
!      'OMP_CLAUSE_NOWAIT', 'OMP_CLAUSE_ORDERED', 'OMP_CLAUSE_DEFAULT',
!      'OMP_CLAUSE_REDUCTION', 'OMP_CLAUSE_COLLAPSE', 'OMP_CLAUSE_UNTIED',
!      'OMP_CLAUSE_FINAL', and 'OMP_CLAUSE_MERGEABLE'.  Each code
!      represents the corresponding OpenMP clause.
  
+      Clauses associated with the same directive are chained together via
+      'OMP_CLAUSE_CHAIN'.  Those clauses that accept a list of variables
+      are restricted to exactly one, accessed with 'OMP_CLAUSE_VAR'.
+      Therefore, multiple variables under the same clause 'C' need to be
+      represented as multiple 'C' clauses chained together.  This
+      facilitates adding new clauses during compilation.
  
  
  File: gccint.info,  Node: OpenACC,  Prev: OpenMP,  Up: Statements
*************** File: gccint.info,  Node: OpenACC,  Prev
*** 9651,9691 ****
  10.7.8 OpenACC
  --------------
  
! All the statements starting with `OACC_' represent directives and
! clauses used by the OpenACC API `http://www.openacc.org/'.
  
! `OACC_CACHE'
!      Represents `#pragma acc cache (var ...)'.
  
! `OACC_DATA'
!      Represents `#pragma acc data [clause1 ... clauseN]'.
  
! `OACC_DECLARE'
!      Represents `#pragma acc declare [clause1 ... clauseN]'.
  
! `OACC_ENTER_DATA'
!      Represents `#pragma acc enter data [clause1 ... clauseN]'.
  
! `OACC_EXIT_DATA'
!      Represents `#pragma acc exit data [clause1 ... clauseN]'.
  
! `OACC_HOST_DATA'
!      Represents `#pragma acc host_data [clause1 ... clauseN]'.
  
! `OACC_KERNELS'
!      Represents `#pragma acc kernels [clause1 ... clauseN]'.
  
! `OACC_LOOP'
!      Represents `#pragma acc loop [clause1 ... clauseN]'.
  
!      See the description of the `OMP_FOR' code.
  
! `OACC_PARALLEL'
!      Represents `#pragma acc parallel [clause1 ... clauseN]'.
  
! `OACC_UPDATE'
!      Represents `#pragma acc update [clause1 ... clauseN]'.
  
  
  
  File: gccint.info,  Node: Functions,  Next: Language-dependent trees,  Prev: Statements,  Up: GENERIC
--- 9507,9556 ----
  10.7.8 OpenACC
  --------------
  
! All the statements starting with 'OACC_' represent directives and
! clauses used by the OpenACC API <http://www.openacc.org/>.
  
! 'OACC_CACHE'
  
!      Represents '#pragma acc cache (var ...)'.
  
! 'OACC_DATA'
  
!      Represents '#pragma acc data [clause1 ... clauseN]'.
  
! 'OACC_DECLARE'
  
!      Represents '#pragma acc declare [clause1 ... clauseN]'.
  
! 'OACC_ENTER_DATA'
  
!      Represents '#pragma acc enter data [clause1 ... clauseN]'.
  
! 'OACC_EXIT_DATA'
  
!      Represents '#pragma acc exit data [clause1 ... clauseN]'.
  
! 'OACC_HOST_DATA'
  
+      Represents '#pragma acc host_data [clause1 ... clauseN]'.
+ 
+ 'OACC_KERNELS'
+ 
+      Represents '#pragma acc kernels [clause1 ... clauseN]'.
+ 
+ 'OACC_LOOP'
+ 
+      Represents '#pragma acc loop [clause1 ... clauseN]'.
+ 
+      See the description of the 'OMP_FOR' code.
+ 
+ 'OACC_PARALLEL'
+ 
+      Represents '#pragma acc parallel [clause1 ... clauseN]'.
+ 
+ 'OACC_UPDATE'
+ 
+      Represents '#pragma acc update [clause1 ... clauseN]'.
  
  
  File: gccint.info,  Node: Functions,  Next: Language-dependent trees,  Prev: Statements,  Up: GENERIC
*************** File: gccint.info,  Node: Functions,  Ne
*** 9693,9699 ****
  10.8 Functions
  ==============
  
! A function is represented by a `FUNCTION_DECL' node.  It stores the
  basic pieces of the function such as body, parameters, and return type
  as well as information on the surrounding context, visibility, and
  linkage.
--- 9558,9564 ----
  10.8 Functions
  ==============
  
! A function is represented by a 'FUNCTION_DECL' node.  It stores the
  basic pieces of the function such as body, parameters, and return type
  as well as information on the surrounding context, visibility, and
  linkage.
*************** File: gccint.info,  Node: Function Basic
*** 9711,9770 ****
  
  A function has four core parts: the name, the parameters, the result,
  and the body.  The following macros and functions access these parts of
! a `FUNCTION_DECL' as well as other basic features:
! `DECL_NAME'
       This macro returns the unqualified name of the function, as an
!      `IDENTIFIER_NODE'.  For an instantiation of a function template,
!      the `DECL_NAME' is the unqualified name of the template, not
!      something like `f<int>'.  The value of `DECL_NAME' is undefined
       when used on a constructor, destructor, overloaded operator, or
       type-conversion operator, or any function that is implicitly
       generated by the compiler.  See below for macros that can be used
       to distinguish these cases.
  
! `DECL_ASSEMBLER_NAME'
       This macro returns the mangled name of the function, also an
!      `IDENTIFIER_NODE'.  This name does not contain leading underscores
       on systems that prefix all identifiers with underscores.  The
       mangled name is computed in the same way on all platforms; if
       special processing is required to deal with the object file format
!      used on a particular platform, it is the responsibility of the
!      back end to perform those modifications.  (Of course, the back end
!      should not modify `DECL_ASSEMBLER_NAME' itself.)
  
!      Using `DECL_ASSEMBLER_NAME' will cause additional memory to be
       allocated (for the mangled name of the entity) so it should be used
       only when emitting assembly code.  It should not be used within the
       optimizers to determine whether or not two declarations are the
!      same, even though some of the existing optimizers do use it in
!      that way.  These uses will be removed over time.
  
! `DECL_ARGUMENTS'
!      This macro returns the `PARM_DECL' for the first argument to the
!      function.  Subsequent `PARM_DECL' nodes can be obtained by
!      following the `TREE_CHAIN' links.
  
! `DECL_RESULT'
!      This macro returns the `RESULT_DECL' for the function.
  
! `DECL_SAVED_TREE'
       This macro returns the complete body of the function.
  
! `TREE_TYPE'
!      This macro returns the `FUNCTION_TYPE' or `METHOD_TYPE' for the
       function.
  
! `DECL_INITIAL'
       A function that has a definition in the current translation unit
!      will have a non-`NULL' `DECL_INITIAL'.  However, back ends should
!      not make use of the particular value given by `DECL_INITIAL'.
  
!      It should contain a tree of `BLOCK' nodes that mirrors the scopes
       that variables are bound in the function.  Each block contains a
       list of decls declared in a basic block, a pointer to a chain of
       blocks at the next lower scope level, then a pointer to the next
!      block at the same level and a backpointer to the parent `BLOCK' or
!      `FUNCTION_DECL'.  So given a function as follows:
  
            void foo()
            {
--- 9576,9635 ----
  
  A function has four core parts: the name, the parameters, the result,
  and the body.  The following macros and functions access these parts of
! a 'FUNCTION_DECL' as well as other basic features:
! 'DECL_NAME'
       This macro returns the unqualified name of the function, as an
!      'IDENTIFIER_NODE'.  For an instantiation of a function template,
!      the 'DECL_NAME' is the unqualified name of the template, not
!      something like 'f<int>'.  The value of 'DECL_NAME' is undefined
       when used on a constructor, destructor, overloaded operator, or
       type-conversion operator, or any function that is implicitly
       generated by the compiler.  See below for macros that can be used
       to distinguish these cases.
  
! 'DECL_ASSEMBLER_NAME'
       This macro returns the mangled name of the function, also an
!      'IDENTIFIER_NODE'.  This name does not contain leading underscores
       on systems that prefix all identifiers with underscores.  The
       mangled name is computed in the same way on all platforms; if
       special processing is required to deal with the object file format
!      used on a particular platform, it is the responsibility of the back
!      end to perform those modifications.  (Of course, the back end
!      should not modify 'DECL_ASSEMBLER_NAME' itself.)
  
!      Using 'DECL_ASSEMBLER_NAME' will cause additional memory to be
       allocated (for the mangled name of the entity) so it should be used
       only when emitting assembly code.  It should not be used within the
       optimizers to determine whether or not two declarations are the
!      same, even though some of the existing optimizers do use it in that
!      way.  These uses will be removed over time.
  
! 'DECL_ARGUMENTS'
!      This macro returns the 'PARM_DECL' for the first argument to the
!      function.  Subsequent 'PARM_DECL' nodes can be obtained by
!      following the 'TREE_CHAIN' links.
  
! 'DECL_RESULT'
!      This macro returns the 'RESULT_DECL' for the function.
  
! 'DECL_SAVED_TREE'
       This macro returns the complete body of the function.
  
! 'TREE_TYPE'
!      This macro returns the 'FUNCTION_TYPE' or 'METHOD_TYPE' for the
       function.
  
! 'DECL_INITIAL'
       A function that has a definition in the current translation unit
!      will have a non-'NULL' 'DECL_INITIAL'.  However, back ends should
!      not make use of the particular value given by 'DECL_INITIAL'.
  
!      It should contain a tree of 'BLOCK' nodes that mirrors the scopes
       that variables are bound in the function.  Each block contains a
       list of decls declared in a basic block, a pointer to a chain of
       blocks at the next lower scope level, then a pointer to the next
!      block at the same level and a backpointer to the parent 'BLOCK' or
!      'FUNCTION_DECL'.  So given a function as follows:
  
            void foo()
            {
*************** a `FUNCTION_DECL' as well as other basic
*** 9794,9848 ****
            BLOCK_SUPERCONTEXT(block_c) = foo;
            DECL_INITIAL(foo) = block_a;
  
- 
  
  File: gccint.info,  Node: Function Properties,  Prev: Function Basics,  Up: Functions
  
  10.8.2 Function Properties
  --------------------------
  
! To determine the scope of a function, you can use the `DECL_CONTEXT'
! macro.  This macro will return the class (either a `RECORD_TYPE' or a
! `UNION_TYPE') or namespace (a `NAMESPACE_DECL') of which the function
! is a member.  For a virtual function, this macro returns the class in
! which the function was actually defined, not the base class in which
! the virtual declaration occurred.
  
!  In C, the `DECL_CONTEXT' for a function maybe another function.  This
  representation indicates that the GNU nested function extension is in
  use.  For details on the semantics of nested functions, see the GCC
  Manual.  The nested function can refer to local variables in its
  containing function.  Such references are not explicitly marked in the
! tree structure; back ends must look at the `DECL_CONTEXT' for the
! referenced `VAR_DECL'.  If the `DECL_CONTEXT' for the referenced
! `VAR_DECL' is not the same as the function currently being processed,
! and neither `DECL_EXTERNAL' nor `TREE_STATIC' hold, then the reference
  is to a local variable in a containing function, and the back end must
  take appropriate action.
  
! `DECL_EXTERNAL'
       This predicate holds if the function is undefined.
  
! `TREE_PUBLIC'
       This predicate holds if the function has external linkage.
  
! `TREE_STATIC'
       This predicate holds if the function has been defined.
  
! `TREE_THIS_VOLATILE'
       This predicate holds if the function does not return normally.
  
! `TREE_READONLY'
       This predicate holds if the function can only read its arguments.
  
! `DECL_PURE_P'
       This predicate holds if the function can only read its arguments,
       but may also read global memory.
  
! `DECL_VIRTUAL_P'
       This predicate holds if the function is virtual.
  
! `DECL_ARTIFICIAL'
       This macro holds if the function was implicitly generated by the
       compiler, rather than explicitly declared.  In addition to
       implicitly generated class member functions, this macro holds for
--- 9659,9712 ----
            BLOCK_SUPERCONTEXT(block_c) = foo;
            DECL_INITIAL(foo) = block_a;
  
  
  File: gccint.info,  Node: Function Properties,  Prev: Function Basics,  Up: Functions
  
  10.8.2 Function Properties
  --------------------------
  
! To determine the scope of a function, you can use the 'DECL_CONTEXT'
! macro.  This macro will return the class (either a 'RECORD_TYPE' or a
! 'UNION_TYPE') or namespace (a 'NAMESPACE_DECL') of which the function is
! a member.  For a virtual function, this macro returns the class in which
! the function was actually defined, not the base class in which the
! virtual declaration occurred.
  
!  In C, the 'DECL_CONTEXT' for a function maybe another function.  This
  representation indicates that the GNU nested function extension is in
  use.  For details on the semantics of nested functions, see the GCC
  Manual.  The nested function can refer to local variables in its
  containing function.  Such references are not explicitly marked in the
! tree structure; back ends must look at the 'DECL_CONTEXT' for the
! referenced 'VAR_DECL'.  If the 'DECL_CONTEXT' for the referenced
! 'VAR_DECL' is not the same as the function currently being processed,
! and neither 'DECL_EXTERNAL' nor 'TREE_STATIC' hold, then the reference
  is to a local variable in a containing function, and the back end must
  take appropriate action.
  
! 'DECL_EXTERNAL'
       This predicate holds if the function is undefined.
  
! 'TREE_PUBLIC'
       This predicate holds if the function has external linkage.
  
! 'TREE_STATIC'
       This predicate holds if the function has been defined.
  
! 'TREE_THIS_VOLATILE'
       This predicate holds if the function does not return normally.
  
! 'TREE_READONLY'
       This predicate holds if the function can only read its arguments.
  
! 'DECL_PURE_P'
       This predicate holds if the function can only read its arguments,
       but may also read global memory.
  
! 'DECL_VIRTUAL_P'
       This predicate holds if the function is virtual.
  
! 'DECL_ARTIFICIAL'
       This macro holds if the function was implicitly generated by the
       compiler, rather than explicitly declared.  In addition to
       implicitly generated class member functions, this macro holds for
*************** take appropriate action.
*** 9850,9867 ****
       and destruction, to compute run-time type information, and so
       forth.
  
! `DECL_FUNCTION_SPECIFIC_TARGET'
       This macro returns a tree node that holds the target options that
!      are to be used to compile this particular function or `NULL_TREE'
!      if the function is to be compiled with the target options
!      specified on the command line.
  
! `DECL_FUNCTION_SPECIFIC_OPTIMIZATION'
       This macro returns a tree node that holds the optimization options
       that are to be used to compile this particular function or
!      `NULL_TREE' if the function is to be compiled with the
!      optimization options specified on the command line.
! 
  
  
  File: gccint.info,  Node: Language-dependent trees,  Next: C and C++ Trees,  Prev: Functions,  Up: GENERIC
--- 9714,9730 ----
       and destruction, to compute run-time type information, and so
       forth.
  
! 'DECL_FUNCTION_SPECIFIC_TARGET'
       This macro returns a tree node that holds the target options that
!      are to be used to compile this particular function or 'NULL_TREE'
!      if the function is to be compiled with the target options specified
!      on the command line.
  
! 'DECL_FUNCTION_SPECIFIC_OPTIMIZATION'
       This macro returns a tree node that holds the optimization options
       that are to be used to compile this particular function or
!      'NULL_TREE' if the function is to be compiled with the optimization
!      options specified on the command line.
  
  
  File: gccint.info,  Node: Language-dependent trees,  Next: C and C++ Trees,  Prev: Functions,  Up: GENERIC
*************** File: gccint.info,  Node: Language-depen
*** 9870,9886 ****
  =============================
  
  Front ends may wish to keep some state associated with various GENERIC
! trees while parsing.  To support this, trees provide a set of flags
! that may be used by the front end.  They are accessed using
! `TREE_LANG_FLAG_n' where `n' is currently 0 through 6.
  
!  If necessary, a front end can use some language-dependent tree codes
! in its GENERIC representation, so long as it provides a hook for
! converting them to GIMPLE and doesn't expect them to work with any
! (hypothetical) optimizers that run before the conversion to GIMPLE. The
! intermediate representation used while parsing C and C++ looks very
! little like GENERIC, but the C and C++ gimplifier hooks are perfectly
! happy to take it as input and spit out GIMPLE.
  
  
  File: gccint.info,  Node: C and C++ Trees,  Next: Java Trees,  Prev: Language-dependent trees,  Up: GENERIC
--- 9733,9749 ----
  =============================
  
  Front ends may wish to keep some state associated with various GENERIC
! trees while parsing.  To support this, trees provide a set of flags that
! may be used by the front end.  They are accessed using
! 'TREE_LANG_FLAG_n' where 'n' is currently 0 through 6.
  
!  If necessary, a front end can use some language-dependent tree codes in
! its GENERIC representation, so long as it provides a hook for converting
! them to GIMPLE and doesn't expect them to work with any (hypothetical)
! optimizers that run before the conversion to GIMPLE.  The intermediate
! representation used while parsing C and C++ looks very little like
! GENERIC, but the C and C++ gimplifier hooks are perfectly happy to take
! it as input and spit out GIMPLE.
  
  
  File: gccint.info,  Node: C and C++ Trees,  Next: Java Trees,  Prev: Language-dependent trees,  Up: GENERIC
*************** submit your patches for inclusion in GCC
*** 9936,9942 ****
  * Classes::                     Classes.
  * Functions for C++::           Overloading and accessors for C++.
  * Statements for C++::          Statements specific to C and C++.
! * C++ Expressions::    From `typeid' to `throw'.
  
  
  File: gccint.info,  Node: Types for C++,  Next: Namespaces,  Up: C and C++ Trees
--- 9799,9805 ----
  * Classes::                     Classes.
  * Functions for C++::           Overloading and accessors for C++.
  * Statements for C++::          Statements specific to C and C++.
! * C++ Expressions::    From 'typeid' to 'throw'.
  
  
  File: gccint.info,  Node: Types for C++,  Next: Namespaces,  Up: C and C++ Trees
*************** representation.  The macros described he
*** 9950,10067 ****
  qualification of the underlying element type when applied to an array
  type.  (If the element type is itself an array, then the recursion
  continues until a non-array type is found, and the qualification of this
! type is examined.)  So, for example, `CP_TYPE_CONST_P' will hold of the
! type `const int ()[7]', denoting an array of seven `int's.
  
   The following functions and macros deal with cv-qualification of types:
! `cp_type_quals'
       This function returns the set of type qualifiers applied to this
!      type.  This value is `TYPE_UNQUALIFIED' if no qualifiers have been
!      applied.  The `TYPE_QUAL_CONST' bit is set if the type is
!      `const'-qualified.  The `TYPE_QUAL_VOLATILE' bit is set if the
!      type is `volatile'-qualified.  The `TYPE_QUAL_RESTRICT' bit is set
!      if the type is `restrict'-qualified.
! 
! `CP_TYPE_CONST_P'
!      This macro holds if the type is `const'-qualified.
  
! `CP_TYPE_VOLATILE_P'
!      This macro holds if the type is `volatile'-qualified.
  
! `CP_TYPE_RESTRICT_P'
!      This macro holds if the type is `restrict'-qualified.
  
! `CP_TYPE_CONST_NON_VOLATILE_P'
!      This predicate holds for a type that is `const'-qualified, but
!      _not_ `volatile'-qualified; other cv-qualifiers are ignored as
!      well: only the `const'-ness is tested.
  
  
   A few other macros and functions are usable with all types:
! `TYPE_SIZE'
       The number of bits required to represent the type, represented as
!      an `INTEGER_CST'.  For an incomplete type, `TYPE_SIZE' will be
!      `NULL_TREE'.
  
! `TYPE_ALIGN'
!      The alignment of the type, in bits, represented as an `int'.
  
! `TYPE_NAME'
!      This macro returns a declaration (in the form of a `TYPE_DECL') for
!      the type.  (Note this macro does _not_ return an
!      `IDENTIFIER_NODE', as you might expect, given its name!)  You can
!      look at the `DECL_NAME' of the `TYPE_DECL' to obtain the actual
!      name of the type.  The `TYPE_NAME' will be `NULL_TREE' for a type
!      that is not a built-in type, the result of a typedef, or a named
!      class type.
  
! `CP_INTEGRAL_TYPE'
       This predicate holds if the type is an integral type.  Notice that
       in C++, enumerations are _not_ integral types.
  
! `ARITHMETIC_TYPE_P'
       This predicate holds if the type is an integral type (in the C++
       sense) or a floating point type.
  
! `CLASS_TYPE_P'
       This predicate holds for a class-type.
  
! `TYPE_BUILT_IN'
       This predicate holds for a built-in type.
  
! `TYPE_PTRDATAMEM_P'
       This predicate holds if the type is a pointer to data member.
  
! `TYPE_PTR_P'
!      This predicate holds if the type is a pointer type, and the
!      pointee is not a data member.
  
! `TYPE_PTRFN_P'
       This predicate holds for a pointer to function type.
  
! `TYPE_PTROB_P'
       This predicate holds for a pointer to object type.  Note however
!      that it does not hold for the generic pointer to object type `void
!      *'.  You may use `TYPE_PTROBV_P' to test for a pointer to object
!      type as well as `void *'.
! 
  
   The table below describes types specific to C and C++ as well as
  language-dependent info about GENERIC types.
  
! `POINTER_TYPE'
       Used to represent pointer types, and pointer to data member types.
!      If `TREE_TYPE' is a pointer to data member type, then
!      `TYPE_PTRDATAMEM_P' will hold.  For a pointer to data member type
!      of the form `T X::*', `TYPE_PTRMEM_CLASS_TYPE' will be the type
!      `X', while `TYPE_PTRMEM_POINTED_TO_TYPE' will be the type `T'.
  
! `RECORD_TYPE'
!      Used to represent `struct' and `class' types in C and C++.  If
!      `TYPE_PTRMEMFUNC_P' holds, then this type is a pointer-to-member
!      type.  In that case, the `TYPE_PTRMEMFUNC_FN_TYPE' is a
!      `POINTER_TYPE' pointing to a `METHOD_TYPE'.  The `METHOD_TYPE' is
       the type of a function pointed to by the pointer-to-member
!      function.  If `TYPE_PTRMEMFUNC_P' does not hold, this type is a
       class type.  For more information, *note Classes::.
  
! `UNKNOWN_TYPE'
       This node is used to represent a type the knowledge of which is
       insufficient for a sound processing.
  
! `TYPENAME_TYPE'
!      Used to represent a construct of the form `typename T::A'.  The
!      `TYPE_CONTEXT' is `T'; the `TYPE_NAME' is an `IDENTIFIER_NODE' for
!      `A'.  If the type is specified via a template-id, then
!      `TYPENAME_TYPE_FULLNAME' yields a `TEMPLATE_ID_EXPR'.  The
!      `TREE_TYPE' is non-`NULL' if the node is implicitly generated in
       support for the implicit typename extension; in which case the
!      `TREE_TYPE' is a type node for the base-class.
! 
! `TYPEOF_TYPE'
!      Used to represent the `__typeof__' extension.  The `TYPE_FIELDS'
!      is the expression the type of which is being represented.
  
  
  
  File: gccint.info,  Node: Namespaces,  Next: Classes,  Prev: Types for C++,  Up: C and C++ Trees
--- 9813,9926 ----
  qualification of the underlying element type when applied to an array
  type.  (If the element type is itself an array, then the recursion
  continues until a non-array type is found, and the qualification of this
! type is examined.)  So, for example, 'CP_TYPE_CONST_P' will hold of the
! type 'const int ()[7]', denoting an array of seven 'int's.
  
   The following functions and macros deal with cv-qualification of types:
! 'cp_type_quals'
       This function returns the set of type qualifiers applied to this
!      type.  This value is 'TYPE_UNQUALIFIED' if no qualifiers have been
!      applied.  The 'TYPE_QUAL_CONST' bit is set if the type is
!      'const'-qualified.  The 'TYPE_QUAL_VOLATILE' bit is set if the type
!      is 'volatile'-qualified.  The 'TYPE_QUAL_RESTRICT' bit is set if
!      the type is 'restrict'-qualified.
  
! 'CP_TYPE_CONST_P'
!      This macro holds if the type is 'const'-qualified.
  
! 'CP_TYPE_VOLATILE_P'
!      This macro holds if the type is 'volatile'-qualified.
  
! 'CP_TYPE_RESTRICT_P'
!      This macro holds if the type is 'restrict'-qualified.
  
+ 'CP_TYPE_CONST_NON_VOLATILE_P'
+      This predicate holds for a type that is 'const'-qualified, but
+      _not_ 'volatile'-qualified; other cv-qualifiers are ignored as
+      well: only the 'const'-ness is tested.
  
   A few other macros and functions are usable with all types:
! 'TYPE_SIZE'
       The number of bits required to represent the type, represented as
!      an 'INTEGER_CST'.  For an incomplete type, 'TYPE_SIZE' will be
!      'NULL_TREE'.
  
! 'TYPE_ALIGN'
!      The alignment of the type, in bits, represented as an 'int'.
  
! 'TYPE_NAME'
!      This macro returns a declaration (in the form of a 'TYPE_DECL') for
!      the type.  (Note this macro does _not_ return an 'IDENTIFIER_NODE',
!      as you might expect, given its name!)  You can look at the
!      'DECL_NAME' of the 'TYPE_DECL' to obtain the actual name of the
!      type.  The 'TYPE_NAME' will be 'NULL_TREE' for a type that is not a
!      built-in type, the result of a typedef, or a named class type.
  
! 'CP_INTEGRAL_TYPE'
       This predicate holds if the type is an integral type.  Notice that
       in C++, enumerations are _not_ integral types.
  
! 'ARITHMETIC_TYPE_P'
       This predicate holds if the type is an integral type (in the C++
       sense) or a floating point type.
  
! 'CLASS_TYPE_P'
       This predicate holds for a class-type.
  
! 'TYPE_BUILT_IN'
       This predicate holds for a built-in type.
  
! 'TYPE_PTRDATAMEM_P'
       This predicate holds if the type is a pointer to data member.
  
! 'TYPE_PTR_P'
!      This predicate holds if the type is a pointer type, and the pointee
!      is not a data member.
  
! 'TYPE_PTRFN_P'
       This predicate holds for a pointer to function type.
  
! 'TYPE_PTROB_P'
       This predicate holds for a pointer to object type.  Note however
!      that it does not hold for the generic pointer to object type 'void
!      *'.  You may use 'TYPE_PTROBV_P' to test for a pointer to object
!      type as well as 'void *'.
  
   The table below describes types specific to C and C++ as well as
  language-dependent info about GENERIC types.
  
! 'POINTER_TYPE'
       Used to represent pointer types, and pointer to data member types.
!      If 'TREE_TYPE' is a pointer to data member type, then
!      'TYPE_PTRDATAMEM_P' will hold.  For a pointer to data member type
!      of the form 'T X::*', 'TYPE_PTRMEM_CLASS_TYPE' will be the type
!      'X', while 'TYPE_PTRMEM_POINTED_TO_TYPE' will be the type 'T'.
  
! 'RECORD_TYPE'
!      Used to represent 'struct' and 'class' types in C and C++.  If
!      'TYPE_PTRMEMFUNC_P' holds, then this type is a pointer-to-member
!      type.  In that case, the 'TYPE_PTRMEMFUNC_FN_TYPE' is a
!      'POINTER_TYPE' pointing to a 'METHOD_TYPE'.  The 'METHOD_TYPE' is
       the type of a function pointed to by the pointer-to-member
!      function.  If 'TYPE_PTRMEMFUNC_P' does not hold, this type is a
       class type.  For more information, *note Classes::.
  
! 'UNKNOWN_TYPE'
       This node is used to represent a type the knowledge of which is
       insufficient for a sound processing.
  
! 'TYPENAME_TYPE'
!      Used to represent a construct of the form 'typename T::A'.  The
!      'TYPE_CONTEXT' is 'T'; the 'TYPE_NAME' is an 'IDENTIFIER_NODE' for
!      'A'.  If the type is specified via a template-id, then
!      'TYPENAME_TYPE_FULLNAME' yields a 'TEMPLATE_ID_EXPR'.  The
!      'TREE_TYPE' is non-'NULL' if the node is implicitly generated in
       support for the implicit typename extension; in which case the
!      'TREE_TYPE' is a type node for the base-class.
  
+ 'TYPEOF_TYPE'
+      Used to represent the '__typeof__' extension.  The 'TYPE_FIELDS' is
+      the expression the type of which is being represented.
  
  
  File: gccint.info,  Node: Namespaces,  Next: Classes,  Prev: Types for C++,  Up: C and C++ Trees
*************** File: gccint.info,  Node: Namespaces,  N
*** 10070,10076 ****
  ------------------
  
  The root of the entire intermediate representation is the variable
! `global_namespace'.  This is the namespace specified with `::' in C++
  source code.  All other namespaces, types, variables, functions, and so
  forth can be found starting with this namespace.
  
--- 9929,9935 ----
  ------------------
  
  The root of the entire intermediate representation is the variable
! 'global_namespace'.  This is the namespace specified with '::' in C++
  source code.  All other namespaces, types, variables, functions, and so
  forth can be found starting with this namespace.
  
*************** the representation, the global namespace
*** 10079,10139 ****
  namespace.  Thus, in what follows, we describe namespaces generally,
  rather than the global namespace in particular.
  
!  A namespace is represented by a `NAMESPACE_DECL' node.
  
!  The following macros and functions can be used on a `NAMESPACE_DECL':
  
! `DECL_NAME'
!      This macro is used to obtain the `IDENTIFIER_NODE' corresponding to
       the unqualified name of the name of the namespace (*note
!      Identifiers::).  The name of the global namespace is `::', even
!      though in C++ the global namespace is unnamed.  However, you
!      should use comparison with `global_namespace', rather than
!      `DECL_NAME' to determine whether or not a namespace is the global
!      one.  An unnamed namespace will have a `DECL_NAME' equal to
!      `anonymous_namespace_name'.  Within a single translation unit, all
       unnamed namespaces will have the same name.
  
! `DECL_CONTEXT'
!      This macro returns the enclosing namespace.  The `DECL_CONTEXT' for
!      the `global_namespace' is `NULL_TREE'.
  
! `DECL_NAMESPACE_ALIAS'
       If this declaration is for a namespace alias, then
!      `DECL_NAMESPACE_ALIAS' is the namespace for which this one is an
       alias.
  
!      Do not attempt to use `cp_namespace_decls' for a namespace which is
!      an alias.  Instead, follow `DECL_NAMESPACE_ALIAS' links until you
       reach an ordinary, non-alias, namespace, and call
!      `cp_namespace_decls' there.
  
! `DECL_NAMESPACE_STD_P'
!      This predicate holds if the namespace is the special `::std'
       namespace.
  
! `cp_namespace_decls'
       This function will return the declarations contained in the
!      namespace, including types, overloaded functions, other
!      namespaces, and so forth.  If there are no declarations, this
!      function will return `NULL_TREE'.  The declarations are connected
!      through their `TREE_CHAIN' fields.
  
       Although most entries on this list will be declarations,
!      `TREE_LIST' nodes may also appear.  In this case, the `TREE_VALUE'
!      will be an `OVERLOAD'.  The value of the `TREE_PURPOSE' is
!      unspecified; back ends should ignore this value.  As with the
!      other kinds of declarations returned by `cp_namespace_decls', the
!      `TREE_CHAIN' will point to the next declaration in this list.
  
!      For more information on the kinds of declarations that can occur
!      on this list, *Note Declarations::.  Some declarations will not
!      appear on this list.  In particular, no `FIELD_DECL',
!      `LABEL_DECL', or `PARM_DECL' nodes will appear here.
  
       This function cannot be used with namespaces that have
!      `DECL_NAMESPACE_ALIAS' set.
! 
  
  
  File: gccint.info,  Node: Classes,  Next: Functions for C++,  Prev: Namespaces,  Up: C and C++ Trees
--- 9938,9997 ----
  namespace.  Thus, in what follows, we describe namespaces generally,
  rather than the global namespace in particular.
  
!  A namespace is represented by a 'NAMESPACE_DECL' node.
  
!  The following macros and functions can be used on a 'NAMESPACE_DECL':
  
! 'DECL_NAME'
!      This macro is used to obtain the 'IDENTIFIER_NODE' corresponding to
       the unqualified name of the name of the namespace (*note
!      Identifiers::).  The name of the global namespace is '::', even
!      though in C++ the global namespace is unnamed.  However, you should
!      use comparison with 'global_namespace', rather than 'DECL_NAME' to
!      determine whether or not a namespace is the global one.  An unnamed
!      namespace will have a 'DECL_NAME' equal to
!      'anonymous_namespace_name'.  Within a single translation unit, all
       unnamed namespaces will have the same name.
  
! 'DECL_CONTEXT'
!      This macro returns the enclosing namespace.  The 'DECL_CONTEXT' for
!      the 'global_namespace' is 'NULL_TREE'.
  
! 'DECL_NAMESPACE_ALIAS'
       If this declaration is for a namespace alias, then
!      'DECL_NAMESPACE_ALIAS' is the namespace for which this one is an
       alias.
  
!      Do not attempt to use 'cp_namespace_decls' for a namespace which is
!      an alias.  Instead, follow 'DECL_NAMESPACE_ALIAS' links until you
       reach an ordinary, non-alias, namespace, and call
!      'cp_namespace_decls' there.
  
! 'DECL_NAMESPACE_STD_P'
!      This predicate holds if the namespace is the special '::std'
       namespace.
  
! 'cp_namespace_decls'
       This function will return the declarations contained in the
!      namespace, including types, overloaded functions, other namespaces,
!      and so forth.  If there are no declarations, this function will
!      return 'NULL_TREE'.  The declarations are connected through their
!      'TREE_CHAIN' fields.
  
       Although most entries on this list will be declarations,
!      'TREE_LIST' nodes may also appear.  In this case, the 'TREE_VALUE'
!      will be an 'OVERLOAD'.  The value of the 'TREE_PURPOSE' is
!      unspecified; back ends should ignore this value.  As with the other
!      kinds of declarations returned by 'cp_namespace_decls', the
!      'TREE_CHAIN' will point to the next declaration in this list.
  
!      For more information on the kinds of declarations that can occur on
!      this list, *Note Declarations::.  Some declarations will not appear
!      on this list.  In particular, no 'FIELD_DECL', 'LABEL_DECL', or
!      'PARM_DECL' nodes will appear here.
  
       This function cannot be used with namespaces that have
!      'DECL_NAMESPACE_ALIAS' set.
  
  
  File: gccint.info,  Node: Classes,  Next: Functions for C++,  Prev: Namespaces,  Up: C and C++ Trees
*************** File: gccint.info,  Node: Classes,  Next
*** 10144,10380 ****
  Besides namespaces, the other high-level scoping construct in C++ is the
  class.  (Throughout this manual the term "class" is used to mean the
  types referred to in the ANSI/ISO C++ Standard as classes; these include
! types defined with the `class', `struct', and `union' keywords.)
  
!  A class type is represented by either a `RECORD_TYPE' or a
! `UNION_TYPE'.  A class declared with the `union' tag is represented by
! a `UNION_TYPE', while classes declared with either the `struct' or the
! `class' tag are represented by `RECORD_TYPE's.  You can use the
! `CLASSTYPE_DECLARED_CLASS' macro to discern whether or not a particular
! type is a `class' as opposed to a `struct'.  This macro will be true
! only for classes declared with the `class' tag.
  
!  Almost all non-function members are available on the `TYPE_FIELDS'
  list.  Given one member, the next can be found by following the
! `TREE_CHAIN'.  You should not depend in any way on the order in which
! fields appear on this list.  All nodes on this list will be `DECL'
! nodes.  A `FIELD_DECL' is used to represent a non-static data member, a
! `VAR_DECL' is used to represent a static data member, and a `TYPE_DECL'
! is used to represent a type.  Note that the `CONST_DECL' for an
  enumeration constant will appear on this list, if the enumeration type
! was declared in the class.  (Of course, the `TYPE_DECL' for the
  enumeration type will appear here as well.)  There are no entries for
! base classes on this list.  In particular, there is no `FIELD_DECL' for
  the "base-class portion" of an object.
  
!  The `TYPE_VFIELD' is a compiler-generated field used to point to
! virtual function tables.  It may or may not appear on the `TYPE_FIELDS'
! list.  However, back ends should handle the `TYPE_VFIELD' just like all
! the entries on the `TYPE_FIELDS' list.
  
!  The function members are available on the `TYPE_METHODS' list.  Again,
! subsequent members are found by following the `TREE_CHAIN' field.  If a
  function is overloaded, each of the overloaded functions appears; no
! `OVERLOAD' nodes appear on the `TYPE_METHODS' list.  Implicitly
! declared functions (including default constructors, copy constructors,
! assignment operators, and destructors) will appear on this list as well.
  
   Every class has an associated "binfo", which can be obtained with
! `TYPE_BINFO'.  Binfos are used to represent base-classes.  The binfo
! given by `TYPE_BINFO' is the degenerate case, whereby every class is
  considered to be its own base-class.  The base binfos for a particular
  binfo are held in a vector, whose length is obtained with
! `BINFO_N_BASE_BINFOS'.  The base binfos themselves are obtained with
! `BINFO_BASE_BINFO' and `BINFO_BASE_ITERATE'.  To add a new binfo, use
! `BINFO_BASE_APPEND'.  The vector of base binfos can be obtained with
! `BINFO_BASE_BINFOS', but normally you do not need to use that.  The
! class type associated with a binfo is given by `BINFO_TYPE'.  It is not
! always the case that `BINFO_TYPE (TYPE_BINFO (x))', because of typedefs
! and qualified types.  Neither is it the case that `TYPE_BINFO
! (BINFO_TYPE (y))' is the same binfo as `y'.  The reason is that if `y'
! is a binfo representing a base-class `B' of a derived class `D', then
! `BINFO_TYPE (y)' will be `B', and `TYPE_BINFO (BINFO_TYPE (y))' will be
! `B' as its own base-class, rather than as a base-class of `D'.
  
!  The access to a base type can be found with `BINFO_BASE_ACCESS'.  This
! will produce `access_public_node', `access_private_node' or
! `access_protected_node'.  If bases are always public,
! `BINFO_BASE_ACCESSES' may be `NULL'.
  
!  `BINFO_VIRTUAL_P' is used to specify whether the binfo is inherited
! virtually or not.  The other flags, `BINFO_MARKED_P' and `BINFO_FLAG_1'
! to `BINFO_FLAG_6' can be used for language specific use.
  
   The following macros can be used on a tree node representing a
  class-type.
  
! `LOCAL_CLASS_P'
       This predicate holds if the class is local class _i.e._ declared
       inside a function body.
  
! `TYPE_POLYMORPHIC_P'
       This predicate holds if the class has at least one virtual function
       (declared or inherited).
  
! `TYPE_HAS_DEFAULT_CONSTRUCTOR'
       This predicate holds whenever its argument represents a class-type
       with default constructor.
  
! `CLASSTYPE_HAS_MUTABLE'
! `TYPE_HAS_MUTABLE_P'
       These predicates hold for a class-type having a mutable data
       member.
  
! `CLASSTYPE_NON_POD_P'
       This predicate holds only for class-types that are not PODs.
  
! `TYPE_HAS_NEW_OPERATOR'
!      This predicate holds for a class-type that defines `operator new'.
  
! `TYPE_HAS_ARRAY_NEW_OPERATOR'
!      This predicate holds for a class-type for which `operator new[]'
!      is defined.
  
! `TYPE_OVERLOADS_CALL_EXPR'
       This predicate holds for class-type for which the function call
!      `operator()' is overloaded.
  
! `TYPE_OVERLOADS_ARRAY_REF'
!      This predicate holds for a class-type that overloads `operator[]'
  
! `TYPE_OVERLOADS_ARROW'
!      This predicate holds for a class-type for which `operator->' is
       overloaded.
  
- 
  
  File: gccint.info,  Node: Functions for C++,  Next: Statements for C++,  Prev: Classes,  Up: C and C++ Trees
  
  10.10.4 Functions for C++
  -------------------------
  
! A function is represented by a `FUNCTION_DECL' node.  A set of
! overloaded functions is sometimes represented by an `OVERLOAD' node.
  
!  An `OVERLOAD' node is not a declaration, so none of the `DECL_' macros
! should be used on an `OVERLOAD'.  An `OVERLOAD' node is similar to a
! `TREE_LIST'.  Use `OVL_CURRENT' to get the function associated with an
! `OVERLOAD' node; use `OVL_NEXT' to get the next `OVERLOAD' node in the
! list of overloaded functions.  The macros `OVL_CURRENT' and `OVL_NEXT'
! are actually polymorphic; you can use them to work with `FUNCTION_DECL'
! nodes as well as with overloads.  In the case of a `FUNCTION_DECL',
! `OVL_CURRENT' will always return the function itself, and `OVL_NEXT'
! will always be `NULL_TREE'.
  
!  To determine the scope of a function, you can use the `DECL_CONTEXT'
! macro.  This macro will return the class (either a `RECORD_TYPE' or a
! `UNION_TYPE') or namespace (a `NAMESPACE_DECL') of which the function
! is a member.  For a virtual function, this macro returns the class in
! which the function was actually defined, not the base class in which
! the virtual declaration occurred.
  
   If a friend function is defined in a class scope, the
! `DECL_FRIEND_CONTEXT' macro can be used to determine the class in which
  it was defined.  For example, in
       class C { friend void f() {} };
!  the `DECL_CONTEXT' for `f' will be the `global_namespace', but the
! `DECL_FRIEND_CONTEXT' will be the `RECORD_TYPE' for `C'.
  
!  The following macros and functions can be used on a `FUNCTION_DECL':
! `DECL_MAIN_P'
       This predicate holds for a function that is the program entry point
!      `::code'.
  
! `DECL_LOCAL_FUNCTION_P'
       This predicate holds if the function was declared at block scope,
       even though it has a global scope.
  
! `DECL_ANTICIPATED'
       This predicate holds if the function is a built-in function but its
       prototype is not yet explicitly declared.
  
! `DECL_EXTERN_C_FUNCTION_P'
!      This predicate holds if the function is declared as an ``extern
       "C"'' function.
  
! `DECL_LINKONCE_P'
!      This macro holds if multiple copies of this function may be
!      emitted in various translation units.  It is the responsibility of
!      the linker to merge the various copies.  Template instantiations
!      are the most common example of functions for which
!      `DECL_LINKONCE_P' holds; G++ instantiates needed templates in all
!      translation units which require them, and then relies on the
!      linker to remove duplicate instantiations.
  
       FIXME: This macro is not yet implemented.
  
! `DECL_FUNCTION_MEMBER_P'
       This macro holds if the function is a member of a class, rather
       than a member of a namespace.
  
! `DECL_STATIC_FUNCTION_P'
       This predicate holds if the function a static member function.
  
! `DECL_NONSTATIC_MEMBER_FUNCTION_P'
       This macro holds for a non-static member function.
  
! `DECL_CONST_MEMFUNC_P'
!      This predicate holds for a `const'-member function.
  
! `DECL_VOLATILE_MEMFUNC_P'
!      This predicate holds for a `volatile'-member function.
  
! `DECL_CONSTRUCTOR_P'
       This macro holds if the function is a constructor.
  
! `DECL_NONCONVERTING_P'
       This predicate holds if the constructor is a non-converting
       constructor.
  
! `DECL_COMPLETE_CONSTRUCTOR_P'
       This predicate holds for a function which is a constructor for an
       object of a complete type.
  
! `DECL_BASE_CONSTRUCTOR_P'
       This predicate holds for a function which is a constructor for a
       base class sub-object.
  
! `DECL_COPY_CONSTRUCTOR_P'
       This predicate holds for a function which is a copy-constructor.
  
! `DECL_DESTRUCTOR_P'
       This macro holds if the function is a destructor.
  
! `DECL_COMPLETE_DESTRUCTOR_P'
       This predicate holds if the function is the destructor for an
       object a complete type.
  
! `DECL_OVERLOADED_OPERATOR_P'
       This macro holds if the function is an overloaded operator.
  
! `DECL_CONV_FN_P'
       This macro holds if the function is a type-conversion operator.
  
! `DECL_GLOBAL_CTOR_P'
       This predicate holds if the function is a file-scope initialization
       function.
  
! `DECL_GLOBAL_DTOR_P'
       This predicate holds if the function is a file-scope finalization
       function.
  
! `DECL_THUNK_P'
       This predicate holds if the function is a thunk.
  
!      These functions represent stub code that adjusts the `this' pointer
       and then jumps to another function.  When the jumped-to function
       returns, control is transferred directly to the caller, without
!      returning to the thunk.  The first parameter to the thunk is
!      always the `this' pointer; the thunk should add `THUNK_DELTA' to
!      this value.  (The `THUNK_DELTA' is an `int', not an `INTEGER_CST'.)
  
!      Then, if `THUNK_VCALL_OFFSET' (an `INTEGER_CST') is nonzero the
!      adjusted `this' pointer must be adjusted again.  The complete
       calculation is given by the following pseudo-code:
  
            this += THUNK_DELTA
--- 10002,10237 ----
  Besides namespaces, the other high-level scoping construct in C++ is the
  class.  (Throughout this manual the term "class" is used to mean the
  types referred to in the ANSI/ISO C++ Standard as classes; these include
! types defined with the 'class', 'struct', and 'union' keywords.)
  
!  A class type is represented by either a 'RECORD_TYPE' or a
! 'UNION_TYPE'.  A class declared with the 'union' tag is represented by a
! 'UNION_TYPE', while classes declared with either the 'struct' or the
! 'class' tag are represented by 'RECORD_TYPE's.  You can use the
! 'CLASSTYPE_DECLARED_CLASS' macro to discern whether or not a particular
! type is a 'class' as opposed to a 'struct'.  This macro will be true
! only for classes declared with the 'class' tag.
  
!  Almost all non-function members are available on the 'TYPE_FIELDS'
  list.  Given one member, the next can be found by following the
! 'TREE_CHAIN'.  You should not depend in any way on the order in which
! fields appear on this list.  All nodes on this list will be 'DECL'
! nodes.  A 'FIELD_DECL' is used to represent a non-static data member, a
! 'VAR_DECL' is used to represent a static data member, and a 'TYPE_DECL'
! is used to represent a type.  Note that the 'CONST_DECL' for an
  enumeration constant will appear on this list, if the enumeration type
! was declared in the class.  (Of course, the 'TYPE_DECL' for the
  enumeration type will appear here as well.)  There are no entries for
! base classes on this list.  In particular, there is no 'FIELD_DECL' for
  the "base-class portion" of an object.
  
!  The 'TYPE_VFIELD' is a compiler-generated field used to point to
! virtual function tables.  It may or may not appear on the 'TYPE_FIELDS'
! list.  However, back ends should handle the 'TYPE_VFIELD' just like all
! the entries on the 'TYPE_FIELDS' list.
  
!  The function members are available on the 'TYPE_METHODS' list.  Again,
! subsequent members are found by following the 'TREE_CHAIN' field.  If a
  function is overloaded, each of the overloaded functions appears; no
! 'OVERLOAD' nodes appear on the 'TYPE_METHODS' list.  Implicitly declared
! functions (including default constructors, copy constructors, assignment
! operators, and destructors) will appear on this list as well.
  
   Every class has an associated "binfo", which can be obtained with
! 'TYPE_BINFO'.  Binfos are used to represent base-classes.  The binfo
! given by 'TYPE_BINFO' is the degenerate case, whereby every class is
  considered to be its own base-class.  The base binfos for a particular
  binfo are held in a vector, whose length is obtained with
! 'BINFO_N_BASE_BINFOS'.  The base binfos themselves are obtained with
! 'BINFO_BASE_BINFO' and 'BINFO_BASE_ITERATE'.  To add a new binfo, use
! 'BINFO_BASE_APPEND'.  The vector of base binfos can be obtained with
! 'BINFO_BASE_BINFOS', but normally you do not need to use that.  The
! class type associated with a binfo is given by 'BINFO_TYPE'.  It is not
! always the case that 'BINFO_TYPE (TYPE_BINFO (x))', because of typedefs
! and qualified types.  Neither is it the case that 'TYPE_BINFO
! (BINFO_TYPE (y))' is the same binfo as 'y'.  The reason is that if 'y'
! is a binfo representing a base-class 'B' of a derived class 'D', then
! 'BINFO_TYPE (y)' will be 'B', and 'TYPE_BINFO (BINFO_TYPE (y))' will be
! 'B' as its own base-class, rather than as a base-class of 'D'.
  
!  The access to a base type can be found with 'BINFO_BASE_ACCESS'.  This
! will produce 'access_public_node', 'access_private_node' or
! 'access_protected_node'.  If bases are always public,
! 'BINFO_BASE_ACCESSES' may be 'NULL'.
  
!  'BINFO_VIRTUAL_P' is used to specify whether the binfo is inherited
! virtually or not.  The other flags, 'BINFO_MARKED_P' and 'BINFO_FLAG_1'
! to 'BINFO_FLAG_6' can be used for language specific use.
  
   The following macros can be used on a tree node representing a
  class-type.
  
! 'LOCAL_CLASS_P'
       This predicate holds if the class is local class _i.e._ declared
       inside a function body.
  
! 'TYPE_POLYMORPHIC_P'
       This predicate holds if the class has at least one virtual function
       (declared or inherited).
  
! 'TYPE_HAS_DEFAULT_CONSTRUCTOR'
       This predicate holds whenever its argument represents a class-type
       with default constructor.
  
! 'CLASSTYPE_HAS_MUTABLE'
! 'TYPE_HAS_MUTABLE_P'
       These predicates hold for a class-type having a mutable data
       member.
  
! 'CLASSTYPE_NON_POD_P'
       This predicate holds only for class-types that are not PODs.
  
! 'TYPE_HAS_NEW_OPERATOR'
!      This predicate holds for a class-type that defines 'operator new'.
  
! 'TYPE_HAS_ARRAY_NEW_OPERATOR'
!      This predicate holds for a class-type for which 'operator new[]' is
!      defined.
  
! 'TYPE_OVERLOADS_CALL_EXPR'
       This predicate holds for class-type for which the function call
!      'operator()' is overloaded.
  
! 'TYPE_OVERLOADS_ARRAY_REF'
!      This predicate holds for a class-type that overloads 'operator[]'
  
! 'TYPE_OVERLOADS_ARROW'
!      This predicate holds for a class-type for which 'operator->' is
       overloaded.
  
  
  File: gccint.info,  Node: Functions for C++,  Next: Statements for C++,  Prev: Classes,  Up: C and C++ Trees
  
  10.10.4 Functions for C++
  -------------------------
  
! A function is represented by a 'FUNCTION_DECL' node.  A set of
! overloaded functions is sometimes represented by an 'OVERLOAD' node.
  
!  An 'OVERLOAD' node is not a declaration, so none of the 'DECL_' macros
! should be used on an 'OVERLOAD'.  An 'OVERLOAD' node is similar to a
! 'TREE_LIST'.  Use 'OVL_CURRENT' to get the function associated with an
! 'OVERLOAD' node; use 'OVL_NEXT' to get the next 'OVERLOAD' node in the
! list of overloaded functions.  The macros 'OVL_CURRENT' and 'OVL_NEXT'
! are actually polymorphic; you can use them to work with 'FUNCTION_DECL'
! nodes as well as with overloads.  In the case of a 'FUNCTION_DECL',
! 'OVL_CURRENT' will always return the function itself, and 'OVL_NEXT'
! will always be 'NULL_TREE'.
  
!  To determine the scope of a function, you can use the 'DECL_CONTEXT'
! macro.  This macro will return the class (either a 'RECORD_TYPE' or a
! 'UNION_TYPE') or namespace (a 'NAMESPACE_DECL') of which the function is
! a member.  For a virtual function, this macro returns the class in which
! the function was actually defined, not the base class in which the
! virtual declaration occurred.
  
   If a friend function is defined in a class scope, the
! 'DECL_FRIEND_CONTEXT' macro can be used to determine the class in which
  it was defined.  For example, in
       class C { friend void f() {} };
! the 'DECL_CONTEXT' for 'f' will be the 'global_namespace', but the
! 'DECL_FRIEND_CONTEXT' will be the 'RECORD_TYPE' for 'C'.
  
!  The following macros and functions can be used on a 'FUNCTION_DECL':
! 'DECL_MAIN_P'
       This predicate holds for a function that is the program entry point
!      '::code'.
  
! 'DECL_LOCAL_FUNCTION_P'
       This predicate holds if the function was declared at block scope,
       even though it has a global scope.
  
! 'DECL_ANTICIPATED'
       This predicate holds if the function is a built-in function but its
       prototype is not yet explicitly declared.
  
! 'DECL_EXTERN_C_FUNCTION_P'
!      This predicate holds if the function is declared as an ''extern
       "C"'' function.
  
! 'DECL_LINKONCE_P'
!      This macro holds if multiple copies of this function may be emitted
!      in various translation units.  It is the responsibility of the
!      linker to merge the various copies.  Template instantiations are
!      the most common example of functions for which 'DECL_LINKONCE_P'
!      holds; G++ instantiates needed templates in all translation units
!      which require them, and then relies on the linker to remove
!      duplicate instantiations.
  
       FIXME: This macro is not yet implemented.
  
! 'DECL_FUNCTION_MEMBER_P'
       This macro holds if the function is a member of a class, rather
       than a member of a namespace.
  
! 'DECL_STATIC_FUNCTION_P'
       This predicate holds if the function a static member function.
  
! 'DECL_NONSTATIC_MEMBER_FUNCTION_P'
       This macro holds for a non-static member function.
  
! 'DECL_CONST_MEMFUNC_P'
!      This predicate holds for a 'const'-member function.
  
! 'DECL_VOLATILE_MEMFUNC_P'
!      This predicate holds for a 'volatile'-member function.
  
! 'DECL_CONSTRUCTOR_P'
       This macro holds if the function is a constructor.
  
! 'DECL_NONCONVERTING_P'
       This predicate holds if the constructor is a non-converting
       constructor.
  
! 'DECL_COMPLETE_CONSTRUCTOR_P'
       This predicate holds for a function which is a constructor for an
       object of a complete type.
  
! 'DECL_BASE_CONSTRUCTOR_P'
       This predicate holds for a function which is a constructor for a
       base class sub-object.
  
! 'DECL_COPY_CONSTRUCTOR_P'
       This predicate holds for a function which is a copy-constructor.
  
! 'DECL_DESTRUCTOR_P'
       This macro holds if the function is a destructor.
  
! 'DECL_COMPLETE_DESTRUCTOR_P'
       This predicate holds if the function is the destructor for an
       object a complete type.
  
! 'DECL_OVERLOADED_OPERATOR_P'
       This macro holds if the function is an overloaded operator.
  
! 'DECL_CONV_FN_P'
       This macro holds if the function is a type-conversion operator.
  
! 'DECL_GLOBAL_CTOR_P'
       This predicate holds if the function is a file-scope initialization
       function.
  
! 'DECL_GLOBAL_DTOR_P'
       This predicate holds if the function is a file-scope finalization
       function.
  
! 'DECL_THUNK_P'
       This predicate holds if the function is a thunk.
  
!      These functions represent stub code that adjusts the 'this' pointer
       and then jumps to another function.  When the jumped-to function
       returns, control is transferred directly to the caller, without
!      returning to the thunk.  The first parameter to the thunk is always
!      the 'this' pointer; the thunk should add 'THUNK_DELTA' to this
!      value.  (The 'THUNK_DELTA' is an 'int', not an 'INTEGER_CST'.)
  
!      Then, if 'THUNK_VCALL_OFFSET' (an 'INTEGER_CST') is nonzero the
!      adjusted 'this' pointer must be adjusted again.  The complete
       calculation is given by the following pseudo-code:
  
            this += THUNK_DELTA
*************** it was defined.  For example, in
*** 10382,10415 ****
              this += (*((ptrdiff_t **) this))[THUNK_VCALL_OFFSET]
  
       Finally, the thunk should jump to the location given by
!      `DECL_INITIAL'; this will always be an expression for the address
       of a function.
  
! `DECL_NON_THUNK_FUNCTION_P'
       This predicate holds if the function is _not_ a thunk function.
  
! `GLOBAL_INIT_PRIORITY'
!      If either `DECL_GLOBAL_CTOR_P' or `DECL_GLOBAL_DTOR_P' holds, then
       this gives the initialization priority for the function.  The
       linker will arrange that all functions for which
!      `DECL_GLOBAL_CTOR_P' holds are run in increasing order of priority
!      before `main' is called.  When the program exits, all functions for
!      which `DECL_GLOBAL_DTOR_P' holds are run in the reverse order.
  
! `TYPE_RAISES_EXCEPTIONS'
       This macro returns the list of exceptions that a (member-)function
!      can raise.  The returned list, if non `NULL', is comprised of nodes
!      whose `TREE_VALUE' represents a type.
  
! `TYPE_NOTHROW_P'
       This predicate holds when the exception-specification of its
!      arguments is of the form ``()''.
  
! `DECL_ARRAY_DELETE_OPERATOR_P'
!      This predicate holds if the function an overloaded `operator
       delete[]'.
  
- 
  
  File: gccint.info,  Node: Statements for C++,  Next: C++ Expressions,  Prev: Functions for C++,  Up: C and C++ Trees
  
--- 10239,10271 ----
              this += (*((ptrdiff_t **) this))[THUNK_VCALL_OFFSET]
  
       Finally, the thunk should jump to the location given by
!      'DECL_INITIAL'; this will always be an expression for the address
       of a function.
  
! 'DECL_NON_THUNK_FUNCTION_P'
       This predicate holds if the function is _not_ a thunk function.
  
! 'GLOBAL_INIT_PRIORITY'
!      If either 'DECL_GLOBAL_CTOR_P' or 'DECL_GLOBAL_DTOR_P' holds, then
       this gives the initialization priority for the function.  The
       linker will arrange that all functions for which
!      'DECL_GLOBAL_CTOR_P' holds are run in increasing order of priority
!      before 'main' is called.  When the program exits, all functions for
!      which 'DECL_GLOBAL_DTOR_P' holds are run in the reverse order.
  
! 'TYPE_RAISES_EXCEPTIONS'
       This macro returns the list of exceptions that a (member-)function
!      can raise.  The returned list, if non 'NULL', is comprised of nodes
!      whose 'TREE_VALUE' represents a type.
  
! 'TYPE_NOTHROW_P'
       This predicate holds when the exception-specification of its
!      arguments is of the form ''()''.
  
! 'DECL_ARRAY_DELETE_OPERATOR_P'
!      This predicate holds if the function an overloaded 'operator
       delete[]'.
  
  
  File: gccint.info,  Node: Statements for C++,  Next: C++ Expressions,  Prev: Functions for C++,  Up: C and C++ Trees
  
*************** File: gccint.info,  Node: Statements for
*** 10417,10426 ****
  --------------------------
  
  A function that has a definition in the current translation unit will
! have a non-`NULL' `DECL_INITIAL'.  However, back ends should not make
! use of the particular value given by `DECL_INITIAL'.
  
!  The `DECL_SAVED_TREE' macro will give the complete body of the
  function.
  
  10.10.5.1 Statements
--- 10273,10282 ----
  --------------------------
  
  A function that has a definition in the current translation unit will
! have a non-'NULL' 'DECL_INITIAL'.  However, back ends should not make
! use of the particular value given by 'DECL_INITIAL'.
  
!  The 'DECL_SAVED_TREE' macro will give the complete body of the
  function.
  
  10.10.5.1 Statements
*************** here, together with a list of the variou
*** 10432,10446 ****
  obtain information about them.  There are a few macros that can be used
  with all statements:
  
! `STMT_IS_FULL_EXPR_P'
       In C++, statements normally constitute "full expressions";
       temporaries created during a statement are destroyed when the
       statement is complete.  However, G++ sometimes represents
       expressions by statements; these statements will not have
!      `STMT_IS_FULL_EXPR_P' set.  Temporaries created during such
       statements should be destroyed when the innermost enclosing
!      statement with `STMT_IS_FULL_EXPR_P' set is exited.
! 
  
   Here is the list of the various statement nodes, and the macros used to
  access them.  This documentation describes the use of these nodes in
--- 10288,10301 ----
  obtain information about them.  There are a few macros that can be used
  with all statements:
  
! 'STMT_IS_FULL_EXPR_P'
       In C++, statements normally constitute "full expressions";
       temporaries created during a statement are destroyed when the
       statement is complete.  However, G++ sometimes represents
       expressions by statements; these statements will not have
!      'STMT_IS_FULL_EXPR_P' set.  Temporaries created during such
       statements should be destroyed when the innermost enclosing
!      statement with 'STMT_IS_FULL_EXPR_P' set is exited.
  
   Here is the list of the various statement nodes, and the macros used to
  access them.  This documentation describes the use of these nodes in
*************** non-template functions (including instan
*** 10448,10459 ****
  In template functions, the same nodes are used, but sometimes in
  slightly different ways.
  
!  Many of the statements have substatements.  For example, a `while'
! loop will have a body, which is itself a statement.  If the substatement
! is `NULL_TREE', it is considered equivalent to a statement consisting
! of a single `;', i.e., an expression statement in which the expression
! has been omitted.  A substatement may in fact be a list of statements,
! connected via their `TREE_CHAIN's.  So, you should always process the
  statement tree by looping over substatements, like this:
       void process_stmt (stmt)
            tree stmt;
--- 10303,10314 ----
  In template functions, the same nodes are used, but sometimes in
  slightly different ways.
  
!  Many of the statements have substatements.  For example, a 'while' loop
! will have a body, which is itself a statement.  If the substatement is
! 'NULL_TREE', it is considered equivalent to a statement consisting of a
! single ';', i.e., an expression statement in which the expression has
! been omitted.  A substatement may in fact be a list of statements,
! connected via their 'TREE_CHAIN's.  So, you should always process the
  statement tree by looping over substatements, like this:
       void process_stmt (stmt)
            tree stmt;
*************** statement tree by looping over substatem
*** 10473,10569 ****
             stmt = TREE_CHAIN (stmt);
           }
       }
!  In other words, while the `then' clause of an `if' statement in C++
! can be only one statement (although that one statement may be a
! compound statement), the intermediate representation will sometimes use
! several statements chained together.
  
! `BREAK_STMT'
!      Used to represent a `break' statement.  There are no additional
       fields.
  
! `CILK_SPAWN_STMT'
       Used to represent a spawning function in the Cilk Plus language
       extension.  This tree has one field that holds the name of the
!      spawning function.  `_Cilk_spawn' can be written in C in the
       following way:
  
!           `_Cilk_spawn' <function_name> (<parameters>);
  
!      Detailed description for usage and functionality of `_Cilk_spawn'
!      can be found at http://www.cilkplus.org
  
- `CILK_SYNC_STMT'
       This statement is part of the Cilk Plus language extension.  It
       indicates that the current function cannot continue in parallel
       with its spawned children.  There are no additional fields.
!      `_Cilk_sync' can be written in C in the following way:
  
!           `_Cilk_sync';
  
- `CLEANUP_STMT'
       Used to represent an action that should take place upon exit from
       the enclosing scope.  Typically, these actions are calls to
       destructors for local objects, but back ends cannot rely on this
       fact.  If these nodes are in fact representing such destructors,
!      `CLEANUP_DECL' will be the `VAR_DECL' destroyed.  Otherwise,
!      `CLEANUP_DECL' will be `NULL_TREE'.  In any case, the
!      `CLEANUP_EXPR' is the expression to execute.  The cleanups
!      executed on exit from a scope should be run in the reverse order
!      of the order in which the associated `CLEANUP_STMT's were
!      encountered.
  
! `CONTINUE_STMT'
!      Used to represent a `continue' statement.  There are no additional
       fields.
  
! `CTOR_STMT'
!      Used to mark the beginning (if `CTOR_BEGIN_P' holds) or end (if
!      `CTOR_END_P' holds of the main body of a constructor.  See also
!      `SUBOBJECT' for more information on how to use these nodes.
  
! `DO_STMT'
!      Used to represent a `do' loop.  The body of the loop is given by
!      `DO_BODY' while the termination condition for the loop is given by
!      `DO_COND'.  The condition for a `do'-statement is always an
       expression.
  
! `EMPTY_CLASS_EXPR'
       Used to represent a temporary object of a class with no data whose
       address is never taken.  (All such objects are interchangeable.)
!      The `TREE_TYPE' represents the type of the object.
  
! `EXPR_STMT'
!      Used to represent an expression statement.  Use `EXPR_STMT_EXPR' to
       obtain the expression.
  
! `FOR_STMT'
!      Used to represent a `for' statement.  The `FOR_INIT_STMT' is the
!      initialization statement for the loop.  The `FOR_COND' is the
!      termination condition.  The `FOR_EXPR' is the expression executed
!      right before the `FOR_COND' on each loop iteration; often, this
       expression increments a counter.  The body of the loop is given by
!      `FOR_BODY'.  Note that `FOR_INIT_STMT' and `FOR_BODY' return
!      statements, while `FOR_COND' and `FOR_EXPR' return expressions.
  
! `HANDLER'
!      Used to represent a C++ `catch' block.  The `HANDLER_TYPE' is the
       type of exception that will be caught by this handler; it is equal
!      (by pointer equality) to `NULL' if this handler is for all types.
!      `HANDLER_PARMS' is the `DECL_STMT' for the catch parameter, and
!      `HANDLER_BODY' is the code for the block itself.
  
! `IF_STMT'
!      Used to represent an `if' statement.  The `IF_COND' is the
       expression.
  
!      If the condition is a `TREE_LIST', then the `TREE_PURPOSE' is a
!      statement (usually a `DECL_STMT').  Each time the condition is
       evaluated, the statement should be executed.  Then, the
!      `TREE_VALUE' should be used as the conditional expression itself.
       This representation is used to handle C++ code like this:
  
!      C++ distinguishes between this and `COND_EXPR' for handling
       templates.
  
            if (int i = 7) ...
--- 10328,10435 ----
             stmt = TREE_CHAIN (stmt);
           }
       }
!  In other words, while the 'then' clause of an 'if' statement in C++ can
! be only one statement (although that one statement may be a compound
! statement), the intermediate representation will sometimes use several
! statements chained together.
  
! 'BREAK_STMT'
! 
!      Used to represent a 'break' statement.  There are no additional
       fields.
  
! 'CILK_SPAWN_STMT'
! 
       Used to represent a spawning function in the Cilk Plus language
       extension.  This tree has one field that holds the name of the
!      spawning function.  '_Cilk_spawn' can be written in C in the
       following way:
  
!           _Cilk_spawn <function_name> (<parameters>);
  
!      Detailed description for usage and functionality of '_Cilk_spawn'
!      can be found at <https://www.cilkplus.org>.
! 
! 'CILK_SYNC_STMT'
  
       This statement is part of the Cilk Plus language extension.  It
       indicates that the current function cannot continue in parallel
       with its spawned children.  There are no additional fields.
!      '_Cilk_sync' can be written in C in the following way:
  
!           _Cilk_sync;
! 
! 'CLEANUP_STMT'
  
       Used to represent an action that should take place upon exit from
       the enclosing scope.  Typically, these actions are calls to
       destructors for local objects, but back ends cannot rely on this
       fact.  If these nodes are in fact representing such destructors,
!      'CLEANUP_DECL' will be the 'VAR_DECL' destroyed.  Otherwise,
!      'CLEANUP_DECL' will be 'NULL_TREE'.  In any case, the
!      'CLEANUP_EXPR' is the expression to execute.  The cleanups executed
!      on exit from a scope should be run in the reverse order of the
!      order in which the associated 'CLEANUP_STMT's were encountered.
  
! 'CONTINUE_STMT'
! 
!      Used to represent a 'continue' statement.  There are no additional
       fields.
  
! 'CTOR_STMT'
  
!      Used to mark the beginning (if 'CTOR_BEGIN_P' holds) or end (if
!      'CTOR_END_P' holds of the main body of a constructor.  See also
!      'SUBOBJECT' for more information on how to use these nodes.
! 
! 'DO_STMT'
! 
!      Used to represent a 'do' loop.  The body of the loop is given by
!      'DO_BODY' while the termination condition for the loop is given by
!      'DO_COND'.  The condition for a 'do'-statement is always an
       expression.
  
! 'EMPTY_CLASS_EXPR'
! 
       Used to represent a temporary object of a class with no data whose
       address is never taken.  (All such objects are interchangeable.)
!      The 'TREE_TYPE' represents the type of the object.
  
! 'EXPR_STMT'
! 
!      Used to represent an expression statement.  Use 'EXPR_STMT_EXPR' to
       obtain the expression.
  
! 'FOR_STMT'
! 
!      Used to represent a 'for' statement.  The 'FOR_INIT_STMT' is the
!      initialization statement for the loop.  The 'FOR_COND' is the
!      termination condition.  The 'FOR_EXPR' is the expression executed
!      right before the 'FOR_COND' on each loop iteration; often, this
       expression increments a counter.  The body of the loop is given by
!      'FOR_BODY'.  Note that 'FOR_INIT_STMT' and 'FOR_BODY' return
!      statements, while 'FOR_COND' and 'FOR_EXPR' return expressions.
  
! 'HANDLER'
! 
!      Used to represent a C++ 'catch' block.  The 'HANDLER_TYPE' is the
       type of exception that will be caught by this handler; it is equal
!      (by pointer equality) to 'NULL' if this handler is for all types.
!      'HANDLER_PARMS' is the 'DECL_STMT' for the catch parameter, and
!      'HANDLER_BODY' is the code for the block itself.
  
! 'IF_STMT'
! 
!      Used to represent an 'if' statement.  The 'IF_COND' is the
       expression.
  
!      If the condition is a 'TREE_LIST', then the 'TREE_PURPOSE' is a
!      statement (usually a 'DECL_STMT').  Each time the condition is
       evaluated, the statement should be executed.  Then, the
!      'TREE_VALUE' should be used as the conditional expression itself.
       This representation is used to handle C++ code like this:
  
!      C++ distinguishes between this and 'COND_EXPR' for handling
       templates.
  
            if (int i = 7) ...
*************** several statements chained together.
*** 10571,10626 ****
       where there is a new local variable (or variables) declared within
       the condition.
  
!      The `THEN_CLAUSE' represents the statement given by the `then'
!      condition, while the `ELSE_CLAUSE' represents the statement given
!      by the `else' condition.
  
- `SUBOBJECT'
       In a constructor, these nodes are used to mark the point at which a
!      subobject of `this' is fully constructed.  If, after this point, an
!      exception is thrown before a `CTOR_STMT' with `CTOR_END_P' set is
!      encountered, the `SUBOBJECT_CLEANUP' must be executed.  The
       cleanups must be executed in the reverse order in which they
       appear.
  
! `SWITCH_STMT'
!      Used to represent a `switch' statement.  The `SWITCH_STMT_COND' is
       the expression on which the switch is occurring.  See the
!      documentation for an `IF_STMT' for more information on the
!      representation used for the condition.  The `SWITCH_STMT_BODY' is
!      the body of the switch statement.   The `SWITCH_STMT_TYPE' is the
       original type of switch expression as given in the source, before
       any compiler conversions.
  
! `TRY_BLOCK'
!      Used to represent a `try' block.  The body of the try block is
!      given by `TRY_STMTS'.  Each of the catch blocks is a `HANDLER'
!      node.  The first handler is given by `TRY_HANDLERS'.  Subsequent
!      handlers are obtained by following the `TREE_CHAIN' link from one
       handler to the next.  The body of the handler is given by
!      `HANDLER_BODY'.
  
!      If `CLEANUP_P' holds of the `TRY_BLOCK', then the `TRY_HANDLERS'
!      will not be a `HANDLER' node.  Instead, it will be an expression
!      that should be executed if an exception is thrown in the try
!      block.  It must rethrow the exception after executing that code.
!      And, if an exception is thrown while the expression is executing,
!      `terminate' must be called.
  
! `USING_STMT'
!      Used to represent a `using' directive.  The namespace is given by
!      `USING_STMT_NAMESPACE', which will be a NAMESPACE_DECL.  This node
       is needed inside template functions, to implement using directives
       during instantiation.
  
! `WHILE_STMT'
!      Used to represent a `while' loop.  The `WHILE_COND' is the
       termination condition for the loop.  See the documentation for an
!      `IF_STMT' for more information on the representation used for the
       condition.
  
!      The `WHILE_BODY' is the body of the loop.
! 
  
  
  File: gccint.info,  Node: C++ Expressions,  Prev: Statements for C++,  Up: C and C++ Trees
--- 10437,10494 ----
       where there is a new local variable (or variables) declared within
       the condition.
  
!      The 'THEN_CLAUSE' represents the statement given by the 'then'
!      condition, while the 'ELSE_CLAUSE' represents the statement given
!      by the 'else' condition.
! 
! 'SUBOBJECT'
  
       In a constructor, these nodes are used to mark the point at which a
!      subobject of 'this' is fully constructed.  If, after this point, an
!      exception is thrown before a 'CTOR_STMT' with 'CTOR_END_P' set is
!      encountered, the 'SUBOBJECT_CLEANUP' must be executed.  The
       cleanups must be executed in the reverse order in which they
       appear.
  
! 'SWITCH_STMT'
! 
!      Used to represent a 'switch' statement.  The 'SWITCH_STMT_COND' is
       the expression on which the switch is occurring.  See the
!      documentation for an 'IF_STMT' for more information on the
!      representation used for the condition.  The 'SWITCH_STMT_BODY' is
!      the body of the switch statement.  The 'SWITCH_STMT_TYPE' is the
       original type of switch expression as given in the source, before
       any compiler conversions.
  
! 'TRY_BLOCK'
!      Used to represent a 'try' block.  The body of the try block is
!      given by 'TRY_STMTS'.  Each of the catch blocks is a 'HANDLER'
!      node.  The first handler is given by 'TRY_HANDLERS'.  Subsequent
!      handlers are obtained by following the 'TREE_CHAIN' link from one
       handler to the next.  The body of the handler is given by
!      'HANDLER_BODY'.
  
!      If 'CLEANUP_P' holds of the 'TRY_BLOCK', then the 'TRY_HANDLERS'
!      will not be a 'HANDLER' node.  Instead, it will be an expression
!      that should be executed if an exception is thrown in the try block.
!      It must rethrow the exception after executing that code.  And, if
!      an exception is thrown while the expression is executing,
!      'terminate' must be called.
  
! 'USING_STMT'
!      Used to represent a 'using' directive.  The namespace is given by
!      'USING_STMT_NAMESPACE', which will be a NAMESPACE_DECL.  This node
       is needed inside template functions, to implement using directives
       during instantiation.
  
! 'WHILE_STMT'
! 
!      Used to represent a 'while' loop.  The 'WHILE_COND' is the
       termination condition for the loop.  See the documentation for an
!      'IF_STMT' for more information on the representation used for the
       condition.
  
!      The 'WHILE_BODY' is the body of the loop.
  
  
  File: gccint.info,  Node: C++ Expressions,  Prev: Statements for C++,  Up: C and C++ Trees
*************** File: gccint.info,  Node: C++ Expression
*** 10630,10671 ****
  
  This section describes expressions specific to the C and C++ front ends.
  
! `TYPEID_EXPR'
!      Used to represent a `typeid' expression.
  
! `NEW_EXPR'
! `VEC_NEW_EXPR'
!      Used to represent a call to `new' and `new[]' respectively.
  
! `DELETE_EXPR'
! `VEC_DELETE_EXPR'
!      Used to represent a call to `delete' and `delete[]' respectively.
  
- `MEMBER_REF'
       Represents a reference to a member of a class.
  
! `THROW_EXPR'
!      Represents an instance of `throw' in the program.  Operand 0,
!      which is the expression to throw, may be `NULL_TREE'.
  
! `AGGR_INIT_EXPR'
!      An `AGGR_INIT_EXPR' represents the initialization as the return
       value of a function call, or as the result of a constructor.  An
!      `AGGR_INIT_EXPR' will only appear as a full-expression, or as the
!      second operand of a `TARGET_EXPR'.  `AGGR_INIT_EXPR's have a
!      representation similar to that of `CALL_EXPR's.  You can use the
!      `AGGR_INIT_EXPR_FN' and `AGGR_INIT_EXPR_ARG' macros to access the
       function to call and the arguments to pass.
  
!      If `AGGR_INIT_VIA_CTOR_P' holds of the `AGGR_INIT_EXPR', then the
       initialization is via a constructor call.  The address of the
!      `AGGR_INIT_EXPR_SLOT' operand, which is always a `VAR_DECL', is
       taken, and this value replaces the first argument in the argument
       list.
  
       In either case, the expression is void.
  
- 
  
  File: gccint.info,  Node: Java Trees,  Prev: C and C++ Trees,  Up: GENERIC
  
--- 10498,10543 ----
  
  This section describes expressions specific to the C and C++ front ends.
  
! 'TYPEID_EXPR'
  
!      Used to represent a 'typeid' expression.
  
! 'NEW_EXPR'
! 'VEC_NEW_EXPR'
! 
!      Used to represent a call to 'new' and 'new[]' respectively.
! 
! 'DELETE_EXPR'
! 'VEC_DELETE_EXPR'
! 
!      Used to represent a call to 'delete' and 'delete[]' respectively.
! 
! 'MEMBER_REF'
  
       Represents a reference to a member of a class.
  
! 'THROW_EXPR'
  
!      Represents an instance of 'throw' in the program.  Operand 0, which
!      is the expression to throw, may be 'NULL_TREE'.
! 
! 'AGGR_INIT_EXPR'
!      An 'AGGR_INIT_EXPR' represents the initialization as the return
       value of a function call, or as the result of a constructor.  An
!      'AGGR_INIT_EXPR' will only appear as a full-expression, or as the
!      second operand of a 'TARGET_EXPR'.  'AGGR_INIT_EXPR's have a
!      representation similar to that of 'CALL_EXPR's.  You can use the
!      'AGGR_INIT_EXPR_FN' and 'AGGR_INIT_EXPR_ARG' macros to access the
       function to call and the arguments to pass.
  
!      If 'AGGR_INIT_VIA_CTOR_P' holds of the 'AGGR_INIT_EXPR', then the
       initialization is via a constructor call.  The address of the
!      'AGGR_INIT_EXPR_SLOT' operand, which is always a 'VAR_DECL', is
       taken, and this value replaces the first argument in the argument
       list.
  
       In either case, the expression is void.
  
  
  File: gccint.info,  Node: Java Trees,  Prev: C and C++ Trees,  Up: GENERIC
  
*************** File: gccint.info,  Node: GIMPLE,  Next:
*** 10679,10740 ****
  *********
  
  GIMPLE is a three-address representation derived from GENERIC by
! breaking down GENERIC expressions into tuples of no more than 3
! operands (with some exceptions like function calls).  GIMPLE was
! heavily influenced by the SIMPLE IL used by the McCAT compiler project
! at McGill University, though we have made some different choices.  For
! one thing, SIMPLE doesn't support `goto'.
  
   Temporaries are introduced to hold intermediate values needed to
! compute complex expressions. Additionally, all the control structures
  used in GENERIC are lowered into conditional jumps, lexical scopes are
  removed and exception regions are converted into an on the side
  exception region tree.
  
   The compiler pass which converts GENERIC into GIMPLE is referred to as
! the `gimplifier'.  The gimplifier works recursively, generating GIMPLE
  tuples out of the original GENERIC expressions.
  
   One of the early implementation strategies used for the GIMPLE
  representation was to use the same internal data structures used by
! front ends to represent parse trees. This simplified implementation
  because we could leverage existing functionality and interfaces.
  However, GIMPLE is a much more restrictive representation than abstract
  syntax trees (AST), therefore it does not require the full structural
  complexity provided by the main tree data structure.
  
   The GENERIC representation of a function is stored in the
! `DECL_SAVED_TREE' field of the associated `FUNCTION_DECL' tree node.
! It is converted to GIMPLE by a call to `gimplify_function_tree'.
  
   If a front end wants to include language-specific tree codes in the
  tree representation which it provides to the back end, it must provide a
! definition of `LANG_HOOKS_GIMPLIFY_EXPR' which knows how to convert the
! front end trees to GIMPLE.  Usually such a hook will involve much of
! the same code for expanding front end trees to RTL.  This function can
  return fully lowered GIMPLE, or it can return GENERIC trees and let the
  main gimplifier lower them the rest of the way; this is often simpler.
  GIMPLE that is not fully lowered is known as "High GIMPLE" and consists
! of the IL before the pass `pass_lower_cf'.  High GIMPLE contains some
! container statements like lexical scopes (represented by `GIMPLE_BIND')
! and nested expressions (e.g., `GIMPLE_TRY'), while "Low GIMPLE" exposes
! all of the implicit jumps for control and exception expressions
! directly in the IL and EH region trees.
  
   The C and C++ front ends currently convert directly from front end
  trees to GIMPLE, and hand that off to the back end rather than first
  converting to GENERIC.  Their gimplifier hooks know about all the
! `_STMT' nodes and how to convert them to GENERIC forms.  There was some
  work done on a genericization pass which would run first, but the
! existence of `STMT_EXPR' meant that in order to convert all of the C
  statements into GENERIC equivalents would involve walking the entire
  tree anyway, so it was simpler to lower all the way.  This might change
  in the future if someone writes an optimization pass which would work
  better with higher-level trees, but currently the optimizers all expect
  GIMPLE.
  
!  You can request to dump a C-like representation of the GIMPLE form
! with the flag `-fdump-tree-gimple'.
  
  * Menu:
  
--- 10551,10612 ----
  *********
  
  GIMPLE is a three-address representation derived from GENERIC by
! breaking down GENERIC expressions into tuples of no more than 3 operands
! (with some exceptions like function calls).  GIMPLE was heavily
! influenced by the SIMPLE IL used by the McCAT compiler project at McGill
! University, though we have made some different choices.  For one thing,
! SIMPLE doesn't support 'goto'.
  
   Temporaries are introduced to hold intermediate values needed to
! compute complex expressions.  Additionally, all the control structures
  used in GENERIC are lowered into conditional jumps, lexical scopes are
  removed and exception regions are converted into an on the side
  exception region tree.
  
   The compiler pass which converts GENERIC into GIMPLE is referred to as
! the 'gimplifier'.  The gimplifier works recursively, generating GIMPLE
  tuples out of the original GENERIC expressions.
  
   One of the early implementation strategies used for the GIMPLE
  representation was to use the same internal data structures used by
! front ends to represent parse trees.  This simplified implementation
  because we could leverage existing functionality and interfaces.
  However, GIMPLE is a much more restrictive representation than abstract
  syntax trees (AST), therefore it does not require the full structural
  complexity provided by the main tree data structure.
  
   The GENERIC representation of a function is stored in the
! 'DECL_SAVED_TREE' field of the associated 'FUNCTION_DECL' tree node.  It
! is converted to GIMPLE by a call to 'gimplify_function_tree'.
  
   If a front end wants to include language-specific tree codes in the
  tree representation which it provides to the back end, it must provide a
! definition of 'LANG_HOOKS_GIMPLIFY_EXPR' which knows how to convert the
! front end trees to GIMPLE.  Usually such a hook will involve much of the
! same code for expanding front end trees to RTL.  This function can
  return fully lowered GIMPLE, or it can return GENERIC trees and let the
  main gimplifier lower them the rest of the way; this is often simpler.
  GIMPLE that is not fully lowered is known as "High GIMPLE" and consists
! of the IL before the pass 'pass_lower_cf'.  High GIMPLE contains some
! container statements like lexical scopes (represented by 'GIMPLE_BIND')
! and nested expressions (e.g., 'GIMPLE_TRY'), while "Low GIMPLE" exposes
! all of the implicit jumps for control and exception expressions directly
! in the IL and EH region trees.
  
   The C and C++ front ends currently convert directly from front end
  trees to GIMPLE, and hand that off to the back end rather than first
  converting to GENERIC.  Their gimplifier hooks know about all the
! '_STMT' nodes and how to convert them to GENERIC forms.  There was some
  work done on a genericization pass which would run first, but the
! existence of 'STMT_EXPR' meant that in order to convert all of the C
  statements into GENERIC equivalents would involve walking the entire
  tree anyway, so it was simpler to lower all the way.  This might change
  in the future if someone writes an optimization pass which would work
  better with higher-level trees, but currently the optimizers all expect
  GIMPLE.
  
!  You can request to dump a C-like representation of the GIMPLE form with
! the flag '-fdump-tree-gimple'.
  
  * Menu:
  
*************** File: gccint.info,  Node: Tuple represen
*** 10757,10924 ****
  11.1 Tuple representation
  =========================
  
! GIMPLE instructions are tuples of variable size divided in two groups:
! a header describing the instruction and its locations, and a variable
! length body with all the operands. Tuples are organized into a
  hierarchy with 3 main classes of tuples.
  
! 11.1.1 `gimple_statement_base' (gsbase)
  ---------------------------------------
  
  This is the root of the hierarchy, it holds basic information needed by
! most GIMPLE statements. There are some fields that may not be relevant
  to every GIMPLE statement, but those were moved into the base structure
  to take advantage of holes left by other fields (thus making the
  structure more compact).  The structure takes 4 words (32 bytes) on 64
  bit hosts:
  
  Field                   Size (bits)
! `code'                  8
! `subcode'               16
! `no_warning'            1
! `visited'               1
! `nontemporal_move'      1
! `plf'                   2
! `modified'              1
! `has_volatile_ops'      1
! `references_memory_p'   1
! `uid'                   32
! `location'              32
! `num_ops'               32
! `bb'                    64
! `block'                 63
  Total size              32 bytes
  
!    * `code' Main identifier for a GIMPLE instruction.
  
!    * `subcode' Used to distinguish different variants of the same basic
!      instruction or provide flags applicable to a given code. The
!      `subcode' flags field has different uses depending on the code of
       the instruction, but mostly it distinguishes instructions of the
!      same family. The most prominent use of this field is in
       assignments, where subcode indicates the operation done on the RHS
!      of the assignment. For example, a = b + c is encoded as
!      `GIMPLE_ASSIGN <PLUS_EXPR, a, b, c>'.
  
!    * `no_warning' Bitflag to indicate whether a warning has already
!      been issued on this statement.
  
!    * `visited' General purpose "visited" marker. Set and cleared by
       each pass when needed.
  
!    * `nontemporal_move' Bitflag used in assignments that represent
       non-temporal moves.  Although this bitflag is only used in
       assignments, it was moved into the base to take advantage of the
       bit holes left by the previous fields.
  
!    * `plf' Pass Local Flags. This 2-bit mask can be used as general
!      purpose markers by any pass. Passes are responsible for clearing
       and setting these two flags accordingly.
  
!    * `modified' Bitflag to indicate whether the statement has been
       modified.  Used mainly by the operand scanner to determine when to
       re-scan a statement for operands.
  
!    * `has_volatile_ops' Bitflag to indicate whether this statement
       contains operands that have been marked volatile.
  
!    * `references_memory_p' Bitflag to indicate whether this statement
       contains memory references (i.e., its operands are either global
       variables, or pointer dereferences or anything that must reside in
       memory).
  
!    * `uid' This is an unsigned integer used by passes that want to
!      assign IDs to every statement. These IDs must be assigned and used
       by each pass.
  
!    * `location' This is a `location_t' identifier to specify source code
!      location for this statement. It is inherited from the front end.
  
!    * `num_ops' Number of operands that this statement has. This
       specifies the size of the operand vector embedded in the tuple.
       Only used in some tuples, but it is declared in the base tuple to
       take advantage of the 32-bit hole left by the previous fields.
  
!    * `bb' Basic block holding the instruction.
  
!    * `block' Lexical block holding this statement.  Also used for debug
       information generation.
  
! 11.1.2 `gimple_statement_with_ops'
  ----------------------------------
  
! This tuple is actually split in two: `gimple_statement_with_ops_base'
! and `gimple_statement_with_ops'. This is needed to accommodate the way
! the operand vector is allocated. The operand vector is defined to be an
! array of 1 element. So, to allocate a dynamic number of operands, the
! memory allocator (`gimple_alloc') simply allocates enough memory to
! hold the structure itself plus `N - 1' operands which run "off the end"
! of the structure. For example, to allocate space for a tuple with 3
! operands, `gimple_alloc' reserves `sizeof (struct
  gimple_statement_with_ops) + 2 * sizeof (tree)' bytes.
  
   On the other hand, several fields in this tuple need to be shared with
! the `gimple_statement_with_memory_ops' tuple. So, these common fields
! are placed in `gimple_statement_with_ops_base' which is then inherited
  from the other two tuples.
  
! `gsbase'    256
! `def_ops'   64
! `use_ops'   64
! `op'        `num_ops' * 64
! Total size  48 + 8 * `num_ops' bytes
  
!    * `gsbase' Inherited from `struct gimple_statement_base'.
  
!    * `def_ops' Array of pointers into the operand array indicating all
       the slots that contain a variable written-to by the statement.
!      This array is also used for immediate use chaining. Note that it
       would be possible to not rely on this array, but the changes
       required to implement this are pretty invasive.
  
!    * `use_ops' Similar to `def_ops' but for variables read by the
       statement.
  
!    * `op' Array of trees with `num_ops' slots.
  
! 11.1.3 `gimple_statement_with_memory_ops'
  -----------------------------------------
  
! This tuple is essentially identical to `gimple_statement_with_ops',
  except that it contains 4 additional fields to hold vectors related
! memory stores and loads.  Similar to the previous case, the structure
! is split in two to accommodate for the operand vector
! (`gimple_statement_with_memory_ops_base' and
! `gimple_statement_with_memory_ops').
  
  Field        Size (bits)
! `gsbase'     256
! `def_ops'    64
! `use_ops'    64
! `vdef_ops'   64
! `vuse_ops'   64
! `stores'     64
! `loads'      64
! `op'         `num_ops' * 64
! Total size   80 + 8 * `num_ops' bytes
  
!    * `vdef_ops' Similar to `def_ops' but for `VDEF' operators. There is
!      one entry per memory symbol written by this statement. This is
       used to maintain the memory SSA use-def and def-def chains.
  
!    * `vuse_ops' Similar to `use_ops' but for `VUSE' operators. There is
!      one entry per memory symbol loaded by this statement. This is used
       to maintain the memory SSA use-def chains.
  
!    * `stores' Bitset with all the UIDs for the symbols written-to by the
!      statement.  This is different than `vdef_ops' in that all the
!      affected symbols are mentioned in this set.  If memory
!      partitioning is enabled, the `vdef_ops' vector will refer to memory
!      partitions. Furthermore, no SSA information is stored in this set.
  
!    * `loads' Similar to `stores', but for memory loads. (Note that there
!      is some amount of redundancy here, it should be possible to reduce
!      memory utilization further by removing these sets).
  
   All the other tuples are defined in terms of these three basic ones.
  Each tuple will add some fields.
--- 10629,10797 ----
  11.1 Tuple representation
  =========================
  
! GIMPLE instructions are tuples of variable size divided in two groups: a
! header describing the instruction and its locations, and a variable
! length body with all the operands.  Tuples are organized into a
  hierarchy with 3 main classes of tuples.
  
! 11.1.1 'gimple_statement_base' (gsbase)
  ---------------------------------------
  
  This is the root of the hierarchy, it holds basic information needed by
! most GIMPLE statements.  There are some fields that may not be relevant
  to every GIMPLE statement, but those were moved into the base structure
  to take advantage of holes left by other fields (thus making the
  structure more compact).  The structure takes 4 words (32 bytes) on 64
  bit hosts:
  
  Field                   Size (bits)
! 'code'                  8
! 'subcode'               16
! 'no_warning'            1
! 'visited'               1
! 'nontemporal_move'      1
! 'plf'                   2
! 'modified'              1
! 'has_volatile_ops'      1
! 'references_memory_p'   1
! 'uid'                   32
! 'location'              32
! 'num_ops'               32
! 'bb'                    64
! 'block'                 63
  Total size              32 bytes
  
!    * 'code' Main identifier for a GIMPLE instruction.
  
!    * 'subcode' Used to distinguish different variants of the same basic
!      instruction or provide flags applicable to a given code.  The
!      'subcode' flags field has different uses depending on the code of
       the instruction, but mostly it distinguishes instructions of the
!      same family.  The most prominent use of this field is in
       assignments, where subcode indicates the operation done on the RHS
!      of the assignment.  For example, a = b + c is encoded as
!      'GIMPLE_ASSIGN <PLUS_EXPR, a, b, c>'.
  
!    * 'no_warning' Bitflag to indicate whether a warning has already been
!      issued on this statement.
  
!    * 'visited' General purpose "visited" marker.  Set and cleared by
       each pass when needed.
  
!    * 'nontemporal_move' Bitflag used in assignments that represent
       non-temporal moves.  Although this bitflag is only used in
       assignments, it was moved into the base to take advantage of the
       bit holes left by the previous fields.
  
!    * 'plf' Pass Local Flags.  This 2-bit mask can be used as general
!      purpose markers by any pass.  Passes are responsible for clearing
       and setting these two flags accordingly.
  
!    * 'modified' Bitflag to indicate whether the statement has been
       modified.  Used mainly by the operand scanner to determine when to
       re-scan a statement for operands.
  
!    * 'has_volatile_ops' Bitflag to indicate whether this statement
       contains operands that have been marked volatile.
  
!    * 'references_memory_p' Bitflag to indicate whether this statement
       contains memory references (i.e., its operands are either global
       variables, or pointer dereferences or anything that must reside in
       memory).
  
!    * 'uid' This is an unsigned integer used by passes that want to
!      assign IDs to every statement.  These IDs must be assigned and used
       by each pass.
  
!    * 'location' This is a 'location_t' identifier to specify source code
!      location for this statement.  It is inherited from the front end.
  
!    * 'num_ops' Number of operands that this statement has.  This
       specifies the size of the operand vector embedded in the tuple.
       Only used in some tuples, but it is declared in the base tuple to
       take advantage of the 32-bit hole left by the previous fields.
  
!    * 'bb' Basic block holding the instruction.
  
!    * 'block' Lexical block holding this statement.  Also used for debug
       information generation.
  
! 11.1.2 'gimple_statement_with_ops'
  ----------------------------------
  
! This tuple is actually split in two: 'gimple_statement_with_ops_base'
! and 'gimple_statement_with_ops'.  This is needed to accommodate the way
! the operand vector is allocated.  The operand vector is defined to be an
! array of 1 element.  So, to allocate a dynamic number of operands, the
! memory allocator ('gimple_alloc') simply allocates enough memory to hold
! the structure itself plus 'N - 1' operands which run "off the end" of
! the structure.  For example, to allocate space for a tuple with 3
! operands, 'gimple_alloc' reserves 'sizeof (struct
  gimple_statement_with_ops) + 2 * sizeof (tree)' bytes.
  
   On the other hand, several fields in this tuple need to be shared with
! the 'gimple_statement_with_memory_ops' tuple.  So, these common fields
! are placed in 'gimple_statement_with_ops_base' which is then inherited
  from the other two tuples.
  
! 'gsbase'    256
! 'def_ops'   64
! 'use_ops'   64
! 'op'        'num_ops' * 64
! Total       48 + 8 * 'num_ops' bytes
! size
  
!    * 'gsbase' Inherited from 'struct gimple_statement_base'.
  
!    * 'def_ops' Array of pointers into the operand array indicating all
       the slots that contain a variable written-to by the statement.
!      This array is also used for immediate use chaining.  Note that it
       would be possible to not rely on this array, but the changes
       required to implement this are pretty invasive.
  
!    * 'use_ops' Similar to 'def_ops' but for variables read by the
       statement.
  
!    * 'op' Array of trees with 'num_ops' slots.
  
! 11.1.3 'gimple_statement_with_memory_ops'
  -----------------------------------------
  
! This tuple is essentially identical to 'gimple_statement_with_ops',
  except that it contains 4 additional fields to hold vectors related
! memory stores and loads.  Similar to the previous case, the structure is
! split in two to accommodate for the operand vector
! ('gimple_statement_with_memory_ops_base' and
! 'gimple_statement_with_memory_ops').
  
  Field        Size (bits)
! 'gsbase'     256
! 'def_ops'    64
! 'use_ops'    64
! 'vdef_ops'   64
! 'vuse_ops'   64
! 'stores'     64
! 'loads'      64
! 'op'         'num_ops' * 64
! Total size   80 + 8 * 'num_ops' bytes
  
!    * 'vdef_ops' Similar to 'def_ops' but for 'VDEF' operators.  There is
!      one entry per memory symbol written by this statement.  This is
       used to maintain the memory SSA use-def and def-def chains.
  
!    * 'vuse_ops' Similar to 'use_ops' but for 'VUSE' operators.  There is
!      one entry per memory symbol loaded by this statement.  This is used
       to maintain the memory SSA use-def chains.
  
!    * 'stores' Bitset with all the UIDs for the symbols written-to by the
!      statement.  This is different than 'vdef_ops' in that all the
!      affected symbols are mentioned in this set.  If memory partitioning
!      is enabled, the 'vdef_ops' vector will refer to memory partitions.
!      Furthermore, no SSA information is stored in this set.
  
!    * 'loads' Similar to 'stores', but for memory loads.  (Note that
!      there is some amount of redundancy here, it should be possible to
!      reduce memory utilization further by removing these sets).
  
   All the other tuples are defined in terms of these three basic ones.
  Each tuple will add some fields.
*************** File: gccint.info,  Node: Class hierarch
*** 10930,10937 ****
  =========================================
  
  The following diagram shows the C++ inheritance hierarchy of statement
! kinds, along with their relationships to `GSS_' values (layouts) and
! `GIMPLE_' values (codes):
  
          gimple_statement_base
            |    layout: GSS_BASE
--- 10803,10810 ----
  =========================================
  
  The following diagram shows the C++ inheritance hierarchy of statement
! kinds, along with their relationships to 'GSS_' values (layouts) and
! 'GIMPLE_' values (codes):
  
          gimple_statement_base
            |    layout: GSS_BASE
*************** File: gccint.info,  Node: GIMPLE instruc
*** 11075,11109 ****
  The following table briefly describes the GIMPLE instruction set.
  
  Instruction                    High GIMPLE   Low GIMPLE
! `GIMPLE_ASM'                   x             x
! `GIMPLE_ASSIGN'                x             x
! `GIMPLE_BIND'                  x             
! `GIMPLE_CALL'                  x             x
! `GIMPLE_CATCH'                 x             
! `GIMPLE_COND'                  x             x
! `GIMPLE_DEBUG'                 x             x
! `GIMPLE_EH_FILTER'             x             
! `GIMPLE_GOTO'                  x             x
! `GIMPLE_LABEL'                 x             x
! `GIMPLE_NOP'                   x             x
! `GIMPLE_OMP_ATOMIC_LOAD'       x             x
! `GIMPLE_OMP_ATOMIC_STORE'      x             x
! `GIMPLE_OMP_CONTINUE'          x             x
! `GIMPLE_OMP_CRITICAL'          x             x
! `GIMPLE_OMP_FOR'               x             x
! `GIMPLE_OMP_MASTER'            x             x
! `GIMPLE_OMP_ORDERED'           x             x
! `GIMPLE_OMP_PARALLEL'          x             x
! `GIMPLE_OMP_RETURN'            x             x
! `GIMPLE_OMP_SECTION'           x             x
! `GIMPLE_OMP_SECTIONS'          x             x
! `GIMPLE_OMP_SECTIONS_SWITCH'   x             x
! `GIMPLE_OMP_SINGLE'            x             x
! `GIMPLE_PHI'                                 x
! `GIMPLE_RESX'                                x
! `GIMPLE_RETURN'                x             x
! `GIMPLE_SWITCH'                x             x
! `GIMPLE_TRY'                   x             
  
  
  File: gccint.info,  Node: GIMPLE Exception Handling,  Next: Temporaries,  Prev: GIMPLE instruction set,  Up: GIMPLE
--- 10948,10982 ----
  The following table briefly describes the GIMPLE instruction set.
  
  Instruction                    High GIMPLE   Low GIMPLE
! 'GIMPLE_ASM'                   x             x
! 'GIMPLE_ASSIGN'                x             x
! 'GIMPLE_BIND'                  x
! 'GIMPLE_CALL'                  x             x
! 'GIMPLE_CATCH'                 x
! 'GIMPLE_COND'                  x             x
! 'GIMPLE_DEBUG'                 x             x
! 'GIMPLE_EH_FILTER'             x
! 'GIMPLE_GOTO'                  x             x
! 'GIMPLE_LABEL'                 x             x
! 'GIMPLE_NOP'                   x             x
! 'GIMPLE_OMP_ATOMIC_LOAD'       x             x
! 'GIMPLE_OMP_ATOMIC_STORE'      x             x
! 'GIMPLE_OMP_CONTINUE'          x             x
! 'GIMPLE_OMP_CRITICAL'          x             x
! 'GIMPLE_OMP_FOR'               x             x
! 'GIMPLE_OMP_MASTER'            x             x
! 'GIMPLE_OMP_ORDERED'           x             x
! 'GIMPLE_OMP_PARALLEL'          x             x
! 'GIMPLE_OMP_RETURN'            x             x
! 'GIMPLE_OMP_SECTION'           x             x
! 'GIMPLE_OMP_SECTIONS'          x             x
! 'GIMPLE_OMP_SECTIONS_SWITCH'   x             x
! 'GIMPLE_OMP_SINGLE'            x             x
! 'GIMPLE_PHI'                                 x
! 'GIMPLE_RESX'                                x
! 'GIMPLE_RETURN'                x             x
! 'GIMPLE_SWITCH'                x             x
! 'GIMPLE_TRY'                   x
  
  
  File: gccint.info,  Node: GIMPLE Exception Handling,  Next: Temporaries,  Prev: GIMPLE instruction set,  Up: GIMPLE
*************** File: gccint.info,  Node: GIMPLE Excepti
*** 11112,11150 ****
  =======================
  
  Other exception handling constructs are represented using
! `GIMPLE_TRY_CATCH'.  `GIMPLE_TRY_CATCH' has two operands.  The first
  operand is a sequence of statements to execute.  If executing these
  statements does not throw an exception, then the second operand is
  ignored.  Otherwise, if an exception is thrown, then the second operand
! of the `GIMPLE_TRY_CATCH' is checked.  The second operand may have the
  following forms:
  
    1. A sequence of statements to execute.  When an exception occurs,
       these statements are executed, and then the exception is rethrown.
  
!   2. A sequence of `GIMPLE_CATCH' statements.  Each `GIMPLE_CATCH' has
!      a list of applicable exception types and handler code.  If the
!      thrown exception matches one of the caught types, the associated
!      handler code is executed.  If the handler code falls off the
!      bottom, execution continues after the original `GIMPLE_TRY_CATCH'.
  
!   3. A `GIMPLE_EH_FILTER' statement.  This has a list of permitted
!      exception types, and code to handle a match failure.  If the
!      thrown exception does not match one of the allowed types, the
!      associated match failure code is executed.  If the thrown exception
!      does match, it continues unwinding the stack looking for the next
       handler.
  
- 
   Currently throwing an exception is not directly represented in GIMPLE,
  since it is implemented by calling a function.  At some point in the
  future we will want to add some way to express that the call will throw
  an exception of a known type.
  
   Just before running the optimizers, the compiler lowers the high-level
! EH constructs above into a set of `goto's, magic labels, and EH
! regions.  Continuing to unwind at the end of a cleanup is represented
! with a `GIMPLE_RESX'.
  
  
  File: gccint.info,  Node: Temporaries,  Next: Operands,  Prev: GIMPLE Exception Handling,  Up: GIMPLE
--- 10985,11022 ----
  =======================
  
  Other exception handling constructs are represented using
! 'GIMPLE_TRY_CATCH'.  'GIMPLE_TRY_CATCH' has two operands.  The first
  operand is a sequence of statements to execute.  If executing these
  statements does not throw an exception, then the second operand is
  ignored.  Otherwise, if an exception is thrown, then the second operand
! of the 'GIMPLE_TRY_CATCH' is checked.  The second operand may have the
  following forms:
  
    1. A sequence of statements to execute.  When an exception occurs,
       these statements are executed, and then the exception is rethrown.
  
!   2. A sequence of 'GIMPLE_CATCH' statements.  Each 'GIMPLE_CATCH' has a
!      list of applicable exception types and handler code.  If the thrown
!      exception matches one of the caught types, the associated handler
!      code is executed.  If the handler code falls off the bottom,
!      execution continues after the original 'GIMPLE_TRY_CATCH'.
  
!   3. A 'GIMPLE_EH_FILTER' statement.  This has a list of permitted
!      exception types, and code to handle a match failure.  If the thrown
!      exception does not match one of the allowed types, the associated
!      match failure code is executed.  If the thrown exception does
!      match, it continues unwinding the stack looking for the next
       handler.
  
   Currently throwing an exception is not directly represented in GIMPLE,
  since it is implemented by calling a function.  At some point in the
  future we will want to add some way to express that the call will throw
  an exception of a known type.
  
   Just before running the optimizers, the compiler lowers the high-level
! EH constructs above into a set of 'goto's, magic labels, and EH regions.
! Continuing to unwind at the end of a cleanup is represented with a
! 'GIMPLE_RESX'.
  
  
  File: gccint.info,  Node: Temporaries,  Next: Operands,  Prev: GIMPLE Exception Handling,  Up: GIMPLE
*************** File: gccint.info,  Node: Temporaries,
*** 11153,11171 ****
  ================
  
  When gimplification encounters a subexpression that is too complex, it
! creates a new temporary variable to hold the value of the
! subexpression, and adds a new statement to initialize it before the
! current statement. These special temporaries are known as `expression
! temporaries', and are allocated using `get_formal_tmp_var'.  The
! compiler tries to always evaluate identical expressions into the same
! temporary, to simplify elimination of redundant calculations.
  
!  We can only use expression temporaries when we know that it will not
! be reevaluated before its value is used, and that it will not be
! otherwise modified(1). Other temporaries can be allocated using
! `get_initialized_tmp_var' or `create_tmp_var'.
  
!  Currently, an expression like `a = b + 5' is not reduced any further.
  We tried converting it to something like
       T1 = b + 5;
       a = T1;
--- 11025,11043 ----
  ================
  
  When gimplification encounters a subexpression that is too complex, it
! creates a new temporary variable to hold the value of the subexpression,
! and adds a new statement to initialize it before the current statement.
! These special temporaries are known as 'expression temporaries', and are
! allocated using 'get_formal_tmp_var'.  The compiler tries to always
! evaluate identical expressions into the same temporary, to simplify
! elimination of redundant calculations.
  
!  We can only use expression temporaries when we know that it will not be
! reevaluated before its value is used, and that it will not be otherwise
! modified(1).  Other temporaries can be allocated using
! 'get_initialized_tmp_var' or 'create_tmp_var'.
  
!  Currently, an expression like 'a = b + 5' is not reduced any further.
  We tried converting it to something like
       T1 = b + 5;
       a = T1;
*************** value is explicitly loaded into a tempor
*** 11175,11183 ****
  the value of an expression to a memory variable goes through a
  temporary.
  
!  ---------- Footnotes ----------
  
!  (1) These restrictions are derived from those in Morgan 4.8.
  
  
  File: gccint.info,  Node: Operands,  Next: Manipulating GIMPLE statements,  Prev: Temporaries,  Up: GIMPLE
--- 11047,11055 ----
  the value of an expression to a memory variable goes through a
  temporary.
  
!    ---------- Footnotes ----------
  
!    (1) These restrictions are derived from those in Morgan 4.8.
  
  
  File: gccint.info,  Node: Operands,  Next: Manipulating GIMPLE statements,  Prev: Temporaries,  Up: GIMPLE
*************** File: gccint.info,  Node: Operands,  Nex
*** 11187,11204 ****
  
  In general, expressions in GIMPLE consist of an operation and the
  appropriate number of simple operands; these operands must either be a
! GIMPLE rvalue (`is_gimple_val'), i.e. a constant or a register
! variable.  More complex operands are factored out into temporaries, so
! that
       a = b + c + d
   becomes
       T1 = b + c;
       a = T1 + d;
  
!  The same rule holds for arguments to a `GIMPLE_CALL'.
  
   The target of an assignment is usually a variable, but can also be a
! `MEM_REF' or a compound lvalue as described below.
  
  * Menu:
  
--- 11059,11075 ----
  
  In general, expressions in GIMPLE consist of an operation and the
  appropriate number of simple operands; these operands must either be a
! GIMPLE rvalue ('is_gimple_val'), i.e. a constant or a register variable.
! More complex operands are factored out into temporaries, so that
       a = b + c + d
   becomes
       T1 = b + c;
       a = T1 + d;
  
!  The same rule holds for arguments to a 'GIMPLE_CALL'.
  
   The target of an assignment is usually a variable, but can also be a
! 'MEM_REF' or a compound lvalue as described below.
  
  * Menu:
  
*************** File: gccint.info,  Node: Compound Lvalu
*** 11223,11229 ****
  -----------------------
  
  Currently compound lvalues involving array and structure field
! references are not broken down; an expression like `a.b[2] = 42' is not
  reduced any further (though complex array subscripts are).  This
  restriction is a workaround for limitations in later optimizers; if we
  were to convert this to
--- 11094,11100 ----
  -----------------------
  
  Currently compound lvalues involving array and structure field
! references are not broken down; an expression like 'a.b[2] = 42' is not
  reduced any further (though complex array subscripts are).  This
  restriction is a workaround for limitations in later optimizers; if we
  were to convert this to
*************** were to convert this to
*** 11231,11239 ****
       T1 = &a.b;
       T1[2] = 42;
  
!  alias analysis would not remember that the reference to `T1[2]' came
! by way of `a.b', so it would think that the assignment could alias
! another member of `a'; this broke `struct-alias-1.c'.  Future optimizer
  improvements may make this limitation unnecessary.
  
  
--- 11102,11110 ----
       T1 = &a.b;
       T1[2] = 42;
  
!  alias analysis would not remember that the reference to 'T1[2]' came by
! way of 'a.b', so it would think that the assignment could alias another
! member of 'a'; this broke 'struct-alias-1.c'.  Future optimizer
  improvements may make this limitation unnecessary.
  
  
*************** File: gccint.info,  Node: Conditional Ex
*** 11242,11249 ****
  11.6.3 Conditional Expressions
  ------------------------------
  
! A C `?:' expression is converted into an `if' statement with each
! branch assigning to the same temporary.  So,
  
       a = b ? c : d;
   becomes
--- 11113,11120 ----
  11.6.3 Conditional Expressions
  ------------------------------
  
! A C '?:' expression is converted into an 'if' statement with each branch
! assigning to the same temporary.  So,
  
       a = b ? c : d;
   becomes
*************** branch assigning to the same temporary.
*** 11253,11264 ****
         T1 = d;
       a = T1;
  
!  The GIMPLE level if-conversion pass re-introduces `?:' expression, if
! appropriate. It is used to vectorize loops with conditions using vector
  conditional operations.
  
!  Note that in GIMPLE, `if' statements are represented using
! `GIMPLE_COND', as described below.
  
  
  File: gccint.info,  Node: Logical Operators,  Prev: Conditional Expressions,  Up: Operands
--- 11124,11135 ----
         T1 = d;
       a = T1;
  
!  The GIMPLE level if-conversion pass re-introduces '?:' expression, if
! appropriate.  It is used to vectorize loops with conditions using vector
  conditional operations.
  
!  Note that in GIMPLE, 'if' statements are represented using
! 'GIMPLE_COND', as described below.
  
  
  File: gccint.info,  Node: Logical Operators,  Prev: Conditional Expressions,  Up: Operands
*************** File: gccint.info,  Node: Logical Operat
*** 11266,11318 ****
  11.6.4 Logical Operators
  ------------------------
  
! Except when they appear in the condition operand of a `GIMPLE_COND',
! logical `and' and `or' operators are simplified as follows: `a = b &&
! c' becomes
  
       T1 = (bool)b;
       if (T1 == true)
         T1 = (bool)c;
       a = T1;
  
!  Note that `T1' in this example cannot be an expression temporary,
  because it has two different assignments.
  
  11.6.5 Manipulating operands
  ----------------------------
  
! All gimple operands are of type `tree'.  But only certain types of
! trees are allowed to be used as operand tuples.  Basic validation is
! controlled by the function `get_gimple_rhs_class', which given a tree
! code, returns an `enum' with the following values of type `enum
  gimple_rhs_class'
  
!    * `GIMPLE_INVALID_RHS' The tree cannot be used as a GIMPLE operand.
  
!    * `GIMPLE_TERNARY_RHS' The tree is a valid GIMPLE ternary operation.
  
!    * `GIMPLE_BINARY_RHS' The tree is a valid GIMPLE binary operation.
  
!    * `GIMPLE_UNARY_RHS' The tree is a valid GIMPLE unary operation.
  
!    * `GIMPLE_SINGLE_RHS' The tree is a single object, that cannot be
!      split into simpler operands (for instance, `SSA_NAME', `VAR_DECL',
!      `COMPONENT_REF', etc).
  
!      This operand class also acts as an escape hatch for tree nodes
!      that may be flattened out into the operand vector, but would need
!      more than two slots on the RHS.  For instance, a `COND_EXPR'
!      expression of the form `(a op b) ? x : y' could be flattened out
!      on the operand vector using 4 slots, but it would also require
!      additional processing to distinguish `c = a op b' from `c = a op b
!      ? x : y'.  Something similar occurs with `ASSERT_EXPR'.   In time,
!      these special case tree expressions should be flattened into the
!      operand vector.
  
!  For tree nodes in the categories `GIMPLE_TERNARY_RHS',
! `GIMPLE_BINARY_RHS' and `GIMPLE_UNARY_RHS', they cannot be stored
! inside tuples directly.  They first need to be flattened and separated
! into individual components.  For instance, given the GENERIC expression
  
       a = b + c
  
--- 11137,11189 ----
  11.6.4 Logical Operators
  ------------------------
  
! Except when they appear in the condition operand of a 'GIMPLE_COND',
! logical 'and' and 'or' operators are simplified as follows: 'a = b && c'
! becomes
  
       T1 = (bool)b;
       if (T1 == true)
         T1 = (bool)c;
       a = T1;
  
!  Note that 'T1' in this example cannot be an expression temporary,
  because it has two different assignments.
  
  11.6.5 Manipulating operands
  ----------------------------
  
! All gimple operands are of type 'tree'.  But only certain types of trees
! are allowed to be used as operand tuples.  Basic validation is
! controlled by the function 'get_gimple_rhs_class', which given a tree
! code, returns an 'enum' with the following values of type 'enum
  gimple_rhs_class'
  
!    * 'GIMPLE_INVALID_RHS' The tree cannot be used as a GIMPLE operand.
  
!    * 'GIMPLE_TERNARY_RHS' The tree is a valid GIMPLE ternary operation.
  
!    * 'GIMPLE_BINARY_RHS' The tree is a valid GIMPLE binary operation.
  
!    * 'GIMPLE_UNARY_RHS' The tree is a valid GIMPLE unary operation.
  
!    * 'GIMPLE_SINGLE_RHS' The tree is a single object, that cannot be
!      split into simpler operands (for instance, 'SSA_NAME', 'VAR_DECL',
!      'COMPONENT_REF', etc).
  
!      This operand class also acts as an escape hatch for tree nodes that
!      may be flattened out into the operand vector, but would need more
!      than two slots on the RHS. For instance, a 'COND_EXPR' expression
!      of the form '(a op b) ? x : y' could be flattened out on the
!      operand vector using 4 slots, but it would also require additional
!      processing to distinguish 'c = a op b' from 'c = a op b ? x : y'.
!      Something similar occurs with 'ASSERT_EXPR'.  In time, these
!      special case tree expressions should be flattened into the operand
!      vector.
  
!  For tree nodes in the categories 'GIMPLE_TERNARY_RHS',
! 'GIMPLE_BINARY_RHS' and 'GIMPLE_UNARY_RHS', they cannot be stored inside
! tuples directly.  They first need to be flattened and separated into
! individual components.  For instance, given the GENERIC expression
  
       a = b + c
  
*************** into individual components.  For instanc
*** 11320,11362 ****
  
       MODIFY_EXPR <VAR_DECL  <a>, PLUS_EXPR <VAR_DECL <b>, VAR_DECL <c>>>
  
!  In this case, the GIMPLE form for this statement is logically
! identical to its GENERIC form but in GIMPLE, the `PLUS_EXPR' on the RHS
! of the assignment is not represented as a tree, instead the two
! operands are taken out of the `PLUS_EXPR' sub-tree and flattened into
! the GIMPLE tuple as follows:
  
       GIMPLE_ASSIGN <PLUS_EXPR, VAR_DECL <a>, VAR_DECL <b>, VAR_DECL <c>>
  
  11.6.6 Operand vector allocation
  --------------------------------
  
! The operand vector is stored at the bottom of the three tuple
! structures that accept operands. This means, that depending on the code
! of a given statement, its operand vector will be at different offsets
! from the base of the structure.  To access tuple operands use the
! following accessors
  
   -- GIMPLE function: unsigned gimple_num_ops (gimple g)
       Returns the number of operands in statement G.
  
   -- GIMPLE function: tree gimple_op (gimple g, unsigned i)
!      Returns operand `I' from statement `G'.
  
   -- GIMPLE function: tree * gimple_ops (gimple g)
!      Returns a pointer into the operand vector for statement `G'.  This
!      is computed using an internal table called `gimple_ops_offset_'[].
!      This table is indexed by the gimple code of `G'.
  
!      When the compiler is built, this table is filled-in using the
!      sizes of the structures used by each statement code defined in
       gimple.def.  Since the operand vector is at the bottom of the
!      structure, for a gimple code `C' the offset is computed as sizeof
!      (struct-of `C') - sizeof (tree).
  
       This mechanism adds one memory indirection to every access when
!      using `gimple_op'(), if this becomes a bottleneck, a pass can
!      choose to memoize the result from `gimple_ops'() and use that to
       access the operands.
  
  11.6.7 Operand validation
--- 11191,11232 ----
  
       MODIFY_EXPR <VAR_DECL  <a>, PLUS_EXPR <VAR_DECL <b>, VAR_DECL <c>>>
  
!  In this case, the GIMPLE form for this statement is logically identical
! to its GENERIC form but in GIMPLE, the 'PLUS_EXPR' on the RHS of the
! assignment is not represented as a tree, instead the two operands are
! taken out of the 'PLUS_EXPR' sub-tree and flattened into the GIMPLE
! tuple as follows:
  
       GIMPLE_ASSIGN <PLUS_EXPR, VAR_DECL <a>, VAR_DECL <b>, VAR_DECL <c>>
  
  11.6.6 Operand vector allocation
  --------------------------------
  
! The operand vector is stored at the bottom of the three tuple structures
! that accept operands.  This means, that depending on the code of a given
! statement, its operand vector will be at different offsets from the base
! of the structure.  To access tuple operands use the following accessors
  
   -- GIMPLE function: unsigned gimple_num_ops (gimple g)
       Returns the number of operands in statement G.
  
   -- GIMPLE function: tree gimple_op (gimple g, unsigned i)
!      Returns operand 'I' from statement 'G'.
  
   -- GIMPLE function: tree * gimple_ops (gimple g)
!      Returns a pointer into the operand vector for statement 'G'.  This
!      is computed using an internal table called 'gimple_ops_offset_'[].
!      This table is indexed by the gimple code of 'G'.
  
!      When the compiler is built, this table is filled-in using the sizes
!      of the structures used by each statement code defined in
       gimple.def.  Since the operand vector is at the bottom of the
!      structure, for a gimple code 'C' the offset is computed as sizeof
!      (struct-of 'C') - sizeof (tree).
  
       This mechanism adds one memory indirection to every access when
!      using 'gimple_op'(), if this becomes a bottleneck, a pass can
!      choose to memoize the result from 'gimple_ops'() and use that to
       access the operands.
  
  11.6.7 Operand validation
*************** following accessors
*** 11364,11430 ****
  
  When adding a new operand to a gimple statement, the operand will be
  validated according to what each tuple accepts in its operand vector.
! These predicates are called by the `gimple_NAME_set_...()'.  Each tuple
  will use one of the following predicates (Note, this list is not
  exhaustive):
  
   -- GIMPLE function: bool is_gimple_val (tree t)
       Returns true if t is a "GIMPLE value", which are all the
       non-addressable stack variables (variables for which
!      `is_gimple_reg' returns true) and constants (expressions for which
!      `is_gimple_min_invariant' returns true).
  
   -- GIMPLE function: bool is_gimple_addressable (tree t)
!      Returns true if t is a symbol or memory reference whose address
!      can be taken.
  
   -- GIMPLE function: bool is_gimple_asm_val (tree t)
!      Similar to `is_gimple_val' but it also accepts hard registers.
  
   -- GIMPLE function: bool is_gimple_call_addr (tree t)
       Return true if t is a valid expression to use as the function
!      called by a `GIMPLE_CALL'.
  
   -- GIMPLE function: bool is_gimple_mem_ref_addr (tree t)
!      Return true if t is a valid expression to use as first operand of
!      a `MEM_REF' expression.
  
   -- GIMPLE function: bool is_gimple_constant (tree t)
       Return true if t is a valid gimple constant.
  
   -- GIMPLE function: bool is_gimple_min_invariant (tree t)
       Return true if t is a valid minimal invariant.  This is different
!      from constants, in that the specific value of t may not be known
!      at compile time, but it is known that it doesn't change (e.g., the
       address of a function local variable).
  
   -- GIMPLE function: bool is_gimple_ip_invariant (tree t)
       Return true if t is an interprocedural invariant.  This means that
!      t is a valid invariant in all functions (e.g. it can be an address
       of a global variable but not of a local one).
  
   -- GIMPLE function: bool is_gimple_ip_invariant_address (tree t)
!      Return true if t is an `ADDR_EXPR' that does not change once the
       program is running (and which is valid in all functions).
  
  11.6.8 Statement validation
  ---------------------------
  
   -- GIMPLE function: bool is_gimple_assign (gimple g)
!      Return true if the code of g is `GIMPLE_ASSIGN'.
  
   -- GIMPLE function: bool is_gimple_call (gimple g)
!      Return true if the code of g is `GIMPLE_CALL'.
  
   -- GIMPLE function: bool is_gimple_debug (gimple g)
!      Return true if the code of g is `GIMPLE_DEBUG'.
  
   -- GIMPLE function: bool gimple_assign_cast_p (const_gimple g)
!      Return true if g is a `GIMPLE_ASSIGN' that performs a type cast
       operation.
  
   -- GIMPLE function: bool gimple_debug_bind_p (gimple g)
!      Return true if g is a `GIMPLE_DEBUG' that binds the value of an
       expression to a variable.
  
   -- GIMPLE function: bool is_gimple_omp (gimple g)
--- 11234,11300 ----
  
  When adding a new operand to a gimple statement, the operand will be
  validated according to what each tuple accepts in its operand vector.
! These predicates are called by the 'gimple_NAME_set_...()'.  Each tuple
  will use one of the following predicates (Note, this list is not
  exhaustive):
  
   -- GIMPLE function: bool is_gimple_val (tree t)
       Returns true if t is a "GIMPLE value", which are all the
       non-addressable stack variables (variables for which
!      'is_gimple_reg' returns true) and constants (expressions for which
!      'is_gimple_min_invariant' returns true).
  
   -- GIMPLE function: bool is_gimple_addressable (tree t)
!      Returns true if t is a symbol or memory reference whose address can
!      be taken.
  
   -- GIMPLE function: bool is_gimple_asm_val (tree t)
!      Similar to 'is_gimple_val' but it also accepts hard registers.
  
   -- GIMPLE function: bool is_gimple_call_addr (tree t)
       Return true if t is a valid expression to use as the function
!      called by a 'GIMPLE_CALL'.
  
   -- GIMPLE function: bool is_gimple_mem_ref_addr (tree t)
!      Return true if t is a valid expression to use as first operand of a
!      'MEM_REF' expression.
  
   -- GIMPLE function: bool is_gimple_constant (tree t)
       Return true if t is a valid gimple constant.
  
   -- GIMPLE function: bool is_gimple_min_invariant (tree t)
       Return true if t is a valid minimal invariant.  This is different
!      from constants, in that the specific value of t may not be known at
!      compile time, but it is known that it doesn't change (e.g., the
       address of a function local variable).
  
   -- GIMPLE function: bool is_gimple_ip_invariant (tree t)
       Return true if t is an interprocedural invariant.  This means that
!      t is a valid invariant in all functions (e.g.  it can be an address
       of a global variable but not of a local one).
  
   -- GIMPLE function: bool is_gimple_ip_invariant_address (tree t)
!      Return true if t is an 'ADDR_EXPR' that does not change once the
       program is running (and which is valid in all functions).
  
  11.6.8 Statement validation
  ---------------------------
  
   -- GIMPLE function: bool is_gimple_assign (gimple g)
!      Return true if the code of g is 'GIMPLE_ASSIGN'.
  
   -- GIMPLE function: bool is_gimple_call (gimple g)
!      Return true if the code of g is 'GIMPLE_CALL'.
  
   -- GIMPLE function: bool is_gimple_debug (gimple g)
!      Return true if the code of g is 'GIMPLE_DEBUG'.
  
   -- GIMPLE function: bool gimple_assign_cast_p (const_gimple g)
!      Return true if g is a 'GIMPLE_ASSIGN' that performs a type cast
       operation.
  
   -- GIMPLE function: bool gimple_debug_bind_p (gimple g)
!      Return true if g is a 'GIMPLE_DEBUG' that binds the value of an
       expression to a variable.
  
   -- GIMPLE function: bool is_gimple_omp (gimple g)
*************** File: gccint.info,  Node: Manipulating G
*** 11436,11443 ****
  11.7 Manipulating GIMPLE statements
  ===================================
  
! This section documents all the functions available to handle each of
! the GIMPLE instructions.
  
  11.7.1 Common accessors
  -----------------------
--- 11306,11313 ----
  11.7 Manipulating GIMPLE statements
  ===================================
  
! This section documents all the functions available to handle each of the
! GIMPLE instructions.
  
  11.7.1 Common accessors
  -----------------------
*************** the GIMPLE instructions.
*** 11445,11583 ****
  The following are common accessors for gimple statements.
  
   -- GIMPLE function: enum gimple_code gimple_code (gimple g)
!      Return the code for statement `G'.
  
   -- GIMPLE function: basic_block gimple_bb (gimple g)
!      Return the basic block to which statement `G' belongs to.
  
   -- GIMPLE function: tree gimple_block (gimple g)
!      Return the lexical scope block holding statement `G'.
  
   -- GIMPLE function: tree gimple_expr_type (gimple stmt)
!      Return the type of the main expression computed by `STMT'. Return
!      `void_type_node' if `STMT' computes nothing. This will only return
!      something meaningful for `GIMPLE_ASSIGN', `GIMPLE_COND' and
!      `GIMPLE_CALL'.  For all other tuple codes, it will return
!      `void_type_node'.
  
   -- GIMPLE function: enum tree_code gimple_expr_code (gimple stmt)
!      Return the tree code for the expression computed by `STMT'.  This
!      is only meaningful for `GIMPLE_CALL', `GIMPLE_ASSIGN' and
!      `GIMPLE_COND'.  If `STMT' is `GIMPLE_CALL', it will return
!      `CALL_EXPR'.  For `GIMPLE_COND', it returns the code of the
!      comparison predicate.  For `GIMPLE_ASSIGN' it returns the code of
!      the operation performed by the `RHS' of the assignment.
  
   -- GIMPLE function: void gimple_set_block (gimple g, tree block)
!      Set the lexical scope block of `G' to `BLOCK'.
  
   -- GIMPLE function: location_t gimple_locus (gimple g)
!      Return locus information for statement `G'.
  
   -- GIMPLE function: void gimple_set_locus (gimple g, location_t locus)
!      Set locus information for statement `G'.
  
   -- GIMPLE function: bool gimple_locus_empty_p (gimple g)
!      Return true if `G' does not have locus information.
  
   -- GIMPLE function: bool gimple_no_warning_p (gimple stmt)
!      Return true if no warnings should be emitted for statement `STMT'.
  
   -- GIMPLE function: void gimple_set_visited (gimple stmt, bool
            visited_p)
!      Set the visited status on statement `STMT' to `VISITED_P'.
  
   -- GIMPLE function: bool gimple_visited_p (gimple stmt)
!      Return the visited status on statement `STMT'.
  
   -- GIMPLE function: void gimple_set_plf (gimple stmt, enum plf_mask
            plf, bool val_p)
!      Set pass local flag `PLF' on statement `STMT' to `VAL_P'.
  
!  -- GIMPLE function: unsigned int gimple_plf (gimple stmt, enum
!           plf_mask plf)
!      Return the value of pass local flag `PLF' on statement `STMT'.
  
   -- GIMPLE function: bool gimple_has_ops (gimple g)
!      Return true if statement `G' has register or memory operands.
  
   -- GIMPLE function: bool gimple_has_mem_ops (gimple g)
!      Return true if statement `G' has memory operands.
  
   -- GIMPLE function: unsigned gimple_num_ops (gimple g)
!      Return the number of operands for statement `G'.
  
   -- GIMPLE function: tree * gimple_ops (gimple g)
!      Return the array of operands for statement `G'.
  
   -- GIMPLE function: tree gimple_op (gimple g, unsigned i)
!      Return operand `I' for statement `G'.
  
   -- GIMPLE function: tree * gimple_op_ptr (gimple g, unsigned i)
!      Return a pointer to operand `I' for statement `G'.
  
   -- GIMPLE function: void gimple_set_op (gimple g, unsigned i, tree op)
!      Set operand `I' of statement `G' to `OP'.
  
   -- GIMPLE function: bitmap gimple_addresses_taken (gimple stmt)
       Return the set of symbols that have had their address taken by
!      `STMT'.
  
   -- GIMPLE function: struct def_optype_d * gimple_def_ops (gimple g)
!      Return the set of `DEF' operands for statement `G'.
  
   -- GIMPLE function: void gimple_set_def_ops (gimple g, struct
            def_optype_d *def)
!      Set `DEF' to be the set of `DEF' operands for statement `G'.
  
   -- GIMPLE function: struct use_optype_d * gimple_use_ops (gimple g)
!      Return the set of `USE' operands for statement `G'.
  
   -- GIMPLE function: void gimple_set_use_ops (gimple g, struct
            use_optype_d *use)
!      Set `USE' to be the set of `USE' operands for statement `G'.
  
   -- GIMPLE function: struct voptype_d * gimple_vuse_ops (gimple g)
!      Return the set of `VUSE' operands for statement `G'.
  
   -- GIMPLE function: void gimple_set_vuse_ops (gimple g, struct
            voptype_d *ops)
!      Set `OPS' to be the set of `VUSE' operands for statement `G'.
  
   -- GIMPLE function: struct voptype_d * gimple_vdef_ops (gimple g)
!      Return the set of `VDEF' operands for statement `G'.
  
   -- GIMPLE function: void gimple_set_vdef_ops (gimple g, struct
            voptype_d *ops)
!      Set `OPS' to be the set of `VDEF' operands for statement `G'.
  
   -- GIMPLE function: bitmap gimple_loaded_syms (gimple g)
!      Return the set of symbols loaded by statement `G'.  Each element of
!      the set is the `DECL_UID' of the corresponding symbol.
  
   -- GIMPLE function: bitmap gimple_stored_syms (gimple g)
!      Return the set of symbols stored by statement `G'.  Each element of
!      the set is the `DECL_UID' of the corresponding symbol.
  
   -- GIMPLE function: bool gimple_modified_p (gimple g)
!      Return true if statement `G' has operands and the modified field
       has been set.
  
   -- GIMPLE function: bool gimple_has_volatile_ops (gimple stmt)
!      Return true if statement `STMT' contains volatile operands.
  
!  -- GIMPLE function: void gimple_set_has_volatile_ops (gimple stmt,
!           bool volatilep)
!      Return true if statement `STMT' contains volatile operands.
  
   -- GIMPLE function: void update_stmt (gimple s)
!      Mark statement `S' as modified, and update it.
  
   -- GIMPLE function: void update_stmt_if_modified (gimple s)
!      Update statement `S' if it has been marked modified.
  
   -- GIMPLE function: gimple gimple_copy (gimple stmt)
!      Return a deep copy of statement `STMT'.
  
  
  File: gccint.info,  Node: Tuple specific accessors,  Next: GIMPLE sequences,  Prev: Manipulating GIMPLE statements,  Up: GIMPLE
--- 11315,11453 ----
  The following are common accessors for gimple statements.
  
   -- GIMPLE function: enum gimple_code gimple_code (gimple g)
!      Return the code for statement 'G'.
  
   -- GIMPLE function: basic_block gimple_bb (gimple g)
!      Return the basic block to which statement 'G' belongs to.
  
   -- GIMPLE function: tree gimple_block (gimple g)
!      Return the lexical scope block holding statement 'G'.
  
   -- GIMPLE function: tree gimple_expr_type (gimple stmt)
!      Return the type of the main expression computed by 'STMT'.  Return
!      'void_type_node' if 'STMT' computes nothing.  This will only return
!      something meaningful for 'GIMPLE_ASSIGN', 'GIMPLE_COND' and
!      'GIMPLE_CALL'.  For all other tuple codes, it will return
!      'void_type_node'.
  
   -- GIMPLE function: enum tree_code gimple_expr_code (gimple stmt)
!      Return the tree code for the expression computed by 'STMT'.  This
!      is only meaningful for 'GIMPLE_CALL', 'GIMPLE_ASSIGN' and
!      'GIMPLE_COND'.  If 'STMT' is 'GIMPLE_CALL', it will return
!      'CALL_EXPR'.  For 'GIMPLE_COND', it returns the code of the
!      comparison predicate.  For 'GIMPLE_ASSIGN' it returns the code of
!      the operation performed by the 'RHS' of the assignment.
  
   -- GIMPLE function: void gimple_set_block (gimple g, tree block)
!      Set the lexical scope block of 'G' to 'BLOCK'.
  
   -- GIMPLE function: location_t gimple_locus (gimple g)
!      Return locus information for statement 'G'.
  
   -- GIMPLE function: void gimple_set_locus (gimple g, location_t locus)
!      Set locus information for statement 'G'.
  
   -- GIMPLE function: bool gimple_locus_empty_p (gimple g)
!      Return true if 'G' does not have locus information.
  
   -- GIMPLE function: bool gimple_no_warning_p (gimple stmt)
!      Return true if no warnings should be emitted for statement 'STMT'.
  
   -- GIMPLE function: void gimple_set_visited (gimple stmt, bool
            visited_p)
!      Set the visited status on statement 'STMT' to 'VISITED_P'.
  
   -- GIMPLE function: bool gimple_visited_p (gimple stmt)
!      Return the visited status on statement 'STMT'.
  
   -- GIMPLE function: void gimple_set_plf (gimple stmt, enum plf_mask
            plf, bool val_p)
!      Set pass local flag 'PLF' on statement 'STMT' to 'VAL_P'.
  
!  -- GIMPLE function: unsigned int gimple_plf (gimple stmt, enum plf_mask
!           plf)
!      Return the value of pass local flag 'PLF' on statement 'STMT'.
  
   -- GIMPLE function: bool gimple_has_ops (gimple g)
!      Return true if statement 'G' has register or memory operands.
  
   -- GIMPLE function: bool gimple_has_mem_ops (gimple g)
!      Return true if statement 'G' has memory operands.
  
   -- GIMPLE function: unsigned gimple_num_ops (gimple g)
!      Return the number of operands for statement 'G'.
  
   -- GIMPLE function: tree * gimple_ops (gimple g)
!      Return the array of operands for statement 'G'.
  
   -- GIMPLE function: tree gimple_op (gimple g, unsigned i)
!      Return operand 'I' for statement 'G'.
  
   -- GIMPLE function: tree * gimple_op_ptr (gimple g, unsigned i)
!      Return a pointer to operand 'I' for statement 'G'.
  
   -- GIMPLE function: void gimple_set_op (gimple g, unsigned i, tree op)
!      Set operand 'I' of statement 'G' to 'OP'.
  
   -- GIMPLE function: bitmap gimple_addresses_taken (gimple stmt)
       Return the set of symbols that have had their address taken by
!      'STMT'.
  
   -- GIMPLE function: struct def_optype_d * gimple_def_ops (gimple g)
!      Return the set of 'DEF' operands for statement 'G'.
  
   -- GIMPLE function: void gimple_set_def_ops (gimple g, struct
            def_optype_d *def)
!      Set 'DEF' to be the set of 'DEF' operands for statement 'G'.
  
   -- GIMPLE function: struct use_optype_d * gimple_use_ops (gimple g)
!      Return the set of 'USE' operands for statement 'G'.
  
   -- GIMPLE function: void gimple_set_use_ops (gimple g, struct
            use_optype_d *use)
!      Set 'USE' to be the set of 'USE' operands for statement 'G'.
  
   -- GIMPLE function: struct voptype_d * gimple_vuse_ops (gimple g)
!      Return the set of 'VUSE' operands for statement 'G'.
  
   -- GIMPLE function: void gimple_set_vuse_ops (gimple g, struct
            voptype_d *ops)
!      Set 'OPS' to be the set of 'VUSE' operands for statement 'G'.
  
   -- GIMPLE function: struct voptype_d * gimple_vdef_ops (gimple g)
!      Return the set of 'VDEF' operands for statement 'G'.
  
   -- GIMPLE function: void gimple_set_vdef_ops (gimple g, struct
            voptype_d *ops)
!      Set 'OPS' to be the set of 'VDEF' operands for statement 'G'.
  
   -- GIMPLE function: bitmap gimple_loaded_syms (gimple g)
!      Return the set of symbols loaded by statement 'G'.  Each element of
!      the set is the 'DECL_UID' of the corresponding symbol.
  
   -- GIMPLE function: bitmap gimple_stored_syms (gimple g)
!      Return the set of symbols stored by statement 'G'.  Each element of
!      the set is the 'DECL_UID' of the corresponding symbol.
  
   -- GIMPLE function: bool gimple_modified_p (gimple g)
!      Return true if statement 'G' has operands and the modified field
       has been set.
  
   -- GIMPLE function: bool gimple_has_volatile_ops (gimple stmt)
!      Return true if statement 'STMT' contains volatile operands.
  
!  -- GIMPLE function: void gimple_set_has_volatile_ops (gimple stmt, bool
!           volatilep)
!      Return true if statement 'STMT' contains volatile operands.
  
   -- GIMPLE function: void update_stmt (gimple s)
!      Mark statement 'S' as modified, and update it.
  
   -- GIMPLE function: void update_stmt_if_modified (gimple s)
!      Update statement 'S' if it has been marked modified.
  
   -- GIMPLE function: gimple gimple_copy (gimple stmt)
!      Return a deep copy of statement 'STMT'.
  
  
  File: gccint.info,  Node: Tuple specific accessors,  Next: GIMPLE sequences,  Prev: Manipulating GIMPLE statements,  Up: GIMPLE
*************** File: gccint.info,  Node: Tuple specific
*** 11587,12134 ****
  
  * Menu:
  
! * `GIMPLE_ASM'::
! * `GIMPLE_ASSIGN'::
! * `GIMPLE_BIND'::
! * `GIMPLE_CALL'::
! * `GIMPLE_CATCH'::
! * `GIMPLE_COND'::
! * `GIMPLE_DEBUG'::
! * `GIMPLE_EH_FILTER'::
! * `GIMPLE_LABEL'::
! * `GIMPLE_GOTO'::
! * `GIMPLE_NOP'::
! * `GIMPLE_OMP_ATOMIC_LOAD'::
! * `GIMPLE_OMP_ATOMIC_STORE'::
! * `GIMPLE_OMP_CONTINUE'::
! * `GIMPLE_OMP_CRITICAL'::
! * `GIMPLE_OMP_FOR'::
! * `GIMPLE_OMP_MASTER'::
! * `GIMPLE_OMP_ORDERED'::
! * `GIMPLE_OMP_PARALLEL'::
! * `GIMPLE_OMP_RETURN'::
! * `GIMPLE_OMP_SECTION'::
! * `GIMPLE_OMP_SECTIONS'::
! * `GIMPLE_OMP_SINGLE'::
! * `GIMPLE_PHI'::
! * `GIMPLE_RESX'::
! * `GIMPLE_RETURN'::
! * `GIMPLE_SWITCH'::
! * `GIMPLE_TRY'::
! * `GIMPLE_WITH_CLEANUP_EXPR'::
  
  
! File: gccint.info,  Node: `GIMPLE_ASM',  Next: `GIMPLE_ASSIGN',  Up: Tuple specific accessors
  
! 11.8.1 `GIMPLE_ASM'
  -------------------
  
   -- GIMPLE function: gasm *gimple_build_asm_vec ( const char *string,
!           vec<tree, va_gc> *inputs, vec<tree, va_gc> *outputs,
!           vec<tree, va_gc> *clobbers, vec<tree, va_gc> *labels)
!      Build a `GIMPLE_ASM' statement.  This statement is used for
!      building in-line assembly constructs.  `STRING' is the assembly
!      code.  `INPUTS', `OUTPUTS', `CLOBBERS'  and `LABELS' are the
!      inputs, outputs, clobbered registers and labels.
  
   -- GIMPLE function: unsigned gimple_asm_ninputs (const gasm *g)
!      Return the number of input operands for `GIMPLE_ASM' `G'.
  
   -- GIMPLE function: unsigned gimple_asm_noutputs (const gasm *g)
!      Return the number of output operands for `GIMPLE_ASM' `G'.
  
   -- GIMPLE function: unsigned gimple_asm_nclobbers (const gasm *g)
!      Return the number of clobber operands for `GIMPLE_ASM' `G'.
  
   -- GIMPLE function: tree gimple_asm_input_op (const gasm *g, unsigned
            index)
!      Return input operand `INDEX' of `GIMPLE_ASM' `G'.
  
   -- GIMPLE function: void gimple_asm_set_input_op (gasm *g, unsigned
            index, tree in_op)
!      Set `IN_OP' to be input operand `INDEX' in `GIMPLE_ASM' `G'.
  
   -- GIMPLE function: tree gimple_asm_output_op (const gasm *g, unsigned
            index)
!      Return output operand `INDEX' of `GIMPLE_ASM' `G'.
  
   -- GIMPLE function: void gimple_asm_set_output_op (gasm *g, unsigned
            index, tree out_op)
!      Set `OUT_OP' to be output operand `INDEX' in `GIMPLE_ASM' `G'.
  
!  -- GIMPLE function: tree gimple_asm_clobber_op (const gasm *g,
!           unsigned index)
!      Return clobber operand `INDEX' of `GIMPLE_ASM' `G'.
  
   -- GIMPLE function: void gimple_asm_set_clobber_op (gasm *g, unsigned
            index, tree clobber_op)
!      Set `CLOBBER_OP' to be clobber operand `INDEX' in `GIMPLE_ASM' `G'.
  
   -- GIMPLE function: const char * gimple_asm_string (const gasm *g)
       Return the string representing the assembly instruction in
!      `GIMPLE_ASM' `G'.
  
   -- GIMPLE function: bool gimple_asm_volatile_p (const gasm *g)
!      Return true if `G' is an asm statement marked volatile.
  
   -- GIMPLE function: void gimple_asm_set_volatile (gasm *g, bool
            volatile_p)
!      Mark asm statement `G' as volatile or non-volatile based on
!      `VOLATILE_P'.
  
  
! File: gccint.info,  Node: `GIMPLE_ASSIGN',  Next: `GIMPLE_BIND',  Prev: `GIMPLE_ASM',  Up: Tuple specific accessors
  
! 11.8.2 `GIMPLE_ASSIGN'
  ----------------------
  
   -- GIMPLE function: gassign *gimple_build_assign (tree lhs, tree rhs)
!      Build a `GIMPLE_ASSIGN' statement.  The left-hand side is an lvalue
!      passed in lhs.  The right-hand side can be either a unary or
!      binary tree expression.  The expression tree rhs will be flattened
!      and its operands assigned to the corresponding operand slots in
!      the new statement.  This function is useful when you already have
!      a tree expression that you want to convert into a tuple.  However,
!      try to avoid building expression trees for the sole purpose of
!      calling this function.  If you already have the operands in
!      separate trees, it is better to use `gimple_build_assign' with
!      `enum tree_code' argument and separate arguments for each operand.
  
   -- GIMPLE function: gassign *gimple_build_assign (tree lhs, enum
            tree_code subcode, tree op1, tree op2, tree op3)
!      This function is similar to two operand `gimple_build_assign', but
!      is used to build a `GIMPLE_ASSIGN' statement when the operands of
       the right-hand side of the assignment are already split into
       different operands.
  
       The left-hand side is an lvalue passed in lhs.  Subcode is the
!      `tree_code' for the right-hand side of the assignment.  Op1, op2
       and op3 are the operands.
  
   -- GIMPLE function: gassign *gimple_build_assign (tree lhs, enum
            tree_code subcode, tree op1, tree op2)
!      Like the above 5 operand `gimple_build_assign', but with the last
!      argument `NULL' - this overload should not be used for
!      `GIMPLE_TERNARY_RHS' assignments.
  
   -- GIMPLE function: gassign *gimple_build_assign (tree lhs, enum
            tree_code subcode, tree op1)
!      Like the above 4 operand `gimple_build_assign', but with the last
!      argument `NULL' - this overload should be used only for
!      `GIMPLE_UNARY_RHS' and `GIMPLE_SINGLE_RHS' assignments.
  
   -- GIMPLE function: gimple gimplify_assign (tree dst, tree src,
            gimple_seq *seq_p)
!      Build a new `GIMPLE_ASSIGN' tuple and append it to the end of
!      `*SEQ_P'.
  
!  `DST'/`SRC' are the destination and source respectively.  You can pass
! ungimplified trees in `DST' or `SRC', in which case they will be
  converted to a gimple operand if necessary.
  
!  This function returns the newly created `GIMPLE_ASSIGN' tuple.
  
   -- GIMPLE function: enum tree_code gimple_assign_rhs_code (gimple g)
!      Return the code of the expression computed on the `RHS' of
!      assignment statement `G'.
  
   -- GIMPLE function: enum gimple_rhs_class gimple_assign_rhs_class
            (gimple g)
!      Return the gimple rhs class of the code for the expression
!      computed on the rhs of assignment statement `G'.  This will never
!      return `GIMPLE_INVALID_RHS'.
  
   -- GIMPLE function: tree gimple_assign_lhs (gimple g)
!      Return the `LHS' of assignment statement `G'.
  
   -- GIMPLE function: tree * gimple_assign_lhs_ptr (gimple g)
!      Return a pointer to the `LHS' of assignment statement `G'.
  
   -- GIMPLE function: tree gimple_assign_rhs1 (gimple g)
!      Return the first operand on the `RHS' of assignment statement `G'.
  
   -- GIMPLE function: tree * gimple_assign_rhs1_ptr (gimple g)
!      Return the address of the first operand on the `RHS' of assignment
!      statement `G'.
  
   -- GIMPLE function: tree gimple_assign_rhs2 (gimple g)
!      Return the second operand on the `RHS' of assignment statement `G'.
  
   -- GIMPLE function: tree * gimple_assign_rhs2_ptr (gimple g)
!      Return the address of the second operand on the `RHS' of assignment
!      statement `G'.
  
   -- GIMPLE function: tree gimple_assign_rhs3 (gimple g)
!      Return the third operand on the `RHS' of assignment statement `G'.
  
   -- GIMPLE function: tree * gimple_assign_rhs3_ptr (gimple g)
!      Return the address of the third operand on the `RHS' of assignment
!      statement `G'.
  
   -- GIMPLE function: void gimple_assign_set_lhs (gimple g, tree lhs)
!      Set `LHS' to be the `LHS' operand of assignment statement `G'.
  
   -- GIMPLE function: void gimple_assign_set_rhs1 (gimple g, tree rhs)
!      Set `RHS' to be the first operand on the `RHS' of assignment
!      statement `G'.
  
   -- GIMPLE function: void gimple_assign_set_rhs2 (gimple g, tree rhs)
!      Set `RHS' to be the second operand on the `RHS' of assignment
!      statement `G'.
  
   -- GIMPLE function: void gimple_assign_set_rhs3 (gimple g, tree rhs)
!      Set `RHS' to be the third operand on the `RHS' of assignment
!      statement `G'.
  
   -- GIMPLE function: bool gimple_assign_cast_p (const_gimple s)
!      Return true if `S' is a type-cast assignment.
  
  
! File: gccint.info,  Node: `GIMPLE_BIND',  Next: `GIMPLE_CALL',  Prev: `GIMPLE_ASSIGN',  Up: Tuple specific accessors
  
! 11.8.3 `GIMPLE_BIND'
  --------------------
  
   -- GIMPLE function: gbind *gimple_build_bind (tree vars, gimple_seq
            body)
!      Build a `GIMPLE_BIND' statement with a list of variables in `VARS'
!      and a body of statements in sequence `BODY'.
  
   -- GIMPLE function: tree gimple_bind_vars (const gbind *g)
!      Return the variables declared in the `GIMPLE_BIND' statement `G'.
  
   -- GIMPLE function: void gimple_bind_set_vars (gbind *g, tree vars)
!      Set `VARS' to be the set of variables declared in the `GIMPLE_BIND'
!      statement `G'.
  
   -- GIMPLE function: void gimple_bind_append_vars (gbind *g, tree vars)
!      Append `VARS' to the set of variables declared in the `GIMPLE_BIND'
!      statement `G'.
  
   -- GIMPLE function: gimple_seq gimple_bind_body (gbind *g)
!      Return the GIMPLE sequence contained in the `GIMPLE_BIND' statement
!      `G'.
  
   -- GIMPLE function: void gimple_bind_set_body (gbind *g, gimple_seq
            seq)
!      Set `SEQ' to be sequence contained in the `GIMPLE_BIND' statement
!      `G'.
  
   -- GIMPLE function: void gimple_bind_add_stmt (gbind *gs, gimple stmt)
!      Append a statement to the end of a `GIMPLE_BIND''s body.
  
   -- GIMPLE function: void gimple_bind_add_seq (gbind *gs, gimple_seq
            seq)
!      Append a sequence of statements to the end of a `GIMPLE_BIND''s
       body.
  
   -- GIMPLE function: tree gimple_bind_block (const gbind *g)
!      Return the `TREE_BLOCK' node associated with `GIMPLE_BIND'
!      statement `G'. This is analogous to the `BIND_EXPR_BLOCK' field in
       trees.
  
   -- GIMPLE function: void gimple_bind_set_block (gbind *g, tree block)
!      Set `BLOCK' to be the `TREE_BLOCK' node associated with
!      `GIMPLE_BIND' statement `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_CALL',  Next: `GIMPLE_CATCH',  Prev: `GIMPLE_BIND',  Up: Tuple specific accessors
  
! 11.8.4 `GIMPLE_CALL'
  --------------------
  
   -- GIMPLE function: gcall *gimple_build_call (tree fn, unsigned nargs,
            ...)
!      Build a `GIMPLE_CALL' statement to function `FN'.  The argument
!      `FN' must be either a `FUNCTION_DECL' or a gimple call address as
!      determined by `is_gimple_call_addr'.  `NARGS' are the number of
!      arguments.  The rest of the arguments follow the argument `NARGS',
       and must be trees that are valid as rvalues in gimple (i.e., each
!      operand is validated with `is_gimple_operand').
  
   -- GIMPLE function: gcall *gimple_build_call_from_tree (tree call_expr)
!      Build a `GIMPLE_CALL' from a `CALL_EXPR' node.  The arguments and
       the function are taken from the expression directly.  This routine
!      assumes that `call_expr' is already in GIMPLE form.  That is, its
       operands are GIMPLE values and the function call needs no further
!      simplification.  All the call flags in `call_expr' are copied over
!      to the new `GIMPLE_CALL'.
  
!  -- GIMPLE function: gcall *gimple_build_call_vec (tree fn, `vec<tree>'
            args)
!      Identical to `gimple_build_call' but the arguments are stored in a
!      `vec<tree>'.
  
   -- GIMPLE function: tree gimple_call_lhs (gimple g)
!      Return the `LHS' of call statement `G'.
  
   -- GIMPLE function: tree * gimple_call_lhs_ptr (gimple g)
!      Return a pointer to the `LHS' of call statement `G'.
  
   -- GIMPLE function: void gimple_call_set_lhs (gimple g, tree lhs)
!      Set `LHS' to be the `LHS' operand of call statement `G'.
  
   -- GIMPLE function: tree gimple_call_fn (gimple g)
       Return the tree node representing the function called by call
!      statement `G'.
  
   -- GIMPLE function: void gimple_call_set_fn (gcall *g, tree fn)
!      Set `FN' to be the function called by call statement `G'.  This has
       to be a gimple value specifying the address of the called function.
  
   -- GIMPLE function: tree gimple_call_fndecl (gimple g)
!      If a given `GIMPLE_CALL''s callee is a `FUNCTION_DECL', return it.
!      Otherwise return `NULL'.  This function is analogous to
!      `get_callee_fndecl' in `GENERIC'.
  
   -- GIMPLE function: tree gimple_call_set_fndecl (gimple g, tree fndecl)
!      Set the called function to `FNDECL'.
  
   -- GIMPLE function: tree gimple_call_return_type (const gcall *g)
!      Return the type returned by call statement `G'.
  
   -- GIMPLE function: tree gimple_call_chain (gimple g)
!      Return the static chain for call statement `G'.
  
   -- GIMPLE function: void gimple_call_set_chain (gcall *g, tree chain)
!      Set `CHAIN' to be the static chain for call statement `G'.
  
   -- GIMPLE function: unsigned gimple_call_num_args (gimple g)
!      Return the number of arguments used by call statement `G'.
  
   -- GIMPLE function: tree gimple_call_arg (gimple g, unsigned index)
!      Return the argument at position `INDEX' for call statement `G'.
       The first argument is 0.
  
   -- GIMPLE function: tree * gimple_call_arg_ptr (gimple g, unsigned
            index)
!      Return a pointer to the argument at position `INDEX' for call
!      statement `G'.
  
!  -- GIMPLE function: void gimple_call_set_arg (gimple g, unsigned
!           index, tree arg)
!      Set `ARG' to be the argument at position `INDEX' for call statement
!      `G'.
  
   -- GIMPLE function: void gimple_call_set_tail (gcall *s)
!      Mark call statement `S' as being a tail call (i.e., a call just
!      before the exit of a function). These calls are candidate for tail
       call optimization.
  
   -- GIMPLE function: bool gimple_call_tail_p (gcall *s)
!      Return true if `GIMPLE_CALL' `S' is marked as a tail call.
  
   -- GIMPLE function: bool gimple_call_noreturn_p (gimple s)
!      Return true if `S' is a noreturn call.
  
   -- GIMPLE function: gimple gimple_call_copy_skip_args (gcall *stmt,
            bitmap args_to_skip)
!      Build a `GIMPLE_CALL' identical to `STMT' but skipping the
!      arguments in the positions marked by the set `ARGS_TO_SKIP'.
  
  
! File: gccint.info,  Node: `GIMPLE_CATCH',  Next: `GIMPLE_COND',  Prev: `GIMPLE_CALL',  Up: Tuple specific accessors
  
! 11.8.5 `GIMPLE_CATCH'
  ---------------------
  
   -- GIMPLE function: gcatch *gimple_build_catch (tree types, gimple_seq
            handler)
!      Build a `GIMPLE_CATCH' statement.  `TYPES' are the tree types this
!      catch handles.  `HANDLER' is a sequence of statements with the code
       for the handler.
  
   -- GIMPLE function: tree gimple_catch_types (const gcatch *g)
!      Return the types handled by `GIMPLE_CATCH' statement `G'.
  
   -- GIMPLE function: tree * gimple_catch_types_ptr (gcatch *g)
!      Return a pointer to the types handled by `GIMPLE_CATCH' statement
!      `G'.
  
   -- GIMPLE function: gimple_seq gimple_catch_handler (gcatch *g)
       Return the GIMPLE sequence representing the body of the handler of
!      `GIMPLE_CATCH' statement `G'.
  
   -- GIMPLE function: void gimple_catch_set_types (gcatch *g, tree t)
!      Set `T' to be the set of types handled by `GIMPLE_CATCH' `G'.
  
   -- GIMPLE function: void gimple_catch_set_handler (gcatch *g,
            gimple_seq handler)
!      Set `HANDLER' to be the body of `GIMPLE_CATCH' `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_COND',  Next: `GIMPLE_DEBUG',  Prev: `GIMPLE_CATCH',  Up: Tuple specific accessors
  
! 11.8.6 `GIMPLE_COND'
  --------------------
  
   -- GIMPLE function: gcond *gimple_build_cond ( enum tree_code
            pred_code, tree lhs, tree rhs, tree t_label, tree f_label)
!      Build a `GIMPLE_COND' statement.  `A' `GIMPLE_COND' statement
!      compares `LHS' and `RHS' and if the condition in `PRED_CODE' is
!      true, jump to the label in `t_label', otherwise jump to the label
!      in `f_label'.  `PRED_CODE' are relational operator tree codes like
!      `EQ_EXPR', `LT_EXPR', `LE_EXPR', `NE_EXPR', etc.
  
!  -- GIMPLE function: gcond *gimple_build_cond_from_tree (tree cond,
!           tree t_label, tree f_label)
!      Build a `GIMPLE_COND' statement from the conditional expression
!      tree `COND'.  `T_LABEL' and `F_LABEL' are as in
!      `gimple_build_cond'.
  
   -- GIMPLE function: enum tree_code gimple_cond_code (gimple g)
       Return the code of the predicate computed by conditional statement
!      `G'.
  
!  -- GIMPLE function: void gimple_cond_set_code (gcond *g, enum
!           tree_code code)
!      Set `CODE' to be the predicate code for the conditional statement
!      `G'.
  
   -- GIMPLE function: tree gimple_cond_lhs (gimple g)
!      Return the `LHS' of the predicate computed by conditional statement
!      `G'.
  
   -- GIMPLE function: void gimple_cond_set_lhs (gcond *g, tree lhs)
!      Set `LHS' to be the `LHS' operand of the predicate computed by
!      conditional statement `G'.
  
   -- GIMPLE function: tree gimple_cond_rhs (gimple g)
!      Return the `RHS' operand of the predicate computed by conditional
!      `G'.
  
   -- GIMPLE function: void gimple_cond_set_rhs (gcond *g, tree rhs)
!      Set `RHS' to be the `RHS' operand of the predicate computed by
!      conditional statement `G'.
  
   -- GIMPLE function: tree gimple_cond_true_label (const gcond *g)
!      Return the label used by conditional statement `G' when its
       predicate evaluates to true.
  
   -- GIMPLE function: void gimple_cond_set_true_label (gcond *g, tree
            label)
!      Set `LABEL' to be the label used by conditional statement `G' when
       its predicate evaluates to true.
  
   -- GIMPLE function: void gimple_cond_set_false_label (gcond *g, tree
            label)
!      Set `LABEL' to be the label used by conditional statement `G' when
       its predicate evaluates to false.
  
   -- GIMPLE function: tree gimple_cond_false_label (const gcond *g)
!      Return the label used by conditional statement `G' when its
       predicate evaluates to false.
  
   -- GIMPLE function: void gimple_cond_make_false (gcond *g)
!      Set the conditional `COND_STMT' to be of the form 'if (1 == 0)'.
  
   -- GIMPLE function: void gimple_cond_make_true (gcond *g)
!      Set the conditional `COND_STMT' to be of the form 'if (1 == 1)'.
  
  
! File: gccint.info,  Node: `GIMPLE_DEBUG',  Next: `GIMPLE_EH_FILTER',  Prev: `GIMPLE_COND',  Up: Tuple specific accessors
  
! 11.8.7 `GIMPLE_DEBUG'
  ---------------------
  
   -- GIMPLE function: gdebug *gimple_build_debug_bind (tree var, tree
            value, gimple stmt)
!      Build a `GIMPLE_DEBUG' statement with `GIMPLE_DEBUG_BIND' of
!      `subcode'.  The effect of this statement is to tell debug
       information generation machinery that the value of user variable
!      `var' is given by `value' at that point, and to remain with that
!      value until `var' runs out of scope, a dynamically-subsequent
!      debug bind statement overrides the binding, or conflicting values
!      reach a control flow merge point.  Even if components of the
!      `value' expression change afterwards, the variable is supposed to
!      retain the same value, though not necessarily the same location.
  
!      It is expected that `var' be most often a tree for automatic user
!      variables (`VAR_DECL' or `PARM_DECL') that satisfy the
!      requirements for gimple registers, but it may also be a tree for a
!      scalarized component of a user variable (`ARRAY_REF',
!      `COMPONENT_REF'), or a debug temporary (`DEBUG_EXPR_DECL').
  
!      As for `value', it can be an arbitrary tree expression, but it is
       recommended that it be in a suitable form for a gimple assignment
!      `RHS'.  It is not expected that user variables that could appear
!      as `var' ever appear in `value', because in the latter we'd have
!      their `SSA_NAME's instead, but even if they were not in SSA form,
!      user variables appearing in `value' are to be regarded as part of
!      the executable code space, whereas those in `var' are to be
!      regarded as part of the source code space.  There is no way to
!      refer to the value bound to a user variable within a `value'
!      expression.
  
!      If `value' is `GIMPLE_DEBUG_BIND_NOVALUE', debug information
!      generation machinery is informed that the variable `var' is
       unbound, i.e., that its value is indeterminate, which sometimes
       means it is really unavailable, and other times that the compiler
       could not keep track of it.
  
!      Block and location information for the newly-created stmt are
!      taken from `stmt', if given.
  
   -- GIMPLE function: tree gimple_debug_bind_get_var (gimple stmt)
!      Return the user variable VAR that is bound at `stmt'.
  
   -- GIMPLE function: tree gimple_debug_bind_get_value (gimple stmt)
       Return the value expression that is bound to a user variable at
!      `stmt'.
  
   -- GIMPLE function: tree * gimple_debug_bind_get_value_ptr (gimple
            stmt)
       Return a pointer to the value expression that is bound to a user
!      variable at `stmt'.
  
   -- GIMPLE function: void gimple_debug_bind_set_var (gimple stmt, tree
            var)
!      Modify the user variable bound at `stmt' to VAR.
  
!  -- GIMPLE function: void gimple_debug_bind_set_value (gimple stmt,
!           tree var)
!      Modify the value bound to the user variable bound at `stmt' to
       VALUE.
  
   -- GIMPLE function: void gimple_debug_bind_reset_value (gimple stmt)
!      Modify the value bound to the user variable bound at `stmt' so
!      that the variable becomes unbound.
  
   -- GIMPLE function: bool gimple_debug_bind_has_value_p (gimple stmt)
!      Return `TRUE' if `stmt' binds a user variable to a value, and
!      `FALSE' if it unbinds the variable.
  
  
! File: gccint.info,  Node: `GIMPLE_EH_FILTER',  Next: `GIMPLE_LABEL',  Prev: `GIMPLE_DEBUG',  Up: Tuple specific accessors
  
! 11.8.8 `GIMPLE_EH_FILTER'
  -------------------------
  
   -- GIMPLE function: geh_filter *gimple_build_eh_filter (tree types,
            gimple_seq failure)
!      Build a `GIMPLE_EH_FILTER' statement.  `TYPES' are the filter's
!      types.  `FAILURE' is a sequence with the filter's failure action.
  
   -- GIMPLE function: tree gimple_eh_filter_types (gimple g)
!      Return the types handled by `GIMPLE_EH_FILTER' statement `G'.
  
   -- GIMPLE function: tree * gimple_eh_filter_types_ptr (gimple g)
!      Return a pointer to the types handled by `GIMPLE_EH_FILTER'
!      statement `G'.
  
   -- GIMPLE function: gimple_seq gimple_eh_filter_failure (gimple g)
!      Return the sequence of statement to execute when `GIMPLE_EH_FILTER'
       statement fails.
  
   -- GIMPLE function: void gimple_eh_filter_set_types (geh_filter *g,
            tree types)
!      Set `TYPES' to be the set of types handled by `GIMPLE_EH_FILTER'
!      `G'.
  
   -- GIMPLE function: void gimple_eh_filter_set_failure (geh_filter *g,
            gimple_seq failure)
!      Set `FAILURE' to be the sequence of statements to execute on
!      failure for `GIMPLE_EH_FILTER' `G'.
  
   -- GIMPLE function: tree gimple_eh_must_not_throw_fndecl ( geh_mnt
            *eh_mnt_stmt)
--- 11457,12003 ----
  
  * Menu:
  
! * GIMPLE_ASM::
! * GIMPLE_ASSIGN::
! * GIMPLE_BIND::
! * GIMPLE_CALL::
! * GIMPLE_CATCH::
! * GIMPLE_COND::
! * GIMPLE_DEBUG::
! * GIMPLE_EH_FILTER::
! * GIMPLE_LABEL::
! * GIMPLE_GOTO::
! * GIMPLE_NOP::
! * GIMPLE_OMP_ATOMIC_LOAD::
! * GIMPLE_OMP_ATOMIC_STORE::
! * GIMPLE_OMP_CONTINUE::
! * GIMPLE_OMP_CRITICAL::
! * GIMPLE_OMP_FOR::
! * GIMPLE_OMP_MASTER::
! * GIMPLE_OMP_ORDERED::
! * GIMPLE_OMP_PARALLEL::
! * GIMPLE_OMP_RETURN::
! * GIMPLE_OMP_SECTION::
! * GIMPLE_OMP_SECTIONS::
! * GIMPLE_OMP_SINGLE::
! * GIMPLE_PHI::
! * GIMPLE_RESX::
! * GIMPLE_RETURN::
! * GIMPLE_SWITCH::
! * GIMPLE_TRY::
! * GIMPLE_WITH_CLEANUP_EXPR::
  
  
! File: gccint.info,  Node: GIMPLE_ASM,  Next: GIMPLE_ASSIGN,  Up: Tuple specific accessors
  
! 11.8.1 'GIMPLE_ASM'
  -------------------
  
   -- GIMPLE function: gasm *gimple_build_asm_vec ( const char *string,
!           vec<tree, va_gc> *inputs, vec<tree, va_gc> *outputs, vec<tree,
!           va_gc> *clobbers, vec<tree, va_gc> *labels)
!      Build a 'GIMPLE_ASM' statement.  This statement is used for
!      building in-line assembly constructs.  'STRING' is the assembly
!      code.  'INPUTS', 'OUTPUTS', 'CLOBBERS' and 'LABELS' are the inputs,
!      outputs, clobbered registers and labels.
  
   -- GIMPLE function: unsigned gimple_asm_ninputs (const gasm *g)
!      Return the number of input operands for 'GIMPLE_ASM' 'G'.
  
   -- GIMPLE function: unsigned gimple_asm_noutputs (const gasm *g)
!      Return the number of output operands for 'GIMPLE_ASM' 'G'.
  
   -- GIMPLE function: unsigned gimple_asm_nclobbers (const gasm *g)
!      Return the number of clobber operands for 'GIMPLE_ASM' 'G'.
  
   -- GIMPLE function: tree gimple_asm_input_op (const gasm *g, unsigned
            index)
!      Return input operand 'INDEX' of 'GIMPLE_ASM' 'G'.
  
   -- GIMPLE function: void gimple_asm_set_input_op (gasm *g, unsigned
            index, tree in_op)
!      Set 'IN_OP' to be input operand 'INDEX' in 'GIMPLE_ASM' 'G'.
  
   -- GIMPLE function: tree gimple_asm_output_op (const gasm *g, unsigned
            index)
!      Return output operand 'INDEX' of 'GIMPLE_ASM' 'G'.
  
   -- GIMPLE function: void gimple_asm_set_output_op (gasm *g, unsigned
            index, tree out_op)
!      Set 'OUT_OP' to be output operand 'INDEX' in 'GIMPLE_ASM' 'G'.
  
!  -- GIMPLE function: tree gimple_asm_clobber_op (const gasm *g, unsigned
!           index)
!      Return clobber operand 'INDEX' of 'GIMPLE_ASM' 'G'.
  
   -- GIMPLE function: void gimple_asm_set_clobber_op (gasm *g, unsigned
            index, tree clobber_op)
!      Set 'CLOBBER_OP' to be clobber operand 'INDEX' in 'GIMPLE_ASM' 'G'.
  
   -- GIMPLE function: const char * gimple_asm_string (const gasm *g)
       Return the string representing the assembly instruction in
!      'GIMPLE_ASM' 'G'.
  
   -- GIMPLE function: bool gimple_asm_volatile_p (const gasm *g)
!      Return true if 'G' is an asm statement marked volatile.
  
   -- GIMPLE function: void gimple_asm_set_volatile (gasm *g, bool
            volatile_p)
!      Mark asm statement 'G' as volatile or non-volatile based on
!      'VOLATILE_P'.
  
  
! File: gccint.info,  Node: GIMPLE_ASSIGN,  Next: GIMPLE_BIND,  Prev: GIMPLE_ASM,  Up: Tuple specific accessors
  
! 11.8.2 'GIMPLE_ASSIGN'
  ----------------------
  
   -- GIMPLE function: gassign *gimple_build_assign (tree lhs, tree rhs)
!      Build a 'GIMPLE_ASSIGN' statement.  The left-hand side is an lvalue
!      passed in lhs.  The right-hand side can be either a unary or binary
!      tree expression.  The expression tree rhs will be flattened and its
!      operands assigned to the corresponding operand slots in the new
!      statement.  This function is useful when you already have a tree
!      expression that you want to convert into a tuple.  However, try to
!      avoid building expression trees for the sole purpose of calling
!      this function.  If you already have the operands in separate trees,
!      it is better to use 'gimple_build_assign' with 'enum tree_code'
!      argument and separate arguments for each operand.
  
   -- GIMPLE function: gassign *gimple_build_assign (tree lhs, enum
            tree_code subcode, tree op1, tree op2, tree op3)
!      This function is similar to two operand 'gimple_build_assign', but
!      is used to build a 'GIMPLE_ASSIGN' statement when the operands of
       the right-hand side of the assignment are already split into
       different operands.
  
       The left-hand side is an lvalue passed in lhs.  Subcode is the
!      'tree_code' for the right-hand side of the assignment.  Op1, op2
       and op3 are the operands.
  
   -- GIMPLE function: gassign *gimple_build_assign (tree lhs, enum
            tree_code subcode, tree op1, tree op2)
!      Like the above 5 operand 'gimple_build_assign', but with the last
!      argument 'NULL' - this overload should not be used for
!      'GIMPLE_TERNARY_RHS' assignments.
  
   -- GIMPLE function: gassign *gimple_build_assign (tree lhs, enum
            tree_code subcode, tree op1)
!      Like the above 4 operand 'gimple_build_assign', but with the last
!      argument 'NULL' - this overload should be used only for
!      'GIMPLE_UNARY_RHS' and 'GIMPLE_SINGLE_RHS' assignments.
  
   -- GIMPLE function: gimple gimplify_assign (tree dst, tree src,
            gimple_seq *seq_p)
!      Build a new 'GIMPLE_ASSIGN' tuple and append it to the end of
!      '*SEQ_P'.
  
!  'DST'/'SRC' are the destination and source respectively.  You can pass
! ungimplified trees in 'DST' or 'SRC', in which case they will be
  converted to a gimple operand if necessary.
  
!  This function returns the newly created 'GIMPLE_ASSIGN' tuple.
  
   -- GIMPLE function: enum tree_code gimple_assign_rhs_code (gimple g)
!      Return the code of the expression computed on the 'RHS' of
!      assignment statement 'G'.
  
   -- GIMPLE function: enum gimple_rhs_class gimple_assign_rhs_class
            (gimple g)
!      Return the gimple rhs class of the code for the expression computed
!      on the rhs of assignment statement 'G'.  This will never return
!      'GIMPLE_INVALID_RHS'.
  
   -- GIMPLE function: tree gimple_assign_lhs (gimple g)
!      Return the 'LHS' of assignment statement 'G'.
  
   -- GIMPLE function: tree * gimple_assign_lhs_ptr (gimple g)
!      Return a pointer to the 'LHS' of assignment statement 'G'.
  
   -- GIMPLE function: tree gimple_assign_rhs1 (gimple g)
!      Return the first operand on the 'RHS' of assignment statement 'G'.
  
   -- GIMPLE function: tree * gimple_assign_rhs1_ptr (gimple g)
!      Return the address of the first operand on the 'RHS' of assignment
!      statement 'G'.
  
   -- GIMPLE function: tree gimple_assign_rhs2 (gimple g)
!      Return the second operand on the 'RHS' of assignment statement 'G'.
  
   -- GIMPLE function: tree * gimple_assign_rhs2_ptr (gimple g)
!      Return the address of the second operand on the 'RHS' of assignment
!      statement 'G'.
  
   -- GIMPLE function: tree gimple_assign_rhs3 (gimple g)
!      Return the third operand on the 'RHS' of assignment statement 'G'.
  
   -- GIMPLE function: tree * gimple_assign_rhs3_ptr (gimple g)
!      Return the address of the third operand on the 'RHS' of assignment
!      statement 'G'.
  
   -- GIMPLE function: void gimple_assign_set_lhs (gimple g, tree lhs)
!      Set 'LHS' to be the 'LHS' operand of assignment statement 'G'.
  
   -- GIMPLE function: void gimple_assign_set_rhs1 (gimple g, tree rhs)
!      Set 'RHS' to be the first operand on the 'RHS' of assignment
!      statement 'G'.
  
   -- GIMPLE function: void gimple_assign_set_rhs2 (gimple g, tree rhs)
!      Set 'RHS' to be the second operand on the 'RHS' of assignment
!      statement 'G'.
  
   -- GIMPLE function: void gimple_assign_set_rhs3 (gimple g, tree rhs)
!      Set 'RHS' to be the third operand on the 'RHS' of assignment
!      statement 'G'.
  
   -- GIMPLE function: bool gimple_assign_cast_p (const_gimple s)
!      Return true if 'S' is a type-cast assignment.
  
  
! File: gccint.info,  Node: GIMPLE_BIND,  Next: GIMPLE_CALL,  Prev: GIMPLE_ASSIGN,  Up: Tuple specific accessors
  
! 11.8.3 'GIMPLE_BIND'
  --------------------
  
   -- GIMPLE function: gbind *gimple_build_bind (tree vars, gimple_seq
            body)
!      Build a 'GIMPLE_BIND' statement with a list of variables in 'VARS'
!      and a body of statements in sequence 'BODY'.
  
   -- GIMPLE function: tree gimple_bind_vars (const gbind *g)
!      Return the variables declared in the 'GIMPLE_BIND' statement 'G'.
  
   -- GIMPLE function: void gimple_bind_set_vars (gbind *g, tree vars)
!      Set 'VARS' to be the set of variables declared in the 'GIMPLE_BIND'
!      statement 'G'.
  
   -- GIMPLE function: void gimple_bind_append_vars (gbind *g, tree vars)
!      Append 'VARS' to the set of variables declared in the 'GIMPLE_BIND'
!      statement 'G'.
  
   -- GIMPLE function: gimple_seq gimple_bind_body (gbind *g)
!      Return the GIMPLE sequence contained in the 'GIMPLE_BIND' statement
!      'G'.
  
   -- GIMPLE function: void gimple_bind_set_body (gbind *g, gimple_seq
            seq)
!      Set 'SEQ' to be sequence contained in the 'GIMPLE_BIND' statement
!      'G'.
  
   -- GIMPLE function: void gimple_bind_add_stmt (gbind *gs, gimple stmt)
!      Append a statement to the end of a 'GIMPLE_BIND''s body.
  
   -- GIMPLE function: void gimple_bind_add_seq (gbind *gs, gimple_seq
            seq)
!      Append a sequence of statements to the end of a 'GIMPLE_BIND''s
       body.
  
   -- GIMPLE function: tree gimple_bind_block (const gbind *g)
!      Return the 'TREE_BLOCK' node associated with 'GIMPLE_BIND'
!      statement 'G'.  This is analogous to the 'BIND_EXPR_BLOCK' field in
       trees.
  
   -- GIMPLE function: void gimple_bind_set_block (gbind *g, tree block)
!      Set 'BLOCK' to be the 'TREE_BLOCK' node associated with
!      'GIMPLE_BIND' statement 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_CALL,  Next: GIMPLE_CATCH,  Prev: GIMPLE_BIND,  Up: Tuple specific accessors
  
! 11.8.4 'GIMPLE_CALL'
  --------------------
  
   -- GIMPLE function: gcall *gimple_build_call (tree fn, unsigned nargs,
            ...)
!      Build a 'GIMPLE_CALL' statement to function 'FN'.  The argument
!      'FN' must be either a 'FUNCTION_DECL' or a gimple call address as
!      determined by 'is_gimple_call_addr'.  'NARGS' are the number of
!      arguments.  The rest of the arguments follow the argument 'NARGS',
       and must be trees that are valid as rvalues in gimple (i.e., each
!      operand is validated with 'is_gimple_operand').
  
   -- GIMPLE function: gcall *gimple_build_call_from_tree (tree call_expr)
!      Build a 'GIMPLE_CALL' from a 'CALL_EXPR' node.  The arguments and
       the function are taken from the expression directly.  This routine
!      assumes that 'call_expr' is already in GIMPLE form.  That is, its
       operands are GIMPLE values and the function call needs no further
!      simplification.  All the call flags in 'call_expr' are copied over
!      to the new 'GIMPLE_CALL'.
  
!  -- GIMPLE function: gcall *gimple_build_call_vec (tree fn, 'vec<tree>'
            args)
!      Identical to 'gimple_build_call' but the arguments are stored in a
!      'vec<tree>'.
  
   -- GIMPLE function: tree gimple_call_lhs (gimple g)
!      Return the 'LHS' of call statement 'G'.
  
   -- GIMPLE function: tree * gimple_call_lhs_ptr (gimple g)
!      Return a pointer to the 'LHS' of call statement 'G'.
  
   -- GIMPLE function: void gimple_call_set_lhs (gimple g, tree lhs)
!      Set 'LHS' to be the 'LHS' operand of call statement 'G'.
  
   -- GIMPLE function: tree gimple_call_fn (gimple g)
       Return the tree node representing the function called by call
!      statement 'G'.
  
   -- GIMPLE function: void gimple_call_set_fn (gcall *g, tree fn)
!      Set 'FN' to be the function called by call statement 'G'.  This has
       to be a gimple value specifying the address of the called function.
  
   -- GIMPLE function: tree gimple_call_fndecl (gimple g)
!      If a given 'GIMPLE_CALL''s callee is a 'FUNCTION_DECL', return it.
!      Otherwise return 'NULL'.  This function is analogous to
!      'get_callee_fndecl' in 'GENERIC'.
  
   -- GIMPLE function: tree gimple_call_set_fndecl (gimple g, tree fndecl)
!      Set the called function to 'FNDECL'.
  
   -- GIMPLE function: tree gimple_call_return_type (const gcall *g)
!      Return the type returned by call statement 'G'.
  
   -- GIMPLE function: tree gimple_call_chain (gimple g)
!      Return the static chain for call statement 'G'.
  
   -- GIMPLE function: void gimple_call_set_chain (gcall *g, tree chain)
!      Set 'CHAIN' to be the static chain for call statement 'G'.
  
   -- GIMPLE function: unsigned gimple_call_num_args (gimple g)
!      Return the number of arguments used by call statement 'G'.
  
   -- GIMPLE function: tree gimple_call_arg (gimple g, unsigned index)
!      Return the argument at position 'INDEX' for call statement 'G'.
       The first argument is 0.
  
   -- GIMPLE function: tree * gimple_call_arg_ptr (gimple g, unsigned
            index)
!      Return a pointer to the argument at position 'INDEX' for call
!      statement 'G'.
  
!  -- GIMPLE function: void gimple_call_set_arg (gimple g, unsigned index,
!           tree arg)
!      Set 'ARG' to be the argument at position 'INDEX' for call statement
!      'G'.
  
   -- GIMPLE function: void gimple_call_set_tail (gcall *s)
!      Mark call statement 'S' as being a tail call (i.e., a call just
!      before the exit of a function).  These calls are candidate for tail
       call optimization.
  
   -- GIMPLE function: bool gimple_call_tail_p (gcall *s)
!      Return true if 'GIMPLE_CALL' 'S' is marked as a tail call.
  
   -- GIMPLE function: bool gimple_call_noreturn_p (gimple s)
!      Return true if 'S' is a noreturn call.
  
   -- GIMPLE function: gimple gimple_call_copy_skip_args (gcall *stmt,
            bitmap args_to_skip)
!      Build a 'GIMPLE_CALL' identical to 'STMT' but skipping the
!      arguments in the positions marked by the set 'ARGS_TO_SKIP'.
  
  
! File: gccint.info,  Node: GIMPLE_CATCH,  Next: GIMPLE_COND,  Prev: GIMPLE_CALL,  Up: Tuple specific accessors
  
! 11.8.5 'GIMPLE_CATCH'
  ---------------------
  
   -- GIMPLE function: gcatch *gimple_build_catch (tree types, gimple_seq
            handler)
!      Build a 'GIMPLE_CATCH' statement.  'TYPES' are the tree types this
!      catch handles.  'HANDLER' is a sequence of statements with the code
       for the handler.
  
   -- GIMPLE function: tree gimple_catch_types (const gcatch *g)
!      Return the types handled by 'GIMPLE_CATCH' statement 'G'.
  
   -- GIMPLE function: tree * gimple_catch_types_ptr (gcatch *g)
!      Return a pointer to the types handled by 'GIMPLE_CATCH' statement
!      'G'.
  
   -- GIMPLE function: gimple_seq gimple_catch_handler (gcatch *g)
       Return the GIMPLE sequence representing the body of the handler of
!      'GIMPLE_CATCH' statement 'G'.
  
   -- GIMPLE function: void gimple_catch_set_types (gcatch *g, tree t)
!      Set 'T' to be the set of types handled by 'GIMPLE_CATCH' 'G'.
  
   -- GIMPLE function: void gimple_catch_set_handler (gcatch *g,
            gimple_seq handler)
!      Set 'HANDLER' to be the body of 'GIMPLE_CATCH' 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_COND,  Next: GIMPLE_DEBUG,  Prev: GIMPLE_CATCH,  Up: Tuple specific accessors
  
! 11.8.6 'GIMPLE_COND'
  --------------------
  
   -- GIMPLE function: gcond *gimple_build_cond ( enum tree_code
            pred_code, tree lhs, tree rhs, tree t_label, tree f_label)
!      Build a 'GIMPLE_COND' statement.  'A' 'GIMPLE_COND' statement
!      compares 'LHS' and 'RHS' and if the condition in 'PRED_CODE' is
!      true, jump to the label in 't_label', otherwise jump to the label
!      in 'f_label'.  'PRED_CODE' are relational operator tree codes like
!      'EQ_EXPR', 'LT_EXPR', 'LE_EXPR', 'NE_EXPR', etc.
  
!  -- GIMPLE function: gcond *gimple_build_cond_from_tree (tree cond, tree
!           t_label, tree f_label)
!      Build a 'GIMPLE_COND' statement from the conditional expression
!      tree 'COND'.  'T_LABEL' and 'F_LABEL' are as in
!      'gimple_build_cond'.
  
   -- GIMPLE function: enum tree_code gimple_cond_code (gimple g)
       Return the code of the predicate computed by conditional statement
!      'G'.
  
!  -- GIMPLE function: void gimple_cond_set_code (gcond *g, enum tree_code
!           code)
!      Set 'CODE' to be the predicate code for the conditional statement
!      'G'.
  
   -- GIMPLE function: tree gimple_cond_lhs (gimple g)
!      Return the 'LHS' of the predicate computed by conditional statement
!      'G'.
  
   -- GIMPLE function: void gimple_cond_set_lhs (gcond *g, tree lhs)
!      Set 'LHS' to be the 'LHS' operand of the predicate computed by
!      conditional statement 'G'.
  
   -- GIMPLE function: tree gimple_cond_rhs (gimple g)
!      Return the 'RHS' operand of the predicate computed by conditional
!      'G'.
  
   -- GIMPLE function: void gimple_cond_set_rhs (gcond *g, tree rhs)
!      Set 'RHS' to be the 'RHS' operand of the predicate computed by
!      conditional statement 'G'.
  
   -- GIMPLE function: tree gimple_cond_true_label (const gcond *g)
!      Return the label used by conditional statement 'G' when its
       predicate evaluates to true.
  
   -- GIMPLE function: void gimple_cond_set_true_label (gcond *g, tree
            label)
!      Set 'LABEL' to be the label used by conditional statement 'G' when
       its predicate evaluates to true.
  
   -- GIMPLE function: void gimple_cond_set_false_label (gcond *g, tree
            label)
!      Set 'LABEL' to be the label used by conditional statement 'G' when
       its predicate evaluates to false.
  
   -- GIMPLE function: tree gimple_cond_false_label (const gcond *g)
!      Return the label used by conditional statement 'G' when its
       predicate evaluates to false.
  
   -- GIMPLE function: void gimple_cond_make_false (gcond *g)
!      Set the conditional 'COND_STMT' to be of the form 'if (1 == 0)'.
  
   -- GIMPLE function: void gimple_cond_make_true (gcond *g)
!      Set the conditional 'COND_STMT' to be of the form 'if (1 == 1)'.
  
  
! File: gccint.info,  Node: GIMPLE_DEBUG,  Next: GIMPLE_EH_FILTER,  Prev: GIMPLE_COND,  Up: Tuple specific accessors
  
! 11.8.7 'GIMPLE_DEBUG'
  ---------------------
  
   -- GIMPLE function: gdebug *gimple_build_debug_bind (tree var, tree
            value, gimple stmt)
!      Build a 'GIMPLE_DEBUG' statement with 'GIMPLE_DEBUG_BIND' of
!      'subcode'.  The effect of this statement is to tell debug
       information generation machinery that the value of user variable
!      'var' is given by 'value' at that point, and to remain with that
!      value until 'var' runs out of scope, a dynamically-subsequent debug
!      bind statement overrides the binding, or conflicting values reach a
!      control flow merge point.  Even if components of the 'value'
!      expression change afterwards, the variable is supposed to retain
!      the same value, though not necessarily the same location.
  
!      It is expected that 'var' be most often a tree for automatic user
!      variables ('VAR_DECL' or 'PARM_DECL') that satisfy the requirements
!      for gimple registers, but it may also be a tree for a scalarized
!      component of a user variable ('ARRAY_REF', 'COMPONENT_REF'), or a
!      debug temporary ('DEBUG_EXPR_DECL').
  
!      As for 'value', it can be an arbitrary tree expression, but it is
       recommended that it be in a suitable form for a gimple assignment
!      'RHS'.  It is not expected that user variables that could appear as
!      'var' ever appear in 'value', because in the latter we'd have their
!      'SSA_NAME's instead, but even if they were not in SSA form, user
!      variables appearing in 'value' are to be regarded as part of the
!      executable code space, whereas those in 'var' are to be regarded as
!      part of the source code space.  There is no way to refer to the
!      value bound to a user variable within a 'value' expression.
  
!      If 'value' is 'GIMPLE_DEBUG_BIND_NOVALUE', debug information
!      generation machinery is informed that the variable 'var' is
       unbound, i.e., that its value is indeterminate, which sometimes
       means it is really unavailable, and other times that the compiler
       could not keep track of it.
  
!      Block and location information for the newly-created stmt are taken
!      from 'stmt', if given.
  
   -- GIMPLE function: tree gimple_debug_bind_get_var (gimple stmt)
!      Return the user variable VAR that is bound at 'stmt'.
  
   -- GIMPLE function: tree gimple_debug_bind_get_value (gimple stmt)
       Return the value expression that is bound to a user variable at
!      'stmt'.
  
   -- GIMPLE function: tree * gimple_debug_bind_get_value_ptr (gimple
            stmt)
       Return a pointer to the value expression that is bound to a user
!      variable at 'stmt'.
  
   -- GIMPLE function: void gimple_debug_bind_set_var (gimple stmt, tree
            var)
!      Modify the user variable bound at 'stmt' to VAR.
  
!  -- GIMPLE function: void gimple_debug_bind_set_value (gimple stmt, tree
!           var)
!      Modify the value bound to the user variable bound at 'stmt' to
       VALUE.
  
   -- GIMPLE function: void gimple_debug_bind_reset_value (gimple stmt)
!      Modify the value bound to the user variable bound at 'stmt' so that
!      the variable becomes unbound.
  
   -- GIMPLE function: bool gimple_debug_bind_has_value_p (gimple stmt)
!      Return 'TRUE' if 'stmt' binds a user variable to a value, and
!      'FALSE' if it unbinds the variable.
  
  
! File: gccint.info,  Node: GIMPLE_EH_FILTER,  Next: GIMPLE_LABEL,  Prev: GIMPLE_DEBUG,  Up: Tuple specific accessors
  
! 11.8.8 'GIMPLE_EH_FILTER'
  -------------------------
  
   -- GIMPLE function: geh_filter *gimple_build_eh_filter (tree types,
            gimple_seq failure)
!      Build a 'GIMPLE_EH_FILTER' statement.  'TYPES' are the filter's
!      types.  'FAILURE' is a sequence with the filter's failure action.
  
   -- GIMPLE function: tree gimple_eh_filter_types (gimple g)
!      Return the types handled by 'GIMPLE_EH_FILTER' statement 'G'.
  
   -- GIMPLE function: tree * gimple_eh_filter_types_ptr (gimple g)
!      Return a pointer to the types handled by 'GIMPLE_EH_FILTER'
!      statement 'G'.
  
   -- GIMPLE function: gimple_seq gimple_eh_filter_failure (gimple g)
!      Return the sequence of statement to execute when 'GIMPLE_EH_FILTER'
       statement fails.
  
   -- GIMPLE function: void gimple_eh_filter_set_types (geh_filter *g,
            tree types)
!      Set 'TYPES' to be the set of types handled by 'GIMPLE_EH_FILTER'
!      'G'.
  
   -- GIMPLE function: void gimple_eh_filter_set_failure (geh_filter *g,
            gimple_seq failure)
!      Set 'FAILURE' to be the sequence of statements to execute on
!      failure for 'GIMPLE_EH_FILTER' 'G'.
  
   -- GIMPLE function: tree gimple_eh_must_not_throw_fndecl ( geh_mnt
            *eh_mnt_stmt)
*************** File: gccint.info,  Node: `GIMPLE_EH_FIL
*** 12139,12224 ****
       Set the function decl to be called by GS to DECL.
  
  
! File: gccint.info,  Node: `GIMPLE_LABEL',  Next: `GIMPLE_GOTO',  Prev: `GIMPLE_EH_FILTER',  Up: Tuple specific accessors
  
! 11.8.9 `GIMPLE_LABEL'
  ---------------------
  
   -- GIMPLE function: glabel *gimple_build_label (tree label)
!      Build a `GIMPLE_LABEL' statement with corresponding to the tree
!      label, `LABEL'.
  
   -- GIMPLE function: tree gimple_label_label (const glabel *g)
!      Return the `LABEL_DECL' node used by `GIMPLE_LABEL' statement `G'.
  
   -- GIMPLE function: void gimple_label_set_label (glabel *g, tree label)
!      Set `LABEL' to be the `LABEL_DECL' node used by `GIMPLE_LABEL'
!      statement `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_GOTO',  Next: `GIMPLE_NOP',  Prev: `GIMPLE_LABEL',  Up: Tuple specific accessors
  
! 11.8.10 `GIMPLE_GOTO'
  ---------------------
  
   -- GIMPLE function: ggoto *gimple_build_goto (tree dest)
!      Build a `GIMPLE_GOTO' statement to label `DEST'.
  
   -- GIMPLE function: tree gimple_goto_dest (gimple g)
!      Return the destination of the unconditional jump `G'.
  
   -- GIMPLE function: void gimple_goto_set_dest (ggoto *g, tree dest)
!      Set `DEST' to be the destination of the unconditional jump `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_NOP',  Next: `GIMPLE_OMP_ATOMIC_LOAD',  Prev: `GIMPLE_GOTO',  Up: Tuple specific accessors
  
! 11.8.11 `GIMPLE_NOP'
  --------------------
  
   -- GIMPLE function: gimple gimple_build_nop (void)
!      Build a `GIMPLE_NOP' statement.
  
   -- GIMPLE function: bool gimple_nop_p (gimple g)
!      Returns `TRUE' if statement `G' is a `GIMPLE_NOP'.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_ATOMIC_LOAD',  Next: `GIMPLE_OMP_ATOMIC_STORE',  Prev: `GIMPLE_NOP',  Up: Tuple specific accessors
  
! 11.8.12 `GIMPLE_OMP_ATOMIC_LOAD'
  --------------------------------
  
   -- GIMPLE function: gomp_atomic_load *gimple_build_omp_atomic_load (
            tree lhs, tree rhs)
!      Build a `GIMPLE_OMP_ATOMIC_LOAD' statement.  `LHS' is the left-hand
!      side of the assignment.  `RHS' is the right-hand side of the
       assignment.
  
   -- GIMPLE function: void gimple_omp_atomic_load_set_lhs (
            gomp_atomic_load *g, tree lhs)
!      Set the `LHS' of an atomic load.
  
   -- GIMPLE function: tree gimple_omp_atomic_load_lhs ( const
            gomp_atomic_load *g)
!      Get the `LHS' of an atomic load.
  
   -- GIMPLE function: void gimple_omp_atomic_load_set_rhs (
            gomp_atomic_load *g, tree rhs)
!      Set the `RHS' of an atomic set.
  
   -- GIMPLE function: tree gimple_omp_atomic_load_rhs ( const
            gomp_atomic_load *g)
!      Get the `RHS' of an atomic set.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_ATOMIC_STORE',  Next: `GIMPLE_OMP_CONTINUE',  Prev: `GIMPLE_OMP_ATOMIC_LOAD',  Up: Tuple specific accessors
  
! 11.8.13 `GIMPLE_OMP_ATOMIC_STORE'
  ---------------------------------
  
   -- GIMPLE function: gomp_atomic_store *gimple_build_omp_atomic_store (
            tree val)
!      Build a `GIMPLE_OMP_ATOMIC_STORE' statement. `VAL' is the value to
       be stored.
  
   -- GIMPLE function: void gimple_omp_atomic_store_set_val (
--- 12008,12093 ----
       Set the function decl to be called by GS to DECL.
  
  
! File: gccint.info,  Node: GIMPLE_LABEL,  Next: GIMPLE_GOTO,  Prev: GIMPLE_EH_FILTER,  Up: Tuple specific accessors
  
! 11.8.9 'GIMPLE_LABEL'
  ---------------------
  
   -- GIMPLE function: glabel *gimple_build_label (tree label)
!      Build a 'GIMPLE_LABEL' statement with corresponding to the tree
!      label, 'LABEL'.
  
   -- GIMPLE function: tree gimple_label_label (const glabel *g)
!      Return the 'LABEL_DECL' node used by 'GIMPLE_LABEL' statement 'G'.
  
   -- GIMPLE function: void gimple_label_set_label (glabel *g, tree label)
!      Set 'LABEL' to be the 'LABEL_DECL' node used by 'GIMPLE_LABEL'
!      statement 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_GOTO,  Next: GIMPLE_NOP,  Prev: GIMPLE_LABEL,  Up: Tuple specific accessors
  
! 11.8.10 'GIMPLE_GOTO'
  ---------------------
  
   -- GIMPLE function: ggoto *gimple_build_goto (tree dest)
!      Build a 'GIMPLE_GOTO' statement to label 'DEST'.
  
   -- GIMPLE function: tree gimple_goto_dest (gimple g)
!      Return the destination of the unconditional jump 'G'.
  
   -- GIMPLE function: void gimple_goto_set_dest (ggoto *g, tree dest)
!      Set 'DEST' to be the destination of the unconditional jump 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_NOP,  Next: GIMPLE_OMP_ATOMIC_LOAD,  Prev: GIMPLE_GOTO,  Up: Tuple specific accessors
  
! 11.8.11 'GIMPLE_NOP'
  --------------------
  
   -- GIMPLE function: gimple gimple_build_nop (void)
!      Build a 'GIMPLE_NOP' statement.
  
   -- GIMPLE function: bool gimple_nop_p (gimple g)
!      Returns 'TRUE' if statement 'G' is a 'GIMPLE_NOP'.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_ATOMIC_LOAD,  Next: GIMPLE_OMP_ATOMIC_STORE,  Prev: GIMPLE_NOP,  Up: Tuple specific accessors
  
! 11.8.12 'GIMPLE_OMP_ATOMIC_LOAD'
  --------------------------------
  
   -- GIMPLE function: gomp_atomic_load *gimple_build_omp_atomic_load (
            tree lhs, tree rhs)
!      Build a 'GIMPLE_OMP_ATOMIC_LOAD' statement.  'LHS' is the left-hand
!      side of the assignment.  'RHS' is the right-hand side of the
       assignment.
  
   -- GIMPLE function: void gimple_omp_atomic_load_set_lhs (
            gomp_atomic_load *g, tree lhs)
!      Set the 'LHS' of an atomic load.
  
   -- GIMPLE function: tree gimple_omp_atomic_load_lhs ( const
            gomp_atomic_load *g)
!      Get the 'LHS' of an atomic load.
  
   -- GIMPLE function: void gimple_omp_atomic_load_set_rhs (
            gomp_atomic_load *g, tree rhs)
!      Set the 'RHS' of an atomic set.
  
   -- GIMPLE function: tree gimple_omp_atomic_load_rhs ( const
            gomp_atomic_load *g)
!      Get the 'RHS' of an atomic set.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_ATOMIC_STORE,  Next: GIMPLE_OMP_CONTINUE,  Prev: GIMPLE_OMP_ATOMIC_LOAD,  Up: Tuple specific accessors
  
! 11.8.13 'GIMPLE_OMP_ATOMIC_STORE'
  ---------------------------------
  
   -- GIMPLE function: gomp_atomic_store *gimple_build_omp_atomic_store (
            tree val)
!      Build a 'GIMPLE_OMP_ATOMIC_STORE' statement.  'VAL' is the value to
       be stored.
  
   -- GIMPLE function: void gimple_omp_atomic_store_set_val (
*************** File: gccint.info,  Node: `GIMPLE_OMP_AT
*** 12230,12250 ****
       Return the value being stored in an atomic store.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_CONTINUE',  Next: `GIMPLE_OMP_CRITICAL',  Prev: `GIMPLE_OMP_ATOMIC_STORE',  Up: Tuple specific accessors
  
! 11.8.14 `GIMPLE_OMP_CONTINUE'
  -----------------------------
  
   -- GIMPLE function: gomp_continue *gimple_build_omp_continue ( tree
            control_def, tree control_use)
!      Build a `GIMPLE_OMP_CONTINUE' statement.  `CONTROL_DEF' is the
!      definition of the control variable.  `CONTROL_USE' is the use of
       the control variable.
  
   -- GIMPLE function: tree gimple_omp_continue_control_def ( const
            gomp_continue *s)
       Return the definition of the control variable on a
!      `GIMPLE_OMP_CONTINUE' in `S'.
  
   -- GIMPLE function: tree gimple_omp_continue_control_def_ptr (
            gomp_continue *s)
--- 12099,12119 ----
       Return the value being stored in an atomic store.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_CONTINUE,  Next: GIMPLE_OMP_CRITICAL,  Prev: GIMPLE_OMP_ATOMIC_STORE,  Up: Tuple specific accessors
  
! 11.8.14 'GIMPLE_OMP_CONTINUE'
  -----------------------------
  
   -- GIMPLE function: gomp_continue *gimple_build_omp_continue ( tree
            control_def, tree control_use)
!      Build a 'GIMPLE_OMP_CONTINUE' statement.  'CONTROL_DEF' is the
!      definition of the control variable.  'CONTROL_USE' is the use of
       the control variable.
  
   -- GIMPLE function: tree gimple_omp_continue_control_def ( const
            gomp_continue *s)
       Return the definition of the control variable on a
!      'GIMPLE_OMP_CONTINUE' in 'S'.
  
   -- GIMPLE function: tree gimple_omp_continue_control_def_ptr (
            gomp_continue *s)
*************** File: gccint.info,  Node: `GIMPLE_OMP_CO
*** 12252,12264 ****
  
   -- GIMPLE function: tree gimple_omp_continue_set_control_def (
            gomp_continue *s)
!      Set the control variable definition for a `GIMPLE_OMP_CONTINUE'
!      statement in `S'.
  
   -- GIMPLE function: tree gimple_omp_continue_control_use ( const
            gomp_continue *s)
!      Return the use of the control variable on a `GIMPLE_OMP_CONTINUE'
!      in `S'.
  
   -- GIMPLE function: tree gimple_omp_continue_control_use_ptr (
            gomp_continue *s)
--- 12121,12133 ----
  
   -- GIMPLE function: tree gimple_omp_continue_set_control_def (
            gomp_continue *s)
!      Set the control variable definition for a 'GIMPLE_OMP_CONTINUE'
!      statement in 'S'.
  
   -- GIMPLE function: tree gimple_omp_continue_control_use ( const
            gomp_continue *s)
!      Return the use of the control variable on a 'GIMPLE_OMP_CONTINUE'
!      in 'S'.
  
   -- GIMPLE function: tree gimple_omp_continue_control_use_ptr (
            gomp_continue *s)
*************** File: gccint.info,  Node: `GIMPLE_OMP_CO
*** 12266,12678 ****
  
   -- GIMPLE function: tree gimple_omp_continue_set_control_use (
            gomp_continue *s)
!      Set the control variable use for a `GIMPLE_OMP_CONTINUE' statement
!      in `S'.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_CRITICAL',  Next: `GIMPLE_OMP_FOR',  Prev: `GIMPLE_OMP_CONTINUE',  Up: Tuple specific accessors
  
! 11.8.15 `GIMPLE_OMP_CRITICAL'
  -----------------------------
  
   -- GIMPLE function: gomp_critical *gimple_build_omp_critical (
            gimple_seq body, tree name)
!      Build a `GIMPLE_OMP_CRITICAL' statement. `BODY' is the sequence of
!      statements for which only one thread can execute.  `NAME' is an
       optional identifier for this critical block.
  
!  -- GIMPLE function: tree gimple_omp_critical_name ( const
!           gomp_critical *g)
!      Return the name associated with `OMP_CRITICAL' statement `G'.
  
!  -- GIMPLE function: tree * gimple_omp_critical_name_ptr (
!           gomp_critical *g)
!      Return a pointer to the name associated with `OMP' critical
!      statement `G'.
  
   -- GIMPLE function: void gimple_omp_critical_set_name ( gomp_critical
            *g, tree name)
!      Set `NAME' to be the name associated with `OMP' critical statement
!      `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_FOR',  Next: `GIMPLE_OMP_MASTER',  Prev: `GIMPLE_OMP_CRITICAL',  Up: Tuple specific accessors
  
! 11.8.16 `GIMPLE_OMP_FOR'
  ------------------------
  
   -- GIMPLE function: gomp_for *gimple_build_omp_for (gimple_seq body,
!           tree clauses, tree index, tree initial, tree final, tree
!           incr, gimple_seq pre_body, enum tree_code omp_for_cond)
!      Build a `GIMPLE_OMP_FOR' statement. `BODY' is sequence of
!      statements inside the for loop.  `CLAUSES', are any of the loop
!      construct's clauses.  `PRE_BODY' is the sequence of statements
!      that are loop invariant.  `INDEX' is the index variable.
!      `INITIAL' is the initial value of `INDEX'.  `FINAL' is final value
!      of `INDEX'.  OMP_FOR_COND is the predicate used to compare `INDEX'
!      and `FINAL'.  `INCR' is the increment expression.
  
   -- GIMPLE function: tree gimple_omp_for_clauses (gimple g)
!      Return the clauses associated with `OMP_FOR' `G'.
  
   -- GIMPLE function: tree * gimple_omp_for_clauses_ptr (gimple g)
!      Return a pointer to the `OMP_FOR' `G'.
  
   -- GIMPLE function: void gimple_omp_for_set_clauses (gimple g, tree
            clauses)
!      Set `CLAUSES' to be the list of clauses associated with `OMP_FOR'
!      `G'.
  
   -- GIMPLE function: tree gimple_omp_for_index (gimple g)
!      Return the index variable for `OMP_FOR' `G'.
  
   -- GIMPLE function: tree * gimple_omp_for_index_ptr (gimple g)
!      Return a pointer to the index variable for `OMP_FOR' `G'.
  
   -- GIMPLE function: void gimple_omp_for_set_index (gimple g, tree
            index)
!      Set `INDEX' to be the index variable for `OMP_FOR' `G'.
  
   -- GIMPLE function: tree gimple_omp_for_initial (gimple g)
!      Return the initial value for `OMP_FOR' `G'.
  
   -- GIMPLE function: tree * gimple_omp_for_initial_ptr (gimple g)
!      Return a pointer to the initial value for `OMP_FOR' `G'.
  
   -- GIMPLE function: void gimple_omp_for_set_initial (gimple g, tree
            initial)
!      Set `INITIAL' to be the initial value for `OMP_FOR' `G'.
  
   -- GIMPLE function: tree gimple_omp_for_final (gimple g)
!      Return the final value for `OMP_FOR' `G'.
  
   -- GIMPLE function: tree * gimple_omp_for_final_ptr (gimple g)
!      turn a pointer to the final value for `OMP_FOR' `G'.
  
   -- GIMPLE function: void gimple_omp_for_set_final (gimple g, tree
            final)
!      Set `FINAL' to be the final value for `OMP_FOR' `G'.
  
   -- GIMPLE function: tree gimple_omp_for_incr (gimple g)
!      Return the increment value for `OMP_FOR' `G'.
  
   -- GIMPLE function: tree * gimple_omp_for_incr_ptr (gimple g)
!      Return a pointer to the increment value for `OMP_FOR' `G'.
  
   -- GIMPLE function: void gimple_omp_for_set_incr (gimple g, tree incr)
!      Set `INCR' to be the increment value for `OMP_FOR' `G'.
  
   -- GIMPLE function: gimple_seq gimple_omp_for_pre_body (gimple g)
!      Return the sequence of statements to execute before the `OMP_FOR'
!      statement `G' starts.
  
   -- GIMPLE function: void gimple_omp_for_set_pre_body (gimple g,
            gimple_seq pre_body)
!      Set `PRE_BODY' to be the sequence of statements to execute before
!      the `OMP_FOR' statement `G' starts.
  
   -- GIMPLE function: void gimple_omp_for_set_cond (gimple g, enum
            tree_code cond)
!      Set `COND' to be the condition code for `OMP_FOR' `G'.
  
   -- GIMPLE function: enum tree_code gimple_omp_for_cond (gimple g)
!      Return the condition code associated with `OMP_FOR' `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_MASTER',  Next: `GIMPLE_OMP_ORDERED',  Prev: `GIMPLE_OMP_FOR',  Up: Tuple specific accessors
  
! 11.8.17 `GIMPLE_OMP_MASTER'
  ---------------------------
  
   -- GIMPLE function: gimple gimple_build_omp_master (gimple_seq body)
!      Build a `GIMPLE_OMP_MASTER' statement. `BODY' is the sequence of
       statements to be executed by just the master.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_ORDERED',  Next: `GIMPLE_OMP_PARALLEL',  Prev: `GIMPLE_OMP_MASTER',  Up: Tuple specific accessors
  
! 11.8.18 `GIMPLE_OMP_ORDERED'
  ----------------------------
  
   -- GIMPLE function: gimple gimple_build_omp_ordered (gimple_seq body)
!      Build a `GIMPLE_OMP_ORDERED' statement.
  
!  `BODY' is the sequence of statements inside a loop that will executed
  in sequence.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_PARALLEL',  Next: `GIMPLE_OMP_RETURN',  Prev: `GIMPLE_OMP_ORDERED',  Up: Tuple specific accessors
  
! 11.8.19 `GIMPLE_OMP_PARALLEL'
  -----------------------------
  
!  -- GIMPLE function: gomp_parallel *gimple_build_omp_parallel (
!           gimple_seq body, tree clauses, tree child_fn, tree data_arg)
!      Build a `GIMPLE_OMP_PARALLEL' statement.
  
!  `BODY' is sequence of statements which are executed in parallel.
! `CLAUSES', are the `OMP' parallel construct's clauses.  `CHILD_FN' is
! the function created for the parallel threads to execute.  `DATA_ARG'
  are the shared data argument(s).
  
   -- GIMPLE function: bool gimple_omp_parallel_combined_p (gimple g)
!      Return true if `OMP' parallel statement `G' has the
!      `GF_OMP_PARALLEL_COMBINED' flag set.
  
   -- GIMPLE function: void gimple_omp_parallel_set_combined_p (gimple g)
!      Set the `GF_OMP_PARALLEL_COMBINED' field in `OMP' parallel
!      statement `G'.
  
   -- GIMPLE function: gimple_seq gimple_omp_body (gimple g)
!      Return the body for the `OMP' statement `G'.
  
   -- GIMPLE function: void gimple_omp_set_body (gimple g, gimple_seq
            body)
!      Set `BODY' to be the body for the `OMP' statement `G'.
  
   -- GIMPLE function: tree gimple_omp_parallel_clauses (gimple g)
!      Return the clauses associated with `OMP_PARALLEL' `G'.
  
   -- GIMPLE function: tree * gimple_omp_parallel_clauses_ptr (
            gomp_parallel *g)
!      Return a pointer to the clauses associated with `OMP_PARALLEL' `G'.
  
   -- GIMPLE function: void gimple_omp_parallel_set_clauses (
            gomp_parallel *g, tree clauses)
!      Set `CLAUSES' to be the list of clauses associated with
!      `OMP_PARALLEL' `G'.
  
   -- GIMPLE function: tree gimple_omp_parallel_child_fn ( const
            gomp_parallel *g)
!      Return the child function used to hold the body of `OMP_PARALLEL'
!      `G'.
  
   -- GIMPLE function: tree * gimple_omp_parallel_child_fn_ptr (
            gomp_parallel *g)
       Return a pointer to the child function used to hold the body of
!      `OMP_PARALLEL' `G'.
  
   -- GIMPLE function: void gimple_omp_parallel_set_child_fn (
            gomp_parallel *g, tree child_fn)
!      Set `CHILD_FN' to be the child function for `OMP_PARALLEL' `G'.
  
   -- GIMPLE function: tree gimple_omp_parallel_data_arg ( const
            gomp_parallel *g)
       Return the artificial argument used to send variables and values
!      from the parent to the children threads in `OMP_PARALLEL' `G'.
  
   -- GIMPLE function: tree * gimple_omp_parallel_data_arg_ptr (
            gomp_parallel *g)
!      Return a pointer to the data argument for `OMP_PARALLEL' `G'.
  
   -- GIMPLE function: void gimple_omp_parallel_set_data_arg (
            gomp_parallel *g, tree data_arg)
!      Set `DATA_ARG' to be the data argument for `OMP_PARALLEL' `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_RETURN',  Next: `GIMPLE_OMP_SECTION',  Prev: `GIMPLE_OMP_PARALLEL',  Up: Tuple specific accessors
  
! 11.8.20 `GIMPLE_OMP_RETURN'
  ---------------------------
  
   -- GIMPLE function: gimple gimple_build_omp_return (bool wait_p)
!      Build a `GIMPLE_OMP_RETURN' statement. `WAIT_P' is true if this is
       a non-waiting return.
  
   -- GIMPLE function: void gimple_omp_return_set_nowait (gimple s)
!      Set the nowait flag on `GIMPLE_OMP_RETURN' statement `S'.
  
   -- GIMPLE function: bool gimple_omp_return_nowait_p (gimple g)
!      Return true if `OMP' return statement `G' has the
!      `GF_OMP_RETURN_NOWAIT' flag set.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_SECTION',  Next: `GIMPLE_OMP_SECTIONS',  Prev: `GIMPLE_OMP_RETURN',  Up: Tuple specific accessors
  
! 11.8.21 `GIMPLE_OMP_SECTION'
  ----------------------------
  
   -- GIMPLE function: gimple gimple_build_omp_section (gimple_seq body)
!      Build a `GIMPLE_OMP_SECTION' statement for a sections statement.
  
!  `BODY' is the sequence of statements in the section.
  
   -- GIMPLE function: bool gimple_omp_section_last_p (gimple g)
!      Return true if `OMP' section statement `G' has the
!      `GF_OMP_SECTION_LAST' flag set.
  
   -- GIMPLE function: void gimple_omp_section_set_last (gimple g)
!      Set the `GF_OMP_SECTION_LAST' flag on `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_SECTIONS',  Next: `GIMPLE_OMP_SINGLE',  Prev: `GIMPLE_OMP_SECTION',  Up: Tuple specific accessors
  
! 11.8.22 `GIMPLE_OMP_SECTIONS'
  -----------------------------
  
   -- GIMPLE function: gomp_sections *gimple_build_omp_sections (
            gimple_seq body, tree clauses)
!      Build a `GIMPLE_OMP_SECTIONS' statement. `BODY' is a sequence of
!      section statements.  `CLAUSES' are any of the `OMP' sections
!      construct's clauses: private, firstprivate, lastprivate,
!      reduction, and nowait.
  
   -- GIMPLE function: gimple gimple_build_omp_sections_switch (void)
!      Build a `GIMPLE_OMP_SECTIONS_SWITCH' statement.
  
   -- GIMPLE function: tree gimple_omp_sections_control (gimple g)
       Return the control variable associated with the
!      `GIMPLE_OMP_SECTIONS' in `G'.
  
   -- GIMPLE function: tree * gimple_omp_sections_control_ptr (gimple g)
       Return a pointer to the clauses associated with the
!      `GIMPLE_OMP_SECTIONS' in `G'.
  
   -- GIMPLE function: void gimple_omp_sections_set_control (gimple g,
            tree control)
!      Set `CONTROL' to be the set of clauses associated with the
!      `GIMPLE_OMP_SECTIONS' in `G'.
  
   -- GIMPLE function: tree gimple_omp_sections_clauses (gimple g)
!      Return the clauses associated with `OMP_SECTIONS' `G'.
  
   -- GIMPLE function: tree * gimple_omp_sections_clauses_ptr (gimple g)
!      Return a pointer to the clauses associated with `OMP_SECTIONS' `G'.
  
   -- GIMPLE function: void gimple_omp_sections_set_clauses (gimple g,
            tree clauses)
!      Set `CLAUSES' to be the set of clauses associated with
!      `OMP_SECTIONS' `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_OMP_SINGLE',  Next: `GIMPLE_PHI',  Prev: `GIMPLE_OMP_SECTIONS',  Up: Tuple specific accessors
  
! 11.8.23 `GIMPLE_OMP_SINGLE'
  ---------------------------
  
   -- GIMPLE function: gomp_single *gimple_build_omp_single ( gimple_seq
            body, tree clauses)
!      Build a `GIMPLE_OMP_SINGLE' statement. `BODY' is the sequence of
!      statements that will be executed once.  `CLAUSES' are any of the
!      `OMP' single construct's clauses: private, firstprivate,
       copyprivate, nowait.
  
   -- GIMPLE function: tree gimple_omp_single_clauses (gimple g)
!      Return the clauses associated with `OMP_SINGLE' `G'.
  
   -- GIMPLE function: tree * gimple_omp_single_clauses_ptr (gimple g)
!      Return a pointer to the clauses associated with `OMP_SINGLE' `G'.
  
   -- GIMPLE function: void gimple_omp_single_set_clauses ( gomp_single
            *g, tree clauses)
!      Set `CLAUSES' to be the clauses associated with `OMP_SINGLE' `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_PHI',  Next: `GIMPLE_RESX',  Prev: `GIMPLE_OMP_SINGLE',  Up: Tuple specific accessors
  
! 11.8.24 `GIMPLE_PHI'
  --------------------
  
   -- GIMPLE function: unsigned gimple_phi_capacity (gimple g)
!      Return the maximum number of arguments supported by `GIMPLE_PHI'
!      `G'.
  
   -- GIMPLE function: unsigned gimple_phi_num_args (gimple g)
!      Return the number of arguments in `GIMPLE_PHI' `G'. This must
       always be exactly the number of incoming edges for the basic block
!      holding `G'.
  
   -- GIMPLE function: tree gimple_phi_result (gimple g)
!      Return the `SSA' name created by `GIMPLE_PHI' `G'.
  
   -- GIMPLE function: tree * gimple_phi_result_ptr (gimple g)
!      Return a pointer to the `SSA' name created by `GIMPLE_PHI' `G'.
  
   -- GIMPLE function: void gimple_phi_set_result (gphi *g, tree result)
!      Set `RESULT' to be the `SSA' name created by `GIMPLE_PHI' `G'.
  
   -- GIMPLE function: struct phi_arg_d * gimple_phi_arg (gimple g, index)
!      Return the `PHI' argument corresponding to incoming edge `INDEX'
!      for `GIMPLE_PHI' `G'.
  
   -- GIMPLE function: void gimple_phi_set_arg (gphi *g, index, struct
            phi_arg_d * phiarg)
!      Set `PHIARG' to be the argument corresponding to incoming edge
!      `INDEX' for `GIMPLE_PHI' `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_RESX',  Next: `GIMPLE_RETURN',  Prev: `GIMPLE_PHI',  Up: Tuple specific accessors
  
! 11.8.25 `GIMPLE_RESX'
  ---------------------
  
   -- GIMPLE function: gresx *gimple_build_resx (int region)
!      Build a `GIMPLE_RESX' statement which is a statement.  This
       statement is a placeholder for _Unwind_Resume before we know if a
!      function call or a branch is needed.  `REGION' is the exception
       region from which control is flowing.
  
   -- GIMPLE function: int gimple_resx_region (const gresx *g)
!      Return the region number for `GIMPLE_RESX' `G'.
  
   -- GIMPLE function: void gimple_resx_set_region (gresx *g, int region)
!      Set `REGION' to be the region number for `GIMPLE_RESX' `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_RETURN',  Next: `GIMPLE_SWITCH',  Prev: `GIMPLE_RESX',  Up: Tuple specific accessors
  
! 11.8.26 `GIMPLE_RETURN'
  -----------------------
  
   -- GIMPLE function: greturn *gimple_build_return (tree retval)
!      Build a `GIMPLE_RETURN' statement whose return value is retval.
  
   -- GIMPLE function: tree gimple_return_retval (const greturn *g)
!      Return the return value for `GIMPLE_RETURN' `G'.
  
   -- GIMPLE function: void gimple_return_set_retval (greturn *g, tree
            retval)
!      Set `RETVAL' to be the return value for `GIMPLE_RETURN' `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_SWITCH',  Next: `GIMPLE_TRY',  Prev: `GIMPLE_RETURN',  Up: Tuple specific accessors
  
! 11.8.27 `GIMPLE_SWITCH'
  -----------------------
  
   -- GIMPLE function: gswitch *gimple_build_switch (tree index, tree
!           default_label, `vec'<tree> *args)
!      Build a `GIMPLE_SWITCH' statement.  `INDEX' is the index variable
!      to switch on, and `DEFAULT_LABEL' represents the default label.
!      `ARGS' is a vector of `CASE_LABEL_EXPR' trees that contain the
       non-default case labels.  Each label is a tree of code
!      `CASE_LABEL_EXPR'.
  
   -- GIMPLE function: unsigned gimple_switch_num_labels ( const gswitch
            *g)
       Return the number of labels associated with the switch statement
!      `G'.
  
   -- GIMPLE function: void gimple_switch_set_num_labels (gswitch *g,
            unsigned nlabels)
!      Set `NLABELS' to be the number of labels for the switch statement
!      `G'.
  
   -- GIMPLE function: tree gimple_switch_index (const gswitch *g)
!      Return the index variable used by the switch statement `G'.
  
   -- GIMPLE function: void gimple_switch_set_index (gswitch *g, tree
            index)
!      Set `INDEX' to be the index variable for switch statement `G'.
  
   -- GIMPLE function: tree gimple_switch_label (const gswitch *g,
            unsigned index)
!      Return the label numbered `INDEX'. The default label is 0, followed
!      by any labels in a switch statement.
  
   -- GIMPLE function: void gimple_switch_set_label (gswitch *g, unsigned
            index, tree label)
!      Set the label number `INDEX' to `LABEL'. 0 is always the default
       label.
  
   -- GIMPLE function: tree gimple_switch_default_label ( const gswitch
--- 12135,12547 ----
  
   -- GIMPLE function: tree gimple_omp_continue_set_control_use (
            gomp_continue *s)
!      Set the control variable use for a 'GIMPLE_OMP_CONTINUE' statement
!      in 'S'.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_CRITICAL,  Next: GIMPLE_OMP_FOR,  Prev: GIMPLE_OMP_CONTINUE,  Up: Tuple specific accessors
  
! 11.8.15 'GIMPLE_OMP_CRITICAL'
  -----------------------------
  
   -- GIMPLE function: gomp_critical *gimple_build_omp_critical (
            gimple_seq body, tree name)
!      Build a 'GIMPLE_OMP_CRITICAL' statement.  'BODY' is the sequence of
!      statements for which only one thread can execute.  'NAME' is an
       optional identifier for this critical block.
  
!  -- GIMPLE function: tree gimple_omp_critical_name ( const gomp_critical
!           *g)
!      Return the name associated with 'OMP_CRITICAL' statement 'G'.
  
!  -- GIMPLE function: tree * gimple_omp_critical_name_ptr ( gomp_critical
!           *g)
!      Return a pointer to the name associated with 'OMP' critical
!      statement 'G'.
  
   -- GIMPLE function: void gimple_omp_critical_set_name ( gomp_critical
            *g, tree name)
!      Set 'NAME' to be the name associated with 'OMP' critical statement
!      'G'.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_FOR,  Next: GIMPLE_OMP_MASTER,  Prev: GIMPLE_OMP_CRITICAL,  Up: Tuple specific accessors
  
! 11.8.16 'GIMPLE_OMP_FOR'
  ------------------------
  
   -- GIMPLE function: gomp_for *gimple_build_omp_for (gimple_seq body,
!           tree clauses, tree index, tree initial, tree final, tree incr,
!           gimple_seq pre_body, enum tree_code omp_for_cond)
!      Build a 'GIMPLE_OMP_FOR' statement.  'BODY' is sequence of
!      statements inside the for loop.  'CLAUSES', are any of the loop
!      construct's clauses.  'PRE_BODY' is the sequence of statements that
!      are loop invariant.  'INDEX' is the index variable.  'INITIAL' is
!      the initial value of 'INDEX'.  'FINAL' is final value of 'INDEX'.
!      OMP_FOR_COND is the predicate used to compare 'INDEX' and 'FINAL'.
!      'INCR' is the increment expression.
  
   -- GIMPLE function: tree gimple_omp_for_clauses (gimple g)
!      Return the clauses associated with 'OMP_FOR' 'G'.
  
   -- GIMPLE function: tree * gimple_omp_for_clauses_ptr (gimple g)
!      Return a pointer to the 'OMP_FOR' 'G'.
  
   -- GIMPLE function: void gimple_omp_for_set_clauses (gimple g, tree
            clauses)
!      Set 'CLAUSES' to be the list of clauses associated with 'OMP_FOR'
!      'G'.
  
   -- GIMPLE function: tree gimple_omp_for_index (gimple g)
!      Return the index variable for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: tree * gimple_omp_for_index_ptr (gimple g)
!      Return a pointer to the index variable for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: void gimple_omp_for_set_index (gimple g, tree
            index)
!      Set 'INDEX' to be the index variable for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: tree gimple_omp_for_initial (gimple g)
!      Return the initial value for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: tree * gimple_omp_for_initial_ptr (gimple g)
!      Return a pointer to the initial value for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: void gimple_omp_for_set_initial (gimple g, tree
            initial)
!      Set 'INITIAL' to be the initial value for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: tree gimple_omp_for_final (gimple g)
!      Return the final value for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: tree * gimple_omp_for_final_ptr (gimple g)
!      turn a pointer to the final value for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: void gimple_omp_for_set_final (gimple g, tree
            final)
!      Set 'FINAL' to be the final value for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: tree gimple_omp_for_incr (gimple g)
!      Return the increment value for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: tree * gimple_omp_for_incr_ptr (gimple g)
!      Return a pointer to the increment value for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: void gimple_omp_for_set_incr (gimple g, tree incr)
!      Set 'INCR' to be the increment value for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: gimple_seq gimple_omp_for_pre_body (gimple g)
!      Return the sequence of statements to execute before the 'OMP_FOR'
!      statement 'G' starts.
  
   -- GIMPLE function: void gimple_omp_for_set_pre_body (gimple g,
            gimple_seq pre_body)
!      Set 'PRE_BODY' to be the sequence of statements to execute before
!      the 'OMP_FOR' statement 'G' starts.
  
   -- GIMPLE function: void gimple_omp_for_set_cond (gimple g, enum
            tree_code cond)
!      Set 'COND' to be the condition code for 'OMP_FOR' 'G'.
  
   -- GIMPLE function: enum tree_code gimple_omp_for_cond (gimple g)
!      Return the condition code associated with 'OMP_FOR' 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_MASTER,  Next: GIMPLE_OMP_ORDERED,  Prev: GIMPLE_OMP_FOR,  Up: Tuple specific accessors
  
! 11.8.17 'GIMPLE_OMP_MASTER'
  ---------------------------
  
   -- GIMPLE function: gimple gimple_build_omp_master (gimple_seq body)
!      Build a 'GIMPLE_OMP_MASTER' statement.  'BODY' is the sequence of
       statements to be executed by just the master.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_ORDERED,  Next: GIMPLE_OMP_PARALLEL,  Prev: GIMPLE_OMP_MASTER,  Up: Tuple specific accessors
  
! 11.8.18 'GIMPLE_OMP_ORDERED'
  ----------------------------
  
   -- GIMPLE function: gimple gimple_build_omp_ordered (gimple_seq body)
!      Build a 'GIMPLE_OMP_ORDERED' statement.
  
!  'BODY' is the sequence of statements inside a loop that will executed
  in sequence.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_PARALLEL,  Next: GIMPLE_OMP_RETURN,  Prev: GIMPLE_OMP_ORDERED,  Up: Tuple specific accessors
  
! 11.8.19 'GIMPLE_OMP_PARALLEL'
  -----------------------------
  
!  -- GIMPLE function: gomp_parallel *gimple_build_omp_parallel
!           (gimple_seq body, tree clauses, tree child_fn, tree data_arg)
!      Build a 'GIMPLE_OMP_PARALLEL' statement.
  
!  'BODY' is sequence of statements which are executed in parallel.
! 'CLAUSES', are the 'OMP' parallel construct's clauses.  'CHILD_FN' is
! the function created for the parallel threads to execute.  'DATA_ARG'
  are the shared data argument(s).
  
   -- GIMPLE function: bool gimple_omp_parallel_combined_p (gimple g)
!      Return true if 'OMP' parallel statement 'G' has the
!      'GF_OMP_PARALLEL_COMBINED' flag set.
  
   -- GIMPLE function: void gimple_omp_parallel_set_combined_p (gimple g)
!      Set the 'GF_OMP_PARALLEL_COMBINED' field in 'OMP' parallel
!      statement 'G'.
  
   -- GIMPLE function: gimple_seq gimple_omp_body (gimple g)
!      Return the body for the 'OMP' statement 'G'.
  
   -- GIMPLE function: void gimple_omp_set_body (gimple g, gimple_seq
            body)
!      Set 'BODY' to be the body for the 'OMP' statement 'G'.
  
   -- GIMPLE function: tree gimple_omp_parallel_clauses (gimple g)
!      Return the clauses associated with 'OMP_PARALLEL' 'G'.
  
   -- GIMPLE function: tree * gimple_omp_parallel_clauses_ptr (
            gomp_parallel *g)
!      Return a pointer to the clauses associated with 'OMP_PARALLEL' 'G'.
  
   -- GIMPLE function: void gimple_omp_parallel_set_clauses (
            gomp_parallel *g, tree clauses)
!      Set 'CLAUSES' to be the list of clauses associated with
!      'OMP_PARALLEL' 'G'.
  
   -- GIMPLE function: tree gimple_omp_parallel_child_fn ( const
            gomp_parallel *g)
!      Return the child function used to hold the body of 'OMP_PARALLEL'
!      'G'.
  
   -- GIMPLE function: tree * gimple_omp_parallel_child_fn_ptr (
            gomp_parallel *g)
       Return a pointer to the child function used to hold the body of
!      'OMP_PARALLEL' 'G'.
  
   -- GIMPLE function: void gimple_omp_parallel_set_child_fn (
            gomp_parallel *g, tree child_fn)
!      Set 'CHILD_FN' to be the child function for 'OMP_PARALLEL' 'G'.
  
   -- GIMPLE function: tree gimple_omp_parallel_data_arg ( const
            gomp_parallel *g)
       Return the artificial argument used to send variables and values
!      from the parent to the children threads in 'OMP_PARALLEL' 'G'.
  
   -- GIMPLE function: tree * gimple_omp_parallel_data_arg_ptr (
            gomp_parallel *g)
!      Return a pointer to the data argument for 'OMP_PARALLEL' 'G'.
  
   -- GIMPLE function: void gimple_omp_parallel_set_data_arg (
            gomp_parallel *g, tree data_arg)
!      Set 'DATA_ARG' to be the data argument for 'OMP_PARALLEL' 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_RETURN,  Next: GIMPLE_OMP_SECTION,  Prev: GIMPLE_OMP_PARALLEL,  Up: Tuple specific accessors
  
! 11.8.20 'GIMPLE_OMP_RETURN'
  ---------------------------
  
   -- GIMPLE function: gimple gimple_build_omp_return (bool wait_p)
!      Build a 'GIMPLE_OMP_RETURN' statement.  'WAIT_P' is true if this is
       a non-waiting return.
  
   -- GIMPLE function: void gimple_omp_return_set_nowait (gimple s)
!      Set the nowait flag on 'GIMPLE_OMP_RETURN' statement 'S'.
  
   -- GIMPLE function: bool gimple_omp_return_nowait_p (gimple g)
!      Return true if 'OMP' return statement 'G' has the
!      'GF_OMP_RETURN_NOWAIT' flag set.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_SECTION,  Next: GIMPLE_OMP_SECTIONS,  Prev: GIMPLE_OMP_RETURN,  Up: Tuple specific accessors
  
! 11.8.21 'GIMPLE_OMP_SECTION'
  ----------------------------
  
   -- GIMPLE function: gimple gimple_build_omp_section (gimple_seq body)
!      Build a 'GIMPLE_OMP_SECTION' statement for a sections statement.
  
!  'BODY' is the sequence of statements in the section.
  
   -- GIMPLE function: bool gimple_omp_section_last_p (gimple g)
!      Return true if 'OMP' section statement 'G' has the
!      'GF_OMP_SECTION_LAST' flag set.
  
   -- GIMPLE function: void gimple_omp_section_set_last (gimple g)
!      Set the 'GF_OMP_SECTION_LAST' flag on 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_SECTIONS,  Next: GIMPLE_OMP_SINGLE,  Prev: GIMPLE_OMP_SECTION,  Up: Tuple specific accessors
  
! 11.8.22 'GIMPLE_OMP_SECTIONS'
  -----------------------------
  
   -- GIMPLE function: gomp_sections *gimple_build_omp_sections (
            gimple_seq body, tree clauses)
!      Build a 'GIMPLE_OMP_SECTIONS' statement.  'BODY' is a sequence of
!      section statements.  'CLAUSES' are any of the 'OMP' sections
!      construct's clauses: private, firstprivate, lastprivate, reduction,
!      and nowait.
  
   -- GIMPLE function: gimple gimple_build_omp_sections_switch (void)
!      Build a 'GIMPLE_OMP_SECTIONS_SWITCH' statement.
  
   -- GIMPLE function: tree gimple_omp_sections_control (gimple g)
       Return the control variable associated with the
!      'GIMPLE_OMP_SECTIONS' in 'G'.
  
   -- GIMPLE function: tree * gimple_omp_sections_control_ptr (gimple g)
       Return a pointer to the clauses associated with the
!      'GIMPLE_OMP_SECTIONS' in 'G'.
  
   -- GIMPLE function: void gimple_omp_sections_set_control (gimple g,
            tree control)
!      Set 'CONTROL' to be the set of clauses associated with the
!      'GIMPLE_OMP_SECTIONS' in 'G'.
  
   -- GIMPLE function: tree gimple_omp_sections_clauses (gimple g)
!      Return the clauses associated with 'OMP_SECTIONS' 'G'.
  
   -- GIMPLE function: tree * gimple_omp_sections_clauses_ptr (gimple g)
!      Return a pointer to the clauses associated with 'OMP_SECTIONS' 'G'.
  
   -- GIMPLE function: void gimple_omp_sections_set_clauses (gimple g,
            tree clauses)
!      Set 'CLAUSES' to be the set of clauses associated with
!      'OMP_SECTIONS' 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_OMP_SINGLE,  Next: GIMPLE_PHI,  Prev: GIMPLE_OMP_SECTIONS,  Up: Tuple specific accessors
  
! 11.8.23 'GIMPLE_OMP_SINGLE'
  ---------------------------
  
   -- GIMPLE function: gomp_single *gimple_build_omp_single ( gimple_seq
            body, tree clauses)
!      Build a 'GIMPLE_OMP_SINGLE' statement.  'BODY' is the sequence of
!      statements that will be executed once.  'CLAUSES' are any of the
!      'OMP' single construct's clauses: private, firstprivate,
       copyprivate, nowait.
  
   -- GIMPLE function: tree gimple_omp_single_clauses (gimple g)
!      Return the clauses associated with 'OMP_SINGLE' 'G'.
  
   -- GIMPLE function: tree * gimple_omp_single_clauses_ptr (gimple g)
!      Return a pointer to the clauses associated with 'OMP_SINGLE' 'G'.
  
   -- GIMPLE function: void gimple_omp_single_set_clauses ( gomp_single
            *g, tree clauses)
!      Set 'CLAUSES' to be the clauses associated with 'OMP_SINGLE' 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_PHI,  Next: GIMPLE_RESX,  Prev: GIMPLE_OMP_SINGLE,  Up: Tuple specific accessors
  
! 11.8.24 'GIMPLE_PHI'
  --------------------
  
   -- GIMPLE function: unsigned gimple_phi_capacity (gimple g)
!      Return the maximum number of arguments supported by 'GIMPLE_PHI'
!      'G'.
  
   -- GIMPLE function: unsigned gimple_phi_num_args (gimple g)
!      Return the number of arguments in 'GIMPLE_PHI' 'G'.  This must
       always be exactly the number of incoming edges for the basic block
!      holding 'G'.
  
   -- GIMPLE function: tree gimple_phi_result (gimple g)
!      Return the 'SSA' name created by 'GIMPLE_PHI' 'G'.
  
   -- GIMPLE function: tree * gimple_phi_result_ptr (gimple g)
!      Return a pointer to the 'SSA' name created by 'GIMPLE_PHI' 'G'.
  
   -- GIMPLE function: void gimple_phi_set_result (gphi *g, tree result)
!      Set 'RESULT' to be the 'SSA' name created by 'GIMPLE_PHI' 'G'.
  
   -- GIMPLE function: struct phi_arg_d * gimple_phi_arg (gimple g, index)
!      Return the 'PHI' argument corresponding to incoming edge 'INDEX'
!      for 'GIMPLE_PHI' 'G'.
  
   -- GIMPLE function: void gimple_phi_set_arg (gphi *g, index, struct
            phi_arg_d * phiarg)
!      Set 'PHIARG' to be the argument corresponding to incoming edge
!      'INDEX' for 'GIMPLE_PHI' 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_RESX,  Next: GIMPLE_RETURN,  Prev: GIMPLE_PHI,  Up: Tuple specific accessors
  
! 11.8.25 'GIMPLE_RESX'
  ---------------------
  
   -- GIMPLE function: gresx *gimple_build_resx (int region)
!      Build a 'GIMPLE_RESX' statement which is a statement.  This
       statement is a placeholder for _Unwind_Resume before we know if a
!      function call or a branch is needed.  'REGION' is the exception
       region from which control is flowing.
  
   -- GIMPLE function: int gimple_resx_region (const gresx *g)
!      Return the region number for 'GIMPLE_RESX' 'G'.
  
   -- GIMPLE function: void gimple_resx_set_region (gresx *g, int region)
!      Set 'REGION' to be the region number for 'GIMPLE_RESX' 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_RETURN,  Next: GIMPLE_SWITCH,  Prev: GIMPLE_RESX,  Up: Tuple specific accessors
  
! 11.8.26 'GIMPLE_RETURN'
  -----------------------
  
   -- GIMPLE function: greturn *gimple_build_return (tree retval)
!      Build a 'GIMPLE_RETURN' statement whose return value is retval.
  
   -- GIMPLE function: tree gimple_return_retval (const greturn *g)
!      Return the return value for 'GIMPLE_RETURN' 'G'.
  
   -- GIMPLE function: void gimple_return_set_retval (greturn *g, tree
            retval)
!      Set 'RETVAL' to be the return value for 'GIMPLE_RETURN' 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_SWITCH,  Next: GIMPLE_TRY,  Prev: GIMPLE_RETURN,  Up: Tuple specific accessors
  
! 11.8.27 'GIMPLE_SWITCH'
  -----------------------
  
   -- GIMPLE function: gswitch *gimple_build_switch (tree index, tree
!           default_label, 'vec'<tree> *args)
!      Build a 'GIMPLE_SWITCH' statement.  'INDEX' is the index variable
!      to switch on, and 'DEFAULT_LABEL' represents the default label.
!      'ARGS' is a vector of 'CASE_LABEL_EXPR' trees that contain the
       non-default case labels.  Each label is a tree of code
!      'CASE_LABEL_EXPR'.
  
   -- GIMPLE function: unsigned gimple_switch_num_labels ( const gswitch
            *g)
       Return the number of labels associated with the switch statement
!      'G'.
  
   -- GIMPLE function: void gimple_switch_set_num_labels (gswitch *g,
            unsigned nlabels)
!      Set 'NLABELS' to be the number of labels for the switch statement
!      'G'.
  
   -- GIMPLE function: tree gimple_switch_index (const gswitch *g)
!      Return the index variable used by the switch statement 'G'.
  
   -- GIMPLE function: void gimple_switch_set_index (gswitch *g, tree
            index)
!      Set 'INDEX' to be the index variable for switch statement 'G'.
  
   -- GIMPLE function: tree gimple_switch_label (const gswitch *g,
            unsigned index)
!      Return the label numbered 'INDEX'.  The default label is 0,
!      followed by any labels in a switch statement.
  
   -- GIMPLE function: void gimple_switch_set_label (gswitch *g, unsigned
            index, tree label)
!      Set the label number 'INDEX' to 'LABEL'.  0 is always the default
       label.
  
   -- GIMPLE function: tree gimple_switch_default_label ( const gswitch
*************** File: gccint.info,  Node: `GIMPLE_SWITCH
*** 12684,12754 ****
       Set the default label for a switch statement.
  
  
! File: gccint.info,  Node: `GIMPLE_TRY',  Next: `GIMPLE_WITH_CLEANUP_EXPR',  Prev: `GIMPLE_SWITCH',  Up: Tuple specific accessors
  
! 11.8.28 `GIMPLE_TRY'
  --------------------
  
!  -- GIMPLE function: gtry *gimple_build_try (gimple_seq eval,
!           gimple_seq cleanup, unsigned int kind)
!      Build a `GIMPLE_TRY' statement.  `EVAL' is a sequence with the
!      expression to evaluate.  `CLEANUP' is a sequence of statements to
!      run at clean-up time.  `KIND' is the enumeration value
!      `GIMPLE_TRY_CATCH' if this statement denotes a try/catch construct
!      or `GIMPLE_TRY_FINALLY' if this statement denotes a try/finally
       construct.
  
   -- GIMPLE function: enum gimple_try_flags gimple_try_kind (gimple g)
!      Return the kind of try block represented by `GIMPLE_TRY' `G'. This
!      is either `GIMPLE_TRY_CATCH' or `GIMPLE_TRY_FINALLY'.
  
   -- GIMPLE function: bool gimple_try_catch_is_cleanup (gimple g)
!      Return the `GIMPLE_TRY_CATCH_IS_CLEANUP' flag.
  
   -- GIMPLE function: gimple_seq gimple_try_eval (gimple g)
!      Return the sequence of statements used as the body for `GIMPLE_TRY'
!      `G'.
  
   -- GIMPLE function: gimple_seq gimple_try_cleanup (gimple g)
       Return the sequence of statements used as the cleanup body for
!      `GIMPLE_TRY' `G'.
  
   -- GIMPLE function: void gimple_try_set_catch_is_cleanup (gimple g,
            bool catch_is_cleanup)
!      Set the `GIMPLE_TRY_CATCH_IS_CLEANUP' flag.
  
   -- GIMPLE function: void gimple_try_set_eval (gtry *g, gimple_seq eval)
!      Set `EVAL' to be the sequence of statements to use as the body for
!      `GIMPLE_TRY' `G'.
  
   -- GIMPLE function: void gimple_try_set_cleanup (gtry *g, gimple_seq
            cleanup)
!      Set `CLEANUP' to be the sequence of statements to use as the
!      cleanup body for `GIMPLE_TRY' `G'.
  
  
! File: gccint.info,  Node: `GIMPLE_WITH_CLEANUP_EXPR',  Prev: `GIMPLE_TRY',  Up: Tuple specific accessors
  
! 11.8.29 `GIMPLE_WITH_CLEANUP_EXPR'
  ----------------------------------
  
   -- GIMPLE function: gimple gimple_build_wce (gimple_seq cleanup)
!      Build a `GIMPLE_WITH_CLEANUP_EXPR' statement.  `CLEANUP' is the
       clean-up expression.
  
   -- GIMPLE function: gimple_seq gimple_wce_cleanup (gimple g)
!      Return the cleanup sequence for cleanup statement `G'.
  
   -- GIMPLE function: void gimple_wce_set_cleanup (gimple g, gimple_seq
            cleanup)
!      Set `CLEANUP' to be the cleanup sequence for `G'.
  
   -- GIMPLE function: bool gimple_wce_cleanup_eh_only (gimple g)
!      Return the `CLEANUP_EH_ONLY' flag for a `WCE' tuple.
  
!  -- GIMPLE function: void gimple_wce_set_cleanup_eh_only (gimple g,
!           bool eh_only_p)
!      Set the `CLEANUP_EH_ONLY' flag for a `WCE' tuple.
  
  
  File: gccint.info,  Node: GIMPLE sequences,  Next: Sequence iterators,  Prev: Tuple specific accessors,  Up: GIMPLE
--- 12553,12623 ----
       Set the default label for a switch statement.
  
  
! File: gccint.info,  Node: GIMPLE_TRY,  Next: GIMPLE_WITH_CLEANUP_EXPR,  Prev: GIMPLE_SWITCH,  Up: Tuple specific accessors
  
! 11.8.28 'GIMPLE_TRY'
  --------------------
  
!  -- GIMPLE function: gtry *gimple_build_try (gimple_seq eval, gimple_seq
!           cleanup, unsigned int kind)
!      Build a 'GIMPLE_TRY' statement.  'EVAL' is a sequence with the
!      expression to evaluate.  'CLEANUP' is a sequence of statements to
!      run at clean-up time.  'KIND' is the enumeration value
!      'GIMPLE_TRY_CATCH' if this statement denotes a try/catch construct
!      or 'GIMPLE_TRY_FINALLY' if this statement denotes a try/finally
       construct.
  
   -- GIMPLE function: enum gimple_try_flags gimple_try_kind (gimple g)
!      Return the kind of try block represented by 'GIMPLE_TRY' 'G'.  This
!      is either 'GIMPLE_TRY_CATCH' or 'GIMPLE_TRY_FINALLY'.
  
   -- GIMPLE function: bool gimple_try_catch_is_cleanup (gimple g)
!      Return the 'GIMPLE_TRY_CATCH_IS_CLEANUP' flag.
  
   -- GIMPLE function: gimple_seq gimple_try_eval (gimple g)
!      Return the sequence of statements used as the body for 'GIMPLE_TRY'
!      'G'.
  
   -- GIMPLE function: gimple_seq gimple_try_cleanup (gimple g)
       Return the sequence of statements used as the cleanup body for
!      'GIMPLE_TRY' 'G'.
  
   -- GIMPLE function: void gimple_try_set_catch_is_cleanup (gimple g,
            bool catch_is_cleanup)
!      Set the 'GIMPLE_TRY_CATCH_IS_CLEANUP' flag.
  
   -- GIMPLE function: void gimple_try_set_eval (gtry *g, gimple_seq eval)
!      Set 'EVAL' to be the sequence of statements to use as the body for
!      'GIMPLE_TRY' 'G'.
  
   -- GIMPLE function: void gimple_try_set_cleanup (gtry *g, gimple_seq
            cleanup)
!      Set 'CLEANUP' to be the sequence of statements to use as the
!      cleanup body for 'GIMPLE_TRY' 'G'.
  
  
! File: gccint.info,  Node: GIMPLE_WITH_CLEANUP_EXPR,  Prev: GIMPLE_TRY,  Up: Tuple specific accessors
  
! 11.8.29 'GIMPLE_WITH_CLEANUP_EXPR'
  ----------------------------------
  
   -- GIMPLE function: gimple gimple_build_wce (gimple_seq cleanup)
!      Build a 'GIMPLE_WITH_CLEANUP_EXPR' statement.  'CLEANUP' is the
       clean-up expression.
  
   -- GIMPLE function: gimple_seq gimple_wce_cleanup (gimple g)
!      Return the cleanup sequence for cleanup statement 'G'.
  
   -- GIMPLE function: void gimple_wce_set_cleanup (gimple g, gimple_seq
            cleanup)
!      Set 'CLEANUP' to be the cleanup sequence for 'G'.
  
   -- GIMPLE function: bool gimple_wce_cleanup_eh_only (gimple g)
!      Return the 'CLEANUP_EH_ONLY' flag for a 'WCE' tuple.
  
!  -- GIMPLE function: void gimple_wce_set_cleanup_eh_only (gimple g, bool
!           eh_only_p)
!      Set the 'CLEANUP_EH_ONLY' flag for a 'WCE' tuple.
  
  
  File: gccint.info,  Node: GIMPLE sequences,  Next: Sequence iterators,  Prev: Tuple specific accessors,  Up: GIMPLE
*************** File: gccint.info,  Node: GIMPLE sequenc
*** 12756,12773 ****
  11.9 GIMPLE sequences
  =====================
  
! GIMPLE sequences are the tuple equivalent of `STATEMENT_LIST''s used in
! `GENERIC'.  They are used to chain statements together, and when used
! in conjunction with sequence iterators, provide a framework for
! iterating through statements.
  
!  GIMPLE sequences are of type struct `gimple_sequence', but are more
  commonly passed by reference to functions dealing with sequences.  The
! type for a sequence pointer is `gimple_seq' which is the same as struct
! `gimple_sequence' *.  When declaring a local sequence, you can define a
! local variable of type struct `gimple_sequence'.  When declaring a
  sequence allocated on the garbage collected heap, use the function
! `gimple_seq_alloc' documented below.
  
   There are convenience functions for iterating through sequences in the
  section entitled Sequence Iterators.
--- 12625,12642 ----
  11.9 GIMPLE sequences
  =====================
  
! GIMPLE sequences are the tuple equivalent of 'STATEMENT_LIST''s used in
! 'GENERIC'.  They are used to chain statements together, and when used in
! conjunction with sequence iterators, provide a framework for iterating
! through statements.
  
!  GIMPLE sequences are of type struct 'gimple_sequence', but are more
  commonly passed by reference to functions dealing with sequences.  The
! type for a sequence pointer is 'gimple_seq' which is the same as struct
! 'gimple_sequence' *.  When declaring a local sequence, you can define a
! local variable of type struct 'gimple_sequence'.  When declaring a
  sequence allocated on the garbage collected heap, use the function
! 'gimple_seq_alloc' documented below.
  
   There are convenience functions for iterating through sequences in the
  section entitled Sequence Iterators.
*************** section entitled Sequence Iterators.
*** 12776,12815 ****
  
   -- GIMPLE function: void gimple_seq_add_stmt (gimple_seq *seq, gimple
            g)
!      Link a gimple statement to the end of the sequence *`SEQ' if `G' is
!      not `NULL'.  If *`SEQ' is `NULL', allocate a sequence before
       linking.
  
   -- GIMPLE function: void gimple_seq_add_seq (gimple_seq *dest,
            gimple_seq src)
!      Append sequence `SRC' to the end of sequence *`DEST' if `SRC' is
!      not `NULL'.  If *`DEST' is `NULL', allocate a new sequence before
       appending.
  
   -- GIMPLE function: gimple_seq gimple_seq_deep_copy (gimple_seq src)
!      Perform a deep copy of sequence `SRC' and return the result.
  
   -- GIMPLE function: gimple_seq gimple_seq_reverse (gimple_seq seq)
!      Reverse the order of the statements in the sequence `SEQ'.  Return
!      `SEQ'.
  
   -- GIMPLE function: gimple gimple_seq_first (gimple_seq s)
!      Return the first statement in sequence `S'.
  
   -- GIMPLE function: gimple gimple_seq_last (gimple_seq s)
!      Return the last statement in sequence `S'.
  
   -- GIMPLE function: void gimple_seq_set_last (gimple_seq s, gimple
            last)
!      Set the last statement in sequence `S' to the statement in `LAST'.
  
   -- GIMPLE function: void gimple_seq_set_first (gimple_seq s, gimple
            first)
!      Set the first statement in sequence `S' to the statement in
!      `FIRST'.
  
   -- GIMPLE function: void gimple_seq_init (gimple_seq s)
!      Initialize sequence `S' to an empty sequence.
  
   -- GIMPLE function: gimple_seq gimple_seq_alloc (void)
       Allocate a new sequence in the garbage collected store and return
--- 12645,12684 ----
  
   -- GIMPLE function: void gimple_seq_add_stmt (gimple_seq *seq, gimple
            g)
!      Link a gimple statement to the end of the sequence *'SEQ' if 'G' is
!      not 'NULL'.  If *'SEQ' is 'NULL', allocate a sequence before
       linking.
  
   -- GIMPLE function: void gimple_seq_add_seq (gimple_seq *dest,
            gimple_seq src)
!      Append sequence 'SRC' to the end of sequence *'DEST' if 'SRC' is
!      not 'NULL'.  If *'DEST' is 'NULL', allocate a new sequence before
       appending.
  
   -- GIMPLE function: gimple_seq gimple_seq_deep_copy (gimple_seq src)
!      Perform a deep copy of sequence 'SRC' and return the result.
  
   -- GIMPLE function: gimple_seq gimple_seq_reverse (gimple_seq seq)
!      Reverse the order of the statements in the sequence 'SEQ'.  Return
!      'SEQ'.
  
   -- GIMPLE function: gimple gimple_seq_first (gimple_seq s)
!      Return the first statement in sequence 'S'.
  
   -- GIMPLE function: gimple gimple_seq_last (gimple_seq s)
!      Return the last statement in sequence 'S'.
  
   -- GIMPLE function: void gimple_seq_set_last (gimple_seq s, gimple
            last)
!      Set the last statement in sequence 'S' to the statement in 'LAST'.
  
   -- GIMPLE function: void gimple_seq_set_first (gimple_seq s, gimple
            first)
!      Set the first statement in sequence 'S' to the statement in
!      'FIRST'.
  
   -- GIMPLE function: void gimple_seq_init (gimple_seq s)
!      Initialize sequence 'S' to an empty sequence.
  
   -- GIMPLE function: gimple_seq gimple_seq_alloc (void)
       Allocate a new sequence in the garbage collected store and return
*************** section entitled Sequence Iterators.
*** 12817,12835 ****
  
   -- GIMPLE function: void gimple_seq_copy (gimple_seq dest, gimple_seq
            src)
!      Copy the sequence `SRC' into the sequence `DEST'.
  
   -- GIMPLE function: bool gimple_seq_empty_p (gimple_seq s)
!      Return true if the sequence `S' is empty.
  
   -- GIMPLE function: gimple_seq bb_seq (basic_block bb)
!      Returns the sequence of statements in `BB'.
  
   -- GIMPLE function: void set_bb_seq (basic_block bb, gimple_seq seq)
!      Sets the sequence of statements in `BB' to `SEQ'.
  
   -- GIMPLE function: bool gimple_seq_singleton_p (gimple_seq seq)
!      Determine whether `SEQ' contains exactly one statement.
  
  
  File: gccint.info,  Node: Sequence iterators,  Next: Adding a new GIMPLE statement code,  Prev: GIMPLE sequences,  Up: GIMPLE
--- 12686,12704 ----
  
   -- GIMPLE function: void gimple_seq_copy (gimple_seq dest, gimple_seq
            src)
!      Copy the sequence 'SRC' into the sequence 'DEST'.
  
   -- GIMPLE function: bool gimple_seq_empty_p (gimple_seq s)
!      Return true if the sequence 'S' is empty.
  
   -- GIMPLE function: gimple_seq bb_seq (basic_block bb)
!      Returns the sequence of statements in 'BB'.
  
   -- GIMPLE function: void set_bb_seq (basic_block bb, gimple_seq seq)
!      Sets the sequence of statements in 'BB' to 'SEQ'.
  
   -- GIMPLE function: bool gimple_seq_singleton_p (gimple_seq seq)
!      Determine whether 'SEQ' contains exactly one statement.
  
  
  File: gccint.info,  Node: Sequence iterators,  Next: Adding a new GIMPLE statement code,  Prev: GIMPLE sequences,  Up: GIMPLE
*************** File: gccint.info,  Node: Sequence itera
*** 12838,12852 ****
  ========================
  
  Sequence iterators are convenience constructs for iterating through
! statements in a sequence.  Given a sequence `SEQ', here is a typical
! use of gimple sequence iterators:
  
       gimple_stmt_iterator gsi;
  
       for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
         {
           gimple g = gsi_stmt (gsi);
!          /* Do something with gimple statement `G'.  */
         }
  
   Backward iterations are possible:
--- 12707,12721 ----
  ========================
  
  Sequence iterators are convenience constructs for iterating through
! statements in a sequence.  Given a sequence 'SEQ', here is a typical use
! of gimple sequence iterators:
  
       gimple_stmt_iterator gsi;
  
       for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
         {
           gimple g = gsi_stmt (gsi);
!          /* Do something with gimple statement G.  */
         }
  
   Backward iterations are possible:
*************** use of gimple sequence iterators:
*** 12854,12900 ****
               for (gsi = gsi_last (seq); !gsi_end_p (gsi); gsi_prev (&gsi))
  
   Forward and backward iterations on basic blocks are possible with
! `gsi_start_bb' and `gsi_last_bb'.
  
   In the documentation below we sometimes refer to enum
! `gsi_iterator_update'.  The valid options for this enumeration are:
  
!    * `GSI_NEW_STMT' Only valid when a single statement is added.  Move
       the iterator to it.
  
!    * `GSI_SAME_STMT' Leave the iterator at the same statement.
  
!    * `GSI_CONTINUE_LINKING' Move iterator to whatever position is
       suitable for linking other statements in the same direction.
  
   Below is a list of the functions used to manipulate and use statement
  iterators.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_start (gimple_seq seq)
!      Return a new iterator pointing to the sequence `SEQ''s first
!      statement.  If `SEQ' is empty, the iterator's basic block is
!      `NULL'.  Use `gsi_start_bb' instead when the iterator needs to
       always have the correct basic block set.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_start_bb (basic_block bb)
       Return a new iterator pointing to the first statement in basic
!      block `BB'.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_last (gimple_seq seq)
       Return a new iterator initially pointing to the last statement of
!      sequence `SEQ'.  If `SEQ' is empty, the iterator's basic block is
!      `NULL'.  Use `gsi_last_bb' instead when the iterator needs to
       always have the correct basic block set.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_last_bb (basic_block bb)
!      Return a new iterator pointing to the last statement in basic
!      block `BB'.
  
   -- GIMPLE function: bool gsi_end_p (gimple_stmt_iterator i)
!      Return `TRUE' if at the end of `I'.
  
   -- GIMPLE function: bool gsi_one_before_end_p (gimple_stmt_iterator i)
!      Return `TRUE' if we're one statement before the end of `I'.
  
   -- GIMPLE function: void gsi_next (gimple_stmt_iterator *i)
       Advance the iterator to the next gimple statement.
--- 12723,12769 ----
               for (gsi = gsi_last (seq); !gsi_end_p (gsi); gsi_prev (&gsi))
  
   Forward and backward iterations on basic blocks are possible with
! 'gsi_start_bb' and 'gsi_last_bb'.
  
   In the documentation below we sometimes refer to enum
! 'gsi_iterator_update'.  The valid options for this enumeration are:
  
!    * 'GSI_NEW_STMT' Only valid when a single statement is added.  Move
       the iterator to it.
  
!    * 'GSI_SAME_STMT' Leave the iterator at the same statement.
  
!    * 'GSI_CONTINUE_LINKING' Move iterator to whatever position is
       suitable for linking other statements in the same direction.
  
   Below is a list of the functions used to manipulate and use statement
  iterators.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_start (gimple_seq seq)
!      Return a new iterator pointing to the sequence 'SEQ''s first
!      statement.  If 'SEQ' is empty, the iterator's basic block is
!      'NULL'.  Use 'gsi_start_bb' instead when the iterator needs to
       always have the correct basic block set.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_start_bb (basic_block bb)
       Return a new iterator pointing to the first statement in basic
!      block 'BB'.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_last (gimple_seq seq)
       Return a new iterator initially pointing to the last statement of
!      sequence 'SEQ'.  If 'SEQ' is empty, the iterator's basic block is
!      'NULL'.  Use 'gsi_last_bb' instead when the iterator needs to
       always have the correct basic block set.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_last_bb (basic_block bb)
!      Return a new iterator pointing to the last statement in basic block
!      'BB'.
  
   -- GIMPLE function: bool gsi_end_p (gimple_stmt_iterator i)
!      Return 'TRUE' if at the end of 'I'.
  
   -- GIMPLE function: bool gsi_one_before_end_p (gimple_stmt_iterator i)
!      Return 'TRUE' if we're one statement before the end of 'I'.
  
   -- GIMPLE function: void gsi_next (gimple_stmt_iterator *i)
       Advance the iterator to the next gimple statement.
*************** iterators.
*** 12908,12914 ****
   -- GIMPLE function: gimple_stmt_iterator gsi_after_labels (basic_block
            bb)
       Return a block statement iterator that points to the first
!      non-label statement in block `BB'.
  
   -- GIMPLE function: gimple * gsi_stmt_ptr (gimple_stmt_iterator *i)
       Return a pointer to the current stmt.
--- 12777,12783 ----
   -- GIMPLE function: gimple_stmt_iterator gsi_after_labels (basic_block
            bb)
       Return a block statement iterator that points to the first
!      non-label statement in block 'BB'.
  
   -- GIMPLE function: gimple * gsi_stmt_ptr (gimple_stmt_iterator *i)
       Return a pointer to the current stmt.
*************** iterators.
*** 12921,13028 ****
  
   -- GIMPLE function: void gsi_remove (gimple_stmt_iterator *i, bool
            remove_eh_info)
!      Remove the current stmt from the sequence.  The iterator is
!      updated to point to the next statement.  When `REMOVE_EH_INFO' is
!      true we remove the statement pointed to by iterator `I' from the
!      `EH' tables.  Otherwise we do not modify the `EH' tables.
!      Generally, `REMOVE_EH_INFO' should be true when the statement is
!      going to be removed from the `IL' and not reinserted elsewhere.
  
   -- GIMPLE function: void gsi_link_seq_before (gimple_stmt_iterator *i,
            gimple_seq seq, enum gsi_iterator_update mode)
!      Links the sequence of statements `SEQ' before the statement pointed
!      by iterator `I'.  `MODE' indicates what to do with the iterator
!      after insertion (see `enum gsi_iterator_update' above).
  
   -- GIMPLE function: void gsi_link_before (gimple_stmt_iterator *i,
            gimple g, enum gsi_iterator_update mode)
!      Links statement `G' before the statement pointed-to by iterator
!      `I'.  Updates iterator `I' according to `MODE'.
  
   -- GIMPLE function: void gsi_link_seq_after (gimple_stmt_iterator *i,
            gimple_seq seq, enum gsi_iterator_update mode)
!      Links sequence `SEQ' after the statement pointed-to by iterator
!      `I'.  `MODE' is as in `gsi_insert_after'.
  
   -- GIMPLE function: void gsi_link_after (gimple_stmt_iterator *i,
            gimple g, enum gsi_iterator_update mode)
!      Links statement `G' after the statement pointed-to by iterator `I'.
!      `MODE' is as in `gsi_insert_after'.
  
   -- GIMPLE function: gimple_seq gsi_split_seq_after
            (gimple_stmt_iterator i)
!      Move all statements in the sequence after `I' to a new sequence.
       Return this new sequence.
  
   -- GIMPLE function: gimple_seq gsi_split_seq_before
            (gimple_stmt_iterator *i)
!      Move all statements in the sequence before `I' to a new sequence.
       Return this new sequence.
  
   -- GIMPLE function: void gsi_replace (gimple_stmt_iterator *i, gimple
            stmt, bool update_eh_info)
!      Replace the statement pointed-to by `I' to `STMT'.  If
!      `UPDATE_EH_INFO' is true, the exception handling information of
!      the original statement is moved to the new statement.
  
   -- GIMPLE function: void gsi_insert_before (gimple_stmt_iterator *i,
            gimple stmt, enum gsi_iterator_update mode)
!      Insert statement `STMT' before the statement pointed-to by iterator
!      `I', update `STMT''s basic block and scan it for new operands.
!      `MODE' specifies how to update iterator `I' after insertion (see
!      enum `gsi_iterator_update').
  
   -- GIMPLE function: void gsi_insert_seq_before (gimple_stmt_iterator
            *i, gimple_seq seq, enum gsi_iterator_update mode)
!      Like `gsi_insert_before', but for all the statements in `SEQ'.
  
   -- GIMPLE function: void gsi_insert_after (gimple_stmt_iterator *i,
            gimple stmt, enum gsi_iterator_update mode)
!      Insert statement `STMT' after the statement pointed-to by iterator
!      `I', update `STMT''s basic block and scan it for new operands.
!      `MODE' specifies how to update iterator `I' after insertion (see
!      enum `gsi_iterator_update').
  
!  -- GIMPLE function: void gsi_insert_seq_after (gimple_stmt_iterator
!           *i, gimple_seq seq, enum gsi_iterator_update mode)
!      Like `gsi_insert_after', but for all the statements in `SEQ'.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_for_stmt (gimple stmt)
!      Finds iterator for `STMT'.
  
   -- GIMPLE function: void gsi_move_after (gimple_stmt_iterator *from,
            gimple_stmt_iterator *to)
!      Move the statement at `FROM' so it comes right after the statement
!      at `TO'.
  
   -- GIMPLE function: void gsi_move_before (gimple_stmt_iterator *from,
            gimple_stmt_iterator *to)
!      Move the statement at `FROM' so it comes right before the statement
!      at `TO'.
  
   -- GIMPLE function: void gsi_move_to_bb_end (gimple_stmt_iterator
            *from, basic_block bb)
!      Move the statement at `FROM' to the end of basic block `BB'.
  
   -- GIMPLE function: void gsi_insert_on_edge (edge e, gimple stmt)
!      Add `STMT' to the pending list of edge `E'.  No actual insertion is
!      made until a call to `gsi_commit_edge_inserts'() is made.
  
   -- GIMPLE function: void gsi_insert_seq_on_edge (edge e, gimple_seq
            seq)
!      Add the sequence of statements in `SEQ' to the pending list of edge
!      `E'.  No actual insertion is made until a call to
!      `gsi_commit_edge_inserts'() is made.
  
   -- GIMPLE function: basic_block gsi_insert_on_edge_immediate (edge e,
            gimple stmt)
!      Similar to `gsi_insert_on_edge'+`gsi_commit_edge_inserts'.  If a
       new block has to be created, it is returned.
  
   -- GIMPLE function: void gsi_commit_one_edge_insert (edge e,
            basic_block *new_bb)
!      Commit insertions pending at edge `E'.  If a new block is created,
!      set `NEW_BB' to this block, otherwise set it to `NULL'.
  
   -- GIMPLE function: void gsi_commit_edge_inserts (void)
       This routine will commit all pending edge insertions, creating any
--- 12790,12897 ----
  
   -- GIMPLE function: void gsi_remove (gimple_stmt_iterator *i, bool
            remove_eh_info)
!      Remove the current stmt from the sequence.  The iterator is updated
!      to point to the next statement.  When 'REMOVE_EH_INFO' is true we
!      remove the statement pointed to by iterator 'I' from the 'EH'
!      tables.  Otherwise we do not modify the 'EH' tables.  Generally,
!      'REMOVE_EH_INFO' should be true when the statement is going to be
!      removed from the 'IL' and not reinserted elsewhere.
  
   -- GIMPLE function: void gsi_link_seq_before (gimple_stmt_iterator *i,
            gimple_seq seq, enum gsi_iterator_update mode)
!      Links the sequence of statements 'SEQ' before the statement pointed
!      by iterator 'I'.  'MODE' indicates what to do with the iterator
!      after insertion (see 'enum gsi_iterator_update' above).
  
   -- GIMPLE function: void gsi_link_before (gimple_stmt_iterator *i,
            gimple g, enum gsi_iterator_update mode)
!      Links statement 'G' before the statement pointed-to by iterator
!      'I'.  Updates iterator 'I' according to 'MODE'.
  
   -- GIMPLE function: void gsi_link_seq_after (gimple_stmt_iterator *i,
            gimple_seq seq, enum gsi_iterator_update mode)
!      Links sequence 'SEQ' after the statement pointed-to by iterator
!      'I'.  'MODE' is as in 'gsi_insert_after'.
  
   -- GIMPLE function: void gsi_link_after (gimple_stmt_iterator *i,
            gimple g, enum gsi_iterator_update mode)
!      Links statement 'G' after the statement pointed-to by iterator 'I'.
!      'MODE' is as in 'gsi_insert_after'.
  
   -- GIMPLE function: gimple_seq gsi_split_seq_after
            (gimple_stmt_iterator i)
!      Move all statements in the sequence after 'I' to a new sequence.
       Return this new sequence.
  
   -- GIMPLE function: gimple_seq gsi_split_seq_before
            (gimple_stmt_iterator *i)
!      Move all statements in the sequence before 'I' to a new sequence.
       Return this new sequence.
  
   -- GIMPLE function: void gsi_replace (gimple_stmt_iterator *i, gimple
            stmt, bool update_eh_info)
!      Replace the statement pointed-to by 'I' to 'STMT'.  If
!      'UPDATE_EH_INFO' is true, the exception handling information of the
!      original statement is moved to the new statement.
  
   -- GIMPLE function: void gsi_insert_before (gimple_stmt_iterator *i,
            gimple stmt, enum gsi_iterator_update mode)
!      Insert statement 'STMT' before the statement pointed-to by iterator
!      'I', update 'STMT''s basic block and scan it for new operands.
!      'MODE' specifies how to update iterator 'I' after insertion (see
!      enum 'gsi_iterator_update').
  
   -- GIMPLE function: void gsi_insert_seq_before (gimple_stmt_iterator
            *i, gimple_seq seq, enum gsi_iterator_update mode)
!      Like 'gsi_insert_before', but for all the statements in 'SEQ'.
  
   -- GIMPLE function: void gsi_insert_after (gimple_stmt_iterator *i,
            gimple stmt, enum gsi_iterator_update mode)
!      Insert statement 'STMT' after the statement pointed-to by iterator
!      'I', update 'STMT''s basic block and scan it for new operands.
!      'MODE' specifies how to update iterator 'I' after insertion (see
!      enum 'gsi_iterator_update').
  
!  -- GIMPLE function: void gsi_insert_seq_after (gimple_stmt_iterator *i,
!           gimple_seq seq, enum gsi_iterator_update mode)
!      Like 'gsi_insert_after', but for all the statements in 'SEQ'.
  
   -- GIMPLE function: gimple_stmt_iterator gsi_for_stmt (gimple stmt)
!      Finds iterator for 'STMT'.
  
   -- GIMPLE function: void gsi_move_after (gimple_stmt_iterator *from,
            gimple_stmt_iterator *to)
!      Move the statement at 'FROM' so it comes right after the statement
!      at 'TO'.
  
   -- GIMPLE function: void gsi_move_before (gimple_stmt_iterator *from,
            gimple_stmt_iterator *to)
!      Move the statement at 'FROM' so it comes right before the statement
!      at 'TO'.
  
   -- GIMPLE function: void gsi_move_to_bb_end (gimple_stmt_iterator
            *from, basic_block bb)
!      Move the statement at 'FROM' to the end of basic block 'BB'.
  
   -- GIMPLE function: void gsi_insert_on_edge (edge e, gimple stmt)
!      Add 'STMT' to the pending list of edge 'E'.  No actual insertion is
!      made until a call to 'gsi_commit_edge_inserts'() is made.
  
   -- GIMPLE function: void gsi_insert_seq_on_edge (edge e, gimple_seq
            seq)
!      Add the sequence of statements in 'SEQ' to the pending list of edge
!      'E'.  No actual insertion is made until a call to
!      'gsi_commit_edge_inserts'() is made.
  
   -- GIMPLE function: basic_block gsi_insert_on_edge_immediate (edge e,
            gimple stmt)
!      Similar to 'gsi_insert_on_edge'+'gsi_commit_edge_inserts'.  If a
       new block has to be created, it is returned.
  
   -- GIMPLE function: void gsi_commit_one_edge_insert (edge e,
            basic_block *new_bb)
!      Commit insertions pending at edge 'E'.  If a new block is created,
!      set 'NEW_BB' to this block, otherwise set it to 'NULL'.
  
   -- GIMPLE function: void gsi_commit_edge_inserts (void)
       This routine will commit all pending edge insertions, creating any
*************** File: gccint.info,  Node: Adding a new G
*** 13035,13062 ****
  ========================================
  
  The first step in adding a new GIMPLE statement code, is modifying the
! file `gimple.def', which contains all the GIMPLE codes.  Then you must
  add a corresponding gimple_statement_base subclass located in
! `gimple.h'.  This in turn, will require you to add a corresponding
! `GTY' tag in `gsstruct.def', and code to handle this tag in
! `gss_for_code' which is located in `gimple.c'.
  
   In order for the garbage collector to know the size of the structure
! you created in `gimple.h', you need to add a case to handle your new
! GIMPLE statement in `gimple_size' which is located in `gimple.c'.
  
   You will probably want to create a function to build the new gimple
! statement in `gimple.c'.  The function should be called
! `gimple_build_NEW-TUPLE-NAME', and should return the new tuple as a
  pointer to the appropriate gimple_statement_base subclass.
  
!  If your new statement requires accessors for any members or operands
! it may have, put simple inline accessors in `gimple.h' and any
! non-trivial accessors in `gimple.c' with a corresponding prototype in
! `gimple.h'.
  
   You should add the new statement subclass to the class hierarchy
! diagram in `gimple.texi'.
  
  
  File: gccint.info,  Node: Statement and operand traversals,  Prev: Adding a new GIMPLE statement code,  Up: GIMPLE
--- 12904,12930 ----
  ========================================
  
  The first step in adding a new GIMPLE statement code, is modifying the
! file 'gimple.def', which contains all the GIMPLE codes.  Then you must
  add a corresponding gimple_statement_base subclass located in
! 'gimple.h'.  This in turn, will require you to add a corresponding 'GTY'
! tag in 'gsstruct.def', and code to handle this tag in 'gss_for_code'
! which is located in 'gimple.c'.
  
   In order for the garbage collector to know the size of the structure
! you created in 'gimple.h', you need to add a case to handle your new
! GIMPLE statement in 'gimple_size' which is located in 'gimple.c'.
  
   You will probably want to create a function to build the new gimple
! statement in 'gimple.c'.  The function should be called
! 'gimple_build_NEW-TUPLE-NAME', and should return the new tuple as a
  pointer to the appropriate gimple_statement_base subclass.
  
!  If your new statement requires accessors for any members or operands it
! may have, put simple inline accessors in 'gimple.h' and any non-trivial
! accessors in 'gimple.c' with a corresponding prototype in 'gimple.h'.
  
   You should add the new statement subclass to the class hierarchy
! diagram in 'gimple.texi'.
  
  
  File: gccint.info,  Node: Statement and operand traversals,  Prev: Adding a new GIMPLE statement code,  Up: GIMPLE
*************** File: gccint.info,  Node: Statement and
*** 13065,13118 ****
  ======================================
  
  There are two functions available for walking statements and sequences:
! `walk_gimple_stmt' and `walk_gimple_seq', accordingly, and a third
! function for walking the operands in a statement: `walk_gimple_op'.
  
   -- GIMPLE function: tree walk_gimple_stmt (gimple_stmt_iterator *gsi,
            walk_stmt_fn callback_stmt, walk_tree_fn callback_op, struct
            walk_stmt_info *wi)
!      This function is used to walk the current statement in `GSI',
!      optionally using traversal state stored in `WI'.  If `WI' is
!      `NULL', no state is kept during the traversal.
  
!      The callback `CALLBACK_STMT' is called.  If `CALLBACK_STMT' returns
       true, it means that the callback function has handled all the
       operands of the statement and it is not necessary to walk its
       operands.
  
!      If `CALLBACK_STMT' is `NULL' or it returns false, `CALLBACK_OP' is
!      called on each operand of the statement via `walk_gimple_op'.  If
!      `walk_gimple_op' returns non-`NULL' for any operand, the remaining
       operands are not scanned.
  
       The return value is that returned by the last call to
!      `walk_gimple_op', or `NULL_TREE' if no `CALLBACK_OP' is specified.
  
   -- GIMPLE function: tree walk_gimple_op (gimple stmt, walk_tree_fn
            callback_op, struct walk_stmt_info *wi)
!      Use this function to walk the operands of statement `STMT'.  Every
!      operand is walked via `walk_tree' with optional state information
!      in `WI'.
  
!      `CALLBACK_OP' is called on each operand of `STMT' via `walk_tree'.
!      Additional parameters to `walk_tree' must be stored in `WI'.  For
!      each operand `OP', `walk_tree' is called as:
  
!           walk_tree (&`OP', `CALLBACK_OP', `WI', `PSET')
  
!      If `CALLBACK_OP' returns non-`NULL' for an operand, the remaining
!      operands are not scanned.  The return value is that returned by
!      the last call to `walk_tree', or `NULL_TREE' if no `CALLBACK_OP' is
       specified.
  
   -- GIMPLE function: tree walk_gimple_seq (gimple_seq seq, walk_stmt_fn
!           callback_stmt, walk_tree_fn callback_op, struct
!           walk_stmt_info *wi)
!      This function walks all the statements in the sequence `SEQ'
!      calling `walk_gimple_stmt' on each one.  `WI' is as in
!      `walk_gimple_stmt'.  If `walk_gimple_stmt' returns non-`NULL', the
       walk is stopped and the value returned.  Otherwise, all the
!      statements are walked and `NULL_TREE' returned.
  
  
  File: gccint.info,  Node: Tree SSA,  Next: RTL,  Prev: GIMPLE,  Up: Top
--- 12933,12986 ----
  ======================================
  
  There are two functions available for walking statements and sequences:
! 'walk_gimple_stmt' and 'walk_gimple_seq', accordingly, and a third
! function for walking the operands in a statement: 'walk_gimple_op'.
  
   -- GIMPLE function: tree walk_gimple_stmt (gimple_stmt_iterator *gsi,
            walk_stmt_fn callback_stmt, walk_tree_fn callback_op, struct
            walk_stmt_info *wi)
!      This function is used to walk the current statement in 'GSI',
!      optionally using traversal state stored in 'WI'.  If 'WI' is
!      'NULL', no state is kept during the traversal.
  
!      The callback 'CALLBACK_STMT' is called.  If 'CALLBACK_STMT' returns
       true, it means that the callback function has handled all the
       operands of the statement and it is not necessary to walk its
       operands.
  
!      If 'CALLBACK_STMT' is 'NULL' or it returns false, 'CALLBACK_OP' is
!      called on each operand of the statement via 'walk_gimple_op'.  If
!      'walk_gimple_op' returns non-'NULL' for any operand, the remaining
       operands are not scanned.
  
       The return value is that returned by the last call to
!      'walk_gimple_op', or 'NULL_TREE' if no 'CALLBACK_OP' is specified.
  
   -- GIMPLE function: tree walk_gimple_op (gimple stmt, walk_tree_fn
            callback_op, struct walk_stmt_info *wi)
!      Use this function to walk the operands of statement 'STMT'.  Every
!      operand is walked via 'walk_tree' with optional state information
!      in 'WI'.
  
!      'CALLBACK_OP' is called on each operand of 'STMT' via 'walk_tree'.
!      Additional parameters to 'walk_tree' must be stored in 'WI'.  For
!      each operand 'OP', 'walk_tree' is called as:
  
!           walk_tree (&OP, CALLBACK_OP, WI, PSET)
  
!      If 'CALLBACK_OP' returns non-'NULL' for an operand, the remaining
!      operands are not scanned.  The return value is that returned by the
!      last call to 'walk_tree', or 'NULL_TREE' if no 'CALLBACK_OP' is
       specified.
  
   -- GIMPLE function: tree walk_gimple_seq (gimple_seq seq, walk_stmt_fn
!           callback_stmt, walk_tree_fn callback_op, struct walk_stmt_info
!           *wi)
!      This function walks all the statements in the sequence 'SEQ'
!      calling 'walk_gimple_stmt' on each one.  'WI' is as in
!      'walk_gimple_stmt'.  If 'walk_gimple_stmt' returns non-'NULL', the
       walk is stopped and the value returned.  Otherwise, all the
!      statements are walked and 'NULL_TREE' returned.
  
  
  File: gccint.info,  Node: Tree SSA,  Next: RTL,  Prev: GIMPLE,  Up: Top
*************** File: gccint.info,  Node: Tree SSA,  Nex
*** 13123,13147 ****
  GCC uses three main intermediate languages to represent the program
  during compilation: GENERIC, GIMPLE and RTL.  GENERIC is a
  language-independent representation generated by each front end.  It is
! used to serve as an interface between the parser and optimizer.
! GENERIC is a common representation that is able to represent programs
! written in all the languages supported by GCC.
  
   GIMPLE and RTL are used to optimize the program.  GIMPLE is used for
  target and language independent optimizations (e.g., inlining, constant
  propagation, tail call elimination, redundancy elimination, etc).  Much
  like GENERIC, GIMPLE is a language independent, tree based
  representation.  However, it differs from GENERIC in that the GIMPLE
! grammar is more restrictive: expressions contain no more than 3
! operands (except function calls), it has no control flow structures and
! expressions with side-effects are only allowed on the right hand side
! of assignments.  See the chapter describing GENERIC and GIMPLE for more
  details.
  
   This chapter describes the data structures and functions used in the
! GIMPLE optimizers (also known as "tree optimizers" or "middle end").
! In particular, it focuses on all the macros, data structures, functions
! and programming constructs needed to implement optimization passes for
  GIMPLE.
  
  * Menu:
--- 12991,13015 ----
  GCC uses three main intermediate languages to represent the program
  during compilation: GENERIC, GIMPLE and RTL.  GENERIC is a
  language-independent representation generated by each front end.  It is
! used to serve as an interface between the parser and optimizer.  GENERIC
! is a common representation that is able to represent programs written in
! all the languages supported by GCC.
  
   GIMPLE and RTL are used to optimize the program.  GIMPLE is used for
  target and language independent optimizations (e.g., inlining, constant
  propagation, tail call elimination, redundancy elimination, etc).  Much
  like GENERIC, GIMPLE is a language independent, tree based
  representation.  However, it differs from GENERIC in that the GIMPLE
! grammar is more restrictive: expressions contain no more than 3 operands
! (except function calls), it has no control flow structures and
! expressions with side-effects are only allowed on the right hand side of
! assignments.  See the chapter describing GENERIC and GIMPLE for more
  details.
  
   This chapter describes the data structures and functions used in the
! GIMPLE optimizers (also known as "tree optimizers" or "middle end").  In
! particular, it focuses on all the macros, data structures, functions and
! programming constructs needed to implement optimization passes for
  GIMPLE.
  
  * Menu:
*************** File: gccint.info,  Node: Annotations,
*** 13161,13167 ****
  The optimizers need to associate attributes with variables during the
  optimization process.  For instance, we need to know whether a variable
  has aliases.  All these attributes are stored in data structures called
! annotations which are then linked to the field `ann' in `struct
  tree_common'.
  
  
--- 13029,13035 ----
  The optimizers need to associate attributes with variables during the
  optimization process.  For instance, we need to know whether a variable
  has aliases.  All these attributes are stored in data structures called
! annotations which are then linked to the field 'ann' in 'struct
  tree_common'.
  
  
*************** their operands are going to be located a
*** 13176,13218 ****
  statement's tree.  To facilitate access to the statement's operands,
  they are organized into lists associated inside each statement's
  annotation.  Each element in an operand list is a pointer to a
! `VAR_DECL', `PARM_DECL' or `SSA_NAME' tree node.  This provides a very
  convenient way of examining and replacing operands.
  
   Data flow analysis and optimization is done on all tree nodes
! representing variables.  Any node for which `SSA_VAR_P' returns nonzero
  is considered when scanning statement operands.  However, not all
! `SSA_VAR_P' variables are processed in the same way.  For the purposes
  of optimization, we need to distinguish between references to local
! scalar variables and references to globals, statics, structures,
! arrays, aliased variables, etc.  The reason is simple, the compiler can
! gather complete data flow information for a local scalar.  On the other
! hand, a global variable may be modified by a function call, it may not
! be possible to keep track of all the elements of an array or the fields
! of a structure, etc.
  
   The operand scanner gathers two kinds of operands: "real" and
! "virtual".  An operand for which `is_gimple_reg' returns true is
! considered real, otherwise it is a virtual operand.  We also
! distinguish between uses and definitions.  An operand is used if its
! value is loaded by the statement (e.g., the operand at the RHS of an
! assignment).  If the statement assigns a new value to the operand, the
! operand is considered a definition (e.g., the operand at the LHS of an
! assignment).
  
   Virtual and real operands also have very different data flow
! properties.  Real operands are unambiguous references to the full
! object that they represent.  For instance, given
  
       {
         int a, b;
         a = b
       }
  
!  Since `a' and `b' are non-aliased locals, the statement `a = b' will
! have one real definition and one real use because variable `a' is
! completely modified with the contents of variable `b'.  Real definition
! are also known as "killing definitions".  Similarly, the use of `b'
  reads all its bits.
  
   In contrast, virtual operands are used with variables that can have a
--- 13044,13085 ----
  statement's tree.  To facilitate access to the statement's operands,
  they are organized into lists associated inside each statement's
  annotation.  Each element in an operand list is a pointer to a
! 'VAR_DECL', 'PARM_DECL' or 'SSA_NAME' tree node.  This provides a very
  convenient way of examining and replacing operands.
  
   Data flow analysis and optimization is done on all tree nodes
! representing variables.  Any node for which 'SSA_VAR_P' returns nonzero
  is considered when scanning statement operands.  However, not all
! 'SSA_VAR_P' variables are processed in the same way.  For the purposes
  of optimization, we need to distinguish between references to local
! scalar variables and references to globals, statics, structures, arrays,
! aliased variables, etc.  The reason is simple, the compiler can gather
! complete data flow information for a local scalar.  On the other hand, a
! global variable may be modified by a function call, it may not be
! possible to keep track of all the elements of an array or the fields of
! a structure, etc.
  
   The operand scanner gathers two kinds of operands: "real" and
! "virtual".  An operand for which 'is_gimple_reg' returns true is
! considered real, otherwise it is a virtual operand.  We also distinguish
! between uses and definitions.  An operand is used if its value is loaded
! by the statement (e.g., the operand at the RHS of an assignment).  If
! the statement assigns a new value to the operand, the operand is
! considered a definition (e.g., the operand at the LHS of an assignment).
  
   Virtual and real operands also have very different data flow
! properties.  Real operands are unambiguous references to the full object
! that they represent.  For instance, given
  
       {
         int a, b;
         a = b
       }
  
!  Since 'a' and 'b' are non-aliased locals, the statement 'a = b' will
! have one real definition and one real use because variable 'a' is
! completely modified with the contents of variable 'b'.  Real definition
! are also known as "killing definitions".  Similarly, the use of 'b'
  reads all its bits.
  
   In contrast, virtual operands are used with variables that can have a
*************** definitions.  For globals, structures, a
*** 13222,13231 ****
  a statement whether a variable of these types has a killing definition.
  If the variable does, then the statement is marked as having a "must
  definition" of that variable.  However, if a statement is only defining
! a part of the variable (i.e. a field in a structure), or if we know
! that a statement might define the variable but we cannot say for sure,
! then we mark that statement as having a "may definition".  For
! instance, given
  
       {
         int a, b, *p;
--- 13089,13098 ----
  a statement whether a variable of these types has a killing definition.
  If the variable does, then the statement is marked as having a "must
  definition" of that variable.  However, if a statement is only defining
! a part of the variable (i.e. a field in a structure), or if we know that
! a statement might define the variable but we cannot say for sure, then
! we mark that statement as having a "may definition".  For instance,
! given
  
       {
         int a, b, *p;
*************** instance, given
*** 13238,13251 ****
         return *p;
       }
  
!  The assignment `*p = 5' may be a definition of `a' or `b'.  If we
! cannot determine statically where `p' is pointing to at the time of the
! store operation, we create virtual definitions to mark that statement
! as a potential definition site for `a' and `b'.  Memory loads are
! similarly marked with virtual use operands.  Virtual operands are shown
! in tree dumps right before the statement that contains them.  To
! request a tree dump with virtual operands, use the `-vops' option to
! `-fdump-tree':
  
       {
         int a, b, *p;
--- 13105,13117 ----
         return *p;
       }
  
!  The assignment '*p = 5' may be a definition of 'a' or 'b'.  If we
! cannot determine statically where 'p' is pointing to at the time of the
! store operation, we create virtual definitions to mark that statement as
! a potential definition site for 'a' and 'b'.  Memory loads are similarly
! marked with virtual use operands.  Virtual operands are shown in tree
! dumps right before the statement that contains them.  To request a tree
! dump with virtual operands, use the '-vops' option to '-fdump-tree':
  
       {
         int a, b, *p;
*************** request a tree dump with virtual operand
*** 13263,13317 ****
         return *p;
       }
  
!  Notice that `VDEF' operands have two copies of the referenced
! variable.  This indicates that this is not a killing definition of that
! variable.  In this case we refer to it as a "may definition" or
! "aliased store".  The presence of the second copy of the variable in
! the `VDEF' operand will become important when the function is converted
! into SSA form.  This will be used to link all the non-killing
! definitions to prevent optimizations from making incorrect assumptions
! about them.
  
!  Operands are updated as soon as the statement is finished via a call
! to `update_stmt'.  If statement elements are changed via `SET_USE' or
! `SET_DEF', then no further action is required (i.e., those macros take
  care of updating the statement).  If changes are made by manipulating
! the statement's tree directly, then a call must be made to
! `update_stmt' when complete.  Calling one of the `bsi_insert' routines
! or `bsi_replace' performs an implicit call to `update_stmt'.
  
  12.2.1 Operand Iterators And Access Routines
  --------------------------------------------
  
! Operands are collected by `tree-ssa-operands.c'.  They are stored
! inside each statement's annotation and can be accessed through either
! the operand iterators or an access routine.
  
   The following access routines are available for examining operands:
  
!   1. `SINGLE_SSA_{USE,DEF,TREE}_OPERAND': These accessors will return
       NULL unless there is exactly one operand matching the specified
!      flags.  If there is exactly one operand, the operand is returned
!      as either a `tree', `def_operand_p', or `use_operand_p'.
  
            tree t = SINGLE_SSA_TREE_OPERAND (stmt, flags);
            use_operand_p u = SINGLE_SSA_USE_OPERAND (stmt, SSA_ALL_VIRTUAL_USES);
            def_operand_p d = SINGLE_SSA_DEF_OPERAND (stmt, SSA_OP_ALL_DEFS);
  
!   2. `ZERO_SSA_OPERANDS': This macro returns true if there are no
       operands matching the specified flags.
  
            if (ZERO_SSA_OPERANDS (stmt, SSA_OP_ALL_VIRTUALS))
              return;
  
!   3. `NUM_SSA_OPERANDS': This macro Returns the number of operands
       matching 'flags'.  This actually executes a loop to perform the
       count, so only use this if it is really needed.
  
            int count = NUM_SSA_OPERANDS (stmt, flags)
  
   If you wish to iterate over some or all operands, use the
! `FOR_EACH_SSA_{USE,DEF,TREE}_OPERAND' iterator.  For example, to print
  all the operands for a statement:
  
       void
--- 13129,13182 ----
         return *p;
       }
  
!  Notice that 'VDEF' operands have two copies of the referenced variable.
! This indicates that this is not a killing definition of that variable.
! In this case we refer to it as a "may definition" or "aliased store".
! The presence of the second copy of the variable in the 'VDEF' operand
! will become important when the function is converted into SSA form.
! This will be used to link all the non-killing definitions to prevent
! optimizations from making incorrect assumptions about them.
  
!  Operands are updated as soon as the statement is finished via a call to
! 'update_stmt'.  If statement elements are changed via 'SET_USE' or
! 'SET_DEF', then no further action is required (i.e., those macros take
  care of updating the statement).  If changes are made by manipulating
! the statement's tree directly, then a call must be made to 'update_stmt'
! when complete.  Calling one of the 'bsi_insert' routines or
! 'bsi_replace' performs an implicit call to 'update_stmt'.
  
  12.2.1 Operand Iterators And Access Routines
  --------------------------------------------
  
! Operands are collected by 'tree-ssa-operands.c'.  They are stored inside
! each statement's annotation and can be accessed through either the
! operand iterators or an access routine.
  
   The following access routines are available for examining operands:
  
!   1. 'SINGLE_SSA_{USE,DEF,TREE}_OPERAND': These accessors will return
       NULL unless there is exactly one operand matching the specified
!      flags.  If there is exactly one operand, the operand is returned as
!      either a 'tree', 'def_operand_p', or 'use_operand_p'.
  
            tree t = SINGLE_SSA_TREE_OPERAND (stmt, flags);
            use_operand_p u = SINGLE_SSA_USE_OPERAND (stmt, SSA_ALL_VIRTUAL_USES);
            def_operand_p d = SINGLE_SSA_DEF_OPERAND (stmt, SSA_OP_ALL_DEFS);
  
!   2. 'ZERO_SSA_OPERANDS': This macro returns true if there are no
       operands matching the specified flags.
  
            if (ZERO_SSA_OPERANDS (stmt, SSA_OP_ALL_VIRTUALS))
              return;
  
!   3. 'NUM_SSA_OPERANDS': This macro Returns the number of operands
       matching 'flags'.  This actually executes a loop to perform the
       count, so only use this if it is really needed.
  
            int count = NUM_SSA_OPERANDS (stmt, flags)
  
   If you wish to iterate over some or all operands, use the
! 'FOR_EACH_SSA_{USE,DEF,TREE}_OPERAND' iterator.  For example, to print
  all the operands for a statement:
  
       void
*************** all the operands for a statement:
*** 13326,13333 ****
  
   How to choose the appropriate iterator:
  
!   1. Determine whether you are need to see the operand pointers, or
!      just the trees, and choose the appropriate macro:
  
            Need            Macro:
            ----            -------
--- 13191,13198 ----
  
   How to choose the appropriate iterator:
  
!   1. Determine whether you are need to see the operand pointers, or just
!      the trees, and choose the appropriate macro:
  
            Need            Macro:
            ----            -------
*************** all the operands for a statement:
*** 13341,13347 ****
  
    3. Determine which operands you wish to use, and specify the flags of
       those you are interested in.  They are documented in
!      `tree-ssa-operands.h':
  
            #define SSA_OP_USE              0x01    /* Real USE operands.  */
            #define SSA_OP_DEF              0x02    /* Real DEF operands.  */
--- 13206,13212 ----
  
    3. Determine which operands you wish to use, and specify the flags of
       those you are interested in.  They are documented in
!      'tree-ssa-operands.h':
  
            #define SSA_OP_USE              0x01    /* Real USE operands.  */
            #define SSA_OP_DEF              0x02    /* Real DEF operands.  */
*************** all the operands for a statement:
*** 13356,13363 ****
            #define SSA_OP_ALL_DEFS		(SSA_OP_VIRTUAL_DEFS | SSA_OP_DEF)
            #define SSA_OP_ALL_OPERANDS	(SSA_OP_ALL_USES | SSA_OP_ALL_DEFS)
  
!  So if you want to look at the use pointers for all the `USE' and
! `VUSE' operands, you would do something like:
  
         use_operand_p use_p;
         ssa_op_iter iter;
--- 13221,13228 ----
            #define SSA_OP_ALL_DEFS		(SSA_OP_VIRTUAL_DEFS | SSA_OP_DEF)
            #define SSA_OP_ALL_OPERANDS	(SSA_OP_ALL_USES | SSA_OP_ALL_DEFS)
  
!  So if you want to look at the use pointers for all the 'USE' and 'VUSE'
! operands, you would do something like:
  
         use_operand_p use_p;
         ssa_op_iter iter;
*************** all the operands for a statement:
*** 13367,13376 ****
             process_use_ptr (use_p);
           }
  
!  The `TREE' macro is basically the same as the `USE' and `DEF' macros,
! only with the use or def dereferenced via `USE_FROM_PTR (use_p)' and
! `DEF_FROM_PTR (def_p)'.  Since we aren't using operand pointers, use
! and defs flags can be mixed.
  
         tree var;
         ssa_op_iter iter;
--- 13232,13241 ----
             process_use_ptr (use_p);
           }
  
!  The 'TREE' macro is basically the same as the 'USE' and 'DEF' macros,
! only with the use or def dereferenced via 'USE_FROM_PTR (use_p)' and
! 'DEF_FROM_PTR (def_p)'.  Since we aren't using operand pointers, use and
! defs flags can be mixed.
  
         tree var;
         ssa_op_iter iter;
*************** and defs flags can be mixed.
*** 13380,13396 ****
              print_generic_expr (stderr, var, TDF_SLIM);
           }
  
!  `VDEF's are broken into two flags, one for the `DEF' portion
! (`SSA_OP_VDEF') and one for the USE portion (`SSA_OP_VUSE').
  
   There are many examples in the code, in addition to the documentation
! in `tree-ssa-operands.h' and `ssa-iterators.h'.
  
   There are also a couple of variants on the stmt iterators regarding PHI
  nodes.
  
!  `FOR_EACH_PHI_ARG' Works exactly like `FOR_EACH_SSA_USE_OPERAND',
! except it works over `PHI' arguments instead of statement operands.
  
       /* Look at every virtual PHI use.  */
       FOR_EACH_PHI_ARG (use_p, phi_stmt, iter, SSA_OP_VIRTUAL_USES)
--- 13245,13261 ----
              print_generic_expr (stderr, var, TDF_SLIM);
           }
  
!  'VDEF's are broken into two flags, one for the 'DEF' portion
! ('SSA_OP_VDEF') and one for the USE portion ('SSA_OP_VUSE').
  
   There are many examples in the code, in addition to the documentation
! in 'tree-ssa-operands.h' and 'ssa-iterators.h'.
  
   There are also a couple of variants on the stmt iterators regarding PHI
  nodes.
  
!  'FOR_EACH_PHI_ARG' Works exactly like 'FOR_EACH_SSA_USE_OPERAND',
! except it works over 'PHI' arguments instead of statement operands.
  
       /* Look at every virtual PHI use.  */
       FOR_EACH_PHI_ARG (use_p, phi_stmt, iter, SSA_OP_VIRTUAL_USES)
*************** except it works over `PHI' arguments ins
*** 13406,13416 ****
       FOR_EACH_PHI_ARG (use_p, phi_stmt, iter, SSA_OP_ALL_USES)
         my_code;
  
!  `FOR_EACH_PHI_OR_STMT_{USE,DEF}' works exactly like
! `FOR_EACH_SSA_{USE,DEF}_OPERAND', except it will function on either a
! statement or a `PHI' node.  These should be used when it is appropriate
! but they are not quite as efficient as the individual `FOR_EACH_PHI'
! and `FOR_EACH_SSA' routines.
  
       FOR_EACH_PHI_OR_STMT_USE (use_operand_p, stmt, iter, flags)
         {
--- 13271,13281 ----
       FOR_EACH_PHI_ARG (use_p, phi_stmt, iter, SSA_OP_ALL_USES)
         my_code;
  
!  'FOR_EACH_PHI_OR_STMT_{USE,DEF}' works exactly like
! 'FOR_EACH_SSA_{USE,DEF}_OPERAND', except it will function on either a
! statement or a 'PHI' node.  These should be used when it is appropriate
! but they are not quite as efficient as the individual 'FOR_EACH_PHI' and
! 'FOR_EACH_SSA' routines.
  
       FOR_EACH_PHI_OR_STMT_USE (use_operand_p, stmt, iter, flags)
         {
*************** and `FOR_EACH_SSA' routines.
*** 13426,13433 ****
  ---------------------
  
  Immediate use information is now always available.  Using the immediate
! use iterators, you may examine every use of any `SSA_NAME'. For
! instance, to change each use of `ssa_var' to `ssa_var2' and call
  fold_stmt on each stmt after that is done:
  
         use_operand_p imm_use_p;
--- 13291,13298 ----
  ---------------------
  
  Immediate use information is now always available.  Using the immediate
! use iterators, you may examine every use of any 'SSA_NAME'.  For
! instance, to change each use of 'ssa_var' to 'ssa_var2' and call
  fold_stmt on each stmt after that is done:
  
         use_operand_p imm_use_p;
*************** fold_stmt on each stmt after that is don
*** 13442,13462 ****
             fold_stmt (stmt);
           }
  
!  There are 2 iterators which can be used. `FOR_EACH_IMM_USE_FAST' is
  used when the immediate uses are not changed, i.e., you are looking at
  the uses, but not setting them.
  
   If they do get changed, then care must be taken that things are not
! changed under the iterators, so use the `FOR_EACH_IMM_USE_STMT' and
! `FOR_EACH_IMM_USE_ON_STMT' iterators.  They attempt to preserve the
  sanity of the use list by moving all the uses for a statement into a
  controlled position, and then iterating over those uses.  Then the
  optimization can manipulate the stmt when all the uses have been
  processed.  This is a little slower than the FAST version since it adds
  a placeholder element and must sort through the list a bit for each
! statement.  This placeholder element must be also be removed if the
! loop is terminated early.  The macro `BREAK_FROM_IMM_USE_SAFE' is
! provided to do this :
  
         FOR_EACH_IMM_USE_STMT (stmt, iterator, ssa_var)
           {
--- 13307,13327 ----
             fold_stmt (stmt);
           }
  
!  There are 2 iterators which can be used.  'FOR_EACH_IMM_USE_FAST' is
  used when the immediate uses are not changed, i.e., you are looking at
  the uses, but not setting them.
  
   If they do get changed, then care must be taken that things are not
! changed under the iterators, so use the 'FOR_EACH_IMM_USE_STMT' and
! 'FOR_EACH_IMM_USE_ON_STMT' iterators.  They attempt to preserve the
  sanity of the use list by moving all the uses for a statement into a
  controlled position, and then iterating over those uses.  Then the
  optimization can manipulate the stmt when all the uses have been
  processed.  This is a little slower than the FAST version since it adds
  a placeholder element and must sort through the list a bit for each
! statement.  This placeholder element must be also be removed if the loop
! is terminated early.  The macro 'BREAK_FROM_IMM_USE_SAFE' is provided to
! do this :
  
         FOR_EACH_IMM_USE_STMT (stmt, iterator, ssa_var)
           {
*************** provided to do this :
*** 13468,13503 ****
             fold_stmt (stmt);
           }
  
!  There are checks in `verify_ssa' which verify that the immediate use
  list is up to date, as well as checking that an optimization didn't
  break from the loop without using this macro.  It is safe to simply
! 'break'; from a `FOR_EACH_IMM_USE_FAST' traverse.
  
   Some useful functions and macros:
!   1. `has_zero_uses (ssa_var)' : Returns true if there are no uses of
!      `ssa_var'.
! 
!   2. `has_single_use (ssa_var)' : Returns true if there is only a
!      single use of `ssa_var'.
! 
!   3. `single_imm_use (ssa_var, use_operand_p *ptr, tree *stmt)' :
!      Returns true if there is only a single use of `ssa_var', and also
       returns the use pointer and statement it occurs in, in the second
       and third parameters.
! 
!   4. `num_imm_uses (ssa_var)' : Returns the number of immediate uses of
!      `ssa_var'. It is better not to use this if possible since it simply
!      utilizes a loop to count the uses.
! 
!   5. `PHI_ARG_INDEX_FROM_USE (use_p)' : Given a use within a `PHI'
!      node, return the index number for the use.  An assert is triggered
!      if the use isn't located in a `PHI' node.
! 
!   6. `USE_STMT (use_p)' : Return the statement a use occurs in.
  
   Note that uses are not put into an immediate use list until their
! statement is actually inserted into the instruction stream via a
! `bsi_*' routine.
  
   It is also still possible to utilize lazy updating of statements, but
  this should be used only when absolutely required.  Both alias analysis
--- 13333,13363 ----
             fold_stmt (stmt);
           }
  
!  There are checks in 'verify_ssa' which verify that the immediate use
  list is up to date, as well as checking that an optimization didn't
  break from the loop without using this macro.  It is safe to simply
! 'break'; from a 'FOR_EACH_IMM_USE_FAST' traverse.
  
   Some useful functions and macros:
!   1. 'has_zero_uses (ssa_var)' : Returns true if there are no uses of
!      'ssa_var'.
!   2. 'has_single_use (ssa_var)' : Returns true if there is only a single
!      use of 'ssa_var'.
!   3. 'single_imm_use (ssa_var, use_operand_p *ptr, tree *stmt)' :
!      Returns true if there is only a single use of 'ssa_var', and also
       returns the use pointer and statement it occurs in, in the second
       and third parameters.
!   4. 'num_imm_uses (ssa_var)' : Returns the number of immediate uses of
!      'ssa_var'.  It is better not to use this if possible since it
!      simply utilizes a loop to count the uses.
!   5. 'PHI_ARG_INDEX_FROM_USE (use_p)' : Given a use within a 'PHI' node,
!      return the index number for the use.  An assert is triggered if the
!      use isn't located in a 'PHI' node.
!   6. 'USE_STMT (use_p)' : Return the statement a use occurs in.
  
   Note that uses are not put into an immediate use list until their
! statement is actually inserted into the instruction stream via a 'bsi_*'
! routine.
  
   It is also still possible to utilize lazy updating of statements, but
  this should be used only when absolutely required.  Both alias analysis
*************** and the dominator optimizations currentl
*** 13505,13515 ****
  
   When lazy updating is being used, the immediate use information is out
  of date and cannot be used reliably.  Lazy updating is achieved by
! simply marking statements modified via calls to `mark_stmt_modified'
! instead of `update_stmt'.  When lazy updating is no longer required,
! all the modified statements must have `update_stmt' called in order to
! bring them up to date.  This must be done before the optimization is
! finished, or `verify_ssa' will trigger an abort.
  
   This is done with a simple loop over the instruction stream:
         block_stmt_iterator bsi;
--- 13365,13375 ----
  
   When lazy updating is being used, the immediate use information is out
  of date and cannot be used reliably.  Lazy updating is achieved by
! simply marking statements modified via calls to 'mark_stmt_modified'
! instead of 'update_stmt'.  When lazy updating is no longer required, all
! the modified statements must have 'update_stmt' called in order to bring
! them up to date.  This must be done before the optimization is finished,
! or 'verify_ssa' will trigger an abort.
  
   This is done with a simple loop over the instruction stream:
         block_stmt_iterator bsi;
*************** File: gccint.info,  Node: SSA,  Next: Al
*** 13528,13537 ****
  
  Most of the tree optimizers rely on the data flow information provided
  by the Static Single Assignment (SSA) form.  We implement the SSA form
! as described in `R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K.
! Zadeck.  Efficiently Computing Static Single Assignment Form and the
! Control Dependence Graph.  ACM Transactions on Programming Languages
! and Systems, 13(4):451-490, October 1991'.
  
   The SSA form is based on the premise that program variables are
  assigned in exactly one location in the program.  Multiple assignments
--- 13388,13397 ----
  
  Most of the tree optimizers rely on the data flow information provided
  by the Static Single Assignment (SSA) form.  We implement the SSA form
! as described in 'R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K.
! Zadeck. Efficiently Computing Static Single Assignment Form and the
! Control Dependence Graph. ACM Transactions on Programming Languages and
! Systems, 13(4):451-490, October 1991'.
  
   The SSA form is based on the premise that program variables are
  assigned in exactly one location in the program.  Multiple assignments
*************** representation so that every time a vari
*** 13542,13555 ****
  new version of the variable is created.  Different versions of the same
  variable are distinguished by subscripting the variable name with its
  version number.  Variables used in the right-hand side of expressions
! are renamed so that their version number matches that of the most
! recent assignment.
  
!  We represent variable versions using `SSA_NAME' nodes.  The renaming
! process in `tree-ssa.c' wraps every real and virtual operand with an
! `SSA_NAME' node which contains the version number and the statement
! that created the `SSA_NAME'.  Only definitions and virtual definitions
! may create new `SSA_NAME' nodes.
  
   Sometimes, flow of control makes it impossible to determine the most
  recent version of a variable.  In these cases, the compiler inserts an
--- 13402,13415 ----
  new version of the variable is created.  Different versions of the same
  variable are distinguished by subscripting the variable name with its
  version number.  Variables used in the right-hand side of expressions
! are renamed so that their version number matches that of the most recent
! assignment.
  
!  We represent variable versions using 'SSA_NAME' nodes.  The renaming
! process in 'tree-ssa.c' wraps every real and virtual operand with an
! 'SSA_NAME' node which contains the version number and the statement that
! created the 'SSA_NAME'.  Only definitions and virtual definitions may
! create new 'SSA_NAME' nodes.
  
   Sometimes, flow of control makes it impossible to determine the most
  recent version of a variable.  In these cases, the compiler inserts an
*************** variable to create a new name for it.  F
*** 13568,13586 ****
       return a_4;
  
   Since it is not possible to determine which of the three branches will
! be taken at runtime, we don't know which of `a_1', `a_2' or `a_3' to
! use at the return statement.  So, the SSA renamer creates a new version
! `a_4' which is assigned the result of "merging" `a_1', `a_2' and `a_3'.
  Hence, PHI nodes mean "one of these operands.  I don't know which".
  
   The following functions can be used to examine PHI nodes
  
   -- Function: gimple_phi_result (PHI)
!      Returns the `SSA_NAME' created by PHI node PHI (i.e., PHI's LHS).
  
   -- Function: gimple_phi_num_args (PHI)
!      Returns the number of arguments in PHI.  This number is exactly
!      the number of incoming edges to the basic block holding PHI.
  
   -- Function: gimple_phi_arg (PHI, I)
       Returns Ith argument of PHI.
--- 13428,13446 ----
       return a_4;
  
   Since it is not possible to determine which of the three branches will
! be taken at runtime, we don't know which of 'a_1', 'a_2' or 'a_3' to use
! at the return statement.  So, the SSA renamer creates a new version
! 'a_4' which is assigned the result of "merging" 'a_1', 'a_2' and 'a_3'.
  Hence, PHI nodes mean "one of these operands.  I don't know which".
  
   The following functions can be used to examine PHI nodes
  
   -- Function: gimple_phi_result (PHI)
!      Returns the 'SSA_NAME' created by PHI node PHI (i.e., PHI's LHS).
  
   -- Function: gimple_phi_num_args (PHI)
!      Returns the number of arguments in PHI.  This number is exactly the
!      number of incoming edges to the basic block holding PHI.
  
   -- Function: gimple_phi_arg (PHI, I)
       Returns Ith argument of PHI.
*************** Hence, PHI nodes mean "one of these oper
*** 13589,13595 ****
       Returns the incoming edge for the Ith argument of PHI.
  
   -- Function: gimple_phi_arg_def (PHI, I)
!      Returns the `SSA_NAME' for the Ith argument of PHI.
  
  12.3.1 Preserving the SSA form
  ------------------------------
--- 13449,13455 ----
       Returns the incoming edge for the Ith argument of PHI.
  
   -- Function: gimple_phi_arg_def (PHI, I)
!      Returns the 'SSA_NAME' for the Ith argument of PHI.
  
  12.3.1 Preserving the SSA form
  ------------------------------
*************** SSA form.
*** 13606,13613 ****
  variables, keeping the SSA form up to date depends on whether you are
  updating register or virtual names.  In both cases, the general idea
  behind incremental SSA updates is similar: when new SSA names are
! created, they typically are meant to replace other existing names in
! the program.
  
   For instance, given the following code:
  
--- 13466,13473 ----
  variables, keeping the SSA form up to date depends on whether you are
  updating register or virtual names.  In both cases, the general idea
  behind incremental SSA updates is similar: when new SSA names are
! created, they typically are meant to replace other existing names in the
! program.
  
   For instance, given the following code:
  
*************** the program.
*** 13623,13629 ****
            10   goto L0;
            11 endif
  
!  Suppose that we insert new names `x_10' and `x_11' (lines `4' and `8').
  
            1  L0:
            2  x_1 = PHI (0, x_5)
--- 13483,13489 ----
            10   goto L0;
            11 endif
  
!  Suppose that we insert new names 'x_10' and 'x_11' (lines '4' and '8').
  
            1  L0:
            2  x_1 = PHI (0, x_5)
*************** the program.
*** 13639,13703 ****
            12   goto L0;
            13 endif
  
!  We want to replace all the uses of `x_1' with the new definitions of
! `x_10' and `x_11'.  Note that the only uses that should be replaced are
! those at lines `5', `9' and `11'.  Also, the use of `x_7' at line `9'
! should _not_ be replaced (this is why we cannot just mark symbol `x' for
  renaming).
  
!  Additionally, we may need to insert a PHI node at line `11' because
! that is a merge point for `x_10' and `x_11'.  So the use of `x_1' at
! line `11' will be replaced with the new PHI node.  The insertion of PHI
  nodes is optional.  They are not strictly necessary to preserve the SSA
  form, and depending on what the caller inserted, they may not even be
  useful for the optimizers.
  
   Updating the SSA form is a two step process.  First, the pass has to
  identify which names need to be updated and/or which symbols need to be
! renamed into SSA form for the first time.  When new names are
! introduced to replace existing names in the program, the mapping
! between the old and the new names are registered by calling
! `register_new_name_mapping' (note that if your pass creates new code by
! duplicating basic blocks, the call to `tree_duplicate_bb' will set up
! the necessary mappings automatically).
  
   After the replacement mappings have been registered and new symbols
! marked for renaming, a call to `update_ssa' makes the registered
! changes.  This can be done with an explicit call or by creating `TODO'
! flags in the `tree_opt_pass' structure for your pass.  There are
! several `TODO' flags that control the behavior of `update_ssa':
  
!    * `TODO_update_ssa'.  Update the SSA form inserting PHI nodes for
       newly exposed symbols and virtual names marked for updating.  When
!      updating real names, only insert PHI nodes for a real name `O_j'
!      in blocks reached by all the new and old definitions for `O_j'.
!      If the iterated dominance frontier for `O_j' is not pruned, we may
!      end up inserting PHI nodes in blocks that have one or more edges
!      with no incoming definition for `O_j'.  This would lead to
!      uninitialized warnings for `O_j''s symbol.
  
!    * `TODO_update_ssa_no_phi'.  Update the SSA form without inserting
       any new PHI nodes at all.  This is used by passes that have either
       inserted all the PHI nodes themselves or passes that need only to
       patch use-def and def-def chains for virtuals (e.g., DCE).
  
!    * `TODO_update_ssa_full_phi'.  Insert PHI nodes everywhere they are
       needed.  No pruning of the IDF is done.  This is used by passes
!      that need the PHI nodes for `O_j' even if it means that some
!      arguments will come from the default definition of `O_j''s symbol
!      (e.g., `pass_linear_transform').
  
       WARNING: If you need to use this flag, chances are that your pass
       may be doing something wrong.  Inserting PHI nodes for an old name
       where not all edges carry a new replacement may lead to silent
       codegen errors or spurious uninitialized warnings.
  
!    * `TODO_update_ssa_only_virtuals'.  Passes that update the SSA form
       on their own may want to delegate the updating of virtual names to
!      the generic updater.  Since FUD chains are easier to maintain,
!      this simplifies the work they need to do.  NOTE: If this flag is
!      used, any OLD->NEW mappings for real names are explicitly
!      destroyed and only the symbols marked for renaming are processed.
  
  12.3.2 Preserving the virtual SSA form
  --------------------------------------
--- 13499,13563 ----
            12   goto L0;
            13 endif
  
!  We want to replace all the uses of 'x_1' with the new definitions of
! 'x_10' and 'x_11'.  Note that the only uses that should be replaced are
! those at lines '5', '9' and '11'.  Also, the use of 'x_7' at line '9'
! should _not_ be replaced (this is why we cannot just mark symbol 'x' for
  renaming).
  
!  Additionally, we may need to insert a PHI node at line '11' because
! that is a merge point for 'x_10' and 'x_11'.  So the use of 'x_1' at
! line '11' will be replaced with the new PHI node.  The insertion of PHI
  nodes is optional.  They are not strictly necessary to preserve the SSA
  form, and depending on what the caller inserted, they may not even be
  useful for the optimizers.
  
   Updating the SSA form is a two step process.  First, the pass has to
  identify which names need to be updated and/or which symbols need to be
! renamed into SSA form for the first time.  When new names are introduced
! to replace existing names in the program, the mapping between the old
! and the new names are registered by calling 'register_new_name_mapping'
! (note that if your pass creates new code by duplicating basic blocks,
! the call to 'tree_duplicate_bb' will set up the necessary mappings
! automatically).
  
   After the replacement mappings have been registered and new symbols
! marked for renaming, a call to 'update_ssa' makes the registered
! changes.  This can be done with an explicit call or by creating 'TODO'
! flags in the 'tree_opt_pass' structure for your pass.  There are several
! 'TODO' flags that control the behavior of 'update_ssa':
  
!    * 'TODO_update_ssa'.  Update the SSA form inserting PHI nodes for
       newly exposed symbols and virtual names marked for updating.  When
!      updating real names, only insert PHI nodes for a real name 'O_j' in
!      blocks reached by all the new and old definitions for 'O_j'.  If
!      the iterated dominance frontier for 'O_j' is not pruned, we may end
!      up inserting PHI nodes in blocks that have one or more edges with
!      no incoming definition for 'O_j'.  This would lead to uninitialized
!      warnings for 'O_j''s symbol.
  
!    * 'TODO_update_ssa_no_phi'.  Update the SSA form without inserting
       any new PHI nodes at all.  This is used by passes that have either
       inserted all the PHI nodes themselves or passes that need only to
       patch use-def and def-def chains for virtuals (e.g., DCE).
  
!    * 'TODO_update_ssa_full_phi'.  Insert PHI nodes everywhere they are
       needed.  No pruning of the IDF is done.  This is used by passes
!      that need the PHI nodes for 'O_j' even if it means that some
!      arguments will come from the default definition of 'O_j''s symbol
!      (e.g., 'pass_linear_transform').
  
       WARNING: If you need to use this flag, chances are that your pass
       may be doing something wrong.  Inserting PHI nodes for an old name
       where not all edges carry a new replacement may lead to silent
       codegen errors or spurious uninitialized warnings.
  
!    * 'TODO_update_ssa_only_virtuals'.  Passes that update the SSA form
       on their own may want to delegate the updating of virtual names to
!      the generic updater.  Since FUD chains are easier to maintain, this
!      simplifies the work they need to do.  NOTE: If this flag is used,
!      any OLD->NEW mappings for real names are explicitly destroyed and
!      only the symbols marked for renaming are processed.
  
  12.3.2 Preserving the virtual SSA form
  --------------------------------------
*************** several `TODO' flags that control the be
*** 13705,13712 ****
  The virtual SSA form is harder to preserve than the non-virtual SSA form
  mainly because the set of virtual operands for a statement may change at
  what some would consider unexpected times.  In general, statement
! modifications should be bracketed between calls to `push_stmt_changes'
! and `pop_stmt_changes'.  For example,
  
           munge_stmt (tree stmt)
           {
--- 13565,13572 ----
  The virtual SSA form is harder to preserve than the non-virtual SSA form
  mainly because the set of virtual operands for a statement may change at
  what some would consider unexpected times.  In general, statement
! modifications should be bracketed between calls to 'push_stmt_changes'
! and 'pop_stmt_changes'.  For example,
  
           munge_stmt (tree stmt)
           {
*************** and `pop_stmt_changes'.  For example,
*** 13715,13756 ****
              pop_stmt_changes (&stmt);
           }
  
!  The call to `push_stmt_changes' saves the current state of the
! statement operands and the call to `pop_stmt_changes' compares the
! saved state with the current one and does the appropriate symbol
! marking for the SSA renamer.
  
   It is possible to modify several statements at a time, provided that
! `push_stmt_changes' and `pop_stmt_changes' are called in LIFO order, as
  when processing a stack of statements.
  
   Additionally, if the pass discovers that it did not need to make
! changes to the statement after calling `push_stmt_changes', it can
  simply discard the topmost change buffer by calling
! `discard_stmt_changes'.  This will avoid the expensive operand re-scan
  operation and the buffer comparison that determines if symbols need to
  be marked for renaming.
  
! 12.3.3 Examining `SSA_NAME' nodes
  ---------------------------------
  
! The following macros can be used to examine `SSA_NAME' nodes
  
   -- Macro: SSA_NAME_DEF_STMT (VAR)
!      Returns the statement S that creates the `SSA_NAME' VAR.  If S is
!      an empty statement (i.e., `IS_EMPTY_STMT (S)' returns `true'), it
       means that the first reference to this variable is a USE or a VUSE.
  
   -- Macro: SSA_NAME_VERSION (VAR)
!      Returns the version number of the `SSA_NAME' object VAR.
  
  12.3.4 Walking the dominator tree
  ---------------------------------
  
   -- Tree SSA function: void walk_dominator_tree (WALK_DATA, BB)
       This function walks the dominator tree for the current CFG calling
       a set of callback functions defined in STRUCT DOM_WALK_DATA in
!      `domwalk.h'.  The call back functions you need to define give you
       hooks to execute custom code at various points during traversal:
  
         1. Once to initialize any local data needed while processing BB
--- 13575,13617 ----
              pop_stmt_changes (&stmt);
           }
  
!  The call to 'push_stmt_changes' saves the current state of the
! statement operands and the call to 'pop_stmt_changes' compares the saved
! state with the current one and does the appropriate symbol marking for
! the SSA renamer.
  
   It is possible to modify several statements at a time, provided that
! 'push_stmt_changes' and 'pop_stmt_changes' are called in LIFO order, as
  when processing a stack of statements.
  
   Additionally, if the pass discovers that it did not need to make
! changes to the statement after calling 'push_stmt_changes', it can
  simply discard the topmost change buffer by calling
! 'discard_stmt_changes'.  This will avoid the expensive operand re-scan
  operation and the buffer comparison that determines if symbols need to
  be marked for renaming.
  
! 12.3.3 Examining 'SSA_NAME' nodes
  ---------------------------------
  
! The following macros can be used to examine 'SSA_NAME' nodes
  
   -- Macro: SSA_NAME_DEF_STMT (VAR)
!      Returns the statement S that creates the 'SSA_NAME' VAR.  If S is
!      an empty statement (i.e., 'IS_EMPTY_STMT (S)' returns 'true'), it
       means that the first reference to this variable is a USE or a VUSE.
  
   -- Macro: SSA_NAME_VERSION (VAR)
!      Returns the version number of the 'SSA_NAME' object VAR.
  
  12.3.4 Walking the dominator tree
  ---------------------------------
  
   -- Tree SSA function: void walk_dominator_tree (WALK_DATA, BB)
+ 
       This function walks the dominator tree for the current CFG calling
       a set of callback functions defined in STRUCT DOM_WALK_DATA in
!      'domwalk.h'.  The call back functions you need to define give you
       hooks to execute custom code at various points during traversal:
  
         1. Once to initialize any local data needed while processing BB
*************** disambiguate explicit and implicit memor
*** 13789,13797 ****
  
    1. Memory SSA form.
  
!      All statements that may use memory have exactly one accompanied
!      use of a virtual SSA name that represents the state of memory at
!      the given point in the IL.
  
       All statements that may define memory have exactly one accompanied
       definition of a virtual SSA name using the previous state of memory
--- 13650,13658 ----
  
    1. Memory SSA form.
  
!      All statements that may use memory have exactly one accompanied use
!      of a virtual SSA name that represents the state of memory at the
!      given point in the IL.
  
       All statements that may define memory have exactly one accompanied
       definition of a virtual SSA name using the previous state of memory
*************** disambiguate explicit and implicit memor
*** 13807,13815 ****
              return i;
            }
  
!      The virtual SSA names in this case are `.MEM_2(D)' and `.MEM_3'.
!      The store to the global variable `i' defines `.MEM_3' invalidating
!      `.MEM_2(D)'.  The load from `i' uses that new state `.MEM_3'.
  
       The virtual SSA web serves as constraints to SSA optimizers
       preventing illegitimate code-motion and optimization.  It also
--- 13668,13676 ----
              return i;
            }
  
!      The virtual SSA names in this case are '.MEM_2(D)' and '.MEM_3'.
!      The store to the global variable 'i' defines '.MEM_3' invalidating
!      '.MEM_2(D)'.  The load from 'i' uses that new state '.MEM_3'.
  
       The virtual SSA web serves as constraints to SSA optimizers
       preventing illegitimate code-motion and optimization.  It also
*************** disambiguate explicit and implicit memor
*** 13825,13853 ****
       what it may possibly point to.
  
       This points-to solution for a given SSA name pointer is stored in
!      the `pt_solution' sub-structure of the `SSA_NAME_PTR_INFO' record.
       The following accessor functions are available:
  
!         * `pt_solution_includes'
! 
!         * `pt_solutions_intersect'
  
       Points-to analysis also computes the solution for two special set
!      of pointers, `ESCAPED' and `CALLUSED'.  Those represent all memory
       that has escaped the scope of analysis or that is used by pure or
       nested const calls.
  
    3. Type-based alias analysis
  
       Type-based alias analysis is frontend dependent though generic
!      support is provided by the middle-end in `alias.c'.  TBAA code is
       used by both tree optimizers and RTL optimizers.
  
       Every language that wishes to perform language-specific alias
!      analysis should define a function that computes, given a `tree'
!      node, an alias set for the node.  Nodes in different alias sets
!      are not allowed to alias.  For an example, see the C front-end
!      function `c_get_alias_set'.
  
    4. Tree alias-oracle
  
--- 13686,13713 ----
       what it may possibly point to.
  
       This points-to solution for a given SSA name pointer is stored in
!      the 'pt_solution' sub-structure of the 'SSA_NAME_PTR_INFO' record.
       The following accessor functions are available:
  
!         * 'pt_solution_includes'
!         * 'pt_solutions_intersect'
  
       Points-to analysis also computes the solution for two special set
!      of pointers, 'ESCAPED' and 'CALLUSED'.  Those represent all memory
       that has escaped the scope of analysis or that is used by pure or
       nested const calls.
  
    3. Type-based alias analysis
  
       Type-based alias analysis is frontend dependent though generic
!      support is provided by the middle-end in 'alias.c'.  TBAA code is
       used by both tree optimizers and RTL optimizers.
  
       Every language that wishes to perform language-specific alias
!      analysis should define a function that computes, given a 'tree'
!      node, an alias set for the node.  Nodes in different alias sets are
!      not allowed to alias.  For an example, see the C front-end function
!      'c_get_alias_set'.
  
    4. Tree alias-oracle
  
*************** disambiguate explicit and implicit memor
*** 13855,13877 ****
       references and memory references against statements.  The following
       queries are available:
  
!         * `refs_may_alias_p'
! 
!         * `ref_maybe_used_by_stmt_p'
! 
!         * `stmt_may_clobber_ref_p'
  
       In addition to those two kind of statement walkers are available
       walking statements related to a reference ref.
!      `walk_non_aliased_vuses' walks over dominating memory defining
       statements and calls back if the statement does not clobber ref
!      providing the non-aliased VUSE.  The walk stops at the first
!      clobbering statement or if asked to.  `walk_aliased_vdefs' walks
       over dominating memory defining statements and calls back on each
!      statement clobbering ref providing its aliasing VDEF.  The walk
       stops if asked to.
  
- 
  
  File: gccint.info,  Node: Memory model,  Prev: Alias analysis,  Up: Tree SSA
  
--- 13715,13734 ----
       references and memory references against statements.  The following
       queries are available:
  
!         * 'refs_may_alias_p'
!         * 'ref_maybe_used_by_stmt_p'
!         * 'stmt_may_clobber_ref_p'
  
       In addition to those two kind of statement walkers are available
       walking statements related to a reference ref.
!      'walk_non_aliased_vuses' walks over dominating memory defining
       statements and calls back if the statement does not clobber ref
!      providing the non-aliased VUSE. The walk stops at the first
!      clobbering statement or if asked to.  'walk_aliased_vdefs' walks
       over dominating memory defining statements and calls back on each
!      statement clobbering ref providing its aliasing VDEF. The walk
       stops if asked to.
  
  
  File: gccint.info,  Node: Memory model,  Prev: Alias analysis,  Up: Tree SSA
  
*************** effective type to objects with a declare
*** 13892,13898 ****
       an lvalue having a type that is not a character type, then the
       type of the lvalue becomes the effective type of the object for that
       access and for subsequent accesses that do not modify the stored value.
!      If a value is copied into an object using `memcpy' or `memmove',
       or is copied as an array of character type, then the effective type
       of the modified object for that access and for subsequent accesses that
       do not modify the value is undetermined.  For all other accesses to an
--- 13749,13755 ----
       an lvalue having a type that is not a character type, then the
       type of the lvalue becomes the effective type of the object for that
       access and for subsequent accesses that do not modify the stored value.
!      If a value is copied into an object using memcpy or memmove,
       or is copied as an array of character type, then the effective type
       of the modified object for that access and for subsequent accesses that
       do not modify the value is undetermined.  For all other accesses to an
*************** instructions to be output are described,
*** 13911,13918 ****
  algebraic form that describes what the instruction does.
  
   RTL is inspired by Lisp lists.  It has both an internal form, made up
! of structures that point at other structures, and a textual form that
! is used in the machine description and in printed debugging dumps.  The
  textual form uses nested parentheses to indicate the pointers in the
  internal form.
  
--- 13768,13775 ----
  algebraic form that describes what the instruction does.
  
   RTL is inspired by Lisp lists.  It has both an internal form, made up
! of structures that point at other structures, and a textual form that is
! used in the machine description and in printed debugging dumps.  The
  textual form uses nested parentheses to indicate the pointers in the
  internal form.
  
*************** internal form.
*** 13934,13940 ****
  * RTL Declarations::  Declaring volatility, constancy, etc.
  * Side Effects::      Expressions for storing in registers, etc.
  * Incdec::            Embedded side-effects for autoincrement addressing.
! * Assembler::         Representing `asm' with operands.
  * Debug Information:: Expressions representing debugging information.
  * Insns::             Expression types for entire insns.
  * Calls::             RTL representation of function call insns.
--- 13791,13797 ----
  * RTL Declarations::  Declaring volatility, constancy, etc.
  * Side Effects::      Expressions for storing in registers, etc.
  * Incdec::            Embedded side-effects for autoincrement addressing.
! * Assembler::         Representing 'asm' with operands.
  * Debug Information:: Expressions representing debugging information.
  * Insns::             Expression types for entire insns.
  * Calls::             RTL representation of function call insns.
*************** File: gccint.info,  Node: RTL Objects,
*** 13950,13969 ****
  RTL uses five kinds of objects: expressions, integers, wide integers,
  strings and vectors.  Expressions are the most important ones.  An RTL
  expression ("RTX", for short) is a C structure, but it is usually
! referred to with a pointer; a type that is given the typedef name `rtx'.
  
!  An integer is simply an `int'; their written form uses decimal digits.
! A wide integer is an integral object whose type is `HOST_WIDE_INT';
  their written form uses decimal digits.
  
   A string is a sequence of characters.  In core it is represented as a
! `char *' in usual C fashion, and it is written in C syntax as well.
! However, strings in RTL may never be null.  If you write an empty
! string in a machine description, it is represented in core as a null
! pointer rather than as a pointer to a null character.  In certain
! contexts, these null pointers instead of strings are valid.  Within RTL
! code, strings are most commonly found inside `symbol_ref' expressions,
! but they appear in other contexts in the RTL expressions that make up
  machine descriptions.
  
   In a machine description, strings are normally written with double
--- 13807,13826 ----
  RTL uses five kinds of objects: expressions, integers, wide integers,
  strings and vectors.  Expressions are the most important ones.  An RTL
  expression ("RTX", for short) is a C structure, but it is usually
! referred to with a pointer; a type that is given the typedef name 'rtx'.
  
!  An integer is simply an 'int'; their written form uses decimal digits.
! A wide integer is an integral object whose type is 'HOST_WIDE_INT';
  their written form uses decimal digits.
  
   A string is a sequence of characters.  In core it is represented as a
! 'char *' in usual C fashion, and it is written in C syntax as well.
! However, strings in RTL may never be null.  If you write an empty string
! in a machine description, it is represented in core as a null pointer
! rather than as a pointer to a null character.  In certain contexts,
! these null pointers instead of strings are valid.  Within RTL code,
! strings are most commonly found inside 'symbol_ref' expressions, but
! they appear in other contexts in the RTL expressions that make up
  machine descriptions.
  
   In a machine description, strings are normally written with double
*************** need not escape each quote character wit
*** 13983,14021 ****
  
   A vector contains an arbitrary number of pointers to expressions.  The
  number of elements in the vector is explicitly present in the vector.
! The written form of a vector consists of square brackets (`[...]')
  surrounding the elements, in sequence and with whitespace separating
  them.  Vectors of length zero are not created; null pointers are used
  instead.
  
   Expressions are classified by "expression codes" (also called RTX
! codes).  The expression code is a name defined in `rtl.def', which is
  also (in uppercase) a C enumeration constant.  The possible expression
  codes and their meanings are machine-independent.  The code of an RTX
! can be extracted with the macro `GET_CODE (X)' and altered with
! `PUT_CODE (X, NEWCODE)'.
  
   The expression code determines how many operands the expression
  contains, and what kinds of objects they are.  In RTL, unlike Lisp, you
  cannot tell by looking at an operand what kind of object it is.
! Instead, you must know from its context--from the expression code of
! the containing expression.  For example, in an expression of code
! `subreg', the first operand is to be regarded as an expression and the
! second operand as an integer.  In an expression of code `plus', there
! are two operands, both of which are to be regarded as expressions.  In
! a `symbol_ref' expression, there is one operand, which is to be
! regarded as a string.
  
   Expressions are written as parentheses containing the name of the
  expression type, its flags and machine mode if any, and then the
  operands of the expression (separated by spaces).
  
!  Expression code names in the `md' file are written in lowercase, but
  when they appear in C code they are written in uppercase.  In this
! manual, they are shown as follows: `const_int'.
  
   In a few contexts a null pointer is valid where an expression is
! normally wanted.  The written form of this is `(nil)'.
  
  
  File: gccint.info,  Node: RTL Classes,  Next: Accessors,  Prev: RTL Objects,  Up: RTL
--- 13840,13878 ----
  
   A vector contains an arbitrary number of pointers to expressions.  The
  number of elements in the vector is explicitly present in the vector.
! The written form of a vector consists of square brackets ('[...]')
  surrounding the elements, in sequence and with whitespace separating
  them.  Vectors of length zero are not created; null pointers are used
  instead.
  
   Expressions are classified by "expression codes" (also called RTX
! codes).  The expression code is a name defined in 'rtl.def', which is
  also (in uppercase) a C enumeration constant.  The possible expression
  codes and their meanings are machine-independent.  The code of an RTX
! can be extracted with the macro 'GET_CODE (X)' and altered with
! 'PUT_CODE (X, NEWCODE)'.
  
   The expression code determines how many operands the expression
  contains, and what kinds of objects they are.  In RTL, unlike Lisp, you
  cannot tell by looking at an operand what kind of object it is.
! Instead, you must know from its context--from the expression code of the
! containing expression.  For example, in an expression of code 'subreg',
! the first operand is to be regarded as an expression and the second
! operand as an integer.  In an expression of code 'plus', there are two
! operands, both of which are to be regarded as expressions.  In a
! 'symbol_ref' expression, there is one operand, which is to be regarded
! as a string.
  
   Expressions are written as parentheses containing the name of the
  expression type, its flags and machine mode if any, and then the
  operands of the expression (separated by spaces).
  
!  Expression code names in the 'md' file are written in lowercase, but
  when they appear in C code they are written in uppercase.  In this
! manual, they are shown as follows: 'const_int'.
  
   In a few contexts a null pointer is valid where an expression is
! normally wanted.  The written form of this is '(nil)'.
  
  
  File: gccint.info,  Node: RTL Classes,  Next: Accessors,  Prev: RTL Objects,  Up: RTL
*************** File: gccint.info,  Node: RTL Classes,
*** 14024,14179 ****
  ============================
  
  The various expression codes are divided into several "classes", which
! are represented by single characters.  You can determine the class of
! an RTX code with the macro `GET_RTX_CLASS (CODE)'.  Currently,
! `rtl.def' defines these classes:
  
! `RTX_OBJ'
       An RTX code that represents an actual object, such as a register
!      (`REG') or a memory location (`MEM', `SYMBOL_REF').  `LO_SUM') is
!      also included; instead, `SUBREG' and `STRICT_LOW_PART' are not in
!      this class, but in class `x'.
  
! `RTX_CONST_OBJ'
!      An RTX code that represents a constant object.  `HIGH' is also
       included in this class.
  
! `RTX_COMPARE'
!      An RTX code for a non-symmetric comparison, such as `GEU' or `LT'.
  
! `RTX_COMM_COMPARE'
!      An RTX code for a symmetric (commutative) comparison, such as `EQ'
!      or `ORDERED'.
  
! `RTX_UNARY'
!      An RTX code for a unary arithmetic operation, such as `NEG',
!      `NOT', or `ABS'.  This category also includes value extension
!      (sign or zero) and conversions between integer and floating point.
  
! `RTX_COMM_ARITH'
!      An RTX code for a commutative binary operation, such as `PLUS' or
!      `AND'.  `NE' and `EQ' are comparisons, so they have class `<'.
  
! `RTX_BIN_ARITH'
       An RTX code for a non-commutative binary operation, such as
!      `MINUS', `DIV', or `ASHIFTRT'.
  
! `RTX_BITFIELD_OPS'
       An RTX code for a bit-field operation.  Currently only
!      `ZERO_EXTRACT' and `SIGN_EXTRACT'.  These have three inputs and
!      are lvalues (so they can be used for insertion as well).  *Note
       Bit-Fields::.
  
! `RTX_TERNARY'
       An RTX code for other three input operations.  Currently only
!      `IF_THEN_ELSE',  `VEC_MERGE', `SIGN_EXTRACT', `ZERO_EXTRACT', and
!      `FMA'.
  
! `RTX_INSN'
!      An RTX code for an entire instruction:  `INSN', `JUMP_INSN', and
!      `CALL_INSN'.  *Note Insns::.
  
! `RTX_MATCH'
       An RTX code for something that matches in insns, such as
!      `MATCH_DUP'.  These only occur in machine descriptions.
  
! `RTX_AUTOINC'
       An RTX code for an auto-increment addressing mode, such as
!      `POST_INC'.  `XEXP (X, 0)' gives the auto-modified register.
  
! `RTX_EXTRA'
       All other RTX codes.  This category includes the remaining codes
!      used only in machine descriptions (`DEFINE_*', etc.).  It also
!      includes all the codes describing side effects (`SET', `USE',
!      `CLOBBER', etc.) and the non-insns that may appear on an insn
!      chain, such as `NOTE', `BARRIER', and `CODE_LABEL'.  `SUBREG' is
       also part of this class.
  
!  For each expression code, `rtl.def' specifies the number of contained
  objects and their kinds using a sequence of characters called the
! "format" of the expression code.  For example, the format of `subreg'
! is `ei'.
  
   These are the most commonly used format characters:
  
! `e'
       An expression (actually a pointer to an expression).
  
! `i'
       An integer.
  
! `w'
       A wide integer.
  
! `s'
       A string.
  
! `E'
       A vector of expressions.
  
   A few other format characters are used occasionally:
  
! `u'
!      `u' is equivalent to `e' except that it is printed differently in
       debugging dumps.  It is used for pointers to insns.
  
! `n'
!      `n' is equivalent to `i' except that it is printed differently in
       debugging dumps.  It is used for the line number or code number of
!      a `note' insn.
  
! `S'
!      `S' indicates a string which is optional.  In the RTL objects in
!      core, `S' is equivalent to `s', but when the object is read, from
!      an `md' file, the string value of this operand may be omitted.  An
       omitted string is taken to be the null string.
  
! `V'
!      `V' indicates a vector which is optional.  In the RTL objects in
!      core, `V' is equivalent to `E', but when the object is read from
!      an `md' file, the vector value of this operand may be omitted.  An
       omitted vector is effectively the same as a vector of no elements.
  
! `B'
!      `B' indicates a pointer to basic block structure.
  
! `0'
!      `0' means a slot whose contents do not fit any normal category.
!      `0' slots are not printed at all in dumps, and are often used in
       special ways by small parts of the compiler.
  
   There are macros to get the number of operands and the format of an
  expression code:
  
! `GET_RTX_LENGTH (CODE)'
       Number of operands of an RTX of code CODE.
  
! `GET_RTX_FORMAT (CODE)'
       The format of an RTX of code CODE, as a C string.
  
   Some classes of RTX codes always have the same format.  For example, it
! is safe to assume that all comparison operations have format `ee'.
  
! `1'
!      All codes of this class have format `e'.
  
! `<'
! `c'
! `2'
!      All codes of these classes have format `ee'.
  
! `b'
! `3'
!      All codes of these classes have format `eee'.
  
! `i'
!      All codes of this class have formats that begin with `iuueiee'.
       *Note Insns::.  Note that not all RTL objects linked onto an insn
!      chain are of class `i'.
  
! `o'
! `m'
! `x'
       You can make no assumptions about the format of these codes.
  
  
--- 13881,14036 ----
  ============================
  
  The various expression codes are divided into several "classes", which
! are represented by single characters.  You can determine the class of an
! RTX code with the macro 'GET_RTX_CLASS (CODE)'.  Currently, 'rtl.def'
! defines these classes:
  
! 'RTX_OBJ'
       An RTX code that represents an actual object, such as a register
!      ('REG') or a memory location ('MEM', 'SYMBOL_REF').  'LO_SUM') is
!      also included; instead, 'SUBREG' and 'STRICT_LOW_PART' are not in
!      this class, but in class 'x'.
  
! 'RTX_CONST_OBJ'
!      An RTX code that represents a constant object.  'HIGH' is also
       included in this class.
  
! 'RTX_COMPARE'
!      An RTX code for a non-symmetric comparison, such as 'GEU' or 'LT'.
  
! 'RTX_COMM_COMPARE'
!      An RTX code for a symmetric (commutative) comparison, such as 'EQ'
!      or 'ORDERED'.
  
! 'RTX_UNARY'
!      An RTX code for a unary arithmetic operation, such as 'NEG', 'NOT',
!      or 'ABS'.  This category also includes value extension (sign or
!      zero) and conversions between integer and floating point.
  
! 'RTX_COMM_ARITH'
!      An RTX code for a commutative binary operation, such as 'PLUS' or
!      'AND'.  'NE' and 'EQ' are comparisons, so they have class '<'.
  
! 'RTX_BIN_ARITH'
       An RTX code for a non-commutative binary operation, such as
!      'MINUS', 'DIV', or 'ASHIFTRT'.
  
! 'RTX_BITFIELD_OPS'
       An RTX code for a bit-field operation.  Currently only
!      'ZERO_EXTRACT' and 'SIGN_EXTRACT'.  These have three inputs and are
!      lvalues (so they can be used for insertion as well).  *Note
       Bit-Fields::.
  
! 'RTX_TERNARY'
       An RTX code for other three input operations.  Currently only
!      'IF_THEN_ELSE', 'VEC_MERGE', 'SIGN_EXTRACT', 'ZERO_EXTRACT', and
!      'FMA'.
  
! 'RTX_INSN'
!      An RTX code for an entire instruction: 'INSN', 'JUMP_INSN', and
!      'CALL_INSN'.  *Note Insns::.
  
! 'RTX_MATCH'
       An RTX code for something that matches in insns, such as
!      'MATCH_DUP'.  These only occur in machine descriptions.
  
! 'RTX_AUTOINC'
       An RTX code for an auto-increment addressing mode, such as
!      'POST_INC'.  'XEXP (X, 0)' gives the auto-modified register.
  
! 'RTX_EXTRA'
       All other RTX codes.  This category includes the remaining codes
!      used only in machine descriptions ('DEFINE_*', etc.).  It also
!      includes all the codes describing side effects ('SET', 'USE',
!      'CLOBBER', etc.)  and the non-insns that may appear on an insn
!      chain, such as 'NOTE', 'BARRIER', and 'CODE_LABEL'.  'SUBREG' is
       also part of this class.
  
!  For each expression code, 'rtl.def' specifies the number of contained
  objects and their kinds using a sequence of characters called the
! "format" of the expression code.  For example, the format of 'subreg' is
! 'ei'.
  
   These are the most commonly used format characters:
  
! 'e'
       An expression (actually a pointer to an expression).
  
! 'i'
       An integer.
  
! 'w'
       A wide integer.
  
! 's'
       A string.
  
! 'E'
       A vector of expressions.
  
   A few other format characters are used occasionally:
  
! 'u'
!      'u' is equivalent to 'e' except that it is printed differently in
       debugging dumps.  It is used for pointers to insns.
  
! 'n'
!      'n' is equivalent to 'i' except that it is printed differently in
       debugging dumps.  It is used for the line number or code number of
!      a 'note' insn.
  
! 'S'
!      'S' indicates a string which is optional.  In the RTL objects in
!      core, 'S' is equivalent to 's', but when the object is read, from
!      an 'md' file, the string value of this operand may be omitted.  An
       omitted string is taken to be the null string.
  
! 'V'
!      'V' indicates a vector which is optional.  In the RTL objects in
!      core, 'V' is equivalent to 'E', but when the object is read from an
!      'md' file, the vector value of this operand may be omitted.  An
       omitted vector is effectively the same as a vector of no elements.
  
! 'B'
!      'B' indicates a pointer to basic block structure.
  
! '0'
!      '0' means a slot whose contents do not fit any normal category.
!      '0' slots are not printed at all in dumps, and are often used in
       special ways by small parts of the compiler.
  
   There are macros to get the number of operands and the format of an
  expression code:
  
! 'GET_RTX_LENGTH (CODE)'
       Number of operands of an RTX of code CODE.
  
! 'GET_RTX_FORMAT (CODE)'
       The format of an RTX of code CODE, as a C string.
  
   Some classes of RTX codes always have the same format.  For example, it
! is safe to assume that all comparison operations have format 'ee'.
  
! '1'
!      All codes of this class have format 'e'.
  
! '<'
! 'c'
! '2'
!      All codes of these classes have format 'ee'.
  
! 'b'
! '3'
!      All codes of these classes have format 'eee'.
  
! 'i'
!      All codes of this class have formats that begin with 'iuueiee'.
       *Note Insns::.  Note that not all RTL objects linked onto an insn
!      chain are of class 'i'.
  
! 'o'
! 'm'
! 'x'
       You can make no assumptions about the format of these codes.
  
  
*************** File: gccint.info,  Node: Accessors,  Ne
*** 14182,14189 ****
  13.3 Access to Operands
  =======================
  
! Operands of expressions are accessed using the macros `XEXP', `XINT',
! `XWINT' and `XSTR'.  Each of these macros takes two arguments: an
  expression-pointer (RTX) and an operand number (counting from zero).
  Thus,
  
--- 14039,14046 ----
  13.3 Access to Operands
  =======================
  
! Operands of expressions are accessed using the macros 'XEXP', 'XINT',
! 'XWINT' and 'XSTR'.  Each of these macros takes two arguments: an
  expression-pointer (RTX) and an operand number (counting from zero).
  Thus,
  
*************** accesses operand 2 of expression X, as a
*** 14193,14199 ****
  
       XINT (X, 2)
  
! accesses the same operand as an integer.  `XSTR', used in the same
  fashion, would access it as a string.
  
   Any operand can be accessed as an integer, as an expression or as a
--- 14050,14056 ----
  
       XINT (X, 2)
  
! accesses the same operand as an integer.  'XSTR', used in the same
  fashion, would access it as a string.
  
   Any operand can be accessed as an integer, as an expression or as a
*************** value actually stored in the operand.  Y
*** 14202,14235 ****
  expression code of the containing expression.  That is also how you
  would know how many operands there are.
  
!  For example, if X is a `subreg' expression, you know that it has two
! operands which can be correctly accessed as `XEXP (X, 0)' and `XINT (X,
! 1)'.  If you did `XINT (X, 0)', you would get the address of the
  expression operand but cast as an integer; that might occasionally be
! useful, but it would be cleaner to write `(int) XEXP (X, 0)'.  `XEXP
! (X, 1)' would also compile without error, and would return the second,
  integer operand cast as an expression pointer, which would probably
! result in a crash when accessed.  Nothing stops you from writing `XEXP
  (X, 28)' either, but this will access memory past the end of the
  expression with unpredictable results.
  
   Access to operands which are vectors is more complicated.  You can use
! the macro `XVEC' to get the vector-pointer itself, or the macros
! `XVECEXP' and `XVECLEN' to access the elements and length of a vector.
  
! `XVEC (EXP, IDX)'
       Access the vector-pointer which is operand number IDX in EXP.
  
! `XVECLEN (EXP, IDX)'
       Access the length (number of elements) in the vector which is in
!      operand number IDX in EXP.  This value is an `int'.
  
! `XVECEXP (EXP, IDX, ELTNUM)'
       Access element number ELTNUM in the vector which is in operand
       number IDX in EXP.  This value is an RTX.
  
       It is up to you to make sure that ELTNUM is not negative and is
!      less than `XVECLEN (EXP, IDX)'.
  
   All the macros defined in this section expand into lvalues and
  therefore can be used to assign the operands, lengths and vector
--- 14059,14092 ----
  expression code of the containing expression.  That is also how you
  would know how many operands there are.
  
!  For example, if X is a 'subreg' expression, you know that it has two
! operands which can be correctly accessed as 'XEXP (X, 0)' and 'XINT (X,
! 1)'.  If you did 'XINT (X, 0)', you would get the address of the
  expression operand but cast as an integer; that might occasionally be
! useful, but it would be cleaner to write '(int) XEXP (X, 0)'.  'XEXP (X,
! 1)' would also compile without error, and would return the second,
  integer operand cast as an expression pointer, which would probably
! result in a crash when accessed.  Nothing stops you from writing 'XEXP
  (X, 28)' either, but this will access memory past the end of the
  expression with unpredictable results.
  
   Access to operands which are vectors is more complicated.  You can use
! the macro 'XVEC' to get the vector-pointer itself, or the macros
! 'XVECEXP' and 'XVECLEN' to access the elements and length of a vector.
  
! 'XVEC (EXP, IDX)'
       Access the vector-pointer which is operand number IDX in EXP.
  
! 'XVECLEN (EXP, IDX)'
       Access the length (number of elements) in the vector which is in
!      operand number IDX in EXP.  This value is an 'int'.
  
! 'XVECEXP (EXP, IDX, ELTNUM)'
       Access element number ELTNUM in the vector which is in operand
       number IDX in EXP.  This value is an RTX.
  
       It is up to you to make sure that ELTNUM is not negative and is
!      less than 'XVECLEN (EXP, IDX)'.
  
   All the macros defined in this section expand into lvalues and
  therefore can be used to assign the operands, lengths and vector
*************** File: gccint.info,  Node: Special Access
*** 14243,14383 ****
  
  Some RTL nodes have special annotations associated with them.
  
! `MEM'
! 
!     `MEM_ALIAS_SET (X)'
            If 0, X is not in any alias set, and may alias anything.
!           Otherwise, X can only alias `MEM's in a conflicting alias
!           set.  This value is set in a language-dependent manner in the
!           front-end, and should not be altered in the back-end.  In
!           some front-ends, these numbers may correspond in some way to
!           types, or other language-level entities, but they need not,
!           and the back-end makes no such assumptions.  These set
!           numbers are tested with `alias_sets_conflict_p'.
  
!     `MEM_EXPR (X)'
            If this register is known to hold the value of some user-level
            declaration, this is that tree node.  It may also be a
!           `COMPONENT_REF', in which case this is some field reference,
!           and `TREE_OPERAND (X, 0)' contains the declaration, or
!           another `COMPONENT_REF', or null if there is no compile-time
!           object associated with the reference.
  
!     `MEM_OFFSET_KNOWN_P (X)'
!           True if the offset of the memory reference from `MEM_EXPR' is
!           known.  `MEM_OFFSET (X)' provides the offset if so.
  
!     `MEM_OFFSET (X)'
!           The offset from the start of `MEM_EXPR'.  The value is only
!           valid if `MEM_OFFSET_KNOWN_P (X)' is true.
  
!     `MEM_SIZE_KNOWN_P (X)'
!           True if the size of the memory reference is known.  `MEM_SIZE
            (X)' provides its size if so.
  
!     `MEM_SIZE (X)'
            The size in bytes of the memory reference.  This is mostly
!           relevant for `BLKmode' references as otherwise the size is
            implied by the mode.  The value is only valid if
!           `MEM_SIZE_KNOWN_P (X)' is true.
  
!     `MEM_ALIGN (X)'
            The known alignment in bits of the memory reference.
  
!     `MEM_ADDR_SPACE (X)'
!           The address space of the memory reference.  This will
!           commonly be zero for the generic address space.
! 
! `REG'
  
!     `ORIGINAL_REGNO (X)'
!           This field holds the number the register "originally" had;
!           for a pseudo register turned into a hard reg this will hold
!           the old pseudo register number.
  
!     `REG_EXPR (X)'
            If this register is known to hold the value of some user-level
            declaration, this is that tree node.
  
!     `REG_OFFSET (X)'
            If this register is known to hold the value of some user-level
            declaration, this is the offset into that logical storage.
  
! `SYMBOL_REF'
! 
!     `SYMBOL_REF_DECL (X)'
!           If the `symbol_ref' X was created for a `VAR_DECL' or a
!           `FUNCTION_DECL', that tree is recorded here.  If this value is
            null, then X was created by back end code generation routines,
            and there is no associated front end symbol table entry.
  
!           `SYMBOL_REF_DECL' may also point to a tree of class `'c'',
            that is, some sort of constant.  In this case, the
!           `symbol_ref' is an entry in the per-file constant pool;
!           again, there is no associated front end symbol table entry.
  
!     `SYMBOL_REF_CONSTANT (X)'
!           If `CONSTANT_POOL_ADDRESS_P (X)' is true, this is the constant
            pool entry for X.  It is null otherwise.
  
!     `SYMBOL_REF_DATA (X)'
!           A field of opaque type used to store `SYMBOL_REF_DECL' or
!           `SYMBOL_REF_CONSTANT'.
  
!     `SYMBOL_REF_FLAGS (X)'
!           In a `symbol_ref', this is used to communicate various
            predicates about the symbol.  Some of these are common enough
            to be computed by common code, some are specific to the
            target.  The common bits are:
  
!          `SYMBOL_FLAG_FUNCTION'
                 Set if the symbol refers to a function.
  
!          `SYMBOL_FLAG_LOCAL'
                 Set if the symbol is local to this "module".  See
!                `TARGET_BINDS_LOCAL_P'.
  
!          `SYMBOL_FLAG_EXTERNAL'
                 Set if this symbol is not defined in this translation
                 unit.  Note that this is not the inverse of
!                `SYMBOL_FLAG_LOCAL'.
  
!          `SYMBOL_FLAG_SMALL'
                 Set if the symbol is located in the small data section.
!                See `TARGET_IN_SMALL_DATA_P'.
  
!          `SYMBOL_REF_TLS_MODEL (X)'
                 This is a multi-bit field accessor that returns the
!                `tls_model' to be used for a thread-local storage
!                symbol.  It returns zero for non-thread-local symbols.
  
!          `SYMBOL_FLAG_HAS_BLOCK_INFO'
!                Set if the symbol has `SYMBOL_REF_BLOCK' and
!                `SYMBOL_REF_BLOCK_OFFSET' fields.
  
!          `SYMBOL_FLAG_ANCHOR'
                 Set if the symbol is used as a section anchor.  "Section
!                anchors" are symbols that have a known position within
!                an `object_block' and that can be used to access nearby
                 members of that block.  They are used to implement
!                `-fsection-anchors'.
  
!                If this flag is set, then `SYMBOL_FLAG_HAS_BLOCK_INFO'
                 will be too.
  
!           Bits beginning with `SYMBOL_FLAG_MACH_DEP' are available for
            the target's use.
  
! `SYMBOL_REF_BLOCK (X)'
!      If `SYMBOL_REF_HAS_BLOCK_INFO_P (X)', this is the `object_block'
!      structure to which the symbol belongs, or `NULL' if it has not
!      been assigned a block.
  
! `SYMBOL_REF_BLOCK_OFFSET (X)'
!      If `SYMBOL_REF_HAS_BLOCK_INFO_P (X)', this is the offset of X from
!      the first object in `SYMBOL_REF_BLOCK (X)'.  The value is negative
!      if X has not yet been assigned to a block, or it has not been
!      given an offset within that block.
  
  
  File: gccint.info,  Node: Flags,  Next: Machine Modes,  Prev: Special Accessors,  Up: RTL
--- 14100,14237 ----
  
  Some RTL nodes have special annotations associated with them.
  
! 'MEM'
!      'MEM_ALIAS_SET (X)'
            If 0, X is not in any alias set, and may alias anything.
!           Otherwise, X can only alias 'MEM's in a conflicting alias set.
!           This value is set in a language-dependent manner in the
!           front-end, and should not be altered in the back-end.  In some
!           front-ends, these numbers may correspond in some way to types,
!           or other language-level entities, but they need not, and the
!           back-end makes no such assumptions.  These set numbers are
!           tested with 'alias_sets_conflict_p'.
  
!      'MEM_EXPR (X)'
            If this register is known to hold the value of some user-level
            declaration, this is that tree node.  It may also be a
!           'COMPONENT_REF', in which case this is some field reference,
!           and 'TREE_OPERAND (X, 0)' contains the declaration, or another
!           'COMPONENT_REF', or null if there is no compile-time object
!           associated with the reference.
  
!      'MEM_OFFSET_KNOWN_P (X)'
!           True if the offset of the memory reference from 'MEM_EXPR' is
!           known.  'MEM_OFFSET (X)' provides the offset if so.
  
!      'MEM_OFFSET (X)'
!           The offset from the start of 'MEM_EXPR'.  The value is only
!           valid if 'MEM_OFFSET_KNOWN_P (X)' is true.
  
!      'MEM_SIZE_KNOWN_P (X)'
!           True if the size of the memory reference is known.  'MEM_SIZE
            (X)' provides its size if so.
  
!      'MEM_SIZE (X)'
            The size in bytes of the memory reference.  This is mostly
!           relevant for 'BLKmode' references as otherwise the size is
            implied by the mode.  The value is only valid if
!           'MEM_SIZE_KNOWN_P (X)' is true.
  
!      'MEM_ALIGN (X)'
            The known alignment in bits of the memory reference.
  
!      'MEM_ADDR_SPACE (X)'
!           The address space of the memory reference.  This will commonly
!           be zero for the generic address space.
  
! 'REG'
!      'ORIGINAL_REGNO (X)'
!           This field holds the number the register "originally" had; for
!           a pseudo register turned into a hard reg this will hold the
!           old pseudo register number.
  
!      'REG_EXPR (X)'
            If this register is known to hold the value of some user-level
            declaration, this is that tree node.
  
!      'REG_OFFSET (X)'
            If this register is known to hold the value of some user-level
            declaration, this is the offset into that logical storage.
  
! 'SYMBOL_REF'
!      'SYMBOL_REF_DECL (X)'
!           If the 'symbol_ref' X was created for a 'VAR_DECL' or a
!           'FUNCTION_DECL', that tree is recorded here.  If this value is
            null, then X was created by back end code generation routines,
            and there is no associated front end symbol table entry.
  
!           'SYMBOL_REF_DECL' may also point to a tree of class ''c'',
            that is, some sort of constant.  In this case, the
!           'symbol_ref' is an entry in the per-file constant pool; again,
!           there is no associated front end symbol table entry.
  
!      'SYMBOL_REF_CONSTANT (X)'
!           If 'CONSTANT_POOL_ADDRESS_P (X)' is true, this is the constant
            pool entry for X.  It is null otherwise.
  
!      'SYMBOL_REF_DATA (X)'
!           A field of opaque type used to store 'SYMBOL_REF_DECL' or
!           'SYMBOL_REF_CONSTANT'.
  
!      'SYMBOL_REF_FLAGS (X)'
!           In a 'symbol_ref', this is used to communicate various
            predicates about the symbol.  Some of these are common enough
            to be computed by common code, some are specific to the
            target.  The common bits are:
  
!           'SYMBOL_FLAG_FUNCTION'
                 Set if the symbol refers to a function.
  
!           'SYMBOL_FLAG_LOCAL'
                 Set if the symbol is local to this "module".  See
!                'TARGET_BINDS_LOCAL_P'.
  
!           'SYMBOL_FLAG_EXTERNAL'
                 Set if this symbol is not defined in this translation
                 unit.  Note that this is not the inverse of
!                'SYMBOL_FLAG_LOCAL'.
  
!           'SYMBOL_FLAG_SMALL'
                 Set if the symbol is located in the small data section.
!                See 'TARGET_IN_SMALL_DATA_P'.
  
!           'SYMBOL_REF_TLS_MODEL (X)'
                 This is a multi-bit field accessor that returns the
!                'tls_model' to be used for a thread-local storage symbol.
!                It returns zero for non-thread-local symbols.
  
!           'SYMBOL_FLAG_HAS_BLOCK_INFO'
!                Set if the symbol has 'SYMBOL_REF_BLOCK' and
!                'SYMBOL_REF_BLOCK_OFFSET' fields.
  
!           'SYMBOL_FLAG_ANCHOR'
                 Set if the symbol is used as a section anchor.  "Section
!                anchors" are symbols that have a known position within an
!                'object_block' and that can be used to access nearby
                 members of that block.  They are used to implement
!                '-fsection-anchors'.
  
!                If this flag is set, then 'SYMBOL_FLAG_HAS_BLOCK_INFO'
                 will be too.
  
!           Bits beginning with 'SYMBOL_FLAG_MACH_DEP' are available for
            the target's use.
  
! 'SYMBOL_REF_BLOCK (X)'
!      If 'SYMBOL_REF_HAS_BLOCK_INFO_P (X)', this is the 'object_block'
!      structure to which the symbol belongs, or 'NULL' if it has not been
!      assigned a block.
  
! 'SYMBOL_REF_BLOCK_OFFSET (X)'
!      If 'SYMBOL_REF_HAS_BLOCK_INFO_P (X)', this is the offset of X from
!      the first object in 'SYMBOL_REF_BLOCK (X)'.  The value is negative
!      if X has not yet been assigned to a block, or it has not been given
!      an offset within that block.
  
  
  File: gccint.info,  Node: Flags,  Next: Machine Modes,  Prev: Special Accessors,  Up: RTL
*************** File: gccint.info,  Node: Flags,  Next:
*** 14385,14498 ****
  13.5 Flags in an RTL Expression
  ===============================
  
! RTL expressions contain several flags (one-bit bit-fields) that are
! used in certain types of expression.  Most often they are accessed with
! the following macros, which expand into lvalues.
  
! `CONSTANT_POOL_ADDRESS_P (X)'
!      Nonzero in a `symbol_ref' if it refers to part of the current
       function's constant pool.  For most targets these addresses are in
!      a `.rodata' section entirely separate from the function, but for
       some targets the addresses are close to the beginning of the
       function.  In either case GCC assumes these addresses can be
       addressed directly, perhaps with the help of base registers.
!      Stored in the `unchanging' field and printed as `/u'.
  
! `RTL_CONST_CALL_P (X)'
!      In a `call_insn' indicates that the insn represents a call to a
!      const function.  Stored in the `unchanging' field and printed as
!      `/u'.
  
! `RTL_PURE_CALL_P (X)'
!      In a `call_insn' indicates that the insn represents a call to a
!      pure function.  Stored in the `return_val' field and printed as
!      `/i'.
  
! `RTL_CONST_OR_PURE_CALL_P (X)'
!      In a `call_insn', true if `RTL_CONST_CALL_P' or `RTL_PURE_CALL_P'
       is true.
  
! `RTL_LOOPING_CONST_OR_PURE_CALL_P (X)'
!      In a `call_insn' indicates that the insn represents a possibly
       infinite looping call to a const or pure function.  Stored in the
!      `call' field and printed as `/c'.  Only true if one of
!      `RTL_CONST_CALL_P' or `RTL_PURE_CALL_P' is true.
  
! `INSN_ANNULLED_BRANCH_P (X)'
!      In a `jump_insn', `call_insn', or `insn' indicates that the branch
!      is an annulling one.  See the discussion under `sequence' below.
!      Stored in the `unchanging' field and printed as `/u'.
  
! `INSN_DELETED_P (X)'
!      In an `insn', `call_insn', `jump_insn', `code_label',
!      `jump_table_data', `barrier', or `note', nonzero if the insn has
!      been deleted.  Stored in the `volatil' field and printed as `/v'.
  
! `INSN_FROM_TARGET_P (X)'
!      In an `insn' or `jump_insn' or `call_insn' in a delay slot of a
       branch, indicates that the insn is from the target of the branch.
!      If the branch insn has `INSN_ANNULLED_BRANCH_P' set, this insn
!      will only be executed if the branch is taken.  For annulled
!      branches with `INSN_FROM_TARGET_P' clear, the insn will be
!      executed only if the branch is not taken.  When
!      `INSN_ANNULLED_BRANCH_P' is not set, this insn will always be
!      executed.  Stored in the `in_struct' field and printed as `/s'.
  
! `LABEL_PRESERVE_P (X)'
!      In a `code_label' or `note', indicates that the label is
!      referenced by code or data not visible to the RTL of a given
!      function.  Labels referenced by a non-local goto will have this
!      bit set.  Stored in the `in_struct' field and printed as `/s'.
  
! `LABEL_REF_NONLOCAL_P (X)'
!      In `label_ref' and `reg_label' expressions, nonzero if this is a
!      reference to a non-local label.  Stored in the `volatil' field and
!      printed as `/v'.
  
! `MEM_KEEP_ALIAS_SET_P (X)'
!      In `mem' expressions, 1 if we should keep the alias set for this
       mem unchanged when we access a component.  Set to 1, for example,
       when we are already in a non-addressable component of an aggregate.
!      Stored in the `jump' field and printed as `/j'.
  
! `MEM_VOLATILE_P (X)'
!      In `mem', `asm_operands', and `asm_input' expressions, nonzero for
!      volatile memory references.  Stored in the `volatil' field and
!      printed as `/v'.
  
! `MEM_NOTRAP_P (X)'
!      In `mem', nonzero for memory references that will not trap.
!      Stored in the `call' field and printed as `/c'.
  
! `MEM_POINTER (X)'
!      Nonzero in a `mem' if the memory reference holds a pointer.
!      Stored in the `frame_related' field and printed as `/f'.
  
! `REG_FUNCTION_VALUE_P (X)'
!      Nonzero in a `reg' if it is the place in which this function's
       value is going to be returned.  (This happens only in a hard
!      register.)  Stored in the `return_val' field and printed as `/i'.
  
! `REG_POINTER (X)'
!      Nonzero in a `reg' if the register holds a pointer.  Stored in the
!      `frame_related' field and printed as `/f'.
  
! `REG_USERVAR_P (X)'
!      In a `reg', nonzero if it corresponds to a variable present in the
       user's source code.  Zero for temporaries generated internally by
!      the compiler.  Stored in the `volatil' field and printed as `/v'.
  
       The same hard register may be used also for collecting the values
!      of functions called by this one, but `REG_FUNCTION_VALUE_P' is zero
       in this kind of use.
  
! `RTX_FRAME_RELATED_P (X)'
!      Nonzero in an `insn', `call_insn', `jump_insn', `barrier', or
!      `set' which is part of a function prologue and sets the stack
!      pointer, sets the frame pointer, or saves a register.  This flag
!      should also be set on an instruction that sets up a temporary
!      register to use in place of the frame pointer.  Stored in the
!      `frame_related' field and printed as `/f'.
  
       In particular, on RISC targets where there are limits on the sizes
       of immediate constants, it is sometimes impossible to reach the
--- 14239,14352 ----
  13.5 Flags in an RTL Expression
  ===============================
  
! RTL expressions contain several flags (one-bit bit-fields) that are used
! in certain types of expression.  Most often they are accessed with the
! following macros, which expand into lvalues.
  
! 'CONSTANT_POOL_ADDRESS_P (X)'
!      Nonzero in a 'symbol_ref' if it refers to part of the current
       function's constant pool.  For most targets these addresses are in
!      a '.rodata' section entirely separate from the function, but for
       some targets the addresses are close to the beginning of the
       function.  In either case GCC assumes these addresses can be
       addressed directly, perhaps with the help of base registers.
!      Stored in the 'unchanging' field and printed as '/u'.
  
! 'RTL_CONST_CALL_P (X)'
!      In a 'call_insn' indicates that the insn represents a call to a
!      const function.  Stored in the 'unchanging' field and printed as
!      '/u'.
  
! 'RTL_PURE_CALL_P (X)'
!      In a 'call_insn' indicates that the insn represents a call to a
!      pure function.  Stored in the 'return_val' field and printed as
!      '/i'.
  
! 'RTL_CONST_OR_PURE_CALL_P (X)'
!      In a 'call_insn', true if 'RTL_CONST_CALL_P' or 'RTL_PURE_CALL_P'
       is true.
  
! 'RTL_LOOPING_CONST_OR_PURE_CALL_P (X)'
!      In a 'call_insn' indicates that the insn represents a possibly
       infinite looping call to a const or pure function.  Stored in the
!      'call' field and printed as '/c'.  Only true if one of
!      'RTL_CONST_CALL_P' or 'RTL_PURE_CALL_P' is true.
  
! 'INSN_ANNULLED_BRANCH_P (X)'
!      In a 'jump_insn', 'call_insn', or 'insn' indicates that the branch
!      is an annulling one.  See the discussion under 'sequence' below.
!      Stored in the 'unchanging' field and printed as '/u'.
  
! 'INSN_DELETED_P (X)'
!      In an 'insn', 'call_insn', 'jump_insn', 'code_label',
!      'jump_table_data', 'barrier', or 'note', nonzero if the insn has
!      been deleted.  Stored in the 'volatil' field and printed as '/v'.
  
! 'INSN_FROM_TARGET_P (X)'
!      In an 'insn' or 'jump_insn' or 'call_insn' in a delay slot of a
       branch, indicates that the insn is from the target of the branch.
!      If the branch insn has 'INSN_ANNULLED_BRANCH_P' set, this insn will
!      only be executed if the branch is taken.  For annulled branches
!      with 'INSN_FROM_TARGET_P' clear, the insn will be executed only if
!      the branch is not taken.  When 'INSN_ANNULLED_BRANCH_P' is not set,
!      this insn will always be executed.  Stored in the 'in_struct' field
!      and printed as '/s'.
  
! 'LABEL_PRESERVE_P (X)'
!      In a 'code_label' or 'note', indicates that the label is referenced
!      by code or data not visible to the RTL of a given function.  Labels
!      referenced by a non-local goto will have this bit set.  Stored in
!      the 'in_struct' field and printed as '/s'.
  
! 'LABEL_REF_NONLOCAL_P (X)'
!      In 'label_ref' and 'reg_label' expressions, nonzero if this is a
!      reference to a non-local label.  Stored in the 'volatil' field and
!      printed as '/v'.
  
! 'MEM_KEEP_ALIAS_SET_P (X)'
!      In 'mem' expressions, 1 if we should keep the alias set for this
       mem unchanged when we access a component.  Set to 1, for example,
       when we are already in a non-addressable component of an aggregate.
!      Stored in the 'jump' field and printed as '/j'.
  
! 'MEM_VOLATILE_P (X)'
!      In 'mem', 'asm_operands', and 'asm_input' expressions, nonzero for
!      volatile memory references.  Stored in the 'volatil' field and
!      printed as '/v'.
  
! 'MEM_NOTRAP_P (X)'
!      In 'mem', nonzero for memory references that will not trap.  Stored
!      in the 'call' field and printed as '/c'.
  
! 'MEM_POINTER (X)'
!      Nonzero in a 'mem' if the memory reference holds a pointer.  Stored
!      in the 'frame_related' field and printed as '/f'.
  
! 'REG_FUNCTION_VALUE_P (X)'
!      Nonzero in a 'reg' if it is the place in which this function's
       value is going to be returned.  (This happens only in a hard
!      register.)  Stored in the 'return_val' field and printed as '/i'.
  
! 'REG_POINTER (X)'
!      Nonzero in a 'reg' if the register holds a pointer.  Stored in the
!      'frame_related' field and printed as '/f'.
  
! 'REG_USERVAR_P (X)'
!      In a 'reg', nonzero if it corresponds to a variable present in the
       user's source code.  Zero for temporaries generated internally by
!      the compiler.  Stored in the 'volatil' field and printed as '/v'.
  
       The same hard register may be used also for collecting the values
!      of functions called by this one, but 'REG_FUNCTION_VALUE_P' is zero
       in this kind of use.
  
! 'RTX_FRAME_RELATED_P (X)'
!      Nonzero in an 'insn', 'call_insn', 'jump_insn', 'barrier', or 'set'
!      which is part of a function prologue and sets the stack pointer,
!      sets the frame pointer, or saves a register.  This flag should also
!      be set on an instruction that sets up a temporary register to use
!      in place of the frame pointer.  Stored in the 'frame_related' field
!      and printed as '/f'.
  
       In particular, on RISC targets where there are limits on the sizes
       of immediate constants, it is sometimes impossible to reach the
*************** the following macros, which expand into
*** 14501,14520 ****
       save area, and the Canonical Frame Address, i.e., DWARF2's logical
       frame pointer, register must (temporarily) be changed to be this
       temporary register.  So, the instruction that sets this temporary
!      register must be marked as `RTX_FRAME_RELATED_P'.
  
       If the marked instruction is overly complex (defined in terms of
!      what `dwarf2out_frame_debug_expr' can handle), you will also have
!      to create a `REG_FRAME_RELATED_EXPR' note and attach it to the
       instruction.  This note should contain a simple expression of the
       computation performed by this instruction, i.e., one that
!      `dwarf2out_frame_debug_expr' can handle.
  
       This flag is required for exception handling support on targets
       with RTL prologues.
  
! `MEM_READONLY_P (X)'
!      Nonzero in a `mem', if the memory is statically allocated and
       read-only.
  
       Read-only in this context means never modified during the lifetime
--- 14355,14374 ----
       save area, and the Canonical Frame Address, i.e., DWARF2's logical
       frame pointer, register must (temporarily) be changed to be this
       temporary register.  So, the instruction that sets this temporary
!      register must be marked as 'RTX_FRAME_RELATED_P'.
  
       If the marked instruction is overly complex (defined in terms of
!      what 'dwarf2out_frame_debug_expr' can handle), you will also have
!      to create a 'REG_FRAME_RELATED_EXPR' note and attach it to the
       instruction.  This note should contain a simple expression of the
       computation performed by this instruction, i.e., one that
!      'dwarf2out_frame_debug_expr' can handle.
  
       This flag is required for exception handling support on targets
       with RTL prologues.
  
! 'MEM_READONLY_P (X)'
!      Nonzero in a 'mem', if the memory is statically allocated and
       read-only.
  
       Read-only in this context means never modified during the lifetime
*************** the following macros, which expand into
*** 14525,14732 ****
       from the runtime loader to the application, this memory will never
       be subsequently modified.
  
!      Stored in the `unchanging' field and printed as `/u'.
  
! `SCHED_GROUP_P (X)'
!      During instruction scheduling, in an `insn', `call_insn',
!      `jump_insn' or `jump_table_data', indicates that the previous insn
       must be scheduled together with this insn.  This is used to ensure
       that certain groups of instructions will not be split up by the
!      instruction scheduling pass, for example, `use' insns before a
!      `call_insn' may not be separated from the `call_insn'.  Stored in
!      the `in_struct' field and printed as `/s'.
  
! `SET_IS_RETURN_P (X)'
!      For a `set', nonzero if it is for a return.  Stored in the `jump'
!      field and printed as `/j'.
  
! `SIBLING_CALL_P (X)'
!      For a `call_insn', nonzero if the insn is a sibling call.  Stored
!      in the `jump' field and printed as `/j'.
  
! `STRING_POOL_ADDRESS_P (X)'
!      For a `symbol_ref' expression, nonzero if it addresses this
!      function's string constant pool.  Stored in the `frame_related'
!      field and printed as `/f'.
  
! `SUBREG_PROMOTED_UNSIGNED_P (X)'
!      Returns a value greater then zero for a `subreg' that has
!      `SUBREG_PROMOTED_VAR_P' nonzero if the object being referenced is
!      kept zero-extended, zero if it is kept sign-extended, and less
!      then zero if it is extended some other way via the `ptr_extend'
!      instruction.  Stored in the `unchanging' field and `volatil'
!      field, printed as `/u' and `/v'.  This macro may only be used to
!      get the value it may not be used to change the value.  Use
!      `SUBREG_PROMOTED_UNSIGNED_SET' to change the value.
  
! `SUBREG_PROMOTED_UNSIGNED_SET (X)'
!      Set the `unchanging' and `volatil' fields in a `subreg' to reflect
!      zero, sign, or other extension.  If `volatil' is zero, then
!      `unchanging' as nonzero means zero extension and as zero means
!      sign extension.  If `volatil' is nonzero then some other type of
!      extension was done via the `ptr_extend' instruction.
  
! `SUBREG_PROMOTED_VAR_P (X)'
!      Nonzero in a `subreg' if it was made when accessing an object that
!      was promoted to a wider mode in accord with the `PROMOTED_MODE'
       machine description macro (*note Storage Layout::).  In this case,
!      the mode of the `subreg' is the declared mode of the object and
!      the mode of `SUBREG_REG' is the mode of the register that holds
!      the object.  Promoted variables are always either sign- or
!      zero-extended to the wider mode on every assignment.  Stored in
!      the `in_struct' field and printed as `/s'.
  
! `SYMBOL_REF_USED (X)'
!      In a `symbol_ref', indicates that X has been used.  This is
!      normally only used to ensure that X is only declared external
!      once.  Stored in the `used' field.
  
! `SYMBOL_REF_WEAK (X)'
!      In a `symbol_ref', indicates that X has been declared weak.
!      Stored in the `return_val' field and printed as `/i'.
  
! `SYMBOL_REF_FLAG (X)'
!      In a `symbol_ref', this is used as a flag for machine-specific
!      purposes.  Stored in the `volatil' field and printed as `/v'.
  
!      Most uses of `SYMBOL_REF_FLAG' are historic and may be subsumed by
!      `SYMBOL_REF_FLAGS'.  Certainly use of `SYMBOL_REF_FLAGS' is
       mandatory if the target requires more than one bit of storage.
  
! `PREFETCH_SCHEDULE_BARRIER_P (X)'
!      In a `prefetch', indicates that the prefetch is a scheduling
       barrier.  No other INSNs will be moved over it.  Stored in the
!      `volatil' field and printed as `/v'.
  
   These are the fields to which the above macros refer:
  
! `call'
!      In a `mem', 1 means that the memory reference will not trap.
  
!      In a `call', 1 means that this pure or const call may possibly
       infinite loop.
  
!      In an RTL dump, this flag is represented as `/c'.
  
! `frame_related'
!      In an `insn' or `set' expression, 1 means that it is part of a
       function prologue and sets the stack pointer, sets the frame
       pointer, saves a register, or sets up a temporary register to use
       in place of the frame pointer.
  
!      In `reg' expressions, 1 means that the register holds a pointer.
  
!      In `mem' expressions, 1 means that the memory reference holds a
       pointer.
  
!      In `symbol_ref' expressions, 1 means that the reference addresses
       this function's string constant pool.
  
!      In an RTL dump, this flag is represented as `/f'.
  
! `in_struct'
!      In `reg' expressions, it is 1 if the register has its entire life
       contained within the test expression of some loop.
  
!      In `subreg' expressions, 1 means that the `subreg' is accessing an
       object that has had its mode promoted from a wider mode.
  
!      In `label_ref' expressions, 1 means that the referenced label is
       outside the innermost loop containing the insn in which the
!      `label_ref' was found.
  
!      In `code_label' expressions, it is 1 if the label may never be
!      deleted.  This is used for labels which are the target of
!      non-local gotos.  Such a label that would have been deleted is
!      replaced with a `note' of type `NOTE_INSN_DELETED_LABEL'.
  
!      In an `insn' during dead-code elimination, 1 means that the insn is
       dead code.
  
!      In an `insn' or `jump_insn' during reorg for an insn in the delay
       slot of a branch, 1 means that this insn is from the target of the
       branch.
  
!      In an `insn' during instruction scheduling, 1 means that this insn
       must be scheduled as part of a group together with the previous
       insn.
  
!      In an RTL dump, this flag is represented as `/s'.
  
! `return_val'
!      In `reg' expressions, 1 means the register contains the value to
!      be returned by the current function.  On machines that pass
!      parameters in registers, the same register number may be used for
!      parameters as well, but this flag is not set on such uses.
  
!      In `symbol_ref' expressions, 1 means the referenced symbol is weak.
  
!      In `call' expressions, 1 means the call is pure.
  
!      In an RTL dump, this flag is represented as `/i'.
  
! `jump'
!      In a `mem' expression, 1 means we should keep the alias set for
       this mem unchanged when we access a component.
  
!      In a `set', 1 means it is for a return.
  
!      In a `call_insn', 1 means it is a sibling call.
  
!      In an RTL dump, this flag is represented as `/j'.
  
! `unchanging'
!      In `reg' and `mem' expressions, 1 means that the value of the
       expression never changes.
  
!      In `subreg' expressions, it is 1 if the `subreg' references an
       unsigned object whose mode has been promoted to a wider mode.
  
!      In an `insn' or `jump_insn' in the delay slot of a branch
       instruction, 1 means an annulling branch should be used.
  
!      In a `symbol_ref' expression, 1 means that this symbol addresses
       something in the per-function constant pool.
  
!      In a `call_insn' 1 means that this instruction is a call to a const
       function.
  
!      In an RTL dump, this flag is represented as `/u'.
  
! `used'
       This flag is used directly (without an access macro) at the end of
       RTL generation for a function, to count the number of times an
       expression appears in insns.  Expressions that appear more than
!      once are copied, according to the rules for shared structure
!      (*note Sharing::).
  
!      For a `reg', it is used directly (without an access macro) by the
       leaf register renumbering code to ensure that each register is only
       renumbered once.
  
!      In a `symbol_ref', it indicates that an external declaration for
       the symbol has already been written.
  
! `volatil'
!      In a `mem', `asm_operands', or `asm_input' expression, it is 1 if
       the memory reference is volatile.  Volatile memory references may
       not be deleted, reordered or combined.
  
!      In a `symbol_ref' expression, it is used for machine-specific
       purposes.
  
!      In a `reg' expression, it is 1 if the value is a user-level
       variable.  0 indicates an internal compiler temporary.
  
!      In an `insn', 1 means the insn has been deleted.
  
!      In `label_ref' and `reg_label' expressions, 1 means a reference to
       a non-local label.
  
!      In `prefetch' expressions, 1 means that the containing insn is a
       scheduling barrier.
  
!      In an RTL dump, this flag is represented as `/v'.
  
  
  File: gccint.info,  Node: Machine Modes,  Next: Constants,  Prev: Flags,  Up: RTL
--- 14379,14586 ----
       from the runtime loader to the application, this memory will never
       be subsequently modified.
  
!      Stored in the 'unchanging' field and printed as '/u'.
  
! 'SCHED_GROUP_P (X)'
!      During instruction scheduling, in an 'insn', 'call_insn',
!      'jump_insn' or 'jump_table_data', indicates that the previous insn
       must be scheduled together with this insn.  This is used to ensure
       that certain groups of instructions will not be split up by the
!      instruction scheduling pass, for example, 'use' insns before a
!      'call_insn' may not be separated from the 'call_insn'.  Stored in
!      the 'in_struct' field and printed as '/s'.
  
! 'SET_IS_RETURN_P (X)'
!      For a 'set', nonzero if it is for a return.  Stored in the 'jump'
!      field and printed as '/j'.
  
! 'SIBLING_CALL_P (X)'
!      For a 'call_insn', nonzero if the insn is a sibling call.  Stored
!      in the 'jump' field and printed as '/j'.
  
! 'STRING_POOL_ADDRESS_P (X)'
!      For a 'symbol_ref' expression, nonzero if it addresses this
!      function's string constant pool.  Stored in the 'frame_related'
!      field and printed as '/f'.
  
! 'SUBREG_PROMOTED_UNSIGNED_P (X)'
!      Returns a value greater then zero for a 'subreg' that has
!      'SUBREG_PROMOTED_VAR_P' nonzero if the object being referenced is
!      kept zero-extended, zero if it is kept sign-extended, and less then
!      zero if it is extended some other way via the 'ptr_extend'
!      instruction.  Stored in the 'unchanging' field and 'volatil' field,
!      printed as '/u' and '/v'.  This macro may only be used to get the
!      value it may not be used to change the value.  Use
!      'SUBREG_PROMOTED_UNSIGNED_SET' to change the value.
  
! 'SUBREG_PROMOTED_UNSIGNED_SET (X)'
!      Set the 'unchanging' and 'volatil' fields in a 'subreg' to reflect
!      zero, sign, or other extension.  If 'volatil' is zero, then
!      'unchanging' as nonzero means zero extension and as zero means sign
!      extension.  If 'volatil' is nonzero then some other type of
!      extension was done via the 'ptr_extend' instruction.
  
! 'SUBREG_PROMOTED_VAR_P (X)'
!      Nonzero in a 'subreg' if it was made when accessing an object that
!      was promoted to a wider mode in accord with the 'PROMOTED_MODE'
       machine description macro (*note Storage Layout::).  In this case,
!      the mode of the 'subreg' is the declared mode of the object and the
!      mode of 'SUBREG_REG' is the mode of the register that holds the
!      object.  Promoted variables are always either sign- or
!      zero-extended to the wider mode on every assignment.  Stored in the
!      'in_struct' field and printed as '/s'.
  
! 'SYMBOL_REF_USED (X)'
!      In a 'symbol_ref', indicates that X has been used.  This is
!      normally only used to ensure that X is only declared external once.
!      Stored in the 'used' field.
  
! 'SYMBOL_REF_WEAK (X)'
!      In a 'symbol_ref', indicates that X has been declared weak.  Stored
!      in the 'return_val' field and printed as '/i'.
  
! 'SYMBOL_REF_FLAG (X)'
!      In a 'symbol_ref', this is used as a flag for machine-specific
!      purposes.  Stored in the 'volatil' field and printed as '/v'.
  
!      Most uses of 'SYMBOL_REF_FLAG' are historic and may be subsumed by
!      'SYMBOL_REF_FLAGS'.  Certainly use of 'SYMBOL_REF_FLAGS' is
       mandatory if the target requires more than one bit of storage.
  
! 'PREFETCH_SCHEDULE_BARRIER_P (X)'
!      In a 'prefetch', indicates that the prefetch is a scheduling
       barrier.  No other INSNs will be moved over it.  Stored in the
!      'volatil' field and printed as '/v'.
  
   These are the fields to which the above macros refer:
  
! 'call'
!      In a 'mem', 1 means that the memory reference will not trap.
  
!      In a 'call', 1 means that this pure or const call may possibly
       infinite loop.
  
!      In an RTL dump, this flag is represented as '/c'.
  
! 'frame_related'
!      In an 'insn' or 'set' expression, 1 means that it is part of a
       function prologue and sets the stack pointer, sets the frame
       pointer, saves a register, or sets up a temporary register to use
       in place of the frame pointer.
  
!      In 'reg' expressions, 1 means that the register holds a pointer.
  
!      In 'mem' expressions, 1 means that the memory reference holds a
       pointer.
  
!      In 'symbol_ref' expressions, 1 means that the reference addresses
       this function's string constant pool.
  
!      In an RTL dump, this flag is represented as '/f'.
  
! 'in_struct'
!      In 'reg' expressions, it is 1 if the register has its entire life
       contained within the test expression of some loop.
  
!      In 'subreg' expressions, 1 means that the 'subreg' is accessing an
       object that has had its mode promoted from a wider mode.
  
!      In 'label_ref' expressions, 1 means that the referenced label is
       outside the innermost loop containing the insn in which the
!      'label_ref' was found.
  
!      In 'code_label' expressions, it is 1 if the label may never be
!      deleted.  This is used for labels which are the target of non-local
!      gotos.  Such a label that would have been deleted is replaced with
!      a 'note' of type 'NOTE_INSN_DELETED_LABEL'.
  
!      In an 'insn' during dead-code elimination, 1 means that the insn is
       dead code.
  
!      In an 'insn' or 'jump_insn' during reorg for an insn in the delay
       slot of a branch, 1 means that this insn is from the target of the
       branch.
  
!      In an 'insn' during instruction scheduling, 1 means that this insn
       must be scheduled as part of a group together with the previous
       insn.
  
!      In an RTL dump, this flag is represented as '/s'.
  
! 'return_val'
!      In 'reg' expressions, 1 means the register contains the value to be
!      returned by the current function.  On machines that pass parameters
!      in registers, the same register number may be used for parameters
!      as well, but this flag is not set on such uses.
  
!      In 'symbol_ref' expressions, 1 means the referenced symbol is weak.
  
!      In 'call' expressions, 1 means the call is pure.
  
!      In an RTL dump, this flag is represented as '/i'.
  
! 'jump'
!      In a 'mem' expression, 1 means we should keep the alias set for
       this mem unchanged when we access a component.
  
!      In a 'set', 1 means it is for a return.
  
!      In a 'call_insn', 1 means it is a sibling call.
  
!      In an RTL dump, this flag is represented as '/j'.
  
! 'unchanging'
!      In 'reg' and 'mem' expressions, 1 means that the value of the
       expression never changes.
  
!      In 'subreg' expressions, it is 1 if the 'subreg' references an
       unsigned object whose mode has been promoted to a wider mode.
  
!      In an 'insn' or 'jump_insn' in the delay slot of a branch
       instruction, 1 means an annulling branch should be used.
  
!      In a 'symbol_ref' expression, 1 means that this symbol addresses
       something in the per-function constant pool.
  
!      In a 'call_insn' 1 means that this instruction is a call to a const
       function.
  
!      In an RTL dump, this flag is represented as '/u'.
  
! 'used'
       This flag is used directly (without an access macro) at the end of
       RTL generation for a function, to count the number of times an
       expression appears in insns.  Expressions that appear more than
!      once are copied, according to the rules for shared structure (*note
!      Sharing::).
  
!      For a 'reg', it is used directly (without an access macro) by the
       leaf register renumbering code to ensure that each register is only
       renumbered once.
  
!      In a 'symbol_ref', it indicates that an external declaration for
       the symbol has already been written.
  
! 'volatil'
!      In a 'mem', 'asm_operands', or 'asm_input' expression, it is 1 if
       the memory reference is volatile.  Volatile memory references may
       not be deleted, reordered or combined.
  
!      In a 'symbol_ref' expression, it is used for machine-specific
       purposes.
  
!      In a 'reg' expression, it is 1 if the value is a user-level
       variable.  0 indicates an internal compiler temporary.
  
!      In an 'insn', 1 means the insn has been deleted.
  
!      In 'label_ref' and 'reg_label' expressions, 1 means a reference to
       a non-local label.
  
!      In 'prefetch' expressions, 1 means that the containing insn is a
       scheduling barrier.
  
!      In an RTL dump, this flag is represented as '/v'.
  
  
  File: gccint.info,  Node: Machine Modes,  Next: Constants,  Prev: Flags,  Up: RTL
*************** File: gccint.info,  Node: Machine Modes,
*** 14736,15105 ****
  
  A machine mode describes a size of data object and the representation
  used for it.  In the C code, machine modes are represented by an
! enumeration type, `machine_mode', defined in `machmode.def'.  Each RTL
  expression has room for a machine mode and so do certain kinds of tree
  expressions (declarations and types, to be precise).
  
   In debugging dumps and machine descriptions, the machine mode of an RTL
  expression is written after the expression code with a colon to separate
! them.  The letters `mode' which appear at the end of each machine mode
! name are omitted.  For example, `(reg:SI 38)' is a `reg' expression
! with machine mode `SImode'.  If the mode is `VOIDmode', it is not
! written at all.
  
   Here is a table of machine modes.  The term "byte" below refers to an
! object of `BITS_PER_UNIT' bits (*note Storage Layout::).
  
! `BImode'
       "Bit" mode represents a single bit, for predicate registers.
  
! `QImode'
       "Quarter-Integer" mode represents a single byte treated as an
       integer.
  
! `HImode'
       "Half-Integer" mode represents a two-byte integer.
  
! `PSImode'
       "Partial Single Integer" mode represents an integer which occupies
       four bytes but which doesn't really use all four.  On some
       machines, this is the right mode to use for pointers.
  
! `SImode'
       "Single Integer" mode represents a four-byte integer.
  
! `PDImode'
       "Partial Double Integer" mode represents an integer which occupies
       eight bytes but which doesn't really use all eight.  On some
       machines, this is the right mode to use for certain pointers.
  
! `DImode'
       "Double Integer" mode represents an eight-byte integer.
  
! `TImode'
!      "Tetra Integer" (?) mode represents a sixteen-byte integer.
  
! `OImode'
!      "Octa Integer" (?) mode represents a thirty-two-byte integer.
  
! `XImode'
!      "Hexadeca Integer" (?) mode represents a sixty-four-byte integer.
  
! `QFmode'
       "Quarter-Floating" mode represents a quarter-precision (single
       byte) floating point number.
  
! `HFmode'
       "Half-Floating" mode represents a half-precision (two byte)
       floating point number.
  
! `TQFmode'
!      "Three-Quarter-Floating" (?) mode represents a
       three-quarter-precision (three byte) floating point number.
  
! `SFmode'
       "Single Floating" mode represents a four byte floating point
       number.  In the common case, of a processor with IEEE arithmetic
       and 8-bit bytes, this is a single-precision IEEE floating point
       number; it can also be used for double-precision (on processors
       with 16-bit bytes) and single-precision VAX and IBM types.
  
! `DFmode'
       "Double Floating" mode represents an eight byte floating point
       number.  In the common case, of a processor with IEEE arithmetic
       and 8-bit bytes, this is a double-precision IEEE floating point
       number.
  
! `XFmode'
       "Extended Floating" mode represents an IEEE extended floating point
       number.  This mode only has 80 meaningful bits (ten bytes).  Some
       processors require such numbers to be padded to twelve bytes,
       others to sixteen; this mode is used for either.
  
! `SDmode'
       "Single Decimal Floating" mode represents a four byte decimal
       floating point number (as distinct from conventional binary
       floating point).
  
! `DDmode'
       "Double Decimal Floating" mode represents an eight byte decimal
       floating point number.
  
! `TDmode'
       "Tetra Decimal Floating" mode represents a sixteen byte decimal
       floating point number all 128 of whose bits are meaningful.
  
! `TFmode'
       "Tetra Floating" mode represents a sixteen byte floating point
       number all 128 of whose bits are meaningful.  One common use is the
       IEEE quad-precision format.
  
! `QQmode'
       "Quarter-Fractional" mode represents a single byte treated as a
       signed fractional number.  The default format is "s.7".
  
! `HQmode'
       "Half-Fractional" mode represents a two-byte signed fractional
       number.  The default format is "s.15".
  
! `SQmode'
       "Single Fractional" mode represents a four-byte signed fractional
       number.  The default format is "s.31".
  
! `DQmode'
!      "Double Fractional" mode represents an eight-byte signed
!      fractional number.  The default format is "s.63".
  
! `TQmode'
!      "Tetra Fractional" mode represents a sixteen-byte signed
!      fractional number.  The default format is "s.127".
  
! `UQQmode'
!      "Unsigned Quarter-Fractional" mode represents a single byte
!      treated as an unsigned fractional number.  The default format is
!      ".8".
  
! `UHQmode'
       "Unsigned Half-Fractional" mode represents a two-byte unsigned
       fractional number.  The default format is ".16".
  
! `USQmode'
       "Unsigned Single Fractional" mode represents a four-byte unsigned
       fractional number.  The default format is ".32".
  
! `UDQmode'
       "Unsigned Double Fractional" mode represents an eight-byte unsigned
       fractional number.  The default format is ".64".
  
! `UTQmode'
       "Unsigned Tetra Fractional" mode represents a sixteen-byte unsigned
       fractional number.  The default format is ".128".
  
! `HAmode'
       "Half-Accumulator" mode represents a two-byte signed accumulator.
       The default format is "s8.7".
  
! `SAmode'
       "Single Accumulator" mode represents a four-byte signed
       accumulator.  The default format is "s16.15".
  
! `DAmode'
       "Double Accumulator" mode represents an eight-byte signed
       accumulator.  The default format is "s32.31".
  
! `TAmode'
       "Tetra Accumulator" mode represents a sixteen-byte signed
       accumulator.  The default format is "s64.63".
  
! `UHAmode'
       "Unsigned Half-Accumulator" mode represents a two-byte unsigned
       accumulator.  The default format is "8.8".
  
! `USAmode'
       "Unsigned Single Accumulator" mode represents a four-byte unsigned
       accumulator.  The default format is "16.16".
  
! `UDAmode'
       "Unsigned Double Accumulator" mode represents an eight-byte
       unsigned accumulator.  The default format is "32.32".
  
! `UTAmode'
       "Unsigned Tetra Accumulator" mode represents a sixteen-byte
       unsigned accumulator.  The default format is "64.64".
  
! `CCmode'
       "Condition Code" mode represents the value of a condition code,
       which is a machine-specific set of bits used to represent the
!      result of a comparison operation.  Other machine-specific modes
!      may also be used for the condition code.  These modes are not used
!      on machines that use `cc0' (*note Condition Code::).
  
! `BLKmode'
       "Block" mode represents values that are aggregates to which none of
       the other modes apply.  In RTL, only memory references can have
       this mode, and only if they appear in string-move or vector
       instructions.  On machines which have no such instructions,
!      `BLKmode' will not appear in RTL.
  
! `VOIDmode'
       Void mode means the absence of a mode or an unspecified mode.  For
!      example, RTL expressions of code `const_int' have mode `VOIDmode'
       because they can be taken to have whatever mode the context
!      requires.  In debugging dumps of RTL, `VOIDmode' is expressed by
       the absence of any mode.
  
! `QCmode, HCmode, SCmode, DCmode, XCmode, TCmode'
       These modes stand for a complex number represented as a pair of
!      floating point values.  The floating point values are in `QFmode',
!      `HFmode', `SFmode', `DFmode', `XFmode', and `TFmode', respectively.
  
! `CQImode, CHImode, CSImode, CDImode, CTImode, COImode'
       These modes stand for a complex number represented as a pair of
!      integer values.  The integer values are in `QImode', `HImode',
!      `SImode', `DImode', `TImode', and `OImode', respectively.
  
! `BND32mode BND64mode'
       These modes stand for bounds for pointer of 32 and 64 bit size
       respectively.  Mode size is double pointer mode size.
  
!  The machine description defines `Pmode' as a C macro which expands
! into the machine mode used for addresses.  Normally this is the mode
! whose size is `BITS_PER_WORD', `SImode' on 32-bit machines.
  
!  The only modes which a machine description must support are `QImode',
! and the modes corresponding to `BITS_PER_WORD', `FLOAT_TYPE_SIZE' and
! `DOUBLE_TYPE_SIZE'.  The compiler will attempt to use `DImode' for
  8-byte structures and unions, but this can be prevented by overriding
! the definition of `MAX_FIXED_MODE_SIZE'.  Alternatively, you can have
! the compiler use `TImode' for 16-byte structures and unions.  Likewise,
! you can arrange for the C type `short int' to avoid using `HImode'.
  
   Very few explicit references to machine modes remain in the compiler
  and these few references will soon be removed.  Instead, the machine
  modes are divided into mode classes.  These are represented by the
! enumeration type `enum mode_class' defined in `machmode.h'.  The
  possible mode classes are:
  
! `MODE_INT'
!      Integer modes.  By default these are `BImode', `QImode', `HImode',
!      `SImode', `DImode', `TImode', and `OImode'.
  
! `MODE_PARTIAL_INT'
!      The "partial integer" modes, `PQImode', `PHImode', `PSImode' and
!      `PDImode'.
  
! `MODE_FLOAT'
!      Floating point modes.  By default these are `QFmode', `HFmode',
!      `TQFmode', `SFmode', `DFmode', `XFmode' and `TFmode'.
  
! `MODE_DECIMAL_FLOAT'
!      Decimal floating point modes.  By default these are `SDmode',
!      `DDmode' and `TDmode'.
  
! `MODE_FRACT'
!      Signed fractional modes.  By default these are `QQmode', `HQmode',
!      `SQmode', `DQmode' and `TQmode'.
  
! `MODE_UFRACT'
!      Unsigned fractional modes.  By default these are `UQQmode',
!      `UHQmode', `USQmode', `UDQmode' and `UTQmode'.
  
! `MODE_ACCUM'
!      Signed accumulator modes.  By default these are `HAmode',
!      `SAmode', `DAmode' and `TAmode'.
  
! `MODE_UACCUM'
!      Unsigned accumulator modes.  By default these are `UHAmode',
!      `USAmode', `UDAmode' and `UTAmode'.
  
! `MODE_COMPLEX_INT'
       Complex integer modes.  (These are not currently implemented).
  
! `MODE_COMPLEX_FLOAT'
!      Complex floating point modes.  By default these are `QCmode',
!      `HCmode', `SCmode', `DCmode', `XCmode', and `TCmode'.
  
! `MODE_FUNCTION'
       Algol or Pascal function variables including a static chain.
       (These are not currently implemented).
  
! `MODE_CC'
!      Modes representing condition code values.  These are `CCmode' plus
!      any `CC_MODE' modes listed in the `MACHINE-modes.def'.  *Note Jump
       Patterns::, also see *note Condition Code::.
  
! `MODE_POINTER_BOUNDS'
       Pointer bounds modes.  Used to represent values of pointer bounds
       type.  Operations in these modes may be executed as NOPs depending
       on hardware features and environment setup.
  
! `MODE_RANDOM'
       This is a catchall mode class for modes which don't fit into the
!      above classes.  Currently `VOIDmode' and `BLKmode' are in
!      `MODE_RANDOM'.
  
   Here are some C macros that relate to machine modes:
  
! `GET_MODE (X)'
       Returns the machine mode of the RTX X.
  
! `PUT_MODE (X, NEWMODE)'
       Alters the machine mode of the RTX X to be NEWMODE.
  
! `NUM_MACHINE_MODES'
       Stands for the number of machine modes available on the target
       machine.  This is one greater than the largest numeric value of any
       machine mode.
  
! `GET_MODE_NAME (M)'
       Returns the name of mode M as a string.
  
! `GET_MODE_CLASS (M)'
       Returns the mode class of mode M.
  
! `GET_MODE_WIDER_MODE (M)'
       Returns the next wider natural mode.  For example, the expression
!      `GET_MODE_WIDER_MODE (QImode)' returns `HImode'.
  
! `GET_MODE_SIZE (M)'
       Returns the size in bytes of a datum of mode M.
  
! `GET_MODE_BITSIZE (M)'
       Returns the size in bits of a datum of mode M.
  
! `GET_MODE_IBIT (M)'
       Returns the number of integral bits of a datum of fixed-point mode
       M.
  
! `GET_MODE_FBIT (M)'
       Returns the number of fractional bits of a datum of fixed-point
       mode M.
  
! `GET_MODE_MASK (M)'
       Returns a bitmask containing 1 for all bits in a word that fit
!      within mode M.  This macro can only be used for modes whose
!      bitsize is less than or equal to `HOST_BITS_PER_INT'.
  
! `GET_MODE_ALIGNMENT (M)'
       Return the required alignment, in bits, for an object of mode M.
  
! `GET_MODE_UNIT_SIZE (M)'
       Returns the size in bytes of the subunits of a datum of mode M.
!      This is the same as `GET_MODE_SIZE' except in the case of complex
       modes.  For them, the unit size is the size of the real or
       imaginary part.
  
! `GET_MODE_NUNITS (M)'
       Returns the number of units contained in a mode, i.e.,
!      `GET_MODE_SIZE' divided by `GET_MODE_UNIT_SIZE'.
  
! `GET_CLASS_NARROWEST_MODE (C)'
       Returns the narrowest mode in mode class C.
  
!  The following 3 variables are defined on every target.   They can be
  used to allocate buffers that are guaranteed to be large enough to hold
! any value that can be represented on the target.   The first two can be
  overridden by defining them in the target's mode.def file, however, the
  value must be a constant that can determined very early in the
! compilation process.   The third symbol cannot be overridden.
  
! `BITS_PER_UNIT'
       The number of bits in an addressable storage unit (byte).  If you
       do not define this, the default is 8.
  
! `MAX_BITSIZE_MODE_ANY_INT'
       The maximum bitsize of any mode that is used in integer math.  This
       should be overridden by the target if it uses large integers as
!      containers for larger vectors but otherwise never uses the
!      contents to compute integer values.
  
! `MAX_BITSIZE_MODE_ANY_MODE'
       The bitsize of the largest mode on the target.
  
!  The global variables `byte_mode' and `word_mode' contain modes whose
! classes are `MODE_INT' and whose bitsizes are either `BITS_PER_UNIT' or
! `BITS_PER_WORD', respectively.  On 32-bit machines, these are `QImode'
! and `SImode', respectively.
  
  
  File: gccint.info,  Node: Constants,  Next: Regs and Memory,  Prev: Machine Modes,  Up: RTL
--- 14590,14958 ----
  
  A machine mode describes a size of data object and the representation
  used for it.  In the C code, machine modes are represented by an
! enumeration type, 'machine_mode', defined in 'machmode.def'.  Each RTL
  expression has room for a machine mode and so do certain kinds of tree
  expressions (declarations and types, to be precise).
  
   In debugging dumps and machine descriptions, the machine mode of an RTL
  expression is written after the expression code with a colon to separate
! them.  The letters 'mode' which appear at the end of each machine mode
! name are omitted.  For example, '(reg:SI 38)' is a 'reg' expression with
! machine mode 'SImode'.  If the mode is 'VOIDmode', it is not written at
! all.
  
   Here is a table of machine modes.  The term "byte" below refers to an
! object of 'BITS_PER_UNIT' bits (*note Storage Layout::).
  
! 'BImode'
       "Bit" mode represents a single bit, for predicate registers.
  
! 'QImode'
       "Quarter-Integer" mode represents a single byte treated as an
       integer.
  
! 'HImode'
       "Half-Integer" mode represents a two-byte integer.
  
! 'PSImode'
       "Partial Single Integer" mode represents an integer which occupies
       four bytes but which doesn't really use all four.  On some
       machines, this is the right mode to use for pointers.
  
! 'SImode'
       "Single Integer" mode represents a four-byte integer.
  
! 'PDImode'
       "Partial Double Integer" mode represents an integer which occupies
       eight bytes but which doesn't really use all eight.  On some
       machines, this is the right mode to use for certain pointers.
  
! 'DImode'
       "Double Integer" mode represents an eight-byte integer.
  
! 'TImode'
!      "Tetra Integer" (?)  mode represents a sixteen-byte integer.
  
! 'OImode'
!      "Octa Integer" (?)  mode represents a thirty-two-byte integer.
  
! 'XImode'
!      "Hexadeca Integer" (?)  mode represents a sixty-four-byte integer.
  
! 'QFmode'
       "Quarter-Floating" mode represents a quarter-precision (single
       byte) floating point number.
  
! 'HFmode'
       "Half-Floating" mode represents a half-precision (two byte)
       floating point number.
  
! 'TQFmode'
!      "Three-Quarter-Floating" (?)  mode represents a
       three-quarter-precision (three byte) floating point number.
  
! 'SFmode'
       "Single Floating" mode represents a four byte floating point
       number.  In the common case, of a processor with IEEE arithmetic
       and 8-bit bytes, this is a single-precision IEEE floating point
       number; it can also be used for double-precision (on processors
       with 16-bit bytes) and single-precision VAX and IBM types.
  
! 'DFmode'
       "Double Floating" mode represents an eight byte floating point
       number.  In the common case, of a processor with IEEE arithmetic
       and 8-bit bytes, this is a double-precision IEEE floating point
       number.
  
! 'XFmode'
       "Extended Floating" mode represents an IEEE extended floating point
       number.  This mode only has 80 meaningful bits (ten bytes).  Some
       processors require such numbers to be padded to twelve bytes,
       others to sixteen; this mode is used for either.
  
! 'SDmode'
       "Single Decimal Floating" mode represents a four byte decimal
       floating point number (as distinct from conventional binary
       floating point).
  
! 'DDmode'
       "Double Decimal Floating" mode represents an eight byte decimal
       floating point number.
  
! 'TDmode'
       "Tetra Decimal Floating" mode represents a sixteen byte decimal
       floating point number all 128 of whose bits are meaningful.
  
! 'TFmode'
       "Tetra Floating" mode represents a sixteen byte floating point
       number all 128 of whose bits are meaningful.  One common use is the
       IEEE quad-precision format.
  
! 'QQmode'
       "Quarter-Fractional" mode represents a single byte treated as a
       signed fractional number.  The default format is "s.7".
  
! 'HQmode'
       "Half-Fractional" mode represents a two-byte signed fractional
       number.  The default format is "s.15".
  
! 'SQmode'
       "Single Fractional" mode represents a four-byte signed fractional
       number.  The default format is "s.31".
  
! 'DQmode'
!      "Double Fractional" mode represents an eight-byte signed fractional
!      number.  The default format is "s.63".
  
! 'TQmode'
!      "Tetra Fractional" mode represents a sixteen-byte signed fractional
!      number.  The default format is "s.127".
  
! 'UQQmode'
!      "Unsigned Quarter-Fractional" mode represents a single byte treated
!      as an unsigned fractional number.  The default format is ".8".
  
! 'UHQmode'
       "Unsigned Half-Fractional" mode represents a two-byte unsigned
       fractional number.  The default format is ".16".
  
! 'USQmode'
       "Unsigned Single Fractional" mode represents a four-byte unsigned
       fractional number.  The default format is ".32".
  
! 'UDQmode'
       "Unsigned Double Fractional" mode represents an eight-byte unsigned
       fractional number.  The default format is ".64".
  
! 'UTQmode'
       "Unsigned Tetra Fractional" mode represents a sixteen-byte unsigned
       fractional number.  The default format is ".128".
  
! 'HAmode'
       "Half-Accumulator" mode represents a two-byte signed accumulator.
       The default format is "s8.7".
  
! 'SAmode'
       "Single Accumulator" mode represents a four-byte signed
       accumulator.  The default format is "s16.15".
  
! 'DAmode'
       "Double Accumulator" mode represents an eight-byte signed
       accumulator.  The default format is "s32.31".
  
! 'TAmode'
       "Tetra Accumulator" mode represents a sixteen-byte signed
       accumulator.  The default format is "s64.63".
  
! 'UHAmode'
       "Unsigned Half-Accumulator" mode represents a two-byte unsigned
       accumulator.  The default format is "8.8".
  
! 'USAmode'
       "Unsigned Single Accumulator" mode represents a four-byte unsigned
       accumulator.  The default format is "16.16".
  
! 'UDAmode'
       "Unsigned Double Accumulator" mode represents an eight-byte
       unsigned accumulator.  The default format is "32.32".
  
! 'UTAmode'
       "Unsigned Tetra Accumulator" mode represents a sixteen-byte
       unsigned accumulator.  The default format is "64.64".
  
! 'CCmode'
       "Condition Code" mode represents the value of a condition code,
       which is a machine-specific set of bits used to represent the
!      result of a comparison operation.  Other machine-specific modes may
!      also be used for the condition code.  These modes are not used on
!      machines that use 'cc0' (*note Condition Code::).
  
! 'BLKmode'
       "Block" mode represents values that are aggregates to which none of
       the other modes apply.  In RTL, only memory references can have
       this mode, and only if they appear in string-move or vector
       instructions.  On machines which have no such instructions,
!      'BLKmode' will not appear in RTL.
  
! 'VOIDmode'
       Void mode means the absence of a mode or an unspecified mode.  For
!      example, RTL expressions of code 'const_int' have mode 'VOIDmode'
       because they can be taken to have whatever mode the context
!      requires.  In debugging dumps of RTL, 'VOIDmode' is expressed by
       the absence of any mode.
  
! 'QCmode, HCmode, SCmode, DCmode, XCmode, TCmode'
       These modes stand for a complex number represented as a pair of
!      floating point values.  The floating point values are in 'QFmode',
!      'HFmode', 'SFmode', 'DFmode', 'XFmode', and 'TFmode', respectively.
  
! 'CQImode, CHImode, CSImode, CDImode, CTImode, COImode'
       These modes stand for a complex number represented as a pair of
!      integer values.  The integer values are in 'QImode', 'HImode',
!      'SImode', 'DImode', 'TImode', and 'OImode', respectively.
  
! 'BND32mode BND64mode'
       These modes stand for bounds for pointer of 32 and 64 bit size
       respectively.  Mode size is double pointer mode size.
  
!  The machine description defines 'Pmode' as a C macro which expands into
! the machine mode used for addresses.  Normally this is the mode whose
! size is 'BITS_PER_WORD', 'SImode' on 32-bit machines.
  
!  The only modes which a machine description must support are 'QImode',
! and the modes corresponding to 'BITS_PER_WORD', 'FLOAT_TYPE_SIZE' and
! 'DOUBLE_TYPE_SIZE'.  The compiler will attempt to use 'DImode' for
  8-byte structures and unions, but this can be prevented by overriding
! the definition of 'MAX_FIXED_MODE_SIZE'.  Alternatively, you can have
! the compiler use 'TImode' for 16-byte structures and unions.  Likewise,
! you can arrange for the C type 'short int' to avoid using 'HImode'.
  
   Very few explicit references to machine modes remain in the compiler
  and these few references will soon be removed.  Instead, the machine
  modes are divided into mode classes.  These are represented by the
! enumeration type 'enum mode_class' defined in 'machmode.h'.  The
  possible mode classes are:
  
! 'MODE_INT'
!      Integer modes.  By default these are 'BImode', 'QImode', 'HImode',
!      'SImode', 'DImode', 'TImode', and 'OImode'.
  
! 'MODE_PARTIAL_INT'
!      The "partial integer" modes, 'PQImode', 'PHImode', 'PSImode' and
!      'PDImode'.
  
! 'MODE_FLOAT'
!      Floating point modes.  By default these are 'QFmode', 'HFmode',
!      'TQFmode', 'SFmode', 'DFmode', 'XFmode' and 'TFmode'.
  
! 'MODE_DECIMAL_FLOAT'
!      Decimal floating point modes.  By default these are 'SDmode',
!      'DDmode' and 'TDmode'.
  
! 'MODE_FRACT'
!      Signed fractional modes.  By default these are 'QQmode', 'HQmode',
!      'SQmode', 'DQmode' and 'TQmode'.
  
! 'MODE_UFRACT'
!      Unsigned fractional modes.  By default these are 'UQQmode',
!      'UHQmode', 'USQmode', 'UDQmode' and 'UTQmode'.
  
! 'MODE_ACCUM'
!      Signed accumulator modes.  By default these are 'HAmode', 'SAmode',
!      'DAmode' and 'TAmode'.
  
! 'MODE_UACCUM'
!      Unsigned accumulator modes.  By default these are 'UHAmode',
!      'USAmode', 'UDAmode' and 'UTAmode'.
  
! 'MODE_COMPLEX_INT'
       Complex integer modes.  (These are not currently implemented).
  
! 'MODE_COMPLEX_FLOAT'
!      Complex floating point modes.  By default these are 'QCmode',
!      'HCmode', 'SCmode', 'DCmode', 'XCmode', and 'TCmode'.
  
! 'MODE_FUNCTION'
       Algol or Pascal function variables including a static chain.
       (These are not currently implemented).
  
! 'MODE_CC'
!      Modes representing condition code values.  These are 'CCmode' plus
!      any 'CC_MODE' modes listed in the 'MACHINE-modes.def'.  *Note Jump
       Patterns::, also see *note Condition Code::.
  
! 'MODE_POINTER_BOUNDS'
       Pointer bounds modes.  Used to represent values of pointer bounds
       type.  Operations in these modes may be executed as NOPs depending
       on hardware features and environment setup.
  
! 'MODE_RANDOM'
       This is a catchall mode class for modes which don't fit into the
!      above classes.  Currently 'VOIDmode' and 'BLKmode' are in
!      'MODE_RANDOM'.
  
   Here are some C macros that relate to machine modes:
  
! 'GET_MODE (X)'
       Returns the machine mode of the RTX X.
  
! 'PUT_MODE (X, NEWMODE)'
       Alters the machine mode of the RTX X to be NEWMODE.
  
! 'NUM_MACHINE_MODES'
       Stands for the number of machine modes available on the target
       machine.  This is one greater than the largest numeric value of any
       machine mode.
  
! 'GET_MODE_NAME (M)'
       Returns the name of mode M as a string.
  
! 'GET_MODE_CLASS (M)'
       Returns the mode class of mode M.
  
! 'GET_MODE_WIDER_MODE (M)'
       Returns the next wider natural mode.  For example, the expression
!      'GET_MODE_WIDER_MODE (QImode)' returns 'HImode'.
  
! 'GET_MODE_SIZE (M)'
       Returns the size in bytes of a datum of mode M.
  
! 'GET_MODE_BITSIZE (M)'
       Returns the size in bits of a datum of mode M.
  
! 'GET_MODE_IBIT (M)'
       Returns the number of integral bits of a datum of fixed-point mode
       M.
  
! 'GET_MODE_FBIT (M)'
       Returns the number of fractional bits of a datum of fixed-point
       mode M.
  
! 'GET_MODE_MASK (M)'
       Returns a bitmask containing 1 for all bits in a word that fit
!      within mode M.  This macro can only be used for modes whose bitsize
!      is less than or equal to 'HOST_BITS_PER_INT'.
  
! 'GET_MODE_ALIGNMENT (M)'
       Return the required alignment, in bits, for an object of mode M.
  
! 'GET_MODE_UNIT_SIZE (M)'
       Returns the size in bytes of the subunits of a datum of mode M.
!      This is the same as 'GET_MODE_SIZE' except in the case of complex
       modes.  For them, the unit size is the size of the real or
       imaginary part.
  
! 'GET_MODE_NUNITS (M)'
       Returns the number of units contained in a mode, i.e.,
!      'GET_MODE_SIZE' divided by 'GET_MODE_UNIT_SIZE'.
  
! 'GET_CLASS_NARROWEST_MODE (C)'
       Returns the narrowest mode in mode class C.
  
!  The following 3 variables are defined on every target.  They can be
  used to allocate buffers that are guaranteed to be large enough to hold
! any value that can be represented on the target.  The first two can be
  overridden by defining them in the target's mode.def file, however, the
  value must be a constant that can determined very early in the
! compilation process.  The third symbol cannot be overridden.
  
! 'BITS_PER_UNIT'
       The number of bits in an addressable storage unit (byte).  If you
       do not define this, the default is 8.
  
! 'MAX_BITSIZE_MODE_ANY_INT'
       The maximum bitsize of any mode that is used in integer math.  This
       should be overridden by the target if it uses large integers as
!      containers for larger vectors but otherwise never uses the contents
!      to compute integer values.
  
! 'MAX_BITSIZE_MODE_ANY_MODE'
       The bitsize of the largest mode on the target.
  
!  The global variables 'byte_mode' and 'word_mode' contain modes whose
! classes are 'MODE_INT' and whose bitsizes are either 'BITS_PER_UNIT' or
! 'BITS_PER_WORD', respectively.  On 32-bit machines, these are 'QImode'
! and 'SImode', respectively.
  
  
  File: gccint.info,  Node: Constants,  Next: Regs and Memory,  Prev: Machine Modes,  Up: RTL
*************** File: gccint.info,  Node: Constants,  Ne
*** 15109,15273 ****
  
  The simplest RTL expressions are those that represent constant values.
  
! `(const_int I)'
       This type of expression represents the integer value I.  I is
!      customarily accessed with the macro `INTVAL' as in `INTVAL (EXP)',
!      which is equivalent to `XWINT (EXP, 0)'.
  
       Constants generated for modes with fewer bits than in
!      `HOST_WIDE_INT' must be sign extended to full width (e.g., with
!      `gen_int_mode').  For constants for modes with more bits than in
!      `HOST_WIDE_INT' the implied high order bits of that constant are
       copies of the top bit.  Note however that values are neither
       inherently signed nor inherently unsigned; where necessary,
       signedness is determined by the rtl operation instead.
  
       There is only one expression object for the integer value zero; it
!      is the value of the variable `const0_rtx'.  Likewise, the only
!      expression for integer value one is found in `const1_rtx', the only
!      expression for integer value two is found in `const2_rtx', and the
       only expression for integer value negative one is found in
!      `constm1_rtx'.  Any attempt to create an expression of code
!      `const_int' and value zero, one, two or negative one will return
!      `const0_rtx', `const1_rtx', `const2_rtx' or `constm1_rtx' as
       appropriate.
  
       Similarly, there is only one object for the integer whose value is
!      `STORE_FLAG_VALUE'.  It is found in `const_true_rtx'.  If
!      `STORE_FLAG_VALUE' is one, `const_true_rtx' and `const1_rtx' will
!      point to the same object.  If `STORE_FLAG_VALUE' is -1,
!      `const_true_rtx' and `constm1_rtx' will point to the same object.
  
! `(const_double:M I0 I1 ...)'
       This represents either a floating-point constant of mode M or (on
!      older ports that do not define `TARGET_SUPPORTS_WIDE_INT') an
!      integer constant too large to fit into `HOST_BITS_PER_WIDE_INT'
       bits but small enough to fit within twice that number of bits.  In
!      the latter case, M will be `VOIDmode'.  For integral values
       constants for modes with more bits than twice the number in
!      `HOST_WIDE_INT' the implied high order bits of that constant are
!      copies of the top bit of `CONST_DOUBLE_HIGH'.  Note however that
       integral values are neither inherently signed nor inherently
       unsigned; where necessary, signedness is determined by the rtl
       operation instead.
  
!      On more modern ports, `CONST_DOUBLE' only represents floating
!      point values.  New ports define `TARGET_SUPPORTS_WIDE_INT' to make
!      this designation.
  
!      If M is `VOIDmode', the bits of the value are stored in I0 and I1.
!      I0 is customarily accessed with the macro `CONST_DOUBLE_LOW' and
!      I1 with `CONST_DOUBLE_HIGH'.
  
       If the constant is floating point (regardless of its precision),
       then the number of integers used to store the value depends on the
!      size of `REAL_VALUE_TYPE' (*note Floating Point::).  The integers
       represent a floating point number, but not precisely in the target
!      machine's or host machine's floating point format.  To convert
!      them to the precise bit pattern used by the target machine, use
!      the macro `REAL_VALUE_TO_TARGET_DOUBLE' and friends (*note Data
       Output::).
  
! `(const_wide_int:M NUNITS ELT0 ...)'
!      This contains an array of `HOST_WIDE_INT's that is large enough to
       hold any constant that can be represented on the target.  This form
       of rtl is only used on targets that define
!      `TARGET_SUPPORTS_WIDE_INT' to be nonzero and then `CONST_DOUBLE's
       are only used to hold floating-point values.  If the target leaves
!      `TARGET_SUPPORTS_WIDE_INT' defined as 0, `CONST_WIDE_INT's are not
!      used and `CONST_DOUBLE's are as they were before.
  
       The values are stored in a compressed format.  The higher-order 0s
       or -1s are not represented if they are just the logical sign
       extension of the number that is represented.
  
! `CONST_WIDE_INT_VEC (CODE)'
!      Returns the entire array of `HOST_WIDE_INT's that are used to
!      store the value.  This macro should be rarely used.
  
! `CONST_WIDE_INT_NUNITS (CODE)'
!      The number of `HOST_WIDE_INT's used to represent the number.  Note
!      that this generally is smaller than the number of `HOST_WIDE_INT's
       implied by the mode size.
  
! `CONST_WIDE_INT_NUNITS (CODE,I)'
!      Returns the `i'th element of the array.   Element 0 is contains
!      the low order bits of the constant.
  
! `(const_fixed:M ...)'
!      Represents a fixed-point constant of mode M.  The operand is a
!      data structure of type `struct fixed_value' and is accessed with
!      the macro `CONST_FIXED_VALUE'.  The high part of data is accessed
!      with `CONST_FIXED_VALUE_HIGH'; the low part is accessed with
!      `CONST_FIXED_VALUE_LOW'.
  
! `(const_vector:M [X0 X1 ...])'
       Represents a vector constant.  The square brackets stand for the
       vector containing the constant elements.  X0, X1 and so on are the
!      `const_int', `const_double' or `const_fixed' elements.
  
!      The number of units in a `const_vector' is obtained with the macro
!      `CONST_VECTOR_NUNITS' as in `CONST_VECTOR_NUNITS (V)'.
  
       Individual elements in a vector constant are accessed with the
!      macro `CONST_VECTOR_ELT' as in `CONST_VECTOR_ELT (V, N)' where V
!      is the vector constant and N is the element desired.
  
! `(const_string STR)'
       Represents a constant string with value STR.  Currently this is
       used only for insn attributes (*note Insn Attributes::) since
       constant strings in C are placed in memory.
  
! `(symbol_ref:MODE SYMBOL)'
       Represents the value of an assembler label for data.  SYMBOL is a
       string that describes the name of the assembler label.  If it
!      starts with a `*', the label is the rest of SYMBOL not including
!      the `*'.  Otherwise, the label is SYMBOL, usually prefixed with
!      `_'.
  
!      The `symbol_ref' contains a mode, which is usually `Pmode'.
       Usually that is the only mode for which a symbol is directly valid.
  
! `(label_ref:MODE LABEL)'
       Represents the value of an assembler label for code.  It contains
!      one operand, an expression, which must be a `code_label' or a
!      `note' of type `NOTE_INSN_DELETED_LABEL' that appears in the
       instruction sequence to identify the place where the label should
       go.
  
       The reason for using a distinct expression type for code label
       references is so that jump optimization can distinguish them.
  
!      The `label_ref' contains a mode, which is usually `Pmode'.
!      Usually that is the only mode for which a label is directly valid.
  
! `(const:M EXP)'
       Represents a constant that is the result of an assembly-time
       arithmetic computation.  The operand, EXP, is an expression that
!      contains only constants (`const_int', `symbol_ref' and `label_ref'
!      expressions) combined with `plus' and `minus'.  However, not all
       combinations are valid, since the assembler cannot do arbitrary
       arithmetic on relocatable symbols.
  
!      M should be `Pmode'.
  
! `(high:M EXP)'
!      Represents the high-order bits of EXP, usually a `symbol_ref'.
!      The number of bits is machine-dependent and is normally the number
!      of bits specified in an instruction that initializes the high
!      order bits of a register.  It is used with `lo_sum' to represent
!      the typical two-instruction sequence used in RISC machines to
!      reference a global memory location.
  
!      M should be `Pmode'.
  
!  The macro `CONST0_RTX (MODE)' refers to an expression with value 0 in
! mode MODE.  If mode MODE is of mode class `MODE_INT', it returns
! `const0_rtx'.  If mode MODE is of mode class `MODE_FLOAT', it returns a
! `CONST_DOUBLE' expression in mode MODE.  Otherwise, it returns a
! `CONST_VECTOR' expression in mode MODE.  Similarly, the macro
! `CONST1_RTX (MODE)' refers to an expression with value 1 in mode MODE
! and similarly for `CONST2_RTX'.  The `CONST1_RTX' and `CONST2_RTX'
  macros are undefined for vector modes.
  
  
--- 14962,15126 ----
  
  The simplest RTL expressions are those that represent constant values.
  
! '(const_int I)'
       This type of expression represents the integer value I.  I is
!      customarily accessed with the macro 'INTVAL' as in 'INTVAL (EXP)',
!      which is equivalent to 'XWINT (EXP, 0)'.
  
       Constants generated for modes with fewer bits than in
!      'HOST_WIDE_INT' must be sign extended to full width (e.g., with
!      'gen_int_mode').  For constants for modes with more bits than in
!      'HOST_WIDE_INT' the implied high order bits of that constant are
       copies of the top bit.  Note however that values are neither
       inherently signed nor inherently unsigned; where necessary,
       signedness is determined by the rtl operation instead.
  
       There is only one expression object for the integer value zero; it
!      is the value of the variable 'const0_rtx'.  Likewise, the only
!      expression for integer value one is found in 'const1_rtx', the only
!      expression for integer value two is found in 'const2_rtx', and the
       only expression for integer value negative one is found in
!      'constm1_rtx'.  Any attempt to create an expression of code
!      'const_int' and value zero, one, two or negative one will return
!      'const0_rtx', 'const1_rtx', 'const2_rtx' or 'constm1_rtx' as
       appropriate.
  
       Similarly, there is only one object for the integer whose value is
!      'STORE_FLAG_VALUE'.  It is found in 'const_true_rtx'.  If
!      'STORE_FLAG_VALUE' is one, 'const_true_rtx' and 'const1_rtx' will
!      point to the same object.  If 'STORE_FLAG_VALUE' is -1,
!      'const_true_rtx' and 'constm1_rtx' will point to the same object.
  
! '(const_double:M I0 I1 ...)'
       This represents either a floating-point constant of mode M or (on
!      older ports that do not define 'TARGET_SUPPORTS_WIDE_INT') an
!      integer constant too large to fit into 'HOST_BITS_PER_WIDE_INT'
       bits but small enough to fit within twice that number of bits.  In
!      the latter case, M will be 'VOIDmode'.  For integral values
       constants for modes with more bits than twice the number in
!      'HOST_WIDE_INT' the implied high order bits of that constant are
!      copies of the top bit of 'CONST_DOUBLE_HIGH'.  Note however that
       integral values are neither inherently signed nor inherently
       unsigned; where necessary, signedness is determined by the rtl
       operation instead.
  
!      On more modern ports, 'CONST_DOUBLE' only represents floating point
!      values.  New ports define 'TARGET_SUPPORTS_WIDE_INT' to make this
!      designation.
  
!      If M is 'VOIDmode', the bits of the value are stored in I0 and I1.
!      I0 is customarily accessed with the macro 'CONST_DOUBLE_LOW' and I1
!      with 'CONST_DOUBLE_HIGH'.
  
       If the constant is floating point (regardless of its precision),
       then the number of integers used to store the value depends on the
!      size of 'REAL_VALUE_TYPE' (*note Floating Point::).  The integers
       represent a floating point number, but not precisely in the target
!      machine's or host machine's floating point format.  To convert them
!      to the precise bit pattern used by the target machine, use the
!      macro 'REAL_VALUE_TO_TARGET_DOUBLE' and friends (*note Data
       Output::).
  
! '(const_wide_int:M NUNITS ELT0 ...)'
!      This contains an array of 'HOST_WIDE_INT's that is large enough to
       hold any constant that can be represented on the target.  This form
       of rtl is only used on targets that define
!      'TARGET_SUPPORTS_WIDE_INT' to be nonzero and then 'CONST_DOUBLE's
       are only used to hold floating-point values.  If the target leaves
!      'TARGET_SUPPORTS_WIDE_INT' defined as 0, 'CONST_WIDE_INT's are not
!      used and 'CONST_DOUBLE's are as they were before.
  
       The values are stored in a compressed format.  The higher-order 0s
       or -1s are not represented if they are just the logical sign
       extension of the number that is represented.
  
! 'CONST_WIDE_INT_VEC (CODE)'
!      Returns the entire array of 'HOST_WIDE_INT's that are used to store
!      the value.  This macro should be rarely used.
  
! 'CONST_WIDE_INT_NUNITS (CODE)'
!      The number of 'HOST_WIDE_INT's used to represent the number.  Note
!      that this generally is smaller than the number of 'HOST_WIDE_INT's
       implied by the mode size.
  
! 'CONST_WIDE_INT_NUNITS (CODE,I)'
!      Returns the 'i'th element of the array.  Element 0 is contains the
!      low order bits of the constant.
  
! '(const_fixed:M ...)'
!      Represents a fixed-point constant of mode M.  The operand is a data
!      structure of type 'struct fixed_value' and is accessed with the
!      macro 'CONST_FIXED_VALUE'.  The high part of data is accessed with
!      'CONST_FIXED_VALUE_HIGH'; the low part is accessed with
!      'CONST_FIXED_VALUE_LOW'.
  
! '(const_vector:M [X0 X1 ...])'
       Represents a vector constant.  The square brackets stand for the
       vector containing the constant elements.  X0, X1 and so on are the
!      'const_int', 'const_double' or 'const_fixed' elements.
  
!      The number of units in a 'const_vector' is obtained with the macro
!      'CONST_VECTOR_NUNITS' as in 'CONST_VECTOR_NUNITS (V)'.
  
       Individual elements in a vector constant are accessed with the
!      macro 'CONST_VECTOR_ELT' as in 'CONST_VECTOR_ELT (V, N)' where V is
!      the vector constant and N is the element desired.
  
! '(const_string STR)'
       Represents a constant string with value STR.  Currently this is
       used only for insn attributes (*note Insn Attributes::) since
       constant strings in C are placed in memory.
  
! '(symbol_ref:MODE SYMBOL)'
       Represents the value of an assembler label for data.  SYMBOL is a
       string that describes the name of the assembler label.  If it
!      starts with a '*', the label is the rest of SYMBOL not including
!      the '*'.  Otherwise, the label is SYMBOL, usually prefixed with
!      '_'.
  
!      The 'symbol_ref' contains a mode, which is usually 'Pmode'.
       Usually that is the only mode for which a symbol is directly valid.
  
! '(label_ref:MODE LABEL)'
       Represents the value of an assembler label for code.  It contains
!      one operand, an expression, which must be a 'code_label' or a
!      'note' of type 'NOTE_INSN_DELETED_LABEL' that appears in the
       instruction sequence to identify the place where the label should
       go.
  
       The reason for using a distinct expression type for code label
       references is so that jump optimization can distinguish them.
  
!      The 'label_ref' contains a mode, which is usually 'Pmode'.  Usually
!      that is the only mode for which a label is directly valid.
  
! '(const:M EXP)'
       Represents a constant that is the result of an assembly-time
       arithmetic computation.  The operand, EXP, is an expression that
!      contains only constants ('const_int', 'symbol_ref' and 'label_ref'
!      expressions) combined with 'plus' and 'minus'.  However, not all
       combinations are valid, since the assembler cannot do arbitrary
       arithmetic on relocatable symbols.
  
!      M should be 'Pmode'.
  
! '(high:M EXP)'
!      Represents the high-order bits of EXP, usually a 'symbol_ref'.  The
!      number of bits is machine-dependent and is normally the number of
!      bits specified in an instruction that initializes the high order
!      bits of a register.  It is used with 'lo_sum' to represent the
!      typical two-instruction sequence used in RISC machines to reference
!      a global memory location.
  
!      M should be 'Pmode'.
  
!  The macro 'CONST0_RTX (MODE)' refers to an expression with value 0 in
! mode MODE.  If mode MODE is of mode class 'MODE_INT', it returns
! 'const0_rtx'.  If mode MODE is of mode class 'MODE_FLOAT', it returns a
! 'CONST_DOUBLE' expression in mode MODE.  Otherwise, it returns a
! 'CONST_VECTOR' expression in mode MODE.  Similarly, the macro
! 'CONST1_RTX (MODE)' refers to an expression with value 1 in mode MODE
! and similarly for 'CONST2_RTX'.  The 'CONST1_RTX' and 'CONST2_RTX'
  macros are undefined for vector modes.
  
  
*************** File: gccint.info,  Node: Regs and Memor
*** 15279,15287 ****
  Here are the RTL expression types for describing access to machine
  registers and to main memory.
  
! `(reg:M N)'
       For small values of the integer N (those that are less than
!      `FIRST_PSEUDO_REGISTER'), this stands for a reference to machine
       register number N: a "hard register".  For larger values of N, it
       stands for a temporary value or "pseudo register".  The compiler's
       strategy is to generate code assuming an unlimited number of such
--- 15132,15140 ----
  Here are the RTL expression types for describing access to machine
  registers and to main memory.
  
! '(reg:M N)'
       For small values of the integer N (those that are less than
!      'FIRST_PSEUDO_REGISTER'), this stands for a reference to machine
       register number N: a "hard register".  For larger values of N, it
       stands for a temporary value or "pseudo register".  The compiler's
       strategy is to generate code assuming an unlimited number of such
*************** registers and to main memory.
*** 15298,15304 ****
       Even for a register that the machine can access in only one mode,
       the mode must always be specified.
  
!      The symbol `FIRST_PSEUDO_REGISTER' is defined by the machine
       description, since the number of hard registers on the machine is
       an invariant characteristic of the machine.  Note, however, that
       not all of the machine registers must be general registers.  All
--- 15151,15157 ----
       Even for a register that the machine can access in only one mode,
       the mode must always be specified.
  
!      The symbol 'FIRST_PSEUDO_REGISTER' is defined by the machine
       description, since the number of hard registers on the machine is
       an invariant characteristic of the machine.  Note, however, that
       not all of the machine registers must be general registers.  All
*************** registers and to main memory.
*** 15309,15452 ****
       A hard register may be accessed in various modes throughout one
       function, but each pseudo register is given a natural mode and is
       accessed only in that mode.  When it is necessary to describe an
!      access to a pseudo register using a nonnatural mode, a `subreg'
       expression is used.
  
!      A `reg' expression with a machine mode that specifies more than
!      one word of data may actually stand for several consecutive
!      registers.  If in addition the register number specifies a
!      hardware register, then it actually represents several consecutive
!      hardware registers starting with the specified one.
  
       Each pseudo register number used in a function's RTL code is
!      represented by a unique `reg' expression.
  
       Some pseudo register numbers, those within the range of
!      `FIRST_VIRTUAL_REGISTER' to `LAST_VIRTUAL_REGISTER' only appear
       during the RTL generation phase and are eliminated before the
       optimization phases.  These represent locations in the stack frame
!      that cannot be determined until RTL generation for the function
!      has been completed.  The following virtual register numbers are
       defined:
  
!     `VIRTUAL_INCOMING_ARGS_REGNUM'
!           This points to the first word of the incoming arguments
!           passed on the stack.  Normally these arguments are placed
!           there by the caller, but the callee may have pushed some
!           arguments that were previously passed in registers.
  
            When RTL generation is complete, this virtual register is
            replaced by the sum of the register given by
!           `ARG_POINTER_REGNUM' and the value of `FIRST_PARM_OFFSET'.
  
!     `VIRTUAL_STACK_VARS_REGNUM'
!           If `FRAME_GROWS_DOWNWARD' is defined to a nonzero value, this
            points to immediately above the first variable on the stack.
            Otherwise, it points to the first variable on the stack.
  
!           `VIRTUAL_STACK_VARS_REGNUM' is replaced with the sum of the
!           register given by `FRAME_POINTER_REGNUM' and the value
!           `STARTING_FRAME_OFFSET'.
  
!     `VIRTUAL_STACK_DYNAMIC_REGNUM'
!           This points to the location of dynamically allocated memory
!           on the stack immediately after the stack pointer has been
            adjusted by the amount of memory desired.
  
            This virtual register is replaced by the sum of the register
!           given by `STACK_POINTER_REGNUM' and the value
!           `STACK_DYNAMIC_OFFSET'.
  
!     `VIRTUAL_OUTGOING_ARGS_REGNUM'
            This points to the location in the stack at which outgoing
            arguments should be written when the stack is pre-pushed
            (arguments pushed using push insns should always use
!           `STACK_POINTER_REGNUM').
  
            This virtual register is replaced by the sum of the register
!           given by `STACK_POINTER_REGNUM' and the value
!           `STACK_POINTER_OFFSET'.
  
! `(subreg:M1 REG:M2 BYTENUM)'
!      `subreg' expressions are used to refer to a register in a machine
       mode other than its natural one, or to refer to one register of a
!      multi-part `reg' that actually refers to several registers.
  
       Each pseudo register has a natural mode.  If it is necessary to
!      operate on it in a different mode, the register must be enclosed
!      in a `subreg'.
  
       There are currently three supported types for the first operand of
!      a `subreg':
!         * pseudo registers This is the most common case.  Most
!           `subreg's have pseudo `reg's as their first operand.
  
!         * mem `subreg's of `mem' were common in earlier versions of GCC
            and are still supported.  During the reload pass these are
!           replaced by plain `mem's.  On machines that do not do
!           instruction scheduling, use of `subreg's of `mem' are still
!           used, but this is no longer recommended.  Such `subreg's are
!           considered to be `register_operand's rather than
!           `memory_operand's before and during reload.  Because of this,
            the scheduling passes cannot properly schedule instructions
!           with `subreg's of `mem', so for machines that do scheduling,
!           `subreg's of `mem' should never be used.  To support this,
!           the combine and recog passes have explicit code to inhibit
!           the creation of `subreg's of `mem' when `INSN_SCHEDULING' is
            defined.
  
!           The use of `subreg's of `mem' after the reload pass is an area
            that is not well understood and should be avoided.  There is
!           still some code in the compiler to support this, but this
!           code has possibly rotted.  This use of `subreg's is
!           discouraged and will most likely not be supported in the
!           future.
  
          * hard registers It is seldom necessary to wrap hard registers
!           in `subreg's; such registers would normally reduce to a
!           single `reg' rtx.  This use of `subreg's is discouraged and
!           may not be supported in the future.
! 
  
!      `subreg's of `subreg's are not supported.  Using
!      `simplify_gen_subreg' is the recommended way to avoid this problem.
  
!      `subreg's come in two distinct flavors, each having its own usage
       and rules:
  
!     Paradoxical subregs
!           When M1 is strictly wider than M2, the `subreg' expression is
            called "paradoxical".  The canonical test for this class of
!           `subreg' is:
  
                 GET_MODE_SIZE (M1) > GET_MODE_SIZE (M2)
  
!           Paradoxical `subreg's can be used as both lvalues and rvalues.
            When used as an lvalue, the low-order bits of the source value
!           are stored in REG and the high-order bits are discarded.
!           When used as an rvalue, the low-order bits of the `subreg' are
            taken from REG while the high-order bits may or may not be
            defined.
  
            The high-order bits of rvalues are in the following
            circumstances:
  
!              * `subreg's of `mem' When M2 is smaller than a word, the
!                macro `LOAD_EXTEND_OP', can control how the high-order
                 bits are defined.
  
!              * `subreg' of `reg's The upper bits are defined when
!                `SUBREG_PROMOTED_VAR_P' is true.
!                `SUBREG_PROMOTED_UNSIGNED_P' describes what the upper
                 bits hold.  Such subregs usually represent local
                 variables, register variables and parameter pseudo
                 variables that have been promoted to a wider mode.
  
! 
!           BYTENUM is always zero for a paradoxical `subreg', even on
            big-endian targets.
  
!           For example, the paradoxical `subreg':
  
                 (set (subreg:SI (reg:HI X) 0) Y)
  
--- 15162,15303 ----
       A hard register may be accessed in various modes throughout one
       function, but each pseudo register is given a natural mode and is
       accessed only in that mode.  When it is necessary to describe an
!      access to a pseudo register using a nonnatural mode, a 'subreg'
       expression is used.
  
!      A 'reg' expression with a machine mode that specifies more than one
!      word of data may actually stand for several consecutive registers.
!      If in addition the register number specifies a hardware register,
!      then it actually represents several consecutive hardware registers
!      starting with the specified one.
  
       Each pseudo register number used in a function's RTL code is
!      represented by a unique 'reg' expression.
  
       Some pseudo register numbers, those within the range of
!      'FIRST_VIRTUAL_REGISTER' to 'LAST_VIRTUAL_REGISTER' only appear
       during the RTL generation phase and are eliminated before the
       optimization phases.  These represent locations in the stack frame
!      that cannot be determined until RTL generation for the function has
!      been completed.  The following virtual register numbers are
       defined:
  
!      'VIRTUAL_INCOMING_ARGS_REGNUM'
!           This points to the first word of the incoming arguments passed
!           on the stack.  Normally these arguments are placed there by
!           the caller, but the callee may have pushed some arguments that
!           were previously passed in registers.
  
            When RTL generation is complete, this virtual register is
            replaced by the sum of the register given by
!           'ARG_POINTER_REGNUM' and the value of 'FIRST_PARM_OFFSET'.
  
!      'VIRTUAL_STACK_VARS_REGNUM'
!           If 'FRAME_GROWS_DOWNWARD' is defined to a nonzero value, this
            points to immediately above the first variable on the stack.
            Otherwise, it points to the first variable on the stack.
  
!           'VIRTUAL_STACK_VARS_REGNUM' is replaced with the sum of the
!           register given by 'FRAME_POINTER_REGNUM' and the value
!           'STARTING_FRAME_OFFSET'.
  
!      'VIRTUAL_STACK_DYNAMIC_REGNUM'
!           This points to the location of dynamically allocated memory on
!           the stack immediately after the stack pointer has been
            adjusted by the amount of memory desired.
  
            This virtual register is replaced by the sum of the register
!           given by 'STACK_POINTER_REGNUM' and the value
!           'STACK_DYNAMIC_OFFSET'.
  
!      'VIRTUAL_OUTGOING_ARGS_REGNUM'
            This points to the location in the stack at which outgoing
            arguments should be written when the stack is pre-pushed
            (arguments pushed using push insns should always use
!           'STACK_POINTER_REGNUM').
  
            This virtual register is replaced by the sum of the register
!           given by 'STACK_POINTER_REGNUM' and the value
!           'STACK_POINTER_OFFSET'.
  
! '(subreg:M1 REG:M2 BYTENUM)'
! 
!      'subreg' expressions are used to refer to a register in a machine
       mode other than its natural one, or to refer to one register of a
!      multi-part 'reg' that actually refers to several registers.
  
       Each pseudo register has a natural mode.  If it is necessary to
!      operate on it in a different mode, the register must be enclosed in
!      a 'subreg'.
  
       There are currently three supported types for the first operand of
!      a 'subreg':
!         * pseudo registers This is the most common case.  Most 'subreg's
!           have pseudo 'reg's as their first operand.
  
!         * mem 'subreg's of 'mem' were common in earlier versions of GCC
            and are still supported.  During the reload pass these are
!           replaced by plain 'mem's.  On machines that do not do
!           instruction scheduling, use of 'subreg's of 'mem' are still
!           used, but this is no longer recommended.  Such 'subreg's are
!           considered to be 'register_operand's rather than
!           'memory_operand's before and during reload.  Because of this,
            the scheduling passes cannot properly schedule instructions
!           with 'subreg's of 'mem', so for machines that do scheduling,
!           'subreg's of 'mem' should never be used.  To support this, the
!           combine and recog passes have explicit code to inhibit the
!           creation of 'subreg's of 'mem' when 'INSN_SCHEDULING' is
            defined.
  
!           The use of 'subreg's of 'mem' after the reload pass is an area
            that is not well understood and should be avoided.  There is
!           still some code in the compiler to support this, but this code
!           has possibly rotted.  This use of 'subreg's is discouraged and
!           will most likely not be supported in the future.
  
          * hard registers It is seldom necessary to wrap hard registers
!           in 'subreg's; such registers would normally reduce to a single
!           'reg' rtx.  This use of 'subreg's is discouraged and may not
!           be supported in the future.
  
!      'subreg's of 'subreg's are not supported.  Using
!      'simplify_gen_subreg' is the recommended way to avoid this problem.
  
!      'subreg's come in two distinct flavors, each having its own usage
       and rules:
  
!      Paradoxical subregs
!           When M1 is strictly wider than M2, the 'subreg' expression is
            called "paradoxical".  The canonical test for this class of
!           'subreg' is:
  
                 GET_MODE_SIZE (M1) > GET_MODE_SIZE (M2)
  
!           Paradoxical 'subreg's can be used as both lvalues and rvalues.
            When used as an lvalue, the low-order bits of the source value
!           are stored in REG and the high-order bits are discarded.  When
!           used as an rvalue, the low-order bits of the 'subreg' are
            taken from REG while the high-order bits may or may not be
            defined.
  
            The high-order bits of rvalues are in the following
            circumstances:
  
!              * 'subreg's of 'mem' When M2 is smaller than a word, the
!                macro 'LOAD_EXTEND_OP', can control how the high-order
                 bits are defined.
  
!              * 'subreg' of 'reg's The upper bits are defined when
!                'SUBREG_PROMOTED_VAR_P' is true.
!                'SUBREG_PROMOTED_UNSIGNED_P' describes what the upper
                 bits hold.  Such subregs usually represent local
                 variables, register variables and parameter pseudo
                 variables that have been promoted to a wider mode.
  
!           BYTENUM is always zero for a paradoxical 'subreg', even on
            big-endian targets.
  
!           For example, the paradoxical 'subreg':
  
                 (set (subreg:SI (reg:HI X) 0) Y)
  
*************** registers and to main memory.
*** 15456,15583 ****
                 (set Z (subreg:SI (reg:HI X) 0))
  
            would set the lower two bytes of Z to Y and set the upper two
!           bytes to an unknown value assuming `SUBREG_PROMOTED_VAR_P' is
            false.
  
!     Normal subregs
!           When M1 is at least as narrow as M2 the `subreg' expression
!           is called "normal".
  
!           Normal `subreg's restrict consideration to certain bits of
            REG.  There are two cases.  If M1 is smaller than a word, the
!           `subreg' refers to the least-significant part (or "lowpart")
            of one word of REG.  If M1 is word-sized or greater, the
!           `subreg' refers to one or more complete words.
  
!           When used as an lvalue, `subreg' is a word-based accessor.
!           Storing to a `subreg' modifies all the words of REG that
!           overlap the `subreg', but it leaves the other words of REG
            alone.
  
!           When storing to a normal `subreg' that is smaller than a word,
            the other bits of the referenced word are usually left in an
            undefined state.  This laxity makes it easier to generate
            efficient code for such instructions.  To represent an
            instruction that preserves all the bits outside of those in
!           the `subreg', use `strict_low_part' or `zero_extract' around
!           the `subreg'.
  
            BYTENUM must identify the offset of the first byte of the
!           `subreg' from the start of REG, assuming that REG is laid out
            in memory order.  The memory order of bytes is defined by two
!           target macros, `WORDS_BIG_ENDIAN' and `BYTES_BIG_ENDIAN':
  
!              * `WORDS_BIG_ENDIAN', if set to 1, says that byte number
                 zero is part of the most significant word; otherwise, it
                 is part of the least significant word.
  
!              * `BYTES_BIG_ENDIAN', if set to 1, says that byte number
                 zero is the most significant byte within a word;
                 otherwise, it is the least significant byte within a
                 word.
  
!           On a few targets, `FLOAT_WORDS_BIG_ENDIAN' disagrees with
!           `WORDS_BIG_ENDIAN'.  However, most parts of the compiler treat
            floating point values as if they had the same endianness as
!           integer values.  This works because they handle them solely
!           as a collection of integer values, with no particular
!           numerical value.  Only real.c and the runtime libraries care
!           about `FLOAT_WORDS_BIG_ENDIAN'.
  
            Thus,
  
                 (subreg:HI (reg:SI X) 2)
  
!           on a `BYTES_BIG_ENDIAN', `UNITS_PER_WORD == 4' target is the
            same as
  
                 (subreg:HI (reg:SI X) 0)
  
!           on a little-endian, `UNITS_PER_WORD == 4' target.  Both
!           `subreg's access the lower two bytes of register X.
! 
  
!      A `MODE_PARTIAL_INT' mode behaves as if it were as wide as the
!      corresponding `MODE_INT' mode, except that it has an unknown
!      number of undefined bits.  For example:
  
            (subreg:PSI (reg:SI 0) 0)
  
!      accesses the whole of `(reg:SI 0)', but the exact relationship
!      between the `PSImode' value and the `SImode' value is not defined.
!      If we assume `UNITS_PER_WORD <= 4', then the following two
!      `subreg's:
  
            (subreg:PSI (reg:DI 0) 0)
            (subreg:PSI (reg:DI 0) 4)
  
!      represent independent 4-byte accesses to the two halves of
!      `(reg:DI 0)'.  Both `subreg's have an unknown number of undefined
!      bits.
  
!      If `UNITS_PER_WORD <= 2' then these two `subreg's:
  
            (subreg:HI (reg:PSI 0) 0)
            (subreg:HI (reg:PSI 0) 2)
  
       represent independent 2-byte accesses that together span the whole
!      of `(reg:PSI 0)'.  Storing to the first `subreg' does not affect
!      the value of the second, and vice versa.  `(reg:PSI 0)' has an
       unknown number of undefined bits, so the assignment:
  
            (set (subreg:HI (reg:PSI 0) 0) (reg:HI 4))
  
!      does not guarantee that `(subreg:HI (reg:PSI 0) 0)' has the value
!      `(reg:HI 4)'.
  
       The rules above apply to both pseudo REGs and hard REGs.  If the
!      semantics are not correct for particular combinations of M1, M2
!      and hard REG, the target-specific code must ensure that those
       combinations are never used.  For example:
  
            CANNOT_CHANGE_MODE_CLASS (M2, M1, CLASS)
  
       must be true for every class CLASS that includes REG.
  
!      The first operand of a `subreg' expression is customarily accessed
!      with the `SUBREG_REG' macro and the second operand is customarily
!      accessed with the `SUBREG_BYTE' macro.
  
       It has been several years since a platform in which
!      `BYTES_BIG_ENDIAN' not equal to `WORDS_BIG_ENDIAN' has been
!      tested.  Anyone wishing to support such a platform in the future
!      may be confronted with code rot.
  
! `(scratch:M)'
       This represents a scratch register that will be required for the
       execution of a single instruction and not used subsequently.  It is
!      converted into a `reg' by either the local register allocator or
       the reload pass.
  
!      `scratch' is usually present inside a `clobber' operation (*note
       Side Effects::).
  
! `(cc0)'
       This refers to the machine's condition code register.  It has no
       operands and may not have a machine mode.  There are two ways to
       use it:
--- 15307,15432 ----
                 (set Z (subreg:SI (reg:HI X) 0))
  
            would set the lower two bytes of Z to Y and set the upper two
!           bytes to an unknown value assuming 'SUBREG_PROMOTED_VAR_P' is
            false.
  
!      Normal subregs
!           When M1 is at least as narrow as M2 the 'subreg' expression is
!           called "normal".
  
!           Normal 'subreg's restrict consideration to certain bits of
            REG.  There are two cases.  If M1 is smaller than a word, the
!           'subreg' refers to the least-significant part (or "lowpart")
            of one word of REG.  If M1 is word-sized or greater, the
!           'subreg' refers to one or more complete words.
  
!           When used as an lvalue, 'subreg' is a word-based accessor.
!           Storing to a 'subreg' modifies all the words of REG that
!           overlap the 'subreg', but it leaves the other words of REG
            alone.
  
!           When storing to a normal 'subreg' that is smaller than a word,
            the other bits of the referenced word are usually left in an
            undefined state.  This laxity makes it easier to generate
            efficient code for such instructions.  To represent an
            instruction that preserves all the bits outside of those in
!           the 'subreg', use 'strict_low_part' or 'zero_extract' around
!           the 'subreg'.
  
            BYTENUM must identify the offset of the first byte of the
!           'subreg' from the start of REG, assuming that REG is laid out
            in memory order.  The memory order of bytes is defined by two
!           target macros, 'WORDS_BIG_ENDIAN' and 'BYTES_BIG_ENDIAN':
  
!              * 'WORDS_BIG_ENDIAN', if set to 1, says that byte number
                 zero is part of the most significant word; otherwise, it
                 is part of the least significant word.
  
!              * 'BYTES_BIG_ENDIAN', if set to 1, says that byte number
                 zero is the most significant byte within a word;
                 otherwise, it is the least significant byte within a
                 word.
  
!           On a few targets, 'FLOAT_WORDS_BIG_ENDIAN' disagrees with
!           'WORDS_BIG_ENDIAN'.  However, most parts of the compiler treat
            floating point values as if they had the same endianness as
!           integer values.  This works because they handle them solely as
!           a collection of integer values, with no particular numerical
!           value.  Only real.c and the runtime libraries care about
!           'FLOAT_WORDS_BIG_ENDIAN'.
  
            Thus,
  
                 (subreg:HI (reg:SI X) 2)
  
!           on a 'BYTES_BIG_ENDIAN', 'UNITS_PER_WORD == 4' target is the
            same as
  
                 (subreg:HI (reg:SI X) 0)
  
!           on a little-endian, 'UNITS_PER_WORD == 4' target.  Both
!           'subreg's access the lower two bytes of register X.
  
!      A 'MODE_PARTIAL_INT' mode behaves as if it were as wide as the
!      corresponding 'MODE_INT' mode, except that it has an unknown number
!      of undefined bits.  For example:
  
            (subreg:PSI (reg:SI 0) 0)
  
!      accesses the whole of '(reg:SI 0)', but the exact relationship
!      between the 'PSImode' value and the 'SImode' value is not defined.
!      If we assume 'UNITS_PER_WORD <= 4', then the following two
!      'subreg's:
  
            (subreg:PSI (reg:DI 0) 0)
            (subreg:PSI (reg:DI 0) 4)
  
!      represent independent 4-byte accesses to the two halves of '(reg:DI
!      0)'.  Both 'subreg's have an unknown number of undefined bits.
  
!      If 'UNITS_PER_WORD <= 2' then these two 'subreg's:
  
            (subreg:HI (reg:PSI 0) 0)
            (subreg:HI (reg:PSI 0) 2)
  
       represent independent 2-byte accesses that together span the whole
!      of '(reg:PSI 0)'.  Storing to the first 'subreg' does not affect
!      the value of the second, and vice versa.  '(reg:PSI 0)' has an
       unknown number of undefined bits, so the assignment:
  
            (set (subreg:HI (reg:PSI 0) 0) (reg:HI 4))
  
!      does not guarantee that '(subreg:HI (reg:PSI 0) 0)' has the value
!      '(reg:HI 4)'.
  
       The rules above apply to both pseudo REGs and hard REGs.  If the
!      semantics are not correct for particular combinations of M1, M2 and
!      hard REG, the target-specific code must ensure that those
       combinations are never used.  For example:
  
            CANNOT_CHANGE_MODE_CLASS (M2, M1, CLASS)
  
       must be true for every class CLASS that includes REG.
  
!      The first operand of a 'subreg' expression is customarily accessed
!      with the 'SUBREG_REG' macro and the second operand is customarily
!      accessed with the 'SUBREG_BYTE' macro.
  
       It has been several years since a platform in which
!      'BYTES_BIG_ENDIAN' not equal to 'WORDS_BIG_ENDIAN' has been tested.
!      Anyone wishing to support such a platform in the future may be
!      confronted with code rot.
  
! '(scratch:M)'
       This represents a scratch register that will be required for the
       execution of a single instruction and not used subsequently.  It is
!      converted into a 'reg' by either the local register allocator or
       the reload pass.
  
!      'scratch' is usually present inside a 'clobber' operation (*note
       Side Effects::).
  
! '(cc0)'
       This refers to the machine's condition code register.  It has no
       operands and may not have a machine mode.  There are two ways to
       use it:
*************** registers and to main memory.
*** 15586,15624 ****
            best on most machines, where each comparison sets the entire
            series of flags.
  
!           With this technique, `(cc0)' may be validly used in only two
            contexts: as the destination of an assignment (in test and
            compare instructions) and in comparison operators comparing
!           against zero (`const_int' with value zero; that is to say,
!           `const0_rtx').
  
          * To stand for a single flag that is the result of a single
!           condition.  This is useful on machines that have only a
!           single flag bit, and in which comparison instructions must
!           specify the condition to test.
  
!           With this technique, `(cc0)' may be validly used in only two
            contexts: as the destination of an assignment (in test and
            compare instructions) where the source is a comparison
!           operator, and as the first operand of `if_then_else' (in a
            conditional branch).
  
!      There is only one expression object of code `cc0'; it is the value
!      of the variable `cc0_rtx'.  Any attempt to create an expression of
!      code `cc0' will return `cc0_rtx'.
  
       Instructions can set the condition code implicitly.  On many
       machines, nearly all instructions set the condition code based on
       the value that they compute or store.  It is not necessary to
       record these actions explicitly in the RTL because the machine
       description includes a prescription for recognizing the
!      instructions that do so (by means of the macro
!      `NOTICE_UPDATE_CC').  *Note Condition Code::.  Only instructions
!      whose sole purpose is to set the condition code, and instructions
!      that use the condition code, need mention `(cc0)'.
  
       On some machines, the condition code register is given a register
!      number and a `reg' is used instead of `(cc0)'.  This is usually the
       preferable approach if only a small subset of instructions modify
       the condition code.  Other machines store condition codes in
       general registers; in such cases a pseudo register should be used.
--- 15435,15473 ----
            best on most machines, where each comparison sets the entire
            series of flags.
  
!           With this technique, '(cc0)' may be validly used in only two
            contexts: as the destination of an assignment (in test and
            compare instructions) and in comparison operators comparing
!           against zero ('const_int' with value zero; that is to say,
!           'const0_rtx').
  
          * To stand for a single flag that is the result of a single
!           condition.  This is useful on machines that have only a single
!           flag bit, and in which comparison instructions must specify
!           the condition to test.
  
!           With this technique, '(cc0)' may be validly used in only two
            contexts: as the destination of an assignment (in test and
            compare instructions) where the source is a comparison
!           operator, and as the first operand of 'if_then_else' (in a
            conditional branch).
  
!      There is only one expression object of code 'cc0'; it is the value
!      of the variable 'cc0_rtx'.  Any attempt to create an expression of
!      code 'cc0' will return 'cc0_rtx'.
  
       Instructions can set the condition code implicitly.  On many
       machines, nearly all instructions set the condition code based on
       the value that they compute or store.  It is not necessary to
       record these actions explicitly in the RTL because the machine
       description includes a prescription for recognizing the
!      instructions that do so (by means of the macro 'NOTICE_UPDATE_CC').
!      *Note Condition Code::.  Only instructions whose sole purpose is to
!      set the condition code, and instructions that use the condition
!      code, need mention '(cc0)'.
  
       On some machines, the condition code register is given a register
!      number and a 'reg' is used instead of '(cc0)'.  This is usually the
       preferable approach if only a small subset of instructions modify
       the condition code.  Other machines store condition codes in
       general registers; in such cases a pseudo register should be used.
*************** registers and to main memory.
*** 15628,15669 ****
       the condition code.  This is best handled by normally generating
       the instruction that does not set the condition code, and making a
       pattern that both performs the arithmetic and sets the condition
!      code register (which would not be `(cc0)' in this case).  For
!      examples, search for `addcc' and `andcc' in `sparc.md'.
  
! `(pc)'
       This represents the machine's program counter.  It has no operands
!      and may not have a machine mode.  `(pc)' may be validly used only
       in certain specific contexts in jump instructions.
  
!      There is only one expression object of code `pc'; it is the value
!      of the variable `pc_rtx'.  Any attempt to create an expression of
!      code `pc' will return `pc_rtx'.
  
       All instructions that do not jump alter the program counter
!      implicitly by incrementing it, but there is no need to mention
!      this in the RTL.
  
! `(mem:M ADDR ALIAS)'
       This RTX represents a reference to main memory at an address
       represented by the expression ADDR.  M specifies how large a unit
       of memory is accessed.  ALIAS specifies an alias set for the
       reference.  In general two items are in different alias sets if
       they cannot reference the same memory address.
  
!      The construct `(mem:BLK (scratch))' is considered to alias all
       other memories.  Thus it may be used as a memory barrier in
       epilogue stack deallocation patterns.
  
! `(concatM RTX RTX)'
       This RTX represents the concatenation of two other RTXs.  This is
!      used for complex values.  It should only appear in the RTL
!      attached to declarations and during RTL generation.  It should not
!      appear in the ordinary insn chain.
  
! `(concatnM [RTX ...])'
       This RTX represents the concatenation of all the RTX to make a
!      single value.  Like `concat', this should only appear in
       declarations, and not in the insn chain.
  
  
--- 15477,15518 ----
       the condition code.  This is best handled by normally generating
       the instruction that does not set the condition code, and making a
       pattern that both performs the arithmetic and sets the condition
!      code register (which would not be '(cc0)' in this case).  For
!      examples, search for 'addcc' and 'andcc' in 'sparc.md'.
  
! '(pc)'
       This represents the machine's program counter.  It has no operands
!      and may not have a machine mode.  '(pc)' may be validly used only
       in certain specific contexts in jump instructions.
  
!      There is only one expression object of code 'pc'; it is the value
!      of the variable 'pc_rtx'.  Any attempt to create an expression of
!      code 'pc' will return 'pc_rtx'.
  
       All instructions that do not jump alter the program counter
!      implicitly by incrementing it, but there is no need to mention this
!      in the RTL.
  
! '(mem:M ADDR ALIAS)'
       This RTX represents a reference to main memory at an address
       represented by the expression ADDR.  M specifies how large a unit
       of memory is accessed.  ALIAS specifies an alias set for the
       reference.  In general two items are in different alias sets if
       they cannot reference the same memory address.
  
!      The construct '(mem:BLK (scratch))' is considered to alias all
       other memories.  Thus it may be used as a memory barrier in
       epilogue stack deallocation patterns.
  
! '(concatM RTX RTX)'
       This RTX represents the concatenation of two other RTXs.  This is
!      used for complex values.  It should only appear in the RTL attached
!      to declarations and during RTL generation.  It should not appear in
!      the ordinary insn chain.
  
! '(concatnM [RTX ...])'
       This RTX represents the concatenation of all the RTX to make a
!      single value.  Like 'concat', this should only appear in
       declarations, and not in the insn chain.
  
  
*************** File: gccint.info,  Node: Arithmetic,  N
*** 15673,15770 ****
  ===================================
  
  Unless otherwise specified, all the operands of arithmetic expressions
! must be valid for mode M.  An operand is valid for mode M if it has
! mode M, or if it is a `const_int' or `const_double' and M is a mode of
! class `MODE_INT'.
  
   For commutative binary operations, constants should be placed in the
  second operand.
  
! `(plus:M X Y)'
! `(ss_plus:M X Y)'
! `(us_plus:M X Y)'
       These three expressions all represent the sum of the values
       represented by X and Y carried out in machine mode M.  They differ
!      in their behavior on overflow of integer modes.  `plus' wraps
!      round modulo the width of M; `ss_plus' saturates at the maximum
!      signed value representable in M; `us_plus' saturates at the
!      maximum unsigned value.
  
- `(lo_sum:M X Y)'
       This expression represents the sum of X and the low-order bits of
!      Y.  It is used with `high' (*note Constants::) to represent the
!      typical two-instruction sequence used in RISC machines to
!      reference a global memory location.
  
       The number of low order bits is machine-dependent but is normally
!      the number of bits in a `Pmode' item minus the number of bits set
!      by `high'.
  
!      M should be `Pmode'.
  
- `(minus:M X Y)'
- `(ss_minus:M X Y)'
- `(us_minus:M X Y)'
       These three expressions represent the result of subtracting Y from
       X, carried out in mode M.  Behavior on overflow is the same as for
!      the three variants of `plus' (see above).
  
! `(compare:M X Y)'
       Represents the result of subtracting Y from X for purposes of
       comparison.  The result is computed without overflow, as if with
       infinite precision.
  
       Of course, machines can't really subtract with infinite precision.
!      However, they can pretend to do so when only the sign of the
!      result will be used, which is the case when the result is stored
!      in the condition code.  And that is the _only_ way this kind of
!      expression may validly be used: as a value to be stored in the
!      condition codes, either `(cc0)' or a register.  *Note
!      Comparisons::.
  
       The mode M is not related to the modes of X and Y, but instead is
!      the mode of the condition code value.  If `(cc0)' is used, it is
!      `VOIDmode'.  Otherwise it is some mode in class `MODE_CC', often
!      `CCmode'.  *Note Condition Code::.  If M is `VOIDmode' or
!      `CCmode', the operation returns sufficient information (in an
!      unspecified format) so that any comparison operator can be applied
!      to the result of the `COMPARE' operation.  For other modes in
!      class `MODE_CC', the operation only returns a subset of this
!      information.
  
!      Normally, X and Y must have the same mode.  Otherwise, `compare'
!      is valid only if the mode of X is in class `MODE_INT' and Y is a
!      `const_int' or `const_double' with mode `VOIDmode'.  The mode of X
       determines what mode the comparison is to be done in; thus it must
!      not be `VOIDmode'.
  
       If one of the operands is a constant, it should be placed in the
       second operand and the comparison code adjusted as appropriate.
  
!      A `compare' specifying two `VOIDmode' constants is not valid since
       there is no way to know in what mode the comparison is to be
       performed; the comparison must either be folded during the
       compilation or the first operand must be loaded into a register
       while its mode is still known.
  
! `(neg:M X)'
! `(ss_neg:M X)'
! `(us_neg:M X)'
       These two expressions represent the negation (subtraction from
       zero) of the value represented by X, carried out in mode M.  They
       differ in the behavior on overflow of integer modes.  In the case
!      of `neg', the negation of the operand may be a number not
       representable in mode M, in which case it is truncated to M.
!      `ss_neg' and `us_neg' ensure that an out-of-bounds result
!      saturates to the maximum or minimum signed or unsigned value.
  
! `(mult:M X Y)'
! `(ss_mult:M X Y)'
! `(us_mult:M X Y)'
       Represents the signed product of the values represented by X and Y
!      carried out in machine mode M.  `ss_mult' and `us_mult' ensure
!      that an out-of-bounds result saturates to the maximum or minimum
!      signed or unsigned value.
  
       Some machines support a multiplication that generates a product
       wider than the operands.  Write the pattern for this as
--- 15522,15620 ----
  ===================================
  
  Unless otherwise specified, all the operands of arithmetic expressions
! must be valid for mode M.  An operand is valid for mode M if it has mode
! M, or if it is a 'const_int' or 'const_double' and M is a mode of class
! 'MODE_INT'.
  
   For commutative binary operations, constants should be placed in the
  second operand.
  
! '(plus:M X Y)'
! '(ss_plus:M X Y)'
! '(us_plus:M X Y)'
! 
       These three expressions all represent the sum of the values
       represented by X and Y carried out in machine mode M.  They differ
!      in their behavior on overflow of integer modes.  'plus' wraps round
!      modulo the width of M; 'ss_plus' saturates at the maximum signed
!      value representable in M; 'us_plus' saturates at the maximum
!      unsigned value.
! 
! '(lo_sum:M X Y)'
  
       This expression represents the sum of X and the low-order bits of
!      Y.  It is used with 'high' (*note Constants::) to represent the
!      typical two-instruction sequence used in RISC machines to reference
!      a global memory location.
  
       The number of low order bits is machine-dependent but is normally
!      the number of bits in a 'Pmode' item minus the number of bits set
!      by 'high'.
  
!      M should be 'Pmode'.
! 
! '(minus:M X Y)'
! '(ss_minus:M X Y)'
! '(us_minus:M X Y)'
  
       These three expressions represent the result of subtracting Y from
       X, carried out in mode M.  Behavior on overflow is the same as for
!      the three variants of 'plus' (see above).
  
! '(compare:M X Y)'
       Represents the result of subtracting Y from X for purposes of
       comparison.  The result is computed without overflow, as if with
       infinite precision.
  
       Of course, machines can't really subtract with infinite precision.
!      However, they can pretend to do so when only the sign of the result
!      will be used, which is the case when the result is stored in the
!      condition code.  And that is the _only_ way this kind of expression
!      may validly be used: as a value to be stored in the condition
!      codes, either '(cc0)' or a register.  *Note Comparisons::.
  
       The mode M is not related to the modes of X and Y, but instead is
!      the mode of the condition code value.  If '(cc0)' is used, it is
!      'VOIDmode'.  Otherwise it is some mode in class 'MODE_CC', often
!      'CCmode'.  *Note Condition Code::.  If M is 'VOIDmode' or 'CCmode',
!      the operation returns sufficient information (in an unspecified
!      format) so that any comparison operator can be applied to the
!      result of the 'COMPARE' operation.  For other modes in class
!      'MODE_CC', the operation only returns a subset of this information.
  
!      Normally, X and Y must have the same mode.  Otherwise, 'compare' is
!      valid only if the mode of X is in class 'MODE_INT' and Y is a
!      'const_int' or 'const_double' with mode 'VOIDmode'.  The mode of X
       determines what mode the comparison is to be done in; thus it must
!      not be 'VOIDmode'.
  
       If one of the operands is a constant, it should be placed in the
       second operand and the comparison code adjusted as appropriate.
  
!      A 'compare' specifying two 'VOIDmode' constants is not valid since
       there is no way to know in what mode the comparison is to be
       performed; the comparison must either be folded during the
       compilation or the first operand must be loaded into a register
       while its mode is still known.
  
! '(neg:M X)'
! '(ss_neg:M X)'
! '(us_neg:M X)'
       These two expressions represent the negation (subtraction from
       zero) of the value represented by X, carried out in mode M.  They
       differ in the behavior on overflow of integer modes.  In the case
!      of 'neg', the negation of the operand may be a number not
       representable in mode M, in which case it is truncated to M.
!      'ss_neg' and 'us_neg' ensure that an out-of-bounds result saturates
!      to the maximum or minimum signed or unsigned value.
  
! '(mult:M X Y)'
! '(ss_mult:M X Y)'
! '(us_mult:M X Y)'
       Represents the signed product of the values represented by X and Y
!      carried out in machine mode M.  'ss_mult' and 'us_mult' ensure that
!      an out-of-bounds result saturates to the maximum or minimum signed
!      or unsigned value.
  
       Some machines support a multiplication that generates a product
       wider than the operands.  Write the pattern for this as
*************** second operand.
*** 15775,15921 ****
       same.
  
       For unsigned widening multiplication, use the same idiom, but with
!      `zero_extend' instead of `sign_extend'.
  
! `(fma:M X Y Z)'
!      Represents the `fma', `fmaf', and `fmal' builtin functions, which
!      compute `X * Y + Z' without doing an intermediate rounding step.
  
! `(div:M X Y)'
! `(ss_div:M X Y)'
       Represents the quotient in signed division of X by Y, carried out
       in machine mode M.  If M is a floating point mode, it represents
!      the exact quotient; otherwise, the integerized quotient.  `ss_div'
       ensures that an out-of-bounds result saturates to the maximum or
       minimum signed value.
  
       Some machines have division instructions in which the operands and
       quotient widths are not all the same; you should represent such
!      instructions using `truncate' and `sign_extend' as in,
  
            (truncate:M1 (div:M2 X (sign_extend:M2 Y)))
  
! `(udiv:M X Y)'
! `(us_div:M X Y)'
!      Like `div' but represents unsigned division.  `us_div' ensures
!      that an out-of-bounds result saturates to the maximum or minimum
       unsigned value.
  
! `(mod:M X Y)'
! `(umod:M X Y)'
!      Like `div' and `udiv' but represent the remainder instead of the
       quotient.
  
! `(smin:M X Y)'
! `(smax:M X Y)'
!      Represents the smaller (for `smin') or larger (for `smax') of X
!      and Y, interpreted as signed values in mode M.  When used with
!      floating point, if both operands are zeros, or if either operand
!      is `NaN', then it is unspecified which of the two operands is
!      returned as the result.
  
! `(umin:M X Y)'
! `(umax:M X Y)'
!      Like `smin' and `smax', but the values are interpreted as unsigned
       integers.
  
! `(not:M X)'
       Represents the bitwise complement of the value represented by X,
       carried out in mode M, which must be a fixed-point machine mode.
  
! `(and:M X Y)'
       Represents the bitwise logical-and of the values represented by X
       and Y, carried out in machine mode M, which must be a fixed-point
       machine mode.
  
! `(ior:M X Y)'
       Represents the bitwise inclusive-or of the values represented by X
       and Y, carried out in machine mode M, which must be a fixed-point
       mode.
  
! `(xor:M X Y)'
       Represents the bitwise exclusive-or of the values represented by X
       and Y, carried out in machine mode M, which must be a fixed-point
       mode.
  
! `(ashift:M X C)'
! `(ss_ashift:M X C)'
! `(us_ashift:M X C)'
       These three expressions represent the result of arithmetically
       shifting X left by C places.  They differ in their behavior on
!      overflow of integer modes.  An `ashift' operation is a plain shift
       with no special behavior in case of a change in the sign bit;
!      `ss_ashift' and `us_ashift' saturates to the minimum or maximum
!      representable value if any of the bits shifted out differs from
!      the final sign bit.
  
!      X have mode M, a fixed-point machine mode.  C be a fixed-point
!      mode or be a constant with mode `VOIDmode'; which mode is
!      determined by the mode called for in the machine description entry
!      for the left-shift instruction.  For example, on the VAX, the mode
!      of C is `QImode' regardless of M.
  
! `(lshiftrt:M X C)'
! `(ashiftrt:M X C)'
!      Like `ashift' but for right shift.  Unlike the case for left shift,
       these two operations are distinct.
  
! `(rotate:M X C)'
! `(rotatert:M X C)'
       Similar but represent left and right rotate.  If C is a constant,
!      use `rotate'.
! 
! `(abs:M X)'
  
! `(ss_abs:M X)'
!      Represents the absolute value of X, computed in mode M.  `ss_abs'
       ensures that an out-of-bounds result saturates to the maximum
       signed value.
  
! `(sqrt:M X)'
       Represents the square root of X, computed in mode M.  Most often M
       will be a floating point mode.
  
! `(ffs:M X)'
       Represents one plus the index of the least significant 1-bit in X,
       represented as an integer of mode M.  (The value is zero if X is
!      zero.)  The mode of X must be M or `VOIDmode'.
  
! `(clrsb:M X)'
       Represents the number of redundant leading sign bits in X,
       represented as an integer of mode M, starting at the most
       significant bit position.  This is one less than the number of
!      leading sign bits (either 0 or 1), with no special cases.  The
!      mode of X must be M or `VOIDmode'.
  
! `(clz:M X)'
       Represents the number of leading 0-bits in X, represented as an
       integer of mode M, starting at the most significant bit position.
       If X is zero, the value is determined by
!      `CLZ_DEFINED_VALUE_AT_ZERO' (*note Misc::).  Note that this is one
       of the few expressions that is not invariant under widening.  The
!      mode of X must be M or `VOIDmode'.
  
! `(ctz:M X)'
       Represents the number of trailing 0-bits in X, represented as an
       integer of mode M, starting at the least significant bit position.
       If X is zero, the value is determined by
!      `CTZ_DEFINED_VALUE_AT_ZERO' (*note Misc::).  Except for this case,
!      `ctz(x)' is equivalent to `ffs(X) - 1'.  The mode of X must be M
!      or `VOIDmode'.
  
! `(popcount:M X)'
       Represents the number of 1-bits in X, represented as an integer of
!      mode M.  The mode of X must be M or `VOIDmode'.
  
! `(parity:M X)'
       Represents the number of 1-bits modulo 2 in X, represented as an
!      integer of mode M.  The mode of X must be M or `VOIDmode'.
  
! `(bswap:M X)'
       Represents the value X with the order of bytes reversed, carried
       out in mode M, which must be a fixed-point machine mode.  The mode
!      of X must be M or `VOIDmode'.
  
  
  File: gccint.info,  Node: Comparisons,  Next: Bit-Fields,  Prev: Arithmetic,  Up: RTL
--- 15625,15770 ----
       same.
  
       For unsigned widening multiplication, use the same idiom, but with
!      'zero_extend' instead of 'sign_extend'.
  
! '(fma:M X Y Z)'
!      Represents the 'fma', 'fmaf', and 'fmal' builtin functions, which
!      compute 'X * Y + Z' without doing an intermediate rounding step.
  
! '(div:M X Y)'
! '(ss_div:M X Y)'
       Represents the quotient in signed division of X by Y, carried out
       in machine mode M.  If M is a floating point mode, it represents
!      the exact quotient; otherwise, the integerized quotient.  'ss_div'
       ensures that an out-of-bounds result saturates to the maximum or
       minimum signed value.
  
       Some machines have division instructions in which the operands and
       quotient widths are not all the same; you should represent such
!      instructions using 'truncate' and 'sign_extend' as in,
  
            (truncate:M1 (div:M2 X (sign_extend:M2 Y)))
  
! '(udiv:M X Y)'
! '(us_div:M X Y)'
!      Like 'div' but represents unsigned division.  'us_div' ensures that
!      an out-of-bounds result saturates to the maximum or minimum
       unsigned value.
  
! '(mod:M X Y)'
! '(umod:M X Y)'
!      Like 'div' and 'udiv' but represent the remainder instead of the
       quotient.
  
! '(smin:M X Y)'
! '(smax:M X Y)'
!      Represents the smaller (for 'smin') or larger (for 'smax') of X and
!      Y, interpreted as signed values in mode M.  When used with floating
!      point, if both operands are zeros, or if either operand is 'NaN',
!      then it is unspecified which of the two operands is returned as the
!      result.
  
! '(umin:M X Y)'
! '(umax:M X Y)'
!      Like 'smin' and 'smax', but the values are interpreted as unsigned
       integers.
  
! '(not:M X)'
       Represents the bitwise complement of the value represented by X,
       carried out in mode M, which must be a fixed-point machine mode.
  
! '(and:M X Y)'
       Represents the bitwise logical-and of the values represented by X
       and Y, carried out in machine mode M, which must be a fixed-point
       machine mode.
  
! '(ior:M X Y)'
       Represents the bitwise inclusive-or of the values represented by X
       and Y, carried out in machine mode M, which must be a fixed-point
       mode.
  
! '(xor:M X Y)'
       Represents the bitwise exclusive-or of the values represented by X
       and Y, carried out in machine mode M, which must be a fixed-point
       mode.
  
! '(ashift:M X C)'
! '(ss_ashift:M X C)'
! '(us_ashift:M X C)'
       These three expressions represent the result of arithmetically
       shifting X left by C places.  They differ in their behavior on
!      overflow of integer modes.  An 'ashift' operation is a plain shift
       with no special behavior in case of a change in the sign bit;
!      'ss_ashift' and 'us_ashift' saturates to the minimum or maximum
!      representable value if any of the bits shifted out differs from the
!      final sign bit.
  
!      X have mode M, a fixed-point machine mode.  C be a fixed-point mode
!      or be a constant with mode 'VOIDmode'; which mode is determined by
!      the mode called for in the machine description entry for the
!      left-shift instruction.  For example, on the VAX, the mode of C is
!      'QImode' regardless of M.
  
! '(lshiftrt:M X C)'
! '(ashiftrt:M X C)'
!      Like 'ashift' but for right shift.  Unlike the case for left shift,
       these two operations are distinct.
  
! '(rotate:M X C)'
! '(rotatert:M X C)'
       Similar but represent left and right rotate.  If C is a constant,
!      use 'rotate'.
  
! '(abs:M X)'
! '(ss_abs:M X)'
!      Represents the absolute value of X, computed in mode M.  'ss_abs'
       ensures that an out-of-bounds result saturates to the maximum
       signed value.
  
! '(sqrt:M X)'
       Represents the square root of X, computed in mode M.  Most often M
       will be a floating point mode.
  
! '(ffs:M X)'
       Represents one plus the index of the least significant 1-bit in X,
       represented as an integer of mode M.  (The value is zero if X is
!      zero.)  The mode of X must be M or 'VOIDmode'.
  
! '(clrsb:M X)'
       Represents the number of redundant leading sign bits in X,
       represented as an integer of mode M, starting at the most
       significant bit position.  This is one less than the number of
!      leading sign bits (either 0 or 1), with no special cases.  The mode
!      of X must be M or 'VOIDmode'.
  
! '(clz:M X)'
       Represents the number of leading 0-bits in X, represented as an
       integer of mode M, starting at the most significant bit position.
       If X is zero, the value is determined by
!      'CLZ_DEFINED_VALUE_AT_ZERO' (*note Misc::).  Note that this is one
       of the few expressions that is not invariant under widening.  The
!      mode of X must be M or 'VOIDmode'.
  
! '(ctz:M X)'
       Represents the number of trailing 0-bits in X, represented as an
       integer of mode M, starting at the least significant bit position.
       If X is zero, the value is determined by
!      'CTZ_DEFINED_VALUE_AT_ZERO' (*note Misc::).  Except for this case,
!      'ctz(x)' is equivalent to 'ffs(X) - 1'.  The mode of X must be M or
!      'VOIDmode'.
  
! '(popcount:M X)'
       Represents the number of 1-bits in X, represented as an integer of
!      mode M.  The mode of X must be M or 'VOIDmode'.
  
! '(parity:M X)'
       Represents the number of 1-bits modulo 2 in X, represented as an
!      integer of mode M.  The mode of X must be M or 'VOIDmode'.
  
! '(bswap:M X)'
       Represents the value X with the order of bytes reversed, carried
       out in mode M, which must be a fixed-point machine mode.  The mode
!      of X must be M or 'VOIDmode'.
  
  
  File: gccint.info,  Node: Comparisons,  Next: Bit-Fields,  Prev: Arithmetic,  Up: RTL
*************** File: gccint.info,  Node: Comparisons,
*** 15925,15949 ****
  
  Comparison operators test a relation on two operands and are considered
  to represent a machine-dependent nonzero value described by, but not
! necessarily equal to, `STORE_FLAG_VALUE' (*note Misc::) if the relation
  holds, or zero if it does not, for comparison operators whose results
! have a `MODE_INT' mode, `FLOAT_STORE_FLAG_VALUE' (*note Misc::) if the
  relation holds, or zero if it does not, for comparison operators that
  return floating-point values, and a vector of either
! `VECTOR_STORE_FLAG_VALUE' (*note Misc::) if the relation holds, or of
  zeros if it does not, for comparison operators that return vector
  results.  The mode of the comparison operation is independent of the
  mode of the data being compared.  If the comparison operation is being
! tested (e.g., the first operand of an `if_then_else'), the mode must be
! `VOIDmode'.
  
   There are two ways that comparison operations may be used.  The
! comparison operators may be used to compare the condition codes `(cc0)'
! against zero, as in `(eq (cc0) (const_int 0))'.  Such a construct
  actually refers to the result of the preceding instruction in which the
  condition codes were set.  The instruction setting the condition code
  must be adjacent to the instruction using the condition code; only
! `note' insns may separate them.
  
   Alternatively, a comparison operation may directly compare two data
  objects.  The mode of the comparison is determined by the operands; they
--- 15774,15798 ----
  
  Comparison operators test a relation on two operands and are considered
  to represent a machine-dependent nonzero value described by, but not
! necessarily equal to, 'STORE_FLAG_VALUE' (*note Misc::) if the relation
  holds, or zero if it does not, for comparison operators whose results
! have a 'MODE_INT' mode, 'FLOAT_STORE_FLAG_VALUE' (*note Misc::) if the
  relation holds, or zero if it does not, for comparison operators that
  return floating-point values, and a vector of either
! 'VECTOR_STORE_FLAG_VALUE' (*note Misc::) if the relation holds, or of
  zeros if it does not, for comparison operators that return vector
  results.  The mode of the comparison operation is independent of the
  mode of the data being compared.  If the comparison operation is being
! tested (e.g., the first operand of an 'if_then_else'), the mode must be
! 'VOIDmode'.
  
   There are two ways that comparison operations may be used.  The
! comparison operators may be used to compare the condition codes '(cc0)'
! against zero, as in '(eq (cc0) (const_int 0))'.  Such a construct
  actually refers to the result of the preceding instruction in which the
  condition codes were set.  The instruction setting the condition code
  must be adjacent to the instruction using the condition code; only
! 'note' insns may separate them.
  
   Alternatively, a comparison operation may directly compare two data
  objects.  The mode of the comparison is determined by the operands; they
*************** operands constant would be invalid as th
*** 15952,16017 ****
  deduced from it, but such a comparison should never exist in RTL due to
  constant folding.
  
!  In the example above, if `(cc0)' were last set to `(compare X Y)', the
! comparison operation is identical to `(eq X Y)'.  Usually only one style
  of comparisons is supported on a particular machine, but the combine
! pass will try to merge the operations to produce the `eq' shown in case
  it exists in the context of the particular insn involved.
  
   Inequality comparisons come in two flavors, signed and unsigned.  Thus,
! there are distinct expression codes `gt' and `gtu' for signed and
  unsigned greater-than.  These can produce different results for the same
  pair of integer values: for example, 1 is signed greater-than -1 but not
  unsigned greater-than, because -1 when regarded as unsigned is actually
! `0xffffffff' which is greater than 1.
  
   The signed comparisons are also used for floating point values.
! Floating point comparisons are distinguished by the machine modes of
! the operands.
  
! `(eq:M X Y)'
!      `STORE_FLAG_VALUE' if the values represented by X and Y are equal,
       otherwise 0.
  
! `(ne:M X Y)'
!      `STORE_FLAG_VALUE' if the values represented by X and Y are not
       equal, otherwise 0.
  
! `(gt:M X Y)'
!      `STORE_FLAG_VALUE' if the X is greater than Y.  If they are
       fixed-point, the comparison is done in a signed sense.
  
! `(gtu:M X Y)'
!      Like `gt' but does unsigned comparison, on fixed-point numbers
       only.
  
! `(lt:M X Y)'
! `(ltu:M X Y)'
!      Like `gt' and `gtu' but test for "less than".
  
! `(ge:M X Y)'
! `(geu:M X Y)'
!      Like `gt' and `gtu' but test for "greater than or equal".
  
! `(le:M X Y)'
! `(leu:M X Y)'
!      Like `gt' and `gtu' but test for "less than or equal".
  
! `(if_then_else COND THEN ELSE)'
       This is not a comparison operation but is listed here because it is
       always used in conjunction with a comparison operation.  To be
       precise, COND is a comparison expression.  This expression
       represents a choice, according to COND, between the value
       represented by THEN and the one represented by ELSE.
  
!      On most machines, `if_then_else' expressions are valid only to
       express conditional jumps.
  
! `(cond [TEST1 VALUE1 TEST2 VALUE2 ...] DEFAULT)'
!      Similar to `if_then_else', but more general.  Each of TEST1,
!      TEST2, ... is performed in turn.  The result of this expression is
!      the VALUE corresponding to the first nonzero test, or DEFAULT if
!      none of the tests are nonzero expressions.
  
       This is currently not valid for instruction patterns and is
       supported only for insn attributes.  *Note Insn Attributes::.
--- 15801,15866 ----
  deduced from it, but such a comparison should never exist in RTL due to
  constant folding.
  
!  In the example above, if '(cc0)' were last set to '(compare X Y)', the
! comparison operation is identical to '(eq X Y)'.  Usually only one style
  of comparisons is supported on a particular machine, but the combine
! pass will try to merge the operations to produce the 'eq' shown in case
  it exists in the context of the particular insn involved.
  
   Inequality comparisons come in two flavors, signed and unsigned.  Thus,
! there are distinct expression codes 'gt' and 'gtu' for signed and
  unsigned greater-than.  These can produce different results for the same
  pair of integer values: for example, 1 is signed greater-than -1 but not
  unsigned greater-than, because -1 when regarded as unsigned is actually
! '0xffffffff' which is greater than 1.
  
   The signed comparisons are also used for floating point values.
! Floating point comparisons are distinguished by the machine modes of the
! operands.
  
! '(eq:M X Y)'
!      'STORE_FLAG_VALUE' if the values represented by X and Y are equal,
       otherwise 0.
  
! '(ne:M X Y)'
!      'STORE_FLAG_VALUE' if the values represented by X and Y are not
       equal, otherwise 0.
  
! '(gt:M X Y)'
!      'STORE_FLAG_VALUE' if the X is greater than Y.  If they are
       fixed-point, the comparison is done in a signed sense.
  
! '(gtu:M X Y)'
!      Like 'gt' but does unsigned comparison, on fixed-point numbers
       only.
  
! '(lt:M X Y)'
! '(ltu:M X Y)'
!      Like 'gt' and 'gtu' but test for "less than".
  
! '(ge:M X Y)'
! '(geu:M X Y)'
!      Like 'gt' and 'gtu' but test for "greater than or equal".
  
! '(le:M X Y)'
! '(leu:M X Y)'
!      Like 'gt' and 'gtu' but test for "less than or equal".
  
! '(if_then_else COND THEN ELSE)'
       This is not a comparison operation but is listed here because it is
       always used in conjunction with a comparison operation.  To be
       precise, COND is a comparison expression.  This expression
       represents a choice, according to COND, between the value
       represented by THEN and the one represented by ELSE.
  
!      On most machines, 'if_then_else' expressions are valid only to
       express conditional jumps.
  
! '(cond [TEST1 VALUE1 TEST2 VALUE2 ...] DEFAULT)'
!      Similar to 'if_then_else', but more general.  Each of TEST1, TEST2,
!      ... is performed in turn.  The result of this expression is the
!      VALUE corresponding to the first nonzero test, or DEFAULT if none
!      of the tests are nonzero expressions.
  
       This is currently not valid for instruction patterns and is
       supported only for insn attributes.  *Note Insn Attributes::.
*************** File: gccint.info,  Node: Bit-Fields,  N
*** 16024,16057 ****
  
  Special expression codes exist to represent bit-field instructions.
  
! `(sign_extract:M LOC SIZE POS)'
       This represents a reference to a sign-extended bit-field contained
       or starting in LOC (a memory or register reference).  The bit-field
       is SIZE bits wide and starts at bit POS.  The compilation option
!      `BITS_BIG_ENDIAN' says which end of the memory unit POS counts
       from.
  
       If LOC is in memory, its mode must be a single-byte integer mode.
       If LOC is in a register, the mode to use is specified by the
!      operand of the `insv' or `extv' pattern (*note Standard Names::)
       and is usually a full-word integer mode, which is the default if
       none is specified.
  
       The mode of POS is machine-specific and is also specified in the
!      `insv' or `extv' pattern.
  
!      The mode M is the same as the mode that would be used for LOC if
!      it were a register.
  
!      A `sign_extract' can not appear as an lvalue, or part thereof, in
       RTL.
  
! `(zero_extract:M LOC SIZE POS)'
!      Like `sign_extract' but refers to an unsigned or zero-extended
       bit-field.  The same sequence of bits are extracted, but they are
       filled to an entire word with zeros instead of by sign-extension.
  
!      Unlike `sign_extract', this type of expressions can be lvalues in
       RTL; they may appear on the left side of an assignment, indicating
       insertion of a value into the specified bit-field.
  
--- 15873,15906 ----
  
  Special expression codes exist to represent bit-field instructions.
  
! '(sign_extract:M LOC SIZE POS)'
       This represents a reference to a sign-extended bit-field contained
       or starting in LOC (a memory or register reference).  The bit-field
       is SIZE bits wide and starts at bit POS.  The compilation option
!      'BITS_BIG_ENDIAN' says which end of the memory unit POS counts
       from.
  
       If LOC is in memory, its mode must be a single-byte integer mode.
       If LOC is in a register, the mode to use is specified by the
!      operand of the 'insv' or 'extv' pattern (*note Standard Names::)
       and is usually a full-word integer mode, which is the default if
       none is specified.
  
       The mode of POS is machine-specific and is also specified in the
!      'insv' or 'extv' pattern.
  
!      The mode M is the same as the mode that would be used for LOC if it
!      were a register.
  
!      A 'sign_extract' can not appear as an lvalue, or part thereof, in
       RTL.
  
! '(zero_extract:M LOC SIZE POS)'
!      Like 'sign_extract' but refers to an unsigned or zero-extended
       bit-field.  The same sequence of bits are extracted, but they are
       filled to an entire word with zeros instead of by sign-extension.
  
!      Unlike 'sign_extract', this type of expressions can be lvalues in
       RTL; they may appear on the left side of an assignment, indicating
       insertion of a value into the specified bit-field.
  
*************** interpreted as operating on each part of
*** 16066,16100 ****
  Additionally, there are a few new expressions to describe specific
  vector operations.
  
! `(vec_merge:M VEC1 VEC2 ITEMS)'
       This describes a merge operation between two vectors.  The result
       is a vector of mode M; its elements are selected from either VEC1
       or VEC2.  Which elements are selected is described by ITEMS, which
!      is a bit mask represented by a `const_int'; a zero bit indicates
       the corresponding element in the result vector is taken from VEC2
       while a set bit indicates it is taken from VEC1.
  
! `(vec_select:M VEC1 SELECTION)'
       This describes an operation that selects parts of a vector.  VEC1
!      is the source vector, and SELECTION is a `parallel' that contains a
!      `const_int' for each of the subparts of the result vector, giving
       the number of the source subpart that should be stored into it.
       The result mode M is either the submode for a single element of
!      VEC1 (if only one subpart is selected), or another vector mode
!      with that element submode (if multiple subparts are selected).
  
! `(vec_concat:M X1 X2)'
!      Describes a vector concat operation.  The result is a
!      concatenation of the vectors or scalars X1 and X2; its length is
!      the sum of the lengths of the two inputs.
  
! `(vec_duplicate:M X)'
       This operation converts a scalar into a vector or a small vector
       into a larger one by duplicating the input values.  The output
!      vector mode must have the same submodes as the input vector mode
!      or the scalar modes, and the number of output parts must be an
!      integer multiple of the number of input parts.
! 
  
  
  File: gccint.info,  Node: Conversions,  Next: RTL Declarations,  Prev: Vector Operations,  Up: RTL
--- 15915,15948 ----
  Additionally, there are a few new expressions to describe specific
  vector operations.
  
! '(vec_merge:M VEC1 VEC2 ITEMS)'
       This describes a merge operation between two vectors.  The result
       is a vector of mode M; its elements are selected from either VEC1
       or VEC2.  Which elements are selected is described by ITEMS, which
!      is a bit mask represented by a 'const_int'; a zero bit indicates
       the corresponding element in the result vector is taken from VEC2
       while a set bit indicates it is taken from VEC1.
  
! '(vec_select:M VEC1 SELECTION)'
       This describes an operation that selects parts of a vector.  VEC1
!      is the source vector, and SELECTION is a 'parallel' that contains a
!      'const_int' for each of the subparts of the result vector, giving
       the number of the source subpart that should be stored into it.
       The result mode M is either the submode for a single element of
!      VEC1 (if only one subpart is selected), or another vector mode with
!      that element submode (if multiple subparts are selected).
  
! '(vec_concat:M X1 X2)'
!      Describes a vector concat operation.  The result is a concatenation
!      of the vectors or scalars X1 and X2; its length is the sum of the
!      lengths of the two inputs.
  
! '(vec_duplicate:M X)'
       This operation converts a scalar into a vector or a small vector
       into a larger one by duplicating the input values.  The output
!      vector mode must have the same submodes as the input vector mode or
!      the scalar modes, and the number of output parts must be an integer
!      multiple of the number of input parts.
  
  
  File: gccint.info,  Node: Conversions,  Next: RTL Declarations,  Prev: Vector Operations,  Up: RTL
*************** File: gccint.info,  Node: Conversions,
*** 16103,16112 ****
  =================
  
  All conversions between machine modes must be represented by explicit
! conversion operations.  For example, an expression which is the sum of
! a byte and a full word cannot be written as `(plus:SI (reg:QI 34)
! (reg:SI 80))' because the `plus' operation requires two operands of the
! same machine mode.  Therefore, the byte-sized operand is enclosed in a
  conversion operation, as in
  
       (plus:SI (sign_extend:SI (reg:QI 34)) (reg:SI 80))
--- 15951,15960 ----
  =================
  
  All conversions between machine modes must be represented by explicit
! conversion operations.  For example, an expression which is the sum of a
! byte and a full word cannot be written as '(plus:SI (reg:QI 34) (reg:SI
! 80))' because the 'plus' operation requires two operands of the same
! machine mode.  Therefore, the byte-sized operand is enclosed in a
  conversion operation, as in
  
       (plus:SI (sign_extend:SI (reg:QI 34)) (reg:SI 80))
*************** conversion operation, as in
*** 16115,16184 ****
  be more than one way of converting from a given starting mode to the
  desired final mode.  The conversion operation code says how to do it.
  
!  For all conversion operations, X must not be `VOIDmode' because the
  mode in which to do the conversion would not be known.  The conversion
  must either be done at compile-time or X must be placed into a register.
  
! `(sign_extend:M X)'
!      Represents the result of sign-extending the value X to machine
!      mode M.  M must be a fixed-point mode and X a fixed-point value of
!      a mode narrower than M.
  
! `(zero_extend:M X)'
!      Represents the result of zero-extending the value X to machine
!      mode M.  M must be a fixed-point mode and X a fixed-point value of
!      a mode narrower than M.
  
! `(float_extend:M X)'
       Represents the result of extending the value X to machine mode M.
       M must be a floating point mode and X a floating point value of a
       mode narrower than M.
  
! `(truncate:M X)'
       Represents the result of truncating the value X to machine mode M.
       M must be a fixed-point mode and X a fixed-point value of a mode
       wider than M.
  
! `(ss_truncate:M X)'
       Represents the result of truncating the value X to machine mode M,
       using signed saturation in the case of overflow.  Both M and the
       mode of X must be fixed-point modes.
  
! `(us_truncate:M X)'
       Represents the result of truncating the value X to machine mode M,
       using unsigned saturation in the case of overflow.  Both M and the
       mode of X must be fixed-point modes.
  
! `(float_truncate:M X)'
       Represents the result of truncating the value X to machine mode M.
       M must be a floating point mode and X a floating point value of a
       mode wider than M.
  
! `(float:M X)'
       Represents the result of converting fixed point value X, regarded
       as signed, to floating point mode M.
  
! `(unsigned_float:M X)'
       Represents the result of converting fixed point value X, regarded
       as unsigned, to floating point mode M.
  
! `(fix:M X)'
       When M is a floating-point mode, represents the result of
!      converting floating point value X (valid for mode M) to an
!      integer, still represented in floating point mode M, by rounding
!      towards zero.
  
       When M is a fixed-point mode, represents the result of converting
!      floating point value X to mode M, regarded as signed.  How
!      rounding is done is not specified, so this operation may be used
!      validly in compiling C code only for integer-valued operands.
  
! `(unsigned_fix:M X)'
!      Represents the result of converting floating point value X to
!      fixed point mode M, regarded as unsigned.  How rounding is done is
!      not specified.
  
! `(fract_convert:M X)'
       Represents the result of converting fixed-point value X to
       fixed-point mode M, signed integer value X to fixed-point mode M,
       floating-point value X to fixed-point mode M, fixed-point value X
--- 15963,16032 ----
  be more than one way of converting from a given starting mode to the
  desired final mode.  The conversion operation code says how to do it.
  
!  For all conversion operations, X must not be 'VOIDmode' because the
  mode in which to do the conversion would not be known.  The conversion
  must either be done at compile-time or X must be placed into a register.
  
! '(sign_extend:M X)'
!      Represents the result of sign-extending the value X to machine mode
!      M.  M must be a fixed-point mode and X a fixed-point value of a
!      mode narrower than M.
  
! '(zero_extend:M X)'
!      Represents the result of zero-extending the value X to machine mode
!      M.  M must be a fixed-point mode and X a fixed-point value of a
!      mode narrower than M.
  
! '(float_extend:M X)'
       Represents the result of extending the value X to machine mode M.
       M must be a floating point mode and X a floating point value of a
       mode narrower than M.
  
! '(truncate:M X)'
       Represents the result of truncating the value X to machine mode M.
       M must be a fixed-point mode and X a fixed-point value of a mode
       wider than M.
  
! '(ss_truncate:M X)'
       Represents the result of truncating the value X to machine mode M,
       using signed saturation in the case of overflow.  Both M and the
       mode of X must be fixed-point modes.
  
! '(us_truncate:M X)'
       Represents the result of truncating the value X to machine mode M,
       using unsigned saturation in the case of overflow.  Both M and the
       mode of X must be fixed-point modes.
  
! '(float_truncate:M X)'
       Represents the result of truncating the value X to machine mode M.
       M must be a floating point mode and X a floating point value of a
       mode wider than M.
  
! '(float:M X)'
       Represents the result of converting fixed point value X, regarded
       as signed, to floating point mode M.
  
! '(unsigned_float:M X)'
       Represents the result of converting fixed point value X, regarded
       as unsigned, to floating point mode M.
  
! '(fix:M X)'
       When M is a floating-point mode, represents the result of
!      converting floating point value X (valid for mode M) to an integer,
!      still represented in floating point mode M, by rounding towards
!      zero.
  
       When M is a fixed-point mode, represents the result of converting
!      floating point value X to mode M, regarded as signed.  How rounding
!      is done is not specified, so this operation may be used validly in
!      compiling C code only for integer-valued operands.
  
! '(unsigned_fix:M X)'
!      Represents the result of converting floating point value X to fixed
!      point mode M, regarded as unsigned.  How rounding is done is not
!      specified.
  
! '(fract_convert:M X)'
       Represents the result of converting fixed-point value X to
       fixed-point mode M, signed integer value X to fixed-point mode M,
       floating-point value X to fixed-point mode M, fixed-point value X
*************** must either be done at compile-time or X
*** 16186,16205 ****
       floating-point mode M.  When overflows or underflows happen, the
       results are undefined.
  
! `(sat_fract:M X)'
       Represents the result of converting fixed-point value X to
       fixed-point mode M, signed integer value X to fixed-point mode M,
!      or floating-point value X to fixed-point mode M.  When overflows
!      or underflows happen, the results are saturated to the maximum or
!      the minimum.
  
! `(unsigned_fract_convert:M X)'
       Represents the result of converting fixed-point value X to integer
       mode M regarded as unsigned, or unsigned integer value X to
       fixed-point mode M.  When overflows or underflows happen, the
       results are undefined.
  
! `(unsigned_sat_fract:M X)'
       Represents the result of converting unsigned integer value X to
       fixed-point mode M.  When overflows or underflows happen, the
       results are saturated to the maximum or the minimum.
--- 16034,16053 ----
       floating-point mode M.  When overflows or underflows happen, the
       results are undefined.
  
! '(sat_fract:M X)'
       Represents the result of converting fixed-point value X to
       fixed-point mode M, signed integer value X to fixed-point mode M,
!      or floating-point value X to fixed-point mode M.  When overflows or
!      underflows happen, the results are saturated to the maximum or the
!      minimum.
  
! '(unsigned_fract_convert:M X)'
       Represents the result of converting fixed-point value X to integer
       mode M regarded as unsigned, or unsigned integer value X to
       fixed-point mode M.  When overflows or underflows happen, the
       results are undefined.
  
! '(unsigned_sat_fract:M X)'
       Represents the result of converting unsigned integer value X to
       fixed-point mode M.  When overflows or underflows happen, the
       results are saturated to the maximum or the minimum.
*************** File: gccint.info,  Node: RTL Declaratio
*** 16213,16225 ****
  Declaration expression codes do not represent arithmetic operations but
  rather state assertions about their operands.
  
! `(strict_low_part (subreg:M (reg:N R) 0))'
       This expression code is used in only one context: as the
!      destination operand of a `set' expression.  In addition, the
!      operand of this expression must be a non-paradoxical `subreg'
       expression.
  
!      The presence of `strict_low_part' says that the part of the
       register which is meaningful in mode N, but is not part of mode M,
       is not to be altered.  Normally, an assignment to such a subreg is
       allowed to have undefined effects on the rest of the register when
--- 16061,16073 ----
  Declaration expression codes do not represent arithmetic operations but
  rather state assertions about their operands.
  
! '(strict_low_part (subreg:M (reg:N R) 0))'
       This expression code is used in only one context: as the
!      destination operand of a 'set' expression.  In addition, the
!      operand of this expression must be a non-paradoxical 'subreg'
       expression.
  
!      The presence of 'strict_low_part' says that the part of the
       register which is meaningful in mode N, but is not part of mode M,
       is not to be altered.  Normally, an assignment to such a subreg is
       allowed to have undefined effects on the rest of the register when
*************** codes are used to represent side effects
*** 16240,16364 ****
  the codes described above, which represent values, appear only as the
  operands of these.
  
! `(set LVAL X)'
       Represents the action of storing the value of X into the place
       represented by LVAL.  LVAL must be an expression representing a
!      place that can be stored in: `reg' (or `subreg', `strict_low_part'
!      or `zero_extract'), `mem', `pc', `parallel', or `cc0'.
  
!      If LVAL is a `reg', `subreg' or `mem', it has a machine mode; then
       X must be valid for that mode.
  
!      If LVAL is a `reg' whose machine mode is less than the full width
       of the register, then it means that the part of the register
       specified by the machine mode is given the specified value and the
       rest of the register receives an undefined value.  Likewise, if
!      LVAL is a `subreg' whose machine mode is narrower than the mode of
       the register, the rest of the register can be changed in an
       undefined way.
  
!      If LVAL is a `strict_low_part' of a subreg, then the part of the
!      register specified by the machine mode of the `subreg' is given
!      the value X and the rest of the register is not changed.
  
!      If LVAL is a `zero_extract', then the referenced part of the
       bit-field (a memory or register reference) specified by the
!      `zero_extract' is given the value X and the rest of the bit-field
!      is not changed.  Note that `sign_extract' can not appear in LVAL.
  
!      If LVAL is `(cc0)', it has no machine mode, and X may be either a
!      `compare' expression or a value that may have any mode.  The
!      latter case represents a "test" instruction.  The expression `(set
!      (cc0) (reg:M N))' is equivalent to `(set (cc0) (compare (reg:M N)
       (const_int 0)))'.  Use the former expression to save space during
       the compilation.
  
!      If LVAL is a `parallel', it is used to represent the case of a
       function returning a structure in multiple registers.  Each element
!      of the `parallel' is an `expr_list' whose first operand is a `reg'
!      and whose second operand is a `const_int' representing the offset
       (in bytes) into the structure at which the data in that register
       corresponds.  The first element may be null to indicate that the
       structure is also passed partly in memory.
  
!      If LVAL is `(pc)', we have a jump instruction, and the
!      possibilities for X are very limited.  It may be a `label_ref'
!      expression (unconditional jump).  It may be an `if_then_else'
       (conditional jump), in which case either the second or the third
!      operand must be `(pc)' (for the case which does not jump) and the
!      other of the two must be a `label_ref' (for the case which does
!      jump).  X may also be a `mem' or `(plus:SI (pc) Y)', where Y may
!      be a `reg' or a `mem'; these unusual patterns are used to
!      represent jumps through branch tables.
  
!      If LVAL is neither `(cc0)' nor `(pc)', the mode of LVAL must not
!      be `VOIDmode' and the mode of X must be valid for the mode of LVAL.
  
!      LVAL is customarily accessed with the `SET_DEST' macro and X with
!      the `SET_SRC' macro.
  
! `(return)'
       As the sole expression in a pattern, represents a return from the
       current function, on machines where this can be done with one
       instruction, such as VAXen.  On machines where a multi-instruction
       "epilogue" must be executed in order to return from the function,
       returning is done by jumping to a label which precedes the
!      epilogue, and the `return' expression code is never used.
  
!      Inside an `if_then_else' expression, represents the value to be
!      placed in `pc' to return to the caller.
  
!      Note that an insn pattern of `(return)' is logically equivalent to
!      `(set (pc) (return))', but the latter form is never used.
  
! `(simple_return)'
!      Like `(return)', but truly represents only a function return, while
!      `(return)' may represent an insn that also performs other functions
!      of the function epilogue.  Like `(return)', this may also occur in
       conditional jumps.
  
! `(call FUNCTION NARGS)'
!      Represents a function call.  FUNCTION is a `mem' expression whose
       address is the address of the function to be called.  NARGS is an
       expression which can be used for two purposes: on some machines it
       represents the number of bytes of stack argument; on others, it
       represents the number of argument registers.
  
       Each machine has a standard machine mode which FUNCTION must have.
!      The machine description defines macro `FUNCTION_MODE' to expand
       into the requisite mode name.  The purpose of this mode is to
       specify what kind of addressing is allowed, on machines where the
       allowed kinds of addressing depend on the machine mode being
       addressed.
  
! `(clobber X)'
       Represents the storing or possible storing of an unpredictable,
!      undescribed value into X, which must be a `reg', `scratch',
!      `parallel' or `mem' expression.
  
       One place this is used is in string instructions that store
       standard values into particular hard registers.  It may not be
!      worth the trouble to describe the values that are stored, but it
!      is essential to inform the compiler that the registers will be
       altered, lest it attempt to keep data in them across the string
       instruction.
  
!      If X is `(mem:BLK (const_int 0))' or `(mem:BLK (scratch))', it
       means that all memory locations must be presumed clobbered.  If X
!      is a `parallel', it has the same meaning as a `parallel' in a
!      `set' expression.
  
!      Note that the machine description classifies certain hard
!      registers as "call-clobbered".  All function call instructions are
!      assumed by default to clobber these registers, so there is no need
!      to use `clobber' expressions to indicate this fact.  Also, each
!      function call is assumed to have the potential to alter any memory
!      location, unless the function is declared `const'.
  
!      If the last group of expressions in a `parallel' are each a
!      `clobber' expression whose arguments are `reg' or `match_scratch'
       (*note RTL Template::) expressions, the combiner phase can add the
!      appropriate `clobber' expressions to an insn it has constructed
       when doing so will cause a pattern to be matched.
  
       This feature can be used, for example, on a machine that whose
--- 16088,16212 ----
  the codes described above, which represent values, appear only as the
  operands of these.
  
! '(set LVAL X)'
       Represents the action of storing the value of X into the place
       represented by LVAL.  LVAL must be an expression representing a
!      place that can be stored in: 'reg' (or 'subreg', 'strict_low_part'
!      or 'zero_extract'), 'mem', 'pc', 'parallel', or 'cc0'.
  
!      If LVAL is a 'reg', 'subreg' or 'mem', it has a machine mode; then
       X must be valid for that mode.
  
!      If LVAL is a 'reg' whose machine mode is less than the full width
       of the register, then it means that the part of the register
       specified by the machine mode is given the specified value and the
       rest of the register receives an undefined value.  Likewise, if
!      LVAL is a 'subreg' whose machine mode is narrower than the mode of
       the register, the rest of the register can be changed in an
       undefined way.
  
!      If LVAL is a 'strict_low_part' of a subreg, then the part of the
!      register specified by the machine mode of the 'subreg' is given the
!      value X and the rest of the register is not changed.
  
!      If LVAL is a 'zero_extract', then the referenced part of the
       bit-field (a memory or register reference) specified by the
!      'zero_extract' is given the value X and the rest of the bit-field
!      is not changed.  Note that 'sign_extract' can not appear in LVAL.
  
!      If LVAL is '(cc0)', it has no machine mode, and X may be either a
!      'compare' expression or a value that may have any mode.  The latter
!      case represents a "test" instruction.  The expression '(set (cc0)
!      (reg:M N))' is equivalent to '(set (cc0) (compare (reg:M N)
       (const_int 0)))'.  Use the former expression to save space during
       the compilation.
  
!      If LVAL is a 'parallel', it is used to represent the case of a
       function returning a structure in multiple registers.  Each element
!      of the 'parallel' is an 'expr_list' whose first operand is a 'reg'
!      and whose second operand is a 'const_int' representing the offset
       (in bytes) into the structure at which the data in that register
       corresponds.  The first element may be null to indicate that the
       structure is also passed partly in memory.
  
!      If LVAL is '(pc)', we have a jump instruction, and the
!      possibilities for X are very limited.  It may be a 'label_ref'
!      expression (unconditional jump).  It may be an 'if_then_else'
       (conditional jump), in which case either the second or the third
!      operand must be '(pc)' (for the case which does not jump) and the
!      other of the two must be a 'label_ref' (for the case which does
!      jump).  X may also be a 'mem' or '(plus:SI (pc) Y)', where Y may be
!      a 'reg' or a 'mem'; these unusual patterns are used to represent
!      jumps through branch tables.
  
!      If LVAL is neither '(cc0)' nor '(pc)', the mode of LVAL must not be
!      'VOIDmode' and the mode of X must be valid for the mode of LVAL.
  
!      LVAL is customarily accessed with the 'SET_DEST' macro and X with
!      the 'SET_SRC' macro.
  
! '(return)'
       As the sole expression in a pattern, represents a return from the
       current function, on machines where this can be done with one
       instruction, such as VAXen.  On machines where a multi-instruction
       "epilogue" must be executed in order to return from the function,
       returning is done by jumping to a label which precedes the
!      epilogue, and the 'return' expression code is never used.
  
!      Inside an 'if_then_else' expression, represents the value to be
!      placed in 'pc' to return to the caller.
  
!      Note that an insn pattern of '(return)' is logically equivalent to
!      '(set (pc) (return))', but the latter form is never used.
  
! '(simple_return)'
!      Like '(return)', but truly represents only a function return, while
!      '(return)' may represent an insn that also performs other functions
!      of the function epilogue.  Like '(return)', this may also occur in
       conditional jumps.
  
! '(call FUNCTION NARGS)'
!      Represents a function call.  FUNCTION is a 'mem' expression whose
       address is the address of the function to be called.  NARGS is an
       expression which can be used for two purposes: on some machines it
       represents the number of bytes of stack argument; on others, it
       represents the number of argument registers.
  
       Each machine has a standard machine mode which FUNCTION must have.
!      The machine description defines macro 'FUNCTION_MODE' to expand
       into the requisite mode name.  The purpose of this mode is to
       specify what kind of addressing is allowed, on machines where the
       allowed kinds of addressing depend on the machine mode being
       addressed.
  
! '(clobber X)'
       Represents the storing or possible storing of an unpredictable,
!      undescribed value into X, which must be a 'reg', 'scratch',
!      'parallel' or 'mem' expression.
  
       One place this is used is in string instructions that store
       standard values into particular hard registers.  It may not be
!      worth the trouble to describe the values that are stored, but it is
!      essential to inform the compiler that the registers will be
       altered, lest it attempt to keep data in them across the string
       instruction.
  
!      If X is '(mem:BLK (const_int 0))' or '(mem:BLK (scratch))', it
       means that all memory locations must be presumed clobbered.  If X
!      is a 'parallel', it has the same meaning as a 'parallel' in a 'set'
!      expression.
  
!      Note that the machine description classifies certain hard registers
!      as "call-clobbered".  All function call instructions are assumed by
!      default to clobber these registers, so there is no need to use
!      'clobber' expressions to indicate this fact.  Also, each function
!      call is assumed to have the potential to alter any memory location,
!      unless the function is declared 'const'.
  
!      If the last group of expressions in a 'parallel' are each a
!      'clobber' expression whose arguments are 'reg' or 'match_scratch'
       (*note RTL Template::) expressions, the combiner phase can add the
!      appropriate 'clobber' expressions to an insn it has constructed
       when doing so will cause a pattern to be matched.
  
       This feature can be used, for example, on a machine that whose
*************** operands of these.
*** 16367,16409 ****
       register.  Similarly, a combined instruction might require a
       temporary register while the constituent instructions might not.
  
!      When a `clobber' expression for a register appears inside a
!      `parallel' with other side effects, the register allocator
       guarantees that the register is unoccupied both before and after
       that insn if it is a hard register clobber.  For pseudo-register
       clobber, the register allocator and the reload pass do not assign
       the same hard register to the clobber and the input operands if
!      there is an insn alternative containing the `&' constraint (*note
       Modifiers::) for the clobber and the hard register is in register
       classes of the clobber in the alternative.  You can clobber either
!      a specific hard register, a pseudo register, or a `scratch'
       expression; in the latter two cases, GCC will allocate a hard
       register that is available there for use as a temporary.
  
       For instructions that require a temporary register, you should use
!      `scratch' instead of a pseudo-register because this will allow the
!      combiner phase to add the `clobber' when required.  You do this by
!      coding (`clobber' (`match_scratch' ...)).  If you do clobber a
!      pseudo register, use one which appears nowhere else--generate a
!      new one each time.  Otherwise, you may confuse CSE.
  
       There is one other known use for clobbering a pseudo register in a
!      `parallel': when one of the input operands of the insn is also
       clobbered by the insn.  In this case, using the same pseudo
       register in the clobber and elsewhere in the insn produces the
       expected results.
  
! `(use X)'
       Represents the use of the value of X.  It indicates that the value
!      in X at this point in the program is needed, even though it may
!      not be apparent why this is so.  Therefore, the compiler will not
       attempt to delete previous instructions whose only effect is to
!      store a value in X.  X must be a `reg' expression.
  
!      In some situations, it may be tempting to add a `use' of a
!      register in a `parallel' to describe a situation where the value
!      of a special register will modify the behavior of the instruction.
!      A hypothetical example might be a pattern for an addition that can
       either wrap around or use saturating addition depending on the
       value of a special control register:
  
--- 16215,16257 ----
       register.  Similarly, a combined instruction might require a
       temporary register while the constituent instructions might not.
  
!      When a 'clobber' expression for a register appears inside a
!      'parallel' with other side effects, the register allocator
       guarantees that the register is unoccupied both before and after
       that insn if it is a hard register clobber.  For pseudo-register
       clobber, the register allocator and the reload pass do not assign
       the same hard register to the clobber and the input operands if
!      there is an insn alternative containing the '&' constraint (*note
       Modifiers::) for the clobber and the hard register is in register
       classes of the clobber in the alternative.  You can clobber either
!      a specific hard register, a pseudo register, or a 'scratch'
       expression; in the latter two cases, GCC will allocate a hard
       register that is available there for use as a temporary.
  
       For instructions that require a temporary register, you should use
!      'scratch' instead of a pseudo-register because this will allow the
!      combiner phase to add the 'clobber' when required.  You do this by
!      coding ('clobber' ('match_scratch' ...)).  If you do clobber a
!      pseudo register, use one which appears nowhere else--generate a new
!      one each time.  Otherwise, you may confuse CSE.
  
       There is one other known use for clobbering a pseudo register in a
!      'parallel': when one of the input operands of the insn is also
       clobbered by the insn.  In this case, using the same pseudo
       register in the clobber and elsewhere in the insn produces the
       expected results.
  
! '(use X)'
       Represents the use of the value of X.  It indicates that the value
!      in X at this point in the program is needed, even though it may not
!      be apparent why this is so.  Therefore, the compiler will not
       attempt to delete previous instructions whose only effect is to
!      store a value in X.  X must be a 'reg' expression.
  
!      In some situations, it may be tempting to add a 'use' of a register
!      in a 'parallel' to describe a situation where the value of a
!      special register will modify the behavior of the instruction.  A
!      hypothetical example might be a pattern for an addition that can
       either wrap around or use saturating addition depending on the
       value of a special control register:
  
*************** operands of these.
*** 16411,16446 ****
                                                   (reg:SI 4)] 0))
                       (use (reg:SI 1))])
  
       This will not work, several of the optimizers only look at
       expressions locally; it is very likely that if you have multiple
!      insns with identical inputs to the `unspec', they will be
!      optimized away even if register 1 changes in between.
  
!      This means that `use' can _only_ be used to describe that the
!      register is live.  You should think twice before adding `use'
!      statements, more often you will want to use `unspec' instead.  The
!      `use' RTX is most commonly useful to describe that a fixed
!      register is implicitly used in an insn.  It is also safe to use in
!      patterns where the compiler knows for other reasons that the result
!      of the whole pattern is variable, such as `movmemM' or `call'
!      patterns.
  
!      During the reload phase, an insn that has a `use' as pattern can
!      carry a reg_equal note.  These `use' insns will be deleted before
       the reload phase exits.
  
!      During the delayed branch scheduling phase, X may be an insn.
!      This indicates that X previously was located at this place in the
!      code and its data dependencies need to be taken into account.
!      These `use' insns will be deleted before the delayed branch
!      scheduling phase exits.
  
! `(parallel [X0 X1 ...])'
       Represents several side effects performed in parallel.  The square
!      brackets stand for a vector; the operand of `parallel' is a vector
       of expressions.  X0, X1 and so on are individual side effect
!      expressions--expressions of code `set', `call', `return',
!      `simple_return', `clobber' or `use'.
  
       "In parallel" means that first all the values used in the
       individual side-effects are computed, and second all the actual
--- 16259,16294 ----
                                                   (reg:SI 4)] 0))
                       (use (reg:SI 1))])
  
+ 
       This will not work, several of the optimizers only look at
       expressions locally; it is very likely that if you have multiple
!      insns with identical inputs to the 'unspec', they will be optimized
!      away even if register 1 changes in between.
  
!      This means that 'use' can _only_ be used to describe that the
!      register is live.  You should think twice before adding 'use'
!      statements, more often you will want to use 'unspec' instead.  The
!      'use' RTX is most commonly useful to describe that a fixed register
!      is implicitly used in an insn.  It is also safe to use in patterns
!      where the compiler knows for other reasons that the result of the
!      whole pattern is variable, such as 'movmemM' or 'call' patterns.
  
!      During the reload phase, an insn that has a 'use' as pattern can
!      carry a reg_equal note.  These 'use' insns will be deleted before
       the reload phase exits.
  
!      During the delayed branch scheduling phase, X may be an insn.  This
!      indicates that X previously was located at this place in the code
!      and its data dependencies need to be taken into account.  These
!      'use' insns will be deleted before the delayed branch scheduling
!      phase exits.
  
! '(parallel [X0 X1 ...])'
       Represents several side effects performed in parallel.  The square
!      brackets stand for a vector; the operand of 'parallel' is a vector
       of expressions.  X0, X1 and so on are individual side effect
!      expressions--expressions of code 'set', 'call', 'return',
!      'simple_return', 'clobber' or 'use'.
  
       "In parallel" means that first all the values used in the
       individual side-effects are computed, and second all the actual
*************** operands of these.
*** 16451,16463 ****
  
       says unambiguously that the values of hard register 1 and the
       memory location addressed by it are interchanged.  In both places
!      where `(reg:SI 1)' appears as a memory address it refers to the
       value in register 1 _before_ the execution of the insn.
  
!      It follows that it is _incorrect_ to use `parallel' and expect the
!      result of one `set' to be available for the next one.  For
!      example, people sometimes attempt to represent a jump-if-zero
!      instruction this way:
  
            (parallel [(set (cc0) (reg:SI 34))
                       (set (pc) (if_then_else
--- 16299,16311 ----
  
       says unambiguously that the values of hard register 1 and the
       memory location addressed by it are interchanged.  In both places
!      where '(reg:SI 1)' appears as a memory address it refers to the
       value in register 1 _before_ the execution of the insn.
  
!      It follows that it is _incorrect_ to use 'parallel' and expect the
!      result of one 'set' to be available for the next one.  For example,
!      people sometimes attempt to represent a jump-if-zero instruction
!      this way:
  
            (parallel [(set (cc0) (reg:SI 34))
                       (set (pc) (if_then_else
*************** operands of these.
*** 16470,16548 ****
       on the new value that is set by this instruction.
  
       Peephole optimization, which takes place together with final
!      assembly code output, can produce insns whose patterns consist of
!      a `parallel' whose elements are the operands needed to output the
!      resulting assembler code--often `reg', `mem' or constant
       expressions.  This would not be well-formed RTL at any other stage
       in compilation, but it is OK then because no further optimization
       remains to be done.  However, the definition of the macro
!      `NOTICE_UPDATE_CC', if any, must deal with such insns if you
!      define any peephole optimizations.
  
! `(cond_exec [COND EXPR])'
       Represents a conditionally executed expression.  The EXPR is
!      executed only if the COND is nonzero.  The COND expression must
!      not have side-effects, but the EXPR may very well have
!      side-effects.
  
! `(sequence [INSNS ...])'
!      Represents a sequence of insns.  If a `sequence' appears in the
       chain of insns, then each of the INSNS that appears in the sequence
!      must be suitable for appearing in the chain of insns, i.e. must
!      satisfy the `INSN_P' predicate.
  
!      After delay-slot scheduling is completed, an insn and all the
!      insns that reside in its delay slots are grouped together into a
!      `sequence'.  The insn requiring the delay slot is the first insn
!      in the vector; subsequent insns are to be placed in the delay slot.
  
!      `INSN_ANNULLED_BRANCH_P' is set on an insn in a delay slot to
       indicate that a branch insn should be used that will conditionally
       annul the effect of the insns in the delay slots.  In such a case,
!      `INSN_FROM_TARGET_P' indicates that the insn is from the target of
       the branch and should be executed only if the branch is taken;
       otherwise the insn should be executed only if the branch is not
       taken.  *Note Delay Slots::.
  
!      Some back ends also use `sequence' objects for purposes other than
       delay-slot groups.  This is not supported in the common parts of
       the compiler, which treat such sequences as delay-slot groups.
  
       DWARF2 Call Frame Address (CFA) adjustments are sometimes also
!      expressed using `sequence' objects as the value of a
!      `RTX_FRAME_RELATED_P' note.  This only happens if the CFA
       adjustments cannot be easily derived from the pattern of the
       instruction to which the note is attached.  In such cases, the
       value of the note is used instead of best-guesing the semantics of
       the instruction.  The back end can attach notes containing a
!      `sequence' of `set' patterns that express the effect of the parent
       instruction.
  
   These expression codes appear in place of a side effect, as the body of
  an insn, though strictly speaking they do not always describe side
  effects as such:
  
! `(asm_input S)'
       Represents literal assembler code as described by the string S.
  
! `(unspec [OPERANDS ...] INDEX)'
! `(unspec_volatile [OPERANDS ...] INDEX)'
!      Represents a machine-specific operation on OPERANDS.  INDEX
!      selects between multiple machine-specific operations.
!      `unspec_volatile' is used for volatile operations and operations
!      that may trap; `unspec' is used for other operations.
  
!      These codes may appear inside a `pattern' of an insn, inside a
!      `parallel', or inside an expression.
  
! `(addr_vec:M [LR0 LR1 ...])'
       Represents a table of jump addresses.  The vector elements LR0,
!      etc., are `label_ref' expressions.  The mode M specifies how much
!      space is given to each address; normally M would be `Pmode'.
  
! `(addr_diff_vec:M BASE [LR0 LR1 ...] MIN MAX FLAGS)'
       Represents a table of jump addresses expressed as offsets from
!      BASE.  The vector elements LR0, etc., are `label_ref' expressions
       and so is BASE.  The mode M specifies how much space is given to
       each address-difference.  MIN and MAX are set up by branch
       shortening and hold a label with a minimum and a maximum address,
--- 16318,16395 ----
       on the new value that is set by this instruction.
  
       Peephole optimization, which takes place together with final
!      assembly code output, can produce insns whose patterns consist of a
!      'parallel' whose elements are the operands needed to output the
!      resulting assembler code--often 'reg', 'mem' or constant
       expressions.  This would not be well-formed RTL at any other stage
       in compilation, but it is OK then because no further optimization
       remains to be done.  However, the definition of the macro
!      'NOTICE_UPDATE_CC', if any, must deal with such insns if you define
!      any peephole optimizations.
  
! '(cond_exec [COND EXPR])'
       Represents a conditionally executed expression.  The EXPR is
!      executed only if the COND is nonzero.  The COND expression must not
!      have side-effects, but the EXPR may very well have side-effects.
  
! '(sequence [INSNS ...])'
!      Represents a sequence of insns.  If a 'sequence' appears in the
       chain of insns, then each of the INSNS that appears in the sequence
!      must be suitable for appearing in the chain of insns, i.e.  must
!      satisfy the 'INSN_P' predicate.
  
!      After delay-slot scheduling is completed, an insn and all the insns
!      that reside in its delay slots are grouped together into a
!      'sequence'.  The insn requiring the delay slot is the first insn in
!      the vector; subsequent insns are to be placed in the delay slot.
  
!      'INSN_ANNULLED_BRANCH_P' is set on an insn in a delay slot to
       indicate that a branch insn should be used that will conditionally
       annul the effect of the insns in the delay slots.  In such a case,
!      'INSN_FROM_TARGET_P' indicates that the insn is from the target of
       the branch and should be executed only if the branch is taken;
       otherwise the insn should be executed only if the branch is not
       taken.  *Note Delay Slots::.
  
!      Some back ends also use 'sequence' objects for purposes other than
       delay-slot groups.  This is not supported in the common parts of
       the compiler, which treat such sequences as delay-slot groups.
  
       DWARF2 Call Frame Address (CFA) adjustments are sometimes also
!      expressed using 'sequence' objects as the value of a
!      'RTX_FRAME_RELATED_P' note.  This only happens if the CFA
       adjustments cannot be easily derived from the pattern of the
       instruction to which the note is attached.  In such cases, the
       value of the note is used instead of best-guesing the semantics of
       the instruction.  The back end can attach notes containing a
!      'sequence' of 'set' patterns that express the effect of the parent
       instruction.
  
   These expression codes appear in place of a side effect, as the body of
  an insn, though strictly speaking they do not always describe side
  effects as such:
  
! '(asm_input S)'
       Represents literal assembler code as described by the string S.
  
! '(unspec [OPERANDS ...] INDEX)'
! '(unspec_volatile [OPERANDS ...] INDEX)'
!      Represents a machine-specific operation on OPERANDS.  INDEX selects
!      between multiple machine-specific operations.  'unspec_volatile' is
!      used for volatile operations and operations that may trap; 'unspec'
!      is used for other operations.
  
!      These codes may appear inside a 'pattern' of an insn, inside a
!      'parallel', or inside an expression.
  
! '(addr_vec:M [LR0 LR1 ...])'
       Represents a table of jump addresses.  The vector elements LR0,
!      etc., are 'label_ref' expressions.  The mode M specifies how much
!      space is given to each address; normally M would be 'Pmode'.
  
! '(addr_diff_vec:M BASE [LR0 LR1 ...] MIN MAX FLAGS)'
       Represents a table of jump addresses expressed as offsets from
!      BASE.  The vector elements LR0, etc., are 'label_ref' expressions
       and so is BASE.  The mode M specifies how much space is given to
       each address-difference.  MIN and MAX are set up by branch
       shortening and hold a label with a minimum and a maximum address,
*************** effects as such:
*** 16550,16562 ****
       and MAX to the containing insn and of MIN and MAX to BASE.  See
       rtl.def for details.
  
! `(prefetch:M ADDR RW LOCALITY)'
       Represents prefetch of memory at address ADDR.  Operand RW is 1 if
       the prefetch is for data to be written, 0 otherwise; targets that
       do not support write prefetches should treat this as a normal
       prefetch.  Operand LOCALITY specifies the amount of temporal
!      locality; 0 if there is none or 1, 2, or 3 for increasing levels
!      of temporal locality; targets that do not support locality hints
       should ignore this.
  
       This insn is used to minimize cache-miss latency by moving data
--- 16397,16409 ----
       and MAX to the containing insn and of MIN and MAX to BASE.  See
       rtl.def for details.
  
! '(prefetch:M ADDR RW LOCALITY)'
       Represents prefetch of memory at address ADDR.  Operand RW is 1 if
       the prefetch is for data to be written, 0 otherwise; targets that
       do not support write prefetches should treat this as a normal
       prefetch.  Operand LOCALITY specifies the amount of temporal
!      locality; 0 if there is none or 1, 2, or 3 for increasing levels of
!      temporal locality; targets that do not support locality hints
       should ignore this.
  
       This insn is used to minimize cache-miss latency by moving data
*************** File: gccint.info,  Node: Incdec,  Next:
*** 16571,16609 ****
  
  Six special side-effect expression codes appear as memory addresses.
  
! `(pre_dec:M X)'
       Represents the side effect of decrementing X by a standard amount
       and represents also the value that X has after being decremented.
!      X must be a `reg' or `mem', but most machines allow only a `reg'.
!      M must be the machine mode for pointers on the machine in use.
!      The amount X is decremented by is the length in bytes of the
!      machine mode of the containing memory reference of which this
!      expression serves as the address.  Here is an example of its use:
  
            (mem:DF (pre_dec:SI (reg:SI 39)))
  
       This says to decrement pseudo register 39 by the length of a
!      `DFmode' value and use the result to address a `DFmode' value.
  
! `(pre_inc:M X)'
       Similar, but specifies incrementing X instead of decrementing it.
  
! `(post_dec:M X)'
!      Represents the same side effect as `pre_dec' but a different
!      value.  The value represented here is the value X has before being
       decremented.
  
! `(post_inc:M X)'
       Similar, but specifies incrementing X instead of decrementing it.
  
! `(post_modify:M X Y)'
       Represents the side effect of setting X to Y and represents X
!      before X is modified.  X must be a `reg' or `mem', but most
!      machines allow only a `reg'.  M must be the machine mode for
       pointers on the machine in use.
  
!      The expression Y must be one of three forms: `(plus:M X Z)',
!      `(minus:M X Z)', or `(plus:M X I)', where Z is an index register
       and I is a constant.
  
       Here is an example of its use:
--- 16418,16457 ----
  
  Six special side-effect expression codes appear as memory addresses.
  
! '(pre_dec:M X)'
       Represents the side effect of decrementing X by a standard amount
       and represents also the value that X has after being decremented.
!      X must be a 'reg' or 'mem', but most machines allow only a 'reg'.
!      M must be the machine mode for pointers on the machine in use.  The
!      amount X is decremented by is the length in bytes of the machine
!      mode of the containing memory reference of which this expression
!      serves as the address.  Here is an example of its use:
  
            (mem:DF (pre_dec:SI (reg:SI 39)))
  
       This says to decrement pseudo register 39 by the length of a
!      'DFmode' value and use the result to address a 'DFmode' value.
  
! '(pre_inc:M X)'
       Similar, but specifies incrementing X instead of decrementing it.
  
! '(post_dec:M X)'
!      Represents the same side effect as 'pre_dec' but a different value.
!      The value represented here is the value X has before being
       decremented.
  
! '(post_inc:M X)'
       Similar, but specifies incrementing X instead of decrementing it.
  
! '(post_modify:M X Y)'
! 
       Represents the side effect of setting X to Y and represents X
!      before X is modified.  X must be a 'reg' or 'mem', but most
!      machines allow only a 'reg'.  M must be the machine mode for
       pointers on the machine in use.
  
!      The expression Y must be one of three forms: '(plus:M X Z)',
!      '(minus:M X Z)', or '(plus:M X I)', where Z is an index register
       and I is a constant.
  
       Here is an example of its use:
*************** Six special side-effect expression codes
*** 16614,16629 ****
       This says to modify pseudo register 42 by adding the contents of
       pseudo register 48 to it, after the use of what ever 42 points to.
  
! `(pre_modify:M X EXPR)'
       Similar except side effects happen before the use.
  
   These embedded side effect expressions must be used with care.
! Instruction patterns may not use them.  Until the `flow' pass of the
  compiler, they may occur only to represent pushes onto the stack.  The
! `flow' pass finds cases where registers are incremented or decremented
! in one instruction and used as an address shortly before or after;
! these cases are then transformed to use pre- or post-increment or
! -decrement.
  
   If a register used as the operand of these expressions is used in
  another address in an insn, the original value of the register is used.
--- 16462,16476 ----
       This says to modify pseudo register 42 by adding the contents of
       pseudo register 48 to it, after the use of what ever 42 points to.
  
! '(pre_modify:M X EXPR)'
       Similar except side effects happen before the use.
  
   These embedded side effect expressions must be used with care.
! Instruction patterns may not use them.  Until the 'flow' pass of the
  compiler, they may occur only to represent pushes onto the stack.  The
! 'flow' pass finds cases where registers are incremented or decremented
! in one instruction and used as an address shortly before or after; these
! cases are then transformed to use pre- or post-increment or -decrement.
  
   If a register used as the operand of these expressions is used in
  another address in an insn, the original value of the register is used.
*************** insns behave differently on different ma
*** 16633,16644 ****
  as ambiguous and disallowed.
  
   An instruction that can be represented with an embedded side effect
! could also be represented using `parallel' containing an additional
! `set' to describe how the address register is altered.  This is not
! done because machines that allow these operations at all typically
! allow them wherever a memory address is called for.  Describing them as
! additional parallel stores would require doubling the number of entries
! in the machine description.
  
  
  File: gccint.info,  Node: Assembler,  Next: Debug Information,  Prev: Incdec,  Up: RTL
--- 16480,16491 ----
  as ambiguous and disallowed.
  
   An instruction that can be represented with an embedded side effect
! could also be represented using 'parallel' containing an additional
! 'set' to describe how the address register is altered.  This is not done
! because machines that allow these operations at all typically allow them
! wherever a memory address is called for.  Describing them as additional
! parallel stores would require doubling the number of entries in the
! machine description.
  
  
  File: gccint.info,  Node: Assembler,  Next: Debug Information,  Prev: Incdec,  Up: RTL
*************** File: gccint.info,  Node: Assembler,  Ne
*** 16646,16660 ****
  13.17 Assembler Instructions as Expressions
  ===========================================
  
! The RTX code `asm_operands' represents a value produced by a
! user-specified assembler instruction.  It is used to represent an `asm'
! statement with arguments.  An `asm' statement with a single output
  operand, like this:
  
       asm ("foo %1,%2,%0" : "=a" (outputvar) : "g" (x + y), "di" (*z));
  
! is represented using a single `asm_operands' RTX which represents the
! value that is stored in `outputvar':
  
       (set RTX-FOR-OUTPUTVAR
            (asm_operands "foo %1,%2,%0" "a" 0
--- 16493,16507 ----
  13.17 Assembler Instructions as Expressions
  ===========================================
  
! The RTX code 'asm_operands' represents a value produced by a
! user-specified assembler instruction.  It is used to represent an 'asm'
! statement with arguments.  An 'asm' statement with a single output
  operand, like this:
  
       asm ("foo %1,%2,%0" : "=a" (outputvar) : "g" (x + y), "di" (*z));
  
! is represented using a single 'asm_operands' RTX which represents the
! value that is stored in 'outputvar':
  
       (set RTX-FOR-OUTPUTVAR
            (asm_operands "foo %1,%2,%0" "a" 0
*************** value that is stored in `outputvar':
*** 16662,16676 ****
                          [(asm_input:M1 "g")
                           (asm_input:M2 "di")]))
  
! Here the operands of the `asm_operands' RTX are the assembler template
  string, the output-operand's constraint, the index-number of the output
  operand among the output operands specified, a vector of input operand
! RTX's, and a vector of input-operand modes and constraints.  The mode
! M1 is the mode of the sum `x+y'; M2 is that of `*z'.
  
!  When an `asm' statement has multiple output values, its insn has
! several such `set' RTX's inside of a `parallel'.  Each `set' contains
! an `asm_operands'; all of these share the same assembler template and
  vectors, but each contains the constraint for the respective output
  operand.  They are also distinguished by the output-operand index
  number, which is 0, 1, ... for successive output operands.
--- 16509,16523 ----
                          [(asm_input:M1 "g")
                           (asm_input:M2 "di")]))
  
! Here the operands of the 'asm_operands' RTX are the assembler template
  string, the output-operand's constraint, the index-number of the output
  operand among the output operands specified, a vector of input operand
! RTX's, and a vector of input-operand modes and constraints.  The mode M1
! is the mode of the sum 'x+y'; M2 is that of '*z'.
  
!  When an 'asm' statement has multiple output values, its insn has
! several such 'set' RTX's inside of a 'parallel'.  Each 'set' contains an
! 'asm_operands'; all of these share the same assembler template and
  vectors, but each contains the constraint for the respective output
  operand.  They are also distinguished by the output-operand index
  number, which is 0, 1, ... for successive output operands.
*************** File: gccint.info,  Node: Debug Informat
*** 16681,16708 ****
  13.18 Variable Location Debug Information in RTL
  ================================================
  
! Variable tracking relies on `MEM_EXPR' and `REG_EXPR' annotations to
  determine what user variables memory and register references refer to.
  
   Variable tracking at assignments uses these notes only when they refer
  to variables that live at fixed locations (e.g., addressable variables,
! global non-automatic variables).  For variables whose location may
! vary, it relies on the following types of notes.
  
! `(var_location:MODE VAR EXP STAT)'
!      Binds variable `var', a tree, to value EXP, an RTL expression.  It
!      appears only in `NOTE_INSN_VAR_LOCATION' and `DEBUG_INSN's, with
!      slightly different meanings.  MODE, if present, represents the
!      mode of EXP, which is useful if it is a modeless expression.  STAT
!      is only meaningful in notes, indicating whether the variable is
!      known to be initialized or uninitialized.
  
! `(debug_expr:MODE DECL)'
!      Stands for the value bound to the `DEBUG_EXPR_DECL' DECL, that
!      points back to it, within value expressions in `VAR_LOCATION'
       nodes.
  
- 
  
  File: gccint.info,  Node: Insns,  Next: Calls,  Prev: Debug Information,  Up: RTL
  
--- 16528,16554 ----
  13.18 Variable Location Debug Information in RTL
  ================================================
  
! Variable tracking relies on 'MEM_EXPR' and 'REG_EXPR' annotations to
  determine what user variables memory and register references refer to.
  
   Variable tracking at assignments uses these notes only when they refer
  to variables that live at fixed locations (e.g., addressable variables,
! global non-automatic variables).  For variables whose location may vary,
! it relies on the following types of notes.
  
! '(var_location:MODE VAR EXP STAT)'
!      Binds variable 'var', a tree, to value EXP, an RTL expression.  It
!      appears only in 'NOTE_INSN_VAR_LOCATION' and 'DEBUG_INSN's, with
!      slightly different meanings.  MODE, if present, represents the mode
!      of EXP, which is useful if it is a modeless expression.  STAT is
!      only meaningful in notes, indicating whether the variable is known
!      to be initialized or uninitialized.
  
! '(debug_expr:MODE DECL)'
!      Stands for the value bound to the 'DEBUG_EXPR_DECL' DECL, that
!      points back to it, within value expressions in 'VAR_LOCATION'
       nodes.
  
  
  File: gccint.info,  Node: Insns,  Next: Calls,  Prev: Debug Information,  Up: RTL
  
*************** File: gccint.info,  Node: Insns,  Next:
*** 16712,16718 ****
  The RTL representation of the code for a function is a doubly-linked
  chain of objects called "insns".  Insns are expressions with special
  codes that are used for no other purpose.  Some insns are actual
! instructions; others represent dispatch tables for `switch' statements;
  others represent labels to jump to or various sorts of declarative
  information.
  
--- 16558,16564 ----
  The RTL representation of the code for a function is a doubly-linked
  chain of objects called "insns".  Insns are expressions with special
  codes that are used for no other purpose.  Some insns are actual
! instructions; others represent dispatch tables for 'switch' statements;
  others represent labels to jump to or various sorts of declarative
  information.
  
*************** id-number that distinguishes it from all
*** 16721,16745 ****
  function (after delayed branch scheduling, copies of an insn with the
  same id-number may be present in multiple places in a function, but
  these copies will always be identical and will only appear inside a
! `sequence'), and chain pointers to the preceding and following insns.
  These three fields occupy the same position in every insn, independent
! of the expression code of the insn.  They could be accessed with `XEXP'
! and `XINT', but instead three special macros are always used:
  
! `INSN_UID (I)'
       Accesses the unique id of insn I.
  
! `PREV_INSN (I)'
       Accesses the chain pointer to the insn preceding I.  If I is the
       first insn, this is a null pointer.
  
! `NEXT_INSN (I)'
       Accesses the chain pointer to the insn following I.  If I is the
       last insn, this is a null pointer.
  
!  The first insn in the chain is obtained by calling `get_insns'; the
! last insn is the result of calling `get_last_insn'.  Within the chain
! delimited by these insns, the `NEXT_INSN' and `PREV_INSN' pointers must
  always correspond: if INSN is not the first insn,
  
       NEXT_INSN (PREV_INSN (INSN)) == INSN
--- 16567,16591 ----
  function (after delayed branch scheduling, copies of an insn with the
  same id-number may be present in multiple places in a function, but
  these copies will always be identical and will only appear inside a
! 'sequence'), and chain pointers to the preceding and following insns.
  These three fields occupy the same position in every insn, independent
! of the expression code of the insn.  They could be accessed with 'XEXP'
! and 'XINT', but instead three special macros are always used:
  
! 'INSN_UID (I)'
       Accesses the unique id of insn I.
  
! 'PREV_INSN (I)'
       Accesses the chain pointer to the insn preceding I.  If I is the
       first insn, this is a null pointer.
  
! 'NEXT_INSN (I)'
       Accesses the chain pointer to the insn following I.  If I is the
       last insn, this is a null pointer.
  
!  The first insn in the chain is obtained by calling 'get_insns'; the
! last insn is the result of calling 'get_last_insn'.  Within the chain
! delimited by these insns, the 'NEXT_INSN' and 'PREV_INSN' pointers must
  always correspond: if INSN is not the first insn,
  
       NEXT_INSN (PREV_INSN (INSN)) == INSN
*************** is always true and if INSN is not the la
*** 16751,17045 ****
  is always true.
  
   After delay slot scheduling, some of the insns in the chain might be
! `sequence' expressions, which contain a vector of insns.  The value of
! `NEXT_INSN' in all but the last of these insns is the next insn in the
! vector; the value of `NEXT_INSN' of the last insn in the vector is the
! same as the value of `NEXT_INSN' for the `sequence' in which it is
! contained.  Similar rules apply for `PREV_INSN'.
  
   This means that the above invariants are not necessarily true for insns
! inside `sequence' expressions.  Specifically, if INSN is the first insn
! in a `sequence', `NEXT_INSN (PREV_INSN (INSN))' is the insn containing
! the `sequence' expression, as is the value of `PREV_INSN (NEXT_INSN
! (INSN))' if INSN is the last insn in the `sequence' expression.  You
! can use these expressions to find the containing `sequence' expression.
  
   Every insn has one of the following expression codes:
  
! `insn'
!      The expression code `insn' is used for instructions that do not
!      jump and do not do function calls.  `sequence' expressions are
!      always contained in insns with code `insn' even if one of those
       insns should jump or do function calls.
  
!      Insns with code `insn' have four additional fields beyond the three
       mandatory ones listed above.  These four are described in a table
       below.
  
! `jump_insn'
!      The expression code `jump_insn' is used for instructions that may
!      jump (or, more generally, may contain `label_ref' expressions to
!      which `pc' can be set in that instruction).  If there is an
       instruction to return from the current function, it is recorded as
!      a `jump_insn'.
  
!      `jump_insn' insns have the same extra fields as `insn' insns,
       accessed in the same way and in addition contain a field
!      `JUMP_LABEL' which is defined once jump optimization has completed.
  
       For simple conditional and unconditional jumps, this field contains
!      the `code_label' to which this insn will (possibly conditionally)
!      branch.  In a more complex jump, `JUMP_LABEL' records one of the
       labels that the insn refers to; other jump target labels are
!      recorded as `REG_LABEL_TARGET' notes.  The exception is `addr_vec'
!      and `addr_diff_vec', where `JUMP_LABEL' is `NULL_RTX' and the only
       way to find the labels is to scan the entire body of the insn.
  
!      Return insns count as jumps, but since they do not refer to any
!      labels, their `JUMP_LABEL' is `NULL_RTX'.
  
! `call_insn'
!      The expression code `call_insn' is used for instructions that may
       do function calls.  It is important to distinguish these
       instructions because they imply that certain registers and memory
       locations may be altered unpredictably.
  
!      `call_insn' insns have the same extra fields as `insn' insns,
       accessed in the same way and in addition contain a field
!      `CALL_INSN_FUNCTION_USAGE', which contains a list (chain of
!      `expr_list' expressions) containing `use', `clobber' and sometimes
!      `set' expressions that denote hard registers and `mem's used or
       clobbered by the called function.
  
!      A `mem' generally points to a stack slot in which arguments passed
       to the libcall by reference (*note TARGET_PASS_BY_REFERENCE:
       Register Arguments.) are stored.  If the argument is caller-copied
       (*note TARGET_CALLEE_COPIES: Register Arguments.), the stack slot
!      will be mentioned in `clobber' and `use' entries; if it's
!      callee-copied, only a `use' will appear, and the `mem' may point
!      to addresses that are not stack slots.
  
!      Registers occurring inside a `clobber' in this list augment
!      registers specified in `CALL_USED_REGISTERS' (*note Register
       Basics::).
  
!      If the list contains a `set' involving two registers, it indicates
!      that the function returns one of its arguments.  Such a `set' may
       look like a no-op if the same register holds the argument and the
       return value.
  
! `code_label'
!      A `code_label' insn represents a label that a jump insn can jump
       to.  It contains two special fields of data in addition to the
!      three standard ones.  `CODE_LABEL_NUMBER' is used to hold the
       "label number", a number that identifies this label uniquely among
       all the labels in the compilation (not just in the current
       function).  Ultimately, the label is represented in the assembler
!      output as an assembler label, usually of the form `LN' where N is
       the label number.
  
!      When a `code_label' appears in an RTL expression, it normally
!      appears within a `label_ref' which represents the address of the
       label, as a number.
  
!      Besides as a `code_label', a label can also be represented as a
!      `note' of type `NOTE_INSN_DELETED_LABEL'.
  
!      The field `LABEL_NUSES' is only defined once the jump optimization
       phase is completed.  It contains the number of times this label is
       referenced in the current function.
  
!      The field `LABEL_KIND' differentiates four different types of
!      labels: `LABEL_NORMAL', `LABEL_STATIC_ENTRY',
!      `LABEL_GLOBAL_ENTRY', and `LABEL_WEAK_ENTRY'.  The only labels
!      that do not have type `LABEL_NORMAL' are "alternate entry points"
!      to the current function.  These may be static (visible only in the
!      containing translation unit), global (exposed to all translation
!      units), or weak (global, but can be overridden by another symbol
!      with the same name).
  
       Much of the compiler treats all four kinds of label identically.
       Some of it needs to know whether or not a label is an alternate
!      entry point; for this purpose, the macro `LABEL_ALT_ENTRY_P' is
!      provided.  It is equivalent to testing whether `LABEL_KIND (label)
       == LABEL_NORMAL'.  The only place that cares about the distinction
       between static, global, and weak alternate entry points, besides
       the front-end code that creates them, is the function
!      `output_alternate_entry_point', in `final.c'.
  
!      To set the kind of a label, use the `SET_LABEL_KIND' macro.
  
! `jump_table_data'
!      A `jump_table_data' insn is a placeholder for the jump-table data
!      of a `casesi' or `tablejump' insn.  They are placed after a
!      `tablejump_p' insn.  A `jump_table_data' insn is not part o a
!      basic blockm but it is associated with the basic block that ends
!      with the `tablejump_p' insn.  The `PATTERN' of a `jump_table_data'
!      is always either an `addr_vec' or an `addr_diff_vec', and a
!      `jump_table_data' insn is always preceded by a `code_label'.  The
!      `tablejump_p' insn refers to that `code_label' via its
!      `JUMP_LABEL'.
  
! `barrier'
       Barriers are placed in the instruction stream when control cannot
       flow past them.  They are placed after unconditional jump
!      instructions to indicate that the jumps are unconditional and
!      after calls to `volatile' functions, which do not return (e.g.,
!      `exit').  They contain no information beyond the three standard
!      fields.
  
! `note'
!      `note' insns are used to represent additional debugging and
       declarative information.  They contain two nonstandard fields, an
!      integer which is accessed with the macro `NOTE_LINE_NUMBER' and a
!      string accessed with `NOTE_SOURCE_FILE'.
  
!      If `NOTE_LINE_NUMBER' is positive, the note represents the
!      position of a source line and `NOTE_SOURCE_FILE' is the source
!      file name that the line came from.  These notes control generation
!      of line number data in the assembler output.
  
!      Otherwise, `NOTE_LINE_NUMBER' is not really a line number but a
!      code with one of the following values (and `NOTE_SOURCE_FILE' must
       contain a null pointer):
  
!     `NOTE_INSN_DELETED'
            Such a note is completely ignorable.  Some passes of the
            compiler delete insns by altering them into notes of this
            kind.
  
!     `NOTE_INSN_DELETED_LABEL'
!           This marks what used to be a `code_label', but was not used
!           for other purposes than taking its address and was
!           transformed to mark that no code jumps to it.
  
!     `NOTE_INSN_BLOCK_BEG'
!     `NOTE_INSN_BLOCK_END'
            These types of notes indicate the position of the beginning
!           and end of a level of scoping of variable names.  They
!           control the output of debugging information.
  
!     `NOTE_INSN_EH_REGION_BEG'
!     `NOTE_INSN_EH_REGION_END'
            These types of notes indicate the position of the beginning
            and end of a level of scoping for exception handling.
!           `NOTE_EH_HANDLER' identifies which region is associated with
            these notes.
  
!     `NOTE_INSN_FUNCTION_BEG'
            Appears at the start of the function body, after the function
            prologue.
  
!     `NOTE_INSN_VAR_LOCATION'
            This note is used to generate variable location debugging
            information.  It indicates that the user variable in its
!           `VAR_LOCATION' operand is at the location given in the RTL
            expression, or holds a value that can be computed by
            evaluating the RTL expression from that static point in the
            program up to the next such note for the same user variable.
  
- 
       These codes are printed symbolically when they appear in debugging
       dumps.
  
! `debug_insn'
!      The expression code `debug_insn' is used for pseudo-instructions
       that hold debugging information for variable tracking at
!      assignments (see `-fvar-tracking-assignments' option).  They are
!      the RTL representation of `GIMPLE_DEBUG' statements (*note
!      `GIMPLE_DEBUG'::), with a `VAR_LOCATION' operand that binds a user
!      variable tree to an RTL representation of the `value' in the
!      corresponding statement.  A `DEBUG_EXPR' in it stands for the
!      value bound to the corresponding `DEBUG_EXPR_DECL'.
  
       Throughout optimization passes, binding information is kept in
       pseudo-instruction form, so that, unlike notes, it gets the same
       treatment and adjustments that regular instructions would.  It is
       the variable tracking pass that turns these pseudo-instructions
!      into var location notes, analyzing control flow, value
!      equivalences and changes to registers and memory referenced in
!      value expressions, propagating the values of debug temporaries and
       determining expressions that can be used to compute the value of
       each user variable at as many points (ranges, actually) in the
       program as possible.
  
!      Unlike `NOTE_INSN_VAR_LOCATION', the value expression in an
!      `INSN_VAR_LOCATION' denotes a value at that specific point in the
       program, rather than an expression that can be evaluated at any
!      later point before an overriding `VAR_LOCATION' is encountered.
!      E.g., if a user variable is bound to a `REG' and then a subsequent
!      insn modifies the `REG', the note location would keep mapping the
       user variable to the register across the insn, whereas the insn
       location would keep the variable bound to the value, so that the
       variable tracking pass would emit another location note for the
       variable at the point in which the register is modified.
  
! 
!  The machine mode of an insn is normally `VOIDmode', but some phases
! use the mode for various purposes.
  
   The common subexpression elimination pass sets the mode of an insn to
! `QImode' when it is the first insn in a block that has already been
  processed.
  
   The second Haifa scheduling pass, for targets that can multiple issue,
! sets the mode of an insn to `TImode' when it is believed that the
! instruction begins an issue group.  That is, when the instruction
! cannot issue simultaneously with the previous.  This may be relied on
! by later passes, in particular machine-dependent reorg.
  
!  Here is a table of the extra fields of `insn', `jump_insn' and
! `call_insn' insns:
  
! `PATTERN (I)'
       An expression for the side effect performed by this insn.  This
!      must be one of the following codes: `set', `call', `use',
!      `clobber', `return', `simple_return', `asm_input', `asm_output',
!      `addr_vec', `addr_diff_vec', `trap_if', `unspec',
!      `unspec_volatile', `parallel', `cond_exec', or `sequence'.  If it
!      is a `parallel', each element of the `parallel' must be one these
!      codes, except that `parallel' expressions cannot be nested and
!      `addr_vec' and `addr_diff_vec' are not permitted inside a
!      `parallel' expression.
  
! `INSN_CODE (I)'
       An integer that says which pattern in the machine description
       matches this insn, or -1 if the matching has not yet been
       attempted.
  
       Such matching is never attempted and this field remains -1 on an
!      insn whose pattern consists of a single `use', `clobber',
!      `asm_input', `addr_vec' or `addr_diff_vec' expression.
  
!      Matching is also never attempted on insns that result from an `asm'
!      statement.  These contain at least one `asm_operands' expression.
!      The function `asm_noperands' returns a non-negative value for such
       insns.
  
!      In the debugging output, this field is printed as a number
!      followed by a symbolic representation that locates the pattern in
!      the `md' file as some small positive or negative offset from a
!      named pattern.
  
! `LOG_LINKS (I)'
!      A list (chain of `insn_list' expressions) giving information about
       dependencies between instructions within a basic block.  Neither a
       jump nor a label may come between the related insns.  These are
       only used by the schedulers and by combine.  This is a deprecated
       data structure.  Def-use and use-def chains are now preferred.
  
! `REG_NOTES (I)'
!      A list (chain of `expr_list', `insn_list' and `int_list'
       expressions) giving miscellaneous information about the insn.  It
       is often information pertaining to the registers used in this insn.
  
!  The `LOG_LINKS' field of an insn is a chain of `insn_list'
! expressions.  Each of these has two operands: the first is an insn, and
! the second is another `insn_list' expression (the next one in the
! chain).  The last `insn_list' in the chain has a null pointer as second
! operand.  The significant thing about the chain is which insns appear
! in it (as first operands of `insn_list' expressions).  Their order is
! not significant.
  
   This list is originally set up by the flow analysis pass; it is a null
  pointer until then.  Flow only adds links for those data dependencies
--- 16597,16886 ----
  is always true.
  
   After delay slot scheduling, some of the insns in the chain might be
! 'sequence' expressions, which contain a vector of insns.  The value of
! 'NEXT_INSN' in all but the last of these insns is the next insn in the
! vector; the value of 'NEXT_INSN' of the last insn in the vector is the
! same as the value of 'NEXT_INSN' for the 'sequence' in which it is
! contained.  Similar rules apply for 'PREV_INSN'.
  
   This means that the above invariants are not necessarily true for insns
! inside 'sequence' expressions.  Specifically, if INSN is the first insn
! in a 'sequence', 'NEXT_INSN (PREV_INSN (INSN))' is the insn containing
! the 'sequence' expression, as is the value of 'PREV_INSN (NEXT_INSN
! (INSN))' if INSN is the last insn in the 'sequence' expression.  You can
! use these expressions to find the containing 'sequence' expression.
  
   Every insn has one of the following expression codes:
  
! 'insn'
!      The expression code 'insn' is used for instructions that do not
!      jump and do not do function calls.  'sequence' expressions are
!      always contained in insns with code 'insn' even if one of those
       insns should jump or do function calls.
  
!      Insns with code 'insn' have four additional fields beyond the three
       mandatory ones listed above.  These four are described in a table
       below.
  
! 'jump_insn'
!      The expression code 'jump_insn' is used for instructions that may
!      jump (or, more generally, may contain 'label_ref' expressions to
!      which 'pc' can be set in that instruction).  If there is an
       instruction to return from the current function, it is recorded as
!      a 'jump_insn'.
  
!      'jump_insn' insns have the same extra fields as 'insn' insns,
       accessed in the same way and in addition contain a field
!      'JUMP_LABEL' which is defined once jump optimization has completed.
  
       For simple conditional and unconditional jumps, this field contains
!      the 'code_label' to which this insn will (possibly conditionally)
!      branch.  In a more complex jump, 'JUMP_LABEL' records one of the
       labels that the insn refers to; other jump target labels are
!      recorded as 'REG_LABEL_TARGET' notes.  The exception is 'addr_vec'
!      and 'addr_diff_vec', where 'JUMP_LABEL' is 'NULL_RTX' and the only
       way to find the labels is to scan the entire body of the insn.
  
!      Return insns count as jumps, but their 'JUMP_LABEL' is 'RETURN' or
!      'SIMPLE_RETURN'.
  
! 'call_insn'
!      The expression code 'call_insn' is used for instructions that may
       do function calls.  It is important to distinguish these
       instructions because they imply that certain registers and memory
       locations may be altered unpredictably.
  
!      'call_insn' insns have the same extra fields as 'insn' insns,
       accessed in the same way and in addition contain a field
!      'CALL_INSN_FUNCTION_USAGE', which contains a list (chain of
!      'expr_list' expressions) containing 'use', 'clobber' and sometimes
!      'set' expressions that denote hard registers and 'mem's used or
       clobbered by the called function.
  
!      A 'mem' generally points to a stack slot in which arguments passed
       to the libcall by reference (*note TARGET_PASS_BY_REFERENCE:
       Register Arguments.) are stored.  If the argument is caller-copied
       (*note TARGET_CALLEE_COPIES: Register Arguments.), the stack slot
!      will be mentioned in 'clobber' and 'use' entries; if it's
!      callee-copied, only a 'use' will appear, and the 'mem' may point to
!      addresses that are not stack slots.
  
!      Registers occurring inside a 'clobber' in this list augment
!      registers specified in 'CALL_USED_REGISTERS' (*note Register
       Basics::).
  
!      If the list contains a 'set' involving two registers, it indicates
!      that the function returns one of its arguments.  Such a 'set' may
       look like a no-op if the same register holds the argument and the
       return value.
  
! 'code_label'
!      A 'code_label' insn represents a label that a jump insn can jump
       to.  It contains two special fields of data in addition to the
!      three standard ones.  'CODE_LABEL_NUMBER' is used to hold the
       "label number", a number that identifies this label uniquely among
       all the labels in the compilation (not just in the current
       function).  Ultimately, the label is represented in the assembler
!      output as an assembler label, usually of the form 'LN' where N is
       the label number.
  
!      When a 'code_label' appears in an RTL expression, it normally
!      appears within a 'label_ref' which represents the address of the
       label, as a number.
  
!      Besides as a 'code_label', a label can also be represented as a
!      'note' of type 'NOTE_INSN_DELETED_LABEL'.
  
!      The field 'LABEL_NUSES' is only defined once the jump optimization
       phase is completed.  It contains the number of times this label is
       referenced in the current function.
  
!      The field 'LABEL_KIND' differentiates four different types of
!      labels: 'LABEL_NORMAL', 'LABEL_STATIC_ENTRY', 'LABEL_GLOBAL_ENTRY',
!      and 'LABEL_WEAK_ENTRY'.  The only labels that do not have type
!      'LABEL_NORMAL' are "alternate entry points" to the current
!      function.  These may be static (visible only in the containing
!      translation unit), global (exposed to all translation units), or
!      weak (global, but can be overridden by another symbol with the same
!      name).
  
       Much of the compiler treats all four kinds of label identically.
       Some of it needs to know whether or not a label is an alternate
!      entry point; for this purpose, the macro 'LABEL_ALT_ENTRY_P' is
!      provided.  It is equivalent to testing whether 'LABEL_KIND (label)
       == LABEL_NORMAL'.  The only place that cares about the distinction
       between static, global, and weak alternate entry points, besides
       the front-end code that creates them, is the function
!      'output_alternate_entry_point', in 'final.c'.
  
!      To set the kind of a label, use the 'SET_LABEL_KIND' macro.
  
! 'jump_table_data'
!      A 'jump_table_data' insn is a placeholder for the jump-table data
!      of a 'casesi' or 'tablejump' insn.  They are placed after a
!      'tablejump_p' insn.  A 'jump_table_data' insn is not part o a basic
!      blockm but it is associated with the basic block that ends with the
!      'tablejump_p' insn.  The 'PATTERN' of a 'jump_table_data' is always
!      either an 'addr_vec' or an 'addr_diff_vec', and a 'jump_table_data'
!      insn is always preceded by a 'code_label'.  The 'tablejump_p' insn
!      refers to that 'code_label' via its 'JUMP_LABEL'.
  
! 'barrier'
       Barriers are placed in the instruction stream when control cannot
       flow past them.  They are placed after unconditional jump
!      instructions to indicate that the jumps are unconditional and after
!      calls to 'volatile' functions, which do not return (e.g., 'exit').
!      They contain no information beyond the three standard fields.
  
! 'note'
!      'note' insns are used to represent additional debugging and
       declarative information.  They contain two nonstandard fields, an
!      integer which is accessed with the macro 'NOTE_LINE_NUMBER' and a
!      string accessed with 'NOTE_SOURCE_FILE'.
  
!      If 'NOTE_LINE_NUMBER' is positive, the note represents the position
!      of a source line and 'NOTE_SOURCE_FILE' is the source file name
!      that the line came from.  These notes control generation of line
!      number data in the assembler output.
  
!      Otherwise, 'NOTE_LINE_NUMBER' is not really a line number but a
!      code with one of the following values (and 'NOTE_SOURCE_FILE' must
       contain a null pointer):
  
!      'NOTE_INSN_DELETED'
            Such a note is completely ignorable.  Some passes of the
            compiler delete insns by altering them into notes of this
            kind.
  
!      'NOTE_INSN_DELETED_LABEL'
!           This marks what used to be a 'code_label', but was not used
!           for other purposes than taking its address and was transformed
!           to mark that no code jumps to it.
  
!      'NOTE_INSN_BLOCK_BEG'
!      'NOTE_INSN_BLOCK_END'
            These types of notes indicate the position of the beginning
!           and end of a level of scoping of variable names.  They control
!           the output of debugging information.
  
!      'NOTE_INSN_EH_REGION_BEG'
!      'NOTE_INSN_EH_REGION_END'
            These types of notes indicate the position of the beginning
            and end of a level of scoping for exception handling.
!           'NOTE_EH_HANDLER' identifies which region is associated with
            these notes.
  
!      'NOTE_INSN_FUNCTION_BEG'
            Appears at the start of the function body, after the function
            prologue.
  
!      'NOTE_INSN_VAR_LOCATION'
            This note is used to generate variable location debugging
            information.  It indicates that the user variable in its
!           'VAR_LOCATION' operand is at the location given in the RTL
            expression, or holds a value that can be computed by
            evaluating the RTL expression from that static point in the
            program up to the next such note for the same user variable.
  
       These codes are printed symbolically when they appear in debugging
       dumps.
  
! 'debug_insn'
!      The expression code 'debug_insn' is used for pseudo-instructions
       that hold debugging information for variable tracking at
!      assignments (see '-fvar-tracking-assignments' option).  They are
!      the RTL representation of 'GIMPLE_DEBUG' statements (*note
!      GIMPLE_DEBUG::), with a 'VAR_LOCATION' operand that binds a user
!      variable tree to an RTL representation of the 'value' in the
!      corresponding statement.  A 'DEBUG_EXPR' in it stands for the value
!      bound to the corresponding 'DEBUG_EXPR_DECL'.
  
       Throughout optimization passes, binding information is kept in
       pseudo-instruction form, so that, unlike notes, it gets the same
       treatment and adjustments that regular instructions would.  It is
       the variable tracking pass that turns these pseudo-instructions
!      into var location notes, analyzing control flow, value equivalences
!      and changes to registers and memory referenced in value
!      expressions, propagating the values of debug temporaries and
       determining expressions that can be used to compute the value of
       each user variable at as many points (ranges, actually) in the
       program as possible.
  
!      Unlike 'NOTE_INSN_VAR_LOCATION', the value expression in an
!      'INSN_VAR_LOCATION' denotes a value at that specific point in the
       program, rather than an expression that can be evaluated at any
!      later point before an overriding 'VAR_LOCATION' is encountered.
!      E.g., if a user variable is bound to a 'REG' and then a subsequent
!      insn modifies the 'REG', the note location would keep mapping the
       user variable to the register across the insn, whereas the insn
       location would keep the variable bound to the value, so that the
       variable tracking pass would emit another location note for the
       variable at the point in which the register is modified.
  
!  The machine mode of an insn is normally 'VOIDmode', but some phases use
! the mode for various purposes.
  
   The common subexpression elimination pass sets the mode of an insn to
! 'QImode' when it is the first insn in a block that has already been
  processed.
  
   The second Haifa scheduling pass, for targets that can multiple issue,
! sets the mode of an insn to 'TImode' when it is believed that the
! instruction begins an issue group.  That is, when the instruction cannot
! issue simultaneously with the previous.  This may be relied on by later
! passes, in particular machine-dependent reorg.
  
!  Here is a table of the extra fields of 'insn', 'jump_insn' and
! 'call_insn' insns:
  
! 'PATTERN (I)'
       An expression for the side effect performed by this insn.  This
!      must be one of the following codes: 'set', 'call', 'use',
!      'clobber', 'return', 'simple_return', 'asm_input', 'asm_output',
!      'addr_vec', 'addr_diff_vec', 'trap_if', 'unspec',
!      'unspec_volatile', 'parallel', 'cond_exec', or 'sequence'.  If it
!      is a 'parallel', each element of the 'parallel' must be one these
!      codes, except that 'parallel' expressions cannot be nested and
!      'addr_vec' and 'addr_diff_vec' are not permitted inside a
!      'parallel' expression.
  
! 'INSN_CODE (I)'
       An integer that says which pattern in the machine description
       matches this insn, or -1 if the matching has not yet been
       attempted.
  
       Such matching is never attempted and this field remains -1 on an
!      insn whose pattern consists of a single 'use', 'clobber',
!      'asm_input', 'addr_vec' or 'addr_diff_vec' expression.
  
!      Matching is also never attempted on insns that result from an 'asm'
!      statement.  These contain at least one 'asm_operands' expression.
!      The function 'asm_noperands' returns a non-negative value for such
       insns.
  
!      In the debugging output, this field is printed as a number followed
!      by a symbolic representation that locates the pattern in the 'md'
!      file as some small positive or negative offset from a named
!      pattern.
  
! 'LOG_LINKS (I)'
!      A list (chain of 'insn_list' expressions) giving information about
       dependencies between instructions within a basic block.  Neither a
       jump nor a label may come between the related insns.  These are
       only used by the schedulers and by combine.  This is a deprecated
       data structure.  Def-use and use-def chains are now preferred.
  
! 'REG_NOTES (I)'
!      A list (chain of 'expr_list', 'insn_list' and 'int_list'
       expressions) giving miscellaneous information about the insn.  It
       is often information pertaining to the registers used in this insn.
  
!  The 'LOG_LINKS' field of an insn is a chain of 'insn_list' expressions.
! Each of these has two operands: the first is an insn, and the second is
! another 'insn_list' expression (the next one in the chain).  The last
! 'insn_list' in the chain has a null pointer as second operand.  The
! significant thing about the chain is which insns appear in it (as first
! operands of 'insn_list' expressions).  Their order is not significant.
  
   This list is originally set up by the flow analysis pass; it is a null
  pointer until then.  Flow only adds links for those data dependencies
*************** which can be used for instruction combin
*** 17047,17072 ****
  analysis pass adds a link to insns which store into registers values
  that are used for the first time in this insn.
  
!  The `REG_NOTES' field of an insn is a chain similar to the `LOG_LINKS'
! field but it includes `expr_list' and `int_list' expressions in
! addition to `insn_list' expressions.  There are several kinds of
! register notes, which are distinguished by the machine mode, which in a
! register note is really understood as being an `enum reg_note'.  The
! first operand OP of the note is data whose meaning depends on the kind
! of note.
  
!  The macro `REG_NOTE_KIND (X)' returns the kind of register note.  Its
! counterpart, the macro `PUT_REG_NOTE_KIND (X, NEWKIND)' sets the
  register note type of X to be NEWKIND.
  
   Register notes are of three classes: They may say something about an
  input to an insn, they may say something about an output of an insn, or
  they may create a linkage between two insns.  There are also a set of
! values that are only used in `LOG_LINKS'.
  
   These register notes annotate inputs to an insn:
  
! `REG_DEAD'
       The value in OP dies in this insn; that is to say, altering the
       value immediately after this insn would not affect the future
       behavior of the program.
--- 16888,16912 ----
  analysis pass adds a link to insns which store into registers values
  that are used for the first time in this insn.
  
!  The 'REG_NOTES' field of an insn is a chain similar to the 'LOG_LINKS'
! field but it includes 'expr_list' and 'int_list' expressions in addition
! to 'insn_list' expressions.  There are several kinds of register notes,
! which are distinguished by the machine mode, which in a register note is
! really understood as being an 'enum reg_note'.  The first operand OP of
! the note is data whose meaning depends on the kind of note.
  
!  The macro 'REG_NOTE_KIND (X)' returns the kind of register note.  Its
! counterpart, the macro 'PUT_REG_NOTE_KIND (X, NEWKIND)' sets the
  register note type of X to be NEWKIND.
  
   Register notes are of three classes: They may say something about an
  input to an insn, they may say something about an output of an insn, or
  they may create a linkage between two insns.  There are also a set of
! values that are only used in 'LOG_LINKS'.
  
   These register notes annotate inputs to an insn:
  
! 'REG_DEAD'
       The value in OP dies in this insn; that is to say, altering the
       value immediately after this insn would not affect the future
       behavior of the program.
*************** values that are only used in `LOG_LINKS'
*** 17075,17146 ****
       this insn since OP is not necessarily modified by this insn.
       Rather, no subsequent instruction uses the contents of OP.
  
! `REG_UNUSED'
       The register OP being set by this insn will not be used in a
!      subsequent insn.  This differs from a `REG_DEAD' note, which
       indicates that the value in an input will not be used subsequently.
       These two notes are independent; both may be present for the same
       register.
  
! `REG_INC'
!      The register OP is incremented (or decremented; at this level
!      there is no distinction) by an embedded side effect inside this
!      insn.  This means it appears in a `post_inc', `pre_inc',
!      `post_dec' or `pre_dec' expression.
  
! `REG_NONNEG'
!      The register OP is known to have a nonnegative value when this
!      insn is reached.  This is used so that decrement and branch until
!      zero instructions, such as the m68k dbra, can be matched.
  
!      The `REG_NONNEG' note is added to insns only if the machine
!      description has a `decrement_and_branch_until_zero' pattern.
  
! `REG_LABEL_OPERAND'
!      This insn uses OP, a `code_label' or a `note' of type
!      `NOTE_INSN_DELETED_LABEL', but is not a `jump_insn', or it is a
!      `jump_insn' that refers to the operand as an ordinary operand.
!      The label may still eventually be a jump target, but if so in an
       indirect jump in a subsequent insn.  The presence of this note
       allows jump optimization to be aware that OP is, in fact, being
       used, and flow optimization to build an accurate flow graph.
  
! `REG_LABEL_TARGET'
!      This insn is a `jump_insn' but not an `addr_vec' or
!      `addr_diff_vec'.  It uses OP, a `code_label' as a direct or
       indirect jump target.  Its purpose is similar to that of
!      `REG_LABEL_OPERAND'.  This note is only present if the insn has
       multiple targets; the last label in the insn (in the highest
!      numbered insn-field) goes into the `JUMP_LABEL' field and does not
!      have a `REG_LABEL_TARGET' note.  *Note JUMP_LABEL: Insns.
  
! `REG_CROSSING_JUMP'
       This insn is a branching instruction (either an unconditional jump
       or an indirect jump) which crosses between hot and cold sections,
       which could potentially be very far apart in the executable.  The
       presence of this note indicates to other optimizations that this
       branching instruction should not be "collapsed" into a simpler
!      branching construct.  It is used when the optimization to
!      partition basic blocks into hot and cold sections is turned on.
  
! `REG_SETJMP'
!      Appears attached to each `CALL_INSN' to `setjmp' or a related
       function.
  
   The following notes describe attributes of outputs of an insn:
  
! `REG_EQUIV'
! `REG_EQUAL'
       This note is only valid on an insn that sets only one register and
       indicates that that register will be equal to OP at run time; the
       scope of this equivalence differs between the two types of notes.
       The value which the insn explicitly copies into the register may
       look different from OP, but they will be equal at run time.  If the
!      output of the single `set' is a `strict_low_part' expression, the
!      note refers to the register that is contained in `SUBREG_REG' of
!      the `subreg' expression.
  
!      For `REG_EQUIV', the register is equivalent to OP throughout the
       entire function, and could validly be replaced in all its
       occurrences by OP.  ("Validly" here refers to the data flow of the
       program; simple replacement may make some insns invalid.)  For
--- 16915,16986 ----
       this insn since OP is not necessarily modified by this insn.
       Rather, no subsequent instruction uses the contents of OP.
  
! 'REG_UNUSED'
       The register OP being set by this insn will not be used in a
!      subsequent insn.  This differs from a 'REG_DEAD' note, which
       indicates that the value in an input will not be used subsequently.
       These two notes are independent; both may be present for the same
       register.
  
! 'REG_INC'
!      The register OP is incremented (or decremented; at this level there
!      is no distinction) by an embedded side effect inside this insn.
!      This means it appears in a 'post_inc', 'pre_inc', 'post_dec' or
!      'pre_dec' expression.
  
! 'REG_NONNEG'
!      The register OP is known to have a nonnegative value when this insn
!      is reached.  This is used so that decrement and branch until zero
!      instructions, such as the m68k dbra, can be matched.
  
!      The 'REG_NONNEG' note is added to insns only if the machine
!      description has a 'decrement_and_branch_until_zero' pattern.
  
! 'REG_LABEL_OPERAND'
!      This insn uses OP, a 'code_label' or a 'note' of type
!      'NOTE_INSN_DELETED_LABEL', but is not a 'jump_insn', or it is a
!      'jump_insn' that refers to the operand as an ordinary operand.  The
!      label may still eventually be a jump target, but if so in an
       indirect jump in a subsequent insn.  The presence of this note
       allows jump optimization to be aware that OP is, in fact, being
       used, and flow optimization to build an accurate flow graph.
  
! 'REG_LABEL_TARGET'
!      This insn is a 'jump_insn' but not an 'addr_vec' or
!      'addr_diff_vec'.  It uses OP, a 'code_label' as a direct or
       indirect jump target.  Its purpose is similar to that of
!      'REG_LABEL_OPERAND'.  This note is only present if the insn has
       multiple targets; the last label in the insn (in the highest
!      numbered insn-field) goes into the 'JUMP_LABEL' field and does not
!      have a 'REG_LABEL_TARGET' note.  *Note JUMP_LABEL: Insns.
  
! 'REG_CROSSING_JUMP'
       This insn is a branching instruction (either an unconditional jump
       or an indirect jump) which crosses between hot and cold sections,
       which could potentially be very far apart in the executable.  The
       presence of this note indicates to other optimizations that this
       branching instruction should not be "collapsed" into a simpler
!      branching construct.  It is used when the optimization to partition
!      basic blocks into hot and cold sections is turned on.
  
! 'REG_SETJMP'
!      Appears attached to each 'CALL_INSN' to 'setjmp' or a related
       function.
  
   The following notes describe attributes of outputs of an insn:
  
! 'REG_EQUIV'
! 'REG_EQUAL'
       This note is only valid on an insn that sets only one register and
       indicates that that register will be equal to OP at run time; the
       scope of this equivalence differs between the two types of notes.
       The value which the insn explicitly copies into the register may
       look different from OP, but they will be equal at run time.  If the
!      output of the single 'set' is a 'strict_low_part' expression, the
!      note refers to the register that is contained in 'SUBREG_REG' of
!      the 'subreg' expression.
  
!      For 'REG_EQUIV', the register is equivalent to OP throughout the
       entire function, and could validly be replaced in all its
       occurrences by OP.  ("Validly" here refers to the data flow of the
       program; simple replacement may make some insns invalid.)  For
*************** values that are only used in `LOG_LINKS'
*** 17150,17172 ****
       When a parameter is copied into a pseudo-register at entry to a
       function, a note of this kind records that the register is
       equivalent to the stack slot where the parameter was passed.
!      Although in this case the register may be set by other insns, it
!      is still valid to replace the register by the stack slot
!      throughout the function.
  
!      A `REG_EQUIV' note is also used on an instruction which copies a
       register parameter into a pseudo-register at entry to a function,
       if there is a stack slot where that parameter could be stored.
       Although other insns may set the pseudo-register, it is valid for
       the compiler to replace the pseudo-register by stack slot
       throughout the function, provided the compiler ensures that the
!      stack slot is properly initialized by making the replacement in
!      the initial copy instruction as well.  This is used on machines
!      for which the calling convention allocates stack space for
!      register parameters.  See `REG_PARM_STACK_SPACE' in *note Stack
!      Arguments::.
  
!      In the case of `REG_EQUAL', the register that is set by this insn
       will be equal to OP at run time at the end of this insn but not
       necessarily elsewhere in the function.  In this case, OP is
       typically an arithmetic expression.  For example, when a sequence
--- 16990,17011 ----
       When a parameter is copied into a pseudo-register at entry to a
       function, a note of this kind records that the register is
       equivalent to the stack slot where the parameter was passed.
!      Although in this case the register may be set by other insns, it is
!      still valid to replace the register by the stack slot throughout
!      the function.
  
!      A 'REG_EQUIV' note is also used on an instruction which copies a
       register parameter into a pseudo-register at entry to a function,
       if there is a stack slot where that parameter could be stored.
       Although other insns may set the pseudo-register, it is valid for
       the compiler to replace the pseudo-register by stack slot
       throughout the function, provided the compiler ensures that the
!      stack slot is properly initialized by making the replacement in the
!      initial copy instruction as well.  This is used on machines for
!      which the calling convention allocates stack space for register
!      parameters.  See 'REG_PARM_STACK_SPACE' in *note Stack Arguments::.
  
!      In the case of 'REG_EQUAL', the register that is set by this insn
       will be equal to OP at run time at the end of this insn but not
       necessarily elsewhere in the function.  In this case, OP is
       typically an arithmetic expression.  For example, when a sequence
*************** values that are only used in `LOG_LINKS'
*** 17175,17261 ****
       or copies the final value.
  
       These two notes are used in different ways by the compiler passes.
!      `REG_EQUAL' is used by passes prior to register allocation (such as
       common subexpression elimination and loop optimization) to tell
!      them how to think of that value.  `REG_EQUIV' notes are used by
       register allocation to indicate that there is an available
!      substitute expression (either a constant or a `mem' expression for
!      the location of a parameter on the stack) that may be used in
!      place of a register if insufficient registers are available.
  
       Except for stack homes for parameters, which are indicated by a
!      `REG_EQUIV' note and are not useful to the early optimization
       passes and pseudo registers that are equivalent to a memory
       location throughout their entire life, which is not detected until
       later in the compilation, all equivalences are initially indicated
!      by an attached `REG_EQUAL' note.  In the early stages of register
!      allocation, a `REG_EQUAL' note is changed into a `REG_EQUIV' note
       if OP is a constant and the insn represents the only set of its
       destination register.
  
       Thus, compiler passes prior to register allocation need only check
!      for `REG_EQUAL' notes and passes subsequent to register allocation
!      need only check for `REG_EQUIV' notes.
  
   These notes describe linkages between insns.  They occur in pairs: one
  insn has one of a pair of notes that points to a second insn, which has
  the inverse note pointing back to the first insn.
  
! `REG_CC_SETTER'
! `REG_CC_USER'
!      On machines that use `cc0', the insns which set and use `cc0' set
!      and use `cc0' are adjacent.  However, when branch delay slot
       filling is done, this may no longer be true.  In this case a
!      `REG_CC_USER' note will be placed on the insn setting `cc0' to
!      point to the insn using `cc0' and a `REG_CC_SETTER' note will be
!      placed on the insn using `cc0' to point to the insn setting `cc0'.
  
!  These values are only used in the `LOG_LINKS' field, and indicate the
  type of dependency that each link represents.  Links which indicate a
  data dependence (a read after write dependence) do not use any code,
! they simply have mode `VOIDmode', and are printed without any
  descriptive text.
  
! `REG_DEP_TRUE'
       This indicates a true dependence (a read after write dependence).
  
! `REG_DEP_OUTPUT'
       This indicates an output dependence (a write after write
       dependence).
  
! `REG_DEP_ANTI'
       This indicates an anti dependence (a write after read dependence).
  
- 
   These notes describe information gathered from gcov profile data.  They
! are stored in the `REG_NOTES' field of an insn.
  
! `REG_BR_PROB'
       This is used to specify the ratio of branches to non-branches of a
       branch insn according to the profile data.  The note is represented
!      as an `int_list' expression whose integer value is between 0 and
!      REG_BR_PROB_BASE.  Larger values indicate a higher probability that
       the branch will be taken.
  
! `REG_BR_PRED'
       These notes are found in JUMP insns after delayed branch scheduling
       has taken place.  They indicate both the direction and the
       likelihood of the JUMP.  The format is a bitmask of ATTR_FLAG_*
       values.
  
! `REG_FRAME_RELATED_EXPR'
       This is used on an RTX_FRAME_RELATED_P insn wherein the attached
       expression is used in place of the actual insn pattern.  This is
       done in cases where the pattern is either complex or misleading.
  
!  For convenience, the machine mode in an `insn_list' or `expr_list' is
  printed using these symbolic codes in debugging dumps.
  
!  The only difference between the expression codes `insn_list' and
! `expr_list' is that the first operand of an `insn_list' is assumed to
! be an insn and is printed in debugging dumps as the insn's unique id;
! the first operand of an `expr_list' is printed in the ordinary way as
! an expression.
  
  
  File: gccint.info,  Node: Calls,  Next: Sharing,  Prev: Insns,  Up: RTL
--- 17014,17099 ----
       or copies the final value.
  
       These two notes are used in different ways by the compiler passes.
!      'REG_EQUAL' is used by passes prior to register allocation (such as
       common subexpression elimination and loop optimization) to tell
!      them how to think of that value.  'REG_EQUIV' notes are used by
       register allocation to indicate that there is an available
!      substitute expression (either a constant or a 'mem' expression for
!      the location of a parameter on the stack) that may be used in place
!      of a register if insufficient registers are available.
  
       Except for stack homes for parameters, which are indicated by a
!      'REG_EQUIV' note and are not useful to the early optimization
       passes and pseudo registers that are equivalent to a memory
       location throughout their entire life, which is not detected until
       later in the compilation, all equivalences are initially indicated
!      by an attached 'REG_EQUAL' note.  In the early stages of register
!      allocation, a 'REG_EQUAL' note is changed into a 'REG_EQUIV' note
       if OP is a constant and the insn represents the only set of its
       destination register.
  
       Thus, compiler passes prior to register allocation need only check
!      for 'REG_EQUAL' notes and passes subsequent to register allocation
!      need only check for 'REG_EQUIV' notes.
  
   These notes describe linkages between insns.  They occur in pairs: one
  insn has one of a pair of notes that points to a second insn, which has
  the inverse note pointing back to the first insn.
  
! 'REG_CC_SETTER'
! 'REG_CC_USER'
!      On machines that use 'cc0', the insns which set and use 'cc0' set
!      and use 'cc0' are adjacent.  However, when branch delay slot
       filling is done, this may no longer be true.  In this case a
!      'REG_CC_USER' note will be placed on the insn setting 'cc0' to
!      point to the insn using 'cc0' and a 'REG_CC_SETTER' note will be
!      placed on the insn using 'cc0' to point to the insn setting 'cc0'.
  
!  These values are only used in the 'LOG_LINKS' field, and indicate the
  type of dependency that each link represents.  Links which indicate a
  data dependence (a read after write dependence) do not use any code,
! they simply have mode 'VOIDmode', and are printed without any
  descriptive text.
  
! 'REG_DEP_TRUE'
       This indicates a true dependence (a read after write dependence).
  
! 'REG_DEP_OUTPUT'
       This indicates an output dependence (a write after write
       dependence).
  
! 'REG_DEP_ANTI'
       This indicates an anti dependence (a write after read dependence).
  
   These notes describe information gathered from gcov profile data.  They
! are stored in the 'REG_NOTES' field of an insn.
  
! 'REG_BR_PROB'
       This is used to specify the ratio of branches to non-branches of a
       branch insn according to the profile data.  The note is represented
!      as an 'int_list' expression whose integer value is between 0 and
!      REG_BR_PROB_BASE. Larger values indicate a higher probability that
       the branch will be taken.
  
! 'REG_BR_PRED'
       These notes are found in JUMP insns after delayed branch scheduling
       has taken place.  They indicate both the direction and the
       likelihood of the JUMP.  The format is a bitmask of ATTR_FLAG_*
       values.
  
! 'REG_FRAME_RELATED_EXPR'
       This is used on an RTX_FRAME_RELATED_P insn wherein the attached
       expression is used in place of the actual insn pattern.  This is
       done in cases where the pattern is either complex or misleading.
  
!  For convenience, the machine mode in an 'insn_list' or 'expr_list' is
  printed using these symbolic codes in debugging dumps.
  
!  The only difference between the expression codes 'insn_list' and
! 'expr_list' is that the first operand of an 'insn_list' is assumed to be
! an insn and is printed in debugging dumps as the insn's unique id; the
! first operand of an 'expr_list' is printed in the ordinary way as an
! expression.
  
  
  File: gccint.info,  Node: Calls,  Next: Sharing,  Prev: Insns,  Up: RTL
*************** File: gccint.info,  Node: Calls,  Next:
*** 17263,17286 ****
  13.20 RTL Representation of Function-Call Insns
  ===============================================
  
! Insns that call subroutines have the RTL expression code `call_insn'.
  These insns must satisfy special rules, and their bodies must use a
! special RTL expression code, `call'.
  
!  A `call' expression has two operands, as follows:
  
       (call (mem:FM ADDR) NBYTES)
  
  Here NBYTES is an operand that represents the number of bytes of
  argument data being passed to the subroutine, FM is a machine mode
! (which must equal as the definition of the `FUNCTION_MODE' macro in the
  machine description) and ADDR represents the address of the subroutine.
  
!  For a subroutine that returns no value, the `call' expression as shown
  above is the entire body of the insn, except that the insn might also
! contain `use' or `clobber' expressions.
  
!  For a subroutine that returns a value whose mode is not `BLKmode', the
  value is returned in a hard register.  If this register's number is R,
  then the body of the call insn looks like this:
  
--- 17101,17124 ----
  13.20 RTL Representation of Function-Call Insns
  ===============================================
  
! Insns that call subroutines have the RTL expression code 'call_insn'.
  These insns must satisfy special rules, and their bodies must use a
! special RTL expression code, 'call'.
  
!  A 'call' expression has two operands, as follows:
  
       (call (mem:FM ADDR) NBYTES)
  
  Here NBYTES is an operand that represents the number of bytes of
  argument data being passed to the subroutine, FM is a machine mode
! (which must equal as the definition of the 'FUNCTION_MODE' macro in the
  machine description) and ADDR represents the address of the subroutine.
  
!  For a subroutine that returns no value, the 'call' expression as shown
  above is the entire body of the insn, except that the insn might also
! contain 'use' or 'clobber' expressions.
  
!  For a subroutine that returns a value whose mode is not 'BLKmode', the
  value is returned in a hard register.  If this register's number is R,
  then the body of the call insn looks like this:
  
*************** then the body of the call insn looks lik
*** 17290,17319 ****
  This RTL expression makes it clear (to the optimizer passes) that the
  appropriate register receives a useful value in this insn.
  
!  When a subroutine returns a `BLKmode' value, it is handled by passing
  to the subroutine the address of a place to store the value.  So the
  call insn itself does not "return" any value, and it has the same RTL
  form as a call that returns nothing.
  
   On some machines, the call instruction itself clobbers some register,
! for example to contain the return address.  `call_insn' insns on these
! machines should have a body which is a `parallel' that contains both
! the `call' expression and `clobber' expressions that indicate which
  registers are destroyed.  Similarly, if the call instruction requires
  some register other than the stack pointer that is not explicitly
! mentioned in its RTL, a `use' subexpression should mention that
  register.
  
   Functions that are called are assumed to modify all registers listed in
! the configuration macro `CALL_USED_REGISTERS' (*note Register Basics::)
! and, with the exception of `const' functions and library calls, to
  modify all of memory.
  
!  Insns containing just `use' expressions directly precede the
! `call_insn' insn to indicate which registers contain inputs to the
  function.  Similarly, if registers other than those in
! `CALL_USED_REGISTERS' are clobbered by the called function, insns
! containing a single `clobber' follow immediately after the call to
  indicate which registers.
  
  
--- 17128,17157 ----
  This RTL expression makes it clear (to the optimizer passes) that the
  appropriate register receives a useful value in this insn.
  
!  When a subroutine returns a 'BLKmode' value, it is handled by passing
  to the subroutine the address of a place to store the value.  So the
  call insn itself does not "return" any value, and it has the same RTL
  form as a call that returns nothing.
  
   On some machines, the call instruction itself clobbers some register,
! for example to contain the return address.  'call_insn' insns on these
! machines should have a body which is a 'parallel' that contains both the
! 'call' expression and 'clobber' expressions that indicate which
  registers are destroyed.  Similarly, if the call instruction requires
  some register other than the stack pointer that is not explicitly
! mentioned in its RTL, a 'use' subexpression should mention that
  register.
  
   Functions that are called are assumed to modify all registers listed in
! the configuration macro 'CALL_USED_REGISTERS' (*note Register Basics::)
! and, with the exception of 'const' functions and library calls, to
  modify all of memory.
  
!  Insns containing just 'use' expressions directly precede the
! 'call_insn' insn to indicate which registers contain inputs to the
  function.  Similarly, if registers other than those in
! 'CALL_USED_REGISTERS' are clobbered by the called function, insns
! containing a single 'clobber' follow immediately after the call to
  indicate which registers.
  
  
*************** File: gccint.info,  Node: Sharing,  Next
*** 17323,17371 ****
  ===================================
  
  The compiler assumes that certain kinds of RTL expressions are unique;
! there do not exist two distinct objects representing the same value.
! In other cases, it makes an opposite assumption: that no RTL expression
  object of a certain kind appears in more than one place in the
  containing structure.
  
   These assumptions refer to a single function; except for the RTL
! objects that describe global variables and external functions, and a
! few standard objects such as small integer constants, no RTL objects
! are common to two functions.
  
!    * Each pseudo-register has only a single `reg' object to represent
       it, and therefore only a single machine mode.
  
!    * For any symbolic label, there is only one `symbol_ref' object
       referring to it.
  
!    * All `const_int' expressions with equal values are shared.
  
!    * There is only one `pc' expression.
  
!    * There is only one `cc0' expression.
  
!    * There is only one `const_double' expression with value 0 for each
       floating point mode.  Likewise for values 1 and 2.
  
!    * There is only one `const_vector' expression with value 0 for each
       vector mode, be it an integer or a double constant vector.
  
!    * No `label_ref' or `scratch' appears in more than one place in the
       RTL structure; in other words, it is safe to do a tree-walk of all
!      the insns in the function and assume that each time a `label_ref'
!      or `scratch' is seen it is distinct from all others that are seen.
  
!    * Only one `mem' object is normally created for each static variable
       or stack slot, so these objects are frequently shared in all the
       places they appear.  However, separate but equal objects for these
       variables are occasionally made.
  
!    * When a single `asm' statement has multiple output operands, a
!      distinct `asm_operands' expression is made for each output operand.
       However, these all share the vector which contains the sequence of
       input operands.  This sharing is used later on to test whether two
!      `asm_operands' expressions come from the same statement, so all
       optimizations must carefully preserve the sharing if they copy the
       vector at all.
  
--- 17161,17209 ----
  ===================================
  
  The compiler assumes that certain kinds of RTL expressions are unique;
! there do not exist two distinct objects representing the same value.  In
! other cases, it makes an opposite assumption: that no RTL expression
  object of a certain kind appears in more than one place in the
  containing structure.
  
   These assumptions refer to a single function; except for the RTL
! objects that describe global variables and external functions, and a few
! standard objects such as small integer constants, no RTL objects are
! common to two functions.
  
!    * Each pseudo-register has only a single 'reg' object to represent
       it, and therefore only a single machine mode.
  
!    * For any symbolic label, there is only one 'symbol_ref' object
       referring to it.
  
!    * All 'const_int' expressions with equal values are shared.
  
!    * There is only one 'pc' expression.
  
!    * There is only one 'cc0' expression.
  
!    * There is only one 'const_double' expression with value 0 for each
       floating point mode.  Likewise for values 1 and 2.
  
!    * There is only one 'const_vector' expression with value 0 for each
       vector mode, be it an integer or a double constant vector.
  
!    * No 'label_ref' or 'scratch' appears in more than one place in the
       RTL structure; in other words, it is safe to do a tree-walk of all
!      the insns in the function and assume that each time a 'label_ref'
!      or 'scratch' is seen it is distinct from all others that are seen.
  
!    * Only one 'mem' object is normally created for each static variable
       or stack slot, so these objects are frequently shared in all the
       places they appear.  However, separate but equal objects for these
       variables are occasionally made.
  
!    * When a single 'asm' statement has multiple output operands, a
!      distinct 'asm_operands' expression is made for each output operand.
       However, these all share the vector which contains the sequence of
       input operands.  This sharing is used later on to test whether two
!      'asm_operands' expressions come from the same statement, so all
       optimizations must carefully preserve the sharing if they copy the
       vector at all.
  
*************** are common to two functions.
*** 17376,17389 ****
  
     * During initial RTL generation, shared structure is freely
       introduced.  After all the RTL for a function has been generated,
!      all shared structure is copied by `unshare_all_rtl' in
!      `emit-rtl.c', after which the above rules are guaranteed to be
       followed.
  
     * During the combiner pass, shared structure within an insn can exist
       temporarily.  However, the shared structure is copied before the
       combiner is finished with the insn.  This is done by calling
!      `copy_rtx_if_shared', which is a subroutine of `unshare_all_rtl'.
  
  
  File: gccint.info,  Node: Reading RTL,  Prev: Sharing,  Up: RTL
--- 17214,17227 ----
  
     * During initial RTL generation, shared structure is freely
       introduced.  After all the RTL for a function has been generated,
!      all shared structure is copied by 'unshare_all_rtl' in
!      'emit-rtl.c', after which the above rules are guaranteed to be
       followed.
  
     * During the combiner pass, shared structure within an insn can exist
       temporarily.  However, the shared structure is copied before the
       combiner is finished with the insn.  This is done by calling
!      'copy_rtx_if_shared', which is a subroutine of 'unshare_all_rtl'.
  
  
  File: gccint.info,  Node: Reading RTL,  Prev: Sharing,  Up: RTL
*************** File: gccint.info,  Node: Reading RTL,
*** 17391,17401 ****
  13.22 Reading RTL
  =================
  
! To read an RTL object from a file, call `read_rtx'.  It takes one
  argument, a stdio stream, and returns a single RTL object.  This routine
! is defined in `read-rtl.c'.  It is not available in the compiler
! itself, only the various programs that generate the compiler back end
! from the machine description.
  
   People frequently have the idea of using RTL stored as text in a file
  as an interface between a language front end and the bulk of GCC.  This
--- 17229,17239 ----
  13.22 Reading RTL
  =================
  
! To read an RTL object from a file, call 'read_rtx'.  It takes one
  argument, a stdio stream, and returns a single RTL object.  This routine
! is defined in 'read-rtl.c'.  It is not available in the compiler itself,
! only the various programs that generate the compiler back end from the
! machine description.
  
   People frequently have the idea of using RTL stored as text in a file
  as an interface between a language front end and the bulk of GCC.  This
*************** idea is not feasible.
*** 17405,17414 ****
  program is very dependent on the particular target machine.  And the RTL
  does not contain all the information about the program.
  
!  The proper way to interface GCC to a new language front end is with
! the "tree" data structure, described in the files `tree.h' and
! `tree.def'.  The documentation for this structure (*note GENERIC::) is
! incomplete.
  
  
  File: gccint.info,  Node: Control Flow,  Next: Loop Analysis and Representation,  Prev: RTL,  Up: Top
--- 17243,17251 ----
  program is very dependent on the particular target machine.  And the RTL
  does not contain all the information about the program.
  
!  The proper way to interface GCC to a new language front end is with the
! "tree" data structure, described in the files 'tree.h' and 'tree.def'.
! The documentation for this structure (*note GENERIC::) is incomplete.
  
  
  File: gccint.info,  Node: Control Flow,  Next: Loop Analysis and Representation,  Prev: RTL,  Up: Top
*************** File: gccint.info,  Node: Control Flow,
*** 17417,17437 ****
  *********************
  
  A control flow graph (CFG) is a data structure built on top of the
! intermediate code representation (the RTL or `GIMPLE' instruction
  stream) abstracting the control flow behavior of a function that is
  being compiled.  The CFG is a directed graph where the vertices
  represent basic blocks and edges represent possible transfer of control
  flow from one basic block to another.  The data structures used to
! represent the control flow graph are defined in `basic-block.h'.
  
!  In GCC, the representation of control flow is maintained throughout
! the compilation process, from constructing the CFG early in
! `pass_build_cfg' to `pass_free_cfg' (see `passes.def').  The CFG takes
! various different modes and may undergo extensive manipulations, but
! the graph is always valid between its construction and its release.
! This way, transfer of information such as data flow, a measured
! profile, or the loop tree, can be propagated through the passes
! pipeline, and even from `GIMPLE' to `RTL'.
  
   Often the CFG may be better viewed as integral part of instruction
  chain, than structure built on the top of it.  Updating the compiler's
--- 17254,17274 ----
  *********************
  
  A control flow graph (CFG) is a data structure built on top of the
! intermediate code representation (the RTL or 'GIMPLE' instruction
  stream) abstracting the control flow behavior of a function that is
  being compiled.  The CFG is a directed graph where the vertices
  represent basic blocks and edges represent possible transfer of control
  flow from one basic block to another.  The data structures used to
! represent the control flow graph are defined in 'basic-block.h'.
  
!  In GCC, the representation of control flow is maintained throughout the
! compilation process, from constructing the CFG early in 'pass_build_cfg'
! to 'pass_free_cfg' (see 'passes.def').  The CFG takes various different
! modes and may undergo extensive manipulations, but the graph is always
! valid between its construction and its release.  This way, transfer of
! information such as data flow, a measured profile, or the loop tree, can
! be propagated through the passes pipeline, and even from 'GIMPLE' to
! 'RTL'.
  
   Often the CFG may be better viewed as integral part of instruction
  chain, than structure built on the top of it.  Updating the compiler's
*************** File: gccint.info,  Node: Basic Blocks,
*** 17453,17502 ****
  =================
  
  A basic block is a straight-line sequence of code with only one entry
! point and only one exit.  In GCC, basic blocks are represented using
! the `basic_block' data type.
  
   Special basic blocks represent possible entry and exit points of a
! function.  These blocks are called `ENTRY_BLOCK_PTR' and
! `EXIT_BLOCK_PTR'.  These blocks do not contain any code.
  
!  The `BASIC_BLOCK' array contains all basic blocks in an unspecified
! order.  Each `basic_block' structure has a field that holds a unique
! integer identifier `index' that is the index of the block in the
! `BASIC_BLOCK' array.  The total number of basic blocks in the function
! is `n_basic_blocks'.  Both the basic block indices and the total number
  of basic blocks may vary during the compilation process, as passes
! reorder, create, duplicate, and destroy basic blocks.  The index for
! any block should never be greater than `last_basic_block'.  The indices
! 0 and 1 are special codes reserved for `ENTRY_BLOCK' and `EXIT_BLOCK',
! the indices of `ENTRY_BLOCK_PTR' and `EXIT_BLOCK_PTR'.
  
!  Two pointer members of the `basic_block' structure are the pointers
! `next_bb' and `prev_bb'.  These are used to keep doubly linked chain of
  basic blocks in the same order as the underlying instruction stream.
  The chain of basic blocks is updated transparently by the provided API
! for manipulating the CFG.  The macro `FOR_EACH_BB' can be used to visit
! all the basic blocks in lexicographical order, except `ENTRY_BLOCK' and
! `EXIT_BLOCK'.  The macro `FOR_ALL_BB' also visits all basic blocks in
! lexicographical order, including `ENTRY_BLOCK' and `EXIT_BLOCK'.
  
!  The functions `post_order_compute' and `inverted_post_order_compute'
! can be used to compute topological orders of the CFG.  The orders are
! stored as vectors of basic block indices.  The `BASIC_BLOCK' array can
  be used to iterate each basic block by index.  Dominator traversals are
! also possible using `walk_dominator_tree'.  Given two basic blocks A
! and B, block A dominates block B if A is _always_ executed before B.
  
!  Each `basic_block' also contains pointers to the first instruction
! (the "head") and the last instruction (the "tail") or "end" of the
  instruction stream contained in a basic block.  In fact, since the
! `basic_block' data type is used to represent blocks in both major
! intermediate representations of GCC (`GIMPLE' and RTL), there are
  pointers to the head and end of a basic block for both representations,
! stored in intermediate representation specific data in the `il' field
! of `struct basic_block_def'.
  
!  For RTL, these pointers are `BB_HEAD' and `BB_END'.
  
   In the RTL representation of a function, the instruction stream
  contains not only the "real" instructions, but also "notes" or "insn
--- 17290,17339 ----
  =================
  
  A basic block is a straight-line sequence of code with only one entry
! point and only one exit.  In GCC, basic blocks are represented using the
! 'basic_block' data type.
  
   Special basic blocks represent possible entry and exit points of a
! function.  These blocks are called 'ENTRY_BLOCK_PTR' and
! 'EXIT_BLOCK_PTR'.  These blocks do not contain any code.
  
!  The 'BASIC_BLOCK' array contains all basic blocks in an unspecified
! order.  Each 'basic_block' structure has a field that holds a unique
! integer identifier 'index' that is the index of the block in the
! 'BASIC_BLOCK' array.  The total number of basic blocks in the function
! is 'n_basic_blocks'.  Both the basic block indices and the total number
  of basic blocks may vary during the compilation process, as passes
! reorder, create, duplicate, and destroy basic blocks.  The index for any
! block should never be greater than 'last_basic_block'.  The indices 0
! and 1 are special codes reserved for 'ENTRY_BLOCK' and 'EXIT_BLOCK', the
! indices of 'ENTRY_BLOCK_PTR' and 'EXIT_BLOCK_PTR'.
  
!  Two pointer members of the 'basic_block' structure are the pointers
! 'next_bb' and 'prev_bb'.  These are used to keep doubly linked chain of
  basic blocks in the same order as the underlying instruction stream.
  The chain of basic blocks is updated transparently by the provided API
! for manipulating the CFG.  The macro 'FOR_EACH_BB' can be used to visit
! all the basic blocks in lexicographical order, except 'ENTRY_BLOCK' and
! 'EXIT_BLOCK'.  The macro 'FOR_ALL_BB' also visits all basic blocks in
! lexicographical order, including 'ENTRY_BLOCK' and 'EXIT_BLOCK'.
  
!  The functions 'post_order_compute' and 'inverted_post_order_compute'
! can be used to compute topological orders of the CFG. The orders are
! stored as vectors of basic block indices.  The 'BASIC_BLOCK' array can
  be used to iterate each basic block by index.  Dominator traversals are
! also possible using 'walk_dominator_tree'.  Given two basic blocks A and
! B, block A dominates block B if A is _always_ executed before B.
  
!  Each 'basic_block' also contains pointers to the first instruction (the
! "head") and the last instruction (the "tail") or "end" of the
  instruction stream contained in a basic block.  In fact, since the
! 'basic_block' data type is used to represent blocks in both major
! intermediate representations of GCC ('GIMPLE' and RTL), there are
  pointers to the head and end of a basic block for both representations,
! stored in intermediate representation specific data in the 'il' field of
! 'struct basic_block_def'.
  
!  For RTL, these pointers are 'BB_HEAD' and 'BB_END'.
  
   In the RTL representation of a function, the instruction stream
  contains not only the "real" instructions, but also "notes" or "insn
*************** notes" (to distinguish them from "reg no
*** 17504,17540 ****
  or duplicates the basic blocks needs to take care of updating of these
  notes.  Many of these notes expect that the instruction stream consists
  of linear regions, so updating can sometimes be tedious.  All types of
! insn notes are defined in `insn-notes.def'.
  
   In the RTL function representation, the instructions contained in a
! basic block always follow a `NOTE_INSN_BASIC_BLOCK', but zero or more
! `CODE_LABEL' nodes can precede the block note.  A basic block ends with
  a control flow instruction or with the last instruction before the next
! `CODE_LABEL' or `NOTE_INSN_BASIC_BLOCK'.  By definition, a `CODE_LABEL'
  cannot appear in the middle of the instruction stream of a basic block.
  
   In addition to notes, the jump table vectors are also represented as
  "pseudo-instructions" inside the insn stream.  These vectors never
  appear in the basic block and should always be placed just after the
! table jump instructions referencing them.  After removing the
! table-jump it is often difficult to eliminate the code computing the
! address and referencing the vector, so cleaning up these vectors is
! postponed until after liveness analysis.   Thus the jump table vectors
! may appear in the insn stream unreferenced and without any purpose.
! Before any edge is made "fall-thru", the existence of such construct in
! the way needs to be checked by calling `can_fallthru' function.
  
!  For the `GIMPLE' representation, the PHI nodes and statements
! contained in a basic block are in a `gimple_seq' pointed to by the
! basic block intermediate language specific pointers.  Abstract
! containers and iterators are used to access the PHI nodes and
! statements in a basic blocks.  These iterators are called "GIMPLE
! statement iterators" (GSIs).  Grep for `^gsi' in the various `gimple-*'
! and `tree-*' files.  There is a `gimple_stmt_iterator' type for
! iterating over all kinds of statement, and a `gphi_iterator' subclass
! for iterating over PHI nodes.  The following snippet will pretty-print
! all PHI nodes the statements of the current function in the GIMPLE
! representation.
  
       basic_block bb;
  
--- 17341,17376 ----
  or duplicates the basic blocks needs to take care of updating of these
  notes.  Many of these notes expect that the instruction stream consists
  of linear regions, so updating can sometimes be tedious.  All types of
! insn notes are defined in 'insn-notes.def'.
  
   In the RTL function representation, the instructions contained in a
! basic block always follow a 'NOTE_INSN_BASIC_BLOCK', but zero or more
! 'CODE_LABEL' nodes can precede the block note.  A basic block ends with
  a control flow instruction or with the last instruction before the next
! 'CODE_LABEL' or 'NOTE_INSN_BASIC_BLOCK'.  By definition, a 'CODE_LABEL'
  cannot appear in the middle of the instruction stream of a basic block.
  
   In addition to notes, the jump table vectors are also represented as
  "pseudo-instructions" inside the insn stream.  These vectors never
  appear in the basic block and should always be placed just after the
! table jump instructions referencing them.  After removing the table-jump
! it is often difficult to eliminate the code computing the address and
! referencing the vector, so cleaning up these vectors is postponed until
! after liveness analysis.  Thus the jump table vectors may appear in the
! insn stream unreferenced and without any purpose.  Before any edge is
! made "fall-thru", the existence of such construct in the way needs to be
! checked by calling 'can_fallthru' function.
  
!  For the 'GIMPLE' representation, the PHI nodes and statements contained
! in a basic block are in a 'gimple_seq' pointed to by the basic block
! intermediate language specific pointers.  Abstract containers and
! iterators are used to access the PHI nodes and statements in a basic
! blocks.  These iterators are called "GIMPLE statement iterators" (GSIs).
! Grep for '^gsi' in the various 'gimple-*' and 'tree-*' files.  There is
! a 'gimple_stmt_iterator' type for iterating over all kinds of statement,
! and a 'gphi_iterator' subclass for iterating over PHI nodes.  The
! following snippet will pretty-print all PHI nodes the statements of the
! current function in the GIMPLE representation.
  
       basic_block bb;
  
*************** File: gccint.info,  Node: Edges,  Next:
*** 17564,17616 ****
  Edges represent possible control flow transfers from the end of some
  basic block A to the head of another basic block B.  We say that A is a
  predecessor of B, and B is a successor of A.  Edges are represented in
! GCC with the `edge' data type.  Each `edge' acts as a link between two
! basic blocks: The `src' member of an edge points to the predecessor
! basic block of the `dest' basic block.  The members `preds' and `succs'
! of the `basic_block' data type point to type-safe vectors of edges to
  the predecessors and successors of the block.
  
   When walking the edges in an edge vector, "edge iterators" should be
! used.  Edge iterators are constructed using the `edge_iterator' data
  structure and several methods are available to operate on them:
  
! `ei_start'
!      This function initializes an `edge_iterator' that points to the
       first edge in a vector of edges.
  
! `ei_last'
!      This function initializes an `edge_iterator' that points to the
       last edge in a vector of edges.
  
! `ei_end_p'
!      This predicate is `true' if an `edge_iterator' represents the last
       edge in an edge vector.
  
! `ei_one_before_end_p'
!      This predicate is `true' if an `edge_iterator' represents the
       second last edge in an edge vector.
  
! `ei_next'
!      This function takes a pointer to an `edge_iterator' and makes it
       point to the next edge in the sequence.
  
! `ei_prev'
!      This function takes a pointer to an `edge_iterator' and makes it
       point to the previous edge in the sequence.
  
! `ei_edge'
!      This function returns the `edge' currently pointed to by an
!      `edge_iterator'.
  
! `ei_safe_safe'
!      This function returns the `edge' currently pointed to by an
!      `edge_iterator', but returns `NULL' if the iterator is pointing at
       the end of the sequence.  This function has been provided for
!      existing code makes the assumption that a `NULL' edge indicates
!      the end of the sequence.
! 
  
!  The convenience macro `FOR_EACH_EDGE' can be used to visit all of the
  edges in a sequence of predecessor or successor edges.  It must not be
  used when an element might be removed during the traversal, otherwise
  elements will be missed.  Here is an example of how to use the macro:
--- 17400,17451 ----
  Edges represent possible control flow transfers from the end of some
  basic block A to the head of another basic block B.  We say that A is a
  predecessor of B, and B is a successor of A.  Edges are represented in
! GCC with the 'edge' data type.  Each 'edge' acts as a link between two
! basic blocks: The 'src' member of an edge points to the predecessor
! basic block of the 'dest' basic block.  The members 'preds' and 'succs'
! of the 'basic_block' data type point to type-safe vectors of edges to
  the predecessors and successors of the block.
  
   When walking the edges in an edge vector, "edge iterators" should be
! used.  Edge iterators are constructed using the 'edge_iterator' data
  structure and several methods are available to operate on them:
  
! 'ei_start'
!      This function initializes an 'edge_iterator' that points to the
       first edge in a vector of edges.
  
! 'ei_last'
!      This function initializes an 'edge_iterator' that points to the
       last edge in a vector of edges.
  
! 'ei_end_p'
!      This predicate is 'true' if an 'edge_iterator' represents the last
       edge in an edge vector.
  
! 'ei_one_before_end_p'
!      This predicate is 'true' if an 'edge_iterator' represents the
       second last edge in an edge vector.
  
! 'ei_next'
!      This function takes a pointer to an 'edge_iterator' and makes it
       point to the next edge in the sequence.
  
! 'ei_prev'
!      This function takes a pointer to an 'edge_iterator' and makes it
       point to the previous edge in the sequence.
  
! 'ei_edge'
!      This function returns the 'edge' currently pointed to by an
!      'edge_iterator'.
  
! 'ei_safe_safe'
!      This function returns the 'edge' currently pointed to by an
!      'edge_iterator', but returns 'NULL' if the iterator is pointing at
       the end of the sequence.  This function has been provided for
!      existing code makes the assumption that a 'NULL' edge indicates the
!      end of the sequence.
  
!  The convenience macro 'FOR_EACH_EDGE' can be used to visit all of the
  edges in a sequence of predecessor or successor edges.  It must not be
  used when an element might be removed during the traversal, otherwise
  elements will be missed.  Here is an example of how to use the macro:
*************** elements will be missed.  Here is an exa
*** 17626,17637 ****
  
   There are various reasons why control flow may transfer from one block
  to another.  One possibility is that some instruction, for example a
! `CODE_LABEL', in a linearized instruction stream just always starts a
  new basic block.  In this case a "fall-thru" edge links the basic block
! to the first following basic block.  But there are several other
! reasons why edges may be created.  The `flags' field of the `edge' data
! type is used to store information about the type of edge we are dealing
! with.  Each edge is of one of the following types:
  
  _jump_
       No type flags are set for edges corresponding to jump instructions.
--- 17461,17472 ----
  
   There are various reasons why control flow may transfer from one block
  to another.  One possibility is that some instruction, for example a
! 'CODE_LABEL', in a linearized instruction stream just always starts a
  new basic block.  In this case a "fall-thru" edge links the basic block
! to the first following basic block.  But there are several other reasons
! why edges may be created.  The 'flags' field of the 'edge' data type is
! used to store information about the type of edge we are dealing with.
! Each edge is of one of the following types:
  
  _jump_
       No type flags are set for edges corresponding to jump instructions.
*************** _jump_
*** 17643,17654 ****
  _fall-thru_
       Fall-thru edges are present in case where the basic block may
       continue execution to the following one without branching.  These
!      edges have the `EDGE_FALLTHRU' flag set.  Unlike other types of
       edges, these edges must come into the basic block immediately
       following in the instruction stream.  The function
!      `force_nonfallthru' is available to insert an unconditional jump
!      in the case that redirection is needed.  Note that this may
!      require creation of a new basic block.
  
  _exception handling_
       Exception handling edges represent possible control transfers from
--- 17478,17489 ----
  _fall-thru_
       Fall-thru edges are present in case where the basic block may
       continue execution to the following one without branching.  These
!      edges have the 'EDGE_FALLTHRU' flag set.  Unlike other types of
       edges, these edges must come into the basic block immediately
       following in the instruction stream.  The function
!      'force_nonfallthru' is available to insert an unconditional jump in
!      the case that redirection is needed.  Note that this may require
!      creation of a new basic block.
  
  _exception handling_
       Exception handling edges represent possible control transfers from
*************** _exception handling_
*** 17657,17690 ****
       Java and Ada, exceptions like division by zero or segmentation
       fault are defined and thus each instruction possibly throwing this
       kind of exception needs to be handled as control flow instruction.
!      Exception edges have the `EDGE_ABNORMAL' and `EDGE_EH' flags set.
  
       When updating the instruction stream it is easy to change possibly
       trapping instruction to non-trapping, by simply removing the
       exception edge.  The opposite conversion is difficult, but should
       not happen anyway.  The edges can be eliminated via
!      `purge_dead_edges' call.
  
       In the RTL representation, the destination of an exception edge is
!      specified by `REG_EH_REGION' note attached to the insn.  In case
!      of a trapping call the `EDGE_ABNORMAL_CALL' flag is set too.  In
!      the `GIMPLE' representation, this extra flag is not set.
  
!      In the RTL representation, the predicate `may_trap_p' may be used
       to check whether instruction still may trap or not.  For the tree
!      representation, the `tree_could_trap_p' predicate is available,
!      but this predicate only checks for possible memory traps, as in
       dereferencing an invalid pointer location.
  
  _sibling calls_
       Sibling calls or tail calls terminate the function in a
       non-standard way and thus an edge to the exit must be present.
!      `EDGE_SIBCALL' and `EDGE_ABNORMAL' are set in such case.  These
       edges only exist in the RTL representation.
  
  _computed jumps_
       Computed jumps contain edges to all labels in the function
!      referenced from the code.  All those edges have `EDGE_ABNORMAL'
       flag set.  The edges used to represent computed jumps often cause
       compile time performance problems, since functions consisting of
       many taken labels and many computed jumps may have _very_ dense
--- 17492,17525 ----
       Java and Ada, exceptions like division by zero or segmentation
       fault are defined and thus each instruction possibly throwing this
       kind of exception needs to be handled as control flow instruction.
!      Exception edges have the 'EDGE_ABNORMAL' and 'EDGE_EH' flags set.
  
       When updating the instruction stream it is easy to change possibly
       trapping instruction to non-trapping, by simply removing the
       exception edge.  The opposite conversion is difficult, but should
       not happen anyway.  The edges can be eliminated via
!      'purge_dead_edges' call.
  
       In the RTL representation, the destination of an exception edge is
!      specified by 'REG_EH_REGION' note attached to the insn.  In case of
!      a trapping call the 'EDGE_ABNORMAL_CALL' flag is set too.  In the
!      'GIMPLE' representation, this extra flag is not set.
  
!      In the RTL representation, the predicate 'may_trap_p' may be used
       to check whether instruction still may trap or not.  For the tree
!      representation, the 'tree_could_trap_p' predicate is available, but
!      this predicate only checks for possible memory traps, as in
       dereferencing an invalid pointer location.
  
  _sibling calls_
       Sibling calls or tail calls terminate the function in a
       non-standard way and thus an edge to the exit must be present.
!      'EDGE_SIBCALL' and 'EDGE_ABNORMAL' are set in such case.  These
       edges only exist in the RTL representation.
  
  _computed jumps_
       Computed jumps contain edges to all labels in the function
!      referenced from the code.  All those edges have 'EDGE_ABNORMAL'
       flag set.  The edges used to represent computed jumps often cause
       compile time performance problems, since functions consisting of
       many taken labels and many computed jumps may have _very_ dense
*************** _computed jumps_
*** 17721,17748 ****
       has a runtime cost in there resulting code: An extra jump.
       Therefore, the computed jumps are un-factored in the later passes
       of the compiler (in the pass called
!      `pass_duplicate_computed_gotos').  Be aware of that when you work
       on passes in that area.  There have been numerous examples already
       where the compile time for code with unfactored computed jumps
       caused some serious headaches.
  
  _nonlocal goto handlers_
!      GCC allows nested functions to return into caller using a `goto'
!      to a label passed to as an argument to the callee.  The labels
!      passed to nested functions contain special code to cleanup after
!      function call.  Such sections of code are referred to as "nonlocal
!      goto receivers".  If a function contains such nonlocal goto
!      receivers, an edge from the call to the label is created with the
!      `EDGE_ABNORMAL' and `EDGE_ABNORMAL_CALL' flags set.
  
  _function entry points_
       By definition, execution of function starts at basic block 0, so
!      there is always an edge from the `ENTRY_BLOCK_PTR' to basic block
!      0.  There is no `GIMPLE' representation for alternate entry points
       at this moment.  In RTL, alternate entry points are specified by
!      `CODE_LABEL' with `LABEL_ALTERNATE_NAME' defined.  This feature is
!      currently used for multiple entry point prologues and is limited
!      to post-reload passes only.  This can be used by back-ends to emit
       alternate prologues for functions called from different contexts.
       In future full support for multiple entry functions defined by
       Fortran 90 needs to be implemented.
--- 17556,17583 ----
       has a runtime cost in there resulting code: An extra jump.
       Therefore, the computed jumps are un-factored in the later passes
       of the compiler (in the pass called
!      'pass_duplicate_computed_gotos').  Be aware of that when you work
       on passes in that area.  There have been numerous examples already
       where the compile time for code with unfactored computed jumps
       caused some serious headaches.
  
  _nonlocal goto handlers_
!      GCC allows nested functions to return into caller using a 'goto' to
!      a label passed to as an argument to the callee.  The labels passed
!      to nested functions contain special code to cleanup after function
!      call.  Such sections of code are referred to as "nonlocal goto
!      receivers".  If a function contains such nonlocal goto receivers,
!      an edge from the call to the label is created with the
!      'EDGE_ABNORMAL' and 'EDGE_ABNORMAL_CALL' flags set.
  
  _function entry points_
       By definition, execution of function starts at basic block 0, so
!      there is always an edge from the 'ENTRY_BLOCK_PTR' to basic block
!      0.  There is no 'GIMPLE' representation for alternate entry points
       at this moment.  In RTL, alternate entry points are specified by
!      'CODE_LABEL' with 'LABEL_ALTERNATE_NAME' defined.  This feature is
!      currently used for multiple entry point prologues and is limited to
!      post-reload passes only.  This can be used by back-ends to emit
       alternate prologues for functions called from different contexts.
       In future full support for multiple entry functions defined by
       Fortran 90 needs to be implemented.
*************** _function entry points_
*** 17750,17760 ****
  _function exits_
       In the pre-reload representation a function terminates after the
       last instruction in the insn chain and no explicit return
!      instructions are used.  This corresponds to the fall-thru edge
!      into exit block.  After reload, optimal RTL epilogues are used
!      that use explicit (conditional) return instructions that are
!      represented by edges with no flags set.
! 
  
  
  File: gccint.info,  Node: Profile information,  Next: Maintaining the CFG,  Prev: Edges,  Up: Control Flow
--- 17585,17594 ----
  _function exits_
       In the pre-reload representation a function terminates after the
       last instruction in the insn chain and no explicit return
!      instructions are used.  This corresponds to the fall-thru edge into
!      exit block.  After reload, optimal RTL epilogues are used that use
!      explicit (conditional) return instructions that are represented by
!      edges with no flags set.
  
  
  File: gccint.info,  Node: Profile information,  Next: Maintaining the CFG,  Prev: Edges,  Up: Control Flow
*************** instrumentation, executing it on a train
*** 17775,17806 ****
  executions of basic blocks and edges back to the compiler while
  re-compiling the program to produce the final executable.  This method
  provides very accurate information about where a program spends most of
! its time on the train run.  Whether it matches the average run of
! course depends on the choice of train data set, but several studies
! have shown that the behavior of a program usually changes just
! marginally over different data sets.
  
   When profile feedback is not available, the compiler may be asked to
  attempt to predict the behavior of each branch in the program using a
! set of heuristics (see `predict.def' for details) and compute estimated
  frequencies of each basic block by propagating the probabilities over
  the graph.
  
!  Each `basic_block' contains two integer fields to represent profile
! information: `frequency' and `count'.  The `frequency' is an estimation
  how often is basic block executed within a function.  It is represented
! as an integer scaled in the range from 0 to `BB_FREQ_BASE'.  The most
  frequently executed basic block in function is initially set to
! `BB_FREQ_BASE' and the rest of frequencies are scaled accordingly.
  During optimization, the frequency of the most frequent basic block can
  both decrease (for instance by loop unrolling) or grow (for instance by
  cross-jumping optimization), so scaling sometimes has to be performed
  multiple times.
  
!  The `count' contains hard-counted numbers of execution measured during
  training runs and is nonzero only when profile feedback is available.
  This value is represented as the host's widest integer (typically a 64
! bit integer) of the special type `gcov_type'.
  
   Most optimization passes can use only the frequency information of a
  basic block, but a few passes may want to know hard execution counts.
--- 17609,17640 ----
  executions of basic blocks and edges back to the compiler while
  re-compiling the program to produce the final executable.  This method
  provides very accurate information about where a program spends most of
! its time on the train run.  Whether it matches the average run of course
! depends on the choice of train data set, but several studies have shown
! that the behavior of a program usually changes just marginally over
! different data sets.
  
   When profile feedback is not available, the compiler may be asked to
  attempt to predict the behavior of each branch in the program using a
! set of heuristics (see 'predict.def' for details) and compute estimated
  frequencies of each basic block by propagating the probabilities over
  the graph.
  
!  Each 'basic_block' contains two integer fields to represent profile
! information: 'frequency' and 'count'.  The 'frequency' is an estimation
  how often is basic block executed within a function.  It is represented
! as an integer scaled in the range from 0 to 'BB_FREQ_BASE'.  The most
  frequently executed basic block in function is initially set to
! 'BB_FREQ_BASE' and the rest of frequencies are scaled accordingly.
  During optimization, the frequency of the most frequent basic block can
  both decrease (for instance by loop unrolling) or grow (for instance by
  cross-jumping optimization), so scaling sometimes has to be performed
  multiple times.
  
!  The 'count' contains hard-counted numbers of execution measured during
  training runs and is nonzero only when profile feedback is available.
  This value is represented as the host's widest integer (typically a 64
! bit integer) of the special type 'gcov_type'.
  
   Most optimization passes can use only the frequency information of a
  basic block, but a few passes may want to know hard execution counts.
*************** during updating of the profile informati
*** 17809,17824 ****
  accumulate into quite large errors.
  
   Each edge also contains a branch probability field: an integer in the
! range from 0 to `REG_BR_PROB_BASE'.  It represents probability of
! passing control from the end of the `src' basic block to the `dest'
  basic block, i.e. the probability that control will flow along this
! edge.  The `EDGE_FREQUENCY' macro is available to compute how
! frequently a given edge is taken.  There is a `count' field for each
! edge as well, representing same information as for a basic block.
  
   The basic block frequencies are not represented in the instruction
  stream, but in the RTL representation the edge frequencies are
! represented for conditional jumps (via the `REG_BR_PROB' macro) since
  they are used when instructions are output to the assembly file and the
  flow graph is no longer maintained.
  
--- 17643,17658 ----
  accumulate into quite large errors.
  
   Each edge also contains a branch probability field: an integer in the
! range from 0 to 'REG_BR_PROB_BASE'.  It represents probability of
! passing control from the end of the 'src' basic block to the 'dest'
  basic block, i.e. the probability that control will flow along this
! edge.  The 'EDGE_FREQUENCY' macro is available to compute how frequently
! a given edge is taken.  There is a 'count' field for each edge as well,
! representing same information as for a basic block.
  
   The basic block frequencies are not represented in the instruction
  stream, but in the RTL representation the edge frequencies are
! represented for conditional jumps (via the 'REG_BR_PROB' macro) since
  they are used when instructions are output to the assembly file and the
  flow graph is no longer maintained.
  
*************** basic blocks.
*** 17830,17848 ****
   Updating profile information is a delicate task that can unfortunately
  not be easily integrated with the CFG manipulation API.  Many of the
  functions and hooks to modify the CFG, such as
! `redirect_edge_and_branch', do not have enough information to easily
  update the profile, so updating it is in the majority of cases left up
  to the caller.  It is difficult to uncover bugs in the profile updating
! code, because they manifest themselves only by producing worse code,
! and checking profile consistency is not possible because of numeric
! error accumulation.  Hence special attention needs to be given to this
! issue in each pass that modifies the CFG.
  
!  It is important to point out that `REG_BR_PROB_BASE' and
! `BB_FREQ_BASE' are both set low enough to be possible to compute second
! power of any frequency or probability in the flow graph, it is not
! possible to even square the `count' field, as modern CPUs are fast
! enough to execute $2^32$ operations quickly.
  
  
  File: gccint.info,  Node: Maintaining the CFG,  Next: Liveness information,  Prev: Profile information,  Up: Control Flow
--- 17664,17682 ----
   Updating profile information is a delicate task that can unfortunately
  not be easily integrated with the CFG manipulation API.  Many of the
  functions and hooks to modify the CFG, such as
! 'redirect_edge_and_branch', do not have enough information to easily
  update the profile, so updating it is in the majority of cases left up
  to the caller.  It is difficult to uncover bugs in the profile updating
! code, because they manifest themselves only by producing worse code, and
! checking profile consistency is not possible because of numeric error
! accumulation.  Hence special attention needs to be given to this issue
! in each pass that modifies the CFG.
  
!  It is important to point out that 'REG_BR_PROB_BASE' and 'BB_FREQ_BASE'
! are both set low enough to be possible to compute second power of any
! frequency or probability in the flow graph, it is not possible to even
! square the 'count' field, as modern CPUs are fast enough to execute
! $2^32$ operations quickly.
  
  
  File: gccint.info,  Node: Maintaining the CFG,  Next: Liveness information,  Prev: Profile information,  Up: Control Flow
*************** File: gccint.info,  Node: Maintaining th
*** 17850,17969 ****
  14.4 Maintaining the CFG
  ========================
  
! An important task of each compiler pass is to keep both the control
! flow graph and all profile information up-to-date.  Reconstruction of
! the control flow graph after each pass is not an option, since it may be
  very expensive and lost profile information cannot be reconstructed at
  all.
  
   GCC has two major intermediate representations, and both use the
! `basic_block' and `edge' data types to represent control flow.  Both
  representations share as much of the CFG maintenance code as possible.
  For each representation, a set of "hooks" is defined so that each
  representation can provide its own implementation of CFG manipulation
! routines when necessary.  These hooks are defined in `cfghooks.h'.
! There are hooks for almost all common CFG manipulations, including
! block splitting and merging, edge redirection and creating and deleting
! basic blocks.  These hooks should provide everything you need to
! maintain and manipulate the CFG in both the RTL and `GIMPLE'
! representation.
  
   At the moment, the basic block boundaries are maintained transparently
  when modifying instructions, so there rarely is a need to move them
  manually (such as in case someone wants to output instruction outside
  basic block explicitly).
  
!  In the RTL representation, each instruction has a `BLOCK_FOR_INSN'
  value that represents pointer to the basic block that contains the
! instruction.  In the `GIMPLE' representation, the function `gimple_bb'
  returns a pointer to the basic block containing the queried statement.
  
!  When changes need to be applied to a function in its `GIMPLE'
  representation, "GIMPLE statement iterators" should be used.  These
  iterators provide an integrated abstraction of the flow graph and the
! instruction stream.  Block statement iterators are constructed using
! the `gimple_stmt_iterator' data structure and several modifiers are
  available, including the following:
  
! `gsi_start'
!      This function initializes a `gimple_stmt_iterator' that points to
       the first non-empty statement in a basic block.
  
! `gsi_last'
!      This function initializes a `gimple_stmt_iterator' that points to
       the last statement in a basic block.
  
! `gsi_end_p'
!      This predicate is `true' if a `gimple_stmt_iterator' represents
!      the end of a basic block.
  
! `gsi_next'
!      This function takes a `gimple_stmt_iterator' and makes it point to
       its successor.
  
! `gsi_prev'
!      This function takes a `gimple_stmt_iterator' and makes it point to
       its predecessor.
  
! `gsi_insert_after'
!      This function inserts a statement after the `gimple_stmt_iterator'
       passed in.  The final parameter determines whether the statement
       iterator is updated to point to the newly inserted statement, or
       left pointing to the original statement.
  
! `gsi_insert_before'
!      This function inserts a statement before the `gimple_stmt_iterator'
       passed in.  The final parameter determines whether the statement
       iterator is updated to point to the newly inserted statement, or
!      left pointing to the original  statement.
  
! `gsi_remove'
!      This function removes the `gimple_stmt_iterator' passed in and
       rechains the remaining statements in a basic block, if any.
  
!  In the RTL representation, the macros `BB_HEAD' and `BB_END' may be
! used to get the head and end `rtx' of a basic block.  No abstract
  iterators are defined for traversing the insn chain, but you can just
! use `NEXT_INSN' and `PREV_INSN' instead.  *Note Insns::.
  
   Usually a code manipulating pass simplifies the instruction stream and
  the flow of control, possibly eliminating some edges.  This may for
! example happen when a conditional jump is replaced with an
! unconditional jump, but also when simplifying possibly trapping
! instruction to non-trapping while compiling Java.  Updating of edges is
! not transparent and each optimization pass is required to do so
! manually.  However only few cases occur in practice.  The pass may call
! `purge_dead_edges' on a given basic block to remove superfluous edges,
! if any.
  
!  Another common scenario is redirection of branch instructions, but
! this is best modeled as redirection of edges in the control flow graph
! and thus use of `redirect_edge_and_branch' is preferred over more low
! level functions, such as `redirect_jump' that operate on RTL chain
! only.  The CFG hooks defined in `cfghooks.h' should provide the
! complete API required for manipulating and maintaining the CFG.
  
   It is also possible that a pass has to insert control flow instruction
  into the middle of a basic block, thus creating an entry point in the
  middle of the basic block, which is impossible by definition: The block
! must be split to make sure it only has one entry point, i.e. the head
! of the basic block.  The CFG hook `split_block' may be used when an
! instruction in the middle of a basic block has to become the target of
! a jump or branch instruction.
  
   For a global optimizer, a common operation is to split edges in the
  flow graph and insert instructions on them.  In the RTL representation,
! this can be easily done using the `insert_insn_on_edge' function that
  emits an instruction "on the edge", caching it for a later
! `commit_edge_insertions' call that will take care of moving the
! inserted instructions off the edge into the instruction stream
! contained in a basic block.  This includes the creation of new basic
! blocks where needed.  In the `GIMPLE' representation, the equivalent
! functions are `gsi_insert_on_edge' which inserts a block statement
! iterator on an edge, and `gsi_commit_edge_inserts' which flushes the
! instruction to actual instruction stream.
  
!  While debugging the optimization pass, the `verify_flow_info' function
  may be useful to find bugs in the control flow graph updating code.
  
  
--- 17684,17801 ----
  14.4 Maintaining the CFG
  ========================
  
! An important task of each compiler pass is to keep both the control flow
! graph and all profile information up-to-date.  Reconstruction of the
! control flow graph after each pass is not an option, since it may be
  very expensive and lost profile information cannot be reconstructed at
  all.
  
   GCC has two major intermediate representations, and both use the
! 'basic_block' and 'edge' data types to represent control flow.  Both
  representations share as much of the CFG maintenance code as possible.
  For each representation, a set of "hooks" is defined so that each
  representation can provide its own implementation of CFG manipulation
! routines when necessary.  These hooks are defined in 'cfghooks.h'.
! There are hooks for almost all common CFG manipulations, including block
! splitting and merging, edge redirection and creating and deleting basic
! blocks.  These hooks should provide everything you need to maintain and
! manipulate the CFG in both the RTL and 'GIMPLE' representation.
  
   At the moment, the basic block boundaries are maintained transparently
  when modifying instructions, so there rarely is a need to move them
  manually (such as in case someone wants to output instruction outside
  basic block explicitly).
  
!  In the RTL representation, each instruction has a 'BLOCK_FOR_INSN'
  value that represents pointer to the basic block that contains the
! instruction.  In the 'GIMPLE' representation, the function 'gimple_bb'
  returns a pointer to the basic block containing the queried statement.
  
!  When changes need to be applied to a function in its 'GIMPLE'
  representation, "GIMPLE statement iterators" should be used.  These
  iterators provide an integrated abstraction of the flow graph and the
! instruction stream.  Block statement iterators are constructed using the
! 'gimple_stmt_iterator' data structure and several modifiers are
  available, including the following:
  
! 'gsi_start'
!      This function initializes a 'gimple_stmt_iterator' that points to
       the first non-empty statement in a basic block.
  
! 'gsi_last'
!      This function initializes a 'gimple_stmt_iterator' that points to
       the last statement in a basic block.
  
! 'gsi_end_p'
!      This predicate is 'true' if a 'gimple_stmt_iterator' represents the
!      end of a basic block.
  
! 'gsi_next'
!      This function takes a 'gimple_stmt_iterator' and makes it point to
       its successor.
  
! 'gsi_prev'
!      This function takes a 'gimple_stmt_iterator' and makes it point to
       its predecessor.
  
! 'gsi_insert_after'
!      This function inserts a statement after the 'gimple_stmt_iterator'
       passed in.  The final parameter determines whether the statement
       iterator is updated to point to the newly inserted statement, or
       left pointing to the original statement.
  
! 'gsi_insert_before'
!      This function inserts a statement before the 'gimple_stmt_iterator'
       passed in.  The final parameter determines whether the statement
       iterator is updated to point to the newly inserted statement, or
!      left pointing to the original statement.
  
! 'gsi_remove'
!      This function removes the 'gimple_stmt_iterator' passed in and
       rechains the remaining statements in a basic block, if any.
  
!  In the RTL representation, the macros 'BB_HEAD' and 'BB_END' may be
! used to get the head and end 'rtx' of a basic block.  No abstract
  iterators are defined for traversing the insn chain, but you can just
! use 'NEXT_INSN' and 'PREV_INSN' instead.  *Note Insns::.
  
   Usually a code manipulating pass simplifies the instruction stream and
  the flow of control, possibly eliminating some edges.  This may for
! example happen when a conditional jump is replaced with an unconditional
! jump, but also when simplifying possibly trapping instruction to
! non-trapping while compiling Java.  Updating of edges is not transparent
! and each optimization pass is required to do so manually.  However only
! few cases occur in practice.  The pass may call 'purge_dead_edges' on a
! given basic block to remove superfluous edges, if any.
  
!  Another common scenario is redirection of branch instructions, but this
! is best modeled as redirection of edges in the control flow graph and
! thus use of 'redirect_edge_and_branch' is preferred over more low level
! functions, such as 'redirect_jump' that operate on RTL chain only.  The
! CFG hooks defined in 'cfghooks.h' should provide the complete API
! required for manipulating and maintaining the CFG.
  
   It is also possible that a pass has to insert control flow instruction
  into the middle of a basic block, thus creating an entry point in the
  middle of the basic block, which is impossible by definition: The block
! must be split to make sure it only has one entry point, i.e. the head of
! the basic block.  The CFG hook 'split_block' may be used when an
! instruction in the middle of a basic block has to become the target of a
! jump or branch instruction.
  
   For a global optimizer, a common operation is to split edges in the
  flow graph and insert instructions on them.  In the RTL representation,
! this can be easily done using the 'insert_insn_on_edge' function that
  emits an instruction "on the edge", caching it for a later
! 'commit_edge_insertions' call that will take care of moving the inserted
! instructions off the edge into the instruction stream contained in a
! basic block.  This includes the creation of new basic blocks where
! needed.  In the 'GIMPLE' representation, the equivalent functions are
! 'gsi_insert_on_edge' which inserts a block statement iterator on an
! edge, and 'gsi_commit_edge_inserts' which flushes the instruction to
! actual instruction stream.
  
!  While debugging the optimization pass, the 'verify_flow_info' function
  may be useful to find bugs in the control flow graph updating code.
  
  
*************** File: gccint.info,  Node: Liveness infor
*** 17973,18008 ****
  =========================
  
  Liveness information is useful to determine whether some register is
! "live" at given point of program, i.e. that it contains a value that
! may be used at a later point in the program.  This information is used,
! for instance, during register allocation, as the pseudo registers only
! need to be assigned to a unique hard register or to a stack slot if
! they are live.  The hard registers and stack slots may be freely reused
! for other values when a register is dead.
  
   Liveness information is available in the back end starting with
! `pass_df_initialize' and ending with `pass_df_finish'.  Three flavors
! of live analysis are available: With `LR', it is possible to determine
! at any point `P' in the function if the register may be used on some
! path from `P' to the end of the function.  With `UR', it is possible to
! determine if there is a path from the beginning of the function to `P'
! that defines the variable.  `LIVE' is the intersection of the `LR' and
! `UR' and a variable is live at `P' if there is both an assignment that
  reaches it from the beginning of the function and a use that can be
! reached on some path from `P' to the end of the function.
  
!  In general `LIVE' is the most useful of the three.  The macros
! `DF_[LR,UR,LIVE]_[IN,OUT]' can be used to access this information.  The
  macros take a basic block number and return a bitmap that is indexed by
  the register number.  This information is only guaranteed to be up to
! date after calls are made to `df_analyze'.  See the file `df-core.c'
! for details on using the dataflow.
  
   The liveness information is stored partly in the RTL instruction stream
  and partly in the flow graph.  Local information is stored in the
! instruction stream: Each instruction may contain `REG_DEAD' notes
  representing that the value of a given register is no longer needed, or
! `REG_UNUSED' notes representing that the value computed by the
  instruction is never used.  The second is useful for instructions
  computing multiple values at once.
  
--- 17805,17840 ----
  =========================
  
  Liveness information is useful to determine whether some register is
! "live" at given point of program, i.e. that it contains a value that may
! be used at a later point in the program.  This information is used, for
! instance, during register allocation, as the pseudo registers only need
! to be assigned to a unique hard register or to a stack slot if they are
! live.  The hard registers and stack slots may be freely reused for other
! values when a register is dead.
  
   Liveness information is available in the back end starting with
! 'pass_df_initialize' and ending with 'pass_df_finish'.  Three flavors of
! live analysis are available: With 'LR', it is possible to determine at
! any point 'P' in the function if the register may be used on some path
! from 'P' to the end of the function.  With 'UR', it is possible to
! determine if there is a path from the beginning of the function to 'P'
! that defines the variable.  'LIVE' is the intersection of the 'LR' and
! 'UR' and a variable is live at 'P' if there is both an assignment that
  reaches it from the beginning of the function and a use that can be
! reached on some path from 'P' to the end of the function.
  
!  In general 'LIVE' is the most useful of the three.  The macros
! 'DF_[LR,UR,LIVE]_[IN,OUT]' can be used to access this information.  The
  macros take a basic block number and return a bitmap that is indexed by
  the register number.  This information is only guaranteed to be up to
! date after calls are made to 'df_analyze'.  See the file 'df-core.c' for
! details on using the dataflow.
  
   The liveness information is stored partly in the RTL instruction stream
  and partly in the flow graph.  Local information is stored in the
! instruction stream: Each instruction may contain 'REG_DEAD' notes
  representing that the value of a given register is no longer needed, or
! 'REG_UNUSED' notes representing that the value computed by the
  instruction is never used.  The second is useful for instructions
  computing multiple values at once.
  
*************** File: gccint.info,  Node: Loop represent
*** 18038,18046 ****
  
  This chapter describes the representation of loops in GCC, and functions
  that can be used to build, modify and analyze this representation.  Most
! of the interfaces and data structures are declared in `cfgloop.h'.
! Loop structures are analyzed and this information disposed or updated
! at the discretion of individual passes.  Still most of the generic CFG
  manipulation routines are aware of loop structures and try to keep them
  up-to-date.  By this means an increasing part of the compilation
  pipeline is setup to maintain loop structure across passes to allow
--- 17870,17878 ----
  
  This chapter describes the representation of loops in GCC, and functions
  that can be used to build, modify and analyze this representation.  Most
! of the interfaces and data structures are declared in 'cfgloop.h'.  Loop
! structures are analyzed and this information disposed or updated at the
! discretion of individual passes.  Still most of the generic CFG
  manipulation routines are aware of loop structures and try to keep them
  up-to-date.  By this means an increasing part of the compilation
  pipeline is setup to maintain loop structure across passes to allow
*************** correspond to sub-loops or to control fl
*** 18060,18066 ****
  that the analysis sometimes changes the CFG, and if you run it in the
  middle of an optimization pass, you must be able to deal with the new
  blocks.  You may avoid CFG changes by passing
! `LOOPS_MAY_HAVE_MULTIPLE_LATCHES' flag to the loop discovery, note
  however that most other loop manipulation functions will not work
  correctly for loops with multiple latch edges (the functions that only
  query membership of blocks to loops and subloop relationships, or
--- 17892,17898 ----
  that the analysis sometimes changes the CFG, and if you run it in the
  middle of an optimization pass, you must be able to deal with the new
  blocks.  You may avoid CFG changes by passing
! 'LOOPS_MAY_HAVE_MULTIPLE_LATCHES' flag to the loop discovery, note
  however that most other loop manipulation functions will not work
  correctly for loops with multiple latch edges (the functions that only
  query membership of blocks to loops and subloop relationships, or
*************** enumerate and test loop exits, can be ex
*** 18070,18128 ****
  and reachable from its latch against the direction of edges in CFG.  The
  loops are organized in a containment hierarchy (tree) such that all the
  loops immediately contained inside loop L are the children of L in the
! tree.  This tree is represented by the `struct loops' structure.  The
  root of this tree is a fake loop that contains all blocks in the
! function.  Each of the loops is represented in a `struct loop'
! structure.  Each loop is assigned an index (`num' field of the `struct
  loop' structure), and the pointer to the loop is stored in the
! corresponding field of the `larray' vector in the loops structure.  The
! indices do not have to be continuous, there may be empty (`NULL')
! entries in the `larray' created by deleting loops.  Also, there is no
  guarantee on the relative order of a loop and its subloops in the
  numbering.  The index of a loop never changes.
  
!  The entries of the `larray' field should not be accessed directly.
! The function `get_loop' returns the loop description for a loop with
! the given index.  `number_of_loops' function returns number of loops in
! the function.  To traverse all loops, use `FOR_EACH_LOOP' macro.  The
! `flags' argument of the macro is used to determine the direction of
  traversal and the set of loops visited.  Each loop is guaranteed to be
  visited exactly once, regardless of the changes to the loop tree, and
  the loops may be removed during the traversal.  The newly created loops
  are never traversed, if they need to be visited, this must be done
! separately after their creation.  The `FOR_EACH_LOOP' macro allocates
! temporary variables.  If the `FOR_EACH_LOOP' loop were ended using
! break or goto, they would not be released; `FOR_EACH_LOOP_BREAK' macro
! must be used instead.
  
   Each basic block contains the reference to the innermost loop it
! belongs to (`loop_father').  For this reason, it is only possible to
! have one `struct loops' structure initialized at the same time for each
! CFG.  The global variable `current_loops' contains the `struct loops'
  structure.  Many of the loop manipulation functions assume that
  dominance information is up-to-date.
  
!  The loops are analyzed through `loop_optimizer_init' function.  The
  argument of this function is a set of flags represented in an integer
  bitmask.  These flags specify what other properties of the loop
  structures should be calculated/enforced and preserved later:
  
!    * `LOOPS_MAY_HAVE_MULTIPLE_LATCHES': If this flag is set, no changes
!      to CFG will be performed in the loop analysis, in particular,
!      loops with multiple latch edges will not be disambiguated.  If a
!      loop has multiple latches, its latch block is set to NULL.  Most of
!      the loop manipulation functions will not work for loops in this
!      shape.  No other flags that require CFG changes can be passed to
       loop_optimizer_init.
! 
!    * `LOOPS_HAVE_PREHEADERS': Forwarder blocks are created in such a
!      way that each loop has only one entry edge, and additionally, the
       source block of this entry edge has only one successor.  This
       creates a natural place where the code can be moved out of the
       loop, and ensures that the entry edge of the loop leads from its
       immediate super-loop.
! 
!    * `LOOPS_HAVE_SIMPLE_LATCHES': Forwarder blocks are created to force
       the latch block of each loop to have only one successor.  This
       ensures that the latch of the loop does not belong to any of its
       sub-loops, and makes manipulation with the loops significantly
--- 17902,17958 ----
  and reachable from its latch against the direction of edges in CFG.  The
  loops are organized in a containment hierarchy (tree) such that all the
  loops immediately contained inside loop L are the children of L in the
! tree.  This tree is represented by the 'struct loops' structure.  The
  root of this tree is a fake loop that contains all blocks in the
! function.  Each of the loops is represented in a 'struct loop'
! structure.  Each loop is assigned an index ('num' field of the 'struct
  loop' structure), and the pointer to the loop is stored in the
! corresponding field of the 'larray' vector in the loops structure.  The
! indices do not have to be continuous, there may be empty ('NULL')
! entries in the 'larray' created by deleting loops.  Also, there is no
  guarantee on the relative order of a loop and its subloops in the
  numbering.  The index of a loop never changes.
  
!  The entries of the 'larray' field should not be accessed directly.  The
! function 'get_loop' returns the loop description for a loop with the
! given index.  'number_of_loops' function returns number of loops in the
! function.  To traverse all loops, use 'FOR_EACH_LOOP' macro.  The
! 'flags' argument of the macro is used to determine the direction of
  traversal and the set of loops visited.  Each loop is guaranteed to be
  visited exactly once, regardless of the changes to the loop tree, and
  the loops may be removed during the traversal.  The newly created loops
  are never traversed, if they need to be visited, this must be done
! separately after their creation.  The 'FOR_EACH_LOOP' macro allocates
! temporary variables.  If the 'FOR_EACH_LOOP' loop were ended using break
! or goto, they would not be released; 'FOR_EACH_LOOP_BREAK' macro must be
! used instead.
  
   Each basic block contains the reference to the innermost loop it
! belongs to ('loop_father').  For this reason, it is only possible to
! have one 'struct loops' structure initialized at the same time for each
! CFG.  The global variable 'current_loops' contains the 'struct loops'
  structure.  Many of the loop manipulation functions assume that
  dominance information is up-to-date.
  
!  The loops are analyzed through 'loop_optimizer_init' function.  The
  argument of this function is a set of flags represented in an integer
  bitmask.  These flags specify what other properties of the loop
  structures should be calculated/enforced and preserved later:
  
!    * 'LOOPS_MAY_HAVE_MULTIPLE_LATCHES': If this flag is set, no changes
!      to CFG will be performed in the loop analysis, in particular, loops
!      with multiple latch edges will not be disambiguated.  If a loop has
!      multiple latches, its latch block is set to NULL.  Most of the loop
!      manipulation functions will not work for loops in this shape.  No
!      other flags that require CFG changes can be passed to
       loop_optimizer_init.
!    * 'LOOPS_HAVE_PREHEADERS': Forwarder blocks are created in such a way
!      that each loop has only one entry edge, and additionally, the
       source block of this entry edge has only one successor.  This
       creates a natural place where the code can be moved out of the
       loop, and ensures that the entry edge of the loop leads from its
       immediate super-loop.
!    * 'LOOPS_HAVE_SIMPLE_LATCHES': Forwarder blocks are created to force
       the latch block of each loop to have only one successor.  This
       ensures that the latch of the loop does not belong to any of its
       sub-loops, and makes manipulation with the loops significantly
*************** structures should be calculated/enforced
*** 18130,18169 ****
       loops are in this shape.  Note that with this flag, the "normal"
       loop without any control flow inside and with one exit consists of
       two basic blocks.
! 
!    * `LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS': Basic blocks and edges in
       the strongly connected components that are not natural loops (have
!      more than one entry block) are marked with `BB_IRREDUCIBLE_LOOP'
!      and `EDGE_IRREDUCIBLE_LOOP' flags.  The flag is not set for blocks
       and edges that belong to natural loops that are in such an
       irreducible region (but it is set for the entry and exit edges of
       such a loop, if they lead to/from this region).
! 
!    * `LOOPS_HAVE_RECORDED_EXITS': The lists of exits are recorded and
       updated for each loop.  This makes some functions (e.g.,
!      `get_loop_exit_edges') more efficient.  Some functions (e.g.,
!      `single_exit') can be used only if the lists of exits are recorded.
  
   These properties may also be computed/enforced later, using functions
! `create_preheaders', `force_single_succ_latches',
! `mark_irreducible_loops' and `record_loop_exits'.  The properties can
! be queried using `loops_state_satisfies_p'.
  
   The memory occupied by the loops structures should be freed with
! `loop_optimizer_finalize' function.  When loop structures are setup to
  be preserved across passes this function reduces the information to be
! kept up-to-date to a minimum (only `LOOPS_MAY_HAVE_MULTIPLE_LATCHES'
  set).
  
   The CFG manipulation functions in general do not update loop
  structures.  Specialized versions that additionally do so are provided
! for the most common tasks.  On GIMPLE, `cleanup_tree_cfg_loop' function
  can be used to cleanup CFG while updating the loops structures if
! `current_loops' is set.
  
!  At the moment loop structure is preserved from the start of GIMPLE
! loop optimizations until the end of RTL loop optimizations.  During
! this time a loop can be tracked by its `struct loop' and number.
  
  
  File: gccint.info,  Node: Loop querying,  Next: Loop manipulation,  Prev: Loop representation,  Up: Loop Analysis and Representation
--- 17960,17997 ----
       loops are in this shape.  Note that with this flag, the "normal"
       loop without any control flow inside and with one exit consists of
       two basic blocks.
!    * 'LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS': Basic blocks and edges in
       the strongly connected components that are not natural loops (have
!      more than one entry block) are marked with 'BB_IRREDUCIBLE_LOOP'
!      and 'EDGE_IRREDUCIBLE_LOOP' flags.  The flag is not set for blocks
       and edges that belong to natural loops that are in such an
       irreducible region (but it is set for the entry and exit edges of
       such a loop, if they lead to/from this region).
!    * 'LOOPS_HAVE_RECORDED_EXITS': The lists of exits are recorded and
       updated for each loop.  This makes some functions (e.g.,
!      'get_loop_exit_edges') more efficient.  Some functions (e.g.,
!      'single_exit') can be used only if the lists of exits are recorded.
  
   These properties may also be computed/enforced later, using functions
! 'create_preheaders', 'force_single_succ_latches',
! 'mark_irreducible_loops' and 'record_loop_exits'.  The properties can be
! queried using 'loops_state_satisfies_p'.
  
   The memory occupied by the loops structures should be freed with
! 'loop_optimizer_finalize' function.  When loop structures are setup to
  be preserved across passes this function reduces the information to be
! kept up-to-date to a minimum (only 'LOOPS_MAY_HAVE_MULTIPLE_LATCHES'
  set).
  
   The CFG manipulation functions in general do not update loop
  structures.  Specialized versions that additionally do so are provided
! for the most common tasks.  On GIMPLE, 'cleanup_tree_cfg_loop' function
  can be used to cleanup CFG while updating the loops structures if
! 'current_loops' is set.
  
!  At the moment loop structure is preserved from the start of GIMPLE loop
! optimizations until the end of RTL loop optimizations.  During this time
! a loop can be tracked by its 'struct loop' and number.
  
  
  File: gccint.info,  Node: Loop querying,  Next: Loop manipulation,  Prev: Loop representation,  Up: Loop Analysis and Representation
*************** File: gccint.info,  Node: Loop querying,
*** 18172,18191 ****
  ==================
  
  The functions to query the information about loops are declared in
! `cfgloop.h'.  Some of the information can be taken directly from the
! structures.  `loop_father' field of each basic block contains the
  innermost loop to that the block belongs.  The most useful fields of
  loop structure (that are kept up-to-date at all times) are:
  
!    * `header', `latch': Header and latch basic blocks of the loop.
! 
!    * `num_nodes': Number of basic blocks in the loop (including the
       basic blocks of the sub-loops).
! 
!    * `depth': The depth of the loop in the loops tree, i.e., the number
       of super-loops of the loop.
! 
!    * `outer', `inner', `next': The super-loop, the first sub-loop, and
       the sibling of the loop in the loops tree.
  
   There are other fields in the loop structures, many of them used only
--- 18000,18016 ----
  ==================
  
  The functions to query the information about loops are declared in
! 'cfgloop.h'.  Some of the information can be taken directly from the
! structures.  'loop_father' field of each basic block contains the
  innermost loop to that the block belongs.  The most useful fields of
  loop structure (that are kept up-to-date at all times) are:
  
!    * 'header', 'latch': Header and latch basic blocks of the loop.
!    * 'num_nodes': Number of basic blocks in the loop (including the
       basic blocks of the sub-loops).
!    * 'depth': The depth of the loop in the loops tree, i.e., the number
       of super-loops of the loop.
!    * 'outer', 'inner', 'next': The super-loop, the first sub-loop, and
       the sibling of the loop in the loops tree.
  
   There are other fields in the loop structures, many of them used only
*************** they should not be accessed directly.
*** 18194,18239 ****
  
   The most important functions to query loop structures are:
  
!    * `flow_loops_dump': Dumps the information about loops to a file.
! 
!    * `verify_loop_structure': Checks consistency of the loop structures.
! 
!    * `loop_latch_edge': Returns the latch edge of a loop.
! 
!    * `loop_preheader_edge': If loops have preheaders, returns the
       preheader edge of a loop.
! 
!    * `flow_loop_nested_p': Tests whether loop is a sub-loop of another
       loop.
! 
!    * `flow_bb_inside_loop_p': Tests whether a basic block belongs to a
       loop (including its sub-loops).
! 
!    * `find_common_loop': Finds the common super-loop of two loops.
! 
!    * `superloop_at_depth': Returns the super-loop of a loop with the
       given depth.
! 
!    * `tree_num_loop_insns', `num_loop_insns': Estimates the number of
       insns in the loop, on GIMPLE and on RTL.
! 
!    * `loop_exit_edge_p': Tests whether edge is an exit from a loop.
! 
!    * `mark_loop_exit_edges': Marks all exit edges of all loops with
!      `EDGE_LOOP_EXIT' flag.
! 
!    * `get_loop_body', `get_loop_body_in_dom_order',
!      `get_loop_body_in_bfs_order': Enumerates the basic blocks in the
       loop in depth-first search order in reversed CFG, ordered by
       dominance relation, and breath-first search order, respectively.
! 
!    * `single_exit': Returns the single exit edge of the loop, or `NULL'
!      if the loop has more than one exit.  You can only use this
!      function if LOOPS_HAVE_MARKED_SINGLE_EXITS property is used.
! 
!    * `get_loop_exit_edges': Enumerates the exit edges of a loop.
! 
!    * `just_once_each_iteration_p': Returns true if the basic block is
       executed exactly once during each iteration of a loop (that is, it
       does not belong to a sub-loop, and it dominates the latch of the
       loop).
--- 18019,18050 ----
  
   The most important functions to query loop structures are:
  
!    * 'flow_loops_dump': Dumps the information about loops to a file.
!    * 'verify_loop_structure': Checks consistency of the loop structures.
!    * 'loop_latch_edge': Returns the latch edge of a loop.
!    * 'loop_preheader_edge': If loops have preheaders, returns the
       preheader edge of a loop.
!    * 'flow_loop_nested_p': Tests whether loop is a sub-loop of another
       loop.
!    * 'flow_bb_inside_loop_p': Tests whether a basic block belongs to a
       loop (including its sub-loops).
!    * 'find_common_loop': Finds the common super-loop of two loops.
!    * 'superloop_at_depth': Returns the super-loop of a loop with the
       given depth.
!    * 'tree_num_loop_insns', 'num_loop_insns': Estimates the number of
       insns in the loop, on GIMPLE and on RTL.
!    * 'loop_exit_edge_p': Tests whether edge is an exit from a loop.
!    * 'mark_loop_exit_edges': Marks all exit edges of all loops with
!      'EDGE_LOOP_EXIT' flag.
!    * 'get_loop_body', 'get_loop_body_in_dom_order',
!      'get_loop_body_in_bfs_order': Enumerates the basic blocks in the
       loop in depth-first search order in reversed CFG, ordered by
       dominance relation, and breath-first search order, respectively.
!    * 'single_exit': Returns the single exit edge of the loop, or 'NULL'
!      if the loop has more than one exit.  You can only use this function
!      if LOOPS_HAVE_MARKED_SINGLE_EXITS property is used.
!    * 'get_loop_exit_edges': Enumerates the exit edges of a loop.
!    * 'just_once_each_iteration_p': Returns true if the basic block is
       executed exactly once during each iteration of a loop (that is, it
       does not belong to a sub-loop, and it dominates the latch of the
       loop).
*************** File: gccint.info,  Node: Loop manipulat
*** 18246,18266 ****
  
  The loops tree can be manipulated using the following functions:
  
!    * `flow_loop_tree_node_add': Adds a node to the tree.
! 
!    * `flow_loop_tree_node_remove': Removes a node from the tree.
! 
!    * `add_bb_to_loop': Adds a basic block to a loop.
! 
!    * `remove_bb_from_loops': Removes a basic block from loops.
  
   Most low-level CFG functions update loops automatically.  The following
  functions handle some more complicated cases of CFG manipulations:
  
!    * `remove_path': Removes an edge and all blocks it dominates.
! 
!    * `split_loop_exit_edge': Splits exit edge of the loop, ensuring
!      that PHI node arguments remain in the loop (this ensures that
       loop-closed SSA form is preserved).  Only useful on GIMPLE.
  
   Finally, there are some higher-level loop transformations implemented.
--- 18057,18073 ----
  
  The loops tree can be manipulated using the following functions:
  
!    * 'flow_loop_tree_node_add': Adds a node to the tree.
!    * 'flow_loop_tree_node_remove': Removes a node from the tree.
!    * 'add_bb_to_loop': Adds a basic block to a loop.
!    * 'remove_bb_from_loops': Removes a basic block from loops.
  
   Most low-level CFG functions update loops automatically.  The following
  functions handle some more complicated cases of CFG manipulations:
  
!    * 'remove_path': Removes an edge and all blocks it dominates.
!    * 'split_loop_exit_edge': Splits exit edge of the loop, ensuring that
!      PHI node arguments remain in the loop (this ensures that
       loop-closed SSA form is preserved).  Only useful on GIMPLE.
  
   Finally, there are some higher-level loop transformations implemented.
*************** While some of them are written so that t
*** 18268,18293 ****
  loops, they are mostly untested in that case, and at the moment, they
  are only reliable for the innermost loops:
  
!    * `create_iv': Creates a new induction variable.  Only works on
!      GIMPLE.  `standard_iv_increment_position' can be used to find a
       suitable place for the iv increment.
! 
!    * `duplicate_loop_to_header_edge',
!      `tree_duplicate_loop_to_header_edge': These functions (on RTL and
       on GIMPLE) duplicate the body of the loop prescribed number of
       times on one of the edges entering loop header, thus performing
!      either loop unrolling or loop peeling.  `can_duplicate_loop_p'
!      (`can_unroll_loop_p' on GIMPLE) must be true for the duplicated
       loop.
! 
!    * `loop_version', `tree_ssa_loop_version': These function create a
       copy of a loop, and a branch before them that selects one of them
       depending on the prescribed condition.  This is useful for
       optimizations that need to verify some assumptions in runtime (one
       of the copies of the loop is usually left unchanged, while the
       other one is transformed in some way).
! 
!    * `tree_unroll_loop': Unrolls the loop, including peeling the extra
       iterations to make the number of iterations divisible by unroll
       factor, updating the exit condition, and removing the exits that
       now cannot be taken.  Works only on GIMPLE.
--- 18075,18097 ----
  loops, they are mostly untested in that case, and at the moment, they
  are only reliable for the innermost loops:
  
!    * 'create_iv': Creates a new induction variable.  Only works on
!      GIMPLE.  'standard_iv_increment_position' can be used to find a
       suitable place for the iv increment.
!    * 'duplicate_loop_to_header_edge',
!      'tree_duplicate_loop_to_header_edge': These functions (on RTL and
       on GIMPLE) duplicate the body of the loop prescribed number of
       times on one of the edges entering loop header, thus performing
!      either loop unrolling or loop peeling.  'can_duplicate_loop_p'
!      ('can_unroll_loop_p' on GIMPLE) must be true for the duplicated
       loop.
!    * 'loop_version', 'tree_ssa_loop_version': These function create a
       copy of a loop, and a branch before them that selects one of them
       depending on the prescribed condition.  This is useful for
       optimizations that need to verify some assumptions in runtime (one
       of the copies of the loop is usually left unchanged, while the
       other one is transformed in some way).
!    * 'tree_unroll_loop': Unrolls the loop, including peeling the extra
       iterations to make the number of iterations divisible by unroll
       factor, updating the exit condition, and removing the exits that
       now cannot be taken.  Works only on GIMPLE.
*************** File: gccint.info,  Node: LCSSA,  Next:
*** 18299,18305 ****
  =========================
  
  Throughout the loop optimizations on tree level, one extra condition is
! enforced on the SSA form:  No SSA name is used outside of the loop in
  that it is defined.  The SSA form satisfying this condition is called
  "loop-closed SSA form" - LCSSA.  To enforce LCSSA, PHI nodes must be
  created at the exits of the loops for the SSA names that are used
--- 18103,18109 ----
  =========================
  
  Throughout the loop optimizations on tree level, one extra condition is
! enforced on the SSA form: No SSA name is used outside of the loop in
  that it is defined.  The SSA form satisfying this condition is called
  "loop-closed SSA form" - LCSSA.  To enforce LCSSA, PHI nodes must be
  created at the exits of the loops for the SSA names that are used
*************** held in LCSSA, in order to save memory.
*** 18312,18338 ****
       are interested in the values that are defined in the loop and used
       outside of it, i.e., exactly those for that we create new PHI
       nodes.
- 
     * In induction variable analysis, it is not necessary to specify the
       loop in that the analysis should be performed - the scalar
       evolution analysis always returns the results with respect to the
       loop in that the SSA name is defined.
- 
     * It makes updating of SSA form during loop transformations simpler.
!      Without LCSSA, operations like loop unrolling may force creation
!      of PHI nodes arbitrarily far from the loop, while in LCSSA, the
!      SSA form can be updated locally.  However, since we only keep real
       operands in LCSSA, we cannot use this advantage (we could have
       local updating of real operands, but it is not much more efficient
!      than to use generic SSA form updating for it as well; the amount
!      of changes to SSA is the same).
  
   However, it also means LCSSA must be updated.  This is usually
  straightforward, unless you create a new value in loop and use it
  outside, or unless you manipulate loop exit edges (functions are
  provided to make these manipulations simple).
! `rewrite_into_loop_closed_ssa' is used to rewrite SSA form to LCSSA,
! and `verify_loop_closed_ssa' to check that the invariant of LCSSA is
  preserved.
  
  
--- 18116,18140 ----
       are interested in the values that are defined in the loop and used
       outside of it, i.e., exactly those for that we create new PHI
       nodes.
     * In induction variable analysis, it is not necessary to specify the
       loop in that the analysis should be performed - the scalar
       evolution analysis always returns the results with respect to the
       loop in that the SSA name is defined.
     * It makes updating of SSA form during loop transformations simpler.
!      Without LCSSA, operations like loop unrolling may force creation of
!      PHI nodes arbitrarily far from the loop, while in LCSSA, the SSA
!      form can be updated locally.  However, since we only keep real
       operands in LCSSA, we cannot use this advantage (we could have
       local updating of real operands, but it is not much more efficient
!      than to use generic SSA form updating for it as well; the amount of
!      changes to SSA is the same).
  
   However, it also means LCSSA must be updated.  This is usually
  straightforward, unless you create a new value in loop and use it
  outside, or unless you manipulate loop exit edges (functions are
  provided to make these manipulations simple).
! 'rewrite_into_loop_closed_ssa' is used to rewrite SSA form to LCSSA, and
! 'verify_loop_closed_ssa' to check that the invariant of LCSSA is
  preserved.
  
  
*************** variable analysis on GIMPLE.  They enabl
*** 18346,18382 ****
  complicated behavior in a simple and consistent way (we only use it to
  express values of polynomial induction variables, but it is possible to
  extend it).  The interfaces to SCEV analysis are declared in
! `tree-scalar-evolution.h'.  To use scalar evolutions analysis,
! `scev_initialize' must be used.  To stop using SCEV, `scev_finalize'
  should be used.  SCEV analysis caches results in order to save time and
  memory.  This cache however is made invalid by most of the loop
! transformations, including removal of code.  If such a transformation
! is performed, `scev_reset' must be called to clean the caches.
  
   Given an SSA name, its behavior in loops can be analyzed using the
! `analyze_scalar_evolution' function.  The returned SCEV however does
! not have to be fully analyzed and it may contain references to other
! SSA names defined in the loop.  To resolve these (potentially
! recursive) references, `instantiate_parameters' or `resolve_mixers'
! functions must be used.  `instantiate_parameters' is useful when you
! use the results of SCEV only for some analysis, and when you work with
! whole nest of loops at once.  It will try replacing all SSA names by
! their SCEV in all loops, including the super-loops of the current loop,
! thus providing a complete information about the behavior of the
! variable in the loop nest.  `resolve_mixers' is useful if you work with
! only one loop at a time, and if you possibly need to create code based
! on the value of the induction variable.  It will only resolve the SSA
! names defined in the current loop, leaving the SSA names defined
! outside unchanged, even if their evolution in the outer loops is known.
  
   The SCEV is a normal tree expression, except for the fact that it may
! contain several special tree nodes.  One of them is `SCEV_NOT_KNOWN',
  used for SSA names whose value cannot be expressed.  The other one is
! `POLYNOMIAL_CHREC'.  Polynomial chrec has three arguments - base, step
  and loop (both base and step may contain further polynomial chrecs).
  Type of the expression and of base and step must be the same.  A
! variable has evolution `POLYNOMIAL_CHREC(base, step, loop)' if it is
! (in the specified loop) equivalent to `x_1' in the following example
  
       while (...)
         {
--- 18148,18184 ----
  complicated behavior in a simple and consistent way (we only use it to
  express values of polynomial induction variables, but it is possible to
  extend it).  The interfaces to SCEV analysis are declared in
! 'tree-scalar-evolution.h'.  To use scalar evolutions analysis,
! 'scev_initialize' must be used.  To stop using SCEV, 'scev_finalize'
  should be used.  SCEV analysis caches results in order to save time and
  memory.  This cache however is made invalid by most of the loop
! transformations, including removal of code.  If such a transformation is
! performed, 'scev_reset' must be called to clean the caches.
  
   Given an SSA name, its behavior in loops can be analyzed using the
! 'analyze_scalar_evolution' function.  The returned SCEV however does not
! have to be fully analyzed and it may contain references to other SSA
! names defined in the loop.  To resolve these (potentially recursive)
! references, 'instantiate_parameters' or 'resolve_mixers' functions must
! be used.  'instantiate_parameters' is useful when you use the results of
! SCEV only for some analysis, and when you work with whole nest of loops
! at once.  It will try replacing all SSA names by their SCEV in all
! loops, including the super-loops of the current loop, thus providing a
! complete information about the behavior of the variable in the loop
! nest.  'resolve_mixers' is useful if you work with only one loop at a
! time, and if you possibly need to create code based on the value of the
! induction variable.  It will only resolve the SSA names defined in the
! current loop, leaving the SSA names defined outside unchanged, even if
! their evolution in the outer loops is known.
  
   The SCEV is a normal tree expression, except for the fact that it may
! contain several special tree nodes.  One of them is 'SCEV_NOT_KNOWN',
  used for SSA names whose value cannot be expressed.  The other one is
! 'POLYNOMIAL_CHREC'.  Polynomial chrec has three arguments - base, step
  and loop (both base and step may contain further polynomial chrecs).
  Type of the expression and of base and step must be the same.  A
! variable has evolution 'POLYNOMIAL_CHREC(base, step, loop)' if it is (in
! the specified loop) equivalent to 'x_1' in the following example
  
       while (...)
         {
*************** variable has evolution `POLYNOMIAL_CHREC
*** 18385,18391 ****
         }
  
   Note that this includes the language restrictions on the operations.
! For example, if we compile C code and `x' has signed type, then the
  overflow in addition would cause undefined behavior, and we may assume
  that this does not happen.  Hence, the value with this SCEV cannot
  overflow (which restricts the number of iterations of such a loop).
--- 18187,18193 ----
         }
  
   Note that this includes the language restrictions on the operations.
! For example, if we compile C code and 'x' has signed type, then the
  overflow in addition would cause undefined behavior, and we may assume
  that this does not happen.  Hence, the value with this SCEV cannot
  overflow (which restricts the number of iterations of such a loop).
*************** overflow (which restricts the number of
*** 18393,18399 ****
   In many cases, one wants to restrict the attention just to affine
  induction variables.  In this case, the extra expressive power of SCEV
  is not useful, and may complicate the optimizations.  In this case,
! `simple_iv' function may be used to analyze a value - the result is a
  loop-invariant base and step.
  
  
--- 18195,18201 ----
   In many cases, one wants to restrict the attention just to affine
  induction variables.  In this case, the extra expressive power of SCEV
  is not useful, and may complicate the optimizations.  In this case,
! 'simple_iv' function may be used to analyze a value - the result is a
  loop-invariant base and step.
  
  
*************** File: gccint.info,  Node: loop-iv,  Next
*** 18404,18443 ****
  
  The induction variable on RTL is simple and only allows analysis of
  affine induction variables, and only in one loop at once.  The interface
! is declared in `cfgloop.h'.  Before analyzing induction variables in a
! loop L, `iv_analysis_loop_init' function must be called on L.  After
! the analysis (possibly calling `iv_analysis_loop_init' for several
! loops) is finished, `iv_analysis_done' should be called.  The following
! functions can be used to access the results of the analysis:
  
!    * `iv_analyze': Analyzes a single register used in the given insn.
       If no use of the register in this insn is found, the following
       insns are scanned, so that this function can be called on the insn
       returned by get_condition.
  
!    * `iv_analyze_result': Analyzes result of the assignment in the
!      given insn.
! 
!    * `iv_analyze_expr': Analyzes a more complicated expression.  All
!      its operands are analyzed by `iv_analyze', and hence they must be
!      used in the specified insn or one of the following insns.
! 
!  The description of the induction variable is provided in `struct
  rtx_iv'.  In order to handle subregs, the representation is a bit
! complicated; if the value of the `extend' field is not `UNKNOWN', the
  value of the induction variable in the i-th iteration is
  
       delta + mult * extend_{extend_mode} (subreg_{mode} (base + i * step)),
  
!  with the following exception:  if `first_special' is true, then the
! value in the first iteration (when `i' is zero) is `delta + mult *
! base'.  However, if `extend' is equal to `UNKNOWN', then
! `first_special' must be false, `delta' 0, `mult' 1 and the value in the
! i-th iteration is
  
       subreg_{mode} (base + i * step)
  
!  The function `get_iv_value' can be used to perform these calculations.
  
  
  File: gccint.info,  Node: Number of iterations,  Next: Dependency analysis,  Prev: loop-iv,  Up: Loop Analysis and Representation
--- 18206,18243 ----
  
  The induction variable on RTL is simple and only allows analysis of
  affine induction variables, and only in one loop at once.  The interface
! is declared in 'cfgloop.h'.  Before analyzing induction variables in a
! loop L, 'iv_analysis_loop_init' function must be called on L. After the
! analysis (possibly calling 'iv_analysis_loop_init' for several loops) is
! finished, 'iv_analysis_done' should be called.  The following functions
! can be used to access the results of the analysis:
  
!    * 'iv_analyze': Analyzes a single register used in the given insn.
       If no use of the register in this insn is found, the following
       insns are scanned, so that this function can be called on the insn
       returned by get_condition.
+    * 'iv_analyze_result': Analyzes result of the assignment in the given
+      insn.
+    * 'iv_analyze_expr': Analyzes a more complicated expression.  All its
+      operands are analyzed by 'iv_analyze', and hence they must be used
+      in the specified insn or one of the following insns.
  
!  The description of the induction variable is provided in 'struct
  rtx_iv'.  In order to handle subregs, the representation is a bit
! complicated; if the value of the 'extend' field is not 'UNKNOWN', the
  value of the induction variable in the i-th iteration is
  
       delta + mult * extend_{extend_mode} (subreg_{mode} (base + i * step)),
  
!  with the following exception: if 'first_special' is true, then the
! value in the first iteration (when 'i' is zero) is 'delta + mult *
! base'.  However, if 'extend' is equal to 'UNKNOWN', then 'first_special'
! must be false, 'delta' 0, 'mult' 1 and the value in the i-th iteration
! is
  
       subreg_{mode} (base + i * step)
  
!  The function 'get_iv_value' can be used to perform these calculations.
  
  
  File: gccint.info,  Node: Number of iterations,  Next: Dependency analysis,  Prev: loop-iv,  Up: Loop Analysis and Representation
*************** program; if it fails, the conditions are
*** 18456,18497 ****
  result.  The following information and conditions are provided by the
  analysis:
  
!    * `assumptions': If this condition is false, the rest of the
       information is invalid.
! 
!    * `noloop_assumptions' on RTL, `may_be_zero' on GIMPLE: If this
       condition is true, the loop exits in the first iteration.
! 
!    * `infinite': If this condition is true, the loop is infinite.  This
       condition is only available on RTL.  On GIMPLE, conditions for
!      finiteness of the loop are included in `assumptions'.
! 
!    * `niter_expr' on RTL, `niter' on GIMPLE: The expression that gives
       number of iterations.  The number of iterations is defined as the
       number of executions of the loop latch.
  
   Both on GIMPLE and on RTL, it necessary for the induction variable
  analysis framework to be initialized (SCEV on GIMPLE, loop-iv on RTL).
! On GIMPLE, the results are stored to `struct tree_niter_desc'
! structure.  Number of iterations before the loop is exited through a
! given exit can be determined using `number_of_iterations_exit'
! function.  On RTL, the results are returned in `struct niter_desc'
! structure.  The corresponding function is named `check_simple_exit'.
! There are also functions that pass through all the exits of a loop and
! try to find one with easy to determine number of iterations -
! `find_loop_niter' on GIMPLE and `find_simple_exit' on RTL.  Finally,
! there are functions that provide the same information, but additionally
! cache it, so that repeated calls to number of iterations are not so
! costly - `number_of_latch_executions' on GIMPLE and
! `get_simple_loop_desc' on RTL.
  
   Note that some of these functions may behave slightly differently than
  others - some of them return only the expression for the number of
  iterations, and fail if there are some assumptions.  The function
! `number_of_latch_executions' works only for single-exit loops.  The
! function `number_of_cond_exit_executions' can be used to determine
  number of executions of the exit condition of a single-exit loop (i.e.,
! the `number_of_latch_executions' increased by one).
  
  
  File: gccint.info,  Node: Dependency analysis,  Next: Omega,  Prev: Number of iterations,  Up: Loop Analysis and Representation
--- 18256,18294 ----
  result.  The following information and conditions are provided by the
  analysis:
  
!    * 'assumptions': If this condition is false, the rest of the
       information is invalid.
!    * 'noloop_assumptions' on RTL, 'may_be_zero' on GIMPLE: If this
       condition is true, the loop exits in the first iteration.
!    * 'infinite': If this condition is true, the loop is infinite.  This
       condition is only available on RTL.  On GIMPLE, conditions for
!      finiteness of the loop are included in 'assumptions'.
!    * 'niter_expr' on RTL, 'niter' on GIMPLE: The expression that gives
       number of iterations.  The number of iterations is defined as the
       number of executions of the loop latch.
  
   Both on GIMPLE and on RTL, it necessary for the induction variable
  analysis framework to be initialized (SCEV on GIMPLE, loop-iv on RTL).
! On GIMPLE, the results are stored to 'struct tree_niter_desc' structure.
! Number of iterations before the loop is exited through a given exit can
! be determined using 'number_of_iterations_exit' function.  On RTL, the
! results are returned in 'struct niter_desc' structure.  The
! corresponding function is named 'check_simple_exit'.  There are also
! functions that pass through all the exits of a loop and try to find one
! with easy to determine number of iterations - 'find_loop_niter' on
! GIMPLE and 'find_simple_exit' on RTL.  Finally, there are functions that
! provide the same information, but additionally cache it, so that
! repeated calls to number of iterations are not so costly -
! 'number_of_latch_executions' on GIMPLE and 'get_simple_loop_desc' on
! RTL.
  
   Note that some of these functions may behave slightly differently than
  others - some of them return only the expression for the number of
  iterations, and fail if there are some assumptions.  The function
! 'number_of_latch_executions' works only for single-exit loops.  The
! function 'number_of_cond_exit_executions' can be used to determine
  number of executions of the exit condition of a single-exit loop (i.e.,
! the 'number_of_latch_executions' increased by one).
  
  
  File: gccint.info,  Node: Dependency analysis,  Next: Omega,  Prev: Number of iterations,  Up: Loop Analysis and Representation
*************** File: gccint.info,  Node: Dependency ana
*** 18500,18520 ****
  =============================
  
  The code for the data dependence analysis can be found in
! `tree-data-ref.c' and its interface and data structures are described
! in `tree-data-ref.h'.  The function that computes the data dependences
! for all the array and pointer references for a given loop is
! `compute_data_dependences_for_loop'.  This function is currently used
! by the linear loop transform and the vectorization passes.  Before
! calling this function, one has to allocate two vectors: a first vector
! will contain the set of data references that are contained in the
! analyzed loop body, and the second vector will contain the dependence
! relations between the data references.  Thus if the vector of data
! references is of size `n', the vector containing the dependence
! relations will contain `n*n' elements.  However if the analyzed loop
! contains side effects, such as calls that potentially can interfere
! with the data references in the current analyzed loop, the analysis
! stops while scanning the loop body for data references, and inserts a
! single `chrec_dont_know' in the dependence relation array.
  
   The data references are discovered in a particular order during the
  scanning of the loop body: the loop body is analyzed in execution order,
--- 18297,18317 ----
  =============================
  
  The code for the data dependence analysis can be found in
! 'tree-data-ref.c' and its interface and data structures are described in
! 'tree-data-ref.h'.  The function that computes the data dependences for
! all the array and pointer references for a given loop is
! 'compute_data_dependences_for_loop'.  This function is currently used by
! the linear loop transform and the vectorization passes.  Before calling
! this function, one has to allocate two vectors: a first vector will
! contain the set of data references that are contained in the analyzed
! loop body, and the second vector will contain the dependence relations
! between the data references.  Thus if the vector of data references is
! of size 'n', the vector containing the dependence relations will contain
! 'n*n' elements.  However if the analyzed loop contains side effects,
! such as calls that potentially can interfere with the data references in
! the current analyzed loop, the analysis stops while scanning the loop
! body for data references, and inserts a single 'chrec_dont_know' in the
! dependence relation array.
  
   The data references are discovered in a particular order during the
  scanning of the loop body: the loop body is analyzed in execution order,
*************** and mapping this order to the elements o
*** 18526,18561 ****
  queries to the loop body representation.
  
   Three types of data references are currently handled: ARRAY_REF,
! INDIRECT_REF and COMPONENT_REF. The data structure for the data
! reference is `data_reference', where `data_reference_p' is a name of a
! pointer to the data reference structure. The structure contains the
  following elements:
  
!    * `base_object_info': Provides information about the base object of
!      the data reference and its access functions. These access functions
!      represent the evolution of the data reference in the loop relative
!      to its base, in keeping with the classical meaning of the data
!      reference access function for the support of arrays. For example,
!      for a reference `a.b[i][j]', the base object is `a.b' and the
!      access functions, one for each array subscript, are: `{i_init, +
!      i_step}_1, {j_init, +, j_step}_2'.
  
!    * `first_location_in_loop': Provides information about the first
       location accessed by the data reference in the loop and about the
       access function used to represent evolution relative to this
!      location. This data is used to support pointers, and is not used
!      for arrays (for which we have base objects). Pointer accesses are
       represented as a one-dimensional access that starts from the first
!      location accessed in the loop. For example:
  
                  for1 i
                     for2 j
                      *((int *)p + i + j) = a[i][j];
  
!      The access function of the pointer access is `{0, + 4B}_for2'
!      relative to `p + i'. The access functions of the array are
!      `{i_init, + i_step}_for1' and `{j_init, +, j_step}_for2' relative
!      to `a'.
  
       Usually, the object the pointer refers to is either unknown, or we
       can't prove that the access is confined to the boundaries of a
--- 18323,18358 ----
  queries to the loop body representation.
  
   Three types of data references are currently handled: ARRAY_REF,
! INDIRECT_REF and COMPONENT_REF.  The data structure for the data
! reference is 'data_reference', where 'data_reference_p' is a name of a
! pointer to the data reference structure.  The structure contains the
  following elements:
  
!    * 'base_object_info': Provides information about the base object of
!      the data reference and its access functions.  These access
!      functions represent the evolution of the data reference in the loop
!      relative to its base, in keeping with the classical meaning of the
!      data reference access function for the support of arrays.  For
!      example, for a reference 'a.b[i][j]', the base object is 'a.b' and
!      the access functions, one for each array subscript, are: '{i_init,
!      + i_step}_1, {j_init, +, j_step}_2'.
  
!    * 'first_location_in_loop': Provides information about the first
       location accessed by the data reference in the loop and about the
       access function used to represent evolution relative to this
!      location.  This data is used to support pointers, and is not used
!      for arrays (for which we have base objects).  Pointer accesses are
       represented as a one-dimensional access that starts from the first
!      location accessed in the loop.  For example:
  
                  for1 i
                     for2 j
                      *((int *)p + i + j) = a[i][j];
  
!      The access function of the pointer access is '{0, + 4B}_for2'
!      relative to 'p + i'.  The access functions of the array are
!      '{i_init, + i_step}_for1' and '{j_init, +, j_step}_for2' relative
!      to 'a'.
  
       Usually, the object the pointer refers to is either unknown, or we
       can't prove that the access is confined to the boundaries of a
*************** following elements:
*** 18566,18622 ****
       references.
  
       The current strategy for data dependence tests is as follows: If
!      both `a' and `b' are represented as arrays, compare
!      `a.base_object' and `b.base_object'; if they are equal, apply
!      dependence tests (use access functions based on base_objects).
!      Else if both `a' and `b' are represented as pointers, compare
!      `a.first_location' and `b.first_location'; if they are equal,
!      apply dependence tests (use access functions based on first
!      location).  However, if `a' and `b' are represented differently,
!      only try to prove that the bases are definitely different.
  
     * Aliasing information.
- 
     * Alignment information.
  
   The structure describing the relation between two data references is
! `data_dependence_relation' and the shorter name for a pointer to such a
! structure is `ddr_p'.  This structure contains:
  
     * a pointer to each data reference,
! 
!    * a tree node `are_dependent' that is set to `chrec_known' if the
       analysis has proved that there is no dependence between these two
!      data references, `chrec_dont_know' if the analysis was not able to
       determine any useful result and potentially there could exist a
!      dependence between these data references, and `are_dependent' is
!      set to `NULL_TREE' if there exist a dependence relation between the
       data references, and the description of this dependence relation is
!      given in the `subscripts', `dir_vects', and `dist_vects' arrays,
! 
     * a boolean that determines whether the dependence relation can be
       represented by a classical distance vector,
! 
!    * an array `subscripts' that contains a description of each
!      subscript of the data references.  Given two array accesses a
!      subscript is the tuple composed of the access functions for a given
!      dimension.  For example, given `A[f1][f2][f3]' and
!      `B[g1][g2][g3]', there are three subscripts: `(f1, g1), (f2, g2),
!      (f3, g3)'.
! 
!    * two arrays `dir_vects' and `dist_vects' that contain classical
!      representations of the data dependences under the form of
!      direction and distance dependence vectors,
! 
!    * an array of loops `loop_nest' that contains the loops to which the
       distance and direction vectors refer to.
  
   Several functions for pretty printing the information extracted by the
! data dependence analysis are available: `dump_ddrs' prints with a
  maximum verbosity the details of a data dependence relations array,
! `dump_dist_dir_vectors' prints only the classical distance and
! direction vectors for a data dependence relations array, and
! `dump_data_references' prints the details of the data references
  contained in a data reference array.
  
  
--- 18363,18412 ----
       references.
  
       The current strategy for data dependence tests is as follows: If
!      both 'a' and 'b' are represented as arrays, compare 'a.base_object'
!      and 'b.base_object'; if they are equal, apply dependence tests (use
!      access functions based on base_objects).  Else if both 'a' and 'b'
!      are represented as pointers, compare 'a.first_location' and
!      'b.first_location'; if they are equal, apply dependence tests (use
!      access functions based on first location).  However, if 'a' and 'b'
!      are represented differently, only try to prove that the bases are
!      definitely different.
  
     * Aliasing information.
     * Alignment information.
  
   The structure describing the relation between two data references is
! 'data_dependence_relation' and the shorter name for a pointer to such a
! structure is 'ddr_p'.  This structure contains:
  
     * a pointer to each data reference,
!    * a tree node 'are_dependent' that is set to 'chrec_known' if the
       analysis has proved that there is no dependence between these two
!      data references, 'chrec_dont_know' if the analysis was not able to
       determine any useful result and potentially there could exist a
!      dependence between these data references, and 'are_dependent' is
!      set to 'NULL_TREE' if there exist a dependence relation between the
       data references, and the description of this dependence relation is
!      given in the 'subscripts', 'dir_vects', and 'dist_vects' arrays,
     * a boolean that determines whether the dependence relation can be
       represented by a classical distance vector,
!    * an array 'subscripts' that contains a description of each subscript
!      of the data references.  Given two array accesses a subscript is
!      the tuple composed of the access functions for a given dimension.
!      For example, given 'A[f1][f2][f3]' and 'B[g1][g2][g3]', there are
!      three subscripts: '(f1, g1), (f2, g2), (f3, g3)'.
!    * two arrays 'dir_vects' and 'dist_vects' that contain classical
!      representations of the data dependences under the form of direction
!      and distance dependence vectors,
!    * an array of loops 'loop_nest' that contains the loops to which the
       distance and direction vectors refer to.
  
   Several functions for pretty printing the information extracted by the
! data dependence analysis are available: 'dump_ddrs' prints with a
  maximum verbosity the details of a data dependence relations array,
! 'dump_dist_dir_vectors' prints only the classical distance and direction
! vectors for a data dependence relations array, and
! 'dump_data_references' prints the details of the data references
  contained in a data reference array.
  
  
*************** ensuring the consistency of the results
*** 18631,18654 ****
  dependence check pass has been implemented based on two different
  solvers.  The second method that has been integrated to GCC is based on
  the Omega dependence solver, written in the 1990's by William Pugh and
! David Wonnacott.  Data dependence tests can be formulated using a
! subset of the Presburger arithmetics that can be translated to linear
  constraint systems.  These linear constraint systems can then be solved
  using the Omega solver.
  
   The Omega solver is using Fourier-Motzkin's algorithm for variable
! elimination: a linear constraint system containing `n' variables is
! reduced to a linear constraint system with `n-1' variables.  The Omega
! solver can also be used for solving other problems that can be
! expressed under the form of a system of linear equalities and
! inequalities.  The Omega solver is known to have an exponential worst
! case, also known under the name of "omega nightmare" in the literature,
! but in practice, the omega test is known to be efficient for the common
! data dependence tests.
  
   The interface used by the Omega solver for describing the linear
! programming problems is described in `omega.h', and the solver is
! `omega_solve_problem'.
  
  
  File: gccint.info,  Node: Machine Desc,  Next: Target Macros,  Prev: Loop Analysis and Representation,  Up: Top
--- 18421,18444 ----
  dependence check pass has been implemented based on two different
  solvers.  The second method that has been integrated to GCC is based on
  the Omega dependence solver, written in the 1990's by William Pugh and
! David Wonnacott.  Data dependence tests can be formulated using a subset
! of the Presburger arithmetics that can be translated to linear
  constraint systems.  These linear constraint systems can then be solved
  using the Omega solver.
  
   The Omega solver is using Fourier-Motzkin's algorithm for variable
! elimination: a linear constraint system containing 'n' variables is
! reduced to a linear constraint system with 'n-1' variables.  The Omega
! solver can also be used for solving other problems that can be expressed
! under the form of a system of linear equalities and inequalities.  The
! Omega solver is known to have an exponential worst case, also known
! under the name of "omega nightmare" in the literature, but in practice,
! the omega test is known to be efficient for the common data dependence
! tests.
  
   The interface used by the Omega solver for describing the linear
! programming problems is described in 'omega.h', and the solver is
! 'omega_solve_problem'.
  
  
  File: gccint.info,  Node: Machine Desc,  Next: Target Macros,  Prev: Loop Analysis and Representation,  Up: Top
*************** File: gccint.info,  Node: Machine Desc,
*** 18657,18665 ****
  ***********************
  
  A machine description has two parts: a file of instruction patterns
! (`.md' file) and a C header file of macro definitions.
  
!  The `.md' file for a target machine contains a pattern for each
  instruction that the target machine supports (or at least each
  instruction that is worth telling the compiler about).  It may also
  contain comments.  A semicolon causes the rest of the line to be a
--- 18447,18455 ----
  ***********************
  
  A machine description has two parts: a file of instruction patterns
! ('.md' file) and a C header file of macro definitions.
  
!  The '.md' file for a target machine contains a pattern for each
  instruction that the target machine supports (or at least each
  instruction that is worth telling the compiler about).  It may also
  contain comments.  A semicolon causes the rest of the line to be a
*************** comment, unless the semicolon is inside
*** 18671,18677 ****
  
  * Overview::            How the machine description is used.
  * Patterns::            How to write instruction patterns.
! * Example::             An explained example of a `define_insn' pattern.
  * RTL Template::        The RTL template defines what insns match a pattern.
  * Output Template::     The output template says how to make assembler code
                          from such an insn.
--- 18461,18467 ----
  
  * Overview::            How the machine description is used.
  * Patterns::            How to write instruction patterns.
! * Example::             An explained example of a 'define_insn' pattern.
  * RTL Template::        The RTL template defines what insns match a pattern.
  * Output Template::     The output template says how to make assembler code
                          from such an insn.
*************** comment, unless the semicolon is inside
*** 18692,18700 ****
  * Including Patterns::  Including Patterns in Machine Descriptions.
  * Peephole Definitions::Defining machine-specific peephole optimizations.
  * Insn Attributes::     Specifying the value of attributes for generated insns.
! * Conditional Execution::Generating `define_insn' patterns for
                           predication.
! * Define Subst::	Generating `define_insn' and `define_expand'
  			patterns from other patterns.
  * Constant Definitions::Defining symbolic constants that can be used in the
                          md file.
--- 18482,18490 ----
  * Including Patterns::  Including Patterns in Machine Descriptions.
  * Peephole Definitions::Defining machine-specific peephole optimizations.
  * Insn Attributes::     Specifying the value of attributes for generated insns.
! * Conditional Execution::Generating 'define_insn' patterns for
                           predication.
! * Define Subst::	Generating 'define_insn' and 'define_expand'
  			patterns from other patterns.
  * Constant Definitions::Defining symbolic constants that can be used in the
                          md file.
*************** There are three main conversions that ha
*** 18716,18747 ****
    3. The insn list is matched against the RTL templates to produce
       assembler code.
  
- 
   For the generate pass, only the names of the insns matter, from either
! a named `define_insn' or a `define_expand'.  The compiler will choose
  the pattern with the right name and apply the operands according to the
! documentation later in this chapter, without regard for the RTL
! template or operand constraints.  Note that the names the compiler looks
! for are hard-coded in the compiler--it will ignore unnamed patterns and
! patterns with names it doesn't know about, but if you don't provide a
! named pattern it needs, it will abort.
  
!  If a `define_insn' is used, the template given is inserted into the
! insn list.  If a `define_expand' is used, one of three things happens,
  based on the condition logic.  The condition logic may manually create
! new insns for the insn list, say via `emit_insn()', and invoke `DONE'.
! For certain named patterns, it may invoke `FAIL' to tell the compiler
! to use an alternate way of performing that task.  If it invokes neither
! `DONE' nor `FAIL', the template given in the pattern is inserted, as if
! the `define_expand' were a `define_insn'.
  
   Once the insn list is generated, various optimization passes convert,
  replace, and rearrange the insns in the insn list.  This is where the
! `define_split' and `define_peephole' patterns get used, for example.
  
   Finally, the insn list's RTL is matched up with the RTL templates in
! the `define_insn' patterns, and those patterns are used to emit the
! final assembly code.  For this purpose, each named `define_insn' acts
  like it's unnamed, since the names are ignored.
  
  
--- 18506,18536 ----
    3. The insn list is matched against the RTL templates to produce
       assembler code.
  
   For the generate pass, only the names of the insns matter, from either
! a named 'define_insn' or a 'define_expand'.  The compiler will choose
  the pattern with the right name and apply the operands according to the
! documentation later in this chapter, without regard for the RTL template
! or operand constraints.  Note that the names the compiler looks for are
! hard-coded in the compiler--it will ignore unnamed patterns and patterns
! with names it doesn't know about, but if you don't provide a named
! pattern it needs, it will abort.
  
!  If a 'define_insn' is used, the template given is inserted into the
! insn list.  If a 'define_expand' is used, one of three things happens,
  based on the condition logic.  The condition logic may manually create
! new insns for the insn list, say via 'emit_insn()', and invoke 'DONE'.
! For certain named patterns, it may invoke 'FAIL' to tell the compiler to
! use an alternate way of performing that task.  If it invokes neither
! 'DONE' nor 'FAIL', the template given in the pattern is inserted, as if
! the 'define_expand' were a 'define_insn'.
  
   Once the insn list is generated, various optimization passes convert,
  replace, and rearrange the insns in the insn list.  This is where the
! 'define_split' and 'define_peephole' patterns get used, for example.
  
   Finally, the insn list's RTL is matched up with the RTL templates in
! the 'define_insn' patterns, and those patterns are used to emit the
! final assembly code.  For this purpose, each named 'define_insn' acts
  like it's unnamed, since the names are ignored.
  
  
*************** File: gccint.info,  Node: Patterns,  Nex
*** 18750,18808 ****
  16.2 Everything about Instruction Patterns
  ==========================================
  
! A `define_insn' expression is used to define instruction patterns to
! which insns may be matched.  A `define_insn' expression contains an
  incomplete RTL expression, with pieces to be filled in later, operand
  constraints that restrict how the pieces can be filled in, and an output
  template or C code to generate the assembler output.
  
!  A `define_insn' is an RTL expression containing four or five operands:
  
    1. An optional name.  The presence of a name indicate that this
       instruction pattern can perform a certain standard job for the
!      RTL-generation pass of the compiler.  This pass knows certain
!      names and will use the instruction patterns with those names, if
!      the names are defined in the machine description.
  
!      The absence of a name is indicated by writing an empty string
!      where the name should go.  Nameless instruction patterns are never
!      used for generating RTL code, but they may permit several simpler
!      insns to be combined later on.
  
       Names that are not thus known and used in RTL-generation have no
       effect; they are equivalent to no name at all.
  
       For the purpose of debugging the compiler, you may also specify a
!      name beginning with the `*' character.  Such a name is used only
       for identifying the instruction in RTL dumps; it is equivalent to
       having a nameless pattern for all other purposes.  Names beginning
!      with the `*' character are not required to be unique.
  
    2. The "RTL template": This is a vector of incomplete RTL expressions
       which describe the semantics of the instruction (*note RTL
       Template::).  It is incomplete because it may contain
!      `match_operand', `match_operator', and `match_dup' expressions
!      that stand for operands of the instruction.
  
!      If the vector has multiple elements, the RTL template is treated
!      as a `parallel' expression.
  
    3. The condition: This is a string which contains a C expression.
       When the compiler attempts to match RTL against a pattern, the
!      condition is evaluated.  If the condition evaluates to `true', the
!      match is permitted.  The condition may be an empty string, which
!      is treated as always `true'.
  
       For a named pattern, the condition may not depend on the data in
       the insn being matched, but only the target-machine-type flags.
       The compiler needs to test these conditions during initialization
!      in order to learn exactly which named instructions are available
!      in a particular run.
  
       For nameless patterns, the condition is applied only when matching
       an individual insn, and only after the insn has matched the
       pattern's recognition template.  The insn's operands may be found
!      in the vector `operands'.
  
       For an insn where the condition has once matched, it cannot later
       be used to control register allocation by excluding certain
--- 18539,18597 ----
  16.2 Everything about Instruction Patterns
  ==========================================
  
! A 'define_insn' expression is used to define instruction patterns to
! which insns may be matched.  A 'define_insn' expression contains an
  incomplete RTL expression, with pieces to be filled in later, operand
  constraints that restrict how the pieces can be filled in, and an output
  template or C code to generate the assembler output.
  
!  A 'define_insn' is an RTL expression containing four or five operands:
  
    1. An optional name.  The presence of a name indicate that this
       instruction pattern can perform a certain standard job for the
!      RTL-generation pass of the compiler.  This pass knows certain names
!      and will use the instruction patterns with those names, if the
!      names are defined in the machine description.
  
!      The absence of a name is indicated by writing an empty string where
!      the name should go.  Nameless instruction patterns are never used
!      for generating RTL code, but they may permit several simpler insns
!      to be combined later on.
  
       Names that are not thus known and used in RTL-generation have no
       effect; they are equivalent to no name at all.
  
       For the purpose of debugging the compiler, you may also specify a
!      name beginning with the '*' character.  Such a name is used only
       for identifying the instruction in RTL dumps; it is equivalent to
       having a nameless pattern for all other purposes.  Names beginning
!      with the '*' character are not required to be unique.
  
    2. The "RTL template": This is a vector of incomplete RTL expressions
       which describe the semantics of the instruction (*note RTL
       Template::).  It is incomplete because it may contain
!      'match_operand', 'match_operator', and 'match_dup' expressions that
!      stand for operands of the instruction.
  
!      If the vector has multiple elements, the RTL template is treated as
!      a 'parallel' expression.
  
    3. The condition: This is a string which contains a C expression.
       When the compiler attempts to match RTL against a pattern, the
!      condition is evaluated.  If the condition evaluates to 'true', the
!      match is permitted.  The condition may be an empty string, which is
!      treated as always 'true'.
  
       For a named pattern, the condition may not depend on the data in
       the insn being matched, but only the target-machine-type flags.
       The compiler needs to test these conditions during initialization
!      in order to learn exactly which named instructions are available in
!      a particular run.
  
       For nameless patterns, the condition is applied only when matching
       an individual insn, and only after the insn has matched the
       pattern's recognition template.  The insn's operands may be found
!      in the vector 'operands'.
  
       For an insn where the condition has once matched, it cannot later
       be used to control register allocation by excluding certain
*************** template or C code to generate the assem
*** 18821,18827 ****
  
  File: gccint.info,  Node: Example,  Next: RTL Template,  Prev: Patterns,  Up: Machine Desc
  
! 16.3 Example of `define_insn'
  =============================
  
  Here is an example of an instruction pattern, taken from the machine
--- 18610,18616 ----
  
  File: gccint.info,  Node: Example,  Next: RTL Template,  Prev: Patterns,  Up: Machine Desc
  
! 16.3 Example of 'define_insn'
  =============================
  
  Here is an example of an instruction pattern, taken from the machine
*************** This can also be written using braced st
*** 18853,18859 ****
   This describes an instruction which sets the condition codes based on
  the value of a general operand.  It has no condition, so any insn with
  an RTL description of the form shown may be matched to this pattern.
! The name `tstsi' means "test a `SImode' value" and tells the RTL
  generation pass that, when it is necessary to test such a value, an insn
  to do so can be constructed using this pattern.
  
--- 18642,18648 ----
   This describes an instruction which sets the condition codes based on
  the value of a general operand.  It has no condition, so any insn with
  an RTL description of the form shown may be matched to this pattern.
! The name 'tstsi' means "test a 'SImode' value" and tells the RTL
  generation pass that, when it is necessary to test such a value, an insn
  to do so can be constructed using this pattern.
  
*************** to do so can be constructed using this p
*** 18861,18867 ****
  output template to return based on the kind of operand and the specific
  type of CPU for which code is being generated.
  
!  `"rm"' is an operand constraint.  Its meaning is explained below.
  
  
  File: gccint.info,  Node: RTL Template,  Next: Output Template,  Prev: Example,  Up: Machine Desc
--- 18650,18656 ----
  output template to return based on the kind of operand and the specific
  type of CPU for which code is being generated.
  
!  '"rm"' is an operand constraint.  Its meaning is explained below.
  
  
  File: gccint.info,  Node: RTL Template,  Next: Output Template,  Prev: Example,  Up: Machine Desc
*************** the operands in the insn being matched.
*** 18879,18976 ****
  controlled by special expression types that direct matching and
  substitution of the operands.
  
! `(match_operand:M N PREDICATE CONSTRAINT)'
       This expression is a placeholder for operand number N of the insn.
       When constructing an insn, operand number N will be substituted at
       this point.  When matching an insn, whatever appears at this
!      position in the insn will be taken as operand number N; but it
!      must satisfy PREDICATE or this instruction pattern will not match
!      at all.
  
       Operand numbers must be chosen consecutively counting from zero in
!      each instruction pattern.  There may be only one `match_operand'
       expression in the pattern for each operand number.  Usually
!      operands are numbered in the order of appearance in `match_operand'
!      expressions.  In the case of a `define_expand', any operand numbers
!      used only in `match_dup' expressions have higher values than all
       other operand numbers.
  
       PREDICATE is a string that is the name of a function that accepts
       two arguments, an expression and a machine mode.  *Note
       Predicates::.  During matching, the function will be called with
       the putative operand as the expression and M as the mode argument
!      (if M is not specified, `VOIDmode' will be used, which normally
       causes PREDICATE to accept any mode).  If it returns zero, this
       instruction pattern fails to match.  PREDICATE may be an empty
       string; then it means no test is to be done on the operand, so
       anything which occurs in this position is valid.
  
!      Most of the time, PREDICATE will reject modes other than M--but
!      not always.  For example, the predicate `address_operand' uses M
!      as the mode of memory ref that the address should be valid for.
!      Many predicates accept `const_int' nodes even though their mode is
!      `VOIDmode'.
  
       CONSTRAINT controls reloading and the choice of the best register
       class to use for a value, as explained later (*note Constraints::).
       If the constraint would be an empty string, it can be omitted.
  
       People are often unclear on the difference between the constraint
!      and the predicate.  The predicate helps decide whether a given
!      insn matches the pattern.  The constraint plays no role in this
       decision; instead, it controls various decisions in the case of an
       insn which does match.
  
! `(match_scratch:M N CONSTRAINT)'
       This expression is also a placeholder for operand number N and
!      indicates that operand must be a `scratch' or `reg' expression.
  
       When matching patterns, this is equivalent to
  
            (match_operand:M N "scratch_operand" CONSTRAINT)
  
!      but, when generating RTL, it produces a (`scratch':M) expression.
  
!      If the last few expressions in a `parallel' are `clobber'
       expressions whose operands are either a hard register or
!      `match_scratch', the combiner can add or delete them when
       necessary.  *Note Side Effects::.
  
! `(match_dup N)'
       This expression is also a placeholder for operand number N.  It is
       used when the operand needs to appear more than once in the insn.
  
!      In construction, `match_dup' acts just like `match_operand': the
       operand is substituted into the insn being constructed.  But in
!      matching, `match_dup' behaves differently.  It assumes that operand
!      number N has already been determined by a `match_operand'
!      appearing earlier in the recognition template, and it matches only
!      an identical-looking expression.
  
!      Note that `match_dup' should not be used to tell the compiler that
       a particular register is being used for two operands (example:
!      `add' that adds one register to another; the second register is
       both an input operand and the output operand).  Use a matching
!      constraint (*note Simple Constraints::) for those.  `match_dup' is
       for the cases where one operand is used in two places in the
       template, such as an instruction that computes both a quotient and
       a remainder, where the opcode takes two input operands but the RTL
!      template has to refer to each of those twice; once for the
!      quotient pattern and once for the remainder pattern.
  
! `(match_operator:M N PREDICATE [OPERANDS...])'
       This pattern is a kind of placeholder for a variable RTL expression
       code.
  
       When constructing an insn, it stands for an RTL expression whose
!      expression code is taken from that of operand N, and whose
!      operands are constructed from the patterns OPERANDS.
  
       When matching an expression, it matches an expression if the
       function PREDICATE returns nonzero on that expression _and_ the
       patterns OPERANDS match the operands of the expression.
  
!      Suppose that the function `commutative_operator' is defined as
       follows, to match any expression whose operator is one of the
       commutative arithmetic operators of RTL and whose mode is MODE:
  
--- 18668,18765 ----
  controlled by special expression types that direct matching and
  substitution of the operands.
  
! '(match_operand:M N PREDICATE CONSTRAINT)'
       This expression is a placeholder for operand number N of the insn.
       When constructing an insn, operand number N will be substituted at
       this point.  When matching an insn, whatever appears at this
!      position in the insn will be taken as operand number N; but it must
!      satisfy PREDICATE or this instruction pattern will not match at
!      all.
  
       Operand numbers must be chosen consecutively counting from zero in
!      each instruction pattern.  There may be only one 'match_operand'
       expression in the pattern for each operand number.  Usually
!      operands are numbered in the order of appearance in 'match_operand'
!      expressions.  In the case of a 'define_expand', any operand numbers
!      used only in 'match_dup' expressions have higher values than all
       other operand numbers.
  
       PREDICATE is a string that is the name of a function that accepts
       two arguments, an expression and a machine mode.  *Note
       Predicates::.  During matching, the function will be called with
       the putative operand as the expression and M as the mode argument
!      (if M is not specified, 'VOIDmode' will be used, which normally
       causes PREDICATE to accept any mode).  If it returns zero, this
       instruction pattern fails to match.  PREDICATE may be an empty
       string; then it means no test is to be done on the operand, so
       anything which occurs in this position is valid.
  
!      Most of the time, PREDICATE will reject modes other than M--but not
!      always.  For example, the predicate 'address_operand' uses M as the
!      mode of memory ref that the address should be valid for.  Many
!      predicates accept 'const_int' nodes even though their mode is
!      'VOIDmode'.
  
       CONSTRAINT controls reloading and the choice of the best register
       class to use for a value, as explained later (*note Constraints::).
       If the constraint would be an empty string, it can be omitted.
  
       People are often unclear on the difference between the constraint
!      and the predicate.  The predicate helps decide whether a given insn
!      matches the pattern.  The constraint plays no role in this
       decision; instead, it controls various decisions in the case of an
       insn which does match.
  
! '(match_scratch:M N CONSTRAINT)'
       This expression is also a placeholder for operand number N and
!      indicates that operand must be a 'scratch' or 'reg' expression.
  
       When matching patterns, this is equivalent to
  
            (match_operand:M N "scratch_operand" CONSTRAINT)
  
!      but, when generating RTL, it produces a ('scratch':M) expression.
  
!      If the last few expressions in a 'parallel' are 'clobber'
       expressions whose operands are either a hard register or
!      'match_scratch', the combiner can add or delete them when
       necessary.  *Note Side Effects::.
  
! '(match_dup N)'
       This expression is also a placeholder for operand number N.  It is
       used when the operand needs to appear more than once in the insn.
  
!      In construction, 'match_dup' acts just like 'match_operand': the
       operand is substituted into the insn being constructed.  But in
!      matching, 'match_dup' behaves differently.  It assumes that operand
!      number N has already been determined by a 'match_operand' appearing
!      earlier in the recognition template, and it matches only an
!      identical-looking expression.
  
!      Note that 'match_dup' should not be used to tell the compiler that
       a particular register is being used for two operands (example:
!      'add' that adds one register to another; the second register is
       both an input operand and the output operand).  Use a matching
!      constraint (*note Simple Constraints::) for those.  'match_dup' is
       for the cases where one operand is used in two places in the
       template, such as an instruction that computes both a quotient and
       a remainder, where the opcode takes two input operands but the RTL
!      template has to refer to each of those twice; once for the quotient
!      pattern and once for the remainder pattern.
  
! '(match_operator:M N PREDICATE [OPERANDS...])'
       This pattern is a kind of placeholder for a variable RTL expression
       code.
  
       When constructing an insn, it stands for an RTL expression whose
!      expression code is taken from that of operand N, and whose operands
!      are constructed from the patterns OPERANDS.
  
       When matching an expression, it matches an expression if the
       function PREDICATE returns nonzero on that expression _and_ the
       patterns OPERANDS match the operands of the expression.
  
!      Suppose that the function 'commutative_operator' is defined as
       follows, to match any expression whose operator is one of the
       commutative arithmetic operators of RTL and whose mode is MODE:
  
*************** substitution of the operands.
*** 18993,19058 ****
              [(match_operand:SI 1 "general_operand" "g")
               (match_operand:SI 2 "general_operand" "g")])
  
!      Here the vector `[OPERANDS...]' contains two patterns because the
       expressions to be matched all contain two operands.
  
       When this pattern does match, the two operands of the commutative
       operator are recorded as operands 1 and 2 of the insn.  (This is
!      done by the two instances of `match_operand'.)  Operand 3 of the
!      insn will be the entire commutative expression: use `GET_CODE
       (operands[3])' to see which commutative operator was used.
  
!      The machine mode M of `match_operator' works like that of
!      `match_operand': it is passed as the second argument to the
       predicate function, and that function is solely responsible for
       deciding whether the expression to be matched "has" that mode.
  
       When constructing an insn, argument 3 of the gen-function will
!      specify the operation (i.e. the expression code) for the
!      expression to be made.  It should be an RTL expression, whose
!      expression code is copied into a new expression whose operands are
!      arguments 1 and 2 of the gen-function.  The subexpressions of
!      argument 3 are not used; only its expression code matters.
  
!      When `match_operator' is used in a pattern for matching an insn,
!      it usually best if the operand number of the `match_operator' is
       higher than that of the actual operands of the insn.  This improves
       register allocation because the register allocator often looks at
       operands 1 and 2 of insns to see if it can do register tying.
  
!      There is no way to specify constraints in `match_operator'.  The
!      operand of the insn which corresponds to the `match_operator'
!      never has any constraints because it is never reloaded as a whole.
!      However, if parts of its OPERANDS are matched by `match_operand'
       patterns, those parts may have constraints of their own.
  
! `(match_op_dup:M N[OPERANDS...])'
!      Like `match_dup', except that it applies to operators instead of
       operands.  When constructing an insn, operand number N will be
!      substituted at this point.  But in matching, `match_op_dup' behaves
       differently.  It assumes that operand number N has already been
!      determined by a `match_operator' appearing earlier in the
       recognition template, and it matches only an identical-looking
       expression.
  
! `(match_parallel N PREDICATE [SUBPAT...])'
       This pattern is a placeholder for an insn that consists of a
!      `parallel' expression with a variable number of elements.  This
       expression should only appear at the top level of an insn pattern.
  
       When constructing an insn, operand number N will be substituted at
       this point.  When matching an insn, it matches if the body of the
!      insn is a `parallel' expression with at least as many elements as
!      the vector of SUBPAT expressions in the `match_parallel', if each
!      SUBPAT matches the corresponding element of the `parallel', _and_
!      the function PREDICATE returns nonzero on the `parallel' that is
!      the body of the insn.  It is the responsibility of the predicate
!      to validate elements of the `parallel' beyond those listed in the
!      `match_parallel'.
  
!      A typical use of `match_parallel' is to match load and store
       multiple expressions, which can contain a variable number of
!      elements in a `parallel'.  For example,
  
            (define_insn ""
              [(match_parallel 0 "load_multiple_operation"
--- 18782,18847 ----
              [(match_operand:SI 1 "general_operand" "g")
               (match_operand:SI 2 "general_operand" "g")])
  
!      Here the vector '[OPERANDS...]' contains two patterns because the
       expressions to be matched all contain two operands.
  
       When this pattern does match, the two operands of the commutative
       operator are recorded as operands 1 and 2 of the insn.  (This is
!      done by the two instances of 'match_operand'.)  Operand 3 of the
!      insn will be the entire commutative expression: use 'GET_CODE
       (operands[3])' to see which commutative operator was used.
  
!      The machine mode M of 'match_operator' works like that of
!      'match_operand': it is passed as the second argument to the
       predicate function, and that function is solely responsible for
       deciding whether the expression to be matched "has" that mode.
  
       When constructing an insn, argument 3 of the gen-function will
!      specify the operation (i.e. the expression code) for the expression
!      to be made.  It should be an RTL expression, whose expression code
!      is copied into a new expression whose operands are arguments 1 and
!      2 of the gen-function.  The subexpressions of argument 3 are not
!      used; only its expression code matters.
  
!      When 'match_operator' is used in a pattern for matching an insn, it
!      usually best if the operand number of the 'match_operator' is
       higher than that of the actual operands of the insn.  This improves
       register allocation because the register allocator often looks at
       operands 1 and 2 of insns to see if it can do register tying.
  
!      There is no way to specify constraints in 'match_operator'.  The
!      operand of the insn which corresponds to the 'match_operator' never
!      has any constraints because it is never reloaded as a whole.
!      However, if parts of its OPERANDS are matched by 'match_operand'
       patterns, those parts may have constraints of their own.
  
! '(match_op_dup:M N[OPERANDS...])'
!      Like 'match_dup', except that it applies to operators instead of
       operands.  When constructing an insn, operand number N will be
!      substituted at this point.  But in matching, 'match_op_dup' behaves
       differently.  It assumes that operand number N has already been
!      determined by a 'match_operator' appearing earlier in the
       recognition template, and it matches only an identical-looking
       expression.
  
! '(match_parallel N PREDICATE [SUBPAT...])'
       This pattern is a placeholder for an insn that consists of a
!      'parallel' expression with a variable number of elements.  This
       expression should only appear at the top level of an insn pattern.
  
       When constructing an insn, operand number N will be substituted at
       this point.  When matching an insn, it matches if the body of the
!      insn is a 'parallel' expression with at least as many elements as
!      the vector of SUBPAT expressions in the 'match_parallel', if each
!      SUBPAT matches the corresponding element of the 'parallel', _and_
!      the function PREDICATE returns nonzero on the 'parallel' that is
!      the body of the insn.  It is the responsibility of the predicate to
!      validate elements of the 'parallel' beyond those listed in the
!      'match_parallel'.
  
!      A typical use of 'match_parallel' is to match load and store
       multiple expressions, which can contain a variable number of
!      elements in a 'parallel'.  For example,
  
            (define_insn ""
              [(match_parallel 0 "load_multiple_operation"
*************** substitution of the operands.
*** 19063,19071 ****
              ""
              "loadm 0,0,%1,%2")
  
!      This example comes from `a29k.md'.  The function
!      `load_multiple_operation' is defined in `a29k.c' and checks that
!      subsequent elements in the `parallel' are the same as the `set' in
       the pattern, except that they are referencing subsequent registers
       and memory locations.
  
--- 18852,18860 ----
              ""
              "loadm 0,0,%1,%2")
  
!      This example comes from 'a29k.md'.  The function
!      'load_multiple_operation' is defined in 'a29k.c' and checks that
!      subsequent elements in the 'parallel' are the same as the 'set' in
       the pattern, except that they are referencing subsequent registers
       and memory locations.
  
*************** substitution of the operands.
*** 19082,19091 ****
                   (mem:SI (plus:SI (reg:SI 100)
                                    (const_int 8))))])
  
! `(match_par_dup N [SUBPAT...])'
!      Like `match_op_dup', but for `match_parallel' instead of
!      `match_operator'.
! 
  
  
  File: gccint.info,  Node: Output Template,  Next: Output Statement,  Prev: RTL Template,  Up: Machine Desc
--- 18871,18879 ----
                   (mem:SI (plus:SI (reg:SI 100)
                                    (const_int 8))))])
  
! '(match_par_dup N [SUBPAT...])'
!      Like 'match_op_dup', but for 'match_parallel' instead of
!      'match_operator'.
  
  
  File: gccint.info,  Node: Output Template,  Next: Output Statement,  Prev: RTL Template,  Up: Machine Desc
*************** File: gccint.info,  Node: Output Templat
*** 19095,19169 ****
  
  The "output template" is a string which specifies how to output the
  assembler code for an instruction pattern.  Most of the template is a
! fixed string which is output literally.  The character `%' is used to
  specify where to substitute an operand; it can also be used to identify
  places where different variants of the assembler require different
  syntax.
  
!  In the simplest case, a `%' followed by a digit N says to output
  operand N at that point in the string.
  
!  `%' followed by a letter and a digit says to output an operand in an
  alternate fashion.  Four letters have standard, built-in meanings
! described below.  The machine description macro `PRINT_OPERAND' can
  define additional letters with nonstandard meanings.
  
!  `%cDIGIT' can be used to substitute an operand that is a constant
! value without the syntax that normally indicates an immediate operand.
  
!  `%nDIGIT' is like `%cDIGIT' except that the value of the constant is
  negated before printing.
  
!  `%aDIGIT' can be used to substitute an operand as if it were a memory
  reference, with the actual operand treated as the address.  This may be
  useful when outputting a "load address" instruction, because often the
  assembler syntax for such an instruction requires you to write the
  operand as if it were a memory reference.
  
!  `%lDIGIT' is used to substitute a `label_ref' into a jump instruction.
  
!  `%=' outputs a number which is unique to each instruction in the
! entire compilation.  This is useful for making local labels to be
! referred to more than once in a single template that generates multiple
! assembler instructions.
  
!  `%' followed by a punctuation character specifies a substitution that
! does not use an operand.  Only one case is standard: `%%' outputs a `%'
  into the assembler code.  Other nonstandard cases can be defined in the
! `PRINT_OPERAND' macro.  You must also define which punctuation
! characters are valid with the `PRINT_OPERAND_PUNCT_VALID_P' macro.
  
   The template may generate multiple assembler instructions.  Write the
! text for the instructions, with `\;' between them.
  
   When the RTL contains two operands which are required by constraint to
  match each other, the output template must refer only to the
! lower-numbered operand.  Matching operands are not always identical,
! and the rest of the compiler arranges to put the proper RTL expression
! for printing into the lower-numbered operand.
  
!  One use of nonstandard letters or punctuation following `%' is to
  distinguish between different assembler languages for the same machine;
  for example, Motorola syntax versus MIT syntax for the 68000.  Motorola
! syntax requires periods in most opcode names, while MIT syntax does
! not.  For example, the opcode `movel' in MIT syntax is `move.l' in
! Motorola syntax.  The same file of patterns is used for both kinds of
! output syntax, but the character sequence `%.' is used in each place
! where Motorola syntax wants a period.  The `PRINT_OPERAND' macro for
! Motorola syntax defines the sequence to output a period; the macro for
! MIT syntax defines it to do nothing.
  
!  As a special case, a template consisting of the single character `#'
  instructs the compiler to first split the insn, and then output the
  resulting instructions separately.  This helps eliminate redundancy in
! the output templates.   If you have a `define_insn' that needs to emit
! multiple assembler instructions, and there is a matching `define_split'
! already defined, then you can simply use `#' as the output template
  instead of writing an output template that emits the multiple assembler
  instructions.
  
!  If the macro `ASSEMBLER_DIALECT' is defined, you can use construct of
! the form `{option0|option1|option2}' in the templates.  These describe
  multiple variants of assembler language syntax.  *Note Instruction
  Output::.
  
--- 18883,18957 ----
  
  The "output template" is a string which specifies how to output the
  assembler code for an instruction pattern.  Most of the template is a
! fixed string which is output literally.  The character '%' is used to
  specify where to substitute an operand; it can also be used to identify
  places where different variants of the assembler require different
  syntax.
  
!  In the simplest case, a '%' followed by a digit N says to output
  operand N at that point in the string.
  
!  '%' followed by a letter and a digit says to output an operand in an
  alternate fashion.  Four letters have standard, built-in meanings
! described below.  The machine description macro 'PRINT_OPERAND' can
  define additional letters with nonstandard meanings.
  
!  '%cDIGIT' can be used to substitute an operand that is a constant value
! without the syntax that normally indicates an immediate operand.
  
!  '%nDIGIT' is like '%cDIGIT' except that the value of the constant is
  negated before printing.
  
!  '%aDIGIT' can be used to substitute an operand as if it were a memory
  reference, with the actual operand treated as the address.  This may be
  useful when outputting a "load address" instruction, because often the
  assembler syntax for such an instruction requires you to write the
  operand as if it were a memory reference.
  
!  '%lDIGIT' is used to substitute a 'label_ref' into a jump instruction.
  
!  '%=' outputs a number which is unique to each instruction in the entire
! compilation.  This is useful for making local labels to be referred to
! more than once in a single template that generates multiple assembler
! instructions.
  
!  '%' followed by a punctuation character specifies a substitution that
! does not use an operand.  Only one case is standard: '%%' outputs a '%'
  into the assembler code.  Other nonstandard cases can be defined in the
! 'PRINT_OPERAND' macro.  You must also define which punctuation
! characters are valid with the 'PRINT_OPERAND_PUNCT_VALID_P' macro.
  
   The template may generate multiple assembler instructions.  Write the
! text for the instructions, with '\;' between them.
  
   When the RTL contains two operands which are required by constraint to
  match each other, the output template must refer only to the
! lower-numbered operand.  Matching operands are not always identical, and
! the rest of the compiler arranges to put the proper RTL expression for
! printing into the lower-numbered operand.
  
!  One use of nonstandard letters or punctuation following '%' is to
  distinguish between different assembler languages for the same machine;
  for example, Motorola syntax versus MIT syntax for the 68000.  Motorola
! syntax requires periods in most opcode names, while MIT syntax does not.
! For example, the opcode 'movel' in MIT syntax is 'move.l' in Motorola
! syntax.  The same file of patterns is used for both kinds of output
! syntax, but the character sequence '%.' is used in each place where
! Motorola syntax wants a period.  The 'PRINT_OPERAND' macro for Motorola
! syntax defines the sequence to output a period; the macro for MIT syntax
! defines it to do nothing.
  
!  As a special case, a template consisting of the single character '#'
  instructs the compiler to first split the insn, and then output the
  resulting instructions separately.  This helps eliminate redundancy in
! the output templates.  If you have a 'define_insn' that needs to emit
! multiple assembler instructions, and there is a matching 'define_split'
! already defined, then you can simply use '#' as the output template
  instead of writing an output template that emits the multiple assembler
  instructions.
  
!  If the macro 'ASSEMBLER_DIALECT' is defined, you can use construct of
! the form '{option0|option1|option2}' in the templates.  These describe
  multiple variants of assembler language syntax.  *Note Instruction
  Output::.
  
*************** single instruction pattern.  For example
*** 19179,19191 ****
  kinds of operands; or some unfortunate combinations of operands may
  require extra machine instructions.
  
!  If the output control string starts with a `@', then it is actually a
  series of templates, each on a separate line.  (Blank lines and leading
! spaces and tabs are ignored.)  The templates correspond to the
! pattern's constraint alternatives (*note Multi-Alternative::).  For
! example, if a target machine has a two-address add instruction `addr'
! to add into a register and another `addm' to add a register to memory,
! you might write this pattern:
  
       (define_insn "addsi3"
         [(set (match_operand:SI 0 "general_operand" "=r,m")
--- 18967,18979 ----
  kinds of operands; or some unfortunate combinations of operands may
  require extra machine instructions.
  
!  If the output control string starts with a '@', then it is actually a
  series of templates, each on a separate line.  (Blank lines and leading
! spaces and tabs are ignored.)  The templates correspond to the pattern's
! constraint alternatives (*note Multi-Alternative::).  For example, if a
! target machine has a two-address add instruction 'addr' to add into a
! register and another 'addm' to add a register to memory, you might write
! this pattern:
  
       (define_insn "addsi3"
         [(set (match_operand:SI 0 "general_operand" "=r,m")
*************** you might write this pattern:
*** 19196,19241 ****
          addr %2,%0
          addm %2,%0")
  
!  If the output control string starts with a `*', then it is not an
  output template but rather a piece of C program that should compute a
! template.  It should execute a `return' statement to return the
  template-string you want.  Most such templates use C string literals,
  which require doublequote characters to delimit them.  To include these
! doublequote characters in the string, prefix each one with `\'.
  
   If the output control string is written as a brace block instead of a
  double-quoted string, it is automatically assumed to be C code.  In that
  case, it is not necessary to put in a leading asterisk, or to escape the
  doublequotes surrounding C string literals.
  
!  The operands may be found in the array `operands', whose C data type
! is `rtx []'.
  
   It is very common to select different ways of generating assembler code
  based on whether an immediate operand is within a certain range.  Be
! careful when doing this, because the result of `INTVAL' is an integer
! on the host machine.  If the host machine has more bits in an `int'
! than the target machine has in the mode in which the constant will be
! used, then some of the bits you get from `INTVAL' will be superfluous.
! For proper results, you must carefully disregard the values of those
! bits.
  
   It is possible to output an assembler instruction and then go on to
! output or compute more of them, using the subroutine `output_asm_insn'.
! This receives two arguments: a template-string and a vector of
! operands.  The vector may be `operands', or it may be another array of
! `rtx' that you declare locally and initialize yourself.
  
   When an insn pattern has multiple alternatives in its constraints,
! often the appearance of the assembler code is determined mostly by
! which alternative was matched.  When this is so, the C code can test
! the variable `which_alternative', which is the ordinal number of the
  alternative that was actually satisfied (0 for the first, 1 for the
  second alternative, etc.).
  
!  For example, suppose there are two opcodes for storing zero, `clrreg'
! for registers and `clrmem' for memory locations.  Here is how a pattern
! could use `which_alternative' to choose between them:
  
       (define_insn ""
         [(set (match_operand:SI 0 "general_operand" "=r,m")
--- 18984,19028 ----
          addr %2,%0
          addm %2,%0")
  
!  If the output control string starts with a '*', then it is not an
  output template but rather a piece of C program that should compute a
! template.  It should execute a 'return' statement to return the
  template-string you want.  Most such templates use C string literals,
  which require doublequote characters to delimit them.  To include these
! doublequote characters in the string, prefix each one with '\'.
  
   If the output control string is written as a brace block instead of a
  double-quoted string, it is automatically assumed to be C code.  In that
  case, it is not necessary to put in a leading asterisk, or to escape the
  doublequotes surrounding C string literals.
  
!  The operands may be found in the array 'operands', whose C data type is
! 'rtx []'.
  
   It is very common to select different ways of generating assembler code
  based on whether an immediate operand is within a certain range.  Be
! careful when doing this, because the result of 'INTVAL' is an integer on
! the host machine.  If the host machine has more bits in an 'int' than
! the target machine has in the mode in which the constant will be used,
! then some of the bits you get from 'INTVAL' will be superfluous.  For
! proper results, you must carefully disregard the values of those bits.
  
   It is possible to output an assembler instruction and then go on to
! output or compute more of them, using the subroutine 'output_asm_insn'.
! This receives two arguments: a template-string and a vector of operands.
! The vector may be 'operands', or it may be another array of 'rtx' that
! you declare locally and initialize yourself.
  
   When an insn pattern has multiple alternatives in its constraints,
! often the appearance of the assembler code is determined mostly by which
! alternative was matched.  When this is so, the C code can test the
! variable 'which_alternative', which is the ordinal number of the
  alternative that was actually satisfied (0 for the first, 1 for the
  second alternative, etc.).
  
!  For example, suppose there are two opcodes for storing zero, 'clrreg'
! for registers and 'clrmem' for memory locations.  Here is how a pattern
! could use 'which_alternative' to choose between them:
  
       (define_insn ""
         [(set (match_operand:SI 0 "general_operand" "=r,m")
*************** could use `which_alternative' to choose
*** 19248,19254 ****
  
   The example above, where the assembler code to generate was _solely_
  determined by the alternative, could also have been specified as
! follows, having the output control string start with a `@':
  
       (define_insn ""
         [(set (match_operand:SI 0 "general_operand" "=r,m")
--- 19035,19041 ----
  
   The example above, where the assembler code to generate was _solely_
  determined by the alternative, could also have been specified as
! follows, having the output control string start with a '@':
  
       (define_insn ""
         [(set (match_operand:SI 0 "general_operand" "=r,m")
*************** follows, having the output control strin
*** 19259,19265 ****
          clrmem %0")
  
   If you just need a little bit of C code in one (or a few) alternatives,
! you can use `*' inside of a `@' multi-alternative template:
  
       (define_insn ""
         [(set (match_operand:SI 0 "general_operand" "=r,<,m")
--- 19046,19052 ----
          clrmem %0")
  
   If you just need a little bit of C code in one (or a few) alternatives,
! you can use '*' inside of a '@' multi-alternative template:
  
       (define_insn ""
         [(set (match_operand:SI 0 "general_operand" "=r,<,m")
*************** File: gccint.info,  Node: Predicates,  N
*** 19276,19293 ****
  16.7 Predicates
  ===============
  
! A predicate determines whether a `match_operand' or `match_operator'
  expression matches, and therefore whether the surrounding instruction
! pattern will be used for that combination of operands.  GCC has a
! number of machine-independent predicates, and you can define
! machine-specific predicates as needed.  By convention, predicates used
! with `match_operand' have names that end in `_operand', and those used
! with `match_operator' have names that end in `_operator'.
  
!  All predicates are Boolean functions (in the mathematical sense) of
! two arguments: the RTL expression that is being considered at that
! position in the instruction pattern, and the machine mode that the
! `match_operand' or `match_operator' specifies.  In this section, the
  first argument is called OP and the second argument MODE.  Predicates
  can be called from C as ordinary two-argument functions; this can be
  useful in output templates or other machine-specific code.
--- 19063,19080 ----
  16.7 Predicates
  ===============
  
! A predicate determines whether a 'match_operand' or 'match_operator'
  expression matches, and therefore whether the surrounding instruction
! pattern will be used for that combination of operands.  GCC has a number
! of machine-independent predicates, and you can define machine-specific
! predicates as needed.  By convention, predicates used with
! 'match_operand' have names that end in '_operand', and those used with
! 'match_operator' have names that end in '_operator'.
  
!  All predicates are Boolean functions (in the mathematical sense) of two
! arguments: the RTL expression that is being considered at that position
! in the instruction pattern, and the machine mode that the
! 'match_operand' or 'match_operator' specifies.  In this section, the
  first argument is called OP and the second argument MODE.  Predicates
  can be called from C as ordinary two-argument functions; this can be
  useful in output templates or other machine-specific code.
*************** useful in output templates or other mach
*** 19296,19325 ****
  to the hardware, as long as the constraints give reload the ability to
  fix them up (*note Constraints::).  However, GCC will usually generate
  better code if the predicates specify the requirements of the machine
! instructions as closely as possible.  Reload cannot fix up operands
! that must be constants ("immediate operands"); you must use a predicate
! that allows only constants, or else enforce the requirement in the
! extra condition.
  
   Most predicates handle their MODE argument in a uniform manner.  If
! MODE is `VOIDmode' (unspecified), then OP can have any mode.  If MODE
! is anything else, then OP must have the same mode, unless OP is a
! `CONST_INT' or integer `CONST_DOUBLE'.  These RTL expressions always
! have `VOIDmode', so it would be counterproductive to check that their
! mode matches.  Instead, predicates that accept `CONST_INT' and/or
! integer `CONST_DOUBLE' check that the value stored in the constant will
  fit in the requested mode.
  
!  Predicates with this behavior are called "normal".  `genrecog' can
  optimize the instruction recognizer based on knowledge of how normal
  predicates treat modes.  It can also diagnose certain kinds of common
  errors in the use of normal predicates; for instance, it is almost
  always an error to use a normal predicate without specifying a mode.
  
   Predicates that do something different with their MODE argument are
! called "special".  The generic predicates `address_operand' and
! `pmode_register_operand' are special predicates.  `genrecog' does not
! do any optimizations or diagnosis when special predicates are used.
  
  * Menu:
  
--- 19083,19112 ----
  to the hardware, as long as the constraints give reload the ability to
  fix them up (*note Constraints::).  However, GCC will usually generate
  better code if the predicates specify the requirements of the machine
! instructions as closely as possible.  Reload cannot fix up operands that
! must be constants ("immediate operands"); you must use a predicate that
! allows only constants, or else enforce the requirement in the extra
! condition.
  
   Most predicates handle their MODE argument in a uniform manner.  If
! MODE is 'VOIDmode' (unspecified), then OP can have any mode.  If MODE is
! anything else, then OP must have the same mode, unless OP is a
! 'CONST_INT' or integer 'CONST_DOUBLE'.  These RTL expressions always
! have 'VOIDmode', so it would be counterproductive to check that their
! mode matches.  Instead, predicates that accept 'CONST_INT' and/or
! integer 'CONST_DOUBLE' check that the value stored in the constant will
  fit in the requested mode.
  
!  Predicates with this behavior are called "normal".  'genrecog' can
  optimize the instruction recognizer based on knowledge of how normal
  predicates treat modes.  It can also diagnose certain kinds of common
  errors in the use of normal predicates; for instance, it is almost
  always an error to use a normal predicate without specifying a mode.
  
   Predicates that do something different with their MODE argument are
! called "special".  The generic predicates 'address_operand' and
! 'pmode_register_operand' are special predicates.  'genrecog' does not do
! any optimizations or diagnosis when special predicates are used.
  
  * Menu:
  
*************** File: gccint.info,  Node: Machine-Indepe
*** 19334,19340 ****
  -------------------------------------
  
  These are the generic predicates available to all back ends.  They are
! defined in `recog.c'.  The first category of predicates allow only
  constant, or "immediate", operands.
  
   -- Function: immediate_operand
--- 19121,19127 ----
  -------------------------------------
  
  These are the generic predicates available to all back ends.  They are
! defined in 'recog.c'.  The first category of predicates allow only
  constant, or "immediate", operands.
  
   -- Function: immediate_operand
*************** constant, or "immediate", operands.
*** 19343,19369 ****
       must be constant.
  
   -- Function: const_int_operand
!      This predicate allows any `CONST_INT' expression that fits in
!      MODE.  It is an appropriate choice for an immediate operand that
!      does not allow a symbol or label.
  
   -- Function: const_double_operand
!      This predicate accepts any `CONST_DOUBLE' expression that has
!      exactly MODE.  If MODE is `VOIDmode', it will also accept
!      `CONST_INT'.  It is intended for immediate floating point
       constants.
  
  The second category of predicates allow only some kind of machine
  register.
  
   -- Function: register_operand
!      This predicate allows any `REG' or `SUBREG' expression that is
       valid for MODE.  It is often suitable for arithmetic instruction
       operands on a RISC machine.
  
   -- Function: pmode_register_operand
!      This is a slight variant on `register_operand' which works around
!      a limitation in the machine-description reader.
  
            (match_operand N "pmode_register_operand" CONSTRAINT)
  
--- 19130,19156 ----
       must be constant.
  
   -- Function: const_int_operand
!      This predicate allows any 'CONST_INT' expression that fits in MODE.
!      It is an appropriate choice for an immediate operand that does not
!      allow a symbol or label.
  
   -- Function: const_double_operand
!      This predicate accepts any 'CONST_DOUBLE' expression that has
!      exactly MODE.  If MODE is 'VOIDmode', it will also accept
!      'CONST_INT'.  It is intended for immediate floating point
       constants.
  
  The second category of predicates allow only some kind of machine
  register.
  
   -- Function: register_operand
!      This predicate allows any 'REG' or 'SUBREG' expression that is
       valid for MODE.  It is often suitable for arithmetic instruction
       operands on a RISC machine.
  
   -- Function: pmode_register_operand
!      This is a slight variant on 'register_operand' which works around a
!      limitation in the machine-description reader.
  
            (match_operand N "pmode_register_operand" CONSTRAINT)
  
*************** register.
*** 19371,19385 ****
  
            (match_operand:P N "register_operand" CONSTRAINT)
  
!      would mean, if the machine-description reader accepted `:P' mode
!      suffixes.  Unfortunately, it cannot, because `Pmode' is an alias
       for some other mode, and might vary with machine-specific options.
       *Note Misc::.
  
   -- Function: scratch_operand
!      This predicate allows hard registers and `SCRATCH' expressions,
!      but not pseudo-registers.  It is used internally by
!      `match_scratch'; it should not be used directly.
  
  The third category of predicates allow only some kind of memory
  reference.
--- 19158,19172 ----
  
            (match_operand:P N "register_operand" CONSTRAINT)
  
!      would mean, if the machine-description reader accepted ':P' mode
!      suffixes.  Unfortunately, it cannot, because 'Pmode' is an alias
       for some other mode, and might vary with machine-specific options.
       *Note Misc::.
  
   -- Function: scratch_operand
!      This predicate allows hard registers and 'SCRATCH' expressions, but
!      not pseudo-registers.  It is used internally by 'match_scratch'; it
!      should not be used directly.
  
  The third category of predicates allow only some kind of memory
  reference.
*************** reference.
*** 19387,19424 ****
   -- Function: memory_operand
       This predicate allows any valid reference to a quantity of mode
       MODE in memory, as determined by the weak form of
!      `GO_IF_LEGITIMATE_ADDRESS' (*note Addressing Modes::).
  
   -- Function: address_operand
       This predicate is a little unusual; it allows any operand that is a
       valid expression for the _address_ of a quantity of mode MODE,
!      again determined by the weak form of `GO_IF_LEGITIMATE_ADDRESS'.
!      To first order, if `(mem:MODE (EXP))' is acceptable to
!      `memory_operand', then EXP is acceptable to `address_operand'.
       Note that EXP does not necessarily have the mode MODE.
  
   -- Function: indirect_operand
!      This is a stricter form of `memory_operand' which allows only
!      memory references with a `general_operand' as the address
       expression.  New uses of this predicate are discouraged, because
!      `general_operand' is very permissive, so it's hard to tell what an
!      `indirect_operand' does or does not allow.  If a target has
       different requirements for memory operands for different
       instructions, it is better to define target-specific predicates
       which enforce the hardware's requirements explicitly.
  
   -- Function: push_operand
       This predicate allows a memory reference suitable for pushing a
!      value onto the stack.  This will be a `MEM' which refers to
!      `stack_pointer_rtx', with a side-effect in its address expression
!      (*note Incdec::); which one is determined by the `STACK_PUSH_CODE'
       macro (*note Frame Layout::).
  
   -- Function: pop_operand
       This predicate allows a memory reference suitable for popping a
!      value off the stack.  Again, this will be a `MEM' referring to
!      `stack_pointer_rtx', with a side-effect in its address expression.
!      However, this time `STACK_POP_CODE' is expected.
  
  The fourth category of predicates allow some combination of the above
  operands.
--- 19174,19211 ----
   -- Function: memory_operand
       This predicate allows any valid reference to a quantity of mode
       MODE in memory, as determined by the weak form of
!      'GO_IF_LEGITIMATE_ADDRESS' (*note Addressing Modes::).
  
   -- Function: address_operand
       This predicate is a little unusual; it allows any operand that is a
       valid expression for the _address_ of a quantity of mode MODE,
!      again determined by the weak form of 'GO_IF_LEGITIMATE_ADDRESS'.
!      To first order, if '(mem:MODE (EXP))' is acceptable to
!      'memory_operand', then EXP is acceptable to 'address_operand'.
       Note that EXP does not necessarily have the mode MODE.
  
   -- Function: indirect_operand
!      This is a stricter form of 'memory_operand' which allows only
!      memory references with a 'general_operand' as the address
       expression.  New uses of this predicate are discouraged, because
!      'general_operand' is very permissive, so it's hard to tell what an
!      'indirect_operand' does or does not allow.  If a target has
       different requirements for memory operands for different
       instructions, it is better to define target-specific predicates
       which enforce the hardware's requirements explicitly.
  
   -- Function: push_operand
       This predicate allows a memory reference suitable for pushing a
!      value onto the stack.  This will be a 'MEM' which refers to
!      'stack_pointer_rtx', with a side-effect in its address expression
!      (*note Incdec::); which one is determined by the 'STACK_PUSH_CODE'
       macro (*note Frame Layout::).
  
   -- Function: pop_operand
       This predicate allows a memory reference suitable for popping a
!      value off the stack.  Again, this will be a 'MEM' referring to
!      'stack_pointer_rtx', with a side-effect in its address expression.
!      However, this time 'STACK_POP_CODE' is expected.
  
  The fourth category of predicates allow some combination of the above
  operands.
*************** Finally, there are two generic operator
*** 19439,19452 ****
  
   -- Function: comparison_operator
       This predicate matches any expression which performs an arithmetic
!      comparison in MODE; that is, `COMPARISON_P' is true for the
       expression code.
  
   -- Function: ordered_comparison_operator
       This predicate matches any expression which performs an arithmetic
       comparison in MODE and whose expression code is valid for integer
!      modes; that is, the expression code will be one of `eq', `ne',
!      `lt', `ltu', `le', `leu', `gt', `gtu', `ge', `geu'.
  
  
  File: gccint.info,  Node: Defining Predicates,  Prev: Machine-Independent Predicates,  Up: Predicates
--- 19226,19239 ----
  
   -- Function: comparison_operator
       This predicate matches any expression which performs an arithmetic
!      comparison in MODE; that is, 'COMPARISON_P' is true for the
       expression code.
  
   -- Function: ordered_comparison_operator
       This predicate matches any expression which performs an arithmetic
       comparison in MODE and whose expression code is valid for integer
!      modes; that is, the expression code will be one of 'eq', 'ne',
!      'lt', 'ltu', 'le', 'leu', 'gt', 'gtu', 'ge', 'geu'.
  
  
  File: gccint.info,  Node: Defining Predicates,  Prev: Machine-Independent Predicates,  Up: Predicates
*************** File: gccint.info,  Node: Defining Predi
*** 19456,19488 ****
  
  Many machines have requirements for their operands that cannot be
  expressed precisely using the generic predicates.  You can define
! additional predicates using `define_predicate' and
! `define_special_predicate' expressions.  These expressions have three
  operands:
  
     * The name of the predicate, as it will be referred to in
!      `match_operand' or `match_operator' expressions.
  
     * An RTL expression which evaluates to true if the predicate allows
       the operand OP, false if it does not.  This expression can only use
       the following RTL codes:
  
!     `MATCH_OPERAND'
!           When written inside a predicate expression, a `MATCH_OPERAND'
            expression evaluates to true if the predicate it names would
!           allow OP.  The operand number and constraint are ignored.
!           Due to limitations in `genrecog', you can only refer to
!           generic predicates and predicates that have already been
!           defined.
  
!     `MATCH_CODE'
            This expression evaluates to true if OP or a specified
            subexpression of OP has one of a given list of RTX codes.
  
            The first operand of this expression is a string constant
            containing a comma-separated list of RTX code names (in lower
!           case).  These are the codes for which the `MATCH_CODE' will
!           be true.
  
            The second operand is a string constant which indicates what
            subexpression of OP to examine.  If it is absent or the empty
--- 19243,19274 ----
  
  Many machines have requirements for their operands that cannot be
  expressed precisely using the generic predicates.  You can define
! additional predicates using 'define_predicate' and
! 'define_special_predicate' expressions.  These expressions have three
  operands:
  
     * The name of the predicate, as it will be referred to in
!      'match_operand' or 'match_operator' expressions.
  
     * An RTL expression which evaluates to true if the predicate allows
       the operand OP, false if it does not.  This expression can only use
       the following RTL codes:
  
!      'MATCH_OPERAND'
!           When written inside a predicate expression, a 'MATCH_OPERAND'
            expression evaluates to true if the predicate it names would
!           allow OP.  The operand number and constraint are ignored.  Due
!           to limitations in 'genrecog', you can only refer to generic
!           predicates and predicates that have already been defined.
  
!      'MATCH_CODE'
            This expression evaluates to true if OP or a specified
            subexpression of OP has one of a given list of RTX codes.
  
            The first operand of this expression is a string constant
            containing a comma-separated list of RTX code names (in lower
!           case).  These are the codes for which the 'MATCH_CODE' will be
!           true.
  
            The second operand is a string constant which indicates what
            subexpression of OP to examine.  If it is absent or the empty
*************** operands:
*** 19491,19543 ****
            character indicates a subexpression to extract from the
            current expression; for the first character this is OP, for
            the second and subsequent characters it is the result of the
!           previous character.  A digit N extracts `XEXP (E, N)'; a
!           letter L extracts `XVECEXP (E, 0, N)' where N is the
!           alphabetic ordinal of L (0 for `a', 1 for 'b', and so on).
!           The `MATCH_CODE' then examines the RTX code of the
            subexpression extracted by the complete string.  It is not
!           possible to extract components of an `rtvec' that is not at
            position 0 within its RTX object.
  
!     `MATCH_TEST'
            This expression has one operand, a string constant containing
            a C expression.  The predicate's arguments, OP and MODE, are
            available with those names in the C expression.  The
!           `MATCH_TEST' evaluates to true if the C expression evaluates
!           to a nonzero value.  `MATCH_TEST' expressions must not have
            side effects.
  
!     `AND'
!     `IOR'
!     `NOT'
!     `IF_THEN_ELSE'
!           The basic `MATCH_' expressions can be combined using these
            logical operators, which have the semantics of the C operators
!           `&&', `||', `!', and `? :' respectively.  As in Common Lisp,
!           you may give an `AND' or `IOR' expression an arbitrary number
            of arguments; this has exactly the same effect as writing a
!           chain of two-argument `AND' or `IOR' expressions.
  
!    * An optional block of C code, which should execute `return true' if
!      the predicate is found to match and `return false' if it does not.
!      It must not have any side effects.  The predicate arguments, OP
!      and MODE, are available with those names.
  
       If a code block is present in a predicate definition, then the RTL
       expression must evaluate to true _and_ the code block must execute
!      `return true' for the predicate to allow the operand.  The RTL
!      expression is evaluated first; do not re-check anything in the
!      code block that was checked in the RTL expression.
  
!  The program `genrecog' scans `define_predicate' and
! `define_special_predicate' expressions to determine which RTX codes are
  possibly allowed.  You should always make this explicit in the RTL
! predicate expression, using `MATCH_OPERAND' and `MATCH_CODE'.
  
   Here is an example of a simple predicate definition, from the IA64
  machine description:
  
!      ;; True if OP is a `SYMBOL_REF' which refers to the sdata section.
       (define_predicate "small_addr_symbolic_operand"
         (and (match_code "symbol_ref")
              (match_test "SYMBOL_REF_SMALL_ADDR_P (op)")))
--- 19277,19329 ----
            character indicates a subexpression to extract from the
            current expression; for the first character this is OP, for
            the second and subsequent characters it is the result of the
!           previous character.  A digit N extracts 'XEXP (E, N)'; a
!           letter L extracts 'XVECEXP (E, 0, N)' where N is the
!           alphabetic ordinal of L (0 for 'a', 1 for 'b', and so on).
!           The 'MATCH_CODE' then examines the RTX code of the
            subexpression extracted by the complete string.  It is not
!           possible to extract components of an 'rtvec' that is not at
            position 0 within its RTX object.
  
!      'MATCH_TEST'
            This expression has one operand, a string constant containing
            a C expression.  The predicate's arguments, OP and MODE, are
            available with those names in the C expression.  The
!           'MATCH_TEST' evaluates to true if the C expression evaluates
!           to a nonzero value.  'MATCH_TEST' expressions must not have
            side effects.
  
!      'AND'
!      'IOR'
!      'NOT'
!      'IF_THEN_ELSE'
!           The basic 'MATCH_' expressions can be combined using these
            logical operators, which have the semantics of the C operators
!           '&&', '||', '!', and '? :' respectively.  As in Common Lisp,
!           you may give an 'AND' or 'IOR' expression an arbitrary number
            of arguments; this has exactly the same effect as writing a
!           chain of two-argument 'AND' or 'IOR' expressions.
  
!    * An optional block of C code, which should execute 'return true' if
!      the predicate is found to match and 'return false' if it does not.
!      It must not have any side effects.  The predicate arguments, OP and
!      MODE, are available with those names.
  
       If a code block is present in a predicate definition, then the RTL
       expression must evaluate to true _and_ the code block must execute
!      'return true' for the predicate to allow the operand.  The RTL
!      expression is evaluated first; do not re-check anything in the code
!      block that was checked in the RTL expression.
  
!  The program 'genrecog' scans 'define_predicate' and
! 'define_special_predicate' expressions to determine which RTX codes are
  possibly allowed.  You should always make this explicit in the RTL
! predicate expression, using 'MATCH_OPERAND' and 'MATCH_CODE'.
  
   Here is an example of a simple predicate definition, from the IA64
  machine description:
  
!      ;; True if OP is a 'SYMBOL_REF' which refers to the sdata section.
       (define_predicate "small_addr_symbolic_operand"
         (and (match_code "symbol_ref")
              (match_test "SYMBOL_REF_SMALL_ADDR_P (op)")))
*************** And here is another, showing the use of
*** 19556,19580 ****
         return (regno >= FIRST_PSEUDO_REGISTER || GENERAL_REGNO_P (regno));
       })
  
!  Predicates written with `define_predicate' automatically include a
! test that MODE is `VOIDmode', or OP has the same mode as MODE, or OP is
! a `CONST_INT' or `CONST_DOUBLE'.  They do _not_ check specifically for
! integer `CONST_DOUBLE', nor do they test that the value of either kind
! of constant fits in the requested mode.  This is because
! target-specific predicates that take constants usually have to do more
! stringent value checks anyway.  If you need the exact same treatment of
! `CONST_INT' or `CONST_DOUBLE' that the generic predicates provide, use
! a `MATCH_OPERAND' subexpression to call `const_int_operand',
! `const_double_operand', or `immediate_operand'.
  
!  Predicates written with `define_special_predicate' do not get any
  automatic mode checks, and are treated as having special mode handling
! by `genrecog'.
  
!  The program `genpreds' is responsible for generating code to test
  predicates.  It also writes a header file containing function
  declarations for all machine-specific predicates.  It is not necessary
! to declare these predicates in `CPU-protos.h'.
  
  
  File: gccint.info,  Node: Constraints,  Next: Standard Names,  Prev: Predicates,  Up: Machine Desc
--- 19342,19366 ----
         return (regno >= FIRST_PSEUDO_REGISTER || GENERAL_REGNO_P (regno));
       })
  
!  Predicates written with 'define_predicate' automatically include a test
! that MODE is 'VOIDmode', or OP has the same mode as MODE, or OP is a
! 'CONST_INT' or 'CONST_DOUBLE'.  They do _not_ check specifically for
! integer 'CONST_DOUBLE', nor do they test that the value of either kind
! of constant fits in the requested mode.  This is because target-specific
! predicates that take constants usually have to do more stringent value
! checks anyway.  If you need the exact same treatment of 'CONST_INT' or
! 'CONST_DOUBLE' that the generic predicates provide, use a
! 'MATCH_OPERAND' subexpression to call 'const_int_operand',
! 'const_double_operand', or 'immediate_operand'.
  
!  Predicates written with 'define_special_predicate' do not get any
  automatic mode checks, and are treated as having special mode handling
! by 'genrecog'.
  
!  The program 'genpreds' is responsible for generating code to test
  predicates.  It also writes a header file containing function
  declarations for all machine-specific predicates.  It is not necessary
! to declare these predicates in 'CPU-protos.h'.
  
  
  File: gccint.info,  Node: Constraints,  Next: Standard Names,  Prev: Predicates,  Up: Machine Desc
*************** File: gccint.info,  Node: Constraints,
*** 19582,19588 ****
  16.8 Operand Constraints
  ========================
  
! Each `match_operand' in an instruction pattern can specify constraints
  for the operands allowed.  The constraints allow you to fine-tune
  matching within the set of operands allowed by the predicate.
  
--- 19368,19374 ----
  16.8 Operand Constraints
  ========================
  
! Each 'match_operand' in an instruction pattern can specify constraints
  for the operands allowed.  The constraints allow you to fine-tune
  matching within the set of operands allowed by the predicate.
  
*************** kinds of register; whether the operand c
*** 19591,19597 ****
  which kinds of address; whether the operand may be an immediate
  constant, and which possible values it may have.  Constraints can also
  require two operands to match.  Side-effects aren't allowed in operands
! of inline `asm', unless `<' or `>' constraints are used, because there
  is no guarantee that the side-effects will happen exactly once in an
  instruction that can update the addressing register.
  
--- 19377,19383 ----
  which kinds of address; whether the operand may be an immediate
  constant, and which possible values it may have.  Constraints can also
  require two operands to match.  Side-effects aren't allowed in operands
! of inline 'asm', unless '<' or '>' constraints are used, because there
  is no guarantee that the side-effects will happen exactly once in an
  instruction that can update the addressing register.
  
*************** whitespace
*** 19623,19635 ****
       description even if they have different number of constraints and
       modifiers.
  
! `m'
       A memory operand is allowed, with any kind of address that the
       machine supports in general.  Note that the letter used for the
!      general memory constraint can be re-defined by a back end using
!      the `TARGET_MEM_CONSTRAINT' macro.
  
! `o'
       A memory operand is allowed, but only if the address is
       "offsettable".  This means that adding a small integer (actually,
       the width in bytes of the operand, as determined by its machine
--- 19409,19421 ----
       description even if they have different number of constraints and
       modifiers.
  
! 'm'
       A memory operand is allowed, with any kind of address that the
       machine supports in general.  Note that the letter used for the
!      general memory constraint can be re-defined by a back end using the
!      'TARGET_MEM_CONSTRAINT' macro.
  
! 'o'
       A memory operand is allowed, but only if the address is
       "offsettable".  This means that adding a small integer (actually,
       the width in bytes of the operand, as determined by its machine
*************** whitespace
*** 19645,19752 ****
       on the other addressing modes that the machine supports.
  
       Note that in an output operand which can be matched by another
!      operand, the constraint letter `o' is valid only when accompanied
!      by both `<' (if the target machine has predecrement addressing)
!      and `>' (if the target machine has preincrement addressing).
  
! `V'
!      A memory operand that is not offsettable.  In other words,
!      anything that would fit the `m' constraint but not the `o'
!      constraint.
  
! `<'
!      A memory operand with autodecrement addressing (either
!      predecrement or postdecrement) is allowed.  In inline `asm' this
!      constraint is only allowed if the operand is used exactly once in
!      an instruction that can handle the side-effects.  Not using an
!      operand with `<' in constraint string in the inline `asm' pattern
!      at all or using it in multiple instructions isn't valid, because
!      the side-effects wouldn't be performed or would be performed more
!      than once.  Furthermore, on some targets the operand with `<' in
!      constraint string must be accompanied by special instruction
!      suffixes like `%U0' instruction suffix on PowerPC or `%P0' on
!      IA-64.
  
! `>'
!      A memory operand with autoincrement addressing (either
!      preincrement or postincrement) is allowed.  In inline `asm' the
!      same restrictions as for `<' apply.
  
! `r'
       A register operand is allowed provided that it is in a general
       register.
  
! `i'
       An immediate integer operand (one with constant value) is allowed.
       This includes symbolic constants whose values will be known only at
       assembly time or later.
  
! `n'
       An immediate integer operand with a known numeric value is allowed.
       Many systems cannot support assembly-time constants for operands
       less than a word wide.  Constraints for these operands should use
!      `n' rather than `i'.
  
! `I', `J', `K', ... `P'
!      Other letters in the range `I' through `P' may be defined in a
       machine-dependent fashion to permit immediate integer operands with
       explicit integer values in specified ranges.  For example, on the
!      68000, `I' is defined to stand for the range of values 1 to 8.
       This is the range permitted as a shift count in the shift
       instructions.
  
! `E'
!      An immediate floating operand (expression code `const_double') is
       allowed, but only if the target floating point format is the same
       as that of the host machine (on which the compiler is running).
  
! `F'
!      An immediate floating operand (expression code `const_double' or
!      `const_vector') is allowed.
  
! `G', `H'
!      `G' and `H' may be defined in a machine-dependent fashion to
!      permit immediate floating operands in particular ranges of values.
  
! `s'
!      An immediate integer operand whose value is not an explicit
!      integer is allowed.
  
       This might appear strange; if an insn allows a constant operand
!      with a value not known at compile time, it certainly must allow
!      any known value.  So why use `s' instead of `i'?  Sometimes it
!      allows better code to be generated.
  
       For example, on the 68000 in a fullword instruction it is possible
       to use an immediate operand; but if the immediate value is between
       -128 and 127, better code results from loading the value into a
!      register and using the register.  This is because the load into
!      the register can be done with a `moveq' instruction.  We arrange
!      for this to happen by defining the letter `K' to mean "any integer
!      outside the range -128 to 127", and then specifying `Ks' in the
       operand constraints.
  
! `g'
       Any register, memory or immediate integer operand is allowed,
       except for registers that are not general registers.
  
! `X'
       Any operand whatsoever is allowed, even if it does not satisfy
!      `general_operand'.  This is normally used in the constraint of a
!      `match_scratch' when certain alternatives will not actually
!      require a scratch register.
  
! `0', `1', `2', ... `9'
       An operand that matches the specified operand number is allowed.
       If a digit is used together with letters within the same
       alternative, the digit should come last.
  
       This number is allowed to be more than a single digit.  If multiple
       digits are encountered consecutively, they are interpreted as a
!      single decimal integer.  There is scant chance for ambiguity,
!      since to-date it has never been desirable that `10' be interpreted
!      as matching either operand 1 _or_ operand 0.  Should this be
!      desired, one can use multiple alternatives instead.
  
       This is called a "matching constraint" and what it really means is
       that the assembler has only a single operand that fills two roles
--- 19431,19536 ----
       on the other addressing modes that the machine supports.
  
       Note that in an output operand which can be matched by another
!      operand, the constraint letter 'o' is valid only when accompanied
!      by both '<' (if the target machine has predecrement addressing) and
!      '>' (if the target machine has preincrement addressing).
  
! 'V'
!      A memory operand that is not offsettable.  In other words, anything
!      that would fit the 'm' constraint but not the 'o' constraint.
  
! '<'
!      A memory operand with autodecrement addressing (either predecrement
!      or postdecrement) is allowed.  In inline 'asm' this constraint is
!      only allowed if the operand is used exactly once in an instruction
!      that can handle the side-effects.  Not using an operand with '<' in
!      constraint string in the inline 'asm' pattern at all or using it in
!      multiple instructions isn't valid, because the side-effects
!      wouldn't be performed or would be performed more than once.
!      Furthermore, on some targets the operand with '<' in constraint
!      string must be accompanied by special instruction suffixes like
!      '%U0' instruction suffix on PowerPC or '%P0' on IA-64.
  
! '>'
!      A memory operand with autoincrement addressing (either preincrement
!      or postincrement) is allowed.  In inline 'asm' the same
!      restrictions as for '<' apply.
  
! 'r'
       A register operand is allowed provided that it is in a general
       register.
  
! 'i'
       An immediate integer operand (one with constant value) is allowed.
       This includes symbolic constants whose values will be known only at
       assembly time or later.
  
! 'n'
       An immediate integer operand with a known numeric value is allowed.
       Many systems cannot support assembly-time constants for operands
       less than a word wide.  Constraints for these operands should use
!      'n' rather than 'i'.
  
! 'I', 'J', 'K', ... 'P'
!      Other letters in the range 'I' through 'P' may be defined in a
       machine-dependent fashion to permit immediate integer operands with
       explicit integer values in specified ranges.  For example, on the
!      68000, 'I' is defined to stand for the range of values 1 to 8.
       This is the range permitted as a shift count in the shift
       instructions.
  
! 'E'
!      An immediate floating operand (expression code 'const_double') is
       allowed, but only if the target floating point format is the same
       as that of the host machine (on which the compiler is running).
  
! 'F'
!      An immediate floating operand (expression code 'const_double' or
!      'const_vector') is allowed.
  
! 'G', 'H'
!      'G' and 'H' may be defined in a machine-dependent fashion to permit
!      immediate floating operands in particular ranges of values.
  
! 's'
!      An immediate integer operand whose value is not an explicit integer
!      is allowed.
  
       This might appear strange; if an insn allows a constant operand
!      with a value not known at compile time, it certainly must allow any
!      known value.  So why use 's' instead of 'i'?  Sometimes it allows
!      better code to be generated.
  
       For example, on the 68000 in a fullword instruction it is possible
       to use an immediate operand; but if the immediate value is between
       -128 and 127, better code results from loading the value into a
!      register and using the register.  This is because the load into the
!      register can be done with a 'moveq' instruction.  We arrange for
!      this to happen by defining the letter 'K' to mean "any integer
!      outside the range -128 to 127", and then specifying 'Ks' in the
       operand constraints.
  
! 'g'
       Any register, memory or immediate integer operand is allowed,
       except for registers that are not general registers.
  
! 'X'
       Any operand whatsoever is allowed, even if it does not satisfy
!      'general_operand'.  This is normally used in the constraint of a
!      'match_scratch' when certain alternatives will not actually require
!      a scratch register.
  
! '0', '1', '2', ... '9'
       An operand that matches the specified operand number is allowed.
       If a digit is used together with letters within the same
       alternative, the digit should come last.
  
       This number is allowed to be more than a single digit.  If multiple
       digits are encountered consecutively, they are interpreted as a
!      single decimal integer.  There is scant chance for ambiguity, since
!      to-date it has never been desirable that '10' be interpreted as
!      matching either operand 1 _or_ operand 0.  Should this be desired,
!      one can use multiple alternatives instead.
  
       This is called a "matching constraint" and what it really means is
       that the assembler has only a single operand that fills two roles
*************** whitespace
*** 19765,19788 ****
  
       For operands to match in a particular case usually means that they
       are identical-looking RTL expressions.  But in a few special cases
!      specific kinds of dissimilarity are allowed.  For example, `*x' as
!      an input operand will match `*x++' as an output operand.  For
!      proper results in such cases, the output template should always
!      use the output-operand's number when printing the operand.
  
! `p'
       An operand that is a valid memory address is allowed.  This is for
       "load address" and "push address" instructions.
  
!      `p' in the constraint must be accompanied by `address_operand' as
!      the predicate in the `match_operand'.  This predicate interprets
!      the mode specified in the `match_operand' as the mode of the memory
       reference for which the address would be valid.
  
  OTHER-LETTERS
       Other letters can be defined in machine-dependent fashion to stand
       for particular classes of registers or other arbitrary operand
!      types.  `d', `a' and `f' are defined on the 68000/68020 to stand
       for data, address and floating point registers.
  
   In order to have valid assembler code, each operand must satisfy its
--- 19549,19572 ----
  
       For operands to match in a particular case usually means that they
       are identical-looking RTL expressions.  But in a few special cases
!      specific kinds of dissimilarity are allowed.  For example, '*x' as
!      an input operand will match '*x++' as an output operand.  For
!      proper results in such cases, the output template should always use
!      the output-operand's number when printing the operand.
  
! 'p'
       An operand that is a valid memory address is allowed.  This is for
       "load address" and "push address" instructions.
  
!      'p' in the constraint must be accompanied by 'address_operand' as
!      the predicate in the 'match_operand'.  This predicate interprets
!      the mode specified in the 'match_operand' as the mode of the memory
       reference for which the address would be valid.
  
  OTHER-LETTERS
       Other letters can be defined in machine-dependent fashion to stand
       for particular classes of registers or other arbitrary operand
!      types.  'd', 'a' and 'f' are defined on the 68000/68020 to stand
       for data, address and floating point registers.
  
   In order to have valid assembler code, each operand must satisfy its
*************** the first pattern would not apply at all
*** 19821,19829 ****
  contain two identical subexpressions in the right place.  The pattern
  would say, "That does not look like an add instruction; try other
  patterns".  The second pattern would say, "Yes, that's an add
! instruction, but there is something wrong with it".  It would direct
! the reload pass of the compiler to generate additional insns to make
! the constraint true.  The results might look like this:
  
       (insn N2 PREV N
         (set (reg:SI 3) (reg:SI 6))
--- 19605,19613 ----
  contain two identical subexpressions in the right place.  The pattern
  would say, "That does not look like an add instruction; try other
  patterns".  The second pattern would say, "Yes, that's an add
! instruction, but there is something wrong with it".  It would direct the
! reload pass of the compiler to generate additional insns to make the
! constraint true.  The results might look like this:
  
       (insn N2 PREV N
         (set (reg:SI 3) (reg:SI 6))
*************** reloading any possible operand so that i
*** 19850,19896 ****
       registers is safe provided its predicate rejects registers.
  
       An operand whose predicate accepts only constant values is safe
!      provided its constraints include the letter `i'.  If any possible
!      constant value is accepted, then nothing less than `i' will do; if
       the predicate is more selective, then the constraints may also be
       more selective.
  
     * Any operand expression can be reloaded by copying it into a
       register.  So if an operand's constraints allow some kind of
!      register, it is certain to be safe.  It need not permit all
!      classes of registers; the compiler knows how to copy a register
!      into another register of the proper class in order to make an
       instruction valid.
  
     * A nonoffsettable memory reference can be reloaded by copying the
!      address into a register.  So if the constraint uses the letter
!      `o', all memory references are taken care of.
  
     * A constant operand can be reloaded by allocating space in memory to
       hold it as preinitialized data.  Then the memory reference can be
       used in place of the constant.  So if the constraint uses the
!      letters `o' or `m', constant operands are not a problem.
  
     * If the constraint permits a constant and a pseudo register used in
!      an insn was not allocated to a hard register and is equivalent to
!      a constant, the register will be replaced with the constant.  If
!      the predicate does not permit a constant and the insn is
!      re-recognized for some reason, the compiler will crash.  Thus the
!      predicate must always recognize any objects allowed by the
!      constraint.
  
   If the operand's predicate can recognize registers, but the constraint
! does not permit them, it can make the compiler crash.  When this
! operand happens to be a register, the reload pass will be stymied,
! because it does not know how to copy a register temporarily into memory.
  
   If the predicate accepts a unary operator, the constraint applies to
  the operand.  For example, the MIPS processor at ISA level 3 supports an
! instruction which adds two registers in `SImode' to produce a `DImode'
  result, but only if the registers are correctly sign extended.  This
! predicate for the input operands accepts a `sign_extend' of an `SImode'
! register.  Write the constraint to indicate the type of register that
! is required for the operand of the `sign_extend'.
  
  
  File: gccint.info,  Node: Multi-Alternative,  Next: Class Preferences,  Prev: Simple Constraints,  Up: Constraints
--- 19634,19679 ----
       registers is safe provided its predicate rejects registers.
  
       An operand whose predicate accepts only constant values is safe
!      provided its constraints include the letter 'i'.  If any possible
!      constant value is accepted, then nothing less than 'i' will do; if
       the predicate is more selective, then the constraints may also be
       more selective.
  
     * Any operand expression can be reloaded by copying it into a
       register.  So if an operand's constraints allow some kind of
!      register, it is certain to be safe.  It need not permit all classes
!      of registers; the compiler knows how to copy a register into
!      another register of the proper class in order to make an
       instruction valid.
  
     * A nonoffsettable memory reference can be reloaded by copying the
!      address into a register.  So if the constraint uses the letter 'o',
!      all memory references are taken care of.
  
     * A constant operand can be reloaded by allocating space in memory to
       hold it as preinitialized data.  Then the memory reference can be
       used in place of the constant.  So if the constraint uses the
!      letters 'o' or 'm', constant operands are not a problem.
  
     * If the constraint permits a constant and a pseudo register used in
!      an insn was not allocated to a hard register and is equivalent to a
!      constant, the register will be replaced with the constant.  If the
!      predicate does not permit a constant and the insn is re-recognized
!      for some reason, the compiler will crash.  Thus the predicate must
!      always recognize any objects allowed by the constraint.
  
   If the operand's predicate can recognize registers, but the constraint
! does not permit them, it can make the compiler crash.  When this operand
! happens to be a register, the reload pass will be stymied, because it
! does not know how to copy a register temporarily into memory.
  
   If the predicate accepts a unary operator, the constraint applies to
  the operand.  For example, the MIPS processor at ISA level 3 supports an
! instruction which adds two registers in 'SImode' to produce a 'DImode'
  result, but only if the registers are correctly sign extended.  This
! predicate for the input operands accepts a 'sign_extend' of an 'SImode'
! register.  Write the constraint to indicate the type of register that is
! required for the operand of the 'sign_extend'.
  
  
  File: gccint.info,  Node: Multi-Alternative,  Next: Class Preferences,  Prev: Simple Constraints,  Up: Constraints
*************** alternative.  Here is how it is done for
*** 19918,19964 ****
                       (match_operand:SI 2 "general_operand" "dKs,dmKs")))]
         ...)
  
!  The first alternative has `m' (memory) for operand 0, `0' for operand
! 1 (meaning it must match operand 0), and `dKs' for operand 2.  The
! second alternative has `d' (data register) for operand 0, `0' for
! operand 1, and `dmKs' for operand 2.  The `=' and `%' in the
! constraints apply to all the alternatives; their meaning is explained
! in the next section (*note Class Preferences::).
  
   If all the operands fit any one alternative, the instruction is valid.
  Otherwise, for each alternative, the compiler counts how many
! instructions must be added to copy the operands so that that
! alternative applies.  The alternative requiring the least copying is
! chosen.  If two alternatives need the same amount of copying, the one
! that comes first is chosen.  These choices can be altered with the `?'
! and `!' characters:
  
! `?'
!      Disparage slightly the alternative that the `?' appears in, as a
       choice when no alternative applies exactly.  The compiler regards
!      this alternative as one unit more costly for each `?' that appears
       in it.
  
! `!'
!      Disparage severely the alternative that the `!' appears in.  This
       alternative can still be used if it fits without reloading, but if
       reloading is needed, some other alternative will be used.
  
! `^'
!      This constraint is analogous to `?' but it disparages slightly the
!      alternative only if the operand with the `^' needs a reload.
  
! `$'
!      This constraint is analogous to `!' but it disparages severely the
!      alternative only if the operand with the `$' needs a reload.
  
   When an insn pattern has multiple alternatives in its constraints,
  often the appearance of the assembler code is determined mostly by which
  alternative was matched.  When this is so, the C code for writing the
! assembler code can use the variable `which_alternative', which is the
! ordinal number of the alternative that was actually satisfied (0 for
! the first, 1 for the second alternative, etc.).  *Note Output
! Statement::.
  
  
  File: gccint.info,  Node: Class Preferences,  Next: Modifiers,  Prev: Multi-Alternative,  Up: Constraints
--- 19701,19746 ----
                       (match_operand:SI 2 "general_operand" "dKs,dmKs")))]
         ...)
  
!  The first alternative has 'm' (memory) for operand 0, '0' for operand 1
! (meaning it must match operand 0), and 'dKs' for operand 2.  The second
! alternative has 'd' (data register) for operand 0, '0' for operand 1,
! and 'dmKs' for operand 2.  The '=' and '%' in the constraints apply to
! all the alternatives; their meaning is explained in the next section
! (*note Class Preferences::).
  
   If all the operands fit any one alternative, the instruction is valid.
  Otherwise, for each alternative, the compiler counts how many
! instructions must be added to copy the operands so that that alternative
! applies.  The alternative requiring the least copying is chosen.  If two
! alternatives need the same amount of copying, the one that comes first
! is chosen.  These choices can be altered with the '?' and '!'
! characters:
  
! '?'
!      Disparage slightly the alternative that the '?' appears in, as a
       choice when no alternative applies exactly.  The compiler regards
!      this alternative as one unit more costly for each '?' that appears
       in it.
  
! '!'
!      Disparage severely the alternative that the '!' appears in.  This
       alternative can still be used if it fits without reloading, but if
       reloading is needed, some other alternative will be used.
  
! '^'
!      This constraint is analogous to '?' but it disparages slightly the
!      alternative only if the operand with the '^' needs a reload.
  
! '$'
!      This constraint is analogous to '!' but it disparages severely the
!      alternative only if the operand with the '$' needs a reload.
  
   When an insn pattern has multiple alternatives in its constraints,
  often the appearance of the assembler code is determined mostly by which
  alternative was matched.  When this is so, the C code for writing the
! assembler code can use the variable 'which_alternative', which is the
! ordinal number of the alternative that was actually satisfied (0 for the
! first, 1 for the second alternative, etc.).  *Note Output Statement::.
  
  
  File: gccint.info,  Node: Class Preferences,  Next: Modifiers,  Prev: Multi-Alternative,  Up: Constraints
*************** The operand constraints have another fun
*** 19970,19978 ****
  to decide which kind of hardware register a pseudo register is best
  allocated to.  The compiler examines the constraints that apply to the
  insns that use the pseudo register, looking for the machine-dependent
! letters such as `d' and `a' that specify classes of registers.  The
  pseudo register is put in whichever class gets the most "votes".  The
! constraint letters `g' and `r' also vote: they vote in favor of a
  general register.  The machine description says which registers are
  considered general.
  
--- 19752,19760 ----
  to decide which kind of hardware register a pseudo register is best
  allocated to.  The compiler examines the constraints that apply to the
  insns that use the pseudo register, looking for the machine-dependent
! letters such as 'd' and 'a' that specify classes of registers.  The
  pseudo register is put in whichever class gets the most "votes".  The
! constraint letters 'g' and 'r' also vote: they vote in favor of a
  general register.  The machine description says which registers are
  considered general.
  
*************** File: gccint.info,  Node: Modifiers,  Ne
*** 19987,20043 ****
  
  Here are constraint modifier characters.
  
! `='
       Means that this operand is written to by this instruction: the
       previous value is discarded and replaced by new data.
  
! `+'
       Means that this operand is both read and written by the
       instruction.
  
       When the compiler fixes up the operands to satisfy the constraints,
       it needs to know which operands are read by the instruction and
!      which are written by it.  `=' identifies an operand which is only
!      written; `+' identifies an operand that is both read and written;
       all other operands are assumed to only be read.
  
!      If you specify `=' or `+' in a constraint, you put it in the first
       character of the constraint string.
  
! `&'
       Means (in a particular alternative) that this operand is an
       "earlyclobber" operand, which is written before the instruction is
!      finished using the input operands.  Therefore, this operand may
!      not lie in a register that is read by the instruction or as part
!      of any memory address.
  
!      `&' applies only to the alternative in which it is written.  In
       constraints with multiple alternatives, sometimes one alternative
!      requires `&' while others do not.  See, for example, the `movdf'
       insn of the 68000.
  
       A operand which is read by the instruction can be tied to an
       earlyclobber operand if its only use as an input occurs before the
       early result is written.  Adding alternatives of this form often
       allows GCC to produce better code when only some of the read
!      operands can be affected by the earlyclobber. See, for example,
!      the `mulsi3' insn of the ARM.
  
       Furthermore, if the "earlyclobber" operand is also a read/write
       operand, then that operand is written only after it's used.
  
!      `&' does not obviate the need to write `=' or `+'.  As
       "earlyclobber" operands are always written, a read-only
       "earlyclobber" operand is ill-formed and will be rejected by the
       compiler.
  
! `%'
       Declares the instruction to be commutative for this operand and the
       following operand.  This means that the compiler may interchange
       the two operands if that is the cheapest way to make all operands
!      fit the constraints.  `%' applies to all alternatives and must
       appear as the first character in the constraint.  Only read-only
!      operands can use `%'.
  
       This is often used in patterns for addition instructions that
       really have only two operands: the result must go in one of the
--- 19769,19825 ----
  
  Here are constraint modifier characters.
  
! '='
       Means that this operand is written to by this instruction: the
       previous value is discarded and replaced by new data.
  
! '+'
       Means that this operand is both read and written by the
       instruction.
  
       When the compiler fixes up the operands to satisfy the constraints,
       it needs to know which operands are read by the instruction and
!      which are written by it.  '=' identifies an operand which is only
!      written; '+' identifies an operand that is both read and written;
       all other operands are assumed to only be read.
  
!      If you specify '=' or '+' in a constraint, you put it in the first
       character of the constraint string.
  
! '&'
       Means (in a particular alternative) that this operand is an
       "earlyclobber" operand, which is written before the instruction is
!      finished using the input operands.  Therefore, this operand may not
!      lie in a register that is read by the instruction or as part of any
!      memory address.
  
!      '&' applies only to the alternative in which it is written.  In
       constraints with multiple alternatives, sometimes one alternative
!      requires '&' while others do not.  See, for example, the 'movdf'
       insn of the 68000.
  
       A operand which is read by the instruction can be tied to an
       earlyclobber operand if its only use as an input occurs before the
       early result is written.  Adding alternatives of this form often
       allows GCC to produce better code when only some of the read
!      operands can be affected by the earlyclobber.  See, for example,
!      the 'mulsi3' insn of the ARM.
  
       Furthermore, if the "earlyclobber" operand is also a read/write
       operand, then that operand is written only after it's used.
  
!      '&' does not obviate the need to write '=' or '+'.  As
       "earlyclobber" operands are always written, a read-only
       "earlyclobber" operand is ill-formed and will be rejected by the
       compiler.
  
! '%'
       Declares the instruction to be commutative for this operand and the
       following operand.  This means that the compiler may interchange
       the two operands if that is the cheapest way to make all operands
!      fit the constraints.  '%' applies to all alternatives and must
       appear as the first character in the constraint.  Only read-only
!      operands can use '%'.
  
       This is often used in patterns for addition instructions that
       really have only two operands: the result must go in one of the
*************** Here are constraint modifier characters.
*** 20051,20082 ****
              ...)
       GCC can only handle one commutative pair in an asm; if you use
       more, the compiler may fail.  Note that you need not use the
!      modifier if the two alternatives are strictly identical; this
!      would only waste time in the reload pass.  The modifier is not
       operational after register allocation, so the result of
!      `define_peephole2' and `define_split's performed after reload
!      cannot rely on `%' to make the intended insn match.
  
! `#'
       Says that all following characters, up to the next comma, are to be
       ignored as a constraint.  They are significant only for choosing
       register preferences.
  
! `*'
       Says that the following character should be ignored when choosing
!      register preferences.  `*' has no effect on the meaning of the
       constraint as a constraint, and no effect on reloading.  For LRA
!      `*' additionally disparages slightly the alternative if the
       following character matches the operand.
  
       Here is an example: the 68000 has an instruction to sign-extend a
       halfword in a data register, and can also sign-extend a value by
!      copying it into an address register.  While either kind of
!      register is acceptable, the constraints on an address-register
!      destination are less strict, so it is best if register allocation
!      makes an address register its goal.  Therefore, `*' is used so
!      that the `d' constraint letter (for data register) is ignored when
!      computing register preferences.
  
            (define_insn "extendhisi2"
              [(set (match_operand:SI 0 "general_operand" "=*d,a")
--- 19833,19864 ----
              ...)
       GCC can only handle one commutative pair in an asm; if you use
       more, the compiler may fail.  Note that you need not use the
!      modifier if the two alternatives are strictly identical; this would
!      only waste time in the reload pass.  The modifier is not
       operational after register allocation, so the result of
!      'define_peephole2' and 'define_split's performed after reload
!      cannot rely on '%' to make the intended insn match.
  
! '#'
       Says that all following characters, up to the next comma, are to be
       ignored as a constraint.  They are significant only for choosing
       register preferences.
  
! '*'
       Says that the following character should be ignored when choosing
!      register preferences.  '*' has no effect on the meaning of the
       constraint as a constraint, and no effect on reloading.  For LRA
!      '*' additionally disparages slightly the alternative if the
       following character matches the operand.
  
       Here is an example: the 68000 has an instruction to sign-extend a
       halfword in a data register, and can also sign-extend a value by
!      copying it into an address register.  While either kind of register
!      is acceptable, the constraints on an address-register destination
!      are less strict, so it is best if register allocation makes an
!      address register its goal.  Therefore, '*' is used so that the 'd'
!      constraint letter (for data register) is ignored when computing
!      register preferences.
  
            (define_insn "extendhisi2"
              [(set (match_operand:SI 0 "general_operand" "=*d,a")
*************** File: gccint.info,  Node: Machine Constr
*** 20091,21486 ****
  ------------------------------------------
  
  Whenever possible, you should use the general-purpose constraint letters
! in `asm' arguments, since they will convey meaning more readily to
! people reading your code.  Failing that, use the constraint letters
! that usually have very similar meanings across architectures.  The most
! commonly used constraints are `m' and `r' (for memory and
  general-purpose registers respectively; *note Simple Constraints::), and
! `I', usually the letter indicating the most common immediate-constant
  format.
  
   Each architecture defines additional constraints.  These constraints
  are used by the compiler itself for instruction generation, as well as
! for `asm' statements; therefore, some of the constraints are not
! particularly useful for `asm'.  Here is a summary of some of the
  machine-dependent constraints available on some particular machines; it
! includes both constraints that are useful for `asm' and constraints
! that aren't.  The compiler source file mentioned in the table heading
! for each architecture is the definitive reference for the meanings of
! that architecture's constraints.
! 
! _AArch64 family--`config/aarch64/constraints.md'_
  
!     `k'
!           The stack pointer register (`SP')
  
!     `w'
            Floating point or SIMD vector register
  
!     `I'
            Integer constant that is valid as an immediate operand in an
!           `ADD' instruction
  
!     `J'
            Integer constant that is valid as an immediate operand in a
!           `SUB' instruction (once negated)
  
!     `K'
            Integer constant that can be used with a 32-bit logical
            instruction
  
!     `L'
            Integer constant that can be used with a 64-bit logical
            instruction
  
!     `M'
            Integer constant that is valid as an immediate operand in a
!           32-bit `MOV' pseudo instruction. The `MOV' may be assembled
            to one of several different machine instructions depending on
            the value
  
!     `N'
            Integer constant that is valid as an immediate operand in a
!           64-bit `MOV' pseudo instruction
  
!     `S'
            An absolute symbolic address or a label reference
  
!     `Y'
            Floating point constant zero
  
!     `Z'
            Integer constant zero
  
!     `Ush'
!           The high part (bits 12 and upwards) of the pc-relative
!           address of a symbol within 4GB of the instruction
  
!     `Q'
            A memory address which uses a single base register with no
            offset
  
!     `Ump'
!           A memory address suitable for a load/store pair instruction
!           in SI, DI, SF and DF modes
! 
! 
! _ARC --`config/arc/constraints.md'_
  
!     `q'
!           Registers usable in ARCompact 16-bit instructions: `r0'-`r3',
!           `r12'-`r15'.  This constraint can only match when the `-mq'
            option is in effect.
  
!     `e'
!           Registers usable as base-regs of memory addresses in
!           ARCompact 16-bit memory instructions: `r0'-`r3', `r12'-`r15',
!           `sp'.  This constraint can only match when the `-mq' option
!           is in effect.
! 
!     `D'
!           ARC FPX (dpfp) 64-bit registers. `D0', `D1'.
  
!     `I'
            A signed 12-bit integer constant.
  
!     `Cal'
!           constant for arithmetic/logical operations.  This might be
!           any constant that can be put into a long immediate by the
!           assmbler or linker without involving a PIC relocation.
  
!     `K'
            A 3-bit unsigned integer constant.
  
!     `L'
            A 6-bit unsigned integer constant.
  
!     `CnL'
            One's complement of a 6-bit unsigned integer constant.
  
!     `CmL'
            Two's complement of a 6-bit unsigned integer constant.
  
!     `M'
            A 5-bit unsigned integer constant.
  
!     `O'
            A 7-bit unsigned integer constant.
  
!     `P'
            A 8-bit unsigned integer constant.
  
!     `H'
            Any const_double value.
  
! _ARM family--`config/arm/constraints.md'_
  
!     `h'
!           In Thumb state, the core registers `r8'-`r15'.
  
!     `k'
            The stack pointer register.
  
!     `l'
!           In Thumb State the core registers `r0'-`r7'.  In ARM state
!           this is an alias for the `r' constraint.
  
!     `t'
!           VFP floating-point registers `s0'-`s31'.  Used for 32 bit
            values.
  
!     `w'
!           VFP floating-point registers `d0'-`d31' and the appropriate
!           subset `d0'-`d15' based on command line options.  Used for 64
            bit values only.  Not valid for Thumb1.
  
!     `y'
            The iWMMX co-processor registers.
  
!     `z'
            The iWMMX GR registers.
  
!     `G'
            The floating-point constant 0.0
  
!     `I'
            Integer that is valid as an immediate operand in a data
!           processing instruction.  That is, an integer in the range 0
!           to 255 rotated by a multiple of 2
  
!     `J'
            Integer in the range -4095 to 4095
  
!     `K'
!           Integer that satisfies constraint `I' when inverted (ones
            complement)
  
!     `L'
!           Integer that satisfies constraint `I' when negated (twos
            complement)
  
!     `M'
            Integer in the range 0 to 32
  
!     `Q'
            A memory reference where the exact address is in a single
!           register (``m'' is preferable for `asm' statements)
  
!     `R'
            An item in the constant pool
  
!     `S'
            A symbol in the text segment of the current file
  
!     `Uv'
            A memory reference suitable for VFP load/store insns
            (reg+constant offset)
  
!     `Uy'
            A memory reference suitable for iWMMXt load/store
            instructions.
  
!     `Uq'
            A memory reference suitable for the ARMv4 ldrsb instruction.
  
! _AVR family--`config/avr/constraints.md'_
! 
!     `l'
            Registers from r0 to r15
  
!     `a'
            Registers from r16 to r23
  
!     `d'
            Registers from r16 to r31
  
!     `w'
            Registers from r24 to r31.  These registers can be used in
!           `adiw' command
  
!     `e'
            Pointer register (r26-r31)
  
!     `b'
            Base pointer register (r28-r31)
  
!     `q'
            Stack pointer register (SPH:SPL)
  
!     `t'
            Temporary register r0
  
!     `x'
            Register pair X (r27:r26)
  
!     `y'
            Register pair Y (r29:r28)
  
!     `z'
            Register pair Z (r31:r30)
  
!     `I'
            Constant greater than -1, less than 64
  
!     `J'
            Constant greater than -64, less than 1
  
!     `K'
            Constant integer 2
  
!     `L'
            Constant integer 0
  
!     `M'
            Constant that fits in 8 bits
  
!     `N'
            Constant integer -1
  
!     `O'
            Constant integer 8, 16, or 24
  
!     `P'
            Constant integer 1
  
!     `G'
            A floating point constant 0.0
  
!     `Q'
            A memory address based on Y or Z pointer with displacement.
  
! _Blackfin family--`config/bfin/constraints.md'_
! 
!     `a'
            P register
  
!     `d'
            D register
  
!     `z'
            A call clobbered P register.
  
!     `qN'
            A single register.  If N is in the range 0 to 7, the
!           corresponding D register.  If it is `A', then the register P0.
  
!     `D'
            Even-numbered D register
  
!     `W'
            Odd-numbered D register
  
!     `e'
            Accumulator register.
  
!     `A'
            Even-numbered accumulator register.
  
!     `B'
            Odd-numbered accumulator register.
  
!     `b'
            I register
  
!     `v'
            B register
  
!     `f'
            M register
  
!     `c'
!           Registers used for circular buffering, i.e. I, B, or L
            registers.
  
!     `C'
            The CC register.
  
!     `t'
            LT0 or LT1.
  
!     `k'
            LC0 or LC1.
  
!     `u'
            LB0 or LB1.
  
!     `x'
            Any D, P, B, M, I or L register.
  
!     `y'
            Additional registers typically used only in prologues and
            epilogues: RETS, RETN, RETI, RETX, RETE, ASTAT, SEQSTAT and
            USP.
  
!     `w'
            Any register except accumulators or CC.
  
!     `Ksh'
            Signed 16 bit integer (in the range -32768 to 32767)
  
!     `Kuh'
            Unsigned 16 bit integer (in the range 0 to 65535)
  
!     `Ks7'
            Signed 7 bit integer (in the range -64 to 63)
  
!     `Ku7'
            Unsigned 7 bit integer (in the range 0 to 127)
  
!     `Ku5'
            Unsigned 5 bit integer (in the range 0 to 31)
  
!     `Ks4'
            Signed 4 bit integer (in the range -8 to 7)
  
!     `Ks3'
            Signed 3 bit integer (in the range -3 to 4)
  
!     `Ku3'
            Unsigned 3 bit integer (in the range 0 to 7)
  
!     `PN'
            Constant N, where N is a single-digit constant in the range 0
            to 4.
  
!     `PA'
            An integer equal to one of the MACFLAG_XXX constants that is
            suitable for use with either accumulator.
  
!     `PB'
            An integer equal to one of the MACFLAG_XXX constants that is
            suitable for use only with accumulator A1.
  
!     `M1'
            Constant 255.
  
!     `M2'
            Constant 65535.
  
!     `J'
            An integer constant with exactly a single bit set.
  
!     `L'
            An integer constant with all bits set except exactly one.
  
!     `H'
  
!     `Q'
            Any SYMBOL_REF.
  
! _CR16 Architecture--`config/cr16/cr16.h'_
  
!     `b'
            Registers from r0 to r14 (registers without stack pointer)
  
!     `t'
            Register from r0 to r11 (all 16-bit registers)
  
!     `p'
            Register from r12 to r15 (all 32-bit registers)
  
!     `I'
            Signed constant that fits in 4 bits
  
!     `J'
            Signed constant that fits in 5 bits
  
!     `K'
            Signed constant that fits in 6 bits
  
!     `L'
            Unsigned constant that fits in 4 bits
  
!     `M'
            Signed constant that fits in 32 bits
  
!     `N'
            Check for 64 bits wide constants for add/sub instructions
  
!     `G'
            Floating point constant that is legal for store immediate
  
! _Epiphany--`config/epiphany/constraints.md'_
! 
!     `U16'
            An unsigned 16-bit constant.
  
!     `K'
            An unsigned 5-bit constant.
  
!     `L'
            A signed 11-bit constant.
  
!     `Cm1'
!           A signed 11-bit constant added to -1.  Can only match when
!           the `-m1reg-REG' option is active.
  
!     `Cl1'
            Left-shift of -1, i.e., a bit mask with a block of leading
            ones, the rest being a block of trailing zeroes.  Can only
!           match when the `-m1reg-REG' option is active.
  
!     `Cr1'
            Right-shift of -1, i.e., a bit mask with a trailing block of
            ones, the rest being zeroes.  Or to put it another way, one
            less than a power of two.  Can only match when the
!           `-m1reg-REG' option is active.
  
!     `Cal'
!           Constant for arithmetic/logical operations.  This is like
!           `i', except that for position independent code, no symbols /
            expressions needing relocations are allowed.
  
!     `Csy'
            Symbolic constant for call/jump instruction.
  
!     `Rcs'
            The register class usable in short insns.  This is a register
            class constraint, and can thus drive register allocation.
!           This constraint won't match unless `-mprefer-short-insn-regs'
            is in effect.
  
!     `Rsc'
            The the register class of registers that can be used to hold a
            sibcall call address.  I.e., a caller-saved register.
  
!     `Rct'
            Core control register class.
  
!     `Rgs'
            The register group usable in short insns.  This constraint
            does not use a register class, so that it only passively
            matches suitable registers, and doesn't drive register
            allocation.
  
!     `Car'
            Constant suitable for the addsi3_r pattern.  This is a valid
            offset For byte, halfword, or word addressing.
  
!     `Rra'
!           Matches the return address if it can be replaced with the
!           link register.
  
!     `Rcc'
            Matches the integer condition code register.
  
!     `Sra'
            Matches the return address if it is in a stack slot.
  
!     `Cfm'
            Matches control register values to switch fp mode, which are
!           encapsulated in `UNSPEC_FP_MODE'.
! 
! _FRV--`config/frv/frv.h'_
  
!     `a'
!           Register in the class `ACC_REGS' (`acc0' to `acc7').
  
!     `b'
!           Register in the class `EVEN_ACC_REGS' (`acc0' to `acc7').
  
!     `c'
!           Register in the class `CC_REGS' (`fcc0' to `fcc3' and `icc0'
!           to `icc3').
  
!     `d'
!           Register in the class `GPR_REGS' (`gr0' to `gr63').
  
!     `e'
!           Register in the class `EVEN_REGS' (`gr0' to `gr63').  Odd
!           registers are excluded not in the class but through the use
!           of a machine mode larger than 4 bytes.
  
!     `f'
!           Register in the class `FPR_REGS' (`fr0' to `fr63').
  
!     `h'
!           Register in the class `FEVEN_REGS' (`fr0' to `fr63').  Odd
!           registers are excluded not in the class but through the use
!           of a machine mode larger than 4 bytes.
  
!     `l'
!           Register in the class `LR_REG' (the `lr' register).
  
!     `q'
!           Register in the class `QUAD_REGS' (`gr2' to `gr63').
!           Register numbers not divisible by 4 are excluded not in the
!           class but through the use of a machine mode larger than 8
!           bytes.
  
!     `t'
!           Register in the class `ICC_REGS' (`icc0' to `icc3').
  
!     `u'
!           Register in the class `FCC_REGS' (`fcc0' to `fcc3').
  
!     `v'
!           Register in the class `ICR_REGS' (`cc4' to `cc7').
  
!     `w'
!           Register in the class `FCR_REGS' (`cc0' to `cc3').
  
!     `x'
!           Register in the class `QUAD_FPR_REGS' (`fr0' to `fr63').
            Register numbers not divisible by 4 are excluded not in the
            class but through the use of a machine mode larger than 8
            bytes.
  
!     `z'
!           Register in the class `SPR_REGS' (`lcr' and `lr').
  
!     `A'
!           Register in the class `QUAD_ACC_REGS' (`acc0' to `acc7').
  
!     `B'
!           Register in the class `ACCG_REGS' (`accg0' to `accg7').
  
!     `C'
!           Register in the class `CR_REGS' (`cc0' to `cc7').
  
!     `G'
            Floating point constant zero
  
!     `I'
            6-bit signed integer constant
  
!     `J'
            10-bit signed integer constant
  
!     `L'
            16-bit signed integer constant
  
!     `M'
            16-bit unsigned integer constant
  
!     `N'
            12-bit signed integer constant that is negative--i.e. in the
            range of -2048 to -1
  
!     `O'
            Constant zero
  
!     `P'
!           12-bit signed integer constant that is greater than
!           zero--i.e. in the range of 1 to 2047.
! 
! 
! _Hewlett-Packard PA-RISC--`config/pa/pa.h'_
  
!     `a'
            General register 1
  
!     `f'
            Floating point register
  
!     `q'
            Shift amount register
  
!     `x'
            Floating point register (deprecated)
  
!     `y'
            Upper floating point register (32-bit), floating point
            register (64-bit)
  
!     `Z'
            Any register
  
!     `I'
            Signed 11-bit integer constant
  
!     `J'
            Signed 14-bit integer constant
  
!     `K'
!           Integer constant that can be deposited with a `zdepi'
            instruction
  
!     `L'
            Signed 5-bit integer constant
  
!     `M'
            Integer constant 0
  
!     `N'
!           Integer constant that can be loaded with a `ldil' instruction
  
!     `O'
            Integer constant whose value plus one is a power of 2
  
!     `P'
!           Integer constant that can be used for `and' operations in
!           `depi' and `extru' instructions
  
!     `S'
            Integer constant 31
  
!     `U'
            Integer constant 63
  
!     `G'
            Floating-point constant 0.0
  
!     `A'
!           A `lo_sum' data-linkage-table memory operand
  
!     `Q'
            A memory operand that can be used as the destination operand
            of an integer store instruction
  
!     `R'
            A scaled or unscaled indexed memory operand
  
!     `T'
            A memory operand for floating-point loads and stores
  
!     `W'
            A register indirect memory operand
  
! _Intel IA-64--`config/ia64/ia64.h'_
! 
!     `a'
!           General register `r0' to `r3' for `addl' instruction
  
!     `b'
            Branch register
  
!     `c'
!           Predicate register (`c' as in "conditional")
  
!     `d'
            Application register residing in M-unit
  
!     `e'
            Application register residing in I-unit
  
!     `f'
            Floating-point register
  
!     `m'
!           Memory operand.  If used together with `<' or `>', the
!           operand can have postincrement and postdecrement which
!           require printing with `%Pn' on IA-64.
  
!     `G'
            Floating-point constant 0.0 or 1.0
  
!     `I'
            14-bit signed integer constant
  
!     `J'
            22-bit signed integer constant
  
!     `K'
            8-bit signed integer constant for logical instructions
  
!     `L'
            8-bit adjusted signed integer constant for compare pseudo-ops
  
!     `M'
            6-bit unsigned integer constant for shift counts
  
!     `N'
            9-bit signed integer constant for load and store
            postincrements
  
!     `O'
            The constant zero
  
!     `P'
!           0 or -1 for `dep' instruction
  
!     `Q'
            Non-volatile memory for floating-point loads and stores
  
!     `R'
!           Integer constant in the range 1 to 4 for `shladd' instruction
  
!     `S'
            Memory operand except postincrement and postdecrement.  This
!           is now roughly the same as `m' when not used together with `<'
!           or `>'.
! 
! _M32C--`config/m32c/m32c.c'_
  
!     `Rsp'
!     `Rfb'
!     `Rsb'
!           `$sp', `$fb', `$sb'.
  
!     `Rcr'
            Any control register, when they're 16 bits wide (nothing if
            control registers are 24 bits wide)
  
!     `Rcl'
            Any control register, when they're 24 bits wide.
  
!     `R0w'
!     `R1w'
!     `R2w'
!     `R3w'
            $r0, $r1, $r2, $r3.
  
!     `R02'
            $r0 or $r2, or $r2r0 for 32 bit values.
  
!     `R13'
            $r1 or $r3, or $r3r1 for 32 bit values.
  
!     `Rdi'
            A register that can hold a 64 bit value.
  
!     `Rhl'
            $r0 or $r1 (registers with addressable high/low bytes)
  
!     `R23'
            $r2 or $r3
  
!     `Raa'
            Address registers
  
!     `Raw'
            Address registers when they're 16 bits wide.
  
!     `Ral'
            Address registers when they're 24 bits wide.
  
!     `Rqi'
            Registers that can hold QI values.
  
!     `Rad'
            Registers that can be used with displacements ($a0, $a1, $sb).
  
!     `Rsi'
            Registers that can hold 32 bit values.
  
!     `Rhi'
            Registers that can hold 16 bit values.
  
!     `Rhc'
            Registers chat can hold 16 bit values, including all control
            registers.
  
!     `Rra'
            $r0 through R1, plus $a0 and $a1.
  
!     `Rfl'
            The flags register.
  
!     `Rmm'
            The memory-based pseudo-registers $mem0 through $mem15.
  
!     `Rpi'
            Registers that can hold pointers (16 bit registers for r8c,
            m16c; 24 bit registers for m32cm, m32c).
  
!     `Rpa'
            Matches multiple registers in a PARALLEL to form a larger
            register.  Used to match function return values.
  
!     `Is3'
            -8 ... 7
  
!     `IS1'
            -128 ... 127
  
!     `IS2'
            -32768 ... 32767
  
!     `IU2'
            0 ... 65535
  
!     `In4'
            -8 ... -1 or 1 ... 8
  
!     `In5'
            -16 ... -1 or 1 ... 16
  
!     `In6'
            -32 ... -1 or 1 ... 32
  
!     `IM2'
            -65536 ... -1
  
!     `Ilb'
            An 8 bit value with exactly one bit set.
  
!     `Ilw'
            A 16 bit value with exactly one bit set.
  
!     `Sd'
            The common src/dest memory addressing modes.
  
!     `Sa'
            Memory addressed using $a0 or $a1.
  
!     `Si'
            Memory addressed with immediate addresses.
  
!     `Ss'
            Memory addressed using the stack pointer ($sp).
  
!     `Sf'
            Memory addressed using the frame base register ($fb).
  
!     `Ss'
            Memory addressed using the small base register ($sb).
  
!     `S1'
            $r1h
  
! _MeP--`config/mep/constraints.md'_
  
!     `a'
            The $sp register.
  
!     `b'
            The $tp register.
  
!     `c'
            Any control register.
  
!     `d'
            Either the $hi or the $lo register.
  
!     `em'
            Coprocessor registers that can be directly loaded ($c0-$c15).
  
!     `ex'
            Coprocessor registers that can be moved to each other.
  
!     `er'
            Coprocessor registers that can be moved to core registers.
  
!     `h'
            The $hi register.
  
!     `j'
            The $rpc register.
  
!     `l'
            The $lo register.
  
!     `t'
            Registers which can be used in $tp-relative addressing.
  
!     `v'
            The $gp register.
  
!     `x'
            The coprocessor registers.
  
!     `y'
            The coprocessor control registers.
  
!     `z'
            The $0 register.
  
!     `A'
            User-defined register set A.
  
!     `B'
            User-defined register set B.
  
!     `C'
            User-defined register set C.
  
!     `D'
            User-defined register set D.
  
!     `I'
            Offsets for $gp-rel addressing.
  
!     `J'
            Constants that can be used directly with boolean insns.
  
!     `K'
            Constants that can be moved directly to registers.
  
!     `L'
            Small constants that can be added to registers.
  
!     `M'
            Long shift counts.
  
!     `N'
            Small constants that can be compared to registers.
  
!     `O'
            Constants that can be loaded into the top half of registers.
  
!     `S'
            Signed 8-bit immediates.
  
!     `T'
            Symbols encoded for $tp-rel or $gp-rel addressing.
  
!     `U'
            Non-constant addresses for loading/saving coprocessor
            registers.
  
!     `W'
            The top half of a symbol's value.
  
!     `Y'
            A register indirect address without offset.
  
!     `Z'
            Symbolic references to the control bus.
  
  
! _MicroBlaze--`config/microblaze/constraints.md'_
! 
!     `d'
!           A general register (`r0' to `r31').
! 
!     `z'
!           A status register (`rmsr', `$fcc1' to `$fcc7').
! 
! 
! _MIPS--`config/mips/constraints.md'_
  
!     `d'
!           An address register.  This is equivalent to `r' unless
            generating MIPS16 code.
  
!     `f'
            A floating-point register (if available).
  
!     `h'
!           Formerly the `hi' register.  This constraint is no longer
            supported.
  
!     `l'
!           The `lo' register.  Use this register to store values that are
            no bigger than a word.
  
!     `x'
!           The concatenated `hi' and `lo' registers.  Use this register
            to store doubleword values.
  
!     `c'
            A register suitable for use in an indirect jump.  This will
!           always be `$25' for `-mabicalls'.
  
!     `v'
!           Register `$3'.  Do not use this constraint in new code; it is
            retained only for compatibility with glibc.
  
!     `y'
!           Equivalent to `r'; retained for backwards compatibility.
  
!     `z'
            A floating-point condition code register.
  
!     `I'
            A signed 16-bit constant (for arithmetic instructions).
  
!     `J'
            Integer zero.
  
!     `K'
            An unsigned 16-bit constant (for logic instructions).
  
!     `L'
            A signed 32-bit constant in which the lower 16 bits are zero.
!           Such constants can be loaded using `lui'.
  
!     `M'
!           A constant that cannot be loaded using `lui', `addiu' or
!           `ori'.
  
!     `N'
            A constant in the range -65535 to -1 (inclusive).
  
!     `O'
            A signed 15-bit constant.
  
!     `P'
            A constant in the range 1 to 65535 (inclusive).
  
!     `G'
            Floating-point zero.
  
!     `R'
            An address that can be used in a non-macro load or store.
  
!     `ZC'
            A memory operand whose address is formed by a base register
            and offset that is suitable for use in instructions with the
!           same addressing mode as `ll' and `sc'.
! 
!     `ZD'
!           An address suitable for a `prefetch' instruction, or for any
!           other instruction with the same addressing mode as `prefetch'.
  
! _Motorola 680x0--`config/m68k/constraints.md'_
  
!     `a'
            Address register
  
!     `d'
            Data register
  
!     `f'
            68881 floating-point register, if available
  
!     `I'
            Integer in the range 1 to 8
  
!     `J'
            16-bit signed number
  
!     `K'
            Signed number whose magnitude is greater than 0x80
  
!     `L'
            Integer in the range -8 to -1
  
!     `M'
            Signed number whose magnitude is greater than 0x100
  
!     `N'
            Range 24 to 31, rotatert:SI 8 to 1 expressed as rotate
  
!     `O'
            16 (for rotate using swap)
  
!     `P'
            Range 8 to 15, rotatert:HI 8 to 1 expressed as rotate
  
!     `R'
            Numbers that mov3q can handle
  
!     `G'
            Floating point constant that is not a 68881 constant
  
!     `S'
            Operands that satisfy 'm' when -mpcrel is in effect
  
!     `T'
            Operands that satisfy 's' when -mpcrel is not in effect
  
!     `Q'
            Address register indirect addressing mode
  
!     `U'
            Register offset addressing
  
!     `W'
            const_call_operand
  
!     `Cs'
            symbol_ref or const
  
!     `Ci'
            const_int
  
!     `C0'
            const_int 0
  
!     `Cj'
            Range of signed numbers that don't fit in 16 bits
  
!     `Cmvq'
            Integers valid for mvq
  
!     `Capsw'
            Integers valid for a moveq followed by a swap
  
!     `Cmvz'
            Integers valid for mvz
  
!     `Cmvs'
            Integers valid for mvs
  
!     `Ap'
            push_operand
  
!     `Ac'
            Non-register operands allowed in clr
  
! 
! _Moxie--`config/moxie/constraints.md'_
! 
!     `A'
            An absolute address
  
!     `B'
            An offset address
  
!     `W'
            A register indirect memory operand
  
!     `I'
            A constant in the range of 0 to 255.
  
!     `N'
            A constant in the range of 0 to -255.
  
  
! _MSP430-`config/msp430/constraints.md'_
! 
!     `R12'
            Register R12.
  
!     `R13'
            Register R13.
  
!     `K'
            Integer constant 1.
  
!     `L'
            Integer constant -1^20..1^19.
  
!     `M'
            Integer constant 1-4.
  
!     `Ya'
            Memory references which do not require an extended MOVX
            instruction.
  
!     `Yl'
            Memory reference, labels only.
  
!     `Ys'
            Memory reference, stack only.
  
! 
! _NDS32--`config/nds32/constraints.md'_
! 
!     `w'
            LOW register class $r0 to $r7 constraint for V3/V3M ISA.
! 
!     `l'
            LOW register class $r0 to $r7.
! 
!     `d'
            MIDDLE register class $r0 to $r11, $r16 to $r19.
! 
!     `h'
            HIGH register class $r12 to $r14, $r20 to $r31.
! 
!     `t'
            Temporary assist register $ta (i.e. $r15).
! 
!     `k'
            Stack register $sp.
! 
!     `Iu03'
            Unsigned immediate 3-bit value.
! 
!     `In03'
            Negative immediate 3-bit value in the range of -7-0.
! 
!     `Iu04'
            Unsigned immediate 4-bit value.
! 
!     `Is05'
            Signed immediate 5-bit value.
! 
!     `Iu05'
            Unsigned immediate 5-bit value.
! 
!     `In05'
            Negative immediate 5-bit value in the range of -31-0.
! 
!     `Ip05'
            Unsigned immediate 5-bit value for movpi45 instruction with
            range 16-47.
! 
!     `Iu06'
            Unsigned immediate 6-bit value constraint for addri36.sp
            instruction.
! 
!     `Iu08'
            Unsigned immediate 8-bit value.
! 
!     `Iu09'
            Unsigned immediate 9-bit value.
! 
!     `Is10'
            Signed immediate 10-bit value.
! 
!     `Is11'
            Signed immediate 11-bit value.
! 
!     `Is15'
            Signed immediate 15-bit value.
! 
!     `Iu15'
            Unsigned immediate 15-bit value.
! 
!     `Ic15'
!           A constant which is not in the range of imm15u but ok for
!           bclr instruction.
! 
!     `Ie15'
!           A constant which is not in the range of imm15u but ok for
!           bset instruction.
! 
!     `It15'
!           A constant which is not in the range of imm15u but ok for
!           btgl instruction.
! 
!     `Ii15'
            A constant whose compliment value is in the range of imm15u
            and ok for bitci instruction.
! 
!     `Is16'
            Signed immediate 16-bit value.
! 
!     `Is17'
            Signed immediate 17-bit value.
! 
!     `Is19'
            Signed immediate 19-bit value.
! 
!     `Is20'
            Signed immediate 20-bit value.
! 
!     `Ihig'
            The immediate value that can be simply set high 20-bit.
! 
!     `Izeb'
            The immediate value 0xff.
! 
!     `Izeh'
            The immediate value 0xffff.
! 
!     `Ixls'
            The immediate value 0x01.
! 
!     `Ix11'
            The immediate value 0x7ff.
! 
!     `Ibms'
            The immediate value with power of 2.
! 
!     `Ifex'
            The immediate value with power of 2 minus 1.
! 
!     `U33'
            Memory constraint for 333 format.
! 
!     `U45'
            Memory constraint for 45 format.
! 
!     `U37'
            Memory constraint for 37 format.
  
! _Nios II family--`config/nios2/constraints.md'_
  
!     `I'
            Integer that is valid as an immediate operand in an
!           instruction taking a signed 16-bit number. Range -32768 to
            32767.
  
!     `J'
            Integer that is valid as an immediate operand in an
!           instruction taking an unsigned 16-bit number. Range 0 to
            65535.
  
!     `K'
            Integer that is valid as an immediate operand in an
            instruction taking only the upper 16-bits of a 32-bit number.
            Range 32-bit numbers with the lower 16-bits being 0.
  
!     `L'
            Integer that is valid as an immediate operand for a shift
!           instruction. Range 0 to 31.
  
!     `M'
            Integer that is valid as an immediate operand for only the
!           value 0. Can be used in conjunction with the format modifier
!           `z' to use `r0' instead of `0' in the assembly output.
  
!     `N'
            Integer that is valid as an immediate operand for a custom
!           instruction opcode. Range 0 to 255.
  
!     `S'
            Matches immediates which are addresses in the small data
!           section and therefore can be added to `gp' as a 16-bit
            immediate to re-create their 32-bit value.
  
!     `T'
!           A `const' wrapped `UNSPEC' expression, representing a
            supported PIC or TLS relocation.
  
  
! _PDP-11--`config/pdp11/constraints.md'_
! 
!     `a'
!           Floating point registers AC0 through AC3.  These can be
!           loaded from/to memory with a single instruction.
! 
!     `d'
            Odd numbered general registers (R1, R3, R5).  These are used
            for 16-bit multiply operations.
  
!     `f'
            Any of the floating point registers (AC0 through AC5).
  
!     `G'
            Floating point constant 0.
  
!     `I'
            An integer constant that fits in 16 bits.
  
!     `J'
            An integer constant whose low order 16 bits are zero.
  
!     `K'
            An integer constant that does not meet the constraints for
!           codes `I' or `J'.
  
!     `L'
            The integer constant 1.
  
!     `M'
            The integer constant -1.
  
!     `N'
            The integer constant 0.
  
!     `O'
            Integer constants -4 through -1 and 1 through 4; shifts by
!           these amounts are handled as multiple single-bit shifts
!           rather than a single variable-length shift.
  
!     `Q'
            A memory reference which requires an additional word (address
            or offset) after the opcode.
  
!     `R'
            A memory reference that is encoded within the opcode.
  
! 
! _PowerPC and IBM RS6000--`config/rs6000/constraints.md'_
! 
!     `b'
            Address base register
  
!     `d'
            Floating point register (containing 64-bit value)
  
!     `f'
            Floating point register (containing 32-bit value)
  
!     `v'
            Altivec vector register
  
!     `wa'
            Any VSX register if the -mvsx option was used or NO_REGS.
  
!           When using any of the register constraints (`wa', `wd', `wf',
!           `wg', `wh', `wi', `wj', `wk', `wl', `wm', `ws', `wt', `wu',
!           `wv', `ww', or `wy') that take VSX registers, you must use
!           `%x<n>' in the template so that the correct register is used.
!           Otherwise the register number output in the assembly file
!           will be incorrect if an Altivec register is an operand of a
!           VSX instruction that expects VSX register numbering.
  
                 asm ("xvadddp %x0,%x1,%x2" : "=wa" (v1) : "wa" (v2), "wa" (v3));
  
--- 19873,21204 ----
  ------------------------------------------
  
  Whenever possible, you should use the general-purpose constraint letters
! in 'asm' arguments, since they will convey meaning more readily to
! people reading your code.  Failing that, use the constraint letters that
! usually have very similar meanings across architectures.  The most
! commonly used constraints are 'm' and 'r' (for memory and
  general-purpose registers respectively; *note Simple Constraints::), and
! 'I', usually the letter indicating the most common immediate-constant
  format.
  
   Each architecture defines additional constraints.  These constraints
  are used by the compiler itself for instruction generation, as well as
! for 'asm' statements; therefore, some of the constraints are not
! particularly useful for 'asm'.  Here is a summary of some of the
  machine-dependent constraints available on some particular machines; it
! includes both constraints that are useful for 'asm' and constraints that
! aren't.  The compiler source file mentioned in the table heading for
! each architecture is the definitive reference for the meanings of that
! architecture's constraints.
  
! _AArch64 family--'config/aarch64/constraints.md'_
!      'k'
!           The stack pointer register ('SP')
  
!      'w'
            Floating point or SIMD vector register
  
!      'I'
            Integer constant that is valid as an immediate operand in an
!           'ADD' instruction
  
!      'J'
            Integer constant that is valid as an immediate operand in a
!           'SUB' instruction (once negated)
  
!      'K'
            Integer constant that can be used with a 32-bit logical
            instruction
  
!      'L'
            Integer constant that can be used with a 64-bit logical
            instruction
  
!      'M'
            Integer constant that is valid as an immediate operand in a
!           32-bit 'MOV' pseudo instruction.  The 'MOV' may be assembled
            to one of several different machine instructions depending on
            the value
  
!      'N'
            Integer constant that is valid as an immediate operand in a
!           64-bit 'MOV' pseudo instruction
  
!      'S'
            An absolute symbolic address or a label reference
  
!      'Y'
            Floating point constant zero
  
!      'Z'
            Integer constant zero
  
!      'Ush'
!           The high part (bits 12 and upwards) of the pc-relative address
!           of a symbol within 4GB of the instruction
  
!      'Q'
            A memory address which uses a single base register with no
            offset
  
!      'Ump'
!           A memory address suitable for a load/store pair instruction in
!           SI, DI, SF and DF modes
  
! _ARC --'config/arc/constraints.md'_
!      'q'
!           Registers usable in ARCompact 16-bit instructions: 'r0'-'r3',
!           'r12'-'r15'.  This constraint can only match when the '-mq'
            option is in effect.
  
!      'e'
!           Registers usable as base-regs of memory addresses in ARCompact
!           16-bit memory instructions: 'r0'-'r3', 'r12'-'r15', 'sp'.
!           This constraint can only match when the '-mq' option is in
!           effect.
!      'D'
!           ARC FPX (dpfp) 64-bit registers.  'D0', 'D1'.
  
!      'I'
            A signed 12-bit integer constant.
  
!      'Cal'
!           constant for arithmetic/logical operations.  This might be any
!           constant that can be put into a long immediate by the assmbler
!           or linker without involving a PIC relocation.
  
!      'K'
            A 3-bit unsigned integer constant.
  
!      'L'
            A 6-bit unsigned integer constant.
  
!      'CnL'
            One's complement of a 6-bit unsigned integer constant.
  
!      'CmL'
            Two's complement of a 6-bit unsigned integer constant.
  
!      'M'
            A 5-bit unsigned integer constant.
  
!      'O'
            A 7-bit unsigned integer constant.
  
!      'P'
            A 8-bit unsigned integer constant.
  
!      'H'
            Any const_double value.
  
! _ARM family--'config/arm/constraints.md'_
  
!      'h'
!           In Thumb state, the core registers 'r8'-'r15'.
  
!      'k'
            The stack pointer register.
  
!      'l'
!           In Thumb State the core registers 'r0'-'r7'.  In ARM state
!           this is an alias for the 'r' constraint.
  
!      't'
!           VFP floating-point registers 's0'-'s31'.  Used for 32 bit
            values.
  
!      'w'
!           VFP floating-point registers 'd0'-'d31' and the appropriate
!           subset 'd0'-'d15' based on command line options.  Used for 64
            bit values only.  Not valid for Thumb1.
  
!      'y'
            The iWMMX co-processor registers.
  
!      'z'
            The iWMMX GR registers.
  
!      'G'
            The floating-point constant 0.0
  
!      'I'
            Integer that is valid as an immediate operand in a data
!           processing instruction.  That is, an integer in the range 0 to
!           255 rotated by a multiple of 2
  
!      'J'
            Integer in the range -4095 to 4095
  
!      'K'
!           Integer that satisfies constraint 'I' when inverted (ones
            complement)
  
!      'L'
!           Integer that satisfies constraint 'I' when negated (twos
            complement)
  
!      'M'
            Integer in the range 0 to 32
  
!      'Q'
            A memory reference where the exact address is in a single
!           register (''m'' is preferable for 'asm' statements)
  
!      'R'
            An item in the constant pool
  
!      'S'
            A symbol in the text segment of the current file
  
!      'Uv'
            A memory reference suitable for VFP load/store insns
            (reg+constant offset)
  
!      'Uy'
            A memory reference suitable for iWMMXt load/store
            instructions.
  
!      'Uq'
            A memory reference suitable for the ARMv4 ldrsb instruction.
  
! _AVR family--'config/avr/constraints.md'_
!      'l'
            Registers from r0 to r15
  
!      'a'
            Registers from r16 to r23
  
!      'd'
            Registers from r16 to r31
  
!      'w'
            Registers from r24 to r31.  These registers can be used in
!           'adiw' command
  
!      'e'
            Pointer register (r26-r31)
  
!      'b'
            Base pointer register (r28-r31)
  
!      'q'
            Stack pointer register (SPH:SPL)
  
!      't'
            Temporary register r0
  
!      'x'
            Register pair X (r27:r26)
  
!      'y'
            Register pair Y (r29:r28)
  
!      'z'
            Register pair Z (r31:r30)
  
!      'I'
            Constant greater than -1, less than 64
  
!      'J'
            Constant greater than -64, less than 1
  
!      'K'
            Constant integer 2
  
!      'L'
            Constant integer 0
  
!      'M'
            Constant that fits in 8 bits
  
!      'N'
            Constant integer -1
  
!      'O'
            Constant integer 8, 16, or 24
  
!      'P'
            Constant integer 1
  
!      'G'
            A floating point constant 0.0
  
!      'Q'
            A memory address based on Y or Z pointer with displacement.
  
! _Blackfin family--'config/bfin/constraints.md'_
!      'a'
            P register
  
!      'd'
            D register
  
!      'z'
            A call clobbered P register.
  
!      'qN'
            A single register.  If N is in the range 0 to 7, the
!           corresponding D register.  If it is 'A', then the register P0.
  
!      'D'
            Even-numbered D register
  
!      'W'
            Odd-numbered D register
  
!      'e'
            Accumulator register.
  
!      'A'
            Even-numbered accumulator register.
  
!      'B'
            Odd-numbered accumulator register.
  
!      'b'
            I register
  
!      'v'
            B register
  
!      'f'
            M register
  
!      'c'
!           Registers used for circular buffering, i.e.  I, B, or L
            registers.
  
!      'C'
            The CC register.
  
!      't'
            LT0 or LT1.
  
!      'k'
            LC0 or LC1.
  
!      'u'
            LB0 or LB1.
  
!      'x'
            Any D, P, B, M, I or L register.
  
!      'y'
            Additional registers typically used only in prologues and
            epilogues: RETS, RETN, RETI, RETX, RETE, ASTAT, SEQSTAT and
            USP.
  
!      'w'
            Any register except accumulators or CC.
  
!      'Ksh'
            Signed 16 bit integer (in the range -32768 to 32767)
  
!      'Kuh'
            Unsigned 16 bit integer (in the range 0 to 65535)
  
!      'Ks7'
            Signed 7 bit integer (in the range -64 to 63)
  
!      'Ku7'
            Unsigned 7 bit integer (in the range 0 to 127)
  
!      'Ku5'
            Unsigned 5 bit integer (in the range 0 to 31)
  
!      'Ks4'
            Signed 4 bit integer (in the range -8 to 7)
  
!      'Ks3'
            Signed 3 bit integer (in the range -3 to 4)
  
!      'Ku3'
            Unsigned 3 bit integer (in the range 0 to 7)
  
!      'PN'
            Constant N, where N is a single-digit constant in the range 0
            to 4.
  
!      'PA'
            An integer equal to one of the MACFLAG_XXX constants that is
            suitable for use with either accumulator.
  
!      'PB'
            An integer equal to one of the MACFLAG_XXX constants that is
            suitable for use only with accumulator A1.
  
!      'M1'
            Constant 255.
  
!      'M2'
            Constant 65535.
  
!      'J'
            An integer constant with exactly a single bit set.
  
!      'L'
            An integer constant with all bits set except exactly one.
  
!      'H'
  
!      'Q'
            Any SYMBOL_REF.
  
! _CR16 Architecture--'config/cr16/cr16.h'_
  
!      'b'
            Registers from r0 to r14 (registers without stack pointer)
  
!      't'
            Register from r0 to r11 (all 16-bit registers)
  
!      'p'
            Register from r12 to r15 (all 32-bit registers)
  
!      'I'
            Signed constant that fits in 4 bits
  
!      'J'
            Signed constant that fits in 5 bits
  
!      'K'
            Signed constant that fits in 6 bits
  
!      'L'
            Unsigned constant that fits in 4 bits
  
!      'M'
            Signed constant that fits in 32 bits
  
!      'N'
            Check for 64 bits wide constants for add/sub instructions
  
!      'G'
            Floating point constant that is legal for store immediate
  
! _Epiphany--'config/epiphany/constraints.md'_
!      'U16'
            An unsigned 16-bit constant.
  
!      'K'
            An unsigned 5-bit constant.
  
!      'L'
            A signed 11-bit constant.
  
!      'Cm1'
!           A signed 11-bit constant added to -1.  Can only match when the
!           '-m1reg-REG' option is active.
  
!      'Cl1'
            Left-shift of -1, i.e., a bit mask with a block of leading
            ones, the rest being a block of trailing zeroes.  Can only
!           match when the '-m1reg-REG' option is active.
  
!      'Cr1'
            Right-shift of -1, i.e., a bit mask with a trailing block of
            ones, the rest being zeroes.  Or to put it another way, one
            less than a power of two.  Can only match when the
!           '-m1reg-REG' option is active.
  
!      'Cal'
!           Constant for arithmetic/logical operations.  This is like 'i',
!           except that for position independent code, no symbols /
            expressions needing relocations are allowed.
  
!      'Csy'
            Symbolic constant for call/jump instruction.
  
!      'Rcs'
            The register class usable in short insns.  This is a register
            class constraint, and can thus drive register allocation.
!           This constraint won't match unless '-mprefer-short-insn-regs'
            is in effect.
  
!      'Rsc'
            The the register class of registers that can be used to hold a
            sibcall call address.  I.e., a caller-saved register.
  
!      'Rct'
            Core control register class.
  
!      'Rgs'
            The register group usable in short insns.  This constraint
            does not use a register class, so that it only passively
            matches suitable registers, and doesn't drive register
            allocation.
  
!      'Car'
            Constant suitable for the addsi3_r pattern.  This is a valid
            offset For byte, halfword, or word addressing.
  
!      'Rra'
!           Matches the return address if it can be replaced with the link
!           register.
  
!      'Rcc'
            Matches the integer condition code register.
  
!      'Sra'
            Matches the return address if it is in a stack slot.
  
!      'Cfm'
            Matches control register values to switch fp mode, which are
!           encapsulated in 'UNSPEC_FP_MODE'.
  
! _FRV--'config/frv/frv.h'_
!      'a'
!           Register in the class 'ACC_REGS' ('acc0' to 'acc7').
  
!      'b'
!           Register in the class 'EVEN_ACC_REGS' ('acc0' to 'acc7').
  
!      'c'
!           Register in the class 'CC_REGS' ('fcc0' to 'fcc3' and 'icc0'
!           to 'icc3').
  
!      'd'
!           Register in the class 'GPR_REGS' ('gr0' to 'gr63').
  
!      'e'
!           Register in the class 'EVEN_REGS' ('gr0' to 'gr63').  Odd
!           registers are excluded not in the class but through the use of
!           a machine mode larger than 4 bytes.
  
!      'f'
!           Register in the class 'FPR_REGS' ('fr0' to 'fr63').
  
!      'h'
!           Register in the class 'FEVEN_REGS' ('fr0' to 'fr63').  Odd
!           registers are excluded not in the class but through the use of
!           a machine mode larger than 4 bytes.
  
!      'l'
!           Register in the class 'LR_REG' (the 'lr' register).
  
!      'q'
!           Register in the class 'QUAD_REGS' ('gr2' to 'gr63').  Register
!           numbers not divisible by 4 are excluded not in the class but
!           through the use of a machine mode larger than 8 bytes.
  
!      't'
!           Register in the class 'ICC_REGS' ('icc0' to 'icc3').
  
!      'u'
!           Register in the class 'FCC_REGS' ('fcc0' to 'fcc3').
  
!      'v'
!           Register in the class 'ICR_REGS' ('cc4' to 'cc7').
  
!      'w'
!           Register in the class 'FCR_REGS' ('cc0' to 'cc3').
  
!      'x'
!           Register in the class 'QUAD_FPR_REGS' ('fr0' to 'fr63').
            Register numbers not divisible by 4 are excluded not in the
            class but through the use of a machine mode larger than 8
            bytes.
  
!      'z'
!           Register in the class 'SPR_REGS' ('lcr' and 'lr').
  
!      'A'
!           Register in the class 'QUAD_ACC_REGS' ('acc0' to 'acc7').
  
!      'B'
!           Register in the class 'ACCG_REGS' ('accg0' to 'accg7').
  
!      'C'
!           Register in the class 'CR_REGS' ('cc0' to 'cc7').
  
!      'G'
            Floating point constant zero
  
!      'I'
            6-bit signed integer constant
  
!      'J'
            10-bit signed integer constant
  
!      'L'
            16-bit signed integer constant
  
!      'M'
            16-bit unsigned integer constant
  
!      'N'
            12-bit signed integer constant that is negative--i.e. in the
            range of -2048 to -1
  
!      'O'
            Constant zero
  
!      'P'
!           12-bit signed integer constant that is greater than zero--i.e.
!           in the range of 1 to 2047.
  
! _Hewlett-Packard PA-RISC--'config/pa/pa.h'_
!      'a'
            General register 1
  
!      'f'
            Floating point register
  
!      'q'
            Shift amount register
  
!      'x'
            Floating point register (deprecated)
  
!      'y'
            Upper floating point register (32-bit), floating point
            register (64-bit)
  
!      'Z'
            Any register
  
!      'I'
            Signed 11-bit integer constant
  
!      'J'
            Signed 14-bit integer constant
  
!      'K'
!           Integer constant that can be deposited with a 'zdepi'
            instruction
  
!      'L'
            Signed 5-bit integer constant
  
!      'M'
            Integer constant 0
  
!      'N'
!           Integer constant that can be loaded with a 'ldil' instruction
  
!      'O'
            Integer constant whose value plus one is a power of 2
  
!      'P'
!           Integer constant that can be used for 'and' operations in
!           'depi' and 'extru' instructions
  
!      'S'
            Integer constant 31
  
!      'U'
            Integer constant 63
  
!      'G'
            Floating-point constant 0.0
  
!      'A'
!           A 'lo_sum' data-linkage-table memory operand
  
!      'Q'
            A memory operand that can be used as the destination operand
            of an integer store instruction
  
!      'R'
            A scaled or unscaled indexed memory operand
  
!      'T'
            A memory operand for floating-point loads and stores
  
!      'W'
            A register indirect memory operand
  
! _Intel IA-64--'config/ia64/ia64.h'_
!      'a'
!           General register 'r0' to 'r3' for 'addl' instruction
  
!      'b'
            Branch register
  
!      'c'
!           Predicate register ('c' as in "conditional")
  
!      'd'
            Application register residing in M-unit
  
!      'e'
            Application register residing in I-unit
  
!      'f'
            Floating-point register
  
!      'm'
!           Memory operand.  If used together with '<' or '>', the operand
!           can have postincrement and postdecrement which require
!           printing with '%Pn' on IA-64.
  
!      'G'
            Floating-point constant 0.0 or 1.0
  
!      'I'
            14-bit signed integer constant
  
!      'J'
            22-bit signed integer constant
  
!      'K'
            8-bit signed integer constant for logical instructions
  
!      'L'
            8-bit adjusted signed integer constant for compare pseudo-ops
  
!      'M'
            6-bit unsigned integer constant for shift counts
  
!      'N'
            9-bit signed integer constant for load and store
            postincrements
  
!      'O'
            The constant zero
  
!      'P'
!           0 or -1 for 'dep' instruction
  
!      'Q'
            Non-volatile memory for floating-point loads and stores
  
!      'R'
!           Integer constant in the range 1 to 4 for 'shladd' instruction
  
!      'S'
            Memory operand except postincrement and postdecrement.  This
!           is now roughly the same as 'm' when not used together with '<'
!           or '>'.
  
! _M32C--'config/m32c/m32c.c'_
!      'Rsp'
!      'Rfb'
!      'Rsb'
!           '$sp', '$fb', '$sb'.
  
!      'Rcr'
            Any control register, when they're 16 bits wide (nothing if
            control registers are 24 bits wide)
  
!      'Rcl'
            Any control register, when they're 24 bits wide.
  
!      'R0w'
!      'R1w'
!      'R2w'
!      'R3w'
            $r0, $r1, $r2, $r3.
  
!      'R02'
            $r0 or $r2, or $r2r0 for 32 bit values.
  
!      'R13'
            $r1 or $r3, or $r3r1 for 32 bit values.
  
!      'Rdi'
            A register that can hold a 64 bit value.
  
!      'Rhl'
            $r0 or $r1 (registers with addressable high/low bytes)
  
!      'R23'
            $r2 or $r3
  
!      'Raa'
            Address registers
  
!      'Raw'
            Address registers when they're 16 bits wide.
  
!      'Ral'
            Address registers when they're 24 bits wide.
  
!      'Rqi'
            Registers that can hold QI values.
  
!      'Rad'
            Registers that can be used with displacements ($a0, $a1, $sb).
  
!      'Rsi'
            Registers that can hold 32 bit values.
  
!      'Rhi'
            Registers that can hold 16 bit values.
  
!      'Rhc'
            Registers chat can hold 16 bit values, including all control
            registers.
  
!      'Rra'
            $r0 through R1, plus $a0 and $a1.
  
!      'Rfl'
            The flags register.
  
!      'Rmm'
            The memory-based pseudo-registers $mem0 through $mem15.
  
!      'Rpi'
            Registers that can hold pointers (16 bit registers for r8c,
            m16c; 24 bit registers for m32cm, m32c).
  
!      'Rpa'
            Matches multiple registers in a PARALLEL to form a larger
            register.  Used to match function return values.
  
!      'Is3'
            -8 ... 7
  
!      'IS1'
            -128 ... 127
  
!      'IS2'
            -32768 ... 32767
  
!      'IU2'
            0 ... 65535
  
!      'In4'
            -8 ... -1 or 1 ... 8
  
!      'In5'
            -16 ... -1 or 1 ... 16
  
!      'In6'
            -32 ... -1 or 1 ... 32
  
!      'IM2'
            -65536 ... -1
  
!      'Ilb'
            An 8 bit value with exactly one bit set.
  
!      'Ilw'
            A 16 bit value with exactly one bit set.
  
!      'Sd'
            The common src/dest memory addressing modes.
  
!      'Sa'
            Memory addressed using $a0 or $a1.
  
!      'Si'
            Memory addressed with immediate addresses.
  
!      'Ss'
            Memory addressed using the stack pointer ($sp).
  
!      'Sf'
            Memory addressed using the frame base register ($fb).
  
!      'Ss'
            Memory addressed using the small base register ($sb).
  
!      'S1'
            $r1h
  
! _MeP--'config/mep/constraints.md'_
  
!      'a'
            The $sp register.
  
!      'b'
            The $tp register.
  
!      'c'
            Any control register.
  
!      'd'
            Either the $hi or the $lo register.
  
!      'em'
            Coprocessor registers that can be directly loaded ($c0-$c15).
  
!      'ex'
            Coprocessor registers that can be moved to each other.
  
!      'er'
            Coprocessor registers that can be moved to core registers.
  
!      'h'
            The $hi register.
  
!      'j'
            The $rpc register.
  
!      'l'
            The $lo register.
  
!      't'
            Registers which can be used in $tp-relative addressing.
  
!      'v'
            The $gp register.
  
!      'x'
            The coprocessor registers.
  
!      'y'
            The coprocessor control registers.
  
!      'z'
            The $0 register.
  
!      'A'
            User-defined register set A.
  
!      'B'
            User-defined register set B.
  
!      'C'
            User-defined register set C.
  
!      'D'
            User-defined register set D.
  
!      'I'
            Offsets for $gp-rel addressing.
  
!      'J'
            Constants that can be used directly with boolean insns.
  
!      'K'
            Constants that can be moved directly to registers.
  
!      'L'
            Small constants that can be added to registers.
  
!      'M'
            Long shift counts.
  
!      'N'
            Small constants that can be compared to registers.
  
!      'O'
            Constants that can be loaded into the top half of registers.
  
!      'S'
            Signed 8-bit immediates.
  
!      'T'
            Symbols encoded for $tp-rel or $gp-rel addressing.
  
!      'U'
            Non-constant addresses for loading/saving coprocessor
            registers.
  
!      'W'
            The top half of a symbol's value.
  
!      'Y'
            A register indirect address without offset.
  
!      'Z'
            Symbolic references to the control bus.
  
+ _MicroBlaze--'config/microblaze/constraints.md'_
+      'd'
+           A general register ('r0' to 'r31').
  
!      'z'
!           A status register ('rmsr', '$fcc1' to '$fcc7').
  
! _MIPS--'config/mips/constraints.md'_
!      'd'
!           An address register.  This is equivalent to 'r' unless
            generating MIPS16 code.
  
!      'f'
            A floating-point register (if available).
  
!      'h'
!           Formerly the 'hi' register.  This constraint is no longer
            supported.
  
!      'l'
!           The 'lo' register.  Use this register to store values that are
            no bigger than a word.
  
!      'x'
!           The concatenated 'hi' and 'lo' registers.  Use this register
            to store doubleword values.
  
!      'c'
            A register suitable for use in an indirect jump.  This will
!           always be '$25' for '-mabicalls'.
  
!      'v'
!           Register '$3'.  Do not use this constraint in new code; it is
            retained only for compatibility with glibc.
  
!      'y'
!           Equivalent to 'r'; retained for backwards compatibility.
  
!      'z'
            A floating-point condition code register.
  
!      'I'
            A signed 16-bit constant (for arithmetic instructions).
  
!      'J'
            Integer zero.
  
!      'K'
            An unsigned 16-bit constant (for logic instructions).
  
!      'L'
            A signed 32-bit constant in which the lower 16 bits are zero.
!           Such constants can be loaded using 'lui'.
  
!      'M'
!           A constant that cannot be loaded using 'lui', 'addiu' or
!           'ori'.
  
!      'N'
            A constant in the range -65535 to -1 (inclusive).
  
!      'O'
            A signed 15-bit constant.
  
!      'P'
            A constant in the range 1 to 65535 (inclusive).
  
!      'G'
            Floating-point zero.
  
!      'R'
            An address that can be used in a non-macro load or store.
  
!      'ZC'
            A memory operand whose address is formed by a base register
            and offset that is suitable for use in instructions with the
!           same addressing mode as 'll' and 'sc'.
  
!      'ZD'
!           An address suitable for a 'prefetch' instruction, or for any
!           other instruction with the same addressing mode as 'prefetch'.
  
! _Motorola 680x0--'config/m68k/constraints.md'_
!      'a'
            Address register
  
!      'd'
            Data register
  
!      'f'
            68881 floating-point register, if available
  
!      'I'
            Integer in the range 1 to 8
  
!      'J'
            16-bit signed number
  
!      'K'
            Signed number whose magnitude is greater than 0x80
  
!      'L'
            Integer in the range -8 to -1
  
!      'M'
            Signed number whose magnitude is greater than 0x100
  
!      'N'
            Range 24 to 31, rotatert:SI 8 to 1 expressed as rotate
  
!      'O'
            16 (for rotate using swap)
  
!      'P'
            Range 8 to 15, rotatert:HI 8 to 1 expressed as rotate
  
!      'R'
            Numbers that mov3q can handle
  
!      'G'
            Floating point constant that is not a 68881 constant
  
!      'S'
            Operands that satisfy 'm' when -mpcrel is in effect
  
!      'T'
            Operands that satisfy 's' when -mpcrel is not in effect
  
!      'Q'
            Address register indirect addressing mode
  
!      'U'
            Register offset addressing
  
!      'W'
            const_call_operand
  
!      'Cs'
            symbol_ref or const
  
!      'Ci'
            const_int
  
!      'C0'
            const_int 0
  
!      'Cj'
            Range of signed numbers that don't fit in 16 bits
  
!      'Cmvq'
            Integers valid for mvq
  
!      'Capsw'
            Integers valid for a moveq followed by a swap
  
!      'Cmvz'
            Integers valid for mvz
  
!      'Cmvs'
            Integers valid for mvs
  
!      'Ap'
            push_operand
  
!      'Ac'
            Non-register operands allowed in clr
  
! _Moxie--'config/moxie/constraints.md'_
!      'A'
            An absolute address
  
!      'B'
            An offset address
  
!      'W'
            A register indirect memory operand
  
!      'I'
            A constant in the range of 0 to 255.
  
!      'N'
            A constant in the range of 0 to -255.
  
+ _MSP430-'config/msp430/constraints.md'_
  
!      'R12'
            Register R12.
  
!      'R13'
            Register R13.
  
!      'K'
            Integer constant 1.
  
!      'L'
            Integer constant -1^20..1^19.
  
!      'M'
            Integer constant 1-4.
  
!      'Ya'
            Memory references which do not require an extended MOVX
            instruction.
  
!      'Yl'
            Memory reference, labels only.
  
!      'Ys'
            Memory reference, stack only.
  
! _NDS32--'config/nds32/constraints.md'_
!      'w'
            LOW register class $r0 to $r7 constraint for V3/V3M ISA.
!      'l'
            LOW register class $r0 to $r7.
!      'd'
            MIDDLE register class $r0 to $r11, $r16 to $r19.
!      'h'
            HIGH register class $r12 to $r14, $r20 to $r31.
!      't'
            Temporary assist register $ta (i.e. $r15).
!      'k'
            Stack register $sp.
!      'Iu03'
            Unsigned immediate 3-bit value.
!      'In03'
            Negative immediate 3-bit value in the range of -7-0.
!      'Iu04'
            Unsigned immediate 4-bit value.
!      'Is05'
            Signed immediate 5-bit value.
!      'Iu05'
            Unsigned immediate 5-bit value.
!      'In05'
            Negative immediate 5-bit value in the range of -31-0.
!      'Ip05'
            Unsigned immediate 5-bit value for movpi45 instruction with
            range 16-47.
!      'Iu06'
            Unsigned immediate 6-bit value constraint for addri36.sp
            instruction.
!      'Iu08'
            Unsigned immediate 8-bit value.
!      'Iu09'
            Unsigned immediate 9-bit value.
!      'Is10'
            Signed immediate 10-bit value.
!      'Is11'
            Signed immediate 11-bit value.
!      'Is15'
            Signed immediate 15-bit value.
!      'Iu15'
            Unsigned immediate 15-bit value.
!      'Ic15'
!           A constant which is not in the range of imm15u but ok for bclr
!           instruction.
!      'Ie15'
!           A constant which is not in the range of imm15u but ok for bset
!           instruction.
!      'It15'
!           A constant which is not in the range of imm15u but ok for btgl
!           instruction.
!      'Ii15'
            A constant whose compliment value is in the range of imm15u
            and ok for bitci instruction.
!      'Is16'
            Signed immediate 16-bit value.
!      'Is17'
            Signed immediate 17-bit value.
!      'Is19'
            Signed immediate 19-bit value.
!      'Is20'
            Signed immediate 20-bit value.
!      'Ihig'
            The immediate value that can be simply set high 20-bit.
!      'Izeb'
            The immediate value 0xff.
!      'Izeh'
            The immediate value 0xffff.
!      'Ixls'
            The immediate value 0x01.
!      'Ix11'
            The immediate value 0x7ff.
!      'Ibms'
            The immediate value with power of 2.
!      'Ifex'
            The immediate value with power of 2 minus 1.
!      'U33'
            Memory constraint for 333 format.
!      'U45'
            Memory constraint for 45 format.
!      'U37'
            Memory constraint for 37 format.
  
! _Nios II family--'config/nios2/constraints.md'_
  
!      'I'
            Integer that is valid as an immediate operand in an
!           instruction taking a signed 16-bit number.  Range -32768 to
            32767.
  
!      'J'
            Integer that is valid as an immediate operand in an
!           instruction taking an unsigned 16-bit number.  Range 0 to
            65535.
  
!      'K'
            Integer that is valid as an immediate operand in an
            instruction taking only the upper 16-bits of a 32-bit number.
            Range 32-bit numbers with the lower 16-bits being 0.
  
!      'L'
            Integer that is valid as an immediate operand for a shift
!           instruction.  Range 0 to 31.
  
!      'M'
            Integer that is valid as an immediate operand for only the
!           value 0.  Can be used in conjunction with the format modifier
!           'z' to use 'r0' instead of '0' in the assembly output.
  
!      'N'
            Integer that is valid as an immediate operand for a custom
!           instruction opcode.  Range 0 to 255.
  
!      'S'
            Matches immediates which are addresses in the small data
!           section and therefore can be added to 'gp' as a 16-bit
            immediate to re-create their 32-bit value.
  
!      'T'
!           A 'const' wrapped 'UNSPEC' expression, representing a
            supported PIC or TLS relocation.
  
+ _PDP-11--'config/pdp11/constraints.md'_
+      'a'
+           Floating point registers AC0 through AC3.  These can be loaded
+           from/to memory with a single instruction.
  
!      'd'
            Odd numbered general registers (R1, R3, R5).  These are used
            for 16-bit multiply operations.
  
!      'f'
            Any of the floating point registers (AC0 through AC5).
  
!      'G'
            Floating point constant 0.
  
!      'I'
            An integer constant that fits in 16 bits.
  
!      'J'
            An integer constant whose low order 16 bits are zero.
  
!      'K'
            An integer constant that does not meet the constraints for
!           codes 'I' or 'J'.
  
!      'L'
            The integer constant 1.
  
!      'M'
            The integer constant -1.
  
!      'N'
            The integer constant 0.
  
!      'O'
            Integer constants -4 through -1 and 1 through 4; shifts by
!           these amounts are handled as multiple single-bit shifts rather
!           than a single variable-length shift.
  
!      'Q'
            A memory reference which requires an additional word (address
            or offset) after the opcode.
  
!      'R'
            A memory reference that is encoded within the opcode.
  
! _PowerPC and IBM RS6000--'config/rs6000/constraints.md'_
!      'b'
            Address base register
  
!      'd'
            Floating point register (containing 64-bit value)
  
!      'f'
            Floating point register (containing 32-bit value)
  
!      'v'
            Altivec vector register
  
!      'wa'
            Any VSX register if the -mvsx option was used or NO_REGS.
  
!           When using any of the register constraints ('wa', 'wd', 'wf',
!           'wg', 'wh', 'wi', 'wj', 'wk', 'wl', 'wm', 'ws', 'wt', 'wu',
!           'wv', 'ww', or 'wy') that take VSX registers, you must use
!           '%x<n>' in the template so that the correct register is used.
!           Otherwise the register number output in the assembly file will
!           be incorrect if an Altivec register is an operand of a VSX
!           instruction that expects VSX register numbering.
  
                 asm ("xvadddp %x0,%x1,%x2" : "=wa" (v1) : "wa" (v2), "wa" (v3));
  
*************** _PowerPC and IBM RS6000--`config/rs6000/
*** 21490,21632 ****
  
            is not correct.
  
!     `wd'
            VSX vector register to hold vector double data or NO_REGS.
  
!     `wf'
            VSX vector register to hold vector float data or NO_REGS.
  
!     `wg'
!           If `-mmfpgpr' was used, a floating point register or NO_REGS.
  
!     `wh'
            Floating point register if direct moves are available, or
            NO_REGS.
  
!     `wi'
            FP or VSX register to hold 64-bit integers for VSX insns or
            NO_REGS.
  
!     `wj'
!           FP or VSX register to hold 64-bit integers for direct moves
!           or NO_REGS.
  
!     `wk'
            FP or VSX register to hold 64-bit doubles for direct moves or
            NO_REGS.
  
!     `wl'
            Floating point register if the LFIWAX instruction is enabled
            or NO_REGS.
  
!     `wm'
            VSX register if direct move instructions are enabled, or
            NO_REGS.
  
!     `wn'
            No register (NO_REGS).
  
!     `wr'
!           General purpose register if 64-bit instructions are enabled
!           or NO_REGS.
  
!     `ws'
            VSX vector register to hold scalar double values or NO_REGS.
  
!     `wt'
            VSX vector register to hold 128 bit integer or NO_REGS.
  
!     `wu'
!           Altivec register to use for float/32-bit int loads/stores  or
            NO_REGS.
  
!     `wv'
!           Altivec register to use for double loads/stores  or NO_REGS.
  
!     `ww'
!           FP or VSX register to perform float operations under `-mvsx'
            or NO_REGS.
  
!     `wx'
            Floating point register if the STFIWX instruction is enabled
            or NO_REGS.
  
!     `wy'
            FP or VSX register to perform ISA 2.07 float ops or NO_REGS.
  
!     `wz'
            Floating point register if the LFIWZX instruction is enabled
            or NO_REGS.
  
!     `wD'
            Int constant that is the element number of the 64-bit scalar
            in a vector.
  
!     `wQ'
!           A memory address that will work with the `lq' and `stq'
            instructions.
  
!     `h'
!           `MQ', `CTR', or `LINK' register
  
!     `q'
!           `MQ' register
  
!     `c'
!           `CTR' register
  
!     `l'
!           `LINK' register
  
!     `x'
!           `CR' register (condition register) number 0
  
!     `y'
!           `CR' register (condition register)
  
!     `z'
!           `XER[CA]' carry bit (part of the XER register)
  
!     `I'
            Signed 16-bit constant
  
!     `J'
!           Unsigned 16-bit constant shifted left 16 bits (use `L'
!           instead for `SImode' constants)
  
!     `K'
            Unsigned 16-bit constant
  
!     `L'
            Signed 16-bit constant shifted left 16 bits
  
!     `M'
            Constant larger than 31
  
!     `N'
            Exact power of 2
  
!     `O'
            Zero
  
!     `P'
            Constant whose negation is a signed 16-bit constant
  
!     `G'
            Floating point constant that can be loaded into a register
            with one instruction per word
  
!     `H'
            Integer/Floating point constant that can be loaded into a
            register using three instructions
  
!     `m'
!           Memory operand.  Normally, `m' does not allow addresses that
!           update the base register.  If `<' or `>' constraint is also
            used, they are allowed and therefore on PowerPC targets in
!           that case it is only safe to use `m<>' in an `asm' statement
!           if that `asm' statement accesses the operand exactly once.
!           The `asm' statement must also use `%U<OPNO>' as a placeholder
            for the "update" flag in the corresponding load or store
            instruction.  For example:
  
--- 21208,21350 ----
  
            is not correct.
  
!      'wd'
            VSX vector register to hold vector double data or NO_REGS.
  
!      'wf'
            VSX vector register to hold vector float data or NO_REGS.
  
!      'wg'
!           If '-mmfpgpr' was used, a floating point register or NO_REGS.
  
!      'wh'
            Floating point register if direct moves are available, or
            NO_REGS.
  
!      'wi'
            FP or VSX register to hold 64-bit integers for VSX insns or
            NO_REGS.
  
!      'wj'
!           FP or VSX register to hold 64-bit integers for direct moves or
!           NO_REGS.
  
!      'wk'
            FP or VSX register to hold 64-bit doubles for direct moves or
            NO_REGS.
  
!      'wl'
            Floating point register if the LFIWAX instruction is enabled
            or NO_REGS.
  
!      'wm'
            VSX register if direct move instructions are enabled, or
            NO_REGS.
  
!      'wn'
            No register (NO_REGS).
  
!      'wr'
!           General purpose register if 64-bit instructions are enabled or
!           NO_REGS.
  
!      'ws'
            VSX vector register to hold scalar double values or NO_REGS.
  
!      'wt'
            VSX vector register to hold 128 bit integer or NO_REGS.
  
!      'wu'
!           Altivec register to use for float/32-bit int loads/stores or
            NO_REGS.
  
!      'wv'
!           Altivec register to use for double loads/stores or NO_REGS.
  
!      'ww'
!           FP or VSX register to perform float operations under '-mvsx'
            or NO_REGS.
  
!      'wx'
            Floating point register if the STFIWX instruction is enabled
            or NO_REGS.
  
!      'wy'
            FP or VSX register to perform ISA 2.07 float ops or NO_REGS.
  
!      'wz'
            Floating point register if the LFIWZX instruction is enabled
            or NO_REGS.
  
!      'wD'
            Int constant that is the element number of the 64-bit scalar
            in a vector.
  
!      'wQ'
!           A memory address that will work with the 'lq' and 'stq'
            instructions.
  
!      'h'
!           'MQ', 'CTR', or 'LINK' register
  
!      'q'
!           'MQ' register
  
!      'c'
!           'CTR' register
  
!      'l'
!           'LINK' register
  
!      'x'
!           'CR' register (condition register) number 0
  
!      'y'
!           'CR' register (condition register)
  
!      'z'
!           'XER[CA]' carry bit (part of the XER register)
  
!      'I'
            Signed 16-bit constant
  
!      'J'
!           Unsigned 16-bit constant shifted left 16 bits (use 'L' instead
!           for 'SImode' constants)
  
!      'K'
            Unsigned 16-bit constant
  
!      'L'
            Signed 16-bit constant shifted left 16 bits
  
!      'M'
            Constant larger than 31
  
!      'N'
            Exact power of 2
  
!      'O'
            Zero
  
!      'P'
            Constant whose negation is a signed 16-bit constant
  
!      'G'
            Floating point constant that can be loaded into a register
            with one instruction per word
  
!      'H'
            Integer/Floating point constant that can be loaded into a
            register using three instructions
  
!      'm'
!           Memory operand.  Normally, 'm' does not allow addresses that
!           update the base register.  If '<' or '>' constraint is also
            used, they are allowed and therefore on PowerPC targets in
!           that case it is only safe to use 'm<>' in an 'asm' statement
!           if that 'asm' statement accesses the operand exactly once.
!           The 'asm' statement must also use '%U<OPNO>' as a placeholder
            for the "update" flag in the corresponding load or store
            instruction.  For example:
  
*************** _PowerPC and IBM RS6000--`config/rs6000/
*** 21638,22426 ****
  
            is not.
  
!     `es'
!           A "stable" memory operand; that is, one which does not
!           include any automodification of the base register.  This used
!           to be useful when `m' allowed automodification of the base
!           register, but as those are now only allowed when `<' or `>'
!           is used, `es' is basically the same as `m' without `<' and
!           `>'.
  
!     `Q'
            Memory operand that is an offset from a register (it is
!           usually better to use `m' or `es' in `asm' statements)
  
!     `Z'
            Memory operand that is an indexed or indirect from a register
!           (it is usually better to use `m' or `es' in `asm' statements)
  
!     `R'
            AIX TOC entry
  
!     `a'
!           Address operand that is an indexed or indirect from a
!           register (`p' is preferable for `asm' statements)
  
!     `S'
            Constant suitable as a 64-bit mask operand
  
!     `T'
            Constant suitable as a 32-bit mask operand
  
!     `U'
            System V Release 4 small data area reference
  
!     `t'
            AND masks that can be performed by two rldic{l, r}
            instructions
  
!     `W'
            Vector constant that does not require memory
  
!     `j'
            Vector constant that is all zeros.
  
  
! _RL78--`config/rl78/constraints.md'_
! 
!     `Int3'
            An integer constant in the range 1 ... 7.
! 
!     `Int8'
            An integer constant in the range 0 ... 255.
! 
!     `J'
            An integer constant in the range -255 ... 0
! 
!     `K'
            The integer constant 1.
! 
!     `L'
            The integer constant -1.
! 
!     `M'
            The integer constant 0.
! 
!     `N'
            The integer constant 2.
! 
!     `O'
            The integer constant -2.
! 
!     `P'
            An integer constant in the range 1 ... 15.
! 
!     `Qbi'
            The built-in compare types-eq, ne, gtu, ltu, geu, and leu.
! 
!     `Qsc'
            The synthetic compare types-gt, lt, ge, and le.
! 
!     `Wab'
            A memory reference with an absolute address.
! 
!     `Wbc'
!           A memory reference using `BC' as a base register, with an
            optional offset.
! 
!     `Wca'
!           A memory reference using `AX', `BC', `DE', or `HL' for the
            address, for calls.
! 
!     `Wcv'
            A memory reference using any 16-bit register pair for the
            address, for calls.
! 
!     `Wd2'
!           A memory reference using `DE' as a base register, with an
            optional offset.
! 
!     `Wde'
!           A memory reference using `DE' as a base register, without any
            offset.
! 
!     `Wfr'
            Any memory reference to an address in the far address space.
! 
!     `Wh1'
!           A memory reference using `HL' as a base register, with an
            optional one-byte offset.
! 
!     `Whb'
!           A memory reference using `HL' as a base register, with `B' or
!           `C' as the index register.
! 
!     `Whl'
!           A memory reference using `HL' as a base register, without any
            offset.
! 
!     `Ws1'
!           A memory reference using `SP' as a base register, with an
            optional one-byte offset.
! 
!     `Y'
            Any memory reference to an address in the near address space.
! 
!     `A'
!           The `AX' register.
! 
!     `B'
!           The `BC' register.
! 
!     `D'
!           The `DE' register.
! 
!     `R'
!           `A' through `L' registers.
! 
!     `S'
!           The `SP' register.
! 
!     `T'
!           The `HL' register.
! 
!     `Z08W'
!           The 16-bit `R8' register.
! 
!     `Z10W'
!           The 16-bit `R10' register.
! 
!     `Zint'
!           The registers reserved for interrupts (`R24' to `R31').
! 
!     `a'
!           The `A' register.
! 
!     `b'
!           The `B' register.
! 
!     `c'
!           The `C' register.
! 
!     `d'
!           The `D' register.
! 
!     `e'
!           The `E' register.
! 
!     `h'
!           The `H' register.
! 
!     `l'
!           The `L' register.
! 
!     `v'
            The virtual registers.
  
!     `w'
!           The `PSW' register.
! 
!     `x'
!           The `X' register.
! 
! 
! _RX--`config/rx/constraints.md'_
! 
!     `Q'
!           An address which does not involve register indirect
!           addressing or pre/post increment/decrement addressing.
  
!     `Symbol'
            A symbol reference.
  
!     `Int08'
            A constant in the range -256 to 255, inclusive.
  
!     `Sint08'
            A constant in the range -128 to 127, inclusive.
  
!     `Sint16'
            A constant in the range -32768 to 32767, inclusive.
  
!     `Sint24'
            A constant in the range -8388608 to 8388607, inclusive.
  
!     `Uint04'
            A constant in the range 0 to 15, inclusive.
  
! 
! _S/390 and zSeries--`config/s390/s390.h'_
! 
!     `a'
            Address register (general purpose register except r0)
  
!     `c'
            Condition code register
  
!     `d'
            Data register (arbitrary general purpose register)
  
!     `f'
            Floating-point register
  
!     `I'
            Unsigned 8-bit constant (0-255)
  
!     `J'
            Unsigned 12-bit constant (0-4095)
  
!     `K'
            Signed 16-bit constant (-32768-32767)
  
!     `L'
            Value appropriate as displacement.
!          `(0..4095)'
                 for short displacement
! 
!          `(-524288..524287)'
                 for long displacement
  
!     `M'
            Constant integer with a value of 0x7fffffff.
  
!     `N'
            Multiple letter constraint followed by 4 parameter letters.
!          `0..9:'
                 number of the part counting from most to least
                 significant
! 
!          `H,Q:'
                 mode of the part
! 
!          `D,S,H:'
                 mode of the containing operand
! 
!          `0,F:'
                 value of the other parts (F--all bits set)
!           The constraint matches if the specified part of a constant
!           has a value different from its other parts.
  
!     `Q'
            Memory reference without index register and with short
            displacement.
  
!     `R'
            Memory reference with index register and short displacement.
  
!     `S'
            Memory reference without index register but with long
            displacement.
  
!     `T'
            Memory reference with index register and long displacement.
  
!     `U'
            Pointer with short displacement.
  
!     `W'
            Pointer with long displacement.
  
!     `Y'
            Shift count operand.
  
  
! _SPARC--`config/sparc/sparc.h'_
! 
!     `f'
!           Floating-point register on the SPARC-V8 architecture and
!           lower floating-point register on the SPARC-V9 architecture.
! 
!     `e'
!           Floating-point register.  It is equivalent to `f' on the
            SPARC-V8 architecture and contains both lower and upper
            floating-point registers on the SPARC-V9 architecture.
  
!     `c'
            Floating-point condition code register.
  
!     `d'
            Lower floating-point register.  It is only valid on the
            SPARC-V9 architecture when the Visual Instruction Set is
            available.
  
!     `b'
            Floating-point register.  It is only valid on the SPARC-V9
            architecture when the Visual Instruction Set is available.
  
!     `h'
            64-bit global or out register for the SPARC-V8+ architecture.
  
!     `C'
            The constant all-ones, for floating-point.
  
!     `A'
            Signed 5-bit constant
  
!     `D'
            A vector constant
  
!     `I'
            Signed 13-bit constant
  
!     `J'
            Zero
  
!     `K'
            32-bit constant with the low 12 bits clear (a constant that
!           can be loaded with the `sethi' instruction)
  
!     `L'
!           A constant in the range supported by `movcc' instructions
            (11-bit signed immediate)
  
!     `M'
!           A constant in the range supported by `movrcc' instructions
            (10-bit signed immediate)
  
!     `N'
!           Same as `K', except that it verifies that bits that are not
!           in the lower 32-bit range are all zero.  Must be used instead
!           of `K' for modes wider than `SImode'
  
!     `O'
            The constant 4096
  
!     `G'
            Floating-point zero
  
!     `H'
            Signed 13-bit constant, sign-extended to 32 or 64 bits
  
!     `P'
            The constant -1
  
!     `Q'
            Floating-point constant whose integral representation can be
            moved into an integer register using a single sethi
            instruction
  
!     `R'
            Floating-point constant whose integral representation can be
            moved into an integer register using a single mov instruction
  
!     `S'
            Floating-point constant whose integral representation can be
!           moved into an integer register using a high/lo_sum
!           instruction sequence
  
!     `T'
            Memory address aligned to an 8-byte boundary
  
!     `U'
            Even register
  
!     `W'
!           Memory address for `e' constraint registers
  
!     `w'
            Memory address with only a base register
  
!     `Y'
            Vector zero
  
! 
! _SPU--`config/spu/spu.h'_
! 
!     `a'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is treated as a 64 bit value.
  
!     `c'
            An immediate for and/xor/or instructions.  const_int is
            treated as a 64 bit value.
  
!     `d'
!           An immediate for the `iohl' instruction.  const_int is
!           treated as a 64 bit value.
  
!     `f'
!           An immediate which can be loaded with `fsmbi'.
  
!     `A'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is treated as a 32 bit value.
  
!     `B'
            An immediate for most arithmetic instructions.  const_int is
            treated as a 32 bit value.
  
!     `C'
            An immediate for and/xor/or instructions.  const_int is
            treated as a 32 bit value.
  
!     `D'
!           An immediate for the `iohl' instruction.  const_int is
!           treated as a 32 bit value.
  
!     `I'
            A constant in the range [-64, 63] for shift/rotate
            instructions.
  
!     `J'
            An unsigned 7-bit constant for conversion/nop/channel
            instructions.
  
!     `K'
            A signed 10-bit constant for most arithmetic instructions.
  
!     `M'
!           A signed 16 bit immediate for `stop'.
  
!     `N'
!           An unsigned 16-bit constant for `iohl' and `fsmbi'.
  
!     `O'
            An unsigned 7-bit constant whose 3 least significant bits are
            0.
  
!     `P'
            An unsigned 3-bit constant for 16-byte rotates and shifts
  
!     `R'
            Call operand, reg, for indirect calls
  
!     `S'
            Call operand, symbol, for relative calls.
  
!     `T'
            Call operand, const_int, for absolute calls.
  
!     `U'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is sign extended to 128 bit.
  
!     `W'
            An immediate for shift and rotate instructions.  const_int is
            treated as a 32 bit value.
  
!     `Y'
            An immediate for and/xor/or instructions.  const_int is sign
            extended as a 128 bit.
  
!     `Z'
!           An immediate for the `iohl' instruction.  const_int is sign
            extended to 128 bit.
  
! 
! _TI C6X family--`config/c6x/constraints.md'_
! 
!     `a'
            Register file A (A0-A31).
  
!     `b'
            Register file B (B0-B31).
  
!     `A'
            Predicate registers in register file A (A0-A2 on C64X and
            higher, A1 and A2 otherwise).
  
!     `B'
            Predicate registers in register file B (B0-B2).
  
!     `C'
            A call-used register in register file B (B0-B9, B16-B31).
  
!     `Da'
            Register file A, excluding predicate registers (A3-A31, plus
            A0 if not C64X or higher).
  
!     `Db'
            Register file B, excluding predicate registers (B3-B31).
  
!     `Iu4'
            Integer constant in the range 0 ... 15.
  
!     `Iu5'
            Integer constant in the range 0 ... 31.
  
!     `In5'
            Integer constant in the range -31 ... 0.
  
!     `Is5'
            Integer constant in the range -16 ... 15.
  
!     `I5x'
            Integer constant that can be the operand of an ADDA or a SUBA
            insn.
  
!     `IuB'
            Integer constant in the range 0 ... 65535.
  
!     `IsB'
            Integer constant in the range -32768 ... 32767.
  
!     `IsC'
!           Integer constant in the range -2^20 ... 2^20 - 1.
  
!     `Jc'
            Integer constant that is a valid mask for the clr instruction.
  
!     `Js'
            Integer constant that is a valid mask for the set instruction.
  
!     `Q'
            Memory location with A base register.
  
!     `R'
            Memory location with B base register.
  
!     `S0'
            On C64x+ targets, a GP-relative small data reference.
  
!     `S1'
!           Any kind of `SYMBOL_REF', for use in a call address.
  
!     `Si'
            Any kind of immediate operand, unless it matches the S0
            constraint.
  
!     `T'
            Memory location with B base register, but not using a long
            offset.
  
!     `W'
            A memory operand with an address that can't be used in an
            unaligned access.
  
!     `Z'
            Register B14 (aka DP).
  
! 
! _TILE-Gx--`config/tilegx/constraints.md'_
! 
!     `R00'
!     `R01'
!     `R02'
!     `R03'
!     `R04'
!     `R05'
!     `R06'
!     `R07'
!     `R08'
!     `R09'
!     `R10'
            Each of these represents a register constraint for an
            individual register, from r0 to r10.
  
!     `I'
            Signed 8-bit integer constant.
  
!     `J'
            Signed 16-bit integer constant.
  
!     `K'
            Unsigned 16-bit integer constant.
  
!     `L'
!           Integer constant that fits in one signed byte when
!           incremented by one (-129 ... 126).
  
!     `m'
!           Memory operand.  If used together with `<' or `>', the
!           operand can have postincrement which requires printing with
!           `%In' and `%in' on TILE-Gx.  For example:
  
                 asm ("st_add %I0,%1,%i0" : "=m<>" (*mem) : "r" (val));
  
!     `M'
            A bit mask suitable for the BFINS instruction.
  
!     `N'
            Integer constant that is a byte tiled out eight times.
  
!     `O'
            The integer zero constant.
  
!     `P'
            Integer constant that is a sign-extended byte tiled out as
            four shorts.
  
!     `Q'
            Integer constant that fits in one signed byte when incremented
            (-129 ... 126), but excluding -1.
  
!     `S'
            Integer constant that has all 1 bits consecutive and starting
            at bit 0.
  
!     `T'
            A 16-bit fragment of a got, tls, or pc-relative reference.
  
!     `U'
!           Memory operand except postincrement.  This is roughly the
!           same as `m' when not used together with `<' or `>'.
  
!     `W'
            An 8-element vector constant with identical elements.
  
!     `Y'
            A 4-element vector constant with identical elements.
  
!     `Z0'
            The integer constant 0xffffffff.
  
!     `Z1'
            The integer constant 0xffffffff00000000.
  
! 
! _TILEPro--`config/tilepro/constraints.md'_
! 
!     `R00'
!     `R01'
!     `R02'
!     `R03'
!     `R04'
!     `R05'
!     `R06'
!     `R07'
!     `R08'
!     `R09'
!     `R10'
            Each of these represents a register constraint for an
            individual register, from r0 to r10.
  
!     `I'
            Signed 8-bit integer constant.
  
!     `J'
            Signed 16-bit integer constant.
  
!     `K'
            Nonzero integer constant with low 16 bits zero.
  
!     `L'
!           Integer constant that fits in one signed byte when
!           incremented by one (-129 ... 126).
  
!     `m'
!           Memory operand.  If used together with `<' or `>', the
!           operand can have postincrement which requires printing with
!           `%In' and `%in' on TILEPro.  For example:
  
                 asm ("swadd %I0,%1,%i0" : "=m<>" (mem) : "r" (val));
  
!     `M'
            A bit mask suitable for the MM instruction.
  
!     `N'
            Integer constant that is a byte tiled out four times.
  
!     `O'
            The integer zero constant.
  
!     `P'
!           Integer constant that is a sign-extended byte tiled out as
!           two shorts.
  
!     `Q'
            Integer constant that fits in one signed byte when incremented
            (-129 ... 126), but excluding -1.
  
!     `T'
            A symbolic operand, or a 16-bit fragment of a got, tls, or
            pc-relative reference.
  
!     `U'
!           Memory operand except postincrement.  This is roughly the
!           same as `m' when not used together with `<' or `>'.
  
!     `W'
            A 4-element vector constant with identical elements.
  
!     `Y'
            A 2-element vector constant with identical elements.
  
  
! _Visium--`config/visium/constraints.md'_
! 
!     `b'
!           EAM register `mdb'
! 
!     `c'
!           EAM register `mdc'
  
!     `f'
            Floating point register
  
!     `k'
            Register for sibcall optimization
  
!     `l'
!           General register, but not `r29', `r30' and `r31'
  
!     `t'
!           Register `r1'
  
!     `u'
!           Register `r2'
  
!     `v'
!           Register `r3'
  
!     `G'
            Floating-point constant 0.0
  
!     `J'
!           Integer constant in the range 0 .. 65535 (16-bit immediate)
  
!     `K'
!           Integer constant in the range 1 .. 31 (5-bit immediate)
  
!     `L'
!           Integer constant in the range -65535 .. -1 (16-bit negative
            immediate)
  
!     `M'
            Integer constant -1
  
!     `O'
            Integer constant 0
  
!     `P'
            Integer constant 32
  
! _x86 family--`config/i386/constraints.md'_
! 
!     `R'
            Legacy register--the eight integer registers available on all
!           i386 processors (`a', `b', `c', `d', `si', `di', `bp', `sp').
  
!     `q'
!           Any register accessible as `Rl'.  In 32-bit mode, `a', `b',
!           `c', and `d'; in 64-bit mode, any integer register.
  
!     `Q'
!           Any register accessible as `Rh': `a', `b', `c', and `d'.
  
!     `l'
            Any register that can be used as the index in a base+index
            memory access: that is, any general register except the stack
            pointer.
  
!     `a'
!           The `a' register.
  
!     `b'
!           The `b' register.
  
!     `c'
!           The `c' register.
  
!     `d'
!           The `d' register.
  
!     `S'
!           The `si' register.
  
!     `D'
!           The `di' register.
  
!     `A'
!           The `a' and `d' registers.  This class is used for
!           instructions that return double word results in the `ax:dx'
!           register pair.  Single word values will be allocated either
!           in `ax' or `dx'.  For example on i386 the following
!           implements `rdtsc':
  
                 unsigned long long rdtsc (void)
                 {
--- 21356,22080 ----
  
            is not.
  
!      'es'
!           A "stable" memory operand; that is, one which does not include
!           any automodification of the base register.  This used to be
!           useful when 'm' allowed automodification of the base register,
!           but as those are now only allowed when '<' or '>' is used,
!           'es' is basically the same as 'm' without '<' and '>'.
  
!      'Q'
            Memory operand that is an offset from a register (it is
!           usually better to use 'm' or 'es' in 'asm' statements)
  
!      'Z'
            Memory operand that is an indexed or indirect from a register
!           (it is usually better to use 'm' or 'es' in 'asm' statements)
  
!      'R'
            AIX TOC entry
  
!      'a'
!           Address operand that is an indexed or indirect from a register
!           ('p' is preferable for 'asm' statements)
  
!      'S'
            Constant suitable as a 64-bit mask operand
  
!      'T'
            Constant suitable as a 32-bit mask operand
  
!      'U'
            System V Release 4 small data area reference
  
!      't'
            AND masks that can be performed by two rldic{l, r}
            instructions
  
!      'W'
            Vector constant that does not require memory
  
!      'j'
            Vector constant that is all zeros.
  
+ _RL78--'config/rl78/constraints.md'_
  
!      'Int3'
            An integer constant in the range 1 ... 7.
!      'Int8'
            An integer constant in the range 0 ... 255.
!      'J'
            An integer constant in the range -255 ... 0
!      'K'
            The integer constant 1.
!      'L'
            The integer constant -1.
!      'M'
            The integer constant 0.
!      'N'
            The integer constant 2.
!      'O'
            The integer constant -2.
!      'P'
            An integer constant in the range 1 ... 15.
!      'Qbi'
            The built-in compare types-eq, ne, gtu, ltu, geu, and leu.
!      'Qsc'
            The synthetic compare types-gt, lt, ge, and le.
!      'Wab'
            A memory reference with an absolute address.
!      'Wbc'
!           A memory reference using 'BC' as a base register, with an
            optional offset.
!      'Wca'
!           A memory reference using 'AX', 'BC', 'DE', or 'HL' for the
            address, for calls.
!      'Wcv'
            A memory reference using any 16-bit register pair for the
            address, for calls.
!      'Wd2'
!           A memory reference using 'DE' as a base register, with an
            optional offset.
!      'Wde'
!           A memory reference using 'DE' as a base register, without any
            offset.
!      'Wfr'
            Any memory reference to an address in the far address space.
!      'Wh1'
!           A memory reference using 'HL' as a base register, with an
            optional one-byte offset.
!      'Whb'
!           A memory reference using 'HL' as a base register, with 'B' or
!           'C' as the index register.
!      'Whl'
!           A memory reference using 'HL' as a base register, without any
            offset.
!      'Ws1'
!           A memory reference using 'SP' as a base register, with an
            optional one-byte offset.
!      'Y'
            Any memory reference to an address in the near address space.
!      'A'
!           The 'AX' register.
!      'B'
!           The 'BC' register.
!      'D'
!           The 'DE' register.
!      'R'
!           'A' through 'L' registers.
!      'S'
!           The 'SP' register.
!      'T'
!           The 'HL' register.
!      'Z08W'
!           The 16-bit 'R8' register.
!      'Z10W'
!           The 16-bit 'R10' register.
!      'Zint'
!           The registers reserved for interrupts ('R24' to 'R31').
!      'a'
!           The 'A' register.
!      'b'
!           The 'B' register.
!      'c'
!           The 'C' register.
!      'd'
!           The 'D' register.
!      'e'
!           The 'E' register.
!      'h'
!           The 'H' register.
!      'l'
!           The 'L' register.
!      'v'
            The virtual registers.
+      'w'
+           The 'PSW' register.
+      'x'
+           The 'X' register.
  
! _RX--'config/rx/constraints.md'_
!      'Q'
!           An address which does not involve register indirect addressing
!           or pre/post increment/decrement addressing.
  
!      'Symbol'
            A symbol reference.
  
!      'Int08'
            A constant in the range -256 to 255, inclusive.
  
!      'Sint08'
            A constant in the range -128 to 127, inclusive.
  
!      'Sint16'
            A constant in the range -32768 to 32767, inclusive.
  
!      'Sint24'
            A constant in the range -8388608 to 8388607, inclusive.
  
!      'Uint04'
            A constant in the range 0 to 15, inclusive.
  
! _S/390 and zSeries--'config/s390/s390.h'_
!      'a'
            Address register (general purpose register except r0)
  
!      'c'
            Condition code register
  
!      'd'
            Data register (arbitrary general purpose register)
  
!      'f'
            Floating-point register
  
!      'I'
            Unsigned 8-bit constant (0-255)
  
!      'J'
            Unsigned 12-bit constant (0-4095)
  
!      'K'
            Signed 16-bit constant (-32768-32767)
  
!      'L'
            Value appropriate as displacement.
!           '(0..4095)'
                 for short displacement
!           '(-524288..524287)'
                 for long displacement
  
!      'M'
            Constant integer with a value of 0x7fffffff.
  
!      'N'
            Multiple letter constraint followed by 4 parameter letters.
!           '0..9:'
                 number of the part counting from most to least
                 significant
!           'H,Q:'
                 mode of the part
!           'D,S,H:'
                 mode of the containing operand
!           '0,F:'
                 value of the other parts (F--all bits set)
!           The constraint matches if the specified part of a constant has
!           a value different from its other parts.
  
!      'Q'
            Memory reference without index register and with short
            displacement.
  
!      'R'
            Memory reference with index register and short displacement.
  
!      'S'
            Memory reference without index register but with long
            displacement.
  
!      'T'
            Memory reference with index register and long displacement.
  
!      'U'
            Pointer with short displacement.
  
!      'W'
            Pointer with long displacement.
  
!      'Y'
            Shift count operand.
  
+ _SPARC--'config/sparc/sparc.h'_
+      'f'
+           Floating-point register on the SPARC-V8 architecture and lower
+           floating-point register on the SPARC-V9 architecture.
  
!      'e'
!           Floating-point register.  It is equivalent to 'f' on the
            SPARC-V8 architecture and contains both lower and upper
            floating-point registers on the SPARC-V9 architecture.
  
!      'c'
            Floating-point condition code register.
  
!      'd'
            Lower floating-point register.  It is only valid on the
            SPARC-V9 architecture when the Visual Instruction Set is
            available.
  
!      'b'
            Floating-point register.  It is only valid on the SPARC-V9
            architecture when the Visual Instruction Set is available.
  
!      'h'
            64-bit global or out register for the SPARC-V8+ architecture.
  
!      'C'
            The constant all-ones, for floating-point.
  
!      'A'
            Signed 5-bit constant
  
!      'D'
            A vector constant
  
!      'I'
            Signed 13-bit constant
  
!      'J'
            Zero
  
!      'K'
            32-bit constant with the low 12 bits clear (a constant that
!           can be loaded with the 'sethi' instruction)
  
!      'L'
!           A constant in the range supported by 'movcc' instructions
            (11-bit signed immediate)
  
!      'M'
!           A constant in the range supported by 'movrcc' instructions
            (10-bit signed immediate)
  
!      'N'
!           Same as 'K', except that it verifies that bits that are not in
!           the lower 32-bit range are all zero.  Must be used instead of
!           'K' for modes wider than 'SImode'
  
!      'O'
            The constant 4096
  
!      'G'
            Floating-point zero
  
!      'H'
            Signed 13-bit constant, sign-extended to 32 or 64 bits
  
!      'P'
            The constant -1
  
!      'Q'
            Floating-point constant whose integral representation can be
            moved into an integer register using a single sethi
            instruction
  
!      'R'
            Floating-point constant whose integral representation can be
            moved into an integer register using a single mov instruction
  
!      'S'
            Floating-point constant whose integral representation can be
!           moved into an integer register using a high/lo_sum instruction
!           sequence
  
!      'T'
            Memory address aligned to an 8-byte boundary
  
!      'U'
            Even register
  
!      'W'
!           Memory address for 'e' constraint registers
  
!      'w'
            Memory address with only a base register
  
!      'Y'
            Vector zero
  
! _SPU--'config/spu/spu.h'_
!      'a'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is treated as a 64 bit value.
  
!      'c'
            An immediate for and/xor/or instructions.  const_int is
            treated as a 64 bit value.
  
!      'd'
!           An immediate for the 'iohl' instruction.  const_int is treated
!           as a 64 bit value.
  
!      'f'
!           An immediate which can be loaded with 'fsmbi'.
  
!      'A'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is treated as a 32 bit value.
  
!      'B'
            An immediate for most arithmetic instructions.  const_int is
            treated as a 32 bit value.
  
!      'C'
            An immediate for and/xor/or instructions.  const_int is
            treated as a 32 bit value.
  
!      'D'
!           An immediate for the 'iohl' instruction.  const_int is treated
!           as a 32 bit value.
  
!      'I'
            A constant in the range [-64, 63] for shift/rotate
            instructions.
  
!      'J'
            An unsigned 7-bit constant for conversion/nop/channel
            instructions.
  
!      'K'
            A signed 10-bit constant for most arithmetic instructions.
  
!      'M'
!           A signed 16 bit immediate for 'stop'.
  
!      'N'
!           An unsigned 16-bit constant for 'iohl' and 'fsmbi'.
  
!      'O'
            An unsigned 7-bit constant whose 3 least significant bits are
            0.
  
!      'P'
            An unsigned 3-bit constant for 16-byte rotates and shifts
  
!      'R'
            Call operand, reg, for indirect calls
  
!      'S'
            Call operand, symbol, for relative calls.
  
!      'T'
            Call operand, const_int, for absolute calls.
  
!      'U'
            An immediate which can be loaded with the il/ila/ilh/ilhu
            instructions.  const_int is sign extended to 128 bit.
  
!      'W'
            An immediate for shift and rotate instructions.  const_int is
            treated as a 32 bit value.
  
!      'Y'
            An immediate for and/xor/or instructions.  const_int is sign
            extended as a 128 bit.
  
!      'Z'
!           An immediate for the 'iohl' instruction.  const_int is sign
            extended to 128 bit.
  
! _TI C6X family--'config/c6x/constraints.md'_
!      'a'
            Register file A (A0-A31).
  
!      'b'
            Register file B (B0-B31).
  
!      'A'
            Predicate registers in register file A (A0-A2 on C64X and
            higher, A1 and A2 otherwise).
  
!      'B'
            Predicate registers in register file B (B0-B2).
  
!      'C'
            A call-used register in register file B (B0-B9, B16-B31).
  
!      'Da'
            Register file A, excluding predicate registers (A3-A31, plus
            A0 if not C64X or higher).
  
!      'Db'
            Register file B, excluding predicate registers (B3-B31).
  
!      'Iu4'
            Integer constant in the range 0 ... 15.
  
!      'Iu5'
            Integer constant in the range 0 ... 31.
  
!      'In5'
            Integer constant in the range -31 ... 0.
  
!      'Is5'
            Integer constant in the range -16 ... 15.
  
!      'I5x'
            Integer constant that can be the operand of an ADDA or a SUBA
            insn.
  
!      'IuB'
            Integer constant in the range 0 ... 65535.
  
!      'IsB'
            Integer constant in the range -32768 ... 32767.
  
!      'IsC'
!           Integer constant in the range -2^{20} ... 2^{20} - 1.
  
!      'Jc'
            Integer constant that is a valid mask for the clr instruction.
  
!      'Js'
            Integer constant that is a valid mask for the set instruction.
  
!      'Q'
            Memory location with A base register.
  
!      'R'
            Memory location with B base register.
  
!      'S0'
            On C64x+ targets, a GP-relative small data reference.
  
!      'S1'
!           Any kind of 'SYMBOL_REF', for use in a call address.
  
!      'Si'
            Any kind of immediate operand, unless it matches the S0
            constraint.
  
!      'T'
            Memory location with B base register, but not using a long
            offset.
  
!      'W'
            A memory operand with an address that can't be used in an
            unaligned access.
  
!      'Z'
            Register B14 (aka DP).
  
! _TILE-Gx--'config/tilegx/constraints.md'_
!      'R00'
!      'R01'
!      'R02'
!      'R03'
!      'R04'
!      'R05'
!      'R06'
!      'R07'
!      'R08'
!      'R09'
!      'R10'
            Each of these represents a register constraint for an
            individual register, from r0 to r10.
  
!      'I'
            Signed 8-bit integer constant.
  
!      'J'
            Signed 16-bit integer constant.
  
!      'K'
            Unsigned 16-bit integer constant.
  
!      'L'
!           Integer constant that fits in one signed byte when incremented
!           by one (-129 ... 126).
  
!      'm'
!           Memory operand.  If used together with '<' or '>', the operand
!           can have postincrement which requires printing with '%In' and
!           '%in' on TILE-Gx.  For example:
  
                 asm ("st_add %I0,%1,%i0" : "=m<>" (*mem) : "r" (val));
  
!      'M'
            A bit mask suitable for the BFINS instruction.
  
!      'N'
            Integer constant that is a byte tiled out eight times.
  
!      'O'
            The integer zero constant.
  
!      'P'
            Integer constant that is a sign-extended byte tiled out as
            four shorts.
  
!      'Q'
            Integer constant that fits in one signed byte when incremented
            (-129 ... 126), but excluding -1.
  
!      'S'
            Integer constant that has all 1 bits consecutive and starting
            at bit 0.
  
!      'T'
            A 16-bit fragment of a got, tls, or pc-relative reference.
  
!      'U'
!           Memory operand except postincrement.  This is roughly the same
!           as 'm' when not used together with '<' or '>'.
  
!      'W'
            An 8-element vector constant with identical elements.
  
!      'Y'
            A 4-element vector constant with identical elements.
  
!      'Z0'
            The integer constant 0xffffffff.
  
!      'Z1'
            The integer constant 0xffffffff00000000.
  
! _TILEPro--'config/tilepro/constraints.md'_
!      'R00'
!      'R01'
!      'R02'
!      'R03'
!      'R04'
!      'R05'
!      'R06'
!      'R07'
!      'R08'
!      'R09'
!      'R10'
            Each of these represents a register constraint for an
            individual register, from r0 to r10.
  
!      'I'
            Signed 8-bit integer constant.
  
!      'J'
            Signed 16-bit integer constant.
  
!      'K'
            Nonzero integer constant with low 16 bits zero.
  
!      'L'
!           Integer constant that fits in one signed byte when incremented
!           by one (-129 ... 126).
  
!      'm'
!           Memory operand.  If used together with '<' or '>', the operand
!           can have postincrement which requires printing with '%In' and
!           '%in' on TILEPro.  For example:
  
                 asm ("swadd %I0,%1,%i0" : "=m<>" (mem) : "r" (val));
  
!      'M'
            A bit mask suitable for the MM instruction.
  
!      'N'
            Integer constant that is a byte tiled out four times.
  
!      'O'
            The integer zero constant.
  
!      'P'
!           Integer constant that is a sign-extended byte tiled out as two
!           shorts.
  
!      'Q'
            Integer constant that fits in one signed byte when incremented
            (-129 ... 126), but excluding -1.
  
!      'T'
            A symbolic operand, or a 16-bit fragment of a got, tls, or
            pc-relative reference.
  
!      'U'
!           Memory operand except postincrement.  This is roughly the same
!           as 'm' when not used together with '<' or '>'.
  
!      'W'
            A 4-element vector constant with identical elements.
  
!      'Y'
            A 2-element vector constant with identical elements.
  
+ _Visium--'config/visium/constraints.md'_
+      'b'
+           EAM register 'mdb'
  
!      'c'
!           EAM register 'mdc'
  
!      'f'
            Floating point register
  
!      'k'
            Register for sibcall optimization
  
!      'l'
!           General register, but not 'r29', 'r30' and 'r31'
  
!      't'
!           Register 'r1'
  
!      'u'
!           Register 'r2'
  
!      'v'
!           Register 'r3'
  
!      'G'
            Floating-point constant 0.0
  
!      'J'
!           Integer constant in the range 0 ..  65535 (16-bit immediate)
  
!      'K'
!           Integer constant in the range 1 ..  31 (5-bit immediate)
  
!      'L'
!           Integer constant in the range -65535 ..  -1 (16-bit negative
            immediate)
  
!      'M'
            Integer constant -1
  
!      'O'
            Integer constant 0
  
!      'P'
            Integer constant 32
  
! _x86 family--'config/i386/constraints.md'_
!      'R'
            Legacy register--the eight integer registers available on all
!           i386 processors ('a', 'b', 'c', 'd', 'si', 'di', 'bp', 'sp').
  
!      'q'
!           Any register accessible as 'Rl'.  In 32-bit mode, 'a', 'b',
!           'c', and 'd'; in 64-bit mode, any integer register.
  
!      'Q'
!           Any register accessible as 'Rh': 'a', 'b', 'c', and 'd'.
  
!      'l'
            Any register that can be used as the index in a base+index
            memory access: that is, any general register except the stack
            pointer.
  
!      'a'
!           The 'a' register.
  
!      'b'
!           The 'b' register.
  
!      'c'
!           The 'c' register.
  
!      'd'
!           The 'd' register.
  
!      'S'
!           The 'si' register.
  
!      'D'
!           The 'di' register.
  
!      'A'
!           The 'a' and 'd' registers.  This class is used for
!           instructions that return double word results in the 'ax:dx'
!           register pair.  Single word values will be allocated either in
!           'ax' or 'dx'.  For example on i386 the following implements
!           'rdtsc':
  
                 unsigned long long rdtsc (void)
                 {
*************** _x86 family--`config/i386/constraints.md
*** 22430,22436 ****
                 }
  
            This is not correct on x86-64 as it would allocate tick in
!           either `ax' or `dx'.  You have to use the following variant
            instead:
  
                 unsigned long long rdtsc (void)
--- 22084,22090 ----
                 }
  
            This is not correct on x86-64 as it would allocate tick in
!           either 'ax' or 'dx'.  You have to use the following variant
            instead:
  
                 unsigned long long rdtsc (void)
*************** _x86 family--`config/i386/constraints.md
*** 22440,22657 ****
                   return ((unsigned long long)tickh << 32)|tickl;
                 }
  
!     `f'
            Any 80387 floating-point (stack) register.
  
!     `t'
!           Top of 80387 floating-point stack (`%st(0)').
  
!     `u'
!           Second from top of 80387 floating-point stack (`%st(1)').
  
!     `y'
            Any MMX register.
  
!     `x'
            Any SSE register.
  
!     `Yz'
!           First SSE register (`%xmm0').
  
!     `Y2'
            Any SSE register, when SSE2 is enabled.
  
!     `Yi'
            Any SSE register, when SSE2 and inter-unit moves are enabled.
  
!     `Ym'
            Any MMX register, when inter-unit moves are enabled.
  
!     `I'
            Integer constant in the range 0 ... 31, for 32-bit shifts.
  
!     `J'
            Integer constant in the range 0 ... 63, for 64-bit shifts.
  
!     `K'
            Signed 8-bit integer constant.
  
!     `L'
!           `0xFF' or `0xFFFF', for andsi as a zero-extending move.
  
!     `M'
!           0, 1, 2, or 3 (shifts for the `lea' instruction).
  
!     `N'
!           Unsigned 8-bit integer constant (for `in' and `out'
            instructions).
  
!     `O'
            Integer constant in the range 0 ... 127, for 128-bit shifts.
  
!     `G'
            Standard 80387 floating point constant.
  
!     `C'
            SSE constant zero operand.
  
!     `e'
            32-bit signed integer constant, or a symbolic reference known
            to fit that range (for immediate operands in sign-extending
            x86-64 instructions).
  
!     `Z'
            32-bit unsigned integer constant, or a symbolic reference
            known to fit that range (for immediate operands in
            zero-extending x86-64 instructions).
  
! 
! _Xstormy16--`config/stormy16/stormy16.h'_
! 
!     `a'
            Register r0.
  
!     `b'
            Register r1.
  
!     `c'
            Register r2.
  
!     `d'
            Register r8.
  
!     `e'
            Registers r0 through r7.
  
!     `t'
            Registers r0 and r1.
  
!     `y'
            The carry register.
  
!     `z'
            Registers r8 and r9.
  
!     `I'
            A constant between 0 and 3 inclusive.
  
!     `J'
            A constant that has exactly one bit set.
  
!     `K'
            A constant that has exactly one bit clear.
  
!     `L'
            A constant between 0 and 255 inclusive.
  
!     `M'
            A constant between -255 and 0 inclusive.
  
!     `N'
            A constant between -3 and 0 inclusive.
  
!     `O'
            A constant between 1 and 4 inclusive.
  
!     `P'
            A constant between -4 and -1 inclusive.
  
!     `Q'
            A memory reference that is a stack push.
  
!     `R'
            A memory reference that is a stack pop.
  
!     `S'
            A memory reference that refers to a constant address of known
            value.
  
!     `T'
            The register indicated by Rx (not implemented yet).
  
!     `U'
            A constant that is not between 2 and 15 inclusive.
  
!     `Z'
            The constant 0.
  
! 
! _Xtensa--`config/xtensa/constraints.md'_
! 
!     `a'
            General-purpose 32-bit register
  
!     `b'
            One-bit boolean register
  
!     `A'
            MAC16 40-bit accumulator register
  
!     `I'
            Signed 12-bit integer constant, for use in MOVI instructions
  
!     `J'
            Signed 8-bit integer constant, for use in ADDI instructions
  
!     `K'
            Integer constant valid for BccI instructions
  
!     `L'
            Unsigned constant valid for BccUI instructions
  
- 
- 
  
  File: gccint.info,  Node: Disable Insn Alternatives,  Next: Define Constraints,  Prev: Machine Constraints,  Up: Constraints
  
! 16.8.6 Disable insn alternatives using the `enabled' attribute
  --------------------------------------------------------------
  
  There are three insn attributes that may be used to selectively disable
  instruction alternatives:
  
! `enabled'
       Says whether an alternative is available on the current subtarget.
  
! `preferred_for_size'
       Says whether an enabled alternative should be used in code that is
       optimized for size.
  
! `preferred_for_speed'
       Says whether an enabled alternative should be used in code that is
       optimized for speed.
  
!  All these attributes should use `(const_int 1)' to allow an alternative
! or `(const_int 0)' to disallow it.  The attributes must be a static
! property of the subtarget; they cannot for example depend on the
! current operands, on the current optimization level, on the location of
! the insn within the body of a loop, on whether register allocation has
! finished, or on the current compiler pass.
  
!  The `enabled' attribute is a correctness property.  It tells GCC to act
  as though the disabled alternatives were never defined in the first
  place.  This is useful when adding new instructions to an existing
  pattern in cases where the new instructions are only available for
! certain cpu architecture levels (typically mapped to the `-march='
  command-line option).
  
!  In contrast, the `preferred_for_size' and `preferred_for_speed'
  attributes are strong optimization hints rather than correctness
! properties.  `preferred_for_size' tells GCC which alternatives to
  consider when adding or modifying an instruction that GCC wants to
! optimize for size.  `preferred_for_speed' does the same thing for
! speed.  Note that things like code motion can lead to cases where code
! optimized for size uses alternatives that are not preferred for size,
! and similarly for speed.
  
!  Although `define_insn's can in principle specify the `enabled'
  attribute directly, it is often clearer to have subsiduary attributes
! for each architectural feature of interest.  The `define_insn's can
! then use these subsiduary attributes to say which alternatives require
! which features.  The example below does this for `cpu_facility'.
  
!  E.g. the following two patterns could easily be merged using the
! `enabled' attribute:
  
  
       (define_insn "*movdi_old"
--- 22094,22305 ----
                   return ((unsigned long long)tickh << 32)|tickl;
                 }
  
!      'f'
            Any 80387 floating-point (stack) register.
  
!      't'
!           Top of 80387 floating-point stack ('%st(0)').
  
!      'u'
!           Second from top of 80387 floating-point stack ('%st(1)').
  
!      'y'
            Any MMX register.
  
!      'x'
            Any SSE register.
  
!      'Yz'
!           First SSE register ('%xmm0').
  
!      'Y2'
            Any SSE register, when SSE2 is enabled.
  
!      'Yi'
            Any SSE register, when SSE2 and inter-unit moves are enabled.
  
!      'Ym'
            Any MMX register, when inter-unit moves are enabled.
  
!      'I'
            Integer constant in the range 0 ... 31, for 32-bit shifts.
  
!      'J'
            Integer constant in the range 0 ... 63, for 64-bit shifts.
  
!      'K'
            Signed 8-bit integer constant.
  
!      'L'
!           '0xFF' or '0xFFFF', for andsi as a zero-extending move.
  
!      'M'
!           0, 1, 2, or 3 (shifts for the 'lea' instruction).
  
!      'N'
!           Unsigned 8-bit integer constant (for 'in' and 'out'
            instructions).
  
!      'O'
            Integer constant in the range 0 ... 127, for 128-bit shifts.
  
!      'G'
            Standard 80387 floating point constant.
  
!      'C'
            SSE constant zero operand.
  
!      'e'
            32-bit signed integer constant, or a symbolic reference known
            to fit that range (for immediate operands in sign-extending
            x86-64 instructions).
  
!      'Z'
            32-bit unsigned integer constant, or a symbolic reference
            known to fit that range (for immediate operands in
            zero-extending x86-64 instructions).
  
! _Xstormy16--'config/stormy16/stormy16.h'_
!      'a'
            Register r0.
  
!      'b'
            Register r1.
  
!      'c'
            Register r2.
  
!      'd'
            Register r8.
  
!      'e'
            Registers r0 through r7.
  
!      't'
            Registers r0 and r1.
  
!      'y'
            The carry register.
  
!      'z'
            Registers r8 and r9.
  
!      'I'
            A constant between 0 and 3 inclusive.
  
!      'J'
            A constant that has exactly one bit set.
  
!      'K'
            A constant that has exactly one bit clear.
  
!      'L'
            A constant between 0 and 255 inclusive.
  
!      'M'
            A constant between -255 and 0 inclusive.
  
!      'N'
            A constant between -3 and 0 inclusive.
  
!      'O'
            A constant between 1 and 4 inclusive.
  
!      'P'
            A constant between -4 and -1 inclusive.
  
!      'Q'
            A memory reference that is a stack push.
  
!      'R'
            A memory reference that is a stack pop.
  
!      'S'
            A memory reference that refers to a constant address of known
            value.
  
!      'T'
            The register indicated by Rx (not implemented yet).
  
!      'U'
            A constant that is not between 2 and 15 inclusive.
  
!      'Z'
            The constant 0.
  
! _Xtensa--'config/xtensa/constraints.md'_
!      'a'
            General-purpose 32-bit register
  
!      'b'
            One-bit boolean register
  
!      'A'
            MAC16 40-bit accumulator register
  
!      'I'
            Signed 12-bit integer constant, for use in MOVI instructions
  
!      'J'
            Signed 8-bit integer constant, for use in ADDI instructions
  
!      'K'
            Integer constant valid for BccI instructions
  
!      'L'
            Unsigned constant valid for BccUI instructions
  
  
  File: gccint.info,  Node: Disable Insn Alternatives,  Next: Define Constraints,  Prev: Machine Constraints,  Up: Constraints
  
! 16.8.6 Disable insn alternatives using the 'enabled' attribute
  --------------------------------------------------------------
  
  There are three insn attributes that may be used to selectively disable
  instruction alternatives:
  
! 'enabled'
       Says whether an alternative is available on the current subtarget.
  
! 'preferred_for_size'
       Says whether an enabled alternative should be used in code that is
       optimized for size.
  
! 'preferred_for_speed'
       Says whether an enabled alternative should be used in code that is
       optimized for speed.
  
!  All these attributes should use '(const_int 1)' to allow an alternative
! or '(const_int 0)' to disallow it.  The attributes must be a static
! property of the subtarget; they cannot for example depend on the current
! operands, on the current optimization level, on the location of the insn
! within the body of a loop, on whether register allocation has finished,
! or on the current compiler pass.
  
!  The 'enabled' attribute is a correctness property.  It tells GCC to act
  as though the disabled alternatives were never defined in the first
  place.  This is useful when adding new instructions to an existing
  pattern in cases where the new instructions are only available for
! certain cpu architecture levels (typically mapped to the '-march='
  command-line option).
  
!  In contrast, the 'preferred_for_size' and 'preferred_for_speed'
  attributes are strong optimization hints rather than correctness
! properties.  'preferred_for_size' tells GCC which alternatives to
  consider when adding or modifying an instruction that GCC wants to
! optimize for size.  'preferred_for_speed' does the same thing for speed.
! Note that things like code motion can lead to cases where code optimized
! for size uses alternatives that are not preferred for size, and
! similarly for speed.
  
!  Although 'define_insn's can in principle specify the 'enabled'
  attribute directly, it is often clearer to have subsiduary attributes
! for each architectural feature of interest.  The 'define_insn's can then
! use these subsiduary attributes to say which alternatives require which
! features.  The example below does this for 'cpu_facility'.
  
!  E.g.  the following two patterns could easily be merged using the
! 'enabled' attribute:
  
  
       (define_insn "*movdi_old"
*************** which features.  The example below does
*** 22669,22674 ****
--- 22317,22323 ----
          ldgr %0,%1
          lgdr %0,%1")
  
+ 
   to:
  
  
*************** which features.  The example below does
*** 22682,22688 ****
          lgdr %0,%1"
         [(set_attr "cpu_facility" "*,new,new")])
  
!  with the `enabled' attribute defined like this:
  
  
       (define_attr "cpu_facility" "standard,new" (const_string "standard"))
--- 22331,22338 ----
          lgdr %0,%1"
         [(set_attr "cpu_facility" "*,new,new")])
  
! 
!  with the 'enabled' attribute defined like this:
  
  
       (define_attr "cpu_facility" "standard,new" (const_string "standard"))
*************** which features.  The example below does
*** 22694,22699 ****
--- 22344,22350 ----
                (const_int 1)]
               (const_int 0)))
  
+ 
  
  File: gccint.info,  Node: Define Constraints,  Next: C Constraint Interface,  Prev: Disable Insn Alternatives,  Up: Constraints
  
*************** File: gccint.info,  Node: Define Constra
*** 22701,22721 ****
  --------------------------------------------
  
  Machine-specific constraints fall into two categories: register and
! non-register constraints.  Within the latter category, constraints
! which allow subsets of all possible memory or address operands should
! be specially marked, to give `reload' more information.
  
   Machine-specific constraints can be given names of arbitrary length,
  but they must be entirely composed of letters, digits, underscores
! (`_'), and angle brackets (`< >').  Like C identifiers, they must begin
  with a letter or underscore.
  
   In order to avoid ambiguity in operand constraint strings, no
! constraint can have a name that begins with any other constraint's
! name.  For example, if `x' is defined as a constraint name, `xy' may
! not be, and vice versa.  As a consequence of this rule, no constraint
! may begin with one of the generic constraint letters: `E F V X g i m n
! o p r s'.
  
   Register constraints correspond directly to register classes.  *Note
  Register Classes::.  There is thus not much flexibility in their
--- 22352,22371 ----
  --------------------------------------------
  
  Machine-specific constraints fall into two categories: register and
! non-register constraints.  Within the latter category, constraints which
! allow subsets of all possible memory or address operands should be
! specially marked, to give 'reload' more information.
  
   Machine-specific constraints can be given names of arbitrary length,
  but they must be entirely composed of letters, digits, underscores
! ('_'), and angle brackets ('< >').  Like C identifiers, they must begin
  with a letter or underscore.
  
   In order to avoid ambiguity in operand constraint strings, no
! constraint can have a name that begins with any other constraint's name.
! For example, if 'x' is defined as a constraint name, 'xy' may not be,
! and vice versa.  As a consequence of this rule, no constraint may begin
! with one of the generic constraint letters: 'E F V X g i m n o p r s'.
  
   Register constraints correspond directly to register classes.  *Note
  Register Classes::.  There is thus not much flexibility in their
*************** definitions.
*** 22723,22738 ****
  
   -- MD Expression: define_register_constraint name regclass docstring
       All three arguments are string constants.  NAME is the name of the
!      constraint, as it will appear in `match_operand' expressions.  If
       NAME is a multi-letter constraint its length shall be the same for
       all constraints starting with the same letter.  REGCLASS can be
!      either the name of the corresponding register class (*note
!      Register Classes::), or a C expression which evaluates to the
!      appropriate register class.  If it is an expression, it must have
!      no side effects, and it cannot look at the operand.  The usual use
!      of expressions is to map some register constraints to `NO_REGS'
!      when the register class is not available on a given
!      subarchitecture.
  
       DOCSTRING is a sentence documenting the meaning of the constraint.
       Docstrings are explained further below.
--- 22373,22387 ----
  
   -- MD Expression: define_register_constraint name regclass docstring
       All three arguments are string constants.  NAME is the name of the
!      constraint, as it will appear in 'match_operand' expressions.  If
       NAME is a multi-letter constraint its length shall be the same for
       all constraints starting with the same letter.  REGCLASS can be
!      either the name of the corresponding register class (*note Register
!      Classes::), or a C expression which evaluates to the appropriate
!      register class.  If it is an expression, it must have no side
!      effects, and it cannot look at the operand.  The usual use of
!      expressions is to map some register constraints to 'NO_REGS' when
!      the register class is not available on a given subarchitecture.
  
       DOCSTRING is a sentence documenting the meaning of the constraint.
       Docstrings are explained further below.
*************** constraint matches.
*** 22743,22847 ****
  
   -- MD Expression: define_constraint name docstring exp
       The NAME and DOCSTRING arguments are the same as for
!      `define_register_constraint', but note that the docstring comes
       immediately after the name for these expressions.  EXP is an RTL
       expression, obeying the same rules as the RTL expressions in
       predicate definitions.  *Note Defining Predicates::, for details.
       If it evaluates true, the constraint matches; if it evaluates
!      false, it doesn't. Constraint expressions should indicate which
       RTL codes they might match, just like predicate expressions.
  
!      `match_test' C expressions have access to the following variables:
  
!     OP
            The RTL object defining the operand.
! 
!     MODE
            The machine mode of OP.
! 
!     IVAL
!           `INTVAL (OP)', if OP is a `const_int'.
! 
!     HVAL
!           `CONST_DOUBLE_HIGH (OP)', if OP is an integer `const_double'.
! 
!     LVAL
!           `CONST_DOUBLE_LOW (OP)', if OP is an integer `const_double'.
! 
!     RVAL
!           `CONST_DOUBLE_REAL_VALUE (OP)', if OP is a floating-point
!           `const_double'.
  
       The *VAL variables should only be used once another piece of the
       expression has verified that OP is the appropriate kind of RTL
       object.
  
   Most non-register constraints should be defined with
! `define_constraint'.  The remaining two definition expressions are only
! appropriate for constraints that should be handled specially by
! `reload' if they fail to match.
  
   -- MD Expression: define_memory_constraint name docstring exp
       Use this expression for constraints that match a subset of all
!      memory operands: that is, `reload' can make them match by
!      converting the operand to the form `(mem (reg X))', where X is a
       base register (from the register class specified by
!      `BASE_REG_CLASS', *note Register Classes::).
  
       For example, on the S/390, some instructions do not accept
!      arbitrary memory references, but only those that do not make use
!      of an index register.  The constraint letter `Q' is defined to
!      represent a memory address of this type.  If `Q' is defined with
!      `define_memory_constraint', a `Q' constraint can handle any memory
!      operand, because `reload' knows it can simply copy the memory
!      address into a base register if required.  This is analogous to
!      the way an `o' constraint can handle any memory operand.
  
       The syntax and semantics are otherwise identical to
!      `define_constraint'.
  
   -- MD Expression: define_address_constraint name docstring exp
       Use this expression for constraints that match a subset of all
!      address operands: that is, `reload' can make the constraint match
!      by converting the operand to the form `(reg X)', again with X a
       base register.
  
!      Constraints defined with `define_address_constraint' can only be
!      used with the `address_operand' predicate, or machine-specific
       predicates that work the same way.  They are treated analogously to
!      the generic `p' constraint.
  
       The syntax and semantics are otherwise identical to
!      `define_constraint'.
  
!  For historical reasons, names beginning with the letters `G H' are
! reserved for constraints that match only `const_double's, and names
! beginning with the letters `I J K L M N O P' are reserved for
! constraints that match only `const_int's.  This may change in the
  future.  For the time being, constraints with these names must be
! written in a stylized form, so that `genpreds' can tell you did it
  correctly:
  
       (define_constraint "[GHIJKLMNOP]..."
         "DOC..."
!        (and (match_code "const_int")  ; `const_double' for G/H
!             CONDITION...))            ; usually a `match_test'
  
   It is fine to use names beginning with other letters for constraints
! that match `const_double's or `const_int's.
  
   Each docstring in a constraint definition should be one or more
  complete sentences, marked up in Texinfo format.  _They are currently
! unused._ In the future they will be copied into the GCC manual, in
  *note Machine Constraints::, replacing the hand-maintained tables
  currently found in that section.  Also, in the future the compiler may
! use this to give more helpful diagnostics when poor choice of `asm'
  constraints causes a reload failure.
  
!  If you put the pseudo-Texinfo directive `@internal' at the beginning
! of a docstring, then (in the future) it will appear only in the
! internals manual's version of the machine-specific constraint tables.
! Use this for constraints that should not appear in `asm' statements.
  
  
  File: gccint.info,  Node: C Constraint Interface,  Prev: Define Constraints,  Up: Constraints
--- 22392,22491 ----
  
   -- MD Expression: define_constraint name docstring exp
       The NAME and DOCSTRING arguments are the same as for
!      'define_register_constraint', but note that the docstring comes
       immediately after the name for these expressions.  EXP is an RTL
       expression, obeying the same rules as the RTL expressions in
       predicate definitions.  *Note Defining Predicates::, for details.
       If it evaluates true, the constraint matches; if it evaluates
!      false, it doesn't.  Constraint expressions should indicate which
       RTL codes they might match, just like predicate expressions.
  
!      'match_test' C expressions have access to the following variables:
  
!      OP
            The RTL object defining the operand.
!      MODE
            The machine mode of OP.
!      IVAL
!           'INTVAL (OP)', if OP is a 'const_int'.
!      HVAL
!           'CONST_DOUBLE_HIGH (OP)', if OP is an integer 'const_double'.
!      LVAL
!           'CONST_DOUBLE_LOW (OP)', if OP is an integer 'const_double'.
!      RVAL
!           'CONST_DOUBLE_REAL_VALUE (OP)', if OP is a floating-point
!           'const_double'.
  
       The *VAL variables should only be used once another piece of the
       expression has verified that OP is the appropriate kind of RTL
       object.
  
   Most non-register constraints should be defined with
! 'define_constraint'.  The remaining two definition expressions are only
! appropriate for constraints that should be handled specially by 'reload'
! if they fail to match.
  
   -- MD Expression: define_memory_constraint name docstring exp
       Use this expression for constraints that match a subset of all
!      memory operands: that is, 'reload' can make them match by
!      converting the operand to the form '(mem (reg X))', where X is a
       base register (from the register class specified by
!      'BASE_REG_CLASS', *note Register Classes::).
  
       For example, on the S/390, some instructions do not accept
!      arbitrary memory references, but only those that do not make use of
!      an index register.  The constraint letter 'Q' is defined to
!      represent a memory address of this type.  If 'Q' is defined with
!      'define_memory_constraint', a 'Q' constraint can handle any memory
!      operand, because 'reload' knows it can simply copy the memory
!      address into a base register if required.  This is analogous to the
!      way an 'o' constraint can handle any memory operand.
  
       The syntax and semantics are otherwise identical to
!      'define_constraint'.
  
   -- MD Expression: define_address_constraint name docstring exp
       Use this expression for constraints that match a subset of all
!      address operands: that is, 'reload' can make the constraint match
!      by converting the operand to the form '(reg X)', again with X a
       base register.
  
!      Constraints defined with 'define_address_constraint' can only be
!      used with the 'address_operand' predicate, or machine-specific
       predicates that work the same way.  They are treated analogously to
!      the generic 'p' constraint.
  
       The syntax and semantics are otherwise identical to
!      'define_constraint'.
  
!  For historical reasons, names beginning with the letters 'G H' are
! reserved for constraints that match only 'const_double's, and names
! beginning with the letters 'I J K L M N O P' are reserved for
! constraints that match only 'const_int's.  This may change in the
  future.  For the time being, constraints with these names must be
! written in a stylized form, so that 'genpreds' can tell you did it
  correctly:
  
       (define_constraint "[GHIJKLMNOP]..."
         "DOC..."
!        (and (match_code "const_int")  ; 'const_double' for G/H
!             CONDITION...))            ; usually a 'match_test'
  
   It is fine to use names beginning with other letters for constraints
! that match 'const_double's or 'const_int's.
  
   Each docstring in a constraint definition should be one or more
  complete sentences, marked up in Texinfo format.  _They are currently
! unused._  In the future they will be copied into the GCC manual, in
  *note Machine Constraints::, replacing the hand-maintained tables
  currently found in that section.  Also, in the future the compiler may
! use this to give more helpful diagnostics when poor choice of 'asm'
  constraints causes a reload failure.
  
!  If you put the pseudo-Texinfo directive '@internal' at the beginning of
! a docstring, then (in the future) it will appear only in the internals
! manual's version of the machine-specific constraint tables.  Use this
! for constraints that should not appear in 'asm' statements.
  
  
  File: gccint.info,  Node: C Constraint Interface,  Prev: Define Constraints,  Up: Constraints
*************** File: gccint.info,  Node: C Constraint I
*** 22850,22909 ****
  ---------------------------------
  
  It is occasionally useful to test a constraint from C code rather than
! implicitly via the constraint string in a `match_operand'.  The
! generated file `tm_p.h' declares a few interfaces for working with
  constraints.  At present these are defined for all constraints except
! `g' (which is equivalent to `general_operand').
  
   Some valid constraint names are not valid C identifiers, so there is a
  mangling scheme for referring to them from C.  Constraint names that do
  not contain angle brackets or underscores are left unchanged.
! Underscores are doubled, each `<' is replaced with `_l', and each `>'
! with `_g'.  Here are some examples:
  
!      *Original* *Mangled*
!      `x'        `x'
!      `P42x'     `P42x'
!      `P4_x'     `P4__x'
!      `P4>x'     `P4_gx'
!      `P4>>'     `P4_g_g'
!      `P4_g>'    `P4__g_g'
  
   Throughout this section, the variable C is either a constraint in the
! abstract sense, or a constant from `enum constraint_num'; the variable
! M is a mangled constraint name (usually as part of a larger identifier).
  
   -- Enum: constraint_num
!      For each constraint except `g', there is a corresponding
!      enumeration constant: `CONSTRAINT_' plus the mangled name of the
!      constraint.  Functions that take an `enum constraint_num' as an
       argument expect one of these constants.
  
   -- Function: inline bool satisfies_constraint_M (rtx EXP)
!      For each non-register constraint M except `g', there is one of
!      these functions; it returns `true' if EXP satisfies the
!      constraint.  These functions are only visible if `rtl.h' was
!      included before `tm_p.h'.
  
   -- Function: bool constraint_satisfied_p (rtx EXP, enum constraint_num
            C)
!      Like the `satisfies_constraint_M' functions, but the constraint to
       test is given as an argument, C.  If C specifies a register
!      constraint, this function will always return `false'.
  
   -- Function: enum reg_class reg_class_for_constraint (enum
            constraint_num C)
       Returns the register class associated with C.  If C is not a
       register constraint, or those registers are not available for the
!      currently selected subtarget, returns `NO_REGS'.
  
!  Here is an example use of `satisfies_constraint_M'.  In peephole
! optimizations (*note Peephole Definitions::), operand constraint
! strings are ignored, so if there are relevant constraints, they must be
! tested in the C condition.  In the example, the optimization is applied
! if operand 2 does _not_ satisfy the `K' constraint.  (This is a
! simplified version of a peephole definition from the i386 machine
! description.)
  
       (define_peephole2
         [(match_scratch:SI 3 "r")
--- 22494,22552 ----
  ---------------------------------
  
  It is occasionally useful to test a constraint from C code rather than
! implicitly via the constraint string in a 'match_operand'.  The
! generated file 'tm_p.h' declares a few interfaces for working with
  constraints.  At present these are defined for all constraints except
! 'g' (which is equivalent to 'general_operand').
  
   Some valid constraint names are not valid C identifiers, so there is a
  mangling scheme for referring to them from C.  Constraint names that do
  not contain angle brackets or underscores are left unchanged.
! Underscores are doubled, each '<' is replaced with '_l', and each '>'
! with '_g'.  Here are some examples:
  
!      *Original* *Mangled*  
!      x          x       
!      P42x       P42x    
!      P4_x       P4__x   
!      P4>x       P4_gx   
!      P4>>       P4_g_g  
!      P4_g>      P4__g_g 
  
   Throughout this section, the variable C is either a constraint in the
! abstract sense, or a constant from 'enum constraint_num'; the variable M
! is a mangled constraint name (usually as part of a larger identifier).
  
   -- Enum: constraint_num
!      For each constraint except 'g', there is a corresponding
!      enumeration constant: 'CONSTRAINT_' plus the mangled name of the
!      constraint.  Functions that take an 'enum constraint_num' as an
       argument expect one of these constants.
  
   -- Function: inline bool satisfies_constraint_M (rtx EXP)
!      For each non-register constraint M except 'g', there is one of
!      these functions; it returns 'true' if EXP satisfies the constraint.
!      These functions are only visible if 'rtl.h' was included before
!      'tm_p.h'.
  
   -- Function: bool constraint_satisfied_p (rtx EXP, enum constraint_num
            C)
!      Like the 'satisfies_constraint_M' functions, but the constraint to
       test is given as an argument, C.  If C specifies a register
!      constraint, this function will always return 'false'.
  
   -- Function: enum reg_class reg_class_for_constraint (enum
            constraint_num C)
       Returns the register class associated with C.  If C is not a
       register constraint, or those registers are not available for the
!      currently selected subtarget, returns 'NO_REGS'.
  
!  Here is an example use of 'satisfies_constraint_M'.  In peephole
! optimizations (*note Peephole Definitions::), operand constraint strings
! are ignored, so if there are relevant constraints, they must be tested
! in the C condition.  In the example, the optimization is applied if
! operand 2 does _not_ satisfy the 'K' constraint.  (This is a simplified
! version of a peephole definition from the i386 machine description.)
  
       (define_peephole2
         [(match_scratch:SI 3 "r")
*************** generation pass of the compiler.  Giving
*** 22929,22964 ****
  instruction pattern tells the RTL generation pass that it can use the
  pattern to accomplish a certain task.
  
! `movM'
       Here M stands for a two-letter machine mode name, in lowercase.
       This instruction pattern moves data with that machine mode from
!      operand 1 to operand 0.  For example, `movsi' moves full-word data.
  
!      If operand 0 is a `subreg' with mode M of a register whose own
!      mode is wider than M, the effect of this instruction is to store
!      the specified value in the part of the register that corresponds
!      to mode M.  Bits outside of M, but which are within the same
!      target word as the `subreg' are undefined.  Bits which are outside
!      the target word are left unchanged.
  
       This class of patterns is special in several ways.  First of all,
       each of these names up to and including full word size _must_ be
       defined, because there is no other way to copy a datum from one
       place to another.  If there are patterns accepting operands in
!      larger modes, `movM' must be defined for integer modes of those
       sizes.
  
       Second, these patterns are not used solely in the RTL generation
       pass.  Even the reload pass can generate move insns to copy values
!      from stack slots into temporary registers.  When it does so, one
!      of the operands is a hard register and the other is an operand
!      that can need to be reloaded into a register.
  
       Therefore, when given such a pair of operands, the pattern must
       generate RTL which needs no reloading and needs no temporary
       registers--no registers other than the operands.  For example, if
!      you support the pattern with a `define_expand', then in such a
!      case the `define_expand' mustn't call `force_reg' or any other such
       function which might generate new pseudo registers.
  
       This requirement exists even for subword modes on a RISC machine
--- 22572,22607 ----
  instruction pattern tells the RTL generation pass that it can use the
  pattern to accomplish a certain task.
  
! 'movM'
       Here M stands for a two-letter machine mode name, in lowercase.
       This instruction pattern moves data with that machine mode from
!      operand 1 to operand 0.  For example, 'movsi' moves full-word data.
  
!      If operand 0 is a 'subreg' with mode M of a register whose own mode
!      is wider than M, the effect of this instruction is to store the
!      specified value in the part of the register that corresponds to
!      mode M.  Bits outside of M, but which are within the same target
!      word as the 'subreg' are undefined.  Bits which are outside the
!      target word are left unchanged.
  
       This class of patterns is special in several ways.  First of all,
       each of these names up to and including full word size _must_ be
       defined, because there is no other way to copy a datum from one
       place to another.  If there are patterns accepting operands in
!      larger modes, 'movM' must be defined for integer modes of those
       sizes.
  
       Second, these patterns are not used solely in the RTL generation
       pass.  Even the reload pass can generate move insns to copy values
!      from stack slots into temporary registers.  When it does so, one of
!      the operands is a hard register and the other is an operand that
!      can need to be reloaded into a register.
  
       Therefore, when given such a pair of operands, the pattern must
       generate RTL which needs no reloading and needs no temporary
       registers--no registers other than the operands.  For example, if
!      you support the pattern with a 'define_expand', then in such a case
!      the 'define_expand' mustn't call 'force_reg' or any other such
       function which might generate new pseudo registers.
  
       This requirement exists even for subword modes on a RISC machine
*************** pattern to accomplish a certain task.
*** 22971,22981 ****
       be done with the address except to use it as it stands.  If it is
       copied, it will not be replaced with a valid address.  No attempt
       should be made to make such an address into a valid address and no
!      routine (such as `change_address') that will do so may be called.
!      Note that `general_operand' will fail when applied to such an
       address.
  
!      The global variable `reload_in_progress' (which must be explicitly
       declared if required) can be used to determine whether such special
       handling is required.
  
--- 22614,22624 ----
       be done with the address except to use it as it stands.  If it is
       copied, it will not be replaced with a valid address.  No attempt
       should be made to make such an address into a valid address and no
!      routine (such as 'change_address') that will do so may be called.
!      Note that 'general_operand' will fail when applied to such an
       address.
  
!      The global variable 'reload_in_progress' (which must be explicitly
       declared if required) can be used to determine whether such special
       handling is required.
  
*************** pattern to accomplish a certain task.
*** 22986,23061 ****
       reloads.
  
       If a scratch register is required to move an object to or from
!      memory, it can be allocated using `gen_reg_rtx' prior to life
       analysis.
  
       If there are cases which need scratch registers during or after
       reload, you must provide an appropriate secondary_reload target
       hook.
  
!      The macro `can_create_pseudo_p' can be used to determine if it is
       unsafe to create new pseudo registers.  If this variable is
!      nonzero, then it is unsafe to call `gen_reg_rtx' to allocate a new
       pseudo.
  
!      The constraints on a `movM' must permit moving any hard register
!      to any other hard register provided that `HARD_REGNO_MODE_OK'
!      permits mode M in both registers and `TARGET_REGISTER_MOVE_COST'
!      applied to their classes returns a value of 2.
  
!      It is obligatory to support floating point `movM' instructions
!      into and out of any registers that can hold fixed point values,
!      because unions and structures (which have modes `SImode' or
!      `DImode') can be in those registers and they may have floating
!      point members.
  
!      There may also be a need to support fixed point `movM'
!      instructions in and out of floating point registers.
!      Unfortunately, I have forgotten why this was so, and I don't know
!      whether it is still true.  If `HARD_REGNO_MODE_OK' rejects fixed
!      point values in floating point registers, then the constraints of
!      the fixed point `movM' instructions must be designed to avoid ever
!      trying to reload into a floating point register.
  
! `reload_inM'
! `reload_outM'
       These named patterns have been obsoleted by the target hook
!      `secondary_reload'.
  
!      Like `movM', but used when a scratch register is required to move
       between operand 0 and operand 1.  Operand 2 describes the scratch
!      register.  See the discussion of the `SECONDARY_RELOAD_CLASS'
!      macro in *note Register Classes::.
  
!      There are special restrictions on the form of the `match_operand's
       used in these patterns.  First, only the predicate for the reload
!      operand is examined, i.e., `reload_in' examines operand 1, but not
       the predicates for operand 0 or 2.  Second, there may be only one
       alternative in the constraints.  Third, only a single register
       class letter may be used for the constraint; subsequent constraint
       letters are ignored.  As a special exception, an empty constraint
!      string matches the `ALL_REGS' register class.  This may relieve
!      ports of the burden of defining an `ALL_REGS' constraint letter
       just for these patterns.
  
! `movstrictM'
!      Like `movM' except that if operand 0 is a `subreg' with mode M of
!      a register whose natural mode is wider, the `movstrictM'
!      instruction is guaranteed not to alter any of the register except
!      the part which belongs to mode M.
  
! `movmisalignM'
       This variant of a move pattern is designed to load or store a value
       from a memory address that is not naturally aligned for its mode.
       For a store, the memory will be in operand 0; for a load, the
       memory will be in operand 1.  The other operand is guaranteed not
!      to be a memory, so that it's easy to tell whether this is a load
!      or store.
  
       This pattern is used by the autovectorizer, and when expanding a
!      `MISALIGNED_INDIRECT_REF' expression.
  
! `load_multiple'
       Load several consecutive memory locations into consecutive
       registers.  Operand 0 is the first of the consecutive registers,
       operand 1 is the first memory location, and operand 2 is a
--- 22629,22703 ----
       reloads.
  
       If a scratch register is required to move an object to or from
!      memory, it can be allocated using 'gen_reg_rtx' prior to life
       analysis.
  
       If there are cases which need scratch registers during or after
       reload, you must provide an appropriate secondary_reload target
       hook.
  
!      The macro 'can_create_pseudo_p' can be used to determine if it is
       unsafe to create new pseudo registers.  If this variable is
!      nonzero, then it is unsafe to call 'gen_reg_rtx' to allocate a new
       pseudo.
  
!      The constraints on a 'movM' must permit moving any hard register to
!      any other hard register provided that 'HARD_REGNO_MODE_OK' permits
!      mode M in both registers and 'TARGET_REGISTER_MOVE_COST' applied to
!      their classes returns a value of 2.
  
!      It is obligatory to support floating point 'movM' instructions into
!      and out of any registers that can hold fixed point values, because
!      unions and structures (which have modes 'SImode' or 'DImode') can
!      be in those registers and they may have floating point members.
  
!      There may also be a need to support fixed point 'movM' instructions
!      in and out of floating point registers.  Unfortunately, I have
!      forgotten why this was so, and I don't know whether it is still
!      true.  If 'HARD_REGNO_MODE_OK' rejects fixed point values in
!      floating point registers, then the constraints of the fixed point
!      'movM' instructions must be designed to avoid ever trying to reload
!      into a floating point register.
  
! 'reload_inM'
! 'reload_outM'
       These named patterns have been obsoleted by the target hook
!      'secondary_reload'.
  
!      Like 'movM', but used when a scratch register is required to move
       between operand 0 and operand 1.  Operand 2 describes the scratch
!      register.  See the discussion of the 'SECONDARY_RELOAD_CLASS' macro
!      in *note Register Classes::.
  
!      There are special restrictions on the form of the 'match_operand's
       used in these patterns.  First, only the predicate for the reload
!      operand is examined, i.e., 'reload_in' examines operand 1, but not
       the predicates for operand 0 or 2.  Second, there may be only one
       alternative in the constraints.  Third, only a single register
       class letter may be used for the constraint; subsequent constraint
       letters are ignored.  As a special exception, an empty constraint
!      string matches the 'ALL_REGS' register class.  This may relieve
!      ports of the burden of defining an 'ALL_REGS' constraint letter
       just for these patterns.
  
! 'movstrictM'
!      Like 'movM' except that if operand 0 is a 'subreg' with mode M of a
!      register whose natural mode is wider, the 'movstrictM' instruction
!      is guaranteed not to alter any of the register except the part
!      which belongs to mode M.
  
! 'movmisalignM'
       This variant of a move pattern is designed to load or store a value
       from a memory address that is not naturally aligned for its mode.
       For a store, the memory will be in operand 0; for a load, the
       memory will be in operand 1.  The other operand is guaranteed not
!      to be a memory, so that it's easy to tell whether this is a load or
!      store.
  
       This pattern is used by the autovectorizer, and when expanding a
!      'MISALIGNED_INDIRECT_REF' expression.
  
! 'load_multiple'
       Load several consecutive memory locations into consecutive
       registers.  Operand 0 is the first of the consecutive registers,
       operand 1 is the first memory location, and operand 2 is a
*************** pattern to accomplish a certain task.
*** 23069,23090 ****
       On some machines, there are restrictions as to which consecutive
       registers can be stored into memory, such as particular starting or
       ending register numbers or only a range of valid counts.  For those
!      machines, use a `define_expand' (*note Expander Definitions::) and
       make the pattern fail if the restrictions are not met.
  
!      Write the generated insn as a `parallel' with elements being a
!      `set' of one register from the appropriate memory location (you may
!      also need `use' or `clobber' elements).  Use a `match_parallel'
!      (*note RTL Template::) to recognize the insn.  See `rs6000.md' for
       examples of the use of this insn pattern.
  
! `store_multiple'
!      Similar to `load_multiple', but store several consecutive registers
       into consecutive memory locations.  Operand 0 is the first of the
       consecutive memory locations, operand 1 is the first register, and
       operand 2 is a constant: the number of consecutive registers.
  
! `vec_load_lanesMN'
       Perform an interleaved load of several vectors from memory operand
       1 into register operand 0.  Both operands have mode M.  The
       register operand is viewed as holding consecutive vectors of mode
--- 22711,22732 ----
       On some machines, there are restrictions as to which consecutive
       registers can be stored into memory, such as particular starting or
       ending register numbers or only a range of valid counts.  For those
!      machines, use a 'define_expand' (*note Expander Definitions::) and
       make the pattern fail if the restrictions are not met.
  
!      Write the generated insn as a 'parallel' with elements being a
!      'set' of one register from the appropriate memory location (you may
!      also need 'use' or 'clobber' elements).  Use a 'match_parallel'
!      (*note RTL Template::) to recognize the insn.  See 'rs6000.md' for
       examples of the use of this insn pattern.
  
! 'store_multiple'
!      Similar to 'load_multiple', but store several consecutive registers
       into consecutive memory locations.  Operand 0 is the first of the
       consecutive memory locations, operand 1 is the first register, and
       operand 2 is a constant: the number of consecutive registers.
  
! 'vec_load_lanesMN'
       Perform an interleaved load of several vectors from memory operand
       1 into register operand 0.  Both operands have mode M.  The
       register operand is viewed as holding consecutive vectors of mode
*************** pattern to accomplish a certain task.
*** 23096,23104 ****
              for (i = 0; i < c; i++)
                operand0[i][j] = operand1[j * c + i];
  
!      For example, `vec_load_lanestiv4hi' loads 8 16-bit values from
!      memory into a register of mode `TI'.  The register contains two
!      consecutive vectors of mode `V4HI'.
  
       This pattern can only be used if:
            TARGET_ARRAY_MODE_SUPPORTED_P (N, C)
--- 22738,22746 ----
              for (i = 0; i < c; i++)
                operand0[i][j] = operand1[j * c + i];
  
!      For example, 'vec_load_lanestiv4hi' loads 8 16-bit values from
!      memory into a register of mode 'TI'.  The register contains two
!      consecutive vectors of mode 'V4HI'.
  
       This pattern can only be used if:
            TARGET_ARRAY_MODE_SUPPORTED_P (N, C)
*************** pattern to accomplish a certain task.
*** 23106,23113 ****
       instruction for some mode N, it also supports unaligned loads for
       vectors of mode N.
  
! `vec_store_lanesMN'
!      Equivalent to `vec_load_lanesMN', with the memory and register
       operands reversed.  That is, the instruction is equivalent to:
  
            int c = GET_MODE_SIZE (M) / GET_MODE_SIZE (N);
--- 22748,22755 ----
       instruction for some mode N, it also supports unaligned loads for
       vectors of mode N.
  
! 'vec_store_lanesMN'
!      Equivalent to 'vec_load_lanesMN', with the memory and register
       operands reversed.  That is, the instruction is equivalent to:
  
            int c = GET_MODE_SIZE (M) / GET_MODE_SIZE (N);
*************** pattern to accomplish a certain task.
*** 23117,23376 ****
  
       for a memory operand 0 and register operand 1.
  
! `vec_setM'
       Set given field in the vector value.  Operand 0 is the vector to
       modify, operand 1 is new value of field and operand 2 specify the
       field index.
  
! `vec_extractM'
       Extract given field from the vector value.  Operand 1 is the
       vector, operand 2 specify field index and operand 0 place to store
       value into.
  
! `vec_initM'
       Initialize the vector to given values.  Operand 0 is the vector to
       initialize and operand 1 is parallel containing values for
       individual fields.
  
! `vcondMN'
       Output a conditional vector move.  Operand 0 is the destination to
!      receive a combination of operand 1 and operand 2, which are of
!      mode M, dependent on the outcome of the predicate in operand 3
!      which is a vector comparison with operands of mode N in operands 4
!      and 5.  The modes M and N should have the same size.  Operand 0
!      will be set to the value OP1 & MSK | OP2 & ~MSK where MSK is
!      computed by element-wise evaluation of the vector comparison with
!      a truth value of all-ones and a false value of all-zeros.
  
! `vec_permM'
       Output a (variable) vector permutation.  Operand 0 is the
!      destination to receive elements from operand 1 and operand 2,
!      which are of mode M.  Operand 3 is the "selector".  It is an
!      integral mode vector of the same width and number of elements as
!      mode M.
  
       The input elements are numbered from 0 in operand 1 through 2*N-1
!      in operand 2.  The elements of the selector must be computed
!      modulo 2*N.  Note that if `rtx_equal_p(operand1, operand2)', this
!      can be implemented with just operand 1 and selector elements
!      modulo N.
  
       In order to make things easy for a number of targets, if there is
!      no `vec_perm' pattern for mode M, but there is for mode Q where Q
!      is a vector of `QImode' of the same width as M, the middle-end
!      will lower the mode M `VEC_PERM_EXPR' to mode Q.
  
! `vec_perm_constM'
!      Like `vec_perm' except that the permutation is a compile-time
!      constant.  That is, operand 3, the "selector", is a `CONST_VECTOR'.
  
       Some targets cannot perform a permutation with a variable selector,
       but can efficiently perform a constant permutation.  Further, the
!      target hook `vec_perm_ok' is queried to determine if the specific
!      constant permutation is available efficiently; the named pattern
!      is never expanded without `vec_perm_ok' returning true.
  
!      There is no need for a target to supply both `vec_permM' and
!      `vec_perm_constM' if the former can trivially implement the
       operation with, say, the vector constant loaded into a register.
  
! `pushM1'
       Output a push instruction.  Operand 0 is value to push.  Used only
!      when `PUSH_ROUNDING' is defined.  For historical reason, this
!      pattern may be missing and in such case an `mov' expander is used
!      instead, with a `MEM' expression forming the push operation.  The
!      `mov' expander method is deprecated.
  
! `addM3'
       Add operand 2 and operand 1, storing the result in operand 0.  All
       operands must have mode M.  This can be used even on two-address
       machines, by means of constraints requiring operands 1 and 0 to be
       the same location.
  
! `ssaddM3', `usaddM3'
! `subM3', `sssubM3', `ussubM3'
! `mulM3', `ssmulM3', `usmulM3'
! `divM3', `ssdivM3'
! `udivM3', `usdivM3'
! `modM3', `umodM3'
! `uminM3', `umaxM3'
! `andM3', `iorM3', `xorM3'
       Similar, for other arithmetic operations.
  
! `addvM4'
!      Like `addM3' but takes a `code_label' as operand 3 and emits code
       to jump to it if signed overflow occurs during the addition.  This
       pattern is used to implement the built-in functions performing
       signed integer addition with overflow checking.
  
! `subvM4', `mulvM4'
       Similar, for other signed arithmetic operations.
  
! `umulvM4'
!      Like `mulvM4' but for unsigned multiplication.  That is to say,
!      the operation is the same as signed multiplication but the jump is
       taken only on unsigned overflow.
  
! `addptrM3'
!      Like `addM3' but is guaranteed to only be used for address
       calculations.  The expanded code is not allowed to clobber the
!      condition code.  It only needs to be defined if `addM3' sets the
       condition code.  If adds used for address calculations and normal
!      adds are not compatible it is required to expand a distinct
!      pattern (e.g. using an unspec).  The pattern is used by LRA to emit
!      address calculations.  `addM3' is used if `addptrM3' is not
       defined.
  
! `fmaM4'
       Multiply operand 2 and operand 1, then add operand 3, storing the
       result in operand 0 without doing an intermediate rounding step.
       All operands must have mode M.  This pattern is used to implement
!      the `fma', `fmaf', and `fmal' builtin functions from the ISO C99
       standard.
  
! `fmsM4'
!      Like `fmaM4', except operand 3 subtracted from the product instead
       of added to the product.  This is represented in the rtl as
  
            (fma:M OP1 OP2 (neg:M OP3))
  
! `fnmaM4'
!      Like `fmaM4' except that the intermediate product is negated
!      before being added to operand 3.  This is represented in the rtl as
  
            (fma:M (neg:M OP1) OP2 OP3)
  
! `fnmsM4'
!      Like `fmsM4' except that the intermediate product is negated
!      before subtracting operand 3.  This is represented in the rtl as
  
            (fma:M (neg:M OP1) OP2 (neg:M OP3))
  
! `sminM3', `smaxM3'
       Signed minimum and maximum operations.  When used with floating
!      point, if both operands are zeros, or if either operand is `NaN',
!      then it is unspecified which of the two operands is returned as
!      the result.
  
! `reduc_smin_M', `reduc_smax_M'
!      Find the signed minimum/maximum of the elements of a vector. The
       vector is operand 1, and the result is stored in the least
!      significant bits of operand 0 (also a vector). The output and
!      input vector should have the same modes. These are legacy optabs,
!      and platforms should prefer to implement `reduc_smin_scal_M' and
!      `reduc_smax_scal_M'.
  
! `reduc_umin_M', `reduc_umax_M'
!      Find the unsigned minimum/maximum of the elements of a vector. The
       vector is operand 1, and the result is stored in the least
!      significant bits of operand 0 (also a vector). The output and
!      input vector should have the same modes. These are legacy optabs,
!      and platforms should prefer to implement `reduc_umin_scal_M' and
!      `reduc_umax_scal_M'.
  
! `reduc_splus_M', `reduc_uplus_M'
!      Compute the sum of the signed/unsigned elements of a vector. The
       vector is operand 1, and the result is stored in the least
!      significant bits of operand 0 (also a vector). The output and
       input vector should have the same modes.  These are legacy optabs,
!      and platforms should prefer to implement `reduc_plus_scal_M'.
  
! `reduc_smin_scal_M', `reduc_smax_scal_M'
!      Find the signed minimum/maximum of the elements of a vector. The
       vector is operand 1, and operand 0 is the scalar result, with mode
       equal to the mode of the elements of the input vector.
  
! `reduc_umin_scal_M', `reduc_umax_scal_M'
!      Find the unsigned minimum/maximum of the elements of a vector. The
       vector is operand 1, and operand 0 is the scalar result, with mode
       equal to the mode of the elements of the input vector.
  
! `reduc_plus_scal_M'
!      Compute the sum of the elements of a vector. The vector is operand
       1, and operand 0 is the scalar result, with mode equal to the mode
       of the elements of the input vector.
  
! `sdot_prodM'
! `udot_prodM'
       Compute the sum of the products of two signed/unsigned elements.
!      Operand 1 and operand 2 are of the same mode. Their product, which
!      is of a wider mode, is computed and added to operand 3. Operand 3
!      is of a mode equal or wider than the mode of the product. The
!      result is placed in operand 0, which is of the same mode as
!      operand 3.
! 
! `ssadM'
  
! `usadM'
       Compute the sum of absolute differences of two signed/unsigned
!      elements.  Operand 1 and operand 2 are of the same mode. Their
       absolute difference, which is of a wider mode, is computed and
!      added to operand 3. Operand 3 is of a mode equal or wider than the
!      mode of the absolute difference. The result is placed in operand
       0, which is of the same mode as operand 3.
  
! `ssum_widenM3'
! `usum_widenM3'
!      Operands 0 and 2 are of the same mode, which is wider than the
!      mode of operand 1. Add operand 1 to operand 2 and place the
!      widened result in operand 0. (This is used express accumulation of
       elements into an accumulator of a wider mode.)
  
! `vec_shr_M'
!      Whole vector right shift in bits, i.e. towards element 0.  Operand
       1 is a vector to be shifted.  Operand 2 is an integer shift amount
       in bits.  Operand 0 is where the resulting shifted vector is
       stored.  The output and input vectors should have the same modes.
  
! `vec_pack_trunc_M'
!      Narrow (demote) and merge the elements of two vectors. Operands 1
       and 2 are vectors of the same mode having N integral or floating
       point elements of size S.  Operand 0 is the resulting vector in
       which 2*N elements of size N/2 are concatenated after narrowing
       them down using truncation.
  
! `vec_pack_ssat_M', `vec_pack_usat_M'
       Narrow (demote) and merge the elements of two vectors.  Operands 1
       and 2 are vectors of the same mode having N integral elements of
!      size S.  Operand 0 is the resulting vector in which the elements
!      of the two input vectors are concatenated after narrowing them
!      down using signed/unsigned saturating arithmetic.
  
! `vec_pack_sfix_trunc_M', `vec_pack_ufix_trunc_M'
       Narrow, convert to signed/unsigned integral type and merge the
       elements of two vectors.  Operands 1 and 2 are vectors of the same
       mode having N floating point elements of size S.  Operand 0 is the
       resulting vector in which 2*N elements of size N/2 are
       concatenated.
  
! `vec_unpacks_hi_M', `vec_unpacks_lo_M'
       Extract and widen (promote) the high/low part of a vector of signed
       integral or floating point elements.  The input vector (operand 1)
!      has N elements of size S.  Widen (promote) the high/low elements
!      of the vector using signed or floating point extension and place
!      the resulting N/2 values of size 2*S in the output vector (operand
!      0).
  
! `vec_unpacku_hi_M', `vec_unpacku_lo_M'
       Extract and widen (promote) the high/low part of a vector of
       unsigned integral elements.  The input vector (operand 1) has N
!      elements of size S.  Widen (promote) the high/low elements of the
       vector using zero extension and place the resulting N/2 values of
       size 2*S in the output vector (operand 0).
  
! `vec_unpacks_float_hi_M', `vec_unpacks_float_lo_M'
! `vec_unpacku_float_hi_M', `vec_unpacku_float_lo_M'
!      Extract, convert to floating point type and widen the high/low
!      part of a vector of signed/unsigned integral elements.  The input
!      vector (operand 1) has N elements of size S.  Convert the high/low
       elements of the vector using floating point conversion and place
       the resulting N/2 values of size 2*S in the output vector (operand
       0).
  
! `vec_widen_umult_hi_M', `vec_widen_umult_lo_M'
! `vec_widen_smult_hi_M', `vec_widen_smult_lo_M'
! `vec_widen_umult_even_M', `vec_widen_umult_odd_M'
! `vec_widen_smult_even_M', `vec_widen_smult_odd_M'
       Signed/Unsigned widening multiplication.  The two inputs (operands
       1 and 2) are vectors with N signed/unsigned elements of size S.
       Multiply the high/low or even/odd elements of the two vectors, and
--- 22759,23014 ----
  
       for a memory operand 0 and register operand 1.
  
! 'vec_setM'
       Set given field in the vector value.  Operand 0 is the vector to
       modify, operand 1 is new value of field and operand 2 specify the
       field index.
  
! 'vec_extractM'
       Extract given field from the vector value.  Operand 1 is the
       vector, operand 2 specify field index and operand 0 place to store
       value into.
  
! 'vec_initM'
       Initialize the vector to given values.  Operand 0 is the vector to
       initialize and operand 1 is parallel containing values for
       individual fields.
  
! 'vcondMN'
       Output a conditional vector move.  Operand 0 is the destination to
!      receive a combination of operand 1 and operand 2, which are of mode
!      M, dependent on the outcome of the predicate in operand 3 which is
!      a vector comparison with operands of mode N in operands 4 and 5.
!      The modes M and N should have the same size.  Operand 0 will be set
!      to the value OP1 & MSK | OP2 & ~MSK where MSK is computed by
!      element-wise evaluation of the vector comparison with a truth value
!      of all-ones and a false value of all-zeros.
  
! 'vec_permM'
       Output a (variable) vector permutation.  Operand 0 is the
!      destination to receive elements from operand 1 and operand 2, which
!      are of mode M.  Operand 3 is the "selector".  It is an integral
!      mode vector of the same width and number of elements as mode M.
  
       The input elements are numbered from 0 in operand 1 through 2*N-1
!      in operand 2.  The elements of the selector must be computed modulo
!      2*N.  Note that if 'rtx_equal_p(operand1, operand2)', this can be
!      implemented with just operand 1 and selector elements modulo N.
  
       In order to make things easy for a number of targets, if there is
!      no 'vec_perm' pattern for mode M, but there is for mode Q where Q
!      is a vector of 'QImode' of the same width as M, the middle-end will
!      lower the mode M 'VEC_PERM_EXPR' to mode Q.
  
! 'vec_perm_constM'
!      Like 'vec_perm' except that the permutation is a compile-time
!      constant.  That is, operand 3, the "selector", is a 'CONST_VECTOR'.
  
       Some targets cannot perform a permutation with a variable selector,
       but can efficiently perform a constant permutation.  Further, the
!      target hook 'vec_perm_ok' is queried to determine if the specific
!      constant permutation is available efficiently; the named pattern is
!      never expanded without 'vec_perm_ok' returning true.
  
!      There is no need for a target to supply both 'vec_permM' and
!      'vec_perm_constM' if the former can trivially implement the
       operation with, say, the vector constant loaded into a register.
  
! 'pushM1'
       Output a push instruction.  Operand 0 is value to push.  Used only
!      when 'PUSH_ROUNDING' is defined.  For historical reason, this
!      pattern may be missing and in such case an 'mov' expander is used
!      instead, with a 'MEM' expression forming the push operation.  The
!      'mov' expander method is deprecated.
  
! 'addM3'
       Add operand 2 and operand 1, storing the result in operand 0.  All
       operands must have mode M.  This can be used even on two-address
       machines, by means of constraints requiring operands 1 and 0 to be
       the same location.
  
! 'ssaddM3', 'usaddM3'
! 'subM3', 'sssubM3', 'ussubM3'
! 'mulM3', 'ssmulM3', 'usmulM3'
! 'divM3', 'ssdivM3'
! 'udivM3', 'usdivM3'
! 'modM3', 'umodM3'
! 'uminM3', 'umaxM3'
! 'andM3', 'iorM3', 'xorM3'
       Similar, for other arithmetic operations.
  
! 'addvM4'
!      Like 'addM3' but takes a 'code_label' as operand 3 and emits code
       to jump to it if signed overflow occurs during the addition.  This
       pattern is used to implement the built-in functions performing
       signed integer addition with overflow checking.
  
! 'subvM4', 'mulvM4'
       Similar, for other signed arithmetic operations.
  
! 'umulvM4'
!      Like 'mulvM4' but for unsigned multiplication.  That is to say, the
!      operation is the same as signed multiplication but the jump is
       taken only on unsigned overflow.
  
! 'addptrM3'
!      Like 'addM3' but is guaranteed to only be used for address
       calculations.  The expanded code is not allowed to clobber the
!      condition code.  It only needs to be defined if 'addM3' sets the
       condition code.  If adds used for address calculations and normal
!      adds are not compatible it is required to expand a distinct pattern
!      (e.g.  using an unspec).  The pattern is used by LRA to emit
!      address calculations.  'addM3' is used if 'addptrM3' is not
       defined.
  
! 'fmaM4'
       Multiply operand 2 and operand 1, then add operand 3, storing the
       result in operand 0 without doing an intermediate rounding step.
       All operands must have mode M.  This pattern is used to implement
!      the 'fma', 'fmaf', and 'fmal' builtin functions from the ISO C99
       standard.
  
! 'fmsM4'
!      Like 'fmaM4', except operand 3 subtracted from the product instead
       of added to the product.  This is represented in the rtl as
  
            (fma:M OP1 OP2 (neg:M OP3))
  
! 'fnmaM4'
!      Like 'fmaM4' except that the intermediate product is negated before
!      being added to operand 3.  This is represented in the rtl as
  
            (fma:M (neg:M OP1) OP2 OP3)
  
! 'fnmsM4'
!      Like 'fmsM4' except that the intermediate product is negated before
!      subtracting operand 3.  This is represented in the rtl as
  
            (fma:M (neg:M OP1) OP2 (neg:M OP3))
  
! 'sminM3', 'smaxM3'
       Signed minimum and maximum operations.  When used with floating
!      point, if both operands are zeros, or if either operand is 'NaN',
!      then it is unspecified which of the two operands is returned as the
!      result.
  
! 'reduc_smin_M', 'reduc_smax_M'
!      Find the signed minimum/maximum of the elements of a vector.  The
       vector is operand 1, and the result is stored in the least
!      significant bits of operand 0 (also a vector).  The output and
!      input vector should have the same modes.  These are legacy optabs,
!      and platforms should prefer to implement 'reduc_smin_scal_M' and
!      'reduc_smax_scal_M'.
  
! 'reduc_umin_M', 'reduc_umax_M'
!      Find the unsigned minimum/maximum of the elements of a vector.  The
       vector is operand 1, and the result is stored in the least
!      significant bits of operand 0 (also a vector).  The output and
!      input vector should have the same modes.  These are legacy optabs,
!      and platforms should prefer to implement 'reduc_umin_scal_M' and
!      'reduc_umax_scal_M'.
  
! 'reduc_splus_M', 'reduc_uplus_M'
!      Compute the sum of the signed/unsigned elements of a vector.  The
       vector is operand 1, and the result is stored in the least
!      significant bits of operand 0 (also a vector).  The output and
       input vector should have the same modes.  These are legacy optabs,
!      and platforms should prefer to implement 'reduc_plus_scal_M'.
  
! 'reduc_smin_scal_M', 'reduc_smax_scal_M'
!      Find the signed minimum/maximum of the elements of a vector.  The
       vector is operand 1, and operand 0 is the scalar result, with mode
       equal to the mode of the elements of the input vector.
  
! 'reduc_umin_scal_M', 'reduc_umax_scal_M'
!      Find the unsigned minimum/maximum of the elements of a vector.  The
       vector is operand 1, and operand 0 is the scalar result, with mode
       equal to the mode of the elements of the input vector.
  
! 'reduc_plus_scal_M'
!      Compute the sum of the elements of a vector.  The vector is operand
       1, and operand 0 is the scalar result, with mode equal to the mode
       of the elements of the input vector.
  
! 'sdot_prodM'
! 'udot_prodM'
       Compute the sum of the products of two signed/unsigned elements.
!      Operand 1 and operand 2 are of the same mode.  Their product, which
!      is of a wider mode, is computed and added to operand 3.  Operand 3
!      is of a mode equal or wider than the mode of the product.  The
!      result is placed in operand 0, which is of the same mode as operand
!      3.
  
! 'ssadM'
! 'usadM'
       Compute the sum of absolute differences of two signed/unsigned
!      elements.  Operand 1 and operand 2 are of the same mode.  Their
       absolute difference, which is of a wider mode, is computed and
!      added to operand 3.  Operand 3 is of a mode equal or wider than the
!      mode of the absolute difference.  The result is placed in operand
       0, which is of the same mode as operand 3.
  
! 'ssum_widenM3'
! 'usum_widenM3'
!      Operands 0 and 2 are of the same mode, which is wider than the mode
!      of operand 1.  Add operand 1 to operand 2 and place the widened
!      result in operand 0.  (This is used express accumulation of
       elements into an accumulator of a wider mode.)
  
! 'vec_shr_M'
!      Whole vector right shift in bits, i.e.  towards element 0.  Operand
       1 is a vector to be shifted.  Operand 2 is an integer shift amount
       in bits.  Operand 0 is where the resulting shifted vector is
       stored.  The output and input vectors should have the same modes.
  
! 'vec_pack_trunc_M'
!      Narrow (demote) and merge the elements of two vectors.  Operands 1
       and 2 are vectors of the same mode having N integral or floating
       point elements of size S.  Operand 0 is the resulting vector in
       which 2*N elements of size N/2 are concatenated after narrowing
       them down using truncation.
  
! 'vec_pack_ssat_M', 'vec_pack_usat_M'
       Narrow (demote) and merge the elements of two vectors.  Operands 1
       and 2 are vectors of the same mode having N integral elements of
!      size S. Operand 0 is the resulting vector in which the elements of
!      the two input vectors are concatenated after narrowing them down
!      using signed/unsigned saturating arithmetic.
  
! 'vec_pack_sfix_trunc_M', 'vec_pack_ufix_trunc_M'
       Narrow, convert to signed/unsigned integral type and merge the
       elements of two vectors.  Operands 1 and 2 are vectors of the same
       mode having N floating point elements of size S.  Operand 0 is the
       resulting vector in which 2*N elements of size N/2 are
       concatenated.
  
! 'vec_unpacks_hi_M', 'vec_unpacks_lo_M'
       Extract and widen (promote) the high/low part of a vector of signed
       integral or floating point elements.  The input vector (operand 1)
!      has N elements of size S.  Widen (promote) the high/low elements of
!      the vector using signed or floating point extension and place the
!      resulting N/2 values of size 2*S in the output vector (operand 0).
  
! 'vec_unpacku_hi_M', 'vec_unpacku_lo_M'
       Extract and widen (promote) the high/low part of a vector of
       unsigned integral elements.  The input vector (operand 1) has N
!      elements of size S. Widen (promote) the high/low elements of the
       vector using zero extension and place the resulting N/2 values of
       size 2*S in the output vector (operand 0).
  
! 'vec_unpacks_float_hi_M', 'vec_unpacks_float_lo_M'
! 'vec_unpacku_float_hi_M', 'vec_unpacku_float_lo_M'
!      Extract, convert to floating point type and widen the high/low part
!      of a vector of signed/unsigned integral elements.  The input vector
!      (operand 1) has N elements of size S.  Convert the high/low
       elements of the vector using floating point conversion and place
       the resulting N/2 values of size 2*S in the output vector (operand
       0).
  
! 'vec_widen_umult_hi_M', 'vec_widen_umult_lo_M'
! 'vec_widen_smult_hi_M', 'vec_widen_smult_lo_M'
! 'vec_widen_umult_even_M', 'vec_widen_umult_odd_M'
! 'vec_widen_smult_even_M', 'vec_widen_smult_odd_M'
       Signed/Unsigned widening multiplication.  The two inputs (operands
       1 and 2) are vectors with N signed/unsigned elements of size S.
       Multiply the high/low or even/odd elements of the two vectors, and
*************** pattern to accomplish a certain task.
*** 23378,23810 ****
       A target shouldn't implement even/odd pattern pair if it is less
       efficient than lo/hi one.
  
! `vec_widen_ushiftl_hi_M', `vec_widen_ushiftl_lo_M'
! `vec_widen_sshiftl_hi_M', `vec_widen_sshiftl_lo_M'
       Signed/Unsigned widening shift left.  The first input (operand 1)
       is a vector with N signed/unsigned elements of size S.  Operand 2
       is a constant.  Shift the high/low elements of operand 1, and put
       the N/2 results of size 2*S in the output vector (operand 0).
  
! `mulhisi3'
!      Multiply operands 1 and 2, which have mode `HImode', and store a
!      `SImode' product in operand 0.
  
! `mulqihi3', `mulsidi3'
       Similar widening-multiplication instructions of other widths.
  
! `umulqihi3', `umulhisi3', `umulsidi3'
       Similar widening-multiplication instructions that do unsigned
       multiplication.
  
! `usmulqihi3', `usmulhisi3', `usmulsidi3'
       Similar widening-multiplication instructions that interpret the
!      first operand as unsigned and the second operand as signed, then
!      do a signed multiplication.
  
! `smulM3_highpart'
       Perform a signed multiplication of operands 1 and 2, which have
       mode M, and store the most significant half of the product in
       operand 0.  The least significant half of the product is discarded.
  
! `umulM3_highpart'
       Similar, but the multiplication is unsigned.
  
! `maddMN4'
       Multiply operands 1 and 2, sign-extend them to mode N, add operand
!      3, and store the result in operand 0.  Operands 1 and 2 have mode
!      M and operands 0 and 3 have mode N.  Both modes must be integer or
       fixed-point modes and N must be twice the size of M.
  
!      In other words, `maddMN4' is like `mulMN3' except that it also
!      adds operand 3.
  
!      These instructions are not allowed to `FAIL'.
  
! `umaddMN4'
!      Like `maddMN4', but zero-extend the multiplication operands
!      instead of sign-extending them.
  
! `ssmaddMN4'
!      Like `maddMN4', but all involved operations must be
       signed-saturating.
  
! `usmaddMN4'
!      Like `umaddMN4', but all involved operations must be
       unsigned-saturating.
  
! `msubMN4'
       Multiply operands 1 and 2, sign-extend them to mode N, subtract the
!      result from operand 3, and store the result in operand 0.
!      Operands 1 and 2 have mode M and operands 0 and 3 have mode N.
!      Both modes must be integer or fixed-point modes and N must be twice
!      the size of M.
  
!      In other words, `msubMN4' is like `mulMN3' except that it also
       subtracts the result from operand 3.
  
!      These instructions are not allowed to `FAIL'.
  
! `umsubMN4'
!      Like `msubMN4', but zero-extend the multiplication operands
!      instead of sign-extending them.
  
! `ssmsubMN4'
!      Like `msubMN4', but all involved operations must be
       signed-saturating.
  
! `usmsubMN4'
!      Like `umsubMN4', but all involved operations must be
       unsigned-saturating.
  
! `divmodM4'
       Signed division that produces both a quotient and a remainder.
       Operand 1 is divided by operand 2 to produce a quotient stored in
       operand 0 and a remainder stored in operand 3.
  
       For machines with an instruction that produces both a quotient and
!      a remainder, provide a pattern for `divmodM4' but do not provide
!      patterns for `divM3' and `modM3'.  This allows optimization in the
       relatively common case when both the quotient and remainder are
       computed.
  
       If an instruction that just produces a quotient or just a remainder
       exists and is more efficient than the instruction that produces
!      both, write the output routine of `divmodM4' to call
!      `find_reg_note' and look for a `REG_UNUSED' note on the quotient
!      or remainder and generate the appropriate instruction.
  
! `udivmodM4'
       Similar, but does unsigned division.
  
! `ashlM3', `ssashlM3', `usashlM3'
       Arithmetic-shift operand 1 left by a number of bits specified by
       operand 2, and store the result in operand 0.  Here M is the mode
       of operand 0 and operand 1; operand 2's mode is specified by the
       instruction pattern, and the compiler will convert the operand to
       that mode before generating the instruction.  The meaning of
       out-of-range shift counts can optionally be specified by
!      `TARGET_SHIFT_TRUNCATION_MASK'.  *Note
       TARGET_SHIFT_TRUNCATION_MASK::.  Operand 2 is always a scalar type.
  
! `ashrM3', `lshrM3', `rotlM3', `rotrM3'
!      Other shift and rotate instructions, analogous to the `ashlM3'
       instructions.  Operand 2 is always a scalar type.
  
! `vashlM3', `vashrM3', `vlshrM3', `vrotlM3', `vrotrM3'
       Vector shift and rotate instructions that take vectors as operand 2
       instead of a scalar type.
  
! `bswapM2'
       Reverse the order of bytes of operand 1 and store the result in
       operand 0.
  
! `negM2', `ssnegM2', `usnegM2'
       Negate operand 1 and store the result in operand 0.
  
! `negvM3'
!      Like `negM2' but takes a `code_label' as operand 2 and emits code
       to jump to it if signed overflow occurs during the negation.
  
! `absM2'
       Store the absolute value of operand 1 into operand 0.
  
! `sqrtM2'
       Store the square root of operand 1 into operand 0.
  
!      The `sqrt' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `sqrtf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `fmodM3'
!      Store the remainder of dividing operand 1 by operand 2 into
!      operand 0, rounded towards zero to an integer.
  
!      The `fmod' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `fmodf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `remainderM3'
!      Store the remainder of dividing operand 1 by operand 2 into
!      operand 0, rounded to the nearest integer.
  
!      The `remainder' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `remainderf'
       built-in function uses the mode which corresponds to the C data
!      type `float'.
  
! `cosM2'
       Store the cosine of operand 1 into operand 0.
  
!      The `cos' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `cosf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `sinM2'
       Store the sine of operand 1 into operand 0.
  
!      The `sin' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `sinf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `sincosM3'
       Store the cosine of operand 2 into operand 0 and the sine of
       operand 2 into operand 1.
  
!      The `sin' and `cos' built-in functions of C always use the mode
!      which corresponds to the C data type `double' and the `sinf' and
!      `cosf' built-in function use the mode which corresponds to the C
!      data type `float'.  Targets that can calculate the sine and cosine
       simultaneously can implement this pattern as opposed to
!      implementing individual `sinM2' and `cosM2' patterns.  The `sin'
!      and `cos' built-in functions will then be expanded to the
!      `sincosM3' pattern, with one of the output values left unused.
  
! `expM2'
       Store the exponential of operand 1 into operand 0.
  
!      The `exp' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `expf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `logM2'
       Store the natural logarithm of operand 1 into operand 0.
  
!      The `log' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `logf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `powM3'
       Store the value of operand 1 raised to the exponent operand 2 into
       operand 0.
  
!      The `pow' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `powf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `atan2M3'
       Store the arc tangent (inverse tangent) of operand 1 divided by
       operand 2 into operand 0, using the signs of both arguments to
       determine the quadrant of the result.
  
!      The `atan2' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `atan2f' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `floorM2'
       Store the largest integral value not greater than argument.
  
!      The `floor' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `floorf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `btruncM2'
       Store the argument rounded to integer towards zero.
  
!      The `trunc' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `truncf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `roundM2'
       Store the argument rounded to integer away from zero.
  
!      The `round' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `roundf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `ceilM2'
       Store the argument rounded to integer away from zero.
  
!      The `ceil' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `ceilf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `nearbyintM2'
       Store the argument rounded according to the default rounding mode
  
!      The `nearbyint' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `nearbyintf'
       built-in function uses the mode which corresponds to the C data
!      type `float'.
  
! `rintM2'
       Store the argument rounded according to the default rounding mode
       and raise the inexact exception when the result differs in value
       from the argument
  
!      The `rint' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `rintf' built-in
       function uses the mode which corresponds to the C data type
!      `float'.
  
! `lrintMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
       mode N as a signed number according to the current rounding mode
       and store in operand 0 (which has mode N).
  
! `lroundMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
       mode N as a signed number rounding to nearest and away from zero
       and store in operand 0 (which has mode N).
  
! `lfloorMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
       mode N as a signed number rounding down and store in operand 0
       (which has mode N).
  
! `lceilMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
!      mode N as a signed number rounding up and store in operand 0
!      (which has mode N).
  
! `copysignM3'
       Store a value with the magnitude of operand 1 and the sign of
       operand 2 into operand 0.
  
!      The `copysign' built-in function of C always uses the mode which
!      corresponds to the C data type `double' and the `copysignf'
       built-in function uses the mode which corresponds to the C data
!      type `float'.
  
! `ffsM2'
       Store into operand 0 one plus the index of the least significant
       1-bit of operand 1.  If operand 1 is zero, store zero.  M is the
       mode of operand 0; operand 1's mode is specified by the instruction
       pattern, and the compiler will convert the operand to that mode
       before generating the instruction.
  
!      The `ffs' built-in function of C always uses the mode which
!      corresponds to the C data type `int'.
  
! `clrsbM2'
!      Count leading redundant sign bits.  Store into operand 0 the
!      number of redundant sign bits in operand 1, starting at the most
       significant bit position.  A redundant sign bit is defined as any
!      sign bit after the first. As such, this count will be one less
       than the count of leading sign bits.
  
! `clzM2'
       Store into operand 0 the number of leading 0-bits in operand 1,
       starting at the most significant bit position.  If operand 1 is 0,
!      the `CLZ_DEFINED_VALUE_AT_ZERO' (*note Misc::) macro defines if
!      the result is undefined or has a useful value.  M is the mode of
       operand 0; operand 1's mode is specified by the instruction
       pattern, and the compiler will convert the operand to that mode
       before generating the instruction.
  
! `ctzM2'
       Store into operand 0 the number of trailing 0-bits in operand 1,
!      starting at the least significant bit position.  If operand 1 is
!      0, the `CTZ_DEFINED_VALUE_AT_ZERO' (*note Misc::) macro defines if
!      the result is undefined or has a useful value.  M is the mode of
       operand 0; operand 1's mode is specified by the instruction
       pattern, and the compiler will convert the operand to that mode
       before generating the instruction.
  
! `popcountM2'
       Store into operand 0 the number of 1-bits in operand 1.  M is the
       mode of operand 0; operand 1's mode is specified by the instruction
       pattern, and the compiler will convert the operand to that mode
       before generating the instruction.
  
! `parityM2'
       Store into operand 0 the parity of operand 1, i.e. the number of
       1-bits in operand 1 modulo 2.  M is the mode of operand 0; operand
       1's mode is specified by the instruction pattern, and the compiler
       will convert the operand to that mode before generating the
       instruction.
  
! `one_cmplM2'
       Store the bitwise-complement of operand 1 into operand 0.
  
! `movmemM'
       Block move instruction.  The destination and source blocks of
!      memory are the first two operands, and both are `mem:BLK's with an
!      address in mode `Pmode'.
  
       The number of bytes to move is the third operand, in mode M.
!      Usually, you specify `Pmode' for M.  However, if you can generate
       better code knowing the range of valid lengths is smaller than
       those representable in a full Pmode pointer, you should provide a
       pattern with a mode corresponding to the range of values you can
!      handle efficiently (e.g., `QImode' for values in the range 0-127;
!      note we avoid numbers that appear negative) and also a pattern
!      with `Pmode'.
  
       The fourth operand is the known shared alignment of the source and
!      destination, in the form of a `const_int' rtx.  Thus, if the
       compiler knows that both source and destination are word-aligned,
       it may provide the value 4 for this operand.
  
       Optional operands 5 and 6 specify expected alignment and size of
       block respectively.  The expected alignment differs from alignment
       in operand 4 in a way that the blocks are not required to be
!      aligned according to it in all cases. This expected alignment is
       also in bytes, just like operand 4.  Expected size, when unknown,
!      is set to `(const_int -1)'.
  
!      Descriptions of multiple `movmemM' patterns can only be beneficial
       if the patterns for smaller modes have fewer restrictions on their
       first, second and fourth operands.  Note that the mode M in
!      `movmemM' does not impose any restriction on the mode of
       individually moved data units in the block.
  
       These patterns need not give special consideration to the
       possibility that the source and destination strings might overlap.
  
! `movstr'
!      String copy instruction, with `stpcpy' semantics.  Operand 0 is an
!      output operand in mode `Pmode'.  The addresses of the destination
!      and source strings are operands 1 and 2, and both are `mem:BLK's
!      with addresses in mode `Pmode'.  The execution of the expansion of
       this pattern should store in operand 0 the address in which the
!      `NUL' terminator was stored in the destination string.
  
       This patern has also several optional operands that are same as in
!      `setmem'.
  
! `setmemM'
       Block set instruction.  The destination string is the first
!      operand, given as a `mem:BLK' whose address is in mode `Pmode'.
       The number of bytes to set is the second operand, in mode M.  The
!      value to initialize the memory with is the third operand. Targets
       that only support the clearing of memory should reject any value
!      that is not the constant 0.  See `movmemM' for a discussion of the
       choice of mode.
  
       The fourth operand is the known alignment of the destination, in
!      the form of a `const_int' rtx.  Thus, if the compiler knows that
       the destination is word-aligned, it may provide the value 4 for
       this operand.
  
       Optional operands 5 and 6 specify expected alignment and size of
       block respectively.  The expected alignment differs from alignment
       in operand 4 in a way that the blocks are not required to be
!      aligned according to it in all cases. This expected alignment is
       also in bytes, just like operand 4.  Expected size, when unknown,
!      is set to `(const_int -1)'.  Operand 7 is the minimal size of the
       block and operand 8 is the maximal size of the block (NULL if it
!      can not be represented as CONST_INT).  Operand 9 is the probable
!      maximal size (i.e. we can not rely on it for correctness, but it
       can be used for choosing proper code sequence for a given size).
  
!      The use for multiple `setmemM' is as for `movmemM'.
  
! `cmpstrnM'
       String compare instruction, with five operands.  Operand 0 is the
       output; it has mode M.  The remaining four operands are like the
!      operands of `movmemM'.  The two memory blocks specified are
       compared byte by byte in lexicographic order starting at the
       beginning of each string.  The instruction is not allowed to
       prefetch more than one byte at a time since either string may end
--- 23016,23448 ----
       A target shouldn't implement even/odd pattern pair if it is less
       efficient than lo/hi one.
  
! 'vec_widen_ushiftl_hi_M', 'vec_widen_ushiftl_lo_M'
! 'vec_widen_sshiftl_hi_M', 'vec_widen_sshiftl_lo_M'
       Signed/Unsigned widening shift left.  The first input (operand 1)
       is a vector with N signed/unsigned elements of size S.  Operand 2
       is a constant.  Shift the high/low elements of operand 1, and put
       the N/2 results of size 2*S in the output vector (operand 0).
  
! 'mulhisi3'
!      Multiply operands 1 and 2, which have mode 'HImode', and store a
!      'SImode' product in operand 0.
  
! 'mulqihi3', 'mulsidi3'
       Similar widening-multiplication instructions of other widths.
  
! 'umulqihi3', 'umulhisi3', 'umulsidi3'
       Similar widening-multiplication instructions that do unsigned
       multiplication.
  
! 'usmulqihi3', 'usmulhisi3', 'usmulsidi3'
       Similar widening-multiplication instructions that interpret the
!      first operand as unsigned and the second operand as signed, then do
!      a signed multiplication.
  
! 'smulM3_highpart'
       Perform a signed multiplication of operands 1 and 2, which have
       mode M, and store the most significant half of the product in
       operand 0.  The least significant half of the product is discarded.
  
! 'umulM3_highpart'
       Similar, but the multiplication is unsigned.
  
! 'maddMN4'
       Multiply operands 1 and 2, sign-extend them to mode N, add operand
!      3, and store the result in operand 0.  Operands 1 and 2 have mode M
!      and operands 0 and 3 have mode N.  Both modes must be integer or
       fixed-point modes and N must be twice the size of M.
  
!      In other words, 'maddMN4' is like 'mulMN3' except that it also adds
!      operand 3.
  
!      These instructions are not allowed to 'FAIL'.
  
! 'umaddMN4'
!      Like 'maddMN4', but zero-extend the multiplication operands instead
!      of sign-extending them.
  
! 'ssmaddMN4'
!      Like 'maddMN4', but all involved operations must be
       signed-saturating.
  
! 'usmaddMN4'
!      Like 'umaddMN4', but all involved operations must be
       unsigned-saturating.
  
! 'msubMN4'
       Multiply operands 1 and 2, sign-extend them to mode N, subtract the
!      result from operand 3, and store the result in operand 0.  Operands
!      1 and 2 have mode M and operands 0 and 3 have mode N.  Both modes
!      must be integer or fixed-point modes and N must be twice the size
!      of M.
  
!      In other words, 'msubMN4' is like 'mulMN3' except that it also
       subtracts the result from operand 3.
  
!      These instructions are not allowed to 'FAIL'.
  
! 'umsubMN4'
!      Like 'msubMN4', but zero-extend the multiplication operands instead
!      of sign-extending them.
  
! 'ssmsubMN4'
!      Like 'msubMN4', but all involved operations must be
       signed-saturating.
  
! 'usmsubMN4'
!      Like 'umsubMN4', but all involved operations must be
       unsigned-saturating.
  
! 'divmodM4'
       Signed division that produces both a quotient and a remainder.
       Operand 1 is divided by operand 2 to produce a quotient stored in
       operand 0 and a remainder stored in operand 3.
  
       For machines with an instruction that produces both a quotient and
!      a remainder, provide a pattern for 'divmodM4' but do not provide
!      patterns for 'divM3' and 'modM3'.  This allows optimization in the
       relatively common case when both the quotient and remainder are
       computed.
  
       If an instruction that just produces a quotient or just a remainder
       exists and is more efficient than the instruction that produces
!      both, write the output routine of 'divmodM4' to call
!      'find_reg_note' and look for a 'REG_UNUSED' note on the quotient or
!      remainder and generate the appropriate instruction.
  
! 'udivmodM4'
       Similar, but does unsigned division.
  
! 'ashlM3', 'ssashlM3', 'usashlM3'
       Arithmetic-shift operand 1 left by a number of bits specified by
       operand 2, and store the result in operand 0.  Here M is the mode
       of operand 0 and operand 1; operand 2's mode is specified by the
       instruction pattern, and the compiler will convert the operand to
       that mode before generating the instruction.  The meaning of
       out-of-range shift counts can optionally be specified by
!      'TARGET_SHIFT_TRUNCATION_MASK'.  *Note
       TARGET_SHIFT_TRUNCATION_MASK::.  Operand 2 is always a scalar type.
  
! 'ashrM3', 'lshrM3', 'rotlM3', 'rotrM3'
!      Other shift and rotate instructions, analogous to the 'ashlM3'
       instructions.  Operand 2 is always a scalar type.
  
! 'vashlM3', 'vashrM3', 'vlshrM3', 'vrotlM3', 'vrotrM3'
       Vector shift and rotate instructions that take vectors as operand 2
       instead of a scalar type.
  
! 'bswapM2'
       Reverse the order of bytes of operand 1 and store the result in
       operand 0.
  
! 'negM2', 'ssnegM2', 'usnegM2'
       Negate operand 1 and store the result in operand 0.
  
! 'negvM3'
!      Like 'negM2' but takes a 'code_label' as operand 2 and emits code
       to jump to it if signed overflow occurs during the negation.
  
! 'absM2'
       Store the absolute value of operand 1 into operand 0.
  
! 'sqrtM2'
       Store the square root of operand 1 into operand 0.
  
!      The 'sqrt' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'sqrtf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'fmodM3'
!      Store the remainder of dividing operand 1 by operand 2 into operand
!      0, rounded towards zero to an integer.
  
!      The 'fmod' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'fmodf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'remainderM3'
!      Store the remainder of dividing operand 1 by operand 2 into operand
!      0, rounded to the nearest integer.
  
!      The 'remainder' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'remainderf'
       built-in function uses the mode which corresponds to the C data
!      type 'float'.
  
! 'cosM2'
       Store the cosine of operand 1 into operand 0.
  
!      The 'cos' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'cosf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'sinM2'
       Store the sine of operand 1 into operand 0.
  
!      The 'sin' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'sinf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'sincosM3'
       Store the cosine of operand 2 into operand 0 and the sine of
       operand 2 into operand 1.
  
!      The 'sin' and 'cos' built-in functions of C always use the mode
!      which corresponds to the C data type 'double' and the 'sinf' and
!      'cosf' built-in function use the mode which corresponds to the C
!      data type 'float'.  Targets that can calculate the sine and cosine
       simultaneously can implement this pattern as opposed to
!      implementing individual 'sinM2' and 'cosM2' patterns.  The 'sin'
!      and 'cos' built-in functions will then be expanded to the
!      'sincosM3' pattern, with one of the output values left unused.
  
! 'expM2'
       Store the exponential of operand 1 into operand 0.
  
!      The 'exp' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'expf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'logM2'
       Store the natural logarithm of operand 1 into operand 0.
  
!      The 'log' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'logf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'powM3'
       Store the value of operand 1 raised to the exponent operand 2 into
       operand 0.
  
!      The 'pow' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'powf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'atan2M3'
       Store the arc tangent (inverse tangent) of operand 1 divided by
       operand 2 into operand 0, using the signs of both arguments to
       determine the quadrant of the result.
  
!      The 'atan2' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'atan2f' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'floorM2'
       Store the largest integral value not greater than argument.
  
!      The 'floor' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'floorf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'btruncM2'
       Store the argument rounded to integer towards zero.
  
!      The 'trunc' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'truncf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'roundM2'
       Store the argument rounded to integer away from zero.
  
!      The 'round' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'roundf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'ceilM2'
       Store the argument rounded to integer away from zero.
  
!      The 'ceil' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'ceilf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'nearbyintM2'
       Store the argument rounded according to the default rounding mode
  
!      The 'nearbyint' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'nearbyintf'
       built-in function uses the mode which corresponds to the C data
!      type 'float'.
  
! 'rintM2'
       Store the argument rounded according to the default rounding mode
       and raise the inexact exception when the result differs in value
       from the argument
  
!      The 'rint' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'rintf' built-in
       function uses the mode which corresponds to the C data type
!      'float'.
  
! 'lrintMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
       mode N as a signed number according to the current rounding mode
       and store in operand 0 (which has mode N).
  
! 'lroundMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
       mode N as a signed number rounding to nearest and away from zero
       and store in operand 0 (which has mode N).
  
! 'lfloorMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
       mode N as a signed number rounding down and store in operand 0
       (which has mode N).
  
! 'lceilMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
!      mode N as a signed number rounding up and store in operand 0 (which
!      has mode N).
  
! 'copysignM3'
       Store a value with the magnitude of operand 1 and the sign of
       operand 2 into operand 0.
  
!      The 'copysign' built-in function of C always uses the mode which
!      corresponds to the C data type 'double' and the 'copysignf'
       built-in function uses the mode which corresponds to the C data
!      type 'float'.
  
! 'ffsM2'
       Store into operand 0 one plus the index of the least significant
       1-bit of operand 1.  If operand 1 is zero, store zero.  M is the
       mode of operand 0; operand 1's mode is specified by the instruction
       pattern, and the compiler will convert the operand to that mode
       before generating the instruction.
  
!      The 'ffs' built-in function of C always uses the mode which
!      corresponds to the C data type 'int'.
  
! 'clrsbM2'
!      Count leading redundant sign bits.  Store into operand 0 the number
!      of redundant sign bits in operand 1, starting at the most
       significant bit position.  A redundant sign bit is defined as any
!      sign bit after the first.  As such, this count will be one less
       than the count of leading sign bits.
  
! 'clzM2'
       Store into operand 0 the number of leading 0-bits in operand 1,
       starting at the most significant bit position.  If operand 1 is 0,
!      the 'CLZ_DEFINED_VALUE_AT_ZERO' (*note Misc::) macro defines if the
!      result is undefined or has a useful value.  M is the mode of
       operand 0; operand 1's mode is specified by the instruction
       pattern, and the compiler will convert the operand to that mode
       before generating the instruction.
  
! 'ctzM2'
       Store into operand 0 the number of trailing 0-bits in operand 1,
!      starting at the least significant bit position.  If operand 1 is 0,
!      the 'CTZ_DEFINED_VALUE_AT_ZERO' (*note Misc::) macro defines if the
!      result is undefined or has a useful value.  M is the mode of
       operand 0; operand 1's mode is specified by the instruction
       pattern, and the compiler will convert the operand to that mode
       before generating the instruction.
  
! 'popcountM2'
       Store into operand 0 the number of 1-bits in operand 1.  M is the
       mode of operand 0; operand 1's mode is specified by the instruction
       pattern, and the compiler will convert the operand to that mode
       before generating the instruction.
  
! 'parityM2'
       Store into operand 0 the parity of operand 1, i.e. the number of
       1-bits in operand 1 modulo 2.  M is the mode of operand 0; operand
       1's mode is specified by the instruction pattern, and the compiler
       will convert the operand to that mode before generating the
       instruction.
  
! 'one_cmplM2'
       Store the bitwise-complement of operand 1 into operand 0.
  
! 'movmemM'
       Block move instruction.  The destination and source blocks of
!      memory are the first two operands, and both are 'mem:BLK's with an
!      address in mode 'Pmode'.
  
       The number of bytes to move is the third operand, in mode M.
!      Usually, you specify 'Pmode' for M.  However, if you can generate
       better code knowing the range of valid lengths is smaller than
       those representable in a full Pmode pointer, you should provide a
       pattern with a mode corresponding to the range of values you can
!      handle efficiently (e.g., 'QImode' for values in the range 0-127;
!      note we avoid numbers that appear negative) and also a pattern with
!      'Pmode'.
  
       The fourth operand is the known shared alignment of the source and
!      destination, in the form of a 'const_int' rtx.  Thus, if the
       compiler knows that both source and destination are word-aligned,
       it may provide the value 4 for this operand.
  
       Optional operands 5 and 6 specify expected alignment and size of
       block respectively.  The expected alignment differs from alignment
       in operand 4 in a way that the blocks are not required to be
!      aligned according to it in all cases.  This expected alignment is
       also in bytes, just like operand 4.  Expected size, when unknown,
!      is set to '(const_int -1)'.
  
!      Descriptions of multiple 'movmemM' patterns can only be beneficial
       if the patterns for smaller modes have fewer restrictions on their
       first, second and fourth operands.  Note that the mode M in
!      'movmemM' does not impose any restriction on the mode of
       individually moved data units in the block.
  
       These patterns need not give special consideration to the
       possibility that the source and destination strings might overlap.
  
! 'movstr'
!      String copy instruction, with 'stpcpy' semantics.  Operand 0 is an
!      output operand in mode 'Pmode'.  The addresses of the destination
!      and source strings are operands 1 and 2, and both are 'mem:BLK's
!      with addresses in mode 'Pmode'.  The execution of the expansion of
       this pattern should store in operand 0 the address in which the
!      'NUL' terminator was stored in the destination string.
  
       This patern has also several optional operands that are same as in
!      'setmem'.
  
! 'setmemM'
       Block set instruction.  The destination string is the first
!      operand, given as a 'mem:BLK' whose address is in mode 'Pmode'.
       The number of bytes to set is the second operand, in mode M.  The
!      value to initialize the memory with is the third operand.  Targets
       that only support the clearing of memory should reject any value
!      that is not the constant 0.  See 'movmemM' for a discussion of the
       choice of mode.
  
       The fourth operand is the known alignment of the destination, in
!      the form of a 'const_int' rtx.  Thus, if the compiler knows that
       the destination is word-aligned, it may provide the value 4 for
       this operand.
  
       Optional operands 5 and 6 specify expected alignment and size of
       block respectively.  The expected alignment differs from alignment
       in operand 4 in a way that the blocks are not required to be
!      aligned according to it in all cases.  This expected alignment is
       also in bytes, just like operand 4.  Expected size, when unknown,
!      is set to '(const_int -1)'.  Operand 7 is the minimal size of the
       block and operand 8 is the maximal size of the block (NULL if it
!      can not be represented as CONST_INT). Operand 9 is the probable
!      maximal size (i.e.  we can not rely on it for correctness, but it
       can be used for choosing proper code sequence for a given size).
  
!      The use for multiple 'setmemM' is as for 'movmemM'.
  
! 'cmpstrnM'
       String compare instruction, with five operands.  Operand 0 is the
       output; it has mode M.  The remaining four operands are like the
!      operands of 'movmemM'.  The two memory blocks specified are
       compared byte by byte in lexicographic order starting at the
       beginning of each string.  The instruction is not allowed to
       prefetch more than one byte at a time since either string may end
*************** pattern to accomplish a certain task.
*** 23814,23996 ****
       effect of the instruction is to store a value in operand 0 whose
       sign indicates the result of the comparison.
  
! `cmpstrM'
       String compare instruction, without known maximum length.  Operand
       0 is the output; it has mode M.  The second and third operand are
!      the blocks of memory to be compared; both are `mem:BLK' with an
!      address in mode `Pmode'.
  
       The fourth operand is the known shared alignment of the source and
!      destination, in the form of a `const_int' rtx.  Thus, if the
       compiler knows that both source and destination are word-aligned,
       it may provide the value 4 for this operand.
  
       The two memory blocks specified are compared byte by byte in
       lexicographic order starting at the beginning of each string.  The
!      instruction is not allowed to prefetch more than one byte at a
!      time since either string may end in the first byte and reading
!      past that may access an invalid page or segment and cause a fault.
!      The comparison will terminate when the fetched bytes are different
!      or if they are equal to zero.  The effect of the instruction is to
       store a value in operand 0 whose sign indicates the result of the
       comparison.
  
! `cmpmemM'
       Block compare instruction, with five operands like the operands of
!      `cmpstrM'.  The two memory blocks specified are compared byte by
       byte in lexicographic order starting at the beginning of each
!      block.  Unlike `cmpstrM' the instruction can prefetch any bytes in
!      the two memory blocks.  Also unlike `cmpstrM' the comparison will
       not stop if both bytes are zero.  The effect of the instruction is
       to store a value in operand 0 whose sign indicates the result of
       the comparison.
  
! `strlenM'
       Compute the length of a string, with three operands.  Operand 0 is
!      the result (of mode M), operand 1 is a `mem' referring to the
!      first character of the string, operand 2 is the character to
!      search for (normally zero), and operand 3 is a constant describing
!      the known alignment of the beginning of the string.
  
! `floatMN2'
       Convert signed integer operand 1 (valid for fixed point mode M) to
       floating point mode N and store in operand 0 (which has mode N).
  
! `floatunsMN2'
       Convert unsigned integer operand 1 (valid for fixed point mode M)
       to floating point mode N and store in operand 0 (which has mode N).
  
! `fixMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
       mode N as a signed number and store in operand 0 (which has mode
       N).  This instruction's result is defined only when the value of
       operand 1 is an integer.
  
       If the machine description defines this pattern, it also needs to
!      define the `ftrunc' pattern.
  
! `fixunsMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
!      mode N as an unsigned number and store in operand 0 (which has
!      mode N).  This instruction's result is defined only when the value
!      of operand 1 is an integer.
  
! `ftruncM2'
       Convert operand 1 (valid for floating point mode M) to an integer
       value, still represented in floating point mode M, and store it in
       operand 0 (valid for floating point mode M).
  
! `fix_truncMN2'
!      Like `fixMN2' but works for any floating point value of mode M by
       converting the value to an integer.
  
! `fixuns_truncMN2'
!      Like `fixunsMN2' but works for any floating point value of mode M
       by converting the value to an integer.
  
! `truncMN2'
       Truncate operand 1 (valid for mode M) to mode N and store in
       operand 0 (which has mode N).  Both modes must be fixed point or
       both floating point.
  
! `extendMN2'
       Sign-extend operand 1 (valid for mode M) to mode N and store in
       operand 0 (which has mode N).  Both modes must be fixed point or
       both floating point.
  
! `zero_extendMN2'
       Zero-extend operand 1 (valid for mode M) to mode N and store in
       operand 0 (which has mode N).  Both modes must be fixed point.
  
! `fractMN2'
!      Convert operand 1 of mode M to mode N and store in operand 0
!      (which has mode N).  Mode M and mode N could be fixed-point to
       fixed-point, signed integer to fixed-point, fixed-point to signed
       integer, floating-point to fixed-point, or fixed-point to
       floating-point.  When overflows or underflows happen, the results
       are undefined.
  
! `satfractMN2'
!      Convert operand 1 of mode M to mode N and store in operand 0
!      (which has mode N).  Mode M and mode N could be fixed-point to
       fixed-point, signed integer to fixed-point, or floating-point to
       fixed-point.  When overflows or underflows happen, the instruction
       saturates the results to the maximum or the minimum.
  
! `fractunsMN2'
!      Convert operand 1 of mode M to mode N and store in operand 0
!      (which has mode N).  Mode M and mode N could be unsigned integer
!      to fixed-point, or fixed-point to unsigned integer.  When
!      overflows or underflows happen, the results are undefined.
  
! `satfractunsMN2'
       Convert unsigned integer operand 1 of mode M to fixed-point mode N
       and store in operand 0 (which has mode N).  When overflows or
       underflows happen, the instruction saturates the results to the
       maximum or the minimum.
  
! `extvM'
       Extract a bit-field from register operand 1, sign-extend it, and
       store it in operand 0.  Operand 2 specifies the width of the field
       in bits and operand 3 the starting bit, which counts from the most
!      significant bit if `BITS_BIG_ENDIAN' is true and from the least
       significant bit otherwise.
  
       Operands 0 and 1 both have mode M.  Operands 2 and 3 have a
       target-specific mode.
  
! `extvmisalignM'
       Extract a bit-field from memory operand 1, sign extend it, and
       store it in operand 0.  Operand 2 specifies the width in bits and
       operand 3 the starting bit.  The starting bit is always somewhere
!      in the first byte of operand 1; it counts from the most
!      significant bit if `BITS_BIG_ENDIAN' is true and from the least
!      significant bit otherwise.
  
!      Operand 0 has mode M while operand 1 has `BLK' mode.  Operands 2
       and 3 have a target-specific mode.
  
       The instruction must not read beyond the last byte of the
       bit-field.
  
! `extzvM'
!      Like `extvM' except that the bit-field value is zero-extended.
  
! `extzvmisalignM'
!      Like `extvmisalignM' except that the bit-field value is
       zero-extended.
  
! `insvM'
       Insert operand 3 into a bit-field of register operand 0.  Operand 1
!      specifies the width of the field in bits and operand 2 the
!      starting bit, which counts from the most significant bit if
!      `BITS_BIG_ENDIAN' is true and from the least significant bit
       otherwise.
  
       Operands 0 and 3 both have mode M.  Operands 1 and 2 have a
       target-specific mode.
  
! `insvmisalignM'
       Insert operand 3 into a bit-field of memory operand 0.  Operand 1
!      specifies the width of the field in bits and operand 2 the
!      starting bit.  The starting bit is always somewhere in the first
!      byte of operand 0; it counts from the most significant bit if
!      `BITS_BIG_ENDIAN' is true and from the least significant bit
       otherwise.
  
!      Operand 3 has mode M while operand 0 has `BLK' mode.  Operands 1
       and 2 have a target-specific mode.
  
       The instruction must not read or write beyond the last byte of the
       bit-field.
  
! `extv'
       Extract a bit-field from operand 1 (a register or memory operand),
       where operand 2 specifies the width in bits and operand 3 the
       starting bit, and store it in operand 0.  Operand 0 must have mode
!      `word_mode'.  Operand 1 may have mode `byte_mode' or `word_mode';
!      often `word_mode' is allowed only for registers.  Operands 2 and 3
!      must be valid for `word_mode'.
  
       The RTL generation pass generates this instruction only with
       constants for operands 2 and 3 and the constant is never zero for
--- 23452,23634 ----
       effect of the instruction is to store a value in operand 0 whose
       sign indicates the result of the comparison.
  
! 'cmpstrM'
       String compare instruction, without known maximum length.  Operand
       0 is the output; it has mode M.  The second and third operand are
!      the blocks of memory to be compared; both are 'mem:BLK' with an
!      address in mode 'Pmode'.
  
       The fourth operand is the known shared alignment of the source and
!      destination, in the form of a 'const_int' rtx.  Thus, if the
       compiler knows that both source and destination are word-aligned,
       it may provide the value 4 for this operand.
  
       The two memory blocks specified are compared byte by byte in
       lexicographic order starting at the beginning of each string.  The
!      instruction is not allowed to prefetch more than one byte at a time
!      since either string may end in the first byte and reading past that
!      may access an invalid page or segment and cause a fault.  The
!      comparison will terminate when the fetched bytes are different or
!      if they are equal to zero.  The effect of the instruction is to
       store a value in operand 0 whose sign indicates the result of the
       comparison.
  
! 'cmpmemM'
       Block compare instruction, with five operands like the operands of
!      'cmpstrM'.  The two memory blocks specified are compared byte by
       byte in lexicographic order starting at the beginning of each
!      block.  Unlike 'cmpstrM' the instruction can prefetch any bytes in
!      the two memory blocks.  Also unlike 'cmpstrM' the comparison will
       not stop if both bytes are zero.  The effect of the instruction is
       to store a value in operand 0 whose sign indicates the result of
       the comparison.
  
! 'strlenM'
       Compute the length of a string, with three operands.  Operand 0 is
!      the result (of mode M), operand 1 is a 'mem' referring to the first
!      character of the string, operand 2 is the character to search for
!      (normally zero), and operand 3 is a constant describing the known
!      alignment of the beginning of the string.
  
! 'floatMN2'
       Convert signed integer operand 1 (valid for fixed point mode M) to
       floating point mode N and store in operand 0 (which has mode N).
  
! 'floatunsMN2'
       Convert unsigned integer operand 1 (valid for fixed point mode M)
       to floating point mode N and store in operand 0 (which has mode N).
  
! 'fixMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
       mode N as a signed number and store in operand 0 (which has mode
       N).  This instruction's result is defined only when the value of
       operand 1 is an integer.
  
       If the machine description defines this pattern, it also needs to
!      define the 'ftrunc' pattern.
  
! 'fixunsMN2'
       Convert operand 1 (valid for floating point mode M) to fixed point
!      mode N as an unsigned number and store in operand 0 (which has mode
!      N).  This instruction's result is defined only when the value of
!      operand 1 is an integer.
  
! 'ftruncM2'
       Convert operand 1 (valid for floating point mode M) to an integer
       value, still represented in floating point mode M, and store it in
       operand 0 (valid for floating point mode M).
  
! 'fix_truncMN2'
!      Like 'fixMN2' but works for any floating point value of mode M by
       converting the value to an integer.
  
! 'fixuns_truncMN2'
!      Like 'fixunsMN2' but works for any floating point value of mode M
       by converting the value to an integer.
  
! 'truncMN2'
       Truncate operand 1 (valid for mode M) to mode N and store in
       operand 0 (which has mode N).  Both modes must be fixed point or
       both floating point.
  
! 'extendMN2'
       Sign-extend operand 1 (valid for mode M) to mode N and store in
       operand 0 (which has mode N).  Both modes must be fixed point or
       both floating point.
  
! 'zero_extendMN2'
       Zero-extend operand 1 (valid for mode M) to mode N and store in
       operand 0 (which has mode N).  Both modes must be fixed point.
  
! 'fractMN2'
!      Convert operand 1 of mode M to mode N and store in operand 0 (which
!      has mode N).  Mode M and mode N could be fixed-point to
       fixed-point, signed integer to fixed-point, fixed-point to signed
       integer, floating-point to fixed-point, or fixed-point to
       floating-point.  When overflows or underflows happen, the results
       are undefined.
  
! 'satfractMN2'
!      Convert operand 1 of mode M to mode N and store in operand 0 (which
!      has mode N).  Mode M and mode N could be fixed-point to
       fixed-point, signed integer to fixed-point, or floating-point to
       fixed-point.  When overflows or underflows happen, the instruction
       saturates the results to the maximum or the minimum.
  
! 'fractunsMN2'
!      Convert operand 1 of mode M to mode N and store in operand 0 (which
!      has mode N).  Mode M and mode N could be unsigned integer to
!      fixed-point, or fixed-point to unsigned integer.  When overflows or
!      underflows happen, the results are undefined.
  
! 'satfractunsMN2'
       Convert unsigned integer operand 1 of mode M to fixed-point mode N
       and store in operand 0 (which has mode N).  When overflows or
       underflows happen, the instruction saturates the results to the
       maximum or the minimum.
  
! 'extvM'
       Extract a bit-field from register operand 1, sign-extend it, and
       store it in operand 0.  Operand 2 specifies the width of the field
       in bits and operand 3 the starting bit, which counts from the most
!      significant bit if 'BITS_BIG_ENDIAN' is true and from the least
       significant bit otherwise.
  
       Operands 0 and 1 both have mode M.  Operands 2 and 3 have a
       target-specific mode.
  
! 'extvmisalignM'
       Extract a bit-field from memory operand 1, sign extend it, and
       store it in operand 0.  Operand 2 specifies the width in bits and
       operand 3 the starting bit.  The starting bit is always somewhere
!      in the first byte of operand 1; it counts from the most significant
!      bit if 'BITS_BIG_ENDIAN' is true and from the least significant bit
!      otherwise.
  
!      Operand 0 has mode M while operand 1 has 'BLK' mode.  Operands 2
       and 3 have a target-specific mode.
  
       The instruction must not read beyond the last byte of the
       bit-field.
  
! 'extzvM'
!      Like 'extvM' except that the bit-field value is zero-extended.
  
! 'extzvmisalignM'
!      Like 'extvmisalignM' except that the bit-field value is
       zero-extended.
  
! 'insvM'
       Insert operand 3 into a bit-field of register operand 0.  Operand 1
!      specifies the width of the field in bits and operand 2 the starting
!      bit, which counts from the most significant bit if
!      'BITS_BIG_ENDIAN' is true and from the least significant bit
       otherwise.
  
       Operands 0 and 3 both have mode M.  Operands 1 and 2 have a
       target-specific mode.
  
! 'insvmisalignM'
       Insert operand 3 into a bit-field of memory operand 0.  Operand 1
!      specifies the width of the field in bits and operand 2 the starting
!      bit.  The starting bit is always somewhere in the first byte of
!      operand 0; it counts from the most significant bit if
!      'BITS_BIG_ENDIAN' is true and from the least significant bit
       otherwise.
  
!      Operand 3 has mode M while operand 0 has 'BLK' mode.  Operands 1
       and 2 have a target-specific mode.
  
       The instruction must not read or write beyond the last byte of the
       bit-field.
  
! 'extv'
       Extract a bit-field from operand 1 (a register or memory operand),
       where operand 2 specifies the width in bits and operand 3 the
       starting bit, and store it in operand 0.  Operand 0 must have mode
!      'word_mode'.  Operand 1 may have mode 'byte_mode' or 'word_mode';
!      often 'word_mode' is allowed only for registers.  Operands 2 and 3
!      must be valid for 'word_mode'.
  
       The RTL generation pass generates this instruction only with
       constants for operands 2 and 3 and the constant is never zero for
*************** pattern to accomplish a certain task.
*** 23999,24101 ****
       The bit-field value is sign-extended to a full word integer before
       it is stored in operand 0.
  
!      This pattern is deprecated; please use `extvM' and `extvmisalignM'
       instead.
  
! `extzv'
!      Like `extv' except that the bit-field value is zero-extended.
  
!      This pattern is deprecated; please use `extzvM' and
!      `extzvmisalignM' instead.
  
! `insv'
!      Store operand 3 (which must be valid for `word_mode') into a
!      bit-field in operand 0, where operand 1 specifies the width in
!      bits and operand 2 the starting bit.  Operand 0 may have mode
!      `byte_mode' or `word_mode'; often `word_mode' is allowed only for
!      registers.  Operands 1 and 2 must be valid for `word_mode'.
  
       The RTL generation pass generates this instruction only with
       constants for operands 1 and 2 and the constant is never zero for
       operand 1.
  
!      This pattern is deprecated; please use `insvM' and `insvmisalignM'
       instead.
  
! `movMODEcc'
       Conditionally move operand 2 or operand 3 into operand 0 according
!      to the comparison in operand 1.  If the comparison is true,
!      operand 2 is moved into operand 0, otherwise operand 3 is moved.
  
!      The mode of the operands being compared need not be the same as
!      the operands being moved.  Some machines, sparc64 for example,
!      have instructions that conditionally move an integer value based
!      on the floating point condition codes and vice versa.
  
       If the machine does not have conditional move instructions, do not
       define these patterns.
  
! `addMODEcc'
!      Similar to `movMODEcc' but for conditional addition.  Conditionally
!      move operand 2 or (operands 2 + operand 3) into operand 0
!      according to the comparison in operand 1.  If the comparison is
!      false, operand 2 is moved into operand 0, otherwise (operand 2 +
!      operand 3) is moved.
  
! `cstoreMODE4'
       Store zero or nonzero in operand 0 according to whether a
!      comparison is true.  Operand 1 is a comparison operator.  Operand
!      2 and operand 3 are the first and second operand of the
!      comparison, respectively.  You specify the mode that operand 0
!      must have when you write the `match_operand' expression.  The
!      compiler automatically sees which mode you have used and supplies
!      an operand of that mode.
  
       The value stored for a true condition must have 1 as its low bit,
       or else must be negative.  Otherwise the instruction is not
       suitable and you should omit it from the machine description.  You
       describe to the compiler exactly which value is stored by defining
!      the macro `STORE_FLAG_VALUE' (*note Misc::).  If a description
       cannot be found that can be used for all the possible comparison
!      operators, you should pick one and use a `define_expand' to map
!      all results onto the one you chose.
  
!      These operations may `FAIL', but should do so only in relatively
!      uncommon cases; if they would `FAIL' for common cases involving
       integer comparisons, it is best to restrict the predicates to not
       allow these operands.  Likewise if a given comparison operator will
!      always fail, independent of the operands (for floating-point
!      modes, the `ordered_comparison_operator' predicate is often useful
!      in this case).
  
       If this pattern is omitted, the compiler will generate a
       conditional branch--for example, it may copy a constant one to the
!      target and branching around an assignment of zero to the
!      target--or a libcall.  If the predicate for operand 1 only rejects
!      some operators, it will also try reordering the operands and/or
!      inverting the result value (e.g. by an exclusive OR).  These
       possibilities could be cheaper or equivalent to the instructions
!      used for the `cstoreMODE4' pattern followed by those required to
!      convert a positive result from `STORE_FLAG_VALUE' to 1; in this
       case, you can and should make operand 1's predicate reject some
!      operators in the `cstoreMODE4' pattern, or remove the pattern
       altogether from the machine description.
  
! `cbranchMODE4'
       Conditional branch instruction combined with a compare instruction.
       Operand 0 is a comparison operator.  Operand 1 and operand 2 are
       the first and second operands of the comparison, respectively.
!      Operand 3 is the `code_label' to jump to.
  
! `jump'
       A jump inside a function; an unconditional branch.  Operand 0 is
!      the `code_label' to jump to.  This pattern name is mandatory on all
       machines.
  
! `call'
       Subroutine call instruction returning no value.  Operand 0 is the
       function to call; operand 1 is the number of bytes of arguments
!      pushed as a `const_int'; operand 2 is the number of registers used
       as operands.
  
       On most machines, operand 2 is not actually stored into the RTL
--- 23637,23739 ----
       The bit-field value is sign-extended to a full word integer before
       it is stored in operand 0.
  
!      This pattern is deprecated; please use 'extvM' and 'extvmisalignM'
       instead.
  
! 'extzv'
!      Like 'extv' except that the bit-field value is zero-extended.
  
!      This pattern is deprecated; please use 'extzvM' and
!      'extzvmisalignM' instead.
  
! 'insv'
!      Store operand 3 (which must be valid for 'word_mode') into a
!      bit-field in operand 0, where operand 1 specifies the width in bits
!      and operand 2 the starting bit.  Operand 0 may have mode
!      'byte_mode' or 'word_mode'; often 'word_mode' is allowed only for
!      registers.  Operands 1 and 2 must be valid for 'word_mode'.
  
       The RTL generation pass generates this instruction only with
       constants for operands 1 and 2 and the constant is never zero for
       operand 1.
  
!      This pattern is deprecated; please use 'insvM' and 'insvmisalignM'
       instead.
  
! 'movMODEcc'
       Conditionally move operand 2 or operand 3 into operand 0 according
!      to the comparison in operand 1.  If the comparison is true, operand
!      2 is moved into operand 0, otherwise operand 3 is moved.
  
!      The mode of the operands being compared need not be the same as the
!      operands being moved.  Some machines, sparc64 for example, have
!      instructions that conditionally move an integer value based on the
!      floating point condition codes and vice versa.
  
       If the machine does not have conditional move instructions, do not
       define these patterns.
  
! 'addMODEcc'
!      Similar to 'movMODEcc' but for conditional addition.  Conditionally
!      move operand 2 or (operands 2 + operand 3) into operand 0 according
!      to the comparison in operand 1.  If the comparison is false,
!      operand 2 is moved into operand 0, otherwise (operand 2 + operand
!      3) is moved.
  
! 'cstoreMODE4'
       Store zero or nonzero in operand 0 according to whether a
!      comparison is true.  Operand 1 is a comparison operator.  Operand 2
!      and operand 3 are the first and second operand of the comparison,
!      respectively.  You specify the mode that operand 0 must have when
!      you write the 'match_operand' expression.  The compiler
!      automatically sees which mode you have used and supplies an operand
!      of that mode.
  
       The value stored for a true condition must have 1 as its low bit,
       or else must be negative.  Otherwise the instruction is not
       suitable and you should omit it from the machine description.  You
       describe to the compiler exactly which value is stored by defining
!      the macro 'STORE_FLAG_VALUE' (*note Misc::).  If a description
       cannot be found that can be used for all the possible comparison
!      operators, you should pick one and use a 'define_expand' to map all
!      results onto the one you chose.
  
!      These operations may 'FAIL', but should do so only in relatively
!      uncommon cases; if they would 'FAIL' for common cases involving
       integer comparisons, it is best to restrict the predicates to not
       allow these operands.  Likewise if a given comparison operator will
!      always fail, independent of the operands (for floating-point modes,
!      the 'ordered_comparison_operator' predicate is often useful in this
!      case).
  
       If this pattern is omitted, the compiler will generate a
       conditional branch--for example, it may copy a constant one to the
!      target and branching around an assignment of zero to the target--or
!      a libcall.  If the predicate for operand 1 only rejects some
!      operators, it will also try reordering the operands and/or
!      inverting the result value (e.g. by an exclusive OR). These
       possibilities could be cheaper or equivalent to the instructions
!      used for the 'cstoreMODE4' pattern followed by those required to
!      convert a positive result from 'STORE_FLAG_VALUE' to 1; in this
       case, you can and should make operand 1's predicate reject some
!      operators in the 'cstoreMODE4' pattern, or remove the pattern
       altogether from the machine description.
  
! 'cbranchMODE4'
       Conditional branch instruction combined with a compare instruction.
       Operand 0 is a comparison operator.  Operand 1 and operand 2 are
       the first and second operands of the comparison, respectively.
!      Operand 3 is the 'code_label' to jump to.
  
! 'jump'
       A jump inside a function; an unconditional branch.  Operand 0 is
!      the 'code_label' to jump to.  This pattern name is mandatory on all
       machines.
  
! 'call'
       Subroutine call instruction returning no value.  Operand 0 is the
       function to call; operand 1 is the number of bytes of arguments
!      pushed as a 'const_int'; operand 2 is the number of registers used
       as operands.
  
       On most machines, operand 2 is not actually stored into the RTL
*************** pattern to accomplish a certain task.
*** 24103,24181 ****
       need to put this information into the assembler code; they can put
       it in the RTL instead of operand 1.
  
!      Operand 0 should be a `mem' RTX whose address is the address of the
!      function.  Note, however, that this address can be a `symbol_ref'
       expression even if it would not be a legitimate memory address on
       the target machine.  If it is also not a valid argument for a call
       instruction, the pattern for this operation should be a
!      `define_expand' (*note Expander Definitions::) that places the
       address into a register and uses that register in the call
       instruction.
  
! `call_value'
       Subroutine call instruction returning a value.  Operand 0 is the
       hard register in which the value is returned.  There are three more
!      operands, the same as the three operands of the `call' instruction
       (but with numbers increased by one).
  
!      Subroutines that return `BLKmode' objects use the `call' insn.
  
! `call_pop', `call_value_pop'
!      Similar to `call' and `call_value', except used if defined and if
!      `RETURN_POPS_ARGS' is nonzero.  They should emit a `parallel' that
!      contains both the function call and a `set' to indicate the
       adjustment made to the frame pointer.
  
!      For machines where `RETURN_POPS_ARGS' can be nonzero, the use of
       these patterns increases the number of functions for which the
       frame pointer can be eliminated, if desired.
  
! `untyped_call'
!      Subroutine call instruction returning a value of any type.
!      Operand 0 is the function to call; operand 1 is a memory location
!      where the result of calling the function is to be stored; operand
!      2 is a `parallel' expression where each element is a `set'
!      expression that indicates the saving of a function return value
!      into the result block.
  
       This instruction pattern should be defined to support
!      `__builtin_apply' on machines where special instructions are needed
       to call a subroutine with arbitrary arguments or to save the value
       returned.  This instruction pattern is required on machines that
       have multiple registers that can hold a return value (i.e.
!      `FUNCTION_VALUE_REGNO_P' is true for more than one register).
  
! `return'
       Subroutine return instruction.  This instruction pattern name
       should be defined only if a single instruction can do all the work
       of returning from a function.
  
!      Like the `movM' patterns, this pattern is also used after the RTL
       generation phase.  In this case it is to support machines where
!      multiple instructions are usually needed to return from a
!      function, but some class of functions only requires one
!      instruction to implement a return.  Normally, the applicable
!      functions are those which do not need to save any registers or
!      allocate stack space.
  
       It is valid for this pattern to expand to an instruction using
!      `simple_return' if no epilogue is required.
  
! `simple_return'
       Subroutine return instruction.  This instruction pattern name
       should be defined only if a single instruction can do all the work
       of returning from a function on a path where no epilogue is
!      required.  This pattern is very similar to the `return'
!      instruction pattern, but it is emitted only by the shrink-wrapping
!      optimization on paths where the function prologue has not been
!      executed, and a function return should occur without any of the
!      effects of the epilogue.  Additional uses may be introduced on
!      paths where both the prologue and the epilogue have executed.
  
       For such machines, the condition specified in this pattern should
!      only be true when `reload_completed' is nonzero and the function's
       epilogue would only be a single instruction.  For machines with
!      register windows, the routine `leaf_function_p' may be used to
       determine if a register window push is required.
  
       Machines that have conditional return instructions should define
--- 23741,23818 ----
       need to put this information into the assembler code; they can put
       it in the RTL instead of operand 1.
  
!      Operand 0 should be a 'mem' RTX whose address is the address of the
!      function.  Note, however, that this address can be a 'symbol_ref'
       expression even if it would not be a legitimate memory address on
       the target machine.  If it is also not a valid argument for a call
       instruction, the pattern for this operation should be a
!      'define_expand' (*note Expander Definitions::) that places the
       address into a register and uses that register in the call
       instruction.
  
! 'call_value'
       Subroutine call instruction returning a value.  Operand 0 is the
       hard register in which the value is returned.  There are three more
!      operands, the same as the three operands of the 'call' instruction
       (but with numbers increased by one).
  
!      Subroutines that return 'BLKmode' objects use the 'call' insn.
  
! 'call_pop', 'call_value_pop'
!      Similar to 'call' and 'call_value', except used if defined and if
!      'RETURN_POPS_ARGS' is nonzero.  They should emit a 'parallel' that
!      contains both the function call and a 'set' to indicate the
       adjustment made to the frame pointer.
  
!      For machines where 'RETURN_POPS_ARGS' can be nonzero, the use of
       these patterns increases the number of functions for which the
       frame pointer can be eliminated, if desired.
  
! 'untyped_call'
!      Subroutine call instruction returning a value of any type.  Operand
!      0 is the function to call; operand 1 is a memory location where the
!      result of calling the function is to be stored; operand 2 is a
!      'parallel' expression where each element is a 'set' expression that
!      indicates the saving of a function return value into the result
!      block.
  
       This instruction pattern should be defined to support
!      '__builtin_apply' on machines where special instructions are needed
       to call a subroutine with arbitrary arguments or to save the value
       returned.  This instruction pattern is required on machines that
       have multiple registers that can hold a return value (i.e.
!      'FUNCTION_VALUE_REGNO_P' is true for more than one register).
  
! 'return'
       Subroutine return instruction.  This instruction pattern name
       should be defined only if a single instruction can do all the work
       of returning from a function.
  
!      Like the 'movM' patterns, this pattern is also used after the RTL
       generation phase.  In this case it is to support machines where
!      multiple instructions are usually needed to return from a function,
!      but some class of functions only requires one instruction to
!      implement a return.  Normally, the applicable functions are those
!      which do not need to save any registers or allocate stack space.
  
       It is valid for this pattern to expand to an instruction using
!      'simple_return' if no epilogue is required.
  
! 'simple_return'
       Subroutine return instruction.  This instruction pattern name
       should be defined only if a single instruction can do all the work
       of returning from a function on a path where no epilogue is
!      required.  This pattern is very similar to the 'return' instruction
!      pattern, but it is emitted only by the shrink-wrapping optimization
!      on paths where the function prologue has not been executed, and a
!      function return should occur without any of the effects of the
!      epilogue.  Additional uses may be introduced on paths where both
!      the prologue and the epilogue have executed.
  
       For such machines, the condition specified in this pattern should
!      only be true when 'reload_completed' is nonzero and the function's
       epilogue would only be a single instruction.  For machines with
!      register windows, the routine 'leaf_function_p' may be used to
       determine if a register window push is required.
  
       Machines that have conditional return instructions should define
*************** pattern to accomplish a certain task.
*** 24192,24224 ****
              "...")
  
       where CONDITION would normally be the same condition specified on
!      the named `return' pattern.
  
! `untyped_return'
       Untyped subroutine return instruction.  This instruction pattern
!      should be defined to support `__builtin_return' on machines where
       special instructions are needed to return a value of any type.
  
       Operand 0 is a memory location where the result of calling a
!      function with `__builtin_apply' is stored; operand 1 is a
!      `parallel' expression where each element is a `set' expression
!      that indicates the restoring of a function return value from the
!      result block.
  
! `nop'
       No-op instruction.  This instruction pattern name should always be
!      defined to output a no-op in assembler code.  `(const_int 0)' will
       do as an RTL pattern.
  
! `indirect_jump'
       An instruction to jump to an address which is operand zero.  This
       pattern name is mandatory on all machines.
  
! `casesi'
       Instruction to jump through a dispatch table, including bounds
       checking.  This instruction takes five operands:
  
!        1. The index to dispatch on, which has mode `SImode'.
  
         2. The lower bound for indices in the table, an integer constant.
  
--- 23829,23861 ----
              "...")
  
       where CONDITION would normally be the same condition specified on
!      the named 'return' pattern.
  
! 'untyped_return'
       Untyped subroutine return instruction.  This instruction pattern
!      should be defined to support '__builtin_return' on machines where
       special instructions are needed to return a value of any type.
  
       Operand 0 is a memory location where the result of calling a
!      function with '__builtin_apply' is stored; operand 1 is a
!      'parallel' expression where each element is a 'set' expression that
!      indicates the restoring of a function return value from the result
!      block.
  
! 'nop'
       No-op instruction.  This instruction pattern name should always be
!      defined to output a no-op in assembler code.  '(const_int 0)' will
       do as an RTL pattern.
  
! 'indirect_jump'
       An instruction to jump to an address which is operand zero.  This
       pattern name is mandatory on all machines.
  
! 'casesi'
       Instruction to jump through a dispatch table, including bounds
       checking.  This instruction takes five operands:
  
!        1. The index to dispatch on, which has mode 'SImode'.
  
         2. The lower bound for indices in the table, an integer constant.
  
*************** pattern to accomplish a certain task.
*** 24230,24295 ****
         5. A label to jump to if the index has a value outside the
            bounds.
  
!      The table is an `addr_vec' or `addr_diff_vec' inside of a
!      `jump_table_data'.  The number of elements in the table is one
!      plus the difference between the upper bound and the lower bound.
  
! `tablejump'
       Instruction to jump to a variable address.  This is a low-level
       capability which can be used to implement a dispatch table when
!      there is no `casesi' pattern.
  
       This pattern requires two operands: the address or offset, and a
       label which should immediately precede the jump table.  If the
!      macro `CASE_VECTOR_PC_RELATIVE' evaluates to a nonzero value then
!      the first operand is an offset which counts from the address of
!      the table; otherwise, it is an absolute address to jump to.  In
!      either case, the first operand has mode `Pmode'.
  
!      The `tablejump' insn is always the last insn before the jump table
!      it uses.  Its assembler code normally has no need to use the
!      second operand, but you should incorporate it in the RTL pattern so
!      that the jump optimizer will not delete the table as unreachable
!      code.
  
! `decrement_and_branch_until_zero'
!      Conditional branch instruction that decrements a register and
!      jumps if the register is nonzero.  Operand 0 is the register to
!      decrement and test; operand 1 is the label to jump to if the
!      register is nonzero.  *Note Looping Patterns::.
  
       This optional instruction pattern is only used by the combiner,
       typically for loops reversed by the loop optimizer when strength
       reduction is enabled.
  
! `doloop_end'
!      Conditional branch instruction that decrements a register and
!      jumps if the register is nonzero.  Operand 0 is the register to
!      decrement and test; operand 1 is the label to jump to if the
!      register is nonzero.  *Note Looping Patterns::.
  
       This optional instruction pattern should be defined for machines
       with low-overhead looping instructions as the loop optimizer will
       try to modify suitable loops to utilize it.  The target hook
!      `TARGET_CAN_USE_DOLOOP_P' controls the conditions under which
       low-overhead loops can be used.
  
! `doloop_begin'
!      Companion instruction to `doloop_end' required for machines that
       need to perform some initialization, such as loading a special
!      counter register.  Operand 1 is the associated `doloop_end'
!      pattern and operand 0 is the register that it decrements.
  
       If initialization insns do not always need to be emitted, use a
!      `define_expand' (*note Expander Definitions::) and make it fail.
  
! `canonicalize_funcptr_for_compare'
       Canonicalize the function pointer in operand 1 and store the result
       into operand 0.
  
!      Operand 0 is always a `reg' and has mode `Pmode'; operand 1 may be
!      a `reg', `mem', `symbol_ref', `const_int', etc and also has mode
!      `Pmode'.
  
       Canonicalization of a function pointer usually involves computing
       the address of the function which would be called if the function
--- 23867,23931 ----
         5. A label to jump to if the index has a value outside the
            bounds.
  
!      The table is an 'addr_vec' or 'addr_diff_vec' inside of a
!      'jump_table_data'.  The number of elements in the table is one plus
!      the difference between the upper bound and the lower bound.
  
! 'tablejump'
       Instruction to jump to a variable address.  This is a low-level
       capability which can be used to implement a dispatch table when
!      there is no 'casesi' pattern.
  
       This pattern requires two operands: the address or offset, and a
       label which should immediately precede the jump table.  If the
!      macro 'CASE_VECTOR_PC_RELATIVE' evaluates to a nonzero value then
!      the first operand is an offset which counts from the address of the
!      table; otherwise, it is an absolute address to jump to.  In either
!      case, the first operand has mode 'Pmode'.
  
!      The 'tablejump' insn is always the last insn before the jump table
!      it uses.  Its assembler code normally has no need to use the second
!      operand, but you should incorporate it in the RTL pattern so that
!      the jump optimizer will not delete the table as unreachable code.
  
! 'decrement_and_branch_until_zero'
!      Conditional branch instruction that decrements a register and jumps
!      if the register is nonzero.  Operand 0 is the register to decrement
!      and test; operand 1 is the label to jump to if the register is
!      nonzero.  *Note Looping Patterns::.
  
       This optional instruction pattern is only used by the combiner,
       typically for loops reversed by the loop optimizer when strength
       reduction is enabled.
  
! 'doloop_end'
!      Conditional branch instruction that decrements a register and jumps
!      if the register is nonzero.  Operand 0 is the register to decrement
!      and test; operand 1 is the label to jump to if the register is
!      nonzero.  *Note Looping Patterns::.
  
       This optional instruction pattern should be defined for machines
       with low-overhead looping instructions as the loop optimizer will
       try to modify suitable loops to utilize it.  The target hook
!      'TARGET_CAN_USE_DOLOOP_P' controls the conditions under which
       low-overhead loops can be used.
  
! 'doloop_begin'
!      Companion instruction to 'doloop_end' required for machines that
       need to perform some initialization, such as loading a special
!      counter register.  Operand 1 is the associated 'doloop_end' pattern
!      and operand 0 is the register that it decrements.
  
       If initialization insns do not always need to be emitted, use a
!      'define_expand' (*note Expander Definitions::) and make it fail.
  
! 'canonicalize_funcptr_for_compare'
       Canonicalize the function pointer in operand 1 and store the result
       into operand 0.
  
!      Operand 0 is always a 'reg' and has mode 'Pmode'; operand 1 may be
!      a 'reg', 'mem', 'symbol_ref', 'const_int', etc and also has mode
!      'Pmode'.
  
       Canonicalization of a function pointer usually involves computing
       the address of the function which would be called if the function
*************** pattern to accomplish a certain task.
*** 24299,24336 ****
       can have different values but still call the same function when
       used in an indirect call.
  
! `save_stack_block'
! `save_stack_function'
! `save_stack_nonlocal'
! `restore_stack_block'
! `restore_stack_function'
! `restore_stack_nonlocal'
       Most machines save and restore the stack pointer by copying it to
!      or from an object of mode `Pmode'.  Do not define these patterns on
       such machines.
  
       Some machines require special handling for stack pointer saves and
       restores.  On those machines, define the patterns corresponding to
!      the non-standard cases by using a `define_expand' (*note Expander
       Definitions::) that produces the required insns.  The three types
       of saves and restores are:
  
!        1. `save_stack_block' saves the stack pointer at the start of a
            block that allocates a variable-sized object, and
!           `restore_stack_block' restores the stack pointer when the
            block is exited.
  
!        2. `save_stack_function' and `restore_stack_function' do a
!           similar job for the outermost block of a function and are
!           used when the function allocates variable-sized objects or
!           calls `alloca'.  Only the epilogue uses the restored stack
!           pointer, allowing a simpler save or restore sequence on some
!           machines.
  
!        3. `save_stack_nonlocal' is used in functions that contain labels
            branched to by nested functions.  It saves the stack pointer
            in such a way that the inner function can use
!           `restore_stack_nonlocal' to restore the stack pointer.  The
            compiler generates code to restore the frame and argument
            pointer registers, but some machines require saving and
            restoring additional data such as register window information
--- 23935,23971 ----
       can have different values but still call the same function when
       used in an indirect call.
  
! 'save_stack_block'
! 'save_stack_function'
! 'save_stack_nonlocal'
! 'restore_stack_block'
! 'restore_stack_function'
! 'restore_stack_nonlocal'
       Most machines save and restore the stack pointer by copying it to
!      or from an object of mode 'Pmode'.  Do not define these patterns on
       such machines.
  
       Some machines require special handling for stack pointer saves and
       restores.  On those machines, define the patterns corresponding to
!      the non-standard cases by using a 'define_expand' (*note Expander
       Definitions::) that produces the required insns.  The three types
       of saves and restores are:
  
!        1. 'save_stack_block' saves the stack pointer at the start of a
            block that allocates a variable-sized object, and
!           'restore_stack_block' restores the stack pointer when the
            block is exited.
  
!        2. 'save_stack_function' and 'restore_stack_function' do a
!           similar job for the outermost block of a function and are used
!           when the function allocates variable-sized objects or calls
!           'alloca'.  Only the epilogue uses the restored stack pointer,
!           allowing a simpler save or restore sequence on some machines.
  
!        3. 'save_stack_nonlocal' is used in functions that contain labels
            branched to by nested functions.  It saves the stack pointer
            in such a way that the inner function can use
!           'restore_stack_nonlocal' to restore the stack pointer.  The
            compiler generates code to restore the frame and argument
            pointer registers, but some machines require saving and
            restoring additional data such as register window information
*************** pattern to accomplish a certain task.
*** 24338,24366 ****
            and restore any such required data.
  
       When saving the stack pointer, operand 0 is the save area and
!      operand 1 is the stack pointer.  The mode used to allocate the
!      save area defaults to `Pmode' but you can override that choice by
!      defining the `STACK_SAVEAREA_MODE' macro (*note Storage Layout::).
!      You must specify an integral mode, or `VOIDmode' if no save area
!      is needed for a particular type of save (either because no save is
       needed or because a machine-specific save area can be used).
       Operand 0 is the stack pointer and operand 1 is the save area for
!      restore operations.  If `save_stack_block' is defined, operand 0
!      must not be `VOIDmode' since these saves can be arbitrarily nested.
  
!      A save area is a `mem' that is at a constant offset from
!      `virtual_stack_vars_rtx' when the stack pointer is saved for use by
!      nonlocal gotos and a `reg' in the other two cases.
  
! `allocate_stack'
!      Subtract (or add if `STACK_GROWS_DOWNWARD' is undefined) operand 1
       from the stack pointer to create space for dynamically allocated
       data.
  
       Store the resultant pointer to this space into operand 0.  If you
       are allocating space from the main stack, do this by emitting a
!      move insn to copy `virtual_stack_dynamic_rtx' to operand 0.  If
!      you are allocating the space elsewhere, generate code to copy the
       location of the space to operand 0.  In the latter case, you must
       ensure this space gets freed when the corresponding space on the
       main stack is free.
--- 23973,24001 ----
            and restore any such required data.
  
       When saving the stack pointer, operand 0 is the save area and
!      operand 1 is the stack pointer.  The mode used to allocate the save
!      area defaults to 'Pmode' but you can override that choice by
!      defining the 'STACK_SAVEAREA_MODE' macro (*note Storage Layout::).
!      You must specify an integral mode, or 'VOIDmode' if no save area is
!      needed for a particular type of save (either because no save is
       needed or because a machine-specific save area can be used).
       Operand 0 is the stack pointer and operand 1 is the save area for
!      restore operations.  If 'save_stack_block' is defined, operand 0
!      must not be 'VOIDmode' since these saves can be arbitrarily nested.
  
!      A save area is a 'mem' that is at a constant offset from
!      'virtual_stack_vars_rtx' when the stack pointer is saved for use by
!      nonlocal gotos and a 'reg' in the other two cases.
  
! 'allocate_stack'
!      Subtract (or add if 'STACK_GROWS_DOWNWARD' is undefined) operand 1
       from the stack pointer to create space for dynamically allocated
       data.
  
       Store the resultant pointer to this space into operand 0.  If you
       are allocating space from the main stack, do this by emitting a
!      move insn to copy 'virtual_stack_dynamic_rtx' to operand 0.  If you
!      are allocating the space elsewhere, generate code to copy the
       location of the space to operand 0.  In the latter case, you must
       ensure this space gets freed when the corresponding space on the
       main stack is free.
*************** pattern to accomplish a certain task.
*** 24370,24376 ****
       probes or maintaining the back chain.  Define this pattern to emit
       those operations in addition to updating the stack pointer.
  
! `check_stack'
       If stack checking (*note Stack Checking::) cannot be done on your
       system by probing the stack, define this pattern to perform the
       needed check and signal an error if the stack has overflowed.  The
--- 24005,24011 ----
       probes or maintaining the back chain.  Define this pattern to emit
       those operations in addition to updating the stack pointer.
  
! 'check_stack'
       If stack checking (*note Stack Checking::) cannot be done on your
       system by probing the stack, define this pattern to perform the
       needed check and signal an error if the stack has overflowed.  The
*************** pattern to accomplish a certain task.
*** 24379,24392 ****
       platforms where this pattern is needed, you would obtain the stack
       limit from a global or thread-specific variable or register.
  
! `probe_stack_address'
       If stack checking (*note Stack Checking::) can be done on your
!      system by probing the stack but without the need to actually
!      access it, define this pattern and signal an error if the stack
!      has overflowed.  The single operand is the memory address in the
!      stack that needs to be probed.
  
! `probe_stack'
       If stack checking (*note Stack Checking::) can be done on your
       system by probing the stack but doing it with a "store zero"
       instruction is not valid or optimal, define this pattern to do the
--- 24014,24027 ----
       platforms where this pattern is needed, you would obtain the stack
       limit from a global or thread-specific variable or register.
  
! 'probe_stack_address'
       If stack checking (*note Stack Checking::) can be done on your
!      system by probing the stack but without the need to actually access
!      it, define this pattern and signal an error if the stack has
!      overflowed.  The single operand is the memory address in the stack
!      that needs to be probed.
  
! 'probe_stack'
       If stack checking (*note Stack Checking::) can be done on your
       system by probing the stack but doing it with a "store zero"
       instruction is not valid or optimal, define this pattern to do the
*************** pattern to accomplish a certain task.
*** 24394,24400 ****
       overflowed.  The single operand is the memory reference in the
       stack that needs to be probed.
  
! `nonlocal_goto'
       Emit code to generate a non-local goto, e.g., a jump from one
       function to a label in an outer function.  This pattern has four
       arguments, each representing a value to be used in the jump.  The
--- 24029,24035 ----
       overflowed.  The single operand is the memory reference in the
       stack that needs to be probed.
  
! 'nonlocal_goto'
       Emit code to generate a non-local goto, e.g., a jump from one
       function to a label in an outer function.  This pattern has four
       arguments, each representing a value to be used in the jump.  The
*************** pattern to accomplish a certain task.
*** 24407,24448 ****
       On most machines you need not define this pattern, since GCC will
       already generate the correct code, which is to load the frame
       pointer and static chain, restore the stack (using the
!      `restore_stack_nonlocal' pattern, if defined), and jump indirectly
       to the dispatcher.  You need only define this pattern if this code
       will not work on your machine.
  
! `nonlocal_goto_receiver'
       This pattern, if defined, contains code needed at the target of a
       nonlocal goto after the code already generated by GCC.  You will
!      not normally need to define this pattern.  A typical reason why
!      you might need this pattern is if some value, such as a pointer to
!      a global table, must be restored when the frame pointer is
!      restored.  Note that a nonlocal goto only occurs within a
!      unit-of-translation, so a global table pointer that is shared by
!      all functions of a given module need not be restored.  There are
!      no arguments.
  
! `exception_receiver'
       This pattern, if defined, contains code needed at the site of an
!      exception handler that isn't needed at the site of a nonlocal
!      goto.  You will not normally need to define this pattern.  A
!      typical reason why you might need this pattern is if some value,
!      such as a pointer to a global table, must be restored after
!      control flow is branched to the handler of an exception.  There
!      are no arguments.
  
! `builtin_setjmp_setup'
       This pattern, if defined, contains additional code needed to
!      initialize the `jmp_buf'.  You will not normally need to define
       this pattern.  A typical reason why you might need this pattern is
       if some value, such as a pointer to a global table, must be
       restored.  Though it is preferred that the pointer value be
       recalculated if possible (given the address of a label for
!      instance).  The single argument is a pointer to the `jmp_buf'.
       Note that the buffer is five words long and that the first three
       are normally used by the generic mechanism.
  
! `builtin_setjmp_receiver'
       This pattern, if defined, contains code needed at the site of a
       built-in setjmp that isn't needed at the site of a nonlocal goto.
       You will not normally need to define this pattern.  A typical
--- 24042,24081 ----
       On most machines you need not define this pattern, since GCC will
       already generate the correct code, which is to load the frame
       pointer and static chain, restore the stack (using the
!      'restore_stack_nonlocal' pattern, if defined), and jump indirectly
       to the dispatcher.  You need only define this pattern if this code
       will not work on your machine.
  
! 'nonlocal_goto_receiver'
       This pattern, if defined, contains code needed at the target of a
       nonlocal goto after the code already generated by GCC.  You will
!      not normally need to define this pattern.  A typical reason why you
!      might need this pattern is if some value, such as a pointer to a
!      global table, must be restored when the frame pointer is restored.
!      Note that a nonlocal goto only occurs within a unit-of-translation,
!      so a global table pointer that is shared by all functions of a
!      given module need not be restored.  There are no arguments.
  
! 'exception_receiver'
       This pattern, if defined, contains code needed at the site of an
!      exception handler that isn't needed at the site of a nonlocal goto.
!      You will not normally need to define this pattern.  A typical
!      reason why you might need this pattern is if some value, such as a
!      pointer to a global table, must be restored after control flow is
!      branched to the handler of an exception.  There are no arguments.
  
! 'builtin_setjmp_setup'
       This pattern, if defined, contains additional code needed to
!      initialize the 'jmp_buf'.  You will not normally need to define
       this pattern.  A typical reason why you might need this pattern is
       if some value, such as a pointer to a global table, must be
       restored.  Though it is preferred that the pointer value be
       recalculated if possible (given the address of a label for
!      instance).  The single argument is a pointer to the 'jmp_buf'.
       Note that the buffer is five words long and that the first three
       are normally used by the generic mechanism.
  
! 'builtin_setjmp_receiver'
       This pattern, if defined, contains code needed at the site of a
       built-in setjmp that isn't needed at the site of a nonlocal goto.
       You will not normally need to define this pattern.  A typical
*************** pattern to accomplish a certain task.
*** 24452,24535 ****
       control; this pattern may be emitted at a small offset from that
       label.
  
! `builtin_longjmp'
       This pattern, if defined, performs the entire action of the
       longjmp.  You will not normally need to define this pattern unless
!      you also define `builtin_setjmp_setup'.  The single argument is a
!      pointer to the `jmp_buf'.
  
! `eh_return'
!      This pattern, if defined, affects the way `__builtin_eh_return',
       and thence the call frame exception handling library routines, are
       built.  It is intended to handle non-trivial actions needed along
       the abnormal return path.
  
       The address of the exception handler to which the function should
!      return is passed as operand to this pattern.  It will normally
!      need to copied by the pattern to some special register or memory
       location.  If the pattern needs to determine the location of the
       target call frame in order to do so, it may use
!      `EH_RETURN_STACKADJ_RTX', if defined; it will have already been
       assigned.
  
       If this pattern is not defined, the default action will be to
!      simply copy the return address to `EH_RETURN_HANDLER_RTX'.  Either
       that macro or this pattern needs to be defined if call frame
       exception handling is to be used.
  
! `prologue'
       This pattern, if defined, emits RTL for entry to a function.  The
       function entry is responsible for setting up the stack frame,
       initializing the frame pointer register, saving callee saved
       registers, etc.
  
       Using a prologue pattern is generally preferred over defining
!      `TARGET_ASM_FUNCTION_PROLOGUE' to emit assembly code for the
       prologue.
  
!      The `prologue' pattern is particularly useful for targets which
       perform instruction scheduling.
  
! `window_save'
!      This pattern, if defined, emits RTL for a register window save.
!      It should be defined if the target machine has register windows
!      but the window events are decoupled from calls to subroutines.
!      The canonical example is the SPARC architecture.
  
! `epilogue'
!      This pattern emits RTL for exit from a function.  The function
!      exit is responsible for deallocating the stack frame, restoring
!      callee saved registers and emitting the return instruction.
  
       Using an epilogue pattern is generally preferred over defining
!      `TARGET_ASM_FUNCTION_EPILOGUE' to emit assembly code for the
       epilogue.
  
!      The `epilogue' pattern is particularly useful for targets which
       perform instruction scheduling or which have delay slots for their
       return instruction.
  
! `sibcall_epilogue'
       This pattern, if defined, emits RTL for exit from a function
       without the final branch back to the calling function.  This
       pattern will be emitted before any sibling call (aka tail call)
       sites.
  
!      The `sibcall_epilogue' pattern must not clobber any arguments used
       for parameter passing or any stack slots for arguments passed to
       the current function.
  
! `trap'
       This pattern, if defined, signals an error, typically by causing
       some kind of signal to be raised.  Among other places, it is used
!      by the Java front end to signal `invalid array index' exceptions.
  
! `ctrapMM4'
       Conditional trap instruction.  Operand 0 is a piece of RTL which
       performs a comparison, and operands 1 and 2 are the arms of the
       comparison.  Operand 3 is the trap code, an integer.
  
!      A typical `ctrap' pattern looks like
  
            (define_insn "ctrapsi4"
              [(trap_if (match_operator 0 "trap_operator"
--- 24085,24168 ----
       control; this pattern may be emitted at a small offset from that
       label.
  
! 'builtin_longjmp'
       This pattern, if defined, performs the entire action of the
       longjmp.  You will not normally need to define this pattern unless
!      you also define 'builtin_setjmp_setup'.  The single argument is a
!      pointer to the 'jmp_buf'.
  
! 'eh_return'
!      This pattern, if defined, affects the way '__builtin_eh_return',
       and thence the call frame exception handling library routines, are
       built.  It is intended to handle non-trivial actions needed along
       the abnormal return path.
  
       The address of the exception handler to which the function should
!      return is passed as operand to this pattern.  It will normally need
!      to copied by the pattern to some special register or memory
       location.  If the pattern needs to determine the location of the
       target call frame in order to do so, it may use
!      'EH_RETURN_STACKADJ_RTX', if defined; it will have already been
       assigned.
  
       If this pattern is not defined, the default action will be to
!      simply copy the return address to 'EH_RETURN_HANDLER_RTX'.  Either
       that macro or this pattern needs to be defined if call frame
       exception handling is to be used.
  
! 'prologue'
       This pattern, if defined, emits RTL for entry to a function.  The
       function entry is responsible for setting up the stack frame,
       initializing the frame pointer register, saving callee saved
       registers, etc.
  
       Using a prologue pattern is generally preferred over defining
!      'TARGET_ASM_FUNCTION_PROLOGUE' to emit assembly code for the
       prologue.
  
!      The 'prologue' pattern is particularly useful for targets which
       perform instruction scheduling.
  
! 'window_save'
!      This pattern, if defined, emits RTL for a register window save.  It
!      should be defined if the target machine has register windows but
!      the window events are decoupled from calls to subroutines.  The
!      canonical example is the SPARC architecture.
  
! 'epilogue'
!      This pattern emits RTL for exit from a function.  The function exit
!      is responsible for deallocating the stack frame, restoring callee
!      saved registers and emitting the return instruction.
  
       Using an epilogue pattern is generally preferred over defining
!      'TARGET_ASM_FUNCTION_EPILOGUE' to emit assembly code for the
       epilogue.
  
!      The 'epilogue' pattern is particularly useful for targets which
       perform instruction scheduling or which have delay slots for their
       return instruction.
  
! 'sibcall_epilogue'
       This pattern, if defined, emits RTL for exit from a function
       without the final branch back to the calling function.  This
       pattern will be emitted before any sibling call (aka tail call)
       sites.
  
!      The 'sibcall_epilogue' pattern must not clobber any arguments used
       for parameter passing or any stack slots for arguments passed to
       the current function.
  
! 'trap'
       This pattern, if defined, signals an error, typically by causing
       some kind of signal to be raised.  Among other places, it is used
!      by the Java front end to signal 'invalid array index' exceptions.
  
! 'ctrapMM4'
       Conditional trap instruction.  Operand 0 is a piece of RTL which
       performs a comparison, and operands 1 and 2 are the arms of the
       comparison.  Operand 3 is the trap code, an integer.
  
!      A typical 'ctrap' pattern looks like
  
            (define_insn "ctrapsi4"
              [(trap_if (match_operator 0 "trap_operator"
*************** pattern to accomplish a certain task.
*** 24539,24574 ****
              ""
              "...")
  
! `prefetch'
       This pattern, if defined, emits code for a non-faulting data
       prefetch instruction.  Operand 0 is the address of the memory to
       prefetch.  Operand 1 is a constant 1 if the prefetch is preparing
       for a write to the memory address, or a constant 0 otherwise.
       Operand 2 is the expected degree of temporal locality of the data
       and is a value between 0 and 3, inclusive; 0 means that the data
!      has no temporal locality, so it need not be left in the cache
!      after the access; 3 means that the data has a high degree of
!      temporal locality and should be left in all levels of cache
!      possible;  1 and 2 mean, respectively, a low or moderate degree of
!      temporal locality.
  
       Targets that do not support write prefetches or locality hints can
       ignore the values of operands 1 and 2.
  
! `blockage'
       This pattern defines a pseudo insn that prevents the instruction
       scheduler and other passes from moving instructions and using
       register equivalences across the boundary defined by the blockage
       insn.  This needs to be an UNSPEC_VOLATILE pattern or a volatile
       ASM.
  
! `memory_barrier'
       If the target memory model is not fully synchronous, then this
       pattern should be defined to an instruction that orders both loads
       and stores before the instruction with respect to loads and stores
       after the instruction.  This pattern has no operands.
  
! `sync_compare_and_swapMODE'
       This pattern, if defined, emits code for an atomic compare-and-swap
       operation.  Operand 1 is the memory on which the atomic operation
       is performed.  Operand 2 is the "old" value to be compared against
--- 24172,24207 ----
              ""
              "...")
  
! 'prefetch'
       This pattern, if defined, emits code for a non-faulting data
       prefetch instruction.  Operand 0 is the address of the memory to
       prefetch.  Operand 1 is a constant 1 if the prefetch is preparing
       for a write to the memory address, or a constant 0 otherwise.
       Operand 2 is the expected degree of temporal locality of the data
       and is a value between 0 and 3, inclusive; 0 means that the data
!      has no temporal locality, so it need not be left in the cache after
!      the access; 3 means that the data has a high degree of temporal
!      locality and should be left in all levels of cache possible; 1 and
!      2 mean, respectively, a low or moderate degree of temporal
!      locality.
  
       Targets that do not support write prefetches or locality hints can
       ignore the values of operands 1 and 2.
  
! 'blockage'
       This pattern defines a pseudo insn that prevents the instruction
       scheduler and other passes from moving instructions and using
       register equivalences across the boundary defined by the blockage
       insn.  This needs to be an UNSPEC_VOLATILE pattern or a volatile
       ASM.
  
! 'memory_barrier'
       If the target memory model is not fully synchronous, then this
       pattern should be defined to an instruction that orders both loads
       and stores before the instruction with respect to loads and stores
       after the instruction.  This pattern has no operands.
  
! 'sync_compare_and_swapMODE'
       This pattern, if defined, emits code for an atomic compare-and-swap
       operation.  Operand 1 is the memory on which the atomic operation
       is performed.  Operand 2 is the "old" value to be compared against
*************** pattern to accomplish a certain task.
*** 24589,24616 ****
       For targets where the success or failure of the compare-and-swap
       operation is available via the status flags, it is possible to
       avoid a separate compare operation and issue the subsequent branch
!      or store-flag operation immediately after the compare-and-swap.
!      To this end, GCC will look for a `MODE_CC' set in the output of
!      `sync_compare_and_swapMODE'; if the machine description includes
!      such a set, the target should also define special `cbranchcc4'
!      and/or `cstorecc4' instructions.  GCC will then be able to take
!      the destination of the `MODE_CC' set and pass it to the
!      `cbranchcc4' or `cstorecc4' pattern as the first operand of the
!      comparison (the second will be `(const_int 0)').
  
       For targets where the operating system may provide support for this
!      operation via library calls, the `sync_compare_and_swap_optab' may
       be initialized to a function with the same interface as the
!      `__sync_val_compare_and_swap_N' built-in.  If the entire set of
       __SYNC builtins are supported via library calls, the target can
!      initialize all of the optabs at once with `init_sync_libfuncs'.
!      For the purposes of C++11 `std::atomic::is_lock_free', it is
       assumed that these library calls do _not_ use any kind of
       interruptable locking.
  
! `sync_addMODE', `sync_subMODE'
! `sync_iorMODE', `sync_andMODE'
! `sync_xorMODE', `sync_nandMODE'
       These patterns emit code for an atomic operation on memory.
       Operand 0 is the memory on which the atomic operation is performed.
       Operand 1 is the second operand to the binary operator.
--- 24222,24249 ----
       For targets where the success or failure of the compare-and-swap
       operation is available via the status flags, it is possible to
       avoid a separate compare operation and issue the subsequent branch
!      or store-flag operation immediately after the compare-and-swap.  To
!      this end, GCC will look for a 'MODE_CC' set in the output of
!      'sync_compare_and_swapMODE'; if the machine description includes
!      such a set, the target should also define special 'cbranchcc4'
!      and/or 'cstorecc4' instructions.  GCC will then be able to take the
!      destination of the 'MODE_CC' set and pass it to the 'cbranchcc4' or
!      'cstorecc4' pattern as the first operand of the comparison (the
!      second will be '(const_int 0)').
  
       For targets where the operating system may provide support for this
!      operation via library calls, the 'sync_compare_and_swap_optab' may
       be initialized to a function with the same interface as the
!      '__sync_val_compare_and_swap_N' built-in.  If the entire set of
       __SYNC builtins are supported via library calls, the target can
!      initialize all of the optabs at once with 'init_sync_libfuncs'.
!      For the purposes of C++11 'std::atomic::is_lock_free', it is
       assumed that these library calls do _not_ use any kind of
       interruptable locking.
  
! 'sync_addMODE', 'sync_subMODE'
! 'sync_iorMODE', 'sync_andMODE'
! 'sync_xorMODE', 'sync_nandMODE'
       These patterns emit code for an atomic operation on memory.
       Operand 0 is the memory on which the atomic operation is performed.
       Operand 1 is the second operand to the binary operator.
*************** pattern to accomplish a certain task.
*** 24623,24631 ****
       If these patterns are not defined, the operation will be
       constructed from a compare-and-swap operation, if defined.
  
! `sync_old_addMODE', `sync_old_subMODE'
! `sync_old_iorMODE', `sync_old_andMODE'
! `sync_old_xorMODE', `sync_old_nandMODE'
       These patterns emit code for an atomic operation on memory, and
       return the value that the memory contained before the operation.
       Operand 0 is the result value, operand 1 is the memory on which the
--- 24256,24264 ----
       If these patterns are not defined, the operation will be
       constructed from a compare-and-swap operation, if defined.
  
! 'sync_old_addMODE', 'sync_old_subMODE'
! 'sync_old_iorMODE', 'sync_old_andMODE'
! 'sync_old_xorMODE', 'sync_old_nandMODE'
       These patterns emit code for an atomic operation on memory, and
       return the value that the memory contained before the operation.
       Operand 0 is the result value, operand 1 is the memory on which the
*************** pattern to accomplish a certain task.
*** 24640,24657 ****
       If these patterns are not defined, the operation will be
       constructed from a compare-and-swap operation, if defined.
  
! `sync_new_addMODE', `sync_new_subMODE'
! `sync_new_iorMODE', `sync_new_andMODE'
! `sync_new_xorMODE', `sync_new_nandMODE'
!      These patterns are like their `sync_old_OP' counterparts, except
!      that they return the value that exists in the memory location
!      after the operation, rather than before the operation.
  
! `sync_lock_test_and_setMODE'
       This pattern takes two forms, based on the capabilities of the
       target.  In either case, operand 0 is the result of the operand,
!      operand 1 is the memory on which the atomic operation is
!      performed, and operand 2 is the value to set in the lock.
  
       In the ideal case, this operation is an atomic exchange operation,
       in which the previous value in memory operand is copied into the
--- 24273,24290 ----
       If these patterns are not defined, the operation will be
       constructed from a compare-and-swap operation, if defined.
  
! 'sync_new_addMODE', 'sync_new_subMODE'
! 'sync_new_iorMODE', 'sync_new_andMODE'
! 'sync_new_xorMODE', 'sync_new_nandMODE'
!      These patterns are like their 'sync_old_OP' counterparts, except
!      that they return the value that exists in the memory location after
!      the operation, rather than before the operation.
  
! 'sync_lock_test_and_setMODE'
       This pattern takes two forms, based on the capabilities of the
       target.  In either case, operand 0 is the result of the operand,
!      operand 1 is the memory on which the atomic operation is performed,
!      and operand 2 is the value to set in the lock.
  
       In the ideal case, this operation is an atomic exchange operation,
       in which the previous value in memory operand is copied into the
*************** pattern to accomplish a certain task.
*** 24659,24669 ****
       operand.
  
       For less capable targets, any value operand that is not the
!      constant 1 should be rejected with `FAIL'.  In this case the
!      target may use an atomic test-and-set bit operation.  The result
!      operand should contain 1 if the bit was previously set and 0 if
!      the bit was previously clear.  The true contents of the memory
!      operand are implementation defined.
  
       This pattern must issue any memory barrier instructions such that
       the pattern as a whole acts as an acquire barrier, that is all
--- 24292,24302 ----
       operand.
  
       For less capable targets, any value operand that is not the
!      constant 1 should be rejected with 'FAIL'.  In this case the target
!      may use an atomic test-and-set bit operation.  The result operand
!      should contain 1 if the bit was previously set and 0 if the bit was
!      previously clear.  The true contents of the memory operand are
!      implementation defined.
  
       This pattern must issue any memory barrier instructions such that
       the pattern as a whole acts as an acquire barrier, that is all
*************** pattern to accomplish a certain task.
*** 24673,24713 ****
       If this pattern is not defined, the operation will be constructed
       from a compare-and-swap operation, if defined.
  
! `sync_lock_releaseMODE'
       This pattern, if defined, releases a lock set by
!      `sync_lock_test_and_setMODE'.  Operand 0 is the memory that
       contains the lock; operand 1 is the value to store in the lock.
  
       If the target doesn't implement full semantics for
!      `sync_lock_test_and_setMODE', any value operand which is not the
!      constant 0 should be rejected with `FAIL', and the true contents
!      of the memory operand are implementation defined.
  
       This pattern must issue any memory barrier instructions such that
       the pattern as a whole acts as a release barrier, that is the lock
       is released only after all previous memory operations have
       completed.
  
!      If this pattern is not defined, then a `memory_barrier' pattern
       will be emitted, followed by a store of the value to the memory
       operand.
  
! `atomic_compare_and_swapMODE'
       This pattern, if defined, emits code for an atomic compare-and-swap
       operation with memory model semantics.  Operand 2 is the memory on
       which the atomic operation is performed.  Operand 0 is an output
       operand which is set to true or false based on whether the
       operation succeeded.  Operand 1 is an output operand which is set
       to the contents of the memory before the operation was attempted.
!      Operand 3 is the value that is expected to be in memory.  Operand
!      4 is the value to put in memory if the expected value is found
!      there.  Operand 5 is set to 1 if this compare and swap is to be
!      treated as a weak operation.  Operand 6 is the memory model to be
!      used if the operation is a success.  Operand 7 is the memory model
!      to be used if the operation fails.
  
!      If memory referred to in operand 2 contains the value in operand
!      3, then operand 4 is stored in memory pointed to by operand 2 and
       fencing based on the memory model in operand 6 is issued.
  
       If memory referred to in operand 2 does not contain the value in
--- 24306,24346 ----
       If this pattern is not defined, the operation will be constructed
       from a compare-and-swap operation, if defined.
  
! 'sync_lock_releaseMODE'
       This pattern, if defined, releases a lock set by
!      'sync_lock_test_and_setMODE'.  Operand 0 is the memory that
       contains the lock; operand 1 is the value to store in the lock.
  
       If the target doesn't implement full semantics for
!      'sync_lock_test_and_setMODE', any value operand which is not the
!      constant 0 should be rejected with 'FAIL', and the true contents of
!      the memory operand are implementation defined.
  
       This pattern must issue any memory barrier instructions such that
       the pattern as a whole acts as a release barrier, that is the lock
       is released only after all previous memory operations have
       completed.
  
!      If this pattern is not defined, then a 'memory_barrier' pattern
       will be emitted, followed by a store of the value to the memory
       operand.
  
! 'atomic_compare_and_swapMODE'
       This pattern, if defined, emits code for an atomic compare-and-swap
       operation with memory model semantics.  Operand 2 is the memory on
       which the atomic operation is performed.  Operand 0 is an output
       operand which is set to true or false based on whether the
       operation succeeded.  Operand 1 is an output operand which is set
       to the contents of the memory before the operation was attempted.
!      Operand 3 is the value that is expected to be in memory.  Operand 4
!      is the value to put in memory if the expected value is found there.
!      Operand 5 is set to 1 if this compare and swap is to be treated as
!      a weak operation.  Operand 6 is the memory model to be used if the
!      operation is a success.  Operand 7 is the memory model to be used
!      if the operation fails.
  
!      If memory referred to in operand 2 contains the value in operand 3,
!      then operand 4 is stored in memory pointed to by operand 2 and
       fencing based on the memory model in operand 6 is issued.
  
       If memory referred to in operand 2 does not contain the value in
*************** pattern to accomplish a certain task.
*** 24719,24827 ****
       operand 5 can be ignored.  Note a strong implementation must be
       provided.
  
!      If this pattern is not provided, the `__atomic_compare_exchange'
!      built-in functions will utilize the legacy `sync_compare_and_swap'
!      pattern with an `__ATOMIC_SEQ_CST' memory model.
  
! `atomic_loadMODE'
       This pattern implements an atomic load operation with memory model
       semantics.  Operand 1 is the memory address being loaded from.
!      Operand 0 is the result of the load.  Operand 2 is the memory
!      model to be used for the load operation.
  
!      If not present, the `__atomic_load' built-in function will either
       resort to a normal load with memory barriers, or a compare-and-swap
       operation if a normal load would not be atomic.
  
! `atomic_storeMODE'
       This pattern implements an atomic store operation with memory model
       semantics.  Operand 0 is the memory address being stored to.
       Operand 1 is the value to be written.  Operand 2 is the memory
       model to be used for the operation.
  
!      If not present, the `__atomic_store' built-in function will
!      attempt to perform a normal store and surround it with any
!      required memory fences.  If the store would not be atomic, then an
!      `__atomic_exchange' is attempted with the result being ignored.
  
! `atomic_exchangeMODE'
       This pattern implements an atomic exchange operation with memory
!      model semantics.  Operand 1 is the memory location the operation
!      is performed on.  Operand 0 is an output operand which is set to
!      the original value contained in the memory pointed to by operand
!      1.  Operand 2 is the value to be stored.  Operand 3 is the memory
!      model to be used.
  
       If this pattern is not present, the built-in function
!      `__atomic_exchange' will attempt to preform the operation with a
       compare and swap loop.
  
! `atomic_addMODE', `atomic_subMODE'
! `atomic_orMODE', `atomic_andMODE'
! `atomic_xorMODE', `atomic_nandMODE'
       These patterns emit code for an atomic operation on memory with
!      memory model semantics. Operand 0 is the memory on which the
       atomic operation is performed.  Operand 1 is the second operand to
       the binary operator.  Operand 2 is the memory model to be used by
       the operation.
  
       If these patterns are not defined, attempts will be made to use
!      legacy `sync' patterns, or equivalent patterns which return a
       result.  If none of these are available a compare-and-swap loop
       will be used.
  
! `atomic_fetch_addMODE', `atomic_fetch_subMODE'
! `atomic_fetch_orMODE', `atomic_fetch_andMODE'
! `atomic_fetch_xorMODE', `atomic_fetch_nandMODE'
       These patterns emit code for an atomic operation on memory with
!      memory model semantics, and return the original value. Operand 0
       is an output operand which contains the value of the memory
       location before the operation was performed.  Operand 1 is the
       memory on which the atomic operation is performed.  Operand 2 is
!      the second operand to the binary operator.  Operand 3 is the
!      memory model to be used by the operation.
  
       If these patterns are not defined, attempts will be made to use
!      legacy `sync' patterns.  If none of these are available a
       compare-and-swap loop will be used.
  
! `atomic_add_fetchMODE', `atomic_sub_fetchMODE'
! `atomic_or_fetchMODE', `atomic_and_fetchMODE'
! `atomic_xor_fetchMODE', `atomic_nand_fetchMODE'
       These patterns emit code for an atomic operation on memory with
!      memory model semantics and return the result after the operation
!      is performed.  Operand 0 is an output operand which contains the
!      value after the operation.  Operand 1 is the memory on which the
!      atomic operation is performed.  Operand 2 is the second operand to
!      the binary operator.  Operand 3 is the memory model to be used by
!      the operation.
  
       If these patterns are not defined, attempts will be made to use
!      legacy `sync' patterns, or equivalent patterns which return the
       result before the operation followed by the arithmetic operation
       required to produce the result.  If none of these are available a
       compare-and-swap loop will be used.
  
! `atomic_test_and_set'
!      This pattern emits code for `__builtin_atomic_test_and_set'.
       Operand 0 is an output operand which is set to true if the previous
       previous contents of the byte was "set", and false otherwise.
!      Operand 1 is the `QImode' memory to be modified.  Operand 2 is the
       memory model to be used.
  
       The specific value that defines "set" is implementation defined,
       and is normally based on what is performed by the native atomic
       test and set instruction.
  
! `mem_thread_fenceMODE'
       This pattern emits code required to implement a thread fence with
       memory model semantics.  Operand 0 is the memory model to be used.
  
       If this pattern is not specified, all memory models except
!      `__ATOMIC_RELAXED' will result in issuing a `sync_synchronize'
       barrier pattern.
  
! `mem_signal_fenceMODE'
       This pattern emits code required to implement a signal fence with
       memory model semantics.  Operand 0 is the memory model to be used.
  
--- 24352,24460 ----
       operand 5 can be ignored.  Note a strong implementation must be
       provided.
  
!      If this pattern is not provided, the '__atomic_compare_exchange'
!      built-in functions will utilize the legacy 'sync_compare_and_swap'
!      pattern with an '__ATOMIC_SEQ_CST' memory model.
  
! 'atomic_loadMODE'
       This pattern implements an atomic load operation with memory model
       semantics.  Operand 1 is the memory address being loaded from.
!      Operand 0 is the result of the load.  Operand 2 is the memory model
!      to be used for the load operation.
  
!      If not present, the '__atomic_load' built-in function will either
       resort to a normal load with memory barriers, or a compare-and-swap
       operation if a normal load would not be atomic.
  
! 'atomic_storeMODE'
       This pattern implements an atomic store operation with memory model
       semantics.  Operand 0 is the memory address being stored to.
       Operand 1 is the value to be written.  Operand 2 is the memory
       model to be used for the operation.
  
!      If not present, the '__atomic_store' built-in function will attempt
!      to perform a normal store and surround it with any required memory
!      fences.  If the store would not be atomic, then an
!      '__atomic_exchange' is attempted with the result being ignored.
  
! 'atomic_exchangeMODE'
       This pattern implements an atomic exchange operation with memory
!      model semantics.  Operand 1 is the memory location the operation is
!      performed on.  Operand 0 is an output operand which is set to the
!      original value contained in the memory pointed to by operand 1.
!      Operand 2 is the value to be stored.  Operand 3 is the memory model
!      to be used.
  
       If this pattern is not present, the built-in function
!      '__atomic_exchange' will attempt to preform the operation with a
       compare and swap loop.
  
! 'atomic_addMODE', 'atomic_subMODE'
! 'atomic_orMODE', 'atomic_andMODE'
! 'atomic_xorMODE', 'atomic_nandMODE'
       These patterns emit code for an atomic operation on memory with
!      memory model semantics.  Operand 0 is the memory on which the
       atomic operation is performed.  Operand 1 is the second operand to
       the binary operator.  Operand 2 is the memory model to be used by
       the operation.
  
       If these patterns are not defined, attempts will be made to use
!      legacy 'sync' patterns, or equivalent patterns which return a
       result.  If none of these are available a compare-and-swap loop
       will be used.
  
! 'atomic_fetch_addMODE', 'atomic_fetch_subMODE'
! 'atomic_fetch_orMODE', 'atomic_fetch_andMODE'
! 'atomic_fetch_xorMODE', 'atomic_fetch_nandMODE'
       These patterns emit code for an atomic operation on memory with
!      memory model semantics, and return the original value.  Operand 0
       is an output operand which contains the value of the memory
       location before the operation was performed.  Operand 1 is the
       memory on which the atomic operation is performed.  Operand 2 is
!      the second operand to the binary operator.  Operand 3 is the memory
!      model to be used by the operation.
  
       If these patterns are not defined, attempts will be made to use
!      legacy 'sync' patterns.  If none of these are available a
       compare-and-swap loop will be used.
  
! 'atomic_add_fetchMODE', 'atomic_sub_fetchMODE'
! 'atomic_or_fetchMODE', 'atomic_and_fetchMODE'
! 'atomic_xor_fetchMODE', 'atomic_nand_fetchMODE'
       These patterns emit code for an atomic operation on memory with
!      memory model semantics and return the result after the operation is
!      performed.  Operand 0 is an output operand which contains the value
!      after the operation.  Operand 1 is the memory on which the atomic
!      operation is performed.  Operand 2 is the second operand to the
!      binary operator.  Operand 3 is the memory model to be used by the
!      operation.
  
       If these patterns are not defined, attempts will be made to use
!      legacy 'sync' patterns, or equivalent patterns which return the
       result before the operation followed by the arithmetic operation
       required to produce the result.  If none of these are available a
       compare-and-swap loop will be used.
  
! 'atomic_test_and_set'
!      This pattern emits code for '__builtin_atomic_test_and_set'.
       Operand 0 is an output operand which is set to true if the previous
       previous contents of the byte was "set", and false otherwise.
!      Operand 1 is the 'QImode' memory to be modified.  Operand 2 is the
       memory model to be used.
  
       The specific value that defines "set" is implementation defined,
       and is normally based on what is performed by the native atomic
       test and set instruction.
  
! 'mem_thread_fenceMODE'
       This pattern emits code required to implement a thread fence with
       memory model semantics.  Operand 0 is the memory model to be used.
  
       If this pattern is not specified, all memory models except
!      '__ATOMIC_RELAXED' will result in issuing a 'sync_synchronize'
       barrier pattern.
  
! 'mem_signal_fenceMODE'
       This pattern emits code required to implement a signal fence with
       memory model semantics.  Operand 0 is the memory model to be used.
  
*************** pattern to accomplish a certain task.
*** 24830,24850 ****
       barrier instructions.
  
       If this pattern is not specified, all memory models except
!      `__ATOMIC_RELAXED' will result in issuing a `sync_synchronize'
       barrier pattern.
  
! `get_thread_pointerMODE'
! `set_thread_pointerMODE'
       These patterns emit code that reads/sets the TLS thread pointer.
       Currently, these are only needed if the target needs to support the
!      `__builtin_thread_pointer' and `__builtin_set_thread_pointer'
       builtins.
  
       The get/set patterns have a single output/input operand
!      respectively, with MODE intended to be `Pmode'.
  
! `stack_protect_set'
!      This pattern, if defined, moves a `ptr_mode' value from the memory
       in operand 1 to the memory in operand 0 without leaving the value
       in a register afterward.  This is to avoid leaking the value some
       place that an attacker might use to rewrite the stack guard slot
--- 24463,24483 ----
       barrier instructions.
  
       If this pattern is not specified, all memory models except
!      '__ATOMIC_RELAXED' will result in issuing a 'sync_synchronize'
       barrier pattern.
  
! 'get_thread_pointerMODE'
! 'set_thread_pointerMODE'
       These patterns emit code that reads/sets the TLS thread pointer.
       Currently, these are only needed if the target needs to support the
!      '__builtin_thread_pointer' and '__builtin_set_thread_pointer'
       builtins.
  
       The get/set patterns have a single output/input operand
!      respectively, with MODE intended to be 'Pmode'.
  
! 'stack_protect_set'
!      This pattern, if defined, moves a 'ptr_mode' value from the memory
       in operand 1 to the memory in operand 0 without leaving the value
       in a register afterward.  This is to avoid leaking the value some
       place that an attacker might use to rewrite the stack guard slot
*************** pattern to accomplish a certain task.
*** 24853,24860 ****
       If this pattern is not defined, then a plain move pattern is
       generated.
  
! `stack_protect_test'
!      This pattern, if defined, compares a `ptr_mode' value from the
       memory in operand 1 with the memory in operand 0 without leaving
       the value in a register afterward and branches to operand 2 if the
       values were equal.
--- 24486,24493 ----
       If this pattern is not defined, then a plain move pattern is
       generated.
  
! 'stack_protect_test'
!      This pattern, if defined, compares a 'ptr_mode' value from the
       memory in operand 1 with the memory in operand 0 without leaving
       the value in a register afterward and branches to operand 2 if the
       values were equal.
*************** pattern to accomplish a certain task.
*** 24862,24875 ****
       If this pattern is not defined, then a plain compare pattern and
       conditional branch pattern is used.
  
! `clear_cache'
       This pattern, if defined, flushes the instruction cache for a
       region of memory.  The region is bounded to by the Pmode pointers
       in operand 0 inclusive and operand 1 exclusive.
  
       If this pattern is not defined, a call to the library function
!      `__clear_cache' is used.
! 
  
  
  File: gccint.info,  Node: Pattern Ordering,  Next: Dependent Patterns,  Prev: Standard Names,  Up: Machine Desc
--- 24495,24507 ----
       If this pattern is not defined, then a plain compare pattern and
       conditional branch pattern is used.
  
! 'clear_cache'
       This pattern, if defined, flushes the instruction cache for a
       region of memory.  The region is bounded to by the Pmode pointers
       in operand 0 inclusive and operand 1 exclusive.
  
       If this pattern is not defined, a call to the library function
!      '__clear_cache' is used.
  
  
  File: gccint.info,  Node: Pattern Ordering,  Next: Dependent Patterns,  Prev: Standard Names,  Up: Machine Desc
*************** Therefore, more specific patterns (patte
*** 24883,24899 ****
  things) and faster instructions (those that will produce better code
  when they do match) should usually go first in the description.
  
!  In some cases the effect of ordering the patterns can be used to hide
! a pattern when it is not valid.  For example, the 68000 has an
! instruction for converting a fullword to floating point and another for
! converting a byte to floating point.  An instruction converting an
! integer to floating point could match either one.  We put the pattern
! to convert the fullword first to make sure that one will be used rather
! than the other.  (Otherwise a large integer might be generated as a
! single-byte immediate quantity, which would not work.)  Instead of
! using this pattern ordering it would be possible to make the pattern
! for convert-a-byte smart enough to deal properly with any constant
! value.
  
  
  File: gccint.info,  Node: Dependent Patterns,  Next: Jump Patterns,  Prev: Pattern Ordering,  Up: Machine Desc
--- 24515,24530 ----
  things) and faster instructions (those that will produce better code
  when they do match) should usually go first in the description.
  
!  In some cases the effect of ordering the patterns can be used to hide a
! pattern when it is not valid.  For example, the 68000 has an instruction
! for converting a fullword to floating point and another for converting a
! byte to floating point.  An instruction converting an integer to
! floating point could match either one.  We put the pattern to convert
! the fullword first to make sure that one will be used rather than the
! other.  (Otherwise a large integer might be generated as a single-byte
! immediate quantity, which would not work.)  Instead of using this
! pattern ordering it would be possible to make the pattern for
! convert-a-byte smart enough to deal properly with any constant value.
  
  
  File: gccint.info,  Node: Dependent Patterns,  Next: Jump Patterns,  Prev: Pattern Ordering,  Up: Machine Desc
*************** Constant integers do not specify a machi
*** 24916,24927 ****
  extend a constant value could match either pattern.  The pattern it
  actually will match is the one that appears first in the file.  For
  correct results, this must be the one for the widest possible mode
! (`HImode', here).  If the pattern matches the `QImode' instruction, the
  results will be incorrect if the constant value does not actually fit
  that mode.
  
!  Such instructions to extend constants are rarely generated because
! they are optimized away, but they do occasionally happen in nonoptimized
  compilations.
  
   If a constraint in a pattern allows a constant, the reload pass may
--- 24547,24558 ----
  extend a constant value could match either pattern.  The pattern it
  actually will match is the one that appears first in the file.  For
  correct results, this must be the one for the widest possible mode
! ('HImode', here).  If the pattern matches the 'QImode' instruction, the
  results will be incorrect if the constant value does not actually fit
  that mode.
  
!  Such instructions to extend constants are rarely generated because they
! are optimized away, but they do occasionally happen in nonoptimized
  compilations.
  
   If a constraint in a pattern allows a constant, the reload pass may
*************** File: gccint.info,  Node: Jump Patterns,
*** 24940,24968 ****
  
  GCC does not assume anything about how the machine realizes jumps.  The
  machine description should define a single pattern, usually a
! `define_expand', which expands to all the required insns.
  
   Usually, this would be a comparison insn to set the condition code and
  a separate branch insn testing the condition code and branching or not
! according to its value.  For many machines, however, separating
! compares and branches is limiting, which is why the more flexible
! approach with one `define_expand' is used in GCC.  The machine
! description becomes clearer for architectures that have
! compare-and-branch instructions but no condition code.  It also works
! better when different sets of comparison operators are supported by
! different kinds of conditional branches (e.g. integer vs.
! floating-point), or by conditional branches with respect to conditional
! stores.
  
   Two separate insns are always used if the machine description
  represents a condition code register using the legacy RTL expression
! `(cc0)', and on most machines that use a separate condition code
! register (*note Condition Code::).  For machines that use `(cc0)', in
  fact, the set and use of the condition code must be separate and
! adjacent(1), thus allowing flags in `cc_status' to be used (*note
  Condition Code::) and so that the comparison and branch insns could be
! located from each other by using the functions `prev_cc0_setter' and
! `next_cc0_user'.
  
   Even in this case having a single entry point for conditional branches
  is advantageous, because it handles equally well the case where a single
--- 24571,24598 ----
  
  GCC does not assume anything about how the machine realizes jumps.  The
  machine description should define a single pattern, usually a
! 'define_expand', which expands to all the required insns.
  
   Usually, this would be a comparison insn to set the condition code and
  a separate branch insn testing the condition code and branching or not
! according to its value.  For many machines, however, separating compares
! and branches is limiting, which is why the more flexible approach with
! one 'define_expand' is used in GCC. The machine description becomes
! clearer for architectures that have compare-and-branch instructions but
! no condition code.  It also works better when different sets of
! comparison operators are supported by different kinds of conditional
! branches (e.g.  integer vs.  floating-point), or by conditional branches
! with respect to conditional stores.
  
   Two separate insns are always used if the machine description
  represents a condition code register using the legacy RTL expression
! '(cc0)', and on most machines that use a separate condition code
! register (*note Condition Code::).  For machines that use '(cc0)', in
  fact, the set and use of the condition code must be separate and
! adjacent(1), thus allowing flags in 'cc_status' to be used (*note
  Condition Code::) and so that the comparison and branch insns could be
! located from each other by using the functions 'prev_cc0_setter' and
! 'next_cc0_user'.
  
   Even in this case having a single entry point for conditional branches
  is advantageous, because it handles equally well the case where a single
*************** distinct signed and unsigned flavors) as
*** 24972,24980 ****
  case where there are distinct signed and unsigned compare instructions
  and only one set of conditional branch instructions as in the PowerPC.
  
!  ---------- Footnotes ----------
  
!  (1) `note' insns can separate them, though.
  
  
  File: gccint.info,  Node: Looping Patterns,  Next: Insn Canonicalizations,  Prev: Jump Patterns,  Up: Machine Desc
--- 24602,24610 ----
  case where there are distinct signed and unsigned compare instructions
  and only one set of conditional branch instructions as in the PowerPC.
  
!    ---------- Footnotes ----------
  
!    (1) 'note' insns can separate them, though.
  
  
  File: gccint.info,  Node: Looping Patterns,  Next: Insn Canonicalizations,  Prev: Jump Patterns,  Up: Machine Desc
*************** File: gccint.info,  Node: Looping Patter
*** 24983,24989 ****
  ===========================================
  
  Some machines have special jump instructions that can be utilized to
! make loops more efficient.  A common example is the 68000 `dbra'
  instruction which performs a decrement of a register and a branch if the
  result was greater than zero.  Other machines, in particular digital
  signal processors (DSPs), have special block repeat instructions to
--- 24613,24619 ----
  ===========================================
  
  Some machines have special jump instructions that can be utilized to
! make loops more efficient.  A common example is the 68000 'dbra'
  instruction which performs a decrement of a register and a branch if the
  result was greater than zero.  Other machines, in particular digital
  signal processors (DSPs), have special block repeat instructions to
*************** provide low-overhead loop support.  For
*** 24991,25010 ****
  DSPs have a block repeat instruction that loads special registers to
  mark the top and end of a loop and to count the number of loop
  iterations.  This avoids the need for fetching and executing a
! `dbra'-like instruction and avoids pipeline stalls associated with the
  jump.
  
   GCC has three special named patterns to support low overhead looping.
! They are `decrement_and_branch_until_zero', `doloop_begin', and
! `doloop_end'.  The first pattern, `decrement_and_branch_until_zero', is
  not emitted during RTL generation but may be emitted during the
! instruction combination phase.  This requires the assistance of the
! loop optimizer, using information collected during strength reduction,
! to reverse a loop to count down to zero.  Some targets also require the
! loop optimizer to add a `REG_NONNEG' note to indicate that the
! iteration count is always positive.  This is needed if the target
! performs a signed loop termination test.  For example, the 68000 uses a
! pattern similar to the following for its `dbra' instruction:
  
       (define_insn "decrement_and_branch_until_zero"
         [(set (pc)
--- 24621,24640 ----
  DSPs have a block repeat instruction that loads special registers to
  mark the top and end of a loop and to count the number of loop
  iterations.  This avoids the need for fetching and executing a
! 'dbra'-like instruction and avoids pipeline stalls associated with the
  jump.
  
   GCC has three special named patterns to support low overhead looping.
! They are 'decrement_and_branch_until_zero', 'doloop_begin', and
! 'doloop_end'.  The first pattern, 'decrement_and_branch_until_zero', is
  not emitted during RTL generation but may be emitted during the
! instruction combination phase.  This requires the assistance of the loop
! optimizer, using information collected during strength reduction, to
! reverse a loop to count down to zero.  Some targets also require the
! loop optimizer to add a 'REG_NONNEG' note to indicate that the iteration
! count is always positive.  This is needed if the target performs a
! signed loop termination test.  For example, the 68000 uses a pattern
! similar to the following for its 'dbra' instruction:
  
       (define_insn "decrement_and_branch_until_zero"
         [(set (pc)
*************** pattern similar to the following for its
*** 25021,25027 ****
         "...")
  
   Note that since the insn is both a jump insn and has an output, it must
! deal with its own reloads, hence the `m' constraints.  Also note that
  since this insn is generated by the instruction combination phase
  combining two sequential insns together into an implicit parallel insn,
  the iteration counter needs to be biased by the same amount as the
--- 24651,24657 ----
         "...")
  
   Note that since the insn is both a jump insn and has an output, it must
! deal with its own reloads, hence the 'm' constraints.  Also note that
  since this insn is generated by the instruction combination phase
  combining two sequential insns together into an implicit parallel insn,
  the iteration counter needs to be biased by the same amount as the
*************** pattern will not be matched by the combi
*** 25041,25076 ****
         "find_reg_note (insn, REG_NONNEG, 0)"
         "...")
  
!  The other two special looping patterns, `doloop_begin' and
! `doloop_end', are emitted by the loop optimizer for certain
! well-behaved loops with a finite number of loop iterations using
! information collected during strength reduction.
  
!  The `doloop_end' pattern describes the actual looping instruction (or
! the implicit looping operation) and the `doloop_begin' pattern is an
  optional companion pattern that can be used for initialization needed
  for some low-overhead looping instructions.
  
   Note that some machines require the actual looping instruction to be
  emitted at the top of the loop (e.g., the TMS320C3x/C4x DSPs).  Emitting
  the true RTL for a looping instruction at the top of the loop can cause
! problems with flow analysis.  So instead, a dummy `doloop' insn is
  emitted at the end of the loop.  The machine dependent reorg pass checks
! for the presence of this `doloop' insn and then searches back to the
! top of the loop, where it inserts the true looping insn (provided there
! are no instructions in the loop which would cause problems).  Any
! additional labels can be emitted at this point.  In addition, if the
! desired special iteration counter register was not allocated, this
! machine dependent reorg pass could emit a traditional compare and jump
  instruction pair.
  
!  The essential difference between the `decrement_and_branch_until_zero'
! and the `doloop_end' patterns is that the loop optimizer allocates an
! additional pseudo register for the latter as an iteration counter.
! This pseudo register cannot be used within the loop (i.e., general
! induction variables cannot be derived from it), however, in many cases
! the loop induction variable may become redundant and removed by the
! flow pass.
  
  
  File: gccint.info,  Node: Insn Canonicalizations,  Next: Expander Definitions,  Prev: Looping Patterns,  Up: Machine Desc
--- 24671,24705 ----
         "find_reg_note (insn, REG_NONNEG, 0)"
         "...")
  
!  The other two special looping patterns, 'doloop_begin' and
! 'doloop_end', are emitted by the loop optimizer for certain well-behaved
! loops with a finite number of loop iterations using information
! collected during strength reduction.
  
!  The 'doloop_end' pattern describes the actual looping instruction (or
! the implicit looping operation) and the 'doloop_begin' pattern is an
  optional companion pattern that can be used for initialization needed
  for some low-overhead looping instructions.
  
   Note that some machines require the actual looping instruction to be
  emitted at the top of the loop (e.g., the TMS320C3x/C4x DSPs).  Emitting
  the true RTL for a looping instruction at the top of the loop can cause
! problems with flow analysis.  So instead, a dummy 'doloop' insn is
  emitted at the end of the loop.  The machine dependent reorg pass checks
! for the presence of this 'doloop' insn and then searches back to the top
! of the loop, where it inserts the true looping insn (provided there are
! no instructions in the loop which would cause problems).  Any additional
! labels can be emitted at this point.  In addition, if the desired
! special iteration counter register was not allocated, this machine
! dependent reorg pass could emit a traditional compare and jump
  instruction pair.
  
!  The essential difference between the 'decrement_and_branch_until_zero'
! and the 'doloop_end' patterns is that the loop optimizer allocates an
! additional pseudo register for the latter as an iteration counter.  This
! pseudo register cannot be used within the loop (i.e., general induction
! variables cannot be derived from it), however, in many cases the loop
! induction variable may become redundant and removed by the flow pass.
  
  
  File: gccint.info,  Node: Insn Canonicalizations,  Next: Expander Definitions,  Prev: Looping Patterns,  Up: Machine Desc
*************** number of insn patterns required.
*** 25088,25132 ****
   In addition to algebraic simplifications, following canonicalizations
  are performed:
  
!    * For commutative and comparison operators, a constant is always
!      made the second operand.  If a machine only supports a constant as
!      the second operand, only patterns that match a constant in the
!      second operand need be supplied.
  
     * For associative operators, a sequence of operators will always
       chain to the left; for instance, only the left operand of an
!      integer `plus' can itself be a `plus'.  `and', `ior', `xor',
!      `plus', `mult', `smin', `smax', `umin', and `umax' are associative
       when applied to integers, and sometimes to floating-point.
  
!    * For these operators, if only one operand is a `neg', `not',
!      `mult', `plus', or `minus' expression, it will be the first
!      operand.
  
!    * In combinations of `neg', `mult', `plus', and `minus', the `neg'
       operations (if any) will be moved inside the operations as far as
!      possible.  For instance, `(neg (mult A B))' is canonicalized as
!      `(mult (neg A) B)', but `(plus (mult (neg B) C) A)' is
!      canonicalized as `(minus A (mult B C))'.
  
!    * For the `compare' operator, a constant is always the second operand
!      if the first argument is a condition code register or `(cc0)'.
  
!    * An operand of `neg', `not', `mult', `plus', or `minus' is made the
       first operand under the same conditions as above.
  
!    * `(ltu (plus A B) B)' is converted to `(ltu (plus A B) A)'.
!      Likewise with `geu' instead of `ltu'.
  
!    * `(minus X (const_int N))' is converted to `(plus X (const_int
       -N))'.
  
!    * Within address computations (i.e., inside `mem'), a left shift is
       converted into the appropriate multiplication by a power of two.
  
     * De Morgan's Law is used to move bitwise negation inside a bitwise
       logical-and or logical-or operation.  If this results in only one
!      operand being a `not' expression, it will be the first one.
  
       A machine that has an instruction that performs a bitwise
       logical-and of one operand with the bitwise negation of the other
--- 24717,24760 ----
   In addition to algebraic simplifications, following canonicalizations
  are performed:
  
!    * For commutative and comparison operators, a constant is always made
!      the second operand.  If a machine only supports a constant as the
!      second operand, only patterns that match a constant in the second
!      operand need be supplied.
  
     * For associative operators, a sequence of operators will always
       chain to the left; for instance, only the left operand of an
!      integer 'plus' can itself be a 'plus'.  'and', 'ior', 'xor',
!      'plus', 'mult', 'smin', 'smax', 'umin', and 'umax' are associative
       when applied to integers, and sometimes to floating-point.
  
!    * For these operators, if only one operand is a 'neg', 'not', 'mult',
!      'plus', or 'minus' expression, it will be the first operand.
  
!    * In combinations of 'neg', 'mult', 'plus', and 'minus', the 'neg'
       operations (if any) will be moved inside the operations as far as
!      possible.  For instance, '(neg (mult A B))' is canonicalized as
!      '(mult (neg A) B)', but '(plus (mult (neg B) C) A)' is
!      canonicalized as '(minus A (mult B C))'.
  
!    * For the 'compare' operator, a constant is always the second operand
!      if the first argument is a condition code register or '(cc0)'.
  
!    * An operand of 'neg', 'not', 'mult', 'plus', or 'minus' is made the
       first operand under the same conditions as above.
  
!    * '(ltu (plus A B) B)' is converted to '(ltu (plus A B) A)'.
!      Likewise with 'geu' instead of 'ltu'.
  
!    * '(minus X (const_int N))' is converted to '(plus X (const_int
       -N))'.
  
!    * Within address computations (i.e., inside 'mem'), a left shift is
       converted into the appropriate multiplication by a power of two.
  
     * De Morgan's Law is used to move bitwise negation inside a bitwise
       logical-and or logical-or operation.  If this results in only one
!      operand being a 'not' expression, it will be the first one.
  
       A machine that has an instruction that performs a bitwise
       logical-and of one operand with the bitwise negation of the other
*************** are performed:
*** 25152,25158 ****
       logically equivalent RTL expressions.
  
     * The only possible RTL expressions involving both bitwise
!      exclusive-or and bitwise negation are `(xor:M X Y)' and `(not:M
       (xor:M X Y))'.
  
     * The sum of three items, one of which is a constant, will only
--- 24780,24786 ----
       logically equivalent RTL expressions.
  
     * The only possible RTL expressions involving both bitwise
!      exclusive-or and bitwise negation are '(xor:M X Y)' and '(not:M
       (xor:M X Y))'.
  
     * The sum of three items, one of which is a constant, will only
*************** are performed:
*** 25160,25184 ****
  
            (plus:M (plus:M X Y) CONSTANT)
  
!    * Equality comparisons of a group of bits (usually a single bit)
!      with zero will be written using `zero_extract' rather than the
!      equivalent `and' or `sign_extract' operations.
! 
!    * `(sign_extend:M1 (mult:M2 (sign_extend:M2 X) (sign_extend:M2 Y)))'
!      is converted to `(mult:M1 (sign_extend:M1 X) (sign_extend:M1 Y))',
!      and likewise for `zero_extend'.
  
!    * `(sign_extend:M1 (mult:M2 (ashiftrt:M2 X S) (sign_extend:M2 Y)))'
!      is converted to `(mult:M1 (sign_extend:M1 (ashiftrt:M2 X S))
!      (sign_extend:M1 Y))', and likewise for patterns using
!      `zero_extend' and `lshiftrt'.  If the second operand of `mult' is
!      also a shift, then that is extended also.  This transformation is
!      only applied when it can be proven that the original operation had
!      sufficient precision to prevent overflow.
  
  
   Further canonicalization rules are defined in the function
! `commutative_operand_precedence' in `gcc/rtlanal.c'.
  
  
  File: gccint.info,  Node: Expander Definitions,  Next: Insn Splitting,  Prev: Insn Canonicalizations,  Up: Machine Desc
--- 24788,24811 ----
  
            (plus:M (plus:M X Y) CONSTANT)
  
!    * Equality comparisons of a group of bits (usually a single bit) with
!      zero will be written using 'zero_extract' rather than the
!      equivalent 'and' or 'sign_extract' operations.
  
!    * '(sign_extend:M1 (mult:M2 (sign_extend:M2 X) (sign_extend:M2 Y)))'
!      is converted to '(mult:M1 (sign_extend:M1 X) (sign_extend:M1 Y))',
!      and likewise for 'zero_extend'.
  
+    * '(sign_extend:M1 (mult:M2 (ashiftrt:M2 X S) (sign_extend:M2 Y)))'
+      is converted to '(mult:M1 (sign_extend:M1 (ashiftrt:M2 X S))
+      (sign_extend:M1 Y))', and likewise for patterns using 'zero_extend'
+      and 'lshiftrt'.  If the second operand of 'mult' is also a shift,
+      then that is extended also.  This transformation is only applied
+      when it can be proven that the original operation had sufficient
+      precision to prevent overflow.
  
   Further canonicalization rules are defined in the function
! 'commutative_operand_precedence' in 'gcc/rtlanal.c'.
  
  
  File: gccint.info,  Node: Expander Definitions,  Next: Insn Splitting,  Prev: Insn Canonicalizations,  Up: Machine Desc
*************** File: gccint.info,  Node: Expander Defin
*** 25189,25218 ****
  On some target machines, some standard pattern names for RTL generation
  cannot be handled with single insn, but a sequence of RTL insns can
  represent them.  For these target machines, you can write a
! `define_expand' to specify how to generate the sequence of RTL.
  
!  A `define_expand' is an RTL expression that looks almost like a
! `define_insn'; but, unlike the latter, a `define_expand' is used only
  for RTL generation and it can produce more than one RTL insn.
  
!  A `define_expand' RTX has four operands:
  
!    * The name.  Each `define_expand' must have a name, since the only
       use for it is to refer to it by name.
  
     * The RTL template.  This is a vector of RTL expressions representing
!      a sequence of separate instructions.  Unlike `define_insn', there
!      is no implicit surrounding `PARALLEL'.
  
!    * The condition, a string containing a C expression.  This
!      expression is used to express how the availability of this pattern
!      depends on subclasses of target machine, selected by command-line
!      options when GCC is run.  This is just like the condition of a
!      `define_insn' that has a standard name.  Therefore, the condition
!      (if present) may not depend on the data in the insn being matched,
!      but only the target-machine-type flags.  The compiler needs to
!      test these conditions during initialization in order to learn
!      exactly which named instructions are available in a particular run.
  
     * The preparation statements, a string containing zero or more C
       statements which are to be executed before RTL code is generated
--- 24816,24845 ----
  On some target machines, some standard pattern names for RTL generation
  cannot be handled with single insn, but a sequence of RTL insns can
  represent them.  For these target machines, you can write a
! 'define_expand' to specify how to generate the sequence of RTL.
  
!  A 'define_expand' is an RTL expression that looks almost like a
! 'define_insn'; but, unlike the latter, a 'define_expand' is used only
  for RTL generation and it can produce more than one RTL insn.
  
!  A 'define_expand' RTX has four operands:
  
!    * The name.  Each 'define_expand' must have a name, since the only
       use for it is to refer to it by name.
  
     * The RTL template.  This is a vector of RTL expressions representing
!      a sequence of separate instructions.  Unlike 'define_insn', there
!      is no implicit surrounding 'PARALLEL'.
  
!    * The condition, a string containing a C expression.  This expression
!      is used to express how the availability of this pattern depends on
!      subclasses of target machine, selected by command-line options when
!      GCC is run.  This is just like the condition of a 'define_insn'
!      that has a standard name.  Therefore, the condition (if present)
!      may not depend on the data in the insn being matched, but only the
!      target-machine-type flags.  The compiler needs to test these
!      conditions during initialization in order to learn exactly which
!      named instructions are available in a particular run.
  
     * The preparation statements, a string containing zero or more C
       statements which are to be executed before RTL code is generated
*************** for RTL generation and it can produce mo
*** 25220,25233 ****
  
       Usually these statements prepare temporary registers for use as
       internal operands in the RTL template, but they can also generate
!      RTL insns directly by calling routines such as `emit_insn', etc.
       Any such insns precede the ones that come from the RTL template.
  
!    * Optionally, a vector containing the values of attributes. *Note
       Insn Attributes::.
  
!  Every RTL insn emitted by a `define_expand' must match some
! `define_insn' in the machine description.  Otherwise, the compiler will
  crash when trying to generate code for the insn or trying to optimize
  it.
  
--- 24847,24860 ----
  
       Usually these statements prepare temporary registers for use as
       internal operands in the RTL template, but they can also generate
!      RTL insns directly by calling routines such as 'emit_insn', etc.
       Any such insns precede the ones that come from the RTL template.
  
!    * Optionally, a vector containing the values of attributes.  *Note
       Insn Attributes::.
  
!  Every RTL insn emitted by a 'define_expand' must match some
! 'define_insn' in the machine description.  Otherwise, the compiler will
  crash when trying to generate code for the insn or trying to optimize
  it.
  
*************** also describes the operands that need to
*** 25236,25286 ****
  is used.  In particular, it gives a predicate for each operand.
  
   A true operand, which needs to be specified in order to generate RTL
! from the pattern, should be described with a `match_operand' in its
  first occurrence in the RTL template.  This enters information on the
  operand's predicate into the tables that record such things.  GCC uses
  the information to preload the operand into a register if that is
  required for valid RTL code.  If the operand is referred to more than
! once, subsequent references should use `match_dup'.
  
   The RTL template may also refer to internal "operands" which are
  temporary registers or labels used only within the sequence made by the
! `define_expand'.  Internal operands are substituted into the RTL
! template with `match_dup', never with `match_operand'.  The values of
  the internal operands are not passed in as arguments by the compiler
! when it requests use of this pattern.  Instead, they are computed
! within the pattern, in the preparation statements.  These statements
! compute the values and store them into the appropriate elements of
! `operands' so that `match_dup' can find them.
  
   There are two special macros defined for use in the preparation
! statements: `DONE' and `FAIL'.  Use them with a following semicolon, as
  a statement.
  
! `DONE'
!      Use the `DONE' macro to end RTL generation for the pattern.  The
       only RTL insns resulting from the pattern on this occasion will be
!      those already emitted by explicit calls to `emit_insn' within the
       preparation statements; the RTL template will not be generated.
  
! `FAIL'
       Make the pattern fail on this occasion.  When a pattern fails, it
       means that the pattern was not truly available.  The calling
       routines in the compiler will try other strategies for code
       generation using other patterns.
  
       Failure is currently supported only for binary (addition,
!      multiplication, shifting, etc.) and bit-field (`extv', `extzv',
!      and `insv') operations.
  
!  If the preparation falls through (invokes neither `DONE' nor `FAIL'),
! then the `define_expand' acts like a `define_insn' in that the RTL
  template is used to generate the insn.
  
   The RTL template is not used for matching, only for generating the
! initial insn list.  If the preparation statement always invokes `DONE'
! or `FAIL', the RTL template may be reduced to a simple list of
! operands, such as this example:
  
       (define_expand "addsi3"
         [(match_operand:SI 0 "register_operand" "")
--- 24863,24913 ----
  is used.  In particular, it gives a predicate for each operand.
  
   A true operand, which needs to be specified in order to generate RTL
! from the pattern, should be described with a 'match_operand' in its
  first occurrence in the RTL template.  This enters information on the
  operand's predicate into the tables that record such things.  GCC uses
  the information to preload the operand into a register if that is
  required for valid RTL code.  If the operand is referred to more than
! once, subsequent references should use 'match_dup'.
  
   The RTL template may also refer to internal "operands" which are
  temporary registers or labels used only within the sequence made by the
! 'define_expand'.  Internal operands are substituted into the RTL
! template with 'match_dup', never with 'match_operand'.  The values of
  the internal operands are not passed in as arguments by the compiler
! when it requests use of this pattern.  Instead, they are computed within
! the pattern, in the preparation statements.  These statements compute
! the values and store them into the appropriate elements of 'operands' so
! that 'match_dup' can find them.
  
   There are two special macros defined for use in the preparation
! statements: 'DONE' and 'FAIL'.  Use them with a following semicolon, as
  a statement.
  
! 'DONE'
!      Use the 'DONE' macro to end RTL generation for the pattern.  The
       only RTL insns resulting from the pattern on this occasion will be
!      those already emitted by explicit calls to 'emit_insn' within the
       preparation statements; the RTL template will not be generated.
  
! 'FAIL'
       Make the pattern fail on this occasion.  When a pattern fails, it
       means that the pattern was not truly available.  The calling
       routines in the compiler will try other strategies for code
       generation using other patterns.
  
       Failure is currently supported only for binary (addition,
!      multiplication, shifting, etc.)  and bit-field ('extv', 'extzv',
!      and 'insv') operations.
  
!  If the preparation falls through (invokes neither 'DONE' nor 'FAIL'),
! then the 'define_expand' acts like a 'define_insn' in that the RTL
  template is used to generate the insn.
  
   The RTL template is not used for matching, only for generating the
! initial insn list.  If the preparation statement always invokes 'DONE'
! or 'FAIL', the RTL template may be reduced to a simple list of operands,
! such as this example:
  
       (define_expand "addsi3"
         [(match_operand:SI 0 "register_operand" "")
*************** operands, such as this example:
*** 25309,25324 ****
           FAIL;
       }")
  
! This example uses `define_expand' so that it can generate an RTL insn
  for shifting when the shift-count is in the supported range of 0 to 3
  but fail in other cases where machine insns aren't available.  When it
  fails, the compiler tries another strategy using different patterns
  (such as, a library call).
  
   If the compiler were able to handle nontrivial condition-strings in
! patterns with names, then it would be possible to use a `define_insn'
! in that case.  Here is another case (zero-extension on the 68000) which
! makes more use of the power of `define_expand':
  
       (define_expand "zero_extendhisi2"
         [(set (match_operand:SI 0 "general_operand" "")
--- 24936,24951 ----
           FAIL;
       }")
  
! This example uses 'define_expand' so that it can generate an RTL insn
  for shifting when the shift-count is in the supported range of 0 to 3
  but fail in other cases where machine insns aren't available.  When it
  fails, the compiler tries another strategy using different patterns
  (such as, a library call).
  
   If the compiler were able to handle nontrivial condition-strings in
! patterns with names, then it would be possible to use a 'define_insn' in
! that case.  Here is another case (zero-extension on the 68000) which
! makes more use of the power of 'define_expand':
  
       (define_expand "zero_extendhisi2"
         [(set (match_operand:SI 0 "general_operand" "")
*************** Here two RTL insns are generated, one to
*** 25335,25350 ****
  and the other to copy the input operand into its low half.  This
  sequence is incorrect if the input operand refers to [the old value of]
  the output operand, so the preparation statement makes sure this isn't
! so.  The function `make_safe_from' copies the `operands[1]' into a
! temporary register if it refers to `operands[0]'.  It does this by
  emitting another RTL insn.
  
   Finally, a third example shows the use of an internal operand.
! Zero-extension on the SPUR chip is done by `and'-ing the result against
! a halfword mask.  But this mask cannot be represented by a `const_int'
  because the constant value is too large to be legitimate on this
! machine.  So it must be copied into a register with `force_reg' and
! then the register used in the `and'.
  
       (define_expand "zero_extendhisi2"
         [(set (match_operand:SI 0 "register_operand" "")
--- 24962,24977 ----
  and the other to copy the input operand into its low half.  This
  sequence is incorrect if the input operand refers to [the old value of]
  the output operand, so the preparation statement makes sure this isn't
! so.  The function 'make_safe_from' copies the 'operands[1]' into a
! temporary register if it refers to 'operands[0]'.  It does this by
  emitting another RTL insn.
  
   Finally, a third example shows the use of an internal operand.
! Zero-extension on the SPUR chip is done by 'and'-ing the result against
! a halfword mask.  But this mask cannot be represented by a 'const_int'
  because the constant value is too large to be legitimate on this
! machine.  So it must be copied into a register with 'force_reg' and then
! the register used in the 'and'.
  
       (define_expand "zero_extendhisi2"
         [(set (match_operand:SI 0 "register_operand" "")
*************** then the register used in the `and'.
*** 25356,25365 ****
         "operands[2]
            = force_reg (SImode, GEN_INT (65535)); ")
  
!  _Note:_ If the `define_expand' is used to serve a standard binary or
  unary arithmetic operation or a bit-field operation, then the last insn
! it generates must not be a `code_label', `barrier' or `note'.  It must
! be an `insn', `jump_insn' or `call_insn'.  If you don't need a real insn
  at the end, emit an insn to copy the result of the operation into
  itself.  Such an insn will generate no code, but it can avoid problems
  in the compiler.
--- 24983,24992 ----
         "operands[2]
            = force_reg (SImode, GEN_INT (65535)); ")
  
!  _Note:_ If the 'define_expand' is used to serve a standard binary or
  unary arithmetic operation or a bit-field operation, then the last insn
! it generates must not be a 'code_label', 'barrier' or 'note'.  It must
! be an 'insn', 'jump_insn' or 'call_insn'.  If you don't need a real insn
  at the end, emit an insn to copy the result of the operation into
  itself.  Such an insn will generate no code, but it can avoid problems
  in the compiler.
*************** File: gccint.info,  Node: Insn Splitting
*** 25370,25381 ****
  16.16 Defining How to Split Instructions
  ========================================
  
! There are two cases where you should specify how to split a pattern
! into multiple insns.  On machines that have instructions requiring
! delay slots (*note Delay Slots::) or that have instructions whose
! output is not available for multiple cycles (*note Processor pipeline
! description::), the compiler phases that optimize these cases need to
! be able to move insns into one-instruction delay slots.  However, some
  insns may generate more than one machine instruction.  These insns
  cannot be placed into a delay slot.
  
--- 24997,25008 ----
  16.16 Defining How to Split Instructions
  ========================================
  
! There are two cases where you should specify how to split a pattern into
! multiple insns.  On machines that have instructions requiring delay
! slots (*note Delay Slots::) or that have instructions whose output is
! not available for multiple cycles (*note Processor pipeline
! description::), the compiler phases that optimize these cases need to be
! able to move insns into one-instruction delay slots.  However, some
  insns may generate more than one machine instruction.  These insns
  cannot be placed into a delay slot.
  
*************** scheduling.
*** 25389,25403 ****
  
   The insn combiner phase also splits putative insns.  If three insns are
  merged into one insn with a complex expression that cannot be matched by
! some `define_insn' pattern, the combiner phase attempts to split the
  complex pattern into two insns that are recognized.  Usually it can
  break the complex pattern into two patterns by splitting out some
  subexpression.  However, in some other cases, such as performing an
  addition of a large constant in two insns on a RISC machine, the way to
  split the addition into two insns is machine-dependent.
  
!  The `define_split' definition tells the compiler how to split a
! complex insn into several simpler insns.  It looks like this:
  
       (define_split
         [INSN-PATTERN]
--- 25016,25030 ----
  
   The insn combiner phase also splits putative insns.  If three insns are
  merged into one insn with a complex expression that cannot be matched by
! some 'define_insn' pattern, the combiner phase attempts to split the
  complex pattern into two insns that are recognized.  Usually it can
  break the complex pattern into two patterns by splitting out some
  subexpression.  However, in some other cases, such as performing an
  addition of a large constant in two insns on a RISC machine, the way to
  split the addition into two insns is machine-dependent.
  
!  The 'define_split' definition tells the compiler how to split a complex
! insn into several simpler insns.  It looks like this:
  
       (define_split
         [INSN-PATTERN]
*************** complex insn into several simpler insns.
*** 25408,25438 ****
         "PREPARATION-STATEMENTS")
  
   INSN-PATTERN is a pattern that needs to be split and CONDITION is the
! final condition to be tested, as in a `define_insn'.  When an insn
  matching INSN-PATTERN and satisfying CONDITION is found, it is replaced
  in the insn list with the insns given by NEW-INSN-PATTERN-1,
  NEW-INSN-PATTERN-2, etc.
  
   The PREPARATION-STATEMENTS are similar to those statements that are
! specified for `define_expand' (*note Expander Definitions::) and are
  executed before the new RTL is generated to prepare for the generated
  code or emit some insns whose pattern is not fixed.  Unlike those in
! `define_expand', however, these statements must not generate any new
  pseudo-registers.  Once reload has completed, they also must not
  allocate any space in the stack frame.
  
   Patterns are matched against INSN-PATTERN in two different
  circumstances.  If an insn needs to be split for delay slot scheduling
  or insn scheduling, the insn is already known to be valid, which means
! that it must have been matched by some `define_insn' and, if
! `reload_completed' is nonzero, is known to satisfy the constraints of
! that `define_insn'.  In that case, the new insn patterns must also be
! insns that are matched by some `define_insn' and, if `reload_completed'
  is nonzero, must also satisfy the constraints of those definitions.
  
!  As an example of this usage of `define_split', consider the following
! example from `a29k.md', which splits a `sign_extend' from `HImode' to
! `SImode' into a pair of shift insns:
  
       (define_split
         [(set (match_operand:SI 0 "gen_reg_operand" "")
--- 25035,25065 ----
         "PREPARATION-STATEMENTS")
  
   INSN-PATTERN is a pattern that needs to be split and CONDITION is the
! final condition to be tested, as in a 'define_insn'.  When an insn
  matching INSN-PATTERN and satisfying CONDITION is found, it is replaced
  in the insn list with the insns given by NEW-INSN-PATTERN-1,
  NEW-INSN-PATTERN-2, etc.
  
   The PREPARATION-STATEMENTS are similar to those statements that are
! specified for 'define_expand' (*note Expander Definitions::) and are
  executed before the new RTL is generated to prepare for the generated
  code or emit some insns whose pattern is not fixed.  Unlike those in
! 'define_expand', however, these statements must not generate any new
  pseudo-registers.  Once reload has completed, they also must not
  allocate any space in the stack frame.
  
   Patterns are matched against INSN-PATTERN in two different
  circumstances.  If an insn needs to be split for delay slot scheduling
  or insn scheduling, the insn is already known to be valid, which means
! that it must have been matched by some 'define_insn' and, if
! 'reload_completed' is nonzero, is known to satisfy the constraints of
! that 'define_insn'.  In that case, the new insn patterns must also be
! insns that are matched by some 'define_insn' and, if 'reload_completed'
  is nonzero, must also satisfy the constraints of those definitions.
  
!  As an example of this usage of 'define_split', consider the following
! example from 'a29k.md', which splits a 'sign_extend' from 'HImode' to
! 'SImode' into a pair of shift insns:
  
       (define_split
         [(set (match_operand:SI 0 "gen_reg_operand" "")
*************** example from `a29k.md', which splits a `
*** 25448,25465 ****
       { operands[1] = gen_lowpart (SImode, operands[1]); }")
  
   When the combiner phase tries to split an insn pattern, it is always
! the case that the pattern is _not_ matched by any `define_insn'.  The
! combiner pass first tries to split a single `set' expression and then
! the same `set' expression inside a `parallel', but followed by a
! `clobber' of a pseudo-reg to use as a scratch register.  In these
! cases, the combiner expects exactly two new insn patterns to be
! generated.  It will verify that these patterns match some `define_insn'
! definitions, so you need not do this test in the `define_split' (of
! course, there is no point in writing a `define_split' that will never
! produce insns that match).
  
!  Here is an example of this use of `define_split', taken from
! `rs6000.md':
  
       (define_split
         [(set (match_operand:SI 0 "gen_reg_operand" "")
--- 25075,25092 ----
       { operands[1] = gen_lowpart (SImode, operands[1]); }")
  
   When the combiner phase tries to split an insn pattern, it is always
! the case that the pattern is _not_ matched by any 'define_insn'.  The
! combiner pass first tries to split a single 'set' expression and then
! the same 'set' expression inside a 'parallel', but followed by a
! 'clobber' of a pseudo-reg to use as a scratch register.  In these cases,
! the combiner expects exactly two new insn patterns to be generated.  It
! will verify that these patterns match some 'define_insn' definitions, so
! you need not do this test in the 'define_split' (of course, there is no
! point in writing a 'define_split' that will never produce insns that
! match).
  
!  Here is an example of this use of 'define_split', taken from
! 'rs6000.md':
  
       (define_split
         [(set (match_operand:SI 0 "gen_reg_operand" "")
*************** produce insns that match).
*** 25480,25489 ****
         operands[4] = GEN_INT (low);
       }")
  
!  Here the predicate `non_add_cint_operand' matches any `const_int' that
! is _not_ a valid operand of a single add insn.  The add with the
! smaller displacement is written so that it can be substituted into the
! address of a subsequent operation.
  
   An example that uses a scratch register, from the same file, generates
  an equality comparison of a register and a large constant:
--- 25107,25116 ----
         operands[4] = GEN_INT (low);
       }")
  
!  Here the predicate 'non_add_cint_operand' matches any 'const_int' that
! is _not_ a valid operand of a single add insn.  The add with the smaller
! displacement is written so that it can be substituted into the address
! of a subsequent operation.
  
   An example that uses a scratch register, from the same file, generates
  an equality comparison of a register and a large constant:
*************** an equality comparison of a register and
*** 25512,25520 ****
         operands[5] = GEN_INT (sextc);
       }")
  
!  To avoid confusion, don't write a single `define_split' that accepts
! some insns that match some `define_insn' as well as some insns that
! don't.  Instead, write two separate `define_split' definitions, one for
  the insns that are valid and one for the insns that are not valid.
  
   The splitter is allowed to split jump instructions into sequence of
--- 25139,25147 ----
         operands[5] = GEN_INT (sextc);
       }")
  
!  To avoid confusion, don't write a single 'define_split' that accepts
! some insns that match some 'define_insn' as well as some insns that
! don't.  Instead, write two separate 'define_split' definitions, one for
  the insns that are valid and one for the insns that are not valid.
  
   The splitter is allowed to split jump instructions into sequence of
*************** instruction is always valid, as compiler
*** 25527,25542 ****
  new jump.  When new sequence contains multiple jump instructions or new
  labels, more assistance is needed.  Splitter is required to create only
  unconditional jumps, or simple conditional jump instructions.
! Additionally it must attach a `REG_BR_PROB' note to each conditional
! jump.  A global variable `split_branch_probability' holds the
  probability of the original branch in case it was a simple conditional
  jump, -1 otherwise.  To simplify recomputing of edge frequencies, the
! new sequence is required to have only forward jumps to the newly
! created labels.
  
!  For the common case where the pattern of a define_split exactly
! matches the pattern of a define_insn, use `define_insn_and_split'.  It
! looks like this:
  
       (define_insn_and_split
         [INSN-PATTERN]
--- 25154,25169 ----
  new jump.  When new sequence contains multiple jump instructions or new
  labels, more assistance is needed.  Splitter is required to create only
  unconditional jumps, or simple conditional jump instructions.
! Additionally it must attach a 'REG_BR_PROB' note to each conditional
! jump.  A global variable 'split_branch_probability' holds the
  probability of the original branch in case it was a simple conditional
  jump, -1 otherwise.  To simplify recomputing of edge frequencies, the
! new sequence is required to have only forward jumps to the newly created
! labels.
  
!  For the common case where the pattern of a define_split exactly matches
! the pattern of a define_insn, use 'define_insn_and_split'.  It looks
! like this:
  
       (define_insn_and_split
         [INSN-PATTERN]
*************** looks like this:
*** 25549,25559 ****
         "PREPARATION-STATEMENTS"
         [INSN-ATTRIBUTES])
  
   INSN-PATTERN, CONDITION, OUTPUT-TEMPLATE, and INSN-ATTRIBUTES are used
! as in `define_insn'.  The NEW-INSN-PATTERN vector and the
! PREPARATION-STATEMENTS are used as in a `define_split'.  The
! SPLIT-CONDITION is also used as in `define_split', with the additional
! behavior that if the condition starts with `&&', the condition used for
  the split will be the constructed as a logical "and" of the split
  condition with the insn condition.  For example, from i386.md:
  
--- 25176,25187 ----
         "PREPARATION-STATEMENTS"
         [INSN-ATTRIBUTES])
  
+ 
   INSN-PATTERN, CONDITION, OUTPUT-TEMPLATE, and INSN-ATTRIBUTES are used
! as in 'define_insn'.  The NEW-INSN-PATTERN vector and the
! PREPARATION-STATEMENTS are used as in a 'define_split'.  The
! SPLIT-CONDITION is also used as in 'define_split', with the additional
! behavior that if the condition starts with '&&', the condition used for
  the split will be the constructed as a logical "and" of the split
  condition with the insn condition.  For example, from i386.md:
  
*************** condition with the insn condition.  For
*** 25570,25582 ****
         ""
         [(set_attr "type" "alu1")])
  
   In this case, the actual split condition will be
! `TARGET_ZERO_EXTEND_WITH_AND && !optimize_size && reload_completed'.
  
!  The `define_insn_and_split' construction provides exactly the same
! functionality as two separate `define_insn' and `define_split'
! patterns.  It exists for compactness, and as a maintenance tool to
! prevent having to ensure the two patterns' templates match.
  
  
  File: gccint.info,  Node: Including Patterns,  Next: Peephole Definitions,  Prev: Insn Splitting,  Up: Machine Desc
--- 25198,25211 ----
         ""
         [(set_attr "type" "alu1")])
  
+ 
   In this case, the actual split condition will be
! 'TARGET_ZERO_EXTEND_WITH_AND && !optimize_size && reload_completed'.
  
!  The 'define_insn_and_split' construction provides exactly the same
! functionality as two separate 'define_insn' and 'define_split' patterns.
! It exists for compactness, and as a maintenance tool to prevent having
! to ensure the two patterns' templates match.
  
  
  File: gccint.info,  Node: Including Patterns,  Next: Peephole Definitions,  Prev: Insn Splitting,  Up: Machine Desc
*************** File: gccint.info,  Node: Including Patt
*** 25584,25591 ****
  16.17 Including Patterns in Machine Descriptions.
  =================================================
  
! The `include' pattern tells the compiler tools where to look for
! patterns that are in files other than in the file `.md'.  This is used
  only at build time and there is no preprocessing allowed.
  
   It looks like:
--- 25213,25220 ----
  16.17 Including Patterns in Machine Descriptions.
  =================================================
  
! The 'include' pattern tells the compiler tools where to look for
! patterns that are in files other than in the file '.md'.  This is used
  only at build time and there is no preprocessing allowed.
  
   It looks like:
*************** only at build time and there is no prepr
*** 25599,25607 ****
  
       (include "filestuff")
  
   Where PATHNAME is a string that specifies the location of the file,
! specifies the include file to be in `gcc/config/target/filestuff'.  The
! directory `gcc/config/target' is regarded as the default directory.
  
   Machine descriptions may be split up into smaller more manageable
  subsections and placed into subdirectories.
--- 25228,25237 ----
  
       (include "filestuff")
  
+ 
   Where PATHNAME is a string that specifies the location of the file,
! specifies the include file to be in 'gcc/config/target/filestuff'.  The
! directory 'gcc/config/target' is regarded as the default directory.
  
   Machine descriptions may be split up into smaller more manageable
  subsections and placed into subdirectories.
*************** subsections and placed into subdirectori
*** 25611,25638 ****
  
       (include "BOGUS/filestuff")
  
   the include file is specified to be in
! `gcc/config/TARGET/BOGUS/filestuff'.
  
   Specifying an absolute path for the include file such as;
  
       (include "/u2/BOGUS/filestuff")
   is permitted but is not encouraged.
  
  16.17.1 RTL Generation Tool Options for Directory Search
  --------------------------------------------------------
  
! The `-IDIR' option specifies directories to search for machine
  descriptions.  For example:
  
  
       genrecog -I/p1/abc/proc1 -I/p2/abcd/pro2 target.md
  
   Add the directory DIR to the head of the list of directories to be
  searched for header files.  This can be used to override a system
  machine definition file, substituting your own version, since these
  directories are searched before the default machine description file
! directories.  If you use more than one `-I' option, the directories are
  scanned in left-to-right order; the standard default directory come
  after.
  
--- 25241,25271 ----
  
       (include "BOGUS/filestuff")
  
+ 
   the include file is specified to be in
! 'gcc/config/TARGET/BOGUS/filestuff'.
  
   Specifying an absolute path for the include file such as;
  
       (include "/u2/BOGUS/filestuff")
+ 
   is permitted but is not encouraged.
  
  16.17.1 RTL Generation Tool Options for Directory Search
  --------------------------------------------------------
  
! The '-IDIR' option specifies directories to search for machine
  descriptions.  For example:
  
  
       genrecog -I/p1/abc/proc1 -I/p2/abcd/pro2 target.md
  
+ 
   Add the directory DIR to the head of the list of directories to be
  searched for header files.  This can be used to override a system
  machine definition file, substituting your own version, since these
  directories are searched before the default machine description file
! directories.  If you use more than one '-I' option, the directories are
  scanned in left-to-right order; the standard default directory come
  after.
  
*************** File: gccint.info,  Node: Peephole Defin
*** 25642,25648 ****
  16.18 Machine-Specific Peephole Optimizers
  ==========================================
  
! In addition to instruction patterns the `md' file may contain
  definitions of machine-specific peephole optimizations.
  
   The combiner does not notice certain peephole optimizations when the
--- 25275,25281 ----
  16.18 Machine-Specific Peephole Optimizers
  ==========================================
  
! In addition to instruction patterns the 'md' file may contain
  definitions of machine-specific peephole optimizations.
  
   The combiner does not notice certain peephole optimizations when the
*************** computed in the first one.  A machine-sp
*** 25653,25664 ****
  detect such opportunities.
  
   There are two forms of peephole definitions that may be used.  The
! original `define_peephole' is run at assembly output time to match
! insns and substitute assembly text.  Use of `define_peephole' is
! deprecated.
  
!  A newer `define_peephole2' matches insns and substitutes new insns.
! The `peephole2' pass is run after register allocation but before
  scheduling, which may result in much better code for targets that do
  scheduling.
  
--- 25286,25296 ----
  detect such opportunities.
  
   There are two forms of peephole definitions that may be used.  The
! original 'define_peephole' is run at assembly output time to match insns
! and substitute assembly text.  Use of 'define_peephole' is deprecated.
  
!  A newer 'define_peephole2' matches insns and substitutes new insns.
! The 'peephole2' pass is run after register allocation but before
  scheduling, which may result in much better code for targets that do
  scheduling.
  
*************** A definition looks like this:
*** 25685,25691 ****
  
  The last string operand may be omitted if you are not using any
  machine-specific information in this machine description.  If present,
! it must obey the same rules as in a `define_insn'.
  
   In this skeleton, INSN-PATTERN-1 and so on are patterns to match
  consecutive insns.  The optimization applies to a sequence of insns when
--- 25317,25323 ----
  
  The last string operand may be omitted if you are not using any
  machine-specific information in this machine description.  If present,
! it must obey the same rules as in a 'define_insn'.
  
   In this skeleton, INSN-PATTERN-1 and so on are patterns to match
  consecutive insns.  The optimization applies to a sequence of insns when
*************** INSN-PATTERN-1 matches the first one, IN
*** 25693,25715 ****
  and so on.
  
   Each of the insns matched by a peephole must also match a
! `define_insn'.  Peepholes are checked only at the last stage just
! before code generation, and only optionally.  Therefore, any insn which
! would match a peephole but no `define_insn' will cause a crash in code
  generation in an unoptimized compilation, or at various optimization
  stages.
  
!  The operands of the insns are matched with `match_operands',
! `match_operator', and `match_dup', as usual.  What is not usual is that
  the operand numbers apply to all the insn patterns in the definition.
  So, you can check for identical operands in two insns by using
! `match_operand' in one insn and `match_dup' in the other.
  
!  The operand constraints used in `match_operand' patterns do not have
! any direct effect on the applicability of the peephole, but they will
! be validated afterward, so make sure your constraints are general enough
! to apply whenever the peephole matches.  If the peephole matches but
! the constraints are not satisfied, the compiler will crash.
  
   It is safe to omit constraints in all the operands of the peephole; or
  you can write constraints which serve as a double-check on the criteria
--- 25325,25347 ----
  and so on.
  
   Each of the insns matched by a peephole must also match a
! 'define_insn'.  Peepholes are checked only at the last stage just before
! code generation, and only optionally.  Therefore, any insn which would
! match a peephole but no 'define_insn' will cause a crash in code
  generation in an unoptimized compilation, or at various optimization
  stages.
  
!  The operands of the insns are matched with 'match_operands',
! 'match_operator', and 'match_dup', as usual.  What is not usual is that
  the operand numbers apply to all the insn patterns in the definition.
  So, you can check for identical operands in two insns by using
! 'match_operand' in one insn and 'match_dup' in the other.
  
!  The operand constraints used in 'match_operand' patterns do not have
! any direct effect on the applicability of the peephole, but they will be
! validated afterward, so make sure your constraints are general enough to
! apply whenever the peephole matches.  If the peephole matches but the
! constraints are not satisfied, the compiler will crash.
  
   It is safe to omit constraints in all the operands of the peephole; or
  you can write constraints which serve as a double-check on the criteria
*************** allocation is complete.  Therefore, the
*** 25727,25748 ****
  which operands have ended up in which kinds of registers, just by
  looking at the operands.
  
!  The way to refer to the operands in CONDITION is to write
! `operands[I]' for operand number I (as matched by `(match_operand I
! ...)').  Use the variable `insn' to refer to the last of the insns
! being matched; use `prev_active_insn' to find the preceding insns.
  
   When optimizing computations with intermediate results, you can use
  CONDITION to match only when the intermediate results are not used
! elsewhere.  Use the C expression `dead_or_set_p (INSN, OP)', where INSN
  is the insn in which you expect the value to be used for the last time
! (from the value of `insn', together with use of `prev_nonnote_insn'),
! and OP is the intermediate value (from `operands[I]').
  
   Applying the optimization means replacing the sequence of insns with
  one new insn.  The TEMPLATE controls ultimate output of assembler code
  for this combined insn.  It works exactly like the template of a
! `define_insn'.  Operand numbers in this template are the same ones used
  in matching the original sequence of insns.
  
   The result of a defined peephole optimizer does not need to match any
--- 25359,25380 ----
  which operands have ended up in which kinds of registers, just by
  looking at the operands.
  
!  The way to refer to the operands in CONDITION is to write 'operands[I]'
! for operand number I (as matched by '(match_operand I ...)').  Use the
! variable 'insn' to refer to the last of the insns being matched; use
! 'prev_active_insn' to find the preceding insns.
  
   When optimizing computations with intermediate results, you can use
  CONDITION to match only when the intermediate results are not used
! elsewhere.  Use the C expression 'dead_or_set_p (INSN, OP)', where INSN
  is the insn in which you expect the value to be used for the last time
! (from the value of 'insn', together with use of 'prev_nonnote_insn'),
! and OP is the intermediate value (from 'operands[I]').
  
   Applying the optimization means replacing the sequence of insns with
  one new insn.  The TEMPLATE controls ultimate output of assembler code
  for this combined insn.  It works exactly like the template of a
! 'define_insn'.  Operand numbers in this template are the same ones used
  in matching the original sequence of insns.
  
   The result of a defined peephole optimizer does not need to match any
*************** into
*** 25790,25803 ****
       fmoved sp@+,fp0
  
   INSN-PATTERN-1 and so on look _almost_ like the second operand of
! `define_insn'.  There is one important difference: the second operand
! of `define_insn' consists of one or more RTX's enclosed in square
! brackets.  Usually, there is only one: then the same action can be
! written as an element of a `define_peephole'.  But when there are
! multiple actions in a `define_insn', they are implicitly enclosed in a
! `parallel'.  Then you must explicitly write the `parallel', and the
! square brackets within it, in the `define_peephole'.  Thus, if an insn
! pattern looks like this,
  
       (define_insn "divmodsi4"
         [(set (match_operand:SI 0 "general_operand" "=d")
--- 25422,25434 ----
       fmoved sp@+,fp0
  
   INSN-PATTERN-1 and so on look _almost_ like the second operand of
! 'define_insn'.  There is one important difference: the second operand of
! 'define_insn' consists of one or more RTX's enclosed in square brackets.
! Usually, there is only one: then the same action can be written as an
! element of a 'define_peephole'.  But when there are multiple actions in
! a 'define_insn', they are implicitly enclosed in a 'parallel'.  Then you
! must explicitly write the 'parallel', and the square brackets within it,
! in the 'define_peephole'.  Thus, if an insn pattern looks like this,
  
       (define_insn "divmodsi4"
         [(set (match_operand:SI 0 "general_operand" "=d")
*************** File: gccint.info,  Node: define_peephol
*** 25827,25833 ****
  16.18.2 RTL to RTL Peephole Optimizers
  --------------------------------------
  
! The `define_peephole2' definition tells the compiler how to substitute
  one sequence of instructions for another sequence, what additional
  scratch registers may be needed and what their lifetimes must be.
  
--- 25458,25464 ----
  16.18.2 RTL to RTL Peephole Optimizers
  --------------------------------------
  
! The 'define_peephole2' definition tells the compiler how to substitute
  one sequence of instructions for another sequence, what additional
  scratch registers may be needed and what their lifetimes must be.
  
*************** scratch registers may be needed and what
*** 25841,25847 ****
          ...]
         "PREPARATION-STATEMENTS")
  
!  The definition is almost identical to `define_split' (*note Insn
  Splitting::) except that the pattern to match is not a single
  instruction, but a sequence of instructions.
  
--- 25472,25478 ----
          ...]
         "PREPARATION-STATEMENTS")
  
!  The definition is almost identical to 'define_split' (*note Insn
  Splitting::) except that the pattern to match is not a single
  instruction, but a sequence of instructions.
  
*************** instruction, but a sequence of instructi
*** 25849,25858 ****
  output template.  If appropriate registers are not free, the pattern
  will simply not match.
  
!  Scratch registers are requested with a `match_scratch' pattern at the
  top level of the input pattern.  The allocated register (initially) will
  be dead at the point requested within the original sequence.  If the
! scratch is used at more than a single point, a `match_dup' pattern at
  the top level of the input pattern marks the last position in the input
  sequence at which the register must be available.
  
--- 25480,25489 ----
  output template.  If appropriate registers are not free, the pattern
  will simply not match.
  
!  Scratch registers are requested with a 'match_scratch' pattern at the
  top level of the input pattern.  The allocated register (initially) will
  be dead at the point requested within the original sequence.  If the
! scratch is used at more than a single point, a 'match_dup' pattern at
  the top level of the input pattern marks the last position in the input
  sequence at which the register must be available.
  
*************** sequence at which the register must be a
*** 25874,25880 ****
  
  This pattern tries to split a load from its use in the hopes that we'll
  be able to schedule around the memory load latency.  It allocates a
! single `SImode' register of class `GENERAL_REGS' (`"r"') that needs to
  be live only at the point just before the arithmetic.
  
   A real example requiring extended scratch lifetimes is harder to come
--- 25505,25511 ----
  
  This pattern tries to split a load from its use in the hopes that we'll
  be able to schedule around the memory load latency.  It allocates a
! single 'SImode' register of class 'GENERAL_REGS' ('"r"') that needs to
  be live only at the point just before the arithmetic.
  
   A real example requiring extended scratch lifetimes is harder to come
*************** by, so here's a silly made-up example:
*** 25893,25901 ****
          (set (match_dup 3) (match_dup 4))]
         "")
  
! If we had not added the `(match_dup 4)' in the middle of the input
  sequence, it might have been the case that the register we chose at the
! beginning of the sequence is killed by the first or second `set'.
  
  
  File: gccint.info,  Node: Insn Attributes,  Next: Conditional Execution,  Prev: Peephole Definitions,  Up: Machine Desc
--- 25524,25532 ----
          (set (match_dup 3) (match_dup 4))]
         "")
  
! If we had not added the '(match_dup 4)' in the middle of the input
  sequence, it might have been the case that the register we chose at the
! beginning of the sequence is killed by the first or second 'set'.
  
  
  File: gccint.info,  Node: Insn Attributes,  Next: Conditional Execution,  Prev: Peephole Definitions,  Up: Machine Desc
*************** File: gccint.info,  Node: Insn Attribute
*** 25904,25914 ****
  ============================
  
  In addition to describing the instruction supported by the target
! machine, the `md' file also defines a group of "attributes" and a set of
  values for each.  Every generated insn is assigned a value for each
! attribute.  One possible attribute would be the effect that the insn
! has on the machine's condition code.  This attribute can then be used
! by `NOTICE_UPDATE_CC' to track the condition codes.
  
  * Menu:
  
--- 25535,25545 ----
  ============================
  
  In addition to describing the instruction supported by the target
! machine, the 'md' file also defines a group of "attributes" and a set of
  values for each.  Every generated insn is assigned a value for each
! attribute.  One possible attribute would be the effect that the insn has
! on the machine's condition code.  This attribute can then be used by
! 'NOTICE_UPDATE_CC' to track the condition codes.
  
  * Menu:
  
*************** File: gccint.info,  Node: Defining Attri
*** 25928,26019 ****
  16.19.1 Defining Attributes and their Values
  --------------------------------------------
  
! The `define_attr' expression is used to define each attribute required
  by the target machine.  It looks like:
  
       (define_attr NAME LIST-OF-VALUES DEFAULT)
  
   NAME is a string specifying the name of the attribute being defined.
  Some attributes are used in a special way by the rest of the compiler.
! The `enabled' attribute can be used to conditionally enable or disable
! insn alternatives (*note Disable Insn Alternatives::). The `predicable'
! attribute, together with a suitable `define_cond_exec' (*note
  Conditional Execution::), can be used to automatically generate
! conditional variants of instruction patterns. The `mnemonic' attribute
  can be used to check for the instruction mnemonic (*note Mnemonic
! Attribute::).  The compiler internally uses the names `ce_enabled' and
! `nonce_enabled', so they should not be used elsewhere as alternative
  names.
  
!  LIST-OF-VALUES is either a string that specifies a comma-separated
! list of values that can be assigned to the attribute, or a null string
! to indicate that the attribute takes numeric values.
  
   DEFAULT is an attribute expression that gives the value of this
  attribute for insns that match patterns whose definition does not
! include an explicit value for this attribute.  *Note Attr Example::,
! for more information on the handling of defaults.  *Note Constant
  Attributes::, for information on attributes that do not depend on any
  particular insn.
  
   For each defined attribute, a number of definitions are written to the
! `insn-attr.h' file.  For cases where an explicit set of values is
  specified for an attribute, the following are defined:
  
!    * A `#define' is written for the symbol `HAVE_ATTR_NAME'.
  
!    * An enumerated class is defined for `attr_NAME' with elements of
!      the form `UPPER-NAME_UPPER-VALUE' where the attribute name and
!      value are first converted to uppercase.
  
!    * A function `get_attr_NAME' is defined that is passed an insn and
       returns the attribute value for that insn.
  
!  For example, if the following is present in the `md' file:
  
       (define_attr "type" "branch,fp,load,store,arith" ...)
  
! the following lines will be written to the file `insn-attr.h'.
  
       #define HAVE_ATTR_type 1
       enum attr_type {TYPE_BRANCH, TYPE_FP, TYPE_LOAD,
                        TYPE_STORE, TYPE_ARITH};
       extern enum attr_type get_attr_type ();
  
!  If the attribute takes numeric values, no `enum' type will be defined
! and the function to obtain the attribute's value will return `int'.
  
   There are attributes which are tied to a specific meaning.  These
  attributes are not free to use for other purposes:
  
! `length'
!      The `length' attribute is used to calculate the length of emitted
       code chunks.  This is especially important when verifying branch
!      distances. *Note Insn Lengths::.
  
! `enabled'
!      The `enabled' attribute can be defined to prevent certain
       alternatives of an insn definition from being used during code
!      generation. *Note Disable Insn Alternatives::.
  
! `mnemonic'
!      The `mnemonic' attribute can be defined to implement instruction
!      specific checks in e.g. the pipeline description.  *Note Mnemonic
       Attribute::.
  
   For each of these special attributes, the corresponding
! `HAVE_ATTR_NAME' `#define' is also written when the attribute is not
! defined; in that case, it is defined as `0'.
  
   Another way of defining an attribute is to use:
  
       (define_enum_attr "ATTR" "ENUM" DEFAULT)
  
!  This works in just the same way as `define_attr', except that the list
  of values is taken from a separate enumeration called ENUM (*note
! define_enum::).  This form allows you to use the same list of values
! for several attributes without having to repeat the list each time.
! For example:
  
       (define_enum "processor" [
         model_a
--- 25559,25650 ----
  16.19.1 Defining Attributes and their Values
  --------------------------------------------
  
! The 'define_attr' expression is used to define each attribute required
  by the target machine.  It looks like:
  
       (define_attr NAME LIST-OF-VALUES DEFAULT)
  
   NAME is a string specifying the name of the attribute being defined.
  Some attributes are used in a special way by the rest of the compiler.
! The 'enabled' attribute can be used to conditionally enable or disable
! insn alternatives (*note Disable Insn Alternatives::).  The 'predicable'
! attribute, together with a suitable 'define_cond_exec' (*note
  Conditional Execution::), can be used to automatically generate
! conditional variants of instruction patterns.  The 'mnemonic' attribute
  can be used to check for the instruction mnemonic (*note Mnemonic
! Attribute::).  The compiler internally uses the names 'ce_enabled' and
! 'nonce_enabled', so they should not be used elsewhere as alternative
  names.
  
!  LIST-OF-VALUES is either a string that specifies a comma-separated list
! of values that can be assigned to the attribute, or a null string to
! indicate that the attribute takes numeric values.
  
   DEFAULT is an attribute expression that gives the value of this
  attribute for insns that match patterns whose definition does not
! include an explicit value for this attribute.  *Note Attr Example::, for
! more information on the handling of defaults.  *Note Constant
  Attributes::, for information on attributes that do not depend on any
  particular insn.
  
   For each defined attribute, a number of definitions are written to the
! 'insn-attr.h' file.  For cases where an explicit set of values is
  specified for an attribute, the following are defined:
  
!    * A '#define' is written for the symbol 'HAVE_ATTR_NAME'.
  
!    * An enumerated class is defined for 'attr_NAME' with elements of the
!      form 'UPPER-NAME_UPPER-VALUE' where the attribute name and value
!      are first converted to uppercase.
  
!    * A function 'get_attr_NAME' is defined that is passed an insn and
       returns the attribute value for that insn.
  
!  For example, if the following is present in the 'md' file:
  
       (define_attr "type" "branch,fp,load,store,arith" ...)
  
! the following lines will be written to the file 'insn-attr.h'.
  
       #define HAVE_ATTR_type 1
       enum attr_type {TYPE_BRANCH, TYPE_FP, TYPE_LOAD,
                        TYPE_STORE, TYPE_ARITH};
       extern enum attr_type get_attr_type ();
  
!  If the attribute takes numeric values, no 'enum' type will be defined
! and the function to obtain the attribute's value will return 'int'.
  
   There are attributes which are tied to a specific meaning.  These
  attributes are not free to use for other purposes:
  
! 'length'
!      The 'length' attribute is used to calculate the length of emitted
       code chunks.  This is especially important when verifying branch
!      distances.  *Note Insn Lengths::.
  
! 'enabled'
!      The 'enabled' attribute can be defined to prevent certain
       alternatives of an insn definition from being used during code
!      generation.  *Note Disable Insn Alternatives::.
  
! 'mnemonic'
!      The 'mnemonic' attribute can be defined to implement instruction
!      specific checks in e.g.  the pipeline description.  *Note Mnemonic
       Attribute::.
  
   For each of these special attributes, the corresponding
! 'HAVE_ATTR_NAME' '#define' is also written when the attribute is not
! defined; in that case, it is defined as '0'.
  
   Another way of defining an attribute is to use:
  
       (define_enum_attr "ATTR" "ENUM" DEFAULT)
  
!  This works in just the same way as 'define_attr', except that the list
  of values is taken from a separate enumeration called ENUM (*note
! define_enum::).  This form allows you to use the same list of values for
! several attributes without having to repeat the list each time.  For
! example:
  
       (define_enum "processor" [
         model_a
*************** For example:
*** 26032,26040 ****
       (define_attr "tune" "model_a,model_b,..."
         (const (symbol_ref "target_tune")))
  
!  but without duplicating the processor list.  The second example
! defines two separate C enums (`attr_arch' and `attr_tune') whereas the
! first defines a single C enum (`processor').
  
  
  File: gccint.info,  Node: Expressions,  Next: Tagging Insns,  Prev: Defining Attributes,  Up: Insn Attributes
--- 25663,25671 ----
       (define_attr "tune" "model_a,model_b,..."
         (const (symbol_ref "target_tune")))
  
!  but without duplicating the processor list.  The second example defines
! two separate C enums ('attr_arch' and 'attr_tune') whereas the first
! defines a single C enum ('processor').
  
  
  File: gccint.info,  Node: Expressions,  Next: Tagging Insns,  Prev: Defining Attributes,  Up: Insn Attributes
*************** RTL expressions used to define attribute
*** 26046,26155 ****
  plus a few specific to attribute definitions, to be discussed below.
  Attribute value expressions must have one of the following forms:
  
! `(const_int I)'
       The integer I specifies the value of a numeric attribute.  I must
       be non-negative.
  
       The value of a numeric attribute can be specified either with a
!      `const_int', or as an integer represented as a string in
!      `const_string', `eq_attr' (see below), `attr', `symbol_ref',
!      simple arithmetic expressions, and `set_attr' overrides on
!      specific instructions (*note Tagging Insns::).
  
! `(const_string VALUE)'
!      The string VALUE specifies a constant attribute value.  If VALUE
!      is specified as `"*"', it means that the default value of the
       attribute is to be used for the insn containing this expression.
!      `"*"' obviously cannot be used in the DEFAULT expression of a
!      `define_attr'.
  
       If the attribute whose value is being specified is numeric, VALUE
       must be a string containing a non-negative integer (normally
!      `const_int' would be used in this case).  Otherwise, it must
       contain one of the valid values for the attribute.
  
! `(if_then_else TEST TRUE-VALUE FALSE-VALUE)'
       TEST specifies an attribute test, whose format is defined below.
       The value of this expression is TRUE-VALUE if TEST is true,
       otherwise it is FALSE-VALUE.
  
! `(cond [TEST1 VALUE1 ...] DEFAULT)'
       The first operand of this expression is a vector containing an even
       number of expressions and consisting of pairs of TEST and VALUE
!      expressions.  The value of the `cond' expression is that of the
       VALUE corresponding to the first true TEST expression.  If none of
!      the TEST expressions are true, the value of the `cond' expression
       is that of the DEFAULT expression.
  
   TEST expressions can have one of the following forms:
  
! `(const_int I)'
       This test is true if I is nonzero and false otherwise.
  
! `(not TEST)'
! `(ior TEST1 TEST2)'
! `(and TEST1 TEST2)'
       These tests are true if the indicated logical function is true.
  
! `(match_operand:M N PRED CONSTRAINTS)'
!      This test is true if operand N of the insn whose attribute value
!      is being determined has mode M (this part of the test is ignored
!      if M is `VOIDmode') and the function specified by the string PRED
!      returns a nonzero value when passed operand N and mode M (this
!      part of the test is ignored if PRED is the null string).
  
       The CONSTRAINTS operand is ignored and should be the null string.
  
! `(match_test C-EXPR)'
       The test is true if C expression C-EXPR is true.  In non-constant
       attributes, C-EXPR has access to the following variables:
  
!     INSN
            The rtl instruction under test.
! 
!     WHICH_ALTERNATIVE
!           The `define_insn' alternative that INSN matches.  *Note
!           Output Statement::.
! 
!     OPERANDS
            An array of INSN's rtl operands.
  
!      C-EXPR behaves like the condition in a C `if' statement, so there
!      is no need to explicitly convert the expression into a boolean 0
!      or 1 value.  For example, the following two tests are equivalent:
  
            (match_test "x & 2")
            (match_test "(x & 2) != 0")
  
! `(le ARITH1 ARITH2)'
! `(leu ARITH1 ARITH2)'
! `(lt ARITH1 ARITH2)'
! `(ltu ARITH1 ARITH2)'
! `(gt ARITH1 ARITH2)'
! `(gtu ARITH1 ARITH2)'
! `(ge ARITH1 ARITH2)'
! `(geu ARITH1 ARITH2)'
! `(ne ARITH1 ARITH2)'
! `(eq ARITH1 ARITH2)'
       These tests are true if the indicated comparison of the two
       arithmetic expressions is true.  Arithmetic expressions are formed
!      with `plus', `minus', `mult', `div', `mod', `abs', `neg', `and',
!      `ior', `xor', `not', `ashift', `lshiftrt', and `ashiftrt'
       expressions.
  
!      `const_int' and `symbol_ref' are always valid terms (*note Insn
!      Lengths::,for additional forms).  `symbol_ref' is a string
!      denoting a C expression that yields an `int' when evaluated by the
!      `get_attr_...' routine.  It should normally be a global variable.
  
! `(eq_attr NAME VALUE)'
       NAME is a string specifying the name of an attribute.
  
       VALUE is a string that is either a valid value for attribute NAME,
!      a comma-separated list of values, or `!' followed by a value or
!      list.  If VALUE does not begin with a `!', this test is true if
!      the value of the NAME attribute of the current insn is in the list
!      specified by VALUE.  If VALUE begins with a `!', this test is true
       if the attribute's value is _not_ in the specified list.
  
       For example,
--- 25677,25784 ----
  plus a few specific to attribute definitions, to be discussed below.
  Attribute value expressions must have one of the following forms:
  
! '(const_int I)'
       The integer I specifies the value of a numeric attribute.  I must
       be non-negative.
  
       The value of a numeric attribute can be specified either with a
!      'const_int', or as an integer represented as a string in
!      'const_string', 'eq_attr' (see below), 'attr', 'symbol_ref', simple
!      arithmetic expressions, and 'set_attr' overrides on specific
!      instructions (*note Tagging Insns::).
  
! '(const_string VALUE)'
!      The string VALUE specifies a constant attribute value.  If VALUE is
!      specified as '"*"', it means that the default value of the
       attribute is to be used for the insn containing this expression.
!      '"*"' obviously cannot be used in the DEFAULT expression of a
!      'define_attr'.
  
       If the attribute whose value is being specified is numeric, VALUE
       must be a string containing a non-negative integer (normally
!      'const_int' would be used in this case).  Otherwise, it must
       contain one of the valid values for the attribute.
  
! '(if_then_else TEST TRUE-VALUE FALSE-VALUE)'
       TEST specifies an attribute test, whose format is defined below.
       The value of this expression is TRUE-VALUE if TEST is true,
       otherwise it is FALSE-VALUE.
  
! '(cond [TEST1 VALUE1 ...] DEFAULT)'
       The first operand of this expression is a vector containing an even
       number of expressions and consisting of pairs of TEST and VALUE
!      expressions.  The value of the 'cond' expression is that of the
       VALUE corresponding to the first true TEST expression.  If none of
!      the TEST expressions are true, the value of the 'cond' expression
       is that of the DEFAULT expression.
  
   TEST expressions can have one of the following forms:
  
! '(const_int I)'
       This test is true if I is nonzero and false otherwise.
  
! '(not TEST)'
! '(ior TEST1 TEST2)'
! '(and TEST1 TEST2)'
       These tests are true if the indicated logical function is true.
  
! '(match_operand:M N PRED CONSTRAINTS)'
!      This test is true if operand N of the insn whose attribute value is
!      being determined has mode M (this part of the test is ignored if M
!      is 'VOIDmode') and the function specified by the string PRED
!      returns a nonzero value when passed operand N and mode M (this part
!      of the test is ignored if PRED is the null string).
  
       The CONSTRAINTS operand is ignored and should be the null string.
  
! '(match_test C-EXPR)'
       The test is true if C expression C-EXPR is true.  In non-constant
       attributes, C-EXPR has access to the following variables:
  
!      INSN
            The rtl instruction under test.
!      WHICH_ALTERNATIVE
!           The 'define_insn' alternative that INSN matches.  *Note Output
!           Statement::.
!      OPERANDS
            An array of INSN's rtl operands.
  
!      C-EXPR behaves like the condition in a C 'if' statement, so there
!      is no need to explicitly convert the expression into a boolean 0 or
!      1 value.  For example, the following two tests are equivalent:
  
            (match_test "x & 2")
            (match_test "(x & 2) != 0")
  
! '(le ARITH1 ARITH2)'
! '(leu ARITH1 ARITH2)'
! '(lt ARITH1 ARITH2)'
! '(ltu ARITH1 ARITH2)'
! '(gt ARITH1 ARITH2)'
! '(gtu ARITH1 ARITH2)'
! '(ge ARITH1 ARITH2)'
! '(geu ARITH1 ARITH2)'
! '(ne ARITH1 ARITH2)'
! '(eq ARITH1 ARITH2)'
       These tests are true if the indicated comparison of the two
       arithmetic expressions is true.  Arithmetic expressions are formed
!      with 'plus', 'minus', 'mult', 'div', 'mod', 'abs', 'neg', 'and',
!      'ior', 'xor', 'not', 'ashift', 'lshiftrt', and 'ashiftrt'
       expressions.
  
!      'const_int' and 'symbol_ref' are always valid terms (*note Insn
!      Lengths::,for additional forms).  'symbol_ref' is a string denoting
!      a C expression that yields an 'int' when evaluated by the
!      'get_attr_...' routine.  It should normally be a global variable.
  
! '(eq_attr NAME VALUE)'
       NAME is a string specifying the name of an attribute.
  
       VALUE is a string that is either a valid value for attribute NAME,
!      a comma-separated list of values, or '!' followed by a value or
!      list.  If VALUE does not begin with a '!', this test is true if the
!      value of the NAME attribute of the current insn is in the list
!      specified by VALUE.  If VALUE begins with a '!', this test is true
       if the attribute's value is _not_ in the specified list.
  
       For example,
*************** Attribute value expressions must have on
*** 26160,26167 ****
  
            (ior (eq_attr "type" "load") (eq_attr "type" "store"))
  
!      If NAME specifies an attribute of `alternative', it refers to the
!      value of the compiler variable `which_alternative' (*note Output
       Statement::) and the values must be small integers.  For example,
  
            (eq_attr "alternative" "2,3")
--- 25789,25796 ----
  
            (ior (eq_attr "type" "load") (eq_attr "type" "store"))
  
!      If NAME specifies an attribute of 'alternative', it refers to the
!      value of the compiler variable 'which_alternative' (*note Output
       Statement::) and the values must be small integers.  For example,
  
            (eq_attr "alternative" "2,3")
*************** Attribute value expressions must have on
*** 26171,26192 ****
            (ior (eq (symbol_ref "which_alternative") (const_int 2))
                 (eq (symbol_ref "which_alternative") (const_int 3)))
  
!      Note that, for most attributes, an `eq_attr' test is simplified in
       cases where the value of the attribute being tested is known for
       all insns matching a particular pattern.  This is by far the most
       common case.
  
! `(attr_flag NAME)'
!      The value of an `attr_flag' expression is true if the flag
!      specified by NAME is true for the `insn' currently being scheduled.
  
       NAME is a string specifying one of a fixed set of flags to test.
!      Test the flags `forward' and `backward' to determine the direction
       of a conditional branch.
  
!      This example describes a conditional branch delay slot which can
!      be nullified for forward branches that are taken (annul-true) or
!      for backward branches which are not taken (annul-false).
  
            (define_delay (eq_attr "type" "cbranch")
              [(eq_attr "in_branch_delay" "true")
--- 25800,25821 ----
            (ior (eq (symbol_ref "which_alternative") (const_int 2))
                 (eq (symbol_ref "which_alternative") (const_int 3)))
  
!      Note that, for most attributes, an 'eq_attr' test is simplified in
       cases where the value of the attribute being tested is known for
       all insns matching a particular pattern.  This is by far the most
       common case.
  
! '(attr_flag NAME)'
!      The value of an 'attr_flag' expression is true if the flag
!      specified by NAME is true for the 'insn' currently being scheduled.
  
       NAME is a string specifying one of a fixed set of flags to test.
!      Test the flags 'forward' and 'backward' to determine the direction
       of a conditional branch.
  
!      This example describes a conditional branch delay slot which can be
!      nullified for forward branches that are taken (annul-true) or for
!      backward branches which are not taken (annul-false).
  
            (define_delay (eq_attr "type" "cbranch")
              [(eq_attr "in_branch_delay" "true")
*************** Attribute value expressions must have on
*** 26195,26209 ****
               (and (eq_attr "in_branch_delay" "true")
                    (attr_flag "backward"))])
  
!      The `forward' and `backward' flags are false if the current `insn'
       being scheduled is not a conditional branch.
  
!      `attr_flag' is only used during delay slot scheduling and has no
       meaning to other passes of the compiler.
  
! `(attr NAME)'
       The value of another attribute is returned.  This is most useful
!      for numeric attributes, as `eq_attr' and `attr_flag' produce more
       efficient code for non-numeric attributes.
  
  
--- 25824,25838 ----
               (and (eq_attr "in_branch_delay" "true")
                    (attr_flag "backward"))])
  
!      The 'forward' and 'backward' flags are false if the current 'insn'
       being scheduled is not a conditional branch.
  
!      'attr_flag' is only used during delay slot scheduling and has no
       meaning to other passes of the compiler.
  
! '(attr NAME)'
       The value of another attribute is returned.  This is most useful
!      for numeric attributes, as 'eq_attr' and 'attr_flag' produce more
       efficient code for non-numeric attributes.
  
  
*************** File: gccint.info,  Node: Tagging Insns,
*** 26213,26268 ****
  -------------------------------------------
  
  The value assigned to an attribute of an insn is primarily determined by
! which pattern is matched by that insn (or which `define_peephole'
! generated it).  Every `define_insn' and `define_peephole' can have an
  optional last argument to specify the values of attributes for matching
! insns.  The value of any attribute not specified in a particular insn
! is set to the default value for that attribute, as specified in its
! `define_attr'.  Extensive use of default values for attributes permits
  the specification of the values for only one or two attributes in the
  definition of most insn patterns, as seen in the example in the next
  section.
  
!  The optional last argument of `define_insn' and `define_peephole' is a
  vector of expressions, each of which defines the value for a single
! attribute.  The most general way of assigning an attribute's value is
! to use a `set' expression whose first operand is an `attr' expression
  giving the name of the attribute being set.  The second operand of the
! `set' is an attribute expression (*note Expressions::) giving the value
  of the attribute.
  
!  When the attribute value depends on the `alternative' attribute (i.e.,
  which is the applicable alternative in the constraint of the insn), the
! `set_attr_alternative' expression can be used.  It allows the
  specification of a vector of attribute expressions, one for each
  alternative.
  
   When the generality of arbitrary attribute expressions is not required,
! the simpler `set_attr' expression can be used, which allows specifying
! a string giving either a single attribute value or a list of attribute
  values, one for each alternative.
  
   The form of each of the above specifications is shown below.  In each
  case, NAME is a string specifying the attribute to be set.
  
! `(set_attr NAME VALUE-STRING)'
       VALUE-STRING is either a string giving the desired attribute value,
       or a string containing a comma-separated list giving the values for
       succeeding alternatives.  The number of elements must match the
       number of alternatives in the constraint of the insn pattern.
  
!      Note that it may be useful to specify `*' for some alternative, in
       which case the attribute will assume its default value for insns
       matching that alternative.
  
! `(set_attr_alternative NAME [VALUE1 VALUE2 ...])'
       Depending on the alternative of the insn, the value will be one of
!      the specified values.  This is a shorthand for using a `cond' with
!      tests on the `alternative' attribute.
  
! `(set (attr NAME) VALUE)'
!      The first operand of this `set' must be the special RTL expression
!      `attr', whose sole operand is a string giving the name of the
       attribute being set.  VALUE is the value of the attribute.
  
   The following shows three different ways of representing the same
--- 25842,25897 ----
  -------------------------------------------
  
  The value assigned to an attribute of an insn is primarily determined by
! which pattern is matched by that insn (or which 'define_peephole'
! generated it).  Every 'define_insn' and 'define_peephole' can have an
  optional last argument to specify the values of attributes for matching
! insns.  The value of any attribute not specified in a particular insn is
! set to the default value for that attribute, as specified in its
! 'define_attr'.  Extensive use of default values for attributes permits
  the specification of the values for only one or two attributes in the
  definition of most insn patterns, as seen in the example in the next
  section.
  
!  The optional last argument of 'define_insn' and 'define_peephole' is a
  vector of expressions, each of which defines the value for a single
! attribute.  The most general way of assigning an attribute's value is to
! use a 'set' expression whose first operand is an 'attr' expression
  giving the name of the attribute being set.  The second operand of the
! 'set' is an attribute expression (*note Expressions::) giving the value
  of the attribute.
  
!  When the attribute value depends on the 'alternative' attribute (i.e.,
  which is the applicable alternative in the constraint of the insn), the
! 'set_attr_alternative' expression can be used.  It allows the
  specification of a vector of attribute expressions, one for each
  alternative.
  
   When the generality of arbitrary attribute expressions is not required,
! the simpler 'set_attr' expression can be used, which allows specifying a
! string giving either a single attribute value or a list of attribute
  values, one for each alternative.
  
   The form of each of the above specifications is shown below.  In each
  case, NAME is a string specifying the attribute to be set.
  
! '(set_attr NAME VALUE-STRING)'
       VALUE-STRING is either a string giving the desired attribute value,
       or a string containing a comma-separated list giving the values for
       succeeding alternatives.  The number of elements must match the
       number of alternatives in the constraint of the insn pattern.
  
!      Note that it may be useful to specify '*' for some alternative, in
       which case the attribute will assume its default value for insns
       matching that alternative.
  
! '(set_attr_alternative NAME [VALUE1 VALUE2 ...])'
       Depending on the alternative of the insn, the value will be one of
!      the specified values.  This is a shorthand for using a 'cond' with
!      tests on the 'alternative' attribute.
  
! '(set (attr NAME) VALUE)'
!      The first operand of this 'set' must be the special RTL expression
!      'attr', whose sole operand is a string giving the name of the
       attribute being set.  VALUE is the value of the attribute.
  
   The following shows three different ways of representing the same
*************** attribute value specification:
*** 26279,26303 ****
                   (eq_attr "alternative" "2") (const_string "store")]
                  (const_string "arith")))
  
!  The `define_asm_attributes' expression provides a mechanism to specify
! the attributes assigned to insns produced from an `asm' statement.  It
  has the form:
  
       (define_asm_attributes [ATTR-SETS])
  
! where ATTR-SETS is specified the same as for both the `define_insn' and
! the `define_peephole' expressions.
  
   These values will typically be the "worst case" attribute values.  For
  example, they might indicate that the condition code will be clobbered.
  
!  A specification for a `length' attribute is handled specially.  The
! way to compute the length of an `asm' insn is to multiply the length
! specified in the expression `define_asm_attributes' by the number of
! machine instructions specified in the `asm' statement, determined by
  counting the number of semicolons and newlines in the string.
! Therefore, the value of the `length' attribute specified in a
! `define_asm_attributes' should be the maximum possible length of a
  single machine instruction.
  
  
--- 25908,25932 ----
                   (eq_attr "alternative" "2") (const_string "store")]
                  (const_string "arith")))
  
!  The 'define_asm_attributes' expression provides a mechanism to specify
! the attributes assigned to insns produced from an 'asm' statement.  It
  has the form:
  
       (define_asm_attributes [ATTR-SETS])
  
! where ATTR-SETS is specified the same as for both the 'define_insn' and
! the 'define_peephole' expressions.
  
   These values will typically be the "worst case" attribute values.  For
  example, they might indicate that the condition code will be clobbered.
  
!  A specification for a 'length' attribute is handled specially.  The way
! to compute the length of an 'asm' insn is to multiply the length
! specified in the expression 'define_asm_attributes' by the number of
! machine instructions specified in the 'asm' statement, determined by
  counting the number of semicolons and newlines in the string.
! Therefore, the value of the 'length' attribute specified in a
! 'define_asm_attributes' should be the maximum possible length of a
  single machine instruction.
  
  
*************** File: gccint.info,  Node: Attr Example,
*** 26308,26314 ****
  
  The judicious use of defaulting is important in the efficient use of
  insn attributes.  Typically, insns are divided into "types" and an
! attribute, customarily called `type', is used to represent this value.
  This attribute is normally used only to define the default value for
  other attributes.  An example will clarify this usage.
  
--- 25937,25943 ----
  
  The judicious use of defaulting is important in the efficient use of
  insn attributes.  Typically, insns are divided into "types" and an
! attribute, customarily called 'type', is used to represent this value.
  This attribute is normally used only to define the default value for
  other attributes.  An example will clarify this usage.
  
*************** operations, floating point operations, a
*** 26319,26330 ****
  
   Here we will concern ourselves with determining the effect of an insn
  on the condition code and will limit ourselves to the following possible
! effects:  The condition code can be set unpredictably (clobbered), not
! be changed, be set to agree with the results of the operation, or only
  changed if the item previously set into the condition code has been
  modified.
  
!  Here is part of a sample `md' file for such a machine:
  
       (define_attr "type" "load,store,arith,fp,branch" (const_string "arith"))
  
--- 25948,25959 ----
  
   Here we will concern ourselves with determining the effect of an insn
  on the condition code and will limit ourselves to the following possible
! effects: The condition code can be set unpredictably (clobbered), not be
! changed, be set to agree with the results of the operation, or only
  changed if the item previously set into the condition code has been
  modified.
  
!  Here is part of a sample 'md' file for such a machine:
  
       (define_attr "type" "load,store,arith,fp,branch" (const_string "arith"))
  
*************** File: gccint.info,  Node: Insn Lengths,
*** 26362,26412 ****
  
  For many machines, multiple types of branch instructions are provided,
  each for different length branch displacements.  In most cases, the
! assembler will choose the correct instruction to use.  However, when
! the assembler cannot do so, GCC can when a special attribute, the
! `length' attribute, is defined.  This attribute must be defined to have
! numeric values by specifying a null string in its `define_attr'.
  
!  In the case of the `length' attribute, two additional forms of
  arithmetic terms are allowed in test expressions:
  
! `(match_dup N)'
       This refers to the address of operand N of the current insn, which
!      must be a `label_ref'.
  
! `(pc)'
       For non-branch instructions and backward branch instructions, this
       refers to the address of the current insn.  But for forward branch
       instructions, this refers to the address of the next insn, because
       the length of the current insn is to be computed.
  
   For normal insns, the length will be determined by value of the
! `length' attribute.  In the case of `addr_vec' and `addr_diff_vec' insn
  patterns, the length is computed as the number of vectors multiplied by
  the size of each vector.
  
   Lengths are measured in addressable storage units (bytes).
  
!  Note that it is possible to call functions via the `symbol_ref'
  mechanism to compute the length of an insn.  However, if you use this
  mechanism you must provide dummy clauses to express the maximum length
! without using the function call.  You can an example of this in the
! `pa' machine description for the `call_symref' pattern.
  
   The following macros can be used to refine the length computation:
  
! `ADJUST_INSN_LENGTH (INSN, LENGTH)'
       If defined, modifies the length assigned to instruction INSN as a
       function of the context in which it is used.  LENGTH is an lvalue
       that contains the initially computed length of the insn and should
       be updated with the correct length of the insn.
  
       This macro will normally not be required.  A case in which it is
!      required is the ROMP.  On this machine, the size of an `addr_vec'
       insn must be increased by two to compensate for the fact that
       alignment may be required.
  
!  The routine that returns `get_attr_length' (the value of the `length'
  attribute) can be used by the output routine to determine the form of
  the branch instruction to be written, as the example below illustrates.
  
--- 25991,26041 ----
  
  For many machines, multiple types of branch instructions are provided,
  each for different length branch displacements.  In most cases, the
! assembler will choose the correct instruction to use.  However, when the
! assembler cannot do so, GCC can when a special attribute, the 'length'
! attribute, is defined.  This attribute must be defined to have numeric
! values by specifying a null string in its 'define_attr'.
  
!  In the case of the 'length' attribute, two additional forms of
  arithmetic terms are allowed in test expressions:
  
! '(match_dup N)'
       This refers to the address of operand N of the current insn, which
!      must be a 'label_ref'.
  
! '(pc)'
       For non-branch instructions and backward branch instructions, this
       refers to the address of the current insn.  But for forward branch
       instructions, this refers to the address of the next insn, because
       the length of the current insn is to be computed.
  
   For normal insns, the length will be determined by value of the
! 'length' attribute.  In the case of 'addr_vec' and 'addr_diff_vec' insn
  patterns, the length is computed as the number of vectors multiplied by
  the size of each vector.
  
   Lengths are measured in addressable storage units (bytes).
  
!  Note that it is possible to call functions via the 'symbol_ref'
  mechanism to compute the length of an insn.  However, if you use this
  mechanism you must provide dummy clauses to express the maximum length
! without using the function call.  You can an example of this in the 'pa'
! machine description for the 'call_symref' pattern.
  
   The following macros can be used to refine the length computation:
  
! 'ADJUST_INSN_LENGTH (INSN, LENGTH)'
       If defined, modifies the length assigned to instruction INSN as a
       function of the context in which it is used.  LENGTH is an lvalue
       that contains the initially computed length of the insn and should
       be updated with the correct length of the insn.
  
       This macro will normally not be required.  A case in which it is
!      required is the ROMP.  On this machine, the size of an 'addr_vec'
       insn must be increased by two to compensate for the fact that
       alignment may be required.
  
!  The routine that returns 'get_attr_length' (the value of the 'length'
  attribute) can be used by the output routine to determine the form of
  the branch instruction to be written, as the example below illustrates.
  
*************** the branch instruction to be written, as
*** 26414,26421 ****
  consider the IBM 360.  If we adopt the convention that a register will
  be set to the starting address of a function, we can jump to labels
  within 4k of the start using a four-byte instruction.  Otherwise, we
! need a six-byte sequence to load the address from memory and then
! branch to it.
  
   On such a machine, a pattern for a branch instruction might be
  specified as follows:
--- 26043,26050 ----
  consider the IBM 360.  If we adopt the convention that a register will
  be set to the starting address of a function, we can jump to labels
  within 4k of the start using a four-byte instruction.  Otherwise, we
! need a six-byte sequence to load the address from memory and then branch
! to it.
  
   On such a machine, a pattern for a branch instruction might be
  specified as follows:
*************** File: gccint.info,  Node: Constant Attri
*** 26439,26446 ****
  16.19.6 Constant Attributes
  ---------------------------
  
! A special form of `define_attr', where the expression for the default
! value is a `const' expression, indicates an attribute that is constant
  for a given run of the compiler.  Constant attributes may be used to
  specify which variety of processor is used.  For example,
  
--- 26068,26075 ----
  16.19.6 Constant Attributes
  ---------------------------
  
! A special form of 'define_attr', where the expression for the default
! value is a 'const' expression, indicates an attribute that is constant
  for a given run of the compiler.  Constant attributes may be used to
  specify which variety of processor is used.  For example,
  
*************** specify which variety of processor is us
*** 26458,26466 ****
  
   The routine generated for constant attributes has no parameters as it
  does not depend on any particular insn.  RTL expressions used to define
! the value of a constant attribute may use the `symbol_ref' form, but
! may not use either the `match_operand' form or `eq_attr' forms
! involving insn attributes.
  
  
  File: gccint.info,  Node: Mnemonic Attribute,  Next: Delay Slots,  Prev: Constant Attributes,  Up: Insn Attributes
--- 26087,26095 ----
  
   The routine generated for constant attributes has no parameters as it
  does not depend on any particular insn.  RTL expressions used to define
! the value of a constant attribute may use the 'symbol_ref' form, but may
! not use either the 'match_operand' form or 'eq_attr' forms involving
! insn attributes.
  
  
  File: gccint.info,  Node: Mnemonic Attribute,  Next: Delay Slots,  Prev: Constant Attributes,  Up: Insn Attributes
*************** File: gccint.info,  Node: Mnemonic Attri
*** 26468,26496 ****
  16.19.7 Mnemonic Attribute
  --------------------------
  
! The `mnemonic' attribute is a string type attribute holding the
! instruction mnemonic for an insn alternative.  The attribute values
! will automatically be generated by the machine description parser if
! there is an attribute definition in the md file:
  
       (define_attr "mnemonic" "unknown" (const_string "unknown"))
  
   The default value can be freely chosen as long as it does not collide
! with any of the instruction mnemonics.  This value will be used
! whenever the machine description parser is not able to determine the
! mnemonic string.  This might be the case for output templates
! containing more than a single instruction as in
! `"mvcle\t%0,%1,0\;jo\t.-4"'.
  
!  The `mnemonic' attribute set is not generated automatically if the
  instruction string is generated via C code.
  
!  An existing `mnemonic' attribute set in an insn definition will not be
  overriden by the md file parser.  That way it is possible to manually
  set the instruction mnemonics for the cases where the md file parser
  fails to determine it automatically.
  
!  The `mnemonic' attribute is useful for dealing with instruction
  specific properties in the pipeline description without defining
  additional insn attributes.
  
--- 26097,26124 ----
  16.19.7 Mnemonic Attribute
  --------------------------
  
! The 'mnemonic' attribute is a string type attribute holding the
! instruction mnemonic for an insn alternative.  The attribute values will
! automatically be generated by the machine description parser if there is
! an attribute definition in the md file:
  
       (define_attr "mnemonic" "unknown" (const_string "unknown"))
  
   The default value can be freely chosen as long as it does not collide
! with any of the instruction mnemonics.  This value will be used whenever
! the machine description parser is not able to determine the mnemonic
! string.  This might be the case for output templates containing more
! than a single instruction as in '"mvcle\t%0,%1,0\;jo\t.-4"'.
  
!  The 'mnemonic' attribute set is not generated automatically if the
  instruction string is generated via C code.
  
!  An existing 'mnemonic' attribute set in an insn definition will not be
  overriden by the md file parser.  That way it is possible to manually
  set the instruction mnemonics for the cases where the md file parser
  fails to determine it automatically.
  
!  The 'mnemonic' attribute is useful for dealing with instruction
  specific properties in the pipeline description without defining
  additional insn attributes.
  
*************** File: gccint.info,  Node: Delay Slots,
*** 26508,26522 ****
  The insn attribute mechanism can be used to specify the requirements for
  delay slots, if any, on a target machine.  An instruction is said to
  require a "delay slot" if some instructions that are physically after
! the instruction are executed as if they were located before it.
! Classic examples are branch and call instructions, which often execute
! the following instruction before the branch or call is performed.
  
   On some machines, conditional branch instructions can optionally
! "annul" instructions in the delay slot.  This means that the
! instruction will not be executed for certain branch outcomes.  Both
! instructions that annul if the branch is true and instructions that
! annul if the branch is false are supported.
  
   Delay slot scheduling differs from instruction scheduling in that
  determining whether an instruction needs a delay slot is dependent only
--- 26136,26150 ----
  The insn attribute mechanism can be used to specify the requirements for
  delay slots, if any, on a target machine.  An instruction is said to
  require a "delay slot" if some instructions that are physically after
! the instruction are executed as if they were located before it.  Classic
! examples are branch and call instructions, which often execute the
! following instruction before the branch or call is performed.
  
   On some machines, conditional branch instructions can optionally
! "annul" instructions in the delay slot.  This means that the instruction
! will not be executed for certain branch outcomes.  Both instructions
! that annul if the branch is true and instructions that annul if the
! branch is false are supported.
  
   Delay slot scheduling differs from instruction scheduling in that
  determining whether an instruction needs a delay slot is dependent only
*************** instructions.  See the next section for
*** 26525,26561 ****
  instruction scheduling.
  
   The requirement of an insn needing one or more delay slots is indicated
! via the `define_delay' expression.  It has the following form:
  
       (define_delay TEST
                     [DELAY-1 ANNUL-TRUE-1 ANNUL-FALSE-1
                      DELAY-2 ANNUL-TRUE-2 ANNUL-FALSE-2
                      ...])
  
!  TEST is an attribute test that indicates whether this `define_delay'
! applies to a particular insn.  If so, the number of required delay
! slots is determined by the length of the vector specified as the second
  argument.  An insn placed in delay slot N must satisfy attribute test
  DELAY-N.  ANNUL-TRUE-N is an attribute test that specifies which insns
  may be annulled if the branch is true.  Similarly, ANNUL-FALSE-N
! specifies which insns in the delay slot may be annulled if the branch
! is false.  If annulling is not supported for that delay slot, `(nil)'
  should be coded.
  
   For example, in the common case where branch and call insns require a
  single delay slot, which may contain any insn other than a branch or
! call, the following would be placed in the `md' file:
  
       (define_delay (eq_attr "type" "branch,call")
                     [(eq_attr "type" "!branch,call") (nil) (nil)])
  
!  Multiple `define_delay' expressions may be specified.  In this case,
  each such expression specifies different delay slot requirements and
! there must be no insn for which tests in two `define_delay' expressions
  are both true.
  
   For example, if we have a machine that requires one delay slot for
! branches but two for calls,  no delay slot can contain a branch or call
  insn, and any valid insn in the delay slot for the branch can be
  annulled if the branch is true, we might represent this as follows:
  
--- 26153,26189 ----
  instruction scheduling.
  
   The requirement of an insn needing one or more delay slots is indicated
! via the 'define_delay' expression.  It has the following form:
  
       (define_delay TEST
                     [DELAY-1 ANNUL-TRUE-1 ANNUL-FALSE-1
                      DELAY-2 ANNUL-TRUE-2 ANNUL-FALSE-2
                      ...])
  
!  TEST is an attribute test that indicates whether this 'define_delay'
! applies to a particular insn.  If so, the number of required delay slots
! is determined by the length of the vector specified as the second
  argument.  An insn placed in delay slot N must satisfy attribute test
  DELAY-N.  ANNUL-TRUE-N is an attribute test that specifies which insns
  may be annulled if the branch is true.  Similarly, ANNUL-FALSE-N
! specifies which insns in the delay slot may be annulled if the branch is
! false.  If annulling is not supported for that delay slot, '(nil)'
  should be coded.
  
   For example, in the common case where branch and call insns require a
  single delay slot, which may contain any insn other than a branch or
! call, the following would be placed in the 'md' file:
  
       (define_delay (eq_attr "type" "branch,call")
                     [(eq_attr "type" "!branch,call") (nil) (nil)])
  
!  Multiple 'define_delay' expressions may be specified.  In this case,
  each such expression specifies different delay slot requirements and
! there must be no insn for which tests in two 'define_delay' expressions
  are both true.
  
   For example, if we have a machine that requires one delay slot for
! branches but two for calls, no delay slot can contain a branch or call
  insn, and any valid insn in the delay slot for the branch can be
  annulled if the branch is true, we might represent this as follows:
  
*************** superscalar RISC, and VLIW processors) h
*** 26579,26587 ****
  which several instructions can be executed simultaneously.  An
  instruction starts execution if its issue conditions are satisfied.  If
  not, the instruction is stalled until its conditions are satisfied.
! Such "interlock (pipeline) delay" causes interruption of the fetching
! of successor instructions (or demands nop instructions, e.g. for some
! MIPS processors).
  
   There are two major kinds of interlock delays in modern processors.
  The first one is a data dependence delay determining "instruction
--- 26207,26215 ----
  which several instructions can be executed simultaneously.  An
  instruction starts execution if its issue conditions are satisfied.  If
  not, the instruction is stalled until its conditions are satisfied.
! Such "interlock (pipeline) delay" causes interruption of the fetching of
! successor instructions (or demands nop instructions, e.g. for some MIPS
! processors).
  
   There are two major kinds of interlock delays in modern processors.
  The first one is a data dependence delay determining "instruction
*************** automatically generated from the process
*** 26614,26621 ****
  pipeline hazard recognizer generated from the machine description is
  based on a deterministic finite state automaton (DFA): the instruction
  issue is possible if there is a transition from one automaton state to
! another one.  This algorithm is very fast, and furthermore, its speed
! is not dependent on processor complexity(1).
  
   The rest of this section describes the directives that constitute an
  automaton-based processor pipeline description.  The order of these
--- 26242,26249 ----
  pipeline hazard recognizer generated from the machine description is
  based on a deterministic finite state automaton (DFA): the instruction
  issue is possible if there is a transition from one automaton state to
! another one.  This algorithm is very fast, and furthermore, its speed is
! not dependent on processor complexity(1).
  
   The rest of this section describes the directives that constitute an
  automaton-based processor pipeline description.  The order of these
*************** constructions within the machine descrip
*** 26625,26640 ****
  generated and used for the pipeline hazards recognition.  Sometimes the
  generated finite state automaton used by the pipeline hazard recognizer
  is large.  If we use more than one automaton and bind functional units
! to the automata, the total size of the automata is usually less than
! the size of the single automaton.  If there is no one such
! construction, only one finite state automaton is generated.
  
       (define_automaton AUTOMATA-NAMES)
  
!  AUTOMATA-NAMES is a string giving names of the automata.  The names
! are separated by commas.  All the automata should have unique names.
! The automaton name is used in the constructions `define_cpu_unit' and
! `define_query_cpu_unit'.
  
   Each processor functional unit used in the description of instruction
  reservations should be described by the following construction.
--- 26253,26268 ----
  generated and used for the pipeline hazards recognition.  Sometimes the
  generated finite state automaton used by the pipeline hazard recognizer
  is large.  If we use more than one automaton and bind functional units
! to the automata, the total size of the automata is usually less than the
! size of the single automaton.  If there is no one such construction,
! only one finite state automaton is generated.
  
       (define_automaton AUTOMATA-NAMES)
  
!  AUTOMATA-NAMES is a string giving names of the automata.  The names are
! separated by commas.  All the automata should have unique names.  The
! automaton name is used in the constructions 'define_cpu_unit' and
! 'define_query_cpu_unit'.
  
   Each processor functional unit used in the description of instruction
  reservations should be described by the following construction.
*************** reservations should be described by the
*** 26642,26670 ****
       (define_cpu_unit UNIT-NAMES [AUTOMATON-NAME])
  
   UNIT-NAMES is a string giving the names of the functional units
! separated by commas.  Don't use name `nothing', it is reserved for
! other goals.
  
   AUTOMATON-NAME is a string giving the name of the automaton with which
  the unit is bound.  The automaton should be described in construction
! `define_automaton'.  You should give "automaton-name", if there is a
  defined automaton.
  
   The assignment of units to automata are constrained by the uses of the
! units in insn reservations.  The most important constraint is: if a
! unit reservation is present on a particular cycle of an alternative for
! an insn reservation, then some unit from the same automaton must be
! present on the same cycle for the other alternatives of the insn
! reservation.  The rest of the constraints are mentioned in the
! description of the subsequent constructions.
  
   The following construction describes CPU functional units analogously
! to `define_cpu_unit'.  The reservation of such units can be queried for
! an automaton state.  The instruction scheduler never queries
! reservation of functional units for given automaton state.  So as a
! rule, you don't need this construction.  This construction could be
! used for future code generation goals (e.g. to generate VLIW insn
! templates).
  
       (define_query_cpu_unit UNIT-NAMES [AUTOMATON-NAME])
  
--- 26270,26297 ----
       (define_cpu_unit UNIT-NAMES [AUTOMATON-NAME])
  
   UNIT-NAMES is a string giving the names of the functional units
! separated by commas.  Don't use name 'nothing', it is reserved for other
! goals.
  
   AUTOMATON-NAME is a string giving the name of the automaton with which
  the unit is bound.  The automaton should be described in construction
! 'define_automaton'.  You should give "automaton-name", if there is a
  defined automaton.
  
   The assignment of units to automata are constrained by the uses of the
! units in insn reservations.  The most important constraint is: if a unit
! reservation is present on a particular cycle of an alternative for an
! insn reservation, then some unit from the same automaton must be present
! on the same cycle for the other alternatives of the insn reservation.
! The rest of the constraints are mentioned in the description of the
! subsequent constructions.
  
   The following construction describes CPU functional units analogously
! to 'define_cpu_unit'.  The reservation of such units can be queried for
! an automaton state.  The instruction scheduler never queries reservation
! of functional units for given automaton state.  So as a rule, you don't
! need this construction.  This construction could be used for future code
! generation goals (e.g. to generate VLIW insn templates).
  
       (define_query_cpu_unit UNIT-NAMES [AUTOMATON-NAME])
  
*************** There is an important difference between
*** 26685,26711 ****
  automaton based pipeline description.  The latency time is used for all
  dependencies when we use the old description.  In the automaton based
  pipeline description, the given latency time is only used for true
! dependencies.  The cost of anti-dependencies is always zero and the
! cost of output dependencies is the difference between latency times of
! the producing and consuming insns (if the difference is negative, the
! cost is considered to be zero).  You can always change the default
! costs for any description by using the target hook
! `TARGET_SCHED_ADJUST_COST' (*note Scheduling::).
  
   INSN-NAME is a string giving the internal name of the insn.  The
! internal names are used in constructions `define_bypass' and in the
  automaton description file generated for debugging.  The internal name
! has nothing in common with the names in `define_insn'.  It is a good
  practice to use insn classes described in the processor manual.
  
   CONDITION defines what RTL insns are described by this construction.
  You should remember that you will be in trouble if CONDITION for two or
! more different `define_insn_reservation' constructions is TRUE for an
  insn.  In this case what reservation will be used for the insn is not
  defined.  Such cases are not checked during generation of the pipeline
  hazards recognizer because in general recognizing that two conditions
  may have the same value is quite difficult (especially if the conditions
! contain `symbol_ref').  It is also not checked during the pipeline
  hazard recognizer work because it would slow down the recognizer
  considerably.
  
--- 26312,26338 ----
  automaton based pipeline description.  The latency time is used for all
  dependencies when we use the old description.  In the automaton based
  pipeline description, the given latency time is only used for true
! dependencies.  The cost of anti-dependencies is always zero and the cost
! of output dependencies is the difference between latency times of the
! producing and consuming insns (if the difference is negative, the cost
! is considered to be zero).  You can always change the default costs for
! any description by using the target hook 'TARGET_SCHED_ADJUST_COST'
! (*note Scheduling::).
  
   INSN-NAME is a string giving the internal name of the insn.  The
! internal names are used in constructions 'define_bypass' and in the
  automaton description file generated for debugging.  The internal name
! has nothing in common with the names in 'define_insn'.  It is a good
  practice to use insn classes described in the processor manual.
  
   CONDITION defines what RTL insns are described by this construction.
  You should remember that you will be in trouble if CONDITION for two or
! more different 'define_insn_reservation' constructions is TRUE for an
  insn.  In this case what reservation will be used for the insn is not
  defined.  Such cases are not checked during generation of the pipeline
  hazards recognizer because in general recognizing that two conditions
  may have the same value is quite difficult (especially if the conditions
! contain 'symbol_ref').  It is also not checked during the pipeline
  hazard recognizer work because it would slow down the recognizer
  considerably.
  
*************** expression according to the following sy
*** 26731,26758 ****
                      | "nothing"
                      | "(" regexp ")"
  
!    * `,' is used for describing the start of the next cycle in the
       reservation.
  
!    * `|' is used for describing a reservation described by the first
       regular expression *or* a reservation described by the second
       regular expression *or* etc.
  
!    * `+' is used for describing a reservation described by the first
       regular expression *and* a reservation described by the second
       regular expression *and* etc.
  
!    * `*' is used for convenience and simply means a sequence in which
       the regular expression are repeated NUMBER times with cycle
!      advancing (see `,').
  
!    * `cpu_function_unit_name' denotes reservation of the named
       functional unit.
  
!    * `reservation_name' -- see description of construction
!      `define_reservation'.
  
!    * `nothing' denotes no unit reservations.
  
   Sometimes unit reservations for different insns contain common parts.
  In such case, you can simplify the pipeline description by describing
--- 26358,26385 ----
                      | "nothing"
                      | "(" regexp ")"
  
!    * ',' is used for describing the start of the next cycle in the
       reservation.
  
!    * '|' is used for describing a reservation described by the first
       regular expression *or* a reservation described by the second
       regular expression *or* etc.
  
!    * '+' is used for describing a reservation described by the first
       regular expression *and* a reservation described by the second
       regular expression *and* etc.
  
!    * '*' is used for convenience and simply means a sequence in which
       the regular expression are repeated NUMBER times with cycle
!      advancing (see ',').
  
!    * 'cpu_function_unit_name' denotes reservation of the named
       functional unit.
  
!    * 'reservation_name' -- see description of construction
!      'define_reservation'.
  
!    * 'nothing' denotes no unit reservations.
  
   Sometimes unit reservations for different insns contain common parts.
  In such case, you can simplify the pipeline description by describing
*************** the common part by the following constru
*** 26762,26769 ****
  
   RESERVATION-NAME is a string giving name of REGEXP.  Functional unit
  names and reservation names are in the same name space.  So the
! reservation names should be different from the functional unit names
! and can not be the reserved name `nothing'.
  
   The following construction is used to describe exceptions in the
  latency time for given instruction pair.  This is so called bypasses.
--- 26389,26396 ----
  
   RESERVATION-NAME is a string giving name of REGEXP.  Functional unit
  names and reservation names are in the same name space.  So the
! reservation names should be different from the functional unit names and
! can not be the reserved name 'nothing'.
  
   The following construction is used to describe exceptions in the
  latency time for given instruction pair.  This is so called bypasses.
*************** latency time for given instruction pair.
*** 26772,26796 ****
                      [GUARD])
  
   NUMBER defines when the result generated by the instructions given in
! string OUT_INSN_NAMES will be ready for the instructions given in
! string IN_INSN_NAMES.  Each of these strings is a comma-separated list
! of filename-style globs and they refer to the names of
! `define_insn_reservation's.  For example:
       (define_bypass 1 "cpu1_load_*, cpu1_store_*" "cpu1_load_*")
!  defines a bypass between instructions that start with `cpu1_load_' or
! `cpu1_store_' and those that start with `cpu1_load_'.
  
   GUARD is an optional string giving the name of a C function which
  defines an additional guard for the bypass.  The function will get the
  two insns as parameters.  If the function returns zero the bypass will
  be ignored for this case.  The additional guard is necessary to
  recognize complicated bypasses, e.g. when the consumer is only an
! address of insn `store' (not a stored value).
  
   If there are more one bypass with the same output and input insns, the
  chosen bypass is the first bypass with a guard in description whose
! guard function returns nonzero.  If there is no such bypass, then
! bypass without the guard function is chosen.
  
   The following five constructions are usually used to describe VLIW
  processors, or more precisely, to describe a placement of small
--- 26399,26423 ----
                      [GUARD])
  
   NUMBER defines when the result generated by the instructions given in
! string OUT_INSN_NAMES will be ready for the instructions given in string
! IN_INSN_NAMES.  Each of these strings is a comma-separated list of
! filename-style globs and they refer to the names of
! 'define_insn_reservation's.  For example:
       (define_bypass 1 "cpu1_load_*, cpu1_store_*" "cpu1_load_*")
!  defines a bypass between instructions that start with 'cpu1_load_' or
! 'cpu1_store_' and those that start with 'cpu1_load_'.
  
   GUARD is an optional string giving the name of a C function which
  defines an additional guard for the bypass.  The function will get the
  two insns as parameters.  If the function returns zero the bypass will
  be ignored for this case.  The additional guard is necessary to
  recognize complicated bypasses, e.g. when the consumer is only an
! address of insn 'store' (not a stored value).
  
   If there are more one bypass with the same output and input insns, the
  chosen bypass is the first bypass with a guard in description whose
! guard function returns nonzero.  If there is no such bypass, then bypass
! without the guard function is chosen.
  
   The following five constructions are usually used to describe VLIW
  processors, or more precisely, to describe a placement of small
*************** commas.
*** 26810,26816 ****
  comma.  Currently pattern is one unit or units separated by
  white-spaces.
  
!  The first construction (`exclusion_set') means that each functional
  unit in the first string can not be reserved simultaneously with a unit
  whose name is in the second string and vice versa.  For example, the
  construction is useful for describing processors (e.g. some SPARC
--- 26437,26443 ----
  comma.  Currently pattern is one unit or units separated by
  white-spaces.
  
!  The first construction ('exclusion_set') means that each functional
  unit in the first string can not be reserved simultaneously with a unit
  whose name is in the second string and vice versa.  For example, the
  construction is useful for describing processors (e.g. some SPARC
*************** processors) with a fully pipelined float
*** 26818,26877 ****
  can execute simultaneously only single floating point insns or only
  double floating point insns.
  
!  The second construction (`presence_set') means that each functional
  unit in the first string can not be reserved unless at least one of
! pattern of units whose names are in the second string is reserved.
! This is an asymmetric relation.  For example, it is useful for
! description that VLIW `slot1' is reserved after `slot0' reservation.
! We could describe it by the following construction
  
       (presence_set "slot1" "slot0")
  
!  Or `slot1' is reserved only after `slot0' and unit `b0' reservation.
  In this case we could write
  
       (presence_set "slot1" "slot0 b0")
  
!  The third construction (`final_presence_set') is analogous to
! `presence_set'.  The difference between them is when checking is done.
  When an instruction is issued in given automaton state reflecting all
  current and planned unit reservations, the automaton state is changed.
  The first state is a source state, the second one is a result state.
! Checking for `presence_set' is done on the source state reservation,
! checking for `final_presence_set' is done on the result reservation.
  This construction is useful to describe a reservation which is actually
  two subsequent reservations.  For example, if we use
  
       (presence_set "slot1" "slot0")
  
!  the following insn will be never issued (because `slot1' requires
! `slot0' which is absent in the source state).
  
       (define_reservation "insn_and_nop" "slot0 + slot1")
  
!  but it can be issued if we use analogous `final_presence_set'.
  
!  The forth construction (`absence_set') means that each functional unit
  in the first string can be reserved only if each pattern of units whose
  names are in the second string is not reserved.  This is an asymmetric
! relation (actually `exclusion_set' is analogous to this one but it is
! symmetric).  For example it might be useful in a VLIW description to
! say that `slot0' cannot be reserved after either `slot1' or `slot2'
! have been reserved.  This can be described as:
  
       (absence_set "slot0" "slot1, slot2")
  
!  Or `slot2' can not be reserved if `slot0' and unit `b0' are reserved
! or `slot1' and unit `b1' are reserved.  In this case we could write
  
       (absence_set "slot2" "slot0 b0, slot1 b1")
  
   All functional units mentioned in a set should belong to the same
  automaton.
  
!  The last construction (`final_absence_set') is analogous to
! `absence_set' but checking is done on the result (state) reservation.
! See comments for `final_presence_set'.
  
   You can control the generator of the pipeline hazard recognizer with
  the following construction.
--- 26445,26504 ----
  can execute simultaneously only single floating point insns or only
  double floating point insns.
  
!  The second construction ('presence_set') means that each functional
  unit in the first string can not be reserved unless at least one of
! pattern of units whose names are in the second string is reserved.  This
! is an asymmetric relation.  For example, it is useful for description
! that VLIW 'slot1' is reserved after 'slot0' reservation.  We could
! describe it by the following construction
  
       (presence_set "slot1" "slot0")
  
!  Or 'slot1' is reserved only after 'slot0' and unit 'b0' reservation.
  In this case we could write
  
       (presence_set "slot1" "slot0 b0")
  
!  The third construction ('final_presence_set') is analogous to
! 'presence_set'.  The difference between them is when checking is done.
  When an instruction is issued in given automaton state reflecting all
  current and planned unit reservations, the automaton state is changed.
  The first state is a source state, the second one is a result state.
! Checking for 'presence_set' is done on the source state reservation,
! checking for 'final_presence_set' is done on the result reservation.
  This construction is useful to describe a reservation which is actually
  two subsequent reservations.  For example, if we use
  
       (presence_set "slot1" "slot0")
  
!  the following insn will be never issued (because 'slot1' requires
! 'slot0' which is absent in the source state).
  
       (define_reservation "insn_and_nop" "slot0 + slot1")
  
!  but it can be issued if we use analogous 'final_presence_set'.
  
!  The forth construction ('absence_set') means that each functional unit
  in the first string can be reserved only if each pattern of units whose
  names are in the second string is not reserved.  This is an asymmetric
! relation (actually 'exclusion_set' is analogous to this one but it is
! symmetric).  For example it might be useful in a VLIW description to say
! that 'slot0' cannot be reserved after either 'slot1' or 'slot2' have
! been reserved.  This can be described as:
  
       (absence_set "slot0" "slot1, slot2")
  
!  Or 'slot2' can not be reserved if 'slot0' and unit 'b0' are reserved or
! 'slot1' and unit 'b1' are reserved.  In this case we could write
  
       (absence_set "slot2" "slot0 b0, slot1 b1")
  
   All functional units mentioned in a set should belong to the same
  automaton.
  
!  The last construction ('final_absence_set') is analogous to
! 'absence_set' but checking is done on the result (state) reservation.
! See comments for 'final_presence_set'.
  
   You can control the generator of the pipeline hazard recognizer with
  the following construction.
*************** Currently there are the following option
*** 26888,26925 ****
     * "time" means printing time statistics about the generation of
       automata.
  
!    * "stats" means printing statistics about the generated automata
!      such as the number of DFA states, NDFA states and arcs.
  
     * "v" means a generation of the file describing the result automata.
!      The file has suffix `.dfa' and can be used for the description
       verification and debugging.
  
!    * "w" means a generation of warning instead of error for
!      non-critical errors.
  
!    * "no-comb-vect" prevents the automaton generator from generating
!      two data structures and comparing them for space efficiency.  Using
!      a comb vector to represent transitions may be better, but it can be
       very expensive to construct.  This option is useful if the build
       process spends an unacceptably long time in genautomata.
  
     * "ndfa" makes nondeterministic finite state automata.  This affects
!      the treatment of operator `|' in the regular expressions.  The
       usual treatment of the operator is to try the first alternative
       and, if the reservation is not possible, the second alternative.
       The nondeterministic treatment means trying all alternatives, some
       of them may be rejected by reservations in the subsequent insns.
  
     * "collapse-ndfa" modifies the behaviour of the generator when
!      producing an automaton.  An additional state transition to
!      collapse a nondeterministic NDFA state to a deterministic DFA
!      state is generated.  It can be triggered by passing `const0_rtx' to
       state_transition.  In such an automaton, cycle advance transitions
       are available only for these collapsed states.  This option is
!      useful for ports that want to use the `ndfa' option, but also want
!      to use `define_query_cpu_unit' to assign units to insns issued in
!      a cycle.
  
     * "progress" means output of a progress bar showing how many states
       were generated so far for automaton being processed.  This is
--- 26515,26552 ----
     * "time" means printing time statistics about the generation of
       automata.
  
!    * "stats" means printing statistics about the generated automata such
!      as the number of DFA states, NDFA states and arcs.
  
     * "v" means a generation of the file describing the result automata.
!      The file has suffix '.dfa' and can be used for the description
       verification and debugging.
  
!    * "w" means a generation of warning instead of error for non-critical
!      errors.
  
!    * "no-comb-vect" prevents the automaton generator from generating two
!      data structures and comparing them for space efficiency.  Using a
!      comb vector to represent transitions may be better, but it can be
       very expensive to construct.  This option is useful if the build
       process spends an unacceptably long time in genautomata.
  
     * "ndfa" makes nondeterministic finite state automata.  This affects
!      the treatment of operator '|' in the regular expressions.  The
       usual treatment of the operator is to try the first alternative
       and, if the reservation is not possible, the second alternative.
       The nondeterministic treatment means trying all alternatives, some
       of them may be rejected by reservations in the subsequent insns.
  
     * "collapse-ndfa" modifies the behaviour of the generator when
!      producing an automaton.  An additional state transition to collapse
!      a nondeterministic NDFA state to a deterministic DFA state is
!      generated.  It can be triggered by passing 'const0_rtx' to
       state_transition.  In such an automaton, cycle advance transitions
       are available only for these collapsed states.  This option is
!      useful for ports that want to use the 'ndfa' option, but also want
!      to use 'define_query_cpu_unit' to assign units to insns issued in a
!      cycle.
  
     * "progress" means output of a progress bar showing how many states
       were generated so far for automaton being processed.  This is
*************** Currently there are the following option
*** 26929,26936 ****
       the huge automaton.
  
   As an example, consider a superscalar RISC machine which can issue
! three insns (two integer insns and one floating point insn) on the
! cycle but can finish only two insns.  To describe this, we define the
  following functional units.
  
       (define_cpu_unit "i0_pipeline, i1_pipeline, f_pipeline")
--- 26556,26563 ----
       the huge automaton.
  
   As an example, consider a superscalar RISC machine which can issue
! three insns (two integer insns and one floating point insn) on the cycle
! but can finish only two insns.  To describe this, we define the
  following functional units.
  
       (define_cpu_unit "i0_pipeline, i1_pipeline, f_pipeline")
*************** following functional units.
*** 26938,26953 ****
  
   All simple integer insns can be executed in any integer pipeline and
  their result is ready in two cycles.  The simple integer insns are
! issued into the first pipeline unless it is reserved, otherwise they
! are issued into the second pipeline.  Integer division and
! multiplication insns can be executed only in the second integer
! pipeline and their results are ready correspondingly in 8 and 4 cycles.
! The integer division is not pipelined, i.e. the subsequent integer
! division insn can not be issued until the current division insn
! finished.  Floating point insns are fully pipelined and their results
! are ready in 3 cycles.  Where the result of a floating point insn is
! used by an integer insn, an additional delay of one cycle is incurred.
! To describe all of this we could specify
  
       (define_cpu_unit "div")
  
--- 26565,26580 ----
  
   All simple integer insns can be executed in any integer pipeline and
  their result is ready in two cycles.  The simple integer insns are
! issued into the first pipeline unless it is reserved, otherwise they are
! issued into the second pipeline.  Integer division and multiplication
! insns can be executed only in the second integer pipeline and their
! results are ready correspondingly in 8 and 4 cycles.  The integer
! division is not pipelined, i.e. the subsequent integer division insn can
! not be issued until the current division insn finished.  Floating point
! insns are fully pipelined and their results are ready in 3 cycles.
! Where the result of a floating point insn is used by an integer insn, an
! additional delay of one cycle is incurred.  To describe all of this we
! could specify
  
       (define_cpu_unit "div")
  
*************** To describe all of this we could specify
*** 26969,26987 ****
  
       (define_reservation "finish" "port0|port1")
  
!  and use it in all `define_insn_reservation' as in the following
  construction
  
       (define_insn_reservation "simple" 2 (eq_attr "type" "int")
                                "(i0_pipeline | i1_pipeline), finish")
  
!  ---------- Footnotes ----------
  
!  (1) However, the size of the automaton depends on processor
  complexity.  To limit this effect, machine descriptions can split
  orthogonal parts of the machine description among several automata: but
! then, since each of these must be stepped independently, this does
! cause a small decrease in the algorithm's performance.
  
  
  File: gccint.info,  Node: Conditional Execution,  Next: Define Subst,  Prev: Insn Attributes,  Up: Machine Desc
--- 26596,26614 ----
  
       (define_reservation "finish" "port0|port1")
  
!  and use it in all 'define_insn_reservation' as in the following
  construction
  
       (define_insn_reservation "simple" 2 (eq_attr "type" "int")
                                "(i0_pipeline | i1_pipeline), finish")
  
!    ---------- Footnotes ----------
  
!    (1) However, the size of the automaton depends on processor
  complexity.  To limit this effect, machine descriptions can split
  orthogonal parts of the machine description among several automata: but
! then, since each of these must be stepped independently, this does cause
! a small decrease in the algorithm's performance.
  
  
  File: gccint.info,  Node: Conditional Execution,  Next: Define Subst,  Prev: Insn Attributes,  Up: Machine Desc
*************** A number of architectures provide for so
*** 26993,27000 ****
  execution, or predication.  The hallmark of this feature is the ability
  to nullify most of the instructions in the instruction set.  When the
  instruction set is large and not entirely symmetric, it can be quite
! tedious to describe these forms directly in the `.md' file.  An
! alternative is the `define_cond_exec' template.
  
       (define_cond_exec
         [PREDICATE-PATTERN]
--- 26620,26627 ----
  execution, or predication.  The hallmark of this feature is the ability
  to nullify most of the instructions in the instruction set.  When the
  instruction set is large and not entirely symmetric, it can be quite
! tedious to describe these forms directly in the '.md' file.  An
! alternative is the 'define_cond_exec' template.
  
       (define_cond_exec
         [PREDICATE-PATTERN]
*************** alternative is the `define_cond_exec' te
*** 27002,27043 ****
         "OUTPUT-TEMPLATE"
         "OPTIONAL-INSN-ATTRIBUES")
  
!  PREDICATE-PATTERN is the condition that must be true for the insn to
! be executed at runtime and should match a relational operator.  One can
! use `match_operator' to match several relational operators at once.
! Any `match_operand' operands must have no more than one alternative.
  
!  CONDITION is a C expression that must be true for the generated
! pattern to match.
  
!  OUTPUT-TEMPLATE is a string similar to the `define_insn' output
! template (*note Output Template::), except that the `*' and `@' special
  cases do not apply.  This is only useful if the assembly text for the
  predicate is a simple prefix to the main insn.  In order to handle the
! general case, there is a global variable `current_insn_predicate' that
! will contain the entire predicate if the current insn is predicated,
! and will otherwise be `NULL'.
  
   OPTIONAL-INSN-ATTRIBUTES is an optional vector of attributes that gets
! appended to the insn attributes of the produced cond_exec rtx. It can
  be used to add some distinguishing attribute to cond_exec rtxs produced
! that way. An example usage would be to use this attribute in conjunction
! with attributes on the main pattern to disable particular alternatives
! under certain conditions.
  
!  When `define_cond_exec' is used, an implicit reference to the
! `predicable' instruction attribute is made.  *Note Insn Attributes::.
  This attribute must be a boolean (i.e. have exactly two elements in its
! LIST-OF-VALUES), with the possible values being `no' and `yes'.  The
  default and all uses in the insns must be a simple constant, not a
  complex expressions.  It may, however, depend on the alternative, by
  using a comma-separated list of values.  If that is the case, the port
! should also define an `enabled' attribute (*note Disable Insn
! Alternatives::), which should also allow only `no' and `yes' as its
  values.
  
!  For each `define_insn' for which the `predicable' attribute is true, a
! new `define_insn' pattern will be generated that matches a predicated
  version of the instruction.  For example,
  
       (define_insn "addsi"
--- 26629,26670 ----
         "OUTPUT-TEMPLATE"
         "OPTIONAL-INSN-ATTRIBUES")
  
!  PREDICATE-PATTERN is the condition that must be true for the insn to be
! executed at runtime and should match a relational operator.  One can use
! 'match_operator' to match several relational operators at once.  Any
! 'match_operand' operands must have no more than one alternative.
  
!  CONDITION is a C expression that must be true for the generated pattern
! to match.
  
!  OUTPUT-TEMPLATE is a string similar to the 'define_insn' output
! template (*note Output Template::), except that the '*' and '@' special
  cases do not apply.  This is only useful if the assembly text for the
  predicate is a simple prefix to the main insn.  In order to handle the
! general case, there is a global variable 'current_insn_predicate' that
! will contain the entire predicate if the current insn is predicated, and
! will otherwise be 'NULL'.
  
   OPTIONAL-INSN-ATTRIBUTES is an optional vector of attributes that gets
! appended to the insn attributes of the produced cond_exec rtx.  It can
  be used to add some distinguishing attribute to cond_exec rtxs produced
! that way.  An example usage would be to use this attribute in
! conjunction with attributes on the main pattern to disable particular
! alternatives under certain conditions.
  
!  When 'define_cond_exec' is used, an implicit reference to the
! 'predicable' instruction attribute is made.  *Note Insn Attributes::.
  This attribute must be a boolean (i.e. have exactly two elements in its
! LIST-OF-VALUES), with the possible values being 'no' and 'yes'.  The
  default and all uses in the insns must be a simple constant, not a
  complex expressions.  It may, however, depend on the alternative, by
  using a comma-separated list of values.  If that is the case, the port
! should also define an 'enabled' attribute (*note Disable Insn
! Alternatives::), which should also allow only 'no' and 'yes' as its
  values.
  
!  For each 'define_insn' for which the 'predicable' attribute is true, a
! new 'define_insn' pattern will be generated that matches a predicated
  version of the instruction.  For example,
  
       (define_insn "addsi"
*************** File: gccint.info,  Node: Define Subst,
*** 27072,27082 ****
  
  For some hardware architectures there are common cases when the RTL
  templates for the instructions can be derived from the other RTL
! templates using simple transformations.  E.g., `i386.md' contains an
! RTL template for the ordinary `sub' instruction-- `*subsi_1', and for
! the `sub' instruction with subsequent zero-extension--`*subsi_1_zext'.
! Such cases can be easily implemented by a single meta-template capable
! of generating a modified case based on the initial one:
  
       (define_subst "NAME"
         [INPUT-TEMPLATE]
--- 26699,26709 ----
  
  For some hardware architectures there are common cases when the RTL
  templates for the instructions can be derived from the other RTL
! templates using simple transformations.  E.g., 'i386.md' contains an RTL
! template for the ordinary 'sub' instruction-- '*subsi_1', and for the
! 'sub' instruction with subsequent zero-extension--'*subsi_1_zext'.  Such
! cases can be easily implemented by a single meta-template capable of
! generating a modified case based on the initial one:
  
       (define_subst "NAME"
         [INPUT-TEMPLATE]
*************** output-template.
*** 27092,27129 ****
   OUTPUT-TEMPLATE is a pattern that will be used in the resulting
  template.
  
!  `define_subst' mechanism is tightly coupled with the notion of the
! subst attribute (*note Subst Iterators::).  The use of `define_subst'
! is triggered by a reference to a subst attribute in the transforming
! RTL template.  This reference initiates duplication of the source RTL
  template and substitution of the attributes with their values.  The
  source RTL template is left unchanged, while the copy is transformed by
! `define_subst'.  This transformation can fail in the case when the
  source RTL template is not matched against the input-template of the
! `define_subst'.  In such case the copy is deleted.
  
!  `define_subst' can be used only in `define_insn' and `define_expand',
! it cannot be used in other expressions (e.g. in
! `define_insn_and_split').
  
  * Menu:
  
! * Define Subst Example::	    Example of `define_subst' work.
  * Define Subst Pattern Matching::   Process of template comparison.
  * Define Subst Output Template::    Generation of output template.
  
  
  File: gccint.info,  Node: Define Subst Example,  Next: Define Subst Pattern Matching,  Up: Define Subst
  
! 16.21.1 `define_subst' Example
  ------------------------------
  
! To illustrate how `define_subst' works, let us examine a simple
! template transformation.
  
   Suppose there are two kinds of instructions: one that touches flags and
  the other that does not.  The instructions of the second type could be
! generated with the following `define_subst':
  
       (define_subst "add_clobber_subst"
         [(set (match_operand:SI 0 "" "")
--- 26719,26756 ----
   OUTPUT-TEMPLATE is a pattern that will be used in the resulting
  template.
  
!  'define_subst' mechanism is tightly coupled with the notion of the
! subst attribute (*note Subst Iterators::).  The use of 'define_subst' is
! triggered by a reference to a subst attribute in the transforming RTL
! template.  This reference initiates duplication of the source RTL
  template and substitution of the attributes with their values.  The
  source RTL template is left unchanged, while the copy is transformed by
! 'define_subst'.  This transformation can fail in the case when the
  source RTL template is not matched against the input-template of the
! 'define_subst'.  In such case the copy is deleted.
  
!  'define_subst' can be used only in 'define_insn' and 'define_expand',
! it cannot be used in other expressions (e.g.  in
! 'define_insn_and_split').
  
  * Menu:
  
! * Define Subst Example::	    Example of 'define_subst' work.
  * Define Subst Pattern Matching::   Process of template comparison.
  * Define Subst Output Template::    Generation of output template.
  
  
  File: gccint.info,  Node: Define Subst Example,  Next: Define Subst Pattern Matching,  Up: Define Subst
  
! 16.21.1 'define_subst' Example
  ------------------------------
  
! To illustrate how 'define_subst' works, let us examine a simple template
! transformation.
  
   Suppose there are two kinds of instructions: one that touches flags and
  the other that does not.  The instructions of the second type could be
! generated with the following 'define_subst':
  
       (define_subst "add_clobber_subst"
         [(set (match_operand:SI 0 "" "")
*************** generated with the following `define_sub
*** 27133,27143 ****
               (match_dup 1))
          (clobber (reg:CC FLAGS_REG))]
  
!  This `define_subst' can be applied to any RTL pattern containing `set'
  of mode SI and generates a copy with clobber when it is applied.
  
!  Assume there is an RTL template for a `max' instruction to be used in
! `define_subst' mentioned above:
  
       (define_insn "maxsi"
         [(set (match_operand:SI 0 "register_operand" "=r")
--- 26760,26770 ----
               (match_dup 1))
          (clobber (reg:CC FLAGS_REG))]
  
!  This 'define_subst' can be applied to any RTL pattern containing 'set'
  of mode SI and generates a copy with clobber when it is applied.
  
!  Assume there is an RTL template for a 'max' instruction to be used in
! 'define_subst' mentioned above:
  
       (define_insn "maxsi"
         [(set (match_operand:SI 0 "register_operand" "=r")
*************** of mode SI and generates a copy with clo
*** 27148,27167 ****
         "max\t{%2, %1, %0|%0, %1, %2}"
        [...])
  
!  To mark the RTL template for `define_subst' application,
  subst-attributes are used.  They should be declared in advance:
  
       (define_subst_attr "add_clobber_name" "add_clobber_subst" "_noclobber" "_clobber")
  
!  Here `add_clobber_name' is the attribute name, `add_clobber_subst' is
! the name of the corresponding `define_subst', the third argument
! (`_noclobber') is the attribute value that would be substituted into
! the unchanged version of the source RTL template, and the last argument
! (`_clobber') is the value that would be substituted into the second,
  transformed, version of the RTL template.
  
   Once the subst-attribute has been defined, it should be used in RTL
! templates which need to be processed by the `define_subst'.  So, the
  original RTL template should be changed:
  
       (define_insn "maxsi<add_clobber_name>"
--- 26775,26794 ----
         "max\t{%2, %1, %0|%0, %1, %2}"
        [...])
  
!  To mark the RTL template for 'define_subst' application,
  subst-attributes are used.  They should be declared in advance:
  
       (define_subst_attr "add_clobber_name" "add_clobber_subst" "_noclobber" "_clobber")
  
!  Here 'add_clobber_name' is the attribute name, 'add_clobber_subst' is
! the name of the corresponding 'define_subst', the third argument
! ('_noclobber') is the attribute value that would be substituted into the
! unchanged version of the source RTL template, and the last argument
! ('_clobber') is the value that would be substituted into the second,
  transformed, version of the RTL template.
  
   Once the subst-attribute has been defined, it should be used in RTL
! templates which need to be processed by the 'define_subst'.  So, the
  original RTL template should be changed:
  
       (define_insn "maxsi<add_clobber_name>"
*************** original RTL template should be changed:
*** 27173,27179 ****
         "max\t{%2, %1, %0|%0, %1, %2}"
        [...])
  
!  The result of the `define_subst' usage would look like the following:
  
       (define_insn "maxsi_noclobber"
         [(set (match_operand:SI 0 "register_operand" "=r")
--- 26800,26806 ----
         "max\t{%2, %1, %0|%0, %1, %2}"
        [...])
  
!  The result of the 'define_subst' usage would look like the following:
  
       (define_insn "maxsi_noclobber"
         [(set (match_operand:SI 0 "register_operand" "=r")
*************** original RTL template should be changed:
*** 27196,27262 ****
  
  File: gccint.info,  Node: Define Subst Pattern Matching,  Next: Define Subst Output Template,  Prev: Define Subst Example,  Up: Define Subst
  
! 16.21.2 Pattern Matching in `define_subst'
  ------------------------------------------
  
! All expressions, allowed in `define_insn' or `define_expand', are
! allowed in the input-template of `define_subst', except
! `match_par_dup', `match_scratch', `match_parallel'. The meanings of
! expressions in the input-template were changed:
  
!  `match_operand' matches any expression (possibly, a subtree in
! RTL-template), if modes of the `match_operand' and this expression are
! the same, or mode of the `match_operand' is `VOIDmode', or this
! expression is `match_dup', `match_op_dup'.  If the expression is
! `match_operand' too, and predicate of `match_operand' from the input
  pattern is not empty, then the predicates are compared.  That can be
  used for more accurate filtering of accepted RTL-templates.
  
!  `match_operator' matches common operators (like `plus', `minus'),
! `unspec', `unspec_volatile' operators and `match_operator's from the
! original pattern if the modes match and `match_operator' from the input
  pattern has the same number of operands as the operator from the
  original pattern.
  
  
  File: gccint.info,  Node: Define Subst Output Template,  Prev: Define Subst Pattern Matching,  Up: Define Subst
  
! 16.21.3 Generation of output template in `define_subst'
  -------------------------------------------------------
  
! If all necessary checks for `define_subst' application pass, a new
  RTL-pattern, based on the output-template, is created to replace the old
  template.  Like in input-patterns, meanings of some RTL expressions are
! changed when they are used in output-patterns of a `define_subst'.
! Thus, `match_dup' is used for copying the whole expression from the
! original pattern, which matched corresponding `match_operand' from the
  input pattern.
  
!  `match_dup N' is used in the output template to be replaced with the
! expression from the original pattern, which matched `match_operand N'
! from the input pattern.  As a consequence, `match_dup' cannot be used
! to point to `match_operand's from the output pattern, it should always
! refer to a `match_operand' from the input pattern.
  
   In the output template one can refer to the expressions from the
  original pattern and create new ones.  For instance, some operands could
! be added by means of standard `match_operand'.
  
!  After replacing `match_dup' with some RTL-subtree from the original
! pattern, it could happen that several `match_operand's in the output
! pattern have the same indexes.  It is unknown, how many and what
! indexes would be used in the expression which would replace
! `match_dup', so such conflicts in indexes are inevitable.  To overcome
! this issue, `match_operands' and `match_operators', which were
! introduced into the output pattern, are renumerated when all
! `match_dup's are replaced.
  
!  Number of alternatives in `match_operand's introduced into the output
! template `M' could differ from the number of alternatives in the
! original pattern `N', so in the resultant pattern there would be `N*M'
  alternatives.  Thus, constraints from the original pattern would be
! duplicated `N' times, constraints from the output pattern would be
! duplicated `M' times, producing all possible combinations.
  
  
  File: gccint.info,  Node: Constant Definitions,  Next: Iterators,  Prev: Define Subst,  Up: Machine Desc
--- 26823,26888 ----
  
  File: gccint.info,  Node: Define Subst Pattern Matching,  Next: Define Subst Output Template,  Prev: Define Subst Example,  Up: Define Subst
  
! 16.21.2 Pattern Matching in 'define_subst'
  ------------------------------------------
  
! All expressions, allowed in 'define_insn' or 'define_expand', are
! allowed in the input-template of 'define_subst', except 'match_par_dup',
! 'match_scratch', 'match_parallel'.  The meanings of expressions in the
! input-template were changed:
  
!  'match_operand' matches any expression (possibly, a subtree in
! RTL-template), if modes of the 'match_operand' and this expression are
! the same, or mode of the 'match_operand' is 'VOIDmode', or this
! expression is 'match_dup', 'match_op_dup'.  If the expression is
! 'match_operand' too, and predicate of 'match_operand' from the input
  pattern is not empty, then the predicates are compared.  That can be
  used for more accurate filtering of accepted RTL-templates.
  
!  'match_operator' matches common operators (like 'plus', 'minus'),
! 'unspec', 'unspec_volatile' operators and 'match_operator's from the
! original pattern if the modes match and 'match_operator' from the input
  pattern has the same number of operands as the operator from the
  original pattern.
  
  
  File: gccint.info,  Node: Define Subst Output Template,  Prev: Define Subst Pattern Matching,  Up: Define Subst
  
! 16.21.3 Generation of output template in 'define_subst'
  -------------------------------------------------------
  
! If all necessary checks for 'define_subst' application pass, a new
  RTL-pattern, based on the output-template, is created to replace the old
  template.  Like in input-patterns, meanings of some RTL expressions are
! changed when they are used in output-patterns of a 'define_subst'.
! Thus, 'match_dup' is used for copying the whole expression from the
! original pattern, which matched corresponding 'match_operand' from the
  input pattern.
  
!  'match_dup N' is used in the output template to be replaced with the
! expression from the original pattern, which matched 'match_operand N'
! from the input pattern.  As a consequence, 'match_dup' cannot be used to
! point to 'match_operand's from the output pattern, it should always
! refer to a 'match_operand' from the input pattern.
  
   In the output template one can refer to the expressions from the
  original pattern and create new ones.  For instance, some operands could
! be added by means of standard 'match_operand'.
  
!  After replacing 'match_dup' with some RTL-subtree from the original
! pattern, it could happen that several 'match_operand's in the output
! pattern have the same indexes.  It is unknown, how many and what indexes
! would be used in the expression which would replace 'match_dup', so such
! conflicts in indexes are inevitable.  To overcome this issue,
! 'match_operands' and 'match_operators', which were introduced into the
! output pattern, are renumerated when all 'match_dup's are replaced.
  
!  Number of alternatives in 'match_operand's introduced into the output
! template 'M' could differ from the number of alternatives in the
! original pattern 'N', so in the resultant pattern there would be 'N*M'
  alternatives.  Thus, constraints from the original pattern would be
! duplicated 'N' times, constraints from the output pattern would be
! duplicated 'M' times, producing all possible combinations.
  
  
  File: gccint.info,  Node: Constant Definitions,  Next: Iterators,  Prev: Define Subst,  Up: Machine Desc
*************** File: gccint.info,  Node: Constant Defin
*** 27267,27277 ****
  Using literal constants inside instruction patterns reduces legibility
  and can be a maintenance problem.
  
!  To overcome this problem, you may use the `define_constants'
  expression.  It contains a vector of name-value pairs.  From that point
  on, wherever any of the names appears in the MD file, it is as if the
  corresponding value had been written instead.  You may use
! `define_constants' multiple times; each appearance adds more constants
  to the table.  It is an error to redefine a constant with a different
  value.
  
--- 26893,26903 ----
  Using literal constants inside instruction patterns reduces legibility
  and can be a maintenance problem.
  
!  To overcome this problem, you may use the 'define_constants'
  expression.  It contains a vector of name-value pairs.  From that point
  on, wherever any of the names appears in the MD file, it is as if the
  corresponding value had been written instead.  You may use
! 'define_constants' multiple times; each appearance adds more constants
  to the table.  It is an error to redefine a constant with a different
  value.
  
*************** value.
*** 27308,27314 ****
  in the insn-codes.h header file as #defines.
  
   You can also use the machine description file to define enumerations.
! Like the constants defined by `define_constant', these enumerations are
  visible to both the machine description file and the main C code.
  
   The syntax is as follows:
--- 26934,26940 ----
  in the insn-codes.h header file as #defines.
  
   You can also use the machine description file to define enumerations.
! Like the constants defined by 'define_constant', these enumerations are
  visible to both the machine description file and the main C code.
  
   The syntax is as follows:
*************** visible to both the machine description
*** 27321,27327 ****
       ])
  
   This definition causes the equivalent of the following C code to appear
! in `insn-constants.h':
  
       enum NAME {
         VALUE0 = 0,
--- 26947,26953 ----
       ])
  
   This definition causes the equivalent of the following C code to appear
! in 'insn-constants.h':
  
       enum NAME {
         VALUE0 = 0,
*************** in `insn-constants.h':
*** 27331,27347 ****
       };
       #define NUM_CNAME_VALUES (N + 1)
  
!  where CNAME is the capitalized form of NAME.  It also makes each
! VALUEI available in the machine description file, just as if it had
! been declared with:
  
       (define_constants [(VALUEI I)])
  
!  Each VALUEI is usually an upper-case identifier and usually begins
! with CNAME.
  
!  You can split the enumeration definition into as many statements as
! you like.  The above example is directly equivalent to:
  
       (define_c_enum "NAME" [VALUE0])
       (define_c_enum "NAME" [VALUE1])
--- 26957,26973 ----
       };
       #define NUM_CNAME_VALUES (N + 1)
  
!  where CNAME is the capitalized form of NAME.  It also makes each VALUEI
! available in the machine description file, just as if it had been
! declared with:
  
       (define_constants [(VALUEI I)])
  
!  Each VALUEI is usually an upper-case identifier and usually begins with
! CNAME.
  
!  You can split the enumeration definition into as many statements as you
! like.  The above example is directly equivalent to:
  
       (define_c_enum "NAME" [VALUE0])
       (define_c_enum "NAME" [VALUE1])
*************** you like.  The above example is directly
*** 27349,27382 ****
       (define_c_enum "NAME" [VALUEN])
  
   Splitting the enumeration helps to improve the modularity of each
! individual `.md' file.  For example, if a port defines its
! synchronization instructions in a separate `sync.md' file, it is
  convenient to define all synchronization-specific enumeration values in
! `sync.md' rather than in the main `.md' file.
  
   Some enumeration names have special significance to GCC:
  
! `unspecv'
!      If an enumeration called `unspecv' is defined, GCC will use it
!      when printing out `unspec_volatile' expressions.  For example:
  
            (define_c_enum "unspecv" [
              UNSPECV_BLOCKAGE
            ])
  
!      causes GCC to print `(unspec_volatile ... 0)' as:
  
            (unspec_volatile ... UNSPECV_BLOCKAGE)
  
! `unspec'
!      If an enumeration called `unspec' is defined, GCC will use it when
!      printing out `unspec' expressions.  GCC will also use it when
!      printing out `unspec_volatile' expressions unless an `unspecv'
       enumeration is also defined.  You can therefore decide whether to
       keep separate enumerations for volatile and non-volatile
       expressions or whether to use the same enumeration for both.
  
!  Another way of defining an enumeration is to use `define_enum':
  
       (define_enum "NAME" [
         VALUE0
--- 26975,27008 ----
       (define_c_enum "NAME" [VALUEN])
  
   Splitting the enumeration helps to improve the modularity of each
! individual '.md' file.  For example, if a port defines its
! synchronization instructions in a separate 'sync.md' file, it is
  convenient to define all synchronization-specific enumeration values in
! 'sync.md' rather than in the main '.md' file.
  
   Some enumeration names have special significance to GCC:
  
! 'unspecv'
!      If an enumeration called 'unspecv' is defined, GCC will use it when
!      printing out 'unspec_volatile' expressions.  For example:
  
            (define_c_enum "unspecv" [
              UNSPECV_BLOCKAGE
            ])
  
!      causes GCC to print '(unspec_volatile ... 0)' as:
  
            (unspec_volatile ... UNSPECV_BLOCKAGE)
  
! 'unspec'
!      If an enumeration called 'unspec' is defined, GCC will use it when
!      printing out 'unspec' expressions.  GCC will also use it when
!      printing out 'unspec_volatile' expressions unless an 'unspecv'
       enumeration is also defined.  You can therefore decide whether to
       keep separate enumerations for volatile and non-volatile
       expressions or whether to use the same enumeration for both.
  
!  Another way of defining an enumeration is to use 'define_enum':
  
       (define_enum "NAME" [
         VALUE0
*************** convenient to define all synchronization
*** 27395,27401 ****
       ])
  
   where CVALUEI is the capitalized form of VALUEI.  However, unlike
! `define_c_enum', the enumerations defined by `define_enum' can be used
  in attribute specifications (*note define_enum_attr::).
  
  
--- 27021,27027 ----
       ])
  
   where CVALUEI is the capitalized form of VALUEI.  However, unlike
! 'define_c_enum', the enumerations defined by 'define_enum' can be used
  in attribute specifications (*note define_enum_attr::).
  
  
*************** Ports often need to define similar patte
*** 27425,27441 ****
  modes.  For example:
  
     * If a processor has hardware support for both single and double
!      floating-point arithmetic, the `SFmode' patterns tend to be very
!      similar to the `DFmode' ones.
  
!    * If a port uses `SImode' pointers in one configuration and `DImode'
!      pointers in another, it will usually have very similar `SImode'
!      and `DImode' patterns for manipulating pointers.
  
!  Mode iterators allow several patterns to be instantiated from one
! `.md' file template.  They can be used with any type of rtx-based
! construct, such as a `define_insn', `define_split', or
! `define_peephole2'.
  
  * Menu:
  
--- 27051,27066 ----
  modes.  For example:
  
     * If a processor has hardware support for both single and double
!      floating-point arithmetic, the 'SFmode' patterns tend to be very
!      similar to the 'DFmode' ones.
  
!    * If a port uses 'SImode' pointers in one configuration and 'DImode'
!      pointers in another, it will usually have very similar 'SImode' and
!      'DImode' patterns for manipulating pointers.
  
!  Mode iterators allow several patterns to be instantiated from one '.md'
! file template.  They can be used with any type of rtx-based construct,
! such as a 'define_insn', 'define_split', or 'define_peephole2'.
  
  * Menu:
  
*************** The syntax for defining a mode iterator
*** 27453,27481 ****
  
       (define_mode_iterator NAME [(MODE1 "COND1") ... (MODEN "CONDN")])
  
!  This allows subsequent `.md' file constructs to use the mode suffix
! `:NAME'.  Every construct that does so will be expanded N times, once
! with every use of `:NAME' replaced by `:MODE1', once with every use
! replaced by `:MODE2', and so on.  In the expansion for a particular
  MODEI, every C condition will also require that CONDI be true.
  
   For example:
  
       (define_mode_iterator P [(SI "Pmode == SImode") (DI "Pmode == DImode")])
  
!  defines a new mode suffix `:P'.  Every construct that uses `:P' will
! be expanded twice, once with every `:P' replaced by `:SI' and once with
! every `:P' replaced by `:DI'.  The `:SI' version will only apply if
! `Pmode == SImode' and the `:DI' version will only apply if `Pmode ==
  DImode'.
  
!  As with other `.md' conditions, an empty string is treated as "always
! true".  `(MODE "")' can also be abbreviated to `MODE'.  For example:
  
       (define_mode_iterator GPR [SI (DI "TARGET_64BIT")])
  
!  means that the `:DI' expansion only applies if `TARGET_64BIT' but that
! the `:SI' expansion has no such constraint.
  
   Iterators are applied in the order they are defined.  This can be
  significant if two iterators are used in a construct that requires
--- 27078,27106 ----
  
       (define_mode_iterator NAME [(MODE1 "COND1") ... (MODEN "CONDN")])
  
!  This allows subsequent '.md' file constructs to use the mode suffix
! ':NAME'.  Every construct that does so will be expanded N times, once
! with every use of ':NAME' replaced by ':MODE1', once with every use
! replaced by ':MODE2', and so on.  In the expansion for a particular
  MODEI, every C condition will also require that CONDI be true.
  
   For example:
  
       (define_mode_iterator P [(SI "Pmode == SImode") (DI "Pmode == DImode")])
  
!  defines a new mode suffix ':P'.  Every construct that uses ':P' will be
! expanded twice, once with every ':P' replaced by ':SI' and once with
! every ':P' replaced by ':DI'.  The ':SI' version will only apply if
! 'Pmode == SImode' and the ':DI' version will only apply if 'Pmode ==
  DImode'.
  
!  As with other '.md' conditions, an empty string is treated as "always
! true".  '(MODE "")' can also be abbreviated to 'MODE'.  For example:
  
       (define_mode_iterator GPR [SI (DI "TARGET_64BIT")])
  
!  means that the ':DI' expansion only applies if 'TARGET_64BIT' but that
! the ':SI' expansion has no such constraint.
  
   Iterators are applied in the order they are defined.  This can be
  significant if two iterators are used in a construct that requires
*************** File: gccint.info,  Node: Substitutions,
*** 27487,27511 ****
  16.23.1.2 Substitution in Mode Iterators
  ........................................
  
! If an `.md' file construct uses mode iterators, each version of the
  construct will often need slightly different strings or modes.  For
  example:
  
!    * When a `define_expand' defines several `addM3' patterns (*note
       Standard Names::), each expander will need to use the appropriate
       mode name for M.
  
!    * When a `define_insn' defines several instruction patterns, each
       instruction will often use a different assembler mnemonic.
  
!    * When a `define_insn' requires operands with different modes, using
       an iterator for one of the operand modes usually requires a
       specific mode for the other operand(s).
  
   GCC supports such variations through a system of "mode attributes".
! There are two standard attributes: `mode', which is the name of the
! mode in lower case, and `MODE', which is the same thing in upper case.
! You can define other attributes using:
  
       (define_mode_attr NAME [(MODE1 "VALUE1") ... (MODEN "VALUEN")])
  
--- 27112,27136 ----
  16.23.1.2 Substitution in Mode Iterators
  ........................................
  
! If an '.md' file construct uses mode iterators, each version of the
  construct will often need slightly different strings or modes.  For
  example:
  
!    * When a 'define_expand' defines several 'addM3' patterns (*note
       Standard Names::), each expander will need to use the appropriate
       mode name for M.
  
!    * When a 'define_insn' defines several instruction patterns, each
       instruction will often use a different assembler mnemonic.
  
!    * When a 'define_insn' requires operands with different modes, using
       an iterator for one of the operand modes usually requires a
       specific mode for the other operand(s).
  
   GCC supports such variations through a system of "mode attributes".
! There are two standard attributes: 'mode', which is the name of the mode
! in lower case, and 'MODE', which is the same thing in upper case.  You
! can define other attributes using:
  
       (define_mode_attr NAME [(MODE1 "VALUE1") ... (MODEN "VALUEN")])
  
*************** You can define other attributes using:
*** 27513,27531 ****
  associated with MODEI.
  
   When GCC replaces some :ITERATOR with :MODE, it will scan each string
! and mode in the pattern for sequences of the form `<ITERATOR:ATTR>',
! where ATTR is the name of a mode attribute.  If the attribute is
! defined for MODE, the whole `<...>' sequence will be replaced by the
! appropriate attribute value.
  
!  For example, suppose an `.md' file has:
  
       (define_mode_iterator P [(SI "Pmode == SImode") (DI "Pmode == DImode")])
       (define_mode_attr load [(SI "lw") (DI "ld")])
  
!  If one of the patterns that uses `:P' contains the string
! `"<P:load>\t%0,%1"', the `SI' version of that pattern will use
! `"lw\t%0,%1"' and the `DI' version will use `"ld\t%0,%1"'.
  
   Here is an example of using an attribute for a mode:
  
--- 27138,27156 ----
  associated with MODEI.
  
   When GCC replaces some :ITERATOR with :MODE, it will scan each string
! and mode in the pattern for sequences of the form '<ITERATOR:ATTR>',
! where ATTR is the name of a mode attribute.  If the attribute is defined
! for MODE, the whole '<...>' sequence will be replaced by the appropriate
! attribute value.
  
!  For example, suppose an '.md' file has:
  
       (define_mode_iterator P [(SI "Pmode == SImode") (DI "Pmode == DImode")])
       (define_mode_attr load [(SI "lw") (DI "ld")])
  
!  If one of the patterns that uses ':P' contains the string
! '"<P:load>\t%0,%1"', the 'SI' version of that pattern will use
! '"lw\t%0,%1"' and the 'DI' version will use '"ld\t%0,%1"'.
  
   Here is an example of using an attribute for a mode:
  
*************** appropriate attribute value.
*** 27534,27540 ****
       (define_insn ...
         (sign_extend:LONG (match_operand:<LONG:SHORT> ...)) ...)
  
!  The `ITERATOR:' prefix may be omitted, in which case the substitution
  will be attempted for every iterator expansion.
  
  
--- 27159,27165 ----
       (define_insn ...
         (sign_extend:LONG (match_operand:<LONG:SHORT> ...)) ...)
  
!  The 'ITERATOR:' prefix may be omitted, in which case the substitution
  will be attempted for every iterator expansion.
  
  
*************** and attributes (among others):
*** 27549,27555 ****
       (define_mode_iterator GPR [SI (DI "TARGET_64BIT")])
       (define_mode_attr d [(SI "") (DI "d")])
  
!  and uses the following template to define both `subsi3' and `subdi3':
  
       (define_insn "sub<mode>3"
         [(set (match_operand:GPR 0 "register_operand" "=d")
--- 27174,27180 ----
       (define_mode_iterator GPR [SI (DI "TARGET_64BIT")])
       (define_mode_attr d [(SI "") (DI "d")])
  
!  and uses the following template to define both 'subsi3' and 'subdi3':
  
       (define_insn "sub<mode>3"
         [(set (match_operand:GPR 0 "register_operand" "=d")
*************** times, once with all uses of NAME replac
*** 27602,27609 ****
  replaced by CODE2, and so on.  *Note Defining Mode Iterators::.
  
   It is possible to define attributes for codes as well as for modes.
! There are two standard code attributes: `code', the name of the code in
! lower case, and `CODE', the name of the code in upper case.  Other
  attributes are defined using:
  
       (define_code_attr NAME [(CODE1 "VALUE1") ... (CODEN "VALUEN")])
--- 27227,27234 ----
  replaced by CODE2, and so on.  *Note Defining Mode Iterators::.
  
   It is possible to define attributes for codes as well as for modes.
! There are two standard code attributes: 'code', the name of the code in
! lower case, and 'CODE', the name of the code in upper case.  Other
  attributes are defined using:
  
       (define_code_attr NAME [(CODE1 "VALUE1") ... (CODEN "VALUEN")])
*************** Iterators::.
*** 27667,27682 ****
  
       (define_int_iterator NAME [(INT1 "COND1") ... (INTN "CONDN")])
  
!  defines a pseudo integer constant NAME that can be instantiated as
! INTI if condition CONDI is true.  Each INT must have the same rtx
! format.  *Note RTL Classes::. Int iterators can appear in only those
! rtx fields that have 'i' as the specifier. This means that each INT has
! to be a constant defined using define_constant or define_c_enum.
  
   As with mode and code iterators, each pattern that uses NAME will be
! expanded N times, once with all uses of NAME replaced by INT1, once
! with all uses replaced by INT2, and so on.  *Note Defining Mode
! Iterators::.
  
   It is possible to define attributes for ints as well as for codes and
  modes.  Attributes are defined using:
--- 27292,27306 ----
  
       (define_int_iterator NAME [(INT1 "COND1") ... (INTN "CONDN")])
  
!  defines a pseudo integer constant NAME that can be instantiated as INTI
! if condition CONDI is true.  Each INT must have the same rtx format.
! *Note RTL Classes::.  Int iterators can appear in only those rtx fields
! that have 'i' as the specifier.  This means that each INT has to be a
! constant defined using define_constant or define_c_enum.
  
   As with mode and code iterators, each pattern that uses NAME will be
! expanded N times, once with all uses of NAME replaced by INT1, once with
! all uses replaced by INT2, and so on.  *Note Defining Mode Iterators::.
  
   It is possible to define attributes for ints as well as for codes and
  modes.  Attributes are defined using:
*************** modes.  Attributes are defined using:
*** 27699,27704 ****
--- 27323,27329 ----
         [(set_attr "type" "neon_vqneg_vqabs")]
       )
  
+ 
   This is equivalent to:
  
       (define_insn "neon_vqabs<mode>"
*************** modes.  Attributes are defined using:
*** 27721,27726 ****
--- 27346,27352 ----
         [(set_attr "type" "neon_vqneg_vqabs")]
       )
  
+ 
  
  File: gccint.info,  Node: Subst Iterators,  Prev: Int Iterators,  Up: Iterators
  
*************** used in RTL-pattern.
*** 27736,27749 ****
   Subst iterators transform templates in the following way: the templates
  are duplicated, the subst-attributes in these templates are replaced
  with the corresponding values, and a new attribute is implicitly added
! to the given `define_insn'/`define_expand'.  The name of the added
! attribute matches the name of `define_subst'.  Such attributes are
! declared implicitly, and it is not allowed to have a `define_attr'
! named as a `define_subst'.
  
!  Each subst iterator is linked to a `define_subst'.  It is declared
  implicitly by the first appearance of the corresponding
! `define_subst_attr', and it is not allowed to define it explicitly.
  
   Declarations of subst-attributes have the following syntax:
  
--- 27362,27375 ----
   Subst iterators transform templates in the following way: the templates
  are duplicated, the subst-attributes in these templates are replaced
  with the corresponding values, and a new attribute is implicitly added
! to the given 'define_insn'/'define_expand'.  The name of the added
! attribute matches the name of 'define_subst'.  Such attributes are
! declared implicitly, and it is not allowed to have a 'define_attr' named
! as a 'define_subst'.
  
!  Each subst iterator is linked to a 'define_subst'.  It is declared
  implicitly by the first appearance of the corresponding
! 'define_subst_attr', and it is not allowed to define it explicitly.
  
   Declarations of subst-attributes have the following syntax:
  
*************** implicitly by the first appearance of th
*** 27752,27761 ****
         "NO-SUBST-VALUE"
         "SUBST-APPLIED-VALUE")
  
!  NAME is a string with which the given subst-attribute could be
! referred to.
  
!  SUBST-NAME shows which `define_subst' should be applied to an
  RTL-template if the given subst-attribute is present in the
  RTL-template.
  
--- 27378,27387 ----
         "NO-SUBST-VALUE"
         "SUBST-APPLIED-VALUE")
  
!  NAME is a string with which the given subst-attribute could be referred
! to.
  
!  SUBST-NAME shows which 'define_subst' should be applied to an
  RTL-template if the given subst-attribute is present in the
  RTL-template.
  
*************** File: gccint.info,  Node: Target Macros,
*** 27771,27794 ****
  17 Target Description Macros and Functions
  ******************************************
  
! In addition to the file `MACHINE.md', a machine description includes a
! C header file conventionally given the name `MACHINE.h' and a C source
! file named `MACHINE.c'.  The header file defines numerous macros that
  convey the information about the target machine that does not fit into
! the scheme of the `.md' file.  The file `tm.h' should be a link to
! `MACHINE.h'.  The header file `config.h' includes `tm.h' and most
! compiler source files include `config.h'.  The source file defines a
! variable `targetm', which is a structure containing pointers to
! functions and data relating to the target machine.  `MACHINE.c' should
  also contain their definitions, if they are not defined elsewhere in
! GCC, and other functions called through the macros defined in the `.h'
  file.
  
  * Menu:
  
! * Target Structure::    The `targetm' variable.
  * Driver::              Controlling how the driver runs the compilation passes.
! * Run-time Target::     Defining `-m' options like `-m68000' and `-m68020'.
  * Per-Function Data::   Defining data structures for per-function information.
  * Storage Layout::      Defining sizes and alignments of data.
  * Type Layout::         Defining sizes and properties of basic user data types.
--- 27397,27420 ----
  17 Target Description Macros and Functions
  ******************************************
  
! In addition to the file 'MACHINE.md', a machine description includes a C
! header file conventionally given the name 'MACHINE.h' and a C source
! file named 'MACHINE.c'.  The header file defines numerous macros that
  convey the information about the target machine that does not fit into
! the scheme of the '.md' file.  The file 'tm.h' should be a link to
! 'MACHINE.h'.  The header file 'config.h' includes 'tm.h' and most
! compiler source files include 'config.h'.  The source file defines a
! variable 'targetm', which is a structure containing pointers to
! functions and data relating to the target machine.  'MACHINE.c' should
  also contain their definitions, if they are not defined elsewhere in
! GCC, and other functions called through the macros defined in the '.h'
  file.
  
  * Menu:
  
! * Target Structure::    The 'targetm' variable.
  * Driver::              Controlling how the driver runs the compilation passes.
! * Run-time Target::     Defining '-m' options like '-m68000' and '-m68020'.
  * Per-Function Data::   Defining data structures for per-function information.
  * Storage Layout::      Defining sizes and alignments of data.
  * Type Layout::         Defining sizes and properties of basic user data types.
*************** file.
*** 27799,27805 ****
  * Trampolines::         Code set up at run time to enter a nested function.
  * Library Calls::       Controlling how library routines are implicitly called.
  * Addressing Modes::    Defining addressing modes valid for memory operands.
! * Anchored Addresses::  Defining how `-fsection-anchors' should work.
  * Condition Code::      Defining how insns update the condition code.
  * Costs::               Defining relative costs of different operations.
  * Scheduling::          Adjusting the behavior of the instruction scheduler.
--- 27425,27431 ----
  * Trampolines::         Code set up at run time to enter a nested function.
  * Library Calls::       Controlling how library routines are implicitly called.
  * Addressing Modes::    Defining addressing modes valid for memory operands.
! * Anchored Addresses::  Defining how '-fsection-anchors' should work.
  * Condition Code::      Defining how insns update the condition code.
  * Costs::               Defining relative costs of different operations.
  * Scheduling::          Adjusting the behavior of the instruction scheduler.
*************** file.
*** 27809,27815 ****
  * Debugging Info::      Defining the format of debugging output.
  * Floating Point::      Handling floating point for cross-compilers.
  * Mode Switching::      Insertion of mode-switching instructions.
! * Target Attributes::   Defining target-specific uses of `__attribute__'.
  * Emulated TLS::        Emulated TLS support.
  * MIPS Coprocessors::   MIPS coprocessor support and how to customize it.
  * PCH Target::          Validity checking for precompiled headers.
--- 27435,27441 ----
  * Debugging Info::      Defining the format of debugging output.
  * Floating Point::      Handling floating point for cross-compilers.
  * Mode Switching::      Insertion of mode-switching instructions.
! * Target Attributes::   Defining target-specific uses of '__attribute__'.
  * Emulated TLS::        Emulated TLS support.
  * MIPS Coprocessors::   MIPS coprocessor support and how to customize it.
  * PCH Target::          Validity checking for precompiled headers.
*************** file.
*** 27820,27837 ****
  
  File: gccint.info,  Node: Target Structure,  Next: Driver,  Up: Target Macros
  
! 17.1 The Global `targetm' Variable
  ==================================
  
   -- Variable: struct gcc_target targetm
!      The target `.c' file must define the global `targetm' variable
       which contains pointers to functions and data relating to the
!      target machine.  The variable is declared in `target.h';
!      `target-def.h' defines the macro `TARGET_INITIALIZER' which is
!      used to initialize the variable, and macros for the default
!      initializers for elements of the structure.  The `.c' file should
!      override those macros for which the default definition is
!      inappropriate.  For example:
            #include "target.h"
            #include "target-def.h"
  
--- 27446,27463 ----
  
  File: gccint.info,  Node: Target Structure,  Next: Driver,  Up: Target Macros
  
! 17.1 The Global 'targetm' Variable
  ==================================
  
   -- Variable: struct gcc_target targetm
!      The target '.c' file must define the global 'targetm' variable
       which contains pointers to functions and data relating to the
!      target machine.  The variable is declared in 'target.h';
!      'target-def.h' defines the macro 'TARGET_INITIALIZER' which is used
!      to initialize the variable, and macros for the default initializers
!      for elements of the structure.  The '.c' file should override those
!      macros for which the default definition is inappropriate.  For
!      example:
            #include "target.h"
            #include "target-def.h"
  
*************** File: gccint.info,  Node: Target Structu
*** 27842,27872 ****
  
            struct gcc_target targetm = TARGET_INITIALIZER;
  
! Where a macro should be defined in the `.c' file in this manner to form
! part of the `targetm' structure, it is documented below as a "Target
  Hook" with a prototype.  Many macros will change in future from being
! defined in the `.h' file to being part of the `targetm' structure.
  
!  Similarly, there is a `targetcm' variable for hooks that are specific
  to front ends for C-family languages, documented as "C Target Hook".
! This is declared in `c-family/c-target.h', the initializer
! `TARGETCM_INITIALIZER' in `c-family/c-target-def.h'.  If targets
! initialize `targetcm' themselves, they should set
! `target_has_targetcm=yes' in `config.gcc'; otherwise a default
  definition is used.
  
!  Similarly, there is a `targetm_common' variable for hooks that are
  shared between the compiler driver and the compilers proper, documented
! as "Common Target Hook".  This is declared in `common/common-target.h',
! the initializer `TARGETM_COMMON_INITIALIZER' in
! `common/common-target-def.h'.  If targets initialize `targetm_common'
! themselves, they should set `target_has_targetm_common=yes' in
! `config.gcc'; otherwise a default definition is used.
  
  
  File: gccint.info,  Node: Driver,  Next: Run-time Target,  Prev: Target Structure,  Up: Target Macros
  
! 17.2 Controlling the Compilation Driver, `gcc'
  ==============================================
  
  You can control the compilation driver.
--- 27468,27498 ----
  
            struct gcc_target targetm = TARGET_INITIALIZER;
  
!  Where a macro should be defined in the '.c' file in this manner to form
! part of the 'targetm' structure, it is documented below as a "Target
  Hook" with a prototype.  Many macros will change in future from being
! defined in the '.h' file to being part of the 'targetm' structure.
  
!  Similarly, there is a 'targetcm' variable for hooks that are specific
  to front ends for C-family languages, documented as "C Target Hook".
! This is declared in 'c-family/c-target.h', the initializer
! 'TARGETCM_INITIALIZER' in 'c-family/c-target-def.h'.  If targets
! initialize 'targetcm' themselves, they should set
! 'target_has_targetcm=yes' in 'config.gcc'; otherwise a default
  definition is used.
  
!  Similarly, there is a 'targetm_common' variable for hooks that are
  shared between the compiler driver and the compilers proper, documented
! as "Common Target Hook".  This is declared in 'common/common-target.h',
! the initializer 'TARGETM_COMMON_INITIALIZER' in
! 'common/common-target-def.h'.  If targets initialize 'targetm_common'
! themselves, they should set 'target_has_targetm_common=yes' in
! 'config.gcc'; otherwise a default definition is used.
  
  
  File: gccint.info,  Node: Driver,  Next: Run-time Target,  Prev: Target Structure,  Up: Target Macros
  
! 17.2 Controlling the Compilation Driver, 'gcc'
  ==============================================
  
  You can control the compilation driver.
*************** You can control the compilation driver.
*** 27876,27886 ****
       initializer for an array of strings, with no surrounding braces.
  
       The driver applies these specs to its own command line between
!      loading default `specs' files (but not command-line specified
!      ones) and choosing the multilib directory or running any
!      subcommands.  It applies them in the order given, so each spec can
!      depend on the options added by earlier ones.  It is also possible
!      to remove options using `%<OPTION' in the usual way.
  
       This macro can be useful when a port has several interdependent
       target options.  It provides a way of standardizing the command
--- 27502,27512 ----
       initializer for an array of strings, with no surrounding braces.
  
       The driver applies these specs to its own command line between
!      loading default 'specs' files (but not command-line specified ones)
!      and choosing the multilib directory or running any subcommands.  It
!      applies them in the order given, so each spec can depend on the
!      options added by earlier ones.  It is also possible to remove
!      options using '%<OPTION' in the usual way.
  
       This macro can be useful when a port has several interdependent
       target options.  It provides a way of standardizing the command
*************** You can control the compilation driver.
*** 27890,27938 ****
  
   -- Macro: OPTION_DEFAULT_SPECS
       A list of specs used to support configure-time default options
!      (i.e.  `--with' options) in the driver.  It should be a suitable
       initializer for an array of structures, each containing two
       strings, without the outermost pair of surrounding braces.
  
       The first item in the pair is the name of the default.  This must
!      match the code in `config.gcc' for the target.  The second item is
       a spec to apply if a default with this name was specified.  The
!      string `%(VALUE)' in the spec will be replaced by the value of the
       default everywhere it occurs.
  
       The driver will apply these specs to its own command line between
!      loading default `specs' files and processing `DRIVER_SELF_SPECS',
!      using the same mechanism as `DRIVER_SELF_SPECS'.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: CPP_SPEC
       A C string constant that tells the GCC driver program options to
!      pass to CPP.  It can also specify how to translate options you
!      give to GCC into options for GCC to pass to the CPP.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: CPLUSPLUS_CPP_SPEC
!      This macro is just like `CPP_SPEC', but is used for C++, rather
       than C.  If you do not define this macro, then the value of
!      `CPP_SPEC' (if any) will be used instead.
  
   -- Macro: CC1_SPEC
       A C string constant that tells the GCC driver program options to
!      pass to `cc1', `cc1plus', `f771', and the other language front
!      ends.  It can also specify how to translate options you give to
!      GCC into options for GCC to pass to front ends.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: CC1PLUS_SPEC
       A C string constant that tells the GCC driver program options to
!      pass to `cc1plus'.  It can also specify how to translate options
!      you give to GCC into options for GCC to pass to the `cc1plus'.
  
       Do not define this macro if it does not need to do anything.  Note
!      that everything defined in CC1_SPEC is already passed to `cc1plus'
       so there is no need to duplicate the contents of CC1_SPEC in
       CC1PLUS_SPEC.
  
--- 27516,27564 ----
  
   -- Macro: OPTION_DEFAULT_SPECS
       A list of specs used to support configure-time default options
!      (i.e. '--with' options) in the driver.  It should be a suitable
       initializer for an array of structures, each containing two
       strings, without the outermost pair of surrounding braces.
  
       The first item in the pair is the name of the default.  This must
!      match the code in 'config.gcc' for the target.  The second item is
       a spec to apply if a default with this name was specified.  The
!      string '%(VALUE)' in the spec will be replaced by the value of the
       default everywhere it occurs.
  
       The driver will apply these specs to its own command line between
!      loading default 'specs' files and processing 'DRIVER_SELF_SPECS',
!      using the same mechanism as 'DRIVER_SELF_SPECS'.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: CPP_SPEC
       A C string constant that tells the GCC driver program options to
!      pass to CPP.  It can also specify how to translate options you give
!      to GCC into options for GCC to pass to the CPP.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: CPLUSPLUS_CPP_SPEC
!      This macro is just like 'CPP_SPEC', but is used for C++, rather
       than C.  If you do not define this macro, then the value of
!      'CPP_SPEC' (if any) will be used instead.
  
   -- Macro: CC1_SPEC
       A C string constant that tells the GCC driver program options to
!      pass to 'cc1', 'cc1plus', 'f771', and the other language front
!      ends.  It can also specify how to translate options you give to GCC
!      into options for GCC to pass to front ends.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: CC1PLUS_SPEC
       A C string constant that tells the GCC driver program options to
!      pass to 'cc1plus'.  It can also specify how to translate options
!      you give to GCC into options for GCC to pass to the 'cc1plus'.
  
       Do not define this macro if it does not need to do anything.  Note
!      that everything defined in CC1_SPEC is already passed to 'cc1plus'
       so there is no need to duplicate the contents of CC1_SPEC in
       CC1PLUS_SPEC.
  
*************** You can control the compilation driver.
*** 27940,27967 ****
       A C string constant that tells the GCC driver program options to
       pass to the assembler.  It can also specify how to translate
       options you give to GCC into options for GCC to pass to the
!      assembler.  See the file `sun3.h' for an example of this.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: ASM_FINAL_SPEC
       A C string constant that tells the GCC driver program how to run
       any programs which cleanup after the normal assembler.  Normally,
!      this is not needed.  See the file `mips.h' for an example of this.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: AS_NEEDS_DASH_FOR_PIPED_INPUT
       Define this macro, with no value, if the driver should give the
!      assembler an argument consisting of a single dash, `-', to
!      instruct it to read from its standard input (which will be a pipe
!      connected to the output of the compiler proper).  This argument is
!      given after any `-o' option specifying the name of the output file.
  
       If you do not define this macro, the assembler is assumed to read
       its standard input if given no non-option arguments.  If your
!      assembler cannot read standard input at all, use a `%{pipe:%e}'
!      construct; see `mips.h' for instance.
  
   -- Macro: LINK_SPEC
       A C string constant that tells the GCC driver program options to
--- 27566,27593 ----
       A C string constant that tells the GCC driver program options to
       pass to the assembler.  It can also specify how to translate
       options you give to GCC into options for GCC to pass to the
!      assembler.  See the file 'sun3.h' for an example of this.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: ASM_FINAL_SPEC
       A C string constant that tells the GCC driver program how to run
       any programs which cleanup after the normal assembler.  Normally,
!      this is not needed.  See the file 'mips.h' for an example of this.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: AS_NEEDS_DASH_FOR_PIPED_INPUT
       Define this macro, with no value, if the driver should give the
!      assembler an argument consisting of a single dash, '-', to instruct
!      it to read from its standard input (which will be a pipe connected
!      to the output of the compiler proper).  This argument is given
!      after any '-o' option specifying the name of the output file.
  
       If you do not define this macro, the assembler is assumed to read
       its standard input if given no non-option arguments.  If your
!      assembler cannot read standard input at all, use a '%{pipe:%e}'
!      construct; see 'mips.h' for instance.
  
   -- Macro: LINK_SPEC
       A C string constant that tells the GCC driver program options to
*************** You can control the compilation driver.
*** 27971,28038 ****
       Do not define this macro if it does not need to do anything.
  
   -- Macro: LIB_SPEC
!      Another C string constant used much like `LINK_SPEC'.  The
!      difference between the two is that `LIB_SPEC' is used at the end
!      of the command given to the linker.
  
       If this macro is not defined, a default is provided that loads the
!      standard C library from the usual place.  See `gcc.c'.
  
   -- Macro: LIBGCC_SPEC
!      Another C string constant that tells the GCC driver program how
!      and when to place a reference to `libgcc.a' into the linker
!      command line.  This constant is placed both before and after the
!      value of `LIB_SPEC'.
  
       If this macro is not defined, the GCC driver provides a default
!      that passes the string `-lgcc' to the linker.
  
   -- Macro: REAL_LIBGCC_SPEC
!      By default, if `ENABLE_SHARED_LIBGCC' is defined, the
!      `LIBGCC_SPEC' is not directly used by the driver program but is
!      instead modified to refer to different versions of `libgcc.a'
!      depending on the values of the command line flags `-static',
!      `-shared', `-static-libgcc', and `-shared-libgcc'.  On targets
!      where these modifications are inappropriate, define
!      `REAL_LIBGCC_SPEC' instead.  `REAL_LIBGCC_SPEC' tells the driver
!      how to place a reference to `libgcc' on the link command line,
!      but, unlike `LIBGCC_SPEC', it is used unmodified.
  
   -- Macro: USE_LD_AS_NEEDED
!      A macro that controls the modifications to `LIBGCC_SPEC' mentioned
!      in `REAL_LIBGCC_SPEC'.  If nonzero, a spec will be generated that
!      uses `--as-needed' or equivalent options and the shared `libgcc'
!      in place of the static exception handler library, when linking
!      without any of `-static', `-static-libgcc', or `-shared-libgcc'.
  
   -- Macro: LINK_EH_SPEC
!      If defined, this C string constant is added to `LINK_SPEC'.  When
!      `USE_LD_AS_NEEDED' is zero or undefined, it also affects the
!      modifications to `LIBGCC_SPEC' mentioned in `REAL_LIBGCC_SPEC'.
  
   -- Macro: STARTFILE_SPEC
!      Another C string constant used much like `LINK_SPEC'.  The
!      difference between the two is that `STARTFILE_SPEC' is used at the
       very beginning of the command given to the linker.
  
       If this macro is not defined, a default is provided that loads the
!      standard C startup file from the usual place.  See `gcc.c'.
  
   -- Macro: ENDFILE_SPEC
!      Another C string constant used much like `LINK_SPEC'.  The
!      difference between the two is that `ENDFILE_SPEC' is used at the
       very end of the command given to the linker.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: THREAD_MODEL_SPEC
!      GCC `-v' will print the thread model GCC was configured to use.
       However, this doesn't work on platforms that are multilibbed on
       thread models, such as AIX 4.3.  On such platforms, define
!      `THREAD_MODEL_SPEC' such that it evaluates to a string without
!      blanks that names one of the recognized thread models.  `%*', the
       default value of this macro, will expand to the value of
!      `thread_file' set in `config.gcc'.
  
   -- Macro: SYSROOT_SUFFIX_SPEC
       Define this macro to add a suffix to the target sysroot when GCC is
--- 27597,27664 ----
       Do not define this macro if it does not need to do anything.
  
   -- Macro: LIB_SPEC
!      Another C string constant used much like 'LINK_SPEC'.  The
!      difference between the two is that 'LIB_SPEC' is used at the end of
!      the command given to the linker.
  
       If this macro is not defined, a default is provided that loads the
!      standard C library from the usual place.  See 'gcc.c'.
  
   -- Macro: LIBGCC_SPEC
!      Another C string constant that tells the GCC driver program how and
!      when to place a reference to 'libgcc.a' into the linker command
!      line.  This constant is placed both before and after the value of
!      'LIB_SPEC'.
  
       If this macro is not defined, the GCC driver provides a default
!      that passes the string '-lgcc' to the linker.
  
   -- Macro: REAL_LIBGCC_SPEC
!      By default, if 'ENABLE_SHARED_LIBGCC' is defined, the 'LIBGCC_SPEC'
!      is not directly used by the driver program but is instead modified
!      to refer to different versions of 'libgcc.a' depending on the
!      values of the command line flags '-static', '-shared',
!      '-static-libgcc', and '-shared-libgcc'.  On targets where these
!      modifications are inappropriate, define 'REAL_LIBGCC_SPEC' instead.
!      'REAL_LIBGCC_SPEC' tells the driver how to place a reference to
!      'libgcc' on the link command line, but, unlike 'LIBGCC_SPEC', it is
!      used unmodified.
  
   -- Macro: USE_LD_AS_NEEDED
!      A macro that controls the modifications to 'LIBGCC_SPEC' mentioned
!      in 'REAL_LIBGCC_SPEC'.  If nonzero, a spec will be generated that
!      uses '--as-needed' or equivalent options and the shared 'libgcc' in
!      place of the static exception handler library, when linking without
!      any of '-static', '-static-libgcc', or '-shared-libgcc'.
  
   -- Macro: LINK_EH_SPEC
!      If defined, this C string constant is added to 'LINK_SPEC'.  When
!      'USE_LD_AS_NEEDED' is zero or undefined, it also affects the
!      modifications to 'LIBGCC_SPEC' mentioned in 'REAL_LIBGCC_SPEC'.
  
   -- Macro: STARTFILE_SPEC
!      Another C string constant used much like 'LINK_SPEC'.  The
!      difference between the two is that 'STARTFILE_SPEC' is used at the
       very beginning of the command given to the linker.
  
       If this macro is not defined, a default is provided that loads the
!      standard C startup file from the usual place.  See 'gcc.c'.
  
   -- Macro: ENDFILE_SPEC
!      Another C string constant used much like 'LINK_SPEC'.  The
!      difference between the two is that 'ENDFILE_SPEC' is used at the
       very end of the command given to the linker.
  
       Do not define this macro if it does not need to do anything.
  
   -- Macro: THREAD_MODEL_SPEC
!      GCC '-v' will print the thread model GCC was configured to use.
       However, this doesn't work on platforms that are multilibbed on
       thread models, such as AIX 4.3.  On such platforms, define
!      'THREAD_MODEL_SPEC' such that it evaluates to a string without
!      blanks that names one of the recognized thread models.  '%*', the
       default value of this macro, will expand to the value of
!      'thread_file' set in 'config.gcc'.
  
   -- Macro: SYSROOT_SUFFIX_SPEC
       Define this macro to add a suffix to the target sysroot when GCC is
*************** You can control the compilation driver.
*** 28041,28054 ****
  
   -- Macro: SYSROOT_HEADERS_SUFFIX_SPEC
       Define this macro to add a headers_suffix to the target sysroot
!      when GCC is configured with a sysroot.  This will cause GCC to
!      pass the updated sysroot+headers_suffix to CPP, causing it to
!      search for usr/include, et al, within sysroot+headers_suffix.
  
   -- Macro: EXTRA_SPECS
       Define this macro to provide additional specifications to put in
!      the `specs' file that can be used in various specifications like
!      `CC1_SPEC'.
  
       The definition should be an initializer for an array of structures,
       containing a string constant, that defines the specification name,
--- 27667,27680 ----
  
   -- Macro: SYSROOT_HEADERS_SUFFIX_SPEC
       Define this macro to add a headers_suffix to the target sysroot
!      when GCC is configured with a sysroot.  This will cause GCC to pass
!      the updated sysroot+headers_suffix to CPP, causing it to search for
!      usr/include, et al, within sysroot+headers_suffix.
  
   -- Macro: EXTRA_SPECS
       Define this macro to provide additional specifications to put in
!      the 'specs' file that can be used in various specifications like
!      'CC1_SPEC'.
  
       The definition should be an initializer for an array of structures,
       containing a string constant, that defines the specification name,
*************** You can control the compilation driver.
*** 28056,28079 ****
  
       Do not define this macro if it does not need to do anything.
  
!      `EXTRA_SPECS' is useful when an architecture contains several
!      related targets, which have various `..._SPECS' which are similar
       to each other, and the maintainer would like one central place to
       keep these definitions.
  
!      For example, the PowerPC System V.4 targets use `EXTRA_SPECS' to
!      define either `_CALL_SYSV' when the System V calling sequence is
!      used or `_CALL_AIX' when the older AIX-based calling sequence is
       used.
  
!      The `config/rs6000/rs6000.h' target file defines:
  
            #define EXTRA_SPECS \
              { "cpp_sysv_default", CPP_SYSV_DEFAULT },
  
            #define CPP_SYS_DEFAULT ""
  
!      The `config/rs6000/sysv.h' target file defines:
            #undef CPP_SPEC
            #define CPP_SPEC \
            "%{posix: -D_POSIX_SOURCE } \
--- 27682,27705 ----
  
       Do not define this macro if it does not need to do anything.
  
!      'EXTRA_SPECS' is useful when an architecture contains several
!      related targets, which have various '..._SPECS' which are similar
       to each other, and the maintainer would like one central place to
       keep these definitions.
  
!      For example, the PowerPC System V.4 targets use 'EXTRA_SPECS' to
!      define either '_CALL_SYSV' when the System V calling sequence is
!      used or '_CALL_AIX' when the older AIX-based calling sequence is
       used.
  
!      The 'config/rs6000/rs6000.h' target file defines:
  
            #define EXTRA_SPECS \
              { "cpp_sysv_default", CPP_SYSV_DEFAULT },
  
            #define CPP_SYS_DEFAULT ""
  
!      The 'config/rs6000/sysv.h' target file defines:
            #undef CPP_SPEC
            #define CPP_SPEC \
            "%{posix: -D_POSIX_SOURCE } \
*************** You can control the compilation driver.
*** 28084,28166 ****
            #undef CPP_SYSV_DEFAULT
            #define CPP_SYSV_DEFAULT "-D_CALL_SYSV"
  
!      while the `config/rs6000/eabiaix.h' target file defines
!      `CPP_SYSV_DEFAULT' as:
  
            #undef CPP_SYSV_DEFAULT
            #define CPP_SYSV_DEFAULT "-D_CALL_AIX"
  
   -- Macro: LINK_LIBGCC_SPECIAL_1
       Define this macro if the driver program should find the library
!      `libgcc.a'.  If you do not define this macro, the driver program
!      will pass the argument `-lgcc' to tell the linker to do the search.
  
   -- Macro: LINK_GCC_C_SEQUENCE_SPEC
       The sequence in which libgcc and libc are specified to the linker.
!      By default this is `%G %L %G'.
  
   -- Macro: LINK_COMMAND_SPEC
       A C string constant giving the complete command line need to
!      execute the linker.  When you do this, you will need to update
!      your port each time a change is made to the link command line
!      within `gcc.c'.  Therefore, define this macro only if you need to
       completely redefine the command line for invoking the linker and
       there is no other way to accomplish the effect you need.
       Overriding this macro may be avoidable by overriding
!      `LINK_GCC_C_SEQUENCE_SPEC' instead.
  
   -- Common Target Hook: bool TARGET_ALWAYS_STRIP_DOTDOT
!      True if `..' components should always be removed from directory
       names computed relative to GCC's internal directories, false
       (default) if such components should be preserved and directory
       names containing them passed to other tools such as the linker.
  
   -- Macro: MULTILIB_DEFAULTS
!      Define this macro as a C expression for the initializer of an
!      array of string to tell the driver program which options are
!      defaults for this target and thus do not need to be handled
!      specially when using `MULTILIB_OPTIONS'.
  
!      Do not define this macro if `MULTILIB_OPTIONS' is not defined in
       the target makefile fragment or if none of the options listed in
!      `MULTILIB_OPTIONS' are set by default.  *Note Target Fragment::.
  
   -- Macro: RELATIVE_PREFIX_NOT_LINKDIR
!      Define this macro to tell `gcc' that it should only translate a
!      `-B' prefix into a `-L' linker option if the prefix indicates an
       absolute file name.
  
   -- Macro: MD_EXEC_PREFIX
       If defined, this macro is an additional prefix to try after
!      `STANDARD_EXEC_PREFIX'.  `MD_EXEC_PREFIX' is not searched when the
       compiler is built as a cross compiler.  If you define
!      `MD_EXEC_PREFIX', then be sure to add it to the list of
!      directories used to find the assembler in `configure.in'.
  
   -- Macro: STANDARD_STARTFILE_PREFIX
       Define this macro as a C string constant if you wish to override
!      the standard choice of `libdir' as the default prefix to try when
!      searching for startup files such as `crt0.o'.
!      `STANDARD_STARTFILE_PREFIX' is not searched when the compiler is
       built as a cross compiler.
  
   -- Macro: STANDARD_STARTFILE_PREFIX_1
       Define this macro as a C string constant if you wish to override
!      the standard choice of `/lib' as a prefix to try after the default
!      prefix when searching for startup files such as `crt0.o'.
!      `STANDARD_STARTFILE_PREFIX_1' is not searched when the compiler is
       built as a cross compiler.
  
   -- Macro: STANDARD_STARTFILE_PREFIX_2
       Define this macro as a C string constant if you wish to override
!      the standard choice of `/lib' as yet another prefix to try after
       the default prefix when searching for startup files such as
!      `crt0.o'.  `STANDARD_STARTFILE_PREFIX_2' is not searched when the
       compiler is built as a cross compiler.
  
   -- Macro: MD_STARTFILE_PREFIX
       If defined, this macro supplies an additional prefix to try after
!      the standard prefixes.  `MD_EXEC_PREFIX' is not searched when the
       compiler is built as a cross compiler.
  
   -- Macro: MD_STARTFILE_PREFIX_1
--- 27710,27792 ----
            #undef CPP_SYSV_DEFAULT
            #define CPP_SYSV_DEFAULT "-D_CALL_SYSV"
  
!      while the 'config/rs6000/eabiaix.h' target file defines
!      'CPP_SYSV_DEFAULT' as:
  
            #undef CPP_SYSV_DEFAULT
            #define CPP_SYSV_DEFAULT "-D_CALL_AIX"
  
   -- Macro: LINK_LIBGCC_SPECIAL_1
       Define this macro if the driver program should find the library
!      'libgcc.a'.  If you do not define this macro, the driver program
!      will pass the argument '-lgcc' to tell the linker to do the search.
  
   -- Macro: LINK_GCC_C_SEQUENCE_SPEC
       The sequence in which libgcc and libc are specified to the linker.
!      By default this is '%G %L %G'.
  
   -- Macro: LINK_COMMAND_SPEC
       A C string constant giving the complete command line need to
!      execute the linker.  When you do this, you will need to update your
!      port each time a change is made to the link command line within
!      'gcc.c'.  Therefore, define this macro only if you need to
       completely redefine the command line for invoking the linker and
       there is no other way to accomplish the effect you need.
       Overriding this macro may be avoidable by overriding
!      'LINK_GCC_C_SEQUENCE_SPEC' instead.
  
   -- Common Target Hook: bool TARGET_ALWAYS_STRIP_DOTDOT
!      True if '..' components should always be removed from directory
       names computed relative to GCC's internal directories, false
       (default) if such components should be preserved and directory
       names containing them passed to other tools such as the linker.
  
   -- Macro: MULTILIB_DEFAULTS
!      Define this macro as a C expression for the initializer of an array
!      of string to tell the driver program which options are defaults for
!      this target and thus do not need to be handled specially when using
!      'MULTILIB_OPTIONS'.
  
!      Do not define this macro if 'MULTILIB_OPTIONS' is not defined in
       the target makefile fragment or if none of the options listed in
!      'MULTILIB_OPTIONS' are set by default.  *Note Target Fragment::.
  
   -- Macro: RELATIVE_PREFIX_NOT_LINKDIR
!      Define this macro to tell 'gcc' that it should only translate a
!      '-B' prefix into a '-L' linker option if the prefix indicates an
       absolute file name.
  
   -- Macro: MD_EXEC_PREFIX
       If defined, this macro is an additional prefix to try after
!      'STANDARD_EXEC_PREFIX'.  'MD_EXEC_PREFIX' is not searched when the
       compiler is built as a cross compiler.  If you define
!      'MD_EXEC_PREFIX', then be sure to add it to the list of directories
!      used to find the assembler in 'configure.in'.
  
   -- Macro: STANDARD_STARTFILE_PREFIX
       Define this macro as a C string constant if you wish to override
!      the standard choice of 'libdir' as the default prefix to try when
!      searching for startup files such as 'crt0.o'.
!      'STANDARD_STARTFILE_PREFIX' is not searched when the compiler is
       built as a cross compiler.
  
   -- Macro: STANDARD_STARTFILE_PREFIX_1
       Define this macro as a C string constant if you wish to override
!      the standard choice of '/lib' as a prefix to try after the default
!      prefix when searching for startup files such as 'crt0.o'.
!      'STANDARD_STARTFILE_PREFIX_1' is not searched when the compiler is
       built as a cross compiler.
  
   -- Macro: STANDARD_STARTFILE_PREFIX_2
       Define this macro as a C string constant if you wish to override
!      the standard choice of '/lib' as yet another prefix to try after
       the default prefix when searching for startup files such as
!      'crt0.o'.  'STANDARD_STARTFILE_PREFIX_2' is not searched when the
       compiler is built as a cross compiler.
  
   -- Macro: MD_STARTFILE_PREFIX
       If defined, this macro supplies an additional prefix to try after
!      the standard prefixes.  'MD_EXEC_PREFIX' is not searched when the
       compiler is built as a cross compiler.
  
   -- Macro: MD_STARTFILE_PREFIX_1
*************** You can control the compilation driver.
*** 28172,28216 ****
       Define this macro as a C string constant if you wish to set
       environment variables for programs called by the driver, such as
       the assembler and loader.  The driver passes the value of this
!      macro to `putenv' to initialize the necessary environment
       variables.
  
   -- Macro: LOCAL_INCLUDE_DIR
       Define this macro as a C string constant if you wish to override
!      the standard choice of `/usr/local/include' as the default prefix
!      to try when searching for local header files.  `LOCAL_INCLUDE_DIR'
!      comes before `NATIVE_SYSTEM_HEADER_DIR' (set in `config.gcc',
!      normally `/usr/include') in the search order.
  
!      Cross compilers do not search either `/usr/local/include' or its
       replacement.
  
   -- Macro: NATIVE_SYSTEM_HEADER_COMPONENT
!      The "component" corresponding to `NATIVE_SYSTEM_HEADER_DIR'.  See
!      `INCLUDE_DEFAULTS', below, for the description of components.  If
       you do not define this macro, no component is used.
  
   -- Macro: INCLUDE_DEFAULTS
!      Define this macro if you wish to override the entire default
!      search path for include files.  For a native compiler, the default
!      search path usually consists of `GCC_INCLUDE_DIR',
!      `LOCAL_INCLUDE_DIR', `GPLUSPLUS_INCLUDE_DIR', and
!      `NATIVE_SYSTEM_HEADER_DIR'.  In addition, `GPLUSPLUS_INCLUDE_DIR'
!      and `GCC_INCLUDE_DIR' are defined automatically by `Makefile', and
!      specify private search areas for GCC.  The directory
!      `GPLUSPLUS_INCLUDE_DIR' is used only for C++ programs.
  
       The definition should be an initializer for an array of structures.
       Each array element should have four elements: the directory name (a
       string constant), the component name (also a string constant), a
!      flag for C++-only directories, and a flag showing that the
!      includes in the directory don't need to be wrapped in `extern `C''
!      when compiling C++.  Mark the end of the array with a null element.
  
       The component name denotes what GNU package the include file is
       part of, if any, in all uppercase letters.  For example, it might
!      be `GCC' or `BINUTILS'.  If the package is part of a
!      vendor-supplied operating system, code the component name as `0'.
  
       For example, here is the definition used for VAX/VMS:
  
--- 27798,27842 ----
       Define this macro as a C string constant if you wish to set
       environment variables for programs called by the driver, such as
       the assembler and loader.  The driver passes the value of this
!      macro to 'putenv' to initialize the necessary environment
       variables.
  
   -- Macro: LOCAL_INCLUDE_DIR
       Define this macro as a C string constant if you wish to override
!      the standard choice of '/usr/local/include' as the default prefix
!      to try when searching for local header files.  'LOCAL_INCLUDE_DIR'
!      comes before 'NATIVE_SYSTEM_HEADER_DIR' (set in 'config.gcc',
!      normally '/usr/include') in the search order.
  
!      Cross compilers do not search either '/usr/local/include' or its
       replacement.
  
   -- Macro: NATIVE_SYSTEM_HEADER_COMPONENT
!      The "component" corresponding to 'NATIVE_SYSTEM_HEADER_DIR'.  See
!      'INCLUDE_DEFAULTS', below, for the description of components.  If
       you do not define this macro, no component is used.
  
   -- Macro: INCLUDE_DEFAULTS
!      Define this macro if you wish to override the entire default search
!      path for include files.  For a native compiler, the default search
!      path usually consists of 'GCC_INCLUDE_DIR', 'LOCAL_INCLUDE_DIR',
!      'GPLUSPLUS_INCLUDE_DIR', and 'NATIVE_SYSTEM_HEADER_DIR'.  In
!      addition, 'GPLUSPLUS_INCLUDE_DIR' and 'GCC_INCLUDE_DIR' are defined
!      automatically by 'Makefile', and specify private search areas for
!      GCC.  The directory 'GPLUSPLUS_INCLUDE_DIR' is used only for C++
!      programs.
  
       The definition should be an initializer for an array of structures.
       Each array element should have four elements: the directory name (a
       string constant), the component name (also a string constant), a
!      flag for C++-only directories, and a flag showing that the includes
!      in the directory don't need to be wrapped in 'extern 'C'' when
!      compiling C++.  Mark the end of the array with a null element.
  
       The component name denotes what GNU package the include file is
       part of, if any, in all uppercase letters.  For example, it might
!      be 'GCC' or 'BINUTILS'.  If the package is part of a
!      vendor-supplied operating system, code the component name as '0'.
  
       For example, here is the definition used for VAX/VMS:
  
*************** You can control the compilation driver.
*** 28225,28290 ****
  
   Here is the order of prefixes tried for exec files:
  
!   1. Any prefixes specified by the user with `-B'.
  
!   2. The environment variable `GCC_EXEC_PREFIX' or, if `GCC_EXEC_PREFIX'
       is not set and the compiler has not been installed in the
       configure-time PREFIX, the location in which the compiler has
       actually been installed.
  
    3. The directories specified by the environment variable
!      `COMPILER_PATH'.
  
!   4. The macro `STANDARD_EXEC_PREFIX', if the compiler has been
       installed in the configured-time PREFIX.
  
!   5. The location `/usr/libexec/gcc/', but only if this is a native
       compiler.
  
!   6. The location `/usr/lib/gcc/', but only if this is a native
       compiler.
  
!   7. The macro `MD_EXEC_PREFIX', if defined, but only if this is a
       native compiler.
  
   Here is the order of prefixes tried for startfiles:
  
!   1. Any prefixes specified by the user with `-B'.
  
!   2. The environment variable `GCC_EXEC_PREFIX' or its automatically
       determined value based on the installed toolchain location.
  
    3. The directories specified by the environment variable
!      `LIBRARY_PATH' (or port-specific name; native only, cross
!      compilers do not use this).
  
!   4. The macro `STANDARD_EXEC_PREFIX', but only if the toolchain is
       installed in the configured PREFIX or this is a native compiler.
  
!   5. The location `/usr/lib/gcc/', but only if this is a native
       compiler.
  
!   6. The macro `MD_EXEC_PREFIX', if defined, but only if this is a
       native compiler.
  
!   7. The macro `MD_STARTFILE_PREFIX', if defined, but only if this is a
       native compiler, or we have a target system root.
  
!   8. The macro `MD_STARTFILE_PREFIX_1', if defined, but only if this is
       a native compiler, or we have a target system root.
  
!   9. The macro `STANDARD_STARTFILE_PREFIX', with any sysroot
       modifications.  If this path is relative it will be prefixed by
!      `GCC_EXEC_PREFIX' and the machine suffix or `STANDARD_EXEC_PREFIX'
       and the machine suffix.
  
!  10. The macro `STANDARD_STARTFILE_PREFIX_1', but only if this is a
!      native compiler, or we have a target system root. The default for
!      this macro is `/lib/'.
  
!  11. The macro `STANDARD_STARTFILE_PREFIX_2', but only if this is a
!      native compiler, or we have a target system root. The default for
!      this macro is `/usr/lib/'.
  
  
  File: gccint.info,  Node: Run-time Target,  Next: Per-Function Data,  Prev: Driver,  Up: Target Macros
--- 27851,27916 ----
  
   Here is the order of prefixes tried for exec files:
  
!   1. Any prefixes specified by the user with '-B'.
  
!   2. The environment variable 'GCC_EXEC_PREFIX' or, if 'GCC_EXEC_PREFIX'
       is not set and the compiler has not been installed in the
       configure-time PREFIX, the location in which the compiler has
       actually been installed.
  
    3. The directories specified by the environment variable
!      'COMPILER_PATH'.
  
!   4. The macro 'STANDARD_EXEC_PREFIX', if the compiler has been
       installed in the configured-time PREFIX.
  
!   5. The location '/usr/libexec/gcc/', but only if this is a native
       compiler.
  
!   6. The location '/usr/lib/gcc/', but only if this is a native
       compiler.
  
!   7. The macro 'MD_EXEC_PREFIX', if defined, but only if this is a
       native compiler.
  
   Here is the order of prefixes tried for startfiles:
  
!   1. Any prefixes specified by the user with '-B'.
  
!   2. The environment variable 'GCC_EXEC_PREFIX' or its automatically
       determined value based on the installed toolchain location.
  
    3. The directories specified by the environment variable
!      'LIBRARY_PATH' (or port-specific name; native only, cross compilers
!      do not use this).
  
!   4. The macro 'STANDARD_EXEC_PREFIX', but only if the toolchain is
       installed in the configured PREFIX or this is a native compiler.
  
!   5. The location '/usr/lib/gcc/', but only if this is a native
       compiler.
  
!   6. The macro 'MD_EXEC_PREFIX', if defined, but only if this is a
       native compiler.
  
!   7. The macro 'MD_STARTFILE_PREFIX', if defined, but only if this is a
       native compiler, or we have a target system root.
  
!   8. The macro 'MD_STARTFILE_PREFIX_1', if defined, but only if this is
       a native compiler, or we have a target system root.
  
!   9. The macro 'STANDARD_STARTFILE_PREFIX', with any sysroot
       modifications.  If this path is relative it will be prefixed by
!      'GCC_EXEC_PREFIX' and the machine suffix or 'STANDARD_EXEC_PREFIX'
       and the machine suffix.
  
!   10. The macro 'STANDARD_STARTFILE_PREFIX_1', but only if this is a
!      native compiler, or we have a target system root.  The default for
!      this macro is '/lib/'.
  
!   11. The macro 'STANDARD_STARTFILE_PREFIX_2', but only if this is a
!      native compiler, or we have a target system root.  The default for
!      this macro is '/usr/lib/'.
  
  
  File: gccint.info,  Node: Run-time Target,  Next: Per-Function Data,  Prev: Driver,  Up: Target Macros
*************** Here are run-time target specifications.
*** 28297,28409 ****
   -- Macro: TARGET_CPU_CPP_BUILTINS ()
       This function-like macro expands to a block of code that defines
       built-in preprocessor macros and assertions for the target CPU,
!      using the functions `builtin_define', `builtin_define_std' and
!      `builtin_assert'.  When the front end calls this macro it provides
!      a trailing semicolon, and since it has finished command line
!      option processing your code can use those results freely.
  
!      `builtin_assert' takes a string in the form you pass to the
!      command-line option `-A', such as `cpu=mips', and creates the
!      assertion.  `builtin_define' takes a string in the form accepted
!      by option `-D' and unconditionally defines the macro.
  
!      `builtin_define_std' takes a string representing the name of an
       object-like macro.  If it doesn't lie in the user's namespace,
!      `builtin_define_std' defines it unconditionally.  Otherwise, it
       defines a version with two leading underscores, and another version
       with two leading and trailing underscores, and defines the original
       only if an ISO standard was not requested on the command line.  For
!      example, passing `unix' defines `__unix', `__unix__' and possibly
!      `unix'; passing `_mips' defines `__mips', `__mips__' and possibly
!      `_mips', and passing `_ABI64' defines only `_ABI64'.
  
       You can also test for the C dialect being compiled.  The variable
!      `c_language' is set to one of `clk_c', `clk_cplusplus' or
!      `clk_objective_c'.  Note that if we are preprocessing assembler,
!      this variable will be `clk_c' but the function-like macro
!      `preprocessing_asm_p()' will return true, so you might want to
       check for that first.  If you need to check for strict ANSI, the
!      variable `flag_iso' can be used.  The function-like macro
!      `preprocessing_trad_p()' can be used to check for traditional
       preprocessing.
  
   -- Macro: TARGET_OS_CPP_BUILTINS ()
!      Similarly to `TARGET_CPU_CPP_BUILTINS' but this macro is optional
       and is used for the target operating system instead.
  
   -- Macro: TARGET_OBJFMT_CPP_BUILTINS ()
!      Similarly to `TARGET_CPU_CPP_BUILTINS' but this macro is optional
!      and is used for the target object format.  `elfos.h' uses this
!      macro to define `__ELF__', so you probably do not need to define
!      it yourself.
  
   -- Variable: extern int target_flags
!      This variable is declared in `options.h', which is included before
       any target-specific headers.
  
   -- Common Target Hook: int TARGET_DEFAULT_TARGET_FLAGS
!      This variable specifies the initial value of `target_flags'.  Its
       default setting is 0.
  
   -- Common Target Hook: bool TARGET_HANDLE_OPTION (struct gcc_options
            *OPTS, struct gcc_options *OPTS_SET, const struct
            cl_decoded_option *DECODED, location_t LOC)
       This hook is called whenever the user specifies one of the
!      target-specific options described by the `.opt' definition files
       (*note Options::).  It has the opportunity to do some
       option-specific processing and should return true if the option is
       valid.  The default definition does nothing but return true.
  
       DECODED specifies the option and its arguments.  OPTS and OPTS_SET
!      are the `gcc_options' structures to be used for storing option
       state, and LOC is the location at which the option was passed
!      (`UNKNOWN_LOCATION' except for options passed via attributes).
  
   -- C Target Hook: bool TARGET_HANDLE_C_OPTION (size_t CODE, const char
            *ARG, int VALUE)
       This target hook is called whenever the user specifies one of the
!      target-specific C language family options described by the `.opt'
       definition files(*note Options::).  It has the opportunity to do
       some option-specific processing and should return true if the
       option is valid.  The arguments are like for
!      `TARGET_HANDLE_OPTION'.  The default definition does nothing but
       return false.
  
!      In general, you should use `TARGET_HANDLE_OPTION' to handle
       options.  However, if processing an option requires routines that
!      are only available in the C (and related language) front ends,
!      then you should use `TARGET_HANDLE_C_OPTION' instead.
  
   -- C Target Hook: tree TARGET_OBJC_CONSTRUCT_STRING_OBJECT (tree
            STRING)
       Targets may provide a string object type that can be used within
!      and between C, C++ and their respective Objective-C dialects. A
       string object might, for example, embed encoding and length
!      information. These objects are considered opaque to the compiler
!      and handled as references. An ideal implementation makes the
       composition of the string object match that of the Objective-C
!      `NSString' (`NXString' for GNUStep), allowing efficient
!      interworking between C-only and Objective-C code. If a target
       implements string objects then this hook should return a reference
!      to such an object constructed from the normal `C' string
!      representation provided in STRING. At present, the hook is used by
       Objective-C only, to obtain a common-format string object when the
       target provides one.
  
   -- C Target Hook: void TARGET_OBJC_DECLARE_UNRESOLVED_CLASS_REFERENCE
            (const char *CLASSNAME)
!      Declare that Objective C class CLASSNAME is referenced  by the
       current TU.
  
!  -- C Target Hook: void TARGET_OBJC_DECLARE_CLASS_DEFINITION (const
!           char *CLASSNAME)
!      Declare that Objective C class CLASSNAME is defined  by the
!      current TU.
  
   -- C Target Hook: bool TARGET_STRING_OBJECT_REF_TYPE_P (const_tree
            STRINGREF)
       If a target implements string objects then this hook should return
!      `true' if STRINGREF is a valid reference to such an object.
  
   -- C Target Hook: void TARGET_CHECK_STRING_OBJECT_FORMAT_ARG (tree
            FORMAT_ARG, tree ARGS_LIST)
--- 27923,28035 ----
   -- Macro: TARGET_CPU_CPP_BUILTINS ()
       This function-like macro expands to a block of code that defines
       built-in preprocessor macros and assertions for the target CPU,
!      using the functions 'builtin_define', 'builtin_define_std' and
!      'builtin_assert'.  When the front end calls this macro it provides
!      a trailing semicolon, and since it has finished command line option
!      processing your code can use those results freely.
  
!      'builtin_assert' takes a string in the form you pass to the
!      command-line option '-A', such as 'cpu=mips', and creates the
!      assertion.  'builtin_define' takes a string in the form accepted by
!      option '-D' and unconditionally defines the macro.
  
!      'builtin_define_std' takes a string representing the name of an
       object-like macro.  If it doesn't lie in the user's namespace,
!      'builtin_define_std' defines it unconditionally.  Otherwise, it
       defines a version with two leading underscores, and another version
       with two leading and trailing underscores, and defines the original
       only if an ISO standard was not requested on the command line.  For
!      example, passing 'unix' defines '__unix', '__unix__' and possibly
!      'unix'; passing '_mips' defines '__mips', '__mips__' and possibly
!      '_mips', and passing '_ABI64' defines only '_ABI64'.
  
       You can also test for the C dialect being compiled.  The variable
!      'c_language' is set to one of 'clk_c', 'clk_cplusplus' or
!      'clk_objective_c'.  Note that if we are preprocessing assembler,
!      this variable will be 'clk_c' but the function-like macro
!      'preprocessing_asm_p()' will return true, so you might want to
       check for that first.  If you need to check for strict ANSI, the
!      variable 'flag_iso' can be used.  The function-like macro
!      'preprocessing_trad_p()' can be used to check for traditional
       preprocessing.
  
   -- Macro: TARGET_OS_CPP_BUILTINS ()
!      Similarly to 'TARGET_CPU_CPP_BUILTINS' but this macro is optional
       and is used for the target operating system instead.
  
   -- Macro: TARGET_OBJFMT_CPP_BUILTINS ()
!      Similarly to 'TARGET_CPU_CPP_BUILTINS' but this macro is optional
!      and is used for the target object format.  'elfos.h' uses this
!      macro to define '__ELF__', so you probably do not need to define it
!      yourself.
  
   -- Variable: extern int target_flags
!      This variable is declared in 'options.h', which is included before
       any target-specific headers.
  
   -- Common Target Hook: int TARGET_DEFAULT_TARGET_FLAGS
!      This variable specifies the initial value of 'target_flags'.  Its
       default setting is 0.
  
   -- Common Target Hook: bool TARGET_HANDLE_OPTION (struct gcc_options
            *OPTS, struct gcc_options *OPTS_SET, const struct
            cl_decoded_option *DECODED, location_t LOC)
       This hook is called whenever the user specifies one of the
!      target-specific options described by the '.opt' definition files
       (*note Options::).  It has the opportunity to do some
       option-specific processing and should return true if the option is
       valid.  The default definition does nothing but return true.
  
       DECODED specifies the option and its arguments.  OPTS and OPTS_SET
!      are the 'gcc_options' structures to be used for storing option
       state, and LOC is the location at which the option was passed
!      ('UNKNOWN_LOCATION' except for options passed via attributes).
  
   -- C Target Hook: bool TARGET_HANDLE_C_OPTION (size_t CODE, const char
            *ARG, int VALUE)
       This target hook is called whenever the user specifies one of the
!      target-specific C language family options described by the '.opt'
       definition files(*note Options::).  It has the opportunity to do
       some option-specific processing and should return true if the
       option is valid.  The arguments are like for
!      'TARGET_HANDLE_OPTION'.  The default definition does nothing but
       return false.
  
!      In general, you should use 'TARGET_HANDLE_OPTION' to handle
       options.  However, if processing an option requires routines that
!      are only available in the C (and related language) front ends, then
!      you should use 'TARGET_HANDLE_C_OPTION' instead.
  
   -- C Target Hook: tree TARGET_OBJC_CONSTRUCT_STRING_OBJECT (tree
            STRING)
       Targets may provide a string object type that can be used within
!      and between C, C++ and their respective Objective-C dialects.  A
       string object might, for example, embed encoding and length
!      information.  These objects are considered opaque to the compiler
!      and handled as references.  An ideal implementation makes the
       composition of the string object match that of the Objective-C
!      'NSString' ('NXString' for GNUStep), allowing efficient
!      interworking between C-only and Objective-C code.  If a target
       implements string objects then this hook should return a reference
!      to such an object constructed from the normal 'C' string
!      representation provided in STRING.  At present, the hook is used by
       Objective-C only, to obtain a common-format string object when the
       target provides one.
  
   -- C Target Hook: void TARGET_OBJC_DECLARE_UNRESOLVED_CLASS_REFERENCE
            (const char *CLASSNAME)
!      Declare that Objective C class CLASSNAME is referenced by the
       current TU.
  
!  -- C Target Hook: void TARGET_OBJC_DECLARE_CLASS_DEFINITION (const char
!           *CLASSNAME)
!      Declare that Objective C class CLASSNAME is defined by the current
!      TU.
  
   -- C Target Hook: bool TARGET_STRING_OBJECT_REF_TYPE_P (const_tree
            STRINGREF)
       If a target implements string objects then this hook should return
!      'true' if STRINGREF is a valid reference to such an object.
  
   -- C Target Hook: void TARGET_CHECK_STRING_OBJECT_FORMAT_ARG (tree
            FORMAT_ARG, tree ARGS_LIST)
*************** Here are run-time target specifications.
*** 28414,28461 ****
  
   -- Target Hook: void TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE (void)
       This target function is similar to the hook
!      `TARGET_OPTION_OVERRIDE' but is called when the optimize level is
       changed via an attribute or pragma or when it is reset at the end
       of the code affected by the attribute or pragma.  It is not called
!      at the beginning of compilation when `TARGET_OPTION_OVERRIDE' is
       called so if you want to perform these actions then, you should
!      have `TARGET_OPTION_OVERRIDE' call
!      `TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE'.
  
   -- Macro: C_COMMON_OVERRIDE_OPTIONS
!      This is similar to the `TARGET_OPTION_OVERRIDE' hook but is only
       used in the C language frontends (C, Objective-C, C++,
       Objective-C++) and so can be used to alter option flag variables
       which only exist in those frontends.
  
   -- Common Target Hook: const struct default_options *
! TARGET_OPTION_OPTIMIZATION_TABLE
!      Some machines may desire to change what optimizations are
!      performed for various optimization levels.   This variable, if
!      defined, describes options to enable at particular sets of
!      optimization levels.  These options are processed once just after
!      the optimization level is determined and before the remainder of
!      the command options have been parsed, so may be overridden by other
       options passed explicitly.
  
       This processing is run once at program startup and when the
!      optimization options are changed via `#pragma GCC optimize' or by
!      using the `optimize' attribute.
  
   -- Common Target Hook: void TARGET_OPTION_INIT_STRUCT (struct
            gcc_options *OPTS)
       Set target-dependent initial values of fields in OPTS.
  
   -- Common Target Hook: void TARGET_OPTION_DEFAULT_PARAMS (void)
!      Set target-dependent default values for `--param' settings, using
!      calls to `set_default_param_value'.
  
   -- Macro: SWITCHABLE_TARGET
       Some targets need to switch between substantially different
       subtargets during compilation.  For example, the MIPS target has
!      one subtarget for the traditional MIPS architecture and another
!      for MIPS16.  Source code can switch between these two
!      subarchitectures using the `mips16' and `nomips16' attributes.
  
       Such subtargets can differ in things like the set of available
       registers, the set of available instructions, the costs of various
--- 28040,28087 ----
  
   -- Target Hook: void TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE (void)
       This target function is similar to the hook
!      'TARGET_OPTION_OVERRIDE' but is called when the optimize level is
       changed via an attribute or pragma or when it is reset at the end
       of the code affected by the attribute or pragma.  It is not called
!      at the beginning of compilation when 'TARGET_OPTION_OVERRIDE' is
       called so if you want to perform these actions then, you should
!      have 'TARGET_OPTION_OVERRIDE' call
!      'TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE'.
  
   -- Macro: C_COMMON_OVERRIDE_OPTIONS
!      This is similar to the 'TARGET_OPTION_OVERRIDE' hook but is only
       used in the C language frontends (C, Objective-C, C++,
       Objective-C++) and so can be used to alter option flag variables
       which only exist in those frontends.
  
   -- Common Target Hook: const struct default_options *
!           TARGET_OPTION_OPTIMIZATION_TABLE
!      Some machines may desire to change what optimizations are performed
!      for various optimization levels.  This variable, if defined,
!      describes options to enable at particular sets of optimization
!      levels.  These options are processed once just after the
!      optimization level is determined and before the remainder of the
!      command options have been parsed, so may be overridden by other
       options passed explicitly.
  
       This processing is run once at program startup and when the
!      optimization options are changed via '#pragma GCC optimize' or by
!      using the 'optimize' attribute.
  
   -- Common Target Hook: void TARGET_OPTION_INIT_STRUCT (struct
            gcc_options *OPTS)
       Set target-dependent initial values of fields in OPTS.
  
   -- Common Target Hook: void TARGET_OPTION_DEFAULT_PARAMS (void)
!      Set target-dependent default values for '--param' settings, using
!      calls to 'set_default_param_value'.
  
   -- Macro: SWITCHABLE_TARGET
       Some targets need to switch between substantially different
       subtargets during compilation.  For example, the MIPS target has
!      one subtarget for the traditional MIPS architecture and another for
!      MIPS16.  Source code can switch between these two subarchitectures
!      using the 'mips16' and 'nomips16' attributes.
  
       Such subtargets can differ in things like the set of available
       registers, the set of available instructions, the costs of various
*************** TARGET_OPTION_OPTIMIZATION_TABLE
*** 28464,28470 ****
       subtarget takes a significant amount of time.  The compiler
       therefore provides a facility for maintaining several versions of
       the global variables and quickly switching between them; see
!      `target-globals.h' for details.
  
       Define this macro to 1 if your target needs this facility.  The
       default is 0.
--- 28090,28096 ----
       subtarget takes a significant amount of time.  The compiler
       therefore provides a facility for maintaining several versions of
       the global variables and quickly switching between them; see
!      'target-globals.h' for details.
  
       Define this macro to 1 if your target needs this facility.  The
       default is 0.
*************** TARGET_OPTION_OPTIMIZATION_TABLE
*** 28473,28480 ****
            (void)
       Returns true if the target supports IEEE 754 floating-point
       exceptions and rounding modes, false otherwise.  This is intended
!      to relate to the `float' and `double' types, but not necessarily
!      `long double'. By default, returns true if the `adddf3'
       instruction pattern is available and false otherwise, on the
       assumption that hardware floating point supports exceptions and
       rounding modes but software floating point does not.
--- 28099,28106 ----
            (void)
       Returns true if the target supports IEEE 754 floating-point
       exceptions and rounding modes, false otherwise.  This is intended
!      to relate to the 'float' and 'double' types, but not necessarily
!      'long double'.  By default, returns true if the 'adddf3'
       instruction pattern is available and false otherwise, on the
       assumption that hardware floating point supports exceptions and
       rounding modes but software floating point does not.
*************** using statics to store the information i
*** 28491,28538 ****
  nested functions, so you can be halfway through encoding one function
  when another one comes along.
  
!  GCC defines a data structure called `struct function' which contains
  all of the data specific to an individual function.  This structure
! contains a field called `machine' whose type is `struct
! machine_function *', which can be used by targets to point to their own
! specific data.
  
   If a target needs per-function specific data it should define the type
! `struct machine_function' and also the macro `INIT_EXPANDERS'.  This
  macro should be used to initialize the function pointer
! `init_machine_status'.  This pointer is explained below.
  
   One typical use of per-function, target specific data is to create an
  RTX to hold the register containing the function's return address.  This
! RTX can then be used to implement the `__builtin_return_address'
  function, for level 0.
  
   Note--earlier implementations of GCC used a single data area to hold
  all of the per-function information.  Thus when processing of a nested
  function began the old per-function data had to be pushed onto a stack,
! and when the processing was finished, it had to be popped off the
! stack.  GCC used to provide function pointers called
! `save_machine_status' and `restore_machine_status' to handle the saving
! and restoring of the target specific information.  Since the single
! data area approach is no longer used, these pointers are no longer
! supported.
  
   -- Macro: INIT_EXPANDERS
       Macro called to initialize any target specific information.  This
!      macro is called once per function, before generation of any RTL
!      has begun.  The intention of this macro is to allow the
!      initialization of the function pointer `init_machine_status'.
  
   -- Variable: void (*)(struct function *) init_machine_status
!      If this function pointer is non-`NULL' it will be called once per
       function, before function compilation starts, in order to allow the
!      target to perform any target specific initialization of the
!      `struct function' structure.  It is intended that this would be
!      used to initialize the `machine' of that structure.
  
!      `struct machine_function' structures are expected to be freed by
!      GC.  Generally, any memory that they reference must be allocated
!      by using GC allocation, including the structure itself.
  
  
  File: gccint.info,  Node: Storage Layout,  Next: Type Layout,  Prev: Per-Function Data,  Up: Target Macros
--- 28117,28162 ----
  nested functions, so you can be halfway through encoding one function
  when another one comes along.
  
!  GCC defines a data structure called 'struct function' which contains
  all of the data specific to an individual function.  This structure
! contains a field called 'machine' whose type is 'struct machine_function
! *', which can be used by targets to point to their own specific data.
  
   If a target needs per-function specific data it should define the type
! 'struct machine_function' and also the macro 'INIT_EXPANDERS'.  This
  macro should be used to initialize the function pointer
! 'init_machine_status'.  This pointer is explained below.
  
   One typical use of per-function, target specific data is to create an
  RTX to hold the register containing the function's return address.  This
! RTX can then be used to implement the '__builtin_return_address'
  function, for level 0.
  
   Note--earlier implementations of GCC used a single data area to hold
  all of the per-function information.  Thus when processing of a nested
  function began the old per-function data had to be pushed onto a stack,
! and when the processing was finished, it had to be popped off the stack.
! GCC used to provide function pointers called 'save_machine_status' and
! 'restore_machine_status' to handle the saving and restoring of the
! target specific information.  Since the single data area approach is no
! longer used, these pointers are no longer supported.
  
   -- Macro: INIT_EXPANDERS
       Macro called to initialize any target specific information.  This
!      macro is called once per function, before generation of any RTL has
!      begun.  The intention of this macro is to allow the initialization
!      of the function pointer 'init_machine_status'.
  
   -- Variable: void (*)(struct function *) init_machine_status
!      If this function pointer is non-'NULL' it will be called once per
       function, before function compilation starts, in order to allow the
!      target to perform any target specific initialization of the 'struct
!      function' structure.  It is intended that this would be used to
!      initialize the 'machine' of that structure.
  
!      'struct machine_function' structures are expected to be freed by
!      GC.  Generally, any memory that they reference must be allocated by
!      using GC allocation, including the structure itself.
  
  
  File: gccint.info,  Node: Storage Layout,  Next: Type Layout,  Prev: Per-Function Data,  Up: Target Macros
*************** File: gccint.info,  Node: Storage Layout
*** 28542,28548 ****
  
  Note that the definitions of the macros in this table which are sizes or
  alignments measured in bits do not need to be constant.  They can be C
! expressions that refer to static variables, such as the `target_flags'.
  *Note Run-time Target::.
  
   -- Macro: BITS_BIG_ENDIAN
--- 28166,28172 ----
  
  Note that the definitions of the macros in this table which are sizes or
  alignments measured in bits do not need to be constant.  They can be C
! expressions that refer to static variables, such as the 'target_flags'.
  *Note Run-time Target::.
  
   -- Macro: BITS_BIG_ENDIAN
*************** expressions that refer to static variabl
*** 28555,28561 ****
       constant.
  
       This macro does not affect the way structure fields are packed into
!      bytes or words; that is controlled by `BYTES_BIG_ENDIAN'.
  
   -- Macro: BYTES_BIG_ENDIAN
       Define this macro to have the value 1 if the most significant byte
--- 28179,28185 ----
       constant.
  
       This macro does not affect the way structure fields are packed into
!      bytes or words; that is controlled by 'BYTES_BIG_ENDIAN'.
  
   -- Macro: BYTES_BIG_ENDIAN
       Define this macro to have the value 1 if the most significant byte
*************** expressions that refer to static variabl
*** 28565,28571 ****
   -- Macro: WORDS_BIG_ENDIAN
       Define this macro to have the value 1 if, in a multiword object,
       the most significant word has the lowest number.  This applies to
!      both memory locations and registers; see `REG_WORDS_BIG_ENDIAN' if
       the order of words in memory is not the same as the order in
       registers.  This macro need not be a constant.
  
--- 28189,28195 ----
   -- Macro: WORDS_BIG_ENDIAN
       Define this macro to have the value 1 if, in a multiword object,
       the most significant word has the lowest number.  This applies to
!      both memory locations and registers; see 'REG_WORDS_BIG_ENDIAN' if
       the order of words in memory is not the same as the order in
       registers.  This macro need not be a constant.
  
*************** expressions that refer to static variabl
*** 28573,28583 ****
       On some machines, the order of words in a multiword object differs
       between registers in memory.  In such a situation, define this
       macro to describe the order of words in a register.  The macro
!      `WORDS_BIG_ENDIAN' controls the order of words in memory.
  
   -- Macro: FLOAT_WORDS_BIG_ENDIAN
!      Define this macro to have the value 1 if `DFmode', `XFmode' or
!      `TFmode' floating point numbers are stored in memory with the word
       containing the sign bit at the lowest address; otherwise define it
       to have the value 0.  This macro need not be a constant.
  
--- 28197,28207 ----
       On some machines, the order of words in a multiword object differs
       between registers in memory.  In such a situation, define this
       macro to describe the order of words in a register.  The macro
!      'WORDS_BIG_ENDIAN' controls the order of words in memory.
  
   -- Macro: FLOAT_WORDS_BIG_ENDIAN
!      Define this macro to have the value 1 if 'DFmode', 'XFmode' or
!      'TFmode' floating point numbers are stored in memory with the word
       containing the sign bit at the lowest address; otherwise define it
       to have the value 0.  This macro need not be a constant.
  
*************** expressions that refer to static variabl
*** 28586,28597 ****
  
   -- Macro: BITS_PER_WORD
       Number of bits in a word.  If you do not define this macro, the
!      default is `BITS_PER_UNIT * UNITS_PER_WORD'.
  
   -- Macro: MAX_BITS_PER_WORD
       Maximum number of bits in a word.  If this is undefined, the
!      default is `BITS_PER_WORD'.  Otherwise, it is the constant value
!      that is the largest value that `BITS_PER_WORD' can have at
       run-time.
  
   -- Macro: UNITS_PER_WORD
--- 28210,28221 ----
  
   -- Macro: BITS_PER_WORD
       Number of bits in a word.  If you do not define this macro, the
!      default is 'BITS_PER_UNIT * UNITS_PER_WORD'.
  
   -- Macro: MAX_BITS_PER_WORD
       Maximum number of bits in a word.  If this is undefined, the
!      default is 'BITS_PER_WORD'.  Otherwise, it is the constant value
!      that is the largest value that 'BITS_PER_WORD' can have at
       run-time.
  
   -- Macro: UNITS_PER_WORD
*************** expressions that refer to static variabl
*** 28600,28636 ****
  
   -- Macro: MIN_UNITS_PER_WORD
       Minimum number of units in a word.  If this is undefined, the
!      default is `UNITS_PER_WORD'.  Otherwise, it is the constant value
!      that is the smallest value that `UNITS_PER_WORD' can have at
       run-time.
  
   -- Macro: POINTER_SIZE
       Width of a pointer, in bits.  You must specify a value no wider
!      than the width of `Pmode'.  If it is not equal to the width of
!      `Pmode', you must define `POINTERS_EXTEND_UNSIGNED'.  If you do
!      not specify a value the default is `BITS_PER_WORD'.
  
   -- Macro: POINTERS_EXTEND_UNSIGNED
       A C expression that determines how pointers should be extended from
!      `ptr_mode' to either `Pmode' or `word_mode'.  It is greater than
       zero if pointers should be zero-extended, zero if they should be
       sign-extended, and negative if some other sort of conversion is
       needed.  In the last case, the extension is done by the target's
!      `ptr_extend' instruction.
  
!      You need not define this macro if the `ptr_mode', `Pmode' and
!      `word_mode' are all the same width.
  
   -- Macro: PROMOTE_MODE (M, UNSIGNEDP, TYPE)
!      A macro to update M and UNSIGNEDP when an object whose type is
!      TYPE and which has the specified mode and signedness is to be
!      stored in a register.  This macro is only called when TYPE is a
!      scalar type.
  
!      On most RISC machines, which only have operations that operate on
!      a full register, define this macro to set M to `word_mode' if M is
!      an integer mode narrower than `BITS_PER_WORD'.  In most cases,
!      only integer modes should be widened because wider-precision
       floating-point operations are usually more expensive than their
       narrower counterparts.
  
--- 28224,28259 ----
  
   -- Macro: MIN_UNITS_PER_WORD
       Minimum number of units in a word.  If this is undefined, the
!      default is 'UNITS_PER_WORD'.  Otherwise, it is the constant value
!      that is the smallest value that 'UNITS_PER_WORD' can have at
       run-time.
  
   -- Macro: POINTER_SIZE
       Width of a pointer, in bits.  You must specify a value no wider
!      than the width of 'Pmode'.  If it is not equal to the width of
!      'Pmode', you must define 'POINTERS_EXTEND_UNSIGNED'.  If you do not
!      specify a value the default is 'BITS_PER_WORD'.
  
   -- Macro: POINTERS_EXTEND_UNSIGNED
       A C expression that determines how pointers should be extended from
!      'ptr_mode' to either 'Pmode' or 'word_mode'.  It is greater than
       zero if pointers should be zero-extended, zero if they should be
       sign-extended, and negative if some other sort of conversion is
       needed.  In the last case, the extension is done by the target's
!      'ptr_extend' instruction.
  
!      You need not define this macro if the 'ptr_mode', 'Pmode' and
!      'word_mode' are all the same width.
  
   -- Macro: PROMOTE_MODE (M, UNSIGNEDP, TYPE)
!      A macro to update M and UNSIGNEDP when an object whose type is TYPE
!      and which has the specified mode and signedness is to be stored in
!      a register.  This macro is only called when TYPE is a scalar type.
  
!      On most RISC machines, which only have operations that operate on a
!      full register, define this macro to set M to 'word_mode' if M is an
!      integer mode narrower than 'BITS_PER_WORD'.  In most cases, only
!      integer modes should be widened because wider-precision
       floating-point operations are usually more expensive than their
       narrower counterparts.
  
*************** expressions that refer to static variabl
*** 28647,28672 ****
   -- Target Hook: machine_mode TARGET_PROMOTE_FUNCTION_MODE (const_tree
            TYPE, machine_mode MODE, int *PUNSIGNEDP, const_tree FUNTYPE,
            int FOR_RETURN)
!      Like `PROMOTE_MODE', but it is applied to outgoing function
!      arguments or function return values.  The target hook should
!      return the new mode and possibly change `*PUNSIGNEDP' if the
!      promotion should change signedness.  This function is called only
!      for scalar _or pointer_ types.
  
       FOR_RETURN allows to distinguish the promotion of arguments and
!      return values.  If it is `1', a return value is being promoted and
!      `TARGET_FUNCTION_VALUE' must perform the same promotions done here.
!      If it is `2', the returned mode should be that of the register in
       which an incoming parameter is copied, or the outgoing result is
       computed; then the hook should return the same mode as
!      `promote_mode', though the signedness may be different.
  
       TYPE can be NULL when promoting function arguments of libcalls.
  
       The default is to not promote arguments and return values.  You can
       also define the hook to
!      `default_promote_function_mode_always_promote' if you would like
!      to apply the same rules given by `PROMOTE_MODE'.
  
   -- Macro: PARM_BOUNDARY
       Normal alignment required for function parameters on the stack, in
--- 28270,28295 ----
   -- Target Hook: machine_mode TARGET_PROMOTE_FUNCTION_MODE (const_tree
            TYPE, machine_mode MODE, int *PUNSIGNEDP, const_tree FUNTYPE,
            int FOR_RETURN)
!      Like 'PROMOTE_MODE', but it is applied to outgoing function
!      arguments or function return values.  The target hook should return
!      the new mode and possibly change '*PUNSIGNEDP' if the promotion
!      should change signedness.  This function is called only for scalar
!      _or pointer_ types.
  
       FOR_RETURN allows to distinguish the promotion of arguments and
!      return values.  If it is '1', a return value is being promoted and
!      'TARGET_FUNCTION_VALUE' must perform the same promotions done here.
!      If it is '2', the returned mode should be that of the register in
       which an incoming parameter is copied, or the outgoing result is
       computed; then the hook should return the same mode as
!      'promote_mode', though the signedness may be different.
  
       TYPE can be NULL when promoting function arguments of libcalls.
  
       The default is to not promote arguments and return values.  You can
       also define the hook to
!      'default_promote_function_mode_always_promote' if you would like to
!      apply the same rules given by 'PROMOTE_MODE'.
  
   -- Macro: PARM_BOUNDARY
       Normal alignment required for function parameters on the stack, in
*************** expressions that refer to static variabl
*** 28675,28698 ****
       size of an integer.
  
   -- Macro: STACK_BOUNDARY
!      Define this macro to the minimum alignment enforced by hardware
!      for the stack pointer on this machine.  The definition is a C
       expression for the desired alignment (measured in bits).  This
!      value is used as a default if `PREFERRED_STACK_BOUNDARY' is not
       defined.  On most machines, this should be the same as
!      `PARM_BOUNDARY'.
  
   -- Macro: PREFERRED_STACK_BOUNDARY
       Define this macro if you wish to preserve a certain alignment for
       the stack pointer, greater than what the hardware enforces.  The
!      definition is a C expression for the desired alignment (measured
!      in bits).  This macro must evaluate to a value equal to or larger
!      than `STACK_BOUNDARY'.
  
   -- Macro: INCOMING_STACK_BOUNDARY
       Define this macro if the incoming stack boundary may be different
!      from `PREFERRED_STACK_BOUNDARY'.  This macro must evaluate to a
!      value equal to or larger than `STACK_BOUNDARY'.
  
   -- Macro: FUNCTION_BOUNDARY
       Alignment required for a function entry point, in bits.
--- 28298,28321 ----
       size of an integer.
  
   -- Macro: STACK_BOUNDARY
!      Define this macro to the minimum alignment enforced by hardware for
!      the stack pointer on this machine.  The definition is a C
       expression for the desired alignment (measured in bits).  This
!      value is used as a default if 'PREFERRED_STACK_BOUNDARY' is not
       defined.  On most machines, this should be the same as
!      'PARM_BOUNDARY'.
  
   -- Macro: PREFERRED_STACK_BOUNDARY
       Define this macro if you wish to preserve a certain alignment for
       the stack pointer, greater than what the hardware enforces.  The
!      definition is a C expression for the desired alignment (measured in
!      bits).  This macro must evaluate to a value equal to or larger than
!      'STACK_BOUNDARY'.
  
   -- Macro: INCOMING_STACK_BOUNDARY
       Define this macro if the incoming stack boundary may be different
!      from 'PREFERRED_STACK_BOUNDARY'.  This macro must evaluate to a
!      value equal to or larger than 'STACK_BOUNDARY'.
  
   -- Macro: FUNCTION_BOUNDARY
       Alignment required for a function entry point, in bits.
*************** expressions that refer to static variabl
*** 28706,28777 ****
   -- Target Hook: HOST_WIDE_INT TARGET_ABSOLUTE_BIGGEST_ALIGNMENT
       If defined, this target hook specifies the absolute biggest
       alignment that a type or variable can have on this machine,
!      otherwise, `BIGGEST_ALIGNMENT' is used.
  
   -- Macro: MALLOC_ABI_ALIGNMENT
       Alignment, in bits, a C conformant malloc implementation has to
!      provide.  If not defined, the default value is `BITS_PER_WORD'.
  
   -- Macro: ATTRIBUTE_ALIGNED_VALUE
!      Alignment used by the `__attribute__ ((aligned))' construct.  If
!      not defined, the default value is `BIGGEST_ALIGNMENT'.
  
   -- Macro: MINIMUM_ATOMIC_ALIGNMENT
       If defined, the smallest alignment, in bits, that can be given to
       an object that can be referenced in one operation, without
!      disturbing any nearby object.  Normally, this is `BITS_PER_UNIT',
       but may be larger on machines that don't have byte or half-word
       store operations.
  
   -- Macro: BIGGEST_FIELD_ALIGNMENT
       Biggest alignment that any structure or union field can require on
       this machine, in bits.  If defined, this overrides
!      `BIGGEST_ALIGNMENT' for structure and union fields only, unless
!      the field alignment has been set by the `__attribute__ ((aligned
!      (N)))' construct.
  
   -- Macro: ADJUST_FIELD_ALIGN (FIELD, COMPUTED)
       An expression for the alignment of a structure field FIELD if the
       alignment computed in the usual way (including applying of
!      `BIGGEST_ALIGNMENT' and `BIGGEST_FIELD_ALIGNMENT' to the
!      alignment) is COMPUTED.  It overrides alignment only if the field
!      alignment has not been set by the `__attribute__ ((aligned (N)))'
!      construct.
  
   -- Macro: MAX_STACK_ALIGNMENT
       Biggest stack alignment guaranteed by the backend.  Use this macro
       to specify the maximum alignment of a variable on stack.
  
!      If not defined, the default value is `STACK_BOUNDARY'.
! 
  
   -- Macro: MAX_OFILE_ALIGNMENT
       Biggest alignment supported by the object file format of this
       machine.  Use this macro to limit the alignment which can be
!      specified using the `__attribute__ ((aligned (N)))' construct.  If
!      not defined, the default value is `BIGGEST_ALIGNMENT'.
  
!      On systems that use ELF, the default (in `config/elfos.h') is the
       largest supported 32-bit ELF section alignment representable on a
!      32-bit host e.g. `(((uint64_t) 1 << 28) * 8)'.  On 32-bit ELF the
!      largest supported section alignment in bits is `(0x80000000 * 8)',
       but this is not representable on 32-bit hosts.
  
   -- Macro: DATA_ALIGNMENT (TYPE, BASIC-ALIGN)
       If defined, a C expression to compute the alignment for a variable
!      in the static store.  TYPE is the data type, and BASIC-ALIGN is
!      the alignment that the object would ordinarily have.  The value of
!      this macro is used instead of that alignment to align the object.
  
       If this macro is not defined, then BASIC-ALIGN is used.
  
       One use of this macro is to increase alignment of medium-size data
       to make it all fit in fewer cache lines.  Another is to cause
!      character arrays to be word-aligned so that `strcpy' calls that
       copy constants to character arrays can be done inline.
  
   -- Macro: DATA_ABI_ALIGNMENT (TYPE, BASIC-ALIGN)
!      Similar to `DATA_ALIGNMENT', but for the cases where the ABI
       mandates some alignment increase, instead of optimization only
       purposes.  E.g. AMD x86-64 psABI says that variables with array
       type larger than 15 bytes must be aligned to 16 byte boundaries.
--- 28329,28398 ----
   -- Target Hook: HOST_WIDE_INT TARGET_ABSOLUTE_BIGGEST_ALIGNMENT
       If defined, this target hook specifies the absolute biggest
       alignment that a type or variable can have on this machine,
!      otherwise, 'BIGGEST_ALIGNMENT' is used.
  
   -- Macro: MALLOC_ABI_ALIGNMENT
       Alignment, in bits, a C conformant malloc implementation has to
!      provide.  If not defined, the default value is 'BITS_PER_WORD'.
  
   -- Macro: ATTRIBUTE_ALIGNED_VALUE
!      Alignment used by the '__attribute__ ((aligned))' construct.  If
!      not defined, the default value is 'BIGGEST_ALIGNMENT'.
  
   -- Macro: MINIMUM_ATOMIC_ALIGNMENT
       If defined, the smallest alignment, in bits, that can be given to
       an object that can be referenced in one operation, without
!      disturbing any nearby object.  Normally, this is 'BITS_PER_UNIT',
       but may be larger on machines that don't have byte or half-word
       store operations.
  
   -- Macro: BIGGEST_FIELD_ALIGNMENT
       Biggest alignment that any structure or union field can require on
       this machine, in bits.  If defined, this overrides
!      'BIGGEST_ALIGNMENT' for structure and union fields only, unless the
!      field alignment has been set by the '__attribute__ ((aligned (N)))'
!      construct.
  
   -- Macro: ADJUST_FIELD_ALIGN (FIELD, COMPUTED)
       An expression for the alignment of a structure field FIELD if the
       alignment computed in the usual way (including applying of
!      'BIGGEST_ALIGNMENT' and 'BIGGEST_FIELD_ALIGNMENT' to the alignment)
!      is COMPUTED.  It overrides alignment only if the field alignment
!      has not been set by the '__attribute__ ((aligned (N)))' construct.
  
   -- Macro: MAX_STACK_ALIGNMENT
       Biggest stack alignment guaranteed by the backend.  Use this macro
       to specify the maximum alignment of a variable on stack.
  
!      If not defined, the default value is 'STACK_BOUNDARY'.
  
   -- Macro: MAX_OFILE_ALIGNMENT
       Biggest alignment supported by the object file format of this
       machine.  Use this macro to limit the alignment which can be
!      specified using the '__attribute__ ((aligned (N)))' construct.  If
!      not defined, the default value is 'BIGGEST_ALIGNMENT'.
  
!      On systems that use ELF, the default (in 'config/elfos.h') is the
       largest supported 32-bit ELF section alignment representable on a
!      32-bit host e.g.  '(((uint64_t) 1 << 28) * 8)'.  On 32-bit ELF the
!      largest supported section alignment in bits is '(0x80000000 * 8)',
       but this is not representable on 32-bit hosts.
  
   -- Macro: DATA_ALIGNMENT (TYPE, BASIC-ALIGN)
       If defined, a C expression to compute the alignment for a variable
!      in the static store.  TYPE is the data type, and BASIC-ALIGN is the
!      alignment that the object would ordinarily have.  The value of this
!      macro is used instead of that alignment to align the object.
  
       If this macro is not defined, then BASIC-ALIGN is used.
  
       One use of this macro is to increase alignment of medium-size data
       to make it all fit in fewer cache lines.  Another is to cause
!      character arrays to be word-aligned so that 'strcpy' calls that
       copy constants to character arrays can be done inline.
  
   -- Macro: DATA_ABI_ALIGNMENT (TYPE, BASIC-ALIGN)
!      Similar to 'DATA_ALIGNMENT', but for the cases where the ABI
       mandates some alignment increase, instead of optimization only
       purposes.  E.g. AMD x86-64 psABI says that variables with array
       type larger than 15 bytes must be aligned to 16 byte boundaries.
*************** expressions that refer to static variabl
*** 28788,28794 ****
       If this macro is not defined, then BASIC-ALIGN is used.
  
       The typical use of this macro is to increase alignment for string
!      constants to be word aligned so that `strcpy' calls that copy
       constants can be done inline.
  
   -- Macro: LOCAL_ALIGNMENT (TYPE, BASIC-ALIGN)
--- 28409,28415 ----
       If this macro is not defined, then BASIC-ALIGN is used.
  
       The typical use of this macro is to increase alignment for string
!      constants to be word aligned so that 'strcpy' calls that copy
       constants can be done inline.
  
   -- Macro: LOCAL_ALIGNMENT (TYPE, BASIC-ALIGN)
*************** expressions that refer to static variabl
*** 28807,28816 ****
  
   -- Target Hook: HOST_WIDE_INT TARGET_VECTOR_ALIGNMENT (const_tree TYPE)
       This hook can be used to define the alignment for a vector of type
!      TYPE, in order to comply with a platform ABI.  The default is to
!      require natural alignment for vector types.  The alignment
!      returned by this hook must be a power-of-two multiple of the
!      default alignment of the vector element type.
  
   -- Macro: STACK_SLOT_ALIGNMENT (TYPE, MODE, BASIC-ALIGN)
       If defined, a C expression to compute the alignment for stack slot.
--- 28428,28437 ----
  
   -- Target Hook: HOST_WIDE_INT TARGET_VECTOR_ALIGNMENT (const_tree TYPE)
       This hook can be used to define the alignment for a vector of type
!      TYPE, in order to comply with a platform ABI. The default is to
!      require natural alignment for vector types.  The alignment returned
!      by this hook must be a power-of-two multiple of the default
!      alignment of the vector element type.
  
   -- Macro: STACK_SLOT_ALIGNMENT (TYPE, MODE, BASIC-ALIGN)
       If defined, a C expression to compute the alignment for stack slot.
*************** expressions that refer to static variabl
*** 28819,28826 ****
       The value of this macro is used instead of that alignment to align
       the slot.
  
!      If this macro is not defined, then BASIC-ALIGN is used when TYPE
!      is `NULL'.  Otherwise, `LOCAL_ALIGNMENT' will be used.
  
       This macro is to set alignment of stack slot to the maximum
       alignment of all possible modes which the slot may have.
--- 28440,28447 ----
       The value of this macro is used instead of that alignment to align
       the slot.
  
!      If this macro is not defined, then BASIC-ALIGN is used when TYPE is
!      'NULL'.  Otherwise, 'LOCAL_ALIGNMENT' will be used.
  
       This macro is to set alignment of stack slot to the maximum
       alignment of all possible modes which the slot may have.
*************** expressions that refer to static variabl
*** 28832,28838 ****
       If defined, a C expression to compute the alignment for a local
       variable DECL.
  
!      If this macro is not defined, then `LOCAL_ALIGNMENT (TREE_TYPE
       (DECL), DECL_ALIGN (DECL))' is used.
  
       One use of this macro is to increase alignment of medium-size data
--- 28453,28459 ----
       If defined, a C expression to compute the alignment for a local
       variable DECL.
  
!      If this macro is not defined, then 'LOCAL_ALIGNMENT (TREE_TYPE
       (DECL), DECL_ALIGN (DECL))' is used.
  
       One use of this macro is to increase alignment of medium-size data
*************** expressions that refer to static variabl
*** 28843,28858 ****
  
   -- Macro: MINIMUM_ALIGNMENT (EXP, MODE, ALIGN)
       If defined, a C expression to compute the minimum required
!      alignment for dynamic stack realignment purposes for EXP (a type
!      or decl), MODE, assuming normal alignment ALIGN.
  
       If this macro is not defined, then ALIGN will be used.
  
   -- Macro: EMPTY_FIELD_BOUNDARY
!      Alignment in bits to be given to a structure bit-field that
!      follows an empty field such as `int : 0;'.
  
!      If `PCC_BITFIELD_TYPE_MATTERS' is true, it overrides this macro.
  
   -- Macro: STRUCTURE_SIZE_BOUNDARY
       Number of bits which any structure or union's size must be a
--- 28464,28479 ----
  
   -- Macro: MINIMUM_ALIGNMENT (EXP, MODE, ALIGN)
       If defined, a C expression to compute the minimum required
!      alignment for dynamic stack realignment purposes for EXP (a type or
!      decl), MODE, assuming normal alignment ALIGN.
  
       If this macro is not defined, then ALIGN will be used.
  
   -- Macro: EMPTY_FIELD_BOUNDARY
!      Alignment in bits to be given to a structure bit-field that follows
!      an empty field such as 'int : 0;'.
  
!      If 'PCC_BITFIELD_TYPE_MATTERS' is true, it overrides this macro.
  
   -- Macro: STRUCTURE_SIZE_BOUNDARY
       Number of bits which any structure or union's size must be a
*************** expressions that refer to static variabl
*** 28860,28866 ****
       multiple of this.
  
       If you do not define this macro, the default is the same as
!      `BITS_PER_UNIT'.
  
   -- Macro: STRICT_ALIGNMENT
       Define this macro to be the value 1 if instructions will fail to
--- 28481,28487 ----
       multiple of this.
  
       If you do not define this macro, the default is the same as
!      'BITS_PER_UNIT'.
  
   -- Macro: STRICT_ALIGNMENT
       Define this macro to be the value 1 if instructions will fail to
*************** expressions that refer to static variabl
*** 28872,28886 ****
       handle alignment of bit-fields and the structures that contain
       them.
  
!      The behavior is that the type written for a named bit-field (`int',
!      `short', or other integer type) imposes an alignment for the entire
!      structure, as if the structure really did contain an ordinary
!      field of that type.  In addition, the bit-field is placed within
!      the structure so that it would fit within such a field, not
!      crossing a boundary for it.
  
       Thus, on most machines, a named bit-field whose type is written as
!      `int' would not cross a four-byte boundary, and would force
       four-byte alignment for the whole structure.  (The alignment used
       may not be four bytes; it is controlled by the other alignment
       parameters.)
--- 28493,28507 ----
       handle alignment of bit-fields and the structures that contain
       them.
  
!      The behavior is that the type written for a named bit-field ('int',
!      'short', or other integer type) imposes an alignment for the entire
!      structure, as if the structure really did contain an ordinary field
!      of that type.  In addition, the bit-field is placed within the
!      structure so that it would fit within such a field, not crossing a
!      boundary for it.
  
       Thus, on most machines, a named bit-field whose type is written as
!      'int' would not cross a four-byte boundary, and would force
       four-byte alignment for the whole structure.  (The alignment used
       may not be four bytes; it is controlled by the other alignment
       parameters.)
*************** expressions that refer to static variabl
*** 28888,28908 ****
       An unnamed bit-field will not affect the alignment of the
       containing structure.
  
!      If the macro is defined, its definition should be a C expression;
!      a nonzero value for the expression enables this behavior.
  
       Note that if this macro is not defined, or its value is zero, some
       bit-fields may cross more than one alignment boundary.  The
!      compiler can support such references if there are `insv', `extv',
!      and `extzv' insns that can directly reference memory.
  
       The other known way of making bit-fields work is to define
!      `STRUCTURE_SIZE_BOUNDARY' as large as `BIGGEST_ALIGNMENT'.  Then
       every structure can be accessed with fullwords.
  
       Unless the machine has bit-field instructions or you define
!      `STRUCTURE_SIZE_BOUNDARY' that way, you must define
!      `PCC_BITFIELD_TYPE_MATTERS' to have a nonzero value.
  
       If your aim is to make GCC use the same conventions for laying out
       bit-fields as are used by another compiler, here is how to
--- 28509,28529 ----
       An unnamed bit-field will not affect the alignment of the
       containing structure.
  
!      If the macro is defined, its definition should be a C expression; a
!      nonzero value for the expression enables this behavior.
  
       Note that if this macro is not defined, or its value is zero, some
       bit-fields may cross more than one alignment boundary.  The
!      compiler can support such references if there are 'insv', 'extv',
!      and 'extzv' insns that can directly reference memory.
  
       The other known way of making bit-fields work is to define
!      'STRUCTURE_SIZE_BOUNDARY' as large as 'BIGGEST_ALIGNMENT'.  Then
       every structure can be accessed with fullwords.
  
       Unless the machine has bit-field instructions or you define
!      'STRUCTURE_SIZE_BOUNDARY' that way, you must define
!      'PCC_BITFIELD_TYPE_MATTERS' to have a nonzero value.
  
       If your aim is to make GCC use the same conventions for laying out
       bit-fields as are used by another compiler, here is how to
*************** expressions that refer to static variabl
*** 28933,28962 ****
            }
  
       If this prints 2 and 5, then the compiler's behavior is what you
!      would get from `PCC_BITFIELD_TYPE_MATTERS'.
  
   -- Macro: BITFIELD_NBYTES_LIMITED
!      Like `PCC_BITFIELD_TYPE_MATTERS' except that its effect is limited
       to aligning a bit-field within the structure.
  
   -- Target Hook: bool TARGET_ALIGN_ANON_BITFIELD (void)
!      When `PCC_BITFIELD_TYPE_MATTERS' is true this hook will determine
       whether unnamed bitfields affect the alignment of the containing
       structure.  The hook should return true if the structure should
       inherit the alignment requirements of an unnamed bitfield's type.
  
   -- Target Hook: bool TARGET_NARROW_VOLATILE_BITFIELD (void)
!      This target hook should return `true' if accesses to volatile
!      bitfields should use the narrowest mode possible.  It should
!      return `false' if these accesses should use the bitfield container
!      type.
  
!      The default is `false'.
  
   -- Target Hook: bool TARGET_MEMBER_TYPE_FORCES_BLK (const_tree FIELD,
            machine_mode MODE)
       Return true if a structure, union or array containing FIELD should
!      be accessed using `BLKMODE'.
  
       If FIELD is the only field in the structure, MODE is its mode,
       otherwise MODE is VOIDmode.  MODE is provided in the case where
--- 28554,28582 ----
            }
  
       If this prints 2 and 5, then the compiler's behavior is what you
!      would get from 'PCC_BITFIELD_TYPE_MATTERS'.
  
   -- Macro: BITFIELD_NBYTES_LIMITED
!      Like 'PCC_BITFIELD_TYPE_MATTERS' except that its effect is limited
       to aligning a bit-field within the structure.
  
   -- Target Hook: bool TARGET_ALIGN_ANON_BITFIELD (void)
!      When 'PCC_BITFIELD_TYPE_MATTERS' is true this hook will determine
       whether unnamed bitfields affect the alignment of the containing
       structure.  The hook should return true if the structure should
       inherit the alignment requirements of an unnamed bitfield's type.
  
   -- Target Hook: bool TARGET_NARROW_VOLATILE_BITFIELD (void)
!      This target hook should return 'true' if accesses to volatile
!      bitfields should use the narrowest mode possible.  It should return
!      'false' if these accesses should use the bitfield container type.
  
!      The default is 'false'.
  
   -- Target Hook: bool TARGET_MEMBER_TYPE_FORCES_BLK (const_tree FIELD,
            machine_mode MODE)
       Return true if a structure, union or array containing FIELD should
!      be accessed using 'BLKMODE'.
  
       If FIELD is the only field in the structure, MODE is its mode,
       otherwise MODE is VOIDmode.  MODE is provided in the case where
*************** expressions that refer to static variabl
*** 28971,29025 ****
       usual way is COMPUTED and the alignment explicitly specified was
       SPECIFIED.
  
!      The default is to use SPECIFIED if it is larger; otherwise, use
!      the smaller of COMPUTED and `BIGGEST_ALIGNMENT'
  
   -- Macro: MAX_FIXED_MODE_SIZE
       An integer expression for the size in bits of the largest integer
       machine mode that should actually be used.  All integer machine
!      modes of this size or smaller can be used for structures and
!      unions with the appropriate sizes.  If this macro is undefined,
!      `GET_MODE_BITSIZE (DImode)' is assumed.
  
   -- Macro: STACK_SAVEAREA_MODE (SAVE_LEVEL)
!      If defined, an expression of type `machine_mode' that specifies
!      the mode of the save area operand of a `save_stack_LEVEL' named
!      pattern (*note Standard Names::).  SAVE_LEVEL is one of
!      `SAVE_BLOCK', `SAVE_FUNCTION', or `SAVE_NONLOCAL' and selects
!      which of the three named patterns is having its mode specified.
  
!      You need not define this macro if it always returns `Pmode'.  You
!      would most commonly define this macro if the `save_stack_LEVEL'
       patterns need to support both a 32- and a 64-bit mode.
  
   -- Macro: STACK_SIZE_MODE
!      If defined, an expression of type `machine_mode' that specifies
!      the mode of the size increment operand of an `allocate_stack'
!      named pattern (*note Standard Names::).
  
!      You need not define this macro if it always returns `word_mode'.
!      You would most commonly define this macro if the `allocate_stack'
       pattern needs to support both a 32- and a 64-bit mode.
  
   -- Target Hook: machine_mode TARGET_LIBGCC_CMP_RETURN_MODE (void)
       This target hook should return the mode to be used for the return
       value of compare instructions expanded to libgcc calls.  If not
!      defined `word_mode' is returned which is the right choice for a
       majority of targets.
  
   -- Target Hook: machine_mode TARGET_LIBGCC_SHIFT_COUNT_MODE (void)
       This target hook should return the mode to be used for the shift
       count operand of shift instructions expanded to libgcc calls.  If
!      not defined `word_mode' is returned which is the right choice for
!      a majority of targets.
  
   -- Target Hook: machine_mode TARGET_UNWIND_WORD_MODE (void)
!      Return machine mode to be used for `_Unwind_Word' type.  The
!      default is to use `word_mode'.
  
   -- Target Hook: bool TARGET_MS_BITFIELD_LAYOUT_P (const_tree
            RECORD_TYPE)
!      This target hook returns `true' if bit-fields in the given
       RECORD_TYPE are to be laid out following the rules of Microsoft
       Visual C/C++, namely: (i) a bit-field won't share the same storage
       unit with the previous bit-field if their underlying types have
--- 28591,28645 ----
       usual way is COMPUTED and the alignment explicitly specified was
       SPECIFIED.
  
!      The default is to use SPECIFIED if it is larger; otherwise, use the
!      smaller of COMPUTED and 'BIGGEST_ALIGNMENT'
  
   -- Macro: MAX_FIXED_MODE_SIZE
       An integer expression for the size in bits of the largest integer
       machine mode that should actually be used.  All integer machine
!      modes of this size or smaller can be used for structures and unions
!      with the appropriate sizes.  If this macro is undefined,
!      'GET_MODE_BITSIZE (DImode)' is assumed.
  
   -- Macro: STACK_SAVEAREA_MODE (SAVE_LEVEL)
!      If defined, an expression of type 'machine_mode' that specifies the
!      mode of the save area operand of a 'save_stack_LEVEL' named pattern
!      (*note Standard Names::).  SAVE_LEVEL is one of 'SAVE_BLOCK',
!      'SAVE_FUNCTION', or 'SAVE_NONLOCAL' and selects which of the three
!      named patterns is having its mode specified.
  
!      You need not define this macro if it always returns 'Pmode'.  You
!      would most commonly define this macro if the 'save_stack_LEVEL'
       patterns need to support both a 32- and a 64-bit mode.
  
   -- Macro: STACK_SIZE_MODE
!      If defined, an expression of type 'machine_mode' that specifies the
!      mode of the size increment operand of an 'allocate_stack' named
!      pattern (*note Standard Names::).
  
!      You need not define this macro if it always returns 'word_mode'.
!      You would most commonly define this macro if the 'allocate_stack'
       pattern needs to support both a 32- and a 64-bit mode.
  
   -- Target Hook: machine_mode TARGET_LIBGCC_CMP_RETURN_MODE (void)
       This target hook should return the mode to be used for the return
       value of compare instructions expanded to libgcc calls.  If not
!      defined 'word_mode' is returned which is the right choice for a
       majority of targets.
  
   -- Target Hook: machine_mode TARGET_LIBGCC_SHIFT_COUNT_MODE (void)
       This target hook should return the mode to be used for the shift
       count operand of shift instructions expanded to libgcc calls.  If
!      not defined 'word_mode' is returned which is the right choice for a
!      majority of targets.
  
   -- Target Hook: machine_mode TARGET_UNWIND_WORD_MODE (void)
!      Return machine mode to be used for '_Unwind_Word' type.  The
!      default is to use 'word_mode'.
  
   -- Target Hook: bool TARGET_MS_BITFIELD_LAYOUT_P (const_tree
            RECORD_TYPE)
!      This target hook returns 'true' if bit-fields in the given
       RECORD_TYPE are to be laid out following the rules of Microsoft
       Visual C/C++, namely: (i) a bit-field won't share the same storage
       unit with the previous bit-field if their underlying types have
*************** expressions that refer to static variabl
*** 29028,29034 ****
       bit-field; (ii) a zero-sized bit-field will affect the alignment of
       the whole enclosing structure, even if it is unnamed; except that
       (iii) a zero-sized bit-field will be disregarded unless it follows
!      another bit-field of nonzero size.  If this hook returns `true',
       other macros that control bit-field layout are ignored.
  
       When a bit-field is inserted into a packed record, the whole size
--- 28648,28654 ----
       bit-field; (ii) a zero-sized bit-field will affect the alignment of
       the whole enclosing structure, even if it is unnamed; except that
       (iii) a zero-sized bit-field will be disregarded unless it follows
!      another bit-field of nonzero size.  If this hook returns 'true',
       other macros that control bit-field layout are ignored.
  
       When a bit-field is inserted into a packed record, the whole size
*************** expressions that refer to static variabl
*** 29039,29046 ****
       of that size is allocated).  In an unpacked record, this is the
       same as using alignment, but not equivalent when packing.
  
!      If both MS bit-fields and `__attribute__((packed))' are used, the
!      latter will take precedence.  If `__attribute__((packed))' is used
       on a single field when MS bit-fields are in use, it will take
       precedence for that field, but the alignment of the rest of the
       structure may affect its placement.
--- 28659,28666 ----
       of that size is allocated).  In an unpacked record, this is the
       same as using alignment, but not equivalent when packing.
  
!      If both MS bit-fields and '__attribute__((packed))' are used, the
!      latter will take precedence.  If '__attribute__((packed))' is used
       on a single field when MS bit-fields are in use, it will take
       precedence for that field, but the alignment of the rest of the
       structure may affect its placement.
*************** expressions that refer to static variabl
*** 29053,29060 ****
  
   -- Target Hook: void TARGET_EXPAND_TO_RTL_HOOK (void)
       This hook is called just before expansion into rtl, allowing the
!      target to perform additional initializations or analysis before
!      the expansion.  For example, the rs6000 port uses it to allocate a
       scratch stack slot for use in copying SDmode values between memory
       and floating point registers whenever the function being expanded
       has any SDmode usage.
--- 28673,28680 ----
  
   -- Target Hook: void TARGET_EXPAND_TO_RTL_HOOK (void)
       This hook is called just before expansion into rtl, allowing the
!      target to perform additional initializations or analysis before the
!      expansion.  For example, the rs6000 port uses it to allocate a
       scratch stack slot for use in copying SDmode values between memory
       and floating point registers whenever the function being expanded
       has any SDmode usage.
*************** expressions that refer to static variabl
*** 29070,29097 ****
       part of a C++ mangled name.  The TYPE argument is the tree
       structure representing the type to be mangled.  The hook may be
       applied to trees which are not target-specific fundamental types;
!      it should return `NULL' for all such types, as well as arguments
!      it does not recognize.  If the return value is not `NULL', it must
       point to a statically-allocated string constant.
  
       Target-specific fundamental types might be new fundamental types or
       qualified versions of ordinary fundamental types.  Encode new
!      fundamental types as `u N NAME', where NAME is the name used for
       the type in source code, and N is the length of NAME in decimal.
!      Encode qualified versions of ordinary types as `U N NAME CODE',
       where NAME is the name used for the type qualifier in source code,
       N is the length of NAME as above, and CODE is the code used to
       represent the unqualified version of this type.  (See
!      `write_builtin_type' in `cp/mangle.c' for the list of codes.)  In
!      both cases the spaces are for clarity; do not include any spaces
!      in your string.
  
       This hook is applied to types prior to typedef resolution.  If the
!      mangled name for a particular type depends only on that type's
!      main variant, you can perform typedef resolution yourself using
!      `TYPE_MAIN_VARIANT' before mangling.
  
!      The default version of this hook always returns `NULL', which is
       appropriate for a target that does not define any new fundamental
       types.
  
--- 28690,28717 ----
       part of a C++ mangled name.  The TYPE argument is the tree
       structure representing the type to be mangled.  The hook may be
       applied to trees which are not target-specific fundamental types;
!      it should return 'NULL' for all such types, as well as arguments it
!      does not recognize.  If the return value is not 'NULL', it must
       point to a statically-allocated string constant.
  
       Target-specific fundamental types might be new fundamental types or
       qualified versions of ordinary fundamental types.  Encode new
!      fundamental types as 'u N NAME', where NAME is the name used for
       the type in source code, and N is the length of NAME in decimal.
!      Encode qualified versions of ordinary types as 'U N NAME CODE',
       where NAME is the name used for the type qualifier in source code,
       N is the length of NAME as above, and CODE is the code used to
       represent the unqualified version of this type.  (See
!      'write_builtin_type' in 'cp/mangle.c' for the list of codes.)  In
!      both cases the spaces are for clarity; do not include any spaces in
!      your string.
  
       This hook is applied to types prior to typedef resolution.  If the
!      mangled name for a particular type depends only on that type's main
!      variant, you can perform typedef resolution yourself using
!      'TYPE_MAIN_VARIANT' before mangling.
  
!      The default version of this hook always returns 'NULL', which is
       appropriate for a target that does not define any new fundamental
       types.
  
*************** the previous section, these apply to spe
*** 29107,29313 ****
  languages, rather than to fundamental aspects of storage layout.
  
   -- Macro: INT_TYPE_SIZE
!      A C expression for the size in bits of the type `int' on the
!      target machine.  If you don't define this, the default is one word.
  
   -- Macro: SHORT_TYPE_SIZE
!      A C expression for the size in bits of the type `short' on the
       target machine.  If you don't define this, the default is half a
       word.  (If this would be less than one storage unit, it is rounded
       up to one unit.)
  
   -- Macro: LONG_TYPE_SIZE
!      A C expression for the size in bits of the type `long' on the
       target machine.  If you don't define this, the default is one word.
  
   -- Macro: ADA_LONG_TYPE_SIZE
       On some machines, the size used for the Ada equivalent of the type
!      `long' by a native Ada compiler differs from that used by C.  In
       that situation, define this macro to be a C expression to be used
       for the size of that type.  If you don't define this, the default
!      is the value of `LONG_TYPE_SIZE'.
  
   -- Macro: LONG_LONG_TYPE_SIZE
!      A C expression for the size in bits of the type `long long' on the
       target machine.  If you don't define this, the default is two
       words.  If you want to support GNU Ada on your machine, the value
       of this macro must be at least 64.
  
   -- Macro: CHAR_TYPE_SIZE
!      A C expression for the size in bits of the type `char' on the
       target machine.  If you don't define this, the default is
!      `BITS_PER_UNIT'.
  
   -- Macro: BOOL_TYPE_SIZE
!      A C expression for the size in bits of the C++ type `bool' and C99
!      type `_Bool' on the target machine.  If you don't define this, and
!      you probably shouldn't, the default is `CHAR_TYPE_SIZE'.
  
   -- Macro: FLOAT_TYPE_SIZE
!      A C expression for the size in bits of the type `float' on the
       target machine.  If you don't define this, the default is one word.
  
   -- Macro: DOUBLE_TYPE_SIZE
!      A C expression for the size in bits of the type `double' on the
       target machine.  If you don't define this, the default is two
       words.
  
   -- Macro: LONG_DOUBLE_TYPE_SIZE
!      A C expression for the size in bits of the type `long double' on
       the target machine.  If you don't define this, the default is two
       words.
  
   -- Macro: SHORT_FRACT_TYPE_SIZE
!      A C expression for the size in bits of the type `short _Fract' on
       the target machine.  If you don't define this, the default is
!      `BITS_PER_UNIT'.
  
   -- Macro: FRACT_TYPE_SIZE
!      A C expression for the size in bits of the type `_Fract' on the
       target machine.  If you don't define this, the default is
!      `BITS_PER_UNIT * 2'.
  
   -- Macro: LONG_FRACT_TYPE_SIZE
!      A C expression for the size in bits of the type `long _Fract' on
       the target machine.  If you don't define this, the default is
!      `BITS_PER_UNIT * 4'.
  
   -- Macro: LONG_LONG_FRACT_TYPE_SIZE
!      A C expression for the size in bits of the type `long long _Fract'
       on the target machine.  If you don't define this, the default is
!      `BITS_PER_UNIT * 8'.
  
   -- Macro: SHORT_ACCUM_TYPE_SIZE
!      A C expression for the size in bits of the type `short _Accum' on
       the target machine.  If you don't define this, the default is
!      `BITS_PER_UNIT * 2'.
  
   -- Macro: ACCUM_TYPE_SIZE
!      A C expression for the size in bits of the type `_Accum' on the
       target machine.  If you don't define this, the default is
!      `BITS_PER_UNIT * 4'.
  
   -- Macro: LONG_ACCUM_TYPE_SIZE
!      A C expression for the size in bits of the type `long _Accum' on
       the target machine.  If you don't define this, the default is
!      `BITS_PER_UNIT * 8'.
  
   -- Macro: LONG_LONG_ACCUM_TYPE_SIZE
!      A C expression for the size in bits of the type `long long _Accum'
       on the target machine.  If you don't define this, the default is
!      `BITS_PER_UNIT * 16'.
  
   -- Macro: LIBGCC2_GNU_PREFIX
!      This macro corresponds to the `TARGET_LIBFUNC_GNU_PREFIX' target
       hook and should be defined if that hook is overriden to be true.
!      It causes function names in libgcc to be changed to use a `__gnu_'
!      prefix for their name rather than the default `__'.  A port which
!      uses this macro should also arrange to use `t-gnu-prefix' in the
!      libgcc `config.host'.
  
   -- Macro: TARGET_FLT_EVAL_METHOD
!      A C expression for the value for `FLT_EVAL_METHOD' in `float.h',
!      assuming, if applicable, that the floating-point control word is
!      in its default state.  If you do not define this macro the value of
!      `FLT_EVAL_METHOD' will be zero.
  
   -- Macro: WIDEST_HARDWARE_FP_SIZE
       A C expression for the size in bits of the widest floating-point
       format supported by the hardware.  If you define this macro, you
       must specify a value less than or equal to the value of
!      `LONG_DOUBLE_TYPE_SIZE'.  If you do not define this macro, the
!      value of `LONG_DOUBLE_TYPE_SIZE' is the default.
  
   -- Macro: DEFAULT_SIGNED_CHAR
       An expression whose value is 1 or 0, according to whether the type
!      `char' should be signed or unsigned by default.  The user can
!      always override this default with the options `-fsigned-char' and
!      `-funsigned-char'.
  
   -- Target Hook: bool TARGET_DEFAULT_SHORT_ENUMS (void)
       This target hook should return true if the compiler should give an
!      `enum' type only as many bytes as it takes to represent the range
       of possible values of that type.  It should return false if all
!      `enum' types should be allocated like `int'.
  
       The default is to return false.
  
   -- Macro: SIZE_TYPE
!      A C expression for a string describing the name of the data type
!      to use for size values.  The typedef name `size_t' is defined
!      using the contents of the string.
  
!      The string can contain more than one keyword.  If so, separate
!      them with spaces, and write first any length keyword, then
!      `unsigned' if appropriate, and finally `int'.  The string must
!      exactly match one of the data type names defined in the function
!      `c_common_nodes_and_builtins' in the file `c-family/c-common.c'.
!      You may not omit `int' or change the order--that would cause the
       compiler to crash on startup.
  
!      If you don't define this macro, the default is `"long unsigned
       int"'.
  
   -- Macro: SIZETYPE
!      GCC defines internal types (`sizetype', `ssizetype', `bitsizetype'
!      and `sbitsizetype') for expressions dealing with size.  This macro
!      is a C expression for a string describing the name of the data
!      type from which the precision of `sizetype' is extracted.
  
!      The string has the same restrictions as `SIZE_TYPE' string.
  
!      If you don't define this macro, the default is `SIZE_TYPE'.
  
   -- Macro: PTRDIFF_TYPE
!      A C expression for a string describing the name of the data type
!      to use for the result of subtracting two pointers.  The typedef
!      name `ptrdiff_t' is defined using the contents of the string.  See
!      `SIZE_TYPE' above for more information.
  
!      If you don't define this macro, the default is `"long int"'.
  
   -- Macro: WCHAR_TYPE
!      A C expression for a string describing the name of the data type
!      to use for wide characters.  The typedef name `wchar_t' is defined
!      using the contents of the string.  See `SIZE_TYPE' above for more
       information.
  
!      If you don't define this macro, the default is `"int"'.
  
   -- Macro: WCHAR_TYPE_SIZE
       A C expression for the size in bits of the data type for wide
!      characters.  This is used in `cpp', which cannot make use of
!      `WCHAR_TYPE'.
  
   -- Macro: WINT_TYPE
       A C expression for a string describing the name of the data type to
!      use for wide characters passed to `printf' and returned from
!      `getwc'.  The typedef name `wint_t' is defined using the contents
!      of the string.  See `SIZE_TYPE' above for more information.
  
!      If you don't define this macro, the default is `"unsigned int"'.
  
   -- Macro: INTMAX_TYPE
       A C expression for a string describing the name of the data type
       that can represent any value of any standard or extended signed
!      integer type.  The typedef name `intmax_t' is defined using the
!      contents of the string.  See `SIZE_TYPE' above for more
       information.
  
       If you don't define this macro, the default is the first of
!      `"int"', `"long int"', or `"long long int"' that has as much
!      precision as `long long int'.
  
   -- Macro: UINTMAX_TYPE
       A C expression for a string describing the name of the data type
       that can represent any value of any standard or extended unsigned
!      integer type.  The typedef name `uintmax_t' is defined using the
!      contents of the string.  See `SIZE_TYPE' above for more
       information.
  
       If you don't define this macro, the default is the first of
!      `"unsigned int"', `"long unsigned int"', or `"long long unsigned
!      int"' that has as much precision as `long long unsigned int'.
  
   -- Macro: SIG_ATOMIC_TYPE
   -- Macro: INT8_TYPE
--- 28727,28933 ----
  languages, rather than to fundamental aspects of storage layout.
  
   -- Macro: INT_TYPE_SIZE
!      A C expression for the size in bits of the type 'int' on the target
!      machine.  If you don't define this, the default is one word.
  
   -- Macro: SHORT_TYPE_SIZE
!      A C expression for the size in bits of the type 'short' on the
       target machine.  If you don't define this, the default is half a
       word.  (If this would be less than one storage unit, it is rounded
       up to one unit.)
  
   -- Macro: LONG_TYPE_SIZE
!      A C expression for the size in bits of the type 'long' on the
       target machine.  If you don't define this, the default is one word.
  
   -- Macro: ADA_LONG_TYPE_SIZE
       On some machines, the size used for the Ada equivalent of the type
!      'long' by a native Ada compiler differs from that used by C.  In
       that situation, define this macro to be a C expression to be used
       for the size of that type.  If you don't define this, the default
!      is the value of 'LONG_TYPE_SIZE'.
  
   -- Macro: LONG_LONG_TYPE_SIZE
!      A C expression for the size in bits of the type 'long long' on the
       target machine.  If you don't define this, the default is two
       words.  If you want to support GNU Ada on your machine, the value
       of this macro must be at least 64.
  
   -- Macro: CHAR_TYPE_SIZE
!      A C expression for the size in bits of the type 'char' on the
       target machine.  If you don't define this, the default is
!      'BITS_PER_UNIT'.
  
   -- Macro: BOOL_TYPE_SIZE
!      A C expression for the size in bits of the C++ type 'bool' and C99
!      type '_Bool' on the target machine.  If you don't define this, and
!      you probably shouldn't, the default is 'CHAR_TYPE_SIZE'.
  
   -- Macro: FLOAT_TYPE_SIZE
!      A C expression for the size in bits of the type 'float' on the
       target machine.  If you don't define this, the default is one word.
  
   -- Macro: DOUBLE_TYPE_SIZE
!      A C expression for the size in bits of the type 'double' on the
       target machine.  If you don't define this, the default is two
       words.
  
   -- Macro: LONG_DOUBLE_TYPE_SIZE
!      A C expression for the size in bits of the type 'long double' on
       the target machine.  If you don't define this, the default is two
       words.
  
   -- Macro: SHORT_FRACT_TYPE_SIZE
!      A C expression for the size in bits of the type 'short _Fract' on
       the target machine.  If you don't define this, the default is
!      'BITS_PER_UNIT'.
  
   -- Macro: FRACT_TYPE_SIZE
!      A C expression for the size in bits of the type '_Fract' on the
       target machine.  If you don't define this, the default is
!      'BITS_PER_UNIT * 2'.
  
   -- Macro: LONG_FRACT_TYPE_SIZE
!      A C expression for the size in bits of the type 'long _Fract' on
       the target machine.  If you don't define this, the default is
!      'BITS_PER_UNIT * 4'.
  
   -- Macro: LONG_LONG_FRACT_TYPE_SIZE
!      A C expression for the size in bits of the type 'long long _Fract'
       on the target machine.  If you don't define this, the default is
!      'BITS_PER_UNIT * 8'.
  
   -- Macro: SHORT_ACCUM_TYPE_SIZE
!      A C expression for the size in bits of the type 'short _Accum' on
       the target machine.  If you don't define this, the default is
!      'BITS_PER_UNIT * 2'.
  
   -- Macro: ACCUM_TYPE_SIZE
!      A C expression for the size in bits of the type '_Accum' on the
       target machine.  If you don't define this, the default is
!      'BITS_PER_UNIT * 4'.
  
   -- Macro: LONG_ACCUM_TYPE_SIZE
!      A C expression for the size in bits of the type 'long _Accum' on
       the target machine.  If you don't define this, the default is
!      'BITS_PER_UNIT * 8'.
  
   -- Macro: LONG_LONG_ACCUM_TYPE_SIZE
!      A C expression for the size in bits of the type 'long long _Accum'
       on the target machine.  If you don't define this, the default is
!      'BITS_PER_UNIT * 16'.
  
   -- Macro: LIBGCC2_GNU_PREFIX
!      This macro corresponds to the 'TARGET_LIBFUNC_GNU_PREFIX' target
       hook and should be defined if that hook is overriden to be true.
!      It causes function names in libgcc to be changed to use a '__gnu_'
!      prefix for their name rather than the default '__'.  A port which
!      uses this macro should also arrange to use 't-gnu-prefix' in the
!      libgcc 'config.host'.
  
   -- Macro: TARGET_FLT_EVAL_METHOD
!      A C expression for the value for 'FLT_EVAL_METHOD' in 'float.h',
!      assuming, if applicable, that the floating-point control word is in
!      its default state.  If you do not define this macro the value of
!      'FLT_EVAL_METHOD' will be zero.
  
   -- Macro: WIDEST_HARDWARE_FP_SIZE
       A C expression for the size in bits of the widest floating-point
       format supported by the hardware.  If you define this macro, you
       must specify a value less than or equal to the value of
!      'LONG_DOUBLE_TYPE_SIZE'.  If you do not define this macro, the
!      value of 'LONG_DOUBLE_TYPE_SIZE' is the default.
  
   -- Macro: DEFAULT_SIGNED_CHAR
       An expression whose value is 1 or 0, according to whether the type
!      'char' should be signed or unsigned by default.  The user can
!      always override this default with the options '-fsigned-char' and
!      '-funsigned-char'.
  
   -- Target Hook: bool TARGET_DEFAULT_SHORT_ENUMS (void)
       This target hook should return true if the compiler should give an
!      'enum' type only as many bytes as it takes to represent the range
       of possible values of that type.  It should return false if all
!      'enum' types should be allocated like 'int'.
  
       The default is to return false.
  
   -- Macro: SIZE_TYPE
!      A C expression for a string describing the name of the data type to
!      use for size values.  The typedef name 'size_t' is defined using
!      the contents of the string.
  
!      The string can contain more than one keyword.  If so, separate them
!      with spaces, and write first any length keyword, then 'unsigned' if
!      appropriate, and finally 'int'.  The string must exactly match one
!      of the data type names defined in the function
!      'c_common_nodes_and_builtins' in the file 'c-family/c-common.c'.
!      You may not omit 'int' or change the order--that would cause the
       compiler to crash on startup.
  
!      If you don't define this macro, the default is '"long unsigned
       int"'.
  
   -- Macro: SIZETYPE
!      GCC defines internal types ('sizetype', 'ssizetype', 'bitsizetype'
!      and 'sbitsizetype') for expressions dealing with size.  This macro
!      is a C expression for a string describing the name of the data type
!      from which the precision of 'sizetype' is extracted.
  
!      The string has the same restrictions as 'SIZE_TYPE' string.
  
!      If you don't define this macro, the default is 'SIZE_TYPE'.
  
   -- Macro: PTRDIFF_TYPE
!      A C expression for a string describing the name of the data type to
!      use for the result of subtracting two pointers.  The typedef name
!      'ptrdiff_t' is defined using the contents of the string.  See
!      'SIZE_TYPE' above for more information.
  
!      If you don't define this macro, the default is '"long int"'.
  
   -- Macro: WCHAR_TYPE
!      A C expression for a string describing the name of the data type to
!      use for wide characters.  The typedef name 'wchar_t' is defined
!      using the contents of the string.  See 'SIZE_TYPE' above for more
       information.
  
!      If you don't define this macro, the default is '"int"'.
  
   -- Macro: WCHAR_TYPE_SIZE
       A C expression for the size in bits of the data type for wide
!      characters.  This is used in 'cpp', which cannot make use of
!      'WCHAR_TYPE'.
  
   -- Macro: WINT_TYPE
       A C expression for a string describing the name of the data type to
!      use for wide characters passed to 'printf' and returned from
!      'getwc'.  The typedef name 'wint_t' is defined using the contents
!      of the string.  See 'SIZE_TYPE' above for more information.
  
!      If you don't define this macro, the default is '"unsigned int"'.
  
   -- Macro: INTMAX_TYPE
       A C expression for a string describing the name of the data type
       that can represent any value of any standard or extended signed
!      integer type.  The typedef name 'intmax_t' is defined using the
!      contents of the string.  See 'SIZE_TYPE' above for more
       information.
  
       If you don't define this macro, the default is the first of
!      '"int"', '"long int"', or '"long long int"' that has as much
!      precision as 'long long int'.
  
   -- Macro: UINTMAX_TYPE
       A C expression for a string describing the name of the data type
       that can represent any value of any standard or extended unsigned
!      integer type.  The typedef name 'uintmax_t' is defined using the
!      contents of the string.  See 'SIZE_TYPE' above for more
       information.
  
       If you don't define this macro, the default is the first of
!      '"unsigned int"', '"long unsigned int"', or '"long long unsigned
!      int"' that has as much precision as 'long long unsigned int'.
  
   -- Macro: SIG_ATOMIC_TYPE
   -- Macro: INT8_TYPE
*************** languages, rather than to fundamental as
*** 29336,29354 ****
   -- Macro: UINT_FAST64_TYPE
   -- Macro: INTPTR_TYPE
   -- Macro: UINTPTR_TYPE
!      C expressions for the standard types `sig_atomic_t', `int8_t',
!      `int16_t', `int32_t', `int64_t', `uint8_t', `uint16_t',
!      `uint32_t', `uint64_t', `int_least8_t', `int_least16_t',
!      `int_least32_t', `int_least64_t', `uint_least8_t',
!      `uint_least16_t', `uint_least32_t', `uint_least64_t',
!      `int_fast8_t', `int_fast16_t', `int_fast32_t', `int_fast64_t',
!      `uint_fast8_t', `uint_fast16_t', `uint_fast32_t', `uint_fast64_t',
!      `intptr_t', and `uintptr_t'.  See `SIZE_TYPE' above for more
!      information.
  
       If any of these macros evaluates to a null pointer, the
       corresponding type is not supported; if GCC is configured to
!      provide `<stdint.h>' in such a case, the header provided may not
       conform to C99, depending on the type in question.  The defaults
       for all of these macros are null pointers.
  
--- 28956,28973 ----
   -- Macro: UINT_FAST64_TYPE
   -- Macro: INTPTR_TYPE
   -- Macro: UINTPTR_TYPE
!      C expressions for the standard types 'sig_atomic_t', 'int8_t',
!      'int16_t', 'int32_t', 'int64_t', 'uint8_t', 'uint16_t', 'uint32_t',
!      'uint64_t', 'int_least8_t', 'int_least16_t', 'int_least32_t',
!      'int_least64_t', 'uint_least8_t', 'uint_least16_t',
!      'uint_least32_t', 'uint_least64_t', 'int_fast8_t', 'int_fast16_t',
!      'int_fast32_t', 'int_fast64_t', 'uint_fast8_t', 'uint_fast16_t',
!      'uint_fast32_t', 'uint_fast64_t', 'intptr_t', and 'uintptr_t'.  See
!      'SIZE_TYPE' above for more information.
  
       If any of these macros evaluates to a null pointer, the
       corresponding type is not supported; if GCC is configured to
!      provide '<stdint.h>' in such a case, the header provided may not
       conform to C99, depending on the type in question.  The defaults
       for all of these macros are null pointers.
  
*************** languages, rather than to fundamental as
*** 29371,29392 ****
       vtable_index is odd, we can distinguish which variant of the union
       is in use.  But, on some platforms function pointers can be odd,
       and so this doesn't work.  In that case, we use the low-order bit
!      of the `delta' field, and shift the remainder of the `delta' field
       to the left.
  
       GCC will automatically make the right selection about where to
!      store this bit using the `FUNCTION_BOUNDARY' setting for your
       platform.  However, some platforms such as ARM/Thumb have
!      `FUNCTION_BOUNDARY' set such that functions always start at even
       addresses, but the lowest bit of pointers to functions indicate
       whether the function at that address is in ARM or Thumb mode.  If
!      this is the case of your architecture, you should define this
!      macro to `ptrmemfunc_vbit_in_delta'.
  
       In general, you should not have to define this macro.  On
       architectures in which function addresses are always even,
!      according to `FUNCTION_BOUNDARY', GCC will automatically define
!      this macro to `ptrmemfunc_vbit_in_pfn'.
  
   -- Macro: TARGET_VTABLE_USES_DESCRIPTORS
       Normally, the C++ compiler uses function pointers in vtables.  This
--- 28990,29011 ----
       vtable_index is odd, we can distinguish which variant of the union
       is in use.  But, on some platforms function pointers can be odd,
       and so this doesn't work.  In that case, we use the low-order bit
!      of the 'delta' field, and shift the remainder of the 'delta' field
       to the left.
  
       GCC will automatically make the right selection about where to
!      store this bit using the 'FUNCTION_BOUNDARY' setting for your
       platform.  However, some platforms such as ARM/Thumb have
!      'FUNCTION_BOUNDARY' set such that functions always start at even
       addresses, but the lowest bit of pointers to functions indicate
       whether the function at that address is in ARM or Thumb mode.  If
!      this is the case of your architecture, you should define this macro
!      to 'ptrmemfunc_vbit_in_delta'.
  
       In general, you should not have to define this macro.  On
       architectures in which function addresses are always even,
!      according to 'FUNCTION_BOUNDARY', GCC will automatically define
!      this macro to 'ptrmemfunc_vbit_in_pfn'.
  
   -- Macro: TARGET_VTABLE_USES_DESCRIPTORS
       Normally, the C++ compiler uses function pointers in vtables.  This
*************** languages, rather than to fundamental as
*** 29403,29414 ****
       By default, the vtable entries are void pointers, the so the
       alignment is the same as pointer alignment.  The value of this
       macro specifies the alignment of the vtable entry in bits.  It
!      should be defined only when special alignment is necessary. */
  
   -- Macro: TARGET_VTABLE_DATA_ENTRY_DISTANCE
       There are a few non-descriptor entries in the vtable at offsets
       below zero.  If these entries must be padded (say, to preserve the
!      alignment specified by `TARGET_VTABLE_ENTRY_ALIGN'), set this to
       the number of words in each data entry.
  
  
--- 29022,29033 ----
       By default, the vtable entries are void pointers, the so the
       alignment is the same as pointer alignment.  The value of this
       macro specifies the alignment of the vtable entry in bits.  It
!      should be defined only when special alignment is necessary.  */
  
   -- Macro: TARGET_VTABLE_DATA_ENTRY_DISTANCE
       There are a few non-descriptor entries in the vtable at offsets
       below zero.  If these entries must be padded (say, to preserve the
!      alignment specified by 'TARGET_VTABLE_ENTRY_ALIGN'), set this to
       the number of words in each data entry.
  
  
*************** Registers have various characteristics.
*** 29445,29453 ****
  
   -- Macro: FIRST_PSEUDO_REGISTER
       Number of hardware registers known to the compiler.  They receive
!      numbers 0 through `FIRST_PSEUDO_REGISTER-1'; thus, the first
!      pseudo register's number really is assigned the number
!      `FIRST_PSEUDO_REGISTER'.
  
   -- Macro: FIXED_REGISTERS
       An initializer that says which registers are used for fixed
--- 29064,29072 ----
  
   -- Macro: FIRST_PSEUDO_REGISTER
       Number of hardware registers known to the compiler.  They receive
!      numbers 0 through 'FIRST_PSEUDO_REGISTER-1'; thus, the first pseudo
!      register's number really is assigned the number
!      'FIRST_PSEUDO_REGISTER'.
  
   -- Macro: FIXED_REGISTERS
       An initializer that says which registers are used for fixed
*************** Registers have various characteristics.
*** 29466,29491 ****
       The table initialized from this macro, and the table initialized by
       the following one, may be overridden at run time either
       automatically, by the actions of the macro
!      `CONDITIONAL_REGISTER_USAGE', or by the user with the command
!      options `-ffixed-REG', `-fcall-used-REG' and `-fcall-saved-REG'.
  
   -- Macro: CALL_USED_REGISTERS
!      Like `FIXED_REGISTERS' but has 1 for each register that is
       clobbered (in general) by function calls as well as for fixed
       registers.  This macro therefore identifies the registers that are
       not available for general allocation of values that must live
       across function calls.
  
!      If a register has 0 in `CALL_USED_REGISTERS', the compiler
       automatically saves it on function entry and restores it on
       function exit, if the register is used within the function.
  
   -- Macro: CALL_REALLY_USED_REGISTERS
!      Like `CALL_USED_REGISTERS' except this macro doesn't require that
!      the entire set of `FIXED_REGISTERS' be included.
!      (`CALL_USED_REGISTERS' must be a superset of `FIXED_REGISTERS').
       This macro is optional.  If not specified, it defaults to the value
!      of `CALL_USED_REGISTERS'.
  
   -- Macro: HARD_REGNO_CALL_PART_CLOBBERED (REGNO, MODE)
       A C expression that is nonzero if it is not permissible to store a
--- 29085,29110 ----
       The table initialized from this macro, and the table initialized by
       the following one, may be overridden at run time either
       automatically, by the actions of the macro
!      'CONDITIONAL_REGISTER_USAGE', or by the user with the command
!      options '-ffixed-REG', '-fcall-used-REG' and '-fcall-saved-REG'.
  
   -- Macro: CALL_USED_REGISTERS
!      Like 'FIXED_REGISTERS' but has 1 for each register that is
       clobbered (in general) by function calls as well as for fixed
       registers.  This macro therefore identifies the registers that are
       not available for general allocation of values that must live
       across function calls.
  
!      If a register has 0 in 'CALL_USED_REGISTERS', the compiler
       automatically saves it on function entry and restores it on
       function exit, if the register is used within the function.
  
   -- Macro: CALL_REALLY_USED_REGISTERS
!      Like 'CALL_USED_REGISTERS' except this macro doesn't require that
!      the entire set of 'FIXED_REGISTERS' be included.
!      ('CALL_USED_REGISTERS' must be a superset of 'FIXED_REGISTERS').
       This macro is optional.  If not specified, it defaults to the value
!      of 'CALL_USED_REGISTERS'.
  
   -- Macro: HARD_REGNO_CALL_PART_CLOBBERED (REGNO, MODE)
       A C expression that is nonzero if it is not permissible to store a
*************** Registers have various characteristics.
*** 29495,29544 ****
       do not preserve the entire contents of a register across a call.
  
   -- Target Hook: void TARGET_CONDITIONAL_REGISTER_USAGE (void)
!      This hook may conditionally modify five variables `fixed_regs',
!      `call_used_regs', `global_regs', `reg_names', and
!      `reg_class_contents', to take into account any dependence of these
       register sets on target flags.  The first three of these are of
!      type `char []' (interpreted as Boolean vectors).  `global_regs' is
!      a `const char *[]', and `reg_class_contents' is a `HARD_REG_SET'.
!      Before the macro is called, `fixed_regs', `call_used_regs',
!      `reg_class_contents', and `reg_names' have been initialized from
!      `FIXED_REGISTERS', `CALL_USED_REGISTERS', `REG_CLASS_CONTENTS',
!      and `REGISTER_NAMES', respectively.  `global_regs' has been
!      cleared, and any `-ffixed-REG', `-fcall-used-REG' and
!      `-fcall-saved-REG' command options have been applied.
  
       If the usage of an entire class of registers depends on the target
       flags, you may indicate this to GCC by using this macro to modify
!      `fixed_regs' and `call_used_regs' to 1 for each of the registers
!      in the classes which should not be used by GCC.  Also make
!      `define_register_constraint's return `NO_REGS' for constraints
!      that shouldn't be used.
  
!      (However, if this class is not included in `GENERAL_REGS' and all
       of the insn patterns whose constraints permit this class are
       controlled by target switches, then GCC will automatically avoid
       using these registers when the target switches are opposed to
       them.)
  
   -- Macro: INCOMING_REGNO (OUT)
!      Define this macro if the target machine has register windows.
!      This C expression returns the register number as seen by the
!      called function corresponding to the register number OUT as seen
!      by the calling function.  Return OUT if register number OUT is not
!      an outbound register.
  
   -- Macro: OUTGOING_REGNO (IN)
!      Define this macro if the target machine has register windows.
!      This C expression returns the register number as seen by the
!      calling function corresponding to the register number IN as seen
!      by the called function.  Return IN if register number IN is not an
!      inbound register.
  
   -- Macro: LOCAL_REGNO (REGNO)
!      Define this macro if the target machine has register windows.
!      This C expression returns true if the register is call-saved but
!      is in the register window.  Unlike most call-saved registers, such
       registers need not be explicitly restored on function exit or
       during non-local gotos.
  
--- 29114,29163 ----
       do not preserve the entire contents of a register across a call.
  
   -- Target Hook: void TARGET_CONDITIONAL_REGISTER_USAGE (void)
!      This hook may conditionally modify five variables 'fixed_regs',
!      'call_used_regs', 'global_regs', 'reg_names', and
!      'reg_class_contents', to take into account any dependence of these
       register sets on target flags.  The first three of these are of
!      type 'char []' (interpreted as Boolean vectors).  'global_regs' is
!      a 'const char *[]', and 'reg_class_contents' is a 'HARD_REG_SET'.
!      Before the macro is called, 'fixed_regs', 'call_used_regs',
!      'reg_class_contents', and 'reg_names' have been initialized from
!      'FIXED_REGISTERS', 'CALL_USED_REGISTERS', 'REG_CLASS_CONTENTS', and
!      'REGISTER_NAMES', respectively.  'global_regs' has been cleared,
!      and any '-ffixed-REG', '-fcall-used-REG' and '-fcall-saved-REG'
!      command options have been applied.
  
       If the usage of an entire class of registers depends on the target
       flags, you may indicate this to GCC by using this macro to modify
!      'fixed_regs' and 'call_used_regs' to 1 for each of the registers in
!      the classes which should not be used by GCC.  Also make
!      'define_register_constraint's return 'NO_REGS' for constraints that
!      shouldn't be used.
  
!      (However, if this class is not included in 'GENERAL_REGS' and all
       of the insn patterns whose constraints permit this class are
       controlled by target switches, then GCC will automatically avoid
       using these registers when the target switches are opposed to
       them.)
  
   -- Macro: INCOMING_REGNO (OUT)
!      Define this macro if the target machine has register windows.  This
!      C expression returns the register number as seen by the called
!      function corresponding to the register number OUT as seen by the
!      calling function.  Return OUT if register number OUT is not an
!      outbound register.
  
   -- Macro: OUTGOING_REGNO (IN)
!      Define this macro if the target machine has register windows.  This
!      C expression returns the register number as seen by the calling
!      function corresponding to the register number IN as seen by the
!      called function.  Return IN if register number IN is not an inbound
!      register.
  
   -- Macro: LOCAL_REGNO (REGNO)
!      Define this macro if the target machine has register windows.  This
!      C expression returns true if the register is call-saved but is in
!      the register window.  Unlike most call-saved registers, such
       registers need not be explicitly restored on function exit or
       during non-local gotos.
  
*************** Registers are allocated in order.
*** 29565,29571 ****
       One use of this macro is on machines where the highest numbered
       registers must always be saved and the save-multiple-registers
       instruction supports only sequences of consecutive registers.  On
!      such machines, define `REG_ALLOC_ORDER' to be an initializer that
       lists the highest numbered allocable register first.
  
   -- Macro: ADJUST_REG_ALLOC_ORDER
--- 29184,29190 ----
       One use of this macro is on machines where the highest numbered
       registers must always be saved and the save-multiple-registers
       instruction supports only sequences of consecutive registers.  On
!      such machines, define 'REG_ALLOC_ORDER' to be an initializer that
       lists the highest numbered allocable register first.
  
   -- Macro: ADJUST_REG_ALLOC_ORDER
*************** Registers are allocated in order.
*** 29573,29595 ****
       allocate hard registers for pseudo-registers local to a basic
       block.
  
!      Store the desired register order in the array `reg_alloc_order'.
       Element 0 should be the register to allocate first; element 1, the
       next register; and so on.
  
       The macro body should not assume anything about the contents of
!      `reg_alloc_order' before execution of the macro.
  
       On most machines, it is not necessary to define this macro.
  
   -- Macro: HONOR_REG_ALLOC_ORDER
       Normally, IRA tries to estimate the costs for saving a register in
!      the prologue and restoring it in the epilogue.  This discourages
!      it from using call-saved registers.  If a machine wants to ensure
!      that IRA allocates registers in the order given by REG_ALLOC_ORDER
!      even if some call-saved registers appear earlier than call-used
!      ones, then define this macro as a C expression to nonzero. Default
!      is 0.
  
   -- Macro: IRA_HARD_REGNO_ADD_COST_MULTIPLIER (REGNO)
       In some case register allocation order is not enough for the
--- 29192,29213 ----
       allocate hard registers for pseudo-registers local to a basic
       block.
  
!      Store the desired register order in the array 'reg_alloc_order'.
       Element 0 should be the register to allocate first; element 1, the
       next register; and so on.
  
       The macro body should not assume anything about the contents of
!      'reg_alloc_order' before execution of the macro.
  
       On most machines, it is not necessary to define this macro.
  
   -- Macro: HONOR_REG_ALLOC_ORDER
       Normally, IRA tries to estimate the costs for saving a register in
!      the prologue and restoring it in the epilogue.  This discourages it
!      from using call-saved registers.  If a machine wants to ensure that
!      IRA allocates registers in the order given by REG_ALLOC_ORDER even
!      if some call-saved registers appear earlier than call-used ones,
!      then define this macro as a C expression to nonzero.  Default is 0.
  
   -- Macro: IRA_HARD_REGNO_ADD_COST_MULTIPLIER (REGNO)
       In some case register allocation order is not enough for the
*************** Registers are allocated in order.
*** 29598,29604 ****
       based on REGNO.  The cost of using REGNO for a pseudo will be
       increased by approximately the pseudo's usage frequency times the
       value returned by this macro.  Not defining this macro is
!      equivalent to having it always return `0.0'.
  
       On most machines, it is not necessary to define this macro.
  
--- 29216,29222 ----
       based on REGNO.  The cost of using REGNO for a pseudo will be
       increased by approximately the pseudo's usage frequency times the
       value returned by this macro.  Not defining this macro is
!      equivalent to having it always return '0.0'.
  
       On most machines, it is not necessary to define this macro.
  
*************** consecutive registers are needed for a g
*** 29615,29623 ****
   -- Macro: HARD_REGNO_NREGS (REGNO, MODE)
       A C expression for the number of consecutive hard registers,
       starting at register number REGNO, required to hold a value of mode
!      MODE.  This macro must never return zero, even if a register
!      cannot hold the requested mode - indicate that with
!      HARD_REGNO_MODE_OK and/or CANNOT_CHANGE_MODE_CLASS instead.
  
       On a machine where all registers are exactly one word, a suitable
       definition of this macro is
--- 29233,29241 ----
   -- Macro: HARD_REGNO_NREGS (REGNO, MODE)
       A C expression for the number of consecutive hard registers,
       starting at register number REGNO, required to hold a value of mode
!      MODE.  This macro must never return zero, even if a register cannot
!      hold the requested mode - indicate that with HARD_REGNO_MODE_OK
!      and/or CANNOT_CHANGE_MODE_CLASS instead.
  
       On a machine where all registers are exactly one word, a suitable
       definition of this macro is
*************** consecutive registers are needed for a g
*** 29632,29655 ****
       in registers starting at register number REGNO (as determined by
       multiplying GCC's notion of the size of the register when
       containing this mode by the number of registers returned by
!      `HARD_REGNO_NREGS').  By default this is zero.
  
       For example, if a floating-point value is stored in three 32-bit
       registers but takes up 128 bits in memory, then this would be
       nonzero.
  
       This macros only needs to be defined if there are cases where
!      `subreg_get_info' would otherwise wrongly determine that a
!      `subreg' can be represented by an offset to the register number,
!      when in fact such a `subreg' would contain some of the padding not
!      stored in registers and so not be representable.
  
   -- Macro: HARD_REGNO_NREGS_WITH_PADDING (REGNO, MODE)
       For values of REGNO and MODE for which
!      `HARD_REGNO_NREGS_HAS_PADDING' returns nonzero, a C expression
       returning the greater number of registers required to hold the
!      value including any padding.  In the example above, the value
!      would be four.
  
   -- Macro: REGMODE_NATURAL_SIZE (MODE)
       Define this macro if the natural size of registers that hold values
--- 29250,29273 ----
       in registers starting at register number REGNO (as determined by
       multiplying GCC's notion of the size of the register when
       containing this mode by the number of registers returned by
!      'HARD_REGNO_NREGS').  By default this is zero.
  
       For example, if a floating-point value is stored in three 32-bit
       registers but takes up 128 bits in memory, then this would be
       nonzero.
  
       This macros only needs to be defined if there are cases where
!      'subreg_get_info' would otherwise wrongly determine that a 'subreg'
!      can be represented by an offset to the register number, when in
!      fact such a 'subreg' would contain some of the padding not stored
!      in registers and so not be representable.
  
   -- Macro: HARD_REGNO_NREGS_WITH_PADDING (REGNO, MODE)
       For values of REGNO and MODE for which
!      'HARD_REGNO_NREGS_HAS_PADDING' returns nonzero, a C expression
       returning the greater number of registers required to hold the
!      value including any padding.  In the example above, the value would
!      be four.
  
   -- Macro: REGMODE_NATURAL_SIZE (MODE)
       Define this macro if the natural size of registers that hold values
*************** consecutive registers are needed for a g
*** 29676,29724 ****
       reject odd register numbers for such modes.
  
       The minimum requirement for a mode to be OK in a register is that
!      the `movMODE' instruction pattern support moves between the
       register and other hard register in the same class and that moving
       a value into the register and back out not alter it.
  
!      Since the same instruction used to move `word_mode' will work for
       all narrower integer modes, it is not necessary on any machine for
!      `HARD_REGNO_MODE_OK' to distinguish between these modes, provided
!      you define patterns `movhi', etc., to take advantage of this.  This
!      is useful because of the interaction between `HARD_REGNO_MODE_OK'
!      and `MODES_TIEABLE_P'; it is very desirable for all integer modes
       to be tieable.
  
       Many machines have special registers for floating point arithmetic.
       Often people assume that floating point machine modes are allowed
!      only in floating point registers.  This is not true.  Any
!      registers that can hold integers can safely _hold_ a floating
!      point machine mode, whether or not floating arithmetic can be done
!      on it in those registers.  Integer move instructions can be used
!      to move the values.
  
       On some machines, though, the converse is true: fixed-point machine
       modes may not go in floating registers.  This is true if the
       floating registers normalize any value stored in them, because
       storing a non-floating value there would garble it.  In this case,
!      `HARD_REGNO_MODE_OK' should reject fixed-point machine modes in
       floating registers.  But if the floating registers do not
       automatically normalize, if you can store any bit pattern in one
!      and retrieve it unchanged without a trap, then any machine mode
!      may go in a floating register, so you can define this macro to say
!      so.
  
       The primary significance of special floating registers is rather
       that they are the registers acceptable in floating point arithmetic
       instructions.  However, this is of no concern to
!      `HARD_REGNO_MODE_OK'.  You handle it by writing the proper
       constraints for those instructions.
  
       On some machines, the floating registers are especially slow to
!      access, so that it is better to store a value in a stack frame
!      than in such a register if floating point arithmetic is not being
!      done.  As long as the floating registers are not in class
!      `GENERAL_REGS', they will not be used unless some pattern's
!      constraint asks for one.
  
   -- Macro: HARD_REGNO_RENAME_OK (FROM, TO)
       A C expression that is nonzero if it is OK to rename a hard
--- 29294,29341 ----
       reject odd register numbers for such modes.
  
       The minimum requirement for a mode to be OK in a register is that
!      the 'movMODE' instruction pattern support moves between the
       register and other hard register in the same class and that moving
       a value into the register and back out not alter it.
  
!      Since the same instruction used to move 'word_mode' will work for
       all narrower integer modes, it is not necessary on any machine for
!      'HARD_REGNO_MODE_OK' to distinguish between these modes, provided
!      you define patterns 'movhi', etc., to take advantage of this.  This
!      is useful because of the interaction between 'HARD_REGNO_MODE_OK'
!      and 'MODES_TIEABLE_P'; it is very desirable for all integer modes
       to be tieable.
  
       Many machines have special registers for floating point arithmetic.
       Often people assume that floating point machine modes are allowed
!      only in floating point registers.  This is not true.  Any registers
!      that can hold integers can safely _hold_ a floating point machine
!      mode, whether or not floating arithmetic can be done on it in those
!      registers.  Integer move instructions can be used to move the
!      values.
  
       On some machines, though, the converse is true: fixed-point machine
       modes may not go in floating registers.  This is true if the
       floating registers normalize any value stored in them, because
       storing a non-floating value there would garble it.  In this case,
!      'HARD_REGNO_MODE_OK' should reject fixed-point machine modes in
       floating registers.  But if the floating registers do not
       automatically normalize, if you can store any bit pattern in one
!      and retrieve it unchanged without a trap, then any machine mode may
!      go in a floating register, so you can define this macro to say so.
  
       The primary significance of special floating registers is rather
       that they are the registers acceptable in floating point arithmetic
       instructions.  However, this is of no concern to
!      'HARD_REGNO_MODE_OK'.  You handle it by writing the proper
       constraints for those instructions.
  
       On some machines, the floating registers are especially slow to
!      access, so that it is better to store a value in a stack frame than
!      in such a register if floating point arithmetic is not being done.
!      As long as the floating registers are not in class 'GENERAL_REGS',
!      they will not be used unless some pattern's constraint asks for
!      one.
  
   -- Macro: HARD_REGNO_RENAME_OK (FROM, TO)
       A C expression that is nonzero if it is OK to rename a hard
*************** consecutive registers are needed for a g
*** 29734,29763 ****
       A C expression that is nonzero if a value of mode MODE1 is
       accessible in mode MODE2 without copying.
  
!      If `HARD_REGNO_MODE_OK (R, MODE1)' and `HARD_REGNO_MODE_OK (R,
!      MODE2)' are always the same for any R, then `MODES_TIEABLE_P
       (MODE1, MODE2)' should be nonzero.  If they differ for any R, you
!      should define this macro to return zero unless some other
!      mechanism ensures the accessibility of the value in a narrower
!      mode.
  
       You should define this macro to return nonzero in as many cases as
       possible since doing so will allow GCC to perform better register
       allocation.
  
   -- Target Hook: bool TARGET_HARD_REGNO_SCRATCH_OK (unsigned int REGNO)
!      This target hook should return `true' if it is OK to use a hard
       register REGNO as scratch reg in peephole2.
  
       One common use of this macro is to prevent using of a register that
       is not saved by a prologue in an interrupt handler.
  
!      The default version of this hook always returns `true'.
  
   -- Macro: AVOID_CCMODE_COPIES
       Define this macro if the compiler should avoid copies to/from
!      `CCmode' registers.  You should only define this macro if support
!      for copying to/from `CCmode' is incomplete.
  
  
  File: gccint.info,  Node: Leaf Functions,  Next: Stack Registers,  Prev: Values in Registers,  Up: Registers
--- 29351,29379 ----
       A C expression that is nonzero if a value of mode MODE1 is
       accessible in mode MODE2 without copying.
  
!      If 'HARD_REGNO_MODE_OK (R, MODE1)' and 'HARD_REGNO_MODE_OK (R,
!      MODE2)' are always the same for any R, then 'MODES_TIEABLE_P
       (MODE1, MODE2)' should be nonzero.  If they differ for any R, you
!      should define this macro to return zero unless some other mechanism
!      ensures the accessibility of the value in a narrower mode.
  
       You should define this macro to return nonzero in as many cases as
       possible since doing so will allow GCC to perform better register
       allocation.
  
   -- Target Hook: bool TARGET_HARD_REGNO_SCRATCH_OK (unsigned int REGNO)
!      This target hook should return 'true' if it is OK to use a hard
       register REGNO as scratch reg in peephole2.
  
       One common use of this macro is to prevent using of a register that
       is not saved by a prologue in an interrupt handler.
  
!      The default version of this hook always returns 'true'.
  
   -- Macro: AVOID_CCMODE_COPIES
       Define this macro if the compiler should avoid copies to/from
!      'CCmode' registers.  You should only define this macro if support
!      for copying to/from 'CCmode' is incomplete.
  
  
  File: gccint.info,  Node: Leaf Functions,  Next: Stack Registers,  Prev: Values in Registers,  Up: Registers
*************** File: gccint.info,  Node: Leaf Functions
*** 29766,29782 ****
  ------------------------------
  
  On some machines, a leaf function (i.e., one which makes no calls) can
! run more efficiently if it does not make its own register window.
! Often this means it is required to receive its arguments in the
! registers where they are passed by the caller, instead of the registers
! where they would normally arrive.
  
   The special treatment for leaf functions generally applies only when
  other conditions are met; for example, often they may use only those
  registers for its own variables and temporaries.  We use the term "leaf
! function" to mean a function that is suitable for this special
! handling, so that functions with no calls are not necessarily "leaf
! functions".
  
   GCC assigns register numbers before it knows whether the function is
  suitable for leaf function treatment.  So it needs to renumber the
--- 29382,29397 ----
  ------------------------------
  
  On some machines, a leaf function (i.e., one which makes no calls) can
! run more efficiently if it does not make its own register window.  Often
! this means it is required to receive its arguments in the registers
! where they are passed by the caller, instead of the registers where they
! would normally arrive.
  
   The special treatment for leaf functions generally applies only when
  other conditions are met; for example, often they may use only those
  registers for its own variables and temporaries.  We use the term "leaf
! function" to mean a function that is suitable for this special handling,
! so that functions with no calls are not necessarily "leaf functions".
  
   GCC assigns register numbers before it knows whether the function is
  suitable for leaf function treatment.  So it needs to renumber the
*************** accomplish this.
*** 29788,29795 ****
       contains 1 for a register that is allowable in a candidate for leaf
       function treatment.
  
!      If leaf function treatment involves renumbering the registers,
!      then the registers marked here should be the ones before
       renumbering--those that GCC would ordinarily allocate.  The
       registers which will actually be used in the assembler code, after
       renumbering, should not be marked with 1 in this vector.
--- 29403,29410 ----
       contains 1 for a register that is allowable in a candidate for leaf
       function treatment.
  
!      If leaf function treatment involves renumbering the registers, then
!      the registers marked here should be the ones before
       renumbering--those that GCC would ordinarily allocate.  The
       registers which will actually be used in the assembler code, after
       renumbering, should not be marked with 1 in this vector.
*************** accomplish this.
*** 29810,29825 ****
       optimize the treatment of leaf functions, and registers need to be
       renumbered to do this.
  
!  `TARGET_ASM_FUNCTION_PROLOGUE' and `TARGET_ASM_FUNCTION_EPILOGUE' must
  usually treat leaf functions specially.  They can test the C variable
! `current_function_is_leaf' which is nonzero for leaf functions.
! `current_function_is_leaf' is set prior to local register allocation
! and is valid for the remaining compiler passes.  They can also test the
! C variable `current_function_uses_only_leaf_regs' which is nonzero for
  leaf functions which only use leaf registers.
! `current_function_uses_only_leaf_regs' is valid after all passes that
  modify the instructions have been run and is only useful if
! `LEAF_REGISTERS' is defined.
  
  
  File: gccint.info,  Node: Stack Registers,  Prev: Leaf Functions,  Up: Registers
--- 29425,29440 ----
       optimize the treatment of leaf functions, and registers need to be
       renumbered to do this.
  
!  'TARGET_ASM_FUNCTION_PROLOGUE' and 'TARGET_ASM_FUNCTION_EPILOGUE' must
  usually treat leaf functions specially.  They can test the C variable
! 'current_function_is_leaf' which is nonzero for leaf functions.
! 'current_function_is_leaf' is set prior to local register allocation and
! is valid for the remaining compiler passes.  They can also test the C
! variable 'current_function_uses_only_leaf_regs' which is nonzero for
  leaf functions which only use leaf registers.
! 'current_function_uses_only_leaf_regs' is valid after all passes that
  modify the instructions have been run and is only useful if
! 'LEAF_REGISTERS' is defined.
  
  
  File: gccint.info,  Node: Stack Registers,  Prev: Leaf Functions,  Up: Registers
*************** stack.
*** 29836,29844 ****
  they must be consecutively numbered.  Furthermore, the existing support
  for stack-like registers is specific to the 80387 floating point
  coprocessor.  If you have a new architecture that uses stack-like
! registers, you will need to do substantial work on `reg-stack.c' and
! write your machine description to cooperate with it, as well as
! defining these macros.
  
   -- Macro: STACK_REGS
       Define this if the machine has any stack-like registers.
--- 29451,29459 ----
  they must be consecutively numbered.  Furthermore, the existing support
  for stack-like registers is specific to the 80387 floating point
  coprocessor.  If you have a new architecture that uses stack-like
! registers, you will need to do substantial work on 'reg-stack.c' and
! write your machine description to cooperate with it, as well as defining
! these macros.
  
   -- Macro: STACK_REGS
       Define this if the machine has any stack-like registers.
*************** defining these macros.
*** 29852,29859 ****
       of the stack.
  
   -- Macro: LAST_STACK_REG
!      The number of the last stack-like register.  This one is the
!      bottom of the stack.
  
  
  File: gccint.info,  Node: Register Classes,  Next: Stack and Calling,  Prev: Registers,  Up: Target Macros
--- 29467,29474 ----
       of the stack.
  
   -- Macro: LAST_STACK_REG
!      The number of the last stack-like register.  This one is the bottom
!      of the stack.
  
  
  File: gccint.info,  Node: Register Classes,  Next: Stack and Calling,  Prev: Registers,  Up: Target Macros
*************** register classes that are allowed as ope
*** 29873,29908 ****
  patterns.
  
   In general, each register will belong to several classes.  In fact, one
! class must be named `ALL_REGS' and contain all the registers.  Another
! class must be named `NO_REGS' and contain no registers.  Often the
! union of two classes will be another class; however, this is not
! required.
  
!  One of the classes must be named `GENERAL_REGS'.  There is nothing
! terribly special about the name, but the operand constraint letters `r'
! and `g' specify this class.  If `GENERAL_REGS' is the same as
! `ALL_REGS', just define it as a macro which expands to `ALL_REGS'.
  
!  Order the classes so that if class X is contained in class Y then X
! has a lower class number than Y.
  
!  The way classes other than `GENERAL_REGS' are specified in operand
  constraints is through machine-dependent operand constraint letters.
  You can define such letters to correspond to various classes, then use
  them in operand constraints.
  
   You must define the narrowest register classes for allocatable
! registers, so that each class either has no subclasses, or that for
! some mode, the move cost between registers within the class is cheaper
! than moving a register in the class to or from memory (*note Costs::).
  
   You should define a class for the union of two classes whenever some
  instruction allows both classes.  For example, if an instruction allows
! either a floating point (coprocessor) register or a general register
! for a certain operand, you should define a class `FLOAT_OR_GENERAL_REGS'
! which includes both of them.  Otherwise you will get suboptimal code,
! or even internal compiler errors when reload cannot find a register in
! the class computed via `reg_class_subunion'.
  
   You must also specify certain redundant information about the register
  classes: for each class, which classes contain it and which ones are
--- 29488,29522 ----
  patterns.
  
   In general, each register will belong to several classes.  In fact, one
! class must be named 'ALL_REGS' and contain all the registers.  Another
! class must be named 'NO_REGS' and contain no registers.  Often the union
! of two classes will be another class; however, this is not required.
  
!  One of the classes must be named 'GENERAL_REGS'.  There is nothing
! terribly special about the name, but the operand constraint letters 'r'
! and 'g' specify this class.  If 'GENERAL_REGS' is the same as
! 'ALL_REGS', just define it as a macro which expands to 'ALL_REGS'.
  
!  Order the classes so that if class X is contained in class Y then X has
! a lower class number than Y.
  
!  The way classes other than 'GENERAL_REGS' are specified in operand
  constraints is through machine-dependent operand constraint letters.
  You can define such letters to correspond to various classes, then use
  them in operand constraints.
  
   You must define the narrowest register classes for allocatable
! registers, so that each class either has no subclasses, or that for some
! mode, the move cost between registers within the class is cheaper than
! moving a register in the class to or from memory (*note Costs::).
  
   You should define a class for the union of two classes whenever some
  instruction allows both classes.  For example, if an instruction allows
! either a floating point (coprocessor) register or a general register for
! a certain operand, you should define a class 'FLOAT_OR_GENERAL_REGS'
! which includes both of them.  Otherwise you will get suboptimal code, or
! even internal compiler errors when reload cannot find a register in the
! class computed via 'reg_class_subunion'.
  
   You must also specify certain redundant information about the register
  classes: for each class, which classes contain it and which ones are
*************** in their union.
*** 29913,29941 ****
  certain class, all the registers used must belong to that class.
  Therefore, register classes cannot be used to enforce a requirement for
  a register pair to start with an even-numbered register.  The way to
! specify this requirement is with `HARD_REGNO_MODE_OK'.
  
   Register classes used for input-operands of bitwise-and or shift
  instructions have a special requirement: each such class must have, for
  each fixed-point machine mode, a subclass whose registers can transfer
  that mode to or from memory.  For example, on some machines, the
! operations for single-byte values (`QImode') are limited to certain
  registers.  When this is so, each register class that is used in a
  bitwise-and or shift instruction must have a subclass consisting of
  registers from which single-byte values can be loaded or stored.  This
! is so that `PREFERRED_RELOAD_CLASS' can always have a possible value to
  return.
  
   -- Data type: enum reg_class
!      An enumerated type that must be defined with all the register
!      class names as enumerated values.  `NO_REGS' must be first.
!      `ALL_REGS' must be the last register class, followed by one more
!      enumerated value, `LIM_REG_CLASSES', which is not a register class
!      but rather tells how many classes there are.
  
!      Each register class has a number, which is the value of casting
!      the class name to type `int'.  The number serves as an index in
!      many of the tables described below.
  
   -- Macro: N_REG_CLASSES
       The number of distinct register classes, defined as follows:
--- 29527,29555 ----
  certain class, all the registers used must belong to that class.
  Therefore, register classes cannot be used to enforce a requirement for
  a register pair to start with an even-numbered register.  The way to
! specify this requirement is with 'HARD_REGNO_MODE_OK'.
  
   Register classes used for input-operands of bitwise-and or shift
  instructions have a special requirement: each such class must have, for
  each fixed-point machine mode, a subclass whose registers can transfer
  that mode to or from memory.  For example, on some machines, the
! operations for single-byte values ('QImode') are limited to certain
  registers.  When this is so, each register class that is used in a
  bitwise-and or shift instruction must have a subclass consisting of
  registers from which single-byte values can be loaded or stored.  This
! is so that 'PREFERRED_RELOAD_CLASS' can always have a possible value to
  return.
  
   -- Data type: enum reg_class
!      An enumerated type that must be defined with all the register class
!      names as enumerated values.  'NO_REGS' must be first.  'ALL_REGS'
!      must be the last register class, followed by one more enumerated
!      value, 'LIM_REG_CLASSES', which is not a register class but rather
!      tells how many classes there are.
  
!      Each register class has a number, which is the value of casting the
!      class name to type 'int'.  The number serves as an index in many of
!      the tables described below.
  
   -- Macro: N_REG_CLASSES
       The number of distinct register classes, defined as follows:
*************** return.
*** 29951,29966 ****
       An initializer containing the contents of the register classes, as
       integers which are bit masks.  The Nth integer specifies the
       contents of class N.  The way the integer MASK is interpreted is
!      that register R is in the class if `MASK & (1 << R)' is 1.
  
       When the machine has more than 32 registers, an integer does not
       suffice.  Then the integers are replaced by sub-initializers,
!      braced groupings containing several integers.  Each
!      sub-initializer must be suitable as an initializer for the type
!      `HARD_REG_SET' which is defined in `hard-reg-set.h'.  In this
!      situation, the first integer in each sub-initializer corresponds to
!      registers 0 through 31, the second integer to registers 32 through
!      63, and so on.
  
   -- Macro: REGNO_REG_CLASS (REGNO)
       A C expression whose value is a register class containing hard
--- 29565,29579 ----
       An initializer containing the contents of the register classes, as
       integers which are bit masks.  The Nth integer specifies the
       contents of class N.  The way the integer MASK is interpreted is
!      that register R is in the class if 'MASK & (1 << R)' is 1.
  
       When the machine has more than 32 registers, an integer does not
       suffice.  Then the integers are replaced by sub-initializers,
!      braced groupings containing several integers.  Each sub-initializer
!      must be suitable as an initializer for the type 'HARD_REG_SET'
!      which is defined in 'hard-reg-set.h'.  In this situation, the first
!      integer in each sub-initializer corresponds to registers 0 through
!      31, the second integer to registers 32 through 63, and so on.
  
   -- Macro: REGNO_REG_CLASS (REGNO)
       A C expression whose value is a register class containing hard
*************** return.
*** 29974,29983 ****
       address which is the register value plus a displacement.
  
   -- Macro: MODE_BASE_REG_CLASS (MODE)
!      This is a variation of the `BASE_REG_CLASS' macro which allows the
       selection of a base register in a mode dependent manner.  If MODE
       is VOIDmode then it should return the same value as
!      `BASE_REG_CLASS'.
  
   -- Macro: MODE_BASE_REG_REG_CLASS (MODE)
       A C expression whose value is the register class to which a valid
--- 29587,29596 ----
       address which is the register value plus a displacement.
  
   -- Macro: MODE_BASE_REG_CLASS (MODE)
!      This is a variation of the 'BASE_REG_CLASS' macro which allows the
       selection of a base register in a mode dependent manner.  If MODE
       is VOIDmode then it should return the same value as
!      'BASE_REG_CLASS'.
  
   -- Macro: MODE_BASE_REG_REG_CLASS (MODE)
       A C expression whose value is the register class to which a valid
*************** return.
*** 29992,30001 ****
       base register for a memory reference in mode MODE to address space
       ADDRESS_SPACE must belong.  OUTER_CODE and INDEX_CODE define the
       context in which the base register occurs.  OUTER_CODE is the code
!      of the immediately enclosing expression (`MEM' for the top level
!      of an address, `ADDRESS' for something that occurs in an
!      `address_operand').  INDEX_CODE is the code of the corresponding
!      index expression if OUTER_CODE is `PLUS'; `SCRATCH' otherwise.
  
   -- Macro: INDEX_REG_CLASS
       A macro whose definition is the name of the class to which a valid
--- 29605,29614 ----
       base register for a memory reference in mode MODE to address space
       ADDRESS_SPACE must belong.  OUTER_CODE and INDEX_CODE define the
       context in which the base register occurs.  OUTER_CODE is the code
!      of the immediately enclosing expression ('MEM' for the top level of
!      an address, 'ADDRESS' for something that occurs in an
!      'address_operand').  INDEX_CODE is the code of the corresponding
!      index expression if OUTER_CODE is 'PLUS'; 'SCRATCH' otherwise.
  
   -- Macro: INDEX_REG_CLASS
       A macro whose definition is the name of the class to which a valid
*************** return.
*** 30008,30021 ****
       for use as a base register in operand addresses.
  
   -- Macro: REGNO_MODE_OK_FOR_BASE_P (NUM, MODE)
!      A C expression that is just like `REGNO_OK_FOR_BASE_P', except that
       that expression may examine the mode of the memory reference in
       MODE.  You should define this macro if the mode of the memory
       reference affects whether a register may be used as a base
       register.  If you define this macro, the compiler will use it
!      instead of `REGNO_OK_FOR_BASE_P'.  The mode may be `VOIDmode' for
!      addresses that appear outside a `MEM', i.e., as an
!      `address_operand'.
  
   -- Macro: REGNO_MODE_OK_FOR_REG_BASE_P (NUM, MODE)
       A C expression which is nonzero if register number NUM is suitable
--- 29621,29634 ----
       for use as a base register in operand addresses.
  
   -- Macro: REGNO_MODE_OK_FOR_BASE_P (NUM, MODE)
!      A C expression that is just like 'REGNO_OK_FOR_BASE_P', except that
       that expression may examine the mode of the memory reference in
       MODE.  You should define this macro if the mode of the memory
       reference affects whether a register may be used as a base
       register.  If you define this macro, the compiler will use it
!      instead of 'REGNO_OK_FOR_BASE_P'.  The mode may be 'VOIDmode' for
!      addresses that appear outside a 'MEM', i.e., as an
!      'address_operand'.
  
   -- Macro: REGNO_MODE_OK_FOR_REG_BASE_P (NUM, MODE)
       A C expression which is nonzero if register number NUM is suitable
*************** return.
*** 30027,30048 ****
       uses.
  
       Use of this macro is deprecated; please use the more general
!      `REGNO_MODE_CODE_OK_FOR_BASE_P'.
  
   -- Macro: REGNO_MODE_CODE_OK_FOR_BASE_P (NUM, MODE, ADDRESS_SPACE,
            OUTER_CODE, INDEX_CODE)
       A C expression which is nonzero if register number NUM is suitable
       for use as a base register in operand addresses, accessing memory
       in mode MODE in address space ADDRESS_SPACE.  This is similar to
!      `REGNO_MODE_OK_FOR_BASE_P', except that that expression may
!      examine the context in which the register appears in the memory
!      reference.  OUTER_CODE is the code of the immediately enclosing
!      expression (`MEM' if at the top level of the address, `ADDRESS'
!      for something that occurs in an `address_operand').  INDEX_CODE is
!      the code of the corresponding index expression if OUTER_CODE is
!      `PLUS'; `SCRATCH' otherwise.  The mode may be `VOIDmode' for
!      addresses that appear outside a `MEM', i.e., as an
!      `address_operand'.
  
   -- Macro: REGNO_OK_FOR_INDEX_P (NUM)
       A C expression which is nonzero if register number NUM is suitable
--- 29640,29660 ----
       uses.
  
       Use of this macro is deprecated; please use the more general
!      'REGNO_MODE_CODE_OK_FOR_BASE_P'.
  
   -- Macro: REGNO_MODE_CODE_OK_FOR_BASE_P (NUM, MODE, ADDRESS_SPACE,
            OUTER_CODE, INDEX_CODE)
       A C expression which is nonzero if register number NUM is suitable
       for use as a base register in operand addresses, accessing memory
       in mode MODE in address space ADDRESS_SPACE.  This is similar to
!      'REGNO_MODE_OK_FOR_BASE_P', except that that expression may examine
!      the context in which the register appears in the memory reference.
!      OUTER_CODE is the code of the immediately enclosing expression
!      ('MEM' if at the top level of the address, 'ADDRESS' for something
!      that occurs in an 'address_operand').  INDEX_CODE is the code of
!      the corresponding index expression if OUTER_CODE is 'PLUS';
!      'SCRATCH' otherwise.  The mode may be 'VOIDmode' for addresses that
!      appear outside a 'MEM', i.e., as an 'address_operand'.
  
   -- Macro: REGNO_OK_FOR_INDEX_P (NUM)
       A C expression which is nonzero if register number NUM is suitable
*************** return.
*** 30064,30108 ****
       A target hook that places additional preference on the register
       class to use when it is necessary to rename a register in class
       RCLASS to another class, or perhaps NO_REGS, if no preferred
!      register class is found or hook `preferred_rename_class' is not
!      implemented. Sometimes returning a more restrictive class makes
       better code.  For example, on ARM, thumb-2 instructions using
!      `LO_REGS' may be smaller than instructions using `GENERIC_REGS'.
!      By returning `LO_REGS' from `preferred_rename_class', code size
!      can be reduced.
  
   -- Target Hook: reg_class_t TARGET_PREFERRED_RELOAD_CLASS (rtx X,
            reg_class_t RCLASS)
       A target hook that places additional restrictions on the register
       class to use when it is necessary to copy value X into a register
!      in class RCLASS.  The value is a register class; perhaps RCLASS,
!      or perhaps another, smaller class.
  
!      The default version of this hook always returns value of `rclass'
       argument.
  
       Sometimes returning a more restrictive class makes better code.
!      For example, on the 68000, when X is an integer constant that is
!      in range for a `moveq' instruction, the value of this macro is
!      always `DATA_REGS' as long as RCLASS includes the data registers.
!      Requiring a data register guarantees that a `moveq' will be used.
  
!      One case where `TARGET_PREFERRED_RELOAD_CLASS' must not return
!      RCLASS is if X is a legitimate constant which cannot be loaded
!      into some register class.  By returning `NO_REGS' you can force X
!      into a memory location.  For example, rs6000 can load immediate
!      values into general-purpose registers, but does not have an
!      instruction for loading an immediate value into a floating-point
!      register, so `TARGET_PREFERRED_RELOAD_CLASS' returns `NO_REGS' when
!      X is a floating-point constant.  If the constant can't be loaded
!      into any kind of register, code generation will be better if
!      `TARGET_LEGITIMATE_CONSTANT_P' makes the constant illegitimate
!      instead of using `TARGET_PREFERRED_RELOAD_CLASS'.
  
!      If an insn has pseudos in it after register allocation, reload
!      will go through the alternatives and call repeatedly
!      `TARGET_PREFERRED_RELOAD_CLASS' to find the best one.  Returning
!      `NO_REGS', in this case, makes reload add a `!' in front of the
       constraint: the x86 back-end uses this feature to discourage usage
       of 387 registers when math is done in the SSE registers (and vice
       versa).
--- 29676,29720 ----
       A target hook that places additional preference on the register
       class to use when it is necessary to rename a register in class
       RCLASS to another class, or perhaps NO_REGS, if no preferred
!      register class is found or hook 'preferred_rename_class' is not
!      implemented.  Sometimes returning a more restrictive class makes
       better code.  For example, on ARM, thumb-2 instructions using
!      'LO_REGS' may be smaller than instructions using 'GENERIC_REGS'.
!      By returning 'LO_REGS' from 'preferred_rename_class', code size can
!      be reduced.
  
   -- Target Hook: reg_class_t TARGET_PREFERRED_RELOAD_CLASS (rtx X,
            reg_class_t RCLASS)
       A target hook that places additional restrictions on the register
       class to use when it is necessary to copy value X into a register
!      in class RCLASS.  The value is a register class; perhaps RCLASS, or
!      perhaps another, smaller class.
  
!      The default version of this hook always returns value of 'rclass'
       argument.
  
       Sometimes returning a more restrictive class makes better code.
!      For example, on the 68000, when X is an integer constant that is in
!      range for a 'moveq' instruction, the value of this macro is always
!      'DATA_REGS' as long as RCLASS includes the data registers.
!      Requiring a data register guarantees that a 'moveq' will be used.
  
!      One case where 'TARGET_PREFERRED_RELOAD_CLASS' must not return
!      RCLASS is if X is a legitimate constant which cannot be loaded into
!      some register class.  By returning 'NO_REGS' you can force X into a
!      memory location.  For example, rs6000 can load immediate values
!      into general-purpose registers, but does not have an instruction
!      for loading an immediate value into a floating-point register, so
!      'TARGET_PREFERRED_RELOAD_CLASS' returns 'NO_REGS' when X is a
!      floating-point constant.  If the constant can't be loaded into any
!      kind of register, code generation will be better if
!      'TARGET_LEGITIMATE_CONSTANT_P' makes the constant illegitimate
!      instead of using 'TARGET_PREFERRED_RELOAD_CLASS'.
  
!      If an insn has pseudos in it after register allocation, reload will
!      go through the alternatives and call repeatedly
!      'TARGET_PREFERRED_RELOAD_CLASS' to find the best one.  Returning
!      'NO_REGS', in this case, makes reload add a '!' in front of the
       constraint: the x86 back-end uses this feature to discourage usage
       of 387 registers when math is done in the SSE registers (and vice
       versa).
*************** return.
*** 30117,30158 ****
            #define PREFERRED_RELOAD_CLASS(X,CLASS) CLASS
  
       Sometimes returning a more restrictive class makes better code.
!      For example, on the 68000, when X is an integer constant that is
!      in range for a `moveq' instruction, the value of this macro is
!      always `DATA_REGS' as long as CLASS includes the data registers.
!      Requiring a data register guarantees that a `moveq' will be used.
  
!      One case where `PREFERRED_RELOAD_CLASS' must not return CLASS is
!      if X is a legitimate constant which cannot be loaded into some
!      register class.  By returning `NO_REGS' you can force X into a
       memory location.  For example, rs6000 can load immediate values
       into general-purpose registers, but does not have an instruction
       for loading an immediate value into a floating-point register, so
!      `PREFERRED_RELOAD_CLASS' returns `NO_REGS' when X is a
       floating-point constant.  If the constant can't be loaded into any
       kind of register, code generation will be better if
!      `TARGET_LEGITIMATE_CONSTANT_P' makes the constant illegitimate
!      instead of using `TARGET_PREFERRED_RELOAD_CLASS'.
  
!      If an insn has pseudos in it after register allocation, reload
!      will go through the alternatives and call repeatedly
!      `PREFERRED_RELOAD_CLASS' to find the best one.  Returning
!      `NO_REGS', in this case, makes reload add a `!' in front of the
       constraint: the x86 back-end uses this feature to discourage usage
       of 387 registers when math is done in the SSE registers (and vice
       versa).
  
   -- Target Hook: reg_class_t TARGET_PREFERRED_OUTPUT_RELOAD_CLASS (rtx
            X, reg_class_t RCLASS)
!      Like `TARGET_PREFERRED_RELOAD_CLASS', but for output reloads
       instead of input reloads.
  
!      The default version of this hook always returns value of `rclass'
       argument.
  
!      You can also use `TARGET_PREFERRED_OUTPUT_RELOAD_CLASS' to
       discourage reload from using some alternatives, like
!      `TARGET_PREFERRED_RELOAD_CLASS'.
  
   -- Macro: LIMIT_RELOAD_CLASS (MODE, CLASS)
       A C expression that places additional restrictions on the register
--- 29729,29770 ----
            #define PREFERRED_RELOAD_CLASS(X,CLASS) CLASS
  
       Sometimes returning a more restrictive class makes better code.
!      For example, on the 68000, when X is an integer constant that is in
!      range for a 'moveq' instruction, the value of this macro is always
!      'DATA_REGS' as long as CLASS includes the data registers.
!      Requiring a data register guarantees that a 'moveq' will be used.
  
!      One case where 'PREFERRED_RELOAD_CLASS' must not return CLASS is if
!      X is a legitimate constant which cannot be loaded into some
!      register class.  By returning 'NO_REGS' you can force X into a
       memory location.  For example, rs6000 can load immediate values
       into general-purpose registers, but does not have an instruction
       for loading an immediate value into a floating-point register, so
!      'PREFERRED_RELOAD_CLASS' returns 'NO_REGS' when X is a
       floating-point constant.  If the constant can't be loaded into any
       kind of register, code generation will be better if
!      'TARGET_LEGITIMATE_CONSTANT_P' makes the constant illegitimate
!      instead of using 'TARGET_PREFERRED_RELOAD_CLASS'.
  
!      If an insn has pseudos in it after register allocation, reload will
!      go through the alternatives and call repeatedly
!      'PREFERRED_RELOAD_CLASS' to find the best one.  Returning
!      'NO_REGS', in this case, makes reload add a '!' in front of the
       constraint: the x86 back-end uses this feature to discourage usage
       of 387 registers when math is done in the SSE registers (and vice
       versa).
  
   -- Target Hook: reg_class_t TARGET_PREFERRED_OUTPUT_RELOAD_CLASS (rtx
            X, reg_class_t RCLASS)
!      Like 'TARGET_PREFERRED_RELOAD_CLASS', but for output reloads
       instead of input reloads.
  
!      The default version of this hook always returns value of 'rclass'
       argument.
  
!      You can also use 'TARGET_PREFERRED_OUTPUT_RELOAD_CLASS' to
       discourage reload from using some alternatives, like
!      'TARGET_PREFERRED_RELOAD_CLASS'.
  
   -- Macro: LIMIT_RELOAD_CLASS (MODE, CLASS)
       A C expression that places additional restrictions on the register
*************** return.
*** 30160,30166 ****
       mode MODE in a reload register for which class CLASS would
       ordinarily be used.
  
!      Unlike `PREFERRED_RELOAD_CLASS', this macro should be used when
       there are certain modes that simply can't go in certain reload
       classes.
  
--- 29772,29778 ----
       mode MODE in a reload register for which class CLASS would
       ordinarily be used.
  
!      Unlike 'PREFERRED_RELOAD_CLASS', this macro should be used when
       there are certain modes that simply can't go in certain reload
       classes.
  
*************** return.
*** 30173,30191 ****
   -- Target Hook: reg_class_t TARGET_SECONDARY_RELOAD (bool IN_P, rtx X,
            reg_class_t RELOAD_CLASS, machine_mode RELOAD_MODE,
            secondary_reload_info *SRI)
!      Many machines have some registers that cannot be copied directly
!      to or from memory or even from other types of registers.  An
!      example is the `MQ' register, which on most machines, can only be
!      copied to or from general registers, but not memory.  Below, we
!      shall be using the term 'intermediate register' when a move
!      operation cannot be performed directly, but has to be done by
!      copying the source into the intermediate register first, and then
!      copying the intermediate register to the destination.  An
!      intermediate register always has the same mode as source and
!      destination.  Since it holds the actual value being copied, reload
!      might apply optimizations to re-use an intermediate register and
!      eliding the copy from the source when it can determine that the
!      intermediate register still holds the required value.
  
       Another kind of secondary reload is required on some machines which
       allow copying all registers to and from memory, but require a
--- 29785,29803 ----
   -- Target Hook: reg_class_t TARGET_SECONDARY_RELOAD (bool IN_P, rtx X,
            reg_class_t RELOAD_CLASS, machine_mode RELOAD_MODE,
            secondary_reload_info *SRI)
!      Many machines have some registers that cannot be copied directly to
!      or from memory or even from other types of registers.  An example
!      is the 'MQ' register, which on most machines, can only be copied to
!      or from general registers, but not memory.  Below, we shall be
!      using the term 'intermediate register' when a move operation cannot
!      be performed directly, but has to be done by copying the source
!      into the intermediate register first, and then copying the
!      intermediate register to the destination.  An intermediate register
!      always has the same mode as source and destination.  Since it holds
!      the actual value being copied, reload might apply optimizations to
!      re-use an intermediate register and eliding the copy from the
!      source when it can determine that the intermediate register still
!      holds the required value.
  
       Another kind of secondary reload is required on some machines which
       allow copying all registers to and from memory, but require a
*************** return.
*** 30208,30288 ****
       needs to be copied to rtx X in RELOAD_MODE.
  
       If copying a register of RELOAD_CLASS from/to X requires an
!      intermediate register, the hook `secondary_reload' should return
       the register class required for this intermediate register.  If no
!      intermediate register is required, it should return NO_REGS.  If
       more than one intermediate register is required, describe the one
       that is closest in the copy chain to the reload register.
  
       If scratch registers are needed, you also have to describe how to
       perform the copy from/to the reload register to/from this closest
!      intermediate register.  Or if no intermediate register is
!      required, but still a scratch register is needed, describe the
!      copy  from/to the reload register to/from the reload operand X.
  
!      You do this by setting `sri->icode' to the instruction code of a
       pattern in the md file which performs the move.  Operands 0 and 1
!      are the output and input of this copy, respectively.  Operands
!      from operand 2 onward are for scratch operands.  These scratch
!      operands must have a mode, and a single-register-class output
!      constraint.
  
!      When an intermediate register is used, the `secondary_reload' hook
       will be called again to determine how to copy the intermediate
       register to/from the reload operand X, so your hook must also have
       code to handle the register class of the intermediate operand.
  
!      X might be a pseudo-register or a `subreg' of a pseudo-register,
       which could either be in a hard register or in memory.  Use
!      `true_regnum' to find out; it will return -1 if the pseudo is in
       memory and the hard register number if it is in a register.
  
!      Scratch operands in memory (constraint `"=m"' / `"=&m"') are
       currently not supported.  For the time being, you will have to
!      continue to use `SECONDARY_MEMORY_NEEDED' for that purpose.
  
!      `copy_cost' also uses this target hook to find out how values are
       copied.  If you want it to include some extra cost for the need to
!      allocate (a) scratch register(s), set `sri->extra_cost' to the
       additional cost.  Or if two dependent moves are supposed to have a
       lower cost than the sum of the individual moves due to expected
       fortuitous scheduling and/or special forwarding logic, you can set
!      `sri->extra_cost' to a negative amount.
  
   -- Macro: SECONDARY_RELOAD_CLASS (CLASS, MODE, X)
   -- Macro: SECONDARY_INPUT_RELOAD_CLASS (CLASS, MODE, X)
   -- Macro: SECONDARY_OUTPUT_RELOAD_CLASS (CLASS, MODE, X)
       These macros are obsolete, new ports should use the target hook
!      `TARGET_SECONDARY_RELOAD' instead.
  
       These are obsolete macros, replaced by the
!      `TARGET_SECONDARY_RELOAD' target hook.  Older ports still define
       these macros to indicate to the reload phase that it may need to
       allocate at least one register for a reload in addition to the
       register to contain the data.  Specifically, if copying X to a
       register CLASS in MODE requires an intermediate register, you were
!      supposed to define `SECONDARY_INPUT_RELOAD_CLASS' to return the
       largest register class all of whose registers can be used as
       intermediate registers or scratch registers.
  
       If copying a register CLASS in MODE to X requires an intermediate
!      or scratch register, `SECONDARY_OUTPUT_RELOAD_CLASS' was supposed
       to be defined be defined to return the largest register class
       required.  If the requirements for input and output reloads were
!      the same, the macro `SECONDARY_RELOAD_CLASS' should have been used
       instead of defining both macros identically.
  
!      The values returned by these macros are often `GENERAL_REGS'.
!      Return `NO_REGS' if no spare register is needed; i.e., if X can be
       directly copied to or from a register of CLASS in MODE without
!      requiring a scratch register.  Do not define this macro if it
!      would always return `NO_REGS'.
  
       If a scratch register is required (either with or without an
       intermediate register), you were supposed to define patterns for
!      `reload_inM' or `reload_outM', as required (*note Standard
!      Names::.  These patterns, which were normally implemented with a
!      `define_expand', should be similar to the `movM' patterns, except
       that operand 2 is the scratch register.
  
       These patterns need constraints for the reload register and scratch
--- 29820,29899 ----
       needs to be copied to rtx X in RELOAD_MODE.
  
       If copying a register of RELOAD_CLASS from/to X requires an
!      intermediate register, the hook 'secondary_reload' should return
       the register class required for this intermediate register.  If no
!      intermediate register is required, it should return NO_REGS. If
       more than one intermediate register is required, describe the one
       that is closest in the copy chain to the reload register.
  
       If scratch registers are needed, you also have to describe how to
       perform the copy from/to the reload register to/from this closest
!      intermediate register.  Or if no intermediate register is required,
!      but still a scratch register is needed, describe the copy from/to
!      the reload register to/from the reload operand X.
  
!      You do this by setting 'sri->icode' to the instruction code of a
       pattern in the md file which performs the move.  Operands 0 and 1
!      are the output and input of this copy, respectively.  Operands from
!      operand 2 onward are for scratch operands.  These scratch operands
!      must have a mode, and a single-register-class output constraint.
  
!      When an intermediate register is used, the 'secondary_reload' hook
       will be called again to determine how to copy the intermediate
       register to/from the reload operand X, so your hook must also have
       code to handle the register class of the intermediate operand.
  
!      X might be a pseudo-register or a 'subreg' of a pseudo-register,
       which could either be in a hard register or in memory.  Use
!      'true_regnum' to find out; it will return -1 if the pseudo is in
       memory and the hard register number if it is in a register.
  
!      Scratch operands in memory (constraint '"=m"' / '"=&m"') are
       currently not supported.  For the time being, you will have to
!      continue to use 'SECONDARY_MEMORY_NEEDED' for that purpose.
  
!      'copy_cost' also uses this target hook to find out how values are
       copied.  If you want it to include some extra cost for the need to
!      allocate (a) scratch register(s), set 'sri->extra_cost' to the
       additional cost.  Or if two dependent moves are supposed to have a
       lower cost than the sum of the individual moves due to expected
       fortuitous scheduling and/or special forwarding logic, you can set
!      'sri->extra_cost' to a negative amount.
  
   -- Macro: SECONDARY_RELOAD_CLASS (CLASS, MODE, X)
   -- Macro: SECONDARY_INPUT_RELOAD_CLASS (CLASS, MODE, X)
   -- Macro: SECONDARY_OUTPUT_RELOAD_CLASS (CLASS, MODE, X)
       These macros are obsolete, new ports should use the target hook
!      'TARGET_SECONDARY_RELOAD' instead.
  
       These are obsolete macros, replaced by the
!      'TARGET_SECONDARY_RELOAD' target hook.  Older ports still define
       these macros to indicate to the reload phase that it may need to
       allocate at least one register for a reload in addition to the
       register to contain the data.  Specifically, if copying X to a
       register CLASS in MODE requires an intermediate register, you were
!      supposed to define 'SECONDARY_INPUT_RELOAD_CLASS' to return the
       largest register class all of whose registers can be used as
       intermediate registers or scratch registers.
  
       If copying a register CLASS in MODE to X requires an intermediate
!      or scratch register, 'SECONDARY_OUTPUT_RELOAD_CLASS' was supposed
       to be defined be defined to return the largest register class
       required.  If the requirements for input and output reloads were
!      the same, the macro 'SECONDARY_RELOAD_CLASS' should have been used
       instead of defining both macros identically.
  
!      The values returned by these macros are often 'GENERAL_REGS'.
!      Return 'NO_REGS' if no spare register is needed; i.e., if X can be
       directly copied to or from a register of CLASS in MODE without
!      requiring a scratch register.  Do not define this macro if it would
!      always return 'NO_REGS'.
  
       If a scratch register is required (either with or without an
       intermediate register), you were supposed to define patterns for
!      'reload_inM' or 'reload_outM', as required (*note Standard Names::.
!      These patterns, which were normally implemented with a
!      'define_expand', should be similar to the 'movM' patterns, except
       that operand 2 is the scratch register.
  
       These patterns need constraints for the reload register and scratch
*************** return.
*** 30290,30308 ****
       reload register (whose class is CLASS) can meet the constraint
       given in the pattern, the value returned by these macros is used
       for the class of the scratch register.  Otherwise, two additional
!      reload registers are required.  Their classes are obtained from
!      the constraints in the insn pattern.
  
!      X might be a pseudo-register or a `subreg' of a pseudo-register,
       which could either be in a hard register or in memory.  Use
!      `true_regnum' to find out; it will return -1 if the pseudo is in
       memory and the hard register number if it is in a register.
  
       These macros should not be used in the case where a particular
       class of registers can only be copied to memory and not to another
       class of registers.  In that case, secondary reload registers are
       not needed and would not be helpful.  Instead, a stack location
!      must be used to perform the copy and the `movM' pattern should use
       memory as an intermediate storage.  This case often occurs between
       floating-point and general registers.
  
--- 29901,29919 ----
       reload register (whose class is CLASS) can meet the constraint
       given in the pattern, the value returned by these macros is used
       for the class of the scratch register.  Otherwise, two additional
!      reload registers are required.  Their classes are obtained from the
!      constraints in the insn pattern.
  
!      X might be a pseudo-register or a 'subreg' of a pseudo-register,
       which could either be in a hard register or in memory.  Use
!      'true_regnum' to find out; it will return -1 if the pseudo is in
       memory and the hard register number if it is in a register.
  
       These macros should not be used in the case where a particular
       class of registers can only be copied to memory and not to another
       class of registers.  In that case, secondary reload registers are
       not needed and would not be helpful.  Instead, a stack location
!      must be used to perform the copy and the 'movM' pattern should use
       memory as an intermediate storage.  This case often occurs between
       floating-point and general registers.
  
*************** return.
*** 30317,30336 ****
       Do not define this macro if its value would always be zero.
  
   -- Macro: SECONDARY_MEMORY_NEEDED_RTX (MODE)
!      Normally when `SECONDARY_MEMORY_NEEDED' is defined, the compiler
       allocates a stack slot for a memory location needed for register
       copies.  If this macro is defined, the compiler instead uses the
       memory location defined by this macro.
  
       Do not define this macro if you do not define
!      `SECONDARY_MEMORY_NEEDED'.
  
   -- Macro: SECONDARY_MEMORY_NEEDED_MODE (MODE)
!      When the compiler needs a secondary memory location to copy
!      between two registers of mode MODE, it normally allocates
!      sufficient memory to hold a quantity of `BITS_PER_WORD' bits and
!      performs the store and load operations in a mode that many bits
!      wide and whose class is the same as that of MODE.
  
       This is right thing to do on most machines because it ensures that
       all bits of the register are copied and prevents accesses to the
--- 29928,29947 ----
       Do not define this macro if its value would always be zero.
  
   -- Macro: SECONDARY_MEMORY_NEEDED_RTX (MODE)
!      Normally when 'SECONDARY_MEMORY_NEEDED' is defined, the compiler
       allocates a stack slot for a memory location needed for register
       copies.  If this macro is defined, the compiler instead uses the
       memory location defined by this macro.
  
       Do not define this macro if you do not define
!      'SECONDARY_MEMORY_NEEDED'.
  
   -- Macro: SECONDARY_MEMORY_NEEDED_MODE (MODE)
!      When the compiler needs a secondary memory location to copy between
!      two registers of mode MODE, it normally allocates sufficient memory
!      to hold a quantity of 'BITS_PER_WORD' bits and performs the store
!      and load operations in a mode that many bits wide and whose class
!      is the same as that of MODE.
  
       This is right thing to do on most machines because it ensures that
       all bits of the register are copied and prevents accesses to the
*************** return.
*** 30340,30360 ****
       However, this default behavior is not correct on some machines,
       such as the DEC Alpha, that store short integers in floating-point
       registers differently than in integer registers.  On those
!      machines, the default widening will not work correctly and you
!      must define this macro to suppress that widening in some cases.
!      See the file `alpha.h' for details.
  
       Do not define this macro if you do not define
!      `SECONDARY_MEMORY_NEEDED' or if widening MODE to a mode that is
!      `BITS_PER_WORD' bits wide is correct for your machine.
  
   -- Target Hook: bool TARGET_CLASS_LIKELY_SPILLED_P (reg_class_t RCLASS)
!      A target hook which returns `true' if pseudos that have been
       assigned to registers of class RCLASS would likely be spilled
       because registers of RCLASS are needed for spill registers.
  
!      The default version of this target hook returns `true' if RCLASS
!      has exactly one register and `false' otherwise.  On most machines,
       this default should be used.  For generally register-starved
       machines, such as i386, or machines with right register
       constraints, such as SH, this hook can be used to avoid excessive
--- 29951,29971 ----
       However, this default behavior is not correct on some machines,
       such as the DEC Alpha, that store short integers in floating-point
       registers differently than in integer registers.  On those
!      machines, the default widening will not work correctly and you must
!      define this macro to suppress that widening in some cases.  See the
!      file 'alpha.h' for details.
  
       Do not define this macro if you do not define
!      'SECONDARY_MEMORY_NEEDED' or if widening MODE to a mode that is
!      'BITS_PER_WORD' bits wide is correct for your machine.
  
   -- Target Hook: bool TARGET_CLASS_LIKELY_SPILLED_P (reg_class_t RCLASS)
!      A target hook which returns 'true' if pseudos that have been
       assigned to registers of class RCLASS would likely be spilled
       because registers of RCLASS are needed for spill registers.
  
!      The default version of this target hook returns 'true' if RCLASS
!      has exactly one register and 'false' otherwise.  On most machines,
       this default should be used.  For generally register-starved
       machines, such as i386, or machines with right register
       constraints, such as SH, this hook can be used to avoid excessive
*************** return.
*** 30369,30393 ****
       A target hook returns the maximum number of consecutive registers
       of class RCLASS needed to hold a value of mode MODE.
  
!      This is closely related to the macro `HARD_REGNO_NREGS'.  In fact,
!      the value returned by `TARGET_CLASS_MAX_NREGS (RCLASS, MODE)'
!      target hook should be the maximum value of `HARD_REGNO_NREGS
       (REGNO, MODE)' for all REGNO values in the class RCLASS.
  
       This target hook helps control the handling of multiple-word values
       in the reload pass.
  
!      The default version of this target hook returns the size of MODE
!      in words.
  
   -- Macro: CLASS_MAX_NREGS (CLASS, MODE)
       A C expression for the maximum number of consecutive registers of
       class CLASS needed to hold a value of mode MODE.
  
!      This is closely related to the macro `HARD_REGNO_NREGS'.  In fact,
!      the value of the macro `CLASS_MAX_NREGS (CLASS, MODE)' should be
!      the maximum value of `HARD_REGNO_NREGS (REGNO, MODE)' for all
!      REGNO values in the class CLASS.
  
       This macro helps control the handling of multiple-word values in
       the reload pass.
--- 29980,30004 ----
       A target hook returns the maximum number of consecutive registers
       of class RCLASS needed to hold a value of mode MODE.
  
!      This is closely related to the macro 'HARD_REGNO_NREGS'.  In fact,
!      the value returned by 'TARGET_CLASS_MAX_NREGS (RCLASS, MODE)'
!      target hook should be the maximum value of 'HARD_REGNO_NREGS
       (REGNO, MODE)' for all REGNO values in the class RCLASS.
  
       This target hook helps control the handling of multiple-word values
       in the reload pass.
  
!      The default version of this target hook returns the size of MODE in
!      words.
  
   -- Macro: CLASS_MAX_NREGS (CLASS, MODE)
       A C expression for the maximum number of consecutive registers of
       class CLASS needed to hold a value of mode MODE.
  
!      This is closely related to the macro 'HARD_REGNO_NREGS'.  In fact,
!      the value of the macro 'CLASS_MAX_NREGS (CLASS, MODE)' should be
!      the maximum value of 'HARD_REGNO_NREGS (REGNO, MODE)' for all REGNO
!      values in the class CLASS.
  
       This macro helps control the handling of multiple-word values in
       the reload pass.
*************** return.
*** 30400,30486 ****
       floating-point registers on Alpha extends them to 64 bits.
       Therefore loading a 64-bit object and then storing it as a 32-bit
       object does not store the low-order 32 bits, as would be the case
!      for a normal register.  Therefore, `alpha.h' defines
!      `CANNOT_CHANGE_MODE_CLASS' as below:
  
            #define CANNOT_CHANGE_MODE_CLASS(FROM, TO, CLASS) \
              (GET_MODE_SIZE (FROM) != GET_MODE_SIZE (TO) \
               ? reg_classes_intersect_p (FLOAT_REGS, (CLASS)) : 0)
  
       Even if storing from a register in mode TO would be valid, if both
!      FROM and `raw_reg_mode' for CLASS are wider than `word_mode', then
       we must prevent TO narrowing the mode.  This happens when the
       middle-end assumes that it can load or store pieces of an N-word
       pseudo, and that the pseudo will eventually be allocated to N
!      `word_mode' hard registers.  Failure to prevent this kind of mode
!      change will result in the entire `raw_reg_mode' being modified
       instead of the partial value that the middle-end intended.
  
- 
   -- Target Hook: bool TARGET_LRA_P (void)
       A target hook which returns true if we use LRA instead of reload
!      pass.  It means that LRA was ported to the target.    The default
       version of this target hook returns always false.
  
   -- Target Hook: int TARGET_REGISTER_PRIORITY (int)
       A target hook which returns the register priority number to which
!      the  register HARD_REGNO belongs to.  The bigger the number, the
       more preferable the hard register usage (when all other conditions
!      are  the same).  This hook can be used to prefer some hard
!      register over  others in LRA.  For example, some x86-64 register
!      usage needs  additional prefix which makes instructions longer.
!      The hook can  return lower priority number for such registers make
!      them less favorable  and as result making the generated code
!      smaller.    The default version of this target hook returns always
!      zero.
  
   -- Target Hook: bool TARGET_REGISTER_USAGE_LEVELING_P (void)
       A target hook which returns true if we need register usage
       leveling.  That means if a few hard registers are equally good for
!      the  assignment, we choose the least used hard register.  The
!      register  usage leveling may be profitable for some targets.
!      Don't use the  usage leveling for targets with conditional
!      execution or targets  with big register files as it hurts
!      if-conversion and cross-jumping  optimizations.    The default
!      version of this target hook returns always false.
  
   -- Target Hook: bool TARGET_DIFFERENT_ADDR_DISPLACEMENT_P (void)
       A target hook which returns true if an address with the same
!      structure  can have different maximal legitimate displacement.
!      For example, the  displacement can depend on memory mode or on
!      operand combinations in  the insn.    The default version of this
!      target hook returns always false.
  
   -- Target Hook: bool TARGET_CANNOT_SUBSTITUTE_MEM_EQUIV_P (rtx SUBST)
!      A target hook which returns `true' if SUBST can't substitute
!      safely pseudos with equivalent memory values during register
!      allocation.  The default version of this target hook returns
!      `false'.  On most machines, this default should be used.  For
!      generally machines with non orthogonal register usage for
!      addressing, such as SH, this hook can be used to avoid excessive
!      spilling.
  
!  -- Target Hook: bool TARGET_LEGITIMIZE_ADDRESS_DISPLACEMENT (rtx
!           *DISP, rtx *OFFSET, machine_mode MODE)
!      A target hook which returns `true' if *DISP is legitimezed to
!      valid address displacement with subtracting *OFFSET at memory mode
!      MODE.  The default version of this target hook returns `false'.
!      This hook will benefit machines with limited base plus displacement
       addressing.
  
   -- Target Hook: reg_class_t TARGET_SPILL_CLASS (reg_class_t,
            MACHINE_MODE)
       This hook defines a class of registers which could be used for
!      spilling  pseudos of the given mode and class, or `NO_REGS' if
!      only memory  should be used.  Not defining this hook is equivalent
!      to returning  `NO_REGS' for all inputs.
  
   -- Target Hook: machine_mode TARGET_CSTORE_MODE (enum insn_code ICODE)
!      This hook defines the machine mode to use for the boolean result
!      of  conditional store patterns.  The ICODE argument is the
!      instruction code  for the cstore being performed.  Not definiting
!      this hook is the same  as accepting the mode encoded into operand
!      0 of the cstore expander  patterns.
  
  
  File: gccint.info,  Node: Stack and Calling,  Next: Varargs,  Prev: Register Classes,  Up: Target Macros
--- 30011,30094 ----
       floating-point registers on Alpha extends them to 64 bits.
       Therefore loading a 64-bit object and then storing it as a 32-bit
       object does not store the low-order 32 bits, as would be the case
!      for a normal register.  Therefore, 'alpha.h' defines
!      'CANNOT_CHANGE_MODE_CLASS' as below:
  
            #define CANNOT_CHANGE_MODE_CLASS(FROM, TO, CLASS) \
              (GET_MODE_SIZE (FROM) != GET_MODE_SIZE (TO) \
               ? reg_classes_intersect_p (FLOAT_REGS, (CLASS)) : 0)
  
       Even if storing from a register in mode TO would be valid, if both
!      FROM and 'raw_reg_mode' for CLASS are wider than 'word_mode', then
       we must prevent TO narrowing the mode.  This happens when the
       middle-end assumes that it can load or store pieces of an N-word
       pseudo, and that the pseudo will eventually be allocated to N
!      'word_mode' hard registers.  Failure to prevent this kind of mode
!      change will result in the entire 'raw_reg_mode' being modified
       instead of the partial value that the middle-end intended.
  
   -- Target Hook: bool TARGET_LRA_P (void)
       A target hook which returns true if we use LRA instead of reload
!      pass.  It means that LRA was ported to the target.  The default
       version of this target hook returns always false.
  
   -- Target Hook: int TARGET_REGISTER_PRIORITY (int)
       A target hook which returns the register priority number to which
!      the register HARD_REGNO belongs to.  The bigger the number, the
       more preferable the hard register usage (when all other conditions
!      are the same).  This hook can be used to prefer some hard register
!      over others in LRA. For example, some x86-64 register usage needs
!      additional prefix which makes instructions longer.  The hook can
!      return lower priority number for such registers make them less
!      favorable and as result making the generated code smaller.  The
!      default version of this target hook returns always zero.
  
   -- Target Hook: bool TARGET_REGISTER_USAGE_LEVELING_P (void)
       A target hook which returns true if we need register usage
       leveling.  That means if a few hard registers are equally good for
!      the assignment, we choose the least used hard register.  The
!      register usage leveling may be profitable for some targets.  Don't
!      use the usage leveling for targets with conditional execution or
!      targets with big register files as it hurts if-conversion and
!      cross-jumping optimizations.  The default version of this target
!      hook returns always false.
  
   -- Target Hook: bool TARGET_DIFFERENT_ADDR_DISPLACEMENT_P (void)
       A target hook which returns true if an address with the same
!      structure can have different maximal legitimate displacement.  For
!      example, the displacement can depend on memory mode or on operand
!      combinations in the insn.  The default version of this target hook
!      returns always false.
  
   -- Target Hook: bool TARGET_CANNOT_SUBSTITUTE_MEM_EQUIV_P (rtx SUBST)
!      A target hook which returns 'true' if SUBST can't substitute safely
!      pseudos with equivalent memory values during register allocation.
!      The default version of this target hook returns 'false'.  On most
!      machines, this default should be used.  For generally machines with
!      non orthogonal register usage for addressing, such as SH, this hook
!      can be used to avoid excessive spilling.
  
!  -- Target Hook: bool TARGET_LEGITIMIZE_ADDRESS_DISPLACEMENT (rtx *DISP,
!           rtx *OFFSET, machine_mode MODE)
!      A target hook which returns 'true' if *DISP is legitimezed to valid
!      address displacement with subtracting *OFFSET at memory mode MODE.
!      The default version of this target hook returns 'false'.  This hook
!      will benefit machines with limited base plus displacement
       addressing.
  
   -- Target Hook: reg_class_t TARGET_SPILL_CLASS (reg_class_t,
            MACHINE_MODE)
       This hook defines a class of registers which could be used for
!      spilling pseudos of the given mode and class, or 'NO_REGS' if only
!      memory should be used.  Not defining this hook is equivalent to
!      returning 'NO_REGS' for all inputs.
  
   -- Target Hook: machine_mode TARGET_CSTORE_MODE (enum insn_code ICODE)
!      This hook defines the machine mode to use for the boolean result of
!      conditional store patterns.  The ICODE argument is the instruction
!      code for the cstore being performed.  Not definiting this hook is
!      the same as accepting the mode encoded into operand 0 of the cstore
!      expander patterns.
  
  
  File: gccint.info,  Node: Stack and Calling,  Next: Varargs,  Prev: Register Classes,  Up: Target Macros
*************** Here is the basic stack layout.
*** 30520,30541 ****
       Define this macro if pushing a word onto the stack moves the stack
       pointer to a smaller address.
  
!      When we say, "define this macro if ...", it means that the
!      compiler checks this macro only with `#ifdef' so the precise
!      definition used does not matter.
  
   -- Macro: STACK_PUSH_CODE
       This macro defines the operation used when something is pushed on
!      the stack.  In RTL, a push operation will be `(set (mem
       (STACK_PUSH_CODE (reg sp))) ...)'
  
!      The choices are `PRE_DEC', `POST_DEC', `PRE_INC', and `POST_INC'.
       Which of these is correct depends on the stack direction and on
       whether the stack pointer points to the last item on the stack or
       whether it points to the space for the next item on the stack.
  
!      The default is `PRE_DEC' when `STACK_GROWS_DOWNWARD' is defined,
!      which is almost always right, and `PRE_INC' otherwise, which is
       often wrong.
  
   -- Macro: FRAME_GROWS_DOWNWARD
--- 30128,30149 ----
       Define this macro if pushing a word onto the stack moves the stack
       pointer to a smaller address.
  
!      When we say, "define this macro if ...", it means that the compiler
!      checks this macro only with '#ifdef' so the precise definition used
!      does not matter.
  
   -- Macro: STACK_PUSH_CODE
       This macro defines the operation used when something is pushed on
!      the stack.  In RTL, a push operation will be '(set (mem
       (STACK_PUSH_CODE (reg sp))) ...)'
  
!      The choices are 'PRE_DEC', 'POST_DEC', 'PRE_INC', and 'POST_INC'.
       Which of these is correct depends on the stack direction and on
       whether the stack pointer points to the last item on the stack or
       whether it points to the space for the next item on the stack.
  
!      The default is 'PRE_DEC' when 'STACK_GROWS_DOWNWARD' is defined,
!      which is almost always right, and 'PRE_INC' otherwise, which is
       often wrong.
  
   -- Macro: FRAME_GROWS_DOWNWARD
*************** Here is the basic stack layout.
*** 30550,30577 ****
       Offset from the frame pointer to the first local variable slot to
       be allocated.
  
!      If `FRAME_GROWS_DOWNWARD', find the next slot's offset by
!      subtracting the first slot's length from `STARTING_FRAME_OFFSET'.
       Otherwise, it is found by adding the length of the first slot to
!      the value `STARTING_FRAME_OFFSET'.
  
   -- Macro: STACK_ALIGNMENT_NEEDED
       Define to zero to disable final alignment of the stack during
       reload.  The nonzero default for this macro is suitable for most
       ports.
  
!      On ports where `STARTING_FRAME_OFFSET' is nonzero or where there
!      is a register save block following the local block that doesn't
!      require alignment to `STACK_BOUNDARY', it may be beneficial to
       disable stack alignment and do it in the backend.
  
   -- Macro: STACK_POINTER_OFFSET
       Offset from the stack pointer register to the first location at
!      which outgoing arguments are placed.  If not specified, the
!      default value of zero is used.  This is the proper value for most
!      machines.
  
!      If `ARGS_GROW_DOWNWARD', this is the offset to the location above
       the first location at which outgoing arguments are placed.
  
   -- Macro: FIRST_PARM_OFFSET (FUNDECL)
--- 30158,30184 ----
       Offset from the frame pointer to the first local variable slot to
       be allocated.
  
!      If 'FRAME_GROWS_DOWNWARD', find the next slot's offset by
!      subtracting the first slot's length from 'STARTING_FRAME_OFFSET'.
       Otherwise, it is found by adding the length of the first slot to
!      the value 'STARTING_FRAME_OFFSET'.
  
   -- Macro: STACK_ALIGNMENT_NEEDED
       Define to zero to disable final alignment of the stack during
       reload.  The nonzero default for this macro is suitable for most
       ports.
  
!      On ports where 'STARTING_FRAME_OFFSET' is nonzero or where there is
!      a register save block following the local block that doesn't
!      require alignment to 'STACK_BOUNDARY', it may be beneficial to
       disable stack alignment and do it in the backend.
  
   -- Macro: STACK_POINTER_OFFSET
       Offset from the stack pointer register to the first location at
!      which outgoing arguments are placed.  If not specified, the default
!      value of zero is used.  This is the proper value for most machines.
  
!      If 'ARGS_GROW_DOWNWARD', this is the offset to the location above
       the first location at which outgoing arguments are placed.
  
   -- Macro: FIRST_PARM_OFFSET (FUNDECL)
*************** Here is the basic stack layout.
*** 30579,30603 ****
       address.  On some machines it may depend on the data type of the
       function.
  
!      If `ARGS_GROW_DOWNWARD', this is the offset to the location above
       the first argument's address.
  
   -- Macro: STACK_DYNAMIC_OFFSET (FUNDECL)
       Offset from the stack pointer register to an item dynamically
!      allocated on the stack, e.g., by `alloca'.
  
!      The default value for this macro is `STACK_POINTER_OFFSET' plus the
       length of the outgoing arguments.  The default is correct for most
!      machines.  See `function.c' for details.
  
   -- Macro: INITIAL_FRAME_ADDRESS_RTX
       A C expression whose value is RTL representing the address of the
!      initial stack frame. This address is passed to `RETURN_ADDR_RTX'
!      and `DYNAMIC_CHAIN_ADDRESS'.  If you don't define this macro, a
       reasonable default value will be used.  Define this macro in order
       to make frame pointer elimination work in the presence of
!      `__builtin_frame_address (count)' and `__builtin_return_address
!      (count)' for `count' not equal to zero.
  
   -- Macro: DYNAMIC_CHAIN_ADDRESS (FRAMEADDR)
       A C expression whose value is RTL representing the address in a
--- 30186,30210 ----
       address.  On some machines it may depend on the data type of the
       function.
  
!      If 'ARGS_GROW_DOWNWARD', this is the offset to the location above
       the first argument's address.
  
   -- Macro: STACK_DYNAMIC_OFFSET (FUNDECL)
       Offset from the stack pointer register to an item dynamically
!      allocated on the stack, e.g., by 'alloca'.
  
!      The default value for this macro is 'STACK_POINTER_OFFSET' plus the
       length of the outgoing arguments.  The default is correct for most
!      machines.  See 'function.c' for details.
  
   -- Macro: INITIAL_FRAME_ADDRESS_RTX
       A C expression whose value is RTL representing the address of the
!      initial stack frame.  This address is passed to 'RETURN_ADDR_RTX'
!      and 'DYNAMIC_CHAIN_ADDRESS'.  If you don't define this macro, a
       reasonable default value will be used.  Define this macro in order
       to make frame pointer elimination work in the presence of
!      '__builtin_frame_address (count)' and '__builtin_return_address
!      (count)' for 'count' not equal to zero.
  
   -- Macro: DYNAMIC_CHAIN_ADDRESS (FRAMEADDR)
       A C expression whose value is RTL representing the address in a
*************** Here is the basic stack layout.
*** 30612,30627 ****
   -- Macro: SETUP_FRAME_ADDRESSES
       If defined, a C expression that produces the machine-specific code
       to setup the stack so that arbitrary frames can be accessed.  For
!      example, on the SPARC, we must flush all of the register windows
!      to the stack before we can access arbitrary stack frames.  You
!      will seldom need to define this macro.
  
   -- Target Hook: rtx TARGET_BUILTIN_SETJMP_FRAME_VALUE (void)
       This target hook should return an rtx that is used to store the
!      address of the current frame into the built in `setjmp' buffer.
!      The default value, `virtual_stack_vars_rtx', is correct for most
       machines.  One reason you may need to define this target hook is if
!      `hard_frame_pointer_rtx' is the appropriate value on your machine.
  
   -- Macro: FRAME_ADDR_RTX (FRAMEADDR)
       A C expression whose value is RTL representing the value of the
--- 30219,30234 ----
   -- Macro: SETUP_FRAME_ADDRESSES
       If defined, a C expression that produces the machine-specific code
       to setup the stack so that arbitrary frames can be accessed.  For
!      example, on the SPARC, we must flush all of the register windows to
!      the stack before we can access arbitrary stack frames.  You will
!      seldom need to define this macro.
  
   -- Target Hook: rtx TARGET_BUILTIN_SETJMP_FRAME_VALUE (void)
       This target hook should return an rtx that is used to store the
!      address of the current frame into the built in 'setjmp' buffer.
!      The default value, 'virtual_stack_vars_rtx', is correct for most
       machines.  One reason you may need to define this target hook is if
!      'hard_frame_pointer_rtx' is the appropriate value on your machine.
  
   -- Macro: FRAME_ADDR_RTX (FRAMEADDR)
       A C expression whose value is RTL representing the value of the
*************** Here is the basic stack layout.
*** 30633,30645 ****
  
   -- Macro: RETURN_ADDR_RTX (COUNT, FRAMEADDR)
       A C expression whose value is RTL representing the value of the
!      return address for the frame COUNT steps up from the current
!      frame, after the prologue.  FRAMEADDR is the frame pointer of the
!      COUNT frame, or the frame pointer of the COUNT - 1 frame if
!      `RETURN_ADDR_IN_PREVIOUS_FRAME' is nonzero.
  
       The value of the expression must always be the correct address when
!      COUNT is zero, but may be `NULL_RTX' if there is no way to
       determine the return address of other frames.
  
   -- Macro: RETURN_ADDR_IN_PREVIOUS_FRAME
--- 30240,30252 ----
  
   -- Macro: RETURN_ADDR_RTX (COUNT, FRAMEADDR)
       A C expression whose value is RTL representing the value of the
!      return address for the frame COUNT steps up from the current frame,
!      after the prologue.  FRAMEADDR is the frame pointer of the COUNT
!      frame, or the frame pointer of the COUNT - 1 frame if
!      'RETURN_ADDR_IN_PREVIOUS_FRAME' is nonzero.
  
       The value of the expression must always be the correct address when
!      COUNT is zero, but may be 'NULL_RTX' if there is no way to
       determine the return address of other frames.
  
   -- Macro: RETURN_ADDR_IN_PREVIOUS_FRAME
*************** Here is the basic stack layout.
*** 30651,30673 ****
   -- Macro: INCOMING_RETURN_ADDR_RTX
       A C expression whose value is RTL representing the location of the
       incoming return address at the beginning of any function, before
!      the prologue.  This RTL is either a `REG', indicating that the
!      return value is saved in `REG', or a `MEM' representing a location
       in the stack.
  
       You only need to define this macro if you want to support call
       frame debugging information like that provided by DWARF 2.
  
!      If this RTL is a `REG', you should also define
!      `DWARF_FRAME_RETURN_COLUMN' to `DWARF_FRAME_REGNUM (REGNO)'.
  
   -- Macro: DWARF_ALT_FRAME_RETURN_COLUMN
       A C expression whose value is an integer giving a DWARF 2 column
       number that may be used as an alternative return column.  The
       column must not correspond to any gcc hard register (that is, it
!      must not be in the range of `DWARF_FRAME_REGNUM').
  
!      This macro can be useful if `DWARF_FRAME_RETURN_COLUMN' is set to a
       general register, but an alternative column needs to be used for
       signal frames.  Some targets have also used different frame return
       columns over time.
--- 30258,30280 ----
   -- Macro: INCOMING_RETURN_ADDR_RTX
       A C expression whose value is RTL representing the location of the
       incoming return address at the beginning of any function, before
!      the prologue.  This RTL is either a 'REG', indicating that the
!      return value is saved in 'REG', or a 'MEM' representing a location
       in the stack.
  
       You only need to define this macro if you want to support call
       frame debugging information like that provided by DWARF 2.
  
!      If this RTL is a 'REG', you should also define
!      'DWARF_FRAME_RETURN_COLUMN' to 'DWARF_FRAME_REGNUM (REGNO)'.
  
   -- Macro: DWARF_ALT_FRAME_RETURN_COLUMN
       A C expression whose value is an integer giving a DWARF 2 column
       number that may be used as an alternative return column.  The
       column must not correspond to any gcc hard register (that is, it
!      must not be in the range of 'DWARF_FRAME_REGNUM').
  
!      This macro can be useful if 'DWARF_FRAME_RETURN_COLUMN' is set to a
       general register, but an alternative column needs to be used for
       signal frames.  Some targets have also used different frame return
       columns over time.
*************** Here is the basic stack layout.
*** 30677,30684 ****
       number that is considered to always have the value zero.  This
       should only be defined if the target has an architected zero
       register, and someone decided it was a good idea to use that
!      register number to terminate the stack backtrace.  New ports
!      should avoid this.
  
   -- Target Hook: void TARGET_DWARF_HANDLE_FRAME_UNSPEC (const char
            *LABEL, rtx PATTERN, int INDEX)
--- 30284,30291 ----
       number that is considered to always have the value zero.  This
       should only be defined if the target has an architected zero
       register, and someone decided it was a good idea to use that
!      register number to terminate the stack backtrace.  New ports should
!      avoid this.
  
   -- Target Hook: void TARGET_DWARF_HANDLE_FRAME_UNSPEC (const char
            *LABEL, rtx PATTERN, int INDEX)
*************** Here is the basic stack layout.
*** 30690,30696 ****
            (set (reg) (unspec_volatile [...] UNSPECV_INDEX)).
       to let the backend emit the call frame instructions.  LABEL is the
       CFI label attached to the insn, PATTERN is the pattern of the insn
!      and INDEX is `UNSPEC_INDEX' or `UNSPECV_INDEX'.
  
   -- Macro: INCOMING_FRAME_SP_OFFSET
       A C expression whose value is an integer giving the offset, in
--- 30297,30303 ----
            (set (reg) (unspec_volatile [...] UNSPECV_INDEX)).
       to let the backend emit the call frame instructions.  LABEL is the
       CFI label attached to the insn, PATTERN is the pattern of the insn
!      and INDEX is 'UNSPEC_INDEX' or 'UNSPECV_INDEX'.
  
   -- Macro: INCOMING_FRAME_SP_OFFSET
       A C expression whose value is an integer giving the offset, in
*************** Here is the basic stack layout.
*** 30707,30746 ****
       A C expression whose value is an integer giving the offset, in
       bytes, from the argument pointer to the canonical frame address
       (cfa).  The final value should coincide with that calculated by
!      `INCOMING_FRAME_SP_OFFSET'.  Which is unfortunately not usable
       during virtual register instantiation.
  
!      The default value for this macro is `FIRST_PARM_OFFSET (fundecl) +
       crtl->args.pretend_args_size', which is correct for most machines;
       in general, the arguments are found immediately before the stack
       frame.  Note that this is not the case on some targets that save
!      registers into the caller's frame, such as SPARC and rs6000, and
!      so such targets need to define this macro.
  
!      You only need to define this macro if the default is incorrect,
!      and you want to support call frame debugging information like that
       provided by DWARF 2.
  
   -- Macro: FRAME_POINTER_CFA_OFFSET (FUNDECL)
       If defined, a C expression whose value is an integer giving the
       offset in bytes from the frame pointer to the canonical frame
       address (cfa).  The final value should coincide with that
!      calculated by `INCOMING_FRAME_SP_OFFSET'.
  
       Normally the CFA is calculated as an offset from the argument
!      pointer, via `ARG_POINTER_CFA_OFFSET', but if the argument pointer
       is variable due to the ABI, this may not be possible.  If this
       macro is defined, it implies that the virtual register
       instantiation should be based on the frame pointer instead of the
!      argument pointer.  Only one of `FRAME_POINTER_CFA_OFFSET' and
!      `ARG_POINTER_CFA_OFFSET' should be defined.
  
   -- Macro: CFA_FRAME_BASE_OFFSET (FUNDECL)
       If defined, a C expression whose value is an integer giving the
!      offset in bytes from the canonical frame address (cfa) to the
!      frame base used in DWARF 2 debug information.  The default is
!      zero.  A different value may reduce the size of debug information
!      on some ports.
  
  
  File: gccint.info,  Node: Exception Handling,  Next: Stack Checking,  Prev: Frame Layout,  Up: Stack and Calling
--- 30314,30353 ----
       A C expression whose value is an integer giving the offset, in
       bytes, from the argument pointer to the canonical frame address
       (cfa).  The final value should coincide with that calculated by
!      'INCOMING_FRAME_SP_OFFSET'.  Which is unfortunately not usable
       during virtual register instantiation.
  
!      The default value for this macro is 'FIRST_PARM_OFFSET (fundecl) +
       crtl->args.pretend_args_size', which is correct for most machines;
       in general, the arguments are found immediately before the stack
       frame.  Note that this is not the case on some targets that save
!      registers into the caller's frame, such as SPARC and rs6000, and so
!      such targets need to define this macro.
  
!      You only need to define this macro if the default is incorrect, and
!      you want to support call frame debugging information like that
       provided by DWARF 2.
  
   -- Macro: FRAME_POINTER_CFA_OFFSET (FUNDECL)
       If defined, a C expression whose value is an integer giving the
       offset in bytes from the frame pointer to the canonical frame
       address (cfa).  The final value should coincide with that
!      calculated by 'INCOMING_FRAME_SP_OFFSET'.
  
       Normally the CFA is calculated as an offset from the argument
!      pointer, via 'ARG_POINTER_CFA_OFFSET', but if the argument pointer
       is variable due to the ABI, this may not be possible.  If this
       macro is defined, it implies that the virtual register
       instantiation should be based on the frame pointer instead of the
!      argument pointer.  Only one of 'FRAME_POINTER_CFA_OFFSET' and
!      'ARG_POINTER_CFA_OFFSET' should be defined.
  
   -- Macro: CFA_FRAME_BASE_OFFSET (FUNDECL)
       If defined, a C expression whose value is an integer giving the
!      offset in bytes from the canonical frame address (cfa) to the frame
!      base used in DWARF 2 debug information.  The default is zero.  A
!      different value may reduce the size of debug information on some
!      ports.
  
  
  File: gccint.info,  Node: Exception Handling,  Next: Stack Checking,  Prev: Frame Layout,  Up: Stack and Calling
*************** File: gccint.info,  Node: Exception Hand
*** 30749,30756 ****
  ---------------------------------
  
   -- Macro: EH_RETURN_DATA_REGNO (N)
!      A C expression whose value is the Nth register number used for
!      data by exception handlers, or `INVALID_REGNUM' if fewer than N
       registers are usable.
  
       The exception handling library routines communicate with the
--- 30356,30363 ----
  ---------------------------------
  
   -- Macro: EH_RETURN_DATA_REGNO (N)
!      A C expression whose value is the Nth register number used for data
!      by exception handlers, or 'INVALID_REGNUM' if fewer than N
       registers are usable.
  
       The exception handling library routines communicate with the
*************** File: gccint.info,  Node: Exception Hand
*** 30790,30811 ****
       normal return address is stored.  For targets that return by
       popping an address off the stack, this might be a memory address
       just below the _target_ call frame rather than inside the current
!      call frame.  If defined, `EH_RETURN_STACKADJ_RTX' will have already
       been assigned, so it may be used to calculate the location of the
       target call frame.
  
       Some targets have more complex requirements than storing to an
       address calculable during initial code generation.  In that case
!      the `eh_return' instruction pattern should be used instead.
  
       If you want to support call frame exception handling, you must
!      define either this macro or the `eh_return' instruction pattern.
  
   -- Macro: RETURN_ADDR_OFFSET
       If defined, an integer-valued C expression for which rtl will be
       generated to add it to the exception handler address before it is
!      searched in the exception handling tables, and to subtract it
!      again from the address before using it to return to the exception
       handler.
  
   -- Macro: ASM_PREFERRED_EH_DATA_FORMAT (CODE, GLOBAL)
--- 30397,30418 ----
       normal return address is stored.  For targets that return by
       popping an address off the stack, this might be a memory address
       just below the _target_ call frame rather than inside the current
!      call frame.  If defined, 'EH_RETURN_STACKADJ_RTX' will have already
       been assigned, so it may be used to calculate the location of the
       target call frame.
  
       Some targets have more complex requirements than storing to an
       address calculable during initial code generation.  In that case
!      the 'eh_return' instruction pattern should be used instead.
  
       If you want to support call frame exception handling, you must
!      define either this macro or the 'eh_return' instruction pattern.
  
   -- Macro: RETURN_ADDR_OFFSET
       If defined, an integer-valued C expression for which rtl will be
       generated to add it to the exception handler address before it is
!      searched in the exception handling tables, and to subtract it again
!      from the address before using it to return to the exception
       handler.
  
   -- Macro: ASM_PREFERRED_EH_DATA_FORMAT (CODE, GLOBAL)
*************** File: gccint.info,  Node: Exception Hand
*** 30817,30823 ****
       CODE is 0 for data, 1 for code labels, 2 for function pointers.
       GLOBAL is true if the symbol may be affected by dynamic
       relocations.  The macro should return a combination of the
!      `DW_EH_PE_*' defines as found in `dwarf2.h'.
  
       If this macro is not defined, pointers will not be encoded but
       represented directly.
--- 30424,30430 ----
       CODE is 0 for data, 1 for code labels, 2 for function pointers.
       GLOBAL is true if the symbol may be affected by dynamic
       relocations.  The macro should return a combination of the
!      'DW_EH_PE_*' defines as found in 'dwarf2.h'.
  
       If this macro is not defined, pointers will not be encoded but
       represented directly.
*************** File: gccint.info,  Node: Exception Hand
*** 30826,30838 ****
            ADDR, DONE)
       This macro allows the target to emit whatever special magic is
       required to represent the encoding chosen by
!      `ASM_PREFERRED_EH_DATA_FORMAT'.  Generic code takes care of
       pc-relative and indirect encodings; this must be defined if the
       target uses text-relative or data-relative encodings.
  
       This is a C statement that branches to DONE if the format was
       handled.  ENCODING is the format chosen, SIZE is the number of
!      bytes that the format occupies, ADDR is the `SYMBOL_REF' to be
       emitted.
  
   -- Macro: MD_FALLBACK_FRAME_STATE_FOR (CONTEXT, FS)
--- 30433,30445 ----
            ADDR, DONE)
       This macro allows the target to emit whatever special magic is
       required to represent the encoding chosen by
!      'ASM_PREFERRED_EH_DATA_FORMAT'.  Generic code takes care of
       pc-relative and indirect encodings; this must be defined if the
       target uses text-relative or data-relative encodings.
  
       This is a C statement that branches to DONE if the format was
       handled.  ENCODING is the format chosen, SIZE is the number of
!      bytes that the format occupies, ADDR is the 'SYMBOL_REF' to be
       emitted.
  
   -- Macro: MD_FALLBACK_FRAME_STATE_FOR (CONTEXT, FS)
*************** File: gccint.info,  Node: Exception Hand
*** 30841,30876 ****
       unwind data available.  The most common reason to implement this
       macro is to unwind through signal frames.
  
!      This macro is called from `uw_frame_state_for' in `unwind-dw2.c',
!      `unwind-dw2-xtensa.c' and `unwind-ia64.c'.  CONTEXT is an
!      `_Unwind_Context'; FS is an `_Unwind_FrameState'.  Examine
!      `context->ra' for the address of the code being executed and
!      `context->cfa' for the stack pointer value.  If the frame can be
       decoded, the register save addresses should be updated in FS and
!      the macro should evaluate to `_URC_NO_REASON'.  If the frame
!      cannot be decoded, the macro should evaluate to
!      `_URC_END_OF_STACK'.
  
       For proper signal handling in Java this macro is accompanied by
!      `MAKE_THROW_FRAME', defined in `libjava/include/*-signal.h'
       headers.
  
   -- Macro: MD_HANDLE_UNWABI (CONTEXT, FS)
       This macro allows the target to add operating system specific code
!      to the call-frame unwinder to handle the IA-64 `.unwabi' unwinding
       directive, usually used for signal or interrupt frames.
  
!      This macro is called from `uw_update_context' in libgcc's
!      `unwind-ia64.c'.  CONTEXT is an `_Unwind_Context'; FS is an
!      `_Unwind_FrameState'.  Examine `fs->unwabi' for the abi and
!      context in the `.unwabi' directive.  If the `.unwabi' directive
!      can be handled, the register save addresses should be updated in
!      FS.
  
   -- Macro: TARGET_USES_WEAK_UNWIND_INFO
       A C expression that evaluates to true if the target requires unwind
!      info to be given comdat linkage.  Define it to be `1' if comdat
!      linkage is necessary.  The default is `0'.
  
  
  File: gccint.info,  Node: Stack Checking,  Next: Frame Registers,  Prev: Exception Handling,  Up: Stack and Calling
--- 30448,30481 ----
       unwind data available.  The most common reason to implement this
       macro is to unwind through signal frames.
  
!      This macro is called from 'uw_frame_state_for' in 'unwind-dw2.c',
!      'unwind-dw2-xtensa.c' and 'unwind-ia64.c'.  CONTEXT is an
!      '_Unwind_Context'; FS is an '_Unwind_FrameState'.  Examine
!      'context->ra' for the address of the code being executed and
!      'context->cfa' for the stack pointer value.  If the frame can be
       decoded, the register save addresses should be updated in FS and
!      the macro should evaluate to '_URC_NO_REASON'.  If the frame cannot
!      be decoded, the macro should evaluate to '_URC_END_OF_STACK'.
  
       For proper signal handling in Java this macro is accompanied by
!      'MAKE_THROW_FRAME', defined in 'libjava/include/*-signal.h'
       headers.
  
   -- Macro: MD_HANDLE_UNWABI (CONTEXT, FS)
       This macro allows the target to add operating system specific code
!      to the call-frame unwinder to handle the IA-64 '.unwabi' unwinding
       directive, usually used for signal or interrupt frames.
  
!      This macro is called from 'uw_update_context' in libgcc's
!      'unwind-ia64.c'.  CONTEXT is an '_Unwind_Context'; FS is an
!      '_Unwind_FrameState'.  Examine 'fs->unwabi' for the abi and context
!      in the '.unwabi' directive.  If the '.unwabi' directive can be
!      handled, the register save addresses should be updated in FS.
  
   -- Macro: TARGET_USES_WEAK_UNWIND_INFO
       A C expression that evaluates to true if the target requires unwind
!      info to be given comdat linkage.  Define it to be '1' if comdat
!      linkage is necessary.  The default is '0'.
  
  
  File: gccint.info,  Node: Stack Checking,  Next: Frame Registers,  Prev: Exception Handling,  Up: Stack and Calling
*************** File: gccint.info,  Node: Stack Checking
*** 30879,30898 ****
  --------------------------------------------
  
  GCC will check that stack references are within the boundaries of the
! stack, if the option `-fstack-check' is specified, in one of three ways:
  
!   1. If the value of the `STACK_CHECK_BUILTIN' macro is nonzero, GCC
       will assume that you have arranged for full stack checking to be
       done at appropriate places in the configuration files.  GCC will
       not do other special processing.
  
!   2. If `STACK_CHECK_BUILTIN' is zero and the value of the
!      `STACK_CHECK_STATIC_BUILTIN' macro is nonzero, GCC will assume
!      that you have arranged for static stack checking (checking of the
!      static stack frame of functions) to be done at appropriate places
!      in the configuration files.  GCC will only emit code to do dynamic
!      stack checking (checking on dynamic stack allocations) using the
!      third approach below.
  
    3. If neither of the above are true, GCC will generate code to
       periodically "probe" the stack pointer using the values of the
--- 30484,30503 ----
  --------------------------------------------
  
  GCC will check that stack references are within the boundaries of the
! stack, if the option '-fstack-check' is specified, in one of three ways:
  
!   1. If the value of the 'STACK_CHECK_BUILTIN' macro is nonzero, GCC
       will assume that you have arranged for full stack checking to be
       done at appropriate places in the configuration files.  GCC will
       not do other special processing.
  
!   2. If 'STACK_CHECK_BUILTIN' is zero and the value of the
!      'STACK_CHECK_STATIC_BUILTIN' macro is nonzero, GCC will assume that
!      you have arranged for static stack checking (checking of the static
!      stack frame of functions) to be done at appropriate places in the
!      configuration files.  GCC will only emit code to do dynamic stack
!      checking (checking on dynamic stack allocations) using the third
!      approach below.
  
    3. If neither of the above are true, GCC will generate code to
       periodically "probe" the stack pointer using the values of the
*************** stack, if the option `-fstack-check' is
*** 30900,30914 ****
  
   If neither STACK_CHECK_BUILTIN nor STACK_CHECK_STATIC_BUILTIN is
  defined, GCC will change its allocation strategy for large objects if
! the option `-fstack-check' is specified: they will always be allocated
! dynamically if their size exceeds `STACK_CHECK_MAX_VAR_SIZE' bytes.
  
   -- Macro: STACK_CHECK_BUILTIN
       A nonzero value if stack checking is done by the configuration
       files in a machine-dependent manner.  You should define this macro
       if stack checking is required by the ABI of your machine or if you
!      would like to do stack checking in some more efficient way than
!      the generic approach.  The default value of this macro is zero.
  
   -- Macro: STACK_CHECK_STATIC_BUILTIN
       A nonzero value if static stack checking is done by the
--- 30505,30519 ----
  
   If neither STACK_CHECK_BUILTIN nor STACK_CHECK_STATIC_BUILTIN is
  defined, GCC will change its allocation strategy for large objects if
! the option '-fstack-check' is specified: they will always be allocated
! dynamically if their size exceeds 'STACK_CHECK_MAX_VAR_SIZE' bytes.
  
   -- Macro: STACK_CHECK_BUILTIN
       A nonzero value if stack checking is done by the configuration
       files in a machine-dependent manner.  You should define this macro
       if stack checking is required by the ABI of your machine or if you
!      would like to do stack checking in some more efficient way than the
!      generic approach.  The default value of this macro is zero.
  
   -- Macro: STACK_CHECK_STATIC_BUILTIN
       A nonzero value if static stack checking is done by the
*************** dynamically if their size exceeds `STACK
*** 30918,30943 ****
       value of this macro is zero.
  
   -- Macro: STACK_CHECK_PROBE_INTERVAL_EXP
!      An integer specifying the interval at which GCC must generate
!      stack probe instructions, defined as 2 raised to this integer.
!      You will normally define this macro so that the interval be no
!      larger than the size of the "guard pages" at the end of a stack
!      area.  The default value of 12 (4096-byte interval) is suitable
!      for most systems.
  
   -- Macro: STACK_CHECK_MOVING_SP
       An integer which is nonzero if GCC should move the stack pointer
       page by page when doing probes.  This can be necessary on systems
       where the stack pointer contains the bottom address of the memory
       area accessible to the executing thread at any point in time.  In
!      this situation an alternate signal stack is required in order to
!      be able to recover from a stack overflow.  The default value of
!      this macro is zero.
  
   -- Macro: STACK_CHECK_PROTECT
       The number of bytes of stack needed to recover from a stack
       overflow, for languages where such a recovery is supported.  The
!      default value of 75 words with the `setjmp'/`longjmp'-based
       exception handling mechanism and 8192 bytes with other exception
       handling mechanisms should be adequate for most machines.
  
--- 30523,30548 ----
       value of this macro is zero.
  
   -- Macro: STACK_CHECK_PROBE_INTERVAL_EXP
!      An integer specifying the interval at which GCC must generate stack
!      probe instructions, defined as 2 raised to this integer.  You will
!      normally define this macro so that the interval be no larger than
!      the size of the "guard pages" at the end of a stack area.  The
!      default value of 12 (4096-byte interval) is suitable for most
!      systems.
  
   -- Macro: STACK_CHECK_MOVING_SP
       An integer which is nonzero if GCC should move the stack pointer
       page by page when doing probes.  This can be necessary on systems
       where the stack pointer contains the bottom address of the memory
       area accessible to the executing thread at any point in time.  In
!      this situation an alternate signal stack is required in order to be
!      able to recover from a stack overflow.  The default value of this
!      macro is zero.
  
   -- Macro: STACK_CHECK_PROTECT
       The number of bytes of stack needed to recover from a stack
       overflow, for languages where such a recovery is supported.  The
!      default value of 75 words with the 'setjmp'/'longjmp'-based
       exception handling mechanism and 8192 bytes with other exception
       handling mechanisms should be adequate for most machines.
  
*************** in the opposite case.
*** 30948,30958 ****
   -- Macro: STACK_CHECK_MAX_FRAME_SIZE
       The maximum size of a stack frame, in bytes.  GCC will generate
       probe instructions in non-leaf functions to ensure at least this
!      many bytes of stack are available.  If a stack frame is larger
!      than this size, stack checking will not be reliable and GCC will
!      issue a warning.  The default is chosen so that GCC only generates
!      one instruction on most systems.  You should normally not change
!      the default value of this macro.
  
   -- Macro: STACK_CHECK_FIXED_FRAME_SIZE
       GCC uses this value to generate the above warning message.  It
--- 30553,30563 ----
   -- Macro: STACK_CHECK_MAX_FRAME_SIZE
       The maximum size of a stack frame, in bytes.  GCC will generate
       probe instructions in non-leaf functions to ensure at least this
!      many bytes of stack are available.  If a stack frame is larger than
!      this size, stack checking will not be reliable and GCC will issue a
!      warning.  The default is chosen so that GCC only generates one
!      instruction on most systems.  You should normally not change the
!      default value of this macro.
  
   -- Macro: STACK_CHECK_FIXED_FRAME_SIZE
       GCC uses this value to generate the above warning message.  It
*************** in the opposite case.
*** 30964,30970 ****
   -- Macro: STACK_CHECK_MAX_VAR_SIZE
       The maximum size, in bytes, of an object that GCC will place in the
       fixed area of the stack frame when the user specifies
!      `-fstack-check'.  GCC computed the default from the values of the
       above macros and you will normally not need to override that
       default.
  
--- 30569,30575 ----
   -- Macro: STACK_CHECK_MAX_VAR_SIZE
       The maximum size, in bytes, of an object that GCC will place in the
       fixed area of the stack frame when the user specifies
!      '-fstack-check'.  GCC computed the default from the values of the
       above macros and you will normally not need to override that
       default.
  
*************** This discusses registers that address th
*** 30978,31034 ****
  
   -- Macro: STACK_POINTER_REGNUM
       The register number of the stack pointer register, which must also
!      be a fixed register according to `FIXED_REGISTERS'.  On most
       machines, the hardware determines which register this is.
  
   -- Macro: FRAME_POINTER_REGNUM
       The register number of the frame pointer register, which is used to
       access automatic variables in the stack frame.  On some machines,
!      the hardware determines which register this is.  On other
!      machines, you can choose any register you wish for this purpose.
  
   -- Macro: HARD_FRAME_POINTER_REGNUM
       On some machines the offset between the frame pointer and starting
       offset of the automatic variables is not known until after register
       allocation has been done (for example, because the saved registers
       are between these two locations).  On those machines, define
!      `FRAME_POINTER_REGNUM' the number of a special, fixed register to
       be used internally until the offset is known, and define
!      `HARD_FRAME_POINTER_REGNUM' to be the actual hard register number
       used for the frame pointer.
  
       You should define this macro only in the very rare circumstances
       when it is not possible to calculate the offset between the frame
!      pointer and the automatic variables until after register
!      allocation has been completed.  When this macro is defined, you
!      must also indicate in your definition of `ELIMINABLE_REGS' how to
!      eliminate `FRAME_POINTER_REGNUM' into either
!      `HARD_FRAME_POINTER_REGNUM' or `STACK_POINTER_REGNUM'.
  
       Do not define this macro if it would be the same as
!      `FRAME_POINTER_REGNUM'.
  
   -- Macro: ARG_POINTER_REGNUM
       The register number of the arg pointer register, which is used to
!      access the function's argument list.  On some machines, this is
!      the same as the frame pointer register.  On some machines, the
!      hardware determines which register this is.  On other machines,
!      you can choose any register you wish for this purpose.  If this is
!      not the same register as the frame pointer register, then you must
!      mark it as a fixed register according to `FIXED_REGISTERS', or
!      arrange to be able to eliminate it (*note Elimination::).
  
   -- Macro: HARD_FRAME_POINTER_IS_FRAME_POINTER
       Define this to a preprocessor constant that is nonzero if
!      `hard_frame_pointer_rtx' and `frame_pointer_rtx' should be the
!      same.  The default definition is `(HARD_FRAME_POINTER_REGNUM ==
       FRAME_POINTER_REGNUM)'; you only need to define this macro if that
       definition is not suitable for use in preprocessor conditionals.
  
   -- Macro: HARD_FRAME_POINTER_IS_ARG_POINTER
       Define this to a preprocessor constant that is nonzero if
!      `hard_frame_pointer_rtx' and `arg_pointer_rtx' should be the same.
!      The default definition is `(HARD_FRAME_POINTER_REGNUM ==
       ARG_POINTER_REGNUM)'; you only need to define this macro if that
       definition is not suitable for use in preprocessor conditionals.
  
--- 30583,30639 ----
  
   -- Macro: STACK_POINTER_REGNUM
       The register number of the stack pointer register, which must also
!      be a fixed register according to 'FIXED_REGISTERS'.  On most
       machines, the hardware determines which register this is.
  
   -- Macro: FRAME_POINTER_REGNUM
       The register number of the frame pointer register, which is used to
       access automatic variables in the stack frame.  On some machines,
!      the hardware determines which register this is.  On other machines,
!      you can choose any register you wish for this purpose.
  
   -- Macro: HARD_FRAME_POINTER_REGNUM
       On some machines the offset between the frame pointer and starting
       offset of the automatic variables is not known until after register
       allocation has been done (for example, because the saved registers
       are between these two locations).  On those machines, define
!      'FRAME_POINTER_REGNUM' the number of a special, fixed register to
       be used internally until the offset is known, and define
!      'HARD_FRAME_POINTER_REGNUM' to be the actual hard register number
       used for the frame pointer.
  
       You should define this macro only in the very rare circumstances
       when it is not possible to calculate the offset between the frame
!      pointer and the automatic variables until after register allocation
!      has been completed.  When this macro is defined, you must also
!      indicate in your definition of 'ELIMINABLE_REGS' how to eliminate
!      'FRAME_POINTER_REGNUM' into either 'HARD_FRAME_POINTER_REGNUM' or
!      'STACK_POINTER_REGNUM'.
  
       Do not define this macro if it would be the same as
!      'FRAME_POINTER_REGNUM'.
  
   -- Macro: ARG_POINTER_REGNUM
       The register number of the arg pointer register, which is used to
!      access the function's argument list.  On some machines, this is the
!      same as the frame pointer register.  On some machines, the hardware
!      determines which register this is.  On other machines, you can
!      choose any register you wish for this purpose.  If this is not the
!      same register as the frame pointer register, then you must mark it
!      as a fixed register according to 'FIXED_REGISTERS', or arrange to
!      be able to eliminate it (*note Elimination::).
  
   -- Macro: HARD_FRAME_POINTER_IS_FRAME_POINTER
       Define this to a preprocessor constant that is nonzero if
!      'hard_frame_pointer_rtx' and 'frame_pointer_rtx' should be the
!      same.  The default definition is '(HARD_FRAME_POINTER_REGNUM ==
       FRAME_POINTER_REGNUM)'; you only need to define this macro if that
       definition is not suitable for use in preprocessor conditionals.
  
   -- Macro: HARD_FRAME_POINTER_IS_ARG_POINTER
       Define this to a preprocessor constant that is nonzero if
!      'hard_frame_pointer_rtx' and 'arg_pointer_rtx' should be the same.
!      The default definition is '(HARD_FRAME_POINTER_REGNUM ==
       ARG_POINTER_REGNUM)'; you only need to define this macro if that
       definition is not suitable for use in preprocessor conditionals.
  
*************** This discusses registers that address th
*** 31036,31045 ****
       The register number of the return address pointer register, which
       is used to access the current function's return address from the
       stack.  On some machines, the return address is not at a fixed
!      offset from the frame pointer or stack pointer or argument
!      pointer.  This register can be defined to point to the return
!      address on the stack, and then be converted by `ELIMINABLE_REGS'
!      into either the frame pointer or stack pointer.
  
       Do not define this macro unless there is no other way to get the
       return address from the stack.
--- 30641,30650 ----
       The register number of the return address pointer register, which
       is used to access the current function's return address from the
       stack.  On some machines, the return address is not at a fixed
!      offset from the frame pointer or stack pointer or argument pointer.
!      This register can be defined to point to the return address on the
!      stack, and then be converted by 'ELIMINABLE_REGS' into either the
!      frame pointer or stack pointer.
  
       Do not define this macro unless there is no other way to get the
       return address from the stack.
*************** This discusses registers that address th
*** 31047,31080 ****
   -- Macro: STATIC_CHAIN_REGNUM
   -- Macro: STATIC_CHAIN_INCOMING_REGNUM
       Register numbers used for passing a function's static chain
!      pointer.  If register windows are used, the register number as
!      seen by the called function is `STATIC_CHAIN_INCOMING_REGNUM',
!      while the register number as seen by the calling function is
!      `STATIC_CHAIN_REGNUM'.  If these registers are the same,
!      `STATIC_CHAIN_INCOMING_REGNUM' need not be defined.
  
       The static chain register need not be a fixed register.
  
       If the static chain is passed in memory, these macros should not be
!      defined; instead, the `TARGET_STATIC_CHAIN' hook should be used.
  
   -- Target Hook: rtx TARGET_STATIC_CHAIN (const_tree FNDECL_OR_TYPE,
            bool INCOMING_P)
!      This hook replaces the use of `STATIC_CHAIN_REGNUM' et al for
       targets that may use different static chain locations for different
       nested functions.  This may be required if the target has function
       attributes that affect the calling conventions of the function and
       those calling conventions use different static chain locations.
  
!      The default version of this hook uses `STATIC_CHAIN_REGNUM' et al.
  
       If the static chain is passed in memory, this hook should be used
!      to provide rtx giving `mem' expressions that denote where they are
!      stored.  Often the `mem' expression as seen by the caller will be
!      at an offset from the stack pointer and the `mem' expression as
!      seen by the callee will be at an offset from the frame pointer.  The
!      variables `stack_pointer_rtx', `frame_pointer_rtx', and
!      `arg_pointer_rtx' will have been initialized and should be used to
       refer to those items.
  
   -- Macro: DWARF_FRAME_REGISTERS
--- 30652,30685 ----
   -- Macro: STATIC_CHAIN_REGNUM
   -- Macro: STATIC_CHAIN_INCOMING_REGNUM
       Register numbers used for passing a function's static chain
!      pointer.  If register windows are used, the register number as seen
!      by the called function is 'STATIC_CHAIN_INCOMING_REGNUM', while the
!      register number as seen by the calling function is
!      'STATIC_CHAIN_REGNUM'.  If these registers are the same,
!      'STATIC_CHAIN_INCOMING_REGNUM' need not be defined.
  
       The static chain register need not be a fixed register.
  
       If the static chain is passed in memory, these macros should not be
!      defined; instead, the 'TARGET_STATIC_CHAIN' hook should be used.
  
   -- Target Hook: rtx TARGET_STATIC_CHAIN (const_tree FNDECL_OR_TYPE,
            bool INCOMING_P)
!      This hook replaces the use of 'STATIC_CHAIN_REGNUM' et al for
       targets that may use different static chain locations for different
       nested functions.  This may be required if the target has function
       attributes that affect the calling conventions of the function and
       those calling conventions use different static chain locations.
  
!      The default version of this hook uses 'STATIC_CHAIN_REGNUM' et al.
  
       If the static chain is passed in memory, this hook should be used
!      to provide rtx giving 'mem' expressions that denote where they are
!      stored.  Often the 'mem' expression as seen by the caller will be
!      at an offset from the stack pointer and the 'mem' expression as
!      seen by the callee will be at an offset from the frame pointer.
!      The variables 'stack_pointer_rtx', 'frame_pointer_rtx', and
!      'arg_pointer_rtx' will have been initialized and should be used to
       refer to those items.
  
   -- Macro: DWARF_FRAME_REGISTERS
*************** This discusses registers that address th
*** 31092,31107 ****
       call-saved.
  
       If this macro is not defined, it defaults to
!      `FIRST_PSEUDO_REGISTER'.
  
   -- Macro: PRE_GCC3_DWARF_FRAME_REGISTERS
!      This macro is similar to `DWARF_FRAME_REGISTERS', but is provided
       for backward compatibility in pre GCC 3.0 compiled code.
  
       If this macro is not defined, it defaults to
!      `DWARF_FRAME_REGISTERS'.
  
   -- Macro: DWARF_REG_TO_UNWIND_COLUMN (REGNO)
       Define this macro if the target's representation for dwarf
       registers is different than the internal representation for unwind
       column.  Given a dwarf register, this macro should return the
--- 30697,30714 ----
       call-saved.
  
       If this macro is not defined, it defaults to
!      'FIRST_PSEUDO_REGISTER'.
  
   -- Macro: PRE_GCC3_DWARF_FRAME_REGISTERS
! 
!      This macro is similar to 'DWARF_FRAME_REGISTERS', but is provided
       for backward compatibility in pre GCC 3.0 compiled code.
  
       If this macro is not defined, it defaults to
!      'DWARF_FRAME_REGISTERS'.
  
   -- Macro: DWARF_REG_TO_UNWIND_COLUMN (REGNO)
+ 
       Define this macro if the target's representation for dwarf
       registers is different than the internal representation for unwind
       column.  Given a dwarf register, this macro should return the
*************** This discusses registers that address th
*** 31110,31142 ****
       See the PowerPC's SPE target for an example.
  
   -- Macro: DWARF_FRAME_REGNUM (REGNO)
       Define this macro if the target's representation for dwarf
       registers used in .eh_frame or .debug_frame is different from that
       used in other debug info sections.  Given a GCC hard register
       number, this macro should return the .eh_frame register number.
!      The default is `DBX_REGISTER_NUMBER (REGNO)'.
! 
  
   -- Macro: DWARF2_FRAME_REG_OUT (REGNO, FOR_EH)
-      Define this macro to map register numbers held in the call frame
-      info that GCC has collected using `DWARF_FRAME_REGNUM' to those
-      that should be output in .debug_frame (`FOR_EH' is zero) and
-      .eh_frame (`FOR_EH' is nonzero).  The default is to return `REGNO'.
  
  
   -- Macro: REG_VALUE_IN_UNWIND_CONTEXT
-      Define this macro if the target stores register values as
-      `_Unwind_Word' type in unwind context.  It should be defined if
-      target register size is larger than the size of `void *'.  The
-      default is to store register values as `void *' type.
  
  
   -- Macro: ASSUME_EXTENDED_UNWIND_CONTEXT
       Define this macro to be 1 if the target always uses extended unwind
       context with version, args_size and by_value fields.  If it is
       undefined, it will be defined to 1 when
!      `REG_VALUE_IN_UNWIND_CONTEXT' is defined and 0 otherwise.
! 
  
  
  File: gccint.info,  Node: Elimination,  Next: Stack Arguments,  Prev: Frame Registers,  Up: Stack and Calling
--- 30717,30749 ----
       See the PowerPC's SPE target for an example.
  
   -- Macro: DWARF_FRAME_REGNUM (REGNO)
+ 
       Define this macro if the target's representation for dwarf
       registers used in .eh_frame or .debug_frame is different from that
       used in other debug info sections.  Given a GCC hard register
       number, this macro should return the .eh_frame register number.
!      The default is 'DBX_REGISTER_NUMBER (REGNO)'.
  
   -- Macro: DWARF2_FRAME_REG_OUT (REGNO, FOR_EH)
  
+      Define this macro to map register numbers held in the call frame
+      info that GCC has collected using 'DWARF_FRAME_REGNUM' to those
+      that should be output in .debug_frame ('FOR_EH' is zero) and
+      .eh_frame ('FOR_EH' is nonzero).  The default is to return 'REGNO'.
  
   -- Macro: REG_VALUE_IN_UNWIND_CONTEXT
  
+      Define this macro if the target stores register values as
+      '_Unwind_Word' type in unwind context.  It should be defined if
+      target register size is larger than the size of 'void *'.  The
+      default is to store register values as 'void *' type.
  
   -- Macro: ASSUME_EXTENDED_UNWIND_CONTEXT
+ 
       Define this macro to be 1 if the target always uses extended unwind
       context with version, args_size and by_value fields.  If it is
       undefined, it will be defined to 1 when
!      'REG_VALUE_IN_UNWIND_CONTEXT' is defined and 0 otherwise.
  
  
  File: gccint.info,  Node: Elimination,  Next: Stack Arguments,  Prev: Frame Registers,  Up: Stack and Calling
*************** File: gccint.info,  Node: Elimination,
*** 31147,31187 ****
  This is about eliminating the frame pointer and arg pointer.
  
   -- Target Hook: bool TARGET_FRAME_POINTER_REQUIRED (void)
!      This target hook should return `true' if a function must have and
       use a frame pointer.  This target hook is called in the reload
!      pass.  If its return value is `true' the function will have a
!      frame pointer.
  
       This target hook can in principle examine the current function and
       decide according to the facts, but on most machines the constant
!      `false' or the constant `true' suffices.  Use `false' when the
       machine allows code to be generated with no frame pointer, and
!      doing so saves some time or space.  Use `true' when there is no
       possible advantage to avoiding a frame pointer.
  
       In certain cases, the compiler does not know how to produce valid
       code without a frame pointer.  The compiler recognizes those cases
       and automatically gives the function a frame pointer regardless of
!      what `TARGET_FRAME_POINTER_REQUIRED' returns.  You don't need to
       worry about them.
  
       In a function that does not require a frame pointer, the frame
       pointer register can be allocated for ordinary usage, unless you
!      mark it as a fixed register.  See `FIXED_REGISTERS' for more
       information.
  
!      Default return value is `false'.
  
   -- Macro: INITIAL_FRAME_POINTER_OFFSET (DEPTH-VAR)
       A C statement to store in the variable DEPTH-VAR the difference
       between the frame pointer and the stack pointer values immediately
       after the function prologue.  The value would be computed from
!      information such as the result of `get_frame_size ()' and the
!      tables of registers `regs_ever_live' and `call_used_regs'.
  
!      If `ELIMINABLE_REGS' is defined, this macro will be not be used and
       need not be defined.  Otherwise, it must be defined even if
!      `TARGET_FRAME_POINTER_REQUIRED' always returns true; in that case,
       you may set DEPTH-VAR to anything.
  
   -- Macro: ELIMINABLE_REGS
--- 30754,30794 ----
  This is about eliminating the frame pointer and arg pointer.
  
   -- Target Hook: bool TARGET_FRAME_POINTER_REQUIRED (void)
!      This target hook should return 'true' if a function must have and
       use a frame pointer.  This target hook is called in the reload
!      pass.  If its return value is 'true' the function will have a frame
!      pointer.
  
       This target hook can in principle examine the current function and
       decide according to the facts, but on most machines the constant
!      'false' or the constant 'true' suffices.  Use 'false' when the
       machine allows code to be generated with no frame pointer, and
!      doing so saves some time or space.  Use 'true' when there is no
       possible advantage to avoiding a frame pointer.
  
       In certain cases, the compiler does not know how to produce valid
       code without a frame pointer.  The compiler recognizes those cases
       and automatically gives the function a frame pointer regardless of
!      what 'TARGET_FRAME_POINTER_REQUIRED' returns.  You don't need to
       worry about them.
  
       In a function that does not require a frame pointer, the frame
       pointer register can be allocated for ordinary usage, unless you
!      mark it as a fixed register.  See 'FIXED_REGISTERS' for more
       information.
  
!      Default return value is 'false'.
  
   -- Macro: INITIAL_FRAME_POINTER_OFFSET (DEPTH-VAR)
       A C statement to store in the variable DEPTH-VAR the difference
       between the frame pointer and the stack pointer values immediately
       after the function prologue.  The value would be computed from
!      information such as the result of 'get_frame_size ()' and the
!      tables of registers 'regs_ever_live' and 'call_used_regs'.
  
!      If 'ELIMINABLE_REGS' is defined, this macro will be not be used and
       need not be defined.  Otherwise, it must be defined even if
!      'TARGET_FRAME_POINTER_REQUIRED' always returns true; in that case,
       you may set DEPTH-VAR to anything.
  
   -- Macro: ELIMINABLE_REGS
*************** This is about eliminating the frame poin
*** 31195,31206 ****
       initializations, each of which specifies an original and
       replacement register.
  
!      On some machines, the position of the argument pointer is not
!      known until the compilation is completed.  In such a case, a
!      separate hard register must be used for the argument pointer.
!      This register can be eliminated by replacing it with either the
!      frame pointer or the argument pointer, depending on whether or not
!      the frame pointer has been eliminated.
  
       In this case, you might specify:
            #define ELIMINABLE_REGS  \
--- 30802,30813 ----
       initializations, each of which specifies an original and
       replacement register.
  
!      On some machines, the position of the argument pointer is not known
!      until the compilation is completed.  In such a case, a separate
!      hard register must be used for the argument pointer.  This register
!      can be eliminated by replacing it with either the frame pointer or
!      the argument pointer, depending on whether or not the frame pointer
!      has been eliminated.
  
       In this case, you might specify:
            #define ELIMINABLE_REGS  \
*************** This is about eliminating the frame poin
*** 31213,31231 ****
  
   -- Target Hook: bool TARGET_CAN_ELIMINATE (const int FROM_REG, const
            int TO_REG)
!      This target hook should returns `true' if the compiler is allowed
       to try to replace register number FROM_REG with register number
!      TO_REG.  This target hook need only be defined if `ELIMINABLE_REGS'
!      is defined, and will usually be `true', since most of the cases
       preventing register elimination are things that the compiler
       already knows about.
  
!      Default return value is `true'.
  
   -- Macro: INITIAL_ELIMINATION_OFFSET (FROM-REG, TO-REG, OFFSET-VAR)
!      This macro is similar to `INITIAL_FRAME_POINTER_OFFSET'.  It
       specifies the initial difference between the specified pair of
!      registers.  This macro must be defined if `ELIMINABLE_REGS' is
       defined.
  
  
--- 30820,30838 ----
  
   -- Target Hook: bool TARGET_CAN_ELIMINATE (const int FROM_REG, const
            int TO_REG)
!      This target hook should returns 'true' if the compiler is allowed
       to try to replace register number FROM_REG with register number
!      TO_REG.  This target hook need only be defined if 'ELIMINABLE_REGS'
!      is defined, and will usually be 'true', since most of the cases
       preventing register elimination are things that the compiler
       already knows about.
  
!      Default return value is 'true'.
  
   -- Macro: INITIAL_ELIMINATION_OFFSET (FROM-REG, TO-REG, OFFSET-VAR)
!      This macro is similar to 'INITIAL_FRAME_POINTER_OFFSET'.  It
       specifies the initial difference between the specified pair of
!      registers.  This macro must be defined if 'ELIMINABLE_REGS' is
       defined.
  
  
*************** stack.  See the following section for ot
*** 31239,31247 ****
  certain arguments in registers.
  
   -- Target Hook: bool TARGET_PROMOTE_PROTOTYPES (const_tree FNTYPE)
!      This target hook returns `true' if an argument declared in a
!      prototype as an integral type smaller than `int' should actually be
!      passed as an `int'.  In addition to avoiding errors in certain
       cases of mismatch, it also makes for better code on certain
       machines.  The default is to not promote prototypes.
  
--- 30846,30854 ----
  certain arguments in registers.
  
   -- Target Hook: bool TARGET_PROMOTE_PROTOTYPES (const_tree FNTYPE)
!      This target hook returns 'true' if an argument declared in a
!      prototype as an integral type smaller than 'int' should actually be
!      passed as an 'int'.  In addition to avoiding errors in certain
       cases of mismatch, it also makes for better code on certain
       machines.  The default is to not promote prototypes.
  
*************** certain arguments in registers.
*** 31250,31262 ****
       outgoing arguments.  If the target machine does not have a push
       instruction, set it to zero.  That directs GCC to use an alternate
       strategy: to allocate the entire argument block and then store the
!      arguments into it.  When `PUSH_ARGS' is nonzero, `PUSH_ROUNDING'
       must be defined too.
  
   -- Macro: PUSH_ARGS_REVERSED
       A C expression.  If nonzero, function arguments will be evaluated
       from last to first, rather than from first to last.  If this macro
!      is not defined, it defaults to `PUSH_ARGS' on targets where the
       stack and args grow in opposite directions, and 0 otherwise.
  
   -- Macro: PUSH_ROUNDING (NPUSHED)
--- 30857,30869 ----
       outgoing arguments.  If the target machine does not have a push
       instruction, set it to zero.  That directs GCC to use an alternate
       strategy: to allocate the entire argument block and then store the
!      arguments into it.  When 'PUSH_ARGS' is nonzero, 'PUSH_ROUNDING'
       must be defined too.
  
   -- Macro: PUSH_ARGS_REVERSED
       A C expression.  If nonzero, function arguments will be evaluated
       from last to first, rather than from first to last.  If this macro
!      is not defined, it defaults to 'PUSH_ARGS' on targets where the
       stack and args grow in opposite directions, and 0 otherwise.
  
   -- Macro: PUSH_ROUNDING (NPUSHED)
*************** certain arguments in registers.
*** 31279,31289 ****
   -- Macro: ACCUMULATE_OUTGOING_ARGS
       A C expression.  If nonzero, the maximum amount of space required
       for outgoing arguments will be computed and placed into
!      `crtl->outgoing_args_size'.  No space will be pushed onto the
!      stack for each call; instead, the function prologue should
!      increase the stack frame size by this amount.
  
!      Setting both `PUSH_ARGS' and `ACCUMULATE_OUTGOING_ARGS' is not
       proper.
  
   -- Macro: REG_PARM_STACK_SPACE (FNDECL)
--- 30886,30896 ----
   -- Macro: ACCUMULATE_OUTGOING_ARGS
       A C expression.  If nonzero, the maximum amount of space required
       for outgoing arguments will be computed and placed into
!      'crtl->outgoing_args_size'.  No space will be pushed onto the stack
!      for each call; instead, the function prologue should increase the
!      stack frame size by this amount.
  
!      Setting both 'PUSH_ARGS' and 'ACCUMULATE_OUTGOING_ARGS' is not
       proper.
  
   -- Macro: REG_PARM_STACK_SPACE (FNDECL)
*************** certain arguments in registers.
*** 31291,31330 ****
       been allocated for arguments even when their values are passed in
       registers.
  
!      The value of this macro is the size, in bytes, of the area
!      reserved for arguments passed in registers for the function
!      represented by FNDECL, which can be zero if GCC is calling a
!      library function.  The argument FNDECL can be the FUNCTION_DECL,
!      or the type itself of the function.
  
       This space can be allocated by the caller, or be a part of the
!      machine-dependent stack frame: `OUTGOING_REG_PARM_STACK_SPACE' says
       which.
  
   -- Macro: INCOMING_REG_PARM_STACK_SPACE (FNDECL)
!      Like `REG_PARM_STACK_SPACE', but for incoming register arguments.
       Define this macro if space guaranteed when compiling a function
!      body is different to space required when making a call, a
!      situation that can arise with K&R style function definitions.
  
   -- Macro: OUTGOING_REG_PARM_STACK_SPACE (FNTYPE)
       Define this to a nonzero value if it is the responsibility of the
       caller to allocate the area reserved for arguments passed in
!      registers when calling a function of FNTYPE.  FNTYPE may be NULL
!      if the function called is a library function.
  
!      If `ACCUMULATE_OUTGOING_ARGS' is defined, this macro controls
       whether the space for these arguments counts in the value of
!      `crtl->outgoing_args_size'.
  
   -- Macro: STACK_PARMS_IN_REG_PARM_AREA
!      Define this macro if `REG_PARM_STACK_SPACE' is defined, but the
       stack parameters don't skip the area specified by it.
  
!      Normally, when a parameter is not passed in registers, it is
!      placed on the stack beyond the `REG_PARM_STACK_SPACE' area.
!      Defining this macro suppresses this behavior and causes the
!      parameter to be passed on the stack in its natural location.
  
   -- Target Hook: int TARGET_RETURN_POPS_ARGS (tree FUNDECL, tree
            FUNTYPE, int SIZE)
--- 30898,30937 ----
       been allocated for arguments even when their values are passed in
       registers.
  
!      The value of this macro is the size, in bytes, of the area reserved
!      for arguments passed in registers for the function represented by
!      FNDECL, which can be zero if GCC is calling a library function.
!      The argument FNDECL can be the FUNCTION_DECL, or the type itself of
!      the function.
  
       This space can be allocated by the caller, or be a part of the
!      machine-dependent stack frame: 'OUTGOING_REG_PARM_STACK_SPACE' says
       which.
  
   -- Macro: INCOMING_REG_PARM_STACK_SPACE (FNDECL)
!      Like 'REG_PARM_STACK_SPACE', but for incoming register arguments.
       Define this macro if space guaranteed when compiling a function
!      body is different to space required when making a call, a situation
!      that can arise with K&R style function definitions.
  
   -- Macro: OUTGOING_REG_PARM_STACK_SPACE (FNTYPE)
       Define this to a nonzero value if it is the responsibility of the
       caller to allocate the area reserved for arguments passed in
!      registers when calling a function of FNTYPE.  FNTYPE may be NULL if
!      the function called is a library function.
  
!      If 'ACCUMULATE_OUTGOING_ARGS' is defined, this macro controls
       whether the space for these arguments counts in the value of
!      'crtl->outgoing_args_size'.
  
   -- Macro: STACK_PARMS_IN_REG_PARM_AREA
!      Define this macro if 'REG_PARM_STACK_SPACE' is defined, but the
       stack parameters don't skip the area specified by it.
  
!      Normally, when a parameter is not passed in registers, it is placed
!      on the stack beyond the 'REG_PARM_STACK_SPACE' area.  Defining this
!      macro suppresses this behavior and causes the parameter to be
!      passed on the stack in its natural location.
  
   -- Target Hook: int TARGET_RETURN_POPS_ARGS (tree FUNDECL, tree
            FUNTYPE, int SIZE)
*************** certain arguments in registers.
*** 31335,31375 ****
  
       FUNDECL is a C variable whose value is a tree node that describes
       the function in question.  Normally it is a node of type
!      `FUNCTION_DECL' that describes the declaration of the function.
!      From this you can obtain the `DECL_ATTRIBUTES' of the function.
  
       FUNTYPE is a C variable whose value is a tree node that describes
       the function in question.  Normally it is a node of type
!      `FUNCTION_TYPE' that describes the data type of the function.
!      From this it is possible to obtain the data types of the value and
       arguments (if known).
  
!      When a call to a library function is being considered, FUNDECL
!      will contain an identifier node for the library function.  Thus, if
!      you need to distinguish among various library functions, you can
!      do so by their names.  Note that "library function" in this
!      context means a function used to perform arithmetic, whose name is
!      known specially in the compiler and was not mentioned in the C
!      code being compiled.
  
!      SIZE is the number of bytes of arguments passed on the stack.  If
!      a variable number of bytes is passed, it is zero, and argument
       popping will always be the responsibility of the calling function.
  
       On the VAX, all functions always pop their arguments, so the
       definition of this macro is SIZE.  On the 68000, using the standard
       calling convention, no functions pop their arguments, so the value
       of the macro is always 0 in this case.  But an alternative calling
!      convention is available in which functions that take a fixed
!      number of arguments pop them but other functions (such as
!      `printf') pop nothing (the caller pops all).  When this convention
!      is in use, FUNTYPE is examined to determine whether a function
!      takes a fixed number of arguments.
  
   -- Macro: CALL_POPS_ARGS (CUM)
       A C expression that should indicate the number of bytes a call
       sequence pops off the stack.  It is added to the value of
!      `RETURN_POPS_ARGS' when compiling a function call.
  
       CUM is the variable in which all arguments to the called function
       have been accumulated.
--- 30942,30982 ----
  
       FUNDECL is a C variable whose value is a tree node that describes
       the function in question.  Normally it is a node of type
!      'FUNCTION_DECL' that describes the declaration of the function.
!      From this you can obtain the 'DECL_ATTRIBUTES' of the function.
  
       FUNTYPE is a C variable whose value is a tree node that describes
       the function in question.  Normally it is a node of type
!      'FUNCTION_TYPE' that describes the data type of the function.  From
!      this it is possible to obtain the data types of the value and
       arguments (if known).
  
!      When a call to a library function is being considered, FUNDECL will
!      contain an identifier node for the library function.  Thus, if you
!      need to distinguish among various library functions, you can do so
!      by their names.  Note that "library function" in this context means
!      a function used to perform arithmetic, whose name is known
!      specially in the compiler and was not mentioned in the C code being
!      compiled.
  
!      SIZE is the number of bytes of arguments passed on the stack.  If a
!      variable number of bytes is passed, it is zero, and argument
       popping will always be the responsibility of the calling function.
  
       On the VAX, all functions always pop their arguments, so the
       definition of this macro is SIZE.  On the 68000, using the standard
       calling convention, no functions pop their arguments, so the value
       of the macro is always 0 in this case.  But an alternative calling
!      convention is available in which functions that take a fixed number
!      of arguments pop them but other functions (such as 'printf') pop
!      nothing (the caller pops all).  When this convention is in use,
!      FUNTYPE is examined to determine whether a function takes a fixed
!      number of arguments.
  
   -- Macro: CALL_POPS_ARGS (CUM)
       A C expression that should indicate the number of bytes a call
       sequence pops off the stack.  It is added to the value of
!      'RETURN_POPS_ARGS' when compiling a function call.
  
       CUM is the variable in which all arguments to the called function
       have been accumulated.
*************** certain arguments in registers.
*** 31378,31384 ****
       used that pops certain registers off the stack, depending on the
       arguments that have been passed to the function.  Since this is a
       property of the call site, not of the called function,
!      `RETURN_POPS_ARGS' is not appropriate.
  
  
  File: gccint.info,  Node: Register Arguments,  Next: Scalar Return,  Prev: Stack Arguments,  Up: Stack and Calling
--- 30985,30991 ----
       used that pops certain registers off the stack, depending on the
       arguments that have been passed to the function.  Since this is a
       property of the call site, not of the called function,
!      'RETURN_POPS_ARGS' is not appropriate.
  
  
  File: gccint.info,  Node: Register Arguments,  Next: Scalar Return,  Prev: Stack Arguments,  Up: Stack and Calling
*************** the stack.
*** 31398,31472 ****
       The arguments are CA, which summarizes all the previous arguments;
       MODE, the machine mode of the argument; TYPE, the data type of the
       argument as a tree node or 0 if that is not known (which happens
!      for C support library functions); and NAMED, which is `true' for
!      an ordinary argument and `false' for nameless arguments that
!      correspond to `...' in the called function's prototype.  TYPE can
       be an incomplete type if a syntax error has previously occurred.
  
!      The return value is usually either a `reg' RTX for the hard
       register in which to pass the argument, or zero to pass the
       argument on the stack.
  
!      The return value can be a `const_int' which means argument is
       passed in a target specific slot with specified number.  Target
       hooks should be used to store or load argument in such case.  See
!      `TARGET_STORE_BOUNDS_FOR_ARG' and `TARGET_LOAD_BOUNDS_FOR_ARG' for
       more information.
  
!      The value of the expression can also be a `parallel' RTX.  This is
!      used when an argument is passed in multiple locations.  The mode
!      of the `parallel' should be the mode of the entire argument.  The
!      `parallel' holds any number of `expr_list' pairs; each one
       describes where part of the argument is passed.  In each
!      `expr_list' the first operand must be a `reg' RTX for the hard
       register in which to pass this part of the argument, and the mode
       of the register RTX indicates how large this part of the argument
!      is.  The second operand of the `expr_list' is a `const_int' which
       gives the offset in bytes into the entire argument of where this
!      part starts.  As a special exception the first `expr_list' in the
!      `parallel' RTX may have a first operand of zero.  This indicates
       that the entire argument is also stored on the stack.
  
!      The last time this hook is called, it is called with `MODE ==
!      VOIDmode', and its result is passed to the `call' or `call_value'
       pattern as operands 2 and 3 respectively.
  
!      The usual way to make the ISO library `stdarg.h' work on a machine
       where some arguments are usually passed in registers, is to cause
!      nameless arguments to be passed on the stack instead.  This is
!      done by making `TARGET_FUNCTION_ARG' return 0 whenever NAMED is
!      `false'.
  
!      You may use the hook `targetm.calls.must_pass_in_stack' in the
!      definition of this macro to determine if this argument is of a
!      type that must be passed in the stack.  If `REG_PARM_STACK_SPACE'
!      is not defined and `TARGET_FUNCTION_ARG' returns nonzero for such
!      an argument, the compiler will abort.  If `REG_PARM_STACK_SPACE' is
!      defined, the argument will be computed in the stack and then
!      loaded into a register.
  
   -- Target Hook: bool TARGET_MUST_PASS_IN_STACK (machine_mode MODE,
            const_tree TYPE)
!      This target hook should return `true' if we should not pass TYPE
!      solely in registers.  The file `expr.h' defines a definition that
!      is usually appropriate, refer to `expr.h' for additional
       documentation.
  
!  -- Target Hook: rtx TARGET_FUNCTION_INCOMING_ARG (cumulative_args_t
!           CA, machine_mode MODE, const_tree TYPE, bool NAMED)
       Define this hook if the target machine has "register windows", so
       that the register in which a function sees an arguments is not
       necessarily the same as the one in which the caller passed the
       argument.
  
!      For such machines, `TARGET_FUNCTION_ARG' computes the register in
       which the caller passes the value, and
!      `TARGET_FUNCTION_INCOMING_ARG' should be defined in a similar
       fashion to tell the function being called where the arguments will
       arrive.
  
!      If `TARGET_FUNCTION_INCOMING_ARG' is not defined,
!      `TARGET_FUNCTION_ARG' serves both purposes.
  
   -- Target Hook: bool TARGET_USE_PSEUDO_PIC_REG (void)
       This hook should return 1 in case pseudo register should be created
--- 31005,31078 ----
       The arguments are CA, which summarizes all the previous arguments;
       MODE, the machine mode of the argument; TYPE, the data type of the
       argument as a tree node or 0 if that is not known (which happens
!      for C support library functions); and NAMED, which is 'true' for an
!      ordinary argument and 'false' for nameless arguments that
!      correspond to '...' in the called function's prototype.  TYPE can
       be an incomplete type if a syntax error has previously occurred.
  
!      The return value is usually either a 'reg' RTX for the hard
       register in which to pass the argument, or zero to pass the
       argument on the stack.
  
!      The return value can be a 'const_int' which means argument is
       passed in a target specific slot with specified number.  Target
       hooks should be used to store or load argument in such case.  See
!      'TARGET_STORE_BOUNDS_FOR_ARG' and 'TARGET_LOAD_BOUNDS_FOR_ARG' for
       more information.
  
!      The value of the expression can also be a 'parallel' RTX.  This is
!      used when an argument is passed in multiple locations.  The mode of
!      the 'parallel' should be the mode of the entire argument.  The
!      'parallel' holds any number of 'expr_list' pairs; each one
       describes where part of the argument is passed.  In each
!      'expr_list' the first operand must be a 'reg' RTX for the hard
       register in which to pass this part of the argument, and the mode
       of the register RTX indicates how large this part of the argument
!      is.  The second operand of the 'expr_list' is a 'const_int' which
       gives the offset in bytes into the entire argument of where this
!      part starts.  As a special exception the first 'expr_list' in the
!      'parallel' RTX may have a first operand of zero.  This indicates
       that the entire argument is also stored on the stack.
  
!      The last time this hook is called, it is called with 'MODE ==
!      VOIDmode', and its result is passed to the 'call' or 'call_value'
       pattern as operands 2 and 3 respectively.
  
!      The usual way to make the ISO library 'stdarg.h' work on a machine
       where some arguments are usually passed in registers, is to cause
!      nameless arguments to be passed on the stack instead.  This is done
!      by making 'TARGET_FUNCTION_ARG' return 0 whenever NAMED is 'false'.
  
!      You may use the hook 'targetm.calls.must_pass_in_stack' in the
!      definition of this macro to determine if this argument is of a type
!      that must be passed in the stack.  If 'REG_PARM_STACK_SPACE' is not
!      defined and 'TARGET_FUNCTION_ARG' returns nonzero for such an
!      argument, the compiler will abort.  If 'REG_PARM_STACK_SPACE' is
!      defined, the argument will be computed in the stack and then loaded
!      into a register.
  
   -- Target Hook: bool TARGET_MUST_PASS_IN_STACK (machine_mode MODE,
            const_tree TYPE)
!      This target hook should return 'true' if we should not pass TYPE
!      solely in registers.  The file 'expr.h' defines a definition that
!      is usually appropriate, refer to 'expr.h' for additional
       documentation.
  
!  -- Target Hook: rtx TARGET_FUNCTION_INCOMING_ARG (cumulative_args_t CA,
!           machine_mode MODE, const_tree TYPE, bool NAMED)
       Define this hook if the target machine has "register windows", so
       that the register in which a function sees an arguments is not
       necessarily the same as the one in which the caller passed the
       argument.
  
!      For such machines, 'TARGET_FUNCTION_ARG' computes the register in
       which the caller passes the value, and
!      'TARGET_FUNCTION_INCOMING_ARG' should be defined in a similar
       fashion to tell the function being called where the arguments will
       arrive.
  
!      If 'TARGET_FUNCTION_INCOMING_ARG' is not defined,
!      'TARGET_FUNCTION_ARG' serves both purposes.
  
   -- Target Hook: bool TARGET_USE_PSEUDO_PIC_REG (void)
       This hook should return 1 in case pseudo register should be created
*************** the stack.
*** 31486,31512 ****
       On some machines, certain arguments must be passed partially in
       registers and partially in memory.  On these machines, typically
       the first few words of arguments are passed in registers, and the
!      rest on the stack.  If a multi-word argument (a `double' or a
       structure) crosses that boundary, its first few words must be
       passed in registers and the rest must be pushed.  This macro tells
       the compiler when this occurs, and how many bytes should go in
       registers.
  
!      `TARGET_FUNCTION_ARG' for these arguments should return the first
       register to be used by the caller for this argument; likewise
!      `TARGET_FUNCTION_INCOMING_ARG', for the called function.
  
   -- Target Hook: bool TARGET_PASS_BY_REFERENCE (cumulative_args_t CUM,
            machine_mode MODE, const_tree TYPE, bool NAMED)
!      This target hook should return `true' if an argument at the
       position indicated by CUM should be passed by reference.  This
       predicate is queried after target independent reasons for being
!      passed by reference, such as `TREE_ADDRESSABLE (type)'.
  
!      If the hook returns true, a copy of that argument is made in
!      memory and a pointer to the argument is passed instead of the
!      argument itself.  The pointer is passed in whatever way is
!      appropriate for passing a pointer to that type.
  
   -- Target Hook: bool TARGET_CALLEE_COPIES (cumulative_args_t CUM,
            machine_mode MODE, const_tree TYPE, bool NAMED)
--- 31092,31118 ----
       On some machines, certain arguments must be passed partially in
       registers and partially in memory.  On these machines, typically
       the first few words of arguments are passed in registers, and the
!      rest on the stack.  If a multi-word argument (a 'double' or a
       structure) crosses that boundary, its first few words must be
       passed in registers and the rest must be pushed.  This macro tells
       the compiler when this occurs, and how many bytes should go in
       registers.
  
!      'TARGET_FUNCTION_ARG' for these arguments should return the first
       register to be used by the caller for this argument; likewise
!      'TARGET_FUNCTION_INCOMING_ARG', for the called function.
  
   -- Target Hook: bool TARGET_PASS_BY_REFERENCE (cumulative_args_t CUM,
            machine_mode MODE, const_tree TYPE, bool NAMED)
!      This target hook should return 'true' if an argument at the
       position indicated by CUM should be passed by reference.  This
       predicate is queried after target independent reasons for being
!      passed by reference, such as 'TREE_ADDRESSABLE (type)'.
  
!      If the hook returns true, a copy of that argument is made in memory
!      and a pointer to the argument is passed instead of the argument
!      itself.  The pointer is passed in whatever way is appropriate for
!      passing a pointer to that type.
  
   -- Target Hook: bool TARGET_CALLEE_COPIES (cumulative_args_t CUM,
            machine_mode MODE, const_tree TYPE, bool NAMED)
*************** the stack.
*** 31523,31626 ****
  
   -- Macro: CUMULATIVE_ARGS
       A C type for declaring a variable that is used as the first
!      argument of `TARGET_FUNCTION_ARG' and other related values.  For
!      some target machines, the type `int' suffices and can hold the
       number of bytes of argument so far.
  
!      There is no need to record in `CUMULATIVE_ARGS' anything about the
       arguments that have been passed on the stack.  The compiler has
       other variables to keep track of that.  For target machines on
       which all arguments are passed on the stack, there is no need to
!      store anything in `CUMULATIVE_ARGS'; however, the data structure
!      must exist and should not be empty, so use `int'.
  
   -- Macro: OVERRIDE_ABI_FORMAT (FNDECL)
       If defined, this macro is called before generating any code for a
       function, but after the CFUN descriptor for the function has been
!      created.  The back end may use this macro to update CFUN to
!      reflect an ABI other than that which would normally be used by
!      default.  If the compiler is generating code for a
!      compiler-generated function, FNDECL may be `NULL'.
  
   -- Macro: INIT_CUMULATIVE_ARGS (CUM, FNTYPE, LIBNAME, FNDECL,
            N_NAMED_ARGS)
       A C statement (sans semicolon) for initializing the variable CUM
       for the state at the beginning of the argument list.  The variable
!      has type `CUMULATIVE_ARGS'.  The value of FNTYPE is the tree node
!      for the data type of the function which will receive the args, or
!      0 if the args are to a compiler support library function.  For
!      direct calls that are not libcalls, FNDECL contain the declaration
!      node of the function.  FNDECL is also set when
!      `INIT_CUMULATIVE_ARGS' is used to find arguments for the function
!      being compiled.  N_NAMED_ARGS is set to the number of named
!      arguments, including a structure return address if it is passed as
!      a parameter, when making a call.  When processing incoming
!      arguments, N_NAMED_ARGS is set to -1.
  
       When processing a call to a compiler support library function,
!      LIBNAME identifies which one.  It is a `symbol_ref' rtx which
       contains the name of the function, as a string.  LIBNAME is 0 when
       an ordinary C function call is being processed.  Thus, each time
       this macro is called, either LIBNAME or FNTYPE is nonzero, but
       never both of them at once.
  
   -- Macro: INIT_CUMULATIVE_LIBCALL_ARGS (CUM, MODE, LIBNAME)
!      Like `INIT_CUMULATIVE_ARGS' but only used for outgoing libcalls,
!      it gets a `MODE' argument instead of FNTYPE, that would be `NULL'.
       INDIRECT would always be zero, too.  If this macro is not defined,
!      `INIT_CUMULATIVE_ARGS (cum, NULL_RTX, libname, 0)' is used instead.
  
   -- Macro: INIT_CUMULATIVE_INCOMING_ARGS (CUM, FNTYPE, LIBNAME)
!      Like `INIT_CUMULATIVE_ARGS' but overrides it for the purposes of
       finding the arguments for the function being compiled.  If this
!      macro is undefined, `INIT_CUMULATIVE_ARGS' is used instead.
  
       The value passed for LIBNAME is always 0, since library routines
       with special calling conventions are never compiled with GCC.  The
!      argument LIBNAME exists for symmetry with `INIT_CUMULATIVE_ARGS'.
  
!  -- Target Hook: void TARGET_FUNCTION_ARG_ADVANCE (cumulative_args_t
!           CA, machine_mode MODE, const_tree TYPE, bool NAMED)
       This hook updates the summarizer variable pointed to by CA to
       advance past an argument in the argument list.  The values MODE,
       TYPE and NAMED describe that argument.  Once this is done, the
       variable CUM is suitable for analyzing the _following_ argument
!      with `TARGET_FUNCTION_ARG', etc.
  
       This hook need not do anything if the argument in question was
!      passed on the stack.  The compiler knows how to track the amount
!      of stack space used for arguments without any special help.
  
   -- Macro: FUNCTION_ARG_OFFSET (MODE, TYPE)
       If defined, a C expression that is the number of bytes to add to
       the offset of the argument passed in memory.  This is needed for
!      the SPU, which passes `char' and `short' arguments in the preferred
       slot that is in the middle of the quad word instead of starting at
       the top.
  
   -- Macro: FUNCTION_ARG_PADDING (MODE, TYPE)
       If defined, a C expression which determines whether, and in which
       direction, to pad out an argument with extra space.  The value
!      should be of type `enum direction': either `upward' to pad above
!      the argument, `downward' to pad below, or `none' to inhibit
       padding.
  
       The _amount_ of padding is not controlled by this macro, but by the
!      target hook `TARGET_FUNCTION_ARG_ROUND_BOUNDARY'.  It is always
       just enough to reach the next multiple of that boundary.
  
       This macro has a default definition which is right for most
!      systems.  For little-endian machines, the default is to pad
!      upward.  For big-endian machines, the default is to pad downward
!      for an argument of constant size shorter than an `int', and upward
       otherwise.
  
   -- Macro: PAD_VARARGS_DOWN
       If defined, a C expression which determines whether the default
       implementation of va_arg will attempt to pad down before reading
       the next argument, if that argument is smaller than its aligned
!      space as controlled by `PARM_BOUNDARY'.  If this macro is not
!      defined, all such arguments are padded down if `BYTES_BIG_ENDIAN'
       is true.
  
   -- Macro: BLOCK_REG_PADDING (MODE, TYPE, FIRST)
--- 31129,31232 ----
  
   -- Macro: CUMULATIVE_ARGS
       A C type for declaring a variable that is used as the first
!      argument of 'TARGET_FUNCTION_ARG' and other related values.  For
!      some target machines, the type 'int' suffices and can hold the
       number of bytes of argument so far.
  
!      There is no need to record in 'CUMULATIVE_ARGS' anything about the
       arguments that have been passed on the stack.  The compiler has
       other variables to keep track of that.  For target machines on
       which all arguments are passed on the stack, there is no need to
!      store anything in 'CUMULATIVE_ARGS'; however, the data structure
!      must exist and should not be empty, so use 'int'.
  
   -- Macro: OVERRIDE_ABI_FORMAT (FNDECL)
       If defined, this macro is called before generating any code for a
       function, but after the CFUN descriptor for the function has been
!      created.  The back end may use this macro to update CFUN to reflect
!      an ABI other than that which would normally be used by default.  If
!      the compiler is generating code for a compiler-generated function,
!      FNDECL may be 'NULL'.
  
   -- Macro: INIT_CUMULATIVE_ARGS (CUM, FNTYPE, LIBNAME, FNDECL,
            N_NAMED_ARGS)
       A C statement (sans semicolon) for initializing the variable CUM
       for the state at the beginning of the argument list.  The variable
!      has type 'CUMULATIVE_ARGS'.  The value of FNTYPE is the tree node
!      for the data type of the function which will receive the args, or 0
!      if the args are to a compiler support library function.  For direct
!      calls that are not libcalls, FNDECL contain the declaration node of
!      the function.  FNDECL is also set when 'INIT_CUMULATIVE_ARGS' is
!      used to find arguments for the function being compiled.
!      N_NAMED_ARGS is set to the number of named arguments, including a
!      structure return address if it is passed as a parameter, when
!      making a call.  When processing incoming arguments, N_NAMED_ARGS is
!      set to -1.
  
       When processing a call to a compiler support library function,
!      LIBNAME identifies which one.  It is a 'symbol_ref' rtx which
       contains the name of the function, as a string.  LIBNAME is 0 when
       an ordinary C function call is being processed.  Thus, each time
       this macro is called, either LIBNAME or FNTYPE is nonzero, but
       never both of them at once.
  
   -- Macro: INIT_CUMULATIVE_LIBCALL_ARGS (CUM, MODE, LIBNAME)
!      Like 'INIT_CUMULATIVE_ARGS' but only used for outgoing libcalls, it
!      gets a 'MODE' argument instead of FNTYPE, that would be 'NULL'.
       INDIRECT would always be zero, too.  If this macro is not defined,
!      'INIT_CUMULATIVE_ARGS (cum, NULL_RTX, libname, 0)' is used instead.
  
   -- Macro: INIT_CUMULATIVE_INCOMING_ARGS (CUM, FNTYPE, LIBNAME)
!      Like 'INIT_CUMULATIVE_ARGS' but overrides it for the purposes of
       finding the arguments for the function being compiled.  If this
!      macro is undefined, 'INIT_CUMULATIVE_ARGS' is used instead.
  
       The value passed for LIBNAME is always 0, since library routines
       with special calling conventions are never compiled with GCC.  The
!      argument LIBNAME exists for symmetry with 'INIT_CUMULATIVE_ARGS'.
  
!  -- Target Hook: void TARGET_FUNCTION_ARG_ADVANCE (cumulative_args_t CA,
!           machine_mode MODE, const_tree TYPE, bool NAMED)
       This hook updates the summarizer variable pointed to by CA to
       advance past an argument in the argument list.  The values MODE,
       TYPE and NAMED describe that argument.  Once this is done, the
       variable CUM is suitable for analyzing the _following_ argument
!      with 'TARGET_FUNCTION_ARG', etc.
  
       This hook need not do anything if the argument in question was
!      passed on the stack.  The compiler knows how to track the amount of
!      stack space used for arguments without any special help.
  
   -- Macro: FUNCTION_ARG_OFFSET (MODE, TYPE)
       If defined, a C expression that is the number of bytes to add to
       the offset of the argument passed in memory.  This is needed for
!      the SPU, which passes 'char' and 'short' arguments in the preferred
       slot that is in the middle of the quad word instead of starting at
       the top.
  
   -- Macro: FUNCTION_ARG_PADDING (MODE, TYPE)
       If defined, a C expression which determines whether, and in which
       direction, to pad out an argument with extra space.  The value
!      should be of type 'enum direction': either 'upward' to pad above
!      the argument, 'downward' to pad below, or 'none' to inhibit
       padding.
  
       The _amount_ of padding is not controlled by this macro, but by the
!      target hook 'TARGET_FUNCTION_ARG_ROUND_BOUNDARY'.  It is always
       just enough to reach the next multiple of that boundary.
  
       This macro has a default definition which is right for most
!      systems.  For little-endian machines, the default is to pad upward.
!      For big-endian machines, the default is to pad downward for an
!      argument of constant size shorter than an 'int', and upward
       otherwise.
  
   -- Macro: PAD_VARARGS_DOWN
       If defined, a C expression which determines whether the default
       implementation of va_arg will attempt to pad down before reading
       the next argument, if that argument is smaller than its aligned
!      space as controlled by 'PARM_BOUNDARY'.  If this macro is not
!      defined, all such arguments are padded down if 'BYTES_BIG_ENDIAN'
       is true.
  
   -- Macro: BLOCK_REG_PADDING (MODE, TYPE, FIRST)
*************** the stack.
*** 31628,31650 ****
       registers and memory.  FIRST is nonzero if this is the only
       element.  Defining this macro allows better control of register
       function parameters on big-endian machines, without using
!      `PARALLEL' rtl.  In particular, `MUST_PASS_IN_STACK' need not test
       padding and mode of types in registers, as there is no longer a
!      "wrong" part of a register;  For example, a three byte aggregate
!      may be passed in the high part of a register if so required.
  
!  -- Target Hook: unsigned int TARGET_FUNCTION_ARG_BOUNDARY
!           (machine_mode MODE, const_tree TYPE)
       This hook returns the alignment boundary, in bits, of an argument
       with the specified mode and type.  The default hook returns
!      `PARM_BOUNDARY' for all arguments.
  
   -- Target Hook: unsigned int TARGET_FUNCTION_ARG_ROUND_BOUNDARY
            (machine_mode MODE, const_tree TYPE)
!      Normally, the size of an argument is rounded up to `PARM_BOUNDARY',
!      which is the default value for this hook.  You can define this
!      hook to return a different value if an argument size must be
!      rounded to a larger value.
  
   -- Macro: FUNCTION_ARG_REGNO_P (REGNO)
       A C expression that is nonzero if REGNO is the number of a hard
--- 31234,31256 ----
       registers and memory.  FIRST is nonzero if this is the only
       element.  Defining this macro allows better control of register
       function parameters on big-endian machines, without using
!      'PARALLEL' rtl.  In particular, 'MUST_PASS_IN_STACK' need not test
       padding and mode of types in registers, as there is no longer a
!      "wrong" part of a register; For example, a three byte aggregate may
!      be passed in the high part of a register if so required.
  
!  -- Target Hook: unsigned int TARGET_FUNCTION_ARG_BOUNDARY (machine_mode
!           MODE, const_tree TYPE)
       This hook returns the alignment boundary, in bits, of an argument
       with the specified mode and type.  The default hook returns
!      'PARM_BOUNDARY' for all arguments.
  
   -- Target Hook: unsigned int TARGET_FUNCTION_ARG_ROUND_BOUNDARY
            (machine_mode MODE, const_tree TYPE)
!      Normally, the size of an argument is rounded up to 'PARM_BOUNDARY',
!      which is the default value for this hook.  You can define this hook
!      to return a different value if an argument size must be rounded to
!      a larger value.
  
   -- Macro: FUNCTION_ARG_REGNO_P (REGNO)
       A C expression that is nonzero if REGNO is the number of a hard
*************** the stack.
*** 31659,31681 ****
       as two scalar parameters.  By default, GCC will attempt to pack
       complex arguments into the target's word size.  Some ABIs require
       complex arguments to be split and treated as their individual
!      components.  For example, on AIX64, complex floats should be
!      passed in a pair of floating point registers, even though a
!      complex float would fit in one 64-bit floating point register.
  
!      The default value of this hook is `NULL', which is treated as
       always false.
  
   -- Target Hook: tree TARGET_BUILD_BUILTIN_VA_LIST (void)
!      This hook returns a type node for `va_list' for the target.  The
!      default version of the hook returns `void*'.
  
!  -- Target Hook: int TARGET_ENUM_VA_LIST_P (int IDX, const char
!           **PNAME, tree *PTREE)
!      This target hook is used in function `c_common_nodes_and_builtins'
       to iterate through the target specific builtin types for va_list.
!      The variable IDX is used as iterator. PNAME has to be a pointer to
!      a `const char *' and PTREE a pointer to a `tree' typed variable.
       The arguments PNAME and PTREE are used to store the result of this
       macro and are set to the name of the va_list builtin type and its
       internal type.  If the return value of this macro is zero, then
--- 31265,31287 ----
       as two scalar parameters.  By default, GCC will attempt to pack
       complex arguments into the target's word size.  Some ABIs require
       complex arguments to be split and treated as their individual
!      components.  For example, on AIX64, complex floats should be passed
!      in a pair of floating point registers, even though a complex float
!      would fit in one 64-bit floating point register.
  
!      The default value of this hook is 'NULL', which is treated as
       always false.
  
   -- Target Hook: tree TARGET_BUILD_BUILTIN_VA_LIST (void)
!      This hook returns a type node for 'va_list' for the target.  The
!      default version of the hook returns 'void*'.
  
!  -- Target Hook: int TARGET_ENUM_VA_LIST_P (int IDX, const char **PNAME,
!           tree *PTREE)
!      This target hook is used in function 'c_common_nodes_and_builtins'
       to iterate through the target specific builtin types for va_list.
!      The variable IDX is used as iterator.  PNAME has to be a pointer to
!      a 'const char *' and PTREE a pointer to a 'tree' typed variable.
       The arguments PNAME and PTREE are used to store the result of this
       macro and are set to the name of the va_list builtin type and its
       internal type.  If the return value of this macro is zero, then
*************** the stack.
*** 31685,31726 ****
   -- Target Hook: tree TARGET_FN_ABI_VA_LIST (tree FNDECL)
       This hook returns the va_list type of the calling convention
       specified by FNDECL.  The default version of this hook returns
!      `va_list_type_node'.
  
   -- Target Hook: tree TARGET_CANONICAL_VA_LIST_TYPE (tree TYPE)
       This hook returns the va_list type of the calling convention
!      specified by the type of TYPE. If TYPE is not a valid va_list
!      type, it returns `NULL_TREE'.
  
   -- Target Hook: tree TARGET_GIMPLIFY_VA_ARG_EXPR (tree VALIST, tree
            TYPE, gimple_seq *PRE_P, gimple_seq *POST_P)
!      This hook performs target-specific gimplification of
!      `VA_ARG_EXPR'.  The first two parameters correspond to the
!      arguments to `va_arg'; the latter two are as in
!      `gimplify.c:gimplify_expr'.
  
   -- Target Hook: bool TARGET_VALID_POINTER_MODE (machine_mode MODE)
       Define this to return nonzero if the port can handle pointers with
       machine mode MODE.  The default version of this hook returns true
!      for both `ptr_mode' and `Pmode'.
  
   -- Target Hook: bool TARGET_REF_MAY_ALIAS_ERRNO (struct ao_ref *REF)
!      Define this to return nonzero if the memory reference REF  may
!      alias with the system C library errno location.  The default
!      version of this hook assumes the system C library errno location
!      is either a declaration of type int or accessed by dereferencing
!      a pointer to int.
  
   -- Target Hook: bool TARGET_SCALAR_MODE_SUPPORTED_P (machine_mode MODE)
       Define this to return nonzero if the port is prepared to handle
       insns involving scalar mode MODE.  For a scalar mode to be
!      considered supported, all the basic arithmetic and comparisons
!      must work.
  
!      The default version of this hook returns true for any mode
!      required to handle the basic C types (as defined by the port).
!      Included here are the double-word arithmetic supported by the code
!      in `optabs.c'.
  
   -- Target Hook: bool TARGET_VECTOR_MODE_SUPPORTED_P (machine_mode MODE)
       Define this to return nonzero if the port is prepared to handle
--- 31291,31331 ----
   -- Target Hook: tree TARGET_FN_ABI_VA_LIST (tree FNDECL)
       This hook returns the va_list type of the calling convention
       specified by FNDECL.  The default version of this hook returns
!      'va_list_type_node'.
  
   -- Target Hook: tree TARGET_CANONICAL_VA_LIST_TYPE (tree TYPE)
       This hook returns the va_list type of the calling convention
!      specified by the type of TYPE.  If TYPE is not a valid va_list
!      type, it returns 'NULL_TREE'.
  
   -- Target Hook: tree TARGET_GIMPLIFY_VA_ARG_EXPR (tree VALIST, tree
            TYPE, gimple_seq *PRE_P, gimple_seq *POST_P)
!      This hook performs target-specific gimplification of 'VA_ARG_EXPR'.
!      The first two parameters correspond to the arguments to 'va_arg';
!      the latter two are as in 'gimplify.c:gimplify_expr'.
  
   -- Target Hook: bool TARGET_VALID_POINTER_MODE (machine_mode MODE)
       Define this to return nonzero if the port can handle pointers with
       machine mode MODE.  The default version of this hook returns true
!      for both 'ptr_mode' and 'Pmode'.
  
   -- Target Hook: bool TARGET_REF_MAY_ALIAS_ERRNO (struct ao_ref *REF)
!      Define this to return nonzero if the memory reference REF may alias
!      with the system C library errno location.  The default version of
!      this hook assumes the system C library errno location is either a
!      declaration of type int or accessed by dereferencing a pointer to
!      int.
  
   -- Target Hook: bool TARGET_SCALAR_MODE_SUPPORTED_P (machine_mode MODE)
       Define this to return nonzero if the port is prepared to handle
       insns involving scalar mode MODE.  For a scalar mode to be
!      considered supported, all the basic arithmetic and comparisons must
!      work.
  
!      The default version of this hook returns true for any mode required
!      to handle the basic C types (as defined by the port).  Included
!      here are the double-word arithmetic supported by the code in
!      'optabs.c'.
  
   -- Target Hook: bool TARGET_VECTOR_MODE_SUPPORTED_P (machine_mode MODE)
       Define this to return nonzero if the port is prepared to handle
*************** the stack.
*** 31731,31737 ****
            unsigned HOST_WIDE_INT NELEMS)
       Return true if GCC should try to use a scalar mode to store an
       array of NELEMS elements, given that each element has mode MODE.
!      Returning true here overrides the usual `MAX_FIXED_MODE' limit and
       allows GCC to use any defined integer mode.
  
       One use of this hook is to support vector load and store operations
--- 31336,31342 ----
            unsigned HOST_WIDE_INT NELEMS)
       Return true if GCC should try to use a scalar mode to store an
       array of NELEMS elements, given that each element has mode MODE.
!      Returning true here overrides the usual 'MAX_FIXED_MODE' limit and
       allows GCC to use any defined integer mode.
  
       One use of this hook is to support vector load and store operations
*************** the stack.
*** 31747,31770 ****
              int8x8_t val[3];
            } int8x8x3_t;
  
!      If this hook allows `val' to have a scalar mode, then `int8x8x3_t'
!      can have the same mode.  GCC can then store `int8x8x3_t's in
       registers rather than forcing them onto the stack.
  
   -- Target Hook: bool TARGET_LIBGCC_FLOATING_MODE_SUPPORTED_P
            (machine_mode MODE)
       Define this to return nonzero if libgcc provides support for the
       floating-point mode MODE, which is known to pass
!      `TARGET_SCALAR_MODE_SUPPORTED_P'.  The default version of this
!      hook returns true for all of `SFmode', `DFmode', `XFmode' and
!      `TFmode', if such modes exist.
  
   -- Target Hook: bool TARGET_SMALL_REGISTER_CLASSES_FOR_MODE_P
            (machine_mode MODE)
       Define this to return nonzero for machine modes for which the port
       has small register classes.  If this target hook returns nonzero
!      for a given MODE, the compiler will try to minimize the lifetime
!      of registers in MODE.  The hook may be called with `VOIDmode' as
       argument.  In this case, the hook is expected to return nonzero if
       it returns nonzero for any mode.
  
--- 31352,31375 ----
              int8x8_t val[3];
            } int8x8x3_t;
  
!      If this hook allows 'val' to have a scalar mode, then 'int8x8x3_t'
!      can have the same mode.  GCC can then store 'int8x8x3_t's in
       registers rather than forcing them onto the stack.
  
   -- Target Hook: bool TARGET_LIBGCC_FLOATING_MODE_SUPPORTED_P
            (machine_mode MODE)
       Define this to return nonzero if libgcc provides support for the
       floating-point mode MODE, which is known to pass
!      'TARGET_SCALAR_MODE_SUPPORTED_P'.  The default version of this hook
!      returns true for all of 'SFmode', 'DFmode', 'XFmode' and 'TFmode',
!      if such modes exist.
  
   -- Target Hook: bool TARGET_SMALL_REGISTER_CLASSES_FOR_MODE_P
            (machine_mode MODE)
       Define this to return nonzero for machine modes for which the port
       has small register classes.  If this target hook returns nonzero
!      for a given MODE, the compiler will try to minimize the lifetime of
!      registers in MODE.  The hook may be called with 'VOIDmode' as
       argument.  In this case, the hook is expected to return nonzero if
       it returns nonzero for any mode.
  
*************** the stack.
*** 31778,31797 ****
       in an instruction, but the machine modes of the registers set or
       used in the instruction are already known.  And for some machines,
       register classes are small for, say, integer registers but not for
!      floating point registers.  For example, the AMD x86-64
!      architecture requires specific registers for the legacy x86
!      integer instructions, but there are many SSE registers for
!      floating point operations.  On such targets, a good strategy may
!      be to return nonzero from this hook for `INTEGRAL_MODE_P' machine
!      modes but zero for the SSE register classes.
  
!      The default version of this hook returns false for any mode.  It
!      is always safe to redefine this hook to return with a nonzero
!      value.  But if you unnecessarily define it, you will reduce the
!      amount of optimizations that can be performed in some cases.  If
!      you do not define this hook to return a nonzero value when it is
!      required, the compiler will run out of spill registers and print a
!      fatal error message.
  
  
  File: gccint.info,  Node: Scalar Return,  Next: Aggregate Return,  Prev: Register Arguments,  Up: Stack and Calling
--- 31383,31402 ----
       in an instruction, but the machine modes of the registers set or
       used in the instruction are already known.  And for some machines,
       register classes are small for, say, integer registers but not for
!      floating point registers.  For example, the AMD x86-64 architecture
!      requires specific registers for the legacy x86 integer
!      instructions, but there are many SSE registers for floating point
!      operations.  On such targets, a good strategy may be to return
!      nonzero from this hook for 'INTEGRAL_MODE_P' machine modes but zero
!      for the SSE register classes.
  
!      The default version of this hook returns false for any mode.  It is
!      always safe to redefine this hook to return with a nonzero value.
!      But if you unnecessarily define it, you will reduce the amount of
!      optimizations that can be performed in some cases.  If you do not
!      define this hook to return a nonzero value when it is required, the
!      compiler will run out of spill registers and print a fatal error
!      message.
  
  
  File: gccint.info,  Node: Scalar Return,  Next: Aggregate Return,  Prev: Register Arguments,  Up: Stack and Calling
*************** values--values that can fit in registers
*** 31804,31851 ****
  
   -- Target Hook: rtx TARGET_FUNCTION_VALUE (const_tree RET_TYPE,
            const_tree FN_DECL_OR_TYPE, bool OUTGOING)
       Define this to return an RTX representing the place where a
       function returns or receives a value of data type RET_TYPE, a tree
       node representing a data type.  FN_DECL_OR_TYPE is a tree node
!      representing `FUNCTION_DECL' or `FUNCTION_TYPE' of a function
!      being called.  If OUTGOING is false, the hook should compute the
!      register in which the caller will see the return value.
!      Otherwise, the hook should return an RTX representing the place
!      where a function returns a value.
  
!      On many machines, only `TYPE_MODE (RET_TYPE)' is relevant.
       (Actually, on most machines, scalar values are returned in the same
       place regardless of mode.)  The value of the expression is usually
!      a `reg' RTX for the hard register where the return value is stored.
!      The value can also be a `parallel' RTX, if the return value is in
!      multiple places.  See `TARGET_FUNCTION_ARG' for an explanation of
!      the `parallel' form.   Note that the callee will populate every
!      location specified in the `parallel', but if the first element of
!      the `parallel' contains the whole return value, callers will use
       that element as the canonical location and ignore the others.  The
!      m68k port uses this type of `parallel' to return pointers in both
!      `%a0' (the canonical location) and `%d0'.
  
!      If `TARGET_PROMOTE_FUNCTION_RETURN' returns true, you must apply
!      the same promotion rules specified in `PROMOTE_MODE' if VALTYPE is
       a scalar type.
  
       If the precise function being called is known, FUNC is a tree node
!      (`FUNCTION_DECL') for it; otherwise, FUNC is a null pointer.  This
!      makes it possible to use a different value-returning convention
!      for specific functions when all their calls are known.
  
       Some target machines have "register windows" so that the register
!      in which a function returns its value is not the same as the one
!      in which the caller sees the value.  For such machines, you should
       return different RTX depending on OUTGOING.
  
!      `TARGET_FUNCTION_VALUE' is not used for return values with
       aggregate data types, because these are returned in another way.
!      See `TARGET_STRUCT_VALUE_RTX' and related macros, below.
  
   -- Macro: FUNCTION_VALUE (VALTYPE, FUNC)
!      This macro has been deprecated.  Use `TARGET_FUNCTION_VALUE' for a
       new target instead.
  
   -- Macro: LIBCALL_VALUE (MODE)
--- 31409,31457 ----
  
   -- Target Hook: rtx TARGET_FUNCTION_VALUE (const_tree RET_TYPE,
            const_tree FN_DECL_OR_TYPE, bool OUTGOING)
+ 
       Define this to return an RTX representing the place where a
       function returns or receives a value of data type RET_TYPE, a tree
       node representing a data type.  FN_DECL_OR_TYPE is a tree node
!      representing 'FUNCTION_DECL' or 'FUNCTION_TYPE' of a function being
!      called.  If OUTGOING is false, the hook should compute the register
!      in which the caller will see the return value.  Otherwise, the hook
!      should return an RTX representing the place where a function
!      returns a value.
  
!      On many machines, only 'TYPE_MODE (RET_TYPE)' is relevant.
       (Actually, on most machines, scalar values are returned in the same
       place regardless of mode.)  The value of the expression is usually
!      a 'reg' RTX for the hard register where the return value is stored.
!      The value can also be a 'parallel' RTX, if the return value is in
!      multiple places.  See 'TARGET_FUNCTION_ARG' for an explanation of
!      the 'parallel' form.  Note that the callee will populate every
!      location specified in the 'parallel', but if the first element of
!      the 'parallel' contains the whole return value, callers will use
       that element as the canonical location and ignore the others.  The
!      m68k port uses this type of 'parallel' to return pointers in both
!      '%a0' (the canonical location) and '%d0'.
  
!      If 'TARGET_PROMOTE_FUNCTION_RETURN' returns true, you must apply
!      the same promotion rules specified in 'PROMOTE_MODE' if VALTYPE is
       a scalar type.
  
       If the precise function being called is known, FUNC is a tree node
!      ('FUNCTION_DECL') for it; otherwise, FUNC is a null pointer.  This
!      makes it possible to use a different value-returning convention for
!      specific functions when all their calls are known.
  
       Some target machines have "register windows" so that the register
!      in which a function returns its value is not the same as the one in
!      which the caller sees the value.  For such machines, you should
       return different RTX depending on OUTGOING.
  
!      'TARGET_FUNCTION_VALUE' is not used for return values with
       aggregate data types, because these are returned in another way.
!      See 'TARGET_STRUCT_VALUE_RTX' and related macros, below.
  
   -- Macro: FUNCTION_VALUE (VALTYPE, FUNC)
!      This macro has been deprecated.  Use 'TARGET_FUNCTION_VALUE' for a
       new target instead.
  
   -- Macro: LIBCALL_VALUE (MODE)
*************** values--values that can fit in registers
*** 31875,31881 ****
       register in which the values of called function may come back.
  
       A register whose use for returning values is limited to serving as
!      the second of a pair (for a value of type `double', say) need not
       be recognized by this macro.  So for most machines, this definition
       suffices:
  
--- 31481,31487 ----
       register in which the values of called function may come back.
  
       A register whose use for returning values is limited to serving as
!      the second of a pair (for a value of type 'double', say) need not
       be recognized by this macro.  So for most machines, this definition
       suffices:
  
*************** values--values that can fit in registers
*** 31886,31900 ****
       macro should recognize only the caller's register numbers.
  
       This macro has been deprecated.  Use
!      `TARGET_FUNCTION_VALUE_REGNO_P' for a new target instead.
  
   -- Target Hook: bool TARGET_FUNCTION_VALUE_REGNO_P (const unsigned int
            REGNO)
!      A target hook that return `true' if REGNO is the number of a hard
       register in which the values of called function may come back.
  
       A register whose use for returning values is limited to serving as
!      the second of a pair (for a value of type `double', say) need not
       be recognized by this target hook.
  
       If the machine has register windows, so that the caller and the
--- 31492,31506 ----
       macro should recognize only the caller's register numbers.
  
       This macro has been deprecated.  Use
!      'TARGET_FUNCTION_VALUE_REGNO_P' for a new target instead.
  
   -- Target Hook: bool TARGET_FUNCTION_VALUE_REGNO_P (const unsigned int
            REGNO)
!      A target hook that return 'true' if REGNO is the number of a hard
       register in which the values of called function may come back.
  
       A register whose use for returning values is limited to serving as
!      the second of a pair (for a value of type 'double', say) need not
       be recognized by this target hook.
  
       If the machine has register windows, so that the caller and the
*************** values--values that can fit in registers
*** 31905,31932 ****
       used.
  
   -- Macro: APPLY_RESULT_SIZE
!      Define this macro if `untyped_call' and `untyped_return' need more
!      space than is implied by `FUNCTION_VALUE_REGNO_P' for saving and
       restoring an arbitrary return value.
  
   -- Target Hook: bool TARGET_OMIT_STRUCT_RETURN_REG
       Normally, when a function returns a structure by memory, the
       address is passed as an invisible pointer argument, but the
!      compiler also arranges to return the address from the function
!      like it would a normal pointer return value.  Define this to true
!      if that behaviour is undesirable on your target.
  
   -- Target Hook: bool TARGET_RETURN_IN_MSB (const_tree TYPE)
!      This hook should return true if values of type TYPE are returned
!      at the most significant end of a register (in other words, if they
!      are padded at the least significant end).  You can assume that TYPE
!      is returned in a register; the caller is required to check this.
  
!      Note that the register provided by `TARGET_FUNCTION_VALUE' must be
       able to hold the complete return value.  For example, if a 1-, 2-
       or 3-byte structure is returned at the most significant end of a
!      4-byte register, `TARGET_FUNCTION_VALUE' should provide an
!      `SImode' rtx.
  
  
  File: gccint.info,  Node: Aggregate Return,  Next: Caller Saves,  Prev: Scalar Return,  Up: Stack and Calling
--- 31511,31538 ----
       used.
  
   -- Macro: APPLY_RESULT_SIZE
!      Define this macro if 'untyped_call' and 'untyped_return' need more
!      space than is implied by 'FUNCTION_VALUE_REGNO_P' for saving and
       restoring an arbitrary return value.
  
   -- Target Hook: bool TARGET_OMIT_STRUCT_RETURN_REG
       Normally, when a function returns a structure by memory, the
       address is passed as an invisible pointer argument, but the
!      compiler also arranges to return the address from the function like
!      it would a normal pointer return value.  Define this to true if
!      that behaviour is undesirable on your target.
  
   -- Target Hook: bool TARGET_RETURN_IN_MSB (const_tree TYPE)
!      This hook should return true if values of type TYPE are returned at
!      the most significant end of a register (in other words, if they are
!      padded at the least significant end).  You can assume that TYPE is
!      returned in a register; the caller is required to check this.
  
!      Note that the register provided by 'TARGET_FUNCTION_VALUE' must be
       able to hold the complete return value.  For example, if a 1-, 2-
       or 3-byte structure is returned at the most significant end of a
!      4-byte register, 'TARGET_FUNCTION_VALUE' should provide an 'SImode'
!      rtx.
  
  
  File: gccint.info,  Node: Aggregate Return,  Next: Caller Saves,  Prev: Scalar Return,  Up: Stack and Calling
*************** File: gccint.info,  Node: Aggregate Retu
*** 31934,31943 ****
  17.9.9 How Large Values Are Returned
  ------------------------------------
  
! When a function value's mode is `BLKmode' (and in some other cases),
! the value is not returned according to `TARGET_FUNCTION_VALUE' (*note
! Scalar Return::).  Instead, the caller passes the address of a block of
! memory in which the value should be stored.  This address is called the
  "structure value address".
  
   This section describes how to control returning structure values in
--- 31540,31549 ----
  17.9.9 How Large Values Are Returned
  ------------------------------------
  
! When a function value's mode is 'BLKmode' (and in some other cases), the
! value is not returned according to 'TARGET_FUNCTION_VALUE' (*note Scalar
! Return::).  Instead, the caller passes the address of a block of memory
! in which the value should be stored.  This address is called the
  "structure value address".
  
   This section describes how to control returning structure values in
*************** memory.
*** 31948,31996 ****
       This target hook should return a nonzero value to say to return the
       function value in memory, just as large structures are always
       returned.  Here TYPE will be the data type of the value, and FNTYPE
!      will be the type of the function doing the returning, or `NULL' for
       libcalls.
  
!      Note that values of mode `BLKmode' must be explicitly handled by
!      this function.  Also, the option `-fpcc-struct-return' takes
!      effect regardless of this macro.  On most systems, it is possible
!      to leave the hook undefined; this causes a default definition to
!      be used, whose value is the constant 1 for `BLKmode' values, and 0
       otherwise.
  
       Do not use this hook to indicate that structures and unions should
       always be returned in memory.  You should instead use
!      `DEFAULT_PCC_STRUCT_RETURN' to indicate this.
  
   -- Macro: DEFAULT_PCC_STRUCT_RETURN
       Define this macro to be 1 if all structure and union return values
       must be in memory.  Since this results in slower code, this should
!      be defined only if needed for compatibility with other compilers
!      or with an ABI.  If you define this macro to be 0, then the
       conventions used for structure and union return values are decided
!      by the `TARGET_RETURN_IN_MEMORY' target hook.
  
       If not defined, this defaults to the value 1.
  
   -- Target Hook: rtx TARGET_STRUCT_VALUE_RTX (tree FNDECL, int INCOMING)
       This target hook should return the location of the structure value
!      address (normally a `mem' or `reg'), or 0 if the address is passed
!      as an "invisible" first argument.  Note that FNDECL may be `NULL',
       for libcalls.  You do not need to define this target hook if the
       address is always passed as an "invisible" first argument.
  
       On some architectures the place where the structure value address
       is found by the called function is not the same place that the
!      caller put it.  This can be due to register windows, or it could
!      be because the function prologue moves it to a different place.
!      INCOMING is `1' or `2' when the location is needed in the context
!      of the called function, and `0' in the context of the caller.
  
!      If INCOMING is nonzero and the address is to be found on the
!      stack, return a `mem' which refers to the frame pointer. If
!      INCOMING is `2', the result is being used to fetch the structure
!      value address at the beginning of a function.  If you need to emit
!      adjusting code, you should do it at this point.
  
   -- Macro: PCC_STATIC_STRUCT_RETURN
       Define this macro if the usual system convention on the target
--- 31554,31602 ----
       This target hook should return a nonzero value to say to return the
       function value in memory, just as large structures are always
       returned.  Here TYPE will be the data type of the value, and FNTYPE
!      will be the type of the function doing the returning, or 'NULL' for
       libcalls.
  
!      Note that values of mode 'BLKmode' must be explicitly handled by
!      this function.  Also, the option '-fpcc-struct-return' takes effect
!      regardless of this macro.  On most systems, it is possible to leave
!      the hook undefined; this causes a default definition to be used,
!      whose value is the constant 1 for 'BLKmode' values, and 0
       otherwise.
  
       Do not use this hook to indicate that structures and unions should
       always be returned in memory.  You should instead use
!      'DEFAULT_PCC_STRUCT_RETURN' to indicate this.
  
   -- Macro: DEFAULT_PCC_STRUCT_RETURN
       Define this macro to be 1 if all structure and union return values
       must be in memory.  Since this results in slower code, this should
!      be defined only if needed for compatibility with other compilers or
!      with an ABI.  If you define this macro to be 0, then the
       conventions used for structure and union return values are decided
!      by the 'TARGET_RETURN_IN_MEMORY' target hook.
  
       If not defined, this defaults to the value 1.
  
   -- Target Hook: rtx TARGET_STRUCT_VALUE_RTX (tree FNDECL, int INCOMING)
       This target hook should return the location of the structure value
!      address (normally a 'mem' or 'reg'), or 0 if the address is passed
!      as an "invisible" first argument.  Note that FNDECL may be 'NULL',
       for libcalls.  You do not need to define this target hook if the
       address is always passed as an "invisible" first argument.
  
       On some architectures the place where the structure value address
       is found by the called function is not the same place that the
!      caller put it.  This can be due to register windows, or it could be
!      because the function prologue moves it to a different place.
!      INCOMING is '1' or '2' when the location is needed in the context
!      of the called function, and '0' in the context of the caller.
  
!      If INCOMING is nonzero and the address is to be found on the stack,
!      return a 'mem' which refers to the frame pointer.  If INCOMING is
!      '2', the result is being used to fetch the structure value address
!      at the beginning of a function.  If you need to emit adjusting
!      code, you should do it at this point.
  
   -- Macro: PCC_STATIC_STRUCT_RETURN
       Define this macro if the usual system convention on the target
*************** memory.
*** 31998,32018 ****
       function to return the address of a static variable containing the
       value.
  
!      Do not define this if the usual system convention is for the
!      caller to pass an address to the subroutine.
  
!      This macro has effect in `-fpcc-struct-return' mode, but it does
!      nothing when you use `-freg-struct-return' mode.
  
   -- Target Hook: machine_mode TARGET_GET_RAW_RESULT_MODE (int REGNO)
       This target hook returns the mode to be used when accessing raw
!      return registers in `__builtin_return'.  Define this macro if the
       value in REG_RAW_MODE is not correct.
  
   -- Target Hook: machine_mode TARGET_GET_RAW_ARG_MODE (int REGNO)
       This target hook returns the mode to be used when accessing raw
!      argument registers in `__builtin_apply_args'.  Define this macro
!      if the value in REG_RAW_MODE is not correct.
  
  
  File: gccint.info,  Node: Caller Saves,  Next: Function Entry,  Prev: Aggregate Return,  Up: Stack and Calling
--- 31604,31624 ----
       function to return the address of a static variable containing the
       value.
  
!      Do not define this if the usual system convention is for the caller
!      to pass an address to the subroutine.
  
!      This macro has effect in '-fpcc-struct-return' mode, but it does
!      nothing when you use '-freg-struct-return' mode.
  
   -- Target Hook: machine_mode TARGET_GET_RAW_RESULT_MODE (int REGNO)
       This target hook returns the mode to be used when accessing raw
!      return registers in '__builtin_return'.  Define this macro if the
       value in REG_RAW_MODE is not correct.
  
   -- Target Hook: machine_mode TARGET_GET_RAW_ARG_MODE (int REGNO)
       This target hook returns the mode to be used when accessing raw
!      argument registers in '__builtin_apply_args'.  Define this macro if
!      the value in REG_RAW_MODE is not correct.
  
  
  File: gccint.info,  Node: Caller Saves,  Next: Function Entry,  Prev: Aggregate Return,  Up: Stack and Calling
*************** must live across calls.
*** 32027,32035 ****
   -- Macro: HARD_REGNO_CALLER_SAVE_MODE (REGNO, NREGS)
       A C expression specifying which mode is required for saving NREGS
       of a pseudo-register in call-clobbered hard register REGNO.  If
!      REGNO is unsuitable for caller save, `VOIDmode' should be
!      returned.  For most machines this macro need not be defined since
!      GCC will select the smallest suitable mode.
  
  
  File: gccint.info,  Node: Function Entry,  Next: Profiling,  Prev: Caller Saves,  Up: Stack and Calling
--- 31633,31641 ----
   -- Macro: HARD_REGNO_CALLER_SAVE_MODE (REGNO, NREGS)
       A C expression specifying which mode is required for saving NREGS
       of a pseudo-register in call-clobbered hard register REGNO.  If
!      REGNO is unsuitable for caller save, 'VOIDmode' should be returned.
!      For most machines this macro need not be defined since GCC will
!      select the smallest suitable mode.
  
  
  File: gccint.info,  Node: Function Entry,  Next: Profiling,  Prev: Caller Saves,  Up: Stack and Calling
*************** This section describes the macros that o
*** 32042,32083 ****
  
   -- Target Hook: void TARGET_ASM_FUNCTION_PROLOGUE (FILE *FILE,
            HOST_WIDE_INT SIZE)
!      If defined, a function that outputs the assembler code for entry
!      to a function.  The prologue is responsible for setting up the
!      stack frame, initializing the frame pointer register, saving
!      registers that must be saved, and allocating SIZE additional bytes
!      of storage for the local variables.  SIZE is an integer.  FILE is
!      a stdio stream to which the assembler code should be output.
  
       The label for the beginning of the function need not be output by
       this macro.  That has already been done when the macro is run.
  
       To determine which registers to save, the macro can refer to the
!      array `regs_ever_live': element R is nonzero if hard register R is
       used anywhere within the function.  This implies the function
       prologue should save register R, provided it is not one of the
!      call-used registers.  (`TARGET_ASM_FUNCTION_EPILOGUE' must
!      likewise use `regs_ever_live'.)
  
       On machines that have "register windows", the function entry code
       does not save on the stack the registers that are in the windows,
       even if they are supposed to be preserved by function calls;
!      instead it takes appropriate steps to "push" the register stack,
!      if any non-call-used registers are used in the function.
  
       On machines where functions may or may not have frame-pointers, the
       function entry code must vary accordingly; it must set up the frame
       pointer if one is wanted, and not otherwise.  To determine whether
       a frame pointer is in wanted, the macro can refer to the variable
!      `frame_pointer_needed'.  The variable's value will be 1 at run
!      time in a function that needs a frame pointer.  *Note
!      Elimination::.
  
       The function entry code is responsible for allocating any stack
       space required for the function.  This stack space consists of the
       regions listed below.  In most cases, these regions are allocated
!      in the order listed, with the last listed region closest to the
!      top of the stack (the lowest address if `STACK_GROWS_DOWNWARD' is
       defined, and the highest address if it is not defined).  You can
       use a different order for a machine if doing so is more convenient
       or required for compatibility reasons.  Except in cases where
--- 31648,31688 ----
  
   -- Target Hook: void TARGET_ASM_FUNCTION_PROLOGUE (FILE *FILE,
            HOST_WIDE_INT SIZE)
!      If defined, a function that outputs the assembler code for entry to
!      a function.  The prologue is responsible for setting up the stack
!      frame, initializing the frame pointer register, saving registers
!      that must be saved, and allocating SIZE additional bytes of storage
!      for the local variables.  SIZE is an integer.  FILE is a stdio
!      stream to which the assembler code should be output.
  
       The label for the beginning of the function need not be output by
       this macro.  That has already been done when the macro is run.
  
       To determine which registers to save, the macro can refer to the
!      array 'regs_ever_live': element R is nonzero if hard register R is
       used anywhere within the function.  This implies the function
       prologue should save register R, provided it is not one of the
!      call-used registers.  ('TARGET_ASM_FUNCTION_EPILOGUE' must likewise
!      use 'regs_ever_live'.)
  
       On machines that have "register windows", the function entry code
       does not save on the stack the registers that are in the windows,
       even if they are supposed to be preserved by function calls;
!      instead it takes appropriate steps to "push" the register stack, if
!      any non-call-used registers are used in the function.
  
       On machines where functions may or may not have frame-pointers, the
       function entry code must vary accordingly; it must set up the frame
       pointer if one is wanted, and not otherwise.  To determine whether
       a frame pointer is in wanted, the macro can refer to the variable
!      'frame_pointer_needed'.  The variable's value will be 1 at run time
!      in a function that needs a frame pointer.  *Note Elimination::.
  
       The function entry code is responsible for allocating any stack
       space required for the function.  This stack space consists of the
       regions listed below.  In most cases, these regions are allocated
!      in the order listed, with the last listed region closest to the top
!      of the stack (the lowest address if 'STACK_GROWS_DOWNWARD' is
       defined, and the highest address if it is not defined).  You can
       use a different order for a machine if doing so is more convenient
       or required for compatibility reasons.  Except in cases where
*************** This section describes the macros that o
*** 32101,32157 ****
            HOST_WIDE_INT SIZE)
       If defined, a function that outputs the assembler code for exit
       from a function.  The epilogue is responsible for restoring the
!      saved registers and stack pointer to their values when the
!      function was called, and returning control to the caller.  This
!      macro takes the same arguments as the macro
!      `TARGET_ASM_FUNCTION_PROLOGUE', and the registers to restore are
!      determined from `regs_ever_live' and `CALL_USED_REGISTERS' in the
!      same way.
  
       On some machines, there is a single instruction that does all the
       work of returning from the function.  On these machines, give that
!      instruction the name `return' and do not define the macro
!      `TARGET_ASM_FUNCTION_EPILOGUE' at all.
  
!      Do not define a pattern named `return' if you want the
!      `TARGET_ASM_FUNCTION_EPILOGUE' to be used.  If you want the target
       switches to control whether return instructions or epilogues are
!      used, define a `return' pattern with a validity condition that
!      tests the target switches appropriately.  If the `return'
!      pattern's validity condition is false, epilogues will be used.
  
       On machines where functions may or may not have frame-pointers, the
       function exit code must vary accordingly.  Sometimes the code for
       these two cases is completely different.  To determine whether a
       frame pointer is wanted, the macro can refer to the variable
!      `frame_pointer_needed'.  The variable's value will be 1 when
       compiling a function that needs a frame pointer.
  
!      Normally, `TARGET_ASM_FUNCTION_PROLOGUE' and
!      `TARGET_ASM_FUNCTION_EPILOGUE' must treat leaf functions specially.
!      The C variable `current_function_is_leaf' is nonzero for such a
       function.  *Note Leaf Functions::.
  
       On some machines, some functions pop their arguments on exit while
       others leave that for the caller to do.  For example, the 68020
!      when given `-mrtd' pops arguments in functions that take a fixed
       number of arguments.
  
!      Your definition of the macro `RETURN_POPS_ARGS' decides which
!      functions pop their own arguments.  `TARGET_ASM_FUNCTION_EPILOGUE'
       needs to know what was decided.  The number of bytes of the current
       function's arguments that this function should pop is available in
!      `crtl->args.pops_args'.  *Note Scalar Return::.
  
!    * A region of `crtl->args.pretend_args_size' bytes of uninitialized
       space just underneath the first argument arriving on the stack.
!      (This may not be at the very start of the allocated stack region
!      if the calling sequence has pushed anything else since pushing the
       stack arguments.  But usually, on such machines, nothing else has
       been pushed yet, because the function prologue itself does all the
!      pushing.)  This region is used on machines where an argument may
!      be passed partly in registers and partly in memory, and, in some
!      cases to support the features in `<stdarg.h>'.
  
     * An area of memory used to save certain registers used by the
       function.  The size of this area, which may also include space for
--- 31706,31761 ----
            HOST_WIDE_INT SIZE)
       If defined, a function that outputs the assembler code for exit
       from a function.  The epilogue is responsible for restoring the
!      saved registers and stack pointer to their values when the function
!      was called, and returning control to the caller.  This macro takes
!      the same arguments as the macro 'TARGET_ASM_FUNCTION_PROLOGUE', and
!      the registers to restore are determined from 'regs_ever_live' and
!      'CALL_USED_REGISTERS' in the same way.
  
       On some machines, there is a single instruction that does all the
       work of returning from the function.  On these machines, give that
!      instruction the name 'return' and do not define the macro
!      'TARGET_ASM_FUNCTION_EPILOGUE' at all.
  
!      Do not define a pattern named 'return' if you want the
!      'TARGET_ASM_FUNCTION_EPILOGUE' to be used.  If you want the target
       switches to control whether return instructions or epilogues are
!      used, define a 'return' pattern with a validity condition that
!      tests the target switches appropriately.  If the 'return' pattern's
!      validity condition is false, epilogues will be used.
  
       On machines where functions may or may not have frame-pointers, the
       function exit code must vary accordingly.  Sometimes the code for
       these two cases is completely different.  To determine whether a
       frame pointer is wanted, the macro can refer to the variable
!      'frame_pointer_needed'.  The variable's value will be 1 when
       compiling a function that needs a frame pointer.
  
!      Normally, 'TARGET_ASM_FUNCTION_PROLOGUE' and
!      'TARGET_ASM_FUNCTION_EPILOGUE' must treat leaf functions specially.
!      The C variable 'current_function_is_leaf' is nonzero for such a
       function.  *Note Leaf Functions::.
  
       On some machines, some functions pop their arguments on exit while
       others leave that for the caller to do.  For example, the 68020
!      when given '-mrtd' pops arguments in functions that take a fixed
       number of arguments.
  
!      Your definition of the macro 'RETURN_POPS_ARGS' decides which
!      functions pop their own arguments.  'TARGET_ASM_FUNCTION_EPILOGUE'
       needs to know what was decided.  The number of bytes of the current
       function's arguments that this function should pop is available in
!      'crtl->args.pops_args'.  *Note Scalar Return::.
  
!    * A region of 'crtl->args.pretend_args_size' bytes of uninitialized
       space just underneath the first argument arriving on the stack.
!      (This may not be at the very start of the allocated stack region if
!      the calling sequence has pushed anything else since pushing the
       stack arguments.  But usually, on such machines, nothing else has
       been pushed yet, because the function prologue itself does all the
!      pushing.)  This region is used on machines where an argument may be
!      passed partly in registers and partly in memory, and, in some cases
!      to support the features in '<stdarg.h>'.
  
     * An area of memory used to save certain registers used by the
       function.  The size of this area, which may also include space for
*************** This section describes the macros that o
*** 32166,32173 ****
       occur in the opposite order, with the save area closer to the top
       of the stack.
  
!    * Optionally, when `ACCUMULATE_OUTGOING_ARGS' is defined, a region of
!      `crtl->outgoing_args_size' bytes to be used for outgoing argument
       lists of the function.  *Note Stack Arguments::.
  
   -- Macro: EXIT_IGNORE_STACK
--- 31770,31777 ----
       occur in the opposite order, with the save area closer to the top
       of the stack.
  
!    * Optionally, when 'ACCUMULATE_OUTGOING_ARGS' is defined, a region of
!      'crtl->outgoing_args_size' bytes to be used for outgoing argument
       lists of the function.  *Note Stack Arguments::.
  
   -- Macro: EXIT_IGNORE_STACK
*************** This section describes the macros that o
*** 32179,32201 ****
  
       Note that this macro's value is relevant only for functions for
       which frame pointers are maintained.  It is never safe to delete a
!      final stack adjustment in a function that has no frame pointer,
!      and the compiler knows this regardless of `EXIT_IGNORE_STACK'.
  
   -- Macro: EPILOGUE_USES (REGNO)
       Define this macro as a C expression that is nonzero for registers
!      that are used by the epilogue or the `return' pattern.  The stack
       and frame pointer registers are already assumed to be used as
       needed.
  
   -- Macro: EH_USES (REGNO)
       Define this macro as a C expression that is nonzero for registers
!      that are used by the exception handling mechanism, and so should
!      be considered live on entry to an exception edge.
  
   -- Target Hook: void TARGET_ASM_OUTPUT_MI_THUNK (FILE *FILE, tree
!           THUNK_FNDECL, HOST_WIDE_INT DELTA, HOST_WIDE_INT
!           VCALL_OFFSET, tree FUNCTION)
       A function that outputs the assembler code for a thunk function,
       used to implement C++ virtual function calls with multiple
       inheritance.  The thunk acts as a wrapper around a virtual
--- 31783,31805 ----
  
       Note that this macro's value is relevant only for functions for
       which frame pointers are maintained.  It is never safe to delete a
!      final stack adjustment in a function that has no frame pointer, and
!      the compiler knows this regardless of 'EXIT_IGNORE_STACK'.
  
   -- Macro: EPILOGUE_USES (REGNO)
       Define this macro as a C expression that is nonzero for registers
!      that are used by the epilogue or the 'return' pattern.  The stack
       and frame pointer registers are already assumed to be used as
       needed.
  
   -- Macro: EH_USES (REGNO)
       Define this macro as a C expression that is nonzero for registers
!      that are used by the exception handling mechanism, and so should be
!      considered live on entry to an exception edge.
  
   -- Target Hook: void TARGET_ASM_OUTPUT_MI_THUNK (FILE *FILE, tree
!           THUNK_FNDECL, HOST_WIDE_INT DELTA, HOST_WIDE_INT VCALL_OFFSET,
!           tree FUNCTION)
       A function that outputs the assembler code for a thunk function,
       used to implement C++ virtual function calls with multiple
       inheritance.  The thunk acts as a wrapper around a virtual
*************** This section describes the macros that o
*** 32204,32248 ****
  
       First, emit code to add the integer DELTA to the location that
       contains the incoming first argument.  Assume that this argument
!      contains a pointer, and is the one used to pass the `this' pointer
       in C++.  This is the incoming argument _before_ the function
!      prologue, e.g. `%o0' on a sparc.  The addition must preserve the
       values of all other incoming arguments.
  
       Then, if VCALL_OFFSET is nonzero, an additional adjustment should
!      be made after adding `delta'.  In particular, if P is the adjusted
       pointer, the following adjustment should be made:
  
            p += (*((ptrdiff_t **)p))[vcall_offset/sizeof(ptrdiff_t)]
  
       After the additions, emit code to jump to FUNCTION, which is a
!      `FUNCTION_DECL'.  This is a direct pure jump, not a call, and does
       not touch the return address.  Hence returning from FUNCTION will
!      return to whoever called the current `thunk'.
  
!      The effect must be as if FUNCTION had been called directly with
!      the adjusted first argument.  This macro is responsible for
!      emitting all of the code for a thunk function;
!      `TARGET_ASM_FUNCTION_PROLOGUE' and `TARGET_ASM_FUNCTION_EPILOGUE'
       are not invoked.
  
       The THUNK_FNDECL is redundant.  (DELTA and FUNCTION have already
       been extracted from it.)  It might possibly be useful on some
       targets, but probably not.
  
!      If you do not define this macro, the target-independent code in
!      the C++ front end will generate a less efficient heavyweight thunk
!      that calls FUNCTION instead of jumping to it.  The generic
!      approach does not support varargs.
  
   -- Target Hook: bool TARGET_ASM_CAN_OUTPUT_MI_THUNK (const_tree
!           THUNK_FNDECL, HOST_WIDE_INT DELTA, HOST_WIDE_INT
!           VCALL_OFFSET, const_tree FUNCTION)
!      A function that returns true if TARGET_ASM_OUTPUT_MI_THUNK would
!      be able to output the assembler code for the thunk function
!      specified by the arguments it is passed, and false otherwise.  In
!      the latter case, the generic approach will be used by the C++
!      front end, with the limitations previously exposed.
  
  
  File: gccint.info,  Node: Profiling,  Next: Tail Calls,  Prev: Function Entry,  Up: Stack and Calling
--- 31808,31852 ----
  
       First, emit code to add the integer DELTA to the location that
       contains the incoming first argument.  Assume that this argument
!      contains a pointer, and is the one used to pass the 'this' pointer
       in C++.  This is the incoming argument _before_ the function
!      prologue, e.g. '%o0' on a sparc.  The addition must preserve the
       values of all other incoming arguments.
  
       Then, if VCALL_OFFSET is nonzero, an additional adjustment should
!      be made after adding 'delta'.  In particular, if P is the adjusted
       pointer, the following adjustment should be made:
  
            p += (*((ptrdiff_t **)p))[vcall_offset/sizeof(ptrdiff_t)]
  
       After the additions, emit code to jump to FUNCTION, which is a
!      'FUNCTION_DECL'.  This is a direct pure jump, not a call, and does
       not touch the return address.  Hence returning from FUNCTION will
!      return to whoever called the current 'thunk'.
  
!      The effect must be as if FUNCTION had been called directly with the
!      adjusted first argument.  This macro is responsible for emitting
!      all of the code for a thunk function;
!      'TARGET_ASM_FUNCTION_PROLOGUE' and 'TARGET_ASM_FUNCTION_EPILOGUE'
       are not invoked.
  
       The THUNK_FNDECL is redundant.  (DELTA and FUNCTION have already
       been extracted from it.)  It might possibly be useful on some
       targets, but probably not.
  
!      If you do not define this macro, the target-independent code in the
!      C++ front end will generate a less efficient heavyweight thunk that
!      calls FUNCTION instead of jumping to it.  The generic approach does
!      not support varargs.
  
   -- Target Hook: bool TARGET_ASM_CAN_OUTPUT_MI_THUNK (const_tree
!           THUNK_FNDECL, HOST_WIDE_INT DELTA, HOST_WIDE_INT VCALL_OFFSET,
!           const_tree FUNCTION)
!      A function that returns true if TARGET_ASM_OUTPUT_MI_THUNK would be
!      able to output the assembler code for the thunk function specified
!      by the arguments it is passed, and false otherwise.  In the latter
!      case, the generic approach will be used by the C++ front end, with
!      the limitations previously exposed.
  
  
  File: gccint.info,  Node: Profiling,  Next: Tail Calls,  Prev: Function Entry,  Up: Stack and Calling
*************** These macros will help you generate code
*** 32254,32282 ****
  
   -- Macro: FUNCTION_PROFILER (FILE, LABELNO)
       A C statement or compound statement to output to FILE some
!      assembler code to call the profiling subroutine `mcount'.
  
!      The details of how `mcount' expects to be called are determined by
       your operating system environment, not by GCC.  To figure them out,
       compile a small program for profiling using the system's installed
       C compiler and look at the assembler code that results.
  
!      Older implementations of `mcount' expect the address of a counter
       variable to be loaded into some register.  The name of this
!      variable is `LP' followed by the number LABELNO, so you would
!      generate the name using `LP%d' in a `fprintf'.
  
   -- Macro: PROFILE_HOOK
       A C statement or compound statement to output to FILE some assembly
!      code to call the profiling subroutine `mcount' even the target does
       not support profiling.
  
   -- Macro: NO_PROFILE_COUNTERS
       Define this macro to be an expression with a nonzero value if the
!      `mcount' subroutine on your system does not need a counter variable
       allocated for each function.  This is true for almost all modern
       implementations.  If you define this macro, you must not use the
!      LABELNO argument to `FUNCTION_PROFILER'.
  
   -- Macro: PROFILE_BEFORE_PROLOGUE
       Define this macro if the code for function profiling should come
--- 31858,31886 ----
  
   -- Macro: FUNCTION_PROFILER (FILE, LABELNO)
       A C statement or compound statement to output to FILE some
!      assembler code to call the profiling subroutine 'mcount'.
  
!      The details of how 'mcount' expects to be called are determined by
       your operating system environment, not by GCC.  To figure them out,
       compile a small program for profiling using the system's installed
       C compiler and look at the assembler code that results.
  
!      Older implementations of 'mcount' expect the address of a counter
       variable to be loaded into some register.  The name of this
!      variable is 'LP' followed by the number LABELNO, so you would
!      generate the name using 'LP%d' in a 'fprintf'.
  
   -- Macro: PROFILE_HOOK
       A C statement or compound statement to output to FILE some assembly
!      code to call the profiling subroutine 'mcount' even the target does
       not support profiling.
  
   -- Macro: NO_PROFILE_COUNTERS
       Define this macro to be an expression with a nonzero value if the
!      'mcount' subroutine on your system does not need a counter variable
       allocated for each function.  This is true for almost all modern
       implementations.  If you define this macro, you must not use the
!      LABELNO argument to 'FUNCTION_PROFILER'.
  
   -- Macro: PROFILE_BEFORE_PROLOGUE
       Define this macro if the code for function profiling should come
*************** These macros will help you generate code
*** 32284,32295 ****
       after.
  
   -- Target Hook: bool TARGET_KEEP_LEAF_WHEN_PROFILED (void)
!      This target hook returns true if the target wants the leaf flag
!      for the current function to stay true even if it calls mcount.
!      This might make sense for targets using the leaf flag only to
!      determine whether a stack frame needs to be generated or not and
!      for which the call to mcount is generated before the function
!      prologue.
  
  
  File: gccint.info,  Node: Tail Calls,  Next: Stack Smashing Protection,  Prev: Profiling,  Up: Stack and Calling
--- 31888,31898 ----
       after.
  
   -- Target Hook: bool TARGET_KEEP_LEAF_WHEN_PROFILED (void)
!      This target hook returns true if the target wants the leaf flag for
!      the current function to stay true even if it calls mcount.  This
!      might make sense for targets using the leaf flag only to determine
!      whether a stack frame needs to be generated or not and for which
!      the call to mcount is generated before the function prologue.
  
  
  File: gccint.info,  Node: Tail Calls,  Next: Stack Smashing Protection,  Prev: Profiling,  Up: Stack and Calling
*************** File: gccint.info,  Node: Tail Calls,  N
*** 32300,32324 ****
   -- Target Hook: bool TARGET_FUNCTION_OK_FOR_SIBCALL (tree DECL, tree
            EXP)
       True if it is OK to do sibling call optimization for the specified
!      call expression EXP.  DECL will be the called function, or `NULL'
       if this is an indirect call.
  
       It is not uncommon for limitations of calling conventions to
       prevent tail calls to functions outside the current unit of
       translation, or during PIC compilation.  The hook is used to
!      enforce these restrictions, as the `sibcall' md pattern can not
!      fail, or fall over to a "normal" call.  The criteria for
!      successful sibling call optimization may vary greatly between
!      different architectures.
  
   -- Target Hook: void TARGET_EXTRA_LIVE_ON_ENTRY (bitmap REGS)
       Add any hard registers to REGS that are live on entry to the
       function.  This hook only needs to be defined to provide registers
       that cannot be found by examination of FUNCTION_ARG_REGNO_P, the
       callee saved registers, STATIC_CHAIN_INCOMING_REGNUM,
!      STATIC_CHAIN_REGNUM, TARGET_STRUCT_VALUE_RTX,
!      FRAME_POINTER_REGNUM, EH_USES, FRAME_POINTER_REGNUM,
!      ARG_POINTER_REGNUM, and the PIC_OFFSET_TABLE_REGNUM.
  
   -- Target Hook: void TARGET_SET_UP_BY_PROLOGUE (struct
            hard_reg_set_container *)
--- 31903,31927 ----
   -- Target Hook: bool TARGET_FUNCTION_OK_FOR_SIBCALL (tree DECL, tree
            EXP)
       True if it is OK to do sibling call optimization for the specified
!      call expression EXP.  DECL will be the called function, or 'NULL'
       if this is an indirect call.
  
       It is not uncommon for limitations of calling conventions to
       prevent tail calls to functions outside the current unit of
       translation, or during PIC compilation.  The hook is used to
!      enforce these restrictions, as the 'sibcall' md pattern can not
!      fail, or fall over to a "normal" call.  The criteria for successful
!      sibling call optimization may vary greatly between different
!      architectures.
  
   -- Target Hook: void TARGET_EXTRA_LIVE_ON_ENTRY (bitmap REGS)
       Add any hard registers to REGS that are live on entry to the
       function.  This hook only needs to be defined to provide registers
       that cannot be found by examination of FUNCTION_ARG_REGNO_P, the
       callee saved registers, STATIC_CHAIN_INCOMING_REGNUM,
!      STATIC_CHAIN_REGNUM, TARGET_STRUCT_VALUE_RTX, FRAME_POINTER_REGNUM,
!      EH_USES, FRAME_POINTER_REGNUM, ARG_POINTER_REGNUM, and the
!      PIC_OFFSET_TABLE_REGNUM.
  
   -- Target Hook: void TARGET_SET_UP_BY_PROLOGUE (struct
            hard_reg_set_container *)
*************** File: gccint.info,  Node: Stack Smashing
*** 32339,32361 ****
  ---------------------------------
  
   -- Target Hook: tree TARGET_STACK_PROTECT_GUARD (void)
!      This hook returns a `DECL' node for the external variable to use
       for the stack protection guard.  This variable is initialized by
       the runtime to some random value and is used to initialize the
       guard value that is placed at the top of the local stack frame.
!      The type of this variable must be `ptr_type_node'.
  
       The default version of this hook creates a variable called
!      `__stack_chk_guard', which is normally defined in `libgcc2.c'.
  
   -- Target Hook: tree TARGET_STACK_PROTECT_FAIL (void)
!      This hook returns a `CALL_EXPR' that alerts the runtime that the
       stack protect guard variable has been modified.  This expression
!      should involve a call to a `noreturn' function.
  
       The default version of this hook invokes a function called
!      `__stack_chk_fail', taking no arguments.  This function is
!      normally defined in `libgcc2.c'.
  
   -- Common Target Hook: bool TARGET_SUPPORTS_SPLIT_STACK (bool REPORT,
            struct gcc_options *OPTS)
--- 31942,31964 ----
  ---------------------------------
  
   -- Target Hook: tree TARGET_STACK_PROTECT_GUARD (void)
!      This hook returns a 'DECL' node for the external variable to use
       for the stack protection guard.  This variable is initialized by
       the runtime to some random value and is used to initialize the
       guard value that is placed at the top of the local stack frame.
!      The type of this variable must be 'ptr_type_node'.
  
       The default version of this hook creates a variable called
!      '__stack_chk_guard', which is normally defined in 'libgcc2.c'.
  
   -- Target Hook: tree TARGET_STACK_PROTECT_FAIL (void)
!      This hook returns a 'CALL_EXPR' that alerts the runtime that the
       stack protect guard variable has been modified.  This expression
!      should involve a call to a 'noreturn' function.
  
       The default version of this hook invokes a function called
!      '__stack_chk_fail', taking no arguments.  This function is normally
!      defined in 'libgcc2.c'.
  
   -- Common Target Hook: bool TARGET_SUPPORTS_SPLIT_STACK (bool REPORT,
            struct gcc_options *OPTS)
*************** File: gccint.info,  Node: Miscellaneous
*** 32376,32385 ****
       Set to true if each call that binds to a local definition
       explicitly clobbers or sets all non-fixed registers modified by
       performing the call.  That is, by the call pattern itself, or by
!      code that might be inserted by the linker (e.g. stubs, veneers,
       branch islands), but not including those modifiable by the callee.
       The affected registers may be mentioned explicitly in the call
!      pattern, or included as clobbers in CALL_INSN_FUNCTION_USAGE.  The
       default version of this hook is set to false.  The purpose of this
       hook is to enable the fipa-ra optimization.
  
--- 31979,31988 ----
       Set to true if each call that binds to a local definition
       explicitly clobbers or sets all non-fixed registers modified by
       performing the call.  That is, by the call pattern itself, or by
!      code that might be inserted by the linker (e.g.  stubs, veneers,
       branch islands), but not including those modifiable by the callee.
       The affected registers may be mentioned explicitly in the call
!      pattern, or included as clobbers in CALL_INSN_FUNCTION_USAGE. The
       default version of this hook is set to false.  The purpose of this
       hook is to enable the fipa-ra optimization.
  
*************** File: gccint.info,  Node: Varargs,  Next
*** 32389,32552 ****
  17.10 Implementing the Varargs Macros
  =====================================
  
! GCC comes with an implementation of `<varargs.h>' and `<stdarg.h>' that
! work without change on machines that pass arguments on the stack.
! Other machines require their own implementations of varargs, and the
! two machine independent header files must have conditionals to include
! it.
  
!  ISO `<stdarg.h>' differs from traditional `<varargs.h>' mainly in the
! calling convention for `va_start'.  The traditional implementation
! takes just one argument, which is the variable in which to store the
! argument pointer.  The ISO implementation of `va_start' takes an
! additional second argument.  The user is supposed to write the last
! named argument of the function here.
  
!  However, `va_start' should not use this argument.  The way to find the
  end of the named arguments is with the built-in functions described
  below.
  
   -- Macro: __builtin_saveregs ()
!      Use this built-in function to save the argument registers in
!      memory so that the varargs mechanism can access them.  Both ISO
!      and traditional versions of `va_start' must use
!      `__builtin_saveregs', unless you use
!      `TARGET_SETUP_INCOMING_VARARGS' (see below) instead.
  
!      On some machines, `__builtin_saveregs' is open-coded under the
!      control of the target hook `TARGET_EXPAND_BUILTIN_SAVEREGS'.  On
       other machines, it calls a routine written in assembler language,
!      found in `libgcc2.c'.
  
!      Code generated for the call to `__builtin_saveregs' appears at the
       beginning of the function, as opposed to where the call to
!      `__builtin_saveregs' is written, regardless of what the code is.
       This is because the registers must be saved before the function
       starts to use them for its own purposes.
  
   -- Macro: __builtin_next_arg (LASTARG)
       This builtin returns the address of the first anonymous stack
!      argument, as type `void *'.  If `ARGS_GROW_DOWNWARD', it returns
       the address of the location above the first anonymous stack
!      argument.  Use it in `va_start' to initialize the pointer for
!      fetching arguments from the stack.  Also use it in `va_start' to
       verify that the second parameter LASTARG is the last named argument
       of the current function.
  
   -- Macro: __builtin_classify_type (OBJECT)
       Since each machine has its own conventions for which data types are
!      passed in which kind of register, your implementation of `va_arg'
       has to embody these conventions.  The easiest way to categorize the
!      specified data type is to use `__builtin_classify_type' together
!      with `sizeof' and `__alignof__'.
  
!      `__builtin_classify_type' ignores the value of OBJECT, considering
       only its data type.  It returns an integer describing what kind of
       type that is--integer, floating, pointer, structure, and so on.
  
!      The file `typeclass.h' defines an enumeration that you can use to
!      interpret the values of `__builtin_classify_type'.
  
   These machine description macros help implement varargs:
  
   -- Target Hook: rtx TARGET_EXPAND_BUILTIN_SAVEREGS (void)
!      If defined, this hook produces the machine-specific code for a
!      call to `__builtin_saveregs'.  This code will be moved to the very
       beginning of the function, before any parameter access are made.
       The return value of this function should be an RTX that contains
!      the value to use as the return of `__builtin_saveregs'.
  
   -- Target Hook: void TARGET_SETUP_INCOMING_VARARGS (cumulative_args_t
            ARGS_SO_FAR, machine_mode MODE, tree TYPE, int
            *PRETEND_ARGS_SIZE, int SECOND_TIME)
       This target hook offers an alternative to using
!      `__builtin_saveregs' and defining the hook
!      `TARGET_EXPAND_BUILTIN_SAVEREGS'.  Use it to store the anonymous
       register arguments into the stack so that all the arguments appear
!      to have been passed consecutively on the stack.  Once this is
!      done, you can use the standard implementation of varargs that
!      works for machines that pass all their arguments on the stack.
  
!      The argument ARGS_SO_FAR points to the `CUMULATIVE_ARGS' data
!      structure, containing the values that are obtained after
!      processing the named arguments.  The arguments MODE and TYPE
!      describe the last named argument--its machine mode and its data
!      type as a tree node.
  
       The target hook should do two things: first, push onto the stack
       all the argument registers _not_ used for the named arguments, and
       second, store the size of the data thus pushed into the
!      `int'-valued variable pointed to by PRETEND_ARGS_SIZE.  The value
       that you store here will serve as additional offset for setting up
       the stack frame.
  
       Because you must generate code to push the anonymous arguments at
       compile time without knowing their data types,
!      `TARGET_SETUP_INCOMING_VARARGS' is only useful on machines that
       have just a single category of argument register and use it
       uniformly for all data types.
  
!      If the argument SECOND_TIME is nonzero, it means that the
!      arguments of the function are being analyzed for the second time.
!      This happens for an inline function, which is not actually
!      compiled until the end of the source file.  The hook
!      `TARGET_SETUP_INCOMING_VARARGS' should not generate any
       instructions in this case.
  
   -- Target Hook: bool TARGET_STRICT_ARGUMENT_NAMING (cumulative_args_t
            CA)
!      Define this hook to return `true' if the location where a function
       argument is passed depends on whether or not it is a named
       argument.
  
!      This hook controls how the NAMED argument to `TARGET_FUNCTION_ARG'
       is set for varargs and stdarg functions.  If this hook returns
!      `true', the NAMED argument is always true for named arguments, and
!      false for unnamed arguments.  If it returns `false', but
!      `TARGET_PRETEND_OUTGOING_VARARGS_NAMED' returns `true', then all
       arguments are treated as named.  Otherwise, all named arguments
       except the last are treated as named.
  
!      You need not define this hook if it always returns `false'.
  
   -- Target Hook: void TARGET_CALL_ARGS (rtx, TREE)
       While generating RTL for a function call, this target hook is
       invoked once for each argument passed to the function, either a
!      register returned by `TARGET_FUNCTION_ARG' or a memory location.
       It is called just before the point where argument registers are
       stored.  The type of the function to be called is also passed as
!      the second argument; it is `NULL_TREE' for libcalls.  The
!      `TARGET_END_CALL_ARGS' hook is invoked just after the code to copy
!      the return reg has been emitted.  This functionality can be used
!      to perform special setup of call argument registers if a target
!      needs it.  For functions without arguments, the hook is called
!      once with `pc_rtx' passed instead of an argument register.  Most
!      ports do not need to implement anything for this hook.
  
   -- Target Hook: void TARGET_END_CALL_ARGS (void)
       This target hook is invoked while generating RTL for a function
       call, just after the point where the return reg is copied into a
!      pseudo.  It signals that all the call argument and return
!      registers for the just emitted call are now no longer in use.
!      Most ports do not need to implement anything for this hook.
  
   -- Target Hook: bool TARGET_PRETEND_OUTGOING_VARARGS_NAMED
            (cumulative_args_t CA)
       If you need to conditionally change ABIs so that one works with
!      `TARGET_SETUP_INCOMING_VARARGS', but the other works like neither
!      `TARGET_SETUP_INCOMING_VARARGS' nor
!      `TARGET_STRICT_ARGUMENT_NAMING' was defined, then define this hook
!      to return `true' if `TARGET_SETUP_INCOMING_VARARGS' is used,
!      `false' otherwise.  Otherwise, you should not define this hook.
  
   -- Target Hook: rtx TARGET_LOAD_BOUNDS_FOR_ARG (rtx SLOT, rtx ARG, rtx
            SLOT_NO)
!      This hook is used by expand pass to emit insn to load bounds of
!      ARG passed in SLOT.  Expand pass uses this hook in case bounds of
!      ARG are not passed in register.  If SLOT is a memory, then bounds
!      are loaded as for regular pointer loaded from memory.  If SLOT is
!      not a memory then SLOT_NO is an integer constant holding number of
!      the target dependent special slot which should be used to obtain
       bounds.  Hook returns RTX holding loaded bounds.
  
   -- Target Hook: void TARGET_STORE_BOUNDS_FOR_ARG (rtx ARG, rtx SLOT,
--- 31992,32152 ----
  17.10 Implementing the Varargs Macros
  =====================================
  
! GCC comes with an implementation of '<varargs.h>' and '<stdarg.h>' that
! work without change on machines that pass arguments on the stack.  Other
! machines require their own implementations of varargs, and the two
! machine independent header files must have conditionals to include it.
  
!  ISO '<stdarg.h>' differs from traditional '<varargs.h>' mainly in the
! calling convention for 'va_start'.  The traditional implementation takes
! just one argument, which is the variable in which to store the argument
! pointer.  The ISO implementation of 'va_start' takes an additional
! second argument.  The user is supposed to write the last named argument
! of the function here.
  
!  However, 'va_start' should not use this argument.  The way to find the
  end of the named arguments is with the built-in functions described
  below.
  
   -- Macro: __builtin_saveregs ()
!      Use this built-in function to save the argument registers in memory
!      so that the varargs mechanism can access them.  Both ISO and
!      traditional versions of 'va_start' must use '__builtin_saveregs',
!      unless you use 'TARGET_SETUP_INCOMING_VARARGS' (see below) instead.
  
!      On some machines, '__builtin_saveregs' is open-coded under the
!      control of the target hook 'TARGET_EXPAND_BUILTIN_SAVEREGS'.  On
       other machines, it calls a routine written in assembler language,
!      found in 'libgcc2.c'.
  
!      Code generated for the call to '__builtin_saveregs' appears at the
       beginning of the function, as opposed to where the call to
!      '__builtin_saveregs' is written, regardless of what the code is.
       This is because the registers must be saved before the function
       starts to use them for its own purposes.
  
   -- Macro: __builtin_next_arg (LASTARG)
       This builtin returns the address of the first anonymous stack
!      argument, as type 'void *'.  If 'ARGS_GROW_DOWNWARD', it returns
       the address of the location above the first anonymous stack
!      argument.  Use it in 'va_start' to initialize the pointer for
!      fetching arguments from the stack.  Also use it in 'va_start' to
       verify that the second parameter LASTARG is the last named argument
       of the current function.
  
   -- Macro: __builtin_classify_type (OBJECT)
       Since each machine has its own conventions for which data types are
!      passed in which kind of register, your implementation of 'va_arg'
       has to embody these conventions.  The easiest way to categorize the
!      specified data type is to use '__builtin_classify_type' together
!      with 'sizeof' and '__alignof__'.
  
!      '__builtin_classify_type' ignores the value of OBJECT, considering
       only its data type.  It returns an integer describing what kind of
       type that is--integer, floating, pointer, structure, and so on.
  
!      The file 'typeclass.h' defines an enumeration that you can use to
!      interpret the values of '__builtin_classify_type'.
  
   These machine description macros help implement varargs:
  
   -- Target Hook: rtx TARGET_EXPAND_BUILTIN_SAVEREGS (void)
!      If defined, this hook produces the machine-specific code for a call
!      to '__builtin_saveregs'.  This code will be moved to the very
       beginning of the function, before any parameter access are made.
       The return value of this function should be an RTX that contains
!      the value to use as the return of '__builtin_saveregs'.
  
   -- Target Hook: void TARGET_SETUP_INCOMING_VARARGS (cumulative_args_t
            ARGS_SO_FAR, machine_mode MODE, tree TYPE, int
            *PRETEND_ARGS_SIZE, int SECOND_TIME)
       This target hook offers an alternative to using
!      '__builtin_saveregs' and defining the hook
!      'TARGET_EXPAND_BUILTIN_SAVEREGS'.  Use it to store the anonymous
       register arguments into the stack so that all the arguments appear
!      to have been passed consecutively on the stack.  Once this is done,
!      you can use the standard implementation of varargs that works for
!      machines that pass all their arguments on the stack.
  
!      The argument ARGS_SO_FAR points to the 'CUMULATIVE_ARGS' data
!      structure, containing the values that are obtained after processing
!      the named arguments.  The arguments MODE and TYPE describe the last
!      named argument--its machine mode and its data type as a tree node.
  
       The target hook should do two things: first, push onto the stack
       all the argument registers _not_ used for the named arguments, and
       second, store the size of the data thus pushed into the
!      'int'-valued variable pointed to by PRETEND_ARGS_SIZE.  The value
       that you store here will serve as additional offset for setting up
       the stack frame.
  
       Because you must generate code to push the anonymous arguments at
       compile time without knowing their data types,
!      'TARGET_SETUP_INCOMING_VARARGS' is only useful on machines that
       have just a single category of argument register and use it
       uniformly for all data types.
  
!      If the argument SECOND_TIME is nonzero, it means that the arguments
!      of the function are being analyzed for the second time.  This
!      happens for an inline function, which is not actually compiled
!      until the end of the source file.  The hook
!      'TARGET_SETUP_INCOMING_VARARGS' should not generate any
       instructions in this case.
  
   -- Target Hook: bool TARGET_STRICT_ARGUMENT_NAMING (cumulative_args_t
            CA)
!      Define this hook to return 'true' if the location where a function
       argument is passed depends on whether or not it is a named
       argument.
  
!      This hook controls how the NAMED argument to 'TARGET_FUNCTION_ARG'
       is set for varargs and stdarg functions.  If this hook returns
!      'true', the NAMED argument is always true for named arguments, and
!      false for unnamed arguments.  If it returns 'false', but
!      'TARGET_PRETEND_OUTGOING_VARARGS_NAMED' returns 'true', then all
       arguments are treated as named.  Otherwise, all named arguments
       except the last are treated as named.
  
!      You need not define this hook if it always returns 'false'.
  
   -- Target Hook: void TARGET_CALL_ARGS (rtx, TREE)
       While generating RTL for a function call, this target hook is
       invoked once for each argument passed to the function, either a
!      register returned by 'TARGET_FUNCTION_ARG' or a memory location.
       It is called just before the point where argument registers are
       stored.  The type of the function to be called is also passed as
!      the second argument; it is 'NULL_TREE' for libcalls.  The
!      'TARGET_END_CALL_ARGS' hook is invoked just after the code to copy
!      the return reg has been emitted.  This functionality can be used to
!      perform special setup of call argument registers if a target needs
!      it.  For functions without arguments, the hook is called once with
!      'pc_rtx' passed instead of an argument register.  Most ports do not
!      need to implement anything for this hook.
  
   -- Target Hook: void TARGET_END_CALL_ARGS (void)
       This target hook is invoked while generating RTL for a function
       call, just after the point where the return reg is copied into a
!      pseudo.  It signals that all the call argument and return registers
!      for the just emitted call are now no longer in use.  Most ports do
!      not need to implement anything for this hook.
  
   -- Target Hook: bool TARGET_PRETEND_OUTGOING_VARARGS_NAMED
            (cumulative_args_t CA)
       If you need to conditionally change ABIs so that one works with
!      'TARGET_SETUP_INCOMING_VARARGS', but the other works like neither
!      'TARGET_SETUP_INCOMING_VARARGS' nor 'TARGET_STRICT_ARGUMENT_NAMING'
!      was defined, then define this hook to return 'true' if
!      'TARGET_SETUP_INCOMING_VARARGS' is used, 'false' otherwise.
!      Otherwise, you should not define this hook.
  
   -- Target Hook: rtx TARGET_LOAD_BOUNDS_FOR_ARG (rtx SLOT, rtx ARG, rtx
            SLOT_NO)
!      This hook is used by expand pass to emit insn to load bounds of ARG
!      passed in SLOT.  Expand pass uses this hook in case bounds of ARG
!      are not passed in register.  If SLOT is a memory, then bounds are
!      loaded as for regular pointer loaded from memory.  If SLOT is not a
!      memory then SLOT_NO is an integer constant holding number of the
!      target dependent special slot which should be used to obtain
       bounds.  Hook returns RTX holding loaded bounds.
  
   -- Target Hook: void TARGET_STORE_BOUNDS_FOR_ARG (rtx ARG, rtx SLOT,
*************** below.
*** 32554,32568 ****
       This hook is used by expand pass to emit insns to store BOUNDS of
       ARG passed in SLOT.  Expand pass uses this hook in case BOUNDS of
       ARG are not passed in register.  If SLOT is a memory, then BOUNDS
!      are stored as for regular pointer stored in memory.  If SLOT is
!      not a memory then SLOT_NO is an integer constant holding number of
!      the target dependent special slot which should be used to store
!      BOUNDS.
  
   -- Target Hook: rtx TARGET_LOAD_RETURNED_BOUNDS (rtx SLOT)
       This hook is used by expand pass to emit insn to load bounds
!      returned by function call in SLOT.  Hook returns RTX holding
!      loaded bounds.
  
   -- Target Hook: void TARGET_STORE_RETURNED_BOUNDS (rtx SLOT, rtx
            BOUNDS)
--- 32154,32167 ----
       This hook is used by expand pass to emit insns to store BOUNDS of
       ARG passed in SLOT.  Expand pass uses this hook in case BOUNDS of
       ARG are not passed in register.  If SLOT is a memory, then BOUNDS
!      are stored as for regular pointer stored in memory.  If SLOT is not
!      a memory then SLOT_NO is an integer constant holding number of the
!      target dependent special slot which should be used to store BOUNDS.
  
   -- Target Hook: rtx TARGET_LOAD_RETURNED_BOUNDS (rtx SLOT)
       This hook is used by expand pass to emit insn to load bounds
!      returned by function call in SLOT.  Hook returns RTX holding loaded
!      bounds.
  
   -- Target Hook: void TARGET_STORE_RETURNED_BOUNDS (rtx SLOT, rtx
            BOUNDS)
*************** below.
*** 32573,32586 ****
            RET_TYPE, const_tree FN_DECL_OR_TYPE, bool OUTGOING)
       Define this to return an RTX representing the place where a
       function returns bounds for returned pointers.  Arguments meaning
!      is similar to `TARGET_FUNCTION_VALUE'.
  
   -- Target Hook: void TARGET_SETUP_INCOMING_VARARG_BOUNDS
            (cumulative_args_t ARGS_SO_FAR, enum machine_mode MODE, tree
            TYPE, int *PRETEND_ARGS_SIZE, int SECOND_TIME)
!      Use it to store bounds for anonymous register arguments stored
!      into the stack.  Arguments meaning is similar to
!      `TARGET_SETUP_INCOMING_VARARGS'.
  
  
  File: gccint.info,  Node: Trampolines,  Next: Library Calls,  Prev: Varargs,  Up: Target Macros
--- 32172,32185 ----
            RET_TYPE, const_tree FN_DECL_OR_TYPE, bool OUTGOING)
       Define this to return an RTX representing the place where a
       function returns bounds for returned pointers.  Arguments meaning
!      is similar to 'TARGET_FUNCTION_VALUE'.
  
   -- Target Hook: void TARGET_SETUP_INCOMING_VARARG_BOUNDS
            (cumulative_args_t ARGS_SO_FAR, enum machine_mode MODE, tree
            TYPE, int *PRETEND_ARGS_SIZE, int SECOND_TIME)
!      Use it to store bounds for anonymous register arguments stored into
!      the stack.  Arguments meaning is similar to
!      'TARGET_SETUP_INCOMING_VARARGS'.
  
  
  File: gccint.info,  Node: Trampolines,  Next: Library Calls,  Prev: Varargs,  Up: Target Macros
*************** File: gccint.info,  Node: Trampolines,
*** 32588,32597 ****
  17.11 Trampolines for Nested Functions
  ======================================
  
! A "trampoline" is a small piece of code that is created at run time
! when the address of a nested function is taken.  It normally resides on
! the stack, in the stack frame of the containing function.  These macros
! tell GCC how to generate code to allocate and initialize a trampoline.
  
   The instructions in the trampoline must do two things: load a constant
  address into the static chain register, and jump to the real address of
--- 32187,32196 ----
  17.11 Trampolines for Nested Functions
  ======================================
  
! A "trampoline" is a small piece of code that is created at run time when
! the address of a nested function is taken.  It normally resides on the
! stack, in the stack frame of the containing function.  These macros tell
! GCC how to generate code to allocate and initialize a trampoline.
  
   The instructions in the trampoline must do two things: load a constant
  address into the static chain register, and jump to the real address of
*************** may be necessary to take out pieces of t
*** 32611,32619 ****
  separately.
  
   -- Target Hook: void TARGET_ASM_TRAMPOLINE_TEMPLATE (FILE *F)
!      This hook is called by `assemble_trampoline_template' to output,
!      on the stream F, assembler code for a block of data that contains
!      the constant parts of a trampoline.  This code should not include a
       label--the label is taken care of automatically.
  
       If you do not define this hook, it means no template is needed for
--- 32210,32218 ----
  separately.
  
   -- Target Hook: void TARGET_ASM_TRAMPOLINE_TEMPLATE (FILE *F)
!      This hook is called by 'assemble_trampoline_template' to output, on
!      the stream F, assembler code for a block of data that contains the
!      constant parts of a trampoline.  This code should not include a
       label--the label is taken care of automatically.
  
       If you do not define this hook, it means no template is needed for
*************** separately.
*** 32624,32630 ****
   -- Macro: TRAMPOLINE_SECTION
       Return the section into which the trampoline template is to be
       placed (*note Sections::).  The default value is
!      `readonly_data_section'.
  
   -- Macro: TRAMPOLINE_SIZE
       A C expression for the size in bytes of the trampoline, as an
--- 32223,32229 ----
   -- Macro: TRAMPOLINE_SECTION
       Return the section into which the trampoline template is to be
       placed (*note Sections::).  The default value is
!      'readonly_data_section'.
  
   -- Macro: TRAMPOLINE_SIZE
       A C expression for the size in bytes of the trampoline, as an
*************** separately.
*** 32633,32655 ****
   -- Macro: TRAMPOLINE_ALIGNMENT
       Alignment required for trampolines, in bits.
  
!      If you don't define this macro, the value of `FUNCTION_ALIGNMENT'
       is used for aligning trampolines.
  
   -- Target Hook: void TARGET_TRAMPOLINE_INIT (rtx M_TRAMP, tree FNDECL,
            rtx STATIC_CHAIN)
       This hook is called to initialize a trampoline.  M_TRAMP is an RTX
       for the memory block for the trampoline; FNDECL is the
!      `FUNCTION_DECL' for the nested function; STATIC_CHAIN is an RTX
!      for the static chain value that should be passed to the function
!      when it is called.
  
!      If the target defines `TARGET_ASM_TRAMPOLINE_TEMPLATE', then the
       first thing this hook should do is emit a block move into M_TRAMP
!      from the memory block returned by `assemble_trampoline_template'.
       Note that the block move need only cover the constant parts of the
       trampoline.  If the target isolates the variable parts of the
!      trampoline to the end, not all `TRAMPOLINE_SIZE' bytes need be
       copied.
  
       If the target requires any other actions, such as flushing caches
--- 32232,32254 ----
   -- Macro: TRAMPOLINE_ALIGNMENT
       Alignment required for trampolines, in bits.
  
!      If you don't define this macro, the value of 'FUNCTION_ALIGNMENT'
       is used for aligning trampolines.
  
   -- Target Hook: void TARGET_TRAMPOLINE_INIT (rtx M_TRAMP, tree FNDECL,
            rtx STATIC_CHAIN)
       This hook is called to initialize a trampoline.  M_TRAMP is an RTX
       for the memory block for the trampoline; FNDECL is the
!      'FUNCTION_DECL' for the nested function; STATIC_CHAIN is an RTX for
!      the static chain value that should be passed to the function when
!      it is called.
  
!      If the target defines 'TARGET_ASM_TRAMPOLINE_TEMPLATE', then the
       first thing this hook should do is emit a block move into M_TRAMP
!      from the memory block returned by 'assemble_trampoline_template'.
       Note that the block move need only cover the constant parts of the
       trampoline.  If the target isolates the variable parts of the
!      trampoline to the end, not all 'TRAMPOLINE_SIZE' bytes need be
       copied.
  
       If the target requires any other actions, such as flushing caches
*************** separately.
*** 32659,32675 ****
   -- Target Hook: rtx TARGET_TRAMPOLINE_ADJUST_ADDRESS (rtx ADDR)
       This hook should perform any machine-specific adjustment in the
       address of the trampoline.  Its argument contains the address of
!      the memory block that was passed to `TARGET_TRAMPOLINE_INIT'.  In
!      case the address to be used for a function call should be
!      different from the address at which the template was stored, the
!      different address should be returned; otherwise ADDR should be
!      returned unchanged.  If this hook is not defined, ADDR will be
!      used for function calls.
  
   Implementing trampolines is difficult on many machines because they
  have separate instruction and data caches.  Writing into a stack
! location fails to clear the memory in the instruction cache, so when
! the program jumps to that location, it executes the old contents.
  
   Here are two possible solutions.  One is to clear the relevant parts of
  the instruction cache whenever a trampoline is set up.  The other is to
--- 32258,32274 ----
   -- Target Hook: rtx TARGET_TRAMPOLINE_ADJUST_ADDRESS (rtx ADDR)
       This hook should perform any machine-specific adjustment in the
       address of the trampoline.  Its argument contains the address of
!      the memory block that was passed to 'TARGET_TRAMPOLINE_INIT'.  In
!      case the address to be used for a function call should be different
!      from the address at which the template was stored, the different
!      address should be returned; otherwise ADDR should be returned
!      unchanged.  If this hook is not defined, ADDR will be used for
!      function calls.
  
   Implementing trampolines is difficult on many machines because they
  have separate instruction and data caches.  Writing into a stack
! location fails to clear the memory in the instruction cache, so when the
! program jumps to that location, it executes the old contents.
  
   Here are two possible solutions.  One is to clear the relevant parts of
  the instruction cache whenever a trampoline is set up.  The other is to
*************** the following macro.
*** 32683,32709 ****
   -- Macro: CLEAR_INSN_CACHE (BEG, END)
       If defined, expands to a C expression clearing the _instruction
       cache_ in the specified interval.  The definition of this macro
!      would typically be a series of `asm' statements.  Both BEG and END
       are both pointer expressions.
  
   To use a standard subroutine, define the following macro.  In addition,
  you must make sure that the instructions in a trampoline fill an entire
  cache line with identical instructions, or else ensure that the
  beginning of the trampoline code is always aligned at the same point in
! its cache line.  Look in `m68k.h' as a guide.
  
   -- Macro: TRANSFER_FROM_TRAMPOLINE
       Define this macro if trampolines need a special subroutine to do
!      their work.  The macro should expand to a series of `asm'
       statements which will be compiled with GCC.  They go in a library
!      function named `__transfer_from_trampoline'.
  
       If you need to avoid executing the ordinary prologue code of a
       compiled C function when you jump to the subroutine, you can do so
       by placing a special label of your own in the assembler code.  Use
!      one `asm' statement to generate an assembler label, and another to
!      make the label global.  Then trampolines can use that label to
!      jump directly to your special assembler code.
  
  
  File: gccint.info,  Node: Library Calls,  Next: Addressing Modes,  Prev: Trampolines,  Up: Target Macros
--- 32282,32308 ----
   -- Macro: CLEAR_INSN_CACHE (BEG, END)
       If defined, expands to a C expression clearing the _instruction
       cache_ in the specified interval.  The definition of this macro
!      would typically be a series of 'asm' statements.  Both BEG and END
       are both pointer expressions.
  
   To use a standard subroutine, define the following macro.  In addition,
  you must make sure that the instructions in a trampoline fill an entire
  cache line with identical instructions, or else ensure that the
  beginning of the trampoline code is always aligned at the same point in
! its cache line.  Look in 'm68k.h' as a guide.
  
   -- Macro: TRANSFER_FROM_TRAMPOLINE
       Define this macro if trampolines need a special subroutine to do
!      their work.  The macro should expand to a series of 'asm'
       statements which will be compiled with GCC.  They go in a library
!      function named '__transfer_from_trampoline'.
  
       If you need to avoid executing the ordinary prologue code of a
       compiled C function when you jump to the subroutine, you can do so
       by placing a special label of your own in the assembler code.  Use
!      one 'asm' statement to generate an assembler label, and another to
!      make the label global.  Then trampolines can use that label to jump
!      directly to your special assembler code.
  
  
  File: gccint.info,  Node: Library Calls,  Next: Addressing Modes,  Prev: Trampolines,  Up: Target Macros
*************** Here is an explanation of implicit calls
*** 32715,32744 ****
  
   -- Macro: DECLARE_LIBRARY_RENAMES
       This macro, if defined, should expand to a piece of C code that
!      will get expanded when compiling functions for libgcc.a.  It can
!      be used to provide alternate names for GCC's internal library
       functions if there are ABI-mandated names that the compiler should
       provide.
  
   -- Target Hook: void TARGET_INIT_LIBFUNCS (void)
       This hook should declare additional library routines or rename
!      existing ones, using the functions `set_optab_libfunc' and
!      `init_one_libfunc' defined in `optabs.c'.  `init_optabs' calls
!      this macro after initializing all the normal library routines.
  
!      The default is to do nothing.  Most ports don't need to define
!      this hook.
  
   -- Target Hook: bool TARGET_LIBFUNC_GNU_PREFIX
       If false (the default), internal library routines start with two
!      underscores.  If set to true, these routines start with `__gnu_'
!      instead.  E.g., `__muldi3' changes to `__gnu_muldi3'.  This
!      currently only affects functions defined in `libgcc2.c'.  If this
!      is set to true, the `tm.h' file must also `#define
       LIBGCC2_GNU_PREFIX'.
  
   -- Macro: FLOAT_LIB_COMPARE_RETURNS_BOOL (MODE, COMPARISON)
!      This macro should return `true' if the library routine that
       implements the floating point comparison operator COMPARISON in
       mode MODE will return a boolean, and FALSE if it will return a
       tristate.
--- 32314,32343 ----
  
   -- Macro: DECLARE_LIBRARY_RENAMES
       This macro, if defined, should expand to a piece of C code that
!      will get expanded when compiling functions for libgcc.a.  It can be
!      used to provide alternate names for GCC's internal library
       functions if there are ABI-mandated names that the compiler should
       provide.
  
   -- Target Hook: void TARGET_INIT_LIBFUNCS (void)
       This hook should declare additional library routines or rename
!      existing ones, using the functions 'set_optab_libfunc' and
!      'init_one_libfunc' defined in 'optabs.c'.  'init_optabs' calls this
!      macro after initializing all the normal library routines.
  
!      The default is to do nothing.  Most ports don't need to define this
!      hook.
  
   -- Target Hook: bool TARGET_LIBFUNC_GNU_PREFIX
       If false (the default), internal library routines start with two
!      underscores.  If set to true, these routines start with '__gnu_'
!      instead.  E.g., '__muldi3' changes to '__gnu_muldi3'.  This
!      currently only affects functions defined in 'libgcc2.c'.  If this
!      is set to true, the 'tm.h' file must also '#define
       LIBGCC2_GNU_PREFIX'.
  
   -- Macro: FLOAT_LIB_COMPARE_RETURNS_BOOL (MODE, COMPARISON)
!      This macro should return 'true' if the library routine that
       implements the floating point comparison operator COMPARISON in
       mode MODE will return a boolean, and FALSE if it will return a
       tristate.
*************** Here is an explanation of implicit calls
*** 32748,32760 ****
       ports don't need to define this macro.
  
   -- Macro: TARGET_LIB_INT_CMP_BIASED
!      This macro should evaluate to `true' if the integer comparison
!      functions (like `__cmpdi2') return 0 to indicate that the first
       operand is smaller than the second, 1 to indicate that they are
!      equal, and 2 to indicate that the first operand is greater than
!      the second.  If this macro evaluates to `false' the comparison
       functions return -1, 0, and 1 instead of 0, 1, and 2.  If the
!      target uses the routines in `libgcc.a', you do not need to define
       this macro.
  
   -- Macro: TARGET_HAS_NO_HW_DIVIDE
--- 32347,32359 ----
       ports don't need to define this macro.
  
   -- Macro: TARGET_LIB_INT_CMP_BIASED
!      This macro should evaluate to 'true' if the integer comparison
!      functions (like '__cmpdi2') return 0 to indicate that the first
       operand is smaller than the second, 1 to indicate that they are
!      equal, and 2 to indicate that the first operand is greater than the
!      second.  If this macro evaluates to 'false' the comparison
       functions return -1, 0, and 1 instead of 0, 1, and 2.  If the
!      target uses the routines in 'libgcc.a', you do not need to define
       this macro.
  
   -- Macro: TARGET_HAS_NO_HW_DIVIDE
*************** Here is an explanation of implicit calls
*** 32765,32785 ****
       algorithm which make use of a 64-bit by 32-bit divide primitive.
  
   -- Macro: TARGET_EDOM
!      The value of `EDOM' on the target machine, as a C integer constant
       expression.  If you don't define this macro, GCC does not attempt
!      to deposit the value of `EDOM' into `errno' directly.  Look in
!      `/usr/include/errno.h' to find the value of `EDOM' on your system.
  
!      If you do not define `TARGET_EDOM', then compiled code reports
!      domain errors by calling the library function and letting it
!      report the error.  If mathematical functions on your system use
!      `matherr' when there is an error, then you should leave
!      `TARGET_EDOM' undefined so that `matherr' is used normally.
  
   -- Macro: GEN_ERRNO_RTX
       Define this macro as a C expression to create an rtl expression
!      that refers to the global "variable" `errno'.  (On certain systems,
!      `errno' may not actually be a variable.)  If you don't define this
       macro, a reasonable default is used.
  
   -- Target Hook: bool TARGET_LIBC_HAS_FUNCTION (enum function_class
--- 32364,32384 ----
       algorithm which make use of a 64-bit by 32-bit divide primitive.
  
   -- Macro: TARGET_EDOM
!      The value of 'EDOM' on the target machine, as a C integer constant
       expression.  If you don't define this macro, GCC does not attempt
!      to deposit the value of 'EDOM' into 'errno' directly.  Look in
!      '/usr/include/errno.h' to find the value of 'EDOM' on your system.
  
!      If you do not define 'TARGET_EDOM', then compiled code reports
!      domain errors by calling the library function and letting it report
!      the error.  If mathematical functions on your system use 'matherr'
!      when there is an error, then you should leave 'TARGET_EDOM'
!      undefined so that 'matherr' is used normally.
  
   -- Macro: GEN_ERRNO_RTX
       Define this macro as a C expression to create an rtl expression
!      that refers to the global "variable" 'errno'.  (On certain systems,
!      'errno' may not actually be a variable.)  If you don't define this
       macro, a reasonable default is used.
  
   -- Target Hook: bool TARGET_LIBC_HAS_FUNCTION (enum function_class
*************** Here is an explanation of implicit calls
*** 32791,32799 ****
       Set this macro to 1 to use the "NeXT" Objective-C message sending
       conventions by default.  This calling convention involves passing
       the object, the selector and the method arguments all at once to
!      the method-lookup library function.  This is the usual setting
!      when targeting Darwin/Mac OS X systems, which have the NeXT
!      runtime installed.
  
       If the macro is set to 0, the "GNU" Objective-C message sending
       convention will be used by default.  This convention passes just
--- 32390,32398 ----
       Set this macro to 1 to use the "NeXT" Objective-C message sending
       conventions by default.  This calling convention involves passing
       the object, the selector and the method arguments all at once to
!      the method-lookup library function.  This is the usual setting when
!      targeting Darwin/Mac OS X systems, which have the NeXT runtime
!      installed.
  
       If the macro is set to 0, the "GNU" Objective-C message sending
       convention will be used by default.  This convention passes just
*************** This is about addressing modes.
*** 32834,32855 ****
   -- Macro: CONSTANT_ADDRESS_P (X)
       A C expression that is 1 if the RTX X is a constant which is a
       valid address.  On most machines the default definition of
!      `(CONSTANT_P (X) && GET_CODE (X) != CONST_DOUBLE)' is acceptable,
       but a few machines are more restrictive as to which constant
       addresses are supported.
  
   -- Macro: CONSTANT_P (X)
!      `CONSTANT_P', which is defined by target-independent code, accepts
       integer-values expressions whose values are not explicitly known,
!      such as `symbol_ref', `label_ref', and `high' expressions and
!      `const' arithmetic expressions, in addition to `const_int' and
!      `const_double' expressions.
  
   -- Macro: MAX_REGS_PER_ADDRESS
       A number, the maximum number of registers that can appear in a
!      valid memory address.  Note that it is up to you to specify a
!      value equal to the maximum number that
!      `TARGET_LEGITIMATE_ADDRESS_P' would ever accept.
  
   -- Target Hook: bool TARGET_LEGITIMATE_ADDRESS_P (machine_mode MODE,
            rtx X, bool STRICT)
--- 32433,32454 ----
   -- Macro: CONSTANT_ADDRESS_P (X)
       A C expression that is 1 if the RTX X is a constant which is a
       valid address.  On most machines the default definition of
!      '(CONSTANT_P (X) && GET_CODE (X) != CONST_DOUBLE)' is acceptable,
       but a few machines are more restrictive as to which constant
       addresses are supported.
  
   -- Macro: CONSTANT_P (X)
!      'CONSTANT_P', which is defined by target-independent code, accepts
       integer-values expressions whose values are not explicitly known,
!      such as 'symbol_ref', 'label_ref', and 'high' expressions and
!      'const' arithmetic expressions, in addition to 'const_int' and
!      'const_double' expressions.
  
   -- Macro: MAX_REGS_PER_ADDRESS
       A number, the maximum number of registers that can appear in a
!      valid memory address.  Note that it is up to you to specify a value
!      equal to the maximum number that 'TARGET_LEGITIMATE_ADDRESS_P'
!      would ever accept.
  
   -- Target Hook: bool TARGET_LEGITIMATE_ADDRESS_P (machine_mode MODE,
            rtx X, bool STRICT)
*************** This is about addressing modes.
*** 32863,32910 ****
       The strict variant is used in the reload pass.  It must be defined
       so that any pseudo-register that has not been allocated a hard
       register is considered a memory reference.  This is because in
!      contexts where some kind of register is required, a
!      pseudo-register with no hard register must be rejected.  For
!      non-hard registers, the strict variant should look up the
!      `reg_renumber' array; it should then proceed using the hard
!      register number in the array, or treat the pseudo as a memory
!      reference if the array holds `-1'.
  
!      The non-strict variant is used in other passes.  It must be
!      defined to accept all pseudo-registers in every context where some
!      kind of register is required.
  
!      Normally, constant addresses which are the sum of a `symbol_ref'
!      and an integer are stored inside a `const' RTX to mark them as
       constant.  Therefore, there is no need to recognize such sums
       specifically as legitimate addresses.  Normally you would simply
!      recognize any `const' as legitimate.
  
!      Usually `PRINT_OPERAND_ADDRESS' is not prepared to handle constant
!      sums that are not marked with  `const'.  It assumes that a naked
!      `plus' indicates indexing.  If so, then you _must_ reject such
!      naked constant sums as illegitimate addresses, so that none of
!      them will be given to `PRINT_OPERAND_ADDRESS'.
  
       On some machines, whether a symbolic address is legitimate depends
       on the section that the address refers to.  On these machines,
!      define the target hook `TARGET_ENCODE_SECTION_INFO' to store the
!      information into the `symbol_ref', and then check for it here.
!      When you see a `const', you will have to look inside it to find the
!      `symbol_ref' in order to determine the section.  *Note Assembler
       Format::.
  
       Some ports are still using a deprecated legacy substitute for this
!      hook, the `GO_IF_LEGITIMATE_ADDRESS' macro.  This macro has this
       syntax:
  
            #define GO_IF_LEGITIMATE_ADDRESS (MODE, X, LABEL)
  
!      and should `goto LABEL' if the address X is a valid address on the
       target machine for a memory operand of mode MODE.
  
       Compiler source files that want to use the strict variant of this
!      macro define the macro `REG_OK_STRICT'.  You should use an `#ifdef
       REG_OK_STRICT' conditional to define the strict variant in that
       case and the non-strict variant otherwise.
  
--- 32462,32508 ----
       The strict variant is used in the reload pass.  It must be defined
       so that any pseudo-register that has not been allocated a hard
       register is considered a memory reference.  This is because in
!      contexts where some kind of register is required, a pseudo-register
!      with no hard register must be rejected.  For non-hard registers,
!      the strict variant should look up the 'reg_renumber' array; it
!      should then proceed using the hard register number in the array, or
!      treat the pseudo as a memory reference if the array holds '-1'.
  
!      The non-strict variant is used in other passes.  It must be defined
!      to accept all pseudo-registers in every context where some kind of
!      register is required.
  
!      Normally, constant addresses which are the sum of a 'symbol_ref'
!      and an integer are stored inside a 'const' RTX to mark them as
       constant.  Therefore, there is no need to recognize such sums
       specifically as legitimate addresses.  Normally you would simply
!      recognize any 'const' as legitimate.
  
!      Usually 'PRINT_OPERAND_ADDRESS' is not prepared to handle constant
!      sums that are not marked with 'const'.  It assumes that a naked
!      'plus' indicates indexing.  If so, then you _must_ reject such
!      naked constant sums as illegitimate addresses, so that none of them
!      will be given to 'PRINT_OPERAND_ADDRESS'.
  
       On some machines, whether a symbolic address is legitimate depends
       on the section that the address refers to.  On these machines,
!      define the target hook 'TARGET_ENCODE_SECTION_INFO' to store the
!      information into the 'symbol_ref', and then check for it here.
!      When you see a 'const', you will have to look inside it to find the
!      'symbol_ref' in order to determine the section.  *Note Assembler
       Format::.
  
       Some ports are still using a deprecated legacy substitute for this
!      hook, the 'GO_IF_LEGITIMATE_ADDRESS' macro.  This macro has this
       syntax:
  
            #define GO_IF_LEGITIMATE_ADDRESS (MODE, X, LABEL)
  
!      and should 'goto LABEL' if the address X is a valid address on the
       target machine for a memory operand of mode MODE.
  
       Compiler source files that want to use the strict variant of this
!      macro define the macro 'REG_OK_STRICT'.  You should use an '#ifdef
       REG_OK_STRICT' conditional to define the strict variant in that
       case and the non-strict variant otherwise.
  
*************** This is about addressing modes.
*** 32912,32931 ****
       files that are recompiled when changes are made.
  
   -- Macro: TARGET_MEM_CONSTRAINT
!      A single character to be used instead of the default `'m''
       character for general memory addresses.  This defines the
       constraint letter which matches the memory addresses accepted by
!      `TARGET_LEGITIMATE_ADDRESS_P'.  Define this macro if you want to
       support new address formats in your back end without changing the
!      semantics of the `'m'' constraint.  This is necessary in order to
       preserve functionality of inline assembly constructs using the
!      `'m'' constraint.
  
   -- Macro: FIND_BASE_TERM (X)
       A C expression to determine the base term of address X, or to
!      provide a simplified version of X from which `alias.c' can easily
       find the base term.  This macro is used in only two places:
!      `find_base_value' and `find_base_term' in `alias.c'.
  
       It is always safe for this macro to not be defined.  It exists so
       that alias analysis can understand machine-dependent addresses.
--- 32510,32529 ----
       files that are recompiled when changes are made.
  
   -- Macro: TARGET_MEM_CONSTRAINT
!      A single character to be used instead of the default ''m''
       character for general memory addresses.  This defines the
       constraint letter which matches the memory addresses accepted by
!      'TARGET_LEGITIMATE_ADDRESS_P'.  Define this macro if you want to
       support new address formats in your back end without changing the
!      semantics of the ''m'' constraint.  This is necessary in order to
       preserve functionality of inline assembly constructs using the
!      ''m'' constraint.
  
   -- Macro: FIND_BASE_TERM (X)
       A C expression to determine the base term of address X, or to
!      provide a simplified version of X from which 'alias.c' can easily
       find the base term.  This macro is used in only two places:
!      'find_base_value' and 'find_base_term' in 'alias.c'.
  
       It is always safe for this macro to not be defined.  It exists so
       that alias analysis can understand machine-dependent addresses.
*************** This is about addressing modes.
*** 32938,33011 ****
       This hook is given an invalid memory address X for an operand of
       mode MODE and should try to return a valid memory address.
  
!      X will always be the result of a call to `break_out_memory_refs',
       and OLDX will be the operand that was given to that function to
       produce X.
  
!      The code of the hook should not alter the substructure of X.  If
!      it transforms X into a more legitimate form, it should return the
!      new X.
  
       It is not necessary for this hook to come up with a legitimate
!      address, with the exception of native TLS addresses (*note
!      Emulated TLS::).  The compiler has standard ways of doing so in
!      all cases.  In fact, if the target supports only emulated TLS, it
!      is safe to omit this hook or make it return X if it cannot find a
!      valid way to legitimize the address.  But often a machine-dependent
!      strategy can generate better code.
  
   -- Macro: LEGITIMIZE_RELOAD_ADDRESS (X, MODE, OPNUM, TYPE, IND_LEVELS,
            WIN)
       A C compound statement that attempts to replace X, which is an
       address that needs reloading, with a valid memory address for an
!      operand of mode MODE.  WIN will be a C statement label elsewhere
!      in the code.  It is not necessary to define this macro, but it
!      might be useful for performance reasons.
  
       For example, on the i386, it is sometimes possible to use a single
       reload register instead of two by reloading a sum of two pseudo
       registers into a register.  On the other hand, for number of RISC
       processors offsets are limited so that often an intermediate
!      address needs to be generated in order to address a stack slot.
!      By defining `LEGITIMIZE_RELOAD_ADDRESS' appropriately, the
       intermediate addresses generated for adjacent some stack slots can
       be made identical, and thus be shared.
  
!      _Note_: This macro should be used with caution.  It is necessary
!      to know something of how reload works in order to effectively use
!      this, and it is quite easy to produce macros that build in too
!      much knowledge of reload internals.
  
       _Note_: This macro must be able to reload an address created by a
       previous invocation of this macro.  If it fails to handle such
       addresses then the compiler may generate incorrect code or abort.
  
!      The macro definition should use `push_reload' to indicate parts
       that need reloading; OPNUM, TYPE and IND_LEVELS are usually
!      suitable to be passed unaltered to `push_reload'.
  
       The code generated by this macro must not alter the substructure of
       X.  If it transforms X into a more legitimate form, it should
       assign X (which will always be a C variable) a new value.  This
       also applies to parts that you change indirectly by calling
!      `push_reload'.
  
!      The macro definition may use `strict_memory_address_p' to test if
       the address has become legitimate.
  
       If you want to change only a part of X, one standard way of doing
!      this is to use `copy_rtx'.  Note, however, that it unshares only a
       single level of rtl.  Thus, if the part to be changed is not at the
       top level, you'll need to replace first the top level.  It is not
!      necessary for this macro to come up with a legitimate address;
!      but often a machine-dependent strategy can generate better code.
  
   -- Target Hook: bool TARGET_MODE_DEPENDENT_ADDRESS_P (const_rtx ADDR,
            addr_space_t ADDRSPACE)
!      This hook returns `true' if memory address ADDR in address space
!      ADDRSPACE can have different meanings depending on the machine
!      mode of the memory reference it is used for or if the address is
!      valid for some modes but not others.
  
       Autoincrement and autodecrement addresses typically have
       mode-dependent effects because the amount of the increment or
--- 32536,32609 ----
       This hook is given an invalid memory address X for an operand of
       mode MODE and should try to return a valid memory address.
  
!      X will always be the result of a call to 'break_out_memory_refs',
       and OLDX will be the operand that was given to that function to
       produce X.
  
!      The code of the hook should not alter the substructure of X.  If it
!      transforms X into a more legitimate form, it should return the new
!      X.
  
       It is not necessary for this hook to come up with a legitimate
!      address, with the exception of native TLS addresses (*note Emulated
!      TLS::).  The compiler has standard ways of doing so in all cases.
!      In fact, if the target supports only emulated TLS, it is safe to
!      omit this hook or make it return X if it cannot find a valid way to
!      legitimize the address.  But often a machine-dependent strategy can
!      generate better code.
  
   -- Macro: LEGITIMIZE_RELOAD_ADDRESS (X, MODE, OPNUM, TYPE, IND_LEVELS,
            WIN)
       A C compound statement that attempts to replace X, which is an
       address that needs reloading, with a valid memory address for an
!      operand of mode MODE.  WIN will be a C statement label elsewhere in
!      the code.  It is not necessary to define this macro, but it might
!      be useful for performance reasons.
  
       For example, on the i386, it is sometimes possible to use a single
       reload register instead of two by reloading a sum of two pseudo
       registers into a register.  On the other hand, for number of RISC
       processors offsets are limited so that often an intermediate
!      address needs to be generated in order to address a stack slot.  By
!      defining 'LEGITIMIZE_RELOAD_ADDRESS' appropriately, the
       intermediate addresses generated for adjacent some stack slots can
       be made identical, and thus be shared.
  
!      _Note_: This macro should be used with caution.  It is necessary to
!      know something of how reload works in order to effectively use
!      this, and it is quite easy to produce macros that build in too much
!      knowledge of reload internals.
  
       _Note_: This macro must be able to reload an address created by a
       previous invocation of this macro.  If it fails to handle such
       addresses then the compiler may generate incorrect code or abort.
  
!      The macro definition should use 'push_reload' to indicate parts
       that need reloading; OPNUM, TYPE and IND_LEVELS are usually
!      suitable to be passed unaltered to 'push_reload'.
  
       The code generated by this macro must not alter the substructure of
       X.  If it transforms X into a more legitimate form, it should
       assign X (which will always be a C variable) a new value.  This
       also applies to parts that you change indirectly by calling
!      'push_reload'.
  
!      The macro definition may use 'strict_memory_address_p' to test if
       the address has become legitimate.
  
       If you want to change only a part of X, one standard way of doing
!      this is to use 'copy_rtx'.  Note, however, that it unshares only a
       single level of rtl.  Thus, if the part to be changed is not at the
       top level, you'll need to replace first the top level.  It is not
!      necessary for this macro to come up with a legitimate address; but
!      often a machine-dependent strategy can generate better code.
  
   -- Target Hook: bool TARGET_MODE_DEPENDENT_ADDRESS_P (const_rtx ADDR,
            addr_space_t ADDRSPACE)
!      This hook returns 'true' if memory address ADDR in address space
!      ADDRSPACE can have different meanings depending on the machine mode
!      of the memory reference it is used for or if the address is valid
!      for some modes but not others.
  
       Autoincrement and autodecrement addresses typically have
       mode-dependent effects because the amount of the increment or
*************** This is about addressing modes.
*** 33015,33038 ****
  
       You may assume that ADDR is a valid address for the machine.
  
!      The default version of this hook returns `false'.
  
   -- Target Hook: bool TARGET_LEGITIMATE_CONSTANT_P (machine_mode MODE,
            rtx X)
       This hook returns true if X is a legitimate constant for a
       MODE-mode immediate operand on the target machine.  You can assume
!      that X satisfies `CONSTANT_P', so you need not check this.
  
       The default definition returns true.
  
   -- Target Hook: rtx TARGET_DELEGITIMIZE_ADDRESS (rtx X)
       This hook is used to undo the possibly obfuscating effects of the
!      `LEGITIMIZE_ADDRESS' and `LEGITIMIZE_RELOAD_ADDRESS' target
!      macros.  Some backend implementations of these macros wrap symbol
!      references inside an `UNSPEC' rtx to represent PIC or similar
!      addressing modes.  This target hook allows GCC's optimizers to
!      understand the semantics of these opaque `UNSPEC's by converting
!      them back into their original form.
  
   -- Target Hook: bool TARGET_CONST_NOT_OK_FOR_DEBUG_P (rtx X)
       This hook should return true if X should not be emitted into debug
--- 32613,32636 ----
  
       You may assume that ADDR is a valid address for the machine.
  
!      The default version of this hook returns 'false'.
  
   -- Target Hook: bool TARGET_LEGITIMATE_CONSTANT_P (machine_mode MODE,
            rtx X)
       This hook returns true if X is a legitimate constant for a
       MODE-mode immediate operand on the target machine.  You can assume
!      that X satisfies 'CONSTANT_P', so you need not check this.
  
       The default definition returns true.
  
   -- Target Hook: rtx TARGET_DELEGITIMIZE_ADDRESS (rtx X)
       This hook is used to undo the possibly obfuscating effects of the
!      'LEGITIMIZE_ADDRESS' and 'LEGITIMIZE_RELOAD_ADDRESS' target macros.
!      Some backend implementations of these macros wrap symbol references
!      inside an 'UNSPEC' rtx to represent PIC or similar addressing
!      modes.  This target hook allows GCC's optimizers to understand the
!      semantics of these opaque 'UNSPEC's by converting them back into
!      their original form.
  
   -- Target Hook: bool TARGET_CONST_NOT_OK_FOR_DEBUG_P (rtx X)
       This hook should return true if X should not be emitted into debug
*************** This is about addressing modes.
*** 33055,33067 ****
   -- Target Hook: bool TARGET_USE_BLOCKS_FOR_CONSTANT_P (machine_mode
            MODE, const_rtx X)
       This hook should return true if pool entries for constant X can be
!      placed in an `object_block' structure.  MODE is the mode of X.
  
       The default version returns false for all constants.
  
   -- Target Hook: bool TARGET_USE_BLOCKS_FOR_DECL_P (const_tree DECL)
       This hook should return true if pool entries for DECL should be
!      placed in an `object_block' structure.
  
       The default version returns true for all decls.
  
--- 32653,32665 ----
   -- Target Hook: bool TARGET_USE_BLOCKS_FOR_CONSTANT_P (machine_mode
            MODE, const_rtx X)
       This hook should return true if pool entries for constant X can be
!      placed in an 'object_block' structure.  MODE is the mode of X.
  
       The default version returns false for all constants.
  
   -- Target Hook: bool TARGET_USE_BLOCKS_FOR_DECL_P (const_tree DECL)
       This hook should return true if pool entries for DECL should be
!      placed in an 'object_block' structure.
  
       The default version returns true for all decls.
  
*************** This is about addressing modes.
*** 33069,33079 ****
            MD_FN, bool SQRT)
       This hook should return the DECL of a function that implements
       reciprocal of the builtin function with builtin function code FN,
!      or `NULL_TREE' if such a function is not available.  MD_FN is true
       when FN is a code of a machine-dependent builtin function.  When
       SQRT is true, additional optimizations that apply only to the
       reciprocal of a square root function are performed, and only
!      reciprocals of `sqrt' function are valid.
  
   -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_MASK_FOR_LOAD (void)
       This hook should return the DECL of a function F that given an
--- 32667,32677 ----
            MD_FN, bool SQRT)
       This hook should return the DECL of a function that implements
       reciprocal of the builtin function with builtin function code FN,
!      or 'NULL_TREE' if such a function is not available.  MD_FN is true
       when FN is a code of a machine-dependent builtin function.  When
       SQRT is true, additional optimizations that apply only to the
       reciprocal of a square root function are performed, and only
!      reciprocals of 'sqrt' function are valid.
  
   -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_MASK_FOR_LOAD (void)
       This hook should return the DECL of a function F that given an
*************** This is about addressing modes.
*** 33083,33104 ****
  
       The autovectorizer, when vectorizing a load operation from an
       address ADDR that may be unaligned, will generate two vector loads
!      from the two aligned addresses around ADDR. It then generates a
!      `REALIGN_LOAD' operation to extract the relevant data from the two
!      loaded vectors. The first two arguments to `REALIGN_LOAD', V1 and
       V2, are the two vectors, each of size VS, and the third argument,
!      OFF, defines how the data will be extracted from these two
!      vectors: if OFF is 0, then the returned vector is V2; otherwise,
!      the returned vector is composed from the last VS-OFF elements of
!      V1 concatenated to the first OFF elements of V2.
  
!      If this hook is defined, the autovectorizer will generate a call
!      to F (using the DECL tree that this hook returns) and will use the
!      return value of F as the argument OFF to `REALIGN_LOAD'.
       Therefore, the mask M returned by F should comply with the
!      semantics expected by `REALIGN_LOAD' described above.  If this
!      hook is not defined, then ADDR will be used as the argument OFF to
!      `REALIGN_LOAD', in which case the low log2(VS) - 1 bits of ADDR
       will be considered.
  
   -- Target Hook: int TARGET_VECTORIZE_BUILTIN_VECTORIZATION_COST (enum
--- 32681,32702 ----
  
       The autovectorizer, when vectorizing a load operation from an
       address ADDR that may be unaligned, will generate two vector loads
!      from the two aligned addresses around ADDR.  It then generates a
!      'REALIGN_LOAD' operation to extract the relevant data from the two
!      loaded vectors.  The first two arguments to 'REALIGN_LOAD', V1 and
       V2, are the two vectors, each of size VS, and the third argument,
!      OFF, defines how the data will be extracted from these two vectors:
!      if OFF is 0, then the returned vector is V2; otherwise, the
!      returned vector is composed from the last VS-OFF elements of V1
!      concatenated to the first OFF elements of V2.
  
!      If this hook is defined, the autovectorizer will generate a call to
!      F (using the DECL tree that this hook returns) and will use the
!      return value of F as the argument OFF to 'REALIGN_LOAD'.
       Therefore, the mask M returned by F should comply with the
!      semantics expected by 'REALIGN_LOAD' described above.  If this hook
!      is not defined, then ADDR will be used as the argument OFF to
!      'REALIGN_LOAD', in which case the low log2(VS) - 1 bits of ADDR
       will be considered.
  
   -- Target Hook: int TARGET_VECTORIZE_BUILTIN_VECTORIZATION_COST (enum
*************** This is about addressing modes.
*** 33114,33138 ****
  
   -- Target Hook: bool TARGET_VECTORIZE_VEC_PERM_CONST_OK (machine_mode,
            const unsigned char *SEL)
!      Return true if a vector created for `vec_perm_const' is valid.
  
   -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_CONVERSION (unsigned
            CODE, tree DEST_TYPE, tree SRC_TYPE)
       This hook should return the DECL of a function that implements
       conversion of the input vector of type SRC_TYPE to type DEST_TYPE.
!      The value of CODE is one of the enumerators in `enum tree_code' and
       specifies how the conversion is to be applied (truncation,
       rounding, etc.).
  
       If this hook is defined, the autovectorizer will use the
!      `TARGET_VECTORIZE_BUILTIN_CONVERSION' target hook when vectorizing
!      conversion. Otherwise, it will return `NULL_TREE'.
  
!  -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_VECTORIZED_FUNCTION
!           (tree FNDECL, tree VEC_TYPE_OUT, tree VEC_TYPE_IN)
       This hook should return the decl of a function that implements the
       vectorized variant of the builtin function with builtin function
!      code CODE or `NULL_TREE' if such a function is not available.  The
       value of FNDECL is the builtin function declaration.  The return
       type of the vectorized function shall be of vector type
       VEC_TYPE_OUT and the argument types should be VEC_TYPE_IN.
--- 32712,32736 ----
  
   -- Target Hook: bool TARGET_VECTORIZE_VEC_PERM_CONST_OK (machine_mode,
            const unsigned char *SEL)
!      Return true if a vector created for 'vec_perm_const' is valid.
  
   -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_CONVERSION (unsigned
            CODE, tree DEST_TYPE, tree SRC_TYPE)
       This hook should return the DECL of a function that implements
       conversion of the input vector of type SRC_TYPE to type DEST_TYPE.
!      The value of CODE is one of the enumerators in 'enum tree_code' and
       specifies how the conversion is to be applied (truncation,
       rounding, etc.).
  
       If this hook is defined, the autovectorizer will use the
!      'TARGET_VECTORIZE_BUILTIN_CONVERSION' target hook when vectorizing
!      conversion.  Otherwise, it will return 'NULL_TREE'.
  
!  -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_VECTORIZED_FUNCTION (tree
!           FNDECL, tree VEC_TYPE_OUT, tree VEC_TYPE_IN)
       This hook should return the decl of a function that implements the
       vectorized variant of the builtin function with builtin function
!      code CODE or 'NULL_TREE' if such a function is not available.  The
       value of FNDECL is the builtin function declaration.  The return
       type of the vectorized function shall be of vector type
       VEC_TYPE_OUT and the argument types should be VEC_TYPE_IN.
*************** This is about addressing modes.
*** 33150,33164 ****
   -- Target Hook: machine_mode TARGET_VECTORIZE_PREFERRED_SIMD_MODE
            (machine_mode MODE)
       This hook should return the preferred mode for vectorizing scalar
!      mode MODE.  The default is equal to `word_mode', because the
       vectorizer can do some transformations even in absence of
       specialized SIMD hardware.
  
   -- Target Hook: unsigned int
! TARGET_VECTORIZE_AUTOVECTORIZE_VECTOR_SIZES (void)
       This hook should return a mask of sizes that should be iterated
       over after trying to autovectorize using the vector size derived
!      from the mode returned by `TARGET_VECTORIZE_PREFERRED_SIMD_MODE'.
       The default is zero which means to not iterate over other vector
       sizes.
  
--- 32748,32762 ----
   -- Target Hook: machine_mode TARGET_VECTORIZE_PREFERRED_SIMD_MODE
            (machine_mode MODE)
       This hook should return the preferred mode for vectorizing scalar
!      mode MODE.  The default is equal to 'word_mode', because the
       vectorizer can do some transformations even in absence of
       specialized SIMD hardware.
  
   -- Target Hook: unsigned int
!           TARGET_VECTORIZE_AUTOVECTORIZE_VECTOR_SIZES (void)
       This hook should return a mask of sizes that should be iterated
       over after trying to autovectorize using the vector size derived
!      from the mode returned by 'TARGET_VECTORIZE_PREFERRED_SIMD_MODE'.
       The default is zero which means to not iterate over other vector
       sizes.
  
*************** TARGET_VECTORIZE_AUTOVECTORIZE_VECTOR_SI
*** 33167,33200 ****
       This hook should initialize target-specific data structures in
       preparation for modeling the costs of vectorizing a loop or basic
       block.  The default allocates three unsigned integers for
!      accumulating costs for the prologue, body, and epilogue of the
!      loop or basic block.  If LOOP_INFO is non-NULL, it identifies the
!      loop being vectorized; otherwise a single block is being
!      vectorized.
  
   -- Target Hook: unsigned TARGET_VECTORIZE_ADD_STMT_COST (void *DATA,
!           int COUNT, enum vect_cost_for_stmt KIND, struct
!           _stmt_vec_info *STMT_INFO, int MISALIGN, enum
!           vect_cost_model_location WHERE)
       This hook should update the target-specific DATA in response to
       adding COUNT copies of the given KIND of statement to a loop or
       basic block.  The default adds the builtin vectorizer cost for the
!      copies of the statement to the accumulator specified by WHERE,
!      (the prologue, body, or epilogue) and returns the amount added.
!      The return value should be viewed as a tentative cost that may
!      later be revised.
  
!  -- Target Hook: void TARGET_VECTORIZE_FINISH_COST (void *DATA,
!           unsigned *PROLOGUE_COST, unsigned *BODY_COST, unsigned
!           *EPILOGUE_COST)
!      This hook should complete calculations of the cost of vectorizing
!      a loop or basic block based on DATA, and return the prologue,
!      body, and epilogue costs as unsigned integers.  The default
!      returns the value of the three accumulators.
  
   -- Target Hook: void TARGET_VECTORIZE_DESTROY_COST_DATA (void *DATA)
       This hook should release DATA and any related data structures
!      allocated by TARGET_VECTORIZE_INIT_COST.  The default releases the
       accumulator.
  
   -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_TM_LOAD (tree)
--- 32765,32795 ----
       This hook should initialize target-specific data structures in
       preparation for modeling the costs of vectorizing a loop or basic
       block.  The default allocates three unsigned integers for
!      accumulating costs for the prologue, body, and epilogue of the loop
!      or basic block.  If LOOP_INFO is non-NULL, it identifies the loop
!      being vectorized; otherwise a single block is being vectorized.
  
   -- Target Hook: unsigned TARGET_VECTORIZE_ADD_STMT_COST (void *DATA,
!           int COUNT, enum vect_cost_for_stmt KIND, struct _stmt_vec_info
!           *STMT_INFO, int MISALIGN, enum vect_cost_model_location WHERE)
       This hook should update the target-specific DATA in response to
       adding COUNT copies of the given KIND of statement to a loop or
       basic block.  The default adds the builtin vectorizer cost for the
!      copies of the statement to the accumulator specified by WHERE, (the
!      prologue, body, or epilogue) and returns the amount added.  The
!      return value should be viewed as a tentative cost that may later be
!      revised.
  
!  -- Target Hook: void TARGET_VECTORIZE_FINISH_COST (void *DATA, unsigned
!           *PROLOGUE_COST, unsigned *BODY_COST, unsigned *EPILOGUE_COST)
!      This hook should complete calculations of the cost of vectorizing a
!      loop or basic block based on DATA, and return the prologue, body,
!      and epilogue costs as unsigned integers.  The default returns the
!      value of the three accumulators.
  
   -- Target Hook: void TARGET_VECTORIZE_DESTROY_COST_DATA (void *DATA)
       This hook should release DATA and any related data structures
!      allocated by TARGET_VECTORIZE_INIT_COST. The default releases the
       accumulator.
  
   -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_TM_LOAD (tree)
*************** TARGET_VECTORIZE_AUTOVECTORIZE_VECTOR_SI
*** 33208,33216 ****
   -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_GATHER (const_tree
            MEM_VECTYPE, const_tree INDEX_TYPE, int SCALE)
       Target builtin that implements vector gather operation.
!      MEM_VECTYPE is the vector type of the load and INDEX_TYPE is
!      scalar type of the index, scaled by SCALE.  The default is
!      `NULL_TREE' which means to not vectorize gather loads.
  
   -- Target Hook: int TARGET_SIMD_CLONE_COMPUTE_VECSIZE_AND_SIMDLEN
            (struct cgraph_node *, struct cgraph_simd_clone *, TREE, INT)
--- 32803,32811 ----
   -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_GATHER (const_tree
            MEM_VECTYPE, const_tree INDEX_TYPE, int SCALE)
       Target builtin that implements vector gather operation.
!      MEM_VECTYPE is the vector type of the load and INDEX_TYPE is scalar
!      type of the index, scaled by SCALE.  The default is 'NULL_TREE'
!      which means to not vectorize gather loads.
  
   -- Target Hook: int TARGET_SIMD_CLONE_COMPUTE_VECSIZE_AND_SIMDLEN
            (struct cgraph_node *, struct cgraph_simd_clone *, TREE, INT)
*************** TARGET_VECTORIZE_AUTOVECTORIZE_VECTOR_SI
*** 33221,33227 ****
       variants that should be emitted.
  
   -- Target Hook: void TARGET_SIMD_CLONE_ADJUST (struct cgraph_node *)
!      This hook should add implicit `attribute(target("..."))' attribute
       to SIMD clone NODE if needed.
  
   -- Target Hook: int TARGET_SIMD_CLONE_USABLE (struct cgraph_node *)
--- 32816,32822 ----
       variants that should be emitted.
  
   -- Target Hook: void TARGET_SIMD_CLONE_ADJUST (struct cgraph_node *)
!      This hook should add implicit 'attribute(target("..."))' attribute
       to SIMD clone NODE if needed.
  
   -- Target Hook: int TARGET_SIMD_CLONE_USABLE (struct cgraph_node *)
*************** example, if we have:
*** 33242,33249 ****
       static int a, b, c;
       int foo (void) { return a + b + c; }
  
!  the code for `foo' will usually calculate three separate symbolic
! addresses: those of `a', `b' and `c'.  On some targets, it would be
  better to calculate just one symbolic address and access the three
  variables relative to it.  The equivalent pseudocode would be something
  like:
--- 32837,32844 ----
       static int a, b, c;
       int foo (void) { return a + b + c; }
  
!  the code for 'foo' will usually calculate three separate symbolic
! addresses: those of 'a', 'b' and 'c'.  On some targets, it would be
  better to calculate just one symbolic address and access the three
  variables relative to it.  The equivalent pseudocode would be something
  like:
*************** like:
*** 33254,33266 ****
         return xr[&a - &x] + xr[&b - &x] + xr[&c - &x];
       }
  
!  (which isn't valid C).  We refer to shared addresses like `x' as
! "section anchors".  Their use is controlled by `-fsection-anchors'.
  
   The hooks below describe the target properties that GCC needs to know
! in order to make effective use of section anchors.  It won't use
! section anchors at all unless either `TARGET_MIN_ANCHOR_OFFSET' or
! `TARGET_MAX_ANCHOR_OFFSET' is set to a nonzero value.
  
   -- Target Hook: HOST_WIDE_INT TARGET_MIN_ANCHOR_OFFSET
       The minimum offset that should be applied to a section anchor.  On
--- 32849,32861 ----
         return xr[&a - &x] + xr[&b - &x] + xr[&c - &x];
       }
  
!  (which isn't valid C). We refer to shared addresses like 'x' as
! "section anchors".  Their use is controlled by '-fsection-anchors'.
  
   The hooks below describe the target properties that GCC needs to know
! in order to make effective use of section anchors.  It won't use section
! anchors at all unless either 'TARGET_MIN_ANCHOR_OFFSET' or
! 'TARGET_MAX_ANCHOR_OFFSET' is set to a nonzero value.
  
   -- Target Hook: HOST_WIDE_INT TARGET_MIN_ANCHOR_OFFSET
       The minimum offset that should be applied to a section anchor.  On
*************** section anchors at all unless either `TA
*** 33269,33296 ****
       every mode.  The default value is 0.
  
   -- Target Hook: HOST_WIDE_INT TARGET_MAX_ANCHOR_OFFSET
!      Like `TARGET_MIN_ANCHOR_OFFSET', but the maximum (inclusive)
!      offset that should be applied to section anchors.  The default
!      value is 0.
  
   -- Target Hook: void TARGET_ASM_OUTPUT_ANCHOR (rtx X)
       Write the assembly code to define section anchor X, which is a
!      `SYMBOL_REF' for which `SYMBOL_REF_ANCHOR_P (X)' is true.  The
!      hook is called with the assembly output position set to the
!      beginning of `SYMBOL_REF_BLOCK (X)'.
  
!      If `ASM_OUTPUT_DEF' is available, the hook's default definition
!      uses it to define the symbol as `. + SYMBOL_REF_BLOCK_OFFSET (X)'.
!      If `ASM_OUTPUT_DEF' is not available, the hook's default definition
!      is `NULL', which disables the use of section anchors altogether.
  
   -- Target Hook: bool TARGET_USE_ANCHORS_FOR_SYMBOL_P (const_rtx X)
       Return true if GCC should attempt to use anchors to access
!      `SYMBOL_REF' X.  You can assume `SYMBOL_REF_HAS_BLOCK_INFO_P (X)'
!      and `!SYMBOL_REF_ANCHOR_P (X)'.
  
!      The default version is correct for most targets, but you might
!      need to intercept this hook to handle things like target-specific
       attributes or target-specific sections.
  
  
--- 32864,32890 ----
       every mode.  The default value is 0.
  
   -- Target Hook: HOST_WIDE_INT TARGET_MAX_ANCHOR_OFFSET
!      Like 'TARGET_MIN_ANCHOR_OFFSET', but the maximum (inclusive) offset
!      that should be applied to section anchors.  The default value is 0.
  
   -- Target Hook: void TARGET_ASM_OUTPUT_ANCHOR (rtx X)
       Write the assembly code to define section anchor X, which is a
!      'SYMBOL_REF' for which 'SYMBOL_REF_ANCHOR_P (X)' is true.  The hook
!      is called with the assembly output position set to the beginning of
!      'SYMBOL_REF_BLOCK (X)'.
  
!      If 'ASM_OUTPUT_DEF' is available, the hook's default definition
!      uses it to define the symbol as '. + SYMBOL_REF_BLOCK_OFFSET (X)'.
!      If 'ASM_OUTPUT_DEF' is not available, the hook's default definition
!      is 'NULL', which disables the use of section anchors altogether.
  
   -- Target Hook: bool TARGET_USE_ANCHORS_FOR_SYMBOL_P (const_rtx X)
       Return true if GCC should attempt to use anchors to access
!      'SYMBOL_REF' X.  You can assume 'SYMBOL_REF_HAS_BLOCK_INFO_P (X)'
!      and '!SYMBOL_REF_ANCHOR_P (X)'.
  
!      The default version is correct for most targets, but you might need
!      to intercept this hook to handle things like target-specific
       attributes or target-specific sections.
  
  
*************** File: gccint.info,  Node: Condition Code
*** 33302,33320 ****
  The macros in this section can be split in two families, according to
  the two ways of representing condition codes in GCC.
  
!  The first representation is the so called `(cc0)' representation
! (*note Jump Patterns::), where all instructions can have an implicit
! clobber of the condition codes.  The second is the condition code
! register representation, which provides better schedulability for
! architectures that do have a condition code register, but on which most
! instructions do not affect it.  The latter category includes most RISC
! machines.
  
   The implicit clobbering poses a strong restriction on the placement of
  the definition and use of the condition code.  In the past the
  definition and use were always adjacent.  However, recent changes to
  support trapping arithmatic may result in the definition and user being
! in different blocks.  Thus, there may be a `NOTE_INSN_BASIC_BLOCK'
  between them.  Additionally, the definition may be the source of
  exception handling edges.
  
--- 32896,32913 ----
  The macros in this section can be split in two families, according to
  the two ways of representing condition codes in GCC.
  
!  The first representation is the so called '(cc0)' representation (*note
! Jump Patterns::), where all instructions can have an implicit clobber of
! the condition codes.  The second is the condition code register
! representation, which provides better schedulability for architectures
! that do have a condition code register, but on which most instructions
! do not affect it.  The latter category includes most RISC machines.
  
   The implicit clobbering poses a strong restriction on the placement of
  the definition and use of the condition code.  In the past the
  definition and use were always adjacent.  However, recent changes to
  support trapping arithmatic may result in the definition and user being
! in different blocks.  Thus, there may be a 'NOTE_INSN_BASIC_BLOCK'
  between them.  Additionally, the definition may be the source of
  exception handling edges.
  
*************** represent the condition code for new por
*** 33330,33339 ****
  condition code register in the machine, use a hard register.  If the
  condition code or comparison result can be placed in any general
  register, or if there are multiple condition registers, use a pseudo
! register.  Registers used to store the condition code value will
! usually have a mode that is in class `MODE_CC'.
  
!  Alternatively, you can use `BImode' if the comparison operator is
  specified already in the compare instruction.  In this case, you are not
  interested in most macros in this section.
  
--- 32923,32932 ----
  condition code register in the machine, use a hard register.  If the
  condition code or comparison result can be placed in any general
  register, or if there are multiple condition registers, use a pseudo
! register.  Registers used to store the condition code value will usually
! have a mode that is in class 'MODE_CC'.
  
!  Alternatively, you can use 'BImode' if the comparison operator is
  specified already in the compare instruction.  In this case, you are not
  interested in most macros in this section.
  
*************** interested in most macros in this sectio
*** 33345,33354 ****
  
  File: gccint.info,  Node: CC0 Condition Codes,  Next: MODE_CC Condition Codes,  Up: Condition Code
  
! 17.15.1 Representation of condition codes using `(cc0)'
  -------------------------------------------------------
  
! The file `conditions.h' defines a variable `cc_status' to describe how
  the condition code was computed (in case the interpretation of the
  condition code depends on the instruction that it was set by).  This
  variable contains the RTL expressions on which the condition code is
--- 32938,32947 ----
  
  File: gccint.info,  Node: CC0 Condition Codes,  Next: MODE_CC Condition Codes,  Up: Condition Code
  
! 17.15.1 Representation of condition codes using '(cc0)'
  -------------------------------------------------------
  
! The file 'conditions.h' defines a variable 'cc_status' to describe how
  the condition code was computed (in case the interpretation of the
  condition code depends on the instruction that it was set by).  This
  variable contains the RTL expressions on which the condition code is
*************** currently based, and several standard fl
*** 33356,33411 ****
  
   Sometimes additional machine-specific flags must be defined in the
  machine description header file.  It can also add additional
! machine-specific information by defining `CC_STATUS_MDEP'.
  
   -- Macro: CC_STATUS_MDEP
!      C code for a data type which is used for declaring the `mdep'
!      component of `cc_status'.  It defaults to `int'.
  
!      This macro is not used on machines that do not use `cc0'.
  
   -- Macro: CC_STATUS_MDEP_INIT
!      A C expression to initialize the `mdep' field to "empty".  The
       default definition does nothing, since most machines don't use the
       field anyway.  If you want to use the field, you should probably
       define this macro to initialize it.
  
!      This macro is not used on machines that do not use `cc0'.
  
   -- Macro: NOTICE_UPDATE_CC (EXP, INSN)
!      A C compound statement to set the components of `cc_status'
       appropriately for an insn INSN whose body is EXP.  It is this
       macro's responsibility to recognize insns that set the condition
       code as a byproduct of other activity as well as those that
!      explicitly set `(cc0)'.
  
!      This macro is not used on machines that do not use `cc0'.
  
       If there are insns that do not set the condition code but do alter
       other machine registers, this macro must check to see whether they
       invalidate the expressions that the condition code is recorded as
       reflecting.  For example, on the 68000, insns that store in address
       registers do not set the condition code, which means that usually
!      `NOTICE_UPDATE_CC' can leave `cc_status' unaltered for such insns.
       But suppose that the previous insn set the condition code based on
!      location `a4@(102)' and the current insn stores a new value in
!      `a4'.  Although the condition code is not changed by this, it will
!      no longer be true that it reflects the contents of `a4@(102)'.
!      Therefore, `NOTICE_UPDATE_CC' must alter `cc_status' in this case
       to say that nothing is known about the condition code value.
  
!      The definition of `NOTICE_UPDATE_CC' must be prepared to deal with
       the results of peephole optimization: insns whose patterns are
!      `parallel' RTXs containing various `reg', `mem' or constants which
       are just the operands.  The RTL structure of these insns is not
       sufficient to indicate what the insns actually do.  What
!      `NOTICE_UPDATE_CC' should do when it sees one is just to run
!      `CC_STATUS_INIT'.
  
!      A possible definition of `NOTICE_UPDATE_CC' is to call a function
       that looks at an attribute (*note Insn Attributes::) named, for
!      example, `cc'.  This avoids having detailed information about
!      patterns in two places, the `md' file and in `NOTICE_UPDATE_CC'.
  
  
  File: gccint.info,  Node: MODE_CC Condition Codes,  Prev: CC0 Condition Codes,  Up: Condition Code
--- 32949,33004 ----
  
   Sometimes additional machine-specific flags must be defined in the
  machine description header file.  It can also add additional
! machine-specific information by defining 'CC_STATUS_MDEP'.
  
   -- Macro: CC_STATUS_MDEP
!      C code for a data type which is used for declaring the 'mdep'
!      component of 'cc_status'.  It defaults to 'int'.
  
!      This macro is not used on machines that do not use 'cc0'.
  
   -- Macro: CC_STATUS_MDEP_INIT
!      A C expression to initialize the 'mdep' field to "empty".  The
       default definition does nothing, since most machines don't use the
       field anyway.  If you want to use the field, you should probably
       define this macro to initialize it.
  
!      This macro is not used on machines that do not use 'cc0'.
  
   -- Macro: NOTICE_UPDATE_CC (EXP, INSN)
!      A C compound statement to set the components of 'cc_status'
       appropriately for an insn INSN whose body is EXP.  It is this
       macro's responsibility to recognize insns that set the condition
       code as a byproduct of other activity as well as those that
!      explicitly set '(cc0)'.
  
!      This macro is not used on machines that do not use 'cc0'.
  
       If there are insns that do not set the condition code but do alter
       other machine registers, this macro must check to see whether they
       invalidate the expressions that the condition code is recorded as
       reflecting.  For example, on the 68000, insns that store in address
       registers do not set the condition code, which means that usually
!      'NOTICE_UPDATE_CC' can leave 'cc_status' unaltered for such insns.
       But suppose that the previous insn set the condition code based on
!      location 'a4@(102)' and the current insn stores a new value in
!      'a4'.  Although the condition code is not changed by this, it will
!      no longer be true that it reflects the contents of 'a4@(102)'.
!      Therefore, 'NOTICE_UPDATE_CC' must alter 'cc_status' in this case
       to say that nothing is known about the condition code value.
  
!      The definition of 'NOTICE_UPDATE_CC' must be prepared to deal with
       the results of peephole optimization: insns whose patterns are
!      'parallel' RTXs containing various 'reg', 'mem' or constants which
       are just the operands.  The RTL structure of these insns is not
       sufficient to indicate what the insns actually do.  What
!      'NOTICE_UPDATE_CC' should do when it sees one is just to run
!      'CC_STATUS_INIT'.
  
!      A possible definition of 'NOTICE_UPDATE_CC' is to call a function
       that looks at an attribute (*note Insn Attributes::) named, for
!      example, 'cc'.  This avoids having detailed information about
!      patterns in two places, the 'md' file and in 'NOTICE_UPDATE_CC'.
  
  
  File: gccint.info,  Node: MODE_CC Condition Codes,  Prev: CC0 Condition Codes,  Up: Condition Code
*************** File: gccint.info,  Node: MODE_CC Condit
*** 33415,33437 ****
  
   -- Macro: SELECT_CC_MODE (OP, X, Y)
       On many machines, the condition code may be produced by other
!      instructions than compares, for example the branch can use
!      directly the condition code set by a subtract instruction.
!      However, on some machines when the condition code is set this way
!      some bits (such as the overflow bit) are not set in the same way
!      as a test instruction, so that a different branch instruction must
!      be used for some conditional branches.  When this happens, use the
!      machine mode of the condition code register to record different
!      formats of the condition code register.  Modes can also be used to
!      record which compare instruction (e.g. a signed or an unsigned
       comparison) produced the condition codes.
  
!      If other modes than `CCmode' are required, add them to
!      `MACHINE-modes.def' and define `SELECT_CC_MODE' to choose a mode
       given an operand of a compare.  This is needed because the modes
       have to be chosen not only during RTL generation but also, for
       example, by instruction combination.  The result of
!      `SELECT_CC_MODE' should be consistent with the mode used in the
       patterns; for example to support the case of the add on the SPARC
       discussed above, we have the pattern
  
--- 33008,33030 ----
  
   -- Macro: SELECT_CC_MODE (OP, X, Y)
       On many machines, the condition code may be produced by other
!      instructions than compares, for example the branch can use directly
!      the condition code set by a subtract instruction.  However, on some
!      machines when the condition code is set this way some bits (such as
!      the overflow bit) are not set in the same way as a test
!      instruction, so that a different branch instruction must be used
!      for some conditional branches.  When this happens, use the machine
!      mode of the condition code register to record different formats of
!      the condition code register.  Modes can also be used to record
!      which compare instruction (e.g.  a signed or an unsigned
       comparison) produced the condition codes.
  
!      If other modes than 'CCmode' are required, add them to
!      'MACHINE-modes.def' and define 'SELECT_CC_MODE' to choose a mode
       given an operand of a compare.  This is needed because the modes
       have to be chosen not only during RTL generation but also, for
       example, by instruction combination.  The result of
!      'SELECT_CC_MODE' should be consistent with the mode used in the
       patterns; for example to support the case of the add on the SPARC
       discussed above, we have the pattern
  
*************** File: gccint.info,  Node: MODE_CC Condit
*** 33444,33451 ****
              ""
              "...")
  
!      together with a `SELECT_CC_MODE' that returns `CC_NOOVmode' for
!      comparisons whose argument is a `plus':
  
            #define SELECT_CC_MODE(OP,X,Y) \
              (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT           \
--- 33037,33044 ----
              ""
              "...")
  
!      together with a 'SELECT_CC_MODE' that returns 'CC_NOOVmode' for
!      comparisons whose argument is a 'plus':
  
            #define SELECT_CC_MODE(OP,X,Y) \
              (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT           \
*************** File: gccint.info,  Node: MODE_CC Condit
*** 33456,33500 ****
                  ? CC_NOOVmode : CCmode))
  
       Another reason to use modes is to retain information on which
!      operands were used by the comparison; see `REVERSIBLE_CC_MODE'
       later in this section.
  
       You should define this macro if and only if you define extra CC
!      modes in `MACHINE-modes.def'.
  
   -- Target Hook: void TARGET_CANONICALIZE_COMPARISON (int *CODE, rtx
            *OP0, rtx *OP1, bool OP0_PRESERVE_VALUE)
       On some machines not all possible comparisons are defined, but you
       can convert an invalid comparison into a valid one.  For example,
!      the Alpha does not have a `GT' comparison, but you can use an `LT'
       comparison instead and swap the order of the operands.
  
       On such machines, implement this hook to do any required
       conversions.  CODE is the initial comparison code and OP0 and OP1
       are the left and right operands of the comparison, respectively.
!      If OP0_PRESERVE_VALUE is `true' the implementation is not allowed
       to change the value of OP0 since the value might be used in RTXs
!      which aren't comparisons.  E.g. the implementation is not allowed
       to swap operands in that case.
  
       GCC will not assume that the comparison resulting from this macro
       is valid but will see if the resulting insn matches a pattern in
!      the `md' file.
  
       You need not to implement this hook if it would never change the
       comparison code or operands.
  
   -- Macro: REVERSIBLE_CC_MODE (MODE)
       A C expression whose value is one if it is always safe to reverse a
!      comparison whose mode is MODE.  If `SELECT_CC_MODE' can ever
!      return MODE for a floating-point inequality comparison, then
!      `REVERSIBLE_CC_MODE (MODE)' must be zero.
  
       You need not define this macro if it would always returns zero or
       if the floating-point format is anything other than
!      `IEEE_FLOAT_FORMAT'.  For example, here is the definition used on
       the SPARC, where floating-point inequality comparisons are given
!      either `CCFPEmode' or `CCFPmode':
  
            #define REVERSIBLE_CC_MODE(MODE) \
               ((MODE) != CCFPEmode && (MODE) != CCFPmode)
--- 33049,33093 ----
                  ? CC_NOOVmode : CCmode))
  
       Another reason to use modes is to retain information on which
!      operands were used by the comparison; see 'REVERSIBLE_CC_MODE'
       later in this section.
  
       You should define this macro if and only if you define extra CC
!      modes in 'MACHINE-modes.def'.
  
   -- Target Hook: void TARGET_CANONICALIZE_COMPARISON (int *CODE, rtx
            *OP0, rtx *OP1, bool OP0_PRESERVE_VALUE)
       On some machines not all possible comparisons are defined, but you
       can convert an invalid comparison into a valid one.  For example,
!      the Alpha does not have a 'GT' comparison, but you can use an 'LT'
       comparison instead and swap the order of the operands.
  
       On such machines, implement this hook to do any required
       conversions.  CODE is the initial comparison code and OP0 and OP1
       are the left and right operands of the comparison, respectively.
!      If OP0_PRESERVE_VALUE is 'true' the implementation is not allowed
       to change the value of OP0 since the value might be used in RTXs
!      which aren't comparisons.  E.g.  the implementation is not allowed
       to swap operands in that case.
  
       GCC will not assume that the comparison resulting from this macro
       is valid but will see if the resulting insn matches a pattern in
!      the 'md' file.
  
       You need not to implement this hook if it would never change the
       comparison code or operands.
  
   -- Macro: REVERSIBLE_CC_MODE (MODE)
       A C expression whose value is one if it is always safe to reverse a
!      comparison whose mode is MODE.  If 'SELECT_CC_MODE' can ever return
!      MODE for a floating-point inequality comparison, then
!      'REVERSIBLE_CC_MODE (MODE)' must be zero.
  
       You need not define this macro if it would always returns zero or
       if the floating-point format is anything other than
!      'IEEE_FLOAT_FORMAT'.  For example, here is the definition used on
       the SPARC, where floating-point inequality comparisons are given
!      either 'CCFPEmode' or 'CCFPmode':
  
            #define REVERSIBLE_CC_MODE(MODE) \
               ((MODE) != CCFPEmode && (MODE) != CCFPmode)
*************** File: gccint.info,  Node: MODE_CC Condit
*** 33502,33512 ****
   -- Macro: REVERSE_CONDITION (CODE, MODE)
       A C expression whose value is reversed condition code of the CODE
       for comparison done in CC_MODE MODE.  The macro is used only in
!      case `REVERSIBLE_CC_MODE (MODE)' is nonzero.  Define this macro in
       case machine has some non-standard way how to reverse certain
       conditionals.  For instance in case all floating point conditions
!      are non-trapping, compiler may freely convert unordered compares
!      to ordered ones.  Then definition may look like:
  
            #define REVERSE_CONDITION(CODE, MODE) \
               ((MODE) != CCFPmode ? reverse_condition (CODE) \
--- 33095,33105 ----
   -- Macro: REVERSE_CONDITION (CODE, MODE)
       A C expression whose value is reversed condition code of the CODE
       for comparison done in CC_MODE MODE.  The macro is used only in
!      case 'REVERSIBLE_CC_MODE (MODE)' is nonzero.  Define this macro in
       case machine has some non-standard way how to reverse certain
       conditionals.  For instance in case all floating point conditions
!      are non-trapping, compiler may freely convert unordered compares to
!      ordered ones.  Then definition may look like:
  
            #define REVERSE_CONDITION(CODE, MODE) \
               ((MODE) != CCFPmode ? reverse_condition (CODE) \
*************** File: gccint.info,  Node: MODE_CC Condit
*** 33514,33549 ****
  
   -- Target Hook: bool TARGET_FIXED_CONDITION_CODE_REGS (unsigned int
            *P1, unsigned int *P2)
!      On targets which do not use `(cc0)', and which use a hard register
       rather than a pseudo-register to hold condition codes, the regular
       CSE passes are often not able to identify cases in which the hard
!      register is set to a common value.  Use this hook to enable a
!      small pass which optimizes such cases.  This hook should return
!      true to enable this pass, and it should set the integers to which
!      its arguments point to the hard register numbers used for
!      condition codes.  When there is only one such register, as is true
!      on most systems, the integer pointed to by P2 should be set to
!      `INVALID_REGNUM'.
  
       The default version of this hook returns false.
  
   -- Target Hook: machine_mode TARGET_CC_MODES_COMPATIBLE (machine_mode
            M1, machine_mode M2)
       On targets which use multiple condition code modes in class
!      `MODE_CC', it is sometimes the case that a comparison can be
       validly done in more than one mode.  On such a system, define this
       target hook to take two mode arguments and to return a mode in
       which both comparisons may be validly done.  If there is no such
!      mode, return `VOIDmode'.
  
       The default version of this hook checks whether the modes are the
       same.  If they are, it returns that mode.  If they are different,
!      it returns `VOIDmode'.
  
   -- Target Hook: unsigned int TARGET_FLAGS_REGNUM
       If the target has a dedicated flags register, and it needs to use
!      the post-reload comparison elimination pass, then this value
!      should be set appropriately.
  
  
  File: gccint.info,  Node: Costs,  Next: Scheduling,  Prev: Condition Code,  Up: Target Macros
--- 33107,33142 ----
  
   -- Target Hook: bool TARGET_FIXED_CONDITION_CODE_REGS (unsigned int
            *P1, unsigned int *P2)
!      On targets which do not use '(cc0)', and which use a hard register
       rather than a pseudo-register to hold condition codes, the regular
       CSE passes are often not able to identify cases in which the hard
!      register is set to a common value.  Use this hook to enable a small
!      pass which optimizes such cases.  This hook should return true to
!      enable this pass, and it should set the integers to which its
!      arguments point to the hard register numbers used for condition
!      codes.  When there is only one such register, as is true on most
!      systems, the integer pointed to by P2 should be set to
!      'INVALID_REGNUM'.
  
       The default version of this hook returns false.
  
   -- Target Hook: machine_mode TARGET_CC_MODES_COMPATIBLE (machine_mode
            M1, machine_mode M2)
       On targets which use multiple condition code modes in class
!      'MODE_CC', it is sometimes the case that a comparison can be
       validly done in more than one mode.  On such a system, define this
       target hook to take two mode arguments and to return a mode in
       which both comparisons may be validly done.  If there is no such
!      mode, return 'VOIDmode'.
  
       The default version of this hook checks whether the modes are the
       same.  If they are, it returns that mode.  If they are different,
!      it returns 'VOIDmode'.
  
   -- Target Hook: unsigned int TARGET_FLAGS_REGNUM
       If the target has a dedicated flags register, and it needs to use
!      the post-reload comparison elimination pass, then this value should
!      be set appropriately.
  
  
  File: gccint.info,  Node: Costs,  Next: Scheduling,  Prev: Condition Code,  Up: Target Macros
*************** on the target machine.
*** 33557,33563 ****
   -- Macro: REGISTER_MOVE_COST (MODE, FROM, TO)
       A C expression for the cost of moving data of mode MODE from a
       register in class FROM to one in class TO.  The classes are
!      expressed using the enumeration values such as `GENERAL_REGS'.  A
       value of 2 is the default; other values are interpreted relative to
       that.
  
--- 33150,33156 ----
   -- Macro: REGISTER_MOVE_COST (MODE, FROM, TO)
       A C expression for the cost of moving data of mode MODE from a
       register in class FROM to one in class TO.  The classes are
!      expressed using the enumeration values such as 'GENERAL_REGS'.  A
       value of 2 is the default; other values are interpreted relative to
       that.
  
*************** on the target machine.
*** 33565,33586 ****
       same as TO; on some machines it is expensive to move between
       registers if they are not general registers.
  
!      If reload sees an insn consisting of a single `set' between two
!      hard registers, and if `REGISTER_MOVE_COST' applied to their
       classes returns a value of 2, reload does not check to ensure that
       the constraints of the insn are met.  Setting a cost of other than
       2 will allow reload to verify that the constraints are met.  You
!      should do this if the `movM' pattern's constraints do not allow
       such copying.
  
       These macros are obsolete, new ports should use the target hook
!      `TARGET_REGISTER_MOVE_COST' instead.
  
   -- Target Hook: int TARGET_REGISTER_MOVE_COST (machine_mode MODE,
            reg_class_t FROM, reg_class_t TO)
       This target hook should return the cost of moving data of mode MODE
       from a register in class FROM to one in class TO.  The classes are
!      expressed using the enumeration values such as `GENERAL_REGS'.  A
       value of 2 is the default; other values are interpreted relative to
       that.
  
--- 33158,33179 ----
       same as TO; on some machines it is expensive to move between
       registers if they are not general registers.
  
!      If reload sees an insn consisting of a single 'set' between two
!      hard registers, and if 'REGISTER_MOVE_COST' applied to their
       classes returns a value of 2, reload does not check to ensure that
       the constraints of the insn are met.  Setting a cost of other than
       2 will allow reload to verify that the constraints are met.  You
!      should do this if the 'movM' pattern's constraints do not allow
       such copying.
  
       These macros are obsolete, new ports should use the target hook
!      'TARGET_REGISTER_MOVE_COST' instead.
  
   -- Target Hook: int TARGET_REGISTER_MOVE_COST (machine_mode MODE,
            reg_class_t FROM, reg_class_t TO)
       This target hook should return the cost of moving data of mode MODE
       from a register in class FROM to one in class TO.  The classes are
!      expressed using the enumeration values such as 'GENERAL_REGS'.  A
       value of 2 is the default; other values are interpreted relative to
       that.
  
*************** on the target machine.
*** 33588,33599 ****
       same as TO; on some machines it is expensive to move between
       registers if they are not general registers.
  
!      If reload sees an insn consisting of a single `set' between two
!      hard registers, and if `TARGET_REGISTER_MOVE_COST' applied to their
       classes returns a value of 2, reload does not check to ensure that
       the constraints of the insn are met.  Setting a cost of other than
       2 will allow reload to verify that the constraints are met.  You
!      should do this if the `movM' pattern's constraints do not allow
       such copying.
  
       The default version of this function returns 2.
--- 33181,33192 ----
       same as TO; on some machines it is expensive to move between
       registers if they are not general registers.
  
!      If reload sees an insn consisting of a single 'set' between two
!      hard registers, and if 'TARGET_REGISTER_MOVE_COST' applied to their
       classes returns a value of 2, reload does not check to ensure that
       the constraints of the insn are met.  Setting a cost of other than
       2 will allow reload to verify that the constraints are met.  You
!      should do this if the 'movM' pattern's constraints do not allow
       such copying.
  
       The default version of this function returns 2.
*************** on the target machine.
*** 33601,33608 ****
   -- Macro: MEMORY_MOVE_COST (MODE, CLASS, IN)
       A C expression for the cost of moving data of mode MODE between a
       register of class CLASS and memory; IN is zero if the value is to
!      be written to memory, nonzero if it is to be read in.  This cost
!      is relative to those in `REGISTER_MOVE_COST'.  If moving between
       registers and memory is more expensive than between two registers,
       you should define this macro to express the relative cost.
  
--- 33194,33201 ----
   -- Macro: MEMORY_MOVE_COST (MODE, CLASS, IN)
       A C expression for the cost of moving data of mode MODE between a
       register of class CLASS and memory; IN is zero if the value is to
!      be written to memory, nonzero if it is to be read in.  This cost is
!      relative to those in 'REGISTER_MOVE_COST'.  If moving between
       registers and memory is more expensive than between two registers,
       you should define this macro to express the relative cost.
  
*************** on the target machine.
*** 33613,33638 ****
       mechanism is more complex than copying via an intermediate, define
       this macro to reflect the actual cost of the move.
  
!      GCC defines the function `memory_move_secondary_cost' if secondary
       reloads are needed.  It computes the costs due to copying via a
       secondary register.  If your machine copies from memory using a
       secondary register in the conventional way but the default base
       value of 4 is not correct for your machine, define this macro to
!      add some other value to the result of that function.  The
!      arguments to that function are the same as to this macro.
  
       These macros are obsolete, new ports should use the target hook
!      `TARGET_MEMORY_MOVE_COST' instead.
  
   -- Target Hook: int TARGET_MEMORY_MOVE_COST (machine_mode MODE,
            reg_class_t RCLASS, bool IN)
       This target hook should return the cost of moving data of mode MODE
!      between a register of class RCLASS and memory; IN is `false' if
!      the value is to be written to memory, `true' if it is to be read
!      in.  This cost is relative to those in `TARGET_REGISTER_MOVE_COST'.
!      If moving between registers and memory is more expensive than
!      between two registers, you should add this target hook to express
!      the relative cost.
  
       If you do not add this target hook, GCC uses a default cost of 4
       plus the cost of copying via a secondary reload register, if one is
--- 33206,33231 ----
       mechanism is more complex than copying via an intermediate, define
       this macro to reflect the actual cost of the move.
  
!      GCC defines the function 'memory_move_secondary_cost' if secondary
       reloads are needed.  It computes the costs due to copying via a
       secondary register.  If your machine copies from memory using a
       secondary register in the conventional way but the default base
       value of 4 is not correct for your machine, define this macro to
!      add some other value to the result of that function.  The arguments
!      to that function are the same as to this macro.
  
       These macros are obsolete, new ports should use the target hook
!      'TARGET_MEMORY_MOVE_COST' instead.
  
   -- Target Hook: int TARGET_MEMORY_MOVE_COST (machine_mode MODE,
            reg_class_t RCLASS, bool IN)
       This target hook should return the cost of moving data of mode MODE
!      between a register of class RCLASS and memory; IN is 'false' if the
!      value is to be written to memory, 'true' if it is to be read in.
!      This cost is relative to those in 'TARGET_REGISTER_MOVE_COST'.  If
!      moving between registers and memory is more expensive than between
!      two registers, you should add this target hook to express the
!      relative cost.
  
       If you do not add this target hook, GCC uses a default cost of 4
       plus the cost of copying via a secondary reload register, if one is
*************** on the target machine.
*** 33641,33662 ****
       mechanism is more complex than copying via an intermediate, use
       this target hook to reflect the actual cost of the move.
  
!      GCC defines the function `memory_move_secondary_cost' if secondary
       reloads are needed.  It computes the costs due to copying via a
       secondary register.  If your machine copies from memory using a
       secondary register in the conventional way but the default base
!      value of 4 is not correct for your machine, use this target hook
!      to add some other value to the result of that function.  The
!      arguments to that function are the same as to this target hook.
  
   -- Macro: BRANCH_COST (SPEED_P, PREDICTABLE_P)
       A C expression for the cost of a branch instruction.  A value of 1
       is the default; other values are interpreted relative to that.
       Parameter SPEED_P is true when the branch in question should be
!      optimized for speed.  When it is false, `BRANCH_COST' should
!      return a value optimal for code size rather than performance.
!      PREDICTABLE_P is true for well-predicted branches. On many
!      architectures the `BRANCH_COST' can be reduced then.
  
   Here are additional macros which do not specify precise relative costs,
  but only that certain actions are more expensive than GCC would
--- 33234,33255 ----
       mechanism is more complex than copying via an intermediate, use
       this target hook to reflect the actual cost of the move.
  
!      GCC defines the function 'memory_move_secondary_cost' if secondary
       reloads are needed.  It computes the costs due to copying via a
       secondary register.  If your machine copies from memory using a
       secondary register in the conventional way but the default base
!      value of 4 is not correct for your machine, use this target hook to
!      add some other value to the result of that function.  The arguments
!      to that function are the same as to this target hook.
  
   -- Macro: BRANCH_COST (SPEED_P, PREDICTABLE_P)
       A C expression for the cost of a branch instruction.  A value of 1
       is the default; other values are interpreted relative to that.
       Parameter SPEED_P is true when the branch in question should be
!      optimized for speed.  When it is false, 'BRANCH_COST' should return
!      a value optimal for code size rather than performance.
!      PREDICTABLE_P is true for well-predicted branches.  On many
!      architectures the 'BRANCH_COST' can be reduced then.
  
   Here are additional macros which do not specify precise relative costs,
  but only that certain actions are more expensive than GCC would
*************** ordinarily expect.
*** 33664,33670 ****
  
   -- Macro: SLOW_BYTE_ACCESS
       Define this macro as a C expression which is nonzero if accessing
!      less than a word of memory (i.e. a `char' or a `short') is no
       faster than accessing a word of memory, i.e., if such access
       require more than one instruction or if there is no difference in
       cost between byte and (aligned) word loads.
--- 33257,33263 ----
  
   -- Macro: SLOW_BYTE_ACCESS
       Define this macro as a C expression which is nonzero if accessing
!      less than a word of memory (i.e. a 'char' or a 'short') is no
       faster than accessing a word of memory, i.e., if such access
       require more than one instruction or if there is no difference in
       cost between byte and (aligned) word loads.
*************** ordinarily expect.
*** 33678,33697 ****
       structure, but to different bytes.
  
   -- Macro: SLOW_UNALIGNED_ACCESS (MODE, ALIGNMENT)
!      Define this macro to be the value 1 if memory accesses described
!      by the MODE and ALIGNMENT parameters have a cost many times greater
       than aligned accesses, for example if they are emulated in a trap
       handler.
  
       When this macro is nonzero, the compiler will act as if
!      `STRICT_ALIGNMENT' were nonzero when generating code for block
       moves.  This can cause significantly more instructions to be
       produced.  Therefore, do not set this macro nonzero if unaligned
       accesses only add a cycle or two to the time for a memory access.
  
       If the value of this macro is always zero, it need not be defined.
       If this macro is defined, it should produce a nonzero value when
!      `STRICT_ALIGNMENT' is nonzero.
  
   -- Macro: MOVE_RATIO (SPEED)
       The threshold of number of scalar memory-to-memory move insns,
--- 33271,33290 ----
       structure, but to different bytes.
  
   -- Macro: SLOW_UNALIGNED_ACCESS (MODE, ALIGNMENT)
!      Define this macro to be the value 1 if memory accesses described by
!      the MODE and ALIGNMENT parameters have a cost many times greater
       than aligned accesses, for example if they are emulated in a trap
       handler.
  
       When this macro is nonzero, the compiler will act as if
!      'STRICT_ALIGNMENT' were nonzero when generating code for block
       moves.  This can cause significantly more instructions to be
       produced.  Therefore, do not set this macro nonzero if unaligned
       accesses only add a cycle or two to the time for a memory access.
  
       If the value of this macro is always zero, it need not be defined.
       If this macro is defined, it should produce a nonzero value when
!      'STRICT_ALIGNMENT' is nonzero.
  
   -- Macro: MOVE_RATIO (SPEED)
       The threshold of number of scalar memory-to-memory move insns,
*************** ordinarily expect.
*** 33701,33707 ****
       increased code size.
  
       Note that on machines where the corresponding move insn is a
!      `define_expand' that emits a sequence of insns, this macro counts
       the number of such sequences.
  
       The parameter SPEED is true if the code is currently being
--- 33294,33300 ----
       increased code size.
  
       Note that on machines where the corresponding move insn is a
!      'define_expand' that emits a sequence of insns, this macro counts
       the number of such sequences.
  
       The parameter SPEED is true if the code is currently being
*************** ordinarily expect.
*** 33714,33732 ****
            by_pieces_operation OP, bool SPEED_P)
       GCC will attempt several strategies when asked to copy between two
       areas of memory, or to set, clear or store to memory, for example
!      when copying a `struct'. The `by_pieces' infrastructure implements
       such memory operations as a sequence of load, store or move insns.
!      Alternate strategies are to expand the `movmem' or `setmem'
!      optabs, to emit a library call, or to emit unit-by-unit,
!      loop-based operations.
  
!      This target hook should return true if, for a memory operation
!      with a given SIZE and ALIGNMENT, using the `by_pieces'
!      infrastructure is expected to result in better code generation.
!      Both SIZE and ALIGNMENT are measured in terms of storage units.
  
!      The parameter OP is one of: `CLEAR_BY_PIECES', `MOVE_BY_PIECES',
!      `SET_BY_PIECES', `STORE_BY_PIECES'.  These describe the type of
       memory operation under consideration.
  
       The parameter SPEED_P is true if the code is currently being
--- 33307,33325 ----
            by_pieces_operation OP, bool SPEED_P)
       GCC will attempt several strategies when asked to copy between two
       areas of memory, or to set, clear or store to memory, for example
!      when copying a 'struct'.  The 'by_pieces' infrastructure implements
       such memory operations as a sequence of load, store or move insns.
!      Alternate strategies are to expand the 'movmem' or 'setmem' optabs,
!      to emit a library call, or to emit unit-by-unit, loop-based
!      operations.
  
!      This target hook should return true if, for a memory operation with
!      a given SIZE and ALIGNMENT, using the 'by_pieces' infrastructure is
!      expected to result in better code generation.  Both SIZE and
!      ALIGNMENT are measured in terms of storage units.
  
!      The parameter OP is one of: 'CLEAR_BY_PIECES', 'MOVE_BY_PIECES',
!      'SET_BY_PIECES', 'STORE_BY_PIECES'.  These describe the type of
       memory operation under consideration.
  
       The parameter SPEED_P is true if the code is currently being
*************** ordinarily expect.
*** 33734,33753 ****
  
       Returning true for higher values of SIZE can improve code
       generation for speed if the target does not provide an
!      implementation of the `movmem' or `setmem' standard names, if the
!      `movmem' or `setmem' implementation would be more expensive than a
       sequence of insns, or if the overhead of a library call would
       dominate that of the body of the memory operation.
  
!      Returning true for higher values of `size' may also cause an
       increase in code size, for example where the number of insns
       emitted to perform a move would be greater than that of a library
       call.
  
   -- Macro: MOVE_MAX_PIECES
!      A C expression used by `move_by_pieces' to determine the largest
       unit a load or store used to copy memory is.  Defaults to
!      `MOVE_MAX'.
  
   -- Macro: CLEAR_RATIO (SPEED)
       The threshold of number of scalar move insns, _below_ which a
--- 33327,33346 ----
  
       Returning true for higher values of SIZE can improve code
       generation for speed if the target does not provide an
!      implementation of the 'movmem' or 'setmem' standard names, if the
!      'movmem' or 'setmem' implementation would be more expensive than a
       sequence of insns, or if the overhead of a library call would
       dominate that of the body of the memory operation.
  
!      Returning true for higher values of 'size' may also cause an
       increase in code size, for example where the number of insns
       emitted to perform a move would be greater than that of a library
       call.
  
   -- Macro: MOVE_MAX_PIECES
!      A C expression used by 'move_by_pieces' to determine the largest
       unit a load or store used to copy memory is.  Defaults to
!      'MOVE_MAX'.
  
   -- Macro: CLEAR_RATIO (SPEED)
       The threshold of number of scalar move insns, _below_ which a
*************** ordinarily expect.
*** 33771,33817 ****
       The parameter SPEED is true if the code is currently being
       optimized for speed rather than size.
  
!      If you don't define this, it defaults to the value of `MOVE_RATIO'.
  
   -- Macro: USE_LOAD_POST_INCREMENT (MODE)
       A C expression used to determine whether a load postincrement is a
       good thing to use for a given mode.  Defaults to the value of
!      `HAVE_POST_INCREMENT'.
  
   -- Macro: USE_LOAD_POST_DECREMENT (MODE)
       A C expression used to determine whether a load postdecrement is a
       good thing to use for a given mode.  Defaults to the value of
!      `HAVE_POST_DECREMENT'.
  
   -- Macro: USE_LOAD_PRE_INCREMENT (MODE)
       A C expression used to determine whether a load preincrement is a
       good thing to use for a given mode.  Defaults to the value of
!      `HAVE_PRE_INCREMENT'.
  
   -- Macro: USE_LOAD_PRE_DECREMENT (MODE)
       A C expression used to determine whether a load predecrement is a
       good thing to use for a given mode.  Defaults to the value of
!      `HAVE_PRE_DECREMENT'.
  
   -- Macro: USE_STORE_POST_INCREMENT (MODE)
!      A C expression used to determine whether a store postincrement is
!      a good thing to use for a given mode.  Defaults to the value of
!      `HAVE_POST_INCREMENT'.
  
   -- Macro: USE_STORE_POST_DECREMENT (MODE)
!      A C expression used to determine whether a store postdecrement is
!      a good thing to use for a given mode.  Defaults to the value of
!      `HAVE_POST_DECREMENT'.
  
   -- Macro: USE_STORE_PRE_INCREMENT (MODE)
       This macro is used to determine whether a store preincrement is a
       good thing to use for a given mode.  Defaults to the value of
!      `HAVE_PRE_INCREMENT'.
  
   -- Macro: USE_STORE_PRE_DECREMENT (MODE)
       This macro is used to determine whether a store predecrement is a
       good thing to use for a given mode.  Defaults to the value of
!      `HAVE_PRE_DECREMENT'.
  
   -- Macro: NO_FUNCTION_CSE
       Define this macro if it is as good or better to call a constant
--- 33364,33410 ----
       The parameter SPEED is true if the code is currently being
       optimized for speed rather than size.
  
!      If you don't define this, it defaults to the value of 'MOVE_RATIO'.
  
   -- Macro: USE_LOAD_POST_INCREMENT (MODE)
       A C expression used to determine whether a load postincrement is a
       good thing to use for a given mode.  Defaults to the value of
!      'HAVE_POST_INCREMENT'.
  
   -- Macro: USE_LOAD_POST_DECREMENT (MODE)
       A C expression used to determine whether a load postdecrement is a
       good thing to use for a given mode.  Defaults to the value of
!      'HAVE_POST_DECREMENT'.
  
   -- Macro: USE_LOAD_PRE_INCREMENT (MODE)
       A C expression used to determine whether a load preincrement is a
       good thing to use for a given mode.  Defaults to the value of
!      'HAVE_PRE_INCREMENT'.
  
   -- Macro: USE_LOAD_PRE_DECREMENT (MODE)
       A C expression used to determine whether a load predecrement is a
       good thing to use for a given mode.  Defaults to the value of
!      'HAVE_PRE_DECREMENT'.
  
   -- Macro: USE_STORE_POST_INCREMENT (MODE)
!      A C expression used to determine whether a store postincrement is a
!      good thing to use for a given mode.  Defaults to the value of
!      'HAVE_POST_INCREMENT'.
  
   -- Macro: USE_STORE_POST_DECREMENT (MODE)
!      A C expression used to determine whether a store postdecrement is a
!      good thing to use for a given mode.  Defaults to the value of
!      'HAVE_POST_DECREMENT'.
  
   -- Macro: USE_STORE_PRE_INCREMENT (MODE)
       This macro is used to determine whether a store preincrement is a
       good thing to use for a given mode.  Defaults to the value of
!      'HAVE_PRE_INCREMENT'.
  
   -- Macro: USE_STORE_PRE_DECREMENT (MODE)
       This macro is used to determine whether a store predecrement is a
       good thing to use for a given mode.  Defaults to the value of
!      'HAVE_PRE_DECREMENT'.
  
   -- Macro: NO_FUNCTION_CSE
       Define this macro if it is as good or better to call a constant
*************** ordinarily expect.
*** 33819,33868 ****
  
   -- Macro: LOGICAL_OP_NON_SHORT_CIRCUIT
       Define this macro if a non-short-circuit operation produced by
!      `fold_range_test ()' is optimal.  This macro defaults to true if
!      `BRANCH_COST' is greater than or equal to the value 2.
  
!  -- Target Hook: bool TARGET_RTX_COSTS (rtx X, int CODE, int
!           OUTER_CODE, int OPNO, int *TOTAL, bool SPEED)
       This target hook describes the relative costs of RTL expressions.
  
       The cost may depend on the precise form of the expression, which is
       available for examination in X, and the fact that X appears as
       operand OPNO of an expression with rtx code OUTER_CODE.  That is,
!      the hook can assume that there is some rtx Y such that `GET_CODE
!      (Y) == OUTER_CODE' and such that either (a) `XEXP (Y, OPNO) == X'
!      or (b) `XVEC (Y, OPNO)' contains X.
  
       CODE is X's expression code--redundant, since it can be obtained
!      with `GET_CODE (X)'.
  
!      In implementing this hook, you can use the construct
!      `COSTS_N_INSNS (N)' to specify a cost equal to N fast instructions.
  
!      On entry to the hook, `*TOTAL' contains a default estimate for the
       cost of the expression.  The hook should modify this value as
!      necessary.  Traditionally, the default costs are `COSTS_N_INSNS
!      (5)' for multiplications, `COSTS_N_INSNS (7)' for division and
!      modulus operations, and `COSTS_N_INSNS (1)' for all other
       operations.
  
!      When optimizing for code size, i.e. when `speed' is false, this
!      target hook should be used to estimate the relative size cost of
!      an expression, again relative to `COSTS_N_INSNS'.
  
       The hook returns true when all subexpressions of X have been
!      processed, and false when `rtx_cost' should recurse.
  
   -- Target Hook: int TARGET_ADDRESS_COST (rtx ADDRESS, machine_mode
            MODE, addr_space_t AS, bool SPEED)
       This hook computes the cost of an addressing mode that contains
       ADDRESS.  If not defined, the cost is computed from the ADDRESS
!      expression and the `TARGET_RTX_COST' hook.
  
!      For most CISC machines, the default cost is a good approximation
!      of the true cost of the addressing mode.  However, on RISC
!      machines, all instructions normally have the same length and
!      execution time.  Hence all addresses will have equal costs.
  
       In cases where more than one form of an address is known, the form
       with the lowest cost will be used.  If multiple forms have the
--- 33412,33461 ----
  
   -- Macro: LOGICAL_OP_NON_SHORT_CIRCUIT
       Define this macro if a non-short-circuit operation produced by
!      'fold_range_test ()' is optimal.  This macro defaults to true if
!      'BRANCH_COST' is greater than or equal to the value 2.
  
!  -- Target Hook: bool TARGET_RTX_COSTS (rtx X, int CODE, int OUTER_CODE,
!           int OPNO, int *TOTAL, bool SPEED)
       This target hook describes the relative costs of RTL expressions.
  
       The cost may depend on the precise form of the expression, which is
       available for examination in X, and the fact that X appears as
       operand OPNO of an expression with rtx code OUTER_CODE.  That is,
!      the hook can assume that there is some rtx Y such that 'GET_CODE
!      (Y) == OUTER_CODE' and such that either (a) 'XEXP (Y, OPNO) == X'
!      or (b) 'XVEC (Y, OPNO)' contains X.
  
       CODE is X's expression code--redundant, since it can be obtained
!      with 'GET_CODE (X)'.
  
!      In implementing this hook, you can use the construct 'COSTS_N_INSNS
!      (N)' to specify a cost equal to N fast instructions.
  
!      On entry to the hook, '*TOTAL' contains a default estimate for the
       cost of the expression.  The hook should modify this value as
!      necessary.  Traditionally, the default costs are 'COSTS_N_INSNS
!      (5)' for multiplications, 'COSTS_N_INSNS (7)' for division and
!      modulus operations, and 'COSTS_N_INSNS (1)' for all other
       operations.
  
!      When optimizing for code size, i.e. when 'speed' is false, this
!      target hook should be used to estimate the relative size cost of an
!      expression, again relative to 'COSTS_N_INSNS'.
  
       The hook returns true when all subexpressions of X have been
!      processed, and false when 'rtx_cost' should recurse.
  
   -- Target Hook: int TARGET_ADDRESS_COST (rtx ADDRESS, machine_mode
            MODE, addr_space_t AS, bool SPEED)
       This hook computes the cost of an addressing mode that contains
       ADDRESS.  If not defined, the cost is computed from the ADDRESS
!      expression and the 'TARGET_RTX_COST' hook.
  
!      For most CISC machines, the default cost is a good approximation of
!      the true cost of the addressing mode.  However, on RISC machines,
!      all instructions normally have the same length and execution time.
!      Hence all addresses will have equal costs.
  
       In cases where more than one form of an address is known, the form
       with the lowest cost will be used.  If multiple forms have the
*************** ordinarily expect.
*** 33874,33894 ****
       register and memory references will be indirect through that
       register.  On machines where the cost of the addressing mode
       containing the sum is no higher than that of a simple indirect
!      reference, this will produce an additional instruction and
!      possibly require an additional register.  Proper specification of
!      this macro eliminates this overhead for such machines.
  
       This hook is never called with an invalid address.
  
       On machines where an address involving more than one register is as
       cheap as an address computation involving only one register,
!      defining `TARGET_ADDRESS_COST' to reflect this can cause two
       registers to be live over a region of code where only one would
!      have been if `TARGET_ADDRESS_COST' were not defined in that
!      manner.  This effect should be considered in the definition of
!      this macro.  Equivalent costs should probably only be given to
!      addresses with different numbers of registers on machines with
!      lots of registers.
  
  
  File: gccint.info,  Node: Scheduling,  Next: Sections,  Prev: Costs,  Up: Target Macros
--- 33467,33486 ----
       register and memory references will be indirect through that
       register.  On machines where the cost of the addressing mode
       containing the sum is no higher than that of a simple indirect
!      reference, this will produce an additional instruction and possibly
!      require an additional register.  Proper specification of this macro
!      eliminates this overhead for such machines.
  
       This hook is never called with an invalid address.
  
       On machines where an address involving more than one register is as
       cheap as an address computation involving only one register,
!      defining 'TARGET_ADDRESS_COST' to reflect this can cause two
       registers to be live over a region of code where only one would
!      have been if 'TARGET_ADDRESS_COST' were not defined in that manner.
!      This effect should be considered in the definition of this macro.
!      Equivalent costs should probably only be given to addresses with
!      different numbers of registers on machines with lots of registers.
  
  
  File: gccint.info,  Node: Scheduling,  Next: Sections,  Prev: Costs,  Up: Target Macros
*************** them: try the first ones in this list fi
*** 33907,33932 ****
       Although the insn scheduler can define itself the possibility of
       issue an insn on the same cycle, the value can serve as an
       additional constraint to issue insns on the same simulated
!      processor cycle (see hooks `TARGET_SCHED_REORDER' and
!      `TARGET_SCHED_REORDER2').  This value must be constant over the
       entire compilation.  If you need it to vary depending on what the
!      instructions are, you must use `TARGET_SCHED_VARIABLE_ISSUE'.
  
   -- Target Hook: int TARGET_SCHED_VARIABLE_ISSUE (FILE *FILE, int
            VERBOSE, rtx_insn *INSN, int MORE)
       This hook is executed by the scheduler after it has scheduled an
       insn from the ready list.  It should return the number of insns
       which can still be issued in the current cycle.  The default is
!      `MORE - 1' for insns other than `CLOBBER' and `USE', which
!      normally are not counted against the issue rate.  You should
!      define this hook if some insns take more machine resources than
!      others, so that fewer insns can follow them in the same cycle.
!      FILE is either a null pointer, or a stdio stream to write any
!      debug output to.  VERBOSE is the verbose level provided by
!      `-fsched-verbose-N'.  INSN is the instruction that was scheduled.
  
!  -- Target Hook: int TARGET_SCHED_ADJUST_COST (rtx_insn *INSN, rtx
!           LINK, rtx_insn *DEP_INSN, int COST)
       This function corrects the value of COST based on the relationship
       between INSN and DEP_INSN through the dependence LINK.  It should
       return the new value.  The default is to make no adjustment to
--- 33499,33524 ----
       Although the insn scheduler can define itself the possibility of
       issue an insn on the same cycle, the value can serve as an
       additional constraint to issue insns on the same simulated
!      processor cycle (see hooks 'TARGET_SCHED_REORDER' and
!      'TARGET_SCHED_REORDER2').  This value must be constant over the
       entire compilation.  If you need it to vary depending on what the
!      instructions are, you must use 'TARGET_SCHED_VARIABLE_ISSUE'.
  
   -- Target Hook: int TARGET_SCHED_VARIABLE_ISSUE (FILE *FILE, int
            VERBOSE, rtx_insn *INSN, int MORE)
       This hook is executed by the scheduler after it has scheduled an
       insn from the ready list.  It should return the number of insns
       which can still be issued in the current cycle.  The default is
!      'MORE - 1' for insns other than 'CLOBBER' and 'USE', which normally
!      are not counted against the issue rate.  You should define this
!      hook if some insns take more machine resources than others, so that
!      fewer insns can follow them in the same cycle.  FILE is either a
!      null pointer, or a stdio stream to write any debug output to.
!      VERBOSE is the verbose level provided by '-fsched-verbose-N'.  INSN
!      is the instruction that was scheduled.
  
!  -- Target Hook: int TARGET_SCHED_ADJUST_COST (rtx_insn *INSN, rtx LINK,
!           rtx_insn *DEP_INSN, int COST)
       This function corrects the value of COST based on the relationship
       between INSN and DEP_INSN through the dependence LINK.  It should
       return the new value.  The default is to make no adjustment to
*************** them: try the first ones in this list fi
*** 33942,33980 ****
  
   -- Target Hook: int TARGET_SCHED_ADJUST_PRIORITY (rtx_insn *INSN, int
            PRIORITY)
!      This hook adjusts the integer scheduling priority PRIORITY of
!      INSN.  It should return the new priority.  Increase the priority to
       execute INSN earlier, reduce the priority to execute INSN later.
!      Do not define this hook if you do not need to adjust the
!      scheduling priorities of insns.
  
   -- Target Hook: int TARGET_SCHED_REORDER (FILE *FILE, int VERBOSE,
            rtx_insn **READY, int *N_READYP, int CLOCK)
       This hook is executed by the scheduler after it has scheduled the
       ready list, to allow the machine description to reorder it (for
!      example to combine two small instructions together on `VLIW'
       machines).  FILE is either a null pointer, or a stdio stream to
       write any debug output to.  VERBOSE is the verbose level provided
!      by `-fsched-verbose-N'.  READY is a pointer to the ready list of
!      instructions that are ready to be scheduled.  N_READYP is a
!      pointer to the number of elements in the ready list.  The scheduler
!      reads the ready list in reverse order, starting with
!      READY[*N_READYP - 1] and going to READY[0].  CLOCK is the timer
!      tick of the scheduler.  You may modify the ready list and the
!      number of ready insns.  The return value is the number of insns
!      that can issue this cycle; normally this is just `issue_rate'.
!      See also `TARGET_SCHED_REORDER2'.
  
   -- Target Hook: int TARGET_SCHED_REORDER2 (FILE *FILE, int VERBOSE,
            rtx_insn **READY, int *N_READYP, int CLOCK)
!      Like `TARGET_SCHED_REORDER', but called at a different time.  That
!      function is called whenever the scheduler starts a new cycle.
!      This one is called once per iteration over a cycle, immediately
!      after `TARGET_SCHED_VARIABLE_ISSUE'; it can reorder the ready list
!      and return the number of insns to be scheduled in the same cycle.
       Defining this hook can be useful if there are frequent situations
!      where scheduling one insn causes other insns to become ready in
!      the same cycle.  These other insns can then be taken into account
       properly.
  
   -- Target Hook: bool TARGET_SCHED_MACRO_FUSION_P (void)
--- 33534,33572 ----
  
   -- Target Hook: int TARGET_SCHED_ADJUST_PRIORITY (rtx_insn *INSN, int
            PRIORITY)
!      This hook adjusts the integer scheduling priority PRIORITY of INSN.
!      It should return the new priority.  Increase the priority to
       execute INSN earlier, reduce the priority to execute INSN later.
!      Do not define this hook if you do not need to adjust the scheduling
!      priorities of insns.
  
   -- Target Hook: int TARGET_SCHED_REORDER (FILE *FILE, int VERBOSE,
            rtx_insn **READY, int *N_READYP, int CLOCK)
       This hook is executed by the scheduler after it has scheduled the
       ready list, to allow the machine description to reorder it (for
!      example to combine two small instructions together on 'VLIW'
       machines).  FILE is either a null pointer, or a stdio stream to
       write any debug output to.  VERBOSE is the verbose level provided
!      by '-fsched-verbose-N'.  READY is a pointer to the ready list of
!      instructions that are ready to be scheduled.  N_READYP is a pointer
!      to the number of elements in the ready list.  The scheduler reads
!      the ready list in reverse order, starting with READY[*N_READYP - 1]
!      and going to READY[0].  CLOCK is the timer tick of the scheduler.
!      You may modify the ready list and the number of ready insns.  The
!      return value is the number of insns that can issue this cycle;
!      normally this is just 'issue_rate'.  See also
!      'TARGET_SCHED_REORDER2'.
  
   -- Target Hook: int TARGET_SCHED_REORDER2 (FILE *FILE, int VERBOSE,
            rtx_insn **READY, int *N_READYP, int CLOCK)
!      Like 'TARGET_SCHED_REORDER', but called at a different time.  That
!      function is called whenever the scheduler starts a new cycle.  This
!      one is called once per iteration over a cycle, immediately after
!      'TARGET_SCHED_VARIABLE_ISSUE'; it can reorder the ready list and
!      return the number of insns to be scheduled in the same cycle.
       Defining this hook can be useful if there are frequent situations
!      where scheduling one insn causes other insns to become ready in the
!      same cycle.  These other insns can then be taken into account
       properly.
  
   -- Target Hook: bool TARGET_SCHED_MACRO_FUSION_P (void)
*************** them: try the first ones in this list fi
*** 33984,33995 ****
   -- Target Hook: bool TARGET_SCHED_MACRO_FUSION_PAIR_P (rtx_insn *PREV,
            rtx_insn *CURR)
       This hook is used to check whether two insns should be macro fused
!      for a target microarchitecture. If this hook returns true for the
!      given insn pair (PREV and CURR), the scheduler will put them into
!      a sched group, and they will not be scheduled apart.  The two
!      insns will be either two SET insns or a compare and a conditional
!      jump and this hook should validate any dependencies needed to fuse
!      the two insns together.
  
   -- Target Hook: void TARGET_SCHED_DEPENDENCIES_EVALUATION_HOOK
            (rtx_insn *HEAD, rtx_insn *TAIL)
--- 33576,33587 ----
   -- Target Hook: bool TARGET_SCHED_MACRO_FUSION_PAIR_P (rtx_insn *PREV,
            rtx_insn *CURR)
       This hook is used to check whether two insns should be macro fused
!      for a target microarchitecture.  If this hook returns true for the
!      given insn pair (PREV and CURR), the scheduler will put them into a
!      sched group, and they will not be scheduled apart.  The two insns
!      will be either two SET insns or a compare and a conditional jump
!      and this hook should validate any dependencies needed to fuse the
!      two insns together.
  
   -- Target Hook: void TARGET_SCHED_DEPENDENCIES_EVALUATION_HOOK
            (rtx_insn *HEAD, rtx_insn *TAIL)
*************** them: try the first ones in this list fi
*** 34006,34039 ****
       This hook is executed by the scheduler at the beginning of each
       block of instructions that are to be scheduled.  FILE is either a
       null pointer, or a stdio stream to write any debug output to.
!      VERBOSE is the verbose level provided by `-fsched-verbose-N'.
       MAX_READY is the maximum number of insns in the current scheduling
       region that can be live at the same time.  This can be used to
       allocate scratch space if it is needed, e.g. by
!      `TARGET_SCHED_REORDER'.
  
   -- Target Hook: void TARGET_SCHED_FINISH (FILE *FILE, int VERBOSE)
       This hook is executed by the scheduler at the end of each block of
       instructions that are to be scheduled.  It can be used to perform
!      cleanup of any actions done by the other scheduling hooks.  FILE
!      is either a null pointer, or a stdio stream to write any debug
!      output to.  VERBOSE is the verbose level provided by
!      `-fsched-verbose-N'.
  
!  -- Target Hook: void TARGET_SCHED_INIT_GLOBAL (FILE *FILE, int
!           VERBOSE, int OLD_MAX_UID)
       This hook is executed by the scheduler after function level
       initializations.  FILE is either a null pointer, or a stdio stream
       to write any debug output to.  VERBOSE is the verbose level
!      provided by `-fsched-verbose-N'.  OLD_MAX_UID is the maximum insn
       uid when scheduling begins.
  
   -- Target Hook: void TARGET_SCHED_FINISH_GLOBAL (FILE *FILE, int
            VERBOSE)
       This is the cleanup hook corresponding to
!      `TARGET_SCHED_INIT_GLOBAL'.  FILE is either a null pointer, or a
       stdio stream to write any debug output to.  VERBOSE is the verbose
!      level provided by `-fsched-verbose-N'.
  
   -- Target Hook: rtx TARGET_SCHED_DFA_PRE_CYCLE_INSN (void)
       The hook returns an RTL insn.  The automaton state used in the
--- 33598,33630 ----
       This hook is executed by the scheduler at the beginning of each
       block of instructions that are to be scheduled.  FILE is either a
       null pointer, or a stdio stream to write any debug output to.
!      VERBOSE is the verbose level provided by '-fsched-verbose-N'.
       MAX_READY is the maximum number of insns in the current scheduling
       region that can be live at the same time.  This can be used to
       allocate scratch space if it is needed, e.g. by
!      'TARGET_SCHED_REORDER'.
  
   -- Target Hook: void TARGET_SCHED_FINISH (FILE *FILE, int VERBOSE)
       This hook is executed by the scheduler at the end of each block of
       instructions that are to be scheduled.  It can be used to perform
!      cleanup of any actions done by the other scheduling hooks.  FILE is
!      either a null pointer, or a stdio stream to write any debug output
!      to.  VERBOSE is the verbose level provided by '-fsched-verbose-N'.
  
!  -- Target Hook: void TARGET_SCHED_INIT_GLOBAL (FILE *FILE, int VERBOSE,
!           int OLD_MAX_UID)
       This hook is executed by the scheduler after function level
       initializations.  FILE is either a null pointer, or a stdio stream
       to write any debug output to.  VERBOSE is the verbose level
!      provided by '-fsched-verbose-N'.  OLD_MAX_UID is the maximum insn
       uid when scheduling begins.
  
   -- Target Hook: void TARGET_SCHED_FINISH_GLOBAL (FILE *FILE, int
            VERBOSE)
       This is the cleanup hook corresponding to
!      'TARGET_SCHED_INIT_GLOBAL'.  FILE is either a null pointer, or a
       stdio stream to write any debug output to.  VERBOSE is the verbose
!      level provided by '-fsched-verbose-N'.
  
   -- Target Hook: rtx TARGET_SCHED_DFA_PRE_CYCLE_INSN (void)
       The hook returns an RTL insn.  The automaton state used in the
*************** them: try the first ones in this list fi
*** 34041,34072 ****
       when the new simulated processor cycle starts.  Usage of the hook
       may simplify the automaton pipeline description for some VLIW
       processors.  If the hook is defined, it is used only for the
!      automaton based pipeline description.  The default is not to
!      change the state when the new simulated processor cycle starts.
  
   -- Target Hook: void TARGET_SCHED_INIT_DFA_PRE_CYCLE_INSN (void)
       The hook can be used to initialize data used by the previous hook.
  
   -- Target Hook: rtx_insn * TARGET_SCHED_DFA_POST_CYCLE_INSN (void)
!      The hook is analogous to `TARGET_SCHED_DFA_PRE_CYCLE_INSN' but used
       to changed the state as if the insn were scheduled when the new
       simulated processor cycle finishes.
  
   -- Target Hook: void TARGET_SCHED_INIT_DFA_POST_CYCLE_INSN (void)
!      The hook is analogous to `TARGET_SCHED_INIT_DFA_PRE_CYCLE_INSN' but
       used to initialize data used by the previous hook.
  
   -- Target Hook: void TARGET_SCHED_DFA_PRE_ADVANCE_CYCLE (void)
!      The hook to notify target that the current simulated cycle is
!      about to finish.  The hook is analogous to
!      `TARGET_SCHED_DFA_PRE_CYCLE_INSN' but used to change the state in
       more complicated situations - e.g., when advancing state on a
       single insn is not enough.
  
   -- Target Hook: void TARGET_SCHED_DFA_POST_ADVANCE_CYCLE (void)
       The hook to notify target that new simulated cycle has just
       started.  The hook is analogous to
!      `TARGET_SCHED_DFA_POST_CYCLE_INSN' but used to change the state in
       more complicated situations - e.g., when advancing state on a
       single insn is not enough.
  
--- 33632,33663 ----
       when the new simulated processor cycle starts.  Usage of the hook
       may simplify the automaton pipeline description for some VLIW
       processors.  If the hook is defined, it is used only for the
!      automaton based pipeline description.  The default is not to change
!      the state when the new simulated processor cycle starts.
  
   -- Target Hook: void TARGET_SCHED_INIT_DFA_PRE_CYCLE_INSN (void)
       The hook can be used to initialize data used by the previous hook.
  
   -- Target Hook: rtx_insn * TARGET_SCHED_DFA_POST_CYCLE_INSN (void)
!      The hook is analogous to 'TARGET_SCHED_DFA_PRE_CYCLE_INSN' but used
       to changed the state as if the insn were scheduled when the new
       simulated processor cycle finishes.
  
   -- Target Hook: void TARGET_SCHED_INIT_DFA_POST_CYCLE_INSN (void)
!      The hook is analogous to 'TARGET_SCHED_INIT_DFA_PRE_CYCLE_INSN' but
       used to initialize data used by the previous hook.
  
   -- Target Hook: void TARGET_SCHED_DFA_PRE_ADVANCE_CYCLE (void)
!      The hook to notify target that the current simulated cycle is about
!      to finish.  The hook is analogous to
!      'TARGET_SCHED_DFA_PRE_CYCLE_INSN' but used to change the state in
       more complicated situations - e.g., when advancing state on a
       single insn is not enough.
  
   -- Target Hook: void TARGET_SCHED_DFA_POST_ADVANCE_CYCLE (void)
       The hook to notify target that new simulated cycle has just
       started.  The hook is analogous to
!      'TARGET_SCHED_DFA_POST_CYCLE_INSN' but used to change the state in
       more complicated situations - e.g., when advancing state on a
       single insn is not enough.
  
*************** them: try the first ones in this list fi
*** 34075,34087 ****
       This hook controls better choosing an insn from the ready insn
       queue for the DFA-based insn scheduler.  Usually the scheduler
       chooses the first insn from the queue.  If the hook returns a
!      positive value, an additional scheduler code tries all
!      permutations of `TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD
!      ()' subsequent ready insns to choose an insn whose issue will
!      result in maximal number of issued insns on the same cycle.  For
!      the VLIW processor, the code could actually solve the problem of
!      packing simple insns into the VLIW insn.  Of course, if the rules
!      of VLIW packing are described in the automaton.
  
       This code also could be used for superscalar RISC processors.  Let
       us consider a superscalar RISC processor with 3 pipelines.  Some
--- 33666,33678 ----
       This hook controls better choosing an insn from the ready insn
       queue for the DFA-based insn scheduler.  Usually the scheduler
       chooses the first insn from the queue.  If the hook returns a
!      positive value, an additional scheduler code tries all permutations
!      of 'TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD ()' subsequent
!      ready insns to choose an insn whose issue will result in maximal
!      number of issued insns on the same cycle.  For the VLIW processor,
!      the code could actually solve the problem of packing simple insns
!      into the VLIW insn.  Of course, if the rules of VLIW packing are
!      described in the automaton.
  
       This code also could be used for superscalar RISC processors.  Let
       us consider a superscalar RISC processor with 3 pipelines.  Some
*************** them: try the first ones in this list fi
*** 34099,34112 ****
       The default is no multipass scheduling.
  
   -- Target Hook: int
! TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD_GUARD (rtx_insn *INSN,
!           int READY_INDEX)
       This hook controls what insns from the ready insn queue will be
       considered for the multipass insn scheduling.  If the hook returns
       zero for INSN, the insn will be considered in multipass scheduling.
       Positive return values will remove INSN from consideration on the
!      current round of multipass scheduling.  Negative return values
!      will remove INSN from consideration for given number of cycles.
       Backends should be careful about returning non-zero for highest
       priority instruction at position 0 in the ready list.  READY_INDEX
       is passed to allow backends make correct judgements.
--- 33690,33704 ----
       The default is no multipass scheduling.
  
   -- Target Hook: int
!           TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD_GUARD
!           (rtx_insn *INSN, int READY_INDEX)
! 
       This hook controls what insns from the ready insn queue will be
       considered for the multipass insn scheduling.  If the hook returns
       zero for INSN, the insn will be considered in multipass scheduling.
       Positive return values will remove INSN from consideration on the
!      current round of multipass scheduling.  Negative return values will
!      remove INSN from consideration for given number of cycles.
       Backends should be careful about returning non-zero for highest
       priority instruction at position 0 in the ready list.  READY_INDEX
       is passed to allow backends make correct judgements.
*************** TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_L
*** 34122,34137 ****
   -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_ISSUE (void
            *DATA, signed char *READY_TRY, int N_READY, rtx_insn *INSN,
            const void *PREV_DATA)
!      This hook is called when multipass scheduling evaluates
!      instruction INSN.
  
   -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BACKTRACK
            (const void *DATA, signed char *READY_TRY, int N_READY)
!      This is called when multipass scheduling backtracks from
!      evaluation of an instruction.
  
!  -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_END (const
!           void *DATA)
       This hook notifies the target about the result of the concluded
       current round of multipass scheduling.
  
--- 33714,33729 ----
   -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_ISSUE (void
            *DATA, signed char *READY_TRY, int N_READY, rtx_insn *INSN,
            const void *PREV_DATA)
!      This hook is called when multipass scheduling evaluates instruction
!      INSN.
  
   -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BACKTRACK
            (const void *DATA, signed char *READY_TRY, int N_READY)
!      This is called when multipass scheduling backtracks from evaluation
!      of an instruction.
  
!  -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_END (const void
!           *DATA)
       This hook notifies the target about the result of the concluded
       current round of multipass scheduling.
  
*************** TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_L
*** 34159,34185 ****
  
   -- Target Hook: bool TARGET_SCHED_IS_COSTLY_DEPENDENCE (struct _dep
            *_DEP, int COST, int DISTANCE)
!      This hook is used to define which dependences are considered
!      costly by the target, so costly that it is not advisable to
!      schedule the insns that are involved in the dependence too close
!      to one another.  The parameters to this hook are as follows:  The
!      first parameter _DEP is the dependence being evaluated.  The
!      second parameter COST is the cost of the dependence as estimated
!      by the scheduler, and the third parameter DISTANCE is the distance
!      in cycles between the two insns.  The hook returns `true' if
!      considering the distance between the two insns the dependence
!      between them is considered costly by the target, and `false'
!      otherwise.
  
       Defining this hook can be useful in multiple-issue out-of-order
!      machines, where (a) it's practically hopeless to predict the
!      actual data/resource delays, however: (b) there's a better chance
!      to predict the actual grouping that will be formed, and (c)
!      correctly emulating the grouping can be very important.  In such
!      targets one may want to allow issuing dependent insns closer to
!      one another--i.e., closer than the dependence distance;  however,
!      not in cases of "costly dependences", which this hooks allows to
!      define.
  
   -- Target Hook: void TARGET_SCHED_H_I_D_EXTENDED (void)
       This hook is called by the insn scheduler after emitting a new
--- 33751,33775 ----
  
   -- Target Hook: bool TARGET_SCHED_IS_COSTLY_DEPENDENCE (struct _dep
            *_DEP, int COST, int DISTANCE)
!      This hook is used to define which dependences are considered costly
!      by the target, so costly that it is not advisable to schedule the
!      insns that are involved in the dependence too close to one another.
!      The parameters to this hook are as follows: The first parameter
!      _DEP is the dependence being evaluated.  The second parameter COST
!      is the cost of the dependence as estimated by the scheduler, and
!      the third parameter DISTANCE is the distance in cycles between the
!      two insns.  The hook returns 'true' if considering the distance
!      between the two insns the dependence between them is considered
!      costly by the target, and 'false' otherwise.
  
       Defining this hook can be useful in multiple-issue out-of-order
!      machines, where (a) it's practically hopeless to predict the actual
!      data/resource delays, however: (b) there's a better chance to
!      predict the actual grouping that will be formed, and (c) correctly
!      emulating the grouping can be very important.  In such targets one
!      may want to allow issuing dependent insns closer to one
!      another--i.e., closer than the dependence distance; however, not in
!      cases of "costly dependences", which this hooks allows to define.
  
   -- Target Hook: void TARGET_SCHED_H_I_D_EXTENDED (void)
       This hook is called by the insn scheduler after emitting a new
*************** TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_L
*** 34194,34209 ****
            CLEAN_P)
       Initialize store pointed to by TC to hold target scheduling
       context.  It CLEAN_P is true then initialize TC as if scheduler is
!      at the beginning of the block.  Otherwise, copy the current
!      context into TC.
  
   -- Target Hook: void TARGET_SCHED_SET_SCHED_CONTEXT (void *TC)
       Copy target scheduling context pointed to by TC to the current
       context.
  
   -- Target Hook: void TARGET_SCHED_CLEAR_SCHED_CONTEXT (void *TC)
!      Deallocate internal data in target scheduling context pointed to
!      by TC.
  
   -- Target Hook: void TARGET_SCHED_FREE_SCHED_CONTEXT (void *TC)
       Deallocate a store for target scheduling context pointed to by TC.
--- 33784,33799 ----
            CLEAN_P)
       Initialize store pointed to by TC to hold target scheduling
       context.  It CLEAN_P is true then initialize TC as if scheduler is
!      at the beginning of the block.  Otherwise, copy the current context
!      into TC.
  
   -- Target Hook: void TARGET_SCHED_SET_SCHED_CONTEXT (void *TC)
       Copy target scheduling context pointed to by TC to the current
       context.
  
   -- Target Hook: void TARGET_SCHED_CLEAR_SCHED_CONTEXT (void *TC)
!      Deallocate internal data in target scheduling context pointed to by
!      TC.
  
   -- Target Hook: void TARGET_SCHED_FREE_SCHED_CONTEXT (void *TC)
       Deallocate a store for target scheduling context pointed to by TC.
*************** TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_L
*** 34216,34237 ****
       has a speculative version and, in case of successful check, to
       generate that speculative pattern.  The hook should return 1, if
       the instruction has a speculative form, or -1, if it doesn't.
!      REQUEST describes the type of requested speculation.  If the
!      return value equals 1 then NEW_PAT is assigned the generated
!      speculative pattern.
  
   -- Target Hook: bool TARGET_SCHED_NEEDS_BLOCK_P (unsigned int
            DEP_STATUS)
       This hook is called by the insn scheduler during generation of
!      recovery code for INSN.  It should return `true', if the
       corresponding check instruction should branch to recovery code, or
!      `false' otherwise.
  
   -- Target Hook: rtx TARGET_SCHED_GEN_SPEC_CHECK (rtx_insn *INSN,
            rtx_insn *LABEL, unsigned int DS)
!      This hook is called by the insn scheduler to generate a pattern
!      for recovery check instruction.  If MUTATE_P is zero, then INSN is
!      a speculative instruction for which the check should be generated.
       LABEL is either a label of a basic block, where recovery code
       should be emitted, or a null pointer, when requested check doesn't
       branch to recovery code (a simple check).  If MUTATE_P is nonzero,
--- 33806,33827 ----
       has a speculative version and, in case of successful check, to
       generate that speculative pattern.  The hook should return 1, if
       the instruction has a speculative form, or -1, if it doesn't.
!      REQUEST describes the type of requested speculation.  If the return
!      value equals 1 then NEW_PAT is assigned the generated speculative
!      pattern.
  
   -- Target Hook: bool TARGET_SCHED_NEEDS_BLOCK_P (unsigned int
            DEP_STATUS)
       This hook is called by the insn scheduler during generation of
!      recovery code for INSN.  It should return 'true', if the
       corresponding check instruction should branch to recovery code, or
!      'false' otherwise.
  
   -- Target Hook: rtx TARGET_SCHED_GEN_SPEC_CHECK (rtx_insn *INSN,
            rtx_insn *LABEL, unsigned int DS)
!      This hook is called by the insn scheduler to generate a pattern for
!      recovery check instruction.  If MUTATE_P is zero, then INSN is a
!      speculative instruction for which the check should be generated.
       LABEL is either a label of a basic block, where recovery code
       should be emitted, or a null pointer, when requested check doesn't
       branch to recovery code (a simple check).  If MUTATE_P is nonzero,
*************** TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_L
*** 34239,34246 ****
       denoted by INSN should be generated.  In this case LABEL can't be
       null.
  
!  -- Target Hook: void TARGET_SCHED_SET_SCHED_FLAGS (struct
!           spec_info_def *SPEC_INFO)
       This hook is used by the insn scheduler to find out what features
       should be enabled/used.  The structure *SPEC_INFO should be filled
       in by the target.  The structure describes speculation types that
--- 33829,33836 ----
       denoted by INSN should be generated.  In this case LABEL can't be
       null.
  
!  -- Target Hook: void TARGET_SCHED_SET_SCHED_FLAGS (struct spec_info_def
!           *SPEC_INFO)
       This hook is used by the insn scheduler to find out what features
       should be enabled/used.  The structure *SPEC_INFO should be filled
       in by the target.  The structure describes speculation types that
*************** TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_L
*** 34250,34259 ****
       This hook is called by the swing modulo scheduler to calculate a
       resource-based lower bound which is based on the resources
       available in the machine and the resources required by each
!      instruction.  The target backend can use G to calculate such
!      bound.  A very simple lower bound will be used in case this hook
!      is not implemented: the total number of instructions divided by
!      the issue rate.
  
   -- Target Hook: bool TARGET_SCHED_DISPATCH (rtx_insn *INSN, int X)
       This hook is called by Haifa Scheduler.  It returns true if
--- 33840,33849 ----
       This hook is called by the swing modulo scheduler to calculate a
       resource-based lower bound which is based on the resources
       available in the machine and the resources required by each
!      instruction.  The target backend can use G to calculate such bound.
!      A very simple lower bound will be used in case this hook is not
!      implemented: the total number of instructions divided by the issue
!      rate.
  
   -- Target Hook: bool TARGET_SCHED_DISPATCH (rtx_insn *INSN, int X)
       This hook is called by Haifa Scheduler.  It returns true if
*************** TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_L
*** 34265,34284 ****
       specified in its second parameter.
  
   -- Target Hook: bool TARGET_SCHED_EXPOSED_PIPELINE
!      True if the processor has an exposed pipeline, which means that
!      not just the order of instructions is important for correctness
!      when scheduling, but also the latencies of operations.
  
!  -- Target Hook: int TARGET_SCHED_REASSOCIATION_WIDTH (unsigned int
!           OPC, machine_mode MODE)
       This hook is called by tree reassociator to determine a level of
       parallelism required in output calculations chain.
  
   -- Target Hook: void TARGET_SCHED_FUSION_PRIORITY (rtx_insn *INSN, int
            MAX_PRI, int *FUSION_PRI, int *PRI)
       This hook is called by scheduling fusion pass.  It calculates
!      fusion priorities for each instruction passed in by parameter.
!      The priorities are returned via pointer parameters.
  
       INSN is the instruction whose priorities need to be calculated.
       MAX_PRI is the maximum priority can be returned in any cases.
--- 33855,33874 ----
       specified in its second parameter.
  
   -- Target Hook: bool TARGET_SCHED_EXPOSED_PIPELINE
!      True if the processor has an exposed pipeline, which means that not
!      just the order of instructions is important for correctness when
!      scheduling, but also the latencies of operations.
  
!  -- Target Hook: int TARGET_SCHED_REASSOCIATION_WIDTH (unsigned int OPC,
!           machine_mode MODE)
       This hook is called by tree reassociator to determine a level of
       parallelism required in output calculations chain.
  
   -- Target Hook: void TARGET_SCHED_FUSION_PRIORITY (rtx_insn *INSN, int
            MAX_PRI, int *FUSION_PRI, int *PRI)
       This hook is called by scheduling fusion pass.  It calculates
!      fusion priorities for each instruction passed in by parameter.  The
!      priorities are returned via pointer parameters.
  
       INSN is the instruction whose priorities need to be calculated.
       MAX_PRI is the maximum priority can be returned in any cases.
*************** TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_L
*** 34287,34301 ****
       parameter through which INSN's priority should be calculated and
       returned.
  
!      Same FUSION_PRI should be returned for instructions which should
!      be scheduled together.  Different PRI should be returned for
       instructions with same FUSION_PRI.  FUSION_PRI is the major sort
!      key, PRI is the minor sort key.  All instructions will be
!      scheduled according to the two priorities.  All priorities
!      calculated should be between 0 (exclusive) and MAX_PRI
!      (inclusive).  To avoid false dependencies, FUSION_PRI of
!      instructions which need to be scheduled together should be smaller
!      than FUSION_PRI of irrelevant instructions.
  
       Given below example:
  
--- 33877,33891 ----
       parameter through which INSN's priority should be calculated and
       returned.
  
!      Same FUSION_PRI should be returned for instructions which should be
!      scheduled together.  Different PRI should be returned for
       instructions with same FUSION_PRI.  FUSION_PRI is the major sort
!      key, PRI is the minor sort key.  All instructions will be scheduled
!      according to the two priorities.  All priorities calculated should
!      be between 0 (exclusive) and MAX_PRI (inclusive).  To avoid false
!      dependencies, FUSION_PRI of instructions which need to be scheduled
!      together should be smaller than FUSION_PRI of irrelevant
!      instructions.
  
       Given below example:
  
*************** section", which holds initialized writab
*** 34359,34392 ****
  which holds uninitialized data.  Some systems have other kinds of
  sections.
  
!  `varasm.c' provides several well-known sections, such as
! `text_section', `data_section' and `bss_section'.  The normal way of
! controlling a `FOO_section' variable is to define the associated
! `FOO_SECTION_ASM_OP' macro, as described below.  The macros are only
! read once, when `varasm.c' initializes itself, so their values must be
  run-time constants.  They may however depend on command-line flags.
  
!  _Note:_ Some run-time files, such `crtstuff.c', also make use of the
! `FOO_SECTION_ASM_OP' macros, and expect them to be string literals.
  
   Some assemblers require a different string to be written every time a
  section is selected.  If your assembler falls into this category, you
! should define the `TARGET_ASM_INIT_SECTIONS' hook and use
! `get_unnamed_section' to set up the sections.
  
!  You must always create a `text_section', either by defining
! `TEXT_SECTION_ASM_OP' or by initializing `text_section' in
! `TARGET_ASM_INIT_SECTIONS'.  The same is true of `data_section' and
! `DATA_SECTION_ASM_OP'.  If you do not create a distinct
! `readonly_data_section', the default is to reuse `text_section'.
  
!  All the other `varasm.c' sections are optional, and are null if the
  target does not provide them.
  
   -- Macro: TEXT_SECTION_ASM_OP
       A C expression whose value is a string, including spacing,
!      containing the assembler operation that should precede
!      instructions and read-only data.  Normally `"\t.text"' is right.
  
   -- Macro: HOT_TEXT_SECTION_NAME
       If defined, a C string constant for the name of the section
--- 33949,33982 ----
  which holds uninitialized data.  Some systems have other kinds of
  sections.
  
!  'varasm.c' provides several well-known sections, such as
! 'text_section', 'data_section' and 'bss_section'.  The normal way of
! controlling a 'FOO_section' variable is to define the associated
! 'FOO_SECTION_ASM_OP' macro, as described below.  The macros are only
! read once, when 'varasm.c' initializes itself, so their values must be
  run-time constants.  They may however depend on command-line flags.
  
!  _Note:_ Some run-time files, such 'crtstuff.c', also make use of the
! 'FOO_SECTION_ASM_OP' macros, and expect them to be string literals.
  
   Some assemblers require a different string to be written every time a
  section is selected.  If your assembler falls into this category, you
! should define the 'TARGET_ASM_INIT_SECTIONS' hook and use
! 'get_unnamed_section' to set up the sections.
  
!  You must always create a 'text_section', either by defining
! 'TEXT_SECTION_ASM_OP' or by initializing 'text_section' in
! 'TARGET_ASM_INIT_SECTIONS'.  The same is true of 'data_section' and
! 'DATA_SECTION_ASM_OP'.  If you do not create a distinct
! 'readonly_data_section', the default is to reuse 'text_section'.
  
!  All the other 'varasm.c' sections are optional, and are null if the
  target does not provide them.
  
   -- Macro: TEXT_SECTION_ASM_OP
       A C expression whose value is a string, including spacing,
!      containing the assembler operation that should precede instructions
!      and read-only data.  Normally '"\t.text"' is right.
  
   -- Macro: HOT_TEXT_SECTION_NAME
       If defined, a C string constant for the name of the section
*************** target does not provide them.
*** 34401,34407 ****
   -- Macro: DATA_SECTION_ASM_OP
       A C expression whose value is a string, including spacing,
       containing the assembler operation to identify the following data
!      as writable initialized data.  Normally `"\t.data"' is right.
  
   -- Macro: SDATA_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
--- 33991,33997 ----
   -- Macro: DATA_SECTION_ASM_OP
       A C expression whose value is a string, including spacing,
       containing the assembler operation to identify the following data
!      as writable initialized data.  Normally '"\t.data"' is right.
  
   -- Macro: SDATA_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
*************** target does not provide them.
*** 34417,34425 ****
       If defined, a C expression whose value is a string, including
       spacing, containing the assembler operation to identify the
       following data as uninitialized global data.  If not defined, and
!      `ASM_OUTPUT_ALIGNED_BSS' not defined, uninitialized global data
!      will be output in the data section if `-fno-common' is passed,
!      otherwise `ASM_OUTPUT_COMMON' will be used.
  
   -- Macro: SBSS_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
--- 34007,34015 ----
       If defined, a C expression whose value is a string, including
       spacing, containing the assembler operation to identify the
       following data as uninitialized global data.  If not defined, and
!      'ASM_OUTPUT_ALIGNED_BSS' not defined, uninitialized global data
!      will be output in the data section if '-fno-common' is passed,
!      otherwise 'ASM_OUTPUT_COMMON' will be used.
  
   -- Macro: SBSS_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
*************** target does not provide them.
*** 34429,34447 ****
   -- Macro: TLS_COMMON_ASM_OP
       If defined, a C expression whose value is a string containing the
       assembler operation to identify the following data as thread-local
!      common data.  The default is `".tls_common"'.
  
   -- Macro: TLS_SECTION_ASM_FLAG
       If defined, a C expression whose value is a character constant
       containing the flag used to mark a section as a TLS section.  The
!      default is `'T''.
  
   -- Macro: INIT_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
       spacing, containing the assembler operation to identify the
       following data as initialization code.  If not defined, GCC will
       assume such a section does not exist.  This section has no
!      corresponding `init_section' variable; it is used entirely in
       runtime code.
  
   -- Macro: FINI_SECTION_ASM_OP
--- 34019,34037 ----
   -- Macro: TLS_COMMON_ASM_OP
       If defined, a C expression whose value is a string containing the
       assembler operation to identify the following data as thread-local
!      common data.  The default is '".tls_common"'.
  
   -- Macro: TLS_SECTION_ASM_FLAG
       If defined, a C expression whose value is a character constant
       containing the flag used to mark a section as a TLS section.  The
!      default is ''T''.
  
   -- Macro: INIT_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
       spacing, containing the assembler operation to identify the
       following data as initialization code.  If not defined, GCC will
       assume such a section does not exist.  This section has no
!      corresponding 'init_section' variable; it is used entirely in
       runtime code.
  
   -- Macro: FINI_SECTION_ASM_OP
*************** target does not provide them.
*** 34449,34504 ****
       spacing, containing the assembler operation to identify the
       following data as finalization code.  If not defined, GCC will
       assume such a section does not exist.  This section has no
!      corresponding `fini_section' variable; it is used entirely in
       runtime code.
  
   -- Macro: INIT_ARRAY_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
       spacing, containing the assembler operation to identify the
!      following data as part of the `.init_array' (or equivalent)
       section.  If not defined, GCC will assume such a section does not
!      exist.  Do not define both this macro and `INIT_SECTION_ASM_OP'.
  
   -- Macro: FINI_ARRAY_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
       spacing, containing the assembler operation to identify the
!      following data as part of the `.fini_array' (or equivalent)
       section.  If not defined, GCC will assume such a section does not
!      exist.  Do not define both this macro and `FINI_SECTION_ASM_OP'.
  
   -- Macro: CRT_CALL_STATIC_FUNCTION (SECTION_OP, FUNCTION)
       If defined, an ASM statement that switches to a different section
       via SECTION_OP, calls FUNCTION, and switches back to the text
!      section.  This is used in `crtstuff.c' if `INIT_SECTION_ASM_OP' or
!      `FINI_SECTION_ASM_OP' to calls to initialization and finalization
       functions from the init and fini sections.  By default, this macro
!      uses a simple function call.  Some ports need hand-crafted
!      assembly code to avoid dependencies on registers initialized in
!      the function prologue or to ensure that constant pools don't end
!      up too far way in the text section.
  
   -- Macro: TARGET_LIBGCC_SDATA_SECTION
       If defined, a string which names the section into which small
       variables defined in crtstuff and libgcc should go.  This is useful
       when the target has options for optimizing access to small data,
!      and you want the crtstuff and libgcc routines to be conservative
!      in what they expect of your application yet liberal in what your
!      application expects.  For example, for targets with a `.sdata'
!      section (like MIPS), you could compile crtstuff with `-G 0' so
!      that it doesn't require small data support from your application,
!      but use this macro to put small data into `.sdata' so that your
       application can access these variables whether it uses small data
       or not.
  
   -- Macro: FORCE_CODE_SECTION_ALIGN
       If defined, an ASM statement that aligns a code section to some
       arbitrary boundary.  This is used to force all fragments of the
!      `.init' and `.fini' sections to have to same alignment and thus
       prevent the linker from having to add any padding.
  
   -- Macro: JUMP_TABLES_IN_TEXT_SECTION
       Define this macro to be an expression with a nonzero value if jump
!      tables (for `tablejump' insns) should be output in the text
       section, along with the assembler instructions.  Otherwise, the
       readonly data section is used.
  
--- 34039,34094 ----
       spacing, containing the assembler operation to identify the
       following data as finalization code.  If not defined, GCC will
       assume such a section does not exist.  This section has no
!      corresponding 'fini_section' variable; it is used entirely in
       runtime code.
  
   -- Macro: INIT_ARRAY_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
       spacing, containing the assembler operation to identify the
!      following data as part of the '.init_array' (or equivalent)
       section.  If not defined, GCC will assume such a section does not
!      exist.  Do not define both this macro and 'INIT_SECTION_ASM_OP'.
  
   -- Macro: FINI_ARRAY_SECTION_ASM_OP
       If defined, a C expression whose value is a string, including
       spacing, containing the assembler operation to identify the
!      following data as part of the '.fini_array' (or equivalent)
       section.  If not defined, GCC will assume such a section does not
!      exist.  Do not define both this macro and 'FINI_SECTION_ASM_OP'.
  
   -- Macro: CRT_CALL_STATIC_FUNCTION (SECTION_OP, FUNCTION)
       If defined, an ASM statement that switches to a different section
       via SECTION_OP, calls FUNCTION, and switches back to the text
!      section.  This is used in 'crtstuff.c' if 'INIT_SECTION_ASM_OP' or
!      'FINI_SECTION_ASM_OP' to calls to initialization and finalization
       functions from the init and fini sections.  By default, this macro
!      uses a simple function call.  Some ports need hand-crafted assembly
!      code to avoid dependencies on registers initialized in the function
!      prologue or to ensure that constant pools don't end up too far way
!      in the text section.
  
   -- Macro: TARGET_LIBGCC_SDATA_SECTION
       If defined, a string which names the section into which small
       variables defined in crtstuff and libgcc should go.  This is useful
       when the target has options for optimizing access to small data,
!      and you want the crtstuff and libgcc routines to be conservative in
!      what they expect of your application yet liberal in what your
!      application expects.  For example, for targets with a '.sdata'
!      section (like MIPS), you could compile crtstuff with '-G 0' so that
!      it doesn't require small data support from your application, but
!      use this macro to put small data into '.sdata' so that your
       application can access these variables whether it uses small data
       or not.
  
   -- Macro: FORCE_CODE_SECTION_ALIGN
       If defined, an ASM statement that aligns a code section to some
       arbitrary boundary.  This is used to force all fragments of the
!      '.init' and '.fini' sections to have to same alignment and thus
       prevent the linker from having to add any padding.
  
   -- Macro: JUMP_TABLES_IN_TEXT_SECTION
       Define this macro to be an expression with a nonzero value if jump
!      tables (for 'tablejump' insns) should be output in the text
       section, along with the assembler instructions.  Otherwise, the
       readonly data section is used.
  
*************** target does not provide them.
*** 34507,34514 ****
  
   -- Target Hook: void TARGET_ASM_INIT_SECTIONS (void)
       Define this hook if you need to do something special to set up the
!      `varasm.c' sections, or if your target has some special sections
!      of its own that you need to create.
  
       GCC calls this hook after processing the command line, but before
       writing any assembly code, and before calling any of the
--- 34097,34104 ----
  
   -- Target Hook: void TARGET_ASM_INIT_SECTIONS (void)
       Define this hook if you need to do something special to set up the
!      'varasm.c' sections, or if your target has some special sections of
!      its own that you need to create.
  
       GCC calls this hook after processing the command line, but before
       writing any assembly code, and before calling any of the
*************** target does not provide them.
*** 34520,34601 ****
       should be placed in a read-write section; bit 0 should be set if
       local relocations should be placed in a read-write section.
  
!      The default version of this function returns 3 when `-fpic' is in
       effect, and 0 otherwise.  The hook is typically redefined when the
       target cannot support (some kinds of) dynamic relocations in
       read-only sections even in executables.
  
   -- Target Hook: section * TARGET_ASM_SELECT_SECTION (tree EXP, int
            RELOC, unsigned HOST_WIDE_INT ALIGN)
!      Return the section into which EXP should be placed.  You can
!      assume that EXP is either a `VAR_DECL' node or a constant of some
!      sort.  RELOC indicates whether the initial value of EXP requires
!      link-time relocations.  Bit 0 is set when variable contains local
!      relocations only, while bit 1 is set for global relocations.
!      ALIGN is the constant alignment in bits.
  
       The default version of this function takes care of putting
!      read-only variables in `readonly_data_section'.
  
       See also USE_SELECT_SECTION_FOR_FUNCTIONS.
  
   -- Macro: USE_SELECT_SECTION_FOR_FUNCTIONS
       Define this macro if you wish TARGET_ASM_SELECT_SECTION to be
!      called for `FUNCTION_DECL's as well as for variables and constants.
  
!      In the case of a `FUNCTION_DECL', RELOC will be zero if the
!      function has been determined to be likely to be called, and
!      nonzero if it is unlikely to be called.
  
   -- Target Hook: void TARGET_ASM_UNIQUE_SECTION (tree DECL, int RELOC)
!      Build up a unique section name, expressed as a `STRING_CST' node,
!      and assign it to `DECL_SECTION_NAME (DECL)'.  As with
!      `TARGET_ASM_SELECT_SECTION', RELOC indicates whether the initial
       value of EXP requires link-time relocations.
  
       The default version of this function appends the symbol name to the
       ELF section name that would normally be used for the symbol.  For
!      example, the function `foo' would be placed in `.text.foo'.
       Whatever the actual target object format, this is often good
       enough.
  
   -- Target Hook: section * TARGET_ASM_FUNCTION_RODATA_SECTION (tree
            DECL)
!      Return the readonly data section associated with
!      `DECL_SECTION_NAME (DECL)'.  The default version of this function
!      selects `.gnu.linkonce.r.name' if the function's section is
!      `.gnu.linkonce.t.name', `.rodata.name' if function is in
!      `.text.name', and the normal readonly-data section otherwise.
  
   -- Target Hook: const char * TARGET_ASM_MERGEABLE_RODATA_PREFIX
!      Usually, the compiler uses the prefix `".rodata"' to construct
       section names for mergeable constant data.  Define this macro to
       override the string if a different section name should be used.
  
   -- Target Hook: section * TARGET_ASM_TM_CLONE_TABLE_SECTION (void)
       Return the section that should be used for transactional memory
!      clone  tables.
  
   -- Target Hook: section * TARGET_ASM_SELECT_RTX_SECTION (machine_mode
            MODE, rtx X, unsigned HOST_WIDE_INT ALIGN)
!      Return the section into which a constant X, of mode MODE, should
!      be placed.  You can assume that X is some kind of constant in RTL.
!      The argument MODE is redundant except in the case of a `const_int'
       rtx.  ALIGN is the constant alignment in bits.
  
       The default version of this function takes care of putting symbolic
!      constants in `flag_pic' mode in `data_section' and everything else
!      in `readonly_data_section'.
  
!  -- Target Hook: tree TARGET_MANGLE_DECL_ASSEMBLER_NAME (tree DECL,
!           tree ID)
       Define this hook if you need to postprocess the assembler name
!      generated by target-independent code.  The ID provided to this
!      hook will be the computed name (e.g., the macro `DECL_NAME' of the
!      DECL in C, or the mangled name of the DECL in C++).  The return
!      value of the hook is an `IDENTIFIER_NODE' for the appropriate
!      mangled name on your target system.  The default implementation of
!      this hook just returns the ID provided.
  
   -- Target Hook: void TARGET_ENCODE_SECTION_INFO (tree DECL, rtx RTL,
            int NEW_DECL_P)
--- 34110,34191 ----
       should be placed in a read-write section; bit 0 should be set if
       local relocations should be placed in a read-write section.
  
!      The default version of this function returns 3 when '-fpic' is in
       effect, and 0 otherwise.  The hook is typically redefined when the
       target cannot support (some kinds of) dynamic relocations in
       read-only sections even in executables.
  
   -- Target Hook: section * TARGET_ASM_SELECT_SECTION (tree EXP, int
            RELOC, unsigned HOST_WIDE_INT ALIGN)
!      Return the section into which EXP should be placed.  You can assume
!      that EXP is either a 'VAR_DECL' node or a constant of some sort.
!      RELOC indicates whether the initial value of EXP requires link-time
!      relocations.  Bit 0 is set when variable contains local relocations
!      only, while bit 1 is set for global relocations.  ALIGN is the
!      constant alignment in bits.
  
       The default version of this function takes care of putting
!      read-only variables in 'readonly_data_section'.
  
       See also USE_SELECT_SECTION_FOR_FUNCTIONS.
  
   -- Macro: USE_SELECT_SECTION_FOR_FUNCTIONS
       Define this macro if you wish TARGET_ASM_SELECT_SECTION to be
!      called for 'FUNCTION_DECL's as well as for variables and constants.
  
!      In the case of a 'FUNCTION_DECL', RELOC will be zero if the
!      function has been determined to be likely to be called, and nonzero
!      if it is unlikely to be called.
  
   -- Target Hook: void TARGET_ASM_UNIQUE_SECTION (tree DECL, int RELOC)
!      Build up a unique section name, expressed as a 'STRING_CST' node,
!      and assign it to 'DECL_SECTION_NAME (DECL)'.  As with
!      'TARGET_ASM_SELECT_SECTION', RELOC indicates whether the initial
       value of EXP requires link-time relocations.
  
       The default version of this function appends the symbol name to the
       ELF section name that would normally be used for the symbol.  For
!      example, the function 'foo' would be placed in '.text.foo'.
       Whatever the actual target object format, this is often good
       enough.
  
   -- Target Hook: section * TARGET_ASM_FUNCTION_RODATA_SECTION (tree
            DECL)
!      Return the readonly data section associated with 'DECL_SECTION_NAME
!      (DECL)'.  The default version of this function selects
!      '.gnu.linkonce.r.name' if the function's section is
!      '.gnu.linkonce.t.name', '.rodata.name' if function is in
!      '.text.name', and the normal readonly-data section otherwise.
  
   -- Target Hook: const char * TARGET_ASM_MERGEABLE_RODATA_PREFIX
!      Usually, the compiler uses the prefix '".rodata"' to construct
       section names for mergeable constant data.  Define this macro to
       override the string if a different section name should be used.
  
   -- Target Hook: section * TARGET_ASM_TM_CLONE_TABLE_SECTION (void)
       Return the section that should be used for transactional memory
!      clone tables.
  
   -- Target Hook: section * TARGET_ASM_SELECT_RTX_SECTION (machine_mode
            MODE, rtx X, unsigned HOST_WIDE_INT ALIGN)
!      Return the section into which a constant X, of mode MODE, should be
!      placed.  You can assume that X is some kind of constant in RTL.
!      The argument MODE is redundant except in the case of a 'const_int'
       rtx.  ALIGN is the constant alignment in bits.
  
       The default version of this function takes care of putting symbolic
!      constants in 'flag_pic' mode in 'data_section' and everything else
!      in 'readonly_data_section'.
  
!  -- Target Hook: tree TARGET_MANGLE_DECL_ASSEMBLER_NAME (tree DECL, tree
!           ID)
       Define this hook if you need to postprocess the assembler name
!      generated by target-independent code.  The ID provided to this hook
!      will be the computed name (e.g., the macro 'DECL_NAME' of the DECL
!      in C, or the mangled name of the DECL in C++).  The return value of
!      the hook is an 'IDENTIFIER_NODE' for the appropriate mangled name
!      on your target system.  The default implementation of this hook
!      just returns the ID provided.
  
   -- Target Hook: void TARGET_ENCODE_SECTION_INFO (tree DECL, rtx RTL,
            int NEW_DECL_P)
*************** target does not provide them.
*** 34606,34667 ****
       The hook is executed immediately after rtl has been created for
       DECL, which may be a variable or function declaration or an entry
       in the constant pool.  In either case, RTL is the rtl in question.
!      Do _not_ use `DECL_RTL (DECL)' in this hook; that field may not
       have been initialized yet.
  
       In the case of a constant, it is safe to assume that the rtl is a
!      `mem' whose address is a `symbol_ref'.  Most decls will also have
       this form, but that is not guaranteed.  Global register variables,
!      for instance, will have a `reg' for their rtl.  (Normally the
!      right thing to do with such unusual rtl is leave it alone.)
  
!      The NEW_DECL_P argument will be true if this is the first time
!      that `TARGET_ENCODE_SECTION_INFO' has been invoked on this decl.
!      It will be false for subsequent invocations, which will happen for
       duplicate declarations.  Whether or not anything must be done for
       the duplicate declaration depends on whether the hook examines
!      `DECL_ATTRIBUTES'.  NEW_DECL_P is always true when the hook is
       called for a constant.
  
       The usual thing for this hook to do is to record flags in the
!      `symbol_ref', using `SYMBOL_REF_FLAG' or `SYMBOL_REF_FLAGS'.
       Historically, the name string was modified if it was necessary to
       encode more than one bit of information, but this practice is now
!      discouraged; use `SYMBOL_REF_FLAGS'.
  
!      The default definition of this hook, `default_encode_section_info'
!      in `varasm.c', sets a number of commonly-useful bits in
!      `SYMBOL_REF_FLAGS'.  Check whether the default does what you need
       before overriding it.
  
   -- Target Hook: const char * TARGET_STRIP_NAME_ENCODING (const char
            *NAME)
!      Decode NAME and return the real name part, sans the characters
!      that `TARGET_ENCODE_SECTION_INFO' may have added.
  
   -- Target Hook: bool TARGET_IN_SMALL_DATA_P (const_tree EXP)
       Returns true if EXP should be placed into a "small data" section.
       The default version of this hook always returns false.
  
   -- Target Hook: bool TARGET_HAVE_SRODATA_SECTION
!      Contains the value true if the target places read-only "small
!      data" into a separate section.  The default value is false.
  
   -- Target Hook: bool TARGET_PROFILE_BEFORE_PROLOGUE (void)
       It returns true if target wants profile code emitted before
       prologue.
  
       The default version of this hook use the target macro
!      `PROFILE_BEFORE_PROLOGUE'.
  
   -- Target Hook: bool TARGET_BINDS_LOCAL_P (const_tree EXP)
!      Returns true if EXP names an object for which name resolution
!      rules must resolve to the current "module" (dynamic shared library
!      or executable image).
  
       The default version of this hook implements the name resolution
!      rules for ELF, which has a looser model of global name binding
!      than other currently supported object file formats.
  
   -- Target Hook: bool TARGET_HAVE_TLS
       Contains the value true if the target supports thread-local
--- 34196,34257 ----
       The hook is executed immediately after rtl has been created for
       DECL, which may be a variable or function declaration or an entry
       in the constant pool.  In either case, RTL is the rtl in question.
!      Do _not_ use 'DECL_RTL (DECL)' in this hook; that field may not
       have been initialized yet.
  
       In the case of a constant, it is safe to assume that the rtl is a
!      'mem' whose address is a 'symbol_ref'.  Most decls will also have
       this form, but that is not guaranteed.  Global register variables,
!      for instance, will have a 'reg' for their rtl.  (Normally the right
!      thing to do with such unusual rtl is leave it alone.)
  
!      The NEW_DECL_P argument will be true if this is the first time that
!      'TARGET_ENCODE_SECTION_INFO' has been invoked on this decl.  It
!      will be false for subsequent invocations, which will happen for
       duplicate declarations.  Whether or not anything must be done for
       the duplicate declaration depends on whether the hook examines
!      'DECL_ATTRIBUTES'.  NEW_DECL_P is always true when the hook is
       called for a constant.
  
       The usual thing for this hook to do is to record flags in the
!      'symbol_ref', using 'SYMBOL_REF_FLAG' or 'SYMBOL_REF_FLAGS'.
       Historically, the name string was modified if it was necessary to
       encode more than one bit of information, but this practice is now
!      discouraged; use 'SYMBOL_REF_FLAGS'.
  
!      The default definition of this hook, 'default_encode_section_info'
!      in 'varasm.c', sets a number of commonly-useful bits in
!      'SYMBOL_REF_FLAGS'.  Check whether the default does what you need
       before overriding it.
  
   -- Target Hook: const char * TARGET_STRIP_NAME_ENCODING (const char
            *NAME)
!      Decode NAME and return the real name part, sans the characters that
!      'TARGET_ENCODE_SECTION_INFO' may have added.
  
   -- Target Hook: bool TARGET_IN_SMALL_DATA_P (const_tree EXP)
       Returns true if EXP should be placed into a "small data" section.
       The default version of this hook always returns false.
  
   -- Target Hook: bool TARGET_HAVE_SRODATA_SECTION
!      Contains the value true if the target places read-only "small data"
!      into a separate section.  The default value is false.
  
   -- Target Hook: bool TARGET_PROFILE_BEFORE_PROLOGUE (void)
       It returns true if target wants profile code emitted before
       prologue.
  
       The default version of this hook use the target macro
!      'PROFILE_BEFORE_PROLOGUE'.
  
   -- Target Hook: bool TARGET_BINDS_LOCAL_P (const_tree EXP)
!      Returns true if EXP names an object for which name resolution rules
!      must resolve to the current "module" (dynamic shared library or
!      executable image).
  
       The default version of this hook implements the name resolution
!      rules for ELF, which has a looser model of global name binding than
!      other currently supported object file formats.
  
   -- Target Hook: bool TARGET_HAVE_TLS
       Contains the value true if the target supports thread-local
*************** File: gccint.info,  Node: PIC,  Next: As
*** 34676,34684 ****
  This section describes macros that help implement generation of position
  independent code.  Simply defining these macros is not enough to
  generate valid PIC; you must also add support to the hook
! `TARGET_LEGITIMATE_ADDRESS_P' and to the macro `PRINT_OPERAND_ADDRESS',
! as well as `LEGITIMIZE_ADDRESS'.  You must modify the definition of
! `movsi' to do something appropriate when the source operand contains a
  symbolic address.  You may also need to alter the handling of switch
  statements so that they use relative addresses.
  
--- 34266,34274 ----
  This section describes macros that help implement generation of position
  independent code.  Simply defining these macros is not enough to
  generate valid PIC; you must also add support to the hook
! 'TARGET_LEGITIMATE_ADDRESS_P' and to the macro 'PRINT_OPERAND_ADDRESS',
! as well as 'LEGITIMIZE_ADDRESS'.  You must modify the definition of
! 'movsi' to do something appropriate when the source operand contains a
  symbolic address.  You may also need to alter the handling of switch
  statements so that they use relative addresses.
  
*************** statements so that they use relative add
*** 34690,34710 ****
       once, as with the stack pointer and frame pointer registers.  If
       this macro is not defined, it is up to the machine-dependent files
       to allocate such a register (if necessary).  Note that this
!      register must be fixed when in use (e.g.  when `flag_pic' is true).
  
   -- Macro: PIC_OFFSET_TABLE_REG_CALL_CLOBBERED
       A C expression that is nonzero if the register defined by
!      `PIC_OFFSET_TABLE_REGNUM' is clobbered by calls.  If not defined,
       the default is zero.  Do not define this macro if
!      `PIC_OFFSET_TABLE_REGNUM' is not defined.
  
   -- Macro: LEGITIMATE_PIC_OPERAND_P (X)
       A C expression that is nonzero if X is a legitimate immediate
       operand on the target machine when generating position independent
!      code.  You can assume that X satisfies `CONSTANT_P', so you need
       not check this.  You can also assume FLAG_PIC is true, so you need
       not check it either.  You need not define this macro if all
!      constants (including `SYMBOL_REF') can be immediate operands when
       generating position independent code.
  
  
--- 34280,34300 ----
       once, as with the stack pointer and frame pointer registers.  If
       this macro is not defined, it is up to the machine-dependent files
       to allocate such a register (if necessary).  Note that this
!      register must be fixed when in use (e.g. when 'flag_pic' is true).
  
   -- Macro: PIC_OFFSET_TABLE_REG_CALL_CLOBBERED
       A C expression that is nonzero if the register defined by
!      'PIC_OFFSET_TABLE_REGNUM' is clobbered by calls.  If not defined,
       the default is zero.  Do not define this macro if
!      'PIC_OFFSET_TABLE_REGNUM' is not defined.
  
   -- Macro: LEGITIMATE_PIC_OPERAND_P (X)
       A C expression that is nonzero if X is a legitimate immediate
       operand on the target machine when generating position independent
!      code.  You can assume that X satisfies 'CONSTANT_P', so you need
       not check this.  You can also assume FLAG_PIC is true, so you need
       not check it either.  You need not define this macro if all
!      constants (including 'SYMBOL_REF') can be immediate operands when
       generating position independent code.
  
  
*************** File: gccint.info,  Node: File Framework
*** 34742,34798 ****
  This describes the overall framework of an assembly file.
  
   -- Target Hook: void TARGET_ASM_FILE_START (void)
!      Output to `asm_out_file' any text which the assembler expects to
       find at the beginning of a file.  The default behavior is
       controlled by two flags, documented below.  Unless your target's
!      assembler is quite unusual, if you override the default, you
!      should call `default_file_start' at some point in your target
!      hook.  This lets other target files rely on these variables.
  
   -- Target Hook: bool TARGET_ASM_FILE_START_APP_OFF
!      If this flag is true, the text of the macro `ASM_APP_OFF' will be
       printed as the very first line in the assembly file, unless
!      `-fverbose-asm' is in effect.  (If that macro has been defined to
       the empty string, this variable has no effect.)  With the normal
!      definition of `ASM_APP_OFF', the effect is to notify the GNU
       assembler that it need not bother stripping comments or extra
       whitespace from its input.  This allows it to work a bit faster.
  
       The default is false.  You should not set it to true unless you
!      have verified that your port does not generate any extra
!      whitespace or comments that will cause GAS to issue errors in
!      NO_APP mode.
  
   -- Target Hook: bool TARGET_ASM_FILE_START_FILE_DIRECTIVE
!      If this flag is true, `output_file_directive' will be called for
!      the primary source file, immediately after printing `ASM_APP_OFF'
       (if that is enabled).  Most ELF assemblers expect this to be done.
       The default is false.
  
   -- Target Hook: void TARGET_ASM_FILE_END (void)
!      Output to `asm_out_file' any text which the assembler expects to
       find at the end of a file.  The default is to output nothing.
  
   -- Function: void file_end_indicate_exec_stack ()
!      Some systems use a common convention, the `.note.GNU-stack'
!      special section, to indicate whether or not an object file relies
!      on the stack being executable.  If your system uses this
!      convention, you should define `TARGET_ASM_FILE_END' to this
!      function.  If you need to do other things in that hook, have your
!      hook function call this function.
  
   -- Target Hook: void TARGET_ASM_LTO_START (void)
!      Output to `asm_out_file' any text which the assembler expects to
       find at the start of an LTO section.  The default is to output
       nothing.
  
   -- Target Hook: void TARGET_ASM_LTO_END (void)
!      Output to `asm_out_file' any text which the assembler expects to
       find at the end of an LTO section.  The default is to output
       nothing.
  
   -- Target Hook: void TARGET_ASM_CODE_END (void)
!      Output to `asm_out_file' any text which is needed before emitting
       unwind info and debug info at the end of a file.  Some targets emit
       here PIC setup thunks that cannot be emitted at the end of file,
       because they couldn't have unwind info then.  The default is to
--- 34332,34387 ----
  This describes the overall framework of an assembly file.
  
   -- Target Hook: void TARGET_ASM_FILE_START (void)
!      Output to 'asm_out_file' any text which the assembler expects to
       find at the beginning of a file.  The default behavior is
       controlled by two flags, documented below.  Unless your target's
!      assembler is quite unusual, if you override the default, you should
!      call 'default_file_start' at some point in your target hook.  This
!      lets other target files rely on these variables.
  
   -- Target Hook: bool TARGET_ASM_FILE_START_APP_OFF
!      If this flag is true, the text of the macro 'ASM_APP_OFF' will be
       printed as the very first line in the assembly file, unless
!      '-fverbose-asm' is in effect.  (If that macro has been defined to
       the empty string, this variable has no effect.)  With the normal
!      definition of 'ASM_APP_OFF', the effect is to notify the GNU
       assembler that it need not bother stripping comments or extra
       whitespace from its input.  This allows it to work a bit faster.
  
       The default is false.  You should not set it to true unless you
!      have verified that your port does not generate any extra whitespace
!      or comments that will cause GAS to issue errors in NO_APP mode.
  
   -- Target Hook: bool TARGET_ASM_FILE_START_FILE_DIRECTIVE
!      If this flag is true, 'output_file_directive' will be called for
!      the primary source file, immediately after printing 'ASM_APP_OFF'
       (if that is enabled).  Most ELF assemblers expect this to be done.
       The default is false.
  
   -- Target Hook: void TARGET_ASM_FILE_END (void)
!      Output to 'asm_out_file' any text which the assembler expects to
       find at the end of a file.  The default is to output nothing.
  
   -- Function: void file_end_indicate_exec_stack ()
!      Some systems use a common convention, the '.note.GNU-stack' special
!      section, to indicate whether or not an object file relies on the
!      stack being executable.  If your system uses this convention, you
!      should define 'TARGET_ASM_FILE_END' to this function.  If you need
!      to do other things in that hook, have your hook function call this
!      function.
  
   -- Target Hook: void TARGET_ASM_LTO_START (void)
!      Output to 'asm_out_file' any text which the assembler expects to
       find at the start of an LTO section.  The default is to output
       nothing.
  
   -- Target Hook: void TARGET_ASM_LTO_END (void)
!      Output to 'asm_out_file' any text which the assembler expects to
       find at the end of an LTO section.  The default is to output
       nothing.
  
   -- Target Hook: void TARGET_ASM_CODE_END (void)
!      Output to 'asm_out_file' any text which is needed before emitting
       unwind info and debug info at the end of a file.  Some targets emit
       here PIC setup thunks that cannot be emitted at the end of file,
       because they couldn't have unwind info then.  The default is to
*************** This describes the overall framework of
*** 34800,34819 ****
  
   -- Macro: ASM_COMMENT_START
       A C string constant describing how to begin a comment in the target
!      assembler language.  The compiler assumes that the comment will
!      end at the end of the line.
  
   -- Macro: ASM_APP_ON
!      A C string constant for text to be output before each `asm'
!      statement or group of consecutive ones.  Normally this is
!      `"#APP"', which is a comment that has no effect on most assemblers
!      but tells the GNU assembler that it must check the lines that
!      follow for all valid assembler constructs.
  
   -- Macro: ASM_APP_OFF
!      A C string constant for text to be output after each `asm'
       statement or group of consecutive ones.  Normally this is
!      `"#NO_APP"', which tells the GNU assembler to resume making the
       time-saving assumptions that are valid for ordinary compiler
       output.
  
--- 34389,34408 ----
  
   -- Macro: ASM_COMMENT_START
       A C string constant describing how to begin a comment in the target
!      assembler language.  The compiler assumes that the comment will end
!      at the end of the line.
  
   -- Macro: ASM_APP_ON
!      A C string constant for text to be output before each 'asm'
!      statement or group of consecutive ones.  Normally this is '"#APP"',
!      which is a comment that has no effect on most assemblers but tells
!      the GNU assembler that it must check the lines that follow for all
!      valid assembler constructs.
  
   -- Macro: ASM_APP_OFF
!      A C string constant for text to be output after each 'asm'
       statement or group of consecutive ones.  Normally this is
!      '"#NO_APP"', which tells the GNU assembler to resume making the
       time-saving assumptions that are valid for ordinary compiler
       output.
  
*************** This describes the overall framework of
*** 34831,34867 ****
       indicates that filename NAME is the current source file to the
       stdio stream FILE.
  
!      This target hook need not be defined if the standard form of
!      output for the file format in use is appropriate.
  
   -- Target Hook: void TARGET_ASM_OUTPUT_IDENT (const char *NAME)
!      Output a string based on NAME, suitable for the `#ident'
!      directive, or the equivalent directive or pragma in non-C-family
!      languages.  If this hook is not defined, nothing is output for the
!      `#ident'  directive.
  
   -- Macro: OUTPUT_QUOTED_STRING (STREAM, STRING)
       A C statement to output the string STRING to the stdio stream
!      STREAM.  If you do not call the function `output_quoted_string' in
!      your config files, GCC will only call it to output filenames to
!      the assembler source.  So you can use it to canonicalize the format
!      of the filename using this macro.
  
   -- Target Hook: void TARGET_ASM_NAMED_SECTION (const char *NAME,
            unsigned int FLAGS, tree DECL)
       Output assembly directives to switch to section NAME.  The section
       should have attributes as specified by FLAGS, which is a bit mask
!      of the `SECTION_*' flags defined in `output.h'.  If DECL is
!      non-NULL, it is the `VAR_DECL' or `FUNCTION_DECL' with which this
       section is associated.
  
   -- Target Hook: section * TARGET_ASM_FUNCTION_SECTION (tree DECL, enum
            node_frequency FREQ, bool STARTUP, bool EXIT)
!      Return preferred text (sub)section for function DECL.  Main
!      purpose of this function is to separate cold, normal and hot
!      functions. STARTUP is true when function is known to be used only
!      at startup (from static constructors or it is `main()').  EXIT is
!      true when function is known to be used only at exit (from static
       destructors).  Return NULL if function should go to default text
       section.
  
--- 34420,34456 ----
       indicates that filename NAME is the current source file to the
       stdio stream FILE.
  
!      This target hook need not be defined if the standard form of output
!      for the file format in use is appropriate.
  
   -- Target Hook: void TARGET_ASM_OUTPUT_IDENT (const char *NAME)
!      Output a string based on NAME, suitable for the '#ident' directive,
!      or the equivalent directive or pragma in non-C-family languages.
!      If this hook is not defined, nothing is output for the '#ident'
!      directive.
  
   -- Macro: OUTPUT_QUOTED_STRING (STREAM, STRING)
       A C statement to output the string STRING to the stdio stream
!      STREAM.  If you do not call the function 'output_quoted_string' in
!      your config files, GCC will only call it to output filenames to the
!      assembler source.  So you can use it to canonicalize the format of
!      the filename using this macro.
  
   -- Target Hook: void TARGET_ASM_NAMED_SECTION (const char *NAME,
            unsigned int FLAGS, tree DECL)
       Output assembly directives to switch to section NAME.  The section
       should have attributes as specified by FLAGS, which is a bit mask
!      of the 'SECTION_*' flags defined in 'output.h'.  If DECL is
!      non-NULL, it is the 'VAR_DECL' or 'FUNCTION_DECL' with which this
       section is associated.
  
   -- Target Hook: section * TARGET_ASM_FUNCTION_SECTION (tree DECL, enum
            node_frequency FREQ, bool STARTUP, bool EXIT)
!      Return preferred text (sub)section for function DECL.  Main purpose
!      of this function is to separate cold, normal and hot functions.
!      STARTUP is true when function is known to be used only at startup
!      (from static constructors or it is 'main()').  EXIT is true when
!      function is known to be used only at exit (from static
       destructors).  Return NULL if function should go to default text
       section.
  
*************** This describes the overall framework of
*** 34869,34900 ****
            *FILE, tree DECL, bool NEW_IS_COLD)
       Used by the target to emit any assembler directives or additional
       labels needed when a function is partitioned between different
!      sections.  Output should be written to FILE.  The function  decl
!      is available as DECL and the new section is `cold' if  NEW_IS_COLD
!      is `true'.
  
   -- Common Target Hook: bool TARGET_HAVE_NAMED_SECTIONS
       This flag is true if the target supports
!      `TARGET_ASM_NAMED_SECTION'.  It must not be modified by
       command-line option processing.
  
   -- Target Hook: bool TARGET_HAVE_SWITCHABLE_BSS_SECTIONS
       This flag is true if we can create zeroed data by switching to a
!      BSS section and then using `ASM_OUTPUT_SKIP' to allocate the space.
       This is true on most ELF targets.
  
   -- Target Hook: unsigned int TARGET_SECTION_TYPE_FLAGS (tree DECL,
            const char *NAME, int RELOC)
       Choose a set of section attributes for use by
!      `TARGET_ASM_NAMED_SECTION' based on a variable or function decl, a
       section name, and whether or not the declaration's initializer may
       contain runtime relocations.  DECL may be null, in which case
       read-write data should be assumed.
  
       The default version of this function handles choosing code vs data,
!      read-only vs read-write data, and `flag_pic'.  You should only
!      need to override this if your target has special flags that might
!      be set via `__attribute__'.
  
   -- Target Hook: int TARGET_ASM_RECORD_GCC_SWITCHES (print_switch_type
            TYPE, const char *TEXT)
--- 34458,34489 ----
            *FILE, tree DECL, bool NEW_IS_COLD)
       Used by the target to emit any assembler directives or additional
       labels needed when a function is partitioned between different
!      sections.  Output should be written to FILE.  The function decl is
!      available as DECL and the new section is 'cold' if NEW_IS_COLD is
!      'true'.
  
   -- Common Target Hook: bool TARGET_HAVE_NAMED_SECTIONS
       This flag is true if the target supports
!      'TARGET_ASM_NAMED_SECTION'.  It must not be modified by
       command-line option processing.
  
   -- Target Hook: bool TARGET_HAVE_SWITCHABLE_BSS_SECTIONS
       This flag is true if we can create zeroed data by switching to a
!      BSS section and then using 'ASM_OUTPUT_SKIP' to allocate the space.
       This is true on most ELF targets.
  
   -- Target Hook: unsigned int TARGET_SECTION_TYPE_FLAGS (tree DECL,
            const char *NAME, int RELOC)
       Choose a set of section attributes for use by
!      'TARGET_ASM_NAMED_SECTION' based on a variable or function decl, a
       section name, and whether or not the declaration's initializer may
       contain runtime relocations.  DECL may be null, in which case
       read-write data should be assumed.
  
       The default version of this function handles choosing code vs data,
!      read-only vs read-write data, and 'flag_pic'.  You should only need
!      to override this if your target has special flags that might be set
!      via '__attribute__'.
  
   -- Target Hook: int TARGET_ASM_RECORD_GCC_SWITCHES (print_switch_type
            TYPE, const char *TEXT)
*************** This describes the overall framework of
*** 34903,34934 ****
       are enabled.  The TYPE argument specifies what is being recorded.
       It can take the following values:
  
!     `SWITCH_TYPE_PASSED'
            TEXT is a command line switch that has been set by the user.
  
!     `SWITCH_TYPE_ENABLED'
            TEXT is an option which has been enabled.  This might be as a
            direct result of a command line switch, or because it is
            enabled by default or because it has been enabled as a side
            effect of a different command line switch.  For example, the
!           `-O2' switch enables various different individual
!           optimization passes.
  
!     `SWITCH_TYPE_DESCRIPTIVE'
            TEXT is either NULL or some descriptive text which should be
            ignored.  If TEXT is NULL then it is being used to warn the
            target hook that either recording is starting or ending.  The
            first time TYPE is SWITCH_TYPE_DESCRIPTIVE and TEXT is NULL,
!           the warning is for start up and the second time the warning
!           is for wind down.  This feature is to allow the target hook
!           to make any necessary preparations before it starts to record
            switches and to perform any necessary tidying up after it has
            finished recording switches.
  
!     `SWITCH_TYPE_LINE_START'
            This option can be ignored by this target hook.
  
!     `SWITCH_TYPE_LINE_END'
            This option can be ignored by this target hook.
  
       The hook's return value must be zero.  Other return values may be
--- 34492,34523 ----
       are enabled.  The TYPE argument specifies what is being recorded.
       It can take the following values:
  
!      'SWITCH_TYPE_PASSED'
            TEXT is a command line switch that has been set by the user.
  
!      'SWITCH_TYPE_ENABLED'
            TEXT is an option which has been enabled.  This might be as a
            direct result of a command line switch, or because it is
            enabled by default or because it has been enabled as a side
            effect of a different command line switch.  For example, the
!           '-O2' switch enables various different individual optimization
!           passes.
  
!      'SWITCH_TYPE_DESCRIPTIVE'
            TEXT is either NULL or some descriptive text which should be
            ignored.  If TEXT is NULL then it is being used to warn the
            target hook that either recording is starting or ending.  The
            first time TYPE is SWITCH_TYPE_DESCRIPTIVE and TEXT is NULL,
!           the warning is for start up and the second time the warning is
!           for wind down.  This feature is to allow the target hook to
!           make any necessary preparations before it starts to record
            switches and to perform any necessary tidying up after it has
            finished recording switches.
  
!      'SWITCH_TYPE_LINE_START'
            This option can be ignored by this target hook.
  
!      'SWITCH_TYPE_LINE_END'
            This option can be ignored by this target hook.
  
       The hook's return value must be zero.  Other return values may be
*************** This describes the overall framework of
*** 34939,34949 ****
       it records the switches as ASCII text inside a new, string
       mergeable section in the assembler output file.  The name of the
       new section is provided by the
!      `TARGET_ASM_RECORD_GCC_SWITCHES_SECTION' target hook.
  
   -- Target Hook: const char * TARGET_ASM_RECORD_GCC_SWITCHES_SECTION
       This is the name of the section that will be created by the example
!      ELF implementation of the `TARGET_ASM_RECORD_GCC_SWITCHES' target
       hook.
  
  
--- 34528,34538 ----
       it records the switches as ASCII text inside a new, string
       mergeable section in the assembler output file.  The name of the
       new section is provided by the
!      'TARGET_ASM_RECORD_GCC_SWITCHES_SECTION' target hook.
  
   -- Target Hook: const char * TARGET_ASM_RECORD_GCC_SWITCHES_SECTION
       This is the name of the section that will be created by the example
!      ELF implementation of the 'TARGET_ASM_RECORD_GCC_SWITCHES' target
       hook.
  
  
*************** File: gccint.info,  Node: Data Output,
*** 34962,34971 ****
   -- Target Hook: const char * TARGET_ASM_UNALIGNED_DI_OP
   -- Target Hook: const char * TARGET_ASM_UNALIGNED_TI_OP
       These hooks specify assembly directives for creating certain kinds
!      of integer object.  The `TARGET_ASM_BYTE_OP' directive creates a
!      byte-sized object, the `TARGET_ASM_ALIGNED_HI_OP' one creates an
       aligned two-byte object, and so on.  Any of the hooks may be
!      `NULL', indicating that no suitable directive is available.
  
       The compiler will print these strings at the start of a new line,
       followed immediately by the object's initial value.  In most cases,
--- 34551,34560 ----
   -- Target Hook: const char * TARGET_ASM_UNALIGNED_DI_OP
   -- Target Hook: const char * TARGET_ASM_UNALIGNED_TI_OP
       These hooks specify assembly directives for creating certain kinds
!      of integer object.  The 'TARGET_ASM_BYTE_OP' directive creates a
!      byte-sized object, the 'TARGET_ASM_ALIGNED_HI_OP' one creates an
       aligned two-byte object, and so on.  Any of the hooks may be
!      'NULL', indicating that no suitable directive is available.
  
       The compiler will print these strings at the start of a new line,
       followed immediately by the object's initial value.  In most cases,
*************** File: gccint.info,  Node: Data Output,
*** 34973,34988 ****
  
   -- Target Hook: bool TARGET_ASM_INTEGER (rtx X, unsigned int SIZE, int
            ALIGNED_P)
!      The `assemble_integer' function uses this hook to output an
!      integer object.  X is the object's value, SIZE is its size in
!      bytes and ALIGNED_P indicates whether it is aligned.  The function
!      should return `true' if it was able to output the object.  If it
!      returns false, `assemble_integer' will try to split the object
!      into smaller parts.
  
       The default implementation of this hook will use the
!      `TARGET_ASM_BYTE_OP' family of strings, returning `false' when the
!      relevant string is `NULL'.
  
   -- Target Hook: void TARGET_ASM_DECL_END (void)
       Define this hook if the target assembler requires a special marker
--- 34562,34577 ----
  
   -- Target Hook: bool TARGET_ASM_INTEGER (rtx X, unsigned int SIZE, int
            ALIGNED_P)
!      The 'assemble_integer' function uses this hook to output an integer
!      object.  X is the object's value, SIZE is its size in bytes and
!      ALIGNED_P indicates whether it is aligned.  The function should
!      return 'true' if it was able to output the object.  If it returns
!      false, 'assemble_integer' will try to split the object into smaller
!      parts.
  
       The default implementation of this hook will use the
!      'TARGET_ASM_BYTE_OP' family of strings, returning 'false' when the
!      relevant string is 'NULL'.
  
   -- Target Hook: void TARGET_ASM_DECL_END (void)
       Define this hook if the target assembler requires a special marker
*************** File: gccint.info,  Node: Data Output,
*** 34990,35024 ****
  
   -- Target Hook: bool TARGET_ASM_OUTPUT_ADDR_CONST_EXTRA (FILE *FILE,
            rtx X)
!      A target hook to recognize RTX patterns that `output_addr_const'
       can't deal with, and output assembly code to FILE corresponding to
       the pattern X.  This may be used to allow machine-dependent
!      `UNSPEC's to appear within constants.
  
       If target hook fails to recognize a pattern, it must return
!      `false', so that a standard error message is printed.  If it
!      prints an error message itself, by calling, for example,
!      `output_operand_lossage', it may just return `true'.
  
   -- Macro: ASM_OUTPUT_ASCII (STREAM, PTR, LEN)
       A C statement to output to the stdio stream STREAM an assembler
       instruction to assemble a string constant containing the LEN bytes
!      at PTR.  PTR will be a C expression of type `char *' and LEN a C
!      expression of type `int'.
  
!      If the assembler has a `.ascii' pseudo-op as found in the Berkeley
!      Unix assembler, do not define the macro `ASM_OUTPUT_ASCII'.
  
   -- Macro: ASM_OUTPUT_FDESC (STREAM, DECL, N)
       A C statement to output word N of a function descriptor for DECL.
!      This must be defined if `TARGET_VTABLE_USES_DESCRIPTORS' is
       defined, and is otherwise unused.
  
   -- Macro: CONSTANT_POOL_BEFORE_FUNCTION
       You may define this macro as a C expression.  You should define the
       expression to have a nonzero value if GCC should output the
!      constant pool for a function before the code for the function, or
!      a zero value if GCC should output the constant pool after the
       function.  If you do not define this macro, the usual case, GCC
       will output the constant pool before the function.
  
--- 34579,34613 ----
  
   -- Target Hook: bool TARGET_ASM_OUTPUT_ADDR_CONST_EXTRA (FILE *FILE,
            rtx X)
!      A target hook to recognize RTX patterns that 'output_addr_const'
       can't deal with, and output assembly code to FILE corresponding to
       the pattern X.  This may be used to allow machine-dependent
!      'UNSPEC's to appear within constants.
  
       If target hook fails to recognize a pattern, it must return
!      'false', so that a standard error message is printed.  If it prints
!      an error message itself, by calling, for example,
!      'output_operand_lossage', it may just return 'true'.
  
   -- Macro: ASM_OUTPUT_ASCII (STREAM, PTR, LEN)
       A C statement to output to the stdio stream STREAM an assembler
       instruction to assemble a string constant containing the LEN bytes
!      at PTR.  PTR will be a C expression of type 'char *' and LEN a C
!      expression of type 'int'.
  
!      If the assembler has a '.ascii' pseudo-op as found in the Berkeley
!      Unix assembler, do not define the macro 'ASM_OUTPUT_ASCII'.
  
   -- Macro: ASM_OUTPUT_FDESC (STREAM, DECL, N)
       A C statement to output word N of a function descriptor for DECL.
!      This must be defined if 'TARGET_VTABLE_USES_DESCRIPTORS' is
       defined, and is otherwise unused.
  
   -- Macro: CONSTANT_POOL_BEFORE_FUNCTION
       You may define this macro as a C expression.  You should define the
       expression to have a nonzero value if GCC should output the
!      constant pool for a function before the code for the function, or a
!      zero value if GCC should output the constant pool after the
       function.  If you do not define this macro, the usual case, GCC
       will output the constant pool before the function.
  
*************** File: gccint.info,  Node: Data Output,
*** 35033,35048 ****
       If no constant-pool prefix is required, the usual case, this macro
       need not be defined.
  
!  -- Macro: ASM_OUTPUT_SPECIAL_POOL_ENTRY (FILE, X, MODE, ALIGN,
!           LABELNO, JUMPTO)
       A C statement (with or without semicolon) to output a constant in
!      the constant pool, if it needs special treatment.  (This macro
!      need not do anything for RTL expressions that can be output
!      normally.)
  
       The argument FILE is the standard I/O stream to output the
       assembler code on.  X is the RTL expression for the constant to
!      output, and MODE is the machine mode (in case X is a `const_int').
       ALIGN is the required alignment for the value X; you should output
       an assembler directive to force this much alignment.
  
--- 34622,34636 ----
       If no constant-pool prefix is required, the usual case, this macro
       need not be defined.
  
!  -- Macro: ASM_OUTPUT_SPECIAL_POOL_ENTRY (FILE, X, MODE, ALIGN, LABELNO,
!           JUMPTO)
       A C statement (with or without semicolon) to output a constant in
!      the constant pool, if it needs special treatment.  (This macro need
!      not do anything for RTL expressions that can be output normally.)
  
       The argument FILE is the standard I/O stream to output the
       assembler code on.  X is the RTL expression for the constant to
!      output, and MODE is the machine mode (in case X is a 'const_int').
       ALIGN is the required alignment for the value X; you should output
       an assembler directive to force this much alignment.
  
*************** File: gccint.info,  Node: Data Output,
*** 35051,35060 ****
       responsible for outputting the label definition at the proper
       place.  Here is how to do this:
  
!           `(*targetm.asm_out.internal_label)' (FILE, "LC", LABELNO);
  
       When you output a pool entry specially, you should end with a
!      `goto' to the label JUMPTO.  This will prevent the same pool entry
       from being output a second time in the usual manner.
  
       You need not define this macro if it would do nothing.
--- 34639,34648 ----
       responsible for outputting the label definition at the proper
       place.  Here is how to do this:
  
!           (*targetm.asm_out.internal_label) (FILE, "LC", LABELNO);
  
       When you output a pool entry specially, you should end with a
!      'goto' to the label JUMPTO.  This will prevent the same pool entry
       from being output a second time in the usual manner.
  
       You need not define this macro if it would do nothing.
*************** File: gccint.info,  Node: Data Output,
*** 35077,35093 ****
       line separator uses multiple characters.
  
       If you do not define this macro, the default is that only the
!      character `;' is treated as a logical line separator.
  
   -- Target Hook: const char * TARGET_ASM_OPEN_PAREN
   -- Target Hook: const char * TARGET_ASM_CLOSE_PAREN
!      These target hooks are C string constants, describing the syntax
!      in the assembler for grouping arithmetic expressions.  If not
       overridden, they default to normal parentheses, which is correct
       for most assemblers.
  
!  These macros are provided by `real.h' for writing the definitions of
! `ASM_OUTPUT_DOUBLE' and the like:
  
   -- Macro: REAL_VALUE_TO_TARGET_SINGLE (X, L)
   -- Macro: REAL_VALUE_TO_TARGET_DOUBLE (X, L)
--- 34665,34681 ----
       line separator uses multiple characters.
  
       If you do not define this macro, the default is that only the
!      character ';' is treated as a logical line separator.
  
   -- Target Hook: const char * TARGET_ASM_OPEN_PAREN
   -- Target Hook: const char * TARGET_ASM_CLOSE_PAREN
!      These target hooks are C string constants, describing the syntax in
!      the assembler for grouping arithmetic expressions.  If not
       overridden, they default to normal parentheses, which is correct
       for most assemblers.
  
!  These macros are provided by 'real.h' for writing the definitions of
! 'ASM_OUTPUT_DOUBLE' and the like:
  
   -- Macro: REAL_VALUE_TO_TARGET_SINGLE (X, L)
   -- Macro: REAL_VALUE_TO_TARGET_DOUBLE (X, L)
*************** File: gccint.info,  Node: Data Output,
*** 35095,35113 ****
   -- Macro: REAL_VALUE_TO_TARGET_DECIMAL32 (X, L)
   -- Macro: REAL_VALUE_TO_TARGET_DECIMAL64 (X, L)
   -- Macro: REAL_VALUE_TO_TARGET_DECIMAL128 (X, L)
!      These translate X, of type `REAL_VALUE_TYPE', to the target's
       floating point representation, and store its bit pattern in the
!      variable L.  For `REAL_VALUE_TO_TARGET_SINGLE' and
!      `REAL_VALUE_TO_TARGET_DECIMAL32', this variable should be a simple
!      `long int'.  For the others, it should be an array of `long int'.
       The number of elements in this array is determined by the size of
       the desired target floating point data type: 32 bits of it go in
!      each `long int' array element.  Each array element holds 32 bits
!      of the result, even if `long int' is wider than 32 bits on the
!      host machine.
  
       The array element values are designed so that you can print them
!      out using `fprintf' in the order they should appear in the target
       machine's memory.
  
  
--- 34683,34701 ----
   -- Macro: REAL_VALUE_TO_TARGET_DECIMAL32 (X, L)
   -- Macro: REAL_VALUE_TO_TARGET_DECIMAL64 (X, L)
   -- Macro: REAL_VALUE_TO_TARGET_DECIMAL128 (X, L)
!      These translate X, of type 'REAL_VALUE_TYPE', to the target's
       floating point representation, and store its bit pattern in the
!      variable L.  For 'REAL_VALUE_TO_TARGET_SINGLE' and
!      'REAL_VALUE_TO_TARGET_DECIMAL32', this variable should be a simple
!      'long int'.  For the others, it should be an array of 'long int'.
       The number of elements in this array is determined by the size of
       the desired target floating point data type: 32 bits of it go in
!      each 'long int' array element.  Each array element holds 32 bits of
!      the result, even if 'long int' is wider than 32 bits on the host
!      machine.
  
       The array element values are designed so that you can print them
!      out using 'fprintf' in the order they should appear in the target
       machine's memory.
  
  
*************** Each of the macros in this section is us
*** 35120,35130 ****
  outputting a single uninitialized variable.
  
   -- Macro: ASM_OUTPUT_COMMON (STREAM, NAME, SIZE, ROUNDED)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM the assembler definition of a common-label named NAME whose
!      size is SIZE bytes.  The variable ROUNDED is the size rounded up
!      to whatever alignment the caller wants.  It is possible that SIZE
!      may be zero, for instance if a struct with no other member than a
       zero-length array is defined.  In this case, the backend must
       output a symbol definition that allocates at least one byte, both
       so that the address of the resulting object does not compare equal
--- 34708,34718 ----
  outputting a single uninitialized variable.
  
   -- Macro: ASM_OUTPUT_COMMON (STREAM, NAME, SIZE, ROUNDED)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      the assembler definition of a common-label named NAME whose size is
!      SIZE bytes.  The variable ROUNDED is the size rounded up to
!      whatever alignment the caller wants.  It is possible that SIZE may
!      be zero, for instance if a struct with no other member than a
       zero-length array is defined.  In this case, the backend must
       output a symbol definition that allocates at least one byte, both
       so that the address of the resulting object does not compare equal
*************** outputting a single uninitialized variab
*** 35132,35212 ****
       the concept of a zero-sized common symbol, as that is how they
       represent an ordinary undefined external.
  
!      Use the expression `assemble_name (STREAM, NAME)' to output the
!      name itself; before and after that, output the additional
!      assembler syntax for defining the name, and a newline.
  
       This macro controls how the assembler definitions of uninitialized
       common global variables are output.
  
   -- Macro: ASM_OUTPUT_ALIGNED_COMMON (STREAM, NAME, SIZE, ALIGNMENT)
!      Like `ASM_OUTPUT_COMMON' except takes the required alignment as a
       separate, explicit argument.  If you define this macro, it is used
!      in place of `ASM_OUTPUT_COMMON', and gives you more flexibility in
       handling the required alignment of the variable.  The alignment is
       specified as the number of bits.
  
   -- Macro: ASM_OUTPUT_ALIGNED_DECL_COMMON (STREAM, DECL, NAME, SIZE,
            ALIGNMENT)
!      Like `ASM_OUTPUT_ALIGNED_COMMON' except that DECL of the variable
!      to be output, if there is one, or `NULL_TREE' if there is no
       corresponding variable.  If you define this macro, GCC will use it
!      in place of both `ASM_OUTPUT_COMMON' and
!      `ASM_OUTPUT_ALIGNED_COMMON'.  Define this macro when you need to
       see the variable's decl in order to chose what to output.
  
   -- Macro: ASM_OUTPUT_ALIGNED_BSS (STREAM, DECL, NAME, SIZE, ALIGNMENT)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM the assembler definition of uninitialized global DECL named
!      NAME whose size is SIZE bytes.  The variable ALIGNMENT is the
!      alignment specified as the number of bits.
  
!      Try to use function `asm_output_aligned_bss' defined in file
!      `varasm.c' when defining this macro.  If unable, use the expression
!      `assemble_name (STREAM, NAME)' to output the name itself; before
       and after that, output the additional assembler syntax for defining
       the name, and a newline.
  
       There are two ways of handling global BSS.  One is to define this
!      macro.  The other is to have `TARGET_ASM_SELECT_SECTION' return a
       switchable BSS section (*note
       TARGET_HAVE_SWITCHABLE_BSS_SECTIONS::).  You do not need to do
       both.
  
!      Some languages do not have `common' data, and require a non-common
       form of global BSS in order to handle uninitialized globals
       efficiently.  C++ is one example of this.  However, if the target
       does not support global BSS, the front end may choose to make
       globals common in order to save space in the object file.
  
   -- Macro: ASM_OUTPUT_LOCAL (STREAM, NAME, SIZE, ROUNDED)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM the assembler definition of a local-common-label named NAME
!      whose size is SIZE bytes.  The variable ROUNDED is the size
!      rounded up to whatever alignment the caller wants.
  
!      Use the expression `assemble_name (STREAM, NAME)' to output the
!      name itself; before and after that, output the additional
!      assembler syntax for defining the name, and a newline.
  
       This macro controls how the assembler definitions of uninitialized
       static variables are output.
  
   -- Macro: ASM_OUTPUT_ALIGNED_LOCAL (STREAM, NAME, SIZE, ALIGNMENT)
!      Like `ASM_OUTPUT_LOCAL' except takes the required alignment as a
       separate, explicit argument.  If you define this macro, it is used
!      in place of `ASM_OUTPUT_LOCAL', and gives you more flexibility in
       handling the required alignment of the variable.  The alignment is
       specified as the number of bits.
  
   -- Macro: ASM_OUTPUT_ALIGNED_DECL_LOCAL (STREAM, DECL, NAME, SIZE,
            ALIGNMENT)
!      Like `ASM_OUTPUT_ALIGNED_DECL' except that DECL of the variable to
!      be output, if there is one, or `NULL_TREE' if there is no
       corresponding variable.  If you define this macro, GCC will use it
!      in place of both `ASM_OUTPUT_DECL' and `ASM_OUTPUT_ALIGNED_DECL'.
!      Define this macro when you need to see the variable's decl in
!      order to chose what to output.
  
  
  File: gccint.info,  Node: Label Output,  Next: Initialization,  Prev: Uninitialized Data,  Up: Assembler Format
--- 34720,34800 ----
       the concept of a zero-sized common symbol, as that is how they
       represent an ordinary undefined external.
  
!      Use the expression 'assemble_name (STREAM, NAME)' to output the
!      name itself; before and after that, output the additional assembler
!      syntax for defining the name, and a newline.
  
       This macro controls how the assembler definitions of uninitialized
       common global variables are output.
  
   -- Macro: ASM_OUTPUT_ALIGNED_COMMON (STREAM, NAME, SIZE, ALIGNMENT)
!      Like 'ASM_OUTPUT_COMMON' except takes the required alignment as a
       separate, explicit argument.  If you define this macro, it is used
!      in place of 'ASM_OUTPUT_COMMON', and gives you more flexibility in
       handling the required alignment of the variable.  The alignment is
       specified as the number of bits.
  
   -- Macro: ASM_OUTPUT_ALIGNED_DECL_COMMON (STREAM, DECL, NAME, SIZE,
            ALIGNMENT)
!      Like 'ASM_OUTPUT_ALIGNED_COMMON' except that DECL of the variable
!      to be output, if there is one, or 'NULL_TREE' if there is no
       corresponding variable.  If you define this macro, GCC will use it
!      in place of both 'ASM_OUTPUT_COMMON' and
!      'ASM_OUTPUT_ALIGNED_COMMON'.  Define this macro when you need to
       see the variable's decl in order to chose what to output.
  
   -- Macro: ASM_OUTPUT_ALIGNED_BSS (STREAM, DECL, NAME, SIZE, ALIGNMENT)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      the assembler definition of uninitialized global DECL named NAME
!      whose size is SIZE bytes.  The variable ALIGNMENT is the alignment
!      specified as the number of bits.
  
!      Try to use function 'asm_output_aligned_bss' defined in file
!      'varasm.c' when defining this macro.  If unable, use the expression
!      'assemble_name (STREAM, NAME)' to output the name itself; before
       and after that, output the additional assembler syntax for defining
       the name, and a newline.
  
       There are two ways of handling global BSS.  One is to define this
!      macro.  The other is to have 'TARGET_ASM_SELECT_SECTION' return a
       switchable BSS section (*note
       TARGET_HAVE_SWITCHABLE_BSS_SECTIONS::).  You do not need to do
       both.
  
!      Some languages do not have 'common' data, and require a non-common
       form of global BSS in order to handle uninitialized globals
       efficiently.  C++ is one example of this.  However, if the target
       does not support global BSS, the front end may choose to make
       globals common in order to save space in the object file.
  
   -- Macro: ASM_OUTPUT_LOCAL (STREAM, NAME, SIZE, ROUNDED)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      the assembler definition of a local-common-label named NAME whose
!      size is SIZE bytes.  The variable ROUNDED is the size rounded up to
!      whatever alignment the caller wants.
  
!      Use the expression 'assemble_name (STREAM, NAME)' to output the
!      name itself; before and after that, output the additional assembler
!      syntax for defining the name, and a newline.
  
       This macro controls how the assembler definitions of uninitialized
       static variables are output.
  
   -- Macro: ASM_OUTPUT_ALIGNED_LOCAL (STREAM, NAME, SIZE, ALIGNMENT)
!      Like 'ASM_OUTPUT_LOCAL' except takes the required alignment as a
       separate, explicit argument.  If you define this macro, it is used
!      in place of 'ASM_OUTPUT_LOCAL', and gives you more flexibility in
       handling the required alignment of the variable.  The alignment is
       specified as the number of bits.
  
   -- Macro: ASM_OUTPUT_ALIGNED_DECL_LOCAL (STREAM, DECL, NAME, SIZE,
            ALIGNMENT)
!      Like 'ASM_OUTPUT_ALIGNED_DECL' except that DECL of the variable to
!      be output, if there is one, or 'NULL_TREE' if there is no
       corresponding variable.  If you define this macro, GCC will use it
!      in place of both 'ASM_OUTPUT_DECL' and 'ASM_OUTPUT_ALIGNED_DECL'.
!      Define this macro when you need to see the variable's decl in order
!      to chose what to output.
  
  
  File: gccint.info,  Node: Label Output,  Next: Initialization,  Prev: Uninitialized Data,  Up: Assembler Format
*************** File: gccint.info,  Node: Label Output,
*** 35217,35474 ****
  This is about outputting labels.
  
   -- Macro: ASM_OUTPUT_LABEL (STREAM, NAME)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM the assembler definition of a label named NAME.  Use the
!      expression `assemble_name (STREAM, NAME)' to output the name
       itself; before and after that, output the additional assembler
       syntax for defining the name, and a newline.  A default definition
       of this macro is provided which is correct for most systems.
  
-  -- Macro: ASM_OUTPUT_FUNCTION_LABEL (STREAM, NAME, DECL)
-      A C statement (sans semicolon) to output to the stdio stream
-      STREAM the assembler definition of a label named NAME of a
-      function.  Use the expression `assemble_name (STREAM, NAME)' to
-      output the name itself; before and after that, output the
-      additional assembler syntax for defining the name, and a newline.
-      A default definition of this macro is provided which is correct
-      for most systems.
- 
       If this macro is not defined, then the function name is defined in
!      the usual manner as a label (by means of `ASM_OUTPUT_LABEL').
  
   -- Macro: ASM_OUTPUT_INTERNAL_LABEL (STREAM, NAME)
!      Identical to `ASM_OUTPUT_LABEL', except that NAME is known to
!      refer to a compiler-generated label.  The default definition uses
!      `assemble_name_raw', which is like `assemble_name' except that it
       is more efficient.
  
   -- Macro: SIZE_ASM_OP
       A C string containing the appropriate assembler directive to
       specify the size of a symbol, without any arguments.  On systems
!      that use ELF, the default (in `config/elfos.h') is `"\t.size\t"';
       on other systems, the default is not to define this macro.
  
       Define this macro only if it is correct to use the default
!      definitions of `ASM_OUTPUT_SIZE_DIRECTIVE' and
!      `ASM_OUTPUT_MEASURED_SIZE' for your system.  If you need your own
       custom definitions of those macros, or if you do not need explicit
       symbol sizes at all, do not define this macro.
  
   -- Macro: ASM_OUTPUT_SIZE_DIRECTIVE (STREAM, NAME, SIZE)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM a directive telling the assembler that the size of the
!      symbol NAME is SIZE.  SIZE is a `HOST_WIDE_INT'.  If you define
!      `SIZE_ASM_OP', a default definition of this macro is provided.
  
   -- Macro: ASM_OUTPUT_MEASURED_SIZE (STREAM, NAME)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM a directive telling the assembler to calculate the size of
!      the symbol NAME by subtracting its address from the current
!      address.
  
!      If you define `SIZE_ASM_OP', a default definition of this macro is
       provided.  The default assumes that the assembler recognizes a
!      special `.' symbol as referring to the current address, and can
       calculate the difference between this and another symbol.  If your
!      assembler does not recognize `.' or cannot do calculations with
!      it, you will need to redefine `ASM_OUTPUT_MEASURED_SIZE' to use
!      some other technique.
  
   -- Macro: NO_DOLLAR_IN_LABEL
       Define this macro if the assembler does not accept the character
!      `$' in label names.  By default constructors and destructors in
!      G++ have `$' in the identifiers.  If this macro is defined, `.' is
!      used instead.
  
   -- Macro: NO_DOT_IN_LABEL
       Define this macro if the assembler does not accept the character
!      `.' in label names.  By default constructors and destructors in G++
!      have names that use `.'.  If this macro is defined, these names
!      are rewritten to avoid `.'.
  
   -- Macro: TYPE_ASM_OP
       A C string containing the appropriate assembler directive to
       specify the type of a symbol, without any arguments.  On systems
!      that use ELF, the default (in `config/elfos.h') is `"\t.type\t"';
       on other systems, the default is not to define this macro.
  
       Define this macro only if it is correct to use the default
!      definition of `ASM_OUTPUT_TYPE_DIRECTIVE' for your system.  If you
       need your own custom definition of this macro, or if you do not
       need explicit symbol types at all, do not define this macro.
  
   -- Macro: TYPE_OPERAND_FMT
!      A C string which specifies (using `printf' syntax) the format of
!      the second operand to `TYPE_ASM_OP'.  On systems that use ELF, the
!      default (in `config/elfos.h') is `"@%s"'; on other systems, the
       default is not to define this macro.
  
       Define this macro only if it is correct to use the default
!      definition of `ASM_OUTPUT_TYPE_DIRECTIVE' for your system.  If you
       need your own custom definition of this macro, or if you do not
       need explicit symbol types at all, do not define this macro.
  
   -- Macro: ASM_OUTPUT_TYPE_DIRECTIVE (STREAM, TYPE)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM a directive telling the assembler that the type of the
!      symbol NAME is TYPE.  TYPE is a C string; currently, that string
!      is always either `"function"' or `"object"', but you should not
!      count on this.
  
!      If you define `TYPE_ASM_OP' and `TYPE_OPERAND_FMT', a default
       definition of this macro is provided.
  
   -- Macro: ASM_DECLARE_FUNCTION_NAME (STREAM, NAME, DECL)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM any text necessary for declaring the name NAME of a
!      function which is being defined.  This macro is responsible for
!      outputting the label definition (perhaps using
!      `ASM_OUTPUT_FUNCTION_LABEL').  The argument DECL is the
!      `FUNCTION_DECL' tree node representing the function.
  
       If this macro is not defined, then the function name is defined in
       the usual manner as a label (by means of
!      `ASM_OUTPUT_FUNCTION_LABEL').
  
!      You may wish to use `ASM_OUTPUT_TYPE_DIRECTIVE' in the definition
       of this macro.
  
   -- Macro: ASM_DECLARE_FUNCTION_SIZE (STREAM, NAME, DECL)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM any text necessary for declaring the size of a function
!      which is being defined.  The argument NAME is the name of the
!      function.  The argument DECL is the `FUNCTION_DECL' tree node
!      representing the function.
  
       If this macro is not defined, then the function size is not
       defined.
  
!      You may wish to use `ASM_OUTPUT_MEASURED_SIZE' in the definition
!      of this macro.
  
   -- Macro: ASM_DECLARE_OBJECT_NAME (STREAM, NAME, DECL)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM any text necessary for declaring the name NAME of an
!      initialized variable which is being defined.  This macro must
!      output the label definition (perhaps using `ASM_OUTPUT_LABEL').
!      The argument DECL is the `VAR_DECL' tree node representing the
!      variable.
  
       If this macro is not defined, then the variable name is defined in
!      the usual manner as a label (by means of `ASM_OUTPUT_LABEL').
  
!      You may wish to use `ASM_OUTPUT_TYPE_DIRECTIVE' and/or
!      `ASM_OUTPUT_SIZE_DIRECTIVE' in the definition of this macro.
  
   -- Target Hook: void TARGET_ASM_DECLARE_CONSTANT_NAME (FILE *FILE,
            const char *NAME, const_tree EXPR, HOST_WIDE_INT SIZE)
       A target hook to output to the stdio stream FILE any text necessary
       for declaring the name NAME of a constant which is being defined.
!      This target hook is responsible for outputting the label
!      definition (perhaps using `assemble_label').  The argument EXP is
!      the value of the constant, and SIZE is the size of the constant in
!      bytes.  The NAME will be an internal label.
  
       The default version of this target hook, define the NAME in the
!      usual manner as a label (by means of `assemble_label').
  
!      You may wish to use `ASM_OUTPUT_TYPE_DIRECTIVE' in this target
       hook.
  
   -- Macro: ASM_DECLARE_REGISTER_GLOBAL (STREAM, DECL, REGNO, NAME)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM any text necessary for claiming a register REGNO for a
!      global variable DECL with name NAME.
  
       If you don't define this macro, that is equivalent to defining it
       to do nothing.
  
   -- Macro: ASM_FINISH_DECLARE_OBJECT (STREAM, DECL, TOPLEVEL, ATEND)
       A C statement (sans semicolon) to finish up declaring a variable
!      name once the compiler has processed its initializer fully and
!      thus has had a chance to determine the size of an array when
!      controlled by an initializer.  This is used on systems where it's
!      necessary to declare something about the size of the object.
  
       If you don't define this macro, that is equivalent to defining it
       to do nothing.
  
!      You may wish to use `ASM_OUTPUT_SIZE_DIRECTIVE' and/or
!      `ASM_OUTPUT_MEASURED_SIZE' in the definition of this macro.
  
   -- Target Hook: void TARGET_ASM_GLOBALIZE_LABEL (FILE *STREAM, const
            char *NAME)
!      This target hook is a function to output to the stdio stream
!      STREAM some commands that will make the label NAME global; that
!      is, available for reference from other files.
  
       The default implementation relies on a proper definition of
!      `GLOBAL_ASM_OP'.
  
!  -- Target Hook: void TARGET_ASM_GLOBALIZE_DECL_NAME (FILE *STREAM,
!           tree DECL)
!      This target hook is a function to output to the stdio stream
!      STREAM some commands that will make the name associated with DECL
!      global; that is, available for reference from other files.
  
       The default implementation uses the TARGET_ASM_GLOBALIZE_LABEL
       target hook.
  
   -- Target Hook: void TARGET_ASM_ASSEMBLE_UNDEFINED_DECL (FILE *STREAM,
            const char *NAME, const_tree DECL)
!      This target hook is a function to output to the stdio stream
!      STREAM some commands that will declare the name associated with
!      DECL which is not defined in the current translation unit.  Most
!      assemblers do not require anything to be output in this case.
  
   -- Macro: ASM_WEAKEN_LABEL (STREAM, NAME)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM some commands that will make the label NAME weak; that is,
       available for reference from other files but only used if no other
!      definition is available.  Use the expression `assemble_name
       (STREAM, NAME)' to output the name itself; before and after that,
       output the additional assembler syntax for making that name weak,
       and a newline.
  
!      If you don't define this macro or `ASM_WEAKEN_DECL', GCC will not
!      support weak symbols and you should not define the `SUPPORTS_WEAK'
       macro.
  
   -- Macro: ASM_WEAKEN_DECL (STREAM, DECL, NAME, VALUE)
!      Combines (and replaces) the function of `ASM_WEAKEN_LABEL' and
!      `ASM_OUTPUT_WEAK_ALIAS', allowing access to the associated function
!      or variable decl.  If VALUE is not `NULL', this C statement should
       output to the stdio stream STREAM assembler code which defines
       (equates) the weak symbol NAME to have the value VALUE.  If VALUE
!      is `NULL', it should output commands to make NAME weak.
  
   -- Macro: ASM_OUTPUT_WEAKREF (STREAM, DECL, NAME, VALUE)
!      Outputs a directive that enables NAME to be used to refer to
!      symbol VALUE with weak-symbol semantics.  `decl' is the
!      declaration of `name'.
  
   -- Macro: SUPPORTS_WEAK
       A preprocessor constant expression which evaluates to true if the
       target supports weak symbols.
  
!      If you don't define this macro, `defaults.h' provides a default
!      definition.  If either `ASM_WEAKEN_LABEL' or `ASM_WEAKEN_DECL' is
!      defined, the default definition is `1'; otherwise, it is `0'.
  
   -- Macro: TARGET_SUPPORTS_WEAK
       A C expression which evaluates to true if the target supports weak
       symbols.
  
!      If you don't define this macro, `defaults.h' provides a default
!      definition.  The default definition is `(SUPPORTS_WEAK)'.  Define
       this macro if you want to control weak symbol support with a
!      compiler flag such as `-melf'.
  
   -- Macro: MAKE_DECL_ONE_ONLY (DECL)
       A C statement (sans semicolon) to mark DECL to be emitted as a
       public symbol such that extra copies in multiple translation units
       will be discarded by the linker.  Define this macro if your object
!      file format provides support for this concept, such as the `COMDAT'
       section flags in the Microsoft Windows PE/COFF format, and this
       support requires changes to DECL, such as putting it in a separate
       section.
--- 34805,35059 ----
  This is about outputting labels.
  
   -- Macro: ASM_OUTPUT_LABEL (STREAM, NAME)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      the assembler definition of a label named NAME.  Use the expression
!      'assemble_name (STREAM, NAME)' to output the name itself; before
!      and after that, output the additional assembler syntax for defining
!      the name, and a newline.  A default definition of this macro is
!      provided which is correct for most systems.
! 
!  -- Macro: ASM_OUTPUT_FUNCTION_LABEL (STREAM, NAME, DECL)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      the assembler definition of a label named NAME of a function.  Use
!      the expression 'assemble_name (STREAM, NAME)' to output the name
       itself; before and after that, output the additional assembler
       syntax for defining the name, and a newline.  A default definition
       of this macro is provided which is correct for most systems.
  
       If this macro is not defined, then the function name is defined in
!      the usual manner as a label (by means of 'ASM_OUTPUT_LABEL').
  
   -- Macro: ASM_OUTPUT_INTERNAL_LABEL (STREAM, NAME)
!      Identical to 'ASM_OUTPUT_LABEL', except that NAME is known to refer
!      to a compiler-generated label.  The default definition uses
!      'assemble_name_raw', which is like 'assemble_name' except that it
       is more efficient.
  
   -- Macro: SIZE_ASM_OP
       A C string containing the appropriate assembler directive to
       specify the size of a symbol, without any arguments.  On systems
!      that use ELF, the default (in 'config/elfos.h') is '"\t.size\t"';
       on other systems, the default is not to define this macro.
  
       Define this macro only if it is correct to use the default
!      definitions of 'ASM_OUTPUT_SIZE_DIRECTIVE' and
!      'ASM_OUTPUT_MEASURED_SIZE' for your system.  If you need your own
       custom definitions of those macros, or if you do not need explicit
       symbol sizes at all, do not define this macro.
  
   -- Macro: ASM_OUTPUT_SIZE_DIRECTIVE (STREAM, NAME, SIZE)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      a directive telling the assembler that the size of the symbol NAME
!      is SIZE.  SIZE is a 'HOST_WIDE_INT'.  If you define 'SIZE_ASM_OP',
!      a default definition of this macro is provided.
  
   -- Macro: ASM_OUTPUT_MEASURED_SIZE (STREAM, NAME)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      a directive telling the assembler to calculate the size of the
!      symbol NAME by subtracting its address from the current address.
  
!      If you define 'SIZE_ASM_OP', a default definition of this macro is
       provided.  The default assumes that the assembler recognizes a
!      special '.' symbol as referring to the current address, and can
       calculate the difference between this and another symbol.  If your
!      assembler does not recognize '.' or cannot do calculations with it,
!      you will need to redefine 'ASM_OUTPUT_MEASURED_SIZE' to use some
!      other technique.
  
   -- Macro: NO_DOLLAR_IN_LABEL
       Define this macro if the assembler does not accept the character
!      '$' in label names.  By default constructors and destructors in G++
!      have '$' in the identifiers.  If this macro is defined, '.' is used
!      instead.
  
   -- Macro: NO_DOT_IN_LABEL
       Define this macro if the assembler does not accept the character
!      '.' in label names.  By default constructors and destructors in G++
!      have names that use '.'.  If this macro is defined, these names are
!      rewritten to avoid '.'.
  
   -- Macro: TYPE_ASM_OP
       A C string containing the appropriate assembler directive to
       specify the type of a symbol, without any arguments.  On systems
!      that use ELF, the default (in 'config/elfos.h') is '"\t.type\t"';
       on other systems, the default is not to define this macro.
  
       Define this macro only if it is correct to use the default
!      definition of 'ASM_OUTPUT_TYPE_DIRECTIVE' for your system.  If you
       need your own custom definition of this macro, or if you do not
       need explicit symbol types at all, do not define this macro.
  
   -- Macro: TYPE_OPERAND_FMT
!      A C string which specifies (using 'printf' syntax) the format of
!      the second operand to 'TYPE_ASM_OP'.  On systems that use ELF, the
!      default (in 'config/elfos.h') is '"@%s"'; on other systems, the
       default is not to define this macro.
  
       Define this macro only if it is correct to use the default
!      definition of 'ASM_OUTPUT_TYPE_DIRECTIVE' for your system.  If you
       need your own custom definition of this macro, or if you do not
       need explicit symbol types at all, do not define this macro.
  
   -- Macro: ASM_OUTPUT_TYPE_DIRECTIVE (STREAM, TYPE)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      a directive telling the assembler that the type of the symbol NAME
!      is TYPE.  TYPE is a C string; currently, that string is always
!      either '"function"' or '"object"', but you should not count on
!      this.
  
!      If you define 'TYPE_ASM_OP' and 'TYPE_OPERAND_FMT', a default
       definition of this macro is provided.
  
   -- Macro: ASM_DECLARE_FUNCTION_NAME (STREAM, NAME, DECL)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      any text necessary for declaring the name NAME of a function which
!      is being defined.  This macro is responsible for outputting the
!      label definition (perhaps using 'ASM_OUTPUT_FUNCTION_LABEL').  The
!      argument DECL is the 'FUNCTION_DECL' tree node representing the
!      function.
  
       If this macro is not defined, then the function name is defined in
       the usual manner as a label (by means of
!      'ASM_OUTPUT_FUNCTION_LABEL').
  
!      You may wish to use 'ASM_OUTPUT_TYPE_DIRECTIVE' in the definition
       of this macro.
  
   -- Macro: ASM_DECLARE_FUNCTION_SIZE (STREAM, NAME, DECL)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      any text necessary for declaring the size of a function which is
!      being defined.  The argument NAME is the name of the function.  The
!      argument DECL is the 'FUNCTION_DECL' tree node representing the
!      function.
  
       If this macro is not defined, then the function size is not
       defined.
  
!      You may wish to use 'ASM_OUTPUT_MEASURED_SIZE' in the definition of
!      this macro.
  
   -- Macro: ASM_DECLARE_OBJECT_NAME (STREAM, NAME, DECL)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      any text necessary for declaring the name NAME of an initialized
!      variable which is being defined.  This macro must output the label
!      definition (perhaps using 'ASM_OUTPUT_LABEL').  The argument DECL
!      is the 'VAR_DECL' tree node representing the variable.
  
       If this macro is not defined, then the variable name is defined in
!      the usual manner as a label (by means of 'ASM_OUTPUT_LABEL').
  
!      You may wish to use 'ASM_OUTPUT_TYPE_DIRECTIVE' and/or
!      'ASM_OUTPUT_SIZE_DIRECTIVE' in the definition of this macro.
  
   -- Target Hook: void TARGET_ASM_DECLARE_CONSTANT_NAME (FILE *FILE,
            const char *NAME, const_tree EXPR, HOST_WIDE_INT SIZE)
       A target hook to output to the stdio stream FILE any text necessary
       for declaring the name NAME of a constant which is being defined.
!      This target hook is responsible for outputting the label definition
!      (perhaps using 'assemble_label').  The argument EXP is the value of
!      the constant, and SIZE is the size of the constant in bytes.  The
!      NAME will be an internal label.
  
       The default version of this target hook, define the NAME in the
!      usual manner as a label (by means of 'assemble_label').
  
!      You may wish to use 'ASM_OUTPUT_TYPE_DIRECTIVE' in this target
       hook.
  
   -- Macro: ASM_DECLARE_REGISTER_GLOBAL (STREAM, DECL, REGNO, NAME)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      any text necessary for claiming a register REGNO for a global
!      variable DECL with name NAME.
  
       If you don't define this macro, that is equivalent to defining it
       to do nothing.
  
   -- Macro: ASM_FINISH_DECLARE_OBJECT (STREAM, DECL, TOPLEVEL, ATEND)
       A C statement (sans semicolon) to finish up declaring a variable
!      name once the compiler has processed its initializer fully and thus
!      has had a chance to determine the size of an array when controlled
!      by an initializer.  This is used on systems where it's necessary to
!      declare something about the size of the object.
  
       If you don't define this macro, that is equivalent to defining it
       to do nothing.
  
!      You may wish to use 'ASM_OUTPUT_SIZE_DIRECTIVE' and/or
!      'ASM_OUTPUT_MEASURED_SIZE' in the definition of this macro.
  
   -- Target Hook: void TARGET_ASM_GLOBALIZE_LABEL (FILE *STREAM, const
            char *NAME)
!      This target hook is a function to output to the stdio stream STREAM
!      some commands that will make the label NAME global; that is,
!      available for reference from other files.
  
       The default implementation relies on a proper definition of
!      'GLOBAL_ASM_OP'.
  
!  -- Target Hook: void TARGET_ASM_GLOBALIZE_DECL_NAME (FILE *STREAM, tree
!           DECL)
!      This target hook is a function to output to the stdio stream STREAM
!      some commands that will make the name associated with DECL global;
!      that is, available for reference from other files.
  
       The default implementation uses the TARGET_ASM_GLOBALIZE_LABEL
       target hook.
  
   -- Target Hook: void TARGET_ASM_ASSEMBLE_UNDEFINED_DECL (FILE *STREAM,
            const char *NAME, const_tree DECL)
!      This target hook is a function to output to the stdio stream STREAM
!      some commands that will declare the name associated with DECL which
!      is not defined in the current translation unit.  Most assemblers do
!      not require anything to be output in this case.
  
   -- Macro: ASM_WEAKEN_LABEL (STREAM, NAME)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      some commands that will make the label NAME weak; that is,
       available for reference from other files but only used if no other
!      definition is available.  Use the expression 'assemble_name
       (STREAM, NAME)' to output the name itself; before and after that,
       output the additional assembler syntax for making that name weak,
       and a newline.
  
!      If you don't define this macro or 'ASM_WEAKEN_DECL', GCC will not
!      support weak symbols and you should not define the 'SUPPORTS_WEAK'
       macro.
  
   -- Macro: ASM_WEAKEN_DECL (STREAM, DECL, NAME, VALUE)
!      Combines (and replaces) the function of 'ASM_WEAKEN_LABEL' and
!      'ASM_OUTPUT_WEAK_ALIAS', allowing access to the associated function
!      or variable decl.  If VALUE is not 'NULL', this C statement should
       output to the stdio stream STREAM assembler code which defines
       (equates) the weak symbol NAME to have the value VALUE.  If VALUE
!      is 'NULL', it should output commands to make NAME weak.
  
   -- Macro: ASM_OUTPUT_WEAKREF (STREAM, DECL, NAME, VALUE)
!      Outputs a directive that enables NAME to be used to refer to symbol
!      VALUE with weak-symbol semantics.  'decl' is the declaration of
!      'name'.
  
   -- Macro: SUPPORTS_WEAK
       A preprocessor constant expression which evaluates to true if the
       target supports weak symbols.
  
!      If you don't define this macro, 'defaults.h' provides a default
!      definition.  If either 'ASM_WEAKEN_LABEL' or 'ASM_WEAKEN_DECL' is
!      defined, the default definition is '1'; otherwise, it is '0'.
  
   -- Macro: TARGET_SUPPORTS_WEAK
       A C expression which evaluates to true if the target supports weak
       symbols.
  
!      If you don't define this macro, 'defaults.h' provides a default
!      definition.  The default definition is '(SUPPORTS_WEAK)'.  Define
       this macro if you want to control weak symbol support with a
!      compiler flag such as '-melf'.
  
   -- Macro: MAKE_DECL_ONE_ONLY (DECL)
       A C statement (sans semicolon) to mark DECL to be emitted as a
       public symbol such that extra copies in multiple translation units
       will be discarded by the linker.  Define this macro if your object
!      file format provides support for this concept, such as the 'COMDAT'
       section flags in the Microsoft Windows PE/COFF format, and this
       support requires changes to DECL, such as putting it in a separate
       section.
*************** This is about outputting labels.
*** 35477,35487 ****
       A C expression which evaluates to true if the target supports
       one-only semantics.
  
!      If you don't define this macro, `varasm.c' provides a default
!      definition.  If `MAKE_DECL_ONE_ONLY' is defined, the default
!      definition is `1'; otherwise, it is `0'.  Define this macro if you
       want to control one-only symbol support with a compiler flag, or if
!      setting the `DECL_ONE_ONLY' flag is enough to mark a declaration to
       be emitted as one-only.
  
   -- Target Hook: void TARGET_ASM_ASSEMBLE_VISIBILITY (tree DECL, int
--- 35062,35072 ----
       A C expression which evaluates to true if the target supports
       one-only semantics.
  
!      If you don't define this macro, 'varasm.c' provides a default
!      definition.  If 'MAKE_DECL_ONE_ONLY' is defined, the default
!      definition is '1'; otherwise, it is '0'.  Define this macro if you
       want to control one-only symbol support with a compiler flag, or if
!      setting the 'DECL_ONE_ONLY' flag is enough to mark a declaration to
       be emitted as one-only.
  
   -- Target Hook: void TARGET_ASM_ASSEMBLE_VISIBILITY (tree DECL, int
*************** This is about outputting labels.
*** 35493,35530 ****
  
   -- Macro: TARGET_WEAK_NOT_IN_ARCHIVE_TOC
       A C expression that evaluates to true if the target's linker
!      expects that weak symbols do not appear in a static archive's
!      table of contents.  The default is `0'.
  
       Leaving weak symbols out of an archive's table of contents means
       that, if a symbol will only have a definition in one translation
       unit and will have undefined references from other translation
       units, that symbol should not be weak.  Defining this macro to be
       nonzero will thus have the effect that certain symbols that would
!      normally be weak (explicit template instantiations, and vtables
!      for polymorphic classes with noninline key methods) will instead
!      be nonweak.
  
       The C++ ABI requires this macro to be zero.  Define this macro for
       targets where full C++ ABI compliance is impossible and where
!      linker restrictions require weak symbols to be left out of a
!      static archive's table of contents.
  
   -- Macro: ASM_OUTPUT_EXTERNAL (STREAM, DECL, NAME)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM any text necessary for declaring the name of an external
!      symbol named NAME which is referenced in this compilation but not
!      defined.  The value of DECL is the tree node for the declaration.
  
       This macro need not be defined if it does not need to output
!      anything.  The GNU assembler and most Unix assemblers don't
!      require anything.
  
   -- Target Hook: void TARGET_ASM_EXTERNAL_LIBCALL (rtx SYMREF)
       This target hook is a function to output to ASM_OUT_FILE an
       assembler pseudo-op to declare a library function name external.
       The name of the library function is given by SYMREF, which is a
!      `symbol_ref'.
  
   -- Target Hook: void TARGET_ASM_MARK_DECL_PRESERVED (const char
            *SYMBOL)
--- 35078,35115 ----
  
   -- Macro: TARGET_WEAK_NOT_IN_ARCHIVE_TOC
       A C expression that evaluates to true if the target's linker
!      expects that weak symbols do not appear in a static archive's table
!      of contents.  The default is '0'.
  
       Leaving weak symbols out of an archive's table of contents means
       that, if a symbol will only have a definition in one translation
       unit and will have undefined references from other translation
       units, that symbol should not be weak.  Defining this macro to be
       nonzero will thus have the effect that certain symbols that would
!      normally be weak (explicit template instantiations, and vtables for
!      polymorphic classes with noninline key methods) will instead be
!      nonweak.
  
       The C++ ABI requires this macro to be zero.  Define this macro for
       targets where full C++ ABI compliance is impossible and where
!      linker restrictions require weak symbols to be left out of a static
!      archive's table of contents.
  
   -- Macro: ASM_OUTPUT_EXTERNAL (STREAM, DECL, NAME)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      any text necessary for declaring the name of an external symbol
!      named NAME which is referenced in this compilation but not defined.
!      The value of DECL is the tree node for the declaration.
  
       This macro need not be defined if it does not need to output
!      anything.  The GNU assembler and most Unix assemblers don't require
!      anything.
  
   -- Target Hook: void TARGET_ASM_EXTERNAL_LIBCALL (rtx SYMREF)
       This target hook is a function to output to ASM_OUT_FILE an
       assembler pseudo-op to declare a library function name external.
       The name of the library function is given by SYMREF, which is a
!      'symbol_ref'.
  
   -- Target Hook: void TARGET_ASM_MARK_DECL_PRESERVED (const char
            *SYMBOL)
*************** This is about outputting labels.
*** 35533,35567 ****
       uses the .no_dead_code_strip directive.
  
   -- Macro: ASM_OUTPUT_LABELREF (STREAM, NAME)
!      A C statement (sans semicolon) to output to the stdio stream
!      STREAM a reference in assembler syntax to a label named NAME.
!      This should add `_' to the front of the name, if that is customary
!      on your operating system, as it is in most Berkeley Unix systems.
!      This macro is used in `assemble_name'.
  
   -- Target Hook: tree TARGET_MANGLE_ASSEMBLER_NAME (const char *NAME)
!      Given a symbol NAME, perform same mangling as `varasm.c''s
!      `assemble_name', but in memory rather than to a file stream,
!      returning result as an `IDENTIFIER_NODE'.  Required for correct
!      LTO symtabs.  The default implementation calls the
!      `TARGET_STRIP_NAME_ENCODING' hook and then prepends the
!      `USER_LABEL_PREFIX', if any.
  
   -- Macro: ASM_OUTPUT_SYMBOL_REF (STREAM, SYM)
       A C statement (sans semicolon) to output a reference to
!      `SYMBOL_REF' SYM.  If not defined, `assemble_name' will be used to
       output the name of the symbol.  This macro may be used to modify
       the way a symbol is referenced depending on information encoded by
!      `TARGET_ENCODE_SECTION_INFO'.
  
   -- Macro: ASM_OUTPUT_LABEL_REF (STREAM, BUF)
       A C statement (sans semicolon) to output a reference to BUF, the
!      result of `ASM_GENERATE_INTERNAL_LABEL'.  If not defined,
!      `assemble_name' will be used to output the name of the symbol.
!      This macro is not used by `output_asm_label', or the `%l'
!      specifier that calls it; the intention is that this macro should
!      be set when it is necessary to output a label differently when its
!      address is being taken.
  
   -- Target Hook: void TARGET_ASM_INTERNAL_LABEL (FILE *STREAM, const
            char *PREFIX, unsigned long LABELNO)
--- 35118,35152 ----
       uses the .no_dead_code_strip directive.
  
   -- Macro: ASM_OUTPUT_LABELREF (STREAM, NAME)
!      A C statement (sans semicolon) to output to the stdio stream STREAM
!      a reference in assembler syntax to a label named NAME.  This should
!      add '_' to the front of the name, if that is customary on your
!      operating system, as it is in most Berkeley Unix systems.  This
!      macro is used in 'assemble_name'.
  
   -- Target Hook: tree TARGET_MANGLE_ASSEMBLER_NAME (const char *NAME)
!      Given a symbol NAME, perform same mangling as 'varasm.c''s
!      'assemble_name', but in memory rather than to a file stream,
!      returning result as an 'IDENTIFIER_NODE'.  Required for correct LTO
!      symtabs.  The default implementation calls the
!      'TARGET_STRIP_NAME_ENCODING' hook and then prepends the
!      'USER_LABEL_PREFIX', if any.
  
   -- Macro: ASM_OUTPUT_SYMBOL_REF (STREAM, SYM)
       A C statement (sans semicolon) to output a reference to
!      'SYMBOL_REF' SYM.  If not defined, 'assemble_name' will be used to
       output the name of the symbol.  This macro may be used to modify
       the way a symbol is referenced depending on information encoded by
!      'TARGET_ENCODE_SECTION_INFO'.
  
   -- Macro: ASM_OUTPUT_LABEL_REF (STREAM, BUF)
       A C statement (sans semicolon) to output a reference to BUF, the
!      result of 'ASM_GENERATE_INTERNAL_LABEL'.  If not defined,
!      'assemble_name' will be used to output the name of the symbol.
!      This macro is not used by 'output_asm_label', or the '%l' specifier
!      that calls it; the intention is that this macro should be set when
!      it is necessary to output a label differently when its address is
!      being taken.
  
   -- Target Hook: void TARGET_ASM_INTERNAL_LABEL (FILE *STREAM, const
            char *PREFIX, unsigned long LABELNO)
*************** This is about outputting labels.
*** 35572,35621 ****
       labels used for user-level functions and variables.  Otherwise,
       certain programs will have name conflicts with internal labels.
  
!      It is desirable to exclude internal labels from the symbol table
!      of the object file.  Most assemblers have a naming convention for
!      labels that should be excluded; on many systems, the letter `L' at
       the beginning of a label has this effect.  You should find out what
       convention your system uses, and follow it.
  
       The default version of this function utilizes
!      `ASM_GENERATE_INTERNAL_LABEL'.
  
   -- Macro: ASM_OUTPUT_DEBUG_LABEL (STREAM, PREFIX, NUM)
       A C statement to output to the stdio stream STREAM a debug info
!      label whose name is made from the string PREFIX and the number
!      NUM.  This is useful for VLIW targets, where debug info labels may
!      need to be treated differently than branch target labels.  On some
       systems, branch target labels must be at the beginning of
       instruction bundles, but debug info labels can occur in the middle
       of instruction bundles.
  
       If this macro is not defined, then
!      `(*targetm.asm_out.internal_label)' will be used.
  
   -- Macro: ASM_GENERATE_INTERNAL_LABEL (STRING, PREFIX, NUM)
!      A C statement to store into the string STRING a label whose name
!      is made from the string PREFIX and the number NUM.
  
!      This string, when output subsequently by `assemble_name', should
!      produce the output that `(*targetm.asm_out.internal_label)' would
       produce with the same PREFIX and NUM.
  
!      If the string begins with `*', then `assemble_name' will output
!      the rest of the string unchanged.  It is often convenient for
!      `ASM_GENERATE_INTERNAL_LABEL' to use `*' in this way.  If the
!      string doesn't start with `*', then `ASM_OUTPUT_LABELREF' gets to
       output the string, and may change it.  (Of course,
!      `ASM_OUTPUT_LABELREF' is also part of your machine description, so
       you should know what it does on your machine.)
  
   -- Macro: ASM_FORMAT_PRIVATE_NAME (OUTVAR, NAME, NUMBER)
       A C expression to assign to OUTVAR (which is a variable of type
!      `char *') a newly allocated string made from the string NAME and
       the number NUMBER, with some suitable punctuation added.  Use
!      `alloca' to get space for the string.
  
!      The string will be used as an argument to `ASM_OUTPUT_LABELREF' to
       produce an assembler label for an internal static variable whose
       name is NAME.  Therefore, the string must be such as to result in
       valid assembler code.  The argument NUMBER is different each time
--- 35157,35206 ----
       labels used for user-level functions and variables.  Otherwise,
       certain programs will have name conflicts with internal labels.
  
!      It is desirable to exclude internal labels from the symbol table of
!      the object file.  Most assemblers have a naming convention for
!      labels that should be excluded; on many systems, the letter 'L' at
       the beginning of a label has this effect.  You should find out what
       convention your system uses, and follow it.
  
       The default version of this function utilizes
!      'ASM_GENERATE_INTERNAL_LABEL'.
  
   -- Macro: ASM_OUTPUT_DEBUG_LABEL (STREAM, PREFIX, NUM)
       A C statement to output to the stdio stream STREAM a debug info
!      label whose name is made from the string PREFIX and the number NUM.
!      This is useful for VLIW targets, where debug info labels may need
!      to be treated differently than branch target labels.  On some
       systems, branch target labels must be at the beginning of
       instruction bundles, but debug info labels can occur in the middle
       of instruction bundles.
  
       If this macro is not defined, then
!      '(*targetm.asm_out.internal_label)' will be used.
  
   -- Macro: ASM_GENERATE_INTERNAL_LABEL (STRING, PREFIX, NUM)
!      A C statement to store into the string STRING a label whose name is
!      made from the string PREFIX and the number NUM.
  
!      This string, when output subsequently by 'assemble_name', should
!      produce the output that '(*targetm.asm_out.internal_label)' would
       produce with the same PREFIX and NUM.
  
!      If the string begins with '*', then 'assemble_name' will output the
!      rest of the string unchanged.  It is often convenient for
!      'ASM_GENERATE_INTERNAL_LABEL' to use '*' in this way.  If the
!      string doesn't start with '*', then 'ASM_OUTPUT_LABELREF' gets to
       output the string, and may change it.  (Of course,
!      'ASM_OUTPUT_LABELREF' is also part of your machine description, so
       you should know what it does on your machine.)
  
   -- Macro: ASM_FORMAT_PRIVATE_NAME (OUTVAR, NAME, NUMBER)
       A C expression to assign to OUTVAR (which is a variable of type
!      'char *') a newly allocated string made from the string NAME and
       the number NUMBER, with some suitable punctuation added.  Use
!      'alloca' to get space for the string.
  
!      The string will be used as an argument to 'ASM_OUTPUT_LABELREF' to
       produce an assembler label for an internal static variable whose
       name is NAME.  Therefore, the string must be such as to result in
       valid assembler code.  The argument NUMBER is different each time
*************** This is about outputting labels.
*** 35624,35631 ****
  
       Ideally this string should not be a valid C identifier, to prevent
       any conflict with the user's own symbols.  Most assemblers allow
!      periods or percent signs in assembler symbols; putting at least
!      one of these between the name and the number will suffice.
  
       If this macro is not defined, a default definition will be provided
       which is correct for most systems.
--- 35209,35216 ----
  
       Ideally this string should not be a valid C identifier, to prevent
       any conflict with the user's own symbols.  Most assemblers allow
!      periods or percent signs in assembler symbols; putting at least one
!      of these between the name and the number will suffice.
  
       If this macro is not defined, a default definition will be provided
       which is correct for most systems.
*************** This is about outputting labels.
*** 35634,35640 ****
       A C statement to output to the stdio stream STREAM assembler code
       which defines (equates) the symbol NAME to have the value VALUE.
  
!      If `SET_ASM_OP' is defined, a default definition is provided which
       is correct for most systems.
  
   -- Macro: ASM_OUTPUT_DEF_FROM_DECLS (STREAM, DECL_OF_NAME,
--- 35219,35225 ----
       A C statement to output to the stdio stream STREAM assembler code
       which defines (equates) the symbol NAME to have the value VALUE.
  
!      If 'SET_ASM_OP' is defined, a default definition is provided which
       is correct for most systems.
  
   -- Macro: ASM_OUTPUT_DEF_FROM_DECLS (STREAM, DECL_OF_NAME,
*************** This is about outputting labels.
*** 35642,35651 ****
       A C statement to output to the stdio stream STREAM assembler code
       which defines (equates) the symbol whose tree node is DECL_OF_NAME
       to have the value of the tree node DECL_OF_VALUE.  This macro will
!      be used in preference to `ASM_OUTPUT_DEF' if it is defined and if
       the tree nodes are available.
  
!      If `SET_ASM_OP' is defined, a default definition is provided which
       is correct for most systems.
  
   -- Macro: TARGET_DEFERRED_OUTPUT_DEFS (DECL_OF_NAME, DECL_OF_VALUE)
--- 35227,35236 ----
       A C statement to output to the stdio stream STREAM assembler code
       which defines (equates) the symbol whose tree node is DECL_OF_NAME
       to have the value of the tree node DECL_OF_VALUE.  This macro will
!      be used in preference to 'ASM_OUTPUT_DEF' if it is defined and if
       the tree nodes are available.
  
!      If 'SET_ASM_OP' is defined, a default definition is provided which
       is correct for most systems.
  
   -- Macro: TARGET_DEFERRED_OUTPUT_DEFS (DECL_OF_NAME, DECL_OF_VALUE)
*************** This is about outputting labels.
*** 35654,35669 ****
       have the value of the tree node DECL_OF_VALUE should be emitted
       near the end of the current compilation unit.  The default is to
       not defer output of defines.  This macro affects defines output by
!      `ASM_OUTPUT_DEF' and `ASM_OUTPUT_DEF_FROM_DECLS'.
  
   -- Macro: ASM_OUTPUT_WEAK_ALIAS (STREAM, NAME, VALUE)
       A C statement to output to the stdio stream STREAM assembler code
       which defines (equates) the weak symbol NAME to have the value
!      VALUE.  If VALUE is `NULL', it defines NAME as an undefined weak
       symbol.
  
       Define this macro if the target only supports weak aliases; define
!      `ASM_OUTPUT_DEF' instead if possible.
  
   -- Macro: OBJC_GEN_METHOD_LABEL (BUF, IS_INST, CLASS_NAME, CAT_NAME,
            SEL_NAME)
--- 35239,35254 ----
       have the value of the tree node DECL_OF_VALUE should be emitted
       near the end of the current compilation unit.  The default is to
       not defer output of defines.  This macro affects defines output by
!      'ASM_OUTPUT_DEF' and 'ASM_OUTPUT_DEF_FROM_DECLS'.
  
   -- Macro: ASM_OUTPUT_WEAK_ALIAS (STREAM, NAME, VALUE)
       A C statement to output to the stdio stream STREAM assembler code
       which defines (equates) the weak symbol NAME to have the value
!      VALUE.  If VALUE is 'NULL', it defines NAME as an undefined weak
       symbol.
  
       Define this macro if the target only supports weak aliases; define
!      'ASM_OUTPUT_DEF' instead if possible.
  
   -- Macro: OBJC_GEN_METHOD_LABEL (BUF, IS_INST, CLASS_NAME, CAT_NAME,
            SEL_NAME)
*************** This is about outputting labels.
*** 35671,35695 ****
       Objective-C methods.
  
       The default name is a unique method number followed by the name of
!      the class (e.g. `_1_Foo').  For methods in categories, the name of
       the category is also included in the assembler name (e.g.
!      `_1_Foo_Bar').
  
       These names are safe on most systems, but make debugging difficult
!      since the method's selector is not present in the name.
!      Therefore, particular systems define other ways of computing names.
  
!      BUF is an expression of type `char *' which gives you a buffer in
       which to store the name; its length is as long as CLASS_NAME,
       CAT_NAME and SEL_NAME put together, plus 50 characters extra.
  
       The argument IS_INST specifies whether the method is an instance
       method or a class method; CLASS_NAME is the name of the class;
!      CAT_NAME is the name of the category (or `NULL' if the method is
       not in a category); and SEL_NAME is the name of the selector.
  
!      On systems where the assembler can handle quoted names, you can
!      use this macro to provide more human-readable names.
  
  
  File: gccint.info,  Node: Initialization,  Next: Macros for Initialization,  Prev: Label Output,  Up: Assembler Format
--- 35256,35280 ----
       Objective-C methods.
  
       The default name is a unique method number followed by the name of
!      the class (e.g. '_1_Foo').  For methods in categories, the name of
       the category is also included in the assembler name (e.g.
!      '_1_Foo_Bar').
  
       These names are safe on most systems, but make debugging difficult
!      since the method's selector is not present in the name.  Therefore,
!      particular systems define other ways of computing names.
  
!      BUF is an expression of type 'char *' which gives you a buffer in
       which to store the name; its length is as long as CLASS_NAME,
       CAT_NAME and SEL_NAME put together, plus 50 characters extra.
  
       The argument IS_INST specifies whether the method is an instance
       method or a class method; CLASS_NAME is the name of the class;
!      CAT_NAME is the name of the category (or 'NULL' if the method is
       not in a category); and SEL_NAME is the name of the selector.
  
!      On systems where the assembler can handle quoted names, you can use
!      this macro to provide more human-readable names.
  
  
  File: gccint.info,  Node: Initialization,  Next: Macros for Initialization,  Prev: Label Output,  Up: Assembler Format
*************** File: gccint.info,  Node: Initialization
*** 35700,35706 ****
  The compiled code for certain languages includes "constructors" (also
  called "initialization routines")--functions to initialize data in the
  program when the program is started.  These functions need to be called
! before the program is "started"--that is to say, before `main' is
  called.
  
   Compiling some languages generates "destructors" (also called
--- 35285,35291 ----
  The compiled code for certain languages includes "constructors" (also
  called "initialization routines")--functions to initialize data in the
  program when the program is started.  These functions need to be called
! before the program is "started"--that is to say, before 'main' is
  called.
  
   Compiling some languages generates "destructors" (also called
*************** initialization and termination functions
*** 35717,35724 ****
  Much of the structure is common to all four variations.
  
   The linker must build two lists of these functions--a list of
! initialization functions, called `__CTOR_LIST__', and a list of
! termination functions, called `__DTOR_LIST__'.
  
   Each list always begins with an ignored function pointer (which may
  hold 0, -1, or a count of the function pointers after it, depending on
--- 35302,35309 ----
  Much of the structure is common to all four variations.
  
   The linker must build two lists of these functions--a list of
! initialization functions, called '__CTOR_LIST__', and a list of
! termination functions, called '__DTOR_LIST__'.
  
   Each list always begins with an ignored function pointer (which may
  hold 0, -1, or a count of the function pointers after it, depending on
*************** pointers to constructors (or destructors
*** 35727,35807 ****
  pointer containing zero.
  
   Depending on the operating system and its executable file format,
! either `crtstuff.c' or `libgcc2.c' traverses these lists at startup
! time and exit time.  Constructors are called in reverse order of the
! list; destructors in forward order.
  
   The best way to handle static constructors works only for object file
  formats which provide arbitrarily-named sections.  A section is set
  aside for a list of constructors, and another for a list of destructors.
! Traditionally these are called `.ctors' and `.dtors'.  Each object file
  that defines an initialization function also puts a word in the
  constructor section to point to that function.  The linker accumulates
! all these words into one contiguous `.ctors' section.  Termination
  functions are handled similarly.
  
!  This method will be chosen as the default by `target-def.h' if
! `TARGET_ASM_NAMED_SECTION' is defined.  A target that does not support
  arbitrary sections, but does support special designated constructor and
! destructor sections may define `CTORS_SECTION_ASM_OP' and
! `DTORS_SECTION_ASM_OP' to achieve the same effect.
  
   When arbitrary sections are available, there are two variants,
! depending upon how the code in `crtstuff.c' is called.  On systems that
! support a ".init" section which is executed at program startup, parts
! of `crtstuff.c' are compiled into that section.  The program is linked
! by the `gcc' driver like this:
  
       ld -o OUTPUT_FILE crti.o crtbegin.o ... -lgcc crtend.o crtn.o
  
!  The prologue of a function (`__init') appears in the `.init' section
! of `crti.o'; the epilogue appears in `crtn.o'.  Likewise for the
! function `__fini' in the ".fini" section.  Normally these files are
! provided by the operating system or by the GNU C library, but are
! provided by GCC for a few targets.
  
!  The objects `crtbegin.o' and `crtend.o' are (for most targets)
! compiled from `crtstuff.c'.  They contain, among other things, code
! fragments within the `.init' and `.fini' sections that branch to
! routines in the `.text' section.  The linker will pull all parts of a
! section together, which results in a complete `__init' function that
! invokes the routines we need at startup.
  
!  To use this variant, you must define the `INIT_SECTION_ASM_OP' macro
  properly.
  
   If no init section is available, when GCC compiles any function called
! `main' (or more accurately, any function designated as a program entry
! point by the language front end calling `expand_main_function'), it
! inserts a procedure call to `__main' as the first executable code after
! the function prologue.  The `__main' function is defined in `libgcc2.c'
  and runs the global constructors.
  
   In file formats that don't support arbitrary sections, there are again
! two variants.  In the simplest variant, the GNU linker (GNU `ld') and
! an `a.out' format must be used.  In this case, `TARGET_ASM_CONSTRUCTOR'
! is defined to produce a `.stabs' entry of type `N_SETT', referencing
! the name `__CTOR_LIST__', and with the address of the void function
  containing the initialization code as its value.  The GNU linker
! recognizes this as a request to add the value to a "set"; the values
! are accumulated, and are eventually placed in the executable as a
! vector in the format described above, with a leading (ignored) count
! and a trailing zero element.  `TARGET_ASM_DESTRUCTOR' is handled
! similarly.  Since no init section is available, the absence of
! `INIT_SECTION_ASM_OP' causes the compilation of `main' to call `__main'
! as above, starting the initialization process.
  
   The last variant uses neither arbitrary sections nor the GNU linker.
  This is preferable when you want to do dynamic linking and when using
! file formats which the GNU linker does not support, such as `ECOFF'.  In
! this case, `TARGET_HAVE_CTORS_DTORS' is false, initialization and
  termination functions are recognized simply by their names.  This
! requires an extra program in the linkage step, called `collect2'.  This
  program pretends to be the linker, for use with GCC; it does its job by
  running the ordinary linker, but also arranges to include the vectors of
  initialization and termination functions.  These functions are called
! via `__main' as described above.  In order to use this method,
! `use_collect2' must be defined in the target in `config.gcc'.
  
   The following section describes the specific macros that control and
  customize the handling of initialization and termination functions.
--- 35312,35392 ----
  pointer containing zero.
  
   Depending on the operating system and its executable file format,
! either 'crtstuff.c' or 'libgcc2.c' traverses these lists at startup time
! and exit time.  Constructors are called in reverse order of the list;
! destructors in forward order.
  
   The best way to handle static constructors works only for object file
  formats which provide arbitrarily-named sections.  A section is set
  aside for a list of constructors, and another for a list of destructors.
! Traditionally these are called '.ctors' and '.dtors'.  Each object file
  that defines an initialization function also puts a word in the
  constructor section to point to that function.  The linker accumulates
! all these words into one contiguous '.ctors' section.  Termination
  functions are handled similarly.
  
!  This method will be chosen as the default by 'target-def.h' if
! 'TARGET_ASM_NAMED_SECTION' is defined.  A target that does not support
  arbitrary sections, but does support special designated constructor and
! destructor sections may define 'CTORS_SECTION_ASM_OP' and
! 'DTORS_SECTION_ASM_OP' to achieve the same effect.
  
   When arbitrary sections are available, there are two variants,
! depending upon how the code in 'crtstuff.c' is called.  On systems that
! support a ".init" section which is executed at program startup, parts of
! 'crtstuff.c' are compiled into that section.  The program is linked by
! the 'gcc' driver like this:
  
       ld -o OUTPUT_FILE crti.o crtbegin.o ... -lgcc crtend.o crtn.o
  
!  The prologue of a function ('__init') appears in the '.init' section of
! 'crti.o'; the epilogue appears in 'crtn.o'.  Likewise for the function
! '__fini' in the ".fini" section.  Normally these files are provided by
! the operating system or by the GNU C library, but are provided by GCC
! for a few targets.
  
!  The objects 'crtbegin.o' and 'crtend.o' are (for most targets) compiled
! from 'crtstuff.c'.  They contain, among other things, code fragments
! within the '.init' and '.fini' sections that branch to routines in the
! '.text' section.  The linker will pull all parts of a section together,
! which results in a complete '__init' function that invokes the routines
! we need at startup.
  
!  To use this variant, you must define the 'INIT_SECTION_ASM_OP' macro
  properly.
  
   If no init section is available, when GCC compiles any function called
! 'main' (or more accurately, any function designated as a program entry
! point by the language front end calling 'expand_main_function'), it
! inserts a procedure call to '__main' as the first executable code after
! the function prologue.  The '__main' function is defined in 'libgcc2.c'
  and runs the global constructors.
  
   In file formats that don't support arbitrary sections, there are again
! two variants.  In the simplest variant, the GNU linker (GNU 'ld') and an
! 'a.out' format must be used.  In this case, 'TARGET_ASM_CONSTRUCTOR' is
! defined to produce a '.stabs' entry of type 'N_SETT', referencing the
! name '__CTOR_LIST__', and with the address of the void function
  containing the initialization code as its value.  The GNU linker
! recognizes this as a request to add the value to a "set"; the values are
! accumulated, and are eventually placed in the executable as a vector in
! the format described above, with a leading (ignored) count and a
! trailing zero element.  'TARGET_ASM_DESTRUCTOR' is handled similarly.
! Since no init section is available, the absence of 'INIT_SECTION_ASM_OP'
! causes the compilation of 'main' to call '__main' as above, starting the
! initialization process.
  
   The last variant uses neither arbitrary sections nor the GNU linker.
  This is preferable when you want to do dynamic linking and when using
! file formats which the GNU linker does not support, such as 'ECOFF'.  In
! this case, 'TARGET_HAVE_CTORS_DTORS' is false, initialization and
  termination functions are recognized simply by their names.  This
! requires an extra program in the linkage step, called 'collect2'.  This
  program pretends to be the linker, for use with GCC; it does its job by
  running the ordinary linker, but also arranges to include the vectors of
  initialization and termination functions.  These functions are called
! via '__main' as described above.  In order to use this method,
! 'use_collect2' must be defined in the target in 'config.gcc'.
  
   The following section describes the specific macros that control and
  customize the handling of initialization and termination functions.
*************** and termination functions:
*** 35821,35834 ****
       initialization code.  If not defined, GCC will assume such a
       section does not exist.  When you are using special sections for
       initialization and termination functions, this macro also controls
!      how `crtstuff.c' and `libgcc2.c' arrange to run the initialization
       functions.
  
   -- Macro: HAS_INIT_SECTION
!      If defined, `main' will not call `__main' as described above.
!      This macro should be defined for systems that control start-up code
!      on a symbol-by-symbol basis, such as OSF/1, and should not be
!      defined explicitly for systems that support `INIT_SECTION_ASM_OP'.
  
   -- Macro: LD_INIT_SWITCH
       If defined, a C string constant for a switch that tells the linker
--- 35406,35419 ----
       initialization code.  If not defined, GCC will assume such a
       section does not exist.  When you are using special sections for
       initialization and termination functions, this macro also controls
!      how 'crtstuff.c' and 'libgcc2.c' arrange to run the initialization
       functions.
  
   -- Macro: HAS_INIT_SECTION
!      If defined, 'main' will not call '__main' as described above.  This
!      macro should be defined for systems that control start-up code on a
!      symbol-by-symbol basis, such as OSF/1, and should not be defined
!      explicitly for systems that support 'INIT_SECTION_ASM_OP'.
  
   -- Macro: LD_INIT_SWITCH
       If defined, a C string constant for a switch that tells the linker
*************** and termination functions:
*** 35843,35926 ****
       automatically called when a shared library is loaded.  The function
       should call FUNC, which takes no arguments.  If not defined, and
       the object format requires an explicit initialization function,
!      then a function called `_GLOBAL__DI' will be generated.
  
       This function and the following one are used by collect2 when
!      linking a shared library that needs constructors or destructors,
!      or has DWARF2 exception tables embedded in the code.
  
   -- Macro: COLLECT_SHARED_FINI_FUNC (STREAM, FUNC)
       If defined, a C statement that will write a function that can be
       automatically called when a shared library is unloaded.  The
       function should call FUNC, which takes no arguments.  If not
       defined, and the object format requires an explicit finalization
!      function, then a function called `_GLOBAL__DD' will be generated.
  
   -- Macro: INVOKE__main
!      If defined, `main' will call `__main' despite the presence of
!      `INIT_SECTION_ASM_OP'.  This macro should be defined for systems
       where the init section is not actually run automatically, but is
       still useful for collecting the lists of constructors and
       destructors.
  
   -- Macro: SUPPORTS_INIT_PRIORITY
!      If nonzero, the C++ `init_priority' attribute is supported and the
       compiler should emit instructions to control the order of
       initialization of objects.  If zero, the compiler will issue an
!      error message upon encountering an `init_priority' attribute.
  
   -- Target Hook: bool TARGET_HAVE_CTORS_DTORS
       This value is true if the target supports some "native" method of
       collecting constructors and destructors to be run at startup and
!      exit.  It is false if we must use `collect2'.
  
   -- Target Hook: void TARGET_ASM_CONSTRUCTOR (rtx SYMBOL, int PRIORITY)
       If defined, a function that outputs assembler code to arrange to
       call the function referenced by SYMBOL at initialization time.
  
!      Assume that SYMBOL is a `SYMBOL_REF' for a function taking no
       arguments and with no return value.  If the target supports
       initialization priorities, PRIORITY is a value between 0 and
!      `MAX_INIT_PRIORITY'; otherwise it must be `DEFAULT_INIT_PRIORITY'.
  
       If this macro is not defined by the target, a suitable default will
       be chosen if (1) the target supports arbitrary section names, (2)
!      the target defines `CTORS_SECTION_ASM_OP', or (3) `USE_COLLECT2'
!      is not defined.
  
   -- Target Hook: void TARGET_ASM_DESTRUCTOR (rtx SYMBOL, int PRIORITY)
!      This is like `TARGET_ASM_CONSTRUCTOR' but used for termination
       functions rather than initialization functions.
  
!  If `TARGET_HAVE_CTORS_DTORS' is true, the initialization routine
  generated for the generated object file will have static linkage.
  
!  If your system uses `collect2' as the means of processing
! constructors, then that program normally uses `nm' to scan an object
! file for constructor functions to be called.
  
   On certain kinds of systems, you can define this macro to make
! `collect2' work faster (and, in some cases, make it work at all):
  
   -- Macro: OBJECT_FORMAT_COFF
       Define this macro if the system uses COFF (Common Object File
!      Format) object files, so that `collect2' can assume this format
!      and scan object files directly for dynamic constructor/destructor
       functions.
  
!      This macro is effective only in a native compiler; `collect2' as
!      part of a cross compiler always uses `nm' for the target machine.
  
   -- Macro: REAL_NM_FILE_NAME
       Define this macro as a C string constant containing the file name
!      to use to execute `nm'.  The default is to search the path
!      normally for `nm'.
  
   -- Macro: NM_FLAGS
!      `collect2' calls `nm' to scan object files for static constructors
!      and destructors and LTO info.  By default, `-n' is passed.  Define
!      `NM_FLAGS' to a C string constant if other options are needed to
!      get the same output format as GNU `nm -n' produces.
  
   If your system supports shared libraries and has a program to list the
  dynamic dependencies of a given library or executable, you can define
--- 35428,35511 ----
       automatically called when a shared library is loaded.  The function
       should call FUNC, which takes no arguments.  If not defined, and
       the object format requires an explicit initialization function,
!      then a function called '_GLOBAL__DI' will be generated.
  
       This function and the following one are used by collect2 when
!      linking a shared library that needs constructors or destructors, or
!      has DWARF2 exception tables embedded in the code.
  
   -- Macro: COLLECT_SHARED_FINI_FUNC (STREAM, FUNC)
       If defined, a C statement that will write a function that can be
       automatically called when a shared library is unloaded.  The
       function should call FUNC, which takes no arguments.  If not
       defined, and the object format requires an explicit finalization
!      function, then a function called '_GLOBAL__DD' will be generated.
  
   -- Macro: INVOKE__main
!      If defined, 'main' will call '__main' despite the presence of
!      'INIT_SECTION_ASM_OP'.  This macro should be defined for systems
       where the init section is not actually run automatically, but is
       still useful for collecting the lists of constructors and
       destructors.
  
   -- Macro: SUPPORTS_INIT_PRIORITY
!      If nonzero, the C++ 'init_priority' attribute is supported and the
       compiler should emit instructions to control the order of
       initialization of objects.  If zero, the compiler will issue an
!      error message upon encountering an 'init_priority' attribute.
  
   -- Target Hook: bool TARGET_HAVE_CTORS_DTORS
       This value is true if the target supports some "native" method of
       collecting constructors and destructors to be run at startup and
!      exit.  It is false if we must use 'collect2'.
  
   -- Target Hook: void TARGET_ASM_CONSTRUCTOR (rtx SYMBOL, int PRIORITY)
       If defined, a function that outputs assembler code to arrange to
       call the function referenced by SYMBOL at initialization time.
  
!      Assume that SYMBOL is a 'SYMBOL_REF' for a function taking no
       arguments and with no return value.  If the target supports
       initialization priorities, PRIORITY is a value between 0 and
!      'MAX_INIT_PRIORITY'; otherwise it must be 'DEFAULT_INIT_PRIORITY'.
  
       If this macro is not defined by the target, a suitable default will
       be chosen if (1) the target supports arbitrary section names, (2)
!      the target defines 'CTORS_SECTION_ASM_OP', or (3) 'USE_COLLECT2' is
!      not defined.
  
   -- Target Hook: void TARGET_ASM_DESTRUCTOR (rtx SYMBOL, int PRIORITY)
!      This is like 'TARGET_ASM_CONSTRUCTOR' but used for termination
       functions rather than initialization functions.
  
!  If 'TARGET_HAVE_CTORS_DTORS' is true, the initialization routine
  generated for the generated object file will have static linkage.
  
!  If your system uses 'collect2' as the means of processing constructors,
! then that program normally uses 'nm' to scan an object file for
! constructor functions to be called.
  
   On certain kinds of systems, you can define this macro to make
! 'collect2' work faster (and, in some cases, make it work at all):
  
   -- Macro: OBJECT_FORMAT_COFF
       Define this macro if the system uses COFF (Common Object File
!      Format) object files, so that 'collect2' can assume this format and
!      scan object files directly for dynamic constructor/destructor
       functions.
  
!      This macro is effective only in a native compiler; 'collect2' as
!      part of a cross compiler always uses 'nm' for the target machine.
  
   -- Macro: REAL_NM_FILE_NAME
       Define this macro as a C string constant containing the file name
!      to use to execute 'nm'.  The default is to search the path normally
!      for 'nm'.
  
   -- Macro: NM_FLAGS
!      'collect2' calls 'nm' to scan object files for static constructors
!      and destructors and LTO info.  By default, '-n' is passed.  Define
!      'NM_FLAGS' to a C string constant if other options are needed to
!      get the same output format as GNU 'nm -n' produces.
  
   If your system supports shared libraries and has a program to list the
  dynamic dependencies of a given library or executable, you can define
*************** these macros to enable support for runni
*** 35928,35951 ****
  termination functions in shared libraries:
  
   -- Macro: LDD_SUFFIX
!      Define this macro to a C string constant containing the name of
!      the program which lists dynamic dependencies, like `ldd' under
!      SunOS 4.
  
   -- Macro: PARSE_LDD_OUTPUT (PTR)
       Define this macro to be C code that extracts filenames from the
!      output of the program denoted by `LDD_SUFFIX'.  PTR is a variable
!      of type `char *' that points to the beginning of a line of output
!      from `LDD_SUFFIX'.  If the line lists a dynamic dependency, the
       code must advance PTR to the beginning of the filename on that
!      line.  Otherwise, it must set PTR to `NULL'.
  
   -- Macro: SHLIB_SUFFIX
       Define this macro to a C string constant containing the default
!      shared library extension of the target (e.g., `".so"').  `collect2'
       strips version information after this suffix when generating global
       constructor and destructor names.  This define is only needed on
!      targets that use `collect2' to process constructors and
       destructors.
  
  
--- 35513,35535 ----
  termination functions in shared libraries:
  
   -- Macro: LDD_SUFFIX
!      Define this macro to a C string constant containing the name of the
!      program which lists dynamic dependencies, like 'ldd' under SunOS 4.
  
   -- Macro: PARSE_LDD_OUTPUT (PTR)
       Define this macro to be C code that extracts filenames from the
!      output of the program denoted by 'LDD_SUFFIX'.  PTR is a variable
!      of type 'char *' that points to the beginning of a line of output
!      from 'LDD_SUFFIX'.  If the line lists a dynamic dependency, the
       code must advance PTR to the beginning of the filename on that
!      line.  Otherwise, it must set PTR to 'NULL'.
  
   -- Macro: SHLIB_SUFFIX
       Define this macro to a C string constant containing the default
!      shared library extension of the target (e.g., '".so"').  'collect2'
       strips version information after this suffix when generating global
       constructor and destructor names.  This define is only needed on
!      targets that use 'collect2' to process constructors and
       destructors.
  
  
*************** This describes assembler instruction out
*** 35963,35984 ****
       language.
  
   -- Macro: ADDITIONAL_REGISTER_NAMES
!      If defined, a C initializer for an array of structures containing
!      a name and a register number.  This macro defines additional names
!      for hard registers, thus allowing the `asm' option in declarations
       to refer to registers using alternate names.
  
   -- Macro: OVERLAPPING_REGISTER_NAMES
       If defined, a C initializer for an array of structures containing a
       name, a register number and a count of the number of consecutive
       machine registers the name overlaps.  This macro defines additional
!      names for hard registers, thus allowing the `asm' option in
       declarations to refer to registers using alternate names.  Unlike
!      `ADDITIONAL_REGISTER_NAMES', this macro should be used when the
       register name implies multiple underlying registers.
  
       This macro should be used when it is important that a clobber in an
!      `asm' statement clobbers all the underlying values implied by the
       register name.  For example, on ARM, clobbering the
       double-precision VFP register "d0" implies clobbering both
       single-precision registers "s0" and "s1".
--- 35547,35568 ----
       language.
  
   -- Macro: ADDITIONAL_REGISTER_NAMES
!      If defined, a C initializer for an array of structures containing a
!      name and a register number.  This macro defines additional names
!      for hard registers, thus allowing the 'asm' option in declarations
       to refer to registers using alternate names.
  
   -- Macro: OVERLAPPING_REGISTER_NAMES
       If defined, a C initializer for an array of structures containing a
       name, a register number and a count of the number of consecutive
       machine registers the name overlaps.  This macro defines additional
!      names for hard registers, thus allowing the 'asm' option in
       declarations to refer to registers using alternate names.  Unlike
!      'ADDITIONAL_REGISTER_NAMES', this macro should be used when the
       register name implies multiple underlying registers.
  
       This macro should be used when it is important that a clobber in an
!      'asm' statement clobbers all the underlying values implied by the
       register name.  For example, on ARM, clobbering the
       double-precision VFP register "d0" implies clobbering both
       single-precision registers "s0" and "s1".
*************** This describes assembler instruction out
*** 35989,36009 ****
  
       The definition is a C statement or statements which output an
       assembler instruction opcode to the stdio stream STREAM.  The
!      macro-operand PTR is a variable of type `char *' which points to
!      the opcode name in its "internal" form--the form that is written
!      in the machine description.  The definition should output the
!      opcode name to STREAM, performing any translation you desire, and
       increment the variable PTR to point at the end of the opcode so
       that it will not be output twice.
  
       In fact, your macro definition may process less than the entire
       opcode name, or more than the opcode name; but if you want to
!      process text that includes `%'-sequences to substitute operands,
       you must take care of the substitution yourself.  Just be sure to
       increment PTR over whatever text should not be output normally.
  
       If you need to look at the operand values, they can be found as the
!      elements of `recog_data.operand'.
  
       If the macro definition does nothing, the instruction is output in
       the usual way.
--- 35573,35593 ----
  
       The definition is a C statement or statements which output an
       assembler instruction opcode to the stdio stream STREAM.  The
!      macro-operand PTR is a variable of type 'char *' which points to
!      the opcode name in its "internal" form--the form that is written in
!      the machine description.  The definition should output the opcode
!      name to STREAM, performing any translation you desire, and
       increment the variable PTR to point at the end of the opcode so
       that it will not be output twice.
  
       In fact, your macro definition may process less than the entire
       opcode name, or more than the opcode name; but if you want to
!      process text that includes '%'-sequences to substitute operands,
       you must take care of the substitution yourself.  Just be sure to
       increment PTR over whatever text should not be output normally.
  
       If you need to look at the operand values, they can be found as the
!      elements of 'recog_data.operand'.
  
       If the macro definition does nothing, the instruction is output in
       the usual way.
*************** This describes assembler instruction out
*** 36014,36032 ****
       they will be output differently.
  
       Here the argument OPVEC is the vector containing the operands
!      extracted from INSN, and NOPERANDS is the number of elements of
!      the vector which contain meaningful data for this insn.  The
!      contents of this vector are what will be used to convert the insn
!      template into assembler code, so you can change the assembler
!      output by changing the contents of the vector.
  
       This macro is useful when various assembler syntaxes share a single
       file of instruction patterns; by defining this macro differently,
       you can cause a large class of instructions to be output
       differently (such as with rearranged operands).  Naturally,
       variations in assembler syntax affecting individual insn patterns
!      ought to be handled by writing conditional output routines in
!      those patterns.
  
       If this macro is not defined, it is equivalent to a null statement.
  
--- 35598,35616 ----
       they will be output differently.
  
       Here the argument OPVEC is the vector containing the operands
!      extracted from INSN, and NOPERANDS is the number of elements of the
!      vector which contain meaningful data for this insn.  The contents
!      of this vector are what will be used to convert the insn template
!      into assembler code, so you can change the assembler output by
!      changing the contents of the vector.
  
       This macro is useful when various assembler syntaxes share a single
       file of instruction patterns; by defining this macro differently,
       you can cause a large class of instructions to be output
       differently (such as with rearranged operands).  Naturally,
       variations in assembler syntax affecting individual insn patterns
!      ought to be handled by writing conditional output routines in those
!      patterns.
  
       If this macro is not defined, it is equivalent to a null statement.
  
*************** This describes assembler instruction out
*** 36037,36047 ****
       the assembler if necessary.
  
       Here the argument OPVEC is the vector containing the operands
!      extracted from INSN, and NOPERANDS is the number of elements of
!      the vector which contain meaningful data for this insn.  The
!      contents of this vector are what was used to convert the insn
!      template into assembler code, so you can change the assembler mode
!      by checking the contents of the vector.
  
   -- Macro: PRINT_OPERAND (STREAM, X, CODE)
       A C compound statement to output to stdio stream STREAM the
--- 35621,35631 ----
       the assembler if necessary.
  
       Here the argument OPVEC is the vector containing the operands
!      extracted from INSN, and NOPERANDS is the number of elements of the
!      vector which contain meaningful data for this insn.  The contents
!      of this vector are what was used to convert the insn template into
!      assembler code, so you can change the assembler mode by checking
!      the contents of the vector.
  
   -- Macro: PRINT_OPERAND (STREAM, X, CODE)
       A C compound statement to output to stdio stream STREAM the
*************** This describes assembler instruction out
*** 36051,36074 ****
       CODE is a value that can be used to specify one of several ways of
       printing the operand.  It is used when identical operands must be
       printed differently depending on the context.  CODE comes from the
!      `%' specification that was used to request printing of the
!      operand.  If the specification was just `%DIGIT' then CODE is 0;
!      if the specification was `%LTR DIGIT' then CODE is the ASCII code
!      for LTR.
  
       If X is a register, this macro should print the register's name.
!      The names can be found in an array `reg_names' whose type is `char
!      *[]'.  `reg_names' is initialized from `REGISTER_NAMES'.
  
!      When the machine description has a specification `%PUNCT' (a `%'
       followed by a punctuation character), this macro is called with a
       null pointer for X and the punctuation character for CODE.
  
   -- Macro: PRINT_OPERAND_PUNCT_VALID_P (CODE)
       A C expression which evaluates to true if CODE is a valid
!      punctuation character for use in the `PRINT_OPERAND' macro.  If
!      `PRINT_OPERAND_PUNCT_VALID_P' is not defined, it means that no
!      punctuation characters (except for the standard one, `%') are used
       in this way.
  
   -- Macro: PRINT_OPERAND_ADDRESS (STREAM, X)
--- 35635,35657 ----
       CODE is a value that can be used to specify one of several ways of
       printing the operand.  It is used when identical operands must be
       printed differently depending on the context.  CODE comes from the
!      '%' specification that was used to request printing of the operand.
!      If the specification was just '%DIGIT' then CODE is 0; if the
!      specification was '%LTR DIGIT' then CODE is the ASCII code for LTR.
  
       If X is a register, this macro should print the register's name.
!      The names can be found in an array 'reg_names' whose type is 'char
!      *[]'.  'reg_names' is initialized from 'REGISTER_NAMES'.
  
!      When the machine description has a specification '%PUNCT' (a '%'
       followed by a punctuation character), this macro is called with a
       null pointer for X and the punctuation character for CODE.
  
   -- Macro: PRINT_OPERAND_PUNCT_VALID_P (CODE)
       A C expression which evaluates to true if CODE is a valid
!      punctuation character for use in the 'PRINT_OPERAND' macro.  If
!      'PRINT_OPERAND_PUNCT_VALID_P' is not defined, it means that no
!      punctuation characters (except for the standard one, '%') are used
       in this way.
  
   -- Macro: PRINT_OPERAND_ADDRESS (STREAM, X)
*************** This describes assembler instruction out
*** 36078,36090 ****
  
       On some machines, the syntax for a symbolic address depends on the
       section that the address refers to.  On these machines, define the
!      hook `TARGET_ENCODE_SECTION_INFO' to store the information into the
!      `symbol_ref', and then check for it here.  *Note Assembler
       Format::.
  
   -- Macro: DBR_OUTPUT_SEQEND (FILE)
       A C statement, to be executed after all slot-filler instructions
!      have been output.  If necessary, call `dbr_sequence_length' to
       determine the number of slots filled in a sequence (zero if not
       currently outputting a sequence), to decide how many no-ops to
       output, or whatever.
--- 35661,35673 ----
  
       On some machines, the syntax for a symbolic address depends on the
       section that the address refers to.  On these machines, define the
!      hook 'TARGET_ENCODE_SECTION_INFO' to store the information into the
!      'symbol_ref', and then check for it here.  *Note Assembler
       Format::.
  
   -- Macro: DBR_OUTPUT_SEQEND (FILE)
       A C statement, to be executed after all slot-filler instructions
!      have been output.  If necessary, call 'dbr_sequence_length' to
       determine the number of slots filled in a sequence (zero if not
       currently outputting a sequence), to decide how many no-ops to
       output, or whatever.
*************** This describes assembler instruction out
*** 36095,36118 ****
  
   Note that output routines for instructions with delay slots must be
  prepared to deal with not being output as part of a sequence (i.e. when
! the scheduling pass is not run, or when no slot fillers could be
! found.)  The variable `final_sequence' is null when not processing a
! sequence, otherwise it contains the `sequence' rtx being output.
  
   -- Macro: REGISTER_PREFIX
   -- Macro: LOCAL_LABEL_PREFIX
   -- Macro: USER_LABEL_PREFIX
   -- Macro: IMMEDIATE_PREFIX
!      If defined, C string expressions to be used for the `%R', `%L',
!      `%U', and `%I' options of `asm_fprintf' (see `final.c').  These
!      are useful when a single `md' file must support multiple assembler
!      formats.  In that case, the various `tm.h' files can define these
       macros differently.
  
   -- Macro: ASM_FPRINTF_EXTENSIONS (FILE, ARGPTR, FORMAT)
!      If defined this macro should expand to a series of `case'
!      statements which will be parsed inside the `switch' statement of
!      the `asm_fprintf' function.  This allows targets to define extra
       printf formats which may useful when generating their assembler
       statements.  Note that uppercase letters are reserved for future
       generic extensions to asm_fprintf, and so are not available to
--- 35678,35701 ----
  
   Note that output routines for instructions with delay slots must be
  prepared to deal with not being output as part of a sequence (i.e. when
! the scheduling pass is not run, or when no slot fillers could be found.)
! The variable 'final_sequence' is null when not processing a sequence,
! otherwise it contains the 'sequence' rtx being output.
  
   -- Macro: REGISTER_PREFIX
   -- Macro: LOCAL_LABEL_PREFIX
   -- Macro: USER_LABEL_PREFIX
   -- Macro: IMMEDIATE_PREFIX
!      If defined, C string expressions to be used for the '%R', '%L',
!      '%U', and '%I' options of 'asm_fprintf' (see 'final.c').  These are
!      useful when a single 'md' file must support multiple assembler
!      formats.  In that case, the various 'tm.h' files can define these
       macros differently.
  
   -- Macro: ASM_FPRINTF_EXTENSIONS (FILE, ARGPTR, FORMAT)
!      If defined this macro should expand to a series of 'case'
!      statements which will be parsed inside the 'switch' statement of
!      the 'asm_fprintf' function.  This allows targets to define extra
       printf formats which may useful when generating their assembler
       statements.  Note that uppercase letters are reserved for future
       generic extensions to asm_fprintf, and so are not available to
*************** sequence, otherwise it contains the `seq
*** 36128,36152 ****
       use, with zero as the first variant.
  
       If this macro is defined, you may use constructs of the form
!           `{option0|option1|option2...}'
!      in the output templates of patterns (*note Output Template::) or
!      in the first argument of `asm_fprintf'.  This construct outputs
!      `option0', `option1', `option2', etc., if the value of
!      `ASSEMBLER_DIALECT' is zero, one, two, etc.  Any special characters
       within these strings retain their usual meaning.  If there are
       fewer alternatives within the braces than the value of
!      `ASSEMBLER_DIALECT', the construct outputs nothing. If it's needed
!      to print curly braces or `|' character in assembler output
!      directly, `%{', `%}' and `%|' can be used.
  
!      If you do not define this macro, the characters `{', `|' and `}'
!      do not have any special meaning when used in templates or operands
!      to `asm_fprintf'.
  
!      Define the macros `REGISTER_PREFIX', `LOCAL_LABEL_PREFIX',
!      `USER_LABEL_PREFIX' and `IMMEDIATE_PREFIX' if you can express the
       variations in assembler language syntax with that mechanism.
!      Define `ASSEMBLER_DIALECT' and use the `{option0|option1}' syntax
       if the syntax variant are larger and involve such things as
       different opcodes or operand order.
  
--- 35711,35735 ----
       use, with zero as the first variant.
  
       If this macro is defined, you may use constructs of the form
!           '{option0|option1|option2...}'
!      in the output templates of patterns (*note Output Template::) or in
!      the first argument of 'asm_fprintf'.  This construct outputs
!      'option0', 'option1', 'option2', etc., if the value of
!      'ASSEMBLER_DIALECT' is zero, one, two, etc.  Any special characters
       within these strings retain their usual meaning.  If there are
       fewer alternatives within the braces than the value of
!      'ASSEMBLER_DIALECT', the construct outputs nothing.  If it's needed
!      to print curly braces or '|' character in assembler output
!      directly, '%{', '%}' and '%|' can be used.
  
!      If you do not define this macro, the characters '{', '|' and '}' do
!      not have any special meaning when used in templates or operands to
!      'asm_fprintf'.
  
!      Define the macros 'REGISTER_PREFIX', 'LOCAL_LABEL_PREFIX',
!      'USER_LABEL_PREFIX' and 'IMMEDIATE_PREFIX' if you can express the
       variations in assembler language syntax with that mechanism.
!      Define 'ASSEMBLER_DIALECT' and use the '{option0|option1}' syntax
       if the syntax variant are larger and involve such things as
       different opcodes or operand order.
  
*************** sequence, otherwise it contains the `seq
*** 36157,36164 ****
  
   -- Macro: ASM_OUTPUT_REG_POP (STREAM, REGNO)
       A C expression to output to STREAM some assembler code which will
!      pop hard register number REGNO off of the stack.  The code need
!      not be optimal, since this macro is used only when profiling.
  
  
  File: gccint.info,  Node: Dispatch Tables,  Next: Exception Region Output,  Prev: Instruction Output,  Up: Assembler Format
--- 35740,35747 ----
  
   -- Macro: ASM_OUTPUT_REG_POP (STREAM, REGNO)
       A C expression to output to STREAM some assembler code which will
!      pop hard register number REGNO off of the stack.  The code need not
!      be optimal, since this macro is used only when profiling.
  
  
  File: gccint.info,  Node: Dispatch Tables,  Next: Exception Region Output,  Prev: Instruction Output,  Up: Assembler Format
*************** This concerns dispatch tables.
*** 36173,36179 ****
       pseudo-instruction to generate a difference between two labels.
       VALUE and REL are the numbers of two internal labels.  The
       definitions of these labels are output using
!      `(*targetm.asm_out.internal_label)', and they must be printed in
       the same way here.  For example,
  
            fprintf (STREAM, "\t.word L%d-L%d\n",
--- 35756,35762 ----
       pseudo-instruction to generate a difference between two labels.
       VALUE and REL are the numbers of two internal labels.  The
       definitions of these labels are output using
!      '(*targetm.asm_out.internal_label)', and they must be printed in
       the same way here.  For example,
  
            fprintf (STREAM, "\t.word L%d-L%d\n",
*************** This concerns dispatch tables.
*** 36182,36188 ****
       You must provide this macro on machines where the addresses in a
       dispatch table are relative to the table's own address.  If
       defined, GCC will also use this macro on all machines when
!      producing PIC.  BODY is the body of the `ADDR_DIFF_VEC'; it is
       provided so that the mode and flags can be read.
  
   -- Macro: ASM_OUTPUT_ADDR_VEC_ELT (STREAM, VALUE)
--- 35765,35771 ----
       You must provide this macro on machines where the addresses in a
       dispatch table are relative to the table's own address.  If
       defined, GCC will also use this macro on all machines when
!      producing PIC.  BODY is the body of the 'ADDR_DIFF_VEC'; it is
       provided so that the mode and flags can be read.
  
   -- Macro: ASM_OUTPUT_ADDR_VEC_ELT (STREAM, VALUE)
*************** This concerns dispatch tables.
*** 36193,36222 ****
       stream STREAM an assembler pseudo-instruction to generate a
       reference to a label.  VALUE is the number of an internal label
       whose definition is output using
!      `(*targetm.asm_out.internal_label)'.  For example,
  
            fprintf (STREAM, "\t.word L%d\n", VALUE)
  
   -- Macro: ASM_OUTPUT_CASE_LABEL (STREAM, PREFIX, NUM, TABLE)
       Define this if the label before a jump-table needs to be output
       specially.  The first three arguments are the same as for
!      `(*targetm.asm_out.internal_label)'; the fourth argument is the
!      jump-table which follows (a `jump_table_data' containing an
!      `addr_vec' or `addr_diff_vec').
  
!      This feature is used on system V to output a `swbeg' statement for
       the table.
  
       If this macro is not defined, these labels are output with
!      `(*targetm.asm_out.internal_label)'.
  
   -- Macro: ASM_OUTPUT_CASE_END (STREAM, NUM, TABLE)
       Define this if something special must be output at the end of a
       jump-table.  The definition should be a C statement to be executed
       after the assembler code for the table is written.  It should write
!      the appropriate code to stdio stream STREAM.  The argument TABLE
!      is the jump-table insn, and NUM is the label-number of the
!      preceding label.
  
       If this macro is not defined, nothing special is output at the end
       of the jump-table.
--- 35776,35805 ----
       stream STREAM an assembler pseudo-instruction to generate a
       reference to a label.  VALUE is the number of an internal label
       whose definition is output using
!      '(*targetm.asm_out.internal_label)'.  For example,
  
            fprintf (STREAM, "\t.word L%d\n", VALUE)
  
   -- Macro: ASM_OUTPUT_CASE_LABEL (STREAM, PREFIX, NUM, TABLE)
       Define this if the label before a jump-table needs to be output
       specially.  The first three arguments are the same as for
!      '(*targetm.asm_out.internal_label)'; the fourth argument is the
!      jump-table which follows (a 'jump_table_data' containing an
!      'addr_vec' or 'addr_diff_vec').
  
!      This feature is used on system V to output a 'swbeg' statement for
       the table.
  
       If this macro is not defined, these labels are output with
!      '(*targetm.asm_out.internal_label)'.
  
   -- Macro: ASM_OUTPUT_CASE_END (STREAM, NUM, TABLE)
       Define this if something special must be output at the end of a
       jump-table.  The definition should be a C statement to be executed
       after the assembler code for the table is written.  It should write
!      the appropriate code to stdio stream STREAM.  The argument TABLE is
!      the jump-table insn, and NUM is the label-number of the preceding
!      label.
  
       If this macro is not defined, nothing special is output at the end
       of the jump-table.
*************** This concerns dispatch tables.
*** 36228,36235 ****
       should write the appropriate label, for the FDE associated with the
       function declaration DECL, to the stdio stream STREAM.  The third
       argument, FOR_EH, is a boolean: true if this is for an exception
!      table.  The fourth argument, EMPTY, is a boolean: true if this is
!      a placeholder label for an omitted FDE.
  
       The default is that FDEs are not given nonlocal labels.
  
--- 35811,35818 ----
       should write the appropriate label, for the FDE associated with the
       function declaration DECL, to the stdio stream STREAM.  The third
       argument, FOR_EH, is a boolean: true if this is for an exception
!      table.  The fourth argument, EMPTY, is a boolean: true if this is a
!      placeholder label for an omitted FDE.
  
       The default is that FDEs are not given nonlocal labels.
  
*************** This concerns dispatch tables.
*** 36242,36262 ****
  
   -- Target Hook: void TARGET_ASM_EMIT_EXCEPT_PERSONALITY (rtx
            PERSONALITY)
!      If the target implements `TARGET_ASM_UNWIND_EMIT', this hook may
!      be used to emit a directive to install a personality hook into the
!      unwind info.  This hook should not be used if dwarf2 unwind info
!      is used.
  
   -- Target Hook: void TARGET_ASM_UNWIND_EMIT (FILE *STREAM, rtx_insn
            *INSN)
       This target hook emits assembly directives required to unwind the
       given instruction.  This is only used when
!      `TARGET_EXCEPT_UNWIND_INFO' returns `UI_TARGET'.
  
   -- Target Hook: bool TARGET_ASM_UNWIND_EMIT_BEFORE_INSN
!      True if the `TARGET_ASM_UNWIND_EMIT' hook should be called before
!      the assembly for INSN has been emitted, false if the hook should
!      be called afterward.
  
  
  File: gccint.info,  Node: Exception Region Output,  Next: Alignment Output,  Prev: Dispatch Tables,  Up: Assembler Format
--- 35825,35845 ----
  
   -- Target Hook: void TARGET_ASM_EMIT_EXCEPT_PERSONALITY (rtx
            PERSONALITY)
!      If the target implements 'TARGET_ASM_UNWIND_EMIT', this hook may be
!      used to emit a directive to install a personality hook into the
!      unwind info.  This hook should not be used if dwarf2 unwind info is
!      used.
  
   -- Target Hook: void TARGET_ASM_UNWIND_EMIT (FILE *STREAM, rtx_insn
            *INSN)
       This target hook emits assembly directives required to unwind the
       given instruction.  This is only used when
!      'TARGET_EXCEPT_UNWIND_INFO' returns 'UI_TARGET'.
  
   -- Target Hook: bool TARGET_ASM_UNWIND_EMIT_BEFORE_INSN
!      True if the 'TARGET_ASM_UNWIND_EMIT' hook should be called before
!      the assembly for INSN has been emitted, false if the hook should be
!      called afterward.
  
  
  File: gccint.info,  Node: Exception Region Output,  Next: Alignment Output,  Prev: Dispatch Tables,  Up: Assembler Format
*************** region.
*** 36271,36278 ****
       If defined, a C string constant for the name of the section
       containing exception handling frame unwind information.  If not
       defined, GCC will provide a default definition if the target
!      supports named sections.  `crtstuff.c' uses this macro to switch
!      to the appropriate section.
  
       You should define this symbol if your target supports DWARF 2 frame
       unwind information and the default definition does not work.
--- 35854,35861 ----
       If defined, a C string constant for the name of the section
       containing exception handling frame unwind information.  If not
       defined, GCC will provide a default definition if the target
!      supports named sections.  'crtstuff.c' uses this macro to switch to
!      the appropriate section.
  
       You should define this symbol if your target supports DWARF 2 frame
       unwind information and the default definition does not work.
*************** region.
*** 36283,36289 ****
       might be necessary, for instance, if the system linker does garbage
       collection and sections cannot be marked as not to be collected.
  
!      Do not define this macro unless `TARGET_ASM_NAMED_SECTION' is also
       defined.
  
   -- Macro: EH_TABLES_CAN_BE_READ_ONLY
--- 35866,35872 ----
       might be necessary, for instance, if the system linker does garbage
       collection and sections cannot be marked as not to be collected.
  
!      Do not define this macro unless 'TARGET_ASM_NAMED_SECTION' is also
       defined.
  
   -- Macro: EH_TABLES_CAN_BE_READ_ONLY
*************** region.
*** 36293,36358 ****
       read-only and read-write sections into a single read-write section.
  
   -- Macro: MASK_RETURN_ADDR
!      An rtx used to mask the return address found via
!      `RETURN_ADDR_RTX', so that it does not contain any extraneous set
!      bits in it.
  
   -- Macro: DWARF2_UNWIND_INFO
       Define this macro to 0 if your target supports DWARF 2 frame unwind
       information, but it does not yet work with exception handling.
       Otherwise, if your target supports this information (if it defines
!      `INCOMING_RETURN_ADDR_RTX' and `OBJECT_FORMAT_ELF'), GCC will
       provide a default definition of 1.
  
   -- Common Target Hook: enum unwind_info_type TARGET_EXCEPT_UNWIND_INFO
            (struct gcc_options *OPTS)
       This hook defines the mechanism that will be used for exception
       handling by the target.  If the target has ABI specified unwind
!      tables, the hook should return `UI_TARGET'.  If the target is to
!      use the `setjmp'/`longjmp'-based exception handling scheme, the
!      hook should return `UI_SJLJ'.  If the target supports DWARF 2
!      frame unwind information, the hook should return `UI_DWARF2'.
  
       A target may, if exceptions are disabled, choose to return
!      `UI_NONE'.  This may end up simplifying other parts of
       target-specific code.  The default implementation of this hook
!      never returns `UI_NONE'.
  
       Note that the value returned by this hook should be constant.  It
       should not depend on anything except the command-line switches
!      described by OPTS.  In particular, the setting `UI_SJLJ' must be
       fixed at compiler start-up as C pre-processor macros and builtin
       functions related to exception handling are set up depending on
       this setting.
  
       The default implementation of the hook first honors the
!      `--enable-sjlj-exceptions' configure option, then
!      `DWARF2_UNWIND_INFO', and finally defaults to `UI_SJLJ'.  If
!      `DWARF2_UNWIND_INFO' depends on command-line options, the target
       must define this hook so that OPTS is used correctly.
  
   -- Common Target Hook: bool TARGET_UNWIND_TABLES_DEFAULT
!      This variable should be set to `true' if the target ABI requires
!      unwinding tables even when exceptions are not used.  It must not
!      be modified by command-line option processing.
  
   -- Macro: DONT_USE_BUILTIN_SETJMP
!      Define this macro to 1 if the `setjmp'/`longjmp'-based scheme
!      should use the `setjmp'/`longjmp' functions from the C library
!      instead of the `__builtin_setjmp'/`__builtin_longjmp' machinery.
  
   -- Macro: JMP_BUF_SIZE
!      This macro has no effect unless `DONT_USE_BUILTIN_SETJMP' is also
!      defined.  Define this macro if the default size of `jmp_buf' buffer
!      for the `setjmp'/`longjmp'-based exception handling mechanism is
       not large enough, or if it is much too large.  The default size is
!      `FIRST_PSEUDO_REGISTER * sizeof(void *)'.
  
   -- Macro: DWARF_CIE_DATA_ALIGNMENT
       This macro need only be defined if the target might save registers
       in the function prologue at an offset to the stack pointer that is
!      not aligned to `UNITS_PER_WORD'.  The definition should be the
!      negative minimum alignment if `STACK_GROWS_DOWNWARD' is defined,
       and the positive minimum alignment otherwise.  *Note SDB and
       DWARF::.  Only applicable if the target supports DWARF 2 frame
       unwind information.
--- 35876,35940 ----
       read-only and read-write sections into a single read-write section.
  
   -- Macro: MASK_RETURN_ADDR
!      An rtx used to mask the return address found via 'RETURN_ADDR_RTX',
!      so that it does not contain any extraneous set bits in it.
  
   -- Macro: DWARF2_UNWIND_INFO
       Define this macro to 0 if your target supports DWARF 2 frame unwind
       information, but it does not yet work with exception handling.
       Otherwise, if your target supports this information (if it defines
!      'INCOMING_RETURN_ADDR_RTX' and 'OBJECT_FORMAT_ELF'), GCC will
       provide a default definition of 1.
  
   -- Common Target Hook: enum unwind_info_type TARGET_EXCEPT_UNWIND_INFO
            (struct gcc_options *OPTS)
       This hook defines the mechanism that will be used for exception
       handling by the target.  If the target has ABI specified unwind
!      tables, the hook should return 'UI_TARGET'.  If the target is to
!      use the 'setjmp'/'longjmp'-based exception handling scheme, the
!      hook should return 'UI_SJLJ'.  If the target supports DWARF 2 frame
!      unwind information, the hook should return 'UI_DWARF2'.
  
       A target may, if exceptions are disabled, choose to return
!      'UI_NONE'.  This may end up simplifying other parts of
       target-specific code.  The default implementation of this hook
!      never returns 'UI_NONE'.
  
       Note that the value returned by this hook should be constant.  It
       should not depend on anything except the command-line switches
!      described by OPTS.  In particular, the setting 'UI_SJLJ' must be
       fixed at compiler start-up as C pre-processor macros and builtin
       functions related to exception handling are set up depending on
       this setting.
  
       The default implementation of the hook first honors the
!      '--enable-sjlj-exceptions' configure option, then
!      'DWARF2_UNWIND_INFO', and finally defaults to 'UI_SJLJ'.  If
!      'DWARF2_UNWIND_INFO' depends on command-line options, the target
       must define this hook so that OPTS is used correctly.
  
   -- Common Target Hook: bool TARGET_UNWIND_TABLES_DEFAULT
!      This variable should be set to 'true' if the target ABI requires
!      unwinding tables even when exceptions are not used.  It must not be
!      modified by command-line option processing.
  
   -- Macro: DONT_USE_BUILTIN_SETJMP
!      Define this macro to 1 if the 'setjmp'/'longjmp'-based scheme
!      should use the 'setjmp'/'longjmp' functions from the C library
!      instead of the '__builtin_setjmp'/'__builtin_longjmp' machinery.
  
   -- Macro: JMP_BUF_SIZE
!      This macro has no effect unless 'DONT_USE_BUILTIN_SETJMP' is also
!      defined.  Define this macro if the default size of 'jmp_buf' buffer
!      for the 'setjmp'/'longjmp'-based exception handling mechanism is
       not large enough, or if it is much too large.  The default size is
!      'FIRST_PSEUDO_REGISTER * sizeof(void *)'.
  
   -- Macro: DWARF_CIE_DATA_ALIGNMENT
       This macro need only be defined if the target might save registers
       in the function prologue at an offset to the stack pointer that is
!      not aligned to 'UNITS_PER_WORD'.  The definition should be the
!      negative minimum alignment if 'STACK_GROWS_DOWNWARD' is defined,
       and the positive minimum alignment otherwise.  *Note SDB and
       DWARF::.  Only applicable if the target supports DWARF 2 frame
       unwind information.
*************** region.
*** 36360,36366 ****
   -- Target Hook: bool TARGET_TERMINATE_DW2_EH_FRAME_INFO
       Contains the value true if the target should add a zero word onto
       the end of a Dwarf-2 frame info section when used for exception
!      handling.  Default value is false if `EH_FRAME_SECTION_NAME' is
       defined, and true otherwise.
  
   -- Target Hook: rtx TARGET_DWARF_REGISTER_SPAN (rtx REG)
--- 35942,35948 ----
   -- Target Hook: bool TARGET_TERMINATE_DW2_EH_FRAME_INFO
       Contains the value true if the target should add a zero word onto
       the end of a Dwarf-2 frame info section when used for exception
!      handling.  Default value is false if 'EH_FRAME_SECTION_NAME' is
       defined, and true otherwise.
  
   -- Target Hook: rtx TARGET_DWARF_REGISTER_SPAN (rtx REG)
*************** region.
*** 36369,36376 ****
       if the register and its mode are represented in Dwarf in
       non-contiguous locations, or if the register should be represented
       in more than one register in Dwarf.  Otherwise, this hook should
!      return `NULL_RTX'.  If not defined, the default is to return
!      `NULL_RTX'.
  
   -- Target Hook: machine_mode TARGET_DWARF_FRAME_REG_MODE (int REGNO)
       Given a register, this hook should return the mode which the
--- 35951,35958 ----
       if the register and its mode are represented in Dwarf in
       non-contiguous locations, or if the register should be represented
       in more than one register in Dwarf.  Otherwise, this hook should
!      return 'NULL_RTX'.  If not defined, the default is to return
!      'NULL_RTX'.
  
   -- Target Hook: machine_mode TARGET_DWARF_FRAME_REG_MODE (int REGNO)
       Given a register, this hook should return the mode which the
*************** region.
*** 36382,36402 ****
       If some registers are represented in Dwarf-2 unwind information in
       multiple pieces, define this hook to fill in information about the
       sizes of those pieces in the table used by the unwinder at runtime.
!      It will be called by `expand_builtin_init_dwarf_reg_sizes' after
       filling in a single size corresponding to each hard register;
       ADDRESS is the address of the table.
  
   -- Target Hook: bool TARGET_ASM_TTYPE (rtx SYM)
       This hook is used to output a reference from a frame unwinding
       table to the type_info object identified by SYM.  It should return
!      `true' if the reference was output.  Returning `false' will cause
       the reference to be output using the normal Dwarf2 routines.
  
   -- Target Hook: bool TARGET_ARM_EABI_UNWINDER
!      This flag should be set to `true' on targets that use an ARM EABI
!      based unwinding library, and `false' on other targets.  This
       effects the format of unwinding tables, and how the unwinder in
!      entered after running a cleanup.  The default is `false'.
  
  
  File: gccint.info,  Node: Alignment Output,  Prev: Exception Region Output,  Up: Assembler Format
--- 35964,35984 ----
       If some registers are represented in Dwarf-2 unwind information in
       multiple pieces, define this hook to fill in information about the
       sizes of those pieces in the table used by the unwinder at runtime.
!      It will be called by 'expand_builtin_init_dwarf_reg_sizes' after
       filling in a single size corresponding to each hard register;
       ADDRESS is the address of the table.
  
   -- Target Hook: bool TARGET_ASM_TTYPE (rtx SYM)
       This hook is used to output a reference from a frame unwinding
       table to the type_info object identified by SYM.  It should return
!      'true' if the reference was output.  Returning 'false' will cause
       the reference to be output using the normal Dwarf2 routines.
  
   -- Target Hook: bool TARGET_ARM_EABI_UNWINDER
!      This flag should be set to 'true' on targets that use an ARM EABI
!      based unwinding library, and 'false' on other targets.  This
       effects the format of unwinding tables, and how the unwinder in
!      entered after running a cleanup.  The default is 'false'.
  
  
  File: gccint.info,  Node: Alignment Output,  Prev: Exception Region Output,  Up: Assembler Format
*************** This describes commands for alignment.
*** 36416,36432 ****
  
       Unless it's necessary to inspect the LABEL parameter, it is better
       to set the variable ALIGN_JUMPS in the target's
!      `TARGET_OPTION_OVERRIDE'.  Otherwise, you should try to honor the
!      user's selection in ALIGN_JUMPS in a `JUMP_ALIGN' implementation.
  
   -- Target Hook: int TARGET_ASM_JUMP_ALIGN_MAX_SKIP (rtx_insn *LABEL)
       The maximum number of bytes to skip before LABEL when applying
!      `JUMP_ALIGN'.  This works only if `ASM_OUTPUT_MAX_SKIP_ALIGN' is
       defined.
  
   -- Macro: LABEL_ALIGN_AFTER_BARRIER (LABEL)
       The alignment (log base 2) to put in front of LABEL, which follows
!      a `BARRIER'.
  
       This macro need not be defined if you don't want any special
       alignment to be done at such a time.  Most machine descriptions do
--- 35998,36014 ----
  
       Unless it's necessary to inspect the LABEL parameter, it is better
       to set the variable ALIGN_JUMPS in the target's
!      'TARGET_OPTION_OVERRIDE'.  Otherwise, you should try to honor the
!      user's selection in ALIGN_JUMPS in a 'JUMP_ALIGN' implementation.
  
   -- Target Hook: int TARGET_ASM_JUMP_ALIGN_MAX_SKIP (rtx_insn *LABEL)
       The maximum number of bytes to skip before LABEL when applying
!      'JUMP_ALIGN'.  This works only if 'ASM_OUTPUT_MAX_SKIP_ALIGN' is
       defined.
  
   -- Macro: LABEL_ALIGN_AFTER_BARRIER (LABEL)
       The alignment (log base 2) to put in front of LABEL, which follows
!      a 'BARRIER'.
  
       This macro need not be defined if you don't want any special
       alignment to be done at such a time.  Most machine descriptions do
*************** This describes commands for alignment.
*** 36435,36442 ****
   -- Target Hook: int TARGET_ASM_LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
            (rtx_insn *LABEL)
       The maximum number of bytes to skip before LABEL when applying
!      `LABEL_ALIGN_AFTER_BARRIER'.  This works only if
!      `ASM_OUTPUT_MAX_SKIP_ALIGN' is defined.
  
   -- Macro: LOOP_ALIGN (LABEL)
       The alignment (log base 2) to put in front of LABEL that heads a
--- 36017,36024 ----
   -- Target Hook: int TARGET_ASM_LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
            (rtx_insn *LABEL)
       The maximum number of bytes to skip before LABEL when applying
!      'LABEL_ALIGN_AFTER_BARRIER'.  This works only if
!      'ASM_OUTPUT_MAX_SKIP_ALIGN' is defined.
  
   -- Macro: LOOP_ALIGN (LABEL)
       The alignment (log base 2) to put in front of LABEL that heads a
*************** This describes commands for alignment.
*** 36447,36495 ****
       not currently define the macro.
  
       Unless it's necessary to inspect the LABEL parameter, it is better
!      to set the variable `align_loops' in the target's
!      `TARGET_OPTION_OVERRIDE'.  Otherwise, you should try to honor the
!      user's selection in `align_loops' in a `LOOP_ALIGN' implementation.
  
   -- Target Hook: int TARGET_ASM_LOOP_ALIGN_MAX_SKIP (rtx_insn *LABEL)
!      The maximum number of bytes to skip when applying `LOOP_ALIGN' to
!      LABEL.  This works only if `ASM_OUTPUT_MAX_SKIP_ALIGN' is defined.
  
   -- Macro: LABEL_ALIGN (LABEL)
       The alignment (log base 2) to put in front of LABEL.  If
!      `LABEL_ALIGN_AFTER_BARRIER' / `LOOP_ALIGN' specify a different
       alignment, the maximum of the specified values is used.
  
       Unless it's necessary to inspect the LABEL parameter, it is better
!      to set the variable `align_labels' in the target's
!      `TARGET_OPTION_OVERRIDE'.  Otherwise, you should try to honor the
!      user's selection in `align_labels' in a `LABEL_ALIGN'
       implementation.
  
   -- Target Hook: int TARGET_ASM_LABEL_ALIGN_MAX_SKIP (rtx_insn *LABEL)
!      The maximum number of bytes to skip when applying `LABEL_ALIGN' to
!      LABEL.  This works only if `ASM_OUTPUT_MAX_SKIP_ALIGN' is defined.
  
   -- Macro: ASM_OUTPUT_SKIP (STREAM, NBYTES)
       A C statement to output to the stdio stream STREAM an assembler
!      instruction to advance the location counter by NBYTES bytes.
!      Those bytes should be zero when loaded.  NBYTES will be a C
!      expression of type `unsigned HOST_WIDE_INT'.
  
   -- Macro: ASM_NO_SKIP_IN_TEXT
!      Define this macro if `ASM_OUTPUT_SKIP' should not be used in the
       text section because it fails to put zeros in the bytes that are
!      skipped.  This is true on many Unix systems, where the pseudo-op
!      to skip bytes produces no-op instructions rather than zeros when
!      used in the text section.
  
   -- Macro: ASM_OUTPUT_ALIGN (STREAM, POWER)
       A C statement to output to the stdio stream STREAM an assembler
       command to advance the location counter to a multiple of 2 to the
!      POWER bytes.  POWER will be a C expression of type `int'.
  
   -- Macro: ASM_OUTPUT_ALIGN_WITH_NOP (STREAM, POWER)
!      Like `ASM_OUTPUT_ALIGN', except that the "nop" instruction is used
       for padding, if necessary.
  
   -- Macro: ASM_OUTPUT_MAX_SKIP_ALIGN (STREAM, POWER, MAX_SKIP)
--- 36029,36077 ----
       not currently define the macro.
  
       Unless it's necessary to inspect the LABEL parameter, it is better
!      to set the variable 'align_loops' in the target's
!      'TARGET_OPTION_OVERRIDE'.  Otherwise, you should try to honor the
!      user's selection in 'align_loops' in a 'LOOP_ALIGN' implementation.
  
   -- Target Hook: int TARGET_ASM_LOOP_ALIGN_MAX_SKIP (rtx_insn *LABEL)
!      The maximum number of bytes to skip when applying 'LOOP_ALIGN' to
!      LABEL.  This works only if 'ASM_OUTPUT_MAX_SKIP_ALIGN' is defined.
  
   -- Macro: LABEL_ALIGN (LABEL)
       The alignment (log base 2) to put in front of LABEL.  If
!      'LABEL_ALIGN_AFTER_BARRIER' / 'LOOP_ALIGN' specify a different
       alignment, the maximum of the specified values is used.
  
       Unless it's necessary to inspect the LABEL parameter, it is better
!      to set the variable 'align_labels' in the target's
!      'TARGET_OPTION_OVERRIDE'.  Otherwise, you should try to honor the
!      user's selection in 'align_labels' in a 'LABEL_ALIGN'
       implementation.
  
   -- Target Hook: int TARGET_ASM_LABEL_ALIGN_MAX_SKIP (rtx_insn *LABEL)
!      The maximum number of bytes to skip when applying 'LABEL_ALIGN' to
!      LABEL.  This works only if 'ASM_OUTPUT_MAX_SKIP_ALIGN' is defined.
  
   -- Macro: ASM_OUTPUT_SKIP (STREAM, NBYTES)
       A C statement to output to the stdio stream STREAM an assembler
!      instruction to advance the location counter by NBYTES bytes.  Those
!      bytes should be zero when loaded.  NBYTES will be a C expression of
!      type 'unsigned HOST_WIDE_INT'.
  
   -- Macro: ASM_NO_SKIP_IN_TEXT
!      Define this macro if 'ASM_OUTPUT_SKIP' should not be used in the
       text section because it fails to put zeros in the bytes that are
!      skipped.  This is true on many Unix systems, where the pseudo-op to
!      skip bytes produces no-op instructions rather than zeros when used
!      in the text section.
  
   -- Macro: ASM_OUTPUT_ALIGN (STREAM, POWER)
       A C statement to output to the stdio stream STREAM an assembler
       command to advance the location counter to a multiple of 2 to the
!      POWER bytes.  POWER will be a C expression of type 'int'.
  
   -- Macro: ASM_OUTPUT_ALIGN_WITH_NOP (STREAM, POWER)
!      Like 'ASM_OUTPUT_ALIGN', except that the "nop" instruction is used
       for padding, if necessary.
  
   -- Macro: ASM_OUTPUT_MAX_SKIP_ALIGN (STREAM, POWER, MAX_SKIP)
*************** This describes commands for alignment.
*** 36497,36503 ****
       command to advance the location counter to a multiple of 2 to the
       POWER bytes, but only if MAX_SKIP or fewer bytes are needed to
       satisfy the alignment request.  POWER and MAX_SKIP will be a C
!      expression of type `int'.
  
  
  File: gccint.info,  Node: Debugging Info,  Next: Floating Point,  Prev: Assembler Format,  Up: Target Macros
--- 36079,36085 ----
       command to advance the location counter to a multiple of 2 to the
       POWER bytes, but only if MAX_SKIP or fewer bytes are needed to
       satisfy the alignment request.  POWER and MAX_SKIP will be a C
!      expression of type 'int'.
  
  
  File: gccint.info,  Node: Debugging Info,  Next: Floating Point,  Prev: Assembler Format,  Up: Target Macros
*************** These macros affect all debugging format
*** 36526,36545 ****
  
   -- Macro: DBX_REGISTER_NUMBER (REGNO)
       A C expression that returns the DBX register number for the
!      compiler register number REGNO.  In the default macro provided,
!      the value of this expression will be REGNO itself.  But sometimes
!      there are some registers that the compiler knows about and DBX
!      does not, or vice versa.  In such cases, some register may need to
!      have one number in the compiler and another for DBX.
  
       If two registers have consecutive numbers inside GCC, and they can
       be used as a pair to hold a multiword value, then they _must_ have
!      consecutive numbers after renumbering with `DBX_REGISTER_NUMBER'.
       Otherwise, debuggers will be unable to access such a pair, because
!      they expect register pairs to be consecutive in their own
!      numbering scheme.
  
!      If you find yourself defining `DBX_REGISTER_NUMBER' in way that
       does not preserve register pairs, then what you must do instead is
       redefine the actual register numbering scheme.
  
--- 36108,36127 ----
  
   -- Macro: DBX_REGISTER_NUMBER (REGNO)
       A C expression that returns the DBX register number for the
!      compiler register number REGNO.  In the default macro provided, the
!      value of this expression will be REGNO itself.  But sometimes there
!      are some registers that the compiler knows about and DBX does not,
!      or vice versa.  In such cases, some register may need to have one
!      number in the compiler and another for DBX.
  
       If two registers have consecutive numbers inside GCC, and they can
       be used as a pair to hold a multiword value, then they _must_ have
!      consecutive numbers after renumbering with 'DBX_REGISTER_NUMBER'.
       Otherwise, debuggers will be unable to access such a pair, because
!      they expect register pairs to be consecutive in their own numbering
!      scheme.
  
!      If you find yourself defining 'DBX_REGISTER_NUMBER' in way that
       does not preserve register pairs, then what you must do instead is
       redefine the actual register numbering scheme.
  
*************** These macros affect all debugging format
*** 36550,36556 ****
       and gives the offset from the frame-pointer.  This is required for
       targets that produce debugging output for DBX or COFF-style
       debugging output for SDB and allow the frame-pointer to be
!      eliminated when the `-g' options is used.
  
   -- Macro: DEBUGGER_ARG_OFFSET (OFFSET, X)
       A C expression that returns the integer offset value for an
--- 36132,36138 ----
       and gives the offset from the frame-pointer.  This is required for
       targets that produce debugging output for DBX or COFF-style
       debugging output for SDB and allow the frame-pointer to be
!      eliminated when the '-g' options is used.
  
   -- Macro: DEBUGGER_ARG_OFFSET (OFFSET, X)
       A C expression that returns the integer offset value for an
*************** These macros affect all debugging format
*** 36559,36579 ****
  
   -- Macro: PREFERRED_DEBUGGING_TYPE
       A C expression that returns the type of debugging output GCC should
!      produce when the user specifies just `-g'.  Define this if you
!      have arranged for GCC to support more than one format of debugging
!      output.  Currently, the allowable values are `DBX_DEBUG',
!      `SDB_DEBUG', `DWARF_DEBUG', `DWARF2_DEBUG', `XCOFF_DEBUG',
!      `VMS_DEBUG', and `VMS_AND_DWARF2_DEBUG'.
  
!      When the user specifies `-ggdb', GCC normally also uses the value
       of this macro to select the debugging output format, but with two
!      exceptions.  If `DWARF2_DEBUGGING_INFO' is defined, GCC uses the
!      value `DWARF2_DEBUG'.  Otherwise, if `DBX_DEBUGGING_INFO' is
!      defined, GCC uses `DBX_DEBUG'.
  
       The value of this macro only affects the default debugging output;
       the user can always get a specific type of output by using
!      `-gstabs', `-gcoff', `-gdwarf-2', `-gxcoff', or `-gvms'.
  
  
  File: gccint.info,  Node: DBX Options,  Next: DBX Hooks,  Prev: All Debuggers,  Up: Debugging Info
--- 36141,36161 ----
  
   -- Macro: PREFERRED_DEBUGGING_TYPE
       A C expression that returns the type of debugging output GCC should
!      produce when the user specifies just '-g'.  Define this if you have
!      arranged for GCC to support more than one format of debugging
!      output.  Currently, the allowable values are 'DBX_DEBUG',
!      'SDB_DEBUG', 'DWARF_DEBUG', 'DWARF2_DEBUG', 'XCOFF_DEBUG',
!      'VMS_DEBUG', and 'VMS_AND_DWARF2_DEBUG'.
  
!      When the user specifies '-ggdb', GCC normally also uses the value
       of this macro to select the debugging output format, but with two
!      exceptions.  If 'DWARF2_DEBUGGING_INFO' is defined, GCC uses the
!      value 'DWARF2_DEBUG'.  Otherwise, if 'DBX_DEBUGGING_INFO' is
!      defined, GCC uses 'DBX_DEBUG'.
  
       The value of this macro only affects the default debugging output;
       the user can always get a specific type of output by using
!      '-gstabs', '-gcoff', '-gdwarf-2', '-gxcoff', or '-gvms'.
  
  
  File: gccint.info,  Node: DBX Options,  Next: DBX Hooks,  Prev: All Debuggers,  Up: Debugging Info
*************** File: gccint.info,  Node: DBX Options,
*** 36584,36595 ****
  These are specific options for DBX output.
  
   -- Macro: DBX_DEBUGGING_INFO
!      Define this macro if GCC should produce debugging output for DBX
!      in response to the `-g' option.
  
   -- Macro: XCOFF_DEBUGGING_INFO
       Define this macro if GCC should produce XCOFF format debugging
!      output in response to the `-g' option.  This is a variant of DBX
       format.
  
   -- Macro: DEFAULT_GDB_EXTENSIONS
--- 36166,36177 ----
  These are specific options for DBX output.
  
   -- Macro: DBX_DEBUGGING_INFO
!      Define this macro if GCC should produce debugging output for DBX in
!      response to the '-g' option.
  
   -- Macro: XCOFF_DEBUGGING_INFO
       Define this macro if GCC should produce XCOFF format debugging
!      output in response to the '-g' option.  This is a variant of DBX
       format.
  
   -- Macro: DEFAULT_GDB_EXTENSIONS
*************** These are specific options for DBX outpu
*** 36600,36638 ****
       information if there is any occasion to.
  
   -- Macro: DEBUG_SYMS_TEXT
!      Define this macro if all `.stabs' commands should be output while
       in the text section.
  
   -- Macro: ASM_STABS_OP
!      A C string constant, including spacing, naming the assembler
!      pseudo op to use instead of `"\t.stabs\t"' to define an ordinary
!      debugging symbol.  If you don't define this macro, `"\t.stabs\t"'
!      is used.  This macro applies only to DBX debugging information
!      format.
  
   -- Macro: ASM_STABD_OP
!      A C string constant, including spacing, naming the assembler
!      pseudo op to use instead of `"\t.stabd\t"' to define a debugging
!      symbol whose value is the current location.  If you don't define
!      this macro, `"\t.stabd\t"' is used.  This macro applies only to
!      DBX debugging information format.
  
   -- Macro: ASM_STABN_OP
!      A C string constant, including spacing, naming the assembler
!      pseudo op to use instead of `"\t.stabn\t"' to define a debugging
!      symbol with no name.  If you don't define this macro,
!      `"\t.stabn\t"' is used.  This macro applies only to DBX debugging
!      information format.
  
   -- Macro: DBX_NO_XREFS
       Define this macro if DBX on your system does not support the
!      construct `xsTAGNAME'.  On some systems, this construct is used to
       describe a forward reference to a structure named TAGNAME.  On
       other systems, this construct is not supported at all.
  
   -- Macro: DBX_CONTIN_LENGTH
       A symbol name in DBX-format debugging information is normally
!      continued (split into two separate `.stabs' directives) when it
       exceeds a certain length (by default, 80 characters).  On some
       operating systems, DBX requires this splitting; on others,
       splitting must not be done.  You can inhibit splitting by defining
--- 36182,36218 ----
       information if there is any occasion to.
  
   -- Macro: DEBUG_SYMS_TEXT
!      Define this macro if all '.stabs' commands should be output while
       in the text section.
  
   -- Macro: ASM_STABS_OP
!      A C string constant, including spacing, naming the assembler pseudo
!      op to use instead of '"\t.stabs\t"' to define an ordinary debugging
!      symbol.  If you don't define this macro, '"\t.stabs\t"' is used.
!      This macro applies only to DBX debugging information format.
  
   -- Macro: ASM_STABD_OP
!      A C string constant, including spacing, naming the assembler pseudo
!      op to use instead of '"\t.stabd\t"' to define a debugging symbol
!      whose value is the current location.  If you don't define this
!      macro, '"\t.stabd\t"' is used.  This macro applies only to DBX
!      debugging information format.
  
   -- Macro: ASM_STABN_OP
!      A C string constant, including spacing, naming the assembler pseudo
!      op to use instead of '"\t.stabn\t"' to define a debugging symbol
!      with no name.  If you don't define this macro, '"\t.stabn\t"' is
!      used.  This macro applies only to DBX debugging information format.
  
   -- Macro: DBX_NO_XREFS
       Define this macro if DBX on your system does not support the
!      construct 'xsTAGNAME'.  On some systems, this construct is used to
       describe a forward reference to a structure named TAGNAME.  On
       other systems, this construct is not supported at all.
  
   -- Macro: DBX_CONTIN_LENGTH
       A symbol name in DBX-format debugging information is normally
!      continued (split into two separate '.stabs' directives) when it
       exceeds a certain length (by default, 80 characters).  On some
       operating systems, DBX requires this splitting; on others,
       splitting must not be done.  You can inhibit splitting by defining
*************** These are specific options for DBX outpu
*** 36641,36701 ****
       length you desire.
  
   -- Macro: DBX_CONTIN_CHAR
!      Normally continuation is indicated by adding a `\' character to
!      the end of a `.stabs' string when a continuation follows.  To use
!      a different character instead, define this macro as a character
       constant for the character you want to use.  Do not define this
       macro if backslash is correct for your system.
  
   -- Macro: DBX_STATIC_STAB_DATA_SECTION
       Define this macro if it is necessary to go to the data section
!      before outputting the `.stabs' pseudo-op for a non-global static
       variable.
  
   -- Macro: DBX_TYPE_DECL_STABS_CODE
!      The value to use in the "code" field of the `.stabs' directive for
!      a typedef.  The default is `N_LSYM'.
  
   -- Macro: DBX_STATIC_CONST_VAR_CODE
!      The value to use in the "code" field of the `.stabs' directive for
       a static variable located in the text section.  DBX format does not
!      provide any "right" way to do this.  The default is `N_FUN'.
  
   -- Macro: DBX_REGPARM_STABS_CODE
!      The value to use in the "code" field of the `.stabs' directive for
       a parameter passed in registers.  DBX format does not provide any
!      "right" way to do this.  The default is `N_RSYM'.
  
   -- Macro: DBX_REGPARM_STABS_LETTER
       The letter to use in DBX symbol data to identify a symbol as a
       parameter passed in registers.  DBX format does not customarily
!      provide any way to do this.  The default is `'P''.
  
   -- Macro: DBX_FUNCTION_FIRST
       Define this macro if the DBX information for a function and its
       arguments should precede the assembler code for the function.
!      Normally, in DBX format, the debugging information entirely
!      follows the assembler code.
  
   -- Macro: DBX_BLOCKS_FUNCTION_RELATIVE
       Define this macro, with value 1, if the value of a symbol
!      describing the scope of a block (`N_LBRAC' or `N_RBRAC') should be
       relative to the start of the enclosing function.  Normally, GCC
       uses an absolute address.
  
   -- Macro: DBX_LINES_FUNCTION_RELATIVE
       Define this macro, with value 1, if the value of a symbol
!      indicating the current line number (`N_SLINE') should be relative
       to the start of the enclosing function.  Normally, GCC uses an
       absolute address.
  
   -- Macro: DBX_USE_BINCL
!      Define this macro if GCC should generate `N_BINCL' and `N_EINCL'
       stabs for included header files, as on Sun systems.  This macro
!      also directs GCC to output a type number as a pair of a file
!      number and a type number within the file.  Normally, GCC does not
!      generate `N_BINCL' or `N_EINCL' stabs, and it outputs a single
!      number for a type number.
  
  
  File: gccint.info,  Node: DBX Hooks,  Next: File Names and DBX,  Prev: DBX Options,  Up: Debugging Info
--- 36221,36281 ----
       length you desire.
  
   -- Macro: DBX_CONTIN_CHAR
!      Normally continuation is indicated by adding a '\' character to the
!      end of a '.stabs' string when a continuation follows.  To use a
!      different character instead, define this macro as a character
       constant for the character you want to use.  Do not define this
       macro if backslash is correct for your system.
  
   -- Macro: DBX_STATIC_STAB_DATA_SECTION
       Define this macro if it is necessary to go to the data section
!      before outputting the '.stabs' pseudo-op for a non-global static
       variable.
  
   -- Macro: DBX_TYPE_DECL_STABS_CODE
!      The value to use in the "code" field of the '.stabs' directive for
!      a typedef.  The default is 'N_LSYM'.
  
   -- Macro: DBX_STATIC_CONST_VAR_CODE
!      The value to use in the "code" field of the '.stabs' directive for
       a static variable located in the text section.  DBX format does not
!      provide any "right" way to do this.  The default is 'N_FUN'.
  
   -- Macro: DBX_REGPARM_STABS_CODE
!      The value to use in the "code" field of the '.stabs' directive for
       a parameter passed in registers.  DBX format does not provide any
!      "right" way to do this.  The default is 'N_RSYM'.
  
   -- Macro: DBX_REGPARM_STABS_LETTER
       The letter to use in DBX symbol data to identify a symbol as a
       parameter passed in registers.  DBX format does not customarily
!      provide any way to do this.  The default is ''P''.
  
   -- Macro: DBX_FUNCTION_FIRST
       Define this macro if the DBX information for a function and its
       arguments should precede the assembler code for the function.
!      Normally, in DBX format, the debugging information entirely follows
!      the assembler code.
  
   -- Macro: DBX_BLOCKS_FUNCTION_RELATIVE
       Define this macro, with value 1, if the value of a symbol
!      describing the scope of a block ('N_LBRAC' or 'N_RBRAC') should be
       relative to the start of the enclosing function.  Normally, GCC
       uses an absolute address.
  
   -- Macro: DBX_LINES_FUNCTION_RELATIVE
       Define this macro, with value 1, if the value of a symbol
!      indicating the current line number ('N_SLINE') should be relative
       to the start of the enclosing function.  Normally, GCC uses an
       absolute address.
  
   -- Macro: DBX_USE_BINCL
!      Define this macro if GCC should generate 'N_BINCL' and 'N_EINCL'
       stabs for included header files, as on Sun systems.  This macro
!      also directs GCC to output a type number as a pair of a file number
!      and a type number within the file.  Normally, GCC does not generate
!      'N_BINCL' or 'N_EINCL' stabs, and it outputs a single number for a
!      type number.
  
  
  File: gccint.info,  Node: DBX Hooks,  Next: File Names and DBX,  Prev: DBX Options,  Up: Debugging Info
*************** These are hooks for DBX format.
*** 36709,36729 ****
       A C statement to output DBX debugging information before code for
       line number LINE of the current source file to the stdio stream
       STREAM.  COUNTER is the number of time the macro was invoked,
!      including the current invocation; it is intended to generate
!      unique labels in the assembly output.
  
       This macro should not be defined if the default output is correct,
       or if it can be made correct by defining
!      `DBX_LINES_FUNCTION_RELATIVE'.
  
   -- Macro: NO_DBX_FUNCTION_END
       Some stabs encapsulation formats (in particular ECOFF), cannot
!      handle the `.stabs "",N_FUN,,0,0,Lscope-function-1' gdb dbx
       extension construct.  On those machines, define this macro to turn
       this feature off without disturbing the rest of the gdb extensions.
  
   -- Macro: NO_DBX_BNSYM_ENSYM
!      Some assemblers cannot handle the `.stabd BNSYM/ENSYM,0,0' gdb dbx
       extension construct.  On those machines, define this macro to turn
       this feature off without disturbing the rest of the gdb extensions.
  
--- 36289,36309 ----
       A C statement to output DBX debugging information before code for
       line number LINE of the current source file to the stdio stream
       STREAM.  COUNTER is the number of time the macro was invoked,
!      including the current invocation; it is intended to generate unique
!      labels in the assembly output.
  
       This macro should not be defined if the default output is correct,
       or if it can be made correct by defining
!      'DBX_LINES_FUNCTION_RELATIVE'.
  
   -- Macro: NO_DBX_FUNCTION_END
       Some stabs encapsulation formats (in particular ECOFF), cannot
!      handle the '.stabs "",N_FUN,,0,0,Lscope-function-1' gdb dbx
       extension construct.  On those machines, define this macro to turn
       this feature off without disturbing the rest of the gdb extensions.
  
   -- Macro: NO_DBX_BNSYM_ENSYM
!      Some assemblers cannot handle the '.stabd BNSYM/ENSYM,0,0' gdb dbx
       extension construct.  On those machines, define this macro to turn
       this feature off without disturbing the rest of the gdb extensions.
  
*************** This describes file names in DBX format.
*** 36745,36753 ****
       DBX debugging information is appropriate.
  
       It may be necessary to refer to a label equal to the beginning of
!      the text section.  You can use `assemble_name (stream,
!      ltext_label_name)' to do so.  If you do this, you must also set
!      the variable USED_LTEXT_LABEL_NAME to `true'.
  
   -- Macro: NO_DBX_MAIN_SOURCE_DIRECTORY
       Define this macro, with value 1, if GCC should not emit an
--- 36325,36333 ----
       DBX debugging information is appropriate.
  
       It may be necessary to refer to a label equal to the beginning of
!      the text section.  You can use 'assemble_name (stream,
!      ltext_label_name)' to do so.  If you do this, you must also set the
!      variable USED_LTEXT_LABEL_NAME to 'true'.
  
   -- Macro: NO_DBX_MAIN_SOURCE_DIRECTORY
       Define this macro, with value 1, if GCC should not emit an
*************** This describes file names in DBX format.
*** 36757,36777 ****
   -- Macro: NO_DBX_GCC_MARKER
       Define this macro, with value 1, if GCC should not emit an
       indication that this object file was compiled by GCC.  The default
!      is to emit an `N_OPT' stab at the beginning of every source file,
!      with `gcc2_compiled.' for the string and value 0.
  
   -- Macro: DBX_OUTPUT_MAIN_SOURCE_FILE_END (STREAM, NAME)
       A C statement to output DBX debugging information at the end of
!      compilation of the main source file NAME.  Output should be
!      written to the stdio stream STREAM.
  
       If you don't define this macro, nothing special is output at the
       end of compilation, which is correct for most machines.
  
   -- Macro: DBX_OUTPUT_NULL_N_SO_AT_MAIN_SOURCE_FILE_END
       Define this macro _instead of_ defining
!      `DBX_OUTPUT_MAIN_SOURCE_FILE_END', if what needs to be output at
!      the end of compilation is an `N_SO' stab with an empty string,
       whose value is the highest absolute text address in the file.
  
  
--- 36337,36357 ----
   -- Macro: NO_DBX_GCC_MARKER
       Define this macro, with value 1, if GCC should not emit an
       indication that this object file was compiled by GCC.  The default
!      is to emit an 'N_OPT' stab at the beginning of every source file,
!      with 'gcc2_compiled.' for the string and value 0.
  
   -- Macro: DBX_OUTPUT_MAIN_SOURCE_FILE_END (STREAM, NAME)
       A C statement to output DBX debugging information at the end of
!      compilation of the main source file NAME.  Output should be written
!      to the stdio stream STREAM.
  
       If you don't define this macro, nothing special is output at the
       end of compilation, which is correct for most machines.
  
   -- Macro: DBX_OUTPUT_NULL_N_SO_AT_MAIN_SOURCE_FILE_END
       Define this macro _instead of_ defining
!      'DBX_OUTPUT_MAIN_SOURCE_FILE_END', if what needs to be output at
!      the end of compilation is an 'N_SO' stab with an empty string,
       whose value is the highest absolute text address in the file.
  
  
*************** Here are macros for SDB and DWARF output
*** 36784,36825 ****
  
   -- Macro: SDB_DEBUGGING_INFO
       Define this macro if GCC should produce COFF-style debugging output
!      for SDB in response to the `-g' option.
  
   -- Macro: DWARF2_DEBUGGING_INFO
       Define this macro if GCC should produce dwarf version 2 format
!      debugging output in response to the `-g' option.
  
        -- Target Hook: int TARGET_DWARF_CALLING_CONVENTION (const_tree
                 FUNCTION)
            Define this to enable the dwarf attribute
!           `DW_AT_calling_convention' to be emitted for each function.
!           Instead of an integer return the enum value for the `DW_CC_'
            tag.
  
       To support optional call frame debugging information, you must also
!      define `INCOMING_RETURN_ADDR_RTX' and either set
!      `RTX_FRAME_RELATED_P' on the prologue insns if you use RTL for the
!      prologue, or call `dwarf2out_def_cfa' and `dwarf2out_reg_save' as
!      appropriate from `TARGET_ASM_FUNCTION_PROLOGUE' if you don't.
  
   -- Macro: DWARF2_FRAME_INFO
       Define this macro to a nonzero value if GCC should always output
!      Dwarf 2 frame information.  If `TARGET_EXCEPT_UNWIND_INFO' (*note
!      Exception Region Output::) returns `UI_DWARF2', and exceptions are
!      enabled, GCC will output this information not matter how you
!      define `DWARF2_FRAME_INFO'.
  
   -- Target Hook: enum unwind_info_type TARGET_DEBUG_UNWIND_INFO (void)
       This hook defines the mechanism that will be used for describing
       frame unwind information to the debugger.  Normally the hook will
!      return `UI_DWARF2' if DWARF 2 debug information is enabled, and
!      return `UI_NONE' otherwise.
  
!      A target may return `UI_DWARF2' even when DWARF 2 debug information
       is disabled in order to always output DWARF 2 frame information.
  
!      A target may return `UI_TARGET' if it has ABI specified unwind
       tables.  This will suppress generation of the normal debug frame
       unwind information.
  
--- 36364,36405 ----
  
   -- Macro: SDB_DEBUGGING_INFO
       Define this macro if GCC should produce COFF-style debugging output
!      for SDB in response to the '-g' option.
  
   -- Macro: DWARF2_DEBUGGING_INFO
       Define this macro if GCC should produce dwarf version 2 format
!      debugging output in response to the '-g' option.
  
        -- Target Hook: int TARGET_DWARF_CALLING_CONVENTION (const_tree
                 FUNCTION)
            Define this to enable the dwarf attribute
!           'DW_AT_calling_convention' to be emitted for each function.
!           Instead of an integer return the enum value for the 'DW_CC_'
            tag.
  
       To support optional call frame debugging information, you must also
!      define 'INCOMING_RETURN_ADDR_RTX' and either set
!      'RTX_FRAME_RELATED_P' on the prologue insns if you use RTL for the
!      prologue, or call 'dwarf2out_def_cfa' and 'dwarf2out_reg_save' as
!      appropriate from 'TARGET_ASM_FUNCTION_PROLOGUE' if you don't.
  
   -- Macro: DWARF2_FRAME_INFO
       Define this macro to a nonzero value if GCC should always output
!      Dwarf 2 frame information.  If 'TARGET_EXCEPT_UNWIND_INFO' (*note
!      Exception Region Output::) returns 'UI_DWARF2', and exceptions are
!      enabled, GCC will output this information not matter how you define
!      'DWARF2_FRAME_INFO'.
  
   -- Target Hook: enum unwind_info_type TARGET_DEBUG_UNWIND_INFO (void)
       This hook defines the mechanism that will be used for describing
       frame unwind information to the debugger.  Normally the hook will
!      return 'UI_DWARF2' if DWARF 2 debug information is enabled, and
!      return 'UI_NONE' otherwise.
  
!      A target may return 'UI_DWARF2' even when DWARF 2 debug information
       is disabled in order to always output DWARF 2 frame information.
  
!      A target may return 'UI_TARGET' if it has ABI specified unwind
       tables.  This will suppress generation of the normal debug frame
       unwind information.
  
*************** Here are macros for SDB and DWARF output
*** 36830,36843 ****
       works.
  
   -- Target Hook: bool TARGET_WANT_DEBUG_PUB_SECTIONS
!      True if the `.debug_pubtypes' and `.debug_pubnames' sections
!      should be emitted.  These sections are not used on most platforms,
!      and in particular GDB does not use them.
  
   -- Target Hook: bool TARGET_FORCE_AT_COMP_DIR
!      True if the `DW_AT_comp_dir' attribute should be emitted for each
!      compilation unit.  This attribute is required for the darwin
!      linker  to emit debug information.
  
   -- Target Hook: bool TARGET_DELAY_SCHED2
       True if sched2 is not to be run at its normal place.  This usually
--- 36410,36423 ----
       works.
  
   -- Target Hook: bool TARGET_WANT_DEBUG_PUB_SECTIONS
!      True if the '.debug_pubtypes' and '.debug_pubnames' sections should
!      be emitted.  These sections are not used on most platforms, and in
!      particular GDB does not use them.
  
   -- Target Hook: bool TARGET_FORCE_AT_COMP_DIR
!      True if the 'DW_AT_comp_dir' attribute should be emitted for each
!      compilation unit.  This attribute is required for the darwin linker
!      to emit debug information.
  
   -- Target Hook: bool TARGET_DELAY_SCHED2
       True if sched2 is not to be run at its normal place.  This usually
*************** Here are macros for SDB and DWARF output
*** 36868,36875 ****
  
   -- Macro: ASM_OUTPUT_DWARF_PCREL (STREAM, SIZE, LABEL)
       A C statement to issue assembly directives that create a
!      self-relative reference to the given LABEL, using an integer of
!      the given SIZE.
  
   -- Macro: ASM_OUTPUT_DWARF_TABLE_REF (LABEL)
       A C statement to issue assembly directives that create a reference
--- 36448,36455 ----
  
   -- Macro: ASM_OUTPUT_DWARF_PCREL (STREAM, SIZE, LABEL)
       A C statement to issue assembly directives that create a
!      self-relative reference to the given LABEL, using an integer of the
!      given SIZE.
  
   -- Macro: ASM_OUTPUT_DWARF_TABLE_REF (LABEL)
       A C statement to issue assembly directives that create a reference
*************** Here are macros for SDB and DWARF output
*** 36885,36899 ****
  
   -- Macro: PUT_SDB_...
       Define these macros to override the assembler syntax for the
!      special SDB assembler directives.  See `sdbout.c' for a list of
       these macros and their arguments.  If the standard syntax is used,
       you need not define them yourself.
  
   -- Macro: SDB_DELIM
       Some assemblers do not support a semicolon as a delimiter, even
       between SDB assembler directives.  In that case, define this macro
!      to be the delimiter to use (usually `\n').  It is not necessary to
!      define a new set of `PUT_SDB_OP' macros if this is the only change
       required.
  
   -- Macro: SDB_ALLOW_UNKNOWN_REFERENCES
--- 36465,36479 ----
  
   -- Macro: PUT_SDB_...
       Define these macros to override the assembler syntax for the
!      special SDB assembler directives.  See 'sdbout.c' for a list of
       these macros and their arguments.  If the standard syntax is used,
       you need not define them yourself.
  
   -- Macro: SDB_DELIM
       Some assemblers do not support a semicolon as a delimiter, even
       between SDB assembler directives.  In that case, define this macro
!      to be the delimiter to use (usually '\n').  It is not necessary to
!      define a new set of 'PUT_SDB_OP' macros if this is the only change
       required.
  
   -- Macro: SDB_ALLOW_UNKNOWN_REFERENCES
*************** Here are macros for SDB and DWARF output
*** 36909,36915 ****
   -- Macro: SDB_OUTPUT_SOURCE_LINE (STREAM, LINE)
       A C statement to output SDB debugging information before code for
       line number LINE of the current source file to the stdio stream
!      STREAM.  The default is to emit an `.ln' directive.
  
  
  File: gccint.info,  Node: VMS Debug,  Prev: SDB and DWARF,  Up: Debugging Info
--- 36489,36495 ----
   -- Macro: SDB_OUTPUT_SOURCE_LINE (STREAM, LINE)
       A C statement to output SDB debugging information before code for
       line number LINE of the current source file to the stdio stream
!      STREAM.  The default is to emit an '.ln' directive.
  
  
  File: gccint.info,  Node: VMS Debug,  Prev: SDB and DWARF,  Up: Debugging Info
*************** File: gccint.info,  Node: VMS Debug,  Pr
*** 36920,36931 ****
  Here are macros for VMS debug format.
  
   -- Macro: VMS_DEBUGGING_INFO
!      Define this macro if GCC should produce debugging output for VMS
!      in response to the `-g' option.  The default behavior for VMS is
!      to generate minimal debug info for a traceback in the absence of
!      `-g' unless explicitly overridden with `-g0'.  This behavior is
!      controlled by `TARGET_OPTION_OPTIMIZATION' and
!      `TARGET_OPTION_OVERRIDE'.
  
  
  File: gccint.info,  Node: Floating Point,  Next: Mode Switching,  Prev: Debugging Info,  Up: Target Macros
--- 36500,36511 ----
  Here are macros for VMS debug format.
  
   -- Macro: VMS_DEBUGGING_INFO
!      Define this macro if GCC should produce debugging output for VMS in
!      response to the '-g' option.  The default behavior for VMS is to
!      generate minimal debug info for a traceback in the absence of '-g'
!      unless explicitly overridden with '-g0'.  This behavior is
!      controlled by 'TARGET_OPTION_OPTIMIZATION' and
!      'TARGET_OPTION_OVERRIDE'.
  
  
  File: gccint.info,  Node: Floating Point,  Next: Mode Switching,  Prev: Debugging Info,  Up: Target Macros
*************** the target's arithmetic.  To ensure cons
*** 36947,36967 ****
  emulation to work with floating point values, even when the host and
  target floating point formats are identical.
  
!  The following macros are provided by `real.h' for the compiler to use.
  All parts of the compiler which generate or optimize floating-point
  calculations must use these macros.  They may evaluate their operands
  more than once, so operands must not have side effects.
  
   -- Macro: REAL_VALUE_TYPE
       The C data type to be used to hold a floating point value in the
!      target machine's format.  Typically this is a `struct' containing
!      an array of `HOST_WIDE_INT', but all code should treat it as an
       opaque quantity.
  
   -- Macro: int REAL_VALUES_EQUAL (REAL_VALUE_TYPE X, REAL_VALUE_TYPE Y)
       Compares for equality the two values, X and Y.  If the target
       floating point format supports negative zeroes and/or NaNs,
!      `REAL_VALUES_EQUAL (-0.0, 0.0)' is true, and `REAL_VALUES_EQUAL
       (NaN, NaN)' is false.
  
   -- Macro: int REAL_VALUES_LESS (REAL_VALUE_TYPE X, REAL_VALUE_TYPE Y)
--- 36527,36547 ----
  emulation to work with floating point values, even when the host and
  target floating point formats are identical.
  
!  The following macros are provided by 'real.h' for the compiler to use.
  All parts of the compiler which generate or optimize floating-point
  calculations must use these macros.  They may evaluate their operands
  more than once, so operands must not have side effects.
  
   -- Macro: REAL_VALUE_TYPE
       The C data type to be used to hold a floating point value in the
!      target machine's format.  Typically this is a 'struct' containing
!      an array of 'HOST_WIDE_INT', but all code should treat it as an
       opaque quantity.
  
   -- Macro: int REAL_VALUES_EQUAL (REAL_VALUE_TYPE X, REAL_VALUE_TYPE Y)
       Compares for equality the two values, X and Y.  If the target
       floating point format supports negative zeroes and/or NaNs,
!      'REAL_VALUES_EQUAL (-0.0, 0.0)' is true, and 'REAL_VALUES_EQUAL
       (NaN, NaN)' is false.
  
   -- Macro: int REAL_VALUES_LESS (REAL_VALUE_TYPE X, REAL_VALUE_TYPE Y)
*************** more than once, so operands must not hav
*** 36997,37009 ****
       X and Y, storing the result in OUTPUT (which must be a variable).
  
       The operation to be performed is specified by CODE.  Only the
!      following codes are supported: `PLUS_EXPR', `MINUS_EXPR',
!      `MULT_EXPR', `RDIV_EXPR', `MAX_EXPR', `MIN_EXPR'.
  
!      If `REAL_ARITHMETIC' is asked to evaluate division by zero and the
       target's floating point format cannot represent infinity, it will
!      call `abort'.  Callers should check for this situation first, using
!      `MODE_HAS_INFINITIES'.  *Note Storage Layout::.
  
   -- Macro: REAL_VALUE_TYPE REAL_VALUE_NEGATE (REAL_VALUE_TYPE X)
       Returns the negative of the floating point value X.
--- 36577,36589 ----
       X and Y, storing the result in OUTPUT (which must be a variable).
  
       The operation to be performed is specified by CODE.  Only the
!      following codes are supported: 'PLUS_EXPR', 'MINUS_EXPR',
!      'MULT_EXPR', 'RDIV_EXPR', 'MAX_EXPR', 'MIN_EXPR'.
  
!      If 'REAL_ARITHMETIC' is asked to evaluate division by zero and the
       target's floating point format cannot represent infinity, it will
!      call 'abort'.  Callers should check for this situation first, using
!      'MODE_HAS_INFINITIES'.  *Note Storage Layout::.
  
   -- Macro: REAL_VALUE_TYPE REAL_VALUE_NEGATE (REAL_VALUE_TYPE X)
       Returns the negative of the floating point value X.
*************** File: gccint.info,  Node: Mode Switching
*** 37020,37072 ****
  The following macros control mode switching optimizations:
  
   -- Macro: OPTIMIZE_MODE_SWITCHING (ENTITY)
!      Define this macro if the port needs extra instructions inserted
!      for mode switching in an optimizing compilation.
  
       For an example, the SH4 can perform both single and double
       precision floating point operations, but to perform a single
       precision operation, the FPSCR PR bit has to be cleared, while for
!      a double precision operation, this bit has to be set.  Changing
!      the PR bit requires a general purpose register as a scratch
!      register, hence these FPSCR sets have to be inserted before
!      reload, i.e. you can't put this into instruction emitting or
!      `TARGET_MACHINE_DEPENDENT_REORG'.
  
       You can have multiple entities that are mode-switched, and select
       at run time which entities actually need it.
!      `OPTIMIZE_MODE_SWITCHING' should return nonzero for any ENTITY
!      that needs mode-switching.  If you define this macro, you also
!      have to define `NUM_MODES_FOR_MODE_SWITCHING',
!      `TARGET_MODE_NEEDED', `TARGET_MODE_PRIORITY' and
!      `TARGET_MODE_EMIT'.  `TARGET_MODE_AFTER', `TARGET_MODE_ENTRY', and
!      `TARGET_MODE_EXIT' are optional.
  
   -- Macro: NUM_MODES_FOR_MODE_SWITCHING
!      If you define `OPTIMIZE_MODE_SWITCHING', you have to define this as
       initializer for an array of integers.  Each initializer element N
       refers to an entity that needs mode switching, and specifies the
       number of different modes that might need to be set for this
       entity.  The position of the initializer in the
!      initializer--starting counting at zero--determines the integer
!      that is used to refer to the mode-switched entity in question.  In
       macros that take mode arguments / yield a mode result, modes are
       represented as numbers 0 ... N - 1.  N is used to specify that no
       mode switch is needed / supplied.
  
   -- Target Hook: void TARGET_MODE_EMIT (int ENTITY, int MODE, int
            PREV_MODE, HARD_REG_SET REGS_LIVE)
!      Generate one or more insns to set ENTITY to MODE. HARD_REG_LIVE is
       the set of hard registers live at the point where the insn(s) are
!      to be inserted. PREV_MOXDE indicates the mode to switch from. Sets
!      of a lower numbered entity will be emitted before sets of a higher
!      numbered entity to a mode of the same or lower priority.
  
   -- Target Hook: int TARGET_MODE_NEEDED (int ENTITY, rtx_insn *INSN)
       ENTITY is an integer specifying a mode-switched entity.  If
!      `OPTIMIZE_MODE_SWITCHING' is defined, you must define this macro
!      to return an integer value not larger than the corresponding
!      element in `NUM_MODES_FOR_MODE_SWITCHING', to denote the mode that
!      ENTITY must be switched into prior to the execution of INSN.
  
   -- Target Hook: int TARGET_MODE_AFTER (int ENTITY, int MODE, rtx_insn
            *INSN)
--- 36600,36652 ----
  The following macros control mode switching optimizations:
  
   -- Macro: OPTIMIZE_MODE_SWITCHING (ENTITY)
!      Define this macro if the port needs extra instructions inserted for
!      mode switching in an optimizing compilation.
  
       For an example, the SH4 can perform both single and double
       precision floating point operations, but to perform a single
       precision operation, the FPSCR PR bit has to be cleared, while for
!      a double precision operation, this bit has to be set.  Changing the
!      PR bit requires a general purpose register as a scratch register,
!      hence these FPSCR sets have to be inserted before reload, i.e. you
!      can't put this into instruction emitting or
!      'TARGET_MACHINE_DEPENDENT_REORG'.
  
       You can have multiple entities that are mode-switched, and select
       at run time which entities actually need it.
!      'OPTIMIZE_MODE_SWITCHING' should return nonzero for any ENTITY that
!      needs mode-switching.  If you define this macro, you also have to
!      define 'NUM_MODES_FOR_MODE_SWITCHING', 'TARGET_MODE_NEEDED',
!      'TARGET_MODE_PRIORITY' and 'TARGET_MODE_EMIT'.
!      'TARGET_MODE_AFTER', 'TARGET_MODE_ENTRY', and 'TARGET_MODE_EXIT'
!      are optional.
  
   -- Macro: NUM_MODES_FOR_MODE_SWITCHING
!      If you define 'OPTIMIZE_MODE_SWITCHING', you have to define this as
       initializer for an array of integers.  Each initializer element N
       refers to an entity that needs mode switching, and specifies the
       number of different modes that might need to be set for this
       entity.  The position of the initializer in the
!      initializer--starting counting at zero--determines the integer that
!      is used to refer to the mode-switched entity in question.  In
       macros that take mode arguments / yield a mode result, modes are
       represented as numbers 0 ... N - 1.  N is used to specify that no
       mode switch is needed / supplied.
  
   -- Target Hook: void TARGET_MODE_EMIT (int ENTITY, int MODE, int
            PREV_MODE, HARD_REG_SET REGS_LIVE)
!      Generate one or more insns to set ENTITY to MODE.  HARD_REG_LIVE is
       the set of hard registers live at the point where the insn(s) are
!      to be inserted.  PREV_MOXDE indicates the mode to switch from.
!      Sets of a lower numbered entity will be emitted before sets of a
!      higher numbered entity to a mode of the same or lower priority.
  
   -- Target Hook: int TARGET_MODE_NEEDED (int ENTITY, rtx_insn *INSN)
       ENTITY is an integer specifying a mode-switched entity.  If
!      'OPTIMIZE_MODE_SWITCHING' is defined, you must define this macro to
!      return an integer value not larger than the corresponding element
!      in 'NUM_MODES_FOR_MODE_SWITCHING', to denote the mode that ENTITY
!      must be switched into prior to the execution of INSN.
  
   -- Target Hook: int TARGET_MODE_AFTER (int ENTITY, int MODE, rtx_insn
            *INSN)
*************** The following macros control mode switch
*** 37077,37117 ****
  
   -- Target Hook: int TARGET_MODE_ENTRY (int ENTITY)
       If this macro is defined, it is evaluated for every ENTITY that
!      needs mode switching.  It should evaluate to an integer, which is
!      a mode that ENTITY is assumed to be switched to at function entry.
!      If `TARGET_MODE_ENTRY' is defined then `TARGET_MODE_EXIT' must be
       defined.
  
   -- Target Hook: int TARGET_MODE_EXIT (int ENTITY)
       If this macro is defined, it is evaluated for every ENTITY that
!      needs mode switching.  It should evaluate to an integer, which is
!      a mode that ENTITY is assumed to be switched to at function exit.
!      If `TARGET_MODE_EXIT' is defined then `TARGET_MODE_ENTRY' must be
       defined.
  
   -- Target Hook: int TARGET_MODE_PRIORITY (int ENTITY, int N)
       This macro specifies the order in which modes for ENTITY are
!      processed. 0 is the highest priority,
!      `NUM_MODES_FOR_MODE_SWITCHING[ENTITY] - 1' the lowest.  The value
       of the macro should be an integer designating a mode for ENTITY.
!      For any fixed ENTITY, `mode_priority' (ENTITY, N) shall be a
!      bijection in 0 ... `num_modes_for_mode_switching[ENTITY] - 1'.
  
  
  File: gccint.info,  Node: Target Attributes,  Next: Emulated TLS,  Prev: Mode Switching,  Up: Target Macros
  
! 17.24 Defining target-specific uses of `__attribute__'
  ======================================================
  
  Target-specific attributes may be defined for functions, data and types.
  These are described using the following target hooks; they also need to
! be documented in `extend.texi'.
  
   -- Target Hook: const struct attribute_spec * TARGET_ATTRIBUTE_TABLE
!      If defined, this target hook points to an array of `struct
!      attribute_spec' (defined in `tree.h') specifying the machine
!      specific attributes for this target and some of the restrictions
!      on the entities to which these attributes are applied and the
       arguments they take.
  
   -- Target Hook: bool TARGET_ATTRIBUTE_TAKES_IDENTIFIER_P (const_tree
--- 36657,36697 ----
  
   -- Target Hook: int TARGET_MODE_ENTRY (int ENTITY)
       If this macro is defined, it is evaluated for every ENTITY that
!      needs mode switching.  It should evaluate to an integer, which is a
!      mode that ENTITY is assumed to be switched to at function entry.
!      If 'TARGET_MODE_ENTRY' is defined then 'TARGET_MODE_EXIT' must be
       defined.
  
   -- Target Hook: int TARGET_MODE_EXIT (int ENTITY)
       If this macro is defined, it is evaluated for every ENTITY that
!      needs mode switching.  It should evaluate to an integer, which is a
!      mode that ENTITY is assumed to be switched to at function exit.  If
!      'TARGET_MODE_EXIT' is defined then 'TARGET_MODE_ENTRY' must be
       defined.
  
   -- Target Hook: int TARGET_MODE_PRIORITY (int ENTITY, int N)
       This macro specifies the order in which modes for ENTITY are
!      processed.  0 is the highest priority,
!      'NUM_MODES_FOR_MODE_SWITCHING[ENTITY] - 1' the lowest.  The value
       of the macro should be an integer designating a mode for ENTITY.
!      For any fixed ENTITY, 'mode_priority' (ENTITY, N) shall be a
!      bijection in 0 ... 'num_modes_for_mode_switching[ENTITY] - 1'.
  
  
  File: gccint.info,  Node: Target Attributes,  Next: Emulated TLS,  Prev: Mode Switching,  Up: Target Macros
  
! 17.24 Defining target-specific uses of '__attribute__'
  ======================================================
  
  Target-specific attributes may be defined for functions, data and types.
  These are described using the following target hooks; they also need to
! be documented in 'extend.texi'.
  
   -- Target Hook: const struct attribute_spec * TARGET_ATTRIBUTE_TABLE
!      If defined, this target hook points to an array of 'struct
!      attribute_spec' (defined in 'tree.h') specifying the machine
!      specific attributes for this target and some of the restrictions on
!      the entities to which these attributes are applied and the
       arguments they take.
  
   -- Target Hook: bool TARGET_ATTRIBUTE_TAKES_IDENTIFIER_P (const_tree
*************** be documented in `extend.texi'.
*** 37125,37134 ****
   -- Target Hook: int TARGET_COMP_TYPE_ATTRIBUTES (const_tree TYPE1,
            const_tree TYPE2)
       If defined, this target hook is a function which returns zero if
!      the attributes on TYPE1 and TYPE2 are incompatible, one if they
!      are compatible, and two if they are nearly compatible (which
!      causes a warning to be generated).  If this is not defined,
!      machine-specific attributes are supposed always to be compatible.
  
   -- Target Hook: void TARGET_SET_DEFAULT_TYPE_ATTRIBUTES (tree TYPE)
       If defined, this target hook is a function which assigns default
--- 36705,36714 ----
   -- Target Hook: int TARGET_COMP_TYPE_ATTRIBUTES (const_tree TYPE1,
            const_tree TYPE2)
       If defined, this target hook is a function which returns zero if
!      the attributes on TYPE1 and TYPE2 are incompatible, one if they are
!      compatible, and two if they are nearly compatible (which causes a
!      warning to be generated).  If this is not defined, machine-specific
!      attributes are supposed always to be compatible.
  
   -- Target Hook: void TARGET_SET_DEFAULT_TYPE_ATTRIBUTES (tree TYPE)
       If defined, this target hook is a function which assigns default
*************** be documented in `extend.texi'.
*** 37138,37269 ****
            TYPE2)
       Define this target hook if the merging of type attributes needs
       special handling.  If defined, the result is a list of the combined
!      `TYPE_ATTRIBUTES' of TYPE1 and TYPE2.  It is assumed that
!      `comptypes' has already been called and returned 1.  This function
!      may call `merge_attributes' to handle machine-independent merging.
  
   -- Target Hook: tree TARGET_MERGE_DECL_ATTRIBUTES (tree OLDDECL, tree
            NEWDECL)
       Define this target hook if the merging of decl attributes needs
       special handling.  If defined, the result is a list of the combined
!      `DECL_ATTRIBUTES' of OLDDECL and NEWDECL.  NEWDECL is a duplicate
       declaration of OLDDECL.  Examples of when this is needed are when
       one attribute overrides another, or when an attribute is nullified
       by a subsequent definition.  This function may call
!      `merge_attributes' to handle machine-independent merging.
  
!      If the only target-specific handling you require is `dllimport'
!      for Microsoft Windows targets, you should define the macro
!      `TARGET_DLLIMPORT_DECL_ATTRIBUTES' to `1'.  The compiler will then
!      define a function called `merge_dllimport_decl_attributes' which
       can then be defined as the expansion of
!      `TARGET_MERGE_DECL_ATTRIBUTES'.  You can also add
!      `handle_dll_attribute' in the attribute table for your port to
!      perform initial processing of the `dllimport' and `dllexport'
!      attributes.  This is done in `i386/cygwin.h' and `i386/i386.c',
!      for example.
  
   -- Target Hook: bool TARGET_VALID_DLLIMPORT_ATTRIBUTE_P (const_tree
            DECL)
!      DECL is a variable or function with `__attribute__((dllimport))'
       specified.  Use this hook if the target needs to add extra
!      validation checks to `handle_dll_attribute'.
  
   -- Macro: TARGET_DECLSPEC
       Define this macro to a nonzero value if you want to treat
!      `__declspec(X)' as equivalent to `__attribute((X))'.  By default,
       this behavior is enabled only for targets that define
!      `TARGET_DLLIMPORT_DECL_ATTRIBUTES'.  The current implementation of
!      `__declspec' is via a built-in macro, but you should not rely on
       this implementation detail.
  
   -- Target Hook: void TARGET_INSERT_ATTRIBUTES (tree NODE, tree
            *ATTR_PTR)
!      Define this target hook if you want to be able to add attributes
!      to a decl when it is being created.  This is normally useful for
!      back ends which wish to implement a pragma by using the attributes
!      which correspond to the pragma's effect.  The NODE argument is the
!      decl which is being created.  The ATTR_PTR argument is a pointer
!      to the attribute list for this decl.  The list itself should not
!      be modified, since it may be shared with other decls, but
!      attributes may be chained on the head of the list and `*ATTR_PTR'
!      modified to point to the new attributes, or a copy of the list may
!      be made if further changes are needed.
  
   -- Target Hook: bool TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P (const_tree
            FNDECL)
!      This target hook returns `true' if it is OK to inline FNDECL into
       the current function, despite its having target-specific
!      attributes, `false' otherwise.  By default, if a function has a
       target specific attribute attached to it, it will not be inlined.
  
!  -- Target Hook: bool TARGET_OPTION_VALID_ATTRIBUTE_P (tree FNDECL,
!           tree NAME, tree ARGS, int FLAGS)
!      This hook is called to parse `attribute(target("..."))', which
       allows setting target-specific options on individual functions.
       These function-specific options may differ from the options
!      specified on the command line.  The hook should return `true' if
       the options are valid.
  
!      The hook should set the `DECL_FUNCTION_SPECIFIC_TARGET' field in
       the function declaration to hold a pointer to a target-specific
!      `struct cl_target_option' structure.
  
   -- Target Hook: void TARGET_OPTION_SAVE (struct cl_target_option *PTR,
            struct gcc_options *OPTS)
       This hook is called to save any additional target-specific
!      information in the `struct cl_target_option' structure for
!      function-specific options from the `struct gcc_options' structure.
       *Note Option file format::.
  
   -- Target Hook: void TARGET_OPTION_RESTORE (struct gcc_options *OPTS,
            struct cl_target_option *PTR)
       This hook is called to restore any additional target-specific
!      information in the `struct cl_target_option' structure for
!      function-specific options to the `struct gcc_options' structure.
  
   -- Target Hook: void TARGET_OPTION_POST_STREAM_IN (struct
            cl_target_option *PTR)
       This hook is called to update target-specific information in the
!      `struct cl_target_option' structure after it is streamed in from
       LTO bytecode.
  
   -- Target Hook: void TARGET_OPTION_PRINT (FILE *FILE, int INDENT,
            struct cl_target_option *PTR)
       This hook is called to print any additional target-specific
!      information in the `struct cl_target_option' structure for
       function-specific options.
  
   -- Target Hook: bool TARGET_OPTION_PRAGMA_PARSE (tree ARGS, tree
            POP_TARGET)
!      This target hook parses the options for `#pragma GCC target', which
       sets the target-specific options for functions that occur later in
!      the input stream.  The options accepted should be the same as
!      those handled by the `TARGET_OPTION_VALID_ATTRIBUTE_P' hook.
  
   -- Target Hook: void TARGET_OPTION_OVERRIDE (void)
!      Sometimes certain combinations of command options do not make
!      sense on a particular target machine.  You can override the hook
!      `TARGET_OPTION_OVERRIDE' to take account of this.  This hooks is
       called once just after all the command options have been parsed.
  
       Don't use this hook to turn on various extra optimizations for
!      `-O'.  That is what `TARGET_OPTION_OPTIMIZATION' is for.
  
       If you need to do something whenever the optimization level is
       changed via the optimize attribute or pragma, see
!      `TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE'
  
   -- Target Hook: bool TARGET_OPTION_FUNCTION_VERSIONS (tree DECL1, tree
            DECL2)
!      This target hook returns `true' if DECL1 and DECL2 are versions of
       the same function.  DECL1 and DECL2 are function versions if and
       only if they have the same function signature and different target
       specific attributes, that is, they are compiled for different
       target machines.
  
   -- Target Hook: bool TARGET_CAN_INLINE_P (tree CALLER, tree CALLEE)
!      This target hook returns `false' if the CALLER function cannot
       inline CALLEE, based on target specific information.  By default,
       inlining is not allowed if the callee function has function
       specific target options and the caller does not use the same
--- 36718,36849 ----
            TYPE2)
       Define this target hook if the merging of type attributes needs
       special handling.  If defined, the result is a list of the combined
!      'TYPE_ATTRIBUTES' of TYPE1 and TYPE2.  It is assumed that
!      'comptypes' has already been called and returned 1.  This function
!      may call 'merge_attributes' to handle machine-independent merging.
  
   -- Target Hook: tree TARGET_MERGE_DECL_ATTRIBUTES (tree OLDDECL, tree
            NEWDECL)
       Define this target hook if the merging of decl attributes needs
       special handling.  If defined, the result is a list of the combined
!      'DECL_ATTRIBUTES' of OLDDECL and NEWDECL.  NEWDECL is a duplicate
       declaration of OLDDECL.  Examples of when this is needed are when
       one attribute overrides another, or when an attribute is nullified
       by a subsequent definition.  This function may call
!      'merge_attributes' to handle machine-independent merging.
  
!      If the only target-specific handling you require is 'dllimport' for
!      Microsoft Windows targets, you should define the macro
!      'TARGET_DLLIMPORT_DECL_ATTRIBUTES' to '1'.  The compiler will then
!      define a function called 'merge_dllimport_decl_attributes' which
       can then be defined as the expansion of
!      'TARGET_MERGE_DECL_ATTRIBUTES'.  You can also add
!      'handle_dll_attribute' in the attribute table for your port to
!      perform initial processing of the 'dllimport' and 'dllexport'
!      attributes.  This is done in 'i386/cygwin.h' and 'i386/i386.c', for
!      example.
  
   -- Target Hook: bool TARGET_VALID_DLLIMPORT_ATTRIBUTE_P (const_tree
            DECL)
!      DECL is a variable or function with '__attribute__((dllimport))'
       specified.  Use this hook if the target needs to add extra
!      validation checks to 'handle_dll_attribute'.
  
   -- Macro: TARGET_DECLSPEC
       Define this macro to a nonzero value if you want to treat
!      '__declspec(X)' as equivalent to '__attribute((X))'.  By default,
       this behavior is enabled only for targets that define
!      'TARGET_DLLIMPORT_DECL_ATTRIBUTES'.  The current implementation of
!      '__declspec' is via a built-in macro, but you should not rely on
       this implementation detail.
  
   -- Target Hook: void TARGET_INSERT_ATTRIBUTES (tree NODE, tree
            *ATTR_PTR)
!      Define this target hook if you want to be able to add attributes to
!      a decl when it is being created.  This is normally useful for back
!      ends which wish to implement a pragma by using the attributes which
!      correspond to the pragma's effect.  The NODE argument is the decl
!      which is being created.  The ATTR_PTR argument is a pointer to the
!      attribute list for this decl.  The list itself should not be
!      modified, since it may be shared with other decls, but attributes
!      may be chained on the head of the list and '*ATTR_PTR' modified to
!      point to the new attributes, or a copy of the list may be made if
!      further changes are needed.
  
   -- Target Hook: bool TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P (const_tree
            FNDECL)
!      This target hook returns 'true' if it is OK to inline FNDECL into
       the current function, despite its having target-specific
!      attributes, 'false' otherwise.  By default, if a function has a
       target specific attribute attached to it, it will not be inlined.
  
!  -- Target Hook: bool TARGET_OPTION_VALID_ATTRIBUTE_P (tree FNDECL, tree
!           NAME, tree ARGS, int FLAGS)
!      This hook is called to parse 'attribute(target("..."))', which
       allows setting target-specific options on individual functions.
       These function-specific options may differ from the options
!      specified on the command line.  The hook should return 'true' if
       the options are valid.
  
!      The hook should set the 'DECL_FUNCTION_SPECIFIC_TARGET' field in
       the function declaration to hold a pointer to a target-specific
!      'struct cl_target_option' structure.
  
   -- Target Hook: void TARGET_OPTION_SAVE (struct cl_target_option *PTR,
            struct gcc_options *OPTS)
       This hook is called to save any additional target-specific
!      information in the 'struct cl_target_option' structure for
!      function-specific options from the 'struct gcc_options' structure.
       *Note Option file format::.
  
   -- Target Hook: void TARGET_OPTION_RESTORE (struct gcc_options *OPTS,
            struct cl_target_option *PTR)
       This hook is called to restore any additional target-specific
!      information in the 'struct cl_target_option' structure for
!      function-specific options to the 'struct gcc_options' structure.
  
   -- Target Hook: void TARGET_OPTION_POST_STREAM_IN (struct
            cl_target_option *PTR)
       This hook is called to update target-specific information in the
!      'struct cl_target_option' structure after it is streamed in from
       LTO bytecode.
  
   -- Target Hook: void TARGET_OPTION_PRINT (FILE *FILE, int INDENT,
            struct cl_target_option *PTR)
       This hook is called to print any additional target-specific
!      information in the 'struct cl_target_option' structure for
       function-specific options.
  
   -- Target Hook: bool TARGET_OPTION_PRAGMA_PARSE (tree ARGS, tree
            POP_TARGET)
!      This target hook parses the options for '#pragma GCC target', which
       sets the target-specific options for functions that occur later in
!      the input stream.  The options accepted should be the same as those
!      handled by the 'TARGET_OPTION_VALID_ATTRIBUTE_P' hook.
  
   -- Target Hook: void TARGET_OPTION_OVERRIDE (void)
!      Sometimes certain combinations of command options do not make sense
!      on a particular target machine.  You can override the hook
!      'TARGET_OPTION_OVERRIDE' to take account of this.  This hooks is
       called once just after all the command options have been parsed.
  
       Don't use this hook to turn on various extra optimizations for
!      '-O'.  That is what 'TARGET_OPTION_OPTIMIZATION' is for.
  
       If you need to do something whenever the optimization level is
       changed via the optimize attribute or pragma, see
!      'TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE'
  
   -- Target Hook: bool TARGET_OPTION_FUNCTION_VERSIONS (tree DECL1, tree
            DECL2)
!      This target hook returns 'true' if DECL1 and DECL2 are versions of
       the same function.  DECL1 and DECL2 are function versions if and
       only if they have the same function signature and different target
       specific attributes, that is, they are compiled for different
       target machines.
  
   -- Target Hook: bool TARGET_CAN_INLINE_P (tree CALLER, tree CALLEE)
!      This target hook returns 'false' if the CALLER function cannot
       inline CALLEE, based on target specific information.  By default,
       inlining is not allowed if the callee function has function
       specific target options and the caller does not use the same
*************** layer.
*** 37284,37291 ****
  
   The emulation layer works by creating a control object for every TLS
  object.  To access the TLS object, a lookup function is provided which,
! when given the address of the control object, will return the address
! of the current thread's instance of the TLS object.
  
   -- Target Hook: const char * TARGET_EMUTLS_GET_ADDRESS
       Contains the name of the helper function that uses a TLS control
--- 36864,36871 ----
  
   The emulation layer works by creating a control object for every TLS
  object.  To access the TLS object, a lookup function is provided which,
! when given the address of the control object, will return the address of
! the current thread's instance of the TLS object.
  
   -- Target Hook: const char * TARGET_EMUTLS_GET_ADDRESS
       Contains the name of the helper function that uses a TLS control
*************** of the current thread's instance of the
*** 37295,37334 ****
   -- Target Hook: const char * TARGET_EMUTLS_REGISTER_COMMON
       Contains the name of the helper function that should be used at
       program startup to register TLS objects that are implicitly
!      initialized to zero.  If this is `NULL', all TLS objects will have
       explicit initializers.  The default causes libgcc's emulated TLS
       registration function to be used.
  
   -- Target Hook: const char * TARGET_EMUTLS_VAR_SECTION
       Contains the name of the section in which TLS control variables
!      should be placed.  The default of `NULL' allows these to be placed
       in any section.
  
   -- Target Hook: const char * TARGET_EMUTLS_TMPL_SECTION
       Contains the name of the section in which TLS initializers should
!      be placed.  The default of `NULL' allows these to be placed in any
       section.
  
   -- Target Hook: const char * TARGET_EMUTLS_VAR_PREFIX
       Contains the prefix to be prepended to TLS control variable names.
!      The default of `NULL' uses a target-specific prefix.
  
   -- Target Hook: const char * TARGET_EMUTLS_TMPL_PREFIX
       Contains the prefix to be prepended to TLS initializer objects.
!      The default of `NULL' uses a target-specific prefix.
  
   -- Target Hook: tree TARGET_EMUTLS_VAR_FIELDS (tree TYPE, tree *NAME)
       Specifies a function that generates the FIELD_DECLs for a TLS
       control object type.  TYPE is the RECORD_TYPE the fields are for
       and NAME should be filled with the structure tag, if the default of
!      `__emutls_object' is unsuitable.  The default creates a type
       suitable for libgcc's emulated TLS function.
  
   -- Target Hook: tree TARGET_EMUTLS_VAR_INIT (tree VAR, tree DECL, tree
            TMPL_ADDR)
       Specifies a function that generates the CONSTRUCTOR to initialize a
!      TLS control object.  VAR is the TLS control object, DECL is the
!      TLS object and TMPL_ADDR is the address of the initializer.  The
       default initializes libgcc's emulated TLS control object.
  
   -- Target Hook: bool TARGET_EMUTLS_VAR_ALIGN_FIXED
--- 36875,36914 ----
   -- Target Hook: const char * TARGET_EMUTLS_REGISTER_COMMON
       Contains the name of the helper function that should be used at
       program startup to register TLS objects that are implicitly
!      initialized to zero.  If this is 'NULL', all TLS objects will have
       explicit initializers.  The default causes libgcc's emulated TLS
       registration function to be used.
  
   -- Target Hook: const char * TARGET_EMUTLS_VAR_SECTION
       Contains the name of the section in which TLS control variables
!      should be placed.  The default of 'NULL' allows these to be placed
       in any section.
  
   -- Target Hook: const char * TARGET_EMUTLS_TMPL_SECTION
       Contains the name of the section in which TLS initializers should
!      be placed.  The default of 'NULL' allows these to be placed in any
       section.
  
   -- Target Hook: const char * TARGET_EMUTLS_VAR_PREFIX
       Contains the prefix to be prepended to TLS control variable names.
!      The default of 'NULL' uses a target-specific prefix.
  
   -- Target Hook: const char * TARGET_EMUTLS_TMPL_PREFIX
       Contains the prefix to be prepended to TLS initializer objects.
!      The default of 'NULL' uses a target-specific prefix.
  
   -- Target Hook: tree TARGET_EMUTLS_VAR_FIELDS (tree TYPE, tree *NAME)
       Specifies a function that generates the FIELD_DECLs for a TLS
       control object type.  TYPE is the RECORD_TYPE the fields are for
       and NAME should be filled with the structure tag, if the default of
!      '__emutls_object' is unsuitable.  The default creates a type
       suitable for libgcc's emulated TLS function.
  
   -- Target Hook: tree TARGET_EMUTLS_VAR_INIT (tree VAR, tree DECL, tree
            TMPL_ADDR)
       Specifies a function that generates the CONSTRUCTOR to initialize a
!      TLS control object.  VAR is the TLS control object, DECL is the TLS
!      object and TMPL_ADDR is the address of the initializer.  The
       default initializes libgcc's emulated TLS control object.
  
   -- Target Hook: bool TARGET_EMUTLS_VAR_ALIGN_FIXED
*************** of the current thread's instance of the
*** 37337,37343 ****
       optimize single objects.  The default is false.
  
   -- Target Hook: bool TARGET_EMUTLS_DEBUG_FORM_TLS_ADDRESS
!      Specifies whether a DWARF `DW_OP_form_tls_address' location
       descriptor may be used to describe emulated TLS control objects.
  
  
--- 36917,36923 ----
       optimize single objects.  The default is false.
  
   -- Target Hook: bool TARGET_EMUTLS_DEBUG_FORM_TLS_ADDRESS
!      Specifies whether a DWARF 'DW_OP_form_tls_address' location
       descriptor may be used to describe emulated TLS control objects.
  
  
*************** and memory using asm-ized variables.  Fo
*** 37358,37364 ****
  
   ("c0r1" is the default name of register 1 in coprocessor 0; alternate
  names may be added as described below, or the default names may be
! overridden entirely in `SUBTARGET_CONDITIONAL_REGISTER_USAGE'.)
  
   Coprocessor registers are assumed to be epilogue-used; sets to them
  will be preserved even if it does not appear that the register is used
--- 36938,36944 ----
  
   ("c0r1" is the default name of register 1 in coprocessor 0; alternate
  names may be added as described below, or the default names may be
! overridden entirely in 'SUBTARGET_CONDITIONAL_REGISTER_USAGE'.)
  
   Coprocessor registers are assumed to be epilogue-used; sets to them
  will be preserved even if it does not appear that the register is used
*************** File: gccint.info,  Node: PCH Target,  N
*** 37376,37406 ****
  
   -- Target Hook: void * TARGET_GET_PCH_VALIDITY (size_t *SZ)
       This hook returns a pointer to the data needed by
!      `TARGET_PCH_VALID_P' and sets `*SZ' to the size of the data in
       bytes.
  
   -- Target Hook: const char * TARGET_PCH_VALID_P (const void *DATA,
            size_t SZ)
       This hook checks whether the options used to create a PCH file are
!      compatible with the current settings.  It returns `NULL' if so and
       a suitable error message if not.  Error messages will be presented
!      to the user and must be localized using `_(MSG)'.
  
!      DATA is the data that was returned by `TARGET_GET_PCH_VALIDITY'
       when the PCH file was created and SZ is the size of that data in
       bytes.  It's safe to assume that the data was created by the same
       version of the compiler, so no format checking is needed.
  
!      The default definition of `default_pch_valid_p' should be suitable
       for most targets.
  
   -- Target Hook: const char * TARGET_CHECK_PCH_TARGET_FLAGS (int
            PCH_FLAGS)
       If this hook is nonnull, the default implementation of
!      `TARGET_PCH_VALID_P' will use it to check for compatible values of
!      `target_flags'.  PCH_FLAGS specifies the value that `target_flags'
!      had when the PCH file was created.  The return value is the same
!      as for `TARGET_PCH_VALID_P'.
  
   -- Target Hook: void TARGET_PREPARE_PCH_SAVE (void)
       Called before writing out a PCH file.  If the target has some
--- 36956,36986 ----
  
   -- Target Hook: void * TARGET_GET_PCH_VALIDITY (size_t *SZ)
       This hook returns a pointer to the data needed by
!      'TARGET_PCH_VALID_P' and sets '*SZ' to the size of the data in
       bytes.
  
   -- Target Hook: const char * TARGET_PCH_VALID_P (const void *DATA,
            size_t SZ)
       This hook checks whether the options used to create a PCH file are
!      compatible with the current settings.  It returns 'NULL' if so and
       a suitable error message if not.  Error messages will be presented
!      to the user and must be localized using '_(MSG)'.
  
!      DATA is the data that was returned by 'TARGET_GET_PCH_VALIDITY'
       when the PCH file was created and SZ is the size of that data in
       bytes.  It's safe to assume that the data was created by the same
       version of the compiler, so no format checking is needed.
  
!      The default definition of 'default_pch_valid_p' should be suitable
       for most targets.
  
   -- Target Hook: const char * TARGET_CHECK_PCH_TARGET_FLAGS (int
            PCH_FLAGS)
       If this hook is nonnull, the default implementation of
!      'TARGET_PCH_VALID_P' will use it to check for compatible values of
!      'target_flags'.  PCH_FLAGS specifies the value that 'target_flags'
!      had when the PCH file was created.  The return value is the same as
!      for 'TARGET_PCH_VALID_P'.
  
   -- Target Hook: void TARGET_PREPARE_PCH_SAVE (void)
       Called before writing out a PCH file.  If the target has some
*************** File: gccint.info,  Node: C++ ABI,  Next
*** 37421,37440 ****
  
   -- Target Hook: bool TARGET_CXX_GUARD_MASK_BIT (void)
       This hook determines how guard variables are used.  It should
!      return `false' (the default) if the first byte should be used.  A
!      return value of `true' indicates that only the least significant
       bit should be used.
  
   -- Target Hook: tree TARGET_CXX_GET_COOKIE_SIZE (tree TYPE)
       This hook returns the size of the cookie to use when allocating an
       array whose elements have the indicated TYPE.  Assumes that it is
!      already known that a cookie is needed.  The default is `max(sizeof
       (size_t), alignof(type))', as defined in section 2.7 of the
       IA64/Generic C++ ABI.
  
   -- Target Hook: bool TARGET_CXX_COOKIE_HAS_SIZE (void)
!      This hook should return `true' if the element size should be
!      stored in array cookies.  The default is to return `false'.
  
   -- Target Hook: int TARGET_CXX_IMPORT_EXPORT_CLASS (tree TYPE, int
            IMPORT_EXPORT)
--- 37001,37020 ----
  
   -- Target Hook: bool TARGET_CXX_GUARD_MASK_BIT (void)
       This hook determines how guard variables are used.  It should
!      return 'false' (the default) if the first byte should be used.  A
!      return value of 'true' indicates that only the least significant
       bit should be used.
  
   -- Target Hook: tree TARGET_CXX_GET_COOKIE_SIZE (tree TYPE)
       This hook returns the size of the cookie to use when allocating an
       array whose elements have the indicated TYPE.  Assumes that it is
!      already known that a cookie is needed.  The default is 'max(sizeof
       (size_t), alignof(type))', as defined in section 2.7 of the
       IA64/Generic C++ ABI.
  
   -- Target Hook: bool TARGET_CXX_COOKIE_HAS_SIZE (void)
!      This hook should return 'true' if the element size should be stored
!      in array cookies.  The default is to return 'false'.
  
   -- Target Hook: int TARGET_CXX_IMPORT_EXPORT_CLASS (tree TYPE, int
            IMPORT_EXPORT)
*************** File: gccint.info,  Node: C++ ABI,  Next
*** 37446,37454 ****
       the backend's targeted operating system.
  
   -- Target Hook: bool TARGET_CXX_CDTOR_RETURNS_THIS (void)
!      This hook should return `true' if constructors and destructors
!      return the address of the object created/destroyed.  The default
!      is to return `false'.
  
   -- Target Hook: bool TARGET_CXX_KEY_METHOD_MAY_BE_INLINE (void)
       This hook returns true if the key method for a class (i.e., the
--- 37026,37034 ----
       the backend's targeted operating system.
  
   -- Target Hook: bool TARGET_CXX_CDTOR_RETURNS_THIS (void)
!      This hook should return 'true' if constructors and destructors
!      return the address of the object created/destroyed.  The default is
!      to return 'false'.
  
   -- Target Hook: bool TARGET_CXX_KEY_METHOD_MAY_BE_INLINE (void)
       This hook returns true if the key method for a class (i.e., the
*************** File: gccint.info,  Node: C++ ABI,  Next
*** 37458,37464 ****
       function so long as the function is not declared inline in the
       class definition.  Under some variants of the ABI, an inline
       function can never be the key method.  The default is to return
!      `true'.
  
   -- Target Hook: void TARGET_CXX_DETERMINE_CLASS_DATA_VISIBILITY (tree
            DECL)
--- 37038,37044 ----
       function so long as the function is not declared inline in the
       class definition.  Under some variants of the ABI, an inline
       function can never be the key method.  The default is to return
!      'true'.
  
   -- Target Hook: void TARGET_CXX_DETERMINE_CLASS_DATA_VISIBILITY (tree
            DECL)
*************** File: gccint.info,  Node: C++ ABI,  Next
*** 37467,37473 ****
       external linkage in this translation unit.  No ELF visibility has
       been explicitly specified.  If the target needs to specify a
       visibility other than that of the containing class, use this hook
!      to set `DECL_VISIBILITY' and `DECL_VISIBILITY_SPECIFIED'.
  
   -- Target Hook: bool TARGET_CXX_CLASS_DATA_ALWAYS_COMDAT (void)
       This hook returns true (the default) if virtual tables and other
--- 37047,37053 ----
       external linkage in this translation unit.  No ELF visibility has
       been explicitly specified.  If the target needs to specify a
       visibility other than that of the containing class, use this hook
!      to set 'DECL_VISIBILITY' and 'DECL_VISIBILITY_SPECIFIED'.
  
   -- Target Hook: bool TARGET_CXX_CLASS_DATA_ALWAYS_COMDAT (void)
       This hook returns true (the default) if virtual tables and other
*************** File: gccint.info,  Node: C++ ABI,  Next
*** 37482,37507 ****
       be COMDAT, false if it should not be COMDAT.
  
   -- Target Hook: bool TARGET_CXX_USE_AEABI_ATEXIT (void)
!      This hook returns true if `__aeabi_atexit' (as defined by the ARM
       EABI) should be used to register static destructors when
!      `-fuse-cxa-atexit' is in effect.  The default is to return false
!      to use `__cxa_atexit'.
  
   -- Target Hook: bool TARGET_CXX_USE_ATEXIT_FOR_CXA_ATEXIT (void)
!      This hook returns true if the target `atexit' function can be used
!      in the same manner as `__cxa_atexit' to register C++ static
!      destructors. This requires that `atexit'-registered functions in
       shared libraries are run in the correct order when the libraries
!      are unloaded. The default is to return false.
  
   -- Target Hook: void TARGET_CXX_ADJUST_CLASS_AT_DEFINITION (tree TYPE)
!      TYPE is a C++ class (i.e., RECORD_TYPE or UNION_TYPE) that has
!      just been defined.  Use this hook to make adjustments to the class
!      (eg, tweak visibility or perform any other required target
       modifications).
  
   -- Target Hook: tree TARGET_CXX_DECL_MANGLING_CONTEXT (const_tree DECL)
!      Return target-specific mangling context of DECL or `NULL_TREE'.
  
  
  File: gccint.info,  Node: Named Address Spaces,  Next: Misc,  Prev: C++ ABI,  Up: Target Macros
--- 37062,37087 ----
       be COMDAT, false if it should not be COMDAT.
  
   -- Target Hook: bool TARGET_CXX_USE_AEABI_ATEXIT (void)
!      This hook returns true if '__aeabi_atexit' (as defined by the ARM
       EABI) should be used to register static destructors when
!      '-fuse-cxa-atexit' is in effect.  The default is to return false to
!      use '__cxa_atexit'.
  
   -- Target Hook: bool TARGET_CXX_USE_ATEXIT_FOR_CXA_ATEXIT (void)
!      This hook returns true if the target 'atexit' function can be used
!      in the same manner as '__cxa_atexit' to register C++ static
!      destructors.  This requires that 'atexit'-registered functions in
       shared libraries are run in the correct order when the libraries
!      are unloaded.  The default is to return false.
  
   -- Target Hook: void TARGET_CXX_ADJUST_CLASS_AT_DEFINITION (tree TYPE)
!      TYPE is a C++ class (i.e., RECORD_TYPE or UNION_TYPE) that has just
!      been defined.  Use this hook to make adjustments to the class (eg,
!      tweak visibility or perform any other required target
       modifications).
  
   -- Target Hook: tree TARGET_CXX_DECL_MANGLING_CONTEXT (const_tree DECL)
!      Return target-specific mangling context of DECL or 'NULL_TREE'.
  
  
  File: gccint.info,  Node: Named Address Spaces,  Next: Misc,  Prev: C++ ABI,  Up: Target Macros
*************** File: gccint.info,  Node: Named Address
*** 37510,37531 ****
  =============================================
  
  The draft technical report of the ISO/IEC JTC1 S22 WG14 N1275 standards
! committee, `Programming Languages - C - Extensions to support embedded
  processors', specifies a syntax for embedded processors to specify
  alternate address spaces.  You can configure a GCC port to support
  section 5.1 of the draft report to add support for address spaces other
  than the default address space.  These address spaces are new keywords
! that are similar to the `volatile' and `const' type attributes.
  
   Pointers to named address spaces can have a different size than
  pointers to the generic address space.
  
!  For example, the SPU port uses the `__ea' address space to refer to
  memory in the host processor, rather than memory local to the SPU
! processor.  Access to memory in the `__ea' address space involves
  issuing DMA operations to move data between the host processor and the
! local processor memory address space.  Pointers in the `__ea' address
! space are either 32 bits or 64 bits based on the `-mea32' or `-mea64'
  switches (native SPU pointers are always 32 bits).
  
   Internally, address spaces are represented as a small integer in the
--- 37090,37111 ----
  =============================================
  
  The draft technical report of the ISO/IEC JTC1 S22 WG14 N1275 standards
! committee, 'Programming Languages - C - Extensions to support embedded
  processors', specifies a syntax for embedded processors to specify
  alternate address spaces.  You can configure a GCC port to support
  section 5.1 of the draft report to add support for address spaces other
  than the default address space.  These address spaces are new keywords
! that are similar to the 'volatile' and 'const' type attributes.
  
   Pointers to named address spaces can have a different size than
  pointers to the generic address space.
  
!  For example, the SPU port uses the '__ea' address space to refer to
  memory in the host processor, rather than memory local to the SPU
! processor.  Access to memory in the '__ea' address space involves
  issuing DMA operations to move data between the host processor and the
! local processor memory address space.  Pointers in the '__ea' address
! space are either 32 bits or 64 bits based on the '-mea32' or '-mea64'
  switches (native SPU pointers are always 32 bits).
  
   Internally, address spaces are represented as a small integer in the
*************** range 0 to 15 with address space 0 being
*** 37533,37540 ****
  address space.
  
   To register a named address space qualifier keyword with the C front
! end, the target may call the `c_register_addr_space' routine.  For
! example, the SPU port uses the following to declare `__ea' as the
  keyword for named address space #1:
       #define ADDR_SPACE_EA 1
       c_register_addr_space ("__ea", ADDR_SPACE_EA);
--- 37113,37120 ----
  address space.
  
   To register a named address space qualifier keyword with the C front
! end, the target may call the 'c_register_addr_space' routine.  For
! example, the SPU port uses the following to declare '__ea' as the
  keyword for named address space #1:
       #define ADDR_SPACE_EA 1
       c_register_addr_space ("__ea", ADDR_SPACE_EA);
*************** keyword for named address space #1:
*** 37543,37583 ****
            (addr_space_t ADDRESS_SPACE)
       Define this to return the machine mode to use for pointers to
       ADDRESS_SPACE if the target supports named address spaces.  The
!      default version of this hook returns `ptr_mode' for the generic
       address space only.
  
   -- Target Hook: machine_mode TARGET_ADDR_SPACE_ADDRESS_MODE
            (addr_space_t ADDRESS_SPACE)
       Define this to return the machine mode to use for addresses in
       ADDRESS_SPACE if the target supports named address spaces.  The
!      default version of this hook returns `Pmode' for the generic
       address space only.
  
!  -- Target Hook: bool TARGET_ADDR_SPACE_VALID_POINTER_MODE
!           (machine_mode MODE, addr_space_t AS)
       Define this to return nonzero if the port can handle pointers with
       machine mode MODE to address space AS.  This target hook is the
!      same as the `TARGET_VALID_POINTER_MODE' target hook, except that
!      it includes explicit named address space support.  The default
!      version of this hook returns true for the modes returned by either
!      the `TARGET_ADDR_SPACE_POINTER_MODE' or
!      `TARGET_ADDR_SPACE_ADDRESS_MODE' target hooks for the given
!      address space.
  
   -- Target Hook: bool TARGET_ADDR_SPACE_LEGITIMATE_ADDRESS_P
            (machine_mode MODE, rtx EXP, bool STRICT, addr_space_t AS)
       Define this to return true if EXP is a valid address for mode MODE
       in the named address space AS.  The STRICT parameter says whether
       strict addressing is in effect after reload has finished.  This
!      target hook is the same as the `TARGET_LEGITIMATE_ADDRESS_P'
!      target hook, except that it includes explicit named address space
!      support.
  
   -- Target Hook: rtx TARGET_ADDR_SPACE_LEGITIMIZE_ADDRESS (rtx X, rtx
            OLDX, machine_mode MODE, addr_space_t AS)
       Define this to modify an invalid address X to be a valid address
       with mode MODE in the named address space AS.  This target hook is
!      the same as the `TARGET_LEGITIMIZE_ADDRESS' target hook, except
       that it includes explicit named address space support.
  
   -- Target Hook: bool TARGET_ADDR_SPACE_SUBSET_P (addr_space_t SUBSET,
--- 37123,37162 ----
            (addr_space_t ADDRESS_SPACE)
       Define this to return the machine mode to use for pointers to
       ADDRESS_SPACE if the target supports named address spaces.  The
!      default version of this hook returns 'ptr_mode' for the generic
       address space only.
  
   -- Target Hook: machine_mode TARGET_ADDR_SPACE_ADDRESS_MODE
            (addr_space_t ADDRESS_SPACE)
       Define this to return the machine mode to use for addresses in
       ADDRESS_SPACE if the target supports named address spaces.  The
!      default version of this hook returns 'Pmode' for the generic
       address space only.
  
!  -- Target Hook: bool TARGET_ADDR_SPACE_VALID_POINTER_MODE (machine_mode
!           MODE, addr_space_t AS)
       Define this to return nonzero if the port can handle pointers with
       machine mode MODE to address space AS.  This target hook is the
!      same as the 'TARGET_VALID_POINTER_MODE' target hook, except that it
!      includes explicit named address space support.  The default version
!      of this hook returns true for the modes returned by either the
!      'TARGET_ADDR_SPACE_POINTER_MODE' or
!      'TARGET_ADDR_SPACE_ADDRESS_MODE' target hooks for the given address
!      space.
  
   -- Target Hook: bool TARGET_ADDR_SPACE_LEGITIMATE_ADDRESS_P
            (machine_mode MODE, rtx EXP, bool STRICT, addr_space_t AS)
       Define this to return true if EXP is a valid address for mode MODE
       in the named address space AS.  The STRICT parameter says whether
       strict addressing is in effect after reload has finished.  This
!      target hook is the same as the 'TARGET_LEGITIMATE_ADDRESS_P' target
!      hook, except that it includes explicit named address space support.
  
   -- Target Hook: rtx TARGET_ADDR_SPACE_LEGITIMIZE_ADDRESS (rtx X, rtx
            OLDX, machine_mode MODE, addr_space_t AS)
       Define this to modify an invalid address X to be a valid address
       with mode MODE in the named address space AS.  This target hook is
!      the same as the 'TARGET_LEGITIMIZE_ADDRESS' target hook, except
       that it includes explicit named address space support.
  
   -- Target Hook: bool TARGET_ADDR_SPACE_SUBSET_P (addr_space_t SUBSET,
*************** keyword for named address space #1:
*** 37596,37602 ****
       a new pointer expression with type TO_TYPE that points to a
       different named address space.  When this hook it called, it is
       guaranteed that one of the two address spaces is a subset of the
!      other, as determined by the `TARGET_ADDR_SPACE_SUBSET_P' target
       hook.
  
  
--- 37175,37181 ----
       a new pointer expression with type TO_TYPE that points to a
       different named address space.  When this hook it called, it is
       guaranteed that one of the two address spaces is a subset of the
!      other, as determined by the 'TARGET_ADDR_SPACE_SUBSET_P' target
       hook.
  
  
*************** Here are several miscellaneous parameter
*** 37611,37618 ****
       Define this boolean macro to indicate whether or not your
       architecture has conditional branches that can span all of memory.
       It is used in conjunction with an optimization that partitions hot
!      and cold basic blocks into separate sections of the executable.
!      If this macro is set to false, gcc will convert any conditional
       branches that attempt to cross between sections into unconditional
       branches or indirect jumps.
  
--- 37190,37197 ----
       Define this boolean macro to indicate whether or not your
       architecture has conditional branches that can span all of memory.
       It is used in conjunction with an optimization that partitions hot
!      and cold basic blocks into separate sections of the executable.  If
!      this macro is set to false, gcc will convert any conditional
       branches that attempt to cross between sections into unconditional
       branches or indirect jumps.
  
*************** Here are several miscellaneous parameter
*** 37630,37640 ****
       elements of a jump-table should have.
  
   -- Macro: CASE_VECTOR_SHORTEN_MODE (MIN_OFFSET, MAX_OFFSET, BODY)
!      Optional: return the preferred mode for an `addr_diff_vec' when
!      the minimum and maximum offset are known.  If you define this, it
       enables extra code in branch shortening to deal with
!      `addr_diff_vec'.  To make this work, you also have to define
!      `INSN_ALIGN' and make the alignment for `addr_diff_vec' explicit.
       The BODY argument is provided so that the offset_unsigned and scale
       flags can be updated.
  
--- 37209,37219 ----
       elements of a jump-table should have.
  
   -- Macro: CASE_VECTOR_SHORTEN_MODE (MIN_OFFSET, MAX_OFFSET, BODY)
!      Optional: return the preferred mode for an 'addr_diff_vec' when the
!      minimum and maximum offset are known.  If you define this, it
       enables extra code in branch shortening to deal with
!      'addr_diff_vec'.  To make this work, you also have to define
!      'INSN_ALIGN' and make the alignment for 'addr_diff_vec' explicit.
       The BODY argument is provided so that the offset_unsigned and scale
       flags can be updated.
  
*************** Here are several miscellaneous parameter
*** 37642,37655 ****
       Define this macro to be a C expression to indicate when jump-tables
       should contain relative addresses.  You need not define this macro
       if jump-tables never contain relative addresses, or jump-tables
!      should contain relative addresses only when `-fPIC' or `-fPIC' is
       in effect.
  
   -- Target Hook: unsigned int TARGET_CASE_VALUES_THRESHOLD (void)
       This function return the smallest number of different values for
       which it is best to use a jump-table instead of a tree of
       conditional branches.  The default is four for machines with a
!      `casesi' instruction and five otherwise.  This is best for most
       machines.
  
   -- Macro: WORD_REGISTER_OPERATIONS
--- 37221,37234 ----
       Define this macro to be a C expression to indicate when jump-tables
       should contain relative addresses.  You need not define this macro
       if jump-tables never contain relative addresses, or jump-tables
!      should contain relative addresses only when '-fPIC' or '-fPIC' is
       in effect.
  
   -- Target Hook: unsigned int TARGET_CASE_VALUES_THRESHOLD (void)
       This function return the smallest number of different values for
       which it is best to use a jump-table instead of a tree of
       conditional branches.  The default is four for machines with a
!      'casesi' instruction and five otherwise.  This is best for most
       machines.
  
   -- Macro: WORD_REGISTER_OPERATIONS
*************** Here are several miscellaneous parameter
*** 37660,37689 ****
  
   -- Macro: LOAD_EXTEND_OP (MEM_MODE)
       Define this macro to be a C expression indicating when insns that
!      read memory in MEM_MODE, an integral mode narrower than a word,
!      set the bits outside of MEM_MODE to be either the sign-extension
!      or the zero-extension of the data read.  Return `SIGN_EXTEND' for
!      values of MEM_MODE for which the insn sign-extends, `ZERO_EXTEND'
!      for which it zero-extends, and `UNKNOWN' for other modes.
  
       This macro is not called with MEM_MODE non-integral or with a width
!      greater than or equal to `BITS_PER_WORD', so you may return any
       value in this case.  Do not define this macro if it would always
!      return `UNKNOWN'.  On machines where this macro is defined, you
!      will normally define it as the constant `SIGN_EXTEND' or
!      `ZERO_EXTEND'.
  
!      You may return a non-`UNKNOWN' value even if for some hard
       registers the sign extension is not performed, if for the
!      `REGNO_REG_CLASS' of these hard registers
!      `CANNOT_CHANGE_MODE_CLASS' returns nonzero when the FROM mode is
       MEM_MODE and the TO mode is any integral mode larger than this but
!      not larger than `word_mode'.
  
!      You must return `UNKNOWN' if for some hard registers that allow
!      this mode, `CANNOT_CHANGE_MODE_CLASS' says that they cannot change
!      to `word_mode', but that they can change to another integral mode
!      that is larger then MEM_MODE but still smaller than `word_mode'.
  
   -- Macro: SHORT_IMMEDIATES_SIGN_EXTEND
       Define this macro if loading short immediate values into registers
--- 37239,37268 ----
  
   -- Macro: LOAD_EXTEND_OP (MEM_MODE)
       Define this macro to be a C expression indicating when insns that
!      read memory in MEM_MODE, an integral mode narrower than a word, set
!      the bits outside of MEM_MODE to be either the sign-extension or the
!      zero-extension of the data read.  Return 'SIGN_EXTEND' for values
!      of MEM_MODE for which the insn sign-extends, 'ZERO_EXTEND' for
!      which it zero-extends, and 'UNKNOWN' for other modes.
  
       This macro is not called with MEM_MODE non-integral or with a width
!      greater than or equal to 'BITS_PER_WORD', so you may return any
       value in this case.  Do not define this macro if it would always
!      return 'UNKNOWN'.  On machines where this macro is defined, you
!      will normally define it as the constant 'SIGN_EXTEND' or
!      'ZERO_EXTEND'.
  
!      You may return a non-'UNKNOWN' value even if for some hard
       registers the sign extension is not performed, if for the
!      'REGNO_REG_CLASS' of these hard registers
!      'CANNOT_CHANGE_MODE_CLASS' returns nonzero when the FROM mode is
       MEM_MODE and the TO mode is any integral mode larger than this but
!      not larger than 'word_mode'.
  
!      You must return 'UNKNOWN' if for some hard registers that allow
!      this mode, 'CANNOT_CHANGE_MODE_CLASS' says that they cannot change
!      to 'word_mode', but that they can change to another integral mode
!      that is larger then MEM_MODE but still smaller than 'word_mode'.
  
   -- Macro: SHORT_IMMEDIATES_SIGN_EXTEND
       Define this macro if loading short immediate values into registers
*************** Here are several miscellaneous parameter
*** 37691,37698 ****
  
   -- Target Hook: unsigned int TARGET_MIN_DIVISIONS_FOR_RECIP_MUL
            (machine_mode MODE)
!      When `-ffast-math' is in effect, GCC tries to optimize divisions
!      by the same divisor, by turning them into multiplications by the
       reciprocal.  This target hook specifies the minimum number of
       divisions that should be there for GCC to perform the optimization
       for a variable of mode MODE.  The default implementation returns 3
--- 37270,37277 ----
  
   -- Target Hook: unsigned int TARGET_MIN_DIVISIONS_FOR_RECIP_MUL
            (machine_mode MODE)
!      When '-ffast-math' is in effect, GCC tries to optimize divisions by
!      the same divisor, by turning them into multiplications by the
       reciprocal.  This target hook specifies the minimum number of
       divisions that should be there for GCC to perform the optimization
       for a variable of mode MODE.  The default implementation returns 3
*************** Here are several miscellaneous parameter
*** 37707,37728 ****
   -- Macro: MAX_MOVE_MAX
       The maximum number of bytes that a single instruction can move
       quickly between memory and registers or between two memory
!      locations.  If this is undefined, the default is `MOVE_MAX'.
       Otherwise, it is the constant value that is the largest value that
!      `MOVE_MAX' can have at run-time.
  
   -- Macro: SHIFT_COUNT_TRUNCATED
       A C expression that is nonzero if on this machine the number of
       bits actually used for the count of a shift operation is equal to
!      the number of bits needed to represent the size of the object
!      being shifted.  When this macro is nonzero, the compiler will
!      assume that it is safe to omit a sign-extend, zero-extend, and
!      certain bitwise `and' instructions that truncates the count of a
!      shift operation.  On machines that have instructions that act on
!      bit-fields at variable positions, which may include `bit test'
!      instructions, a nonzero `SHIFT_COUNT_TRUNCATED' also enables
!      deletion of truncations of the values that serve as arguments to
!      bit-field instructions.
  
       If both types of instructions truncate the count (for shifts) and
       position (for bit-field operations), or if no variable-position
--- 37286,37307 ----
   -- Macro: MAX_MOVE_MAX
       The maximum number of bytes that a single instruction can move
       quickly between memory and registers or between two memory
!      locations.  If this is undefined, the default is 'MOVE_MAX'.
       Otherwise, it is the constant value that is the largest value that
!      'MOVE_MAX' can have at run-time.
  
   -- Macro: SHIFT_COUNT_TRUNCATED
       A C expression that is nonzero if on this machine the number of
       bits actually used for the count of a shift operation is equal to
!      the number of bits needed to represent the size of the object being
!      shifted.  When this macro is nonzero, the compiler will assume that
!      it is safe to omit a sign-extend, zero-extend, and certain bitwise
!      'and' instructions that truncates the count of a shift operation.
!      On machines that have instructions that act on bit-fields at
!      variable positions, which may include 'bit test' instructions, a
!      nonzero 'SHIFT_COUNT_TRUNCATED' also enables deletion of
!      truncations of the values that serve as arguments to bit-field
!      instructions.
  
       If both types of instructions truncate the count (for shifts) and
       position (for bit-field operations), or if no variable-position
*************** Here are several miscellaneous parameter
*** 37730,37741 ****
  
       However, on some machines, such as the 80386 and the 680x0,
       truncation only applies to shift operations and not the (real or
!      pretended) bit-field operations.  Define `SHIFT_COUNT_TRUNCATED'
!      to be zero on such machines.  Instead, add patterns to the `md'
!      file that include the implied truncation of the shift instructions.
  
!      You need not define this macro if it would always have the value
!      of zero.
  
   -- Target Hook: unsigned HOST_WIDE_INT TARGET_SHIFT_TRUNCATION_MASK
            (machine_mode MODE)
--- 37309,37320 ----
  
       However, on some machines, such as the 80386 and the 680x0,
       truncation only applies to shift operations and not the (real or
!      pretended) bit-field operations.  Define 'SHIFT_COUNT_TRUNCATED' to
!      be zero on such machines.  Instead, add patterns to the 'md' file
!      that include the implied truncation of the shift instructions.
  
!      You need not define this macro if it would always have the value of
!      zero.
  
   -- Target Hook: unsigned HOST_WIDE_INT TARGET_SHIFT_TRUNCATION_MASK
            (machine_mode MODE)
*************** Here are several miscellaneous parameter
*** 37750,37763 ****
       should return 0.  A return value of 0 indicates that no particular
       behavior is guaranteed.
  
!      Note that, unlike `SHIFT_COUNT_TRUNCATED', this function does
!      _not_ apply to general shift rtxes; it applies only to instructions
!      that are generated by the named shift patterns.
  
       The default implementation of this function returns
!      `GET_MODE_BITSIZE (MODE) - 1' if `SHIFT_COUNT_TRUNCATED' and 0
       otherwise.  This definition is always safe, but if
!      `SHIFT_COUNT_TRUNCATED' is false, and some shift patterns
       nevertheless truncate the shift count, you may get better code by
       overriding it.
  
--- 37329,37342 ----
       should return 0.  A return value of 0 indicates that no particular
       behavior is guaranteed.
  
!      Note that, unlike 'SHIFT_COUNT_TRUNCATED', this function does _not_
!      apply to general shift rtxes; it applies only to instructions that
!      are generated by the named shift patterns.
  
       The default implementation of this function returns
!      'GET_MODE_BITSIZE (MODE) - 1' if 'SHIFT_COUNT_TRUNCATED' and 0
       otherwise.  This definition is always safe, but if
!      'SHIFT_COUNT_TRUNCATED' is false, and some shift patterns
       nevertheless truncate the shift count, you may get better code by
       overriding it.
  
*************** Here are several miscellaneous parameter
*** 37769,37811 ****
  
       On many machines, this expression can be 1.
  
!      When `TRULY_NOOP_TRUNCATION' returns 1 for a pair of sizes for
!      modes for which `MODES_TIEABLE_P' is 0, suboptimal code can result.
!      If this is the case, making `TRULY_NOOP_TRUNCATION' return 0 in
       such cases may improve things.
  
   -- Target Hook: int TARGET_MODE_REP_EXTENDED (machine_mode MODE,
            machine_mode REP_MODE)
       The representation of an integral mode can be such that the values
!      are always extended to a wider integral mode.  Return
!      `SIGN_EXTEND' if values of MODE are represented in sign-extended
!      form to REP_MODE.  Return `UNKNOWN' otherwise.  (Currently, none
!      of the targets use zero-extended representation this way so unlike
!      `LOAD_EXTEND_OP', `TARGET_MODE_REP_EXTENDED' is expected to return
!      either `SIGN_EXTEND' or `UNKNOWN'.  Also no target extends MODE to
       REP_MODE so that REP_MODE is not the next widest integral mode and
       currently we take advantage of this fact.)
  
!      Similarly to `LOAD_EXTEND_OP' you may return a non-`UNKNOWN' value
!      even if the extension is not performed on certain hard registers
!      as long as for the `REGNO_REG_CLASS' of these hard registers
!      `CANNOT_CHANGE_MODE_CLASS' returns nonzero.
  
!      Note that `TARGET_MODE_REP_EXTENDED' and `LOAD_EXTEND_OP' describe
!      two related properties.  If you define `TARGET_MODE_REP_EXTENDED
!      (mode, word_mode)' you probably also want to define
!      `LOAD_EXTEND_OP (mode)' to return the same type of extension.
  
!      In order to enforce the representation of `mode',
!      `TRULY_NOOP_TRUNCATION' should return false when truncating to
!      `mode'.
  
   -- Macro: STORE_FLAG_VALUE
       A C expression describing the value returned by a comparison
       operator with an integral mode and stored by a store-flag
!      instruction (`cstoreMODE4') when the condition is true.  This
!      description must apply to _all_ the `cstoreMODE4' patterns and all
!      the comparison operators whose results have a `MODE_INT' mode.
  
       A value of 1 or -1 means that the instruction implementing the
       comparison operator returns exactly 1 or -1 when the comparison is
--- 37348,37390 ----
  
       On many machines, this expression can be 1.
  
!      When 'TRULY_NOOP_TRUNCATION' returns 1 for a pair of sizes for
!      modes for which 'MODES_TIEABLE_P' is 0, suboptimal code can result.
!      If this is the case, making 'TRULY_NOOP_TRUNCATION' return 0 in
       such cases may improve things.
  
   -- Target Hook: int TARGET_MODE_REP_EXTENDED (machine_mode MODE,
            machine_mode REP_MODE)
       The representation of an integral mode can be such that the values
!      are always extended to a wider integral mode.  Return 'SIGN_EXTEND'
!      if values of MODE are represented in sign-extended form to
!      REP_MODE.  Return 'UNKNOWN' otherwise.  (Currently, none of the
!      targets use zero-extended representation this way so unlike
!      'LOAD_EXTEND_OP', 'TARGET_MODE_REP_EXTENDED' is expected to return
!      either 'SIGN_EXTEND' or 'UNKNOWN'.  Also no target extends MODE to
       REP_MODE so that REP_MODE is not the next widest integral mode and
       currently we take advantage of this fact.)
  
!      Similarly to 'LOAD_EXTEND_OP' you may return a non-'UNKNOWN' value
!      even if the extension is not performed on certain hard registers as
!      long as for the 'REGNO_REG_CLASS' of these hard registers
!      'CANNOT_CHANGE_MODE_CLASS' returns nonzero.
  
!      Note that 'TARGET_MODE_REP_EXTENDED' and 'LOAD_EXTEND_OP' describe
!      two related properties.  If you define 'TARGET_MODE_REP_EXTENDED
!      (mode, word_mode)' you probably also want to define 'LOAD_EXTEND_OP
!      (mode)' to return the same type of extension.
  
!      In order to enforce the representation of 'mode',
!      'TRULY_NOOP_TRUNCATION' should return false when truncating to
!      'mode'.
  
   -- Macro: STORE_FLAG_VALUE
       A C expression describing the value returned by a comparison
       operator with an integral mode and stored by a store-flag
!      instruction ('cstoreMODE4') when the condition is true.  This
!      description must apply to _all_ the 'cstoreMODE4' patterns and all
!      the comparison operators whose results have a 'MODE_INT' mode.
  
       A value of 1 or -1 means that the instruction implementing the
       comparison operator returns exactly 1 or -1 when the comparison is
*************** Here are several miscellaneous parameter
*** 37813,37829 ****
       indicates which bits of the result are guaranteed to be 1 when the
       comparison is true.  This value is interpreted in the mode of the
       comparison operation, which is given by the mode of the first
!      operand in the `cstoreMODE4' pattern.  Either the low bit or the
!      sign bit of `STORE_FLAG_VALUE' be on.  Presently, only those bits
       are used by the compiler.
  
!      If `STORE_FLAG_VALUE' is neither 1 or -1, the compiler will
       generate code that depends only on the specified bits.  It can also
       replace comparison operators with equivalent operations if they
       cause the required bits to be set, even if the remaining bits are
       undefined.  For example, on a machine whose comparison operators
!      return an `SImode' value and where `STORE_FLAG_VALUE' is defined as
!      `0x80000000', saying that just the sign bit is relevant, the
       expression
  
            (ne:SI (and:SI X (const_int POWER-OF-2)) (const_int 0))
--- 37392,37408 ----
       indicates which bits of the result are guaranteed to be 1 when the
       comparison is true.  This value is interpreted in the mode of the
       comparison operation, which is given by the mode of the first
!      operand in the 'cstoreMODE4' pattern.  Either the low bit or the
!      sign bit of 'STORE_FLAG_VALUE' be on.  Presently, only those bits
       are used by the compiler.
  
!      If 'STORE_FLAG_VALUE' is neither 1 or -1, the compiler will
       generate code that depends only on the specified bits.  It can also
       replace comparison operators with equivalent operations if they
       cause the required bits to be set, even if the remaining bits are
       undefined.  For example, on a machine whose comparison operators
!      return an 'SImode' value and where 'STORE_FLAG_VALUE' is defined as
!      '0x80000000', saying that just the sign bit is relevant, the
       expression
  
            (ne:SI (and:SI X (const_int POWER-OF-2)) (const_int 0))
*************** Here are several miscellaneous parameter
*** 37832,37855 ****
  
            (ashift:SI X (const_int N))
  
!      where N is the appropriate shift count to move the bit being
!      tested into the sign bit.
  
       There is no way to describe a machine that always sets the
!      low-order bit for a true value, but does not guarantee the value
!      of any other bits, but we do not know of any machine that has such
!      an instruction.  If you are trying to port GCC to such a machine,
       include an instruction to perform a logical-and of the result with
       1 in the pattern for the comparison operators and let us know at
       <gcc@gcc.gnu.org>.
  
       Often, a machine will have multiple instructions that obtain a
       value from a comparison (or the condition codes).  Here are rules
!      to guide the choice of value for `STORE_FLAG_VALUE', and hence the
       instructions to be used:
  
          * Use the shortest sequence that yields a valid definition for
!           `STORE_FLAG_VALUE'.  It is more efficient for the compiler to
            "normalize" the value (convert it to, e.g., 1 or 0) than for
            the comparison operators to do so because there may be
            opportunities to combine the normalization with other
--- 37411,37434 ----
  
            (ashift:SI X (const_int N))
  
!      where N is the appropriate shift count to move the bit being tested
!      into the sign bit.
  
       There is no way to describe a machine that always sets the
!      low-order bit for a true value, but does not guarantee the value of
!      any other bits, but we do not know of any machine that has such an
!      instruction.  If you are trying to port GCC to such a machine,
       include an instruction to perform a logical-and of the result with
       1 in the pattern for the comparison operators and let us know at
       <gcc@gcc.gnu.org>.
  
       Often, a machine will have multiple instructions that obtain a
       value from a comparison (or the condition codes).  Here are rules
!      to guide the choice of value for 'STORE_FLAG_VALUE', and hence the
       instructions to be used:
  
          * Use the shortest sequence that yields a valid definition for
!           'STORE_FLAG_VALUE'.  It is more efficient for the compiler to
            "normalize" the value (convert it to, e.g., 1 or 0) than for
            the comparison operators to do so because there may be
            opportunities to combine the normalization with other
*************** Here are several miscellaneous parameter
*** 37859,37929 ****
            being slightly preferred on machines with expensive jumps and
            1 preferred on other machines.
  
!         * As a second choice, choose a value of `0x80000001' if
            instructions exist that set both the sign and low-order bits
            but do not define the others.
  
!         * Otherwise, use a value of `0x80000000'.
  
       Many machines can produce both the value chosen for
!      `STORE_FLAG_VALUE' and its negation in the same number of
       instructions.  On those machines, you should also define a pattern
       for those cases, e.g., one matching
  
            (set A (neg:M (ne:M B C)))
  
!      Some machines can also perform `and' or `plus' operations on
       condition code values with less instructions than the corresponding
!      `cstoreMODE4' insn followed by `and' or `plus'.  On those
!      machines, define the appropriate patterns.  Use the names `incscc'
!      and `decscc', respectively, for the patterns which perform `plus'
!      or `minus' operations on condition code values.  See `rs6000.md'
!      for some examples.  The GNU Superoptimizer can be used to find
!      such instruction sequences on other machines.
  
       If this macro is not defined, the default value, 1, is used.  You
!      need not define `STORE_FLAG_VALUE' if the machine has no store-flag
       instructions, or if the value generated by these instructions is 1.
  
   -- Macro: FLOAT_STORE_FLAG_VALUE (MODE)
!      A C expression that gives a nonzero `REAL_VALUE_TYPE' value that is
       returned when comparison operators with floating-point results are
       true.  Define this macro on machines that have comparison
!      operations that return floating-point values.  If there are no
!      such operations, do not define this macro.
  
   -- Macro: VECTOR_STORE_FLAG_VALUE (MODE)
       A C expression that gives a rtx representing the nonzero true
       element for vector comparisons.  The returned rtx should be valid
!      for the inner mode of MODE which is guaranteed to be a vector
!      mode.  Define this macro on machines that have vector comparison
       operations that return a vector result.  If there are no such
       operations, do not define this macro.  Typically, this macro is
!      defined as `const1_rtx' or `constm1_rtx'.  This macro may return
!      `NULL_RTX' to prevent the compiler optimizing such vector
       comparison operations for the given mode.
  
   -- Macro: CLZ_DEFINED_VALUE_AT_ZERO (MODE, VALUE)
   -- Macro: CTZ_DEFINED_VALUE_AT_ZERO (MODE, VALUE)
       A C expression that indicates whether the architecture defines a
!      value for `clz' or `ctz' with a zero operand.  A result of `0'
!      indicates the value is undefined.  If the value is defined for
!      only the RTL expression, the macro should evaluate to `1'; if the
!      value applies also to the corresponding optab entry (which is
!      normally the case if it expands directly into the corresponding
!      RTL), then the macro should evaluate to `2'.  In the cases where
!      the value is defined, VALUE should be set to this value.
  
!      If this macro is not defined, the value of `clz' or `ctz' at zero
       is assumed to be undefined.
  
!      This macro must be defined if the target's expansion for `ffs'
       relies on a particular value to get correct results.  Otherwise it
       is not necessary, though it may be used to optimize some corner
!      cases, and to provide a default expansion for the `ffs' optab.
  
!      Note that regardless of this macro the "definedness" of `clz' and
!      `ctz' at zero do _not_ extend to the builtin functions visible to
       the user.  Thus one may be free to adjust the value at will to
       match the target expansion of these operations without fear of
       breaking the API.
--- 37438,37508 ----
            being slightly preferred on machines with expensive jumps and
            1 preferred on other machines.
  
!         * As a second choice, choose a value of '0x80000001' if
            instructions exist that set both the sign and low-order bits
            but do not define the others.
  
!         * Otherwise, use a value of '0x80000000'.
  
       Many machines can produce both the value chosen for
!      'STORE_FLAG_VALUE' and its negation in the same number of
       instructions.  On those machines, you should also define a pattern
       for those cases, e.g., one matching
  
            (set A (neg:M (ne:M B C)))
  
!      Some machines can also perform 'and' or 'plus' operations on
       condition code values with less instructions than the corresponding
!      'cstoreMODE4' insn followed by 'and' or 'plus'.  On those machines,
!      define the appropriate patterns.  Use the names 'incscc' and
!      'decscc', respectively, for the patterns which perform 'plus' or
!      'minus' operations on condition code values.  See 'rs6000.md' for
!      some examples.  The GNU Superoptimizer can be used to find such
!      instruction sequences on other machines.
  
       If this macro is not defined, the default value, 1, is used.  You
!      need not define 'STORE_FLAG_VALUE' if the machine has no store-flag
       instructions, or if the value generated by these instructions is 1.
  
   -- Macro: FLOAT_STORE_FLAG_VALUE (MODE)
!      A C expression that gives a nonzero 'REAL_VALUE_TYPE' value that is
       returned when comparison operators with floating-point results are
       true.  Define this macro on machines that have comparison
!      operations that return floating-point values.  If there are no such
!      operations, do not define this macro.
  
   -- Macro: VECTOR_STORE_FLAG_VALUE (MODE)
       A C expression that gives a rtx representing the nonzero true
       element for vector comparisons.  The returned rtx should be valid
!      for the inner mode of MODE which is guaranteed to be a vector mode.
!      Define this macro on machines that have vector comparison
       operations that return a vector result.  If there are no such
       operations, do not define this macro.  Typically, this macro is
!      defined as 'const1_rtx' or 'constm1_rtx'.  This macro may return
!      'NULL_RTX' to prevent the compiler optimizing such vector
       comparison operations for the given mode.
  
   -- Macro: CLZ_DEFINED_VALUE_AT_ZERO (MODE, VALUE)
   -- Macro: CTZ_DEFINED_VALUE_AT_ZERO (MODE, VALUE)
       A C expression that indicates whether the architecture defines a
!      value for 'clz' or 'ctz' with a zero operand.  A result of '0'
!      indicates the value is undefined.  If the value is defined for only
!      the RTL expression, the macro should evaluate to '1'; if the value
!      applies also to the corresponding optab entry (which is normally
!      the case if it expands directly into the corresponding RTL), then
!      the macro should evaluate to '2'.  In the cases where the value is
!      defined, VALUE should be set to this value.
  
!      If this macro is not defined, the value of 'clz' or 'ctz' at zero
       is assumed to be undefined.
  
!      This macro must be defined if the target's expansion for 'ffs'
       relies on a particular value to get correct results.  Otherwise it
       is not necessary, though it may be used to optimize some corner
!      cases, and to provide a default expansion for the 'ffs' optab.
  
!      Note that regardless of this macro the "definedness" of 'clz' and
!      'ctz' at zero do _not_ extend to the builtin functions visible to
       the user.  Thus one may be free to adjust the value at will to
       match the target expansion of these operations without fear of
       breaking the API.
*************** Here are several miscellaneous parameter
*** 37931,38070 ****
   -- Macro: Pmode
       An alias for the machine mode for pointers.  On most machines,
       define this to be the integer mode corresponding to the width of a
!      hardware pointer; `SImode' on 32-bit machine or `DImode' on 64-bit
       machines.  On some machines you must define this to be one of the
!      partial integer modes, such as `PSImode'.
  
!      The width of `Pmode' must be at least as large as the value of
!      `POINTER_SIZE'.  If it is not equal, you must define the macro
!      `POINTERS_EXTEND_UNSIGNED' to specify how pointers are extended to
!      `Pmode'.
  
   -- Macro: FUNCTION_MODE
       An alias for the machine mode used for memory references to
!      functions being called, in `call' RTL expressions.  On most CISC
       machines, where an instruction can begin at any byte address, this
!      should be `QImode'.  On most RISC machines, where all instructions
       have fixed size and alignment, this should be a mode with the same
       size and alignment as the machine instruction words - typically
!      `SImode' or `HImode'.
  
   -- Macro: STDC_0_IN_SYSTEM_HEADERS
!      In normal operation, the preprocessor expands `__STDC__' to the
       constant 1, to signify that GCC conforms to ISO Standard C.  On
       some hosts, like Solaris, the system compiler uses a different
!      convention, where `__STDC__' is normally 0, but is 1 if the user
       specifies strict conformance to the C Standard.
  
!      Defining `STDC_0_IN_SYSTEM_HEADERS' makes GNU CPP follows the host
!      convention when processing system header files, but when
!      processing user files `__STDC__' will always expand to 1.
  
   -- C Target Hook: const char * TARGET_C_PREINCLUDE (void)
!      Define this hook to return the name of a header file to be
!      included at the start of all compilations, as if it had been
!      included with `#include <FILE>'.  If this hook returns `NULL', or
!      is not defined, or the header is not found, or if the user
!      specifies `-ffreestanding' or `-nostdinc', no header is included.
  
!      This hook can be used together with a header provided by the
!      system C library to implement ISO C requirements for certain
!      macros to be predefined that describe properties of the whole
!      implementation rather than just the compiler.
  
   -- C Target Hook: bool TARGET_CXX_IMPLICIT_EXTERN_C (const char*)
       Define this hook to add target-specific C++ implicit extern C
!      functions. If this function returns true for the name of a
       file-scope function, that function implicitly gets extern "C"
!      linkage rather than whatever language linkage the declaration
!      would normally have.  An example of such function is WinMain on
!      Win32 targets.
  
   -- Macro: NO_IMPLICIT_EXTERN_C
!      Define this macro if the system header files support C++ as well
!      as C.  This macro inhibits the usual method of using system header
       files in C++, which is to pretend that the file's contents are
!      enclosed in `extern "C" {...}'.
  
   -- Macro: REGISTER_TARGET_PRAGMAS ()
       Define this macro if you want to implement any target-specific
       pragmas.  If defined, it is a C expression which makes a series of
!      calls to `c_register_pragma' or `c_register_pragma_with_expansion'
       for each pragma.  The macro may also do any setup required for the
       pragmas.
  
!      The primary reason to define this macro is to provide
!      compatibility with other compilers for the same target.  In
!      general, we discourage definition of target-specific pragmas for
!      GCC.
  
       If the pragma can be implemented by attributes then you should
!      consider defining the target hook `TARGET_INSERT_ATTRIBUTES' as
       well.
  
       Preprocessor macros that appear on pragma lines are not expanded.
!      All `#pragma' directives that do not match any registered pragma
       are silently ignored, unless the user specifies
!      `-Wunknown-pragmas'.
  
   -- Function: void c_register_pragma (const char *SPACE, const char
            *NAME, void (*CALLBACK) (struct cpp_reader *))
   -- Function: void c_register_pragma_with_expansion (const char *SPACE,
            const char *NAME, void (*CALLBACK) (struct cpp_reader *))
!      Each call to `c_register_pragma' or
!      `c_register_pragma_with_expansion' establishes one pragma.  The
       CALLBACK routine will be called when the preprocessor encounters a
       pragma of the form
  
            #pragma [SPACE] NAME ...
  
!      SPACE is the case-sensitive namespace of the pragma, or `NULL' to
       put the pragma in the global namespace.  The callback routine
       receives PFILE as its first argument, which can be passed on to
!      cpplib's functions if necessary.  You can lex tokens after the
!      NAME by calling `pragma_lex'.  Tokens that are not read by the
!      callback will be silently ignored.  The end of the line is
!      indicated by a token of type `CPP_EOF'.  Macro expansion occurs on
!      the arguments of pragmas registered with
!      `c_register_pragma_with_expansion' but not on the arguments of
!      pragmas registered with `c_register_pragma'.
  
!      Note that the use of `pragma_lex' is specific to the C and C++
       compilers.  It will not work in the Java or Fortran compilers, or
!      any other language compilers for that matter.  Thus if
!      `pragma_lex' is going to be called from target-specific code, it
!      must only be done so when building the C and C++ compilers.  This
!      can be done by defining the variables `c_target_objs' and
!      `cxx_target_objs' in the target entry in the `config.gcc' file.
!      These variables should name the target-specific, language-specific
!      object file which contains the code that uses `pragma_lex'.  Note
!      it will also be necessary to add a rule to the makefile fragment
!      pointed to by `tmake_file' that shows how to build this object
!      file.
  
   -- Macro: HANDLE_PRAGMA_PACK_WITH_EXPANSION
       Define this macro if macros should be expanded in the arguments of
!      `#pragma pack'.
  
   -- Macro: TARGET_DEFAULT_PACK_STRUCT
       If your target requires a structure packing default other than 0
       (meaning the machine default), define this macro to the necessary
!      value (in bytes).  This must be a value that would also be valid
!      to use with `#pragma pack()' (that is, a small power of two).
  
   -- Macro: DOLLARS_IN_IDENTIFIERS
!      Define this macro to control use of the character `$' in
!      identifier names for the C family of languages.  0 means `$' is
!      not allowed by default; 1 means it is allowed.  1 is the default;
!      there is no need to define this macro in that case.
  
   -- Macro: INSN_SETS_ARE_DELAYED (INSN)
       Define this macro as a C expression that is nonzero if it is safe
       for the delay slot scheduler to place instructions in the delay
       slot of INSN, even if they appear to use a resource set or
!      clobbered in INSN.  INSN is always a `jump_insn' or an `insn'; GCC
!      knows that every `call_insn' has this behavior.  On machines where
!      some `insn' or `jump_insn' is really a function call and hence has
       this behavior, you should define this macro.
  
       You need not define this macro if it would always return zero.
--- 37510,37648 ----
   -- Macro: Pmode
       An alias for the machine mode for pointers.  On most machines,
       define this to be the integer mode corresponding to the width of a
!      hardware pointer; 'SImode' on 32-bit machine or 'DImode' on 64-bit
       machines.  On some machines you must define this to be one of the
!      partial integer modes, such as 'PSImode'.
  
!      The width of 'Pmode' must be at least as large as the value of
!      'POINTER_SIZE'.  If it is not equal, you must define the macro
!      'POINTERS_EXTEND_UNSIGNED' to specify how pointers are extended to
!      'Pmode'.
  
   -- Macro: FUNCTION_MODE
       An alias for the machine mode used for memory references to
!      functions being called, in 'call' RTL expressions.  On most CISC
       machines, where an instruction can begin at any byte address, this
!      should be 'QImode'.  On most RISC machines, where all instructions
       have fixed size and alignment, this should be a mode with the same
       size and alignment as the machine instruction words - typically
!      'SImode' or 'HImode'.
  
   -- Macro: STDC_0_IN_SYSTEM_HEADERS
!      In normal operation, the preprocessor expands '__STDC__' to the
       constant 1, to signify that GCC conforms to ISO Standard C.  On
       some hosts, like Solaris, the system compiler uses a different
!      convention, where '__STDC__' is normally 0, but is 1 if the user
       specifies strict conformance to the C Standard.
  
!      Defining 'STDC_0_IN_SYSTEM_HEADERS' makes GNU CPP follows the host
!      convention when processing system header files, but when processing
!      user files '__STDC__' will always expand to 1.
  
   -- C Target Hook: const char * TARGET_C_PREINCLUDE (void)
!      Define this hook to return the name of a header file to be included
!      at the start of all compilations, as if it had been included with
!      '#include <FILE>'.  If this hook returns 'NULL', or is not defined,
!      or the header is not found, or if the user specifies
!      '-ffreestanding' or '-nostdinc', no header is included.
  
!      This hook can be used together with a header provided by the system
!      C library to implement ISO C requirements for certain macros to be
!      predefined that describe properties of the whole implementation
!      rather than just the compiler.
  
   -- C Target Hook: bool TARGET_CXX_IMPLICIT_EXTERN_C (const char*)
       Define this hook to add target-specific C++ implicit extern C
!      functions.  If this function returns true for the name of a
       file-scope function, that function implicitly gets extern "C"
!      linkage rather than whatever language linkage the declaration would
!      normally have.  An example of such function is WinMain on Win32
!      targets.
  
   -- Macro: NO_IMPLICIT_EXTERN_C
!      Define this macro if the system header files support C++ as well as
!      C.  This macro inhibits the usual method of using system header
       files in C++, which is to pretend that the file's contents are
!      enclosed in 'extern "C" {...}'.
  
   -- Macro: REGISTER_TARGET_PRAGMAS ()
       Define this macro if you want to implement any target-specific
       pragmas.  If defined, it is a C expression which makes a series of
!      calls to 'c_register_pragma' or 'c_register_pragma_with_expansion'
       for each pragma.  The macro may also do any setup required for the
       pragmas.
  
!      The primary reason to define this macro is to provide compatibility
!      with other compilers for the same target.  In general, we
!      discourage definition of target-specific pragmas for GCC.
  
       If the pragma can be implemented by attributes then you should
!      consider defining the target hook 'TARGET_INSERT_ATTRIBUTES' as
       well.
  
       Preprocessor macros that appear on pragma lines are not expanded.
!      All '#pragma' directives that do not match any registered pragma
       are silently ignored, unless the user specifies
!      '-Wunknown-pragmas'.
  
   -- Function: void c_register_pragma (const char *SPACE, const char
            *NAME, void (*CALLBACK) (struct cpp_reader *))
   -- Function: void c_register_pragma_with_expansion (const char *SPACE,
            const char *NAME, void (*CALLBACK) (struct cpp_reader *))
! 
!      Each call to 'c_register_pragma' or
!      'c_register_pragma_with_expansion' establishes one pragma.  The
       CALLBACK routine will be called when the preprocessor encounters a
       pragma of the form
  
            #pragma [SPACE] NAME ...
  
!      SPACE is the case-sensitive namespace of the pragma, or 'NULL' to
       put the pragma in the global namespace.  The callback routine
       receives PFILE as its first argument, which can be passed on to
!      cpplib's functions if necessary.  You can lex tokens after the NAME
!      by calling 'pragma_lex'.  Tokens that are not read by the callback
!      will be silently ignored.  The end of the line is indicated by a
!      token of type 'CPP_EOF'.  Macro expansion occurs on the arguments
!      of pragmas registered with 'c_register_pragma_with_expansion' but
!      not on the arguments of pragmas registered with
!      'c_register_pragma'.
  
!      Note that the use of 'pragma_lex' is specific to the C and C++
       compilers.  It will not work in the Java or Fortran compilers, or
!      any other language compilers for that matter.  Thus if 'pragma_lex'
!      is going to be called from target-specific code, it must only be
!      done so when building the C and C++ compilers.  This can be done by
!      defining the variables 'c_target_objs' and 'cxx_target_objs' in the
!      target entry in the 'config.gcc' file.  These variables should name
!      the target-specific, language-specific object file which contains
!      the code that uses 'pragma_lex'.  Note it will also be necessary to
!      add a rule to the makefile fragment pointed to by 'tmake_file' that
!      shows how to build this object file.
  
   -- Macro: HANDLE_PRAGMA_PACK_WITH_EXPANSION
       Define this macro if macros should be expanded in the arguments of
!      '#pragma pack'.
  
   -- Macro: TARGET_DEFAULT_PACK_STRUCT
       If your target requires a structure packing default other than 0
       (meaning the machine default), define this macro to the necessary
!      value (in bytes).  This must be a value that would also be valid to
!      use with '#pragma pack()' (that is, a small power of two).
  
   -- Macro: DOLLARS_IN_IDENTIFIERS
!      Define this macro to control use of the character '$' in identifier
!      names for the C family of languages.  0 means '$' is not allowed by
!      default; 1 means it is allowed.  1 is the default; there is no need
!      to define this macro in that case.
  
   -- Macro: INSN_SETS_ARE_DELAYED (INSN)
       Define this macro as a C expression that is nonzero if it is safe
       for the delay slot scheduler to place instructions in the delay
       slot of INSN, even if they appear to use a resource set or
!      clobbered in INSN.  INSN is always a 'jump_insn' or an 'insn'; GCC
!      knows that every 'call_insn' has this behavior.  On machines where
!      some 'insn' or 'jump_insn' is really a function call and hence has
       this behavior, you should define this macro.
  
       You need not define this macro if it would always return zero.
*************** Here are several miscellaneous parameter
*** 38073,38175 ****
       Define this macro as a C expression that is nonzero if it is safe
       for the delay slot scheduler to place instructions in the delay
       slot of INSN, even if they appear to set or clobber a resource
!      referenced in INSN.  INSN is always a `jump_insn' or an `insn'.
!      On machines where some `insn' or `jump_insn' is really a function
!      call and its operands are registers whose use is actually in the
!      subroutine it calls, you should define this macro.  Doing so
!      allows the delay slot scheduler to move instructions which copy
!      arguments into the argument registers into the delay slot of INSN.
  
       You need not define this macro if it would always return zero.
  
   -- Macro: MULTIPLE_SYMBOL_SPACES
       Define this macro as a C expression that is nonzero if, in some
!      cases, global symbols from one translation unit may not be bound
!      to undefined symbols in another translation unit without user
       intervention.  For instance, under Microsoft Windows symbols must
       be explicitly imported from shared libraries (DLLs).
  
       You need not define this macro if it would always evaluate to zero.
  
!  -- Target Hook: tree TARGET_MD_ASM_CLOBBERS (tree OUTPUTS, tree
!           INPUTS, tree CLOBBERS)
!      This target hook should add to CLOBBERS `STRING_CST' trees for any
       hard regs the port wishes to automatically clobber for an asm.  It
!      should return the result of the last `tree_cons' used to add a
       clobber.  The OUTPUTS, INPUTS and CLOBBER lists are the
       corresponding parameters to the asm and may be inspected to avoid
       clobbering a register that is an input or output of the asm.  You
!      can use `tree_overlaps_hard_reg_set', declared in `tree.h', to test
       for overlap with regards to asm-declared registers.
  
   -- Macro: MATH_LIBRARY
!      Define this macro as a C string constant for the linker argument
!      to link in the system math library, minus the initial `"-l"', or
!      `""' if the target does not have a separate math library.
  
!      You need only define this macro if the default of `"m"' is wrong.
  
   -- Macro: LIBRARY_PATH_ENV
       Define this macro as a C string constant for the environment
       variable that specifies where the linker should look for libraries.
  
!      You need only define this macro if the default of `"LIBRARY_PATH"'
       is wrong.
  
   -- Macro: TARGET_POSIX_IO
       Define this macro if the target supports the following POSIX file
!      functions, access, mkdir and  file locking with fcntl / F_SETLKW.
!      Defining `TARGET_POSIX_IO' will enable the test coverage code to
       use file locking when exiting a program, which avoids race
!      conditions if the program has forked. It will also create
       directories at run-time for cross-profiling.
  
   -- Macro: MAX_CONDITIONAL_EXECUTE
       A C expression for the maximum number of instructions to execute
       via conditional execution instructions instead of a branch.  A
!      value of `BRANCH_COST'+1 is the default if the machine does not
!      use cc0, and 1 if it does use cc0.
  
   -- Macro: IFCVT_MODIFY_TESTS (CE_INFO, TRUE_EXPR, FALSE_EXPR)
!      Used if the target needs to perform machine-dependent
!      modifications on the conditionals used for turning basic blocks
!      into conditionally executed code.  CE_INFO points to a data
!      structure, `struct ce_if_block', which contains information about
!      the currently processed blocks.  TRUE_EXPR and FALSE_EXPR are the
!      tests that are used for converting the then-block and the
!      else-block, respectively.  Set either TRUE_EXPR or FALSE_EXPR to a
!      null pointer if the tests cannot be converted.
  
   -- Macro: IFCVT_MODIFY_MULTIPLE_TESTS (CE_INFO, BB, TRUE_EXPR,
            FALSE_EXPR)
!      Like `IFCVT_MODIFY_TESTS', but used when converting more
!      complicated if-statements into conditions combined by `and' and
!      `or' operations.  BB contains the basic block that contains the
       test that is currently being processed and about to be turned into
       a condition.
  
   -- Macro: IFCVT_MODIFY_INSN (CE_INFO, PATTERN, INSN)
       A C expression to modify the PATTERN of an INSN that is to be
       converted to conditional execution format.  CE_INFO points to a
!      data structure, `struct ce_if_block', which contains information
       about the currently processed blocks.
  
   -- Macro: IFCVT_MODIFY_FINAL (CE_INFO)
!      A C expression to perform any final machine dependent
!      modifications in converting code to conditional execution.  The
!      involved basic blocks can be found in the `struct ce_if_block'
!      structure that is pointed to by CE_INFO.
  
   -- Macro: IFCVT_MODIFY_CANCEL (CE_INFO)
       A C expression to cancel any machine dependent modifications in
       converting code to conditional execution.  The involved basic
!      blocks can be found in the `struct ce_if_block' structure that is
       pointed to by CE_INFO.
  
   -- Macro: IFCVT_MACHDEP_INIT (CE_INFO)
       A C expression to initialize any machine specific data for
!      if-conversion of the if-block in the `struct ce_if_block'
!      structure that is pointed to by CE_INFO.
  
   -- Target Hook: void TARGET_MACHINE_DEPENDENT_REORG (void)
       If non-null, this hook performs a target-specific pass over the
--- 37651,37754 ----
       Define this macro as a C expression that is nonzero if it is safe
       for the delay slot scheduler to place instructions in the delay
       slot of INSN, even if they appear to set or clobber a resource
!      referenced in INSN.  INSN is always a 'jump_insn' or an 'insn'.  On
!      machines where some 'insn' or 'jump_insn' is really a function call
!      and its operands are registers whose use is actually in the
!      subroutine it calls, you should define this macro.  Doing so allows
!      the delay slot scheduler to move instructions which copy arguments
!      into the argument registers into the delay slot of INSN.
  
       You need not define this macro if it would always return zero.
  
   -- Macro: MULTIPLE_SYMBOL_SPACES
       Define this macro as a C expression that is nonzero if, in some
!      cases, global symbols from one translation unit may not be bound to
!      undefined symbols in another translation unit without user
       intervention.  For instance, under Microsoft Windows symbols must
       be explicitly imported from shared libraries (DLLs).
  
       You need not define this macro if it would always evaluate to zero.
  
!  -- Target Hook: tree TARGET_MD_ASM_CLOBBERS (tree OUTPUTS, tree INPUTS,
!           tree CLOBBERS)
!      This target hook should add to CLOBBERS 'STRING_CST' trees for any
       hard regs the port wishes to automatically clobber for an asm.  It
!      should return the result of the last 'tree_cons' used to add a
       clobber.  The OUTPUTS, INPUTS and CLOBBER lists are the
       corresponding parameters to the asm and may be inspected to avoid
       clobbering a register that is an input or output of the asm.  You
!      can use 'tree_overlaps_hard_reg_set', declared in 'tree.h', to test
       for overlap with regards to asm-declared registers.
  
   -- Macro: MATH_LIBRARY
!      Define this macro as a C string constant for the linker argument to
!      link in the system math library, minus the initial '"-l"', or '""'
!      if the target does not have a separate math library.
  
!      You need only define this macro if the default of '"m"' is wrong.
  
   -- Macro: LIBRARY_PATH_ENV
       Define this macro as a C string constant for the environment
       variable that specifies where the linker should look for libraries.
  
!      You need only define this macro if the default of '"LIBRARY_PATH"'
       is wrong.
  
   -- Macro: TARGET_POSIX_IO
       Define this macro if the target supports the following POSIX file
!      functions, access, mkdir and file locking with fcntl / F_SETLKW.
!      Defining 'TARGET_POSIX_IO' will enable the test coverage code to
       use file locking when exiting a program, which avoids race
!      conditions if the program has forked.  It will also create
       directories at run-time for cross-profiling.
  
   -- Macro: MAX_CONDITIONAL_EXECUTE
+ 
       A C expression for the maximum number of instructions to execute
       via conditional execution instructions instead of a branch.  A
!      value of 'BRANCH_COST'+1 is the default if the machine does not use
!      cc0, and 1 if it does use cc0.
  
   -- Macro: IFCVT_MODIFY_TESTS (CE_INFO, TRUE_EXPR, FALSE_EXPR)
!      Used if the target needs to perform machine-dependent modifications
!      on the conditionals used for turning basic blocks into
!      conditionally executed code.  CE_INFO points to a data structure,
!      'struct ce_if_block', which contains information about the
!      currently processed blocks.  TRUE_EXPR and FALSE_EXPR are the tests
!      that are used for converting the then-block and the else-block,
!      respectively.  Set either TRUE_EXPR or FALSE_EXPR to a null pointer
!      if the tests cannot be converted.
  
   -- Macro: IFCVT_MODIFY_MULTIPLE_TESTS (CE_INFO, BB, TRUE_EXPR,
            FALSE_EXPR)
!      Like 'IFCVT_MODIFY_TESTS', but used when converting more
!      complicated if-statements into conditions combined by 'and' and
!      'or' operations.  BB contains the basic block that contains the
       test that is currently being processed and about to be turned into
       a condition.
  
   -- Macro: IFCVT_MODIFY_INSN (CE_INFO, PATTERN, INSN)
       A C expression to modify the PATTERN of an INSN that is to be
       converted to conditional execution format.  CE_INFO points to a
!      data structure, 'struct ce_if_block', which contains information
       about the currently processed blocks.
  
   -- Macro: IFCVT_MODIFY_FINAL (CE_INFO)
!      A C expression to perform any final machine dependent modifications
!      in converting code to conditional execution.  The involved basic
!      blocks can be found in the 'struct ce_if_block' structure that is
!      pointed to by CE_INFO.
  
   -- Macro: IFCVT_MODIFY_CANCEL (CE_INFO)
       A C expression to cancel any machine dependent modifications in
       converting code to conditional execution.  The involved basic
!      blocks can be found in the 'struct ce_if_block' structure that is
       pointed to by CE_INFO.
  
   -- Macro: IFCVT_MACHDEP_INIT (CE_INFO)
       A C expression to initialize any machine specific data for
!      if-conversion of the if-block in the 'struct ce_if_block' structure
!      that is pointed to by CE_INFO.
  
   -- Target Hook: void TARGET_MACHINE_DEPENDENT_REORG (void)
       If non-null, this hook performs a target-specific pass over the
*************** Here are several miscellaneous parameter
*** 38191,38206 ****
       functions that need to be defined.  It should be a function that
       performs the necessary setup.
  
!      Machine specific built-in functions can be useful to expand
!      special machine instructions that would otherwise not normally be
!      generated because they have no equivalent in the source language
!      (for example, SIMD vector instructions or prefetch instructions).
  
       To create a built-in function, call the function
!      `lang_hooks.builtin_function' which is defined by the language
       front end.  You can use any type nodes set up by
!      `build_common_tree_nodes'; only language front ends that use those
!      two functions will call `TARGET_INIT_BUILTINS'.
  
   -- Target Hook: tree TARGET_BUILTIN_DECL (unsigned CODE, bool
            INITIALIZE_P)
--- 37770,37785 ----
       functions that need to be defined.  It should be a function that
       performs the necessary setup.
  
!      Machine specific built-in functions can be useful to expand special
!      machine instructions that would otherwise not normally be generated
!      because they have no equivalent in the source language (for
!      example, SIMD vector instructions or prefetch instructions).
  
       To create a built-in function, call the function
!      'lang_hooks.builtin_function' which is defined by the language
       front end.  You can use any type nodes set up by
!      'build_common_tree_nodes'; only language front ends that use those
!      two functions will call 'TARGET_INIT_BUILTINS'.
  
   -- Target Hook: tree TARGET_BUILTIN_DECL (unsigned CODE, bool
            INITIALIZE_P)
*************** Here are several miscellaneous parameter
*** 38209,38221 ****
       returns the builtin function declaration for the builtin function
       code CODE.  If there is no such builtin and it cannot be
       initialized at this time if INITIALIZE_P is true the function
!      should return `NULL_TREE'.  If CODE is out of range the function
!      should return `error_mark_node'.
  
   -- Target Hook: rtx TARGET_EXPAND_BUILTIN (tree EXP, rtx TARGET, rtx
            SUBTARGET, machine_mode MODE, int IGNORE)
       Expand a call to a machine specific built-in function that was set
!      up by `TARGET_INIT_BUILTINS'.  EXP is the expression for the
       function call; the result should go to TARGET if that is
       convenient, and have mode MODE if that is convenient.  SUBTARGET
       may be used as the target for computing one of EXP's operands.
--- 37788,37801 ----
       returns the builtin function declaration for the builtin function
       code CODE.  If there is no such builtin and it cannot be
       initialized at this time if INITIALIZE_P is true the function
!      should return 'NULL_TREE'.  If CODE is out of range the function
!      should return 'error_mark_node'.
  
   -- Target Hook: rtx TARGET_EXPAND_BUILTIN (tree EXP, rtx TARGET, rtx
            SUBTARGET, machine_mode MODE, int IGNORE)
+ 
       Expand a call to a machine specific built-in function that was set
!      up by 'TARGET_INIT_BUILTINS'.  EXP is the expression for the
       function call; the result should go to TARGET if that is
       convenient, and have mode MODE if that is convenient.  SUBTARGET
       may be used as the target for computing one of EXP's operands.
*************** Here are several miscellaneous parameter
*** 38228,38360 ****
       return fndecl of function implementing generic builtin whose code
       is passed in FCODE.  Currently following built-in functions are
       obtained using this hook:
- 
        -- Built-in Function: __bounds_type __chkp_bndmk (const void *LB,
                 size_t SIZE)
!           Function code - BUILT_IN_CHKP_BNDMK.  This built-in function
!           is used by Pointer Bounds Checker to create bound values.  LB
            holds low bound of the resulting bounds.  SIZE holds size of
            created bounds.
  
        -- Built-in Function: void __chkp_bndstx (const void *PTR,
                 __bounds_type B, const void **LOC)
!           Function code - `BUILT_IN_CHKP_BNDSTX'.  This built-in
            function is used by Pointer Bounds Checker to store bounds B
            for pointer PTR when PTR is stored by address LOC.
  
        -- Built-in Function: __bounds_type __chkp_bndldx (const void
                 **LOC, const void *PTR)
!           Function code - `BUILT_IN_CHKP_BNDLDX'.  This built-in
            function is used by Pointer Bounds Checker to get bounds of
            pointer PTR loaded by address LOC.
  
        -- Built-in Function: void __chkp_bndcl (const void *PTR,
                 __bounds_type B)
!           Function code - `BUILT_IN_CHKP_BNDCL'.  This built-in
!           function is used by Pointer Bounds Checker to perform check
!           for pointer PTR against lower bound of bounds B.
  
        -- Built-in Function: void __chkp_bndcu (const void *PTR,
                 __bounds_type B)
!           Function code - `BUILT_IN_CHKP_BNDCU'.  This built-in
!           function is used by Pointer Bounds Checker to perform check
!           for pointer PTR against upper bound of bounds B.
  
        -- Built-in Function: __bounds_type __chkp_bndret (void *PTR)
!           Function code - `BUILT_IN_CHKP_BNDRET'.  This built-in
            function is used by Pointer Bounds Checker to obtain bounds
            returned by a call statement.  PTR passed to built-in is
!           `SSA_NAME' returned by the call.
  
        -- Built-in Function: __bounds_type __chkp_intersect
                 (__bounds_type B1, __bounds_type B2)
!           Function code - `BUILT_IN_CHKP_INTERSECT'.  This built-in
            function returns intersection of bounds B1 and B2.
  
        -- Built-in Function: __bounds_type __chkp_narrow (const void
                 *PTR, __bounds_type B, size_t S)
!           Function code - `BUILT_IN_CHKP_NARROW'.  This built-in
            function returns intersection of bounds B and [PTR, PTR + S -
!           `1'].
  
        -- Built-in Function: size_t __chkp_sizeof (const void *PTR)
!           Function code - `BUILT_IN_CHKP_SIZEOF'.  This built-in
!           function returns size of object referenced by PTR. PTR is
!           always `ADDR_EXPR' of `VAR_DECL'.  This built-in is used by
            Pointer Bounds Checker when bounds of object cannot be
!           computed statically (e.g. object has incomplete type).
  
        -- Built-in Function: const void *__chkp_extract_lower
                 (__bounds_type B)
!           Function code - `BUILT_IN_CHKP_EXTRACT_LOWER'.  This built-in
            function returns lower bound of bounds B.
  
        -- Built-in Function: const void *__chkp_extract_upper
                 (__bounds_type B)
!           Function code - `BUILT_IN_CHKP_EXTRACT_UPPER'.  This built-in
            function returns upper bound of bounds B.
- 
   -- Target Hook: tree TARGET_CHKP_BOUND_TYPE (void)
       Return type to be used for bounds
- 
   -- Target Hook: enum machine_mode TARGET_CHKP_BOUND_MODE (void)
       Return mode to be used for bounds.
- 
   -- Target Hook: tree TARGET_CHKP_MAKE_BOUNDS_CONSTANT (HOST_WIDE_INT
            LB, HOST_WIDE_INT UB)
       Return constant used to statically initialize constant bounds with
       specified lower bound LB and upper bounds UB.
- 
   -- Target Hook: int TARGET_CHKP_INITIALIZE_BOUNDS (tree VAR, tree LB,
            tree UB, tree *STMTS)
       Generate a list of statements STMTS to initialize pointer bounds
!      variable VAR with bounds LB and UB.  Return the number of
!      generated statements.
  
   -- Target Hook: tree TARGET_RESOLVE_OVERLOADED_BUILTIN (unsigned int
            LOC, tree FNDECL, void *ARGLIST)
       Select a replacement for a machine specific built-in function that
!      was set up by `TARGET_INIT_BUILTINS'.  This is done _before_
       regular type checking, and so allows the target to implement a
       crude form of function overloading.  FNDECL is the declaration of
       the built-in function.  ARGLIST is the list of arguments passed to
       the built-in function.  The result is a complete expression that
!      implements the operation, usually another `CALL_EXPR'.  ARGLIST
!      really has type `VEC(tree,gc)*'
  
!  -- Target Hook: tree TARGET_FOLD_BUILTIN (tree FNDECL, int N_ARGS,
!           tree *ARGP, bool IGNORE)
!      Fold a call to a machine specific built-in function that was set
!      up by `TARGET_INIT_BUILTINS'.  FNDECL is the declaration of the
!      built-in function.  N_ARGS is the number of arguments passed to
!      the function; the arguments themselves are pointed to by ARGP.
!      The result is another tree, valid for both GIMPLE and GENERIC,
       containing a simplified expression for the call's result.  If
       IGNORE is true the value will be ignored.
  
   -- Target Hook: bool TARGET_GIMPLE_FOLD_BUILTIN (gimple_stmt_iterator
            *GSI)
       Fold a call to a machine specific built-in function that was set up
!      by `TARGET_INIT_BUILTINS'.  GSI points to the gimple statement
       holding the function call.  Returns true if any change was made to
       the GIMPLE stream.
  
   -- Target Hook: int TARGET_COMPARE_VERSION_PRIORITY (tree DECL1, tree
            DECL2)
!      This hook is used to compare the target attributes in two
!      functions to determine which function's features get higher
!      priority.  This is used during function multi-versioning to figure
!      out the order in which two versions must be dispatched.  A
!      function version with a higher priority is checked for dispatching
!      earlier.  DECL1 and DECL2 are  the two function decls that will be
!      compared.
  
   -- Target Hook: tree TARGET_GET_FUNCTION_VERSIONS_DISPATCHER (void
            *DECL)
       This hook is used to get the dispatcher function for a set of
!      function versions.  The dispatcher function is called to invoke
!      the right function version at run-time. DECL is one version from a
!      set of semantically identical versions.
  
   -- Target Hook: tree TARGET_GENERATE_VERSION_DISPATCHER_BODY (void
            *ARG)
--- 37808,37934 ----
       return fndecl of function implementing generic builtin whose code
       is passed in FCODE.  Currently following built-in functions are
       obtained using this hook:
        -- Built-in Function: __bounds_type __chkp_bndmk (const void *LB,
                 size_t SIZE)
!           Function code - BUILT_IN_CHKP_BNDMK. This built-in function is
!           used by Pointer Bounds Checker to create bound values.  LB
            holds low bound of the resulting bounds.  SIZE holds size of
            created bounds.
  
        -- Built-in Function: void __chkp_bndstx (const void *PTR,
                 __bounds_type B, const void **LOC)
!           Function code - 'BUILT_IN_CHKP_BNDSTX'.  This built-in
            function is used by Pointer Bounds Checker to store bounds B
            for pointer PTR when PTR is stored by address LOC.
  
        -- Built-in Function: __bounds_type __chkp_bndldx (const void
                 **LOC, const void *PTR)
!           Function code - 'BUILT_IN_CHKP_BNDLDX'.  This built-in
            function is used by Pointer Bounds Checker to get bounds of
            pointer PTR loaded by address LOC.
  
        -- Built-in Function: void __chkp_bndcl (const void *PTR,
                 __bounds_type B)
!           Function code - 'BUILT_IN_CHKP_BNDCL'.  This built-in function
!           is used by Pointer Bounds Checker to perform check for pointer
!           PTR against lower bound of bounds B.
  
        -- Built-in Function: void __chkp_bndcu (const void *PTR,
                 __bounds_type B)
!           Function code - 'BUILT_IN_CHKP_BNDCU'.  This built-in function
!           is used by Pointer Bounds Checker to perform check for pointer
!           PTR against upper bound of bounds B.
  
        -- Built-in Function: __bounds_type __chkp_bndret (void *PTR)
!           Function code - 'BUILT_IN_CHKP_BNDRET'.  This built-in
            function is used by Pointer Bounds Checker to obtain bounds
            returned by a call statement.  PTR passed to built-in is
!           'SSA_NAME' returned by the call.
  
        -- Built-in Function: __bounds_type __chkp_intersect
                 (__bounds_type B1, __bounds_type B2)
!           Function code - 'BUILT_IN_CHKP_INTERSECT'.  This built-in
            function returns intersection of bounds B1 and B2.
  
        -- Built-in Function: __bounds_type __chkp_narrow (const void
                 *PTR, __bounds_type B, size_t S)
!           Function code - 'BUILT_IN_CHKP_NARROW'.  This built-in
            function returns intersection of bounds B and [PTR, PTR + S -
!           '1'].
  
        -- Built-in Function: size_t __chkp_sizeof (const void *PTR)
!           Function code - 'BUILT_IN_CHKP_SIZEOF'.  This built-in
!           function returns size of object referenced by PTR.  PTR is
!           always 'ADDR_EXPR' of 'VAR_DECL'.  This built-in is used by
            Pointer Bounds Checker when bounds of object cannot be
!           computed statically (e.g.  object has incomplete type).
  
        -- Built-in Function: const void *__chkp_extract_lower
                 (__bounds_type B)
!           Function code - 'BUILT_IN_CHKP_EXTRACT_LOWER'.  This built-in
            function returns lower bound of bounds B.
  
        -- Built-in Function: const void *__chkp_extract_upper
                 (__bounds_type B)
!           Function code - 'BUILT_IN_CHKP_EXTRACT_UPPER'.  This built-in
            function returns upper bound of bounds B.
   -- Target Hook: tree TARGET_CHKP_BOUND_TYPE (void)
       Return type to be used for bounds
   -- Target Hook: enum machine_mode TARGET_CHKP_BOUND_MODE (void)
       Return mode to be used for bounds.
   -- Target Hook: tree TARGET_CHKP_MAKE_BOUNDS_CONSTANT (HOST_WIDE_INT
            LB, HOST_WIDE_INT UB)
       Return constant used to statically initialize constant bounds with
       specified lower bound LB and upper bounds UB.
   -- Target Hook: int TARGET_CHKP_INITIALIZE_BOUNDS (tree VAR, tree LB,
            tree UB, tree *STMTS)
       Generate a list of statements STMTS to initialize pointer bounds
!      variable VAR with bounds LB and UB.  Return the number of generated
!      statements.
  
   -- Target Hook: tree TARGET_RESOLVE_OVERLOADED_BUILTIN (unsigned int
            LOC, tree FNDECL, void *ARGLIST)
       Select a replacement for a machine specific built-in function that
!      was set up by 'TARGET_INIT_BUILTINS'.  This is done _before_
       regular type checking, and so allows the target to implement a
       crude form of function overloading.  FNDECL is the declaration of
       the built-in function.  ARGLIST is the list of arguments passed to
       the built-in function.  The result is a complete expression that
!      implements the operation, usually another 'CALL_EXPR'.  ARGLIST
!      really has type 'VEC(tree,gc)*'
  
!  -- Target Hook: tree TARGET_FOLD_BUILTIN (tree FNDECL, int N_ARGS, tree
!           *ARGP, bool IGNORE)
!      Fold a call to a machine specific built-in function that was set up
!      by 'TARGET_INIT_BUILTINS'.  FNDECL is the declaration of the
!      built-in function.  N_ARGS is the number of arguments passed to the
!      function; the arguments themselves are pointed to by ARGP.  The
!      result is another tree, valid for both GIMPLE and GENERIC,
       containing a simplified expression for the call's result.  If
       IGNORE is true the value will be ignored.
  
   -- Target Hook: bool TARGET_GIMPLE_FOLD_BUILTIN (gimple_stmt_iterator
            *GSI)
       Fold a call to a machine specific built-in function that was set up
!      by 'TARGET_INIT_BUILTINS'.  GSI points to the gimple statement
       holding the function call.  Returns true if any change was made to
       the GIMPLE stream.
  
   -- Target Hook: int TARGET_COMPARE_VERSION_PRIORITY (tree DECL1, tree
            DECL2)
!      This hook is used to compare the target attributes in two functions
!      to determine which function's features get higher priority.  This
!      is used during function multi-versioning to figure out the order in
!      which two versions must be dispatched.  A function version with a
!      higher priority is checked for dispatching earlier.  DECL1 and
!      DECL2 are the two function decls that will be compared.
  
   -- Target Hook: tree TARGET_GET_FUNCTION_VERSIONS_DISPATCHER (void
            *DECL)
       This hook is used to get the dispatcher function for a set of
!      function versions.  The dispatcher function is called to invoke the
!      right function version at run-time.  DECL is one version from a set
!      of semantically identical versions.
  
   -- Target Hook: tree TARGET_GENERATE_VERSION_DISPATCHER_BODY (void
            *ARG)
*************** Here are several miscellaneous parameter
*** 38367,38392 ****
            &ITERATIONS, const widest_int &ITERATIONS_MAX, unsigned int
            LOOP_DEPTH, bool ENTERED_AT_TOP)
       Return true if it is possible to use low-overhead loops
!      (`doloop_end' and `doloop_begin') for a particular loop.
!      ITERATIONS gives the exact number of iterations, or 0 if not
!      known.  ITERATIONS_MAX gives the maximum number of iterations, or
!      0 if not known.  LOOP_DEPTH is the nesting depth of the loop, with
!      1 for innermost loops, 2 for loops that contain innermost loops,
!      and so on.  ENTERED_AT_TOP is true if the loop is only entered
!      from the top.
  
!      This hook is only used if `doloop_end' is available.  The default
       implementation returns true.  You can use
!      `can_use_doloop_if_innermost' if the loop must be the innermost,
       and if there are no other restrictions.
  
   -- Target Hook: const char * TARGET_INVALID_WITHIN_DOLOOP (const
            rtx_insn *INSN)
       Take an instruction in INSN and return NULL if it is valid within a
       low-overhead loop, otherwise return a string explaining why doloop
       could not be applied.
  
!      Many targets use special registers for low-overhead looping. For
       any instruction that clobbers these this function should return a
       string indicating the reason why the doloop could not be applied.
       By default, the RTL loop optimizer does not use a present doloop
--- 37941,37967 ----
            &ITERATIONS, const widest_int &ITERATIONS_MAX, unsigned int
            LOOP_DEPTH, bool ENTERED_AT_TOP)
       Return true if it is possible to use low-overhead loops
!      ('doloop_end' and 'doloop_begin') for a particular loop.
!      ITERATIONS gives the exact number of iterations, or 0 if not known.
!      ITERATIONS_MAX gives the maximum number of iterations, or 0 if not
!      known.  LOOP_DEPTH is the nesting depth of the loop, with 1 for
!      innermost loops, 2 for loops that contain innermost loops, and so
!      on.  ENTERED_AT_TOP is true if the loop is only entered from the
!      top.
  
!      This hook is only used if 'doloop_end' is available.  The default
       implementation returns true.  You can use
!      'can_use_doloop_if_innermost' if the loop must be the innermost,
       and if there are no other restrictions.
  
   -- Target Hook: const char * TARGET_INVALID_WITHIN_DOLOOP (const
            rtx_insn *INSN)
+ 
       Take an instruction in INSN and return NULL if it is valid within a
       low-overhead loop, otherwise return a string explaining why doloop
       could not be applied.
  
!      Many targets use special registers for low-overhead looping.  For
       any instruction that clobbers these this function should return a
       string indicating the reason why the doloop could not be applied.
       By default, the RTL loop optimizer does not use a present doloop
*************** Here are several miscellaneous parameter
*** 38394,38478 ****
       instructions.
  
   -- Target Hook: bool TARGET_LEGITIMATE_COMBINED_INSN (rtx_insn *INSN)
!      Take an instruction in INSN and return `false' if the instruction
       is not appropriate as a combination of two or more instructions.
       The default is to accept all instructions.
  
   -- Target Hook: bool TARGET_CAN_FOLLOW_JUMP (const rtx_insn *FOLLOWER,
            const rtx_insn *FOLLOWEE)
!      FOLLOWER and FOLLOWEE are JUMP_INSN instructions;  return true if
!      FOLLOWER may be modified to follow FOLLOWEE;  false, if it can't.
       For example, on some targets, certain kinds of branches can't be
!      made to  follow through a hot/cold partitioning.
  
   -- Target Hook: bool TARGET_COMMUTATIVE_P (const_rtx X, int OUTER_CODE)
!      This target hook returns `true' if X is considered to be
       commutative.  Usually, this is just COMMUTATIVE_P (X), but the HP
       PA doesn't consider PLUS to be commutative inside a MEM.
       OUTER_CODE is the rtx code of the enclosing rtl, if known,
       otherwise it is UNKNOWN.
  
   -- Target Hook: rtx TARGET_ALLOCATE_INITIAL_VALUE (rtx HARD_REG)
       When the initial value of a hard register has been copied in a
       pseudo register, it is often not necessary to actually allocate
!      another register to this pseudo register, because the original
!      hard register or a stack slot it has been saved into can be used.
!      `TARGET_ALLOCATE_INITIAL_VALUE' is called at the start of register
       allocation once for each hard register that had its initial value
!      copied by using `get_func_hard_reg_initial_val' or
!      `get_hard_reg_initial_val'.  Possible values are `NULL_RTX', if
!      you don't want to do any special allocation, a `REG' rtx--that
!      would typically be the hard register itself, if it is known not to
!      be clobbered--or a `MEM'.  If you are returning a `MEM', this is
!      only a hint for the allocator; it might decide to use another
!      register anyways.  You may use `current_function_is_leaf' or
!      `REG_N_SETS' in the hook to determine if the hard register in
!      question will not be clobbered.  The default value of this hook is
!      `NULL', which disables any special allocation.
  
   -- Target Hook: int TARGET_UNSPEC_MAY_TRAP_P (const_rtx X, unsigned
            FLAGS)
!      This target hook returns nonzero if X, an `unspec' or
!      `unspec_volatile' operation, might cause a trap.  Targets can use
!      this hook to enhance precision of analysis for `unspec' and
!      `unspec_volatile' operations.  You may call `may_trap_p_1' to
       analyze inner elements of X in which case FLAGS should be passed
       along.
  
   -- Target Hook: void TARGET_SET_CURRENT_FUNCTION (tree DECL)
       The compiler invokes this hook whenever it changes its current
!      function context (`cfun').  You can define this function if the
       back end needs to perform any initialization or reset actions on a
       per-function basis.  For example, it may be used to implement
       function attributes that affect register usage or code generation
       patterns.  The argument DECL is the declaration for the new
!      function context, and may be null to indicate that the compiler
!      has left a function context and is returning to processing at the
!      top level.  The default hook function does nothing.
  
!      GCC sets `cfun' to a dummy function context during initialization
!      of some parts of the back end.  The hook function is not invoked
!      in this situation; you need not worry about the hook being invoked
       recursively, or when the back end is in a partially-initialized
!      state.  `cfun' might be `NULL' to indicate processing at top level,
       outside of any function scope.
  
   -- Macro: TARGET_OBJECT_SUFFIX
       Define this macro to be a C string representing the suffix for
       object files on your target machine.  If you do not define this
!      macro, GCC will use `.o' as the suffix for object files.
  
   -- Macro: TARGET_EXECUTABLE_SUFFIX
       Define this macro to be a C string representing the suffix to be
!      automatically added to executable files on your target machine.
!      If you do not define this macro, GCC will use the null string as
!      the suffix for executable files.
  
   -- Macro: COLLECT_EXPORT_LIST
!      If defined, `collect2' will scan the individual object files
       specified on its command line and create an export list for the
       linker.  Define this macro for systems like AIX, where the linker
!      discards object files that are not referenced from `main' and uses
       export lists.
  
   -- Macro: MODIFY_JNI_METHOD_CALL (MDECL)
--- 37969,38054 ----
       instructions.
  
   -- Target Hook: bool TARGET_LEGITIMATE_COMBINED_INSN (rtx_insn *INSN)
!      Take an instruction in INSN and return 'false' if the instruction
       is not appropriate as a combination of two or more instructions.
       The default is to accept all instructions.
  
   -- Target Hook: bool TARGET_CAN_FOLLOW_JUMP (const rtx_insn *FOLLOWER,
            const rtx_insn *FOLLOWEE)
!      FOLLOWER and FOLLOWEE are JUMP_INSN instructions; return true if
!      FOLLOWER may be modified to follow FOLLOWEE; false, if it can't.
       For example, on some targets, certain kinds of branches can't be
!      made to follow through a hot/cold partitioning.
  
   -- Target Hook: bool TARGET_COMMUTATIVE_P (const_rtx X, int OUTER_CODE)
!      This target hook returns 'true' if X is considered to be
       commutative.  Usually, this is just COMMUTATIVE_P (X), but the HP
       PA doesn't consider PLUS to be commutative inside a MEM.
       OUTER_CODE is the rtx code of the enclosing rtl, if known,
       otherwise it is UNKNOWN.
  
   -- Target Hook: rtx TARGET_ALLOCATE_INITIAL_VALUE (rtx HARD_REG)
+ 
       When the initial value of a hard register has been copied in a
       pseudo register, it is often not necessary to actually allocate
!      another register to this pseudo register, because the original hard
!      register or a stack slot it has been saved into can be used.
!      'TARGET_ALLOCATE_INITIAL_VALUE' is called at the start of register
       allocation once for each hard register that had its initial value
!      copied by using 'get_func_hard_reg_initial_val' or
!      'get_hard_reg_initial_val'.  Possible values are 'NULL_RTX', if you
!      don't want to do any special allocation, a 'REG' rtx--that would
!      typically be the hard register itself, if it is known not to be
!      clobbered--or a 'MEM'.  If you are returning a 'MEM', this is only
!      a hint for the allocator; it might decide to use another register
!      anyways.  You may use 'current_function_is_leaf' or 'REG_N_SETS' in
!      the hook to determine if the hard register in question will not be
!      clobbered.  The default value of this hook is 'NULL', which
!      disables any special allocation.
  
   -- Target Hook: int TARGET_UNSPEC_MAY_TRAP_P (const_rtx X, unsigned
            FLAGS)
!      This target hook returns nonzero if X, an 'unspec' or
!      'unspec_volatile' operation, might cause a trap.  Targets can use
!      this hook to enhance precision of analysis for 'unspec' and
!      'unspec_volatile' operations.  You may call 'may_trap_p_1' to
       analyze inner elements of X in which case FLAGS should be passed
       along.
  
   -- Target Hook: void TARGET_SET_CURRENT_FUNCTION (tree DECL)
       The compiler invokes this hook whenever it changes its current
!      function context ('cfun').  You can define this function if the
       back end needs to perform any initialization or reset actions on a
       per-function basis.  For example, it may be used to implement
       function attributes that affect register usage or code generation
       patterns.  The argument DECL is the declaration for the new
!      function context, and may be null to indicate that the compiler has
!      left a function context and is returning to processing at the top
!      level.  The default hook function does nothing.
  
!      GCC sets 'cfun' to a dummy function context during initialization
!      of some parts of the back end.  The hook function is not invoked in
!      this situation; you need not worry about the hook being invoked
       recursively, or when the back end is in a partially-initialized
!      state.  'cfun' might be 'NULL' to indicate processing at top level,
       outside of any function scope.
  
   -- Macro: TARGET_OBJECT_SUFFIX
       Define this macro to be a C string representing the suffix for
       object files on your target machine.  If you do not define this
!      macro, GCC will use '.o' as the suffix for object files.
  
   -- Macro: TARGET_EXECUTABLE_SUFFIX
       Define this macro to be a C string representing the suffix to be
!      automatically added to executable files on your target machine.  If
!      you do not define this macro, GCC will use the null string as the
!      suffix for executable files.
  
   -- Macro: COLLECT_EXPORT_LIST
!      If defined, 'collect2' will scan the individual object files
       specified on its command line and create an export list for the
       linker.  Define this macro for systems like AIX, where the linker
!      discards object files that are not referenced from 'main' and uses
       export lists.
  
   -- Macro: MODIFY_JNI_METHOD_CALL (MDECL)
*************** Here are several miscellaneous parameter
*** 38480,38486 ****
       method call MDECL, if Java Native Interface (JNI) methods must be
       invoked differently from other methods on your target.  For
       example, on 32-bit Microsoft Windows, JNI methods must be invoked
!      using the `stdcall' calling convention and this macro is then
       defined as this expression:
  
            build_type_attribute_variant (MDECL,
--- 38056,38062 ----
       method call MDECL, if Java Native Interface (JNI) methods must be
       invoked differently from other methods on your target.  For
       example, on 32-bit Microsoft Windows, JNI methods must be invoked
!      using the 'stdcall' calling convention and this macro is then
       defined as this expression:
  
            build_type_attribute_variant (MDECL,
*************** Here are several miscellaneous parameter
*** 38489,38499 ****
                                           NULL))
  
   -- Target Hook: bool TARGET_CANNOT_MODIFY_JUMPS_P (void)
!      This target hook returns `true' past the point in which new jump
!      instructions could be created.  On machines that require a
!      register for every jump such as the SHmedia ISA of SH5, this point
!      would typically be reload, so this target hook should be defined
!      to a function such as:
  
            static bool
            cannot_modify_jumps_past_reload_p ()
--- 38065,38075 ----
                                           NULL))
  
   -- Target Hook: bool TARGET_CANNOT_MODIFY_JUMPS_P (void)
!      This target hook returns 'true' past the point in which new jump
!      instructions could be created.  On machines that require a register
!      for every jump such as the SHmedia ISA of SH5, this point would
!      typically be reload, so this target hook should be defined to a
!      function such as:
  
            static bool
            cannot_modify_jumps_past_reload_p ()
*************** Here are several miscellaneous parameter
*** 38504,38526 ****
   -- Target Hook: reg_class_t TARGET_BRANCH_TARGET_REGISTER_CLASS (void)
       This target hook returns a register class for which branch target
       register optimizations should be applied.  All registers in this
!      class should be usable interchangeably.  After reload, registers
!      in this class will be re-allocated and loads will be hoisted out
!      of loops and be subjected to inter-block scheduling.
  
   -- Target Hook: bool TARGET_BRANCH_TARGET_REGISTER_CALLEE_SAVED (bool
            AFTER_PROLOGUE_EPILOGUE_GEN)
       Branch target register optimization will by default exclude
!      callee-saved registers that are not already live during the
!      current function; if this target hook returns true, they will be
!      included.  The target code must than make sure that all target
!      registers in the class returned by
!      `TARGET_BRANCH_TARGET_REGISTER_CLASS' that might need saving are
!      saved.  AFTER_PROLOGUE_EPILOGUE_GEN indicates if prologues and
!      epilogues have already been generated.  Note, even if you only
!      return true when AFTER_PROLOGUE_EPILOGUE_GEN is false, you still
!      are likely to have to make special provisions in
!      `INITIAL_ELIMINATION_OFFSET' to reserve space for caller-saved
       target registers.
  
   -- Target Hook: bool TARGET_HAVE_CONDITIONAL_EXECUTION (void)
--- 38080,38101 ----
   -- Target Hook: reg_class_t TARGET_BRANCH_TARGET_REGISTER_CLASS (void)
       This target hook returns a register class for which branch target
       register optimizations should be applied.  All registers in this
!      class should be usable interchangeably.  After reload, registers in
!      this class will be re-allocated and loads will be hoisted out of
!      loops and be subjected to inter-block scheduling.
  
   -- Target Hook: bool TARGET_BRANCH_TARGET_REGISTER_CALLEE_SAVED (bool
            AFTER_PROLOGUE_EPILOGUE_GEN)
       Branch target register optimization will by default exclude
!      callee-saved registers that are not already live during the current
!      function; if this target hook returns true, they will be included.
!      The target code must than make sure that all target registers in
!      the class returned by 'TARGET_BRANCH_TARGET_REGISTER_CLASS' that
!      might need saving are saved.  AFTER_PROLOGUE_EPILOGUE_GEN indicates
!      if prologues and epilogues have already been generated.  Note, even
!      if you only return true when AFTER_PROLOGUE_EPILOGUE_GEN is false,
!      you still are likely to have to make special provisions in
!      'INITIAL_ELIMINATION_OFFSET' to reserve space for caller-saved
       target registers.
  
   -- Target Hook: bool TARGET_HAVE_CONDITIONAL_EXECUTION (void)
*************** Here are several miscellaneous parameter
*** 38529,38567 ****
       several different modes and they have different conditional
       execution capability, such as ARM.
  
!  -- Target Hook: rtx TARGET_GEN_CCMP_FIRST (rtx *PREP_SEQ, rtx
!           *GEN_SEQ, int CODE, tree OP0, tree OP1)
       This function prepares to emit a comparison insn for the first
!      compare in a  sequence of conditional comparisions.  It returns a
!      appropriate `CC'  for passing to `gen_ccmp_next' or
!      `cbranch_optab'.  The insns to  prepare the compare are saved in
!      PREP_SEQ and the compare insns are  saved in GEN_SEQ.  They will
!      be emitted when all the compares in the  the conditional
!      comparision are generated without error.  CODE is  the `rtx_code'
!      of the compare for OP0 and OP1.
  
   -- Target Hook: rtx TARGET_GEN_CCMP_NEXT (rtx *PREP_SEQ, rtx *GEN_SEQ,
            rtx PREV, int CMP_CODE, tree OP0, tree OP1, int BIT_CODE)
       This function prepare to emit a conditional comparison within a
!      sequence of  conditional comparisons.  It returns a appropriate
!      `CC' for passing to  `gen_ccmp_next' or `cbranch_optab'.  The
!      insns to prepare the  compare are saved in PREP_SEQ and the
!      compare insns are saved in  GEN_SEQ.  They will be emitted when
!      all the compares in the conditional  comparision are generated
!      without error.  The PREV expression is the  result of a prior call
!      to `gen_ccmp_first' or `gen_ccmp_next'.  It  may return `NULL' if
!      the combination of PREV and this comparison is  not supported,
!      otherwise the result must be appropriate for passing to
!      `gen_ccmp_next' or `cbranch_optab'.  CODE is the  `rtx_code' of
!      the compare for OP0 and OP1.  BIT_CODE  is `AND' or `IOR', which
!      is the op on the two compares.
  
   -- Target Hook: unsigned TARGET_LOOP_UNROLL_ADJUST (unsigned NUNROLL,
            struct loop *LOOP)
       This target hook returns a new value for the number of times LOOP
!      should be unrolled. The parameter NUNROLL is the number of times
!      the loop is to be unrolled. The parameter LOOP is a pointer to the
!      loop, which is going to be checked for unrolling. This target hook
       is required only when the target has special constraints like
       maximum number of memory accesses.
  
--- 38104,38141 ----
       several different modes and they have different conditional
       execution capability, such as ARM.
  
!  -- Target Hook: rtx TARGET_GEN_CCMP_FIRST (rtx *PREP_SEQ, rtx *GEN_SEQ,
!           int CODE, tree OP0, tree OP1)
       This function prepares to emit a comparison insn for the first
!      compare in a sequence of conditional comparisions.  It returns a
!      appropriate 'CC' for passing to 'gen_ccmp_next' or 'cbranch_optab'.
!      The insns to prepare the compare are saved in PREP_SEQ and the
!      compare insns are saved in GEN_SEQ.  They will be emitted when all
!      the compares in the the conditional comparision are generated
!      without error.  CODE is the 'rtx_code' of the compare for OP0 and
!      OP1.
  
   -- Target Hook: rtx TARGET_GEN_CCMP_NEXT (rtx *PREP_SEQ, rtx *GEN_SEQ,
            rtx PREV, int CMP_CODE, tree OP0, tree OP1, int BIT_CODE)
       This function prepare to emit a conditional comparison within a
!      sequence of conditional comparisons.  It returns a appropriate 'CC'
!      for passing to 'gen_ccmp_next' or 'cbranch_optab'.  The insns to
!      prepare the compare are saved in PREP_SEQ and the compare insns are
!      saved in GEN_SEQ.  They will be emitted when all the compares in
!      the conditional comparision are generated without error.  The PREV
!      expression is the result of a prior call to 'gen_ccmp_first' or
!      'gen_ccmp_next'.  It may return 'NULL' if the combination of PREV
!      and this comparison is not supported, otherwise the result must be
!      appropriate for passing to 'gen_ccmp_next' or 'cbranch_optab'.
!      CODE is the 'rtx_code' of the compare for OP0 and OP1.  BIT_CODE is
!      'AND' or 'IOR', which is the op on the two compares.
  
   -- Target Hook: unsigned TARGET_LOOP_UNROLL_ADJUST (unsigned NUNROLL,
            struct loop *LOOP)
       This target hook returns a new value for the number of times LOOP
!      should be unrolled.  The parameter NUNROLL is the number of times
!      the loop is to be unrolled.  The parameter LOOP is a pointer to the
!      loop, which is going to be checked for unrolling.  This target hook
       is required only when the target has special constraints like
       maximum number of memory accesses.
  
*************** Here are several miscellaneous parameter
*** 38572,38640 ****
       exponentiation by an integer constant inline.  When this value is
       defined, exponentiation requiring more than this number of
       multiplications is implemented by calling the system library's
!      `pow', `powf' or `powl' routines.  The default value places no
       upper bound on the multiplication count.
  
   -- Macro: void TARGET_EXTRA_INCLUDES (const char *SYSROOT, const char
            *IPREFIX, int STDINC)
       This target hook should register any extra include files for the
!      target.  The parameter STDINC indicates if normal include files
!      are present.  The parameter SYSROOT is the system root directory.
!      The parameter IPREFIX is the prefix for the gcc directory.
  
   -- Macro: void TARGET_EXTRA_PRE_INCLUDES (const char *SYSROOT, const
            char *IPREFIX, int STDINC)
       This target hook should register any extra include files for the
!      target before any standard headers.  The parameter STDINC
!      indicates if normal include files are present.  The parameter
!      SYSROOT is the system root directory.  The parameter IPREFIX is
!      the prefix for the gcc directory.
  
   -- Macro: void TARGET_OPTF (char *PATH)
       This target hook should register special include paths for the
       target.  The parameter PATH is the include to register.  On Darwin
       systems, this is used for Framework includes, which have semantics
!      that are different from `-I'.
  
   -- Macro: bool TARGET_USE_LOCAL_THUNK_ALIAS_P (tree FNDECL)
!      This target macro returns `true' if it is safe to use a local alias
!      for a virtual function FNDECL when constructing thunks, `false'
!      otherwise.  By default, the macro returns `true' for all
!      functions, if a target supports aliases (i.e. defines
!      `ASM_OUTPUT_DEF'), `false' otherwise,
  
   -- Macro: TARGET_FORMAT_TYPES
       If defined, this macro is the name of a global variable containing
!      target-specific format checking information for the `-Wformat'
       option.  The default is to have no target-specific format checks.
  
   -- Macro: TARGET_N_FORMAT_TYPES
       If defined, this macro is the number of entries in
!      `TARGET_FORMAT_TYPES'.
  
   -- Macro: TARGET_OVERRIDES_FORMAT_ATTRIBUTES
       If defined, this macro is the name of a global variable containing
!      target-specific format overrides for the `-Wformat' option. The
!      default is to have no target-specific format overrides. If defined,
!      `TARGET_FORMAT_TYPES' must be defined, too.
  
   -- Macro: TARGET_OVERRIDES_FORMAT_ATTRIBUTES_COUNT
       If defined, this macro specifies the number of entries in
!      `TARGET_OVERRIDES_FORMAT_ATTRIBUTES'.
  
   -- Macro: TARGET_OVERRIDES_FORMAT_INIT
       If defined, this macro specifies the optional initialization
!      routine for target specific customizations of the system printf
!      and scanf formatter settings.
  
   -- Target Hook: bool TARGET_RELAXED_ORDERING
!      If set to `true', means that the target's memory model does not
       guarantee that loads which do not depend on one another will access
       main memory in the order of the instruction stream; if ordering is
       important, an explicit memory barrier must be used.  This is true
       of many recent processors which implement a policy of "relaxed,"
       "weak," or "release" memory consistency, such as Alpha, PowerPC,
!      and ia64.  The default is `false'.
  
   -- Target Hook: const char * TARGET_INVALID_ARG_FOR_UNPROTOTYPED_FN
            (const_tree TYPELIST, const_tree FUNCDECL, const_tree VAL)
--- 38146,38214 ----
       exponentiation by an integer constant inline.  When this value is
       defined, exponentiation requiring more than this number of
       multiplications is implemented by calling the system library's
!      'pow', 'powf' or 'powl' routines.  The default value places no
       upper bound on the multiplication count.
  
   -- Macro: void TARGET_EXTRA_INCLUDES (const char *SYSROOT, const char
            *IPREFIX, int STDINC)
       This target hook should register any extra include files for the
!      target.  The parameter STDINC indicates if normal include files are
!      present.  The parameter SYSROOT is the system root directory.  The
!      parameter IPREFIX is the prefix for the gcc directory.
  
   -- Macro: void TARGET_EXTRA_PRE_INCLUDES (const char *SYSROOT, const
            char *IPREFIX, int STDINC)
       This target hook should register any extra include files for the
!      target before any standard headers.  The parameter STDINC indicates
!      if normal include files are present.  The parameter SYSROOT is the
!      system root directory.  The parameter IPREFIX is the prefix for the
!      gcc directory.
  
   -- Macro: void TARGET_OPTF (char *PATH)
       This target hook should register special include paths for the
       target.  The parameter PATH is the include to register.  On Darwin
       systems, this is used for Framework includes, which have semantics
!      that are different from '-I'.
  
   -- Macro: bool TARGET_USE_LOCAL_THUNK_ALIAS_P (tree FNDECL)
!      This target macro returns 'true' if it is safe to use a local alias
!      for a virtual function FNDECL when constructing thunks, 'false'
!      otherwise.  By default, the macro returns 'true' for all functions,
!      if a target supports aliases (i.e. defines 'ASM_OUTPUT_DEF'),
!      'false' otherwise,
  
   -- Macro: TARGET_FORMAT_TYPES
       If defined, this macro is the name of a global variable containing
!      target-specific format checking information for the '-Wformat'
       option.  The default is to have no target-specific format checks.
  
   -- Macro: TARGET_N_FORMAT_TYPES
       If defined, this macro is the number of entries in
!      'TARGET_FORMAT_TYPES'.
  
   -- Macro: TARGET_OVERRIDES_FORMAT_ATTRIBUTES
       If defined, this macro is the name of a global variable containing
!      target-specific format overrides for the '-Wformat' option.  The
!      default is to have no target-specific format overrides.  If
!      defined, 'TARGET_FORMAT_TYPES' must be defined, too.
  
   -- Macro: TARGET_OVERRIDES_FORMAT_ATTRIBUTES_COUNT
       If defined, this macro specifies the number of entries in
!      'TARGET_OVERRIDES_FORMAT_ATTRIBUTES'.
  
   -- Macro: TARGET_OVERRIDES_FORMAT_INIT
       If defined, this macro specifies the optional initialization
!      routine for target specific customizations of the system printf and
!      scanf formatter settings.
  
   -- Target Hook: bool TARGET_RELAXED_ORDERING
!      If set to 'true', means that the target's memory model does not
       guarantee that loads which do not depend on one another will access
       main memory in the order of the instruction stream; if ordering is
       important, an explicit memory barrier must be used.  This is true
       of many recent processors which implement a policy of "relaxed,"
       "weak," or "release" memory consistency, such as Alpha, PowerPC,
!      and ia64.  The default is 'false'.
  
   -- Target Hook: const char * TARGET_INVALID_ARG_FOR_UNPROTOTYPED_FN
            (const_tree TYPELIST, const_tree FUNCDECL, const_tree VAL)
*************** Here are several miscellaneous parameter
*** 38645,38712 ****
   -- Target Hook: const char * TARGET_INVALID_CONVERSION (const_tree
            FROMTYPE, const_tree TOTYPE)
       If defined, this macro returns the diagnostic message when it is
!      invalid to convert from FROMTYPE to TOTYPE, or `NULL' if validity
       should be determined by the front end.
  
   -- Target Hook: const char * TARGET_INVALID_UNARY_OP (int OP,
            const_tree TYPE)
       If defined, this macro returns the diagnostic message when it is
       invalid to apply operation OP (where unary plus is denoted by
!      `CONVERT_EXPR') to an operand of type TYPE, or `NULL' if validity
       should be determined by the front end.
  
   -- Target Hook: const char * TARGET_INVALID_BINARY_OP (int OP,
            const_tree TYPE1, const_tree TYPE2)
       If defined, this macro returns the diagnostic message when it is
!      invalid to apply operation OP to operands of types TYPE1 and
!      TYPE2, or `NULL' if validity should be determined by the front end.
  
   -- Target Hook: const char * TARGET_INVALID_PARAMETER_TYPE (const_tree
            TYPE)
       If defined, this macro returns the diagnostic message when it is
!      invalid for functions to include parameters of type TYPE, or
!      `NULL' if validity should be determined by the front end.  This is
       currently used only by the C and C++ front ends.
  
   -- Target Hook: const char * TARGET_INVALID_RETURN_TYPE (const_tree
            TYPE)
       If defined, this macro returns the diagnostic message when it is
!      invalid for functions to have return type TYPE, or `NULL' if
       validity should be determined by the front end.  This is currently
       used only by the C and C++ front ends.
  
   -- Target Hook: tree TARGET_PROMOTED_TYPE (const_tree TYPE)
       If defined, this target hook returns the type to which values of
       TYPE should be promoted when they appear in expressions, analogous
!      to the integer promotions, or `NULL_TREE' to use the front end's
       normal promotion rules.  This hook is useful when there are
       target-specific types with special promotion rules.  This is
       currently used only by the C and C++ front ends.
  
   -- Target Hook: tree TARGET_CONVERT_TO_TYPE (tree TYPE, tree EXPR)
       If defined, this hook returns the result of converting EXPR to
!      TYPE.  It should return the converted expression, or `NULL_TREE'
!      to apply the front end's normal conversion rules.  This hook is
!      useful when there are target-specific types with special
!      conversion rules.  This is currently used only by the C and C++
!      front ends.
  
   -- Macro: TARGET_USE_JCR_SECTION
       This macro determines whether to use the JCR section to register
!      Java classes. By default, TARGET_USE_JCR_SECTION is defined to 1
!      if both SUPPORTS_WEAK and TARGET_HAVE_NAMED_SECTIONS are true,
!      else 0.
  
   -- Macro: OBJC_JBLEN
       This macro determines the size of the objective C jump buffer for
!      the NeXT runtime. By default, OBJC_JBLEN is defined to an
       innocuous value.
  
   -- Macro: LIBGCC2_UNWIND_ATTRIBUTE
       Define this macro if any target-specific attributes need to be
!      attached to the functions in `libgcc' that provide low-level
       support for call stack unwinding.  It is used in declarations in
!      `unwind-generic.h' and the associated definitions of those
       functions.
  
   -- Target Hook: void TARGET_UPDATE_STACK_BOUNDARY (void)
--- 38219,38285 ----
   -- Target Hook: const char * TARGET_INVALID_CONVERSION (const_tree
            FROMTYPE, const_tree TOTYPE)
       If defined, this macro returns the diagnostic message when it is
!      invalid to convert from FROMTYPE to TOTYPE, or 'NULL' if validity
       should be determined by the front end.
  
   -- Target Hook: const char * TARGET_INVALID_UNARY_OP (int OP,
            const_tree TYPE)
       If defined, this macro returns the diagnostic message when it is
       invalid to apply operation OP (where unary plus is denoted by
!      'CONVERT_EXPR') to an operand of type TYPE, or 'NULL' if validity
       should be determined by the front end.
  
   -- Target Hook: const char * TARGET_INVALID_BINARY_OP (int OP,
            const_tree TYPE1, const_tree TYPE2)
       If defined, this macro returns the diagnostic message when it is
!      invalid to apply operation OP to operands of types TYPE1 and TYPE2,
!      or 'NULL' if validity should be determined by the front end.
  
   -- Target Hook: const char * TARGET_INVALID_PARAMETER_TYPE (const_tree
            TYPE)
       If defined, this macro returns the diagnostic message when it is
!      invalid for functions to include parameters of type TYPE, or 'NULL'
!      if validity should be determined by the front end.  This is
       currently used only by the C and C++ front ends.
  
   -- Target Hook: const char * TARGET_INVALID_RETURN_TYPE (const_tree
            TYPE)
       If defined, this macro returns the diagnostic message when it is
!      invalid for functions to have return type TYPE, or 'NULL' if
       validity should be determined by the front end.  This is currently
       used only by the C and C++ front ends.
  
   -- Target Hook: tree TARGET_PROMOTED_TYPE (const_tree TYPE)
       If defined, this target hook returns the type to which values of
       TYPE should be promoted when they appear in expressions, analogous
!      to the integer promotions, or 'NULL_TREE' to use the front end's
       normal promotion rules.  This hook is useful when there are
       target-specific types with special promotion rules.  This is
       currently used only by the C and C++ front ends.
  
   -- Target Hook: tree TARGET_CONVERT_TO_TYPE (tree TYPE, tree EXPR)
       If defined, this hook returns the result of converting EXPR to
!      TYPE.  It should return the converted expression, or 'NULL_TREE' to
!      apply the front end's normal conversion rules.  This hook is useful
!      when there are target-specific types with special conversion rules.
!      This is currently used only by the C and C++ front ends.
  
   -- Macro: TARGET_USE_JCR_SECTION
       This macro determines whether to use the JCR section to register
!      Java classes.  By default, TARGET_USE_JCR_SECTION is defined to 1
!      if both SUPPORTS_WEAK and TARGET_HAVE_NAMED_SECTIONS are true, else
!      0.
  
   -- Macro: OBJC_JBLEN
       This macro determines the size of the objective C jump buffer for
!      the NeXT runtime.  By default, OBJC_JBLEN is defined to an
       innocuous value.
  
   -- Macro: LIBGCC2_UNWIND_ATTRIBUTE
       Define this macro if any target-specific attributes need to be
!      attached to the functions in 'libgcc' that provide low-level
       support for call stack unwinding.  It is used in declarations in
!      'unwind-generic.h' and the associated definitions of those
       functions.
  
   -- Target Hook: void TARGET_UPDATE_STACK_BOUNDARY (void)
*************** Here are several miscellaneous parameter
*** 38714,38730 ****
       necessary.
  
   -- Target Hook: rtx TARGET_GET_DRAP_RTX (void)
!      This hook should return an rtx for Dynamic Realign Argument
!      Pointer (DRAP) if a different argument pointer register is needed
!      to access the function's argument list due to stack realignment.
!      Return `NULL' if no DRAP is needed.
  
   -- Target Hook: bool TARGET_ALLOCATE_STACK_SLOTS_FOR_ARGS (void)
       When optimization is disabled, this hook indicates whether or not
       arguments should be allocated to stack slots.  Normally, GCC
       allocates stacks slots for arguments when not optimizing in order
       to make debugging easier.  However, when a function is declared
!      with `__attribute__((naked))', there is no stack frame, and the
       compiler cannot safely move arguments from the registers in which
       they are passed to the stack.  Therefore, this hook should return
       true in general, but false for naked functions.  The default
--- 38287,38303 ----
       necessary.
  
   -- Target Hook: rtx TARGET_GET_DRAP_RTX (void)
!      This hook should return an rtx for Dynamic Realign Argument Pointer
!      (DRAP) if a different argument pointer register is needed to access
!      the function's argument list due to stack realignment.  Return
!      'NULL' if no DRAP is needed.
  
   -- Target Hook: bool TARGET_ALLOCATE_STACK_SLOTS_FOR_ARGS (void)
       When optimization is disabled, this hook indicates whether or not
       arguments should be allocated to stack slots.  Normally, GCC
       allocates stacks slots for arguments when not optimizing in order
       to make debugging easier.  However, when a function is declared
!      with '__attribute__((naked))', there is no stack frame, and the
       compiler cannot safely move arguments from the registers in which
       they are passed to the stack.  Therefore, this hook should return
       true in general, but false for naked functions.  The default
*************** Here are several miscellaneous parameter
*** 38735,38751 ****
       synthesize a constant.  If there is another constant already in a
       register that is close enough in value then it is preferable that
       the new constant is computed from this register using immediate
!      addition or subtraction.  We accomplish this through CSE.  Besides
!      the value of the constant we also add a lower and an upper
!      constant anchor to the available expressions.  These are then
!      queried when encountering new constants.  The anchors are computed
!      by rounding the constant up and down to a multiple of the value of
!      `TARGET_CONST_ANCHOR'.  `TARGET_CONST_ANCHOR' should be the
!      maximum positive value accepted by immediate-add plus one.  We
!      currently assume that the value of `TARGET_CONST_ANCHOR' is a
!      power of 2.  For example, on MIPS, where add-immediate takes a
!      16-bit signed value, `TARGET_CONST_ANCHOR' is set to `0x8000'.
!      The default value is zero, which disables this optimization.
  
   -- Target Hook: unsigned HOST_WIDE_INT TARGET_ASAN_SHADOW_OFFSET (void)
       Return the offset bitwise ored into shifted address to get
--- 38308,38324 ----
       synthesize a constant.  If there is another constant already in a
       register that is close enough in value then it is preferable that
       the new constant is computed from this register using immediate
!      addition or subtraction.  We accomplish this through CSE. Besides
!      the value of the constant we also add a lower and an upper constant
!      anchor to the available expressions.  These are then queried when
!      encountering new constants.  The anchors are computed by rounding
!      the constant up and down to a multiple of the value of
!      'TARGET_CONST_ANCHOR'.  'TARGET_CONST_ANCHOR' should be the maximum
!      positive value accepted by immediate-add plus one.  We currently
!      assume that the value of 'TARGET_CONST_ANCHOR' is a power of 2.
!      For example, on MIPS, where add-immediate takes a 16-bit signed
!      value, 'TARGET_CONST_ANCHOR' is set to '0x8000'.  The default value
!      is zero, which disables this optimization.
  
   -- Target Hook: unsigned HOST_WIDE_INT TARGET_ASAN_SHADOW_OFFSET (void)
       Return the offset bitwise ored into shifted address to get
*************** Here are several miscellaneous parameter
*** 38754,38852 ****
  
   -- Target Hook: unsigned HOST_WIDE_INT TARGET_MEMMODEL_CHECK (unsigned
            HOST_WIDE_INT VAL)
!      Validate target specific memory model mask bits. When NULL no
       target specific memory model bits are allowed.
  
   -- Target Hook: unsigned char TARGET_ATOMIC_TEST_AND_SET_TRUEVAL
       This value should be set if the result written by
!      `atomic_test_and_set' is not exactly 1, i.e. the `bool' `true'.
  
   -- Target Hook: bool TARGET_HAS_IFUNC_P (void)
!      It returns true if the target supports GNU indirect functions.
!      The support includes the assembler, linker and dynamic linker.
!      The default value of this hook is based on target's libc.
  
!  -- Target Hook: unsigned int TARGET_ATOMIC_ALIGN_FOR_MODE
!           (machine_mode MODE)
       If defined, this function returns an appropriate alignment in bits
       for an atomic object of machine_mode MODE.  If 0 is returned then
       the default alignment for the specified mode is used.
  
!  -- Target Hook: void TARGET_ATOMIC_ASSIGN_EXPAND_FENV (tree *HOLD,
!           tree *CLEAR, tree *UPDATE)
       ISO C11 requires atomic compound assignments that may raise
       floating-point exceptions to raise exceptions corresponding to the
       arithmetic operation whose result was successfully stored in a
       compare-and-exchange sequence.  This requires code equivalent to
!      calls to `feholdexcept', `feclearexcept' and `feupdateenv' to be
       generated at appropriate points in the compare-and-exchange
!      sequence.  This hook should set `*HOLD' to an expression
!      equivalent to the call to `feholdexcept', `*CLEAR' to an
!      expression equivalent to the call to `feclearexcept' and `*UPDATE'
!      to an expression equivalent to the call to `feupdateenv'.  The
!      three expressions are `NULL_TREE' on entry to the hook and may be
!      left as `NULL_TREE' if no code is required in a particular place.
!      The default implementation leaves all three expressions as
!      `NULL_TREE'.  The `__atomic_feraiseexcept' function from
!      `libatomic' may be of use as part of the code generated in
!      `*UPDATE'.
  
   -- Target Hook: void TARGET_RECORD_OFFLOAD_SYMBOL (tree)
       Used when offloaded functions are seen in the compilation unit and
!      no named sections are available.  It is called once for each
!      symbol that must be recorded in the offload function and variable
!      table.
  
   -- Target Hook: char * TARGET_OFFLOAD_OPTIONS (void)
       Used when writing out the list of options into an LTO file.  It
       should translate any relevant target-specific options (such as the
!      ABI in use) into one of the `-foffload' options that exist as a
       common interface to express such options.  It should return a
       string containing these options, separated by spaces, which the
       caller will free.
  
- 
   -- Macro: TARGET_SUPPORTS_WIDE_INT
!      On older ports, large integers are stored in `CONST_DOUBLE' rtl
!      objects.  Newer ports define `TARGET_SUPPORTS_WIDE_INT' to be
       nonzero to indicate that large integers are stored in
!      `CONST_WIDE_INT' rtl objects.  The `CONST_WIDE_INT' allows very
!      large integer constants to be represented.  `CONST_DOUBLE' is
!      limited to twice the size of the host's `HOST_WIDE_INT'
       representation.
  
       Converting a port mostly requires looking for the places where
!      `CONST_DOUBLE's are used with `VOIDmode' and replacing that code
!      with code that accesses `CONST_WIDE_INT's.  `"grep -i
       const_double"' at the port level gets you to 95% of the changes
!      that need to be made.  There are a few places that require a
!      deeper look.
  
!         * There is no equivalent to `hval' and `lval' for
!           `CONST_WIDE_INT's.  This would be difficult to express in the
            md language since there are a variable number of elements.
  
!           Most ports only check that `hval' is either 0 or -1 to see if
            the value is small.  As mentioned above, this will no longer
!           be necessary since small constants are always `CONST_INT'.
!           Of course there are still a few exceptions, the alpha's
            constraint used by the zap instruction certainly requires
            careful examination by C code.  However, all the current code
            does is pass the hval and lval to C code, so evolving the c
!           code to look at the `CONST_WIDE_INT' is not really a large
            change.
  
          * Because there is no standard template that ports use to
!           materialize constants, there is likely to be some futzing
!           that is unique to each port in this code.
  
          * The rtx costs may have to be adjusted to properly account for
!           larger constants that are represented as `CONST_WIDE_INT'.
  
       All and all it does not take long to convert ports that the
       maintainer is familiar with.
  
- 
  
  File: gccint.info,  Node: Host Config,  Next: Fragments,  Prev: Target Macros,  Up: Top
  
--- 38327,38422 ----
  
   -- Target Hook: unsigned HOST_WIDE_INT TARGET_MEMMODEL_CHECK (unsigned
            HOST_WIDE_INT VAL)
!      Validate target specific memory model mask bits.  When NULL no
       target specific memory model bits are allowed.
  
   -- Target Hook: unsigned char TARGET_ATOMIC_TEST_AND_SET_TRUEVAL
       This value should be set if the result written by
!      'atomic_test_and_set' is not exactly 1, i.e.  the 'bool' 'true'.
  
   -- Target Hook: bool TARGET_HAS_IFUNC_P (void)
!      It returns true if the target supports GNU indirect functions.  The
!      support includes the assembler, linker and dynamic linker.  The
!      default value of this hook is based on target's libc.
  
!  -- Target Hook: unsigned int TARGET_ATOMIC_ALIGN_FOR_MODE (machine_mode
!           MODE)
       If defined, this function returns an appropriate alignment in bits
       for an atomic object of machine_mode MODE.  If 0 is returned then
       the default alignment for the specified mode is used.
  
!  -- Target Hook: void TARGET_ATOMIC_ASSIGN_EXPAND_FENV (tree *HOLD, tree
!           *CLEAR, tree *UPDATE)
       ISO C11 requires atomic compound assignments that may raise
       floating-point exceptions to raise exceptions corresponding to the
       arithmetic operation whose result was successfully stored in a
       compare-and-exchange sequence.  This requires code equivalent to
!      calls to 'feholdexcept', 'feclearexcept' and 'feupdateenv' to be
       generated at appropriate points in the compare-and-exchange
!      sequence.  This hook should set '*HOLD' to an expression equivalent
!      to the call to 'feholdexcept', '*CLEAR' to an expression equivalent
!      to the call to 'feclearexcept' and '*UPDATE' to an expression
!      equivalent to the call to 'feupdateenv'.  The three expressions are
!      'NULL_TREE' on entry to the hook and may be left as 'NULL_TREE' if
!      no code is required in a particular place.  The default
!      implementation leaves all three expressions as 'NULL_TREE'.  The
!      '__atomic_feraiseexcept' function from 'libatomic' may be of use as
!      part of the code generated in '*UPDATE'.
  
   -- Target Hook: void TARGET_RECORD_OFFLOAD_SYMBOL (tree)
       Used when offloaded functions are seen in the compilation unit and
!      no named sections are available.  It is called once for each symbol
!      that must be recorded in the offload function and variable table.
  
   -- Target Hook: char * TARGET_OFFLOAD_OPTIONS (void)
       Used when writing out the list of options into an LTO file.  It
       should translate any relevant target-specific options (such as the
!      ABI in use) into one of the '-foffload' options that exist as a
       common interface to express such options.  It should return a
       string containing these options, separated by spaces, which the
       caller will free.
  
   -- Macro: TARGET_SUPPORTS_WIDE_INT
! 
!      On older ports, large integers are stored in 'CONST_DOUBLE' rtl
!      objects.  Newer ports define 'TARGET_SUPPORTS_WIDE_INT' to be
       nonzero to indicate that large integers are stored in
!      'CONST_WIDE_INT' rtl objects.  The 'CONST_WIDE_INT' allows very
!      large integer constants to be represented.  'CONST_DOUBLE' is
!      limited to twice the size of the host's 'HOST_WIDE_INT'
       representation.
  
       Converting a port mostly requires looking for the places where
!      'CONST_DOUBLE's are used with 'VOIDmode' and replacing that code
!      with code that accesses 'CONST_WIDE_INT's.  '"grep -i
       const_double"' at the port level gets you to 95% of the changes
!      that need to be made.  There are a few places that require a deeper
!      look.
  
!         * There is no equivalent to 'hval' and 'lval' for
!           'CONST_WIDE_INT's.  This would be difficult to express in the
            md language since there are a variable number of elements.
  
!           Most ports only check that 'hval' is either 0 or -1 to see if
            the value is small.  As mentioned above, this will no longer
!           be necessary since small constants are always 'CONST_INT'.  Of
!           course there are still a few exceptions, the alpha's
            constraint used by the zap instruction certainly requires
            careful examination by C code.  However, all the current code
            does is pass the hval and lval to C code, so evolving the c
!           code to look at the 'CONST_WIDE_INT' is not really a large
            change.
  
          * Because there is no standard template that ports use to
!           materialize constants, there is likely to be some futzing that
!           is unique to each port in this code.
  
          * The rtx costs may have to be adjusted to properly account for
!           larger constants that are represented as 'CONST_WIDE_INT'.
  
       All and all it does not take long to convert ports that the
       maintainer is familiar with.
  
  
  File: gccint.info,  Node: Host Config,  Next: Fragments,  Prev: Target Macros,  Up: Top
  
*************** File: gccint.info,  Node: Host Config,
*** 38854,38876 ****
  *********************
  
  Most details about the machine and system on which the compiler is
! actually running are detected by the `configure' script.  Some things
! are impossible for `configure' to detect; these are described in two
! ways, either by macros defined in a file named `xm-MACHINE.h' or by
! hook functions in the file specified by the OUT_HOST_HOOK_OBJ variable
! in `config.gcc'.  (The intention is that very few hosts will need a
! header file but nearly every fully supported host will need to override
! some hooks.)
  
   If you need to define only a few macros, and they have simple
! definitions, consider using the `xm_defines' variable in your
! `config.gcc' entry instead of creating a host configuration header.
  *Note System Config::.
  
  * Menu:
  
  * Host Common::         Things every host probably needs implemented.
! * Filesystem::          Your host can't have the letter `a' in filenames?
  * Host Misc::           Rare configuration options for hosts.
  
  
--- 38424,38446 ----
  *********************
  
  Most details about the machine and system on which the compiler is
! actually running are detected by the 'configure' script.  Some things
! are impossible for 'configure' to detect; these are described in two
! ways, either by macros defined in a file named 'xm-MACHINE.h' or by hook
! functions in the file specified by the OUT_HOST_HOOK_OBJ variable in
! 'config.gcc'.  (The intention is that very few hosts will need a header
! file but nearly every fully supported host will need to override some
! hooks.)
  
   If you need to define only a few macros, and they have simple
! definitions, consider using the 'xm_defines' variable in your
! 'config.gcc' entry instead of creating a host configuration header.
  *Note System Config::.
  
  * Menu:
  
  * Host Common::         Things every host probably needs implemented.
! * Filesystem::          Your host can't have the letter 'a' in filenames?
  * Host Misc::           Rare configuration options for hosts.
  
  
*************** File: gccint.info,  Node: Host Common,
*** 38882,38888 ****
  Some things are just not portable, even between similar operating
  systems, and are too difficult for autoconf to detect.  They get
  implemented using hook functions in the file specified by the
! HOST_HOOK_OBJ variable in `config.gcc'.
  
   -- Host Hook: void HOST_HOOKS_EXTRA_SIGNALS (void)
       This host hook is used to set up handling for extra signals.  The
--- 38452,38458 ----
  Some things are just not portable, even between similar operating
  systems, and are too difficult for autoconf to detect.  They get
  implemented using hook functions in the file specified by the
! HOST_HOOK_OBJ variable in 'config.gcc'.
  
   -- Host Hook: void HOST_HOOKS_EXTRA_SIGNALS (void)
       This host hook is used to set up handling for extra signals.  The
*************** HOST_HOOK_OBJ variable in `config.gcc'.
*** 38892,38911 ****
            FD)
       This host hook returns the address of some space that is likely to
       be free in some subsequent invocation of the compiler.  We intend
!      to load the PCH data at this address such that the data need not
!      be relocated.  The area should be able to hold SIZE bytes.  If the
!      host uses `mmap', FD is an open file descriptor that can be used
       for probing.
  
!  -- Host Hook: int HOST_HOOKS_GT_PCH_USE_ADDRESS (void * ADDRESS,
!           size_t SIZE, int FD, size_t OFFSET)
!      This host hook is called when a PCH file is about to be loaded.
!      We want to load SIZE bytes from FD at OFFSET into memory at
!      ADDRESS.  The given address will be the result of a previous
!      invocation of `HOST_HOOKS_GT_PCH_GET_ADDRESS'.  Return -1 if we
!      couldn't allocate SIZE bytes at ADDRESS.  Return 0 if the memory
!      is allocated but the data is not loaded.  Return 1 if the hook has
!      performed everything.
  
       If the implementation uses reserved address space, free any
       reserved space beyond SIZE, regardless of the return value.  If no
--- 38462,38480 ----
            FD)
       This host hook returns the address of some space that is likely to
       be free in some subsequent invocation of the compiler.  We intend
!      to load the PCH data at this address such that the data need not be
!      relocated.  The area should be able to hold SIZE bytes.  If the
!      host uses 'mmap', FD is an open file descriptor that can be used
       for probing.
  
!  -- Host Hook: int HOST_HOOKS_GT_PCH_USE_ADDRESS (void * ADDRESS, size_t
!           SIZE, int FD, size_t OFFSET)
!      This host hook is called when a PCH file is about to be loaded.  We
!      want to load SIZE bytes from FD at OFFSET into memory at ADDRESS.
!      The given address will be the result of a previous invocation of
!      'HOST_HOOKS_GT_PCH_GET_ADDRESS'.  Return -1 if we couldn't allocate
!      SIZE bytes at ADDRESS.  Return 0 if the memory is allocated but the
!      data is not loaded.  Return 1 if the hook has performed everything.
  
       If the implementation uses reserved address space, free any
       reserved space beyond SIZE, regardless of the return value.  If no
*************** File: gccint.info,  Node: Filesystem,  N
*** 38931,38988 ****
  
  GCC needs to know a number of things about the semantics of the host
  machine's filesystem.  Filesystems with Unix and MS-DOS semantics are
! automatically detected.  For other systems, you can define the
! following macros in `xm-MACHINE.h'.
  
! `HAVE_DOS_BASED_FILE_SYSTEM'
!      This macro is automatically defined by `system.h' if the host file
       system obeys the semantics defined by MS-DOS instead of Unix.  DOS
       file systems are case insensitive, file specifications may begin
!      with a drive letter, and both forward slash and backslash (`/' and
!      `\') are directory separators.
  
! `DIR_SEPARATOR'
! `DIR_SEPARATOR_2'
       If defined, these macros expand to character constants specifying
       separators for directory names within a file specification.
!      `system.h' will automatically give them appropriate values on Unix
       and MS-DOS file systems.  If your file system is neither of these,
!      define one or both appropriately in `xm-MACHINE.h'.
  
       However, operating systems like VMS, where constructing a pathname
       is more complicated than just stringing together directory names
       separated by a special character, should not define either of these
       macros.
  
! `PATH_SEPARATOR'
       If defined, this macro should expand to a character constant
       specifying the separator for elements of search paths.  The default
!      value is a colon (`:').  DOS-based systems usually, but not
!      always, use semicolon (`;').
  
! `VMS'
       Define this macro if the host system is VMS.
  
! `HOST_OBJECT_SUFFIX'
       Define this macro to be a C string representing the suffix for
       object files on your host machine.  If you do not define this
!      macro, GCC will use `.o' as the suffix for object files.
  
! `HOST_EXECUTABLE_SUFFIX'
       Define this macro to be a C string representing the suffix for
       executable files on your host machine.  If you do not define this
       macro, GCC will use the null string as the suffix for executable
       files.
  
! `HOST_BIT_BUCKET'
       A pathname defined by the host operating system, which can be
!      opened as a file and written to, but all the information written
!      is discarded.  This is commonly known as a "bit bucket" or "null
!      device".  If you do not define this macro, GCC will use
!      `/dev/null' as the bit bucket.  If the host does not support a bit
!      bucket, define this macro to an invalid filename.
  
! `UPDATE_PATH_HOST_CANONICALIZE (PATH)'
       If defined, a C statement (sans semicolon) that performs
       host-dependent canonicalization when a path used in a compilation
       driver or preprocessor is canonicalized.  PATH is a malloc-ed path
--- 38500,38557 ----
  
  GCC needs to know a number of things about the semantics of the host
  machine's filesystem.  Filesystems with Unix and MS-DOS semantics are
! automatically detected.  For other systems, you can define the following
! macros in 'xm-MACHINE.h'.
  
! 'HAVE_DOS_BASED_FILE_SYSTEM'
!      This macro is automatically defined by 'system.h' if the host file
       system obeys the semantics defined by MS-DOS instead of Unix.  DOS
       file systems are case insensitive, file specifications may begin
!      with a drive letter, and both forward slash and backslash ('/' and
!      '\') are directory separators.
  
! 'DIR_SEPARATOR'
! 'DIR_SEPARATOR_2'
       If defined, these macros expand to character constants specifying
       separators for directory names within a file specification.
!      'system.h' will automatically give them appropriate values on Unix
       and MS-DOS file systems.  If your file system is neither of these,
!      define one or both appropriately in 'xm-MACHINE.h'.
  
       However, operating systems like VMS, where constructing a pathname
       is more complicated than just stringing together directory names
       separated by a special character, should not define either of these
       macros.
  
! 'PATH_SEPARATOR'
       If defined, this macro should expand to a character constant
       specifying the separator for elements of search paths.  The default
!      value is a colon (':').  DOS-based systems usually, but not always,
!      use semicolon (';').
  
! 'VMS'
       Define this macro if the host system is VMS.
  
! 'HOST_OBJECT_SUFFIX'
       Define this macro to be a C string representing the suffix for
       object files on your host machine.  If you do not define this
!      macro, GCC will use '.o' as the suffix for object files.
  
! 'HOST_EXECUTABLE_SUFFIX'
       Define this macro to be a C string representing the suffix for
       executable files on your host machine.  If you do not define this
       macro, GCC will use the null string as the suffix for executable
       files.
  
! 'HOST_BIT_BUCKET'
       A pathname defined by the host operating system, which can be
!      opened as a file and written to, but all the information written is
!      discarded.  This is commonly known as a "bit bucket" or "null
!      device".  If you do not define this macro, GCC will use '/dev/null'
!      as the bit bucket.  If the host does not support a bit bucket,
!      define this macro to an invalid filename.
  
! 'UPDATE_PATH_HOST_CANONICALIZE (PATH)'
       If defined, a C statement (sans semicolon) that performs
       host-dependent canonicalization when a path used in a compilation
       driver or preprocessor is canonicalized.  PATH is a malloc-ed path
*************** following macros in `xm-MACHINE.h'.
*** 38990,39008 ****
       into a different buffer, the old path should be freed and the new
       buffer should have been allocated with malloc.
  
! `DUMPFILE_FORMAT'
       Define this macro to be a C string representing the format to use
       for constructing the index part of debugging dump file names.  The
!      resultant string must fit in fifteen bytes.  The full filename
!      will be the concatenation of: the prefix of the assembler file
!      name, the string resulting from applying this format to an index
!      number, and a string unique to each dump file kind, e.g. `rtl'.
  
!      If you do not define this macro, GCC will use `.%02d.'.  You should
       define this macro if using the default will create an invalid file
       name.
  
! `DELETE_IF_ORDINARY'
       Define this macro to be a C statement (sans semicolon) that
       performs host-dependent removal of ordinary temp files in the
       compilation driver.
--- 38559,38577 ----
       into a different buffer, the old path should be freed and the new
       buffer should have been allocated with malloc.
  
! 'DUMPFILE_FORMAT'
       Define this macro to be a C string representing the format to use
       for constructing the index part of debugging dump file names.  The
!      resultant string must fit in fifteen bytes.  The full filename will
!      be the concatenation of: the prefix of the assembler file name, the
!      string resulting from applying this format to an index number, and
!      a string unique to each dump file kind, e.g. 'rtl'.
  
!      If you do not define this macro, GCC will use '.%02d.'.  You should
       define this macro if using the default will create an invalid file
       name.
  
! 'DELETE_IF_ORDINARY'
       Define this macro to be a C statement (sans semicolon) that
       performs host-dependent removal of ordinary temp files in the
       compilation driver.
*************** following macros in `xm-MACHINE.h'.
*** 39012,39020 ****
       reliably remove the temp file as, for example, on VMS which allows
       multiple versions of a file.
  
! `HOST_LACKS_INODE_NUMBERS'
!      Define this macro if the host filesystem does not report
!      meaningful inode numbers in struct stat.
  
  
  File: gccint.info,  Node: Host Misc,  Prev: Filesystem,  Up: Host Config
--- 38581,38589 ----
       reliably remove the temp file as, for example, on VMS which allows
       multiple versions of a file.
  
! 'HOST_LACKS_INODE_NUMBERS'
!      Define this macro if the host filesystem does not report meaningful
!      inode numbers in struct stat.
  
  
  File: gccint.info,  Node: Host Misc,  Prev: Filesystem,  Up: Host Config
*************** File: gccint.info,  Node: Host Misc,  Pr
*** 39022,39078 ****
  18.3 Host Misc
  ==============
  
! `FATAL_EXIT_CODE'
       A C expression for the status code to be returned when the compiler
       exits after serious errors.  The default is the system-provided
!      macro `EXIT_FAILURE', or `1' if the system doesn't define that
       macro.  Define this macro only if these defaults are incorrect.
  
! `SUCCESS_EXIT_CODE'
       A C expression for the status code to be returned when the compiler
       exits without serious errors.  (Warnings are not serious errors.)
!      The default is the system-provided macro `EXIT_SUCCESS', or `0' if
       the system doesn't define that macro.  Define this macro only if
       these defaults are incorrect.
  
! `USE_C_ALLOCA'
       Define this macro if GCC should use the C implementation of
!      `alloca' provided by `libiberty.a'.  This only affects how some
       parts of the compiler itself allocate memory.  It does not change
       code generation.
  
!      When GCC is built with a compiler other than itself, the C `alloca'
       is always used.  This is because most other implementations have
       serious bugs.  You should define this macro only on a system where
!      no stack-based `alloca' can possibly work.  For instance, if a
       system has a small limit on the size of the stack, GCC's builtin
!      `alloca' will not work reliably.
  
! `COLLECT2_HOST_INITIALIZATION'
       If defined, a C statement (sans semicolon) that performs
!      host-dependent initialization when `collect2' is being initialized.
  
! `GCC_DRIVER_HOST_INITIALIZATION'
       If defined, a C statement (sans semicolon) that performs
       host-dependent initialization when a compilation driver is being
       initialized.
  
! `HOST_LONG_LONG_FORMAT'
!      If defined, the string used to indicate an argument of type `long
!      long' to functions like `printf'.  The default value is `"ll"'.
  
! `HOST_LONG_FORMAT'
!      If defined, the string used to indicate an argument of type `long'
!      to functions like `printf'.  The default value is `"l"'.
  
! `HOST_PTR_PRINTF'
!      If defined, the string used to indicate an argument of type `void
!      *' to functions like `printf'.  The default value is `"%p"'.
  
!  In addition, if `configure' generates an incorrect definition of any
! of the macros in `auto-host.h', you can override that definition in a
! host configuration header.  If you need to do this, first see if it is
! possible to fix `configure'.
  
  
  File: gccint.info,  Node: Fragments,  Next: Collect2,  Prev: Host Config,  Up: Top
--- 38591,38647 ----
  18.3 Host Misc
  ==============
  
! 'FATAL_EXIT_CODE'
       A C expression for the status code to be returned when the compiler
       exits after serious errors.  The default is the system-provided
!      macro 'EXIT_FAILURE', or '1' if the system doesn't define that
       macro.  Define this macro only if these defaults are incorrect.
  
! 'SUCCESS_EXIT_CODE'
       A C expression for the status code to be returned when the compiler
       exits without serious errors.  (Warnings are not serious errors.)
!      The default is the system-provided macro 'EXIT_SUCCESS', or '0' if
       the system doesn't define that macro.  Define this macro only if
       these defaults are incorrect.
  
! 'USE_C_ALLOCA'
       Define this macro if GCC should use the C implementation of
!      'alloca' provided by 'libiberty.a'.  This only affects how some
       parts of the compiler itself allocate memory.  It does not change
       code generation.
  
!      When GCC is built with a compiler other than itself, the C 'alloca'
       is always used.  This is because most other implementations have
       serious bugs.  You should define this macro only on a system where
!      no stack-based 'alloca' can possibly work.  For instance, if a
       system has a small limit on the size of the stack, GCC's builtin
!      'alloca' will not work reliably.
  
! 'COLLECT2_HOST_INITIALIZATION'
       If defined, a C statement (sans semicolon) that performs
!      host-dependent initialization when 'collect2' is being initialized.
  
! 'GCC_DRIVER_HOST_INITIALIZATION'
       If defined, a C statement (sans semicolon) that performs
       host-dependent initialization when a compilation driver is being
       initialized.
  
! 'HOST_LONG_LONG_FORMAT'
!      If defined, the string used to indicate an argument of type 'long
!      long' to functions like 'printf'.  The default value is '"ll"'.
  
! 'HOST_LONG_FORMAT'
!      If defined, the string used to indicate an argument of type 'long'
!      to functions like 'printf'.  The default value is '"l"'.
  
! 'HOST_PTR_PRINTF'
!      If defined, the string used to indicate an argument of type 'void
!      *' to functions like 'printf'.  The default value is '"%p"'.
  
!  In addition, if 'configure' generates an incorrect definition of any of
! the macros in 'auto-host.h', you can override that definition in a host
! configuration header.  If you need to do this, first see if it is
! possible to fix 'configure'.
  
  
  File: gccint.info,  Node: Fragments,  Next: Collect2,  Prev: Host Config,  Up: Top
*************** File: gccint.info,  Node: Fragments,  Ne
*** 39080,39107 ****
  19 Makefile Fragments
  *********************
  
! When you configure GCC using the `configure' script, it will construct
! the file `Makefile' from the template file `Makefile.in'.  When it does
! this, it can incorporate makefile fragments from the `config'
! directory.  These are used to set Makefile parameters that are not
! amenable to being calculated by autoconf.  The list of fragments to
! incorporate is set by `config.gcc' (and occasionally `config.build' and
! `config.host'); *Note System Config::.
  
!  Fragments are named either `t-TARGET' or `x-HOST', depending on
! whether they are relevant to configuring GCC to produce code for a
! particular target, or to configuring GCC to run on a particular host.
! Here TARGET and HOST are mnemonics which usually have some relationship
! to the canonical system name, but no formal connection.
  
   If these files do not exist, it means nothing needs to be added for a
! given target or host.  Most targets need a few `t-TARGET' fragments,
! but needing `x-HOST' fragments is rare.
  
  * Menu:
  
! * Target Fragment:: Writing `t-TARGET' files.
! * Host Fragment::   Writing `x-HOST' files.
  
  
  File: gccint.info,  Node: Target Fragment,  Next: Host Fragment,  Up: Fragments
--- 38649,38676 ----
  19 Makefile Fragments
  *********************
  
! When you configure GCC using the 'configure' script, it will construct
! the file 'Makefile' from the template file 'Makefile.in'.  When it does
! this, it can incorporate makefile fragments from the 'config' directory.
! These are used to set Makefile parameters that are not amenable to being
! calculated by autoconf.  The list of fragments to incorporate is set by
! 'config.gcc' (and occasionally 'config.build' and 'config.host'); *Note
! System Config::.
  
!  Fragments are named either 't-TARGET' or 'x-HOST', depending on whether
! they are relevant to configuring GCC to produce code for a particular
! target, or to configuring GCC to run on a particular host.  Here TARGET
! and HOST are mnemonics which usually have some relationship to the
! canonical system name, but no formal connection.
  
   If these files do not exist, it means nothing needs to be added for a
! given target or host.  Most targets need a few 't-TARGET' fragments, but
! needing 'x-HOST' fragments is rare.
  
  * Menu:
  
! * Target Fragment:: Writing 't-TARGET' files.
! * Host Fragment::   Writing 'x-HOST' files.
  
  
  File: gccint.info,  Node: Target Fragment,  Next: Host Fragment,  Up: Fragments
*************** File: gccint.info,  Node: Target Fragmen
*** 39111,39279 ****
  
  Target makefile fragments can set these Makefile variables.
  
! `LIBGCC2_CFLAGS'
!      Compiler flags to use when compiling `libgcc2.c'.
  
! `LIB2FUNCS_EXTRA'
       A list of source file names to be compiled or assembled and
!      inserted into `libgcc.a'.
  
! `CRTSTUFF_T_CFLAGS'
!      Special flags used when compiling `crtstuff.c'.  *Note
       Initialization::.
  
! `CRTSTUFF_T_CFLAGS_S'
!      Special flags used when compiling `crtstuff.c' for shared linking.
!      Used if you use `crtbeginS.o' and `crtendS.o' in `EXTRA-PARTS'.
       *Note Initialization::.
  
! `MULTILIB_OPTIONS'
       For some targets, invoking GCC in different ways produces objects
       that can not be linked together.  For example, for some targets GCC
       produces both big and little endian code.  For these targets, you
!      must arrange for multiple versions of `libgcc.a' to be compiled,
       one for each set of incompatible options.  When GCC invokes the
!      linker, it arranges to link in the right version of `libgcc.a',
       based on the command line options used.
  
!      The `MULTILIB_OPTIONS' macro lists the set of options for which
!      special versions of `libgcc.a' must be built.  Write options that
       are mutually incompatible side by side, separated by a slash.
       Write options that may be used together separated by a space.  The
       build procedure will build all combinations of compatible options.
  
!      For example, if you set `MULTILIB_OPTIONS' to `m68000/m68020
!      msoft-float', `Makefile' will build special versions of `libgcc.a'
!      using the following sets of options:  `-m68000', `-m68020',
!      `-msoft-float', `-m68000 -msoft-float', and `-m68020 -msoft-float'.
  
! `MULTILIB_DIRNAMES'
!      If `MULTILIB_OPTIONS' is used, this variable specifies the
       directory names that should be used to hold the various libraries.
!      Write one element in `MULTILIB_DIRNAMES' for each element in
!      `MULTILIB_OPTIONS'.  If `MULTILIB_DIRNAMES' is not used, the
!      default value will be `MULTILIB_OPTIONS', with all slashes treated
       as spaces.
  
!      `MULTILIB_DIRNAMES' describes the multilib directories using GCC
       conventions and is applied to directories that are part of the GCC
       installation.  When multilib-enabled, the compiler will add a
       subdirectory of the form PREFIX/MULTILIB before each directory in
       the search path for libraries and crt files.
  
!      For example, if `MULTILIB_OPTIONS' is set to `m68000/m68020
!      msoft-float', then the default value of `MULTILIB_DIRNAMES' is
!      `m68000 m68020 msoft-float'.  You may specify a different value if
       you desire a different set of directory names.
  
! `MULTILIB_MATCHES'
!      Sometimes the same option may be written in two different ways.
!      If an option is listed in `MULTILIB_OPTIONS', GCC needs to know
!      about any synonyms.  In that case, set `MULTILIB_MATCHES' to a
!      list of items of the form `option=option' to describe all relevant
!      synonyms.  For example, `m68000=mc68000 m68020=mc68020'.
  
! `MULTILIB_EXCEPTIONS'
!      Sometimes when there are multiple sets of `MULTILIB_OPTIONS' being
       specified, there are combinations that should not be built.  In
!      that case, set `MULTILIB_EXCEPTIONS' to be all of the switch
       exceptions in shell case syntax that should not be built.
  
       For example the ARM processor cannot execute both hardware floating
       point instructions and the reduced size THUMB instructions at the
       same time, so there is no need to build libraries with both of
!      these options enabled.  Therefore `MULTILIB_EXCEPTIONS' is set to:
            *mthumb/*mhard-float*
  
! `MULTILIB_REQUIRED'
       Sometimes when there are only a few combinations are required, it
!      would be a big effort to come up with a `MULTILIB_EXCEPTIONS' list
       to cover all undesired ones.  In such a case, just listing all the
!      required combinations in `MULTILIB_REQUIRED' would be more
       straightforward.
  
!      The way to specify the entries in `MULTILIB_REQUIRED' is same with
!      the way used for `MULTILIB_EXCEPTIONS', only this time what are
       required will be specified.  Suppose there are multiple sets of
!      `MULTILIB_OPTIONS' and only two combinations are required, one for
       ARMv7-M and one for ARMv7-R with hard floating-point ABI and FPU,
!      the `MULTILIB_REQUIRED' can be set to:
!           `MULTILIB_REQUIRED' =  mthumb/march=armv7-m
!           `MULTILIB_REQUIRED' += march=armv7-r/mfloat-abi=hard/mfpu=vfpv3-d16
  
!      The `MULTILIB_REQUIRED' can be used together with
!      `MULTILIB_EXCEPTIONS'.  The option combinations generated from
!      `MULTILIB_OPTIONS' will be filtered by `MULTILIB_EXCEPTIONS' and
!      then by `MULTILIB_REQUIRED'.
  
! `MULTILIB_REUSE'
       Sometimes it is desirable to reuse one existing multilib for
       different sets of options.  Such kind of reuse can minimize the
       number of multilib variants.  And for some targets it is better to
       reuse an existing multilib than to fall back to default multilib
       when there is no corresponding multilib.  This can be done by
!      adding reuse rules to `MULTILIB_REUSE'.
  
       A reuse rule is comprised of two parts connected by equality sign.
       The left part is option set used to build multilib and the right
       part is option set that will reuse this multilib.  The order of
       options in the left part matters and should be same with those
!      specified in `MULTILIB_REQUIRED' or aligned with order in
!      `MULTILIB_OPTIONS'.  There is no such limitation for options in
       right part as we don't build multilib from them.  But the equality
       sign in both parts should be replaced with period.
  
!      The `MULTILIB_REUSE' is different from `MULTILIB_MATCHES' in that
       it sets up relations between two option sets rather than two
       options.  Here is an example to demo how we reuse libraries built
       in Thumb mode for applications built in ARM mode:
!           `MULTILIB_REUSE' = mthumb/march.armv7-r=marm/march.armv7-r
  
!      Before the advent of `MULTILIB_REUSE', GCC select multilib by
!      comparing command line options with options used to build
!      multilib.  The `MULTILIB_REUSE' is complementary to that way.
!      Only when the original comparison matches nothing it will work to
!      see if it is OK to reuse some existing multilib.
  
! `MULTILIB_EXTRA_OPTS'
       Sometimes it is desirable that when building multiple versions of
!      `libgcc.a' certain options should always be passed on to the
!      compiler.  In that case, set `MULTILIB_EXTRA_OPTS' to be the list
       of options to be used for all builds.  If you set this, you should
!      probably set `CRTSTUFF_T_CFLAGS' to a dash followed by it.
  
! `MULTILIB_OSDIRNAMES'
!      If `MULTILIB_OPTIONS' is used, this variable specifies a list of
       subdirectory names, that are used to modify the search path
!      depending on the chosen multilib.  Unlike `MULTILIB_DIRNAMES',
!      `MULTILIB_OSDIRNAMES' describes the multilib directories using
       operating systems conventions, and is applied to the directories
!      such as `lib' or those in the `LIBRARY_PATH' environment variable.
!      The format is either the same as of `MULTILIB_DIRNAMES', or a set
!      of mappings.  When it is the same as `MULTILIB_DIRNAMES', it
       describes the multilib directories using operating system
       conventions, rather than GCC conventions.  When it is a set of
       mappings of the form GCCDIR=OSDIR, the left side gives the GCC
       convention and the right gives the equivalent OS defined location.
!      If the OSDIR part begins with a `!', GCC will not search in the
       non-multilib directory and use exclusively the multilib directory.
       Otherwise, the compiler will examine the search path for libraries
       and crt files twice; the first time it will add MULTILIB to each
       directory in the search path, the second it will not.
  
       For configurations that support both multilib and multiarch,
!      `MULTILIB_OSDIRNAMES' also encodes the multiarch name, thus
!      subsuming `MULTIARCH_DIRNAME'.  The multiarch name is appended to
       each directory name, separated by a colon (e.g.
!      `../lib32:i386-linux-gnu').
  
       Each multiarch subdirectory will be searched before the
       corresponding OS multilib directory, for example
!      `/lib/i386-linux-gnu' before `/lib/../lib32'.  The multiarch name
       will also be used to modify the system header search path, as
!      explained for `MULTIARCH_DIRNAME'.
  
! `MULTIARCH_DIRNAME'
       This variable specifies the multiarch name for configurations that
       are multiarch-enabled but not multilibbed configurations.
  
--- 38680,38848 ----
  
  Target makefile fragments can set these Makefile variables.
  
! 'LIBGCC2_CFLAGS'
!      Compiler flags to use when compiling 'libgcc2.c'.
  
! 'LIB2FUNCS_EXTRA'
       A list of source file names to be compiled or assembled and
!      inserted into 'libgcc.a'.
  
! 'CRTSTUFF_T_CFLAGS'
!      Special flags used when compiling 'crtstuff.c'.  *Note
       Initialization::.
  
! 'CRTSTUFF_T_CFLAGS_S'
!      Special flags used when compiling 'crtstuff.c' for shared linking.
!      Used if you use 'crtbeginS.o' and 'crtendS.o' in 'EXTRA-PARTS'.
       *Note Initialization::.
  
! 'MULTILIB_OPTIONS'
       For some targets, invoking GCC in different ways produces objects
       that can not be linked together.  For example, for some targets GCC
       produces both big and little endian code.  For these targets, you
!      must arrange for multiple versions of 'libgcc.a' to be compiled,
       one for each set of incompatible options.  When GCC invokes the
!      linker, it arranges to link in the right version of 'libgcc.a',
       based on the command line options used.
  
!      The 'MULTILIB_OPTIONS' macro lists the set of options for which
!      special versions of 'libgcc.a' must be built.  Write options that
       are mutually incompatible side by side, separated by a slash.
       Write options that may be used together separated by a space.  The
       build procedure will build all combinations of compatible options.
  
!      For example, if you set 'MULTILIB_OPTIONS' to 'm68000/m68020
!      msoft-float', 'Makefile' will build special versions of 'libgcc.a'
!      using the following sets of options: '-m68000', '-m68020',
!      '-msoft-float', '-m68000 -msoft-float', and '-m68020 -msoft-float'.
  
! 'MULTILIB_DIRNAMES'
!      If 'MULTILIB_OPTIONS' is used, this variable specifies the
       directory names that should be used to hold the various libraries.
!      Write one element in 'MULTILIB_DIRNAMES' for each element in
!      'MULTILIB_OPTIONS'.  If 'MULTILIB_DIRNAMES' is not used, the
!      default value will be 'MULTILIB_OPTIONS', with all slashes treated
       as spaces.
  
!      'MULTILIB_DIRNAMES' describes the multilib directories using GCC
       conventions and is applied to directories that are part of the GCC
       installation.  When multilib-enabled, the compiler will add a
       subdirectory of the form PREFIX/MULTILIB before each directory in
       the search path for libraries and crt files.
  
!      For example, if 'MULTILIB_OPTIONS' is set to 'm68000/m68020
!      msoft-float', then the default value of 'MULTILIB_DIRNAMES' is
!      'm68000 m68020 msoft-float'.  You may specify a different value if
       you desire a different set of directory names.
  
! 'MULTILIB_MATCHES'
!      Sometimes the same option may be written in two different ways.  If
!      an option is listed in 'MULTILIB_OPTIONS', GCC needs to know about
!      any synonyms.  In that case, set 'MULTILIB_MATCHES' to a list of
!      items of the form 'option=option' to describe all relevant
!      synonyms.  For example, 'm68000=mc68000 m68020=mc68020'.
  
! 'MULTILIB_EXCEPTIONS'
!      Sometimes when there are multiple sets of 'MULTILIB_OPTIONS' being
       specified, there are combinations that should not be built.  In
!      that case, set 'MULTILIB_EXCEPTIONS' to be all of the switch
       exceptions in shell case syntax that should not be built.
  
       For example the ARM processor cannot execute both hardware floating
       point instructions and the reduced size THUMB instructions at the
       same time, so there is no need to build libraries with both of
!      these options enabled.  Therefore 'MULTILIB_EXCEPTIONS' is set to:
            *mthumb/*mhard-float*
  
! 'MULTILIB_REQUIRED'
       Sometimes when there are only a few combinations are required, it
!      would be a big effort to come up with a 'MULTILIB_EXCEPTIONS' list
       to cover all undesired ones.  In such a case, just listing all the
!      required combinations in 'MULTILIB_REQUIRED' would be more
       straightforward.
  
!      The way to specify the entries in 'MULTILIB_REQUIRED' is same with
!      the way used for 'MULTILIB_EXCEPTIONS', only this time what are
       required will be specified.  Suppose there are multiple sets of
!      'MULTILIB_OPTIONS' and only two combinations are required, one for
       ARMv7-M and one for ARMv7-R with hard floating-point ABI and FPU,
!      the 'MULTILIB_REQUIRED' can be set to:
!           MULTILIB_REQUIRED =  mthumb/march=armv7-m
!           MULTILIB_REQUIRED += march=armv7-r/mfloat-abi=hard/mfpu=vfpv3-d16
  
!      The 'MULTILIB_REQUIRED' can be used together with
!      'MULTILIB_EXCEPTIONS'.  The option combinations generated from
!      'MULTILIB_OPTIONS' will be filtered by 'MULTILIB_EXCEPTIONS' and
!      then by 'MULTILIB_REQUIRED'.
  
! 'MULTILIB_REUSE'
       Sometimes it is desirable to reuse one existing multilib for
       different sets of options.  Such kind of reuse can minimize the
       number of multilib variants.  And for some targets it is better to
       reuse an existing multilib than to fall back to default multilib
       when there is no corresponding multilib.  This can be done by
!      adding reuse rules to 'MULTILIB_REUSE'.
  
       A reuse rule is comprised of two parts connected by equality sign.
       The left part is option set used to build multilib and the right
       part is option set that will reuse this multilib.  The order of
       options in the left part matters and should be same with those
!      specified in 'MULTILIB_REQUIRED' or aligned with order in
!      'MULTILIB_OPTIONS'.  There is no such limitation for options in
       right part as we don't build multilib from them.  But the equality
       sign in both parts should be replaced with period.
  
!      The 'MULTILIB_REUSE' is different from 'MULTILIB_MATCHES' in that
       it sets up relations between two option sets rather than two
       options.  Here is an example to demo how we reuse libraries built
       in Thumb mode for applications built in ARM mode:
!           MULTILIB_REUSE = mthumb/march.armv7-r=marm/march.armv7-r
  
!      Before the advent of 'MULTILIB_REUSE', GCC select multilib by
!      comparing command line options with options used to build multilib.
!      The 'MULTILIB_REUSE' is complementary to that way.  Only when the
!      original comparison matches nothing it will work to see if it is OK
!      to reuse some existing multilib.
  
! 'MULTILIB_EXTRA_OPTS'
       Sometimes it is desirable that when building multiple versions of
!      'libgcc.a' certain options should always be passed on to the
!      compiler.  In that case, set 'MULTILIB_EXTRA_OPTS' to be the list
       of options to be used for all builds.  If you set this, you should
!      probably set 'CRTSTUFF_T_CFLAGS' to a dash followed by it.
  
! 'MULTILIB_OSDIRNAMES'
!      If 'MULTILIB_OPTIONS' is used, this variable specifies a list of
       subdirectory names, that are used to modify the search path
!      depending on the chosen multilib.  Unlike 'MULTILIB_DIRNAMES',
!      'MULTILIB_OSDIRNAMES' describes the multilib directories using
       operating systems conventions, and is applied to the directories
!      such as 'lib' or those in the 'LIBRARY_PATH' environment variable.
!      The format is either the same as of 'MULTILIB_DIRNAMES', or a set
!      of mappings.  When it is the same as 'MULTILIB_DIRNAMES', it
       describes the multilib directories using operating system
       conventions, rather than GCC conventions.  When it is a set of
       mappings of the form GCCDIR=OSDIR, the left side gives the GCC
       convention and the right gives the equivalent OS defined location.
!      If the OSDIR part begins with a '!', GCC will not search in the
       non-multilib directory and use exclusively the multilib directory.
       Otherwise, the compiler will examine the search path for libraries
       and crt files twice; the first time it will add MULTILIB to each
       directory in the search path, the second it will not.
  
       For configurations that support both multilib and multiarch,
!      'MULTILIB_OSDIRNAMES' also encodes the multiarch name, thus
!      subsuming 'MULTIARCH_DIRNAME'.  The multiarch name is appended to
       each directory name, separated by a colon (e.g.
!      '../lib32:i386-linux-gnu').
  
       Each multiarch subdirectory will be searched before the
       corresponding OS multilib directory, for example
!      '/lib/i386-linux-gnu' before '/lib/../lib32'.  The multiarch name
       will also be used to modify the system header search path, as
!      explained for 'MULTIARCH_DIRNAME'.
  
! 'MULTIARCH_DIRNAME'
       This variable specifies the multiarch name for configurations that
       are multiarch-enabled but not multilibbed configurations.
  
*************** Target makefile fragments can set these
*** 39282,39315 ****
       locations.  The compiler will add a multiarch subdirectory of the
       form PREFIX/MULTIARCH before each directory in the library and crt
       search path.  It will also add two directories
!      `LOCAL_INCLUDE_DIR'/MULTIARCH and
!      `NATIVE_SYSTEM_HEADER_DIR'/MULTIARCH) to the system header search
!      path, respectively before `LOCAL_INCLUDE_DIR' and
!      `NATIVE_SYSTEM_HEADER_DIR'.
  
!      `MULTIARCH_DIRNAME' is not used for configurations that support
       both multilib and multiarch.  In that case, multiarch names are
!      encoded in `MULTILIB_OSDIRNAMES' instead.
  
       More documentation about multiarch can be found at
!      `http://wiki.debian.org/Multiarch'.
  
! `SPECS'
!      Unfortunately, setting `MULTILIB_EXTRA_OPTS' is not enough, since
       it does not affect the build of target libraries, at least not the
       build of the default multilib.  One possible work-around is to use
!      `DRIVER_SELF_SPECS' to bring options from the `specs' file as if
!      they had been passed in the compiler driver command line.
!      However, you don't want to be adding these options after the
!      toolchain is installed, so you can instead tweak the `specs' file
!      that will be used during the toolchain build, while you still
!      install the original, built-in `specs'.  The trick is to set
!      `SPECS' to some other filename (say `specs.install'), that will
!      then be created out of the built-in specs, and introduce a
!      `Makefile' rule to generate the `specs' file that's going to be
!      used at build time out of your `specs.install'.
  
! `T_CFLAGS'
       These are extra flags to pass to the C compiler.  They are used
       both when building GCC, and when compiling things with the
       just-built GCC.  This variable is deprecated and should not be
--- 38851,38884 ----
       locations.  The compiler will add a multiarch subdirectory of the
       form PREFIX/MULTIARCH before each directory in the library and crt
       search path.  It will also add two directories
!      'LOCAL_INCLUDE_DIR'/MULTIARCH and
!      'NATIVE_SYSTEM_HEADER_DIR'/MULTIARCH) to the system header search
!      path, respectively before 'LOCAL_INCLUDE_DIR' and
!      'NATIVE_SYSTEM_HEADER_DIR'.
  
!      'MULTIARCH_DIRNAME' is not used for configurations that support
       both multilib and multiarch.  In that case, multiarch names are
!      encoded in 'MULTILIB_OSDIRNAMES' instead.
  
       More documentation about multiarch can be found at
!      <http://wiki.debian.org/Multiarch>.
  
! 'SPECS'
!      Unfortunately, setting 'MULTILIB_EXTRA_OPTS' is not enough, since
       it does not affect the build of target libraries, at least not the
       build of the default multilib.  One possible work-around is to use
!      'DRIVER_SELF_SPECS' to bring options from the 'specs' file as if
!      they had been passed in the compiler driver command line.  However,
!      you don't want to be adding these options after the toolchain is
!      installed, so you can instead tweak the 'specs' file that will be
!      used during the toolchain build, while you still install the
!      original, built-in 'specs'.  The trick is to set 'SPECS' to some
!      other filename (say 'specs.install'), that will then be created out
!      of the built-in specs, and introduce a 'Makefile' rule to generate
!      the 'specs' file that's going to be used at build time out of your
!      'specs.install'.
  
! 'T_CFLAGS'
       These are extra flags to pass to the C compiler.  They are used
       both when building GCC, and when compiling things with the
       just-built GCC.  This variable is deprecated and should not be
*************** File: gccint.info,  Node: Host Fragment,
*** 39321,39399 ****
  19.2 Host Makefile Fragments
  ============================
  
! The use of `x-HOST' fragments is discouraged.  You should only use it
  for makefile dependencies.
  
  
  File: gccint.info,  Node: Collect2,  Next: Header Dirs,  Prev: Fragments,  Up: Top
  
! 20 `collect2'
  *************
  
! GCC uses a utility called `collect2' on nearly all systems to arrange
! to call various initialization functions at start time.
  
!  The program `collect2' works by linking the program once and looking
  through the linker output file for symbols with particular names
  indicating they are constructor functions.  If it finds any, it creates
! a new temporary `.c' file containing a table of them, compiles it, and
  links the program a second time including that file.
  
   The actual calls to the constructors are carried out by a subroutine
! called `__main', which is called (automatically) at the beginning of
! the body of `main' (provided `main' was compiled with GNU CC).  Calling
! `__main' is necessary, even when compiling C code, to allow linking C
! and C++ object code together.  (If you use `-nostdlib', you get an
! unresolved reference to `__main', since it's defined in the standard
! GCC library.  Include `-lgcc' at the end of your compiler command line
! to resolve this reference.)
  
!  The program `collect2' is installed as `ld' in the directory where the
! passes of the compiler are installed.  When `collect2' needs to find
! the _real_ `ld', it tries the following file names:
  
     * a hard coded linker file name, if GCC was configured with the
!      `--with-ld' option.
  
!    * `real-ld' in the directories listed in the compiler's search
       directories.
  
!    * `real-ld' in the directories listed in the environment variable
!      `PATH'.
  
!    * The file specified in the `REAL_LD_FILE_NAME' configuration macro,
       if specified.
  
!    * `ld' in the compiler's search directories, except that `collect2'
       will not execute itself recursively.
  
!    * `ld' in `PATH'.
  
   "The compiler's search directories" means all the directories where
! `gcc' searches for passes of the compiler.  This includes directories
! that you specify with `-B'.
  
   Cross-compilers search a little differently:
  
!    * `real-ld' in the compiler's search directories.
  
!    * `TARGET-real-ld' in `PATH'.
  
!    * The file specified in the `REAL_LD_FILE_NAME' configuration macro,
       if specified.
  
!    * `ld' in the compiler's search directories.
  
!    * `TARGET-ld' in `PATH'.
  
!  `collect2' explicitly avoids running `ld' using the file name under
! which `collect2' itself was invoked.  In fact, it remembers up a list
! of such names--in case one copy of `collect2' finds another copy (or
! version) of `collect2' installed as `ld' in a second place in the
! search path.
  
!  `collect2' searches for the utilities `nm' and `strip' using the same
! algorithm as above for `ld'.
  
  
  File: gccint.info,  Node: Header Dirs,  Next: Type Information,  Prev: Collect2,  Up: Top
--- 38890,38968 ----
  19.2 Host Makefile Fragments
  ============================
  
! The use of 'x-HOST' fragments is discouraged.  You should only use it
  for makefile dependencies.
  
  
  File: gccint.info,  Node: Collect2,  Next: Header Dirs,  Prev: Fragments,  Up: Top
  
! 20 'collect2'
  *************
  
! GCC uses a utility called 'collect2' on nearly all systems to arrange to
! call various initialization functions at start time.
  
!  The program 'collect2' works by linking the program once and looking
  through the linker output file for symbols with particular names
  indicating they are constructor functions.  If it finds any, it creates
! a new temporary '.c' file containing a table of them, compiles it, and
  links the program a second time including that file.
  
   The actual calls to the constructors are carried out by a subroutine
! called '__main', which is called (automatically) at the beginning of the
! body of 'main' (provided 'main' was compiled with GNU CC).  Calling
! '__main' is necessary, even when compiling C code, to allow linking C
! and C++ object code together.  (If you use '-nostdlib', you get an
! unresolved reference to '__main', since it's defined in the standard GCC
! library.  Include '-lgcc' at the end of your compiler command line to
! resolve this reference.)
  
!  The program 'collect2' is installed as 'ld' in the directory where the
! passes of the compiler are installed.  When 'collect2' needs to find the
! _real_ 'ld', it tries the following file names:
  
     * a hard coded linker file name, if GCC was configured with the
!      '--with-ld' option.
  
!    * 'real-ld' in the directories listed in the compiler's search
       directories.
  
!    * 'real-ld' in the directories listed in the environment variable
!      'PATH'.
  
!    * The file specified in the 'REAL_LD_FILE_NAME' configuration macro,
       if specified.
  
!    * 'ld' in the compiler's search directories, except that 'collect2'
       will not execute itself recursively.
  
!    * 'ld' in 'PATH'.
  
   "The compiler's search directories" means all the directories where
! 'gcc' searches for passes of the compiler.  This includes directories
! that you specify with '-B'.
  
   Cross-compilers search a little differently:
  
!    * 'real-ld' in the compiler's search directories.
  
!    * 'TARGET-real-ld' in 'PATH'.
  
!    * The file specified in the 'REAL_LD_FILE_NAME' configuration macro,
       if specified.
  
!    * 'ld' in the compiler's search directories.
  
!    * 'TARGET-ld' in 'PATH'.
  
!  'collect2' explicitly avoids running 'ld' using the file name under
! which 'collect2' itself was invoked.  In fact, it remembers up a list of
! such names--in case one copy of 'collect2' finds another copy (or
! version) of 'collect2' installed as 'ld' in a second place in the search
! path.
  
!  'collect2' searches for the utilities 'nm' and 'strip' using the same
! algorithm as above for 'ld'.
  
  
  File: gccint.info,  Node: Header Dirs,  Next: Type Information,  Prev: Collect2,  Up: Top
*************** File: gccint.info,  Node: Header Dirs,
*** 39401,39429 ****
  21 Standard Header File Directories
  ***********************************
  
! `GCC_INCLUDE_DIR' means the same thing for native and cross.  It is
  where GCC stores its private include files, and also where GCC stores
! the fixed include files.  A cross compiled GCC runs `fixincludes' on
! the header files in `$(tooldir)/include'.  (If the cross compilation
! header files need to be fixed, they must be installed before GCC is
! built.  If the cross compilation header files are already suitable for
! GCC, nothing special need be done).
  
!  `GPLUSPLUS_INCLUDE_DIR' means the same thing for native and cross.  It
! is where `g++' looks first for header files.  The C++ library installs
  only target independent header files in that directory.
  
!  `LOCAL_INCLUDE_DIR' is used only by native compilers.  GCC doesn't
! install anything there.  It is normally `/usr/local/include'.  This is
  where local additions to a packaged system should place header files.
  
!  `CROSS_INCLUDE_DIR' is used only by cross compilers.  GCC doesn't
  install anything there.
  
!  `TOOL_INCLUDE_DIR' is used for both native and cross compilers.  It is
  the place for other packages to install header files that GCC will use.
! For a cross-compiler, this is the equivalent of `/usr/include'.  When
! you build a cross-compiler, `fixincludes' processes any header files in
  this directory.
  
  
--- 38970,38998 ----
  21 Standard Header File Directories
  ***********************************
  
! 'GCC_INCLUDE_DIR' means the same thing for native and cross.  It is
  where GCC stores its private include files, and also where GCC stores
! the fixed include files.  A cross compiled GCC runs 'fixincludes' on the
! header files in '$(tooldir)/include'.  (If the cross compilation header
! files need to be fixed, they must be installed before GCC is built.  If
! the cross compilation header files are already suitable for GCC, nothing
! special need be done).
  
!  'GPLUSPLUS_INCLUDE_DIR' means the same thing for native and cross.  It
! is where 'g++' looks first for header files.  The C++ library installs
  only target independent header files in that directory.
  
!  'LOCAL_INCLUDE_DIR' is used only by native compilers.  GCC doesn't
! install anything there.  It is normally '/usr/local/include'.  This is
  where local additions to a packaged system should place header files.
  
!  'CROSS_INCLUDE_DIR' is used only by cross compilers.  GCC doesn't
  install anything there.
  
!  'TOOL_INCLUDE_DIR' is used for both native and cross compilers.  It is
  the place for other packages to install header files that GCC will use.
! For a cross-compiler, this is the equivalent of '/usr/include'.  When
! you build a cross-compiler, 'fixincludes' processes any header files in
  this directory.
  
  
*************** implement precompiled headers.
*** 39439,39464 ****
  
   A full C++ parser would be too complicated for this task, so a limited
  subset of C++ is interpreted and special markers are used to determine
! what parts of the source to look at.  All `struct', `union' and
! `template' structure declarations that define data structures that are
  allocated under control of the garbage collector must be marked.  All
  global variables that hold pointers to garbage-collected memory must
! also be marked.  Finally, all global variables that need to be saved
! and restored by a precompiled header must be marked.  (The precompiled
  header mechanism can only save static variables if they're scalar.
! Complex data structures must be allocated in garbage-collected memory
! to be saved in a precompiled header.)
  
   The full format of a marker is
       GTY (([OPTION] [(PARAM)], [OPTION] [(PARAM)] ...))
!  but in most cases no options are needed.  The outer double parentheses
! are still necessary, though: `GTY(())'.  Markers can appear:
  
     * In a structure definition, before the open brace;
! 
!    * In a global variable declaration, after the keyword `static' or
!      `extern'; and
! 
     * In a structure field definition, before the name of the field.
  
   Here are some examples of marking simple data structures and globals.
--- 39008,39031 ----
  
   A full C++ parser would be too complicated for this task, so a limited
  subset of C++ is interpreted and special markers are used to determine
! what parts of the source to look at.  All 'struct', 'union' and
! 'template' structure declarations that define data structures that are
  allocated under control of the garbage collector must be marked.  All
  global variables that hold pointers to garbage-collected memory must
! also be marked.  Finally, all global variables that need to be saved and
! restored by a precompiled header must be marked.  (The precompiled
  header mechanism can only save static variables if they're scalar.
! Complex data structures must be allocated in garbage-collected memory to
! be saved in a precompiled header.)
  
   The full format of a marker is
       GTY (([OPTION] [(PARAM)], [OPTION] [(PARAM)] ...))
! but in most cases no options are needed.  The outer double parentheses
! are still necessary, though: 'GTY(())'.  Markers can appear:
  
     * In a structure definition, before the open brace;
!    * In a global variable declaration, after the keyword 'static' or
!      'extern'; and
     * In a structure field definition, before the name of the field.
  
   Here are some examples of marking simple data structures and globals.
*************** are still necessary, though: `GTY(())'.
*** 39476,39505 ****
       static GTY(()) struct TAG *LIST;   /* points to GC memory */
       static GTY(()) int COUNTER;        /* save counter in a PCH */
  
!  The parser understands simple typedefs such as `typedef struct TAG
! *NAME;' and `typedef int NAME;'.  These don't need to be marked.
  
!  Since `gengtype''s understanding of C++ is limited, there are several
  constructs and declarations that are not supported inside
  classes/structures marked for automatic GC code generation.  The
! following C++ constructs produce a `gengtype' error on
  structures/classes marked for automatic GC code generation:
  
     * Type definitions inside classes/structures are not supported.
- 
     * Enumerations inside classes/structures are not supported.
  
!  If you have a class or structure using any of the above constructs,
! you need to mark that class as `GTY ((user))' and provide your own
! marking routines (see section *note User GC:: for details).
  
   It is always valid to include function definitions inside classes.
! Those are always ignored by `gengtype', as it only cares about data
  members.
  
  * Menu:
  
! * GTY Options::         What goes inside a `GTY(())'.
  * Inheritance and GTY:: Adding GTY to a class hierarchy.
  * User GC::		Adding user-provided GC marking routines.
  * GGC Roots::           Making global variables GGC roots.
--- 39043,39071 ----
       static GTY(()) struct TAG *LIST;   /* points to GC memory */
       static GTY(()) int COUNTER;        /* save counter in a PCH */
  
!  The parser understands simple typedefs such as 'typedef struct TAG
! *NAME;' and 'typedef int NAME;'.  These don't need to be marked.
  
!  Since 'gengtype''s understanding of C++ is limited, there are several
  constructs and declarations that are not supported inside
  classes/structures marked for automatic GC code generation.  The
! following C++ constructs produce a 'gengtype' error on
  structures/classes marked for automatic GC code generation:
  
     * Type definitions inside classes/structures are not supported.
     * Enumerations inside classes/structures are not supported.
  
!  If you have a class or structure using any of the above constructs, you
! need to mark that class as 'GTY ((user))' and provide your own marking
! routines (see section *note User GC:: for details).
  
   It is always valid to include function definitions inside classes.
! Those are always ignored by 'gengtype', as it only cares about data
  members.
  
  * Menu:
  
! * GTY Options::         What goes inside a 'GTY(())'.
  * Inheritance and GTY:: Adding GTY to a class hierarchy.
  * User GC::		Adding user-provided GC marking routines.
  * GGC Roots::           Making global variables GGC roots.
*************** members.
*** 39510,39541 ****
  
  File: gccint.info,  Node: GTY Options,  Next: Inheritance and GTY,  Up: Type Information
  
! 22.1 The Inside of a `GTY(())'
  ==============================
  
! Sometimes the C code is not enough to fully describe the type
! structure.  Extra information can be provided with `GTY' options and
! additional markers.  Some options take a parameter, which may be either
! a string or a type name, depending on the parameter.  If an option
! takes no parameter, it is acceptable either to omit the parameter
! entirely, or to provide an empty string as a parameter.  For example,
! `GTY ((skip))' and `GTY ((skip ("")))' are equivalent.
  
   When the parameter is a string, often it is a fragment of C code.  Four
  special escapes may be used in these strings, to refer to pieces of the
  data structure being marked:
  
! `%h'
       The current structure.
! 
! `%1'
       The structure that immediately contains the current structure.
! 
! `%0'
       The outermost structure that contains the current structure.
! 
! `%a'
!      A partial expression of the form `[i1][i2]...' that indexes the
       array item currently being marked.
  
   For instance, suppose that you have a structure of the form
--- 39076,39104 ----
  
  File: gccint.info,  Node: GTY Options,  Next: Inheritance and GTY,  Up: Type Information
  
! 22.1 The Inside of a 'GTY(())'
  ==============================
  
! Sometimes the C code is not enough to fully describe the type structure.
! Extra information can be provided with 'GTY' options and additional
! markers.  Some options take a parameter, which may be either a string or
! a type name, depending on the parameter.  If an option takes no
! parameter, it is acceptable either to omit the parameter entirely, or to
! provide an empty string as a parameter.  For example, 'GTY ((skip))' and
! 'GTY ((skip ("")))' are equivalent.
  
   When the parameter is a string, often it is a fragment of C code.  Four
  special escapes may be used in these strings, to refer to pieces of the
  data structure being marked:
  
! '%h'
       The current structure.
! '%1'
       The structure that immediately contains the current structure.
! '%0'
       The outermost structure that contains the current structure.
! '%a'
!      A partial expression of the form '[i1][i2]...' that indexes the
       array item currently being marked.
  
   For instance, suppose that you have a structure of the form
*************** data structure being marked:
*** 39545,39553 ****
       struct B {
         struct A foo[12];
       };
!  and `b' is a variable of type `struct B'.  When marking `b.foo[11]',
! `%h' would expand to `b.foo[11]', `%0' and `%1' would both expand to
! `b', and `%a' would expand to `[11]'.
  
   As in ordinary C, adjacent strings will be concatenated; this is
  helpful when you have a complicated expression.
--- 39108,39116 ----
       struct B {
         struct A foo[12];
       };
! and 'b' is a variable of type 'struct B'.  When marking 'b.foo[11]',
! '%h' would expand to 'b.foo[11]', '%0' and '%1' would both expand to
! 'b', and '%a' would expand to '[11]'.
  
   As in ordinary C, adjacent strings will be concatenated; this is
  helpful when you have a complicated expression.
*************** helpful when you have a complicated expr
*** 39557,39563 ****
  
   The available options are:
  
! `length ("EXPRESSION")'
       There are two places the type machinery will need to be explicitly
       told the length of an array of non-atomic objects.  The first case
       is when a structure ends in a variable-length array, like this:
--- 39120,39127 ----
  
   The available options are:
  
! 'length ("EXPRESSION")'
! 
       There are two places the type machinery will need to be explicitly
       told the length of an array of non-atomic objects.  The first case
       is when a structure ends in a variable-length array, like this:
*************** helpful when you have a complicated expr
*** 39566,39614 ****
              rtx GTY ((length ("%h.num_elem"))) elem[1];
            };
  
!      In this case, the `length' option is used to override the specified
!      array length (which should usually be `1').  The parameter of the
       option is a fragment of C code that calculates the length.
  
       The second case is when a structure or a global variable contains a
       pointer to an array, like this:
            struct gimple_omp_for_iter * GTY((length ("%h.collapse"))) iter;
!      In this case, `iter' has been allocated by writing something like
              x->iter = ggc_alloc_cleared_vec_gimple_omp_for_iter (collapse);
!      and the `collapse' provides the length of the field.
  
!      This second use of `length' also works on global variables, like: static GTY((length("reg_known_value_size"))) rtx *reg_known_value;
  
!      Note that the `length' option is only meant for use with arrays of
!      non-atomic objects, that is, objects that contain pointers
!      pointing to other GTY-managed objects.  For other GC-allocated
!      arrays and strings you should use `atomic'.
  
! `skip'
!      If `skip' is applied to a field, the type machinery will ignore it.
       This is somewhat dangerous; the only safe use is in a union when
       one field really isn't ever used.
  
       Use this to mark types that need to be marked by user gc routines,
!      but are not refered to in a template argument.  So if you have
!      some user gc type T1 and a non user gc type T2 you can give T2 the
       for_user option so that the marking functions for T1 can call non
       mangled functions to mark T2.
  
! `desc ("EXPRESSION")'
! `tag ("CONSTANT")'
! `default'
!      The type machinery needs to be told which field of a `union' is
       currently active.  This is done by giving each field a constant
!      `tag' value, and then specifying a discriminator using `desc'.
!      The value of the expression given by `desc' is compared against
!      each `tag' value, each of which should be different.  If no `tag'
!      is matched, the field marked with `default' is used if there is
!      one, otherwise no field in the union will be marked.
  
!      In the `desc' option, the "current structure" is the union that it
!      discriminates.  Use `%1' to mean the structure containing it.
!      There are no escapes available to the `tag' option, since it is a
       constant.
  
       For example,
--- 39130,39181 ----
              rtx GTY ((length ("%h.num_elem"))) elem[1];
            };
  
!      In this case, the 'length' option is used to override the specified
!      array length (which should usually be '1').  The parameter of the
       option is a fragment of C code that calculates the length.
  
       The second case is when a structure or a global variable contains a
       pointer to an array, like this:
            struct gimple_omp_for_iter * GTY((length ("%h.collapse"))) iter;
!      In this case, 'iter' has been allocated by writing something like
              x->iter = ggc_alloc_cleared_vec_gimple_omp_for_iter (collapse);
!      and the 'collapse' provides the length of the field.
  
!      This second use of 'length' also works on global variables, like:
!      static GTY((length("reg_known_value_size"))) rtx *reg_known_value;
  
!      Note that the 'length' option is only meant for use with arrays of
!      non-atomic objects, that is, objects that contain pointers pointing
!      to other GTY-managed objects.  For other GC-allocated arrays and
!      strings you should use 'atomic'.
  
! 'skip'
! 
!      If 'skip' is applied to a field, the type machinery will ignore it.
       This is somewhat dangerous; the only safe use is in a union when
       one field really isn't ever used.
  
       Use this to mark types that need to be marked by user gc routines,
!      but are not refered to in a template argument.  So if you have some
!      user gc type T1 and a non user gc type T2 you can give T2 the
       for_user option so that the marking functions for T1 can call non
       mangled functions to mark T2.
  
! 'desc ("EXPRESSION")'
! 'tag ("CONSTANT")'
! 'default'
! 
!      The type machinery needs to be told which field of a 'union' is
       currently active.  This is done by giving each field a constant
!      'tag' value, and then specifying a discriminator using 'desc'.  The
!      value of the expression given by 'desc' is compared against each
!      'tag' value, each of which should be different.  If no 'tag' is
!      matched, the field marked with 'default' is used if there is one,
!      otherwise no field in the union will be marked.
  
!      In the 'desc' option, the "current structure" is the union that it
!      discriminates.  Use '%1' to mean the structure containing it.
!      There are no escapes available to the 'tag' option, since it is a
       constant.
  
       For example,
*************** helpful when you have a complicated expr
*** 39623,39665 ****
            };
  
       In this example, the value of BINDING_HAS_LEVEL_P when applied to a
!      `struct tree_binding *' is presumed to be 0 or 1.  If 1, the type
!      mechanism will treat the field `level' as being present and if 0,
!      will treat the field `scope' as being present.
  
!      The `desc' and `tag' options can also be used for inheritance to
       denote which subclass an instance is.  See *note Inheritance and
       GTY:: for more information.
  
! `cache'
!      When the `cache' option is applied to a global variable
       gt_clear_cache is called on that variable between the mark and
!      sweep phases of garbage collection.  The gt_clear_cache function
!      is free to mark blocks as used, or to clear pointers in the
!      variable.
  
! `deletable'
!      `deletable', when applied to a global variable, indicates that when
       garbage collection runs, there's no need to mark anything pointed
!      to by this variable, it can just be set to `NULL' instead.  This
!      is used to keep a list of free structures around for re-use.
  
- `mark_hook ("HOOK-ROUTINE-NAME")'
       If provided for a structure or union type, the given
       HOOK-ROUTINE-NAME (between double-quotes) is the name of a routine
       called when the garbage collector has just marked the data as
!      reachable. This routine should not change the data, or call any ggc
!      routine. Its only argument is a pointer to the just marked (const)
!      structure or union.
  
! `maybe_undef'
!      When applied to a field, `maybe_undef' indicates that it's OK if
       the structure that this fields points to is never defined, so long
!      as this field is always `NULL'.  This is used to avoid requiring
       backends to define certain optional structures.  It doesn't work
       with language frontends.
  
! `nested_ptr (TYPE, "TO EXPRESSION", "FROM EXPRESSION")'
       The type machinery expects all pointers to point to the start of an
       object.  Sometimes for abstraction purposes it's convenient to have
       a pointer which points inside an object.  So long as it's possible
--- 39190,39236 ----
            };
  
       In this example, the value of BINDING_HAS_LEVEL_P when applied to a
!      'struct tree_binding *' is presumed to be 0 or 1.  If 1, the type
!      mechanism will treat the field 'level' as being present and if 0,
!      will treat the field 'scope' as being present.
  
!      The 'desc' and 'tag' options can also be used for inheritance to
       denote which subclass an instance is.  See *note Inheritance and
       GTY:: for more information.
  
! 'cache'
! 
!      When the 'cache' option is applied to a global variable
       gt_clear_cache is called on that variable between the mark and
!      sweep phases of garbage collection.  The gt_clear_cache function is
!      free to mark blocks as used, or to clear pointers in the variable.
  
! 'deletable'
! 
!      'deletable', when applied to a global variable, indicates that when
       garbage collection runs, there's no need to mark anything pointed
!      to by this variable, it can just be set to 'NULL' instead.  This is
!      used to keep a list of free structures around for re-use.
! 
! 'mark_hook ("HOOK-ROUTINE-NAME")'
  
       If provided for a structure or union type, the given
       HOOK-ROUTINE-NAME (between double-quotes) is the name of a routine
       called when the garbage collector has just marked the data as
!      reachable.  This routine should not change the data, or call any
!      ggc routine.  Its only argument is a pointer to the just marked
!      (const) structure or union.
  
! 'maybe_undef'
! 
!      When applied to a field, 'maybe_undef' indicates that it's OK if
       the structure that this fields points to is never defined, so long
!      as this field is always 'NULL'.  This is used to avoid requiring
       backends to define certain optional structures.  It doesn't work
       with language frontends.
  
! 'nested_ptr (TYPE, "TO EXPRESSION", "FROM EXPRESSION")'
! 
       The type machinery expects all pointers to point to the start of an
       object.  Sometimes for abstraction purposes it's convenient to have
       a pointer which points inside an object.  So long as it's possible
*************** helpful when you have a complicated expr
*** 39667,39759 ****
       pointers can still be used.  TYPE is the type of the original
       object, the TO EXPRESSION returns the pointer given the original
       object, and the FROM EXPRESSION returns the original object given
!      the pointer.  The pointer will be available using the `%h' escape.
  
- `chain_next ("EXPRESSION")'
- `chain_prev ("EXPRESSION")'
- `chain_circular ("EXPRESSION")'
       It's helpful for the type machinery to know if objects are often
       chained together in long lists; this lets it generate code that
       uses less stack space by iterating along the list instead of
!      recursing down it.  `chain_next' is an expression for the next
!      item in the list, `chain_prev' is an expression for the previous
!      item.  For singly linked lists, use only `chain_next'; for doubly
!      linked lists, use both.  The machinery requires that taking the
!      next item of the previous item gives the original item.
!      `chain_circular' is similar to `chain_next', but can be used for
!      circular single linked lists.
  
- `reorder ("FUNCTION NAME")'
       Some data structures depend on the relative ordering of pointers.
       If the precompiled header machinery needs to change that ordering,
!      it will call the function referenced by the `reorder' option,
!      before changing the pointers in the object that's pointed to by
!      the field the option applies to.  The function must take four
       arguments, with the signature
!      `void *, void *, gt_pointer_operator, void *'.  The first
!      parameter is a pointer to the structure that contains the object
!      being updated, or the object itself if there is no containing
!      structure.  The second parameter is a cookie that should be
!      ignored.  The third parameter is a routine that, given a pointer,
!      will update it to its correct new value.  The fourth parameter is
!      a cookie that must be passed to the second parameter.
  
       PCH cannot handle data structures that depend on the absolute
!      values of pointers.  `reorder' functions can be expensive.  When
!      possible, it is better to depend on properties of the data, like
!      an ID number or the hash of a string instead.
  
! `atomic'
!      The `atomic' option can only be used with pointers.  It informs
!      the GC machinery that the memory that the pointer points to does
!      not contain any pointers, and hence it should be treated by the GC
!      and PCH machinery as an "atomic" block of memory that does not
!      need to be examined when scanning memory for pointers.  In
!      particular, the machinery will not scan that memory for pointers
!      to mark them as reachable (when marking pointers for GC) or to
!      relocate them (when writing a PCH file).
  
!      The `atomic' option differs from the `skip' option.  `atomic'
!      keeps the memory under Garbage Collection, but makes the GC ignore
!      the contents of the memory.  `skip' is more drastic in that it
!      causes the pointer and the memory to be completely ignored by the
!      Garbage Collector.  So, memory marked as `atomic' is automatically
!      freed when no longer reachable, while memory marked as `skip' is
!      not.
  
!      The `atomic' option must be used with great care, because all
!      sorts of problem can occur if used incorrectly, that is, if the
!      memory the pointer points to does actually contain a pointer.
  
       Here is an example of how to use it:
            struct GTY(()) my_struct {
              int number_of_elements;
              unsigned int * GTY ((atomic)) elements;
            };
!      In this case, `elements' is a pointer under GC, and the memory it
       points to needs to be allocated using the Garbage Collector, and
       will be freed automatically by the Garbage Collector when it is no
!      longer referenced.  But the memory that the pointer points to is
!      an array of `unsigned int' elements, and the GC must not try to
!      scan it to find pointers to mark or relocate, which is why it is
!      marked with the `atomic' option.
  
       Note that, currently, global variables can not be marked with
!      `atomic'; only fields of a struct can.  This is a known
!      limitation.  It would be useful to be able to mark global pointers
!      with `atomic' to make the PCH machinery aware of them so that they
!      are saved and restored correctly to PCH files.
  
! `special ("NAME")'
!      The `special' option is used to mark types that have to be dealt
       with by special case machinery.  The parameter is the name of the
!      special case.  See `gengtype.c' for further details.  Avoid adding
       new special cases unless there is no other alternative.
  
! `user'
!      The `user' option indicates that the code to mark structure fields
!      is completely handled by user-provided routines.  See section
!      *note User GC:: for details on what functions need to be provided.
  
  
  File: gccint.info,  Node: Inheritance and GTY,  Next: User GC,  Prev: GTY Options,  Up: Type Information
--- 39238,39334 ----
       pointers can still be used.  TYPE is the type of the original
       object, the TO EXPRESSION returns the pointer given the original
       object, and the FROM EXPRESSION returns the original object given
!      the pointer.  The pointer will be available using the '%h' escape.
! 
! 'chain_next ("EXPRESSION")'
! 'chain_prev ("EXPRESSION")'
! 'chain_circular ("EXPRESSION")'
  
       It's helpful for the type machinery to know if objects are often
       chained together in long lists; this lets it generate code that
       uses less stack space by iterating along the list instead of
!      recursing down it.  'chain_next' is an expression for the next item
!      in the list, 'chain_prev' is an expression for the previous item.
!      For singly linked lists, use only 'chain_next'; for doubly linked
!      lists, use both.  The machinery requires that taking the next item
!      of the previous item gives the original item.  'chain_circular' is
!      similar to 'chain_next', but can be used for circular single linked
!      lists.
! 
! 'reorder ("FUNCTION NAME")'
  
       Some data structures depend on the relative ordering of pointers.
       If the precompiled header machinery needs to change that ordering,
!      it will call the function referenced by the 'reorder' option,
!      before changing the pointers in the object that's pointed to by the
!      field the option applies to.  The function must take four
       arguments, with the signature
!      'void *, void *, gt_pointer_operator, void *'.  The first parameter
!      is a pointer to the structure that contains the object being
!      updated, or the object itself if there is no containing structure.
!      The second parameter is a cookie that should be ignored.  The third
!      parameter is a routine that, given a pointer, will update it to its
!      correct new value.  The fourth parameter is a cookie that must be
!      passed to the second parameter.
  
       PCH cannot handle data structures that depend on the absolute
!      values of pointers.  'reorder' functions can be expensive.  When
!      possible, it is better to depend on properties of the data, like an
!      ID number or the hash of a string instead.
  
! 'atomic'
  
!      The 'atomic' option can only be used with pointers.  It informs the
!      GC machinery that the memory that the pointer points to does not
!      contain any pointers, and hence it should be treated by the GC and
!      PCH machinery as an "atomic" block of memory that does not need to
!      be examined when scanning memory for pointers.  In particular, the
!      machinery will not scan that memory for pointers to mark them as
!      reachable (when marking pointers for GC) or to relocate them (when
!      writing a PCH file).
  
!      The 'atomic' option differs from the 'skip' option.  'atomic' keeps
!      the memory under Garbage Collection, but makes the GC ignore the
!      contents of the memory.  'skip' is more drastic in that it causes
!      the pointer and the memory to be completely ignored by the Garbage
!      Collector.  So, memory marked as 'atomic' is automatically freed
!      when no longer reachable, while memory marked as 'skip' is not.
! 
!      The 'atomic' option must be used with great care, because all sorts
!      of problem can occur if used incorrectly, that is, if the memory
!      the pointer points to does actually contain a pointer.
  
       Here is an example of how to use it:
            struct GTY(()) my_struct {
              int number_of_elements;
              unsigned int * GTY ((atomic)) elements;
            };
!      In this case, 'elements' is a pointer under GC, and the memory it
       points to needs to be allocated using the Garbage Collector, and
       will be freed automatically by the Garbage Collector when it is no
!      longer referenced.  But the memory that the pointer points to is an
!      array of 'unsigned int' elements, and the GC must not try to scan
!      it to find pointers to mark or relocate, which is why it is marked
!      with the 'atomic' option.
  
       Note that, currently, global variables can not be marked with
!      'atomic'; only fields of a struct can.  This is a known limitation.
!      It would be useful to be able to mark global pointers with 'atomic'
!      to make the PCH machinery aware of them so that they are saved and
!      restored correctly to PCH files.
  
! 'special ("NAME")'
! 
!      The 'special' option is used to mark types that have to be dealt
       with by special case machinery.  The parameter is the name of the
!      special case.  See 'gengtype.c' for further details.  Avoid adding
       new special cases unless there is no other alternative.
  
! 'user'
! 
!      The 'user' option indicates that the code to mark structure fields
!      is completely handled by user-provided routines.  See section *note
!      User GC:: for details on what functions need to be provided.
  
  
  File: gccint.info,  Node: Inheritance and GTY,  Next: User GC,  Prev: GTY Options,  Up: Type Information
*************** this to have gengtype autogenerate marki
*** 39767,39775 ****
     * There must be a concrete base class, with a discriminator
       expression that can be used to identify which subclass an instance
       is.
- 
     * Only single inheritance is used.
- 
     * None of the classes within the hierarchy are templates.
  
   If your class hierarchy does not fit in this pattern, you must use
--- 39342,39348 ----
*************** this to have gengtype autogenerate marki
*** 39779,39785 ****
  "desc" option.  Each concrete subclass must use the "tag" option to
  identify which value of the discriminator it corresponds to.
  
!  Every class in the hierarchy must have a `GTY(())' marker, as gengtype
  will only attempt to parse classes that have such a marker (1).
  
       class GTY((desc("%h.kind"), tag("0"))) example_base
--- 39352,39358 ----
  "desc" option.  Each concrete subclass must use the "tag" option to
  identify which value of the discriminator it corresponds to.
  
!  Every class in the hierarchy must have a 'GTY(())' marker, as gengtype
  will only attempt to parse classes that have such a marker (1).
  
       class GTY((desc("%h.kind"), tag("0"))) example_base
*************** will only attempt to parse classes that
*** 39801,39814 ****
           tree c;
       };
  
!  The generated marking routines for the above will contain a "switch"
! on "kind", visiting all appropriate fields.  For example, if kind is 2,
! it will cast to "some_other_subclass" and visit fields a, b, and c.
  
!  ---------- Footnotes ----------
  
!  (1) Classes lacking such a marker will not be identified as being part
! of the hierarchy, and so the marking routines will not handle them,
  leading to a assertion failure within the marking routines due to an
  unknown tag value (assuming that assertions are enabled).
  
--- 39374,39387 ----
           tree c;
       };
  
!  The generated marking routines for the above will contain a "switch" on
! "kind", visiting all appropriate fields.  For example, if kind is 2, it
! will cast to "some_other_subclass" and visit fields a, b, and c.
  
!    ---------- Footnotes ----------
  
!    (1) Classes lacking such a marker will not be identified as being
! part of the hierarchy, and so the marking routines will not handle them,
  leading to a assertion failure within the marking routines due to an
  unknown tag value (assuming that assertions are enabled).
  
*************** File: gccint.info,  Node: User GC,  Next
*** 39818,39830 ****
  22.3 Support for user-provided GC marking routines
  ==================================================
  
! The garbage collector supports types for which no automatic marking
! code is generated.  For these types, the user is required to provide
! three functions: one to act as a marker for garbage collection, and two
  functions to act as marker and pointer walker for pre-compiled headers.
  
!  Given a structure `struct GTY((user)) my_struct', the following
! functions should be defined to mark `my_struct':
  
       void gt_ggc_mx (my_struct *p)
       {
--- 39391,39403 ----
  22.3 Support for user-provided GC marking routines
  ==================================================
  
! The garbage collector supports types for which no automatic marking code
! is generated.  For these types, the user is required to provide three
! functions: one to act as a marker for garbage collection, and two
  functions to act as marker and pointer walker for pre-compiled headers.
  
!  Given a structure 'struct GTY((user)) my_struct', the following
! functions should be defined to mark 'my_struct':
  
       void gt_ggc_mx (my_struct *p)
       {
*************** functions should be defined to mark `my_
*** 39844,39873 ****
         op (&(tp->fld), cookie);
       }
  
!  In general, each marker `M' should call `M' for every pointer field in
  the structure.  Fields that are not allocated in GC or are not pointers
  must be ignored.
  
!  For embedded lists (e.g., structures with a `next' or `prev' pointer),
  the marker must follow the chain and mark every element in it.
  
!  Note that the rules for the pointer walker `gt_pch_nx (my_struct *,
! gt_pointer_operator, void *)' are slightly different.  In this case,
! the operation `op' must be applied to the _address_ of every pointer
! field.
  
  22.3.1 User-provided marking routines for template types
  --------------------------------------------------------
  
! When a template type `TP' is marked with `GTY', all instances of that
! type are considered user-provided types.  This means that the
! individual instances of `TP' do not need to be marked with `GTY'.  The
! user needs to provide template functions to mark all the fields of the
! type.
  
!  The following code snippets represent all the functions that need to
! be provided. Note that type `TP' may reference to more than one type.
! In these snippets, there is only one type `T', but there could be more.
  
       template<typename T>
       void gt_ggc_mx (TP<T> *tp)
--- 39417,39444 ----
         op (&(tp->fld), cookie);
       }
  
!  In general, each marker 'M' should call 'M' for every pointer field in
  the structure.  Fields that are not allocated in GC or are not pointers
  must be ignored.
  
!  For embedded lists (e.g., structures with a 'next' or 'prev' pointer),
  the marker must follow the chain and mark every element in it.
  
!  Note that the rules for the pointer walker 'gt_pch_nx (my_struct *,
! gt_pointer_operator, void *)' are slightly different.  In this case, the
! operation 'op' must be applied to the _address_ of every pointer field.
  
  22.3.1 User-provided marking routines for template types
  --------------------------------------------------------
  
! When a template type 'TP' is marked with 'GTY', all instances of that
! type are considered user-provided types.  This means that the individual
! instances of 'TP' do not need to be marked with 'GTY'.  The user needs
! to provide template functions to mark all the fields of the type.
  
!  The following code snippets represent all the functions that need to be
! provided.  Note that type 'TP' may reference to more than one type.  In
! these snippets, there is only one type 'T', but there could be more.
  
       template<typename T>
       void gt_ggc_mx (TP<T> *tp)
*************** In these snippets, there is only one typ
*** 39905,39922 ****
         gt_pch_nx (&(tp->fld), op, cookie);
       }
  
!  Support for user-defined types is currently limited. The following
  restrictions apply:
  
!   1. Type `TP' and all the argument types `T' must be marked with `GTY'.
  
!   2. Type `TP' can only have type names in its argument list.
  
!   3. The pointer walker functions are different for `TP<T>' and `TP<T
!      *>'. In the case of `TP<T>', references to `T' must be handled by
!      calling `gt_pch_nx' (which will, in turn, walk all the pointers
!      inside fields of `T').  In the case of `TP<T *>', references to `T
!      *' must be handled by calling the `op' function on the address of
       the pointer (see the code snippets above).
  
  
--- 39476,39493 ----
         gt_pch_nx (&(tp->fld), op, cookie);
       }
  
!  Support for user-defined types is currently limited.  The following
  restrictions apply:
  
!   1. Type 'TP' and all the argument types 'T' must be marked with 'GTY'.
  
!   2. Type 'TP' can only have type names in its argument list.
  
!   3. The pointer walker functions are different for 'TP<T>' and 'TP<T
!      *>'.  In the case of 'TP<T>', references to 'T' must be handled by
!      calling 'gt_pch_nx' (which will, in turn, walk all the pointers
!      inside fields of 'T').  In the case of 'TP<T *>', references to 'T
!      *' must be handled by calling the 'op' function on the address of
       the pointer (see the code snippets above).
  
  
*************** In addition to keeping track of types, t
*** 39929,39942 ****
  the global variables ("roots") that the garbage collector starts at.
  Roots must be declared using one of the following syntaxes:
  
!    * `extern GTY(([OPTIONS])) TYPE NAME;'
! 
!    * `static GTY(([OPTIONS])) TYPE NAME;'
!  The syntax
!    * `GTY(([OPTIONS])) TYPE NAME;'
!  is _not_ accepted.  There should be an `extern' declaration of such a
  variable in a header somewhere--mark that, not the definition.  Or, if
! the variable is only used in one file, make it `static'.
  
  
  File: gccint.info,  Node: Files,  Next: Invoking the garbage collector,  Prev: GGC Roots,  Up: Type Information
--- 39500,39512 ----
  the global variables ("roots") that the garbage collector starts at.
  Roots must be declared using one of the following syntaxes:
  
!    * 'extern GTY(([OPTIONS])) TYPE NAME;'
!    * 'static GTY(([OPTIONS])) TYPE NAME;'
! The syntax
!    * 'GTY(([OPTIONS])) TYPE NAME;'
! is _not_ accepted.  There should be an 'extern' declaration of such a
  variable in a header somewhere--mark that, not the definition.  Or, if
! the variable is only used in one file, make it 'static'.
  
  
  File: gccint.info,  Node: Files,  Next: Invoking the garbage collector,  Prev: GGC Roots,  Up: Type Information
*************** File: gccint.info,  Node: Files,  Next:
*** 39944,40000 ****
  22.5 Source Files Containing Type Information
  =============================================
  
! Whenever you add `GTY' markers to a source file that previously had
! none, or create a new source file containing `GTY' markers, there are
  three things you need to do:
  
    1. You need to add the file to the list of source files the type
       machinery scans.  There are four cases:
  
         a. For a back-end file, this is usually done automatically; if
!           not, you should add it to `target_gtfiles' in the appropriate
!           port's entries in `config.gcc'.
  
         b. For files shared by all front ends, add the filename to the
!           `GTFILES' variable in `Makefile.in'.
  
         c. For files that are part of one front end, add the filename to
!           the `gtfiles' variable defined in the appropriate
!           `config-lang.in'.  Headers should appear before non-headers
!           in this list.
  
         d. For files that are part of some but not all front ends, add
!           the filename to the `gtfiles' variable of _all_ the front ends
            that use it.
  
    2. If the file was a header file, you'll need to check that it's
       included in the right place to be visible to the generated files.
!      For a back-end header file, this should be done automatically.
!      For a front-end header file, it needs to be included by the same
!      file that includes `gtype-LANG.h'.  For other header files, it
!      needs to be included in `gtype-desc.c', which is a generated file,
!      so add it to `ifiles' in `open_base_file' in `gengtype.c'.
  
       For source files that aren't header files, the machinery will
       generate a header file that should be included in the source file
!      you just changed.  The file will be called `gt-PATH.h' where PATH
!      is the pathname relative to the `gcc' directory with slashes
       replaced by -, so for example the header file to be included in
!      `cp/parser.c' is called `gt-cp-parser.c'.  The generated header
       file should be included after everything else in the source file.
       Don't forget to mention this file as a dependency in the
!      `Makefile'!
! 
  
   For language frontends, there is another file that needs to be included
! somewhere.  It will be called `gtype-LANG.h', where LANG is the name of
  the subdirectory the language is contained in.
  
!  Plugins can add additional root tables.  Run the `gengtype' utility in
! plugin mode as `gengtype -P pluginout.h SOURCE-DIR FILE-LIST PLUGIN*.C'
! with your plugin files PLUGIN*.C using `GTY' to generate the
! PLUGINOUT.H file.  The GCC build tree is needed to be present in that
! mode.
  
  
  File: gccint.info,  Node: Invoking the garbage collector,  Next: Troubleshooting,  Prev: Files,  Up: Type Information
--- 39514,39568 ----
  22.5 Source Files Containing Type Information
  =============================================
  
! Whenever you add 'GTY' markers to a source file that previously had
! none, or create a new source file containing 'GTY' markers, there are
  three things you need to do:
  
    1. You need to add the file to the list of source files the type
       machinery scans.  There are four cases:
  
         a. For a back-end file, this is usually done automatically; if
!           not, you should add it to 'target_gtfiles' in the appropriate
!           port's entries in 'config.gcc'.
  
         b. For files shared by all front ends, add the filename to the
!           'GTFILES' variable in 'Makefile.in'.
  
         c. For files that are part of one front end, add the filename to
!           the 'gtfiles' variable defined in the appropriate
!           'config-lang.in'.  Headers should appear before non-headers in
!           this list.
  
         d. For files that are part of some but not all front ends, add
!           the filename to the 'gtfiles' variable of _all_ the front ends
            that use it.
  
    2. If the file was a header file, you'll need to check that it's
       included in the right place to be visible to the generated files.
!      For a back-end header file, this should be done automatically.  For
!      a front-end header file, it needs to be included by the same file
!      that includes 'gtype-LANG.h'.  For other header files, it needs to
!      be included in 'gtype-desc.c', which is a generated file, so add it
!      to 'ifiles' in 'open_base_file' in 'gengtype.c'.
  
       For source files that aren't header files, the machinery will
       generate a header file that should be included in the source file
!      you just changed.  The file will be called 'gt-PATH.h' where PATH
!      is the pathname relative to the 'gcc' directory with slashes
       replaced by -, so for example the header file to be included in
!      'cp/parser.c' is called 'gt-cp-parser.c'.  The generated header
       file should be included after everything else in the source file.
       Don't forget to mention this file as a dependency in the
!      'Makefile'!
  
   For language frontends, there is another file that needs to be included
! somewhere.  It will be called 'gtype-LANG.h', where LANG is the name of
  the subdirectory the language is contained in.
  
!  Plugins can add additional root tables.  Run the 'gengtype' utility in
! plugin mode as 'gengtype -P pluginout.h SOURCE-DIR FILE-LIST PLUGIN*.C'
! with your plugin files PLUGIN*.C using 'GTY' to generate the PLUGINOUT.H
! file.  The GCC build tree is needed to be present in that mode.
  
  
  File: gccint.info,  Node: Invoking the garbage collector,  Next: Troubleshooting,  Prev: Files,  Up: Type Information
*************** File: gccint.info,  Node: Invoking the g
*** 40002,40023 ****
  22.6 How to invoke the garbage collector
  ========================================
  
! The GCC garbage collector GGC is only invoked explicitly. In contrast
  with many other garbage collectors, it is not implicitly invoked by
! allocation routines when a lot of memory has been consumed. So the only
! way to have GGC reclaim storage is to call the `ggc_collect' function
! explicitly.  This call is an expensive operation, as it may have to
! scan the entire heap.  Beware that local variables (on the GCC call
! stack) are not followed by such an invocation (as many other garbage
! collectors do): you should reference all your data from static or
! external `GTY'-ed variables, and it is advised to call `ggc_collect'
! with a shallow call stack.  The GGC is an exact mark and sweep garbage
! collector (so it does not scan the call stack for pointers).  In
! practice GCC passes don't often call `ggc_collect' themselves, because
! it is called by the pass manager between passes.
  
!  At the time of the `ggc_collect' call all pointers in the GC-marked
! structures must be valid or `NULL'.  In practice this means that there
  should not be uninitialized pointer fields in the structures even if
  your code never reads or writes those fields at a particular instance.
  One way to ensure this is to use cleared versions of allocators unless
--- 39570,39591 ----
  22.6 How to invoke the garbage collector
  ========================================
  
! The GCC garbage collector GGC is only invoked explicitly.  In contrast
  with many other garbage collectors, it is not implicitly invoked by
! allocation routines when a lot of memory has been consumed.  So the only
! way to have GGC reclaim storage is to call the 'ggc_collect' function
! explicitly.  This call is an expensive operation, as it may have to scan
! the entire heap.  Beware that local variables (on the GCC call stack)
! are not followed by such an invocation (as many other garbage collectors
! do): you should reference all your data from static or external 'GTY'-ed
! variables, and it is advised to call 'ggc_collect' with a shallow call
! stack.  The GGC is an exact mark and sweep garbage collector (so it does
! not scan the call stack for pointers).  In practice GCC passes don't
! often call 'ggc_collect' themselves, because it is called by the pass
! manager between passes.
  
!  At the time of the 'ggc_collect' call all pointers in the GC-marked
! structures must be valid or 'NULL'.  In practice this means that there
  should not be uninitialized pointer fields in the structures even if
  your code never reads or writes those fields at a particular instance.
  One way to ensure this is to use cleared versions of allocators unless
*************** With the current garbage collector imple
*** 40033,40051 ****
  show up as GCC compilation errors.  Some of the most commonly
  encountered issues are described below.
  
!    * Gengtype does not produce allocators for a `GTY'-marked type.
       Gengtype checks if there is at least one possible path from GC
       roots to at least one instance of each type before outputting
!      allocators.  If there is no such path, the `GTY' markers will be
       ignored and no allocators will be output.  Solve this by making
       sure that there exists at least one such path.  If creating it is
       unfeasible or raises a "code smell", consider if you really must
       use GC for allocating such type.
  
!    * Link-time errors about undefined `gt_ggc_r_foo_bar' and
!      similarly-named symbols.  Check if your `foo_bar' source file has
!      `#include "gt-foo_bar.h"' as its very last line.
! 
  
  
  File: gccint.info,  Node: Plugins,  Next: LTO,  Prev: Type Information,  Up: Top
--- 39601,39618 ----
  show up as GCC compilation errors.  Some of the most commonly
  encountered issues are described below.
  
!    * Gengtype does not produce allocators for a 'GTY'-marked type.
       Gengtype checks if there is at least one possible path from GC
       roots to at least one instance of each type before outputting
!      allocators.  If there is no such path, the 'GTY' markers will be
       ignored and no allocators will be output.  Solve this by making
       sure that there exists at least one such path.  If creating it is
       unfeasible or raises a "code smell", consider if you really must
       use GC for allocating such type.
  
!    * Link-time errors about undefined 'gt_ggc_r_foo_bar' and
!      similarly-named symbols.  Check if your 'foo_bar' source file has
!      '#include "gt-foo_bar.h"' as its very last line.
  
  
  File: gccint.info,  Node: Plugins,  Next: LTO,  Prev: Type Information,  Up: Top
*************** File: gccint.info,  Node: Plugins loadin
*** 40081,40103 ****
  23.1 Loading Plugins
  ====================
  
! Plugins are supported on platforms that support `-ldl -rdynamic'.  They
! are loaded by the compiler using `dlopen' and invoked at pre-determined
  locations in the compilation process.
  
   Plugins are loaded with
  
!  `-fplugin=/path/to/NAME.so' `-fplugin-arg-NAME-KEY1[=VALUE1]'
  
!  The plugin arguments are parsed by GCC and passed to respective
! plugins as key-value pairs. Multiple plugins can be invoked by
! specifying multiple `-fplugin' arguments.
  
   A plugin can be simply given by its short name (no dots or slashes).
! When simply passing `-fplugin=NAME', the plugin is loaded from the
! `plugin' directory, so `-fplugin=NAME' is the same as `-fplugin=`gcc
! -print-file-name=plugin`/NAME.so', using backquote shell syntax to
! query the `plugin' directory.
  
  
  File: gccint.info,  Node: Plugin API,  Next: Plugins pass,  Prev: Plugins loading,  Up: Plugins
--- 39648,39670 ----
  23.1 Loading Plugins
  ====================
  
! Plugins are supported on platforms that support '-ldl -rdynamic'.  They
! are loaded by the compiler using 'dlopen' and invoked at pre-determined
  locations in the compilation process.
  
   Plugins are loaded with
  
!  '-fplugin=/path/to/NAME.so' '-fplugin-arg-NAME-KEY1[=VALUE1]'
  
!  The plugin arguments are parsed by GCC and passed to respective plugins
! as key-value pairs.  Multiple plugins can be invoked by specifying
! multiple '-fplugin' arguments.
  
   A plugin can be simply given by its short name (no dots or slashes).
! When simply passing '-fplugin=NAME', the plugin is loaded from the
! 'plugin' directory, so '-fplugin=NAME' is the same as '-fplugin=`gcc
! -print-file-name=plugin`/NAME.so', using backquote shell syntax to query
! the 'plugin' directory.
  
  
  File: gccint.info,  Node: Plugin API,  Next: Plugins pass,  Prev: Plugins loading,  Up: Plugins
*************** File: gccint.info,  Node: Plugin API,  N
*** 40106,40121 ****
  ===============
  
  Plugins are activated by the compiler at specific events as defined in
! `gcc-plugin.h'.  For each event of interest, the plugin should call
! `register_callback' specifying the name of the event and address of the
  callback function that will handle that event.
  
!  The header `gcc-plugin.h' must be the first gcc header to be included.
  
  23.2.1 Plugin license check
  ---------------------------
  
! Every plugin should define the global symbol `plugin_is_GPL_compatible'
  to assert that it has been licensed under a GPL-compatible license.  If
  this symbol does not exist, the compiler will emit a fatal error and
  exit with the error message:
--- 39673,39688 ----
  ===============
  
  Plugins are activated by the compiler at specific events as defined in
! 'gcc-plugin.h'.  For each event of interest, the plugin should call
! 'register_callback' specifying the name of the event and address of the
  callback function that will handle that event.
  
!  The header 'gcc-plugin.h' must be the first gcc header to be included.
  
  23.2.1 Plugin license check
  ---------------------------
  
! Every plugin should define the global symbol 'plugin_is_GPL_compatible'
  to assert that it has been licensed under a GPL-compatible license.  If
  this symbol does not exist, the compiler will emit a fatal error and
  exit with the error message:
*************** exit with the error message:
*** 40125,40153 ****
       compilation terminated
  
   The declared type of the symbol should be int, to match a forward
! declaration in `gcc-plugin.h' that suppresses C++ mangling.  It does
! not need to be in any allocated section, though.  The compiler merely
! asserts that the symbol exists in the global scope.  Something like
! this is enough:
  
       int plugin_is_GPL_compatible;
  
  23.2.2 Plugin initialization
  ----------------------------
  
! Every plugin should export a function called `plugin_init' that is
! called right after the plugin is loaded. This function is responsible
  for registering all the callbacks required by the plugin and do any
  other required initialization.
  
!  This function is called from `compile_file' right before invoking the
! parser.  The arguments to `plugin_init' are:
! 
!    * `plugin_info': Plugin invocation information.
  
!    * `version': GCC version.
  
!  The `plugin_info' struct is defined as follows:
  
       struct plugin_name_args
       {
--- 39692,39719 ----
       compilation terminated
  
   The declared type of the symbol should be int, to match a forward
! declaration in 'gcc-plugin.h' that suppresses C++ mangling.  It does not
! need to be in any allocated section, though.  The compiler merely
! asserts that the symbol exists in the global scope.  Something like this
! is enough:
  
       int plugin_is_GPL_compatible;
  
  23.2.2 Plugin initialization
  ----------------------------
  
! Every plugin should export a function called 'plugin_init' that is
! called right after the plugin is loaded.  This function is responsible
  for registering all the callbacks required by the plugin and do any
  other required initialization.
  
!  This function is called from 'compile_file' right before invoking the
! parser.  The arguments to 'plugin_init' are:
  
!    * 'plugin_info': Plugin invocation information.
!    * 'version': GCC version.
  
!  The 'plugin_info' struct is defined as follows:
  
       struct plugin_name_args
       {
*************** parser.  The arguments to `plugin_init'
*** 40162,40168 ****
         const char *help;             /* Help string provided by plugin. */
       }
  
!  If initialization fails, `plugin_init' must return a non-zero value.
  Otherwise, it should return 0.
  
   The version of the GCC compiler loading the plugin is described by the
--- 39728,39734 ----
         const char *help;             /* Help string provided by plugin. */
       }
  
!  If initialization fails, 'plugin_init' must return a non-zero value.
  Otherwise, it should return 0.
  
   The version of the GCC compiler loading the plugin is described by the
*************** following structure:
*** 40177,40188 ****
         const char *configuration_arguments;
       };
  
!  The function `plugin_default_version_check' takes two pointers to such
! structure and compare them field by field. It can be used by the
! plugin's `plugin_init' function.
  
   The version of GCC used to compile the plugin can be found in the
! symbol `gcc_version' defined in the header `plugin-version.h'. The
  recommended version check to perform looks like
  
       #include "plugin-version.h"
--- 39743,39754 ----
         const char *configuration_arguments;
       };
  
!  The function 'plugin_default_version_check' takes two pointers to such
! structure and compare them field by field.  It can be used by the
! plugin's 'plugin_init' function.
  
   The version of GCC used to compile the plugin can be found in the
! symbol 'gcc_version' defined in the header 'plugin-version.h'.  The
  recommended version check to perform looks like
  
       #include "plugin-version.h"
*************** Callback functions have the following pr
*** 40259,40292 ****
  
   In addition, plugins can also look up the enumerator of a named event,
  and / or generate new events dynamically, by calling the function
! `get_named_event_id'.
  
!  To register a callback, the plugin calls `register_callback' with the
  arguments:
  
!    * `char *name': Plugin name.
! 
!    * `int event': The event code.
! 
!    * `plugin_callback_func callback': The function that handles `event'.
! 
!    * `void *user_data': Pointer to plugin-specific data.
  
   For the PLUGIN_PASS_MANAGER_SETUP, PLUGIN_INFO, and
! PLUGIN_REGISTER_GGC_ROOTS pseudo-events the `callback' should be null,
! and the `user_data' is specific.
  
!  When the PLUGIN_PRAGMAS event is triggered (with a null pointer as
! data from GCC), plugins may register their own pragmas.  Notice that
! pragmas are not available from `lto1', so plugins used with `-flto'
! option to GCC during link-time optimization cannot use pragmas and do
! not even see functions like `c_register_pragma' or `pragma_lex'.
  
!  The PLUGIN_INCLUDE_FILE event, with a `const char*' file path as GCC
! data, is triggered for processing of `#include' or `#line' directives.
  
   The PLUGIN_FINISH event is the last time that plugins can call GCC
! functions, notably emit diagnostics with `warning', `error' etc.
  
  
  File: gccint.info,  Node: Plugins pass,  Next: Plugins GC,  Prev: Plugin API,  Up: Plugins
--- 39825,39855 ----
  
   In addition, plugins can also look up the enumerator of a named event,
  and / or generate new events dynamically, by calling the function
! 'get_named_event_id'.
  
!  To register a callback, the plugin calls 'register_callback' with the
  arguments:
  
!    * 'char *name': Plugin name.
!    * 'int event': The event code.
!    * 'plugin_callback_func callback': The function that handles 'event'.
!    * 'void *user_data': Pointer to plugin-specific data.
  
   For the PLUGIN_PASS_MANAGER_SETUP, PLUGIN_INFO, and
! PLUGIN_REGISTER_GGC_ROOTS pseudo-events the 'callback' should be null,
! and the 'user_data' is specific.
  
!  When the PLUGIN_PRAGMAS event is triggered (with a null pointer as data
! from GCC), plugins may register their own pragmas.  Notice that pragmas
! are not available from 'lto1', so plugins used with '-flto' option to
! GCC during link-time optimization cannot use pragmas and do not even see
! functions like 'c_register_pragma' or 'pragma_lex'.
  
!  The PLUGIN_INCLUDE_FILE event, with a 'const char*' file path as GCC
! data, is triggered for processing of '#include' or '#line' directives.
  
   The PLUGIN_FINISH event is the last time that plugins can call GCC
! functions, notably emit diagnostics with 'warning', 'error' etc.
  
  
  File: gccint.info,  Node: Plugins pass,  Next: Plugins GC,  Prev: Plugin API,  Up: Plugins
*************** File: gccint.info,  Node: Plugins pass,
*** 40294,40307 ****
  23.3 Interacting with the pass manager
  ======================================
  
! There needs to be a way to add/reorder/remove passes dynamically. This
  is useful for both analysis plugins (plugging in after a certain pass
  such as CFG or an IPA pass) and optimization plugins.
  
   Basic support for inserting new passes or replacing existing passes is
! provided. A plugin registers a new pass with GCC by calling
! `register_callback' with the `PLUGIN_PASS_MANAGER_SETUP' event and a
! pointer to a `struct register_pass_info' object defined as follows
  
       enum pass_positioning_ops
       {
--- 39857,39870 ----
  23.3 Interacting with the pass manager
  ======================================
  
! There needs to be a way to add/reorder/remove passes dynamically.  This
  is useful for both analysis plugins (plugging in after a certain pass
  such as CFG or an IPA pass) and optimization plugins.
  
   Basic support for inserting new passes or replacing existing passes is
! provided.  A plugin registers a new pass with GCC by calling
! 'register_callback' with the 'PLUGIN_PASS_MANAGER_SETUP' event and a
! pointer to a 'struct register_pass_info' object defined as follows
  
       enum pass_positioning_ops
       {
*************** File: gccint.info,  Node: Plugins GC,  N
*** 40348,40379 ****
  ===============================================
  
  Some plugins may want to be informed when GGC (the GCC Garbage
! Collector) is running. They can register callbacks for the
! `PLUGIN_GGC_START' and `PLUGIN_GGC_END' events (for which the callback
! is called with a null `gcc_data') to be notified of the start or end of
  the GCC garbage collection.
  
!  Some plugins may need to have GGC mark additional data. This can be
! done by registering a callback (called with a null `gcc_data') for the
! `PLUGIN_GGC_MARKING' event. Such callbacks can call the `ggc_set_mark'
! routine, preferably through the `ggc_mark' macro (and conversely, these
  routines should usually not be used in plugins outside of the
! `PLUGIN_GGC_MARKING' event).  Plugins that wish to hold weak references
  to gc data may also use this event to drop weak references when the
! object is about to be collected.  The `ggc_marked_p' function can be
! used to tell if an object is marked, or is about to  be collected.  The
! `gt_clear_cache' overloads which some types define may also be of use in
  managing weak references.
  
!  Some plugins may need to add extra GGC root tables, e.g. to handle
! their own `GTY'-ed data. This can be done with the
! `PLUGIN_REGISTER_GGC_ROOTS' pseudo-event with a null callback and the
! extra root table (of type `struct ggc_root_tab*') as `user_data'.
! Running the  `gengtype -p SOURCE-DIR FILE-LIST PLUGIN*.C ...' utility
  generates these extra root tables.
  
   You should understand the details of memory management inside GCC
! before using `PLUGIN_GGC_MARKING' or `PLUGIN_REGISTER_GGC_ROOTS'.
  
  
  File: gccint.info,  Node: Plugins description,  Next: Plugins attr,  Prev: Plugins GC,  Up: Plugins
--- 39911,39942 ----
  ===============================================
  
  Some plugins may want to be informed when GGC (the GCC Garbage
! Collector) is running.  They can register callbacks for the
! 'PLUGIN_GGC_START' and 'PLUGIN_GGC_END' events (for which the callback
! is called with a null 'gcc_data') to be notified of the start or end of
  the GCC garbage collection.
  
!  Some plugins may need to have GGC mark additional data.  This can be
! done by registering a callback (called with a null 'gcc_data') for the
! 'PLUGIN_GGC_MARKING' event.  Such callbacks can call the 'ggc_set_mark'
! routine, preferably through the 'ggc_mark' macro (and conversely, these
  routines should usually not be used in plugins outside of the
! 'PLUGIN_GGC_MARKING' event).  Plugins that wish to hold weak references
  to gc data may also use this event to drop weak references when the
! object is about to be collected.  The 'ggc_marked_p' function can be
! used to tell if an object is marked, or is about to be collected.  The
! 'gt_clear_cache' overloads which some types define may also be of use in
  managing weak references.
  
!  Some plugins may need to add extra GGC root tables, e.g.  to handle
! their own 'GTY'-ed data.  This can be done with the
! 'PLUGIN_REGISTER_GGC_ROOTS' pseudo-event with a null callback and the
! extra root table (of type 'struct ggc_root_tab*') as 'user_data'.
! Running the 'gengtype -p SOURCE-DIR FILE-LIST PLUGIN*.C ...' utility
  generates these extra root tables.
  
   You should understand the details of memory management inside GCC
! before using 'PLUGIN_GGC_MARKING' or 'PLUGIN_REGISTER_GGC_ROOTS'.
  
  
  File: gccint.info,  Node: Plugins description,  Next: Plugins attr,  Prev: Plugins GC,  Up: Plugins
*************** File: gccint.info,  Node: Plugins descri
*** 40381,40387 ****
  23.5 Giving information about a plugin
  ======================================
  
! A plugin should give some information to the user about itself. This
  uses the following structure:
  
       struct plugin_info
--- 39944,39950 ----
  23.5 Giving information about a plugin
  ======================================
  
! A plugin should give some information to the user about itself.  This
  uses the following structure:
  
       struct plugin_info
*************** uses the following structure:
*** 40390,40397 ****
         const char *help;
       };
  
!  Such a structure is passed as the `user_data' by the plugin's init
! routine using `register_callback' with the `PLUGIN_INFO' pseudo-event
  and a null callback.
  
  
--- 39953,39960 ----
         const char *help;
       };
  
!  Such a structure is passed as the 'user_data' by the plugin's init
! routine using 'register_callback' with the 'PLUGIN_INFO' pseudo-event
  and a null callback.
  
  
*************** File: gccint.info,  Node: Plugins attr,
*** 40403,40410 ****
  For analysis (or other) purposes it is useful to be able to add custom
  attributes or pragmas.
  
!  The `PLUGIN_ATTRIBUTES' callback is called during attribute
! registration. Use the `register_attribute' function to register custom
  attributes.
  
       /* Attribute handler callback */
--- 39966,39973 ----
  For analysis (or other) purposes it is useful to be able to add custom
  attributes or pragmas.
  
!  The 'PLUGIN_ATTRIBUTES' callback is called during attribute
! registration.  Use the 'register_attribute' function to register custom
  attributes.
  
       /* Attribute handler callback */
*************** attributes.
*** 40429,40440 ****
         register_attribute (&user_attr);
       }
  
!  The PLUGIN_PRAGMAS callback is called once during pragmas
! registration. Use the `c_register_pragma',
! `c_register_pragma_with_data', `c_register_pragma_with_expansion',
! `c_register_pragma_with_expansion_and_data' functions to register
! custom pragmas and their handlers (which often want to call
! `pragma_lex') from `c-family/c-pragma.h'.
  
       /* Plugin callback called during pragmas registration. Registered with
            register_callback (plugin_name, PLUGIN_PRAGMAS,
--- 39992,40004 ----
         register_attribute (&user_attr);
       }
  
! 
!  The PLUGIN_PRAGMAS callback is called once during pragmas registration.
! Use the 'c_register_pragma', 'c_register_pragma_with_data',
! 'c_register_pragma_with_expansion',
! 'c_register_pragma_with_expansion_and_data' functions to register custom
! pragmas and their handlers (which often want to call 'pragma_lex') from
! 'c-family/c-pragma.h'.
  
       /* Plugin callback called during pragmas registration. Registered with
            register_callback (plugin_name, PLUGIN_PRAGMAS,
*************** custom pragmas and their handlers (which
*** 40447,40458 ****
         c_register_pragma ("GCCPLUGIN", "sayhello", handle_pragma_sayhello);
       }
  
!  It is suggested to pass `"GCCPLUGIN"' (or a short name identifying
! your plugin) as the "space" argument of your pragma.
  
!  Pragmas registered with `c_register_pragma_with_expansion' or
! `c_register_pragma_with_expansion_and_data' support preprocessor
! expansions. For example:
  
       #define NUMBER 10
       #pragma GCCPLUGIN foothreshold (NUMBER)
--- 40011,40022 ----
         c_register_pragma ("GCCPLUGIN", "sayhello", handle_pragma_sayhello);
       }
  
!  It is suggested to pass '"GCCPLUGIN"' (or a short name identifying your
! plugin) as the "space" argument of your pragma.
  
!  Pragmas registered with 'c_register_pragma_with_expansion' or
! 'c_register_pragma_with_expansion_and_data' support preprocessor
! expansions.  For example:
  
       #define NUMBER 10
       #pragma GCCPLUGIN foothreshold (NUMBER)
*************** File: gccint.info,  Node: Plugins record
*** 40464,40477 ****
  ===============================================
  
  The event PLUGIN_PASS_EXECUTION passes the pointer to the executed pass
! (the same as current_pass) as `gcc_data' to the callback.  You can also
  inspect cfun to find out about which function this pass is executed for.
  Note that this event will only be invoked if the gate check (if
  applicable, modified by PLUGIN_OVERRIDE_GATE) succeeds.  You can use
! other hooks, like `PLUGIN_ALL_PASSES_START', `PLUGIN_ALL_PASSES_END',
! `PLUGIN_ALL_IPA_PASSES_START', `PLUGIN_ALL_IPA_PASSES_END',
! `PLUGIN_EARLY_GIMPLE_PASSES_START', and/or
! `PLUGIN_EARLY_GIMPLE_PASSES_END' to manipulate global state in your
  plugin(s) in order to get context for the pass execution.
  
  
--- 40028,40041 ----
  ===============================================
  
  The event PLUGIN_PASS_EXECUTION passes the pointer to the executed pass
! (the same as current_pass) as 'gcc_data' to the callback.  You can also
  inspect cfun to find out about which function this pass is executed for.
  Note that this event will only be invoked if the gate check (if
  applicable, modified by PLUGIN_OVERRIDE_GATE) succeeds.  You can use
! other hooks, like 'PLUGIN_ALL_PASSES_START', 'PLUGIN_ALL_PASSES_END',
! 'PLUGIN_ALL_IPA_PASSES_START', 'PLUGIN_ALL_IPA_PASSES_END',
! 'PLUGIN_EARLY_GIMPLE_PASSES_START', and/or
! 'PLUGIN_EARLY_GIMPLE_PASSES_END' to manipulate global state in your
  plugin(s) in order to get context for the pass execution.
  
  
*************** File: gccint.info,  Node: Plugins gate,
*** 40482,40489 ****
  
  After the original gate function for a pass is called, its result - the
  gate status - is stored as an integer.  Then the event
! `PLUGIN_OVERRIDE_GATE' is invoked, with a pointer to the gate status in
! the `gcc_data' parameter to the callback function.  A nonzero value of
  the gate status means that the pass is to be executed.  You can both
  read and write the gate status via the passed pointer.
  
--- 40046,40053 ----
  
  After the original gate function for a pass is called, its result - the
  gate status - is stored as an integer.  Then the event
! 'PLUGIN_OVERRIDE_GATE' is invoked, with a pointer to the gate status in
! the 'gcc_data' parameter to the callback function.  A nonzero value of
  the gate status means that the pass is to be executed.  You can both
  read and write the gate status via the passed pointer.
  
*************** File: gccint.info,  Node: Plugins tracki
*** 40496,40504 ****
  When your plugin is loaded, you can inspect the various pass lists to
  determine what passes are available.  However, other plugins might add
  new passes.  Also, future changes to GCC might cause generic passes to
! be added after plugin loading.  When a pass is first added to one of
! the pass lists, the event `PLUGIN_NEW_PASS' is invoked, with the
! callback parameter `gcc_data' pointing to the new pass.
  
  
  File: gccint.info,  Node: Plugins building,  Prev: Plugins tracking,  Up: Plugins
--- 40060,40068 ----
  When your plugin is loaded, you can inspect the various pass lists to
  determine what passes are available.  However, other plugins might add
  new passes.  Also, future changes to GCC might cause generic passes to
! be added after plugin loading.  When a pass is first added to one of the
! pass lists, the event 'PLUGIN_NEW_PASS' is invoked, with the callback
! parameter 'gcc_data' pointing to the new pass.
  
  
  File: gccint.info,  Node: Plugins building,  Prev: Plugins tracking,  Up: Plugins
*************** File: gccint.info,  Node: Plugins buildi
*** 40507,40528 ****
  ==========================
  
  If plugins are enabled, GCC installs the headers needed to build a
! plugin (somewhere in the installation tree, e.g. under `/usr/local').
! In particular a `plugin/include' directory is installed, containing all
  the header files needed to build plugins.
  
!  On most systems, you can query this `plugin' directory by invoking
! `gcc -print-file-name=plugin' (replace if needed `gcc' with the
! appropriate program path).
  
!  Inside plugins, this `plugin' directory name can be queried by calling
! `default_plugin_dir_name ()'.
  
   Plugins may know, when they are compiled, the GCC version for which
! `plugin-version.h' is provided.  The constant macros
! `GCCPLUGIN_VERSION_MAJOR', `GCCPLUGIN_VERSION_MINOR',
! `GCCPLUGIN_VERSION_PATCHLEVEL', `GCCPLUGIN_VERSION' are integer
! numbers, so a plugin could ensure it is built for GCC 4.7 with
       #if GCCPLUGIN_VERSION != 4007
       #error this GCC plugin is for GCC 4.7
       #endif
--- 40071,40092 ----
  ==========================
  
  If plugins are enabled, GCC installs the headers needed to build a
! plugin (somewhere in the installation tree, e.g.  under '/usr/local').
! In particular a 'plugin/include' directory is installed, containing all
  the header files needed to build plugins.
  
!  On most systems, you can query this 'plugin' directory by invoking 'gcc
! -print-file-name=plugin' (replace if needed 'gcc' with the appropriate
! program path).
  
!  Inside plugins, this 'plugin' directory name can be queried by calling
! 'default_plugin_dir_name ()'.
  
   Plugins may know, when they are compiled, the GCC version for which
! 'plugin-version.h' is provided.  The constant macros
! 'GCCPLUGIN_VERSION_MAJOR', 'GCCPLUGIN_VERSION_MINOR',
! 'GCCPLUGIN_VERSION_PATCHLEVEL', 'GCCPLUGIN_VERSION' are integer numbers,
! so a plugin could ensure it is built for GCC 4.7 with
       #if GCCPLUGIN_VERSION != 4007
       #error this GCC plugin is for GCC 4.7
       #endif
*************** numbers, so a plugin could ensure it is
*** 40538,40551 ****
       plugin.so: $(PLUGIN_SOURCE_FILES)
          $(HOST_GCC) -shared $(CXXFLAGS) $^ -o $@
  
!  A single source file plugin may be built with `g++ -I`gcc
  -print-file-name=plugin`/include -fPIC -shared -fno-rtti -O2 plugin.c -o
! plugin.so', using backquote shell syntax to query the `plugin'
  directory.
  
!  When a plugin needs to use `gengtype', be sure that both `gengtype'
! and `gtype.state' have the same version as the GCC for which the plugin
! is built.
  
  
  File: gccint.info,  Node: LTO,  Next: Match and Simplify,  Prev: Plugins,  Up: Top
--- 40102,40115 ----
       plugin.so: $(PLUGIN_SOURCE_FILES)
          $(HOST_GCC) -shared $(CXXFLAGS) $^ -o $@
  
!  A single source file plugin may be built with 'g++ -I`gcc
  -print-file-name=plugin`/include -fPIC -shared -fno-rtti -O2 plugin.c -o
! plugin.so', using backquote shell syntax to query the 'plugin'
  directory.
  
!  When a plugin needs to use 'gengtype', be sure that both 'gengtype' and
! 'gtype.state' have the same version as the GCC for which the plugin is
! built.
  
  
  File: gccint.info,  Node: LTO,  Next: Match and Simplify,  Prev: Plugins,  Up: Top
*************** File: gccint.info,  Node: LTO,  Next: Ma
*** 40555,40564 ****
  
  Link Time Optimization (LTO) gives GCC the capability of dumping its
  internal representation (GIMPLE) to disk, so that all the different
! compilation units that make up a single executable can be optimized as
! a single module.  This expands the scope of inter-procedural
! optimizations to encompass the whole program (or, rather, everything
! that is visible at link time).
  
  * Menu:
  
--- 40119,40128 ----
  
  Link Time Optimization (LTO) gives GCC the capability of dumping its
  internal representation (GIMPLE) to disk, so that all the different
! compilation units that make up a single executable can be optimized as a
! single module.  This expands the scope of inter-procedural optimizations
! to encompass the whole program (or, rather, everything that is visible
! at link time).
  
  * Menu:
  
*************** that is visible at link time).
*** 40567,40573 ****
  * IPA::                     Using summary information in IPA passes.
  * WHOPR::                   Whole program assumptions,
                              linker plugin and symbol visibilities.
! * Internal flags::          Internal flags controlling `lto1'.
  
  
  File: gccint.info,  Node: LTO Overview,  Next: LTO object file layout,  Up: LTO
--- 40131,40137 ----
  * IPA::                     Using summary information in IPA passes.
  * WHOPR::                   Whole program assumptions,
                              linker plugin and symbol visibilities.
! * Internal flags::          Internal flags controlling 'lto1'.
  
  
  File: gccint.info,  Node: LTO Overview,  Next: LTO object file layout,  Up: LTO
*************** File: gccint.info,  Node: LTO Overview,
*** 40576,40582 ****
  ====================
  
  Link time optimization is implemented as a GCC front end for a bytecode
! representation of GIMPLE that is emitted in special sections of `.o'
  files.  Currently, LTO support is enabled in most ELF-based systems, as
  well as darwin, cygwin and mingw systems.
  
--- 40140,40146 ----
  ====================
  
  Link time optimization is implemented as a GCC front end for a bytecode
! representation of GIMPLE that is emitted in special sections of '.o'
  files.  Currently, LTO support is enabled in most ELF-based systems, as
  well as darwin, cygwin and mingw systems.
  
*************** build systems, as one can, for instance,
*** 40587,40603 ****
  Additionally, one might be able to ship one set of fat objects which
  could be used both for development and the production of optimized
  builds.  A, perhaps surprising, side effect of this feature is that any
! mistake in the toolchain that leads to LTO information not being used
! (e.g. an older `libtool' calling `ld' directly).  This is both an
! advantage, as the system is more robust, and a disadvantage, as the
! user is not informed that the optimization has been disabled.
  
   The current implementation only produces "fat" objects, effectively
  doubling compilation time and increasing file sizes up to 5x the
! original size.  This hides the problem that some tools, such as `ar'
! and `nm', need to understand symbol tables of LTO sections.  These
! tools were extended to use the plugin infrastructure, and with these
! problems solved, GCC will also support "slim" objects consisting of the
  intermediate code alone.
  
   At the highest level, LTO splits the compiler in two.  The first half
--- 40151,40167 ----
  Additionally, one might be able to ship one set of fat objects which
  could be used both for development and the production of optimized
  builds.  A, perhaps surprising, side effect of this feature is that any
! mistake in the toolchain leads to LTO information not being used (e.g.
! an older 'libtool' calling 'ld' directly).  This is both an advantage,
! as the system is more robust, and a disadvantage, as the user is not
! informed that the optimization has been disabled.
  
   The current implementation only produces "fat" objects, effectively
  doubling compilation time and increasing file sizes up to 5x the
! original size.  This hides the problem that some tools, such as 'ar' and
! 'nm', need to understand symbol tables of LTO sections.  These tools
! were extended to use the plugin infrastructure, and with these problems
! solved, GCC will also support "slim" objects consisting of the
  intermediate code alone.
  
   At the highest level, LTO splits the compiler in two.  The first half
*************** data structures needed to optimize and g
*** 40606,40653 ****
  declarations, types, the callgraph and the GIMPLE representation of
  function bodies.
  
!  When `-flto' is given during compilation of a source file, the pass
! manager executes all the passes in `all_lto_gen_passes'.  Currently,
  this phase is composed of two IPA passes:
  
!    * `pass_ipa_lto_gimple_out' This pass executes the function
!      `lto_output' in `lto-streamer-out.c', which traverses the call
       graph encoding every reachable declaration, type and function.
       This generates a memory representation of all the file sections
       described below.
  
!    * `pass_ipa_lto_finish_out' This pass executes the function
!      `produce_asm_for_decls' in `lto-streamer-out.c', which takes the
       memory image built in the previous pass and encodes it in the
       corresponding ELF file sections.
  
!  The second half of LTO support is the "reader".  This is implemented
! as the GCC front end `lto1' in `lto/lto.c'.  When `collect2' detects a
! link set of `.o'/`.a' files with LTO information and the `-flto' is
! enabled, it invokes `lto1' which reads the set of files and aggregates
! them into a single translation unit for optimization.  The main entry
! point for the reader is `lto/lto.c':`lto_main'.
  
  24.1.1 LTO modes of operation
  -----------------------------
  
  One of the main goals of the GCC link-time infrastructure was to allow
! effective compilation of large programs.  For this reason GCC
! implements two link-time compilation modes.
  
!   1. _LTO mode_, in which the whole program is read into the compiler
!      at link-time and optimized in a similar way as if it were a single
       source-level compilation unit.
  
    2. _WHOPR or partitioned mode_, designed to utilize multiple CPUs
       and/or a distributed compilation environment to quickly link large
       applications.  WHOPR stands for WHOle Program optimizeR (not to be
!      confused with the semantics of `-fwhole-program').  It partitions
!      the aggregated callgraph from many different `.o' files and
       distributes the compilation of the sub-graphs to different CPUs.
  
       Note that distributed compilation is not implemented yet, but since
!      the parallelism is facilitated via generating a `Makefile', it
       would be easy to implement.
  
   WHOPR splits LTO into three main stages:
--- 40170,40217 ----
  declarations, types, the callgraph and the GIMPLE representation of
  function bodies.
  
!  When '-flto' is given during compilation of a source file, the pass
! manager executes all the passes in 'all_lto_gen_passes'.  Currently,
  this phase is composed of two IPA passes:
  
!    * 'pass_ipa_lto_gimple_out' This pass executes the function
!      'lto_output' in 'lto-streamer-out.c', which traverses the call
       graph encoding every reachable declaration, type and function.
       This generates a memory representation of all the file sections
       described below.
  
!    * 'pass_ipa_lto_finish_out' This pass executes the function
!      'produce_asm_for_decls' in 'lto-streamer-out.c', which takes the
       memory image built in the previous pass and encodes it in the
       corresponding ELF file sections.
  
!  The second half of LTO support is the "reader".  This is implemented as
! the GCC front end 'lto1' in 'lto/lto.c'.  When 'collect2' detects a link
! set of '.o'/'.a' files with LTO information and the '-flto' is enabled,
! it invokes 'lto1' which reads the set of files and aggregates them into
! a single translation unit for optimization.  The main entry point for
! the reader is 'lto/lto.c':'lto_main'.
  
  24.1.1 LTO modes of operation
  -----------------------------
  
  One of the main goals of the GCC link-time infrastructure was to allow
! effective compilation of large programs.  For this reason GCC implements
! two link-time compilation modes.
  
!   1. _LTO mode_, in which the whole program is read into the compiler at
!      link-time and optimized in a similar way as if it were a single
       source-level compilation unit.
  
    2. _WHOPR or partitioned mode_, designed to utilize multiple CPUs
       and/or a distributed compilation environment to quickly link large
       applications.  WHOPR stands for WHOle Program optimizeR (not to be
!      confused with the semantics of '-fwhole-program').  It partitions
!      the aggregated callgraph from many different '.o' files and
       distributes the compilation of the sub-graphs to different CPUs.
  
       Note that distributed compilation is not implemented yet, but since
!      the parallelism is facilitated via generating a 'Makefile', it
       would be easy to implement.
  
   WHOPR splits LTO into three main stages:
*************** implements two link-time compilation mod
*** 40661,40669 ****
       global call-graph is generated, and a global analysis procedure
       makes transformation decisions.  The global call-graph is
       partitioned to facilitate parallel optimization during phase 3.
!      The results of the WPA stage are stored into new object files
!      which contain the partitions of program expressed in the
!      intermediate language and the optimization decisions.
  
    3. Local transformations (LTRANS) This stage executes in parallel.
       All the decisions made during phase 2 are implemented locally in
--- 40225,40233 ----
       global call-graph is generated, and a global analysis procedure
       makes transformation decisions.  The global call-graph is
       partitioned to facilitate parallel optimization during phase 3.
!      The results of the WPA stage are stored into new object files which
!      contain the partitions of program expressed in the intermediate
!      language and the optimization decisions.
  
    3. Local transformations (LTRANS) This stage executes in parallel.
       All the decisions made during phase 2 are implemented locally in
*************** implements two link-time compilation mod
*** 40672,40689 ****
       during the phase 2 may be performed on the local call-graph
       partitions.
  
!  WHOPR can be seen as an extension of the usual LTO mode of
! compilation.  In LTO, WPA and LTRANS are executed within a single
! execution of the compiler, after the whole program has been read into
! memory.
  
   When compiling in WHOPR mode, the callgraph is partitioned during the
! WPA stage.  The whole program is split into a given number of
! partitions of roughly the same size.  The compiler tries to minimize
! the number of references which cross partition boundaries.  The main
! advantage of WHOPR is to allow the parallel execution of LTRANS stages,
! which are the most time-consuming part of the compilation process.
! Additionally, it avoids the need to load the whole program into memory.
  
  
  File: gccint.info,  Node: LTO object file layout,  Next: IPA,  Prev: LTO Overview,  Up: LTO
--- 40236,40252 ----
       during the phase 2 may be performed on the local call-graph
       partitions.
  
!  WHOPR can be seen as an extension of the usual LTO mode of compilation.
! In LTO, WPA and LTRANS are executed within a single execution of the
! compiler, after the whole program has been read into memory.
  
   When compiling in WHOPR mode, the callgraph is partitioned during the
! WPA stage.  The whole program is split into a given number of partitions
! of roughly the same size.  The compiler tries to minimize the number of
! references which cross partition boundaries.  The main advantage of
! WHOPR is to allow the parallel execution of LTRANS stages, which are the
! most time-consuming part of the compilation process.  Additionally, it
! avoids the need to load the whole program into memory.
  
  
  File: gccint.info,  Node: LTO object file layout,  Next: IPA,  Prev: LTO Overview,  Up: LTO
*************** File: gccint.info,  Node: LTO object fil
*** 40693,40705 ****
  
  LTO information is stored in several ELF sections inside object files.
  Data structures and enum codes for sections are defined in
! `lto-streamer.h'.
  
!  These sections are emitted from `lto-streamer-out.c' and mapped in all
! at once from `lto/lto.c':`lto_file_read'.  The individual functions
  dealing with the reading/writing of each section are described below.
  
!    * Command line options (`.gnu.lto_.opts')
  
       This section contains the command line options used to generate the
       object files.  This is used at link time to determine the
--- 40256,40268 ----
  
  LTO information is stored in several ELF sections inside object files.
  Data structures and enum codes for sections are defined in
! 'lto-streamer.h'.
  
!  These sections are emitted from 'lto-streamer-out.c' and mapped in all
! at once from 'lto/lto.c':'lto_file_read'.  The individual functions
  dealing with the reading/writing of each section are described below.
  
!    * Command line options ('.gnu.lto_.opts')
  
       This section contains the command line options used to generate the
       object files.  This is used at link time to determine the
*************** dealing with the reading/writing of each
*** 40712,40723 ****
       the options saved on all the files in a link-time set are applied
       globally.  No attempt is made at validating the combination of
       flags (other than the usual validation done by option processing).
!      This is implemented in `lto/lto.c':`lto_read_all_file_options'.
  
!    * Symbol table (`.gnu.lto_.symtab')
  
       This table replaces the ELF symbol table for functions and
!      variables represented in the LTO IL.  Symbols used and exported by
       the optimized assembly code of "fat" objects might not match the
       ones used and exported by the intermediate code.  This table is
       necessary because the intermediate code is less optimized and thus
--- 40275,40286 ----
       the options saved on all the files in a link-time set are applied
       globally.  No attempt is made at validating the combination of
       flags (other than the usual validation done by option processing).
!      This is implemented in 'lto/lto.c':'lto_read_all_file_options'.
  
!    * Symbol table ('.gnu.lto_.symtab')
  
       This table replaces the ELF symbol table for functions and
!      variables represented in the LTO IL. Symbols used and exported by
       the optimized assembly code of "fat" objects might not match the
       ones used and exported by the intermediate code.  This table is
       necessary because the intermediate code is less optimized and thus
*************** dealing with the reading/writing of each
*** 40731,40794 ****
       symbol table was used.
  
       The symbol table is emitted in
!      `lto-streamer-out.c':`produce_symtab'.
  
!    * Global declarations and types (`.gnu.lto_.decls')
  
       This section contains an intermediate language dump of all
       declarations and types required to represent the callgraph, static
       variables and top-level debug info.
  
       The contents of this section are emitted in
!      `lto-streamer-out.c':`produce_asm_for_decls'.  Types and symbols
       are emitted in a topological order that preserves the sharing of
       pointers when the file is read back in
!      (`lto.c':`read_cgraph_and_symbols').
  
!    * The callgraph (`.gnu.lto_.cgraph')
  
       This section contains the basic data structure used by the GCC
       inter-procedural optimization infrastructure.  This section stores
       an annotated multi-graph which represents the functions and call
!      sites as well as the variables, aliases and top-level `asm'
       statements.
  
!      This section is emitted in `lto-streamer-out.c':`output_cgraph'
!      and read in `lto-cgraph.c':`input_cgraph'.
  
!    * IPA references (`.gnu.lto_.refs')
  
       This section contains references between function and static
!      variables.  It is emitted by `lto-cgraph.c':`output_refs' and read
!      by `lto-cgraph.c':`input_refs'.
  
!    * Function bodies (`.gnu.lto_.function_body.<name>')
  
       This section contains function bodies in the intermediate language
       representation.  Every function body is in a separate section to
       allow copying of the section independently to different object
       files or reading the function on demand.
  
!      Functions are emitted in `lto-streamer-out.c':`output_function'
!      and read in `lto-streamer-in.c':`input_function'.
  
!    * Static variable initializers (`.gnu.lto_.vars')
  
       This section contains all the symbols in the global variable pool.
!      It is emitted by `lto-cgraph.c':`output_varpool' and read in
!      `lto-cgraph.c':`input_cgraph'.
  
     * Summaries and optimization summaries used by IPA passes
!      (`.gnu.lto_.<xxx>', where `<xxx>' is one of `jmpfuncs',
!      `pureconst' or `reference')
  
       These sections are used by IPA passes that need to emit summary
!      information during LTO generation to be read and aggregated at
!      link time.  Each pass is responsible for implementing two pass
!      manager hooks: one for writing the summary and another for reading
!      it in.  The format of these sections is entirely up to each
!      individual pass.  The only requirement is that the writer and
!      reader hooks agree on the format.
  
  
  File: gccint.info,  Node: IPA,  Next: WHOPR,  Prev: LTO object file layout,  Up: LTO
--- 40294,40357 ----
       symbol table was used.
  
       The symbol table is emitted in
!      'lto-streamer-out.c':'produce_symtab'.
  
!    * Global declarations and types ('.gnu.lto_.decls')
  
       This section contains an intermediate language dump of all
       declarations and types required to represent the callgraph, static
       variables and top-level debug info.
  
       The contents of this section are emitted in
!      'lto-streamer-out.c':'produce_asm_for_decls'.  Types and symbols
       are emitted in a topological order that preserves the sharing of
       pointers when the file is read back in
!      ('lto.c':'read_cgraph_and_symbols').
  
!    * The callgraph ('.gnu.lto_.cgraph')
  
       This section contains the basic data structure used by the GCC
       inter-procedural optimization infrastructure.  This section stores
       an annotated multi-graph which represents the functions and call
!      sites as well as the variables, aliases and top-level 'asm'
       statements.
  
!      This section is emitted in 'lto-streamer-out.c':'output_cgraph' and
!      read in 'lto-cgraph.c':'input_cgraph'.
  
!    * IPA references ('.gnu.lto_.refs')
  
       This section contains references between function and static
!      variables.  It is emitted by 'lto-cgraph.c':'output_refs' and read
!      by 'lto-cgraph.c':'input_refs'.
  
!    * Function bodies ('.gnu.lto_.function_body.<name>')
  
       This section contains function bodies in the intermediate language
       representation.  Every function body is in a separate section to
       allow copying of the section independently to different object
       files or reading the function on demand.
  
!      Functions are emitted in 'lto-streamer-out.c':'output_function' and
!      read in 'lto-streamer-in.c':'input_function'.
  
!    * Static variable initializers ('.gnu.lto_.vars')
  
       This section contains all the symbols in the global variable pool.
!      It is emitted by 'lto-cgraph.c':'output_varpool' and read in
!      'lto-cgraph.c':'input_cgraph'.
  
     * Summaries and optimization summaries used by IPA passes
!      ('.gnu.lto_.<xxx>', where '<xxx>' is one of 'jmpfuncs', 'pureconst'
!      or 'reference')
  
       These sections are used by IPA passes that need to emit summary
!      information during LTO generation to be read and aggregated at link
!      time.  Each pass is responsible for implementing two pass manager
!      hooks: one for writing the summary and another for reading it in.
!      The format of these sections is entirely up to each individual
!      pass.  The only requirement is that the writer and reader hooks
!      agree on the format.
  
  
  File: gccint.info,  Node: IPA,  Next: WHOPR,  Prev: LTO object file layout,  Up: LTO
*************** optimization pass is split into several
*** 40807,40852 ****
  different times during WHOPR compilation:
  
     * LGEN time
!        1. _Generate summary_ (`generate_summary' in `struct
!           ipa_opt_pass_d').  This stage analyzes every function body
!           and variable initializer is examined and stores relevant
            information into a pass-specific data structure.
  
!        2. _Write summary_ (`write_summary' in `struct ipa_opt_pass_d').
            This stage writes all the pass-specific information generated
!           by `generate_summary'.  Summaries go into their own
!           `LTO_section_*' sections that have to be declared in
!           `lto-streamer.h':`enum lto_section_type'.  A new section is
!           created by calling `create_output_block' and data can be
!           written using the `lto_output_*' routines.
  
     * WPA time
!        1. _Read summary_ (`read_summary' in `struct ipa_opt_pass_d').
            This stage reads all the pass-specific information in exactly
!           the same order that it was written by `write_summary'.
  
!        2. _Execute_ (`execute' in `struct opt_pass').  This performs
            inter-procedural propagation.  This must be done without
            actual access to the individual function bodies or variable
!           initializers.  Typically, this results in a transitive
!           closure operation over the summary information of all the
!           nodes in the callgraph.
  
!        3. _Write optimization summary_ (`write_optimization_summary' in
!           `struct ipa_opt_pass_d').  This writes the result of the
            inter-procedural propagation into the object file.  This can
            use the same data structures and helper routines used in
!           `write_summary'.
  
     * LTRANS time
!        1. _Read optimization summary_ (`read_optimization_summary' in
!           `struct ipa_opt_pass_d').  The counterpart to
!           `write_optimization_summary'.  This reads the interprocedural
            optimization decisions in exactly the same format emitted by
!           `write_optimization_summary'.
  
!        2. _Transform_ (`function_transform' and `variable_transform' in
!           `struct ipa_opt_pass_d').  The actual function bodies and
            variable initializers are updated based on the information
            passed down from the _Execute_ stage.
  
--- 40370,40415 ----
  different times during WHOPR compilation:
  
     * LGEN time
!        1. _Generate summary_ ('generate_summary' in 'struct
!           ipa_opt_pass_d').  This stage analyzes every function body and
!           variable initializer is examined and stores relevant
            information into a pass-specific data structure.
  
!        2. _Write summary_ ('write_summary' in 'struct ipa_opt_pass_d').
            This stage writes all the pass-specific information generated
!           by 'generate_summary'.  Summaries go into their own
!           'LTO_section_*' sections that have to be declared in
!           'lto-streamer.h':'enum lto_section_type'.  A new section is
!           created by calling 'create_output_block' and data can be
!           written using the 'lto_output_*' routines.
  
     * WPA time
!        1. _Read summary_ ('read_summary' in 'struct ipa_opt_pass_d').
            This stage reads all the pass-specific information in exactly
!           the same order that it was written by 'write_summary'.
  
!        2. _Execute_ ('execute' in 'struct opt_pass').  This performs
            inter-procedural propagation.  This must be done without
            actual access to the individual function bodies or variable
!           initializers.  Typically, this results in a transitive closure
!           operation over the summary information of all the nodes in the
!           callgraph.
  
!        3. _Write optimization summary_ ('write_optimization_summary' in
!           'struct ipa_opt_pass_d').  This writes the result of the
            inter-procedural propagation into the object file.  This can
            use the same data structures and helper routines used in
!           'write_summary'.
  
     * LTRANS time
!        1. _Read optimization summary_ ('read_optimization_summary' in
!           'struct ipa_opt_pass_d').  The counterpart to
!           'write_optimization_summary'.  This reads the interprocedural
            optimization decisions in exactly the same format emitted by
!           'write_optimization_summary'.
  
!        2. _Transform_ ('function_transform' and 'variable_transform' in
!           'struct ipa_opt_pass_d').  The actual function bodies and
            variable initializers are updated based on the information
            passed down from the _Execute_ stage.
  
*************** LTO, WHOPR and classic non-LTO compilati
*** 40866,40872 ****
  
   To simplify development, the GCC pass manager differentiates between
  normal inter-procedural passes and small inter-procedural passes.  A
! _small inter-procedural pass_ (`SIMPLE_IPA_PASS') is a pass that does
  everything at once and thus it can not be executed during WPA in WHOPR
  mode.  It defines only the _Execute_ stage and during this stage it
  accesses and modifies the function bodies.  Such passes are useful for
--- 40429,40435 ----
  
   To simplify development, the GCC pass manager differentiates between
  normal inter-procedural passes and small inter-procedural passes.  A
! _small inter-procedural pass_ ('SIMPLE_IPA_PASS') is a pass that does
  everything at once and thus it can not be executed during WPA in WHOPR
  mode.  It defines only the _Execute_ stage and during this stage it
  accesses and modifies the function bodies.  Such passes are useful for
*************** development of a new inter-procedural pa
*** 40878,40890 ****
  24.3.1 Virtual clones
  ---------------------
  
! One of the main challenges of introducing the WHOPR compilation mode
! was addressing the interactions between optimization passes.  In LTO
  compilation mode, the passes are executed in a sequence, each of which
! consists of analysis (or _Generate summary_), propagation (or
! _Execute_) and _Transform_ stages.  Once the work of one pass is
! finished, the next pass sees the updated program representation and can
! execute.  This makes the individual passes dependent on each other.
  
   In WHOPR mode all passes first execute their _Generate summary_ stage.
  Then summary writing marks the end of the LGEN stage.  At WPA time, the
--- 40441,40453 ----
  24.3.1 Virtual clones
  ---------------------
  
! One of the main challenges of introducing the WHOPR compilation mode was
! addressing the interactions between optimization passes.  In LTO
  compilation mode, the passes are executed in a sequence, each of which
! consists of analysis (or _Generate summary_), propagation (or _Execute_)
! and _Transform_ stages.  Once the work of one pass is finished, the next
! pass sees the updated program representation and can execute.  This
! makes the individual passes dependent on each other.
  
   In WHOPR mode all passes first execute their _Generate summary_ stage.
  Then summary writing marks the end of the LGEN stage.  At WPA time, the
*************** summaries are read back into memory and
*** 40892,40929 ****
  stage.  Optimization summaries are streamed and sent to LTRANS, where
  all the passes execute the _Transform_ stage.
  
!  Most optimization passes split naturally into analysis, propagation
! and transformation stages.  But some do not.  The main problem arises
! when one pass performs changes and the following pass gets confused by
! seeing different callgraphs between the _Transform_ stage and the
! _Generate summary_ or _Execute_ stage.  This means that the passes are
! required to communicate their decisions with each other.
  
   To facilitate this communication, the GCC callgraph infrastructure
  implements _virtual clones_, a method of representing the changes
! performed by the optimization passes in the callgraph without needing
! to update function bodies.
  
!  A _virtual clone_ in the callgraph is a function that has no
! associated body, just a description of how to create its body based on
! a different function (which itself may be a virtual clone).
  
   The description of function modifications includes adjustments to the
  function's signature (which allows, for example, removing or adding
! function arguments), substitutions to perform on the function body,
! and, for inlined functions, a pointer to the function that it will be
! inlined into.
  
   It is also possible to redirect any edge of the callgraph from a
  function to its virtual clone.  This implies updating of the call site
  to adjust for the new function signature.
  
!  Most of the transformations performed by inter-procedural
! optimizations can be represented via virtual clones.  For instance, a
! constant propagation pass can produce a virtual clone of the function
! which replaces one of its arguments by a constant.  The inliner can
! represent its decisions by producing a clone of a function whose body
! will be later integrated into a given function.
  
   Using _virtual clones_, the program can be easily updated during the
  _Execute_ stage, solving most of pass interactions problems that would
--- 40455,40492 ----
  stage.  Optimization summaries are streamed and sent to LTRANS, where
  all the passes execute the _Transform_ stage.
  
!  Most optimization passes split naturally into analysis, propagation and
! transformation stages.  But some do not.  The main problem arises when
! one pass performs changes and the following pass gets confused by seeing
! different callgraphs between the _Transform_ stage and the _Generate
! summary_ or _Execute_ stage.  This means that the passes are required to
! communicate their decisions with each other.
  
   To facilitate this communication, the GCC callgraph infrastructure
  implements _virtual clones_, a method of representing the changes
! performed by the optimization passes in the callgraph without needing to
! update function bodies.
  
!  A _virtual clone_ in the callgraph is a function that has no associated
! body, just a description of how to create its body based on a different
! function (which itself may be a virtual clone).
  
   The description of function modifications includes adjustments to the
  function's signature (which allows, for example, removing or adding
! function arguments), substitutions to perform on the function body, and,
! for inlined functions, a pointer to the function that it will be inlined
! into.
  
   It is also possible to redirect any edge of the callgraph from a
  function to its virtual clone.  This implies updating of the call site
  to adjust for the new function signature.
  
!  Most of the transformations performed by inter-procedural optimizations
! can be represented via virtual clones.  For instance, a constant
! propagation pass can produce a virtual clone of the function which
! replaces one of its arguments by a constant.  The inliner can represent
! its decisions by producing a clone of a function whose body will be
! later integrated into a given function.
  
   Using _virtual clones_, the program can be easily updated during the
  _Execute_ stage, solving most of pass interactions problems that would
*************** otherwise occur during _Transform_.
*** 40931,40944 ****
  
   Virtual clones are later materialized in the LTRANS stage and turned
  into real functions.  Passes executed after the virtual clone were
! introduced also perform their _Transform_ stage on new functions, so
! for a pass there is no significant difference between operating on a
! real function or a virtual clone introduced before its _Execute_ stage.
  
!  Optimization passes then work on virtual clones introduced before
! their _Execute_ stage as if they were real functions.  The only
! difference is that clones are not visible during the _Generate Summary_
! stage.
  
   To keep function summaries updated, the callgraph interface allows an
  optimizer to register a callback that is called every time a new clone
--- 40494,40506 ----
  
   Virtual clones are later materialized in the LTRANS stage and turned
  into real functions.  Passes executed after the virtual clone were
! introduced also perform their _Transform_ stage on new functions, so for
! a pass there is no significant difference between operating on a real
! function or a virtual clone introduced before its _Execute_ stage.
  
!  Optimization passes then work on virtual clones introduced before their
! _Execute_ stage as if they were real functions.  The only difference is
! that clones are not visible during the _Generate Summary_ stage.
  
   To keep function summaries updated, the callgraph interface allows an
  optimizer to register a callback that is called every time a new clone
*************** summaries updated for the _Transform_ st
*** 40953,40971 ****
  ---------------------
  
  GCC represents IPA references in the callgraph.  For a function or
! variable `A', the _IPA reference_ is a list of all locations where the
! address of `A' is taken and, when `A' is a variable, a list of all
! direct stores and reads to/from `A'.  References represent an oriented
  multi-graph on the union of nodes of the callgraph and the varpool.  See
! `ipa-reference.c':`ipa_reference_write_optimization_summary' and
! `ipa-reference.c':`ipa_reference_read_optimization_summary' for details.
  
  24.3.3 Jump functions
  ---------------------
  
! Suppose that an optimization pass sees a function `A' and it knows the
  values of (some of) its arguments.  The _jump function_ describes the
! value of a parameter of a given function call in function `A' based on
  this knowledge.
  
   Jump functions are used by several optimizations, such as the
--- 40515,40533 ----
  ---------------------
  
  GCC represents IPA references in the callgraph.  For a function or
! variable 'A', the _IPA reference_ is a list of all locations where the
! address of 'A' is taken and, when 'A' is a variable, a list of all
! direct stores and reads to/from 'A'.  References represent an oriented
  multi-graph on the union of nodes of the callgraph and the varpool.  See
! 'ipa-reference.c':'ipa_reference_write_optimization_summary' and
! 'ipa-reference.c':'ipa_reference_read_optimization_summary' for details.
  
  24.3.3 Jump functions
  ---------------------
  
! Suppose that an optimization pass sees a function 'A' and it knows the
  values of (some of) its arguments.  The _jump function_ describes the
! value of a parameter of a given function call in function 'A' based on
  this knowledge.
  
   Jump functions are used by several optimizations, such as the
*************** File: gccint.info,  Node: WHOPR,  Next:
*** 40980,41037 ****
  =====================================================================
  
  Link-time optimization gives relatively minor benefits when used alone.
! The problem is that propagation of inter-procedural information does
! not work well across functions and variables that are called or
! referenced by other compilation units (such as from a dynamically
! linked library).  We say that such functions and variables are
! _externally visible_.
  
   To make the situation even more difficult, many applications organize
  themselves as a set of shared libraries, and the default ELF visibility
  rules allow one to overwrite any externally visible symbol with a
  different symbol at runtime.  This basically disables any optimizations
! across such functions and variables, because the compiler cannot be
! sure that the function body it is seeing is the same function body that
! will be used at runtime.  Any function or variable not declared
! `static' in the sources degrades the quality of inter-procedural
! optimization.
  
   To avoid this problem the compiler must assume that it sees the whole
! program when doing link-time optimization.  Strictly speaking, the
! whole program is rarely visible even at link-time.  Standard system
! libraries are usually linked dynamically or not provided with the
! link-time information.  In GCC, the whole program option
! (`-fwhole-program') asserts that every function and variable defined in
! the current compilation unit is static, except for function `main'
! (note: at link time, the current unit is the union of all objects
! compiled with LTO).  Since some functions and variables need to be
! referenced externally, for example by another DSO or from an assembler
! file, GCC also provides the function and variable attribute
! `externally_visible' which can be used to disable the effect of
! `-fwhole-program' on a specific symbol.
  
   The whole program mode assumptions are slightly more complex in C++,
  where inline functions in headers are put into _COMDAT_ sections.
  COMDAT function and variables can be defined by multiple object files
! and their bodies are unified at link-time and dynamic link-time.
! COMDAT functions are changed to local only when their address is not
! taken and thus un-sharing them with a library is not harmful.  COMDAT
! variables always remain externally visible, however for readonly
! variables it is assumed that their initializers cannot be overwritten
! by a different value.
  
!  GCC provides the function and variable attribute `visibility' that can
  be used to specify the visibility of externally visible symbols (or
! alternatively an `-fdefault-visibility' command line option).  ELF
! defines the `default', `protected', `hidden' and `internal'
  visibilities.
  
!  The most commonly used is visibility is `hidden'.  It specifies that
  the symbol cannot be referenced from outside of the current shared
! library.  Unfortunately, this information cannot be used directly by
! the link-time optimization in the compiler since the whole shared
! library also might contain non-LTO objects and those are not visible to
! the compiler.
  
   GCC solves this problem using linker plugins.  A _linker plugin_ is an
  interface to the linker that allows an external program to claim the
--- 40542,40596 ----
  =====================================================================
  
  Link-time optimization gives relatively minor benefits when used alone.
! The problem is that propagation of inter-procedural information does not
! work well across functions and variables that are called or referenced
! by other compilation units (such as from a dynamically linked library).
! We say that such functions and variables are _externally visible_.
  
   To make the situation even more difficult, many applications organize
  themselves as a set of shared libraries, and the default ELF visibility
  rules allow one to overwrite any externally visible symbol with a
  different symbol at runtime.  This basically disables any optimizations
! across such functions and variables, because the compiler cannot be sure
! that the function body it is seeing is the same function body that will
! be used at runtime.  Any function or variable not declared 'static' in
! the sources degrades the quality of inter-procedural optimization.
  
   To avoid this problem the compiler must assume that it sees the whole
! program when doing link-time optimization.  Strictly speaking, the whole
! program is rarely visible even at link-time.  Standard system libraries
! are usually linked dynamically or not provided with the link-time
! information.  In GCC, the whole program option ('-fwhole-program')
! asserts that every function and variable defined in the current
! compilation unit is static, except for function 'main' (note: at link
! time, the current unit is the union of all objects compiled with LTO).
! Since some functions and variables need to be referenced externally, for
! example by another DSO or from an assembler file, GCC also provides the
! function and variable attribute 'externally_visible' which can be used
! to disable the effect of '-fwhole-program' on a specific symbol.
  
   The whole program mode assumptions are slightly more complex in C++,
  where inline functions in headers are put into _COMDAT_ sections.
  COMDAT function and variables can be defined by multiple object files
! and their bodies are unified at link-time and dynamic link-time.  COMDAT
! functions are changed to local only when their address is not taken and
! thus un-sharing them with a library is not harmful.  COMDAT variables
! always remain externally visible, however for readonly variables it is
! assumed that their initializers cannot be overwritten by a different
! value.
  
!  GCC provides the function and variable attribute 'visibility' that can
  be used to specify the visibility of externally visible symbols (or
! alternatively an '-fdefault-visibility' command line option).  ELF
! defines the 'default', 'protected', 'hidden' and 'internal'
  visibilities.
  
!  The most commonly used is visibility is 'hidden'.  It specifies that
  the symbol cannot be referenced from outside of the current shared
! library.  Unfortunately, this information cannot be used directly by the
! link-time optimization in the compiler since the whole shared library
! also might contain non-LTO objects and those are not visible to the
! compiler.
  
   GCC solves this problem using linker plugins.  A _linker plugin_ is an
  interface to the linker that allows an external program to claim the
*************** ownership of a given object file.  The l
*** 41039,41078 ****
  procedure by querying the plugin about the symbol table of the claimed
  objects and once the linking decisions are complete, the plugin is
  allowed to provide the final object file before the actual linking is
! made.  The linker plugin obtains the symbol resolution information
! which specifies which symbols provided by the claimed objects are bound
! from the rest of a binary being linked.
  
!  Currently, the linker plugin  works only in combination with the Gold
  linker, but a GNU ld implementation is under development.
  
!  GCC is designed to be independent of the rest of the toolchain and
! aims to support linkers without plugin support.  For this reason it
! does not use the linker plugin by default.  Instead, the object files
! are examined by `collect2' before being passed to the linker and
! objects found to have LTO sections are passed to `lto1' first.  This
! mode does not work for library archives.  The decision on what object
! files from the archive are needed depends on the actual linking and
! thus GCC would have to implement the linker itself.  The resolution
! information is missing too and thus GCC needs to make an educated guess
! based on `-fwhole-program'.  Without the linker plugin GCC also assumes
! that symbols are declared `hidden' and not referred by non-LTO code by
  default.
  
  
  File: gccint.info,  Node: Internal flags,  Prev: WHOPR,  Up: LTO
  
! 24.5 Internal flags controlling `lto1'
  ======================================
  
! The following flags are passed into `lto1' and are not meant to be used
  directly from the command line.
  
     * -fwpa This option runs the serial part of the link-time optimizer
       performing the inter-procedural propagation (WPA mode).  The
       compiler reads in summary information from all inputs and performs
!      an analysis based on summary information only.  It generates
!      object files for subsequent runs of the link-time optimizer where
       individual object files are optimized using both summary
       information from the WPA mode and the actual function bodies.  It
       then drives the LTRANS phase.
--- 40598,40637 ----
  procedure by querying the plugin about the symbol table of the claimed
  objects and once the linking decisions are complete, the plugin is
  allowed to provide the final object file before the actual linking is
! made.  The linker plugin obtains the symbol resolution information which
! specifies which symbols provided by the claimed objects are bound from
! the rest of a binary being linked.
  
!  Currently, the linker plugin works only in combination with the Gold
  linker, but a GNU ld implementation is under development.
  
!  GCC is designed to be independent of the rest of the toolchain and aims
! to support linkers without plugin support.  For this reason it does not
! use the linker plugin by default.  Instead, the object files are
! examined by 'collect2' before being passed to the linker and objects
! found to have LTO sections are passed to 'lto1' first.  This mode does
! not work for library archives.  The decision on what object files from
! the archive are needed depends on the actual linking and thus GCC would
! have to implement the linker itself.  The resolution information is
! missing too and thus GCC needs to make an educated guess based on
! '-fwhole-program'.  Without the linker plugin GCC also assumes that
! symbols are declared 'hidden' and not referred by non-LTO code by
  default.
  
  
  File: gccint.info,  Node: Internal flags,  Prev: WHOPR,  Up: LTO
  
! 24.5 Internal flags controlling 'lto1'
  ======================================
  
! The following flags are passed into 'lto1' and are not meant to be used
  directly from the command line.
  
     * -fwpa This option runs the serial part of the link-time optimizer
       performing the inter-procedural propagation (WPA mode).  The
       compiler reads in summary information from all inputs and performs
!      an analysis based on summary information only.  It generates object
!      files for subsequent runs of the link-time optimizer where
       individual object files are optimized using both summary
       information from the WPA mode and the actual function bodies.  It
       then drives the LTRANS phase.
*************** directly from the command line.
*** 41082,41094 ****
       previous run of the LTO in WPA mode.  In the LTRANS mode, LTO
       optimizes an object and produces the final assembly.
  
!    * -fltrans-output-list=FILE This option specifies a file to which
!      the names of LTRANS output files are written.  This option is only
!      meaningful in conjunction with `-fwpa'.
  
!    * -fresolution=FILE This option specifies the linker resolution
!      file.  This option is only meaningful in conjunction with `-fwpa'
!      and as option to pass through to the LTO linker plugin.
  
  
  File: gccint.info,  Node: Match and Simplify,  Next: Funding,  Prev: LTO,  Up: Top
--- 40641,40653 ----
       previous run of the LTO in WPA mode.  In the LTRANS mode, LTO
       optimizes an object and produces the final assembly.
  
!    * -fltrans-output-list=FILE This option specifies a file to which the
!      names of LTRANS output files are written.  This option is only
!      meaningful in conjunction with '-fwpa'.
  
!    * -fresolution=FILE This option specifies the linker resolution file.
!      This option is only meaningful in conjunction with '-fwpa' and as
!      option to pass through to the LTO linker plugin.
  
  
  File: gccint.info,  Node: Match and Simplify,  Next: Funding,  Prev: LTO,  Up: Top
*************** File: gccint.info,  Node: Match and Simp
*** 41096,41108 ****
  25 Match and Simplify
  *********************
  
! The GIMPLE and GENERIC pattern matching project match-and-simplify
! tries to address several issues.
  
    1. unify expression simplifications currently spread and duplicated
!       over separate files like fold-const.c, gimple-fold.c and
!      builtins.c
! 
    2. allow for a cheap way to implement building and simplifying
       non-trivial GIMPLE expressions, avoiding the need to go through
       building and simplifying GENERIC via fold_buildN and then
--- 40655,40665 ----
  25 Match and Simplify
  *********************
  
! The GIMPLE and GENERIC pattern matching project match-and-simplify tries
! to address several issues.
  
    1. unify expression simplifications currently spread and duplicated
!      over separate files like fold-const.c, gimple-fold.c and builtins.c
    2. allow for a cheap way to implement building and simplifying
       non-trivial GIMPLE expressions, avoiding the need to go through
       building and simplifying GENERIC via fold_buildN and then
*************** File: gccint.info,  Node: GIMPLE API,  N
*** 41131,41157 ****
            tree, gimple_seq *, tree (*)(tree))
   -- GIMPLE function: tree gimple_simplify (enum tree_code, tree, tree,
            tree, tree, gimple_seq *, tree (*)(tree))
!  -- GIMPLE function: tree gimple_simplify (enum built_in_function,
            tree, tree, gimple_seq *, tree (*)(tree))
-  -- GIMPLE function: tree gimple_simplify (enum built_in_function,
-           tree, tree, tree, gimple_seq *, tree (*)(tree))
-  -- GIMPLE function: tree gimple_simplify (enum built_in_function,
-           tree, tree, tree, gimple_seq *, tree (*)(tree))
       The main GIMPLE API entry to the expression simplifications
       mimicing that of the GENERIC fold_{unary,binary,ternary} functions.
  
   thus providing n-ary overloads for operation or function.  The
  additional arguments are a gimple_seq where built statements are
! inserted on (if `NULL' then simplifications requiring new statements
! are not performed) and a valueization hook that can be used to tie
  simplifications to a SSA lattice.
  
!  In addition to those APIs `fold_stmt' is overloaded with a
! valueization hook:
  
   -- bool: fold_stmt (gimple_stmt_iterator *, tree (*)(tree));
  
!  Ontop of these a `fold_buildN'-like API for GIMPLE is introduced:
  
   -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
            tree_code, tree, tree, tree (*valueize) (tree) = NULL);
--- 40688,40714 ----
            tree, gimple_seq *, tree (*)(tree))
   -- GIMPLE function: tree gimple_simplify (enum tree_code, tree, tree,
            tree, tree, gimple_seq *, tree (*)(tree))
!  -- GIMPLE function: tree gimple_simplify (enum built_in_function, tree,
!           tree, gimple_seq *, tree (*)(tree))
!  -- GIMPLE function: tree gimple_simplify (enum built_in_function, tree,
!           tree, tree, gimple_seq *, tree (*)(tree))
!  -- GIMPLE function: tree gimple_simplify (enum built_in_function, tree,
            tree, tree, gimple_seq *, tree (*)(tree))
       The main GIMPLE API entry to the expression simplifications
       mimicing that of the GENERIC fold_{unary,binary,ternary} functions.
  
   thus providing n-ary overloads for operation or function.  The
  additional arguments are a gimple_seq where built statements are
! inserted on (if 'NULL' then simplifications requiring new statements are
! not performed) and a valueization hook that can be used to tie
  simplifications to a SSA lattice.
  
!  In addition to those APIs 'fold_stmt' is overloaded with a valueization
! hook:
  
   -- bool: fold_stmt (gimple_stmt_iterator *, tree (*)(tree));
  
!  Ontop of these a 'fold_buildN'-like API for GIMPLE is introduced:
  
   -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
            tree_code, tree, tree, tree (*valueize) (tree) = NULL);
*************** valueization hook:
*** 41164,41176 ****
            built_in_function, tree, tree, tree (*valueize) (tree) =
            NULL);
   -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
!           built_in_function, tree, tree, tree, tree (*valueize) (tree)
!           = NULL);
   -- GIMPLE function: tree gimple_convert (gimple_seq *, location_t,
            tree, tree);
  
!  which is supposed to replace `force_gimple_operand (fold_buildN (...),
! ...)' and calls to `fold_convert'.  Overloads without the `location_t'
  argument exist.  Built statements are inserted on the provided sequence
  and simplification is performed using the optional valueization hook.
  
--- 40721,40733 ----
            built_in_function, tree, tree, tree (*valueize) (tree) =
            NULL);
   -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
!           built_in_function, tree, tree, tree, tree (*valueize) (tree) =
!           NULL);
   -- GIMPLE function: tree gimple_convert (gimple_seq *, location_t,
            tree, tree);
  
!  which is supposed to replace 'force_gimple_operand (fold_buildN (...),
! ...)' and calls to 'fold_convert'.  Overloads without the 'location_t'
  argument exist.  Built statements are inserted on the provided sequence
  and simplification is performed using the optional valueization hook.
  
*************** an example from the match.pd file:
*** 41189,41236 ****
         @0)
  
   This example contains all required parts of an expression
! simplification.  A simplification is wrapped inside a `(simplify ...)'
! expression.  That contains at least two operands - an expression that
! is matched with the GIMPLE or GENERIC IL and a replacement expression
! that is returned if the match was successful.
  
!  Expressions have an operator ID, `bit_and' in this case.  Expressions
! can be lower-case tree codes with `_expr' stripped off or builtin
! function code names in all-caps, like `BUILT_IN_SQRT'.
  
!  `@n' denotes a so-called capture.  It captures the operand and lets
! you refer to it in other places of the match-and-simplify.  In the
! above example it is refered to in the replacement expression.  Captures
! are `@' followed by a number or an identifier.
  
       (simplify
         (bit_xor @0 @0)
         { build_zero_cst (type); })
  
!  In this example `@0' is mentioned twice which constrains the matched
  expression to have two equal operands.  This example also introduces
  operands written in C code.  These can be used in the expression
! replacements and are supposed to evaluate to a tree node which has to
! be a valid GIMPLE operand (so you cannot generate expressions in C
! code).
  
       (simplify
         (trunc_mod integer_zerop@0 @1)
         (if (!integer_zerop (@1)))
         @0)
  
!  Here `@0' captures the first operand of the trunc_mod expression which
! is also predicated with `integer_zerop'.  Expression operands may be
  either expressions, predicates or captures.  Captures can be
  unconstrained or capture expresions or predicates.
  
   This example introduces an optional operand of simplify, the
! if-expression.  This condition is evaluated after the expression
! matched in the IL and is required to evaluate to true to enable the
! replacement expression.  The expression operand of the `if' is a
! standard C expression which may contain references to captures.
  
!  A `if' expression can be used to specify a common condition for
  multiple simplify patterns, avoiding the need to repeat that multiple
  times:
  
--- 40746,40792 ----
         @0)
  
   This example contains all required parts of an expression
! simplification.  A simplification is wrapped inside a '(simplify ...)'
! expression.  That contains at least two operands - an expression that is
! matched with the GIMPLE or GENERIC IL and a replacement expression that
! is returned if the match was successful.
  
!  Expressions have an operator ID, 'bit_and' in this case.  Expressions
! can be lower-case tree codes with '_expr' stripped off or builtin
! function code names in all-caps, like 'BUILT_IN_SQRT'.
  
!  '@n' denotes a so-called capture.  It captures the operand and lets you
! refer to it in other places of the match-and-simplify.  In the above
! example it is refered to in the replacement expression.  Captures are
! '@' followed by a number or an identifier.
  
       (simplify
         (bit_xor @0 @0)
         { build_zero_cst (type); })
  
!  In this example '@0' is mentioned twice which constrains the matched
  expression to have two equal operands.  This example also introduces
  operands written in C code.  These can be used in the expression
! replacements and are supposed to evaluate to a tree node which has to be
! a valid GIMPLE operand (so you cannot generate expressions in C code).
  
       (simplify
         (trunc_mod integer_zerop@0 @1)
         (if (!integer_zerop (@1)))
         @0)
  
!  Here '@0' captures the first operand of the trunc_mod expression which
! is also predicated with 'integer_zerop'.  Expression operands may be
  either expressions, predicates or captures.  Captures can be
  unconstrained or capture expresions or predicates.
  
   This example introduces an optional operand of simplify, the
! if-expression.  This condition is evaluated after the expression matched
! in the IL and is required to evaluate to true to enable the replacement
! expression.  The expression operand of the 'if' is a standard C
! expression which may contain references to captures.
  
!  A 'if' expression can be used to specify a common condition for
  multiple simplify patterns, avoiding the need to repeat that multiple
  times:
  
*************** times:
*** 41264,41289 ****
         })
       #endif
  
!  In the above example, `@2' captures the result of the expression
! `(addr @0)'.  For outermost expression only its type can be captured,
! and the keyword `type' is reserved for this purpose.  The above example
! also gives a way to conditionalize patterns to only apply to `GIMPLE'
! or `GENERIC' by means of using the pre-defined preprocessor macros
! `GIMPLE' and `GENERIC' and using preprocessor directives.
  
       (simplify
         (bit_and:c integral_op_p@0 (bit_ior:c (bit_not @0) @1))
         (bit_and @1 @0))
  
   Here we introduce flags on match expressions.  There is currently a
! single flag, `c', which denotes that the expression should be also
  matched commutated.  Thus the above match expression is really the
  following four match expressions:
  
!  (bit_and integral_op_p@0 (bit_ior (bit_not @0) @1))   (bit_and
! (bit_ior (bit_not @0) @1) integral_op_p@0)   (bit_and integral_op_p@0
! (bit_ior @1 (bit_not @0)))   (bit_and (bit_ior @1 (bit_not @0))
! integral_op_p@0)
  
   Usual canonicalizations you know from GENERIC expressions are applied
  before matching, so for example constant operands always come second in
--- 40820,40844 ----
         })
       #endif
  
!  In the above example, '@2' captures the result of the expression '(addr
! @0)'.  For outermost expression only its type can be captured, and the
! keyword 'type' is reserved for this purpose.  The above example also
! gives a way to conditionalize patterns to only apply to 'GIMPLE' or
! 'GENERIC' by means of using the pre-defined preprocessor macros 'GIMPLE'
! and 'GENERIC' and using preprocessor directives.
  
       (simplify
         (bit_and:c integral_op_p@0 (bit_ior:c (bit_not @0) @1))
         (bit_and @1 @0))
  
   Here we introduce flags on match expressions.  There is currently a
! single flag, 'c', which denotes that the expression should be also
  matched commutated.  Thus the above match expression is really the
  following four match expressions:
  
!  (bit_and integral_op_p@0 (bit_ior (bit_not @0) @1)) (bit_and (bit_ior
! (bit_not @0) @1) integral_op_p@0) (bit_and integral_op_p@0 (bit_ior @1
! (bit_not @0))) (bit_and (bit_ior @1 (bit_not @0)) integral_op_p@0)
  
   Usual canonicalizations you know from GENERIC expressions are applied
  before matching, so for example constant operands always come second in
*************** commutative expressions.
*** 41296,41303 ****
           (op @0 integer_zerop)
           @0))
  
!  A `for' expression can be used to repeat a pattern for each operator
! specified, substituting `op'.  `for' can be nested and a `for' can have
  multiple operators to iterate.
  
       (for opa (plus minus)
--- 40851,40858 ----
           (op @0 integer_zerop)
           @0))
  
!  A 'for' expression can be used to repeat a pattern for each operator
! specified, substituting 'op'.  'for' can be nested and a 'for' can have
  multiple operators to iterate.
  
       (for opa (plus minus)
*************** multiple operators to iterate.
*** 41305,41328 ****
         (for opc (plus minus)
           (simplify...
  
!  In this example the pattern will be repeated four times with `opa,
! opb, opc' being `plus, minus, plus', `plus, minus, minus', `minus,
! plus, plus', `minus, plus, minus'.
  
!  To avoid repeating operator lists in `for' you can name them via
  
       (define_operator_list pmm plus minus mult)
  
!  and use them in `for' operator lists where they get expanded.
  
       (for opa (pmm trunc_div)
        (simplify...
  
!  So this example iterates over `plus', `minus', `mult' and `trunc_div'.
  
   Using operator lists can also remove the need to explicitely write a
! `for'.  All operator list uses that appear in a `simplify' or `match'
! pattern in operator positions will implicitely be added to a new `for'.
  For example
  
       (define_operator_list SQRT BUILT_IN_SQRTF BUILT_IN_SQRT BUILT_IN_SQRTL)
--- 40860,40883 ----
         (for opc (plus minus)
           (simplify...
  
!  In this example the pattern will be repeated four times with 'opa, opb,
! opc' being 'plus, minus, plus', 'plus, minus, minus', 'minus, plus,
! plus', 'minus, plus, minus'.
  
!  To avoid repeating operator lists in 'for' you can name them via
  
       (define_operator_list pmm plus minus mult)
  
!  and use them in 'for' operator lists where they get expanded.
  
       (for opa (pmm trunc_div)
        (simplify...
  
!  So this example iterates over 'plus', 'minus', 'mult' and 'trunc_div'.
  
   Using operator lists can also remove the need to explicitely write a
! 'for'.  All operator list uses that appear in a 'simplify' or 'match'
! pattern in operator positions will implicitely be added to a new 'for'.
  For example
  
       (define_operator_list SQRT BUILT_IN_SQRTF BUILT_IN_SQRT BUILT_IN_SQRTL)
*************** For example
*** 41339,41345 ****
         (SQRT (POW @0 @1))
         (POW (abs @0) (mult @1 { built_real (TREE_TYPE (@1), dconsthalf); }))))
  
!  Another building block are `with' expressions in the result expression
  which nest the generated code in a new C block followed by its argument:
  
       (simplify
--- 40894,40900 ----
         (SQRT (POW @0 @1))
         (POW (abs @0) (mult @1 { built_real (TREE_TYPE (@1), dconsthalf); }))))
  
!  Another building block are 'with' expressions in the result expression
  which nest the generated code in a new C block followed by its argument:
  
       (simplify
*************** which nest the generated code in a new C
*** 41347,41383 ****
        (with { tree utype = unsigned_type_for (type); }
         (convert (mult (convert:utype @0) (convert:utype @1)))))
  
!  This allows code nested in the `with' to refer to the declared
  variables.  In the above case we use the feature to specify the type of
! a generated expression with the `:type' syntax where `type' needs to be
! an identifier that refers to the desired type.  Usually the types of
! the generated result expressions are determined from the context, but
  sometimes like in the above case it is required that you specify them
  explicitely.
  
   As intermediate conversions are often optional there is a way to avoid
  the need to repeat patterns both with and without such conversions.
! Namely you can mark a conversion as being optional with a `?':
  
       (simplify
        (eq (convert@0 @1) (convert? @2))
        (eq @1 (convert @2)))
  
!  which will match both `(eq (convert @1) (convert @2))' and `(eq
  (convert @1) @2)'.  The optional converts are supposed to be all either
! present or not, thus `(eq (convert? @1) (convert? @2))' will result in
  two patterns only.  If you want to match all four combinations you have
! access to two additional conditional converts as in `(eq (convert1? @1)
  (convert2? @2))'.
  
   Predicates available from the GCC middle-end need to be made available
! explicitely via `define_predicates':
  
       (define_predicates
        integer_onep integer_zerop integer_all_onesp)
  
   You can also define predicates using the pattern matching language and
! the `match' form:
  
       (match negate_expr_p
        INTEGER_CST
--- 40902,40938 ----
        (with { tree utype = unsigned_type_for (type); }
         (convert (mult (convert:utype @0) (convert:utype @1)))))
  
!  This allows code nested in the 'with' to refer to the declared
  variables.  In the above case we use the feature to specify the type of
! a generated expression with the ':type' syntax where 'type' needs to be
! an identifier that refers to the desired type.  Usually the types of the
! generated result expressions are determined from the context, but
  sometimes like in the above case it is required that you specify them
  explicitely.
  
   As intermediate conversions are often optional there is a way to avoid
  the need to repeat patterns both with and without such conversions.
! Namely you can mark a conversion as being optional with a '?':
  
       (simplify
        (eq (convert@0 @1) (convert? @2))
        (eq @1 (convert @2)))
  
!  which will match both '(eq (convert @1) (convert @2))' and '(eq
  (convert @1) @2)'.  The optional converts are supposed to be all either
! present or not, thus '(eq (convert? @1) (convert? @2))' will result in
  two patterns only.  If you want to match all four combinations you have
! access to two additional conditional converts as in '(eq (convert1? @1)
  (convert2? @2))'.
  
   Predicates available from the GCC middle-end need to be made available
! explicitely via 'define_predicates':
  
       (define_predicates
        integer_onep integer_zerop integer_all_onesp)
  
   You can also define predicates using the pattern matching language and
! the 'match' form:
  
       (match negate_expr_p
        INTEGER_CST
*************** the `match' form:
*** 41386,41396 ****
       (match negate_expr_p
        (negate @0))
  
!  This shows that for `match' expressions there is `t' available which
  captures the outermost expression (something not possible in the
! `simplify' context).  As you can see `match' has an identifier as first
  operand which is how you refer to the predicate in patterns.  Multiple
! `match' for the same identifier add additional cases where the predicate
  matches.
  
   Predicates can also match an expression in which case you need to
--- 40941,40951 ----
       (match negate_expr_p
        (negate @0))
  
!  This shows that for 'match' expressions there is 't' available which
  captures the outermost expression (something not possible in the
! 'simplify' context).  As you can see 'match' has an identifier as first
  operand which is how you refer to the predicate in patterns.  Multiple
! 'match' for the same identifier add additional cases where the predicate
  matches.
  
   Predicates can also match an expression in which case you need to
*************** to free software developers--the Free So
*** 41428,41435 ****
  
   The way to convince distributors to do this is to demand it and expect
  it from them.  So when you compare distributors, judge them partly by
! how much they give to free software development.  Show distributors
! they must compete to be the one who gives the most.
  
   To make this approach work, you must insist on numbers that you can
  compare, such as, "We will donate ten dollars to the Frobnitz project
--- 40983,40990 ----
  
   The way to convince distributors to do this is to demand it and expect
  it from them.  So when you compare distributors, judge them partly by
! how much they give to free software development.  Show distributors they
! must compete to be the one who gives the most.
  
   To make this approach work, you must insist on numbers that you can
  compare, such as, "We will donate ten dollars to the Frobnitz project
*************** for comparison.
*** 41439,41446 ****
  
   Even a precise fraction "of the profits from this disk" is not very
  meaningful, since creative accounting and unrelated business decisions
! can greatly alter what fraction of the sales price counts as profit.
! If the price you pay is $50, ten percent of the profit is probably less
  than a dollar; it might be a few cents, or nothing at all.
  
   Some redistributors do development work themselves.  This is useful
--- 40994,41001 ----
  
   Even a precise fraction "of the profits from this disk" is not very
  meaningful, since creative accounting and unrelated business decisions
! can greatly alter what fraction of the sales price counts as profit.  If
! the price you pay is $50, ten percent of the profit is probably less
  than a dollar; it might be a few cents, or nothing at all.
  
   Some redistributors do development work themselves.  This is useful
*************** difference than others.  For example, ma
*** 41450,41457 ****
  a program contributes very little; maintaining the standard version of a
  program for the whole community contributes much.  Easy new ports
  contribute little, since someone else would surely do them; difficult
! ports such as adding a new CPU to the GNU Compiler Collection
! contribute more; major new features or packages contribute the most.
  
   By establishing the idea that supporting further development is "the
  proper thing to do" when distributing free software for a fee, we can
--- 41005,41012 ----
  a program contributes very little; maintaining the standard version of a
  program for the whole community contributes much.  Easy new ports
  contribute little, since someone else would surely do them; difficult
! ports such as adding a new CPU to the GNU Compiler Collection contribute
! more; major new features or packages contribute the most.
  
   By establishing the idea that supporting further development is "the
  proper thing to do" when distributing free software for a fee, we can
*************** now widely used; though these systems ar
*** 41475,41482 ****
  they are more accurately called GNU/Linux systems.
  
   For more information, see:
!      `http://www.gnu.org/'
!      `http://www.gnu.org/gnu/linux-and-gnu.html'
  
  
  File: gccint.info,  Node: Copying,  Next: GNU Free Documentation License,  Prev: GNU Project,  Up: Top
--- 41030,41037 ----
  they are more accurately called GNU/Linux systems.
  
   For more information, see:
!      <http://www.gnu.org/>
!      <http://www.gnu.org/gnu/linux-and-gnu.html>
  
  
  File: gccint.info,  Node: Copying,  Next: GNU Free Documentation License,  Prev: GNU Project,  Up: Top
*************** GNU General Public License
*** 41486,41492 ****
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
--- 41041,41047 ----
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
*************** GNU General Public License for most of o
*** 41506,41532 ****
  any other work released this way by its authors.  You can apply it to
  your programs, too.
  
!  When we speak of free software, we are referring to freedom, not
! price.  Our General Public Licenses are designed to make sure that you
! have the freedom to distribute copies of free software (and charge for
! them if you wish), that you receive source code or can get it if you
! want it, that you can change the software or use pieces of it in new
! free programs, and that you know you can do these things.
  
   To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you
! have certain responsibilities if you distribute copies of the software,
! or if you modify it: responsibilities to respect the freedom of others.
  
!  For example, if you distribute copies of such a program, whether
! gratis or for a fee, you must pass on to the recipients the same
! freedoms that you received.  You must make sure that they, too, receive
! or can get the source code.  And you must show them these terms so they
! know their rights.
  
!  Developers that use the GNU GPL protect your rights with two steps:
! (1) assert copyright on the software, and (2) offer you this License
! giving you legal permission to copy, distribute and/or modify it.
  
   For the developers' and authors' protection, the GPL clearly explains
  that there is no warranty for this free software.  For both users' and
--- 41061,41087 ----
  any other work released this way by its authors.  You can apply it to
  your programs, too.
  
!  When we speak of free software, we are referring to freedom, not price.
! Our General Public Licenses are designed to make sure that you have the
! freedom to distribute copies of free software (and charge for them if
! you wish), that you receive source code or can get it if you want it,
! that you can change the software or use pieces of it in new free
! programs, and that you know you can do these things.
  
   To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you have
! certain responsibilities if you distribute copies of the software, or if
! you modify it: responsibilities to respect the freedom of others.
  
!  For example, if you distribute copies of such a program, whether gratis
! or for a fee, you must pass on to the recipients the same freedoms that
! you received.  You must make sure that they, too, receive or can get the
! source code.  And you must show them these terms so they know their
! rights.
  
!  Developers that use the GNU GPL protect your rights with two steps: (1)
! assert copyright on the software, and (2) offer you this License giving
! you legal permission to copy, distribute and/or modify it.
  
   For the developers' and authors' protection, the GPL clearly explains
  that there is no warranty for this free software.  For both users' and
*************** changed, so that their problems will not
*** 41535,41550 ****
  authors of previous versions.
  
   Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the
! manufacturer can do so.  This is fundamentally incompatible with the
! aim of protecting users' freedom to change the software.  The
! systematic pattern of such abuse occurs in the area of products for
! individuals to use, which is precisely where it is most unacceptable.
! Therefore, we have designed this version of the GPL to prohibit the
! practice for those products.  If such problems arise substantially in
! other domains, we stand ready to extend this provision to those domains
! in future versions of the GPL, as needed to protect the freedom of
! users.
  
   Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
--- 41090,41104 ----
  authors of previous versions.
  
   Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the manufacturer
! can do so.  This is fundamentally incompatible with the aim of
! protecting users' freedom to change the software.  The systematic
! pattern of such abuse occurs in the area of products for individuals to
! use, which is precisely where it is most unacceptable.  Therefore, we
! have designed this version of the GPL to prohibit the practice for those
! products.  If such problems arise substantially in other domains, we
! stand ready to extend this provision to those domains in future versions
! of the GPL, as needed to protect the freedom of users.
  
   Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
*************** TERMS AND CONDITIONS
*** 41581,41588 ****
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it
!      on a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
--- 41135,41142 ----
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it on
!      a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
*************** TERMS AND CONDITIONS
*** 41596,41603 ****
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may
!      convey the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
--- 41150,41157 ----
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may convey
!      the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
*************** TERMS AND CONDITIONS
*** 41605,41612 ****
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any
!      non-source form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
--- 41159,41166 ----
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any non-source
!      form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
*************** TERMS AND CONDITIONS
*** 41617,41626 ****
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work
!      with that Major Component, or to implement a Standard Interface
!      for which an implementation is available to the public in source
!      code form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
--- 41171,41180 ----
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work with
!      that Major Component, or to implement a Standard Interface for
!      which an implementation is available to the public in source code
!      form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
*************** TERMS AND CONDITIONS
*** 41628,41642 ****
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including
!      scripts to control those activities.  However, it does not include
!      the work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files
!      associated with source files for the work, and the source code for
!      shared libraries and dynamically linked subprograms that the work
!      is specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
--- 41182,41196 ----
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including scripts
!      to control those activities.  However, it does not include the
!      work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files associated
!      with source files for the work, and the source code for shared
!      libraries and dynamically linked subprograms that the work is
!      specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
*************** TERMS AND CONDITIONS
*** 41653,41674 ****
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output,
!      given its content, constitutes a covered work.  This License
!      acknowledges your rights of fair use or other equivalent, as
!      provided by copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for
!      you, or provide you with facilities for running those works,
!      provided that you comply with the terms of this License in
!      conveying all material for which you do not control copyright.
!      Those thus making or running the covered works for you must do so
!      exclusively on your behalf, under your direction and control, on
!      terms that prohibit them from making any copies of your
!      copyrighted material outside their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
--- 41207,41228 ----
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output, given
!      its content, constitutes a covered work.  This License acknowledges
!      your rights of fair use or other equivalent, as provided by
!      copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for you,
!      or provide you with facilities for running those works, provided
!      that you comply with the terms of this License in conveying all
!      material for which you do not control copyright.  Those thus making
!      or running the covered works for you must do so exclusively on your
!      behalf, under your direction and control, on terms that prohibit
!      them from making any copies of your copyrighted material outside
!      their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
*************** TERMS AND CONDITIONS
*** 41685,41692 ****
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention
!      to limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
--- 41239,41246 ----
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention to
!      limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
*************** TERMS AND CONDITIONS
*** 41756,41763 ****
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for
!           as long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
--- 41310,41317 ----
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for as
!           long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
*************** TERMS AND CONDITIONS
*** 41767,41798 ****
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of
!           the written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access
!           to the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated
!           by you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to
!           the object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long
!           as needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
- 
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
--- 41321,41351 ----
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of the
!           written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access to
!           the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated by
!           you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to the
!           object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long as
!           needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
*************** TERMS AND CONDITIONS
*** 41800,41807 ****
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product
!      is a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
--- 41353,41360 ----
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product is
!      a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
*************** TERMS AND CONDITIONS
*** 41832,41842 ****
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or
!      installed by the recipient, or for the User Product in which it
!      has been modified or installed.  Access to a network may be denied
!      when the modification itself materially and adversely affects the
!      operation of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
--- 41385,41395 ----
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or installed
!      by the recipient, or for the User Product in which it has been
!      modified or installed.  Access to a network may be denied when the
!      modification itself materially and adversely affects the operation
!      of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
*************** TERMS AND CONDITIONS
*** 41866,41873 ****
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License
!      with terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
--- 41419,41426 ----
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License with
!      terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
*************** TERMS AND CONDITIONS
*** 41877,41885 ****
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be
!           marked in reasonable ways as different from the original
!           version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
--- 41430,41437 ----
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be marked
!           in reasonable ways as different from the original version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
*************** TERMS AND CONDITIONS
*** 41898,41908 ****
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or
!      conveying under this License, you may add to a covered work
!      material governed by the terms of that license document, provided
!      that the further restriction does not survive such relicensing or
!      conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
--- 41450,41459 ----
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or conveying
!      under this License, you may add to a covered work material governed
!      by the terms of that license document, provided that the further
!      restriction does not survive such relicensing or conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
*************** TERMS AND CONDITIONS
*** 41918,41930 ****
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under
!      the third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 41469,41481 ----
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under the
!      third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** TERMS AND CONDITIONS
*** 41936,41945 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, you do not qualify to receive new
!      licenses for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
--- 41487,41496 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, you do not qualify to receive new licenses
!      for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
*************** TERMS AND CONDITIONS
*** 41953,41959 ****
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!  10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
--- 41504,41510 ----
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!   10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
*************** TERMS AND CONDITIONS
*** 41967,41987 ****
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to
!      possession of the Corresponding Source of the work from the
!      predecessor in interest, if the predecessor has it or can get it
!      with reasonable efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for
!      exercise of rights granted under this License, and you may not
!      initiate litigation (including a cross-claim or counterclaim in a
!      lawsuit) alleging that any patent claim is infringed by making,
!      using, selling, offering for sale, or importing the Program or any
!      portion of it.
  
!  11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
--- 41518,41538 ----
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to possession
!      of the Corresponding Source of the work from the predecessor in
!      interest, if the predecessor has it or can get it with reasonable
!      efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for exercise
!      of rights granted under this License, and you may not initiate
!      litigation (including a cross-claim or counterclaim in a lawsuit)
!      alleging that any patent claim is infringed by making, using,
!      selling, offering for sale, or importing the Program or any portion
!      of it.
  
!   11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
*************** TERMS AND CONDITIONS
*** 42001,42015 ****
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its
!      contributor version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To
!      "grant" such a patent license to a party means to make such an
!      agreement or commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
--- 41552,41566 ----
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its contributor
!      version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To "grant"
!      such a patent license to a party means to make such an agreement or
!      commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
*************** TERMS AND CONDITIONS
*** 42039,42074 ****
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under
!      which you make payment to the third party based on the extent of
!      your activity of conveying the work, and under which the third
!      party grants, to any of the parties who would receive the covered
!      work from you, a discriminatory patent license (a) in connection
!      with copies of the covered work conveyed by you (or copies made
!      from those copies), or (b) primarily for and in connection with
!      specific products or compilations that contain the covered work,
!      unless you entered into that arrangement, or that patent license
!      was granted, prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!  12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order,
!      agreement or otherwise) that contradict the conditions of this
!      License, they do not excuse you from the conditions of this
!      License.  If you cannot convey a covered work so as to satisfy
!      simultaneously your obligations under this License and any other
!      pertinent obligations, then as a consequence you may not convey it
!      at all.  For example, if you agree to terms that obligate you to
!      collect a royalty for further conveying from those to whom you
!      convey the Program, the only way you could satisfy both those
!      terms and this License would be to refrain entirely from conveying
!      the Program.
  
!  13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
--- 41590,41624 ----
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under which
!      you make payment to the third party based on the extent of your
!      activity of conveying the work, and under which the third party
!      grants, to any of the parties who would receive the covered work
!      from you, a discriminatory patent license (a) in connection with
!      copies of the covered work conveyed by you (or copies made from
!      those copies), or (b) primarily for and in connection with specific
!      products or compilations that contain the covered work, unless you
!      entered into that arrangement, or that patent license was granted,
!      prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!   12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order, agreement
!      or otherwise) that contradict the conditions of this License, they
!      do not excuse you from the conditions of this License.  If you
!      cannot convey a covered work so as to satisfy simultaneously your
!      obligations under this License and any other pertinent obligations,
!      then as a consequence you may not convey it at all.  For example,
!      if you agree to terms that obligate you to collect a royalty for
!      further conveying from those to whom you convey the Program, the
!      only way you could satisfy both those terms and this License would
!      be to refrain entirely from conveying the Program.
  
!   13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
*************** TERMS AND CONDITIONS
*** 42079,42100 ****
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!  14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.
!      Such new versions will be similar in spirit to the present
!      version, but may differ in detail to address new problems or
!      concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the
!      Free Software Foundation.  If the Program does not specify a
!      version number of the GNU General Public License, you may choose
!      any version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
--- 41629,41649 ----
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!   14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.  Such
!      new versions will be similar in spirit to the present version, but
!      may differ in detail to address new problems or concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the Free
!      Software Foundation.  If the Program does not specify a version
!      number of the GNU General Public License, you may choose any
!      version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
*************** TERMS AND CONDITIONS
*** 42106,42129 ****
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!  15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!  16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU
!      FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
--- 41655,41678 ----
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!   15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!   16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR
!      DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
*************** TERMS AND CONDITIONS
*** 42131,42137 ****
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!  17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
--- 41680,41686 ----
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!   17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
*************** TERMS AND CONDITIONS
*** 42140,42146 ****
       connection with the Program, unless a warranty or assumption of
       liability accompanies a copy of the Program in return for a fee.
  
- 
  END OF TERMS AND CONDITIONS
  ===========================
  
--- 41689,41694 ----
*************** possible use to the public, the best way
*** 42152,42160 ****
  free software which everyone can redistribute and change under these
  terms.
  
!  To do so, attach the following notices to the program.  It is safest
! to attach them to the start of each source file to most effectively
! state the exclusion of warranty; and each file should have at least the
  "copyright" line and a pointer to where the full notice is found.
  
       ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES.
--- 41700,41708 ----
  free software which everyone can redistribute and change under these
  terms.
  
!  To do so, attach the following notices to the program.  It is safest to
! attach them to the start of each source file to most effectively state
! the exclusion of warranty; and each file should have at least the
  "copyright" line and a pointer to where the full notice is found.
  
       ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES.
*************** state the exclusion of warranty; and eac
*** 42171,42190 ****
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see `http://www.gnu.org/licenses/'.
  
   Also add information on how to contact you by electronic and paper
  mail.
  
!  If the program does terminal interaction, make it output a short
! notice like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type `show c' for details.
  
!  The hypothetical commands `show w' and `show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
--- 41719,41738 ----
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see <http://www.gnu.org/licenses/>.
  
   Also add information on how to contact you by electronic and paper
  mail.
  
!  If the program does terminal interaction, make it output a short notice
! like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type 'show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type 'show c' for details.
  
!  The hypothetical commands 'show w' and 'show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
*************** use an "about box".
*** 42192,42205 ****
   You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see `http://www.gnu.org/licenses/'.
  
   The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read `http://www.gnu.org/philosophy/why-not-lgpl.html'.
  
  
  File: gccint.info,  Node: GNU Free Documentation License,  Next: Contributors,  Prev: Copying,  Up: Top
--- 41740,41753 ----
   You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see <http://www.gnu.org/licenses/>.
  
   The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read <http://www.gnu.org/philosophy/why-not-lgpl.html>.
  
  
  File: gccint.info,  Node: GNU Free Documentation License,  Next: Contributors,  Prev: Copying,  Up: Top
*************** GNU Free Documentation License
*** 42210,42216 ****
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
--- 41758,41764 ----
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
*************** GNU Free Documentation License
*** 42235,42255 ****
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.
!      We recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it
!      can be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You
!      accept the license if you copy, modify or distribute the work in a
!      way requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
--- 41783,41803 ----
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.  We
!      recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it can
!      be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You accept
!      the license if you copy, modify or distribute the work in a way
!      requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
*************** GNU Free Documentation License
*** 42267,42278 ****
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in
!      the notice that says that the Document is released under this
!      License.  If a section does not fit the above definition of
!      Secondary then it is not allowed to be designated as Invariant.
!      The Document may contain zero Invariant Sections.  If the Document
!      does not identify any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
--- 41815,41826 ----
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in the
!      notice that says that the Document is released under this License.
!      If a section does not fit the above definition of Secondary then it
!      is not allowed to be designated as Invariant.  The Document may
!      contain zero Invariant Sections.  If the Document does not identify
!      any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
*************** GNU Free Documentation License
*** 42283,42309 ****
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images
!      composed of pixels) generic paint programs or (for drawings) some
!      widely available drawing editor, and that is suitable for input to
!      text formatters or for automatic translation to a variety of
!      formats suitable for input to text formatters.  A copy made in an
!      otherwise Transparent file format whose markup, or absence of
!      markup, has been arranged to thwart or discourage subsequent
!      modification by readers is not Transparent.  An image format is
!      not Transparent if used for any substantial amount of text.  A
!      copy that is not "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and
!      standard-conforming simple HTML, PostScript or PDF designed for
!      human modification.  Examples of transparent image formats include
!      PNG, XCF and JPG.  Opaque formats include proprietary formats that
!      can be read and edited only by proprietary word processors, SGML or
!      XML for which the DTD and/or processing tools are not generally
!      available, and the machine-generated HTML, PostScript or PDF
!      produced by some word processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
--- 41831,41857 ----
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images composed
!      of pixels) generic paint programs or (for drawings) some widely
!      available drawing editor, and that is suitable for input to text
!      formatters or for automatic translation to a variety of formats
!      suitable for input to text formatters.  A copy made in an otherwise
!      Transparent file format whose markup, or absence of markup, has
!      been arranged to thwart or discourage subsequent modification by
!      readers is not Transparent.  An image format is not Transparent if
!      used for any substantial amount of text.  A copy that is not
!      "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and standard-conforming
!      simple HTML, PostScript or PDF designed for human modification.
!      Examples of transparent image formats include PNG, XCF and JPG.
!      Opaque formats include proprietary formats that can be read and
!      edited only by proprietary word processors, SGML or XML for which
!      the DTD and/or processing tools are not generally available, and
!      the machine-generated HTML, PostScript or PDF produced by some word
!      processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
*************** GNU Free Documentation License
*** 42341,42348 ****
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow
!      the conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
--- 41889,41896 ----
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow the
!      conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
*************** GNU Free Documentation License
*** 42356,42367 ****
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the
!      title equally prominent and visible.  You may add other material
!      on the covers in addition.  Copying with changes limited to the
!      covers, as long as they preserve the title of the Document and
!      satisfy these conditions, can be treated as verbatim copying in
!      other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
--- 41904,41914 ----
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the title
!      equally prominent and visible.  You may add other material on the
!      covers in addition.  Copying with changes limited to the covers, as
!      long as they preserve the title of the Document and satisfy these
!      conditions, can be treated as verbatim copying in other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
*************** GNU Free Documentation License
*** 42369,42408 ****
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a
!      machine-readable Transparent copy along with each Opaque copy, or
!      state in or with each Opaque copy a computer-network location from
!      which the general network-using public has access to download
!      using public-standard network protocols a complete Transparent
!      copy of the Document, free of added material.  If you use the
!      latter option, you must take reasonably prudent steps, when you
!      begin distribution of Opaque copies in quantity, to ensure that
!      this Transparent copy will remain thus accessible at the stated
!      location until at least one year after the last time you
!      distribute an Opaque copy (directly or through your agents or
!      retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of
!      copies, to give them a chance to provide you with an updated
!      version of the Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with
!      the Modified Version filling the role of the Document, thus
!      licensing distribution and modification of the Modified Version to
!      whoever possesses a copy of it.  In addition, you must do these
!      things in the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of
!           previous versions (which should, if there were any, be listed
!           in the History section of the Document).  You may use the
!           same title as a previous version if the original publisher of
!           that version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
--- 41916,41954 ----
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a machine-readable
!      Transparent copy along with each Opaque copy, or state in or with
!      each Opaque copy a computer-network location from which the general
!      network-using public has access to download using public-standard
!      network protocols a complete Transparent copy of the Document, free
!      of added material.  If you use the latter option, you must take
!      reasonably prudent steps, when you begin distribution of Opaque
!      copies in quantity, to ensure that this Transparent copy will
!      remain thus accessible at the stated location until at least one
!      year after the last time you distribute an Opaque copy (directly or
!      through your agents or retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of copies,
!      to give them a chance to provide you with an updated version of the
!      Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with the
!      Modified Version filling the role of the Document, thus licensing
!      distribution and modification of the Modified Version to whoever
!      possesses a copy of it.  In addition, you must do these things in
!      the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of previous
!           versions (which should, if there were any, be listed in the
!           History section of the Document).  You may use the same title
!           as a previous version if the original publisher of that
!           version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
*************** GNU Free Documentation License
*** 42432,42462 ****
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on
!           the Title Page.  If there is no section Entitled "History" in
!           the Document, create one stating the title, year, authors,
!           and publisher of the Document as given on its Title Page,
!           then add an item describing the Modified Version as stated in
!           the previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in
!           the "History" section.  You may omit a network location for a
!           work that was published at least four years before the
!           Document itself, or if the original publisher of the version
!           it refers to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the
!           section all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document,
!           unaltered in their text and in their titles.  Section numbers
!           or the equivalent are not considered part of the section
!           titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
--- 41978,42007 ----
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on the
!           Title Page.  If there is no section Entitled "History" in the
!           Document, create one stating the title, year, authors, and
!           publisher of the Document as given on its Title Page, then add
!           an item describing the Modified Version as stated in the
!           previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in the
!           "History" section.  You may omit a network location for a work
!           that was published at least four years before the Document
!           itself, or if the original publisher of the version it refers
!           to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the section
!           all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document, unaltered
!           in their text and in their titles.  Section numbers or the
!           equivalent are not considered part of the section titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
*************** GNU Free Documentation License
*** 42469,42479 ****
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option
!      designate some or all of these sections as invariant.  To do this,
!      add their titles to the list of Invariant Sections in the Modified
!      Version's license notice.  These titles must be distinct from any
!      other section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
--- 42014,42024 ----
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option designate
!      some or all of these sections as invariant.  To do this, add their
!      titles to the list of Invariant Sections in the Modified Version's
!      license notice.  These titles must be distinct from any other
!      section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
*************** GNU Free Documentation License
*** 42482,42496 ****
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end
!      of the list of Cover Texts in the Modified Version.  Only one
!      passage of Front-Cover Text and one of Back-Cover Text may be
!      added by (or through arrangements made by) any one entity.  If the
!      Document already includes a cover text for the same cover,
!      previously added by you or by arrangement made by the same entity
!      you are acting on behalf of, you may not add another; but you may
!      replace the old one, on explicit permission from the previous
!      publisher that added the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
--- 42027,42041 ----
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end of
!      the list of Cover Texts in the Modified Version.  Only one passage
!      of Front-Cover Text and one of Back-Cover Text may be added by (or
!      through arrangements made by) any one entity.  If the Document
!      already includes a cover text for the same cover, previously added
!      by you or by arrangement made by the same entity you are acting on
!      behalf of, you may not add another; but you may replace the old
!      one, on explicit permission from the previous publisher that added
!      the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
*************** GNU Free Documentation License
*** 42500,42507 ****
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination
!      all of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
--- 42045,42052 ----
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination all
!      of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
*************** GNU Free Documentation License
*** 42528,42547 ****
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the
!      documents in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow
!      this License in all other respects regarding verbatim copying of
!      that document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of
!      a storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
--- 42073,42092 ----
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the documents
!      in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow this
!      License in all other respects regarding verbatim copying of that
!      document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of a
!      storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
*************** GNU Free Documentation License
*** 42586,42593 ****
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 42131,42138 ----
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** GNU Free Documentation License
*** 42599,42631 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, receipt of a copy of some or all of
!      the same material does not give you any rights to use it.
  
!  10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      `http://www.gnu.org/copyleft/'.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If
!      the Document does not specify a version number of this License,
!      you may choose any version ever published (not as a draft) by the
!      Free Software Foundation.  If the Document specifies that a proxy
!      can decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!  11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
--- 42144,42176 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, receipt of a copy of some or all of the
!      same material does not give you any rights to use it.
  
!   10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      <http://www.gnu.org/copyleft/>.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If the
!      Document does not specify a version number of this License, you may
!      choose any version ever published (not as a draft) by the Free
!      Software Foundation.  If the Document specifies that a proxy can
!      decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!   11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
*************** GNU Free Documentation License
*** 42655,42661 ****
       site under CC-BY-SA on the same site at any time before August 1,
       2009, provided the MMC is eligible for relicensing.
  
- 
  ADDENDUM: How to use this License for your documents
  ====================================================
  
--- 42200,42205 ----
*************** notices just after the title page:
*** 42672,42678 ****
         Free Documentation License''.
  
   If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
! replace the "with...Texts." line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
--- 42216,42222 ----
         Free Documentation License''.
  
   If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
! replace the "with...Texts."  line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
*************** combination of the three, merge those tw
*** 42683,42691 ****
  situation.
  
   If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of
! free software license, such as the GNU General Public License, to
! permit their use in free software.
  
  
  File: gccint.info,  Node: Contributors,  Next: Option Index,  Prev: GNU Free Documentation License,  Up: Top
--- 42227,42235 ----
  situation.
  
   If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of free
! software license, such as the GNU General Public License, to permit
! their use in free software.
  
  
  File: gccint.info,  Node: Contributors,  Next: Option Index,  Prev: GNU Free Documentation License,  Up: Top
*************** File: gccint.info,  Node: Contributors,
*** 42693,42701 ****
  Contributors to GCC
  *******************
  
! The GCC project would like to thank its many contributors.  Without
! them the project would not have been nearly as successful as it has
! been.  Any omissions in this list are accidental.  Feel free to contact
  <law@redhat.com> or <gerald@pfeifer.com> if you have been left out or
  some of your contributions are not listed.  Please keep this list in
  alphabetical order.
--- 42237,42245 ----
  Contributors to GCC
  *******************
  
! The GCC project would like to thank its many contributors.  Without them
! the project would not have been nearly as successful as it has been.
! Any omissions in this list are accidental.  Feel free to contact
  <law@redhat.com> or <gerald@pfeifer.com> if you have been left out or
  some of your contributions are not listed.  Please keep this list in
  alphabetical order.
*************** alphabetical order.
*** 42828,42834 ****
     * The GNU Classpath project for all of their merged runtime code.
  
     * Nick Clifton for arm, mcore, fr30, v850, m32r, msp430 rx work,
!      `--help', and other random hacking.
  
     * Michael Cook for libstdc++ cleanup patches to reduce warnings.
  
--- 42372,42378 ----
     * The GNU Classpath project for all of their merged runtime code.
  
     * Nick Clifton for arm, mcore, fr30, v850, m32r, msp430 rx work,
!      '--help', and other random hacking.
  
     * Michael Cook for libstdc++ cleanup patches to reduce warnings.
  
*************** alphabetical order.
*** 42848,42855 ****
     * Paul Dale for his work to add uClinux platform support to the m68k
       backend.
  
!    * Dario Dariol contributed the four varieties of sample programs
!      that print a copy of their source.
  
     * Russell Davidson for fstream and stringstream fixes in libstdc++.
  
--- 42392,42399 ----
     * Paul Dale for his work to add uClinux platform support to the m68k
       backend.
  
!    * Dario Dariol contributed the four varieties of sample programs that
!      print a copy of their source.
  
     * Russell Davidson for fstream and stringstream fixes in libstdc++.
  
*************** alphabetical order.
*** 42864,42882 ****
  
     * Gabriel Dos Reis for contributions to G++, contributions and
       maintenance of GCC diagnostics infrastructure, libstdc++-v3,
!      including `valarray<>', `complex<>', maintaining the numerics
!      library (including that pesky `<limits>' :-) and keeping
!      up-to-date anything to do with numbers.
  
     * Ulrich Drepper for his work on glibc, testing of GCC using glibc,
!      ISO C99 support, CFG dumping support, etc., plus support of the
!      C++ runtime libraries including for all kinds of C interface
!      issues, contributing and maintaining `complex<>', sanity checking
!      and disbursement, configuration architecture, libio maintenance,
!      and early math work.
  
     * Franc,ois Dumont for his work on libstdc++-v3, especially
!      maintaining and improving `debug-mode' and associative and
       unordered containers.
  
     * Zdenek Dvorak for a new loop unroller and various fixes.
--- 42408,42426 ----
  
     * Gabriel Dos Reis for contributions to G++, contributions and
       maintenance of GCC diagnostics infrastructure, libstdc++-v3,
!      including 'valarray<>', 'complex<>', maintaining the numerics
!      library (including that pesky '<limits>' :-) and keeping up-to-date
!      anything to do with numbers.
  
     * Ulrich Drepper for his work on glibc, testing of GCC using glibc,
!      ISO C99 support, CFG dumping support, etc., plus support of the C++
!      runtime libraries including for all kinds of C interface issues,
!      contributing and maintaining 'complex<>', sanity checking and
!      disbursement, configuration architecture, libio maintenance, and
!      early math work.
  
     * Franc,ois Dumont for his work on libstdc++-v3, especially
!      maintaining and improving 'debug-mode' and associative and
       unordered containers.
  
     * Zdenek Dvorak for a new loop unroller and various fixes.
*************** alphabetical order.
*** 42928,42938 ****
     * Peter Gerwinski for various bug fixes and the Pascal front end.
  
     * Kaveh R. Ghazi for his direction via the steering committee,
!      amazing work to make `-W -Wall -W* -Werror' useful, and testing
!      GCC on a plethora of platforms.  Kaveh extends his gratitude to
!      the CAIP Center at Rutgers University for providing him with
!      computing resources to work on Free Software from the late 1980s
!      to 2010.
  
     * John Gilmore for a donation to the FSF earmarked improving GNU
       Java.
--- 42472,42481 ----
     * Peter Gerwinski for various bug fixes and the Pascal front end.
  
     * Kaveh R. Ghazi for his direction via the steering committee,
!      amazing work to make '-W -Wall -W* -Werror' useful, and testing GCC
!      on a plethora of platforms.  Kaveh extends his gratitude to the
!      CAIP Center at Rutgers University for providing him with computing
!      resources to work on Free Software from the late 1980s to 2010.
  
     * John Gilmore for a donation to the FSF earmarked improving GNU
       Java.
*************** alphabetical order.
*** 42944,42964 ****
       support, improved leaf function register allocation, and his
       direction via the steering committee.
  
!    * Jonny Grant for improvements to `collect2's' `--help'
       documentation.
  
!    * Anthony Green for his `-Os' contributions, the moxie port, and
!      Java front end work.
  
!    * Stu Grossman for gdb hacking, allowing GCJ developers to debug
!      Java code.
  
     * Michael K. Gschwind contributed the port to the PDP-11.
  
     * Richard Biener for his ongoing middle-end contributions and bug
       fixes and for release management.
  
!    * Ron Guilmette implemented the `protoize' and `unprotoize' tools,
       the support for Dwarf symbolic debugging information, and much of
       the support for System V Release 4.  He has also worked heavily on
       the Intel 386 and 860 support.
--- 42487,42507 ----
       support, improved leaf function register allocation, and his
       direction via the steering committee.
  
!    * Jonny Grant for improvements to 'collect2's' '--help'
       documentation.
  
!    * Anthony Green for his '-Os' contributions, the moxie port, and Java
!      front end work.
  
!    * Stu Grossman for gdb hacking, allowing GCJ developers to debug Java
!      code.
  
     * Michael K. Gschwind contributed the port to the PDP-11.
  
     * Richard Biener for his ongoing middle-end contributions and bug
       fixes and for release management.
  
!    * Ron Guilmette implemented the 'protoize' and 'unprotoize' tools,
       the support for Dwarf symbolic debugging information, and much of
       the support for System V Release 4.  He has also worked heavily on
       the Intel 386 and 860 support.
*************** alphabetical order.
*** 42977,42984 ****
       series 300.
  
     * Michael Hayes for various thankless work he's done trying to get
!      the c30/c40 ports functional.  Lots of loop and unroll
!      improvements and fixes.
  
     * Dara Hazeghi for wading through myriads of target-specific bug
       reports.
--- 42520,42527 ----
       series 300.
  
     * Michael Hayes for various thankless work he's done trying to get
!      the c30/c40 ports functional.  Lots of loop and unroll improvements
!      and fixes.
  
     * Dara Hazeghi for wading through myriads of target-specific bug
       reports.
*************** alphabetical order.
*** 43012,43019 ****
  
     * Falk Hueffner for working on C and optimization bug reports.
  
!    * Bernardo Innocenti for his m68k work, including merging of
!      ColdFire improvements and uClinux support.
  
     * Christian Iseli for various bug fixes.
  
--- 42555,42562 ----
  
     * Falk Hueffner for working on C and optimization bug reports.
  
!    * Bernardo Innocenti for his m68k work, including merging of ColdFire
!      improvements and uClinux support.
  
     * Christian Iseli for various bug fixes.
  
*************** alphabetical order.
*** 43066,43078 ****
     * Richard Kenner of the New York University Ultracomputer Research
       Laboratory wrote the machine descriptions for the AMD 29000, the
       DEC Alpha, the IBM RT PC, and the IBM RS/6000 as well as the
!      support for instruction attributes.  He also made changes to
!      better support RISC processors including changes to common
!      subexpression elimination, strength reduction, function calling
!      sequence handling, and condition code support, in addition to
!      generalizing the code for frame pointer elimination and delay slot
!      scheduling.  Richard Kenner was also the head maintainer of GCC
!      for several years.
  
     * Mumit Khan for various contributions to the Cygwin and Mingw32
       ports and maintaining binary releases for Microsoft Windows hosts,
--- 42609,42621 ----
     * Richard Kenner of the New York University Ultracomputer Research
       Laboratory wrote the machine descriptions for the AMD 29000, the
       DEC Alpha, the IBM RT PC, and the IBM RS/6000 as well as the
!      support for instruction attributes.  He also made changes to better
!      support RISC processors including changes to common subexpression
!      elimination, strength reduction, function calling sequence
!      handling, and condition code support, in addition to generalizing
!      the code for frame pointer elimination and delay slot scheduling.
!      Richard Kenner was also the head maintainer of GCC for several
!      years.
  
     * Mumit Khan for various contributions to the Cygwin and Mingw32
       ports and maintaining binary releases for Microsoft Windows hosts,
*************** alphabetical order.
*** 43098,43108 ****
     * Asher Langton and Mike Kumbera for contributing Cray pointer
       support to GNU Fortran, and for other GNU Fortran improvements.
  
!    * Jeff Law for his direction via the steering committee,
!      coordinating the entire egcs project and GCC 2.95, rolling out
!      snapshots and releases, handling merges from GCC2, reviewing tons
!      of patches that might have fallen through the cracks else, and
!      random but extensive hacking.
  
     * Walter Lee for work on the TILE-Gx and TILEPro ports.
  
--- 42641,42651 ----
     * Asher Langton and Mike Kumbera for contributing Cray pointer
       support to GNU Fortran, and for other GNU Fortran improvements.
  
!    * Jeff Law for his direction via the steering committee, coordinating
!      the entire egcs project and GCC 2.95, rolling out snapshots and
!      releases, handling merges from GCC2, reviewing tons of patches that
!      might have fallen through the cracks else, and random but extensive
!      hacking.
  
     * Walter Lee for work on the TILE-Gx and TILEPro ports.
  
*************** alphabetical order.
*** 43131,43137 ****
  
     * Weiwen Liu for testing and various bug fixes.
  
!    * Manuel Lo'pez-Iba'n~ez for improving `-Wconversion' and many other
       diagnostics fixes and improvements.
  
     * Dave Love for his ongoing work with the Fortran front end and
--- 42674,42680 ----
  
     * Weiwen Liu for testing and various bug fixes.
  
!    * Manuel Lo'pez-Iba'n~ez for improving '-Wconversion' and many other
       diagnostics fixes and improvements.
  
     * Dave Love for his ongoing work with the Fortran front end and
*************** alphabetical order.
*** 43148,43161 ****
     * Greg McGary for random fixes and (someday) bounded pointers.
  
     * Andrew MacLeod for his ongoing work in building a real EH system,
!      various code generation improvements, work on the global
!      optimizer, etc.
  
     * Vladimir Makarov for hacking some ugly i960 problems, PowerPC
!      hacking improvements to compile-time performance, overall
!      knowledge and direction in the area of instruction scheduling, and
!      design and implementation of the automaton based instruction
!      scheduler.
  
     * Bob Manson for his behind the scenes work on dejagnu.
  
--- 42691,42703 ----
     * Greg McGary for random fixes and (someday) bounded pointers.
  
     * Andrew MacLeod for his ongoing work in building a real EH system,
!      various code generation improvements, work on the global optimizer,
!      etc.
  
     * Vladimir Makarov for hacking some ugly i960 problems, PowerPC
!      hacking improvements to compile-time performance, overall knowledge
!      and direction in the area of instruction scheduling, and design and
!      implementation of the automaton based instruction scheduler.
  
     * Bob Manson for his behind the scenes work on dejagnu.
  
*************** alphabetical order.
*** 43194,43200 ****
  
     * Mark Mitchell for his direction via the steering committee,
       mountains of C++ work, load/store hoisting out of loops, alias
!      analysis improvements, ISO C `restrict' support, and serving as
       release manager from 2000 to 2011.
  
     * Alan Modra for various GNU/Linux bits and testing.
--- 42736,42742 ----
  
     * Mark Mitchell for his direction via the steering committee,
       mountains of C++ work, load/store hoisting out of loops, alias
!      analysis improvements, ISO C 'restrict' support, and serving as
       release manager from 2000 to 2011.
  
     * Alan Modra for various GNU/Linux bits and testing.
*************** alphabetical order.
*** 43204,43212 ****
  
     * Jason Molenda for major help in the care and feeding of all the
       services on the gcc.gnu.org (formerly egcs.cygnus.com)
!      machine--mail, web services, ftp services, etc etc.  Doing all
!      this work on scrap paper and the backs of envelopes would have
!      been... difficult.
  
     * Catherine Moore for fixing various ugly problems we have sent her
       way, including the haifa bug which was killing the Alpha & PowerPC
--- 42746,42754 ----
  
     * Jason Molenda for major help in the care and feeding of all the
       services on the gcc.gnu.org (formerly egcs.cygnus.com)
!      machine--mail, web services, ftp services, etc etc.  Doing all this
!      work on scrap paper and the backs of envelopes would have been...
!      difficult.
  
     * Catherine Moore for fixing various ugly problems we have sent her
       way, including the haifa bug which was killing the Alpha & PowerPC
*************** alphabetical order.
*** 43218,43225 ****
       initial IA-64 port.
  
     * Stephen Moshier contributed the floating point emulator that
!      assists in cross-compilation and permits support for floating
!      point numbers wider than 64 bits and for ISO C99 support.
  
     * Bill Moyer for his behind the scenes work on various issues.
  
--- 42760,42767 ----
       initial IA-64 port.
  
     * Stephen Moshier contributed the floating point emulator that
!      assists in cross-compilation and permits support for floating point
!      numbers wider than 64 bits and for ISO C99 support.
  
     * Bill Moyer for his behind the scenes work on various issues.
  
*************** alphabetical order.
*** 43242,43250 ****
     * NeXT, Inc. donated the front end that supports the Objective-C
       language.
  
!    * Hans-Peter Nilsson for the CRIS and MMIX ports, improvements to
!      the search engine setup, various documentation fixes and other
!      small fixes.
  
     * Geoff Noer for his work on getting cygwin native builds working.
  
--- 42784,42792 ----
     * NeXT, Inc. donated the front end that supports the Objective-C
       language.
  
!    * Hans-Peter Nilsson for the CRIS and MMIX ports, improvements to the
!      search engine setup, various documentation fixes and other small
!      fixes.
  
     * Geoff Noer for his work on getting cygwin native builds working.
  
*************** alphabetical order.
*** 43252,43259 ****
       tracking web pages, GIMPLE tuples, and assorted fixes.
  
     * David O'Brien for the FreeBSD/alpha, FreeBSD/AMD x86-64,
!      FreeBSD/ARM, FreeBSD/PowerPC, and FreeBSD/SPARC64 ports and
!      related infrastructure improvements.
  
     * Alexandre Oliva for various build infrastructure improvements,
       scripts and amazing testing work, including keeping libtool issues
--- 42794,42801 ----
       tracking web pages, GIMPLE tuples, and assorted fixes.
  
     * David O'Brien for the FreeBSD/alpha, FreeBSD/AMD x86-64,
!      FreeBSD/ARM, FreeBSD/PowerPC, and FreeBSD/SPARC64 ports and related
!      infrastructure improvements.
  
     * Alexandre Oliva for various build infrastructure improvements,
       scripts and amazing testing work, including keeping libtool issues
*************** alphabetical order.
*** 43265,43272 ****
  
     * Rainer Orth for random MIPS work, including improvements to GCC's
       o32 ABI support, improvements to dejagnu's MIPS support, Java
!      configuration clean-ups and porting work, and maintaining the
!      IRIX, Solaris 2, and Tru64 UNIX ports.
  
     * Hartmut Penner for work on the s390 port.
  
--- 42807,42814 ----
  
     * Rainer Orth for random MIPS work, including improvements to GCC's
       o32 ABI support, improvements to dejagnu's MIPS support, Java
!      configuration clean-ups and porting work, and maintaining the IRIX,
!      Solaris 2, and Tru64 UNIX ports.
  
     * Hartmut Penner for work on the s390 port.
  
*************** alphabetical order.
*** 43316,43322 ****
  
     * David Ronis inspired and encouraged Craig to rewrite the G77
       documentation in texinfo format by contributing a first pass at a
!      translation of the old `g77-0.5.16/f/DOC' file.
  
     * Ken Rose for fixes to GCC's delay slot filling code.
  
--- 42858,42864 ----
  
     * David Ronis inspired and encouraged Craig to rewrite the G77
       documentation in texinfo format by contributing a first pass at a
!      translation of the old 'g77-0.5.16/f/DOC' file.
  
     * Ken Rose for fixes to GCC's delay slot filling code.
  
*************** alphabetical order.
*** 43348,43355 ****
     * Tobias Schlu"ter for work on GNU Fortran.
  
     * Bernd Schmidt for various code generation improvements and major
!      work in the reload pass, serving as release manager for GCC
!      2.95.3, and work on the Blackfin and C6X ports.
  
     * Peter Schmid for constant testing of libstdc++--especially
       application testing, going above and beyond what was requested for
--- 42890,42897 ----
     * Tobias Schlu"ter for work on GNU Fortran.
  
     * Bernd Schmidt for various code generation improvements and major
!      work in the reload pass, serving as release manager for GCC 2.95.3,
!      and work on the Blackfin and C6X ports.
  
     * Peter Schmid for constant testing of libstdc++--especially
       application testing, going above and beyond what was requested for
*************** alphabetical order.
*** 43364,43370 ****
     * Dodji Seketeli for numerous C++ bug fixes and debug info
       improvements.
  
!    * Tim Shen for major work on `<regex>'.
  
     * Joel Sherrill for his direction via the steering committee, RTEMS
       contributions and RTEMS testing.
--- 42906,42912 ----
     * Dodji Seketeli for numerous C++ bug fixes and debug info
       improvements.
  
!    * Tim Shen for major work on '<regex>'.
  
     * Joel Sherrill for his direction via the steering committee, RTEMS
       contributions and RTEMS testing.
*************** alphabetical order.
*** 43379,43386 ****
       from the LWG (thereby keeping GCC in line with updates from the
       ISO).
  
!    * Franz Sirl for his ongoing work with making the PPC port stable
!      for GNU/Linux.
  
     * Andrey Slepuhin for assorted AIX hacking.
  
--- 42921,42928 ----
       from the LWG (thereby keeping GCC in line with updates from the
       ISO).
  
!    * Franz Sirl for his ongoing work with making the PPC port stable for
!      GNU/Linux.
  
     * Andrey Slepuhin for assorted AIX hacking.
  
*************** alphabetical order.
*** 43395,43406 ****
     * Randy Smith finished the Sun FPA support.
  
     * Ed Smith-Rowland for his continuous work on libstdc++-v3, special
!      functions, `<random>', and various improvements to C++11 features.
  
     * Scott Snyder for queue, iterator, istream, and string fixes and
       libstdc++ testsuite entries.  Also for providing the patch to G77
!      to add rudimentary support for `INTEGER*1', `INTEGER*2', and
!      `LOGICAL*1'.
  
     * Zdenek Sojka for running automated regression testing of GCC and
       reporting numerous bugs.
--- 42937,42948 ----
     * Randy Smith finished the Sun FPA support.
  
     * Ed Smith-Rowland for his continuous work on libstdc++-v3, special
!      functions, '<random>', and various improvements to C++11 features.
  
     * Scott Snyder for queue, iterator, istream, and string fixes and
       libstdc++ testsuite entries.  Also for providing the patch to G77
!      to add rudimentary support for 'INTEGER*1', 'INTEGER*2', and
!      'LOGICAL*1'.
  
     * Zdenek Sojka for running automated regression testing of GCC and
       reporting numerous bugs.
*************** alphabetical order.
*** 43424,43431 ****
  
     * John Stracke for his Java HTTP protocol fixes.
  
!    * Mike Stump for his Elxsi port, G++ contributions over the years
!      and more recently his vxworks contributions
  
     * Jeff Sturm for Java porting help, bug fixes, and encouragement.
  
--- 42966,42973 ----
  
     * John Stracke for his Java HTTP protocol fixes.
  
!    * Mike Stump for his Elxsi port, G++ contributions over the years and
!      more recently his vxworks contributions
  
     * Jeff Sturm for Java porting help, bug fixes, and encouragement.
  
*************** alphabetical order.
*** 43479,43486 ****
     * Jonathan Wakely for contributing libstdc++ Doxygen notes and XHTML
       guidance.
  
!    * Dean Wakerley for converting the install documentation from HTML
!      to texinfo in time for GCC 3.0.
  
     * Krister Walfridsson for random bug fixes.
  
--- 43021,43028 ----
     * Jonathan Wakely for contributing libstdc++ Doxygen notes and XHTML
       guidance.
  
!    * Dean Wakerley for converting the install documentation from HTML to
!      texinfo in time for GCC 3.0.
  
     * Krister Walfridsson for random bug fixes.
  
*************** alphabetical order.
*** 43488,43495 ****
  
     * Stephen M. Webb for time and effort on making libstdc++ shadow
       files work with the tricky Solaris 8+ headers, and for pushing the
!      build-time header tree. Also, for starting and driving the
!      `<regex>' effort.
  
     * John Wehle for various improvements for the x86 code generator,
       related infrastructure improvements to help x86 code generation,
--- 43030,43037 ----
  
     * Stephen M. Webb for time and effort on making libstdc++ shadow
       files work with the tricky Solaris 8+ headers, and for pushing the
!      build-time header tree.  Also, for starting and driving the
!      '<regex>' effort.
  
     * John Wehle for various improvements for the x86 code generator,
       related infrastructure improvements to help x86 code generation,
*************** alphabetical order.
*** 43511,43518 ****
     * Bob Wilson from Tensilica, Inc. for the Xtensa port.
  
     * Jim Wilson for his direction via the steering committee, tackling
!      hard problems in various places that nobody else wanted to work
!      on, strength reduction and other loop optimizations.
  
     * Paul Woegerer and Tal Agmon for the CRX port.
  
--- 43053,43060 ----
     * Bob Wilson from Tensilica, Inc. for the Xtensa port.
  
     * Jim Wilson for his direction via the steering committee, tackling
!      hard problems in various places that nobody else wanted to work on,
!      strength reduction and other loop optimizations.
  
     * Paul Woegerer and Tal Agmon for the CRX port.
  
*************** alphabetical order.
*** 43535,43541 ****
  
     * Gilles Zunino for help porting Java to Irix.
  
- 
   The following people are recognized for their contributions to GNAT,
  the Ada front end of GCC:
     * Bernard Banner
--- 43077,43082 ----
*************** the Ada front end of GCC:
*** 43632,43733 ****
  
     * Samuel Tardieu
  
- 
   The following people are recognized for their contributions of new
  features, bug reports, testing and integration of classpath/libgcj for
  GCC version 4.1:
!    * Lillian Angel for `JTree' implementation and lots Free Swing
       additions and bug fixes.
  
!    * Wolfgang Baer for `GapContent' bug fixes.
  
!    * Anthony Balkissoon for `JList', Free Swing 1.5 updates and mouse
!      event fixes, lots of Free Swing work including `JTable' editing.
  
     * Stuart Ballard for RMI constant fixes.
  
!    * Goffredo Baroncelli for `HTTPURLConnection' fixes.
  
!    * Gary Benson for `MessageFormat' fixes.
  
!    * Daniel Bonniot for `Serialization' fixes.
  
!    * Chris Burdess for lots of gnu.xml and http protocol fixes, `StAX'
!      and `DOM xml:id' support.
  
!    * Ka-Hing Cheung for `TreePath' and `TreeSelection' fixes.
  
     * Archie Cobbs for build fixes, VM interface updates,
!      `URLClassLoader' updates.
  
     * Kelley Cook for build fixes.
  
!    * Martin Cordova for Suggestions for better `SocketTimeoutException'.
  
!    * David Daney for `BitSet' bug fixes, `HttpURLConnection' rewrite
!      and improvements.
  
     * Thomas Fitzsimmons for lots of upgrades to the gtk+ AWT and Cairo
!      2D support. Lots of imageio framework additions, lots of AWT and
       Free Swing bug fixes.
  
!    * Jeroen Frijters for `ClassLoader' and nio cleanups, serialization
!      fixes, better `Proxy' support, bug fixes and IKVM integration.
  
!    * Santiago Gala for `AccessControlContext' fixes.
  
!    * Nicolas Geoffray for `VMClassLoader' and `AccessController'
       improvements.
  
!    * David Gilbert for `basic' and `metal' icon and plaf support and
       lots of documenting, Lots of Free Swing and metal theme additions.
!      `MetalIconFactory' implementation.
  
!    * Anthony Green for `MIDI' framework, `ALSA' and `DSSI' providers.
  
!    * Andrew Haley for `Serialization' and `URLClassLoader' fixes, gcj
       build speedups.
  
!    * Kim Ho for `JFileChooser' implementation.
  
!    * Andrew John Hughes for `Locale' and net fixes, URI RFC2986
!      updates, `Serialization' fixes, `Properties' XML support and
!      generic branch work, VMIntegration guide update.
  
!    * Bastiaan Huisman for `TimeZone' bug fixing.
  
     * Andreas Jaeger for mprec updates.
  
!    * Paul Jenner for better `-Werror' support.
  
!    * Ito Kazumitsu for `NetworkInterface' implementation and updates.
  
!    * Roman Kennke for `BoxLayout', `GrayFilter' and `SplitPane', plus
!      bug fixes all over. Lots of Free Swing work including styled text.
  
!    * Simon Kitching for `String' cleanups and optimization suggestions.
  
!    * Michael Koch for configuration fixes, `Locale' updates, bug and
       build fixes.
  
     * Guilhem Lavaux for configuration, thread and channel fixes and
!      Kaffe integration. JCL native `Pointer' updates. Logger bug fixes.
  
     * David Lichteblau for JCL support library global/local reference
       cleanups.
  
     * Aaron Luchko for JDWP updates and documentation fixes.
  
!    * Ziga Mahkovec for `Graphics2D' upgraded to Cairo 0.5 and new regex
       features.
  
!    * Sven de Marothy for BMP imageio support, CSS and `TextLayout'
!      fixes. `GtkImage' rewrite, 2D, awt, free swing and date/time fixes
       and implementing the Qt4 peers.
  
!    * Casey Marshall for crypto algorithm fixes, `FileChannel' lock,
!      `SystemLogger' and `FileHandler' rotate implementations, NIO
!      `FileChannel.map' support, security and policy updates.
  
     * Bryce McKinlay for RMI work.
  
--- 43173,43274 ----
  
     * Samuel Tardieu
  
   The following people are recognized for their contributions of new
  features, bug reports, testing and integration of classpath/libgcj for
  GCC version 4.1:
!    * Lillian Angel for 'JTree' implementation and lots Free Swing
       additions and bug fixes.
  
!    * Wolfgang Baer for 'GapContent' bug fixes.
  
!    * Anthony Balkissoon for 'JList', Free Swing 1.5 updates and mouse
!      event fixes, lots of Free Swing work including 'JTable' editing.
  
     * Stuart Ballard for RMI constant fixes.
  
!    * Goffredo Baroncelli for 'HTTPURLConnection' fixes.
  
!    * Gary Benson for 'MessageFormat' fixes.
  
!    * Daniel Bonniot for 'Serialization' fixes.
  
!    * Chris Burdess for lots of gnu.xml and http protocol fixes, 'StAX'
!      and 'DOM xml:id' support.
  
!    * Ka-Hing Cheung for 'TreePath' and 'TreeSelection' fixes.
  
     * Archie Cobbs for build fixes, VM interface updates,
!      'URLClassLoader' updates.
  
     * Kelley Cook for build fixes.
  
!    * Martin Cordova for Suggestions for better 'SocketTimeoutException'.
  
!    * David Daney for 'BitSet' bug fixes, 'HttpURLConnection' rewrite and
!      improvements.
  
     * Thomas Fitzsimmons for lots of upgrades to the gtk+ AWT and Cairo
!      2D support.  Lots of imageio framework additions, lots of AWT and
       Free Swing bug fixes.
  
!    * Jeroen Frijters for 'ClassLoader' and nio cleanups, serialization
!      fixes, better 'Proxy' support, bug fixes and IKVM integration.
  
!    * Santiago Gala for 'AccessControlContext' fixes.
  
!    * Nicolas Geoffray for 'VMClassLoader' and 'AccessController'
       improvements.
  
!    * David Gilbert for 'basic' and 'metal' icon and plaf support and
       lots of documenting, Lots of Free Swing and metal theme additions.
!      'MetalIconFactory' implementation.
  
!    * Anthony Green for 'MIDI' framework, 'ALSA' and 'DSSI' providers.
  
!    * Andrew Haley for 'Serialization' and 'URLClassLoader' fixes, gcj
       build speedups.
  
!    * Kim Ho for 'JFileChooser' implementation.
  
!    * Andrew John Hughes for 'Locale' and net fixes, URI RFC2986 updates,
!      'Serialization' fixes, 'Properties' XML support and generic branch
!      work, VMIntegration guide update.
  
!    * Bastiaan Huisman for 'TimeZone' bug fixing.
  
     * Andreas Jaeger for mprec updates.
  
!    * Paul Jenner for better '-Werror' support.
  
!    * Ito Kazumitsu for 'NetworkInterface' implementation and updates.
  
!    * Roman Kennke for 'BoxLayout', 'GrayFilter' and 'SplitPane', plus
!      bug fixes all over.  Lots of Free Swing work including styled text.
  
!    * Simon Kitching for 'String' cleanups and optimization suggestions.
  
!    * Michael Koch for configuration fixes, 'Locale' updates, bug and
       build fixes.
  
     * Guilhem Lavaux for configuration, thread and channel fixes and
!      Kaffe integration.  JCL native 'Pointer' updates.  Logger bug
!      fixes.
  
     * David Lichteblau for JCL support library global/local reference
       cleanups.
  
     * Aaron Luchko for JDWP updates and documentation fixes.
  
!    * Ziga Mahkovec for 'Graphics2D' upgraded to Cairo 0.5 and new regex
       features.
  
!    * Sven de Marothy for BMP imageio support, CSS and 'TextLayout'
!      fixes.  'GtkImage' rewrite, 2D, awt, free swing and date/time fixes
       and implementing the Qt4 peers.
  
!    * Casey Marshall for crypto algorithm fixes, 'FileChannel' lock,
!      'SystemLogger' and 'FileHandler' rotate implementations, NIO
!      'FileChannel.map' support, security and policy updates.
  
     * Bryce McKinlay for RMI work.
  
*************** GCC version 4.1:
*** 43738,43783 ****
  
     * Rainer Orth for build fixes.
  
!    * Andrew Overholt for `File' locking fixes.
  
!    * Ingo Proetel for `Image', `Logger' and `URLClassLoader' updates.
  
!    * Olga Rodimina for `MenuSelectionManager' implementation.
  
!    * Jan Roehrich for `BasicTreeUI' and `JTree' fixes.
  
     * Julian Scheid for documentation updates and gjdoc support.
  
     * Christian Schlichtherle for zip fixes and cleanups.
  
     * Robert Schuster for documentation updates and beans fixes,
!      `TreeNode' enumerations and `ActionCommand' and various fixes, XML
       and URL, AWT and Free Swing bug fixes.
  
     * Keith Seitz for lots of JDWP work.
  
     * Christian Thalinger for 64-bit cleanups, Configuration and VM
!      interface fixes and `CACAO' integration, `fdlibm' updates.
  
!    * Gael Thomas for `VMClassLoader' boot packages support suggestions.
  
!    * Andreas Tobler for Darwin and Solaris testing and fixing, `Qt4'
!      support for Darwin/OS X, `Graphics2D' support, `gtk+' updates.
  
!    * Dalibor Topic for better `DEBUG' support, build cleanups and Kaffe
!      integration. `Qt4' build infrastructure, `SHA1PRNG' and
!      `GdkPixbugDecoder' updates.
  
     * Tom Tromey for Eclipse integration, generics work, lots of bug
       fixes and gcj integration including coordinating The Big Merge.
  
     * Mark Wielaard for bug fixes, packaging and release management,
!      `Clipboard' implementation, system call interrupts and network
!      timeouts and `GdkPixpufDecoder' fixes.
! 
  
!  In addition to the above, all of which also contributed time and
! energy in testing GCC, we would like to thank the following for their
  contributions to testing:
  
     * Michael Abd-El-Malek
--- 43279,43323 ----
  
     * Rainer Orth for build fixes.
  
!    * Andrew Overholt for 'File' locking fixes.
  
!    * Ingo Proetel for 'Image', 'Logger' and 'URLClassLoader' updates.
  
!    * Olga Rodimina for 'MenuSelectionManager' implementation.
  
!    * Jan Roehrich for 'BasicTreeUI' and 'JTree' fixes.
  
     * Julian Scheid for documentation updates and gjdoc support.
  
     * Christian Schlichtherle for zip fixes and cleanups.
  
     * Robert Schuster for documentation updates and beans fixes,
!      'TreeNode' enumerations and 'ActionCommand' and various fixes, XML
       and URL, AWT and Free Swing bug fixes.
  
     * Keith Seitz for lots of JDWP work.
  
     * Christian Thalinger for 64-bit cleanups, Configuration and VM
!      interface fixes and 'CACAO' integration, 'fdlibm' updates.
  
!    * Gael Thomas for 'VMClassLoader' boot packages support suggestions.
  
!    * Andreas Tobler for Darwin and Solaris testing and fixing, 'Qt4'
!      support for Darwin/OS X, 'Graphics2D' support, 'gtk+' updates.
  
!    * Dalibor Topic for better 'DEBUG' support, build cleanups and Kaffe
!      integration.  'Qt4' build infrastructure, 'SHA1PRNG' and
!      'GdkPixbugDecoder' updates.
  
     * Tom Tromey for Eclipse integration, generics work, lots of bug
       fixes and gcj integration including coordinating The Big Merge.
  
     * Mark Wielaard for bug fixes, packaging and release management,
!      'Clipboard' implementation, system call interrupts and network
!      timeouts and 'GdkPixpufDecoder' fixes.
  
!  In addition to the above, all of which also contributed time and energy
! in testing GCC, we would like to thank the following for their
  contributions to testing:
  
     * Michael Abd-El-Malek
*************** File: gccint.info,  Node: Option Index,
*** 43946,43954 ****
  Option Index
  ************
  
! GCC's command line options are indexed here without any initial `-' or
! `--'.  Where an option has both positive and negative forms (such as
! `-fOPTION' and `-fno-OPTION'), relevant entries in the manual are
  indexed under the most appropriate form; it may sometimes be useful to
  look up both forms.
  
--- 43486,43494 ----
  Option Index
  ************
  
! GCC's command line options are indexed here without any initial '-' or
! '--'.  Where an option has both positive and negative forms (such as
! '-fOPTION' and '-fno-OPTION'), relevant entries in the manual are
  indexed under the most appropriate form; it may sometimes be useful to
  look up both forms.
  
*************** Concept Index
*** 43980,44023 ****
  * % in GTY option:                       GTY Options.        (line   18)
  * % in template:                         Output Template.    (line    6)
  * & in constraint:                       Modifiers.          (line   25)
! * (:                                     GIMPLE API.         (line   31)
  * (nil):                                 RTL Objects.        (line   73)
  * * in constraint:                       Modifiers.          (line   83)
  * * in template:                         Output Statement.   (line   29)
! * *gimple_build_asm_vec:                 GIMPLE_ASM.         (line    9)
! * *gimple_build_assign:                  GIMPLE_ASSIGN.      (line    7)
! * *gimple_build_bind:                    GIMPLE_BIND.        (line    8)
! * *gimple_build_call:                    GIMPLE_CALL.        (line    8)
! * *gimple_build_call_from_tree:          GIMPLE_CALL.        (line   16)
! * *gimple_build_call_vec:                GIMPLE_CALL.        (line   25)
! * *gimple_build_catch:                   GIMPLE_CATCH.       (line    8)
! * *gimple_build_cond:                    GIMPLE_COND.        (line    8)
! * *gimple_build_cond_from_tree:          GIMPLE_COND.        (line   16)
! * *gimple_build_debug_bind:              GIMPLE_DEBUG.       (line    8)
! * *gimple_build_eh_filter:               GIMPLE_EH_FILTER.   (line    8)
! * *gimple_build_goto:                    GIMPLE_GOTO.        (line    7)
! * *gimple_build_label:                   GIMPLE_LABEL.       (line    7)
  * *gimple_build_omp_atomic_load:         GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line    8)
  * *gimple_build_omp_atomic_store:        GIMPLE_OMP_ATOMIC_STORE.
!                                                              (line    8)
  * *gimple_build_omp_continue:            GIMPLE_OMP_CONTINUE.
!                                                              (line    8)
  * *gimple_build_omp_critical:            GIMPLE_OMP_CRITICAL.
!                                                              (line    8)
! * *gimple_build_omp_for:                 GIMPLE_OMP_FOR.     (line    9)
  * *gimple_build_omp_parallel:            GIMPLE_OMP_PARALLEL.
!                                                              (line    8)
  * *gimple_build_omp_sections:            GIMPLE_OMP_SECTIONS.
!                                                              (line    8)
! * *gimple_build_omp_single:              GIMPLE_OMP_SINGLE.  (line    8)
! * *gimple_build_resx:                    GIMPLE_RESX.        (line    7)
! * *gimple_build_return:                  GIMPLE_RETURN.      (line    7)
! * *gimple_build_switch:                  GIMPLE_SWITCH.      (line    8)
! * *gimple_build_try:                     GIMPLE_TRY.         (line    8)
  * + in constraint:                       Modifiers.          (line   12)
  * -fsection-anchors <1>:                 Anchored Addresses. (line    6)
- * -fsection-anchors:                     Special Accessors.  (line  120)
  * /c in RTL dump:                        Flags.              (line  221)
  * /f in RTL dump:                        Flags.              (line  229)
  * /i in RTL dump:                        Flags.              (line  274)
--- 43520,43566 ----
  * % in GTY option:                       GTY Options.        (line   18)
  * % in template:                         Output Template.    (line    6)
  * & in constraint:                       Modifiers.          (line   25)
! * (gimple_stmt_iterator:                 GIMPLE API.         (line   30)
  * (nil):                                 RTL Objects.        (line   73)
  * * in constraint:                       Modifiers.          (line   83)
  * * in template:                         Output Statement.   (line   29)
! * *gimple_build_asm_vec:                 GIMPLE_ASM.         (line    6)
! * *gimple_build_assign:                  GIMPLE_ASSIGN.      (line    6)
! * *gimple_build_assign <1>:              GIMPLE_ASSIGN.      (line   18)
! * *gimple_build_assign <2>:              GIMPLE_ASSIGN.      (line   29)
! * *gimple_build_assign <3>:              GIMPLE_ASSIGN.      (line   35)
! * *gimple_build_bind:                    GIMPLE_BIND.        (line    6)
! * *gimple_build_call:                    GIMPLE_CALL.        (line    6)
! * *gimple_build_call_from_tree:          GIMPLE_CALL.        (line   15)
! * *gimple_build_call_vec:                GIMPLE_CALL.        (line   23)
! * *gimple_build_catch:                   GIMPLE_CATCH.       (line    6)
! * *gimple_build_cond:                    GIMPLE_COND.        (line    6)
! * *gimple_build_cond_from_tree:          GIMPLE_COND.        (line   14)
! * *gimple_build_debug_bind:              GIMPLE_DEBUG.       (line    6)
! * *gimple_build_eh_filter:               GIMPLE_EH_FILTER.   (line    6)
! * *gimple_build_goto:                    GIMPLE_GOTO.        (line    6)
! * *gimple_build_label:                   GIMPLE_LABEL.       (line    6)
  * *gimple_build_omp_atomic_load:         GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line    6)
  * *gimple_build_omp_atomic_store:        GIMPLE_OMP_ATOMIC_STORE.
!                                                              (line    6)
  * *gimple_build_omp_continue:            GIMPLE_OMP_CONTINUE.
!                                                              (line    6)
  * *gimple_build_omp_critical:            GIMPLE_OMP_CRITICAL.
!                                                              (line    6)
! * *gimple_build_omp_for:                 GIMPLE_OMP_FOR.     (line    6)
  * *gimple_build_omp_parallel:            GIMPLE_OMP_PARALLEL.
!                                                              (line    6)
  * *gimple_build_omp_sections:            GIMPLE_OMP_SECTIONS.
!                                                              (line    6)
! * *gimple_build_omp_single:              GIMPLE_OMP_SINGLE.  (line    6)
! * *gimple_build_resx:                    GIMPLE_RESX.        (line    6)
! * *gimple_build_return:                  GIMPLE_RETURN.      (line    6)
! * *gimple_build_switch:                  GIMPLE_SWITCH.      (line    6)
! * *gimple_build_try:                     GIMPLE_TRY.         (line    6)
  * + in constraint:                       Modifiers.          (line   12)
+ * -fsection-anchors:                     Special Accessors.  (line  117)
  * -fsection-anchors <1>:                 Anchored Addresses. (line    6)
  * /c in RTL dump:                        Flags.              (line  221)
  * /f in RTL dump:                        Flags.              (line  229)
  * /i in RTL dump:                        Flags.              (line  274)
*************** Concept Index
*** 44025,47548 ****
  * /s in RTL dump:                        Flags.              (line  245)
  * /u in RTL dump:                        Flags.              (line  296)
  * /v in RTL dump:                        Flags.              (line  328)
! * 0 in constraint:                       Simple Constraints. (line  130)
! * < in constraint:                       Simple Constraints. (line   48)
  * = in constraint:                       Modifiers.          (line    8)
! * > in constraint:                       Simple Constraints. (line   61)
  * ? in constraint:                       Multi-Alternative.  (line   41)
  * \:                                     Output Template.    (line   46)
  * ^ in constraint:                       Multi-Alternative.  (line   52)
  * __absvdi2:                             Integer library routines.
-                                                              (line  107)
- * __absvsi2:                             Integer library routines.
                                                               (line  106)
  * __addda3:                              Fixed-point fractional library routines.
!                                                              (line   45)
  * __adddf3:                              Soft float library routines.
!                                                              (line   23)
  * __adddq3:                              Fixed-point fractional library routines.
!                                                              (line   33)
  * __addha3:                              Fixed-point fractional library routines.
!                                                              (line   43)
  * __addhq3:                              Fixed-point fractional library routines.
!                                                              (line   30)
  * __addqq3:                              Fixed-point fractional library routines.
!                                                              (line   29)
  * __addsa3:                              Fixed-point fractional library routines.
!                                                              (line   44)
  * __addsf3:                              Soft float library routines.
!                                                              (line   22)
  * __addsq3:                              Fixed-point fractional library routines.
!                                                              (line   31)
  * __addta3:                              Fixed-point fractional library routines.
!                                                              (line   47)
  * __addtf3:                              Soft float library routines.
!                                                              (line   25)
  * __adduda3:                             Fixed-point fractional library routines.
!                                                              (line   53)
  * __addudq3:                             Fixed-point fractional library routines.
!                                                              (line   41)
  * __adduha3:                             Fixed-point fractional library routines.
!                                                              (line   49)
  * __adduhq3:                             Fixed-point fractional library routines.
!                                                              (line   37)
  * __adduqq3:                             Fixed-point fractional library routines.
!                                                              (line   35)
  * __addusa3:                             Fixed-point fractional library routines.
!                                                              (line   51)
  * __addusq3:                             Fixed-point fractional library routines.
!                                                              (line   39)
  * __adduta3:                             Fixed-point fractional library routines.
!                                                              (line   55)
  * __addvdi3:                             Integer library routines.
-                                                              (line  111)
- * __addvsi3:                             Integer library routines.
                                                               (line  110)
  * __addxf3:                              Soft float library routines.
!                                                              (line   27)
  * __ashlda3:                             Fixed-point fractional library routines.
!                                                              (line  351)
  * __ashldi3:                             Integer library routines.
!                                                              (line   14)
  * __ashldq3:                             Fixed-point fractional library routines.
!                                                              (line  340)
  * __ashlha3:                             Fixed-point fractional library routines.
!                                                              (line  349)
  * __ashlhq3:                             Fixed-point fractional library routines.
!                                                              (line  337)
  * __ashlqq3:                             Fixed-point fractional library routines.
!                                                              (line  336)
  * __ashlsa3:                             Fixed-point fractional library routines.
!                                                              (line  350)
  * __ashlsi3:                             Integer library routines.
!                                                              (line   13)
  * __ashlsq3:                             Fixed-point fractional library routines.
!                                                              (line  338)
  * __ashlta3:                             Fixed-point fractional library routines.
!                                                              (line  353)
  * __ashlti3:                             Integer library routines.
!                                                              (line   15)
  * __ashluda3:                            Fixed-point fractional library routines.
!                                                              (line  359)
  * __ashludq3:                            Fixed-point fractional library routines.
!                                                              (line  348)
  * __ashluha3:                            Fixed-point fractional library routines.
!                                                              (line  355)
  * __ashluhq3:                            Fixed-point fractional library routines.
!                                                              (line  344)
  * __ashluqq3:                            Fixed-point fractional library routines.
!                                                              (line  342)
  * __ashlusa3:                            Fixed-point fractional library routines.
!                                                              (line  357)
  * __ashlusq3:                            Fixed-point fractional library routines.
!                                                              (line  346)
  * __ashluta3:                            Fixed-point fractional library routines.
!                                                              (line  361)
  * __ashrda3:                             Fixed-point fractional library routines.
!                                                              (line  371)
  * __ashrdi3:                             Integer library routines.
!                                                              (line   19)
  * __ashrdq3:                             Fixed-point fractional library routines.
!                                                              (line  368)
  * __ashrha3:                             Fixed-point fractional library routines.
!                                                              (line  369)
  * __ashrhq3:                             Fixed-point fractional library routines.
!                                                              (line  365)
  * __ashrqq3:                             Fixed-point fractional library routines.
!                                                              (line  364)
  * __ashrsa3:                             Fixed-point fractional library routines.
!                                                              (line  370)
  * __ashrsi3:                             Integer library routines.
!                                                              (line   18)
  * __ashrsq3:                             Fixed-point fractional library routines.
-                                                              (line  366)
- * __ashrta3:                             Fixed-point fractional library routines.
                                                               (line  373)
  * __ashrti3:                             Integer library routines.
!                                                              (line   20)
  * __bid_adddd3:                          Decimal float library routines.
!                                                              (line   25)
  * __bid_addsd3:                          Decimal float library routines.
!                                                              (line   21)
  * __bid_addtd3:                          Decimal float library routines.
!                                                              (line   29)
  * __bid_divdd3:                          Decimal float library routines.
!                                                              (line   68)
  * __bid_divsd3:                          Decimal float library routines.
!                                                              (line   64)
  * __bid_divtd3:                          Decimal float library routines.
!                                                              (line   72)
  * __bid_eqdd2:                           Decimal float library routines.
!                                                              (line  259)
  * __bid_eqsd2:                           Decimal float library routines.
!                                                              (line  257)
  * __bid_eqtd2:                           Decimal float library routines.
!                                                              (line  261)
  * __bid_extendddtd2:                     Decimal float library routines.
!                                                              (line   92)
  * __bid_extendddtf:                      Decimal float library routines.
!                                                              (line  140)
  * __bid_extendddxf:                      Decimal float library routines.
!                                                              (line  134)
  * __bid_extenddfdd:                      Decimal float library routines.
!                                                              (line  147)
  * __bid_extenddftd:                      Decimal float library routines.
!                                                              (line  107)
  * __bid_extendsddd2:                     Decimal float library routines.
!                                                              (line   88)
  * __bid_extendsddf:                      Decimal float library routines.
!                                                              (line  128)
  * __bid_extendsdtd2:                     Decimal float library routines.
!                                                              (line   90)
  * __bid_extendsdtf:                      Decimal float library routines.
!                                                              (line  138)
  * __bid_extendsdxf:                      Decimal float library routines.
!                                                              (line  132)
  * __bid_extendsfdd:                      Decimal float library routines.
!                                                              (line  103)
  * __bid_extendsfsd:                      Decimal float library routines.
!                                                              (line  145)
  * __bid_extendsftd:                      Decimal float library routines.
!                                                              (line  105)
  * __bid_extendtftd:                      Decimal float library routines.
!                                                              (line  149)
  * __bid_extendxftd:                      Decimal float library routines.
!                                                              (line  109)
  * __bid_fixdddi:                         Decimal float library routines.
!                                                              (line  170)
  * __bid_fixddsi:                         Decimal float library routines.
!                                                              (line  162)
  * __bid_fixsddi:                         Decimal float library routines.
!                                                              (line  168)
  * __bid_fixsdsi:                         Decimal float library routines.
!                                                              (line  160)
  * __bid_fixtddi:                         Decimal float library routines.
!                                                              (line  172)
  * __bid_fixtdsi:                         Decimal float library routines.
!                                                              (line  164)
  * __bid_fixunsdddi:                      Decimal float library routines.
!                                                              (line  187)
  * __bid_fixunsddsi:                      Decimal float library routines.
!                                                              (line  178)
  * __bid_fixunssddi:                      Decimal float library routines.
!                                                              (line  185)
  * __bid_fixunssdsi:                      Decimal float library routines.
!                                                              (line  176)
  * __bid_fixunstddi:                      Decimal float library routines.
!                                                              (line  189)
  * __bid_fixunstdsi:                      Decimal float library routines.
!                                                              (line  180)
  * __bid_floatdidd:                       Decimal float library routines.
!                                                              (line  205)
  * __bid_floatdisd:                       Decimal float library routines.
!                                                              (line  203)
  * __bid_floatditd:                       Decimal float library routines.
!                                                              (line  207)
  * __bid_floatsidd:                       Decimal float library routines.
!                                                              (line  196)
  * __bid_floatsisd:                       Decimal float library routines.
!                                                              (line  194)
  * __bid_floatsitd:                       Decimal float library routines.
!                                                              (line  198)
  * __bid_floatunsdidd:                    Decimal float library routines.
!                                                              (line  223)
  * __bid_floatunsdisd:                    Decimal float library routines.
!                                                              (line  221)
  * __bid_floatunsditd:                    Decimal float library routines.
!                                                              (line  225)
  * __bid_floatunssidd:                    Decimal float library routines.
!                                                              (line  214)
  * __bid_floatunssisd:                    Decimal float library routines.
!                                                              (line  212)
  * __bid_floatunssitd:                    Decimal float library routines.
!                                                              (line  216)
  * __bid_gedd2:                           Decimal float library routines.
!                                                              (line  277)
  * __bid_gesd2:                           Decimal float library routines.
!                                                              (line  275)
  * __bid_getd2:                           Decimal float library routines.
!                                                              (line  279)
  * __bid_gtdd2:                           Decimal float library routines.
!                                                              (line  304)
  * __bid_gtsd2:                           Decimal float library routines.
!                                                              (line  302)
  * __bid_gttd2:                           Decimal float library routines.
!                                                              (line  306)
  * __bid_ledd2:                           Decimal float library routines.
!                                                              (line  295)
  * __bid_lesd2:                           Decimal float library routines.
!                                                              (line  293)
  * __bid_letd2:                           Decimal float library routines.
!                                                              (line  297)
  * __bid_ltdd2:                           Decimal float library routines.
!                                                              (line  286)
  * __bid_ltsd2:                           Decimal float library routines.
!                                                              (line  284)
  * __bid_lttd2:                           Decimal float library routines.
!                                                              (line  288)
  * __bid_muldd3:                          Decimal float library routines.
!                                                              (line   54)
  * __bid_mulsd3:                          Decimal float library routines.
!                                                              (line   50)
  * __bid_multd3:                          Decimal float library routines.
!                                                              (line   58)
  * __bid_nedd2:                           Decimal float library routines.
!                                                              (line  268)
  * __bid_negdd2:                          Decimal float library routines.
!                                                              (line   78)
  * __bid_negsd2:                          Decimal float library routines.
!                                                              (line   76)
  * __bid_negtd2:                          Decimal float library routines.
!                                                              (line   80)
  * __bid_nesd2:                           Decimal float library routines.
!                                                              (line  266)
  * __bid_netd2:                           Decimal float library routines.
!                                                              (line  270)
  * __bid_subdd3:                          Decimal float library routines.
!                                                              (line   39)
  * __bid_subsd3:                          Decimal float library routines.
!                                                              (line   35)
  * __bid_subtd3:                          Decimal float library routines.
!                                                              (line   43)
  * __bid_truncdddf:                       Decimal float library routines.
!                                                              (line  153)
  * __bid_truncddsd2:                      Decimal float library routines.
!                                                              (line   94)
  * __bid_truncddsf:                       Decimal float library routines.
!                                                              (line  124)
  * __bid_truncdfsd:                       Decimal float library routines.
!                                                              (line  111)
  * __bid_truncsdsf:                       Decimal float library routines.
!                                                              (line  151)
  * __bid_trunctddd2:                      Decimal float library routines.
!                                                              (line   98)
  * __bid_trunctddf:                       Decimal float library routines.
!                                                              (line  130)
  * __bid_trunctdsd2:                      Decimal float library routines.
!                                                              (line   96)
  * __bid_trunctdsf:                       Decimal float library routines.
!                                                              (line  126)
  * __bid_trunctdtf:                       Decimal float library routines.
!                                                              (line  155)
  * __bid_trunctdxf:                       Decimal float library routines.
!                                                              (line  136)
  * __bid_trunctfdd:                       Decimal float library routines.
!                                                              (line  119)
  * __bid_trunctfsd:                       Decimal float library routines.
!                                                              (line  115)
  * __bid_truncxfdd:                       Decimal float library routines.
!                                                              (line  117)
  * __bid_truncxfsd:                       Decimal float library routines.
!                                                              (line  113)
  * __bid_unorddd2:                        Decimal float library routines.
!                                                              (line  235)
  * __bid_unordsd2:                        Decimal float library routines.
!                                                              (line  233)
  * __bid_unordtd2:                        Decimal float library routines.
!                                                              (line  237)
  * __bswapdi2:                            Integer library routines.
-                                                              (line  162)
- * __bswapsi2:                            Integer library routines.
                                                               (line  161)
! * __builtin_classify_type:               Varargs.            (line   51)
! * __builtin_next_arg:                    Varargs.            (line   42)
! * __builtin_saveregs:                    Varargs.            (line   24)
! * __chkp_bndcl:                          Misc.               (line  651)
! * __chkp_bndcu:                          Misc.               (line  657)
! * __chkp_bndldx:                         Misc.               (line  645)
! * __chkp_bndmk:                          Misc.               (line  632)
! * __chkp_bndret:                         Misc.               (line  662)
! * __chkp_bndstx:                         Misc.               (line  639)
! * __chkp_intersect:                      Misc.               (line  669)
! * __chkp_narrow:                         Misc.               (line  674)
! * __chkp_sizeof:                         Misc.               (line  679)
  * __clear_cache:                         Miscellaneous routines.
!                                                              (line   10)
  * __clzdi2:                              Integer library routines.
-                                                              (line  131)
- * __clzsi2:                              Integer library routines.
                                                               (line  130)
  * __clzti2:                              Integer library routines.
!                                                              (line  132)
  * __cmpda2:                              Fixed-point fractional library routines.
!                                                              (line  451)
  * __cmpdf2:                              Soft float library routines.
!                                                              (line  164)
  * __cmpdi2:                              Integer library routines.
!                                                              (line   87)
  * __cmpdq2:                              Fixed-point fractional library routines.
!                                                              (line  441)
  * __cmpha2:                              Fixed-point fractional library routines.
!                                                              (line  449)
  * __cmphq2:                              Fixed-point fractional library routines.
!                                                              (line  438)
  * __cmpqq2:                              Fixed-point fractional library routines.
!                                                              (line  437)
  * __cmpsa2:                              Fixed-point fractional library routines.
!                                                              (line  450)
  * __cmpsf2:                              Soft float library routines.
!                                                              (line  163)
  * __cmpsq2:                              Fixed-point fractional library routines.
!                                                              (line  439)
  * __cmpta2:                              Fixed-point fractional library routines.
!                                                              (line  453)
  * __cmptf2:                              Soft float library routines.
!                                                              (line  165)
  * __cmpti2:                              Integer library routines.
!                                                              (line   88)
  * __cmpuda2:                             Fixed-point fractional library routines.
!                                                              (line  458)
  * __cmpudq2:                             Fixed-point fractional library routines.
!                                                              (line  448)
  * __cmpuha2:                             Fixed-point fractional library routines.
!                                                              (line  455)
  * __cmpuhq2:                             Fixed-point fractional library routines.
!                                                              (line  444)
  * __cmpuqq2:                             Fixed-point fractional library routines.
!                                                              (line  443)
  * __cmpusa2:                             Fixed-point fractional library routines.
!                                                              (line  456)
  * __cmpusq2:                             Fixed-point fractional library routines.
!                                                              (line  446)
  * __cmputa2:                             Fixed-point fractional library routines.
!                                                              (line  460)
  * __CTOR_LIST__:                         Initialization.     (line   25)
  * __ctzdi2:                              Integer library routines.
-                                                              (line  138)
- * __ctzsi2:                              Integer library routines.
                                                               (line  137)
  * __ctzti2:                              Integer library routines.
!                                                              (line  139)
  * __divda3:                              Fixed-point fractional library routines.
!                                                              (line  227)
  * __divdc3:                              Soft float library routines.
!                                                              (line  252)
  * __divdf3:                              Soft float library routines.
!                                                              (line   48)
  * __divdi3:                              Integer library routines.
!                                                              (line   25)
  * __divdq3:                              Fixed-point fractional library routines.
!                                                              (line  223)
  * __divha3:                              Fixed-point fractional library routines.
!                                                              (line  225)
  * __divhq3:                              Fixed-point fractional library routines.
!                                                              (line  220)
  * __divqq3:                              Fixed-point fractional library routines.
!                                                              (line  219)
  * __divsa3:                              Fixed-point fractional library routines.
!                                                              (line  226)
  * __divsc3:                              Soft float library routines.
!                                                              (line  250)
  * __divsf3:                              Soft float library routines.
!                                                              (line   47)
  * __divsi3:                              Integer library routines.
!                                                              (line   24)
  * __divsq3:                              Fixed-point fractional library routines.
!                                                              (line  221)
  * __divta3:                              Fixed-point fractional library routines.
!                                                              (line  229)
  * __divtc3:                              Soft float library routines.
!                                                              (line  254)
  * __divtf3:                              Soft float library routines.
!                                                              (line   50)
  * __divti3:                              Integer library routines.
!                                                              (line   26)
  * __divxc3:                              Soft float library routines.
!                                                              (line  256)
  * __divxf3:                              Soft float library routines.
!                                                              (line   52)
  * __dpd_adddd3:                          Decimal float library routines.
!                                                              (line   23)
  * __dpd_addsd3:                          Decimal float library routines.
!                                                              (line   19)
  * __dpd_addtd3:                          Decimal float library routines.
!                                                              (line   27)
  * __dpd_divdd3:                          Decimal float library routines.
!                                                              (line   66)
  * __dpd_divsd3:                          Decimal float library routines.
!                                                              (line   62)
  * __dpd_divtd3:                          Decimal float library routines.
!                                                              (line   70)
  * __dpd_eqdd2:                           Decimal float library routines.
!                                                              (line  258)
  * __dpd_eqsd2:                           Decimal float library routines.
!                                                              (line  256)
  * __dpd_eqtd2:                           Decimal float library routines.
!                                                              (line  260)
  * __dpd_extendddtd2:                     Decimal float library routines.
!                                                              (line   91)
  * __dpd_extendddtf:                      Decimal float library routines.
!                                                              (line  139)
  * __dpd_extendddxf:                      Decimal float library routines.
!                                                              (line  133)
  * __dpd_extenddfdd:                      Decimal float library routines.
!                                                              (line  146)
  * __dpd_extenddftd:                      Decimal float library routines.
!                                                              (line  106)
  * __dpd_extendsddd2:                     Decimal float library routines.
!                                                              (line   87)
  * __dpd_extendsddf:                      Decimal float library routines.
!                                                              (line  127)
  * __dpd_extendsdtd2:                     Decimal float library routines.
!                                                              (line   89)
  * __dpd_extendsdtf:                      Decimal float library routines.
!                                                              (line  137)
  * __dpd_extendsdxf:                      Decimal float library routines.
!                                                              (line  131)
  * __dpd_extendsfdd:                      Decimal float library routines.
!                                                              (line  102)
  * __dpd_extendsfsd:                      Decimal float library routines.
!                                                              (line  144)
  * __dpd_extendsftd:                      Decimal float library routines.
!                                                              (line  104)
  * __dpd_extendtftd:                      Decimal float library routines.
!                                                              (line  148)
  * __dpd_extendxftd:                      Decimal float library routines.
!                                                              (line  108)
  * __dpd_fixdddi:                         Decimal float library routines.
!                                                              (line  169)
  * __dpd_fixddsi:                         Decimal float library routines.
!                                                              (line  161)
  * __dpd_fixsddi:                         Decimal float library routines.
!                                                              (line  167)
  * __dpd_fixsdsi:                         Decimal float library routines.
!                                                              (line  159)
  * __dpd_fixtddi:                         Decimal float library routines.
!                                                              (line  171)
  * __dpd_fixtdsi:                         Decimal float library routines.
!                                                              (line  163)
  * __dpd_fixunsdddi:                      Decimal float library routines.
!                                                              (line  186)
  * __dpd_fixunsddsi:                      Decimal float library routines.
!                                                              (line  177)
  * __dpd_fixunssddi:                      Decimal float library routines.
!                                                              (line  184)
  * __dpd_fixunssdsi:                      Decimal float library routines.
!                                                              (line  175)
  * __dpd_fixunstddi:                      Decimal float library routines.
!                                                              (line  188)
  * __dpd_fixunstdsi:                      Decimal float library routines.
!                                                              (line  179)
  * __dpd_floatdidd:                       Decimal float library routines.
!                                                              (line  204)
  * __dpd_floatdisd:                       Decimal float library routines.
!                                                              (line  202)
  * __dpd_floatditd:                       Decimal float library routines.
!                                                              (line  206)
  * __dpd_floatsidd:                       Decimal float library routines.
!                                                              (line  195)
  * __dpd_floatsisd:                       Decimal float library routines.
!                                                              (line  193)
  * __dpd_floatsitd:                       Decimal float library routines.
!                                                              (line  197)
  * __dpd_floatunsdidd:                    Decimal float library routines.
!                                                              (line  222)
  * __dpd_floatunsdisd:                    Decimal float library routines.
!                                                              (line  220)
  * __dpd_floatunsditd:                    Decimal float library routines.
!                                                              (line  224)
  * __dpd_floatunssidd:                    Decimal float library routines.
!                                                              (line  213)
  * __dpd_floatunssisd:                    Decimal float library routines.
!                                                              (line  211)
  * __dpd_floatunssitd:                    Decimal float library routines.
!                                                              (line  215)
  * __dpd_gedd2:                           Decimal float library routines.
!                                                              (line  276)
  * __dpd_gesd2:                           Decimal float library routines.
!                                                              (line  274)
  * __dpd_getd2:                           Decimal float library routines.
!                                                              (line  278)
  * __dpd_gtdd2:                           Decimal float library routines.
!                                                              (line  303)
  * __dpd_gtsd2:                           Decimal float library routines.
!                                                              (line  301)
  * __dpd_gttd2:                           Decimal float library routines.
!                                                              (line  305)
  * __dpd_ledd2:                           Decimal float library routines.
!                                                              (line  294)
  * __dpd_lesd2:                           Decimal float library routines.
!                                                              (line  292)
  * __dpd_letd2:                           Decimal float library routines.
!                                                              (line  296)
  * __dpd_ltdd2:                           Decimal float library routines.
!                                                              (line  285)
  * __dpd_ltsd2:                           Decimal float library routines.
!                                                              (line  283)
  * __dpd_lttd2:                           Decimal float library routines.
!                                                              (line  287)
  * __dpd_muldd3:                          Decimal float library routines.
!                                                              (line   52)
  * __dpd_mulsd3:                          Decimal float library routines.
!                                                              (line   48)
  * __dpd_multd3:                          Decimal float library routines.
!                                                              (line   56)
  * __dpd_nedd2:                           Decimal float library routines.
!                                                              (line  267)
  * __dpd_negdd2:                          Decimal float library routines.
!                                                              (line   77)
  * __dpd_negsd2:                          Decimal float library routines.
!                                                              (line   75)
  * __dpd_negtd2:                          Decimal float library routines.
!                                                              (line   79)
  * __dpd_nesd2:                           Decimal float library routines.
!                                                              (line  265)
  * __dpd_netd2:                           Decimal float library routines.
!                                                              (line  269)
  * __dpd_subdd3:                          Decimal float library routines.
!                                                              (line   37)
  * __dpd_subsd3:                          Decimal float library routines.
!                                                              (line   33)
  * __dpd_subtd3:                          Decimal float library routines.
!                                                              (line   41)
  * __dpd_truncdddf:                       Decimal float library routines.
!                                                              (line  152)
  * __dpd_truncddsd2:                      Decimal float library routines.
!                                                              (line   93)
  * __dpd_truncddsf:                       Decimal float library routines.
!                                                              (line  123)
  * __dpd_truncdfsd:                       Decimal float library routines.
!                                                              (line  110)
  * __dpd_truncsdsf:                       Decimal float library routines.
!                                                              (line  150)
  * __dpd_trunctddd2:                      Decimal float library routines.
!                                                              (line   97)
  * __dpd_trunctddf:                       Decimal float library routines.
!                                                              (line  129)
  * __dpd_trunctdsd2:                      Decimal float library routines.
!                                                              (line   95)
  * __dpd_trunctdsf:                       Decimal float library routines.
!                                                              (line  125)
  * __dpd_trunctdtf:                       Decimal float library routines.
!                                                              (line  154)
  * __dpd_trunctdxf:                       Decimal float library routines.
!                                                              (line  135)
  * __dpd_trunctfdd:                       Decimal float library routines.
!                                                              (line  118)
  * __dpd_trunctfsd:                       Decimal float library routines.
!                                                              (line  114)
  * __dpd_truncxfdd:                       Decimal float library routines.
!                                                              (line  116)
  * __dpd_truncxfsd:                       Decimal float library routines.
!                                                              (line  112)
  * __dpd_unorddd2:                        Decimal float library routines.
!                                                              (line  234)
  * __dpd_unordsd2:                        Decimal float library routines.
!                                                              (line  232)
  * __dpd_unordtd2:                        Decimal float library routines.
!                                                              (line  236)
  * __DTOR_LIST__:                         Initialization.     (line   25)
  * __eqdf2:                               Soft float library routines.
-                                                              (line  194)
- * __eqsf2:                               Soft float library routines.
                                                               (line  193)
  * __eqtf2:                               Soft float library routines.
!                                                              (line  195)
  * __extenddftf2:                         Soft float library routines.
!                                                              (line   68)
  * __extenddfxf2:                         Soft float library routines.
!                                                              (line   69)
  * __extendsfdf2:                         Soft float library routines.
!                                                              (line   65)
  * __extendsftf2:                         Soft float library routines.
!                                                              (line   66)
  * __extendsfxf2:                         Soft float library routines.
!                                                              (line   67)
  * __ffsdi2:                              Integer library routines.
!                                                              (line  144)
  * __ffsti2:                              Integer library routines.
!                                                              (line  145)
  * __fixdfdi:                             Soft float library routines.
!                                                              (line   88)
  * __fixdfsi:                             Soft float library routines.
!                                                              (line   81)
  * __fixdfti:                             Soft float library routines.
!                                                              (line   94)
  * __fixsfdi:                             Soft float library routines.
!                                                              (line   87)
  * __fixsfsi:                             Soft float library routines.
!                                                              (line   80)
  * __fixsfti:                             Soft float library routines.
!                                                              (line   93)
  * __fixtfdi:                             Soft float library routines.
!                                                              (line   89)
  * __fixtfsi:                             Soft float library routines.
!                                                              (line   82)
  * __fixtfti:                             Soft float library routines.
!                                                              (line   95)
  * __fixunsdfdi:                          Soft float library routines.
!                                                              (line  108)
  * __fixunsdfsi:                          Soft float library routines.
!                                                              (line  101)
  * __fixunsdfti:                          Soft float library routines.
!                                                              (line  115)
  * __fixunssfdi:                          Soft float library routines.
!                                                              (line  107)
  * __fixunssfsi:                          Soft float library routines.
!                                                              (line  100)
  * __fixunssfti:                          Soft float library routines.
!                                                              (line  114)
  * __fixunstfdi:                          Soft float library routines.
!                                                              (line  109)
  * __fixunstfsi:                          Soft float library routines.
!                                                              (line  102)
  * __fixunstfti:                          Soft float library routines.
!                                                              (line  116)
  * __fixunsxfdi:                          Soft float library routines.
!                                                              (line  110)
  * __fixunsxfsi:                          Soft float library routines.
!                                                              (line  103)
  * __fixunsxfti:                          Soft float library routines.
!                                                              (line  117)
  * __fixxfdi:                             Soft float library routines.
!                                                              (line   90)
  * __fixxfsi:                             Soft float library routines.
!                                                              (line   83)
  * __fixxfti:                             Soft float library routines.
!                                                              (line   96)
  * __floatdidf:                           Soft float library routines.
-                                                              (line  128)
- * __floatdisf:                           Soft float library routines.
                                                               (line  127)
  * __floatditf:                           Soft float library routines.
!                                                              (line  129)
  * __floatdixf:                           Soft float library routines.
!                                                              (line  130)
  * __floatsidf:                           Soft float library routines.
-                                                              (line  122)
- * __floatsisf:                           Soft float library routines.
                                                               (line  121)
  * __floatsitf:                           Soft float library routines.
!                                                              (line  123)
  * __floatsixf:                           Soft float library routines.
!                                                              (line  124)
  * __floattidf:                           Soft float library routines.
-                                                              (line  134)
- * __floattisf:                           Soft float library routines.
                                                               (line  133)
  * __floattitf:                           Soft float library routines.
!                                                              (line  135)
  * __floattixf:                           Soft float library routines.
!                                                              (line  136)
  * __floatundidf:                         Soft float library routines.
-                                                              (line  146)
- * __floatundisf:                         Soft float library routines.
                                                               (line  145)
  * __floatunditf:                         Soft float library routines.
!                                                              (line  147)
  * __floatundixf:                         Soft float library routines.
!                                                              (line  148)
  * __floatunsidf:                         Soft float library routines.
-                                                              (line  140)
- * __floatunsisf:                         Soft float library routines.
                                                               (line  139)
  * __floatunsitf:                         Soft float library routines.
!                                                              (line  141)
  * __floatunsixf:                         Soft float library routines.
!                                                              (line  142)
  * __floatuntidf:                         Soft float library routines.
-                                                              (line  152)
- * __floatuntisf:                         Soft float library routines.
                                                               (line  151)
  * __floatuntitf:                         Soft float library routines.
!                                                              (line  153)
  * __floatuntixf:                         Soft float library routines.
!                                                              (line  154)
  * __fractdadf:                           Fixed-point fractional library routines.
!                                                              (line  636)
  * __fractdadi:                           Fixed-point fractional library routines.
!                                                              (line  633)
  * __fractdadq:                           Fixed-point fractional library routines.
!                                                              (line  616)
  * __fractdaha2:                          Fixed-point fractional library routines.
!                                                              (line  617)
  * __fractdahi:                           Fixed-point fractional library routines.
!                                                              (line  631)
  * __fractdahq:                           Fixed-point fractional library routines.
!                                                              (line  614)
  * __fractdaqi:                           Fixed-point fractional library routines.
!                                                              (line  630)
  * __fractdaqq:                           Fixed-point fractional library routines.
!                                                              (line  613)
  * __fractdasa2:                          Fixed-point fractional library routines.
!                                                              (line  618)
  * __fractdasf:                           Fixed-point fractional library routines.
!                                                              (line  635)
  * __fractdasi:                           Fixed-point fractional library routines.
!                                                              (line  632)
  * __fractdasq:                           Fixed-point fractional library routines.
!                                                              (line  615)
  * __fractdata2:                          Fixed-point fractional library routines.
!                                                              (line  619)
  * __fractdati:                           Fixed-point fractional library routines.
!                                                              (line  634)
  * __fractdauda:                          Fixed-point fractional library routines.
!                                                              (line  627)
  * __fractdaudq:                          Fixed-point fractional library routines.
!                                                              (line  624)
  * __fractdauha:                          Fixed-point fractional library routines.
!                                                              (line  625)
  * __fractdauhq:                          Fixed-point fractional library routines.
!                                                              (line  621)
  * __fractdauqq:                          Fixed-point fractional library routines.
!                                                              (line  620)
  * __fractdausa:                          Fixed-point fractional library routines.
!                                                              (line  626)
  * __fractdausq:                          Fixed-point fractional library routines.
-                                                              (line  622)
- * __fractdauta:                          Fixed-point fractional library routines.
                                                               (line  629)
  * __fractdfda:                           Fixed-point fractional library routines.
!                                                              (line 1025)
  * __fractdfdq:                           Fixed-point fractional library routines.
!                                                              (line 1022)
  * __fractdfha:                           Fixed-point fractional library routines.
!                                                              (line 1023)
  * __fractdfhq:                           Fixed-point fractional library routines.
!                                                              (line 1020)
  * __fractdfqq:                           Fixed-point fractional library routines.
!                                                              (line 1019)
  * __fractdfsa:                           Fixed-point fractional library routines.
!                                                              (line 1024)
  * __fractdfsq:                           Fixed-point fractional library routines.
!                                                              (line 1021)
  * __fractdfta:                           Fixed-point fractional library routines.
-                                                              (line 1026)
- * __fractdfuda:                          Fixed-point fractional library routines.
                                                               (line 1033)
  * __fractdfudq:                          Fixed-point fractional library routines.
!                                                              (line 1030)
  * __fractdfuha:                          Fixed-point fractional library routines.
!                                                              (line 1031)
  * __fractdfuhq:                          Fixed-point fractional library routines.
!                                                              (line 1028)
  * __fractdfuqq:                          Fixed-point fractional library routines.
!                                                              (line 1027)
  * __fractdfusa:                          Fixed-point fractional library routines.
!                                                              (line 1032)
  * __fractdfusq:                          Fixed-point fractional library routines.
!                                                              (line 1029)
  * __fractdfuta:                          Fixed-point fractional library routines.
!                                                              (line 1034)
  * __fractdida:                           Fixed-point fractional library routines.
!                                                              (line  975)
  * __fractdidq:                           Fixed-point fractional library routines.
!                                                              (line  972)
  * __fractdiha:                           Fixed-point fractional library routines.
!                                                              (line  973)
  * __fractdihq:                           Fixed-point fractional library routines.
!                                                              (line  970)
  * __fractdiqq:                           Fixed-point fractional library routines.
!                                                              (line  969)
  * __fractdisa:                           Fixed-point fractional library routines.
!                                                              (line  974)
  * __fractdisq:                           Fixed-point fractional library routines.
!                                                              (line  971)
  * __fractdita:                           Fixed-point fractional library routines.
-                                                              (line  976)
- * __fractdiuda:                          Fixed-point fractional library routines.
                                                               (line  983)
  * __fractdiudq:                          Fixed-point fractional library routines.
!                                                              (line  980)
  * __fractdiuha:                          Fixed-point fractional library routines.
!                                                              (line  981)
  * __fractdiuhq:                          Fixed-point fractional library routines.
!                                                              (line  978)
  * __fractdiuqq:                          Fixed-point fractional library routines.
!                                                              (line  977)
  * __fractdiusa:                          Fixed-point fractional library routines.
!                                                              (line  982)
  * __fractdiusq:                          Fixed-point fractional library routines.
!                                                              (line  979)
  * __fractdiuta:                          Fixed-point fractional library routines.
!                                                              (line  984)
  * __fractdqda:                           Fixed-point fractional library routines.
!                                                              (line  544)
  * __fractdqdf:                           Fixed-point fractional library routines.
!                                                              (line  566)
  * __fractdqdi:                           Fixed-point fractional library routines.
!                                                              (line  563)
  * __fractdqha:                           Fixed-point fractional library routines.
!                                                              (line  542)
  * __fractdqhi:                           Fixed-point fractional library routines.
!                                                              (line  561)
  * __fractdqhq2:                          Fixed-point fractional library routines.
!                                                              (line  540)
  * __fractdqqi:                           Fixed-point fractional library routines.
!                                                              (line  560)
  * __fractdqqq2:                          Fixed-point fractional library routines.
!                                                              (line  539)
  * __fractdqsa:                           Fixed-point fractional library routines.
!                                                              (line  543)
  * __fractdqsf:                           Fixed-point fractional library routines.
!                                                              (line  565)
  * __fractdqsi:                           Fixed-point fractional library routines.
!                                                              (line  562)
  * __fractdqsq2:                          Fixed-point fractional library routines.
!                                                              (line  541)
  * __fractdqta:                           Fixed-point fractional library routines.
!                                                              (line  545)
  * __fractdqti:                           Fixed-point fractional library routines.
!                                                              (line  564)
  * __fractdquda:                          Fixed-point fractional library routines.
!                                                              (line  557)
  * __fractdqudq:                          Fixed-point fractional library routines.
!                                                              (line  552)
  * __fractdquha:                          Fixed-point fractional library routines.
!                                                              (line  554)
  * __fractdquhq:                          Fixed-point fractional library routines.
!                                                              (line  548)
  * __fractdquqq:                          Fixed-point fractional library routines.
!                                                              (line  547)
  * __fractdqusa:                          Fixed-point fractional library routines.
!                                                              (line  555)
  * __fractdqusq:                          Fixed-point fractional library routines.
!                                                              (line  550)
  * __fractdquta:                          Fixed-point fractional library routines.
!                                                              (line  559)
  * __fracthada2:                          Fixed-point fractional library routines.
!                                                              (line  572)
  * __fracthadf:                           Fixed-point fractional library routines.
!                                                              (line  590)
  * __fracthadi:                           Fixed-point fractional library routines.
!                                                              (line  587)
  * __fracthadq:                           Fixed-point fractional library routines.
!                                                              (line  570)
  * __fracthahi:                           Fixed-point fractional library routines.
!                                                              (line  585)
  * __fracthahq:                           Fixed-point fractional library routines.
!                                                              (line  568)
  * __fracthaqi:                           Fixed-point fractional library routines.
!                                                              (line  584)
  * __fracthaqq:                           Fixed-point fractional library routines.
!                                                              (line  567)
  * __fracthasa2:                          Fixed-point fractional library routines.
!                                                              (line  571)
  * __fracthasf:                           Fixed-point fractional library routines.
!                                                              (line  589)
  * __fracthasi:                           Fixed-point fractional library routines.
!                                                              (line  586)
  * __fracthasq:                           Fixed-point fractional library routines.
!                                                              (line  569)
  * __fracthata2:                          Fixed-point fractional library routines.
!                                                              (line  573)
  * __fracthati:                           Fixed-point fractional library routines.
!                                                              (line  588)
  * __fracthauda:                          Fixed-point fractional library routines.
!                                                              (line  581)
  * __fracthaudq:                          Fixed-point fractional library routines.
!                                                              (line  578)
  * __fracthauha:                          Fixed-point fractional library routines.
!                                                              (line  579)
  * __fracthauhq:                          Fixed-point fractional library routines.
!                                                              (line  575)
  * __fracthauqq:                          Fixed-point fractional library routines.
!                                                              (line  574)
  * __fracthausa:                          Fixed-point fractional library routines.
!                                                              (line  580)
  * __fracthausq:                          Fixed-point fractional library routines.
-                                                              (line  576)
- * __fracthauta:                          Fixed-point fractional library routines.
                                                               (line  583)
  * __fracthida:                           Fixed-point fractional library routines.
!                                                              (line  943)
  * __fracthidq:                           Fixed-point fractional library routines.
!                                                              (line  940)
  * __fracthiha:                           Fixed-point fractional library routines.
!                                                              (line  941)
  * __fracthihq:                           Fixed-point fractional library routines.
!                                                              (line  938)
  * __fracthiqq:                           Fixed-point fractional library routines.
!                                                              (line  937)
  * __fracthisa:                           Fixed-point fractional library routines.
!                                                              (line  942)
  * __fracthisq:                           Fixed-point fractional library routines.
!                                                              (line  939)
  * __fracthita:                           Fixed-point fractional library routines.
-                                                              (line  944)
- * __fracthiuda:                          Fixed-point fractional library routines.
                                                               (line  951)
  * __fracthiudq:                          Fixed-point fractional library routines.
!                                                              (line  948)
  * __fracthiuha:                          Fixed-point fractional library routines.
!                                                              (line  949)
  * __fracthiuhq:                          Fixed-point fractional library routines.
!                                                              (line  946)
  * __fracthiuqq:                          Fixed-point fractional library routines.
!                                                              (line  945)
  * __fracthiusa:                          Fixed-point fractional library routines.
!                                                              (line  950)
  * __fracthiusq:                          Fixed-point fractional library routines.
!                                                              (line  947)
  * __fracthiuta:                          Fixed-point fractional library routines.
!                                                              (line  952)
  * __fracthqda:                           Fixed-point fractional library routines.
!                                                              (line  498)
  * __fracthqdf:                           Fixed-point fractional library routines.
!                                                              (line  514)
  * __fracthqdi:                           Fixed-point fractional library routines.
!                                                              (line  511)
  * __fracthqdq2:                          Fixed-point fractional library routines.
!                                                              (line  495)
  * __fracthqha:                           Fixed-point fractional library routines.
!                                                              (line  496)
  * __fracthqhi:                           Fixed-point fractional library routines.
!                                                              (line  509)
  * __fracthqqi:                           Fixed-point fractional library routines.
!                                                              (line  508)
  * __fracthqqq2:                          Fixed-point fractional library routines.
!                                                              (line  493)
  * __fracthqsa:                           Fixed-point fractional library routines.
!                                                              (line  497)
  * __fracthqsf:                           Fixed-point fractional library routines.
!                                                              (line  513)
  * __fracthqsi:                           Fixed-point fractional library routines.
!                                                              (line  510)
  * __fracthqsq2:                          Fixed-point fractional library routines.
!                                                              (line  494)
  * __fracthqta:                           Fixed-point fractional library routines.
!                                                              (line  499)
  * __fracthqti:                           Fixed-point fractional library routines.
!                                                              (line  512)
  * __fracthquda:                          Fixed-point fractional library routines.
!                                                              (line  506)
  * __fracthqudq:                          Fixed-point fractional library routines.
!                                                              (line  503)
  * __fracthquha:                          Fixed-point fractional library routines.
!                                                              (line  504)
  * __fracthquhq:                          Fixed-point fractional library routines.
!                                                              (line  501)
  * __fracthquqq:                          Fixed-point fractional library routines.
!                                                              (line  500)
  * __fracthqusa:                          Fixed-point fractional library routines.
!                                                              (line  505)
  * __fracthqusq:                          Fixed-point fractional library routines.
!                                                              (line  502)
  * __fracthquta:                          Fixed-point fractional library routines.
!                                                              (line  507)
  * __fractqida:                           Fixed-point fractional library routines.
!                                                              (line  925)
  * __fractqidq:                           Fixed-point fractional library routines.
!                                                              (line  922)
  * __fractqiha:                           Fixed-point fractional library routines.
!                                                              (line  923)
  * __fractqihq:                           Fixed-point fractional library routines.
!                                                              (line  920)
  * __fractqiqq:                           Fixed-point fractional library routines.
!                                                              (line  919)
  * __fractqisa:                           Fixed-point fractional library routines.
!                                                              (line  924)
  * __fractqisq:                           Fixed-point fractional library routines.
!                                                              (line  921)
  * __fractqita:                           Fixed-point fractional library routines.
!                                                              (line  926)
  * __fractqiuda:                          Fixed-point fractional library routines.
!                                                              (line  934)
  * __fractqiudq:                          Fixed-point fractional library routines.
!                                                              (line  931)
  * __fractqiuha:                          Fixed-point fractional library routines.
!                                                              (line  932)
  * __fractqiuhq:                          Fixed-point fractional library routines.
!                                                              (line  928)
  * __fractqiuqq:                          Fixed-point fractional library routines.
!                                                              (line  927)
  * __fractqiusa:                          Fixed-point fractional library routines.
!                                                              (line  933)
  * __fractqiusq:                          Fixed-point fractional library routines.
-                                                              (line  929)
- * __fractqiuta:                          Fixed-point fractional library routines.
                                                               (line  936)
  * __fractqqda:                           Fixed-point fractional library routines.
!                                                              (line  474)
  * __fractqqdf:                           Fixed-point fractional library routines.
!                                                              (line  492)
  * __fractqqdi:                           Fixed-point fractional library routines.
!                                                              (line  489)
  * __fractqqdq2:                          Fixed-point fractional library routines.
!                                                              (line  471)
  * __fractqqha:                           Fixed-point fractional library routines.
!                                                              (line  472)
  * __fractqqhi:                           Fixed-point fractional library routines.
!                                                              (line  487)
  * __fractqqhq2:                          Fixed-point fractional library routines.
!                                                              (line  469)
  * __fractqqqi:                           Fixed-point fractional library routines.
!                                                              (line  486)
  * __fractqqsa:                           Fixed-point fractional library routines.
!                                                              (line  473)
  * __fractqqsf:                           Fixed-point fractional library routines.
!                                                              (line  491)
  * __fractqqsi:                           Fixed-point fractional library routines.
!                                                              (line  488)
  * __fractqqsq2:                          Fixed-point fractional library routines.
!                                                              (line  470)
  * __fractqqta:                           Fixed-point fractional library routines.
!                                                              (line  475)
  * __fractqqti:                           Fixed-point fractional library routines.
!                                                              (line  490)
  * __fractqquda:                          Fixed-point fractional library routines.
!                                                              (line  483)
  * __fractqqudq:                          Fixed-point fractional library routines.
!                                                              (line  480)
  * __fractqquha:                          Fixed-point fractional library routines.
!                                                              (line  481)
  * __fractqquhq:                          Fixed-point fractional library routines.
!                                                              (line  477)
  * __fractqquqq:                          Fixed-point fractional library routines.
!                                                              (line  476)
  * __fractqqusa:                          Fixed-point fractional library routines.
!                                                              (line  482)
  * __fractqqusq:                          Fixed-point fractional library routines.
-                                                              (line  478)
- * __fractqquta:                          Fixed-point fractional library routines.
                                                               (line  485)
  * __fractsada2:                          Fixed-point fractional library routines.
!                                                              (line  596)
  * __fractsadf:                           Fixed-point fractional library routines.
!                                                              (line  612)
  * __fractsadi:                           Fixed-point fractional library routines.
!                                                              (line  609)
  * __fractsadq:                           Fixed-point fractional library routines.
!                                                              (line  594)
  * __fractsaha2:                          Fixed-point fractional library routines.
!                                                              (line  595)
  * __fractsahi:                           Fixed-point fractional library routines.
!                                                              (line  607)
  * __fractsahq:                           Fixed-point fractional library routines.
!                                                              (line  592)
  * __fractsaqi:                           Fixed-point fractional library routines.
!                                                              (line  606)
  * __fractsaqq:                           Fixed-point fractional library routines.
!                                                              (line  591)
  * __fractsasf:                           Fixed-point fractional library routines.
!                                                              (line  611)
  * __fractsasi:                           Fixed-point fractional library routines.
!                                                              (line  608)
  * __fractsasq:                           Fixed-point fractional library routines.
!                                                              (line  593)
  * __fractsata2:                          Fixed-point fractional library routines.
!                                                              (line  597)
  * __fractsati:                           Fixed-point fractional library routines.
!                                                              (line  610)
  * __fractsauda:                          Fixed-point fractional library routines.
!                                                              (line  604)
  * __fractsaudq:                          Fixed-point fractional library routines.
!                                                              (line  601)
  * __fractsauha:                          Fixed-point fractional library routines.
!                                                              (line  602)
  * __fractsauhq:                          Fixed-point fractional library routines.
!                                                              (line  599)
  * __fractsauqq:                          Fixed-point fractional library routines.
!                                                              (line  598)
  * __fractsausa:                          Fixed-point fractional library routines.
!                                                              (line  603)
  * __fractsausq:                          Fixed-point fractional library routines.
!                                                              (line  600)
  * __fractsauta:                          Fixed-point fractional library routines.
!                                                              (line  605)
  * __fractsfda:                           Fixed-point fractional library routines.
!                                                              (line 1009)
  * __fractsfdq:                           Fixed-point fractional library routines.
!                                                              (line 1006)
  * __fractsfha:                           Fixed-point fractional library routines.
!                                                              (line 1007)
  * __fractsfhq:                           Fixed-point fractional library routines.
!                                                              (line 1004)
  * __fractsfqq:                           Fixed-point fractional library routines.
!                                                              (line 1003)
  * __fractsfsa:                           Fixed-point fractional library routines.
!                                                              (line 1008)
  * __fractsfsq:                           Fixed-point fractional library routines.
!                                                              (line 1005)
  * __fractsfta:                           Fixed-point fractional library routines.
-                                                              (line 1010)
- * __fractsfuda:                          Fixed-point fractional library routines.
                                                               (line 1017)
  * __fractsfudq:                          Fixed-point fractional library routines.
!                                                              (line 1014)
  * __fractsfuha:                          Fixed-point fractional library routines.
!                                                              (line 1015)
  * __fractsfuhq:                          Fixed-point fractional library routines.
!                                                              (line 1012)
  * __fractsfuqq:                          Fixed-point fractional library routines.
!                                                              (line 1011)
  * __fractsfusa:                          Fixed-point fractional library routines.
!                                                              (line 1016)
  * __fractsfusq:                          Fixed-point fractional library routines.
!                                                              (line 1013)
  * __fractsfuta:                          Fixed-point fractional library routines.
!                                                              (line 1018)
  * __fractsida:                           Fixed-point fractional library routines.
!                                                              (line  959)
  * __fractsidq:                           Fixed-point fractional library routines.
!                                                              (line  956)
  * __fractsiha:                           Fixed-point fractional library routines.
!                                                              (line  957)
  * __fractsihq:                           Fixed-point fractional library routines.
!                                                              (line  954)
  * __fractsiqq:                           Fixed-point fractional library routines.
!                                                              (line  953)
  * __fractsisa:                           Fixed-point fractional library routines.
!                                                              (line  958)
  * __fractsisq:                           Fixed-point fractional library routines.
!                                                              (line  955)
  * __fractsita:                           Fixed-point fractional library routines.
-                                                              (line  960)
- * __fractsiuda:                          Fixed-point fractional library routines.
                                                               (line  967)
  * __fractsiudq:                          Fixed-point fractional library routines.
!                                                              (line  964)
  * __fractsiuha:                          Fixed-point fractional library routines.
!                                                              (line  965)
  * __fractsiuhq:                          Fixed-point fractional library routines.
!                                                              (line  962)
  * __fractsiuqq:                          Fixed-point fractional library routines.
!                                                              (line  961)
  * __fractsiusa:                          Fixed-point fractional library routines.
!                                                              (line  966)
  * __fractsiusq:                          Fixed-point fractional library routines.
!                                                              (line  963)
  * __fractsiuta:                          Fixed-point fractional library routines.
!                                                              (line  968)
  * __fractsqda:                           Fixed-point fractional library routines.
!                                                              (line  520)
  * __fractsqdf:                           Fixed-point fractional library routines.
!                                                              (line  538)
  * __fractsqdi:                           Fixed-point fractional library routines.
!                                                              (line  535)
  * __fractsqdq2:                          Fixed-point fractional library routines.
!                                                              (line  517)
  * __fractsqha:                           Fixed-point fractional library routines.
!                                                              (line  518)
  * __fractsqhi:                           Fixed-point fractional library routines.
!                                                              (line  533)
  * __fractsqhq2:                          Fixed-point fractional library routines.
!                                                              (line  516)
  * __fractsqqi:                           Fixed-point fractional library routines.
!                                                              (line  532)
  * __fractsqqq2:                          Fixed-point fractional library routines.
!                                                              (line  515)
  * __fractsqsa:                           Fixed-point fractional library routines.
!                                                              (line  519)
  * __fractsqsf:                           Fixed-point fractional library routines.
!                                                              (line  537)
  * __fractsqsi:                           Fixed-point fractional library routines.
!                                                              (line  534)
  * __fractsqta:                           Fixed-point fractional library routines.
!                                                              (line  521)
  * __fractsqti:                           Fixed-point fractional library routines.
!                                                              (line  536)
  * __fractsquda:                          Fixed-point fractional library routines.
!                                                              (line  529)
  * __fractsqudq:                          Fixed-point fractional library routines.
!                                                              (line  526)
  * __fractsquha:                          Fixed-point fractional library routines.
!                                                              (line  527)
  * __fractsquhq:                          Fixed-point fractional library routines.
!                                                              (line  523)
  * __fractsquqq:                          Fixed-point fractional library routines.
!                                                              (line  522)
  * __fractsqusa:                          Fixed-point fractional library routines.
!                                                              (line  528)
  * __fractsqusq:                          Fixed-point fractional library routines.
-                                                              (line  524)
- * __fractsquta:                          Fixed-point fractional library routines.
                                                               (line  531)
  * __fracttada2:                          Fixed-point fractional library routines.
!                                                              (line  643)
  * __fracttadf:                           Fixed-point fractional library routines.
!                                                              (line  664)
  * __fracttadi:                           Fixed-point fractional library routines.
!                                                              (line  661)
  * __fracttadq:                           Fixed-point fractional library routines.
!                                                              (line  640)
  * __fracttaha2:                          Fixed-point fractional library routines.
!                                                              (line  641)
  * __fracttahi:                           Fixed-point fractional library routines.
!                                                              (line  659)
  * __fracttahq:                           Fixed-point fractional library routines.
!                                                              (line  638)
  * __fracttaqi:                           Fixed-point fractional library routines.
!                                                              (line  658)
  * __fracttaqq:                           Fixed-point fractional library routines.
!                                                              (line  637)
  * __fracttasa2:                          Fixed-point fractional library routines.
!                                                              (line  642)
  * __fracttasf:                           Fixed-point fractional library routines.
!                                                              (line  663)
  * __fracttasi:                           Fixed-point fractional library routines.
!                                                              (line  660)
  * __fracttasq:                           Fixed-point fractional library routines.
!                                                              (line  639)
  * __fracttati:                           Fixed-point fractional library routines.
!                                                              (line  662)
  * __fracttauda:                          Fixed-point fractional library routines.
!                                                              (line  655)
  * __fracttaudq:                          Fixed-point fractional library routines.
!                                                              (line  650)
  * __fracttauha:                          Fixed-point fractional library routines.
!                                                              (line  652)
  * __fracttauhq:                          Fixed-point fractional library routines.
!                                                              (line  646)
  * __fracttauqq:                          Fixed-point fractional library routines.
!                                                              (line  645)
  * __fracttausa:                          Fixed-point fractional library routines.
!                                                              (line  653)
  * __fracttausq:                          Fixed-point fractional library routines.
!                                                              (line  648)
  * __fracttauta:                          Fixed-point fractional library routines.
!                                                              (line  657)
  * __fracttida:                           Fixed-point fractional library routines.
!                                                              (line  991)
  * __fracttidq:                           Fixed-point fractional library routines.
!                                                              (line  988)
  * __fracttiha:                           Fixed-point fractional library routines.
!                                                              (line  989)
  * __fracttihq:                           Fixed-point fractional library routines.
!                                                              (line  986)
  * __fracttiqq:                           Fixed-point fractional library routines.
!                                                              (line  985)
  * __fracttisa:                           Fixed-point fractional library routines.
!                                                              (line  990)
  * __fracttisq:                           Fixed-point fractional library routines.
!                                                              (line  987)
  * __fracttita:                           Fixed-point fractional library routines.
!                                                              (line  992)
  * __fracttiuda:                          Fixed-point fractional library routines.
!                                                              (line 1000)
  * __fracttiudq:                          Fixed-point fractional library routines.
!                                                              (line  997)
  * __fracttiuha:                          Fixed-point fractional library routines.
!                                                              (line  998)
  * __fracttiuhq:                          Fixed-point fractional library routines.
!                                                              (line  994)
  * __fracttiuqq:                          Fixed-point fractional library routines.
!                                                              (line  993)
  * __fracttiusa:                          Fixed-point fractional library routines.
!                                                              (line  999)
  * __fracttiusq:                          Fixed-point fractional library routines.
-                                                              (line  995)
- * __fracttiuta:                          Fixed-point fractional library routines.
                                                               (line 1002)
  * __fractudada:                          Fixed-point fractional library routines.
!                                                              (line  858)
  * __fractudadf:                          Fixed-point fractional library routines.
!                                                              (line  881)
  * __fractudadi:                          Fixed-point fractional library routines.
!                                                              (line  878)
  * __fractudadq:                          Fixed-point fractional library routines.
!                                                              (line  855)
  * __fractudaha:                          Fixed-point fractional library routines.
!                                                              (line  856)
  * __fractudahi:                          Fixed-point fractional library routines.
!                                                              (line  876)
  * __fractudahq:                          Fixed-point fractional library routines.
!                                                              (line  852)
  * __fractudaqi:                          Fixed-point fractional library routines.
!                                                              (line  875)
  * __fractudaqq:                          Fixed-point fractional library routines.
!                                                              (line  851)
  * __fractudasa:                          Fixed-point fractional library routines.
!                                                              (line  857)
  * __fractudasf:                          Fixed-point fractional library routines.
!                                                              (line  880)
  * __fractudasi:                          Fixed-point fractional library routines.
!                                                              (line  877)
  * __fractudasq:                          Fixed-point fractional library routines.
-                                                              (line  853)
- * __fractudata:                          Fixed-point fractional library routines.
                                                               (line  860)
  * __fractudati:                          Fixed-point fractional library routines.
!                                                              (line  879)
  * __fractudaudq:                         Fixed-point fractional library routines.
!                                                              (line  868)
  * __fractudauha2:                        Fixed-point fractional library routines.
!                                                              (line  870)
  * __fractudauhq:                         Fixed-point fractional library routines.
!                                                              (line  864)
  * __fractudauqq:                         Fixed-point fractional library routines.
!                                                              (line  862)
  * __fractudausa2:                        Fixed-point fractional library routines.
!                                                              (line  872)
  * __fractudausq:                         Fixed-point fractional library routines.
!                                                              (line  866)
  * __fractudauta2:                        Fixed-point fractional library routines.
!                                                              (line  874)
  * __fractudqda:                          Fixed-point fractional library routines.
!                                                              (line  766)
  * __fractudqdf:                          Fixed-point fractional library routines.
!                                                              (line  791)
  * __fractudqdi:                          Fixed-point fractional library routines.
!                                                              (line  787)
  * __fractudqdq:                          Fixed-point fractional library routines.
!                                                              (line  761)
  * __fractudqha:                          Fixed-point fractional library routines.
!                                                              (line  763)
  * __fractudqhi:                          Fixed-point fractional library routines.
!                                                              (line  785)
  * __fractudqhq:                          Fixed-point fractional library routines.
!                                                              (line  757)
  * __fractudqqi:                          Fixed-point fractional library routines.
!                                                              (line  784)
  * __fractudqqq:                          Fixed-point fractional library routines.
!                                                              (line  756)
  * __fractudqsa:                          Fixed-point fractional library routines.
!                                                              (line  764)
  * __fractudqsf:                          Fixed-point fractional library routines.
!                                                              (line  790)
  * __fractudqsi:                          Fixed-point fractional library routines.
!                                                              (line  786)
  * __fractudqsq:                          Fixed-point fractional library routines.
!                                                              (line  759)
  * __fractudqta:                          Fixed-point fractional library routines.
!                                                              (line  768)
  * __fractudqti:                          Fixed-point fractional library routines.
!                                                              (line  789)
  * __fractudquda:                         Fixed-point fractional library routines.
!                                                              (line  780)
  * __fractudquha:                         Fixed-point fractional library routines.
!                                                              (line  776)
  * __fractudquhq2:                        Fixed-point fractional library routines.
!                                                              (line  772)
  * __fractudquqq2:                        Fixed-point fractional library routines.
!                                                              (line  770)
  * __fractudqusa:                         Fixed-point fractional library routines.
!                                                              (line  778)
  * __fractudqusq2:                        Fixed-point fractional library routines.
!                                                              (line  774)
  * __fractudquta:                         Fixed-point fractional library routines.
!                                                              (line  782)
  * __fractuhada:                          Fixed-point fractional library routines.
!                                                              (line  799)
  * __fractuhadf:                          Fixed-point fractional library routines.
!                                                              (line  822)
  * __fractuhadi:                          Fixed-point fractional library routines.
!                                                              (line  819)
  * __fractuhadq:                          Fixed-point fractional library routines.
!                                                              (line  796)
  * __fractuhaha:                          Fixed-point fractional library routines.
!                                                              (line  797)
  * __fractuhahi:                          Fixed-point fractional library routines.
!                                                              (line  817)
  * __fractuhahq:                          Fixed-point fractional library routines.
!                                                              (line  793)
  * __fractuhaqi:                          Fixed-point fractional library routines.
!                                                              (line  816)
  * __fractuhaqq:                          Fixed-point fractional library routines.
!                                                              (line  792)
  * __fractuhasa:                          Fixed-point fractional library routines.
!                                                              (line  798)
  * __fractuhasf:                          Fixed-point fractional library routines.
!                                                              (line  821)
  * __fractuhasi:                          Fixed-point fractional library routines.
!                                                              (line  818)
  * __fractuhasq:                          Fixed-point fractional library routines.
-                                                              (line  794)
- * __fractuhata:                          Fixed-point fractional library routines.
                                                               (line  801)
  * __fractuhati:                          Fixed-point fractional library routines.
!                                                              (line  820)
  * __fractuhauda2:                        Fixed-point fractional library routines.
!                                                              (line  813)
  * __fractuhaudq:                         Fixed-point fractional library routines.
!                                                              (line  809)
  * __fractuhauhq:                         Fixed-point fractional library routines.
!                                                              (line  805)
  * __fractuhauqq:                         Fixed-point fractional library routines.
!                                                              (line  803)
  * __fractuhausa2:                        Fixed-point fractional library routines.
!                                                              (line  811)
  * __fractuhausq:                         Fixed-point fractional library routines.
!                                                              (line  807)
  * __fractuhauta2:                        Fixed-point fractional library routines.
!                                                              (line  815)
  * __fractuhqda:                          Fixed-point fractional library routines.
!                                                              (line  702)
  * __fractuhqdf:                          Fixed-point fractional library routines.
!                                                              (line  723)
  * __fractuhqdi:                          Fixed-point fractional library routines.
!                                                              (line  720)
  * __fractuhqdq:                          Fixed-point fractional library routines.
!                                                              (line  699)
  * __fractuhqha:                          Fixed-point fractional library routines.
!                                                              (line  700)
  * __fractuhqhi:                          Fixed-point fractional library routines.
!                                                              (line  718)
  * __fractuhqhq:                          Fixed-point fractional library routines.
!                                                              (line  697)
  * __fractuhqqi:                          Fixed-point fractional library routines.
!                                                              (line  717)
  * __fractuhqqq:                          Fixed-point fractional library routines.
!                                                              (line  696)
  * __fractuhqsa:                          Fixed-point fractional library routines.
!                                                              (line  701)
  * __fractuhqsf:                          Fixed-point fractional library routines.
!                                                              (line  722)
  * __fractuhqsi:                          Fixed-point fractional library routines.
!                                                              (line  719)
  * __fractuhqsq:                          Fixed-point fractional library routines.
!                                                              (line  698)
  * __fractuhqta:                          Fixed-point fractional library routines.
!                                                              (line  703)
  * __fractuhqti:                          Fixed-point fractional library routines.
!                                                              (line  721)
  * __fractuhquda:                         Fixed-point fractional library routines.
!                                                              (line  714)
  * __fractuhqudq2:                        Fixed-point fractional library routines.
!                                                              (line  709)
  * __fractuhquha:                         Fixed-point fractional library routines.
!                                                              (line  711)
  * __fractuhquqq2:                        Fixed-point fractional library routines.
!                                                              (line  705)
  * __fractuhqusa:                         Fixed-point fractional library routines.
!                                                              (line  712)
  * __fractuhqusq2:                        Fixed-point fractional library routines.
!                                                              (line  707)
  * __fractuhquta:                         Fixed-point fractional library routines.
!                                                              (line  716)
  * __fractunsdadi:                        Fixed-point fractional library routines.
!                                                              (line 1555)
  * __fractunsdahi:                        Fixed-point fractional library routines.
!                                                              (line 1553)
  * __fractunsdaqi:                        Fixed-point fractional library routines.
!                                                              (line 1552)
  * __fractunsdasi:                        Fixed-point fractional library routines.
!                                                              (line 1554)
  * __fractunsdati:                        Fixed-point fractional library routines.
!                                                              (line 1556)
  * __fractunsdida:                        Fixed-point fractional library routines.
!                                                              (line 1707)
  * __fractunsdidq:                        Fixed-point fractional library routines.
!                                                              (line 1704)
  * __fractunsdiha:                        Fixed-point fractional library routines.
!                                                              (line 1705)
  * __fractunsdihq:                        Fixed-point fractional library routines.
!                                                              (line 1702)
  * __fractunsdiqq:                        Fixed-point fractional library routines.
!                                                              (line 1701)
  * __fractunsdisa:                        Fixed-point fractional library routines.
!                                                              (line 1706)
  * __fractunsdisq:                        Fixed-point fractional library routines.
!                                                              (line 1703)
  * __fractunsdita:                        Fixed-point fractional library routines.
!                                                              (line 1708)
  * __fractunsdiuda:                       Fixed-point fractional library routines.
!                                                              (line 1720)
  * __fractunsdiudq:                       Fixed-point fractional library routines.
!                                                              (line 1715)
  * __fractunsdiuha:                       Fixed-point fractional library routines.
!                                                              (line 1717)
  * __fractunsdiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1711)
  * __fractunsdiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1710)
  * __fractunsdiusa:                       Fixed-point fractional library routines.
!                                                              (line 1718)
  * __fractunsdiusq:                       Fixed-point fractional library routines.
!                                                              (line 1713)
  * __fractunsdiuta:                       Fixed-point fractional library routines.
!                                                              (line 1722)
  * __fractunsdqdi:                        Fixed-point fractional library routines.
!                                                              (line 1539)
  * __fractunsdqhi:                        Fixed-point fractional library routines.
!                                                              (line 1537)
  * __fractunsdqqi:                        Fixed-point fractional library routines.
!                                                              (line 1536)
  * __fractunsdqsi:                        Fixed-point fractional library routines.
!                                                              (line 1538)
  * __fractunsdqti:                        Fixed-point fractional library routines.
!                                                              (line 1541)
  * __fractunshadi:                        Fixed-point fractional library routines.
!                                                              (line 1545)
  * __fractunshahi:                        Fixed-point fractional library routines.
!                                                              (line 1543)
  * __fractunshaqi:                        Fixed-point fractional library routines.
!                                                              (line 1542)
  * __fractunshasi:                        Fixed-point fractional library routines.
!                                                              (line 1544)
  * __fractunshati:                        Fixed-point fractional library routines.
!                                                              (line 1546)
  * __fractunshida:                        Fixed-point fractional library routines.
!                                                              (line 1663)
  * __fractunshidq:                        Fixed-point fractional library routines.
!                                                              (line 1660)
  * __fractunshiha:                        Fixed-point fractional library routines.
!                                                              (line 1661)
  * __fractunshihq:                        Fixed-point fractional library routines.
!                                                              (line 1658)
  * __fractunshiqq:                        Fixed-point fractional library routines.
!                                                              (line 1657)
  * __fractunshisa:                        Fixed-point fractional library routines.
!                                                              (line 1662)
  * __fractunshisq:                        Fixed-point fractional library routines.
!                                                              (line 1659)
  * __fractunshita:                        Fixed-point fractional library routines.
!                                                              (line 1664)
  * __fractunshiuda:                       Fixed-point fractional library routines.
!                                                              (line 1676)
  * __fractunshiudq:                       Fixed-point fractional library routines.
!                                                              (line 1671)
  * __fractunshiuha:                       Fixed-point fractional library routines.
!                                                              (line 1673)
  * __fractunshiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1667)
  * __fractunshiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1666)
  * __fractunshiusa:                       Fixed-point fractional library routines.
!                                                              (line 1674)
  * __fractunshiusq:                       Fixed-point fractional library routines.
!                                                              (line 1669)
  * __fractunshiuta:                       Fixed-point fractional library routines.
!                                                              (line 1678)
  * __fractunshqdi:                        Fixed-point fractional library routines.
!                                                              (line 1529)
  * __fractunshqhi:                        Fixed-point fractional library routines.
!                                                              (line 1527)
  * __fractunshqqi:                        Fixed-point fractional library routines.
!                                                              (line 1526)
  * __fractunshqsi:                        Fixed-point fractional library routines.
!                                                              (line 1528)
  * __fractunshqti:                        Fixed-point fractional library routines.
!                                                              (line 1530)
  * __fractunsqida:                        Fixed-point fractional library routines.
!                                                              (line 1641)
  * __fractunsqidq:                        Fixed-point fractional library routines.
!                                                              (line 1638)
  * __fractunsqiha:                        Fixed-point fractional library routines.
!                                                              (line 1639)
  * __fractunsqihq:                        Fixed-point fractional library routines.
!                                                              (line 1636)
  * __fractunsqiqq:                        Fixed-point fractional library routines.
!                                                              (line 1635)
  * __fractunsqisa:                        Fixed-point fractional library routines.
!                                                              (line 1640)
  * __fractunsqisq:                        Fixed-point fractional library routines.
!                                                              (line 1637)
  * __fractunsqita:                        Fixed-point fractional library routines.
!                                                              (line 1642)
  * __fractunsqiuda:                       Fixed-point fractional library routines.
!                                                              (line 1654)
  * __fractunsqiudq:                       Fixed-point fractional library routines.
!                                                              (line 1649)
  * __fractunsqiuha:                       Fixed-point fractional library routines.
!                                                              (line 1651)
  * __fractunsqiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1645)
  * __fractunsqiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1644)
  * __fractunsqiusa:                       Fixed-point fractional library routines.
!                                                              (line 1652)
  * __fractunsqiusq:                       Fixed-point fractional library routines.
!                                                              (line 1647)
  * __fractunsqiuta:                       Fixed-point fractional library routines.
!                                                              (line 1656)
  * __fractunsqqdi:                        Fixed-point fractional library routines.
!                                                              (line 1524)
  * __fractunsqqhi:                        Fixed-point fractional library routines.
!                                                              (line 1522)
  * __fractunsqqqi:                        Fixed-point fractional library routines.
!                                                              (line 1521)
  * __fractunsqqsi:                        Fixed-point fractional library routines.
!                                                              (line 1523)
  * __fractunsqqti:                        Fixed-point fractional library routines.
!                                                              (line 1525)
  * __fractunssadi:                        Fixed-point fractional library routines.
!                                                              (line 1550)
  * __fractunssahi:                        Fixed-point fractional library routines.
!                                                              (line 1548)
  * __fractunssaqi:                        Fixed-point fractional library routines.
!                                                              (line 1547)
  * __fractunssasi:                        Fixed-point fractional library routines.
!                                                              (line 1549)
  * __fractunssati:                        Fixed-point fractional library routines.
!                                                              (line 1551)
  * __fractunssida:                        Fixed-point fractional library routines.
!                                                              (line 1685)
  * __fractunssidq:                        Fixed-point fractional library routines.
!                                                              (line 1682)
  * __fractunssiha:                        Fixed-point fractional library routines.
!                                                              (line 1683)
  * __fractunssihq:                        Fixed-point fractional library routines.
!                                                              (line 1680)
  * __fractunssiqq:                        Fixed-point fractional library routines.
!                                                              (line 1679)
  * __fractunssisa:                        Fixed-point fractional library routines.
!                                                              (line 1684)
  * __fractunssisq:                        Fixed-point fractional library routines.
!                                                              (line 1681)
  * __fractunssita:                        Fixed-point fractional library routines.
!                                                              (line 1686)
  * __fractunssiuda:                       Fixed-point fractional library routines.
!                                                              (line 1698)
  * __fractunssiudq:                       Fixed-point fractional library routines.
!                                                              (line 1693)
  * __fractunssiuha:                       Fixed-point fractional library routines.
!                                                              (line 1695)
  * __fractunssiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1689)
  * __fractunssiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1688)
  * __fractunssiusa:                       Fixed-point fractional library routines.
!                                                              (line 1696)
  * __fractunssiusq:                       Fixed-point fractional library routines.
!                                                              (line 1691)
  * __fractunssiuta:                       Fixed-point fractional library routines.
!                                                              (line 1700)
  * __fractunssqdi:                        Fixed-point fractional library routines.
!                                                              (line 1534)
  * __fractunssqhi:                        Fixed-point fractional library routines.
!                                                              (line 1532)
  * __fractunssqqi:                        Fixed-point fractional library routines.
!                                                              (line 1531)
  * __fractunssqsi:                        Fixed-point fractional library routines.
!                                                              (line 1533)
  * __fractunssqti:                        Fixed-point fractional library routines.
!                                                              (line 1535)
  * __fractunstadi:                        Fixed-point fractional library routines.
!                                                              (line 1560)
  * __fractunstahi:                        Fixed-point fractional library routines.
!                                                              (line 1558)
  * __fractunstaqi:                        Fixed-point fractional library routines.
!                                                              (line 1557)
  * __fractunstasi:                        Fixed-point fractional library routines.
!                                                              (line 1559)
  * __fractunstati:                        Fixed-point fractional library routines.
!                                                              (line 1562)
  * __fractunstida:                        Fixed-point fractional library routines.
!                                                              (line 1730)
  * __fractunstidq:                        Fixed-point fractional library routines.
!                                                              (line 1727)
  * __fractunstiha:                        Fixed-point fractional library routines.
!                                                              (line 1728)
  * __fractunstihq:                        Fixed-point fractional library routines.
!                                                              (line 1724)
  * __fractunstiqq:                        Fixed-point fractional library routines.
!                                                              (line 1723)
  * __fractunstisa:                        Fixed-point fractional library routines.
!                                                              (line 1729)
  * __fractunstisq:                        Fixed-point fractional library routines.
-                                                              (line 1725)
- * __fractunstita:                        Fixed-point fractional library routines.
                                                               (line 1732)
  * __fractunstiuda:                       Fixed-point fractional library routines.
!                                                              (line 1746)
  * __fractunstiudq:                       Fixed-point fractional library routines.
!                                                              (line 1740)
  * __fractunstiuha:                       Fixed-point fractional library routines.
!                                                              (line 1742)
  * __fractunstiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1736)
  * __fractunstiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1734)
  * __fractunstiusa:                       Fixed-point fractional library routines.
!                                                              (line 1744)
  * __fractunstiusq:                       Fixed-point fractional library routines.
!                                                              (line 1738)
  * __fractunstiuta:                       Fixed-point fractional library routines.
!                                                              (line 1748)
  * __fractunsudadi:                       Fixed-point fractional library routines.
!                                                              (line 1622)
  * __fractunsudahi:                       Fixed-point fractional library routines.
!                                                              (line 1618)
  * __fractunsudaqi:                       Fixed-point fractional library routines.
!                                                              (line 1616)
  * __fractunsudasi:                       Fixed-point fractional library routines.
!                                                              (line 1620)
  * __fractunsudati:                       Fixed-point fractional library routines.
!                                                              (line 1624)
  * __fractunsudqdi:                       Fixed-point fractional library routines.
!                                                              (line 1596)
  * __fractunsudqhi:                       Fixed-point fractional library routines.
!                                                              (line 1592)
  * __fractunsudqqi:                       Fixed-point fractional library routines.
!                                                              (line 1590)
  * __fractunsudqsi:                       Fixed-point fractional library routines.
!                                                              (line 1594)
  * __fractunsudqti:                       Fixed-point fractional library routines.
!                                                              (line 1598)
  * __fractunsuhadi:                       Fixed-point fractional library routines.
!                                                              (line 1606)
  * __fractunsuhahi:                       Fixed-point fractional library routines.
!                                                              (line 1602)
  * __fractunsuhaqi:                       Fixed-point fractional library routines.
!                                                              (line 1600)
  * __fractunsuhasi:                       Fixed-point fractional library routines.
!                                                              (line 1604)
  * __fractunsuhati:                       Fixed-point fractional library routines.
!                                                              (line 1608)
  * __fractunsuhqdi:                       Fixed-point fractional library routines.
!                                                              (line 1576)
  * __fractunsuhqhi:                       Fixed-point fractional library routines.
!                                                              (line 1574)
  * __fractunsuhqqi:                       Fixed-point fractional library routines.
!                                                              (line 1573)
  * __fractunsuhqsi:                       Fixed-point fractional library routines.
!                                                              (line 1575)
  * __fractunsuhqti:                       Fixed-point fractional library routines.
!                                                              (line 1578)
  * __fractunsuqqdi:                       Fixed-point fractional library routines.
!                                                              (line 1570)
  * __fractunsuqqhi:                       Fixed-point fractional library routines.
!                                                              (line 1566)
  * __fractunsuqqqi:                       Fixed-point fractional library routines.
!                                                              (line 1564)
  * __fractunsuqqsi:                       Fixed-point fractional library routines.
!                                                              (line 1568)
  * __fractunsuqqti:                       Fixed-point fractional library routines.
!                                                              (line 1572)
  * __fractunsusadi:                       Fixed-point fractional library routines.
!                                                              (line 1612)
  * __fractunsusahi:                       Fixed-point fractional library routines.
!                                                              (line 1610)
  * __fractunsusaqi:                       Fixed-point fractional library routines.
!                                                              (line 1609)
  * __fractunsusasi:                       Fixed-point fractional library routines.
!                                                              (line 1611)
  * __fractunsusati:                       Fixed-point fractional library routines.
!                                                              (line 1614)
  * __fractunsusqdi:                       Fixed-point fractional library routines.
!                                                              (line 1586)
  * __fractunsusqhi:                       Fixed-point fractional library routines.
!                                                              (line 1582)
  * __fractunsusqqi:                       Fixed-point fractional library routines.
!                                                              (line 1580)
  * __fractunsusqsi:                       Fixed-point fractional library routines.
!                                                              (line 1584)
  * __fractunsusqti:                       Fixed-point fractional library routines.
!                                                              (line 1588)
  * __fractunsutadi:                       Fixed-point fractional library routines.
!                                                              (line 1632)
  * __fractunsutahi:                       Fixed-point fractional library routines.
!                                                              (line 1628)
  * __fractunsutaqi:                       Fixed-point fractional library routines.
!                                                              (line 1626)
  * __fractunsutasi:                       Fixed-point fractional library routines.
!                                                              (line 1630)
  * __fractunsutati:                       Fixed-point fractional library routines.
!                                                              (line 1634)
  * __fractuqqda:                          Fixed-point fractional library routines.
!                                                              (line  672)
  * __fractuqqdf:                          Fixed-point fractional library routines.
!                                                              (line  695)
  * __fractuqqdi:                          Fixed-point fractional library routines.
!                                                              (line  692)
  * __fractuqqdq:                          Fixed-point fractional library routines.
!                                                              (line  669)
  * __fractuqqha:                          Fixed-point fractional library routines.
!                                                              (line  670)
  * __fractuqqhi:                          Fixed-point fractional library routines.
!                                                              (line  690)
  * __fractuqqhq:                          Fixed-point fractional library routines.
!                                                              (line  666)
  * __fractuqqqi:                          Fixed-point fractional library routines.
!                                                              (line  689)
  * __fractuqqqq:                          Fixed-point fractional library routines.
!                                                              (line  665)
  * __fractuqqsa:                          Fixed-point fractional library routines.
!                                                              (line  671)
  * __fractuqqsf:                          Fixed-point fractional library routines.
!                                                              (line  694)
  * __fractuqqsi:                          Fixed-point fractional library routines.
!                                                              (line  691)
  * __fractuqqsq:                          Fixed-point fractional library routines.
-                                                              (line  667)
- * __fractuqqta:                          Fixed-point fractional library routines.
                                                               (line  674)
  * __fractuqqti:                          Fixed-point fractional library routines.
!                                                              (line  693)
  * __fractuqquda:                         Fixed-point fractional library routines.
!                                                              (line  686)
  * __fractuqqudq2:                        Fixed-point fractional library routines.
!                                                              (line  680)
  * __fractuqquha:                         Fixed-point fractional library routines.
!                                                              (line  682)
  * __fractuqquhq2:                        Fixed-point fractional library routines.
!                                                              (line  676)
  * __fractuqqusa:                         Fixed-point fractional library routines.
!                                                              (line  684)
  * __fractuqqusq2:                        Fixed-point fractional library routines.
!                                                              (line  678)
  * __fractuqquta:                         Fixed-point fractional library routines.
!                                                              (line  688)
  * __fractusada:                          Fixed-point fractional library routines.
!                                                              (line  829)
  * __fractusadf:                          Fixed-point fractional library routines.
!                                                              (line  850)
  * __fractusadi:                          Fixed-point fractional library routines.
!                                                              (line  847)
  * __fractusadq:                          Fixed-point fractional library routines.
!                                                              (line  826)
  * __fractusaha:                          Fixed-point fractional library routines.
!                                                              (line  827)
  * __fractusahi:                          Fixed-point fractional library routines.
!                                                              (line  845)
  * __fractusahq:                          Fixed-point fractional library routines.
!                                                              (line  824)
  * __fractusaqi:                          Fixed-point fractional library routines.
!                                                              (line  844)
  * __fractusaqq:                          Fixed-point fractional library routines.
!                                                              (line  823)
  * __fractusasa:                          Fixed-point fractional library routines.
!                                                              (line  828)
  * __fractusasf:                          Fixed-point fractional library routines.
!                                                              (line  849)
  * __fractusasi:                          Fixed-point fractional library routines.
!                                                              (line  846)
  * __fractusasq:                          Fixed-point fractional library routines.
!                                                              (line  825)
  * __fractusata:                          Fixed-point fractional library routines.
!                                                              (line  830)
  * __fractusati:                          Fixed-point fractional library routines.
!                                                              (line  848)
  * __fractusauda2:                        Fixed-point fractional library routines.
!                                                              (line  841)
  * __fractusaudq:                         Fixed-point fractional library routines.
!                                                              (line  837)
  * __fractusauha2:                        Fixed-point fractional library routines.
!                                                              (line  839)
  * __fractusauhq:                         Fixed-point fractional library routines.
!                                                              (line  833)
  * __fractusauqq:                         Fixed-point fractional library routines.
!                                                              (line  832)
  * __fractusausq:                         Fixed-point fractional library routines.
!                                                              (line  835)
  * __fractusauta2:                        Fixed-point fractional library routines.
!                                                              (line  843)
  * __fractusqda:                          Fixed-point fractional library routines.
!                                                              (line  731)
  * __fractusqdf:                          Fixed-point fractional library routines.
!                                                              (line  754)
  * __fractusqdi:                          Fixed-point fractional library routines.
!                                                              (line  751)
  * __fractusqdq:                          Fixed-point fractional library routines.
!                                                              (line  728)
  * __fractusqha:                          Fixed-point fractional library routines.
!                                                              (line  729)
  * __fractusqhi:                          Fixed-point fractional library routines.
!                                                              (line  749)
  * __fractusqhq:                          Fixed-point fractional library routines.
!                                                              (line  725)
  * __fractusqqi:                          Fixed-point fractional library routines.
!                                                              (line  748)
  * __fractusqqq:                          Fixed-point fractional library routines.
!                                                              (line  724)
  * __fractusqsa:                          Fixed-point fractional library routines.
!                                                              (line  730)
  * __fractusqsf:                          Fixed-point fractional library routines.
!                                                              (line  753)
  * __fractusqsi:                          Fixed-point fractional library routines.
!                                                              (line  750)
  * __fractusqsq:                          Fixed-point fractional library routines.
-                                                              (line  726)
- * __fractusqta:                          Fixed-point fractional library routines.
                                                               (line  733)
  * __fractusqti:                          Fixed-point fractional library routines.
!                                                              (line  752)
  * __fractusquda:                         Fixed-point fractional library routines.
!                                                              (line  745)
  * __fractusqudq2:                        Fixed-point fractional library routines.
!                                                              (line  739)
  * __fractusquha:                         Fixed-point fractional library routines.
!                                                              (line  741)
  * __fractusquhq2:                        Fixed-point fractional library routines.
!                                                              (line  737)
  * __fractusquqq2:                        Fixed-point fractional library routines.
!                                                              (line  735)
  * __fractusqusa:                         Fixed-point fractional library routines.
!                                                              (line  743)
  * __fractusquta:                         Fixed-point fractional library routines.
!                                                              (line  747)
  * __fractutada:                          Fixed-point fractional library routines.
!                                                              (line  893)
  * __fractutadf:                          Fixed-point fractional library routines.
!                                                              (line  918)
  * __fractutadi:                          Fixed-point fractional library routines.
!                                                              (line  914)
  * __fractutadq:                          Fixed-point fractional library routines.
!                                                              (line  888)
  * __fractutaha:                          Fixed-point fractional library routines.
!                                                              (line  890)
  * __fractutahi:                          Fixed-point fractional library routines.
!                                                              (line  912)
  * __fractutahq:                          Fixed-point fractional library routines.
!                                                              (line  884)
  * __fractutaqi:                          Fixed-point fractional library routines.
!                                                              (line  911)
  * __fractutaqq:                          Fixed-point fractional library routines.
!                                                              (line  883)
  * __fractutasa:                          Fixed-point fractional library routines.
!                                                              (line  891)
  * __fractutasf:                          Fixed-point fractional library routines.
!                                                              (line  917)
  * __fractutasi:                          Fixed-point fractional library routines.
!                                                              (line  913)
  * __fractutasq:                          Fixed-point fractional library routines.
!                                                              (line  886)
  * __fractutata:                          Fixed-point fractional library routines.
!                                                              (line  895)
  * __fractutati:                          Fixed-point fractional library routines.
!                                                              (line  916)
  * __fractutauda2:                        Fixed-point fractional library routines.
!                                                              (line  909)
  * __fractutaudq:                         Fixed-point fractional library routines.
!                                                              (line  903)
  * __fractutauha2:                        Fixed-point fractional library routines.
!                                                              (line  905)
  * __fractutauhq:                         Fixed-point fractional library routines.
!                                                              (line  899)
  * __fractutauqq:                         Fixed-point fractional library routines.
!                                                              (line  897)
  * __fractutausa2:                        Fixed-point fractional library routines.
!                                                              (line  907)
  * __fractutausq:                         Fixed-point fractional library routines.
!                                                              (line  901)
  * __gedf2:                               Soft float library routines.
-                                                              (line  206)
- * __gesf2:                               Soft float library routines.
                                                               (line  205)
  * __getf2:                               Soft float library routines.
!                                                              (line  207)
  * __gtdf2:                               Soft float library routines.
-                                                              (line  224)
- * __gtsf2:                               Soft float library routines.
                                                               (line  223)
  * __gttf2:                               Soft float library routines.
!                                                              (line  225)
  * __ledf2:                               Soft float library routines.
-                                                              (line  218)
- * __lesf2:                               Soft float library routines.
                                                               (line  217)
  * __letf2:                               Soft float library routines.
!                                                              (line  219)
  * __lshrdi3:                             Integer library routines.
-                                                              (line   31)
- * __lshrsi3:                             Integer library routines.
                                                               (line   30)
  * __lshrti3:                             Integer library routines.
!                                                              (line   32)
  * __lshruda3:                            Fixed-point fractional library routines.
!                                                              (line  390)
  * __lshrudq3:                            Fixed-point fractional library routines.
!                                                              (line  384)
  * __lshruha3:                            Fixed-point fractional library routines.
!                                                              (line  386)
  * __lshruhq3:                            Fixed-point fractional library routines.
!                                                              (line  380)
  * __lshruqq3:                            Fixed-point fractional library routines.
!                                                              (line  378)
  * __lshrusa3:                            Fixed-point fractional library routines.
!                                                              (line  388)
  * __lshrusq3:                            Fixed-point fractional library routines.
!                                                              (line  382)
  * __lshruta3:                            Fixed-point fractional library routines.
!                                                              (line  392)
  * __ltdf2:                               Soft float library routines.
-                                                              (line  212)
- * __ltsf2:                               Soft float library routines.
                                                               (line  211)
  * __lttf2:                               Soft float library routines.
!                                                              (line  213)
  * __main:                                Collect2.           (line   15)
  * __moddi3:                              Integer library routines.
-                                                              (line   37)
- * __modsi3:                              Integer library routines.
                                                               (line   36)
  * __modti3:                              Integer library routines.
!                                                              (line   38)
  * __morestack_current_segment:           Miscellaneous routines.
!                                                              (line   46)
  * __morestack_initial_sp:                Miscellaneous routines.
!                                                              (line   47)
  * __morestack_segments:                  Miscellaneous routines.
!                                                              (line   45)
  * __mulda3:                              Fixed-point fractional library routines.
!                                                              (line  171)
  * __muldc3:                              Soft float library routines.
!                                                              (line  241)
  * __muldf3:                              Soft float library routines.
!                                                              (line   40)
  * __muldi3:                              Integer library routines.
!                                                              (line   43)
  * __muldq3:                              Fixed-point fractional library routines.
!                                                              (line  159)
  * __mulha3:                              Fixed-point fractional library routines.
!                                                              (line  169)
  * __mulhq3:                              Fixed-point fractional library routines.
!                                                              (line  156)
  * __mulqq3:                              Fixed-point fractional library routines.
!                                                              (line  155)
  * __mulsa3:                              Fixed-point fractional library routines.
!                                                              (line  170)
  * __mulsc3:                              Soft float library routines.
!                                                              (line  239)
  * __mulsf3:                              Soft float library routines.
!                                                              (line   39)
  * __mulsi3:                              Integer library routines.
!                                                              (line   42)
  * __mulsq3:                              Fixed-point fractional library routines.
!                                                              (line  157)
  * __multa3:                              Fixed-point fractional library routines.
!                                                              (line  173)
  * __multc3:                              Soft float library routines.
!                                                              (line  243)
  * __multf3:                              Soft float library routines.
!                                                              (line   42)
  * __multi3:                              Integer library routines.
!                                                              (line   44)
  * __muluda3:                             Fixed-point fractional library routines.
!                                                              (line  179)
  * __muludq3:                             Fixed-point fractional library routines.
!                                                              (line  167)
  * __muluha3:                             Fixed-point fractional library routines.
!                                                              (line  175)
  * __muluhq3:                             Fixed-point fractional library routines.
!                                                              (line  163)
  * __muluqq3:                             Fixed-point fractional library routines.
!                                                              (line  161)
  * __mulusa3:                             Fixed-point fractional library routines.
!                                                              (line  177)
  * __mulusq3:                             Fixed-point fractional library routines.
!                                                              (line  165)
  * __muluta3:                             Fixed-point fractional library routines.
!                                                              (line  181)
  * __mulvdi3:                             Integer library routines.
-                                                              (line  115)
- * __mulvsi3:                             Integer library routines.
                                                               (line  114)
  * __mulxc3:                              Soft float library routines.
!                                                              (line  245)
  * __mulxf3:                              Soft float library routines.
!                                                              (line   44)
  * __nedf2:                               Soft float library routines.
!                                                              (line  200)
  * __negda2:                              Fixed-point fractional library routines.
!                                                              (line  299)
  * __negdf2:                              Soft float library routines.
!                                                              (line   56)
  * __negdi2:                              Integer library routines.
!                                                              (line   47)
  * __negdq2:                              Fixed-point fractional library routines.
!                                                              (line  289)
  * __negha2:                              Fixed-point fractional library routines.
!                                                              (line  297)
  * __neghq2:                              Fixed-point fractional library routines.
!                                                              (line  287)
  * __negqq2:                              Fixed-point fractional library routines.
!                                                              (line  286)
  * __negsa2:                              Fixed-point fractional library routines.
!                                                              (line  298)
  * __negsf2:                              Soft float library routines.
!                                                              (line   55)
  * __negsq2:                              Fixed-point fractional library routines.
!                                                              (line  288)
  * __negta2:                              Fixed-point fractional library routines.
!                                                              (line  300)
  * __negtf2:                              Soft float library routines.
!                                                              (line   57)
  * __negti2:                              Integer library routines.
!                                                              (line   48)
  * __neguda2:                             Fixed-point fractional library routines.
!                                                              (line  305)
  * __negudq2:                             Fixed-point fractional library routines.
-                                                              (line  296)
- * __neguha2:                             Fixed-point fractional library routines.
                                                               (line  302)
  * __neguhq2:                             Fixed-point fractional library routines.
!                                                              (line  292)
  * __neguqq2:                             Fixed-point fractional library routines.
!                                                              (line  291)
  * __negusa2:                             Fixed-point fractional library routines.
!                                                              (line  303)
  * __negusq2:                             Fixed-point fractional library routines.
!                                                              (line  294)
  * __neguta2:                             Fixed-point fractional library routines.
!                                                              (line  307)
  * __negvdi2:                             Integer library routines.
-                                                              (line  119)
- * __negvsi2:                             Integer library routines.
                                                               (line  118)
  * __negxf2:                              Soft float library routines.
!                                                              (line   58)
  * __nesf2:                               Soft float library routines.
!                                                              (line  199)
  * __netf2:                               Soft float library routines.
!                                                              (line  201)
  * __paritydi2:                           Integer library routines.
-                                                              (line  151)
- * __paritysi2:                           Integer library routines.
                                                               (line  150)
  * __parityti2:                           Integer library routines.
!                                                              (line  152)
  * __popcountdi2:                         Integer library routines.
-                                                              (line  157)
- * __popcountsi2:                         Integer library routines.
                                                               (line  156)
  * __popcountti2:                         Integer library routines.
!                                                              (line  158)
  * __powidf2:                             Soft float library routines.
-                                                              (line  233)
- * __powisf2:                             Soft float library routines.
                                                               (line  232)
  * __powitf2:                             Soft float library routines.
!                                                              (line  234)
  * __powixf2:                             Soft float library routines.
!                                                              (line  235)
  * __satfractdadq:                        Fixed-point fractional library routines.
!                                                              (line 1153)
  * __satfractdaha2:                       Fixed-point fractional library routines.
!                                                              (line 1154)
  * __satfractdahq:                        Fixed-point fractional library routines.
!                                                              (line 1151)
  * __satfractdaqq:                        Fixed-point fractional library routines.
!                                                              (line 1150)
  * __satfractdasa2:                       Fixed-point fractional library routines.
!                                                              (line 1155)
  * __satfractdasq:                        Fixed-point fractional library routines.
!                                                              (line 1152)
  * __satfractdata2:                       Fixed-point fractional library routines.
!                                                              (line 1156)
  * __satfractdauda:                       Fixed-point fractional library routines.
!                                                              (line 1166)
  * __satfractdaudq:                       Fixed-point fractional library routines.
!                                                              (line 1162)
  * __satfractdauha:                       Fixed-point fractional library routines.
!                                                              (line 1164)
  * __satfractdauhq:                       Fixed-point fractional library routines.
!                                                              (line 1159)
  * __satfractdauqq:                       Fixed-point fractional library routines.
!                                                              (line 1158)
  * __satfractdausa:                       Fixed-point fractional library routines.
!                                                              (line 1165)
  * __satfractdausq:                       Fixed-point fractional library routines.
!                                                              (line 1160)
  * __satfractdauta:                       Fixed-point fractional library routines.
!                                                              (line 1168)
  * __satfractdfda:                        Fixed-point fractional library routines.
!                                                              (line 1506)
  * __satfractdfdq:                        Fixed-point fractional library routines.
!                                                              (line 1503)
  * __satfractdfha:                        Fixed-point fractional library routines.
!                                                              (line 1504)
  * __satfractdfhq:                        Fixed-point fractional library routines.
!                                                              (line 1501)
  * __satfractdfqq:                        Fixed-point fractional library routines.
!                                                              (line 1500)
  * __satfractdfsa:                        Fixed-point fractional library routines.
!                                                              (line 1505)
  * __satfractdfsq:                        Fixed-point fractional library routines.
!                                                              (line 1502)
  * __satfractdfta:                        Fixed-point fractional library routines.
!                                                              (line 1507)
  * __satfractdfuda:                       Fixed-point fractional library routines.
!                                                              (line 1515)
  * __satfractdfudq:                       Fixed-point fractional library routines.
!                                                              (line 1512)
  * __satfractdfuha:                       Fixed-point fractional library routines.
!                                                              (line 1513)
  * __satfractdfuhq:                       Fixed-point fractional library routines.
!                                                              (line 1509)
  * __satfractdfuqq:                       Fixed-point fractional library routines.
!                                                              (line 1508)
  * __satfractdfusa:                       Fixed-point fractional library routines.
!                                                              (line 1514)
  * __satfractdfusq:                       Fixed-point fractional library routines.
-                                                              (line 1510)
- * __satfractdfuta:                       Fixed-point fractional library routines.
                                                               (line 1517)
  * __satfractdida:                        Fixed-point fractional library routines.
!                                                              (line 1456)
  * __satfractdidq:                        Fixed-point fractional library routines.
!                                                              (line 1453)
  * __satfractdiha:                        Fixed-point fractional library routines.
!                                                              (line 1454)
  * __satfractdihq:                        Fixed-point fractional library routines.
!                                                              (line 1451)
  * __satfractdiqq:                        Fixed-point fractional library routines.
!                                                              (line 1450)
  * __satfractdisa:                        Fixed-point fractional library routines.
!                                                              (line 1455)
  * __satfractdisq:                        Fixed-point fractional library routines.
!                                                              (line 1452)
  * __satfractdita:                        Fixed-point fractional library routines.
-                                                              (line 1457)
- * __satfractdiuda:                       Fixed-point fractional library routines.
                                                               (line 1464)
  * __satfractdiudq:                       Fixed-point fractional library routines.
!                                                              (line 1461)
  * __satfractdiuha:                       Fixed-point fractional library routines.
!                                                              (line 1462)
  * __satfractdiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1459)
  * __satfractdiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1458)
  * __satfractdiusa:                       Fixed-point fractional library routines.
!                                                              (line 1463)
  * __satfractdiusq:                       Fixed-point fractional library routines.
!                                                              (line 1460)
  * __satfractdiuta:                       Fixed-point fractional library routines.
!                                                              (line 1465)
  * __satfractdqda:                        Fixed-point fractional library routines.
!                                                              (line 1098)
  * __satfractdqha:                        Fixed-point fractional library routines.
!                                                              (line 1096)
  * __satfractdqhq2:                       Fixed-point fractional library routines.
!                                                              (line 1094)
  * __satfractdqqq2:                       Fixed-point fractional library routines.
!                                                              (line 1093)
  * __satfractdqsa:                        Fixed-point fractional library routines.
!                                                              (line 1097)
  * __satfractdqsq2:                       Fixed-point fractional library routines.
!                                                              (line 1095)
  * __satfractdqta:                        Fixed-point fractional library routines.
!                                                              (line 1099)
  * __satfractdquda:                       Fixed-point fractional library routines.
!                                                              (line 1111)
  * __satfractdqudq:                       Fixed-point fractional library routines.
!                                                              (line 1106)
  * __satfractdquha:                       Fixed-point fractional library routines.
!                                                              (line 1108)
  * __satfractdquhq:                       Fixed-point fractional library routines.
!                                                              (line 1102)
  * __satfractdquqq:                       Fixed-point fractional library routines.
!                                                              (line 1101)
  * __satfractdqusa:                       Fixed-point fractional library routines.
!                                                              (line 1109)
  * __satfractdqusq:                       Fixed-point fractional library routines.
!                                                              (line 1104)
  * __satfractdquta:                       Fixed-point fractional library routines.
-                                                              (line 1113)
- * __satfracthada2:                       Fixed-point fractional library routines.
                                                               (line 1119)
  * __satfracthadq:                        Fixed-point fractional library routines.
!                                                              (line 1117)
  * __satfracthahq:                        Fixed-point fractional library routines.
!                                                              (line 1115)
  * __satfracthaqq:                        Fixed-point fractional library routines.
!                                                              (line 1114)
  * __satfracthasa2:                       Fixed-point fractional library routines.
!                                                              (line 1118)
  * __satfracthasq:                        Fixed-point fractional library routines.
!                                                              (line 1116)
  * __satfracthata2:                       Fixed-point fractional library routines.
!                                                              (line 1120)
  * __satfracthauda:                       Fixed-point fractional library routines.
!                                                              (line 1132)
  * __satfracthaudq:                       Fixed-point fractional library routines.
!                                                              (line 1127)
  * __satfracthauha:                       Fixed-point fractional library routines.
!                                                              (line 1129)
  * __satfracthauhq:                       Fixed-point fractional library routines.
!                                                              (line 1123)
  * __satfracthauqq:                       Fixed-point fractional library routines.
!                                                              (line 1122)
  * __satfracthausa:                       Fixed-point fractional library routines.
!                                                              (line 1130)
  * __satfracthausq:                       Fixed-point fractional library routines.
!                                                              (line 1125)
  * __satfracthauta:                       Fixed-point fractional library routines.
!                                                              (line 1134)
  * __satfracthida:                        Fixed-point fractional library routines.
!                                                              (line 1424)
  * __satfracthidq:                        Fixed-point fractional library routines.
!                                                              (line 1421)
  * __satfracthiha:                        Fixed-point fractional library routines.
!                                                              (line 1422)
  * __satfracthihq:                        Fixed-point fractional library routines.
!                                                              (line 1419)
  * __satfracthiqq:                        Fixed-point fractional library routines.
!                                                              (line 1418)
  * __satfracthisa:                        Fixed-point fractional library routines.
!                                                              (line 1423)
  * __satfracthisq:                        Fixed-point fractional library routines.
!                                                              (line 1420)
  * __satfracthita:                        Fixed-point fractional library routines.
-                                                              (line 1425)
- * __satfracthiuda:                       Fixed-point fractional library routines.
                                                               (line 1432)
  * __satfracthiudq:                       Fixed-point fractional library routines.
!                                                              (line 1429)
  * __satfracthiuha:                       Fixed-point fractional library routines.
!                                                              (line 1430)
  * __satfracthiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1427)
  * __satfracthiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1426)
  * __satfracthiusa:                       Fixed-point fractional library routines.
!                                                              (line 1431)
  * __satfracthiusq:                       Fixed-point fractional library routines.
!                                                              (line 1428)
  * __satfracthiuta:                       Fixed-point fractional library routines.
!                                                              (line 1433)
  * __satfracthqda:                        Fixed-point fractional library routines.
!                                                              (line 1064)
  * __satfracthqdq2:                       Fixed-point fractional library routines.
!                                                              (line 1061)
  * __satfracthqha:                        Fixed-point fractional library routines.
!                                                              (line 1062)
  * __satfracthqqq2:                       Fixed-point fractional library routines.
!                                                              (line 1059)
  * __satfracthqsa:                        Fixed-point fractional library routines.
!                                                              (line 1063)
  * __satfracthqsq2:                       Fixed-point fractional library routines.
!                                                              (line 1060)
  * __satfracthqta:                        Fixed-point fractional library routines.
-                                                              (line 1065)
- * __satfracthquda:                       Fixed-point fractional library routines.
                                                               (line 1072)
  * __satfracthqudq:                       Fixed-point fractional library routines.
!                                                              (line 1069)
  * __satfracthquha:                       Fixed-point fractional library routines.
!                                                              (line 1070)
  * __satfracthquhq:                       Fixed-point fractional library routines.
!                                                              (line 1067)
  * __satfracthquqq:                       Fixed-point fractional library routines.
!                                                              (line 1066)
  * __satfracthqusa:                       Fixed-point fractional library routines.
!                                                              (line 1071)
  * __satfracthqusq:                       Fixed-point fractional library routines.
!                                                              (line 1068)
  * __satfracthquta:                       Fixed-point fractional library routines.
!                                                              (line 1073)
  * __satfractqida:                        Fixed-point fractional library routines.
!                                                              (line 1402)
  * __satfractqidq:                        Fixed-point fractional library routines.
!                                                              (line 1399)
  * __satfractqiha:                        Fixed-point fractional library routines.
!                                                              (line 1400)
  * __satfractqihq:                        Fixed-point fractional library routines.
!                                                              (line 1397)
  * __satfractqiqq:                        Fixed-point fractional library routines.
!                                                              (line 1396)
  * __satfractqisa:                        Fixed-point fractional library routines.
!                                                              (line 1401)
  * __satfractqisq:                        Fixed-point fractional library routines.
!                                                              (line 1398)
  * __satfractqita:                        Fixed-point fractional library routines.
!                                                              (line 1403)
  * __satfractqiuda:                       Fixed-point fractional library routines.
!                                                              (line 1415)
  * __satfractqiudq:                       Fixed-point fractional library routines.
!                                                              (line 1410)
  * __satfractqiuha:                       Fixed-point fractional library routines.
!                                                              (line 1412)
  * __satfractqiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1406)
  * __satfractqiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1405)
  * __satfractqiusa:                       Fixed-point fractional library routines.
!                                                              (line 1413)
  * __satfractqiusq:                       Fixed-point fractional library routines.
!                                                              (line 1408)
  * __satfractqiuta:                       Fixed-point fractional library routines.
!                                                              (line 1417)
  * __satfractqqda:                        Fixed-point fractional library routines.
!                                                              (line 1043)
  * __satfractqqdq2:                       Fixed-point fractional library routines.
!                                                              (line 1040)
  * __satfractqqha:                        Fixed-point fractional library routines.
!                                                              (line 1041)
  * __satfractqqhq2:                       Fixed-point fractional library routines.
!                                                              (line 1038)
  * __satfractqqsa:                        Fixed-point fractional library routines.
!                                                              (line 1042)
  * __satfractqqsq2:                       Fixed-point fractional library routines.
!                                                              (line 1039)
  * __satfractqqta:                        Fixed-point fractional library routines.
!                                                              (line 1044)
  * __satfractqquda:                       Fixed-point fractional library routines.
!                                                              (line 1056)
  * __satfractqqudq:                       Fixed-point fractional library routines.
!                                                              (line 1051)
  * __satfractqquha:                       Fixed-point fractional library routines.
!                                                              (line 1053)
  * __satfractqquhq:                       Fixed-point fractional library routines.
!                                                              (line 1047)
  * __satfractqquqq:                       Fixed-point fractional library routines.
!                                                              (line 1046)
  * __satfractqqusa:                       Fixed-point fractional library routines.
!                                                              (line 1054)
  * __satfractqqusq:                       Fixed-point fractional library routines.
!                                                              (line 1049)
  * __satfractqquta:                       Fixed-point fractional library routines.
!                                                              (line 1058)
  * __satfractsada2:                       Fixed-point fractional library routines.
!                                                              (line 1140)
  * __satfractsadq:                        Fixed-point fractional library routines.
!                                                              (line 1138)
  * __satfractsaha2:                       Fixed-point fractional library routines.
!                                                              (line 1139)
  * __satfractsahq:                        Fixed-point fractional library routines.
!                                                              (line 1136)
  * __satfractsaqq:                        Fixed-point fractional library routines.
!                                                              (line 1135)
  * __satfractsasq:                        Fixed-point fractional library routines.
!                                                              (line 1137)
  * __satfractsata2:                       Fixed-point fractional library routines.
-                                                              (line 1141)
- * __satfractsauda:                       Fixed-point fractional library routines.
                                                               (line 1148)
  * __satfractsaudq:                       Fixed-point fractional library routines.
!                                                              (line 1145)
  * __satfractsauha:                       Fixed-point fractional library routines.
!                                                              (line 1146)
  * __satfractsauhq:                       Fixed-point fractional library routines.
!                                                              (line 1143)
  * __satfractsauqq:                       Fixed-point fractional library routines.
!                                                              (line 1142)
  * __satfractsausa:                       Fixed-point fractional library routines.
!                                                              (line 1147)
  * __satfractsausq:                       Fixed-point fractional library routines.
!                                                              (line 1144)
  * __satfractsauta:                       Fixed-point fractional library routines.
!                                                              (line 1149)
  * __satfractsfda:                        Fixed-point fractional library routines.
!                                                              (line 1490)
  * __satfractsfdq:                        Fixed-point fractional library routines.
!                                                              (line 1487)
  * __satfractsfha:                        Fixed-point fractional library routines.
!                                                              (line 1488)
  * __satfractsfhq:                        Fixed-point fractional library routines.
!                                                              (line 1485)
  * __satfractsfqq:                        Fixed-point fractional library routines.
!                                                              (line 1484)
  * __satfractsfsa:                        Fixed-point fractional library routines.
!                                                              (line 1489)
  * __satfractsfsq:                        Fixed-point fractional library routines.
!                                                              (line 1486)
  * __satfractsfta:                        Fixed-point fractional library routines.
-                                                              (line 1491)
- * __satfractsfuda:                       Fixed-point fractional library routines.
                                                               (line 1498)
  * __satfractsfudq:                       Fixed-point fractional library routines.
!                                                              (line 1495)
  * __satfractsfuha:                       Fixed-point fractional library routines.
!                                                              (line 1496)
  * __satfractsfuhq:                       Fixed-point fractional library routines.
!                                                              (line 1493)
  * __satfractsfuqq:                       Fixed-point fractional library routines.
!                                                              (line 1492)
  * __satfractsfusa:                       Fixed-point fractional library routines.
!                                                              (line 1497)
  * __satfractsfusq:                       Fixed-point fractional library routines.
!                                                              (line 1494)
  * __satfractsfuta:                       Fixed-point fractional library routines.
!                                                              (line 1499)
  * __satfractsida:                        Fixed-point fractional library routines.
!                                                              (line 1440)
  * __satfractsidq:                        Fixed-point fractional library routines.
!                                                              (line 1437)
  * __satfractsiha:                        Fixed-point fractional library routines.
!                                                              (line 1438)
  * __satfractsihq:                        Fixed-point fractional library routines.
!                                                              (line 1435)
  * __satfractsiqq:                        Fixed-point fractional library routines.
!                                                              (line 1434)
  * __satfractsisa:                        Fixed-point fractional library routines.
!                                                              (line 1439)
  * __satfractsisq:                        Fixed-point fractional library routines.
!                                                              (line 1436)
  * __satfractsita:                        Fixed-point fractional library routines.
-                                                              (line 1441)
- * __satfractsiuda:                       Fixed-point fractional library routines.
                                                               (line 1448)
  * __satfractsiudq:                       Fixed-point fractional library routines.
!                                                              (line 1445)
  * __satfractsiuha:                       Fixed-point fractional library routines.
!                                                              (line 1446)
  * __satfractsiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1443)
  * __satfractsiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1442)
  * __satfractsiusa:                       Fixed-point fractional library routines.
!                                                              (line 1447)
  * __satfractsiusq:                       Fixed-point fractional library routines.
!                                                              (line 1444)
  * __satfractsiuta:                       Fixed-point fractional library routines.
!                                                              (line 1449)
  * __satfractsqda:                        Fixed-point fractional library routines.
!                                                              (line 1079)
  * __satfractsqdq2:                       Fixed-point fractional library routines.
!                                                              (line 1076)
  * __satfractsqha:                        Fixed-point fractional library routines.
!                                                              (line 1077)
  * __satfractsqhq2:                       Fixed-point fractional library routines.
!                                                              (line 1075)
  * __satfractsqqq2:                       Fixed-point fractional library routines.
!                                                              (line 1074)
  * __satfractsqsa:                        Fixed-point fractional library routines.
!                                                              (line 1078)
  * __satfractsqta:                        Fixed-point fractional library routines.
!                                                              (line 1080)
  * __satfractsquda:                       Fixed-point fractional library routines.
!                                                              (line 1090)
  * __satfractsqudq:                       Fixed-point fractional library routines.
!                                                              (line 1086)
  * __satfractsquha:                       Fixed-point fractional library routines.
!                                                              (line 1088)
  * __satfractsquhq:                       Fixed-point fractional library routines.
!                                                              (line 1083)
  * __satfractsquqq:                       Fixed-point fractional library routines.
!                                                              (line 1082)
  * __satfractsqusa:                       Fixed-point fractional library routines.
!                                                              (line 1089)
  * __satfractsqusq:                       Fixed-point fractional library routines.
!                                                              (line 1084)
  * __satfractsquta:                       Fixed-point fractional library routines.
!                                                              (line 1092)
  * __satfracttada2:                       Fixed-point fractional library routines.
!                                                              (line 1175)
  * __satfracttadq:                        Fixed-point fractional library routines.
!                                                              (line 1172)
  * __satfracttaha2:                       Fixed-point fractional library routines.
!                                                              (line 1173)
  * __satfracttahq:                        Fixed-point fractional library routines.
!                                                              (line 1170)
  * __satfracttaqq:                        Fixed-point fractional library routines.
!                                                              (line 1169)
  * __satfracttasa2:                       Fixed-point fractional library routines.
!                                                              (line 1174)
  * __satfracttasq:                        Fixed-point fractional library routines.
!                                                              (line 1171)
  * __satfracttauda:                       Fixed-point fractional library routines.
!                                                              (line 1187)
  * __satfracttaudq:                       Fixed-point fractional library routines.
!                                                              (line 1182)
  * __satfracttauha:                       Fixed-point fractional library routines.
!                                                              (line 1184)
  * __satfracttauhq:                       Fixed-point fractional library routines.
!                                                              (line 1178)
  * __satfracttauqq:                       Fixed-point fractional library routines.
!                                                              (line 1177)
  * __satfracttausa:                       Fixed-point fractional library routines.
!                                                              (line 1185)
  * __satfracttausq:                       Fixed-point fractional library routines.
!                                                              (line 1180)
  * __satfracttauta:                       Fixed-point fractional library routines.
!                                                              (line 1189)
  * __satfracttida:                        Fixed-point fractional library routines.
!                                                              (line 1472)
  * __satfracttidq:                        Fixed-point fractional library routines.
!                                                              (line 1469)
  * __satfracttiha:                        Fixed-point fractional library routines.
!                                                              (line 1470)
  * __satfracttihq:                        Fixed-point fractional library routines.
!                                                              (line 1467)
  * __satfracttiqq:                        Fixed-point fractional library routines.
!                                                              (line 1466)
  * __satfracttisa:                        Fixed-point fractional library routines.
!                                                              (line 1471)
  * __satfracttisq:                        Fixed-point fractional library routines.
!                                                              (line 1468)
  * __satfracttita:                        Fixed-point fractional library routines.
!                                                              (line 1473)
  * __satfracttiuda:                       Fixed-point fractional library routines.
!                                                              (line 1481)
  * __satfracttiudq:                       Fixed-point fractional library routines.
!                                                              (line 1478)
  * __satfracttiuha:                       Fixed-point fractional library routines.
!                                                              (line 1479)
  * __satfracttiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1475)
  * __satfracttiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1474)
  * __satfracttiusa:                       Fixed-point fractional library routines.
!                                                              (line 1480)
  * __satfracttiusq:                       Fixed-point fractional library routines.
-                                                              (line 1476)
- * __satfracttiuta:                       Fixed-point fractional library routines.
                                                               (line 1483)
  * __satfractudada:                       Fixed-point fractional library routines.
!                                                              (line 1351)
  * __satfractudadq:                       Fixed-point fractional library routines.
!                                                              (line 1347)
  * __satfractudaha:                       Fixed-point fractional library routines.
!                                                              (line 1349)
  * __satfractudahq:                       Fixed-point fractional library routines.
!                                                              (line 1344)
  * __satfractudaqq:                       Fixed-point fractional library routines.
!                                                              (line 1343)
  * __satfractudasa:                       Fixed-point fractional library routines.
!                                                              (line 1350)
  * __satfractudasq:                       Fixed-point fractional library routines.
!                                                              (line 1345)
  * __satfractudata:                       Fixed-point fractional library routines.
!                                                              (line 1353)
  * __satfractudaudq:                      Fixed-point fractional library routines.
!                                                              (line 1361)
  * __satfractudauha2:                     Fixed-point fractional library routines.
!                                                              (line 1363)
  * __satfractudauhq:                      Fixed-point fractional library routines.
!                                                              (line 1357)
  * __satfractudauqq:                      Fixed-point fractional library routines.
!                                                              (line 1355)
  * __satfractudausa2:                     Fixed-point fractional library routines.
!                                                              (line 1365)
  * __satfractudausq:                      Fixed-point fractional library routines.
!                                                              (line 1359)
  * __satfractudauta2:                     Fixed-point fractional library routines.
!                                                              (line 1367)
  * __satfractudqda:                       Fixed-point fractional library routines.
!                                                              (line 1276)
  * __satfractudqdq:                       Fixed-point fractional library routines.
!                                                              (line 1271)
  * __satfractudqha:                       Fixed-point fractional library routines.
!                                                              (line 1273)
  * __satfractudqhq:                       Fixed-point fractional library routines.
!                                                              (line 1267)
  * __satfractudqqq:                       Fixed-point fractional library routines.
!                                                              (line 1266)
  * __satfractudqsa:                       Fixed-point fractional library routines.
!                                                              (line 1274)
  * __satfractudqsq:                       Fixed-point fractional library routines.
!                                                              (line 1269)
  * __satfractudqta:                       Fixed-point fractional library routines.
!                                                              (line 1278)
  * __satfractudquda:                      Fixed-point fractional library routines.
!                                                              (line 1290)
  * __satfractudquha:                      Fixed-point fractional library routines.
!                                                              (line 1286)
  * __satfractudquhq2:                     Fixed-point fractional library routines.
!                                                              (line 1282)
  * __satfractudquqq2:                     Fixed-point fractional library routines.
!                                                              (line 1280)
  * __satfractudqusa:                      Fixed-point fractional library routines.
!                                                              (line 1288)
  * __satfractudqusq2:                     Fixed-point fractional library routines.
!                                                              (line 1284)
  * __satfractudquta:                      Fixed-point fractional library routines.
!                                                              (line 1292)
  * __satfractuhada:                       Fixed-point fractional library routines.
!                                                              (line 1304)
  * __satfractuhadq:                       Fixed-point fractional library routines.
!                                                              (line 1299)
  * __satfractuhaha:                       Fixed-point fractional library routines.
!                                                              (line 1301)
  * __satfractuhahq:                       Fixed-point fractional library routines.
!                                                              (line 1295)
  * __satfractuhaqq:                       Fixed-point fractional library routines.
!                                                              (line 1294)
  * __satfractuhasa:                       Fixed-point fractional library routines.
!                                                              (line 1302)
  * __satfractuhasq:                       Fixed-point fractional library routines.
!                                                              (line 1297)
  * __satfractuhata:                       Fixed-point fractional library routines.
!                                                              (line 1306)
  * __satfractuhauda2:                     Fixed-point fractional library routines.
!                                                              (line 1318)
  * __satfractuhaudq:                      Fixed-point fractional library routines.
!                                                              (line 1314)
  * __satfractuhauhq:                      Fixed-point fractional library routines.
!                                                              (line 1310)
  * __satfractuhauqq:                      Fixed-point fractional library routines.
!                                                              (line 1308)
  * __satfractuhausa2:                     Fixed-point fractional library routines.
!                                                              (line 1316)
  * __satfractuhausq:                      Fixed-point fractional library routines.
!                                                              (line 1312)
  * __satfractuhauta2:                     Fixed-point fractional library routines.
!                                                              (line 1320)
  * __satfractuhqda:                       Fixed-point fractional library routines.
!                                                              (line 1224)
  * __satfractuhqdq:                       Fixed-point fractional library routines.
!                                                              (line 1221)
  * __satfractuhqha:                       Fixed-point fractional library routines.
!                                                              (line 1222)
  * __satfractuhqhq:                       Fixed-point fractional library routines.
!                                                              (line 1219)
  * __satfractuhqqq:                       Fixed-point fractional library routines.
!                                                              (line 1218)
  * __satfractuhqsa:                       Fixed-point fractional library routines.
!                                                              (line 1223)
  * __satfractuhqsq:                       Fixed-point fractional library routines.
!                                                              (line 1220)
  * __satfractuhqta:                       Fixed-point fractional library routines.
!                                                              (line 1225)
  * __satfractuhquda:                      Fixed-point fractional library routines.
!                                                              (line 1236)
  * __satfractuhqudq2:                     Fixed-point fractional library routines.
!                                                              (line 1231)
  * __satfractuhquha:                      Fixed-point fractional library routines.
!                                                              (line 1233)
  * __satfractuhquqq2:                     Fixed-point fractional library routines.
!                                                              (line 1227)
  * __satfractuhqusa:                      Fixed-point fractional library routines.
!                                                              (line 1234)
  * __satfractuhqusq2:                     Fixed-point fractional library routines.
!                                                              (line 1229)
  * __satfractuhquta:                      Fixed-point fractional library routines.
!                                                              (line 1238)
  * __satfractunsdida:                     Fixed-point fractional library routines.
!                                                              (line 1834)
  * __satfractunsdidq:                     Fixed-point fractional library routines.
!                                                              (line 1831)
  * __satfractunsdiha:                     Fixed-point fractional library routines.
!                                                              (line 1832)
  * __satfractunsdihq:                     Fixed-point fractional library routines.
!                                                              (line 1828)
  * __satfractunsdiqq:                     Fixed-point fractional library routines.
!                                                              (line 1827)
  * __satfractunsdisa:                     Fixed-point fractional library routines.
!                                                              (line 1833)
  * __satfractunsdisq:                     Fixed-point fractional library routines.
-                                                              (line 1829)
- * __satfractunsdita:                     Fixed-point fractional library routines.
                                                               (line 1836)
  * __satfractunsdiuda:                    Fixed-point fractional library routines.
!                                                              (line 1850)
  * __satfractunsdiudq:                    Fixed-point fractional library routines.
!                                                              (line 1844)
  * __satfractunsdiuha:                    Fixed-point fractional library routines.
!                                                              (line 1846)
  * __satfractunsdiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1840)
  * __satfractunsdiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1838)
  * __satfractunsdiusa:                    Fixed-point fractional library routines.
!                                                              (line 1848)
  * __satfractunsdiusq:                    Fixed-point fractional library routines.
!                                                              (line 1842)
  * __satfractunsdiuta:                    Fixed-point fractional library routines.
!                                                              (line 1852)
  * __satfractunshida:                     Fixed-point fractional library routines.
!                                                              (line 1786)
  * __satfractunshidq:                     Fixed-point fractional library routines.
!                                                              (line 1783)
  * __satfractunshiha:                     Fixed-point fractional library routines.
!                                                              (line 1784)
  * __satfractunshihq:                     Fixed-point fractional library routines.
!                                                              (line 1780)
  * __satfractunshiqq:                     Fixed-point fractional library routines.
!                                                              (line 1779)
  * __satfractunshisa:                     Fixed-point fractional library routines.
!                                                              (line 1785)
  * __satfractunshisq:                     Fixed-point fractional library routines.
-                                                              (line 1781)
- * __satfractunshita:                     Fixed-point fractional library routines.
                                                               (line 1788)
  * __satfractunshiuda:                    Fixed-point fractional library routines.
!                                                              (line 1802)
  * __satfractunshiudq:                    Fixed-point fractional library routines.
!                                                              (line 1796)
  * __satfractunshiuha:                    Fixed-point fractional library routines.
!                                                              (line 1798)
  * __satfractunshiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1792)
  * __satfractunshiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1790)
  * __satfractunshiusa:                    Fixed-point fractional library routines.
!                                                              (line 1800)
  * __satfractunshiusq:                    Fixed-point fractional library routines.
!                                                              (line 1794)
  * __satfractunshiuta:                    Fixed-point fractional library routines.
!                                                              (line 1804)
  * __satfractunsqida:                     Fixed-point fractional library routines.
!                                                              (line 1760)
  * __satfractunsqidq:                     Fixed-point fractional library routines.
!                                                              (line 1757)
  * __satfractunsqiha:                     Fixed-point fractional library routines.
!                                                              (line 1758)
  * __satfractunsqihq:                     Fixed-point fractional library routines.
!                                                              (line 1754)
  * __satfractunsqiqq:                     Fixed-point fractional library routines.
!                                                              (line 1753)
  * __satfractunsqisa:                     Fixed-point fractional library routines.
!                                                              (line 1759)
  * __satfractunsqisq:                     Fixed-point fractional library routines.
-                                                              (line 1755)
- * __satfractunsqita:                     Fixed-point fractional library routines.
                                                               (line 1762)
  * __satfractunsqiuda:                    Fixed-point fractional library routines.
!                                                              (line 1776)
  * __satfractunsqiudq:                    Fixed-point fractional library routines.
!                                                              (line 1770)
  * __satfractunsqiuha:                    Fixed-point fractional library routines.
!                                                              (line 1772)
  * __satfractunsqiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1766)
  * __satfractunsqiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1764)
  * __satfractunsqiusa:                    Fixed-point fractional library routines.
!                                                              (line 1774)
  * __satfractunsqiusq:                    Fixed-point fractional library routines.
!                                                              (line 1768)
  * __satfractunsqiuta:                    Fixed-point fractional library routines.
!                                                              (line 1778)
  * __satfractunssida:                     Fixed-point fractional library routines.
!                                                              (line 1811)
  * __satfractunssidq:                     Fixed-point fractional library routines.
!                                                              (line 1808)
  * __satfractunssiha:                     Fixed-point fractional library routines.
!                                                              (line 1809)
  * __satfractunssihq:                     Fixed-point fractional library routines.
!                                                              (line 1806)
  * __satfractunssiqq:                     Fixed-point fractional library routines.
!                                                              (line 1805)
  * __satfractunssisa:                     Fixed-point fractional library routines.
!                                                              (line 1810)
  * __satfractunssisq:                     Fixed-point fractional library routines.
!                                                              (line 1807)
  * __satfractunssita:                     Fixed-point fractional library routines.
!                                                              (line 1812)
  * __satfractunssiuda:                    Fixed-point fractional library routines.
!                                                              (line 1824)
  * __satfractunssiudq:                    Fixed-point fractional library routines.
!                                                              (line 1819)
  * __satfractunssiuha:                    Fixed-point fractional library routines.
!                                                              (line 1821)
  * __satfractunssiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1815)
  * __satfractunssiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1814)
  * __satfractunssiusa:                    Fixed-point fractional library routines.
!                                                              (line 1822)
  * __satfractunssiusq:                    Fixed-point fractional library routines.
!                                                              (line 1817)
  * __satfractunssiuta:                    Fixed-point fractional library routines.
!                                                              (line 1826)
  * __satfractunstida:                     Fixed-point fractional library routines.
!                                                              (line 1864)
  * __satfractunstidq:                     Fixed-point fractional library routines.
!                                                              (line 1859)
  * __satfractunstiha:                     Fixed-point fractional library routines.
!                                                              (line 1861)
  * __satfractunstihq:                     Fixed-point fractional library routines.
!                                                              (line 1855)
  * __satfractunstiqq:                     Fixed-point fractional library routines.
!                                                              (line 1854)
  * __satfractunstisa:                     Fixed-point fractional library routines.
!                                                              (line 1862)
  * __satfractunstisq:                     Fixed-point fractional library routines.
!                                                              (line 1857)
  * __satfractunstita:                     Fixed-point fractional library routines.
!                                                              (line 1866)
  * __satfractunstiuda:                    Fixed-point fractional library routines.
!                                                              (line 1880)
  * __satfractunstiudq:                    Fixed-point fractional library routines.
!                                                              (line 1874)
  * __satfractunstiuha:                    Fixed-point fractional library routines.
!                                                              (line 1876)
  * __satfractunstiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1870)
  * __satfractunstiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1868)
  * __satfractunstiusa:                    Fixed-point fractional library routines.
!                                                              (line 1878)
  * __satfractunstiusq:                    Fixed-point fractional library routines.
!                                                              (line 1872)
  * __satfractunstiuta:                    Fixed-point fractional library routines.
!                                                              (line 1882)
  * __satfractuqqda:                       Fixed-point fractional library routines.
!                                                              (line 1201)
  * __satfractuqqdq:                       Fixed-point fractional library routines.
!                                                              (line 1196)
  * __satfractuqqha:                       Fixed-point fractional library routines.
!                                                              (line 1198)
  * __satfractuqqhq:                       Fixed-point fractional library routines.
!                                                              (line 1192)
  * __satfractuqqqq:                       Fixed-point fractional library routines.
!                                                              (line 1191)
  * __satfractuqqsa:                       Fixed-point fractional library routines.
!                                                              (line 1199)
  * __satfractuqqsq:                       Fixed-point fractional library routines.
!                                                              (line 1194)
  * __satfractuqqta:                       Fixed-point fractional library routines.
!                                                              (line 1203)
  * __satfractuqquda:                      Fixed-point fractional library routines.
!                                                              (line 1215)
  * __satfractuqqudq2:                     Fixed-point fractional library routines.
!                                                              (line 1209)
  * __satfractuqquha:                      Fixed-point fractional library routines.
!                                                              (line 1211)
  * __satfractuqquhq2:                     Fixed-point fractional library routines.
!                                                              (line 1205)
  * __satfractuqqusa:                      Fixed-point fractional library routines.
!                                                              (line 1213)
  * __satfractuqqusq2:                     Fixed-point fractional library routines.
!                                                              (line 1207)
  * __satfractuqquta:                      Fixed-point fractional library routines.
!                                                              (line 1217)
  * __satfractusada:                       Fixed-point fractional library routines.
!                                                              (line 1327)
  * __satfractusadq:                       Fixed-point fractional library routines.
!                                                              (line 1324)
  * __satfractusaha:                       Fixed-point fractional library routines.
!                                                              (line 1325)
  * __satfractusahq:                       Fixed-point fractional library routines.
!                                                              (line 1322)
  * __satfractusaqq:                       Fixed-point fractional library routines.
!                                                              (line 1321)
  * __satfractusasa:                       Fixed-point fractional library routines.
!                                                              (line 1326)
  * __satfractusasq:                       Fixed-point fractional library routines.
!                                                              (line 1323)
  * __satfractusata:                       Fixed-point fractional library routines.
!                                                              (line 1328)
  * __satfractusauda2:                     Fixed-point fractional library routines.
!                                                              (line 1339)
  * __satfractusaudq:                      Fixed-point fractional library routines.
!                                                              (line 1335)
  * __satfractusauha2:                     Fixed-point fractional library routines.
!                                                              (line 1337)
  * __satfractusauhq:                      Fixed-point fractional library routines.
!                                                              (line 1331)
  * __satfractusauqq:                      Fixed-point fractional library routines.
!                                                              (line 1330)
  * __satfractusausq:                      Fixed-point fractional library routines.
!                                                              (line 1333)
  * __satfractusauta2:                     Fixed-point fractional library routines.
!                                                              (line 1341)
  * __satfractusqda:                       Fixed-point fractional library routines.
!                                                              (line 1248)
  * __satfractusqdq:                       Fixed-point fractional library routines.
!                                                              (line 1244)
  * __satfractusqha:                       Fixed-point fractional library routines.
!                                                              (line 1246)
  * __satfractusqhq:                       Fixed-point fractional library routines.
!                                                              (line 1241)
  * __satfractusqqq:                       Fixed-point fractional library routines.
!                                                              (line 1240)
  * __satfractusqsa:                       Fixed-point fractional library routines.
!                                                              (line 1247)
  * __satfractusqsq:                       Fixed-point fractional library routines.
!                                                              (line 1242)
  * __satfractusqta:                       Fixed-point fractional library routines.
!                                                              (line 1250)
  * __satfractusquda:                      Fixed-point fractional library routines.
!                                                              (line 1262)
  * __satfractusqudq2:                     Fixed-point fractional library routines.
!                                                              (line 1256)
  * __satfractusquha:                      Fixed-point fractional library routines.
!                                                              (line 1258)
  * __satfractusquhq2:                     Fixed-point fractional library routines.
!                                                              (line 1254)
  * __satfractusquqq2:                     Fixed-point fractional library routines.
!                                                              (line 1252)
  * __satfractusqusa:                      Fixed-point fractional library routines.
!                                                              (line 1260)
  * __satfractusquta:                      Fixed-point fractional library routines.
!                                                              (line 1264)
  * __satfractutada:                       Fixed-point fractional library routines.
!                                                              (line 1379)
  * __satfractutadq:                       Fixed-point fractional library routines.
!                                                              (line 1374)
  * __satfractutaha:                       Fixed-point fractional library routines.
!                                                              (line 1376)
  * __satfractutahq:                       Fixed-point fractional library routines.
!                                                              (line 1370)
  * __satfractutaqq:                       Fixed-point fractional library routines.
!                                                              (line 1369)
  * __satfractutasa:                       Fixed-point fractional library routines.
!                                                              (line 1377)
  * __satfractutasq:                       Fixed-point fractional library routines.
!                                                              (line 1372)
  * __satfractutata:                       Fixed-point fractional library routines.
!                                                              (line 1381)
  * __satfractutauda2:                     Fixed-point fractional library routines.
!                                                              (line 1395)
  * __satfractutaudq:                      Fixed-point fractional library routines.
!                                                              (line 1389)
  * __satfractutauha2:                     Fixed-point fractional library routines.
!                                                              (line 1391)
  * __satfractutauhq:                      Fixed-point fractional library routines.
!                                                              (line 1385)
  * __satfractutauqq:                      Fixed-point fractional library routines.
!                                                              (line 1383)
  * __satfractutausa2:                     Fixed-point fractional library routines.
!                                                              (line 1393)
  * __satfractutausq:                      Fixed-point fractional library routines.
!                                                              (line 1387)
  * __splitstack_find:                     Miscellaneous routines.
!                                                              (line   18)
  * __ssaddda3:                            Fixed-point fractional library routines.
!                                                              (line   67)
  * __ssadddq3:                            Fixed-point fractional library routines.
!                                                              (line   63)
  * __ssaddha3:                            Fixed-point fractional library routines.
!                                                              (line   65)
  * __ssaddhq3:                            Fixed-point fractional library routines.
!                                                              (line   60)
  * __ssaddqq3:                            Fixed-point fractional library routines.
!                                                              (line   59)
  * __ssaddsa3:                            Fixed-point fractional library routines.
!                                                              (line   66)
  * __ssaddsq3:                            Fixed-point fractional library routines.
!                                                              (line   61)
  * __ssaddta3:                            Fixed-point fractional library routines.
!                                                              (line   69)
  * __ssashlda3:                           Fixed-point fractional library routines.
!                                                              (line  402)
  * __ssashldq3:                           Fixed-point fractional library routines.
!                                                              (line  399)
  * __ssashlha3:                           Fixed-point fractional library routines.
!                                                              (line  400)
  * __ssashlhq3:                           Fixed-point fractional library routines.
!                                                              (line  396)
  * __ssashlsa3:                           Fixed-point fractional library routines.
!                                                              (line  401)
  * __ssashlsq3:                           Fixed-point fractional library routines.
-                                                              (line  397)
- * __ssashlta3:                           Fixed-point fractional library routines.
                                                               (line  404)
  * __ssdivda3:                            Fixed-point fractional library routines.
!                                                              (line  261)
  * __ssdivdq3:                            Fixed-point fractional library routines.
!                                                              (line  257)
  * __ssdivha3:                            Fixed-point fractional library routines.
!                                                              (line  259)
  * __ssdivhq3:                            Fixed-point fractional library routines.
!                                                              (line  254)
  * __ssdivqq3:                            Fixed-point fractional library routines.
!                                                              (line  253)
  * __ssdivsa3:                            Fixed-point fractional library routines.
!                                                              (line  260)
  * __ssdivsq3:                            Fixed-point fractional library routines.
!                                                              (line  255)
  * __ssdivta3:                            Fixed-point fractional library routines.
!                                                              (line  263)
  * __ssmulda3:                            Fixed-point fractional library routines.
!                                                              (line  193)
  * __ssmuldq3:                            Fixed-point fractional library routines.
!                                                              (line  189)
  * __ssmulha3:                            Fixed-point fractional library routines.
!                                                              (line  191)
  * __ssmulhq3:                            Fixed-point fractional library routines.
!                                                              (line  186)
  * __ssmulqq3:                            Fixed-point fractional library routines.
!                                                              (line  185)
  * __ssmulsa3:                            Fixed-point fractional library routines.
!                                                              (line  192)
  * __ssmulsq3:                            Fixed-point fractional library routines.
!                                                              (line  187)
  * __ssmulta3:                            Fixed-point fractional library routines.
!                                                              (line  195)
  * __ssnegda2:                            Fixed-point fractional library routines.
!                                                              (line  316)
  * __ssnegdq2:                            Fixed-point fractional library routines.
!                                                              (line  313)
  * __ssnegha2:                            Fixed-point fractional library routines.
!                                                              (line  314)
  * __ssneghq2:                            Fixed-point fractional library routines.
!                                                              (line  311)
  * __ssnegqq2:                            Fixed-point fractional library routines.
!                                                              (line  310)
  * __ssnegsa2:                            Fixed-point fractional library routines.
!                                                              (line  315)
  * __ssnegsq2:                            Fixed-point fractional library routines.
!                                                              (line  312)
  * __ssnegta2:                            Fixed-point fractional library routines.
!                                                              (line  317)
  * __sssubda3:                            Fixed-point fractional library routines.
!                                                              (line  129)
  * __sssubdq3:                            Fixed-point fractional library routines.
!                                                              (line  125)
  * __sssubha3:                            Fixed-point fractional library routines.
!                                                              (line  127)
  * __sssubhq3:                            Fixed-point fractional library routines.
!                                                              (line  122)
  * __sssubqq3:                            Fixed-point fractional library routines.
!                                                              (line  121)
  * __sssubsa3:                            Fixed-point fractional library routines.
!                                                              (line  128)
  * __sssubsq3:                            Fixed-point fractional library routines.
!                                                              (line  123)
  * __sssubta3:                            Fixed-point fractional library routines.
!                                                              (line  131)
  * __subda3:                              Fixed-point fractional library routines.
!                                                              (line  107)
  * __subdf3:                              Soft float library routines.
!                                                              (line   31)
  * __subdq3:                              Fixed-point fractional library routines.
!                                                              (line   95)
  * __subha3:                              Fixed-point fractional library routines.
!                                                              (line  105)
  * __subhq3:                              Fixed-point fractional library routines.
!                                                              (line   92)
  * __subqq3:                              Fixed-point fractional library routines.
!                                                              (line   91)
  * __subsa3:                              Fixed-point fractional library routines.
!                                                              (line  106)
  * __subsf3:                              Soft float library routines.
!                                                              (line   30)
  * __subsq3:                              Fixed-point fractional library routines.
!                                                              (line   93)
  * __subta3:                              Fixed-point fractional library routines.
!                                                              (line  109)
  * __subtf3:                              Soft float library routines.
!                                                              (line   33)
  * __subuda3:                             Fixed-point fractional library routines.
!                                                              (line  115)
  * __subudq3:                             Fixed-point fractional library routines.
!                                                              (line  103)
  * __subuha3:                             Fixed-point fractional library routines.
!                                                              (line  111)
  * __subuhq3:                             Fixed-point fractional library routines.
!                                                              (line   99)
  * __subuqq3:                             Fixed-point fractional library routines.
!                                                              (line   97)
  * __subusa3:                             Fixed-point fractional library routines.
!                                                              (line  113)
  * __subusq3:                             Fixed-point fractional library routines.
!                                                              (line  101)
  * __subuta3:                             Fixed-point fractional library routines.
-                                                              (line  117)
- * __subvdi3:                             Integer library routines.
                                                               (line  123)
! * __subvsi3:                             Integer library routines.
                                                               (line  122)
  * __subxf3:                              Soft float library routines.
!                                                              (line   35)
  * __truncdfsf2:                          Soft float library routines.
!                                                              (line   76)
  * __trunctfdf2:                          Soft float library routines.
!                                                              (line   73)
  * __trunctfsf2:                          Soft float library routines.
!                                                              (line   75)
  * __truncxfdf2:                          Soft float library routines.
!                                                              (line   72)
  * __truncxfsf2:                          Soft float library routines.
!                                                              (line   74)
  * __ucmpdi2:                             Integer library routines.
!                                                              (line   93)
  * __ucmpti2:                             Integer library routines.
!                                                              (line   95)
  * __udivdi3:                             Integer library routines.
!                                                              (line   54)
  * __udivmoddi4:                          Integer library routines.
!                                                              (line   61)
  * __udivmodti4:                          Integer library routines.
!                                                              (line   63)
  * __udivsi3:                             Integer library routines.
!                                                              (line   52)
  * __udivti3:                             Integer library routines.
!                                                              (line   56)
  * __udivuda3:                            Fixed-point fractional library routines.
!                                                              (line  246)
  * __udivudq3:                            Fixed-point fractional library routines.
!                                                              (line  240)
  * __udivuha3:                            Fixed-point fractional library routines.
!                                                              (line  242)
  * __udivuhq3:                            Fixed-point fractional library routines.
!                                                              (line  236)
  * __udivuqq3:                            Fixed-point fractional library routines.
!                                                              (line  234)
  * __udivusa3:                            Fixed-point fractional library routines.
!                                                              (line  244)
  * __udivusq3:                            Fixed-point fractional library routines.
!                                                              (line  238)
  * __udivuta3:                            Fixed-point fractional library routines.
!                                                              (line  248)
  * __umoddi3:                             Integer library routines.
-                                                              (line   71)
- * __umodsi3:                             Integer library routines.
                                                               (line   69)
  * __umodti3:                             Integer library routines.
!                                                              (line   73)
  * __unorddf2:                            Soft float library routines.
-                                                              (line  173)
- * __unordsf2:                            Soft float library routines.
                                                               (line  172)
  * __unordtf2:                            Soft float library routines.
!                                                              (line  174)
  * __usadduda3:                           Fixed-point fractional library routines.
!                                                              (line   85)
  * __usaddudq3:                           Fixed-point fractional library routines.
!                                                              (line   79)
  * __usadduha3:                           Fixed-point fractional library routines.
!                                                              (line   81)
  * __usadduhq3:                           Fixed-point fractional library routines.
!                                                              (line   75)
  * __usadduqq3:                           Fixed-point fractional library routines.
!                                                              (line   73)
  * __usaddusa3:                           Fixed-point fractional library routines.
!                                                              (line   83)
  * __usaddusq3:                           Fixed-point fractional library routines.
!                                                              (line   77)
  * __usadduta3:                           Fixed-point fractional library routines.
!                                                              (line   87)
  * __usashluda3:                          Fixed-point fractional library routines.
!                                                              (line  421)
  * __usashludq3:                          Fixed-point fractional library routines.
!                                                              (line  415)
  * __usashluha3:                          Fixed-point fractional library routines.
!                                                              (line  417)
  * __usashluhq3:                          Fixed-point fractional library routines.
!                                                              (line  411)
  * __usashluqq3:                          Fixed-point fractional library routines.
!                                                              (line  409)
  * __usashlusa3:                          Fixed-point fractional library routines.
!                                                              (line  419)
  * __usashlusq3:                          Fixed-point fractional library routines.
!                                                              (line  413)
  * __usashluta3:                          Fixed-point fractional library routines.
!                                                              (line  423)
  * __usdivuda3:                           Fixed-point fractional library routines.
!                                                              (line  280)
  * __usdivudq3:                           Fixed-point fractional library routines.
!                                                              (line  274)
  * __usdivuha3:                           Fixed-point fractional library routines.
!                                                              (line  276)
  * __usdivuhq3:                           Fixed-point fractional library routines.
!                                                              (line  270)
  * __usdivuqq3:                           Fixed-point fractional library routines.
!                                                              (line  268)
  * __usdivusa3:                           Fixed-point fractional library routines.
!                                                              (line  278)
  * __usdivusq3:                           Fixed-point fractional library routines.
!                                                              (line  272)
  * __usdivuta3:                           Fixed-point fractional library routines.
!                                                              (line  282)
  * __usmuluda3:                           Fixed-point fractional library routines.
!                                                              (line  212)
  * __usmuludq3:                           Fixed-point fractional library routines.
!                                                              (line  206)
  * __usmuluha3:                           Fixed-point fractional library routines.
!                                                              (line  208)
  * __usmuluhq3:                           Fixed-point fractional library routines.
!                                                              (line  202)
  * __usmuluqq3:                           Fixed-point fractional library routines.
!                                                              (line  200)
  * __usmulusa3:                           Fixed-point fractional library routines.
!                                                              (line  210)
  * __usmulusq3:                           Fixed-point fractional library routines.
!                                                              (line  204)
  * __usmuluta3:                           Fixed-point fractional library routines.
!                                                              (line  214)
  * __usneguda2:                           Fixed-point fractional library routines.
!                                                              (line  331)
  * __usnegudq2:                           Fixed-point fractional library routines.
!                                                              (line  326)
  * __usneguha2:                           Fixed-point fractional library routines.
!                                                              (line  328)
  * __usneguhq2:                           Fixed-point fractional library routines.
!                                                              (line  322)
  * __usneguqq2:                           Fixed-point fractional library routines.
!                                                              (line  321)
  * __usnegusa2:                           Fixed-point fractional library routines.
!                                                              (line  329)
  * __usnegusq2:                           Fixed-point fractional library routines.
!                                                              (line  324)
  * __usneguta2:                           Fixed-point fractional library routines.
!                                                              (line  333)
  * __ussubuda3:                           Fixed-point fractional library routines.
!                                                              (line  148)
  * __ussubudq3:                           Fixed-point fractional library routines.
!                                                              (line  142)
  * __ussubuha3:                           Fixed-point fractional library routines.
!                                                              (line  144)
  * __ussubuhq3:                           Fixed-point fractional library routines.
!                                                              (line  138)
  * __ussubuqq3:                           Fixed-point fractional library routines.
!                                                              (line  136)
  * __ussubusa3:                           Fixed-point fractional library routines.
!                                                              (line  146)
  * __ussubusq3:                           Fixed-point fractional library routines.
!                                                              (line  140)
  * __ussubuta3:                           Fixed-point fractional library routines.
!                                                              (line  150)
! * abort:                                 Portability.        (line   21)
! * abs:                                   Arithmetic.         (line  199)
! * abs and attributes:                    Expressions.        (line   85)
  * ABS_EXPR:                              Unary and Binary Expressions.
                                                               (line    6)
- * absence_set:                           Processor pipeline description.
-                                                              (line  224)
- * absM2 instruction pattern:             Standard Names.     (line  587)
- * absolute value:                        Arithmetic.         (line  199)
  * access to operands:                    Accessors.          (line    6)
  * access to special operands:            Special Accessors.  (line    6)
  * accessors:                             Accessors.          (line    6)
! * ACCUM_TYPE_SIZE:                       Type Layout.        (line   88)
! * ACCUMULATE_OUTGOING_ARGS:              Stack Arguments.    (line   49)
! * ACCUMULATE_OUTGOING_ARGS and stack frames: Function Entry. (line  135)
! * ADA_LONG_TYPE_SIZE:                    Type Layout.        (line   26)
  * Adding a new GIMPLE statement code:    Adding a new GIMPLE statement code.
                                                               (line    6)
! * ADDITIONAL_REGISTER_NAMES:             Instruction Output. (line   15)
! * addM3 instruction pattern:             Standard Names.     (line  263)
! * addMODEcc instruction pattern:         Standard Names.     (line 1117)
! * addptrM3 instruction pattern:          Standard Names.     (line  293)
! * addr_diff_vec:                         Side Effects.       (line  315)
  * addr_diff_vec, length of:              Insn Lengths.       (line   26)
  * ADDR_EXPR:                             Storage References. (line    6)
! * addr_vec:                              Side Effects.       (line  310)
  * addr_vec, length of:                   Insn Lengths.       (line   26)
! * address constraints:                   Simple Constraints. (line  164)
! * address_operand <1>:                   Simple Constraints. (line  168)
! * address_operand:                       Machine-Independent Predicates.
!                                                              (line   63)
! * addressing modes:                      Addressing Modes.   (line    6)
! * addvM4 instruction pattern:            Standard Names.     (line  279)
! * ADJUST_FIELD_ALIGN:                    Storage Layout.     (line  197)
  * ADJUST_INSN_LENGTH:                    Insn Lengths.       (line   41)
! * ADJUST_REG_ALLOC_ORDER:                Allocation Order.   (line   23)
  * aggregates as return values:           Aggregate Return.   (line    6)
  * alias:                                 Alias analysis.     (line    6)
  * ALL_REGS:                              Register Classes.   (line   17)
- * allocate_stack instruction pattern:    Standard Names.     (line 1434)
  * alternate entry points:                Insns.              (line  146)
  * anchored addresses:                    Anchored Addresses. (line    6)
! * and:                                   Arithmetic.         (line  157)
  * and and attributes:                    Expressions.        (line   50)
  * and, canonicalization of:              Insn Canonicalizations.
!                                                              (line   52)
! * andM3 instruction pattern:             Standard Names.     (line  269)
  * ANNOTATE_EXPR:                         Unary and Binary Expressions.
                                                               (line    6)
  * annotations:                           Annotations.        (line    6)
  * APPLY_RESULT_SIZE:                     Scalar Return.      (line  112)
! * ARG_POINTER_CFA_OFFSET:                Frame Layout.       (line  196)
! * ARG_POINTER_REGNUM:                    Frame Registers.    (line   41)
! * ARG_POINTER_REGNUM and virtual registers: Regs and Memory. (line   65)
! * arg_pointer_rtx:                       Frame Registers.    (line  104)
! * ARGS_GROW_DOWNWARD:                    Frame Layout.       (line   35)
  * argument passing:                      Interface.          (line   36)
  * arguments in registers:                Register Arguments. (line    6)
  * arguments on stack:                    Stack Arguments.    (line    6)
  * arithmetic library:                    Soft float library routines.
                                                               (line    6)
! * arithmetic shift:                      Arithmetic.         (line  172)
! * arithmetic shift with signed saturation: Arithmetic.       (line  172)
! * arithmetic shift with unsigned saturation: Arithmetic.     (line  172)
  * arithmetic, in RTL:                    Arithmetic.         (line    6)
! * ARITHMETIC_TYPE_P:                     Types for C++.      (line   61)
  * array:                                 Types.              (line    6)
  * ARRAY_RANGE_REF:                       Storage References. (line    6)
  * ARRAY_REF:                             Storage References. (line    6)
  * ARRAY_TYPE:                            Types.              (line    6)
! * AS_NEEDS_DASH_FOR_PIPED_INPUT:         Driver.             (line   89)
! * ashift:                                Arithmetic.         (line  172)
! * ashift and attributes:                 Expressions.        (line   85)
! * ashiftrt:                              Arithmetic.         (line  189)
! * ashiftrt and attributes:               Expressions.        (line   85)
! * ashlM3 instruction pattern:            Standard Names.     (line  558)
! * ashrM3 instruction pattern:            Standard Names.     (line  568)
! * ASM_APP_OFF:                           File Framework.     (line   78)
! * ASM_APP_ON:                            File Framework.     (line   71)
! * ASM_COMMENT_START:                     File Framework.     (line   66)
! * ASM_DECLARE_FUNCTION_NAME:             Label Output.       (line  111)
! * ASM_DECLARE_FUNCTION_SIZE:             Label Output.       (line  126)
! * ASM_DECLARE_OBJECT_NAME:               Label Output.       (line  139)
! * ASM_DECLARE_REGISTER_GLOBAL:           Label Output.       (line  168)
! * ASM_FINAL_SPEC:                        Driver.             (line   82)
! * ASM_FINISH_DECLARE_OBJECT:             Label Output.       (line  176)
! * ASM_FORMAT_PRIVATE_NAME:               Label Output.       (line  402)
! * asm_fprintf:                           Instruction Output. (line  151)
! * ASM_FPRINTF_EXTENSIONS:                Instruction Output. (line  162)
! * ASM_GENERATE_INTERNAL_LABEL:           Label Output.       (line  386)
! * asm_input:                             Side Effects.       (line  297)
  * asm_input and /v:                      Flags.              (line   76)
! * ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX:     Exception Handling. (line   82)
! * ASM_NO_SKIP_IN_TEXT:                   Alignment Output.   (line   79)
! * asm_noperands:                         Insns.              (line  308)
  * asm_operands and /v:                   Flags.              (line   76)
  * asm_operands, RTL sharing:             Sharing.            (line   45)
  * asm_operands, usage:                   Assembler.          (line    6)
! * ASM_OUTPUT_ADDR_DIFF_ELT:              Dispatch Tables.    (line    9)
! * ASM_OUTPUT_ADDR_VEC_ELT:               Dispatch Tables.    (line   26)
! * ASM_OUTPUT_ALIGN:                      Alignment Output.   (line   86)
! * ASM_OUTPUT_ALIGN_WITH_NOP:             Alignment Output.   (line   91)
! * ASM_OUTPUT_ALIGNED_BSS:                Uninitialized Data. (line   46)
! * ASM_OUTPUT_ALIGNED_COMMON:             Uninitialized Data. (line   30)
! * ASM_OUTPUT_ALIGNED_DECL_COMMON:        Uninitialized Data. (line   38)
! * ASM_OUTPUT_ALIGNED_DECL_LOCAL:         Uninitialized Data. (line   91)
! * ASM_OUTPUT_ALIGNED_LOCAL:              Uninitialized Data. (line   83)
! * ASM_OUTPUT_ASCII:                      Data Output.        (line   55)
! * ASM_OUTPUT_CASE_END:                   Dispatch Tables.    (line   51)
! * ASM_OUTPUT_CASE_LABEL:                 Dispatch Tables.    (line   38)
! * ASM_OUTPUT_COMMON:                     Uninitialized Data. (line   10)
! * ASM_OUTPUT_DEBUG_LABEL:                Label Output.       (line  374)
! * ASM_OUTPUT_DEF:                        Label Output.       (line  423)
! * ASM_OUTPUT_DEF_FROM_DECLS:             Label Output.       (line  431)
! * ASM_OUTPUT_DWARF_DELTA:                SDB and DWARF.      (line   78)
! * ASM_OUTPUT_DWARF_OFFSET:               SDB and DWARF.      (line   87)
! * ASM_OUTPUT_DWARF_PCREL:                SDB and DWARF.      (line   93)
! * ASM_OUTPUT_DWARF_TABLE_REF:            SDB and DWARF.      (line   98)
! * ASM_OUTPUT_DWARF_VMS_DELTA:            SDB and DWARF.      (line   82)
! * ASM_OUTPUT_EXTERNAL:                   Label Output.       (line  303)
! * ASM_OUTPUT_FDESC:                      Data Output.        (line   64)
! * ASM_OUTPUT_FUNCTION_LABEL:             Label Output.       (line   17)
! * ASM_OUTPUT_INTERNAL_LABEL:             Label Output.       (line   29)
! * ASM_OUTPUT_LABEL:                      Label Output.       (line    9)
! * ASM_OUTPUT_LABEL_REF:                  Label Output.       (line  347)
! * ASM_OUTPUT_LABELREF:                   Label Output.       (line  325)
! * ASM_OUTPUT_LOCAL:                      Uninitialized Data. (line   70)
! * ASM_OUTPUT_MAX_SKIP_ALIGN:             Alignment Output.   (line   95)
! * ASM_OUTPUT_MEASURED_SIZE:              Label Output.       (line   53)
! * ASM_OUTPUT_OPCODE:                     Instruction Output. (line   36)
! * ASM_OUTPUT_POOL_EPILOGUE:              Data Output.        (line  114)
! * ASM_OUTPUT_POOL_PROLOGUE:              Data Output.        (line   77)
! * ASM_OUTPUT_REG_POP:                    Instruction Output. (line  208)
! * ASM_OUTPUT_REG_PUSH:                   Instruction Output. (line  203)
! * ASM_OUTPUT_SIZE_DIRECTIVE:             Label Output.       (line   47)
! * ASM_OUTPUT_SKIP:                       Alignment Output.   (line   73)
! * ASM_OUTPUT_SOURCE_FILENAME:            File Framework.     (line   85)
! * ASM_OUTPUT_SPECIAL_POOL_ENTRY:         Data Output.        (line   89)
! * ASM_OUTPUT_SYMBOL_REF:                 Label Output.       (line  340)
! * ASM_OUTPUT_TYPE_DIRECTIVE:             Label Output.       (line  101)
! * ASM_OUTPUT_WEAK_ALIAS:                 Label Output.       (line  449)
! * ASM_OUTPUT_WEAKREF:                    Label Output.       (line  235)
! * ASM_PREFERRED_EH_DATA_FORMAT:          Exception Handling. (line   67)
! * ASM_SPEC:                              Driver.             (line   74)
! * ASM_STABD_OP:                          DBX Options.        (line   36)
! * ASM_STABN_OP:                          DBX Options.        (line   43)
! * ASM_STABS_OP:                          DBX Options.        (line   29)
! * ASM_WEAKEN_DECL:                       Label Output.       (line  227)
! * ASM_WEAKEN_LABEL:                      Label Output.       (line  214)
! * assemble_name:                         Label Output.       (line    8)
! * assemble_name_raw:                     Label Output.       (line   28)
  * assembler format:                      File Framework.     (line    6)
  * assembler instructions in RTL:         Assembler.          (line    6)
! * ASSEMBLER_DIALECT:                     Instruction Output. (line  174)
  * assigning attribute values to insns:   Tagging Insns.      (line    6)
! * ASSUME_EXTENDED_UNWIND_CONTEXT:        Frame Registers.    (line  164)
  * asterisk in template:                  Output Statement.   (line   29)
! * atan2M3 instruction pattern:           Standard Names.     (line  670)
! * atomic:                                GTY Options.        (line  196)
! * atomic_add_fetchMODE instruction pattern: Standard Names.  (line 1867)
! * atomic_addMODE instruction pattern:    Standard Names.     (line 1838)
! * atomic_and_fetchMODE instruction pattern: Standard Names.  (line 1867)
! * atomic_andMODE instruction pattern:    Standard Names.     (line 1838)
  * atomic_compare_and_swapMODE instruction pattern: Standard Names.
!                                                              (line 1774)
! * atomic_exchangeMODE instruction pattern: Standard Names.   (line 1826)
! * atomic_fetch_addMODE instruction pattern: Standard Names.  (line 1852)
! * atomic_fetch_andMODE instruction pattern: Standard Names.  (line 1852)
! * atomic_fetch_nandMODE instruction pattern: Standard Names. (line 1852)
! * atomic_fetch_orMODE instruction pattern: Standard Names.   (line 1852)
! * atomic_fetch_subMODE instruction pattern: Standard Names.  (line 1852)
! * atomic_fetch_xorMODE instruction pattern: Standard Names.  (line 1852)
! * atomic_loadMODE instruction pattern:   Standard Names.     (line 1805)
! * atomic_nand_fetchMODE instruction pattern: Standard Names. (line 1867)
! * atomic_nandMODE instruction pattern:   Standard Names.     (line 1838)
! * atomic_or_fetchMODE instruction pattern: Standard Names.   (line 1867)
! * atomic_orMODE instruction pattern:     Standard Names.     (line 1838)
! * atomic_storeMODE instruction pattern:  Standard Names.     (line 1815)
! * atomic_sub_fetchMODE instruction pattern: Standard Names.  (line 1867)
! * atomic_subMODE instruction pattern:    Standard Names.     (line 1838)
! * atomic_test_and_set instruction pattern: Standard Names.   (line 1884)
! * atomic_xor_fetchMODE instruction pattern: Standard Names.  (line 1867)
! * atomic_xorMODE instruction pattern:    Standard Names.     (line 1838)
  * attr <1>:                              Tagging Insns.      (line   54)
- * attr:                                  Expressions.        (line  165)
- * attr_flag:                             Expressions.        (line  140)
  * attribute expressions:                 Expressions.        (line    6)
  * attribute specifications:              Attr Example.       (line    6)
  * attribute specifications example:      Attr Example.       (line    6)
- * ATTRIBUTE_ALIGNED_VALUE:               Storage Layout.     (line  179)
  * attributes:                            Attributes.         (line    6)
  * attributes, defining:                  Defining Attributes.
                                                               (line    6)
  * attributes, target-specific:           Target Attributes.  (line    6)
! * autoincrement addressing, availability: Portability.       (line   21)
  * autoincrement/decrement addressing:    Simple Constraints. (line   30)
  * automata_option:                       Processor pipeline description.
!                                                              (line  305)
  * automaton based pipeline description:  Processor pipeline description.
                                                               (line    6)
  * automaton based scheduler:             Processor pipeline description.
                                                               (line    6)
  * AVOID_CCMODE_COPIES:                   Values in Registers.
!                                                              (line  153)
  * backslash:                             Output Template.    (line   46)
! * barrier:                               Insns.              (line  177)
  * barrier and /f:                        Flags.              (line  107)
  * barrier and /v:                        Flags.              (line   44)
! * BASE_REG_CLASS:                        Register Classes.   (line  114)
  * basic block:                           Basic Blocks.       (line    6)
  * Basic Statements:                      Basic Statements.   (line    6)
  * basic-block.h:                         Control Flow.       (line    6)
- * BASIC_BLOCK:                           Basic Blocks.       (line   14)
  * basic_block:                           Basic Blocks.       (line    6)
  * BB_HEAD, BB_END:                       Maintaining the CFG.
!                                                              (line   77)
! * bb_seq:                                GIMPLE sequences.   (line   73)
! * BIGGEST_ALIGNMENT:                     Storage Layout.     (line  164)
! * BIGGEST_FIELD_ALIGNMENT:               Storage Layout.     (line  190)
  * BImode:                                Machine Modes.      (line   22)
  * BIND_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * BINFO_TYPE:                            Classes.            (line    6)
  * bit-fields:                            Bit-Fields.         (line    6)
  * BIT_AND_EXPR:                          Unary and Binary Expressions.
                                                               (line    6)
  * BIT_IOR_EXPR:                          Unary and Binary Expressions.
--- 43568,47102 ----
  * /s in RTL dump:                        Flags.              (line  245)
  * /u in RTL dump:                        Flags.              (line  296)
  * /v in RTL dump:                        Flags.              (line  328)
! * 0 in constraint:                       Simple Constraints. (line  128)
! * < in constraint:                       Simple Constraints. (line   47)
  * = in constraint:                       Modifiers.          (line    8)
! * > in constraint:                       Simple Constraints. (line   59)
  * ? in constraint:                       Multi-Alternative.  (line   41)
  * \:                                     Output Template.    (line   46)
  * ^ in constraint:                       Multi-Alternative.  (line   52)
  * __absvdi2:                             Integer library routines.
                                                               (line  106)
+ * __absvsi2:                             Integer library routines.
+                                                              (line  105)
  * __addda3:                              Fixed-point fractional library routines.
!                                                              (line   52)
  * __adddf3:                              Soft float library routines.
!                                                              (line   22)
  * __adddq3:                              Fixed-point fractional library routines.
!                                                              (line   39)
  * __addha3:                              Fixed-point fractional library routines.
!                                                              (line   49)
  * __addhq3:                              Fixed-point fractional library routines.
!                                                              (line   37)
  * __addqq3:                              Fixed-point fractional library routines.
!                                                              (line   35)
  * __addsa3:                              Fixed-point fractional library routines.
!                                                              (line   51)
  * __addsf3:                              Soft float library routines.
!                                                              (line   21)
  * __addsq3:                              Fixed-point fractional library routines.
!                                                              (line   38)
  * __addta3:                              Fixed-point fractional library routines.
!                                                              (line   53)
  * __addtf3:                              Soft float library routines.
!                                                              (line   23)
  * __adduda3:                             Fixed-point fractional library routines.
!                                                              (line   59)
  * __addudq3:                             Fixed-point fractional library routines.
!                                                              (line   47)
  * __adduha3:                             Fixed-point fractional library routines.
!                                                              (line   55)
  * __adduhq3:                             Fixed-point fractional library routines.
!                                                              (line   43)
  * __adduqq3:                             Fixed-point fractional library routines.
!                                                              (line   41)
  * __addusa3:                             Fixed-point fractional library routines.
!                                                              (line   57)
  * __addusq3:                             Fixed-point fractional library routines.
!                                                              (line   45)
  * __adduta3:                             Fixed-point fractional library routines.
!                                                              (line   61)
  * __addvdi3:                             Integer library routines.
                                                               (line  110)
+ * __addvsi3:                             Integer library routines.
+                                                              (line  109)
  * __addxf3:                              Soft float library routines.
!                                                              (line   25)
  * __ashlda3:                             Fixed-point fractional library routines.
!                                                              (line  358)
  * __ashldi3:                             Integer library routines.
!                                                              (line   13)
  * __ashldq3:                             Fixed-point fractional library routines.
!                                                              (line  346)
  * __ashlha3:                             Fixed-point fractional library routines.
!                                                              (line  356)
  * __ashlhq3:                             Fixed-point fractional library routines.
!                                                              (line  344)
  * __ashlqq3:                             Fixed-point fractional library routines.
!                                                              (line  343)
  * __ashlsa3:                             Fixed-point fractional library routines.
!                                                              (line  357)
  * __ashlsi3:                             Integer library routines.
!                                                              (line   12)
  * __ashlsq3:                             Fixed-point fractional library routines.
!                                                              (line  345)
  * __ashlta3:                             Fixed-point fractional library routines.
!                                                              (line  359)
  * __ashlti3:                             Integer library routines.
!                                                              (line   14)
  * __ashluda3:                            Fixed-point fractional library routines.
!                                                              (line  365)
  * __ashludq3:                            Fixed-point fractional library routines.
!                                                              (line  354)
  * __ashluha3:                            Fixed-point fractional library routines.
!                                                              (line  361)
  * __ashluhq3:                            Fixed-point fractional library routines.
!                                                              (line  350)
  * __ashluqq3:                            Fixed-point fractional library routines.
!                                                              (line  348)
  * __ashlusa3:                            Fixed-point fractional library routines.
!                                                              (line  363)
  * __ashlusq3:                            Fixed-point fractional library routines.
!                                                              (line  352)
  * __ashluta3:                            Fixed-point fractional library routines.
!                                                              (line  367)
  * __ashrda3:                             Fixed-point fractional library routines.
!                                                              (line  378)
  * __ashrdi3:                             Integer library routines.
!                                                              (line   18)
  * __ashrdq3:                             Fixed-point fractional library routines.
!                                                              (line  374)
  * __ashrha3:                             Fixed-point fractional library routines.
!                                                              (line  376)
  * __ashrhq3:                             Fixed-point fractional library routines.
!                                                              (line  372)
  * __ashrqq3:                             Fixed-point fractional library routines.
!                                                              (line  371)
  * __ashrsa3:                             Fixed-point fractional library routines.
!                                                              (line  377)
  * __ashrsi3:                             Integer library routines.
!                                                              (line   17)
  * __ashrsq3:                             Fixed-point fractional library routines.
                                                               (line  373)
+ * __ashrta3:                             Fixed-point fractional library routines.
+                                                              (line  379)
  * __ashrti3:                             Integer library routines.
!                                                              (line   19)
  * __bid_adddd3:                          Decimal float library routines.
!                                                              (line   23)
  * __bid_addsd3:                          Decimal float library routines.
!                                                              (line   19)
  * __bid_addtd3:                          Decimal float library routines.
!                                                              (line   27)
  * __bid_divdd3:                          Decimal float library routines.
!                                                              (line   66)
  * __bid_divsd3:                          Decimal float library routines.
!                                                              (line   62)
  * __bid_divtd3:                          Decimal float library routines.
!                                                              (line   70)
  * __bid_eqdd2:                           Decimal float library routines.
!                                                              (line  258)
  * __bid_eqsd2:                           Decimal float library routines.
!                                                              (line  256)
  * __bid_eqtd2:                           Decimal float library routines.
!                                                              (line  260)
  * __bid_extendddtd2:                     Decimal float library routines.
!                                                              (line   91)
  * __bid_extendddtf:                      Decimal float library routines.
!                                                              (line  139)
  * __bid_extendddxf:                      Decimal float library routines.
!                                                              (line  133)
  * __bid_extenddfdd:                      Decimal float library routines.
!                                                              (line  146)
  * __bid_extenddftd:                      Decimal float library routines.
!                                                              (line  106)
  * __bid_extendsddd2:                     Decimal float library routines.
!                                                              (line   87)
  * __bid_extendsddf:                      Decimal float library routines.
!                                                              (line  127)
  * __bid_extendsdtd2:                     Decimal float library routines.
!                                                              (line   89)
  * __bid_extendsdtf:                      Decimal float library routines.
!                                                              (line  137)
  * __bid_extendsdxf:                      Decimal float library routines.
!                                                              (line  131)
  * __bid_extendsfdd:                      Decimal float library routines.
!                                                              (line  102)
  * __bid_extendsfsd:                      Decimal float library routines.
!                                                              (line  144)
  * __bid_extendsftd:                      Decimal float library routines.
!                                                              (line  104)
  * __bid_extendtftd:                      Decimal float library routines.
!                                                              (line  148)
  * __bid_extendxftd:                      Decimal float library routines.
!                                                              (line  108)
  * __bid_fixdddi:                         Decimal float library routines.
!                                                              (line  169)
  * __bid_fixddsi:                         Decimal float library routines.
!                                                              (line  161)
  * __bid_fixsddi:                         Decimal float library routines.
!                                                              (line  167)
  * __bid_fixsdsi:                         Decimal float library routines.
!                                                              (line  159)
  * __bid_fixtddi:                         Decimal float library routines.
!                                                              (line  171)
  * __bid_fixtdsi:                         Decimal float library routines.
!                                                              (line  163)
  * __bid_fixunsdddi:                      Decimal float library routines.
!                                                              (line  186)
  * __bid_fixunsddsi:                      Decimal float library routines.
!                                                              (line  177)
  * __bid_fixunssddi:                      Decimal float library routines.
!                                                              (line  184)
  * __bid_fixunssdsi:                      Decimal float library routines.
!                                                              (line  175)
  * __bid_fixunstddi:                      Decimal float library routines.
!                                                              (line  188)
  * __bid_fixunstdsi:                      Decimal float library routines.
!                                                              (line  179)
  * __bid_floatdidd:                       Decimal float library routines.
!                                                              (line  204)
  * __bid_floatdisd:                       Decimal float library routines.
!                                                              (line  202)
  * __bid_floatditd:                       Decimal float library routines.
!                                                              (line  206)
  * __bid_floatsidd:                       Decimal float library routines.
!                                                              (line  195)
  * __bid_floatsisd:                       Decimal float library routines.
!                                                              (line  193)
  * __bid_floatsitd:                       Decimal float library routines.
!                                                              (line  197)
  * __bid_floatunsdidd:                    Decimal float library routines.
!                                                              (line  222)
  * __bid_floatunsdisd:                    Decimal float library routines.
!                                                              (line  220)
  * __bid_floatunsditd:                    Decimal float library routines.
!                                                              (line  224)
  * __bid_floatunssidd:                    Decimal float library routines.
!                                                              (line  213)
  * __bid_floatunssisd:                    Decimal float library routines.
!                                                              (line  211)
  * __bid_floatunssitd:                    Decimal float library routines.
!                                                              (line  215)
  * __bid_gedd2:                           Decimal float library routines.
!                                                              (line  276)
  * __bid_gesd2:                           Decimal float library routines.
!                                                              (line  274)
  * __bid_getd2:                           Decimal float library routines.
!                                                              (line  278)
  * __bid_gtdd2:                           Decimal float library routines.
!                                                              (line  303)
  * __bid_gtsd2:                           Decimal float library routines.
!                                                              (line  301)
  * __bid_gttd2:                           Decimal float library routines.
!                                                              (line  305)
  * __bid_ledd2:                           Decimal float library routines.
!                                                              (line  294)
  * __bid_lesd2:                           Decimal float library routines.
!                                                              (line  292)
  * __bid_letd2:                           Decimal float library routines.
!                                                              (line  296)
  * __bid_ltdd2:                           Decimal float library routines.
!                                                              (line  285)
  * __bid_ltsd2:                           Decimal float library routines.
!                                                              (line  283)
  * __bid_lttd2:                           Decimal float library routines.
!                                                              (line  287)
  * __bid_muldd3:                          Decimal float library routines.
!                                                              (line   52)
  * __bid_mulsd3:                          Decimal float library routines.
!                                                              (line   48)
  * __bid_multd3:                          Decimal float library routines.
!                                                              (line   56)
  * __bid_nedd2:                           Decimal float library routines.
!                                                              (line  267)
  * __bid_negdd2:                          Decimal float library routines.
!                                                              (line   77)
  * __bid_negsd2:                          Decimal float library routines.
!                                                              (line   75)
  * __bid_negtd2:                          Decimal float library routines.
!                                                              (line   79)
  * __bid_nesd2:                           Decimal float library routines.
!                                                              (line  265)
  * __bid_netd2:                           Decimal float library routines.
!                                                              (line  269)
  * __bid_subdd3:                          Decimal float library routines.
!                                                              (line   37)
  * __bid_subsd3:                          Decimal float library routines.
!                                                              (line   33)
  * __bid_subtd3:                          Decimal float library routines.
!                                                              (line   41)
  * __bid_truncdddf:                       Decimal float library routines.
!                                                              (line  152)
  * __bid_truncddsd2:                      Decimal float library routines.
!                                                              (line   93)
  * __bid_truncddsf:                       Decimal float library routines.
!                                                              (line  123)
  * __bid_truncdfsd:                       Decimal float library routines.
!                                                              (line  110)
  * __bid_truncsdsf:                       Decimal float library routines.
!                                                              (line  150)
  * __bid_trunctddd2:                      Decimal float library routines.
!                                                              (line   97)
  * __bid_trunctddf:                       Decimal float library routines.
!                                                              (line  129)
  * __bid_trunctdsd2:                      Decimal float library routines.
!                                                              (line   95)
  * __bid_trunctdsf:                       Decimal float library routines.
!                                                              (line  125)
  * __bid_trunctdtf:                       Decimal float library routines.
!                                                              (line  154)
  * __bid_trunctdxf:                       Decimal float library routines.
!                                                              (line  135)
  * __bid_trunctfdd:                       Decimal float library routines.
!                                                              (line  118)
  * __bid_trunctfsd:                       Decimal float library routines.
!                                                              (line  114)
  * __bid_truncxfdd:                       Decimal float library routines.
!                                                              (line  116)
  * __bid_truncxfsd:                       Decimal float library routines.
!                                                              (line  112)
  * __bid_unorddd2:                        Decimal float library routines.
!                                                              (line  234)
  * __bid_unordsd2:                        Decimal float library routines.
!                                                              (line  232)
  * __bid_unordtd2:                        Decimal float library routines.
!                                                              (line  236)
  * __bswapdi2:                            Integer library routines.
                                                               (line  161)
! * __bswapsi2:                            Integer library routines.
!                                                              (line  160)
! * __builtin_classify_type:               Varargs.            (line   48)
! * __builtin_next_arg:                    Varargs.            (line   39)
! * __builtin_saveregs:                    Varargs.            (line   22)
! * __chkp_bndcl:                          Misc.               (line  649)
! * __chkp_bndcu:                          Misc.               (line  655)
! * __chkp_bndldx:                         Misc.               (line  643)
! * __chkp_bndmk:                          Misc.               (line  630)
! * __chkp_bndret:                         Misc.               (line  661)
! * __chkp_bndstx:                         Misc.               (line  637)
! * __chkp_intersect:                      Misc.               (line  667)
! * __chkp_narrow:                         Misc.               (line  672)
! * __chkp_sizeof:                         Misc.               (line  678)
  * __clear_cache:                         Miscellaneous routines.
!                                                              (line    9)
  * __clzdi2:                              Integer library routines.
                                                               (line  130)
+ * __clzsi2:                              Integer library routines.
+                                                              (line  129)
  * __clzti2:                              Integer library routines.
!                                                              (line  131)
  * __cmpda2:                              Fixed-point fractional library routines.
!                                                              (line  458)
  * __cmpdf2:                              Soft float library routines.
!                                                              (line  163)
  * __cmpdi2:                              Integer library routines.
!                                                              (line   86)
  * __cmpdq2:                              Fixed-point fractional library routines.
!                                                              (line  447)
  * __cmpha2:                              Fixed-point fractional library routines.
!                                                              (line  456)
  * __cmphq2:                              Fixed-point fractional library routines.
!                                                              (line  445)
  * __cmpqq2:                              Fixed-point fractional library routines.
!                                                              (line  444)
  * __cmpsa2:                              Fixed-point fractional library routines.
!                                                              (line  457)
  * __cmpsf2:                              Soft float library routines.
!                                                              (line  162)
  * __cmpsq2:                              Fixed-point fractional library routines.
!                                                              (line  446)
  * __cmpta2:                              Fixed-point fractional library routines.
!                                                              (line  459)
  * __cmptf2:                              Soft float library routines.
!                                                              (line  164)
  * __cmpti2:                              Integer library routines.
!                                                              (line   87)
  * __cmpuda2:                             Fixed-point fractional library routines.
!                                                              (line  464)
  * __cmpudq2:                             Fixed-point fractional library routines.
!                                                              (line  454)
  * __cmpuha2:                             Fixed-point fractional library routines.
!                                                              (line  461)
  * __cmpuhq2:                             Fixed-point fractional library routines.
!                                                              (line  451)
  * __cmpuqq2:                             Fixed-point fractional library routines.
!                                                              (line  449)
  * __cmpusa2:                             Fixed-point fractional library routines.
!                                                              (line  463)
  * __cmpusq2:                             Fixed-point fractional library routines.
!                                                              (line  452)
  * __cmputa2:                             Fixed-point fractional library routines.
!                                                              (line  466)
  * __CTOR_LIST__:                         Initialization.     (line   25)
  * __ctzdi2:                              Integer library routines.
                                                               (line  137)
+ * __ctzsi2:                              Integer library routines.
+                                                              (line  136)
  * __ctzti2:                              Integer library routines.
!                                                              (line  138)
  * __divda3:                              Fixed-point fractional library routines.
!                                                              (line  234)
  * __divdc3:                              Soft float library routines.
!                                                              (line  250)
  * __divdf3:                              Soft float library routines.
!                                                              (line   47)
  * __divdi3:                              Integer library routines.
!                                                              (line   24)
  * __divdq3:                              Fixed-point fractional library routines.
!                                                              (line  229)
  * __divha3:                              Fixed-point fractional library routines.
!                                                              (line  231)
  * __divhq3:                              Fixed-point fractional library routines.
!                                                              (line  227)
  * __divqq3:                              Fixed-point fractional library routines.
!                                                              (line  225)
  * __divsa3:                              Fixed-point fractional library routines.
!                                                              (line  233)
  * __divsc3:                              Soft float library routines.
!                                                              (line  248)
  * __divsf3:                              Soft float library routines.
!                                                              (line   46)
  * __divsi3:                              Integer library routines.
!                                                              (line   23)
  * __divsq3:                              Fixed-point fractional library routines.
!                                                              (line  228)
  * __divta3:                              Fixed-point fractional library routines.
!                                                              (line  235)
  * __divtc3:                              Soft float library routines.
!                                                              (line  252)
  * __divtf3:                              Soft float library routines.
!                                                              (line   48)
  * __divti3:                              Integer library routines.
!                                                              (line   25)
  * __divxc3:                              Soft float library routines.
!                                                              (line  254)
  * __divxf3:                              Soft float library routines.
!                                                              (line   50)
  * __dpd_adddd3:                          Decimal float library routines.
!                                                              (line   21)
  * __dpd_addsd3:                          Decimal float library routines.
!                                                              (line   17)
  * __dpd_addtd3:                          Decimal float library routines.
!                                                              (line   25)
  * __dpd_divdd3:                          Decimal float library routines.
!                                                              (line   64)
  * __dpd_divsd3:                          Decimal float library routines.
!                                                              (line   60)
  * __dpd_divtd3:                          Decimal float library routines.
!                                                              (line   68)
  * __dpd_eqdd2:                           Decimal float library routines.
!                                                              (line  257)
  * __dpd_eqsd2:                           Decimal float library routines.
!                                                              (line  255)
  * __dpd_eqtd2:                           Decimal float library routines.
!                                                              (line  259)
  * __dpd_extendddtd2:                     Decimal float library routines.
!                                                              (line   90)
  * __dpd_extendddtf:                      Decimal float library routines.
!                                                              (line  138)
  * __dpd_extendddxf:                      Decimal float library routines.
!                                                              (line  132)
  * __dpd_extenddfdd:                      Decimal float library routines.
!                                                              (line  145)
  * __dpd_extenddftd:                      Decimal float library routines.
!                                                              (line  105)
  * __dpd_extendsddd2:                     Decimal float library routines.
!                                                              (line   86)
  * __dpd_extendsddf:                      Decimal float library routines.
!                                                              (line  126)
  * __dpd_extendsdtd2:                     Decimal float library routines.
!                                                              (line   88)
  * __dpd_extendsdtf:                      Decimal float library routines.
!                                                              (line  136)
  * __dpd_extendsdxf:                      Decimal float library routines.
!                                                              (line  130)
  * __dpd_extendsfdd:                      Decimal float library routines.
!                                                              (line  101)
  * __dpd_extendsfsd:                      Decimal float library routines.
!                                                              (line  143)
  * __dpd_extendsftd:                      Decimal float library routines.
!                                                              (line  103)
  * __dpd_extendtftd:                      Decimal float library routines.
!                                                              (line  147)
  * __dpd_extendxftd:                      Decimal float library routines.
!                                                              (line  107)
  * __dpd_fixdddi:                         Decimal float library routines.
!                                                              (line  168)
  * __dpd_fixddsi:                         Decimal float library routines.
!                                                              (line  160)
  * __dpd_fixsddi:                         Decimal float library routines.
!                                                              (line  166)
  * __dpd_fixsdsi:                         Decimal float library routines.
!                                                              (line  158)
  * __dpd_fixtddi:                         Decimal float library routines.
!                                                              (line  170)
  * __dpd_fixtdsi:                         Decimal float library routines.
!                                                              (line  162)
  * __dpd_fixunsdddi:                      Decimal float library routines.
!                                                              (line  185)
  * __dpd_fixunsddsi:                      Decimal float library routines.
!                                                              (line  176)
  * __dpd_fixunssddi:                      Decimal float library routines.
!                                                              (line  183)
  * __dpd_fixunssdsi:                      Decimal float library routines.
!                                                              (line  174)
  * __dpd_fixunstddi:                      Decimal float library routines.
!                                                              (line  187)
  * __dpd_fixunstdsi:                      Decimal float library routines.
!                                                              (line  178)
  * __dpd_floatdidd:                       Decimal float library routines.
!                                                              (line  203)
  * __dpd_floatdisd:                       Decimal float library routines.
!                                                              (line  201)
  * __dpd_floatditd:                       Decimal float library routines.
!                                                              (line  205)
  * __dpd_floatsidd:                       Decimal float library routines.
!                                                              (line  194)
  * __dpd_floatsisd:                       Decimal float library routines.
!                                                              (line  192)
  * __dpd_floatsitd:                       Decimal float library routines.
!                                                              (line  196)
  * __dpd_floatunsdidd:                    Decimal float library routines.
!                                                              (line  221)
  * __dpd_floatunsdisd:                    Decimal float library routines.
!                                                              (line  219)
  * __dpd_floatunsditd:                    Decimal float library routines.
!                                                              (line  223)
  * __dpd_floatunssidd:                    Decimal float library routines.
!                                                              (line  212)
  * __dpd_floatunssisd:                    Decimal float library routines.
!                                                              (line  210)
  * __dpd_floatunssitd:                    Decimal float library routines.
!                                                              (line  214)
  * __dpd_gedd2:                           Decimal float library routines.
!                                                              (line  275)
  * __dpd_gesd2:                           Decimal float library routines.
!                                                              (line  273)
  * __dpd_getd2:                           Decimal float library routines.
!                                                              (line  277)
  * __dpd_gtdd2:                           Decimal float library routines.
!                                                              (line  302)
  * __dpd_gtsd2:                           Decimal float library routines.
!                                                              (line  300)
  * __dpd_gttd2:                           Decimal float library routines.
!                                                              (line  304)
  * __dpd_ledd2:                           Decimal float library routines.
!                                                              (line  293)
  * __dpd_lesd2:                           Decimal float library routines.
!                                                              (line  291)
  * __dpd_letd2:                           Decimal float library routines.
!                                                              (line  295)
  * __dpd_ltdd2:                           Decimal float library routines.
!                                                              (line  284)
  * __dpd_ltsd2:                           Decimal float library routines.
!                                                              (line  282)
  * __dpd_lttd2:                           Decimal float library routines.
!                                                              (line  286)
  * __dpd_muldd3:                          Decimal float library routines.
!                                                              (line   50)
  * __dpd_mulsd3:                          Decimal float library routines.
!                                                              (line   46)
  * __dpd_multd3:                          Decimal float library routines.
!                                                              (line   54)
  * __dpd_nedd2:                           Decimal float library routines.
!                                                              (line  266)
  * __dpd_negdd2:                          Decimal float library routines.
!                                                              (line   76)
  * __dpd_negsd2:                          Decimal float library routines.
!                                                              (line   74)
  * __dpd_negtd2:                          Decimal float library routines.
!                                                              (line   78)
  * __dpd_nesd2:                           Decimal float library routines.
!                                                              (line  264)
  * __dpd_netd2:                           Decimal float library routines.
!                                                              (line  268)
  * __dpd_subdd3:                          Decimal float library routines.
!                                                              (line   35)
  * __dpd_subsd3:                          Decimal float library routines.
!                                                              (line   31)
  * __dpd_subtd3:                          Decimal float library routines.
!                                                              (line   39)
  * __dpd_truncdddf:                       Decimal float library routines.
!                                                              (line  151)
  * __dpd_truncddsd2:                      Decimal float library routines.
!                                                              (line   92)
  * __dpd_truncddsf:                       Decimal float library routines.
!                                                              (line  122)
  * __dpd_truncdfsd:                       Decimal float library routines.
!                                                              (line  109)
  * __dpd_truncsdsf:                       Decimal float library routines.
!                                                              (line  149)
  * __dpd_trunctddd2:                      Decimal float library routines.
!                                                              (line   96)
  * __dpd_trunctddf:                       Decimal float library routines.
!                                                              (line  128)
  * __dpd_trunctdsd2:                      Decimal float library routines.
!                                                              (line   94)
  * __dpd_trunctdsf:                       Decimal float library routines.
!                                                              (line  124)
  * __dpd_trunctdtf:                       Decimal float library routines.
!                                                              (line  153)
  * __dpd_trunctdxf:                       Decimal float library routines.
!                                                              (line  134)
  * __dpd_trunctfdd:                       Decimal float library routines.
!                                                              (line  117)
  * __dpd_trunctfsd:                       Decimal float library routines.
!                                                              (line  113)
  * __dpd_truncxfdd:                       Decimal float library routines.
!                                                              (line  115)
  * __dpd_truncxfsd:                       Decimal float library routines.
!                                                              (line  111)
  * __dpd_unorddd2:                        Decimal float library routines.
!                                                              (line  233)
  * __dpd_unordsd2:                        Decimal float library routines.
!                                                              (line  231)
  * __dpd_unordtd2:                        Decimal float library routines.
!                                                              (line  235)
  * __DTOR_LIST__:                         Initialization.     (line   25)
  * __eqdf2:                               Soft float library routines.
                                                               (line  193)
+ * __eqsf2:                               Soft float library routines.
+                                                              (line  192)
  * __eqtf2:                               Soft float library routines.
!                                                              (line  194)
  * __extenddftf2:                         Soft float library routines.
!                                                              (line   67)
  * __extenddfxf2:                         Soft float library routines.
!                                                              (line   68)
  * __extendsfdf2:                         Soft float library routines.
!                                                              (line   64)
  * __extendsftf2:                         Soft float library routines.
!                                                              (line   65)
  * __extendsfxf2:                         Soft float library routines.
!                                                              (line   66)
  * __ffsdi2:                              Integer library routines.
!                                                              (line  143)
  * __ffsti2:                              Integer library routines.
!                                                              (line  144)
  * __fixdfdi:                             Soft float library routines.
!                                                              (line   87)
  * __fixdfsi:                             Soft float library routines.
!                                                              (line   80)
  * __fixdfti:                             Soft float library routines.
!                                                              (line   93)
  * __fixsfdi:                             Soft float library routines.
!                                                              (line   86)
  * __fixsfsi:                             Soft float library routines.
!                                                              (line   79)
  * __fixsfti:                             Soft float library routines.
!                                                              (line   92)
  * __fixtfdi:                             Soft float library routines.
!                                                              (line   88)
  * __fixtfsi:                             Soft float library routines.
!                                                              (line   81)
  * __fixtfti:                             Soft float library routines.
!                                                              (line   94)
  * __fixunsdfdi:                          Soft float library routines.
!                                                              (line  107)
  * __fixunsdfsi:                          Soft float library routines.
!                                                              (line  100)
  * __fixunsdfti:                          Soft float library routines.
!                                                              (line  114)
  * __fixunssfdi:                          Soft float library routines.
!                                                              (line  106)
  * __fixunssfsi:                          Soft float library routines.
!                                                              (line   99)
  * __fixunssfti:                          Soft float library routines.
!                                                              (line  113)
  * __fixunstfdi:                          Soft float library routines.
!                                                              (line  108)
  * __fixunstfsi:                          Soft float library routines.
!                                                              (line  101)
  * __fixunstfti:                          Soft float library routines.
!                                                              (line  115)
  * __fixunsxfdi:                          Soft float library routines.
!                                                              (line  109)
  * __fixunsxfsi:                          Soft float library routines.
!                                                              (line  102)
  * __fixunsxfti:                          Soft float library routines.
!                                                              (line  116)
  * __fixxfdi:                             Soft float library routines.
!                                                              (line   89)
  * __fixxfsi:                             Soft float library routines.
!                                                              (line   82)
  * __fixxfti:                             Soft float library routines.
!                                                              (line   95)
  * __floatdidf:                           Soft float library routines.
                                                               (line  127)
+ * __floatdisf:                           Soft float library routines.
+                                                              (line  126)
  * __floatditf:                           Soft float library routines.
!                                                              (line  128)
  * __floatdixf:                           Soft float library routines.
!                                                              (line  129)
  * __floatsidf:                           Soft float library routines.
                                                               (line  121)
+ * __floatsisf:                           Soft float library routines.
+                                                              (line  120)
  * __floatsitf:                           Soft float library routines.
!                                                              (line  122)
  * __floatsixf:                           Soft float library routines.
!                                                              (line  123)
  * __floattidf:                           Soft float library routines.
                                                               (line  133)
+ * __floattisf:                           Soft float library routines.
+                                                              (line  132)
  * __floattitf:                           Soft float library routines.
!                                                              (line  134)
  * __floattixf:                           Soft float library routines.
!                                                              (line  135)
  * __floatundidf:                         Soft float library routines.
                                                               (line  145)
+ * __floatundisf:                         Soft float library routines.
+                                                              (line  144)
  * __floatunditf:                         Soft float library routines.
!                                                              (line  146)
  * __floatundixf:                         Soft float library routines.
!                                                              (line  147)
  * __floatunsidf:                         Soft float library routines.
                                                               (line  139)
+ * __floatunsisf:                         Soft float library routines.
+                                                              (line  138)
  * __floatunsitf:                         Soft float library routines.
!                                                              (line  140)
  * __floatunsixf:                         Soft float library routines.
!                                                              (line  141)
  * __floatuntidf:                         Soft float library routines.
                                                               (line  151)
+ * __floatuntisf:                         Soft float library routines.
+                                                              (line  150)
  * __floatuntitf:                         Soft float library routines.
!                                                              (line  152)
  * __floatuntixf:                         Soft float library routines.
!                                                              (line  153)
  * __fractdadf:                           Fixed-point fractional library routines.
!                                                              (line  643)
  * __fractdadi:                           Fixed-point fractional library routines.
!                                                              (line  640)
  * __fractdadq:                           Fixed-point fractional library routines.
!                                                              (line  623)
  * __fractdaha2:                          Fixed-point fractional library routines.
!                                                              (line  624)
  * __fractdahi:                           Fixed-point fractional library routines.
!                                                              (line  638)
  * __fractdahq:                           Fixed-point fractional library routines.
!                                                              (line  621)
  * __fractdaqi:                           Fixed-point fractional library routines.
!                                                              (line  637)
  * __fractdaqq:                           Fixed-point fractional library routines.
!                                                              (line  620)
  * __fractdasa2:                          Fixed-point fractional library routines.
!                                                              (line  625)
  * __fractdasf:                           Fixed-point fractional library routines.
!                                                              (line  642)
  * __fractdasi:                           Fixed-point fractional library routines.
!                                                              (line  639)
  * __fractdasq:                           Fixed-point fractional library routines.
!                                                              (line  622)
  * __fractdata2:                          Fixed-point fractional library routines.
!                                                              (line  626)
  * __fractdati:                           Fixed-point fractional library routines.
!                                                              (line  641)
  * __fractdauda:                          Fixed-point fractional library routines.
!                                                              (line  634)
  * __fractdaudq:                          Fixed-point fractional library routines.
!                                                              (line  630)
  * __fractdauha:                          Fixed-point fractional library routines.
!                                                              (line  632)
  * __fractdauhq:                          Fixed-point fractional library routines.
!                                                              (line  628)
  * __fractdauqq:                          Fixed-point fractional library routines.
!                                                              (line  627)
  * __fractdausa:                          Fixed-point fractional library routines.
!                                                              (line  633)
  * __fractdausq:                          Fixed-point fractional library routines.
                                                               (line  629)
+ * __fractdauta:                          Fixed-point fractional library routines.
+                                                              (line  635)
  * __fractdfda:                           Fixed-point fractional library routines.
!                                                              (line 1032)
  * __fractdfdq:                           Fixed-point fractional library routines.
!                                                              (line 1029)
  * __fractdfha:                           Fixed-point fractional library routines.
!                                                              (line 1030)
  * __fractdfhq:                           Fixed-point fractional library routines.
!                                                              (line 1027)
  * __fractdfqq:                           Fixed-point fractional library routines.
!                                                              (line 1026)
  * __fractdfsa:                           Fixed-point fractional library routines.
!                                                              (line 1031)
  * __fractdfsq:                           Fixed-point fractional library routines.
!                                                              (line 1028)
  * __fractdfta:                           Fixed-point fractional library routines.
                                                               (line 1033)
+ * __fractdfuda:                          Fixed-point fractional library routines.
+                                                              (line 1040)
  * __fractdfudq:                          Fixed-point fractional library routines.
!                                                              (line 1037)
  * __fractdfuha:                          Fixed-point fractional library routines.
!                                                              (line 1038)
  * __fractdfuhq:                          Fixed-point fractional library routines.
!                                                              (line 1035)
  * __fractdfuqq:                          Fixed-point fractional library routines.
!                                                              (line 1034)
  * __fractdfusa:                          Fixed-point fractional library routines.
!                                                              (line 1039)
  * __fractdfusq:                          Fixed-point fractional library routines.
!                                                              (line 1036)
  * __fractdfuta:                          Fixed-point fractional library routines.
!                                                              (line 1041)
  * __fractdida:                           Fixed-point fractional library routines.
!                                                              (line  982)
  * __fractdidq:                           Fixed-point fractional library routines.
!                                                              (line  979)
  * __fractdiha:                           Fixed-point fractional library routines.
!                                                              (line  980)
  * __fractdihq:                           Fixed-point fractional library routines.
!                                                              (line  977)
  * __fractdiqq:                           Fixed-point fractional library routines.
!                                                              (line  976)
  * __fractdisa:                           Fixed-point fractional library routines.
!                                                              (line  981)
  * __fractdisq:                           Fixed-point fractional library routines.
!                                                              (line  978)
  * __fractdita:                           Fixed-point fractional library routines.
                                                               (line  983)
+ * __fractdiuda:                          Fixed-point fractional library routines.
+                                                              (line  990)
  * __fractdiudq:                          Fixed-point fractional library routines.
!                                                              (line  987)
  * __fractdiuha:                          Fixed-point fractional library routines.
!                                                              (line  988)
  * __fractdiuhq:                          Fixed-point fractional library routines.
!                                                              (line  985)
  * __fractdiuqq:                          Fixed-point fractional library routines.
!                                                              (line  984)
  * __fractdiusa:                          Fixed-point fractional library routines.
!                                                              (line  989)
  * __fractdiusq:                          Fixed-point fractional library routines.
!                                                              (line  986)
  * __fractdiuta:                          Fixed-point fractional library routines.
!                                                              (line  991)
  * __fractdqda:                           Fixed-point fractional library routines.
!                                                              (line  551)
  * __fractdqdf:                           Fixed-point fractional library routines.
!                                                              (line  573)
  * __fractdqdi:                           Fixed-point fractional library routines.
!                                                              (line  570)
  * __fractdqha:                           Fixed-point fractional library routines.
!                                                              (line  549)
  * __fractdqhi:                           Fixed-point fractional library routines.
!                                                              (line  568)
  * __fractdqhq2:                          Fixed-point fractional library routines.
!                                                              (line  547)
  * __fractdqqi:                           Fixed-point fractional library routines.
!                                                              (line  567)
  * __fractdqqq2:                          Fixed-point fractional library routines.
!                                                              (line  546)
  * __fractdqsa:                           Fixed-point fractional library routines.
!                                                              (line  550)
  * __fractdqsf:                           Fixed-point fractional library routines.
!                                                              (line  572)
  * __fractdqsi:                           Fixed-point fractional library routines.
!                                                              (line  569)
  * __fractdqsq2:                          Fixed-point fractional library routines.
!                                                              (line  548)
  * __fractdqta:                           Fixed-point fractional library routines.
!                                                              (line  552)
  * __fractdqti:                           Fixed-point fractional library routines.
!                                                              (line  571)
  * __fractdquda:                          Fixed-point fractional library routines.
!                                                              (line  563)
  * __fractdqudq:                          Fixed-point fractional library routines.
!                                                              (line  558)
  * __fractdquha:                          Fixed-point fractional library routines.
!                                                              (line  560)
  * __fractdquhq:                          Fixed-point fractional library routines.
!                                                              (line  555)
  * __fractdquqq:                          Fixed-point fractional library routines.
!                                                              (line  553)
  * __fractdqusa:                          Fixed-point fractional library routines.
!                                                              (line  562)
  * __fractdqusq:                          Fixed-point fractional library routines.
!                                                              (line  556)
  * __fractdquta:                          Fixed-point fractional library routines.
!                                                              (line  565)
  * __fracthada2:                          Fixed-point fractional library routines.
!                                                              (line  579)
  * __fracthadf:                           Fixed-point fractional library routines.
!                                                              (line  597)
  * __fracthadi:                           Fixed-point fractional library routines.
!                                                              (line  594)
  * __fracthadq:                           Fixed-point fractional library routines.
!                                                              (line  577)
  * __fracthahi:                           Fixed-point fractional library routines.
!                                                              (line  592)
  * __fracthahq:                           Fixed-point fractional library routines.
!                                                              (line  575)
  * __fracthaqi:                           Fixed-point fractional library routines.
!                                                              (line  591)
  * __fracthaqq:                           Fixed-point fractional library routines.
!                                                              (line  574)
  * __fracthasa2:                          Fixed-point fractional library routines.
!                                                              (line  578)
  * __fracthasf:                           Fixed-point fractional library routines.
!                                                              (line  596)
  * __fracthasi:                           Fixed-point fractional library routines.
!                                                              (line  593)
  * __fracthasq:                           Fixed-point fractional library routines.
!                                                              (line  576)
  * __fracthata2:                          Fixed-point fractional library routines.
!                                                              (line  580)
  * __fracthati:                           Fixed-point fractional library routines.
!                                                              (line  595)
  * __fracthauda:                          Fixed-point fractional library routines.
!                                                              (line  588)
  * __fracthaudq:                          Fixed-point fractional library routines.
!                                                              (line  584)
  * __fracthauha:                          Fixed-point fractional library routines.
!                                                              (line  586)
  * __fracthauhq:                          Fixed-point fractional library routines.
!                                                              (line  582)
  * __fracthauqq:                          Fixed-point fractional library routines.
!                                                              (line  581)
  * __fracthausa:                          Fixed-point fractional library routines.
!                                                              (line  587)
  * __fracthausq:                          Fixed-point fractional library routines.
                                                               (line  583)
+ * __fracthauta:                          Fixed-point fractional library routines.
+                                                              (line  589)
  * __fracthida:                           Fixed-point fractional library routines.
!                                                              (line  950)
  * __fracthidq:                           Fixed-point fractional library routines.
!                                                              (line  947)
  * __fracthiha:                           Fixed-point fractional library routines.
!                                                              (line  948)
  * __fracthihq:                           Fixed-point fractional library routines.
!                                                              (line  945)
  * __fracthiqq:                           Fixed-point fractional library routines.
!                                                              (line  944)
  * __fracthisa:                           Fixed-point fractional library routines.
!                                                              (line  949)
  * __fracthisq:                           Fixed-point fractional library routines.
!                                                              (line  946)
  * __fracthita:                           Fixed-point fractional library routines.
                                                               (line  951)
+ * __fracthiuda:                          Fixed-point fractional library routines.
+                                                              (line  958)
  * __fracthiudq:                          Fixed-point fractional library routines.
!                                                              (line  955)
  * __fracthiuha:                          Fixed-point fractional library routines.
!                                                              (line  956)
  * __fracthiuhq:                          Fixed-point fractional library routines.
!                                                              (line  953)
  * __fracthiuqq:                          Fixed-point fractional library routines.
!                                                              (line  952)
  * __fracthiusa:                          Fixed-point fractional library routines.
!                                                              (line  957)
  * __fracthiusq:                          Fixed-point fractional library routines.
!                                                              (line  954)
  * __fracthiuta:                          Fixed-point fractional library routines.
!                                                              (line  959)
  * __fracthqda:                           Fixed-point fractional library routines.
!                                                              (line  505)
  * __fracthqdf:                           Fixed-point fractional library routines.
!                                                              (line  521)
  * __fracthqdi:                           Fixed-point fractional library routines.
!                                                              (line  518)
  * __fracthqdq2:                          Fixed-point fractional library routines.
!                                                              (line  502)
  * __fracthqha:                           Fixed-point fractional library routines.
!                                                              (line  503)
  * __fracthqhi:                           Fixed-point fractional library routines.
!                                                              (line  516)
  * __fracthqqi:                           Fixed-point fractional library routines.
!                                                              (line  515)
  * __fracthqqq2:                          Fixed-point fractional library routines.
!                                                              (line  500)
  * __fracthqsa:                           Fixed-point fractional library routines.
!                                                              (line  504)
  * __fracthqsf:                           Fixed-point fractional library routines.
!                                                              (line  520)
  * __fracthqsi:                           Fixed-point fractional library routines.
!                                                              (line  517)
  * __fracthqsq2:                          Fixed-point fractional library routines.
!                                                              (line  501)
  * __fracthqta:                           Fixed-point fractional library routines.
!                                                              (line  506)
  * __fracthqti:                           Fixed-point fractional library routines.
!                                                              (line  519)
  * __fracthquda:                          Fixed-point fractional library routines.
!                                                              (line  513)
  * __fracthqudq:                          Fixed-point fractional library routines.
!                                                              (line  510)
  * __fracthquha:                          Fixed-point fractional library routines.
!                                                              (line  511)
  * __fracthquhq:                          Fixed-point fractional library routines.
!                                                              (line  508)
  * __fracthquqq:                          Fixed-point fractional library routines.
!                                                              (line  507)
  * __fracthqusa:                          Fixed-point fractional library routines.
!                                                              (line  512)
  * __fracthqusq:                          Fixed-point fractional library routines.
!                                                              (line  509)
  * __fracthquta:                          Fixed-point fractional library routines.
!                                                              (line  514)
  * __fractqida:                           Fixed-point fractional library routines.
!                                                              (line  932)
  * __fractqidq:                           Fixed-point fractional library routines.
!                                                              (line  929)
  * __fractqiha:                           Fixed-point fractional library routines.
!                                                              (line  930)
  * __fractqihq:                           Fixed-point fractional library routines.
!                                                              (line  927)
  * __fractqiqq:                           Fixed-point fractional library routines.
!                                                              (line  926)
  * __fractqisa:                           Fixed-point fractional library routines.
!                                                              (line  931)
  * __fractqisq:                           Fixed-point fractional library routines.
!                                                              (line  928)
  * __fractqita:                           Fixed-point fractional library routines.
!                                                              (line  933)
  * __fractqiuda:                          Fixed-point fractional library routines.
!                                                              (line  941)
  * __fractqiudq:                          Fixed-point fractional library routines.
!                                                              (line  937)
  * __fractqiuha:                          Fixed-point fractional library routines.
!                                                              (line  939)
  * __fractqiuhq:                          Fixed-point fractional library routines.
!                                                              (line  935)
  * __fractqiuqq:                          Fixed-point fractional library routines.
!                                                              (line  934)
  * __fractqiusa:                          Fixed-point fractional library routines.
!                                                              (line  940)
  * __fractqiusq:                          Fixed-point fractional library routines.
                                                               (line  936)
+ * __fractqiuta:                          Fixed-point fractional library routines.
+                                                              (line  942)
  * __fractqqda:                           Fixed-point fractional library routines.
!                                                              (line  481)
  * __fractqqdf:                           Fixed-point fractional library routines.
!                                                              (line  499)
  * __fractqqdi:                           Fixed-point fractional library routines.
!                                                              (line  496)
  * __fractqqdq2:                          Fixed-point fractional library routines.
!                                                              (line  478)
  * __fractqqha:                           Fixed-point fractional library routines.
!                                                              (line  479)
  * __fractqqhi:                           Fixed-point fractional library routines.
!                                                              (line  494)
  * __fractqqhq2:                          Fixed-point fractional library routines.
!                                                              (line  476)
  * __fractqqqi:                           Fixed-point fractional library routines.
!                                                              (line  493)
  * __fractqqsa:                           Fixed-point fractional library routines.
!                                                              (line  480)
  * __fractqqsf:                           Fixed-point fractional library routines.
!                                                              (line  498)
  * __fractqqsi:                           Fixed-point fractional library routines.
!                                                              (line  495)
  * __fractqqsq2:                          Fixed-point fractional library routines.
!                                                              (line  477)
  * __fractqqta:                           Fixed-point fractional library routines.
!                                                              (line  482)
  * __fractqqti:                           Fixed-point fractional library routines.
!                                                              (line  497)
  * __fractqquda:                          Fixed-point fractional library routines.
!                                                              (line  490)
  * __fractqqudq:                          Fixed-point fractional library routines.
!                                                              (line  486)
  * __fractqquha:                          Fixed-point fractional library routines.
!                                                              (line  488)
  * __fractqquhq:                          Fixed-point fractional library routines.
!                                                              (line  484)
  * __fractqquqq:                          Fixed-point fractional library routines.
!                                                              (line  483)
  * __fractqqusa:                          Fixed-point fractional library routines.
!                                                              (line  489)
  * __fractqqusq:                          Fixed-point fractional library routines.
                                                               (line  485)
+ * __fractqquta:                          Fixed-point fractional library routines.
+                                                              (line  491)
  * __fractsada2:                          Fixed-point fractional library routines.
!                                                              (line  603)
  * __fractsadf:                           Fixed-point fractional library routines.
!                                                              (line  619)
  * __fractsadi:                           Fixed-point fractional library routines.
!                                                              (line  616)
  * __fractsadq:                           Fixed-point fractional library routines.
!                                                              (line  601)
  * __fractsaha2:                          Fixed-point fractional library routines.
!                                                              (line  602)
  * __fractsahi:                           Fixed-point fractional library routines.
!                                                              (line  614)
  * __fractsahq:                           Fixed-point fractional library routines.
!                                                              (line  599)
  * __fractsaqi:                           Fixed-point fractional library routines.
!                                                              (line  613)
  * __fractsaqq:                           Fixed-point fractional library routines.
!                                                              (line  598)
  * __fractsasf:                           Fixed-point fractional library routines.
!                                                              (line  618)
  * __fractsasi:                           Fixed-point fractional library routines.
!                                                              (line  615)
  * __fractsasq:                           Fixed-point fractional library routines.
!                                                              (line  600)
  * __fractsata2:                          Fixed-point fractional library routines.
!                                                              (line  604)
  * __fractsati:                           Fixed-point fractional library routines.
!                                                              (line  617)
  * __fractsauda:                          Fixed-point fractional library routines.
!                                                              (line  611)
  * __fractsaudq:                          Fixed-point fractional library routines.
!                                                              (line  608)
  * __fractsauha:                          Fixed-point fractional library routines.
!                                                              (line  609)
  * __fractsauhq:                          Fixed-point fractional library routines.
!                                                              (line  606)
  * __fractsauqq:                          Fixed-point fractional library routines.
!                                                              (line  605)
  * __fractsausa:                          Fixed-point fractional library routines.
!                                                              (line  610)
  * __fractsausq:                          Fixed-point fractional library routines.
!                                                              (line  607)
  * __fractsauta:                          Fixed-point fractional library routines.
!                                                              (line  612)
  * __fractsfda:                           Fixed-point fractional library routines.
!                                                              (line 1016)
  * __fractsfdq:                           Fixed-point fractional library routines.
!                                                              (line 1013)
  * __fractsfha:                           Fixed-point fractional library routines.
!                                                              (line 1014)
  * __fractsfhq:                           Fixed-point fractional library routines.
!                                                              (line 1011)
  * __fractsfqq:                           Fixed-point fractional library routines.
!                                                              (line 1010)
  * __fractsfsa:                           Fixed-point fractional library routines.
!                                                              (line 1015)
  * __fractsfsq:                           Fixed-point fractional library routines.
!                                                              (line 1012)
  * __fractsfta:                           Fixed-point fractional library routines.
                                                               (line 1017)
+ * __fractsfuda:                          Fixed-point fractional library routines.
+                                                              (line 1024)
  * __fractsfudq:                          Fixed-point fractional library routines.
!                                                              (line 1021)
  * __fractsfuha:                          Fixed-point fractional library routines.
!                                                              (line 1022)
  * __fractsfuhq:                          Fixed-point fractional library routines.
!                                                              (line 1019)
  * __fractsfuqq:                          Fixed-point fractional library routines.
!                                                              (line 1018)
  * __fractsfusa:                          Fixed-point fractional library routines.
!                                                              (line 1023)
  * __fractsfusq:                          Fixed-point fractional library routines.
!                                                              (line 1020)
  * __fractsfuta:                          Fixed-point fractional library routines.
!                                                              (line 1025)
  * __fractsida:                           Fixed-point fractional library routines.
!                                                              (line  966)
  * __fractsidq:                           Fixed-point fractional library routines.
!                                                              (line  963)
  * __fractsiha:                           Fixed-point fractional library routines.
!                                                              (line  964)
  * __fractsihq:                           Fixed-point fractional library routines.
!                                                              (line  961)
  * __fractsiqq:                           Fixed-point fractional library routines.
!                                                              (line  960)
  * __fractsisa:                           Fixed-point fractional library routines.
!                                                              (line  965)
  * __fractsisq:                           Fixed-point fractional library routines.
!                                                              (line  962)
  * __fractsita:                           Fixed-point fractional library routines.
                                                               (line  967)
+ * __fractsiuda:                          Fixed-point fractional library routines.
+                                                              (line  974)
  * __fractsiudq:                          Fixed-point fractional library routines.
!                                                              (line  971)
  * __fractsiuha:                          Fixed-point fractional library routines.
!                                                              (line  972)
  * __fractsiuhq:                          Fixed-point fractional library routines.
!                                                              (line  969)
  * __fractsiuqq:                          Fixed-point fractional library routines.
!                                                              (line  968)
  * __fractsiusa:                          Fixed-point fractional library routines.
!                                                              (line  973)
  * __fractsiusq:                          Fixed-point fractional library routines.
!                                                              (line  970)
  * __fractsiuta:                          Fixed-point fractional library routines.
!                                                              (line  975)
  * __fractsqda:                           Fixed-point fractional library routines.
!                                                              (line  527)
  * __fractsqdf:                           Fixed-point fractional library routines.
!                                                              (line  545)
  * __fractsqdi:                           Fixed-point fractional library routines.
!                                                              (line  542)
  * __fractsqdq2:                          Fixed-point fractional library routines.
!                                                              (line  524)
  * __fractsqha:                           Fixed-point fractional library routines.
!                                                              (line  525)
  * __fractsqhi:                           Fixed-point fractional library routines.
!                                                              (line  540)
  * __fractsqhq2:                          Fixed-point fractional library routines.
!                                                              (line  523)
  * __fractsqqi:                           Fixed-point fractional library routines.
!                                                              (line  539)
  * __fractsqqq2:                          Fixed-point fractional library routines.
!                                                              (line  522)
  * __fractsqsa:                           Fixed-point fractional library routines.
!                                                              (line  526)
  * __fractsqsf:                           Fixed-point fractional library routines.
!                                                              (line  544)
  * __fractsqsi:                           Fixed-point fractional library routines.
!                                                              (line  541)
  * __fractsqta:                           Fixed-point fractional library routines.
!                                                              (line  528)
  * __fractsqti:                           Fixed-point fractional library routines.
!                                                              (line  543)
  * __fractsquda:                          Fixed-point fractional library routines.
!                                                              (line  536)
  * __fractsqudq:                          Fixed-point fractional library routines.
!                                                              (line  532)
  * __fractsquha:                          Fixed-point fractional library routines.
!                                                              (line  534)
  * __fractsquhq:                          Fixed-point fractional library routines.
!                                                              (line  530)
  * __fractsquqq:                          Fixed-point fractional library routines.
!                                                              (line  529)
  * __fractsqusa:                          Fixed-point fractional library routines.
!                                                              (line  535)
  * __fractsqusq:                          Fixed-point fractional library routines.
                                                               (line  531)
+ * __fractsquta:                          Fixed-point fractional library routines.
+                                                              (line  537)
  * __fracttada2:                          Fixed-point fractional library routines.
!                                                              (line  650)
  * __fracttadf:                           Fixed-point fractional library routines.
!                                                              (line  671)
  * __fracttadi:                           Fixed-point fractional library routines.
!                                                              (line  668)
  * __fracttadq:                           Fixed-point fractional library routines.
!                                                              (line  647)
  * __fracttaha2:                          Fixed-point fractional library routines.
!                                                              (line  648)
  * __fracttahi:                           Fixed-point fractional library routines.
!                                                              (line  666)
  * __fracttahq:                           Fixed-point fractional library routines.
!                                                              (line  645)
  * __fracttaqi:                           Fixed-point fractional library routines.
!                                                              (line  665)
  * __fracttaqq:                           Fixed-point fractional library routines.
!                                                              (line  644)
  * __fracttasa2:                          Fixed-point fractional library routines.
!                                                              (line  649)
  * __fracttasf:                           Fixed-point fractional library routines.
!                                                              (line  670)
  * __fracttasi:                           Fixed-point fractional library routines.
!                                                              (line  667)
  * __fracttasq:                           Fixed-point fractional library routines.
!                                                              (line  646)
  * __fracttati:                           Fixed-point fractional library routines.
!                                                              (line  669)
  * __fracttauda:                          Fixed-point fractional library routines.
!                                                              (line  661)
  * __fracttaudq:                          Fixed-point fractional library routines.
!                                                              (line  656)
  * __fracttauha:                          Fixed-point fractional library routines.
!                                                              (line  658)
  * __fracttauhq:                          Fixed-point fractional library routines.
!                                                              (line  653)
  * __fracttauqq:                          Fixed-point fractional library routines.
!                                                              (line  651)
  * __fracttausa:                          Fixed-point fractional library routines.
!                                                              (line  660)
  * __fracttausq:                          Fixed-point fractional library routines.
!                                                              (line  654)
  * __fracttauta:                          Fixed-point fractional library routines.
!                                                              (line  663)
  * __fracttida:                           Fixed-point fractional library routines.
!                                                              (line  998)
  * __fracttidq:                           Fixed-point fractional library routines.
!                                                              (line  995)
  * __fracttiha:                           Fixed-point fractional library routines.
!                                                              (line  996)
  * __fracttihq:                           Fixed-point fractional library routines.
!                                                              (line  993)
  * __fracttiqq:                           Fixed-point fractional library routines.
!                                                              (line  992)
  * __fracttisa:                           Fixed-point fractional library routines.
!                                                              (line  997)
  * __fracttisq:                           Fixed-point fractional library routines.
!                                                              (line  994)
  * __fracttita:                           Fixed-point fractional library routines.
!                                                              (line  999)
  * __fracttiuda:                          Fixed-point fractional library routines.
!                                                              (line 1007)
  * __fracttiudq:                          Fixed-point fractional library routines.
!                                                              (line 1003)
  * __fracttiuha:                          Fixed-point fractional library routines.
!                                                              (line 1005)
  * __fracttiuhq:                          Fixed-point fractional library routines.
!                                                              (line 1001)
  * __fracttiuqq:                          Fixed-point fractional library routines.
!                                                              (line 1000)
  * __fracttiusa:                          Fixed-point fractional library routines.
!                                                              (line 1006)
  * __fracttiusq:                          Fixed-point fractional library routines.
                                                               (line 1002)
+ * __fracttiuta:                          Fixed-point fractional library routines.
+                                                              (line 1008)
  * __fractudada:                          Fixed-point fractional library routines.
!                                                              (line  865)
  * __fractudadf:                          Fixed-point fractional library routines.
!                                                              (line  888)
  * __fractudadi:                          Fixed-point fractional library routines.
!                                                              (line  885)
  * __fractudadq:                          Fixed-point fractional library routines.
!                                                              (line  861)
  * __fractudaha:                          Fixed-point fractional library routines.
!                                                              (line  863)
  * __fractudahi:                          Fixed-point fractional library routines.
!                                                              (line  883)
  * __fractudahq:                          Fixed-point fractional library routines.
!                                                              (line  859)
  * __fractudaqi:                          Fixed-point fractional library routines.
!                                                              (line  882)
  * __fractudaqq:                          Fixed-point fractional library routines.
!                                                              (line  858)
  * __fractudasa:                          Fixed-point fractional library routines.
!                                                              (line  864)
  * __fractudasf:                          Fixed-point fractional library routines.
!                                                              (line  887)
  * __fractudasi:                          Fixed-point fractional library routines.
!                                                              (line  884)
  * __fractudasq:                          Fixed-point fractional library routines.
                                                               (line  860)
+ * __fractudata:                          Fixed-point fractional library routines.
+                                                              (line  866)
  * __fractudati:                          Fixed-point fractional library routines.
!                                                              (line  886)
  * __fractudaudq:                         Fixed-point fractional library routines.
!                                                              (line  874)
  * __fractudauha2:                        Fixed-point fractional library routines.
!                                                              (line  876)
  * __fractudauhq:                         Fixed-point fractional library routines.
!                                                              (line  870)
  * __fractudauqq:                         Fixed-point fractional library routines.
!                                                              (line  868)
  * __fractudausa2:                        Fixed-point fractional library routines.
!                                                              (line  878)
  * __fractudausq:                         Fixed-point fractional library routines.
!                                                              (line  872)
  * __fractudauta2:                        Fixed-point fractional library routines.
!                                                              (line  880)
  * __fractudqda:                          Fixed-point fractional library routines.
!                                                              (line  772)
  * __fractudqdf:                          Fixed-point fractional library routines.
!                                                              (line  798)
  * __fractudqdi:                          Fixed-point fractional library routines.
!                                                              (line  794)
  * __fractudqdq:                          Fixed-point fractional library routines.
!                                                              (line  767)
  * __fractudqha:                          Fixed-point fractional library routines.
!                                                              (line  769)
  * __fractudqhi:                          Fixed-point fractional library routines.
!                                                              (line  792)
  * __fractudqhq:                          Fixed-point fractional library routines.
!                                                              (line  764)
  * __fractudqqi:                          Fixed-point fractional library routines.
!                                                              (line  790)
  * __fractudqqq:                          Fixed-point fractional library routines.
!                                                              (line  762)
  * __fractudqsa:                          Fixed-point fractional library routines.
!                                                              (line  771)
  * __fractudqsf:                          Fixed-point fractional library routines.
!                                                              (line  797)
  * __fractudqsi:                          Fixed-point fractional library routines.
!                                                              (line  793)
  * __fractudqsq:                          Fixed-point fractional library routines.
!                                                              (line  765)
  * __fractudqta:                          Fixed-point fractional library routines.
!                                                              (line  774)
  * __fractudqti:                          Fixed-point fractional library routines.
!                                                              (line  795)
  * __fractudquda:                         Fixed-point fractional library routines.
!                                                              (line  786)
  * __fractudquha:                         Fixed-point fractional library routines.
!                                                              (line  782)
  * __fractudquhq2:                        Fixed-point fractional library routines.
!                                                              (line  778)
  * __fractudquqq2:                        Fixed-point fractional library routines.
!                                                              (line  776)
  * __fractudqusa:                         Fixed-point fractional library routines.
!                                                              (line  784)
  * __fractudqusq2:                        Fixed-point fractional library routines.
!                                                              (line  780)
  * __fractudquta:                         Fixed-point fractional library routines.
!                                                              (line  788)
  * __fractuhada:                          Fixed-point fractional library routines.
!                                                              (line  806)
  * __fractuhadf:                          Fixed-point fractional library routines.
!                                                              (line  829)
  * __fractuhadi:                          Fixed-point fractional library routines.
!                                                              (line  826)
  * __fractuhadq:                          Fixed-point fractional library routines.
!                                                              (line  802)
  * __fractuhaha:                          Fixed-point fractional library routines.
!                                                              (line  804)
  * __fractuhahi:                          Fixed-point fractional library routines.
!                                                              (line  824)
  * __fractuhahq:                          Fixed-point fractional library routines.
!                                                              (line  800)
  * __fractuhaqi:                          Fixed-point fractional library routines.
!                                                              (line  823)
  * __fractuhaqq:                          Fixed-point fractional library routines.
!                                                              (line  799)
  * __fractuhasa:                          Fixed-point fractional library routines.
!                                                              (line  805)
  * __fractuhasf:                          Fixed-point fractional library routines.
!                                                              (line  828)
  * __fractuhasi:                          Fixed-point fractional library routines.
!                                                              (line  825)
  * __fractuhasq:                          Fixed-point fractional library routines.
                                                               (line  801)
+ * __fractuhata:                          Fixed-point fractional library routines.
+                                                              (line  807)
  * __fractuhati:                          Fixed-point fractional library routines.
!                                                              (line  827)
  * __fractuhauda2:                        Fixed-point fractional library routines.
!                                                              (line  819)
  * __fractuhaudq:                         Fixed-point fractional library routines.
!                                                              (line  815)
  * __fractuhauhq:                         Fixed-point fractional library routines.
!                                                              (line  811)
  * __fractuhauqq:                         Fixed-point fractional library routines.
!                                                              (line  809)
  * __fractuhausa2:                        Fixed-point fractional library routines.
!                                                              (line  817)
  * __fractuhausq:                         Fixed-point fractional library routines.
!                                                              (line  813)
  * __fractuhauta2:                        Fixed-point fractional library routines.
!                                                              (line  821)
  * __fractuhqda:                          Fixed-point fractional library routines.
!                                                              (line  709)
  * __fractuhqdf:                          Fixed-point fractional library routines.
!                                                              (line  730)
  * __fractuhqdi:                          Fixed-point fractional library routines.
!                                                              (line  727)
  * __fractuhqdq:                          Fixed-point fractional library routines.
!                                                              (line  706)
  * __fractuhqha:                          Fixed-point fractional library routines.
!                                                              (line  707)
  * __fractuhqhi:                          Fixed-point fractional library routines.
!                                                              (line  725)
  * __fractuhqhq:                          Fixed-point fractional library routines.
!                                                              (line  704)
  * __fractuhqqi:                          Fixed-point fractional library routines.
!                                                              (line  724)
  * __fractuhqqq:                          Fixed-point fractional library routines.
!                                                              (line  703)
  * __fractuhqsa:                          Fixed-point fractional library routines.
!                                                              (line  708)
  * __fractuhqsf:                          Fixed-point fractional library routines.
!                                                              (line  729)
  * __fractuhqsi:                          Fixed-point fractional library routines.
!                                                              (line  726)
  * __fractuhqsq:                          Fixed-point fractional library routines.
!                                                              (line  705)
  * __fractuhqta:                          Fixed-point fractional library routines.
!                                                              (line  710)
  * __fractuhqti:                          Fixed-point fractional library routines.
!                                                              (line  728)
  * __fractuhquda:                         Fixed-point fractional library routines.
!                                                              (line  720)
  * __fractuhqudq2:                        Fixed-point fractional library routines.
!                                                              (line  715)
  * __fractuhquha:                         Fixed-point fractional library routines.
!                                                              (line  717)
  * __fractuhquqq2:                        Fixed-point fractional library routines.
!                                                              (line  711)
  * __fractuhqusa:                         Fixed-point fractional library routines.
!                                                              (line  719)
  * __fractuhqusq2:                        Fixed-point fractional library routines.
!                                                              (line  713)
  * __fractuhquta:                         Fixed-point fractional library routines.
!                                                              (line  722)
  * __fractunsdadi:                        Fixed-point fractional library routines.
!                                                              (line 1562)
  * __fractunsdahi:                        Fixed-point fractional library routines.
!                                                              (line 1560)
  * __fractunsdaqi:                        Fixed-point fractional library routines.
!                                                              (line 1559)
  * __fractunsdasi:                        Fixed-point fractional library routines.
!                                                              (line 1561)
  * __fractunsdati:                        Fixed-point fractional library routines.
!                                                              (line 1563)
  * __fractunsdida:                        Fixed-point fractional library routines.
!                                                              (line 1714)
  * __fractunsdidq:                        Fixed-point fractional library routines.
!                                                              (line 1711)
  * __fractunsdiha:                        Fixed-point fractional library routines.
!                                                              (line 1712)
  * __fractunsdihq:                        Fixed-point fractional library routines.
!                                                              (line 1709)
  * __fractunsdiqq:                        Fixed-point fractional library routines.
!                                                              (line 1708)
  * __fractunsdisa:                        Fixed-point fractional library routines.
!                                                              (line 1713)
  * __fractunsdisq:                        Fixed-point fractional library routines.
!                                                              (line 1710)
  * __fractunsdita:                        Fixed-point fractional library routines.
!                                                              (line 1715)
  * __fractunsdiuda:                       Fixed-point fractional library routines.
!                                                              (line 1726)
  * __fractunsdiudq:                       Fixed-point fractional library routines.
!                                                              (line 1721)
  * __fractunsdiuha:                       Fixed-point fractional library routines.
!                                                              (line 1723)
  * __fractunsdiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1718)
  * __fractunsdiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1716)
  * __fractunsdiusa:                       Fixed-point fractional library routines.
!                                                              (line 1725)
  * __fractunsdiusq:                       Fixed-point fractional library routines.
!                                                              (line 1719)
  * __fractunsdiuta:                       Fixed-point fractional library routines.
!                                                              (line 1728)
  * __fractunsdqdi:                        Fixed-point fractional library routines.
!                                                              (line 1546)
  * __fractunsdqhi:                        Fixed-point fractional library routines.
!                                                              (line 1544)
  * __fractunsdqqi:                        Fixed-point fractional library routines.
!                                                              (line 1543)
  * __fractunsdqsi:                        Fixed-point fractional library routines.
!                                                              (line 1545)
  * __fractunsdqti:                        Fixed-point fractional library routines.
!                                                              (line 1547)
  * __fractunshadi:                        Fixed-point fractional library routines.
!                                                              (line 1552)
  * __fractunshahi:                        Fixed-point fractional library routines.
!                                                              (line 1550)
  * __fractunshaqi:                        Fixed-point fractional library routines.
!                                                              (line 1549)
  * __fractunshasi:                        Fixed-point fractional library routines.
!                                                              (line 1551)
  * __fractunshati:                        Fixed-point fractional library routines.
!                                                              (line 1553)
  * __fractunshida:                        Fixed-point fractional library routines.
!                                                              (line 1670)
  * __fractunshidq:                        Fixed-point fractional library routines.
!                                                              (line 1667)
  * __fractunshiha:                        Fixed-point fractional library routines.
!                                                              (line 1668)
  * __fractunshihq:                        Fixed-point fractional library routines.
!                                                              (line 1665)
  * __fractunshiqq:                        Fixed-point fractional library routines.
!                                                              (line 1664)
  * __fractunshisa:                        Fixed-point fractional library routines.
!                                                              (line 1669)
  * __fractunshisq:                        Fixed-point fractional library routines.
!                                                              (line 1666)
  * __fractunshita:                        Fixed-point fractional library routines.
!                                                              (line 1671)
  * __fractunshiuda:                       Fixed-point fractional library routines.
!                                                              (line 1682)
  * __fractunshiudq:                       Fixed-point fractional library routines.
!                                                              (line 1677)
  * __fractunshiuha:                       Fixed-point fractional library routines.
!                                                              (line 1679)
  * __fractunshiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1674)
  * __fractunshiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1672)
  * __fractunshiusa:                       Fixed-point fractional library routines.
!                                                              (line 1681)
  * __fractunshiusq:                       Fixed-point fractional library routines.
!                                                              (line 1675)
  * __fractunshiuta:                       Fixed-point fractional library routines.
!                                                              (line 1684)
  * __fractunshqdi:                        Fixed-point fractional library routines.
!                                                              (line 1536)
  * __fractunshqhi:                        Fixed-point fractional library routines.
!                                                              (line 1534)
  * __fractunshqqi:                        Fixed-point fractional library routines.
!                                                              (line 1533)
  * __fractunshqsi:                        Fixed-point fractional library routines.
!                                                              (line 1535)
  * __fractunshqti:                        Fixed-point fractional library routines.
!                                                              (line 1537)
  * __fractunsqida:                        Fixed-point fractional library routines.
!                                                              (line 1648)
  * __fractunsqidq:                        Fixed-point fractional library routines.
!                                                              (line 1645)
  * __fractunsqiha:                        Fixed-point fractional library routines.
!                                                              (line 1646)
  * __fractunsqihq:                        Fixed-point fractional library routines.
!                                                              (line 1643)
  * __fractunsqiqq:                        Fixed-point fractional library routines.
!                                                              (line 1642)
  * __fractunsqisa:                        Fixed-point fractional library routines.
!                                                              (line 1647)
  * __fractunsqisq:                        Fixed-point fractional library routines.
!                                                              (line 1644)
  * __fractunsqita:                        Fixed-point fractional library routines.
!                                                              (line 1649)
  * __fractunsqiuda:                       Fixed-point fractional library routines.
!                                                              (line 1660)
  * __fractunsqiudq:                       Fixed-point fractional library routines.
!                                                              (line 1655)
  * __fractunsqiuha:                       Fixed-point fractional library routines.
!                                                              (line 1657)
  * __fractunsqiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1652)
  * __fractunsqiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1650)
  * __fractunsqiusa:                       Fixed-point fractional library routines.
!                                                              (line 1659)
  * __fractunsqiusq:                       Fixed-point fractional library routines.
!                                                              (line 1653)
  * __fractunsqiuta:                       Fixed-point fractional library routines.
!                                                              (line 1662)
  * __fractunsqqdi:                        Fixed-point fractional library routines.
!                                                              (line 1531)
  * __fractunsqqhi:                        Fixed-point fractional library routines.
!                                                              (line 1529)
  * __fractunsqqqi:                        Fixed-point fractional library routines.
!                                                              (line 1528)
  * __fractunsqqsi:                        Fixed-point fractional library routines.
!                                                              (line 1530)
  * __fractunsqqti:                        Fixed-point fractional library routines.
!                                                              (line 1532)
  * __fractunssadi:                        Fixed-point fractional library routines.
!                                                              (line 1557)
  * __fractunssahi:                        Fixed-point fractional library routines.
!                                                              (line 1555)
  * __fractunssaqi:                        Fixed-point fractional library routines.
!                                                              (line 1554)
  * __fractunssasi:                        Fixed-point fractional library routines.
!                                                              (line 1556)
  * __fractunssati:                        Fixed-point fractional library routines.
!                                                              (line 1558)
  * __fractunssida:                        Fixed-point fractional library routines.
!                                                              (line 1692)
  * __fractunssidq:                        Fixed-point fractional library routines.
!                                                              (line 1689)
  * __fractunssiha:                        Fixed-point fractional library routines.
!                                                              (line 1690)
  * __fractunssihq:                        Fixed-point fractional library routines.
!                                                              (line 1687)
  * __fractunssiqq:                        Fixed-point fractional library routines.
!                                                              (line 1686)
  * __fractunssisa:                        Fixed-point fractional library routines.
!                                                              (line 1691)
  * __fractunssisq:                        Fixed-point fractional library routines.
!                                                              (line 1688)
  * __fractunssita:                        Fixed-point fractional library routines.
!                                                              (line 1693)
  * __fractunssiuda:                       Fixed-point fractional library routines.
!                                                              (line 1704)
  * __fractunssiudq:                       Fixed-point fractional library routines.
!                                                              (line 1699)
  * __fractunssiuha:                       Fixed-point fractional library routines.
!                                                              (line 1701)
  * __fractunssiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1696)
  * __fractunssiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1694)
  * __fractunssiusa:                       Fixed-point fractional library routines.
!                                                              (line 1703)
  * __fractunssiusq:                       Fixed-point fractional library routines.
!                                                              (line 1697)
  * __fractunssiuta:                       Fixed-point fractional library routines.
!                                                              (line 1706)
  * __fractunssqdi:                        Fixed-point fractional library routines.
!                                                              (line 1541)
  * __fractunssqhi:                        Fixed-point fractional library routines.
!                                                              (line 1539)
  * __fractunssqqi:                        Fixed-point fractional library routines.
!                                                              (line 1538)
  * __fractunssqsi:                        Fixed-point fractional library routines.
!                                                              (line 1540)
  * __fractunssqti:                        Fixed-point fractional library routines.
!                                                              (line 1542)
  * __fractunstadi:                        Fixed-point fractional library routines.
!                                                              (line 1567)
  * __fractunstahi:                        Fixed-point fractional library routines.
!                                                              (line 1565)
  * __fractunstaqi:                        Fixed-point fractional library routines.
!                                                              (line 1564)
  * __fractunstasi:                        Fixed-point fractional library routines.
!                                                              (line 1566)
  * __fractunstati:                        Fixed-point fractional library routines.
!                                                              (line 1568)
  * __fractunstida:                        Fixed-point fractional library routines.
!                                                              (line 1737)
  * __fractunstidq:                        Fixed-point fractional library routines.
!                                                              (line 1733)
  * __fractunstiha:                        Fixed-point fractional library routines.
!                                                              (line 1735)
  * __fractunstihq:                        Fixed-point fractional library routines.
!                                                              (line 1731)
  * __fractunstiqq:                        Fixed-point fractional library routines.
!                                                              (line 1730)
  * __fractunstisa:                        Fixed-point fractional library routines.
!                                                              (line 1736)
  * __fractunstisq:                        Fixed-point fractional library routines.
                                                               (line 1732)
+ * __fractunstita:                        Fixed-point fractional library routines.
+                                                              (line 1738)
  * __fractunstiuda:                       Fixed-point fractional library routines.
!                                                              (line 1752)
  * __fractunstiudq:                       Fixed-point fractional library routines.
!                                                              (line 1746)
  * __fractunstiuha:                       Fixed-point fractional library routines.
!                                                              (line 1748)
  * __fractunstiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1742)
  * __fractunstiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1740)
  * __fractunstiusa:                       Fixed-point fractional library routines.
!                                                              (line 1750)
  * __fractunstiusq:                       Fixed-point fractional library routines.
!                                                              (line 1744)
  * __fractunstiuta:                       Fixed-point fractional library routines.
!                                                              (line 1754)
  * __fractunsudadi:                       Fixed-point fractional library routines.
!                                                              (line 1628)
  * __fractunsudahi:                       Fixed-point fractional library routines.
!                                                              (line 1624)
  * __fractunsudaqi:                       Fixed-point fractional library routines.
!                                                              (line 1622)
  * __fractunsudasi:                       Fixed-point fractional library routines.
!                                                              (line 1626)
  * __fractunsudati:                       Fixed-point fractional library routines.
!                                                              (line 1630)
  * __fractunsudqdi:                       Fixed-point fractional library routines.
!                                                              (line 1602)
  * __fractunsudqhi:                       Fixed-point fractional library routines.
!                                                              (line 1598)
  * __fractunsudqqi:                       Fixed-point fractional library routines.
!                                                              (line 1596)
  * __fractunsudqsi:                       Fixed-point fractional library routines.
!                                                              (line 1600)
  * __fractunsudqti:                       Fixed-point fractional library routines.
!                                                              (line 1604)
  * __fractunsuhadi:                       Fixed-point fractional library routines.
!                                                              (line 1612)
  * __fractunsuhahi:                       Fixed-point fractional library routines.
!                                                              (line 1608)
  * __fractunsuhaqi:                       Fixed-point fractional library routines.
!                                                              (line 1606)
  * __fractunsuhasi:                       Fixed-point fractional library routines.
!                                                              (line 1610)
  * __fractunsuhati:                       Fixed-point fractional library routines.
!                                                              (line 1614)
  * __fractunsuhqdi:                       Fixed-point fractional library routines.
!                                                              (line 1583)
  * __fractunsuhqhi:                       Fixed-point fractional library routines.
!                                                              (line 1581)
  * __fractunsuhqqi:                       Fixed-point fractional library routines.
!                                                              (line 1580)
  * __fractunsuhqsi:                       Fixed-point fractional library routines.
!                                                              (line 1582)
  * __fractunsuhqti:                       Fixed-point fractional library routines.
!                                                              (line 1584)
  * __fractunsuqqdi:                       Fixed-point fractional library routines.
!                                                              (line 1576)
  * __fractunsuqqhi:                       Fixed-point fractional library routines.
!                                                              (line 1572)
  * __fractunsuqqqi:                       Fixed-point fractional library routines.
!                                                              (line 1570)
  * __fractunsuqqsi:                       Fixed-point fractional library routines.
!                                                              (line 1574)
  * __fractunsuqqti:                       Fixed-point fractional library routines.
!                                                              (line 1578)
  * __fractunsusadi:                       Fixed-point fractional library routines.
!                                                              (line 1619)
  * __fractunsusahi:                       Fixed-point fractional library routines.
!                                                              (line 1617)
  * __fractunsusaqi:                       Fixed-point fractional library routines.
!                                                              (line 1616)
  * __fractunsusasi:                       Fixed-point fractional library routines.
!                                                              (line 1618)
  * __fractunsusati:                       Fixed-point fractional library routines.
!                                                              (line 1620)
  * __fractunsusqdi:                       Fixed-point fractional library routines.
!                                                              (line 1592)
  * __fractunsusqhi:                       Fixed-point fractional library routines.
!                                                              (line 1588)
  * __fractunsusqqi:                       Fixed-point fractional library routines.
!                                                              (line 1586)
  * __fractunsusqsi:                       Fixed-point fractional library routines.
!                                                              (line 1590)
  * __fractunsusqti:                       Fixed-point fractional library routines.
!                                                              (line 1594)
  * __fractunsutadi:                       Fixed-point fractional library routines.
!                                                              (line 1638)
  * __fractunsutahi:                       Fixed-point fractional library routines.
!                                                              (line 1634)
  * __fractunsutaqi:                       Fixed-point fractional library routines.
!                                                              (line 1632)
  * __fractunsutasi:                       Fixed-point fractional library routines.
!                                                              (line 1636)
  * __fractunsutati:                       Fixed-point fractional library routines.
!                                                              (line 1640)
  * __fractuqqda:                          Fixed-point fractional library routines.
!                                                              (line  679)
  * __fractuqqdf:                          Fixed-point fractional library routines.
!                                                              (line  702)
  * __fractuqqdi:                          Fixed-point fractional library routines.
!                                                              (line  699)
  * __fractuqqdq:                          Fixed-point fractional library routines.
!                                                              (line  675)
  * __fractuqqha:                          Fixed-point fractional library routines.
!                                                              (line  677)
  * __fractuqqhi:                          Fixed-point fractional library routines.
!                                                              (line  697)
  * __fractuqqhq:                          Fixed-point fractional library routines.
!                                                              (line  673)
  * __fractuqqqi:                          Fixed-point fractional library routines.
!                                                              (line  696)
  * __fractuqqqq:                          Fixed-point fractional library routines.
!                                                              (line  672)
  * __fractuqqsa:                          Fixed-point fractional library routines.
!                                                              (line  678)
  * __fractuqqsf:                          Fixed-point fractional library routines.
!                                                              (line  701)
  * __fractuqqsi:                          Fixed-point fractional library routines.
!                                                              (line  698)
  * __fractuqqsq:                          Fixed-point fractional library routines.
                                                               (line  674)
+ * __fractuqqta:                          Fixed-point fractional library routines.
+                                                              (line  680)
  * __fractuqqti:                          Fixed-point fractional library routines.
!                                                              (line  700)
  * __fractuqquda:                         Fixed-point fractional library routines.
!                                                              (line  692)
  * __fractuqqudq2:                        Fixed-point fractional library routines.
!                                                              (line  686)
  * __fractuqquha:                         Fixed-point fractional library routines.
!                                                              (line  688)
  * __fractuqquhq2:                        Fixed-point fractional library routines.
!                                                              (line  682)
  * __fractuqqusa:                         Fixed-point fractional library routines.
!                                                              (line  690)
  * __fractuqqusq2:                        Fixed-point fractional library routines.
!                                                              (line  684)
  * __fractuqquta:                         Fixed-point fractional library routines.
!                                                              (line  694)
  * __fractusada:                          Fixed-point fractional library routines.
!                                                              (line  836)
  * __fractusadf:                          Fixed-point fractional library routines.
!                                                              (line  857)
  * __fractusadi:                          Fixed-point fractional library routines.
!                                                              (line  854)
  * __fractusadq:                          Fixed-point fractional library routines.
!                                                              (line  833)
  * __fractusaha:                          Fixed-point fractional library routines.
!                                                              (line  834)
  * __fractusahi:                          Fixed-point fractional library routines.
!                                                              (line  852)
  * __fractusahq:                          Fixed-point fractional library routines.
!                                                              (line  831)
  * __fractusaqi:                          Fixed-point fractional library routines.
!                                                              (line  851)
  * __fractusaqq:                          Fixed-point fractional library routines.
!                                                              (line  830)
  * __fractusasa:                          Fixed-point fractional library routines.
!                                                              (line  835)
  * __fractusasf:                          Fixed-point fractional library routines.
!                                                              (line  856)
  * __fractusasi:                          Fixed-point fractional library routines.
!                                                              (line  853)
  * __fractusasq:                          Fixed-point fractional library routines.
!                                                              (line  832)
  * __fractusata:                          Fixed-point fractional library routines.
!                                                              (line  837)
  * __fractusati:                          Fixed-point fractional library routines.
!                                                              (line  855)
  * __fractusauda2:                        Fixed-point fractional library routines.
!                                                              (line  847)
  * __fractusaudq:                         Fixed-point fractional library routines.
!                                                              (line  843)
  * __fractusauha2:                        Fixed-point fractional library routines.
!                                                              (line  845)
  * __fractusauhq:                         Fixed-point fractional library routines.
!                                                              (line  840)
  * __fractusauqq:                         Fixed-point fractional library routines.
!                                                              (line  838)
  * __fractusausq:                         Fixed-point fractional library routines.
!                                                              (line  841)
  * __fractusauta2:                        Fixed-point fractional library routines.
!                                                              (line  849)
  * __fractusqda:                          Fixed-point fractional library routines.
!                                                              (line  738)
  * __fractusqdf:                          Fixed-point fractional library routines.
!                                                              (line  761)
  * __fractusqdi:                          Fixed-point fractional library routines.
!                                                              (line  758)
  * __fractusqdq:                          Fixed-point fractional library routines.
!                                                              (line  734)
  * __fractusqha:                          Fixed-point fractional library routines.
!                                                              (line  736)
  * __fractusqhi:                          Fixed-point fractional library routines.
!                                                              (line  756)
  * __fractusqhq:                          Fixed-point fractional library routines.
!                                                              (line  732)
  * __fractusqqi:                          Fixed-point fractional library routines.
!                                                              (line  755)
  * __fractusqqq:                          Fixed-point fractional library routines.
!                                                              (line  731)
  * __fractusqsa:                          Fixed-point fractional library routines.
!                                                              (line  737)
  * __fractusqsf:                          Fixed-point fractional library routines.
!                                                              (line  760)
  * __fractusqsi:                          Fixed-point fractional library routines.
!                                                              (line  757)
  * __fractusqsq:                          Fixed-point fractional library routines.
                                                               (line  733)
+ * __fractusqta:                          Fixed-point fractional library routines.
+                                                              (line  739)
  * __fractusqti:                          Fixed-point fractional library routines.
!                                                              (line  759)
  * __fractusquda:                         Fixed-point fractional library routines.
!                                                              (line  751)
  * __fractusqudq2:                        Fixed-point fractional library routines.
!                                                              (line  745)
  * __fractusquha:                         Fixed-point fractional library routines.
!                                                              (line  747)
  * __fractusquhq2:                        Fixed-point fractional library routines.
!                                                              (line  743)
  * __fractusquqq2:                        Fixed-point fractional library routines.
!                                                              (line  741)
  * __fractusqusa:                         Fixed-point fractional library routines.
!                                                              (line  749)
  * __fractusquta:                         Fixed-point fractional library routines.
!                                                              (line  753)
  * __fractutada:                          Fixed-point fractional library routines.
!                                                              (line  899)
  * __fractutadf:                          Fixed-point fractional library routines.
!                                                              (line  925)
  * __fractutadi:                          Fixed-point fractional library routines.
!                                                              (line  921)
  * __fractutadq:                          Fixed-point fractional library routines.
!                                                              (line  894)
  * __fractutaha:                          Fixed-point fractional library routines.
!                                                              (line  896)
  * __fractutahi:                          Fixed-point fractional library routines.
!                                                              (line  919)
  * __fractutahq:                          Fixed-point fractional library routines.
!                                                              (line  891)
  * __fractutaqi:                          Fixed-point fractional library routines.
!                                                              (line  917)
  * __fractutaqq:                          Fixed-point fractional library routines.
!                                                              (line  889)
  * __fractutasa:                          Fixed-point fractional library routines.
!                                                              (line  898)
  * __fractutasf:                          Fixed-point fractional library routines.
!                                                              (line  924)
  * __fractutasi:                          Fixed-point fractional library routines.
!                                                              (line  920)
  * __fractutasq:                          Fixed-point fractional library routines.
!                                                              (line  892)
  * __fractutata:                          Fixed-point fractional library routines.
!                                                              (line  901)
  * __fractutati:                          Fixed-point fractional library routines.
!                                                              (line  922)
  * __fractutauda2:                        Fixed-point fractional library routines.
!                                                              (line  915)
  * __fractutaudq:                         Fixed-point fractional library routines.
!                                                              (line  909)
  * __fractutauha2:                        Fixed-point fractional library routines.
!                                                              (line  911)
  * __fractutauhq:                         Fixed-point fractional library routines.
!                                                              (line  905)
  * __fractutauqq:                         Fixed-point fractional library routines.
!                                                              (line  903)
  * __fractutausa2:                        Fixed-point fractional library routines.
!                                                              (line  913)
  * __fractutausq:                         Fixed-point fractional library routines.
!                                                              (line  907)
  * __gedf2:                               Soft float library routines.
                                                               (line  205)
+ * __gesf2:                               Soft float library routines.
+                                                              (line  204)
  * __getf2:                               Soft float library routines.
!                                                              (line  206)
  * __gtdf2:                               Soft float library routines.
                                                               (line  223)
+ * __gtsf2:                               Soft float library routines.
+                                                              (line  222)
  * __gttf2:                               Soft float library routines.
!                                                              (line  224)
  * __ledf2:                               Soft float library routines.
                                                               (line  217)
+ * __lesf2:                               Soft float library routines.
+                                                              (line  216)
  * __letf2:                               Soft float library routines.
!                                                              (line  218)
  * __lshrdi3:                             Integer library routines.
                                                               (line   30)
+ * __lshrsi3:                             Integer library routines.
+                                                              (line   29)
  * __lshrti3:                             Integer library routines.
!                                                              (line   31)
  * __lshruda3:                            Fixed-point fractional library routines.
!                                                              (line  396)
  * __lshrudq3:                            Fixed-point fractional library routines.
!                                                              (line  390)
  * __lshruha3:                            Fixed-point fractional library routines.
!                                                              (line  392)
  * __lshruhq3:                            Fixed-point fractional library routines.
!                                                              (line  386)
  * __lshruqq3:                            Fixed-point fractional library routines.
!                                                              (line  384)
  * __lshrusa3:                            Fixed-point fractional library routines.
!                                                              (line  394)
  * __lshrusq3:                            Fixed-point fractional library routines.
!                                                              (line  388)
  * __lshruta3:                            Fixed-point fractional library routines.
!                                                              (line  398)
  * __ltdf2:                               Soft float library routines.
                                                               (line  211)
+ * __ltsf2:                               Soft float library routines.
+                                                              (line  210)
  * __lttf2:                               Soft float library routines.
!                                                              (line  212)
  * __main:                                Collect2.           (line   15)
  * __moddi3:                              Integer library routines.
                                                               (line   36)
+ * __modsi3:                              Integer library routines.
+                                                              (line   35)
  * __modti3:                              Integer library routines.
!                                                              (line   37)
  * __morestack_current_segment:           Miscellaneous routines.
!                                                              (line   45)
  * __morestack_initial_sp:                Miscellaneous routines.
!                                                              (line   46)
  * __morestack_segments:                  Miscellaneous routines.
!                                                              (line   44)
  * __mulda3:                              Fixed-point fractional library routines.
!                                                              (line  178)
  * __muldc3:                              Soft float library routines.
!                                                              (line  239)
  * __muldf3:                              Soft float library routines.
!                                                              (line   39)
  * __muldi3:                              Integer library routines.
!                                                              (line   42)
  * __muldq3:                              Fixed-point fractional library routines.
!                                                              (line  165)
  * __mulha3:                              Fixed-point fractional library routines.
!                                                              (line  175)
  * __mulhq3:                              Fixed-point fractional library routines.
!                                                              (line  163)
  * __mulqq3:                              Fixed-point fractional library routines.
!                                                              (line  161)
  * __mulsa3:                              Fixed-point fractional library routines.
!                                                              (line  177)
  * __mulsc3:                              Soft float library routines.
!                                                              (line  237)
  * __mulsf3:                              Soft float library routines.
!                                                              (line   38)
  * __mulsi3:                              Integer library routines.
!                                                              (line   41)
  * __mulsq3:                              Fixed-point fractional library routines.
!                                                              (line  164)
  * __multa3:                              Fixed-point fractional library routines.
!                                                              (line  179)
  * __multc3:                              Soft float library routines.
!                                                              (line  241)
  * __multf3:                              Soft float library routines.
!                                                              (line   40)
  * __multi3:                              Integer library routines.
!                                                              (line   43)
  * __muluda3:                             Fixed-point fractional library routines.
!                                                              (line  185)
  * __muludq3:                             Fixed-point fractional library routines.
!                                                              (line  173)
  * __muluha3:                             Fixed-point fractional library routines.
!                                                              (line  181)
  * __muluhq3:                             Fixed-point fractional library routines.
!                                                              (line  169)
  * __muluqq3:                             Fixed-point fractional library routines.
!                                                              (line  167)
  * __mulusa3:                             Fixed-point fractional library routines.
!                                                              (line  183)
  * __mulusq3:                             Fixed-point fractional library routines.
!                                                              (line  171)
  * __muluta3:                             Fixed-point fractional library routines.
!                                                              (line  187)
  * __mulvdi3:                             Integer library routines.
                                                               (line  114)
+ * __mulvsi3:                             Integer library routines.
+                                                              (line  113)
  * __mulxc3:                              Soft float library routines.
!                                                              (line  243)
  * __mulxf3:                              Soft float library routines.
!                                                              (line   42)
  * __nedf2:                               Soft float library routines.
!                                                              (line  199)
  * __negda2:                              Fixed-point fractional library routines.
!                                                              (line  306)
  * __negdf2:                              Soft float library routines.
!                                                              (line   55)
  * __negdi2:                              Integer library routines.
!                                                              (line   46)
  * __negdq2:                              Fixed-point fractional library routines.
!                                                              (line  296)
  * __negha2:                              Fixed-point fractional library routines.
!                                                              (line  304)
  * __neghq2:                              Fixed-point fractional library routines.
!                                                              (line  294)
  * __negqq2:                              Fixed-point fractional library routines.
!                                                              (line  293)
  * __negsa2:                              Fixed-point fractional library routines.
!                                                              (line  305)
  * __negsf2:                              Soft float library routines.
!                                                              (line   54)
  * __negsq2:                              Fixed-point fractional library routines.
!                                                              (line  295)
  * __negta2:                              Fixed-point fractional library routines.
!                                                              (line  307)
  * __negtf2:                              Soft float library routines.
!                                                              (line   56)
  * __negti2:                              Integer library routines.
!                                                              (line   47)
  * __neguda2:                             Fixed-point fractional library routines.
!                                                              (line  311)
  * __negudq2:                             Fixed-point fractional library routines.
                                                               (line  302)
+ * __neguha2:                             Fixed-point fractional library routines.
+                                                              (line  308)
  * __neguhq2:                             Fixed-point fractional library routines.
!                                                              (line  299)
  * __neguqq2:                             Fixed-point fractional library routines.
!                                                              (line  297)
  * __negusa2:                             Fixed-point fractional library routines.
!                                                              (line  310)
  * __negusq2:                             Fixed-point fractional library routines.
!                                                              (line  300)
  * __neguta2:                             Fixed-point fractional library routines.
!                                                              (line  313)
  * __negvdi2:                             Integer library routines.
                                                               (line  118)
+ * __negvsi2:                             Integer library routines.
+                                                              (line  117)
  * __negxf2:                              Soft float library routines.
!                                                              (line   57)
  * __nesf2:                               Soft float library routines.
!                                                              (line  198)
  * __netf2:                               Soft float library routines.
!                                                              (line  200)
  * __paritydi2:                           Integer library routines.
                                                               (line  150)
+ * __paritysi2:                           Integer library routines.
+                                                              (line  149)
  * __parityti2:                           Integer library routines.
!                                                              (line  151)
  * __popcountdi2:                         Integer library routines.
                                                               (line  156)
+ * __popcountsi2:                         Integer library routines.
+                                                              (line  155)
  * __popcountti2:                         Integer library routines.
!                                                              (line  157)
  * __powidf2:                             Soft float library routines.
                                                               (line  232)
+ * __powisf2:                             Soft float library routines.
+                                                              (line  231)
  * __powitf2:                             Soft float library routines.
!                                                              (line  233)
  * __powixf2:                             Soft float library routines.
!                                                              (line  234)
  * __satfractdadq:                        Fixed-point fractional library routines.
!                                                              (line 1160)
  * __satfractdaha2:                       Fixed-point fractional library routines.
!                                                              (line 1161)
  * __satfractdahq:                        Fixed-point fractional library routines.
!                                                              (line 1158)
  * __satfractdaqq:                        Fixed-point fractional library routines.
!                                                              (line 1157)
  * __satfractdasa2:                       Fixed-point fractional library routines.
!                                                              (line 1162)
  * __satfractdasq:                        Fixed-point fractional library routines.
!                                                              (line 1159)
  * __satfractdata2:                       Fixed-point fractional library routines.
!                                                              (line 1163)
  * __satfractdauda:                       Fixed-point fractional library routines.
!                                                              (line 1173)
  * __satfractdaudq:                       Fixed-point fractional library routines.
!                                                              (line 1168)
  * __satfractdauha:                       Fixed-point fractional library routines.
!                                                              (line 1170)
  * __satfractdauhq:                       Fixed-point fractional library routines.
!                                                              (line 1166)
  * __satfractdauqq:                       Fixed-point fractional library routines.
!                                                              (line 1164)
  * __satfractdausa:                       Fixed-point fractional library routines.
!                                                              (line 1172)
  * __satfractdausq:                       Fixed-point fractional library routines.
!                                                              (line 1167)
  * __satfractdauta:                       Fixed-point fractional library routines.
!                                                              (line 1174)
  * __satfractdfda:                        Fixed-point fractional library routines.
!                                                              (line 1513)
  * __satfractdfdq:                        Fixed-point fractional library routines.
!                                                              (line 1510)
  * __satfractdfha:                        Fixed-point fractional library routines.
!                                                              (line 1511)
  * __satfractdfhq:                        Fixed-point fractional library routines.
!                                                              (line 1508)
  * __satfractdfqq:                        Fixed-point fractional library routines.
!                                                              (line 1507)
  * __satfractdfsa:                        Fixed-point fractional library routines.
!                                                              (line 1512)
  * __satfractdfsq:                        Fixed-point fractional library routines.
!                                                              (line 1509)
  * __satfractdfta:                        Fixed-point fractional library routines.
!                                                              (line 1514)
  * __satfractdfuda:                       Fixed-point fractional library routines.
!                                                              (line 1522)
  * __satfractdfudq:                       Fixed-point fractional library routines.
!                                                              (line 1518)
  * __satfractdfuha:                       Fixed-point fractional library routines.
!                                                              (line 1520)
  * __satfractdfuhq:                       Fixed-point fractional library routines.
!                                                              (line 1516)
  * __satfractdfuqq:                       Fixed-point fractional library routines.
!                                                              (line 1515)
  * __satfractdfusa:                       Fixed-point fractional library routines.
!                                                              (line 1521)
  * __satfractdfusq:                       Fixed-point fractional library routines.
                                                               (line 1517)
+ * __satfractdfuta:                       Fixed-point fractional library routines.
+                                                              (line 1523)
  * __satfractdida:                        Fixed-point fractional library routines.
!                                                              (line 1463)
  * __satfractdidq:                        Fixed-point fractional library routines.
!                                                              (line 1460)
  * __satfractdiha:                        Fixed-point fractional library routines.
!                                                              (line 1461)
  * __satfractdihq:                        Fixed-point fractional library routines.
!                                                              (line 1458)
  * __satfractdiqq:                        Fixed-point fractional library routines.
!                                                              (line 1457)
  * __satfractdisa:                        Fixed-point fractional library routines.
!                                                              (line 1462)
  * __satfractdisq:                        Fixed-point fractional library routines.
!                                                              (line 1459)
  * __satfractdita:                        Fixed-point fractional library routines.
                                                               (line 1464)
+ * __satfractdiuda:                       Fixed-point fractional library routines.
+                                                              (line 1471)
  * __satfractdiudq:                       Fixed-point fractional library routines.
!                                                              (line 1468)
  * __satfractdiuha:                       Fixed-point fractional library routines.
!                                                              (line 1469)
  * __satfractdiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1466)
  * __satfractdiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1465)
  * __satfractdiusa:                       Fixed-point fractional library routines.
!                                                              (line 1470)
  * __satfractdiusq:                       Fixed-point fractional library routines.
!                                                              (line 1467)
  * __satfractdiuta:                       Fixed-point fractional library routines.
!                                                              (line 1472)
  * __satfractdqda:                        Fixed-point fractional library routines.
!                                                              (line 1105)
  * __satfractdqha:                        Fixed-point fractional library routines.
!                                                              (line 1103)
  * __satfractdqhq2:                       Fixed-point fractional library routines.
!                                                              (line 1101)
  * __satfractdqqq2:                       Fixed-point fractional library routines.
!                                                              (line 1100)
  * __satfractdqsa:                        Fixed-point fractional library routines.
!                                                              (line 1104)
  * __satfractdqsq2:                       Fixed-point fractional library routines.
!                                                              (line 1102)
  * __satfractdqta:                        Fixed-point fractional library routines.
!                                                              (line 1106)
  * __satfractdquda:                       Fixed-point fractional library routines.
!                                                              (line 1117)
  * __satfractdqudq:                       Fixed-point fractional library routines.
!                                                              (line 1112)
  * __satfractdquha:                       Fixed-point fractional library routines.
!                                                              (line 1114)
  * __satfractdquhq:                       Fixed-point fractional library routines.
!                                                              (line 1109)
  * __satfractdquqq:                       Fixed-point fractional library routines.
!                                                              (line 1107)
  * __satfractdqusa:                       Fixed-point fractional library routines.
!                                                              (line 1116)
  * __satfractdqusq:                       Fixed-point fractional library routines.
!                                                              (line 1110)
  * __satfractdquta:                       Fixed-point fractional library routines.
                                                               (line 1119)
+ * __satfracthada2:                       Fixed-point fractional library routines.
+                                                              (line 1126)
  * __satfracthadq:                        Fixed-point fractional library routines.
!                                                              (line 1124)
  * __satfracthahq:                        Fixed-point fractional library routines.
!                                                              (line 1122)
  * __satfracthaqq:                        Fixed-point fractional library routines.
!                                                              (line 1121)
  * __satfracthasa2:                       Fixed-point fractional library routines.
!                                                              (line 1125)
  * __satfracthasq:                        Fixed-point fractional library routines.
!                                                              (line 1123)
  * __satfracthata2:                       Fixed-point fractional library routines.
!                                                              (line 1127)
  * __satfracthauda:                       Fixed-point fractional library routines.
!                                                              (line 1138)
  * __satfracthaudq:                       Fixed-point fractional library routines.
!                                                              (line 1133)
  * __satfracthauha:                       Fixed-point fractional library routines.
!                                                              (line 1135)
  * __satfracthauhq:                       Fixed-point fractional library routines.
!                                                              (line 1130)
  * __satfracthauqq:                       Fixed-point fractional library routines.
!                                                              (line 1128)
  * __satfracthausa:                       Fixed-point fractional library routines.
!                                                              (line 1137)
  * __satfracthausq:                       Fixed-point fractional library routines.
!                                                              (line 1131)
  * __satfracthauta:                       Fixed-point fractional library routines.
!                                                              (line 1140)
  * __satfracthida:                        Fixed-point fractional library routines.
!                                                              (line 1431)
  * __satfracthidq:                        Fixed-point fractional library routines.
!                                                              (line 1428)
  * __satfracthiha:                        Fixed-point fractional library routines.
!                                                              (line 1429)
  * __satfracthihq:                        Fixed-point fractional library routines.
!                                                              (line 1426)
  * __satfracthiqq:                        Fixed-point fractional library routines.
!                                                              (line 1425)
  * __satfracthisa:                        Fixed-point fractional library routines.
!                                                              (line 1430)
  * __satfracthisq:                        Fixed-point fractional library routines.
!                                                              (line 1427)
  * __satfracthita:                        Fixed-point fractional library routines.
                                                               (line 1432)
+ * __satfracthiuda:                       Fixed-point fractional library routines.
+                                                              (line 1439)
  * __satfracthiudq:                       Fixed-point fractional library routines.
!                                                              (line 1436)
  * __satfracthiuha:                       Fixed-point fractional library routines.
!                                                              (line 1437)
  * __satfracthiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1434)
  * __satfracthiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1433)
  * __satfracthiusa:                       Fixed-point fractional library routines.
!                                                              (line 1438)
  * __satfracthiusq:                       Fixed-point fractional library routines.
!                                                              (line 1435)
  * __satfracthiuta:                       Fixed-point fractional library routines.
!                                                              (line 1440)
  * __satfracthqda:                        Fixed-point fractional library routines.
!                                                              (line 1071)
  * __satfracthqdq2:                       Fixed-point fractional library routines.
!                                                              (line 1068)
  * __satfracthqha:                        Fixed-point fractional library routines.
!                                                              (line 1069)
  * __satfracthqqq2:                       Fixed-point fractional library routines.
!                                                              (line 1066)
  * __satfracthqsa:                        Fixed-point fractional library routines.
!                                                              (line 1070)
  * __satfracthqsq2:                       Fixed-point fractional library routines.
!                                                              (line 1067)
  * __satfracthqta:                        Fixed-point fractional library routines.
                                                               (line 1072)
+ * __satfracthquda:                       Fixed-point fractional library routines.
+                                                              (line 1079)
  * __satfracthqudq:                       Fixed-point fractional library routines.
!                                                              (line 1076)
  * __satfracthquha:                       Fixed-point fractional library routines.
!                                                              (line 1077)
  * __satfracthquhq:                       Fixed-point fractional library routines.
!                                                              (line 1074)
  * __satfracthquqq:                       Fixed-point fractional library routines.
!                                                              (line 1073)
  * __satfracthqusa:                       Fixed-point fractional library routines.
!                                                              (line 1078)
  * __satfracthqusq:                       Fixed-point fractional library routines.
!                                                              (line 1075)
  * __satfracthquta:                       Fixed-point fractional library routines.
!                                                              (line 1080)
  * __satfractqida:                        Fixed-point fractional library routines.
!                                                              (line 1409)
  * __satfractqidq:                        Fixed-point fractional library routines.
!                                                              (line 1406)
  * __satfractqiha:                        Fixed-point fractional library routines.
!                                                              (line 1407)
  * __satfractqihq:                        Fixed-point fractional library routines.
!                                                              (line 1404)
  * __satfractqiqq:                        Fixed-point fractional library routines.
!                                                              (line 1403)
  * __satfractqisa:                        Fixed-point fractional library routines.
!                                                              (line 1408)
  * __satfractqisq:                        Fixed-point fractional library routines.
!                                                              (line 1405)
  * __satfractqita:                        Fixed-point fractional library routines.
!                                                              (line 1410)
  * __satfractqiuda:                       Fixed-point fractional library routines.
!                                                              (line 1421)
  * __satfractqiudq:                       Fixed-point fractional library routines.
!                                                              (line 1416)
  * __satfractqiuha:                       Fixed-point fractional library routines.
!                                                              (line 1418)
  * __satfractqiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1413)
  * __satfractqiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1411)
  * __satfractqiusa:                       Fixed-point fractional library routines.
!                                                              (line 1420)
  * __satfractqiusq:                       Fixed-point fractional library routines.
!                                                              (line 1414)
  * __satfractqiuta:                       Fixed-point fractional library routines.
!                                                              (line 1423)
  * __satfractqqda:                        Fixed-point fractional library routines.
!                                                              (line 1050)
  * __satfractqqdq2:                       Fixed-point fractional library routines.
!                                                              (line 1047)
  * __satfractqqha:                        Fixed-point fractional library routines.
!                                                              (line 1048)
  * __satfractqqhq2:                       Fixed-point fractional library routines.
!                                                              (line 1045)
  * __satfractqqsa:                        Fixed-point fractional library routines.
!                                                              (line 1049)
  * __satfractqqsq2:                       Fixed-point fractional library routines.
!                                                              (line 1046)
  * __satfractqqta:                        Fixed-point fractional library routines.
!                                                              (line 1051)
  * __satfractqquda:                       Fixed-point fractional library routines.
!                                                              (line 1062)
  * __satfractqqudq:                       Fixed-point fractional library routines.
!                                                              (line 1057)
  * __satfractqquha:                       Fixed-point fractional library routines.
!                                                              (line 1059)
  * __satfractqquhq:                       Fixed-point fractional library routines.
!                                                              (line 1054)
  * __satfractqquqq:                       Fixed-point fractional library routines.
!                                                              (line 1052)
  * __satfractqqusa:                       Fixed-point fractional library routines.
!                                                              (line 1061)
  * __satfractqqusq:                       Fixed-point fractional library routines.
!                                                              (line 1055)
  * __satfractqquta:                       Fixed-point fractional library routines.
!                                                              (line 1064)
  * __satfractsada2:                       Fixed-point fractional library routines.
!                                                              (line 1147)
  * __satfractsadq:                        Fixed-point fractional library routines.
!                                                              (line 1145)
  * __satfractsaha2:                       Fixed-point fractional library routines.
!                                                              (line 1146)
  * __satfractsahq:                        Fixed-point fractional library routines.
!                                                              (line 1143)
  * __satfractsaqq:                        Fixed-point fractional library routines.
!                                                              (line 1142)
  * __satfractsasq:                        Fixed-point fractional library routines.
!                                                              (line 1144)
  * __satfractsata2:                       Fixed-point fractional library routines.
                                                               (line 1148)
+ * __satfractsauda:                       Fixed-point fractional library routines.
+                                                              (line 1155)
  * __satfractsaudq:                       Fixed-point fractional library routines.
!                                                              (line 1152)
  * __satfractsauha:                       Fixed-point fractional library routines.
!                                                              (line 1153)
  * __satfractsauhq:                       Fixed-point fractional library routines.
!                                                              (line 1150)
  * __satfractsauqq:                       Fixed-point fractional library routines.
!                                                              (line 1149)
  * __satfractsausa:                       Fixed-point fractional library routines.
!                                                              (line 1154)
  * __satfractsausq:                       Fixed-point fractional library routines.
!                                                              (line 1151)
  * __satfractsauta:                       Fixed-point fractional library routines.
!                                                              (line 1156)
  * __satfractsfda:                        Fixed-point fractional library routines.
!                                                              (line 1497)
  * __satfractsfdq:                        Fixed-point fractional library routines.
!                                                              (line 1494)
  * __satfractsfha:                        Fixed-point fractional library routines.
!                                                              (line 1495)
  * __satfractsfhq:                        Fixed-point fractional library routines.
!                                                              (line 1492)
  * __satfractsfqq:                        Fixed-point fractional library routines.
!                                                              (line 1491)
  * __satfractsfsa:                        Fixed-point fractional library routines.
!                                                              (line 1496)
  * __satfractsfsq:                        Fixed-point fractional library routines.
!                                                              (line 1493)
  * __satfractsfta:                        Fixed-point fractional library routines.
                                                               (line 1498)
+ * __satfractsfuda:                       Fixed-point fractional library routines.
+                                                              (line 1505)
  * __satfractsfudq:                       Fixed-point fractional library routines.
!                                                              (line 1502)
  * __satfractsfuha:                       Fixed-point fractional library routines.
!                                                              (line 1503)
  * __satfractsfuhq:                       Fixed-point fractional library routines.
!                                                              (line 1500)
  * __satfractsfuqq:                       Fixed-point fractional library routines.
!                                                              (line 1499)
  * __satfractsfusa:                       Fixed-point fractional library routines.
!                                                              (line 1504)
  * __satfractsfusq:                       Fixed-point fractional library routines.
!                                                              (line 1501)
  * __satfractsfuta:                       Fixed-point fractional library routines.
!                                                              (line 1506)
  * __satfractsida:                        Fixed-point fractional library routines.
!                                                              (line 1447)
  * __satfractsidq:                        Fixed-point fractional library routines.
!                                                              (line 1444)
  * __satfractsiha:                        Fixed-point fractional library routines.
!                                                              (line 1445)
  * __satfractsihq:                        Fixed-point fractional library routines.
!                                                              (line 1442)
  * __satfractsiqq:                        Fixed-point fractional library routines.
!                                                              (line 1441)
  * __satfractsisa:                        Fixed-point fractional library routines.
!                                                              (line 1446)
  * __satfractsisq:                        Fixed-point fractional library routines.
!                                                              (line 1443)
  * __satfractsita:                        Fixed-point fractional library routines.
                                                               (line 1448)
+ * __satfractsiuda:                       Fixed-point fractional library routines.
+                                                              (line 1455)
  * __satfractsiudq:                       Fixed-point fractional library routines.
!                                                              (line 1452)
  * __satfractsiuha:                       Fixed-point fractional library routines.
!                                                              (line 1453)
  * __satfractsiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1450)
  * __satfractsiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1449)
  * __satfractsiusa:                       Fixed-point fractional library routines.
!                                                              (line 1454)
  * __satfractsiusq:                       Fixed-point fractional library routines.
!                                                              (line 1451)
  * __satfractsiuta:                       Fixed-point fractional library routines.
!                                                              (line 1456)
  * __satfractsqda:                        Fixed-point fractional library routines.
!                                                              (line 1086)
  * __satfractsqdq2:                       Fixed-point fractional library routines.
!                                                              (line 1083)
  * __satfractsqha:                        Fixed-point fractional library routines.
!                                                              (line 1084)
  * __satfractsqhq2:                       Fixed-point fractional library routines.
!                                                              (line 1082)
  * __satfractsqqq2:                       Fixed-point fractional library routines.
!                                                              (line 1081)
  * __satfractsqsa:                        Fixed-point fractional library routines.
!                                                              (line 1085)
  * __satfractsqta:                        Fixed-point fractional library routines.
!                                                              (line 1087)
  * __satfractsquda:                       Fixed-point fractional library routines.
!                                                              (line 1097)
  * __satfractsqudq:                       Fixed-point fractional library routines.
!                                                              (line 1092)
  * __satfractsquha:                       Fixed-point fractional library routines.
!                                                              (line 1094)
  * __satfractsquhq:                       Fixed-point fractional library routines.
!                                                              (line 1090)
  * __satfractsquqq:                       Fixed-point fractional library routines.
!                                                              (line 1088)
  * __satfractsqusa:                       Fixed-point fractional library routines.
!                                                              (line 1096)
  * __satfractsqusq:                       Fixed-point fractional library routines.
!                                                              (line 1091)
  * __satfractsquta:                       Fixed-point fractional library routines.
!                                                              (line 1098)
  * __satfracttada2:                       Fixed-point fractional library routines.
!                                                              (line 1182)
  * __satfracttadq:                        Fixed-point fractional library routines.
!                                                              (line 1179)
  * __satfracttaha2:                       Fixed-point fractional library routines.
!                                                              (line 1180)
  * __satfracttahq:                        Fixed-point fractional library routines.
!                                                              (line 1177)
  * __satfracttaqq:                        Fixed-point fractional library routines.
!                                                              (line 1176)
  * __satfracttasa2:                       Fixed-point fractional library routines.
!                                                              (line 1181)
  * __satfracttasq:                        Fixed-point fractional library routines.
!                                                              (line 1178)
  * __satfracttauda:                       Fixed-point fractional library routines.
!                                                              (line 1193)
  * __satfracttaudq:                       Fixed-point fractional library routines.
!                                                              (line 1188)
  * __satfracttauha:                       Fixed-point fractional library routines.
!                                                              (line 1190)
  * __satfracttauhq:                       Fixed-point fractional library routines.
!                                                              (line 1185)
  * __satfracttauqq:                       Fixed-point fractional library routines.
!                                                              (line 1183)
  * __satfracttausa:                       Fixed-point fractional library routines.
!                                                              (line 1192)
  * __satfracttausq:                       Fixed-point fractional library routines.
!                                                              (line 1186)
  * __satfracttauta:                       Fixed-point fractional library routines.
!                                                              (line 1195)
  * __satfracttida:                        Fixed-point fractional library routines.
!                                                              (line 1479)
  * __satfracttidq:                        Fixed-point fractional library routines.
!                                                              (line 1476)
  * __satfracttiha:                        Fixed-point fractional library routines.
!                                                              (line 1477)
  * __satfracttihq:                        Fixed-point fractional library routines.
!                                                              (line 1474)
  * __satfracttiqq:                        Fixed-point fractional library routines.
!                                                              (line 1473)
  * __satfracttisa:                        Fixed-point fractional library routines.
!                                                              (line 1478)
  * __satfracttisq:                        Fixed-point fractional library routines.
!                                                              (line 1475)
  * __satfracttita:                        Fixed-point fractional library routines.
!                                                              (line 1480)
  * __satfracttiuda:                       Fixed-point fractional library routines.
!                                                              (line 1488)
  * __satfracttiudq:                       Fixed-point fractional library routines.
!                                                              (line 1484)
  * __satfracttiuha:                       Fixed-point fractional library routines.
!                                                              (line 1486)
  * __satfracttiuhq:                       Fixed-point fractional library routines.
!                                                              (line 1482)
  * __satfracttiuqq:                       Fixed-point fractional library routines.
!                                                              (line 1481)
  * __satfracttiusa:                       Fixed-point fractional library routines.
!                                                              (line 1487)
  * __satfracttiusq:                       Fixed-point fractional library routines.
                                                               (line 1483)
+ * __satfracttiuta:                       Fixed-point fractional library routines.
+                                                              (line 1489)
  * __satfractudada:                       Fixed-point fractional library routines.
!                                                              (line 1358)
  * __satfractudadq:                       Fixed-point fractional library routines.
!                                                              (line 1353)
  * __satfractudaha:                       Fixed-point fractional library routines.
!                                                              (line 1355)
  * __satfractudahq:                       Fixed-point fractional library routines.
!                                                              (line 1351)
  * __satfractudaqq:                       Fixed-point fractional library routines.
!                                                              (line 1349)
  * __satfractudasa:                       Fixed-point fractional library routines.
!                                                              (line 1357)
  * __satfractudasq:                       Fixed-point fractional library routines.
!                                                              (line 1352)
  * __satfractudata:                       Fixed-point fractional library routines.
!                                                              (line 1359)
  * __satfractudaudq:                      Fixed-point fractional library routines.
!                                                              (line 1367)
  * __satfractudauha2:                     Fixed-point fractional library routines.
!                                                              (line 1369)
  * __satfractudauhq:                      Fixed-point fractional library routines.
!                                                              (line 1363)
  * __satfractudauqq:                      Fixed-point fractional library routines.
!                                                              (line 1361)
  * __satfractudausa2:                     Fixed-point fractional library routines.
!                                                              (line 1371)
  * __satfractudausq:                      Fixed-point fractional library routines.
!                                                              (line 1365)
  * __satfractudauta2:                     Fixed-point fractional library routines.
!                                                              (line 1373)
  * __satfractudqda:                       Fixed-point fractional library routines.
!                                                              (line 1282)
  * __satfractudqdq:                       Fixed-point fractional library routines.
!                                                              (line 1277)
  * __satfractudqha:                       Fixed-point fractional library routines.
!                                                              (line 1279)
  * __satfractudqhq:                       Fixed-point fractional library routines.
!                                                              (line 1274)
  * __satfractudqqq:                       Fixed-point fractional library routines.
!                                                              (line 1272)
  * __satfractudqsa:                       Fixed-point fractional library routines.
!                                                              (line 1281)
  * __satfractudqsq:                       Fixed-point fractional library routines.
!                                                              (line 1275)
  * __satfractudqta:                       Fixed-point fractional library routines.
!                                                              (line 1284)
  * __satfractudquda:                      Fixed-point fractional library routines.
!                                                              (line 1296)
  * __satfractudquha:                      Fixed-point fractional library routines.
!                                                              (line 1292)
  * __satfractudquhq2:                     Fixed-point fractional library routines.
!                                                              (line 1288)
  * __satfractudquqq2:                     Fixed-point fractional library routines.
!                                                              (line 1286)
  * __satfractudqusa:                      Fixed-point fractional library routines.
!                                                              (line 1294)
  * __satfractudqusq2:                     Fixed-point fractional library routines.
!                                                              (line 1290)
  * __satfractudquta:                      Fixed-point fractional library routines.
!                                                              (line 1298)
  * __satfractuhada:                       Fixed-point fractional library routines.
!                                                              (line 1310)
  * __satfractuhadq:                       Fixed-point fractional library routines.
!                                                              (line 1305)
  * __satfractuhaha:                       Fixed-point fractional library routines.
!                                                              (line 1307)
  * __satfractuhahq:                       Fixed-point fractional library routines.
!                                                              (line 1302)
  * __satfractuhaqq:                       Fixed-point fractional library routines.
!                                                              (line 1300)
  * __satfractuhasa:                       Fixed-point fractional library routines.
!                                                              (line 1309)
  * __satfractuhasq:                       Fixed-point fractional library routines.
!                                                              (line 1303)
  * __satfractuhata:                       Fixed-point fractional library routines.
!                                                              (line 1312)
  * __satfractuhauda2:                     Fixed-point fractional library routines.
!                                                              (line 1324)
  * __satfractuhaudq:                      Fixed-point fractional library routines.
!                                                              (line 1320)
  * __satfractuhauhq:                      Fixed-point fractional library routines.
!                                                              (line 1316)
  * __satfractuhauqq:                      Fixed-point fractional library routines.
!                                                              (line 1314)
  * __satfractuhausa2:                     Fixed-point fractional library routines.
!                                                              (line 1322)
  * __satfractuhausq:                      Fixed-point fractional library routines.
!                                                              (line 1318)
  * __satfractuhauta2:                     Fixed-point fractional library routines.
!                                                              (line 1326)
  * __satfractuhqda:                       Fixed-point fractional library routines.
!                                                              (line 1231)
  * __satfractuhqdq:                       Fixed-point fractional library routines.
!                                                              (line 1228)
  * __satfractuhqha:                       Fixed-point fractional library routines.
!                                                              (line 1229)
  * __satfractuhqhq:                       Fixed-point fractional library routines.
!                                                              (line 1226)
  * __satfractuhqqq:                       Fixed-point fractional library routines.
!                                                              (line 1225)
  * __satfractuhqsa:                       Fixed-point fractional library routines.
!                                                              (line 1230)
  * __satfractuhqsq:                       Fixed-point fractional library routines.
!                                                              (line 1227)
  * __satfractuhqta:                       Fixed-point fractional library routines.
!                                                              (line 1232)
  * __satfractuhquda:                      Fixed-point fractional library routines.
!                                                              (line 1242)
  * __satfractuhqudq2:                     Fixed-point fractional library routines.
!                                                              (line 1237)
  * __satfractuhquha:                      Fixed-point fractional library routines.
!                                                              (line 1239)
  * __satfractuhquqq2:                     Fixed-point fractional library routines.
!                                                              (line 1233)
  * __satfractuhqusa:                      Fixed-point fractional library routines.
!                                                              (line 1241)
  * __satfractuhqusq2:                     Fixed-point fractional library routines.
!                                                              (line 1235)
  * __satfractuhquta:                      Fixed-point fractional library routines.
!                                                              (line 1244)
  * __satfractunsdida:                     Fixed-point fractional library routines.
!                                                              (line 1841)
  * __satfractunsdidq:                     Fixed-point fractional library routines.
!                                                              (line 1837)
  * __satfractunsdiha:                     Fixed-point fractional library routines.
!                                                              (line 1839)
  * __satfractunsdihq:                     Fixed-point fractional library routines.
!                                                              (line 1835)
  * __satfractunsdiqq:                     Fixed-point fractional library routines.
!                                                              (line 1834)
  * __satfractunsdisa:                     Fixed-point fractional library routines.
!                                                              (line 1840)
  * __satfractunsdisq:                     Fixed-point fractional library routines.
                                                               (line 1836)
+ * __satfractunsdita:                     Fixed-point fractional library routines.
+                                                              (line 1842)
  * __satfractunsdiuda:                    Fixed-point fractional library routines.
!                                                              (line 1856)
  * __satfractunsdiudq:                    Fixed-point fractional library routines.
!                                                              (line 1850)
  * __satfractunsdiuha:                    Fixed-point fractional library routines.
!                                                              (line 1852)
  * __satfractunsdiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1846)
  * __satfractunsdiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1844)
  * __satfractunsdiusa:                    Fixed-point fractional library routines.
!                                                              (line 1854)
  * __satfractunsdiusq:                    Fixed-point fractional library routines.
!                                                              (line 1848)
  * __satfractunsdiuta:                    Fixed-point fractional library routines.
!                                                              (line 1858)
  * __satfractunshida:                     Fixed-point fractional library routines.
!                                                              (line 1793)
  * __satfractunshidq:                     Fixed-point fractional library routines.
!                                                              (line 1789)
  * __satfractunshiha:                     Fixed-point fractional library routines.
!                                                              (line 1791)
  * __satfractunshihq:                     Fixed-point fractional library routines.
!                                                              (line 1787)
  * __satfractunshiqq:                     Fixed-point fractional library routines.
!                                                              (line 1786)
  * __satfractunshisa:                     Fixed-point fractional library routines.
!                                                              (line 1792)
  * __satfractunshisq:                     Fixed-point fractional library routines.
                                                               (line 1788)
+ * __satfractunshita:                     Fixed-point fractional library routines.
+                                                              (line 1794)
  * __satfractunshiuda:                    Fixed-point fractional library routines.
!                                                              (line 1808)
  * __satfractunshiudq:                    Fixed-point fractional library routines.
!                                                              (line 1802)
  * __satfractunshiuha:                    Fixed-point fractional library routines.
!                                                              (line 1804)
  * __satfractunshiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1798)
  * __satfractunshiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1796)
  * __satfractunshiusa:                    Fixed-point fractional library routines.
!                                                              (line 1806)
  * __satfractunshiusq:                    Fixed-point fractional library routines.
!                                                              (line 1800)
  * __satfractunshiuta:                    Fixed-point fractional library routines.
!                                                              (line 1810)
  * __satfractunsqida:                     Fixed-point fractional library routines.
!                                                              (line 1767)
  * __satfractunsqidq:                     Fixed-point fractional library routines.
!                                                              (line 1763)
  * __satfractunsqiha:                     Fixed-point fractional library routines.
!                                                              (line 1765)
  * __satfractunsqihq:                     Fixed-point fractional library routines.
!                                                              (line 1761)
  * __satfractunsqiqq:                     Fixed-point fractional library routines.
!                                                              (line 1760)
  * __satfractunsqisa:                     Fixed-point fractional library routines.
!                                                              (line 1766)
  * __satfractunsqisq:                     Fixed-point fractional library routines.
                                                               (line 1762)
+ * __satfractunsqita:                     Fixed-point fractional library routines.
+                                                              (line 1768)
  * __satfractunsqiuda:                    Fixed-point fractional library routines.
!                                                              (line 1782)
  * __satfractunsqiudq:                    Fixed-point fractional library routines.
!                                                              (line 1776)
  * __satfractunsqiuha:                    Fixed-point fractional library routines.
!                                                              (line 1778)
  * __satfractunsqiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1772)
  * __satfractunsqiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1770)
  * __satfractunsqiusa:                    Fixed-point fractional library routines.
!                                                              (line 1780)
  * __satfractunsqiusq:                    Fixed-point fractional library routines.
!                                                              (line 1774)
  * __satfractunsqiuta:                    Fixed-point fractional library routines.
!                                                              (line 1784)
  * __satfractunssida:                     Fixed-point fractional library routines.
!                                                              (line 1818)
  * __satfractunssidq:                     Fixed-point fractional library routines.
!                                                              (line 1815)
  * __satfractunssiha:                     Fixed-point fractional library routines.
!                                                              (line 1816)
  * __satfractunssihq:                     Fixed-point fractional library routines.
!                                                              (line 1813)
  * __satfractunssiqq:                     Fixed-point fractional library routines.
!                                                              (line 1812)
  * __satfractunssisa:                     Fixed-point fractional library routines.
!                                                              (line 1817)
  * __satfractunssisq:                     Fixed-point fractional library routines.
!                                                              (line 1814)
  * __satfractunssita:                     Fixed-point fractional library routines.
!                                                              (line 1819)
  * __satfractunssiuda:                    Fixed-point fractional library routines.
!                                                              (line 1830)
  * __satfractunssiudq:                    Fixed-point fractional library routines.
!                                                              (line 1825)
  * __satfractunssiuha:                    Fixed-point fractional library routines.
!                                                              (line 1827)
  * __satfractunssiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1822)
  * __satfractunssiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1820)
  * __satfractunssiusa:                    Fixed-point fractional library routines.
!                                                              (line 1829)
  * __satfractunssiusq:                    Fixed-point fractional library routines.
!                                                              (line 1823)
  * __satfractunssiuta:                    Fixed-point fractional library routines.
!                                                              (line 1832)
  * __satfractunstida:                     Fixed-point fractional library routines.
!                                                              (line 1870)
  * __satfractunstidq:                     Fixed-point fractional library routines.
!                                                              (line 1865)
  * __satfractunstiha:                     Fixed-point fractional library routines.
!                                                              (line 1867)
  * __satfractunstihq:                     Fixed-point fractional library routines.
!                                                              (line 1862)
  * __satfractunstiqq:                     Fixed-point fractional library routines.
!                                                              (line 1860)
  * __satfractunstisa:                     Fixed-point fractional library routines.
!                                                              (line 1869)
  * __satfractunstisq:                     Fixed-point fractional library routines.
!                                                              (line 1863)
  * __satfractunstita:                     Fixed-point fractional library routines.
!                                                              (line 1872)
  * __satfractunstiuda:                    Fixed-point fractional library routines.
!                                                              (line 1886)
  * __satfractunstiudq:                    Fixed-point fractional library routines.
!                                                              (line 1880)
  * __satfractunstiuha:                    Fixed-point fractional library routines.
!                                                              (line 1882)
  * __satfractunstiuhq:                    Fixed-point fractional library routines.
!                                                              (line 1876)
  * __satfractunstiuqq:                    Fixed-point fractional library routines.
!                                                              (line 1874)
  * __satfractunstiusa:                    Fixed-point fractional library routines.
!                                                              (line 1884)
  * __satfractunstiusq:                    Fixed-point fractional library routines.
!                                                              (line 1878)
  * __satfractunstiuta:                    Fixed-point fractional library routines.
!                                                              (line 1888)
  * __satfractuqqda:                       Fixed-point fractional library routines.
!                                                              (line 1207)
  * __satfractuqqdq:                       Fixed-point fractional library routines.
!                                                              (line 1202)
  * __satfractuqqha:                       Fixed-point fractional library routines.
!                                                              (line 1204)
  * __satfractuqqhq:                       Fixed-point fractional library routines.
!                                                              (line 1199)
  * __satfractuqqqq:                       Fixed-point fractional library routines.
!                                                              (line 1197)
  * __satfractuqqsa:                       Fixed-point fractional library routines.
!                                                              (line 1206)
  * __satfractuqqsq:                       Fixed-point fractional library routines.
!                                                              (line 1200)
  * __satfractuqqta:                       Fixed-point fractional library routines.
!                                                              (line 1209)
  * __satfractuqquda:                      Fixed-point fractional library routines.
!                                                              (line 1221)
  * __satfractuqqudq2:                     Fixed-point fractional library routines.
!                                                              (line 1215)
  * __satfractuqquha:                      Fixed-point fractional library routines.
!                                                              (line 1217)
  * __satfractuqquhq2:                     Fixed-point fractional library routines.
!                                                              (line 1211)
  * __satfractuqqusa:                      Fixed-point fractional library routines.
!                                                              (line 1219)
  * __satfractuqqusq2:                     Fixed-point fractional library routines.
!                                                              (line 1213)
  * __satfractuqquta:                      Fixed-point fractional library routines.
!                                                              (line 1223)
  * __satfractusada:                       Fixed-point fractional library routines.
!                                                              (line 1334)
  * __satfractusadq:                       Fixed-point fractional library routines.
!                                                              (line 1331)
  * __satfractusaha:                       Fixed-point fractional library routines.
!                                                              (line 1332)
  * __satfractusahq:                       Fixed-point fractional library routines.
!                                                              (line 1329)
  * __satfractusaqq:                       Fixed-point fractional library routines.
!                                                              (line 1328)
  * __satfractusasa:                       Fixed-point fractional library routines.
!                                                              (line 1333)
  * __satfractusasq:                       Fixed-point fractional library routines.
!                                                              (line 1330)
  * __satfractusata:                       Fixed-point fractional library routines.
!                                                              (line 1335)
  * __satfractusauda2:                     Fixed-point fractional library routines.
!                                                              (line 1345)
  * __satfractusaudq:                      Fixed-point fractional library routines.
!                                                              (line 1341)
  * __satfractusauha2:                     Fixed-point fractional library routines.
!                                                              (line 1343)
  * __satfractusauhq:                      Fixed-point fractional library routines.
!                                                              (line 1338)
  * __satfractusauqq:                      Fixed-point fractional library routines.
!                                                              (line 1336)
  * __satfractusausq:                      Fixed-point fractional library routines.
!                                                              (line 1339)
  * __satfractusauta2:                     Fixed-point fractional library routines.
!                                                              (line 1347)
  * __satfractusqda:                       Fixed-point fractional library routines.
!                                                              (line 1255)
  * __satfractusqdq:                       Fixed-point fractional library routines.
!                                                              (line 1250)
  * __satfractusqha:                       Fixed-point fractional library routines.
!                                                              (line 1252)
  * __satfractusqhq:                       Fixed-point fractional library routines.
!                                                              (line 1248)
  * __satfractusqqq:                       Fixed-point fractional library routines.
!                                                              (line 1246)
  * __satfractusqsa:                       Fixed-point fractional library routines.
!                                                              (line 1254)
  * __satfractusqsq:                       Fixed-point fractional library routines.
!                                                              (line 1249)
  * __satfractusqta:                       Fixed-point fractional library routines.
!                                                              (line 1256)
  * __satfractusquda:                      Fixed-point fractional library routines.
!                                                              (line 1268)
  * __satfractusqudq2:                     Fixed-point fractional library routines.
!                                                              (line 1262)
  * __satfractusquha:                      Fixed-point fractional library routines.
!                                                              (line 1264)
  * __satfractusquhq2:                     Fixed-point fractional library routines.
!                                                              (line 1260)
  * __satfractusquqq2:                     Fixed-point fractional library routines.
!                                                              (line 1258)
  * __satfractusqusa:                      Fixed-point fractional library routines.
!                                                              (line 1266)
  * __satfractusquta:                      Fixed-point fractional library routines.
!                                                              (line 1270)
  * __satfractutada:                       Fixed-point fractional library routines.
!                                                              (line 1385)
  * __satfractutadq:                       Fixed-point fractional library routines.
!                                                              (line 1380)
  * __satfractutaha:                       Fixed-point fractional library routines.
!                                                              (line 1382)
  * __satfractutahq:                       Fixed-point fractional library routines.
!                                                              (line 1377)
  * __satfractutaqq:                       Fixed-point fractional library routines.
!                                                              (line 1375)
  * __satfractutasa:                       Fixed-point fractional library routines.
!                                                              (line 1384)
  * __satfractutasq:                       Fixed-point fractional library routines.
!                                                              (line 1378)
  * __satfractutata:                       Fixed-point fractional library routines.
!                                                              (line 1387)
  * __satfractutauda2:                     Fixed-point fractional library routines.
!                                                              (line 1401)
  * __satfractutaudq:                      Fixed-point fractional library routines.
!                                                              (line 1395)
  * __satfractutauha2:                     Fixed-point fractional library routines.
!                                                              (line 1397)
  * __satfractutauhq:                      Fixed-point fractional library routines.
!                                                              (line 1391)
  * __satfractutauqq:                      Fixed-point fractional library routines.
!                                                              (line 1389)
  * __satfractutausa2:                     Fixed-point fractional library routines.
!                                                              (line 1399)
  * __satfractutausq:                      Fixed-point fractional library routines.
!                                                              (line 1393)
  * __splitstack_find:                     Miscellaneous routines.
!                                                              (line   15)
  * __ssaddda3:                            Fixed-point fractional library routines.
!                                                              (line   74)
  * __ssadddq3:                            Fixed-point fractional library routines.
!                                                              (line   69)
  * __ssaddha3:                            Fixed-point fractional library routines.
!                                                              (line   71)
  * __ssaddhq3:                            Fixed-point fractional library routines.
!                                                              (line   67)
  * __ssaddqq3:                            Fixed-point fractional library routines.
!                                                              (line   65)
  * __ssaddsa3:                            Fixed-point fractional library routines.
!                                                              (line   73)
  * __ssaddsq3:                            Fixed-point fractional library routines.
!                                                              (line   68)
  * __ssaddta3:                            Fixed-point fractional library routines.
!                                                              (line   75)
  * __ssashlda3:                           Fixed-point fractional library routines.
!                                                              (line  409)
  * __ssashldq3:                           Fixed-point fractional library routines.
!                                                              (line  405)
  * __ssashlha3:                           Fixed-point fractional library routines.
!                                                              (line  407)
  * __ssashlhq3:                           Fixed-point fractional library routines.
!                                                              (line  403)
  * __ssashlsa3:                           Fixed-point fractional library routines.
!                                                              (line  408)
  * __ssashlsq3:                           Fixed-point fractional library routines.
                                                               (line  404)
+ * __ssashlta3:                           Fixed-point fractional library routines.
+                                                              (line  410)
  * __ssdivda3:                            Fixed-point fractional library routines.
!                                                              (line  268)
  * __ssdivdq3:                            Fixed-point fractional library routines.
!                                                              (line  263)
  * __ssdivha3:                            Fixed-point fractional library routines.
!                                                              (line  265)
  * __ssdivhq3:                            Fixed-point fractional library routines.
!                                                              (line  261)
  * __ssdivqq3:                            Fixed-point fractional library routines.
!                                                              (line  259)
  * __ssdivsa3:                            Fixed-point fractional library routines.
!                                                              (line  267)
  * __ssdivsq3:                            Fixed-point fractional library routines.
!                                                              (line  262)
  * __ssdivta3:                            Fixed-point fractional library routines.
!                                                              (line  269)
  * __ssmulda3:                            Fixed-point fractional library routines.
!                                                              (line  200)
  * __ssmuldq3:                            Fixed-point fractional library routines.
!                                                              (line  195)
  * __ssmulha3:                            Fixed-point fractional library routines.
!                                                              (line  197)
  * __ssmulhq3:                            Fixed-point fractional library routines.
!                                                              (line  193)
  * __ssmulqq3:                            Fixed-point fractional library routines.
!                                                              (line  191)
  * __ssmulsa3:                            Fixed-point fractional library routines.
!                                                              (line  199)
  * __ssmulsq3:                            Fixed-point fractional library routines.
!                                                              (line  194)
  * __ssmulta3:                            Fixed-point fractional library routines.
!                                                              (line  201)
  * __ssnegda2:                            Fixed-point fractional library routines.
!                                                              (line  323)
  * __ssnegdq2:                            Fixed-point fractional library routines.
!                                                              (line  320)
  * __ssnegha2:                            Fixed-point fractional library routines.
!                                                              (line  321)
  * __ssneghq2:                            Fixed-point fractional library routines.
!                                                              (line  318)
  * __ssnegqq2:                            Fixed-point fractional library routines.
!                                                              (line  317)
  * __ssnegsa2:                            Fixed-point fractional library routines.
!                                                              (line  322)
  * __ssnegsq2:                            Fixed-point fractional library routines.
!                                                              (line  319)
  * __ssnegta2:                            Fixed-point fractional library routines.
!                                                              (line  324)
  * __sssubda3:                            Fixed-point fractional library routines.
!                                                              (line  136)
  * __sssubdq3:                            Fixed-point fractional library routines.
!                                                              (line  131)
  * __sssubha3:                            Fixed-point fractional library routines.
!                                                              (line  133)
  * __sssubhq3:                            Fixed-point fractional library routines.
!                                                              (line  129)
  * __sssubqq3:                            Fixed-point fractional library routines.
!                                                              (line  127)
  * __sssubsa3:                            Fixed-point fractional library routines.
!                                                              (line  135)
  * __sssubsq3:                            Fixed-point fractional library routines.
!                                                              (line  130)
  * __sssubta3:                            Fixed-point fractional library routines.
!                                                              (line  137)
  * __subda3:                              Fixed-point fractional library routines.
!                                                              (line  114)
  * __subdf3:                              Soft float library routines.
!                                                              (line   30)
  * __subdq3:                              Fixed-point fractional library routines.
!                                                              (line  101)
  * __subha3:                              Fixed-point fractional library routines.
!                                                              (line  111)
  * __subhq3:                              Fixed-point fractional library routines.
!                                                              (line   99)
  * __subqq3:                              Fixed-point fractional library routines.
!                                                              (line   97)
  * __subsa3:                              Fixed-point fractional library routines.
!                                                              (line  113)
  * __subsf3:                              Soft float library routines.
!                                                              (line   29)
  * __subsq3:                              Fixed-point fractional library routines.
!                                                              (line  100)
  * __subta3:                              Fixed-point fractional library routines.
!                                                              (line  115)
  * __subtf3:                              Soft float library routines.
!                                                              (line   31)
  * __subuda3:                             Fixed-point fractional library routines.
!                                                              (line  121)
  * __subudq3:                             Fixed-point fractional library routines.
!                                                              (line  109)
  * __subuha3:                             Fixed-point fractional library routines.
!                                                              (line  117)
  * __subuhq3:                             Fixed-point fractional library routines.
!                                                              (line  105)
  * __subuqq3:                             Fixed-point fractional library routines.
!                                                              (line  103)
  * __subusa3:                             Fixed-point fractional library routines.
!                                                              (line  119)
  * __subusq3:                             Fixed-point fractional library routines.
!                                                              (line  107)
  * __subuta3:                             Fixed-point fractional library routines.
                                                               (line  123)
! * __subvdi3:                             Integer library routines.
                                                               (line  122)
+ * __subvsi3:                             Integer library routines.
+                                                              (line  121)
  * __subxf3:                              Soft float library routines.
!                                                              (line   33)
  * __truncdfsf2:                          Soft float library routines.
!                                                              (line   75)
  * __trunctfdf2:                          Soft float library routines.
!                                                              (line   72)
  * __trunctfsf2:                          Soft float library routines.
!                                                              (line   74)
  * __truncxfdf2:                          Soft float library routines.
!                                                              (line   71)
  * __truncxfsf2:                          Soft float library routines.
!                                                              (line   73)
  * __ucmpdi2:                             Integer library routines.
!                                                              (line   92)
  * __ucmpti2:                             Integer library routines.
!                                                              (line   93)
  * __udivdi3:                             Integer library routines.
!                                                              (line   52)
  * __udivmoddi4:                          Integer library routines.
!                                                              (line   59)
  * __udivmodti4:                          Integer library routines.
!                                                              (line   61)
  * __udivsi3:                             Integer library routines.
!                                                              (line   50)
  * __udivti3:                             Integer library routines.
!                                                              (line   54)
  * __udivuda3:                            Fixed-point fractional library routines.
!                                                              (line  252)
  * __udivudq3:                            Fixed-point fractional library routines.
!                                                              (line  246)
  * __udivuha3:                            Fixed-point fractional library routines.
!                                                              (line  248)
  * __udivuhq3:                            Fixed-point fractional library routines.
!                                                              (line  242)
  * __udivuqq3:                            Fixed-point fractional library routines.
!                                                              (line  240)
  * __udivusa3:                            Fixed-point fractional library routines.
!                                                              (line  250)
  * __udivusq3:                            Fixed-point fractional library routines.
!                                                              (line  244)
  * __udivuta3:                            Fixed-point fractional library routines.
!                                                              (line  254)
  * __umoddi3:                             Integer library routines.
                                                               (line   69)
+ * __umodsi3:                             Integer library routines.
+                                                              (line   67)
  * __umodti3:                             Integer library routines.
!                                                              (line   71)
  * __unorddf2:                            Soft float library routines.
                                                               (line  172)
+ * __unordsf2:                            Soft float library routines.
+                                                              (line  171)
  * __unordtf2:                            Soft float library routines.
!                                                              (line  173)
  * __usadduda3:                           Fixed-point fractional library routines.
!                                                              (line   91)
  * __usaddudq3:                           Fixed-point fractional library routines.
!                                                              (line   85)
  * __usadduha3:                           Fixed-point fractional library routines.
!                                                              (line   87)
  * __usadduhq3:                           Fixed-point fractional library routines.
!                                                              (line   81)
  * __usadduqq3:                           Fixed-point fractional library routines.
!                                                              (line   79)
  * __usaddusa3:                           Fixed-point fractional library routines.
!                                                              (line   89)
  * __usaddusq3:                           Fixed-point fractional library routines.
!                                                              (line   83)
  * __usadduta3:                           Fixed-point fractional library routines.
!                                                              (line   93)
  * __usashluda3:                          Fixed-point fractional library routines.
!                                                              (line  427)
  * __usashludq3:                          Fixed-point fractional library routines.
!                                                              (line  421)
  * __usashluha3:                          Fixed-point fractional library routines.
!                                                              (line  423)
  * __usashluhq3:                          Fixed-point fractional library routines.
!                                                              (line  417)
  * __usashluqq3:                          Fixed-point fractional library routines.
!                                                              (line  415)
  * __usashlusa3:                          Fixed-point fractional library routines.
!                                                              (line  425)
  * __usashlusq3:                          Fixed-point fractional library routines.
!                                                              (line  419)
  * __usashluta3:                          Fixed-point fractional library routines.
!                                                              (line  429)
  * __usdivuda3:                           Fixed-point fractional library routines.
!                                                              (line  286)
  * __usdivudq3:                           Fixed-point fractional library routines.
!                                                              (line  280)
  * __usdivuha3:                           Fixed-point fractional library routines.
!                                                              (line  282)
  * __usdivuhq3:                           Fixed-point fractional library routines.
!                                                              (line  276)
  * __usdivuqq3:                           Fixed-point fractional library routines.
!                                                              (line  274)
  * __usdivusa3:                           Fixed-point fractional library routines.
!                                                              (line  284)
  * __usdivusq3:                           Fixed-point fractional library routines.
!                                                              (line  278)
  * __usdivuta3:                           Fixed-point fractional library routines.
!                                                              (line  288)
  * __usmuluda3:                           Fixed-point fractional library routines.
!                                                              (line  218)
  * __usmuludq3:                           Fixed-point fractional library routines.
!                                                              (line  212)
  * __usmuluha3:                           Fixed-point fractional library routines.
!                                                              (line  214)
  * __usmuluhq3:                           Fixed-point fractional library routines.
!                                                              (line  208)
  * __usmuluqq3:                           Fixed-point fractional library routines.
!                                                              (line  206)
  * __usmulusa3:                           Fixed-point fractional library routines.
!                                                              (line  216)
  * __usmulusq3:                           Fixed-point fractional library routines.
!                                                              (line  210)
  * __usmuluta3:                           Fixed-point fractional library routines.
!                                                              (line  220)
  * __usneguda2:                           Fixed-point fractional library routines.
!                                                              (line  337)
  * __usnegudq2:                           Fixed-point fractional library routines.
!                                                              (line  332)
  * __usneguha2:                           Fixed-point fractional library routines.
!                                                              (line  334)
  * __usneguhq2:                           Fixed-point fractional library routines.
!                                                              (line  329)
  * __usneguqq2:                           Fixed-point fractional library routines.
!                                                              (line  327)
  * __usnegusa2:                           Fixed-point fractional library routines.
!                                                              (line  336)
  * __usnegusq2:                           Fixed-point fractional library routines.
!                                                              (line  330)
  * __usneguta2:                           Fixed-point fractional library routines.
!                                                              (line  339)
  * __ussubuda3:                           Fixed-point fractional library routines.
!                                                              (line  154)
  * __ussubudq3:                           Fixed-point fractional library routines.
!                                                              (line  148)
  * __ussubuha3:                           Fixed-point fractional library routines.
!                                                              (line  150)
  * __ussubuhq3:                           Fixed-point fractional library routines.
!                                                              (line  144)
  * __ussubuqq3:                           Fixed-point fractional library routines.
!                                                              (line  142)
  * __ussubusa3:                           Fixed-point fractional library routines.
!                                                              (line  152)
  * __ussubusq3:                           Fixed-point fractional library routines.
!                                                              (line  146)
  * __ussubuta3:                           Fixed-point fractional library routines.
!                                                              (line  156)
! * abort:                                 Portability.        (line   20)
! * abs:                                   Arithmetic.         (line  200)
! * abs and attributes:                    Expressions.        (line   83)
! * absence_set:                           Processor pipeline description.
!                                                              (line  223)
! * absM2 instruction pattern:             Standard Names.     (line  582)
! * absolute value:                        Arithmetic.         (line  200)
  * ABS_EXPR:                              Unary and Binary Expressions.
                                                               (line    6)
  * access to operands:                    Accessors.          (line    6)
  * access to special operands:            Special Accessors.  (line    6)
  * accessors:                             Accessors.          (line    6)
! * ACCUMULATE_OUTGOING_ARGS:              Stack Arguments.    (line   48)
! * ACCUMULATE_OUTGOING_ARGS and stack frames: Function Entry. (line  133)
! * ACCUM_TYPE_SIZE:                       Type Layout.        (line   87)
! * ADA_LONG_TYPE_SIZE:                    Type Layout.        (line   25)
  * Adding a new GIMPLE statement code:    Adding a new GIMPLE statement code.
                                                               (line    6)
! * ADDITIONAL_REGISTER_NAMES:             Instruction Output. (line   14)
! * addM3 instruction pattern:             Standard Names.     (line  260)
! * addMODEcc instruction pattern:         Standard Names.     (line 1112)
! * addptrM3 instruction pattern:          Standard Names.     (line  290)
! * address constraints:                   Simple Constraints. (line  162)
! * addressing modes:                      Addressing Modes.   (line    6)
! * address_operand:                       Machine-Independent Predicates.
!                                                              (line   62)
! * address_operand <1>:                   Simple Constraints. (line  166)
! * addr_diff_vec:                         Side Effects.       (line  314)
  * addr_diff_vec, length of:              Insn Lengths.       (line   26)
  * ADDR_EXPR:                             Storage References. (line    6)
! * addr_vec:                              Side Effects.       (line  309)
  * addr_vec, length of:                   Insn Lengths.       (line   26)
! * addvM4 instruction pattern:            Standard Names.     (line  276)
! * ADJUST_FIELD_ALIGN:                    Storage Layout.     (line  195)
  * ADJUST_INSN_LENGTH:                    Insn Lengths.       (line   41)
! * ADJUST_REG_ALLOC_ORDER:                Allocation Order.   (line   22)
  * aggregates as return values:           Aggregate Return.   (line    6)
  * alias:                                 Alias analysis.     (line    6)
+ * allocate_stack instruction pattern:    Standard Names.     (line 1426)
  * ALL_REGS:                              Register Classes.   (line   17)
  * alternate entry points:                Insns.              (line  146)
  * anchored addresses:                    Anchored Addresses. (line    6)
! * and:                                   Arithmetic.         (line  158)
  * and and attributes:                    Expressions.        (line   50)
  * and, canonicalization of:              Insn Canonicalizations.
!                                                              (line   51)
! * andM3 instruction pattern:             Standard Names.     (line  266)
  * ANNOTATE_EXPR:                         Unary and Binary Expressions.
                                                               (line    6)
  * annotations:                           Annotations.        (line    6)
  * APPLY_RESULT_SIZE:                     Scalar Return.      (line  112)
! * ARGS_GROW_DOWNWARD:                    Frame Layout.       (line   34)
  * argument passing:                      Interface.          (line   36)
  * arguments in registers:                Register Arguments. (line    6)
  * arguments on stack:                    Stack Arguments.    (line    6)
+ * ARG_POINTER_CFA_OFFSET:                Frame Layout.       (line  194)
+ * ARG_POINTER_REGNUM:                    Frame Registers.    (line   40)
+ * ARG_POINTER_REGNUM and virtual registers: Regs and Memory. (line   65)
+ * arg_pointer_rtx:                       Frame Registers.    (line  104)
  * arithmetic library:                    Soft float library routines.
                                                               (line    6)
! * arithmetic shift:                      Arithmetic.         (line  173)
! * arithmetic shift with signed saturation: Arithmetic.       (line  173)
! * arithmetic shift with unsigned saturation: Arithmetic.     (line  173)
  * arithmetic, in RTL:                    Arithmetic.         (line    6)
! * ARITHMETIC_TYPE_P:                     Types for C++.      (line   59)
  * array:                                 Types.              (line    6)
  * ARRAY_RANGE_REF:                       Storage References. (line    6)
  * ARRAY_REF:                             Storage References. (line    6)
  * ARRAY_TYPE:                            Types.              (line    6)
! * ashift:                                Arithmetic.         (line  173)
! * ashift and attributes:                 Expressions.        (line   83)
! * ashiftrt:                              Arithmetic.         (line  190)
! * ashiftrt and attributes:               Expressions.        (line   83)
! * ashlM3 instruction pattern:            Standard Names.     (line  553)
! * ashrM3 instruction pattern:            Standard Names.     (line  563)
! * ASM_APP_OFF:                           File Framework.     (line   76)
! * ASM_APP_ON:                            File Framework.     (line   69)
! * ASM_COMMENT_START:                     File Framework.     (line   64)
! * ASM_DECLARE_FUNCTION_NAME:             Label Output.       (line  108)
! * ASM_DECLARE_FUNCTION_SIZE:             Label Output.       (line  123)
! * ASM_DECLARE_OBJECT_NAME:               Label Output.       (line  136)
! * ASM_DECLARE_REGISTER_GLOBAL:           Label Output.       (line  164)
! * ASM_FINAL_SPEC:                        Driver.             (line   81)
! * ASM_FINISH_DECLARE_OBJECT:             Label Output.       (line  172)
! * ASM_FORMAT_PRIVATE_NAME:               Label Output.       (line  398)
! * asm_fprintf:                           Instruction Output. (line  150)
! * ASM_FPRINTF_EXTENSIONS:                Instruction Output. (line  160)
! * ASM_GENERATE_INTERNAL_LABEL:           Label Output.       (line  382)
! * asm_input:                             Side Effects.       (line  296)
  * asm_input and /v:                      Flags.              (line   76)
! * ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX:     Exception Handling. (line   80)
! * asm_noperands:                         Insns.              (line  304)
! * ASM_NO_SKIP_IN_TEXT:                   Alignment Output.   (line   78)
  * asm_operands and /v:                   Flags.              (line   76)
  * asm_operands, RTL sharing:             Sharing.            (line   45)
  * asm_operands, usage:                   Assembler.          (line    6)
! * ASM_OUTPUT_ADDR_DIFF_ELT:              Dispatch Tables.    (line    8)
! * ASM_OUTPUT_ADDR_VEC_ELT:               Dispatch Tables.    (line   25)
! * ASM_OUTPUT_ALIGN:                      Alignment Output.   (line   85)
! * ASM_OUTPUT_ALIGNED_BSS:                Uninitialized Data. (line   45)
! * ASM_OUTPUT_ALIGNED_COMMON:             Uninitialized Data. (line   29)
! * ASM_OUTPUT_ALIGNED_DECL_COMMON:        Uninitialized Data. (line   36)
! * ASM_OUTPUT_ALIGNED_DECL_LOCAL:         Uninitialized Data. (line   89)
! * ASM_OUTPUT_ALIGNED_LOCAL:              Uninitialized Data. (line   82)
! * ASM_OUTPUT_ALIGN_WITH_NOP:             Alignment Output.   (line   90)
! * ASM_OUTPUT_ASCII:                      Data Output.        (line   54)
! * ASM_OUTPUT_CASE_END:                   Dispatch Tables.    (line   50)
! * ASM_OUTPUT_CASE_LABEL:                 Dispatch Tables.    (line   37)
! * ASM_OUTPUT_COMMON:                     Uninitialized Data. (line    9)
! * ASM_OUTPUT_DEBUG_LABEL:                Label Output.       (line  370)
! * ASM_OUTPUT_DEF:                        Label Output.       (line  419)
! * ASM_OUTPUT_DEF_FROM_DECLS:             Label Output.       (line  426)
! * ASM_OUTPUT_DWARF_DELTA:                SDB and DWARF.      (line   77)
! * ASM_OUTPUT_DWARF_OFFSET:               SDB and DWARF.      (line   86)
! * ASM_OUTPUT_DWARF_PCREL:                SDB and DWARF.      (line   92)
! * ASM_OUTPUT_DWARF_TABLE_REF:            SDB and DWARF.      (line   97)
! * ASM_OUTPUT_DWARF_VMS_DELTA:            SDB and DWARF.      (line   81)
! * ASM_OUTPUT_EXTERNAL:                   Label Output.       (line  299)
! * ASM_OUTPUT_FDESC:                      Data Output.        (line   63)
! * ASM_OUTPUT_FUNCTION_LABEL:             Label Output.       (line   16)
! * ASM_OUTPUT_INTERNAL_LABEL:             Label Output.       (line   27)
! * ASM_OUTPUT_LABEL:                      Label Output.       (line    8)
! * ASM_OUTPUT_LABELREF:                   Label Output.       (line  321)
! * ASM_OUTPUT_LABEL_REF:                  Label Output.       (line  343)
! * ASM_OUTPUT_LOCAL:                      Uninitialized Data. (line   69)
! * ASM_OUTPUT_MAX_SKIP_ALIGN:             Alignment Output.   (line   94)
! * ASM_OUTPUT_MEASURED_SIZE:              Label Output.       (line   51)
! * ASM_OUTPUT_OPCODE:                     Instruction Output. (line   35)
! * ASM_OUTPUT_POOL_EPILOGUE:              Data Output.        (line  112)
! * ASM_OUTPUT_POOL_PROLOGUE:              Data Output.        (line   76)
! * ASM_OUTPUT_REG_POP:                    Instruction Output. (line  206)
! * ASM_OUTPUT_REG_PUSH:                   Instruction Output. (line  201)
! * ASM_OUTPUT_SIZE_DIRECTIVE:             Label Output.       (line   45)
! * ASM_OUTPUT_SKIP:                       Alignment Output.   (line   72)
! * ASM_OUTPUT_SOURCE_FILENAME:            File Framework.     (line   83)
! * ASM_OUTPUT_SPECIAL_POOL_ENTRY:         Data Output.        (line   87)
! * ASM_OUTPUT_SYMBOL_REF:                 Label Output.       (line  336)
! * ASM_OUTPUT_TYPE_DIRECTIVE:             Label Output.       (line   98)
! * ASM_OUTPUT_WEAKREF:                    Label Output.       (line  231)
! * ASM_OUTPUT_WEAK_ALIAS:                 Label Output.       (line  445)
! * ASM_PREFERRED_EH_DATA_FORMAT:          Exception Handling. (line   66)
! * ASM_SPEC:                              Driver.             (line   73)
! * ASM_STABD_OP:                          DBX Options.        (line   34)
! * ASM_STABN_OP:                          DBX Options.        (line   41)
! * ASM_STABS_OP:                          DBX Options.        (line   28)
! * ASM_WEAKEN_DECL:                       Label Output.       (line  223)
! * ASM_WEAKEN_LABEL:                      Label Output.       (line  210)
  * assembler format:                      File Framework.     (line    6)
  * assembler instructions in RTL:         Assembler.          (line    6)
! * ASSEMBLER_DIALECT:                     Instruction Output. (line  172)
! * assemble_name:                         Label Output.       (line    8)
! * assemble_name_raw:                     Label Output.       (line   27)
  * assigning attribute values to insns:   Tagging Insns.      (line    6)
! * ASSUME_EXTENDED_UNWIND_CONTEXT:        Frame Registers.    (line  165)
  * asterisk in template:                  Output Statement.   (line   29)
! * AS_NEEDS_DASH_FOR_PIPED_INPUT:         Driver.             (line   88)
! * atan2M3 instruction pattern:           Standard Names.     (line  665)
! * atomic:                                GTY Options.        (line  204)
! * atomic_addMODE instruction pattern:    Standard Names.     (line 1828)
! * atomic_add_fetchMODE instruction pattern: Standard Names.  (line 1857)
! * atomic_andMODE instruction pattern:    Standard Names.     (line 1828)
! * atomic_and_fetchMODE instruction pattern: Standard Names.  (line 1857)
  * atomic_compare_and_swapMODE instruction pattern: Standard Names.
!                                                              (line 1764)
! * atomic_exchangeMODE instruction pattern: Standard Names.   (line 1816)
! * atomic_fetch_addMODE instruction pattern: Standard Names.  (line 1842)
! * atomic_fetch_andMODE instruction pattern: Standard Names.  (line 1842)
! * atomic_fetch_nandMODE instruction pattern: Standard Names. (line 1842)
! * atomic_fetch_orMODE instruction pattern: Standard Names.   (line 1842)
! * atomic_fetch_subMODE instruction pattern: Standard Names.  (line 1842)
! * atomic_fetch_xorMODE instruction pattern: Standard Names.  (line 1842)
! * atomic_loadMODE instruction pattern:   Standard Names.     (line 1795)
! * atomic_nandMODE instruction pattern:   Standard Names.     (line 1828)
! * atomic_nand_fetchMODE instruction pattern: Standard Names. (line 1857)
! * atomic_orMODE instruction pattern:     Standard Names.     (line 1828)
! * atomic_or_fetchMODE instruction pattern: Standard Names.   (line 1857)
! * atomic_storeMODE instruction pattern:  Standard Names.     (line 1805)
! * atomic_subMODE instruction pattern:    Standard Names.     (line 1828)
! * atomic_sub_fetchMODE instruction pattern: Standard Names.  (line 1857)
! * atomic_test_and_set instruction pattern: Standard Names.   (line 1874)
! * atomic_xorMODE instruction pattern:    Standard Names.     (line 1828)
! * atomic_xor_fetchMODE instruction pattern: Standard Names.  (line 1857)
! * attr:                                  Expressions.        (line  163)
  * attr <1>:                              Tagging Insns.      (line   54)
  * attribute expressions:                 Expressions.        (line    6)
  * attribute specifications:              Attr Example.       (line    6)
  * attribute specifications example:      Attr Example.       (line    6)
  * attributes:                            Attributes.         (line    6)
  * attributes, defining:                  Defining Attributes.
                                                               (line    6)
  * attributes, target-specific:           Target Attributes.  (line    6)
! * ATTRIBUTE_ALIGNED_VALUE:               Storage Layout.     (line  177)
! * attr_flag:                             Expressions.        (line  138)
! * autoincrement addressing, availability: Portability.       (line   20)
  * autoincrement/decrement addressing:    Simple Constraints. (line   30)
  * automata_option:                       Processor pipeline description.
!                                                              (line  304)
  * automaton based pipeline description:  Processor pipeline description.
                                                               (line    6)
+ * automaton based pipeline description <1>: Processor pipeline description.
+                                                              (line   49)
  * automaton based scheduler:             Processor pipeline description.
                                                               (line    6)
  * AVOID_CCMODE_COPIES:                   Values in Registers.
!                                                              (line  150)
  * backslash:                             Output Template.    (line   46)
! * barrier:                               Insns.              (line  176)
  * barrier and /f:                        Flags.              (line  107)
  * barrier and /v:                        Flags.              (line   44)
! * BASE_REG_CLASS:                        Register Classes.   (line  111)
  * basic block:                           Basic Blocks.       (line    6)
  * Basic Statements:                      Basic Statements.   (line    6)
  * basic-block.h:                         Control Flow.       (line    6)
  * basic_block:                           Basic Blocks.       (line    6)
+ * BASIC_BLOCK:                           Basic Blocks.       (line   14)
  * BB_HEAD, BB_END:                       Maintaining the CFG.
!                                                              (line   76)
! * bb_seq:                                GIMPLE sequences.   (line   72)
! * BIGGEST_ALIGNMENT:                     Storage Layout.     (line  162)
! * BIGGEST_FIELD_ALIGNMENT:               Storage Layout.     (line  188)
  * BImode:                                Machine Modes.      (line   22)
  * BIND_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * BINFO_TYPE:                            Classes.            (line    6)
  * bit-fields:                            Bit-Fields.         (line    6)
+ * BITFIELD_NBYTES_LIMITED:               Storage Layout.     (line  398)
+ * BITS_BIG_ENDIAN:                       Storage Layout.     (line   11)
+ * BITS_BIG_ENDIAN, effect on sign_extract: Bit-Fields.       (line    8)
+ * BITS_PER_UNIT:                         Machine Modes.      (line  354)
+ * BITS_PER_WORD:                         Storage Layout.     (line   50)
+ * bitwise complement:                    Arithmetic.         (line  154)
+ * bitwise exclusive-or:                  Arithmetic.         (line  168)
+ * bitwise inclusive-or:                  Arithmetic.         (line  163)
+ * bitwise logical-and:                   Arithmetic.         (line  158)
  * BIT_AND_EXPR:                          Unary and Binary Expressions.
                                                               (line    6)
  * BIT_IOR_EXPR:                          Unary and Binary Expressions.
*************** Concept Index
*** 47551,47586 ****
                                                               (line    6)
  * BIT_XOR_EXPR:                          Unary and Binary Expressions.
                                                               (line    6)
! * BITFIELD_NBYTES_LIMITED:               Storage Layout.     (line  402)
! * BITS_BIG_ENDIAN:                       Storage Layout.     (line   12)
! * BITS_BIG_ENDIAN, effect on sign_extract: Bit-Fields.       (line    8)
! * BITS_PER_UNIT:                         Machine Modes.      (line  355)
! * BITS_PER_WORD:                         Storage Layout.     (line   51)
! * bitwise complement:                    Arithmetic.         (line  153)
! * bitwise exclusive-or:                  Arithmetic.         (line  167)
! * bitwise inclusive-or:                  Arithmetic.         (line  162)
! * bitwise logical-and:                   Arithmetic.         (line  157)
! * BLKmode:                               Machine Modes.      (line  186)
  * BLKmode, and function return values:   Calls.              (line   23)
! * BLOCK_FOR_INSN, gimple_bb:             Maintaining the CFG.
!                                                              (line   29)
! * BLOCK_REG_PADDING:                     Register Arguments. (line  244)
! * blockage instruction pattern:          Standard Names.     (line 1637)
  * Blocks:                                Blocks.             (line    6)
! * BND32mode:                             Machine Modes.      (line  210)
! * BND64mode:                             Machine Modes.      (line  210)
! * bool:                                  Misc.               (line  998)
! * BOOL_TYPE_SIZE:                        Type Layout.        (line   44)
  * BOOLEAN_TYPE:                          Types.              (line    6)
  * branch prediction:                     Profile information.
                                                               (line   24)
! * BRANCH_COST:                           Costs.              (line  105)
! * break_out_memory_refs:                 Addressing Modes.   (line  135)
  * BREAK_STMT:                            Statements for C++. (line    6)
! * BSS_SECTION_ASM_OP:                    Sections.           (line   68)
  * bswap:                                 Arithmetic.         (line  246)
! * bswapM2 instruction pattern:           Standard Names.     (line  576)
! * btruncM2 instruction pattern:          Standard Names.     (line  688)
  * build0:                                Macros and Functions.
                                                               (line   16)
  * build1:                                Macros and Functions.
--- 47105,47131 ----
                                                               (line    6)
  * BIT_XOR_EXPR:                          Unary and Binary Expressions.
                                                               (line    6)
! * BLKmode:                               Machine Modes.      (line  185)
  * BLKmode, and function return values:   Calls.              (line   23)
! * blockage instruction pattern:          Standard Names.     (line 1627)
  * Blocks:                                Blocks.             (line    6)
! * BLOCK_FOR_INSN, gimple_bb:             Maintaining the CFG.
!                                                              (line   28)
! * BLOCK_REG_PADDING:                     Register Arguments. (line  242)
! * BND32mode:                             Machine Modes.      (line  209)
! * BND64mode:                             Machine Modes.      (line  209)
! * bool:                                  Misc.               (line  992)
  * BOOLEAN_TYPE:                          Types.              (line    6)
+ * BOOL_TYPE_SIZE:                        Type Layout.        (line   43)
  * branch prediction:                     Profile information.
                                                               (line   24)
! * BRANCH_COST:                           Costs.              (line  104)
! * break_out_memory_refs:                 Addressing Modes.   (line  134)
  * BREAK_STMT:                            Statements for C++. (line    6)
! * BSS_SECTION_ASM_OP:                    Sections.           (line   67)
  * bswap:                                 Arithmetic.         (line  246)
! * bswapM2 instruction pattern:           Standard Names.     (line  571)
! * btruncM2 instruction pattern:          Standard Names.     (line  683)
  * build0:                                Macros and Functions.
                                                               (line   16)
  * build1:                                Macros and Functions.
*************** Concept Index
*** 47595,47621 ****
                                                               (line   21)
  * build6:                                Macros and Functions.
                                                               (line   22)
! * builtin_longjmp instruction pattern:   Standard Names.     (line 1534)
  * builtin_setjmp_receiver instruction pattern: Standard Names.
!                                                              (line 1524)
! * builtin_setjmp_setup instruction pattern: Standard Names.  (line 1513)
! * byte_mode:                             Machine Modes.      (line  368)
! * BYTES_BIG_ENDIAN:                      Storage Layout.     (line   24)
! * BYTES_BIG_ENDIAN, effect on subreg:    Regs and Memory.    (line  221)
  * C statements for assembler output:     Output Statement.   (line    6)
! * C_COMMON_OVERRIDE_OPTIONS:             Run-time Target.    (line  137)
! * c_register_pragma:                     Misc.               (line  410)
! * c_register_pragma_with_expansion:      Misc.               (line  412)
! * cache:                                 GTY Options.        (line  124)
! * call <1>:                              Side Effects.       (line   92)
  * call:                                  Flags.              (line  221)
! * call instruction pattern:              Standard Names.     (line 1174)
  * call usage:                            Calls.              (line   10)
  * call, in call_insn:                    Flags.              (line   33)
  * call, in mem:                          Flags.              (line   81)
  * call-clobbered register:               Register Basics.    (line   35)
  * call-saved register:                   Register Basics.    (line   35)
  * call-used register:                    Register Basics.    (line   35)
  * CALL_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * call_insn:                             Insns.              (line   95)
--- 47140,47171 ----
                                                               (line   21)
  * build6:                                Macros and Functions.
                                                               (line   22)
! * builtin_longjmp instruction pattern:   Standard Names.     (line 1524)
  * builtin_setjmp_receiver instruction pattern: Standard Names.
!                                                              (line 1514)
! * builtin_setjmp_setup instruction pattern: Standard Names.  (line 1503)
! * BYTES_BIG_ENDIAN:                      Storage Layout.     (line   23)
! * BYTES_BIG_ENDIAN, effect on subreg:    Regs and Memory.    (line  219)
! * byte_mode:                             Machine Modes.      (line  367)
  * C statements for assembler output:     Output Statement.   (line    6)
! * cache:                                 GTY Options.        (line  125)
  * call:                                  Flags.              (line  221)
! * call <1>:                              Side Effects.       (line   92)
! * call instruction pattern:              Standard Names.     (line 1169)
  * call usage:                            Calls.              (line   10)
  * call, in call_insn:                    Flags.              (line   33)
  * call, in mem:                          Flags.              (line   81)
  * call-clobbered register:               Register Basics.    (line   35)
+ * call-clobbered register <1>:           Register Basics.    (line   46)
+ * call-clobbered register <2>:           Register Basics.    (line   53)
  * call-saved register:                   Register Basics.    (line   35)
+ * call-saved register <1>:               Register Basics.    (line   46)
+ * call-saved register <2>:               Register Basics.    (line   53)
  * call-used register:                    Register Basics.    (line   35)
+ * call-used register <1>:                Register Basics.    (line   46)
+ * call-used register <2>:                Register Basics.    (line   53)
+ * calling conventions:                   Stack and Calling.  (line    6)
+ * calling functions in RTL:              Calls.              (line    6)
  * CALL_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * call_insn:                             Insns.              (line   95)
*************** Concept Index
*** 47624,47748 ****
  * call_insn and /i:                      Flags.              (line   24)
  * call_insn and /j:                      Flags.              (line  161)
  * call_insn and /s:                      Flags.              (line   49)
  * call_insn and /u:                      Flags.              (line   19)
  * call_insn and /u or /i:                Flags.              (line   29)
  * call_insn and /v:                      Flags.              (line   44)
  * CALL_INSN_FUNCTION_USAGE:              Insns.              (line  101)
! * call_pop instruction pattern:          Standard Names.     (line 1202)
! * CALL_POPS_ARGS:                        Stack Arguments.    (line  139)
! * CALL_REALLY_USED_REGISTERS:            Register Basics.    (line   46)
! * CALL_USED_REGISTERS:                   Register Basics.    (line   35)
  * call_used_regs:                        Register Basics.    (line   59)
! * call_value instruction pattern:        Standard Names.     (line 1194)
! * call_value_pop instruction pattern:    Standard Names.     (line 1202)
! * calling conventions:                   Stack and Calling.  (line    6)
! * calling functions in RTL:              Calls.              (line    6)
! * can_create_pseudo_p:                   Standard Names.     (line   75)
! * can_fallthru:                          Basic Blocks.       (line   67)
  * canadian:                              Configure Terms.    (line    6)
! * CANNOT_CHANGE_MODE_CLASS:              Register Classes.   (line  538)
  * CANNOT_CHANGE_MODE_CLASS and subreg semantics: Regs and Memory.
!                                                              (line  280)
  * canonicalization of instructions:      Insn Canonicalizations.
                                                               (line    6)
  * canonicalize_funcptr_for_compare instruction pattern: Standard Names.
!                                                              (line 1365)
  * caret:                                 Multi-Alternative.  (line   52)
! * CASE_VECTOR_MODE:                      Misc.               (line   27)
! * CASE_VECTOR_PC_RELATIVE:               Misc.               (line   40)
! * CASE_VECTOR_SHORTEN_MODE:              Misc.               (line   31)
! * casesi instruction pattern:            Standard Names.     (line 1296)
! * cbranchMODE4 instruction pattern:      Standard Names.     (line 1163)
  * cc0 <1>:                               CC0 Condition Codes.
                                                               (line    6)
- * cc0:                                   Regs and Memory.    (line  307)
  * cc0, RTL sharing:                      Sharing.            (line   27)
! * cc0_rtx:                               Regs and Memory.    (line  333)
! * CC1_SPEC:                              Driver.             (line   56)
! * CC1PLUS_SPEC:                          Driver.             (line   64)
  * cc_status:                             CC0 Condition Codes.
                                                               (line    6)
  * CC_STATUS_MDEP:                        CC0 Condition Codes.
!                                                              (line   17)
  * CC_STATUS_MDEP_INIT:                   CC0 Condition Codes.
!                                                              (line   23)
! * CCmode <1>:                            MODE_CC Condition Codes.
!                                                              (line    6)
! * CCmode:                                Machine Modes.      (line  179)
! * CDImode:                               Machine Modes.      (line  205)
  * CEIL_DIV_EXPR:                         Unary and Binary Expressions.
                                                               (line    6)
  * CEIL_MOD_EXPR:                         Unary and Binary Expressions.
                                                               (line    6)
! * ceilM2 instruction pattern:            Standard Names.     (line  704)
! * CFA_FRAME_BASE_OFFSET:                 Frame Layout.       (line  228)
  * CFG verification:                      Maintaining the CFG.
!                                                              (line  119)
  * CFG, Control Flow Graph:               Control Flow.       (line    6)
  * cfghooks.h:                            Maintaining the CFG.
                                                               (line    6)
! * cgraph_finalize_function:              Parsing pass.       (line   52)
! * chain_circular:                        GTY Options.        (line  162)
! * chain_next:                            GTY Options.        (line  162)
! * chain_prev:                            GTY Options.        (line  162)
  * change_address:                        Standard Names.     (line   47)
! * CHAR_TYPE_SIZE:                        Type Layout.        (line   39)
! * check_stack instruction pattern:       Standard Names.     (line 1452)
! * CHImode:                               Machine Modes.      (line  205)
  * CILK_PLUS:                             Cilk Plus Transformation.
                                                               (line    6)
  * class definitions, register:           Register Classes.   (line    6)
  * class preference constraints:          Class Preferences.  (line    6)
  * class, scope:                          Classes.            (line    6)
- * CLASS_MAX_NREGS:                       Register Classes.   (line  526)
- * CLASS_TYPE_P:                          Types for C++.      (line   65)
  * classes of RTX codes:                  RTL Classes.        (line    6)
  * CLASSTYPE_DECLARED_CLASS:              Classes.            (line    6)
  * CLASSTYPE_HAS_MUTABLE:                 Classes.            (line   85)
  * CLASSTYPE_NON_POD_P:                   Classes.            (line   90)
  * CLEANUP_DECL:                          Statements for C++. (line    6)
  * CLEANUP_EXPR:                          Statements for C++. (line    6)
  * CLEANUP_POINT_EXPR:                    Unary and Binary Expressions.
                                                               (line    6)
  * CLEANUP_STMT:                          Statements for C++. (line    6)
! * Cleanups:                              Cleanups.           (line    6)
! * clear_cache instruction pattern:       Standard Names.     (line 1944)
! * CLEAR_INSN_CACHE:                      Trampolines.        (line   99)
! * CLEAR_RATIO:                           Costs.              (line  205)
  * clobber:                               Side Effects.       (line  106)
  * clrsb:                                 Arithmetic.         (line  215)
! * clrsbM2 instruction pattern:           Standard Names.     (line  769)
  * clz:                                   Arithmetic.         (line  222)
! * CLZ_DEFINED_VALUE_AT_ZERO:             Misc.               (line  305)
! * clzM2 instruction pattern:             Standard Names.     (line  776)
! * cmpmemM instruction pattern:           Standard Names.     (line  917)
! * cmpstrM instruction pattern:           Standard Names.     (line  896)
! * cmpstrnM instruction pattern:          Standard Names.     (line  883)
  * code generation RTL sequences:         Expander Definitions.
                                                               (line    6)
  * code iterators in .md files:           Code Iterators.     (line    6)
! * CODE_LABEL:                            Basic Blocks.       (line   50)
  * code_label:                            Insns.              (line  125)
  * code_label and /i:                     Flags.              (line   59)
  * code_label and /v:                     Flags.              (line   44)
  * CODE_LABEL_NUMBER:                     Insns.              (line  125)
! * codes, RTL expression:                 RTL Objects.        (line   47)
! * COImode:                               Machine Modes.      (line  205)
  * COLLECT2_HOST_INITIALIZATION:          Host Misc.          (line   32)
! * COLLECT_EXPORT_LIST:                   Misc.               (line  870)
  * COLLECT_SHARED_FINI_FUNC:              Macros for Initialization.
!                                                              (line   44)
  * COLLECT_SHARED_INIT_FUNC:              Macros for Initialization.
!                                                              (line   33)
  * commit_edge_insertions:                Maintaining the CFG.
!                                                              (line  107)
! * compare:                               Arithmetic.         (line   43)
  * compare, canonicalization of:          Insn Canonicalizations.
!                                                              (line   37)
  * comparison_operator:                   Machine-Independent Predicates.
!                                                              (line  111)
  * compiler passes and files:             Passes.             (line    6)
! * complement, bitwise:                   Arithmetic.         (line  153)
  * COMPLEX_CST:                           Constant expressions.
                                                               (line    6)
  * COMPLEX_EXPR:                          Unary and Binary Expressions.
--- 47174,47298 ----
  * call_insn and /i:                      Flags.              (line   24)
  * call_insn and /j:                      Flags.              (line  161)
  * call_insn and /s:                      Flags.              (line   49)
+ * call_insn and /s <1>:                  Flags.              (line  148)
  * call_insn and /u:                      Flags.              (line   19)
+ * call_insn and /u <1>:                  Flags.              (line   39)
  * call_insn and /u or /i:                Flags.              (line   29)
  * call_insn and /v:                      Flags.              (line   44)
  * CALL_INSN_FUNCTION_USAGE:              Insns.              (line  101)
! * call_pop instruction pattern:          Standard Names.     (line 1197)
! * CALL_POPS_ARGS:                        Stack Arguments.    (line  138)
! * CALL_REALLY_USED_REGISTERS:            Register Basics.    (line   45)
! * CALL_USED_REGISTERS:                   Register Basics.    (line   34)
  * call_used_regs:                        Register Basics.    (line   59)
! * call_value instruction pattern:        Standard Names.     (line 1189)
! * call_value_pop instruction pattern:    Standard Names.     (line 1197)
  * canadian:                              Configure Terms.    (line    6)
! * CANNOT_CHANGE_MODE_CLASS:              Register Classes.   (line  533)
  * CANNOT_CHANGE_MODE_CLASS and subreg semantics: Regs and Memory.
!                                                              (line  276)
  * canonicalization of instructions:      Insn Canonicalizations.
                                                               (line    6)
  * canonicalize_funcptr_for_compare instruction pattern: Standard Names.
!                                                              (line 1358)
! * can_create_pseudo_p:                   Standard Names.     (line   75)
! * can_fallthru:                          Basic Blocks.       (line   67)
  * caret:                                 Multi-Alternative.  (line   52)
! * casesi instruction pattern:            Standard Names.     (line 1290)
! * CASE_VECTOR_MODE:                      Misc.               (line   26)
! * CASE_VECTOR_PC_RELATIVE:               Misc.               (line   39)
! * CASE_VECTOR_SHORTEN_MODE:              Misc.               (line   30)
! * cbranchMODE4 instruction pattern:      Standard Names.     (line 1158)
! * cc0:                                   Regs and Memory.    (line  303)
  * cc0 <1>:                               CC0 Condition Codes.
                                                               (line    6)
  * cc0, RTL sharing:                      Sharing.            (line   27)
! * cc0_rtx:                               Regs and Memory.    (line  329)
! * CC1PLUS_SPEC:                          Driver.             (line   63)
! * CC1_SPEC:                              Driver.             (line   55)
! * CCmode:                                Machine Modes.      (line  178)
! * CCmode <1>:                            MODE_CC Condition Codes.
!                                                              (line    6)
  * cc_status:                             CC0 Condition Codes.
                                                               (line    6)
  * CC_STATUS_MDEP:                        CC0 Condition Codes.
!                                                              (line   16)
  * CC_STATUS_MDEP_INIT:                   CC0 Condition Codes.
!                                                              (line   22)
! * CDImode:                               Machine Modes.      (line  204)
! * ceilM2 instruction pattern:            Standard Names.     (line  699)
  * CEIL_DIV_EXPR:                         Unary and Binary Expressions.
                                                               (line    6)
  * CEIL_MOD_EXPR:                         Unary and Binary Expressions.
                                                               (line    6)
! * CFA_FRAME_BASE_OFFSET:                 Frame Layout.       (line  226)
  * CFG verification:                      Maintaining the CFG.
!                                                              (line  117)
  * CFG, Control Flow Graph:               Control Flow.       (line    6)
  * cfghooks.h:                            Maintaining the CFG.
                                                               (line    6)
! * cgraph_finalize_function:              Parsing pass.       (line   51)
! * chain_circular:                        GTY Options.        (line  167)
! * chain_next:                            GTY Options.        (line  167)
! * chain_prev:                            GTY Options.        (line  167)
  * change_address:                        Standard Names.     (line   47)
! * CHAR_TYPE_SIZE:                        Type Layout.        (line   38)
! * check_stack instruction pattern:       Standard Names.     (line 1444)
! * CHImode:                               Machine Modes.      (line  204)
  * CILK_PLUS:                             Cilk Plus Transformation.
                                                               (line    6)
  * class definitions, register:           Register Classes.   (line    6)
  * class preference constraints:          Class Preferences.  (line    6)
  * class, scope:                          Classes.            (line    6)
  * classes of RTX codes:                  RTL Classes.        (line    6)
  * CLASSTYPE_DECLARED_CLASS:              Classes.            (line    6)
  * CLASSTYPE_HAS_MUTABLE:                 Classes.            (line   85)
  * CLASSTYPE_NON_POD_P:                   Classes.            (line   90)
+ * CLASS_MAX_NREGS:                       Register Classes.   (line  521)
+ * CLASS_TYPE_P:                          Types for C++.      (line   63)
+ * Cleanups:                              Cleanups.           (line    6)
  * CLEANUP_DECL:                          Statements for C++. (line    6)
  * CLEANUP_EXPR:                          Statements for C++. (line    6)
  * CLEANUP_POINT_EXPR:                    Unary and Binary Expressions.
                                                               (line    6)
  * CLEANUP_STMT:                          Statements for C++. (line    6)
! * clear_cache instruction pattern:       Standard Names.     (line 1934)
! * CLEAR_INSN_CACHE:                      Trampolines.        (line   98)
! * CLEAR_RATIO:                           Costs.              (line  204)
  * clobber:                               Side Effects.       (line  106)
  * clrsb:                                 Arithmetic.         (line  215)
! * clrsbM2 instruction pattern:           Standard Names.     (line  764)
  * clz:                                   Arithmetic.         (line  222)
! * clzM2 instruction pattern:             Standard Names.     (line  771)
! * CLZ_DEFINED_VALUE_AT_ZERO:             Misc.               (line  304)
! * cmpmemM instruction pattern:           Standard Names.     (line  912)
! * cmpstrM instruction pattern:           Standard Names.     (line  891)
! * cmpstrnM instruction pattern:          Standard Names.     (line  878)
  * code generation RTL sequences:         Expander Definitions.
                                                               (line    6)
  * code iterators in .md files:           Code Iterators.     (line    6)
! * codes, RTL expression:                 RTL Objects.        (line   47)
  * code_label:                            Insns.              (line  125)
+ * CODE_LABEL:                            Basic Blocks.       (line   50)
  * code_label and /i:                     Flags.              (line   59)
  * code_label and /v:                     Flags.              (line   44)
  * CODE_LABEL_NUMBER:                     Insns.              (line  125)
! * COImode:                               Machine Modes.      (line  204)
  * COLLECT2_HOST_INITIALIZATION:          Host Misc.          (line   32)
! * COLLECT_EXPORT_LIST:                   Misc.               (line  866)
  * COLLECT_SHARED_FINI_FUNC:              Macros for Initialization.
!                                                              (line   43)
  * COLLECT_SHARED_INIT_FUNC:              Macros for Initialization.
!                                                              (line   32)
  * commit_edge_insertions:                Maintaining the CFG.
!                                                              (line  105)
! * compare:                               Arithmetic.         (line   46)
  * compare, canonicalization of:          Insn Canonicalizations.
!                                                              (line   36)
  * comparison_operator:                   Machine-Independent Predicates.
!                                                              (line  110)
  * compiler passes and files:             Passes.             (line    6)
! * complement, bitwise:                   Arithmetic.         (line  154)
  * COMPLEX_CST:                           Constant expressions.
                                                               (line    6)
  * COMPLEX_EXPR:                          Unary and Binary Expressions.
*************** Concept Index
*** 47757,47775 ****
  * COMPOUND_LITERAL_EXPR:                 Unary and Binary Expressions.
                                                               (line    6)
  * COMPOUND_LITERAL_EXPR_DECL:            Unary and Binary Expressions.
!                                                              (line  378)
  * COMPOUND_LITERAL_EXPR_DECL_EXPR:       Unary and Binary Expressions.
!                                                              (line  378)
! * computed jump:                         Edges.              (line  128)
  * computing the length of an insn:       Insn Lengths.       (line    6)
! * concat:                                Regs and Memory.    (line  385)
! * concatn:                               Regs and Memory.    (line  391)
  * cond:                                  Comparisons.        (line   90)
  * cond and attributes:                   Expressions.        (line   37)
! * cond_exec:                             Side Effects.       (line  254)
! * COND_EXPR:                             Unary and Binary Expressions.
!                                                              (line    6)
! * condition code register:               Regs and Memory.    (line  307)
  * condition code status:                 Condition Code.     (line    6)
  * condition codes:                       Comparisons.        (line   20)
  * conditional execution:                 Conditional Execution.
--- 47307,47322 ----
  * COMPOUND_LITERAL_EXPR:                 Unary and Binary Expressions.
                                                               (line    6)
  * COMPOUND_LITERAL_EXPR_DECL:            Unary and Binary Expressions.
!                                                              (line  377)
  * COMPOUND_LITERAL_EXPR_DECL_EXPR:       Unary and Binary Expressions.
!                                                              (line  377)
! * computed jump:                         Edges.              (line  127)
  * computing the length of an insn:       Insn Lengths.       (line    6)
! * concat:                                Regs and Memory.    (line  381)
! * concatn:                               Regs and Memory.    (line  387)
  * cond:                                  Comparisons.        (line   90)
  * cond and attributes:                   Expressions.        (line   37)
! * condition code register:               Regs and Memory.    (line  303)
  * condition code status:                 Condition Code.     (line    6)
  * condition codes:                       Comparisons.        (line   20)
  * conditional execution:                 Conditional Execution.
*************** Concept Index
*** 47777,47807 ****
  * Conditional Expressions:               Conditional Expressions.
                                                               (line    6)
  * conditions, in patterns:               Patterns.           (line   43)
! * configuration file <1>:                Host Misc.          (line    6)
  * configuration file:                    Filesystem.         (line    6)
  * configure terms:                       Configure Terms.    (line    6)
  * CONJ_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * const:                                 Constants.          (line  140)
- * CONST0_RTX:                            Constants.          (line  160)
  * const0_rtx:                            Constants.          (line   21)
! * CONST1_RTX:                            Constants.          (line  160)
  * const1_rtx:                            Constants.          (line   21)
! * CONST2_RTX:                            Constants.          (line  160)
  * const2_rtx:                            Constants.          (line   21)
  * CONST_DECL:                            Declarations.       (line    6)
  * const_double:                          Constants.          (line   37)
  * const_double, RTL sharing:             Sharing.            (line   29)
  * CONST_DOUBLE_LOW:                      Constants.          (line   54)
  * const_double_operand:                  Machine-Independent Predicates.
!                                                              (line   21)
  * const_fixed:                           Constants.          (line   93)
  * const_int:                             Constants.          (line    8)
  * const_int and attribute tests:         Expressions.        (line   47)
  * const_int and attributes:              Expressions.        (line   10)
  * const_int, RTL sharing:                Sharing.            (line   23)
  * const_int_operand:                     Machine-Independent Predicates.
!                                                              (line   16)
  * const_string:                          Constants.          (line  112)
  * const_string and attributes:           Expressions.        (line   20)
  * const_true_rtx:                        Constants.          (line   31)
--- 47324,47384 ----
  * Conditional Expressions:               Conditional Expressions.
                                                               (line    6)
  * conditions, in patterns:               Patterns.           (line   43)
! * cond_exec:                             Side Effects.       (line  254)
! * COND_EXPR:                             Unary and Binary Expressions.
!                                                              (line    6)
  * configuration file:                    Filesystem.         (line    6)
+ * configuration file <1>:                Host Misc.          (line    6)
  * configure terms:                       Configure Terms.    (line    6)
  * CONJ_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * const:                                 Constants.          (line  140)
  * const0_rtx:                            Constants.          (line   21)
! * CONST0_RTX:                            Constants.          (line  160)
  * const1_rtx:                            Constants.          (line   21)
! * CONST1_RTX:                            Constants.          (line  160)
  * const2_rtx:                            Constants.          (line   21)
+ * CONST2_RTX:                            Constants.          (line  160)
+ * constant attributes:                   Constant Attributes.
+                                                              (line    6)
+ * constant definitions:                  Constant Definitions.
+                                                              (line    6)
+ * constants in constraints:              Simple Constraints. (line   68)
+ * CONSTANT_ADDRESS_P:                    Addressing Modes.   (line   28)
+ * CONSTANT_ALIGNMENT:                    Storage Layout.     (line  241)
+ * CONSTANT_P:                            Addressing Modes.   (line   35)
+ * CONSTANT_POOL_ADDRESS_P:               Flags.              (line   10)
+ * CONSTANT_POOL_BEFORE_FUNCTION:         Data Output.        (line   68)
+ * constm1_rtx:                           Constants.          (line   21)
+ * constraint modifier characters:        Modifiers.          (line    6)
+ * constraint, matching:                  Simple Constraints. (line  140)
+ * constraints:                           Constraints.        (line    6)
+ * constraints, defining:                 Define Constraints. (line    6)
+ * constraints, machine specific:         Machine Constraints.
+                                                              (line    6)
+ * constraints, testing:                  C Constraint Interface.
+                                                              (line    6)
+ * constraint_num:                        C Constraint Interface.
+                                                              (line   30)
+ * constraint_satisfied_p:                C Constraint Interface.
+                                                              (line   42)
+ * CONSTRUCTOR:                           Unary and Binary Expressions.
+                                                              (line    6)
+ * constructors, automatic calls:         Collect2.           (line   15)
+ * constructors, output of:               Initialization.     (line    6)
  * CONST_DECL:                            Declarations.       (line    6)
  * const_double:                          Constants.          (line   37)
  * const_double, RTL sharing:             Sharing.            (line   29)
  * CONST_DOUBLE_LOW:                      Constants.          (line   54)
  * const_double_operand:                  Machine-Independent Predicates.
!                                                              (line   20)
  * const_fixed:                           Constants.          (line   93)
  * const_int:                             Constants.          (line    8)
  * const_int and attribute tests:         Expressions.        (line   47)
  * const_int and attributes:              Expressions.        (line   10)
  * const_int, RTL sharing:                Sharing.            (line   23)
  * const_int_operand:                     Machine-Independent Predicates.
!                                                              (line   15)
  * const_string:                          Constants.          (line  112)
  * const_string and attributes:           Expressions.        (line   20)
  * const_true_rtx:                        Constants.          (line   31)
*************** Concept Index
*** 47811,47843 ****
  * CONST_WIDE_INT_ELT:                    Constants.          (line   89)
  * CONST_WIDE_INT_NUNITS:                 Constants.          (line   84)
  * CONST_WIDE_INT_VEC:                    Constants.          (line   80)
- * constant attributes:                   Constant Attributes.
-                                                              (line    6)
- * constant definitions:                  Constant Definitions.
-                                                              (line    6)
- * CONSTANT_ADDRESS_P:                    Addressing Modes.   (line   29)
- * CONSTANT_ALIGNMENT:                    Storage Layout.     (line  245)
- * CONSTANT_P:                            Addressing Modes.   (line   36)
- * CONSTANT_POOL_ADDRESS_P:               Flags.              (line   10)
- * CONSTANT_POOL_BEFORE_FUNCTION:         Data Output.        (line   69)
- * constants in constraints:              Simple Constraints. (line   70)
- * constm1_rtx:                           Constants.          (line   21)
- * constraint modifier characters:        Modifiers.          (line    6)
- * constraint, matching:                  Simple Constraints. (line  142)
- * constraint_num:                        C Constraint Interface.
-                                                              (line   31)
- * constraint_satisfied_p:                C Constraint Interface.
-                                                              (line   44)
- * constraints:                           Constraints.        (line    6)
- * constraints, defining:                 Define Constraints. (line    6)
- * constraints, machine specific:         Machine Constraints.
-                                                              (line    6)
- * constraints, testing:                  C Constraint Interface.
-                                                              (line    6)
- * CONSTRUCTOR:                           Unary and Binary Expressions.
-                                                              (line    6)
- * constructors, automatic calls:         Collect2.           (line   15)
- * constructors, output of:               Initialization.     (line    6)
  * container:                             Containers.         (line    6)
  * CONTINUE_STMT:                         Statements for C++. (line    6)
  * contributors:                          Contributors.       (line    6)
--- 47388,47393 ----
*************** Concept Index
*** 47847,47978 ****
  * conversions:                           Conversions.        (line    6)
  * CONVERT_EXPR:                          Unary and Binary Expressions.
                                                               (line    6)
! * copy_rtx:                              Addressing Modes.   (line  190)
  * copy_rtx_if_shared:                    Sharing.            (line   64)
! * copysignM3 instruction pattern:        Standard Names.     (line  750)
! * cosM2 instruction pattern:             Standard Names.     (line  616)
  * costs of instructions:                 Costs.              (line    6)
! * CP_INTEGRAL_TYPE:                      Types for C++.      (line   57)
  * cp_namespace_decls:                    Namespaces.         (line   49)
  * CP_TYPE_CONST_NON_VOLATILE_P:          Types for C++.      (line   33)
  * CP_TYPE_CONST_P:                       Types for C++.      (line   24)
  * cp_type_quals:                         Types for C++.      (line    6)
  * CP_TYPE_RESTRICT_P:                    Types for C++.      (line   30)
  * CP_TYPE_VOLATILE_P:                    Types for C++.      (line   27)
! * CPLUSPLUS_CPP_SPEC:                    Driver.             (line   51)
! * CPP_SPEC:                              Driver.             (line   44)
! * CQImode:                               Machine Modes.      (line  205)
  * cross compilation and floating point:  Floating Point.     (line    6)
! * CRT_CALL_STATIC_FUNCTION:              Sections.           (line  121)
! * crtl->args.pops_args:                  Function Entry.     (line  106)
! * crtl->args.pretend_args_size:          Function Entry.     (line  112)
  * crtl->outgoing_args_size:              Stack Arguments.    (line   48)
  * CRTSTUFF_T_CFLAGS:                     Target Fragment.    (line   15)
  * CRTSTUFF_T_CFLAGS_S:                   Target Fragment.    (line   19)
! * CSImode:                               Machine Modes.      (line  205)
! * cstoreMODE4 instruction pattern:       Standard Names.     (line 1124)
! * CTImode:                               Machine Modes.      (line  205)
! * ctrapMM4 instruction pattern:          Standard Names.     (line 1606)
  * ctz:                                   Arithmetic.         (line  230)
! * CTZ_DEFINED_VALUE_AT_ZERO:             Misc.               (line  306)
! * ctzM2 instruction pattern:             Standard Names.     (line  785)
! * CUMULATIVE_ARGS:                       Register Arguments. (line  142)
! * current_function_is_leaf:              Leaf Functions.     (line   51)
! * current_function_uses_only_leaf_regs:  Leaf Functions.     (line   51)
  * current_insn_predicate:                Conditional Execution.
                                                               (line   27)
! * DAmode:                                Machine Modes.      (line  155)
  * data bypass:                           Processor pipeline description.
!                                                              (line  106)
  * data dependence delays:                Processor pipeline description.
                                                               (line    6)
  * Data Dependency Analysis:              Dependency analysis.
                                                               (line    6)
  * data structures:                       Per-Function Data.  (line    6)
! * DATA_ABI_ALIGNMENT:                    Storage Layout.     (line  237)
! * DATA_ALIGNMENT:                        Storage Layout.     (line  224)
! * DATA_SECTION_ASM_OP:                   Sections.           (line   53)
! * DBR_OUTPUT_SEQEND:                     Instruction Output. (line  135)
! * dbr_sequence_length:                   Instruction Output. (line  134)
! * DBX_BLOCKS_FUNCTION_RELATIVE:          DBX Options.        (line  103)
! * DBX_CONTIN_CHAR:                       DBX Options.        (line   66)
! * DBX_CONTIN_LENGTH:                     DBX Options.        (line   56)
! * DBX_DEBUGGING_INFO:                    DBX Options.        (line    9)
! * DBX_FUNCTION_FIRST:                    DBX Options.        (line   97)
! * DBX_LINES_FUNCTION_RELATIVE:           DBX Options.        (line  109)
! * DBX_NO_XREFS:                          DBX Options.        (line   50)
! * DBX_OUTPUT_MAIN_SOURCE_FILE_END:       File Names and DBX. (line   34)
! * DBX_OUTPUT_MAIN_SOURCE_FILENAME:       File Names and DBX. (line    9)
  * DBX_OUTPUT_NULL_N_SO_AT_MAIN_SOURCE_FILE_END: File Names and DBX.
!                                                              (line   42)
! * DBX_OUTPUT_SOURCE_LINE:                DBX Hooks.          (line    9)
! * DBX_REGISTER_NUMBER:                   All Debuggers.      (line    9)
! * DBX_REGPARM_STABS_CODE:                DBX Options.        (line   87)
! * DBX_REGPARM_STABS_LETTER:              DBX Options.        (line   92)
! * DBX_STATIC_CONST_VAR_CODE:             DBX Options.        (line   82)
! * DBX_STATIC_STAB_DATA_SECTION:          DBX Options.        (line   73)
! * DBX_TYPE_DECL_STABS_CODE:              DBX Options.        (line   78)
! * DBX_USE_BINCL:                         DBX Options.        (line  115)
! * DCmode:                                Machine Modes.      (line  200)
  * DDmode:                                Machine Modes.      (line   93)
  * De Morgan's law:                       Insn Canonicalizations.
!                                                              (line   52)
  * dead_or_set_p:                         define_peephole.    (line   65)
  * debug_expr:                            Debug Information.  (line   22)
  * DEBUG_EXPR_DECL:                       Declarations.       (line    6)
! * debug_insn:                            Insns.              (line  239)
! * DEBUG_SYMS_TEXT:                       DBX Options.        (line   25)
! * DEBUGGER_ARG_OFFSET:                   All Debuggers.      (line   37)
! * DEBUGGER_AUTO_OFFSET:                  All Debuggers.      (line   28)
  * decimal float library:                 Decimal float library routines.
                                                               (line    6)
  * DECL_ALIGN:                            Declarations.       (line    6)
  * DECL_ANTICIPATED:                      Functions for C++.  (line   42)
  * DECL_ARGUMENTS:                        Function Basics.    (line   36)
  * DECL_ARRAY_DELETE_OPERATOR_P:          Functions for C++.  (line  158)
- * DECL_ARTIFICIAL <1>:                   Function Properties.
-                                                              (line   47)
- * DECL_ARTIFICIAL <2>:                   Function Basics.    (line    6)
  * DECL_ARTIFICIAL:                       Working with declarations.
                                                               (line   24)
  * DECL_ASSEMBLER_NAME:                   Function Basics.    (line    6)
! * DECL_ATTRIBUTES:                       Attributes.         (line   22)
  * DECL_BASE_CONSTRUCTOR_P:               Functions for C++.  (line   88)
  * DECL_COMPLETE_CONSTRUCTOR_P:           Functions for C++.  (line   84)
  * DECL_COMPLETE_DESTRUCTOR_P:            Functions for C++.  (line   98)
- * DECL_CONST_MEMFUNC_P:                  Functions for C++.  (line   71)
  * DECL_CONSTRUCTOR_P:                    Functions for C++.  (line   77)
  * DECL_CONTEXT:                          Namespaces.         (line   31)
  * DECL_CONV_FN_P:                        Functions for C++.  (line  105)
  * DECL_COPY_CONSTRUCTOR_P:               Functions for C++.  (line   92)
  * DECL_DESTRUCTOR_P:                     Functions for C++.  (line   95)
! * DECL_EXTERN_C_FUNCTION_P:              Functions for C++.  (line   46)
  * DECL_EXTERNAL <1>:                     Function Properties.
                                                               (line   25)
! * DECL_EXTERNAL:                         Declarations.       (line    6)
  * DECL_FUNCTION_MEMBER_P:                Functions for C++.  (line   61)
  * DECL_FUNCTION_SPECIFIC_OPTIMIZATION <1>: Function Properties.
                                                               (line   61)
! * DECL_FUNCTION_SPECIFIC_OPTIMIZATION:   Function Basics.    (line    6)
  * DECL_FUNCTION_SPECIFIC_TARGET <1>:     Function Properties.
                                                               (line   55)
- * DECL_FUNCTION_SPECIFIC_TARGET:         Function Basics.    (line    6)
  * DECL_GLOBAL_CTOR_P:                    Functions for C++.  (line  108)
  * DECL_GLOBAL_DTOR_P:                    Functions for C++.  (line  112)
- * DECL_INITIAL <1>:                      Function Basics.    (line   51)
  * DECL_INITIAL:                          Declarations.       (line    6)
  * DECL_LINKONCE_P:                       Functions for C++.  (line   50)
  * DECL_LOCAL_FUNCTION_P:                 Functions for C++.  (line   38)
  * DECL_MAIN_P:                           Functions for C++.  (line   34)
- * DECL_NAME <1>:                         Namespaces.         (line   20)
- * DECL_NAME <2>:                         Function Basics.    (line    6)
  * DECL_NAME:                             Working with declarations.
                                                               (line    7)
  * DECL_NAMESPACE_ALIAS:                  Namespaces.         (line   35)
  * DECL_NAMESPACE_STD_P:                  Namespaces.         (line   45)
- * DECL_NON_THUNK_FUNCTION_P:             Functions for C++.  (line  138)
  * DECL_NONCONVERTING_P:                  Functions for C++.  (line   80)
  * DECL_NONSTATIC_MEMBER_FUNCTION_P:      Functions for C++.  (line   68)
  * DECL_OVERLOADED_OPERATOR_P:            Functions for C++.  (line  102)
  * DECL_PURE_P:                           Function Properties.
                                                               (line   40)
--- 47397,47539 ----
  * conversions:                           Conversions.        (line    6)
  * CONVERT_EXPR:                          Unary and Binary Expressions.
                                                               (line    6)
! * copysignM3 instruction pattern:        Standard Names.     (line  745)
! * copy_rtx:                              Addressing Modes.   (line  189)
  * copy_rtx_if_shared:                    Sharing.            (line   64)
! * cosM2 instruction pattern:             Standard Names.     (line  611)
  * costs of instructions:                 Costs.              (line    6)
! * CPLUSPLUS_CPP_SPEC:                    Driver.             (line   50)
! * CPP_SPEC:                              Driver.             (line   43)
! * CP_INTEGRAL_TYPE:                      Types for C++.      (line   55)
  * cp_namespace_decls:                    Namespaces.         (line   49)
  * CP_TYPE_CONST_NON_VOLATILE_P:          Types for C++.      (line   33)
  * CP_TYPE_CONST_P:                       Types for C++.      (line   24)
  * cp_type_quals:                         Types for C++.      (line    6)
+ * cp_type_quals <1>:                     Types for C++.      (line   16)
  * CP_TYPE_RESTRICT_P:                    Types for C++.      (line   30)
  * CP_TYPE_VOLATILE_P:                    Types for C++.      (line   27)
! * CQImode:                               Machine Modes.      (line  204)
  * cross compilation and floating point:  Floating Point.     (line    6)
! * crtl->args.pops_args:                  Function Entry.     (line  104)
! * crtl->args.pretend_args_size:          Function Entry.     (line  110)
  * crtl->outgoing_args_size:              Stack Arguments.    (line   48)
  * CRTSTUFF_T_CFLAGS:                     Target Fragment.    (line   15)
  * CRTSTUFF_T_CFLAGS_S:                   Target Fragment.    (line   19)
! * CRT_CALL_STATIC_FUNCTION:              Sections.           (line  120)
! * CSImode:                               Machine Modes.      (line  204)
! * cstoreMODE4 instruction pattern:       Standard Names.     (line 1119)
! * CTImode:                               Machine Modes.      (line  204)
! * ctrapMM4 instruction pattern:          Standard Names.     (line 1596)
  * ctz:                                   Arithmetic.         (line  230)
! * ctzM2 instruction pattern:             Standard Names.     (line  780)
! * CTZ_DEFINED_VALUE_AT_ZERO:             Misc.               (line  305)
! * CUMULATIVE_ARGS:                       Register Arguments. (line  140)
! * current_function_is_leaf:              Leaf Functions.     (line   50)
! * current_function_uses_only_leaf_regs:  Leaf Functions.     (line   50)
  * current_insn_predicate:                Conditional Execution.
                                                               (line   27)
! * C_COMMON_OVERRIDE_OPTIONS:             Run-time Target.    (line  136)
! * c_register_pragma:                     Misc.               (line  407)
! * c_register_pragma_with_expansion:      Misc.               (line  409)
! * DAmode:                                Machine Modes.      (line  154)
  * data bypass:                           Processor pipeline description.
!                                                              (line  105)
! * data bypass <1>:                       Processor pipeline description.
!                                                              (line  196)
  * data dependence delays:                Processor pipeline description.
                                                               (line    6)
  * Data Dependency Analysis:              Dependency analysis.
                                                               (line    6)
  * data structures:                       Per-Function Data.  (line    6)
! * DATA_ABI_ALIGNMENT:                    Storage Layout.     (line  233)
! * DATA_ALIGNMENT:                        Storage Layout.     (line  220)
! * DATA_SECTION_ASM_OP:                   Sections.           (line   52)
! * DBR_OUTPUT_SEQEND:                     Instruction Output. (line  133)
! * dbr_sequence_length:                   Instruction Output. (line  133)
! * DBX_BLOCKS_FUNCTION_RELATIVE:          DBX Options.        (line  100)
! * DBX_CONTIN_CHAR:                       DBX Options.        (line   63)
! * DBX_CONTIN_LENGTH:                     DBX Options.        (line   53)
! * DBX_DEBUGGING_INFO:                    DBX Options.        (line    8)
! * DBX_FUNCTION_FIRST:                    DBX Options.        (line   94)
! * DBX_LINES_FUNCTION_RELATIVE:           DBX Options.        (line  106)
! * DBX_NO_XREFS:                          DBX Options.        (line   47)
! * DBX_OUTPUT_MAIN_SOURCE_FILENAME:       File Names and DBX. (line    8)
! * DBX_OUTPUT_MAIN_SOURCE_FILE_END:       File Names and DBX. (line   33)
  * DBX_OUTPUT_NULL_N_SO_AT_MAIN_SOURCE_FILE_END: File Names and DBX.
!                                                              (line   41)
! * DBX_OUTPUT_SOURCE_LINE:                DBX Hooks.          (line    8)
! * DBX_REGISTER_NUMBER:                   All Debuggers.      (line    8)
! * DBX_REGPARM_STABS_CODE:                DBX Options.        (line   84)
! * DBX_REGPARM_STABS_LETTER:              DBX Options.        (line   89)
! * DBX_STATIC_CONST_VAR_CODE:             DBX Options.        (line   79)
! * DBX_STATIC_STAB_DATA_SECTION:          DBX Options.        (line   70)
! * DBX_TYPE_DECL_STABS_CODE:              DBX Options.        (line   75)
! * DBX_USE_BINCL:                         DBX Options.        (line  112)
! * DCmode:                                Machine Modes.      (line  199)
  * DDmode:                                Machine Modes.      (line   93)
  * De Morgan's law:                       Insn Canonicalizations.
!                                                              (line   51)
  * dead_or_set_p:                         define_peephole.    (line   65)
+ * DEBUGGER_ARG_OFFSET:                   All Debuggers.      (line   36)
+ * DEBUGGER_AUTO_OFFSET:                  All Debuggers.      (line   27)
  * debug_expr:                            Debug Information.  (line   22)
  * DEBUG_EXPR_DECL:                       Declarations.       (line    6)
! * debug_insn:                            Insns.              (line  236)
! * DEBUG_SYMS_TEXT:                       DBX Options.        (line   24)
  * decimal float library:                 Decimal float library routines.
                                                               (line    6)
+ * declaration:                           Declarations.       (line    6)
+ * declarations, RTL:                     RTL Declarations.   (line    6)
+ * DECLARE_LIBRARY_RENAMES:               Library Calls.      (line    8)
  * DECL_ALIGN:                            Declarations.       (line    6)
  * DECL_ANTICIPATED:                      Functions for C++.  (line   42)
  * DECL_ARGUMENTS:                        Function Basics.    (line   36)
  * DECL_ARRAY_DELETE_OPERATOR_P:          Functions for C++.  (line  158)
  * DECL_ARTIFICIAL:                       Working with declarations.
                                                               (line   24)
+ * DECL_ARTIFICIAL <1>:                   Function Basics.    (line    6)
+ * DECL_ARTIFICIAL <2>:                   Function Properties.
+                                                              (line   47)
  * DECL_ASSEMBLER_NAME:                   Function Basics.    (line    6)
! * DECL_ASSEMBLER_NAME <1>:               Function Basics.    (line   19)
! * DECL_ATTRIBUTES:                       Attributes.         (line   21)
  * DECL_BASE_CONSTRUCTOR_P:               Functions for C++.  (line   88)
  * DECL_COMPLETE_CONSTRUCTOR_P:           Functions for C++.  (line   84)
  * DECL_COMPLETE_DESTRUCTOR_P:            Functions for C++.  (line   98)
  * DECL_CONSTRUCTOR_P:                    Functions for C++.  (line   77)
+ * DECL_CONST_MEMFUNC_P:                  Functions for C++.  (line   71)
  * DECL_CONTEXT:                          Namespaces.         (line   31)
  * DECL_CONV_FN_P:                        Functions for C++.  (line  105)
  * DECL_COPY_CONSTRUCTOR_P:               Functions for C++.  (line   92)
  * DECL_DESTRUCTOR_P:                     Functions for C++.  (line   95)
! * DECL_EXTERNAL:                         Declarations.       (line    6)
  * DECL_EXTERNAL <1>:                     Function Properties.
                                                               (line   25)
! * DECL_EXTERN_C_FUNCTION_P:              Functions for C++.  (line   46)
  * DECL_FUNCTION_MEMBER_P:                Functions for C++.  (line   61)
+ * DECL_FUNCTION_SPECIFIC_OPTIMIZATION:   Function Basics.    (line    6)
  * DECL_FUNCTION_SPECIFIC_OPTIMIZATION <1>: Function Properties.
                                                               (line   61)
! * DECL_FUNCTION_SPECIFIC_TARGET:         Function Basics.    (line    6)
  * DECL_FUNCTION_SPECIFIC_TARGET <1>:     Function Properties.
                                                               (line   55)
  * DECL_GLOBAL_CTOR_P:                    Functions for C++.  (line  108)
  * DECL_GLOBAL_DTOR_P:                    Functions for C++.  (line  112)
  * DECL_INITIAL:                          Declarations.       (line    6)
+ * DECL_INITIAL <1>:                      Function Basics.    (line   51)
  * DECL_LINKONCE_P:                       Functions for C++.  (line   50)
  * DECL_LOCAL_FUNCTION_P:                 Functions for C++.  (line   38)
  * DECL_MAIN_P:                           Functions for C++.  (line   34)
  * DECL_NAME:                             Working with declarations.
                                                               (line    7)
+ * DECL_NAME <1>:                         Function Basics.    (line    6)
+ * DECL_NAME <2>:                         Function Basics.    (line    9)
+ * DECL_NAME <3>:                         Namespaces.         (line   20)
  * DECL_NAMESPACE_ALIAS:                  Namespaces.         (line   35)
  * DECL_NAMESPACE_STD_P:                  Namespaces.         (line   45)
  * DECL_NONCONVERTING_P:                  Functions for C++.  (line   80)
  * DECL_NONSTATIC_MEMBER_FUNCTION_P:      Functions for C++.  (line   68)
+ * DECL_NON_THUNK_FUNCTION_P:             Functions for C++.  (line  138)
  * DECL_OVERLOADED_OPERATOR_P:            Functions for C++.  (line  102)
  * DECL_PURE_P:                           Function Properties.
                                                               (line   40)
*************** Concept Index
*** 47986,48037 ****
  * DECL_VIRTUAL_P:                        Function Properties.
                                                               (line   44)
  * DECL_VOLATILE_MEMFUNC_P:               Functions for C++.  (line   74)
- * declaration:                           Declarations.       (line    6)
- * declarations, RTL:                     RTL Declarations.   (line    6)
- * DECLARE_LIBRARY_RENAMES:               Library Calls.      (line    9)
  * decrement_and_branch_until_zero instruction pattern: Standard Names.
!                                                              (line 1334)
  * default:                               GTY Options.        (line   88)
  * default_file_start:                    File Framework.     (line    8)
! * DEFAULT_GDB_EXTENSIONS:                DBX Options.        (line   18)
! * DEFAULT_PCC_STRUCT_RETURN:             Aggregate Return.   (line   35)
! * DEFAULT_SIGNED_CHAR:                   Type Layout.        (line  124)
! * define_address_constraint:             Define Constraints. (line  107)
  * define_asm_attributes:                 Tagging Insns.      (line   73)
  * define_attr:                           Defining Attributes.
                                                               (line    6)
  * define_automaton:                      Processor pipeline description.
                                                               (line   53)
  * define_bypass:                         Processor pipeline description.
!                                                              (line  197)
! * define_c_enum:                         Constant Definitions.
!                                                              (line   49)
  * define_code_attr:                      Code Iterators.     (line    6)
  * define_code_iterator:                  Code Iterators.     (line    6)
  * define_cond_exec:                      Conditional Execution.
                                                               (line   13)
  * define_constants:                      Constant Definitions.
                                                               (line    6)
! * define_constraint:                     Define Constraints. (line   48)
  * define_cpu_unit:                       Processor pipeline description.
                                                               (line   68)
  * define_delay:                          Delay Slots.        (line   25)
  * define_enum:                           Constant Definitions.
                                                               (line  118)
- * define_enum_attr <1>:                  Constant Definitions.
-                                                              (line  136)
  * define_enum_attr:                      Defining Attributes.
                                                               (line   83)
  * define_expand:                         Expander Definitions.
                                                               (line   11)
  * define_insn:                           Patterns.           (line    6)
  * define_insn example:                   Example.            (line    6)
  * define_insn_and_split:                 Insn Splitting.     (line  170)
  * define_insn_reservation:               Processor pipeline description.
!                                                              (line  106)
  * define_int_attr:                       Int Iterators.      (line    6)
  * define_int_iterator:                   Int Iterators.      (line    6)
! * define_memory_constraint:              Define Constraints. (line   88)
  * define_mode_attr:                      Substitutions.      (line    6)
  * define_mode_iterator:                  Defining Mode Iterators.
                                                               (line    6)
--- 47547,47595 ----
  * DECL_VIRTUAL_P:                        Function Properties.
                                                               (line   44)
  * DECL_VOLATILE_MEMFUNC_P:               Functions for C++.  (line   74)
  * decrement_and_branch_until_zero instruction pattern: Standard Names.
!                                                              (line 1327)
  * default:                               GTY Options.        (line   88)
  * default_file_start:                    File Framework.     (line    8)
! * DEFAULT_GDB_EXTENSIONS:                DBX Options.        (line   17)
! * DEFAULT_PCC_STRUCT_RETURN:             Aggregate Return.   (line   34)
! * DEFAULT_SIGNED_CHAR:                   Type Layout.        (line  123)
! * define_address_constraint:             Define Constraints. (line   99)
  * define_asm_attributes:                 Tagging Insns.      (line   73)
  * define_attr:                           Defining Attributes.
                                                               (line    6)
  * define_automaton:                      Processor pipeline description.
                                                               (line   53)
  * define_bypass:                         Processor pipeline description.
!                                                              (line  196)
  * define_code_attr:                      Code Iterators.     (line    6)
  * define_code_iterator:                  Code Iterators.     (line    6)
  * define_cond_exec:                      Conditional Execution.
                                                               (line   13)
  * define_constants:                      Constant Definitions.
                                                               (line    6)
! * define_constraint:                     Define Constraints. (line   45)
  * define_cpu_unit:                       Processor pipeline description.
                                                               (line   68)
+ * define_c_enum:                         Constant Definitions.
+                                                              (line   49)
  * define_delay:                          Delay Slots.        (line   25)
  * define_enum:                           Constant Definitions.
                                                               (line  118)
  * define_enum_attr:                      Defining Attributes.
                                                               (line   83)
+ * define_enum_attr <1>:                  Constant Definitions.
+                                                              (line  136)
  * define_expand:                         Expander Definitions.
                                                               (line   11)
  * define_insn:                           Patterns.           (line    6)
  * define_insn example:                   Example.            (line    6)
  * define_insn_and_split:                 Insn Splitting.     (line  170)
  * define_insn_reservation:               Processor pipeline description.
!                                                              (line  105)
  * define_int_attr:                       Int Iterators.      (line    6)
  * define_int_iterator:                   Int Iterators.      (line    6)
! * define_memory_constraint:              Define Constraints. (line   80)
  * define_mode_attr:                      Substitutions.      (line    6)
  * define_mode_iterator:                  Defining Mode Iterators.
                                                               (line    6)
*************** Concept Index
*** 48041,48061 ****
                                                               (line    6)
  * define_query_cpu_unit:                 Processor pipeline description.
                                                               (line   90)
! * define_register_constraint:            Define Constraints. (line   28)
  * define_reservation:                    Processor pipeline description.
!                                                              (line  186)
  * define_special_predicate:              Defining Predicates.
                                                               (line    6)
  * define_split:                          Insn Splitting.     (line   32)
! * define_subst <1>:                      Subst Iterators.    (line    6)
! * define_subst <2>:                      Define Subst Output Template.
                                                               (line    6)
! * define_subst <3>:                      Define Subst Pattern Matching.
                                                               (line    6)
! * define_subst <4>:                      Define Subst Example.
                                                               (line    6)
! * define_subst:                          Define Subst.       (line    6)
  * define_subst_attr:                     Subst Iterators.    (line    6)
  * defining attributes and their values:  Defining Attributes.
                                                               (line    6)
  * defining constraints:                  Define Constraints. (line    6)
--- 47599,47621 ----
                                                               (line    6)
  * define_query_cpu_unit:                 Processor pipeline description.
                                                               (line   90)
! * define_register_constraint:            Define Constraints. (line   26)
  * define_reservation:                    Processor pipeline description.
!                                                              (line  185)
  * define_special_predicate:              Defining Predicates.
                                                               (line    6)
  * define_split:                          Insn Splitting.     (line   32)
! * define_subst:                          Define Subst.       (line    6)
! * define_subst <1>:                      Define Subst Example.
                                                               (line    6)
! * define_subst <2>:                      Define Subst Pattern Matching.
                                                               (line    6)
! * define_subst <3>:                      Define Subst Output Template.
                                                               (line    6)
! * define_subst <4>:                      Define Subst.       (line   14)
! * define_subst <5>:                      Subst Iterators.    (line    6)
  * define_subst_attr:                     Subst Iterators.    (line    6)
+ * define_subst_attr <1>:                 Subst Iterators.    (line   26)
  * defining attributes and their values:  Defining Attributes.
                                                               (line    6)
  * defining constraints:                  Define Constraints. (line    6)
*************** Concept Index
*** 48068,48156 ****
  * defining RTL sequences for code generation: Expander Definitions.
                                                               (line    6)
  * delay slots, defining:                 Delay Slots.        (line    6)
! * deletable:                             GTY Options.        (line  131)
  * DELETE_IF_ORDINARY:                    Filesystem.         (line   79)
  * Dependent Patterns:                    Dependent Patterns. (line    6)
  * desc:                                  GTY Options.        (line   88)
  * destructors, output of:                Initialization.     (line    6)
  * deterministic finite state automaton:  Processor pipeline description.
                                                               (line    6)
  * DFmode:                                Machine Modes.      (line   76)
! * digits in constraint:                  Simple Constraints. (line  130)
  * DImode:                                Machine Modes.      (line   45)
  * DIR_SEPARATOR:                         Filesystem.         (line   18)
  * DIR_SEPARATOR_2:                       Filesystem.         (line   19)
- * directory options .md:                 Including Patterns. (line   44)
  * disabling certain registers:           Register Basics.    (line   73)
  * dispatch table:                        Dispatch Tables.    (line    8)
! * div:                                   Arithmetic.         (line  115)
! * div and attributes:                    Expressions.        (line   85)
! * division:                              Arithmetic.         (line  115)
! * divM3 instruction pattern:             Standard Names.     (line  269)
! * divmodM4 instruction pattern:          Standard Names.     (line  538)
! * DO_BODY:                               Statements for C++. (line    6)
! * DO_COND:                               Statements for C++. (line    6)
! * DO_STMT:                               Statements for C++. (line    6)
  * dollar sign:                           Multi-Alternative.  (line   56)
! * DOLLARS_IN_IDENTIFIERS:                Misc.               (line  454)
! * doloop_begin instruction pattern:      Standard Names.     (line 1356)
! * doloop_end instruction pattern:        Standard Names.     (line 1344)
  * DONE:                                  Expander Definitions.
                                                               (line   77)
  * DONT_USE_BUILTIN_SETJMP:               Exception Region Output.
!                                                              (line   79)
! * DOUBLE_TYPE_SIZE:                      Type Layout.        (line   53)
  * DQmode:                                Machine Modes.      (line  118)
  * driver:                                Driver.             (line    6)
! * DRIVER_SELF_SPECS:                     Driver.             (line    9)
  * dump examples:                         Dump examples.      (line    6)
  * dump setup:                            Dump setup.         (line    6)
  * dump types:                            Dump types.         (line    6)
  * dump verbosity:                        Dump output verbosity.
                                                               (line    6)
- * dump_basic_block:                      Dump types.         (line   30)
- * dump_generic_expr:                     Dump types.         (line   33)
- * dump_gimple_stmt:                      Dump types.         (line   36)
- * dump_printf:                           Dump types.         (line    6)
  * DUMPFILE_FORMAT:                       Filesystem.         (line   67)
! * DWARF2_ASM_LINE_DEBUG_INFO:            SDB and DWARF.      (line   50)
! * DWARF2_DEBUGGING_INFO:                 SDB and DWARF.      (line   13)
! * DWARF2_FRAME_INFO:                     SDB and DWARF.      (line   30)
! * DWARF2_FRAME_REG_OUT:                  Frame Registers.    (line  150)
  * DWARF2_UNWIND_INFO:                    Exception Region Output.
!                                                              (line   40)
! * DWARF_ALT_FRAME_RETURN_COLUMN:         Frame Layout.       (line  154)
  * DWARF_CIE_DATA_ALIGNMENT:              Exception Region Output.
!                                                              (line   91)
! * DWARF_FRAME_REGISTERS:                 Frame Registers.    (line  110)
! * DWARF_FRAME_REGNUM:                    Frame Registers.    (line  142)
  * DWARF_REG_TO_UNWIND_COLUMN:            Frame Registers.    (line  134)
! * DWARF_ZERO_REG:                        Frame Layout.       (line  165)
! * DYNAMIC_CHAIN_ADDRESS:                 Frame Layout.       (line   92)
! * E in constraint:                       Simple Constraints. (line   89)
  * earlyclobber operand:                  Modifiers.          (line   25)
  * edge:                                  Edges.              (line    6)
  * edge in the flow graph:                Edges.              (line    6)
  * edge iterators:                        Edges.              (line   15)
  * edge splitting:                        Maintaining the CFG.
!                                                              (line  107)
! * EDGE_ABNORMAL:                         Edges.              (line  128)
! * EDGE_ABNORMAL, EDGE_ABNORMAL_CALL:     Edges.              (line  172)
! * EDGE_ABNORMAL, EDGE_EH:                Edges.              (line   96)
! * EDGE_ABNORMAL, EDGE_SIBCALL:           Edges.              (line  122)
! * EDGE_FALLTHRU, force_nonfallthru:      Edges.              (line   86)
  * EDOM, implicit usage:                  Library Calls.      (line   59)
  * EH_FRAME_IN_DATA_SECTION:              Exception Region Output.
!                                                              (line   20)
  * EH_FRAME_SECTION_NAME:                 Exception Region Output.
!                                                              (line   10)
! * eh_return instruction pattern:         Standard Names.     (line 1540)
! * EH_RETURN_DATA_REGNO:                  Exception Handling. (line    7)
! * EH_RETURN_HANDLER_RTX:                 Exception Handling. (line   39)
! * EH_RETURN_STACKADJ_RTX:                Exception Handling. (line   22)
  * EH_TABLES_CAN_BE_READ_ONLY:            Exception Region Output.
!                                                              (line   29)
! * EH_USES:                               Function Entry.     (line  158)
  * ei_edge:                               Edges.              (line   43)
  * ei_end_p:                              Edges.              (line   27)
  * ei_last:                               Edges.              (line   23)
--- 47628,47720 ----
  * defining RTL sequences for code generation: Expander Definitions.
                                                               (line    6)
  * delay slots, defining:                 Delay Slots.        (line    6)
! * deletable:                             GTY Options.        (line  132)
  * DELETE_IF_ORDINARY:                    Filesystem.         (line   79)
  * Dependent Patterns:                    Dependent Patterns. (line    6)
  * desc:                                  GTY Options.        (line   88)
  * destructors, output of:                Initialization.     (line    6)
  * deterministic finite state automaton:  Processor pipeline description.
                                                               (line    6)
+ * deterministic finite state automaton <1>: Processor pipeline description.
+                                                              (line  304)
  * DFmode:                                Machine Modes.      (line   76)
! * digits in constraint:                  Simple Constraints. (line  128)
  * DImode:                                Machine Modes.      (line   45)
+ * directory options .md:                 Including Patterns. (line   47)
  * DIR_SEPARATOR:                         Filesystem.         (line   18)
  * DIR_SEPARATOR_2:                       Filesystem.         (line   19)
  * disabling certain registers:           Register Basics.    (line   73)
  * dispatch table:                        Dispatch Tables.    (line    8)
! * div:                                   Arithmetic.         (line  116)
! * div and attributes:                    Expressions.        (line   83)
! * division:                              Arithmetic.         (line  116)
! * division <1>:                          Arithmetic.         (line  130)
! * division <2>:                          Arithmetic.         (line  136)
! * divM3 instruction pattern:             Standard Names.     (line  266)
! * divmodM4 instruction pattern:          Standard Names.     (line  533)
  * dollar sign:                           Multi-Alternative.  (line   56)
! * DOLLARS_IN_IDENTIFIERS:                Misc.               (line  452)
! * doloop_begin instruction pattern:      Standard Names.     (line 1349)
! * doloop_end instruction pattern:        Standard Names.     (line 1337)
  * DONE:                                  Expander Definitions.
                                                               (line   77)
  * DONT_USE_BUILTIN_SETJMP:               Exception Region Output.
!                                                              (line   77)
! * DOUBLE_TYPE_SIZE:                      Type Layout.        (line   52)
! * DO_BODY:                               Statements for C++. (line    6)
! * DO_COND:                               Statements for C++. (line    6)
! * DO_STMT:                               Statements for C++. (line    6)
  * DQmode:                                Machine Modes.      (line  118)
  * driver:                                Driver.             (line    6)
! * DRIVER_SELF_SPECS:                     Driver.             (line    8)
  * dump examples:                         Dump examples.      (line    6)
  * dump setup:                            Dump setup.         (line    6)
  * dump types:                            Dump types.         (line    6)
  * dump verbosity:                        Dump output verbosity.
                                                               (line    6)
  * DUMPFILE_FORMAT:                       Filesystem.         (line   67)
! * dump_basic_block:                      Dump types.         (line   29)
! * dump_generic_expr:                     Dump types.         (line   31)
! * dump_gimple_stmt:                      Dump types.         (line   33)
! * dump_printf:                           Dump types.         (line    6)
! * DWARF2_ASM_LINE_DEBUG_INFO:            SDB and DWARF.      (line   49)
! * DWARF2_DEBUGGING_INFO:                 SDB and DWARF.      (line   12)
! * DWARF2_FRAME_INFO:                     SDB and DWARF.      (line   29)
! * DWARF2_FRAME_REG_OUT:                  Frame Registers.    (line  151)
  * DWARF2_UNWIND_INFO:                    Exception Region Output.
!                                                              (line   38)
! * DWARF_ALT_FRAME_RETURN_COLUMN:         Frame Layout.       (line  152)
  * DWARF_CIE_DATA_ALIGNMENT:              Exception Region Output.
!                                                              (line   89)
! * DWARF_FRAME_REGISTERS:                 Frame Registers.    (line  109)
! * DWARF_FRAME_REGNUM:                    Frame Registers.    (line  143)
  * DWARF_REG_TO_UNWIND_COLUMN:            Frame Registers.    (line  134)
! * DWARF_ZERO_REG:                        Frame Layout.       (line  163)
! * DYNAMIC_CHAIN_ADDRESS:                 Frame Layout.       (line   90)
! * E in constraint:                       Simple Constraints. (line   87)
  * earlyclobber operand:                  Modifiers.          (line   25)
  * edge:                                  Edges.              (line    6)
  * edge in the flow graph:                Edges.              (line    6)
  * edge iterators:                        Edges.              (line   15)
  * edge splitting:                        Maintaining the CFG.
!                                                              (line  105)
! * EDGE_ABNORMAL:                         Edges.              (line  127)
! * EDGE_ABNORMAL, EDGE_ABNORMAL_CALL:     Edges.              (line  171)
! * EDGE_ABNORMAL, EDGE_EH:                Edges.              (line   95)
! * EDGE_ABNORMAL, EDGE_SIBCALL:           Edges.              (line  121)
! * EDGE_FALLTHRU, force_nonfallthru:      Edges.              (line   85)
  * EDOM, implicit usage:                  Library Calls.      (line   59)
  * EH_FRAME_IN_DATA_SECTION:              Exception Region Output.
!                                                              (line   19)
  * EH_FRAME_SECTION_NAME:                 Exception Region Output.
!                                                              (line    9)
! * eh_return instruction pattern:         Standard Names.     (line 1530)
! * EH_RETURN_DATA_REGNO:                  Exception Handling. (line    6)
! * EH_RETURN_HANDLER_RTX:                 Exception Handling. (line   38)
! * EH_RETURN_STACKADJ_RTX:                Exception Handling. (line   21)
  * EH_TABLES_CAN_BE_READ_ONLY:            Exception Region Output.
!                                                              (line   28)
! * EH_USES:                               Function Entry.     (line  155)
  * ei_edge:                               Edges.              (line   43)
  * ei_end_p:                              Edges.              (line   27)
  * ei_last:                               Edges.              (line   23)
*************** Concept Index
*** 48159,48260 ****
  * ei_prev:                               Edges.              (line   39)
  * ei_safe_safe:                          Edges.              (line   47)
  * ei_start:                              Edges.              (line   19)
! * ELIMINABLE_REGS:                       Elimination.        (line   47)
  * ELSE_CLAUSE:                           Statements for C++. (line    6)
  * Embedded C:                            Fixed-point fractional library routines.
                                                               (line    6)
  * Empty Statements:                      Empty Statements.   (line    6)
  * EMPTY_CLASS_EXPR:                      Statements for C++. (line    6)
! * EMPTY_FIELD_BOUNDARY:                  Storage Layout.     (line  315)
  * Emulated TLS:                          Emulated TLS.       (line    6)
  * enabled:                               Disable Insn Alternatives.
                                                               (line    6)
! * ENDFILE_SPEC:                          Driver.             (line  156)
! * endianness:                            Portability.        (line   21)
  * ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR:       Basic Blocks.       (line   10)
! * enum reg_class:                        Register Classes.   (line   72)
  * ENUMERAL_TYPE:                         Types.              (line    6)
  * enumerations:                          Constant Definitions.
                                                               (line   49)
  * epilogue:                              Function Entry.     (line    6)
! * epilogue instruction pattern:          Standard Names.     (line 1578)
! * EPILOGUE_USES:                         Function Entry.     (line  152)
  * eq:                                    Comparisons.        (line   52)
! * eq and attributes:                     Expressions.        (line   85)
! * eq_attr:                               Expressions.        (line  106)
  * EQ_EXPR:                               Unary and Binary Expressions.
                                                               (line    6)
- * equal:                                 Comparisons.        (line   52)
  * errno, implicit usage:                 Library Calls.      (line   71)
  * EXACT_DIV_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * examining SSA_NAMEs:                   SSA.                (line  214)
  * exception handling <1>:                Exception Handling. (line    6)
! * exception handling:                    Edges.              (line   96)
! * exception_receiver instruction pattern: Standard Names.    (line 1504)
  * exclamation point:                     Multi-Alternative.  (line   47)
  * exclusion_set:                         Processor pipeline description.
!                                                              (line  224)
! * exclusive-or, bitwise:                 Arithmetic.         (line  167)
  * EXIT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * EXIT_IGNORE_STACK:                     Function Entry.     (line  140)
  * expander definitions:                  Expander Definitions.
                                                               (line    6)
! * expM2 instruction pattern:             Standard Names.     (line  645)
  * EXPR_FILENAME:                         Working with declarations.
                                                               (line   14)
  * EXPR_LINENO:                           Working with declarations.
                                                               (line   20)
! * expr_list:                             Insns.              (line  548)
  * EXPR_STMT:                             Statements for C++. (line    6)
  * EXPR_STMT_EXPR:                        Statements for C++. (line    6)
! * expression:                            Expression trees.   (line    6)
! * expression codes:                      RTL Objects.        (line   47)
! * extendMN2 instruction pattern:         Standard Names.     (line  975)
! * extensible constraints:                Simple Constraints. (line  173)
! * EXTRA_SPECS:                           Driver.             (line  183)
! * extv instruction pattern:              Standard Names.     (line 1066)
! * extvM instruction pattern:             Standard Names.     (line 1011)
! * extvmisalignM instruction pattern:     Standard Names.     (line 1021)
! * extzv instruction pattern:             Standard Names.     (line 1084)
! * extzvM instruction pattern:            Standard Names.     (line 1035)
! * extzvmisalignM instruction pattern:    Standard Names.     (line 1038)
! * F in constraint:                       Simple Constraints. (line   94)
  * FAIL:                                  Expander Definitions.
                                                               (line   83)
! * fall-thru:                             Edges.              (line   69)
  * FATAL_EXIT_CODE:                       Host Misc.          (line    6)
  * FDL, GNU Free Documentation License:   GNU Free Documentation License.
                                                               (line    6)
  * features, optional, in system conventions: Run-time Target.
                                                               (line   59)
  * ffs:                                   Arithmetic.         (line  210)
! * ffsM2 instruction pattern:             Standard Names.     (line  759)
  * FIELD_DECL:                            Declarations.       (line    6)
- * file_end_indicate_exec_stack:          File Framework.     (line   41)
  * files and passes of the compiler:      Passes.             (line    6)
  * files, generated:                      Files.              (line    6)
  * final_absence_set:                     Processor pipeline description.
!                                                              (line  224)
! * FINAL_PRESCAN_INSN:                    Instruction Output. (line   61)
  * final_presence_set:                    Processor pipeline description.
!                                                              (line  224)
! * final_sequence:                        Instruction Output. (line  145)
! * FIND_BASE_TERM:                        Addressing Modes.   (line  119)
! * FINI_ARRAY_SECTION_ASM_OP:             Sections.           (line  114)
! * FINI_SECTION_ASM_OP:                   Sections.           (line   99)
  * finite state automaton minimization:   Processor pipeline description.
!                                                              (line  305)
! * FIRST_PARM_OFFSET:                     Frame Layout.       (line   67)
  * FIRST_PARM_OFFSET and virtual registers: Regs and Memory.  (line   65)
! * FIRST_PSEUDO_REGISTER:                 Register Basics.    (line    9)
! * FIRST_STACK_REG:                       Stack Registers.    (line   27)
  * FIRST_VIRTUAL_REGISTER:                Regs and Memory.    (line   51)
  * fix:                                   Conversions.        (line   66)
- * FIX_TRUNC_EXPR:                        Unary and Binary Expressions.
-                                                              (line    6)
- * fix_truncMN2 instruction pattern:      Standard Names.     (line  962)
  * fixed register:                        Register Basics.    (line   15)
  * fixed-point fractional library:        Fixed-point fractional library routines.
                                                               (line    6)
--- 47723,47821 ----
  * ei_prev:                               Edges.              (line   39)
  * ei_safe_safe:                          Edges.              (line   47)
  * ei_start:                              Edges.              (line   19)
! * ELIMINABLE_REGS:                       Elimination.        (line   46)
  * ELSE_CLAUSE:                           Statements for C++. (line    6)
  * Embedded C:                            Fixed-point fractional library routines.
                                                               (line    6)
  * Empty Statements:                      Empty Statements.   (line    6)
  * EMPTY_CLASS_EXPR:                      Statements for C++. (line    6)
! * EMPTY_FIELD_BOUNDARY:                  Storage Layout.     (line  311)
  * Emulated TLS:                          Emulated TLS.       (line    6)
  * enabled:                               Disable Insn Alternatives.
                                                               (line    6)
! * ENDFILE_SPEC:                          Driver.             (line  155)
! * endianness:                            Portability.        (line   20)
  * ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR:       Basic Blocks.       (line   10)
! * enum reg_class:                        Register Classes.   (line   70)
  * ENUMERAL_TYPE:                         Types.              (line    6)
  * enumerations:                          Constant Definitions.
                                                               (line   49)
  * epilogue:                              Function Entry.     (line    6)
! * epilogue instruction pattern:          Standard Names.     (line 1568)
! * EPILOGUE_USES:                         Function Entry.     (line  149)
  * eq:                                    Comparisons.        (line   52)
! * eq and attributes:                     Expressions.        (line   83)
! * equal:                                 Comparisons.        (line   52)
! * eq_attr:                               Expressions.        (line  104)
  * EQ_EXPR:                               Unary and Binary Expressions.
                                                               (line    6)
  * errno, implicit usage:                 Library Calls.      (line   71)
  * EXACT_DIV_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * examining SSA_NAMEs:                   SSA.                (line  214)
+ * exception handling:                    Edges.              (line   95)
  * exception handling <1>:                Exception Handling. (line    6)
! * exception_receiver instruction pattern: Standard Names.    (line 1495)
  * exclamation point:                     Multi-Alternative.  (line   47)
  * exclusion_set:                         Processor pipeline description.
!                                                              (line  223)
! * exclusive-or, bitwise:                 Arithmetic.         (line  168)
  * EXIT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * EXIT_IGNORE_STACK:                     Function Entry.     (line  137)
  * expander definitions:                  Expander Definitions.
                                                               (line    6)
! * expM2 instruction pattern:             Standard Names.     (line  640)
! * expression:                            Expression trees.   (line    6)
! * expression codes:                      RTL Objects.        (line   47)
  * EXPR_FILENAME:                         Working with declarations.
                                                               (line   14)
  * EXPR_LINENO:                           Working with declarations.
                                                               (line   20)
! * expr_list:                             Insns.              (line  540)
  * EXPR_STMT:                             Statements for C++. (line    6)
  * EXPR_STMT_EXPR:                        Statements for C++. (line    6)
! * extendMN2 instruction pattern:         Standard Names.     (line  970)
! * extensible constraints:                Simple Constraints. (line  171)
! * EXTRA_SPECS:                           Driver.             (line  182)
! * extv instruction pattern:              Standard Names.     (line 1061)
! * extvM instruction pattern:             Standard Names.     (line 1006)
! * extvmisalignM instruction pattern:     Standard Names.     (line 1016)
! * extzv instruction pattern:             Standard Names.     (line 1079)
! * extzvM instruction pattern:            Standard Names.     (line 1030)
! * extzvmisalignM instruction pattern:    Standard Names.     (line 1033)
! * F in constraint:                       Simple Constraints. (line   92)
  * FAIL:                                  Expander Definitions.
                                                               (line   83)
! * fall-thru:                             Edges.              (line   68)
  * FATAL_EXIT_CODE:                       Host Misc.          (line    6)
  * FDL, GNU Free Documentation License:   GNU Free Documentation License.
                                                               (line    6)
  * features, optional, in system conventions: Run-time Target.
                                                               (line   59)
  * ffs:                                   Arithmetic.         (line  210)
! * ffsM2 instruction pattern:             Standard Names.     (line  754)
  * FIELD_DECL:                            Declarations.       (line    6)
  * files and passes of the compiler:      Passes.             (line    6)
  * files, generated:                      Files.              (line    6)
+ * file_end_indicate_exec_stack:          File Framework.     (line   39)
  * final_absence_set:                     Processor pipeline description.
!                                                              (line  223)
! * FINAL_PRESCAN_INSN:                    Instruction Output. (line   60)
  * final_presence_set:                    Processor pipeline description.
!                                                              (line  223)
! * final_sequence:                        Instruction Output. (line  144)
! * FIND_BASE_TERM:                        Addressing Modes.   (line  117)
  * finite state automaton minimization:   Processor pipeline description.
!                                                              (line  304)
! * FINI_ARRAY_SECTION_ASM_OP:             Sections.           (line  113)
! * FINI_SECTION_ASM_OP:                   Sections.           (line   98)
! * FIRST_PARM_OFFSET:                     Frame Layout.       (line   65)
  * FIRST_PARM_OFFSET and virtual registers: Regs and Memory.  (line   65)
! * FIRST_PSEUDO_REGISTER:                 Register Basics.    (line    8)
! * FIRST_STACK_REG:                       Stack Registers.    (line   26)
  * FIRST_VIRTUAL_REGISTER:                Regs and Memory.    (line   51)
  * fix:                                   Conversions.        (line   66)
  * fixed register:                        Register Basics.    (line   15)
  * fixed-point fractional library:        Fixed-point fractional library routines.
                                                               (line    6)
*************** Concept Index
*** 48263,48323 ****
  * FIXED_CST:                             Constant expressions.
                                                               (line    6)
  * FIXED_POINT_TYPE:                      Types.              (line    6)
! * FIXED_REGISTERS:                       Register Basics.    (line   15)
  * fixed_regs:                            Register Basics.    (line   59)
! * fixMN2 instruction pattern:            Standard Names.     (line  942)
! * fixuns_truncMN2 instruction pattern:   Standard Names.     (line  966)
! * fixunsMN2 instruction pattern:         Standard Names.     (line  951)
  * flags in RTL expression:               Flags.              (line    6)
  * float:                                 Conversions.        (line   58)
  * FLOAT_EXPR:                            Unary and Binary Expressions.
                                                               (line    6)
  * float_extend:                          Conversions.        (line   33)
! * FLOAT_LIB_COMPARE_RETURNS_BOOL:        Library Calls.      (line   33)
! * FLOAT_STORE_FLAG_VALUE:                Misc.               (line  287)
  * float_truncate:                        Conversions.        (line   53)
! * FLOAT_TYPE_SIZE:                       Type Layout.        (line   49)
! * FLOAT_WORDS_BIG_ENDIAN:                Storage Layout.     (line   42)
  * FLOAT_WORDS_BIG_ENDIAN, (lack of) effect on subreg: Regs and Memory.
!                                                              (line  226)
! * floating point and cross compilation:  Floating Point.     (line    6)
! * floatMN2 instruction pattern:          Standard Names.     (line  934)
! * floatunsMN2 instruction pattern:       Standard Names.     (line  938)
  * FLOOR_DIV_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * FLOOR_MOD_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
- * floorM2 instruction pattern:           Standard Names.     (line  680)
  * flow-insensitive alias analysis:       Alias analysis.     (line    6)
  * flow-sensitive alias analysis:         Alias analysis.     (line    6)
! * fma:                                   Arithmetic.         (line  111)
! * fmaM4 instruction pattern:             Standard Names.     (line  303)
! * fmodM3 instruction pattern:            Standard Names.     (line  598)
! * fmsM4 instruction pattern:             Standard Names.     (line  310)
! * fnmaM4 instruction pattern:            Standard Names.     (line  316)
! * fnmsM4 instruction pattern:            Standard Names.     (line  322)
  * FOR_BODY:                              Statements for C++. (line    6)
  * FOR_COND:                              Statements for C++. (line    6)
  * FOR_EXPR:                              Statements for C++. (line    6)
  * FOR_INIT_STMT:                         Statements for C++. (line    6)
  * FOR_STMT:                              Statements for C++. (line    6)
  * for_user:                              GTY Options.        (line   82)
- * FORCE_CODE_SECTION_ALIGN:              Sections.           (line  145)
- * force_reg:                             Standard Names.     (line   36)
- * fract_convert:                         Conversions.        (line   82)
- * FRACT_TYPE_SIZE:                       Type Layout.        (line   68)
  * fractional types:                      Fixed-point fractional library routines.
                                                               (line    6)
! * fractMN2 instruction pattern:          Standard Names.     (line  984)
! * fractunsMN2 instruction pattern:       Standard Names.     (line  999)
  * frame layout:                          Frame Layout.       (line    6)
! * FRAME_ADDR_RTX:                        Frame Layout.       (line  116)
! * FRAME_GROWS_DOWNWARD:                  Frame Layout.       (line   31)
  * FRAME_GROWS_DOWNWARD and virtual registers: Regs and Memory.
                                                               (line   69)
! * FRAME_POINTER_CFA_OFFSET:              Frame Layout.       (line  214)
  * frame_pointer_needed:                  Function Entry.     (line   34)
! * FRAME_POINTER_REGNUM:                  Frame Registers.    (line   14)
  * FRAME_POINTER_REGNUM and virtual registers: Regs and Memory.
                                                               (line   74)
  * frame_pointer_rtx:                     Frame Registers.    (line  104)
--- 47824,47887 ----
  * FIXED_CST:                             Constant expressions.
                                                               (line    6)
  * FIXED_POINT_TYPE:                      Types.              (line    6)
! * FIXED_REGISTERS:                       Register Basics.    (line   14)
  * fixed_regs:                            Register Basics.    (line   59)
! * fixMN2 instruction pattern:            Standard Names.     (line  937)
! * fixunsMN2 instruction pattern:         Standard Names.     (line  946)
! * fixuns_truncMN2 instruction pattern:   Standard Names.     (line  961)
! * fix_truncMN2 instruction pattern:      Standard Names.     (line  957)
! * FIX_TRUNC_EXPR:                        Unary and Binary Expressions.
!                                                              (line    6)
  * flags in RTL expression:               Flags.              (line    6)
  * float:                                 Conversions.        (line   58)
+ * floating point and cross compilation:  Floating Point.     (line    6)
+ * floatMN2 instruction pattern:          Standard Names.     (line  929)
+ * floatunsMN2 instruction pattern:       Standard Names.     (line  933)
  * FLOAT_EXPR:                            Unary and Binary Expressions.
                                                               (line    6)
  * float_extend:                          Conversions.        (line   33)
! * FLOAT_LIB_COMPARE_RETURNS_BOOL:        Library Calls.      (line   32)
! * FLOAT_STORE_FLAG_VALUE:                Misc.               (line  286)
  * float_truncate:                        Conversions.        (line   53)
! * FLOAT_TYPE_SIZE:                       Type Layout.        (line   48)
! * FLOAT_WORDS_BIG_ENDIAN:                Storage Layout.     (line   41)
  * FLOAT_WORDS_BIG_ENDIAN, (lack of) effect on subreg: Regs and Memory.
!                                                              (line  224)
! * floorM2 instruction pattern:           Standard Names.     (line  675)
  * FLOOR_DIV_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * FLOOR_MOD_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * flow-insensitive alias analysis:       Alias analysis.     (line    6)
  * flow-sensitive alias analysis:         Alias analysis.     (line    6)
! * fma:                                   Arithmetic.         (line  112)
! * fmaM4 instruction pattern:             Standard Names.     (line  300)
! * fmodM3 instruction pattern:            Standard Names.     (line  593)
! * fmsM4 instruction pattern:             Standard Names.     (line  307)
! * fnmaM4 instruction pattern:            Standard Names.     (line  313)
! * fnmsM4 instruction pattern:            Standard Names.     (line  319)
! * FORCE_CODE_SECTION_ALIGN:              Sections.           (line  144)
! * force_reg:                             Standard Names.     (line   36)
  * FOR_BODY:                              Statements for C++. (line    6)
  * FOR_COND:                              Statements for C++. (line    6)
  * FOR_EXPR:                              Statements for C++. (line    6)
  * FOR_INIT_STMT:                         Statements for C++. (line    6)
  * FOR_STMT:                              Statements for C++. (line    6)
  * for_user:                              GTY Options.        (line   82)
  * fractional types:                      Fixed-point fractional library routines.
                                                               (line    6)
! * fractMN2 instruction pattern:          Standard Names.     (line  979)
! * fractunsMN2 instruction pattern:       Standard Names.     (line  994)
! * fract_convert:                         Conversions.        (line   82)
! * FRACT_TYPE_SIZE:                       Type Layout.        (line   67)
  * frame layout:                          Frame Layout.       (line    6)
! * FRAME_ADDR_RTX:                        Frame Layout.       (line  114)
! * FRAME_GROWS_DOWNWARD:                  Frame Layout.       (line   30)
  * FRAME_GROWS_DOWNWARD and virtual registers: Regs and Memory.
                                                               (line   69)
! * FRAME_POINTER_CFA_OFFSET:              Frame Layout.       (line  212)
  * frame_pointer_needed:                  Function Entry.     (line   34)
! * FRAME_POINTER_REGNUM:                  Frame Registers.    (line   13)
  * FRAME_POINTER_REGNUM and virtual registers: Regs and Memory.
                                                               (line   74)
  * frame_pointer_rtx:                     Frame Registers.    (line  104)
*************** Concept Index
*** 48329,48359 ****
  * frame_related, in symbol_ref:          Flags.              (line  165)
  * frequency, count, BB_FREQ_BASE:        Profile information.
                                                               (line   30)
! * ftruncM2 instruction pattern:          Standard Names.     (line  957)
! * function <1>:                          Functions for C++.  (line    6)
  * function:                              Functions.          (line    6)
  * function call conventions:             Interface.          (line    6)
  * function entry and exit:               Function Entry.     (line    6)
  * function entry point, alternate function entry point: Edges.
!                                                              (line  181)
  * function properties:                   Function Properties.
                                                               (line    6)
  * function-call insns:                   Calls.              (line    6)
! * FUNCTION_ARG_OFFSET:                   Register Arguments. (line  212)
! * FUNCTION_ARG_PADDING:                  Register Arguments. (line  219)
! * FUNCTION_ARG_REGNO_P:                  Register Arguments. (line  267)
! * FUNCTION_BOUNDARY:                     Storage Layout.     (line  161)
! * FUNCTION_DECL <1>:                     Functions for C++.  (line    6)
  * FUNCTION_DECL:                         Functions.          (line    6)
! * FUNCTION_MODE:                         Misc.               (line  342)
! * FUNCTION_PROFILER:                     Profiling.          (line    9)
  * FUNCTION_TYPE:                         Types.              (line    6)
  * FUNCTION_VALUE:                        Scalar Return.      (line   52)
  * FUNCTION_VALUE_REGNO_P:                Scalar Return.      (line   78)
- * functions, leaf:                       Leaf Functions.     (line    6)
  * fundamental type:                      Types.              (line    6)
! * g in constraint:                       Simple Constraints. (line  120)
! * G in constraint:                       Simple Constraints. (line   98)
  * garbage collector, invocation:         Invoking the garbage collector.
                                                               (line    6)
  * garbage collector, troubleshooting:    Troubleshooting.    (line    6)
--- 47893,47923 ----
  * frame_related, in symbol_ref:          Flags.              (line  165)
  * frequency, count, BB_FREQ_BASE:        Profile information.
                                                               (line   30)
! * ftruncM2 instruction pattern:          Standard Names.     (line  952)
  * function:                              Functions.          (line    6)
+ * function <1>:                          Functions for C++.  (line    6)
  * function call conventions:             Interface.          (line    6)
  * function entry and exit:               Function Entry.     (line    6)
  * function entry point, alternate function entry point: Edges.
!                                                              (line  180)
  * function properties:                   Function Properties.
                                                               (line    6)
  * function-call insns:                   Calls.              (line    6)
! * functions, leaf:                       Leaf Functions.     (line    6)
! * FUNCTION_ARG_OFFSET:                   Register Arguments. (line  210)
! * FUNCTION_ARG_PADDING:                  Register Arguments. (line  217)
! * FUNCTION_ARG_REGNO_P:                  Register Arguments. (line  265)
! * FUNCTION_BOUNDARY:                     Storage Layout.     (line  159)
  * FUNCTION_DECL:                         Functions.          (line    6)
! * FUNCTION_DECL <1>:                     Functions for C++.  (line    6)
! * FUNCTION_MODE:                         Misc.               (line  341)
! * FUNCTION_PROFILER:                     Profiling.          (line    8)
  * FUNCTION_TYPE:                         Types.              (line    6)
  * FUNCTION_VALUE:                        Scalar Return.      (line   52)
  * FUNCTION_VALUE_REGNO_P:                Scalar Return.      (line   78)
  * fundamental type:                      Types.              (line    6)
! * G in constraint:                       Simple Constraints. (line   96)
! * g in constraint:                       Simple Constraints. (line  118)
  * garbage collector, invocation:         Invoking the garbage collector.
                                                               (line    6)
  * garbage collector, troubleshooting:    Troubleshooting.    (line    6)
*************** Concept Index
*** 48362,48416 ****
  * gcov_type:                             Profile information.
                                                               (line   41)
  * ge:                                    Comparisons.        (line   72)
! * ge and attributes:                     Expressions.        (line   85)
! * GE_EXPR:                               Unary and Binary Expressions.
!                                                              (line    6)
! * GEN_ERRNO_RTX:                         Library Calls.      (line   72)
  * gencodes:                              RTL passes.         (line   18)
  * general_operand:                       Machine-Independent Predicates.
!                                                              (line  105)
! * GENERAL_REGS:                          Register Classes.   (line   23)
  * generated files:                       Files.              (line    6)
  * generating assembler output:           Output Statement.   (line    6)
  * generating insns:                      RTL Template.       (line    6)
- * GENERIC <1>:                           GENERIC.            (line    6)
  * GENERIC:                               Parsing pass.       (line    6)
  * generic predicates:                    Machine-Independent Predicates.
                                                               (line    6)
  * genflags:                              RTL passes.         (line   18)
! * get_attr:                              Expressions.        (line  101)
  * get_attr_length:                       Insn Lengths.       (line   52)
! * GET_CLASS_NARROWEST_MODE:              Machine Modes.      (line  345)
  * GET_CODE:                              RTL Objects.        (line   47)
  * get_frame_size:                        Elimination.        (line   34)
  * get_insns:                             Insns.              (line   34)
  * get_last_insn:                         Insns.              (line   34)
! * GET_MODE:                              Machine Modes.      (line  292)
! * GET_MODE_ALIGNMENT:                    Machine Modes.      (line  332)
! * GET_MODE_BITSIZE:                      Machine Modes.      (line  316)
! * GET_MODE_CLASS:                        Machine Modes.      (line  306)
! * GET_MODE_FBIT:                         Machine Modes.      (line  323)
! * GET_MODE_IBIT:                         Machine Modes.      (line  319)
! * GET_MODE_MASK:                         Machine Modes.      (line  327)
! * GET_MODE_NAME:                         Machine Modes.      (line  303)
! * GET_MODE_NUNITS:                       Machine Modes.      (line  341)
! * GET_MODE_SIZE:                         Machine Modes.      (line  313)
! * GET_MODE_UNIT_SIZE:                    Machine Modes.      (line  335)
! * GET_MODE_WIDER_MODE:                   Machine Modes.      (line  309)
  * GET_RTX_CLASS:                         RTL Classes.        (line    6)
  * GET_RTX_FORMAT:                        RTL Classes.        (line  131)
  * GET_RTX_LENGTH:                        RTL Classes.        (line  128)
  * get_thread_pointerMODE instruction pattern: Standard Names.
!                                                              (line 1915)
  * geu:                                   Comparisons.        (line   72)
! * geu and attributes:                    Expressions.        (line   85)
  * GGC:                                   Type Information.   (line    6)
  * ggc_collect:                           Invoking the garbage collector.
                                                               (line    6)
! * GIMPLE <1>:                            GIMPLE.             (line    6)
! * GIMPLE <2>:                            Gimplification pass.
                                                               (line    6)
! * GIMPLE:                                Parsing pass.       (line   14)
  * GIMPLE API:                            GIMPLE API.         (line    6)
  * GIMPLE class hierarchy:                Class hierarchy of GIMPLE statements.
                                                               (line    6)
--- 47926,47980 ----
  * gcov_type:                             Profile information.
                                                               (line   41)
  * ge:                                    Comparisons.        (line   72)
! * ge and attributes:                     Expressions.        (line   83)
  * gencodes:                              RTL passes.         (line   18)
  * general_operand:                       Machine-Independent Predicates.
!                                                              (line  104)
! * GENERAL_REGS:                          Register Classes.   (line   22)
  * generated files:                       Files.              (line    6)
  * generating assembler output:           Output Statement.   (line    6)
  * generating insns:                      RTL Template.       (line    6)
  * GENERIC:                               Parsing pass.       (line    6)
+ * GENERIC <1>:                           GENERIC.            (line    6)
  * generic predicates:                    Machine-Independent Predicates.
                                                               (line    6)
  * genflags:                              RTL passes.         (line   18)
! * GEN_ERRNO_RTX:                         Library Calls.      (line   71)
! * get_attr:                              Expressions.        (line   99)
  * get_attr_length:                       Insn Lengths.       (line   52)
! * GET_CLASS_NARROWEST_MODE:              Machine Modes.      (line  344)
  * GET_CODE:                              RTL Objects.        (line   47)
  * get_frame_size:                        Elimination.        (line   34)
  * get_insns:                             Insns.              (line   34)
  * get_last_insn:                         Insns.              (line   34)
! * GET_MODE:                              Machine Modes.      (line  291)
! * GET_MODE_ALIGNMENT:                    Machine Modes.      (line  331)
! * GET_MODE_BITSIZE:                      Machine Modes.      (line  315)
! * GET_MODE_CLASS:                        Machine Modes.      (line  305)
! * GET_MODE_FBIT:                         Machine Modes.      (line  322)
! * GET_MODE_IBIT:                         Machine Modes.      (line  318)
! * GET_MODE_MASK:                         Machine Modes.      (line  326)
! * GET_MODE_NAME:                         Machine Modes.      (line  302)
! * GET_MODE_NUNITS:                       Machine Modes.      (line  340)
! * GET_MODE_SIZE:                         Machine Modes.      (line  312)
! * GET_MODE_UNIT_SIZE:                    Machine Modes.      (line  334)
! * GET_MODE_WIDER_MODE:                   Machine Modes.      (line  308)
  * GET_RTX_CLASS:                         RTL Classes.        (line    6)
  * GET_RTX_FORMAT:                        RTL Classes.        (line  131)
  * GET_RTX_LENGTH:                        RTL Classes.        (line  128)
  * get_thread_pointerMODE instruction pattern: Standard Names.
!                                                              (line 1905)
  * geu:                                   Comparisons.        (line   72)
! * geu and attributes:                    Expressions.        (line   83)
! * GE_EXPR:                               Unary and Binary Expressions.
!                                                              (line    6)
  * GGC:                                   Type Information.   (line    6)
  * ggc_collect:                           Invoking the garbage collector.
                                                               (line    6)
! * GIMPLE:                                Parsing pass.       (line   13)
! * GIMPLE <1>:                            Gimplification pass.
                                                               (line    6)
! * GIMPLE <2>:                            GIMPLE.             (line    6)
  * GIMPLE API:                            GIMPLE API.         (line    6)
  * GIMPLE class hierarchy:                Class hierarchy of GIMPLE statements.
                                                               (line    6)
*************** Concept Index
*** 48419,48927 ****
  * GIMPLE instruction set:                GIMPLE instruction set.
                                                               (line    6)
  * GIMPLE sequences:                      GIMPLE sequences.   (line    6)
- * GIMPLE statement iterators <1>:        Maintaining the CFG.
-                                                              (line   34)
  * GIMPLE statement iterators:            Basic Blocks.       (line   78)
  * gimple_addresses_taken:                Manipulating GIMPLE statements.
!                                                              (line   90)
  * GIMPLE_ASM:                            GIMPLE_ASM.         (line    6)
! * gimple_asm_clobber_op:                 GIMPLE_ASM.         (line   41)
! * gimple_asm_input_op:                   GIMPLE_ASM.         (line   25)
! * gimple_asm_nclobbers:                  GIMPLE_ASM.         (line   21)
! * gimple_asm_ninputs:                    GIMPLE_ASM.         (line   15)
! * gimple_asm_noutputs:                   GIMPLE_ASM.         (line   18)
! * gimple_asm_output_op:                  GIMPLE_ASM.         (line   33)
! * gimple_asm_set_clobber_op:             GIMPLE_ASM.         (line   45)
! * gimple_asm_set_input_op:               GIMPLE_ASM.         (line   29)
! * gimple_asm_set_output_op:              GIMPLE_ASM.         (line   37)
! * gimple_asm_set_volatile:               GIMPLE_ASM.         (line   56)
! * gimple_asm_string:                     GIMPLE_ASM.         (line   48)
! * gimple_asm_volatile_p:                 GIMPLE_ASM.         (line   52)
  * GIMPLE_ASSIGN:                         GIMPLE_ASSIGN.      (line    6)
! * gimple_assign_cast_p <1>:              GIMPLE_ASSIGN.      (line  105)
! * gimple_assign_cast_p:                  Logical Operators.  (line  160)
! * gimple_assign_lhs:                     GIMPLE_ASSIGN.      (line   63)
! * gimple_assign_lhs_ptr:                 GIMPLE_ASSIGN.      (line   66)
! * gimple_assign_rhs1:                    GIMPLE_ASSIGN.      (line   69)
! * gimple_assign_rhs1_ptr:                GIMPLE_ASSIGN.      (line   72)
! * gimple_assign_rhs2:                    GIMPLE_ASSIGN.      (line   76)
! * gimple_assign_rhs2_ptr:                GIMPLE_ASSIGN.      (line   79)
! * gimple_assign_rhs3:                    GIMPLE_ASSIGN.      (line   83)
! * gimple_assign_rhs3_ptr:                GIMPLE_ASSIGN.      (line   86)
! * gimple_assign_rhs_class:               GIMPLE_ASSIGN.      (line   58)
! * gimple_assign_rhs_code:                GIMPLE_ASSIGN.      (line   53)
! * gimple_assign_set_lhs:                 GIMPLE_ASSIGN.      (line   90)
! * gimple_assign_set_rhs1:                GIMPLE_ASSIGN.      (line   93)
! * gimple_assign_set_rhs2:                GIMPLE_ASSIGN.      (line   97)
! * gimple_assign_set_rhs3:                GIMPLE_ASSIGN.      (line  101)
  * gimple_bb:                             Manipulating GIMPLE statements.
!                                                              (line   18)
  * GIMPLE_BIND:                           GIMPLE_BIND.        (line    6)
! * gimple_bind_add_seq:                   GIMPLE_BIND.        (line   36)
! * gimple_bind_add_stmt:                  GIMPLE_BIND.        (line   32)
! * gimple_bind_append_vars:               GIMPLE_BIND.        (line   19)
! * gimple_bind_block:                     GIMPLE_BIND.        (line   40)
! * gimple_bind_body:                      GIMPLE_BIND.        (line   23)
! * gimple_bind_set_block:                 GIMPLE_BIND.        (line   45)
! * gimple_bind_set_body:                  GIMPLE_BIND.        (line   28)
! * gimple_bind_set_vars:                  GIMPLE_BIND.        (line   15)
! * gimple_bind_vars:                      GIMPLE_BIND.        (line   12)
  * gimple_block:                          Manipulating GIMPLE statements.
!                                                              (line   21)
! * gimple_build:                          GIMPLE API.         (line   36)
! * gimple_build_nop:                      GIMPLE_NOP.         (line    7)
! * gimple_build_omp_master:               GIMPLE_OMP_MASTER.  (line    7)
! * gimple_build_omp_ordered:              GIMPLE_OMP_ORDERED. (line    7)
! * gimple_build_omp_return:               GIMPLE_OMP_RETURN.  (line    7)
! * gimple_build_omp_section:              GIMPLE_OMP_SECTION. (line    7)
  * gimple_build_omp_sections_switch:      GIMPLE_OMP_SECTIONS.
!                                                              (line   14)
  * gimple_build_wce:                      GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line    7)
  * GIMPLE_CALL:                           GIMPLE_CALL.        (line    6)
! * gimple_call_arg:                       GIMPLE_CALL.        (line   66)
! * gimple_call_arg_ptr:                   GIMPLE_CALL.        (line   71)
! * gimple_call_chain:                     GIMPLE_CALL.        (line   57)
! * gimple_call_copy_skip_args:            GIMPLE_CALL.        (line   92)
! * gimple_call_fn:                        GIMPLE_CALL.        (line   38)
! * gimple_call_fndecl:                    GIMPLE_CALL.        (line   46)
! * gimple_call_lhs:                       GIMPLE_CALL.        (line   29)
! * gimple_call_lhs_ptr:                   GIMPLE_CALL.        (line   32)
! * gimple_call_noreturn_p:                GIMPLE_CALL.        (line   88)
! * gimple_call_num_args:                  GIMPLE_CALL.        (line   63)
! * gimple_call_return_type:               GIMPLE_CALL.        (line   54)
! * gimple_call_set_arg:                   GIMPLE_CALL.        (line   76)
! * gimple_call_set_chain:                 GIMPLE_CALL.        (line   60)
! * gimple_call_set_fn:                    GIMPLE_CALL.        (line   42)
! * gimple_call_set_fndecl:                GIMPLE_CALL.        (line   51)
! * gimple_call_set_lhs:                   GIMPLE_CALL.        (line   35)
! * gimple_call_set_tail:                  GIMPLE_CALL.        (line   80)
! * gimple_call_tail_p:                    GIMPLE_CALL.        (line   85)
  * GIMPLE_CATCH:                          GIMPLE_CATCH.       (line    6)
! * gimple_catch_handler:                  GIMPLE_CATCH.       (line   20)
! * gimple_catch_set_handler:              GIMPLE_CATCH.       (line   28)
! * gimple_catch_set_types:                GIMPLE_CATCH.       (line   24)
! * gimple_catch_types:                    GIMPLE_CATCH.       (line   13)
! * gimple_catch_types_ptr:                GIMPLE_CATCH.       (line   16)
  * gimple_code:                           Manipulating GIMPLE statements.
!                                                              (line   15)
  * GIMPLE_COND:                           GIMPLE_COND.        (line    6)
! * gimple_cond_code:                      GIMPLE_COND.        (line   21)
! * gimple_cond_false_label:               GIMPLE_COND.        (line   60)
! * gimple_cond_lhs:                       GIMPLE_COND.        (line   30)
! * gimple_cond_make_false:                GIMPLE_COND.        (line   64)
! * gimple_cond_make_true:                 GIMPLE_COND.        (line   67)
! * gimple_cond_rhs:                       GIMPLE_COND.        (line   38)
! * gimple_cond_set_code:                  GIMPLE_COND.        (line   26)
! * gimple_cond_set_false_label:           GIMPLE_COND.        (line   56)
! * gimple_cond_set_lhs:                   GIMPLE_COND.        (line   34)
! * gimple_cond_set_rhs:                   GIMPLE_COND.        (line   42)
! * gimple_cond_set_true_label:            GIMPLE_COND.        (line   51)
! * gimple_cond_true_label:                GIMPLE_COND.        (line   46)
! * gimple_convert:                        GIMPLE API.         (line   49)
  * gimple_copy:                           Manipulating GIMPLE statements.
!                                                              (line  147)
  * GIMPLE_DEBUG:                          GIMPLE_DEBUG.       (line    6)
  * GIMPLE_DEBUG_BIND:                     GIMPLE_DEBUG.       (line    6)
! * gimple_debug_bind_get_value:           GIMPLE_DEBUG.       (line   48)
! * gimple_debug_bind_get_value_ptr:       GIMPLE_DEBUG.       (line   53)
! * gimple_debug_bind_get_var:             GIMPLE_DEBUG.       (line   45)
! * gimple_debug_bind_has_value_p:         GIMPLE_DEBUG.       (line   70)
! * gimple_debug_bind_p:                   Logical Operators.  (line  164)
! * gimple_debug_bind_reset_value:         GIMPLE_DEBUG.       (line   66)
! * gimple_debug_bind_set_value:           GIMPLE_DEBUG.       (line   62)
! * gimple_debug_bind_set_var:             GIMPLE_DEBUG.       (line   58)
  * gimple_def_ops:                        Manipulating GIMPLE statements.
!                                                              (line   94)
  * GIMPLE_EH_FILTER:                      GIMPLE_EH_FILTER.   (line    6)
! * gimple_eh_filter_failure:              GIMPLE_EH_FILTER.   (line   19)
! * gimple_eh_filter_set_failure:          GIMPLE_EH_FILTER.   (line   29)
! * gimple_eh_filter_set_types:            GIMPLE_EH_FILTER.   (line   24)
! * gimple_eh_filter_types:                GIMPLE_EH_FILTER.   (line   12)
! * gimple_eh_filter_types_ptr:            GIMPLE_EH_FILTER.   (line   15)
! * gimple_eh_must_not_throw_fndecl:       GIMPLE_EH_FILTER.   (line   34)
! * gimple_eh_must_not_throw_set_fndecl:   GIMPLE_EH_FILTER.   (line   38)
  * gimple_expr_code:                      Manipulating GIMPLE statements.
!                                                              (line   31)
  * gimple_expr_type:                      Manipulating GIMPLE statements.
!                                                              (line   24)
  * GIMPLE_GOTO:                           GIMPLE_GOTO.        (line    6)
! * gimple_goto_dest:                      GIMPLE_GOTO.        (line   10)
! * gimple_goto_set_dest:                  GIMPLE_GOTO.        (line   13)
  * gimple_has_mem_ops:                    Manipulating GIMPLE statements.
!                                                              (line   72)
  * gimple_has_ops:                        Manipulating GIMPLE statements.
!                                                              (line   69)
  * gimple_has_volatile_ops:               Manipulating GIMPLE statements.
!                                                              (line  134)
  * GIMPLE_LABEL:                          GIMPLE_LABEL.       (line    6)
! * gimple_label_label:                    GIMPLE_LABEL.       (line   11)
! * gimple_label_set_label:                GIMPLE_LABEL.       (line   14)
  * gimple_loaded_syms:                    Manipulating GIMPLE statements.
!                                                              (line  122)
  * gimple_locus:                          Manipulating GIMPLE statements.
!                                                              (line   42)
  * gimple_locus_empty_p:                  Manipulating GIMPLE statements.
!                                                              (line   48)
  * gimple_modified_p:                     Manipulating GIMPLE statements.
!                                                              (line  130)
! * gimple_no_warning_p:                   Manipulating GIMPLE statements.
!                                                              (line   51)
  * GIMPLE_NOP:                            GIMPLE_NOP.         (line    6)
! * gimple_nop_p:                          GIMPLE_NOP.         (line   10)
  * gimple_num_ops <1>:                    Manipulating GIMPLE statements.
!                                                              (line   75)
! * gimple_num_ops:                        Logical Operators.  (line   78)
  * GIMPLE_OMP_ATOMIC_LOAD:                GIMPLE_OMP_ATOMIC_LOAD.
                                                               (line    6)
  * gimple_omp_atomic_load_lhs:            GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line   18)
  * gimple_omp_atomic_load_rhs:            GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line   26)
  * gimple_omp_atomic_load_set_lhs:        GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line   14)
  * gimple_omp_atomic_load_set_rhs:        GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line   22)
  * GIMPLE_OMP_ATOMIC_STORE:               GIMPLE_OMP_ATOMIC_STORE.
                                                               (line    6)
  * gimple_omp_atomic_store_set_val:       GIMPLE_OMP_ATOMIC_STORE.
!                                                              (line   13)
  * gimple_omp_atomic_store_val:           GIMPLE_OMP_ATOMIC_STORE.
!                                                              (line   17)
  * gimple_omp_body:                       GIMPLE_OMP_PARALLEL.
!                                                              (line   24)
  * GIMPLE_OMP_CONTINUE:                   GIMPLE_OMP_CONTINUE.
                                                               (line    6)
  * gimple_omp_continue_control_def:       GIMPLE_OMP_CONTINUE.
!                                                              (line   14)
  * gimple_omp_continue_control_def_ptr:   GIMPLE_OMP_CONTINUE.
!                                                              (line   19)
  * gimple_omp_continue_control_use:       GIMPLE_OMP_CONTINUE.
!                                                              (line   28)
  * gimple_omp_continue_control_use_ptr:   GIMPLE_OMP_CONTINUE.
!                                                              (line   33)
  * gimple_omp_continue_set_control_def:   GIMPLE_OMP_CONTINUE.
!                                                              (line   23)
  * gimple_omp_continue_set_control_use:   GIMPLE_OMP_CONTINUE.
!                                                              (line   37)
  * GIMPLE_OMP_CRITICAL:                   GIMPLE_OMP_CRITICAL.
                                                               (line    6)
  * gimple_omp_critical_name:              GIMPLE_OMP_CRITICAL.
!                                                              (line   14)
  * gimple_omp_critical_name_ptr:          GIMPLE_OMP_CRITICAL.
!                                                              (line   18)
  * gimple_omp_critical_set_name:          GIMPLE_OMP_CRITICAL.
!                                                              (line   23)
  * GIMPLE_OMP_FOR:                        GIMPLE_OMP_FOR.     (line    6)
! * gimple_omp_for_clauses:                GIMPLE_OMP_FOR.     (line   18)
! * gimple_omp_for_clauses_ptr:            GIMPLE_OMP_FOR.     (line   21)
! * gimple_omp_for_cond:                   GIMPLE_OMP_FOR.     (line   81)
! * gimple_omp_for_final:                  GIMPLE_OMP_FOR.     (line   49)
! * gimple_omp_for_final_ptr:              GIMPLE_OMP_FOR.     (line   52)
! * gimple_omp_for_incr:                   GIMPLE_OMP_FOR.     (line   59)
! * gimple_omp_for_incr_ptr:               GIMPLE_OMP_FOR.     (line   62)
! * gimple_omp_for_index:                  GIMPLE_OMP_FOR.     (line   29)
! * gimple_omp_for_index_ptr:              GIMPLE_OMP_FOR.     (line   32)
! * gimple_omp_for_initial:                GIMPLE_OMP_FOR.     (line   39)
! * gimple_omp_for_initial_ptr:            GIMPLE_OMP_FOR.     (line   42)
! * gimple_omp_for_pre_body:               GIMPLE_OMP_FOR.     (line   68)
! * gimple_omp_for_set_clauses:            GIMPLE_OMP_FOR.     (line   25)
! * gimple_omp_for_set_cond:               GIMPLE_OMP_FOR.     (line   78)
! * gimple_omp_for_set_final:              GIMPLE_OMP_FOR.     (line   56)
! * gimple_omp_for_set_incr:               GIMPLE_OMP_FOR.     (line   65)
! * gimple_omp_for_set_index:              GIMPLE_OMP_FOR.     (line   36)
! * gimple_omp_for_set_initial:            GIMPLE_OMP_FOR.     (line   46)
! * gimple_omp_for_set_pre_body:           GIMPLE_OMP_FOR.     (line   73)
  * GIMPLE_OMP_MASTER:                     GIMPLE_OMP_MASTER.  (line    6)
  * GIMPLE_OMP_ORDERED:                    GIMPLE_OMP_ORDERED. (line    6)
  * GIMPLE_OMP_PARALLEL:                   GIMPLE_OMP_PARALLEL.
                                                               (line    6)
  * gimple_omp_parallel_child_fn:          GIMPLE_OMP_PARALLEL.
!                                                              (line   44)
  * gimple_omp_parallel_child_fn_ptr:      GIMPLE_OMP_PARALLEL.
!                                                              (line   49)
  * gimple_omp_parallel_clauses:           GIMPLE_OMP_PARALLEL.
!                                                              (line   31)
  * gimple_omp_parallel_clauses_ptr:       GIMPLE_OMP_PARALLEL.
!                                                              (line   35)
  * gimple_omp_parallel_combined_p:        GIMPLE_OMP_PARALLEL.
!                                                              (line   16)
  * gimple_omp_parallel_data_arg:          GIMPLE_OMP_PARALLEL.
!                                                              (line   58)
  * gimple_omp_parallel_data_arg_ptr:      GIMPLE_OMP_PARALLEL.
!                                                              (line   63)
  * gimple_omp_parallel_set_child_fn:      GIMPLE_OMP_PARALLEL.
!                                                              (line   54)
  * gimple_omp_parallel_set_clauses:       GIMPLE_OMP_PARALLEL.
!                                                              (line   39)
  * gimple_omp_parallel_set_combined_p:    GIMPLE_OMP_PARALLEL.
!                                                              (line   20)
  * gimple_omp_parallel_set_data_arg:      GIMPLE_OMP_PARALLEL.
!                                                              (line   67)
  * GIMPLE_OMP_RETURN:                     GIMPLE_OMP_RETURN.  (line    6)
! * gimple_omp_return_nowait_p:            GIMPLE_OMP_RETURN.  (line   14)
! * gimple_omp_return_set_nowait:          GIMPLE_OMP_RETURN.  (line   11)
  * GIMPLE_OMP_SECTION:                    GIMPLE_OMP_SECTION. (line    6)
- * gimple_omp_section_last_p:             GIMPLE_OMP_SECTION. (line   12)
- * gimple_omp_section_set_last:           GIMPLE_OMP_SECTION. (line   16)
  * GIMPLE_OMP_SECTIONS:                   GIMPLE_OMP_SECTIONS.
                                                               (line    6)
  * gimple_omp_sections_clauses:           GIMPLE_OMP_SECTIONS.
!                                                              (line   30)
  * gimple_omp_sections_clauses_ptr:       GIMPLE_OMP_SECTIONS.
!                                                              (line   33)
  * gimple_omp_sections_control:           GIMPLE_OMP_SECTIONS.
!                                                              (line   17)
  * gimple_omp_sections_control_ptr:       GIMPLE_OMP_SECTIONS.
!                                                              (line   21)
  * gimple_omp_sections_set_clauses:       GIMPLE_OMP_SECTIONS.
!                                                              (line   37)
  * gimple_omp_sections_set_control:       GIMPLE_OMP_SECTIONS.
!                                                              (line   26)
  * gimple_omp_set_body:                   GIMPLE_OMP_PARALLEL.
!                                                              (line   28)
  * GIMPLE_OMP_SINGLE:                     GIMPLE_OMP_SINGLE.  (line    6)
! * gimple_omp_single_clauses:             GIMPLE_OMP_SINGLE.  (line   14)
! * gimple_omp_single_clauses_ptr:         GIMPLE_OMP_SINGLE.  (line   17)
! * gimple_omp_single_set_clauses:         GIMPLE_OMP_SINGLE.  (line   21)
  * gimple_op <1>:                         Manipulating GIMPLE statements.
!                                                              (line   81)
! * gimple_op:                             Logical Operators.  (line   81)
! * gimple_op_ptr:                         Manipulating GIMPLE statements.
!                                                              (line   84)
  * gimple_ops <1>:                        Manipulating GIMPLE statements.
!                                                              (line   78)
! * gimple_ops:                            Logical Operators.  (line   84)
  * GIMPLE_PHI:                            GIMPLE_PHI.         (line    6)
! * gimple_phi_arg <1>:                    SSA.                (line   63)
! * gimple_phi_arg:                        GIMPLE_PHI.         (line   25)
! * gimple_phi_arg_def:                    SSA.                (line   69)
! * gimple_phi_arg_edge:                   SSA.                (line   66)
! * gimple_phi_capacity:                   GIMPLE_PHI.         (line    7)
! * gimple_phi_num_args <1>:               SSA.                (line   59)
! * gimple_phi_num_args:                   GIMPLE_PHI.         (line   11)
! * gimple_phi_result <1>:                 SSA.                (line   56)
! * gimple_phi_result:                     GIMPLE_PHI.         (line   16)
! * gimple_phi_result_ptr:                 GIMPLE_PHI.         (line   19)
! * gimple_phi_set_arg:                    GIMPLE_PHI.         (line   30)
! * gimple_phi_set_result:                 GIMPLE_PHI.         (line   22)
  * gimple_plf:                            Manipulating GIMPLE statements.
!                                                              (line   66)
  * GIMPLE_RESX:                           GIMPLE_RESX.        (line    6)
! * gimple_resx_region:                    GIMPLE_RESX.        (line   13)
! * gimple_resx_set_region:                GIMPLE_RESX.        (line   16)
  * GIMPLE_RETURN:                         GIMPLE_RETURN.      (line    6)
! * gimple_return_retval:                  GIMPLE_RETURN.      (line   10)
! * gimple_return_set_retval:              GIMPLE_RETURN.      (line   14)
! * gimple_seq_add_seq:                    GIMPLE sequences.   (line   32)
! * gimple_seq_add_stmt:                   GIMPLE sequences.   (line   26)
! * gimple_seq_alloc:                      GIMPLE sequences.   (line   62)
! * gimple_seq_copy:                       GIMPLE sequences.   (line   67)
! * gimple_seq_deep_copy:                  GIMPLE sequences.   (line   37)
! * gimple_seq_empty_p:                    GIMPLE sequences.   (line   70)
! * gimple_seq_first:                      GIMPLE sequences.   (line   44)
! * gimple_seq_init:                       GIMPLE sequences.   (line   59)
! * gimple_seq_last:                       GIMPLE sequences.   (line   47)
! * gimple_seq_reverse:                    GIMPLE sequences.   (line   40)
! * gimple_seq_set_first:                  GIMPLE sequences.   (line   55)
! * gimple_seq_set_last:                   GIMPLE sequences.   (line   51)
! * gimple_seq_singleton_p:                GIMPLE sequences.   (line   79)
  * gimple_set_block:                      Manipulating GIMPLE statements.
!                                                              (line   39)
  * gimple_set_def_ops:                    Manipulating GIMPLE statements.
!                                                              (line   98)
  * gimple_set_has_volatile_ops:           Manipulating GIMPLE statements.
!                                                              (line  138)
  * gimple_set_locus:                      Manipulating GIMPLE statements.
!                                                              (line   45)
  * gimple_set_op:                         Manipulating GIMPLE statements.
!                                                              (line   87)
  * gimple_set_plf:                        Manipulating GIMPLE statements.
!                                                              (line   62)
  * gimple_set_use_ops:                    Manipulating GIMPLE statements.
!                                                              (line  105)
  * gimple_set_vdef_ops:                   Manipulating GIMPLE statements.
!                                                              (line  119)
  * gimple_set_visited:                    Manipulating GIMPLE statements.
!                                                              (line   55)
  * gimple_set_vuse_ops:                   Manipulating GIMPLE statements.
!                                                              (line  112)
! * gimple_simplify:                       GIMPLE API.         (line    8)
  * gimple_statement_base:                 Tuple representation.
                                                               (line   14)
  * gimple_statement_with_ops:             Tuple representation.
                                                               (line   96)
  * gimple_stored_syms:                    Manipulating GIMPLE statements.
!                                                              (line  126)
  * GIMPLE_SWITCH:                         GIMPLE_SWITCH.      (line    6)
! * gimple_switch_default_label:           GIMPLE_SWITCH.      (line   43)
! * gimple_switch_index:                   GIMPLE_SWITCH.      (line   25)
! * gimple_switch_label:                   GIMPLE_SWITCH.      (line   33)
! * gimple_switch_num_labels:              GIMPLE_SWITCH.      (line   16)
! * gimple_switch_set_default_label:       GIMPLE_SWITCH.      (line   47)
! * gimple_switch_set_index:               GIMPLE_SWITCH.      (line   29)
! * gimple_switch_set_label:               GIMPLE_SWITCH.      (line   38)
! * gimple_switch_set_num_labels:          GIMPLE_SWITCH.      (line   21)
  * GIMPLE_TRY:                            GIMPLE_TRY.         (line    6)
! * gimple_try_catch_is_cleanup:           GIMPLE_TRY.         (line   20)
! * gimple_try_cleanup:                    GIMPLE_TRY.         (line   27)
! * gimple_try_eval:                       GIMPLE_TRY.         (line   23)
! * gimple_try_kind:                       GIMPLE_TRY.         (line   16)
! * gimple_try_set_catch_is_cleanup:       GIMPLE_TRY.         (line   32)
! * gimple_try_set_cleanup:                GIMPLE_TRY.         (line   40)
! * gimple_try_set_eval:                   GIMPLE_TRY.         (line   35)
  * gimple_use_ops:                        Manipulating GIMPLE statements.
!                                                              (line  101)
  * gimple_vdef_ops:                       Manipulating GIMPLE statements.
!                                                              (line  115)
  * gimple_visited_p:                      Manipulating GIMPLE statements.
!                                                              (line   58)
  * gimple_vuse_ops:                       Manipulating GIMPLE statements.
!                                                              (line  108)
  * gimple_wce_cleanup:                    GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line   11)
  * gimple_wce_cleanup_eh_only:            GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line   18)
  * gimple_wce_set_cleanup:                GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line   15)
  * gimple_wce_set_cleanup_eh_only:        GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line   22)
  * GIMPLE_WITH_CLEANUP_EXPR:              GIMPLE_WITH_CLEANUP_EXPR.
                                                               (line    6)
  * gimplification <1>:                    Gimplification pass.
                                                               (line    6)
! * gimplification:                        Parsing pass.       (line   14)
! * gimplifier:                            Parsing pass.       (line   14)
! * gimplify_assign:                       GIMPLE_ASSIGN.      (line   43)
  * gimplify_expr:                         Gimplification pass.
                                                               (line   18)
  * gimplify_function_tree:                Gimplification pass.
                                                               (line   18)
  * GLOBAL_INIT_PRIORITY:                  Functions for C++.  (line  141)
  * global_regs:                           Register Basics.    (line   59)
! * GO_IF_LEGITIMATE_ADDRESS:              Addressing Modes.   (line   91)
  * greater than:                          Comparisons.        (line   60)
! * gsi_after_labels:                      Sequence iterators. (line   76)
! * gsi_bb:                                Sequence iterators. (line   83)
  * gsi_commit_edge_inserts <1>:           Maintaining the CFG.
!                                                              (line  107)
! * gsi_commit_edge_inserts:               Sequence iterators. (line  194)
! * gsi_commit_one_edge_insert:            Sequence iterators. (line  190)
  * gsi_end_p <1>:                         Maintaining the CFG.
!                                                              (line   49)
! * gsi_end_p:                             Sequence iterators. (line   60)
! * gsi_for_stmt:                          Sequence iterators. (line  157)
  * gsi_insert_after <1>:                  Maintaining the CFG.
!                                                              (line   61)
! * gsi_insert_after:                      Sequence iterators. (line  147)
  * gsi_insert_before <1>:                 Maintaining the CFG.
!                                                              (line   67)
! * gsi_insert_before:                     Sequence iterators. (line  136)
  * gsi_insert_on_edge <1>:                Maintaining the CFG.
!                                                              (line  107)
! * gsi_insert_on_edge:                    Sequence iterators. (line  174)
! * gsi_insert_on_edge_immediate:          Sequence iterators. (line  185)
! * gsi_insert_seq_after:                  Sequence iterators. (line  154)
! * gsi_insert_seq_before:                 Sequence iterators. (line  143)
! * gsi_insert_seq_on_edge:                Sequence iterators. (line  179)
  * gsi_last <1>:                          Maintaining the CFG.
!                                                              (line   45)
! * gsi_last:                              Sequence iterators. (line   50)
! * gsi_last_bb:                           Sequence iterators. (line   56)
! * gsi_link_after:                        Sequence iterators. (line  115)
! * gsi_link_before:                       Sequence iterators. (line  105)
! * gsi_link_seq_after:                    Sequence iterators. (line  110)
! * gsi_link_seq_before:                   Sequence iterators. (line   99)
! * gsi_move_after:                        Sequence iterators. (line  161)
! * gsi_move_before:                       Sequence iterators. (line  166)
! * gsi_move_to_bb_end:                    Sequence iterators. (line  171)
  * gsi_next <1>:                          Maintaining the CFG.
!                                                              (line   53)
! * gsi_next:                              Sequence iterators. (line   66)
! * gsi_one_before_end_p:                  Sequence iterators. (line   63)
  * gsi_prev <1>:                          Maintaining the CFG.
!                                                              (line   57)
! * gsi_prev:                              Sequence iterators. (line   69)
  * gsi_remove <1>:                        Maintaining the CFG.
!                                                              (line   73)
! * gsi_remove:                            Sequence iterators. (line   90)
! * gsi_replace:                           Sequence iterators. (line  130)
! * gsi_seq:                               Sequence iterators. (line   86)
! * gsi_split_seq_after:                   Sequence iterators. (line  120)
! * gsi_split_seq_before:                  Sequence iterators. (line  125)
  * gsi_start <1>:                         Maintaining the CFG.
!                                                              (line   41)
! * gsi_start:                             Sequence iterators. (line   40)
! * gsi_start_bb:                          Sequence iterators. (line   46)
! * gsi_stmt:                              Sequence iterators. (line   72)
! * gsi_stmt_ptr:                          Sequence iterators. (line   80)
  * gt:                                    Comparisons.        (line   60)
! * gt and attributes:                     Expressions.        (line   85)
! * GT_EXPR:                               Unary and Binary Expressions.
!                                                              (line    6)
  * gtu:                                   Comparisons.        (line   64)
! * gtu and attributes:                    Expressions.        (line   85)
  * GTY:                                   Type Information.   (line    6)
! * H in constraint:                       Simple Constraints. (line   98)
! * HAmode:                                Machine Modes.      (line  147)
! * HANDLE_PRAGMA_PACK_WITH_EXPANSION:     Misc.               (line  444)
  * HANDLER:                               Statements for C++. (line    6)
  * HANDLER_BODY:                          Statements for C++. (line    6)
  * HANDLER_PARMS:                         Statements for C++. (line    6)
  * hard registers:                        Regs and Memory.    (line    9)
! * HARD_FRAME_POINTER_IS_ARG_POINTER:     Frame Registers.    (line   58)
! * HARD_FRAME_POINTER_IS_FRAME_POINTER:   Frame Registers.    (line   51)
! * HARD_FRAME_POINTER_REGNUM:             Frame Registers.    (line   20)
! * HARD_REGNO_CALL_PART_CLOBBERED:        Register Basics.    (line   53)
! * HARD_REGNO_CALLER_SAVE_MODE:           Caller Saves.       (line   11)
  * HARD_REGNO_MODE_OK:                    Values in Registers.
!                                                              (line   58)
  * HARD_REGNO_NREGS:                      Values in Registers.
!                                                              (line   11)
  * HARD_REGNO_NREGS_HAS_PADDING:          Values in Registers.
!                                                              (line   25)
  * HARD_REGNO_NREGS_WITH_PADDING:         Values in Registers.
!                                                              (line   43)
  * HARD_REGNO_RENAME_OK:                  Values in Registers.
!                                                              (line  119)
  * HAS_INIT_SECTION:                      Macros for Initialization.
!                                                              (line   19)
! * HAS_LONG_COND_BRANCH:                  Misc.               (line    9)
! * HAS_LONG_UNCOND_BRANCH:                Misc.               (line   18)
  * HAVE_DOS_BASED_FILE_SYSTEM:            Filesystem.         (line   11)
! * HAVE_POST_DECREMENT:                   Addressing Modes.   (line   12)
! * HAVE_POST_INCREMENT:                   Addressing Modes.   (line   11)
! * HAVE_POST_MODIFY_DISP:                 Addressing Modes.   (line   18)
! * HAVE_POST_MODIFY_REG:                  Addressing Modes.   (line   24)
! * HAVE_PRE_DECREMENT:                    Addressing Modes.   (line   10)
! * HAVE_PRE_INCREMENT:                    Addressing Modes.   (line    9)
! * HAVE_PRE_MODIFY_DISP:                  Addressing Modes.   (line   17)
! * HAVE_PRE_MODIFY_REG:                   Addressing Modes.   (line   23)
! * HCmode:                                Machine Modes.      (line  200)
  * HFmode:                                Machine Modes.      (line   61)
  * high:                                  Constants.          (line  150)
  * HImode:                                Machine Modes.      (line   29)
! * HImode, in insn:                       Insns.              (line  272)
! * HONOR_REG_ALLOC_ORDER:                 Allocation Order.   (line   37)
  * host configuration:                    Host Config.        (line    6)
  * host functions:                        Host Common.        (line    6)
  * host hooks:                            Host Common.        (line    6)
  * host makefile fragment:                Host Fragment.      (line    6)
  * HOST_BIT_BUCKET:                       Filesystem.         (line   51)
  * HOST_EXECUTABLE_SUFFIX:                Filesystem.         (line   45)
! * HOST_HOOKS_EXTRA_SIGNALS:              Host Common.        (line   12)
! * HOST_HOOKS_GT_PCH_ALLOC_GRANULARITY:   Host Common.        (line   45)
! * HOST_HOOKS_GT_PCH_GET_ADDRESS:         Host Common.        (line   17)
! * HOST_HOOKS_GT_PCH_USE_ADDRESS:         Host Common.        (line   26)
  * HOST_LACKS_INODE_NUMBERS:              Filesystem.         (line   89)
  * HOST_LONG_FORMAT:                      Host Misc.          (line   45)
  * HOST_LONG_LONG_FORMAT:                 Host Misc.          (line   41)
  * HOST_OBJECT_SUFFIX:                    Filesystem.         (line   40)
  * HOST_PTR_PRINTF:                       Host Misc.          (line   49)
! * HOT_TEXT_SECTION_NAME:                 Sections.           (line   43)
  * HQmode:                                Machine Modes.      (line  110)
! * I in constraint:                       Simple Constraints. (line   81)
! * i in constraint:                       Simple Constraints. (line   70)
  * identifier:                            Identifiers.        (line    6)
  * IDENTIFIER_LENGTH:                     Identifiers.        (line   22)
  * IDENTIFIER_NODE:                       Identifiers.        (line    6)
--- 47983,48502 ----
  * GIMPLE instruction set:                GIMPLE instruction set.
                                                               (line    6)
  * GIMPLE sequences:                      GIMPLE sequences.   (line    6)
  * GIMPLE statement iterators:            Basic Blocks.       (line   78)
+ * GIMPLE statement iterators <1>:        Maintaining the CFG.
+                                                              (line   33)
  * gimple_addresses_taken:                Manipulating GIMPLE statements.
!                                                              (line   89)
  * GIMPLE_ASM:                            GIMPLE_ASM.         (line    6)
! * gimple_asm_clobber_op:                 GIMPLE_ASM.         (line   39)
! * gimple_asm_input_op:                   GIMPLE_ASM.         (line   23)
! * gimple_asm_nclobbers:                  GIMPLE_ASM.         (line   20)
! * gimple_asm_ninputs:                    GIMPLE_ASM.         (line   14)
! * gimple_asm_noutputs:                   GIMPLE_ASM.         (line   17)
! * gimple_asm_output_op:                  GIMPLE_ASM.         (line   31)
! * gimple_asm_set_clobber_op:             GIMPLE_ASM.         (line   43)
! * gimple_asm_set_input_op:               GIMPLE_ASM.         (line   27)
! * gimple_asm_set_output_op:              GIMPLE_ASM.         (line   35)
! * gimple_asm_set_volatile:               GIMPLE_ASM.         (line   54)
! * gimple_asm_string:                     GIMPLE_ASM.         (line   47)
! * gimple_asm_volatile_p:                 GIMPLE_ASM.         (line   51)
  * GIMPLE_ASSIGN:                         GIMPLE_ASSIGN.      (line    6)
! * gimple_assign_cast_p:                  Logical Operators.  (line  158)
! * gimple_assign_cast_p <1>:              GIMPLE_ASSIGN.      (line  104)
! * gimple_assign_lhs:                     GIMPLE_ASSIGN.      (line   62)
! * gimple_assign_lhs_ptr:                 GIMPLE_ASSIGN.      (line   65)
! * gimple_assign_rhs1:                    GIMPLE_ASSIGN.      (line   68)
! * gimple_assign_rhs1_ptr:                GIMPLE_ASSIGN.      (line   71)
! * gimple_assign_rhs2:                    GIMPLE_ASSIGN.      (line   75)
! * gimple_assign_rhs2_ptr:                GIMPLE_ASSIGN.      (line   78)
! * gimple_assign_rhs3:                    GIMPLE_ASSIGN.      (line   82)
! * gimple_assign_rhs3_ptr:                GIMPLE_ASSIGN.      (line   85)
! * gimple_assign_rhs_class:               GIMPLE_ASSIGN.      (line   56)
! * gimple_assign_rhs_code:                GIMPLE_ASSIGN.      (line   52)
! * gimple_assign_set_lhs:                 GIMPLE_ASSIGN.      (line   89)
! * gimple_assign_set_rhs1:                GIMPLE_ASSIGN.      (line   92)
! * gimple_assign_set_rhs2:                GIMPLE_ASSIGN.      (line   96)
! * gimple_assign_set_rhs3:                GIMPLE_ASSIGN.      (line  100)
  * gimple_bb:                             Manipulating GIMPLE statements.
!                                                              (line   17)
  * GIMPLE_BIND:                           GIMPLE_BIND.        (line    6)
! * gimple_bind_add_seq:                   GIMPLE_BIND.        (line   34)
! * gimple_bind_add_stmt:                  GIMPLE_BIND.        (line   31)
! * gimple_bind_append_vars:               GIMPLE_BIND.        (line   18)
! * gimple_bind_block:                     GIMPLE_BIND.        (line   39)
! * gimple_bind_body:                      GIMPLE_BIND.        (line   22)
! * gimple_bind_set_block:                 GIMPLE_BIND.        (line   44)
! * gimple_bind_set_body:                  GIMPLE_BIND.        (line   26)
! * gimple_bind_set_vars:                  GIMPLE_BIND.        (line   14)
! * gimple_bind_vars:                      GIMPLE_BIND.        (line   11)
  * gimple_block:                          Manipulating GIMPLE statements.
!                                                              (line   20)
! * gimple_build:                          GIMPLE API.         (line   34)
! * gimple_build <1>:                      GIMPLE API.         (line   36)
! * gimple_build <2>:                      GIMPLE API.         (line   38)
! * gimple_build <3>:                      GIMPLE API.         (line   41)
! * gimple_build <4>:                      GIMPLE API.         (line   44)
! * gimple_build_nop:                      GIMPLE_NOP.         (line    6)
! * gimple_build_omp_master:               GIMPLE_OMP_MASTER.  (line    6)
! * gimple_build_omp_ordered:              GIMPLE_OMP_ORDERED. (line    6)
! * gimple_build_omp_return:               GIMPLE_OMP_RETURN.  (line    6)
! * gimple_build_omp_section:              GIMPLE_OMP_SECTION. (line    6)
  * gimple_build_omp_sections_switch:      GIMPLE_OMP_SECTIONS.
!                                                              (line   13)
  * gimple_build_wce:                      GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line    6)
  * GIMPLE_CALL:                           GIMPLE_CALL.        (line    6)
! * gimple_call_arg:                       GIMPLE_CALL.        (line   65)
! * gimple_call_arg_ptr:                   GIMPLE_CALL.        (line   69)
! * gimple_call_chain:                     GIMPLE_CALL.        (line   56)
! * gimple_call_copy_skip_args:            GIMPLE_CALL.        (line   90)
! * gimple_call_fn:                        GIMPLE_CALL.        (line   37)
! * gimple_call_fndecl:                    GIMPLE_CALL.        (line   45)
! * gimple_call_lhs:                       GIMPLE_CALL.        (line   28)
! * gimple_call_lhs_ptr:                   GIMPLE_CALL.        (line   31)
! * gimple_call_noreturn_p:                GIMPLE_CALL.        (line   87)
! * gimple_call_num_args:                  GIMPLE_CALL.        (line   62)
! * gimple_call_return_type:               GIMPLE_CALL.        (line   53)
! * gimple_call_set_arg:                   GIMPLE_CALL.        (line   74)
! * gimple_call_set_chain:                 GIMPLE_CALL.        (line   59)
! * gimple_call_set_fn:                    GIMPLE_CALL.        (line   41)
! * gimple_call_set_fndecl:                GIMPLE_CALL.        (line   50)
! * gimple_call_set_lhs:                   GIMPLE_CALL.        (line   34)
! * gimple_call_set_tail:                  GIMPLE_CALL.        (line   79)
! * gimple_call_tail_p:                    GIMPLE_CALL.        (line   84)
  * GIMPLE_CATCH:                          GIMPLE_CATCH.       (line    6)
! * gimple_catch_handler:                  GIMPLE_CATCH.       (line   19)
! * gimple_catch_set_handler:              GIMPLE_CATCH.       (line   26)
! * gimple_catch_set_types:                GIMPLE_CATCH.       (line   23)
! * gimple_catch_types:                    GIMPLE_CATCH.       (line   12)
! * gimple_catch_types_ptr:                GIMPLE_CATCH.       (line   15)
  * gimple_code:                           Manipulating GIMPLE statements.
!                                                              (line   14)
  * GIMPLE_COND:                           GIMPLE_COND.        (line    6)
! * gimple_cond_code:                      GIMPLE_COND.        (line   20)
! * gimple_cond_false_label:               GIMPLE_COND.        (line   59)
! * gimple_cond_lhs:                       GIMPLE_COND.        (line   29)
! * gimple_cond_make_false:                GIMPLE_COND.        (line   63)
! * gimple_cond_make_true:                 GIMPLE_COND.        (line   66)
! * gimple_cond_rhs:                       GIMPLE_COND.        (line   37)
! * gimple_cond_set_code:                  GIMPLE_COND.        (line   24)
! * gimple_cond_set_false_label:           GIMPLE_COND.        (line   54)
! * gimple_cond_set_lhs:                   GIMPLE_COND.        (line   33)
! * gimple_cond_set_rhs:                   GIMPLE_COND.        (line   41)
! * gimple_cond_set_true_label:            GIMPLE_COND.        (line   49)
! * gimple_cond_true_label:                GIMPLE_COND.        (line   45)
! * gimple_convert:                        GIMPLE API.         (line   47)
  * gimple_copy:                           Manipulating GIMPLE statements.
!                                                              (line  146)
  * GIMPLE_DEBUG:                          GIMPLE_DEBUG.       (line    6)
  * GIMPLE_DEBUG_BIND:                     GIMPLE_DEBUG.       (line    6)
! * gimple_debug_bind_get_value:           GIMPLE_DEBUG.       (line   46)
! * gimple_debug_bind_get_value_ptr:       GIMPLE_DEBUG.       (line   50)
! * gimple_debug_bind_get_var:             GIMPLE_DEBUG.       (line   43)
! * gimple_debug_bind_has_value_p:         GIMPLE_DEBUG.       (line   68)
! * gimple_debug_bind_p:                   Logical Operators.  (line  162)
! * gimple_debug_bind_reset_value:         GIMPLE_DEBUG.       (line   64)
! * gimple_debug_bind_set_value:           GIMPLE_DEBUG.       (line   59)
! * gimple_debug_bind_set_var:             GIMPLE_DEBUG.       (line   55)
  * gimple_def_ops:                        Manipulating GIMPLE statements.
!                                                              (line   93)
  * GIMPLE_EH_FILTER:                      GIMPLE_EH_FILTER.   (line    6)
! * gimple_eh_filter_failure:              GIMPLE_EH_FILTER.   (line   18)
! * gimple_eh_filter_set_failure:          GIMPLE_EH_FILTER.   (line   27)
! * gimple_eh_filter_set_types:            GIMPLE_EH_FILTER.   (line   22)
! * gimple_eh_filter_types:                GIMPLE_EH_FILTER.   (line   11)
! * gimple_eh_filter_types_ptr:            GIMPLE_EH_FILTER.   (line   14)
! * gimple_eh_must_not_throw_fndecl:       GIMPLE_EH_FILTER.   (line   32)
! * gimple_eh_must_not_throw_set_fndecl:   GIMPLE_EH_FILTER.   (line   36)
  * gimple_expr_code:                      Manipulating GIMPLE statements.
!                                                              (line   30)
  * gimple_expr_type:                      Manipulating GIMPLE statements.
!                                                              (line   23)
  * GIMPLE_GOTO:                           GIMPLE_GOTO.        (line    6)
! * gimple_goto_dest:                      GIMPLE_GOTO.        (line    9)
! * gimple_goto_set_dest:                  GIMPLE_GOTO.        (line   12)
  * gimple_has_mem_ops:                    Manipulating GIMPLE statements.
!                                                              (line   71)
  * gimple_has_ops:                        Manipulating GIMPLE statements.
!                                                              (line   68)
  * gimple_has_volatile_ops:               Manipulating GIMPLE statements.
!                                                              (line  133)
  * GIMPLE_LABEL:                          GIMPLE_LABEL.       (line    6)
! * gimple_label_label:                    GIMPLE_LABEL.       (line   10)
! * gimple_label_set_label:                GIMPLE_LABEL.       (line   13)
  * gimple_loaded_syms:                    Manipulating GIMPLE statements.
!                                                              (line  121)
  * gimple_locus:                          Manipulating GIMPLE statements.
!                                                              (line   41)
  * gimple_locus_empty_p:                  Manipulating GIMPLE statements.
!                                                              (line   47)
  * gimple_modified_p:                     Manipulating GIMPLE statements.
!                                                              (line  129)
  * GIMPLE_NOP:                            GIMPLE_NOP.         (line    6)
! * gimple_nop_p:                          GIMPLE_NOP.         (line    9)
! * gimple_no_warning_p:                   Manipulating GIMPLE statements.
!                                                              (line   50)
! * gimple_num_ops:                        Logical Operators.  (line   76)
  * gimple_num_ops <1>:                    Manipulating GIMPLE statements.
!                                                              (line   74)
  * GIMPLE_OMP_ATOMIC_LOAD:                GIMPLE_OMP_ATOMIC_LOAD.
                                                               (line    6)
  * gimple_omp_atomic_load_lhs:            GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line   16)
  * gimple_omp_atomic_load_rhs:            GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line   24)
  * gimple_omp_atomic_load_set_lhs:        GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line   12)
  * gimple_omp_atomic_load_set_rhs:        GIMPLE_OMP_ATOMIC_LOAD.
!                                                              (line   20)
  * GIMPLE_OMP_ATOMIC_STORE:               GIMPLE_OMP_ATOMIC_STORE.
                                                               (line    6)
  * gimple_omp_atomic_store_set_val:       GIMPLE_OMP_ATOMIC_STORE.
!                                                              (line   11)
  * gimple_omp_atomic_store_val:           GIMPLE_OMP_ATOMIC_STORE.
!                                                              (line   15)
  * gimple_omp_body:                       GIMPLE_OMP_PARALLEL.
!                                                              (line   23)
  * GIMPLE_OMP_CONTINUE:                   GIMPLE_OMP_CONTINUE.
                                                               (line    6)
  * gimple_omp_continue_control_def:       GIMPLE_OMP_CONTINUE.
!                                                              (line   12)
  * gimple_omp_continue_control_def_ptr:   GIMPLE_OMP_CONTINUE.
!                                                              (line   17)
  * gimple_omp_continue_control_use:       GIMPLE_OMP_CONTINUE.
!                                                              (line   26)
  * gimple_omp_continue_control_use_ptr:   GIMPLE_OMP_CONTINUE.
!                                                              (line   31)
  * gimple_omp_continue_set_control_def:   GIMPLE_OMP_CONTINUE.
!                                                              (line   21)
  * gimple_omp_continue_set_control_use:   GIMPLE_OMP_CONTINUE.
!                                                              (line   35)
  * GIMPLE_OMP_CRITICAL:                   GIMPLE_OMP_CRITICAL.
                                                               (line    6)
  * gimple_omp_critical_name:              GIMPLE_OMP_CRITICAL.
!                                                              (line   12)
  * gimple_omp_critical_name_ptr:          GIMPLE_OMP_CRITICAL.
!                                                              (line   16)
  * gimple_omp_critical_set_name:          GIMPLE_OMP_CRITICAL.
!                                                              (line   21)
  * GIMPLE_OMP_FOR:                        GIMPLE_OMP_FOR.     (line    6)
! * gimple_omp_for_clauses:                GIMPLE_OMP_FOR.     (line   17)
! * gimple_omp_for_clauses_ptr:            GIMPLE_OMP_FOR.     (line   20)
! * gimple_omp_for_cond:                   GIMPLE_OMP_FOR.     (line   80)
! * gimple_omp_for_final:                  GIMPLE_OMP_FOR.     (line   48)
! * gimple_omp_for_final_ptr:              GIMPLE_OMP_FOR.     (line   51)
! * gimple_omp_for_incr:                   GIMPLE_OMP_FOR.     (line   58)
! * gimple_omp_for_incr_ptr:               GIMPLE_OMP_FOR.     (line   61)
! * gimple_omp_for_index:                  GIMPLE_OMP_FOR.     (line   28)
! * gimple_omp_for_index_ptr:              GIMPLE_OMP_FOR.     (line   31)
! * gimple_omp_for_initial:                GIMPLE_OMP_FOR.     (line   38)
! * gimple_omp_for_initial_ptr:            GIMPLE_OMP_FOR.     (line   41)
! * gimple_omp_for_pre_body:               GIMPLE_OMP_FOR.     (line   67)
! * gimple_omp_for_set_clauses:            GIMPLE_OMP_FOR.     (line   23)
! * gimple_omp_for_set_cond:               GIMPLE_OMP_FOR.     (line   76)
! * gimple_omp_for_set_final:              GIMPLE_OMP_FOR.     (line   54)
! * gimple_omp_for_set_incr:               GIMPLE_OMP_FOR.     (line   64)
! * gimple_omp_for_set_index:              GIMPLE_OMP_FOR.     (line   34)
! * gimple_omp_for_set_initial:            GIMPLE_OMP_FOR.     (line   44)
! * gimple_omp_for_set_pre_body:           GIMPLE_OMP_FOR.     (line   71)
  * GIMPLE_OMP_MASTER:                     GIMPLE_OMP_MASTER.  (line    6)
  * GIMPLE_OMP_ORDERED:                    GIMPLE_OMP_ORDERED. (line    6)
  * GIMPLE_OMP_PARALLEL:                   GIMPLE_OMP_PARALLEL.
                                                               (line    6)
  * gimple_omp_parallel_child_fn:          GIMPLE_OMP_PARALLEL.
!                                                              (line   42)
  * gimple_omp_parallel_child_fn_ptr:      GIMPLE_OMP_PARALLEL.
!                                                              (line   47)
  * gimple_omp_parallel_clauses:           GIMPLE_OMP_PARALLEL.
!                                                              (line   30)
  * gimple_omp_parallel_clauses_ptr:       GIMPLE_OMP_PARALLEL.
!                                                              (line   33)
  * gimple_omp_parallel_combined_p:        GIMPLE_OMP_PARALLEL.
!                                                              (line   15)
  * gimple_omp_parallel_data_arg:          GIMPLE_OMP_PARALLEL.
!                                                              (line   56)
  * gimple_omp_parallel_data_arg_ptr:      GIMPLE_OMP_PARALLEL.
!                                                              (line   61)
  * gimple_omp_parallel_set_child_fn:      GIMPLE_OMP_PARALLEL.
!                                                              (line   52)
  * gimple_omp_parallel_set_clauses:       GIMPLE_OMP_PARALLEL.
!                                                              (line   37)
  * gimple_omp_parallel_set_combined_p:    GIMPLE_OMP_PARALLEL.
!                                                              (line   19)
  * gimple_omp_parallel_set_data_arg:      GIMPLE_OMP_PARALLEL.
!                                                              (line   65)
  * GIMPLE_OMP_RETURN:                     GIMPLE_OMP_RETURN.  (line    6)
! * gimple_omp_return_nowait_p:            GIMPLE_OMP_RETURN.  (line   13)
! * gimple_omp_return_set_nowait:          GIMPLE_OMP_RETURN.  (line   10)
  * GIMPLE_OMP_SECTION:                    GIMPLE_OMP_SECTION. (line    6)
  * GIMPLE_OMP_SECTIONS:                   GIMPLE_OMP_SECTIONS.
                                                               (line    6)
  * gimple_omp_sections_clauses:           GIMPLE_OMP_SECTIONS.
!                                                              (line   29)
  * gimple_omp_sections_clauses_ptr:       GIMPLE_OMP_SECTIONS.
!                                                              (line   32)
  * gimple_omp_sections_control:           GIMPLE_OMP_SECTIONS.
!                                                              (line   16)
  * gimple_omp_sections_control_ptr:       GIMPLE_OMP_SECTIONS.
!                                                              (line   20)
  * gimple_omp_sections_set_clauses:       GIMPLE_OMP_SECTIONS.
!                                                              (line   35)
  * gimple_omp_sections_set_control:       GIMPLE_OMP_SECTIONS.
!                                                              (line   24)
! * gimple_omp_section_last_p:             GIMPLE_OMP_SECTION. (line   11)
! * gimple_omp_section_set_last:           GIMPLE_OMP_SECTION. (line   15)
  * gimple_omp_set_body:                   GIMPLE_OMP_PARALLEL.
!                                                              (line   26)
  * GIMPLE_OMP_SINGLE:                     GIMPLE_OMP_SINGLE.  (line    6)
! * gimple_omp_single_clauses:             GIMPLE_OMP_SINGLE.  (line   13)
! * gimple_omp_single_clauses_ptr:         GIMPLE_OMP_SINGLE.  (line   16)
! * gimple_omp_single_set_clauses:         GIMPLE_OMP_SINGLE.  (line   19)
! * gimple_op:                             Logical Operators.  (line   79)
  * gimple_op <1>:                         Manipulating GIMPLE statements.
!                                                              (line   80)
! * gimple_ops:                            Logical Operators.  (line   82)
  * gimple_ops <1>:                        Manipulating GIMPLE statements.
!                                                              (line   77)
! * gimple_op_ptr:                         Manipulating GIMPLE statements.
!                                                              (line   83)
  * GIMPLE_PHI:                            GIMPLE_PHI.         (line    6)
! * gimple_phi_arg:                        GIMPLE_PHI.         (line   24)
! * gimple_phi_arg <1>:                    SSA.                (line   62)
! * gimple_phi_arg_def:                    SSA.                (line   68)
! * gimple_phi_arg_edge:                   SSA.                (line   65)
! * gimple_phi_capacity:                   GIMPLE_PHI.         (line    6)
! * gimple_phi_num_args:                   GIMPLE_PHI.         (line   10)
! * gimple_phi_num_args <1>:               SSA.                (line   58)
! * gimple_phi_result:                     GIMPLE_PHI.         (line   15)
! * gimple_phi_result <1>:                 SSA.                (line   55)
! * gimple_phi_result_ptr:                 GIMPLE_PHI.         (line   18)
! * gimple_phi_set_arg:                    GIMPLE_PHI.         (line   28)
! * gimple_phi_set_result:                 GIMPLE_PHI.         (line   21)
  * gimple_plf:                            Manipulating GIMPLE statements.
!                                                              (line   64)
  * GIMPLE_RESX:                           GIMPLE_RESX.        (line    6)
! * gimple_resx_region:                    GIMPLE_RESX.        (line   12)
! * gimple_resx_set_region:                GIMPLE_RESX.        (line   15)
  * GIMPLE_RETURN:                         GIMPLE_RETURN.      (line    6)
! * gimple_return_retval:                  GIMPLE_RETURN.      (line    9)
! * gimple_return_set_retval:              GIMPLE_RETURN.      (line   12)
! * gimple_seq_add_seq:                    GIMPLE sequences.   (line   30)
! * gimple_seq_add_stmt:                   GIMPLE sequences.   (line   24)
! * gimple_seq_alloc:                      GIMPLE sequences.   (line   61)
! * gimple_seq_copy:                       GIMPLE sequences.   (line   65)
! * gimple_seq_deep_copy:                  GIMPLE sequences.   (line   36)
! * gimple_seq_empty_p:                    GIMPLE sequences.   (line   69)
! * gimple_seq_first:                      GIMPLE sequences.   (line   43)
! * gimple_seq_init:                       GIMPLE sequences.   (line   58)
! * gimple_seq_last:                       GIMPLE sequences.   (line   46)
! * gimple_seq_reverse:                    GIMPLE sequences.   (line   39)
! * gimple_seq_set_first:                  GIMPLE sequences.   (line   53)
! * gimple_seq_set_last:                   GIMPLE sequences.   (line   49)
! * gimple_seq_singleton_p:                GIMPLE sequences.   (line   78)
  * gimple_set_block:                      Manipulating GIMPLE statements.
!                                                              (line   38)
  * gimple_set_def_ops:                    Manipulating GIMPLE statements.
!                                                              (line   96)
  * gimple_set_has_volatile_ops:           Manipulating GIMPLE statements.
!                                                              (line  136)
  * gimple_set_locus:                      Manipulating GIMPLE statements.
!                                                              (line   44)
  * gimple_set_op:                         Manipulating GIMPLE statements.
!                                                              (line   86)
  * gimple_set_plf:                        Manipulating GIMPLE statements.
!                                                              (line   60)
  * gimple_set_use_ops:                    Manipulating GIMPLE statements.
!                                                              (line  103)
  * gimple_set_vdef_ops:                   Manipulating GIMPLE statements.
!                                                              (line  117)
  * gimple_set_visited:                    Manipulating GIMPLE statements.
!                                                              (line   53)
  * gimple_set_vuse_ops:                   Manipulating GIMPLE statements.
!                                                              (line  110)
! * gimple_simplify:                       GIMPLE API.         (line    6)
! * gimple_simplify <1>:                   GIMPLE API.         (line    8)
! * gimple_simplify <2>:                   GIMPLE API.         (line   10)
! * gimple_simplify <3>:                   GIMPLE API.         (line   12)
! * gimple_simplify <4>:                   GIMPLE API.         (line   14)
! * gimple_simplify <5>:                   GIMPLE API.         (line   16)
  * gimple_statement_base:                 Tuple representation.
                                                               (line   14)
  * gimple_statement_with_ops:             Tuple representation.
                                                               (line   96)
  * gimple_stored_syms:                    Manipulating GIMPLE statements.
!                                                              (line  125)
  * GIMPLE_SWITCH:                         GIMPLE_SWITCH.      (line    6)
! * gimple_switch_default_label:           GIMPLE_SWITCH.      (line   41)
! * gimple_switch_index:                   GIMPLE_SWITCH.      (line   24)
! * gimple_switch_label:                   GIMPLE_SWITCH.      (line   31)
! * gimple_switch_num_labels:              GIMPLE_SWITCH.      (line   14)
! * gimple_switch_set_default_label:       GIMPLE_SWITCH.      (line   45)
! * gimple_switch_set_index:               GIMPLE_SWITCH.      (line   27)
! * gimple_switch_set_label:               GIMPLE_SWITCH.      (line   36)
! * gimple_switch_set_num_labels:          GIMPLE_SWITCH.      (line   19)
  * GIMPLE_TRY:                            GIMPLE_TRY.         (line    6)
! * gimple_try_catch_is_cleanup:           GIMPLE_TRY.         (line   19)
! * gimple_try_cleanup:                    GIMPLE_TRY.         (line   26)
! * gimple_try_eval:                       GIMPLE_TRY.         (line   22)
! * gimple_try_kind:                       GIMPLE_TRY.         (line   15)
! * gimple_try_set_catch_is_cleanup:       GIMPLE_TRY.         (line   30)
! * gimple_try_set_cleanup:                GIMPLE_TRY.         (line   38)
! * gimple_try_set_eval:                   GIMPLE_TRY.         (line   34)
  * gimple_use_ops:                        Manipulating GIMPLE statements.
!                                                              (line  100)
  * gimple_vdef_ops:                       Manipulating GIMPLE statements.
!                                                              (line  114)
  * gimple_visited_p:                      Manipulating GIMPLE statements.
!                                                              (line   57)
  * gimple_vuse_ops:                       Manipulating GIMPLE statements.
!                                                              (line  107)
  * gimple_wce_cleanup:                    GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line   10)
  * gimple_wce_cleanup_eh_only:            GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line   17)
  * gimple_wce_set_cleanup:                GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line   13)
  * gimple_wce_set_cleanup_eh_only:        GIMPLE_WITH_CLEANUP_EXPR.
!                                                              (line   20)
  * GIMPLE_WITH_CLEANUP_EXPR:              GIMPLE_WITH_CLEANUP_EXPR.
                                                               (line    6)
+ * gimplification:                        Parsing pass.       (line   13)
  * gimplification <1>:                    Gimplification pass.
                                                               (line    6)
! * gimplifier:                            Parsing pass.       (line   13)
! * gimplify_assign:                       GIMPLE_ASSIGN.      (line   41)
  * gimplify_expr:                         Gimplification pass.
                                                               (line   18)
  * gimplify_function_tree:                Gimplification pass.
                                                               (line   18)
  * GLOBAL_INIT_PRIORITY:                  Functions for C++.  (line  141)
  * global_regs:                           Register Basics.    (line   59)
! * GO_IF_LEGITIMATE_ADDRESS:              Addressing Modes.   (line   90)
  * greater than:                          Comparisons.        (line   60)
! * greater than <1>:                      Comparisons.        (line   64)
! * greater than <2>:                      Comparisons.        (line   72)
! * gsi_after_labels:                      Sequence iterators. (line   74)
! * gsi_bb:                                Sequence iterators. (line   82)
! * gsi_commit_edge_inserts:               Sequence iterators. (line  193)
  * gsi_commit_edge_inserts <1>:           Maintaining the CFG.
!                                                              (line  105)
! * gsi_commit_one_edge_insert:            Sequence iterators. (line  188)
! * gsi_end_p:                             Sequence iterators. (line   59)
  * gsi_end_p <1>:                         Maintaining the CFG.
!                                                              (line   48)
! * gsi_for_stmt:                          Sequence iterators. (line  156)
! * gsi_insert_after:                      Sequence iterators. (line  145)
  * gsi_insert_after <1>:                  Maintaining the CFG.
!                                                              (line   60)
! * gsi_insert_before:                     Sequence iterators. (line  134)
  * gsi_insert_before <1>:                 Maintaining the CFG.
!                                                              (line   66)
! * gsi_insert_on_edge:                    Sequence iterators. (line  173)
  * gsi_insert_on_edge <1>:                Maintaining the CFG.
!                                                              (line  105)
! * gsi_insert_on_edge_immediate:          Sequence iterators. (line  183)
! * gsi_insert_seq_after:                  Sequence iterators. (line  152)
! * gsi_insert_seq_before:                 Sequence iterators. (line  141)
! * gsi_insert_seq_on_edge:                Sequence iterators. (line  177)
! * gsi_last:                              Sequence iterators. (line   49)
  * gsi_last <1>:                          Maintaining the CFG.
!                                                              (line   44)
! * gsi_last_bb:                           Sequence iterators. (line   55)
! * gsi_link_after:                        Sequence iterators. (line  113)
! * gsi_link_before:                       Sequence iterators. (line  103)
! * gsi_link_seq_after:                    Sequence iterators. (line  108)
! * gsi_link_seq_before:                   Sequence iterators. (line   97)
! * gsi_move_after:                        Sequence iterators. (line  159)
! * gsi_move_before:                       Sequence iterators. (line  164)
! * gsi_move_to_bb_end:                    Sequence iterators. (line  169)
! * gsi_next:                              Sequence iterators. (line   65)
  * gsi_next <1>:                          Maintaining the CFG.
!                                                              (line   52)
! * gsi_one_before_end_p:                  Sequence iterators. (line   62)
! * gsi_prev:                              Sequence iterators. (line   68)
  * gsi_prev <1>:                          Maintaining the CFG.
!                                                              (line   56)
! * gsi_remove:                            Sequence iterators. (line   88)
  * gsi_remove <1>:                        Maintaining the CFG.
!                                                              (line   72)
! * gsi_replace:                           Sequence iterators. (line  128)
! * gsi_seq:                               Sequence iterators. (line   85)
! * gsi_split_seq_after:                   Sequence iterators. (line  118)
! * gsi_split_seq_before:                  Sequence iterators. (line  123)
! * gsi_start:                             Sequence iterators. (line   39)
  * gsi_start <1>:                         Maintaining the CFG.
!                                                              (line   40)
! * gsi_start_bb:                          Sequence iterators. (line   45)
! * gsi_stmt:                              Sequence iterators. (line   71)
! * gsi_stmt_ptr:                          Sequence iterators. (line   79)
  * gt:                                    Comparisons.        (line   60)
! * gt and attributes:                     Expressions.        (line   83)
  * gtu:                                   Comparisons.        (line   64)
! * gtu and attributes:                    Expressions.        (line   83)
  * GTY:                                   Type Information.   (line    6)
! * GT_EXPR:                               Unary and Binary Expressions.
!                                                              (line    6)
! * H in constraint:                       Simple Constraints. (line   96)
! * HAmode:                                Machine Modes.      (line  146)
  * HANDLER:                               Statements for C++. (line    6)
  * HANDLER_BODY:                          Statements for C++. (line    6)
  * HANDLER_PARMS:                         Statements for C++. (line    6)
+ * HANDLE_PRAGMA_PACK_WITH_EXPANSION:     Misc.               (line  442)
  * hard registers:                        Regs and Memory.    (line    9)
! * HARD_FRAME_POINTER_IS_ARG_POINTER:     Frame Registers.    (line   57)
! * HARD_FRAME_POINTER_IS_FRAME_POINTER:   Frame Registers.    (line   50)
! * HARD_FRAME_POINTER_REGNUM:             Frame Registers.    (line   19)
! * HARD_REGNO_CALLER_SAVE_MODE:           Caller Saves.       (line   10)
! * HARD_REGNO_CALL_PART_CLOBBERED:        Register Basics.    (line   52)
  * HARD_REGNO_MODE_OK:                    Values in Registers.
!                                                              (line   57)
  * HARD_REGNO_NREGS:                      Values in Registers.
!                                                              (line   10)
  * HARD_REGNO_NREGS_HAS_PADDING:          Values in Registers.
!                                                              (line   24)
  * HARD_REGNO_NREGS_WITH_PADDING:         Values in Registers.
!                                                              (line   42)
  * HARD_REGNO_RENAME_OK:                  Values in Registers.
!                                                              (line  117)
  * HAS_INIT_SECTION:                      Macros for Initialization.
!                                                              (line   18)
! * HAS_LONG_COND_BRANCH:                  Misc.               (line    8)
! * HAS_LONG_UNCOND_BRANCH:                Misc.               (line   17)
  * HAVE_DOS_BASED_FILE_SYSTEM:            Filesystem.         (line   11)
! * HAVE_POST_DECREMENT:                   Addressing Modes.   (line   11)
! * HAVE_POST_INCREMENT:                   Addressing Modes.   (line   10)
! * HAVE_POST_MODIFY_DISP:                 Addressing Modes.   (line   17)
! * HAVE_POST_MODIFY_REG:                  Addressing Modes.   (line   23)
! * HAVE_PRE_DECREMENT:                    Addressing Modes.   (line    9)
! * HAVE_PRE_INCREMENT:                    Addressing Modes.   (line    8)
! * HAVE_PRE_MODIFY_DISP:                  Addressing Modes.   (line   16)
! * HAVE_PRE_MODIFY_REG:                   Addressing Modes.   (line   22)
! * HCmode:                                Machine Modes.      (line  199)
  * HFmode:                                Machine Modes.      (line   61)
  * high:                                  Constants.          (line  150)
  * HImode:                                Machine Modes.      (line   29)
! * HImode, in insn:                       Insns.              (line  268)
! * HONOR_REG_ALLOC_ORDER:                 Allocation Order.   (line   36)
  * host configuration:                    Host Config.        (line    6)
  * host functions:                        Host Common.        (line    6)
  * host hooks:                            Host Common.        (line    6)
  * host makefile fragment:                Host Fragment.      (line    6)
  * HOST_BIT_BUCKET:                       Filesystem.         (line   51)
  * HOST_EXECUTABLE_SUFFIX:                Filesystem.         (line   45)
! * HOST_HOOKS_EXTRA_SIGNALS:              Host Common.        (line   11)
! * HOST_HOOKS_GT_PCH_ALLOC_GRANULARITY:   Host Common.        (line   43)
! * HOST_HOOKS_GT_PCH_GET_ADDRESS:         Host Common.        (line   15)
! * HOST_HOOKS_GT_PCH_USE_ADDRESS:         Host Common.        (line   24)
  * HOST_LACKS_INODE_NUMBERS:              Filesystem.         (line   89)
  * HOST_LONG_FORMAT:                      Host Misc.          (line   45)
  * HOST_LONG_LONG_FORMAT:                 Host Misc.          (line   41)
  * HOST_OBJECT_SUFFIX:                    Filesystem.         (line   40)
  * HOST_PTR_PRINTF:                       Host Misc.          (line   49)
! * HOT_TEXT_SECTION_NAME:                 Sections.           (line   42)
  * HQmode:                                Machine Modes.      (line  110)
! * i in constraint:                       Simple Constraints. (line   68)
! * I in constraint:                       Simple Constraints. (line   79)
  * identifier:                            Identifiers.        (line    6)
  * IDENTIFIER_LENGTH:                     Identifiers.        (line   22)
  * IDENTIFIER_NODE:                       Identifiers.        (line    6)
*************** Concept Index
*** 48930,48995 ****
  * IDENTIFIER_TYPENAME_P:                 Identifiers.        (line   33)
  * IEEE 754-2008:                         Decimal float library routines.
                                                               (line    6)
  * IF_COND:                               Statements for C++. (line    6)
  * IF_STMT:                               Statements for C++. (line    6)
  * if_then_else:                          Comparisons.        (line   80)
  * if_then_else and attributes:           Expressions.        (line   32)
  * if_then_else usage:                    Side Effects.       (line   56)
- * IFCVT_MACHDEP_INIT:                    Misc.               (line  568)
- * IFCVT_MODIFY_CANCEL:                   Misc.               (line  562)
- * IFCVT_MODIFY_FINAL:                    Misc.               (line  556)
- * IFCVT_MODIFY_INSN:                     Misc.               (line  550)
- * IFCVT_MODIFY_MULTIPLE_TESTS:           Misc.               (line  543)
- * IFCVT_MODIFY_TESTS:                    Misc.               (line  532)
  * IMAGPART_EXPR:                         Unary and Binary Expressions.
                                                               (line    6)
! * Immediate Uses:                        SSA Operands.       (line  261)
  * immediate_operand:                     Machine-Independent Predicates.
!                                                              (line   11)
! * IMMEDIATE_PREFIX:                      Instruction Output. (line  155)
! * in_struct:                             Flags.              (line  245)
! * in_struct, in code_label and note:     Flags.              (line   59)
! * in_struct, in insn and jump_insn and call_insn: Flags.     (line   49)
! * in_struct, in insn, call_insn, jump_insn and jump_table_data: Flags.
!                                                              (line  148)
! * in_struct, in subreg:                  Flags.              (line  187)
  * include:                               Including Patterns. (line    6)
! * INCLUDE_DEFAULTS:                      Driver.             (line  328)
! * inclusive-or, bitwise:                 Arithmetic.         (line  162)
! * INCOMING_FRAME_SP_OFFSET:              Frame Layout.       (line  185)
! * INCOMING_REG_PARM_STACK_SPACE:         Stack Arguments.    (line   74)
! * INCOMING_REGNO:                        Register Basics.    (line   87)
! * INCOMING_RETURN_ADDR_RTX:              Frame Layout.       (line  141)
! * INCOMING_STACK_BOUNDARY:               Storage Layout.     (line  156)
! * INDEX_REG_CLASS:                       Register Classes.   (line  143)
! * indirect_jump instruction pattern:     Standard Names.     (line 1292)
  * indirect_operand:                      Machine-Independent Predicates.
!                                                              (line   71)
  * INDIRECT_REF:                          Storage References. (line    6)
! * INIT_ARRAY_SECTION_ASM_OP:             Sections.           (line  107)
! * INIT_CUMULATIVE_ARGS:                  Register Arguments. (line  164)
! * INIT_CUMULATIVE_INCOMING_ARGS:         Register Arguments. (line  191)
! * INIT_CUMULATIVE_LIBCALL_ARGS:          Register Arguments. (line  185)
! * INIT_ENVIRONMENT:                      Driver.             (line  306)
! * INIT_EXPANDERS:                        Per-Function Data.  (line   39)
  * INIT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * init_machine_status:                   Per-Function Data.  (line   45)
  * init_one_libfunc:                      Library Calls.      (line   15)
  * INIT_SECTION_ASM_OP <1>:               Macros for Initialization.
!                                                              (line   10)
! * INIT_SECTION_ASM_OP:                   Sections.           (line   91)
! * INITIAL_ELIMINATION_OFFSET:            Elimination.        (line   85)
! * INITIAL_FRAME_ADDRESS_RTX:             Frame Layout.       (line   83)
! * INITIAL_FRAME_POINTER_OFFSET:          Elimination.        (line   35)
! * initialization routines:               Initialization.     (line    6)
  * inlining:                              Target Attributes.  (line   95)
  * insert_insn_on_edge:                   Maintaining the CFG.
!                                                              (line  107)
  * insn:                                  Insns.              (line   63)
  * insn and /f:                           Flags.              (line  107)
  * insn and /j:                           Flags.              (line  157)
  * insn and /s:                           Flags.              (line   49)
  * insn and /u:                           Flags.              (line   39)
  * insn and /v:                           Flags.              (line   44)
  * insn attributes:                       Insn Attributes.    (line    6)
--- 48505,48565 ----
  * IDENTIFIER_TYPENAME_P:                 Identifiers.        (line   33)
  * IEEE 754-2008:                         Decimal float library routines.
                                                               (line    6)
+ * IFCVT_MACHDEP_INIT:                    Misc.               (line  567)
+ * IFCVT_MODIFY_CANCEL:                   Misc.               (line  561)
+ * IFCVT_MODIFY_FINAL:                    Misc.               (line  555)
+ * IFCVT_MODIFY_INSN:                     Misc.               (line  549)
+ * IFCVT_MODIFY_MULTIPLE_TESTS:           Misc.               (line  541)
+ * IFCVT_MODIFY_TESTS:                    Misc.               (line  531)
  * IF_COND:                               Statements for C++. (line    6)
  * IF_STMT:                               Statements for C++. (line    6)
  * if_then_else:                          Comparisons.        (line   80)
  * if_then_else and attributes:           Expressions.        (line   32)
  * if_then_else usage:                    Side Effects.       (line   56)
  * IMAGPART_EXPR:                         Unary and Binary Expressions.
                                                               (line    6)
! * Immediate Uses:                        SSA Operands.       (line  258)
  * immediate_operand:                     Machine-Independent Predicates.
!                                                              (line   10)
! * IMMEDIATE_PREFIX:                      Instruction Output. (line  153)
  * include:                               Including Patterns. (line    6)
! * INCLUDE_DEFAULTS:                      Driver.             (line  327)
! * inclusive-or, bitwise:                 Arithmetic.         (line  163)
! * INCOMING_FRAME_SP_OFFSET:              Frame Layout.       (line  183)
! * INCOMING_REGNO:                        Register Basics.    (line   86)
! * INCOMING_REG_PARM_STACK_SPACE:         Stack Arguments.    (line   73)
! * INCOMING_RETURN_ADDR_RTX:              Frame Layout.       (line  139)
! * INCOMING_STACK_BOUNDARY:               Storage Layout.     (line  154)
! * INDEX_REG_CLASS:                       Register Classes.   (line  140)
! * indirect_jump instruction pattern:     Standard Names.     (line 1286)
  * indirect_operand:                      Machine-Independent Predicates.
!                                                              (line   70)
  * INDIRECT_REF:                          Storage References. (line    6)
! * initialization routines:               Initialization.     (line    6)
! * INITIAL_ELIMINATION_OFFSET:            Elimination.        (line   84)
! * INITIAL_FRAME_ADDRESS_RTX:             Frame Layout.       (line   81)
! * INITIAL_FRAME_POINTER_OFFSET:          Elimination.        (line   34)
! * INIT_ARRAY_SECTION_ASM_OP:             Sections.           (line  106)
! * INIT_CUMULATIVE_ARGS:                  Register Arguments. (line  161)
! * INIT_CUMULATIVE_INCOMING_ARGS:         Register Arguments. (line  189)
! * INIT_CUMULATIVE_LIBCALL_ARGS:          Register Arguments. (line  183)
! * INIT_ENVIRONMENT:                      Driver.             (line  305)
! * INIT_EXPANDERS:                        Per-Function Data.  (line   36)
  * INIT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * init_machine_status:                   Per-Function Data.  (line   42)
  * init_one_libfunc:                      Library Calls.      (line   15)
+ * INIT_SECTION_ASM_OP:                   Sections.           (line   90)
  * INIT_SECTION_ASM_OP <1>:               Macros for Initialization.
!                                                              (line    9)
  * inlining:                              Target Attributes.  (line   95)
  * insert_insn_on_edge:                   Maintaining the CFG.
!                                                              (line  105)
  * insn:                                  Insns.              (line   63)
  * insn and /f:                           Flags.              (line  107)
  * insn and /j:                           Flags.              (line  157)
  * insn and /s:                           Flags.              (line   49)
+ * insn and /s <1>:                       Flags.              (line  148)
  * insn and /u:                           Flags.              (line   39)
  * insn and /v:                           Flags.              (line   44)
  * insn attributes:                       Insn Attributes.    (line    6)
*************** Concept Index
*** 49001,49040 ****
  * insn splitting:                        Insn Splitting.     (line    6)
  * insn-attr.h:                           Defining Attributes.
                                                               (line   34)
  * INSN_ANNULLED_BRANCH_P:                Flags.              (line   39)
! * INSN_CODE:                             Insns.              (line  299)
  * INSN_DELETED_P:                        Flags.              (line   44)
  * INSN_FROM_TARGET_P:                    Flags.              (line   49)
! * insn_list:                             Insns.              (line  548)
! * INSN_REFERENCES_ARE_DELAYED:           Misc.               (line  471)
! * INSN_SETS_ARE_DELAYED:                 Misc.               (line  460)
  * INSN_UID:                              Insns.              (line   23)
! * INSN_VAR_LOCATION:                     Insns.              (line  239)
! * insns:                                 Insns.              (line    6)
! * insns, generating:                     RTL Template.       (line    6)
! * insns, recognizing:                    RTL Template.       (line    6)
  * instruction attributes:                Insn Attributes.    (line    6)
  * instruction latency time:              Processor pipeline description.
                                                               (line    6)
  * instruction patterns:                  Patterns.           (line    6)
  * instruction splitting:                 Insn Splitting.     (line    6)
! * insv instruction pattern:              Standard Names.     (line 1090)
! * insvM instruction pattern:             Standard Names.     (line 1042)
! * insvmisalignM instruction pattern:     Standard Names.     (line 1052)
  * int iterators in .md files:            Int Iterators.      (line    6)
! * INT16_TYPE:                            Type Layout.        (line  217)
! * INT32_TYPE:                            Type Layout.        (line  218)
! * INT64_TYPE:                            Type Layout.        (line  219)
! * INT8_TYPE:                             Type Layout.        (line  216)
! * INT_FAST16_TYPE:                       Type Layout.        (line  233)
! * INT_FAST32_TYPE:                       Type Layout.        (line  234)
! * INT_FAST64_TYPE:                       Type Layout.        (line  235)
! * INT_FAST8_TYPE:                        Type Layout.        (line  232)
! * INT_LEAST16_TYPE:                      Type Layout.        (line  225)
! * INT_LEAST32_TYPE:                      Type Layout.        (line  226)
! * INT_LEAST64_TYPE:                      Type Layout.        (line  227)
! * INT_LEAST8_TYPE:                       Type Layout.        (line  224)
! * INT_TYPE_SIZE:                         Type Layout.        (line   12)
  * INTEGER_CST:                           Constant expressions.
                                                               (line    6)
  * INTEGER_TYPE:                          Types.              (line    6)
--- 48571,48605 ----
  * insn splitting:                        Insn Splitting.     (line    6)
  * insn-attr.h:                           Defining Attributes.
                                                               (line   34)
+ * insns:                                 Insns.              (line    6)
+ * insns, generating:                     RTL Template.       (line    6)
+ * insns, recognizing:                    RTL Template.       (line    6)
  * INSN_ANNULLED_BRANCH_P:                Flags.              (line   39)
! * INSN_CODE:                             Insns.              (line  295)
  * INSN_DELETED_P:                        Flags.              (line   44)
  * INSN_FROM_TARGET_P:                    Flags.              (line   49)
! * insn_list:                             Insns.              (line  540)
! * INSN_REFERENCES_ARE_DELAYED:           Misc.               (line  469)
! * INSN_SETS_ARE_DELAYED:                 Misc.               (line  458)
  * INSN_UID:                              Insns.              (line   23)
! * INSN_VAR_LOCATION:                     Insns.              (line  236)
  * instruction attributes:                Insn Attributes.    (line    6)
  * instruction latency time:              Processor pipeline description.
                                                               (line    6)
+ * instruction latency time <1>:          Processor pipeline description.
+                                                              (line  105)
+ * instruction latency time <2>:          Processor pipeline description.
+                                                              (line  196)
  * instruction patterns:                  Patterns.           (line    6)
  * instruction splitting:                 Insn Splitting.     (line    6)
! * insv instruction pattern:              Standard Names.     (line 1085)
! * insvM instruction pattern:             Standard Names.     (line 1037)
! * insvmisalignM instruction pattern:     Standard Names.     (line 1047)
  * int iterators in .md files:            Int Iterators.      (line    6)
! * INT16_TYPE:                            Type Layout.        (line  216)
! * INT32_TYPE:                            Type Layout.        (line  217)
! * INT64_TYPE:                            Type Layout.        (line  218)
! * INT8_TYPE:                             Type Layout.        (line  215)
  * INTEGER_CST:                           Constant expressions.
                                                               (line    6)
  * INTEGER_TYPE:                          Types.              (line    6)
*************** Concept Index
*** 49042,49101 ****
  * interfacing to GCC output:             Interface.          (line    6)
  * interlock delays:                      Processor pipeline description.
                                                               (line    6)
! * intermediate representation lowering:  Parsing pass.       (line   14)
! * INTMAX_TYPE:                           Type Layout.        (line  193)
! * INTPTR_TYPE:                           Type Layout.        (line  240)
  * introduction:                          Top.                (line    6)
  * INVOKE__main:                          Macros for Initialization.
!                                                              (line   51)
! * ior:                                   Arithmetic.         (line  162)
  * ior and attributes:                    Expressions.        (line   50)
  * ior, canonicalization of:              Insn Canonicalizations.
!                                                              (line   52)
! * iorM3 instruction pattern:             Standard Names.     (line  269)
! * IRA_HARD_REGNO_ADD_COST_MULTIPLIER:    Allocation Order.   (line   46)
! * IS_ASM_LOGICAL_LINE_SEPARATOR:         Data Output.        (line  125)
! * is_gimple_addressable:                 Logical Operators.  (line  115)
! * is_gimple_asm_val:                     Logical Operators.  (line  119)
! * is_gimple_assign:                      Logical Operators.  (line  151)
! * is_gimple_call:                        Logical Operators.  (line  154)
! * is_gimple_call_addr:                   Logical Operators.  (line  122)
! * is_gimple_constant:                    Logical Operators.  (line  130)
! * is_gimple_debug:                       Logical Operators.  (line  157)
! * is_gimple_ip_invariant:                Logical Operators.  (line  139)
! * is_gimple_ip_invariant_address:        Logical Operators.  (line  144)
! * is_gimple_mem_ref_addr:                Logical Operators.  (line  126)
! * is_gimple_min_invariant:               Logical Operators.  (line  133)
! * is_gimple_omp:                         Logical Operators.  (line  168)
! * is_gimple_val:                         Logical Operators.  (line  109)
  * iterators in .md files:                Iterators.          (line    6)
  * IV analysis on GIMPLE:                 Scalar evolutions.  (line    6)
  * IV analysis on RTL:                    loop-iv.            (line    6)
  * JMP_BUF_SIZE:                          Exception Region Output.
!                                                              (line   84)
  * jump:                                  Flags.              (line  286)
! * jump instruction pattern:              Standard Names.     (line 1169)
  * jump instruction patterns:             Jump Patterns.      (line    6)
  * jump instructions and set:             Side Effects.       (line   56)
  * jump, in call_insn:                    Flags.              (line  161)
  * jump, in insn:                         Flags.              (line  157)
  * jump, in mem:                          Flags.              (line   70)
! * JUMP_ALIGN:                            Alignment Output.   (line    9)
  * jump_insn:                             Insns.              (line   73)
  * jump_insn and /f:                      Flags.              (line  107)
  * jump_insn and /s:                      Flags.              (line   49)
  * jump_insn and /u:                      Flags.              (line   39)
  * jump_insn and /v:                      Flags.              (line   44)
  * JUMP_LABEL:                            Insns.              (line   80)
  * jump_table_data:                       Insns.              (line  166)
  * jump_table_data and /s:                Flags.              (line  148)
  * jump_table_data and /v:                Flags.              (line   44)
! * JUMP_TABLES_IN_TEXT_SECTION:           Sections.           (line  151)
! * Jumps:                                 Jumps.              (line    6)
! * LABEL_ALIGN:                           Alignment Output.   (line   58)
! * LABEL_ALIGN_AFTER_BARRIER:             Alignment Output.   (line   27)
  * LABEL_ALT_ENTRY_P:                     Insns.              (line  146)
- * LABEL_ALTERNATE_NAME:                  Edges.              (line  181)
  * LABEL_DECL:                            Declarations.       (line    6)
  * LABEL_KIND:                            Insns.              (line  146)
  * LABEL_NUSES:                           Insns.              (line  142)
--- 48607,48682 ----
  * interfacing to GCC output:             Interface.          (line    6)
  * interlock delays:                      Processor pipeline description.
                                                               (line    6)
! * intermediate representation lowering:  Parsing pass.       (line   13)
! * INTMAX_TYPE:                           Type Layout.        (line  192)
! * INTPTR_TYPE:                           Type Layout.        (line  239)
  * introduction:                          Top.                (line    6)
+ * INT_FAST16_TYPE:                       Type Layout.        (line  232)
+ * INT_FAST32_TYPE:                       Type Layout.        (line  233)
+ * INT_FAST64_TYPE:                       Type Layout.        (line  234)
+ * INT_FAST8_TYPE:                        Type Layout.        (line  231)
+ * INT_LEAST16_TYPE:                      Type Layout.        (line  224)
+ * INT_LEAST32_TYPE:                      Type Layout.        (line  225)
+ * INT_LEAST64_TYPE:                      Type Layout.        (line  226)
+ * INT_LEAST8_TYPE:                       Type Layout.        (line  223)
+ * INT_TYPE_SIZE:                         Type Layout.        (line   11)
  * INVOKE__main:                          Macros for Initialization.
!                                                              (line   50)
! * in_struct:                             Flags.              (line  245)
! * in_struct, in code_label and note:     Flags.              (line   59)
! * in_struct, in insn and jump_insn and call_insn: Flags.     (line   49)
! * in_struct, in insn, call_insn, jump_insn and jump_table_data: Flags.
!                                                              (line  148)
! * in_struct, in subreg:                  Flags.              (line  187)
! * ior:                                   Arithmetic.         (line  163)
  * ior and attributes:                    Expressions.        (line   50)
  * ior, canonicalization of:              Insn Canonicalizations.
!                                                              (line   51)
! * iorM3 instruction pattern:             Standard Names.     (line  266)
! * IRA_HARD_REGNO_ADD_COST_MULTIPLIER:    Allocation Order.   (line   44)
! * IS_ASM_LOGICAL_LINE_SEPARATOR:         Data Output.        (line  123)
! * is_gimple_addressable:                 Logical Operators.  (line  113)
! * is_gimple_asm_val:                     Logical Operators.  (line  117)
! * is_gimple_assign:                      Logical Operators.  (line  149)
! * is_gimple_call:                        Logical Operators.  (line  152)
! * is_gimple_call_addr:                   Logical Operators.  (line  120)
! * is_gimple_constant:                    Logical Operators.  (line  128)
! * is_gimple_debug:                       Logical Operators.  (line  155)
! * is_gimple_ip_invariant:                Logical Operators.  (line  137)
! * is_gimple_ip_invariant_address:        Logical Operators.  (line  142)
! * is_gimple_mem_ref_addr:                Logical Operators.  (line  124)
! * is_gimple_min_invariant:               Logical Operators.  (line  131)
! * is_gimple_omp:                         Logical Operators.  (line  166)
! * is_gimple_val:                         Logical Operators.  (line  107)
  * iterators in .md files:                Iterators.          (line    6)
  * IV analysis on GIMPLE:                 Scalar evolutions.  (line    6)
  * IV analysis on RTL:                    loop-iv.            (line    6)
  * JMP_BUF_SIZE:                          Exception Region Output.
!                                                              (line   82)
  * jump:                                  Flags.              (line  286)
! * jump instruction pattern:              Standard Names.     (line 1164)
  * jump instruction patterns:             Jump Patterns.      (line    6)
  * jump instructions and set:             Side Effects.       (line   56)
  * jump, in call_insn:                    Flags.              (line  161)
  * jump, in insn:                         Flags.              (line  157)
  * jump, in mem:                          Flags.              (line   70)
! * Jumps:                                 Jumps.              (line    6)
! * JUMP_ALIGN:                            Alignment Output.   (line    8)
  * jump_insn:                             Insns.              (line   73)
  * jump_insn and /f:                      Flags.              (line  107)
  * jump_insn and /s:                      Flags.              (line   49)
+ * jump_insn and /s <1>:                  Flags.              (line  148)
  * jump_insn and /u:                      Flags.              (line   39)
  * jump_insn and /v:                      Flags.              (line   44)
  * JUMP_LABEL:                            Insns.              (line   80)
+ * JUMP_TABLES_IN_TEXT_SECTION:           Sections.           (line  150)
  * jump_table_data:                       Insns.              (line  166)
  * jump_table_data and /s:                Flags.              (line  148)
  * jump_table_data and /v:                Flags.              (line   44)
! * LABEL_ALIGN:                           Alignment Output.   (line   57)
! * LABEL_ALIGN_AFTER_BARRIER:             Alignment Output.   (line   26)
! * LABEL_ALTERNATE_NAME:                  Edges.              (line  180)
  * LABEL_ALT_ENTRY_P:                     Insns.              (line  146)
  * LABEL_DECL:                            Declarations.       (line    6)
  * LABEL_KIND:                            Insns.              (line  146)
  * LABEL_NUSES:                           Insns.              (line  142)
*************** Concept Index
*** 49104,49188 ****
  * label_ref and /v:                      Flags.              (line   65)
  * label_ref, RTL sharing:                Sharing.            (line   35)
  * LABEL_REF_NONLOCAL_P:                  Flags.              (line   65)
- * lang_hooks.gimplify_expr:              Gimplification pass.
-                                                              (line   18)
- * lang_hooks.parse_file:                 Parsing pass.       (line    6)
  * language-dependent trees:              Language-dependent trees.
                                                               (line    6)
  * language-independent intermediate representation: Parsing pass.
!                                                              (line   14)
  * large return values:                   Aggregate Return.   (line    6)
! * LAST_STACK_REG:                        Stack Registers.    (line   31)
  * LAST_VIRTUAL_REGISTER:                 Regs and Memory.    (line   51)
! * lceilMN2:                              Standard Names.     (line  745)
  * LCSSA:                                 LCSSA.              (line    6)
  * LD_FINI_SWITCH:                        Macros for Initialization.
!                                                              (line   29)
  * LD_INIT_SWITCH:                        Macros for Initialization.
!                                                              (line   25)
! * LDD_SUFFIX:                            Macros for Initialization.
!                                                              (line  122)
  * le:                                    Comparisons.        (line   76)
! * le and attributes:                     Expressions.        (line   85)
! * LE_EXPR:                               Unary and Binary Expressions.
!                                                              (line    6)
  * leaf functions:                        Leaf Functions.     (line    6)
! * leaf_function_p:                       Standard Names.     (line 1254)
! * LEAF_REG_REMAP:                        Leaf Functions.     (line   39)
! * LEAF_REGISTERS:                        Leaf Functions.     (line   25)
! * left rotate:                           Arithmetic.         (line  194)
! * left shift:                            Arithmetic.         (line  172)
! * LEGITIMATE_PIC_OPERAND_P:              PIC.                (line   32)
! * LEGITIMIZE_RELOAD_ADDRESS:             Addressing Modes.   (line  153)
! * length:                                GTY Options.        (line   50)
  * less than:                             Comparisons.        (line   68)
  * less than or equal:                    Comparisons.        (line   76)
  * leu:                                   Comparisons.        (line   76)
! * leu and attributes:                    Expressions.        (line   85)
! * lfloorMN2:                             Standard Names.     (line  740)
  * LIB2FUNCS_EXTRA:                       Target Fragment.    (line   11)
- * LIB_SPEC:                              Driver.             (line  108)
  * LIBCALL_VALUE:                         Scalar Return.      (line   56)
  * libgcc.a:                              Library Calls.      (line    6)
  * LIBGCC2_CFLAGS:                        Target Fragment.    (line    8)
! * LIBGCC2_GNU_PREFIX:                    Type Layout.        (line  103)
! * LIBGCC2_UNWIND_ATTRIBUTE:              Misc.               (line 1104)
! * LIBGCC_SPEC:                           Driver.             (line  116)
  * library subroutine names:              Library Calls.      (line    6)
! * LIBRARY_PATH_ENV:                      Misc.               (line  511)
! * LIMIT_RELOAD_CLASS:                    Register Classes.   (line  300)
! * LINK_COMMAND_SPEC:                     Driver.             (line  237)
! * LINK_EH_SPEC:                          Driver.             (line  143)
! * LINK_GCC_C_SEQUENCE_SPEC:              Driver.             (line  233)
! * LINK_LIBGCC_SPECIAL_1:                 Driver.             (line  228)
! * LINK_SPEC:                             Driver.             (line  101)
  * list:                                  Containers.         (line    6)
  * Liveness representation:               Liveness information.
                                                               (line    6)
! * lo_sum:                                Arithmetic.         (line   24)
! * load address instruction:              Simple Constraints. (line  164)
! * LOAD_EXTEND_OP:                        Misc.               (line   60)
! * load_multiple instruction pattern:     Standard Names.     (line  137)
! * Local Register Allocator (LRA):        RTL passes.         (line  188)
! * LOCAL_ALIGNMENT:                       Storage Layout.     (line  258)
  * LOCAL_CLASS_P:                         Classes.            (line   73)
! * LOCAL_DECL_ALIGNMENT:                  Storage Layout.     (line  295)
! * LOCAL_INCLUDE_DIR:                     Driver.             (line  313)
! * LOCAL_LABEL_PREFIX:                    Instruction Output. (line  153)
! * LOCAL_REGNO:                           Register Basics.    (line  101)
! * LOG_LINKS:                             Insns.              (line  318)
  * Logical Operators:                     Logical Operators.  (line    6)
! * logical-and, bitwise:                  Arithmetic.         (line  157)
! * LOGICAL_OP_NON_SHORT_CIRCUIT:          Costs.              (line  273)
! * logM2 instruction pattern:             Standard Names.     (line  653)
! * LONG_ACCUM_TYPE_SIZE:                  Type Layout.        (line   93)
! * LONG_DOUBLE_TYPE_SIZE:                 Type Layout.        (line   58)
! * LONG_FRACT_TYPE_SIZE:                  Type Layout.        (line   73)
! * LONG_LONG_ACCUM_TYPE_SIZE:             Type Layout.        (line   98)
! * LONG_LONG_FRACT_TYPE_SIZE:             Type Layout.        (line   78)
! * LONG_LONG_TYPE_SIZE:                   Type Layout.        (line   33)
! * LONG_TYPE_SIZE:                        Type Layout.        (line   22)
  * longjmp and automatic variables:       Interface.          (line   52)
  * Loop analysis:                         Loop representation.
                                                               (line    6)
  * Loop manipulation:                     Loop manipulation.  (line    6)
--- 48685,48768 ----
  * label_ref and /v:                      Flags.              (line   65)
  * label_ref, RTL sharing:                Sharing.            (line   35)
  * LABEL_REF_NONLOCAL_P:                  Flags.              (line   65)
  * language-dependent trees:              Language-dependent trees.
                                                               (line    6)
  * language-independent intermediate representation: Parsing pass.
!                                                              (line   13)
! * lang_hooks.gimplify_expr:              Gimplification pass.
!                                                              (line   18)
! * lang_hooks.parse_file:                 Parsing pass.       (line    6)
  * large return values:                   Aggregate Return.   (line    6)
! * LAST_STACK_REG:                        Stack Registers.    (line   30)
  * LAST_VIRTUAL_REGISTER:                 Regs and Memory.    (line   51)
! * lceilMN2:                              Standard Names.     (line  740)
  * LCSSA:                                 LCSSA.              (line    6)
+ * LDD_SUFFIX:                            Macros for Initialization.
+                                                              (line  121)
  * LD_FINI_SWITCH:                        Macros for Initialization.
!                                                              (line   28)
  * LD_INIT_SWITCH:                        Macros for Initialization.
!                                                              (line   24)
  * le:                                    Comparisons.        (line   76)
! * le and attributes:                     Expressions.        (line   83)
  * leaf functions:                        Leaf Functions.     (line    6)
! * leaf_function_p:                       Standard Names.     (line 1248)
! * LEAF_REGISTERS:                        Leaf Functions.     (line   23)
! * LEAF_REG_REMAP:                        Leaf Functions.     (line   37)
! * left rotate:                           Arithmetic.         (line  195)
! * left shift:                            Arithmetic.         (line  173)
! * LEGITIMATE_PIC_OPERAND_P:              PIC.                (line   31)
! * LEGITIMIZE_RELOAD_ADDRESS:             Addressing Modes.   (line  150)
! * length:                                GTY Options.        (line   47)
  * less than:                             Comparisons.        (line   68)
  * less than or equal:                    Comparisons.        (line   76)
  * leu:                                   Comparisons.        (line   76)
! * leu and attributes:                    Expressions.        (line   83)
! * LE_EXPR:                               Unary and Binary Expressions.
!                                                              (line    6)
! * lfloorMN2:                             Standard Names.     (line  735)
  * LIB2FUNCS_EXTRA:                       Target Fragment.    (line   11)
  * LIBCALL_VALUE:                         Scalar Return.      (line   56)
  * libgcc.a:                              Library Calls.      (line    6)
  * LIBGCC2_CFLAGS:                        Target Fragment.    (line    8)
! * LIBGCC2_GNU_PREFIX:                    Type Layout.        (line  102)
! * LIBGCC2_UNWIND_ATTRIBUTE:              Misc.               (line 1097)
! * LIBGCC_SPEC:                           Driver.             (line  115)
  * library subroutine names:              Library Calls.      (line    6)
! * LIBRARY_PATH_ENV:                      Misc.               (line  509)
! * LIB_SPEC:                              Driver.             (line  107)
! * LIMIT_RELOAD_CLASS:                    Register Classes.   (line  296)
! * LINK_COMMAND_SPEC:                     Driver.             (line  236)
! * LINK_EH_SPEC:                          Driver.             (line  142)
! * LINK_GCC_C_SEQUENCE_SPEC:              Driver.             (line  232)
! * LINK_LIBGCC_SPECIAL_1:                 Driver.             (line  227)
! * LINK_SPEC:                             Driver.             (line  100)
  * list:                                  Containers.         (line    6)
  * Liveness representation:               Liveness information.
                                                               (line    6)
! * load address instruction:              Simple Constraints. (line  162)
! * LOAD_EXTEND_OP:                        Misc.               (line   59)
! * load_multiple instruction pattern:     Standard Names.     (line  136)
! * Local Register Allocator (LRA):        RTL passes.         (line  187)
! * LOCAL_ALIGNMENT:                       Storage Layout.     (line  254)
  * LOCAL_CLASS_P:                         Classes.            (line   73)
! * LOCAL_DECL_ALIGNMENT:                  Storage Layout.     (line  291)
! * LOCAL_INCLUDE_DIR:                     Driver.             (line  312)
! * LOCAL_LABEL_PREFIX:                    Instruction Output. (line  151)
! * LOCAL_REGNO:                           Register Basics.    (line  100)
  * Logical Operators:                     Logical Operators.  (line    6)
! * logical-and, bitwise:                  Arithmetic.         (line  158)
! * LOGICAL_OP_NON_SHORT_CIRCUIT:          Costs.              (line  272)
! * logM2 instruction pattern:             Standard Names.     (line  648)
! * LOG_LINKS:                             Insns.              (line  314)
  * longjmp and automatic variables:       Interface.          (line   52)
+ * LONG_ACCUM_TYPE_SIZE:                  Type Layout.        (line   92)
+ * LONG_DOUBLE_TYPE_SIZE:                 Type Layout.        (line   57)
+ * LONG_FRACT_TYPE_SIZE:                  Type Layout.        (line   72)
+ * LONG_LONG_ACCUM_TYPE_SIZE:             Type Layout.        (line   97)
+ * LONG_LONG_FRACT_TYPE_SIZE:             Type Layout.        (line   77)
+ * LONG_LONG_TYPE_SIZE:                   Type Layout.        (line   32)
+ * LONG_TYPE_SIZE:                        Type Layout.        (line   21)
  * Loop analysis:                         Loop representation.
                                                               (line    6)
  * Loop manipulation:                     Loop manipulation.  (line    6)
*************** Concept Index
*** 49190,49217 ****
  * Loop representation:                   Loop representation.
                                                               (line    6)
  * Loop-closed SSA form:                  LCSSA.              (line    6)
! * LOOP_ALIGN:                            Alignment Output.   (line   41)
  * LOOP_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
- * looping instruction patterns:          Looping Patterns.   (line    6)
  * lowering, language-dependent intermediate representation: Parsing pass.
!                                                              (line   14)
! * lrintMN2:                              Standard Names.     (line  730)
! * lroundMN2:                             Standard Names.     (line  735)
  * LSHIFT_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
! * lshiftrt:                              Arithmetic.         (line  189)
! * lshiftrt and attributes:               Expressions.        (line   85)
! * lshrM3 instruction pattern:            Standard Names.     (line  568)
  * lt:                                    Comparisons.        (line   68)
! * lt and attributes:                     Expressions.        (line   85)
! * LT_EXPR:                               Unary and Binary Expressions.
!                                                              (line    6)
  * LTGT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * lto:                                   LTO.                (line    6)
  * ltrans:                                LTO.                (line    6)
  * ltu:                                   Comparisons.        (line   68)
  * m in constraint:                       Simple Constraints. (line   17)
  * machine attributes:                    Target Attributes.  (line    6)
  * machine description macros:            Target Macros.      (line    6)
--- 48770,48798 ----
  * Loop representation:                   Loop representation.
                                                               (line    6)
  * Loop-closed SSA form:                  LCSSA.              (line    6)
! * looping instruction patterns:          Looping Patterns.   (line    6)
! * LOOP_ALIGN:                            Alignment Output.   (line   40)
  * LOOP_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * lowering, language-dependent intermediate representation: Parsing pass.
!                                                              (line   13)
! * lo_sum:                                Arithmetic.         (line   25)
! * lrintMN2:                              Standard Names.     (line  725)
! * lroundMN2:                             Standard Names.     (line  730)
! * lshiftrt:                              Arithmetic.         (line  190)
! * lshiftrt and attributes:               Expressions.        (line   83)
  * LSHIFT_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
! * lshrM3 instruction pattern:            Standard Names.     (line  563)
  * lt:                                    Comparisons.        (line   68)
! * lt and attributes:                     Expressions.        (line   83)
  * LTGT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * lto:                                   LTO.                (line    6)
  * ltrans:                                LTO.                (line    6)
  * ltu:                                   Comparisons.        (line   68)
+ * LT_EXPR:                               Unary and Binary Expressions.
+                                                              (line    6)
  * m in constraint:                       Simple Constraints. (line   17)
  * machine attributes:                    Target Attributes.  (line    6)
  * machine description macros:            Target Macros.      (line    6)
*************** Concept Index
*** 49224,49381 ****
                                                               (line    6)
  * machine_mode:                          Machine Modes.      (line    6)
  * macros, target description:            Target Macros.      (line    6)
! * maddMN4 instruction pattern:           Standard Names.     (line  491)
! * MAKE_DECL_ONE_ONLY:                    Label Output.       (line  257)
! * make_safe_from:                        Expander Definitions.
!                                                              (line  151)
  * makefile fragment:                     Fragments.          (line    6)
  * makefile targets:                      Makefile.           (line    6)
! * MALLOC_ABI_ALIGNMENT:                  Storage Layout.     (line  175)
  * Manipulating GIMPLE statements:        Manipulating GIMPLE statements.
                                                               (line    6)
- * mark_hook:                             GTY Options.        (line  137)
  * marking roots:                         GGC Roots.          (line    6)
  * MASK_RETURN_ADDR:                      Exception Region Output.
!                                                              (line   35)
  * Match and Simplify:                    Match and Simplify. (line    6)
! * match_dup <1>:                         define_peephole2.   (line   28)
  * match_dup:                             RTL Template.       (line   73)
  * match_dup and attributes:              Insn Lengths.       (line   16)
- * match_op_dup:                          RTL Template.       (line  163)
  * match_operand:                         RTL Template.       (line   16)
  * match_operand and attributes:          Expressions.        (line   55)
  * match_operator:                        RTL Template.       (line   95)
! * match_par_dup:                         RTL Template.       (line  219)
  * match_parallel:                        RTL Template.       (line  172)
! * match_scratch <1>:                     define_peephole2.   (line   28)
  * match_scratch:                         RTL Template.       (line   58)
  * match_test and attributes:             Expressions.        (line   64)
- * matching constraint:                   Simple Constraints. (line  142)
- * matching operands:                     Output Template.    (line   49)
  * math library:                          Soft float library routines.
                                                               (line    6)
  * math, in RTL:                          Arithmetic.         (line    6)
- * MATH_LIBRARY:                          Misc.               (line  504)
  * matherr:                               Library Calls.      (line   59)
! * MAX_BITS_PER_WORD:                     Storage Layout.     (line   55)
! * MAX_BITSIZE_MODE_ANY_INT:              Machine Modes.      (line  359)
! * MAX_BITSIZE_MODE_ANY_MODE:             Machine Modes.      (line  365)
! * MAX_CONDITIONAL_EXECUTE:               Misc.               (line  526)
! * MAX_FIXED_MODE_SIZE:                   Storage Layout.     (line  441)
! * MAX_MOVE_MAX:                          Misc.               (line  106)
! * MAX_OFILE_ALIGNMENT:                   Storage Layout.     (line  212)
! * MAX_REGS_PER_ADDRESS:                  Addressing Modes.   (line   43)
! * MAX_STACK_ALIGNMENT:                   Storage Layout.     (line  205)
! * maxM3 instruction pattern:             Standard Names.     (line  328)
! * may_trap_p, tree_could_trap_p:         Edges.              (line  115)
! * maybe_undef:                           GTY Options.        (line  145)
  * mcount:                                Profiling.          (line   12)
! * MD_EXEC_PREFIX:                        Driver.             (line  268)
! * MD_FALLBACK_FRAME_STATE_FOR:           Exception Handling. (line   94)
! * MD_HANDLE_UNWABI:                      Exception Handling. (line  114)
! * MD_STARTFILE_PREFIX:                   Driver.             (line  296)
! * MD_STARTFILE_PREFIX_1:                 Driver.             (line  301)
! * mem:                                   Regs and Memory.    (line  374)
  * mem and /c:                            Flags.              (line   81)
  * mem and /f:                            Flags.              (line   85)
  * mem and /j:                            Flags.              (line   70)
  * mem and /u:                            Flags.              (line  134)
  * mem and /v:                            Flags.              (line   76)
  * mem, RTL sharing:                      Sharing.            (line   40)
! * MEM_ADDR_SPACE:                        Special Accessors.  (line   49)
  * MEM_ALIAS_SET:                         Special Accessors.  (line    9)
! * MEM_ALIGN:                             Special Accessors.  (line   46)
! * MEM_EXPR:                              Special Accessors.  (line   20)
  * MEM_KEEP_ALIAS_SET_P:                  Flags.              (line   70)
  * MEM_NOTRAP_P:                          Flags.              (line   81)
! * MEM_OFFSET:                            Special Accessors.  (line   32)
! * MEM_OFFSET_KNOWN_P:                    Special Accessors.  (line   28)
  * MEM_POINTER:                           Flags.              (line   85)
  * MEM_READONLY_P:                        Flags.              (line  134)
  * MEM_REF:                               Storage References. (line    6)
! * mem_signal_fenceMODE instruction pattern: Standard Names.  (line 1903)
! * MEM_SIZE:                              Special Accessors.  (line   40)
! * MEM_SIZE_KNOWN_P:                      Special Accessors.  (line   36)
! * mem_thread_fenceMODE instruction pattern: Standard Names.  (line 1895)
  * MEM_VOLATILE_P:                        Flags.              (line   76)
- * memory model:                          Memory model.       (line    6)
- * memory reference, nonoffsettable:      Simple Constraints. (line  256)
- * memory references in constraints:      Simple Constraints. (line   17)
- * memory_barrier instruction pattern:    Standard Names.     (line 1644)
- * MEMORY_MOVE_COST:                      Costs.              (line   54)
- * memory_operand:                        Machine-Independent Predicates.
-                                                              (line   58)
  * METHOD_TYPE:                           Types.              (line    6)
! * MIN_UNITS_PER_WORD:                    Storage Layout.     (line   65)
! * MINIMUM_ALIGNMENT:                     Storage Layout.     (line  308)
! * MINIMUM_ATOMIC_ALIGNMENT:              Storage Layout.     (line  183)
! * minM3 instruction pattern:             Standard Names.     (line  328)
! * minus:                                 Arithmetic.         (line   36)
! * minus and attributes:                  Expressions.        (line   85)
  * minus, canonicalization of:            Insn Canonicalizations.
                                                               (line   27)
  * MINUS_EXPR:                            Unary and Binary Expressions.
                                                               (line    6)
  * MIPS coprocessor-definition macros:    MIPS Coprocessors.  (line    6)
  * miscellaneous register hooks:          Miscellaneous Register Hooks.
                                                               (line    6)
  * mnemonic attribute:                    Mnemonic Attribute. (line    6)
! * mod:                                   Arithmetic.         (line  135)
! * mod and attributes:                    Expressions.        (line   85)
! * mode classes:                          Machine Modes.      (line  226)
  * mode iterators in .md files:           Mode Iterators.     (line    6)
  * mode switching:                        Mode Switching.     (line    6)
! * MODE_ACCUM:                            Machine Modes.      (line  256)
! * MODE_BASE_REG_CLASS:                   Register Classes.   (line  119)
! * MODE_BASE_REG_REG_CLASS:               Register Classes.   (line  125)
  * MODE_CC <1>:                           MODE_CC Condition Codes.
                                                               (line    6)
! * MODE_CC:                               Machine Modes.      (line  275)
! * MODE_CODE_BASE_REG_CLASS:              Register Classes.   (line  133)
! * MODE_COMPLEX_FLOAT:                    Machine Modes.      (line  267)
! * MODE_COMPLEX_INT:                      Machine Modes.      (line  264)
! * MODE_DECIMAL_FLOAT:                    Machine Modes.      (line  244)
! * MODE_FLOAT:                            Machine Modes.      (line  240)
! * MODE_FRACT:                            Machine Modes.      (line  248)
! * MODE_FUNCTION:                         Machine Modes.      (line  271)
! * MODE_INT:                              Machine Modes.      (line  232)
! * MODE_PARTIAL_INT:                      Machine Modes.      (line  236)
! * MODE_POINTER_BOUNDS:                   Machine Modes.      (line  280)
! * MODE_RANDOM:                           Machine Modes.      (line  285)
! * MODE_UACCUM:                           Machine Modes.      (line  260)
! * MODE_UFRACT:                           Machine Modes.      (line  252)
! * MODES_TIEABLE_P:                       Values in Registers.
!                                                              (line  129)
  * modifiers in constraints:              Modifiers.          (line    6)
  * MODIFY_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
! * MODIFY_JNI_METHOD_CALL:                Misc.               (line  877)
! * modM3 instruction pattern:             Standard Names.     (line  269)
! * modulo scheduling:                     RTL passes.         (line  124)
! * MOVE_MAX:                              Misc.               (line  101)
! * MOVE_MAX_PIECES:                       Costs.              (line  200)
! * MOVE_RATIO:                            Costs.              (line  149)
  * movM instruction pattern:              Standard Names.     (line   11)
! * movmemM instruction pattern:           Standard Names.     (line  810)
! * movmisalignM instruction pattern:      Standard Names.     (line  126)
! * movMODEcc instruction pattern:         Standard Names.     (line 1104)
! * movstr instruction pattern:            Standard Names.     (line  845)
! * movstrictM instruction pattern:        Standard Names.     (line  120)
! * msubMN4 instruction pattern:           Standard Names.     (line  514)
! * mulhisi3 instruction pattern:          Standard Names.     (line  467)
! * mulM3 instruction pattern:             Standard Names.     (line  269)
! * mulqihi3 instruction pattern:          Standard Names.     (line  471)
! * mulsidi3 instruction pattern:          Standard Names.     (line  471)
! * mult:                                  Arithmetic.         (line   92)
! * mult and attributes:                   Expressions.        (line   85)
  * mult, canonicalization of:             Insn Canonicalizations.
                                                               (line   27)
! * MULT_EXPR:                             Unary and Binary Expressions.
!                                                              (line    6)
! * MULT_HIGHPART_EXPR:                    Unary and Binary Expressions.
!                                                              (line    6)
  * MULTIARCH_DIRNAME:                     Target Fragment.    (line  170)
! * MULTILIB_DEFAULTS:                     Driver.             (line  253)
  * MULTILIB_DIRNAMES:                     Target Fragment.    (line   44)
  * MULTILIB_EXCEPTIONS:                   Target Fragment.    (line   70)
  * MULTILIB_EXTRA_OPTS:                   Target Fragment.    (line  132)
--- 48805,48960 ----
                                                               (line    6)
  * machine_mode:                          Machine Modes.      (line    6)
  * macros, target description:            Target Macros.      (line    6)
! * maddMN4 instruction pattern:           Standard Names.     (line  486)
  * makefile fragment:                     Fragments.          (line    6)
  * makefile targets:                      Makefile.           (line    6)
! * MAKE_DECL_ONE_ONLY:                    Label Output.       (line  253)
! * make_safe_from:                        Expander Definitions.
!                                                              (line  151)
! * MALLOC_ABI_ALIGNMENT:                  Storage Layout.     (line  173)
  * Manipulating GIMPLE statements:        Manipulating GIMPLE statements.
                                                               (line    6)
  * marking roots:                         GGC Roots.          (line    6)
+ * mark_hook:                             GTY Options.        (line  139)
  * MASK_RETURN_ADDR:                      Exception Region Output.
!                                                              (line   34)
  * Match and Simplify:                    Match and Simplify. (line    6)
! * matching constraint:                   Simple Constraints. (line  140)
! * matching operands:                     Output Template.    (line   49)
  * match_dup:                             RTL Template.       (line   73)
+ * match_dup <1>:                         define_peephole2.   (line   28)
  * match_dup and attributes:              Insn Lengths.       (line   16)
  * match_operand:                         RTL Template.       (line   16)
  * match_operand and attributes:          Expressions.        (line   55)
  * match_operator:                        RTL Template.       (line   95)
! * match_op_dup:                          RTL Template.       (line  163)
  * match_parallel:                        RTL Template.       (line  172)
! * match_par_dup:                         RTL Template.       (line  219)
  * match_scratch:                         RTL Template.       (line   58)
+ * match_scratch <1>:                     define_peephole2.   (line   28)
  * match_test and attributes:             Expressions.        (line   64)
  * math library:                          Soft float library routines.
                                                               (line    6)
  * math, in RTL:                          Arithmetic.         (line    6)
  * matherr:                               Library Calls.      (line   59)
! * MATH_LIBRARY:                          Misc.               (line  502)
! * maxM3 instruction pattern:             Standard Names.     (line  325)
! * MAX_BITSIZE_MODE_ANY_INT:              Machine Modes.      (line  358)
! * MAX_BITSIZE_MODE_ANY_MODE:             Machine Modes.      (line  364)
! * MAX_BITS_PER_WORD:                     Storage Layout.     (line   54)
! * MAX_CONDITIONAL_EXECUTE:               Misc.               (line  524)
! * MAX_FIXED_MODE_SIZE:                   Storage Layout.     (line  436)
! * MAX_MOVE_MAX:                          Misc.               (line  105)
! * MAX_OFILE_ALIGNMENT:                   Storage Layout.     (line  208)
! * MAX_REGS_PER_ADDRESS:                  Addressing Modes.   (line   42)
! * MAX_STACK_ALIGNMENT:                   Storage Layout.     (line  202)
! * maybe_undef:                           GTY Options.        (line  148)
! * may_trap_p, tree_could_trap_p:         Edges.              (line  114)
  * mcount:                                Profiling.          (line   12)
! * MD_EXEC_PREFIX:                        Driver.             (line  267)
! * MD_FALLBACK_FRAME_STATE_FOR:           Exception Handling. (line   93)
! * MD_HANDLE_UNWABI:                      Exception Handling. (line  112)
! * MD_STARTFILE_PREFIX:                   Driver.             (line  295)
! * MD_STARTFILE_PREFIX_1:                 Driver.             (line  300)
! * mem:                                   Regs and Memory.    (line  370)
  * mem and /c:                            Flags.              (line   81)
  * mem and /f:                            Flags.              (line   85)
  * mem and /j:                            Flags.              (line   70)
  * mem and /u:                            Flags.              (line  134)
  * mem and /v:                            Flags.              (line   76)
  * mem, RTL sharing:                      Sharing.            (line   40)
! * memory model:                          Memory model.       (line    6)
! * memory reference, nonoffsettable:      Simple Constraints. (line  254)
! * memory references in constraints:      Simple Constraints. (line   17)
! * memory_barrier instruction pattern:    Standard Names.     (line 1634)
! * MEMORY_MOVE_COST:                      Costs.              (line   53)
! * memory_operand:                        Machine-Independent Predicates.
!                                                              (line   57)
! * MEM_ADDR_SPACE:                        Special Accessors.  (line   48)
  * MEM_ALIAS_SET:                         Special Accessors.  (line    9)
! * MEM_ALIGN:                             Special Accessors.  (line   45)
! * MEM_EXPR:                              Special Accessors.  (line   19)
  * MEM_KEEP_ALIAS_SET_P:                  Flags.              (line   70)
  * MEM_NOTRAP_P:                          Flags.              (line   81)
! * MEM_OFFSET:                            Special Accessors.  (line   31)
! * MEM_OFFSET_KNOWN_P:                    Special Accessors.  (line   27)
  * MEM_POINTER:                           Flags.              (line   85)
  * MEM_READONLY_P:                        Flags.              (line  134)
  * MEM_REF:                               Storage References. (line    6)
! * mem_signal_fenceMODE instruction pattern: Standard Names.  (line 1893)
! * MEM_SIZE:                              Special Accessors.  (line   39)
! * MEM_SIZE_KNOWN_P:                      Special Accessors.  (line   35)
! * mem_thread_fenceMODE instruction pattern: Standard Names.  (line 1885)
  * MEM_VOLATILE_P:                        Flags.              (line   76)
  * METHOD_TYPE:                           Types.              (line    6)
! * MINIMUM_ALIGNMENT:                     Storage Layout.     (line  304)
! * MINIMUM_ATOMIC_ALIGNMENT:              Storage Layout.     (line  181)
! * minM3 instruction pattern:             Standard Names.     (line  325)
! * minus:                                 Arithmetic.         (line   38)
! * minus and attributes:                  Expressions.        (line   83)
  * minus, canonicalization of:            Insn Canonicalizations.
                                                               (line   27)
  * MINUS_EXPR:                            Unary and Binary Expressions.
                                                               (line    6)
+ * MIN_UNITS_PER_WORD:                    Storage Layout.     (line   64)
  * MIPS coprocessor-definition macros:    MIPS Coprocessors.  (line    6)
  * miscellaneous register hooks:          Miscellaneous Register Hooks.
                                                               (line    6)
  * mnemonic attribute:                    Mnemonic Attribute. (line    6)
! * mod:                                   Arithmetic.         (line  136)
! * mod and attributes:                    Expressions.        (line   83)
! * mode classes:                          Machine Modes.      (line  225)
  * mode iterators in .md files:           Mode Iterators.     (line    6)
  * mode switching:                        Mode Switching.     (line    6)
! * MODES_TIEABLE_P:                       Values in Registers.
!                                                              (line  127)
! * MODE_ACCUM:                            Machine Modes.      (line  255)
! * MODE_BASE_REG_CLASS:                   Register Classes.   (line  116)
! * MODE_BASE_REG_REG_CLASS:               Register Classes.   (line  122)
! * MODE_CC:                               Machine Modes.      (line  274)
  * MODE_CC <1>:                           MODE_CC Condition Codes.
                                                               (line    6)
! * MODE_CODE_BASE_REG_CLASS:              Register Classes.   (line  129)
! * MODE_COMPLEX_FLOAT:                    Machine Modes.      (line  266)
! * MODE_COMPLEX_INT:                      Machine Modes.      (line  263)
! * MODE_DECIMAL_FLOAT:                    Machine Modes.      (line  243)
! * MODE_FLOAT:                            Machine Modes.      (line  239)
! * MODE_FRACT:                            Machine Modes.      (line  247)
! * MODE_FUNCTION:                         Machine Modes.      (line  270)
! * MODE_INT:                              Machine Modes.      (line  231)
! * MODE_PARTIAL_INT:                      Machine Modes.      (line  235)
! * MODE_POINTER_BOUNDS:                   Machine Modes.      (line  279)
! * MODE_RANDOM:                           Machine Modes.      (line  284)
! * MODE_UACCUM:                           Machine Modes.      (line  259)
! * MODE_UFRACT:                           Machine Modes.      (line  251)
  * modifiers in constraints:              Modifiers.          (line    6)
  * MODIFY_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
! * MODIFY_JNI_METHOD_CALL:                Misc.               (line  873)
! * modM3 instruction pattern:             Standard Names.     (line  266)
! * modulo scheduling:                     RTL passes.         (line  123)
! * MOVE_MAX:                              Misc.               (line  100)
! * MOVE_MAX_PIECES:                       Costs.              (line  199)
! * MOVE_RATIO:                            Costs.              (line  148)
  * movM instruction pattern:              Standard Names.     (line   11)
! * movmemM instruction pattern:           Standard Names.     (line  805)
! * movmisalignM instruction pattern:      Standard Names.     (line  125)
! * movMODEcc instruction pattern:         Standard Names.     (line 1099)
! * movstr instruction pattern:            Standard Names.     (line  840)
! * movstrictM instruction pattern:        Standard Names.     (line  119)
! * msubMN4 instruction pattern:           Standard Names.     (line  509)
! * mulhisi3 instruction pattern:          Standard Names.     (line  462)
! * mulM3 instruction pattern:             Standard Names.     (line  266)
! * mulqihi3 instruction pattern:          Standard Names.     (line  466)
! * mulsidi3 instruction pattern:          Standard Names.     (line  466)
! * mult:                                  Arithmetic.         (line   93)
! * mult and attributes:                   Expressions.        (line   83)
  * mult, canonicalization of:             Insn Canonicalizations.
                                                               (line   27)
! * mult, canonicalization of <1>:         Insn Canonicalizations.
!                                                              (line   91)
  * MULTIARCH_DIRNAME:                     Target Fragment.    (line  170)
! * MULTILIB_DEFAULTS:                     Driver.             (line  252)
  * MULTILIB_DIRNAMES:                     Target Fragment.    (line   44)
  * MULTILIB_EXCEPTIONS:                   Target Fragment.    (line   70)
  * MULTILIB_EXTRA_OPTS:                   Target Fragment.    (line  132)
*************** Concept Index
*** 49385,49483 ****
  * MULTILIB_REQUIRED:                     Target Fragment.    (line   82)
  * MULTILIB_REUSE:                        Target Fragment.    (line  103)
  * multiple alternative constraints:      Multi-Alternative.  (line    6)
! * MULTIPLE_SYMBOL_SPACES:                Misc.               (line  484)
! * multiplication:                        Arithmetic.         (line   92)
! * multiplication with signed saturation: Arithmetic.         (line   92)
! * multiplication with unsigned saturation: Arithmetic.       (line   92)
! * mulvM4 instruction pattern:            Standard Names.     (line  285)
! * n in constraint:                       Simple Constraints. (line   75)
! * N_REG_CLASSES:                         Register Classes.   (line   83)
  * name:                                  Identifiers.        (line    6)
  * named address spaces:                  Named Address Spaces.
                                                               (line    6)
  * named patterns and conditions:         Patterns.           (line   49)
  * names, pattern:                        Standard Names.     (line    6)
  * namespace, scope:                      Namespaces.         (line    6)
- * NAMESPACE_DECL <1>:                    Namespaces.         (line    6)
  * NAMESPACE_DECL:                        Declarations.       (line    6)
! * NATIVE_SYSTEM_HEADER_COMPONENT:        Driver.             (line  323)
  * ne:                                    Comparisons.        (line   56)
! * ne and attributes:                     Expressions.        (line   85)
! * NE_EXPR:                               Unary and Binary Expressions.
!                                                              (line    6)
! * nearbyintM2 instruction pattern:       Standard Names.     (line  712)
! * neg:                                   Arithmetic.         (line   81)
! * neg and attributes:                    Expressions.        (line   85)
  * neg, canonicalization of:              Insn Canonicalizations.
                                                               (line   27)
  * NEGATE_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
! * negation:                              Arithmetic.         (line   81)
! * negation with signed saturation:       Arithmetic.         (line   81)
! * negation with unsigned saturation:     Arithmetic.         (line   81)
! * negM2 instruction pattern:             Standard Names.     (line  580)
! * negvM3 instruction pattern:            Standard Names.     (line  583)
  * nested functions, trampolines for:     Trampolines.        (line    6)
! * nested_ptr:                            GTY Options.        (line  152)
  * next_bb, prev_bb, FOR_EACH_BB, FOR_ALL_BB: Basic Blocks.   (line   25)
  * NEXT_INSN:                             Insns.              (line   30)
! * NEXT_OBJC_RUNTIME:                     Library Calls.      (line   83)
  * nil:                                   RTL Objects.        (line   73)
  * NM_FLAGS:                              Macros for Initialization.
!                                                              (line  111)
! * NO_DBX_BNSYM_ENSYM:                    DBX Hooks.          (line   26)
! * NO_DBX_FUNCTION_END:                   DBX Hooks.          (line   20)
! * NO_DBX_GCC_MARKER:                     File Names and DBX. (line   28)
! * NO_DBX_MAIN_SOURCE_DIRECTORY:          File Names and DBX. (line   23)
! * NO_DOLLAR_IN_LABEL:                    Label Output.       (line   67)
! * NO_DOT_IN_LABEL:                       Label Output.       (line   73)
! * NO_FUNCTION_CSE:                       Costs.              (line  269)
! * NO_IMPLICIT_EXTERN_C:                  Misc.               (line  382)
! * NO_PROFILE_COUNTERS:                   Profiling.          (line   28)
! * NO_REGS:                               Register Classes.   (line   17)
! * NON_LVALUE_EXPR:                       Unary and Binary Expressions.
!                                                              (line    6)
  * nondeterministic finite state automaton: Processor pipeline description.
!                                                              (line  305)
  * nonimmediate_operand:                  Machine-Independent Predicates.
!                                                              (line  101)
! * nonlocal goto handler:                 Edges.              (line  172)
! * nonlocal_goto instruction pattern:     Standard Names.     (line 1476)
  * nonlocal_goto_receiver instruction pattern: Standard Names.
!                                                              (line 1493)
  * nonmemory_operand:                     Machine-Independent Predicates.
!                                                              (line   97)
! * nonoffsettable memory reference:       Simple Constraints. (line  256)
! * nop instruction pattern:               Standard Names.     (line 1287)
  * NOP_EXPR:                              Unary and Binary Expressions.
                                                               (line    6)
  * normal predicates:                     Predicates.         (line   31)
! * not:                                   Arithmetic.         (line  153)
  * not and attributes:                    Expressions.        (line   50)
  * not equal:                             Comparisons.        (line   56)
  * not, canonicalization of:              Insn Canonicalizations.
                                                               (line   27)
! * note:                                  Insns.              (line  185)
  * note and /i:                           Flags.              (line   59)
  * note and /v:                           Flags.              (line   44)
  * NOTE_INSN_BASIC_BLOCK:                 Basic Blocks.       (line   50)
! * NOTE_INSN_BLOCK_BEG:                   Insns.              (line  210)
! * NOTE_INSN_BLOCK_END:                   Insns.              (line  210)
! * NOTE_INSN_DELETED:                     Insns.              (line  200)
! * NOTE_INSN_DELETED_LABEL:               Insns.              (line  205)
! * NOTE_INSN_EH_REGION_BEG:               Insns.              (line  216)
! * NOTE_INSN_EH_REGION_END:               Insns.              (line  216)
! * NOTE_INSN_FUNCTION_BEG:                Insns.              (line  223)
! * NOTE_INSN_VAR_LOCATION:                Insns.              (line  227)
! * NOTE_LINE_NUMBER:                      Insns.              (line  185)
! * NOTE_SOURCE_FILE:                      Insns.              (line  185)
! * NOTE_VAR_LOCATION:                     Insns.              (line  227)
  * NOTICE_UPDATE_CC:                      CC0 Condition Codes.
!                                                              (line   31)
! * NUM_MACHINE_MODES:                     Machine Modes.      (line  298)
! * NUM_MODES_FOR_MODE_SWITCHING:          Mode Switching.     (line   31)
  * Number of iterations analysis:         Number of iterations.
                                                               (line    6)
  * o in constraint:                       Simple Constraints. (line   23)
  * OACC_CACHE:                            OpenACC.            (line    6)
  * OACC_DATA:                             OpenACC.            (line    6)
--- 48964,49067 ----
  * MULTILIB_REQUIRED:                     Target Fragment.    (line   82)
  * MULTILIB_REUSE:                        Target Fragment.    (line  103)
  * multiple alternative constraints:      Multi-Alternative.  (line    6)
! * MULTIPLE_SYMBOL_SPACES:                Misc.               (line  482)
! * multiplication:                        Arithmetic.         (line   93)
! * multiplication with signed saturation: Arithmetic.         (line   93)
! * multiplication with unsigned saturation: Arithmetic.       (line   93)
! * MULT_EXPR:                             Unary and Binary Expressions.
!                                                              (line    6)
! * MULT_HIGHPART_EXPR:                    Unary and Binary Expressions.
!                                                              (line    6)
! * mulvM4 instruction pattern:            Standard Names.     (line  282)
! * n in constraint:                       Simple Constraints. (line   73)
  * name:                                  Identifiers.        (line    6)
  * named address spaces:                  Named Address Spaces.
                                                               (line    6)
  * named patterns and conditions:         Patterns.           (line   49)
  * names, pattern:                        Standard Names.     (line    6)
  * namespace, scope:                      Namespaces.         (line    6)
  * NAMESPACE_DECL:                        Declarations.       (line    6)
! * NAMESPACE_DECL <1>:                    Namespaces.         (line    6)
! * NATIVE_SYSTEM_HEADER_COMPONENT:        Driver.             (line  322)
  * ne:                                    Comparisons.        (line   56)
! * ne and attributes:                     Expressions.        (line   83)
! * nearbyintM2 instruction pattern:       Standard Names.     (line  707)
! * neg:                                   Arithmetic.         (line   82)
! * neg and attributes:                    Expressions.        (line   83)
  * neg, canonicalization of:              Insn Canonicalizations.
                                                               (line   27)
  * NEGATE_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
! * negation:                              Arithmetic.         (line   82)
! * negation with signed saturation:       Arithmetic.         (line   82)
! * negation with unsigned saturation:     Arithmetic.         (line   82)
! * negM2 instruction pattern:             Standard Names.     (line  575)
! * negvM3 instruction pattern:            Standard Names.     (line  578)
  * nested functions, trampolines for:     Trampolines.        (line    6)
! * nested_ptr:                            GTY Options.        (line  156)
  * next_bb, prev_bb, FOR_EACH_BB, FOR_ALL_BB: Basic Blocks.   (line   25)
  * NEXT_INSN:                             Insns.              (line   30)
! * NEXT_OBJC_RUNTIME:                     Library Calls.      (line   82)
! * NE_EXPR:                               Unary and Binary Expressions.
!                                                              (line    6)
  * nil:                                   RTL Objects.        (line   73)
  * NM_FLAGS:                              Macros for Initialization.
!                                                              (line  110)
  * nondeterministic finite state automaton: Processor pipeline description.
!                                                              (line  304)
  * nonimmediate_operand:                  Machine-Independent Predicates.
!                                                              (line  100)
! * nonlocal goto handler:                 Edges.              (line  171)
! * nonlocal_goto instruction pattern:     Standard Names.     (line 1468)
  * nonlocal_goto_receiver instruction pattern: Standard Names.
!                                                              (line 1485)
  * nonmemory_operand:                     Machine-Independent Predicates.
!                                                              (line   96)
! * nonoffsettable memory reference:       Simple Constraints. (line  254)
! * NON_LVALUE_EXPR:                       Unary and Binary Expressions.
!                                                              (line    6)
! * nop instruction pattern:               Standard Names.     (line 1281)
  * NOP_EXPR:                              Unary and Binary Expressions.
                                                               (line    6)
  * normal predicates:                     Predicates.         (line   31)
! * not:                                   Arithmetic.         (line  154)
  * not and attributes:                    Expressions.        (line   50)
  * not equal:                             Comparisons.        (line   56)
  * not, canonicalization of:              Insn Canonicalizations.
                                                               (line   27)
! * note:                                  Insns.              (line  183)
  * note and /i:                           Flags.              (line   59)
  * note and /v:                           Flags.              (line   44)
  * NOTE_INSN_BASIC_BLOCK:                 Basic Blocks.       (line   50)
! * NOTE_INSN_BASIC_BLOCK <1>:             Basic Blocks.       (line   52)
! * NOTE_INSN_BLOCK_BEG:                   Insns.              (line  208)
! * NOTE_INSN_BLOCK_END:                   Insns.              (line  208)
! * NOTE_INSN_DELETED:                     Insns.              (line  198)
! * NOTE_INSN_DELETED_LABEL:               Insns.              (line  203)
! * NOTE_INSN_EH_REGION_BEG:               Insns.              (line  214)
! * NOTE_INSN_EH_REGION_END:               Insns.              (line  214)
! * NOTE_INSN_FUNCTION_BEG:                Insns.              (line  221)
! * NOTE_INSN_VAR_LOCATION:                Insns.              (line  225)
! * NOTE_LINE_NUMBER:                      Insns.              (line  183)
! * NOTE_SOURCE_FILE:                      Insns.              (line  183)
! * NOTE_VAR_LOCATION:                     Insns.              (line  225)
  * NOTICE_UPDATE_CC:                      CC0 Condition Codes.
!                                                              (line   30)
! * NO_DBX_BNSYM_ENSYM:                    DBX Hooks.          (line   25)
! * NO_DBX_FUNCTION_END:                   DBX Hooks.          (line   19)
! * NO_DBX_GCC_MARKER:                     File Names and DBX. (line   27)
! * NO_DBX_MAIN_SOURCE_DIRECTORY:          File Names and DBX. (line   22)
! * NO_DOLLAR_IN_LABEL:                    Label Output.       (line   64)
! * NO_DOT_IN_LABEL:                       Label Output.       (line   70)
! * NO_FUNCTION_CSE:                       Costs.              (line  268)
! * NO_IMPLICIT_EXTERN_C:                  Misc.               (line  381)
! * NO_PROFILE_COUNTERS:                   Profiling.          (line   27)
! * NO_REGS:                               Register Classes.   (line   17)
  * Number of iterations analysis:         Number of iterations.
                                                               (line    6)
+ * NUM_MACHINE_MODES:                     Machine Modes.      (line  297)
+ * NUM_MODES_FOR_MODE_SWITCHING:          Mode Switching.     (line   30)
+ * N_REG_CLASSES:                         Register Classes.   (line   81)
  * o in constraint:                       Simple Constraints. (line   23)
  * OACC_CACHE:                            OpenACC.            (line    6)
  * OACC_DATA:                             OpenACC.            (line    6)
*************** Concept Index
*** 49489,49500 ****
  * OACC_LOOP:                             OpenACC.            (line    6)
  * OACC_PARALLEL:                         OpenACC.            (line    6)
  * OACC_UPDATE:                           OpenACC.            (line    6)
! * OBJC_GEN_METHOD_LABEL:                 Label Output.       (line  459)
! * OBJC_JBLEN:                            Misc.               (line 1099)
  * OBJECT_FORMAT_COFF:                    Macros for Initialization.
!                                                              (line   97)
! * OFFSET_TYPE:                           Types.              (line    6)
  * offsettable address:                   Simple Constraints. (line   23)
  * OImode:                                Machine Modes.      (line   51)
  * Omega a solver for linear programming problems: Omega.     (line    6)
  * OMP_ATOMIC:                            OpenMP.             (line    6)
--- 49073,49084 ----
  * OACC_LOOP:                             OpenACC.            (line    6)
  * OACC_PARALLEL:                         OpenACC.            (line    6)
  * OACC_UPDATE:                           OpenACC.            (line    6)
! * OBJC_GEN_METHOD_LABEL:                 Label Output.       (line  454)
! * OBJC_JBLEN:                            Misc.               (line 1092)
  * OBJECT_FORMAT_COFF:                    Macros for Initialization.
!                                                              (line   96)
  * offsettable address:                   Simple Constraints. (line   23)
+ * OFFSET_TYPE:                           Types.              (line    6)
  * OImode:                                Machine Modes.      (line   51)
  * Omega a solver for linear programming problems: Omega.     (line    6)
  * OMP_ATOMIC:                            OpenMP.             (line    6)
*************** Concept Index
*** 49509,49524 ****
  * OMP_SECTION:                           OpenMP.             (line    6)
  * OMP_SECTIONS:                          OpenMP.             (line    6)
  * OMP_SINGLE:                            OpenMP.             (line    6)
! * one_cmplM2 instruction pattern:        Standard Names.     (line  807)
  * operand access:                        Accessors.          (line    6)
! * Operand Access Routines:               SSA Operands.       (line  119)
  * operand constraints:                   Constraints.        (line    6)
! * Operand Iterators:                     SSA Operands.       (line  119)
  * operand predicates:                    Predicates.         (line    6)
  * operand substitution:                  Output Template.    (line    6)
- * operands <1>:                          Patterns.           (line   55)
- * operands:                              SSA Operands.       (line    6)
  * Operands:                              Operands.           (line    6)
  * operator predicates:                   Predicates.         (line    6)
  * optc-gen.awk:                          Options.            (line    6)
  * OPTGROUP_ALL:                          Optimization groups.
--- 49093,49108 ----
  * OMP_SECTION:                           OpenMP.             (line    6)
  * OMP_SECTIONS:                          OpenMP.             (line    6)
  * OMP_SINGLE:                            OpenMP.             (line    6)
! * one_cmplM2 instruction pattern:        Standard Names.     (line  802)
  * operand access:                        Accessors.          (line    6)
! * Operand Access Routines:               SSA Operands.       (line  116)
  * operand constraints:                   Constraints.        (line    6)
! * Operand Iterators:                     SSA Operands.       (line  116)
  * operand predicates:                    Predicates.         (line    6)
  * operand substitution:                  Output Template.    (line    6)
  * Operands:                              Operands.           (line    6)
+ * operands:                              SSA Operands.       (line    6)
+ * operands <1>:                          Patterns.           (line   55)
  * operator predicates:                   Predicates.         (line    6)
  * optc-gen.awk:                          Options.            (line    6)
  * OPTGROUP_ALL:                          Optimization groups.
*************** Concept Index
*** 49539,49599 ****
  * optimization info file names:          Dump files and streams.
                                                               (line    6)
  * Optimization infrastructure for GIMPLE: Tree SSA.          (line    6)
! * OPTIMIZE_MODE_SWITCHING:               Mode Switching.     (line    9)
  * option specification files:            Options.            (line    6)
- * OPTION_DEFAULT_SPECS:                  Driver.             (line   26)
  * optional hardware or system features:  Run-time Target.    (line   59)
! * options, directory search:             Including Patterns. (line   44)
  * order of register allocation:          Allocation Order.   (line    6)
  * ordered_comparison_operator:           Machine-Independent Predicates.
!                                                              (line  116)
  * ORDERED_EXPR:                          Unary and Binary Expressions.
                                                               (line    6)
  * Ordering of Patterns:                  Pattern Ordering.   (line    6)
! * ORIGINAL_REGNO:                        Special Accessors.  (line   54)
! * other register constraints:            Simple Constraints. (line  173)
  * outgoing_args_size:                    Stack Arguments.    (line   48)
! * OUTGOING_REG_PARM_STACK_SPACE:         Stack Arguments.    (line   80)
! * OUTGOING_REGNO:                        Register Basics.    (line   94)
  * output of assembler code:              File Framework.     (line    6)
  * output statements:                     Output Statement.   (line    6)
  * output templates:                      Output Template.    (line    6)
! * output_asm_insn:                       Output Statement.   (line   53)
! * OUTPUT_QUOTED_STRING:                  File Framework.     (line  108)
! * OVERLAPPING_REGISTER_NAMES:            Instruction Output. (line   21)
  * OVERLOAD:                              Functions for C++.  (line    6)
! * OVERRIDE_ABI_FORMAT:                   Register Arguments. (line  155)
  * OVL_CURRENT:                           Functions for C++.  (line    6)
  * OVL_NEXT:                              Functions for C++.  (line    6)
! * p in constraint:                       Simple Constraints. (line  164)
! * PAD_VARARGS_DOWN:                      Register Arguments. (line  236)
  * parallel:                              Side Effects.       (line  210)
  * parameters, c++ abi:                   C++ ABI.            (line    6)
  * parameters, miscellaneous:             Misc.               (line    6)
  * parameters, precompiled headers:       PCH Target.         (line    6)
  * parity:                                Arithmetic.         (line  242)
! * parityM2 instruction pattern:          Standard Names.     (line  800)
! * PARM_BOUNDARY:                         Storage Layout.     (line  135)
  * PARM_DECL:                             Declarations.       (line    6)
  * PARSE_LDD_OUTPUT:                      Macros for Initialization.
!                                                              (line  127)
  * pass dumps:                            Passes.             (line    6)
- * pass_duplicate_computed_gotos:         Edges.              (line  162)
  * passes and files of the compiler:      Passes.             (line    6)
  * passing arguments:                     Interface.          (line   36)
  * PATH_SEPARATOR:                        Filesystem.         (line   31)
! * PATTERN:                               Insns.              (line  288)
  * pattern conditions:                    Patterns.           (line   43)
  * pattern names:                         Standard Names.     (line    6)
  * Pattern Ordering:                      Pattern Ordering.   (line    6)
  * patterns:                              Patterns.           (line    6)
! * pc:                                    Regs and Memory.    (line  361)
  * pc and attributes:                     Insn Lengths.       (line   20)
  * pc, RTL sharing:                       Sharing.            (line   25)
! * PC_REGNUM:                             Register Basics.    (line  108)
! * pc_rtx:                                Regs and Memory.    (line  366)
! * PCC_BITFIELD_TYPE_MATTERS:             Storage Layout.     (line  334)
! * PCC_STATIC_STRUCT_RETURN:              Aggregate Return.   (line   65)
  * PDImode:                               Machine Modes.      (line   40)
  * peephole optimization, RTL representation: Side Effects.   (line  244)
  * peephole optimizer definitions:        Peephole Definitions.
--- 49123,49183 ----
  * optimization info file names:          Dump files and streams.
                                                               (line    6)
  * Optimization infrastructure for GIMPLE: Tree SSA.          (line    6)
! * OPTIMIZE_MODE_SWITCHING:               Mode Switching.     (line    8)
  * option specification files:            Options.            (line    6)
  * optional hardware or system features:  Run-time Target.    (line   59)
! * options, directory search:             Including Patterns. (line   47)
! * OPTION_DEFAULT_SPECS:                  Driver.             (line   25)
  * order of register allocation:          Allocation Order.   (line    6)
  * ordered_comparison_operator:           Machine-Independent Predicates.
!                                                              (line  115)
  * ORDERED_EXPR:                          Unary and Binary Expressions.
                                                               (line    6)
  * Ordering of Patterns:                  Pattern Ordering.   (line    6)
! * ORIGINAL_REGNO:                        Special Accessors.  (line   53)
! * other register constraints:            Simple Constraints. (line  171)
  * outgoing_args_size:                    Stack Arguments.    (line   48)
! * OUTGOING_REGNO:                        Register Basics.    (line   93)
! * OUTGOING_REG_PARM_STACK_SPACE:         Stack Arguments.    (line   79)
  * output of assembler code:              File Framework.     (line    6)
  * output statements:                     Output Statement.   (line    6)
  * output templates:                      Output Template.    (line    6)
! * output_asm_insn:                       Output Statement.   (line   52)
! * OUTPUT_QUOTED_STRING:                  File Framework.     (line  106)
! * OVERLAPPING_REGISTER_NAMES:            Instruction Output. (line   20)
  * OVERLOAD:                              Functions for C++.  (line    6)
! * OVERRIDE_ABI_FORMAT:                   Register Arguments. (line  153)
  * OVL_CURRENT:                           Functions for C++.  (line    6)
  * OVL_NEXT:                              Functions for C++.  (line    6)
! * p in constraint:                       Simple Constraints. (line  162)
! * PAD_VARARGS_DOWN:                      Register Arguments. (line  234)
  * parallel:                              Side Effects.       (line  210)
  * parameters, c++ abi:                   C++ ABI.            (line    6)
  * parameters, miscellaneous:             Misc.               (line    6)
  * parameters, precompiled headers:       PCH Target.         (line    6)
  * parity:                                Arithmetic.         (line  242)
! * parityM2 instruction pattern:          Standard Names.     (line  795)
! * PARM_BOUNDARY:                         Storage Layout.     (line  133)
  * PARM_DECL:                             Declarations.       (line    6)
  * PARSE_LDD_OUTPUT:                      Macros for Initialization.
!                                                              (line  125)
  * pass dumps:                            Passes.             (line    6)
  * passes and files of the compiler:      Passes.             (line    6)
  * passing arguments:                     Interface.          (line   36)
+ * pass_duplicate_computed_gotos:         Edges.              (line  161)
  * PATH_SEPARATOR:                        Filesystem.         (line   31)
! * PATTERN:                               Insns.              (line  284)
  * pattern conditions:                    Patterns.           (line   43)
  * pattern names:                         Standard Names.     (line    6)
  * Pattern Ordering:                      Pattern Ordering.   (line    6)
  * patterns:                              Patterns.           (line    6)
! * pc:                                    Regs and Memory.    (line  357)
  * pc and attributes:                     Insn Lengths.       (line   20)
  * pc, RTL sharing:                       Sharing.            (line   25)
! * PCC_BITFIELD_TYPE_MATTERS:             Storage Layout.     (line  330)
! * PCC_STATIC_STRUCT_RETURN:              Aggregate Return.   (line   64)
! * PC_REGNUM:                             Register Basics.    (line  107)
! * pc_rtx:                                Regs and Memory.    (line  362)
  * PDImode:                               Machine Modes.      (line   40)
  * peephole optimization, RTL representation: Side Effects.   (line  244)
  * peephole optimizer definitions:        Peephole Definitions.
*************** Concept Index
*** 49602,49650 ****
  * percent sign:                          Output Template.    (line    6)
  * PHI nodes:                             SSA.                (line   31)
  * PIC:                                   PIC.                (line    6)
! * PIC_OFFSET_TABLE_REG_CALL_CLOBBERED:   PIC.                (line   26)
! * PIC_OFFSET_TABLE_REGNUM:               PIC.                (line   16)
  * pipeline hazard recognizer:            Processor pipeline description.
                                                               (line    6)
  * Plugins:                               Plugins.            (line    6)
  * plus:                                  Arithmetic.         (line   14)
! * plus and attributes:                   Expressions.        (line   85)
  * plus, canonicalization of:             Insn Canonicalizations.
                                                               (line   27)
  * PLUS_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * Pmode:                                 Misc.               (line  330)
  * pmode_register_operand:                Machine-Independent Predicates.
!                                                              (line   35)
  * pointer:                               Types.              (line    6)
  * POINTER_PLUS_EXPR:                     Unary and Binary Expressions.
                                                               (line    6)
! * POINTER_SIZE:                          Storage Layout.     (line   71)
  * POINTER_TYPE:                          Types.              (line    6)
- * POINTERS_EXTEND_UNSIGNED:              Storage Layout.     (line   77)
- * pop_operand:                           Machine-Independent Predicates.
-                                                              (line   88)
  * popcount:                              Arithmetic.         (line  238)
! * popcountM2 instruction pattern:        Standard Names.     (line  794)
! * pops_args:                             Function Entry.     (line  106)
  * portability:                           Portability.        (line    6)
  * position independent code:             PIC.                (line    6)
  * post_dec:                              Incdec.             (line   25)
  * post_inc:                              Incdec.             (line   30)
  * post_modify:                           Incdec.             (line   33)
  * post_order_compute, inverted_post_order_compute, walk_dominator_tree: Basic Blocks.
                                                               (line   34)
! * POSTDECREMENT_EXPR:                    Unary and Binary Expressions.
!                                                              (line    6)
! * POSTINCREMENT_EXPR:                    Unary and Binary Expressions.
!                                                              (line    6)
! * POWI_MAX_MULTS:                        Misc.               (line  967)
! * powM3 instruction pattern:             Standard Names.     (line  661)
  * pragma:                                Misc.               (line  387)
- * pre_dec:                               Incdec.             (line    8)
- * PRE_GCC3_DWARF_FRAME_REGISTERS:        Frame Registers.    (line  127)
- * pre_inc:                               Incdec.             (line   22)
- * pre_modify:                            Incdec.             (line   51)
  * PREDECREMENT_EXPR:                     Unary and Binary Expressions.
                                                               (line    6)
  * predefined macros:                     Run-time Target.    (line    6)
--- 49186,49232 ----
  * percent sign:                          Output Template.    (line    6)
  * PHI nodes:                             SSA.                (line   31)
  * PIC:                                   PIC.                (line    6)
! * PIC_OFFSET_TABLE_REGNUM:               PIC.                (line   15)
! * PIC_OFFSET_TABLE_REG_CALL_CLOBBERED:   PIC.                (line   25)
  * pipeline hazard recognizer:            Processor pipeline description.
                                                               (line    6)
+ * pipeline hazard recognizer <1>:        Processor pipeline description.
+                                                              (line   53)
  * Plugins:                               Plugins.            (line    6)
  * plus:                                  Arithmetic.         (line   14)
! * plus and attributes:                   Expressions.        (line   83)
  * plus, canonicalization of:             Insn Canonicalizations.
                                                               (line   27)
  * PLUS_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * Pmode:                                 Misc.               (line  329)
  * pmode_register_operand:                Machine-Independent Predicates.
!                                                              (line   34)
  * pointer:                               Types.              (line    6)
+ * POINTERS_EXTEND_UNSIGNED:              Storage Layout.     (line   76)
  * POINTER_PLUS_EXPR:                     Unary and Binary Expressions.
                                                               (line    6)
! * POINTER_SIZE:                          Storage Layout.     (line   70)
  * POINTER_TYPE:                          Types.              (line    6)
  * popcount:                              Arithmetic.         (line  238)
! * popcountM2 instruction pattern:        Standard Names.     (line  789)
! * pops_args:                             Function Entry.     (line  104)
! * pop_operand:                           Machine-Independent Predicates.
!                                                              (line   87)
  * portability:                           Portability.        (line    6)
  * position independent code:             PIC.                (line    6)
+ * POSTDECREMENT_EXPR:                    Unary and Binary Expressions.
+                                                              (line    6)
+ * POSTINCREMENT_EXPR:                    Unary and Binary Expressions.
+                                                              (line    6)
  * post_dec:                              Incdec.             (line   25)
  * post_inc:                              Incdec.             (line   30)
  * post_modify:                           Incdec.             (line   33)
  * post_order_compute, inverted_post_order_compute, walk_dominator_tree: Basic Blocks.
                                                               (line   34)
! * POWI_MAX_MULTS:                        Misc.               (line  961)
! * powM3 instruction pattern:             Standard Names.     (line  656)
  * pragma:                                Misc.               (line  387)
  * PREDECREMENT_EXPR:                     Unary and Binary Expressions.
                                                               (line    6)
  * predefined macros:                     Run-time Target.    (line    6)
*************** Concept Index
*** 49654,49775 ****
                                                               (line    6)
  * predict.def:                           Profile information.
                                                               (line   24)
! * PREFERRED_DEBUGGING_TYPE:              All Debuggers.      (line   42)
! * PREFERRED_RELOAD_CLASS:                Register Classes.   (line  253)
! * PREFERRED_STACK_BOUNDARY:              Storage Layout.     (line  149)
! * prefetch:                              Side Effects.       (line  325)
  * prefetch and /v:                       Flags.              (line  214)
! * prefetch instruction pattern:          Standard Names.     (line 1621)
  * PREFETCH_SCHEDULE_BARRIER_P:           Flags.              (line  214)
  * PREINCREMENT_EXPR:                     Unary and Binary Expressions.
                                                               (line    6)
  * presence_set:                          Processor pipeline description.
!                                                              (line  224)
  * preserving SSA form:                   SSA.                (line   74)
  * preserving virtual SSA form:           SSA.                (line  182)
! * pretend_args_size:                     Function Entry.     (line  112)
  * prev_active_insn:                      define_peephole.    (line   60)
  * PREV_INSN:                             Insns.              (line   26)
! * PRINT_OPERAND:                         Instruction Output. (line   96)
! * PRINT_OPERAND_ADDRESS:                 Instruction Output. (line  124)
! * PRINT_OPERAND_PUNCT_VALID_P:           Instruction Output. (line  117)
! * probe_stack instruction pattern:       Standard Names.     (line 1468)
! * probe_stack_address instruction pattern: Standard Names.   (line 1461)
  * processor functional units:            Processor pipeline description.
                                                               (line    6)
  * processor pipeline description:        Processor pipeline description.
                                                               (line    6)
! * product:                               Arithmetic.         (line   92)
  * profile feedback:                      Profile information.
                                                               (line   14)
  * profile representation:                Profile information.
                                                               (line    6)
! * PROFILE_BEFORE_PROLOGUE:               Profiling.          (line   35)
! * PROFILE_HOOK:                          Profiling.          (line   23)
  * profiling, code generation:            Profiling.          (line    6)
! * program counter:                       Regs and Memory.    (line  362)
  * prologue:                              Function Entry.     (line    6)
! * prologue instruction pattern:          Standard Names.     (line 1559)
! * PROMOTE_MODE:                          Storage Layout.     (line   88)
  * pseudo registers:                      Regs and Memory.    (line    9)
  * PSImode:                               Machine Modes.      (line   32)
! * PTRDIFF_TYPE:                          Type Layout.        (line  164)
  * purge_dead_edges <1>:                  Maintaining the CFG.
-                                                              (line   82)
- * purge_dead_edges:                      Edges.              (line  104)
- * push address instruction:              Simple Constraints. (line  164)
- * PUSH_ARGS:                             Stack Arguments.    (line   18)
- * PUSH_ARGS_REVERSED:                    Stack Arguments.    (line   26)
- * push_operand:                          Machine-Independent Predicates.
                                                               (line   81)
! * push_reload:                           Addressing Modes.   (line  177)
! * PUSH_ROUNDING:                         Stack Arguments.    (line   32)
! * pushM1 instruction pattern:            Standard Names.     (line  256)
  * PUT_CODE:                              RTL Objects.        (line   47)
! * PUT_MODE:                              Machine Modes.      (line  295)
! * PUT_REG_NOTE_KIND:                     Insns.              (line  352)
! * PUT_SDB_:                              SDB and DWARF.      (line  110)
! * QCmode:                                Machine Modes.      (line  200)
  * QFmode:                                Machine Modes.      (line   57)
  * QImode:                                Machine Modes.      (line   25)
! * QImode, in insn:                       Insns.              (line  272)
  * QQmode:                                Machine Modes.      (line  106)
- * qualified type <1>:                    Types for C++.      (line    6)
  * qualified type:                        Types.              (line    6)
  * querying function unit reservations:   Processor pipeline description.
                                                               (line   90)
  * question mark:                         Multi-Alternative.  (line   41)
! * quotient:                              Arithmetic.         (line  115)
! * r in constraint:                       Simple Constraints. (line   66)
  * RDIV_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * READONLY_DATA_SECTION_ASM_OP:          Sections.           (line   63)
  * real operands:                         SSA Operands.       (line    6)
! * REAL_ARITHMETIC:                       Floating Point.     (line   66)
  * REAL_CST:                              Constant expressions.
                                                               (line    6)
! * REAL_LIBGCC_SPEC:                      Driver.             (line  125)
  * REAL_NM_FILE_NAME:                     Macros for Initialization.
!                                                              (line  106)
  * REAL_TYPE:                             Types.              (line    6)
! * REAL_VALUE_ABS:                        Floating Point.     (line   82)
! * REAL_VALUE_ATOF:                       Floating Point.     (line   50)
! * REAL_VALUE_FIX:                        Floating Point.     (line   41)
! * REAL_VALUE_ISINF:                      Floating Point.     (line   59)
! * REAL_VALUE_ISNAN:                      Floating Point.     (line   62)
! * REAL_VALUE_NEGATE:                     Floating Point.     (line   79)
! * REAL_VALUE_NEGATIVE:                   Floating Point.     (line   56)
! * REAL_VALUE_TO_TARGET_DECIMAL128:       Data Output.        (line  149)
! * REAL_VALUE_TO_TARGET_DECIMAL32:        Data Output.        (line  147)
! * REAL_VALUE_TO_TARGET_DECIMAL64:        Data Output.        (line  148)
! * REAL_VALUE_TO_TARGET_DOUBLE:           Data Output.        (line  145)
! * REAL_VALUE_TO_TARGET_LONG_DOUBLE:      Data Output.        (line  146)
! * REAL_VALUE_TO_TARGET_SINGLE:           Data Output.        (line  144)
! * REAL_VALUE_TYPE:                       Floating Point.     (line   26)
! * REAL_VALUE_UNSIGNED_FIX:               Floating Point.     (line   45)
! * REAL_VALUES_EQUAL:                     Floating Point.     (line   32)
! * REAL_VALUES_LESS:                      Floating Point.     (line   38)
! * REALPART_EXPR:                         Unary and Binary Expressions.
!                                                              (line    6)
! * recog_data.operand:                    Instruction Output. (line   54)
  * recognizing insns:                     RTL Template.       (line    6)
! * RECORD_TYPE <1>:                       Classes.            (line    6)
  * RECORD_TYPE:                           Types.              (line    6)
  * redirect_edge_and_branch:              Profile information.
                                                               (line   71)
  * redirect_edge_and_branch, redirect_jump: Maintaining the CFG.
!                                                              (line   92)
! * reduc_plus_scal_M instruction pattern: Standard Names.     (line  367)
! * reduc_smax_M instruction pattern:      Standard Names.     (line  334)
! * reduc_smax_scal_M instruction pattern: Standard Names.     (line  357)
! * reduc_smin_M instruction pattern:      Standard Names.     (line  334)
! * reduc_smin_scal_M instruction pattern: Standard Names.     (line  357)
! * reduc_splus_M instruction pattern:     Standard Names.     (line  350)
! * reduc_umax_M instruction pattern:      Standard Names.     (line  342)
! * reduc_umax_scal_M instruction pattern: Standard Names.     (line  362)
! * reduc_umin_M instruction pattern:      Standard Names.     (line  342)
! * reduc_umin_scal_M instruction pattern: Standard Names.     (line  362)
! * reduc_uplus_M instruction pattern:     Standard Names.     (line  350)
  * reference:                             Types.              (line    6)
  * REFERENCE_TYPE:                        Types.              (line    6)
  * reg:                                   Regs and Memory.    (line    9)
--- 49236,49363 ----
                                                               (line    6)
  * predict.def:                           Profile information.
                                                               (line   24)
! * PREFERRED_DEBUGGING_TYPE:              All Debuggers.      (line   41)
! * PREFERRED_RELOAD_CLASS:                Register Classes.   (line  249)
! * PREFERRED_STACK_BOUNDARY:              Storage Layout.     (line  147)
! * prefetch:                              Side Effects.       (line  324)
  * prefetch and /v:                       Flags.              (line  214)
! * prefetch instruction pattern:          Standard Names.     (line 1611)
  * PREFETCH_SCHEDULE_BARRIER_P:           Flags.              (line  214)
  * PREINCREMENT_EXPR:                     Unary and Binary Expressions.
                                                               (line    6)
  * presence_set:                          Processor pipeline description.
!                                                              (line  223)
  * preserving SSA form:                   SSA.                (line   74)
  * preserving virtual SSA form:           SSA.                (line  182)
! * pretend_args_size:                     Function Entry.     (line  110)
  * prev_active_insn:                      define_peephole.    (line   60)
  * PREV_INSN:                             Insns.              (line   26)
! * pre_dec:                               Incdec.             (line    8)
! * PRE_GCC3_DWARF_FRAME_REGISTERS:        Frame Registers.    (line  126)
! * pre_inc:                               Incdec.             (line   22)
! * pre_modify:                            Incdec.             (line   52)
! * PRINT_OPERAND:                         Instruction Output. (line   95)
! * PRINT_OPERAND_ADDRESS:                 Instruction Output. (line  122)
! * PRINT_OPERAND_PUNCT_VALID_P:           Instruction Output. (line  115)
! * probe_stack instruction pattern:       Standard Names.     (line 1460)
! * probe_stack_address instruction pattern: Standard Names.   (line 1453)
  * processor functional units:            Processor pipeline description.
                                                               (line    6)
+ * processor functional units <1>:        Processor pipeline description.
+                                                              (line   68)
  * processor pipeline description:        Processor pipeline description.
                                                               (line    6)
! * product:                               Arithmetic.         (line   93)
  * profile feedback:                      Profile information.
                                                               (line   14)
  * profile representation:                Profile information.
                                                               (line    6)
! * PROFILE_BEFORE_PROLOGUE:               Profiling.          (line   34)
! * PROFILE_HOOK:                          Profiling.          (line   22)
  * profiling, code generation:            Profiling.          (line    6)
! * program counter:                       Regs and Memory.    (line  358)
  * prologue:                              Function Entry.     (line    6)
! * prologue instruction pattern:          Standard Names.     (line 1549)
! * PROMOTE_MODE:                          Storage Layout.     (line   87)
  * pseudo registers:                      Regs and Memory.    (line    9)
  * PSImode:                               Machine Modes.      (line   32)
! * PTRDIFF_TYPE:                          Type Layout.        (line  163)
! * purge_dead_edges:                      Edges.              (line  103)
  * purge_dead_edges <1>:                  Maintaining the CFG.
                                                               (line   81)
! * push address instruction:              Simple Constraints. (line  162)
! * pushM1 instruction pattern:            Standard Names.     (line  253)
! * PUSH_ARGS:                             Stack Arguments.    (line   17)
! * PUSH_ARGS_REVERSED:                    Stack Arguments.    (line   25)
! * push_operand:                          Machine-Independent Predicates.
!                                                              (line   80)
! * push_reload:                           Addressing Modes.   (line  176)
! * PUSH_ROUNDING:                         Stack Arguments.    (line   31)
  * PUT_CODE:                              RTL Objects.        (line   47)
! * PUT_MODE:                              Machine Modes.      (line  294)
! * PUT_REG_NOTE_KIND:                     Insns.              (line  346)
! * PUT_SDB_...:                           SDB and DWARF.      (line  109)
! * QCmode:                                Machine Modes.      (line  199)
  * QFmode:                                Machine Modes.      (line   57)
  * QImode:                                Machine Modes.      (line   25)
! * QImode, in insn:                       Insns.              (line  268)
  * QQmode:                                Machine Modes.      (line  106)
  * qualified type:                        Types.              (line    6)
+ * qualified type <1>:                    Types for C++.      (line    6)
  * querying function unit reservations:   Processor pipeline description.
                                                               (line   90)
  * question mark:                         Multi-Alternative.  (line   41)
! * quotient:                              Arithmetic.         (line  116)
! * r in constraint:                       Simple Constraints. (line   64)
  * RDIV_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * READONLY_DATA_SECTION_ASM_OP:          Sections.           (line   62)
  * real operands:                         SSA Operands.       (line    6)
! * REALPART_EXPR:                         Unary and Binary Expressions.
!                                                              (line    6)
! * REAL_ARITHMETIC:                       Floating Point.     (line   64)
  * REAL_CST:                              Constant expressions.
                                                               (line    6)
! * REAL_LIBGCC_SPEC:                      Driver.             (line  124)
  * REAL_NM_FILE_NAME:                     Macros for Initialization.
!                                                              (line  105)
  * REAL_TYPE:                             Types.              (line    6)
! * REAL_VALUES_EQUAL:                     Floating Point.     (line   31)
! * REAL_VALUES_LESS:                      Floating Point.     (line   37)
! * REAL_VALUE_ABS:                        Floating Point.     (line   81)
! * REAL_VALUE_ATOF:                       Floating Point.     (line   48)
! * REAL_VALUE_FIX:                        Floating Point.     (line   40)
! * REAL_VALUE_ISINF:                      Floating Point.     (line   58)
! * REAL_VALUE_ISNAN:                      Floating Point.     (line   61)
! * REAL_VALUE_NEGATE:                     Floating Point.     (line   78)
! * REAL_VALUE_NEGATIVE:                   Floating Point.     (line   55)
! * REAL_VALUE_TO_TARGET_DECIMAL128:       Data Output.        (line  147)
! * REAL_VALUE_TO_TARGET_DECIMAL32:        Data Output.        (line  145)
! * REAL_VALUE_TO_TARGET_DECIMAL64:        Data Output.        (line  146)
! * REAL_VALUE_TO_TARGET_DOUBLE:           Data Output.        (line  143)
! * REAL_VALUE_TO_TARGET_LONG_DOUBLE:      Data Output.        (line  144)
! * REAL_VALUE_TO_TARGET_SINGLE:           Data Output.        (line  142)
! * REAL_VALUE_TYPE:                       Floating Point.     (line   25)
! * REAL_VALUE_UNSIGNED_FIX:               Floating Point.     (line   43)
  * recognizing insns:                     RTL Template.       (line    6)
! * recog_data.operand:                    Instruction Output. (line   54)
  * RECORD_TYPE:                           Types.              (line    6)
+ * RECORD_TYPE <1>:                       Classes.            (line    6)
  * redirect_edge_and_branch:              Profile information.
                                                               (line   71)
  * redirect_edge_and_branch, redirect_jump: Maintaining the CFG.
!                                                              (line   90)
! * reduc_plus_scal_M instruction pattern: Standard Names.     (line  364)
! * reduc_smax_M instruction pattern:      Standard Names.     (line  331)
! * reduc_smax_scal_M instruction pattern: Standard Names.     (line  354)
! * reduc_smin_M instruction pattern:      Standard Names.     (line  331)
! * reduc_smin_scal_M instruction pattern: Standard Names.     (line  354)
! * reduc_splus_M instruction pattern:     Standard Names.     (line  347)
! * reduc_umax_M instruction pattern:      Standard Names.     (line  339)
! * reduc_umax_scal_M instruction pattern: Standard Names.     (line  359)
! * reduc_umin_M instruction pattern:      Standard Names.     (line  339)
! * reduc_umin_scal_M instruction pattern: Standard Names.     (line  359)
! * reduc_uplus_M instruction pattern:     Standard Names.     (line  347)
  * reference:                             Types.              (line    6)
  * REFERENCE_TYPE:                        Types.              (line    6)
  * reg:                                   Regs and Memory.    (line    9)
*************** Concept Index
*** 49777,49925 ****
  * reg and /i:                            Flags.              (line   89)
  * reg and /v:                            Flags.              (line   98)
  * reg, RTL sharing:                      Sharing.            (line   17)
! * REG_ALLOC_ORDER:                       Allocation Order.   (line    9)
! * REG_BR_PRED:                           Insns.              (line  534)
! * REG_BR_PROB:                           Insns.              (line  527)
  * REG_BR_PROB_BASE, BB_FREQ_BASE, count: Profile information.
                                                               (line   82)
  * REG_BR_PROB_BASE, EDGE_FREQUENCY:      Profile information.
                                                               (line   52)
! * REG_CC_SETTER:                         Insns.              (line  498)
! * REG_CC_USER:                           Insns.              (line  498)
! * REG_CLASS_CONTENTS:                    Register Classes.   (line   93)
  * reg_class_contents:                    Register Basics.    (line   59)
  * reg_class_for_constraint:              C Constraint Interface.
!                                                              (line   50)
! * REG_CLASS_NAMES:                       Register Classes.   (line   88)
! * REG_CROSSING_JUMP:                     Insns.              (line  411)
! * REG_DEAD:                              Insns.              (line  363)
  * REG_DEAD, REG_UNUSED:                  Liveness information.
                                                               (line   32)
! * REG_DEP_ANTI:                          Insns.              (line  520)
! * REG_DEP_OUTPUT:                        Insns.              (line  516)
! * REG_DEP_TRUE:                          Insns.              (line  513)
! * REG_EH_REGION, EDGE_ABNORMAL_CALL:     Edges.              (line  110)
! * REG_EQUAL:                             Insns.              (line  426)
! * REG_EQUIV:                             Insns.              (line  426)
! * REG_EXPR:                              Special Accessors.  (line   60)
! * REG_FRAME_RELATED_EXPR:                Insns.              (line  540)
  * REG_FUNCTION_VALUE_P:                  Flags.              (line   89)
! * REG_INC:                               Insns.              (line  379)
  * reg_label and /v:                      Flags.              (line   65)
! * REG_LABEL_OPERAND:                     Insns.              (line  393)
! * REG_LABEL_TARGET:                      Insns.              (line  402)
! * reg_names <1>:                         Instruction Output. (line  108)
  * reg_names:                             Register Basics.    (line   59)
! * REG_NONNEG:                            Insns.              (line  385)
! * REG_NOTE_KIND:                         Insns.              (line  352)
! * REG_NOTES:                             Insns.              (line  325)
! * REG_OFFSET:                            Special Accessors.  (line   64)
! * REG_OK_STRICT:                         Addressing Modes.   (line  100)
! * REG_PARM_STACK_SPACE:                  Stack Arguments.    (line   59)
  * REG_PARM_STACK_SPACE, and TARGET_FUNCTION_ARG: Register Arguments.
!                                                              (line   57)
  * REG_POINTER:                           Flags.              (line   94)
! * REG_SETJMP:                            Insns.              (line  420)
! * REG_UNUSED:                            Insns.              (line  372)
  * REG_USERVAR_P:                         Flags.              (line   98)
! * REG_VALUE_IN_UNWIND_CONTEXT:           Frame Registers.    (line  157)
! * REG_WORDS_BIG_ENDIAN:                  Storage Layout.     (line   36)
! * register allocation order:             Allocation Order.   (line    6)
! * register class definitions:            Register Classes.   (line    6)
! * register class preference constraints: Class Preferences.  (line    6)
! * register pairs:                        Values in Registers.
!                                                              (line   69)
! * Register Transfer Language (RTL):      RTL.                (line    6)
! * register usage:                        Registers.          (line    6)
! * REGISTER_MOVE_COST:                    Costs.              (line   10)
! * REGISTER_NAMES:                        Instruction Output. (line    9)
! * register_operand:                      Machine-Independent Predicates.
!                                                              (line   30)
! * REGISTER_PREFIX:                       Instruction Output. (line  152)
! * REGISTER_TARGET_PRAGMAS:               Misc.               (line  388)
! * registers arguments:                   Register Arguments. (line    6)
! * registers in constraints:              Simple Constraints. (line   66)
! * REGMODE_NATURAL_SIZE:                  Values in Registers.
!                                                              (line   50)
! * REGNO_MODE_CODE_OK_FOR_BASE_P:         Register Classes.   (line  176)
! * REGNO_MODE_OK_FOR_BASE_P:              Register Classes.   (line  153)
! * REGNO_MODE_OK_FOR_REG_BASE_P:          Register Classes.   (line  163)
! * REGNO_OK_FOR_BASE_P:                   Register Classes.   (line  149)
! * REGNO_OK_FOR_INDEX_P:                  Register Classes.   (line  190)
! * REGNO_REG_CLASS:                       Register Classes.   (line  108)
! * regs_ever_live:                        Function Entry.     (line   21)
! * regular expressions:                   Processor pipeline description.
!                                                              (line    6)
  * relative costs:                        Costs.              (line    6)
! * RELATIVE_PREFIX_NOT_LINKDIR:           Driver.             (line  263)
! * reload_completed:                      Standard Names.     (line 1254)
! * reload_in instruction pattern:         Standard Names.     (line   99)
  * reload_in_progress:                    Standard Names.     (line   57)
! * reload_out instruction pattern:        Standard Names.     (line   99)
! * reloading:                             RTL passes.         (line  171)
! * remainder:                             Arithmetic.         (line  135)
! * remainderM3 instruction pattern:       Standard Names.     (line  607)
! * reorder:                               GTY Options.        (line  176)
  * representation of RTL:                 RTL.                (line    6)
  * reservation delays:                    Processor pipeline description.
                                                               (line    6)
! * rest_of_decl_compilation:              Parsing pass.       (line   52)
! * rest_of_type_compilation:              Parsing pass.       (line   52)
! * restore_stack_block instruction pattern: Standard Names.   (line 1381)
  * restore_stack_function instruction pattern: Standard Names.
!                                                              (line 1381)
  * restore_stack_nonlocal instruction pattern: Standard Names.
!                                                              (line 1381)
  * RESULT_DECL:                           Declarations.       (line    6)
  * return:                                Side Effects.       (line   72)
! * return instruction pattern:            Standard Names.     (line 1227)
  * return values in registers:            Scalar Return.      (line    6)
! * RETURN_ADDR_IN_PREVIOUS_FRAME:         Frame Layout.       (line  135)
! * RETURN_ADDR_OFFSET:                    Exception Handling. (line   60)
! * RETURN_ADDR_RTX:                       Frame Layout.       (line  124)
! * RETURN_ADDRESS_POINTER_REGNUM:         Frame Registers.    (line   65)
  * RETURN_EXPR:                           Statements for C++. (line    6)
  * RETURN_STMT:                           Statements for C++. (line    6)
  * return_val:                            Flags.              (line  274)
  * return_val, in call_insn:              Flags.              (line   24)
  * return_val, in reg:                    Flags.              (line   89)
  * return_val, in symbol_ref:             Flags.              (line  202)
- * returning aggregate values:            Aggregate Return.   (line    6)
- * returning structures and unions:       Interface.          (line   10)
  * reverse probability:                   Profile information.
                                                               (line   66)
  * REVERSE_CONDITION:                     MODE_CC Condition Codes.
!                                                              (line   93)
  * REVERSIBLE_CC_MODE:                    MODE_CC Condition Codes.
!                                                              (line   78)
! * right rotate:                          Arithmetic.         (line  194)
! * right shift:                           Arithmetic.         (line  189)
! * rintM2 instruction pattern:            Standard Names.     (line  720)
  * RISC:                                  Processor pipeline description.
                                                               (line    6)
  * roots, marking:                        GGC Roots.          (line    6)
! * rotate:                                Arithmetic.         (line  194)
! * rotatert:                              Arithmetic.         (line  194)
! * rotlM3 instruction pattern:            Standard Names.     (line  568)
! * rotrM3 instruction pattern:            Standard Names.     (line  568)
  * ROUND_DIV_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * ROUND_MOD_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
! * ROUND_TYPE_ALIGN:                      Storage Layout.     (line  432)
! * roundM2 instruction pattern:           Standard Names.     (line  696)
  * RSHIFT_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
  * RTL addition:                          Arithmetic.         (line   14)
  * RTL addition with signed saturation:   Arithmetic.         (line   14)
  * RTL addition with unsigned saturation: Arithmetic.         (line   14)
  * RTL classes:                           RTL Classes.        (line    6)
! * RTL comparison:                        Arithmetic.         (line   43)
  * RTL comparison operations:             Comparisons.        (line    6)
  * RTL constant expression types:         Constants.          (line    6)
  * RTL constants:                         Constants.          (line    6)
  * RTL declarations:                      RTL Declarations.   (line    6)
! * RTL difference:                        Arithmetic.         (line   36)
  * RTL expression:                        RTL Objects.        (line    6)
  * RTL expressions for arithmetic:        Arithmetic.         (line    6)
  * RTL format:                            RTL Classes.        (line   72)
--- 49365,49518 ----
  * reg and /i:                            Flags.              (line   89)
  * reg and /v:                            Flags.              (line   98)
  * reg, RTL sharing:                      Sharing.            (line   17)
! * register allocation order:             Allocation Order.   (line    6)
! * register class definitions:            Register Classes.   (line    6)
! * register class preference constraints: Class Preferences.  (line    6)
! * register pairs:                        Values in Registers.
!                                                              (line   69)
! * Register Transfer Language (RTL):      RTL.                (line    6)
! * register usage:                        Registers.          (line    6)
! * registers arguments:                   Register Arguments. (line    6)
! * registers in constraints:              Simple Constraints. (line   64)
! * REGISTER_MOVE_COST:                    Costs.              (line    9)
! * REGISTER_NAMES:                        Instruction Output. (line    8)
! * register_operand:                      Machine-Independent Predicates.
!                                                              (line   29)
! * REGISTER_PREFIX:                       Instruction Output. (line  150)
! * REGISTER_TARGET_PRAGMAS:               Misc.               (line  387)
! * REGMODE_NATURAL_SIZE:                  Values in Registers.
!                                                              (line   49)
! * REGNO_MODE_CODE_OK_FOR_BASE_P:         Register Classes.   (line  172)
! * REGNO_MODE_OK_FOR_BASE_P:              Register Classes.   (line  150)
! * REGNO_MODE_OK_FOR_REG_BASE_P:          Register Classes.   (line  160)
! * REGNO_OK_FOR_BASE_P:                   Register Classes.   (line  146)
! * REGNO_OK_FOR_INDEX_P:                  Register Classes.   (line  186)
! * REGNO_REG_CLASS:                       Register Classes.   (line  105)
! * regs_ever_live:                        Function Entry.     (line   21)
! * regular expressions:                   Processor pipeline description.
!                                                              (line    6)
! * regular expressions <1>:               Processor pipeline description.
!                                                              (line  105)
! * REG_ALLOC_ORDER:                       Allocation Order.   (line    8)
! * REG_BR_PRED:                           Insns.              (line  526)
! * REG_BR_PROB:                           Insns.              (line  519)
  * REG_BR_PROB_BASE, BB_FREQ_BASE, count: Profile information.
                                                               (line   82)
  * REG_BR_PROB_BASE, EDGE_FREQUENCY:      Profile information.
                                                               (line   52)
! * REG_CC_SETTER:                         Insns.              (line  491)
! * REG_CC_USER:                           Insns.              (line  491)
  * reg_class_contents:                    Register Basics.    (line   59)
+ * REG_CLASS_CONTENTS:                    Register Classes.   (line   91)
  * reg_class_for_constraint:              C Constraint Interface.
!                                                              (line   48)
! * REG_CLASS_NAMES:                       Register Classes.   (line   86)
! * REG_CROSSING_JUMP:                     Insns.              (line  405)
! * REG_DEAD:                              Insns.              (line  357)
  * REG_DEAD, REG_UNUSED:                  Liveness information.
                                                               (line   32)
! * REG_DEP_ANTI:                          Insns.              (line  513)
! * REG_DEP_OUTPUT:                        Insns.              (line  509)
! * REG_DEP_TRUE:                          Insns.              (line  506)
! * REG_EH_REGION, EDGE_ABNORMAL_CALL:     Edges.              (line  109)
! * REG_EQUAL:                             Insns.              (line  420)
! * REG_EQUIV:                             Insns.              (line  420)
! * REG_EXPR:                              Special Accessors.  (line   58)
! * REG_FRAME_RELATED_EXPR:                Insns.              (line  532)
  * REG_FUNCTION_VALUE_P:                  Flags.              (line   89)
! * REG_INC:                               Insns.              (line  373)
  * reg_label and /v:                      Flags.              (line   65)
! * REG_LABEL_OPERAND:                     Insns.              (line  387)
! * REG_LABEL_TARGET:                      Insns.              (line  396)
  * reg_names:                             Register Basics.    (line   59)
! * reg_names <1>:                         Instruction Output. (line  107)
! * REG_NONNEG:                            Insns.              (line  379)
! * REG_NOTES:                             Insns.              (line  321)
! * REG_NOTE_KIND:                         Insns.              (line  346)
! * REG_OFFSET:                            Special Accessors.  (line   62)
! * REG_OK_STRICT:                         Addressing Modes.   (line   99)
! * REG_PARM_STACK_SPACE:                  Stack Arguments.    (line   58)
  * REG_PARM_STACK_SPACE, and TARGET_FUNCTION_ARG: Register Arguments.
!                                                              (line   56)
  * REG_POINTER:                           Flags.              (line   94)
! * REG_SETJMP:                            Insns.              (line  414)
! * REG_UNUSED:                            Insns.              (line  366)
  * REG_USERVAR_P:                         Flags.              (line   98)
! * REG_VALUE_IN_UNWIND_CONTEXT:           Frame Registers.    (line  158)
! * REG_WORDS_BIG_ENDIAN:                  Storage Layout.     (line   35)
  * relative costs:                        Costs.              (line    6)
! * RELATIVE_PREFIX_NOT_LINKDIR:           Driver.             (line  262)
! * reloading:                             RTL passes.         (line  170)
! * reload_completed:                      Standard Names.     (line 1248)
! * reload_in instruction pattern:         Standard Names.     (line   98)
  * reload_in_progress:                    Standard Names.     (line   57)
! * reload_out instruction pattern:        Standard Names.     (line   98)
! * remainder:                             Arithmetic.         (line  136)
! * remainderM3 instruction pattern:       Standard Names.     (line  602)
! * reorder:                               GTY Options.        (line  182)
  * representation of RTL:                 RTL.                (line    6)
  * reservation delays:                    Processor pipeline description.
                                                               (line    6)
! * restore_stack_block instruction pattern: Standard Names.   (line 1374)
  * restore_stack_function instruction pattern: Standard Names.
!                                                              (line 1374)
  * restore_stack_nonlocal instruction pattern: Standard Names.
!                                                              (line 1374)
! * rest_of_decl_compilation:              Parsing pass.       (line   51)
! * rest_of_type_compilation:              Parsing pass.       (line   51)
  * RESULT_DECL:                           Declarations.       (line    6)
  * return:                                Side Effects.       (line   72)
! * return instruction pattern:            Standard Names.     (line 1222)
  * return values in registers:            Scalar Return.      (line    6)
! * returning aggregate values:            Aggregate Return.   (line    6)
! * returning structures and unions:       Interface.          (line   10)
! * RETURN_ADDRESS_POINTER_REGNUM:         Frame Registers.    (line   64)
! * RETURN_ADDR_IN_PREVIOUS_FRAME:         Frame Layout.       (line  133)
! * RETURN_ADDR_OFFSET:                    Exception Handling. (line   59)
! * RETURN_ADDR_RTX:                       Frame Layout.       (line  122)
  * RETURN_EXPR:                           Statements for C++. (line    6)
  * RETURN_STMT:                           Statements for C++. (line    6)
  * return_val:                            Flags.              (line  274)
  * return_val, in call_insn:              Flags.              (line   24)
  * return_val, in reg:                    Flags.              (line   89)
  * return_val, in symbol_ref:             Flags.              (line  202)
  * reverse probability:                   Profile information.
                                                               (line   66)
  * REVERSE_CONDITION:                     MODE_CC Condition Codes.
!                                                              (line   92)
  * REVERSIBLE_CC_MODE:                    MODE_CC Condition Codes.
!                                                              (line   77)
! * right rotate:                          Arithmetic.         (line  195)
! * right shift:                           Arithmetic.         (line  190)
! * rintM2 instruction pattern:            Standard Names.     (line  715)
  * RISC:                                  Processor pipeline description.
                                                               (line    6)
+ * RISC <1>:                              Processor pipeline description.
+                                                              (line  223)
  * roots, marking:                        GGC Roots.          (line    6)
! * rotate:                                Arithmetic.         (line  195)
! * rotate <1>:                            Arithmetic.         (line  195)
! * rotatert:                              Arithmetic.         (line  195)
! * rotlM3 instruction pattern:            Standard Names.     (line  563)
! * rotrM3 instruction pattern:            Standard Names.     (line  563)
! * roundM2 instruction pattern:           Standard Names.     (line  691)
  * ROUND_DIV_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * ROUND_MOD_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
! * ROUND_TYPE_ALIGN:                      Storage Layout.     (line  427)
  * RSHIFT_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
  * RTL addition:                          Arithmetic.         (line   14)
  * RTL addition with signed saturation:   Arithmetic.         (line   14)
  * RTL addition with unsigned saturation: Arithmetic.         (line   14)
  * RTL classes:                           RTL Classes.        (line    6)
! * RTL comparison:                        Arithmetic.         (line   46)
  * RTL comparison operations:             Comparisons.        (line    6)
  * RTL constant expression types:         Constants.          (line    6)
  * RTL constants:                         Constants.          (line    6)
  * RTL declarations:                      RTL Declarations.   (line    6)
! * RTL difference:                        Arithmetic.         (line   38)
  * RTL expression:                        RTL Objects.        (line    6)
  * RTL expressions for arithmetic:        Arithmetic.         (line    6)
  * RTL format:                            RTL Classes.        (line   72)
*************** Concept Index
*** 49938,49946 ****
  * RTL side effect expressions:           Side Effects.       (line    6)
  * RTL strings:                           RTL Objects.        (line    6)
  * RTL structure sharing assumptions:     Sharing.            (line    6)
! * RTL subtraction:                       Arithmetic.         (line   36)
! * RTL subtraction with signed saturation: Arithmetic.        (line   36)
! * RTL subtraction with unsigned saturation: Arithmetic.      (line   36)
  * RTL sum:                               Arithmetic.         (line   14)
  * RTL vectors:                           RTL Objects.        (line    6)
  * RTL_CONST_CALL_P:                      Flags.              (line   19)
--- 49531,49539 ----
  * RTL side effect expressions:           Side Effects.       (line    6)
  * RTL strings:                           RTL Objects.        (line    6)
  * RTL structure sharing assumptions:     Sharing.            (line    6)
! * RTL subtraction:                       Arithmetic.         (line   38)
! * RTL subtraction with signed saturation: Arithmetic.        (line   38)
! * RTL subtraction with unsigned saturation: Arithmetic.      (line   38)
  * RTL sum:                               Arithmetic.         (line   14)
  * RTL vectors:                           RTL Objects.        (line    6)
  * RTL_CONST_CALL_P:                      Flags.              (line   19)
*************** Concept Index
*** 49952,50164 ****
  * RTX_FRAME_RELATED_P:                   Flags.              (line  107)
  * run-time conventions:                  Interface.          (line    6)
  * run-time target specification:         Run-time Target.    (line    6)
! * s in constraint:                       Simple Constraints. (line  102)
  * SAD_EXPR:                              Vectors.            (line    6)
! * same_type_p:                           Types.              (line   88)
! * SAmode:                                Machine Modes.      (line  151)
  * sat_fract:                             Conversions.        (line   90)
- * satfractMN2 instruction pattern:       Standard Names.     (line  992)
- * satfractunsMN2 instruction pattern:    Standard Names.     (line 1005)
- * satisfies_constraint_:                 C Constraint Interface.
-                                                              (line   37)
  * SAVE_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * save_stack_block instruction pattern:  Standard Names.     (line 1381)
! * save_stack_function instruction pattern: Standard Names.   (line 1381)
! * save_stack_nonlocal instruction pattern: Standard Names.   (line 1381)
! * SBSS_SECTION_ASM_OP:                   Sections.           (line   76)
  * Scalar evolutions:                     Scalar evolutions.  (line    6)
  * scalars, returned as values:           Scalar Return.      (line    6)
  * SCHED_GROUP_P:                         Flags.              (line  148)
! * SCmode:                                Machine Modes.      (line  200)
! * scratch:                               Regs and Memory.    (line  298)
! * scratch operands:                      Regs and Memory.    (line  298)
  * scratch, RTL sharing:                  Sharing.            (line   35)
  * scratch_operand:                       Machine-Independent Predicates.
!                                                              (line   50)
! * SDATA_SECTION_ASM_OP:                  Sections.           (line   58)
! * SDB_ALLOW_FORWARD_REFERENCES:          SDB and DWARF.      (line  128)
! * SDB_ALLOW_UNKNOWN_REFERENCES:          SDB and DWARF.      (line  123)
! * SDB_DEBUGGING_INFO:                    SDB and DWARF.      (line    9)
! * SDB_DELIM:                             SDB and DWARF.      (line  116)
! * SDB_OUTPUT_SOURCE_LINE:                SDB and DWARF.      (line  133)
  * SDmode:                                Machine Modes.      (line   88)
! * sdot_prodM instruction pattern:        Standard Names.     (line  372)
! * search options:                        Including Patterns. (line   44)
! * SECONDARY_INPUT_RELOAD_CLASS:          Register Classes.   (line  396)
! * SECONDARY_MEMORY_NEEDED:               Register Classes.   (line  452)
! * SECONDARY_MEMORY_NEEDED_MODE:          Register Classes.   (line  471)
! * SECONDARY_MEMORY_NEEDED_RTX:           Register Classes.   (line  462)
! * SECONDARY_OUTPUT_RELOAD_CLASS:         Register Classes.   (line  397)
! * SECONDARY_RELOAD_CLASS:                Register Classes.   (line  395)
  * SELECT_CC_MODE:                        MODE_CC Condition Codes.
!                                                              (line    7)
! * sequence:                              Side Effects.       (line  260)
  * Sequence iterators:                    Sequence iterators. (line    6)
  * set:                                   Side Effects.       (line   15)
  * set and /f:                            Flags.              (line  107)
! * SET_ASM_OP:                            Label Output.       (line  426)
  * set_attr:                              Tagging Insns.      (line   31)
  * set_attr_alternative:                  Tagging Insns.      (line   49)
! * set_bb_seq:                            GIMPLE sequences.   (line   76)
  * SET_DEST:                              Side Effects.       (line   69)
  * SET_IS_RETURN_P:                       Flags.              (line  157)
  * SET_LABEL_KIND:                        Insns.              (line  146)
  * set_optab_libfunc:                     Library Calls.      (line   15)
! * SET_RATIO:                             Costs.              (line  217)
  * SET_SRC:                               Side Effects.       (line   69)
  * set_thread_pointerMODE instruction pattern: Standard Names.
!                                                              (line 1915)
  * SET_TYPE_STRUCTURAL_EQUALITY:          Types.              (line    6)
! * setmemM instruction pattern:           Standard Names.     (line  856)
! * SETUP_FRAME_ADDRESSES:                 Frame Layout.       (line  102)
  * SFmode:                                Machine Modes.      (line   69)
  * sharing of RTL components:             Sharing.            (line    6)
! * shift:                                 Arithmetic.         (line  172)
! * SHIFT_COUNT_TRUNCATED:                 Misc.               (line  113)
  * SHLIB_SUFFIX:                          Macros for Initialization.
!                                                              (line  135)
! * SHORT_ACCUM_TYPE_SIZE:                 Type Layout.        (line   83)
! * SHORT_FRACT_TYPE_SIZE:                 Type Layout.        (line   63)
! * SHORT_IMMEDIATES_SIGN_EXTEND:          Misc.               (line   87)
! * SHORT_TYPE_SIZE:                       Type Layout.        (line   16)
! * sibcall_epilogue instruction pattern:  Standard Names.     (line 1591)
! * sibling call:                          Edges.              (line  122)
  * SIBLING_CALL_P:                        Flags.              (line  161)
! * SIG_ATOMIC_TYPE:                       Type Layout.        (line  215)
  * sign_extend:                           Conversions.        (line   23)
  * sign_extract:                          Bit-Fields.         (line    8)
  * sign_extract, canonicalization of:     Insn Canonicalizations.
!                                                              (line   88)
! * signed division:                       Arithmetic.         (line  115)
! * signed division with signed saturation: Arithmetic.        (line  115)
! * signed maximum:                        Arithmetic.         (line  140)
! * signed minimum:                        Arithmetic.         (line  140)
  * SImode:                                Machine Modes.      (line   37)
  * simple constraints:                    Simple Constraints. (line    6)
  * simple_return:                         Side Effects.       (line   86)
! * simple_return instruction pattern:     Standard Names.     (line 1243)
! * sincosM3 instruction pattern:          Standard Names.     (line  632)
! * sinM2 instruction pattern:             Standard Names.     (line  624)
! * SIZE_ASM_OP:                           Label Output.       (line   35)
! * SIZE_TYPE:                             Type Layout.        (line  138)
! * SIZETYPE:                              Type Layout.        (line  154)
! * skip:                                  GTY Options.        (line   77)
! * SLOW_BYTE_ACCESS:                      Costs.              (line  118)
! * SLOW_UNALIGNED_ACCESS:                 Costs.              (line  133)
! * smax:                                  Arithmetic.         (line  140)
! * smin:                                  Arithmetic.         (line  140)
! * sms, swing, software pipelining:       RTL passes.         (line  124)
! * smulM3_highpart instruction pattern:   Standard Names.     (line  483)
  * soft float library:                    Soft float library routines.
                                                               (line    6)
! * special:                               GTY Options.        (line  237)
  * special predicates:                    Predicates.         (line   31)
  * SPECS:                                 Target Fragment.    (line  191)
  * speed of instructions:                 Costs.              (line    6)
- * split_block:                           Maintaining the CFG.
-                                                              (line   99)
  * splitting instructions:                Insn Splitting.     (line    6)
  * SQmode:                                Machine Modes.      (line  114)
  * sqrt:                                  Arithmetic.         (line  206)
! * sqrtM2 instruction pattern:            Standard Names.     (line  590)
  * square root:                           Arithmetic.         (line  206)
! * ss_abs:                                Arithmetic.         (line  199)
! * ss_ashift:                             Arithmetic.         (line  172)
! * ss_div:                                Arithmetic.         (line  115)
! * ss_minus:                              Arithmetic.         (line   36)
! * ss_mult:                               Arithmetic.         (line   92)
! * ss_neg:                                Arithmetic.         (line   81)
  * ss_plus:                               Arithmetic.         (line   14)
  * ss_truncate:                           Conversions.        (line   43)
- * SSA:                                   SSA.                (line    6)
- * SSA_NAME_DEF_STMT:                     SSA.                (line  217)
- * SSA_NAME_VERSION:                      SSA.                (line  222)
- * ssaddM3 instruction pattern:           Standard Names.     (line  269)
- * ssadM instruction pattern:             Standard Names.     (line  381)
- * ssashlM3 instruction pattern:          Standard Names.     (line  558)
- * ssdivM3 instruction pattern:           Standard Names.     (line  269)
- * ssmaddMN4 instruction pattern:         Standard Names.     (line  506)
- * ssmsubMN4 instruction pattern:         Standard Names.     (line  530)
- * ssmulM3 instruction pattern:           Standard Names.     (line  269)
- * ssnegM2 instruction pattern:           Standard Names.     (line  580)
- * sssubM3 instruction pattern:           Standard Names.     (line  269)
- * ssum_widenM3 instruction pattern:      Standard Names.     (line  391)
  * stack arguments:                       Stack Arguments.    (line    6)
  * stack frame layout:                    Frame Layout.       (line    6)
  * stack smashing protection:             Stack Smashing Protection.
                                                               (line    6)
! * STACK_ALIGNMENT_NEEDED:                Frame Layout.       (line   48)
! * STACK_BOUNDARY:                        Storage Layout.     (line  141)
! * STACK_CHECK_BUILTIN:                   Stack Checking.     (line   32)
! * STACK_CHECK_FIXED_FRAME_SIZE:          Stack Checking.     (line   83)
! * STACK_CHECK_MAX_FRAME_SIZE:            Stack Checking.     (line   74)
! * STACK_CHECK_MAX_VAR_SIZE:              Stack Checking.     (line   90)
! * STACK_CHECK_MOVING_SP:                 Stack Checking.     (line   54)
! * STACK_CHECK_PROBE_INTERVAL_EXP:        Stack Checking.     (line   46)
! * STACK_CHECK_PROTECT:                   Stack Checking.     (line   63)
! * STACK_CHECK_STATIC_BUILTIN:            Stack Checking.     (line   39)
! * STACK_DYNAMIC_OFFSET:                  Frame Layout.       (line   75)
  * STACK_DYNAMIC_OFFSET and virtual registers: Regs and Memory.
                                                               (line   83)
! * STACK_GROWS_DOWNWARD:                  Frame Layout.       (line    9)
! * STACK_PARMS_IN_REG_PARM_AREA:          Stack Arguments.    (line   90)
! * STACK_POINTER_OFFSET:                  Frame Layout.       (line   58)
  * STACK_POINTER_OFFSET and virtual registers: Regs and Memory.
                                                               (line   93)
! * STACK_POINTER_REGNUM:                  Frame Registers.    (line    9)
  * STACK_POINTER_REGNUM and virtual registers: Regs and Memory.
                                                               (line   83)
  * stack_pointer_rtx:                     Frame Registers.    (line  104)
! * stack_protect_set instruction pattern: Standard Names.     (line 1925)
! * stack_protect_test instruction pattern: Standard Names.    (line 1935)
! * STACK_PUSH_CODE:                       Frame Layout.       (line   17)
! * STACK_REG_COVER_CLASS:                 Stack Registers.    (line   23)
! * STACK_REGS:                            Stack Registers.    (line   20)
! * STACK_SAVEAREA_MODE:                   Storage Layout.     (line  448)
! * STACK_SIZE_MODE:                       Storage Layout.     (line  459)
! * STACK_SLOT_ALIGNMENT:                  Storage Layout.     (line  279)
  * standard pattern names:                Standard Names.     (line    6)
! * STANDARD_STARTFILE_PREFIX:             Driver.             (line  275)
! * STANDARD_STARTFILE_PREFIX_1:           Driver.             (line  282)
! * STANDARD_STARTFILE_PREFIX_2:           Driver.             (line  289)
! * STARTFILE_SPEC:                        Driver.             (line  148)
! * STARTING_FRAME_OFFSET:                 Frame Layout.       (line   39)
  * STARTING_FRAME_OFFSET and virtual registers: Regs and Memory.
                                                               (line   74)
  * Statement and operand traversals:      Statement and operand traversals.
                                                               (line    6)
  * Statement Sequences:                   Statement Sequences.
                                                               (line    6)
! * statements <1>:                        Statements for C++. (line    6)
  * statements:                            Function Properties.
                                                               (line    6)
! * Statements:                            Statements.         (line    6)
  * Static profile estimation:             Profile information.
                                                               (line   24)
  * static single assignment:              SSA.                (line    6)
! * STATIC_CHAIN_INCOMING_REGNUM:          Frame Registers.    (line   78)
! * STATIC_CHAIN_REGNUM:                   Frame Registers.    (line   77)
  * stdarg.h and register arguments:       Register Arguments. (line   51)
! * STDC_0_IN_SYSTEM_HEADERS:              Misc.               (line  351)
  * STMT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * STMT_IS_FULL_EXPR_P:                   Statements for C++. (line   22)
  * storage layout:                        Storage Layout.     (line    6)
! * STORE_FLAG_VALUE:                      Misc.               (line  202)
! * store_multiple instruction pattern:    Standard Names.     (line  160)
! * strcpy:                                Storage Layout.     (line  231)
! * STRICT_ALIGNMENT:                      Storage Layout.     (line  329)
  * strict_low_part:                       RTL Declarations.   (line    9)
! * strict_memory_address_p:               Addressing Modes.   (line  187)
  * STRING_CST:                            Constant expressions.
                                                               (line    6)
  * STRING_POOL_ADDRESS_P:                 Flags.              (line  165)
! * strlenM instruction pattern:           Standard Names.     (line  927)
  * structure value address:               Aggregate Return.   (line    6)
- * STRUCTURE_SIZE_BOUNDARY:               Storage Layout.     (line  321)
  * structures, returning:                 Interface.          (line   10)
! * subM3 instruction pattern:             Standard Names.     (line  269)
  * SUBOBJECT:                             Statements for C++. (line    6)
  * SUBOBJECT_CLEANUP:                     Statements for C++. (line    6)
  * subreg:                                Regs and Memory.    (line   97)
--- 49545,49759 ----
  * RTX_FRAME_RELATED_P:                   Flags.              (line  107)
  * run-time conventions:                  Interface.          (line    6)
  * run-time target specification:         Run-time Target.    (line    6)
! * s in constraint:                       Simple Constraints. (line  100)
  * SAD_EXPR:                              Vectors.            (line    6)
! * same_type_p:                           Types.              (line   86)
! * SAmode:                                Machine Modes.      (line  150)
! * satfractMN2 instruction pattern:       Standard Names.     (line  987)
! * satfractunsMN2 instruction pattern:    Standard Names.     (line 1000)
! * satisfies_constraint_M:                C Constraint Interface.
!                                                              (line   36)
  * sat_fract:                             Conversions.        (line   90)
  * SAVE_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * save_stack_block instruction pattern:  Standard Names.     (line 1374)
! * save_stack_function instruction pattern: Standard Names.   (line 1374)
! * save_stack_nonlocal instruction pattern: Standard Names.   (line 1374)
! * SBSS_SECTION_ASM_OP:                   Sections.           (line   75)
  * Scalar evolutions:                     Scalar evolutions.  (line    6)
  * scalars, returned as values:           Scalar Return.      (line    6)
  * SCHED_GROUP_P:                         Flags.              (line  148)
! * SCmode:                                Machine Modes.      (line  199)
! * scratch:                               Regs and Memory.    (line  294)
! * scratch operands:                      Regs and Memory.    (line  294)
  * scratch, RTL sharing:                  Sharing.            (line   35)
  * scratch_operand:                       Machine-Independent Predicates.
!                                                              (line   49)
! * SDATA_SECTION_ASM_OP:                  Sections.           (line   57)
! * SDB_ALLOW_FORWARD_REFERENCES:          SDB and DWARF.      (line  127)
! * SDB_ALLOW_UNKNOWN_REFERENCES:          SDB and DWARF.      (line  122)
! * SDB_DEBUGGING_INFO:                    SDB and DWARF.      (line    8)
! * SDB_DELIM:                             SDB and DWARF.      (line  115)
! * SDB_OUTPUT_SOURCE_LINE:                SDB and DWARF.      (line  132)
  * SDmode:                                Machine Modes.      (line   88)
! * sdot_prodM instruction pattern:        Standard Names.     (line  369)
! * search options:                        Including Patterns. (line   47)
! * SECONDARY_INPUT_RELOAD_CLASS:          Register Classes.   (line  391)
! * SECONDARY_MEMORY_NEEDED:               Register Classes.   (line  447)
! * SECONDARY_MEMORY_NEEDED_MODE:          Register Classes.   (line  466)
! * SECONDARY_MEMORY_NEEDED_RTX:           Register Classes.   (line  457)
! * SECONDARY_OUTPUT_RELOAD_CLASS:         Register Classes.   (line  392)
! * SECONDARY_RELOAD_CLASS:                Register Classes.   (line  390)
  * SELECT_CC_MODE:                        MODE_CC Condition Codes.
!                                                              (line    6)
! * sequence:                              Side Effects.       (line  259)
  * Sequence iterators:                    Sequence iterators. (line    6)
  * set:                                   Side Effects.       (line   15)
  * set and /f:                            Flags.              (line  107)
! * setmemM instruction pattern:           Standard Names.     (line  851)
! * SETUP_FRAME_ADDRESSES:                 Frame Layout.       (line  100)
! * SET_ASM_OP:                            Label Output.       (line  423)
! * SET_ASM_OP <1>:                        Label Output.       (line  434)
  * set_attr:                              Tagging Insns.      (line   31)
  * set_attr_alternative:                  Tagging Insns.      (line   49)
! * set_bb_seq:                            GIMPLE sequences.   (line   75)
  * SET_DEST:                              Side Effects.       (line   69)
  * SET_IS_RETURN_P:                       Flags.              (line  157)
  * SET_LABEL_KIND:                        Insns.              (line  146)
  * set_optab_libfunc:                     Library Calls.      (line   15)
! * SET_RATIO:                             Costs.              (line  216)
  * SET_SRC:                               Side Effects.       (line   69)
  * set_thread_pointerMODE instruction pattern: Standard Names.
!                                                              (line 1905)
  * SET_TYPE_STRUCTURAL_EQUALITY:          Types.              (line    6)
! * SET_TYPE_STRUCTURAL_EQUALITY <1>:      Types.              (line   81)
  * SFmode:                                Machine Modes.      (line   69)
  * sharing of RTL components:             Sharing.            (line    6)
! * shift:                                 Arithmetic.         (line  173)
! * SHIFT_COUNT_TRUNCATED:                 Misc.               (line  112)
  * SHLIB_SUFFIX:                          Macros for Initialization.
!                                                              (line  133)
! * SHORT_ACCUM_TYPE_SIZE:                 Type Layout.        (line   82)
! * SHORT_FRACT_TYPE_SIZE:                 Type Layout.        (line   62)
! * SHORT_IMMEDIATES_SIGN_EXTEND:          Misc.               (line   86)
! * SHORT_TYPE_SIZE:                       Type Layout.        (line   15)
! * sibcall_epilogue instruction pattern:  Standard Names.     (line 1581)
! * sibling call:                          Edges.              (line  121)
  * SIBLING_CALL_P:                        Flags.              (line  161)
! * signed division:                       Arithmetic.         (line  116)
! * signed division with signed saturation: Arithmetic.        (line  116)
! * signed maximum:                        Arithmetic.         (line  141)
! * signed minimum:                        Arithmetic.         (line  141)
  * sign_extend:                           Conversions.        (line   23)
  * sign_extract:                          Bit-Fields.         (line    8)
  * sign_extract, canonicalization of:     Insn Canonicalizations.
!                                                              (line   87)
! * SIG_ATOMIC_TYPE:                       Type Layout.        (line  214)
  * SImode:                                Machine Modes.      (line   37)
  * simple constraints:                    Simple Constraints. (line    6)
  * simple_return:                         Side Effects.       (line   86)
! * simple_return instruction pattern:     Standard Names.     (line 1237)
! * sincosM3 instruction pattern:          Standard Names.     (line  627)
! * sinM2 instruction pattern:             Standard Names.     (line  619)
! * SIZETYPE:                              Type Layout.        (line  153)
! * SIZE_ASM_OP:                           Label Output.       (line   33)
! * SIZE_TYPE:                             Type Layout.        (line  137)
! * skip:                                  GTY Options.        (line   76)
! * SLOW_BYTE_ACCESS:                      Costs.              (line  117)
! * SLOW_UNALIGNED_ACCESS:                 Costs.              (line  132)
! * smax:                                  Arithmetic.         (line  141)
! * smin:                                  Arithmetic.         (line  141)
! * sms, swing, software pipelining:       RTL passes.         (line  123)
! * smulM3_highpart instruction pattern:   Standard Names.     (line  478)
  * soft float library:                    Soft float library routines.
                                                               (line    6)
! * special:                               GTY Options.        (line  245)
  * special predicates:                    Predicates.         (line   31)
  * SPECS:                                 Target Fragment.    (line  191)
  * speed of instructions:                 Costs.              (line    6)
  * splitting instructions:                Insn Splitting.     (line    6)
+ * split_block:                           Maintaining the CFG.
+                                                              (line   97)
  * SQmode:                                Machine Modes.      (line  114)
  * sqrt:                                  Arithmetic.         (line  206)
! * sqrtM2 instruction pattern:            Standard Names.     (line  585)
  * square root:                           Arithmetic.         (line  206)
! * SSA:                                   SSA.                (line    6)
! * ssaddM3 instruction pattern:           Standard Names.     (line  266)
! * ssadM instruction pattern:             Standard Names.     (line  378)
! * ssashlM3 instruction pattern:          Standard Names.     (line  553)
! * SSA_NAME_DEF_STMT:                     SSA.                (line  216)
! * SSA_NAME_VERSION:                      SSA.                (line  221)
! * ssdivM3 instruction pattern:           Standard Names.     (line  266)
! * ssmaddMN4 instruction pattern:         Standard Names.     (line  501)
! * ssmsubMN4 instruction pattern:         Standard Names.     (line  525)
! * ssmulM3 instruction pattern:           Standard Names.     (line  266)
! * ssnegM2 instruction pattern:           Standard Names.     (line  575)
! * sssubM3 instruction pattern:           Standard Names.     (line  266)
! * ssum_widenM3 instruction pattern:      Standard Names.     (line  387)
! * ss_abs:                                Arithmetic.         (line  200)
! * ss_ashift:                             Arithmetic.         (line  173)
! * ss_div:                                Arithmetic.         (line  116)
! * ss_minus:                              Arithmetic.         (line   38)
! * ss_mult:                               Arithmetic.         (line   93)
! * ss_neg:                                Arithmetic.         (line   82)
  * ss_plus:                               Arithmetic.         (line   14)
  * ss_truncate:                           Conversions.        (line   43)
  * stack arguments:                       Stack Arguments.    (line    6)
  * stack frame layout:                    Frame Layout.       (line    6)
  * stack smashing protection:             Stack Smashing Protection.
                                                               (line    6)
! * STACK_ALIGNMENT_NEEDED:                Frame Layout.       (line   47)
! * STACK_BOUNDARY:                        Storage Layout.     (line  139)
! * STACK_CHECK_BUILTIN:                   Stack Checking.     (line   31)
! * STACK_CHECK_FIXED_FRAME_SIZE:          Stack Checking.     (line   82)
! * STACK_CHECK_MAX_FRAME_SIZE:            Stack Checking.     (line   73)
! * STACK_CHECK_MAX_VAR_SIZE:              Stack Checking.     (line   89)
! * STACK_CHECK_MOVING_SP:                 Stack Checking.     (line   53)
! * STACK_CHECK_PROBE_INTERVAL_EXP:        Stack Checking.     (line   45)
! * STACK_CHECK_PROTECT:                   Stack Checking.     (line   62)
! * STACK_CHECK_STATIC_BUILTIN:            Stack Checking.     (line   38)
! * STACK_DYNAMIC_OFFSET:                  Frame Layout.       (line   73)
  * STACK_DYNAMIC_OFFSET and virtual registers: Regs and Memory.
                                                               (line   83)
! * STACK_GROWS_DOWNWARD:                  Frame Layout.       (line    8)
! * STACK_PARMS_IN_REG_PARM_AREA:          Stack Arguments.    (line   89)
! * STACK_POINTER_OFFSET:                  Frame Layout.       (line   57)
  * STACK_POINTER_OFFSET and virtual registers: Regs and Memory.
                                                               (line   93)
! * STACK_POINTER_REGNUM:                  Frame Registers.    (line    8)
  * STACK_POINTER_REGNUM and virtual registers: Regs and Memory.
                                                               (line   83)
  * stack_pointer_rtx:                     Frame Registers.    (line  104)
! * stack_protect_set instruction pattern: Standard Names.     (line 1915)
! * stack_protect_test instruction pattern: Standard Names.    (line 1925)
! * STACK_PUSH_CODE:                       Frame Layout.       (line   16)
! * STACK_REGS:                            Stack Registers.    (line   19)
! * STACK_REG_COVER_CLASS:                 Stack Registers.    (line   22)
! * STACK_SAVEAREA_MODE:                   Storage Layout.     (line  443)
! * STACK_SIZE_MODE:                       Storage Layout.     (line  454)
! * STACK_SLOT_ALIGNMENT:                  Storage Layout.     (line  275)
  * standard pattern names:                Standard Names.     (line    6)
! * STANDARD_STARTFILE_PREFIX:             Driver.             (line  274)
! * STANDARD_STARTFILE_PREFIX_1:           Driver.             (line  281)
! * STANDARD_STARTFILE_PREFIX_2:           Driver.             (line  288)
! * STARTFILE_SPEC:                        Driver.             (line  147)
! * STARTING_FRAME_OFFSET:                 Frame Layout.       (line   38)
  * STARTING_FRAME_OFFSET and virtual registers: Regs and Memory.
                                                               (line   74)
  * Statement and operand traversals:      Statement and operand traversals.
                                                               (line    6)
  * Statement Sequences:                   Statement Sequences.
                                                               (line    6)
! * Statements:                            Statements.         (line    6)
  * statements:                            Function Properties.
                                                               (line    6)
! * statements <1>:                        Statements for C++. (line    6)
  * Static profile estimation:             Profile information.
                                                               (line   24)
  * static single assignment:              SSA.                (line    6)
! * STATIC_CHAIN_INCOMING_REGNUM:          Frame Registers.    (line   77)
! * STATIC_CHAIN_REGNUM:                   Frame Registers.    (line   76)
  * stdarg.h and register arguments:       Register Arguments. (line   51)
! * STDC_0_IN_SYSTEM_HEADERS:              Misc.               (line  350)
  * STMT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * STMT_IS_FULL_EXPR_P:                   Statements for C++. (line   22)
  * storage layout:                        Storage Layout.     (line    6)
! * STORE_FLAG_VALUE:                      Misc.               (line  201)
! * store_multiple instruction pattern:    Standard Names.     (line  159)
! * strcpy:                                Storage Layout.     (line  228)
! * STRICT_ALIGNMENT:                      Storage Layout.     (line  325)
  * strict_low_part:                       RTL Declarations.   (line    9)
! * strict_memory_address_p:               Addressing Modes.   (line  186)
  * STRING_CST:                            Constant expressions.
                                                               (line    6)
  * STRING_POOL_ADDRESS_P:                 Flags.              (line  165)
! * strlenM instruction pattern:           Standard Names.     (line  922)
  * structure value address:               Aggregate Return.   (line    6)
  * structures, returning:                 Interface.          (line   10)
! * STRUCTURE_SIZE_BOUNDARY:               Storage Layout.     (line  317)
! * subM3 instruction pattern:             Standard Names.     (line  266)
  * SUBOBJECT:                             Statements for C++. (line    6)
  * SUBOBJECT_CLEANUP:                     Statements for C++. (line    6)
  * subreg:                                Regs and Memory.    (line   97)
*************** Concept Index
*** 50166,50781 ****
  * subreg and /u:                         Flags.              (line  180)
  * subreg and /u and /v:                  Flags.              (line  170)
  * subreg, in strict_low_part:            RTL Declarations.   (line    9)
! * SUBREG_BYTE:                           Regs and Memory.    (line  289)
  * SUBREG_PROMOTED_UNSIGNED_P:            Flags.              (line  170)
  * SUBREG_PROMOTED_UNSIGNED_SET:          Flags.              (line  180)
  * SUBREG_PROMOTED_VAR_P:                 Flags.              (line  187)
! * SUBREG_REG:                            Regs and Memory.    (line  289)
  * subst iterators in .md files:          Subst Iterators.    (line    6)
! * subvM4 instruction pattern:            Standard Names.     (line  285)
  * SUCCESS_EXIT_CODE:                     Host Misc.          (line   12)
  * SUPPORTS_INIT_PRIORITY:                Macros for Initialization.
!                                                              (line   58)
! * SUPPORTS_ONE_ONLY:                     Label Output.       (line  266)
! * SUPPORTS_WEAK:                         Label Output.       (line  240)
  * SWITCH_BODY:                           Statements for C++. (line    6)
  * SWITCH_COND:                           Statements for C++. (line    6)
  * SWITCH_STMT:                           Statements for C++. (line    6)
! * SWITCHABLE_TARGET:                     Run-time Target.    (line  165)
! * SYMBOL_FLAG_ANCHOR:                    Special Accessors.  (line  120)
! * SYMBOL_FLAG_EXTERNAL:                  Special Accessors.  (line  102)
! * SYMBOL_FLAG_FUNCTION:                  Special Accessors.  (line   95)
! * SYMBOL_FLAG_HAS_BLOCK_INFO:            Special Accessors.  (line  116)
! * SYMBOL_FLAG_LOCAL:                     Special Accessors.  (line   98)
! * SYMBOL_FLAG_SMALL:                     Special Accessors.  (line  107)
! * SYMBOL_FLAG_TLS_SHIFT:                 Special Accessors.  (line  111)
  * symbol_ref:                            Constants.          (line  117)
  * symbol_ref and /f:                     Flags.              (line  165)
  * symbol_ref and /i:                     Flags.              (line  202)
  * symbol_ref and /u:                     Flags.              (line   10)
  * symbol_ref and /v:                     Flags.              (line  206)
  * symbol_ref, RTL sharing:               Sharing.            (line   20)
! * SYMBOL_REF_ANCHOR_P:                   Special Accessors.  (line  120)
! * SYMBOL_REF_BLOCK:                      Special Accessors.  (line  133)
! * SYMBOL_REF_BLOCK_OFFSET:               Special Accessors.  (line  138)
! * SYMBOL_REF_CONSTANT:                   Special Accessors.  (line   81)
! * SYMBOL_REF_DATA:                       Special Accessors.  (line   85)
! * SYMBOL_REF_DECL:                       Special Accessors.  (line   69)
! * SYMBOL_REF_EXTERNAL_P:                 Special Accessors.  (line  102)
  * SYMBOL_REF_FLAG:                       Flags.              (line  206)
  * SYMBOL_REF_FLAG, in TARGET_ENCODE_SECTION_INFO: Sections.  (line  277)
! * SYMBOL_REF_FLAGS:                      Special Accessors.  (line   89)
! * SYMBOL_REF_FUNCTION_P:                 Special Accessors.  (line   95)
! * SYMBOL_REF_HAS_BLOCK_INFO_P:           Special Accessors.  (line  116)
! * SYMBOL_REF_LOCAL_P:                    Special Accessors.  (line   98)
! * SYMBOL_REF_SMALL_P:                    Special Accessors.  (line  107)
! * SYMBOL_REF_TLS_MODEL:                  Special Accessors.  (line  111)
  * SYMBOL_REF_USED:                       Flags.              (line  197)
  * SYMBOL_REF_WEAK:                       Flags.              (line  202)
! * symbolic label:                        Sharing.            (line   20)
! * sync_addMODE instruction pattern:      Standard Names.     (line 1690)
! * sync_andMODE instruction pattern:      Standard Names.     (line 1690)
  * sync_compare_and_swapMODE instruction pattern: Standard Names.
!                                                              (line 1650)
! * sync_iorMODE instruction pattern:      Standard Names.     (line 1690)
! * sync_lock_releaseMODE instruction pattern: Standard Names. (line 1755)
  * sync_lock_test_and_setMODE instruction pattern: Standard Names.
!                                                              (line 1729)
! * sync_nandMODE instruction pattern:     Standard Names.     (line 1690)
! * sync_new_addMODE instruction pattern:  Standard Names.     (line 1722)
! * sync_new_andMODE instruction pattern:  Standard Names.     (line 1722)
! * sync_new_iorMODE instruction pattern:  Standard Names.     (line 1722)
! * sync_new_nandMODE instruction pattern: Standard Names.     (line 1722)
! * sync_new_subMODE instruction pattern:  Standard Names.     (line 1722)
! * sync_new_xorMODE instruction pattern:  Standard Names.     (line 1722)
! * sync_old_addMODE instruction pattern:  Standard Names.     (line 1705)
! * sync_old_andMODE instruction pattern:  Standard Names.     (line 1705)
! * sync_old_iorMODE instruction pattern:  Standard Names.     (line 1705)
! * sync_old_nandMODE instruction pattern: Standard Names.     (line 1705)
! * sync_old_subMODE instruction pattern:  Standard Names.     (line 1705)
! * sync_old_xorMODE instruction pattern:  Standard Names.     (line 1705)
! * sync_subMODE instruction pattern:      Standard Names.     (line 1690)
! * sync_xorMODE instruction pattern:      Standard Names.     (line 1690)
! * SYSROOT_HEADERS_SUFFIX_SPEC:           Driver.             (line  177)
! * SYSROOT_SUFFIX_SPEC:                   Driver.             (line  172)
  * t-TARGET:                              Target Fragment.    (line    6)
  * table jump:                            Basic Blocks.       (line   67)
! * tablejump instruction pattern:         Standard Names.     (line 1316)
  * tag:                                   GTY Options.        (line   88)
  * tagging insns:                         Tagging Insns.      (line    6)
  * tail calls:                            Tail Calls.         (line    6)
! * TAmode:                                Machine Modes.      (line  159)
  * target attributes:                     Target Attributes.  (line    6)
  * target description macros:             Target Macros.      (line    6)
  * target functions:                      Target Structure.   (line    6)
  * target hooks:                          Target Structure.   (line    6)
  * target makefile fragment:              Target Fragment.    (line    6)
  * target specifications:                 Run-time Target.    (line    6)
! * TARGET_ABSOLUTE_BIGGEST_ALIGNMENT:     Storage Layout.     (line  170)
  * TARGET_ADDR_SPACE_ADDRESS_MODE:        Named Address Spaces.
!                                                              (line   45)
  * TARGET_ADDR_SPACE_CONVERT:             Named Address Spaces.
!                                                              (line   88)
  * TARGET_ADDR_SPACE_LEGITIMATE_ADDRESS_P: Named Address Spaces.
!                                                              (line   63)
  * TARGET_ADDR_SPACE_LEGITIMIZE_ADDRESS:  Named Address Spaces.
!                                                              (line   72)
  * TARGET_ADDR_SPACE_POINTER_MODE:        Named Address Spaces.
!                                                              (line   38)
  * TARGET_ADDR_SPACE_SUBSET_P:            Named Address Spaces.
!                                                              (line   79)
  * TARGET_ADDR_SPACE_VALID_POINTER_MODE:  Named Address Spaces.
!                                                              (line   52)
! * TARGET_ADDRESS_COST:                   Costs.              (line  310)
! * TARGET_ALIGN_ANON_BITFIELD:            Storage Layout.     (line  406)
! * TARGET_ALLOCATE_INITIAL_VALUE:         Misc.               (line  814)
! * TARGET_ALLOCATE_STACK_SLOTS_FOR_ARGS:  Misc.               (line 1121)
! * TARGET_ALWAYS_STRIP_DOTDOT:            Driver.             (line  247)
! * TARGET_ARG_PARTIAL_BYTES:              Register Arguments. (line   98)
  * TARGET_ARM_EABI_UNWINDER:              Exception Region Output.
!                                                              (line  135)
! * TARGET_ARRAY_MODE_SUPPORTED_P:         Register Arguments. (line  349)
! * TARGET_ASAN_SHADOW_OFFSET:             Misc.               (line 1149)
! * TARGET_ASM_ALIGNED_DI_OP:              Data Output.        (line   10)
! * TARGET_ASM_ALIGNED_HI_OP:              Data Output.        (line    8)
! * TARGET_ASM_ALIGNED_SI_OP:              Data Output.        (line    9)
! * TARGET_ASM_ALIGNED_TI_OP:              Data Output.        (line   11)
! * TARGET_ASM_ASSEMBLE_UNDEFINED_DECL:    Label Output.       (line  208)
! * TARGET_ASM_ASSEMBLE_VISIBILITY:        Label Output.       (line  278)
! * TARGET_ASM_BYTE_OP:                    Data Output.        (line    7)
! * TARGET_ASM_CAN_OUTPUT_MI_THUNK:        Function Entry.     (line  207)
! * TARGET_ASM_CLOSE_PAREN:                Data Output.        (line  135)
! * TARGET_ASM_CODE_END:                   File Framework.     (line   59)
  * TARGET_ASM_CONSTRUCTOR:                Macros for Initialization.
!                                                              (line   69)
! * TARGET_ASM_DECL_END:                   Data Output.        (line   39)
! * TARGET_ASM_DECLARE_CONSTANT_NAME:      Label Output.       (line  154)
  * TARGET_ASM_DESTRUCTOR:                 Macros for Initialization.
!                                                              (line   83)
! * TARGET_ASM_EMIT_EXCEPT_PERSONALITY:    Dispatch Tables.    (line   82)
! * TARGET_ASM_EMIT_EXCEPT_TABLE_LABEL:    Dispatch Tables.    (line   74)
! * TARGET_ASM_EMIT_UNWIND_LABEL:          Dispatch Tables.    (line   63)
! * TARGET_ASM_EXTERNAL_LIBCALL:           Label Output.       (line  313)
! * TARGET_ASM_FILE_END:                   File Framework.     (line   37)
! * TARGET_ASM_FILE_START:                 File Framework.     (line    9)
! * TARGET_ASM_FILE_START_APP_OFF:         File Framework.     (line   17)
! * TARGET_ASM_FILE_START_FILE_DIRECTIVE:  File Framework.     (line   31)
! * TARGET_ASM_FINAL_POSTSCAN_INSN:        Instruction Output. (line   84)
! * TARGET_ASM_FUNCTION_BEGIN_EPILOGUE:    Function Entry.     (line   61)
! * TARGET_ASM_FUNCTION_END_PROLOGUE:      Function Entry.     (line   55)
! * TARGET_ASM_FUNCTION_EPILOGUE:          Function Entry.     (line   68)
! * TARGET_ASM_FUNCTION_PROLOGUE:          Function Entry.     (line   11)
! * TARGET_ASM_FUNCTION_RODATA_SECTION:    Sections.           (line  215)
! * TARGET_ASM_FUNCTION_SECTION:           File Framework.     (line  124)
  * TARGET_ASM_FUNCTION_SWITCHED_TEXT_SECTIONS: File Framework.
!                                                              (line  134)
! * TARGET_ASM_GLOBALIZE_DECL_NAME:        Label Output.       (line  199)
! * TARGET_ASM_GLOBALIZE_LABEL:            Label Output.       (line  190)
! * TARGET_ASM_INIT_SECTIONS:              Sections.           (line  160)
! * TARGET_ASM_INTEGER:                    Data Output.        (line   27)
! * TARGET_ASM_INTERNAL_LABEL:             Label Output.       (line  357)
! * TARGET_ASM_JUMP_ALIGN_MAX_SKIP:        Alignment Output.   (line   22)
  * TARGET_ASM_LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP: Alignment Output.
!                                                              (line   36)
! * TARGET_ASM_LABEL_ALIGN_MAX_SKIP:       Alignment Output.   (line   69)
! * TARGET_ASM_LOOP_ALIGN_MAX_SKIP:        Alignment Output.   (line   54)
! * TARGET_ASM_LTO_END:                    File Framework.     (line   54)
! * TARGET_ASM_LTO_START:                  File Framework.     (line   49)
! * TARGET_ASM_MARK_DECL_PRESERVED:        Label Output.       (line  320)
! * TARGET_ASM_MERGEABLE_RODATA_PREFIX:    Sections.           (line  222)
! * TARGET_ASM_NAMED_SECTION:              File Framework.     (line  116)
! * TARGET_ASM_OPEN_PAREN:                 Data Output.        (line  134)
! * TARGET_ASM_OUTPUT_ADDR_CONST_EXTRA:    Data Output.        (line   44)
! * TARGET_ASM_OUTPUT_ANCHOR:              Anchored Addresses. (line   44)
! * TARGET_ASM_OUTPUT_DWARF_DTPREL:        SDB and DWARF.      (line  105)
! * TARGET_ASM_OUTPUT_IDENT:               File Framework.     (line  102)
! * TARGET_ASM_OUTPUT_MI_THUNK:            Function Entry.     (line  165)
! * TARGET_ASM_OUTPUT_SOURCE_FILENAME:     File Framework.     (line   94)
! * TARGET_ASM_RECORD_GCC_SWITCHES:        File Framework.     (line  165)
! * TARGET_ASM_RECORD_GCC_SWITCHES_SECTION: File Framework.    (line  209)
! * TARGET_ASM_RELOC_RW_MASK:              Sections.           (line  169)
! * TARGET_ASM_SELECT_RTX_SECTION:         Sections.           (line  232)
! * TARGET_ASM_SELECT_SECTION:             Sections.           (line  181)
! * TARGET_ASM_TM_CLONE_TABLE_SECTION:     Sections.           (line  227)
! * TARGET_ASM_TRAMPOLINE_TEMPLATE:        Trampolines.        (line   29)
  * TARGET_ASM_TTYPE:                      Exception Region Output.
!                                                              (line  129)
! * TARGET_ASM_UNALIGNED_DI_OP:            Data Output.        (line   14)
! * TARGET_ASM_UNALIGNED_HI_OP:            Data Output.        (line   12)
! * TARGET_ASM_UNALIGNED_SI_OP:            Data Output.        (line   13)
! * TARGET_ASM_UNALIGNED_TI_OP:            Data Output.        (line   15)
! * TARGET_ASM_UNIQUE_SECTION:             Sections.           (line  202)
! * TARGET_ASM_UNWIND_EMIT:                Dispatch Tables.    (line   89)
! * TARGET_ASM_UNWIND_EMIT_BEFORE_INSN:    Dispatch Tables.    (line   94)
! * TARGET_ATOMIC_ALIGN_FOR_MODE:          Misc.               (line 1169)
! * TARGET_ATOMIC_ASSIGN_EXPAND_FENV:      Misc.               (line 1175)
! * TARGET_ATOMIC_TEST_AND_SET_TRUEVAL:    Misc.               (line 1159)
! * TARGET_ATTRIBUTE_TABLE:                Target Attributes.  (line   11)
! * TARGET_ATTRIBUTE_TAKES_IDENTIFIER_P:   Target Attributes.  (line   19)
! * TARGET_BINDS_LOCAL_P:                  Sections.           (line  309)
! * TARGET_BRANCH_TARGET_REGISTER_CALLEE_SAVED: Misc.          (line  911)
! * TARGET_BRANCH_TARGET_REGISTER_CLASS:   Misc.               (line  903)
! * TARGET_BUILD_BUILTIN_VA_LIST:          Register Arguments. (line  287)
  * TARGET_BUILTIN_CHKP_FUNCTION:          Misc.               (line  624)
! * TARGET_BUILTIN_DECL:                   Misc.               (line  605)
! * TARGET_BUILTIN_RECIPROCAL:             Addressing Modes.   (line  264)
! * TARGET_BUILTIN_SETJMP_FRAME_VALUE:     Frame Layout.       (line  109)
! * TARGET_C_PREINCLUDE:                   Misc.               (line  362)
! * TARGET_CALL_ARGS:                      Varargs.            (line  127)
  * TARGET_CALL_FUSAGE_CONTAINS_NON_CALLEE_CLOBBERS: Miscellaneous Register Hooks.
!                                                              (line    7)
! * TARGET_CALLEE_COPIES:                  Register Arguments. (line  130)
! * TARGET_CAN_ELIMINATE:                  Elimination.        (line   75)
! * TARGET_CAN_FOLLOW_JUMP:                Misc.               (line  801)
! * TARGET_CAN_INLINE_P:                   Target Attributes.  (line  166)
! * TARGET_CAN_USE_DOLOOP_P:               Misc.               (line  767)
! * TARGET_CANNOT_FORCE_CONST_MEM:         Addressing Modes.   (line  237)
! * TARGET_CANNOT_MODIFY_JUMPS_P:          Misc.               (line  890)
! * TARGET_CANNOT_SUBSTITUTE_MEM_EQUIV_P:  Register Classes.   (line  597)
! * TARGET_CANONICAL_VA_LIST_TYPE:         Register Arguments. (line  308)
  * TARGET_CANONICALIZE_COMPARISON:        MODE_CC Condition Codes.
!                                                              (line   57)
! * TARGET_CASE_VALUES_THRESHOLD:          Misc.               (line   47)
  * TARGET_CC_MODES_COMPATIBLE:            MODE_CC Condition Codes.
!                                                              (line  122)
! * TARGET_CHECK_PCH_TARGET_FLAGS:         PCH Target.         (line   28)
! * TARGET_CHECK_STRING_OBJECT_FORMAT_ARG: Run-time Target.    (line  121)
! * TARGET_CHKP_BOUND_MODE:                Misc.               (line  699)
! * TARGET_CHKP_BOUND_TYPE:                Misc.               (line  696)
! * TARGET_CHKP_FUNCTION_VALUE_BOUNDS:     Varargs.            (line  188)
! * TARGET_CHKP_INITIALIZE_BOUNDS:         Misc.               (line  708)
! * TARGET_CHKP_MAKE_BOUNDS_CONSTANT:      Misc.               (line  703)
! * TARGET_CLASS_LIKELY_SPILLED_P:         Register Classes.   (line  494)
! * TARGET_CLASS_MAX_NREGS:                Register Classes.   (line  511)
! * TARGET_COMMUTATIVE_P:                  Misc.               (line  807)
! * TARGET_COMP_TYPE_ATTRIBUTES:           Target Attributes.  (line   27)
! * TARGET_COMPARE_VERSION_PRIORITY:       Misc.               (line  742)
! * TARGET_CONDITIONAL_REGISTER_USAGE:     Register Basics.    (line   60)
! * TARGET_CONST_ANCHOR:                   Misc.               (line 1132)
! * TARGET_CONST_NOT_OK_FOR_DEBUG_P:       Addressing Modes.   (line  232)
! * TARGET_CONVERT_TO_TYPE:                Misc.               (line 1085)
! * TARGET_CPU_CPP_BUILTINS:               Run-time Target.    (line    9)
! * TARGET_CSTORE_MODE:                    Register Classes.   (line  621)
! * TARGET_CXX_ADJUST_CLASS_AT_DEFINITION: C++ ABI.            (line   87)
! * TARGET_CXX_CDTOR_RETURNS_THIS:         C++ ABI.            (line   38)
! * TARGET_CXX_CLASS_DATA_ALWAYS_COMDAT:   C++ ABI.            (line   62)
! * TARGET_CXX_COOKIE_HAS_SIZE:            C++ ABI.            (line   25)
! * TARGET_CXX_DECL_MANGLING_CONTEXT:      C++ ABI.            (line   93)
! * TARGET_CXX_DETERMINE_CLASS_DATA_VISIBILITY: C++ ABI.       (line   54)
! * TARGET_CXX_GET_COOKIE_SIZE:            C++ ABI.            (line   18)
! * TARGET_CXX_GUARD_MASK_BIT:             C++ ABI.            (line   12)
! * TARGET_CXX_GUARD_TYPE:                 C++ ABI.            (line    7)
! * TARGET_CXX_IMPLICIT_EXTERN_C:          Misc.               (line  374)
! * TARGET_CXX_IMPORT_EXPORT_CLASS:        C++ ABI.            (line   30)
! * TARGET_CXX_KEY_METHOD_MAY_BE_INLINE:   C++ ABI.            (line   43)
! * TARGET_CXX_LIBRARY_RTTI_COMDAT:        C++ ABI.            (line   69)
! * TARGET_CXX_USE_AEABI_ATEXIT:           C++ ABI.            (line   74)
! * TARGET_CXX_USE_ATEXIT_FOR_CXA_ATEXIT:  C++ ABI.            (line   80)
! * TARGET_DEBUG_UNWIND_INFO:              SDB and DWARF.      (line   37)
! * TARGET_DECIMAL_FLOAT_SUPPORTED_P:      Storage Layout.     (line  512)
! * TARGET_DECLSPEC:                       Target Attributes.  (line   73)
! * TARGET_DEFAULT_PACK_STRUCT:            Misc.               (line  448)
! * TARGET_DEFAULT_SHORT_ENUMS:            Type Layout.        (line  130)
! * TARGET_DEFAULT_TARGET_FLAGS:           Run-time Target.    (line   56)
! * TARGET_DEFERRED_OUTPUT_DEFS:           Label Output.       (line  441)
! * TARGET_DELAY_SCHED2:                   SDB and DWARF.      (line   66)
! * TARGET_DELAY_VARTRACK:                 SDB and DWARF.      (line   70)
! * TARGET_DELEGITIMIZE_ADDRESS:           Addressing Modes.   (line  223)
! * TARGET_DIFFERENT_ADDR_DISPLACEMENT_P:  Register Classes.   (line  590)
  * TARGET_DLLIMPORT_DECL_ATTRIBUTES:      Target Attributes.  (line   55)
! * TARGET_DWARF_CALLING_CONVENTION:       SDB and DWARF.      (line   18)
  * TARGET_DWARF_FRAME_REG_MODE:           Exception Region Output.
!                                                              (line  115)
! * TARGET_DWARF_HANDLE_FRAME_UNSPEC:      Frame Layout.       (line  174)
  * TARGET_DWARF_REGISTER_SPAN:            Exception Region Output.
!                                                              (line  106)
! * TARGET_EDOM:                           Library Calls.      (line   60)
! * TARGET_EMUTLS_DEBUG_FORM_TLS_ADDRESS:  Emulated TLS.       (line   68)
! * TARGET_EMUTLS_GET_ADDRESS:             Emulated TLS.       (line   19)
! * TARGET_EMUTLS_REGISTER_COMMON:         Emulated TLS.       (line   24)
! * TARGET_EMUTLS_TMPL_PREFIX:             Emulated TLS.       (line   45)
! * TARGET_EMUTLS_TMPL_SECTION:            Emulated TLS.       (line   36)
! * TARGET_EMUTLS_VAR_ALIGN_FIXED:         Emulated TLS.       (line   63)
! * TARGET_EMUTLS_VAR_FIELDS:              Emulated TLS.       (line   49)
! * TARGET_EMUTLS_VAR_INIT:                Emulated TLS.       (line   57)
! * TARGET_EMUTLS_VAR_PREFIX:              Emulated TLS.       (line   41)
! * TARGET_EMUTLS_VAR_SECTION:             Emulated TLS.       (line   31)
! * TARGET_ENCODE_SECTION_INFO:            Sections.           (line  253)
  * TARGET_ENCODE_SECTION_INFO and address validation: Addressing Modes.
!                                                              (line   83)
! * TARGET_ENCODE_SECTION_INFO usage:      Instruction Output. (line  128)
! * TARGET_END_CALL_ARGS:                  Varargs.            (line  141)
! * TARGET_ENUM_VA_LIST_P:                 Register Arguments. (line  292)
  * TARGET_EXCEPT_UNWIND_INFO:             Exception Region Output.
!                                                              (line   48)
! * TARGET_EXECUTABLE_SUFFIX:              Misc.               (line  864)
! * TARGET_EXPAND_BUILTIN:                 Misc.               (line  615)
! * TARGET_EXPAND_BUILTIN_SAVEREGS:        Varargs.            (line   67)
! * TARGET_EXPAND_TO_RTL_HOOK:             Storage Layout.     (line  518)
  * TARGET_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
! * TARGET_EXTRA_INCLUDES:                 Misc.               (line  978)
! * TARGET_EXTRA_LIVE_ON_ENTRY:            Tail Calls.         (line   21)
! * TARGET_EXTRA_PRE_INCLUDES:             Misc.               (line  985)
  * TARGET_FIXED_CONDITION_CODE_REGS:      MODE_CC Condition Codes.
!                                                              (line  107)
! * TARGET_FIXED_POINT_SUPPORTED_P:        Storage Layout.     (line  515)
! * target_flags:                          Run-time Target.    (line   52)
  * TARGET_FLAGS_REGNUM:                   MODE_CC Condition Codes.
!                                                              (line  134)
  * TARGET_FLOAT_EXCEPTIONS_ROUNDING_SUPPORTED_P: Run-time Target.
!                                                              (line  185)
! * TARGET_FLT_EVAL_METHOD:                Type Layout.        (line  111)
! * TARGET_FN_ABI_VA_LIST:                 Register Arguments. (line  303)
! * TARGET_FOLD_BUILTIN:                   Misc.               (line  725)
! * TARGET_FORCE_AT_COMP_DIR:              SDB and DWARF.      (line   61)
! * TARGET_FORMAT_TYPES:                   Misc.               (line 1005)
! * TARGET_FRAME_POINTER_REQUIRED:         Elimination.        (line    9)
! * TARGET_FUNCTION_ARG:                   Register Arguments. (line   12)
! * TARGET_FUNCTION_ARG_ADVANCE:           Register Arguments. (line  201)
! * TARGET_FUNCTION_ARG_BOUNDARY:          Register Arguments. (line  255)
! * TARGET_FUNCTION_ARG_ROUND_BOUNDARY:    Register Arguments. (line  261)
! * TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P: Target Attributes.  (line   95)
! * TARGET_FUNCTION_INCOMING_ARG:          Register Arguments. (line   74)
! * TARGET_FUNCTION_OK_FOR_SIBCALL:        Tail Calls.         (line    8)
! * TARGET_FUNCTION_VALUE:                 Scalar Return.      (line   11)
! * TARGET_FUNCTION_VALUE_REGNO_P:         Scalar Return.      (line   97)
! * TARGET_GEN_CCMP_FIRST:                 Misc.               (line  932)
! * TARGET_GEN_CCMP_NEXT:                  Misc.               (line  943)
! * TARGET_GENERATE_VERSION_DISPATCHER_BODY: Misc.             (line  759)
! * TARGET_GET_DRAP_RTX:                   Misc.               (line 1115)
! * TARGET_GET_FUNCTION_VERSIONS_DISPATCHER: Misc.             (line  752)
! * TARGET_GET_PCH_VALIDITY:               PCH Target.         (line    7)
! * TARGET_GET_RAW_ARG_MODE:               Aggregate Return.   (line   82)
! * TARGET_GET_RAW_RESULT_MODE:            Aggregate Return.   (line   77)
! * TARGET_GIMPLE_FOLD_BUILTIN:            Misc.               (line  735)
! * TARGET_GIMPLIFY_VA_ARG_EXPR:           Register Arguments. (line  314)
! * TARGET_HANDLE_C_OPTION:                Run-time Target.    (line   75)
! * TARGET_HANDLE_OPTION:                  Run-time Target.    (line   62)
  * TARGET_HARD_REGNO_SCRATCH_OK:          Values in Registers.
!                                                              (line  144)
! * TARGET_HAS_IFUNC_P:                    Misc.               (line 1163)
! * TARGET_HAS_NO_HW_DIVIDE:               Library Calls.      (line   53)
! * TARGET_HAVE_CONDITIONAL_EXECUTION:     Misc.               (line  925)
  * TARGET_HAVE_CTORS_DTORS:               Macros for Initialization.
!                                                              (line   64)
! * TARGET_HAVE_NAMED_SECTIONS:            File Framework.     (line  141)
! * TARGET_HAVE_SRODATA_SECTION:           Sections.           (line  298)
! * TARGET_HAVE_SWITCHABLE_BSS_SECTIONS:   File Framework.     (line  146)
! * TARGET_HAVE_TLS:                       Sections.           (line  318)
! * TARGET_IN_SMALL_DATA_P:                Sections.           (line  294)
! * TARGET_INIT_BUILTINS:                  Misc.               (line  588)
  * TARGET_INIT_DWARF_REG_SIZES_EXTRA:     Exception Region Output.
!                                                              (line  121)
! * TARGET_INIT_LIBFUNCS:                  Library Calls.      (line   16)
! * TARGET_INIT_PIC_REG:                   Register Arguments. (line   93)
! * TARGET_INSERT_ATTRIBUTES:              Target Attributes.  (line   82)
! * TARGET_INSTANTIATE_DECLS:              Storage Layout.     (line  526)
! * TARGET_INVALID_ARG_FOR_UNPROTOTYPED_FN: Misc.              (line 1039)
! * TARGET_INVALID_BINARY_OP:              Misc.               (line 1058)
! * TARGET_INVALID_CONVERSION:             Misc.               (line 1045)
! * TARGET_INVALID_PARAMETER_TYPE:         Misc.               (line 1064)
! * TARGET_INVALID_RETURN_TYPE:            Misc.               (line 1071)
! * TARGET_INVALID_UNARY_OP:               Misc.               (line 1051)
! * TARGET_INVALID_WITHIN_DOLOOP:          Misc.               (line  783)
! * TARGET_KEEP_LEAF_WHEN_PROFILED:        Profiling.          (line   40)
! * TARGET_LEGITIMATE_ADDRESS_P:           Addressing Modes.   (line   50)
! * TARGET_LEGITIMATE_COMBINED_INSN:       Misc.               (line  795)
! * TARGET_LEGITIMATE_CONSTANT_P:          Addressing Modes.   (line  216)
! * TARGET_LEGITIMIZE_ADDRESS:             Addressing Modes.   (line  132)
! * TARGET_LEGITIMIZE_ADDRESS_DISPLACEMENT: Register Classes.  (line  607)
! * TARGET_LIB_INT_CMP_BIASED:             Library Calls.      (line   43)
! * TARGET_LIBC_HAS_FUNCTION:              Library Calls.      (line   79)
! * TARGET_LIBCALL_VALUE:                  Scalar Return.      (line   66)
! * TARGET_LIBFUNC_GNU_PREFIX:             Library Calls.      (line   25)
! * TARGET_LIBGCC_CMP_RETURN_MODE:         Storage Layout.     (line  468)
  * TARGET_LIBGCC_FLOATING_MODE_SUPPORTED_P: Register Arguments.
!                                                              (line  373)
! * TARGET_LIBGCC_SDATA_SECTION:           Sections.           (line  132)
! * TARGET_LIBGCC_SHIFT_COUNT_MODE:        Storage Layout.     (line  474)
! * TARGET_LOAD_BOUNDS_FOR_ARG:            Varargs.            (line  158)
! * TARGET_LOAD_RETURNED_BOUNDS:           Varargs.            (line  177)
! * TARGET_LOOP_UNROLL_ADJUST:             Misc.               (line  959)
! * TARGET_LRA_P:                          Register Classes.   (line  563)
! * TARGET_MACHINE_DEPENDENT_REORG:        Misc.               (line  573)
! * TARGET_MANGLE_ASSEMBLER_NAME:          Label Output.       (line  332)
! * TARGET_MANGLE_DECL_ASSEMBLER_NAME:     Sections.           (line  243)
! * TARGET_MANGLE_TYPE:                    Storage Layout.     (line  530)
! * TARGET_MAX_ANCHOR_OFFSET:              Anchored Addresses. (line   39)
! * TARGET_MD_ASM_CLOBBERS:                Misc.               (line  494)
! * TARGET_MEM_CONSTRAINT:                 Addressing Modes.   (line  109)
  * TARGET_MEM_REF:                        Storage References. (line    6)
! * TARGET_MEMBER_TYPE_FORCES_BLK:         Storage Layout.     (line  421)
! * TARGET_MEMMODEL_CHECK:                 Misc.               (line 1155)
! * TARGET_MEMORY_MOVE_COST:               Costs.              (line   81)
! * TARGET_MERGE_DECL_ATTRIBUTES:          Target Attributes.  (line   47)
! * TARGET_MERGE_TYPE_ATTRIBUTES:          Target Attributes.  (line   39)
! * TARGET_MIN_ANCHOR_OFFSET:              Anchored Addresses. (line   33)
! * TARGET_MIN_DIVISIONS_FOR_RECIP_MUL:    Misc.               (line   92)
! * TARGET_MODE_AFTER:                     Mode Switching.     (line   59)
! * TARGET_MODE_DEPENDENT_ADDRESS_P:       Addressing Modes.   (line  199)
! * TARGET_MODE_EMIT:                      Mode Switching.     (line   44)
! * TARGET_MODE_ENTRY:                     Mode Switching.     (line   65)
! * TARGET_MODE_EXIT:                      Mode Switching.     (line   72)
! * TARGET_MODE_NEEDED:                    Mode Switching.     (line   51)
! * TARGET_MODE_PRIORITY:                  Mode Switching.     (line   79)
! * TARGET_MODE_REP_EXTENDED:              Misc.               (line  177)
! * TARGET_MS_BITFIELD_LAYOUT_P:           Storage Layout.     (line  485)
! * TARGET_MUST_PASS_IN_STACK:             Register Arguments. (line   67)
  * TARGET_MUST_PASS_IN_STACK, and TARGET_FUNCTION_ARG: Register Arguments.
!                                                              (line   57)
! * TARGET_N_FORMAT_TYPES:                 Misc.               (line 1010)
! * TARGET_NARROW_VOLATILE_BITFIELD:       Storage Layout.     (line  412)
! * TARGET_NO_REGISTER_ALLOCATION:         SDB and DWARF.      (line   74)
! * TARGET_OBJC_CONSTRUCT_STRING_OBJECT:   Run-time Target.    (line   90)
! * TARGET_OBJC_DECLARE_CLASS_DEFINITION:  Run-time Target.    (line  111)
  * TARGET_OBJC_DECLARE_UNRESOLVED_CLASS_REFERENCE: Run-time Target.
!                                                              (line  106)
! * TARGET_OBJECT_SUFFIX:                  Misc.               (line  859)
! * TARGET_OBJFMT_CPP_BUILTINS:            Run-time Target.    (line   46)
! * TARGET_OFFLOAD_OPTIONS:                Misc.               (line 1199)
  * TARGET_OMIT_STRUCT_RETURN_REG:         Scalar Return.      (line  117)
! * TARGET_OPTF:                           Misc.               (line  992)
! * TARGET_OPTION_DEFAULT_PARAMS:          Run-time Target.    (line  161)
! * TARGET_OPTION_FUNCTION_VERSIONS:       Target Attributes.  (line  159)
! * TARGET_OPTION_INIT_STRUCT:             Run-time Target.    (line  158)
! * TARGET_OPTION_OPTIMIZATION_TABLE:      Run-time Target.    (line  144)
! * TARGET_OPTION_OVERRIDE:                Target Attributes.  (line  145)
! * TARGET_OPTION_POST_STREAM_IN:          Target Attributes.  (line  127)
! * TARGET_OPTION_PRAGMA_PARSE:            Target Attributes.  (line  139)
! * TARGET_OPTION_PRINT:                   Target Attributes.  (line  133)
! * TARGET_OPTION_RESTORE:                 Target Attributes.  (line  121)
! * TARGET_OPTION_SAVE:                    Target Attributes.  (line  114)
! * TARGET_OPTION_VALID_ATTRIBUTE_P:       Target Attributes.  (line  102)
! * TARGET_OS_CPP_BUILTINS:                Run-time Target.    (line   42)
! * TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE:  Run-time Target.    (line  127)
! * TARGET_OVERRIDES_FORMAT_ATTRIBUTES:    Misc.               (line 1014)
! * TARGET_OVERRIDES_FORMAT_ATTRIBUTES_COUNT: Misc.            (line 1020)
! * TARGET_OVERRIDES_FORMAT_INIT:          Misc.               (line 1024)
! * TARGET_PASS_BY_REFERENCE:              Register Arguments. (line  118)
! * TARGET_PCH_VALID_P:                    PCH Target.         (line   13)
! * TARGET_POSIX_IO:                       Misc.               (line  518)
! * TARGET_PREFERRED_OUTPUT_RELOAD_CLASS:  Register Classes.   (line  289)
! * TARGET_PREFERRED_RELOAD_CLASS:         Register Classes.   (line  218)
! * TARGET_PREFERRED_RENAME_CLASS:         Register Classes.   (line  206)
! * TARGET_PREPARE_PCH_SAVE:               PCH Target.         (line   35)
! * TARGET_PRETEND_OUTGOING_VARARGS_NAMED: Varargs.            (line  149)
! * TARGET_PROFILE_BEFORE_PROLOGUE:        Sections.           (line  302)
! * TARGET_PROMOTE_FUNCTION_MODE:          Storage Layout.     (line  113)
! * TARGET_PROMOTE_PROTOTYPES:             Stack Arguments.    (line   11)
! * TARGET_PROMOTED_TYPE:                  Misc.               (line 1077)
! * TARGET_PTRMEMFUNC_VBIT_LOCATION:       Type Layout.        (line  258)
! * TARGET_RECORD_OFFLOAD_SYMBOL:          Misc.               (line 1193)
! * TARGET_REF_MAY_ALIAS_ERRNO:            Register Arguments. (line  325)
! * TARGET_REGISTER_MOVE_COST:             Costs.              (line   33)
! * TARGET_REGISTER_PRIORITY:              Register Classes.   (line  568)
! * TARGET_REGISTER_USAGE_LEVELING_P:      Register Classes.   (line  580)
! * TARGET_RELAXED_ORDERING:               Misc.               (line 1029)
! * TARGET_RESOLVE_OVERLOADED_BUILTIN:     Misc.               (line  714)
! * TARGET_RETURN_IN_MEMORY:               Aggregate Return.   (line   17)
  * TARGET_RETURN_IN_MSB:                  Scalar Return.      (line  124)
! * TARGET_RETURN_POPS_ARGS:               Stack Arguments.    (line  100)
! * TARGET_RTX_COSTS:                      Costs.              (line  279)
! * TARGET_SCALAR_MODE_SUPPORTED_P:        Register Arguments. (line  332)
! * TARGET_SCHED_ADJUST_COST:              Scheduling.         (line   37)
! * TARGET_SCHED_ADJUST_PRIORITY:          Scheduling.         (line   52)
! * TARGET_SCHED_ALLOC_SCHED_CONTEXT:      Scheduling.         (line  297)
! * TARGET_SCHED_CLEAR_SCHED_CONTEXT:      Scheduling.         (line  312)
! * TARGET_SCHED_DEPENDENCIES_EVALUATION_HOOK: Scheduling.     (line  103)
! * TARGET_SCHED_DFA_NEW_CYCLE:            Scheduling.         (line  258)
! * TARGET_SCHED_DFA_POST_ADVANCE_CYCLE:   Scheduling.         (line  174)
! * TARGET_SCHED_DFA_POST_CYCLE_INSN:      Scheduling.         (line  158)
! * TARGET_SCHED_DFA_PRE_ADVANCE_CYCLE:    Scheduling.         (line  167)
! * TARGET_SCHED_DFA_PRE_CYCLE_INSN:       Scheduling.         (line  146)
! * TARGET_SCHED_DISPATCH:                 Scheduling.         (line  366)
! * TARGET_SCHED_DISPATCH_DO:              Scheduling.         (line  371)
! * TARGET_SCHED_EXPOSED_PIPELINE:         Scheduling.         (line  375)
! * TARGET_SCHED_FINISH:                   Scheduling.         (line  123)
! * TARGET_SCHED_FINISH_GLOBAL:            Scheduling.         (line  140)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BACKTRACK: Scheduling.  (line  237)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BEGIN: Scheduling.      (line  226)
  * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD: Scheduling.
!                                                              (line  182)
  * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD_GUARD: Scheduling.
!                                                              (line  211)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_END: Scheduling.        (line  242)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_FINI: Scheduling.       (line  252)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_INIT: Scheduling.       (line  247)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_ISSUE: Scheduling.      (line  232)
! * TARGET_SCHED_FREE_SCHED_CONTEXT:       Scheduling.         (line  316)
! * TARGET_SCHED_FUSION_PRIORITY:          Scheduling.         (line  386)
! * TARGET_SCHED_GEN_SPEC_CHECK:           Scheduling.         (line  339)
! * TARGET_SCHED_H_I_D_EXTENDED:           Scheduling.         (line  292)
! * TARGET_SCHED_INIT:                     Scheduling.         (line  113)
! * TARGET_SCHED_INIT_DFA_POST_CYCLE_INSN: Scheduling.         (line  163)
! * TARGET_SCHED_INIT_DFA_PRE_CYCLE_INSN:  Scheduling.         (line  155)
! * TARGET_SCHED_INIT_GLOBAL:              Scheduling.         (line  132)
! * TARGET_SCHED_INIT_SCHED_CONTEXT:       Scheduling.         (line  302)
! * TARGET_SCHED_IS_COSTLY_DEPENDENCE:     Scheduling.         (line  269)
! * TARGET_SCHED_ISSUE_RATE:               Scheduling.         (line   12)
! * TARGET_SCHED_MACRO_FUSION_P:           Scheduling.         (line   88)
! * TARGET_SCHED_MACRO_FUSION_PAIR_P:      Scheduling.         (line   93)
! * TARGET_SCHED_NEEDS_BLOCK_P:            Scheduling.         (line  332)
! * TARGET_SCHED_REASSOCIATION_WIDTH:      Scheduling.         (line  381)
! * TARGET_SCHED_REORDER:                  Scheduling.         (line   60)
! * TARGET_SCHED_REORDER2:                 Scheduling.         (line   77)
! * TARGET_SCHED_SET_SCHED_CONTEXT:        Scheduling.         (line  308)
! * TARGET_SCHED_SET_SCHED_FLAGS:          Scheduling.         (line  351)
! * TARGET_SCHED_SMS_RES_MII:              Scheduling.         (line  357)
! * TARGET_SCHED_SPECULATE_INSN:           Scheduling.         (line  320)
! * TARGET_SCHED_VARIABLE_ISSUE:           Scheduling.         (line   24)
! * TARGET_SECONDARY_RELOAD:               Register Classes.   (line  318)
! * TARGET_SECTION_TYPE_FLAGS:             File Framework.     (line  152)
! * TARGET_SET_CURRENT_FUNCTION:           Misc.               (line  841)
! * TARGET_SET_DEFAULT_TYPE_ATTRIBUTES:    Target Attributes.  (line   34)
! * TARGET_SET_UP_BY_PROLOGUE:             Tail Calls.         (line   31)
! * TARGET_SETUP_INCOMING_VARARG_BOUNDS:   Varargs.            (line  195)
! * TARGET_SETUP_INCOMING_VARARGS:         Varargs.            (line   76)
! * TARGET_SHIFT_TRUNCATION_MASK:          Misc.               (line  140)
! * TARGET_SIMD_CLONE_ADJUST:              Addressing Modes.   (line  418)
  * TARGET_SIMD_CLONE_COMPUTE_VECSIZE_AND_SIMDLEN: Addressing Modes.
!                                                              (line  411)
! * TARGET_SIMD_CLONE_USABLE:              Addressing Modes.   (line  422)
  * TARGET_SMALL_REGISTER_CLASSES_FOR_MODE_P: Register Arguments.
!                                                              (line  381)
! * TARGET_SPILL_CLASS:                    Register Classes.   (line  615)
! * TARGET_SPLIT_COMPLEX_ARG:              Register Arguments. (line  275)
  * TARGET_STACK_PROTECT_FAIL:             Stack Smashing Protection.
!                                                              (line   17)
  * TARGET_STACK_PROTECT_GUARD:            Stack Smashing Protection.
!                                                              (line    7)
! * TARGET_STATIC_CHAIN:                   Frame Registers.    (line   92)
! * TARGET_STORE_BOUNDS_FOR_ARG:           Varargs.            (line  168)
! * TARGET_STORE_RETURNED_BOUNDS:          Varargs.            (line  183)
! * TARGET_STRICT_ARGUMENT_NAMING:         Varargs.            (line  112)
! * TARGET_STRING_OBJECT_REF_TYPE_P:       Run-time Target.    (line  116)
! * TARGET_STRIP_NAME_ENCODING:            Sections.           (line  290)
! * TARGET_STRUCT_VALUE_RTX:               Aggregate Return.   (line   45)
  * TARGET_SUPPORTS_SPLIT_STACK:           Stack Smashing Protection.
!                                                              (line   27)
! * TARGET_SUPPORTS_WEAK:                  Label Output.       (line  248)
! * TARGET_SUPPORTS_WIDE_INT:              Misc.               (line 1208)
  * TARGET_TERMINATE_DW2_EH_FRAME_INFO:    Exception Region Output.
!                                                              (line  100)
! * TARGET_TRAMPOLINE_ADJUST_ADDRESS:      Trampolines.        (line   75)
! * TARGET_TRAMPOLINE_INIT:                Trampolines.        (line   56)
! * TARGET_UNSPEC_MAY_TRAP_P:              Misc.               (line  833)
  * TARGET_UNWIND_TABLES_DEFAULT:          Exception Region Output.
!                                                              (line   74)
! * TARGET_UNWIND_WORD_MODE:               Storage Layout.     (line  480)
! * TARGET_UPDATE_STACK_BOUNDARY:          Misc.               (line 1111)
! * TARGET_USE_ANCHORS_FOR_SYMBOL_P:       Anchored Addresses. (line   55)
! * TARGET_USE_BLOCKS_FOR_CONSTANT_P:      Addressing Modes.   (line  251)
! * TARGET_USE_BLOCKS_FOR_DECL_P:          Addressing Modes.   (line  257)
! * TARGET_USE_BY_PIECES_INFRASTRUCTURE_P: Costs.              (line  167)
! * TARGET_USE_JCR_SECTION:                Misc.               (line 1093)
! * TARGET_USE_PSEUDO_PIC_REG:             Register Arguments. (line   89)
! * TARGET_USES_WEAK_UNWIND_INFO:          Exception Handling. (line  126)
! * TARGET_VALID_DLLIMPORT_ATTRIBUTE_P:    Target Attributes.  (line   68)
! * TARGET_VALID_POINTER_MODE:             Register Arguments. (line  320)
! * TARGET_VECTOR_ALIGNMENT:               Storage Layout.     (line  272)
! * TARGET_VECTOR_MODE_SUPPORTED_P:        Register Arguments. (line  343)
! * TARGET_VECTORIZE_ADD_STMT_COST:        Addressing Modes.   (line  373)
  * TARGET_VECTORIZE_AUTOVECTORIZE_VECTOR_SIZES: Addressing Modes.
!                                                              (line  353)
! * TARGET_VECTORIZE_BUILTIN_CONVERSION:   Addressing Modes.   (line  315)
! * TARGET_VECTORIZE_BUILTIN_GATHER:       Addressing Modes.   (line  404)
! * TARGET_VECTORIZE_BUILTIN_MASK_FOR_LOAD: Addressing Modes.  (line  273)
! * TARGET_VECTORIZE_BUILTIN_TM_LOAD:      Addressing Modes.   (line  395)
! * TARGET_VECTORIZE_BUILTIN_TM_STORE:     Addressing Modes.   (line  399)
  * TARGET_VECTORIZE_BUILTIN_VECTORIZATION_COST: Addressing Modes.
!                                                              (line  300)
  * TARGET_VECTORIZE_BUILTIN_VECTORIZED_FUNCTION: Addressing Modes.
!                                                              (line  327)
! * TARGET_VECTORIZE_DESTROY_COST_DATA:    Addressing Modes.   (line  390)
! * TARGET_VECTORIZE_FINISH_COST:          Addressing Modes.   (line  384)
! * TARGET_VECTORIZE_INIT_COST:            Addressing Modes.   (line  361)
! * TARGET_VECTORIZE_PREFERRED_SIMD_MODE:  Addressing Modes.   (line  346)
  * TARGET_VECTORIZE_SUPPORT_VECTOR_MISALIGNMENT: Addressing Modes.
!                                                              (line  337)
! * TARGET_VECTORIZE_VEC_PERM_CONST_OK:    Addressing Modes.   (line  311)
  * TARGET_VECTORIZE_VECTOR_ALIGNMENT_REACHABLE: Addressing Modes.
!                                                              (line  306)
! * TARGET_VTABLE_DATA_ENTRY_DISTANCE:     Type Layout.        (line  311)
! * TARGET_VTABLE_ENTRY_ALIGN:             Type Layout.        (line  305)
! * TARGET_VTABLE_USES_DESCRIPTORS:        Type Layout.        (line  294)
! * TARGET_WANT_DEBUG_PUB_SECTIONS:        SDB and DWARF.      (line   56)
! * TARGET_WARN_FUNC_RETURN:               Tail Calls.         (line   36)
! * TARGET_WEAK_NOT_IN_ARCHIVE_TOC:        Label Output.       (line  284)
! * targetm:                               Target Structure.   (line    7)
! * targets, makefile:                     Makefile.           (line    6)
! * TCmode:                                Machine Modes.      (line  200)
  * TDmode:                                Machine Modes.      (line   97)
  * TEMPLATE_DECL:                         Declarations.       (line    6)
  * Temporaries:                           Temporaries.        (line    6)
  * termination routines:                  Initialization.     (line    6)
  * testing constraints:                   C Constraint Interface.
                                                               (line    6)
! * TEXT_SECTION_ASM_OP:                   Sections.           (line   38)
  * TFmode:                                Machine Modes.      (line  101)
  * The Language:                          The Language.       (line    6)
  * THEN_CLAUSE:                           Statements for C++. (line    6)
! * THREAD_MODEL_SPEC:                     Driver.             (line  163)
  * THROW_EXPR:                            Unary and Binary Expressions.
                                                               (line    6)
  * THUNK_DECL:                            Declarations.       (line    6)
  * THUNK_DELTA:                           Declarations.       (line    6)
  * TImode:                                Machine Modes.      (line   48)
! * TImode, in insn:                       Insns.              (line  272)
! * TLS_COMMON_ASM_OP:                     Sections.           (line   81)
! * TLS_SECTION_ASM_FLAG:                  Sections.           (line   86)
  * tm.h macros:                           Target Macros.      (line    6)
  * TQFmode:                               Machine Modes.      (line   65)
  * TQmode:                                Machine Modes.      (line  122)
- * TRAMPOLINE_ALIGNMENT:                  Trampolines.        (line   49)
- * TRAMPOLINE_SECTION:                    Trampolines.        (line   40)
- * TRAMPOLINE_SIZE:                       Trampolines.        (line   45)
  * trampolines for nested functions:      Trampolines.        (line    6)
! * TRANSFER_FROM_TRAMPOLINE:              Trampolines.        (line  111)
! * trap instruction pattern:              Standard Names.     (line 1601)
  * tree <1>:                              Macros and Functions.
                                                               (line    6)
- * tree:                                  Tree overview.      (line    6)
  * Tree SSA:                              Tree SSA.           (line    6)
  * TREE_CHAIN:                            Macros and Functions.
                                                               (line    6)
--- 49761,50376 ----
  * subreg and /u:                         Flags.              (line  180)
  * subreg and /u and /v:                  Flags.              (line  170)
  * subreg, in strict_low_part:            RTL Declarations.   (line    9)
! * SUBREG_BYTE:                           Regs and Memory.    (line  285)
  * SUBREG_PROMOTED_UNSIGNED_P:            Flags.              (line  170)
  * SUBREG_PROMOTED_UNSIGNED_SET:          Flags.              (line  180)
  * SUBREG_PROMOTED_VAR_P:                 Flags.              (line  187)
! * SUBREG_REG:                            Regs and Memory.    (line  285)
  * subst iterators in .md files:          Subst Iterators.    (line    6)
! * subvM4 instruction pattern:            Standard Names.     (line  282)
  * SUCCESS_EXIT_CODE:                     Host Misc.          (line   12)
  * SUPPORTS_INIT_PRIORITY:                Macros for Initialization.
!                                                              (line   57)
! * SUPPORTS_ONE_ONLY:                     Label Output.       (line  262)
! * SUPPORTS_WEAK:                         Label Output.       (line  236)
! * SWITCHABLE_TARGET:                     Run-time Target.    (line  164)
  * SWITCH_BODY:                           Statements for C++. (line    6)
  * SWITCH_COND:                           Statements for C++. (line    6)
  * SWITCH_STMT:                           Statements for C++. (line    6)
! * symbolic label:                        Sharing.            (line   20)
! * SYMBOL_FLAG_ANCHOR:                    Special Accessors.  (line  117)
! * SYMBOL_FLAG_EXTERNAL:                  Special Accessors.  (line   99)
! * SYMBOL_FLAG_FUNCTION:                  Special Accessors.  (line   92)
! * SYMBOL_FLAG_HAS_BLOCK_INFO:            Special Accessors.  (line  113)
! * SYMBOL_FLAG_LOCAL:                     Special Accessors.  (line   95)
! * SYMBOL_FLAG_SMALL:                     Special Accessors.  (line  104)
! * SYMBOL_FLAG_TLS_SHIFT:                 Special Accessors.  (line  108)
  * symbol_ref:                            Constants.          (line  117)
  * symbol_ref and /f:                     Flags.              (line  165)
  * symbol_ref and /i:                     Flags.              (line  202)
  * symbol_ref and /u:                     Flags.              (line   10)
  * symbol_ref and /v:                     Flags.              (line  206)
  * symbol_ref, RTL sharing:               Sharing.            (line   20)
! * SYMBOL_REF_ANCHOR_P:                   Special Accessors.  (line  117)
! * SYMBOL_REF_BLOCK:                      Special Accessors.  (line  130)
! * SYMBOL_REF_BLOCK_OFFSET:               Special Accessors.  (line  135)
! * SYMBOL_REF_CONSTANT:                   Special Accessors.  (line   78)
! * SYMBOL_REF_DATA:                       Special Accessors.  (line   82)
! * SYMBOL_REF_DECL:                       Special Accessors.  (line   67)
! * SYMBOL_REF_EXTERNAL_P:                 Special Accessors.  (line   99)
  * SYMBOL_REF_FLAG:                       Flags.              (line  206)
  * SYMBOL_REF_FLAG, in TARGET_ENCODE_SECTION_INFO: Sections.  (line  277)
! * SYMBOL_REF_FLAGS:                      Special Accessors.  (line   86)
! * SYMBOL_REF_FUNCTION_P:                 Special Accessors.  (line   92)
! * SYMBOL_REF_HAS_BLOCK_INFO_P:           Special Accessors.  (line  113)
! * SYMBOL_REF_LOCAL_P:                    Special Accessors.  (line   95)
! * SYMBOL_REF_SMALL_P:                    Special Accessors.  (line  104)
! * SYMBOL_REF_TLS_MODEL:                  Special Accessors.  (line  108)
  * SYMBOL_REF_USED:                       Flags.              (line  197)
  * SYMBOL_REF_WEAK:                       Flags.              (line  202)
! * sync_addMODE instruction pattern:      Standard Names.     (line 1680)
! * sync_andMODE instruction pattern:      Standard Names.     (line 1680)
  * sync_compare_and_swapMODE instruction pattern: Standard Names.
!                                                              (line 1640)
! * sync_iorMODE instruction pattern:      Standard Names.     (line 1680)
! * sync_lock_releaseMODE instruction pattern: Standard Names. (line 1745)
  * sync_lock_test_and_setMODE instruction pattern: Standard Names.
!                                                              (line 1719)
! * sync_nandMODE instruction pattern:     Standard Names.     (line 1680)
! * sync_new_addMODE instruction pattern:  Standard Names.     (line 1712)
! * sync_new_andMODE instruction pattern:  Standard Names.     (line 1712)
! * sync_new_iorMODE instruction pattern:  Standard Names.     (line 1712)
! * sync_new_nandMODE instruction pattern: Standard Names.     (line 1712)
! * sync_new_subMODE instruction pattern:  Standard Names.     (line 1712)
! * sync_new_xorMODE instruction pattern:  Standard Names.     (line 1712)
! * sync_old_addMODE instruction pattern:  Standard Names.     (line 1695)
! * sync_old_andMODE instruction pattern:  Standard Names.     (line 1695)
! * sync_old_iorMODE instruction pattern:  Standard Names.     (line 1695)
! * sync_old_nandMODE instruction pattern: Standard Names.     (line 1695)
! * sync_old_subMODE instruction pattern:  Standard Names.     (line 1695)
! * sync_old_xorMODE instruction pattern:  Standard Names.     (line 1695)
! * sync_subMODE instruction pattern:      Standard Names.     (line 1680)
! * sync_xorMODE instruction pattern:      Standard Names.     (line 1680)
! * SYSROOT_HEADERS_SUFFIX_SPEC:           Driver.             (line  176)
! * SYSROOT_SUFFIX_SPEC:                   Driver.             (line  171)
  * t-TARGET:                              Target Fragment.    (line    6)
  * table jump:                            Basic Blocks.       (line   67)
! * tablejump instruction pattern:         Standard Names.     (line 1310)
  * tag:                                   GTY Options.        (line   88)
  * tagging insns:                         Tagging Insns.      (line    6)
  * tail calls:                            Tail Calls.         (line    6)
! * TAmode:                                Machine Modes.      (line  158)
  * target attributes:                     Target Attributes.  (line    6)
  * target description macros:             Target Macros.      (line    6)
  * target functions:                      Target Structure.   (line    6)
  * target hooks:                          Target Structure.   (line    6)
  * target makefile fragment:              Target Fragment.    (line    6)
  * target specifications:                 Run-time Target.    (line    6)
! * targetm:                               Target Structure.   (line    6)
! * targets, makefile:                     Makefile.           (line    6)
! * TARGET_ABSOLUTE_BIGGEST_ALIGNMENT:     Storage Layout.     (line  168)
! * TARGET_ADDRESS_COST:                   Costs.              (line  308)
  * TARGET_ADDR_SPACE_ADDRESS_MODE:        Named Address Spaces.
!                                                              (line   43)
  * TARGET_ADDR_SPACE_CONVERT:             Named Address Spaces.
!                                                              (line   85)
  * TARGET_ADDR_SPACE_LEGITIMATE_ADDRESS_P: Named Address Spaces.
!                                                              (line   61)
  * TARGET_ADDR_SPACE_LEGITIMIZE_ADDRESS:  Named Address Spaces.
!                                                              (line   69)
  * TARGET_ADDR_SPACE_POINTER_MODE:        Named Address Spaces.
!                                                              (line   36)
  * TARGET_ADDR_SPACE_SUBSET_P:            Named Address Spaces.
!                                                              (line   76)
  * TARGET_ADDR_SPACE_VALID_POINTER_MODE:  Named Address Spaces.
!                                                              (line   50)
! * TARGET_ALIGN_ANON_BITFIELD:            Storage Layout.     (line  402)
! * TARGET_ALLOCATE_INITIAL_VALUE:         Misc.               (line  809)
! * TARGET_ALLOCATE_STACK_SLOTS_FOR_ARGS:  Misc.               (line 1114)
! * TARGET_ALWAYS_STRIP_DOTDOT:            Driver.             (line  246)
! * TARGET_ARG_PARTIAL_BYTES:              Register Arguments. (line   95)
  * TARGET_ARM_EABI_UNWINDER:              Exception Region Output.
!                                                              (line  133)
! * TARGET_ARRAY_MODE_SUPPORTED_P:         Register Arguments. (line  345)
! * TARGET_ASAN_SHADOW_OFFSET:             Misc.               (line 1142)
! * TARGET_ASM_ALIGNED_DI_OP:              Data Output.        (line    9)
! * TARGET_ASM_ALIGNED_HI_OP:              Data Output.        (line    7)
! * TARGET_ASM_ALIGNED_SI_OP:              Data Output.        (line    8)
! * TARGET_ASM_ALIGNED_TI_OP:              Data Output.        (line   10)
! * TARGET_ASM_ASSEMBLE_UNDEFINED_DECL:    Label Output.       (line  203)
! * TARGET_ASM_ASSEMBLE_VISIBILITY:        Label Output.       (line  273)
! * TARGET_ASM_BYTE_OP:                    Data Output.        (line    6)
! * TARGET_ASM_CAN_OUTPUT_MI_THUNK:        Function Entry.     (line  202)
! * TARGET_ASM_CLOSE_PAREN:                Data Output.        (line  133)
! * TARGET_ASM_CODE_END:                   File Framework.     (line   57)
  * TARGET_ASM_CONSTRUCTOR:                Macros for Initialization.
!                                                              (line   68)
! * TARGET_ASM_DECLARE_CONSTANT_NAME:      Label Output.       (line  149)
! * TARGET_ASM_DECL_END:                   Data Output.        (line   38)
  * TARGET_ASM_DESTRUCTOR:                 Macros for Initialization.
!                                                              (line   82)
! * TARGET_ASM_EMIT_EXCEPT_PERSONALITY:    Dispatch Tables.    (line   80)
! * TARGET_ASM_EMIT_EXCEPT_TABLE_LABEL:    Dispatch Tables.    (line   73)
! * TARGET_ASM_EMIT_UNWIND_LABEL:          Dispatch Tables.    (line   61)
! * TARGET_ASM_EXTERNAL_LIBCALL:           Label Output.       (line  309)
! * TARGET_ASM_FILE_END:                   File Framework.     (line   35)
! * TARGET_ASM_FILE_START:                 File Framework.     (line    8)
! * TARGET_ASM_FILE_START_APP_OFF:         File Framework.     (line   16)
! * TARGET_ASM_FILE_START_FILE_DIRECTIVE:  File Framework.     (line   29)
! * TARGET_ASM_FINAL_POSTSCAN_INSN:        Instruction Output. (line   82)
! * TARGET_ASM_FUNCTION_BEGIN_EPILOGUE:    Function Entry.     (line   59)
! * TARGET_ASM_FUNCTION_END_PROLOGUE:      Function Entry.     (line   53)
! * TARGET_ASM_FUNCTION_EPILOGUE:          Function Entry.     (line   65)
! * TARGET_ASM_FUNCTION_PROLOGUE:          Function Entry.     (line    9)
! * TARGET_ASM_FUNCTION_RODATA_SECTION:    Sections.           (line  213)
! * TARGET_ASM_FUNCTION_SECTION:           File Framework.     (line  121)
  * TARGET_ASM_FUNCTION_SWITCHED_TEXT_SECTIONS: File Framework.
!                                                              (line  131)
! * TARGET_ASM_GLOBALIZE_DECL_NAME:        Label Output.       (line  194)
! * TARGET_ASM_GLOBALIZE_LABEL:            Label Output.       (line  185)
! * TARGET_ASM_INIT_SECTIONS:              Sections.           (line  159)
! * TARGET_ASM_INTEGER:                    Data Output.        (line   25)
! * TARGET_ASM_INTERNAL_LABEL:             Label Output.       (line  352)
! * TARGET_ASM_JUMP_ALIGN_MAX_SKIP:        Alignment Output.   (line   21)
  * TARGET_ASM_LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP: Alignment Output.
!                                                              (line   34)
! * TARGET_ASM_LABEL_ALIGN_MAX_SKIP:       Alignment Output.   (line   68)
! * TARGET_ASM_LOOP_ALIGN_MAX_SKIP:        Alignment Output.   (line   53)
! * TARGET_ASM_LTO_END:                    File Framework.     (line   52)
! * TARGET_ASM_LTO_START:                  File Framework.     (line   47)
! * TARGET_ASM_MARK_DECL_PRESERVED:        Label Output.       (line  315)
! * TARGET_ASM_MERGEABLE_RODATA_PREFIX:    Sections.           (line  221)
! * TARGET_ASM_NAMED_SECTION:              File Framework.     (line  113)
! * TARGET_ASM_OPEN_PAREN:                 Data Output.        (line  132)
! * TARGET_ASM_OUTPUT_ADDR_CONST_EXTRA:    Data Output.        (line   42)
! * TARGET_ASM_OUTPUT_ANCHOR:              Anchored Addresses. (line   42)
! * TARGET_ASM_OUTPUT_DWARF_DTPREL:        SDB and DWARF.      (line  103)
! * TARGET_ASM_OUTPUT_IDENT:               File Framework.     (line  100)
! * TARGET_ASM_OUTPUT_MI_THUNK:            Function Entry.     (line  160)
! * TARGET_ASM_OUTPUT_SOURCE_FILENAME:     File Framework.     (line   91)
! * TARGET_ASM_RECORD_GCC_SWITCHES:        File Framework.     (line  162)
! * TARGET_ASM_RECORD_GCC_SWITCHES_SECTION: File Framework.    (line  207)
! * TARGET_ASM_RELOC_RW_MASK:              Sections.           (line  168)
! * TARGET_ASM_SELECT_RTX_SECTION:         Sections.           (line  230)
! * TARGET_ASM_SELECT_SECTION:             Sections.           (line  179)
! * TARGET_ASM_TM_CLONE_TABLE_SECTION:     Sections.           (line  226)
! * TARGET_ASM_TRAMPOLINE_TEMPLATE:        Trampolines.        (line   28)
  * TARGET_ASM_TTYPE:                      Exception Region Output.
!                                                              (line  127)
! * TARGET_ASM_UNALIGNED_DI_OP:            Data Output.        (line   13)
! * TARGET_ASM_UNALIGNED_HI_OP:            Data Output.        (line   11)
! * TARGET_ASM_UNALIGNED_SI_OP:            Data Output.        (line   12)
! * TARGET_ASM_UNALIGNED_TI_OP:            Data Output.        (line   14)
! * TARGET_ASM_UNIQUE_SECTION:             Sections.           (line  201)
! * TARGET_ASM_UNWIND_EMIT:                Dispatch Tables.    (line   87)
! * TARGET_ASM_UNWIND_EMIT_BEFORE_INSN:    Dispatch Tables.    (line   93)
! * TARGET_ATOMIC_ALIGN_FOR_MODE:          Misc.               (line 1161)
! * TARGET_ATOMIC_ASSIGN_EXPAND_FENV:      Misc.               (line 1167)
! * TARGET_ATOMIC_TEST_AND_SET_TRUEVAL:    Misc.               (line 1152)
! * TARGET_ATTRIBUTE_TABLE:                Target Attributes.  (line   10)
! * TARGET_ATTRIBUTE_TAKES_IDENTIFIER_P:   Target Attributes.  (line   17)
! * TARGET_BINDS_LOCAL_P:                  Sections.           (line  308)
! * TARGET_BRANCH_TARGET_REGISTER_CALLEE_SAVED: Misc.          (line  906)
! * TARGET_BRANCH_TARGET_REGISTER_CLASS:   Misc.               (line  899)
! * TARGET_BUILD_BUILTIN_VA_LIST:          Register Arguments. (line  285)
  * TARGET_BUILTIN_CHKP_FUNCTION:          Misc.               (line  624)
! * TARGET_BUILTIN_DECL:                   Misc.               (line  603)
! * TARGET_BUILTIN_RECIPROCAL:             Addressing Modes.   (line  261)
! * TARGET_BUILTIN_SETJMP_FRAME_VALUE:     Frame Layout.       (line  107)
! * TARGET_CALLEE_COPIES:                  Register Arguments. (line  127)
! * TARGET_CALL_ARGS:                      Varargs.            (line  123)
  * TARGET_CALL_FUSAGE_CONTAINS_NON_CALLEE_CLOBBERS: Miscellaneous Register Hooks.
!                                                              (line    6)
! * TARGET_CANNOT_FORCE_CONST_MEM:         Addressing Modes.   (line  234)
! * TARGET_CANNOT_MODIFY_JUMPS_P:          Misc.               (line  886)
! * TARGET_CANNOT_SUBSTITUTE_MEM_EQUIV_P:  Register Classes.   (line  590)
  * TARGET_CANONICALIZE_COMPARISON:        MODE_CC Condition Codes.
!                                                              (line   55)
! * TARGET_CANONICAL_VA_LIST_TYPE:         Register Arguments. (line  306)
! * TARGET_CAN_ELIMINATE:                  Elimination.        (line   73)
! * TARGET_CAN_FOLLOW_JUMP:                Misc.               (line  795)
! * TARGET_CAN_INLINE_P:                   Target Attributes.  (line  165)
! * TARGET_CAN_USE_DOLOOP_P:               Misc.               (line  759)
! * TARGET_CASE_VALUES_THRESHOLD:          Misc.               (line   46)
  * TARGET_CC_MODES_COMPATIBLE:            MODE_CC Condition Codes.
!                                                              (line  120)
! * TARGET_CHECK_PCH_TARGET_FLAGS:         PCH Target.         (line   26)
! * TARGET_CHECK_STRING_OBJECT_FORMAT_ARG: Run-time Target.    (line  119)
! * TARGET_CHKP_BOUND_MODE:                Misc.               (line  696)
! * TARGET_CHKP_BOUND_TYPE:                Misc.               (line  694)
! * TARGET_CHKP_FUNCTION_VALUE_BOUNDS:     Varargs.            (line  182)
! * TARGET_CHKP_INITIALIZE_BOUNDS:         Misc.               (line  702)
! * TARGET_CHKP_MAKE_BOUNDS_CONSTANT:      Misc.               (line  698)
! * TARGET_CLASS_LIKELY_SPILLED_P:         Register Classes.   (line  489)
! * TARGET_CLASS_MAX_NREGS:                Register Classes.   (line  505)
! * TARGET_COMMUTATIVE_P:                  Misc.               (line  802)
! * TARGET_COMPARE_VERSION_PRIORITY:       Misc.               (line  736)
! * TARGET_COMP_TYPE_ATTRIBUTES:           Target Attributes.  (line   25)
! * TARGET_CONDITIONAL_REGISTER_USAGE:     Register Basics.    (line   59)
! * TARGET_CONST_ANCHOR:                   Misc.               (line 1125)
! * TARGET_CONST_NOT_OK_FOR_DEBUG_P:       Addressing Modes.   (line  230)
! * TARGET_CONVERT_TO_TYPE:                Misc.               (line 1079)
! * TARGET_CPU_CPP_BUILTINS:               Run-time Target.    (line    8)
! * TARGET_CSTORE_MODE:                    Register Classes.   (line  613)
! * TARGET_CXX_ADJUST_CLASS_AT_DEFINITION: C++ ABI.            (line   86)
! * TARGET_CXX_CDTOR_RETURNS_THIS:         C++ ABI.            (line   37)
! * TARGET_CXX_CLASS_DATA_ALWAYS_COMDAT:   C++ ABI.            (line   61)
! * TARGET_CXX_COOKIE_HAS_SIZE:            C++ ABI.            (line   24)
! * TARGET_CXX_DECL_MANGLING_CONTEXT:      C++ ABI.            (line   92)
! * TARGET_CXX_DETERMINE_CLASS_DATA_VISIBILITY: C++ ABI.       (line   52)
! * TARGET_CXX_GET_COOKIE_SIZE:            C++ ABI.            (line   17)
! * TARGET_CXX_GUARD_MASK_BIT:             C++ ABI.            (line   11)
! * TARGET_CXX_GUARD_TYPE:                 C++ ABI.            (line    6)
! * TARGET_CXX_IMPLICIT_EXTERN_C:          Misc.               (line  373)
! * TARGET_CXX_IMPORT_EXPORT_CLASS:        C++ ABI.            (line   28)
! * TARGET_CXX_KEY_METHOD_MAY_BE_INLINE:   C++ ABI.            (line   42)
! * TARGET_CXX_LIBRARY_RTTI_COMDAT:        C++ ABI.            (line   68)
! * TARGET_CXX_USE_AEABI_ATEXIT:           C++ ABI.            (line   73)
! * TARGET_CXX_USE_ATEXIT_FOR_CXA_ATEXIT:  C++ ABI.            (line   79)
! * TARGET_C_PREINCLUDE:                   Misc.               (line  361)
! * TARGET_DEBUG_UNWIND_INFO:              SDB and DWARF.      (line   36)
! * TARGET_DECIMAL_FLOAT_SUPPORTED_P:      Storage Layout.     (line  507)
! * TARGET_DECLSPEC:                       Target Attributes.  (line   72)
! * TARGET_DEFAULT_PACK_STRUCT:            Misc.               (line  446)
! * TARGET_DEFAULT_SHORT_ENUMS:            Type Layout.        (line  129)
! * TARGET_DEFAULT_TARGET_FLAGS:           Run-time Target.    (line   55)
! * TARGET_DEFERRED_OUTPUT_DEFS:           Label Output.       (line  437)
! * TARGET_DELAY_SCHED2:                   SDB and DWARF.      (line   65)
! * TARGET_DELAY_VARTRACK:                 SDB and DWARF.      (line   69)
! * TARGET_DELEGITIMIZE_ADDRESS:           Addressing Modes.   (line  221)
! * TARGET_DIFFERENT_ADDR_DISPLACEMENT_P:  Register Classes.   (line  583)
  * TARGET_DLLIMPORT_DECL_ATTRIBUTES:      Target Attributes.  (line   55)
! * TARGET_DWARF_CALLING_CONVENTION:       SDB and DWARF.      (line   16)
  * TARGET_DWARF_FRAME_REG_MODE:           Exception Region Output.
!                                                              (line  113)
! * TARGET_DWARF_HANDLE_FRAME_UNSPEC:      Frame Layout.       (line  171)
  * TARGET_DWARF_REGISTER_SPAN:            Exception Region Output.
!                                                              (line  104)
! * TARGET_EDOM:                           Library Calls.      (line   59)
! * TARGET_EMUTLS_DEBUG_FORM_TLS_ADDRESS:  Emulated TLS.       (line   67)
! * TARGET_EMUTLS_GET_ADDRESS:             Emulated TLS.       (line   18)
! * TARGET_EMUTLS_REGISTER_COMMON:         Emulated TLS.       (line   23)
! * TARGET_EMUTLS_TMPL_PREFIX:             Emulated TLS.       (line   44)
! * TARGET_EMUTLS_TMPL_SECTION:            Emulated TLS.       (line   35)
! * TARGET_EMUTLS_VAR_ALIGN_FIXED:         Emulated TLS.       (line   62)
! * TARGET_EMUTLS_VAR_FIELDS:              Emulated TLS.       (line   48)
! * TARGET_EMUTLS_VAR_INIT:                Emulated TLS.       (line   55)
! * TARGET_EMUTLS_VAR_PREFIX:              Emulated TLS.       (line   40)
! * TARGET_EMUTLS_VAR_SECTION:             Emulated TLS.       (line   30)
! * TARGET_ENCODE_SECTION_INFO:            Sections.           (line  251)
  * TARGET_ENCODE_SECTION_INFO and address validation: Addressing Modes.
!                                                              (line   82)
! * TARGET_ENCODE_SECTION_INFO usage:      Instruction Output. (line  127)
! * TARGET_END_CALL_ARGS:                  Varargs.            (line  137)
! * TARGET_ENUM_VA_LIST_P:                 Register Arguments. (line  289)
  * TARGET_EXCEPT_UNWIND_INFO:             Exception Region Output.
!                                                              (line   45)
! * TARGET_EXECUTABLE_SUFFIX:              Misc.               (line  860)
! * TARGET_EXPAND_BUILTIN:                 Misc.               (line  613)
! * TARGET_EXPAND_BUILTIN_SAVEREGS:        Varargs.            (line   64)
! * TARGET_EXPAND_TO_RTL_HOOK:             Storage Layout.     (line  513)
  * TARGET_EXPR:                           Unary and Binary Expressions.
                                                               (line    6)
! * TARGET_EXTRA_INCLUDES:                 Misc.               (line  971)
! * TARGET_EXTRA_LIVE_ON_ENTRY:            Tail Calls.         (line   20)
! * TARGET_EXTRA_PRE_INCLUDES:             Misc.               (line  978)
  * TARGET_FIXED_CONDITION_CODE_REGS:      MODE_CC Condition Codes.
!                                                              (line  105)
! * TARGET_FIXED_POINT_SUPPORTED_P:        Storage Layout.     (line  510)
! * target_flags:                          Run-time Target.    (line   51)
  * TARGET_FLAGS_REGNUM:                   MODE_CC Condition Codes.
!                                                              (line  133)
  * TARGET_FLOAT_EXCEPTIONS_ROUNDING_SUPPORTED_P: Run-time Target.
!                                                              (line  183)
! * TARGET_FLT_EVAL_METHOD:                Type Layout.        (line  110)
! * TARGET_FN_ABI_VA_LIST:                 Register Arguments. (line  301)
! * TARGET_FOLD_BUILTIN:                   Misc.               (line  719)
! * TARGET_FORCE_AT_COMP_DIR:              SDB and DWARF.      (line   60)
! * TARGET_FORMAT_TYPES:                   Misc.               (line  999)
! * TARGET_FRAME_POINTER_REQUIRED:         Elimination.        (line    8)
! * TARGET_FUNCTION_ARG:                   Register Arguments. (line   10)
! * TARGET_FUNCTION_ARG_ADVANCE:           Register Arguments. (line  198)
! * TARGET_FUNCTION_ARG_BOUNDARY:          Register Arguments. (line  252)
! * TARGET_FUNCTION_ARG_ROUND_BOUNDARY:    Register Arguments. (line  258)
! * TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P: Target Attributes.  (line   93)
! * TARGET_FUNCTION_INCOMING_ARG:          Register Arguments. (line   71)
! * TARGET_FUNCTION_OK_FOR_SIBCALL:        Tail Calls.         (line    6)
! * TARGET_FUNCTION_VALUE:                 Scalar Return.      (line    9)
! * TARGET_FUNCTION_VALUE_REGNO_P:         Scalar Return.      (line   96)
! * TARGET_GENERATE_VERSION_DISPATCHER_BODY: Misc.             (line  752)
! * TARGET_GEN_CCMP_FIRST:                 Misc.               (line  926)
! * TARGET_GEN_CCMP_NEXT:                  Misc.               (line  937)
! * TARGET_GET_DRAP_RTX:                   Misc.               (line 1108)
! * TARGET_GET_FUNCTION_VERSIONS_DISPATCHER: Misc.             (line  745)
! * TARGET_GET_PCH_VALIDITY:               PCH Target.         (line    6)
! * TARGET_GET_RAW_ARG_MODE:               Aggregate Return.   (line   81)
! * TARGET_GET_RAW_RESULT_MODE:            Aggregate Return.   (line   76)
! * TARGET_GIMPLE_FOLD_BUILTIN:            Misc.               (line  729)
! * TARGET_GIMPLIFY_VA_ARG_EXPR:           Register Arguments. (line  311)
! * TARGET_HANDLE_C_OPTION:                Run-time Target.    (line   73)
! * TARGET_HANDLE_OPTION:                  Run-time Target.    (line   59)
  * TARGET_HARD_REGNO_SCRATCH_OK:          Values in Registers.
!                                                              (line  141)
! * TARGET_HAS_IFUNC_P:                    Misc.               (line 1156)
! * TARGET_HAS_NO_HW_DIVIDE:               Library Calls.      (line   52)
! * TARGET_HAVE_CONDITIONAL_EXECUTION:     Misc.               (line  920)
  * TARGET_HAVE_CTORS_DTORS:               Macros for Initialization.
!                                                              (line   63)
! * TARGET_HAVE_NAMED_SECTIONS:            File Framework.     (line  139)
! * TARGET_HAVE_SRODATA_SECTION:           Sections.           (line  297)
! * TARGET_HAVE_SWITCHABLE_BSS_SECTIONS:   File Framework.     (line  144)
! * TARGET_HAVE_TLS:                       Sections.           (line  317)
! * TARGET_INIT_BUILTINS:                  Misc.               (line  587)
  * TARGET_INIT_DWARF_REG_SIZES_EXTRA:     Exception Region Output.
!                                                              (line  119)
! * TARGET_INIT_LIBFUNCS:                  Library Calls.      (line   15)
! * TARGET_INIT_PIC_REG:                   Register Arguments. (line   91)
! * TARGET_INSERT_ATTRIBUTES:              Target Attributes.  (line   80)
! * TARGET_INSTANTIATE_DECLS:              Storage Layout.     (line  521)
! * TARGET_INVALID_ARG_FOR_UNPROTOTYPED_FN: Misc.              (line 1032)
! * TARGET_INVALID_BINARY_OP:              Misc.               (line 1051)
! * TARGET_INVALID_CONVERSION:             Misc.               (line 1038)
! * TARGET_INVALID_PARAMETER_TYPE:         Misc.               (line 1057)
! * TARGET_INVALID_RETURN_TYPE:            Misc.               (line 1064)
! * TARGET_INVALID_UNARY_OP:               Misc.               (line 1044)
! * TARGET_INVALID_WITHIN_DOLOOP:          Misc.               (line  776)
! * TARGET_IN_SMALL_DATA_P:                Sections.           (line  293)
! * TARGET_KEEP_LEAF_WHEN_PROFILED:        Profiling.          (line   39)
! * TARGET_LEGITIMATE_ADDRESS_P:           Addressing Modes.   (line   48)
! * TARGET_LEGITIMATE_COMBINED_INSN:       Misc.               (line  790)
! * TARGET_LEGITIMATE_CONSTANT_P:          Addressing Modes.   (line  213)
! * TARGET_LEGITIMIZE_ADDRESS:             Addressing Modes.   (line  129)
! * TARGET_LEGITIMIZE_ADDRESS_DISPLACEMENT: Register Classes.  (line  598)
! * TARGET_LIBCALL_VALUE:                  Scalar Return.      (line   65)
! * TARGET_LIBC_HAS_FUNCTION:              Library Calls.      (line   77)
! * TARGET_LIBFUNC_GNU_PREFIX:             Library Calls.      (line   24)
! * TARGET_LIBGCC_CMP_RETURN_MODE:         Storage Layout.     (line  463)
  * TARGET_LIBGCC_FLOATING_MODE_SUPPORTED_P: Register Arguments.
!                                                              (line  369)
! * TARGET_LIBGCC_SDATA_SECTION:           Sections.           (line  131)
! * TARGET_LIBGCC_SHIFT_COUNT_MODE:        Storage Layout.     (line  469)
! * TARGET_LIB_INT_CMP_BIASED:             Library Calls.      (line   42)
! * TARGET_LOAD_BOUNDS_FOR_ARG:            Varargs.            (line  153)
! * TARGET_LOAD_RETURNED_BOUNDS:           Varargs.            (line  172)
! * TARGET_LOOP_UNROLL_ADJUST:             Misc.               (line  952)
! * TARGET_LRA_P:                          Register Classes.   (line  557)
! * TARGET_MACHINE_DEPENDENT_REORG:        Misc.               (line  572)
! * TARGET_MANGLE_ASSEMBLER_NAME:          Label Output.       (line  328)
! * TARGET_MANGLE_DECL_ASSEMBLER_NAME:     Sections.           (line  241)
! * TARGET_MANGLE_TYPE:                    Storage Layout.     (line  525)
! * TARGET_MAX_ANCHOR_OFFSET:              Anchored Addresses. (line   38)
! * TARGET_MD_ASM_CLOBBERS:                Misc.               (line  491)
! * TARGET_MEMBER_TYPE_FORCES_BLK:         Storage Layout.     (line  415)
! * TARGET_MEMMODEL_CHECK:                 Misc.               (line 1147)
! * TARGET_MEMORY_MOVE_COST:               Costs.              (line   79)
! * TARGET_MEM_CONSTRAINT:                 Addressing Modes.   (line  107)
  * TARGET_MEM_REF:                        Storage References. (line    6)
! * TARGET_MERGE_DECL_ATTRIBUTES:          Target Attributes.  (line   45)
! * TARGET_MERGE_TYPE_ATTRIBUTES:          Target Attributes.  (line   37)
! * TARGET_MIN_ANCHOR_OFFSET:              Anchored Addresses. (line   32)
! * TARGET_MIN_DIVISIONS_FOR_RECIP_MUL:    Misc.               (line   90)
! * TARGET_MODE_AFTER:                     Mode Switching.     (line   57)
! * TARGET_MODE_DEPENDENT_ADDRESS_P:       Addressing Modes.   (line  196)
! * TARGET_MODE_EMIT:                      Mode Switching.     (line   42)
! * TARGET_MODE_ENTRY:                     Mode Switching.     (line   64)
! * TARGET_MODE_EXIT:                      Mode Switching.     (line   71)
! * TARGET_MODE_NEEDED:                    Mode Switching.     (line   50)
! * TARGET_MODE_PRIORITY:                  Mode Switching.     (line   78)
! * TARGET_MODE_REP_EXTENDED:              Misc.               (line  175)
! * TARGET_MS_BITFIELD_LAYOUT_P:           Storage Layout.     (line  479)
! * TARGET_MUST_PASS_IN_STACK:             Register Arguments. (line   64)
  * TARGET_MUST_PASS_IN_STACK, and TARGET_FUNCTION_ARG: Register Arguments.
!                                                              (line   56)
! * TARGET_NARROW_VOLATILE_BITFIELD:       Storage Layout.     (line  408)
! * TARGET_NO_REGISTER_ALLOCATION:         SDB and DWARF.      (line   73)
! * TARGET_N_FORMAT_TYPES:                 Misc.               (line 1004)
! * TARGET_OBJC_CONSTRUCT_STRING_OBJECT:   Run-time Target.    (line   88)
! * TARGET_OBJC_DECLARE_CLASS_DEFINITION:  Run-time Target.    (line  109)
  * TARGET_OBJC_DECLARE_UNRESOLVED_CLASS_REFERENCE: Run-time Target.
!                                                              (line  104)
! * TARGET_OBJECT_SUFFIX:                  Misc.               (line  855)
! * TARGET_OBJFMT_CPP_BUILTINS:            Run-time Target.    (line   45)
! * TARGET_OFFLOAD_OPTIONS:                Misc.               (line 1190)
  * TARGET_OMIT_STRUCT_RETURN_REG:         Scalar Return.      (line  117)
! * TARGET_OPTF:                           Misc.               (line  986)
! * TARGET_OPTION_DEFAULT_PARAMS:          Run-time Target.    (line  160)
! * TARGET_OPTION_FUNCTION_VERSIONS:       Target Attributes.  (line  157)
! * TARGET_OPTION_INIT_STRUCT:             Run-time Target.    (line  156)
! * TARGET_OPTION_OPTIMIZATION_TABLE:      Run-time Target.    (line  142)
! * TARGET_OPTION_OVERRIDE:                Target Attributes.  (line  144)
! * TARGET_OPTION_POST_STREAM_IN:          Target Attributes.  (line  125)
! * TARGET_OPTION_PRAGMA_PARSE:            Target Attributes.  (line  137)
! * TARGET_OPTION_PRINT:                   Target Attributes.  (line  131)
! * TARGET_OPTION_RESTORE:                 Target Attributes.  (line  119)
! * TARGET_OPTION_SAVE:                    Target Attributes.  (line  112)
! * TARGET_OPTION_VALID_ATTRIBUTE_P:       Target Attributes.  (line  100)
! * TARGET_OS_CPP_BUILTINS:                Run-time Target.    (line   41)
! * TARGET_OVERRIDES_FORMAT_ATTRIBUTES:    Misc.               (line 1008)
! * TARGET_OVERRIDES_FORMAT_ATTRIBUTES_COUNT: Misc.            (line 1014)
! * TARGET_OVERRIDES_FORMAT_INIT:          Misc.               (line 1018)
! * TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE:  Run-time Target.    (line  126)
! * TARGET_PASS_BY_REFERENCE:              Register Arguments. (line  115)
! * TARGET_PCH_VALID_P:                    PCH Target.         (line   11)
! * TARGET_POSIX_IO:                       Misc.               (line  516)
! * TARGET_PREFERRED_OUTPUT_RELOAD_CLASS:  Register Classes.   (line  284)
! * TARGET_PREFERRED_RELOAD_CLASS:         Register Classes.   (line  213)
! * TARGET_PREFERRED_RENAME_CLASS:         Register Classes.   (line  201)
! * TARGET_PREPARE_PCH_SAVE:               PCH Target.         (line   34)
! * TARGET_PRETEND_OUTGOING_VARARGS_NAMED: Varargs.            (line  144)
! * TARGET_PROFILE_BEFORE_PROLOGUE:        Sections.           (line  301)
! * TARGET_PROMOTED_TYPE:                  Misc.               (line 1071)
! * TARGET_PROMOTE_FUNCTION_MODE:          Storage Layout.     (line  109)
! * TARGET_PROMOTE_PROTOTYPES:             Stack Arguments.    (line   10)
! * TARGET_PTRMEMFUNC_VBIT_LOCATION:       Type Layout.        (line  256)
! * TARGET_RECORD_OFFLOAD_SYMBOL:          Misc.               (line 1185)
! * TARGET_REF_MAY_ALIAS_ERRNO:            Register Arguments. (line  322)
! * TARGET_REGISTER_MOVE_COST:             Costs.              (line   31)
! * TARGET_REGISTER_PRIORITY:              Register Classes.   (line  562)
! * TARGET_REGISTER_USAGE_LEVELING_P:      Register Classes.   (line  573)
! * TARGET_RELAXED_ORDERING:               Misc.               (line 1023)
! * TARGET_RESOLVE_OVERLOADED_BUILTIN:     Misc.               (line  708)
! * TARGET_RETURN_IN_MEMORY:               Aggregate Return.   (line   15)
  * TARGET_RETURN_IN_MSB:                  Scalar Return.      (line  124)
! * TARGET_RETURN_POPS_ARGS:               Stack Arguments.    (line   98)
! * TARGET_RTX_COSTS:                      Costs.              (line  277)
! * TARGET_SCALAR_MODE_SUPPORTED_P:        Register Arguments. (line  329)
! * TARGET_SCHED_ADJUST_COST:              Scheduling.         (line   35)
! * TARGET_SCHED_ADJUST_PRIORITY:          Scheduling.         (line   50)
! * TARGET_SCHED_ALLOC_SCHED_CONTEXT:      Scheduling.         (line  294)
! * TARGET_SCHED_CLEAR_SCHED_CONTEXT:      Scheduling.         (line  309)
! * TARGET_SCHED_DEPENDENCIES_EVALUATION_HOOK: Scheduling.     (line  101)
! * TARGET_SCHED_DFA_NEW_CYCLE:            Scheduling.         (line  255)
! * TARGET_SCHED_DFA_POST_ADVANCE_CYCLE:   Scheduling.         (line  172)
! * TARGET_SCHED_DFA_POST_CYCLE_INSN:      Scheduling.         (line  156)
! * TARGET_SCHED_DFA_PRE_ADVANCE_CYCLE:    Scheduling.         (line  165)
! * TARGET_SCHED_DFA_PRE_CYCLE_INSN:       Scheduling.         (line  144)
! * TARGET_SCHED_DISPATCH:                 Scheduling.         (line  363)
! * TARGET_SCHED_DISPATCH_DO:              Scheduling.         (line  368)
! * TARGET_SCHED_EXPOSED_PIPELINE:         Scheduling.         (line  372)
! * TARGET_SCHED_FINISH:                   Scheduling.         (line  122)
! * TARGET_SCHED_FINISH_GLOBAL:            Scheduling.         (line  137)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BACKTRACK: Scheduling.  (line  235)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BEGIN: Scheduling.      (line  223)
  * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD: Scheduling.
!                                                              (line  179)
  * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD_GUARD: Scheduling.
!                                                              (line  207)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_END: Scheduling.        (line  240)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_FINI: Scheduling.       (line  250)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_INIT: Scheduling.       (line  245)
! * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_ISSUE: Scheduling.      (line  229)
! * TARGET_SCHED_FREE_SCHED_CONTEXT:       Scheduling.         (line  313)
! * TARGET_SCHED_FUSION_PRIORITY:          Scheduling.         (line  382)
! * TARGET_SCHED_GEN_SPEC_CHECK:           Scheduling.         (line  335)
! * TARGET_SCHED_H_I_D_EXTENDED:           Scheduling.         (line  289)
! * TARGET_SCHED_INIT:                     Scheduling.         (line  111)
! * TARGET_SCHED_INIT_DFA_POST_CYCLE_INSN: Scheduling.         (line  161)
! * TARGET_SCHED_INIT_DFA_PRE_CYCLE_INSN:  Scheduling.         (line  153)
! * TARGET_SCHED_INIT_GLOBAL:              Scheduling.         (line  129)
! * TARGET_SCHED_INIT_SCHED_CONTEXT:       Scheduling.         (line  298)
! * TARGET_SCHED_ISSUE_RATE:               Scheduling.         (line   11)
! * TARGET_SCHED_IS_COSTLY_DEPENDENCE:     Scheduling.         (line  267)
! * TARGET_SCHED_MACRO_FUSION_P:           Scheduling.         (line   87)
! * TARGET_SCHED_MACRO_FUSION_PAIR_P:      Scheduling.         (line   91)
! * TARGET_SCHED_NEEDS_BLOCK_P:            Scheduling.         (line  328)
! * TARGET_SCHED_REASSOCIATION_WIDTH:      Scheduling.         (line  377)
! * TARGET_SCHED_REORDER:                  Scheduling.         (line   58)
! * TARGET_SCHED_REORDER2:                 Scheduling.         (line   75)
! * TARGET_SCHED_SET_SCHED_CONTEXT:        Scheduling.         (line  305)
! * TARGET_SCHED_SET_SCHED_FLAGS:          Scheduling.         (line  347)
! * TARGET_SCHED_SMS_RES_MII:              Scheduling.         (line  354)
! * TARGET_SCHED_SPECULATE_INSN:           Scheduling.         (line  316)
! * TARGET_SCHED_VARIABLE_ISSUE:           Scheduling.         (line   22)
! * TARGET_SECONDARY_RELOAD:               Register Classes.   (line  312)
! * TARGET_SECTION_TYPE_FLAGS:             File Framework.     (line  149)
! * TARGET_SETUP_INCOMING_VARARGS:         Varargs.            (line   71)
! * TARGET_SETUP_INCOMING_VARARG_BOUNDS:   Varargs.            (line  188)
! * TARGET_SET_CURRENT_FUNCTION:           Misc.               (line  837)
! * TARGET_SET_DEFAULT_TYPE_ATTRIBUTES:    Target Attributes.  (line   33)
! * TARGET_SET_UP_BY_PROLOGUE:             Tail Calls.         (line   29)
! * TARGET_SHIFT_TRUNCATION_MASK:          Misc.               (line  138)
! * TARGET_SIMD_CLONE_ADJUST:              Addressing Modes.   (line  413)
  * TARGET_SIMD_CLONE_COMPUTE_VECSIZE_AND_SIMDLEN: Addressing Modes.
!                                                              (line  405)
! * TARGET_SIMD_CLONE_USABLE:              Addressing Modes.   (line  417)
  * TARGET_SMALL_REGISTER_CLASSES_FOR_MODE_P: Register Arguments.
!                                                              (line  377)
! * TARGET_SPILL_CLASS:                    Register Classes.   (line  606)
! * TARGET_SPLIT_COMPLEX_ARG:              Register Arguments. (line  273)
  * TARGET_STACK_PROTECT_FAIL:             Stack Smashing Protection.
!                                                              (line   16)
  * TARGET_STACK_PROTECT_GUARD:            Stack Smashing Protection.
!                                                              (line    6)
! * TARGET_STATIC_CHAIN:                   Frame Registers.    (line   90)
! * TARGET_STORE_BOUNDS_FOR_ARG:           Varargs.            (line  163)
! * TARGET_STORE_RETURNED_BOUNDS:          Varargs.            (line  177)
! * TARGET_STRICT_ARGUMENT_NAMING:         Varargs.            (line  107)
! * TARGET_STRING_OBJECT_REF_TYPE_P:       Run-time Target.    (line  114)
! * TARGET_STRIP_NAME_ENCODING:            Sections.           (line  288)
! * TARGET_STRUCT_VALUE_RTX:               Aggregate Return.   (line   44)
  * TARGET_SUPPORTS_SPLIT_STACK:           Stack Smashing Protection.
!                                                              (line   25)
! * TARGET_SUPPORTS_WEAK:                  Label Output.       (line  244)
! * TARGET_SUPPORTS_WIDE_INT:              Misc.               (line 1198)
  * TARGET_TERMINATE_DW2_EH_FRAME_INFO:    Exception Region Output.
!                                                              (line   98)
! * TARGET_TRAMPOLINE_ADJUST_ADDRESS:      Trampolines.        (line   74)
! * TARGET_TRAMPOLINE_INIT:                Trampolines.        (line   54)
! * TARGET_UNSPEC_MAY_TRAP_P:              Misc.               (line  828)
  * TARGET_UNWIND_TABLES_DEFAULT:          Exception Region Output.
!                                                              (line   72)
! * TARGET_UNWIND_WORD_MODE:               Storage Layout.     (line  475)
! * TARGET_UPDATE_STACK_BOUNDARY:          Misc.               (line 1104)
! * TARGET_USES_WEAK_UNWIND_INFO:          Exception Handling. (line  123)
! * TARGET_USE_ANCHORS_FOR_SYMBOL_P:       Anchored Addresses. (line   53)
! * TARGET_USE_BLOCKS_FOR_CONSTANT_P:      Addressing Modes.   (line  248)
! * TARGET_USE_BLOCKS_FOR_DECL_P:          Addressing Modes.   (line  255)
! * TARGET_USE_BY_PIECES_INFRASTRUCTURE_P: Costs.              (line  164)
! * TARGET_USE_JCR_SECTION:                Misc.               (line 1086)
! * TARGET_USE_PSEUDO_PIC_REG:             Register Arguments. (line   87)
! * TARGET_VALID_DLLIMPORT_ATTRIBUTE_P:    Target Attributes.  (line   66)
! * TARGET_VALID_POINTER_MODE:             Register Arguments. (line  317)
! * TARGET_VECTORIZE_ADD_STMT_COST:        Addressing Modes.   (line  367)
  * TARGET_VECTORIZE_AUTOVECTORIZE_VECTOR_SIZES: Addressing Modes.
!                                                              (line  350)
! * TARGET_VECTORIZE_BUILTIN_CONVERSION:   Addressing Modes.   (line  312)
! * TARGET_VECTORIZE_BUILTIN_GATHER:       Addressing Modes.   (line  398)
! * TARGET_VECTORIZE_BUILTIN_MASK_FOR_LOAD: Addressing Modes.  (line  271)
! * TARGET_VECTORIZE_BUILTIN_TM_LOAD:      Addressing Modes.   (line  390)
! * TARGET_VECTORIZE_BUILTIN_TM_STORE:     Addressing Modes.   (line  394)
  * TARGET_VECTORIZE_BUILTIN_VECTORIZATION_COST: Addressing Modes.
!                                                              (line  297)
  * TARGET_VECTORIZE_BUILTIN_VECTORIZED_FUNCTION: Addressing Modes.
!                                                              (line  324)
! * TARGET_VECTORIZE_DESTROY_COST_DATA:    Addressing Modes.   (line  385)
! * TARGET_VECTORIZE_FINISH_COST:          Addressing Modes.   (line  378)
! * TARGET_VECTORIZE_INIT_COST:            Addressing Modes.   (line  358)
! * TARGET_VECTORIZE_PREFERRED_SIMD_MODE:  Addressing Modes.   (line  343)
  * TARGET_VECTORIZE_SUPPORT_VECTOR_MISALIGNMENT: Addressing Modes.
!                                                              (line  333)
  * TARGET_VECTORIZE_VECTOR_ALIGNMENT_REACHABLE: Addressing Modes.
!                                                              (line  303)
! * TARGET_VECTORIZE_VEC_PERM_CONST_OK:    Addressing Modes.   (line  308)
! * TARGET_VECTOR_ALIGNMENT:               Storage Layout.     (line  268)
! * TARGET_VECTOR_MODE_SUPPORTED_P:        Register Arguments. (line  340)
! * TARGET_VTABLE_DATA_ENTRY_DISTANCE:     Type Layout.        (line  309)
! * TARGET_VTABLE_ENTRY_ALIGN:             Type Layout.        (line  303)
! * TARGET_VTABLE_USES_DESCRIPTORS:        Type Layout.        (line  292)
! * TARGET_WANT_DEBUG_PUB_SECTIONS:        SDB and DWARF.      (line   55)
! * TARGET_WARN_FUNC_RETURN:               Tail Calls.         (line   35)
! * TARGET_WEAK_NOT_IN_ARCHIVE_TOC:        Label Output.       (line  280)
! * TCmode:                                Machine Modes.      (line  199)
  * TDmode:                                Machine Modes.      (line   97)
  * TEMPLATE_DECL:                         Declarations.       (line    6)
  * Temporaries:                           Temporaries.        (line    6)
  * termination routines:                  Initialization.     (line    6)
  * testing constraints:                   C Constraint Interface.
                                                               (line    6)
! * TEXT_SECTION_ASM_OP:                   Sections.           (line   37)
  * TFmode:                                Machine Modes.      (line  101)
  * The Language:                          The Language.       (line    6)
  * THEN_CLAUSE:                           Statements for C++. (line    6)
! * THREAD_MODEL_SPEC:                     Driver.             (line  162)
  * THROW_EXPR:                            Unary and Binary Expressions.
                                                               (line    6)
  * THUNK_DECL:                            Declarations.       (line    6)
  * THUNK_DELTA:                           Declarations.       (line    6)
  * TImode:                                Machine Modes.      (line   48)
! * TImode, in insn:                       Insns.              (line  268)
! * TLS_COMMON_ASM_OP:                     Sections.           (line   80)
! * TLS_SECTION_ASM_FLAG:                  Sections.           (line   85)
  * tm.h macros:                           Target Macros.      (line    6)
  * TQFmode:                               Machine Modes.      (line   65)
  * TQmode:                                Machine Modes.      (line  122)
  * trampolines for nested functions:      Trampolines.        (line    6)
! * TRAMPOLINE_ALIGNMENT:                  Trampolines.        (line   48)
! * TRAMPOLINE_SECTION:                    Trampolines.        (line   39)
! * TRAMPOLINE_SIZE:                       Trampolines.        (line   44)
! * TRANSFER_FROM_TRAMPOLINE:              Trampolines.        (line  110)
! * trap instruction pattern:              Standard Names.     (line 1591)
! * tree:                                  Tree overview.      (line    6)
  * tree <1>:                              Macros and Functions.
                                                               (line    6)
  * Tree SSA:                              Tree SSA.           (line    6)
  * TREE_CHAIN:                            Macros and Functions.
                                                               (line    6)
*************** Concept Index
*** 50796,50804 ****
                                                               (line    6)
  * TREE_LIST:                             Containers.         (line    6)
  * TREE_OPERAND:                          Expression trees.   (line    6)
  * TREE_PUBLIC <1>:                       Function Properties.
                                                               (line   28)
- * TREE_PUBLIC:                           Function Basics.    (line    6)
  * TREE_PURPOSE:                          Containers.         (line    6)
  * TREE_READONLY:                         Function Properties.
                                                               (line   37)
--- 50391,50399 ----
                                                               (line    6)
  * TREE_LIST:                             Containers.         (line    6)
  * TREE_OPERAND:                          Expression trees.   (line    6)
+ * TREE_PUBLIC:                           Function Basics.    (line    6)
  * TREE_PUBLIC <1>:                       Function Properties.
                                                               (line   28)
  * TREE_PURPOSE:                          Containers.         (line    6)
  * TREE_READONLY:                         Function Properties.
                                                               (line   37)
*************** Concept Index
*** 50816,50850 ****
                                                               (line    6)
  * tree_to_uhwi:                          Constant expressions.
                                                               (line    6)
- * TREE_TYPE <1>:                         Types for C++.      (line    6)
- * TREE_TYPE <2>:                         Function Basics.    (line   47)
- * TREE_TYPE <3>:                         Expression trees.   (line    6)
- * TREE_TYPE <4>:                         Working with declarations.
-                                                              (line   11)
- * TREE_TYPE <5>:                         Types.              (line    6)
  * TREE_TYPE:                             Macros and Functions.
                                                               (line    6)
  * TREE_VALUE:                            Containers.         (line    6)
  * TREE_VEC:                              Containers.         (line    6)
  * TREE_VEC_ELT:                          Containers.         (line    6)
  * TREE_VEC_LENGTH:                       Containers.         (line    6)
! * TRULY_NOOP_TRUNCATION:                 Misc.               (line  163)
  * TRUNC_DIV_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * TRUNC_MOD_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
- * truncate:                              Conversions.        (line   38)
- * truncMN2 instruction pattern:          Standard Names.     (line  970)
- * TRUTH_AND_EXPR:                        Unary and Binary Expressions.
-                                                              (line    6)
  * TRUTH_ANDIF_EXPR:                      Unary and Binary Expressions.
                                                               (line    6)
! * TRUTH_NOT_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
! * TRUTH_OR_EXPR:                         Unary and Binary Expressions.
                                                               (line    6)
  * TRUTH_ORIF_EXPR:                       Unary and Binary Expressions.
                                                               (line    6)
  * TRUTH_XOR_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * TRY_BLOCK:                             Statements for C++. (line    6)
--- 50411,50446 ----
                                                               (line    6)
  * tree_to_uhwi:                          Constant expressions.
                                                               (line    6)
  * TREE_TYPE:                             Macros and Functions.
                                                               (line    6)
+ * TREE_TYPE <1>:                         Types.              (line    6)
+ * TREE_TYPE <2>:                         Working with declarations.
+                                                              (line   11)
+ * TREE_TYPE <3>:                         Expression trees.   (line    6)
+ * TREE_TYPE <4>:                         Expression trees.   (line   17)
+ * TREE_TYPE <5>:                         Function Basics.    (line   47)
+ * TREE_TYPE <6>:                         Types for C++.      (line    6)
  * TREE_VALUE:                            Containers.         (line    6)
  * TREE_VEC:                              Containers.         (line    6)
  * TREE_VEC_ELT:                          Containers.         (line    6)
  * TREE_VEC_LENGTH:                       Containers.         (line    6)
! * TRULY_NOOP_TRUNCATION:                 Misc.               (line  162)
! * truncate:                              Conversions.        (line   38)
! * truncMN2 instruction pattern:          Standard Names.     (line  965)
  * TRUNC_DIV_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * TRUNC_MOD_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * TRUTH_ANDIF_EXPR:                      Unary and Binary Expressions.
                                                               (line    6)
! * TRUTH_AND_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
! * TRUTH_NOT_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * TRUTH_ORIF_EXPR:                       Unary and Binary Expressions.
                                                               (line    6)
+ * TRUTH_OR_EXPR:                         Unary and Binary Expressions.
+                                                              (line    6)
  * TRUTH_XOR_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * TRY_BLOCK:                             Statements for C++. (line    6)
*************** Concept Index
*** 50856,50961 ****
                                                               (line    6)
  * type:                                  Types.              (line    6)
  * type declaration:                      Declarations.       (line    6)
! * TYPE_ALIGN <1>:                        Types for C++.      (line    6)
  * TYPE_ALIGN:                            Types.              (line    6)
! * TYPE_ARG_TYPES <1>:                    Types for C++.      (line    6)
  * TYPE_ARG_TYPES:                        Types.              (line    6)
! * TYPE_ASM_OP:                           Label Output.       (line   79)
! * TYPE_ATTRIBUTES:                       Attributes.         (line   25)
  * TYPE_BINFO:                            Classes.            (line    6)
! * TYPE_BUILT_IN:                         Types for C++.      (line   68)
  * TYPE_CANONICAL:                        Types.              (line    6)
! * TYPE_CONTEXT <1>:                      Types for C++.      (line    6)
  * TYPE_CONTEXT:                          Types.              (line    6)
  * TYPE_DECL:                             Declarations.       (line    6)
- * TYPE_FIELDS <1>:                       Classes.            (line    6)
- * TYPE_FIELDS <2>:                       Types for C++.      (line    6)
  * TYPE_FIELDS:                           Types.              (line    6)
  * TYPE_HAS_ARRAY_NEW_OPERATOR:           Classes.            (line   96)
  * TYPE_HAS_DEFAULT_CONSTRUCTOR:          Classes.            (line   81)
  * TYPE_HAS_MUTABLE_P:                    Classes.            (line   86)
  * TYPE_HAS_NEW_OPERATOR:                 Classes.            (line   93)
- * TYPE_MAIN_VARIANT <1>:                 Types for C++.      (line    6)
  * TYPE_MAIN_VARIANT:                     Types.              (line    6)
  * TYPE_MAX_VALUE:                        Types.              (line    6)
- * TYPE_METHOD_BASETYPE <1>:              Types for C++.      (line    6)
- * TYPE_METHOD_BASETYPE:                  Types.              (line    6)
  * TYPE_METHODS:                          Classes.            (line    6)
  * TYPE_MIN_VALUE:                        Types.              (line    6)
- * TYPE_NAME <1>:                         Types for C++.      (line    6)
  * TYPE_NAME:                             Types.              (line    6)
  * TYPE_NOTHROW_P:                        Functions for C++.  (line  154)
- * TYPE_OFFSET_BASETYPE <1>:              Types for C++.      (line    6)
  * TYPE_OFFSET_BASETYPE:                  Types.              (line    6)
! * TYPE_OPERAND_FMT:                      Label Output.       (line   90)
  * TYPE_OVERLOADS_ARRAY_REF:              Classes.            (line  104)
  * TYPE_OVERLOADS_ARROW:                  Classes.            (line  107)
  * TYPE_OVERLOADS_CALL_EXPR:              Classes.            (line  100)
  * TYPE_POLYMORPHIC_P:                    Classes.            (line   77)
- * TYPE_PRECISION <1>:                    Types for C++.      (line    6)
  * TYPE_PRECISION:                        Types.              (line    6)
! * TYPE_PTR_P:                            Types for C++.      (line   74)
  * TYPE_PTRDATAMEM_P:                     Types for C++.      (line    6)
! * TYPE_PTRFN_P:                          Types for C++.      (line   78)
! * TYPE_PTROB_P:                          Types for C++.      (line   81)
  * TYPE_PTROBV_P:                         Types for C++.      (line    6)
! * TYPE_QUAL_CONST <1>:                   Types for C++.      (line    6)
  * TYPE_QUAL_CONST:                       Types.              (line    6)
! * TYPE_QUAL_RESTRICT <1>:                Types for C++.      (line    6)
  * TYPE_QUAL_RESTRICT:                    Types.              (line    6)
! * TYPE_QUAL_VOLATILE <1>:                Types for C++.      (line    6)
  * TYPE_QUAL_VOLATILE:                    Types.              (line    6)
  * TYPE_RAISES_EXCEPTIONS:                Functions for C++.  (line  149)
- * TYPE_SIZE <1>:                         Types for C++.      (line    6)
  * TYPE_SIZE:                             Types.              (line    6)
  * TYPE_STRUCTURAL_EQUALITY_P:            Types.              (line    6)
! * TYPE_UNQUALIFIED <1>:                  Types for C++.      (line    6)
  * TYPE_UNQUALIFIED:                      Types.              (line    6)
  * TYPE_VFIELD:                           Classes.            (line    6)
! * TYPENAME_TYPE:                         Types for C++.      (line    6)
! * TYPENAME_TYPE_FULLNAME <1>:            Types for C++.      (line    6)
! * TYPENAME_TYPE_FULLNAME:                Types.              (line    6)
! * TYPEOF_TYPE:                           Types for C++.      (line    6)
! * UDAmode:                               Machine Modes.      (line  171)
! * udiv:                                  Arithmetic.         (line  129)
! * udivM3 instruction pattern:            Standard Names.     (line  269)
! * udivmodM4 instruction pattern:         Standard Names.     (line  555)
! * udot_prodM instruction pattern:        Standard Names.     (line  373)
! * UDQmode:                               Machine Modes.      (line  139)
! * UHAmode:                               Machine Modes.      (line  163)
! * UHQmode:                               Machine Modes.      (line  131)
! * UINT16_TYPE:                           Type Layout.        (line  221)
! * UINT32_TYPE:                           Type Layout.        (line  222)
! * UINT64_TYPE:                           Type Layout.        (line  223)
! * UINT8_TYPE:                            Type Layout.        (line  220)
! * UINT_FAST16_TYPE:                      Type Layout.        (line  237)
! * UINT_FAST32_TYPE:                      Type Layout.        (line  238)
! * UINT_FAST64_TYPE:                      Type Layout.        (line  239)
! * UINT_FAST8_TYPE:                       Type Layout.        (line  236)
! * UINT_LEAST16_TYPE:                     Type Layout.        (line  229)
! * UINT_LEAST32_TYPE:                     Type Layout.        (line  230)
! * UINT_LEAST64_TYPE:                     Type Layout.        (line  231)
! * UINT_LEAST8_TYPE:                      Type Layout.        (line  228)
! * UINTMAX_TYPE:                          Type Layout.        (line  204)
! * UINTPTR_TYPE:                          Type Layout.        (line  241)
! * umaddMN4 instruction pattern:          Standard Names.     (line  502)
! * umax:                                  Arithmetic.         (line  148)
! * umaxM3 instruction pattern:            Standard Names.     (line  269)
! * umin:                                  Arithmetic.         (line  148)
! * uminM3 instruction pattern:            Standard Names.     (line  269)
! * umod:                                  Arithmetic.         (line  135)
! * umodM3 instruction pattern:            Standard Names.     (line  269)
! * umsubMN4 instruction pattern:          Standard Names.     (line  526)
! * umulhisi3 instruction pattern:         Standard Names.     (line  474)
! * umulM3_highpart instruction pattern:   Standard Names.     (line  488)
! * umulqihi3 instruction pattern:         Standard Names.     (line  474)
! * umulsidi3 instruction pattern:         Standard Names.     (line  474)
! * umulvM4 instruction pattern:           Standard Names.     (line  288)
  * unchanging:                            Flags.              (line  296)
  * unchanging, in call_insn:              Flags.              (line   19)
  * unchanging, in jump_insn, call_insn and insn: Flags.       (line   39)
  * unchanging, in mem:                    Flags.              (line  134)
  * unchanging, in subreg:                 Flags.              (line  170)
  * unchanging, in symbol_ref:             Flags.              (line   10)
  * UNEQ_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
--- 50452,50568 ----
                                                               (line    6)
  * type:                                  Types.              (line    6)
  * type declaration:                      Declarations.       (line    6)
! * TYPENAME_TYPE:                         Types for C++.      (line    6)
! * TYPENAME_TYPE_FULLNAME:                Types.              (line    6)
! * TYPENAME_TYPE_FULLNAME <1>:            Types for C++.      (line    6)
! * TYPEOF_TYPE:                           Types for C++.      (line    6)
  * TYPE_ALIGN:                            Types.              (line    6)
! * TYPE_ALIGN <1>:                        Types.              (line   30)
! * TYPE_ALIGN <2>:                        Types for C++.      (line    6)
! * TYPE_ALIGN <3>:                        Types for C++.      (line   44)
  * TYPE_ARG_TYPES:                        Types.              (line    6)
! * TYPE_ARG_TYPES <1>:                    Types for C++.      (line    6)
! * TYPE_ASM_OP:                           Label Output.       (line   76)
! * TYPE_ATTRIBUTES:                       Attributes.         (line   24)
  * TYPE_BINFO:                            Classes.            (line    6)
! * TYPE_BUILT_IN:                         Types for C++.      (line   66)
  * TYPE_CANONICAL:                        Types.              (line    6)
! * TYPE_CANONICAL <1>:                    Types.              (line   41)
  * TYPE_CONTEXT:                          Types.              (line    6)
+ * TYPE_CONTEXT <1>:                      Types for C++.      (line    6)
  * TYPE_DECL:                             Declarations.       (line    6)
  * TYPE_FIELDS:                           Types.              (line    6)
+ * TYPE_FIELDS <1>:                       Types for C++.      (line    6)
+ * TYPE_FIELDS <2>:                       Classes.            (line    6)
  * TYPE_HAS_ARRAY_NEW_OPERATOR:           Classes.            (line   96)
  * TYPE_HAS_DEFAULT_CONSTRUCTOR:          Classes.            (line   81)
  * TYPE_HAS_MUTABLE_P:                    Classes.            (line   86)
  * TYPE_HAS_NEW_OPERATOR:                 Classes.            (line   93)
  * TYPE_MAIN_VARIANT:                     Types.              (line    6)
+ * TYPE_MAIN_VARIANT <1>:                 Types.              (line   19)
+ * TYPE_MAIN_VARIANT <2>:                 Types for C++.      (line    6)
  * TYPE_MAX_VALUE:                        Types.              (line    6)
  * TYPE_METHODS:                          Classes.            (line    6)
+ * TYPE_METHOD_BASETYPE:                  Types.              (line    6)
+ * TYPE_METHOD_BASETYPE <1>:              Types for C++.      (line    6)
  * TYPE_MIN_VALUE:                        Types.              (line    6)
  * TYPE_NAME:                             Types.              (line    6)
+ * TYPE_NAME <1>:                         Types.              (line   33)
+ * TYPE_NAME <2>:                         Types for C++.      (line    6)
+ * TYPE_NAME <3>:                         Types for C++.      (line   47)
  * TYPE_NOTHROW_P:                        Functions for C++.  (line  154)
  * TYPE_OFFSET_BASETYPE:                  Types.              (line    6)
! * TYPE_OFFSET_BASETYPE <1>:              Types for C++.      (line    6)
! * TYPE_OPERAND_FMT:                      Label Output.       (line   87)
  * TYPE_OVERLOADS_ARRAY_REF:              Classes.            (line  104)
  * TYPE_OVERLOADS_ARROW:                  Classes.            (line  107)
  * TYPE_OVERLOADS_CALL_EXPR:              Classes.            (line  100)
  * TYPE_POLYMORPHIC_P:                    Classes.            (line   77)
  * TYPE_PRECISION:                        Types.              (line    6)
! * TYPE_PRECISION <1>:                    Types for C++.      (line    6)
  * TYPE_PTRDATAMEM_P:                     Types for C++.      (line    6)
! * TYPE_PTRDATAMEM_P <1>:                 Types for C++.      (line   69)
! * TYPE_PTRFN_P:                          Types for C++.      (line   76)
  * TYPE_PTROBV_P:                         Types for C++.      (line    6)
! * TYPE_PTROB_P:                          Types for C++.      (line   79)
! * TYPE_PTR_P:                            Types for C++.      (line   72)
  * TYPE_QUAL_CONST:                       Types.              (line    6)
! * TYPE_QUAL_CONST <1>:                   Types for C++.      (line    6)
  * TYPE_QUAL_RESTRICT:                    Types.              (line    6)
! * TYPE_QUAL_RESTRICT <1>:                Types for C++.      (line    6)
  * TYPE_QUAL_VOLATILE:                    Types.              (line    6)
+ * TYPE_QUAL_VOLATILE <1>:                Types for C++.      (line    6)
  * TYPE_RAISES_EXCEPTIONS:                Functions for C++.  (line  149)
  * TYPE_SIZE:                             Types.              (line    6)
+ * TYPE_SIZE <1>:                         Types.              (line   25)
+ * TYPE_SIZE <2>:                         Types for C++.      (line    6)
+ * TYPE_SIZE <3>:                         Types for C++.      (line   39)
  * TYPE_STRUCTURAL_EQUALITY_P:            Types.              (line    6)
! * TYPE_STRUCTURAL_EQUALITY_P <1>:        Types.              (line   77)
  * TYPE_UNQUALIFIED:                      Types.              (line    6)
+ * TYPE_UNQUALIFIED <1>:                  Types for C++.      (line    6)
  * TYPE_VFIELD:                           Classes.            (line    6)
! * UDAmode:                               Machine Modes.      (line  170)
! * udiv:                                  Arithmetic.         (line  130)
! * udivM3 instruction pattern:            Standard Names.     (line  266)
! * udivmodM4 instruction pattern:         Standard Names.     (line  550)
! * udot_prodM instruction pattern:        Standard Names.     (line  370)
! * UDQmode:                               Machine Modes.      (line  138)
! * UHAmode:                               Machine Modes.      (line  162)
! * UHQmode:                               Machine Modes.      (line  130)
! * UINT16_TYPE:                           Type Layout.        (line  220)
! * UINT32_TYPE:                           Type Layout.        (line  221)
! * UINT64_TYPE:                           Type Layout.        (line  222)
! * UINT8_TYPE:                            Type Layout.        (line  219)
! * UINTMAX_TYPE:                          Type Layout.        (line  203)
! * UINTPTR_TYPE:                          Type Layout.        (line  240)
! * UINT_FAST16_TYPE:                      Type Layout.        (line  236)
! * UINT_FAST32_TYPE:                      Type Layout.        (line  237)
! * UINT_FAST64_TYPE:                      Type Layout.        (line  238)
! * UINT_FAST8_TYPE:                       Type Layout.        (line  235)
! * UINT_LEAST16_TYPE:                     Type Layout.        (line  228)
! * UINT_LEAST32_TYPE:                     Type Layout.        (line  229)
! * UINT_LEAST64_TYPE:                     Type Layout.        (line  230)
! * UINT_LEAST8_TYPE:                      Type Layout.        (line  227)
! * umaddMN4 instruction pattern:          Standard Names.     (line  497)
! * umax:                                  Arithmetic.         (line  149)
! * umaxM3 instruction pattern:            Standard Names.     (line  266)
! * umin:                                  Arithmetic.         (line  149)
! * uminM3 instruction pattern:            Standard Names.     (line  266)
! * umod:                                  Arithmetic.         (line  136)
! * umodM3 instruction pattern:            Standard Names.     (line  266)
! * umsubMN4 instruction pattern:          Standard Names.     (line  521)
! * umulhisi3 instruction pattern:         Standard Names.     (line  469)
! * umulM3_highpart instruction pattern:   Standard Names.     (line  483)
! * umulqihi3 instruction pattern:         Standard Names.     (line  469)
! * umulsidi3 instruction pattern:         Standard Names.     (line  469)
! * umulvM4 instruction pattern:           Standard Names.     (line  285)
  * unchanging:                            Flags.              (line  296)
  * unchanging, in call_insn:              Flags.              (line   19)
  * unchanging, in jump_insn, call_insn and insn: Flags.       (line   39)
  * unchanging, in mem:                    Flags.              (line  134)
  * unchanging, in subreg:                 Flags.              (line  170)
+ * unchanging, in subreg <1>:             Flags.              (line  180)
  * unchanging, in symbol_ref:             Flags.              (line   10)
  * UNEQ_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
*************** Concept Index
*** 50963,51126 ****
                                                               (line    6)
  * UNGT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
- * UNION_TYPE <1>:                        Classes.            (line    6)
- * UNION_TYPE:                            Types.              (line    6)
  * unions, returning:                     Interface.          (line   10)
! * UNITS_PER_WORD:                        Storage Layout.     (line   61)
! * UNKNOWN_TYPE <1>:                      Types for C++.      (line    6)
  * UNKNOWN_TYPE:                          Types.              (line    6)
  * UNLE_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * UNLIKELY_EXECUTED_TEXT_SECTION_NAME:   Sections.           (line   49)
  * UNLT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * UNORDERED_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * unshare_all_rtl:                       Sharing.            (line   58)
! * unsigned division:                     Arithmetic.         (line  129)
! * unsigned division with unsigned saturation: Arithmetic.    (line  129)
  * unsigned greater than:                 Comparisons.        (line   64)
  * unsigned less than:                    Comparisons.        (line   68)
! * unsigned minimum and maximum:          Arithmetic.         (line  148)
  * unsigned_fix:                          Conversions.        (line   77)
  * unsigned_float:                        Conversions.        (line   62)
  * unsigned_fract_convert:                Conversions.        (line   97)
  * unsigned_sat_fract:                    Conversions.        (line  103)
  * unspec <1>:                            Constant Definitions.
                                                               (line  111)
! * unspec:                                Side Effects.       (line  300)
  * unspec_volatile <1>:                   Constant Definitions.
                                                               (line   99)
! * unspec_volatile:                       Side Effects.       (line  300)
! * untyped_call instruction pattern:      Standard Names.     (line 1212)
! * untyped_return instruction pattern:    Standard Names.     (line 1276)
  * UPDATE_PATH_HOST_CANONICALIZE (PATH):  Filesystem.         (line   59)
  * update_ssa:                            SSA.                (line   74)
- * update_stmt <1>:                       SSA Operands.       (line    6)
  * update_stmt:                           Manipulating GIMPLE statements.
!                                                              (line  141)
  * update_stmt_if_modified:               Manipulating GIMPLE statements.
!                                                              (line  144)
  * UQQmode:                               Machine Modes.      (line  126)
! * us_ashift:                             Arithmetic.         (line  172)
! * us_minus:                              Arithmetic.         (line   36)
! * us_mult:                               Arithmetic.         (line   92)
! * us_neg:                                Arithmetic.         (line   81)
! * us_plus:                               Arithmetic.         (line   14)
! * us_truncate:                           Conversions.        (line   48)
! * usaddM3 instruction pattern:           Standard Names.     (line  269)
! * usadM instruction pattern:             Standard Names.     (line  382)
! * USAmode:                               Machine Modes.      (line  167)
! * usashlM3 instruction pattern:          Standard Names.     (line  558)
! * usdivM3 instruction pattern:           Standard Names.     (line  269)
  * use:                                   Side Effects.       (line  168)
- * USE_C_ALLOCA:                          Host Misc.          (line   19)
- * USE_LD_AS_NEEDED:                      Driver.             (line  136)
- * USE_LOAD_POST_DECREMENT:               Costs.              (line  234)
- * USE_LOAD_POST_INCREMENT:               Costs.              (line  229)
- * USE_LOAD_PRE_DECREMENT:                Costs.              (line  244)
- * USE_LOAD_PRE_INCREMENT:                Costs.              (line  239)
- * USE_SELECT_SECTION_FOR_FUNCTIONS:      Sections.           (line  194)
- * USE_STORE_POST_DECREMENT:              Costs.              (line  254)
- * USE_STORE_POST_INCREMENT:              Costs.              (line  249)
- * USE_STORE_PRE_DECREMENT:               Costs.              (line  264)
- * USE_STORE_PRE_INCREMENT:               Costs.              (line  259)
  * used:                                  Flags.              (line  314)
  * used, in symbol_ref:                   Flags.              (line  197)
! * user:                                  GTY Options.        (line  243)
  * user gc:                               User GC.            (line    6)
! * USER_LABEL_PREFIX:                     Instruction Output. (line  154)
  * USING_STMT:                            Statements for C++. (line    6)
! * usmaddMN4 instruction pattern:         Standard Names.     (line  510)
! * usmsubMN4 instruction pattern:         Standard Names.     (line  534)
! * usmulhisi3 instruction pattern:        Standard Names.     (line  478)
! * usmulM3 instruction pattern:           Standard Names.     (line  269)
! * usmulqihi3 instruction pattern:        Standard Names.     (line  478)
! * usmulsidi3 instruction pattern:        Standard Names.     (line  478)
! * usnegM2 instruction pattern:           Standard Names.     (line  580)
! * USQmode:                               Machine Modes.      (line  135)
! * ussubM3 instruction pattern:           Standard Names.     (line  269)
! * usum_widenM3 instruction pattern:      Standard Names.     (line  392)
! * UTAmode:                               Machine Modes.      (line  175)
! * UTQmode:                               Machine Modes.      (line  143)
  * V in constraint:                       Simple Constraints. (line   43)
- * VA_ARG_EXPR:                           Unary and Binary Expressions.
-                                                              (line    6)
  * values, returned by functions:         Scalar Return.      (line    6)
- * VAR_DECL:                              Declarations.       (line    6)
- * var_location:                          Debug Information.  (line   14)
  * varargs implementation:                Varargs.            (line    6)
  * variable:                              Declarations.       (line    6)
  * Variable Location Debug Information in RTL: Debug Information.
                                                               (line    6)
! * vashlM3 instruction pattern:           Standard Names.     (line  572)
! * vashrM3 instruction pattern:           Standard Names.     (line  572)
! * vcondMN instruction pattern:           Standard Names.     (line  214)
  * vec_concat:                            Vector Operations.  (line   28)
  * vec_duplicate:                         Vector Operations.  (line   33)
! * vec_extractM instruction pattern:      Standard Names.     (line  204)
! * vec_initM instruction pattern:         Standard Names.     (line  209)
! * vec_load_lanesMN instruction pattern:  Standard Names.     (line  166)
  * VEC_LSHIFT_EXPR:                       Vectors.            (line    6)
  * vec_merge:                             Vector Operations.  (line   11)
  * VEC_PACK_FIX_TRUNC_EXPR:               Vectors.            (line    6)
  * VEC_PACK_SAT_EXPR:                     Vectors.            (line    6)
! * vec_pack_sfix_trunc_M instruction pattern: Standard Names. (line  418)
! * vec_pack_ssat_M instruction pattern:   Standard Names.     (line  411)
  * VEC_PACK_TRUNC_EXPR:                   Vectors.            (line    6)
! * vec_pack_trunc_M instruction pattern:  Standard Names.     (line  404)
! * vec_pack_ufix_trunc_M instruction pattern: Standard Names. (line  418)
! * vec_pack_usat_M instruction pattern:   Standard Names.     (line  411)
! * vec_perm_constM instruction pattern:   Standard Names.     (line  242)
! * vec_permM instruction pattern:         Standard Names.     (line  224)
  * VEC_RSHIFT_EXPR:                       Vectors.            (line    6)
  * vec_select:                            Vector Operations.  (line   19)
! * vec_setM instruction pattern:          Standard Names.     (line  199)
! * vec_shr_M instruction pattern:         Standard Names.     (line  398)
! * vec_store_lanesMN instruction pattern: Standard Names.     (line  188)
! * VEC_UNPACK_FLOAT_HI_EXPR:              Vectors.            (line    6)
! * VEC_UNPACK_FLOAT_LO_EXPR:              Vectors.            (line    6)
! * VEC_UNPACK_HI_EXPR:                    Vectors.            (line    6)
! * VEC_UNPACK_LO_EXPR:                    Vectors.            (line    6)
  * vec_unpacks_float_hi_M instruction pattern: Standard Names.
!                                                              (line  440)
  * vec_unpacks_float_lo_M instruction pattern: Standard Names.
!                                                              (line  440)
! * vec_unpacks_hi_M instruction pattern:  Standard Names.     (line  425)
! * vec_unpacks_lo_M instruction pattern:  Standard Names.     (line  425)
  * vec_unpacku_float_hi_M instruction pattern: Standard Names.
!                                                              (line  440)
  * vec_unpacku_float_lo_M instruction pattern: Standard Names.
!                                                              (line  440)
! * vec_unpacku_hi_M instruction pattern:  Standard Names.     (line  433)
! * vec_unpacku_lo_M instruction pattern:  Standard Names.     (line  433)
  * VEC_WIDEN_MULT_HI_EXPR:                Vectors.            (line    6)
  * VEC_WIDEN_MULT_LO_EXPR:                Vectors.            (line    6)
  * vec_widen_smult_even_M instruction pattern: Standard Names.
!                                                              (line  449)
! * vec_widen_smult_hi_M instruction pattern: Standard Names.  (line  449)
! * vec_widen_smult_lo_M instruction pattern: Standard Names.  (line  449)
! * vec_widen_smult_odd_M instruction pattern: Standard Names. (line  449)
  * vec_widen_sshiftl_hi_M instruction pattern: Standard Names.
!                                                              (line  460)
  * vec_widen_sshiftl_lo_M instruction pattern: Standard Names.
!                                                              (line  460)
  * vec_widen_umult_even_M instruction pattern: Standard Names.
!                                                              (line  449)
! * vec_widen_umult_hi_M instruction pattern: Standard Names.  (line  449)
! * vec_widen_umult_lo_M instruction pattern: Standard Names.  (line  449)
! * vec_widen_umult_odd_M instruction pattern: Standard Names. (line  449)
  * vec_widen_ushiftl_hi_M instruction pattern: Standard Names.
!                                                              (line  460)
  * vec_widen_ushiftl_lo_M instruction pattern: Standard Names.
!                                                              (line  460)
! * vector:                                Containers.         (line    6)
! * vector operations:                     Vector Operations.  (line    6)
! * VECTOR_CST:                            Constant expressions.
!                                                              (line    6)
! * VECTOR_STORE_FLAG_VALUE:               Misc.               (line  294)
  * verify_flow_info:                      Maintaining the CFG.
!                                                              (line  119)
  * virtual operands:                      SSA Operands.       (line    6)
  * VIRTUAL_INCOMING_ARGS_REGNUM:          Regs and Memory.    (line   59)
  * VIRTUAL_OUTGOING_ARGS_REGNUM:          Regs and Memory.    (line   87)
--- 50570,50735 ----
                                                               (line    6)
  * UNGT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * unions, returning:                     Interface.          (line   10)
! * UNION_TYPE:                            Types.              (line    6)
! * UNION_TYPE <1>:                        Classes.            (line    6)
! * UNITS_PER_WORD:                        Storage Layout.     (line   60)
  * UNKNOWN_TYPE:                          Types.              (line    6)
+ * UNKNOWN_TYPE <1>:                      Types for C++.      (line    6)
  * UNLE_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
! * UNLIKELY_EXECUTED_TEXT_SECTION_NAME:   Sections.           (line   48)
  * UNLT_EXPR:                             Unary and Binary Expressions.
                                                               (line    6)
  * UNORDERED_EXPR:                        Unary and Binary Expressions.
                                                               (line    6)
  * unshare_all_rtl:                       Sharing.            (line   58)
! * unsigned division:                     Arithmetic.         (line  130)
! * unsigned division with unsigned saturation: Arithmetic.    (line  130)
  * unsigned greater than:                 Comparisons.        (line   64)
+ * unsigned greater than <1>:             Comparisons.        (line   72)
  * unsigned less than:                    Comparisons.        (line   68)
! * unsigned less than <1>:                Comparisons.        (line   76)
! * unsigned minimum and maximum:          Arithmetic.         (line  149)
  * unsigned_fix:                          Conversions.        (line   77)
  * unsigned_float:                        Conversions.        (line   62)
  * unsigned_fract_convert:                Conversions.        (line   97)
  * unsigned_sat_fract:                    Conversions.        (line  103)
+ * unspec:                                Side Effects.       (line  299)
  * unspec <1>:                            Constant Definitions.
                                                               (line  111)
! * unspec_volatile:                       Side Effects.       (line  299)
  * unspec_volatile <1>:                   Constant Definitions.
                                                               (line   99)
! * untyped_call instruction pattern:      Standard Names.     (line 1207)
! * untyped_return instruction pattern:    Standard Names.     (line 1270)
  * UPDATE_PATH_HOST_CANONICALIZE (PATH):  Filesystem.         (line   59)
  * update_ssa:                            SSA.                (line   74)
  * update_stmt:                           Manipulating GIMPLE statements.
!                                                              (line  140)
! * update_stmt <1>:                       SSA Operands.       (line    6)
  * update_stmt_if_modified:               Manipulating GIMPLE statements.
!                                                              (line  143)
  * UQQmode:                               Machine Modes.      (line  126)
! * usaddM3 instruction pattern:           Standard Names.     (line  266)
! * usadM instruction pattern:             Standard Names.     (line  379)
! * USAmode:                               Machine Modes.      (line  166)
! * usashlM3 instruction pattern:          Standard Names.     (line  553)
! * usdivM3 instruction pattern:           Standard Names.     (line  266)
  * use:                                   Side Effects.       (line  168)
  * used:                                  Flags.              (line  314)
  * used, in symbol_ref:                   Flags.              (line  197)
! * user:                                  GTY Options.        (line  252)
  * user gc:                               User GC.            (line    6)
! * USER_LABEL_PREFIX:                     Instruction Output. (line  152)
! * USE_C_ALLOCA:                          Host Misc.          (line   19)
! * USE_LD_AS_NEEDED:                      Driver.             (line  135)
! * USE_LOAD_POST_DECREMENT:               Costs.              (line  233)
! * USE_LOAD_POST_INCREMENT:               Costs.              (line  228)
! * USE_LOAD_PRE_DECREMENT:                Costs.              (line  243)
! * USE_LOAD_PRE_INCREMENT:                Costs.              (line  238)
! * USE_SELECT_SECTION_FOR_FUNCTIONS:      Sections.           (line  193)
! * USE_STORE_POST_DECREMENT:              Costs.              (line  253)
! * USE_STORE_POST_INCREMENT:              Costs.              (line  248)
! * USE_STORE_PRE_DECREMENT:               Costs.              (line  263)
! * USE_STORE_PRE_INCREMENT:               Costs.              (line  258)
  * USING_STMT:                            Statements for C++. (line    6)
! * usmaddMN4 instruction pattern:         Standard Names.     (line  505)
! * usmsubMN4 instruction pattern:         Standard Names.     (line  529)
! * usmulhisi3 instruction pattern:        Standard Names.     (line  473)
! * usmulM3 instruction pattern:           Standard Names.     (line  266)
! * usmulqihi3 instruction pattern:        Standard Names.     (line  473)
! * usmulsidi3 instruction pattern:        Standard Names.     (line  473)
! * usnegM2 instruction pattern:           Standard Names.     (line  575)
! * USQmode:                               Machine Modes.      (line  134)
! * ussubM3 instruction pattern:           Standard Names.     (line  266)
! * usum_widenM3 instruction pattern:      Standard Names.     (line  388)
! * us_ashift:                             Arithmetic.         (line  173)
! * us_minus:                              Arithmetic.         (line   38)
! * us_mult:                               Arithmetic.         (line   93)
! * us_neg:                                Arithmetic.         (line   82)
! * us_plus:                               Arithmetic.         (line   14)
! * us_truncate:                           Conversions.        (line   48)
! * UTAmode:                               Machine Modes.      (line  174)
! * UTQmode:                               Machine Modes.      (line  142)
  * V in constraint:                       Simple Constraints. (line   43)
  * values, returned by functions:         Scalar Return.      (line    6)
  * varargs implementation:                Varargs.            (line    6)
  * variable:                              Declarations.       (line    6)
  * Variable Location Debug Information in RTL: Debug Information.
                                                               (line    6)
! * VAR_DECL:                              Declarations.       (line    6)
! * var_location:                          Debug Information.  (line   14)
! * vashlM3 instruction pattern:           Standard Names.     (line  567)
! * vashrM3 instruction pattern:           Standard Names.     (line  567)
! * VA_ARG_EXPR:                           Unary and Binary Expressions.
!                                                              (line    6)
! * vcondMN instruction pattern:           Standard Names.     (line  213)
! * vector:                                Containers.         (line    6)
! * vector operations:                     Vector Operations.  (line    6)
! * VECTOR_CST:                            Constant expressions.
!                                                              (line    6)
! * VECTOR_STORE_FLAG_VALUE:               Misc.               (line  293)
  * vec_concat:                            Vector Operations.  (line   28)
  * vec_duplicate:                         Vector Operations.  (line   33)
! * vec_extractM instruction pattern:      Standard Names.     (line  203)
! * vec_initM instruction pattern:         Standard Names.     (line  208)
! * vec_load_lanesMN instruction pattern:  Standard Names.     (line  165)
  * VEC_LSHIFT_EXPR:                       Vectors.            (line    6)
  * vec_merge:                             Vector Operations.  (line   11)
  * VEC_PACK_FIX_TRUNC_EXPR:               Vectors.            (line    6)
  * VEC_PACK_SAT_EXPR:                     Vectors.            (line    6)
! * vec_pack_sfix_trunc_M instruction pattern: Standard Names. (line  414)
! * vec_pack_ssat_M instruction pattern:   Standard Names.     (line  407)
  * VEC_PACK_TRUNC_EXPR:                   Vectors.            (line    6)
! * vec_pack_trunc_M instruction pattern:  Standard Names.     (line  400)
! * vec_pack_ufix_trunc_M instruction pattern: Standard Names. (line  414)
! * vec_pack_usat_M instruction pattern:   Standard Names.     (line  407)
! * vec_permM instruction pattern:         Standard Names.     (line  223)
! * vec_perm_constM instruction pattern:   Standard Names.     (line  239)
  * VEC_RSHIFT_EXPR:                       Vectors.            (line    6)
  * vec_select:                            Vector Operations.  (line   19)
! * vec_setM instruction pattern:          Standard Names.     (line  198)
! * vec_shr_M instruction pattern:         Standard Names.     (line  394)
! * vec_store_lanesMN instruction pattern: Standard Names.     (line  187)
  * vec_unpacks_float_hi_M instruction pattern: Standard Names.
!                                                              (line  435)
  * vec_unpacks_float_lo_M instruction pattern: Standard Names.
!                                                              (line  435)
! * vec_unpacks_hi_M instruction pattern:  Standard Names.     (line  421)
! * vec_unpacks_lo_M instruction pattern:  Standard Names.     (line  421)
  * vec_unpacku_float_hi_M instruction pattern: Standard Names.
!                                                              (line  435)
  * vec_unpacku_float_lo_M instruction pattern: Standard Names.
!                                                              (line  435)
! * vec_unpacku_hi_M instruction pattern:  Standard Names.     (line  428)
! * vec_unpacku_lo_M instruction pattern:  Standard Names.     (line  428)
! * VEC_UNPACK_FLOAT_HI_EXPR:              Vectors.            (line    6)
! * VEC_UNPACK_FLOAT_LO_EXPR:              Vectors.            (line    6)
! * VEC_UNPACK_HI_EXPR:                    Vectors.            (line    6)
! * VEC_UNPACK_LO_EXPR:                    Vectors.            (line    6)
  * VEC_WIDEN_MULT_HI_EXPR:                Vectors.            (line    6)
  * VEC_WIDEN_MULT_LO_EXPR:                Vectors.            (line    6)
  * vec_widen_smult_even_M instruction pattern: Standard Names.
!                                                              (line  444)
! * vec_widen_smult_hi_M instruction pattern: Standard Names.  (line  444)
! * vec_widen_smult_lo_M instruction pattern: Standard Names.  (line  444)
! * vec_widen_smult_odd_M instruction pattern: Standard Names. (line  444)
  * vec_widen_sshiftl_hi_M instruction pattern: Standard Names.
!                                                              (line  455)
  * vec_widen_sshiftl_lo_M instruction pattern: Standard Names.
!                                                              (line  455)
  * vec_widen_umult_even_M instruction pattern: Standard Names.
!                                                              (line  444)
! * vec_widen_umult_hi_M instruction pattern: Standard Names.  (line  444)
! * vec_widen_umult_lo_M instruction pattern: Standard Names.  (line  444)
! * vec_widen_umult_odd_M instruction pattern: Standard Names. (line  444)
  * vec_widen_ushiftl_hi_M instruction pattern: Standard Names.
!                                                              (line  455)
  * vec_widen_ushiftl_lo_M instruction pattern: Standard Names.
!                                                              (line  455)
  * verify_flow_info:                      Maintaining the CFG.
!                                                              (line  117)
  * virtual operands:                      SSA Operands.       (line    6)
  * VIRTUAL_INCOMING_ARGS_REGNUM:          Regs and Memory.    (line   59)
  * VIRTUAL_OUTGOING_ARGS_REGNUM:          Regs and Memory.    (line   87)
*************** Concept Index
*** 51128,51139 ****
  * VIRTUAL_STACK_VARS_REGNUM:             Regs and Memory.    (line   69)
  * VLIW:                                  Processor pipeline description.
                                                               (line    6)
! * vlshrM3 instruction pattern:           Standard Names.     (line  572)
  * VMS:                                   Filesystem.         (line   37)
! * VMS_DEBUGGING_INFO:                    VMS Debug.          (line    9)
! * void:                                  Misc.               (line  687)
  * VOID_TYPE:                             Types.              (line    6)
- * VOIDmode:                              Machine Modes.      (line  193)
  * volatil:                               Flags.              (line  328)
  * volatil, in insn, call_insn, jump_insn, code_label, jump_table_data, barrier, and note: Flags.
                                                               (line   44)
--- 50737,50751 ----
  * VIRTUAL_STACK_VARS_REGNUM:             Regs and Memory.    (line   69)
  * VLIW:                                  Processor pipeline description.
                                                               (line    6)
! * VLIW <1>:                              Processor pipeline description.
!                                                              (line  223)
! * vlshrM3 instruction pattern:           Standard Names.     (line  567)
  * VMS:                                   Filesystem.         (line   37)
! * VMS_DEBUGGING_INFO:                    VMS Debug.          (line    8)
! * void:                                  Misc.               (line  685)
! * void <1>:                              Misc.               (line  690)
! * VOIDmode:                              Machine Modes.      (line  192)
  * VOID_TYPE:                             Types.              (line    6)
  * volatil:                               Flags.              (line  328)
  * volatil, in insn, call_insn, jump_insn, code_label, jump_table_data, barrier, and note: Flags.
                                                               (line   44)
*************** Concept Index
*** 51141,51585 ****
  * volatil, in mem, asm_operands, and asm_input: Flags.       (line   76)
  * volatil, in reg:                       Flags.              (line   98)
  * volatil, in subreg:                    Flags.              (line  170)
  * volatil, in symbol_ref:                Flags.              (line  206)
  * volatile memory references:            Flags.              (line  329)
  * volatile, in prefetch:                 Flags.              (line  214)
  * voting between constraint alternatives: Class Preferences. (line    6)
! * vrotlM3 instruction pattern:           Standard Names.     (line  572)
! * vrotrM3 instruction pattern:           Standard Names.     (line  572)
! * walk_dominator_tree:                   SSA.                (line  228)
  * walk_gimple_op:                        Statement and operand traversals.
!                                                              (line   32)
  * walk_gimple_seq:                       Statement and operand traversals.
!                                                              (line   50)
  * walk_gimple_stmt:                      Statement and operand traversals.
!                                                              (line   13)
! * WCHAR_TYPE:                            Type Layout.        (line  172)
! * WCHAR_TYPE_SIZE:                       Type Layout.        (line  180)
! * which_alternative:                     Output Statement.   (line   59)
  * WHILE_BODY:                            Statements for C++. (line    6)
  * WHILE_COND:                            Statements for C++. (line    6)
  * WHILE_STMT:                            Statements for C++. (line    6)
  * whopr:                                 LTO.                (line    6)
! * WIDEST_HARDWARE_FP_SIZE:               Type Layout.        (line  117)
! * window_save instruction pattern:       Standard Names.     (line 1572)
! * WINT_TYPE:                             Type Layout.        (line  185)
! * word_mode:                             Machine Modes.      (line  368)
! * WORD_REGISTER_OPERATIONS:              Misc.               (line   54)
! * WORDS_BIG_ENDIAN:                      Storage Layout.     (line   29)
! * WORDS_BIG_ENDIAN, effect on subreg:    Regs and Memory.    (line  217)
  * wpa:                                   LTO.                (line    6)
! * X in constraint:                       Simple Constraints. (line  124)
  * x-HOST:                                Host Fragment.      (line    6)
! * XCmode:                                Machine Modes.      (line  200)
! * XCOFF_DEBUGGING_INFO:                  DBX Options.        (line   13)
  * XEXP:                                  Accessors.          (line    6)
  * XFmode:                                Machine Modes.      (line   82)
  * XImode:                                Machine Modes.      (line   54)
  * XINT:                                  Accessors.          (line    6)
- * xm-MACHINE.h <1>:                      Host Misc.          (line    6)
  * xm-MACHINE.h:                          Filesystem.         (line    6)
! * xor:                                   Arithmetic.         (line  167)
  * xor, canonicalization of:              Insn Canonicalizations.
!                                                              (line   79)
! * xorM3 instruction pattern:             Standard Names.     (line  269)
  * XSTR:                                  Accessors.          (line    6)
  * XVEC:                                  Accessors.          (line   41)
  * XVECEXP:                               Accessors.          (line   48)
  * XVECLEN:                               Accessors.          (line   44)
  * XWINT:                                 Accessors.          (line    6)
  * zero_extend:                           Conversions.        (line   28)
! * zero_extendMN2 instruction pattern:    Standard Names.     (line  980)
  * zero_extract:                          Bit-Fields.         (line   30)
  * zero_extract, canonicalization of:     Insn Canonicalizations.
!                                                              (line   88)
  
  
  
  Tag Table:
! Node: Top1842
! Node: Contributing5024
! Node: Portability5765
! Node: Interface7553
! Node: Libgcc10593
! Node: Integer library routines12434
! Node: Soft float library routines19402
! Node: Decimal float library routines31339
! Node: Fixed-point fractional library routines47096
! Node: Exception handling routines147494
! Node: Miscellaneous routines148601
! Node: Languages150721
! Node: Source Tree152270
! Node: Configure Terms152852
! Node: Top Level155810
! Node: gcc Directory159296
! Node: Subdirectories160246
! Node: Configuration162413
! Node: Config Fragments163133
! Node: System Config164362
! Node: Configuration Files165298
! Node: Build168123
! Node: Makefile168535
! Ref: Makefile-Footnote-1175338
! Ref: Makefile-Footnote-2175483
! Node: Library Files175555
! Node: Headers176117
! Node: Documentation178200
! Node: Texinfo Manuals179059
! Node: Man Page Generation181392
! Node: Miscellaneous Docs183307
! Node: Front End184701
! Node: Front End Directory188394
! Node: Front End Config189714
! Node: Front End Makefile192540
! Node: Back End196322
! Node: Testsuites200119
! Node: Test Idioms201050
! Node: Test Directives204447
! Node: Directives204974
! Node: Selectors215284
! Node: Effective-Target Keywords216642
! Ref: arm_neon_ok224510
! Ref: arm_neonv2_ok224668
! Ref: arm_neon_fp16_ok224840
! Ref: arm_vfp3_ok225280
! Node: Add Options235808
! Node: Require Support237125
! Node: Final Actions239632
! Node: Ada Tests244799
! Node: C Tests246131
! Node: libgcj Tests250554
! Node: LTO Testing251681
! Node: gcov Testing253328
! Node: profopt Testing256315
! Node: compat Testing258030
! Node: Torture Tests262270
! Node: Options263887
! Node: Option file format264327
! Node: Option properties271317
! Node: Passes284875
! Node: Parsing pass285765
! Node: Cilk Plus Transformation289300
! Node: Gimplification pass292687
! Node: Pass manager294532
! Node: Tree SSA passes296377
! Node: RTL passes317576
! Node: Optimization info329897
! Node: Dump setup330715
! Node: Optimization groups331837
! Node: Dump files and streams332720
! Node: Dump output verbosity333911
! Node: Dump types334962
! Node: Dump examples336452
! Node: GENERIC337794
! Node: Deficiencies339669
! Node: Tree overview339910
! Node: Macros and Functions344037
! Node: Identifiers344862
! Node: Containers346473
! Node: Types347630
! Node: Declarations359726
! Node: Working with declarations360221
! Node: Internal structure365827
! Node: Current structure hierarchy366211
! Node: Adding new DECL node types368305
! Node: Attributes372590
! Node: Expression trees373835
! Node: Constant expressions375588
! Node: Storage References378894
! Node: Unary and Binary Expressions382413
! Node: Vectors402564
! Node: Statements407755
! Node: Basic Statements408287
! Node: Blocks412794
! Node: Statement Sequences414198
! Node: Empty Statements414531
! Node: Jumps415105
! Node: Cleanups415758
! Node: OpenMP417526
! Node: OpenACC423361
! Node: Functions424393
! Node: Function Basics424864
! Node: Function Properties428549
! Node: Language-dependent trees431331
! Node: C and C++ Trees432217
! Node: Types for C++435121
! Node: Namespaces440099
! Node: Classes443206
! Node: Functions for C++448284
! Node: Statements for C++454537
! Node: C++ Expressions463307
! Node: Java Trees464808
! Node: GIMPLE464921
! Node: Tuple representation468583
! Node: Class hierarchy of GIMPLE statements475561
! Node: GIMPLE instruction set480564
! Node: GIMPLE Exception Handling482248
! Node: Temporaries484162
! Ref: Temporaries-Footnote-1485477
! Node: Operands485540
! Node: Compound Expressions486302
! Node: Compound Lvalues486536
! Node: Conditional Expressions487298
! Node: Logical Operators487956
! Node: Manipulating GIMPLE statements494821
! Node: Tuple specific accessors500755
! Node: `GIMPLE_ASM'501592
! Node: `GIMPLE_ASSIGN'503980
! Node: `GIMPLE_BIND'508690
! Node: `GIMPLE_CALL'510509
! Node: `GIMPLE_CATCH'514542
! Node: `GIMPLE_COND'515698
! Node: `GIMPLE_DEBUG'518499
! Node: `GIMPLE_EH_FILTER'521883
! Node: `GIMPLE_LABEL'523452
! Node: `GIMPLE_GOTO'524071
! Node: `GIMPLE_NOP'524600
! Node: `GIMPLE_OMP_ATOMIC_LOAD'524968
! Node: `GIMPLE_OMP_ATOMIC_STORE'525970
! Node: `GIMPLE_OMP_CONTINUE'526674
! Node: `GIMPLE_OMP_CRITICAL'528159
! Node: `GIMPLE_OMP_FOR'529158
! Node: `GIMPLE_OMP_MASTER'532580
! Node: `GIMPLE_OMP_ORDERED'532963
! Node: `GIMPLE_OMP_PARALLEL'533363
! Node: `GIMPLE_OMP_RETURN'536139
! Node: `GIMPLE_OMP_SECTION'536789
! Node: `GIMPLE_OMP_SECTIONS'537455
! Node: `GIMPLE_OMP_SINGLE'539070
! Node: `GIMPLE_PHI'540021
! Node: `GIMPLE_RESX'541305
! Node: `GIMPLE_RETURN'542030
! Node: `GIMPLE_SWITCH'542610
! Node: `GIMPLE_TRY'544489
! Node: `GIMPLE_WITH_CLEANUP_EXPR'546266
! Node: GIMPLE sequences547149
! Node: Sequence iterators550355
! Node: Adding a new GIMPLE statement code558813
! Node: Statement and operand traversals560188
! Node: Tree SSA562788
! Node: Annotations564574
! Node: SSA Operands564979
! Node: SSA579059
! Node: Alias analysis590091
! Node: Memory model593871
! Node: RTL595234
! Node: RTL Objects597422
! Node: RTL Classes601296
! Node: Accessors606343
! Node: Special Accessors608737
! Node: Flags614507
! Node: Machine Modes629269
! Node: Constants642921
! Node: Regs and Memory651007
! Node: Arithmetic668908
! Node: Comparisons678961
! Node: Bit-Fields683253
! Node: Vector Operations684805
! Node: Conversions686687
! Node: RTL Declarations691185
! Node: Side Effects692006
! Node: Incdec709021
! Node: Assembler712356
! Node: Debug Information713901
! Node: Insns715099
! Node: Calls741533
! Node: Sharing744126
! Node: Reading RTL747236
! Node: Control Flow748228
! Node: Basic Blocks749996
! Node: Edges755452
! Node: Profile information764084
! Node: Maintaining the CFG768768
! Node: Liveness information774631
! Node: Loop Analysis and Representation776757
! Node: Loop representation777867
! Node: Loop querying785432
! Node: Loop manipulation788265
! Node: LCSSA790633
! Node: Scalar evolutions792705
! Node: loop-iv795949
! Node: Number of iterations797875
! Node: Dependency analysis800684
! Node: Omega807051
! Node: Machine Desc808627
! Node: Overview811190
! Node: Patterns813231
! Node: Example816739
! Node: RTL Template818200
! Node: Output Template828856
! Node: Output Statement832821
! Node: Predicates837160
! Node: Machine-Independent Predicates840078
! Node: Defining Predicates845023
! Node: Constraints850988
! Node: Simple Constraints852457
! Node: Multi-Alternative865313
! Node: Class Preferences868440
! Node: Modifiers869332
! Node: Machine Constraints874064
! Node: Disable Insn Alternatives931767
! Node: Define Constraints935256
! Node: C Constraint Interface942043
! Node: Standard Names945183
! Ref: shift patterns970065
! Ref: prologue instruction pattern1015352
! Ref: window_save instruction pattern1015845
! Ref: epilogue instruction pattern1016120
! Node: Pattern Ordering1033691
! Node: Dependent Patterns1034927
! Node: Jump Patterns1036547
! Ref: Jump Patterns-Footnote-11038691
! Node: Looping Patterns1038737
! Node: Insn Canonicalizations1043465
! Node: Expander Definitions1048056
! Node: Insn Splitting1056268
! Node: Including Patterns1065870
! Node: Peephole Definitions1067650
! Node: define_peephole1068903
! Node: define_peephole21075234
! Node: Insn Attributes1078300
! Node: Defining Attributes1079482
! Ref: define_enum_attr1082970
! Node: Expressions1084005
! Node: Tagging Insns1090754
! Node: Attr Example1095107
! Node: Insn Lengths1097481
! Node: Constant Attributes1100889
! Node: Mnemonic Attribute1102065
! Node: Delay Slots1103584
! Node: Processor pipeline description1106807
! Ref: Processor pipeline description-Footnote-11125620
! Node: Conditional Execution1125942
! Node: Define Subst1129422
! Node: Define Subst Example1131456
! Node: Define Subst Pattern Matching1134450
! Node: Define Subst Output Template1135675
! Node: Constant Definitions1137745
! Ref: define_enum1141527
! Node: Iterators1142015
! Node: Mode Iterators1142593
! Node: Defining Mode Iterators1143571
! Node: Substitutions1145065
! Node: Examples1147306
! Node: Code Iterators1148754
! Node: Int Iterators1151033
! Node: Subst Iterators1153476
! Node: Target Macros1155168
! Node: Target Structure1158180
! Node: Driver1160295
! Node: Run-time Target1179105
! Node: Per-Function Data1188803
! Node: Storage Layout1191568
! Node: Type Layout1217341
! Node: Registers1230971
! Node: Register Basics1231945
! Node: Allocation Order1237380
! Node: Values in Registers1239868
! Node: Leaf Functions1247357
! Node: Stack Registers1250215
! Node: Register Classes1251487
! Node: Stack and Calling1283895
! Node: Frame Layout1284461
! Node: Exception Handling1295433
! Node: Stack Checking1301653
! Node: Frame Registers1306464
! Node: Elimination1314729
! Node: Stack Arguments1318956
! Node: Register Arguments1326137
! Node: Scalar Return1347195
! Node: Aggregate Return1353651
! Node: Caller Saves1357839
! Node: Function Entry1358582
! Node: Profiling1369684
! Node: Tail Calls1371798
! Node: Stack Smashing Protection1373699
! Node: Miscellaneous Register Hooks1375362
! Node: Varargs1376228
! Node: Trampolines1386350
! Node: Library Calls1392393
! Node: Addressing Modes1397077
! Node: Anchored Addresses1418019
! Node: Condition Code1420668
! Node: CC0 Condition Codes1422995
! Node: MODE_CC Condition Codes1426241
! Node: Costs1433046
! Node: Scheduling1449913
! Node: Sections1473097
! Node: PIC1488790
! Node: Assembler Format1490850
! Node: File Framework1491988
! Ref: TARGET_HAVE_SWITCHABLE_BSS_SECTIONS1498929
! Node: Data Output1502194
! Node: Uninitialized Data1510147
! Node: Label Output1515158
! Node: Initialization1538516
! Node: Macros for Initialization1544478
! Node: Instruction Output1551201
! Node: Dispatch Tables1561836
! Node: Exception Region Output1566236
! Node: Alignment Output1573264
! Node: Debugging Info1577866
! Node: All Debuggers1578536
! Node: DBX Options1581391
! Node: DBX Hooks1586840
! Node: File Names and DBX1588149
! Node: SDB and DWARF1590261
! Node: VMS Debug1596521
! Node: Floating Point1597108
! Node: Mode Switching1601000
! Node: Target Attributes1605433
! Node: Emulated TLS1614143
! Node: MIPS Coprocessors1617533
! Node: PCH Target1618692
! Node: C++ ABI1620534
! Node: Named Address Spaces1625326
! Node: Misc1630240
! Ref: TARGET_SHIFT_TRUNCATION_MASK1636977
! Node: Host Config1693679
! Node: Host Common1694747
! Node: Filesystem1697126
! Node: Host Misc1701241
! Node: Fragments1703690
! Node: Target Fragment1704885
! Node: Host Fragment1715518
! Node: Collect21715758
! Node: Header Dirs1718394
! Node: Type Information1719817
! Node: GTY Options1723097
! Node: Inheritance and GTY1734745
! Ref: Inheritance and GTY-Footnote-11736308
! Node: User GC1736576
! Node: GGC Roots1740311
! Node: Files1741027
! Node: Invoking the garbage collector1743734
! Node: Troubleshooting1745237
! Node: Plugins1746313
! Node: Plugins loading1747442
! Node: Plugin API1748311
! Node: Plugins pass1755870
! Node: Plugins GC1757839
! Node: Plugins description1759554
! Node: Plugins attr1760089
! Node: Plugins recording1762360
! Node: Plugins gate1763210
! Node: Plugins tracking1763801
! Node: Plugins building1764389
! Node: LTO1766178
! Node: LTO Overview1767050
! Node: LTO object file layout1772882
! Node: IPA1777514
! Node: WHOPR1786479
! Node: Internal flags1791170
! Node: Match and Simplify1792582
! Node: GIMPLE API1793543
! Node: The Language1796165
! Node: Funding1805014
! Node: GNU Project1807512
! Node: Copying1808161
! Node: GNU Free Documentation License1845692
! Node: Contributors1870832
! Node: Option Index1909603
! Node: Concept Index1910480
  
  End Tag Table
--- 50753,51198 ----
  * volatil, in mem, asm_operands, and asm_input: Flags.       (line   76)
  * volatil, in reg:                       Flags.              (line   98)
  * volatil, in subreg:                    Flags.              (line  170)
+ * volatil, in subreg <1>:                Flags.              (line  180)
  * volatil, in symbol_ref:                Flags.              (line  206)
  * volatile memory references:            Flags.              (line  329)
  * volatile, in prefetch:                 Flags.              (line  214)
  * voting between constraint alternatives: Class Preferences. (line    6)
! * vrotlM3 instruction pattern:           Standard Names.     (line  567)
! * vrotrM3 instruction pattern:           Standard Names.     (line  567)
! * walk_dominator_tree:                   SSA.                (line  227)
  * walk_gimple_op:                        Statement and operand traversals.
!                                                              (line   30)
  * walk_gimple_seq:                       Statement and operand traversals.
!                                                              (line   47)
  * walk_gimple_stmt:                      Statement and operand traversals.
!                                                              (line   10)
! * WCHAR_TYPE:                            Type Layout.        (line  171)
! * WCHAR_TYPE_SIZE:                       Type Layout.        (line  179)
! * which_alternative:                     Output Statement.   (line   58)
  * WHILE_BODY:                            Statements for C++. (line    6)
  * WHILE_COND:                            Statements for C++. (line    6)
  * WHILE_STMT:                            Statements for C++. (line    6)
  * whopr:                                 LTO.                (line    6)
! * WIDEST_HARDWARE_FP_SIZE:               Type Layout.        (line  116)
! * window_save instruction pattern:       Standard Names.     (line 1562)
! * WINT_TYPE:                             Type Layout.        (line  184)
! * WORDS_BIG_ENDIAN:                      Storage Layout.     (line   28)
! * WORDS_BIG_ENDIAN, effect on subreg:    Regs and Memory.    (line  215)
! * word_mode:                             Machine Modes.      (line  367)
! * WORD_REGISTER_OPERATIONS:              Misc.               (line   53)
  * wpa:                                   LTO.                (line    6)
! * X in constraint:                       Simple Constraints. (line  122)
  * x-HOST:                                Host Fragment.      (line    6)
! * XCmode:                                Machine Modes.      (line  199)
! * XCOFF_DEBUGGING_INFO:                  DBX Options.        (line   12)
  * XEXP:                                  Accessors.          (line    6)
  * XFmode:                                Machine Modes.      (line   82)
  * XImode:                                Machine Modes.      (line   54)
  * XINT:                                  Accessors.          (line    6)
  * xm-MACHINE.h:                          Filesystem.         (line    6)
! * xm-MACHINE.h <1>:                      Host Misc.          (line    6)
! * xor:                                   Arithmetic.         (line  168)
  * xor, canonicalization of:              Insn Canonicalizations.
!                                                              (line   78)
! * xorM3 instruction pattern:             Standard Names.     (line  266)
  * XSTR:                                  Accessors.          (line    6)
  * XVEC:                                  Accessors.          (line   41)
  * XVECEXP:                               Accessors.          (line   48)
  * XVECLEN:                               Accessors.          (line   44)
  * XWINT:                                 Accessors.          (line    6)
  * zero_extend:                           Conversions.        (line   28)
! * zero_extendMN2 instruction pattern:    Standard Names.     (line  975)
  * zero_extract:                          Bit-Fields.         (line   30)
  * zero_extract, canonicalization of:     Insn Canonicalizations.
!                                                              (line   87)
  
  
  
  Tag Table:
! Node: Top1789
! Node: Contributing4971
! Node: Portability5700
! Node: Interface7488
! Node: Libgcc10529
! Node: Integer library routines12356
! Node: Soft float library routines19324
! Node: Decimal float library routines31262
! Node: Fixed-point fractional library routines47020
! Node: Exception handling routines147416
! Node: Miscellaneous routines148523
! Node: Languages150643
! Node: Source Tree152190
! Node: Configure Terms152772
! Node: Top Level155728
! Node: gcc Directory159215
! Node: Subdirectories160167
! Node: Configuration162335
! Node: Config Fragments163055
! Node: System Config164280
! Node: Configuration Files165216
! Node: Build168033
! Node: Makefile168445
! Ref: Makefile-Footnote-1175249
! Ref: Makefile-Footnote-2175396
! Node: Library Files175470
! Node: Headers176032
! Node: Documentation178115
! Node: Texinfo Manuals178974
! Node: Man Page Generation181303
! Node: Miscellaneous Docs183216
! Node: Front End184603
! Node: Front End Directory188277
! Node: Front End Config189593
! Node: Front End Makefile192409
! Node: Back End196177
! Node: Testsuites199958
! Node: Test Idioms200889
! Node: Test Directives204287
! Node: Directives204814
! Node: Selectors215111
! Node: Effective-Target Keywords216467
! Ref: arm_neon_ok224330
! Ref: arm_neonv2_ok224488
! Ref: arm_neon_fp16_ok224660
! Ref: arm_vfp3_ok225100
! Node: Add Options235632
! Node: Require Support236949
! Node: Final Actions239456
! Node: Ada Tests244621
! Node: C Tests245952
! Node: libgcj Tests250347
! Node: LTO Testing251474
! Node: gcov Testing253122
! Node: profopt Testing256112
! Node: compat Testing257827
! Node: Torture Tests262067
! Node: Options263682
! Node: Option file format264123
! Node: Option properties271112
! Node: Passes284662
! Node: Parsing pass285552
! Node: Cilk Plus Transformation289085
! Node: Gimplification pass292467
! Node: Pass manager294312
! Node: Tree SSA passes296158
! Node: RTL passes317343
! Node: Optimization info329647
! Node: Dump setup330466
! Node: Optimization groups331595
! Node: Dump files and streams332484
! Node: Dump output verbosity333682
! Node: Dump types334738
! Node: Dump examples336228
! Node: GENERIC337574
! Node: Deficiencies339450
! Node: Tree overview339691
! Node: Macros and Functions343815
! Node: Identifiers344640
! Node: Containers346249
! Node: Types347406
! Node: Declarations359480
! Node: Working with declarations359975
! Node: Internal structure365579
! Node: Current structure hierarchy365963
! Node: Adding new DECL node types368056
! Node: Attributes372340
! Node: Expression trees373584
! Node: Constant expressions375338
! Node: Storage References378634
! Node: Unary and Binary Expressions382153
! Node: Vectors402301
! Node: Statements407496
! Node: Basic Statements408028
! Node: Blocks412535
! Node: Statement Sequences413939
! Node: Empty Statements414272
! Node: Jumps414846
! Node: Cleanups415499
! Node: OpenMP417266
! Node: OpenACC423111
! Node: Functions424152
! Node: Function Basics424623
! Node: Function Properties428307
! Node: Language-dependent trees431088
! Node: C and C++ Trees431975
! Node: Types for C++434879
! Node: Namespaces439849
! Node: Classes442955
! Node: Functions for C++448032
! Node: Statements for C++454283
! Node: C++ Expressions463060
! Node: Java Trees464565
! Node: GIMPLE464678
! Node: Tuple representation468343
! Node: Class hierarchy of GIMPLE statements475348
! Node: GIMPLE instruction set480351
! Node: GIMPLE Exception Handling481983
! Node: Temporaries483895
! Ref: Temporaries-Footnote-1485213
! Node: Operands485278
! Node: Compound Expressions486039
! Node: Compound Lvalues486273
! Node: Conditional Expressions487035
! Node: Logical Operators487694
! Node: Manipulating GIMPLE statements494558
! Node: Tuple specific accessors500494
! Node: GIMPLE_ASM501273
! Node: GIMPLE_ASSIGN503656
! Node: GIMPLE_BIND508360
! Node: GIMPLE_CALL510174
! Node: GIMPLE_CATCH514202
! Node: GIMPLE_COND515352
! Node: GIMPLE_DEBUG518147
! Node: GIMPLE_EH_FILTER521520
! Node: GIMPLE_LABEL523083
! Node: GIMPLE_GOTO523696
! Node: GIMPLE_NOP524219
! Node: GIMPLE_OMP_ATOMIC_LOAD524581
! Node: GIMPLE_OMP_ATOMIC_STORE525577
! Node: GIMPLE_OMP_CONTINUE526276
! Node: GIMPLE_OMP_CRITICAL527755
! Node: GIMPLE_OMP_FOR528749
! Node: GIMPLE_OMP_MASTER532165
! Node: GIMPLE_OMP_ORDERED532543
! Node: GIMPLE_OMP_PARALLEL532937
! Node: GIMPLE_OMP_RETURN535706
! Node: GIMPLE_OMP_SECTION536351
! Node: GIMPLE_OMP_SECTIONS537011
! Node: GIMPLE_OMP_SINGLE538621
! Node: GIMPLE_PHI539567
! Node: GIMPLE_RESX540846
! Node: GIMPLE_RETURN541565
! Node: GIMPLE_SWITCH542139
! Node: GIMPLE_TRY544014
! Node: GIMPLE_WITH_CLEANUP_EXPR545786
! Node: GIMPLE sequences546665
! Node: Sequence iterators549871
! Node: Adding a new GIMPLE statement code558328
! Node: Statement and operand traversals559703
! Node: Tree SSA562295
! Node: Annotations564083
! Node: SSA Operands564488
! Node: SSA578562
! Node: Alias analysis589594
! Node: Memory model593368
! Node: RTL594727
! Node: RTL Objects596915
! Node: RTL Classes600789
! Node: Accessors605835
! Node: Special Accessors608229
! Node: Flags614016
! Node: Machine Modes628780
! Node: Constants642428
! Node: Regs and Memory650515
! Node: Arithmetic668403
! Node: Comparisons678448
! Node: Bit-Fields682740
! Node: Vector Operations684292
! Node: Conversions686173
! Node: RTL Declarations690671
! Node: Side Effects691492
! Node: Incdec708503
! Node: Assembler711839
! Node: Debug Information713384
! Node: Insns714581
! Node: Calls740978
! Node: Sharing743571
! Node: Reading RTL746682
! Node: Control Flow747673
! Node: Basic Blocks749442
! Node: Edges754896
! Node: Profile information763525
! Node: Maintaining the CFG768209
! Node: Liveness information774071
! Node: Loop Analysis and Representation776197
! Node: Loop representation777307
! Node: Loop querying784870
! Node: Loop manipulation787686
! Node: LCSSA790047
! Node: Scalar evolutions792116
! Node: loop-iv795360
! Node: Number of iterations797282
! Node: Dependency analysis800088
! Node: Omega806452
! Node: Machine Desc808028
! Node: Overview810591
! Node: Patterns812631
! Node: Example816139
! Node: RTL Template817600
! Node: Output Template828256
! Node: Output Statement832219
! Node: Predicates836558
! Node: Machine-Independent Predicates839476
! Node: Defining Predicates844420
! Node: Constraints850383
! Node: Simple Constraints851852
! Node: Multi-Alternative864692
! Node: Class Preferences867819
! Node: Modifiers868711
! Node: Machine Constraints873444
! Node: Disable Insn Alternatives931734
! Node: Define Constraints935226
! Node: C Constraint Interface942011
! Node: Standard Names945160
! Ref: shift patterns970043
! Ref: prologue instruction pattern1015303
! Ref: window_save instruction pattern1015796
! Ref: epilogue instruction pattern1016073
! Node: Pattern Ordering1033643
! Node: Dependent Patterns1034879
! Node: Jump Patterns1036499
! Ref: Jump Patterns-Footnote-11038646
! Node: Looping Patterns1038694
! Node: Insn Canonicalizations1043423
! Node: Expander Definitions1048008
! Node: Insn Splitting1056222
! Node: Including Patterns1065825
! Node: Peephole Definitions1067609
! Node: define_peephole1068862
! Node: define_peephole21075192
! Node: Insn Attributes1078258
! Node: Defining Attributes1079440
! Ref: define_enum_attr1082933
! Node: Expressions1083969
! Node: Tagging Insns1090719
! Node: Attr Example1095072
! Node: Insn Lengths1097445
! Node: Constant Attributes1100853
! Node: Mnemonic Attribute1102029
! Node: Delay Slots1103548
! Node: Processor pipeline description1106771
! Ref: Processor pipeline description-Footnote-11125589
! Node: Conditional Execution1125913
! Node: Define Subst1129396
! Node: Define Subst Example1131432
! Node: Define Subst Pattern Matching1134426
! Node: Define Subst Output Template1135652
! Node: Constant Definitions1137722
! Ref: define_enum1141504
! Node: Iterators1141992
! Node: Mode Iterators1142570
! Node: Defining Mode Iterators1143548
! Node: Substitutions1145042
! Node: Examples1147284
! Node: Code Iterators1148732
! Node: Int Iterators1151011
! Node: Subst Iterators1153457
! Node: Target Macros1155149
! Node: Target Structure1158161
! Node: Driver1160277
! Node: Run-time Target1179089
! Node: Per-Function Data1188800
! Node: Storage Layout1191564
! Node: Type Layout1217321
! Node: Registers1230947
! Node: Register Basics1231921
! Node: Allocation Order1237359
! Node: Values in Registers1239843
! Node: Leaf Functions1247321
! Node: Stack Registers1250180
! Node: Register Classes1251452
! Node: Stack and Calling1283805
! Node: Frame Layout1284371
! Node: Exception Handling1295339
! Node: Stack Checking1301549
! Node: Frame Registers1306361
! Node: Elimination1314626
! Node: Stack Arguments1318854
! Node: Register Arguments1326036
! Node: Scalar Return1347081
! Node: Aggregate Return1353538
! Node: Caller Saves1357727
! Node: Function Entry1358469
! Node: Profiling1369561
! Node: Tail Calls1371671
! Node: Stack Smashing Protection1373572
! Node: Miscellaneous Register Hooks1375235
! Node: Varargs1376101
! Node: Trampolines1386210
! Node: Library Calls1392253
! Node: Addressing Modes1396937
! Node: Anchored Addresses1417860
! Node: Condition Code1420503
! Node: CC0 Condition Codes1422830
! Node: MODE_CC Condition Codes1426076
! Node: Costs1432884
! Node: Scheduling1449746
! Node: Sections1472924
! Node: PIC1488617
! Node: Assembler Format1490676
! Node: File Framework1491814
! Ref: TARGET_HAVE_SWITCHABLE_BSS_SECTIONS1498746
! Node: Data Output1502016
! Node: Uninitialized Data1509962
! Node: Label Output1514973
! Node: Initialization1538319
! Node: Macros for Initialization1544280
! Node: Instruction Output1550999
! Node: Dispatch Tables1561628
! Node: Exception Region Output1566028
! Node: Alignment Output1573051
! Node: Debugging Info1577654
! Node: All Debuggers1578324
! Node: DBX Options1581179
! Node: DBX Hooks1586617
! Node: File Names and DBX1587926
! Node: SDB and DWARF1590038
! Node: VMS Debug1596297
! Node: Floating Point1596884
! Node: Mode Switching1600776
! Node: Target Attributes1605212
! Node: Emulated TLS1613922
! Node: MIPS Coprocessors1617312
! Node: PCH Target1618471
! Node: C++ ABI1620313
! Node: Named Address Spaces1625107
! Node: Misc1630016
! Ref: TARGET_SHIFT_TRUNCATION_MASK1636753
! Node: Host Config1693410
! Node: Host Common1694478
! Node: Filesystem1696852
! Node: Host Misc1700967
! Node: Fragments1703416
! Node: Target Fragment1704611
! Node: Host Fragment1715239
! Node: Collect21715479
! Node: Header Dirs1718115
! Node: Type Information1719538
! Node: GTY Options1722814
! Node: Inheritance and GTY1734466
! Ref: Inheritance and GTY-Footnote-11736029
! Node: User GC1736299
! Node: GGC Roots1740038
! Node: Files1740751
! Node: Invoking the garbage collector1743458
! Node: Troubleshooting1744963
! Node: Plugins1746038
! Node: Plugins loading1747167
! Node: Plugin API1748037
! Node: Plugins pass1755595
! Node: Plugins GC1757566
! Node: Plugins description1759284
! Node: Plugins attr1759820
! Node: Plugins recording1762094
! Node: Plugins gate1762944
! Node: Plugins tracking1763535
! Node: Plugins building1764123
! Node: LTO1765913
! Node: LTO Overview1766785
! Node: LTO object file layout1772612
! Node: IPA1777242
! Node: WHOPR1786207
! Node: Internal flags1790896
! Node: Match and Simplify1792307
! Node: GIMPLE API1793261
! Node: The Language1795883
! Node: Funding1804726
! Node: GNU Project1807225
! Node: Copying1807874
! Node: GNU Free Documentation License1845386
! Node: Contributors1870507
! Node: Option Index1909275
! Node: Concept Index1910152
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/gcc/doc/gcj-dbtool.1 gcc-5.5.0/gcc/doc/gcj-dbtool.1
*** gcc-5.4.0/gcc/doc/gcj-dbtool.1	Fri Jun  3 10:15:09 2016
--- gcc-5.5.0/gcc/doc/gcj-dbtool.1	Tue Oct 10 09:24:12 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GCJ-DBTOOL 1"
! .TH GCJ-DBTOOL 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GCJ-DBTOOL 1"
! .TH GCJ-DBTOOL 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/gcc/doc/gcj.1 gcc-5.5.0/gcc/doc/gcj.1
*** gcc-5.4.0/gcc/doc/gcj.1	Fri Jun  3 10:15:09 2016
--- gcc-5.5.0/gcc/doc/gcj.1	Tue Oct 10 09:24:11 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GCJ 1"
! .TH GCJ 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GCJ 1"
! .TH GCJ 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** of the same options as gcc.    This manu
*** 155,161 ****
  options specific to \fBgcj\fR.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! .Sh "Input and output files"
  .IX Subsection "Input and output files"
  A \fBgcj\fR command is like a \fBgcc\fR command, in that it
  consists of a number of options and file names.  The following kinds
--- 152,158 ----
  options specific to \fBgcj\fR.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! .SS "Input and output files"
  .IX Subsection "Input and output files"
  A \fBgcj\fR command is like a \fBgcc\fR command, in that it
  consists of a number of options and file names.  The following kinds
*************** but not when using \f(CW\*(C`\-C\*(C'\fR
*** 203,209 ****
  (This is an extension beyond the what plain \fBgcc\fR allows.)
  (If more than one input file is specified, all must currently
  be \f(CW\*(C`.java\*(C'\fR files, though we hope to fix this.)
! .Sh "Input Options"
  .IX Subsection "Input Options"
  \&\fBgcj\fR has options to control where it looks to find files it needs.
  For instance, \fBgcj\fR might need to load a class that is referenced
--- 200,206 ----
  (This is an extension beyond the what plain \fBgcc\fR allows.)
  (If more than one input file is specified, all must currently
  be \f(CW\*(C`.java\*(C'\fR files, though we hope to fix this.)
! .SS "Input Options"
  .IX Subsection "Input Options"
  \&\fBgcj\fR has options to control where it looks to find files it needs.
  For instance, \fBgcj\fR might need to load a class that is referenced
*************** issue an error if it isn't found.
*** 277,283 ****
  .IX Item "-fsource=VERSION"
  This option is used to choose the source version accepted by
  \&\fBgcj\fR.  The default is \fB1.5\fR.
! .Sh "Encodings"
  .IX Subsection "Encodings"
  The Java programming language uses Unicode throughout.  In an effort to
  integrate well with other locales, \fBgcj\fR allows \fI.java\fR files
--- 274,280 ----
  .IX Item "-fsource=VERSION"
  This option is used to choose the source version accepted by
  \&\fBgcj\fR.  The default is \fB1.5\fR.
! .SS "Encodings"
  .IX Subsection "Encodings"
  The Java programming language uses Unicode throughout.  In an effort to
  integrate well with other locales, \fBgcj\fR allows \fI.java\fR files
*************** to platform (since they are not standard
*** 300,306 ****
  \&\fBgcj\fR implements the encoding named \fB\s-1UTF\-8\s0\fR internally, so if
  you choose to use this for your source files you can be assured that it
  will work on every host.
! .Sh "Warnings"
  .IX Subsection "Warnings"
  \&\fBgcj\fR implements several warnings.  As with other generic
  \&\fBgcc\fR warnings, if an option of the form \f(CW\*(C`\-Wfoo\*(C'\fR enables a
--- 297,303 ----
  \&\fBgcj\fR implements the encoding named \fB\s-1UTF\-8\s0\fR internally, so if
  you choose to use this for your source files you can be assured that it
  will work on every host.
! .SS "Warnings"
  .IX Subsection "Warnings"
  \&\fBgcj\fR implements several warnings.  As with other generic
  \&\fBgcc\fR warnings, if an option of the form \f(CW\*(C`\-Wfoo\*(C'\fR enables a
*************** This is the same as \fBgcc\fR's \f(CW\*(
*** 330,336 ****
  .IX Item "-Wall"
  This is the same as \f(CW\*(C`\-Wredundant\-modifiers \-Wextraneous\-semicolon
  \&\-Wunused\*(C'\fR.
! .Sh "Linking"
  .IX Subsection "Linking"
  To turn a Java application into an executable program,
  you need to link it with the needed libraries, just as for C or \*(C+.
--- 327,333 ----
  .IX Item "-Wall"
  This is the same as \f(CW\*(C`\-Wredundant\-modifiers \-Wextraneous\-semicolon
  \&\-Wunused\*(C'\fR.
! .SS "Linking"
  .IX Subsection "Linking"
  To turn a Java application into an executable program,
  you need to link it with the needed libraries, just as for C or \*(C+.
*************** link time, it can omit the referred to c
*** 391,397 ****
  runtime. Caution must be used when using this option.  For more
  details see:
  <\fBhttp://gcc.gnu.org/wiki/Statically%20linking%20libgcj\fR>
! .Sh "Code Generation"
  .IX Subsection "Code Generation"
  In addition to the many \fBgcc\fR options controlling code generation,
  \&\fBgcj\fR has several options specific to itself.
--- 388,394 ----
  runtime. Caution must be used when using this option.  For more
  details see:
  <\fBhttp://gcc.gnu.org/wiki/Statically%20linking%20libgcj\fR>
! .SS "Code Generation"
  .IX Subsection "Code Generation"
  In addition to the many \fBgcc\fR options controlling code generation,
  \&\fBgcj\fR has several options specific to itself.
*************** It is safe to use this option if you are
*** 439,447 ****
  .IP "\fB\-fjni\fR" 4
  .IX Item "-fjni"
  With \fBgcj\fR there are two options for writing native methods: \s-1CNI\s0
! and \s-1JNI\s0.  By default \fBgcj\fR assumes you are using \s-1CNI\s0.  If you are
  compiling a class with native methods, and these methods are implemented
! using \s-1JNI\s0, then you must use \f(CW\*(C`\-fjni\*(C'\fR.  This option causes
  \&\fBgcj\fR to generate stubs which will invoke the underlying \s-1JNI\s0
  methods.
  .IP "\fB\-fno\-assert\fR" 4
--- 436,444 ----
  .IP "\fB\-fjni\fR" 4
  .IX Item "-fjni"
  With \fBgcj\fR there are two options for writing native methods: \s-1CNI\s0
! and \s-1JNI.\s0  By default \fBgcj\fR assumes you are using \s-1CNI.\s0  If you are
  compiling a class with native methods, and these methods are implemented
! using \s-1JNI,\s0 then you must use \f(CW\*(C`\-fjni\*(C'\fR.  This option causes
  \&\fBgcj\fR to generate stubs which will invoke the underlying \s-1JNI\s0
  methods.
  .IP "\fB\-fno\-assert\fR" 4
*************** So this flag isn't very useful yet, exce
*** 478,484 ****
  \&\f(CW\*(C`\-\-disable\-assertions\*(C'\fR.
  .IP "\fB\-findirect\-dispatch\fR" 4
  .IX Item "-findirect-dispatch"
! \&\fBgcj\fR has a special binary compatibility \s-1ABI\s0, which is enabled
  by the \f(CW\*(C`\-findirect\-dispatch\*(C'\fR option.  In this mode, the code
  generated by \fBgcj\fR honors the binary compatibility guarantees
  in the Java Language Specification, and the resulting object files do
--- 475,481 ----
  \&\f(CW\*(C`\-\-disable\-assertions\*(C'\fR.
  .IP "\fB\-findirect\-dispatch\fR" 4
  .IX Item "-findirect-dispatch"
! \&\fBgcj\fR has a special binary compatibility \s-1ABI,\s0 which is enabled
  by the \f(CW\*(C`\-findirect\-dispatch\*(C'\fR option.  In this mode, the code
  generated by \fBgcj\fR honors the binary compatibility guarantees
  in the Java Language Specification, and the resulting object files do
*************** interpreted and compiled code.
*** 489,498 ****
  Note that, at present, \f(CW\*(C`\-findirect\-dispatch\*(C'\fR can only be used
  when compiling \fI.class\fR files.  It will not work when compiling
  from source.  \s-1CNI\s0 also does not yet work with the binary compatibility
! \&\s-1ABI\s0.  These restrictions will be lifted in some future release.
  .Sp
! However, if you compile \s-1CNI\s0 code with the standard \s-1ABI\s0, you can call
! it from code built with the binary compatibility \s-1ABI\s0.
  .IP "\fB\-fbootstrap\-classes\fR" 4
  .IX Item "-fbootstrap-classes"
  This option can be use to tell \f(CW\*(C`libgcj\*(C'\fR that the compiled classes
--- 486,495 ----
  Note that, at present, \f(CW\*(C`\-findirect\-dispatch\*(C'\fR can only be used
  when compiling \fI.class\fR files.  It will not work when compiling
  from source.  \s-1CNI\s0 also does not yet work with the binary compatibility
! \&\s-1ABI.\s0  These restrictions will be lifted in some future release.
  .Sp
! However, if you compile \s-1CNI\s0 code with the standard \s-1ABI,\s0 you can call
! it from code built with the binary compatibility \s-1ABI.\s0
  .IP "\fB\-fbootstrap\-classes\fR" 4
  .IX Item "-fbootstrap-classes"
  This option can be use to tell \f(CW\*(C`libgcj\*(C'\fR that the compiled classes
*************** the ability to use certain reflection ca
*** 511,517 ****
  Java runtime environment. When set all meta-data except for that
  which is needed to obtain correct runtime semantics is eliminated.
  .Sp
! For code that does not use reflection (i.e. serialization, \s-1RMI\s0, \s-1CORBA\s0
  or call methods in the \f(CW\*(C`java.lang.reflect\*(C'\fR package),
  \&\f(CW\*(C`\-freduced\-reflection\*(C'\fR will result in proper operation with a
  savings in executable code size.
--- 508,514 ----
  Java runtime environment. When set all meta-data except for that
  which is needed to obtain correct runtime semantics is eliminated.
  .Sp
! For code that does not use reflection (i.e. serialization, \s-1RMI, CORBA\s0
  or call methods in the \f(CW\*(C`java.lang.reflect\*(C'\fR package),
  \&\f(CW\*(C`\-freduced\-reflection\*(C'\fR will result in proper operation with a
  savings in executable code size.
*************** with \f(CW\*(C`\-freduced\-reflection\*(
*** 525,533 ****
  a \f(CW\*(C`SecurityManager\*(C'\fR may not work properly.  Also calling
  \&\f(CW\*(C`Class.forName()\*(C'\fR may fail if the calling method has no
  reflection meta-data.
! .Sh "Configure-time Options"
  .IX Subsection "Configure-time Options"
! Some \fBgcj\fR code generations options affect the resulting \s-1ABI\s0, and
  so can only be meaningfully given when \f(CW\*(C`libgcj\*(C'\fR, the runtime
  package, is configured.  \f(CW\*(C`libgcj\*(C'\fR puts the appropriate options from
  this group into a \fBspec\fR file which is read by \fBgcj\fR.  These
--- 522,530 ----
  a \f(CW\*(C`SecurityManager\*(C'\fR may not work properly.  Also calling
  \&\f(CW\*(C`Class.forName()\*(C'\fR may fail if the calling method has no
  reflection meta-data.
! .SS "Configure-time Options"
  .IX Subsection "Configure-time Options"
! Some \fBgcj\fR code generations options affect the resulting \s-1ABI,\s0 and
  so can only be meaningfully given when \f(CW\*(C`libgcj\*(C'\fR, the runtime
  package, is configured.  \f(CW\*(C`libgcj\*(C'\fR puts the appropriate options from
  this group into a \fBspec\fR file which is read by \fBgcj\fR.  These
diff -Nrcpad gcc-5.4.0/gcc/doc/gcj.info gcc-5.5.0/gcc/doc/gcj.info
*** gcc-5.4.0/gcc/doc/gcj.info	Fri Jun  3 10:32:22 2016
--- gcc-5.5.0/gcc/doc/gcj.info	Tue Oct 10 09:40:25 2017
***************
*** 1,5 ****
! This is doc/gcj.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/java/gcj.texi.
  
  Copyright (C) 2001-2015 Free Software Foundation, Inc.
  
--- 1,4 ----
! This is gcj.info, produced by makeinfo version 6.1 from gcj.texi.
  
  Copyright (C) 2001-2015 Free Software Foundation, Inc.
  
*************** is included in the section entitled "GNU
*** 17,25 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
! 
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * Gcj: (gcj).               Ahead-of-time compiler for the Java language
--- 16,23 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * Gcj: (gcj).               Ahead-of-time compiler for the Java language
*************** START-INFO-DIR-ENTRY
*** 45,50 ****
--- 43,50 ----
                              into one system-wide database.
  END-INFO-DIR-ENTRY
  
+ 
+ 
     Copyright (C) 2001-2015 Free Software Foundation, Inc.
  
     Permission is granted to copy, distribute and/or modify this document
*************** is included in the section entitled "GNU
*** 61,68 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
  
  
  File: gcj.info,  Node: Top,  Next: Copying,  Up: (dir)
--- 61,68 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
  
  
  File: gcj.info,  Node: Top,  Next: Copying,  Up: (dir)
*************** File: gcj.info,  Node: Top,  Next: Copyi
*** 70,85 ****
  Introduction
  ************
  
! This manual describes how to use `gcj', the GNU compiler for the Java
! programming language.  `gcj' can generate both `.class' files and
! object files, and it can read both Java source code and `.class' files.
  
  * Menu:
  
  * Copying::             The GNU General Public License
  * GNU Free Documentation License::
                          How you can share and copy this manual
! * Invoking gcj::        Compiler options supported by `gcj'
  * Compatibility::       Compatibility between gcj and other tools for Java
  * Invoking jcf-dump::   Print information about class files
  * Invoking gij::        Interpreting Java bytecodes
--- 70,85 ----
  Introduction
  ************
  
! This manual describes how to use 'gcj', the GNU compiler for the Java
! programming language.  'gcj' can generate both '.class' files and object
! files, and it can read both Java source code and '.class' files.
  
  * Menu:
  
  * Copying::             The GNU General Public License
  * GNU Free Documentation License::
                          How you can share and copy this manual
! * Invoking gcj::        Compiler options supported by 'gcj'
  * Compatibility::       Compatibility between gcj and other tools for Java
  * Invoking jcf-dump::   Print information about class files
  * Invoking gij::        Interpreting Java bytecodes
*************** GNU General Public License
*** 103,109 ****
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
--- 103,109 ----
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
*************** want it, that you can change the softwar
*** 131,139 ****
  free programs, and that you know you can do these things.
  
     To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you
! have certain responsibilities if you distribute copies of the software,
! or if you modify it: responsibilities to respect the freedom of others.
  
     For example, if you distribute copies of such a program, whether
  gratis or for a fee, you must pass on to the recipients the same
--- 131,139 ----
  free programs, and that you know you can do these things.
  
     To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you have
! certain responsibilities if you distribute copies of the software, or if
! you modify it: responsibilities to respect the freedom of others.
  
     For example, if you distribute copies of such a program, whether
  gratis or for a fee, you must pass on to the recipients the same
*************** changed, so that their problems will not
*** 152,167 ****
  authors of previous versions.
  
     Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the
! manufacturer can do so.  This is fundamentally incompatible with the
! aim of protecting users' freedom to change the software.  The
! systematic pattern of such abuse occurs in the area of products for
! individuals to use, which is precisely where it is most unacceptable.
! Therefore, we have designed this version of the GPL to prohibit the
! practice for those products.  If such problems arise substantially in
! other domains, we stand ready to extend this provision to those domains
! in future versions of the GPL, as needed to protect the freedom of
! users.
  
     Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
--- 152,166 ----
  authors of previous versions.
  
     Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the manufacturer
! can do so.  This is fundamentally incompatible with the aim of
! protecting users' freedom to change the software.  The systematic
! pattern of such abuse occurs in the area of products for individuals to
! use, which is precisely where it is most unacceptable.  Therefore, we
! have designed this version of the GPL to prohibit the practice for those
! products.  If such problems arise substantially in other domains, we
! stand ready to extend this provision to those domains in future versions
! of the GPL, as needed to protect the freedom of users.
  
     Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
*************** TERMS AND CONDITIONS
*** 198,205 ****
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it
!      on a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
--- 197,204 ----
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it on
!      a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
*************** TERMS AND CONDITIONS
*** 213,220 ****
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may
!      convey the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
--- 212,219 ----
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may convey
!      the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
*************** TERMS AND CONDITIONS
*** 222,229 ****
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any
!      non-source form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
--- 221,228 ----
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any non-source
!      form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
*************** TERMS AND CONDITIONS
*** 234,243 ****
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work
!      with that Major Component, or to implement a Standard Interface
!      for which an implementation is available to the public in source
!      code form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
--- 233,242 ----
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work with
!      that Major Component, or to implement a Standard Interface for
!      which an implementation is available to the public in source code
!      form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
*************** TERMS AND CONDITIONS
*** 245,259 ****
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including
!      scripts to control those activities.  However, it does not include
!      the work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files
!      associated with source files for the work, and the source code for
!      shared libraries and dynamically linked subprograms that the work
!      is specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
--- 244,258 ----
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including scripts
!      to control those activities.  However, it does not include the
!      work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files associated
!      with source files for the work, and the source code for shared
!      libraries and dynamically linked subprograms that the work is
!      specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
*************** TERMS AND CONDITIONS
*** 270,291 ****
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output,
!      given its content, constitutes a covered work.  This License
!      acknowledges your rights of fair use or other equivalent, as
!      provided by copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for
!      you, or provide you with facilities for running those works,
!      provided that you comply with the terms of this License in
!      conveying all material for which you do not control copyright.
!      Those thus making or running the covered works for you must do so
!      exclusively on your behalf, under your direction and control, on
!      terms that prohibit them from making any copies of your
!      copyrighted material outside their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
--- 269,290 ----
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output, given
!      its content, constitutes a covered work.  This License acknowledges
!      your rights of fair use or other equivalent, as provided by
!      copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for you,
!      or provide you with facilities for running those works, provided
!      that you comply with the terms of this License in conveying all
!      material for which you do not control copyright.  Those thus making
!      or running the covered works for you must do so exclusively on your
!      behalf, under your direction and control, on terms that prohibit
!      them from making any copies of your copyrighted material outside
!      their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
*************** TERMS AND CONDITIONS
*** 302,309 ****
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention
!      to limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
--- 301,308 ----
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention to
!      limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
*************** TERMS AND CONDITIONS
*** 373,380 ****
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for
!           as long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
--- 372,379 ----
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for as
!           long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
*************** TERMS AND CONDITIONS
*** 384,415 ****
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of
!           the written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access
!           to the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated
!           by you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to
!           the object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long
!           as needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
- 
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
--- 383,413 ----
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of the
!           written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access to
!           the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated by
!           you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to the
!           object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long as
!           needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
*************** TERMS AND CONDITIONS
*** 417,424 ****
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product
!      is a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
--- 415,422 ----
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product is
!      a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
*************** TERMS AND CONDITIONS
*** 449,459 ****
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or
!      installed by the recipient, or for the User Product in which it
!      has been modified or installed.  Access to a network may be denied
!      when the modification itself materially and adversely affects the
!      operation of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
--- 447,457 ----
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or installed
!      by the recipient, or for the User Product in which it has been
!      modified or installed.  Access to a network may be denied when the
!      modification itself materially and adversely affects the operation
!      of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
*************** TERMS AND CONDITIONS
*** 483,490 ****
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License
!      with terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
--- 481,488 ----
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License with
!      terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
*************** TERMS AND CONDITIONS
*** 494,502 ****
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be
!           marked in reasonable ways as different from the original
!           version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
--- 492,499 ----
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be marked
!           in reasonable ways as different from the original version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
*************** TERMS AND CONDITIONS
*** 515,525 ****
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or
!      conveying under this License, you may add to a covered work
!      material governed by the terms of that license document, provided
!      that the further restriction does not survive such relicensing or
!      conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
--- 512,521 ----
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or conveying
!      under this License, you may add to a covered work material governed
!      by the terms of that license document, provided that the further
!      restriction does not survive such relicensing or conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
*************** TERMS AND CONDITIONS
*** 535,547 ****
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under
!      the third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 531,543 ----
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under the
!      third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** TERMS AND CONDITIONS
*** 553,562 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, you do not qualify to receive new
!      licenses for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
--- 549,558 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, you do not qualify to receive new licenses
!      for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
*************** TERMS AND CONDITIONS
*** 570,576 ****
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!  10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
--- 566,572 ----
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!   10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
*************** TERMS AND CONDITIONS
*** 584,604 ****
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to
!      possession of the Corresponding Source of the work from the
!      predecessor in interest, if the predecessor has it or can get it
!      with reasonable efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for
!      exercise of rights granted under this License, and you may not
!      initiate litigation (including a cross-claim or counterclaim in a
!      lawsuit) alleging that any patent claim is infringed by making,
!      using, selling, offering for sale, or importing the Program or any
!      portion of it.
  
!  11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
--- 580,600 ----
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to possession
!      of the Corresponding Source of the work from the predecessor in
!      interest, if the predecessor has it or can get it with reasonable
!      efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for exercise
!      of rights granted under this License, and you may not initiate
!      litigation (including a cross-claim or counterclaim in a lawsuit)
!      alleging that any patent claim is infringed by making, using,
!      selling, offering for sale, or importing the Program or any portion
!      of it.
  
!   11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
*************** TERMS AND CONDITIONS
*** 618,632 ****
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its
!      contributor version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To
!      "grant" such a patent license to a party means to make such an
!      agreement or commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
--- 614,628 ----
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its contributor
!      version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To "grant"
!      such a patent license to a party means to make such an agreement or
!      commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
*************** TERMS AND CONDITIONS
*** 656,691 ****
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under
!      which you make payment to the third party based on the extent of
!      your activity of conveying the work, and under which the third
!      party grants, to any of the parties who would receive the covered
!      work from you, a discriminatory patent license (a) in connection
!      with copies of the covered work conveyed by you (or copies made
!      from those copies), or (b) primarily for and in connection with
!      specific products or compilations that contain the covered work,
!      unless you entered into that arrangement, or that patent license
!      was granted, prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!  12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order,
!      agreement or otherwise) that contradict the conditions of this
!      License, they do not excuse you from the conditions of this
!      License.  If you cannot convey a covered work so as to satisfy
!      simultaneously your obligations under this License and any other
!      pertinent obligations, then as a consequence you may not convey it
!      at all.  For example, if you agree to terms that obligate you to
!      collect a royalty for further conveying from those to whom you
!      convey the Program, the only way you could satisfy both those
!      terms and this License would be to refrain entirely from conveying
!      the Program.
  
!  13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
--- 652,686 ----
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under which
!      you make payment to the third party based on the extent of your
!      activity of conveying the work, and under which the third party
!      grants, to any of the parties who would receive the covered work
!      from you, a discriminatory patent license (a) in connection with
!      copies of the covered work conveyed by you (or copies made from
!      those copies), or (b) primarily for and in connection with specific
!      products or compilations that contain the covered work, unless you
!      entered into that arrangement, or that patent license was granted,
!      prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!   12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order, agreement
!      or otherwise) that contradict the conditions of this License, they
!      do not excuse you from the conditions of this License.  If you
!      cannot convey a covered work so as to satisfy simultaneously your
!      obligations under this License and any other pertinent obligations,
!      then as a consequence you may not convey it at all.  For example,
!      if you agree to terms that obligate you to collect a royalty for
!      further conveying from those to whom you convey the Program, the
!      only way you could satisfy both those terms and this License would
!      be to refrain entirely from conveying the Program.
  
!   13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
*************** TERMS AND CONDITIONS
*** 696,717 ****
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!  14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.
!      Such new versions will be similar in spirit to the present
!      version, but may differ in detail to address new problems or
!      concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the
!      Free Software Foundation.  If the Program does not specify a
!      version number of the GNU General Public License, you may choose
!      any version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
--- 691,711 ----
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!   14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.  Such
!      new versions will be similar in spirit to the present version, but
!      may differ in detail to address new problems or concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the Free
!      Software Foundation.  If the Program does not specify a version
!      number of the GNU General Public License, you may choose any
!      version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
*************** TERMS AND CONDITIONS
*** 723,746 ****
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!  15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!  16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU
!      FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
--- 717,740 ----
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!   15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!   16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR
!      DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
*************** TERMS AND CONDITIONS
*** 748,754 ****
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!  17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
--- 742,748 ----
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!   17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
*************** TERMS AND CONDITIONS
*** 757,763 ****
       connection with the Program, unless a warranty or assumption of
       liability accompanies a copy of the Program in return for a fee.
  
- 
  END OF TERMS AND CONDITIONS
  ===========================
  
--- 751,756 ----
*************** state the exclusion of warranty; and eac
*** 788,794 ****
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see `http://www.gnu.org/licenses/'.
  
     Also add information on how to contact you by electronic and paper
  mail.
--- 781,787 ----
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see <http://www.gnu.org/licenses/>.
  
     Also add information on how to contact you by electronic and paper
  mail.
*************** mail.
*** 797,807 ****
  notice like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type `show c' for details.
  
!    The hypothetical commands `show w' and `show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
--- 790,800 ----
  notice like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type 'show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type 'show c' for details.
  
!    The hypothetical commands 'show w' and 'show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
*************** use an "about box".
*** 809,822 ****
     You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see `http://www.gnu.org/licenses/'.
  
     The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read `http://www.gnu.org/philosophy/why-not-lgpl.html'.
  
  
  File: gcj.info,  Node: GNU Free Documentation License,  Next: Invoking gcj,  Prev: Copying,  Up: Top
--- 802,815 ----
     You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see <http://www.gnu.org/licenses/>.
  
     The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read <http://www.gnu.org/philosophy/why-not-lgpl.html>.
  
  
  File: gcj.info,  Node: GNU Free Documentation License,  Next: Invoking gcj,  Prev: Copying,  Up: Top
*************** GNU Free Documentation License
*** 827,833 ****
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
--- 820,826 ----
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
*************** GNU Free Documentation License
*** 852,872 ****
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.
!      We recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it
!      can be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You
!      accept the license if you copy, modify or distribute the work in a
!      way requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
--- 845,865 ----
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.  We
!      recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it can
!      be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You accept
!      the license if you copy, modify or distribute the work in a way
!      requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
*************** GNU Free Documentation License
*** 884,895 ****
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in
!      the notice that says that the Document is released under this
!      License.  If a section does not fit the above definition of
!      Secondary then it is not allowed to be designated as Invariant.
!      The Document may contain zero Invariant Sections.  If the Document
!      does not identify any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
--- 877,888 ----
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in the
!      notice that says that the Document is released under this License.
!      If a section does not fit the above definition of Secondary then it
!      is not allowed to be designated as Invariant.  The Document may
!      contain zero Invariant Sections.  If the Document does not identify
!      any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
*************** GNU Free Documentation License
*** 900,926 ****
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images
!      composed of pixels) generic paint programs or (for drawings) some
!      widely available drawing editor, and that is suitable for input to
!      text formatters or for automatic translation to a variety of
!      formats suitable for input to text formatters.  A copy made in an
!      otherwise Transparent file format whose markup, or absence of
!      markup, has been arranged to thwart or discourage subsequent
!      modification by readers is not Transparent.  An image format is
!      not Transparent if used for any substantial amount of text.  A
!      copy that is not "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and
!      standard-conforming simple HTML, PostScript or PDF designed for
!      human modification.  Examples of transparent image formats include
!      PNG, XCF and JPG.  Opaque formats include proprietary formats that
!      can be read and edited only by proprietary word processors, SGML or
!      XML for which the DTD and/or processing tools are not generally
!      available, and the machine-generated HTML, PostScript or PDF
!      produced by some word processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
--- 893,919 ----
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images composed
!      of pixels) generic paint programs or (for drawings) some widely
!      available drawing editor, and that is suitable for input to text
!      formatters or for automatic translation to a variety of formats
!      suitable for input to text formatters.  A copy made in an otherwise
!      Transparent file format whose markup, or absence of markup, has
!      been arranged to thwart or discourage subsequent modification by
!      readers is not Transparent.  An image format is not Transparent if
!      used for any substantial amount of text.  A copy that is not
!      "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and standard-conforming
!      simple HTML, PostScript or PDF designed for human modification.
!      Examples of transparent image formats include PNG, XCF and JPG.
!      Opaque formats include proprietary formats that can be read and
!      edited only by proprietary word processors, SGML or XML for which
!      the DTD and/or processing tools are not generally available, and
!      the machine-generated HTML, PostScript or PDF produced by some word
!      processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
*************** GNU Free Documentation License
*** 958,965 ****
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow
!      the conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
--- 951,958 ----
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow the
!      conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
*************** GNU Free Documentation License
*** 973,984 ****
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the
!      title equally prominent and visible.  You may add other material
!      on the covers in addition.  Copying with changes limited to the
!      covers, as long as they preserve the title of the Document and
!      satisfy these conditions, can be treated as verbatim copying in
!      other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
--- 966,976 ----
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the title
!      equally prominent and visible.  You may add other material on the
!      covers in addition.  Copying with changes limited to the covers, as
!      long as they preserve the title of the Document and satisfy these
!      conditions, can be treated as verbatim copying in other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
*************** GNU Free Documentation License
*** 986,1025 ****
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a
!      machine-readable Transparent copy along with each Opaque copy, or
!      state in or with each Opaque copy a computer-network location from
!      which the general network-using public has access to download
!      using public-standard network protocols a complete Transparent
!      copy of the Document, free of added material.  If you use the
!      latter option, you must take reasonably prudent steps, when you
!      begin distribution of Opaque copies in quantity, to ensure that
!      this Transparent copy will remain thus accessible at the stated
!      location until at least one year after the last time you
!      distribute an Opaque copy (directly or through your agents or
!      retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of
!      copies, to give them a chance to provide you with an updated
!      version of the Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with
!      the Modified Version filling the role of the Document, thus
!      licensing distribution and modification of the Modified Version to
!      whoever possesses a copy of it.  In addition, you must do these
!      things in the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of
!           previous versions (which should, if there were any, be listed
!           in the History section of the Document).  You may use the
!           same title as a previous version if the original publisher of
!           that version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
--- 978,1016 ----
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a machine-readable
!      Transparent copy along with each Opaque copy, or state in or with
!      each Opaque copy a computer-network location from which the general
!      network-using public has access to download using public-standard
!      network protocols a complete Transparent copy of the Document, free
!      of added material.  If you use the latter option, you must take
!      reasonably prudent steps, when you begin distribution of Opaque
!      copies in quantity, to ensure that this Transparent copy will
!      remain thus accessible at the stated location until at least one
!      year after the last time you distribute an Opaque copy (directly or
!      through your agents or retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of copies,
!      to give them a chance to provide you with an updated version of the
!      Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with the
!      Modified Version filling the role of the Document, thus licensing
!      distribution and modification of the Modified Version to whoever
!      possesses a copy of it.  In addition, you must do these things in
!      the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of previous
!           versions (which should, if there were any, be listed in the
!           History section of the Document).  You may use the same title
!           as a previous version if the original publisher of that
!           version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
*************** GNU Free Documentation License
*** 1049,1079 ****
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on
!           the Title Page.  If there is no section Entitled "History" in
!           the Document, create one stating the title, year, authors,
!           and publisher of the Document as given on its Title Page,
!           then add an item describing the Modified Version as stated in
!           the previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in
!           the "History" section.  You may omit a network location for a
!           work that was published at least four years before the
!           Document itself, or if the original publisher of the version
!           it refers to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the
!           section all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document,
!           unaltered in their text and in their titles.  Section numbers
!           or the equivalent are not considered part of the section
!           titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
--- 1040,1069 ----
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on the
!           Title Page.  If there is no section Entitled "History" in the
!           Document, create one stating the title, year, authors, and
!           publisher of the Document as given on its Title Page, then add
!           an item describing the Modified Version as stated in the
!           previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in the
!           "History" section.  You may omit a network location for a work
!           that was published at least four years before the Document
!           itself, or if the original publisher of the version it refers
!           to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the section
!           all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document, unaltered
!           in their text and in their titles.  Section numbers or the
!           equivalent are not considered part of the section titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
*************** GNU Free Documentation License
*** 1086,1096 ****
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option
!      designate some or all of these sections as invariant.  To do this,
!      add their titles to the list of Invariant Sections in the Modified
!      Version's license notice.  These titles must be distinct from any
!      other section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
--- 1076,1086 ----
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option designate
!      some or all of these sections as invariant.  To do this, add their
!      titles to the list of Invariant Sections in the Modified Version's
!      license notice.  These titles must be distinct from any other
!      section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
*************** GNU Free Documentation License
*** 1099,1113 ****
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end
!      of the list of Cover Texts in the Modified Version.  Only one
!      passage of Front-Cover Text and one of Back-Cover Text may be
!      added by (or through arrangements made by) any one entity.  If the
!      Document already includes a cover text for the same cover,
!      previously added by you or by arrangement made by the same entity
!      you are acting on behalf of, you may not add another; but you may
!      replace the old one, on explicit permission from the previous
!      publisher that added the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
--- 1089,1103 ----
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end of
!      the list of Cover Texts in the Modified Version.  Only one passage
!      of Front-Cover Text and one of Back-Cover Text may be added by (or
!      through arrangements made by) any one entity.  If the Document
!      already includes a cover text for the same cover, previously added
!      by you or by arrangement made by the same entity you are acting on
!      behalf of, you may not add another; but you may replace the old
!      one, on explicit permission from the previous publisher that added
!      the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
*************** GNU Free Documentation License
*** 1117,1124 ****
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination
!      all of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
--- 1107,1114 ----
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination all
!      of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
*************** GNU Free Documentation License
*** 1145,1164 ****
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the
!      documents in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow
!      this License in all other respects regarding verbatim copying of
!      that document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of
!      a storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
--- 1135,1154 ----
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the documents
!      in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow this
!      License in all other respects regarding verbatim copying of that
!      document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of a
!      storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
*************** GNU Free Documentation License
*** 1203,1210 ****
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 1193,1200 ----
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** GNU Free Documentation License
*** 1216,1248 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, receipt of a copy of some or all of
!      the same material does not give you any rights to use it.
  
!  10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      `http://www.gnu.org/copyleft/'.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If
!      the Document does not specify a version number of this License,
!      you may choose any version ever published (not as a draft) by the
!      Free Software Foundation.  If the Document specifies that a proxy
!      can decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!  11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
--- 1206,1238 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, receipt of a copy of some or all of the
!      same material does not give you any rights to use it.
  
!   10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      <http://www.gnu.org/copyleft/>.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If the
!      Document does not specify a version number of this License, you may
!      choose any version ever published (not as a draft) by the Free
!      Software Foundation.  If the Document specifies that a proxy can
!      decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!   11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
*************** GNU Free Documentation License
*** 1272,1278 ****
       site under CC-BY-SA on the same site at any time before August 1,
       2009, provided the MMC is eligible for relicensing.
  
- 
  ADDENDUM: How to use this License for your documents
  ====================================================
  
--- 1262,1267 ----
*************** notices just after the title page:
*** 1289,1295 ****
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts." line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
--- 1278,1284 ----
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts."  line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
*************** combination of the three, merge those tw
*** 1300,1308 ****
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of
! free software license, such as the GNU General Public License, to
! permit their use in free software.
  
  
  File: gcj.info,  Node: Invoking gcj,  Next: Compatibility,  Prev: GNU Free Documentation License,  Up: Top
--- 1289,1297 ----
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of free
! software license, such as the GNU General Public License, to permit
! their use in free software.
  
  
  File: gcj.info,  Node: Invoking gcj,  Next: Compatibility,  Prev: GNU Free Documentation License,  Up: Top
*************** File: gcj.info,  Node: Invoking gcj,  Ne
*** 1310,1318 ****
  1 Invoking gcj
  **************
  
! As `gcj' is just another front end to `gcc', it supports many of the
  same options as gcc.  *Note Option Summary: (gcc)Option Summary.  This
! manual only documents the options specific to `gcj'.
  
  * Menu:
  
--- 1299,1307 ----
  1 Invoking gcj
  **************
  
! As 'gcj' is just another front end to 'gcc', it supports many of the
  same options as gcc.  *Note Option Summary: (gcc)Option Summary.  This
! manual only documents the options specific to 'gcj'.
  
  * Menu:
  
*************** File: gcj.info,  Node: Input and output
*** 1330,1370 ****
  1.1 Input and output files
  ==========================
  
! A `gcj' command is like a `gcc' command, in that it consists of a
! number of options and file names.  The following kinds of input file
! names are supported:
  
! `FILE.java'
       Java source files.
! 
! `FILE.class'
       Java bytecode files.
! 
! `FILE.zip'
! `FILE.jar'
!      An archive containing one or more `.class' files, all of which are
       compiled.  The archive may be compressed.  Files in an archive
!      which don't end with `.class' are treated as resource files; they
!      are compiled into the resulting object file as `core:' URLs.
! 
! `@FILE'
       A file containing a whitespace-separated list of input file names.
!      (Currently, these must all be `.java' source files, but that may
       change.)  Each named file is compiled, just as if it had been on
       the command line.
  
! `LIBRARY.a'
! `LIBRARY.so'
! `-lLIBNAME'
!      Libraries to use when linking.  See the `gcc' manual.
! 
!    You can specify more than one input file on the `gcj' command line,
! in which case they will all be compiled.  If you specify a `-o FILENAME'
  option, all the input files will be compiled together, producing a
  single output file, named FILENAME.  This is allowed even when using
! `-S' or `-c', but not when using `-C' or `--resource'.  (This is an
! extension beyond the what plain `gcc' allows.)  (If more than one input
! file is specified, all must currently be `.java' files, though we hope
  to fix this.)
  
  
--- 1319,1355 ----
  1.1 Input and output files
  ==========================
  
! A 'gcj' command is like a 'gcc' command, in that it consists of a number
! of options and file names.  The following kinds of input file names are
! supported:
  
! 'FILE.java'
       Java source files.
! 'FILE.class'
       Java bytecode files.
! 'FILE.zip'
! 'FILE.jar'
!      An archive containing one or more '.class' files, all of which are
       compiled.  The archive may be compressed.  Files in an archive
!      which don't end with '.class' are treated as resource files; they
!      are compiled into the resulting object file as 'core:' URLs.
! '@FILE'
       A file containing a whitespace-separated list of input file names.
!      (Currently, these must all be '.java' source files, but that may
       change.)  Each named file is compiled, just as if it had been on
       the command line.
+ 'LIBRARY.a'
+ 'LIBRARY.so'
+ '-lLIBNAME'
+      Libraries to use when linking.  See the 'gcc' manual.
  
!    You can specify more than one input file on the 'gcj' command line,
! in which case they will all be compiled.  If you specify a '-o FILENAME'
  option, all the input files will be compiled together, producing a
  single output file, named FILENAME.  This is allowed even when using
! '-S' or '-c', but not when using '-C' or '--resource'.  (This is an
! extension beyond the what plain 'gcc' allows.)  (If more than one input
! file is specified, all must currently be '.java' files, though we hope
  to fix this.)
  
  
*************** File: gcj.info,  Node: Input Options,  N
*** 1373,1451 ****
  1.2 Input Options
  =================
  
! `gcj' has options to control where it looks to find files it needs.
! For instance, `gcj' might need to load a class that is referenced by
! the file it has been asked to compile.  Like other compilers for the
! Java language, `gcj' has a notion of a "class path".  There are several
  options and environment variables which can be used to manipulate the
! class path.  When `gcj' looks for a given class, it searches the class
! path looking for matching `.class' or `.java' file.  `gcj' comes with a
! built-in class path which points at the installed `libgcj.jar', a file
  which contains all the standard classes.
  
     In the text below, a directory or path component can refer either to
! an actual directory on the filesystem, or to a `.zip' or `.jar' file,
! which `gcj' will search as if it is a directory.
  
! `-IDIR'
!      All directories specified by `-I' are kept in order and prepended
       to the class path constructed from all the other options.  Unless
!      compatibility with tools like `javac' is important, we recommend
!      always using `-I' instead of the other options for manipulating the
       class path.
  
! `--classpath=PATH'
       This sets the class path to PATH, a colon-separated list of paths
       (on Windows-based systems, a semicolon-separate list of paths).
       This does not override the builtin ("boot") search path.
  
! `--CLASSPATH=PATH'
!      Deprecated synonym for `--classpath'.
  
! `--bootclasspath=PATH'
       Where to find the standard builtin classes, such as
!      `java.lang.String'.
  
! `--extdirs=PATH'
       For each directory in the PATH, place the contents of that
       directory at the end of the class path.
  
! `CLASSPATH'
       This is an environment variable which holds a list of paths.
  
     The final class path is constructed like so:
  
!    * First come all directories specified via `-I'.
  
!    * If `--classpath' is specified, its value is appended.  Otherwise,
!      if the `CLASSPATH' environment variable is specified, then its
!      value is appended.  Otherwise, the current directory (`"."') is
       appended.
  
!    * If `--bootclasspath' was specified, append its value.  Otherwise,
!      append the built-in system directory, `libgcj.jar'.
  
!    * Finally, if `--extdirs' was specified, append the contents of the
       specified directories at the end of the class path.  Otherwise,
       append the contents of the built-in extdirs at
!      `$(prefix)/share/java/ext'.
  
!    The classfile built by `gcj' for the class `java.lang.Object' (and
! placed in `libgcj.jar') contains a special zero length attribute
! `gnu.gcj.gcj-compiled'. The compiler looks for this attribute when
! loading `java.lang.Object' and will report an error if it isn't found,
  unless it compiles to bytecode (the option
! `-fforce-classes-archive-check' can be used to override this behavior
! in this particular case.)
  
! `-fforce-classes-archive-check'
       This forces the compiler to always check for the special zero
!      length attribute `gnu.gcj.gcj-compiled' in `java.lang.Object' and
       issue an error if it isn't found.
  
! `-fsource=VERSION'
!      This option is used to choose the source version accepted by
!      `gcj'.  The default is `1.5'.
  
  
  File: gcj.info,  Node: Encodings,  Next: Warnings,  Prev: Input Options,  Up: Invoking gcj
--- 1358,1436 ----
  1.2 Input Options
  =================
  
! 'gcj' has options to control where it looks to find files it needs.  For
! instance, 'gcj' might need to load a class that is referenced by the
! file it has been asked to compile.  Like other compilers for the Java
! language, 'gcj' has a notion of a "class path".  There are several
  options and environment variables which can be used to manipulate the
! class path.  When 'gcj' looks for a given class, it searches the class
! path looking for matching '.class' or '.java' file.  'gcj' comes with a
! built-in class path which points at the installed 'libgcj.jar', a file
  which contains all the standard classes.
  
     In the text below, a directory or path component can refer either to
! an actual directory on the filesystem, or to a '.zip' or '.jar' file,
! which 'gcj' will search as if it is a directory.
  
! '-IDIR'
!      All directories specified by '-I' are kept in order and prepended
       to the class path constructed from all the other options.  Unless
!      compatibility with tools like 'javac' is important, we recommend
!      always using '-I' instead of the other options for manipulating the
       class path.
  
! '--classpath=PATH'
       This sets the class path to PATH, a colon-separated list of paths
       (on Windows-based systems, a semicolon-separate list of paths).
       This does not override the builtin ("boot") search path.
  
! '--CLASSPATH=PATH'
!      Deprecated synonym for '--classpath'.
  
! '--bootclasspath=PATH'
       Where to find the standard builtin classes, such as
!      'java.lang.String'.
  
! '--extdirs=PATH'
       For each directory in the PATH, place the contents of that
       directory at the end of the class path.
  
! 'CLASSPATH'
       This is an environment variable which holds a list of paths.
  
     The final class path is constructed like so:
  
!    * First come all directories specified via '-I'.
  
!    * If '--classpath' is specified, its value is appended.  Otherwise,
!      if the 'CLASSPATH' environment variable is specified, then its
!      value is appended.  Otherwise, the current directory ('"."') is
       appended.
  
!    * If '--bootclasspath' was specified, append its value.  Otherwise,
!      append the built-in system directory, 'libgcj.jar'.
  
!    * Finally, if '--extdirs' was specified, append the contents of the
       specified directories at the end of the class path.  Otherwise,
       append the contents of the built-in extdirs at
!      '$(prefix)/share/java/ext'.
  
!    The classfile built by 'gcj' for the class 'java.lang.Object' (and
! placed in 'libgcj.jar') contains a special zero length attribute
! 'gnu.gcj.gcj-compiled'.  The compiler looks for this attribute when
! loading 'java.lang.Object' and will report an error if it isn't found,
  unless it compiles to bytecode (the option
! '-fforce-classes-archive-check' can be used to override this behavior in
! this particular case.)
  
! '-fforce-classes-archive-check'
       This forces the compiler to always check for the special zero
!      length attribute 'gnu.gcj.gcj-compiled' in 'java.lang.Object' and
       issue an error if it isn't found.
  
! '-fsource=VERSION'
!      This option is used to choose the source version accepted by 'gcj'.
!      The default is '1.5'.
  
  
  File: gcj.info,  Node: Encodings,  Next: Warnings,  Prev: Input Options,  Up: Invoking gcj
*************** File: gcj.info,  Node: Encodings,  Next:
*** 1454,1476 ****
  =============
  
  The Java programming language uses Unicode throughout.  In an effort to
! integrate well with other locales, `gcj' allows `.java' files to be
! written using almost any encoding.  `gcj' knows how to convert these
  encodings into its internal encoding at compile time.
  
!    You can use the `--encoding=NAME' option to specify an encoding (of
! a particular character set) to use for source files.  If this is not
! specified, the default encoding comes from your current locale.  If
! your host system has insufficient locale support, then `gcj' assumes
! the default encoding to be the `UTF-8' encoding of Unicode.
  
!    To implement `--encoding', `gcj' simply uses the host platform's
! `iconv' conversion routine.  This means that in practice `gcj' is
  limited by the capabilities of the host platform.
  
!    The names allowed for the argument `--encoding' vary from platform
! to platform (since they are not standardized anywhere).  However, `gcj'
! implements the encoding named `UTF-8' internally, so if you choose to
  use this for your source files you can be assured that it will work on
  every host.
  
--- 1439,1461 ----
  =============
  
  The Java programming language uses Unicode throughout.  In an effort to
! integrate well with other locales, 'gcj' allows '.java' files to be
! written using almost any encoding.  'gcj' knows how to convert these
  encodings into its internal encoding at compile time.
  
!    You can use the '--encoding=NAME' option to specify an encoding (of a
! particular character set) to use for source files.  If this is not
! specified, the default encoding comes from your current locale.  If your
! host system has insufficient locale support, then 'gcj' assumes the
! default encoding to be the 'UTF-8' encoding of Unicode.
  
!    To implement '--encoding', 'gcj' simply uses the host platform's
! 'iconv' conversion routine.  This means that in practice 'gcj' is
  limited by the capabilities of the host platform.
  
!    The names allowed for the argument '--encoding' vary from platform to
! platform (since they are not standardized anywhere).  However, 'gcj'
! implements the encoding named 'UTF-8' internally, so if you choose to
  use this for your source files you can be assured that it will work on
  every host.
  
*************** File: gcj.info,  Node: Warnings,  Next:
*** 1480,1512 ****
  1.4 Warnings
  ============
  
! `gcj' implements several warnings.  As with other generic `gcc'
! warnings, if an option of the form `-Wfoo' enables a warning, then
! `-Wno-foo' will disable it.  Here we've chosen to document the form of
  the warning which will have an effect - the default being the opposite
  of what is listed.
  
! `-Wredundant-modifiers'
!      With this flag, `gcj' will warn about redundant modifiers.  For
!      instance, it will warn if an interface method is declared `public'.
  
! `-Wextraneous-semicolon'
!      This causes `gcj' to warn about empty statements.  Empty statements
       have been deprecated.
  
! `-Wno-out-of-date'
!      This option will cause `gcj' not to warn when a source file is
!      newer than its matching class file.  By default `gcj' will warn
       about this.
  
! `-Wno-deprecated'
       Warn if a deprecated class, method, or field is referred to.
  
! `-Wunused'
!      This is the same as `gcc''s `-Wunused'.
  
! `-Wall'
!      This is the same as `-Wredundant-modifiers -Wextraneous-semicolon
       -Wunused'.
  
  
--- 1465,1497 ----
  1.4 Warnings
  ============
  
! 'gcj' implements several warnings.  As with other generic 'gcc'
! warnings, if an option of the form '-Wfoo' enables a warning, then
! '-Wno-foo' will disable it.  Here we've chosen to document the form of
  the warning which will have an effect - the default being the opposite
  of what is listed.
  
! '-Wredundant-modifiers'
!      With this flag, 'gcj' will warn about redundant modifiers.  For
!      instance, it will warn if an interface method is declared 'public'.
  
! '-Wextraneous-semicolon'
!      This causes 'gcj' to warn about empty statements.  Empty statements
       have been deprecated.
  
! '-Wno-out-of-date'
!      This option will cause 'gcj' not to warn when a source file is
!      newer than its matching class file.  By default 'gcj' will warn
       about this.
  
! '-Wno-deprecated'
       Warn if a deprecated class, method, or field is referred to.
  
! '-Wunused'
!      This is the same as 'gcc''s '-Wunused'.
  
! '-Wall'
!      This is the same as '-Wredundant-modifiers -Wextraneous-semicolon
       -Wunused'.
  
  
*************** File: gcj.info,  Node: Linking,  Next: C
*** 1517,1578 ****
  
  To turn a Java application into an executable program, you need to link
  it with the needed libraries, just as for C or C++.  The linker by
! default looks for a global function named `main'.  Since Java does not
  have global functions, and a collection of Java classes may have more
! than one class with a `main' method, you need to let the linker know
! which of those `main' methods it should invoke when starting the
  application.  You can do that in any of these ways:
  
!    * Specify the class containing the desired `main' method when you
!      link the application, using the `--main' flag, described below.
! 
     * Link the Java package(s) into a shared library (dll) rather than an
!      executable.  Then invoke the application using the `gij' program,
!      making sure that `gij' can find the libraries it needs.
! 
!    * Link the Java packages(s) with the flag `-lgij', which links in
!      the `main' routine from the `gij' command.  This allows you to
!      select the class whose `main' method you want to run when you run
!      the application.  You can also use other `gij' flags, such as `-D'
!      flags to set properties.  Using the `-lgij' library (rather than
!      the `gij' program of the previous mechanism) has some advantages:
       it is compatible with static linking, and does not require
       configuring or installing libraries.
  
!    These `gij' options relate to linking an executable:
  
! `--main=CLASSNAME'
       This option is used when linking to specify the name of the class
!      whose `main' method should be invoked when the resulting
!      executable is run.
  
! `-DNAME[=VALUE]'
!      This option can only be used with `--main'.  It defines a system
       property named NAME with value VALUE.  If VALUE is not specified
       then it defaults to the empty string.  These system properties are
       initialized at the program's startup and can be retrieved at
!      runtime using the `java.lang.System.getProperty' method.
  
! `-lgij'
       Create an application whose command-line processing is that of the
!      `gij' command.
  
!      This option is an alternative to using `--main'; you cannot use
       both.
  
! `-static-libgcj'
       This option causes linking to be done against a static version of
       the libgcj runtime library.  This option is only available if
       corresponding linker support exists.
  
       *Caution:* Static linking of libgcj may cause essential parts of
       libgcj to be omitted.  Some parts of libgcj use reflection to load
!      classes at runtime.  Since the linker does not see these
!      references at link time, it can omit the referred to classes.  The
!      result is usually (but not always) a `ClassNotFoundException'
!      being thrown at runtime. Caution must be used when using this
!      option.  For more details see:
!      `http://gcc.gnu.org/wiki/Statically%20linking%20libgcj'
  
  
  File: gcj.info,  Node: Code Generation,  Next: Configure-time Options,  Prev: Linking,  Up: Invoking gcj
--- 1502,1561 ----
  
  To turn a Java application into an executable program, you need to link
  it with the needed libraries, just as for C or C++.  The linker by
! default looks for a global function named 'main'.  Since Java does not
  have global functions, and a collection of Java classes may have more
! than one class with a 'main' method, you need to let the linker know
! which of those 'main' methods it should invoke when starting the
  application.  You can do that in any of these ways:
  
!    * Specify the class containing the desired 'main' method when you
!      link the application, using the '--main' flag, described below.
     * Link the Java package(s) into a shared library (dll) rather than an
!      executable.  Then invoke the application using the 'gij' program,
!      making sure that 'gij' can find the libraries it needs.
!    * Link the Java packages(s) with the flag '-lgij', which links in the
!      'main' routine from the 'gij' command.  This allows you to select
!      the class whose 'main' method you want to run when you run the
!      application.  You can also use other 'gij' flags, such as '-D'
!      flags to set properties.  Using the '-lgij' library (rather than
!      the 'gij' program of the previous mechanism) has some advantages:
       it is compatible with static linking, and does not require
       configuring or installing libraries.
  
!    These 'gij' options relate to linking an executable:
  
! '--main=CLASSNAME'
       This option is used when linking to specify the name of the class
!      whose 'main' method should be invoked when the resulting executable
!      is run.
  
! '-DNAME[=VALUE]'
!      This option can only be used with '--main'.  It defines a system
       property named NAME with value VALUE.  If VALUE is not specified
       then it defaults to the empty string.  These system properties are
       initialized at the program's startup and can be retrieved at
!      runtime using the 'java.lang.System.getProperty' method.
  
! '-lgij'
       Create an application whose command-line processing is that of the
!      'gij' command.
  
!      This option is an alternative to using '--main'; you cannot use
       both.
  
! '-static-libgcj'
       This option causes linking to be done against a static version of
       the libgcj runtime library.  This option is only available if
       corresponding linker support exists.
  
       *Caution:* Static linking of libgcj may cause essential parts of
       libgcj to be omitted.  Some parts of libgcj use reflection to load
!      classes at runtime.  Since the linker does not see these references
!      at link time, it can omit the referred to classes.  The result is
!      usually (but not always) a 'ClassNotFoundException' being thrown at
!      runtime.  Caution must be used when using this option.  For more
!      details see:
!      <http://gcc.gnu.org/wiki/Statically%20linking%20libgcj>
  
  
  File: gcj.info,  Node: Code Generation,  Next: Configure-time Options,  Prev: Linking,  Up: Invoking gcj
*************** File: gcj.info,  Node: Code Generation,
*** 1580,1765 ****
  1.6 Code Generation
  ===================
  
! In addition to the many `gcc' options controlling code generation,
! `gcj' has several options specific to itself.
  
! `-C'
!      This option is used to tell `gcj' to generate bytecode (`.class'
       files) rather than object code.
  
! `--resource RESOURCE-NAME'
!      This option is used to tell `gcj' to compile the contents of a
!      given file to object code so it may be accessed at runtime with
!      the core protocol handler as `core:/RESOURCE-NAME'.  Note that
       RESOURCE-NAME is the name of the resource as found at runtime; for
!      instance, it could be used in a call to `ResourceBundle.getBundle'.
       The actual file name to be compiled this way must be specified
       separately.
  
! `-ftarget=VERSION'
!      This can be used with `-C' to choose the version of bytecode
!      emitted by `gcj'.  The default is `1.5'.  When not generating
       bytecode, this option has no effect.
  
! `-d DIRECTORY'
!      When used with `-C', this causes all generated `.class' files to
!      be put in the appropriate subdirectory of DIRECTORY.  By default
!      they will be put in subdirectories of the current working
!      directory.
  
! `-fno-bounds-check'
!      By default, `gcj' generates code which checks the bounds of all
       array indexing operations.  With this option, these checks are
       omitted, which can improve performance for code that uses arrays
       extensively.  Note that this can result in unpredictable behavior
       if the code in question actually does violate array bounds
       constraints.  It is safe to use this option if you are sure that
!      your code will never throw an `ArrayIndexOutOfBoundsException'.
  
! `-fno-store-check'
       Don't generate array store checks.  When storing objects into
       arrays, a runtime check is normally generated in order to ensure
!      that the object is assignment compatible with the component type
!      of the array (which may not be known at compile-time).  With this
!      option, these checks are omitted.  This can improve performance
!      for code which stores objects into arrays frequently.  It is safe
!      to use this option if you are sure your code will never throw an
!      `ArrayStoreException'.
  
! `-fjni'
!      With `gcj' there are two options for writing native methods: CNI
!      and JNI.  By default `gcj' assumes you are using CNI.  If you are
       compiling a class with native methods, and these methods are
!      implemented using JNI, then you must use `-fjni'.  This option
!      causes `gcj' to generate stubs which will invoke the underlying JNI
       methods.
  
! `-fno-assert'
!      Don't recognize the `assert' keyword.  This is for compatibility
       with older versions of the language specification.
  
! `-fno-optimize-static-class-initialization'
!      When the optimization level is greater or equal to `-O2', `gcj'
       will try to optimize the way calls into the runtime are made to
       initialize static classes upon their first use (this optimization
!      isn't carried out if `-C' was specified.) When compiling to native
!      code, `-fno-optimize-static-class-initialization' will turn this
       optimization off, regardless of the optimization level in use.
  
! `--disable-assertions[=CLASS-OR-PACKAGE]'
       Don't include code for checking assertions in the compiled code.
!      If `=CLASS-OR-PACKAGE' is missing disables assertion code
       generation for all classes, unless overridden by a more specific
!      `--enable-assertions' flag.  If CLASS-OR-PACKAGE is a class name,
!      only disables generating assertion checks within the named class
!      or its inner classes.  If CLASS-OR-PACKAGE is a package name,
!      disables generating assertion checks within the named package or a
       subpackage.
  
       By default, assertions are enabled when generating class files or
       when not optimizing, and disabled when generating optimized
       binaries.
  
! `--enable-assertions[=CLASS-OR-PACKAGE]'
       Generates code to check assertions.  The option is perhaps
       misnamed, as you still need to turn on assertion checking at
       run-time, and we don't support any easy way to do that.  So this
       flag isn't very useful yet, except to partially override
!      `--disable-assertions'.
  
! `-findirect-dispatch'
!      `gcj' has a special binary compatibility ABI, which is enabled by
!      the `-findirect-dispatch' option.  In this mode, the code
!      generated by `gcj' honors the binary compatibility guarantees in
!      the Java Language Specification, and the resulting object files do
!      not need to be directly linked against their dependencies.
!      Instead, all dependencies are looked up at runtime.  This allows
!      free mixing of interpreted and compiled code.
  
!      Note that, at present, `-findirect-dispatch' can only be used when
!      compiling `.class' files.  It will not work when compiling from
       source.  CNI also does not yet work with the binary compatibility
!      ABI.  These restrictions will be lifted in some future release.
  
       However, if you compile CNI code with the standard ABI, you can
       call it from code built with the binary compatibility ABI.
  
! `-fbootstrap-classes'
!      This option can be use to tell `libgcj' that the compiled classes
       should be loaded by the bootstrap loader, not the system class
       loader.  By default, if you compile a class and link it into an
!      executable, it will be treated as if it was loaded using the
!      system class loader.  This is convenient, as it means that things
!      like `Class.forName()' will search `CLASSPATH' to find the desired
       class.
  
! `-freduced-reflection'
!      This option causes the code generated by `gcj' to contain a
!      reduced amount of the class meta-data used to support runtime
!      reflection. The cost of this savings is the loss of the ability to
!      use certain reflection capabilities of the standard Java runtime
!      environment. When set all meta-data except for that which is
!      needed to obtain correct runtime semantics is eliminated.
  
!      For code that does not use reflection (i.e. serialization, RMI,
!      CORBA or call methods in the `java.lang.reflect' package),
!      `-freduced-reflection' will result in proper operation with a
       savings in executable code size.
  
!      JNI (`-fjni') and the binary compatibility ABI
!      (`-findirect-dispatch') do not work properly without full
!      reflection meta-data.  Because of this, it is an error to use
!      these options with `-freduced-reflection'.
  
       *Caution:* If there is no reflection meta-data, code that uses a
!      `SecurityManager' may not work properly.  Also calling
!      `Class.forName()' may fail if the calling method has no reflection
       meta-data.
  
- 
  
  File: gcj.info,  Node: Configure-time Options,  Prev: Code Generation,  Up: Invoking gcj
  
  1.7 Configure-time Options
  ==========================
  
! Some `gcj' code generations options affect the resulting ABI, and so
! can only be meaningfully given when `libgcj', the runtime package, is
! configured.  `libgcj' puts the appropriate options from this group into
! a `spec' file which is read by `gcj'.  These options are listed here
! for completeness; if you are using `libgcj' then you won't want to
! touch these options.
  
! `-fuse-boehm-gc'
       This enables the use of the Boehm GC bitmap marking code.  In
!      particular this causes `gcj' to put an object marking descriptor
       into each vtable.
  
! `-fhash-synchronization'
!      By default, synchronization data (the data used for `synchronize',
!      `wait', and `notify') is pointed to by a word in each object.
!      With this option `gcj' assumes that this information is stored in a
!      hash table and not in the object itself.
  
! `-fuse-divide-subroutine'
       On some systems, a library routine is called to perform integer
       division.  This is required to get exception handling correct when
       dividing by zero.
  
! `-fcheck-references'
       On some systems it's necessary to insert inline checks whenever
       accessing an object via a reference.  On other systems you won't
!      need this because null pointer accesses are caught automatically
!      by the processor.
  
! `-fuse-atomic-builtins'
       On some systems, GCC can generate code for built-in atomic
       operations.  Use this option to force gcj to use these builtins
       when compiling Java code.  Where this capability is present it
       should be automatically detected, so you won't usually need to use
       this option.
  
- 
  
  File: gcj.info,  Node: Compatibility,  Next: Invoking jcf-dump,  Prev: Invoking gcj,  Up: Top
  
--- 1563,1745 ----
  1.6 Code Generation
  ===================
  
! In addition to the many 'gcc' options controlling code generation, 'gcj'
! has several options specific to itself.
  
! '-C'
!      This option is used to tell 'gcj' to generate bytecode ('.class'
       files) rather than object code.
  
! '--resource RESOURCE-NAME'
!      This option is used to tell 'gcj' to compile the contents of a
!      given file to object code so it may be accessed at runtime with the
!      core protocol handler as 'core:/RESOURCE-NAME'.  Note that
       RESOURCE-NAME is the name of the resource as found at runtime; for
!      instance, it could be used in a call to 'ResourceBundle.getBundle'.
       The actual file name to be compiled this way must be specified
       separately.
  
! '-ftarget=VERSION'
!      This can be used with '-C' to choose the version of bytecode
!      emitted by 'gcj'.  The default is '1.5'.  When not generating
       bytecode, this option has no effect.
  
! '-d DIRECTORY'
!      When used with '-C', this causes all generated '.class' files to be
!      put in the appropriate subdirectory of DIRECTORY.  By default they
!      will be put in subdirectories of the current working directory.
  
! '-fno-bounds-check'
!      By default, 'gcj' generates code which checks the bounds of all
       array indexing operations.  With this option, these checks are
       omitted, which can improve performance for code that uses arrays
       extensively.  Note that this can result in unpredictable behavior
       if the code in question actually does violate array bounds
       constraints.  It is safe to use this option if you are sure that
!      your code will never throw an 'ArrayIndexOutOfBoundsException'.
  
! '-fno-store-check'
       Don't generate array store checks.  When storing objects into
       arrays, a runtime check is normally generated in order to ensure
!      that the object is assignment compatible with the component type of
!      the array (which may not be known at compile-time).  With this
!      option, these checks are omitted.  This can improve performance for
!      code which stores objects into arrays frequently.  It is safe to
!      use this option if you are sure your code will never throw an
!      'ArrayStoreException'.
  
! '-fjni'
!      With 'gcj' there are two options for writing native methods: CNI
!      and JNI.  By default 'gcj' assumes you are using CNI.  If you are
       compiling a class with native methods, and these methods are
!      implemented using JNI, then you must use '-fjni'.  This option
!      causes 'gcj' to generate stubs which will invoke the underlying JNI
       methods.
  
! '-fno-assert'
!      Don't recognize the 'assert' keyword.  This is for compatibility
       with older versions of the language specification.
  
! '-fno-optimize-static-class-initialization'
!      When the optimization level is greater or equal to '-O2', 'gcj'
       will try to optimize the way calls into the runtime are made to
       initialize static classes upon their first use (this optimization
!      isn't carried out if '-C' was specified.)  When compiling to native
!      code, '-fno-optimize-static-class-initialization' will turn this
       optimization off, regardless of the optimization level in use.
  
! '--disable-assertions[=CLASS-OR-PACKAGE]'
       Don't include code for checking assertions in the compiled code.
!      If '=CLASS-OR-PACKAGE' is missing disables assertion code
       generation for all classes, unless overridden by a more specific
!      '--enable-assertions' flag.  If CLASS-OR-PACKAGE is a class name,
!      only disables generating assertion checks within the named class or
!      its inner classes.  If CLASS-OR-PACKAGE is a package name, disables
!      generating assertion checks within the named package or a
       subpackage.
  
       By default, assertions are enabled when generating class files or
       when not optimizing, and disabled when generating optimized
       binaries.
  
! '--enable-assertions[=CLASS-OR-PACKAGE]'
       Generates code to check assertions.  The option is perhaps
       misnamed, as you still need to turn on assertion checking at
       run-time, and we don't support any easy way to do that.  So this
       flag isn't very useful yet, except to partially override
!      '--disable-assertions'.
  
! '-findirect-dispatch'
!      'gcj' has a special binary compatibility ABI, which is enabled by
!      the '-findirect-dispatch' option.  In this mode, the code generated
!      by 'gcj' honors the binary compatibility guarantees in the Java
!      Language Specification, and the resulting object files do not need
!      to be directly linked against their dependencies.  Instead, all
!      dependencies are looked up at runtime.  This allows free mixing of
!      interpreted and compiled code.
  
!      Note that, at present, '-findirect-dispatch' can only be used when
!      compiling '.class' files.  It will not work when compiling from
       source.  CNI also does not yet work with the binary compatibility
!      ABI. These restrictions will be lifted in some future release.
  
       However, if you compile CNI code with the standard ABI, you can
       call it from code built with the binary compatibility ABI.
  
! '-fbootstrap-classes'
!      This option can be use to tell 'libgcj' that the compiled classes
       should be loaded by the bootstrap loader, not the system class
       loader.  By default, if you compile a class and link it into an
!      executable, it will be treated as if it was loaded using the system
!      class loader.  This is convenient, as it means that things like
!      'Class.forName()' will search 'CLASSPATH' to find the desired
       class.
  
! '-freduced-reflection'
!      This option causes the code generated by 'gcj' to contain a reduced
!      amount of the class meta-data used to support runtime reflection.
!      The cost of this savings is the loss of the ability to use certain
!      reflection capabilities of the standard Java runtime environment.
!      When set all meta-data except for that which is needed to obtain
!      correct runtime semantics is eliminated.
  
!      For code that does not use reflection (i.e.  serialization, RMI,
!      CORBA or call methods in the 'java.lang.reflect' package),
!      '-freduced-reflection' will result in proper operation with a
       savings in executable code size.
  
!      JNI ('-fjni') and the binary compatibility ABI
!      ('-findirect-dispatch') do not work properly without full
!      reflection meta-data.  Because of this, it is an error to use these
!      options with '-freduced-reflection'.
  
       *Caution:* If there is no reflection meta-data, code that uses a
!      'SecurityManager' may not work properly.  Also calling
!      'Class.forName()' may fail if the calling method has no reflection
       meta-data.
  
  
  File: gcj.info,  Node: Configure-time Options,  Prev: Code Generation,  Up: Invoking gcj
  
  1.7 Configure-time Options
  ==========================
  
! Some 'gcj' code generations options affect the resulting ABI, and so can
! only be meaningfully given when 'libgcj', the runtime package, is
! configured.  'libgcj' puts the appropriate options from this group into
! a 'spec' file which is read by 'gcj'.  These options are listed here for
! completeness; if you are using 'libgcj' then you won't want to touch
! these options.
  
! '-fuse-boehm-gc'
       This enables the use of the Boehm GC bitmap marking code.  In
!      particular this causes 'gcj' to put an object marking descriptor
       into each vtable.
  
! '-fhash-synchronization'
!      By default, synchronization data (the data used for 'synchronize',
!      'wait', and 'notify') is pointed to by a word in each object.  With
!      this option 'gcj' assumes that this information is stored in a hash
!      table and not in the object itself.
  
! '-fuse-divide-subroutine'
       On some systems, a library routine is called to perform integer
       division.  This is required to get exception handling correct when
       dividing by zero.
  
! '-fcheck-references'
       On some systems it's necessary to insert inline checks whenever
       accessing an object via a reference.  On other systems you won't
!      need this because null pointer accesses are caught automatically by
!      the processor.
  
! '-fuse-atomic-builtins'
       On some systems, GCC can generate code for built-in atomic
       operations.  Use this option to force gcj to use these builtins
       when compiling Java code.  Where this capability is present it
       should be automatically detected, so you won't usually need to use
       this option.
  
  
  File: gcj.info,  Node: Compatibility,  Next: Invoking jcf-dump,  Prev: Invoking gcj,  Up: Top
  
*************** File: gcj.info,  Node: Compatibility,  N
*** 1767,1780 ****
  **************************************
  
  As we believe it is important that the Java platform not be fragmented,
! `gcj' and `libgcj' try to conform to the relevant Java specifications.
  However, limited manpower and incomplete and unclear documentation work
! against us.  So, there are caveats to using `gcj'.
  
  * Menu:
  
! * Limitations::
! * Extensions::
  
  
  File: gcj.info,  Node: Limitations,  Next: Extensions,  Up: Compatibility
--- 1747,1760 ----
  **************************************
  
  As we believe it is important that the Java platform not be fragmented,
! 'gcj' and 'libgcj' try to conform to the relevant Java specifications.
  However, limited manpower and incomplete and unclear documentation work
! against us.  So, there are caveats to using 'gcj'.
  
  * Menu:
  
! * Limitations::                 
! * Extensions::                  
  
  
  File: gcj.info,  Node: Limitations,  Next: Extensions,  Up: Compatibility
*************** File: gcj.info,  Node: Limitations,  Nex
*** 1784,1813 ****
  
  This list of compatibility issues is by no means complete.
  
!    * `gcj' implements the JDK 1.2 language.  It supports inner classes
!      and the new 1.4 `assert' keyword.  It does not yet support the
!      Java 2 `strictfp' keyword (it recognizes the keyword but ignores
!      it).
  
!    * `libgcj' is largely compatible with the JDK 1.2 libraries.
!      However, `libgcj' is missing many packages, most notably
!      `java.awt'.  There are also individual missing classes and methods.
       We currently do not have a list showing differences between
!      `libgcj' and the Java 2 platform.
  
!    * Sometimes the `libgcj' implementation of a method or class differs
       from the JDK implementation.  This is not always a bug.  Still, if
!      it affects you, it probably makes sense to report it so that we
!      can discuss the appropriate response.
  
!    * `gcj' does not currently allow for piecemeal replacement of
!      components within `libgcj'. Unfortunately, programmers often want
       to use newer versions of certain packages, such as those provided
       by the Apache Software Foundation's Jakarta project.  This has
!      forced us to place the `org.w3c.dom' and `org.xml.sax' packages
!      into their own libraries, separate from `libgcj'.  If you intend to
       use these classes, you must link them explicitly with
!      `-l-org-w3c-dom' and `-l-org-xml-sax'.  Future versions of `gcj'
       may not have this restriction.
  
  
--- 1764,1792 ----
  
  This list of compatibility issues is by no means complete.
  
!    * 'gcj' implements the JDK 1.2 language.  It supports inner classes
!      and the new 1.4 'assert' keyword.  It does not yet support the Java
!      2 'strictfp' keyword (it recognizes the keyword but ignores it).
  
!    * 'libgcj' is largely compatible with the JDK 1.2 libraries.
!      However, 'libgcj' is missing many packages, most notably
!      'java.awt'.  There are also individual missing classes and methods.
       We currently do not have a list showing differences between
!      'libgcj' and the Java 2 platform.
  
!    * Sometimes the 'libgcj' implementation of a method or class differs
       from the JDK implementation.  This is not always a bug.  Still, if
!      it affects you, it probably makes sense to report it so that we can
!      discuss the appropriate response.
  
!    * 'gcj' does not currently allow for piecemeal replacement of
!      components within 'libgcj'.  Unfortunately, programmers often want
       to use newer versions of certain packages, such as those provided
       by the Apache Software Foundation's Jakarta project.  This has
!      forced us to place the 'org.w3c.dom' and 'org.xml.sax' packages
!      into their own libraries, separate from 'libgcj'.  If you intend to
       use these classes, you must link them explicitly with
!      '-l-org-w3c-dom' and '-l-org-xml-sax'.  Future versions of 'gcj'
       may not have this restriction.
  
  
*************** File: gcj.info,  Node: Extensions,  Prev
*** 1816,1873 ****
  2.2 Extra features unique to gcj
  ================================
  
! The main feature of `gcj' is that it can compile programs written in
! the Java programming language to native code.  Most extensions that
! have been added are to facilitate this functionality.
  
!    * `gcj' makes it easy and efficient to mix code written in Java and
       C++.  *Note About CNI::, for more info on how to use this in your
       programs.
  
     * When you compile your classes into a shared library using
!      `-findirect-dispatch' then add them to the system-wide classmap.db
!      file using `gcj-dbtool', they will be automatically loaded by the
!      `libgcj' system classloader.  This is the new, preferred
       classname-to-library resolution mechanism.  *Note Invoking
       gcj-dbtool::, for more information on using the classmap database.
  
     * The old classname-to-library lookup mechanism is still supported
!      through the `gnu.gcj.runtime.VMClassLoader.library_control'
       property, but it is deprecated and will likely be removed in some
!      future release.  When trying to load a class `gnu.pkg.SomeClass'
       the system classloader will first try to load the shared library
!      `lib-gnu-pkg-SomeClass.so', if that fails to load the class then
!      it will try to load `lib-gnu-pkg.so' and finally when the class is
!      still not loaded it will try to load `lib-gnu.so'.  Note that all
!      `.'s will be transformed into `-'s and that searching for inner
       classes starts with their outermost outer class.  If the class
       cannot be found this way the system classloader tries to use the
!      `libgcj' bytecode interpreter to load the class from the standard
       classpath.  This process can be controlled to some degree via the
!      `gnu.gcj.runtime.VMClassLoader.library_control' property; *Note
       libgcj Runtime Properties::.
  
!    * `libgcj' includes a special `gcjlib' URL type.  A URL of this form
!      is like a `jar' URL, and looks like
!      `gcjlib:/path/to/shared/library.so!/path/to/resource'.  An access
!      to one of these URLs causes the shared library to be `dlopen()'d,
       and then the resource is looked for in that library.  These URLs
       are most useful when used in conjunction with
!      `java.net.URLClassLoader'.  Note that, due to implementation
       limitations, currently any such URL can be accessed by only one
       class loader, and libraries are never unloaded.  This means some
!      care must be exercised to make sure that a `gcjlib' URL is not
       accessed by more than one class loader at once.  In a future
       release this limitation will be lifted, and such libraries will be
       mapped privately.
  
!    * A program compiled by `gcj' will examine the `GCJ_PROPERTIES'
       environment variable and change its behavior in some ways.  In
!      particular `GCJ_PROPERTIES' holds a list of assignments to global
!      properties, such as would be set with the `-D' option to `java'.
!      For instance, `java.compiler=gcj' is a valid (but currently
!      meaningless) setting.  
! 
  
  
  File: gcj.info,  Node: Invoking jcf-dump,  Next: Invoking gij,  Prev: Compatibility,  Up: Top
--- 1795,1851 ----
  2.2 Extra features unique to gcj
  ================================
  
! The main feature of 'gcj' is that it can compile programs written in the
! Java programming language to native code.  Most extensions that have
! been added are to facilitate this functionality.
  
!    * 'gcj' makes it easy and efficient to mix code written in Java and
       C++.  *Note About CNI::, for more info on how to use this in your
       programs.
  
     * When you compile your classes into a shared library using
!      '-findirect-dispatch' then add them to the system-wide classmap.db
!      file using 'gcj-dbtool', they will be automatically loaded by the
!      'libgcj' system classloader.  This is the new, preferred
       classname-to-library resolution mechanism.  *Note Invoking
       gcj-dbtool::, for more information on using the classmap database.
  
     * The old classname-to-library lookup mechanism is still supported
!      through the 'gnu.gcj.runtime.VMClassLoader.library_control'
       property, but it is deprecated and will likely be removed in some
!      future release.  When trying to load a class 'gnu.pkg.SomeClass'
       the system classloader will first try to load the shared library
!      'lib-gnu-pkg-SomeClass.so', if that fails to load the class then it
!      will try to load 'lib-gnu-pkg.so' and finally when the class is
!      still not loaded it will try to load 'lib-gnu.so'.  Note that all
!      '.'s will be transformed into '-'s and that searching for inner
       classes starts with their outermost outer class.  If the class
       cannot be found this way the system classloader tries to use the
!      'libgcj' bytecode interpreter to load the class from the standard
       classpath.  This process can be controlled to some degree via the
!      'gnu.gcj.runtime.VMClassLoader.library_control' property; *Note
       libgcj Runtime Properties::.
  
!    * 'libgcj' includes a special 'gcjlib' URL type.  A URL of this form
!      is like a 'jar' URL, and looks like
!      'gcjlib:/path/to/shared/library.so!/path/to/resource'.  An access
!      to one of these URLs causes the shared library to be 'dlopen()'d,
       and then the resource is looked for in that library.  These URLs
       are most useful when used in conjunction with
!      'java.net.URLClassLoader'.  Note that, due to implementation
       limitations, currently any such URL can be accessed by only one
       class loader, and libraries are never unloaded.  This means some
!      care must be exercised to make sure that a 'gcjlib' URL is not
       accessed by more than one class loader at once.  In a future
       release this limitation will be lifted, and such libraries will be
       mapped privately.
  
!    * A program compiled by 'gcj' will examine the 'GCJ_PROPERTIES'
       environment variable and change its behavior in some ways.  In
!      particular 'GCJ_PROPERTIES' holds a list of assignments to global
!      properties, such as would be set with the '-D' option to 'java'.
!      For instance, 'java.compiler=gcj' is a valid (but currently
!      meaningless) setting.
  
  
  File: gcj.info,  Node: Invoking jcf-dump,  Next: Invoking gij,  Prev: Compatibility,  Up: Top
*************** File: gcj.info,  Node: Invoking jcf-dump
*** 1875,1911 ****
  3 Invoking jcf-dump
  *******************
  
! This is a class file examiner, similar to `javap'.  It will print
  information about a number of classes, which are specified by class name
  or file name.
  
! `-c'
       Disassemble method bodies.  By default method bodies are not
       printed.
  
! `--print-constants'
       Print the constant pool.  When printing a reference to a constant
       also print its index in the constant pool.
  
! `--javap'
!      Generate output in `javap' format.  The implementation of this
       feature is very incomplete.
  
! `--classpath=PATH'
! `--CLASSPATH=PATH'
! `-IDIRECTORY'
! `-o FILE'
!      These options as the same as the corresponding `gcj' options.
  
! `--help'
       Print help, then exit.
  
! `--version'
       Print version number, then exit.
  
! `-v, --verbose'
       Print extra information while running.  Implies
!      `--print-constants'.
  
  
  File: gcj.info,  Node: Invoking gij,  Next: Invoking gcj-dbtool,  Prev: Invoking jcf-dump,  Up: Top
--- 1853,1889 ----
  3 Invoking jcf-dump
  *******************
  
! This is a class file examiner, similar to 'javap'.  It will print
  information about a number of classes, which are specified by class name
  or file name.
  
! '-c'
       Disassemble method bodies.  By default method bodies are not
       printed.
  
! '--print-constants'
       Print the constant pool.  When printing a reference to a constant
       also print its index in the constant pool.
  
! '--javap'
!      Generate output in 'javap' format.  The implementation of this
       feature is very incomplete.
  
! '--classpath=PATH'
! '--CLASSPATH=PATH'
! '-IDIRECTORY'
! '-o FILE'
!      These options as the same as the corresponding 'gcj' options.
  
! '--help'
       Print help, then exit.
  
! '--version'
       Print version number, then exit.
  
! '-v, --verbose'
       Print extra information while running.  Implies
!      '--print-constants'.
  
  
  File: gcj.info,  Node: Invoking gij,  Next: Invoking gcj-dbtool,  Prev: Invoking jcf-dump,  Up: Top
*************** File: gcj.info,  Node: Invoking gij,  Ne
*** 1913,2012 ****
  4 Invoking gij
  **************
  
! `gij' is a Java bytecode interpreter included with `libgcj'.  `gij' is
  not available on every platform; porting it requires a small amount of
  assembly programming which has not been done for all the targets
! supported by `gcj'.
  
!    The primary argument to `gij' is the name of a class or, with
! `-jar', a jar file.  Options before this argument are interpreted by
! `gij'; remaining options are passed to the interpreted program.
  
!    If a class name is specified and this class does not have a `main'
! method with the appropriate signature (a `static void' method with a
! `String[]' as its sole argument), then `gij' will print an error and
  exit.
  
!    If a jar file is specified then `gij' will use information in it to
! determine which class' `main' method will be invoked.
  
!    `gij' will invoke the `main' method with all the remaining
  command-line options.
  
!    Note that `gij' is not limited to interpreting code.  Because
! `libgcj' includes a class loader which can dynamically load shared
! objects, it is possible to give `gij' the name of a class which has
! been compiled and put into a shared library on the class path.
  
! `-cp PATH'
! `-classpath PATH'
       Set the initial class path.  The class path is used for finding
       class and resource files.  If specified, this option overrides the
!      `CLASSPATH' environment variable.  Note that this option is
!      ignored if `-jar' is used.
  
! `-DNAME[=VALUE]'
       This defines a system property named NAME with value VALUE.  If
!      VALUE is not specified then it defaults to the empty string.
!      These system properties are initialized at the program's startup
!      and can be retrieved at runtime using the
!      `java.lang.System.getProperty' method.
  
! `-ms=NUMBER'
!      Equivalent to `-Xms'.
  
! `-mx=NUMBER'
!      Equivalent to `-Xmx'.
  
! `-noverify'
!      Do not verify compliance of bytecode with the VM specification. In
!      addition, this option disables type verification which is
!      otherwise performed on BC-ABI compiled code.
  
! `-X'
! `-XARGUMENT'
!      Supplying `-X' by itself will cause `gij' to list all the
!      supported `-X' options.  Currently these options are supported:
  
!     `-XmsSIZE'
            Set the initial heap size.
  
!     `-XmxSIZE'
            Set the maximum heap size.
  
!     `-XssSIZE'
            Set the thread stack size.
  
!      Unrecognized `-X' options are ignored, for compatibility with
!      other runtimes.
  
! `-jar'
!      This indicates that the name passed to `gij' should be interpreted
       as the name of a jar file, not a class.
  
! `--help'
! `-?'
       Print help, then exit.
  
! `--showversion'
       Print version number and continue.
  
! `--fullversion'
       Print detailed version information, then exit.
  
! `--version'
       Print version number, then exit.
  
! `-verbose'
! `-verbose:class'
!      Each time a class is initialized, print a short message on
!      standard error.
  
!    `gij' also recognizes and ignores the following options, for
! compatibility with existing application launch scripts: `-client',
! `-server', `-hotspot', `-jrockit', `-agentlib', `-agentpath', `-debug',
! `-d32', `-d64', `-javaagent', `-noclassgc', `-verify', and
! `-verifyremote'.
  
  
  File: gcj.info,  Node: Invoking gcj-dbtool,  Next: Invoking jv-convert,  Prev: Invoking gij,  Up: Top
--- 1891,1990 ----
  4 Invoking gij
  **************
  
! 'gij' is a Java bytecode interpreter included with 'libgcj'.  'gij' is
  not available on every platform; porting it requires a small amount of
  assembly programming which has not been done for all the targets
! supported by 'gcj'.
  
!    The primary argument to 'gij' is the name of a class or, with '-jar',
! a jar file.  Options before this argument are interpreted by 'gij';
! remaining options are passed to the interpreted program.
  
!    If a class name is specified and this class does not have a 'main'
! method with the appropriate signature (a 'static void' method with a
! 'String[]' as its sole argument), then 'gij' will print an error and
  exit.
  
!    If a jar file is specified then 'gij' will use information in it to
! determine which class' 'main' method will be invoked.
  
!    'gij' will invoke the 'main' method with all the remaining
  command-line options.
  
!    Note that 'gij' is not limited to interpreting code.  Because
! 'libgcj' includes a class loader which can dynamically load shared
! objects, it is possible to give 'gij' the name of a class which has been
! compiled and put into a shared library on the class path.
  
! '-cp PATH'
! '-classpath PATH'
       Set the initial class path.  The class path is used for finding
       class and resource files.  If specified, this option overrides the
!      'CLASSPATH' environment variable.  Note that this option is ignored
!      if '-jar' is used.
  
! '-DNAME[=VALUE]'
       This defines a system property named NAME with value VALUE.  If
!      VALUE is not specified then it defaults to the empty string.  These
!      system properties are initialized at the program's startup and can
!      be retrieved at runtime using the 'java.lang.System.getProperty'
!      method.
  
! '-ms=NUMBER'
!      Equivalent to '-Xms'.
  
! '-mx=NUMBER'
!      Equivalent to '-Xmx'.
  
! '-noverify'
!      Do not verify compliance of bytecode with the VM specification.  In
!      addition, this option disables type verification which is otherwise
!      performed on BC-ABI compiled code.
  
! '-X'
! '-XARGUMENT'
!      Supplying '-X' by itself will cause 'gij' to list all the supported
!      '-X' options.  Currently these options are supported:
  
!      '-XmsSIZE'
            Set the initial heap size.
  
!      '-XmxSIZE'
            Set the maximum heap size.
  
!      '-XssSIZE'
            Set the thread stack size.
  
!      Unrecognized '-X' options are ignored, for compatibility with other
!      runtimes.
  
! '-jar'
!      This indicates that the name passed to 'gij' should be interpreted
       as the name of a jar file, not a class.
  
! '--help'
! '-?'
       Print help, then exit.
  
! '--showversion'
       Print version number and continue.
  
! '--fullversion'
       Print detailed version information, then exit.
  
! '--version'
       Print version number, then exit.
  
! '-verbose'
! '-verbose:class'
!      Each time a class is initialized, print a short message on standard
!      error.
  
!    'gij' also recognizes and ignores the following options, for
! compatibility with existing application launch scripts: '-client',
! '-server', '-hotspot', '-jrockit', '-agentlib', '-agentpath', '-debug',
! '-d32', '-d64', '-javaagent', '-noclassgc', '-verify', and
! '-verifyremote'.
  
  
  File: gcj.info,  Node: Invoking gcj-dbtool,  Next: Invoking jv-convert,  Prev: Invoking gij,  Up: Top
*************** File: gcj.info,  Node: Invoking gcj-dbto
*** 2014,2116 ****
  5 Invoking gcj-dbtool.
  **********************
  
! `gcj-dbtool' is a tool for creating and manipulating class file mapping
! databases.  `libgcj' can use these databases to find a shared library
  corresponding to the bytecode representation of a class.  This
  functionality is useful for ahead-of-time compilation of a program that
! has no knowledge of `gcj'.
  
!    `gcj-dbtool' works best if all the jar files added to it are
! compiled using `-findirect-dispatch'.
  
!    Note that `gcj-dbtool' is currently available as "preview
  technology".  We believe it is a reasonable way to allow
  application-transparent ahead-of-time compilation, but this is an
  unexplored area.  We welcome your comments.
  
! `-n DBFILE [SIZE]'
       This creates a new database.  Currently, databases cannot be
       resized; you can choose a larger initial size if desired.  The
       default size is 32,749.
  
! `-a DBFILE JARFILE LIB'
! `-f DBFILE JARFILE LIB'
       This adds a jar file to the database.  For each class file in the
       jar, a cryptographic signature of the bytecode representation of
       the class is recorded in the database.  At runtime, a class is
       looked up by its signature and the compiled form of the class is
!      looked for in the corresponding shared library.  The `-a' option
!      will verify that LIB exists before adding it to the database; `-f'
       skips this check.
  
! `[`-'][`-0'] -m DBFILE DBFILE,[DBFILE]'
       Merge a number of databases.  The output database overwrites any
       existing database.  To add databases into an existing database,
       include the destination in the list of sources.
  
!      If `-' or `-0' are used, the list of files to read is taken from
!      standard input instead of the command line.  For `-0', Input
       filenames are terminated by a null character instead of by
       whitespace.  Useful when arguments might contain white space.  The
       GNU find -print0 option produces input suitable for this mode.
  
! `-t DBFILE'
       Test a database.
  
! `-l DBFILE'
       List the contents of a database.
  
! `-p'
       Print the name of the default database.  If there is no default
!      database, this prints a blank line.  If LIBDIR is specified, use
!      it instead of the default library directory component of the
!      database name.
  
! `--help'
       Print a help message, then exit.
  
! `--version'
! `-v'
       Print version information, then exit.
  
- 
  
  File: gcj.info,  Node: Invoking jv-convert,  Next: Invoking grmic,  Prev: Invoking gcj-dbtool,  Up: Top
  
  6 Invoking jv-convert
  *********************
  
! `jv-convert' [`OPTION'] ... [INPUTFILE [OUTPUTFILE]]
  
!    `jv-convert' is a utility included with `libgcj' which converts a
! file from one encoding to another.  It is similar to the Unix `iconv'
  utility.
  
!    The encodings supported by `jv-convert' are platform-dependent.
  Currently there is no way to get a list of all supported encodings.
  
! `--encoding NAME'
! `--from NAME'
       Use NAME as the input encoding.  The default is the current
       locale's encoding.
  
! `--to NAME'
!      Use NAME as the output encoding.  The default is the `JavaSrc'
!      encoding; this is ASCII with `\u' escapes for non-ASCII characters.
  
! `-i FILE'
       Read from FILE.  The default is to read from standard input.
  
! `-o FILE'
       Write to FILE.  The default is to write to standard output.
  
! `--reverse'
       Swap the input and output encodings.
  
! `--help'
       Print a help message, then exit.
  
! `--version'
       Print version information, then exit.
  
  
--- 1992,2093 ----
  5 Invoking gcj-dbtool.
  **********************
  
! 'gcj-dbtool' is a tool for creating and manipulating class file mapping
! databases.  'libgcj' can use these databases to find a shared library
  corresponding to the bytecode representation of a class.  This
  functionality is useful for ahead-of-time compilation of a program that
! has no knowledge of 'gcj'.
  
!    'gcj-dbtool' works best if all the jar files added to it are compiled
! using '-findirect-dispatch'.
  
!    Note that 'gcj-dbtool' is currently available as "preview
  technology".  We believe it is a reasonable way to allow
  application-transparent ahead-of-time compilation, but this is an
  unexplored area.  We welcome your comments.
  
! '-n DBFILE [SIZE]'
       This creates a new database.  Currently, databases cannot be
       resized; you can choose a larger initial size if desired.  The
       default size is 32,749.
  
! '-a DBFILE JARFILE LIB'
! '-f DBFILE JARFILE LIB'
       This adds a jar file to the database.  For each class file in the
       jar, a cryptographic signature of the bytecode representation of
       the class is recorded in the database.  At runtime, a class is
       looked up by its signature and the compiled form of the class is
!      looked for in the corresponding shared library.  The '-a' option
!      will verify that LIB exists before adding it to the database; '-f'
       skips this check.
  
! '[-][-0] -m DBFILE DBFILE,[DBFILE]'
       Merge a number of databases.  The output database overwrites any
       existing database.  To add databases into an existing database,
       include the destination in the list of sources.
  
!      If '-' or '-0' are used, the list of files to read is taken from
!      standard input instead of the command line.  For '-0', Input
       filenames are terminated by a null character instead of by
       whitespace.  Useful when arguments might contain white space.  The
       GNU find -print0 option produces input suitable for this mode.
  
! '-t DBFILE'
       Test a database.
  
! '-l DBFILE'
       List the contents of a database.
  
! '-p'
       Print the name of the default database.  If there is no default
!      database, this prints a blank line.  If LIBDIR is specified, use it
!      instead of the default library directory component of the database
!      name.
  
! '--help'
       Print a help message, then exit.
  
! '--version'
! '-v'
       Print version information, then exit.
  
  
  File: gcj.info,  Node: Invoking jv-convert,  Next: Invoking grmic,  Prev: Invoking gcj-dbtool,  Up: Top
  
  6 Invoking jv-convert
  *********************
  
! 'jv-convert' ['OPTION'] ... [INPUTFILE [OUTPUTFILE]]
  
!    'jv-convert' is a utility included with 'libgcj' which converts a
! file from one encoding to another.  It is similar to the Unix 'iconv'
  utility.
  
!    The encodings supported by 'jv-convert' are platform-dependent.
  Currently there is no way to get a list of all supported encodings.
  
! '--encoding NAME'
! '--from NAME'
       Use NAME as the input encoding.  The default is the current
       locale's encoding.
  
! '--to NAME'
!      Use NAME as the output encoding.  The default is the 'JavaSrc'
!      encoding; this is ASCII with '\u' escapes for non-ASCII characters.
  
! '-i FILE'
       Read from FILE.  The default is to read from standard input.
  
! '-o FILE'
       Write to FILE.  The default is to write to standard output.
  
! '--reverse'
       Swap the input and output encodings.
  
! '--help'
       Print a help message, then exit.
  
! '--version'
       Print version information, then exit.
  
  
*************** File: gcj.info,  Node: Invoking grmic,
*** 2119,2167 ****
  7 Invoking grmic
  ****************
  
! `grmic' [`OPTION'] ... CLASS ...
  
!    `grmic' is a utility included with `libgcj' which generates stubs
! for remote objects.
  
     Note that this program isn't yet fully compatible with the JDK
! `grmic'.  Some options, such as `-classpath', are recognized but
  currently ignored.  We have left these options undocumented for now.
  
!    Long options can also be given with a GNU-style leading `--'.  For
! instance, `--help' is accepted.
  
! `-keep'
! `-keepgenerated'
!      By default, `grmic' deletes intermediate files.  Either of these
       options causes it not to delete such files.
  
! `-v1.1'
!      Cause `grmic' to create stubs and skeletons for the 1.1 protocol
       version.
  
! `-vcompat'
!      Cause `grmic' to create stubs and skeletons compatible with both
       the 1.1 and 1.2 protocol versions.  This is the default.
  
! `-v1.2'
!      Cause `grmic' to create stubs and skeletons for the 1.2 protocol
       version.
  
! `-nocompile'
       Don't compile the generated files.
  
! `-verbose'
!      Print information about what `grmic' is doing.
  
! `-d DIRECTORY'
!      Put output files in DIRECTORY.  By default the files are put in
!      the current working directory.
  
! `-help'
       Print a help message, then exit.
  
! `-version'
       Print version information, then exit.
  
  
--- 2096,2144 ----
  7 Invoking grmic
  ****************
  
! 'grmic' ['OPTION'] ... CLASS ...
  
!    'grmic' is a utility included with 'libgcj' which generates stubs for
! remote objects.
  
     Note that this program isn't yet fully compatible with the JDK
! 'grmic'.  Some options, such as '-classpath', are recognized but
  currently ignored.  We have left these options undocumented for now.
  
!    Long options can also be given with a GNU-style leading '--'.  For
! instance, '--help' is accepted.
  
! '-keep'
! '-keepgenerated'
!      By default, 'grmic' deletes intermediate files.  Either of these
       options causes it not to delete such files.
  
! '-v1.1'
!      Cause 'grmic' to create stubs and skeletons for the 1.1 protocol
       version.
  
! '-vcompat'
!      Cause 'grmic' to create stubs and skeletons compatible with both
       the 1.1 and 1.2 protocol versions.  This is the default.
  
! '-v1.2'
!      Cause 'grmic' to create stubs and skeletons for the 1.2 protocol
       version.
  
! '-nocompile'
       Don't compile the generated files.
  
! '-verbose'
!      Print information about what 'grmic' is doing.
  
! '-d DIRECTORY'
!      Put output files in DIRECTORY.  By default the files are put in the
!      current working directory.
  
! '-help'
       Print a help message, then exit.
  
! '-version'
       Print version information, then exit.
  
  
*************** File: gcj.info,  Node: Invoking gc-analy
*** 2170,2187 ****
  8 Invoking gc-analyze
  *********************
  
! `gc-analyze' [`OPTION'] ... [FILE]
  
!    `gc-analyze' prints an analysis of a GC memory dump to standard out.
  
     The memory dumps may be created by calling
! `gnu.gcj.util.GCInfo.enumerate(String namePrefix)' from java code.  A
  memory dump will be created on an out of memory condition if
! `gnu.gcj.util.GCInfo.setOOMDump(String namePrefix)' is called before
! the out of memory occurs.
  
!    Running this program will create two files: `TestDump001' and
! `TestDump001.bytes'.
  
       import gnu.gcj.util.*;
       import java.util.*;
--- 2147,2164 ----
  8 Invoking gc-analyze
  *********************
  
! 'gc-analyze' ['OPTION'] ... [FILE]
  
!    'gc-analyze' prints an analysis of a GC memory dump to standard out.
  
     The memory dumps may be created by calling
! 'gnu.gcj.util.GCInfo.enumerate(String namePrefix)' from java code.  A
  memory dump will be created on an out of memory condition if
! 'gnu.gcj.util.GCInfo.setOOMDump(String namePrefix)' is called before the
! out of memory occurs.
  
!    Running this program will create two files: 'TestDump001' and
! 'TestDump001.bytes'.
  
       import gnu.gcj.util.*;
       import java.util.*;
*************** the out of memory occurs.
*** 2203,2223 ****
  
       gc-analyze -v TestDump001
  
! `--verbose'
! `-v'
       Verbose output.
  
! `-p TOOL-PREFIX'
!      Prefix added to the names of the `nm' and `readelf' commands.
  
! `-d DIRECTORY'
       Directory that contains the executable and shared libraries used
       when the dump was generated.
  
! `--help'
       Print a help message, then exit.
  
! `--version'
       Print version information, then exit.
  
  
--- 2180,2200 ----
  
       gc-analyze -v TestDump001
  
! '--verbose'
! '-v'
       Verbose output.
  
! '-p TOOL-PREFIX'
!      Prefix added to the names of the 'nm' and 'readelf' commands.
  
! '-d DIRECTORY'
       Directory that contains the executable and shared libraries used
       when the dump was generated.
  
! '--help'
       Print a help message, then exit.
  
! '--version'
       Print version information, then exit.
  
  
*************** File: gcj.info,  Node: Invoking aot-comp
*** 2226,2267 ****
  9 Invoking aot-compile
  **********************
  
! `aot-compile' is a script that searches a directory for Java bytecode
! (as class files, or in jars) and uses `gcj' to compile it to native
! code and generate the databases from it.
  
! `-M, --make=PATH'
!      Specify the path to the `make' executable to use.
  
! `-C, --gcj=PATH'
!      Specify the path to the `gcj' executable to use.
  
! `-D, --dbtool=PATH'
!      Specify the path to the `gcj-dbtool' executable to use.
  
! `-m, --makeflags=FLAGS'
!      Specify flags to pass to `make' during the build.
  
! `-c, --gcjflags=FLAGS'
!      Specify flags to pass to `gcj' during compilation, in addition to
       '-fPIC -findirect-dispatch -fjni'.
  
! `-l, --ldflags=FLAGS'
!      Specify flags to pass to `gcj' during linking, in addition to
       '-Wl,-Bsymbolic'.
  
! `-e, --exclude=PATH'
       Do not compile PATH.
  
- 
  
  File: gcj.info,  Node: Invoking rebuild-gcj-db,  Next: About CNI,  Prev: Invoking aot-compile,  Up: Top
  
  10 Invoking rebuild-gcj-db
  **************************
  
! `rebuild-gcj-db' is a script that merges the per-solib databases made by
! `aot-compile' into one system-wide database so `gij' can find the
  solibs.
  
  
--- 2203,2243 ----
  9 Invoking aot-compile
  **********************
  
! 'aot-compile' is a script that searches a directory for Java bytecode
! (as class files, or in jars) and uses 'gcj' to compile it to native code
! and generate the databases from it.
  
! '-M, --make=PATH'
!      Specify the path to the 'make' executable to use.
  
! '-C, --gcj=PATH'
!      Specify the path to the 'gcj' executable to use.
  
! '-D, --dbtool=PATH'
!      Specify the path to the 'gcj-dbtool' executable to use.
  
! '-m, --makeflags=FLAGS'
!      Specify flags to pass to 'make' during the build.
  
! '-c, --gcjflags=FLAGS'
!      Specify flags to pass to 'gcj' during compilation, in addition to
       '-fPIC -findirect-dispatch -fjni'.
  
! '-l, --ldflags=FLAGS'
!      Specify flags to pass to 'gcj' during linking, in addition to
       '-Wl,-Bsymbolic'.
  
! '-e, --exclude=PATH'
       Do not compile PATH.
  
  
  File: gcj.info,  Node: Invoking rebuild-gcj-db,  Next: About CNI,  Prev: Invoking aot-compile,  Up: Top
  
  10 Invoking rebuild-gcj-db
  **************************
  
! 'rebuild-gcj-db' is a script that merges the per-solib databases made by
! 'aot-compile' into one system-wide database so 'gij' can find the
  solibs.
  
  
*************** File: gcj.info,  Node: Basic concepts,
*** 2304,2312 ****
  In terms of languages features, Java is mostly a subset of C++.  Java
  has a few important extensions, plus a powerful standard class library,
  but on the whole that does not change the basic similarity.  Java is a
! hybrid object-oriented language, with a few native types, in addition
! to class types.  It is class-based, where a class may have static as
! well as per-object fields, and static as well as instance methods.
  Non-static methods may be virtual, and may be overloaded.  Overloading
  is resolved at compile time by matching the actual argument types
  against the parameter types.  Virtual methods are implemented using
--- 2280,2288 ----
  In terms of languages features, Java is mostly a subset of C++.  Java
  has a few important extensions, plus a powerful standard class library,
  but on the whole that does not change the basic similarity.  Java is a
! hybrid object-oriented language, with a few native types, in addition to
! class types.  It is class-based, where a class may have static as well
! as per-object fields, and static as well as instance methods.
  Non-static methods may be virtual, and may be overloaded.  Overloading
  is resolved at compile time by matching the actual argument types
  against the parameter types.  Virtual methods are implemented using
*************** method.  Classes are organized in a pack
*** 2316,2328 ****
  
     All of the listed attributes are also true of C++, though C++ has
  extra features (for example in C++ objects may be allocated not just on
! the heap, but also statically or in a local stack frame).  Because
! `gcj' uses the same compiler technology as G++ (the GNU C++ compiler),
! it is possible to make the intersection of the two languages use the
! same ABI (object representation and calling conventions).  The key idea
! in CNI is that Java objects are C++ objects, and all Java classes are
! C++ classes (but not the other way around).  So the most important task
! in integrating Java and C++ is to remove gratuitous incompatibilities.
  
     You write CNI code as a regular C++ source file.  (You do have to use
  a Java/CNI-aware C++ compiler, specifically a recent version of G++.)
--- 2292,2304 ----
  
     All of the listed attributes are also true of C++, though C++ has
  extra features (for example in C++ objects may be allocated not just on
! the heap, but also statically or in a local stack frame).  Because 'gcj'
! uses the same compiler technology as G++ (the GNU C++ compiler), it is
! possible to make the intersection of the two languages use the same ABI
! (object representation and calling conventions).  The key idea in CNI is
! that Java objects are C++ objects, and all Java classes are C++ classes
! (but not the other way around).  So the most important task in
! integrating Java and C++ is to remove gratuitous incompatibilities.
  
     You write CNI code as a regular C++ source file.  (You do have to use
  a Java/CNI-aware C++ compiler, specifically a recent version of G++.)
*************** and then must include one header file fo
*** 2337,2350 ****
       #include <java/util/Date.h>
       #include <java/lang/IndexOutOfBoundsException.h>
  
! These header files are automatically generated by `gcjh'.
  
     CNI provides some functions and macros to make using Java objects and
  primitive types from C++ easier.  In general, these CNI functions and
! macros start with the `Jv' prefix, for example the function
! `JvNewObjectArray'.  This convention is used to avoid conflicts with
  other libraries.  Internal functions in CNI start with the prefix
! `_Jv_'.  You should not call these; if you find a need to, let us know
  and we will try to come up with an alternate solution.
  
  11.1.1 Limitations
--- 2313,2326 ----
       #include <java/util/Date.h>
       #include <java/lang/IndexOutOfBoundsException.h>
  
! These header files are automatically generated by 'gcjh'.
  
     CNI provides some functions and macros to make using Java objects and
  primitive types from C++ easier.  In general, these CNI functions and
! macros start with the 'Jv' prefix, for example the function
! 'JvNewObjectArray'.  This convention is used to avoid conflicts with
  other libraries.  Internal functions in CNI start with the prefix
! '_Jv_'.  You should not call these; if you find a need to, let us know
  and we will try to come up with an alternate solution.
  
  11.1.1 Limitations
*************** freed from the shackles of Java, a CNI C
*** 2355,2361 ****
  rules of the Java programming language.
  
     For example: it is not possible to declare a method in a CNI class
! that will take a C string (`char*') as an argument, or to declare a
  member variable of some non-Java datatype.
  
  
--- 2331,2337 ----
  rules of the Java programming language.
  
     For example: it is not possible to declare a method in a CNI class
! that will take a C string ('char*') as an argument, or to declare a
  member variable of some non-Java datatype.
  
  
*************** sub-packages.  Every class belongs to ei
*** 2370,2379 ****
  package that has a hierarchical and globally unique name.
  
     A Java package is mapped to a C++ "namespace".  The Java class
! `java.lang.String' is in the package `java.lang', which is a
! sub-package of `java'.  The C++ equivalent is the class
! `java::lang::String', which is in the namespace `java::lang' which is
! in the namespace `java'.
  
  Here is how you could express this:
  
--- 2346,2354 ----
  package that has a hierarchical and globally unique name.
  
     A Java package is mapped to a C++ "namespace".  The Java class
! 'java.lang.String' is in the package 'java.lang', which is a sub-package
! of 'java'.  The C++ equivalent is the class 'java::lang::String', which
! is in the namespace 'java::lang' which is in the namespace 'java'.
  
  Here is how you could express this:
  
*************** Here is how you could express this:
*** 2391,2397 ****
         ...
       };
  
! The `gcjh' tool automatically generates the necessary namespace
  declarations.
  
  11.2.1 Leaving out package names
--- 2366,2372 ----
         ...
       };
  
! The 'gcjh' tool automatically generates the necessary namespace
  declarations.
  
  11.2.1 Leaving out package names
*************** declarations.
*** 2400,2419 ****
  Always using the fully-qualified name of a java class can be tiresomely
  verbose.  Using the full qualified name also ties the code to a single
  package making code changes necessary should the class move from one
! package to another.  The Java `package' declaration specifies that the
! following class declarations are in the named package, without having
! to explicitly name the full package qualifiers.  The `package'
! declaration can be followed by zero or more `import' declarations, which
! allows either a single class or all the classes in a package to be
! named by a simple identifier.  C++ provides something similar with the
! `using' declaration and directive.
  
  In Java:
  
       import PACKAGE-NAME.CLASS-NAME;
  
  allows the program text to refer to CLASS-NAME as a shorthand for the
! fully qualified name: `PACKAGE-NAME.CLASS-NAME'.
  
  To achieve the same effect C++, you have to do this:
  
--- 2375,2394 ----
  Always using the fully-qualified name of a java class can be tiresomely
  verbose.  Using the full qualified name also ties the code to a single
  package making code changes necessary should the class move from one
! package to another.  The Java 'package' declaration specifies that the
! following class declarations are in the named package, without having to
! explicitly name the full package qualifiers.  The 'package' declaration
! can be followed by zero or more 'import' declarations, which allows
! either a single class or all the classes in a package to be named by a
! simple identifier.  C++ provides something similar with the 'using'
! declaration and directive.
  
  In Java:
  
       import PACKAGE-NAME.CLASS-NAME;
  
  allows the program text to refer to CLASS-NAME as a shorthand for the
! fully qualified name: 'PACKAGE-NAME.CLASS-NAME'.
  
  To achieve the same effect C++, you have to do this:
  
*************** Java can also cause imports on demand, l
*** 2423,2430 ****
  
       import PACKAGE-NAME.*;
  
! Doing this allows any class from the package PACKAGE-NAME to be
! referred to only by its class-name within the program text.
  
  The same effect can be achieved in C++ like this:
  
--- 2398,2405 ----
  
       import PACKAGE-NAME.*;
  
! Doing this allows any class from the package PACKAGE-NAME to be referred
! to only by its class-name within the program text.
  
  The same effect can be achieved in C++ like this:
  
*************** example) so CNI provides a special C++ t
*** 2444,2477 ****
  type:
  
  *Java type*    *C/C++ typename*   *Description*
! `char'         `jchar'            16 bit Unicode character
! `boolean'      `jboolean'         logical (true or false) values
! `byte'         `jbyte'            8-bit signed integer
! `short'        `jshort'           16 bit signed integer
! `int'          `jint'             32 bit signed integer
! `long'         `jlong'            64 bit signed integer
! `float'        `jfloat'           32 bit IEEE floating point number
! `double'       `jdouble'          64 bit IEEE floating point number
! `void'         `void'             no value
  
     When referring to a Java type You should always use these C++
! typenames (e.g.: `jint') to avoid disappointment.
  
  11.3.1 Reference types associated with primitive types
  ------------------------------------------------------
  
  In Java each primitive type has an associated reference type, e.g.:
! `boolean' has an associated `java.lang.Boolean.TYPE' class.  In order
! to make working with such classes easier GCJ provides the macro
! `JvPrimClass':
  
   -- macro: JvPrimClass type
!      Return a pointer to the `Class' object corresponding to the type
       supplied.
  
            JvPrimClass(void) => java.lang.Void.TYPE
  
- 
  
  File: gcj.info,  Node: Reference types,  Next: Interfaces,  Prev: Primitive types,  Up: About CNI
  
--- 2419,2451 ----
  type:
  
  *Java type*    *C/C++ typename*   *Description*
! 'char'         'jchar'            16 bit Unicode character
! 'boolean'      'jboolean'         logical (true or false) values
! 'byte'         'jbyte'            8-bit signed integer
! 'short'        'jshort'           16 bit signed integer
! 'int'          'jint'             32 bit signed integer
! 'long'         'jlong'            64 bit signed integer
! 'float'        'jfloat'           32 bit IEEE floating point number
! 'double'       'jdouble'          64 bit IEEE floating point number
! 'void'         'void'             no value
  
     When referring to a Java type You should always use these C++
! typenames (e.g.: 'jint') to avoid disappointment.
  
  11.3.1 Reference types associated with primitive types
  ------------------------------------------------------
  
  In Java each primitive type has an associated reference type, e.g.:
! 'boolean' has an associated 'java.lang.Boolean.TYPE' class.  In order to
! make working with such classes easier GCJ provides the macro
! 'JvPrimClass':
  
   -- macro: JvPrimClass type
!      Return a pointer to the 'Class' object corresponding to the type
       supplied.
  
            JvPrimClass(void) => java.lang.Void.TYPE
  
  
  File: gcj.info,  Node: Reference types,  Next: Interfaces,  Prev: Primitive types,  Up: About CNI
  
*************** File: gcj.info,  Node: Reference types,
*** 2480,2501 ****
  
  A Java reference type is treated as a class in C++.  Classes and
  interfaces are handled this way.  A Java reference is translated to a
! C++ pointer, so for instance a Java `java.lang.String' becomes, in C++,
! `java::lang::String *'.
  
     CNI provides a few built-in typedefs for the most common classes:
  *Java type*            *C++ typename*     *Description*
! `java.lang.Object'     `jobject'          Object type
! `java.lang.String'     `jstring'          String type
! `java.lang.Class'      `jclass'           Class type
!    
!    Every Java class or interface has a corresponding `Class' instance.
! These can be accessed in CNI via the static `class$' field of a class.
! The `class$' field is of type `Class' (and not `Class *'), so you will
! typically take the address of it.  
  
!    Here is how you can refer to the class of `String', which in Java
! would be written `String.class':
  
       using namespace java::lang;
       doSomething (&String::class$);
--- 2454,2475 ----
  
  A Java reference type is treated as a class in C++.  Classes and
  interfaces are handled this way.  A Java reference is translated to a
! C++ pointer, so for instance a Java 'java.lang.String' becomes, in C++,
! 'java::lang::String *'.
  
     CNI provides a few built-in typedefs for the most common classes:
  *Java type*            *C++ typename*     *Description*
! 'java.lang.Object'     'jobject'          Object type
! 'java.lang.String'     'jstring'          String type
! 'java.lang.Class'      'jclass'           Class type
  
!    Every Java class or interface has a corresponding 'Class' instance.
! These can be accessed in CNI via the static 'class$' field of a class.
! The 'class$' field is of type 'Class' (and not 'Class *'), so you will
! typically take the address of it.
! 
!    Here is how you can refer to the class of 'String', which in Java
! would be written 'String.class':
  
       using namespace java::lang;
       doSomething (&String::class$);
*************** File: gcj.info,  Node: Interfaces,  Next
*** 2509,2522 ****
  A Java class can "implement" zero or more "interfaces", in addition to
  inheriting from a single base class.
  
!    CNI allows CNI code to implement methods of interfaces.  You can
! also call methods through interface references, with some limitations.
  
!    CNI doesn't understand interface inheritance at all yet.  So, you
! can only call an interface method when the declared type of the field
! being called matches the interface which declares that method.  The
! workaround is to cast the interface reference to the right
! superinterface.
  
     For example if you have:
  
--- 2483,2495 ----
  A Java class can "implement" zero or more "interfaces", in addition to
  inheriting from a single base class.
  
!    CNI allows CNI code to implement methods of interfaces.  You can also
! call methods through interface references, with some limitations.
  
!    CNI doesn't understand interface inheritance at all yet.  So, you can
! only call an interface method when the declared type of the field being
! called matches the interface which declares that method.  The workaround
! is to cast the interface reference to the right superinterface.
  
     For example if you have:
  
*************** superinterface.
*** 2530,2537 ****
         void b();
       }
  
!    and declare a variable of type `B' in C++, you can't call `a()'
! unless you cast it to an `A' first.
  
  
  File: gcj.info,  Node: Objects and Classes,  Next: Class Initialization,  Prev: Interfaces,  Up: About CNI
--- 2503,2510 ----
         void b();
       }
  
!    and declare a variable of type 'B' in C++, you can't call 'a()'
! unless you cast it to an 'A' first.
  
  
  File: gcj.info,  Node: Objects and Classes,  Next: Class Initialization,  Prev: Interfaces,  Up: About CNI
*************** File: gcj.info,  Node: Objects and Class
*** 2542,2554 ****
  11.6.1 Classes
  --------------
  
! All Java classes are derived from `java.lang.Object'.  C++ does not
! have a unique root class, but we use the C++ class `java::lang::Object'
! as the C++ version of the `java.lang.Object' Java class.  All other
! Java classes are mapped into corresponding C++ classes derived from
! `java::lang::Object'.
  
!    Interface inheritance (the `implements' keyword) is currently not
  reflected in the C++ mapping.
  
  11.6.2 Object fields
--- 2515,2527 ----
  11.6.1 Classes
  --------------
  
! All Java classes are derived from 'java.lang.Object'.  C++ does not have
! a unique root class, but we use the C++ class 'java::lang::Object' as
! the C++ version of the 'java.lang.Object' Java class.  All other Java
! classes are mapped into corresponding C++ classes derived from
! 'java::lang::Object'.
  
!    Interface inheritance (the 'implements' keyword) is currently not
  reflected in the C++ mapping.
  
  11.6.2 Object fields
*************** reflected in the C++ mapping.
*** 2556,2573 ****
  
  Each object contains an object header, followed by the instance fields
  of the class, in order.  The object header consists of a single pointer
! to a dispatch or virtual function table.  (There may be extra fields
! _in front of_ the object, for example for memory management, but this
! is invisible to the application, and the reference to the object points
! to the dispatch table pointer.)
  
     The fields are laid out in the same order, alignment, and size as in
! C++.  Specifically, 8-bit and 16-bit native types (`byte', `short',
! `char', and `boolean') are _not_ widened to 32 bits.  Note that the
! Java VM does extend 8-bit and 16-bit types to 32 bits when on the VM
! stack or temporary registers.
  
!    If you include the `gcjh'-generated header for a class, you can
  access fields of Java classes in the _natural_ way.  For example, given
  the following Java class:
  
--- 2529,2546 ----
  
  Each object contains an object header, followed by the instance fields
  of the class, in order.  The object header consists of a single pointer
! to a dispatch or virtual function table.  (There may be extra fields _in
! front of_ the object, for example for memory management, but this is
! invisible to the application, and the reference to the object points to
! the dispatch table pointer.)
  
     The fields are laid out in the same order, alignment, and size as in
! C++.  Specifically, 8-bit and 16-bit native types ('byte', 'short',
! 'char', and 'boolean') are _not_ widened to 32 bits.  Note that the Java
! VM does extend 8-bit and 16-bit types to 32 bits when on the VM stack or
! temporary registers.
  
!    If you include the 'gcjh'-generated header for a class, you can
  access fields of Java classes in the _natural_ way.  For example, given
  the following Java class:
  
*************** the following Java class:
*** 2595,2603 ****
  ------------------------
  
  CNI does not strictly enforce the Java access specifiers, because Java
! permissions cannot be directly mapped into C++ permission.  Private
! Java fields and methods are mapped to private C++ fields and methods,
! but other fields and methods are mapped to public fields and methods.
  
  
  File: gcj.info,  Node: Class Initialization,  Next: Object allocation,  Prev: Objects and Classes,  Up: About CNI
--- 2568,2576 ----
  ------------------------
  
  CNI does not strictly enforce the Java access specifiers, because Java
! permissions cannot be directly mapped into C++ permission.  Private Java
! fields and methods are mapped to private C++ fields and methods, but
! other fields and methods are mapped to public fields and methods.
  
  
  File: gcj.info,  Node: Class Initialization,  Next: Object allocation,  Prev: Objects and Classes,  Up: About CNI
*************** File: gcj.info,  Node: Class Initializat
*** 2606,2649 ****
  =========================
  
  Java requires that each class be automatically initialized at the time
! of the first active use.  Initializing a class involves initializing
! the static fields, running code in class initializer methods, and
  initializing base classes.  There may also be some implementation
! specific actions, such as allocating `String' objects corresponding to
  string literals in the code.
  
!    The GCJ compiler inserts calls to `JvInitClass' at appropriate
! places to ensure that a class is initialized when required.  The C++
! compiler does not insert these calls automatically--it is the
! programmer's responsibility to make sure classes are initialized.
! However, this is fairly painless because of the conventions assumed by
! the Java system.
  
!    First, `libgcj' will make sure a class is initialized before an
! instance of that object is created.  This is one of the
! responsibilities of the `new' operation.  This is taken care of both in
! Java code, and in C++ code.  When G++ sees a `new' of a Java class, it
! will call a routine in `libgcj' to allocate the object, and that
! routine will take care of initializing the class.  Note however that
! this does not happen for Java arrays; you must allocate those using the
! appropriate CNI function.  It follows that you can access an instance
! field, or call an instance (non-static) method and be safe in the
! knowledge that the class and all of its base classes have been
! initialized.
  
     Invoking a static method is also safe.  This is because the Java
  compiler adds code to the start of a static method to make sure the
! class is initialized.  However, the C++ compiler does not add this
! extra code.  Hence, if you write a native static method using CNI, you
! are responsible for calling `JvInitClass' before doing anything else in
! the method (unless you are sure it is safe to leave it out).
  
     Accessing a static field also requires the class of the field to be
! initialized.  The Java compiler will generate code to call
! `JvInitClass' before getting or setting the field.  However, the C++
! compiler will not generate this extra code, so it is your
! responsibility to make sure the class is initialized before you access
! a static field from C++.
  
  
  File: gcj.info,  Node: Object allocation,  Next: Memory allocation,  Prev: Class Initialization,  Up: About CNI
--- 2579,2619 ----
  =========================
  
  Java requires that each class be automatically initialized at the time
! of the first active use.  Initializing a class involves initializing the
! static fields, running code in class initializer methods, and
  initializing base classes.  There may also be some implementation
! specific actions, such as allocating 'String' objects corresponding to
  string literals in the code.
  
!    The GCJ compiler inserts calls to 'JvInitClass' at appropriate places
! to ensure that a class is initialized when required.  The C++ compiler
! does not insert these calls automatically--it is the programmer's
! responsibility to make sure classes are initialized.  However, this is
! fairly painless because of the conventions assumed by the Java system.
  
!    First, 'libgcj' will make sure a class is initialized before an
! instance of that object is created.  This is one of the responsibilities
! of the 'new' operation.  This is taken care of both in Java code, and in
! C++ code.  When G++ sees a 'new' of a Java class, it will call a routine
! in 'libgcj' to allocate the object, and that routine will take care of
! initializing the class.  Note however that this does not happen for Java
! arrays; you must allocate those using the appropriate CNI function.  It
! follows that you can access an instance field, or call an instance
! (non-static) method and be safe in the knowledge that the class and all
! of its base classes have been initialized.
  
     Invoking a static method is also safe.  This is because the Java
  compiler adds code to the start of a static method to make sure the
! class is initialized.  However, the C++ compiler does not add this extra
! code.  Hence, if you write a native static method using CNI, you are
! responsible for calling 'JvInitClass' before doing anything else in the
! method (unless you are sure it is safe to leave it out).
  
     Accessing a static field also requires the class of the field to be
! initialized.  The Java compiler will generate code to call 'JvInitClass'
! before getting or setting the field.  However, the C++ compiler will not
! generate this extra code, so it is your responsibility to make sure the
! class is initialized before you access a static field from C++.
  
  
  File: gcj.info,  Node: Object allocation,  Next: Memory allocation,  Prev: Class Initialization,  Up: About CNI
*************** expression", e.g.:
*** 2660,2668 ****
  objects have to be explicitly deleted; in Java they are automatically
  deleted by the garbage collector.  Using CNI, you can allocate a new
  Java object using standard C++ syntax and the C++ compiler will allocate
! memory from the garbage collector.  If you have overloaded
! constructors, the compiler will choose the correct one using standard
! C++ overload resolution rules.
  
  For example:
  
--- 2630,2638 ----
  objects have to be explicitly deleted; in Java they are automatically
  deleted by the garbage collector.  Using CNI, you can allocate a new
  Java object using standard C++ syntax and the C++ compiler will allocate
! memory from the garbage collector.  If you have overloaded constructors,
! the compiler will choose the correct one using standard C++ overload
! resolution rules.
  
  For example:
  
*************** File: gcj.info,  Node: Memory allocation
*** 2674,2690 ****
  11.9 Memory allocation
  ======================
  
! When allocating memory in CNI methods it is best to handle
! out-of-memory conditions by throwing a Java exception.  These functions
! are provided for that purpose:
  
   -- Function: void* JvMalloc (jsize SIZE)
!      Calls malloc.  Throws `java.lang.OutOfMemoryError' if allocation
       fails.
  
   -- Function: void* JvRealloc (void* PTR, jsize SIZE)
!      Calls realloc.  Throws `java.lang.OutOfMemoryError' if
!      reallocation fails.
  
   -- Function: void JvFree (void* PTR)
       Calls free.
--- 2644,2660 ----
  11.9 Memory allocation
  ======================
  
! When allocating memory in CNI methods it is best to handle out-of-memory
! conditions by throwing a Java exception.  These functions are provided
! for that purpose:
  
   -- Function: void* JvMalloc (jsize SIZE)
!      Calls malloc.  Throws 'java.lang.OutOfMemoryError' if allocation
       fails.
  
   -- Function: void* JvRealloc (void* PTR, jsize SIZE)
!      Calls realloc.  Throws 'java.lang.OutOfMemoryError' if reallocation
!      fails.
  
   -- Function: void JvFree (void* PTR)
       Calls free.
*************** While in many ways Java is similar to C
*** 2699,2708 ****
  in its treatment of arrays.  C arrays are based on the idea of pointer
  arithmetic, which would be incompatible with Java's security
  requirements.  Java arrays are true objects (array types inherit from
! `java.lang.Object').  An array-valued variable is one that contains a
  reference (pointer) to an array object.
  
!    Referencing a Java array in C++ code is done using the `JArray'
  template, which as defined as follows:
  
       class __JArray : public java::lang::Object
--- 2669,2678 ----
  in its treatment of arrays.  C arrays are based on the idea of pointer
  arithmetic, which would be incompatible with Java's security
  requirements.  Java arrays are true objects (array types inherit from
! 'java.lang.Object').  An array-valued variable is one that contains a
  reference (pointer) to an array object.
  
!    Referencing a Java array in C++ code is done using the 'JArray'
  template, which as defined as follows:
  
       class __JArray : public java::lang::Object
*************** template, which as defined as follows:
*** 2719,2725 ****
         T& operator[](jint i) { return data[i]; }
       };
  
!    There are a number of `typedef's which correspond to `typedef's from
  the JNI.  Each is the type of an array holding objects of the relevant
  type:
  
--- 2689,2695 ----
         T& operator[](jint i) { return data[i]; }
       };
  
!    There are a number of 'typedef's which correspond to 'typedef's from
  the JNI.  Each is the type of an array holding objects of the relevant
  type:
  
*************** type:
*** 2735,2753 ****
       typedef JArray<jdouble> *jdoubleArray;
  
   -- Method on template<class T>: T* elements (JArray<T> ARRAY)
!      This template function can be used to get a pointer to the
!      elements of the `array'.  For instance, you can fetch a pointer to
!      the integers that make up an `int[]' like so:
  
            extern jintArray foo;
            jint *intp = elements (foo);
  
       The name of this function may change in the future.
  
!  -- Function: jobjectArray JvNewObjectArray (jsize LENGTH, jclass
!           KLASS, jobject INIT)
       This creates a new array whose elements have reference type.
!      `klass' is the type of elements of the array and `init' is the
       initial value put into every slot in the array.
  
       using namespace java::lang;
--- 2705,2723 ----
       typedef JArray<jdouble> *jdoubleArray;
  
   -- Method on template<class T>: T* elements (JArray<T> ARRAY)
!      This template function can be used to get a pointer to the elements
!      of the 'array'.  For instance, you can fetch a pointer to the
!      integers that make up an 'int[]' like so:
  
            extern jintArray foo;
            jint *intp = elements (foo);
  
       The name of this function may change in the future.
  
!  -- Function: jobjectArray JvNewObjectArray (jsize LENGTH, jclass KLASS,
!           jobject INIT)
       This creates a new array whose elements have reference type.
!      'klass' is the type of elements of the array and 'init' is the
       initial value put into every slot in the array.
  
       using namespace java::lang;
*************** File: gcj.info,  Node: Methods,  Next: S
*** 2784,2793 ****
  =============
  
  Java methods are mapped directly into C++ methods.  The header files
! generated by `gcjh' include the appropriate method definitions.
! Basically, the generated methods have the same names and
! _corresponding_ types as the Java methods, and are called in the
! natural manner.
  
  11.11.1 Overloading
  -------------------
--- 2754,2762 ----
  =============
  
  Java methods are mapped directly into C++ methods.  The header files
! generated by 'gcjh' include the appropriate method definitions.
! Basically, the generated methods have the same names and _corresponding_
! types as the Java methods, and are called in the natural manner.
  
  11.11.1 Overloading
  -------------------
*************** Both Java and C++ provide method overloa
*** 2796,2807 ****
  a class have the same name, and the correct one is chosen (at compile
  time) depending on the argument types.  The rules for choosing the
  correct method are (as expected) more complicated in C++ than in Java,
! but given a set of overloaded methods generated by `gcjh' the C++
  compiler will choose the expected one.
  
     Common assemblers and linkers are not aware of C++ overloading, so
! the standard implementation strategy is to encode the parameter types
! of a method into its assembly-level name.  This encoding is called
  "mangling", and the encoded name is the "mangled name".  The same
  mechanism is used to implement Java overloading.  For C++/Java
  interoperability, it is important that both the Java and C++ compilers
--- 2765,2776 ----
  a class have the same name, and the correct one is chosen (at compile
  time) depending on the argument types.  The rules for choosing the
  correct method are (as expected) more complicated in C++ than in Java,
! but given a set of overloaded methods generated by 'gcjh' the C++
  compiler will choose the expected one.
  
     Common assemblers and linkers are not aware of C++ overloading, so
! the standard implementation strategy is to encode the parameter types of
! a method into its assembly-level name.  This encoding is called
  "mangling", and the encoded name is the "mangled name".  The same
  mechanism is used to implement Java overloading.  For C++/Java
  interoperability, it is important that both the Java and C++ compilers
*************** use the _same_ encoding scheme.
*** 2811,2817 ****
  ----------------------
  
  Static Java methods are invoked in CNI using the standard C++ syntax,
! using the `::' operator rather than the `.' operator.
  
  For example:
  
--- 2780,2786 ----
  ----------------------
  
  Static Java methods are invoked in CNI using the standard C++ syntax,
! using the '::' operator rather than the '.' operator.
  
  For example:
  
*************** For example:
*** 2831,2845 ****
  ---------------------------
  
  Constructors are called implicitly as part of object allocation using
! the `new' operator.
  
  For example:
  
       java::lang::Integer *x = new java::lang::Integer(234);
  
     Java does not allow a constructor to be a native method.  This
! limitation can be coded round however because a constructor can _call_
! a native method.
  
  11.11.4 Instance methods
  ------------------------
--- 2800,2814 ----
  ---------------------------
  
  Constructors are called implicitly as part of object allocation using
! the 'new' operator.
  
  For example:
  
       java::lang::Integer *x = new java::lang::Integer(234);
  
     Java does not allow a constructor to be a native method.  This
! limitation can be coded round however because a constructor can _call_ a
! native method.
  
  11.11.4 Instance methods
  ------------------------
*************** File: gcj.info,  Node: Strings,  Next: M
*** 2877,2911 ****
  =============
  
  CNI provides a number of utility functions for working with Java Java
! `String' objects.  The names and interfaces are analogous to those of
  JNI.
  
   -- Function: jstring JvNewString (const jchar* CHARS, jsize LEN)
!      Returns a Java `String' object with characters from the array of
       Unicode characters CHARS up to the index LEN in that array.
  
   -- Function: jstring JvNewStringLatin1 (const char* BYTES, jsize LEN)
!      Returns a Java `String' made up of LEN bytes from BYTES.
  
   -- Function: jstring JvNewStringLatin1 (const char* BYTES)
!      As above but the length of the `String' is `strlen(BYTES)'.
  
   -- Function: jstring JvNewStringUTF (const char* BYTES)
!      Returns a `String' which is made up of the UTF encoded characters
       present in the C string BYTES.
  
   -- Function: jchar* JvGetStringChars (jstring STR)
!      Returns a pointer to an array of characters making up the `String'
       STR.
  
   -- Function: int JvGetStringUTFLength (jstring STR)
       Returns the number of bytes required to encode the contents of the
!      `String' STR in UTF-8.
  
   -- Function: jsize JvGetStringUTFRegion (jstring STR, jsize START,
            jsize LEN, char* BUF)
!      Puts the UTF-8 encoding of a region of the `String' STR into the
!      buffer `buf'.  The region to fetch is marked by START and LEN.
  
       Note that BUF is a buffer, not a C string.  It is _not_ null
       terminated.
--- 2846,2880 ----
  =============
  
  CNI provides a number of utility functions for working with Java Java
! 'String' objects.  The names and interfaces are analogous to those of
  JNI.
  
   -- Function: jstring JvNewString (const jchar* CHARS, jsize LEN)
!      Returns a Java 'String' object with characters from the array of
       Unicode characters CHARS up to the index LEN in that array.
  
   -- Function: jstring JvNewStringLatin1 (const char* BYTES, jsize LEN)
!      Returns a Java 'String' made up of LEN bytes from BYTES.
  
   -- Function: jstring JvNewStringLatin1 (const char* BYTES)
!      As above but the length of the 'String' is 'strlen(BYTES)'.
  
   -- Function: jstring JvNewStringUTF (const char* BYTES)
!      Returns a 'String' which is made up of the UTF encoded characters
       present in the C string BYTES.
  
   -- Function: jchar* JvGetStringChars (jstring STR)
!      Returns a pointer to an array of characters making up the 'String'
       STR.
  
   -- Function: int JvGetStringUTFLength (jstring STR)
       Returns the number of bytes required to encode the contents of the
!      'String' STR in UTF-8.
  
   -- Function: jsize JvGetStringUTFRegion (jstring STR, jsize START,
            jsize LEN, char* BUF)
!      Puts the UTF-8 encoding of a region of the 'String' STR into the
!      buffer 'buf'.  The region to fetch is marked by START and LEN.
  
       Note that BUF is a buffer, not a C string.  It is _not_ null
       terminated.
*************** None of the following is possible with C
*** 2938,2944 ****
         .
         .
         .
!      }   // `uint' is not a valid Java type, neither is `char*'
  
  Of course, it is ok to use C/C++ types within the scope of a method:
  
--- 2907,2913 ----
         .
         .
         .
!      }   // 'uint' is not a valid Java type, neither is 'char*'
  
  Of course, it is ok to use C/C++ types within the scope of a method:
  
*************** Of course, it is ok to use C/C++ types w
*** 2955,2962 ****
  ---------------
  
  The above restriction can be problematic, so CNI includes the
! `gnu.gcj.RawData' class.  The `RawData' class is a "non-scanned
! reference" type.  In other words variables declared of type `RawData'
  can contain any data and are not checked by the compiler or memory
  manager in any way.
  
--- 2924,2931 ----
  ---------------
  
  The above restriction can be problematic, so CNI includes the
! 'gnu.gcj.RawData' class.  The 'RawData' class is a "non-scanned
! reference" type.  In other words variables declared of type 'RawData'
  can contain any data and are not checked by the compiler or memory
  manager in any way.
  
*************** Here are some examples:
*** 2996,3008 ****
  11.13.2 RawDataManaged
  ----------------------
  
! `gnu.gcj.RawDataManaged' is another type used to indicate special data
! used by native code. Unlike the `RawData' type, fields declared as
! `RawDataManaged' will be "marked" by the memory manager and considered
  for garbage collection.
  
!    Native data which is allocated using CNI's `JvAllocBytes()' function
! and stored in a `RawDataManaged' will be automatically freed when the
  Java object it is associated with becomes unreachable.
  
  11.13.3 Native memory allocation
--- 2965,2977 ----
  11.13.2 RawDataManaged
  ----------------------
  
! 'gnu.gcj.RawDataManaged' is another type used to indicate special data
! used by native code.  Unlike the 'RawData' type, fields declared as
! 'RawDataManaged' will be "marked" by the memory manager and considered
  for garbage collection.
  
!    Native data which is allocated using CNI's 'JvAllocBytes()' function
! and stored in a 'RawDataManaged' will be automatically freed when the
  Java object it is associated with becomes unreachable.
  
  11.13.3 Native memory allocation
*************** Java object it is associated with become
*** 3014,3035 ****
       but will be freed if no references to it are discovered.
  
       This function can be useful if you need to associate some native
!      data with a Java object. Using a CNI's special `RawDataManaged'
!      type, native data allocated with `JvAllocBytes' will be
       automatically freed when the Java object itself becomes
       unreachable.
  
  11.13.4 Posix signals
  ---------------------
  
! On Posix based systems the `libgcj' library uses several signals
  internally.  CNI code should not attempt to use the same signals as
! doing so may cause `libgcj' and/or the CNI code to fail.
  
!    SIGSEGV is used on many systems to generate `NullPointerExceptions'.
! SIGCHLD is used internally by `Runtime.exec()'.  Several other signals
  (that vary from platform to platform) can be used by the memory manager
! and by `Thread.interrupt()'.
  
  
  File: gcj.info,  Node: Exception Handling,  Next: Synchronization,  Prev: Mixing with C++,  Up: About CNI
--- 2983,3004 ----
       but will be freed if no references to it are discovered.
  
       This function can be useful if you need to associate some native
!      data with a Java object.  Using a CNI's special 'RawDataManaged'
!      type, native data allocated with 'JvAllocBytes' will be
       automatically freed when the Java object itself becomes
       unreachable.
  
  11.13.4 Posix signals
  ---------------------
  
! On Posix based systems the 'libgcj' library uses several signals
  internally.  CNI code should not attempt to use the same signals as
! doing so may cause 'libgcj' and/or the CNI code to fail.
  
!    SIGSEGV is used on many systems to generate 'NullPointerExceptions'.
! SIGCHLD is used internally by 'Runtime.exec()'.  Several other signals
  (that vary from platform to platform) can be used by the memory manager
! and by 'Thread.interrupt()'.
  
  
  File: gcj.info,  Node: Exception Handling,  Next: Synchronization,  Prev: Mixing with C++,  Up: About CNI
*************** are not yet perfectly integrated.  The m
*** 3042,3061 ****
  type information facilities of the two languages are not integrated.
  
     Still, things work fairly well.  You can throw a Java exception from
! C++ using the ordinary `throw' construct, and this exception can be
  caught by Java code.  Similarly, you can catch an exception thrown from
! Java using the C++ `catch' construct.
  
  Here is an example:
  
       if (i >= count)
          throw new java::lang::IndexOutOfBoundsException();
  
!    Normally, G++ will automatically detect when you are writing C++
! code that uses Java exceptions, and handle them appropriately.
! However, if C++ code only needs to execute destructors when Java
! exceptions are thrown through it, GCC will guess incorrectly.  Sample
! problematic code:
  
       struct S { ~S(); };
  
--- 3011,3029 ----
  type information facilities of the two languages are not integrated.
  
     Still, things work fairly well.  You can throw a Java exception from
! C++ using the ordinary 'throw' construct, and this exception can be
  caught by Java code.  Similarly, you can catch an exception thrown from
! Java using the C++ 'catch' construct.
  
  Here is an example:
  
       if (i >= count)
          throw new java::lang::IndexOutOfBoundsException();
  
!    Normally, G++ will automatically detect when you are writing C++ code
! that uses Java exceptions, and handle them appropriately.  However, if
! C++ code only needs to execute destructors when Java exceptions are
! thrown through it, GCC will guess incorrectly.  Sample problematic code:
  
       struct S { ~S(); };
  
*************** problematic code:
*** 3067,3078 ****
         bar();
       }
  
!    The usual effect of an incorrect guess is a link failure,
! complaining of a missing routine called `__gxx_personality_v0'.
  
     You can inform the compiler that Java exceptions are to be used in a
  translation unit, irrespective of what it might think, by writing
! `#pragma GCC java_exceptions' at the head of the file.  This `#pragma'
  must appear before any functions that throw or catch exceptions, or run
  destructors when exceptions are thrown through them.
  
--- 3035,3046 ----
         bar();
       }
  
!    The usual effect of an incorrect guess is a link failure, complaining
! of a missing routine called '__gxx_personality_v0'.
  
     You can inform the compiler that Java exceptions are to be used in a
  translation unit, irrespective of what it might think, by writing
! '#pragma GCC java_exceptions' at the head of the file.  This '#pragma'
  must appear before any functions that throw or catch exceptions, or run
  destructors when exceptions are thrown through them.
  
*************** File: gcj.info,  Node: Synchronization,
*** 3083,3101 ****
  =====================
  
  Each Java object has an implicit monitor.  The Java VM uses the
! instruction `monitorenter' to acquire and lock a monitor, and
! `monitorexit' to release it.
  
!    The corresponding CNI macros are `JvMonitorEnter' and
! `JvMonitorExit' (JNI has similar  methods `MonitorEnter' and
! `MonitorExit').
  
     The Java source language does not provide direct access to these
! primitives.  Instead, there is a `synchronized' statement that does an
! implicit `monitorenter' before entry to the block, and does a
! `monitorexit' on exit from the block.  Note that the lock has to be
  released even when the block is abnormally terminated by an exception,
! which means there is an implicit `try finally' surrounding
  synchronization locks.
  
     From C++, it makes sense to use a destructor to release a lock.  CNI
--- 3051,3068 ----
  =====================
  
  Each Java object has an implicit monitor.  The Java VM uses the
! instruction 'monitorenter' to acquire and lock a monitor, and
! 'monitorexit' to release it.
  
!    The corresponding CNI macros are 'JvMonitorEnter' and 'JvMonitorExit'
! (JNI has similar methods 'MonitorEnter' and 'MonitorExit').
  
     The Java source language does not provide direct access to these
! primitives.  Instead, there is a 'synchronized' statement that does an
! implicit 'monitorenter' before entry to the block, and does a
! 'monitorexit' on exit from the block.  Note that the lock has to be
  released even when the block is abnormally terminated by an exception,
! which means there is an implicit 'try finally' surrounding
  synchronization locks.
  
     From C++, it makes sense to use a destructor to release a lock.  CNI
*************** might become this C++ code:
*** 3121,3136 ****
          CODE;
       }
  
!    Java also has methods with the `synchronized' attribute.  This is
! equivalent to wrapping the entire method body in a `synchronized'
  statement.  (Alternatively, an implementation could require the caller
  to do the synchronization.  This is not practical for a compiler,
  because each virtual method call would have to test at run-time if
! synchronization is needed.)  Since in `gcj' the `synchronized'
! attribute is handled by the method implementation, it is up to the
! programmer of a synchronized native method to handle the synchronization
! (in the C++ implementation of the method).  In other words, you need to
! manually add `JvSynchronize' in a `native synchronized' method.
  
  
  File: gcj.info,  Node: Invocation,  Next: Reflection,  Prev: Synchronization,  Up: About CNI
--- 3088,3103 ----
          CODE;
       }
  
!    Java also has methods with the 'synchronized' attribute.  This is
! equivalent to wrapping the entire method body in a 'synchronized'
  statement.  (Alternatively, an implementation could require the caller
  to do the synchronization.  This is not practical for a compiler,
  because each virtual method call would have to test at run-time if
! synchronization is needed.)  Since in 'gcj' the 'synchronized' attribute
! is handled by the method implementation, it is up to the programmer of a
! synchronized native method to handle the synchronization (in the C++
! implementation of the method).  In other words, you need to manually add
! 'JvSynchronize' in a 'native synchronized' method.
  
  
  File: gcj.info,  Node: Invocation,  Next: Reflection,  Prev: Synchronization,  Up: About CNI
*************** File: gcj.info,  Node: Invocation,  Next
*** 3139,3160 ****
  ================
  
  CNI permits C++ applications to make calls into Java classes, in
! addition to allowing Java code to call into C++. Several functions,
  known as the "invocation API", are provided to support this.
  
   -- Function: jint JvCreateJavaVM (JvVMInitArgs* VM_ARGS)
!      Initializes the Java runtime. This function performs essential
       initialization of the threads interface, garbage collector,
!      exception handling and other key aspects of the runtime. It must
!      be called once by an application with a non-Java `main()'
!      function, before any other Java or CNI calls are made.  It is
!      safe, but not recommended, to call `JvCreateJavaVM()' more than
!      once provided it is only called from a single thread.  The VMARGS
!      parameter can be used to specify initialization parameters for the
!      Java runtime. It may be `NULL'.
  
       JvVMInitArgs represents a list of virtual machine initialization
!      arguments. `JvCreateJavaVM()' ignores the version field.
  
            typedef struct JvVMOption
            {
--- 3106,3128 ----
  ================
  
  CNI permits C++ applications to make calls into Java classes, in
! addition to allowing Java code to call into C++.  Several functions,
  known as the "invocation API", are provided to support this.
  
   -- Function: jint JvCreateJavaVM (JvVMInitArgs* VM_ARGS)
! 
!      Initializes the Java runtime.  This function performs essential
       initialization of the threads interface, garbage collector,
!      exception handling and other key aspects of the runtime.  It must
!      be called once by an application with a non-Java 'main()' function,
!      before any other Java or CNI calls are made.  It is safe, but not
!      recommended, to call 'JvCreateJavaVM()' more than once provided it
!      is only called from a single thread.  The VMARGS parameter can be
!      used to specify initialization parameters for the Java runtime.  It
!      may be 'NULL'.
  
       JvVMInitArgs represents a list of virtual machine initialization
!      arguments.  'JvCreateJavaVM()' ignores the version field.
  
            typedef struct JvVMOption
            {
*************** known as the "invocation API", are provi
*** 3179,3218 ****
              jboolean ignoreUnrecognized;
            } JvVMInitArgs;
  
!      `JvCreateJavaVM()' returns `0' upon success, or `-1' if the
!      runtime is already initialized.
  
!      _Note:_ In GCJ 3.1, the `vm_args' parameter is ignored. It is
       recognized and used as of release 4.0.
  
   -- Function: java::lang::Thread* JvAttachCurrentThread (jstring NAME,
            java::lang::ThreadGroup* GROUP)
       Registers an existing thread with the Java runtime.  This must be
       called once from each thread, before that thread makes any other
!      Java or CNI calls. It must be called after `JvCreateJavaVM'.  NAME
!      specifies a name for the thread. It may be `NULL', in which case a
       name will be generated.  GROUP is the ThreadGroup in which this
!      thread will be a member. If it is `NULL', the thread will be a
       member of the main thread group.  The return value is the Java
!      `Thread' object that represents the thread.  It is safe to call
!      `JvAttachCurrentThread()' more than once from the same thread. If
       the thread is already attached, the call is ignored and the current
       thread object is returned.
  
   -- Function: jint JvDetachCurrentThread ()
!      Unregisters a thread from the Java runtime. This should be called
!      by threads that were attached using `JvAttachCurrentThread()',
!      after they have finished making calls to Java code. This ensures
       that any resources associated with the thread become eligible for
!      garbage collection.  This function returns `0' upon success, or
!      `-1' if the current thread is not attached.
  
  11.16.1 Handling uncaught exceptions
  ------------------------------------
  
  If an exception is thrown from Java code called using the invocation
  API, and no handler for the exception can be found, the runtime will
! abort the application. In order to make the application more robust, it
  is recommended that code which uses the invocation API be wrapped by a
  top-level try/catch block that catches all Java exceptions.
  
--- 3147,3186 ----
              jboolean ignoreUnrecognized;
            } JvVMInitArgs;
  
!      'JvCreateJavaVM()' returns '0' upon success, or '-1' if the runtime
!      is already initialized.
  
!      _Note:_ In GCJ 3.1, the 'vm_args' parameter is ignored.  It is
       recognized and used as of release 4.0.
  
   -- Function: java::lang::Thread* JvAttachCurrentThread (jstring NAME,
            java::lang::ThreadGroup* GROUP)
       Registers an existing thread with the Java runtime.  This must be
       called once from each thread, before that thread makes any other
!      Java or CNI calls.  It must be called after 'JvCreateJavaVM'.  NAME
!      specifies a name for the thread.  It may be 'NULL', in which case a
       name will be generated.  GROUP is the ThreadGroup in which this
!      thread will be a member.  If it is 'NULL', the thread will be a
       member of the main thread group.  The return value is the Java
!      'Thread' object that represents the thread.  It is safe to call
!      'JvAttachCurrentThread()' more than once from the same thread.  If
       the thread is already attached, the call is ignored and the current
       thread object is returned.
  
   -- Function: jint JvDetachCurrentThread ()
!      Unregisters a thread from the Java runtime.  This should be called
!      by threads that were attached using 'JvAttachCurrentThread()',
!      after they have finished making calls to Java code.  This ensures
       that any resources associated with the thread become eligible for
!      garbage collection.  This function returns '0' upon success, or
!      '-1' if the current thread is not attached.
  
  11.16.1 Handling uncaught exceptions
  ------------------------------------
  
  If an exception is thrown from Java code called using the invocation
  API, and no handler for the exception can be found, the runtime will
! abort the application.  In order to make the application more robust, it
  is recommended that code which uses the invocation API be wrapped by a
  top-level try/catch block that catches all Java exceptions.
  
*************** top-level try/catch block that catches a
*** 3221,3233 ****
  
  The following code demonstrates the use of the invocation API. In this
  example, the C++ application initializes the Java runtime and attaches
! itself. The `java.lang.System' class is initialized in order to access
! its `out' field, and a Java string is printed. Finally, the thread is
  detached from the runtime once it has finished making Java calls.
  Everything is wrapped with a try/catch block to provide a default
  handler for any uncaught exceptions.
  
!    The example can be compiled with `c++ -c test.cc; gcj test.o'.
  
       // test.cc
       #include <gcj/cni.h>
--- 3189,3201 ----
  
  The following code demonstrates the use of the invocation API. In this
  example, the C++ application initializes the Java runtime and attaches
! itself.  The 'java.lang.System' class is initialized in order to access
! its 'out' field, and a Java string is printed.  Finally, the thread is
  detached from the runtime once it has finished making Java calls.
  Everything is wrapped with a try/catch block to provide a default
  handler for any uncaught exceptions.
  
!    The example can be compiled with 'c++ -c test.cc; gcj test.o'.
  
       // test.cc
       #include <gcj/cni.h>
*************** File: gcj.info,  Node: Reflection,  Prev
*** 3266,3282 ****
  Reflection is possible with CNI code, it functions similarly to how it
  functions with JNI.
  
!    The types `jfieldID' and `jmethodID' are as in JNI.
  
  The functions:
  
!    * `JvFromReflectedField',
! 
!    * `JvFromReflectedMethod',
! 
!    * `JvToReflectedField'
! 
!    * `JvToFromReflectedMethod'
  
  will be added shortly, as will other functions corresponding to JNI.
  
--- 3234,3247 ----
  Reflection is possible with CNI code, it functions similarly to how it
  functions with JNI.
  
!    The types 'jfieldID' and 'jmethodID' are as in JNI.
  
  The functions:
  
!    * 'JvFromReflectedField',
!    * 'JvFromReflectedMethod',
!    * 'JvToReflectedField'
!    * 'JvToFromReflectedMethod'
  
  will be added shortly, as will other functions corresponding to JNI.
  
*************** File: gcj.info,  Node: System properties
*** 3286,3305 ****
  12 System properties
  ********************
  
! The runtime behavior of the `libgcj' library can be modified by setting
  certain system properties.  These properties can be compiled into the
! program using the `-DNAME[=VALUE]' option to `gcj' or by setting them
  explicitly in the program by calling the
! `java.lang.System.setProperty()' method.  Some system properties are
  only used for informational purposes (like giving a version number or a
  user name).  A program can inspect the current value of a property by
! calling the `java.lang.System.getProperty()' method.
  
  * Menu:
  
! * Standard Properties::         Standard properties supported by `libgcj'
  * GNU Classpath Properties::    Properties found in Classpath based libraries
! * libgcj Runtime Properties::   Properties specific to `libgcj'
  
  
  File: gcj.info,  Node: Standard Properties,  Next: GNU Classpath Properties,  Up: System properties
--- 3251,3270 ----
  12 System properties
  ********************
  
! The runtime behavior of the 'libgcj' library can be modified by setting
  certain system properties.  These properties can be compiled into the
! program using the '-DNAME[=VALUE]' option to 'gcj' or by setting them
  explicitly in the program by calling the
! 'java.lang.System.setProperty()' method.  Some system properties are
  only used for informational purposes (like giving a version number or a
  user name).  A program can inspect the current value of a property by
! calling the 'java.lang.System.getProperty()' method.
  
  * Menu:
  
! * Standard Properties::         Standard properties supported by 'libgcj'
  * GNU Classpath Properties::    Properties found in Classpath based libraries
! * libgcj Runtime Properties::   Properties specific to 'libgcj'
  
  
  File: gcj.info,  Node: Standard Properties,  Next: GNU Classpath Properties,  Up: System properties
*************** File: gcj.info,  Node: Standard Properti
*** 3310,3487 ****
  The following properties are normally found in all implementations of
  the core libraries for the Java language.
  
! `java.version'
!      The `libgcj' version number.
  
! `java.vendor'
!      Set to `The Free Software Foundation, Inc.'
  
! `java.vendor.url'
!      Set to `http://gcc.gnu.org/java/'.
  
! `java.home'
!      The directory where `gcj' was installed.  Taken from the `--prefix'
!      option given to `configure'.
  
! `java.class.version'
       The class format version number supported by the libgcj byte code
!      interpreter.  (Currently `46.0')
  
! `java.vm.specification.version'
!      The Virtual Machine Specification version implemented by `libgcj'.
!      (Currently `1.0')
  
! `java.vm.specification.vendor'
       The name of the Virtual Machine specification designer.
  
! `java.vm.specification.name'
!      The name of the Virtual Machine specification (Set to `Java
!      Virtual Machine Specification').
  
! `java.vm.version'
!      The `gcj' version number.
  
! `java.vm.vendor'
!      Set to `The Free Software Foundation, Inc.'
  
! `java.vm.name'
!      Set to `GNU libgcj'.
  
! `java.specification.version'
       The Runtime Environment specification version implemented by
!      `libgcj'.  (Currently set to `1.3')
  
! `java.specification.vendor'
       The Runtime Environment specification designer.
  
! `java.specification.name'
!      The name of the Runtime Environment specification (Set to `Java
       Platform API Specification').
  
! `java.class.path'
       The paths (jar files, zip files and directories) used for finding
       class files.
  
! `java.library.path'
       Directory path used for finding native libraries.
  
! `java.io.tmpdir'
       The directory used to put temporary files in.
  
! `java.compiler'
       Name of the Just In Time compiler to use by the byte code
!      interpreter.  Currently not used in `libgcj'.
  
! `java.ext.dirs'
       Directories containing jar files with extra libraries.  Will be
       used when resolving classes.
  
! `java.protocol.handler.pkgs'
!      A `|' separated list of package names that is used to find classes
!      that implement handlers for `java.net.URL'.
  
! `java.rmi.server.codebase'
!      A list of URLs that is used by the `java.rmi.server.RMIClassLoader'
       to load classes from.
  
! `jdbc.drivers'
       A list of class names that will be loaded by the
!      `java.sql.DriverManager' when it starts up.
  
! `file.separator'
       The separator used in when directories are included in a filename
!      (normally `/' or `\' ).
  
! `file.encoding'
!      The default character encoding used when converting platform
!      native files to Unicode (usually set to `8859_1').
  
! `path.separator'
       The standard separator used when a string contains multiple paths
!      (normally `:' or `;'), the string is usually not a valid character
       to use in normal directory names.)
  
! `line.separator'
!      The default line separator used on the platform (normally `\n',
!      `\r' or a combination of those two characters).
  
! `policy.provider'
       The class name used for the default policy provider returned by
!      `java.security.Policy.getPolicy'.
  
! `user.name'
       The name of the user running the program.  Can be the full name,
       the login name or empty if unknown.
  
! `user.home'
       The default directory to put user specific files in.
  
! `user.dir'
       The current working directory from which the program was started.
  
! `user.language'
!      The default language as used by the `java.util.Locale' class.
  
! `user.region'
!      The default region as used by the `java.util.Local' class.
  
! `user.variant'
       The default variant of the language and region local used.
  
! `user.timezone'
!      The default timezone as used by the `java.util.TimeZone' class.
  
! `os.name'
       The operating system/kernel name that the program runs on.
  
! `os.arch'
       The hardware that we are running on.
  
! `os.version'
       The version number of the operating system/kernel.
  
! `awt.appletWarning'
       The string to display when an untrusted applet is displayed.
!      Returned by `java.awt.Window.getWarningString()' when the window is
       "insecure".
  
! `awt.toolkit'
       The class name used for initializing the default
!      `java.awt.Toolkit'.  Defaults to `gnu.awt.gtk.GtkToolkit'.
  
! `http.proxyHost'
       Name of proxy host for http connections.
  
! `http.proxyPort'
       Port number to use when a proxy host is in use.
  
- 
  
  File: gcj.info,  Node: GNU Classpath Properties,  Next: libgcj Runtime Properties,  Prev: Standard Properties,  Up: System properties
  
  12.2 GNU Classpath Properties
  =============================
  
! `libgcj' is based on the GNU Classpath (Essential Libraries for Java) a
  GNU project to create free core class libraries for use with virtual
  machines and compilers for the Java language.  The following properties
  are common to libraries based on GNU Classpath.
  
! `gcj.dumpobject'
       Enables printing serialization debugging by the
!      `java.io.ObjectInput' and `java.io.ObjectOutput' classes when set
       to something else then the empty string.  Only used when running a
       debug build of the library.
  
! `gnu.classpath.vm.shortname'
!      This is a succinct name of the virtual machine.  For `libgcj',
!      this will always be `libgcj'.
  
! `gnu.classpath.home.url'
       A base URL used for finding system property files (e.g.,
!      `classpath.security').  By default this is a `file:' URL pointing
!      to the `lib' directory under `java.home'.
! 
  
  
  File: gcj.info,  Node: libgcj Runtime Properties,  Prev: GNU Classpath Properties,  Up: System properties
--- 3275,3450 ----
  The following properties are normally found in all implementations of
  the core libraries for the Java language.
  
! 'java.version'
!      The 'libgcj' version number.
  
! 'java.vendor'
!      Set to 'The Free Software Foundation, Inc.'
  
! 'java.vendor.url'
!      Set to <http://gcc.gnu.org/java/>.
  
! 'java.home'
!      The directory where 'gcj' was installed.  Taken from the '--prefix'
!      option given to 'configure'.
  
! 'java.class.version'
       The class format version number supported by the libgcj byte code
!      interpreter.  (Currently '46.0')
  
! 'java.vm.specification.version'
!      The Virtual Machine Specification version implemented by 'libgcj'.
!      (Currently '1.0')
  
! 'java.vm.specification.vendor'
       The name of the Virtual Machine specification designer.
  
! 'java.vm.specification.name'
!      The name of the Virtual Machine specification (Set to 'Java Virtual
!      Machine Specification').
  
! 'java.vm.version'
!      The 'gcj' version number.
  
! 'java.vm.vendor'
!      Set to 'The Free Software Foundation, Inc.'
  
! 'java.vm.name'
!      Set to 'GNU libgcj'.
  
! 'java.specification.version'
       The Runtime Environment specification version implemented by
!      'libgcj'.  (Currently set to '1.3')
  
! 'java.specification.vendor'
       The Runtime Environment specification designer.
  
! 'java.specification.name'
!      The name of the Runtime Environment specification (Set to 'Java
       Platform API Specification').
  
! 'java.class.path'
       The paths (jar files, zip files and directories) used for finding
       class files.
  
! 'java.library.path'
       Directory path used for finding native libraries.
  
! 'java.io.tmpdir'
       The directory used to put temporary files in.
  
! 'java.compiler'
       Name of the Just In Time compiler to use by the byte code
!      interpreter.  Currently not used in 'libgcj'.
  
! 'java.ext.dirs'
       Directories containing jar files with extra libraries.  Will be
       used when resolving classes.
  
! 'java.protocol.handler.pkgs'
!      A '|' separated list of package names that is used to find classes
!      that implement handlers for 'java.net.URL'.
  
! 'java.rmi.server.codebase'
!      A list of URLs that is used by the 'java.rmi.server.RMIClassLoader'
       to load classes from.
  
! 'jdbc.drivers'
       A list of class names that will be loaded by the
!      'java.sql.DriverManager' when it starts up.
  
! 'file.separator'
       The separator used in when directories are included in a filename
!      (normally '/' or '\' ).
  
! 'file.encoding'
!      The default character encoding used when converting platform native
!      files to Unicode (usually set to '8859_1').
  
! 'path.separator'
       The standard separator used when a string contains multiple paths
!      (normally ':' or ';'), the string is usually not a valid character
       to use in normal directory names.)
  
! 'line.separator'
!      The default line separator used on the platform (normally '\n',
!      '\r' or a combination of those two characters).
  
! 'policy.provider'
       The class name used for the default policy provider returned by
!      'java.security.Policy.getPolicy'.
  
! 'user.name'
       The name of the user running the program.  Can be the full name,
       the login name or empty if unknown.
  
! 'user.home'
       The default directory to put user specific files in.
  
! 'user.dir'
       The current working directory from which the program was started.
  
! 'user.language'
!      The default language as used by the 'java.util.Locale' class.
  
! 'user.region'
!      The default region as used by the 'java.util.Local' class.
  
! 'user.variant'
       The default variant of the language and region local used.
  
! 'user.timezone'
!      The default timezone as used by the 'java.util.TimeZone' class.
  
! 'os.name'
       The operating system/kernel name that the program runs on.
  
! 'os.arch'
       The hardware that we are running on.
  
! 'os.version'
       The version number of the operating system/kernel.
  
! 'awt.appletWarning'
       The string to display when an untrusted applet is displayed.
!      Returned by 'java.awt.Window.getWarningString()' when the window is
       "insecure".
  
! 'awt.toolkit'
       The class name used for initializing the default
!      'java.awt.Toolkit'.  Defaults to 'gnu.awt.gtk.GtkToolkit'.
  
! 'http.proxyHost'
       Name of proxy host for http connections.
  
! 'http.proxyPort'
       Port number to use when a proxy host is in use.
  
  
  File: gcj.info,  Node: GNU Classpath Properties,  Next: libgcj Runtime Properties,  Prev: Standard Properties,  Up: System properties
  
  12.2 GNU Classpath Properties
  =============================
  
! 'libgcj' is based on the GNU Classpath (Essential Libraries for Java) a
  GNU project to create free core class libraries for use with virtual
  machines and compilers for the Java language.  The following properties
  are common to libraries based on GNU Classpath.
  
! 'gcj.dumpobject'
       Enables printing serialization debugging by the
!      'java.io.ObjectInput' and 'java.io.ObjectOutput' classes when set
       to something else then the empty string.  Only used when running a
       debug build of the library.
  
! 'gnu.classpath.vm.shortname'
!      This is a succinct name of the virtual machine.  For 'libgcj', this
!      will always be 'libgcj'.
  
! 'gnu.classpath.home.url'
       A base URL used for finding system property files (e.g.,
!      'classpath.security').  By default this is a 'file:' URL pointing
!      to the 'lib' directory under 'java.home'.
  
  
  File: gcj.info,  Node: libgcj Runtime Properties,  Prev: GNU Classpath Properties,  Up: System properties
*************** File: gcj.info,  Node: libgcj Runtime Pr
*** 3489,3585 ****
  12.3 libgcj Runtime Properties
  ==============================
  
! The following properties are specific to the `libgcj' runtime and will
  normally not be found in other core libraries for the java language.
  
! `java.fullversion'
!      The combination of `java.vm.name' and `java.vm.version'.
  
! `java.vm.info'
!      Same as `java.fullversion'.
  
! `impl.prefix'
!      Used by the `java.net.DatagramSocket' class when set to something
       else then the empty string.  When set all newly created
!      `DatagramSocket's will try to load a class
!      `java.net.[impl.prefix]DatagramSocketImpl' instead of the normal
!      `java.net.PlainDatagramSocketImpl'.
  
! `gnu.gcj.progname'
!      The class or binary name that was used to invoke the program. This
!      will be the name of the "main" class in the case where the `gij'
       front end is used, or the program binary name in the case where an
       application is compiled to a native binary.
  
! `gnu.gcj.user.realname'
       The real name of the user, as taken from the password file.  This
       may not always hold only the user's name (as some sites put extra
       information in this field).  Also, this property is not available
       on all platforms.
  
! `gnu.gcj.runtime.NameFinder.use_addr2line'
!      Whether an external process, `addr2line', should be used to
!      determine line number information when tracing the stack. Setting
!      this to `false' may suppress line numbers when printing stack
       traces and when using the java.util.logging infrastructure.
       However, performance may improve significantly for applications
       that print stack traces or make logging calls frequently.
  
! `gnu.gcj.runtime.NameFinder.show_raw'
       Whether the address of a stack frame should be printed when the
!      line number is unavailable. Setting this to `true' will cause the
       name of the object and the offset within that object to be printed
       when no line number is available.  This allows for off-line
       decoding of stack traces if necessary debug information is
!      available.  The default is `false', no raw addresses are printed.
  
! `gnu.gcj.runtime.NameFinder.remove_unknown'
       Whether stack frames for non-java code should be included in a
!      stack trace.  The default value is `true', stack frames for
!      non-java code are suppressed.  Setting this to `false' will cause
       any non-java stack frames to be printed in addition to frames for
       the java code.
  
! `gnu.gcj.runtime.VMClassLoader.library_control'
       This controls how shared libraries are automatically loaded by the
!      built-in class loader.  If this property is set to `full', a full
       search is done for each requested class.  If this property is set
!      to `cache', then any failed lookups are cached and not tried again.
!      If this property is set to `never' (the default), then lookups are
       never done.  For more information, *Note Extensions::.
  
! `gnu.gcj.runtime.endorsed.dirs'
!      This is like the standard `java.endorsed.dirs', property, but
       specifies some extra directories which are searched after the
       standard endorsed directories.  This is primarily useful for
!      telling `libgcj' about additional libraries which are ordinarily
       incorporated into the JDK, and which should be loaded by the
!      bootstrap class loader, but which are not yet part of `libgcj'
       itself for some reason.
  
! `gnu.gcj.jit.compiler'
!      This is the full path to `gcj' executable which should be used to
!      compile classes just-in-time when `ClassLoader.defineClass' is
!      called.  If not set, `gcj' will not be invoked by the runtime;
!      this can also be controlled via `Compiler.disable'.
  
! `gnu.gcj.jit.options'
       This is a space-separated string of options which should be passed
!      to `gcj' when in JIT mode.  If not set, a sensible default is
       chosen.
  
! `gnu.gcj.jit.cachedir'
!      This is the directory where cached shared library files are
!      stored.  If not set, JIT compilation is disabled.  This should
!      never be set to a directory that is writable by any other user.
  
! `gnu.gcj.precompiled.db.path'
       This is a sequence of file names, each referring to a file created
!      by `gcj-dbtool'.  These files will be used by `libgcj' to find
       shared libraries corresponding to classes that are loaded from
!      bytecode.  `libgcj' often has a built-in default database; it can
!      be queried using `gcj-dbtool -p'.
! 
  
  
  File: gcj.info,  Node: Resources,  Next: Index,  Prev: System properties,  Up: Top
--- 3452,3547 ----
  12.3 libgcj Runtime Properties
  ==============================
  
! The following properties are specific to the 'libgcj' runtime and will
  normally not be found in other core libraries for the java language.
  
! 'java.fullversion'
!      The combination of 'java.vm.name' and 'java.vm.version'.
  
! 'java.vm.info'
!      Same as 'java.fullversion'.
  
! 'impl.prefix'
!      Used by the 'java.net.DatagramSocket' class when set to something
       else then the empty string.  When set all newly created
!      'DatagramSocket's will try to load a class
!      'java.net.[impl.prefix]DatagramSocketImpl' instead of the normal
!      'java.net.PlainDatagramSocketImpl'.
  
! 'gnu.gcj.progname'
!      The class or binary name that was used to invoke the program.  This
!      will be the name of the "main" class in the case where the 'gij'
       front end is used, or the program binary name in the case where an
       application is compiled to a native binary.
  
! 'gnu.gcj.user.realname'
       The real name of the user, as taken from the password file.  This
       may not always hold only the user's name (as some sites put extra
       information in this field).  Also, this property is not available
       on all platforms.
  
! 'gnu.gcj.runtime.NameFinder.use_addr2line'
!      Whether an external process, 'addr2line', should be used to
!      determine line number information when tracing the stack.  Setting
!      this to 'false' may suppress line numbers when printing stack
       traces and when using the java.util.logging infrastructure.
       However, performance may improve significantly for applications
       that print stack traces or make logging calls frequently.
  
! 'gnu.gcj.runtime.NameFinder.show_raw'
       Whether the address of a stack frame should be printed when the
!      line number is unavailable.  Setting this to 'true' will cause the
       name of the object and the offset within that object to be printed
       when no line number is available.  This allows for off-line
       decoding of stack traces if necessary debug information is
!      available.  The default is 'false', no raw addresses are printed.
  
! 'gnu.gcj.runtime.NameFinder.remove_unknown'
       Whether stack frames for non-java code should be included in a
!      stack trace.  The default value is 'true', stack frames for
!      non-java code are suppressed.  Setting this to 'false' will cause
       any non-java stack frames to be printed in addition to frames for
       the java code.
  
! 'gnu.gcj.runtime.VMClassLoader.library_control'
       This controls how shared libraries are automatically loaded by the
!      built-in class loader.  If this property is set to 'full', a full
       search is done for each requested class.  If this property is set
!      to 'cache', then any failed lookups are cached and not tried again.
!      If this property is set to 'never' (the default), then lookups are
       never done.  For more information, *Note Extensions::.
  
! 'gnu.gcj.runtime.endorsed.dirs'
!      This is like the standard 'java.endorsed.dirs', property, but
       specifies some extra directories which are searched after the
       standard endorsed directories.  This is primarily useful for
!      telling 'libgcj' about additional libraries which are ordinarily
       incorporated into the JDK, and which should be loaded by the
!      bootstrap class loader, but which are not yet part of 'libgcj'
       itself for some reason.
  
! 'gnu.gcj.jit.compiler'
!      This is the full path to 'gcj' executable which should be used to
!      compile classes just-in-time when 'ClassLoader.defineClass' is
!      called.  If not set, 'gcj' will not be invoked by the runtime; this
!      can also be controlled via 'Compiler.disable'.
  
! 'gnu.gcj.jit.options'
       This is a space-separated string of options which should be passed
!      to 'gcj' when in JIT mode.  If not set, a sensible default is
       chosen.
  
! 'gnu.gcj.jit.cachedir'
!      This is the directory where cached shared library files are stored.
!      If not set, JIT compilation is disabled.  This should never be set
!      to a directory that is writable by any other user.
  
! 'gnu.gcj.precompiled.db.path'
       This is a sequence of file names, each referring to a file created
!      by 'gcj-dbtool'.  These files will be used by 'libgcj' to find
       shared libraries corresponding to classes that are loaded from
!      bytecode.  'libgcj' often has a built-in default database; it can
!      be queried using 'gcj-dbtool -p'.
  
  
  File: gcj.info,  Node: Resources,  Next: Index,  Prev: System properties,  Up: Top
*************** File: gcj.info,  Node: Resources,  Next:
*** 3587,3606 ****
  13 Resources
  ************
  
! While writing `gcj' and `libgcj' we have, of course, relied heavily on
  documentation from Sun Microsystems.  In particular we have used The
  Java Language Specification (both first and second editions), the Java
  Class Libraries (volumes one and two), and the Java Virtual Machine
  Specification.  In addition we've used Sun's online documentation.
  
!    The current `gcj' home page is `http://gcc.gnu.org/java/'.
  
!    For more information on GCC, see `http://gcc.gnu.org/'.
  
!    Some `libgcj' testing is done using the Mauve test suite.  This is a
  free software Java class library test suite which is being written
! because the JCK is not free.  See `http://www.sourceware.org/mauve/'
! for more information.
  
  
  File: gcj.info,  Node: Index,  Prev: Resources,  Up: Top
--- 3549,3568 ----
  13 Resources
  ************
  
! While writing 'gcj' and 'libgcj' we have, of course, relied heavily on
  documentation from Sun Microsystems.  In particular we have used The
  Java Language Specification (both first and second editions), the Java
  Class Libraries (volumes one and two), and the Java Virtual Machine
  Specification.  In addition we've used Sun's online documentation.
  
!    The current 'gcj' home page is <http://gcc.gnu.org/java/>.
  
!    For more information on GCC, see <http://gcc.gnu.org/>.
  
!    Some 'libgcj' testing is done using the Mauve test suite.  This is a
  free software Java class library test suite which is being written
! because the JCK is not free.  See <http://www.sourceware.org/mauve/> for
! more information.
  
  
  File: gcj.info,  Node: Index,  Prev: Resources,  Up: Top
*************** Index
*** 3613,3691 ****
  
  * class path:                            Input Options.        (line  6)
  * class$:                                Reference types.      (line 20)
! * elements on template<class T>:         Arrays.               (line 46)
  * FDL, GNU Free Documentation License:   GNU Free Documentation License.
                                                                 (line  6)
  * GCJ_PROPERTIES:                        Extensions.           (line 56)
  * jclass:                                Reference types.      (line 16)
  * jobject:                               Reference types.      (line 16)
  * jstring:                               Reference types.      (line 16)
! * JvAllocBytes:                          Mixing with C++.      (line 99)
! * JvAttachCurrentThread:                 Invocation.           (line 55)
! * JvCreateJavaVM:                        Invocation.           (line 11)
  * JvDetachCurrentThread:                 Invocation.           (line 68)
! * JvFree:                                Memory allocation.    (line 19)
! * JvGetArrayLength:                      Arrays.               (line 86)
! * JvGetStringChars:                      Strings.              (line 25)
! * JvGetStringUTFLength:                  Strings.              (line 29)
! * JvGetStringUTFRegion:                  Strings.              (line 34)
! * JvMalloc:                              Memory allocation.    (line 11)
! * JvNewBooleanArray:                     Arrays.               (line 83)
! * JvNewObjectArray:                      Arrays.               (line 57)
! * JvNewString:                           Strings.              (line 11)
! * JvNewStringLatin1:                     Strings.              (line 15)
! * JvNewStringUTF:                        Strings.              (line 21)
! * JvPrimClass:                           Primitive types.      (line 36)
! * JvRealloc:                             Memory allocation.    (line 15)
  
  
  
  Tag Table:
! Node: Top2729
! Node: Copying4148
! Node: GNU Free Documentation License41698
! Node: Invoking gcj66841
! Node: Input and output files67604
! Node: Input Options69130
! Node: Encodings72404
! Node: Warnings73610
! Node: Linking74723
! Node: Code Generation77662
! Node: Configure-time Options84442
! Node: Compatibility86182
! Node: Limitations86666
! Node: Extensions88248
! Node: Invoking jcf-dump91342
! Node: Invoking gij92287
! Node: Invoking gcj-dbtool95538
! Node: Invoking jv-convert98004
! Node: Invoking grmic99083
! Node: Invoking gc-analyze100469
! Node: Invoking aot-compile101910
! Node: Invoking rebuild-gcj-db102859
! Node: About CNI103169
! Node: Basic concepts104628
! Node: Packages107524
! Node: Primitive types109852
! Node: Reference types111530
! Node: Interfaces112619
! Node: Objects and Classes113530
! Node: Class Initialization115725
! Node: Object allocation118067
! Node: Memory allocation118857
! Node: Arrays119489
! Node: Methods122299
! Node: Strings125120
! Node: Mixing with C++126624
! Node: Exception Handling130095
! Node: Synchronization131729
! Node: Invocation133719
! Node: Reflection138655
! Node: System properties139116
! Node: Standard Properties139993
! Node: GNU Classpath Properties144425
! Node: libgcj Runtime Properties145472
! Node: Resources149974
! Node: Index150788
  
  End Tag Table
--- 3575,3655 ----
  
  * class path:                            Input Options.        (line  6)
  * class$:                                Reference types.      (line 20)
! * elements on template<class T>:         Arrays.               (line 45)
  * FDL, GNU Free Documentation License:   GNU Free Documentation License.
                                                                 (line  6)
  * GCJ_PROPERTIES:                        Extensions.           (line 56)
+ * GCJ_PROPERTIES <1>:                    Extensions.           (line 56)
  * jclass:                                Reference types.      (line 16)
  * jobject:                               Reference types.      (line 16)
  * jstring:                               Reference types.      (line 16)
! * JvAllocBytes:                          Mixing with C++.      (line 98)
! * JvAttachCurrentThread:                 Invocation.           (line 54)
! * JvCreateJavaVM:                        Invocation.           (line 10)
  * JvDetachCurrentThread:                 Invocation.           (line 68)
! * JvFree:                                Memory allocation.    (line 18)
! * JvGetArrayLength:                      Arrays.               (line 85)
! * JvGetStringChars:                      Strings.              (line 24)
! * JvGetStringUTFLength:                  Strings.              (line 28)
! * JvGetStringUTFRegion:                  Strings.              (line 32)
! * JvMalloc:                              Memory allocation.    (line 10)
! * JvNewBooleanArray:                     Arrays.               (line 82)
! * JvNewObjectArray:                      Arrays.               (line 55)
! * JvNewString:                           Strings.              (line 10)
! * JvNewStringLatin1:                     Strings.              (line 14)
! * JvNewStringLatin1 <1>:                 Strings.              (line 17)
! * JvNewStringUTF:                        Strings.              (line 20)
! * JvPrimClass:                           Primitive types.      (line 35)
! * JvRealloc:                             Memory allocation.    (line 14)
  
  
  
  Tag Table:
! Node: Top2679
! Node: Copying4098
! Node: GNU Free Documentation License41630
! Node: Invoking gcj66754
! Node: Input and output files67517
! Node: Input Options69039
! Node: Encodings72314
! Node: Warnings73520
! Node: Linking74633
! Node: Code Generation77571
! Node: Configure-time Options84347
! Node: Compatibility86087
! Node: Limitations86606
! Node: Extensions88184
! Node: Invoking jcf-dump91275
! Node: Invoking gij92220
! Node: Invoking gcj-dbtool95476
! Node: Invoking jv-convert97937
! Node: Invoking grmic99016
! Node: Invoking gc-analyze100402
! Node: Invoking aot-compile101843
! Node: Invoking rebuild-gcj-db102791
! Node: About CNI103101
! Node: Basic concepts104560
! Node: Packages107456
! Node: Primitive types109784
! Node: Reference types111461
! Node: Interfaces112545
! Node: Objects and Classes113456
! Node: Class Initialization115651
! Node: Object allocation117994
! Node: Memory allocation118784
! Node: Arrays119416
! Node: Methods122226
! Node: Strings125047
! Node: Mixing with C++126551
! Node: Exception Handling130024
! Node: Synchronization131659
! Node: Invocation133648
! Node: Reflection138600
! Node: System properties139058
! Node: Standard Properties139935
! Node: GNU Classpath Properties144366
! Node: libgcj Runtime Properties145412
! Node: Resources149915
! Node: Index150729
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/gcc/doc/gcov-dump.1 gcc-5.5.0/gcc/doc/gcov-dump.1
*** gcc-5.4.0/gcc/doc/gcov-dump.1	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/doc/gcov-dump.1	Tue Oct 10 08:23:55 2017
***************
*** 0 ****
--- 1,213 ----
+ .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
+ .\"
+ .\" Standard preamble:
+ .\" ========================================================================
+ .de Sp \" Vertical space (when we can't use .PP)
+ .if t .sp .5v
+ .if n .sp
+ ..
+ .de Vb \" Begin verbatim text
+ .ft CW
+ .nf
+ .ne \\$1
+ ..
+ .de Ve \" End verbatim text
+ .ft R
+ .fi
+ ..
+ .\" Set up some character translations and predefined strings.  \*(-- will
+ .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
+ .\" double quote, and \*(R" will give a right double quote.  \*(C+ will
+ .\" give a nicer C++.  Capital omega is used to do unbreakable dashes and
+ .\" therefore won't be available.  \*(C` and \*(C' expand to `' in nroff,
+ .\" nothing in troff, for use with C<>.
+ .tr \(*W-
+ .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
+ .ie n \{\
+ .    ds -- \(*W-
+ .    ds PI pi
+ .    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
+ .    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
+ .    ds L" ""
+ .    ds R" ""
+ .    ds C` ""
+ .    ds C' ""
+ 'br\}
+ .el\{\
+ .    ds -- \|\(em\|
+ .    ds PI \(*p
+ .    ds L" ``
+ .    ds R" ''
+ .    ds C`
+ .    ds C'
+ 'br\}
+ .\"
+ .\" Escape single quotes in literal strings from groff's Unicode transform.
+ .ie \n(.g .ds Aq \(aq
+ .el       .ds Aq '
+ .\"
+ .\" If the F register is >0, we'll generate index entries on stderr for
+ .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
+ .\" entries marked with X<> in POD.  Of course, you'll have to process the
+ .\" output yourself in some meaningful fashion.
+ .\"
+ .\" Avoid warning from groff about undefined register 'F'.
+ .de IX
+ ..
+ .if !\nF .nr F 0
+ .if \nF>0 \{\
+ .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
+ ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
+ .\}
+ .\"
+ .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
+ .\" Fear.  Run.  Save yourself.  No user-serviceable parts.
+ .    \" fudge factors for nroff and troff
+ .if n \{\
+ .    ds #H 0
+ .    ds #V .8m
+ .    ds #F .3m
+ .    ds #[ \f1
+ .    ds #] \fP
+ .\}
+ .if t \{\
+ .    ds #H ((1u-(\\\\n(.fu%2u))*.13m)
+ .    ds #V .6m
+ .    ds #F 0
+ .    ds #[ \&
+ .    ds #] \&
+ .\}
+ .    \" simple accents for nroff and troff
+ .if n \{\
+ .    ds ' \&
+ .    ds ` \&
+ .    ds ^ \&
+ .    ds , \&
+ .    ds ~ ~
+ .    ds /
+ .\}
+ .if t \{\
+ .    ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
+ .    ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
+ .    ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
+ .    ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
+ .    ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
+ .    ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
+ .\}
+ .    \" troff and (daisy-wheel) nroff accents
+ .ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
+ .ds 8 \h'\*(#H'\(*b\h'-\*(#H'
+ .ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
+ .ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
+ .ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
+ .ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
+ .ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
+ .ds ae a\h'-(\w'a'u*4/10)'e
+ .ds Ae A\h'-(\w'A'u*4/10)'E
+ .    \" corrections for vroff
+ .if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
+ .if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
+ .    \" for low resolution devices (crt and lpr)
+ .if \n(.H>23 .if \n(.V>19 \
+ \{\
+ .    ds : e
+ .    ds 8 ss
+ .    ds o a
+ .    ds d- d\h'-1'\(ga
+ .    ds D- D\h'-1'\(hy
+ .    ds th \o'bp'
+ .    ds Th \o'LP'
+ .    ds ae ae
+ .    ds Ae AE
+ .\}
+ .rm #[ #] #H #V #F C
+ .\" ========================================================================
+ .\"
+ .IX Title "GCOV-DUMP 1"
+ .TH GCOV-DUMP 1 "2017-10-10" "gcc-5.5.0" "GNU"
+ .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
+ .\" way too many mistakes in technical documents.
+ .if n .ad l
+ .nh
+ .SH "NAME"
+ gcov\-dump \- offline gcda and gcno profile dump tool
+ .SH "SYNOPSIS"
+ .IX Header "SYNOPSIS"
+ gcov-dump [\fB\-v\fR|\fB\-\-version\fR]
+      [\fB\-h\fR|\fB\-\-help\fR]
+      [\fB\-l\fR|\fB\-\-long\fR]
+      [\fB\-p\fR|\fB\-\-positions\fR]
+      [\fB\-w\fR|\fB\-\-working\-sets\fR] \fIgcovfiles\fR
+ .SH "DESCRIPTION"
+ .IX Header "DESCRIPTION"
+ \&\fBgcov-dump\fR is a tool you can use in conjunction with \s-1GCC\s0 to
+ dump content of gcda and gcno profile files offline.
+ .SH "OPTIONS"
+ .IX Header "OPTIONS"
+ .IP "\fB\-h\fR" 4
+ .IX Item "-h"
+ .PD 0
+ .IP "\fB\-\-help\fR" 4
+ .IX Item "--help"
+ .PD
+ Display help about using \fBgcov-dump\fR (on the standard output), and
+ exit without doing any further processing.
+ .IP "\fB\-l\fR" 4
+ .IX Item "-l"
+ .PD 0
+ .IP "\fB\-\-long\fR" 4
+ .IX Item "--long"
+ .PD
+ Dump content of records.
+ .IP "\fB\-p\fR" 4
+ .IX Item "-p"
+ .PD 0
+ .IP "\fB\-\-positions\fR" 4
+ .IX Item "--positions"
+ .PD
+ Dump positions of records.
+ .IP "\fB\-v\fR" 4
+ .IX Item "-v"
+ .PD 0
+ .IP "\fB\-\-version\fR" 4
+ .IX Item "--version"
+ .PD
+ Display the \fBgcov-dump\fR version number (on the standard output),
+ and exit without doing any further processing.
+ .IP "\fB\-w\fR" 4
+ .IX Item "-w"
+ .PD 0
+ .IP "\fB\-\-working\-sets\fR" 4
+ .IX Item "--working-sets"
+ .PD
+ Dump working set computed from summary.
+ .SH "COPYRIGHT"
+ .IX Header "COPYRIGHT"
+ Copyright (c) 2017 Free Software Foundation, Inc.
+ .PP
+ Permission is granted to copy, distribute and/or modify this document
+ under the terms of the \s-1GNU\s0 Free Documentation License, Version 1.3 or
+ any later version published by the Free Software Foundation; with the
+ Invariant Sections being \*(L"\s-1GNU\s0 General Public License\*(R" and \*(L"Funding
+ Free Software\*(R", the Front-Cover texts being (a) (see below), and with
+ the Back-Cover Texts being (b) (see below).  A copy of the license is
+ included in the \fIgfdl\fR\|(7) man page.
+ .PP
+ (a) The \s-1FSF\s0's Front-Cover Text is:
+ .PP
+ .Vb 1
+ \&     A GNU Manual
+ .Ve
+ .PP
+ (b) The \s-1FSF\s0's Back-Cover Text is:
+ .PP
+ .Vb 3
+ \&     You have freedom to copy and modify this GNU Manual, like GNU
+ \&     software.  Copies published by the Free Software Foundation raise
+ \&     funds for GNU development.
+ .Ve
diff -Nrcpad gcc-5.4.0/gcc/doc/gcov-dump.texi gcc-5.5.0/gcc/doc/gcov-dump.texi
*** gcc-5.4.0/gcc/doc/gcov-dump.texi	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/doc/gcov-dump.texi	Thu Jun 22 11:27:50 2017
***************
*** 0 ****
--- 1,93 ----
+ @c Copyright (C) 2017 Free Software Foundation, Inc.
+ @c This is part of the GCC manual.
+ @c For copying conditions, see the file gcc.texi.
+ 
+ @ignore
+ @c man begin COPYRIGHT
+ Copyright @copyright{} 2017 Free Software Foundation, Inc.
+ 
+ Permission is granted to copy, distribute and/or modify this document
+ under the terms of the GNU Free Documentation License, Version 1.3 or
+ any later version published by the Free Software Foundation; with the
+ Invariant Sections being ``GNU General Public License'' and ``Funding
+ Free Software'', the Front-Cover texts being (a) (see below), and with
+ the Back-Cover Texts being (b) (see below).  A copy of the license is
+ included in the gfdl(7) man page.
+ 
+ (a) The FSF's Front-Cover Text is:
+ 
+      A GNU Manual
+ 
+ (b) The FSF's Back-Cover Text is:
+ 
+      You have freedom to copy and modify this GNU Manual, like GNU
+      software.  Copies published by the Free Software Foundation raise
+      funds for GNU development.
+ @c man end
+ @c Set file name and title for the man page.
+ @setfilename gcov-dump
+ @settitle offline gcda and gcno profile dump tool
+ @end ignore
+ 
+ @node Gcov-dump
+ @chapter @command{gcov-dump}---an Offline Gcda and Gcno Profile Dump Tool
+ 
+ @menu
+ * Gcov-dump Intro::             Introduction to gcov-dump.
+ * Invoking Gcov-dump::          How to use gcov-dump.
+ @end menu
+ 
+ @node Gcov-dump Intro
+ @section Introduction to @command{gcov-dump}
+ @c man begin DESCRIPTION
+ 
+ @command{gcov-dump} is a tool you can use in conjunction with GCC to
+ dump content of gcda and gcno profile files offline.
+ 
+ @c man end
+ 
+ @node Invoking Gcov-dump
+ @section Invoking @command{gcov-dump}
+ 
+ @smallexample
+ Usage: gcov-dump @r{[}@var{OPTION}@r{]} ... @var{gcovfiles}
+ @end smallexample
+ 
+ @command{gcov-dump} accepts the following options:
+ 
+ @ignore
+ @c man begin SYNOPSIS
+ gcov-dump [@option{-v}|@option{--version}]
+      [@option{-h}|@option{--help}]
+      [@option{-l}|@option{--long}]
+      [@option{-p}|@option{--positions}]
+      [@option{-w}|@option{--working-sets}] @var{gcovfiles}
+ @c man end
+ @end ignore
+ 
+ @c man begin OPTIONS
+ @table @gcctabopt
+ @item -h
+ @itemx --help
+ Display help about using @command{gcov-dump} (on the standard output), and
+ exit without doing any further processing.
+ 
+ @item -l
+ @itemx --long
+ Dump content of records.
+ 
+ @item -p
+ @itemx --positions
+ Dump positions of records.
+ 
+ @item -v
+ @itemx --version
+ Display the @command{gcov-dump} version number (on the standard output),
+ and exit without doing any further processing.
+ 
+ @item -w
+ @itemx --working-sets
+ Dump working set computed from summary.
+ @end table
+ 
+ @c man end
diff -Nrcpad gcc-5.4.0/gcc/doc/gcov-tool.1 gcc-5.5.0/gcc/doc/gcov-tool.1
*** gcc-5.4.0/gcc/doc/gcov-tool.1	Fri Jun  3 08:54:13 2016
--- gcc-5.5.0/gcc/doc/gcov-tool.1	Tue Oct 10 08:23:55 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GCOV-TOOL 1"
! .TH GCOV-TOOL 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GCOV-TOOL 1"
! .TH GCOV-TOOL 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** gcov\-tool \- offline gcda profile proce
*** 144,166 ****
  gcov-tool [\fB\-v\fR|\fB\-\-version\fR] [\fB\-h\fR|\fB\-\-help\fR]
  .PP
  gcov-tool merge [merge\-options] \fIdirectory1\fR \fIdirectory2\fR
       [\fB\-v\fR|\fB\-\-verbose\fR]
-      [\fB\-o\fR| \fB\-\-output\fR \fIdirectory\fR]
       [\fB\-w\fR|\fB\-\-weight\fR \fIw1,w2\fR]
  .PP
  gcov-tool rewrite [rewrite\-options] \fIdirectory\fR
!      [\fB\-v\fR|\fB\-\-verbose\fR]
       [\fB\-o\fR|\fB\-\-output\fR \fIdirectory\fR]
       [\fB\-s\fR|\fB\-\-scale\fR \fIfloat_or_simple\-frac_value\fR]
!      [\fB\-n\fR|\fB\-\-normalize\fR \fIlong_long_value\fR]
  .PP
  gcov-tool overlap [overlap\-options] \fIdirectory1\fR \fIdirectory2\fR
-      [\fB\-v\fR|\fB\-\-verbose\fR]
-      [\fB\-h\fR|\fB\-\-hotonly\fR]
       [\fB\-f\fR|\fB\-\-function\fR]
       [\fB\-F\fR|\fB\-\-fullname\fR]
       [\fB\-o\fR|\fB\-\-object\fR]
       [\fB\-t\fR|\fB\-\-hot_threshold\fR] \fIfloat\fR
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
  \&\fBgcov-tool\fR is an offline tool to process gcc's gcda profile files.
--- 141,163 ----
  gcov-tool [\fB\-v\fR|\fB\-\-version\fR] [\fB\-h\fR|\fB\-\-help\fR]
  .PP
  gcov-tool merge [merge\-options] \fIdirectory1\fR \fIdirectory2\fR
+      [\fB\-o\fR|\fB\-\-output\fR \fIdirectory\fR]
       [\fB\-v\fR|\fB\-\-verbose\fR]
       [\fB\-w\fR|\fB\-\-weight\fR \fIw1,w2\fR]
  .PP
  gcov-tool rewrite [rewrite\-options] \fIdirectory\fR
!      [\fB\-n\fR|\fB\-\-normalize\fR \fIlong_long_value\fR]
       [\fB\-o\fR|\fB\-\-output\fR \fIdirectory\fR]
       [\fB\-s\fR|\fB\-\-scale\fR \fIfloat_or_simple\-frac_value\fR]
!      [\fB\-v\fR|\fB\-\-verbose\fR]
  .PP
  gcov-tool overlap [overlap\-options] \fIdirectory1\fR \fIdirectory2\fR
       [\fB\-f\fR|\fB\-\-function\fR]
       [\fB\-F\fR|\fB\-\-fullname\fR]
+      [\fB\-h\fR|\fB\-\-hotonly\fR]
       [\fB\-o\fR|\fB\-\-object\fR]
       [\fB\-t\fR|\fB\-\-hot_threshold\fR] \fIfloat\fR
+      [\fB\-v\fR|\fB\-\-verbose\fR]
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
  \&\fBgcov-tool\fR is an offline tool to process gcc's gcda profile files.
*************** and exit without doing any further proce
*** 224,236 ****
  .IX Item "merge"
  Merge two profile directories.
  .RS 4
- .IP "\fB\-v\fR" 4
- .IX Item "-v"
- .PD 0
- .IP "\fB\-\-verbose\fR" 4
- .IX Item "--verbose"
- .PD
- Set the verbose mode.
  .IP "\fB\-o\fR \fIdirectory\fR" 4
  .IX Item "-o directory"
  .PD 0
--- 221,226 ----
*************** Set the verbose mode.
*** 239,244 ****
--- 229,241 ----
  .PD
  Set the output profile directory. Default output directory name is
  \&\fImerged_profile\fR.
+ .IP "\fB\-v\fR" 4
+ .IX Item "-v"
+ .PD 0
+ .IP "\fB\-\-verbose\fR" 4
+ .IX Item "--verbose"
+ .PD
+ Set the verbose mode.
  .IP "\fB\-w\fR \fIw1\fR\fB,\fR\fIw2\fR" 4
  .IX Item "-w w1,w2"
  .PD 0
*************** respectively. The default weights are 1
*** 254,266 ****
  .IX Item "rewrite"
  Read the specified profile directory and rewrite to a new directory.
  .RS 4
! .IP "\fB\-v\fR" 4
! .IX Item "-v"
  .PD 0
! .IP "\fB\-\-verbose\fR" 4
! .IX Item "--verbose"
  .PD
! Set the verbose mode.
  .IP "\fB\-o\fR \fIdirectory\fR" 4
  .IX Item "-o directory"
  .PD 0
--- 251,264 ----
  .IX Item "rewrite"
  Read the specified profile directory and rewrite to a new directory.
  .RS 4
! .IP "\fB\-n\fR \fIlong_long_value\fR" 4
! .IX Item "-n long_long_value"
  .PD 0
! .IP "\fB\-\-normalize <long_long_value>\fR" 4
! .IX Item "--normalize <long_long_value>"
  .PD
! Normalize the profile. The specified value is the max counter value
! in the new profile.
  .IP "\fB\-o\fR \fIdirectory\fR" 4
  .IX Item "-o directory"
  .PD 0
*************** Set the output profile directory. Defaul
*** 276,289 ****
  .PD
  Scale the profile counters. The specified value can be in floating point value,
  or simple fraction value form, such 1, 2, 2/3, and 5/3.
! .IP "\fB\-n\fR \fIlong_long_value\fR" 4
! .IX Item "-n long_long_value"
  .PD 0
! .IP "\fB\-\-normalize <long_long_value>\fR" 4
! .IX Item "--normalize <long_long_value>"
  .PD
! Normalize the profile. The specified value is the max counter value
! in the new profile.
  .RE
  .RS 4
  .RE
--- 274,286 ----
  .PD
  Scale the profile counters. The specified value can be in floating point value,
  or simple fraction value form, such 1, 2, 2/3, and 5/3.
! .IP "\fB\-v\fR" 4
! .IX Item "-v"
  .PD 0
! .IP "\fB\-\-verbose\fR" 4
! .IX Item "--verbose"
  .PD
! Set the verbose mode.
  .RE
  .RS 4
  .RE
*************** for all arc counter i, where p1_counter[
*** 296,315 ****
  matched counters and p1_sum_all and p2_sum_all are the sum of counter
  values in profile 1 and profile 2, respectively.
  .RS 4
- .IP "\fB\-v\fR" 4
- .IX Item "-v"
- .PD 0
- .IP "\fB\-\-verbose\fR" 4
- .IX Item "--verbose"
- .PD
- Set the verbose mode.
- .IP "\fB\-h\fR" 4
- .IX Item "-h"
- .PD 0
- .IP "\fB\-\-hotonly\fR" 4
- .IX Item "--hotonly"
- .PD
- Only print info for hot objects/functions.
  .IP "\fB\-f\fR" 4
  .IX Item "-f"
  .PD 0
--- 293,298 ----
*************** Print function level overlap score.
*** 324,329 ****
--- 307,319 ----
  .IX Item "--fullname"
  .PD
  Print full gcda filename.
+ .IP "\fB\-h\fR" 4
+ .IX Item "-h"
+ .PD 0
+ .IP "\fB\-\-hotonly\fR" 4
+ .IX Item "--hotonly"
+ .PD
+ Only print info for hot objects/functions.
  .IP "\fB\-o\fR" 4
  .IX Item "-o"
  .PD 0
*************** Print object level overlap score.
*** 338,343 ****
--- 328,340 ----
  .IX Item "--hot_threshold <float>"
  .PD
  Set the threshold for hot counter value.
+ .IP "\fB\-v\fR" 4
+ .IX Item "-v"
+ .PD 0
+ .IP "\fB\-\-verbose\fR" 4
+ .IX Item "--verbose"
+ .PD
+ Set the verbose mode.
  .RE
  .RS 4
  .RE
diff -Nrcpad gcc-5.4.0/gcc/doc/gcov-tool.texi gcc-5.5.0/gcc/doc/gcov-tool.texi
*** gcc-5.4.0/gcc/doc/gcov-tool.texi	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/doc/gcov-tool.texi	Thu Jun 22 11:27:50 2017
*************** gcov-tool @r{[}@var{global-options}@r{]}
*** 113,135 ****
  gcov-tool [@option{-v}|@option{--version}] [@option{-h}|@option{--help}]
  
  gcov-tool merge [merge-options] @var{directory1} @var{directory2}
       [@option{-v}|@option{--verbose}]
-      [@option{-o}|@option{ --output} @var{directory}]
       [@option{-w}|@option{--weight} @var{w1,w2}]
  
  gcov-tool rewrite [rewrite-options] @var{directory}
!      [@option{-v}|@option{--verbose}]
       [@option{-o}|@option{--output} @var{directory}]
       [@option{-s}|@option{--scale} @var{float_or_simple-frac_value}]
!      [@option{-n}|@option{--normalize} @var{long_long_value}]
  
  gcov-tool overlap [overlap-options] @var{directory1} @var{directory2}
-      [@option{-v}|@option{--verbose}]
-      [@option{-h}|@option{--hotonly}]
       [@option{-f}|@option{--function}]
       [@option{-F}|@option{--fullname}]
       [@option{-o}|@option{--object}]
       [@option{-t}|@option{--hot_threshold}] @var{float}
  
  @c man end
  @c man begin SEEALSO
--- 113,135 ----
  gcov-tool [@option{-v}|@option{--version}] [@option{-h}|@option{--help}]
  
  gcov-tool merge [merge-options] @var{directory1} @var{directory2}
+      [@option{-o}|@option{--output} @var{directory}]
       [@option{-v}|@option{--verbose}]
       [@option{-w}|@option{--weight} @var{w1,w2}]
  
  gcov-tool rewrite [rewrite-options] @var{directory}
!      [@option{-n}|@option{--normalize} @var{long_long_value}]
       [@option{-o}|@option{--output} @var{directory}]
       [@option{-s}|@option{--scale} @var{float_or_simple-frac_value}]
!      [@option{-v}|@option{--verbose}]
  
  gcov-tool overlap [overlap-options] @var{directory1} @var{directory2}
       [@option{-f}|@option{--function}]
       [@option{-F}|@option{--fullname}]
+      [@option{-h}|@option{--hotonly}]
       [@option{-o}|@option{--object}]
       [@option{-t}|@option{--hot_threshold}] @var{float}
+      [@option{-v}|@option{--verbose}]
  
  @c man end
  @c man begin SEEALSO
*************** and exit without doing any further proce
*** 152,168 ****
  
  @item merge
  Merge two profile directories.
- 
  @table @gcctabopt
- @item -v
- @itemx --verbose
- Set the verbose mode.
  
  @item -o @var{directory}
  @itemx --output @var{directory}
  Set the output profile directory. Default output directory name is
  @var{merged_profile}.
  
  @item -w @var{w1},@var{w2}
  @itemx --weight @var{w1},@var{w2}
  Set the merge weights of the @var{directory1} and @var{directory2},
--- 152,168 ----
  
  @item merge
  Merge two profile directories.
  @table @gcctabopt
  
  @item -o @var{directory}
  @itemx --output @var{directory}
  Set the output profile directory. Default output directory name is
  @var{merged_profile}.
  
+ @item -v
+ @itemx --verbose
+ Set the verbose mode.
+ 
  @item -w @var{w1},@var{w2}
  @itemx --weight @var{w1},@var{w2}
  Set the merge weights of the @var{directory1} and @var{directory2},
*************** respectively. The default weights are 1
*** 171,181 ****
  
  @item rewrite
  Read the specified profile directory and rewrite to a new directory.
- 
  @table @gcctabopt
! @item -v
! @itemx --verbose
! Set the verbose mode.
  
  @item -o @var{directory}
  @itemx --output @var{directory}
--- 171,182 ----
  
  @item rewrite
  Read the specified profile directory and rewrite to a new directory.
  @table @gcctabopt
! 
! @item -n @var{long_long_value}
! @itemx --normalize <long_long_value>
! Normalize the profile. The specified value is the max counter value
! in the new profile.
  
  @item -o @var{directory}
  @itemx --output @var{directory}
*************** Set the output profile directory. Defaul
*** 186,195 ****
  Scale the profile counters. The specified value can be in floating point value,
  or simple fraction value form, such 1, 2, 2/3, and 5/3.
  
! @item -n @var{long_long_value}
! @itemx --normalize <long_long_value>
! Normalize the profile. The specified value is the max counter value
! in the new profile.
  @end table
  
  @item overlap
--- 187,195 ----
  Scale the profile counters. The specified value can be in floating point value,
  or simple fraction value form, such 1, 2, 2/3, and 5/3.
  
! @item -v
! @itemx --verbose
! Set the verbose mode.
  @end table
  
  @item overlap
*************** matched counters and p1_sum_all and p2_s
*** 201,214 ****
  values in profile 1 and profile 2, respectively.
  
  @table @gcctabopt
- @item -v
- @itemx --verbose
- Set the verbose mode.
- 
- @item -h
- @itemx --hotonly
- Only print info for hot objects/functions.
- 
  @item -f
  @itemx --function
  Print function level overlap score.
--- 201,206 ----
*************** Print function level overlap score.
*** 217,222 ****
--- 209,218 ----
  @itemx --fullname
  Print full gcda filename.
  
+ @item -h
+ @itemx --hotonly
+ Only print info for hot objects/functions.
+ 
  @item -o
  @itemx --object
  Print object level overlap score.
*************** Print object level overlap score.
*** 224,229 ****
--- 220,229 ----
  @item -t @var{float}
  @itemx --hot_threshold <float>
  Set the threshold for hot counter value.
+ 
+ @item -v
+ @itemx --verbose
+ Set the verbose mode.
  @end table
  
  @end table
diff -Nrcpad gcc-5.4.0/gcc/doc/gcov.1 gcc-5.5.0/gcc/doc/gcov.1
*** gcc-5.4.0/gcc/doc/gcov.1	Fri Jun  3 08:54:10 2016
--- gcc-5.5.0/gcc/doc/gcov.1	Tue Oct 10 08:23:52 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GCOV 1"
! .TH GCOV 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GCOV 1"
! .TH GCOV 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** in fine-tuning the performance of your p
*** 209,234 ****
  timing information you can use along with the information you get from
  \&\fBgcov\fR.
  .PP
! \&\fBgcov\fR works only on code compiled with \s-1GCC\s0.  It is not
  compatible with any other profiling or test coverage mechanism.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
- .IP "\fB\-h\fR" 4
- .IX Item "-h"
- .PD 0
- .IP "\fB\-\-help\fR" 4
- .IX Item "--help"
- .PD
- Display help about using \fBgcov\fR (on the standard output), and
- exit without doing any further processing.
- .IP "\fB\-v\fR" 4
- .IX Item "-v"
- .PD 0
- .IP "\fB\-\-version\fR" 4
- .IX Item "--version"
- .PD
- Display the \fBgcov\fR version number (on the standard output),
- and exit without doing any further processing.
  .IP "\fB\-a\fR" 4
  .IX Item "-a"
  .PD 0
--- 206,215 ----
  timing information you can use along with the information you get from
  \&\fBgcov\fR.
  .PP
! \&\fBgcov\fR works only on code compiled with \s-1GCC.\s0  It is not
  compatible with any other profiling or test coverage mechanism.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
  .IP "\fB\-a\fR" 4
  .IX Item "-a"
  .PD 0
*************** be shown, unless the \fB\-u\fR option is
*** 257,269 ****
  .PD
  Write branch frequencies as the number of branches taken, rather than
  the percentage of branches taken.
! .IP "\fB\-n\fR" 4
! .IX Item "-n"
  .PD 0
! .IP "\fB\-\-no\-output\fR" 4
! .IX Item "--no-output"
  .PD
! Do not create the \fBgcov\fR output file.
  .IP "\fB\-l\fR" 4
  .IX Item "-l"
  .PD 0
--- 238,307 ----
  .PD
  Write branch frequencies as the number of branches taken, rather than
  the percentage of branches taken.
! .IP "\fB\-d\fR" 4
! .IX Item "-d"
  .PD 0
! .IP "\fB\-\-display\-progress\fR" 4
! .IX Item "--display-progress"
  .PD
! Display the progress on the standard output.
! .IP "\fB\-f\fR" 4
! .IX Item "-f"
! .PD 0
! .IP "\fB\-\-function\-summaries\fR" 4
! .IX Item "--function-summaries"
! .PD
! Output summaries for each function in addition to the file level summary.
! .IP "\fB\-h\fR" 4
! .IX Item "-h"
! .PD 0
! .IP "\fB\-\-help\fR" 4
! .IX Item "--help"
! .PD
! Display help about using \fBgcov\fR (on the standard output), and
! exit without doing any further processing.
! .IP "\fB\-i\fR" 4
! .IX Item "-i"
! .PD 0
! .IP "\fB\-\-intermediate\-format\fR" 4
! .IX Item "--intermediate-format"
! .PD
! Output gcov file in an easy-to-parse intermediate text format that can
! be used by \fBlcov\fR or other tools. The output is a single
! \&\fI.gcov\fR file per \fI.gcda\fR file. No source code is required.
! .Sp
! The format of the intermediate \fI.gcov\fR file is plain text with
! one entry per line
! .Sp
! .Vb 4
! \&        file:<source_file_name>
! \&        function:<line_number>,<execution_count>,<function_name>
! \&        lcount:<line number>,<execution_count>
! \&        branch:<line_number>,<branch_coverage_type>
! \&        
! \&        Where the <branch_coverage_type> is
! \&           notexec (Branch not executed)
! \&           taken (Branch executed and taken)
! \&           nottaken (Branch executed, but not taken)
! \&        
! \&        There can be multiple <file> entries in an intermediate gcov
! \&        file. All entries following a <file> pertain to that source file
! \&        until the next <file> entry.
! .Ve
! .Sp
! Here is a sample when \fB\-i\fR is used in conjunction with \fB\-b\fR option:
! .Sp
! .Vb 9
! \&        file:array.cc
! \&        function:11,1,_Z3sumRKSt6vectorIPiSaIS0_EE
! \&        function:22,1,main
! \&        lcount:11,1
! \&        lcount:12,1
! \&        lcount:14,1
! \&        branch:14,taken
! \&        lcount:26,1
! \&        branch:28,nottaken
! .Ve
  .IP "\fB\-l\fR" 4
  .IX Item "-l"
  .PD 0
*************** produce an output file called \fIa.c##x.
*** 278,283 ****
--- 316,350 ----
  multiple source files and you want to see the individual
  contributions.  If you use the \fB\-p\fR option, both the including
  and included file names will be complete path names.
+ .IP "\fB\-m\fR" 4
+ .IX Item "-m"
+ .PD 0
+ .IP "\fB\-\-demangled\-names\fR" 4
+ .IX Item "--demangled-names"
+ .PD
+ Display demangled function names in output. The default is to show
+ mangled function names.
+ .IP "\fB\-n\fR" 4
+ .IX Item "-n"
+ .PD 0
+ .IP "\fB\-\-no\-output\fR" 4
+ .IX Item "--no-output"
+ .PD
+ Do not create the \fBgcov\fR output file.
+ .IP "\fB\-o\fR \fIdirectory|file\fR" 4
+ .IX Item "-o directory|file"
+ .PD 0
+ .IP "\fB\-\-object\-directory\fR \fIdirectory\fR" 4
+ .IX Item "--object-directory directory"
+ .IP "\fB\-\-object\-file\fR \fIfile\fR" 4
+ .IX Item "--object-file file"
+ .PD
+ Specify either the directory containing the gcov data files, or the
+ object path name.  The \fI.gcno\fR, and
+ \&\fI.gcda\fR data files are searched for using this option.  If a directory
+ is specified, the data files are in that directory and named after the
+ input file name, without its extension.  If a file is specified here,
+ the data files are named after that file, without its extension.
  .IP "\fB\-p\fR" 4
  .IX Item "-p"
  .PD 0
*************** Only output information about source fil
*** 301,327 ****
  (after source prefix elision).  Absolute paths are usually system
  header files and coverage of any inline functions therein is normally
  uninteresting.
- .IP "\fB\-f\fR" 4
- .IX Item "-f"
- .PD 0
- .IP "\fB\-\-function\-summaries\fR" 4
- .IX Item "--function-summaries"
- .PD
- Output summaries for each function in addition to the file level summary.
- .IP "\fB\-o\fR \fIdirectory|file\fR" 4
- .IX Item "-o directory|file"
- .PD 0
- .IP "\fB\-\-object\-directory\fR \fIdirectory\fR" 4
- .IX Item "--object-directory directory"
- .IP "\fB\-\-object\-file\fR \fIfile\fR" 4
- .IX Item "--object-file file"
- .PD
- Specify either the directory containing the gcov data files, or the
- object path name.  The \fI.gcno\fR, and
- \&\fI.gcda\fR data files are searched for using this option.  If a directory
- is specified, the data files are in that directory and named after the
- input file name, without its extension.  If a file is specified here,
- the data files are named after that file, without its extension.
  .IP "\fB\-s\fR \fIdirectory\fR" 4
  .IX Item "-s directory"
  .PD 0
--- 368,373 ----
*************** applied before determining whether the s
*** 341,403 ****
  .PD
  When branch probabilities are given, include those of unconditional branches.
  Unconditional branches are normally not interesting.
! .IP "\fB\-d\fR" 4
! .IX Item "-d"
  .PD 0
! .IP "\fB\-\-display\-progress\fR" 4
! .IX Item "--display-progress"
  .PD
! Display the progress on the standard output.
! .IP "\fB\-i\fR" 4
! .IX Item "-i"
  .PD 0
! .IP "\fB\-\-intermediate\-format\fR" 4
! .IX Item "--intermediate-format"
  .PD
! Output gcov file in an easy-to-parse intermediate text format that can
! be used by \fBlcov\fR or other tools. The output is a single
! \&\fI.gcov\fR file per \fI.gcda\fR file. No source code is required.
! .Sp
! The format of the intermediate \fI.gcov\fR file is plain text with
! one entry per line
! .Sp
! .Vb 4
! \&        file:<source_file_name>
! \&        function:<line_number>,<execution_count>,<function_name>
! \&        lcount:<line number>,<execution_count>
! \&        branch:<line_number>,<branch_coverage_type>
! \&        
! \&        Where the <branch_coverage_type> is
! \&           notexec (Branch not executed)
! \&           taken (Branch executed and taken)
! \&           nottaken (Branch executed, but not taken)
! \&        
! \&        There can be multiple <file> entries in an intermediate gcov
! \&        file. All entries following a <file> pertain to that source file
! \&        until the next <file> entry.
! .Ve
! .Sp
! Here is a sample when \fB\-i\fR is used in conjunction with \fB\-b\fR option:
! .Sp
! .Vb 9
! \&        file:array.cc
! \&        function:11,1,_Z3sumRKSt6vectorIPiSaIS0_EE
! \&        function:22,1,main
! \&        lcount:11,1
! \&        lcount:12,1
! \&        lcount:14,1
! \&        branch:14,taken
! \&        lcount:26,1
! \&        branch:28,nottaken
! .Ve
! .IP "\fB\-m\fR" 4
! .IX Item "-m"
  .PD 0
! .IP "\fB\-\-demangled\-names\fR" 4
! .IX Item "--demangled-names"
  .PD
! Display demangled function names in output. The default is to show
! mangled function names.
  .PP
  \&\fBgcov\fR should be run with the current directory the same as that
  when you invoked the compiler.  Otherwise it will not be able to locate
--- 387,420 ----
  .PD
  When branch probabilities are given, include those of unconditional branches.
  Unconditional branches are normally not interesting.
! .IP "\fB\-v\fR" 4
! .IX Item "-v"
  .PD 0
! .IP "\fB\-\-version\fR" 4
! .IX Item "--version"
  .PD
! Display the \fBgcov\fR version number (on the standard output),
! and exit without doing any further processing.
! .IP "\fB\-w\fR" 4
! .IX Item "-w"
  .PD 0
! .IP "\fB\-\-verbose\fR" 4
! .IX Item "--verbose"
  .PD
! Print verbose informations related to basic blocks and arcs.
! .IP "\fB\-x\fR" 4
! .IX Item "-x"
  .PD 0
! .IP "\fB\-\-hash\-filenames\fR" 4
! .IX Item "--hash-filenames"
  .PD
! By default, gcov uses the full pathname of the source files to to create
! an output filename.  This can lead to long filenames that can overflow
! filesystem limits.  This option creates names of the form
! \&\fI\fIsource-file\fI##\fImd5\fI.gcov\fR,
! where the \fIsource-file\fR component is the final filename part and
! the \fImd5\fR component is calculated from the full mangled name that
! would have been used otherwise.
  .PP
  \&\fBgcov\fR should be run with the current directory the same as that
  when you invoked the compiler.  Otherwise it will not be able to locate
*************** command line option.  The \fIexecution_c
*** 427,433 ****
  containing no code.  Unexecuted lines are marked \fB#####\fR or
  \&\fB====\fR, depending on whether they are reachable by
  non-exceptional paths or only exceptional paths such as \*(C+ exception
! handlers, respectively.
  .PP
  Some lines of information at the start have \fIline_number\fR of zero.
  These preamble lines are of the form
--- 444,452 ----
  containing no code.  Unexecuted lines are marked \fB#####\fR or
  \&\fB====\fR, depending on whether they are reachable by
  non-exceptional paths or only exceptional paths such as \*(C+ exception
! handlers, respectively. Given \fB\-a\fR option, unexecuted blocks are
! marked \fB$$$$$\fR or \fB%%%%%\fR, depending on whether a basic block
! is reachable via non-exceptional or exceptional paths.
  .PP
  Some lines of information at the start have \fIline_number\fR of zero.
  These preamble lines are of the form
*************** profiling code first attempts to read in
*** 639,645 ****
  the file doesn't match the executable (differing number of basic block
  counts) it will ignore the contents of the file.  It then adds in the
  new execution counts and finally writes the data to the file.
! .Sh "Using \fBgcov\fP with \s-1GCC\s0 Optimization"
  .IX Subsection "Using gcov with GCC Optimization"
  If you plan to use \fBgcov\fR to help optimize your code, you must
  first compile your program with two special \s-1GCC\s0 options:
--- 658,664 ----
  the file doesn't match the executable (differing number of basic block
  counts) it will ignore the contents of the file.  It then adds in the
  new execution counts and finally writes the data to the file.
! .SS "Using \fBgcov\fP with \s-1GCC\s0 Optimization"
  .IX Subsection "Using gcov with GCC Optimization"
  If you plan to use \fBgcov\fR to help optimize your code, you must
  first compile your program with two special \s-1GCC\s0 options:
diff -Nrcpad gcc-5.4.0/gcc/doc/gcov.texi gcc-5.5.0/gcc/doc/gcov.texi
*** gcc-5.4.0/gcc/doc/gcov.texi	Mon Feb 16 03:47:54 2015
--- gcc-5.5.0/gcc/doc/gcov.texi	Thu Jun 22 11:28:44 2017
*************** gpl(7), gfdl(7), fsf-funding(7), gcc(1)
*** 142,156 ****
  
  @c man begin OPTIONS
  @table @gcctabopt
- @item -h
- @itemx --help
- Display help about using @command{gcov} (on the standard output), and
- exit without doing any further processing.
- 
- @item -v
- @itemx --version
- Display the @command{gcov} version number (on the standard output),
- and exit without doing any further processing.
  
  @item -a
  @itemx --all-blocks
--- 142,147 ----
*************** be shown, unless the @option{-u} option
*** 171,238 ****
  Write branch frequencies as the number of branches taken, rather than
  the percentage of branches taken.
  
! @item -n
! @itemx --no-output
! Do not create the @command{gcov} output file.
! 
! @item -l
! @itemx --long-file-names
! Create long file names for included source files.  For example, if the
! header file @file{x.h} contains code, and was included in the file
! @file{a.c}, then running @command{gcov} on the file @file{a.c} will
! produce an output file called @file{a.c##x.h.gcov} instead of
! @file{x.h.gcov}.  This can be useful if @file{x.h} is included in
! multiple source files and you want to see the individual
! contributions.  If you use the @samp{-p} option, both the including
! and included file names will be complete path names.
! 
! @item -p
! @itemx --preserve-paths
! Preserve complete path information in the names of generated
! @file{.gcov} files.  Without this option, just the filename component is
! used.  With this option, all directories are used, with @samp{/} characters
! translated to @samp{#} characters, @file{.} directory components
! removed and unremoveable @file{..}
! components renamed to @samp{^}.  This is useful if sourcefiles are in several
! different directories.
! 
! @item -r
! @itemx --relative-only
! Only output information about source files with a relative pathname
! (after source prefix elision).  Absolute paths are usually system
! header files and coverage of any inline functions therein is normally
! uninteresting.
  
  @item -f
  @itemx --function-summaries
  Output summaries for each function in addition to the file level summary.
  
! @item -o @var{directory|file}
! @itemx --object-directory @var{directory}
! @itemx --object-file @var{file}
! Specify either the directory containing the gcov data files, or the
! object path name.  The @file{.gcno}, and
! @file{.gcda} data files are searched for using this option.  If a directory
! is specified, the data files are in that directory and named after the
! input file name, without its extension.  If a file is specified here,
! the data files are named after that file, without its extension.
! 
! @item -s @var{directory}
! @itemx --source-prefix @var{directory}
! A prefix for source file names to remove when generating the output
! coverage files.  This option is useful when building in a separate
! directory, and the pathname to the source directory is not wanted when
! determining the output file names.  Note that this prefix detection is
! applied before determining whether the source file is absolute.
! 
! @item -u
! @itemx --unconditional-branches
! When branch probabilities are given, include those of unconditional branches.
! Unconditional branches are normally not interesting.
! 
! @item -d
! @itemx --display-progress
! Display the progress on the standard output.
  
  @item -i
  @itemx --intermediate-format
--- 162,179 ----
  Write branch frequencies as the number of branches taken, rather than
  the percentage of branches taken.
  
! @item -d
! @itemx --display-progress
! Display the progress on the standard output.
  
  @item -f
  @itemx --function-summaries
  Output summaries for each function in addition to the file level summary.
  
! @item -h
! @itemx --help
! Display help about using @command{gcov} (on the standard output), and
! exit without doing any further processing.
  
  @item -i
  @itemx --intermediate-format
*************** lcount:26,1
*** 273,283 ****
--- 214,298 ----
  branch:28,nottaken
  @end smallexample
  
+ @item -l
+ @itemx --long-file-names
+ Create long file names for included source files.  For example, if the
+ header file @file{x.h} contains code, and was included in the file
+ @file{a.c}, then running @command{gcov} on the file @file{a.c} will
+ produce an output file called @file{a.c##x.h.gcov} instead of
+ @file{x.h.gcov}.  This can be useful if @file{x.h} is included in
+ multiple source files and you want to see the individual
+ contributions.  If you use the @samp{-p} option, both the including
+ and included file names will be complete path names.
+ 
  @item -m
  @itemx --demangled-names
  Display demangled function names in output. The default is to show
  mangled function names.
  
+ @item -n
+ @itemx --no-output
+ Do not create the @command{gcov} output file.
+ 
+ @item -o @var{directory|file}
+ @itemx --object-directory @var{directory}
+ @itemx --object-file @var{file}
+ Specify either the directory containing the gcov data files, or the
+ object path name.  The @file{.gcno}, and
+ @file{.gcda} data files are searched for using this option.  If a directory
+ is specified, the data files are in that directory and named after the
+ input file name, without its extension.  If a file is specified here,
+ the data files are named after that file, without its extension.
+ 
+ @item -p
+ @itemx --preserve-paths
+ Preserve complete path information in the names of generated
+ @file{.gcov} files.  Without this option, just the filename component is
+ used.  With this option, all directories are used, with @samp{/} characters
+ translated to @samp{#} characters, @file{.} directory components
+ removed and unremoveable @file{..}
+ components renamed to @samp{^}.  This is useful if sourcefiles are in several
+ different directories.
+ 
+ @item -r
+ @itemx --relative-only
+ Only output information about source files with a relative pathname
+ (after source prefix elision).  Absolute paths are usually system
+ header files and coverage of any inline functions therein is normally
+ uninteresting.
+ 
+ @item -s @var{directory}
+ @itemx --source-prefix @var{directory}
+ A prefix for source file names to remove when generating the output
+ coverage files.  This option is useful when building in a separate
+ directory, and the pathname to the source directory is not wanted when
+ determining the output file names.  Note that this prefix detection is
+ applied before determining whether the source file is absolute.
+ 
+ @item -u
+ @itemx --unconditional-branches
+ When branch probabilities are given, include those of unconditional branches.
+ Unconditional branches are normally not interesting.
+ 
+ @item -v
+ @itemx --version
+ Display the @command{gcov} version number (on the standard output),
+ and exit without doing any further processing.
+ 
+ @item -w
+ @itemx --verbose
+ Print verbose informations related to basic blocks and arcs.
+ 
+ @item -x
+ @itemx --hash-filenames
+ By default, gcov uses the full pathname of the source files to to create
+ an output filename.  This can lead to long filenames that can overflow
+ filesystem limits.  This option creates names of the form
+ @file{@var{source-file}##@var{md5}.gcov},
+ where the @var{source-file} component is the final filename part and
+ the @var{md5} component is calculated from the full mangled name that
+ would have been used otherwise.
+ 
  @end table
  
  @command{gcov} should be run with the current directory the same as that
*************** command line option.  The @var{execution
*** 308,314 ****
  containing no code.  Unexecuted lines are marked @samp{#####} or
  @samp{====}, depending on whether they are reachable by
  non-exceptional paths or only exceptional paths such as C++ exception
! handlers, respectively.
  
  Some lines of information at the start have @var{line_number} of zero.
  These preamble lines are of the form
--- 323,331 ----
  containing no code.  Unexecuted lines are marked @samp{#####} or
  @samp{====}, depending on whether they are reachable by
  non-exceptional paths or only exceptional paths such as C++ exception
! handlers, respectively. Given @samp{-a} option, unexecuted blocks are
! marked @samp{$$$$$} or @samp{%%%%%}, depending on whether a basic block
! is reachable via non-exceptional or exceptional paths.
  
  Some lines of information at the start have @var{line_number} of zero.
  These preamble lines are of the form
*************** it.  This can be overcome by, for exampl
*** 653,657 ****
  setting will name the data file @file{/target/run/build/foo.gcda}.
  
  You must move the data files to the expected directory tree in order to
! use them for profile directed optimizations (@option{--use-profile}), or to
  use the @command{gcov} tool.
--- 670,674 ----
  setting will name the data file @file{/target/run/build/foo.gcda}.
  
  You must move the data files to the expected directory tree in order to
! use them for profile directed optimizations (@option{-fprofile-use}), or to
  use the @command{gcov} tool.
diff -Nrcpad gcc-5.4.0/gcc/doc/generic.texi gcc-5.5.0/gcc/doc/generic.texi
*** gcc-5.4.0/gcc/doc/generic.texi	Thu Jan 15 20:11:12 2015
--- gcc-5.5.0/gcc/doc/generic.texi	Sat Jan 21 22:04:31 2017
*************** This tree has one field that holds the n
*** 3238,3244 ****
  @end smallexample
  
  Detailed description for usage and functionality of @code{_Cilk_spawn} can be 
! found at http://www.cilkplus.org
  
  @item CILK_SYNC_STMT
  
--- 3238,3244 ----
  @end smallexample
  
  Detailed description for usage and functionality of @code{_Cilk_spawn} can be 
! found at @uref{https://www.cilkplus.org}.
  
  @item CILK_SYNC_STMT
  
diff -Nrcpad gcc-5.4.0/gcc/doc/gfdl.7 gcc-5.5.0/gcc/doc/gfdl.7
*** gcc-5.4.0/gcc/doc/gfdl.7	Fri Jun  3 08:54:13 2016
--- gcc-5.5.0/gcc/doc/gfdl.7	Tue Oct 10 08:23:54 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GFDL 7"
! .TH GFDL 7 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GFDL 7"
! .TH GFDL 7 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
***************
*** 141,149 ****
  gfdl \- GNU Free Documentation License
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! .Sh "\s-1GNU\s0 Free Documentation License"
  .IX Subsection "GNU Free Documentation License"
! .Sh "Version 1.3, 3 November 2008"
  .IX Subsection "Version 1.3, 3 November 2008"
  .Vb 2
  \&        Copyright (c) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
--- 138,146 ----
  gfdl \- GNU Free Documentation License
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! .SS "\s-1GNU\s0 Free Documentation License"
  .IX Subsection "GNU Free Documentation License"
! .SS "Version 1.3, 3 November 2008"
  .IX Subsection "Version 1.3, 3 November 2008"
  .Vb 2
  \&        Copyright (c) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
*************** whether it is published as a printed boo
*** 178,184 ****
  principally for works whose purpose is instruction or reference.
  .IP "1." 4
  .IX Item "1."
! \&\s-1APPLICABILITY\s0 \s-1AND\s0 \s-1DEFINITIONS\s0
  .Sp
  This License applies to any manual or other work, in any medium, that
  contains a notice placed by the copyright holder saying it can be
--- 175,181 ----
  principally for works whose purpose is instruction or reference.
  .IP "1." 4
  .IX Item "1."
! \&\s-1APPLICABILITY AND DEFINITIONS\s0
  .Sp
  This License applies to any manual or other work, in any medium, that
  contains a notice placed by the copyright holder saying it can be
*************** of text.  A copy that is not \*(L"Transp
*** 234,246 ****
  Examples of suitable formats for Transparent copies include plain
  \&\s-1ASCII\s0 without markup, Texinfo input format, LaTeX input
  format, \s-1SGML\s0 or \s-1XML\s0 using a publicly available
! \&\s-1DTD\s0, and standard-conforming simple \s-1HTML\s0,
  PostScript or \s-1PDF\s0 designed for human modification.  Examples
! of transparent image formats include \s-1PNG\s0, \s-1XCF\s0 and
! \&\s-1JPG\s0.  Opaque formats include proprietary formats that can be
  read and edited only by proprietary word processors, \s-1SGML\s0 or
  \&\s-1XML\s0 for which the \s-1DTD\s0 and/or processing tools are
! not generally available, and the machine-generated \s-1HTML\s0,
  PostScript or \s-1PDF\s0 produced by some word processors for
  output purposes only.
  .Sp
--- 231,243 ----
  Examples of suitable formats for Transparent copies include plain
  \&\s-1ASCII\s0 without markup, Texinfo input format, LaTeX input
  format, \s-1SGML\s0 or \s-1XML\s0 using a publicly available
! \&\s-1DTD,\s0 and standard-conforming simple \s-1HTML,\s0
  PostScript or \s-1PDF\s0 designed for human modification.  Examples
! of transparent image formats include \s-1PNG, XCF\s0 and
! \&\s-1JPG.\s0  Opaque formats include proprietary formats that can be
  read and edited only by proprietary word processors, \s-1SGML\s0 or
  \&\s-1XML\s0 for which the \s-1DTD\s0 and/or processing tools are
! not generally available, and the machine-generated \s-1HTML,\s0
  PostScript or \s-1PDF\s0 produced by some word processors for
  output purposes only.
  .Sp
*************** preceding the beginning of the body of t
*** 254,266 ****
  The \*(L"publisher\*(R" means any person or entity that distributes copies
  of the Document to the public.
  .Sp
! A section \*(L"Entitled \s-1XYZ\s0\*(R" means a named subunit of the Document whose
  title either is precisely \s-1XYZ\s0 or contains \s-1XYZ\s0 in parentheses following
  text that translates \s-1XYZ\s0 in another language.  (Here \s-1XYZ\s0 stands for a
  specific section name mentioned below, such as \*(L"Acknowledgements\*(R",
  \&\*(L"Dedications\*(R", \*(L"Endorsements\*(R", or \*(L"History\*(R".)  To \*(L"Preserve the Title\*(R"
  of such a section when you modify the Document means that it remains a
! section \*(L"Entitled \s-1XYZ\s0\*(R" according to this definition.
  .Sp
  The Document may include Warranty Disclaimers next to the notice which
  states that this License applies to the Document.  These Warranty
--- 251,263 ----
  The \*(L"publisher\*(R" means any person or entity that distributes copies
  of the Document to the public.
  .Sp
! A section \*(L"Entitled \s-1XYZ\*(R"\s0 means a named subunit of the Document whose
  title either is precisely \s-1XYZ\s0 or contains \s-1XYZ\s0 in parentheses following
  text that translates \s-1XYZ\s0 in another language.  (Here \s-1XYZ\s0 stands for a
  specific section name mentioned below, such as \*(L"Acknowledgements\*(R",
  \&\*(L"Dedications\*(R", \*(L"Endorsements\*(R", or \*(L"History\*(R".)  To \*(L"Preserve the Title\*(R"
  of such a section when you modify the Document means that it remains a
! section \*(L"Entitled \s-1XYZ\*(R"\s0 according to this definition.
  .Sp
  The Document may include Warranty Disclaimers next to the notice which
  states that this License applies to the Document.  These Warranty
*************** implication that these Warranty Disclaim
*** 270,276 ****
  no effect on the meaning of this License.
  .IP "2." 4
  .IX Item "2."
! \&\s-1VERBATIM\s0 \s-1COPYING\s0
  .Sp
  You may copy and distribute the Document in any medium, either
  commercially or noncommercially, provided that this License, the
--- 267,273 ----
  no effect on the meaning of this License.
  .IP "2." 4
  .IX Item "2."
! \&\s-1VERBATIM COPYING\s0
  .Sp
  You may copy and distribute the Document in any medium, either
  commercially or noncommercially, provided that this License, the
*************** You may also lend copies, under the same
*** 286,292 ****
  you may publicly display copies.
  .IP "3." 4
  .IX Item "3."
! \&\s-1COPYING\s0 \s-1IN\s0 \s-1QUANTITY\s0
  .Sp
  If you publish printed copies (or copies in media that commonly have
  printed covers) of the Document, numbering more than 100, and the
--- 283,289 ----
  you may publicly display copies.
  .IP "3." 4
  .IX Item "3."
! \&\s-1COPYING IN QUANTITY\s0
  .Sp
  If you publish printed copies (or copies in media that commonly have
  printed covers) of the Document, numbering more than 100, and the
*************** imply endorsement of any Modified Versio
*** 442,448 ****
  .RE
  .IP "5." 4
  .IX Item "5."
! \&\s-1COMBINING\s0 \s-1DOCUMENTS\s0
  .Sp
  You may combine the Document with other documents released under this
  License, under the terms defined in section 4 above for modified
--- 439,445 ----
  .RE
  .IP "5." 4
  .IX Item "5."
! \&\s-1COMBINING DOCUMENTS\s0
  .Sp
  You may combine the Document with other documents released under this
  License, under the terms defined in section 4 above for modified
*************** and any sections Entitled \*(L"Dedicatio
*** 467,473 ****
  sections Entitled \*(L"Endorsements.\*(R"
  .IP "6." 4
  .IX Item "6."
! \&\s-1COLLECTIONS\s0 \s-1OF\s0 \s-1DOCUMENTS\s0
  .Sp
  You may make a collection consisting of the Document and other documents
  released under this License, and replace the individual copies of this
--- 464,470 ----
  sections Entitled \*(L"Endorsements.\*(R"
  .IP "6." 4
  .IX Item "6."
! \&\s-1COLLECTIONS OF DOCUMENTS\s0
  .Sp
  You may make a collection consisting of the Document and other documents
  released under this License, and replace the individual copies of this
*************** License into the extracted document, and
*** 481,487 ****
  other respects regarding verbatim copying of that document.
  .IP "7." 4
  .IX Item "7."
! \&\s-1AGGREGATION\s0 \s-1WITH\s0 \s-1INDEPENDENT\s0 \s-1WORKS\s0
  .Sp
  A compilation of the Document or its derivatives with other separate
  and independent documents or works, in or on a volume of a storage or
--- 478,484 ----
  other respects regarding verbatim copying of that document.
  .IP "7." 4
  .IX Item "7."
! \&\s-1AGGREGATION WITH INDEPENDENT WORKS\s0
  .Sp
  A compilation of the Document or its derivatives with other separate
  and independent documents or works, in or on a volume of a storage or
*************** reinstated, receipt of a copy of some or
*** 550,556 ****
  not give you any rights to use it.
  .IP "10." 4
  .IX Item "10."
! \&\s-1FUTURE\s0 \s-1REVISIONS\s0 \s-1OF\s0 \s-1THIS\s0 \s-1LICENSE\s0
  .Sp
  The Free Software Foundation may publish new, revised versions
  of the \s-1GNU\s0 Free Documentation License from time to time.  Such new
--- 547,553 ----
  not give you any rights to use it.
  .IP "10." 4
  .IX Item "10."
! \&\s-1FUTURE REVISIONS OF THIS LICENSE\s0
  .Sp
  The Free Software Foundation may publish new, revised versions
  of the \s-1GNU\s0 Free Documentation License from time to time.  Such new
*************** Document.
*** 578,584 ****
  World Wide Web server that publishes copyrightable works and also
  provides prominent facilities for anybody to edit those works.  A
  public wiki that anybody can edit is an example of such a server.  A
! \&\*(L"Massive Multiauthor Collaboration\*(R" (or \*(L"\s-1MMC\s0\*(R") contained in the
  site means any set of copyrightable works thus published on the \s-1MMC\s0
  site.
  .Sp
--- 575,581 ----
  World Wide Web server that publishes copyrightable works and also
  provides prominent facilities for anybody to edit those works.  A
  public wiki that anybody can edit is an example of such a server.  A
! \&\*(L"Massive Multiauthor Collaboration\*(R" (or \*(L"\s-1MMC\*(R"\s0) contained in the
  site means any set of copyrightable works thus published on the \s-1MMC\s0
  site.
  .Sp
*************** in part, as part of another Document.
*** 593,606 ****
  .Sp
  An \s-1MMC\s0 is \*(L"eligible for relicensing\*(R" if it is licensed under this
  License, and if all works that were first published under this License
! somewhere other than this \s-1MMC\s0, and subsequently incorporated in whole
! or in part into the \s-1MMC\s0, (1) had no cover texts or invariant sections,
  and (2) were thus incorporated prior to November 1, 2008.
  .Sp
  The operator of an \s-1MMC\s0 Site may republish an \s-1MMC\s0 contained in the site
  under CC-BY-SA on the same site at any time before August 1, 2009,
  provided the \s-1MMC\s0 is eligible for relicensing.
! .Sh "\s-1ADDENDUM:\s0 How to use this License for your documents"
  .IX Subsection "ADDENDUM: How to use this License for your documents"
  To use this License in a document you have written, include a copy of
  the License in the document and put the following copyright and
--- 590,603 ----
  .Sp
  An \s-1MMC\s0 is \*(L"eligible for relicensing\*(R" if it is licensed under this
  License, and if all works that were first published under this License
! somewhere other than this \s-1MMC,\s0 and subsequently incorporated in whole
! or in part into the \s-1MMC,\s0 (1) had no cover texts or invariant sections,
  and (2) were thus incorporated prior to November 1, 2008.
  .Sp
  The operator of an \s-1MMC\s0 Site may republish an \s-1MMC\s0 contained in the site
  under CC-BY-SA on the same site at any time before August 1, 2009,
  provided the \s-1MMC\s0 is eligible for relicensing.
! .SS "\s-1ADDENDUM:\s0 How to use this License for your documents"
  .IX Subsection "ADDENDUM: How to use this License for your documents"
  To use this License in a document you have written, include a copy of
  the License in the document and put the following copyright and
diff -Nrcpad gcc-5.4.0/gcc/doc/gfortran.1 gcc-5.5.0/gcc/doc/gfortran.1
*** gcc-5.4.0/gcc/doc/gfortran.1	Fri Jun  3 10:32:25 2016
--- gcc-5.5.0/gcc/doc/gfortran.1	Tue Oct 10 09:40:27 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GFORTRAN 1"
! .TH GFORTRAN 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GFORTRAN 1"
! .TH GFORTRAN 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** by type.  Explanations are in the follow
*** 232,238 ****
  \&\-fno\-automatic \-fno\-protect\-parens \-fno\-underscoring 
  \&\-fsecond\-underscore \-fpack\-derived \-frealloc\-lhs \-frecursive 
  \&\-frepack\-arrays \-fshort\-enums \-fstack\-arrays\fR
! .Sh "Options controlling Fortran dialect"
  .IX Subsection "Options controlling Fortran dialect"
  The following options control the details of the Fortran dialect
  accepted by the compiler:
--- 229,235 ----
  \&\-fno\-automatic \-fno\-protect\-parens \-fno\-underscoring 
  \&\-fsecond\-underscore \-fpack\-derived \-frealloc\-lhs \-frecursive 
  \&\-frepack\-arrays \-fshort\-enums \-fstack\-arrays\fR
! .SS "Options controlling Fortran dialect"
  .IX Subsection "Options controlling Fortran dialect"
  The following options control the details of the Fortran dialect
  accepted by the compiler:
*************** backslash character to \*(L"C\-style\*(R
*** 278,284 ****
  combinations are expanded \f(CW\*(C`\ea\*(C'\fR, \f(CW\*(C`\eb\*(C'\fR, \f(CW\*(C`\ef\*(C'\fR, \f(CW\*(C`\en\*(C'\fR,
  \&\f(CW\*(C`\er\*(C'\fR, \f(CW\*(C`\et\*(C'\fR, \f(CW\*(C`\ev\*(C'\fR, \f(CW\*(C`\e\e\*(C'\fR, and \f(CW\*(C`\e0\*(C'\fR to the \s-1ASCII\s0
  characters alert, backspace, form feed, newline, carriage return,
! horizontal tab, vertical tab, backslash, and \s-1NUL\s0, respectively.
  Additionally, \f(CW\*(C`\ex\*(C'\fR\fInn\fR, \f(CW\*(C`\eu\*(C'\fR\fInnnn\fR and
  \&\f(CW\*(C`\eU\*(C'\fR\fInnnnnnnn\fR (where each \fIn\fR is a hexadecimal digit) are
  translated into the Unicode characters corresponding to the specified code
--- 275,281 ----
  combinations are expanded \f(CW\*(C`\ea\*(C'\fR, \f(CW\*(C`\eb\*(C'\fR, \f(CW\*(C`\ef\*(C'\fR, \f(CW\*(C`\en\*(C'\fR,
  \&\f(CW\*(C`\er\*(C'\fR, \f(CW\*(C`\et\*(C'\fR, \f(CW\*(C`\ev\*(C'\fR, \f(CW\*(C`\e\e\*(C'\fR, and \f(CW\*(C`\e0\*(C'\fR to the \s-1ASCII\s0
  characters alert, backspace, form feed, newline, carriage return,
! horizontal tab, vertical tab, backslash, and \s-1NUL,\s0 respectively.
  Additionally, \f(CW\*(C`\ex\*(C'\fR\fInn\fR, \f(CW\*(C`\eu\*(C'\fR\fInnnn\fR and
  \&\f(CW\*(C`\eU\*(C'\fR\fInnnnnnnn\fR (where each \fIn\fR is a hexadecimal digit) are
  translated into the Unicode characters corresponding to the specified code
*************** compilation sentinels in free form and \
*** 333,339 ****
  OpenACC runtime library to be linked in.
  .Sp
  Note that this is an experimental feature, incomplete, and subject to
! change in future versions of \s-1GCC\s0.  See
  <\fBhttps://gcc.gnu.org/wiki/OpenACC\fR> for more information.
  .IP "\fB\-fopenmp\fR" 4
  .IX Item "-fopenmp"
--- 330,336 ----
  OpenACC runtime library to be linked in.
  .Sp
  Note that this is an experimental feature, incomplete, and subject to
! change in future versions of \s-1GCC.\s0  See
  <\fBhttps://gcc.gnu.org/wiki/OpenACC\fR> for more information.
  .IP "\fB\-fopenmp\fR" 4
  .IX Item "-fopenmp"
*************** language standard, and warnings are give
*** 428,435 ****
  that are permitted but obsolescent in later standards. \fB\-std=f2008ts\fR
  allows the Fortran 2008 standard including the additions of the 
  Technical Specification (\s-1TS\s0) 29113 on Further Interoperability of Fortran
! with C and \s-1TS\s0 18508 on Additional Parallel Features in Fortran.
! .Sh "Enable and customize preprocessing"
  .IX Subsection "Enable and customize preprocessing"
  Preprocessor related options. See section 
  \&\fBPreprocessing and conditional compilation\fR for more detailed
--- 425,432 ----
  that are permitted but obsolescent in later standards. \fB\-std=f2008ts\fR
  allows the Fortran 2008 standard including the additions of the 
  Technical Specification (\s-1TS\s0) 29113 on Further Interoperability of Fortran
! with C and \s-1TS 18508\s0 on Additional Parallel Features in Fortran.
! .SS "Enable and customize preprocessing"
  .IX Subsection "Enable and customize preprocessing"
  Preprocessor related options. See section 
  \&\fBPreprocessing and conditional compilation\fR for more detailed
*************** by the linemarkers.
*** 617,623 ****
  .IX Item "-Uname"
  Cancel any previous definition of \fIname\fR, either built in or provided
  with a \fB\-D\fR option.
! .Sh "Options to request or suppress errors and warnings"
  .IX Subsection "Options to request or suppress errors and warnings"
  Errors are diagnostic messages that report that the \s-1GNU\s0 Fortran compiler
  cannot compile the relevant piece of source code.  The compiler will
--- 614,620 ----
  .IX Item "-Uname"
  Cancel any previous definition of \fIname\fR, either built in or provided
  with a \fB\-D\fR option.
! .SS "Options to request or suppress errors and warnings"
  .IX Subsection "Options to request or suppress errors and warnings"
  Errors are diagnostic messages that report that the \s-1GNU\s0 Fortran compiler
  cannot compile the relevant piece of source code.  The compiler will
*************** While technically legal these usually in
*** 772,781 ****
  This currently produces a warning under the following circumstances:
  .RS 4
  .IP "*" 4
! An \s-1INTEGER\s0 \s-1SELECT\s0 construct has a \s-1CASE\s0 that can never be matched as its
  lower value is greater than its upper value.
  .IP "*" 4
! A \s-1LOGICAL\s0 \s-1SELECT\s0 construct has three \s-1CASE\s0 statements.
  .IP "*" 4
  A \s-1TRANSFER\s0 specifies a source that is shorter than the destination.
  .IP "*" 4
--- 769,778 ----
  This currently produces a warning under the following circumstances:
  .RS 4
  .IP "*" 4
! An \s-1INTEGER SELECT\s0 construct has a \s-1CASE\s0 that can never be matched as its
  lower value is greater than its upper value.
  .IP "*" 4
! A \s-1LOGICAL SELECT\s0 construct has three \s-1CASE\s0 statements.
  .IP "*" 4
  A \s-1TRANSFER\s0 specifies a source that is shorter than the destination.
  .IP "*" 4
*************** time.  This option is implied by \fB\-Wa
*** 860,866 ****
  Turns all warnings into errors.
  .PP
  Some of these have no effect when compiling programs written in Fortran.
! .Sh "Options for debugging your program or \s-1GNU\s0 Fortran"
  .IX Subsection "Options for debugging your program or GNU Fortran"
  \&\s-1GNU\s0 Fortran has various special options that are used for debugging
  either your program or the \s-1GNU\s0 Fortran compiler.
--- 857,863 ----
  Turns all warnings into errors.
  .PP
  Some of these have no effect when compiling programs written in Fortran.
! .SS "Options for debugging your program or \s-1GNU\s0 Fortran"
  .IX Subsection "Options for debugging your program or GNU Fortran"
  \&\s-1GNU\s0 Fortran has various special options that are used for debugging
  either your program or the \s-1GNU\s0 Fortran compiler.
*************** exceptions: \fBinvalid\fR (invalid float
*** 892,899 ****
  in a floating point operation), \fBinexact\fR (loss of precision
  during operation), and \fBdenormal\fR (operation performed on a
  denormal value).  The first five exceptions correspond to the five
! \&\s-1IEEE\s0 754 exceptions, whereas the last one (\fBdenormal\fR) is not
! part of the \s-1IEEE\s0 754 standard but is available on some common
  architectures such as x86.
  .Sp
  The first three exceptions (\fBinvalid\fR, \fBzero\fR, and
--- 889,896 ----
  in a floating point operation), \fBinexact\fR (loss of precision
  during operation), and \fBdenormal\fR (operation performed on a
  denormal value).  The first five exceptions correspond to the five
! \&\s-1IEEE 754\s0 exceptions, whereas the last one (\fBdenormal\fR) is not
! part of the \s-1IEEE 754\s0 standard but is available on some common
  architectures such as x86.
  .Sp
  The first three exceptions (\fBinvalid\fR, \fBzero\fR, and
*************** action \fBcore\fR), the Fortran runtime
*** 925,931 ****
  backtrace of the error. \f(CW\*(C`\-fno\-backtrace\*(C'\fR disables the backtrace
  generation. This option only has influence for compilation of the
  Fortran main program.
! .Sh "Options for directory search"
  .IX Subsection "Options for directory search"
  These options affect how \s-1GNU\s0 Fortran searches
  for files specified by the \f(CW\*(C`INCLUDE\*(C'\fR directive and where it searches
--- 922,928 ----
  backtrace of the error. \f(CW\*(C`\-fno\-backtrace\*(C'\fR disables the backtrace
  generation. This option only has influence for compilation of the
  Fortran main program.
! .SS "Options for directory search"
  .IX Subsection "Options for directory search"
  These options affect how \s-1GNU\s0 Fortran searches
  for files specified by the \f(CW\*(C`INCLUDE\*(C'\fR directive and where it searches
*************** The default is the current directory.
*** 957,963 ****
  .IX Item "-fintrinsic-modules-path dir"
  This option specifies the location of pre-compiled intrinsic modules, if
  they are not in the default location expected by the compiler.
! .Sh "Influencing the linking step"
  .IX Subsection "Influencing the linking step"
  These options come into play when the compiler links object files into an 
  executable output file. They are meaningless if the compiler is not doing 
--- 954,960 ----
  .IX Item "-fintrinsic-modules-path dir"
  This option specifies the location of pre-compiled intrinsic modules, if
  they are not in the default location expected by the compiler.
! .SS "Influencing the linking step"
  .IX Subsection "Influencing the linking step"
  These options come into play when the compiler links object files into an 
  executable output file. They are meaningless if the compiler is not doing 
*************** On systems that provide \fIlibgfortran\f
*** 968,974 ****
  library, this option forces the use of the static version. If no
  shared version of \fIlibgfortran\fR was built when the compiler was
  configured, this option has no effect.
! .Sh "Influencing runtime behavior"
  .IX Subsection "Influencing runtime behavior"
  These options affect the runtime behavior of programs compiled with \s-1GNU\s0 Fortran.
  .IP "\fB\-fconvert=\fR\fIconversion\fR" 4
--- 965,971 ----
  library, this option forces the use of the static version. If no
  shared version of \fIlibgfortran\fR was built when the compiler was
  configured, this option has no effect.
! .SS "Influencing runtime behavior"
  .IX Subsection "Influencing runtime behavior"
  These options affect the runtime behavior of programs compiled with \s-1GNU\s0 Fortran.
  .IP "\fB\-fconvert=\fR\fIconversion\fR" 4
*************** negative in the \f(CW\*(C`SIGN\*(C'\fR i
*** 1003,1009 ****
  print the negative sign of zero values (or values rounded to zero for I/O)
  and regards zero as positive number in the \f(CW\*(C`SIGN\*(C'\fR intrinsic for
  compatibility with Fortran 77. The default is \fB\-fsign\-zero\fR.
! .Sh "Options for code generation conventions"
  .IX Subsection "Options for code generation conventions"
  These machine-independent options control the interface conventions
  used in code generation.
--- 1000,1006 ----
  print the negative sign of zero values (or values rounded to zero for I/O)
  and regards zero as positive number in the \f(CW\*(C`SIGN\*(C'\fR intrinsic for
  compatibility with Fortran 77. The default is \fB\-fsign\-zero\fR.
! .SS "Options for code generation conventions"
  .IX Subsection "Options for code generation conventions"
  These machine-independent options control the interface conventions
  used in code generation.
*************** extra argument in the calling sequence t
*** 1035,1041 ****
  store the return value.  Under the default \s-1GNU\s0 calling conventions, such
  functions simply return their results as they would in \s-1GNU\s0
  C\-\-\-default \f(CW\*(C`REAL\*(C'\fR functions return the C type \f(CW\*(C`float\*(C'\fR, and
! \&\f(CW\*(C`COMPLEX\*(C'\fR functions return the \s-1GNU\s0 C type \f(CW\*(C`complex\*(C'\fR.
  Additionally, this option implies the \fB\-fsecond\-underscore\fR
  option, unless \fB\-fno\-second\-underscore\fR is explicitly requested.
  .Sp
--- 1032,1038 ----
  store the return value.  Under the default \s-1GNU\s0 calling conventions, such
  functions simply return their results as they would in \s-1GNU\s0
  C\-\-\-default \f(CW\*(C`REAL\*(C'\fR functions return the C type \f(CW\*(C`float\*(C'\fR, and
! \&\f(CW\*(C`COMPLEX\*(C'\fR functions return the \s-1GNU C\s0 type \f(CW\*(C`complex\*(C'\fR.
  Additionally, this option implies the \fB\-fsecond\-underscore\fR
  option, unless \fB\-fno\-second\-underscore\fR is explicitly requested.
  .Sp
diff -Nrcpad gcc-5.4.0/gcc/doc/gij.1 gcc-5.5.0/gcc/doc/gij.1
*** gcc-5.4.0/gcc/doc/gij.1	Fri Jun  3 10:15:09 2016
--- gcc-5.5.0/gcc/doc/gij.1	Tue Oct 10 09:24:11 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GIJ 1"
! .TH GIJ 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GIJ 1"
! .TH GIJ 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/gcc/doc/gpl.7 gcc-5.5.0/gcc/doc/gpl.7
*** gcc-5.4.0/gcc/doc/gpl.7	Fri Jun  3 10:32:25 2016
--- gcc-5.5.0/gcc/doc/gpl.7	Tue Oct 10 09:40:26 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GPL 7"
! .TH GPL 7 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GPL 7"
! .TH GPL 7 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
***************
*** 141,149 ****
  gpl \- GNU General Public License
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! .Sh "\s-1GNU\s0 General Public License"
  .IX Subsection "GNU General Public License"
! .Sh "Version 3, 29 June 2007"
  .IX Subsection "Version 3, 29 June 2007"
  .Vb 1
  \&        Copyright (c) 2007 Free Software Foundation, Inc. <http://fsf.org/>
--- 138,146 ----
  gpl \- GNU General Public License
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
! .SS "\s-1GNU\s0 General Public License"
  .IX Subsection "GNU General Public License"
! .SS "Version 3, 29 June 2007"
  .IX Subsection "Version 3, 29 June 2007"
  .Vb 1
  \&        Copyright (c) 2007 Free Software Foundation, Inc. <http://fsf.org/>
*************** gpl \- GNU General Public License
*** 151,157 ****
  \&        Everyone is permitted to copy and distribute verbatim copies of this
  \&        license document, but changing it is not allowed.
  .Ve
! .Sh "Preamble"
  .IX Subsection "Preamble"
  The \s-1GNU\s0 General Public License is a free, copyleft license for
  software and other kinds of works.
--- 148,154 ----
  \&        Everyone is permitted to copy and distribute verbatim copies of this
  \&        license document, but changing it is not allowed.
  .Ve
! .SS "Preamble"
  .IX Subsection "Preamble"
  The \s-1GNU\s0 General Public License is a free, copyleft license for
  software and other kinds of works.
*************** freedoms that you received.  You must ma
*** 184,190 ****
  receive or can get the source code.  And you must show them these
  terms so they know their rights.
  .PP
! Developers that use the \s-1GNU\s0 \s-1GPL\s0 protect your rights with two steps:
  (1) assert copyright on the software, and (2) offer you this License
  giving you legal permission to copy, distribute and/or modify it.
  .PP
--- 181,187 ----
  receive or can get the source code.  And you must show them these
  terms so they know their rights.
  .PP
! Developers that use the \s-1GNU GPL\s0 protect your rights with two steps:
  (1) assert copyright on the software, and (2) offer you this License
  giving you legal permission to copy, distribute and/or modify it.
  .PP
*************** individuals to use, which is precisely w
*** 203,209 ****
  Therefore, we have designed this version of the \s-1GPL\s0 to prohibit the
  practice for those products.  If such problems arise substantially in
  other domains, we stand ready to extend this provision to those
! domains in future versions of the \s-1GPL\s0, as needed to protect the
  freedom of users.
  .PP
  Finally, every program is threatened constantly by software patents.
--- 200,206 ----
  Therefore, we have designed this version of the \s-1GPL\s0 to prohibit the
  practice for those products.  If such problems arise substantially in
  other domains, we stand ready to extend this provision to those
! domains in future versions of the \s-1GPL,\s0 as needed to protect the
  freedom of users.
  .PP
  Finally, every program is threatened constantly by software patents.
*************** assures that patents cannot be used to r
*** 215,221 ****
  .PP
  The precise terms and conditions for copying, distribution and
  modification follow.
! .Sh "\s-1TERMS\s0 \s-1AND\s0 \s-1CONDITIONS\s0"
  .IX Subsection "TERMS AND CONDITIONS"
  .IP "0. Definitions." 4
  .IX Item "0. Definitions."
--- 212,218 ----
  .PP
  The precise terms and conditions for copying, distribution and
  modification follow.
! .SS "\s-1TERMS AND CONDITIONS\s0"
  .IX Subsection "TERMS AND CONDITIONS"
  .IP "0. Definitions." 4
  .IX Item "0. Definitions."
*************** author or copyright holder as a result o
*** 750,775 ****
  later version.
  .IP "15. Disclaimer of Warranty." 4
  .IX Item "15. Disclaimer of Warranty."
! \&\s-1THERE\s0 \s-1IS\s0 \s-1NO\s0 \s-1WARRANTY\s0 \s-1FOR\s0 \s-1THE\s0 \s-1PROGRAM\s0, \s-1TO\s0 \s-1THE\s0 \s-1EXTENT\s0 \s-1PERMITTED\s0 \s-1BY\s0
! \&\s-1APPLICABLE\s0 \s-1LAW\s0.  \s-1EXCEPT\s0 \s-1WHEN\s0 \s-1OTHERWISE\s0 \s-1STATED\s0 \s-1IN\s0 \s-1WRITING\s0 \s-1THE\s0 \s-1COPYRIGHT\s0
! \&\s-1HOLDERS\s0 \s-1AND/OR\s0 \s-1OTHER\s0 \s-1PARTIES\s0 \s-1PROVIDE\s0 \s-1THE\s0 \s-1PROGRAM\s0 \*(L"\s-1AS\s0 \s-1IS\s0\*(R" \s-1WITHOUT\s0
! \&\s-1WARRANTY\s0 \s-1OF\s0 \s-1ANY\s0 \s-1KIND\s0, \s-1EITHER\s0 \s-1EXPRESSED\s0 \s-1OR\s0 \s-1IMPLIED\s0, \s-1INCLUDING\s0, \s-1BUT\s0 \s-1NOT\s0
! \&\s-1LIMITED\s0 \s-1TO\s0, \s-1THE\s0 \s-1IMPLIED\s0 \s-1WARRANTIES\s0 \s-1OF\s0 \s-1MERCHANTABILITY\s0 \s-1AND\s0 \s-1FITNESS\s0 \s-1FOR\s0
! A \s-1PARTICULAR\s0 \s-1PURPOSE\s0.  \s-1THE\s0 \s-1ENTIRE\s0 \s-1RISK\s0 \s-1AS\s0 \s-1TO\s0 \s-1THE\s0 \s-1QUALITY\s0 \s-1AND\s0
! \&\s-1PERFORMANCE\s0 \s-1OF\s0 \s-1THE\s0 \s-1PROGRAM\s0 \s-1IS\s0 \s-1WITH\s0 \s-1YOU\s0.  \s-1SHOULD\s0 \s-1THE\s0 \s-1PROGRAM\s0 \s-1PROVE\s0
! \&\s-1DEFECTIVE\s0, \s-1YOU\s0 \s-1ASSUME\s0 \s-1THE\s0 \s-1COST\s0 \s-1OF\s0 \s-1ALL\s0 \s-1NECESSARY\s0 \s-1SERVICING\s0, \s-1REPAIR\s0 \s-1OR\s0
! \&\s-1CORRECTION\s0.
  .IP "16. Limitation of Liability." 4
  .IX Item "16. Limitation of Liability."
! \&\s-1IN\s0 \s-1NO\s0 \s-1EVENT\s0 \s-1UNLESS\s0 \s-1REQUIRED\s0 \s-1BY\s0 \s-1APPLICABLE\s0 \s-1LAW\s0 \s-1OR\s0 \s-1AGREED\s0 \s-1TO\s0 \s-1IN\s0 \s-1WRITING\s0
! \&\s-1WILL\s0 \s-1ANY\s0 \s-1COPYRIGHT\s0 \s-1HOLDER\s0, \s-1OR\s0 \s-1ANY\s0 \s-1OTHER\s0 \s-1PARTY\s0 \s-1WHO\s0 \s-1MODIFIES\s0 \s-1AND/OR\s0
! \&\s-1CONVEYS\s0 \s-1THE\s0 \s-1PROGRAM\s0 \s-1AS\s0 \s-1PERMITTED\s0 \s-1ABOVE\s0, \s-1BE\s0 \s-1LIABLE\s0 \s-1TO\s0 \s-1YOU\s0 \s-1FOR\s0 \s-1DAMAGES\s0,
! \&\s-1INCLUDING\s0 \s-1ANY\s0 \s-1GENERAL\s0, \s-1SPECIAL\s0, \s-1INCIDENTAL\s0 \s-1OR\s0 \s-1CONSEQUENTIAL\s0 \s-1DAMAGES\s0
! \&\s-1ARISING\s0 \s-1OUT\s0 \s-1OF\s0 \s-1THE\s0 \s-1USE\s0 \s-1OR\s0 \s-1INABILITY\s0 \s-1TO\s0 \s-1USE\s0 \s-1THE\s0 \s-1PROGRAM\s0 (\s-1INCLUDING\s0 \s-1BUT\s0
! \&\s-1NOT\s0 \s-1LIMITED\s0 \s-1TO\s0 \s-1LOSS\s0 \s-1OF\s0 \s-1DATA\s0 \s-1OR\s0 \s-1DATA\s0 \s-1BEING\s0 \s-1RENDERED\s0 \s-1INACCURATE\s0 \s-1OR\s0
! \&\s-1LOSSES\s0 \s-1SUSTAINED\s0 \s-1BY\s0 \s-1YOU\s0 \s-1OR\s0 \s-1THIRD\s0 \s-1PARTIES\s0 \s-1OR\s0 A \s-1FAILURE\s0 \s-1OF\s0 \s-1THE\s0 \s-1PROGRAM\s0
! \&\s-1TO\s0 \s-1OPERATE\s0 \s-1WITH\s0 \s-1ANY\s0 \s-1OTHER\s0 \s-1PROGRAMS\s0), \s-1EVEN\s0 \s-1IF\s0 \s-1SUCH\s0 \s-1HOLDER\s0 \s-1OR\s0 \s-1OTHER\s0
! \&\s-1PARTY\s0 \s-1HAS\s0 \s-1BEEN\s0 \s-1ADVISED\s0 \s-1OF\s0 \s-1THE\s0 \s-1POSSIBILITY\s0 \s-1OF\s0 \s-1SUCH\s0 \s-1DAMAGES\s0.
  .IP "17. Interpretation of Sections 15 and 16." 4
  .IX Item "17. Interpretation of Sections 15 and 16."
  If the disclaimer of warranty and limitation of liability provided
--- 747,772 ----
  later version.
  .IP "15. Disclaimer of Warranty." 4
  .IX Item "15. Disclaimer of Warranty."
! \&\s-1THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
! APPLICABLE LAW.\s0  \s-1EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
! HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM \*(L"AS IS\*(R" WITHOUT
! WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT
! LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
! A PARTICULAR PURPOSE.\s0  \s-1THE ENTIRE RISK AS TO THE QUALITY AND
! PERFORMANCE OF THE PROGRAM IS WITH YOU.\s0  \s-1SHOULD THE PROGRAM PROVE
! DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
! CORRECTION.\s0
  .IP "16. Limitation of Liability." 4
  .IX Item "16. Limitation of Liability."
! \&\s-1IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
! WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR
! CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
! INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES
! ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM\s0 (\s-1INCLUDING BUT
! NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR
! LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM
! TO OPERATE WITH ANY OTHER PROGRAMS\s0), \s-1EVEN IF SUCH HOLDER OR OTHER
! PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.\s0
  .IP "17. Interpretation of Sections 15 and 16." 4
  .IX Item "17. Interpretation of Sections 15 and 16."
  If the disclaimer of warranty and limitation of liability provided
*************** reviewing courts shall apply local law t
*** 778,786 ****
  an absolute waiver of all civil liability in connection with the
  Program, unless a warranty or assumption of liability accompanies a
  copy of the Program in return for a fee.
! .Sh "\s-1END\s0 \s-1OF\s0 \s-1TERMS\s0 \s-1AND\s0 \s-1CONDITIONS\s0"
  .IX Subsection "END OF TERMS AND CONDITIONS"
! .Sh "How to Apply These Terms to Your New Programs"
  .IX Subsection "How to Apply These Terms to Your New Programs"
  If you develop a new program, and you want it to be of the greatest
  possible use to the public, the best way to achieve this is to make it
--- 775,783 ----
  an absolute waiver of all civil liability in connection with the
  Program, unless a warranty or assumption of liability accompanies a
  copy of the Program in return for a fee.
! .SS "\s-1END OF TERMS AND CONDITIONS\s0"
  .IX Subsection "END OF TERMS AND CONDITIONS"
! .SS "How to Apply These Terms to Your New Programs"
  .IX Subsection "How to Apply These Terms to Your New Programs"
  If you develop a new program, and you want it to be of the greatest
  possible use to the public, the best way to achieve this is to make it
*************** use an \*(L"about box\*(R".
*** 829,835 ****
  .PP
  You should also get your employer (if you work as a programmer) or school,
  if any, to sign a \*(L"copyright disclaimer\*(R" for the program, if necessary.
! For more information on this, and how to apply and follow the \s-1GNU\s0 \s-1GPL\s0, see
  <\fBhttp://www.gnu.org/licenses/\fR>.
  .PP
  The \s-1GNU\s0 General Public License does not permit incorporating your
--- 826,832 ----
  .PP
  You should also get your employer (if you work as a programmer) or school,
  if any, to sign a \*(L"copyright disclaimer\*(R" for the program, if necessary.
! For more information on this, and how to apply and follow the \s-1GNU GPL,\s0 see
  <\fBhttp://www.gnu.org/licenses/\fR>.
  .PP
  The \s-1GNU\s0 General Public License does not permit incorporating your
diff -Nrcpad gcc-5.4.0/gcc/doc/grmic.1 gcc-5.5.0/gcc/doc/grmic.1
*** gcc-5.4.0/gcc/doc/grmic.1	Fri Jun  3 10:15:09 2016
--- gcc-5.5.0/gcc/doc/grmic.1	Tue Oct 10 09:24:11 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GRMIC 1"
! .TH GRMIC 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GRMIC 1"
! .TH GRMIC 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/gcc/doc/install.texi gcc-5.5.0/gcc/doc/install.texi
*** gcc-5.4.0/gcc/doc/install.texi	Tue May 12 08:49:59 2015
--- gcc-5.5.0/gcc/doc/install.texi	Mon May 29 21:09:44 2017
*************** and for cross builds configured with @op
*** 1060,1065 ****
--- 1060,1070 ----
  More documentation about multiarch can be found at
  @uref{http://wiki.debian.org/Multiarch}.
  
+ @item --enable-sjlj-exceptions
+ Force use of the @code{setjmp}/@code{longjmp}-based scheme for exceptions.
+ @samp{configure} ordinarily picks the correct value based on the platform.
+ Only use this option if you are sure you need a different setting.
+ 
  @item --enable-vtable-verify
  Specify whether to enable or disable the vtable verification feature.
  Enabling this feature causes libstdc++ to be built with its virtual calls
*************** When you use this option, you should ens
*** 2081,2086 ****
--- 2086,2121 ----
  tools.
  @end table
  
+ @subsubheading Overriding @command{configure} test results
+ 
+ Sometimes, it might be necessary to override the result of some
+ @command{configure} test, for example in order to ease porting to a new
+ system or work around a bug in a test.  The toplevel @command{configure}
+ script provides three variables for this:
+ 
+ @table @code
+ 
+ @item build_configargs
+ @cindex @code{build_configargs}
+ The contents of this variable is passed to all build @command{configure}
+ scripts.
+ 
+ @item host_configargs
+ @cindex @code{host_configargs}
+ The contents of this variable is passed to all host @command{configure}
+ scripts.
+ 
+ @item target_configargs
+ @cindex @code{target_configargs}
+ The contents of this variable is passed to all target @command{configure}
+ scripts.
+ 
+ @end table
+ 
+ In order to avoid shell and @command{make} quoting issues for complex
+ overrides, you can pass a setting for @env{CONFIG_SITE} and set
+ variables in the site file.
+ 
  @subheading Java-Specific Options
  
  The following option applies to the build of the Java front end.
*************** file to compile into a @file{.class} fil
*** 2200,2210 ****
  @item --with-libiconv-prefix=DIR
  Search for libiconv in @file{DIR/include} and @file{DIR/lib}.
  
- @item --enable-sjlj-exceptions
- Force use of the @code{setjmp}/@code{longjmp}-based scheme for exceptions.
- @samp{configure} ordinarily picks the correct value based on the platform.
- Only use this option if you are sure you need a different setting.
- 
  @item --with-system-zlib
  Use installed @samp{zlib} rather than that included with GCC@.
  
--- 2235,2240 ----
*************** Do not try to compile and run a test lib
*** 2315,2349 ****
  
  @end table
  
- @subsubheading Overriding @command{configure} test results
- 
- Sometimes, it might be necessary to override the result of some
- @command{configure} test, for example in order to ease porting to a new
- system or work around a bug in a test.  The toplevel @command{configure}
- script provides three variables for this:
- 
- @table @code
- 
- @item build_configargs
- @cindex @code{build_configargs}
- The contents of this variable is passed to all build @command{configure}
- scripts.
- 
- @item host_configargs
- @cindex @code{host_configargs}
- The contents of this variable is passed to all host @command{configure}
- scripts.
- 
- @item target_configargs
- @cindex @code{target_configargs}
- The contents of this variable is passed to all target @command{configure}
- scripts.
- 
- @end table
- 
- In order to avoid shell and @command{make} quoting issues for complex
- overrides, you can pass a setting for @env{CONFIG_SITE} and set
- variables in the site file.
  
  @html
  <hr />
--- 2345,2350 ----
*************** supported as cross-compilation target on
*** 4446,4452 ****
  @c alone is too unspecific and must be avoided.
  @anchor{x-x-solaris2}
  @heading *-*-solaris2*
! Support for Solaris 9 has been removed in GCC 4.10.  Support for Solaris
  8 has been removed in GCC 4.8.  Support for Solaris 7 has been removed
  in GCC 4.6.
  
--- 4447,4453 ----
  @c alone is too unspecific and must be avoided.
  @anchor{x-x-solaris2}
  @heading *-*-solaris2*
! Support for Solaris 9 has been removed in GCC 5.  Support for Solaris
  8 has been removed in GCC 4.8.  Support for Solaris 7 has been removed
  in GCC 4.6.
  
*************** features, so better stay with Sun @comma
*** 4510,4521 ****
  plugin (@option{-fuse-linker-plugin}) with GNU @command{ld}, GNU
  binutils @emph{must} be configured with @option{--enable-largefile}.
  
! To enable symbol versioning in @samp{libstdc++} with Sun @command{ld},
  you need to have any version of GNU @command{c++filt}, which is part of
  GNU binutils.  @samp{libstdc++} symbol versioning will be disabled if no
  appropriate version is found.  Sun @command{c++filt} from the Sun Studio
  compilers does @emph{not} work.
  
  Sun bug 4296832 turns up when compiling X11 headers with GCC 2.95 or
  newer: @command{g++} will complain that types are missing.  These headers
  assume that omitting the type means @code{int}; this assumption worked for
--- 4511,4525 ----
  plugin (@option{-fuse-linker-plugin}) with GNU @command{ld}, GNU
  binutils @emph{must} be configured with @option{--enable-largefile}.
  
! To enable symbol versioning in @samp{libstdc++} with the Sun linker,
  you need to have any version of GNU @command{c++filt}, which is part of
  GNU binutils.  @samp{libstdc++} symbol versioning will be disabled if no
  appropriate version is found.  Sun @command{c++filt} from the Sun Studio
  compilers does @emph{not} work.
  
+ GNU @command{make} version 3.81 or later is required to build libjava
+ with the Sun linker.
+ 
  Sun bug 4296832 turns up when compiling X11 headers with GCC 2.95 or
  newer: @command{g++} will complain that types are missing.  These headers
  assume that omitting the type means @code{int}; this assumption worked for
diff -Nrcpad gcc-5.4.0/gcc/doc/invoke.texi gcc-5.5.0/gcc/doc/invoke.texi
*** gcc-5.4.0/gcc/doc/invoke.texi	Tue May 17 18:42:16 2016
--- gcc-5.5.0/gcc/doc/invoke.texi	Tue Aug 22 09:48:48 2017
*************** Objective-C and Objective-C++ Dialects}.
*** 245,251 ****
  -Wno-attributes -Wno-builtin-macro-redefined @gol
  -Wc90-c99-compat -Wc99-c11-compat @gol
  -Wc++-compat -Wc++11-compat -Wc++14-compat -Wcast-align  -Wcast-qual  @gol
! -Wchar-subscripts -Wclobbered  -Wcomment -Wconditionally-supported  @gol
  -Wconversion -Wcoverage-mismatch -Wdate-time -Wdelete-incomplete -Wno-cpp  @gol
  -Wno-deprecated -Wno-deprecated-declarations -Wno-designated-init @gol
  -Wdisabled-optimization @gol
--- 245,251 ----
  -Wno-attributes -Wno-builtin-macro-redefined @gol
  -Wc90-c99-compat -Wc99-c11-compat @gol
  -Wc++-compat -Wc++11-compat -Wc++14-compat -Wcast-align  -Wcast-qual  @gol
! -Wchar-subscripts -Wchkp -Wclobbered  -Wcomment -Wconditionally-supported  @gol
  -Wconversion -Wcoverage-mismatch -Wdate-time -Wdelete-incomplete -Wno-cpp  @gol
  -Wno-deprecated -Wno-deprecated-declarations -Wno-designated-init @gol
  -Wdisabled-optimization @gol
*************** Objective-C and Objective-C++ Dialects}.
*** 574,580 ****
  @emph{AVR Options}
  @gccoptlist{-mmcu=@var{mcu} -maccumulate-args -mbranch-cost=@var{cost} @gol
  -mcall-prologues -mint8 -mn_flash=@var{size} -mno-interrupts @gol
! -mrelax -mrmw -mstrict-X -mtiny-stack -nodevicelib -Waddr-space-convert}
  
  @emph{Blackfin Options}
  @gccoptlist{-mcpu=@var{cpu}@r{[}-@var{sirevision}@r{]} @gol
--- 574,581 ----
  @emph{AVR Options}
  @gccoptlist{-mmcu=@var{mcu} -maccumulate-args -mbranch-cost=@var{cost} @gol
  -mcall-prologues -mint8 -mn_flash=@var{size} -mno-interrupts @gol
! -mrelax -mrmw -mstrict-X -mtiny-stack -nodevicelib -Waddr-space-convert @gol
! -Wmisspelled-isr}
  
  @emph{Blackfin Options}
  @gccoptlist{-mcpu=@var{cpu}@r{[}-@var{sirevision}@r{]} @gol
*************** See RS/6000 and PowerPC Options.
*** 923,929 ****
  -mpointers-to-nested-functions -mno-pointers-to-nested-functions @gol
  -msave-toc-indirect -mno-save-toc-indirect @gol
  -mpower8-fusion -mno-mpower8-fusion -mpower8-vector -mno-power8-vector @gol
! -mcrypto -mno-crypto -mdirect-move -mno-direct-move @gol
  -mquad-memory -mno-quad-memory @gol
  -mquad-memory-atomic -mno-quad-memory-atomic @gol
  -mcompat-align-parm -mno-compat-align-parm @gol
--- 924,930 ----
  -mpointers-to-nested-functions -mno-pointers-to-nested-functions @gol
  -msave-toc-indirect -mno-save-toc-indirect @gol
  -mpower8-fusion -mno-mpower8-fusion -mpower8-vector -mno-power8-vector @gol
! -mcrypto -mno-crypto -mhtm -mno-htm -mdirect-move -mno-direct-move @gol
  -mquad-memory -mno-quad-memory @gol
  -mquad-memory-atomic -mno-quad-memory-atomic @gol
  -mcompat-align-parm -mno-compat-align-parm @gol
*************** Warn whenever a comment-start sequence @
*** 3538,3543 ****
--- 3539,3549 ----
  comment, or whenever a Backslash-Newline appears in a @samp{//} comment.
  This warning is enabled by @option{-Wall}.
  
+ @item -Wchkp
+ @opindex Wchkp
+ Warn about an invalid memory access that is found by Pointer Bounds Checker
+ (@option{-fcheck-pointer-bounds}).
+ 
  @item -Wno-coverage-mismatch
  @opindex Wno-coverage-mismatch
  Warn if feedback profiles do not match when using the
*************** Only change the lower 8@tie{}bits of the
*** 13651,13662 ****
  
  @item -nodevicelib
  @opindex nodevicelib
! Don't link against AVR-LibC's device specific library @code{libdev.a}.
  
  @item -Waddr-space-convert
  @opindex Waddr-space-convert
  Warn about conversions between address spaces in the case where the
  resulting address space is not contained in the incoming address space.
  @end table
  
  @subsubsection @code{EIND} and Devices with More Than 128 Ki Bytes of Flash
--- 13657,13673 ----
  
  @item -nodevicelib
  @opindex nodevicelib
! Don't link against AVR-LibC's device specific library @code{lib<mcu>.a}.
  
  @item -Waddr-space-convert
  @opindex Waddr-space-convert
  Warn about conversions between address spaces in the case where the
  resulting address space is not contained in the incoming address space.
+  
+ @item -Wmisspelled-isr
+ @opindex Wmisspelled-isr
+ Warn if the ISR is misspelled, i.e. without @code{__vector} prefix.
+ Enabled by default.
  @end table
  
  @subsubsection @code{EIND} and Devices with More Than 128 Ki Bytes of Flash
*************** following options:
*** 18898,18904 ****
  -mpopcntb -mpopcntd  -mpowerpc64 @gol
  -mpowerpc-gpopt  -mpowerpc-gfxopt  -msingle-float -mdouble-float @gol
  -msimple-fpu -mstring  -mmulhw  -mdlmzb  -mmfpgpr -mvsx @gol
! -mcrypto -mdirect-move -mpower8-fusion -mpower8-vector @gol
  -mquad-memory -mquad-memory-atomic}
  
  The particular options set for any particular CPU varies between
--- 18909,18915 ----
  -mpopcntb -mpopcntd  -mpowerpc64 @gol
  -mpowerpc-gpopt  -mpowerpc-gfxopt  -msingle-float -mdouble-float @gol
  -msimple-fpu -mstring  -mmulhw  -mdlmzb  -mmfpgpr -mvsx @gol
! -mcrypto -mdirect-move -mhtm -mpower8-fusion -mpower8-vector @gol
  -mquad-memory -mquad-memory-atomic}
  
  The particular options set for any particular CPU varies between
*************** Generate code that uses (does not use) t
*** 19065,19070 ****
--- 19076,19089 ----
  between the general purpose registers and the vector/scalar (VSX)
  registers that were added in version 2.07 of the PowerPC ISA.
  
+ @item -mhtm
+ @itemx -mno-htm
+ @opindex mhtm
+ @opindex mno-htm
+ Enable (disable) the use of the built-in functions that allow direct
+ access to the Hardware Transactional Memory (HTM) instructions that
+ were added in version 2.07 of the PowerPC ISA.
+ 
  @item -mpower8-fusion
  @itemx -mno-power8-fusion
  @opindex mpower8-fusion
diff -Nrcpad gcc-5.4.0/gcc/doc/jcf-dump.1 gcc-5.5.0/gcc/doc/jcf-dump.1
*** gcc-5.4.0/gcc/doc/jcf-dump.1	Fri Jun  3 10:15:09 2016
--- gcc-5.5.0/gcc/doc/jcf-dump.1	Tue Oct 10 09:24:11 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "JCF-DUMP 1"
! .TH JCF-DUMP 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "JCF-DUMP 1"
! .TH JCF-DUMP 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/gcc/doc/jv-convert.1 gcc-5.5.0/gcc/doc/jv-convert.1
*** gcc-5.4.0/gcc/doc/jv-convert.1	Fri Jun  3 10:15:09 2016
--- gcc-5.5.0/gcc/doc/jv-convert.1	Tue Oct 10 09:24:11 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "JV-CONVERT 1"
! .TH JV-CONVERT 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "JV-CONVERT 1"
! .TH JV-CONVERT 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/gcc/doc/lto.texi gcc-5.5.0/gcc/doc/lto.texi
*** gcc-5.4.0/gcc/doc/lto.texi	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/doc/lto.texi	Mon May 29 09:12:50 2017
*************** existing build systems, as one can, for
*** 43,49 ****
  the files.  Additionally, one might be able to ship one set of fat
  objects which could be used both for development and the production of
  optimized builds.  A, perhaps surprising, side effect of this feature
! is that any mistake in the toolchain that leads to LTO information not
  being used (e.g.@: an older @code{libtool} calling @code{ld} directly).
  This is both an advantage, as the system is more robust, and a
  disadvantage, as the user is not informed that the optimization has
--- 43,49 ----
  the files.  Additionally, one might be able to ship one set of fat
  objects which could be used both for development and the production of
  optimized builds.  A, perhaps surprising, side effect of this feature
! is that any mistake in the toolchain leads to LTO information not
  being used (e.g.@: an older @code{libtool} calling @code{ld} directly).
  This is both an advantage, as the system is more robust, and a
  disadvantage, as the user is not informed that the optimization has
diff -Nrcpad gcc-5.4.0/gcc/doc/passes.texi gcc-5.5.0/gcc/doc/passes.texi
*** gcc-5.4.0/gcc/doc/passes.texi	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/doc/passes.texi	Sat Jan 21 22:04:31 2017
*************** done by @code{builtin_expand_cilk_pop_fr
*** 163,169 ****
  @end itemize
  
  Documentation about Cilk Plus and language specification is provided under the
! "Learn" section in @w{@uref{http://www.cilkplus.org/}}.  It is worth mentioning
  that the current implementation follows ABI 1.1.
  
  @node Gimplification pass
--- 163,169 ----
  @end itemize
  
  Documentation about Cilk Plus and language specification is provided under the
! "Learn" section in @w{@uref{https://www.cilkplus.org}}.  It is worth mentioning
  that the current implementation follows ABI 1.1.
  
  @node Gimplification pass
diff -Nrcpad gcc-5.4.0/gcc/doc/rebuild-gcj-db.1 gcc-5.5.0/gcc/doc/rebuild-gcj-db.1
*** gcc-5.4.0/gcc/doc/rebuild-gcj-db.1	Fri Jun  3 10:32:25 2016
--- gcc-5.5.0/gcc/doc/rebuild-gcj-db.1	Tue Oct 10 09:40:27 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "REBUILD-GCJ-DB 1"
! .TH REBUILD-GCJ-DB 1 "2016-06-03" "gcc-5.4.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "REBUILD-GCJ-DB 1"
! .TH REBUILD-GCJ-DB 1 "2017-10-10" "gcc-5.5.0" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/gcc/doc/rtl.texi gcc-5.5.0/gcc/doc/rtl.texi
*** gcc-5.4.0/gcc/doc/rtl.texi	Sat Feb 21 10:24:56 2015
--- gcc-5.5.0/gcc/doc/rtl.texi	Wed Sep 21 17:51:39 2016
*************** and @code{addr_diff_vec}, where @code{JU
*** 3525,3532 ****
  and the only way to find the labels is to scan the entire body of the
  insn.
  
! Return insns count as jumps, but since they do not refer to any
! labels, their @code{JUMP_LABEL} is @code{NULL_RTX}.
  
  @findex call_insn
  @item call_insn
--- 3525,3532 ----
  and the only way to find the labels is to scan the entire body of the
  insn.
  
! Return insns count as jumps, but their @code{JUMP_LABEL} is @code{RETURN}
! or @code{SIMPLE_RETURN}.
  
  @findex call_insn
  @item call_insn
diff -Nrcpad gcc-5.4.0/gcc/dwarf2out.c gcc-5.5.0/gcc/dwarf2out.c
*** gcc-5.4.0/gcc/dwarf2out.c	Fri May 20 08:51:06 2016
--- gcc-5.5.0/gcc/dwarf2out.c	Tue May 30 07:18:37 2017
*************** modified_type_die (tree type, int cv_qua
*** 10817,10823 ****
  	 copy was created to help us keep track of typedef names) and
  	 that copy might have a different TYPE_UID from the original
  	 ..._TYPE node.  */
!       if (TREE_CODE (type) != VECTOR_TYPE)
  	return lookup_type_die (type_main_variant (type));
        else
  	/* Vectors have the debugging information in the type,
--- 10817,10824 ----
  	 copy was created to help us keep track of typedef names) and
  	 that copy might have a different TYPE_UID from the original
  	 ..._TYPE node.  */
!       if (TREE_CODE (type) != VECTOR_TYPE
! 	  && TREE_CODE (type) != ARRAY_TYPE)
  	return lookup_type_die (type_main_variant (type));
        else
  	/* Vectors have the debugging information in the type,
diff -Nrcpad gcc-5.4.0/gcc/explow.c gcc-5.5.0/gcc/explow.c
*** gcc-5.4.0/gcc/explow.c	Thu Jan 15 13:28:42 2015
--- gcc-5.5.0/gcc/explow.c	Thu Nov  3 11:51:03 2016
*************** break_out_memory_refs (rtx x)
*** 281,292 ****
     which way).  We take advantage of the fact that pointers are not allowed to
     overflow by commuting arithmetic operations over conversions so that address
     arithmetic insns can be used. IN_CONST is true if this conversion is inside
!    a CONST.  */
  
! static rtx
  convert_memory_address_addr_space_1 (machine_mode to_mode ATTRIBUTE_UNUSED,
  				     rtx x, addr_space_t as ATTRIBUTE_UNUSED,
! 				     bool in_const ATTRIBUTE_UNUSED)
  {
  #ifndef POINTERS_EXTEND_UNSIGNED
    gcc_assert (GET_MODE (x) == to_mode || GET_MODE (x) == VOIDmode);
--- 281,294 ----
     which way).  We take advantage of the fact that pointers are not allowed to
     overflow by commuting arithmetic operations over conversions so that address
     arithmetic insns can be used. IN_CONST is true if this conversion is inside
!    a CONST. NO_EMIT is true if no insns should be emitted, and instead
!    it should return NULL if it can't be simplified without emitting insns.  */
  
! rtx
  convert_memory_address_addr_space_1 (machine_mode to_mode ATTRIBUTE_UNUSED,
  				     rtx x, addr_space_t as ATTRIBUTE_UNUSED,
! 				     bool in_const ATTRIBUTE_UNUSED,
! 				     bool no_emit ATTRIBUTE_UNUSED)
  {
  #ifndef POINTERS_EXTEND_UNSIGNED
    gcc_assert (GET_MODE (x) == to_mode || GET_MODE (x) == VOIDmode);
*************** convert_memory_address_addr_space_1 (mac
*** 332,350 ****
        temp = gen_rtx_LABEL_REF (to_mode, LABEL_REF_LABEL (x));
        LABEL_REF_NONLOCAL_P (temp) = LABEL_REF_NONLOCAL_P (x);
        return temp;
-       break;
  
      case SYMBOL_REF:
        temp = shallow_copy_rtx (x);
        PUT_MODE (temp, to_mode);
        return temp;
-       break;
  
      case CONST:
!       return gen_rtx_CONST (to_mode,
! 			    convert_memory_address_addr_space_1
! 			      (to_mode, XEXP (x, 0), as, true));
!       break;
  
      case PLUS:
      case MULT:
--- 334,349 ----
        temp = gen_rtx_LABEL_REF (to_mode, LABEL_REF_LABEL (x));
        LABEL_REF_NONLOCAL_P (temp) = LABEL_REF_NONLOCAL_P (x);
        return temp;
  
      case SYMBOL_REF:
        temp = shallow_copy_rtx (x);
        PUT_MODE (temp, to_mode);
        return temp;
  
      case CONST:
!       temp = convert_memory_address_addr_space_1 (to_mode, XEXP (x, 0), as,
! 						  true, no_emit);
!       return temp ? gen_rtx_CONST (to_mode, temp) : temp;
  
      case PLUS:
      case MULT:
*************** convert_memory_address_addr_space_1 (mac
*** 360,377 ****
  	      && CONST_INT_P (XEXP (x, 1))
  	      && ((in_const && POINTERS_EXTEND_UNSIGNED != 0)
  		  || XEXP (x, 1) == convert_memory_address_addr_space_1
! 				     (to_mode, XEXP (x, 1), as, in_const)
                    || POINTERS_EXTEND_UNSIGNED < 0)))
! 	return gen_rtx_fmt_ee (GET_CODE (x), to_mode,
! 			       convert_memory_address_addr_space_1
! 				 (to_mode, XEXP (x, 0), as, in_const),
! 			       XEXP (x, 1));
        break;
  
      default:
        break;
      }
  
    return convert_modes (to_mode, from_mode,
  			x, POINTERS_EXTEND_UNSIGNED);
  #endif /* defined(POINTERS_EXTEND_UNSIGNED) */
--- 359,383 ----
  	      && CONST_INT_P (XEXP (x, 1))
  	      && ((in_const && POINTERS_EXTEND_UNSIGNED != 0)
  		  || XEXP (x, 1) == convert_memory_address_addr_space_1
! 				     (to_mode, XEXP (x, 1), as, in_const,
! 				      no_emit)
                    || POINTERS_EXTEND_UNSIGNED < 0)))
! 	{
! 	  temp = convert_memory_address_addr_space_1 (to_mode, XEXP (x, 0),
! 						      as, in_const, no_emit);
! 	  return (temp ? gen_rtx_fmt_ee (GET_CODE (x), to_mode,
! 					 temp, XEXP (x, 1))
! 		       : temp);
! 	}
        break;
  
      default:
        break;
      }
  
+   if (no_emit)
+     return NULL_RTX;
+ 
    return convert_modes (to_mode, from_mode,
  			x, POINTERS_EXTEND_UNSIGNED);
  #endif /* defined(POINTERS_EXTEND_UNSIGNED) */
*************** convert_memory_address_addr_space_1 (mac
*** 386,392 ****
  rtx
  convert_memory_address_addr_space (machine_mode to_mode, rtx x, addr_space_t as)
  {
!   return convert_memory_address_addr_space_1 (to_mode, x, as, false);
  }
  
  
--- 392,398 ----
  rtx
  convert_memory_address_addr_space (machine_mode to_mode, rtx x, addr_space_t as)
  {
!   return convert_memory_address_addr_space_1 (to_mode, x, as, false, false);
  }
  
  
*************** memory_address_addr_space (machine_mode
*** 500,508 ****
    return x;
  }
  
! /* If REF is a MEM with an invalid address, change it into a valid address.
!    Pass through anything else unchanged.  REF must be an unshared rtx and
!    the function may modify it in-place.  */
  
  rtx
  validize_mem (rtx ref)
--- 506,513 ----
    return x;
  }
  
! /* Convert a mem ref into one with a valid memory address.
!    Pass through anything else unchanged.  */
  
  rtx
  validize_mem (rtx ref)
*************** validize_mem (rtx ref)
*** 514,520 ****
  				   MEM_ADDR_SPACE (ref)))
      return ref;
  
!   return replace_equiv_address (ref, XEXP (ref, 0), true);
  }
  
  /* If X is a memory reference to a member of an object block, try rewriting
--- 519,526 ----
  				   MEM_ADDR_SPACE (ref)))
      return ref;
  
!   /* Don't alter REF itself, since that is probably a stack slot.  */
!   return replace_equiv_address (ref, XEXP (ref, 0));
  }
  
  /* If X is a memory reference to a member of an object block, try rewriting
diff -Nrcpad gcc-5.4.0/gcc/expmed.c gcc-5.5.0/gcc/expmed.c
*** gcc-5.4.0/gcc/expmed.c	Wed Apr  1 16:09:48 2015
--- gcc-5.5.0/gcc/expmed.c	Tue May 30 07:43:37 2017
*************** expand_divmod (int rem_flag, enum tree_c
*** 3911,3921 ****
    op1_is_constant = CONST_INT_P (op1);
    if (op1_is_constant)
      {
!       unsigned HOST_WIDE_INT ext_op1 = UINTVAL (op1);
!       if (unsignedp)
! 	ext_op1 &= GET_MODE_MASK (mode);
!       op1_is_pow2 = ((EXACT_POWER_OF_2_OR_ZERO_P (ext_op1)
! 		     || (! unsignedp && EXACT_POWER_OF_2_OR_ZERO_P (-ext_op1))));
      }
  
    /*
--- 3911,3920 ----
    op1_is_constant = CONST_INT_P (op1);
    if (op1_is_constant)
      {
!       wide_int ext_op1 = rtx_mode_t (op1, mode);
!       op1_is_pow2 = (wi::popcount (ext_op1) == 1
! 		     || (! unsignedp
! 			 && wi::popcount (wi::neg (ext_op1)) == 1));
      }
  
    /*
*************** expand_divmod (int rem_flag, enum tree_c
*** 3996,4006 ****
       not straightforward to generalize this.  Maybe we should make an array
       of possible modes in init_expmed?  Save this for GCC 2.7.  */
  
!   optab1 = ((op1_is_pow2 && op1 != const0_rtx)
  	    ? (unsignedp ? lshr_optab : ashr_optab)
  	    : (unsignedp ? udiv_optab : sdiv_optab));
!   optab2 = ((op1_is_pow2 && op1 != const0_rtx)
! 	    ? optab1
  	    : (unsignedp ? udivmod_optab : sdivmod_optab));
  
    for (compute_mode = mode; compute_mode != VOIDmode;
--- 3995,4004 ----
       not straightforward to generalize this.  Maybe we should make an array
       of possible modes in init_expmed?  Save this for GCC 2.7.  */
  
!   optab1 = (op1_is_pow2
  	    ? (unsignedp ? lshr_optab : ashr_optab)
  	    : (unsignedp ? udiv_optab : sdiv_optab));
!   optab2 = (op1_is_pow2 ? optab1
  	    : (unsignedp ? udivmod_optab : sdivmod_optab));
  
    for (compute_mode = mode; compute_mode != VOIDmode;
*************** expand_divmod (int rem_flag, enum tree_c
*** 4056,4065 ****
        /* convert_modes may have placed op1 into a register, so we
  	 must recompute the following.  */
        op1_is_constant = CONST_INT_P (op1);
!       op1_is_pow2 = (op1_is_constant
! 		     && ((EXACT_POWER_OF_2_OR_ZERO_P (INTVAL (op1))
! 			  || (! unsignedp
! 			      && EXACT_POWER_OF_2_OR_ZERO_P (-UINTVAL (op1))))));
      }
  
    /* If one of the operands is a volatile MEM, copy it into a register.  */
--- 4054,4068 ----
        /* convert_modes may have placed op1 into a register, so we
  	 must recompute the following.  */
        op1_is_constant = CONST_INT_P (op1);
!       if (op1_is_constant)
! 	{
! 	  wide_int ext_op1 = rtx_mode_t (op1, compute_mode);
! 	  op1_is_pow2 = (wi::popcount (ext_op1) == 1
! 			 || (! unsignedp
! 			     && wi::popcount (wi::neg (ext_op1)) == 1));
! 	}
!       else
! 	op1_is_pow2 = 0;
      }
  
    /* If one of the operands is a volatile MEM, copy it into a register.  */
*************** expand_divmod (int rem_flag, enum tree_c
*** 4099,4108 ****
  		unsigned HOST_WIDE_INT mh, ml;
  		int pre_shift, post_shift;
  		int dummy;
! 		unsigned HOST_WIDE_INT d = (INTVAL (op1)
! 					    & GET_MODE_MASK (compute_mode));
  
! 		if (EXACT_POWER_OF_2_OR_ZERO_P (d))
  		  {
  		    pre_shift = floor_log2 (d);
  		    if (rem_flag)
--- 4102,4111 ----
  		unsigned HOST_WIDE_INT mh, ml;
  		int pre_shift, post_shift;
  		int dummy;
! 		wide_int wd = rtx_mode_t (op1, compute_mode);
! 		unsigned HOST_WIDE_INT d = wd.to_uhwi ();
  
! 		if (wi::popcount (wd) == 1)
  		  {
  		    pre_shift = floor_log2 (d);
  		    if (rem_flag)
*************** expand_divmod (int rem_flag, enum tree_c
*** 4242,4248 ****
  		else if (d == -1)
  		  quotient = expand_unop (compute_mode, neg_optab, op0,
  					  tquotient, 0);
! 		else if (HOST_BITS_PER_WIDE_INT >= size
  			 && abs_d == (unsigned HOST_WIDE_INT) 1 << (size - 1))
  		  {
  		    /* This case is not handled correctly below.  */
--- 4245,4251 ----
  		else if (d == -1)
  		  quotient = expand_unop (compute_mode, neg_optab, op0,
  					  tquotient, 0);
! 		else if (size <= HOST_BITS_PER_WIDE_INT
  			 && abs_d == (unsigned HOST_WIDE_INT) 1 << (size - 1))
  		  {
  		    /* This case is not handled correctly below.  */
*************** expand_divmod (int rem_flag, enum tree_c
*** 4252,4257 ****
--- 4255,4261 ----
  		      goto fail1;
  		  }
  		else if (EXACT_POWER_OF_2_OR_ZERO_P (d)
+ 			 && (size <= HOST_BITS_PER_WIDE_INT || d >= 0)
  			 && (rem_flag
  			     ? smod_pow2_cheap (speed, compute_mode)
  			     : sdiv_pow2_cheap (speed, compute_mode))
*************** expand_divmod (int rem_flag, enum tree_c
*** 4265,4271 ****
  						compute_mode)
  				 != CODE_FOR_nothing)))
  		  ;
! 		else if (EXACT_POWER_OF_2_OR_ZERO_P (abs_d))
  		  {
  		    if (rem_flag)
  		      {
--- 4269,4277 ----
  						compute_mode)
  				 != CODE_FOR_nothing)))
  		  ;
! 		else if (EXACT_POWER_OF_2_OR_ZERO_P (abs_d)
! 			 && (size <= HOST_BITS_PER_WIDE_INT
! 			     || abs_d != (unsigned HOST_WIDE_INT) d))
  		  {
  		    if (rem_flag)
  		      {
*************** expand_divmod (int rem_flag, enum tree_c
*** 4400,4406 ****
        case FLOOR_DIV_EXPR:
        case FLOOR_MOD_EXPR:
        /* We will come here only for signed operations.  */
! 	if (op1_is_constant && HOST_BITS_PER_WIDE_INT >= size)
  	  {
  	    unsigned HOST_WIDE_INT mh, ml;
  	    int pre_shift, lgup, post_shift;
--- 4406,4412 ----
        case FLOOR_DIV_EXPR:
        case FLOOR_MOD_EXPR:
        /* We will come here only for signed operations.  */
! 	if (op1_is_constant && size <= HOST_BITS_PER_WIDE_INT)
  	  {
  	    unsigned HOST_WIDE_INT mh, ml;
  	    int pre_shift, lgup, post_shift;
*************** expand_divmod (int rem_flag, enum tree_c
*** 4469,4477 ****
  						  op0, constm1_rtx), NULL_RTX);
  		t2 = expand_binop (compute_mode, ior_optab, op0, t1, NULL_RTX,
  				   0, OPTAB_WIDEN);
! 		nsign = expand_shift
! 		  (RSHIFT_EXPR, compute_mode, t2,
! 		   size - 1, NULL_RTX, 0);
  		t3 = force_operand (gen_rtx_MINUS (compute_mode, t1, nsign),
  				    NULL_RTX);
  		t4 = expand_divmod (0, TRUNC_DIV_EXPR, compute_mode, t3, op1,
--- 4475,4482 ----
  						  op0, constm1_rtx), NULL_RTX);
  		t2 = expand_binop (compute_mode, ior_optab, op0, t1, NULL_RTX,
  				   0, OPTAB_WIDEN);
! 		nsign = expand_shift (RSHIFT_EXPR, compute_mode, t2,
! 				      size - 1, NULL_RTX, 0);
  		t3 = force_operand (gen_rtx_MINUS (compute_mode, t1, nsign),
  				    NULL_RTX);
  		t4 = expand_divmod (0, TRUNC_DIV_EXPR, compute_mode, t3, op1,
*************** expand_divmod (int rem_flag, enum tree_c
*** 4580,4586 ****
        case CEIL_MOD_EXPR:
  	if (unsignedp)
  	  {
! 	    if (op1_is_constant && EXACT_POWER_OF_2_OR_ZERO_P (INTVAL (op1)))
  	      {
  		rtx t1, t2, t3;
  		unsigned HOST_WIDE_INT d = INTVAL (op1);
--- 4585,4594 ----
        case CEIL_MOD_EXPR:
  	if (unsignedp)
  	  {
! 	    if (op1_is_constant
! 		&& EXACT_POWER_OF_2_OR_ZERO_P (INTVAL (op1))
! 		&& (size <= HOST_BITS_PER_WIDE_INT
! 		    || INTVAL (op1) >= 0))
  	      {
  		rtx t1, t2, t3;
  		unsigned HOST_WIDE_INT d = INTVAL (op1);
*************** expand_divmod (int rem_flag, enum tree_c
*** 4793,4799 ****
  	break;
  
        case EXACT_DIV_EXPR:
! 	if (op1_is_constant && HOST_BITS_PER_WIDE_INT >= size)
  	  {
  	    HOST_WIDE_INT d = INTVAL (op1);
  	    unsigned HOST_WIDE_INT ml;
--- 4801,4807 ----
  	break;
  
        case EXACT_DIV_EXPR:
! 	if (op1_is_constant && size <= HOST_BITS_PER_WIDE_INT)
  	  {
  	    HOST_WIDE_INT d = INTVAL (op1);
  	    unsigned HOST_WIDE_INT ml;
diff -Nrcpad gcc-5.4.0/gcc/expr.c gcc-5.5.0/gcc/expr.c
*** gcc-5.4.0/gcc/expr.c	Tue Apr  7 14:34:06 2015
--- gcc-5.5.0/gcc/expr.c	Tue May 30 08:07:30 2017
*************** static tree clear_storage_libcall_fn (in
*** 165,171 ****
  static rtx_insn *compress_float_constant (rtx, rtx);
  static rtx get_subtarget (rtx);
  static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
! 				     HOST_WIDE_INT, machine_mode,
  				     tree, int, alias_set_type);
  static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
  static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT,
--- 165,172 ----
  static rtx_insn *compress_float_constant (rtx, rtx);
  static rtx get_subtarget (rtx);
  static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
! 				     HOST_WIDE_INT, unsigned HOST_WIDE_INT,
! 				     unsigned HOST_WIDE_INT, machine_mode,
  				     tree, int, alias_set_type);
  static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
  static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT,
*************** all_zeros_p (const_tree exp)
*** 5899,5905 ****
  
  static void
  store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
! 			 HOST_WIDE_INT bitpos, machine_mode mode,
  			 tree exp, int cleared, alias_set_type alias_set)
  {
    if (TREE_CODE (exp) == CONSTRUCTOR
--- 5900,5909 ----
  
  static void
  store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
! 			 HOST_WIDE_INT bitpos,
! 			 unsigned HOST_WIDE_INT bitregion_start,
! 			 unsigned HOST_WIDE_INT bitregion_end,
! 			 machine_mode mode,
  			 tree exp, int cleared, alias_set_type alias_set)
  {
    if (TREE_CODE (exp) == CONSTRUCTOR
*************** store_constructor_field (rtx target, uns
*** 5932,5938 ****
        store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
      }
    else
!     store_field (target, bitsize, bitpos, 0, 0, mode, exp, alias_set, false);
  }
  
  
--- 5936,5943 ----
        store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
      }
    else
!     store_field (target, bitsize, bitpos, bitregion_start, bitregion_end, mode,
! 		 exp, alias_set, false);
  }
  
  
*************** store_constructor (tree exp, rtx target,
*** 5967,5972 ****
--- 5972,5978 ----
  #ifdef WORD_REGISTER_OPERATIONS
    HOST_WIDE_INT exp_size = int_size_in_bytes (type);
  #endif
+   HOST_WIDE_INT bitregion_end = size > 0 ? size * BITS_PER_UNIT - 1 : 0;
  
    switch (TREE_CODE (type))
      {
*************** store_constructor (tree exp, rtx target,
*** 6042,6048 ****
  	    if (tree_fits_uhwi_p (DECL_SIZE (field)))
  	      bitsize = tree_to_uhwi (DECL_SIZE (field));
  	    else
! 	      bitsize = -1;
  
  	    mode = DECL_MODE (field);
  	    if (DECL_BIT_FIELD (field))
--- 6048,6054 ----
  	    if (tree_fits_uhwi_p (DECL_SIZE (field)))
  	      bitsize = tree_to_uhwi (DECL_SIZE (field));
  	    else
! 	      gcc_unreachable ();
  
  	    mode = DECL_MODE (field);
  	    if (DECL_BIT_FIELD (field))
*************** store_constructor (tree exp, rtx target,
*** 6056,6083 ****
  		offset = 0;
  	      }
  	    else
! 	      bitpos = tree_to_shwi (DECL_FIELD_BIT_OFFSET (field));
! 
! 	    if (offset)
! 	      {
! 	        machine_mode address_mode;
! 		rtx offset_rtx;
! 
! 		offset
! 		  = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
! 						    make_tree (TREE_TYPE (exp),
! 							       target));
! 
! 		offset_rtx = expand_normal (offset);
! 		gcc_assert (MEM_P (to_rtx));
! 
! 		address_mode = get_address_mode (to_rtx);
! 		if (GET_MODE (offset_rtx) != address_mode)
! 		  offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
! 
! 		to_rtx = offset_address (to_rtx, offset_rtx,
! 					 highest_pow2_factor (offset));
! 	      }
  
  #ifdef WORD_REGISTER_OPERATIONS
  	    /* If this initializes a field that is smaller than a
--- 6062,6068 ----
  		offset = 0;
  	      }
  	    else
! 	      gcc_unreachable ();
  
  #ifdef WORD_REGISTER_OPERATIONS
  	    /* If this initializes a field that is smaller than a
*************** store_constructor (tree exp, rtx target,
*** 6100,6105 ****
--- 6085,6097 ----
  		    type = lang_hooks.types.type_for_mode
  		      (word_mode, TYPE_UNSIGNED (type));
  		    value = fold_convert (type, value);
+ 		    /* Make sure the bits beyond the original bitsize are zero
+ 		       so that we can correctly avoid extra zeroing stores in
+ 		       later constructor elements.  */
+ 		    tree bitsize_mask
+ 		      = wide_int_to_tree (type, wi::mask (bitsize, false,
+ 							   BITS_PER_WORD));
+ 		    value = fold_build2 (BIT_AND_EXPR, type, value, bitsize_mask);
  		  }
  
  		if (BYTES_BIG_ENDIAN)
*************** store_constructor (tree exp, rtx target,
*** 6119,6125 ****
  		MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
  	      }
  
! 	    store_constructor_field (to_rtx, bitsize, bitpos, mode,
  				     value, cleared,
  				     get_alias_set (TREE_TYPE (field)));
  	  }
--- 6111,6118 ----
  		MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
  	      }
  
! 	    store_constructor_field (to_rtx, bitsize, bitpos,
! 				     0, bitregion_end, mode,
  				     value, cleared,
  				     get_alias_set (TREE_TYPE (field)));
  	  }
*************** store_constructor (tree exp, rtx target,
*** 6275,6281 ****
  			  }
  
  			store_constructor_field
! 			  (target, bitsize, bitpos, mode, value, cleared,
  			   get_alias_set (elttype));
  		      }
  		  }
--- 6268,6275 ----
  			  }
  
  			store_constructor_field
! 			  (target, bitsize, bitpos, 0, bitregion_end,
! 			   mode, value, cleared,
  			   get_alias_set (elttype));
  		      }
  		  }
*************** store_constructor (tree exp, rtx target,
*** 6378,6384 ****
  		    target = copy_rtx (target);
  		    MEM_KEEP_ALIAS_SET_P (target) = 1;
  		  }
! 		store_constructor_field (target, bitsize, bitpos, mode, value,
  					 cleared, get_alias_set (elttype));
  	      }
  	  }
--- 6372,6379 ----
  		    target = copy_rtx (target);
  		    MEM_KEEP_ALIAS_SET_P (target) = 1;
  		  }
! 		store_constructor_field (target, bitsize, bitpos, 0,
! 					 bitregion_end, mode, value,
  					 cleared, get_alias_set (elttype));
  	      }
  	  }
*************** store_constructor (tree exp, rtx target,
*** 6511,6517 ****
  		  ? TYPE_MODE (TREE_TYPE (value))
  		  : eltmode;
  		bitpos = eltpos * elt_size;
! 		store_constructor_field (target, bitsize, bitpos, value_mode,
  					 value, cleared, alias);
  	      }
  	  }
--- 6506,6513 ----
  		  ? TYPE_MODE (TREE_TYPE (value))
  		  : eltmode;
  		bitpos = eltpos * elt_size;
! 		store_constructor_field (target, bitsize, bitpos, 0,
! 					 bitregion_end, value_mode,
  					 value, cleared, alias);
  	      }
  	  }
*************** expand_expr_real_2 (sepops ops, rtx targ
*** 8856,8861 ****
--- 8852,8869 ----
        if (temp != 0)
  	return temp;
  
+       /* For vector MIN <x, y>, expand it a VEC_COND_EXPR <x <= y, x, y>
+ 	 and similarly for MAX <x, y>.  */
+       if (VECTOR_TYPE_P (type))
+ 	{
+ 	  tree t0 = make_tree (type, op0);
+ 	  tree t1 = make_tree (type, op1);
+ 	  tree comparison = build2 (code == MIN_EXPR ? LE_EXPR : GE_EXPR,
+ 				    type, t0, t1);
+ 	  return expand_vec_cond_expr (type, comparison, t0, t1,
+ 				       original_target);
+ 	}
+ 
        /* At this point, a MEM target is no longer useful; we will get better
  	 code without it.  */
  
*************** expand_expr_real_1 (tree exp, rtx target
*** 10201,10208 ****
  	if (GET_CODE (op0) == CONCAT && !must_force_mem)
  	  {
  	    if (bitpos == 0
! 		&& bitsize == GET_MODE_BITSIZE (GET_MODE (op0)))
! 	      return op0;
  	    if (bitpos == 0
  		&& bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
  		&& bitsize)
--- 10209,10244 ----
  	if (GET_CODE (op0) == CONCAT && !must_force_mem)
  	  {
  	    if (bitpos == 0
! 		&& bitsize == GET_MODE_BITSIZE (GET_MODE (op0))
! 		&& COMPLEX_MODE_P (mode1)
! 		&& COMPLEX_MODE_P (GET_MODE (op0))
! 		&& (GET_MODE_PRECISION (GET_MODE_INNER (mode1))
! 		    == GET_MODE_PRECISION (GET_MODE_INNER (GET_MODE (op0)))))
! 	      {
! 		if (mode1 != GET_MODE (op0))
! 		  {
! 		    rtx parts[2];
! 		    for (int i = 0; i < 2; i++)
! 		      {
! 			rtx op = read_complex_part (op0, i != 0);
! 			if (GET_CODE (op) == SUBREG)
! 			  op = force_reg (GET_MODE (op), op);
! 			rtx temp = gen_lowpart_common (GET_MODE_INNER (mode1),
! 						       op);
! 			if (temp)
! 			  op = temp;
! 			else
! 			  {
! 			    if (!REG_P (op) && !MEM_P (op))
! 			      op = force_reg (GET_MODE (op), op);
! 			    op = gen_lowpart (GET_MODE_INNER (mode1), op);
! 			  }
! 			parts[i] = op;
! 		      }
! 		    op0 = gen_rtx_CONCAT (mode1, parts[0], parts[1]);
! 		  }
! 		return op0;
! 	      }
  	    if (bitpos == 0
  		&& bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
  		&& bitsize)
diff -Nrcpad gcc-5.4.0/gcc/fold-const.c gcc-5.5.0/gcc/fold-const.c
*** gcc-5.4.0/gcc/fold-const.c	Mon May 23 12:51:29 2016
--- gcc-5.5.0/gcc/fold-const.c	Mon Sep 18 13:14:45 2017
*************** fold_convertible_p (const_tree type, con
*** 2204,2210 ****
  
      case REAL_TYPE:
      case FIXED_POINT_TYPE:
-     case COMPLEX_TYPE:
      case VECTOR_TYPE:
      case VOID_TYPE:
        return TREE_CODE (type) == TREE_CODE (orig);
--- 2204,2209 ----
*************** fold_unary_loc (location_t loc, enum tre
*** 8153,8160 ****
  
      case VIEW_CONVERT_EXPR:
        if (TREE_CODE (op0) == MEM_REF)
! 	return fold_build2_loc (loc, MEM_REF, type,
! 				TREE_OPERAND (op0, 0), TREE_OPERAND (op0, 1));
  
        return NULL_TREE;
  
--- 8152,8164 ----
  
      case VIEW_CONVERT_EXPR:
        if (TREE_CODE (op0) == MEM_REF)
! 	{
! 	  if (TYPE_ALIGN (TREE_TYPE (op0)) != TYPE_ALIGN (type))
! 	    type = build_aligned_type (type, TYPE_ALIGN (TREE_TYPE (op0)));
! 	  tem = fold_build2_loc (loc, MEM_REF, type,
! 				 TREE_OPERAND (op0, 0), TREE_OPERAND (op0, 1));
! 	  return tem;
! 	}
  
        return NULL_TREE;
  
*************** fold_binary_loc (location_t loc,
*** 10575,10587 ****
  	}
        /* (-A) - B -> (-B) - A  where B is easily negated and we can swap.  */
        if (TREE_CODE (arg0) == NEGATE_EXPR
! 	  && negate_expr_p (arg1)
  	  && reorder_operands_p (arg0, arg1))
  	return fold_build2_loc (loc, MINUS_EXPR, type,
! 			    fold_convert_loc (loc, type,
! 					      negate_expr (arg1)),
! 			    fold_convert_loc (loc, type,
! 					      TREE_OPERAND (arg0, 0)));
  
        /* X - (X / Y) * Y is X % Y.  */
        if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
--- 10579,10590 ----
  	}
        /* (-A) - B -> (-B) - A  where B is easily negated and we can swap.  */
        if (TREE_CODE (arg0) == NEGATE_EXPR
! 	  && negate_expr_p (op1)
  	  && reorder_operands_p (arg0, arg1))
  	return fold_build2_loc (loc, MINUS_EXPR, type,
! 				negate_expr (op1),
! 				fold_convert_loc (loc, type,
! 						  TREE_OPERAND (arg0, 0)));
  
        /* X - (X / Y) * Y is X % Y.  */
        if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
*************** fold_binary_loc (location_t loc,
*** 10680,10696 ****
  	}
  
        /* A - B -> A + (-B) if B is easily negatable.  */
!       if (negate_expr_p (arg1)
! 	  && !TYPE_OVERFLOW_SANITIZED (type)
  	  && ((FLOAT_TYPE_P (type)
                 /* Avoid this transformation if B is a positive REAL_CST.  */
! 	       && (TREE_CODE (arg1) != REAL_CST
! 		   ||  REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg1))))
  	      || INTEGRAL_TYPE_P (type)))
  	return fold_build2_loc (loc, PLUS_EXPR, type,
! 			    fold_convert_loc (loc, type, arg0),
! 			    fold_convert_loc (loc, type,
! 					      negate_expr (arg1)));
  
        /* Try folding difference of addresses.  */
        {
--- 10683,10698 ----
  	}
  
        /* A - B -> A + (-B) if B is easily negatable.  */
!       if (negate_expr_p (op1)
! 	  && ! TYPE_OVERFLOW_SANITIZED (type)
  	  && ((FLOAT_TYPE_P (type)
                 /* Avoid this transformation if B is a positive REAL_CST.  */
! 	       && (TREE_CODE (op1) != REAL_CST
! 		   || REAL_VALUE_NEGATIVE (TREE_REAL_CST (op1))))
  	      || INTEGRAL_TYPE_P (type)))
  	return fold_build2_loc (loc, PLUS_EXPR, type,
! 				fold_convert_loc (loc, type, arg0),
! 				negate_expr (op1));
  
        /* Try folding difference of addresses.  */
        {
*************** fold_binary_loc (location_t loc,
*** 10758,10772 ****
        if (! FLOAT_TYPE_P (type))
  	{
  	  /* Transform x * -C into -x * C if x is easily negatable.  */
! 	  if (TREE_CODE (arg1) == INTEGER_CST
! 	      && tree_int_cst_sgn (arg1) == -1
! 	      && negate_expr_p (arg0)
! 	      && (tem = negate_expr (arg1)) != arg1
! 	      && !TREE_OVERFLOW (tem))
  	    return fold_build2_loc (loc, MULT_EXPR, type,
! 	    			fold_convert_loc (loc, type,
! 						  negate_expr (arg0)),
! 				tem);
  
  	  /* (a * (1 << b)) is (a << b)  */
  	  if (TREE_CODE (arg1) == LSHIFT_EXPR
--- 10760,10773 ----
        if (! FLOAT_TYPE_P (type))
  	{
  	  /* Transform x * -C into -x * C if x is easily negatable.  */
! 	  if (TREE_CODE (op1) == INTEGER_CST
! 	      && tree_int_cst_sgn (op1) == -1
! 	      && negate_expr_p (op0)
! 	      && (tem = negate_expr (op1)) != op1
! 	      && ! TREE_OVERFLOW (tem))
  	    return fold_build2_loc (loc, MULT_EXPR, type,
! 				    fold_convert_loc (loc, type,
! 						      negate_expr (op0)), tem);
  
  	  /* (a * (1 << b)) is (a << b)  */
  	  if (TREE_CODE (arg1) == LSHIFT_EXPR
*************** fold_binary_loc (location_t loc,
*** 11941,11948 ****
        /* Convert -A / -B to A / B when the type is signed and overflow is
  	 undefined.  */
        if ((!INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_UNDEFINED (type))
! 	  && TREE_CODE (arg0) == NEGATE_EXPR
! 	  && negate_expr_p (arg1))
  	{
  	  if (INTEGRAL_TYPE_P (type))
  	    fold_overflow_warning (("assuming signed overflow does not occur "
--- 11942,11949 ----
        /* Convert -A / -B to A / B when the type is signed and overflow is
  	 undefined.  */
        if ((!INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_UNDEFINED (type))
! 	  && TREE_CODE (op0) == NEGATE_EXPR
! 	  && negate_expr_p (op1))
  	{
  	  if (INTEGRAL_TYPE_P (type))
  	    fold_overflow_warning (("assuming signed overflow does not occur "
*************** fold_binary_loc (location_t loc,
*** 11950,11963 ****
  				    "division"),
  				   WARN_STRICT_OVERFLOW_MISC);
  	  return fold_build2_loc (loc, code, type,
! 			      fold_convert_loc (loc, type,
! 						TREE_OPERAND (arg0, 0)),
! 			      fold_convert_loc (loc, type,
! 						negate_expr (arg1)));
  	}
        if ((!INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_UNDEFINED (type))
! 	  && TREE_CODE (arg1) == NEGATE_EXPR
! 	  && negate_expr_p (arg0))
  	{
  	  if (INTEGRAL_TYPE_P (type))
  	    fold_overflow_warning (("assuming signed overflow does not occur "
--- 11951,11963 ----
  				    "division"),
  				   WARN_STRICT_OVERFLOW_MISC);
  	  return fold_build2_loc (loc, code, type,
! 				  fold_convert_loc (loc, type,
! 						    TREE_OPERAND (arg0, 0)),
! 				  negate_expr (op1));
  	}
        if ((!INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_UNDEFINED (type))
! 	  && TREE_CODE (op1) == NEGATE_EXPR
! 	  && negate_expr_p (op0))
  	{
  	  if (INTEGRAL_TYPE_P (type))
  	    fold_overflow_warning (("assuming signed overflow does not occur "
*************** fold_binary_loc (location_t loc,
*** 11965,11974 ****
  				    "division"),
  				   WARN_STRICT_OVERFLOW_MISC);
  	  return fold_build2_loc (loc, code, type,
! 			      fold_convert_loc (loc, type,
! 						negate_expr (arg0)),
! 			      fold_convert_loc (loc, type,
! 						TREE_OPERAND (arg1, 0)));
  	}
  
        /* If arg0 is a multiple of arg1, then rewrite to the fastest div
--- 11965,11973 ----
  				    "division"),
  				   WARN_STRICT_OVERFLOW_MISC);
  	  return fold_build2_loc (loc, code, type,
! 				  negate_expr (op0),
! 				  fold_convert_loc (loc, type,
! 						    TREE_OPERAND (arg1, 0)));
  	}
  
        /* If arg0 is a multiple of arg1, then rewrite to the fastest div
*************** fold_binary_loc (location_t loc,
*** 12121,12131 ****
  	      || TREE_CODE (arg0) == BIT_IOR_EXPR
  	      || TREE_CODE (arg0) == BIT_XOR_EXPR)
  	  && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST)
! 	return fold_build2_loc (loc, TREE_CODE (arg0), type,
! 			    fold_build2_loc (loc, code, type,
! 					 TREE_OPERAND (arg0, 0), arg1),
! 			    fold_build2_loc (loc, code, type,
! 					 TREE_OPERAND (arg0, 1), arg1));
  
        /* Two consecutive rotates adding up to the some integer
  	 multiple of the precision of the type can be ignored.  */
--- 12120,12134 ----
  	      || TREE_CODE (arg0) == BIT_IOR_EXPR
  	      || TREE_CODE (arg0) == BIT_XOR_EXPR)
  	  && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST)
! 	{
! 	  tree arg00 = fold_convert_loc (loc, type, TREE_OPERAND (arg0, 0));
! 	  tree arg01 = fold_convert_loc (loc, type, TREE_OPERAND (arg0, 1));
! 	  return fold_build2_loc (loc, TREE_CODE (arg0), type,
! 				  fold_build2_loc (loc, code, type,
! 						   arg00, arg1),
! 				  fold_build2_loc (loc, code, type,
! 						   arg01, arg1));
! 	}
  
        /* Two consecutive rotates adding up to the some integer
  	 multiple of the precision of the type can be ignored.  */
*************** fold_binary_loc (location_t loc,
*** 12134,12140 ****
  	  && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST
  	  && wi::umod_trunc (wi::add (arg1, TREE_OPERAND (arg0, 1)),
  			     prec) == 0)
! 	return TREE_OPERAND (arg0, 0);
  
        /* Fold (X & C2) << C1 into (X << C1) & (C2 << C1)
  	      (X & C2) >> C1 into (X >> C1) & (C2 >> C1)
--- 12137,12143 ----
  	  && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST
  	  && wi::umod_trunc (wi::add (arg1, TREE_OPERAND (arg0, 1)),
  			     prec) == 0)
! 	return fold_convert_loc (loc, type, TREE_OPERAND (arg0, 0));
  
        /* Fold (X & C2) << C1 into (X << C1) & (C2 << C1)
  	      (X & C2) >> C1 into (X >> C1) & (C2 >> C1)
*************** fold_indirect_ref_1 (location_t loc, tre
*** 15939,15955 ****
  	  if (TREE_CODE (op00type) == VECTOR_TYPE
  	      && type == TREE_TYPE (op00type))
  	    {
- 	      HOST_WIDE_INT offset = tree_to_shwi (op01);
  	      tree part_width = TYPE_SIZE (type);
! 	      unsigned HOST_WIDE_INT part_widthi = tree_to_shwi (part_width)/BITS_PER_UNIT;
! 	      unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
! 	      tree index = bitsize_int (indexi);
! 
! 	      if (offset / part_widthi < TYPE_VECTOR_SUBPARTS (op00type))
! 		return fold_build3_loc (loc,
! 					BIT_FIELD_REF, type, op00,
! 					part_width, index);
! 
  	    }
  	  /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
  	  else if (TREE_CODE (op00type) == COMPLEX_TYPE
--- 15942,15961 ----
  	  if (TREE_CODE (op00type) == VECTOR_TYPE
  	      && type == TREE_TYPE (op00type))
  	    {
  	      tree part_width = TYPE_SIZE (type);
! 	      unsigned HOST_WIDE_INT max_offset
! 		= (tree_to_uhwi (part_width) / BITS_PER_UNIT
! 		   * TYPE_VECTOR_SUBPARTS (op00type));
! 	      if (tree_int_cst_sign_bit (op01) == 0
! 		  && compare_tree_int (op01, max_offset) == -1)
! 		{
! 		  unsigned HOST_WIDE_INT offset = tree_to_uhwi (op01);
! 		  unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
! 		  tree index = bitsize_int (indexi);
! 		  return fold_build3_loc (loc,
! 					  BIT_FIELD_REF, type, op00,
! 					  part_width, index);
! 		}
  	    }
  	  /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
  	  else if (TREE_CODE (op00type) == COMPLEX_TYPE
diff -Nrcpad gcc-5.4.0/gcc/fortran/ChangeLog gcc-5.5.0/gcc/fortran/ChangeLog
*** gcc-5.4.0/gcc/fortran/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/fortran/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,453 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-09-02  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/81770
+ 	* expr.c (gfc_check_pointer_assign): Improve the check whether pointer
+ 	may outlive pointer target.
+ 
+ 2017-06-09  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/70601
+ 	* trans-expr.c (gfc_conv_procedure_call): Fix detection of allocatable
+ 	function results.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-12-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/78866
+ 	* openmp.c (resolve_omp_clauses): Diagnose assumed size arrays in
+ 	OpenMP map, to and from clauses.
+ 	* trans-openmp.c: Include diagnostic-core.h, temporarily redefining
+ 	GCC_DIAG_STYLE to __gcc_tdiag__.
+ 	(gfc_omp_finish_clause): Diagnose implicitly mapped assumed size
+ 	arrays.
+ 
+ 	2016-09-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/77666
+ 	* trans-openmp.c (gfc_omp_private_outer_ref): Return true even for
+ 	references to allocatable arrays.
+ 
+ 	2016-09-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/77500
+ 	* trans-openmp.c (gfc_trans_omp_atomic): For atomic write or
+ 	swap, don't try to look through GFC_ISYM_CONVERSION.  In other cases,
+ 	check that value.function.isym is non-NULL before dereferencing it.
+ 
+ 2017-05-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2017-03-06  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR fortran/79894
+ 	* trans.c (gfc_add_modify_loc): Weaken assert.
+ 
+ 2017-05-01  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/80392
+ 	* trans-types.c (gfc_get_derived_type): Prevent an infinite loop when
+ 	building a derived type that includes a procedure pointer component
+ 	with a polymorphic result.
+ 
+ 2017-04-21  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/80361
+ 	* class.c (generate_finalization_wrapper): Give the finalization wrapper
+ 	the recursive attribute.
+ 
+ 2017-04-14  Dominique d'Humieres  <dominiq@lps.ens.fr>
+ 
+ 	Backport from trunk
+ 	2015-11-18  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/59910
+ 	PR fortran/80388
+ 	* primary.c (gfc_match_structure_constructor): Reduce a structure
+ 	constructor in a DATA statement.
+ 
+ 2017-02-07  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	* trans-types.c	(gfc_get_int_kind_from_width_isofortranen):  Choose
+ 	REAL type with the widest precision if two (or more) have the same
+ 	storage size.
+ 
+ 2016-12-22  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/78239
+ 	* decl.c (char_len_param_value): Also check for -fimplicit-none
+ 	when determining if implicit none is in force.
+ 
+ 2016-12-04  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/78443
+ 	* class.c (add_proc_comp): Add a vtype component for non-overridable
+ 	procedures that are overriding.
+ 
+ 2016-12-01  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/78279
+ 	* dependency.c (identical_array_ref): Convert gcc_assert to conditional
+ 	and gfc_internal_error.
+ 
+ 2016-11-24  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/78500
+ 	* expr.c (gfc_check_vardef_contextm): Fix NULL pointer dereference.
+ 	* interface.c (matching_typebound_op): Ditto.
+ 
+ 2016-11-23  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/78297
+ 	* trans-common.c (finish_equivalences): Do not dereference a NULL pointer.
+ 
+ 2016-11-23  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/66227
+ 	* simplify.c (gfc_simplify_extends_type_of): Fix missed optimization.
+ 	Prevent over-simplification. Fix a comment. Add a comment.
+ 
+ 2016-11-20  Harald Anlauf  <anlauf@gmx.de>
+ 
+ 	PR fortran/69741
+ 	* resolve.c (gfc_resolve_forall): Check for nonscalar index variables.
+ 
+ 2016-11-06  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/69544
+ 	PR fortran/78178
+ 	* match.c (match_simple_where):  Fill in locus for assigment
+ 	in simple WHERE statement.
+ 	(gfc_match_where):  Likewise.
+ 
+ 2016-11-01  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/71902
+ 	* frontend-passes.c (realloc_string_callback): Also check for the
+ 	lhs being deferred.  Name temporary variable "realloc_string".
+ 
+ 2016-10-24  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/78021
+ 	* gfc_compare_functions:  Strings with different lengths in
+ 	argument lists compare unequal.
+ 
+ 2016-10-24  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/71895
+ 	* interface.c (gfc_compare_derived_types):  Convert gcc_assert()
+ 	to a gfc_internal_error() to prevent an ICE.
+ 
+ 2016-10-24  Paul Thomas  <pault@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/61420
+ 	PR fortran/78013
+ 	* resolve.c (resolve_variable): Obtain the typespec for a
+ 	variable expression, when the variable is a function result
+ 	that is a procedure pointer.
+ 
+ 2016-10-17  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/77978
+ 	* match.c (gfc_match_stopcode): Fix error reporting for several
+ 	deficiencies in matching stop-codes.
+ 
+ 2016-10-05  Steven G. Kargl  <kargls@gcc.gnu.org>
+ 
+ 	PR fortran/58991
+ 	PR fortran/58992
+ 	* resolve.c (resolve_assoc_var):  Fix CHARACTER type-spec for a
+ 	selector in ASSOCIATE.
+ 	(resolve_fl_variable): Skip checks for an ASSOCIATE variable.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/77391
+ 	* resolve.c (deferred_requirements): New function to check F2008:C402.
+ 	(resolve_fl_variable,resolve_fl_parameter): Use it.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/77380
+ 	* dependency.c (gfc_check_dependency): Do not assert with
+ 	-fcoarray=lib.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/61318
+ 	* interface.c (compare_parameter): Use better locus for error message.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/71859
+ 	* check.c(numeric_check): Prevent ICE.  Issue error for invalid
+ 	subroutine as an actual argument when numeric argument is expected.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport of trunk
+ 
+ 	PR fortran/69867
+ 	* decl.c (build_struct): Ensure that pointers point to something.
+ 
+ 	PR fortran/69962
+ 	* decl.c (gfc_set_constant_character_len):  if expr is not
+ 	constant issue an error instead of an ICE.
+ 
+ 2016-09-30  Steven g. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport of trunk
+ 
+ 	PR fortran/77351
+ 	* frontend-passes.c (remove_trim,combine_array_constructor): Check for
+ 	NULL pointer.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/68566
+ 	* check.c (gfc_check_reshape): Check for constant expression.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/71799
+ 	* resolve.c(gfc_resolve_iterator): Failure of type conversion need
+ 	not ICE.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/70006
+ 	* io.c (gfc_resolve_dt): Use correct locus.
+ 	* resolve.c (resolve_branch): Ditto.
+ 
+ 2016-09-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/77420
+ 	* trans-common.c:  Handle array elements in equivalence when
+ 	the lower and upper bounds of array spec are NULL.
+ 
+ 	PR fortran/77460
+ 	* simplify.c (simplify_transformation_to_scalar):  On error, result
+ 	may be NULL, simply return.
+ 
+ 2016-09-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/77506
+ 	* array.c (gfc_match_array_constructor): CHARACTER(len=*) cannot
+ 	appear in an array constructor.
+ 
+ 	PR fortran/77507
+ 	* intrinsic.c (add_functions):  Use correct keyword.
+ 
+ 2016-09-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/71067
+ 	* decl.c (match_data_constant): On error, set 'result' to NULL.
+ 
+ 	PR fortran/77260
+ 	* gcc/fortran/trans-decl.c (generate_local_decl): Suppress warning
+ 	for unused variable if symbol is entry point.
+ 
+ 2016-09-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/69514
+ 	* array.c (gfc_match_array_constructor):  If type-spec is present,
+ 	walk the array constructor performing possible conversions for
+ 	numeric types.
+ 
+ 2016-09-28  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	backport from trunk
+ 	PR fortran/71730
+ 	* decl.c (char_len_param_value): Check return value of
+ 	gfc_reduce_init_expr().
+ 
+ 	PR fortran/77612
+ 	* decl.c (char_len_param_value): Check parent namespace for
+ 	seen_implicit_none.
+ 
+ 2016-09-28  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	backport from trunk
+ 	PR fortran/77694
+ 	* frontend-passes.c (optimize_binop_array_assignment): Check pointer
+ 	for NULL.
+ 
+ 2016-08-13  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/68147
+ 	* frontend-passes.c (realloc_string_callback): Don't set
+ 	walk_subtrees.
+ 
+ 2016-08-11  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/72698
+ 	* trans-stmt.c (gfc_trans_allocate): Prevent generating code for
+ 	copy of zero sized string and with it an ICE.
+ 
+ 2016-08-09  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/71795
+ 	* frontend-passes.c (combine_array_constructor):  Don't
+ 	do anything if the expression is inside an array iterator.
+ 
+ 2016-08-09  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/69742
+ 	* frontend-passes.c (cfe-expr_0):  Don't register functions
+ 	from within an ASSOCIATE statement.
+ 
+ 2016-08-08  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/60526
+ 	* decl.c (build_sym):  If the name has already been defined as a
+ 	type, it has a symtree with an upper case letter at the beginning.
+ 	If such a symtree exists, issue an error and exit.  Don't do
+ 	this if there is no corresponding upper case letter.
+ 
+ 2016-08-08  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/70524
+ 	* trans-array.c (gfc_trans_dummy_array_bias): Ensure that the
+ 	location information is correctly set.
+ 	* trans-decl.c (gfc_trans_deferred_vars): Set the locus of the
+ 	current construct early.
+ 
+ 2016-07-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 	    Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71883
+ 	* frontend-passes.c (gfc_run_passes): Bail out if there are any
+ 	errors.
+ 	* error.c (gfc_internal_error): If there are any errors in the
+ 	buffer, exit with EXIT_FAILURE.
+ 
+ 2016-07-22  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71807
+ 	* trans-expr.c (gfc_trans_subcomponent_assign): Special casing
+ 	when allocatable component is set to null() in initializer.
+ 
+ 2016-07-22  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/70842
+ 	* simplify.c (gfc_simplify_len): Only for unlimited polymorphic
+ 	types replace the expression's _data ref with a _len ref.
+ 
+ 2016-07-15  Jerry DeLisle  <jvdelisle@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71764
+ 	* trans-expr.c (gfc_trans_structure_assign): Remove assert.
+ 
+ 2016-07-13  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71623
+ 	* trans-stmt.c (gfc_trans_allocate): Add code of pre block of typespec
+ 	in allocate to parent block.
+ 
+ 2016-07-11  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71783
+ 	* frontend-passes.c (create_var):  Always allocate a charlen
+ 	for character variables.
+ 
+ 2016-07-08  Cesar Philippidis  <cesar@codesourcery.com>
+ 
+ 	Backport from trunk:
+ 	2016-07-08  Cesar Philippidis  <cesar@codesourcery.com>
+ 
+ 	* parse.c (matcha): Define.
+ 	(decode_oacc_directive): Add spec_only local var and set it.  Use
+ 	matcha to parse acc directives except for routine and declare.  Return
+ 	ST_GET_FCN_CHARACTERISTICS if a non-declarative directive could be
+ 	matched.
+ 
+ 2016-07-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-07-01  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/71717
+ 	* trans-openmp.c (gfc_omp_privatize_by_reference): Return false
+ 	for GFC_DECL_ASSOCIATE_VAR_P with POINTER_TYPE.
+ 
+ 	2016-06-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/71704
+ 	* parse.c (matchs, matcho): Move right before decode_omp_directive.
+ 	If spec_only, only gfc_match the keyword and if successful, goto
+ 	do_spec_only.
+ 	(matchds, matchdo): Define.
+ 	(decode_omp_directive): Add spec_only local var and set it.
+ 	Use matchds or matchdo macros instead of matchs or matcho
+ 	for declare target, declare simd, declare reduction and threadprivate
+ 	directives.  Return ST_GET_FCN_CHARACTERISTICS if a non-declarative
+ 	directive could be matched.
+ 	(next_statement): For ST_GET_FCN_CHARACTERISTICS restore
+ 	gfc_current_locus from old_locus even if there is no label.
+ 
+ 	PR fortran/71705
+ 	* trans-openmp.c (gfc_trans_omp_clauses): Set TREE_ADDRESSABLE on
+ 	decls in to/from clauses.
+ 
+ 2016-06-27  Paul Thomas  <pault@gcc.gnu.org>
+ 
+ 	PR fortran/70673
+ 	* frontend-passes.c (realloc_string_callback): Add a call to
+ 	gfc_dep_compare_expr.
+ 
+ 2016-06-12  Dominique d'Humieres  <dominiq@lps.ens.fr>
+ 
+ 	PR fortran/60751
+ 	* io.c (gfc_resolve_dt): Replace GFC_STD_GNU with GFC_STD_LEGACY.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/fortran/array.c gcc-5.5.0/gcc/fortran/array.c
*** gcc-5.4.0/gcc/fortran/array.c	Sat Nov 14 17:43:15 2015
--- gcc-5.5.0/gcc/fortran/array.c	Thu Sep 29 20:32:22 2016
*************** match_array_cons_element (gfc_constructo
*** 1057,1062 ****
--- 1057,1063 ----
  match
  gfc_match_array_constructor (gfc_expr **result)
  {
+   gfc_constructor *c;
    gfc_constructor_base head, new_cons;
    gfc_undo_change_set changed_syms;
    gfc_expr *expr;
*************** gfc_match_array_constructor (gfc_expr **
*** 1109,1114 ****
--- 1110,1124 ----
  	      gfc_restore_last_undo_checkpoint ();
  	      goto cleanup;
  	    }
+ 
+ 	  if (ts.type == BT_CHARACTER
+ 	      && ts.u.cl && !ts.u.cl->length && !ts.u.cl->length_from_typespec)
+ 	    {
+ 	      gfc_error ("Type-spec at %L cannot contain an asterisk for a "
+ 			 "type parameter", &where);
+ 	      gfc_restore_last_undo_checkpoint ();
+ 	      goto cleanup;
+ 	    }
  	}
      }
    else if (m == MATCH_ERROR)
*************** done:
*** 1162,1169 ****
  	 be converted.  See PR fortran/67803.  */
        if (ts.type == BT_CHARACTER)
  	{
- 	  gfc_constructor *c;
- 
  	  c = gfc_constructor_first (head);
  	  for (; c; c = gfc_constructor_next (c))
  	    {
--- 1172,1177 ----
*************** done:
*** 1186,1191 ****
--- 1194,1207 ----
  		}
  	    }
  	}
+ 
+       /* Walk the constructor and ensure type conversion for numeric types.  */
+       if (gfc_numeric_ts (&ts))
+ 	{
+ 	  c = gfc_constructor_first (head);
+ 	  for (; c; c = gfc_constructor_next (c))
+ 	    gfc_convert_type (c->expr, &ts, 1);
+ 	}
      }
    else
      expr = gfc_get_array_expr (BT_UNKNOWN, 0, &where);
diff -Nrcpad gcc-5.4.0/gcc/fortran/check.c gcc-5.5.0/gcc/fortran/check.c
*** gcc-5.4.0/gcc/fortran/check.c	Fri Feb 12 16:31:25 2016
--- gcc-5.5.0/gcc/fortran/check.c	Fri Sep 30 21:46:14 2016
*************** type_check (gfc_expr *e, int n, bt type)
*** 72,77 ****
--- 72,82 ----
  static bool
  numeric_check (gfc_expr *e, int n)
  {
+   /* Users sometime use a subroutine designator as an actual argument to
+      an intrinsic subprogram that expects an argument with a numeric type.  */
+   if (e->symtree && e->symtree->n.sym->attr.subroutine)
+     goto error;
+ 
    if (gfc_numeric_ts (&e->ts))
      return true;
  
*************** numeric_check (gfc_expr *e, int n)
*** 86,92 ****
        return true;
      }
  
!   gfc_error ("%qs argument of %qs intrinsic at %L must be a numeric type",
  	     gfc_current_intrinsic_arg[n]->name, gfc_current_intrinsic,
  	     &e->where);
  
--- 91,99 ----
        return true;
      }
  
! error:
! 
!   gfc_error ("%qs argument of %qs intrinsic at %L must have a numeric type",
  	     gfc_current_intrinsic_arg[n]->name, gfc_current_intrinsic,
  	     &e->where);
  
*************** gfc_check_reshape (gfc_expr *source, gfc
*** 3820,3826 ****
        if (!type_check (order, 3, BT_INTEGER))
  	return false;
  
!       if (order->expr_type == EXPR_ARRAY)
  	{
  	  int i, order_size, dim, perm[GFC_MAX_DIMENSIONS];
  	  gfc_expr *e;
--- 3827,3833 ----
        if (!type_check (order, 3, BT_INTEGER))
  	return false;
  
!       if (order->expr_type == EXPR_ARRAY && gfc_is_constant_expr (order))
  	{
  	  int i, order_size, dim, perm[GFC_MAX_DIMENSIONS];
  	  gfc_expr *e;
diff -Nrcpad gcc-5.4.0/gcc/fortran/class.c gcc-5.5.0/gcc/fortran/class.c
*** gcc-5.4.0/gcc/fortran/class.c	Tue Nov 24 20:40:10 2015
--- gcc-5.5.0/gcc/fortran/class.c	Fri Apr 21 21:37:16 2017
*************** add_proc_comp (gfc_symbol *vtype, const
*** 748,754 ****
  {
    gfc_component *c;
  
!   if (tb->non_overridable)
      return;
  
    c = gfc_find_component (vtype, name, true, true);
--- 748,754 ----
  {
    gfc_component *c;
  
!   if (tb->non_overridable && !tb->overridden)
      return;
  
    c = gfc_find_component (vtype, name, true, true);
*************** generate_finalization_wrapper (gfc_symbo
*** 1599,1604 ****
--- 1599,1605 ----
    final->attr.flavor = FL_PROCEDURE;
    final->attr.function = 1;
    final->attr.pure = 0;
+   final->attr.recursive = 1;
    final->result = final;
    final->ts.type = BT_INTEGER;
    final->ts.kind = 4;
diff -Nrcpad gcc-5.4.0/gcc/fortran/decl.c gcc-5.5.0/gcc/fortran/decl.c
*** gcc-5.4.0/gcc/fortran/decl.c	Thu Jan 28 10:36:30 2016
--- gcc-5.5.0/gcc/fortran/decl.c	Thu Dec 22 20:27:52 2016
*************** match_data_constant (gfc_expr **result)
*** 404,409 ****
--- 404,410 ----
      {
        gfc_error ("Symbol %qs must be a PARAMETER in DATA statement at %C",
  		 name);
+       *result = NULL;
        return MATCH_ERROR;
      }
    else if (dt_sym && dt_sym->attr.flavor == FL_DERIVED)
*************** char_len_param_value (gfc_expr **expr, b
*** 759,764 ****
--- 760,766 ----
      goto syntax;
    else if ((*expr)->expr_type == EXPR_VARIABLE)
      {
+       bool t;
        gfc_expr *e;
  
        e = gfc_copy_expr (*expr);
*************** char_len_param_value (gfc_expr **expr, b
*** 770,776 ****
  	  && e->ref->u.ar.dimen_type[0] == DIMEN_RANGE)
  	goto syntax;
  
!       gfc_reduce_init_expr (e);
  
        if ((e->ref && e->ref->type == REF_ARRAY
  	   && e->ref->u.ar.type != AR_ELEMENT) 
--- 772,788 ----
  	  && e->ref->u.ar.dimen_type[0] == DIMEN_RANGE)
  	goto syntax;
  
!       t = gfc_reduce_init_expr (e);
! 
!       if (!t && e->ts.type == BT_UNKNOWN
! 	  && e->symtree->n.sym->attr.untyped == 1
! 	  && (flag_implicit_none
! 	      || e->symtree->n.sym->ns->seen_implicit_none == 1
! 	      || e->symtree->n.sym->ns->parent->seen_implicit_none == 1))
! 	{
! 	  gfc_free_expr (e);
! 	  goto syntax;
! 	}
  
        if ((e->ref && e->ref->type == REF_ARRAY
  	   && e->ref->u.ar.type != AR_ELEMENT) 
*************** build_sym (const char *name, gfc_charlen
*** 1194,1203 ****
--- 1206,1242 ----
  {
    symbol_attribute attr;
    gfc_symbol *sym;
+   int upper;
  
    if (gfc_get_symbol (name, NULL, &sym))
      return false;
  
+   /* Check if the name has already been defined as a type.  The
+      first letter of the symtree will be in upper case then.  Of
+      course, this is only necessary if the upper case letter is
+      actually different.  */
+ 
+   upper = TOUPPER(name[0]);
+   if (upper != name[0])
+     {
+       char u_name[GFC_MAX_SYMBOL_LEN + 1];
+       gfc_symtree *st;
+       int nlen;
+ 
+       nlen = strlen(name);
+       gcc_assert (nlen <= GFC_MAX_SYMBOL_LEN);
+       strncpy (u_name, name, nlen + 1);
+       u_name[0] = upper;
+ 
+       st = gfc_find_symtree (gfc_current_ns->sym_root, u_name);
+ 
+       if (st)
+ 	{
+ 	  gfc_error ("Symbol %qs at %C also declared as a type", name);
+ 	  return false;
+ 	}
+     }
+ 
    /* Start updating the symbol table.  Add basic type attribute if present.  */
    if (current_ts.type != BT_UNKNOWN
        && (sym->attr.implicit_type == 0
*************** gfc_set_constant_character_len (int len,
*** 1280,1289 ****
    gfc_char_t *s;
    int slen;
  
-   gcc_assert (expr->expr_type == EXPR_CONSTANT);
- 
    if (expr->ts.type != BT_CHARACTER)
      return;
  
    slen = expr->value.character.length;
    if (len != slen)
--- 1319,1332 ----
    gfc_char_t *s;
    int slen;
  
    if (expr->ts.type != BT_CHARACTER)
      return;
+  
+   if (expr->expr_type != EXPR_CONSTANT)
+     {
+       gfc_error_now ("CHARACTER length must be a constant at %L", &expr->where);
+       return;
+     }
  
    slen = expr->value.character.length;
    if (len != slen)
*************** build_struct (const char *name, gfc_char
*** 1677,1684 ****
  
        if (c->initializer->expr_type == EXPR_CONSTANT)
  	gfc_set_constant_character_len (len, c->initializer, -1);
!       else if (mpz_cmp (c->ts.u.cl->length->value.integer,
! 			c->initializer->ts.u.cl->length->value.integer))
  	{
  	  gfc_constructor *ctor;
  	  ctor = gfc_constructor_first (c->initializer->value.constructor);
--- 1720,1729 ----
  
        if (c->initializer->expr_type == EXPR_CONSTANT)
  	gfc_set_constant_character_len (len, c->initializer, -1);
!       else if (c->initializer
! 		&& c->initializer->ts.u.cl
! 		&& mpz_cmp (c->ts.u.cl->length->value.integer,
! 			    c->initializer->ts.u.cl->length->value.integer))
  	{
  	  gfc_constructor *ctor;
  	  ctor = gfc_constructor_first (c->initializer->value.constructor);
diff -Nrcpad gcc-5.4.0/gcc/fortran/dependency.c gcc-5.5.0/gcc/fortran/dependency.c
*** gcc-5.4.0/gcc/fortran/dependency.c	Wed Jan 21 19:40:54 2015
--- gcc-5.5.0/gcc/fortran/dependency.c	Thu Dec  1 21:28:41 2016
*************** identical_array_ref (gfc_array_ref *a1,
*** 102,108 ****
  
    if (a1->type == AR_ELEMENT && a2->type == AR_ELEMENT)
      {
!       gcc_assert (a1->dimen == a2->dimen);
        for (i = 0; i < a1->dimen; i++)
  	{
  	  if (gfc_dep_compare_expr (a1->start[i], a2->start[i]) != 0)
--- 102,110 ----
  
    if (a1->type == AR_ELEMENT && a2->type == AR_ELEMENT)
      {
!       if (a1->dimen != a2->dimen)
! 	gfc_internal_error ("identical_array_ref(): inconsistent dimensions");
! 
        for (i = 0; i < a1->dimen; i++)
  	{
  	  if (gfc_dep_compare_expr (a1->start[i], a2->start[i]) != 0)
*************** gfc_dep_compare_functions (gfc_expr *e1,
*** 227,235 ****
  	  if ((args1->expr == NULL) ^ (args2->expr == NULL))
  	    return -2;
  
! 	  if (args1->expr != NULL && args2->expr != NULL
! 	      && gfc_dep_compare_expr (args1->expr, args2->expr) != 0)
! 	    return -2;
  
  	  args1 = args1->next;
  	  args2 = args2->next;
--- 229,254 ----
  	  if ((args1->expr == NULL) ^ (args2->expr == NULL))
  	    return -2;
  
! 	  if (args1->expr != NULL && args2->expr != NULL)
! 	    {
! 	      gfc_expr *e1, *e2;
! 	      e1 = args1->expr;
! 	      e2 = args2->expr;
! 
! 	      if (gfc_dep_compare_expr (e1, e2) != 0)
! 		return -2;
! 
! 	      /* Special case: String arguments which compare equal can have
! 		 different lengths, which makes them different in calls to
! 		 procedures.  */
! 	      
! 	      if (e1->expr_type == EXPR_CONSTANT
! 		  && e1->ts.type == BT_CHARACTER
! 		  && e2->expr_type == EXPR_CONSTANT
! 		  && e2->ts.type == BT_CHARACTER
! 		  && e1->value.character.length != e2->value.character.length)
! 		return -2;
! 	    }
  
  	  args1 = args1->next;
  	  args2 = args2->next;
*************** gfc_check_dependency (gfc_expr *expr1, g
*** 1253,1258 ****
--- 1272,1283 ----
    gfc_constructor *c;
    int n;
  
+   /* -fcoarray=lib can end up here with expr1->expr_type set to EXPR_FUNCTION
+      and a reference to _F.caf_get, so skip the assert.  */
+   if (expr1->expr_type == EXPR_FUNCTION
+       && strcmp (expr1->value.function.name, "_F.caf_get") == 0)
+     return 0;
+ 
    gcc_assert (expr1->expr_type == EXPR_VARIABLE);
  
    switch (expr2->expr_type)
diff -Nrcpad gcc-5.4.0/gcc/fortran/error.c gcc-5.5.0/gcc/fortran/error.c
*** gcc-5.4.0/gcc/fortran/error.c	Wed Feb 24 06:45:41 2016
--- gcc-5.5.0/gcc/fortran/error.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 34,41 ****
  #include "diagnostic-color.h"
  #include "tree-diagnostic.h" /* tree_diagnostics_defaults */
  
- #include <new> /* For placement-new */
- 
  static int suppress_errors = 0;
  
  static bool warnings_not_errors = false;
--- 34,39 ----
*************** show_locus (locus *loc, int c1, int c2)
*** 344,350 ****
  
    error_string (f->filename);
    error_char (':');
!     
    error_integer (LOCATION_LINE (lb->location));
  
    if ((c1 > 0) || (c2 > 0))
--- 342,348 ----
  
    error_string (f->filename);
    error_char (':');
! 
    error_integer (LOCATION_LINE (lb->location));
  
    if ((c1 > 0) || (c2 > 0))
*************** show_locus (locus *loc, int c1, int c2)
*** 394,400 ****
      offset = cmax - terminal_width + 5;
  
    /* Show the line itself, taking care not to print more than what can
!      show up on the terminal.  Tabs are converted to spaces, and 
       nonprintable characters are converted to a "\xNN" sequence.  */
  
    p = &(lb->line[offset]);
--- 392,398 ----
      offset = cmax - terminal_width + 5;
  
    /* Show the line itself, taking care not to print more than what can
!      show up on the terminal.  Tabs are converted to spaces, and
       nonprintable characters are converted to a "\xNN" sequence.  */
  
    p = &(lb->line[offset]);
*************** show_locus (locus *loc, int c1, int c2)
*** 412,418 ****
    error_char ('\n');
  
    /* Show the '1' and/or '2' corresponding to the column of the error
!      locus.  Note that a value of -1 for c1 or c2 will simply cause 
       the relevant number not to be printed.  */
  
    c1 -= offset;
--- 410,416 ----
    error_char ('\n');
  
    /* Show the '1' and/or '2' corresponding to the column of the error
!      locus.  Note that a value of -1 for c1 or c2 will simply cause
       the relevant number not to be printed.  */
  
    c1 -= offset;
*************** show_loci (locus *l1, locus *l2)
*** 477,483 ****
    else
      m = c1 - c2;
  
!   /* Note that the margin value of 10 here needs to be less than the 
       margin of 5 used in the calculation of offset in show_locus.  */
  
    if (l1->lb != l2->lb || m > terminal_width - 10)
--- 475,481 ----
    else
      m = c1 - c2;
  
!   /* Note that the margin value of 10 here needs to be less than the
       margin of 5 used in the calculation of offset in show_locus.  */
  
    if (l1->lb != l2->lb || m > terminal_width - 10)
*************** show_loci (locus *l1, locus *l2)
*** 504,514 ****
     If a locus pointer is given, the actual source line is printed out
     and the column is indicated.  Since we want the error message at
     the bottom of any source file information, we must scan the
!    argument list twice -- once to determine whether the loci are 
     present and record this for printing, and once to print the error
     message after and loci have been printed.  A maximum of two locus
     arguments are permitted.
!    
     This function is also called (recursively) by show_locus in the
     case of included files; however, as show_locus does not resupply
     any loci, the recursion is at most one level deep.  */
--- 502,512 ----
     If a locus pointer is given, the actual source line is printed out
     and the column is indicated.  Since we want the error message at
     the bottom of any source file information, we must scan the
!    argument list twice -- once to determine whether the loci are
     present and record this for printing, and once to print the error
     message after and loci have been printed.  A maximum of two locus
     arguments are permitted.
! 
     This function is also called (recursively) by show_locus in the
     case of included files; however, as show_locus does not resupply
     any loci, the recursion is at most one level deep.  */
*************** error_print (const char *type, const cha
*** 724,734 ****
  	  /* This is a position specifier.  See comment above.  */
  	  while (ISDIGIT (*format))
  	    format++;
! 	    
  	  /* Skip over the dollar sign.  */
  	  format++;
  	}
! 	
        switch (*format)
  	{
  	case '%':
--- 722,732 ----
  	  /* This is a position specifier.  See comment above.  */
  	  while (ISDIGIT (*format))
  	    format++;
! 
  	  /* Skip over the dollar sign.  */
  	  format++;
  	}
! 
        switch (*format)
  	{
  	case '%':
*************** error_printf (const char *gmsgid, ...)
*** 782,788 ****
  }
  
  
! /* Increment the number of errors, and check whether too many have 
     been printed.  */
  
  static void
--- 780,786 ----
  }
  
  
! /* Increment the number of errors, and check whether too many have
     been printed.  */
  
  static void
*************** gfc_warning (int opt, const char *gmsgid
*** 883,892 ****
  	++werrorcount;
        else if (diagnostic.kind == DK_ERROR)
  	++werrorcount_buffered;
!       else 
  	++werrorcount, --warningcount, ++warningcount_buffered;
      }
!   
    va_end (argp);
    return ret;
  }
--- 881,890 ----
  	++werrorcount;
        else if (diagnostic.kind == DK_ERROR)
  	++werrorcount_buffered;
!       else
  	++werrorcount, --warningcount, ++warningcount_buffered;
      }
! 
    va_end (argp);
    return ret;
  }
*************** gfc_notify_std_1 (int std, const char *g
*** 952,958 ****
      msg1 = _("Warning:");
    else
      msg1 = _("Error:");
!   
    switch (std)
    {
      case GFC_STD_F2008_TS:
--- 950,956 ----
      msg1 = _("Warning:");
    else
      msg1 = _("Error:");
! 
    switch (std)
    {
      case GFC_STD_F2008_TS:
*************** gfc_diagnostic_starter (diagnostic_conte
*** 1210,1216 ****
  	 locus.  */
        pp_set_prefix (context->printer, prefix);
      }
!   else 
      {
        /* Otherwise, start again.  */
        pp_clear_output_area(context->printer);
--- 1208,1214 ----
  	 locus.  */
        pp_set_prefix (context->printer, prefix);
      }
!   else
      {
        /* Otherwise, start again.  */
        pp_clear_output_area(context->printer);
*************** gfc_warning_check (void)
*** 1320,1327 ****
        warningcount += warningcount_buffered;
        werrorcount += werrorcount_buffered;
        gcc_assert (warningcount_buffered + werrorcount_buffered == 1);
!       diagnostic_action_after_output (global_dc, 
! 				      warningcount_buffered 
  				      ? DK_WARNING : DK_ERROR);
        pp->buffer = tmp_buffer;
      }
--- 1318,1325 ----
        warningcount += warningcount_buffered;
        werrorcount += werrorcount_buffered;
        gcc_assert (warningcount_buffered + werrorcount_buffered == 1);
!       diagnostic_action_after_output (global_dc,
! 				      warningcount_buffered
  				      ? DK_WARNING : DK_ERROR);
        pp->buffer = tmp_buffer;
      }
*************** gfc_error_now_1 (const char *gmsgid, ...
*** 1488,1496 ****
--- 1486,1499 ----
  void
  gfc_internal_error (const char *gmsgid, ...)
  {
+   int e, w;
    va_list argp;
    diagnostic_info diagnostic;
  
+   gfc_get_errors (&w, &e);
+   if (e > 0)
+     exit(EXIT_FAILURE);
+ 
    va_start (argp, gmsgid);
    diagnostic_set_info (&diagnostic, gmsgid, &argp, UNKNOWN_LOCATION, DK_ICE);
    report_diagnostic (&diagnostic);
*************** gfc_clear_error (void)
*** 1516,1522 ****
  bool
  gfc_error_flag_test (void)
  {
!   return error_buffer.flag 
      || !gfc_output_buffer_empty_p (pp_error_buffer);
  }
  
--- 1519,1525 ----
  bool
  gfc_error_flag_test (void)
  {
!   return error_buffer.flag
      || !gfc_output_buffer_empty_p (pp_error_buffer);
  }
  
diff -Nrcpad gcc-5.4.0/gcc/fortran/expr.c gcc-5.5.0/gcc/fortran/expr.c
*** gcc-5.4.0/gcc/fortran/expr.c	Fri Feb 12 16:31:25 2016
--- gcc-5.5.0/gcc/fortran/expr.c	Sat Sep  2 20:13:49 2017
*************** gfc_check_pointer_assign (gfc_expr *lval
*** 3782,3788 ****
    if (warn_target_lifetime
        && rvalue->expr_type == EXPR_VARIABLE
        && !rvalue->symtree->n.sym->attr.save
!       && !attr.pointer && !rvalue->symtree->n.sym->attr.host_assoc
        && !rvalue->symtree->n.sym->attr.in_common
        && !rvalue->symtree->n.sym->attr.use_assoc
        && !rvalue->symtree->n.sym->attr.dummy)
--- 3782,3789 ----
    if (warn_target_lifetime
        && rvalue->expr_type == EXPR_VARIABLE
        && !rvalue->symtree->n.sym->attr.save
!       && !rvalue->symtree->n.sym->attr.pointer && !attr.pointer
!       && !rvalue->symtree->n.sym->attr.host_assoc
        && !rvalue->symtree->n.sym->attr.in_common
        && !rvalue->symtree->n.sym->attr.use_assoc
        && !rvalue->symtree->n.sym->attr.dummy)
*************** gfc_check_vardef_context (gfc_expr* e, b
*** 4883,4889 ****
       component.  Note that (normal) assignment to procedure pointers is not
       possible.  */
    check_intentin = !own_scope;
!   ptr_component = (sym->ts.type == BT_CLASS && CLASS_DATA (sym))
  		  ? CLASS_DATA (sym)->attr.class_pointer : sym->attr.pointer;
    for (ref = e->ref; ref && check_intentin; ref = ref->next)
      {
--- 4884,4891 ----
       component.  Note that (normal) assignment to procedure pointers is not
       possible.  */
    check_intentin = !own_scope;
!   ptr_component = (sym->ts.type == BT_CLASS && sym->ts.u.derived
! 		   && CLASS_DATA (sym))
  		  ? CLASS_DATA (sym)->attr.class_pointer : sym->attr.pointer;
    for (ref = e->ref; ref && check_intentin; ref = ref->next)
      {
diff -Nrcpad gcc-5.4.0/gcc/fortran/frontend-passes.c gcc-5.5.0/gcc/fortran/frontend-passes.c
*** gcc-5.4.0/gcc/fortran/frontend-passes.c	Fri May 20 19:00:54 2016
--- gcc-5.5.0/gcc/fortran/frontend-passes.c	Tue Nov  1 08:12:00 2016
*************** gfc_run_passes (gfc_namespace *ns)
*** 105,110 ****
--- 105,111 ----
    doloop_level = 0;
    doloop_warn (ns);
    doloop_list.release ();
+   int w, e;
  
    if (flag_frontend_optimize)
      {
*************** gfc_run_passes (gfc_namespace *ns)
*** 116,121 ****
--- 117,126 ----
        expr_array.release ();
      }
  
+   gfc_get_errors (&w, &e);
+   if (e > 0)
+    return;
+ 
    if (flag_realloc_lhs)
      realloc_strings (ns);
  }
*************** realloc_string_callback (gfc_code **c, i
*** 139,161 ****
    gfc_expr *expr1, *expr2;
    gfc_code *co = *c;
    gfc_expr *n;
  
-   *walk_subtrees = 0;
    if (co->op != EXEC_ASSIGN)
      return 0;
  
    expr1 = co->expr1;
    if (expr1->ts.type != BT_CHARACTER || expr1->rank != 0
!       || !expr1->symtree->n.sym->attr.allocatable)
      return 0;
  
    expr2 = gfc_discard_nops (co->expr2);
    if (expr2->expr_type != EXPR_VARIABLE)
      return 0;
  
    if (!gfc_check_dependency (expr1, expr2, true))
      return 0;
  
    current_code = c;
    inserted_block = NULL;
    changed_statement = NULL;
--- 144,187 ----
    gfc_expr *expr1, *expr2;
    gfc_code *co = *c;
    gfc_expr *n;
+   gfc_ref *ref;
+   bool found_substr;
  
    if (co->op != EXEC_ASSIGN)
      return 0;
  
    expr1 = co->expr1;
    if (expr1->ts.type != BT_CHARACTER || expr1->rank != 0
!       || !gfc_expr_attr(expr1).allocatable
!       || !expr1->ts.deferred)
      return 0;
  
    expr2 = gfc_discard_nops (co->expr2);
    if (expr2->expr_type != EXPR_VARIABLE)
      return 0;
  
+   found_substr = false;
+   for (ref = expr2->ref; ref; ref = ref->next)
+     {
+       if (ref->type == REF_SUBSTRING)
+ 	{
+ 	  found_substr = true;
+ 	  break;
+ 	}
+     }
+   if (!found_substr)
+     return 0;
+ 
    if (!gfc_check_dependency (expr1, expr2, true))
      return 0;
  
+   /* gfc_check_dependency doesn't always pick up identical expressions.
+      However, eliminating the above sends the compiler into an infinite
+      loop on valid expressions.  Without this check, the gimplifier emits
+      an ICE for a = a, where a is deferred character length.  */
+   if (!gfc_dep_compare_expr (expr1, expr2))
+     return 0;
+ 
    current_code = c;
    inserted_block = NULL;
    changed_statement = NULL;
*************** create_var (gfc_expr * e)
*** 624,635 ****
      {
        gfc_expr *length;
  
        length = constant_string_length (e);
        if (length)
! 	{
! 	  symbol->ts.u.cl = gfc_new_charlen (ns, NULL);
! 	  symbol->ts.u.cl->length = length;
! 	}
        else
  	symbol->attr.allocatable = 1;
      }
--- 650,659 ----
      {
        gfc_expr *length;
  
+       symbol->ts.u.cl = gfc_new_charlen (ns, NULL);
        length = constant_string_length (e);
        if (length)
! 	symbol->ts.u.cl->length = length;
        else
  	symbol->attr.allocatable = 1;
      }
*************** cfe_expr_0 (gfc_expr **e, int *walk_subt
*** 701,707 ****
  
    /* Don't do this optimization within OMP workshare.  */
  
!   if (in_omp_workshare)
      {
        *walk_subtrees = 0;
        return 0;
--- 725,731 ----
  
    /* Don't do this optimization within OMP workshare.  */
  
!   if (in_omp_workshare || in_assoc_list)
      {
        *walk_subtrees = 0;
        return 0;
*************** optimize_binop_array_assignment (gfc_cod
*** 1006,1011 ****
--- 1030,1038 ----
  {
    gfc_expr *e;
  
+   if (!*rhs)
+     return false;
+ 
    e = *rhs;
    if (e->expr_type == EXPR_OP)
      {
*************** remove_trim (gfc_expr *rhs)
*** 1082,1087 ****
--- 1109,1116 ----
    bool ret;
  
    ret = false;
+   if (!rhs)
+     return ret;
  
    /* Check for a // b // trim(c).  Looping is probably not
       necessary because the parser usually generates
*************** combine_array_constructor (gfc_expr *e)
*** 1211,1219 ****
--- 1240,1256 ----
    if (forall_level > 0)
      return false;
  
+   /* Inside an iterator, things can get hairy; we are likely to create
+      an invalid temporary variable.  */
+   if (iterator_level > 0)
+     return false;
+ 
    op1 = e->value.op.op1;
    op2 = e->value.op.op2;
  
+   if (!op1 || !op2)
+     return false;
+ 
    if (op1->expr_type == EXPR_ARRAY && op2->rank == 0)
      scalar_first = false;
    else if (op2->expr_type == EXPR_ARRAY && op1->rank == 0)
diff -Nrcpad gcc-5.4.0/gcc/fortran/gfortran.info gcc-5.5.0/gcc/fortran/gfortran.info
*** gcc-5.4.0/gcc/fortran/gfortran.info	Fri Jun  3 10:32:22 2016
--- gcc-5.5.0/gcc/fortran/gfortran.info	Tue Oct 10 09:40:24 2017
***************
*** 1,5 ****
! This is doc/gfortran.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/fortran/gfortran.texi.
  
  Copyright (C) 1999-2015 Free Software Foundation, Inc.
  
--- 1,5 ----
! This is gfortran.info, produced by makeinfo version 6.1 from
! gfortran.texi.
  
  Copyright (C) 1999-2015 Free Software Foundation, Inc.
  
*************** Free Documentation License".
*** 18,32 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
! 
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * gfortran: (gfortran).                  The GNU Fortran Compiler.
  END-INFO-DIR-ENTRY
     This file documents the use and the internals of the GNU Fortran
! compiler, (`gfortran').
  
     Published by the Free Software Foundation 51 Franklin Street, Fifth
  Floor Boston, MA 02110-1301 USA
--- 18,32 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
  INFO-DIR-SECTION Software development
  START-INFO-DIR-ENTRY
  * gfortran: (gfortran).                  The GNU Fortran Compiler.
  END-INFO-DIR-ENTRY
+ 
     This file documents the use and the internals of the GNU Fortran
! compiler, ('gfortran').
  
     Published by the Free Software Foundation 51 Franklin Street, Fifth
  Floor Boston, MA 02110-1301 USA
*************** Free Documentation License".
*** 48,55 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
  
  
  File: gfortran.info,  Node: Top,  Next: Introduction,  Up: (dir)
--- 48,55 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
  
  
  File: gfortran.info,  Node: Top,  Next: Introduction,  Up: (dir)
*************** File: gfortran.info,  Node: Top,  Next:
*** 57,64 ****
  Introduction
  ************
  
! This manual documents the use of `gfortran', the GNU Fortran compiler.
! You can find in this manual how to invoke `gfortran', as well as its
  features and incompatibilities.
  
  * Menu:
--- 57,64 ----
  Introduction
  ************
  
! This manual documents the use of 'gfortran', the GNU Fortran compiler.
! You can find in this manual how to invoke 'gfortran', as well as its
  features and incompatibilities.
  
  * Menu:
*************** features and incompatibilities.
*** 66,72 ****
  * Introduction::
  
  Part I: Invoking GNU Fortran
! * Invoking GNU Fortran:: Command options supported by `gfortran'.
  * Runtime::              Influencing runtime behavior with environment variables.
  
  Part II: Language Reference
--- 66,72 ----
  * Introduction::
  
  Part I: Invoking GNU Fortran
! * Invoking GNU Fortran:: Command options supported by 'gfortran'.
  * Runtime::              Influencing runtime behavior with environment variables.
  
  Part II: Language Reference
*************** File: gfortran.info,  Node: Introduction
*** 94,100 ****
  **************
  
  The GNU Fortran compiler front end was designed initially as a free
! replacement for, or alternative to, the Unix `f95' command; `gfortran'
  is the command you will use to invoke the compiler.
  
  * Menu:
--- 94,100 ----
  **************
  
  The GNU Fortran compiler front end was designed initially as a free
! replacement for, or alternative to, the Unix 'f95' command; 'gfortran'
  is the command you will use to invoke the compiler.
  
  * Menu:
*************** completely, parts of the Fortran 2003 an
*** 117,190 ****
  several vendor extensions.  The development goal is to provide the
  following features:
  
!    * Read a user's program, stored in a file and containing
!      instructions written in Fortran 77, Fortran 90, Fortran 95,
!      Fortran 2003 or Fortran 2008.  This file contains "source code".
  
!    * Translate the user's program into instructions a computer can
!      carry out more quickly than it takes to translate the instructions
!      in the first place.  The result after compilation of a program is
!      "machine code", code designed to be efficiently translated and
!      processed by a machine such as your computer.  Humans usually are
!      not as good writing machine code as they are at writing Fortran
!      (or C++, Ada, or Java), because it is easy to make tiny mistakes
!      writing machine code.
  
     * Provide the user with information about the reasons why the
       compiler is unable to create a binary from the source code.
       Usually this will be the case if the source code is flawed.  The
       Fortran 90 standard requires that the compiler can point out
!      mistakes to the user.  An incorrect usage of the language causes
!      an "error message".
  
       The compiler will also attempt to diagnose cases where the user's
!      program contains a correct usage of the language, but instructs
!      the computer to do something questionable.  This kind of
!      diagnostics message is called a "warning message".
  
     * Provide optional information about the translation passes from the
       source code to machine code.  This can help a user of the compiler
       to find the cause of certain bugs which may not be obvious in the
!      source code, but may be more easily found at a lower level
!      compiler output.  It also helps developers to find bugs in the
!      compiler itself.
  
     * Provide information in the generated machine code that can make it
       easier to find bugs in the program (using a debugging tool, called
!      a "debugger", such as the GNU Debugger `gdb').
  
!    * Locate and gather machine code already generated to perform
!      actions requested by statements in the user's program.  This
!      machine code is organized into "modules" and is located and
!      "linked" to the user program.
  
     The GNU Fortran compiler consists of several components:
  
!    * A version of the `gcc' command (which also might be installed as
!      the system's `cc' command) that also understands and accepts
!      Fortran source code.  The `gcc' command is the "driver" program for
!      all the languages in the GNU Compiler Collection (GCC); With `gcc',
       you can compile the source code of any language for which a front
       end is available in GCC.
  
!    * The `gfortran' command itself, which also might be installed as the
!      system's `f95' command.  `gfortran' is just another driver program,
       but specifically for the Fortran compiler only.  The difference
!      with `gcc' is that `gfortran' will automatically link the correct
       libraries to your program.
  
     * A collection of run-time libraries.  These libraries contain the
!      machine code needed to support capabilities of the Fortran
!      language that are not directly provided by the machine code
!      generated by the `gfortran' compilation phase, such as intrinsic
!      functions and subroutines, and routines for interaction with files
!      and the operating system.
  
!    * The Fortran compiler itself, (`f951').  This is the GNU Fortran
       parser and code generator, linked to and interfaced with the GCC
!      backend library.  `f951' "translates" the source code to assembler
       code.  You would typically not use this program directly; instead,
!      the `gcc' or `gfortran' driver programs will call it for you.
  
  
  File: gfortran.info,  Node: GNU Fortran and GCC,  Next: Preprocessing and conditional compilation,  Prev: About GNU Fortran,  Up: Introduction
--- 117,190 ----
  several vendor extensions.  The development goal is to provide the
  following features:
  
!    * Read a user's program, stored in a file and containing instructions
!      written in Fortran 77, Fortran 90, Fortran 95, Fortran 2003 or
!      Fortran 2008.  This file contains "source code".
  
!    * Translate the user's program into instructions a computer can carry
!      out more quickly than it takes to translate the instructions in the
!      first place.  The result after compilation of a program is "machine
!      code", code designed to be efficiently translated and processed by
!      a machine such as your computer.  Humans usually are not as good
!      writing machine code as they are at writing Fortran (or C++, Ada,
!      or Java), because it is easy to make tiny mistakes writing machine
!      code.
  
     * Provide the user with information about the reasons why the
       compiler is unable to create a binary from the source code.
       Usually this will be the case if the source code is flawed.  The
       Fortran 90 standard requires that the compiler can point out
!      mistakes to the user.  An incorrect usage of the language causes an
!      "error message".
  
       The compiler will also attempt to diagnose cases where the user's
!      program contains a correct usage of the language, but instructs the
!      computer to do something questionable.  This kind of diagnostics
!      message is called a "warning message".
  
     * Provide optional information about the translation passes from the
       source code to machine code.  This can help a user of the compiler
       to find the cause of certain bugs which may not be obvious in the
!      source code, but may be more easily found at a lower level compiler
!      output.  It also helps developers to find bugs in the compiler
!      itself.
  
     * Provide information in the generated machine code that can make it
       easier to find bugs in the program (using a debugging tool, called
!      a "debugger", such as the GNU Debugger 'gdb').
  
!    * Locate and gather machine code already generated to perform actions
!      requested by statements in the user's program.  This machine code
!      is organized into "modules" and is located and "linked" to the user
!      program.
  
     The GNU Fortran compiler consists of several components:
  
!    * A version of the 'gcc' command (which also might be installed as
!      the system's 'cc' command) that also understands and accepts
!      Fortran source code.  The 'gcc' command is the "driver" program for
!      all the languages in the GNU Compiler Collection (GCC); With 'gcc',
       you can compile the source code of any language for which a front
       end is available in GCC.
  
!    * The 'gfortran' command itself, which also might be installed as the
!      system's 'f95' command.  'gfortran' is just another driver program,
       but specifically for the Fortran compiler only.  The difference
!      with 'gcc' is that 'gfortran' will automatically link the correct
       libraries to your program.
  
     * A collection of run-time libraries.  These libraries contain the
!      machine code needed to support capabilities of the Fortran language
!      that are not directly provided by the machine code generated by the
!      'gfortran' compilation phase, such as intrinsic functions and
!      subroutines, and routines for interaction with files and the
!      operating system.
  
!    * The Fortran compiler itself, ('f951').  This is the GNU Fortran
       parser and code generator, linked to and interfaced with the GCC
!      backend library.  'f951' "translates" the source code to assembler
       code.  You would typically not use this program directly; instead,
!      the 'gcc' or 'gfortran' driver programs will call it for you.
  
  
  File: gfortran.info,  Node: GNU Fortran and GCC,  Next: Preprocessing and conditional compilation,  Prev: About GNU Fortran,  Up: Introduction
*************** File: gfortran.info,  Node: GNU Fortran
*** 195,230 ****
  GNU Fortran is a part of GCC, the "GNU Compiler Collection".  GCC
  consists of a collection of front ends for various languages, which
  translate the source code into a language-independent form called
! "GENERIC".  This is then processed by a common middle end which
! provides optimization, and then passed to one of a collection of back
! ends which generate code for different computer architectures and
! operating systems.
  
!    Functionally, this is implemented with a driver program (`gcc')
! which provides the command-line interface for the compiler.  It calls
! the relevant compiler front-end program (e.g., `f951' for Fortran) for
! each file in the source code, and then calls the assembler and linker
! as appropriate to produce the compiled output.  In a copy of GCC which
! has been compiled with Fortran language support enabled, `gcc' will
! recognize files with `.f', `.for', `.ftn', `.f90', `.f95', `.f03' and
! `.f08' extensions as Fortran source code, and compile it accordingly.
! A `gfortran' driver program is also provided, which is identical to
! `gcc' except that it automatically links the Fortran runtime libraries
! into the compiled program.
  
!    Source files with `.f', `.for', `.fpp', `.ftn', `.F', `.FOR',
! `.FPP', and `.FTN' extensions are treated as fixed form.  Source files
! with `.f90', `.f95', `.f03', `.f08', `.F90', `.F95', `.F03' and `.F08'
! extensions are treated as free form.  The capitalized versions of
! either form are run through preprocessing.  Source files with the lower
! case `.fpp' extension are also run through preprocessing.
  
     This manual specifically documents the Fortran front end, which
! handles the programming language's syntax and semantics.  The aspects
! of GCC which relate to the optimization passes and the back-end code
  generation are documented in the GCC manual; see *note Introduction:
! (gcc)Top.  The two manuals together provide a complete reference for
! the GNU Fortran compiler.
  
  
  File: gfortran.info,  Node: Preprocessing and conditional compilation,  Next: GNU Fortran and G77,  Prev: GNU Fortran and GCC,  Up: Introduction
--- 195,230 ----
  GNU Fortran is a part of GCC, the "GNU Compiler Collection".  GCC
  consists of a collection of front ends for various languages, which
  translate the source code into a language-independent form called
! "GENERIC". This is then processed by a common middle end which provides
! optimization, and then passed to one of a collection of back ends which
! generate code for different computer architectures and operating
! systems.
  
!    Functionally, this is implemented with a driver program ('gcc') which
! provides the command-line interface for the compiler.  It calls the
! relevant compiler front-end program (e.g., 'f951' for Fortran) for each
! file in the source code, and then calls the assembler and linker as
! appropriate to produce the compiled output.  In a copy of GCC which has
! been compiled with Fortran language support enabled, 'gcc' will
! recognize files with '.f', '.for', '.ftn', '.f90', '.f95', '.f03' and
! '.f08' extensions as Fortran source code, and compile it accordingly.  A
! 'gfortran' driver program is also provided, which is identical to 'gcc'
! except that it automatically links the Fortran runtime libraries into
! the compiled program.
  
!    Source files with '.f', '.for', '.fpp', '.ftn', '.F', '.FOR', '.FPP',
! and '.FTN' extensions are treated as fixed form.  Source files with
! '.f90', '.f95', '.f03', '.f08', '.F90', '.F95', '.F03' and '.F08'
! extensions are treated as free form.  The capitalized versions of either
! form are run through preprocessing.  Source files with the lower case
! '.fpp' extension are also run through preprocessing.
  
     This manual specifically documents the Fortran front end, which
! handles the programming language's syntax and semantics.  The aspects of
! GCC which relate to the optimization passes and the back-end code
  generation are documented in the GCC manual; see *note Introduction:
! (gcc)Top.  The two manuals together provide a complete reference for the
! GNU Fortran compiler.
  
  
  File: gfortran.info,  Node: Preprocessing and conditional compilation,  Next: GNU Fortran and G77,  Prev: GNU Fortran and GCC,  Up: Introduction
*************** File: gfortran.info,  Node: Preprocessin
*** 234,263 ****
  
  Many Fortran compilers including GNU Fortran allow passing the source
  code through a C preprocessor (CPP; sometimes also called the Fortran
! preprocessor, FPP) to allow for conditional compilation.  In the case
! of GNU Fortran, this is the GNU C Preprocessor in the traditional mode.
! On systems with case-preserving file names, the preprocessor is
! automatically invoked if the filename extension is `.F', `.FOR',
! `.FTN', `.fpp', `.FPP', `.F90', `.F95', `.F03' or `.F08'.  To manually
! invoke the preprocessor on any file, use `-cpp', to disable
! preprocessing on files where the preprocessor is run automatically, use
! `-nocpp'.
  
     If a preprocessed file includes another file with the Fortran
! `INCLUDE' statement, the included file is not preprocessed.  To
  preprocess included files, use the equivalent preprocessor statement
! `#include'.
  
!    If GNU Fortran invokes the preprocessor, `__GFORTRAN__' is defined
! and `__GNUC__', `__GNUC_MINOR__' and `__GNUC_PATCHLEVEL__' can be used
! to determine the version of the compiler.  See *note Overview:
! (cpp)Top. for details.
  
     While CPP is the de-facto standard for preprocessing Fortran code,
  Part 3 of the Fortran 95 standard (ISO/IEC 1539-3:1998) defines
  Conditional Compilation, which is not widely used and not directly
  supported by the GNU Fortran compiler.  You can use the program coco to
! preprocess such files (`http://www.daniellnagle.com/coco.html').
  
  
  File: gfortran.info,  Node: GNU Fortran and G77,  Next: Project Status,  Prev: Preprocessing and conditional compilation,  Up: Introduction
--- 234,262 ----
  
  Many Fortran compilers including GNU Fortran allow passing the source
  code through a C preprocessor (CPP; sometimes also called the Fortran
! preprocessor, FPP) to allow for conditional compilation.  In the case of
! GNU Fortran, this is the GNU C Preprocessor in the traditional mode.  On
! systems with case-preserving file names, the preprocessor is
! automatically invoked if the filename extension is '.F', '.FOR', '.FTN',
! '.fpp', '.FPP', '.F90', '.F95', '.F03' or '.F08'.  To manually invoke
! the preprocessor on any file, use '-cpp', to disable preprocessing on
! files where the preprocessor is run automatically, use '-nocpp'.
  
     If a preprocessed file includes another file with the Fortran
! 'INCLUDE' statement, the included file is not preprocessed.  To
  preprocess included files, use the equivalent preprocessor statement
! '#include'.
  
!    If GNU Fortran invokes the preprocessor, '__GFORTRAN__' is defined
! and '__GNUC__', '__GNUC_MINOR__' and '__GNUC_PATCHLEVEL__' can be used
! to determine the version of the compiler.  See *note Overview: (cpp)Top.
! for details.
  
     While CPP is the de-facto standard for preprocessing Fortran code,
  Part 3 of the Fortran 95 standard (ISO/IEC 1539-3:1998) defines
  Conditional Compilation, which is not widely used and not directly
  supported by the GNU Fortran compiler.  You can use the program coco to
! preprocess such files (<http://www.daniellnagle.com/coco.html>).
  
  
  File: gfortran.info,  Node: GNU Fortran and G77,  Next: Project Status,  Prev: Preprocessing and conditional compilation,  Up: Introduction
*************** File: gfortran.info,  Node: GNU Fortran
*** 265,276 ****
  1.4 GNU Fortran and G77
  =======================
  
! The GNU Fortran compiler is the successor to `g77', the Fortran 77
! front end included in GCC prior to version 4.  It is an entirely new
! program that has been designed to provide Fortran 95 support and
! extensibility for future Fortran language standards, as well as
! providing backwards compatibility for Fortran 77 and nearly all of the
! GNU language extensions supported by `g77'.
  
  
  File: gfortran.info,  Node: Project Status,  Next: Standards,  Prev: GNU Fortran and G77,  Up: Introduction
--- 264,275 ----
  1.4 GNU Fortran and G77
  =======================
  
! The GNU Fortran compiler is the successor to 'g77', the Fortran 77 front
! end included in GCC prior to version 4.  It is an entirely new program
! that has been designed to provide Fortran 95 support and extensibility
! for future Fortran language standards, as well as providing backwards
! compatibility for Fortran 77 and nearly all of the GNU language
! extensions supported by 'g77'.
  
  
  File: gfortran.info,  Node: Project Status,  Next: Standards,  Prev: GNU Fortran and G77,  Up: Introduction
*************** File: gfortran.info,  Node: Project Stat
*** 278,293 ****
  1.5 Project Status
  ==================
  
!      As soon as `gfortran' can parse all of the statements correctly,
!      it will be in the "larva" state.  When we generate code, the
!      "puppa" state.  When `gfortran' is done, we'll see if it will be a
       beautiful butterfly, or just a big bug....
  
       -Andy Vaught, April 2000
  
     The start of the GNU Fortran 95 project was announced on the GCC
! homepage in March 18, 2000 (even though Andy had already been working
! on it for a while, of course).
  
     The GNU Fortran compiler is able to compile nearly all
  standard-compliant Fortran 95, Fortran 90, and Fortran 77 programs,
--- 277,292 ----
  1.5 Project Status
  ==================
  
!      As soon as 'gfortran' can parse all of the statements correctly, it
!      will be in the "larva" state.  When we generate code, the "puppa"
!      state.  When 'gfortran' is done, we'll see if it will be a
       beautiful butterfly, or just a big bug....
  
       -Andy Vaught, April 2000
  
     The start of the GNU Fortran 95 project was announced on the GCC
! homepage in March 18, 2000 (even though Andy had already been working on
! it for a while, of course).
  
     The GNU Fortran compiler is able to compile nearly all
  standard-compliant Fortran 95, Fortran 90, and Fortran 77 programs,
*************** used on real-world programs.  In particu
*** 296,304 ****
  include OpenMP, Cray-style pointers, and several Fortran 2003 and
  Fortran 2008 features, including TR 15581.  However, it is still under
  development and has a few remaining rough edges.  There also is initial
! support for OpenACC.  Note that this is an experimental feature,
! incomplete, and subject to change in future versions of GCC.  See
! `https://gcc.gnu.org/wiki/OpenACC' for more information.
  
     At present, the GNU Fortran compiler passes the NIST Fortran 77 Test
  Suite (http://www.fortran-2000.com/ArnaudRecipes/fcvs21_f95.html), and
--- 295,303 ----
  include OpenMP, Cray-style pointers, and several Fortran 2003 and
  Fortran 2008 features, including TR 15581.  However, it is still under
  development and has a few remaining rough edges.  There also is initial
! support for OpenACC. Note that this is an experimental feature,
! incomplete, and subject to change in future versions of GCC. See
! <https://gcc.gnu.org/wiki/OpenACC> for more information.
  
     At present, the GNU Fortran compiler passes the NIST Fortran 77 Test
  Suite (http://www.fortran-2000.com/ArnaudRecipes/fcvs21_f95.html), and
*************** compile a number of large real-world pro
*** 312,323 ****
  and HIRLAM weather forecasting code (http://hirlam.org/) and the Tonto
  quantum chemistry package
  (http://physical-chemistry.scb.uwa.edu.au/tonto/wiki/index.php/Main_Page);
! see `https://gcc.gnu.org/wiki/GfortranApps' for an extended list.
  
     Among other things, the GNU Fortran compiler is intended as a
  replacement for G77.  At this point, nearly all programs that could be
! compiled with G77 can be compiled with GNU Fortran, although there are
! a few minor known regressions.
  
     The primary work remaining to be done on GNU Fortran falls into three
  categories: bug fixing (primarily regarding the treatment of invalid
--- 311,322 ----
  and HIRLAM weather forecasting code (http://hirlam.org/) and the Tonto
  quantum chemistry package
  (http://physical-chemistry.scb.uwa.edu.au/tonto/wiki/index.php/Main_Page);
! see <https://gcc.gnu.org/wiki/GfortranApps> for an extended list.
  
     Among other things, the GNU Fortran compiler is intended as a
  replacement for G77.  At this point, nearly all programs that could be
! compiled with G77 can be compiled with GNU Fortran, although there are a
! few minor known regressions.
  
     The primary work remaining to be done on GNU Fortran falls into three
  categories: bug fixing (primarily regarding the treatment of invalid
*************** File: gfortran.info,  Node: Standards,
*** 336,361 ****
  
  * Varying Length Character Strings::
  
!    The GNU Fortran compiler implements ISO/IEC 1539:1997 (Fortran 95).
! As such, it can also compile essentially all standard-compliant Fortran
! 90 and Fortran 77 programs.   It also supports the ISO/IEC TR-15581
  enhancements to allocatable arrays.
  
     GNU Fortran also have a partial support for ISO/IEC 1539-1:2004
  (Fortran 2003), ISO/IEC 1539-1:2010 (Fortran 2008), the Technical
! Specification `Further Interoperability of Fortran with C' (ISO/IEC TS
  29113:2012).  Full support of those standards and future Fortran
! standards is planned.  The current status of the support is can be
! found in the *note Fortran 2003 status::, *note Fortran 2008 status::
! and *note TS 29113 status:: sections of the documentation.
  
     Additionally, the GNU Fortran compilers supports the OpenMP
  specification (version 4.0,
! `http://openmp.org/wp/openmp-specifications/').  There also is initial
  support for the OpenACC specification (targeting version 2.0,
! `http://www.openacc.org/').  Note that this is an experimental feature,
! incomplete, and subject to change in future versions of GCC.  See
! `https://gcc.gnu.org/wiki/OpenACC' for more information.
  
  
  File: gfortran.info,  Node: Varying Length Character Strings,  Up: Standards
--- 335,360 ----
  
  * Varying Length Character Strings::
  
! The GNU Fortran compiler implements ISO/IEC 1539:1997 (Fortran 95).  As
! such, it can also compile essentially all standard-compliant Fortran 90
! and Fortran 77 programs.  It also supports the ISO/IEC TR-15581
  enhancements to allocatable arrays.
  
     GNU Fortran also have a partial support for ISO/IEC 1539-1:2004
  (Fortran 2003), ISO/IEC 1539-1:2010 (Fortran 2008), the Technical
! Specification 'Further Interoperability of Fortran with C' (ISO/IEC TS
  29113:2012).  Full support of those standards and future Fortran
! standards is planned.  The current status of the support is can be found
! in the *note Fortran 2003 status::, *note Fortran 2008 status:: and
! *note TS 29113 status:: sections of the documentation.
  
     Additionally, the GNU Fortran compilers supports the OpenMP
  specification (version 4.0,
! <http://openmp.org/wp/openmp-specifications/>).  There also is initial
  support for the OpenACC specification (targeting version 2.0,
! <http://www.openacc.org/>).  Note that this is an experimental feature,
! incomplete, and subject to change in future versions of GCC. See
! <https://gcc.gnu.org/wiki/OpenACC> for more information.
  
  
  File: gfortran.info,  Node: Varying Length Character Strings,  Up: Standards
*************** The Fortran 95 standard specifies in Par
*** 367,379 ****
  varying length character strings.  While GNU Fortran currently does not
  support such strings directly, there exist two Fortran implementations
  for them, which work with GNU Fortran.  They can be found at
! `http://www.fortran.com/iso_varying_string.f95' and at
! `ftp://ftp.nag.co.uk/sc22wg5/ISO_VARYING_STRING/'.
  
     Deferred-length character strings of Fortran 2003 supports part of
! the features of `ISO_VARYING_STRING' and should be considered as
! replacement. (Namely, allocatable or pointers of the type
! `character(len=:)'.)
  
  
  File: gfortran.info,  Node: Invoking GNU Fortran,  Next: Runtime,  Prev: Introduction,  Up: Top
--- 366,378 ----
  varying length character strings.  While GNU Fortran currently does not
  support such strings directly, there exist two Fortran implementations
  for them, which work with GNU Fortran.  They can be found at
! <http://www.fortran.com/iso_varying_string.f95> and at
! <ftp://ftp.nag.co.uk/sc22wg5/ISO_VARYING_STRING/>.
  
     Deferred-length character strings of Fortran 2003 supports part of
! the features of 'ISO_VARYING_STRING' and should be considered as
! replacement.  (Namely, allocatable or pointers of the type
! 'character(len=:)'.)
  
  
  File: gfortran.info,  Node: Invoking GNU Fortran,  Next: Runtime,  Prev: Introduction,  Up: Top
*************** File: gfortran.info,  Node: Invoking GNU
*** 381,405 ****
  2 GNU Fortran Command Options
  *****************************
  
! The `gfortran' command supports all the options supported by the `gcc'
  command.  Only options specific to GNU Fortran are documented here.
  
     *Note GCC Command Options: (gcc)Invoking GCC, for information on the
! non-Fortran-specific aspects of the `gcc' command (and, therefore, the
! `gfortran' command).
  
!    All GCC and GNU Fortran options are accepted both by `gfortran' and
! by `gcc' (as well as any other drivers built at the same time, such as
! `g++'), since adding GNU Fortran to the GCC distribution enables
  acceptance of GNU Fortran options by all of the relevant drivers.
  
!    In some cases, options have positive and negative forms; the
! negative form of `-ffoo' would be `-fno-foo'.  This manual documents
! only one of these two forms, whichever one is not the default.
  
  * Menu:
  
! * Option Summary::      Brief list of all `gfortran' options,
                          without explanations.
  * Fortran Dialect Options::  Controlling the variant of Fortran language
                               compiled.
--- 380,404 ----
  2 GNU Fortran Command Options
  *****************************
  
! The 'gfortran' command supports all the options supported by the 'gcc'
  command.  Only options specific to GNU Fortran are documented here.
  
     *Note GCC Command Options: (gcc)Invoking GCC, for information on the
! non-Fortran-specific aspects of the 'gcc' command (and, therefore, the
! 'gfortran' command).
  
!    All GCC and GNU Fortran options are accepted both by 'gfortran' and
! by 'gcc' (as well as any other drivers built at the same time, such as
! 'g++'), since adding GNU Fortran to the GCC distribution enables
  acceptance of GNU Fortran options by all of the relevant drivers.
  
!    In some cases, options have positive and negative forms; the negative
! form of '-ffoo' would be '-fno-foo'.  This manual documents only one of
! these two forms, whichever one is not the default.
  
  * Menu:
  
! * Option Summary::      Brief list of all 'gfortran' options,
                          without explanations.
  * Fortran Dialect Options::  Controlling the variant of Fortran language
                               compiled.
*************** only one of these two forms, whichever o
*** 411,417 ****
  * Runtime Options::     Influencing runtime behavior
  * Code Gen Options::    Specifying conventions for function calls, data layout
                          and register usage.
! * Environment Variables:: Environment variables that affect `gfortran'.
  
  
  File: gfortran.info,  Node: Option Summary,  Next: Fortran Dialect Options,  Up: Invoking GNU Fortran
--- 410,416 ----
  * Runtime Options::     Influencing runtime behavior
  * Code Gen Options::    Specifying conventions for function calls, data layout
                          and register usage.
! * Environment Variables:: Environment variables that affect 'gfortran'.
  
  
  File: gfortran.info,  Node: Option Summary,  Next: Fortran Dialect Options,  Up: Invoking GNU Fortran
*************** File: gfortran.info,  Node: Option Summa
*** 419,426 ****
  2.1 Option summary
  ==================
  
! Here is a summary of all the options specific to GNU Fortran, grouped
! by type.  Explanations are in the following sections.
  
  _Fortran Language Options_
       *Note Options controlling Fortran dialect: Fortran Dialect Options.
--- 418,425 ----
  2.1 Option summary
  ==================
  
! Here is a summary of all the options specific to GNU Fortran, grouped by
! type.  Explanations are in the following sections.
  
  _Fortran Language Options_
       *Note Options controlling Fortran dialect: Fortran Dialect Options.
*************** _Fortran Language Options_
*** 433,438 ****
--- 432,438 ----
            -fopenacc -fopenmp -freal-4-real-10 -freal-4-real-16 -freal-4-real-8
            -freal-8-real-10 -freal-8-real-16 -freal-8-real-4 -std=STD
  
+ 
  _Preprocessing Options_
       *Note Enable and customize preprocessing: Preprocessing Options.
            -A-QUESTION[=ANSWER]
*************** _Preprocessing Options_
*** 444,452 ****
            -nostdinc
            -undef
  
  _Error and Warning Options_
!      *Note Options to request or suppress errors and warnings: Error
!      and Warning Options.
            -Waliasing -Wall -Wampersand -Warray-bounds
            -Wc-binding-type -Wcharacter-truncation
            -Wconversion -Wfunction-elimination -Wimplicit-interface
--- 444,453 ----
            -nostdinc
            -undef
  
+ 
  _Error and Warning Options_
!      *Note Options to request or suppress errors and warnings: Error and
!      Warning Options.
            -Waliasing -Wall -Wampersand -Warray-bounds
            -Wc-binding-type -Wcharacter-truncation
            -Wconversion -Wfunction-elimination -Wimplicit-interface
*************** _Error and Warning Options_
*** 455,466 ****
--- 456,469 ----
            -Wsurprising -Wunderflow -Wunused-parameter -Wrealloc-lhs -Wrealloc-lhs-all
            -Wtarget-lifetime -fmax-errors=N -fsyntax-only -pedantic -pedantic-errors
  
+ 
  _Debugging Options_
       *Note Options for debugging your program or GNU Fortran: Debugging
       Options.
            -fbacktrace -fdump-fortran-optimized -fdump-fortran-original
            -fdump-parse-tree -ffpe-trap=LIST -ffpe-summary=LIST
  
+ 
  _Directory Options_
       *Note Options for directory search: Directory Options.
            -IDIR  -JDIR -fintrinsic-modules-path DIR
*************** _Runtime Options_
*** 474,479 ****
--- 477,483 ----
            -fconvert=CONVERSION -fmax-subrecord-length=LENGTH
            -frecord-marker=LENGTH -fsign-zero
  
+ 
  _Code Generation Options_
       *Note Options for code generation conventions: Code Gen Options.
            -faggressive-function-elimination -fblas-matmul-limit=N
*************** File: gfortran.info,  Node: Fortran Dial
*** 500,686 ****
  The following options control the details of the Fortran dialect
  accepted by the compiler:
  
! `-ffree-form'
! `-ffixed-form'
       Specify the layout used by the source file.  The free form layout
       was introduced in Fortran 90.  Fixed form was traditionally used in
       older Fortran programs.  When neither option is specified, the
       source form is determined by the file extension.
  
! `-fall-intrinsics'
       This option causes all intrinsic procedures (including the
       GNU-specific extensions) to be accepted.  This can be useful with
!      `-std=f95' to force standard-compliance but get access to the full
!      range of intrinsics available with `gfortran'.  As a consequence,
!      `-Wintrinsics-std' will be ignored and no user-defined procedure
       with the same name as any intrinsic will be called except when it
!      is explicitly declared `EXTERNAL'.
  
! `-fd-lines-as-code'
! `-fd-lines-as-comments'
!      Enable special treatment for lines beginning with `d' or `D' in
!      fixed form sources.  If the `-fd-lines-as-code' option is given
       they are treated as if the first column contained a blank.  If the
!      `-fd-lines-as-comments' option is given, they are treated as
       comment lines.
  
! `-fdollar-ok'
!      Allow `$' as a valid non-first character in a symbol name. Symbols
!      that start with `$' are rejected since it is unclear which rules to
       apply to implicit typing as different vendors implement different
!      rules.  Using `$' in `IMPLICIT' statements is also rejected.
  
! `-fbackslash'
       Change the interpretation of backslashes in string literals from a
!      single backslash character to "C-style" escape characters. The
!      following combinations are expanded `\a', `\b', `\f', `\n', `\r',
!      `\t', `\v', `\\', and `\0' to the ASCII characters alert,
       backspace, form feed, newline, carriage return, horizontal tab,
       vertical tab, backslash, and NUL, respectively.  Additionally,
!      `\x'NN, `\u'NNNN and `\U'NNNNNNNN (where each N is a hexadecimal
       digit) are translated into the Unicode characters corresponding to
!      the specified code points. All other combinations of a character
       preceded by \ are unexpanded.
  
! `-fmodule-private'
!      Set the default accessibility of module entities to `PRIVATE'.
       Use-associated entities will not be accessible unless they are
!      explicitly declared as `PUBLIC'.
  
! `-ffixed-line-length-N'
       Set column after which characters are ignored in typical fixed-form
       lines in the source file, and through which spaces are assumed (as
       if padded to that length) after the ends of short fixed-form lines.
  
       Popular values for N include 72 (the standard and the default), 80
       (card image), and 132 (corresponding to "extended-source" options
!      in some popular compilers).  N may also be `none', meaning that
!      the entire line is meaningful and that continued character
!      constants never have implicit spaces appended to them to fill out
!      the line.  `-ffixed-line-length-0' means the same thing as
!      `-ffixed-line-length-none'.
  
! `-ffree-line-length-N'
       Set column after which characters are ignored in typical free-form
!      lines in the source file. The default value is 132.  N may be
!      `none', meaning that the entire line is meaningful.
!      `-ffree-line-length-0' means the same thing as
!      `-ffree-line-length-none'.
  
! `-fmax-identifier-length=N'
!      Specify the maximum allowed identifier length. Typical values are
       31 (Fortran 95) and 63 (Fortran 2003 and Fortran 2008).
  
! `-fimplicit-none'
       Specify that no implicit typing is allowed, unless overridden by
!      explicit `IMPLICIT' statements.  This is the equivalent of adding
!      `implicit none' to the start of every procedure.
  
! `-fcray-pointer'
       Enable the Cray pointer extension, which provides C-like pointer
       functionality.
  
! `-fopenacc'
!      Enable the OpenACC extensions.  This includes OpenACC `!$acc'
!      directives in free form and `c$acc', `*$acc' and `!$acc'
!      directives in fixed form, `!$' conditional compilation sentinels
!      in free form and `c$', `*$' and `!$' sentinels in fixed form, and
!      when linking arranges for the OpenACC runtime library to be linked
!      in.
  
       Note that this is an experimental feature, incomplete, and subject
!      to change in future versions of GCC.  See
!      `https://gcc.gnu.org/wiki/OpenACC' for more information.
  
! `-fopenmp'
!      Enable the OpenMP extensions.  This includes OpenMP `!$omp'
!      directives in free form and `c$omp', `*$omp' and `!$omp'
!      directives in fixed form, `!$' conditional compilation sentinels
!      in free form and `c$', `*$' and `!$' sentinels in fixed form, and
!      when linking arranges for the OpenMP runtime library to be linked
!      in.  The option `-fopenmp' implies `-frecursive'.
  
! `-fno-range-check'
       Disable range checking on results of simplification of constant
       expressions during compilation.  For example, GNU Fortran will give
!      an error at compile time when simplifying `a = 1. / 0'.  With this
!      option, no error will be given and `a' will be assigned the value
!      `+Infinity'.  If an expression evaluates to a value outside of the
!      relevant range of [`-HUGE()':`HUGE()'], then the expression will
!      be replaced by `-Inf' or `+Inf' as appropriate.  Similarly, `DATA
!      i/Z'FFFFFFFF'/' will result in an integer overflow on most
!      systems, but with `-fno-range-check' the value will "wrap around"
!      and `i' will be initialized to -1 instead.
  
! `-fdefault-integer-8'
       Set the default integer and logical types to an 8 byte wide type.
!      This option also affects the kind of integer constants like `42'.
!      Unlike `-finteger-4-integer-8', it does not promote variables with
       explicit kind declaration.
  
! `-fdefault-real-8'
!      Set the default real type to an 8 byte wide type. This option also
!      affects the kind of non-double real constants like `1.0', and does
!      promote the default width of `DOUBLE PRECISION' to 16 bytes if
!      possible, unless `-fdefault-double-8' is given, too. Unlike
!      `-freal-4-real-8', it does not promote variables with explicit
!      kind declaration.
  
! `-fdefault-double-8'
!      Set the `DOUBLE PRECISION' type to an 8 byte wide type.  Do
!      nothing if this is already the default.  If `-fdefault-real-8' is
!      given, `DOUBLE PRECISION' would instead be promoted to 16 bytes if
!      possible, and `-fdefault-double-8' can be used to prevent this.
!      The kind of real constants like `1.d0' will not be changed by
!      `-fdefault-real-8' though, so also `-fdefault-double-8' does not
       affect it.
  
! `-finteger-4-integer-8'
!      Promote all `INTEGER(KIND=4)' entities to an `INTEGER(KIND=8)'
!      entities.  If `KIND=8' is unavailable, then an error will be
       issued.  This option should be used with care and may not be
       suitable for your codes.  Areas of possible concern include calls
!      to external procedures, alignment in `EQUIVALENCE' and/or
!      `COMMON', generic interfaces, BOZ literal constant conversion, and
!      I/O.  Inspection of the intermediate representation of the
!      translated Fortran code, produced by `-fdump-tree-original', is
!      suggested.
  
! `-freal-4-real-8'
! `-freal-4-real-10'
! `-freal-4-real-16'
! `-freal-8-real-4'
! `-freal-8-real-10'
! `-freal-8-real-16'
!      Promote all `REAL(KIND=M)' entities to `REAL(KIND=N)' entities.
!      If `REAL(KIND=N)' is unavailable, then an error will be issued.
!      All other real kind types are unaffected by this option.  These
!      options should be used with care and may not be suitable for your
!      codes.  Areas of possible concern include calls to external
!      procedures, alignment in `EQUIVALENCE' and/or `COMMON', generic
!      interfaces, BOZ literal constant conversion, and I/O.  Inspection
!      of the intermediate representation of the translated Fortran code,
!      produced by `-fdump-tree-original', is suggested.
  
! `-std=STD'
       Specify the standard to which the program is expected to conform,
!      which may be one of `f95', `f2003', `f2008', `gnu', or `legacy'.
!      The default value for STD is `gnu', which specifies a superset of
       the Fortran 95 standard that includes all of the extensions
       supported by GNU Fortran, although warnings will be given for
       obsolete extensions not recommended for use in new code.  The
!      `legacy' value is equivalent but without the warnings for obsolete
       extensions, and may be useful for old non-standard programs.  The
!      `f95', `f2003' and `f2008' values specify strict conformance to
!      the Fortran 95, Fortran 2003 and Fortran 2008 standards,
!      respectively; errors are given for all extensions beyond the
!      relevant language standard, and warnings are given for the Fortran
!      77 features that are permitted but obsolescent in later standards.
!      `-std=f2008ts' allows the Fortran 2008 standard including the
!      additions of the Technical Specification (TS) 29113 on Further
!      Interoperability of Fortran with C and TS 18508 on Additional
!      Parallel Features in Fortran.
! 
  
  
  File: gfortran.info,  Node: Preprocessing Options,  Next: Error and Warning Options,  Prev: Fortran Dialect Options,  Up: Invoking GNU Fortran
--- 504,687 ----
  The following options control the details of the Fortran dialect
  accepted by the compiler:
  
! '-ffree-form'
! '-ffixed-form'
       Specify the layout used by the source file.  The free form layout
       was introduced in Fortran 90.  Fixed form was traditionally used in
       older Fortran programs.  When neither option is specified, the
       source form is determined by the file extension.
  
! '-fall-intrinsics'
       This option causes all intrinsic procedures (including the
       GNU-specific extensions) to be accepted.  This can be useful with
!      '-std=f95' to force standard-compliance but get access to the full
!      range of intrinsics available with 'gfortran'.  As a consequence,
!      '-Wintrinsics-std' will be ignored and no user-defined procedure
       with the same name as any intrinsic will be called except when it
!      is explicitly declared 'EXTERNAL'.
  
! '-fd-lines-as-code'
! '-fd-lines-as-comments'
!      Enable special treatment for lines beginning with 'd' or 'D' in
!      fixed form sources.  If the '-fd-lines-as-code' option is given
       they are treated as if the first column contained a blank.  If the
!      '-fd-lines-as-comments' option is given, they are treated as
       comment lines.
  
! '-fdollar-ok'
!      Allow '$' as a valid non-first character in a symbol name.  Symbols
!      that start with '$' are rejected since it is unclear which rules to
       apply to implicit typing as different vendors implement different
!      rules.  Using '$' in 'IMPLICIT' statements is also rejected.
  
! '-fbackslash'
       Change the interpretation of backslashes in string literals from a
!      single backslash character to "C-style" escape characters.  The
!      following combinations are expanded '\a', '\b', '\f', '\n', '\r',
!      '\t', '\v', '\\', and '\0' to the ASCII characters alert,
       backspace, form feed, newline, carriage return, horizontal tab,
       vertical tab, backslash, and NUL, respectively.  Additionally,
!      '\x'NN, '\u'NNNN and '\U'NNNNNNNN (where each N is a hexadecimal
       digit) are translated into the Unicode characters corresponding to
!      the specified code points.  All other combinations of a character
       preceded by \ are unexpanded.
  
! '-fmodule-private'
!      Set the default accessibility of module entities to 'PRIVATE'.
       Use-associated entities will not be accessible unless they are
!      explicitly declared as 'PUBLIC'.
  
! '-ffixed-line-length-N'
       Set column after which characters are ignored in typical fixed-form
       lines in the source file, and through which spaces are assumed (as
       if padded to that length) after the ends of short fixed-form lines.
  
       Popular values for N include 72 (the standard and the default), 80
       (card image), and 132 (corresponding to "extended-source" options
!      in some popular compilers).  N may also be 'none', meaning that the
!      entire line is meaningful and that continued character constants
!      never have implicit spaces appended to them to fill out the line.
!      '-ffixed-line-length-0' means the same thing as
!      '-ffixed-line-length-none'.
  
! '-ffree-line-length-N'
       Set column after which characters are ignored in typical free-form
!      lines in the source file.  The default value is 132.  N may be
!      'none', meaning that the entire line is meaningful.
!      '-ffree-line-length-0' means the same thing as
!      '-ffree-line-length-none'.
  
! '-fmax-identifier-length=N'
!      Specify the maximum allowed identifier length.  Typical values are
       31 (Fortran 95) and 63 (Fortran 2003 and Fortran 2008).
  
! '-fimplicit-none'
       Specify that no implicit typing is allowed, unless overridden by
!      explicit 'IMPLICIT' statements.  This is the equivalent of adding
!      'implicit none' to the start of every procedure.
  
! '-fcray-pointer'
       Enable the Cray pointer extension, which provides C-like pointer
       functionality.
  
! '-fopenacc'
!      Enable the OpenACC extensions.  This includes OpenACC '!$acc'
!      directives in free form and 'c$acc', '*$acc' and '!$acc' directives
!      in fixed form, '!$' conditional compilation sentinels in free form
!      and 'c$', '*$' and '!$' sentinels in fixed form, and when linking
!      arranges for the OpenACC runtime library to be linked in.
  
       Note that this is an experimental feature, incomplete, and subject
!      to change in future versions of GCC. See
!      <https://gcc.gnu.org/wiki/OpenACC> for more information.
  
! '-fopenmp'
!      Enable the OpenMP extensions.  This includes OpenMP '!$omp'
!      directives in free form and 'c$omp', '*$omp' and '!$omp' directives
!      in fixed form, '!$' conditional compilation sentinels in free form
!      and 'c$', '*$' and '!$' sentinels in fixed form, and when linking
!      arranges for the OpenMP runtime library to be linked in.  The
!      option '-fopenmp' implies '-frecursive'.
  
! '-fno-range-check'
       Disable range checking on results of simplification of constant
       expressions during compilation.  For example, GNU Fortran will give
!      an error at compile time when simplifying 'a = 1. / 0'.  With this
!      option, no error will be given and 'a' will be assigned the value
!      '+Infinity'.  If an expression evaluates to a value outside of the
!      relevant range of ['-HUGE()':'HUGE()'], then the expression will be
!      replaced by '-Inf' or '+Inf' as appropriate.  Similarly, 'DATA
!      i/Z'FFFFFFFF'/' will result in an integer overflow on most systems,
!      but with '-fno-range-check' the value will "wrap around" and 'i'
!      will be initialized to -1 instead.
  
! '-fdefault-integer-8'
       Set the default integer and logical types to an 8 byte wide type.
!      This option also affects the kind of integer constants like '42'.
!      Unlike '-finteger-4-integer-8', it does not promote variables with
       explicit kind declaration.
  
! '-fdefault-real-8'
!      Set the default real type to an 8 byte wide type.  This option also
!      affects the kind of non-double real constants like '1.0', and does
!      promote the default width of 'DOUBLE PRECISION' to 16 bytes if
!      possible, unless '-fdefault-double-8' is given, too.  Unlike
!      '-freal-4-real-8', it does not promote variables with explicit kind
!      declaration.
  
! '-fdefault-double-8'
!      Set the 'DOUBLE PRECISION' type to an 8 byte wide type.  Do nothing
!      if this is already the default.  If '-fdefault-real-8' is given,
!      'DOUBLE PRECISION' would instead be promoted to 16 bytes if
!      possible, and '-fdefault-double-8' can be used to prevent this.
!      The kind of real constants like '1.d0' will not be changed by
!      '-fdefault-real-8' though, so also '-fdefault-double-8' does not
       affect it.
  
! '-finteger-4-integer-8'
!      Promote all 'INTEGER(KIND=4)' entities to an 'INTEGER(KIND=8)'
!      entities.  If 'KIND=8' is unavailable, then an error will be
       issued.  This option should be used with care and may not be
       suitable for your codes.  Areas of possible concern include calls
!      to external procedures, alignment in 'EQUIVALENCE' and/or 'COMMON',
!      generic interfaces, BOZ literal constant conversion, and I/O.
!      Inspection of the intermediate representation of the translated
!      Fortran code, produced by '-fdump-tree-original', is suggested.
  
! '-freal-4-real-8'
! '-freal-4-real-10'
! '-freal-4-real-16'
! '-freal-8-real-4'
! '-freal-8-real-10'
! '-freal-8-real-16'
!      Promote all 'REAL(KIND=M)' entities to 'REAL(KIND=N)' entities.  If
!      'REAL(KIND=N)' is unavailable, then an error will be issued.  All
!      other real kind types are unaffected by this option.  These options
!      should be used with care and may not be suitable for your codes.
!      Areas of possible concern include calls to external procedures,
!      alignment in 'EQUIVALENCE' and/or 'COMMON', generic interfaces, BOZ
!      literal constant conversion, and I/O. Inspection of the
!      intermediate representation of the translated Fortran code,
!      produced by '-fdump-tree-original', is suggested.
  
! '-std=STD'
       Specify the standard to which the program is expected to conform,
!      which may be one of 'f95', 'f2003', 'f2008', 'gnu', or 'legacy'.
!      The default value for STD is 'gnu', which specifies a superset of
       the Fortran 95 standard that includes all of the extensions
       supported by GNU Fortran, although warnings will be given for
       obsolete extensions not recommended for use in new code.  The
!      'legacy' value is equivalent but without the warnings for obsolete
       extensions, and may be useful for old non-standard programs.  The
!      'f95', 'f2003' and 'f2008' values specify strict conformance to the
!      Fortran 95, Fortran 2003 and Fortran 2008 standards, respectively;
!      errors are given for all extensions beyond the relevant language
!      standard, and warnings are given for the Fortran 77 features that
!      are permitted but obsolescent in later standards.  '-std=f2008ts'
!      allows the Fortran 2008 standard including the additions of the
!      Technical Specification (TS) 29113 on Further Interoperability of
!      Fortran with C and TS 18508 on Additional Parallel Features in
!      Fortran.
  
  
  File: gfortran.info,  Node: Preprocessing Options,  Next: Error and Warning Options,  Prev: Fortran Dialect Options,  Up: Invoking GNU Fortran
*************** File: gfortran.info,  Node: Preprocessin
*** 688,845 ****
  2.3 Enable and customize preprocessing
  ======================================
  
! Preprocessor related options. See section *note Preprocessing and
! conditional compilation:: for more detailed information on
! preprocessing in `gfortran'.
  
! `-cpp'
! `-nocpp'
!      Enable preprocessing. The preprocessor is automatically invoked if
!      the file extension is `.fpp', `.FPP',  `.F', `.FOR', `.FTN',
!      `.F90', `.F95', `.F03' or `.F08'. Use this option to manually
!      enable preprocessing of any kind of Fortran file.
  
       To disable preprocessing of files with any of the above listed
!      extensions, use the negative form: `-nocpp'.
  
!      The preprocessor is run in traditional mode. Any restrictions of
       the file-format, especially the limits on line length, apply for
       preprocessed output as well, so it might be advisable to use the
!      `-ffree-line-length-none' or `-ffixed-line-length-none' options.
  
! `-dM'
!      Instead of the normal output, generate a list of `'#define''
       directives for all the macros defined during the execution of the
!      preprocessor, including predefined macros. This gives you a way of
       finding out what is predefined in your version of the preprocessor.
!      Assuming you have no file `foo.f90', the command
              touch foo.f90; gfortran -cpp -E -dM foo.f90
       will show all the predefined macros.
  
! `-dD'
!      Like `-dM' except in two respects: it does not include the
!      predefined macros, and it outputs both the `#define' directives
!      and the result of preprocessing. Both kinds of output go to the
       standard output file.
  
! `-dN'
!      Like `-dD', but emit only the macro names, not their expansions.
  
! `-dU'
!      Like `dD' except that only macros that are expanded, or whose
       definedness is tested in preprocessor directives, are output; the
       output is delayed until the use or test of the macro; and
!      `'#undef'' directives are also output for macros tested but
       undefined at the time.
  
! `-dI'
!      Output `'#include'' directives in addition to the result of
       preprocessing.
  
! `-fworking-directory'
       Enable generation of linemarkers in the preprocessor output that
       will let the compiler know the current working directory at the
!      time of preprocessing. When this option is enabled, the
       preprocessor will emit, after the initial linemarker, a second
       linemarker with the current working directory followed by two
!      slashes. GCC will use this directory, when it is present in the
!      preprocessed input, as the directory emitted as the current
!      working directory in some debugging information formats.  This
!      option is implicitly enabled if debugging information is enabled,
!      but this can be inhibited with the negated form
!      `-fno-working-directory'. If the `-P' flag is present in the
!      command line, this option has no effect, since no `#line'
!      directives are emitted whatsoever.
  
! `-idirafter DIR'
       Search DIR for include files, but do it after all directories
!      specified with `-I' and the standard system directories have been
!      exhausted. DIR is treated as a system include directory.  If dir
!      begins with `=', then the `=' will be replaced by the sysroot
!      prefix; see `--sysroot' and `-isysroot'.
  
! `-imultilib DIR'
       Use DIR as a subdirectory of the directory containing
       target-specific C++ headers.
  
! `-iprefix PREFIX'
!      Specify PREFIX as the prefix for subsequent `-iwithprefix'
!      options. If the PREFIX represents a directory, you should include
!      the final `'/''.
  
! `-isysroot DIR'
!      This option is like the `--sysroot' option, but applies only to
!      header files. See the `--sysroot' option for more information.
  
! `-iquote DIR'
!      Search DIR only for header files requested with `#include "file"';
!      they are not searched for `#include <file>', before all directories
!      specified by `-I' and before the standard system directories. If
!      DIR begins with `=', then the `=' will be replaced by the sysroot
!      prefix; see `--sysroot' and `-isysroot'.
  
! `-isystem DIR'
       Search DIR for header files, after all directories specified by
!      `-I' but before the standard system directories. Mark it as a
       system directory, so that it gets the same special treatment as is
!      applied to the standard system directories. If DIR begins with
!      `=', then the `=' will be replaced by the sysroot prefix; see
!      `--sysroot' and `-isysroot'.
  
! `-nostdinc'
       Do not search the standard system directories for header files.
!      Only the directories you have specified with `-I' options (and the
       directory of the current file, if appropriate) are searched.
  
! `-undef'
       Do not predefine any system-specific or GCC-specific macros.  The
       standard predefined macros remain defined.
  
! `-APREDICATE=ANSWER'
       Make an assertion with the predicate PREDICATE and answer ANSWER.
       This form is preferred to the older form -A predicate(answer),
       which is still supported, because it does not use shell special
       characters.
  
! `-A-PREDICATE=ANSWER'
       Cancel an assertion with the predicate PREDICATE and answer ANSWER.
  
! `-C'
!      Do not discard comments. All comments are passed through to the
!      output file, except for comments in processed directives, which
!      are deleted along with the directive.
  
!      You should be prepared for side effects when using `-C'; it causes
       the preprocessor to treat comments as tokens in their own right.
       For example, comments appearing at the start of what would be a
       directive line have the effect of turning that line into an
       ordinary source line, since the first token on the line is no
!      longer a `'#''.
  
!      Warning: this currently handles C-Style comments only. The
       preprocessor does not yet recognize Fortran-style comments.
  
! `-CC'
!      Do not discard comments, including during macro expansion. This is
!      like `-C', except that comments contained within macros are also
       passed through to the output file where the macro is expanded.
  
!      In addition to the side-effects of the `-C' option, the `-CC'
!      option causes all C++-style comments inside a macro to be
!      converted to C-style comments. This is to prevent later use of
!      that macro from inadvertently commenting out the remainder of the
!      source line. The `-CC' option is generally used to support lint
!      comments.
  
!      Warning: this currently handles C- and C++-Style comments only. The
!      preprocessor does not yet recognize Fortran-style comments.
  
! `-DNAME'
!      Predefine name as a macro, with definition `1'.
  
! `-DNAME=DEFINITION'
       The contents of DEFINITION are tokenized and processed as if they
!      appeared during translation phase three in a `'#define'' directive.
       In particular, the definition will be truncated by embedded newline
       characters.
  
--- 689,844 ----
  2.3 Enable and customize preprocessing
  ======================================
  
! Preprocessor related options.  See section *note Preprocessing and
! conditional compilation:: for more detailed information on preprocessing
! in 'gfortran'.
  
! '-cpp'
! '-nocpp'
!      Enable preprocessing.  The preprocessor is automatically invoked if
!      the file extension is '.fpp', '.FPP', '.F', '.FOR', '.FTN', '.F90',
!      '.F95', '.F03' or '.F08'.  Use this option to manually enable
!      preprocessing of any kind of Fortran file.
  
       To disable preprocessing of files with any of the above listed
!      extensions, use the negative form: '-nocpp'.
  
!      The preprocessor is run in traditional mode.  Any restrictions of
       the file-format, especially the limits on line length, apply for
       preprocessed output as well, so it might be advisable to use the
!      '-ffree-line-length-none' or '-ffixed-line-length-none' options.
  
! '-dM'
!      Instead of the normal output, generate a list of ''#define''
       directives for all the macros defined during the execution of the
!      preprocessor, including predefined macros.  This gives you a way of
       finding out what is predefined in your version of the preprocessor.
!      Assuming you have no file 'foo.f90', the command
              touch foo.f90; gfortran -cpp -E -dM foo.f90
       will show all the predefined macros.
  
! '-dD'
!      Like '-dM' except in two respects: it does not include the
!      predefined macros, and it outputs both the '#define' directives and
!      the result of preprocessing.  Both kinds of output go to the
       standard output file.
  
! '-dN'
!      Like '-dD', but emit only the macro names, not their expansions.
  
! '-dU'
!      Like 'dD' except that only macros that are expanded, or whose
       definedness is tested in preprocessor directives, are output; the
       output is delayed until the use or test of the macro; and
!      ''#undef'' directives are also output for macros tested but
       undefined at the time.
  
! '-dI'
!      Output ''#include'' directives in addition to the result of
       preprocessing.
  
! '-fworking-directory'
       Enable generation of linemarkers in the preprocessor output that
       will let the compiler know the current working directory at the
!      time of preprocessing.  When this option is enabled, the
       preprocessor will emit, after the initial linemarker, a second
       linemarker with the current working directory followed by two
!      slashes.  GCC will use this directory, when it is present in the
!      preprocessed input, as the directory emitted as the current working
!      directory in some debugging information formats.  This option is
!      implicitly enabled if debugging information is enabled, but this
!      can be inhibited with the negated form '-fno-working-directory'.
!      If the '-P' flag is present in the command line, this option has no
!      effect, since no '#line' directives are emitted whatsoever.
  
! '-idirafter DIR'
       Search DIR for include files, but do it after all directories
!      specified with '-I' and the standard system directories have been
!      exhausted.  DIR is treated as a system include directory.  If dir
!      begins with '=', then the '=' will be replaced by the sysroot
!      prefix; see '--sysroot' and '-isysroot'.
  
! '-imultilib DIR'
       Use DIR as a subdirectory of the directory containing
       target-specific C++ headers.
  
! '-iprefix PREFIX'
!      Specify PREFIX as the prefix for subsequent '-iwithprefix' options.
!      If the PREFIX represents a directory, you should include the final
!      ''/''.
  
! '-isysroot DIR'
!      This option is like the '--sysroot' option, but applies only to
!      header files.  See the '--sysroot' option for more information.
  
! '-iquote DIR'
!      Search DIR only for header files requested with '#include "file"';
!      they are not searched for '#include <file>', before all directories
!      specified by '-I' and before the standard system directories.  If
!      DIR begins with '=', then the '=' will be replaced by the sysroot
!      prefix; see '--sysroot' and '-isysroot'.
  
! '-isystem DIR'
       Search DIR for header files, after all directories specified by
!      '-I' but before the standard system directories.  Mark it as a
       system directory, so that it gets the same special treatment as is
!      applied to the standard system directories.  If DIR begins with
!      '=', then the '=' will be replaced by the sysroot prefix; see
!      '--sysroot' and '-isysroot'.
  
! '-nostdinc'
       Do not search the standard system directories for header files.
!      Only the directories you have specified with '-I' options (and the
       directory of the current file, if appropriate) are searched.
  
! '-undef'
       Do not predefine any system-specific or GCC-specific macros.  The
       standard predefined macros remain defined.
  
! '-APREDICATE=ANSWER'
       Make an assertion with the predicate PREDICATE and answer ANSWER.
       This form is preferred to the older form -A predicate(answer),
       which is still supported, because it does not use shell special
       characters.
  
! '-A-PREDICATE=ANSWER'
       Cancel an assertion with the predicate PREDICATE and answer ANSWER.
  
! '-C'
!      Do not discard comments.  All comments are passed through to the
!      output file, except for comments in processed directives, which are
!      deleted along with the directive.
  
!      You should be prepared for side effects when using '-C'; it causes
       the preprocessor to treat comments as tokens in their own right.
       For example, comments appearing at the start of what would be a
       directive line have the effect of turning that line into an
       ordinary source line, since the first token on the line is no
!      longer a ''#''.
  
!      Warning: this currently handles C-Style comments only.  The
       preprocessor does not yet recognize Fortran-style comments.
  
! '-CC'
!      Do not discard comments, including during macro expansion.  This is
!      like '-C', except that comments contained within macros are also
       passed through to the output file where the macro is expanded.
  
!      In addition to the side-effects of the '-C' option, the '-CC'
!      option causes all C++-style comments inside a macro to be converted
!      to C-style comments.  This is to prevent later use of that macro
!      from inadvertently commenting out the remainder of the source line.
!      The '-CC' option is generally used to support lint comments.
  
!      Warning: this currently handles C- and C++-Style comments only.
!      The preprocessor does not yet recognize Fortran-style comments.
  
! '-DNAME'
!      Predefine name as a macro, with definition '1'.
  
! '-DNAME=DEFINITION'
       The contents of DEFINITION are tokenized and processed as if they
!      appeared during translation phase three in a ''#define'' directive.
       In particular, the definition will be truncated by embedded newline
       characters.
  
*************** preprocessing in `gfortran'.
*** 849,876 ****
  
       If you wish to define a function-like macro on the command line,
       write its argument list with surrounding parentheses before the
!      equals sign (if any). Parentheses are meaningful to most shells,
!      so you will need to quote the option. With sh and csh,
!      `-D'name(args...)=definition'' works.
  
!      `-D' and `-U' options are processed in the order they are given on
!      the command line. All -imacros file and -include file options are
       processed after all -D and -U options.
  
! `-H'
       Print the name of each header file used, in addition to other
!      normal activities. Each name is indented to show how deep in the
!      `'#include'' stack it is.
  
! `-P'
       Inhibit generation of linemarkers in the output from the
       preprocessor.  This might be useful when running the preprocessor
       on something that is not C code, and will be sent to a program
       which might be confused by the linemarkers.
  
! `-UNAME'
       Cancel any previous definition of NAME, either built in or provided
!      with a `-D' option.
  
  
  File: gfortran.info,  Node: Error and Warning Options,  Next: Debugging Options,  Prev: Preprocessing Options,  Up: Invoking GNU Fortran
--- 848,875 ----
  
       If you wish to define a function-like macro on the command line,
       write its argument list with surrounding parentheses before the
!      equals sign (if any).  Parentheses are meaningful to most shells,
!      so you will need to quote the option.  With sh and csh,
!      '-D'name(args...)=definition'' works.
  
!      '-D' and '-U' options are processed in the order they are given on
!      the command line.  All -imacros file and -include file options are
       processed after all -D and -U options.
  
! '-H'
       Print the name of each header file used, in addition to other
!      normal activities.  Each name is indented to show how deep in the
!      ''#include'' stack it is.
  
! '-P'
       Inhibit generation of linemarkers in the output from the
       preprocessor.  This might be useful when running the preprocessor
       on something that is not C code, and will be sent to a program
       which might be confused by the linemarkers.
  
! '-UNAME'
       Cancel any previous definition of NAME, either built in or provided
!      with a '-D' option.
  
  
  File: gfortran.info,  Node: Error and Warning Options,  Next: Debugging Options,  Prev: Preprocessing Options,  Up: Invoking GNU Fortran
*************** to aid in debugging, but will not produc
*** 885,949 ****
  
     Warnings are diagnostic messages that report constructions which are
  not inherently erroneous but which are risky or suggest there is likely
! to be a bug in the program.  Unless `-Werror' is specified, they do not
  prevent compilation of the program.
  
!    You can request many specific warnings with options beginning `-W',
! for example `-Wimplicit' to request warnings on implicit declarations.
  Each of these specific warning options also has a negative form
! beginning `-Wno-' to turn off warnings; for example, `-Wno-implicit'.
  This manual lists only one of the two forms, whichever is not the
  default.
  
     These options control the amount and kinds of errors and warnings
  produced by GNU Fortran:
  
! `-fmax-errors=N'
       Limits the maximum number of error messages to N, at which point
!      GNU Fortran bails out rather than attempting to continue
!      processing the source code.  If N is 0, there is no limit on the
!      number of error messages produced.
  
! `-fsyntax-only'
       Check the code for syntax errors, but do not actually compile it.
       This will generate module files for each module present in the
       code, but no other output file.
  
! `-pedantic'
!      Issue warnings for uses of extensions to Fortran 95.  `-pedantic'
       also applies to C-language constructs where they occur in GNU
!      Fortran source files, such as use of `\e' in a character constant
!      within a directive like `#include'.
  
       Valid Fortran 95 programs should compile properly with or without
       this option.  However, without this option, certain GNU extensions
       and traditional Fortran features are supported as well.  With this
       option, many of them are rejected.
  
!      Some users try to use `-pedantic' to check programs for
       conformance.  They soon find that it does not do quite what they
       want--it finds some nonstandard practices, but not all.  However,
       improvements to GNU Fortran in this area are welcome.
  
!      This should be used in conjunction with `-std=f95', `-std=f2003'
!      or `-std=f2008'.
  
! `-pedantic-errors'
!      Like `-pedantic', except that errors are produced rather than
       warnings.
  
! `-Wall'
       Enables commonly used warning options pertaining to usage that we
       recommend avoiding and that we believe are easy to avoid.  This
!      currently includes `-Waliasing', `-Wampersand', `-Wconversion',
!      `-Wsurprising', `-Wc-binding-type', `-Wintrinsics-std', `-Wtabs',
!      `-Wintrinsic-shadow', `-Wline-truncation', `-Wtarget-lifetime',
!      `-Wreal-q-constant' and `-Wunused'.
  
! `-Waliasing'
!      Warn about possible aliasing of dummy arguments. Specifically, it
       warns if the same actual argument is associated with a dummy
!      argument with `INTENT(IN)' and a dummy argument with `INTENT(OUT)'
       in a call with an explicit interface.
  
       The following example will trigger the warning.
--- 884,948 ----
  
     Warnings are diagnostic messages that report constructions which are
  not inherently erroneous but which are risky or suggest there is likely
! to be a bug in the program.  Unless '-Werror' is specified, they do not
  prevent compilation of the program.
  
!    You can request many specific warnings with options beginning '-W',
! for example '-Wimplicit' to request warnings on implicit declarations.
  Each of these specific warning options also has a negative form
! beginning '-Wno-' to turn off warnings; for example, '-Wno-implicit'.
  This manual lists only one of the two forms, whichever is not the
  default.
  
     These options control the amount and kinds of errors and warnings
  produced by GNU Fortran:
  
! '-fmax-errors=N'
       Limits the maximum number of error messages to N, at which point
!      GNU Fortran bails out rather than attempting to continue processing
!      the source code.  If N is 0, there is no limit on the number of
!      error messages produced.
  
! '-fsyntax-only'
       Check the code for syntax errors, but do not actually compile it.
       This will generate module files for each module present in the
       code, but no other output file.
  
! '-pedantic'
!      Issue warnings for uses of extensions to Fortran 95.  '-pedantic'
       also applies to C-language constructs where they occur in GNU
!      Fortran source files, such as use of '\e' in a character constant
!      within a directive like '#include'.
  
       Valid Fortran 95 programs should compile properly with or without
       this option.  However, without this option, certain GNU extensions
       and traditional Fortran features are supported as well.  With this
       option, many of them are rejected.
  
!      Some users try to use '-pedantic' to check programs for
       conformance.  They soon find that it does not do quite what they
       want--it finds some nonstandard practices, but not all.  However,
       improvements to GNU Fortran in this area are welcome.
  
!      This should be used in conjunction with '-std=f95', '-std=f2003' or
!      '-std=f2008'.
  
! '-pedantic-errors'
!      Like '-pedantic', except that errors are produced rather than
       warnings.
  
! '-Wall'
       Enables commonly used warning options pertaining to usage that we
       recommend avoiding and that we believe are easy to avoid.  This
!      currently includes '-Waliasing', '-Wampersand', '-Wconversion',
!      '-Wsurprising', '-Wc-binding-type', '-Wintrinsics-std', '-Wtabs',
!      '-Wintrinsic-shadow', '-Wline-truncation', '-Wtarget-lifetime',
!      '-Wreal-q-constant' and '-Wunused'.
  
! '-Waliasing'
!      Warn about possible aliasing of dummy arguments.  Specifically, it
       warns if the same actual argument is associated with a dummy
!      argument with 'INTENT(IN)' and a dummy argument with 'INTENT(OUT)'
       in a call with an explicit interface.
  
       The following example will trigger the warning.
*************** produced by GNU Fortran:
*** 957,1026 ****
  
              call bar(a,a)
  
! `-Wampersand'
!      Warn about missing ampersand in continued character constants. The
!      warning is given with `-Wampersand', `-pedantic', `-std=f95',
!      `-std=f2003' and `-std=f2008'. Note: With no ampersand given in a
       continued character constant, GNU Fortran assumes continuation at
       the first non-comment, non-whitespace character after the ampersand
       that initiated the continuation.
  
! `-Warray-temporaries'
       Warn about array temporaries generated by the compiler.  The
       information generated by this warning is sometimes useful in
       optimization, in order to avoid such temporaries.
  
! `-Wc-binding-type'
       Warn if the a variable might not be C interoperable.  In
       particular, warn if the variable has been declared using an
       intrinsic type with default kind instead of using a kind parameter
!      defined for C interoperability in the intrinsic `ISO_C_Binding'
!      module.  This option is implied by `-Wall'.
  
! `-Wcharacter-truncation'
       Warn when a character assignment will truncate the assigned string.
  
! `-Wline-truncation'
       Warn when a source code line will be truncated.  This option is
!      implied by `-Wall'.  For free-form source code, the default is
!      `-Werror=line-truncation' such that truncations are reported as
       error.
  
! `-Wconversion'
!      Warn about implicit conversions that are likely to change the
!      value of the expression after conversion. Implied by `-Wall'.
  
! `-Wconversion-extra'
       Warn about implicit conversions between different types and kinds.
!      This option does _not_ imply `-Wconversion'.
  
! `-Wextra'
       Enables some warning options for usages of language features which
!      may be problematic. This currently includes `-Wcompare-reals' and
!      `-Wunused-parameter'.
  
! `-Wimplicit-interface'
       Warn if a procedure is called without an explicit interface.  Note
       this only checks that an explicit interface is present.  It does
       not check that the declared interfaces are consistent across
       program units.
  
! `-Wimplicit-procedure'
       Warn if a procedure is called that has neither an explicit
!      interface nor has been declared as `EXTERNAL'.
  
! `-Wintrinsics-std'
!      Warn if `gfortran' finds a procedure named like an intrinsic not
!      available in the currently selected standard (with `-std') and
!      treats it as `EXTERNAL' procedure because of this.
!      `-fall-intrinsics' can be used to never trigger this behavior and
       always link to the intrinsic regardless of the selected standard.
  
! `-Wreal-q-constant'
!      Produce a warning if a real-literal-constant contains a `q'
       exponent-letter.
  
! `-Wsurprising'
       Produce a warning when "suspicious" code constructs are
       encountered.  While technically legal these usually indicate that
       an error has been made.
--- 956,1025 ----
  
              call bar(a,a)
  
! '-Wampersand'
!      Warn about missing ampersand in continued character constants.  The
!      warning is given with '-Wampersand', '-pedantic', '-std=f95',
!      '-std=f2003' and '-std=f2008'.  Note: With no ampersand given in a
       continued character constant, GNU Fortran assumes continuation at
       the first non-comment, non-whitespace character after the ampersand
       that initiated the continuation.
  
! '-Warray-temporaries'
       Warn about array temporaries generated by the compiler.  The
       information generated by this warning is sometimes useful in
       optimization, in order to avoid such temporaries.
  
! '-Wc-binding-type'
       Warn if the a variable might not be C interoperable.  In
       particular, warn if the variable has been declared using an
       intrinsic type with default kind instead of using a kind parameter
!      defined for C interoperability in the intrinsic 'ISO_C_Binding'
!      module.  This option is implied by '-Wall'.
  
! '-Wcharacter-truncation'
       Warn when a character assignment will truncate the assigned string.
  
! '-Wline-truncation'
       Warn when a source code line will be truncated.  This option is
!      implied by '-Wall'.  For free-form source code, the default is
!      '-Werror=line-truncation' such that truncations are reported as
       error.
  
! '-Wconversion'
!      Warn about implicit conversions that are likely to change the value
!      of the expression after conversion.  Implied by '-Wall'.
  
! '-Wconversion-extra'
       Warn about implicit conversions between different types and kinds.
!      This option does _not_ imply '-Wconversion'.
  
! '-Wextra'
       Enables some warning options for usages of language features which
!      may be problematic.  This currently includes '-Wcompare-reals' and
!      '-Wunused-parameter'.
  
! '-Wimplicit-interface'
       Warn if a procedure is called without an explicit interface.  Note
       this only checks that an explicit interface is present.  It does
       not check that the declared interfaces are consistent across
       program units.
  
! '-Wimplicit-procedure'
       Warn if a procedure is called that has neither an explicit
!      interface nor has been declared as 'EXTERNAL'.
  
! '-Wintrinsics-std'
!      Warn if 'gfortran' finds a procedure named like an intrinsic not
!      available in the currently selected standard (with '-std') and
!      treats it as 'EXTERNAL' procedure because of this.
!      '-fall-intrinsics' can be used to never trigger this behavior and
       always link to the intrinsic regardless of the selected standard.
  
! '-Wreal-q-constant'
!      Produce a warning if a real-literal-constant contains a 'q'
       exponent-letter.
  
! '-Wsurprising'
       Produce a warning when "suspicious" code constructs are
       encountered.  While technically legal these usually indicate that
       an error has been made.
*************** produced by GNU Fortran:
*** 1037,1128 ****
            destination.
  
          * The type of a function result is declared more than once with
!           the same type.  If `-pedantic' or standard-conforming mode is
            enabled, this is an error.
  
!         * A `CHARACTER' variable is declared with negative length.
  
! `-Wtabs'
       By default, tabs are accepted as whitespace, but tabs are not
       members of the Fortran Character Set.  For continuation lines, a
!      tab followed by a digit between 1 and 9 is supported.  `-Wtabs'
!      will cause a warning to be issued if a tab is encountered. Note,
!      `-Wtabs' is active for `-pedantic', `-std=f95', `-std=f2003',
!      `-std=f2008', `-std=f2008ts' and `-Wall'.
  
! `-Wunderflow'
       Produce a warning when numerical constant expressions are
!      encountered, which yield an UNDERFLOW during compilation. Enabled
       by default.
  
! `-Wintrinsic-shadow'
       Warn if a user-defined procedure or module procedure has the same
       name as an intrinsic; in this case, an explicit interface or
!      `EXTERNAL' or `INTRINSIC' declaration might be needed to get calls
       later resolved to the desired intrinsic/procedure.  This option is
!      implied by `-Wall'.
  
! `-Wuse-without-only'
!      Warn if a `USE' statement has no `ONLY' qualifier and thus
       implicitly imports all public entities of the used module.
  
! `-Wunused-dummy-argument'
!      Warn about unused dummy arguments. This option is implied by
!      `-Wall'.
  
! `-Wunused-parameter'
!      Contrary to `gcc''s meaning of `-Wunused-parameter', `gfortran''s
       implementation of this option does not warn about unused dummy
!      arguments (see `-Wunused-dummy-argument'), but about unused
!      `PARAMETER' values. `-Wunused-parameter' is implied by `-Wextra'
!      if also `-Wunused' or `-Wall' is used.
  
! `-Walign-commons'
!      By default, `gfortran' warns about any occasion of variables being
!      padded for proper alignment inside a `COMMON' block. This warning
!      can be turned off via `-Wno-align-commons'. See also
!      `-falign-commons'.
  
! `-Wfunction-elimination'
       Warn if any calls to functions are eliminated by the optimizations
!      enabled by the `-ffrontend-optimize' option.
  
! `-Wrealloc-lhs'
       Warn when the compiler might insert code to for allocation or
       reallocation of an allocatable array variable of intrinsic type in
!      intrinsic assignments.  In hot loops, the Fortran 2003
!      reallocation feature may reduce the performance.  If the array is
!      already allocated with the correct shape, consider using a
!      whole-array array-spec (e.g. `(:,:,:)') for the variable on the
!      left-hand side to prevent the reallocation check. Note that in
!      some cases the warning is shown, even if the compiler will
!      optimize reallocation checks away.  For instance, when the
!      right-hand side contains the same variable multiplied by a scalar.
!      See also `-frealloc-lhs'.
  
! `-Wrealloc-lhs-all'
       Warn when the compiler inserts code to for allocation or
       reallocation of an allocatable variable; this includes scalars and
       derived types.
  
! `-Wcompare-reals'
       Warn when comparing real or complex types for equality or
!      inequality.  This option is implied by `-Wextra'.
  
! `-Wtarget-lifetime'
       Warn if the pointer in a pointer assignment might be longer than
!      the its target. This option is implied by `-Wall'.
  
! `-Wzerotrip'
!      Warn if a `DO' loop is known to execute zero times at compile
!      time.  This option is implied by `-Wall'.
  
! `-Werror'
       Turns all warnings into errors.
  
     *Note Options to Request or Suppress Errors and Warnings:
! (gcc)Warning Options, for information on more options offered by the
! GBE shared by `gfortran', `gcc' and other GNU compilers.
  
     Some of these have no effect when compiling programs written in
  Fortran.
--- 1036,1126 ----
            destination.
  
          * The type of a function result is declared more than once with
!           the same type.  If '-pedantic' or standard-conforming mode is
            enabled, this is an error.
  
!         * A 'CHARACTER' variable is declared with negative length.
  
! '-Wtabs'
       By default, tabs are accepted as whitespace, but tabs are not
       members of the Fortran Character Set.  For continuation lines, a
!      tab followed by a digit between 1 and 9 is supported.  '-Wtabs'
!      will cause a warning to be issued if a tab is encountered.  Note,
!      '-Wtabs' is active for '-pedantic', '-std=f95', '-std=f2003',
!      '-std=f2008', '-std=f2008ts' and '-Wall'.
  
! '-Wunderflow'
       Produce a warning when numerical constant expressions are
!      encountered, which yield an UNDERFLOW during compilation.  Enabled
       by default.
  
! '-Wintrinsic-shadow'
       Warn if a user-defined procedure or module procedure has the same
       name as an intrinsic; in this case, an explicit interface or
!      'EXTERNAL' or 'INTRINSIC' declaration might be needed to get calls
       later resolved to the desired intrinsic/procedure.  This option is
!      implied by '-Wall'.
  
! '-Wuse-without-only'
!      Warn if a 'USE' statement has no 'ONLY' qualifier and thus
       implicitly imports all public entities of the used module.
  
! '-Wunused-dummy-argument'
!      Warn about unused dummy arguments.  This option is implied by
!      '-Wall'.
  
! '-Wunused-parameter'
!      Contrary to 'gcc''s meaning of '-Wunused-parameter', 'gfortran''s
       implementation of this option does not warn about unused dummy
!      arguments (see '-Wunused-dummy-argument'), but about unused
!      'PARAMETER' values.  '-Wunused-parameter' is implied by '-Wextra'
!      if also '-Wunused' or '-Wall' is used.
  
! '-Walign-commons'
!      By default, 'gfortran' warns about any occasion of variables being
!      padded for proper alignment inside a 'COMMON' block.  This warning
!      can be turned off via '-Wno-align-commons'.  See also
!      '-falign-commons'.
  
! '-Wfunction-elimination'
       Warn if any calls to functions are eliminated by the optimizations
!      enabled by the '-ffrontend-optimize' option.
  
! '-Wrealloc-lhs'
       Warn when the compiler might insert code to for allocation or
       reallocation of an allocatable array variable of intrinsic type in
!      intrinsic assignments.  In hot loops, the Fortran 2003 reallocation
!      feature may reduce the performance.  If the array is already
!      allocated with the correct shape, consider using a whole-array
!      array-spec (e.g.  '(:,:,:)') for the variable on the left-hand side
!      to prevent the reallocation check.  Note that in some cases the
!      warning is shown, even if the compiler will optimize reallocation
!      checks away.  For instance, when the right-hand side contains the
!      same variable multiplied by a scalar.  See also '-frealloc-lhs'.
  
! '-Wrealloc-lhs-all'
       Warn when the compiler inserts code to for allocation or
       reallocation of an allocatable variable; this includes scalars and
       derived types.
  
! '-Wcompare-reals'
       Warn when comparing real or complex types for equality or
!      inequality.  This option is implied by '-Wextra'.
  
! '-Wtarget-lifetime'
       Warn if the pointer in a pointer assignment might be longer than
!      the its target.  This option is implied by '-Wall'.
  
! '-Wzerotrip'
!      Warn if a 'DO' loop is known to execute zero times at compile time.
!      This option is implied by '-Wall'.
  
! '-Werror'
       Turns all warnings into errors.
  
     *Note Options to Request or Suppress Errors and Warnings:
! (gcc)Warning Options, for information on more options offered by the GBE
! shared by 'gfortran', 'gcc' and other GNU compilers.
  
     Some of these have no effect when compiling programs written in
  Fortran.
*************** File: gfortran.info,  Node: Debugging Op
*** 1136,1203 ****
  GNU Fortran has various special options that are used for debugging
  either your program or the GNU Fortran compiler.
  
! `-fdump-fortran-original'
       Output the internal parse tree after translating the source program
       into internal representation.  Only really useful for debugging the
       GNU Fortran compiler itself.
  
! `-fdump-fortran-optimized'
       Output the parse tree after front-end optimization.  Only really
       useful for debugging the GNU Fortran compiler itself.
  
! `-fdump-parse-tree'
       Output the internal parse tree after translating the source program
       into internal representation.  Only really useful for debugging the
       GNU Fortran compiler itself.  This option is deprecated; use
!      `-fdump-fortran-original' instead.
  
! `-ffpe-trap=LIST'
       Specify a list of floating point exception traps to enable.  On
!      most systems, if a floating point exception occurs and the trap
!      for that exception is enabled, a SIGFPE signal will be sent and
!      the program being aborted, producing a core file useful for
!      debugging.  LIST is a (possibly empty) comma-separated list of the
!      following exceptions: `invalid' (invalid floating point operation,
!      such as `SQRT(-1.0)'), `zero' (division by zero), `overflow'
!      (overflow in a floating point operation), `underflow' (underflow
!      in a floating point operation), `inexact' (loss of precision
!      during operation), and `denormal' (operation performed on a
!      denormal value).  The first five exceptions correspond to the five
!      IEEE 754 exceptions, whereas the last one (`denormal') is not part
!      of the IEEE 754 standard but is available on some common
!      architectures such as x86.
  
!      The first three exceptions (`invalid', `zero', and `overflow')
       often indicate serious errors, and unless the program has
       provisions for dealing with these exceptions, enabling traps for
       these three exceptions is probably a good idea.
  
       Many, if not most, floating point operations incur loss of
!      precision due to rounding, and hence the `ffpe-trap=inexact' is
       likely to be uninteresting in practice.
  
       By default no exception traps are enabled.
  
! `-ffpe-summary=LIST'
       Specify a list of floating-point exceptions, whose flag status is
!      printed to `ERROR_UNIT' when invoking `STOP' and `ERROR STOP'.
!      LIST can be either `none', `all' or a comma-separated list of the
!      following exceptions: `invalid', `zero', `overflow', `underflow',
!      `inexact' and `denormal'. (See `-ffpe-trap' for a description of
       the exceptions.)
  
!      By default, a summary for all exceptions but `inexact' is shown.
  
! `-fno-backtrace'
       When a serious runtime error is encountered or a deadly signal is
       emitted (segmentation fault, illegal instruction, bus error,
       floating-point exception, and the other POSIX signals that have the
!      action `core'), the Fortran runtime library tries to output a
!      backtrace of the error. `-fno-backtrace' disables the backtrace
!      generation. This option only has influence for compilation of the
       Fortran main program.
  
- 
     *Note Options for Debugging Your Program or GCC: (gcc)Debugging
  Options, for more information on debugging options.
  
--- 1134,1199 ----
  GNU Fortran has various special options that are used for debugging
  either your program or the GNU Fortran compiler.
  
! '-fdump-fortran-original'
       Output the internal parse tree after translating the source program
       into internal representation.  Only really useful for debugging the
       GNU Fortran compiler itself.
  
! '-fdump-fortran-optimized'
       Output the parse tree after front-end optimization.  Only really
       useful for debugging the GNU Fortran compiler itself.
  
! '-fdump-parse-tree'
       Output the internal parse tree after translating the source program
       into internal representation.  Only really useful for debugging the
       GNU Fortran compiler itself.  This option is deprecated; use
!      '-fdump-fortran-original' instead.
  
! '-ffpe-trap=LIST'
       Specify a list of floating point exception traps to enable.  On
!      most systems, if a floating point exception occurs and the trap for
!      that exception is enabled, a SIGFPE signal will be sent and the
!      program being aborted, producing a core file useful for debugging.
!      LIST is a (possibly empty) comma-separated list of the following
!      exceptions: 'invalid' (invalid floating point operation, such as
!      'SQRT(-1.0)'), 'zero' (division by zero), 'overflow' (overflow in a
!      floating point operation), 'underflow' (underflow in a floating
!      point operation), 'inexact' (loss of precision during operation),
!      and 'denormal' (operation performed on a denormal value).  The
!      first five exceptions correspond to the five IEEE 754 exceptions,
!      whereas the last one ('denormal') is not part of the IEEE 754
!      standard but is available on some common architectures such as x86.
  
!      The first three exceptions ('invalid', 'zero', and 'overflow')
       often indicate serious errors, and unless the program has
       provisions for dealing with these exceptions, enabling traps for
       these three exceptions is probably a good idea.
  
       Many, if not most, floating point operations incur loss of
!      precision due to rounding, and hence the 'ffpe-trap=inexact' is
       likely to be uninteresting in practice.
  
       By default no exception traps are enabled.
  
! '-ffpe-summary=LIST'
       Specify a list of floating-point exceptions, whose flag status is
!      printed to 'ERROR_UNIT' when invoking 'STOP' and 'ERROR STOP'.
!      LIST can be either 'none', 'all' or a comma-separated list of the
!      following exceptions: 'invalid', 'zero', 'overflow', 'underflow',
!      'inexact' and 'denormal'.  (See '-ffpe-trap' for a description of
       the exceptions.)
  
!      By default, a summary for all exceptions but 'inexact' is shown.
  
! '-fno-backtrace'
       When a serious runtime error is encountered or a deadly signal is
       emitted (segmentation fault, illegal instruction, bus error,
       floating-point exception, and the other POSIX signals that have the
!      action 'core'), the Fortran runtime library tries to output a
!      backtrace of the error.  '-fno-backtrace' disables the backtrace
!      generation.  This option only has influence for compilation of the
       Fortran main program.
  
     *Note Options for Debugging Your Program or GCC: (gcc)Debugging
  Options, for more information on debugging options.
  
*************** File: gfortran.info,  Node: Directory Op
*** 1207,1242 ****
  2.6 Options for directory search
  ================================
  
! These options affect how GNU Fortran searches for files specified by
! the `INCLUDE' directive and where it searches for previously compiled
  modules.
  
!    It also affects the search paths used by `cpp' when used to
  preprocess Fortran source.
  
! `-IDIR'
!      These affect interpretation of the `INCLUDE' directive (as well as
!      of the `#include' directive of the `cpp' preprocessor).
  
!      Also note that the general behavior of `-I' and `INCLUDE' is
!      pretty much the same as of `-I' with `#include' in the `cpp'
!      preprocessor, with regard to looking for `header.gcc' files and
!      other such things.
  
!      This path is also used to search for `.mod' files when previously
!      compiled modules are required by a `USE' statement.
  
       *Note Options for Directory Search: (gcc)Directory Options, for
!      information on the `-I' option.
  
! `-JDIR'
!      This option specifies where to put `.mod' files for compiled
       modules.  It is also added to the list of directories to searched
!      by an `USE' statement.
  
       The default is the current directory.
  
! `-fintrinsic-modules-path DIR'
       This option specifies the location of pre-compiled intrinsic
       modules, if they are not in the default location expected by the
       compiler.
--- 1203,1238 ----
  2.6 Options for directory search
  ================================
  
! These options affect how GNU Fortran searches for files specified by the
! 'INCLUDE' directive and where it searches for previously compiled
  modules.
  
!    It also affects the search paths used by 'cpp' when used to
  preprocess Fortran source.
  
! '-IDIR'
!      These affect interpretation of the 'INCLUDE' directive (as well as
!      of the '#include' directive of the 'cpp' preprocessor).
  
!      Also note that the general behavior of '-I' and 'INCLUDE' is pretty
!      much the same as of '-I' with '#include' in the 'cpp' preprocessor,
!      with regard to looking for 'header.gcc' files and other such
!      things.
  
!      This path is also used to search for '.mod' files when previously
!      compiled modules are required by a 'USE' statement.
  
       *Note Options for Directory Search: (gcc)Directory Options, for
!      information on the '-I' option.
  
! '-JDIR'
!      This option specifies where to put '.mod' files for compiled
       modules.  It is also added to the list of directories to searched
!      by an 'USE' statement.
  
       The default is the current directory.
  
! '-fintrinsic-modules-path DIR'
       This option specifies the location of pre-compiled intrinsic
       modules, if they are not in the default location expected by the
       compiler.
*************** File: gfortran.info,  Node: Link Options
*** 1248,1260 ****
  ================================
  
  These options come into play when the compiler links object files into
! an executable output file. They are meaningless if the compiler is not
  doing a link step.
  
! `-static-libgfortran'
!      On systems that provide `libgfortran' as a shared and a static
!      library, this option forces the use of the static version. If no
!      shared version of `libgfortran' was built when the compiler was
       configured, this option has no effect.
  
  
--- 1244,1256 ----
  ================================
  
  These options come into play when the compiler links object files into
! an executable output file.  They are meaningless if the compiler is not
  doing a link step.
  
! '-static-libgfortran'
!      On systems that provide 'libgfortran' as a shared and a static
!      library, this option forces the use of the static version.  If no
!      shared version of 'libgfortran' was built when the compiler was
       configured, this option has no effect.
  
  
*************** File: gfortran.info,  Node: Runtime Opti
*** 1266,1303 ****
  These options affect the runtime behavior of programs compiled with GNU
  Fortran.
  
! `-fconvert=CONVERSION'
       Specify the representation of data for unformatted files.  Valid
!      values for conversion are: `native', the default; `swap', swap
!      between big- and little-endian; `big-endian', use big-endian
!      representation for unformatted files; `little-endian', use
       little-endian representation for unformatted files.
  
!      _This option has an effect only when used in the main program.
!      The `CONVERT' specifier and the GFORTRAN_CONVERT_UNIT environment
!      variable override the default specified by `-fconvert'._
  
! `-frecord-marker=LENGTH'
       Specify the length of record markers for unformatted files.  Valid
       values for LENGTH are 4 and 8.  Default is 4.  _This is different
!      from previous versions of `gfortran'_, which specified a default
       record marker length of 8 on most systems.  If you want to read or
!      write files compatible with earlier versions of `gfortran', use
!      `-frecord-marker=8'.
  
! `-fmax-subrecord-length=LENGTH'
       Specify the maximum length for a subrecord.  The maximum permitted
       value for length is 2147483639, which is also the default.  Only
       really useful for use by the gfortran testsuite.
  
! `-fsign-zero'
       When enabled, floating point numbers of value zero with the sign
       bit set are written as negative number in formatted output and
!      treated as negative in the `SIGN' intrinsic.  `-fno-sign-zero'
!      does not print the negative sign of zero values (or values rounded
!      to zero for I/O) and regards zero as positive number in the `SIGN'
!      intrinsic for compatibility with Fortran 77. The default is
!      `-fsign-zero'.
  
  
  File: gfortran.info,  Node: Code Gen Options,  Next: Environment Variables,  Prev: Runtime Options,  Up: Invoking GNU Fortran
--- 1262,1299 ----
  These options affect the runtime behavior of programs compiled with GNU
  Fortran.
  
! '-fconvert=CONVERSION'
       Specify the representation of data for unformatted files.  Valid
!      values for conversion are: 'native', the default; 'swap', swap
!      between big- and little-endian; 'big-endian', use big-endian
!      representation for unformatted files; 'little-endian', use
       little-endian representation for unformatted files.
  
!      _This option has an effect only when used in the main program.  The
!      'CONVERT' specifier and the GFORTRAN_CONVERT_UNIT environment
!      variable override the default specified by '-fconvert'._
  
! '-frecord-marker=LENGTH'
       Specify the length of record markers for unformatted files.  Valid
       values for LENGTH are 4 and 8.  Default is 4.  _This is different
!      from previous versions of 'gfortran'_, which specified a default
       record marker length of 8 on most systems.  If you want to read or
!      write files compatible with earlier versions of 'gfortran', use
!      '-frecord-marker=8'.
  
! '-fmax-subrecord-length=LENGTH'
       Specify the maximum length for a subrecord.  The maximum permitted
       value for length is 2147483639, which is also the default.  Only
       really useful for use by the gfortran testsuite.
  
! '-fsign-zero'
       When enabled, floating point numbers of value zero with the sign
       bit set are written as negative number in formatted output and
!      treated as negative in the 'SIGN' intrinsic.  '-fno-sign-zero' does
!      not print the negative sign of zero values (or values rounded to
!      zero for I/O) and regards zero as positive number in the 'SIGN'
!      intrinsic for compatibility with Fortran 77.  The default is
!      '-fsign-zero'.
  
  
  File: gfortran.info,  Node: Code Gen Options,  Next: Environment Variables,  Prev: Runtime Options,  Up: Invoking GNU Fortran
*************** File: gfortran.info,  Node: Code Gen Opt
*** 1305,1388 ****
  2.9 Options for code generation conventions
  ===========================================
  
! These machine-independent options control the interface conventions
! used in code generation.
  
     Most of them have both positive and negative forms; the negative form
! of `-ffoo' would be `-fno-foo'.  In the table below, only one of the
  forms is listed--the one which is not the default.  You can figure out
! the other form by either removing `no-' or adding it.
  
! `-fno-automatic'
       Treat each program unit (except those marked as RECURSIVE) as if
!      the `SAVE' statement were specified for every local variable and
!      array referenced in it. Does not affect common blocks. (Some
!      Fortran compilers provide this option under the name `-static' or
!      `-save'.)  The default, which is `-fautomatic', uses the stack for
       local variables smaller than the value given by
!      `-fmax-stack-var-size'.  Use the option `-frecursive' to use no
       static memory.
  
! `-ff2c'
       Generate code designed to be compatible with code generated by
!      `g77' and `f2c'.
  
!      The calling conventions used by `g77' (originally implemented in
!      `f2c') require functions that return type default `REAL' to
!      actually return the C type `double', and functions that return
!      type `COMPLEX' to return the values via an extra argument in the
!      calling sequence that points to where to store the return value.
!      Under the default GNU calling conventions, such functions simply
!      return their results as they would in GNU C--default `REAL'
!      functions return the C type `float', and `COMPLEX' functions
!      return the GNU C type `complex'.  Additionally, this option
!      implies the `-fsecond-underscore' option, unless
!      `-fno-second-underscore' is explicitly requested.
  
       This does not affect the generation of code that interfaces with
!      the `libgfortran' library.
  
       _Caution:_ It is not a good idea to mix Fortran code compiled with
!      `-ff2c' with code compiled with the default `-fno-f2c' calling
!      conventions as, calling `COMPLEX' or default `REAL' functions
       between program parts which were compiled with different calling
       conventions will break at execution time.
  
!      _Caution:_ This will break code which passes intrinsic functions
!      of type default `REAL' or `COMPLEX' as actual arguments, as the
!      library implementations use the `-fno-f2c' calling conventions.
  
! `-fno-underscoring'
       Do not transform names of entities specified in the Fortran source
       file by appending underscores to them.
  
!      With `-funderscoring' in effect, GNU Fortran appends one
!      underscore to external names with no underscores.  This is done to
!      ensure compatibility with code produced by many UNIX Fortran
!      compilers.
  
!      _Caution_: The default behavior of GNU Fortran is incompatible
!      with `f2c' and `g77', please use the `-ff2c' option if you want
!      object files compiled with GNU Fortran to be compatible with
!      object code created with these tools.
  
!      Use of `-fno-underscoring' is not recommended unless you are
       experimenting with issues such as integration of GNU Fortran into
       existing system environments (vis-a`-vis existing libraries, tools,
       and so on).
  
!      For example, with `-funderscoring', and assuming that `j()' and
!      `max_count()' are external functions while `my_var' and `lvar' are
       local variables, a statement like
            I = J() + MAX_COUNT (MY_VAR, LVAR)
       is implemented as something akin to:
            i = j_() + max_count__(&my_var__, &lvar);
  
!      With `-fno-underscoring', the same statement is implemented as:
  
            i = j() + max_count(&my_var, &lvar);
  
!      Use of `-fno-underscoring' allows direct specification of
       user-defined names while debugging and when interfacing GNU Fortran
       code with other languages.
  
--- 1301,1383 ----
  2.9 Options for code generation conventions
  ===========================================
  
! These machine-independent options control the interface conventions used
! in code generation.
  
     Most of them have both positive and negative forms; the negative form
! of '-ffoo' would be '-fno-foo'.  In the table below, only one of the
  forms is listed--the one which is not the default.  You can figure out
! the other form by either removing 'no-' or adding it.
  
! '-fno-automatic'
       Treat each program unit (except those marked as RECURSIVE) as if
!      the 'SAVE' statement were specified for every local variable and
!      array referenced in it.  Does not affect common blocks.  (Some
!      Fortran compilers provide this option under the name '-static' or
!      '-save'.)  The default, which is '-fautomatic', uses the stack for
       local variables smaller than the value given by
!      '-fmax-stack-var-size'.  Use the option '-frecursive' to use no
       static memory.
  
! '-ff2c'
       Generate code designed to be compatible with code generated by
!      'g77' and 'f2c'.
  
!      The calling conventions used by 'g77' (originally implemented in
!      'f2c') require functions that return type default 'REAL' to
!      actually return the C type 'double', and functions that return type
!      'COMPLEX' to return the values via an extra argument in the calling
!      sequence that points to where to store the return value.  Under the
!      default GNU calling conventions, such functions simply return their
!      results as they would in GNU C--default 'REAL' functions return the
!      C type 'float', and 'COMPLEX' functions return the GNU C type
!      'complex'.  Additionally, this option implies the
!      '-fsecond-underscore' option, unless '-fno-second-underscore' is
!      explicitly requested.
  
       This does not affect the generation of code that interfaces with
!      the 'libgfortran' library.
  
       _Caution:_ It is not a good idea to mix Fortran code compiled with
!      '-ff2c' with code compiled with the default '-fno-f2c' calling
!      conventions as, calling 'COMPLEX' or default 'REAL' functions
       between program parts which were compiled with different calling
       conventions will break at execution time.
  
!      _Caution:_ This will break code which passes intrinsic functions of
!      type default 'REAL' or 'COMPLEX' as actual arguments, as the
!      library implementations use the '-fno-f2c' calling conventions.
  
! '-fno-underscoring'
       Do not transform names of entities specified in the Fortran source
       file by appending underscores to them.
  
!      With '-funderscoring' in effect, GNU Fortran appends one underscore
!      to external names with no underscores.  This is done to ensure
!      compatibility with code produced by many UNIX Fortran compilers.
  
!      _Caution_: The default behavior of GNU Fortran is incompatible with
!      'f2c' and 'g77', please use the '-ff2c' option if you want object
!      files compiled with GNU Fortran to be compatible with object code
!      created with these tools.
  
!      Use of '-fno-underscoring' is not recommended unless you are
       experimenting with issues such as integration of GNU Fortran into
       existing system environments (vis-a`-vis existing libraries, tools,
       and so on).
  
!      For example, with '-funderscoring', and assuming that 'j()' and
!      'max_count()' are external functions while 'my_var' and 'lvar' are
       local variables, a statement like
            I = J() + MAX_COUNT (MY_VAR, LVAR)
       is implemented as something akin to:
            i = j_() + max_count__(&my_var__, &lvar);
  
!      With '-fno-underscoring', the same statement is implemented as:
  
            i = j() + max_count(&my_var, &lvar);
  
!      Use of '-fno-underscoring' allows direct specification of
       user-defined names while debugging and when interfacing GNU Fortran
       code with other languages.
  
*************** the other form by either removing `no-'
*** 1390,1403 ****
       interface implemented by GNU Fortran for an external name matches
       the interface implemented by some other language for that same
       name.  That is, getting code produced by GNU Fortran to link to
!      code produced by some other compiler using this or any other
!      method can be only a small part of the overall solution--getting
!      the code generated by both compilers to agree on issues other than
!      naming can require significant effort, and, unlike naming
!      disagreements, linkers normally cannot detect disagreements in
!      these other areas.
  
!      Also, note that with `-fno-underscoring', the lack of appended
       underscores introduces the very real possibility that a
       user-defined external name will conflict with a name in a system
       library, which could make finding unresolved-reference bugs quite
--- 1385,1397 ----
       interface implemented by GNU Fortran for an external name matches
       the interface implemented by some other language for that same
       name.  That is, getting code produced by GNU Fortran to link to
!      code produced by some other compiler using this or any other method
!      can be only a small part of the overall solution--getting the code
!      generated by both compilers to agree on issues other than naming
!      can require significant effort, and, unlike naming disagreements,
!      linkers normally cannot detect disagreements in these other areas.
  
!      Also, note that with '-fno-underscoring', the lack of appended
       underscores introduces the very real possibility that a
       user-defined external name will conflict with a name in a system
       library, which could make finding unresolved-reference bugs quite
*************** the other form by either removing `no-'
*** 1405,1462 ****
       show up only as buggy behavior at run time.
  
       In future versions of GNU Fortran we hope to improve naming and
!      linking issues so that debugging always involves using the names
!      as they appear in the source, even if the names as seen by the
!      linker are mangled to prevent accidental linking between
!      procedures with incompatible interfaces.
  
! `-fsecond-underscore'
       By default, GNU Fortran appends an underscore to external names.
!      If this option is used GNU Fortran appends two underscores to
!      names with underscores and one underscore to external names with
!      no underscores.  GNU Fortran also appends two underscores to
!      internal names with underscores to avoid naming collisions with
!      external names.
  
!      This option has no effect if `-fno-underscoring' is in effect.  It
!      is implied by the `-ff2c' option.
  
!      Otherwise, with this option, an external name such as `MAX_COUNT'
       is implemented as a reference to the link-time external symbol
!      `max_count__', instead of `max_count_'.  This is required for
!      compatibility with `g77' and `f2c', and is implied by use of the
!      `-ff2c' option.
  
! `-fcoarray=<KEYWORD>'
  
!     `none'
            Disable coarray support; using coarray declarations and
            image-control statements will produce a compile-time error.
            (Default)
  
!     `single'
!           Single-image mode, i.e. `num_images()' is always one.
  
!     `lib'
            Library-based coarray parallelization; a suitable GNU Fortran
            coarray library needs to be linked.
  
! `-fcheck=<KEYWORD>'
       Enable the generation of run-time checks; the argument shall be a
       comma-delimited list of the following keywords.
  
!     `all'
!           Enable all run-time test of `-fcheck'.
  
!     `array-temps'
            Warns at run time when for passing an actual argument a
!           temporary array had to be generated. The information
!           generated by this warning is sometimes useful in
!           optimization, in order to avoid such temporaries.
  
            Note: The warning is only printed once per location.
  
!     `bounds'
            Enable generation of run-time checks for array subscripts and
            against the declared minimum and maximum values.  It also
            checks array indices for assumed and deferred shape arrays
--- 1399,1457 ----
       show up only as buggy behavior at run time.
  
       In future versions of GNU Fortran we hope to improve naming and
!      linking issues so that debugging always involves using the names as
!      they appear in the source, even if the names as seen by the linker
!      are mangled to prevent accidental linking between procedures with
!      incompatible interfaces.
  
! '-fsecond-underscore'
       By default, GNU Fortran appends an underscore to external names.
!      If this option is used GNU Fortran appends two underscores to names
!      with underscores and one underscore to external names with no
!      underscores.  GNU Fortran also appends two underscores to internal
!      names with underscores to avoid naming collisions with external
!      names.
  
!      This option has no effect if '-fno-underscoring' is in effect.  It
!      is implied by the '-ff2c' option.
  
!      Otherwise, with this option, an external name such as 'MAX_COUNT'
       is implemented as a reference to the link-time external symbol
!      'max_count__', instead of 'max_count_'.  This is required for
!      compatibility with 'g77' and 'f2c', and is implied by use of the
!      '-ff2c' option.
  
! '-fcoarray=<KEYWORD>'
  
!      'none'
            Disable coarray support; using coarray declarations and
            image-control statements will produce a compile-time error.
            (Default)
  
!      'single'
!           Single-image mode, i.e.  'num_images()' is always one.
  
!      'lib'
            Library-based coarray parallelization; a suitable GNU Fortran
            coarray library needs to be linked.
  
! '-fcheck=<KEYWORD>'
! 
       Enable the generation of run-time checks; the argument shall be a
       comma-delimited list of the following keywords.
  
!      'all'
!           Enable all run-time test of '-fcheck'.
  
!      'array-temps'
            Warns at run time when for passing an actual argument a
!           temporary array had to be generated.  The information
!           generated by this warning is sometimes useful in optimization,
!           in order to avoid such temporaries.
  
            Note: The warning is only printed once per location.
  
!      'bounds'
            Enable generation of run-time checks for array subscripts and
            against the declared minimum and maximum values.  It also
            checks array indices for assumed and deferred shape arrays
*************** the other form by either removing `no-'
*** 1464,1502 ****
            string lengths are equal for character array constructors
            without an explicit typespec.
  
!           Some checks require that `-fcheck=bounds' is set for the
            compilation of the main program.
  
            Note: In the future this may also include other forms of
            checking, e.g., checking substring references.
  
!     `do'
            Enable generation of run-time checks for invalid modification
            of loop iteration variables.
  
!     `mem'
            Enable generation of run-time checks for memory allocation.
            Note: This option does not affect explicit allocations using
!           the `ALLOCATE' statement, which will be always checked.
  
!     `pointer'
            Enable generation of run-time checks for pointers and
            allocatables.
  
!     `recursion'
            Enable generation of run-time checks for recursively called
            subroutines and functions which are not marked as recursive.
!           See also `-frecursive'.  Note: This check does not work for
            OpenMP programs and is disabled if used together with
!           `-frecursive' and `-fopenmp'.
  
! `-fbounds-check'
!      Deprecated alias for `-fcheck=bounds'.
  
! `-fcheck-array-temporaries'
!      Deprecated alias for `-fcheck=array-temps'.
  
! `-fmax-array-constructor=N'
       This option can be used to increase the upper limit permitted in
       array constructors.  The code below requires this option to expand
       the array at compile time.
--- 1459,1497 ----
            string lengths are equal for character array constructors
            without an explicit typespec.
  
!           Some checks require that '-fcheck=bounds' is set for the
            compilation of the main program.
  
            Note: In the future this may also include other forms of
            checking, e.g., checking substring references.
  
!      'do'
            Enable generation of run-time checks for invalid modification
            of loop iteration variables.
  
!      'mem'
            Enable generation of run-time checks for memory allocation.
            Note: This option does not affect explicit allocations using
!           the 'ALLOCATE' statement, which will be always checked.
  
!      'pointer'
            Enable generation of run-time checks for pointers and
            allocatables.
  
!      'recursion'
            Enable generation of run-time checks for recursively called
            subroutines and functions which are not marked as recursive.
!           See also '-frecursive'.  Note: This check does not work for
            OpenMP programs and is disabled if used together with
!           '-frecursive' and '-fopenmp'.
  
! '-fbounds-check'
!      Deprecated alias for '-fcheck=bounds'.
  
! '-fcheck-array-temporaries'
!      Deprecated alias for '-fcheck=array-temps'.
  
! '-fmax-array-constructor=N'
       This option can be used to increase the upper limit permitted in
       array constructors.  The code below requires this option to expand
       the array at compile time.
*************** the other form by either removing `no-'
*** 1509,1526 ****
            print '(10(I0,1X))', i
            end program test
  
!      _Caution:  This option can lead to long compile times and
       excessively large object files._
  
       The default value for N is 65535.
  
! `-fmax-stack-var-size=N'
       This option specifies the size in bytes of the largest array that
       will be put on the stack; if the size is exceeded static memory is
       used (except in procedures marked as RECURSIVE). Use the option
!      `-frecursive' to allow for recursive procedures which do not have
!      a RECURSIVE attribute or for parallel programs. Use
!      `-fno-automatic' to never use the stack.
  
       This option currently only affects local arrays declared with
       constant bounds, and may not apply to all character variables.
--- 1504,1521 ----
            print '(10(I0,1X))', i
            end program test
  
!      _Caution: This option can lead to long compile times and
       excessively large object files._
  
       The default value for N is 65535.
  
! '-fmax-stack-var-size=N'
       This option specifies the size in bytes of the largest array that
       will be put on the stack; if the size is exceeded static memory is
       used (except in procedures marked as RECURSIVE). Use the option
!      '-frecursive' to allow for recursive procedures which do not have a
!      RECURSIVE attribute or for parallel programs.  Use '-fno-automatic'
!      to never use the stack.
  
       This option currently only affects local arrays declared with
       constant bounds, and may not apply to all character variables.
*************** the other form by either removing `no-'
*** 1528,1676 ****
  
       The default value for N is 32768.
  
! `-fstack-arrays'
       Adding this option will make the Fortran compiler put all local
       arrays, even those of unknown size onto stack memory.  If your
       program uses very large local arrays it is possible that you will
       have to extend your runtime limits for stack memory on some
!      operating systems. This flag is enabled by default at optimization
!      level `-Ofast'.
  
! `-fpack-derived'
       This option tells GNU Fortran to pack derived type members as
       closely as possible.  Code compiled with this option is likely to
       be incompatible with code compiled without this option, and may
       execute slower.
  
! `-frepack-arrays'
       In some circumstances GNU Fortran may pass assumed shape array
       sections via a descriptor describing a noncontiguous area of
       memory.  This option adds code to the function prologue to repack
       the data into a contiguous block at runtime.
  
!      This should result in faster accesses to the array.  However it
!      can introduce significant overhead to the function call,
!      especially  when the passed data is noncontiguous.
  
! `-fshort-enums'
       This option is provided for interoperability with C code that was
!      compiled with the `-fshort-enums' option.  It will make GNU
!      Fortran choose the smallest `INTEGER' kind a given enumerator set
!      will fit in, and give all its enumerators this kind.
  
! `-fexternal-blas'
!      This option will make `gfortran' generate calls to BLAS functions
!      for some matrix operations like `MATMUL', instead of using our own
       algorithms, if the size of the matrices involved is larger than a
!      given limit (see `-fblas-matmul-limit').  This may be profitable
!      if an optimized vendor BLAS library is available.  The BLAS
!      library will have to be specified at link time.
  
! `-fblas-matmul-limit=N'
!      Only significant when `-fexternal-blas' is in effect.  Matrix
       multiplication of matrices with size larger than (or equal to) N
       will be performed by calls to BLAS functions, while others will be
!      handled by `gfortran' internal algorithms. If the matrices
       involved are not square, the size comparison is performed using the
       geometric mean of the dimensions of the argument and result
       matrices.
  
       The default value for N is 30.
  
! `-frecursive'
       Allow indirect recursion by forcing all local arrays to be
!      allocated on the stack. This flag cannot be used together with
!      `-fmax-stack-var-size=' or `-fno-automatic'.
  
! `-finit-local-zero'
! `-finit-integer=N'
! `-finit-real=<ZERO|INF|-INF|NAN|SNAN>'
! `-finit-logical=<TRUE|FALSE>'
! `-finit-character=N'
!      The `-finit-local-zero' option instructs the compiler to
!      initialize local `INTEGER', `REAL', and `COMPLEX' variables to
!      zero, `LOGICAL' variables to false, and `CHARACTER' variables to a
!      string of null bytes.  Finer-grained initialization options are
!      provided by the `-finit-integer=N',
!      `-finit-real=<ZERO|INF|-INF|NAN|SNAN>' (which also initializes the
!      real and imaginary parts of local `COMPLEX' variables),
!      `-finit-logical=<TRUE|FALSE>', and `-finit-character=N' (where N
!      is an ASCII character value) options.  These options do not
!      initialize
          * allocatable arrays
- 
          * components of derived type variables
! 
!         * variables that appear in an `EQUIVALENCE' statement.
       (These limitations may be removed in future releases).
  
!      Note that the `-finit-real=nan' option initializes `REAL' and
!      `COMPLEX' variables with a quiet NaN. For a signalling NaN use
!      `-finit-real=snan'; note, however, that compile-time optimizations
       may convert them into quiet NaN and that trapping needs to be
!      enabled (e.g. via `-ffpe-trap').
  
!      Finally, note that enabling any of the `-finit-*' options will
!      silence warnings that would have been emitted by `-Wuninitialized'
       for the affected local variables.
  
! `-falign-commons'
!      By default, `gfortran' enforces proper alignment of all variables
!      in a `COMMON' block by padding them as needed. On certain
       platforms this is mandatory, on others it increases performance.
!      If a `COMMON' block is not declared with consistent data types
       everywhere, this padding can cause trouble, and
!      `-fno-align-commons' can be used to disable automatic alignment.
       The same form of this option should be used for all files that
!      share a `COMMON' block.  To avoid potential alignment issues in
!      `COMMON' blocks, it is recommended to order objects from largest
!      to smallest.
  
! `-fno-protect-parens'
       By default the parentheses in expression are honored for all
       optimization levels such that the compiler does not do any
!      re-association. Using `-fno-protect-parens' allows the compiler to
!      reorder `REAL' and `COMPLEX' expressions to produce faster code.
!      Note that for the re-association optimization `-fno-signed-zeros'
!      and `-fno-trapping-math' need to be in effect. The parentheses
!      protection is enabled by default, unless `-Ofast' is given.
  
! `-frealloc-lhs'
       An allocatable left-hand side of an intrinsic assignment is
       automatically (re)allocated if it is either unallocated or has a
!      different shape. The option is enabled by default except when
!      `-std=f95' is given. See also `-Wrealloc-lhs'.
  
! `-faggressive-function-elimination'
       Functions with identical argument lists are eliminated within
!      statements, regardless of whether these functions are marked
!      `PURE' or not. For example, in
              a = f(b,c) + f(b,c)
!      there will only be a single call to `f'.  This option only works
!      if `-ffrontend-optimize' is in effect.
  
! `-ffrontend-optimize'
       This option performs front-end optimization, based on manipulating
!      parts the Fortran parse tree.  Enabled by default by any `-O'
       option.  Optimizations enabled by this option include elimination
       of identical function calls within expressions, removing
!      unnecessary calls to `TRIM' in comparisons and assignments and
!      replacing `TRIM(a)' with `a(1:LEN_TRIM(a))'.  It can be deselected
!      by specifying `-fno-frontend-optimize'.
  
!    *Note Options for Code Generation Conventions: (gcc)Code Gen
! Options, for information on more options offered by the GBE shared by
! `gfortran', `gcc', and other GNU compilers.
  
  
  File: gfortran.info,  Node: Environment Variables,  Prev: Code Gen Options,  Up: Invoking GNU Fortran
  
! 2.10 Environment variables affecting `gfortran'
  ===============================================
  
! The `gfortran' compiler currently does not make use of any environment
  variables to control its operation above and beyond those that affect
! the operation of `gcc'.
  
     *Note Environment Variables Affecting GCC: (gcc)Environment
  Variables, for information on environment variables.
--- 1523,1668 ----
  
       The default value for N is 32768.
  
! '-fstack-arrays'
       Adding this option will make the Fortran compiler put all local
       arrays, even those of unknown size onto stack memory.  If your
       program uses very large local arrays it is possible that you will
       have to extend your runtime limits for stack memory on some
!      operating systems.  This flag is enabled by default at optimization
!      level '-Ofast'.
  
! '-fpack-derived'
       This option tells GNU Fortran to pack derived type members as
       closely as possible.  Code compiled with this option is likely to
       be incompatible with code compiled without this option, and may
       execute slower.
  
! '-frepack-arrays'
       In some circumstances GNU Fortran may pass assumed shape array
       sections via a descriptor describing a noncontiguous area of
       memory.  This option adds code to the function prologue to repack
       the data into a contiguous block at runtime.
  
!      This should result in faster accesses to the array.  However it can
!      introduce significant overhead to the function call, especially
!      when the passed data is noncontiguous.
  
! '-fshort-enums'
       This option is provided for interoperability with C code that was
!      compiled with the '-fshort-enums' option.  It will make GNU Fortran
!      choose the smallest 'INTEGER' kind a given enumerator set will fit
!      in, and give all its enumerators this kind.
  
! '-fexternal-blas'
!      This option will make 'gfortran' generate calls to BLAS functions
!      for some matrix operations like 'MATMUL', instead of using our own
       algorithms, if the size of the matrices involved is larger than a
!      given limit (see '-fblas-matmul-limit').  This may be profitable if
!      an optimized vendor BLAS library is available.  The BLAS library
!      will have to be specified at link time.
  
! '-fblas-matmul-limit=N'
!      Only significant when '-fexternal-blas' is in effect.  Matrix
       multiplication of matrices with size larger than (or equal to) N
       will be performed by calls to BLAS functions, while others will be
!      handled by 'gfortran' internal algorithms.  If the matrices
       involved are not square, the size comparison is performed using the
       geometric mean of the dimensions of the argument and result
       matrices.
  
       The default value for N is 30.
  
! '-frecursive'
       Allow indirect recursion by forcing all local arrays to be
!      allocated on the stack.  This flag cannot be used together with
!      '-fmax-stack-var-size=' or '-fno-automatic'.
  
! '-finit-local-zero'
! '-finit-integer=N'
! '-finit-real=<ZERO|INF|-INF|NAN|SNAN>'
! '-finit-logical=<TRUE|FALSE>'
! '-finit-character=N'
!      The '-finit-local-zero' option instructs the compiler to initialize
!      local 'INTEGER', 'REAL', and 'COMPLEX' variables to zero, 'LOGICAL'
!      variables to false, and 'CHARACTER' variables to a string of null
!      bytes.  Finer-grained initialization options are provided by the
!      '-finit-integer=N', '-finit-real=<ZERO|INF|-INF|NAN|SNAN>' (which
!      also initializes the real and imaginary parts of local 'COMPLEX'
!      variables), '-finit-logical=<TRUE|FALSE>', and '-finit-character=N'
!      (where N is an ASCII character value) options.  These options do
!      not initialize
          * allocatable arrays
          * components of derived type variables
!         * variables that appear in an 'EQUIVALENCE' statement.
       (These limitations may be removed in future releases).
  
!      Note that the '-finit-real=nan' option initializes 'REAL' and
!      'COMPLEX' variables with a quiet NaN. For a signalling NaN use
!      '-finit-real=snan'; note, however, that compile-time optimizations
       may convert them into quiet NaN and that trapping needs to be
!      enabled (e.g.  via '-ffpe-trap').
  
!      Finally, note that enabling any of the '-finit-*' options will
!      silence warnings that would have been emitted by '-Wuninitialized'
       for the affected local variables.
  
! '-falign-commons'
!      By default, 'gfortran' enforces proper alignment of all variables
!      in a 'COMMON' block by padding them as needed.  On certain
       platforms this is mandatory, on others it increases performance.
!      If a 'COMMON' block is not declared with consistent data types
       everywhere, this padding can cause trouble, and
!      '-fno-align-commons' can be used to disable automatic alignment.
       The same form of this option should be used for all files that
!      share a 'COMMON' block.  To avoid potential alignment issues in
!      'COMMON' blocks, it is recommended to order objects from largest to
!      smallest.
  
! '-fno-protect-parens'
       By default the parentheses in expression are honored for all
       optimization levels such that the compiler does not do any
!      re-association.  Using '-fno-protect-parens' allows the compiler to
!      reorder 'REAL' and 'COMPLEX' expressions to produce faster code.
!      Note that for the re-association optimization '-fno-signed-zeros'
!      and '-fno-trapping-math' need to be in effect.  The parentheses
!      protection is enabled by default, unless '-Ofast' is given.
  
! '-frealloc-lhs'
       An allocatable left-hand side of an intrinsic assignment is
       automatically (re)allocated if it is either unallocated or has a
!      different shape.  The option is enabled by default except when
!      '-std=f95' is given.  See also '-Wrealloc-lhs'.
  
! '-faggressive-function-elimination'
       Functions with identical argument lists are eliminated within
!      statements, regardless of whether these functions are marked 'PURE'
!      or not.  For example, in
              a = f(b,c) + f(b,c)
!      there will only be a single call to 'f'.  This option only works if
!      '-ffrontend-optimize' is in effect.
  
! '-ffrontend-optimize'
       This option performs front-end optimization, based on manipulating
!      parts the Fortran parse tree.  Enabled by default by any '-O'
       option.  Optimizations enabled by this option include elimination
       of identical function calls within expressions, removing
!      unnecessary calls to 'TRIM' in comparisons and assignments and
!      replacing 'TRIM(a)' with 'a(1:LEN_TRIM(a))'.  It can be deselected
!      by specifying '-fno-frontend-optimize'.
  
!    *Note Options for Code Generation Conventions: (gcc)Code Gen Options,
! for information on more options offered by the GBE shared by 'gfortran',
! 'gcc', and other GNU compilers.
  
  
  File: gfortran.info,  Node: Environment Variables,  Prev: Code Gen Options,  Up: Invoking GNU Fortran
  
! 2.10 Environment variables affecting 'gfortran'
  ===============================================
  
! The 'gfortran' compiler currently does not make use of any environment
  variables to control its operation above and beyond those that affect
! the operation of 'gcc'.
  
     *Note Environment Variables Affecting GCC: (gcc)Environment
  Variables, for information on environment variables.
*************** behavior of programs compiled with GNU F
*** 1681,1690 ****
  
  File: gfortran.info,  Node: Runtime,  Next: Fortran 2003 and 2008 status,  Prev: Invoking GNU Fortran,  Up: Top
  
! 3 Runtime:  Influencing runtime behavior with environment variables
! *******************************************************************
  
! The behavior of the `gfortran' can be influenced by environment
  variables.
  
     Malformed environment variables are silently ignored.
--- 1673,1682 ----
  
  File: gfortran.info,  Node: Runtime,  Next: Fortran 2003 and 2008 status,  Prev: Invoking GNU Fortran,  Up: Top
  
! 3 Runtime: Influencing runtime behavior with environment variables
! ******************************************************************
  
! The behavior of the 'gfortran' can be influenced by environment
  variables.
  
     Malformed environment variables are silently ignored.
*************** variables.
*** 1707,1732 ****
  
  File: gfortran.info,  Node: TMPDIR,  Next: GFORTRAN_STDIN_UNIT,  Up: Runtime
  
! 3.1 `TMPDIR'--Directory for scratch files
  =========================================
  
! When opening a file with `STATUS='SCRATCH'', GNU Fortran tries to
! create the file in one of the potential directories by testing each
! directory in the order below.
  
!   1. The environment variable `TMPDIR', if it exists.
  
!   2. On the MinGW target, the directory returned by the `GetTempPath'
!      function. Alternatively, on the Cygwin target, the `TMP' and
!      `TEMP' environment variables, if they exist, in that order.
  
!   3. The `P_tmpdir' macro if it is defined, otherwise the directory
!      `/tmp'.
  
  
  File: gfortran.info,  Node: GFORTRAN_STDIN_UNIT,  Next: GFORTRAN_STDOUT_UNIT,  Prev: TMPDIR,  Up: Runtime
  
! 3.2 `GFORTRAN_STDIN_UNIT'--Unit number for standard input
  =========================================================
  
  This environment variable can be used to select the unit number
--- 1699,1724 ----
  
  File: gfortran.info,  Node: TMPDIR,  Next: GFORTRAN_STDIN_UNIT,  Up: Runtime
  
! 3.1 'TMPDIR'--Directory for scratch files
  =========================================
  
! When opening a file with 'STATUS='SCRATCH'', GNU Fortran tries to create
! the file in one of the potential directories by testing each directory
! in the order below.
  
!   1. The environment variable 'TMPDIR', if it exists.
  
!   2. On the MinGW target, the directory returned by the 'GetTempPath'
!      function.  Alternatively, on the Cygwin target, the 'TMP' and
!      'TEMP' environment variables, if they exist, in that order.
  
!   3. The 'P_tmpdir' macro if it is defined, otherwise the directory
!      '/tmp'.
  
  
  File: gfortran.info,  Node: GFORTRAN_STDIN_UNIT,  Next: GFORTRAN_STDOUT_UNIT,  Prev: TMPDIR,  Up: Runtime
  
! 3.2 'GFORTRAN_STDIN_UNIT'--Unit number for standard input
  =========================================================
  
  This environment variable can be used to select the unit number
*************** default value is 5.
*** 1736,1742 ****
  
  File: gfortran.info,  Node: GFORTRAN_STDOUT_UNIT,  Next: GFORTRAN_STDERR_UNIT,  Prev: GFORTRAN_STDIN_UNIT,  Up: Runtime
  
! 3.3 `GFORTRAN_STDOUT_UNIT'--Unit number for standard output
  ===========================================================
  
  This environment variable can be used to select the unit number
--- 1728,1734 ----
  
  File: gfortran.info,  Node: GFORTRAN_STDOUT_UNIT,  Next: GFORTRAN_STDERR_UNIT,  Prev: GFORTRAN_STDIN_UNIT,  Up: Runtime
  
! 3.3 'GFORTRAN_STDOUT_UNIT'--Unit number for standard output
  ===========================================================
  
  This environment variable can be used to select the unit number
*************** default value is 6.
*** 1746,1752 ****
  
  File: gfortran.info,  Node: GFORTRAN_STDERR_UNIT,  Next: GFORTRAN_UNBUFFERED_ALL,  Prev: GFORTRAN_STDOUT_UNIT,  Up: Runtime
  
! 3.4 `GFORTRAN_STDERR_UNIT'--Unit number for standard error
  ==========================================================
  
  This environment variable can be used to select the unit number
--- 1738,1744 ----
  
  File: gfortran.info,  Node: GFORTRAN_STDERR_UNIT,  Next: GFORTRAN_UNBUFFERED_ALL,  Prev: GFORTRAN_STDOUT_UNIT,  Up: Runtime
  
! 3.4 'GFORTRAN_STDERR_UNIT'--Unit number for standard error
  ==========================================================
  
  This environment variable can be used to select the unit number
*************** default value is 0.
*** 1756,1818 ****
  
  File: gfortran.info,  Node: GFORTRAN_UNBUFFERED_ALL,  Next: GFORTRAN_UNBUFFERED_PRECONNECTED,  Prev: GFORTRAN_STDERR_UNIT,  Up: Runtime
  
! 3.5 `GFORTRAN_UNBUFFERED_ALL'--Do not buffer I/O on all units
  =============================================================
  
  This environment variable controls whether all I/O is unbuffered.  If
! the first letter is `y', `Y' or `1', all I/O is unbuffered.  This will
  slow down small sequential reads and writes.  If the first letter is
! `n', `N' or `0', I/O is buffered.  This is the default.
  
  
  File: gfortran.info,  Node: GFORTRAN_UNBUFFERED_PRECONNECTED,  Next: GFORTRAN_SHOW_LOCUS,  Prev: GFORTRAN_UNBUFFERED_ALL,  Up: Runtime
  
! 3.6 `GFORTRAN_UNBUFFERED_PRECONNECTED'--Do not buffer I/O on preconnected units
  ===============================================================================
  
! The environment variable named `GFORTRAN_UNBUFFERED_PRECONNECTED'
  controls whether I/O on a preconnected unit (i.e. STDOUT or STDERR) is
! unbuffered.  If the first letter is `y', `Y' or `1', I/O is unbuffered.
  This will slow down small sequential reads and writes.  If the first
! letter is `n', `N' or `0', I/O is buffered.  This is the default.
  
  
  File: gfortran.info,  Node: GFORTRAN_SHOW_LOCUS,  Next: GFORTRAN_OPTIONAL_PLUS,  Prev: GFORTRAN_UNBUFFERED_PRECONNECTED,  Up: Runtime
  
! 3.7 `GFORTRAN_SHOW_LOCUS'--Show location for runtime errors
  ===========================================================
  
! If the first letter is `y', `Y' or `1', filename and line numbers for
! runtime errors are printed.  If the first letter is `n', `N' or `0', do
  not print filename and line numbers for runtime errors.  The default is
  to print the location.
  
  
  File: gfortran.info,  Node: GFORTRAN_OPTIONAL_PLUS,  Next: GFORTRAN_DEFAULT_RECL,  Prev: GFORTRAN_SHOW_LOCUS,  Up: Runtime
  
! 3.8 `GFORTRAN_OPTIONAL_PLUS'--Print leading + where permitted
  =============================================================
  
! If the first letter is `y', `Y' or `1', a plus sign is printed where
! permitted by the Fortran standard.  If the first letter is `n', `N' or
! `0', a plus sign is not printed in most cases.  Default is not to print
  plus signs.
  
  
  File: gfortran.info,  Node: GFORTRAN_DEFAULT_RECL,  Next: GFORTRAN_LIST_SEPARATOR,  Prev: GFORTRAN_OPTIONAL_PLUS,  Up: Runtime
  
! 3.9 `GFORTRAN_DEFAULT_RECL'--Default record length for new files
  ================================================================
  
! This environment variable specifies the default record length, in
! bytes, for files which are opened without a `RECL' tag in the `OPEN'
! statement.  This must be a positive integer.  The default value is
! 1073741824 bytes (1 GB).
  
  
  File: gfortran.info,  Node: GFORTRAN_LIST_SEPARATOR,  Next: GFORTRAN_CONVERT_UNIT,  Prev: GFORTRAN_DEFAULT_RECL,  Up: Runtime
  
! 3.10 `GFORTRAN_LIST_SEPARATOR'--Separator for list output
  =========================================================
  
  This environment variable specifies the separator when writing
--- 1748,1810 ----
  
  File: gfortran.info,  Node: GFORTRAN_UNBUFFERED_ALL,  Next: GFORTRAN_UNBUFFERED_PRECONNECTED,  Prev: GFORTRAN_STDERR_UNIT,  Up: Runtime
  
! 3.5 'GFORTRAN_UNBUFFERED_ALL'--Do not buffer I/O on all units
  =============================================================
  
  This environment variable controls whether all I/O is unbuffered.  If
! the first letter is 'y', 'Y' or '1', all I/O is unbuffered.  This will
  slow down small sequential reads and writes.  If the first letter is
! 'n', 'N' or '0', I/O is buffered.  This is the default.
  
  
  File: gfortran.info,  Node: GFORTRAN_UNBUFFERED_PRECONNECTED,  Next: GFORTRAN_SHOW_LOCUS,  Prev: GFORTRAN_UNBUFFERED_ALL,  Up: Runtime
  
! 3.6 'GFORTRAN_UNBUFFERED_PRECONNECTED'--Do not buffer I/O on preconnected units
  ===============================================================================
  
! The environment variable named 'GFORTRAN_UNBUFFERED_PRECONNECTED'
  controls whether I/O on a preconnected unit (i.e. STDOUT or STDERR) is
! unbuffered.  If the first letter is 'y', 'Y' or '1', I/O is unbuffered.
  This will slow down small sequential reads and writes.  If the first
! letter is 'n', 'N' or '0', I/O is buffered.  This is the default.
  
  
  File: gfortran.info,  Node: GFORTRAN_SHOW_LOCUS,  Next: GFORTRAN_OPTIONAL_PLUS,  Prev: GFORTRAN_UNBUFFERED_PRECONNECTED,  Up: Runtime
  
! 3.7 'GFORTRAN_SHOW_LOCUS'--Show location for runtime errors
  ===========================================================
  
! If the first letter is 'y', 'Y' or '1', filename and line numbers for
! runtime errors are printed.  If the first letter is 'n', 'N' or '0', do
  not print filename and line numbers for runtime errors.  The default is
  to print the location.
  
  
  File: gfortran.info,  Node: GFORTRAN_OPTIONAL_PLUS,  Next: GFORTRAN_DEFAULT_RECL,  Prev: GFORTRAN_SHOW_LOCUS,  Up: Runtime
  
! 3.8 'GFORTRAN_OPTIONAL_PLUS'--Print leading + where permitted
  =============================================================
  
! If the first letter is 'y', 'Y' or '1', a plus sign is printed where
! permitted by the Fortran standard.  If the first letter is 'n', 'N' or
! '0', a plus sign is not printed in most cases.  Default is not to print
  plus signs.
  
  
  File: gfortran.info,  Node: GFORTRAN_DEFAULT_RECL,  Next: GFORTRAN_LIST_SEPARATOR,  Prev: GFORTRAN_OPTIONAL_PLUS,  Up: Runtime
  
! 3.9 'GFORTRAN_DEFAULT_RECL'--Default record length for new files
  ================================================================
  
! This environment variable specifies the default record length, in bytes,
! for files which are opened without a 'RECL' tag in the 'OPEN' statement.
! This must be a positive integer.  The default value is 1073741824 bytes
! (1 GB).
  
  
  File: gfortran.info,  Node: GFORTRAN_LIST_SEPARATOR,  Next: GFORTRAN_CONVERT_UNIT,  Prev: GFORTRAN_DEFAULT_RECL,  Up: Runtime
  
! 3.10 'GFORTRAN_LIST_SEPARATOR'--Separator for list output
  =========================================================
  
  This environment variable specifies the separator when writing
*************** list-directed output.  It may contain an
*** 1820,1874 ****
  one comma.  If you specify this on the command line, be sure to quote
  spaces, as in
       $ GFORTRAN_LIST_SEPARATOR='  ,  ' ./a.out
!    when `a.out' is the compiled Fortran program that you want to run.
  Default is a single space.
  
  
  File: gfortran.info,  Node: GFORTRAN_CONVERT_UNIT,  Next: GFORTRAN_ERROR_BACKTRACE,  Prev: GFORTRAN_LIST_SEPARATOR,  Up: Runtime
  
! 3.11 `GFORTRAN_CONVERT_UNIT'--Set endianness for unformatted I/O
  ================================================================
  
! By setting the `GFORTRAN_CONVERT_UNIT' variable, it is possible to
! change the representation of data for unformatted files.  The syntax
! for the `GFORTRAN_CONVERT_UNIT' variable is:
       GFORTRAN_CONVERT_UNIT: mode | mode ';' exception | exception ;
       mode: 'native' | 'swap' | 'big_endian' | 'little_endian' ;
       exception: mode ':' unit_list | unit_list ;
       unit_list: unit_spec | unit_list unit_spec ;
       unit_spec: INTEGER | INTEGER '-' INTEGER ;
!    The variable consists of an optional default mode, followed by a
! list of optional exceptions, which are separated by semicolons from the
  preceding default and each other.  Each exception consists of a format
! and a comma-separated list of units.  Valid values for the modes are
! the same as for the `CONVERT' specifier:
! 
!      `NATIVE' Use the native format.  This is the default.
! 
!      `SWAP' Swap between little- and big-endian.
! 
!      `LITTLE_ENDIAN' Use the little-endian format for unformatted files.
! 
!      `BIG_ENDIAN' Use the big-endian format for unformatted files.
!    A missing mode for an exception is taken to mean `BIG_ENDIAN'.
! Examples of values for `GFORTRAN_CONVERT_UNIT' are:
!      `'big_endian''  Do all unformatted I/O in big_endian mode.
  
!      `'little_endian;native:10-20,25''  Do all unformatted I/O in
       little_endian mode, except for units 10 to 20 and 25, which are in
       native format.
! 
!      `'10-20''  Units 10 to 20 are big-endian, the rest is native.
  
     Setting the environment variables should be done on the command line
! or via the `export' command for `sh'-compatible shells and via `setenv'
! for `csh'-compatible shells.
  
!    Example for `sh':
       $ gfortran foo.f90
       $ GFORTRAN_CONVERT_UNIT='big_endian;native:10-20' ./a.out
  
!    Example code for `csh':
       % gfortran foo.f90
       % setenv GFORTRAN_CONVERT_UNIT 'big_endian;native:10-20'
       % ./a.out
--- 1812,1861 ----
  one comma.  If you specify this on the command line, be sure to quote
  spaces, as in
       $ GFORTRAN_LIST_SEPARATOR='  ,  ' ./a.out
!    when 'a.out' is the compiled Fortran program that you want to run.
  Default is a single space.
  
  
  File: gfortran.info,  Node: GFORTRAN_CONVERT_UNIT,  Next: GFORTRAN_ERROR_BACKTRACE,  Prev: GFORTRAN_LIST_SEPARATOR,  Up: Runtime
  
! 3.11 'GFORTRAN_CONVERT_UNIT'--Set endianness for unformatted I/O
  ================================================================
  
! By setting the 'GFORTRAN_CONVERT_UNIT' variable, it is possible to
! change the representation of data for unformatted files.  The syntax for
! the 'GFORTRAN_CONVERT_UNIT' variable is:
       GFORTRAN_CONVERT_UNIT: mode | mode ';' exception | exception ;
       mode: 'native' | 'swap' | 'big_endian' | 'little_endian' ;
       exception: mode ':' unit_list | unit_list ;
       unit_list: unit_spec | unit_list unit_spec ;
       unit_spec: INTEGER | INTEGER '-' INTEGER ;
!    The variable consists of an optional default mode, followed by a list
! of optional exceptions, which are separated by semicolons from the
  preceding default and each other.  Each exception consists of a format
! and a comma-separated list of units.  Valid values for the modes are the
! same as for the 'CONVERT' specifier:
  
!      'NATIVE' Use the native format.  This is the default.
!      'SWAP' Swap between little- and big-endian.
!      'LITTLE_ENDIAN' Use the little-endian format for unformatted files.
!      'BIG_ENDIAN' Use the big-endian format for unformatted files.
!    A missing mode for an exception is taken to mean 'BIG_ENDIAN'.
! Examples of values for 'GFORTRAN_CONVERT_UNIT' are:
!      ''big_endian'' Do all unformatted I/O in big_endian mode.
!      ''little_endian;native:10-20,25'' Do all unformatted I/O in
       little_endian mode, except for units 10 to 20 and 25, which are in
       native format.
!      ''10-20'' Units 10 to 20 are big-endian, the rest is native.
  
     Setting the environment variables should be done on the command line
! or via the 'export' command for 'sh'-compatible shells and via 'setenv'
! for 'csh'-compatible shells.
  
!    Example for 'sh':
       $ gfortran foo.f90
       $ GFORTRAN_CONVERT_UNIT='big_endian;native:10-20' ./a.out
  
!    Example code for 'csh':
       % gfortran foo.f90
       % setenv GFORTRAN_CONVERT_UNIT 'big_endian;native:10-20'
       % ./a.out
*************** for `csh'-compatible shells.
*** 1877,1886 ****
  carries a significant speed overhead.  If speed in this area matters to
  you, it is best if you use this only for data that needs to be portable.
  
!    *Note CONVERT specifier::, for an alternative way to specify the
! data representation for unformatted files.  *Note Runtime Options::, for
  setting a default data representation for the whole program.  The
! `CONVERT' specifier overrides the `-fconvert' compile options.
  
     _Note that the values specified via the GFORTRAN_CONVERT_UNIT
  environment variable will override the CONVERT specifier in the open
--- 1864,1873 ----
  carries a significant speed overhead.  If speed in this area matters to
  you, it is best if you use this only for data that needs to be portable.
  
!    *Note CONVERT specifier::, for an alternative way to specify the data
! representation for unformatted files.  *Note Runtime Options::, for
  setting a default data representation for the whole program.  The
! 'CONVERT' specifier overrides the '-fconvert' compile options.
  
     _Note that the values specified via the GFORTRAN_CONVERT_UNIT
  environment variable will override the CONVERT specifier in the open
*************** not have the source code of their progra
*** 1890,1903 ****
  
  File: gfortran.info,  Node: GFORTRAN_ERROR_BACKTRACE,  Prev: GFORTRAN_CONVERT_UNIT,  Up: Runtime
  
! 3.12 `GFORTRAN_ERROR_BACKTRACE'--Show backtrace on run-time errors
  ==================================================================
  
! If the `GFORTRAN_ERROR_BACKTRACE' variable is set to `y', `Y' or `1'
  (only the first letter is relevant) then a backtrace is printed when a
  serious run-time error occurs.  To disable the backtracing, set the
! variable to `n', `N', `0'.  Default is to print a backtrace unless the
! `-fno-backtrace' compile option was used.
  
  
  File: gfortran.info,  Node: Fortran 2003 and 2008 status,  Next: Compiler Characteristics,  Prev: Runtime,  Up: Top
--- 1877,1890 ----
  
  File: gfortran.info,  Node: GFORTRAN_ERROR_BACKTRACE,  Prev: GFORTRAN_CONVERT_UNIT,  Up: Runtime
  
! 3.12 'GFORTRAN_ERROR_BACKTRACE'--Show backtrace on run-time errors
  ==================================================================
  
! If the 'GFORTRAN_ERROR_BACKTRACE' variable is set to 'y', 'Y' or '1'
  (only the first letter is relevant) then a backtrace is printed when a
  serious run-time error occurs.  To disable the backtracing, set the
! variable to 'n', 'N', '0'.  Default is to print a backtrace unless the
! '-fno-backtrace' compile option was used.
  
  
  File: gfortran.info,  Node: Fortran 2003 and 2008 status,  Next: Compiler Characteristics,  Prev: Runtime,  Up: Top
*************** can be found below.  See also the wiki p
*** 1922,2052 ****
  (https://gcc.gnu.org/wiki/Fortran2003) about Fortran 2003.
  
     * Procedure pointers including procedure-pointer components with
!      `PASS' attribute.
  
     * Procedures which are bound to a derived type (type-bound
!      procedures) including `PASS', `PROCEDURE' and `GENERIC', and
       operators bound to a type.
  
     * Abstract interfaces and type extension with the possibility to
       override type-bound procedures or to have deferred binding.
  
!    * Polymorphic entities ("`CLASS'") for derived types and unlimited
!      polymorphism ("`CLASS(*)'") - including `SAME_TYPE_AS',
!      `EXTENDS_TYPE_OF' and `SELECT TYPE' for scalars and arrays and
       finalization.
  
     * Generic interface names, which have the same name as derived types,
!      are now supported. This allows one to write constructor functions.
       Note that Fortran does not support static constructor functions.
       For static variables, only default initialization or
       structure-constructor initialization are available.
  
!    * The `ASSOCIATE' construct.
  
     * Interoperability with C including enumerations,
  
     * In structure constructors the components with default values may be
       omitted.
  
!    * Extensions to the `ALLOCATE' statement, allowing for a
       type-specification with type parameter and for allocation and
!      initialization from a `SOURCE=' expression; `ALLOCATE' and
!      `DEALLOCATE' optionally return an error message string via
!      `ERRMSG='.
  
     * Reallocation on assignment: If an intrinsic assignment is used, an
       allocatable variable on the left-hand side is automatically
       allocated (if unallocated) or reallocated (if the shape is
!      different). Currently, scalar deferred character length left-hand
       sides are correctly handled but arrays are not yet fully
       implemented.
  
     * Deferred-length character variables and scalar deferred-length
!      character components of derived types are supported. (Note that
       array-valued compoents are not yet implemented.)
  
!    * Transferring of allocations via `MOVE_ALLOC'.
  
!    * The `PRIVATE' and `PUBLIC' attributes may be given individually to
       derived-type components.
  
     * In pointer assignments, the lower bound may be specified and the
       remapping of elements is supported.
  
!    * For pointers an `INTENT' may be specified which affect the
       association status not the value of the pointer target.
  
!    * Intrinsics `command_argument_count', `get_command',
!      `get_command_argument', and `get_environment_variable'.
  
!    * Support for Unicode characters (ISO 10646) and UTF-8, including
!      the `SELECTED_CHAR_KIND' and `NEW_LINE' intrinsic functions.
  
     * Support for binary, octal and hexadecimal (BOZ) constants in the
!      intrinsic functions `INT', `REAL', `CMPLX' and `DBLE'.
  
     * Support for namelist variables with allocatable and pointer
       attribute and nonconstant length type parameter.
  
!    * Array constructors using square brackets.  That is, `[...]' rather
!      than `(/.../)'.  Type-specification for array constructors like
!      `(/ some-type :: ... /)'.
  
     * Extensions to the specification and initialization expressions,
       including the support for intrinsics with real and complex
       arguments.
  
!    * Support for the asynchronous input/output syntax; however, the
!      data transfer is currently always synchronously performed.
  
!    * `FLUSH' statement.
  
!    * `IOMSG=' specifier for I/O statements.
  
!    * Support for the declaration of enumeration constants via the
!      `ENUM' and `ENUMERATOR' statements.  Interoperability with `gcc'
!      is guaranteed also for the case where the `-fshort-enums' command
!      line option is given.
  
     * TR 15581:
!         * `ALLOCATABLE' dummy arguments.
! 
!         * `ALLOCATABLE' function results
! 
!         * `ALLOCATABLE' components of derived types
  
!    * The `OPEN' statement supports the `ACCESS='STREAM'' specifier,
       allowing I/O without any record structure.
  
     * Namelist input/output for internal files.
  
     * Minor I/O features: Rounding during formatted output, using of a
       decimal comma instead of a decimal point, setting whether a plus
!      sign should appear for positive numbers. On systems where `strtod'
       honours the rounding mode, the rounding mode is also supported for
       input.
  
!    * The `PROTECTED' statement and attribute.
  
!    * The `VALUE' statement and attribute.
  
!    * The `VOLATILE' statement and attribute.
  
!    * The `IMPORT' statement, allowing to import host-associated derived
       types.
  
!    * The intrinsic modules `ISO_FORTRAN_ENVIRONMENT' is supported,
!      which contains parameters of the I/O units, storage sizes.
!      Additionally, procedures for C interoperability are available in
!      the `ISO_C_BINDING' module.
! 
!    * `USE' statement with `INTRINSIC' and `NON_INTRINSIC' attribute;
!      supported intrinsic modules: `ISO_FORTRAN_ENV', `ISO_C_BINDING',
!      `OMP_LIB' and `OMP_LIB_KINDS', and `OPENACC'.
  
!    * Renaming of operators in the `USE' statement.
  
  
  
  File: gfortran.info,  Node: Fortran 2008 status,  Next: TS 29113 status,  Prev: Fortran 2003 status,  Up: Fortran 2003 and 2008 status
--- 1909,2036 ----
  (https://gcc.gnu.org/wiki/Fortran2003) about Fortran 2003.
  
     * Procedure pointers including procedure-pointer components with
!      'PASS' attribute.
  
     * Procedures which are bound to a derived type (type-bound
!      procedures) including 'PASS', 'PROCEDURE' and 'GENERIC', and
       operators bound to a type.
  
     * Abstract interfaces and type extension with the possibility to
       override type-bound procedures or to have deferred binding.
  
!    * Polymorphic entities ("'CLASS'") for derived types and unlimited
!      polymorphism ("'CLASS(*)'") - including 'SAME_TYPE_AS',
!      'EXTENDS_TYPE_OF' and 'SELECT TYPE' for scalars and arrays and
       finalization.
  
     * Generic interface names, which have the same name as derived types,
!      are now supported.  This allows one to write constructor functions.
       Note that Fortran does not support static constructor functions.
       For static variables, only default initialization or
       structure-constructor initialization are available.
  
!    * The 'ASSOCIATE' construct.
  
     * Interoperability with C including enumerations,
  
     * In structure constructors the components with default values may be
       omitted.
  
!    * Extensions to the 'ALLOCATE' statement, allowing for a
       type-specification with type parameter and for allocation and
!      initialization from a 'SOURCE=' expression; 'ALLOCATE' and
!      'DEALLOCATE' optionally return an error message string via
!      'ERRMSG='.
  
     * Reallocation on assignment: If an intrinsic assignment is used, an
       allocatable variable on the left-hand side is automatically
       allocated (if unallocated) or reallocated (if the shape is
!      different).  Currently, scalar deferred character length left-hand
       sides are correctly handled but arrays are not yet fully
       implemented.
  
     * Deferred-length character variables and scalar deferred-length
!      character components of derived types are supported.  (Note that
       array-valued compoents are not yet implemented.)
  
!    * Transferring of allocations via 'MOVE_ALLOC'.
  
!    * The 'PRIVATE' and 'PUBLIC' attributes may be given individually to
       derived-type components.
  
     * In pointer assignments, the lower bound may be specified and the
       remapping of elements is supported.
  
!    * For pointers an 'INTENT' may be specified which affect the
       association status not the value of the pointer target.
  
!    * Intrinsics 'command_argument_count', 'get_command',
!      'get_command_argument', and 'get_environment_variable'.
  
!    * Support for Unicode characters (ISO 10646) and UTF-8, including the
!      'SELECTED_CHAR_KIND' and 'NEW_LINE' intrinsic functions.
  
     * Support for binary, octal and hexadecimal (BOZ) constants in the
!      intrinsic functions 'INT', 'REAL', 'CMPLX' and 'DBLE'.
  
     * Support for namelist variables with allocatable and pointer
       attribute and nonconstant length type parameter.
  
!    * Array constructors using square brackets.  That is, '[...]' rather
!      than '(/.../)'.  Type-specification for array constructors like '(/
!      some-type :: ... /)'.
  
     * Extensions to the specification and initialization expressions,
       including the support for intrinsics with real and complex
       arguments.
  
!    * Support for the asynchronous input/output syntax; however, the data
!      transfer is currently always synchronously performed.
  
!    * 'FLUSH' statement.
  
!    * 'IOMSG=' specifier for I/O statements.
  
!    * Support for the declaration of enumeration constants via the 'ENUM'
!      and 'ENUMERATOR' statements.  Interoperability with 'gcc' is
!      guaranteed also for the case where the '-fshort-enums' command line
!      option is given.
  
     * TR 15581:
!         * 'ALLOCATABLE' dummy arguments.
!         * 'ALLOCATABLE' function results
!         * 'ALLOCATABLE' components of derived types
  
!    * The 'OPEN' statement supports the 'ACCESS='STREAM'' specifier,
       allowing I/O without any record structure.
  
     * Namelist input/output for internal files.
  
     * Minor I/O features: Rounding during formatted output, using of a
       decimal comma instead of a decimal point, setting whether a plus
!      sign should appear for positive numbers.  On systems where 'strtod'
       honours the rounding mode, the rounding mode is also supported for
       input.
  
!    * The 'PROTECTED' statement and attribute.
  
!    * The 'VALUE' statement and attribute.
  
!    * The 'VOLATILE' statement and attribute.
  
!    * The 'IMPORT' statement, allowing to import host-associated derived
       types.
  
!    * The intrinsic modules 'ISO_FORTRAN_ENVIRONMENT' is supported, which
!      contains parameters of the I/O units, storage sizes.  Additionally,
!      procedures for C interoperability are available in the
!      'ISO_C_BINDING' module.
  
!    * 'USE' statement with 'INTRINSIC' and 'NON_INTRINSIC' attribute;
!      supported intrinsic modules: 'ISO_FORTRAN_ENV', 'ISO_C_BINDING',
!      'OMP_LIB' and 'OMP_LIB_KINDS', and 'OPENACC'.
  
+    * Renaming of operators in the 'USE' statement.
  
  
  File: gfortran.info,  Node: Fortran 2008 status,  Next: TS 29113 status,  Prev: Fortran 2003 status,  Up: Fortran 2003 and 2008 status
*************** informally known as Fortran 2008.  The o
*** 2059,2068 ****
  from International Organization for Standardization (ISO) or its
  national member organizations.  The the final draft (FDIS) can be
  downloaded free of charge from
! `http://www.nag.co.uk/sc22wg5/links.html'.  Fortran is developed by the
  Working Group 5 of Sub-Committee 22 of the Joint Technical Committee 1
  of the International Organization for Standardization and the
! International Electrotechnical Commission (IEC).  This group is known as
  WG5 (http://www.nag.co.uk/sc22wg5/).
  
     The GNU Fortran compiler supports several of the new features of
--- 2043,2052 ----
  from International Organization for Standardization (ISO) or its
  national member organizations.  The the final draft (FDIS) can be
  downloaded free of charge from
! <http://www.nag.co.uk/sc22wg5/links.html>.  Fortran is developed by the
  Working Group 5 of Sub-Committee 22 of the Joint Technical Committee 1
  of the International Organization for Standardization and the
! International Electrotechnical Commission (IEC). This group is known as
  WG5 (http://www.nag.co.uk/sc22wg5/).
  
     The GNU Fortran compiler supports several of the new features of
*************** Fortran 2008; the wiki (https://gcc.gnu.
*** 2070,2162 ****
  some information about the current Fortran 2008 implementation status.
  In particular, the following is implemented.
  
!    * The `-std=f2008' option and support for the file extensions `.f08'
!      and `.F08'.
  
!    * The `OPEN' statement now supports the `NEWUNIT=' option, which
       returns a unique file unit, thus preventing inadvertent use of the
       same unit in different parts of the program.
  
!    * The `g0' format descriptor and unlimited format items.
  
!    * The mathematical intrinsics `ASINH', `ACOSH', `ATANH', `ERF',
!      `ERFC', `GAMMA', `LOG_GAMMA', `BESSEL_J0', `BESSEL_J1',
!      `BESSEL_JN', `BESSEL_Y0', `BESSEL_Y1', `BESSEL_YN', `HYPOT',
!      `NORM2', and `ERFC_SCALED'.
  
!    * Using complex arguments with `TAN', `SINH', `COSH', `TANH',
!      `ASIN', `ACOS', and `ATAN' is now possible; `ATAN'(Y,X) is now an
!      alias for `ATAN2'(Y,X).
  
!    * Support of the `PARITY' intrinsic functions.
  
!    * The following bit intrinsics: `LEADZ' and `TRAILZ' for counting
!      the number of leading and trailing zero bits, `POPCNT' and
!      `POPPAR' for counting the number of one bits and returning the
!      parity; `BGE', `BGT', `BLE', and `BLT' for bitwise comparisons;
!      `DSHIFTL' and `DSHIFTR' for combined left and right shifts,
!      `MASKL' and `MASKR' for simple left and right justified masks,
!      `MERGE_BITS' for a bitwise merge using a mask, `SHIFTA', `SHIFTL'
!      and `SHIFTR' for shift operations, and the transformational bit
!      intrinsics `IALL', `IANY' and `IPARITY'.
  
!    * Support of the `EXECUTE_COMMAND_LINE' intrinsic subroutine.
  
!    * Support for the `STORAGE_SIZE' intrinsic inquiry function.
  
!    * The `INT{8,16,32}' and `REAL{32,64,128}' kind type parameters and
!      the array-valued named constants `INTEGER_KINDS', `LOGICAL_KINDS',
!      `REAL_KINDS' and `CHARACTER_KINDS' of the intrinsic module
!      `ISO_FORTRAN_ENV'.
  
!    * The module procedures `C_SIZEOF' of the intrinsic module
!      `ISO_C_BINDINGS' and `COMPILER_VERSION' and `COMPILER_OPTIONS' of
!      `ISO_FORTRAN_ENV'.
  
!    * Coarray support for serial programs with `-fcoarray=single' flag
       and experimental support for multiple images with the
!      `-fcoarray=lib' flag.
  
!    * The `DO CONCURRENT' construct is supported.
  
!    * The `BLOCK' construct is supported.
  
!    * The `STOP' and the new `ERROR STOP' statements now support all
!      constant expressions. Both show the signals which were signaling
       at termination.
  
!    * Support for the `CONTIGUOUS' attribute.
  
!    * Support for `ALLOCATE' with `MOLD'.
  
!    * Support for the `IMPURE' attribute for procedures, which allows
!      for `ELEMENTAL' procedures without the restrictions of `PURE'.
  
!    * Null pointers (including `NULL()') and not-allocated variables can
       be used as actual argument to optional non-pointer, non-allocatable
       dummy arguments, denoting an absent argument.
  
!    * Non-pointer variables with `TARGET' attribute can be used as
!      actual argument to `POINTER' dummies with `INTENT(IN)'.
  
     * Pointers including procedure pointers and those in a derived type
       (pointer components) can now be initialized by a target instead of
!      only by `NULL'.
  
!    * The `EXIT' statement (with construct-name) can be now be used to
!      leave not only the `DO' but also the `ASSOCIATE', `BLOCK', `IF',
!      `SELECT CASE' and `SELECT TYPE' constructs.
  
     * Internal procedures can now be used as actual argument.
  
!    * Minor features: obsolesce diagnostics for `ENTRY' with
!      `-std=f2008'; a line may start with a semicolon; for internal and
!      module procedures `END' can be used instead of `END SUBROUTINE'
!      and `END FUNCTION'; `SELECTED_REAL_KIND' now also takes a `RADIX'
       argument; intrinsic types are supported for
!      `TYPE'(INTRINSIC-TYPE-SPEC); multiple type-bound procedures can be
!      declared in a single `PROCEDURE' statement; implied-shape arrays
!      are supported for named constants (`PARAMETER').
  
  
  File: gfortran.info,  Node: TS 29113 status,  Prev: Fortran 2008 status,  Up: Fortran 2003 and 2008 status
--- 2054,2146 ----
  some information about the current Fortran 2008 implementation status.
  In particular, the following is implemented.
  
!    * The '-std=f2008' option and support for the file extensions '.f08'
!      and '.F08'.
  
!    * The 'OPEN' statement now supports the 'NEWUNIT=' option, which
       returns a unique file unit, thus preventing inadvertent use of the
       same unit in different parts of the program.
  
!    * The 'g0' format descriptor and unlimited format items.
  
!    * The mathematical intrinsics 'ASINH', 'ACOSH', 'ATANH', 'ERF',
!      'ERFC', 'GAMMA', 'LOG_GAMMA', 'BESSEL_J0', 'BESSEL_J1',
!      'BESSEL_JN', 'BESSEL_Y0', 'BESSEL_Y1', 'BESSEL_YN', 'HYPOT',
!      'NORM2', and 'ERFC_SCALED'.
  
!    * Using complex arguments with 'TAN', 'SINH', 'COSH', 'TANH', 'ASIN',
!      'ACOS', and 'ATAN' is now possible; 'ATAN'(Y,X) is now an alias for
!      'ATAN2'(Y,X).
  
!    * Support of the 'PARITY' intrinsic functions.
  
!    * The following bit intrinsics: 'LEADZ' and 'TRAILZ' for counting the
!      number of leading and trailing zero bits, 'POPCNT' and 'POPPAR' for
!      counting the number of one bits and returning the parity; 'BGE',
!      'BGT', 'BLE', and 'BLT' for bitwise comparisons; 'DSHIFTL' and
!      'DSHIFTR' for combined left and right shifts, 'MASKL' and 'MASKR'
!      for simple left and right justified masks, 'MERGE_BITS' for a
!      bitwise merge using a mask, 'SHIFTA', 'SHIFTL' and 'SHIFTR' for
!      shift operations, and the transformational bit intrinsics 'IALL',
!      'IANY' and 'IPARITY'.
  
!    * Support of the 'EXECUTE_COMMAND_LINE' intrinsic subroutine.
  
!    * Support for the 'STORAGE_SIZE' intrinsic inquiry function.
  
!    * The 'INT{8,16,32}' and 'REAL{32,64,128}' kind type parameters and
!      the array-valued named constants 'INTEGER_KINDS', 'LOGICAL_KINDS',
!      'REAL_KINDS' and 'CHARACTER_KINDS' of the intrinsic module
!      'ISO_FORTRAN_ENV'.
  
!    * The module procedures 'C_SIZEOF' of the intrinsic module
!      'ISO_C_BINDINGS' and 'COMPILER_VERSION' and 'COMPILER_OPTIONS' of
!      'ISO_FORTRAN_ENV'.
  
!    * Coarray support for serial programs with '-fcoarray=single' flag
       and experimental support for multiple images with the
!      '-fcoarray=lib' flag.
  
!    * The 'DO CONCURRENT' construct is supported.
  
!    * The 'BLOCK' construct is supported.
  
!    * The 'STOP' and the new 'ERROR STOP' statements now support all
!      constant expressions.  Both show the signals which were signaling
       at termination.
  
!    * Support for the 'CONTIGUOUS' attribute.
  
!    * Support for 'ALLOCATE' with 'MOLD'.
  
!    * Support for the 'IMPURE' attribute for procedures, which allows for
!      'ELEMENTAL' procedures without the restrictions of 'PURE'.
  
!    * Null pointers (including 'NULL()') and not-allocated variables can
       be used as actual argument to optional non-pointer, non-allocatable
       dummy arguments, denoting an absent argument.
  
!    * Non-pointer variables with 'TARGET' attribute can be used as actual
!      argument to 'POINTER' dummies with 'INTENT(IN)'.
  
     * Pointers including procedure pointers and those in a derived type
       (pointer components) can now be initialized by a target instead of
!      only by 'NULL'.
  
!    * The 'EXIT' statement (with construct-name) can be now be used to
!      leave not only the 'DO' but also the 'ASSOCIATE', 'BLOCK', 'IF',
!      'SELECT CASE' and 'SELECT TYPE' constructs.
  
     * Internal procedures can now be used as actual argument.
  
!    * Minor features: obsolesce diagnostics for 'ENTRY' with
!      '-std=f2008'; a line may start with a semicolon; for internal and
!      module procedures 'END' can be used instead of 'END SUBROUTINE' and
!      'END FUNCTION'; 'SELECTED_REAL_KIND' now also takes a 'RADIX'
       argument; intrinsic types are supported for
!      'TYPE'(INTRINSIC-TYPE-SPEC); multiple type-bound procedures can be
!      declared in a single 'PROCEDURE' statement; implied-shape arrays
!      are supported for named constants ('PARAMETER').
  
  
  File: gfortran.info,  Node: TS 29113 status,  Prev: Fortran 2008 status,  Up: Fortran 2003 and 2008 status
*************** following is implemented.
*** 2172,2190 ****
  
     See also *note Further Interoperability of Fortran with C::.
  
!    * The `-std=f2008ts' option.
  
!    * The `OPTIONAL' attribute is allowed for dummy arguments of
!      `BIND(C) procedures.'
  
!    * The `RANK' intrinsic is supported.
  
!    * GNU Fortran's implementation for variables with `ASYNCHRONOUS'
       attribute is compatible with TS 29113.
  
!    * Assumed types (`TYPE(*)'.
  
!    * Assumed-rank (`DIMENSION(..)'). However, the array descriptor of
       the TS is not yet supported.
  
  
--- 2156,2174 ----
  
     See also *note Further Interoperability of Fortran with C::.
  
!    * The '-std=f2008ts' option.
  
!    * The 'OPTIONAL' attribute is allowed for dummy arguments of 'BIND(C)
!      procedures.'
  
!    * The 'RANK' intrinsic is supported.
  
!    * GNU Fortran's implementation for variables with 'ASYNCHRONOUS'
       attribute is compatible with TS 29113.
  
!    * Assumed types ('TYPE(*)'.
  
!    * Assumed-rank ('DIMENSION(..)').  However, the array descriptor of
       the TS is not yet supported.
  
  
*************** File: gfortran.info,  Node: KIND Type Pa
*** 2211,2252 ****
  5.1 KIND Type Parameters
  ========================
  
! The `KIND' type parameters supported by GNU Fortran for the primitive
  data types are:
  
! `INTEGER'
       1, 2, 4, 8*, 16*, default: 4**
  
! `LOGICAL'
       1, 2, 4, 8*, 16*, default: 4**
  
! `REAL'
       4, 8, 10*, 16*, default: 4***
  
! `COMPLEX'
       4, 8, 10*, 16*, default: 4***
  
! `DOUBLE PRECISION'
       4, 8, 10*, 16*, default: 8***
  
! `CHARACTER'
       1, 4, default: 1
  
- 
  * not available on all systems
! ** unless `-fdefault-integer-8' is used
! *** unless `-fdefault-real-8' is used (see *note Fortran Dialect
  Options::)
  
! The `KIND' value matches the storage size in bytes, except for
! `COMPLEX' where the storage size is twice as much (or both real and
! imaginary part are a real value of the given size).  It is recommended
! to use the *note SELECTED_CHAR_KIND::, *note SELECTED_INT_KIND:: and
! *note SELECTED_REAL_KIND:: intrinsics or the `INT8', `INT16', `INT32',
! `INT64', `REAL32', `REAL64', and `REAL128' parameters of the
! `ISO_FORTRAN_ENV' module instead of the concrete values.  The available
! kind parameters can be found in the constant arrays `CHARACTER_KINDS',
! `INTEGER_KINDS', `LOGICAL_KINDS' and `REAL_KINDS' in the *note
  ISO_FORTRAN_ENV:: module.  For C interoperability, the kind parameters
  of the *note ISO_C_BINDING:: module should be used.
  
--- 2195,2235 ----
  5.1 KIND Type Parameters
  ========================
  
! The 'KIND' type parameters supported by GNU Fortran for the primitive
  data types are:
  
! 'INTEGER'
       1, 2, 4, 8*, 16*, default: 4**
  
! 'LOGICAL'
       1, 2, 4, 8*, 16*, default: 4**
  
! 'REAL'
       4, 8, 10*, 16*, default: 4***
  
! 'COMPLEX'
       4, 8, 10*, 16*, default: 4***
  
! 'DOUBLE PRECISION'
       4, 8, 10*, 16*, default: 8***
  
! 'CHARACTER'
       1, 4, default: 1
  
  * not available on all systems
! ** unless '-fdefault-integer-8' is used
! *** unless '-fdefault-real-8' is used (see *note Fortran Dialect
  Options::)
  
! The 'KIND' value matches the storage size in bytes, except for 'COMPLEX'
! where the storage size is twice as much (or both real and imaginary part
! are a real value of the given size).  It is recommended to use the *note
! SELECTED_CHAR_KIND::, *note SELECTED_INT_KIND:: and *note
! SELECTED_REAL_KIND:: intrinsics or the 'INT8', 'INT16', 'INT32',
! 'INT64', 'REAL32', 'REAL64', and 'REAL128' parameters of the
! 'ISO_FORTRAN_ENV' module instead of the concrete values.  The available
! kind parameters can be found in the constant arrays 'CHARACTER_KINDS',
! 'INTEGER_KINDS', 'LOGICAL_KINDS' and 'REAL_KINDS' in the *note
  ISO_FORTRAN_ENV:: module.  For C interoperability, the kind parameters
  of the *note ISO_C_BINDING:: module should be used.
  
*************** File: gfortran.info,  Node: Internal rep
*** 2256,2269 ****
  5.2 Internal representation of LOGICAL variables
  ================================================
  
! The Fortran standard does not specify how variables of `LOGICAL' type
! are represented, beyond requiring that `LOGICAL' variables of default
! kind have the same storage size as default `INTEGER' and `REAL'
  variables.  The GNU Fortran internal representation is as follows.
  
!    A `LOGICAL(KIND=N)' variable is represented as an `INTEGER(KIND=N)'
! variable, however, with only two permissible values: `1' for `.TRUE.'
! and `0' for `.FALSE.'.  Any other integer value results in undefined
  behavior.
  
     See also *note Argument passing conventions:: and *note
--- 2239,2252 ----
  5.2 Internal representation of LOGICAL variables
  ================================================
  
! The Fortran standard does not specify how variables of 'LOGICAL' type
! are represented, beyond requiring that 'LOGICAL' variables of default
! kind have the same storage size as default 'INTEGER' and 'REAL'
  variables.  The GNU Fortran internal representation is as follows.
  
!    A 'LOGICAL(KIND=N)' variable is represented as an 'INTEGER(KIND=N)'
! variable, however, with only two permissible values: '1' for '.TRUE.'
! and '0' for '.FALSE.'.  Any other integer value results in undefined
  behavior.
  
     See also *note Argument passing conventions:: and *note
*************** File: gfortran.info,  Node: Thread-safet
*** 2275,2319 ****
  5.3 Thread-safety of the runtime library
  ========================================
  
! GNU Fortran can be used in programs with multiple threads, e.g. by
! using OpenMP, by calling OS thread handling functions via the
! `ISO_C_BINDING' facility, or by GNU Fortran compiled library code being
! called from a multi-threaded program.
  
!    The GNU Fortran runtime library, (`libgfortran'), supports being
  called concurrently from multiple threads with the following exceptions.
  
!    During library initialization, the C `getenv' function is used,
! which need not be thread-safe.  Similarly, the `getenv' function is
! used to implement the `GET_ENVIRONMENT_VARIABLE' and `GETENV'
! intrinsics.  It is the responsibility of the user to ensure that the
! environment is not being updated concurrently when any of these actions
! are taking place.
  
!    The `EXECUTE_COMMAND_LINE' and `SYSTEM' intrinsics are implemented
! with the `system' function, which need not be thread-safe.  It is the
! responsibility of the user to ensure that `system' is not called
  concurrently.
  
     For platforms not supporting thread-safe POSIX functions, further
! functionality might not be thread-safe.  For details, please consult
! the documentation for your operating system.
  
     The GNU Fortran runtime library uses various C library functions that
! depend on the locale, such as `strtod' and `snprintf'.  In order to
! work correctly in locale-aware programs that set the locale using
! `setlocale', the locale is reset to the default "C" locale while
! executing a formatted `READ' or `WRITE' statement.  On targets
  supporting the POSIX 2008 per-thread locale functions (e.g.
! `newlocale', `uselocale', `freelocale'), these are used and thus the
! global locale set using `setlocale' or the per-thread locales in other
  threads are not affected.  However, on targets lacking this
  functionality, the global LC_NUMERIC locale is set to "C" during the
! formatted I/O.  Thus, on such targets it's not safe to call `setlocale'
! concurrently from another thread while a Fortran formatted I/O
! operation is in progress.  Also, other threads doing something
! dependent on the LC_NUMERIC locale might not work correctly if a
! formatted I/O operation is in progress in another thread.
  
  
  File: gfortran.info,  Node: Data consistency and durability,  Next: Files opened without an explicit ACTION= specifier,  Prev: Thread-safety of the runtime library,  Up: Compiler Characteristics
--- 2258,2301 ----
  5.3 Thread-safety of the runtime library
  ========================================
  
! GNU Fortran can be used in programs with multiple threads, e.g. by using
! OpenMP, by calling OS thread handling functions via the 'ISO_C_BINDING'
! facility, or by GNU Fortran compiled library code being called from a
! multi-threaded program.
  
!    The GNU Fortran runtime library, ('libgfortran'), supports being
  called concurrently from multiple threads with the following exceptions.
  
!    During library initialization, the C 'getenv' function is used, which
! need not be thread-safe.  Similarly, the 'getenv' function is used to
! implement the 'GET_ENVIRONMENT_VARIABLE' and 'GETENV' intrinsics.  It is
! the responsibility of the user to ensure that the environment is not
! being updated concurrently when any of these actions are taking place.
  
!    The 'EXECUTE_COMMAND_LINE' and 'SYSTEM' intrinsics are implemented
! with the 'system' function, which need not be thread-safe.  It is the
! responsibility of the user to ensure that 'system' is not called
  concurrently.
  
     For platforms not supporting thread-safe POSIX functions, further
! functionality might not be thread-safe.  For details, please consult the
! documentation for your operating system.
  
     The GNU Fortran runtime library uses various C library functions that
! depend on the locale, such as 'strtod' and 'snprintf'.  In order to work
! correctly in locale-aware programs that set the locale using
! 'setlocale', the locale is reset to the default "C" locale while
! executing a formatted 'READ' or 'WRITE' statement.  On targets
  supporting the POSIX 2008 per-thread locale functions (e.g.
! 'newlocale', 'uselocale', 'freelocale'), these are used and thus the
! global locale set using 'setlocale' or the per-thread locales in other
  threads are not affected.  However, on targets lacking this
  functionality, the global LC_NUMERIC locale is set to "C" during the
! formatted I/O. Thus, on such targets it's not safe to call 'setlocale'
! concurrently from another thread while a Fortran formatted I/O operation
! is in progress.  Also, other threads doing something dependent on the
! LC_NUMERIC locale might not work correctly if a formatted I/O operation
! is in progress in another thread.
  
  
  File: gfortran.info,  Node: Data consistency and durability,  Next: Files opened without an explicit ACTION= specifier,  Prev: Thread-safety of the runtime library,  Up: Compiler Characteristics
*************** This section contains a brief overview o
*** 2325,2336 ****
  and durability issues when doing I/O.
  
     With respect to durability, GNU Fortran makes no effort to ensure
! that data is committed to stable storage. If this is required, the GNU
! Fortran programmer can use the intrinsic `FNUM' to retrieve the low
! level file descriptor corresponding to an open Fortran unit. Then,
! using e.g. the `ISO_C_BINDING' feature, one can call the underlying
! system call to flush dirty data to stable storage, such as `fsync' on
! POSIX, `_commit' on MingW, or `fcntl(fd, F_FULLSYNC, 0)' on Mac OS X.
  The following example shows how to call fsync:
  
         ! Declare the interface for POSIX fsync function
--- 2307,2318 ----
  and durability issues when doing I/O.
  
     With respect to durability, GNU Fortran makes no effort to ensure
! that data is committed to stable storage.  If this is required, the GNU
! Fortran programmer can use the intrinsic 'FNUM' to retrieve the low
! level file descriptor corresponding to an open Fortran unit.  Then,
! using e.g.  the 'ISO_C_BINDING' feature, one can call the underlying
! system call to flush dirty data to stable storage, such as 'fsync' on
! POSIX, '_commit' on MingW, or 'fcntl(fd, F_FULLSYNC, 0)' on Mac OS X.
  The following example shows how to call fsync:
  
         ! Declare the interface for POSIX fsync function
*************** The following example shows how to call
*** 2360,2389 ****
         if (ret /= 0) stop "Error calling FSYNC"
  
     With respect to consistency, for regular files GNU Fortran uses
! buffered I/O in order to improve performance. This buffer is flushed
! automatically when full and in some other situations, e.g. when closing
! a unit. It can also be explicitly flushed with the `FLUSH' statement.
! Also, the buffering can be turned off with the
! `GFORTRAN_UNBUFFERED_ALL' and `GFORTRAN_UNBUFFERED_PRECONNECTED'
! environment variables. Special files, such as terminals and pipes, are
! always unbuffered. Sometimes, however, further things may need to be
! done in order to allow other processes to see data that GNU Fortran has
! written, as follows.
  
     The Windows platform supports a relaxed metadata consistency model,
! where file metadata is written to the directory lazily. This means
! that, for instance, the `dir' command can show a stale size for a file.
  One can force a directory metadata update by closing the unit, or by
! calling `_commit' on the file descriptor. Note, though, that `_commit'
  will force all dirty data to stable storage, which is often a very slow
  operation.
  
     The Network File System (NFS) implements a relaxed consistency model
! called open-to-close consistency. Closing a file forces dirty data and
  metadata to be flushed to the server, and opening a file forces the
  client to contact the server in order to revalidate cached data.
! `fsync' will also force a flush of dirty data and metadata to the
! server. Similar to `open' and `close', acquiring and releasing `fcntl'
  file locks, if the server supports them, will also force cache
  validation and flushing dirty data and metadata.
  
--- 2342,2370 ----
         if (ret /= 0) stop "Error calling FSYNC"
  
     With respect to consistency, for regular files GNU Fortran uses
! buffered I/O in order to improve performance.  This buffer is flushed
! automatically when full and in some other situations, e.g.  when closing
! a unit.  It can also be explicitly flushed with the 'FLUSH' statement.
! Also, the buffering can be turned off with the 'GFORTRAN_UNBUFFERED_ALL'
! and 'GFORTRAN_UNBUFFERED_PRECONNECTED' environment variables.  Special
! files, such as terminals and pipes, are always unbuffered.  Sometimes,
! however, further things may need to be done in order to allow other
! processes to see data that GNU Fortran has written, as follows.
  
     The Windows platform supports a relaxed metadata consistency model,
! where file metadata is written to the directory lazily.  This means
! that, for instance, the 'dir' command can show a stale size for a file.
  One can force a directory metadata update by closing the unit, or by
! calling '_commit' on the file descriptor.  Note, though, that '_commit'
  will force all dirty data to stable storage, which is often a very slow
  operation.
  
     The Network File System (NFS) implements a relaxed consistency model
! called open-to-close consistency.  Closing a file forces dirty data and
  metadata to be flushed to the server, and opening a file forces the
  client to contact the server in order to revalidate cached data.
! 'fsync' will also force a flush of dirty data and metadata to the
! server.  Similar to 'open' and 'close', acquiring and releasing 'fcntl'
  file locks, if the server supports them, will also force cache
  validation and flushing dirty data and metadata.
  
*************** File: gfortran.info,  Node: Files opened
*** 2393,2408 ****
  5.5 Files opened without an explicit ACTION= specifier
  ======================================================
  
! The Fortran standard says that if an `OPEN' statement is executed
! without an explicit `ACTION=' specifier, the default value is processor
  dependent.  GNU Fortran behaves as follows:
  
!   1. Attempt to open the file with `ACTION='READWRITE''
! 
!   2. If that fails, try to open with `ACTION='READ''
! 
!   3. If that fails, try to open with `ACTION='WRITE''
! 
    4. If that fails, generate an error
  
  
--- 2374,2386 ----
  5.5 Files opened without an explicit ACTION= specifier
  ======================================================
  
! The Fortran standard says that if an 'OPEN' statement is executed
! without an explicit 'ACTION=' specifier, the default value is processor
  dependent.  GNU Fortran behaves as follows:
  
!   1. Attempt to open the file with 'ACTION='READWRITE''
!   2. If that fails, try to open with 'ACTION='READ''
!   3. If that fails, try to open with 'ACTION='WRITE''
    4. If that fails, generate an error
  
  
*************** GNU Fortran implements a number of exten
*** 2433,2444 ****
  This chapter contains information on their syntax and meaning.  There
  are currently two categories of GNU Fortran extensions, those that
  provide functionality beyond that provided by any standard, and those
! that are supported by GNU Fortran purely for backward compatibility
! with legacy compilers.  By default, `-std=gnu' allows the compiler to
! accept both types of extensions, but to warn about the use of the
! latter.  Specifying either `-std=f95', `-std=f2003' or `-std=f2008'
! disables both types of extensions, and `-std=legacy' allows both
! without warning.
  
  * Menu:
  
--- 2411,2421 ----
  This chapter contains information on their syntax and meaning.  There
  are currently two categories of GNU Fortran extensions, those that
  provide functionality beyond that provided by any standard, and those
! that are supported by GNU Fortran purely for backward compatibility with
! legacy compilers.  By default, '-std=gnu' allows the compiler to accept
! both types of extensions, but to warn about the use of the latter.
! Specifying either '-std=f95', '-std=f2003' or '-std=f2008' disables both
! types of extensions, and '-std=legacy' allows both without warning.
  
  * Menu:
  
*************** without warning.
*** 2449,2455 ****
  * Commas in FORMAT specifications::
  * Missing period in FORMAT specifications::
  * I/O item lists::
! * `Q' exponent-letter::
  * BOZ literal constants::
  * Real array indices::
  * Unary operators::
--- 2426,2432 ----
  * Commas in FORMAT specifications::
  * Missing period in FORMAT specifications::
  * I/O item lists::
! * Q exponent-letter::
  * BOZ literal constants::
  * Real array indices::
  * Unary operators::
*************** File: gfortran.info,  Node: Old-style ki
*** 2471,2487 ****
  GNU Fortran allows old-style kind specifications in declarations.  These
  look like:
             TYPESPEC*size x,y,z
!    where `TYPESPEC' is a basic type (`INTEGER', `REAL', etc.), and
! where `size' is a byte count corresponding to the storage size of a
! valid kind for that type.  (For `COMPLEX' variables, `size' is the
! total size of the real and imaginary parts.)  The statement then
! declares `x', `y' and `z' to be of type `TYPESPEC' with the appropriate
! kind.  This is equivalent to the standard-conforming declaration
             TYPESPEC(k) x,y,z
!    where `k' is the kind parameter suitable for the intended precision.
! As kind parameters are implementation-dependent, use the `KIND',
! `SELECTED_INT_KIND' and `SELECTED_REAL_KIND' intrinsics to retrieve the
! correct value, for instance `REAL*8 x' can be replaced by:
       INTEGER, PARAMETER :: dbl = KIND(1.0d0)
       REAL(KIND=dbl) :: x
  
--- 2448,2464 ----
  GNU Fortran allows old-style kind specifications in declarations.  These
  look like:
             TYPESPEC*size x,y,z
! where 'TYPESPEC' is a basic type ('INTEGER', 'REAL', etc.), and where
! 'size' is a byte count corresponding to the storage size of a valid kind
! for that type.  (For 'COMPLEX' variables, 'size' is the total size of
! the real and imaginary parts.)  The statement then declares 'x', 'y' and
! 'z' to be of type 'TYPESPEC' with the appropriate kind.  This is
! equivalent to the standard-conforming declaration
             TYPESPEC(k) x,y,z
! where 'k' is the kind parameter suitable for the intended precision.  As
! kind parameters are implementation-dependent, use the 'KIND',
! 'SELECTED_INT_KIND' and 'SELECTED_REAL_KIND' intrinsics to retrieve the
! correct value, for instance 'REAL*8 x' can be replaced by:
       INTEGER, PARAMETER :: dbl = KIND(1.0d0)
       REAL(KIND=dbl) :: x
  
*************** File: gfortran.info,  Node: Old-style va
*** 2494,2505 ****
  GNU Fortran allows old-style initialization of variables of the form:
             INTEGER i/1/,j/2/
             REAL x(2,2) /3*0.,1./
!    The syntax for the initializers is as for the `DATA' statement, but
! unlike in a `DATA' statement, an initializer only applies to the
  variable immediately preceding the initialization.  In other words,
! something like `INTEGER I,J/2,3/' is not valid.  This style of
  initialization is only allowed in declarations without double colons
! (`::'); the double colons were introduced in Fortran 90, which also
  introduced a standard syntax for initializing variables in type
  declarations.
  
--- 2471,2482 ----
  GNU Fortran allows old-style initialization of variables of the form:
             INTEGER i/1/,j/2/
             REAL x(2,2) /3*0.,1./
!    The syntax for the initializers is as for the 'DATA' statement, but
! unlike in a 'DATA' statement, an initializer only applies to the
  variable immediately preceding the initialization.  In other words,
! something like 'INTEGER I,J/2,3/' is not valid.  This style of
  initialization is only allowed in declarations without double colons
! ('::'); the double colons were introduced in Fortran 90, which also
  introduced a standard syntax for initializing variables in type
  declarations.
  
*************** are:
*** 2514,2520 ****
             DATA i/1/, j/2/, x/3*0.,1./
  
     Note that variables which are explicitly initialized in declarations
! or in `DATA' statements automatically acquire the `SAVE' attribute.
  
  
  File: gfortran.info,  Node: Extensions to namelist,  Next: X format descriptor without count field,  Prev: Old-style variable initialization,  Up: Extensions implemented in GNU Fortran
--- 2491,2497 ----
             DATA i/1/, j/2/, x/3*0.,1./
  
     Note that variables which are explicitly initialized in declarations
! or in 'DATA' statements automatically acquire the 'SAVE' attribute.
  
  
  File: gfortran.info,  Node: Extensions to namelist,  Next: X format descriptor without count field,  Prev: Old-style variable initialization,  Up: Extensions implemented in GNU Fortran
*************** types.  The output from a namelist write
*** 2528,2544 ****
  read.  The output has all names in upper case and indentation to column
  1 after the namelist name.  Two extensions are permitted:
  
!    Old-style use of `$' instead of `&'
       $MYNML
        X(:)%Y(2) = 1.0 2.0 3.0
        CH(1:4) = "abcd"
       $END
  
!    It should be noted that the default terminator is `/' rather than
! `&END'.
  
     Querying of the namelist when inputting from stdin.  After at least
! one space, entering `?' sends to stdout the namelist name and the names
  of the variables in the namelist:
        ?
  
--- 2505,2521 ----
  read.  The output has all names in upper case and indentation to column
  1 after the namelist name.  Two extensions are permitted:
  
!    Old-style use of '$' instead of '&'
       $MYNML
        X(:)%Y(2) = 1.0 2.0 3.0
        CH(1:4) = "abcd"
       $END
  
!    It should be noted that the default terminator is '/' rather than
! '&END'.
  
     Querying of the namelist when inputting from stdin.  After at least
! one space, entering '?' sends to stdout the namelist name and the names
  of the variables in the namelist:
        ?
  
*************** of the variables in the namelist:
*** 2548,2554 ****
        ch
       &end
  
!    Entering `=?' outputs the namelist to stdout, as if `WRITE(*,NML =
  mynml)' had been called:
       =?
  
--- 2525,2531 ----
        ch
       &end
  
!    Entering '=?' outputs the namelist to stdout, as if 'WRITE(*,NML =
  mynml)' had been called:
       =?
  
*************** mynml)' had been called:
*** 2559,2568 ****
        CH=abcd,  /
  
     To aid this dialog, when input is from stdin, errors send their
! messages to stderr and execution continues, even if `IOSTAT' is set.
  
!    `PRINT' namelist is permitted.  This causes an error if `-std=f95'
! is used.
       PROGRAM test_print
         REAL, dimension (4)  ::  x = (/1.0, 2.0, 3.0, 4.0/)
         NAMELIST /mynml/ x
--- 2536,2545 ----
        CH=abcd,  /
  
     To aid this dialog, when input is from stdin, errors send their
! messages to stderr and execution continues, even if 'IOSTAT' is set.
  
!    'PRINT' namelist is permitted.  This causes an error if '-std=f95' is
! used.
       PROGRAM test_print
         REAL, dimension (4)  ::  x = (/1.0, 2.0, 3.0, 4.0/)
         NAMELIST /mynml/ x
*************** is used.
*** 2570,2584 ****
       END PROGRAM test_print
  
     Expanded namelist reads are permitted.  This causes an error if
! `-std=f95' is used.  In the following example, the first element of the
  array will be given the value 0.00 and the two succeeding elements will
  be given the values 1.00 and 2.00.
       &MYNML
         X(1,1) = 0.00 , 1.00 , 2.00
       /
  
!    When writing a namelist, if no `DELIM=' is specified, by default a
! double quote is used to delimit character strings. If -std=F95, F2003,
  or F2008, etc, the delim status is set to 'none'.  Defaulting to quotes
  ensures that namelists with character strings can be subsequently read
  back in accurately.
--- 2547,2561 ----
       END PROGRAM test_print
  
     Expanded namelist reads are permitted.  This causes an error if
! '-std=f95' is used.  In the following example, the first element of the
  array will be given the value 0.00 and the two succeeding elements will
  be given the values 1.00 and 2.00.
       &MYNML
         X(1,1) = 0.00 , 1.00 , 2.00
       /
  
!    When writing a namelist, if no 'DELIM=' is specified, by default a
! double quote is used to delimit character strings.  If -std=F95, F2003,
  or F2008, etc, the delim status is set to 'none'.  Defaulting to quotes
  ensures that namelists with character strings can be subsequently read
  back in accurately.
*************** back in accurately.
*** 2586,2597 ****
  
  File: gfortran.info,  Node: X format descriptor without count field,  Next: Commas in FORMAT specifications,  Prev: Extensions to namelist,  Up: Extensions implemented in GNU Fortran
  
! 6.1.4 `X' format descriptor without count field
  -----------------------------------------------
  
! To support legacy codes, GNU Fortran permits the count field of the `X'
! edit descriptor in `FORMAT' statements to be omitted.  When omitted,
! the count is implicitly assumed to be one.
  
              PRINT 10, 2, 3
       10     FORMAT (I1, X, I1)
--- 2563,2574 ----
  
  File: gfortran.info,  Node: X format descriptor without count field,  Next: Commas in FORMAT specifications,  Prev: Extensions to namelist,  Up: Extensions implemented in GNU Fortran
  
! 6.1.4 'X' format descriptor without count field
  -----------------------------------------------
  
! To support legacy codes, GNU Fortran permits the count field of the 'X'
! edit descriptor in 'FORMAT' statements to be omitted.  When omitted, the
! count is implicitly assumed to be one.
  
              PRINT 10, 2, 3
       10     FORMAT (I1, X, I1)
*************** the count is implicitly assumed to be on
*** 2599,2610 ****
  
  File: gfortran.info,  Node: Commas in FORMAT specifications,  Next: Missing period in FORMAT specifications,  Prev: X format descriptor without count field,  Up: Extensions implemented in GNU Fortran
  
! 6.1.5 Commas in `FORMAT' specifications
  ---------------------------------------
  
  To support legacy codes, GNU Fortran allows the comma separator to be
  omitted immediately before and after character string edit descriptors
! in `FORMAT' statements.
  
              PRINT 10, 2, 3
       10     FORMAT ('FOO='I1' BAR='I2)
--- 2576,2587 ----
  
  File: gfortran.info,  Node: Commas in FORMAT specifications,  Next: Missing period in FORMAT specifications,  Prev: X format descriptor without count field,  Up: Extensions implemented in GNU Fortran
  
! 6.1.5 Commas in 'FORMAT' specifications
  ---------------------------------------
  
  To support legacy codes, GNU Fortran allows the comma separator to be
  omitted immediately before and after character string edit descriptors
! in 'FORMAT' statements.
  
              PRINT 10, 2, 3
       10     FORMAT ('FOO='I1' BAR='I2)
*************** in `FORMAT' statements.
*** 2612,2622 ****
  
  File: gfortran.info,  Node: Missing period in FORMAT specifications,  Next: I/O item lists,  Prev: Commas in FORMAT specifications,  Up: Extensions implemented in GNU Fortran
  
! 6.1.6 Missing period in `FORMAT' specifications
  -----------------------------------------------
  
  To support legacy codes, GNU Fortran allows missing periods in format
! specifications if and only if `-std=legacy' is given on the command
  line.  This is considered non-conforming code and is discouraged.
  
              REAL :: value
--- 2589,2599 ----
  
  File: gfortran.info,  Node: Missing period in FORMAT specifications,  Next: I/O item lists,  Prev: Commas in FORMAT specifications,  Up: Extensions implemented in GNU Fortran
  
! 6.1.6 Missing period in 'FORMAT' specifications
  -----------------------------------------------
  
  To support legacy codes, GNU Fortran allows missing periods in format
! specifications if and only if '-std=legacy' is given on the command
  line.  This is considered non-conforming code and is discouraged.
  
              REAL :: value
*************** line.  This is considered non-conforming
*** 2624,2697 ****
       10     FORMAT ('F4')
  
  
! File: gfortran.info,  Node: I/O item lists,  Next: `Q' exponent-letter,  Prev: Missing period in FORMAT specifications,  Up: Extensions implemented in GNU Fortran
  
  6.1.7 I/O item lists
  --------------------
  
  To support legacy codes, GNU Fortran allows the input item list of the
! `READ' statement, and the output item lists of the `WRITE' and `PRINT'
  statements, to start with a comma.
  
  
! File: gfortran.info,  Node: `Q' exponent-letter,  Next: BOZ literal constants,  Prev: I/O item lists,  Up: Extensions implemented in GNU Fortran
  
! 6.1.8 `Q' exponent-letter
  -------------------------
  
  GNU Fortran accepts real literal constants with an exponent-letter of
! `Q', for example, `1.23Q45'.  The constant is interpreted as a
! `REAL(16)' entity on targets that support this type.  If the target
! does not support `REAL(16)' but has a `REAL(10)' type, then the
! real-literal-constant will be interpreted as a `REAL(10)' entity.  In
! the absence of `REAL(16)' and `REAL(10)', an error will occur.
  
  
! File: gfortran.info,  Node: BOZ literal constants,  Next: Real array indices,  Prev: `Q' exponent-letter,  Up: Extensions implemented in GNU Fortran
  
  6.1.9 BOZ literal constants
  ---------------------------
  
! Besides decimal constants, Fortran also supports binary (`b'), octal
! (`o') and hexadecimal (`z') integer constants.  The syntax is: `prefix
! quote digits quote', were the prefix is either `b', `o' or `z', quote
! is either `'' or `"' and the digits are for binary `0' or `1', for
! octal between `0' and `7', and for hexadecimal between `0' and `F'.
! (Example: `b'01011101''.)
  
     Up to Fortran 95, BOZ literals were only allowed to initialize
  integer variables in DATA statements.  Since Fortran 2003 BOZ literals
! are also allowed as argument of `REAL', `DBLE', `INT' and `CMPLX'; the
  result is the same as if the integer BOZ literal had been converted by
! `TRANSFER' to, respectively, `real', `double precision', `integer' or
! `complex'.  As GNU Fortran extension the intrinsic procedures `FLOAT',
! `DFLOAT', `COMPLEX' and `DCMPLX' are treated alike.
  
!    As an extension, GNU Fortran allows hexadecimal BOZ literal
! constants to be specified using the `X' prefix, in addition to the
! standard `Z' prefix.  The BOZ literal can also be specified by adding a
! suffix to the string, for example, `Z'ABC'' and `'ABC'Z' are equivalent.
  
     Furthermore, GNU Fortran allows using BOZ literal constants outside
  DATA statements and the four intrinsic functions allowed by Fortran
  2003.  In DATA statements, in direct assignments, where the right-hand
  side only contains a BOZ literal constant, and for old-style
! initializers of the form `integer i /o'0173'/', the constant is
! transferred as if `TRANSFER' had been used; for `COMPLEX' numbers, only
! the real part is initialized unless `CMPLX' is used.  In all other
! cases, the BOZ literal constant is converted to an `INTEGER' value with
  the largest decimal representation.  This value is then converted
  numerically to the type and kind of the variable in question.  (For
! instance, `real :: r = b'0000001' + 1' initializes `r' with `2.0'.) As
  different compilers implement the extension differently, one should be
  careful when doing bitwise initialization of non-integer variables.
  
!    Note that initializing an `INTEGER' variable with a statement such
! as `DATA i/Z'FFFFFFFF'/' will give an integer overflow error rather
! than the desired result of -1 when `i' is a 32-bit integer on a system
! that supports 64-bit integers.  The `-fno-range-check' option can be
! used as a workaround for legacy code that initializes integers in this
! manner.
  
  
  File: gfortran.info,  Node: Real array indices,  Next: Unary operators,  Prev: BOZ literal constants,  Up: Extensions implemented in GNU Fortran
--- 2601,2673 ----
       10     FORMAT ('F4')
  
  
! File: gfortran.info,  Node: I/O item lists,  Next: Q exponent-letter,  Prev: Missing period in FORMAT specifications,  Up: Extensions implemented in GNU Fortran
  
  6.1.7 I/O item lists
  --------------------
  
  To support legacy codes, GNU Fortran allows the input item list of the
! 'READ' statement, and the output item lists of the 'WRITE' and 'PRINT'
  statements, to start with a comma.
  
  
! File: gfortran.info,  Node: Q exponent-letter,  Next: BOZ literal constants,  Prev: I/O item lists,  Up: Extensions implemented in GNU Fortran
  
! 6.1.8 'Q' exponent-letter
  -------------------------
  
  GNU Fortran accepts real literal constants with an exponent-letter of
! 'Q', for example, '1.23Q45'.  The constant is interpreted as a
! 'REAL(16)' entity on targets that support this type.  If the target does
! not support 'REAL(16)' but has a 'REAL(10)' type, then the
! real-literal-constant will be interpreted as a 'REAL(10)' entity.  In
! the absence of 'REAL(16)' and 'REAL(10)', an error will occur.
  
  
! File: gfortran.info,  Node: BOZ literal constants,  Next: Real array indices,  Prev: Q exponent-letter,  Up: Extensions implemented in GNU Fortran
  
  6.1.9 BOZ literal constants
  ---------------------------
  
! Besides decimal constants, Fortran also supports binary ('b'), octal
! ('o') and hexadecimal ('z') integer constants.  The syntax is: 'prefix
! quote digits quote', were the prefix is either 'b', 'o' or 'z', quote is
! either ''' or '"' and the digits are for binary '0' or '1', for octal
! between '0' and '7', and for hexadecimal between '0' and 'F'.  (Example:
! 'b'01011101''.)
  
     Up to Fortran 95, BOZ literals were only allowed to initialize
  integer variables in DATA statements.  Since Fortran 2003 BOZ literals
! are also allowed as argument of 'REAL', 'DBLE', 'INT' and 'CMPLX'; the
  result is the same as if the integer BOZ literal had been converted by
! 'TRANSFER' to, respectively, 'real', 'double precision', 'integer' or
! 'complex'.  As GNU Fortran extension the intrinsic procedures 'FLOAT',
! 'DFLOAT', 'COMPLEX' and 'DCMPLX' are treated alike.
  
!    As an extension, GNU Fortran allows hexadecimal BOZ literal constants
! to be specified using the 'X' prefix, in addition to the standard 'Z'
! prefix.  The BOZ literal can also be specified by adding a suffix to the
! string, for example, 'Z'ABC'' and ''ABC'Z' are equivalent.
  
     Furthermore, GNU Fortran allows using BOZ literal constants outside
  DATA statements and the four intrinsic functions allowed by Fortran
  2003.  In DATA statements, in direct assignments, where the right-hand
  side only contains a BOZ literal constant, and for old-style
! initializers of the form 'integer i /o'0173'/', the constant is
! transferred as if 'TRANSFER' had been used; for 'COMPLEX' numbers, only
! the real part is initialized unless 'CMPLX' is used.  In all other
! cases, the BOZ literal constant is converted to an 'INTEGER' value with
  the largest decimal representation.  This value is then converted
  numerically to the type and kind of the variable in question.  (For
! instance, 'real :: r = b'0000001' + 1' initializes 'r' with '2.0'.)  As
  different compilers implement the extension differently, one should be
  careful when doing bitwise initialization of non-integer variables.
  
!    Note that initializing an 'INTEGER' variable with a statement such as
! 'DATA i/Z'FFFFFFFF'/' will give an integer overflow error rather than
! the desired result of -1 when 'i' is a 32-bit integer on a system that
! supports 64-bit integers.  The '-fno-range-check' option can be used as
! a workaround for legacy code that initializes integers in this manner.
  
  
  File: gfortran.info,  Node: Real array indices,  Next: Unary operators,  Prev: BOZ literal constants,  Up: Extensions implemented in GNU Fortran
*************** File: gfortran.info,  Node: Real array i
*** 2699,2705 ****
  6.1.10 Real array indices
  -------------------------
  
! As an extension, GNU Fortran allows the use of `REAL' expressions or
  variables as array indices.
  
  
--- 2675,2681 ----
  6.1.10 Real array indices
  -------------------------
  
! As an extension, GNU Fortran allows the use of 'REAL' expressions or
  variables as array indices.
  
  
*************** the need for parenthesis.
*** 2717,2741 ****
  
  File: gfortran.info,  Node: Implicitly convert LOGICAL and INTEGER values,  Next: Hollerith constants support,  Prev: Unary operators,  Up: Extensions implemented in GNU Fortran
  
! 6.1.12 Implicitly convert `LOGICAL' and `INTEGER' values
  --------------------------------------------------------
  
  As an extension for backwards compatibility with other compilers, GNU
! Fortran allows the implicit conversion of `LOGICAL' values to `INTEGER'
! values and vice versa.  When converting from a `LOGICAL' to an
! `INTEGER', `.FALSE.' is interpreted as zero, and `.TRUE.' is
! interpreted as one.  When converting from `INTEGER' to `LOGICAL', the
! value zero is interpreted as `.FALSE.' and any nonzero value is
! interpreted as `.TRUE.'.
  
               LOGICAL :: l
               l = 1
- 
               INTEGER :: i
               i = .TRUE.
  
!    However, there is no implicit conversion of `INTEGER' values in
! `if'-statements, nor of `LOGICAL' or `INTEGER' values in I/O operations.
  
  
  File: gfortran.info,  Node: Hollerith constants support,  Next: Cray pointers,  Prev: Implicitly convert LOGICAL and INTEGER values,  Up: Extensions implemented in GNU Fortran
--- 2693,2716 ----
  
  File: gfortran.info,  Node: Implicitly convert LOGICAL and INTEGER values,  Next: Hollerith constants support,  Prev: Unary operators,  Up: Extensions implemented in GNU Fortran
  
! 6.1.12 Implicitly convert 'LOGICAL' and 'INTEGER' values
  --------------------------------------------------------
  
  As an extension for backwards compatibility with other compilers, GNU
! Fortran allows the implicit conversion of 'LOGICAL' values to 'INTEGER'
! values and vice versa.  When converting from a 'LOGICAL' to an
! 'INTEGER', '.FALSE.' is interpreted as zero, and '.TRUE.' is interpreted
! as one.  When converting from 'INTEGER' to 'LOGICAL', the value zero is
! interpreted as '.FALSE.' and any nonzero value is interpreted as
! '.TRUE.'.
  
               LOGICAL :: l
               l = 1
               INTEGER :: i
               i = .TRUE.
  
!    However, there is no implicit conversion of 'INTEGER' values in
! 'if'-statements, nor of 'LOGICAL' or 'INTEGER' values in I/O operations.
  
  
  File: gfortran.info,  Node: Hollerith constants support,  Next: Cray pointers,  Prev: Implicitly convert LOGICAL and INTEGER values,  Up: Extensions implemented in GNU Fortran
*************** File: gfortran.info,  Node: Hollerith co
*** 2744,2755 ****
  ----------------------------------
  
  GNU Fortran supports Hollerith constants in assignments, function
! arguments, and `DATA' and `ASSIGN' statements.  A Hollerith constant is
  written as a string of characters preceded by an integer constant
! indicating the character count, and the letter `H' or `h', and stored
! in bytewise fashion in a numeric (`INTEGER', `REAL', or `complex') or
! `LOGICAL' variable.  The constant will be padded or truncated to fit
! the size of the variable in which it is stored.
  
     Examples of valid uses of Hollerith constants:
             complex*16 x(2)
--- 2719,2730 ----
  ----------------------------------
  
  GNU Fortran supports Hollerith constants in assignments, function
! arguments, and 'DATA' and 'ASSIGN' statements.  A Hollerith constant is
  written as a string of characters preceded by an integer constant
! indicating the character count, and the letter 'H' or 'h', and stored in
! bytewise fashion in a numeric ('INTEGER', 'REAL', or 'complex') or
! 'LOGICAL' variable.  The constant will be padded or truncated to fit the
! size of the variable in which it is stored.
  
     Examples of valid uses of Hollerith constants:
             complex*16 x(2)
*************** the size of the variable in which it is
*** 2764,2775 ****
  
     In general, Hollerith constants were used to provide a rudimentary
  facility for handling character strings in early Fortran compilers,
! prior to the introduction of `CHARACTER' variables in Fortran 77; in
! those cases, the standard-compliant equivalent is to convert the
! program to use proper character strings.  On occasion, there may be a
! case where the intent is specifically to initialize a numeric variable
! with a given byte sequence.  In these cases, the same result can be
! obtained by using the `TRANSFER' statement, as in this example.
             INTEGER(KIND=4) :: a
             a = TRANSFER ("abcd", a)     ! equivalent to: a = 4Habcd
  
--- 2739,2750 ----
  
     In general, Hollerith constants were used to provide a rudimentary
  facility for handling character strings in early Fortran compilers,
! prior to the introduction of 'CHARACTER' variables in Fortran 77; in
! those cases, the standard-compliant equivalent is to convert the program
! to use proper character strings.  On occasion, there may be a case where
! the intent is specifically to initialize a numeric variable with a given
! byte sequence.  In these cases, the same result can be obtained by using
! the 'TRANSFER' statement, as in this example.
             INTEGER(KIND=4) :: a
             a = TRANSFER ("abcd", a)     ! equivalent to: a = 4Habcd
  
*************** variables: an integer "pointer" that hol
*** 2789,2805 ****
     or,
               pointer ( <pointer1> , <pointee1> ), ( <pointer2> , <pointee2> ), ...
     The pointer is an integer that is intended to hold a memory address.
! The pointee may be an array or scalar.  A pointee can be an assumed
! size array--that is, the last dimension may be left unspecified by
! using a `*' in place of a value--but a pointee cannot be an assumed
! shape array.  No space is allocated for the pointee.
  
     The pointee may have its type declared before or after the pointer
  statement, and its array specification (if any) may be declared before,
  during, or after the pointer statement.  The pointer may be declared as
  an integer prior to the pointer statement.  However, some machines have
! default integer sizes that are different than the size of a pointer,
! and so the following code is not portable:
               integer ipt
               pointer (ipt, iarr)
     If a pointer is declared with a kind that is too small, the compiler
--- 2764,2780 ----
     or,
               pointer ( <pointer1> , <pointee1> ), ( <pointer2> , <pointee2> ), ...
     The pointer is an integer that is intended to hold a memory address.
! The pointee may be an array or scalar.  A pointee can be an assumed size
! array--that is, the last dimension may be left unspecified by using a
! '*' in place of a value--but a pointee cannot be an assumed shape array.
! No space is allocated for the pointee.
  
     The pointee may have its type declared before or after the pointer
  statement, and its array specification (if any) may be declared before,
  during, or after the pointer statement.  The pointer may be declared as
  an integer prior to the pointer statement.  However, some machines have
! default integer sizes that are different than the size of a pointer, and
! so the following code is not portable:
               integer ipt
               pointer (ipt, iarr)
     If a pointer is declared with a kind that is too small, the compiler
*************** explicit declaration of ipt's type is om
*** 2810,2840 ****
  ensure that ipt is an integer variable large enough to hold a pointer.
  
     Pointer arithmetic is valid with Cray pointers, but it is not the
! same as C pointer arithmetic.  Cray pointers are just ordinary
! integers, so the user is responsible for determining how many bytes to
! add to a pointer in order to increment it.  Consider the following
! example:
               real target(10)
               real pointee(10)
               pointer (ipt, pointee)
               ipt = loc (target)
               ipt = ipt + 1
!    The last statement does not set `ipt' to the address of `target(1)',
! as it would in C pointer arithmetic.  Adding `1' to `ipt' just adds one
! byte to the address stored in `ipt'.
  
     Any expression involving the pointee will be translated to use the
  value stored in the pointer as the base address.
  
     To get the address of elements, this extension provides an intrinsic
! function `LOC()'.  The `LOC()' function is equivalent to the `&'
  operator in C, except the address is cast to an integer type:
               real ar(10)
               pointer(ipt, arpte(10))
               real arpte
               ipt = loc(ar)  ! Makes arpte is an alias for ar
               arpte(1) = 1.0 ! Sets ar(1) to 1.0
!    The pointer can also be set by a call to the `MALLOC' intrinsic (see
  *note MALLOC::).
  
     Cray pointees often are used to alias an existing variable.  For
--- 2785,2814 ----
  ensure that ipt is an integer variable large enough to hold a pointer.
  
     Pointer arithmetic is valid with Cray pointers, but it is not the
! same as C pointer arithmetic.  Cray pointers are just ordinary integers,
! so the user is responsible for determining how many bytes to add to a
! pointer in order to increment it.  Consider the following example:
               real target(10)
               real pointee(10)
               pointer (ipt, pointee)
               ipt = loc (target)
               ipt = ipt + 1
!    The last statement does not set 'ipt' to the address of 'target(1)',
! as it would in C pointer arithmetic.  Adding '1' to 'ipt' just adds one
! byte to the address stored in 'ipt'.
  
     Any expression involving the pointee will be translated to use the
  value stored in the pointer as the base address.
  
     To get the address of elements, this extension provides an intrinsic
! function 'LOC()'.  The 'LOC()' function is equivalent to the '&'
  operator in C, except the address is cast to an integer type:
               real ar(10)
               pointer(ipt, arpte(10))
               real arpte
               ipt = loc(ar)  ! Makes arpte is an alias for ar
               arpte(1) = 1.0 ! Sets ar(1) to 1.0
!    The pointer can also be set by a call to the 'MALLOC' intrinsic (see
  *note MALLOC::).
  
     Cray pointees often are used to alias an existing variable.  For
*************** example:
*** 2843,2872 ****
               integer iarr(10)
               pointer (ipt, iarr)
               ipt = loc(target)
!    As long as `ipt' remains unchanged, `iarr' is now an alias for
! `target'.  The optimizer, however, will not detect this aliasing, so it
! is unsafe to use `iarr' and `target' simultaneously.  Using a pointee
! in any way that violates the Fortran aliasing rules or assumptions is
  illegal.  It is the user's responsibility to avoid doing this; the
  compiler works under the assumption that no such aliasing occurs.
  
     Cray pointers will work correctly when there is no aliasing (i.e.,
  when they are used to access a dynamically allocated block of memory),
  and also in any routine where a pointee is used, but any variable with
! which it shares storage is not used.  Code that violates these rules
! may not run as the user intends.  This is not a bug in the optimizer;
! any code that violates the aliasing rules is illegal.  (Note that this
! is not unique to GNU Fortran; any Fortran compiler that supports Cray
  pointers will "incorrectly" optimize code with illegal aliasing.)
  
     There are a number of restrictions on the attributes that can be
  applied to Cray pointers and pointees.  Pointees may not have the
! `ALLOCATABLE', `INTENT', `OPTIONAL', `DUMMY', `TARGET', `INTRINSIC', or
! `POINTER' attributes.  Pointers may not have the `DIMENSION',
! `POINTER', `TARGET', `ALLOCATABLE', `EXTERNAL', or `INTRINSIC'
! attributes, nor may they be function results.  Pointees may not occur
! in more than one pointer statement.  A pointee cannot be a pointer.
! Pointees cannot occur in equivalence, common, or data statements.
  
     A Cray pointer may also point to a function or a subroutine.  For
  example, the following excerpt is valid:
--- 2817,2846 ----
               integer iarr(10)
               pointer (ipt, iarr)
               ipt = loc(target)
!    As long as 'ipt' remains unchanged, 'iarr' is now an alias for
! 'target'.  The optimizer, however, will not detect this aliasing, so it
! is unsafe to use 'iarr' and 'target' simultaneously.  Using a pointee in
! any way that violates the Fortran aliasing rules or assumptions is
  illegal.  It is the user's responsibility to avoid doing this; the
  compiler works under the assumption that no such aliasing occurs.
  
     Cray pointers will work correctly when there is no aliasing (i.e.,
  when they are used to access a dynamically allocated block of memory),
  and also in any routine where a pointee is used, but any variable with
! which it shares storage is not used.  Code that violates these rules may
! not run as the user intends.  This is not a bug in the optimizer; any
! code that violates the aliasing rules is illegal.  (Note that this is
! not unique to GNU Fortran; any Fortran compiler that supports Cray
  pointers will "incorrectly" optimize code with illegal aliasing.)
  
     There are a number of restrictions on the attributes that can be
  applied to Cray pointers and pointees.  Pointees may not have the
! 'ALLOCATABLE', 'INTENT', 'OPTIONAL', 'DUMMY', 'TARGET', 'INTRINSIC', or
! 'POINTER' attributes.  Pointers may not have the 'DIMENSION', 'POINTER',
! 'TARGET', 'ALLOCATABLE', 'EXTERNAL', or 'INTRINSIC' attributes, nor may
! they be function results.  Pointees may not occur in more than one
! pointer statement.  A pointee cannot be a pointer.  Pointees cannot
! occur in equivalence, common, or data statements.
  
     A Cray pointer may also point to a function or a subroutine.  For
  example, the following excerpt is valid:
*************** example, the following excerpt is valid:
*** 2883,2914 ****
  
     A pointer may be modified during the course of a program, and this
  will change the location to which the pointee refers.  However, when
! pointees are passed as arguments, they are treated as ordinary
! variables in the invoked function.  Subsequent changes to the pointer
! will not change the base address of the array that was passed.
  
  
  File: gfortran.info,  Node: CONVERT specifier,  Next: OpenMP,  Prev: Cray pointers,  Up: Extensions implemented in GNU Fortran
  
! 6.1.15 `CONVERT' specifier
  --------------------------
  
  GNU Fortran allows the conversion of unformatted data between little-
  and big-endian representation to facilitate moving of data between
! different systems.  The conversion can be indicated with the `CONVERT'
! specifier on the `OPEN' statement.  *Note GFORTRAN_CONVERT_UNIT::, for
  an alternative way of specifying the data format via an environment
  variable.
  
!    Valid values for `CONVERT' are:
!      `CONVERT='NATIVE'' Use the native format.  This is the default.
! 
!      `CONVERT='SWAP'' Swap between little- and big-endian.
! 
!      `CONVERT='LITTLE_ENDIAN'' Use the little-endian representation for
       unformatted files.
! 
!      `CONVERT='BIG_ENDIAN'' Use the big-endian representation for
       unformatted files.
  
     Using the option could look like this:
--- 2857,2885 ----
  
     A pointer may be modified during the course of a program, and this
  will change the location to which the pointee refers.  However, when
! pointees are passed as arguments, they are treated as ordinary variables
! in the invoked function.  Subsequent changes to the pointer will not
! change the base address of the array that was passed.
  
  
  File: gfortran.info,  Node: CONVERT specifier,  Next: OpenMP,  Prev: Cray pointers,  Up: Extensions implemented in GNU Fortran
  
! 6.1.15 'CONVERT' specifier
  --------------------------
  
  GNU Fortran allows the conversion of unformatted data between little-
  and big-endian representation to facilitate moving of data between
! different systems.  The conversion can be indicated with the 'CONVERT'
! specifier on the 'OPEN' statement.  *Note GFORTRAN_CONVERT_UNIT::, for
  an alternative way of specifying the data format via an environment
  variable.
  
!    Valid values for 'CONVERT' are:
!      'CONVERT='NATIVE'' Use the native format.  This is the default.
!      'CONVERT='SWAP'' Swap between little- and big-endian.
!      'CONVERT='LITTLE_ENDIAN'' Use the little-endian representation for
       unformatted files.
!      'CONVERT='BIG_ENDIAN'' Use the big-endian representation for
       unformatted files.
  
     Using the option could look like this:
*************** variable.
*** 2916,2929 ****
              convert='big_endian')
  
     The value of the conversion can be queried by using
! `INQUIRE(CONVERT=ch)'.  The values returned are `'BIG_ENDIAN'' and
! `'LITTLE_ENDIAN''.
  
!    `CONVERT' works between big- and little-endian for `INTEGER' values
! of all supported kinds and for `REAL' on IEEE systems of kinds 4 and 8.
  Conversion between different "extended double" types on different
  architectures such as m68k and x86_64, which GNU Fortran supports as
! `REAL(KIND=10)' and `REAL(KIND=16)', will probably not work.
  
     _Note that the values specified via the GFORTRAN_CONVERT_UNIT
  environment variable will override the CONVERT specifier in the open
--- 2887,2900 ----
              convert='big_endian')
  
     The value of the conversion can be queried by using
! 'INQUIRE(CONVERT=ch)'.  The values returned are ''BIG_ENDIAN'' and
! ''LITTLE_ENDIAN''.
  
!    'CONVERT' works between big- and little-endian for 'INTEGER' values
! of all supported kinds and for 'REAL' on IEEE systems of kinds 4 and 8.
  Conversion between different "extended double" types on different
  architectures such as m68k and x86_64, which GNU Fortran supports as
! 'REAL(KIND=10)' and 'REAL(KIND=16)', will probably not work.
  
     _Note that the values specified via the GFORTRAN_CONVERT_UNIT
  environment variable will override the CONVERT specifier in the open
*************** run-time behavior.
*** 2950,2966 ****
     GNU Fortran strives to be compatible to the OpenMP Application
  Program Interface v4.0 (http://openmp.org/wp/openmp-specifications/).
  
!    To enable the processing of the OpenMP directive `!$omp' in
! free-form source code; the `c$omp', `*$omp' and `!$omp' directives in
! fixed form; the `!$' conditional compilation sentinels in free form;
! and the `c$', `*$' and `!$' sentinels in fixed form, `gfortran' needs
! to be invoked with the `-fopenmp'.  This also arranges for automatic
! linking of the GNU Offloading and Multi Processing Runtime Library
! *note libgomp: (libgomp)Top.
  
     The OpenMP Fortran runtime library routines are provided both in a
! form of a Fortran 90 module named `omp_lib' and in a form of a Fortran
! `include' file named `omp_lib.h'.
  
     An example of a parallelized loop taken from Appendix A.1 of the
  OpenMP Application Program Interface v2.5:
--- 2921,2937 ----
     GNU Fortran strives to be compatible to the OpenMP Application
  Program Interface v4.0 (http://openmp.org/wp/openmp-specifications/).
  
!    To enable the processing of the OpenMP directive '!$omp' in free-form
! source code; the 'c$omp', '*$omp' and '!$omp' directives in fixed form;
! the '!$' conditional compilation sentinels in free form; and the 'c$',
! '*$' and '!$' sentinels in fixed form, 'gfortran' needs to be invoked
! with the '-fopenmp'.  This also arranges for automatic linking of the
! GNU Offloading and Multi Processing Runtime Library *note libgomp:
! (libgomp)Top.
  
     The OpenMP Fortran runtime library routines are provided both in a
! form of a Fortran 90 module named 'omp_lib' and in a form of a Fortran
! 'include' file named 'omp_lib.h'.
  
     An example of a parallelized loop taken from Appendix A.1 of the
  OpenMP Application Program Interface v2.5:
*************** OpenMP Application Program Interface v2.
*** 2975,2991 ****
       END SUBROUTINE A1
  
     Please note:
!    * `-fopenmp' implies `-frecursive', i.e., all local arrays will be
!      allocated on the stack.  When porting existing code to OpenMP,
!      this may lead to surprising results, especially to segmentation
!      faults if the stacksize is limited.
  
     * On glibc-based systems, OpenMP enabled applications cannot be
       statically linked due to limitations of the underlying
       pthreads-implementation.  It might be possible to get a working
!      solution if `-Wl,--whole-archive -lpthread -Wl,--no-whole-archive'
       is added to the command line.  However, this is not supported by
!      `gcc' and thus not recommended.
  
  
  File: gfortran.info,  Node: OpenACC,  Next: Argument list functions,  Prev: OpenMP,  Up: Extensions implemented in GNU Fortran
--- 2946,2962 ----
       END SUBROUTINE A1
  
     Please note:
!    * '-fopenmp' implies '-frecursive', i.e., all local arrays will be
!      allocated on the stack.  When porting existing code to OpenMP, this
!      may lead to surprising results, especially to segmentation faults
!      if the stacksize is limited.
  
     * On glibc-based systems, OpenMP enabled applications cannot be
       statically linked due to limitations of the underlying
       pthreads-implementation.  It might be possible to get a working
!      solution if '-Wl,--whole-archive -lpthread -Wl,--no-whole-archive'
       is added to the command line.  However, this is not supported by
!      'gcc' and thus not recommended.
  
  
  File: gfortran.info,  Node: OpenACC,  Next: Argument list functions,  Prev: OpenMP,  Up: Extensions implemented in GNU Fortran
*************** influence run-time behavior.
*** 3001,3043 ****
     GNU Fortran strives to be compatible to the OpenACC Application
  Programming Interface v2.0 (http://www.openacc.org/).
  
!    To enable the processing of the OpenACC directive `!$acc' in
! free-form source code; the `c$acc', `*$acc' and `!$acc' directives in
! fixed form; the `!$' conditional compilation sentinels in free form;
! and the `c$', `*$' and `!$' sentinels in fixed form, `gfortran' needs
! to be invoked with the `-fopenacc'.  This also arranges for automatic
! linking of the GNU Offloading and Multi Processing Runtime Library
! *note libgomp: (libgomp)Top.
  
     The OpenACC Fortran runtime library routines are provided both in a
! form of a Fortran 90 module named `openacc' and in a form of a Fortran
! `include' file named `openacc_lib.h'.
  
     Note that this is an experimental feature, incomplete, and subject to
! change in future versions of GCC.  See
! `https://gcc.gnu.org/wiki/OpenACC' for more information.
  
  
  File: gfortran.info,  Node: Argument list functions,  Next: Read/Write after EOF marker,  Prev: OpenACC,  Up: Extensions implemented in GNU Fortran
  
! 6.1.18 Argument list functions `%VAL', `%REF' and `%LOC'
  --------------------------------------------------------
  
! GNU Fortran supports argument list functions `%VAL', `%REF' and `%LOC'
! statements, for backward compatibility with g77.  It is recommended
! that these should be used only for code that is accessing facilities
! outside of GNU Fortran, such as operating system or windowing
! facilities.  It is best to constrain such uses to isolated portions of
! a program-portions that deal specifically and exclusively with
! low-level, system-dependent facilities.  Such portions might well
! provide a portable interface for use by the program as a whole, but are
! themselves not portable, and should be thoroughly tested each time they
! are rebuilt using a new compiler or version of a compiler.
  
!    `%VAL' passes a scalar argument by value, `%REF' passes it by
! reference and `%LOC' passes its memory location.  Since gfortran
! already passes scalar arguments by reference, `%REF' is in effect a
! do-nothing.  `%LOC' has the same effect as a Fortran pointer.
  
     An example of passing an argument by value to a C subroutine foo.:
       C
--- 2972,3014 ----
     GNU Fortran strives to be compatible to the OpenACC Application
  Programming Interface v2.0 (http://www.openacc.org/).
  
!    To enable the processing of the OpenACC directive '!$acc' in
! free-form source code; the 'c$acc', '*$acc' and '!$acc' directives in
! fixed form; the '!$' conditional compilation sentinels in free form; and
! the 'c$', '*$' and '!$' sentinels in fixed form, 'gfortran' needs to be
! invoked with the '-fopenacc'.  This also arranges for automatic linking
! of the GNU Offloading and Multi Processing Runtime Library *note
! libgomp: (libgomp)Top.
  
     The OpenACC Fortran runtime library routines are provided both in a
! form of a Fortran 90 module named 'openacc' and in a form of a Fortran
! 'include' file named 'openacc_lib.h'.
  
     Note that this is an experimental feature, incomplete, and subject to
! change in future versions of GCC. See <https://gcc.gnu.org/wiki/OpenACC>
! for more information.
  
  
  File: gfortran.info,  Node: Argument list functions,  Next: Read/Write after EOF marker,  Prev: OpenACC,  Up: Extensions implemented in GNU Fortran
  
! 6.1.18 Argument list functions '%VAL', '%REF' and '%LOC'
  --------------------------------------------------------
  
! GNU Fortran supports argument list functions '%VAL', '%REF' and '%LOC'
! statements, for backward compatibility with g77.  It is recommended that
! these should be used only for code that is accessing facilities outside
! of GNU Fortran, such as operating system or windowing facilities.  It is
! best to constrain such uses to isolated portions of a program-portions
! that deal specifically and exclusively with low-level, system-dependent
! facilities.  Such portions might well provide a portable interface for
! use by the program as a whole, but are themselves not portable, and
! should be thoroughly tested each time they are rebuilt using a new
! compiler or version of a compiler.
  
!    '%VAL' passes a scalar argument by value, '%REF' passes it by
! reference and '%LOC' passes its memory location.  Since gfortran already
! passes scalar arguments by reference, '%REF' is in effect a do-nothing.
! '%LOC' has the same effect as a Fortran pointer.
  
     An example of passing an argument by value to a C subroutine foo.:
       C
*************** do-nothing.  `%LOC' has the same effect
*** 3050,3058 ****
             end
  
     For details refer to the g77 manual
! `https://gcc.gnu.org/onlinedocs/gcc-3.4.6/g77/index.html#Top'.
  
!    Also, `c_by_val.f' and its partner `c_by_val.c' of the GNU Fortran
  testsuite are worth a look.
  
  
--- 3021,3029 ----
             end
  
     For details refer to the g77 manual
! <https://gcc.gnu.org/onlinedocs/gcc-3.4.6/g77/index.html#Top>.
  
!    Also, 'c_by_val.f' and its partner 'c_by_val.c' of the GNU Fortran
  testsuite are worth a look.
  
  
*************** File: gfortran.info,  Node: Read/Write a
*** 3061,3072 ****
  6.1.19 Read/Write after EOF marker
  ----------------------------------
  
! Some legacy codes rely on allowing `READ' or `WRITE' after the EOF file
! marker in order to find the end of a file. GNU Fortran normally rejects
! these codes with a run-time error message and suggests the user
! consider `BACKSPACE' or `REWIND' to properly position the file before
! the EOF marker.  As an extension, the run-time error may be disabled
! using -std=legacy.
  
  
  File: gfortran.info,  Node: Extensions not implemented in GNU Fortran,  Prev: Extensions implemented in GNU Fortran,  Up: Extensions
--- 3032,3043 ----
  6.1.19 Read/Write after EOF marker
  ----------------------------------
  
! Some legacy codes rely on allowing 'READ' or 'WRITE' after the EOF file
! marker in order to find the end of a file.  GNU Fortran normally rejects
! these codes with a run-time error message and suggests the user consider
! 'BACKSPACE' or 'REWIND' to properly position the file before the EOF
! marker.  As an extension, the run-time error may be disabled using
! -std=legacy.
  
  
  File: gfortran.info,  Node: Extensions not implemented in GNU Fortran,  Prev: Extensions implemented in GNU Fortran,  Up: Extensions
*************** some features crucial to users in the fi
*** 3080,3087 ****
  existence of a number of important extensions to the language.  While
  some of the most useful or popular extensions are supported by the GNU
  Fortran compiler, not all existing extensions are supported.  This
! section aims at listing these extensions and offering advice on how
! best make code that uses them running with the GNU Fortran compiler.
  
  * Menu:
  
--- 3051,3058 ----
  existence of a number of important extensions to the language.  While
  some of the most useful or popular extensions are supported by the GNU
  Fortran compiler, not all existing extensions are supported.  This
! section aims at listing these extensions and offering advice on how best
! make code that uses them running with the GNU Fortran compiler.
  
  * Menu:
  
*************** best make code that uses them running wi
*** 3094,3100 ****
  
  File: gfortran.info,  Node: STRUCTURE and RECORD,  Next: ENCODE and DECODE statements,  Up: Extensions not implemented in GNU Fortran
  
! 6.2.1 `STRUCTURE' and `RECORD'
  ------------------------------
  
  Record structures are a pre-Fortran-90 vendor extension to create
--- 3065,3071 ----
  
  File: gfortran.info,  Node: STRUCTURE and RECORD,  Next: ENCODE and DECODE statements,  Up: Extensions not implemented in GNU Fortran
  
! 6.2.1 'STRUCTURE' and 'RECORD'
  ------------------------------
  
  Record structures are a pre-Fortran-90 vendor extension to create
*************** structures, only Fortran 90's "derived t
*** 3103,3112 ****
  syntax.
  
     In many cases, record structures can easily be converted to derived
! types.  To convert, replace `STRUCTURE /'STRUCTURE-NAME`/' by `TYPE'
! TYPE-NAME.  Additionally, replace `RECORD /'STRUCTURE-NAME`/' by
! `TYPE('TYPE-NAME`)'. Finally, in the component access, replace the
! period (`.') by the percent sign (`%').
  
     Here is an example of code using the non portable record structure
  syntax:
--- 3074,3083 ----
  syntax.
  
     In many cases, record structures can easily be converted to derived
! types.  To convert, replace 'STRUCTURE /'STRUCTURE-NAME'/' by 'TYPE'
! TYPE-NAME.  Additionally, replace 'RECORD /'STRUCTURE-NAME'/' by
! 'TYPE('TYPE-NAME')'.  Finally, in the component access, replace the
! period ('.') by the percent sign ('%').
  
     Here is an example of code using the non portable record structure
  syntax:
*************** This code can easily be rewritten in the
*** 3164,3175 ****
  
  File: gfortran.info,  Node: ENCODE and DECODE statements,  Next: Variable FORMAT expressions,  Prev: STRUCTURE and RECORD,  Up: Extensions not implemented in GNU Fortran
  
! 6.2.2 `ENCODE' and `DECODE' statements
  --------------------------------------
  
! GNU Fortran does not support the `ENCODE' and `DECODE' statements.
! These statements are best replaced by `READ' and `WRITE' statements
! involving internal files (`CHARACTER' variables and arrays), which have
  been part of the Fortran standard since Fortran 77.  For example,
  replace a code fragment like
  
--- 3135,3146 ----
  
  File: gfortran.info,  Node: ENCODE and DECODE statements,  Next: Variable FORMAT expressions,  Prev: STRUCTURE and RECORD,  Up: Extensions not implemented in GNU Fortran
  
! 6.2.2 'ENCODE' and 'DECODE' statements
  --------------------------------------
  
! GNU Fortran does not support the 'ENCODE' and 'DECODE' statements.
! These statements are best replaced by 'READ' and 'WRITE' statements
! involving internal files ('CHARACTER' variables and arrays), which have
  been part of the Fortran standard since Fortran 77.  For example,
  replace a code fragment like
  
*************** with the following:
*** 3206,3220 ****
  
  File: gfortran.info,  Node: Variable FORMAT expressions,  Next: Alternate complex function syntax,  Prev: ENCODE and DECODE statements,  Up: Extensions not implemented in GNU Fortran
  
! 6.2.3 Variable `FORMAT' expressions
  -----------------------------------
  
! A variable `FORMAT' expression is format statement which includes angle
! brackets enclosing a Fortran expression: `FORMAT(I<N>)'.  GNU Fortran
  does not support this legacy extension.  The effect of variable format
  expressions can be reproduced by using the more powerful (and standard)
! combination of internal output and string formats.  For example,
! replace a code fragment like this:
  
             WRITE(6,20) INT1
        20   FORMAT(I<N+1>)
--- 3177,3191 ----
  
  File: gfortran.info,  Node: Variable FORMAT expressions,  Next: Alternate complex function syntax,  Prev: ENCODE and DECODE statements,  Up: Extensions not implemented in GNU Fortran
  
! 6.2.3 Variable 'FORMAT' expressions
  -----------------------------------
  
! A variable 'FORMAT' expression is format statement which includes angle
! brackets enclosing a Fortran expression: 'FORMAT(I<N>)'.  GNU Fortran
  does not support this legacy extension.  The effect of variable format
  expressions can be reproduced by using the more powerful (and standard)
! combination of internal output and string formats.  For example, replace
! a code fragment like this:
  
             WRITE(6,20) INT1
        20   FORMAT(I<N+1>)
*************** File: gfortran.info,  Node: Alternate co
*** 3245,3266 ****
  6.2.4 Alternate complex function syntax
  ---------------------------------------
  
! Some Fortran compilers, including `g77', let the user declare complex
! functions with the syntax `COMPLEX FUNCTION name*16()', as well as
! `COMPLEX*16 FUNCTION name()'.  Both are non-standard, legacy
! extensions.  `gfortran' accepts the latter form, which is more common,
! but not the former.
  
  
  File: gfortran.info,  Node: Volatile COMMON blocks,  Prev: Alternate complex function syntax,  Up: Extensions not implemented in GNU Fortran
  
! 6.2.5 Volatile `COMMON' blocks
  ------------------------------
  
! Some Fortran compilers, including `g77', let the user declare `COMMON'
! with the `VOLATILE' attribute. This is invalid standard Fortran syntax
! and is not supported by `gfortran'.  Note that `gfortran' accepts
! `VOLATILE' variables in `COMMON' blocks since revision 4.3.
  
  
  File: gfortran.info,  Node: Mixed-Language Programming,  Next: Coarray Programming,  Prev: Extensions,  Up: Top
--- 3216,3237 ----
  6.2.4 Alternate complex function syntax
  ---------------------------------------
  
! Some Fortran compilers, including 'g77', let the user declare complex
! functions with the syntax 'COMPLEX FUNCTION name*16()', as well as
! 'COMPLEX*16 FUNCTION name()'.  Both are non-standard, legacy extensions.
! 'gfortran' accepts the latter form, which is more common, but not the
! former.
  
  
  File: gfortran.info,  Node: Volatile COMMON blocks,  Prev: Alternate complex function syntax,  Up: Extensions not implemented in GNU Fortran
  
! 6.2.5 Volatile 'COMMON' blocks
  ------------------------------
  
! Some Fortran compilers, including 'g77', let the user declare 'COMMON'
! with the 'VOLATILE' attribute.  This is invalid standard Fortran syntax
! and is not supported by 'gfortran'.  Note that 'gfortran' accepts
! 'VOLATILE' variables in 'COMMON' blocks since revision 4.3.
  
  
  File: gfortran.info,  Node: Mixed-Language Programming,  Next: Coarray Programming,  Prev: Extensions,  Up: Top
*************** File: gfortran.info,  Node: Mixed-Langua
*** 3275,3284 ****
  * Non-Fortran Main Program::
  * Naming and argument-passing conventions::
  
!    This chapter is about mixed-language interoperability, but also
! applies if one links Fortran code compiled by different compilers.  In
! most cases, use of the C Binding features of the Fortran 2003 standard
! is sufficient, and their use is highly recommended.
  
  
  File: gfortran.info,  Node: Interoperability with C,  Next: GNU Fortran Compiler Directives,  Up: Mixed-Language Programming
--- 3246,3255 ----
  * Non-Fortran Main Program::
  * Naming and argument-passing conventions::
  
! This chapter is about mixed-language interoperability, but also applies
! if one links Fortran code compiled by different compilers.  In most
! cases, use of the C Binding features of the Fortran 2003 standard is
! sufficient, and their use is highly recommended.
  
  
  File: gfortran.info,  Node: Interoperability with C,  Next: GNU Fortran Compiler Directives,  Up: Mixed-Language Programming
*************** File: gfortran.info,  Node: Interoperabi
*** 3295,3315 ****
  * Working with Pointers::
  * Further Interoperability of Fortran with C::
  
!    Since Fortran 2003 (ISO/IEC 1539-1:2004(E)) there is a standardized
! way to generate procedure and derived-type declarations and global
! variables which are interoperable with C (ISO/IEC 9899:1999).  The
! `bind(C)' attribute has been added to inform the compiler that a symbol
! shall be interoperable with C; also, some constraints are added.  Note,
! however, that not all C features have a Fortran equivalent or vice
! versa.  For instance, neither C's unsigned integers nor C's functions
! with variable number of arguments have an equivalent in Fortran.
  
!    Note that array dimensions are reversely ordered in C and that
! arrays in C always start with index 0 while in Fortran they start by
! default with 1.  Thus, an array declaration `A(n,m)' in Fortran matches
! `A[m][n]' in C and accessing the element `A(i,j)' matches
! `A[j-1][i-1]'.  The element following `A(i,j)' (C: `A[j-1][i-1]';
! assuming i < n) in memory is `A(i+1,j)' (C: `A[j-1][i]').
  
  
  File: gfortran.info,  Node: Intrinsic Types,  Next: Derived Types and struct,  Up: Interoperability with C
--- 3266,3286 ----
  * Working with Pointers::
  * Further Interoperability of Fortran with C::
  
! Since Fortran 2003 (ISO/IEC 1539-1:2004(E)) there is a standardized way
! to generate procedure and derived-type declarations and global variables
! which are interoperable with C (ISO/IEC 9899:1999).  The 'bind(C)'
! attribute has been added to inform the compiler that a symbol shall be
! interoperable with C; also, some constraints are added.  Note, however,
! that not all C features have a Fortran equivalent or vice versa.  For
! instance, neither C's unsigned integers nor C's functions with variable
! number of arguments have an equivalent in Fortran.
  
!    Note that array dimensions are reversely ordered in C and that arrays
! in C always start with index 0 while in Fortran they start by default
! with 1.  Thus, an array declaration 'A(n,m)' in Fortran matches
! 'A[m][n]' in C and accessing the element 'A(i,j)' matches 'A[j-1][i-1]'.
! The element following 'A(i,j)' (C: 'A[j-1][i-1]'; assuming i < n) in
! memory is 'A(i+1,j)' (C: 'A[j-1][i]').
  
  
  File: gfortran.info,  Node: Intrinsic Types,  Next: Derived Types and struct,  Up: Interoperability with C
*************** File: gfortran.info,  Node: Intrinsic Ty
*** 3318,3337 ****
  ---------------------
  
  In order to ensure that exactly the same variable type and kind is used
! in C and Fortran, the named constants shall be used which are defined
! in the `ISO_C_BINDING' intrinsic module.  That module contains named
  constants for kind parameters and character named constants for the
! escape sequences in C.  For a list of the constants, see *note
  ISO_C_BINDING::.
  
     For logical types, please note that the Fortran standard only
! guarantees interoperability between C99's `_Bool' and Fortran's
! `C_Bool'-kind logicals and C99 defines that `true' has the value 1 and
! `false' the value 0.  Using any other integer value with GNU Fortran's
! `LOGICAL' (with any kind parameter) gives an undefined result.
! (Passing other integer values than 0 and 1 to GCC's `_Bool' is also
! undefined, unless the integer is explicitly or implicitly casted to
! `_Bool'.)
  
  
  File: gfortran.info,  Node: Derived Types and struct,  Next: Interoperable Global Variables,  Prev: Intrinsic Types,  Up: Interoperability with C
--- 3289,3307 ----
  ---------------------
  
  In order to ensure that exactly the same variable type and kind is used
! in C and Fortran, the named constants shall be used which are defined in
! the 'ISO_C_BINDING' intrinsic module.  That module contains named
  constants for kind parameters and character named constants for the
! escape sequences in C. For a list of the constants, see *note
  ISO_C_BINDING::.
  
     For logical types, please note that the Fortran standard only
! guarantees interoperability between C99's '_Bool' and Fortran's
! 'C_Bool'-kind logicals and C99 defines that 'true' has the value 1 and
! 'false' the value 0.  Using any other integer value with GNU Fortran's
! 'LOGICAL' (with any kind parameter) gives an undefined result.  (Passing
! other integer values than 0 and 1 to GCC's '_Bool' is also undefined,
! unless the integer is explicitly or implicitly casted to '_Bool'.)
  
  
  File: gfortran.info,  Node: Derived Types and struct,  Next: Interoperable Global Variables,  Prev: Intrinsic Types,  Up: Interoperability with C
*************** File: gfortran.info,  Node: Derived Type
*** 3339,3346 ****
  7.1.2 Derived Types and struct
  ------------------------------
  
! For compatibility of derived types with `struct', one needs to use the
! `BIND(C)' attribute in the type declaration.  For instance, the
  following type declaration
  
        USE ISO_C_BINDING
--- 3309,3316 ----
  7.1.2 Derived Types and struct
  ------------------------------
  
! For compatibility of derived types with 'struct', one needs to use the
! 'BIND(C)' attribute in the type declaration.  For instance, the
  following type declaration
  
        USE ISO_C_BINDING
*************** following type declaration
*** 3352,3358 ****
          CHARACTER(KIND=C_CHAR) :: str(5)
        END TYPE
  
!    matches the following `struct' declaration in C
  
        struct {
          int i1, i2;
--- 3322,3328 ----
          CHARACTER(KIND=C_CHAR) :: str(5)
        END TYPE
  
!    matches the following 'struct' declaration in C
  
        struct {
          int i1, i2;
*************** following type declaration
*** 3364,3373 ****
        } myType;
  
     Derived types with the C binding attribute shall not have the
! `sequence' attribute, type parameters, the `extends' attribute, nor
  type-bound procedures.  Every component must be of interoperable type
! and kind and may not have the `pointer' or `allocatable' attribute.
! The names of the components are irrelevant for interoperability.
  
     As there exist no direct Fortran equivalents, neither unions nor
  structs with bit field or variable-length array members are
--- 3334,3343 ----
        } myType;
  
     Derived types with the C binding attribute shall not have the
! 'sequence' attribute, type parameters, the 'extends' attribute, nor
  type-bound procedures.  Every component must be of interoperable type
! and kind and may not have the 'pointer' or 'allocatable' attribute.  The
! names of the components are irrelevant for interoperability.
  
     As there exist no direct Fortran equivalents, neither unions nor
  structs with bit field or variable-length array members are
*************** File: gfortran.info,  Node: Interoperabl
*** 3381,3389 ****
  
  Variables can be made accessible from C using the C binding attribute,
  optionally together with specifying a binding name.  Those variables
! have to be declared in the declaration part of a `MODULE', be of
! interoperable type, and have neither the `pointer' nor the
! `allocatable' attribute.
  
         MODULE m
           USE myType_module
--- 3351,3359 ----
  
  Variables can be made accessible from C using the C binding attribute,
  optionally together with specifying a binding name.  Those variables
! have to be declared in the declaration part of a 'MODULE', be of
! interoperable type, and have neither the 'pointer' nor the 'allocatable'
! attribute.
  
         MODULE m
           USE myType_module
*************** interoperable type, and have neither the
*** 3392,3405 ****
           type(myType), bind(C) :: tp
         END MODULE
  
!    Here, `_MyProject_flags' is the case-sensitive name of the variable
! as seen from C programs while `global_flag' is the case-insensitive
! name as seen from Fortran.  If no binding name is specified, as for TP,
! the C binding name is the (lowercase) Fortran binding name.  If a
! binding name is specified, only a single variable may be after the
! double colon.  Note of warning: You cannot use a global variable to
! access ERRNO of the C library as the C standard allows it to be a
! macro.  Use the `IERRNO' intrinsic (GNU extension) instead.
  
  
  File: gfortran.info,  Node: Interoperable Subroutines and Functions,  Next: Working with Pointers,  Prev: Interoperable Global Variables,  Up: Interoperability with C
--- 3362,3375 ----
           type(myType), bind(C) :: tp
         END MODULE
  
!    Here, '_MyProject_flags' is the case-sensitive name of the variable
! as seen from C programs while 'global_flag' is the case-insensitive name
! as seen from Fortran.  If no binding name is specified, as for TP, the C
! binding name is the (lowercase) Fortran binding name.  If a binding name
! is specified, only a single variable may be after the double colon.
! Note of warning: You cannot use a global variable to access ERRNO of the
! C library as the C standard allows it to be a macro.  Use the 'IERRNO'
! intrinsic (GNU extension) instead.
  
  
  File: gfortran.info,  Node: Interoperable Subroutines and Functions,  Next: Working with Pointers,  Prev: Interoperable Global Variables,  Up: Interoperability with C
*************** File: gfortran.info,  Node: Interoperabl
*** 3407,3427 ****
  7.1.4 Interoperable Subroutines and Functions
  ---------------------------------------------
  
! Subroutines and functions have to have the `BIND(C)' attribute to be
! compatible with C.  The dummy argument declaration is relatively
  straightforward.  However, one needs to be careful because C uses
  call-by-value by default while Fortran behaves usually similar to
  call-by-reference.  Furthermore, strings and pointers are handled
  differently.  Note that in Fortran 2003 and 2008 only explicit size and
  assumed-size arrays are supported but not assumed-shape or
! deferred-shape (i.e. allocatable or pointer) arrays.  However, those
  are allowed since the Technical Specification 29113, see *note Further
  Interoperability of Fortran with C::
  
!    To pass a variable by value, use the `VALUE' attribute.  Thus, the
  following C prototype
  
!      `int func(int i, int *j)'
  
     matches the Fortran declaration
  
--- 3377,3397 ----
  7.1.4 Interoperable Subroutines and Functions
  ---------------------------------------------
  
! Subroutines and functions have to have the 'BIND(C)' attribute to be
! compatible with C. The dummy argument declaration is relatively
  straightforward.  However, one needs to be careful because C uses
  call-by-value by default while Fortran behaves usually similar to
  call-by-reference.  Furthermore, strings and pointers are handled
  differently.  Note that in Fortran 2003 and 2008 only explicit size and
  assumed-size arrays are supported but not assumed-shape or
! deferred-shape (i.e.  allocatable or pointer) arrays.  However, those
  are allowed since the Technical Specification 29113, see *note Further
  Interoperability of Fortran with C::
  
!    To pass a variable by value, use the 'VALUE' attribute.  Thus, the
  following C prototype
  
!      int func(int i, int *j)
  
     matches the Fortran declaration
  
*************** following C prototype
*** 3430,3442 ****
           integer(c_int), VALUE :: i
           integer(c_int) :: j
  
!    Note that pointer arguments also frequently need the `VALUE'
  attribute, see *note Working with Pointers::.
  
     Strings are handled quite differently in C and Fortran.  In C a
! string is a `NUL'-terminated array of characters while in Fortran each
  string has a length associated with it and is thus not terminated (by
! e.g.  `NUL').  For example, if one wants to use the following C
  function,
  
         #include <stdio.h>
--- 3400,3412 ----
           integer(c_int), VALUE :: i
           integer(c_int) :: j
  
!    Note that pointer arguments also frequently need the 'VALUE'
  attribute, see *note Working with Pointers::.
  
     Strings are handled quite differently in C and Fortran.  In C a
! string is a 'NUL'-terminated array of characters while in Fortran each
  string has a length associated with it and is thus not terminated (by
! e.g.  'NUL').  For example, if one wants to use the following C
  function,
  
         #include <stdio.h>
*************** function,
*** 3456,3475 ****
         end interface
         call print_c(C_CHAR_"Hello World"//C_NULL_CHAR)
  
!    As the example shows, one needs to ensure that the string is `NUL'
! terminated.  Additionally, the dummy argument STRING of `print_C' is a
! length-one assumed-size array; using `character(len=*)' is not allowed.
! The example above uses `c_char_"Hello World"' to ensure the string
  literal has the right type; typically the default character kind and
! `c_char' are the same and thus `"Hello World"' is equivalent.  However,
  the standard does not guarantee this.
  
     The use of strings is now further illustrated using the C library
! function `strncpy', whose prototype is
  
         char *strncpy(char *restrict s1, const char *restrict s2, size_t n);
  
!    The function `strncpy' copies at most N characters from string S2 to
  S1 and returns S1.  In the following example, we ignore the return
  value:
  
--- 3426,3445 ----
         end interface
         call print_c(C_CHAR_"Hello World"//C_NULL_CHAR)
  
!    As the example shows, one needs to ensure that the string is 'NUL'
! terminated.  Additionally, the dummy argument STRING of 'print_C' is a
! length-one assumed-size array; using 'character(len=*)' is not allowed.
! The example above uses 'c_char_"Hello World"' to ensure the string
  literal has the right type; typically the default character kind and
! 'c_char' are the same and thus '"Hello World"' is equivalent.  However,
  the standard does not guarantee this.
  
     The use of strings is now further illustrated using the C library
! function 'strncpy', whose prototype is
  
         char *strncpy(char *restrict s1, const char *restrict s2, size_t n);
  
!    The function 'strncpy' copies at most N characters from string S2 to
  S1 and returns S1.  In the following example, we ignore the return
  value:
  
*************** File: gfortran.info,  Node: Working with
*** 3502,3511 ****
  ---------------------------
  
  C pointers are represented in Fortran via the special opaque derived
! type `type(c_ptr)' (with private components).  Thus one needs to use
  intrinsic conversion procedures to convert from or to C pointers.
  
!    For some applications, using an assumed type (`TYPE(*)') can be an
  alternative to a C pointer; see *note Further Interoperability of
  Fortran with C::.
  
--- 3472,3481 ----
  ---------------------------
  
  C pointers are represented in Fortran via the special opaque derived
! type 'type(c_ptr)' (with private components).  Thus one needs to use
  intrinsic conversion procedures to convert from or to C pointers.
  
!    For some applications, using an assumed type ('TYPE(*)') can be an
  alternative to a C pointer; see *note Further Interoperability of
  Fortran with C::.
  
*************** Fortran with C::.
*** 3522,3543 ****
         call c_f_pointer(cptr2, ps)
         call c_f_pointer(cptr2, pa, shape=[7])
  
!    When converting C to Fortran arrays, the one-dimensional `SHAPE'
  argument has to be passed.
  
     If a pointer is a dummy-argument of an interoperable procedure, it
! usually has to be declared using the `VALUE' attribute.  `void*'
! matches `TYPE(C_PTR), VALUE', while `TYPE(C_PTR)' alone matches
! `void**'.
  
     Procedure pointers are handled analogously to pointers; the C type is
! `TYPE(C_FUNPTR)' and the intrinsic conversion procedures are
! `C_F_PROCPOINTER' and `C_FUNLOC'.
  
     Let us consider two examples of actually passing a procedure pointer
  from C to Fortran and vice versa.  Note that these examples are also
! very similar to passing ordinary pointers between both languages. First,
! consider this code in C:
  
       /* Procedure implemented in Fortran.  */
       void get_values (void (*)(double));
--- 3492,3512 ----
         call c_f_pointer(cptr2, ps)
         call c_f_pointer(cptr2, pa, shape=[7])
  
!    When converting C to Fortran arrays, the one-dimensional 'SHAPE'
  argument has to be passed.
  
     If a pointer is a dummy-argument of an interoperable procedure, it
! usually has to be declared using the 'VALUE' attribute.  'void*' matches
! 'TYPE(C_PTR), VALUE', while 'TYPE(C_PTR)' alone matches 'void**'.
  
     Procedure pointers are handled analogously to pointers; the C type is
! 'TYPE(C_FUNPTR)' and the intrinsic conversion procedures are
! 'C_F_PROCPOINTER' and 'C_FUNLOC'.
  
     Let us consider two examples of actually passing a procedure pointer
  from C to Fortran and vice versa.  Note that these examples are also
! very similar to passing ordinary pointers between both languages.
! First, consider this code in C:
  
       /* Procedure implemented in Fortran.  */
       void get_values (void (*)(double));
*************** consider this code in C:
*** 3556,3564 ****
         get_values (&print_it);
       }
  
!    A matching implementation for `get_values' in Fortran, that correctly
  receives the procedure pointer from C and is able to call it, is given
! in the following `MODULE':
  
       MODULE m
         IMPLICIT NONE
--- 3525,3533 ----
         get_values (&print_it);
       }
  
!    A matching implementation for 'get_values' in Fortran, that correctly
  receives the procedure pointer from C and is able to call it, is given
! in the following 'MODULE':
  
       MODULE m
         IMPLICIT NONE
*************** File: gfortran.info,  Node: Further Inte
*** 3649,3714 ****
  
  The Technical Specification ISO/IEC TS 29113:2012 on further
  interoperability of Fortran with C extends the interoperability support
! of Fortran 2003 and Fortran 2008. Besides removing some restrictions
! and constraints, it adds assumed-type (`TYPE(*)') and assumed-rank
! (`dimension') variables and allows for interoperability of
  assumed-shape, assumed-rank and deferred-shape arrays, including
  allocatables and pointers.
  
     Note: Currently, GNU Fortran does not support the array descriptor
  (dope vector) as specified in the Technical Specification, but uses an
! array descriptor with different fields. The Chasm Language
! Interoperability Tools, `http://chasm-interop.sourceforge.net/',
! provide an interface to GNU Fortran's array descriptor.
  
     The Technical Specification adds the following new features, which
  are supported by GNU Fortran:
  
!    * The `ASYNCHRONOUS' attribute has been clarified and extended to
       allow its use with asynchronous communication in user-provided
       libraries such as in implementations of the Message Passing
       Interface specification.
  
!    * Many constraints have been relaxed, in particular for the `C_LOC'
!      and `C_F_POINTER' intrinsics.
  
!    * The `OPTIONAL' attribute is now allowed for dummy arguments; an
!      absent argument matches a `NULL' pointer.
  
!    * Assumed types (`TYPE(*)') have been added, which may only be used
       for dummy arguments.  They are unlimited polymorphic but contrary
!      to `CLASS(*)' they do not contain any type information, similar to
!      C's `void *' pointers.  Expressions of any type and kind can be
!      passed; thus, it can be used as replacement for `TYPE(C_PTR)',
!      avoiding the use of `C_LOC' in the caller.
  
!      Note, however, that `TYPE(*)' only accepts scalar arguments,
!      unless the `DIMENSION' is explicitly specified.  As `DIMENSION(*)'
!      only supports array (including array elements) but no scalars, it
!      is not a full replacement for `C_LOC'.  On the other hand,
!      assumed-type assumed-rank dummy arguments (`TYPE(*),
!      DIMENSION(..)') allow for both scalars and arrays, but require
!      special code on the callee side to handle the array descriptor.
  
!    * Assumed-rank arrays (`DIMENSION(..)') as dummy argument allow that
       scalars and arrays of any rank can be passed as actual argument.
!      As the Technical Specification does not provide for direct means
!      to operate with them, they have to be used either from the C side
!      or be converted using `C_LOC' and `C_F_POINTER' to scalars or
!      arrays of a specific rank. The rank can be determined using the
!      `RANK' intrinisic.
  
     Currently unimplemented:
  
     * GNU Fortran always uses an array descriptor, which does not match
!      the one of the Technical Specification. The
!      `ISO_Fortran_binding.h' header file and the C functions it
       specifies are not available.
  
     * Using assumed-shape, assumed-rank and deferred-shape arrays in
!      `BIND(C)' procedures is not fully supported. In particular, C
!      interoperable strings of other length than one are not supported
!      as this requires the new array descriptor.
  
  
  File: gfortran.info,  Node: GNU Fortran Compiler Directives,  Next: Non-Fortran Main Program,  Prev: Interoperability with C,  Up: Mixed-Language Programming
--- 3618,3683 ----
  
  The Technical Specification ISO/IEC TS 29113:2012 on further
  interoperability of Fortran with C extends the interoperability support
! of Fortran 2003 and Fortran 2008.  Besides removing some restrictions
! and constraints, it adds assumed-type ('TYPE(*)') and assumed-rank
! ('dimension') variables and allows for interoperability of
  assumed-shape, assumed-rank and deferred-shape arrays, including
  allocatables and pointers.
  
     Note: Currently, GNU Fortran does not support the array descriptor
  (dope vector) as specified in the Technical Specification, but uses an
! array descriptor with different fields.  The Chasm Language
! Interoperability Tools, <http://chasm-interop.sourceforge.net/>, provide
! an interface to GNU Fortran's array descriptor.
  
     The Technical Specification adds the following new features, which
  are supported by GNU Fortran:
  
!    * The 'ASYNCHRONOUS' attribute has been clarified and extended to
       allow its use with asynchronous communication in user-provided
       libraries such as in implementations of the Message Passing
       Interface specification.
  
!    * Many constraints have been relaxed, in particular for the 'C_LOC'
!      and 'C_F_POINTER' intrinsics.
  
!    * The 'OPTIONAL' attribute is now allowed for dummy arguments; an
!      absent argument matches a 'NULL' pointer.
  
!    * Assumed types ('TYPE(*)') have been added, which may only be used
       for dummy arguments.  They are unlimited polymorphic but contrary
!      to 'CLASS(*)' they do not contain any type information, similar to
!      C's 'void *' pointers.  Expressions of any type and kind can be
!      passed; thus, it can be used as replacement for 'TYPE(C_PTR)',
!      avoiding the use of 'C_LOC' in the caller.
  
!      Note, however, that 'TYPE(*)' only accepts scalar arguments, unless
!      the 'DIMENSION' is explicitly specified.  As 'DIMENSION(*)' only
!      supports array (including array elements) but no scalars, it is not
!      a full replacement for 'C_LOC'.  On the other hand, assumed-type
!      assumed-rank dummy arguments ('TYPE(*), DIMENSION(..)') allow for
!      both scalars and arrays, but require special code on the callee
!      side to handle the array descriptor.
  
!    * Assumed-rank arrays ('DIMENSION(..)') as dummy argument allow that
       scalars and arrays of any rank can be passed as actual argument.
!      As the Technical Specification does not provide for direct means to
!      operate with them, they have to be used either from the C side or
!      be converted using 'C_LOC' and 'C_F_POINTER' to scalars or arrays
!      of a specific rank.  The rank can be determined using the 'RANK'
!      intrinisic.
  
     Currently unimplemented:
  
     * GNU Fortran always uses an array descriptor, which does not match
!      the one of the Technical Specification.  The
!      'ISO_Fortran_binding.h' header file and the C functions it
       specifies are not available.
  
     * Using assumed-shape, assumed-rank and deferred-shape arrays in
!      'BIND(C)' procedures is not fully supported.  In particular, C
!      interoperable strings of other length than one are not supported as
!      this requires the new array descriptor.
  
  
  File: gfortran.info,  Node: GNU Fortran Compiler Directives,  Next: Non-Fortran Main Program,  Prev: Interoperability with C,  Up: Mixed-Language Programming
*************** allow the user to choose specific implem
*** 3722,3738 ****
  directives can be used to set attributes of variables and procedures
  which are not part of the standard.  Whether a given attribute is
  supported and its exact effects depend on both the operating system and
! on the processor; see *note C Extensions: (gcc)Top.  for details.
  
     For procedures and procedure pointers, the following attributes can
  be used to change the calling convention:
  
!    * `CDECL' - standard C calling convention
! 
!    * `STDCALL' - convention where the called procedure pops the stack
! 
!    * `FASTCALL' - part of the arguments are passed via registers
!      instead using the stack
  
     Besides changing the calling convention, the attributes also
  influence the decoration of the symbol name, e.g., by a leading
--- 3691,3705 ----
  directives can be used to set attributes of variables and procedures
  which are not part of the standard.  Whether a given attribute is
  supported and its exact effects depend on both the operating system and
! on the processor; see *note C Extensions: (gcc)Top. for details.
  
     For procedures and procedure pointers, the following attributes can
  be used to change the calling convention:
  
!    * 'CDECL' - standard C calling convention
!    * 'STDCALL' - convention where the called procedure pops the stack
!    * 'FASTCALL' - part of the arguments are passed via registers instead
!      using the stack
  
     Besides changing the calling convention, the attributes also
  influence the decoration of the symbol name, e.g., by a leading
*************** the stack.  When assigning a procedure t
*** 3741,3779 ****
  should use the same calling convention.
  
     On some systems, procedures and global variables (module variables
! and `COMMON' blocks) need special handling to be accessible when they
  are in a shared library.  The following attributes are available:
  
!    * `DLLEXPORT' - provide a global pointer to a pointer in the DLL
! 
!    * `DLLIMPORT' - reference the function or variable using a global
       pointer
  
!    For dummy arguments, the `NO_ARG_CHECK' attribute can be used; in
! other compilers, it is also known as `IGNORE_TKR'.  For dummy arguments
  with this attribute actual arguments of any type and kind (similar to
! `TYPE(*)'), scalars and arrays of any rank (no equivalent in Fortran
! standard) are accepted.  As with `TYPE(*)', the argument is unlimited
  polymorphic and no type information is available.  Additionally, the
! argument may only be passed to dummy arguments with the `NO_ARG_CHECK'
! attribute and as argument to the `PRESENT' intrinsic function and to
! `C_LOC' of the `ISO_C_BINDING' module.
  
!    Variables with `NO_ARG_CHECK' attribute shall be of assumed-type
! (`TYPE(*)'; recommended) or of type `INTEGER', `LOGICAL', `REAL' or
! `COMPLEX'. They shall not have the `ALLOCATE', `CODIMENSION',
! `INTENT(OUT)', `POINTER' or `VALUE' attribute; furthermore, they shall
! be either scalar or of assumed-size (`dimension(*)'). As `TYPE(*)', the
! `NO_ARG_CHECK' attribute requires an explicit interface.
  
!    * `NO_ARG_CHECK' - disable the type, kind and rank checking
  
     The attributes are specified using the syntax
  
!    `!GCC$ ATTRIBUTES' ATTRIBUTE-LIST `::' VARIABLE-LIST
  
     where in free-form source code only whitespace is allowed before
! `!GCC$' and in fixed-form source code `!GCC$', `cGCC$' or `*GCC$' shall
  start in the first column.
  
     For procedures, the compiler directives shall be placed into the body
--- 3708,3745 ----
  should use the same calling convention.
  
     On some systems, procedures and global variables (module variables
! and 'COMMON' blocks) need special handling to be accessible when they
  are in a shared library.  The following attributes are available:
  
!    * 'DLLEXPORT' - provide a global pointer to a pointer in the DLL
!    * 'DLLIMPORT' - reference the function or variable using a global
       pointer
  
!    For dummy arguments, the 'NO_ARG_CHECK' attribute can be used; in
! other compilers, it is also known as 'IGNORE_TKR'.  For dummy arguments
  with this attribute actual arguments of any type and kind (similar to
! 'TYPE(*)'), scalars and arrays of any rank (no equivalent in Fortran
! standard) are accepted.  As with 'TYPE(*)', the argument is unlimited
  polymorphic and no type information is available.  Additionally, the
! argument may only be passed to dummy arguments with the 'NO_ARG_CHECK'
! attribute and as argument to the 'PRESENT' intrinsic function and to
! 'C_LOC' of the 'ISO_C_BINDING' module.
  
!    Variables with 'NO_ARG_CHECK' attribute shall be of assumed-type
! ('TYPE(*)'; recommended) or of type 'INTEGER', 'LOGICAL', 'REAL' or
! 'COMPLEX'.  They shall not have the 'ALLOCATE', 'CODIMENSION',
! 'INTENT(OUT)', 'POINTER' or 'VALUE' attribute; furthermore, they shall
! be either scalar or of assumed-size ('dimension(*)').  As 'TYPE(*)', the
! 'NO_ARG_CHECK' attribute requires an explicit interface.
  
!    * 'NO_ARG_CHECK' - disable the type, kind and rank checking
  
     The attributes are specified using the syntax
  
!    '!GCC$ ATTRIBUTES' ATTRIBUTE-LIST '::' VARIABLE-LIST
  
     where in free-form source code only whitespace is allowed before
! '!GCC$' and in fixed-form source code '!GCC$', 'cGCC$' or '*GCC$' shall
  start in the first column.
  
     For procedures, the compiler directives shall be placed into the body
*************** File: gfortran.info,  Node: Non-Fortran
*** 3795,3825 ****
  * _gfortran_set_fpe:: Set when a Floating Point Exception should be raised
  * _gfortran_set_max_subrecord_length:: Set subrecord length
  
!    Even if you are doing mixed-language programming, it is very likely
! that you do not need to know or use the information in this section.
! Since it is about the internal structure of GNU Fortran, it may also
! change in GCC minor releases.
  
!    When you compile a `PROGRAM' with GNU Fortran, a function with the
! name `main' (in the symbol table of the object file) is generated,
! which initializes the libgfortran library and then calls the actual
! program which uses the name `MAIN__', for historic reasons.  If you
! link GNU Fortran compiled procedures to, e.g., a C or C++ program or to
! a Fortran program compiled by a different compiler, the libgfortran
! library is not initialized and thus a few intrinsic procedures do not
! work properly, e.g.  those for obtaining the command-line arguments.
  
!    Therefore, if your `PROGRAM' is not compiled with GNU Fortran and
! the GNU Fortran compiled procedures require intrinsics relying on the
  library initialization, you need to initialize the library yourself.
! Using the default options, gfortran calls `_gfortran_set_args' and
! `_gfortran_set_options'.  The initialization of the former is needed if
! the called procedures access the command line (and for backtracing);
! the latter sets some flags based on the standard chosen or to enable
  backtracing.  In typical programs, it is not necessary to call any
  initialization function.
  
!    If your `PROGRAM' is compiled with GNU Fortran, you shall not call
  any of the following functions.  The libgfortran initialization
  functions are shown in C syntax but using C bindings they are also
  accessible from Fortran.
--- 3761,3791 ----
  * _gfortran_set_fpe:: Set when a Floating Point Exception should be raised
  * _gfortran_set_max_subrecord_length:: Set subrecord length
  
! Even if you are doing mixed-language programming, it is very likely that
! you do not need to know or use the information in this section.  Since
! it is about the internal structure of GNU Fortran, it may also change in
! GCC minor releases.
  
!    When you compile a 'PROGRAM' with GNU Fortran, a function with the
! name 'main' (in the symbol table of the object file) is generated, which
! initializes the libgfortran library and then calls the actual program
! which uses the name 'MAIN__', for historic reasons.  If you link GNU
! Fortran compiled procedures to, e.g., a C or C++ program or to a Fortran
! program compiled by a different compiler, the libgfortran library is not
! initialized and thus a few intrinsic procedures do not work properly,
! e.g.  those for obtaining the command-line arguments.
  
!    Therefore, if your 'PROGRAM' is not compiled with GNU Fortran and the
! GNU Fortran compiled procedures require intrinsics relying on the
  library initialization, you need to initialize the library yourself.
! Using the default options, gfortran calls '_gfortran_set_args' and
! '_gfortran_set_options'.  The initialization of the former is needed if
! the called procedures access the command line (and for backtracing); the
! latter sets some flags based on the standard chosen or to enable
  backtracing.  In typical programs, it is not necessary to call any
  initialization function.
  
!    If your 'PROGRAM' is compiled with GNU Fortran, you shall not call
  any of the following functions.  The libgfortran initialization
  functions are shown in C syntax but using C bindings they are also
  accessible from Fortran.
*************** accessible from Fortran.
*** 3827,3848 ****
  
  File: gfortran.info,  Node: _gfortran_set_args,  Next: _gfortran_set_options,  Up: Non-Fortran Main Program
  
! 7.3.1 `_gfortran_set_args' -- Save command-line arguments
  ---------------------------------------------------------
  
  _Description_:
!      `_gfortran_set_args' saves the command-line arguments; this
!      initialization is required if any of the command-line intrinsics
!      is called.  Additionally, it shall be called if backtracing is
!      enabled (see `_gfortran_set_options').
  
  _Syntax_:
!      `void _gfortran_set_args (int argc, char *argv[])'
  
  _Arguments_:
!      ARGC       number of command line argument strings
!      ARGV       the command-line argument strings; argv[0] is
!                 the pathname of the executable itself.
  
  _Example_:
            int main (int argc, char *argv[])
--- 3793,3814 ----
  
  File: gfortran.info,  Node: _gfortran_set_args,  Next: _gfortran_set_options,  Up: Non-Fortran Main Program
  
! 7.3.1 '_gfortran_set_args' -- Save command-line arguments
  ---------------------------------------------------------
  
  _Description_:
!      '_gfortran_set_args' saves the command-line arguments; this
!      initialization is required if any of the command-line intrinsics is
!      called.  Additionally, it shall be called if backtracing is enabled
!      (see '_gfortran_set_options').
  
  _Syntax_:
!      'void _gfortran_set_args (int argc, char *argv[])'
  
  _Arguments_:
!      ARGC        number of command line argument strings
!      ARGV        the command-line argument strings; argv[0] is
!                  the pathname of the executable itself.
  
  _Example_:
            int main (int argc, char *argv[])
*************** _Example_:
*** 3855,3923 ****
  
  File: gfortran.info,  Node: _gfortran_set_options,  Next: _gfortran_set_convert,  Prev: _gfortran_set_args,  Up: Non-Fortran Main Program
  
! 7.3.2 `_gfortran_set_options' -- Set library option flags
  ---------------------------------------------------------
  
  _Description_:
!      `_gfortran_set_options' sets several flags related to the Fortran
       standard to be used, whether backtracing should be enabled and
       whether range checks should be performed.  The syntax allows for
!      upward compatibility since the number of passed flags is
!      specified; for non-passed flags, the default value is used.  See
!      also *note Code Gen Options::.  Please note that not all flags are
!      actually used.
  
  _Syntax_:
!      `void _gfortran_set_options (int num, int options[])'
  
  _Arguments_:
!      NUM        number of options passed
!      ARGV       The list of flag values
  
  _option flag list_:
!      OPTION[0]  Allowed standard; can give run-time errors if
!                 e.g. an input-output edit descriptor is
!                 invalid in a given standard.  Possible values
!                 are (bitwise or-ed) `GFC_STD_F77' (1),
!                 `GFC_STD_F95_OBS' (2), `GFC_STD_F95_DEL' (4),
!                 `GFC_STD_F95' (8), `GFC_STD_F2003' (16),
!                 `GFC_STD_GNU' (32), `GFC_STD_LEGACY' (64),
!                 `GFC_STD_F2008' (128), `GFC_STD_F2008_OBS'
!                 (256) and GFC_STD_F2008_TS (512). Default:
!                 `GFC_STD_F95_OBS | GFC_STD_F95_DEL |
!                 GFC_STD_F95 | GFC_STD_F2003 | GFC_STD_F2008 |
!                 GFC_STD_F2008_TS | GFC_STD_F2008_OBS |
!                 GFC_STD_F77 | GFC_STD_GNU | GFC_STD_LEGACY'.
!      OPTION[1]  Standard-warning flag; prints a warning to
!                 standard error.  Default: `GFC_STD_F95_DEL |
!                 GFC_STD_LEGACY'.
!      OPTION[2]  If non zero, enable pedantic checking.
!                 Default: off.
!      OPTION[3]  Unused.
!      OPTION[4]  If non zero, enable backtracing on run-time
!                 errors.  Default: off. (Default in the
!                 compiler: on.)  Note: Installs a signal
!                 handler and requires command-line
!                 initialization using `_gfortran_set_args'.
!      OPTION[5]  If non zero, supports signed zeros.  Default:
!                 enabled.
!      OPTION[6]  Enables run-time checking.  Possible values
!                 are (bitwise or-ed): GFC_RTCHECK_BOUNDS (1),
!                 GFC_RTCHECK_ARRAY_TEMPS (2),
!                 GFC_RTCHECK_RECURSION (4), GFC_RTCHECK_DO
!                 (16), GFC_RTCHECK_POINTER (32).  Default:
!                 disabled.
!      OPTION[7]  Unused.
!      OPTION[8]  Show a warning when invoking `STOP' and `ERROR
!                 STOP' if a floating-point exception occurred.
!                 Possible values are (bitwise or-ed)
!                 `GFC_FPE_INVALID' (1), `GFC_FPE_DENORMAL' (2),
!                 `GFC_FPE_ZERO' (4), `GFC_FPE_OVERFLOW' (8),
!                 `GFC_FPE_UNDERFLOW' (16), `GFC_FPE_INEXACT'
!                 (32). Default: None (0).  (Default in the
!                 compiler: `GFC_FPE_INVALID | GFC_FPE_DENORMAL |
!                 GFC_FPE_ZERO | GFC_FPE_OVERFLOW |
!                 GFC_FPE_UNDERFLOW'.)
  
  _Example_:
              /* Use gfortran 4.9 default options.  */
--- 3821,3888 ----
  
  File: gfortran.info,  Node: _gfortran_set_options,  Next: _gfortran_set_convert,  Prev: _gfortran_set_args,  Up: Non-Fortran Main Program
  
! 7.3.2 '_gfortran_set_options' -- Set library option flags
  ---------------------------------------------------------
  
  _Description_:
!      '_gfortran_set_options' sets several flags related to the Fortran
       standard to be used, whether backtracing should be enabled and
       whether range checks should be performed.  The syntax allows for
!      upward compatibility since the number of passed flags is specified;
!      for non-passed flags, the default value is used.  See also *note
!      Code Gen Options::.  Please note that not all flags are actually
!      used.
  
  _Syntax_:
!      'void _gfortran_set_options (int num, int options[])'
  
  _Arguments_:
!      NUM         number of options passed
!      ARGV        The list of flag values
  
  _option flag list_:
!      OPTION[0]   Allowed standard; can give run-time errors if
!                  e.g.  an input-output edit descriptor is invalid
!                  in a given standard.  Possible values are
!                  (bitwise or-ed) 'GFC_STD_F77' (1),
!                  'GFC_STD_F95_OBS' (2), 'GFC_STD_F95_DEL' (4),
!                  'GFC_STD_F95' (8), 'GFC_STD_F2003' (16),
!                  'GFC_STD_GNU' (32), 'GFC_STD_LEGACY' (64),
!                  'GFC_STD_F2008' (128), 'GFC_STD_F2008_OBS' (256)
!                  and GFC_STD_F2008_TS (512).  Default:
!                  'GFC_STD_F95_OBS | GFC_STD_F95_DEL | GFC_STD_F95
!                  | GFC_STD_F2003 | GFC_STD_F2008 |
!                  GFC_STD_F2008_TS | GFC_STD_F2008_OBS |
!                  GFC_STD_F77 | GFC_STD_GNU | GFC_STD_LEGACY'.
!      OPTION[1]   Standard-warning flag; prints a warning to
!                  standard error.  Default: 'GFC_STD_F95_DEL |
!                  GFC_STD_LEGACY'.
!      OPTION[2]   If non zero, enable pedantic checking.  Default:
!                  off.
!      OPTION[3]   Unused.
!      OPTION[4]   If non zero, enable backtracing on run-time
!                  errors.  Default: off.  (Default in the
!                  compiler: on.)  Note: Installs a signal handler
!                  and requires command-line initialization using
!                  '_gfortran_set_args'.
!      OPTION[5]   If non zero, supports signed zeros.  Default:
!                  enabled.
!      OPTION[6]   Enables run-time checking.  Possible values are
!                  (bitwise or-ed): GFC_RTCHECK_BOUNDS (1),
!                  GFC_RTCHECK_ARRAY_TEMPS (2),
!                  GFC_RTCHECK_RECURSION (4), GFC_RTCHECK_DO (16),
!                  GFC_RTCHECK_POINTER (32).  Default: disabled.
!      OPTION[7]   Unused.
!      OPTION[8]   Show a warning when invoking 'STOP' and 'ERROR
!                  STOP' if a floating-point exception occurred.
!                  Possible values are (bitwise or-ed)
!                  'GFC_FPE_INVALID' (1), 'GFC_FPE_DENORMAL' (2),
!                  'GFC_FPE_ZERO' (4), 'GFC_FPE_OVERFLOW' (8),
!                  'GFC_FPE_UNDERFLOW' (16), 'GFC_FPE_INEXACT'
!                  (32).  Default: None (0).  (Default in the
!                  compiler: 'GFC_FPE_INVALID | GFC_FPE_DENORMAL |
!                  GFC_FPE_ZERO | GFC_FPE_OVERFLOW |
!                  GFC_FPE_UNDERFLOW'.)
  
  _Example_:
              /* Use gfortran 4.9 default options.  */
*************** _Example_:
*** 3927,3947 ****
  
  File: gfortran.info,  Node: _gfortran_set_convert,  Next: _gfortran_set_record_marker,  Prev: _gfortran_set_options,  Up: Non-Fortran Main Program
  
! 7.3.3 `_gfortran_set_convert' -- Set endian conversion
  ------------------------------------------------------
  
  _Description_:
!      `_gfortran_set_convert' set the representation of data for
       unformatted files.
  
  _Syntax_:
!      `void _gfortran_set_convert (int conv)'
  
  _Arguments_:
!      CONV       Endian conversion, possible values:
!                 GFC_CONVERT_NATIVE (0, default),
!                 GFC_CONVERT_SWAP (1), GFC_CONVERT_BIG (2),
!                 GFC_CONVERT_LITTLE (3).
  
  _Example_:
            int main (int argc, char *argv[])
--- 3892,3912 ----
  
  File: gfortran.info,  Node: _gfortran_set_convert,  Next: _gfortran_set_record_marker,  Prev: _gfortran_set_options,  Up: Non-Fortran Main Program
  
! 7.3.3 '_gfortran_set_convert' -- Set endian conversion
  ------------------------------------------------------
  
  _Description_:
!      '_gfortran_set_convert' set the representation of data for
       unformatted files.
  
  _Syntax_:
!      'void _gfortran_set_convert (int conv)'
  
  _Arguments_:
!      CONV        Endian conversion, possible values:
!                  GFC_CONVERT_NATIVE (0, default),
!                  GFC_CONVERT_SWAP (1), GFC_CONVERT_BIG (2),
!                  GFC_CONVERT_LITTLE (3).
  
  _Example_:
            int main (int argc, char *argv[])
*************** _Example_:
*** 3955,3973 ****
  
  File: gfortran.info,  Node: _gfortran_set_record_marker,  Next: _gfortran_set_fpe,  Prev: _gfortran_set_convert,  Up: Non-Fortran Main Program
  
! 7.3.4 `_gfortran_set_record_marker' -- Set length of record markers
  -------------------------------------------------------------------
  
  _Description_:
!      `_gfortran_set_record_marker' sets the length of record markers
!      for unformatted files.
  
  _Syntax_:
!      `void _gfortran_set_record_marker (int val)'
  
  _Arguments_:
!      VAL        Length of the record marker; valid values are
!                 4 and 8.  Default is 4.
  
  _Example_:
            int main (int argc, char *argv[])
--- 3920,3938 ----
  
  File: gfortran.info,  Node: _gfortran_set_record_marker,  Next: _gfortran_set_fpe,  Prev: _gfortran_set_convert,  Up: Non-Fortran Main Program
  
! 7.3.4 '_gfortran_set_record_marker' -- Set length of record markers
  -------------------------------------------------------------------
  
  _Description_:
!      '_gfortran_set_record_marker' sets the length of record markers for
!      unformatted files.
  
  _Syntax_:
!      'void _gfortran_set_record_marker (int val)'
  
  _Arguments_:
!      VAL         Length of the record marker; valid values are 4
!                  and 8.  Default is 4.
  
  _Example_:
            int main (int argc, char *argv[])
*************** _Example_:
*** 3981,4004 ****
  
  File: gfortran.info,  Node: _gfortran_set_fpe,  Next: _gfortran_set_max_subrecord_length,  Prev: _gfortran_set_record_marker,  Up: Non-Fortran Main Program
  
! 7.3.5 `_gfortran_set_fpe' -- Enable floating point exception traps
  ------------------------------------------------------------------
  
  _Description_:
!      `_gfortran_set_fpe' enables floating point exception traps for the
       specified exceptions.  On most systems, this will result in a
       SIGFPE signal being sent and the program being aborted.
  
  _Syntax_:
!      `void _gfortran_set_fpe (int val)'
  
  _Arguments_:
!      OPTION[0]  IEEE exceptions.  Possible values are (bitwise
!                 or-ed) zero (0, default) no trapping,
!                 `GFC_FPE_INVALID' (1), `GFC_FPE_DENORMAL' (2),
!                 `GFC_FPE_ZERO' (4), `GFC_FPE_OVERFLOW' (8),
!                 `GFC_FPE_UNDERFLOW' (16), and
!                 `GFC_FPE_INEXACT' (32).
  
  _Example_:
            int main (int argc, char *argv[])
--- 3946,3969 ----
  
  File: gfortran.info,  Node: _gfortran_set_fpe,  Next: _gfortran_set_max_subrecord_length,  Prev: _gfortran_set_record_marker,  Up: Non-Fortran Main Program
  
! 7.3.5 '_gfortran_set_fpe' -- Enable floating point exception traps
  ------------------------------------------------------------------
  
  _Description_:
!      '_gfortran_set_fpe' enables floating point exception traps for the
       specified exceptions.  On most systems, this will result in a
       SIGFPE signal being sent and the program being aborted.
  
  _Syntax_:
!      'void _gfortran_set_fpe (int val)'
  
  _Arguments_:
!      OPTION[0]   IEEE exceptions.  Possible values are (bitwise
!                  or-ed) zero (0, default) no trapping,
!                  'GFC_FPE_INVALID' (1), 'GFC_FPE_DENORMAL' (2),
!                  'GFC_FPE_ZERO' (4), 'GFC_FPE_OVERFLOW' (8),
!                  'GFC_FPE_UNDERFLOW' (16), and 'GFC_FPE_INEXACT'
!                  (32).
  
  _Example_:
            int main (int argc, char *argv[])
*************** _Example_:
*** 4013,4033 ****
  
  File: gfortran.info,  Node: _gfortran_set_max_subrecord_length,  Prev: _gfortran_set_fpe,  Up: Non-Fortran Main Program
  
! 7.3.6 `_gfortran_set_max_subrecord_length' -- Set subrecord length
  ------------------------------------------------------------------
  
  _Description_:
!      `_gfortran_set_max_subrecord_length' set the maximum length for a
       subrecord.  This option only makes sense for testing and debugging
       of unformatted I/O.
  
  _Syntax_:
!      `void _gfortran_set_max_subrecord_length (int val)'
  
  _Arguments_:
!      VAL        the maximum length for a subrecord; the
!                 maximum permitted value is 2147483639, which
!                 is also the default.
  
  _Example_:
            int main (int argc, char *argv[])
--- 3978,3998 ----
  
  File: gfortran.info,  Node: _gfortran_set_max_subrecord_length,  Prev: _gfortran_set_fpe,  Up: Non-Fortran Main Program
  
! 7.3.6 '_gfortran_set_max_subrecord_length' -- Set subrecord length
  ------------------------------------------------------------------
  
  _Description_:
!      '_gfortran_set_max_subrecord_length' set the maximum length for a
       subrecord.  This option only makes sense for testing and debugging
       of unformatted I/O.
  
  _Syntax_:
!      'void _gfortran_set_max_subrecord_length (int val)'
  
  _Arguments_:
!      VAL         the maximum length for a subrecord; the maximum
!                  permitted value is 2147483639, which is also the
!                  default.
  
  _Example_:
            int main (int argc, char *argv[])
*************** File: gfortran.info,  Node: Naming conve
*** 4063,4090 ****
  ------------------------
  
  According the Fortran standard, valid Fortran names consist of a letter
! between `A' to `Z', `a' to `z', digits `0', `1' to `9' and underscores
! (`_') with the restriction that names may only start with a letter.  As
! vendor extension, the dollar sign (`$') is additionally permitted with
! the option `-fdollar-ok', but not as first character and only if the
  target system supports it.
  
     By default, the procedure name is the lower-cased Fortran name with
! an appended underscore (`_'); using `-fno-underscoring' no underscore
! is appended while `-fsecond-underscore' appends two underscores.
! Depending on the target system and the calling convention, the
! procedure might be additionally dressed; for instance, on 32bit Windows
! with `stdcall', an at-sign `@' followed by an integer number is
! appended.  For the changing the calling convention, see *note GNU
! Fortran Compiler Directives::.
  
!    For common blocks, the same convention is used, i.e. by default an
  underscore is appended to the lower-cased Fortran name.  Blank commons
! have the name `__BLNK__'.
  
     For procedures and variables declared in the specification space of a
! module, the name is formed by `__', followed by the lower-cased module
! name, `_MOD_', and the lower-cased Fortran name.  Note that no
  underscore is appended.
  
  
--- 4028,4054 ----
  ------------------------
  
  According the Fortran standard, valid Fortran names consist of a letter
! between 'A' to 'Z', 'a' to 'z', digits '0', '1' to '9' and underscores
! ('_') with the restriction that names may only start with a letter.  As
! vendor extension, the dollar sign ('$') is additionally permitted with
! the option '-fdollar-ok', but not as first character and only if the
  target system supports it.
  
     By default, the procedure name is the lower-cased Fortran name with
! an appended underscore ('_'); using '-fno-underscoring' no underscore is
! appended while '-fsecond-underscore' appends two underscores.  Depending
! on the target system and the calling convention, the procedure might be
! additionally dressed; for instance, on 32bit Windows with 'stdcall', an
! at-sign '@' followed by an integer number is appended.  For the changing
! the calling convention, see *note GNU Fortran Compiler Directives::.
  
!    For common blocks, the same convention is used, i.e.  by default an
  underscore is appended to the lower-cased Fortran name.  Blank commons
! have the name '__BLNK__'.
  
     For procedures and variables declared in the specification space of a
! module, the name is formed by '__', followed by the lower-cased module
! name, '_MOD_', and the lower-cased Fortran name.  Note that no
  underscore is appended.
  
  
*************** File: gfortran.info,  Node: Argument pas
*** 4093,4177 ****
  7.4.2 Argument passing conventions
  ----------------------------------
  
! Subroutines do not return a value (matching C99's `void') while
  functions either return a value as specified in the platform ABI or the
  result variable is passed as hidden argument to the function and no
  result is returned.  A hidden result variable is used when the result
! variable is an array or of type `CHARACTER'.
  
     Arguments are passed according to the platform ABI. In particular,
  complex arguments might not be compatible to a struct with two real
! components for the real and imaginary part. The argument passing
! matches the one of C99's `_Complex'.  Functions with scalar complex
  result variables return their value and do not use a by-reference
! argument.  Note that with the `-ff2c' option, the argument passing is
! modified and no longer completely matches the platform ABI.  Some other
! Fortran compilers use `f2c' semantic by default; this might cause
  problems with interoperablility.
  
!    GNU Fortran passes most arguments by reference, i.e. by passing a
  pointer to the data.  Note that the compiler might use a temporary
  variable into which the actual argument has been copied, if required
  semantically (copy-in/copy-out).
  
!    For arguments with `ALLOCATABLE' and `POINTER' attribute (including
  procedure pointers), a pointer to the pointer is passed such that the
  pointer address can be modified in the procedure.
  
!    For dummy arguments with the `VALUE' attribute: Scalar arguments of
! the type `INTEGER', `LOGICAL', `REAL' and `COMPLEX' are passed by value
! according to the platform ABI.  (As vendor extension and not
! recommended, using `%VAL()' in the call to a procedure has the same
! effect.) For `TYPE(C_PTR)' and procedure pointers, the pointer itself
! is passed such that it can be modified without affecting the caller.
  
!    For Boolean (`LOGICAL') arguments, please note that GCC expects only
! the integer value 0 and 1.  If a GNU Fortran `LOGICAL' variable
! contains another integer value, the result is undefined.  As some other
! Fortran compilers use -1 for `.TRUE.', extra care has to be taken -
! such as passing the value as `INTEGER'.  (The same value restriction
! also applies to other front ends of GCC, e.g. to GCC's C99 compiler for
! `_Bool' or GCC's Ada compiler for `Boolean'.)
  
!    For arguments of `CHARACTER' type, the character length is passed as
  hidden argument.  For deferred-length strings, the value is passed by
  reference, otherwise by value.  The character length has the type
! `INTEGER(kind=4)'.  Note with C binding, `CHARACTER(len=1)' result
  variables are returned according to the platform ABI and no hidden
! length argument is used for dummy arguments; with `VALUE', those
  variables are passed by value.
  
!    For `OPTIONAL' dummy arguments, an absent argument is denoted by a
! NULL pointer, except for scalar dummy arguments of type `INTEGER',
! `LOGICAL', `REAL' and `COMPLEX' which have the `VALUE' attribute.  For
! those, a hidden Boolean argument (`logical(kind=C_bool),value') is used
  to indicate whether the argument is present.
  
     Arguments which are assumed-shape, assumed-rank or deferred-rank
! arrays or, with `-fcoarray=lib', allocatable scalar coarrays use an
  array descriptor.  All other arrays pass the address of the first
! element of the array.  With `-fcoarray=lib', the token and the offset
  belonging to nonallocatable coarrays dummy arguments are passed as
  hidden argument along the character length hidden arguments.  The token
  is an oparque pointer identifying the coarray and the offset is a
! passed-by-value integer of kind `C_PTRDIFF_T', denoting the byte offset
  between the base address of the coarray and the passed scalar or first
  element of the passed array.
  
     The arguments are passed in the following order
     * Result variable, when the function result is passed by reference
- 
     * Character length of the function result, if it is a of type
!      `CHARACTER' and no C binding is used
! 
     * The arguments in the order in which they appear in the Fortran
       declaration
- 
     * The the present status for optional arguments with value attribute,
       which are internally passed by value
- 
     * The character length and/or coarray token and offset for the first
!      argument which is a `CHARACTER' or a nonallocatable coarray dummy
       argument, followed by the hidden arguments of the next dummy
       argument of such a type
  
--- 4057,4137 ----
  7.4.2 Argument passing conventions
  ----------------------------------
  
! Subroutines do not return a value (matching C99's 'void') while
  functions either return a value as specified in the platform ABI or the
  result variable is passed as hidden argument to the function and no
  result is returned.  A hidden result variable is used when the result
! variable is an array or of type 'CHARACTER'.
  
     Arguments are passed according to the platform ABI. In particular,
  complex arguments might not be compatible to a struct with two real
! components for the real and imaginary part.  The argument passing
! matches the one of C99's '_Complex'.  Functions with scalar complex
  result variables return their value and do not use a by-reference
! argument.  Note that with the '-ff2c' option, the argument passing is
! modified and no longer completely matches the platform ABI. Some other
! Fortran compilers use 'f2c' semantic by default; this might cause
  problems with interoperablility.
  
!    GNU Fortran passes most arguments by reference, i.e.  by passing a
  pointer to the data.  Note that the compiler might use a temporary
  variable into which the actual argument has been copied, if required
  semantically (copy-in/copy-out).
  
!    For arguments with 'ALLOCATABLE' and 'POINTER' attribute (including
  procedure pointers), a pointer to the pointer is passed such that the
  pointer address can be modified in the procedure.
  
!    For dummy arguments with the 'VALUE' attribute: Scalar arguments of
! the type 'INTEGER', 'LOGICAL', 'REAL' and 'COMPLEX' are passed by value
! according to the platform ABI. (As vendor extension and not recommended,
! using '%VAL()' in the call to a procedure has the same effect.)  For
! 'TYPE(C_PTR)' and procedure pointers, the pointer itself is passed such
! that it can be modified without affecting the caller.
  
!    For Boolean ('LOGICAL') arguments, please note that GCC expects only
! the integer value 0 and 1.  If a GNU Fortran 'LOGICAL' variable contains
! another integer value, the result is undefined.  As some other Fortran
! compilers use -1 for '.TRUE.', extra care has to be taken - such as
! passing the value as 'INTEGER'.  (The same value restriction also
! applies to other front ends of GCC, e.g.  to GCC's C99 compiler for
! '_Bool' or GCC's Ada compiler for 'Boolean'.)
  
!    For arguments of 'CHARACTER' type, the character length is passed as
  hidden argument.  For deferred-length strings, the value is passed by
  reference, otherwise by value.  The character length has the type
! 'INTEGER(kind=4)'.  Note with C binding, 'CHARACTER(len=1)' result
  variables are returned according to the platform ABI and no hidden
! length argument is used for dummy arguments; with 'VALUE', those
  variables are passed by value.
  
!    For 'OPTIONAL' dummy arguments, an absent argument is denoted by a
! NULL pointer, except for scalar dummy arguments of type 'INTEGER',
! 'LOGICAL', 'REAL' and 'COMPLEX' which have the 'VALUE' attribute.  For
! those, a hidden Boolean argument ('logical(kind=C_bool),value') is used
  to indicate whether the argument is present.
  
     Arguments which are assumed-shape, assumed-rank or deferred-rank
! arrays or, with '-fcoarray=lib', allocatable scalar coarrays use an
  array descriptor.  All other arrays pass the address of the first
! element of the array.  With '-fcoarray=lib', the token and the offset
  belonging to nonallocatable coarrays dummy arguments are passed as
  hidden argument along the character length hidden arguments.  The token
  is an oparque pointer identifying the coarray and the offset is a
! passed-by-value integer of kind 'C_PTRDIFF_T', denoting the byte offset
  between the base address of the coarray and the passed scalar or first
  element of the passed array.
  
     The arguments are passed in the following order
     * Result variable, when the function result is passed by reference
     * Character length of the function result, if it is a of type
!      'CHARACTER' and no C binding is used
     * The arguments in the order in which they appear in the Fortran
       declaration
     * The the present status for optional arguments with value attribute,
       which are internally passed by value
     * The character length and/or coarray token and offset for the first
!      argument which is a 'CHARACTER' or a nonallocatable coarray dummy
       argument, followed by the hidden arguments of the next dummy
       argument of such a type
  
*************** File: gfortran.info,  Node: Type and enu
*** 4200,4215 ****
  
  File: gfortran.info,  Node: caf_token_t,  Next: caf_register_t,  Up: Type and enum ABI Documentation
  
! 8.1.1 `caf_token_t'
  -------------------
  
! Typedef of type `void *' on the compiler side. Can be any data type on
  the library side.
  
  
  File: gfortran.info,  Node: caf_register_t,  Prev: caf_token_t,  Up: Type and enum ABI Documentation
  
! 8.1.2 `caf_register_t'
  ----------------------
  
  Indicates which kind of coarray variable should be registered.
--- 4160,4175 ----
  
  File: gfortran.info,  Node: caf_token_t,  Next: caf_register_t,  Up: Type and enum ABI Documentation
  
! 8.1.1 'caf_token_t'
  -------------------
  
! Typedef of type 'void *' on the compiler side.  Can be any data type on
  the library side.
  
  
  File: gfortran.info,  Node: caf_register_t,  Prev: caf_token_t,  Up: Type and enum ABI Documentation
  
! 8.1.2 'caf_register_t'
  ----------------------
  
  Indicates which kind of coarray variable should be registered.
*************** File: gfortran.info,  Node: Function ABI
*** 4265,4290 ****
  
  File: gfortran.info,  Node: _gfortran_caf_init,  Next: _gfortran_caf_finish,  Up: Function ABI Documentation
  
! 8.2.1 `_gfortran_caf_init' -- Initialiation function
  ----------------------------------------------------
  
  _Description_:
       This function is called at startup of the program before the
       Fortran main program, if the latter has been compiled with
!      `-fcoarray=lib'.  It takes as arguments the command-line arguments
!      of the program.  It is permitted to pass to `NULL' pointers as
!      argument; if non-`NULL', the library is permitted to modify the
       arguments.
  
  _Syntax_:
!      `void _gfortran_caf_init (int *argc, char ***argv)'
  
  _Arguments_:
!      ARGC       intent(inout) An integer pointer with the
!                 number of arguments passed to the program or
!                 `NULL'.
!      ARGV       intent(inout) A pointer to an array of strings
!                 with the command-line arguments or `NULL'.
  
  _NOTES_
       The function is modelled after the initialization function of the
--- 4225,4249 ----
  
  File: gfortran.info,  Node: _gfortran_caf_init,  Next: _gfortran_caf_finish,  Up: Function ABI Documentation
  
! 8.2.1 '_gfortran_caf_init' -- Initialiation function
  ----------------------------------------------------
  
  _Description_:
       This function is called at startup of the program before the
       Fortran main program, if the latter has been compiled with
!      '-fcoarray=lib'.  It takes as arguments the command-line arguments
!      of the program.  It is permitted to pass to 'NULL' pointers as
!      argument; if non-'NULL', the library is permitted to modify the
       arguments.
  
  _Syntax_:
!      'void _gfortran_caf_init (int *argc, char ***argv)'
  
  _Arguments_:
!      ARGC        intent(inout) An integer pointer with the number
!                  of arguments passed to the program or 'NULL'.
!      ARGV        intent(inout) A pointer to an array of strings
!                  with the command-line arguments or 'NULL'.
  
  _NOTES_
       The function is modelled after the initialization function of the
*************** _NOTES_
*** 4298,4437 ****
  
  File: gfortran.info,  Node: _gfortran_caf_finish,  Next: _gfortran_caf_this_image,  Prev: _gfortran_caf_init,  Up: Function ABI Documentation
  
! 8.2.2 `_gfortran_caf_finish' -- Finalization function
  -----------------------------------------------------
  
  _Description_:
       This function is called at the end of the Fortran main program, if
!      it has been compiled with the `-fcoarray=lib' option.
  
  _Syntax_:
!      `void _gfortran_caf_finish (void)'
  
  _NOTES_
!      For non-Fortran programs, it is recommended to call the function
!      at the end of the main program.  To ensure that the shutdown is
!      also performed for programs where this function is not explicitly
!      invoked, for instance non-Fortran programs or calls to the
!      system's exit() function, the library can use a destructor
!      function.  Note that programs can also be terminated using the
!      STOP and ERROR STOP statements; those use different library calls.
  
  
  File: gfortran.info,  Node: _gfortran_caf_this_image,  Next: _gfortran_caf_num_images,  Prev: _gfortran_caf_finish,  Up: Function ABI Documentation
  
! 8.2.3 `_gfortran_caf_this_image' -- Querying the image number
  -------------------------------------------------------------
  
  _Description_:
!      This function returns the current image number, which is a
!      positive number.
  
  _Syntax_:
!      `int _gfortran_caf_this_image (int distance)'
  
  _Arguments_:
!      DISTANCE   As specified for the `this_image' intrinsic in
!                 TS18508. Shall be a nonnegative number.
  
  _NOTES_
!      If the Fortran intrinsic `this_image' is invoked without an
       argument, which is the only permitted form in Fortran 2008, GCC
!      passes `0' as first argument.
  
  
  File: gfortran.info,  Node: _gfortran_caf_num_images,  Next: _gfortran_caf_register,  Prev: _gfortran_caf_this_image,  Up: Function ABI Documentation
  
! 8.2.4 `_gfortran_caf_num_images' -- Querying the maximal number of images
  -------------------------------------------------------------------------
  
  _Description_:
       This function returns the number of images in the current team, if
       DISTANCE is 0 or the number of images in the parent team at the
!      specified distance. If failed is -1, the function returns the
       number of all images at the specified distance; if it is 0, the
!      function returns the number of nonfailed images, and if it is 1,
!      it returns the number of failed images.
  
  _Syntax_:
!      `int _gfortran_caf_num_images(int distance, int failed)'
  
  _Arguments_:
!      DISTANCE   the distance from this image to the ancestor.
!                 Shall be positive.
!      FAILED     shall be -1, 0, or 1
  
  _NOTES_
!      This function follows TS18508. If the num_image intrinsic has no
!      arguments, the the compiler passes `distance=0' and `failed=-1' to
       the function.
  
  
  File: gfortran.info,  Node: _gfortran_caf_register,  Next: _gfortran_caf_deregister,  Prev: _gfortran_caf_num_images,  Up: Function ABI Documentation
  
! 8.2.5 `_gfortran_caf_register' -- Registering coarrays
  ------------------------------------------------------
  
  _Description_:
       Allocates memory for a coarray and creates a token to identify the
!      coarray. The function is called for both coarrays with `SAVE'
!      attribute and using an explicit `ALLOCATE' statement. If an error
!      occurs and STAT is a `NULL' pointer, the function shall abort with
       printing an error message and starting the error termination.  If
       no error occurs and STAT is present, it shall be set to zero.
!      Otherwise, it shall be set to a positive value and, if not-`NULL',
!      ERRMSG shall be set to a string describing the failure. The
       function shall return a pointer to the requested memory for the
!      local image as a call to `malloc' would do.
  
!      For `CAF_REGTYPE_COARRAY_STATIC' and `CAF_REGTYPE_COARRAY_ALLOC',
       the passed size is the byte size requested.  For
!      `CAF_REGTYPE_LOCK_STATIC', `CAF_REGTYPE_LOCK_ALLOC' and
!      `CAF_REGTYPE_CRITICAL' it is the array size or one for a scalar.
  
  _Syntax_:
!      `void *caf_register (size_t size, caf_register_t type, caf_token_t
       *token, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      SIZE       For normal coarrays, the byte size of the
!                 coarray to be allocated; for lock types and
!                 event types, the number of elements.
!      TYPE       one of the caf_register_t types.
!      TOKEN      intent(out) An opaque pointer identifying the
!                 coarray.
!      STAT       intent(out) For allocatable coarrays, stores
!                 the STAT=; may be NULL
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
       Nonalloatable coarrays have to be registered prior use from remote
       images.  In order to guarantee this, they have to be registered
!      before the main program. This can be achieved by creating
!      constructor functions. That is what GCC does such that also
       nonallocatable coarrays the memory is allocated and no static
       memory is used.  The token permits to identify the coarray; to the
!      processor, the token is a nonaliasing pointer. The library can,
       for instance, store the base address of the coarray in the token,
       some handle or a more complicated struct.
  
       For normal coarrays, the returned pointer is used for accesses on
!      the local image. For lock types, the value shall only used for
!      checking the allocation status. Note that for critical blocks, the
       locking is only required on one image; in the locking statement,
       the processor shall always pass always an image index of one for
!      critical-block lock variables (`CAF_REGTYPE_CRITICAL'). For lock
       types and critical-block variables, the initial value shall be
       unlocked (or, respecitively, not in critical section) such as the
!      value false; for event types, the initial state should be no
!      event, e.g. zero.
  
  
  File: gfortran.info,  Node: _gfortran_caf_deregister,  Next: _gfortran_caf_send,  Prev: _gfortran_caf_register,  Up: Function ABI Documentation
  
! 8.2.6 `_gfortran_caf_deregister' -- Deregistering coarrays
  ----------------------------------------------------------
  
  _Description_:
--- 4257,4396 ----
  
  File: gfortran.info,  Node: _gfortran_caf_finish,  Next: _gfortran_caf_this_image,  Prev: _gfortran_caf_init,  Up: Function ABI Documentation
  
! 8.2.2 '_gfortran_caf_finish' -- Finalization function
  -----------------------------------------------------
  
  _Description_:
       This function is called at the end of the Fortran main program, if
!      it has been compiled with the '-fcoarray=lib' option.
  
  _Syntax_:
!      'void _gfortran_caf_finish (void)'
  
  _NOTES_
!      For non-Fortran programs, it is recommended to call the function at
!      the end of the main program.  To ensure that the shutdown is also
!      performed for programs where this function is not explicitly
!      invoked, for instance non-Fortran programs or calls to the system's
!      exit() function, the library can use a destructor function.  Note
!      that programs can also be terminated using the STOP and ERROR STOP
!      statements; those use different library calls.
  
  
  File: gfortran.info,  Node: _gfortran_caf_this_image,  Next: _gfortran_caf_num_images,  Prev: _gfortran_caf_finish,  Up: Function ABI Documentation
  
! 8.2.3 '_gfortran_caf_this_image' -- Querying the image number
  -------------------------------------------------------------
  
  _Description_:
!      This function returns the current image number, which is a positive
!      number.
  
  _Syntax_:
!      'int _gfortran_caf_this_image (int distance)'
  
  _Arguments_:
!      DISTANCE    As specified for the 'this_image' intrinsic in
!                  TS18508.  Shall be a nonnegative number.
  
  _NOTES_
!      If the Fortran intrinsic 'this_image' is invoked without an
       argument, which is the only permitted form in Fortran 2008, GCC
!      passes '0' as first argument.
  
  
  File: gfortran.info,  Node: _gfortran_caf_num_images,  Next: _gfortran_caf_register,  Prev: _gfortran_caf_this_image,  Up: Function ABI Documentation
  
! 8.2.4 '_gfortran_caf_num_images' -- Querying the maximal number of images
  -------------------------------------------------------------------------
  
  _Description_:
       This function returns the number of images in the current team, if
       DISTANCE is 0 or the number of images in the parent team at the
!      specified distance.  If failed is -1, the function returns the
       number of all images at the specified distance; if it is 0, the
!      function returns the number of nonfailed images, and if it is 1, it
!      returns the number of failed images.
  
  _Syntax_:
!      'int _gfortran_caf_num_images(int distance, int failed)'
  
  _Arguments_:
!      DISTANCE    the distance from this image to the ancestor.
!                  Shall be positive.
!      FAILED      shall be -1, 0, or 1
  
  _NOTES_
!      This function follows TS18508.  If the num_image intrinsic has no
!      arguments, the the compiler passes 'distance=0' and 'failed=-1' to
       the function.
  
  
  File: gfortran.info,  Node: _gfortran_caf_register,  Next: _gfortran_caf_deregister,  Prev: _gfortran_caf_num_images,  Up: Function ABI Documentation
  
! 8.2.5 '_gfortran_caf_register' -- Registering coarrays
  ------------------------------------------------------
  
  _Description_:
       Allocates memory for a coarray and creates a token to identify the
!      coarray.  The function is called for both coarrays with 'SAVE'
!      attribute and using an explicit 'ALLOCATE' statement.  If an error
!      occurs and STAT is a 'NULL' pointer, the function shall abort with
       printing an error message and starting the error termination.  If
       no error occurs and STAT is present, it shall be set to zero.
!      Otherwise, it shall be set to a positive value and, if not-'NULL',
!      ERRMSG shall be set to a string describing the failure.  The
       function shall return a pointer to the requested memory for the
!      local image as a call to 'malloc' would do.
  
!      For 'CAF_REGTYPE_COARRAY_STATIC' and 'CAF_REGTYPE_COARRAY_ALLOC',
       the passed size is the byte size requested.  For
!      'CAF_REGTYPE_LOCK_STATIC', 'CAF_REGTYPE_LOCK_ALLOC' and
!      'CAF_REGTYPE_CRITICAL' it is the array size or one for a scalar.
  
  _Syntax_:
!      'void *caf_register (size_t size, caf_register_t type, caf_token_t
       *token, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      SIZE        For normal coarrays, the byte size of the
!                  coarray to be allocated; for lock types and
!                  event types, the number of elements.
!      TYPE        one of the caf_register_t types.
!      TOKEN       intent(out) An opaque pointer identifying the
!                  coarray.
!      STAT        intent(out) For allocatable coarrays, stores the
!                  STAT=; may be NULL
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
       Nonalloatable coarrays have to be registered prior use from remote
       images.  In order to guarantee this, they have to be registered
!      before the main program.  This can be achieved by creating
!      constructor functions.  That is what GCC does such that also
       nonallocatable coarrays the memory is allocated and no static
       memory is used.  The token permits to identify the coarray; to the
!      processor, the token is a nonaliasing pointer.  The library can,
       for instance, store the base address of the coarray in the token,
       some handle or a more complicated struct.
  
       For normal coarrays, the returned pointer is used for accesses on
!      the local image.  For lock types, the value shall only used for
!      checking the allocation status.  Note that for critical blocks, the
       locking is only required on one image; in the locking statement,
       the processor shall always pass always an image index of one for
!      critical-block lock variables ('CAF_REGTYPE_CRITICAL').  For lock
       types and critical-block variables, the initial value shall be
       unlocked (or, respecitively, not in critical section) such as the
!      value false; for event types, the initial state should be no event,
!      e.g.  zero.
  
  
  File: gfortran.info,  Node: _gfortran_caf_deregister,  Next: _gfortran_caf_send,  Prev: _gfortran_caf_register,  Up: Function ABI Documentation
  
! 8.2.6 '_gfortran_caf_deregister' -- Deregistering coarrays
  ----------------------------------------------------------
  
  _Description_:
*************** _Description_:
*** 4441,4454 ****
       STAT variable is not null.
  
  _Syntax_:
!      `void caf_deregister (const caf_token_t *token, int *stat, char
       *errmsg, int errmsg_len)'
  
  _Arguments_:
!      STAT       intent(out) Stores the STAT=; may be NULL
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
       For nonalloatable coarrays this function is never called.  If a
--- 4400,4413 ----
       STAT variable is not null.
  
  _Syntax_:
!      'void caf_deregister (const caf_token_t *token, int *stat, char
       *errmsg, int errmsg_len)'
  
  _Arguments_:
!      STAT        intent(out) Stores the STAT=; may be NULL
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
       For nonalloatable coarrays this function is never called.  If a
*************** _NOTES_
*** 4458,4464 ****
  
  File: gfortran.info,  Node: _gfortran_caf_send,  Next: _gfortran_caf_get,  Prev: _gfortran_caf_deregister,  Up: Function ABI Documentation
  
! 8.2.7 `_gfortran_caf_send' -- Sending data from a local image to a remote image
  -------------------------------------------------------------------------------
  
  _Description_:
--- 4417,4423 ----
  
  File: gfortran.info,  Node: _gfortran_caf_send,  Next: _gfortran_caf_get,  Prev: _gfortran_caf_deregister,  Up: Function ABI Documentation
  
! 8.2.7 '_gfortran_caf_send' -- Sending data from a local image to a remote image
  -------------------------------------------------------------------------------
  
  _Description_:
*************** _Description_:
*** 4466,4522 ****
       local to a remote image identified by the image_index.
  
  _Syntax_:
!      `void _gfortran_caf_send (caf_token_t token, size_t offset, int
       image_index, gfc_descriptor_t *dest, caf_vector_t *dst_vector,
       gfc_descriptor_t *src, int dst_kind, int src_kind, bool
       may_require_tmp)'
  
  _Arguments_:
!      TOKEN      intent(in)  An opaque pointer identifying the
!                 coarray.
!      OFFSET     By which amount of bytes the actual data is
!                 shifted compared to the base address of the
!                 coarray.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number.
!      DEST       intent(in) Array descriptor for the remote
!                 image for the bounds and the size. The
!                 base_addr shall not be accessed.
!      DST_VECTOR intent(int)  If not NULL, it contains the
!                 vector subscript of the destination array; the
!                 values are relative to the dimension triplet
!                 of the dest argument.
!      SRC        intent(in) Array descriptor of the local array
!                 to be transferred to the remote image
!      DST_KIND   Kind of the destination argument
!      SRC_KIND   Kind of the source argument
       MAY_REQUIRE_TMPThe variable is false it is known at compile
!                 time that the DEST and SRC either cannot
!                 overlap or overlap (fully or partially) such
!                 that walking SRC and DEST in element wise
!                 element order (honoring the stride value) will
!                 not lead to wrong results.  Otherwise, the
!                 value is true.
  
  _NOTES_
       It is permitted to have image_id equal the current image; the
       memory of the send-to and the send-from might (partially) overlap
!      in that case. The implementation has to take care that it handles
!      this case, e.g. using `memmove' which handles (partially)
!      overlapping memory. If MAY_REQUIRE_TMP is true, the library might
       additionally create a temporary variable, unless additional checks
!      show that this is not required (e.g. because walking backward is
!      possible or because both arrays are contiguous and `memmove' takes
       care of overlap issues).
  
!      Note that the assignment of a scalar to an array is permitted. In
!      addition, the library has to handle numeric-type conversion and
!      for strings, padding and different character kinds.
  
  
  File: gfortran.info,  Node: _gfortran_caf_get,  Next: _gfortran_caf_sendget,  Prev: _gfortran_caf_send,  Up: Function ABI Documentation
  
! 8.2.8 `_gfortran_caf_get' -- Getting data from a remote image
  -------------------------------------------------------------
  
  _Description_:
--- 4425,4480 ----
       local to a remote image identified by the image_index.
  
  _Syntax_:
!      'void _gfortran_caf_send (caf_token_t token, size_t offset, int
       image_index, gfc_descriptor_t *dest, caf_vector_t *dst_vector,
       gfc_descriptor_t *src, int dst_kind, int src_kind, bool
       may_require_tmp)'
  
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      OFFSET      By which amount of bytes the actual data is
!                  shifted compared to the base address of the
!                  coarray.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number.
!      DEST        intent(in) Array descriptor for the remote image
!                  for the bounds and the size.  The base_addr
!                  shall not be accessed.
!      DST_VECTOR  intent(int) If not NULL, it contains the vector
!                  subscript of the destination array; the values
!                  are relative to the dimension triplet of the
!                  dest argument.
!      SRC         intent(in) Array descriptor of the local array
!                  to be transferred to the remote image
!      DST_KIND    Kind of the destination argument
!      SRC_KIND    Kind of the source argument
       MAY_REQUIRE_TMPThe variable is false it is known at compile
!                  time that the DEST and SRC either cannot overlap
!                  or overlap (fully or partially) such that
!                  walking SRC and DEST in element wise element
!                  order (honoring the stride value) will not lead
!                  to wrong results.  Otherwise, the value is true.
  
  _NOTES_
       It is permitted to have image_id equal the current image; the
       memory of the send-to and the send-from might (partially) overlap
!      in that case.  The implementation has to take care that it handles
!      this case, e.g.  using 'memmove' which handles (partially)
!      overlapping memory.  If MAY_REQUIRE_TMP is true, the library might
       additionally create a temporary variable, unless additional checks
!      show that this is not required (e.g.  because walking backward is
!      possible or because both arrays are contiguous and 'memmove' takes
       care of overlap issues).
  
!      Note that the assignment of a scalar to an array is permitted.  In
!      addition, the library has to handle numeric-type conversion and for
!      strings, padding and different character kinds.
  
  
  File: gfortran.info,  Node: _gfortran_caf_get,  Next: _gfortran_caf_sendget,  Prev: _gfortran_caf_send,  Up: Function ABI Documentation
  
! 8.2.8 '_gfortran_caf_get' -- Getting data from a remote image
  -------------------------------------------------------------
  
  _Description_:
*************** _Description_:
*** 4524,4579 ****
       image identified by the image_index.
  
  _Syntax_:
!      `void _gfortran_caf_get_desc (caf_token_t token, size_t offset,
!      int image_index, gfc_descriptor_t *src, caf_vector_t *src_vector,
       gfc_descriptor_t *dest, int src_kind, int dst_kind, bool
       may_require_tmp)'
  
  _Arguments_:
!      TOKEN      intent(in)  An opaque pointer identifying the
!                 coarray.
!      OFFSET     By which amount of bytes the actual data is
!                 shifted compared to the base address of the
!                 coarray.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number.
!      DEST       intent(in) Array descriptor of the local array
!                 to be transferred to the remote image
!      SRC        intent(in) Array descriptor for the remote
!                 image for the bounds and the size. The
!                 base_addr shall not be accessed.
!      SRC_VECTOR intent(int)  If not NULL, it contains the
!                 vector subscript of the destination array; the
!                 values are relative to the dimension triplet
!                 of the dest argument.
!      DST_KIND   Kind of the destination argument
!      SRC_KIND   Kind of the source argument
       MAY_REQUIRE_TMPThe variable is false it is known at compile
!                 time that the DEST and SRC either cannot
!                 overlap or overlap (fully or partially) such
!                 that walking SRC and DEST in element wise
!                 element order (honoring the stride value) will
!                 not lead to wrong results.  Otherwise, the
!                 value is true.
  
  _NOTES_
       It is permitted to have image_id equal the current image; the
       memory of the send-to and the send-from might (partially) overlap
!      in that case. The implementation has to take care that it handles
!      this case, e.g. using `memmove' which handles (partially)
!      overlapping memory. If MAY_REQUIRE_TMP is true, the library might
       additionally create a temporary variable, unless additional checks
!      show that this is not required (e.g. because walking backward is
!      possible or because both arrays are contiguous and `memmove' takes
       care of overlap issues).
  
!      Note that the library has to handle numeric-type conversion and
!      for strings, padding and different character kinds.
  
  
  File: gfortran.info,  Node: _gfortran_caf_sendget,  Next: _gfortran_caf_lock,  Prev: _gfortran_caf_get,  Up: Function ABI Documentation
  
! 8.2.9 `_gfortran_caf_sendget' -- Sending data between remote images
  -------------------------------------------------------------------
  
  _Description_:
--- 4482,4536 ----
       image identified by the image_index.
  
  _Syntax_:
!      'void _gfortran_caf_get_desc (caf_token_t token, size_t offset, int
!      image_index, gfc_descriptor_t *src, caf_vector_t *src_vector,
       gfc_descriptor_t *dest, int src_kind, int dst_kind, bool
       may_require_tmp)'
  
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      OFFSET      By which amount of bytes the actual data is
!                  shifted compared to the base address of the
!                  coarray.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number.
!      DEST        intent(in) Array descriptor of the local array
!                  to be transferred to the remote image
!      SRC         intent(in) Array descriptor for the remote image
!                  for the bounds and the size.  The base_addr
!                  shall not be accessed.
!      SRC_VECTOR  intent(int) If not NULL, it contains the vector
!                  subscript of the destination array; the values
!                  are relative to the dimension triplet of the
!                  dest argument.
!      DST_KIND    Kind of the destination argument
!      SRC_KIND    Kind of the source argument
       MAY_REQUIRE_TMPThe variable is false it is known at compile
!                  time that the DEST and SRC either cannot overlap
!                  or overlap (fully or partially) such that
!                  walking SRC and DEST in element wise element
!                  order (honoring the stride value) will not lead
!                  to wrong results.  Otherwise, the value is true.
  
  _NOTES_
       It is permitted to have image_id equal the current image; the
       memory of the send-to and the send-from might (partially) overlap
!      in that case.  The implementation has to take care that it handles
!      this case, e.g.  using 'memmove' which handles (partially)
!      overlapping memory.  If MAY_REQUIRE_TMP is true, the library might
       additionally create a temporary variable, unless additional checks
!      show that this is not required (e.g.  because walking backward is
!      possible or because both arrays are contiguous and 'memmove' takes
       care of overlap issues).
  
!      Note that the library has to handle numeric-type conversion and for
!      strings, padding and different character kinds.
  
  
  File: gfortran.info,  Node: _gfortran_caf_sendget,  Next: _gfortran_caf_lock,  Prev: _gfortran_caf_get,  Up: Function ABI Documentation
  
! 8.2.9 '_gfortran_caf_sendget' -- Sending data between remote images
  -------------------------------------------------------------------
  
  _Description_:
*************** _Description_:
*** 4582,4678 ****
       identified by the dst_image_index.
  
  _Syntax_:
!      `void _gfortran_caf_sendget (caf_token_t dst_token, size_t
       dst_offset, int dst_image_index, gfc_descriptor_t *dest,
!      caf_vector_t *dst_vector, caf_token_t src_token, size_t
!      src_offset, int src_image_index, gfc_descriptor_t *src,
!      caf_vector_t *src_vector, int dst_kind, int src_kind, bool
!      may_require_tmp)'
  
  _Arguments_:
!      DST_TOKEN  intent(in)  An opaque pointer identifying the
!                 destination coarray.
!      DST_OFFSET By which amount of bytes the actual data is
!                 shifted compared to the base address of the
!                 destination coarray.
!      DST_IMAGE_INDEXThe ID of the destination remote image; must
!                 be a positive number.
!      DEST       intent(in) Array descriptor for the destination
!                 remote image for the bounds and the size. The
!                 base_addr shall not be accessed.
!      DST_VECTOR intent(int)  If not NULL, it contains the
!                 vector subscript of the destination array; the
!                 values are relative to the dimension triplet
!                 of the dest argument.
!      SRC_TOKEN  An opaque pointer identifying the source
!                 coarray.
!      SRC_OFFSET By which amount of bytes the actual data is
!                 shifted compared to the base address of the
!                 source coarray.
       SRC_IMAGE_INDEXThe ID of the source remote image; must be a
!                 positive number.
!      SRC        intent(in) Array descriptor of the local array
!                 to be transferred to the remote image.
!      SRC_VECTOR intent(in) Array descriptor of the local array
!                 to be transferred to the remote image
!      DST_KIND   Kind of the destination argument
!      SRC_KIND   Kind of the source argument
       MAY_REQUIRE_TMPThe variable is false it is known at compile
!                 time that the DEST and SRC either cannot
!                 overlap or overlap (fully or partially) such
!                 that walking SRC and DEST in element wise
!                 element order (honoring the stride value) will
!                 not lead to wrong results.  Otherwise, the
!                 value is true.
  
  _NOTES_
       It is permitted to have image_ids equal; the memory of the send-to
!      and the send-from might (partially) overlap in that case. The
       implementation has to take care that it handles this case, e.g.
!      using `memmove' which handles (partially) overlapping memory. If
       MAY_REQUIRE_TMP is true, the library might additionally create a
       temporary variable, unless additional checks show that this is not
!      required (e.g. because walking backward is possible or because
!      both arrays are contiguous and `memmove' takes care of overlap
       issues).
  
!      Note that the assignment of a scalar to an array is permitted. In
!      addition, the library has to handle numeric-type conversion and
!      for strings, padding and different character kinds.
  
  
  File: gfortran.info,  Node: _gfortran_caf_lock,  Next: _gfortran_caf_unlock,  Prev: _gfortran_caf_sendget,  Up: Function ABI Documentation
  
! 8.2.10 `_gfortran_caf_lock' -- Locking a lock variable
  ------------------------------------------------------
  
  _Description_:
       Acquire a lock on the given image on a scalar locking variable or
!      for the given array element for an array-valued variable. If the
!      AQUIRED_LOCK is `NULL', the function return after having obtained
!      the lock. If it is nonnull, the result is is assigned the value
       true (one) when the lock could be obtained and false (zero)
       otherwise.  Locking a lock variable which has already been locked
       by the same image is an error.
  
  _Syntax_:
!      `void _gfortran_caf_lock (caf_token_t token, size_t index, int
       image_index, int *aquired_lock, int *stat, char *errmsg, int
       errmsg_len)'
  
  _Arguments_:
!      TOKEN      intent(in) An opaque pointer identifying the
!                 coarray.
!      INDEX      Array index; first array index is 0. For
!                 scalars, it is always 0.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number.
!      AQUIRED_LOCKintent(out) If not NULL, it returns whether
!                 lock could be obtained
!      STAT       intent(out) Stores the STAT=; may be NULL
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
       This function is also called for critical blocks; for those, the
--- 4539,4633 ----
       identified by the dst_image_index.
  
  _Syntax_:
!      'void _gfortran_caf_sendget (caf_token_t dst_token, size_t
       dst_offset, int dst_image_index, gfc_descriptor_t *dest,
!      caf_vector_t *dst_vector, caf_token_t src_token, size_t src_offset,
!      int src_image_index, gfc_descriptor_t *src, caf_vector_t
!      *src_vector, int dst_kind, int src_kind, bool may_require_tmp)'
  
  _Arguments_:
!      DST_TOKEN   intent(in) An opaque pointer identifying the
!                  destination coarray.
!      DST_OFFSET  By which amount of bytes the actual data is
!                  shifted compared to the base address of the
!                  destination coarray.
!      DST_IMAGE_INDEXThe ID of the destination remote image; must be
!                  a positive number.
!      DEST        intent(in) Array descriptor for the destination
!                  remote image for the bounds and the size.  The
!                  base_addr shall not be accessed.
!      DST_VECTOR  intent(int) If not NULL, it contains the vector
!                  subscript of the destination array; the values
!                  are relative to the dimension triplet of the
!                  dest argument.
!      SRC_TOKEN   An opaque pointer identifying the source
!                  coarray.
!      SRC_OFFSET  By which amount of bytes the actual data is
!                  shifted compared to the base address of the
!                  source coarray.
       SRC_IMAGE_INDEXThe ID of the source remote image; must be a
!                  positive number.
!      SRC         intent(in) Array descriptor of the local array
!                  to be transferred to the remote image.
!      SRC_VECTOR  intent(in) Array descriptor of the local array
!                  to be transferred to the remote image
!      DST_KIND    Kind of the destination argument
!      SRC_KIND    Kind of the source argument
       MAY_REQUIRE_TMPThe variable is false it is known at compile
!                  time that the DEST and SRC either cannot overlap
!                  or overlap (fully or partially) such that
!                  walking SRC and DEST in element wise element
!                  order (honoring the stride value) will not lead
!                  to wrong results.  Otherwise, the value is true.
  
  _NOTES_
       It is permitted to have image_ids equal; the memory of the send-to
!      and the send-from might (partially) overlap in that case.  The
       implementation has to take care that it handles this case, e.g.
!      using 'memmove' which handles (partially) overlapping memory.  If
       MAY_REQUIRE_TMP is true, the library might additionally create a
       temporary variable, unless additional checks show that this is not
!      required (e.g.  because walking backward is possible or because
!      both arrays are contiguous and 'memmove' takes care of overlap
       issues).
  
!      Note that the assignment of a scalar to an array is permitted.  In
!      addition, the library has to handle numeric-type conversion and for
!      strings, padding and different character kinds.
  
  
  File: gfortran.info,  Node: _gfortran_caf_lock,  Next: _gfortran_caf_unlock,  Prev: _gfortran_caf_sendget,  Up: Function ABI Documentation
  
! 8.2.10 '_gfortran_caf_lock' -- Locking a lock variable
  ------------------------------------------------------
  
  _Description_:
       Acquire a lock on the given image on a scalar locking variable or
!      for the given array element for an array-valued variable.  If the
!      AQUIRED_LOCK is 'NULL', the function return after having obtained
!      the lock.  If it is nonnull, the result is is assigned the value
       true (one) when the lock could be obtained and false (zero)
       otherwise.  Locking a lock variable which has already been locked
       by the same image is an error.
  
  _Syntax_:
!      'void _gfortran_caf_lock (caf_token_t token, size_t index, int
       image_index, int *aquired_lock, int *stat, char *errmsg, int
       errmsg_len)'
  
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      INDEX       Array index; first array index is 0.  For
!                  scalars, it is always 0.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number.
!      AQUIRED_LOCKintent(out) If not NULL, it returns whether lock
!                  could be obtained
!      STAT        intent(out) Stores the STAT=; may be NULL
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
       This function is also called for critical blocks; for those, the
*************** _NOTES_
*** 4683,4713 ****
  
  File: gfortran.info,  Node: _gfortran_caf_unlock,  Next: _gfortran_caf_event_post,  Prev: _gfortran_caf_lock,  Up: Function ABI Documentation
  
! 8.2.11 `_gfortran_caf_lock' -- Unlocking a lock variable
  --------------------------------------------------------
  
  _Description_:
       Release a lock on the given image on a scalar locking variable or
       for the given array element for an array-valued variable.
!      Unlocking a lock variable which is unlocked or has been locked by
!      a different image is an error.
  
  _Syntax_:
!      `void _gfortran_caf_unlock (caf_token_t token, size_t index, int
       image_index, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      TOKEN      intent(in) An opaque pointer identifying the
!                 coarray.
!      INDEX      Array index; first array index is 0. For
!                 scalars, it is always 0.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number.
!      STAT       intent(out) For allocatable coarrays, stores
!                 the STAT=; may be NULL
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
       This function is also called for critical block; for those, the
--- 4638,4668 ----
  
  File: gfortran.info,  Node: _gfortran_caf_unlock,  Next: _gfortran_caf_event_post,  Prev: _gfortran_caf_lock,  Up: Function ABI Documentation
  
! 8.2.11 '_gfortran_caf_lock' -- Unlocking a lock variable
  --------------------------------------------------------
  
  _Description_:
       Release a lock on the given image on a scalar locking variable or
       for the given array element for an array-valued variable.
!      Unlocking a lock variable which is unlocked or has been locked by a
!      different image is an error.
  
  _Syntax_:
!      'void _gfortran_caf_unlock (caf_token_t token, size_t index, int
       image_index, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      INDEX       Array index; first array index is 0.  For
!                  scalars, it is always 0.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number.
!      STAT        intent(out) For allocatable coarrays, stores the
!                  STAT=; may be NULL
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
       This function is also called for critical block; for those, the
*************** _NOTES_
*** 4718,4757 ****
  
  File: gfortran.info,  Node: _gfortran_caf_event_post,  Next: _gfortran_caf_event_wait,  Prev: _gfortran_caf_unlock,  Up: Function ABI Documentation
  
! 8.2.12 `_gfortran_caf_event_post' -- Post an event
  --------------------------------------------------
  
  _Description_:
       Increment the event count of the specified event variable.
  
  _Syntax_:
!      `void _gfortran_caf_event_post (caf_token_t token, size_t index,
       int image_index, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      TOKEN      intent(in) An opaque pointer identifying the
!                 coarray.
!      INDEX      Array index; first array index is 0. For
!                 scalars, it is always 0.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number; zero indicates the current image when
!                 accessed noncoindexed.
!      STAT       intent(out) Stores the STAT=; may be NULL
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
       This acts like an atomic add of one to the remote image's event
!      variable.  The statement is an image-control statement but does
!      not imply sync memory.  Still, all preceeding push communications
!      of this image to the specified remote image has to be completed
!      before `event_wait' on the remote image returns.
  
  
  File: gfortran.info,  Node: _gfortran_caf_event_wait,  Next: _gfortran_caf_event_query,  Prev: _gfortran_caf_event_post,  Up: Function ABI Documentation
  
! 8.2.13 `_gfortran_caf_event_wait' -- Wait that an event occurred
  ----------------------------------------------------------------
  
  _Description_:
--- 4673,4712 ----
  
  File: gfortran.info,  Node: _gfortran_caf_event_post,  Next: _gfortran_caf_event_wait,  Prev: _gfortran_caf_unlock,  Up: Function ABI Documentation
  
! 8.2.12 '_gfortran_caf_event_post' -- Post an event
  --------------------------------------------------
  
  _Description_:
       Increment the event count of the specified event variable.
  
  _Syntax_:
!      'void _gfortran_caf_event_post (caf_token_t token, size_t index,
       int image_index, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      INDEX       Array index; first array index is 0.  For
!                  scalars, it is always 0.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number; zero indicates the current image when
!                  accessed noncoindexed.
!      STAT        intent(out) Stores the STAT=; may be NULL
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
       This acts like an atomic add of one to the remote image's event
!      variable.  The statement is an image-control statement but does not
!      imply sync memory.  Still, all preceeding push communications of
!      this image to the specified remote image has to be completed before
!      'event_wait' on the remote image returns.
  
  
  File: gfortran.info,  Node: _gfortran_caf_event_wait,  Next: _gfortran_caf_event_query,  Prev: _gfortran_caf_event_post,  Up: Function ABI Documentation
  
! 8.2.13 '_gfortran_caf_event_wait' -- Wait that an event occurred
  ----------------------------------------------------------------
  
  _Description_:
*************** _Description_:
*** 4760,4825 ****
       amount and return.
  
  _Syntax_:
!      `void _gfortran_caf_event_wait (caf_token_t token, size_t index,
       int until_count, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      TOKEN      intent(in) An opaque pointer identifying the
!                 coarray.
!      INDEX      Array index; first array index is 0. For
!                 scalars, it is always 0.
!      UNTIL_COUNTThe number of events which have to be available
!                 before the function returns.
!      STAT       intent(out) Stores the STAT=; may be NULL
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
!      This function only operates on a local coarray. It acts like a
       loop checking atomically the value of the event variable, breaking
       if the value is greater or equal the requested number of counts.
       Before the function returns, the event variable has to be
       decremented by the requested UNTIL_COUNT value.  A possible
       implementation would be a busy loop for a certain number of spins
!      (possibly depending on the number of threads relative to the
!      number of available cores) followed by other waiting strategy such
!      as a sleeping wait (possibly with an increasing number of sleep
!      time) or, if possible, a futex wait.
  
!      The statement is an image-control statement but does not imply
!      sync memory.  Still, all preceeding push communications to this
!      image of images having issued a `event_push' have to be completed
!      before this function returns.
  
  
  File: gfortran.info,  Node: _gfortran_caf_event_query,  Next: _gfortran_caf_sync_all,  Prev: _gfortran_caf_event_wait,  Up: Function ABI Documentation
  
! 8.2.14 `_gfortran_caf_event_query' -- Query event count
  -------------------------------------------------------
  
  _Description_:
       Return the event count of the specified event count.
  
  _Syntax_:
!      `void _gfortran_caf_event_query (caf_token_t token, size_t index,
       int image_index, int *count, int *stat)'
  
  _Arguments_:
!      TOKEN      intent(in) An opaque pointer identifying the
!                 coarray.
!      INDEX      Array index; first array index is 0. For
!                 scalars, it is always 0.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number; zero indicates the current image when
!                 accessed noncoindexed.
!      COUNT      intent(out) The number of events currently
!                 posted to the event variable
!      STAT       intent(out) Stores the STAT=; may be NULL
  
  _NOTES_
       The typical use is to check the local even variable to only call
!      `event_wait' when the data is available. However, a coindexed
       variable is permitted; there is no ordering or synchronization
       implied.  It acts like an atomic fetch of the value of the event
       variable.
--- 4715,4780 ----
       amount and return.
  
  _Syntax_:
!      'void _gfortran_caf_event_wait (caf_token_t token, size_t index,
       int until_count, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      INDEX       Array index; first array index is 0.  For
!                  scalars, it is always 0.
!      UNTIL_COUNT The number of events which have to be available
!                  before the function returns.
!      STAT        intent(out) Stores the STAT=; may be NULL
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
!      This function only operates on a local coarray.  It acts like a
       loop checking atomically the value of the event variable, breaking
       if the value is greater or equal the requested number of counts.
       Before the function returns, the event variable has to be
       decremented by the requested UNTIL_COUNT value.  A possible
       implementation would be a busy loop for a certain number of spins
!      (possibly depending on the number of threads relative to the number
!      of available cores) followed by other waiting strategy such as a
!      sleeping wait (possibly with an increasing number of sleep time)
!      or, if possible, a futex wait.
  
!      The statement is an image-control statement but does not imply sync
!      memory.  Still, all preceeding push communications to this image of
!      images having issued a 'event_push' have to be completed before
!      this function returns.
  
  
  File: gfortran.info,  Node: _gfortran_caf_event_query,  Next: _gfortran_caf_sync_all,  Prev: _gfortran_caf_event_wait,  Up: Function ABI Documentation
  
! 8.2.14 '_gfortran_caf_event_query' -- Query event count
  -------------------------------------------------------
  
  _Description_:
       Return the event count of the specified event count.
  
  _Syntax_:
!      'void _gfortran_caf_event_query (caf_token_t token, size_t index,
       int image_index, int *count, int *stat)'
  
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      INDEX       Array index; first array index is 0.  For
!                  scalars, it is always 0.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number; zero indicates the current image when
!                  accessed noncoindexed.
!      COUNT       intent(out) The number of events currently
!                  posted to the event variable
!      STAT        intent(out) Stores the STAT=; may be NULL
  
  _NOTES_
       The typical use is to check the local even variable to only call
!      'event_wait' when the data is available.  However, a coindexed
       variable is permitted; there is no ordering or synchronization
       implied.  It acts like an atomic fetch of the value of the event
       variable.
*************** _NOTES_
*** 4827,4981 ****
  
  File: gfortran.info,  Node: _gfortran_caf_sync_all,  Next: _gfortran_caf_sync_images,  Prev: _gfortran_caf_event_query,  Up: Function ABI Documentation
  
! 8.2.15 `_gfortran_caf_sync_all' -- All-image barrier
  ----------------------------------------------------
  
  _Description_:
!      Synchronization of all images in the current team; the program
!      only continues on a given image after this function has been
!      called on all images of the current team.  Additionally, it
!      ensures that all pending data transfers of previous segment have
!      completed.
  
  _Syntax_:
!      `void _gfortran_caf_sync_all (int *stat, char *errmsg, int
       errmsg_len)'
  
  _Arguments_:
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  
  File: gfortran.info,  Node: _gfortran_caf_sync_images,  Next: _gfortran_caf_sync_memory,  Prev: _gfortran_caf_sync_all,  Up: Function ABI Documentation
  
! 8.2.16 `_gfortran_caf_sync_images' -- Barrier for selected images
  -----------------------------------------------------------------
  
  _Description_:
       Synchronization between the specified images; the program only
       continues on a given image after this function has been called on
!      all images specified for that image. Note that one image can wait
!      for all other images in the current team (e.g. via `sync
       images(*)') while those only wait for that specific image.
!      Additionally, `sync images' it ensures that all pending data
       transfers of previous segment have completed.
  
  _Syntax_:
!      `void _gfortran_caf_sync_images (int count, int images[], int
       *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      COUNT      the number of images which are provided in the
!                 next argument.  For a zero-sized array, the
!                 value is zero.  For `sync images (*)', the
!                 value is -1.
!      IMAGES     intent(in) an array with the images provided
!                 by the user. If COUNT is zero, a NULL pointer
!                 is passed.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  
  File: gfortran.info,  Node: _gfortran_caf_sync_memory,  Next: _gfortran_caf_error_stop,  Prev: _gfortran_caf_sync_images,  Up: Function ABI Documentation
  
! 8.2.17 `_gfortran_caf_sync_memory' -- Wait for completion of segment-memory operations
  --------------------------------------------------------------------------------------
  
  _Description_:
!      Acts as optimization barrier between different segments. It also
       ensures that all pending memory operations of this image have been
       completed.
  
  _Syntax_:
!      `void _gfortran_caf_sync_memory (int *stat, char *errmsg, int
       errmsg_len)'
  
  _Arguments_:
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTE_ A simple implementation could be
!      `__asm__ __volatile__ ("":::"memory")' to prevent code movements.
  
  
  File: gfortran.info,  Node: _gfortran_caf_error_stop,  Next: _gfortran_caf_error_stop_str,  Prev: _gfortran_caf_sync_memory,  Up: Function ABI Documentation
  
! 8.2.18 `_gfortran_caf_error_stop' -- Error termination with exit code
  ---------------------------------------------------------------------
  
  _Description_:
!      Invoked for an `ERROR STOP' statement which has an integer
       argument.  The function should terminate the program with the
       specified exit code.
  
  _Syntax_:
!      `void _gfortran_caf_error_stop (int32_t error)'
  
  _Arguments_:
!      ERROR      the exit status to be used.
  
  
  File: gfortran.info,  Node: _gfortran_caf_error_stop_str,  Next: _gfortran_caf_atomic_define,  Prev: _gfortran_caf_error_stop,  Up: Function ABI Documentation
  
! 8.2.19 `_gfortran_caf_error_stop_str' -- Error termination with string
  ----------------------------------------------------------------------
  
  _Description_:
!      Invoked for an `ERROR STOP' statement which has a string as
       argument.  The function should terminate the program with a
       nonzero-exit code.
  
  _Syntax_:
!      `void _gfortran_caf_error_stop (const char *string, int32_t len)'
  
  _Arguments_:
!      STRING     the error message (not zero terminated)
!      LEN        the length of the string
  
  
  File: gfortran.info,  Node: _gfortran_caf_atomic_define,  Next: _gfortran_caf_atomic_ref,  Prev: _gfortran_caf_error_stop_str,  Up: Function ABI Documentation
  
! 8.2.20 `_gfortran_caf_atomic_define' -- Atomic variable assignment
  ------------------------------------------------------------------
  
  _Description_:
       Assign atomically a value to an integer or logical variable.
  
  _Syntax_:
!      `void _gfortran_caf_atomic_define (caf_token_t token, size_t
       offset, int image_index, void *value, int *stat, int type, int
       kind)'
  
  _Arguments_:
!      TOKEN      intent(in) An opaque pointer identifying the
!                 coarray.
!      OFFSET     By which amount of bytes the actual data is
!                 shifted compared to the base address of the
!                 coarray.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number; zero indicates the current image when
!                 used noncoindexed.
!      VALUE      intent(in) the value to be assigned, passed by
!                 reference.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      TYPE       the data type, i.e. `BT_INTEGER' (1) or
!                 `BT_LOGICAL' (2).
!      KIND       The kind value (only 4; always `int')
  
  
  File: gfortran.info,  Node: _gfortran_caf_atomic_ref,  Next: _gfortran_caf_atomic_cas,  Prev: _gfortran_caf_atomic_define,  Up: Function ABI Documentation
  
! 8.2.21 `_gfortran_caf_atomic_ref' -- Atomic variable reference
  --------------------------------------------------------------
  
  _Description_:
--- 4782,4935 ----
  
  File: gfortran.info,  Node: _gfortran_caf_sync_all,  Next: _gfortran_caf_sync_images,  Prev: _gfortran_caf_event_query,  Up: Function ABI Documentation
  
! 8.2.15 '_gfortran_caf_sync_all' -- All-image barrier
  ----------------------------------------------------
  
  _Description_:
!      Synchronization of all images in the current team; the program only
!      continues on a given image after this function has been called on
!      all images of the current team.  Additionally, it ensures that all
!      pending data transfers of previous segment have completed.
  
  _Syntax_:
!      'void _gfortran_caf_sync_all (int *stat, char *errmsg, int
       errmsg_len)'
  
  _Arguments_:
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  
  File: gfortran.info,  Node: _gfortran_caf_sync_images,  Next: _gfortran_caf_sync_memory,  Prev: _gfortran_caf_sync_all,  Up: Function ABI Documentation
  
! 8.2.16 '_gfortran_caf_sync_images' -- Barrier for selected images
  -----------------------------------------------------------------
  
  _Description_:
       Synchronization between the specified images; the program only
       continues on a given image after this function has been called on
!      all images specified for that image.  Note that one image can wait
!      for all other images in the current team (e.g.  via 'sync
       images(*)') while those only wait for that specific image.
!      Additionally, 'sync images' it ensures that all pending data
       transfers of previous segment have completed.
  
  _Syntax_:
!      'void _gfortran_caf_sync_images (int count, int images[], int
       *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      COUNT       the number of images which are provided in the
!                  next argument.  For a zero-sized array, the
!                  value is zero.  For 'sync images (*)', the value
!                  is -1.
!      IMAGES      intent(in) an array with the images provided by
!                  the user.  If COUNT is zero, a NULL pointer is
!                  passed.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  
  File: gfortran.info,  Node: _gfortran_caf_sync_memory,  Next: _gfortran_caf_error_stop,  Prev: _gfortran_caf_sync_images,  Up: Function ABI Documentation
  
! 8.2.17 '_gfortran_caf_sync_memory' -- Wait for completion of segment-memory operations
  --------------------------------------------------------------------------------------
  
  _Description_:
!      Acts as optimization barrier between different segments.  It also
       ensures that all pending memory operations of this image have been
       completed.
  
  _Syntax_:
!      'void _gfortran_caf_sync_memory (int *stat, char *errmsg, int
       errmsg_len)'
  
  _Arguments_:
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTE_ A simple implementation could be
!      '__asm__ __volatile__ ("":::"memory")' to prevent code movements.
  
  
  File: gfortran.info,  Node: _gfortran_caf_error_stop,  Next: _gfortran_caf_error_stop_str,  Prev: _gfortran_caf_sync_memory,  Up: Function ABI Documentation
  
! 8.2.18 '_gfortran_caf_error_stop' -- Error termination with exit code
  ---------------------------------------------------------------------
  
  _Description_:
!      Invoked for an 'ERROR STOP' statement which has an integer
       argument.  The function should terminate the program with the
       specified exit code.
  
  _Syntax_:
!      'void _gfortran_caf_error_stop (int32_t error)'
  
  _Arguments_:
!      ERROR       the exit status to be used.
  
  
  File: gfortran.info,  Node: _gfortran_caf_error_stop_str,  Next: _gfortran_caf_atomic_define,  Prev: _gfortran_caf_error_stop,  Up: Function ABI Documentation
  
! 8.2.19 '_gfortran_caf_error_stop_str' -- Error termination with string
  ----------------------------------------------------------------------
  
  _Description_:
!      Invoked for an 'ERROR STOP' statement which has a string as
       argument.  The function should terminate the program with a
       nonzero-exit code.
  
  _Syntax_:
!      'void _gfortran_caf_error_stop (const char *string, int32_t len)'
  
  _Arguments_:
!      STRING      the error message (not zero terminated)
!      LEN         the length of the string
  
  
  File: gfortran.info,  Node: _gfortran_caf_atomic_define,  Next: _gfortran_caf_atomic_ref,  Prev: _gfortran_caf_error_stop_str,  Up: Function ABI Documentation
  
! 8.2.20 '_gfortran_caf_atomic_define' -- Atomic variable assignment
  ------------------------------------------------------------------
  
  _Description_:
       Assign atomically a value to an integer or logical variable.
  
  _Syntax_:
!      'void _gfortran_caf_atomic_define (caf_token_t token, size_t
       offset, int image_index, void *value, int *stat, int type, int
       kind)'
  
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      OFFSET      By which amount of bytes the actual data is
!                  shifted compared to the base address of the
!                  coarray.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number; zero indicates the current image when
!                  used noncoindexed.
!      VALUE       intent(in) the value to be assigned, passed by
!                  reference.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      TYPE        the data type, i.e.  'BT_INTEGER' (1) or
!                  'BT_LOGICAL' (2).
!      KIND        The kind value (only 4; always 'int')
  
  
  File: gfortran.info,  Node: _gfortran_caf_atomic_ref,  Next: _gfortran_caf_atomic_cas,  Prev: _gfortran_caf_atomic_define,  Up: Function ABI Documentation
  
! 8.2.21 '_gfortran_caf_atomic_ref' -- Atomic variable reference
  --------------------------------------------------------------
  
  _Description_:
*************** _Description_:
*** 4983,5014 ****
       variable.
  
  _Syntax_:
!      `void _gfortran_caf_atomic_ref (caf_token_t token, size_t offset,
       int image_index, void *value, int *stat, int type, int kind)'
  
  _Arguments_:
- 
  _Arguments_:
!      TOKEN      intent(in) An opaque pointer identifying the
!                 coarray.
!      OFFSET     By which amount of bytes the actual data is
!                 shifted compared to the base address of the
!                 coarray.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number; zero indicates the current image when
!                 used noncoindexed.
!      VALUE      intent(out) The variable assigned the
!                 atomically referenced variable.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      TYPE       the data type, i.e. `BT_INTEGER' (1) or
!                 `BT_LOGICAL' (2).
!      KIND       The kind value (only 4; always `int')
  
  
  File: gfortran.info,  Node: _gfortran_caf_atomic_cas,  Next: _gfortran_caf_atomic_op,  Prev: _gfortran_caf_atomic_ref,  Up: Function ABI Documentation
  
! 8.2.22 `_gfortran_caf_atomic_cas' -- Atomic compare and swap
  ------------------------------------------------------------
  
  _Description_:
--- 4937,4967 ----
       variable.
  
  _Syntax_:
!      'void _gfortran_caf_atomic_ref (caf_token_t token, size_t offset,
       int image_index, void *value, int *stat, int type, int kind)'
  
  _Arguments_:
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      OFFSET      By which amount of bytes the actual data is
!                  shifted compared to the base address of the
!                  coarray.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number; zero indicates the current image when
!                  used noncoindexed.
!      VALUE       intent(out) The variable assigned the atomically
!                  referenced variable.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      TYPE        the data type, i.e.  'BT_INTEGER' (1) or
!                  'BT_LOGICAL' (2).
!      KIND        The kind value (only 4; always 'int')
  
  
  File: gfortran.info,  Node: _gfortran_caf_atomic_cas,  Next: _gfortran_caf_atomic_op,  Prev: _gfortran_caf_atomic_ref,  Up: Function ABI Documentation
  
! 8.2.22 '_gfortran_caf_atomic_cas' -- Atomic compare and swap
  ------------------------------------------------------------
  
  _Description_:
*************** _Description_:
*** 5017,5148 ****
       the latter has the value specified by the passed condition value.
  
  _Syntax_:
!      `void _gfortran_caf_atomic_cas (caf_token_t token, size_t offset,
       int image_index, void *old, void *compare, void *new_val, int
       *stat, int type, int kind)'
  
  _Arguments_:
!      TOKEN      intent(in) An opaque pointer identifying the
!                 coarray.
!      OFFSET     By which amount of bytes the actual data is
!                 shifted compared to the base address of the
!                 coarray.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number; zero indicates the current image when
!                 used noncoindexed.
!      OLD        intent(out) the value which the atomic
!                 variable had just before the cas operation.
!      COMPARE    intent(in) The value used for comparision.
!      NEW_VAL    intent(in) The new value for the atomic
!                 variable, assigned to the atomic variable, if
!                 `compare' equals the value of the atomic
!                 variable.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      TYPE       the data type, i.e. `BT_INTEGER' (1) or
!                 `BT_LOGICAL' (2).
!      KIND       The kind value (only 4; always `int')
  
  
  File: gfortran.info,  Node: _gfortran_caf_atomic_op,  Next: _gfortran_caf_co_broadcast,  Prev: _gfortran_caf_atomic_cas,  Up: Function ABI Documentation
  
! 8.2.23 `_gfortran_caf_atomic_op' -- Atomic operation
  ----------------------------------------------------
  
  _Description_:
       Apply an operation atomically to an atomic integer or logical
       variable.  After the operation, OLD contains the value just before
       the operation, which, respectively, adds (GFC_CAF_ATOMIC_ADD)
!      atomically the `value' to the atomic integer variable or does a
       bitwise AND, OR or exclusive OR of the between the atomic variable
       and VALUE; the result is then stored in the atomic variable.
  
  _Syntax_:
!      `void _gfortran_caf_atomic_op (int op, caf_token_t token, size_t
       offset, int image_index, void *value, void *old, int *stat, int
       type, int kind)'
  
  _Arguments_:
!      OP         the operation to be performed; possible values
!                 `GFC_CAF_ATOMIC_ADD' (1), `GFC_CAF_ATOMIC_AND'
!                 (2), `GFC_CAF_ATOMIC_OR' (3),
!                 `GFC_CAF_ATOMIC_XOR' (4).
!      TOKEN      intent(in) An opaque pointer identifying the
!                 coarray.
!      OFFSET     By which amount of bytes the actual data is
!                 shifted compared to the base address of the
!                 coarray.
!      IMAGE_INDEXThe ID of the remote image; must be a positive
!                 number; zero indicates the current image when
!                 used noncoindexed.
!      OLD        intent(out) the value which the atomic
!                 variable had just before the atomic operation.
!      VAL        intent(in) The new value for the atomic
!                 variable, assigned to the atomic variable, if
!                 `compare' equals the value of the atomic
!                 variable.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      TYPE       the data type, i.e. `BT_INTEGER' (1) or
!                 `BT_LOGICAL' (2).
!      KIND       The kind value (only 4; always `int')
  
  
  File: gfortran.info,  Node: _gfortran_caf_co_broadcast,  Next: _gfortran_caf_co_max,  Prev: _gfortran_caf_atomic_op,  Up: Function ABI Documentation
  
! 8.2.24 `_gfortran_caf_co_broadcast' -- Sending data to all images
  -----------------------------------------------------------------
  
  _Description_:
       Distribute a value from a given image to all other images in the
!      team. Has to be called collectively.
  
  _Syntax_:
!      `void _gfortran_caf_co_broadcast (gfc_descriptor_t *a, int
       source_image, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      A          intent(inout) And array descriptor with the
!                 data to be breoadcasted (on SOURCE_IMAGE) or
!                 to be received (other images).
       SOURCE_IMAGEThe ID of the image from which the data should
!                 be taken.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  
  File: gfortran.info,  Node: _gfortran_caf_co_max,  Next: _gfortran_caf_co_min,  Prev: _gfortran_caf_co_broadcast,  Up: Function ABI Documentation
  
! 8.2.25 `_gfortran_caf_co_max' -- Collective maximum reduction
  -------------------------------------------------------------
  
  _Description_:
       Calculates the for the each array element of the variable A the
!      maximum value for that element in the current team; if
!      RESULT_IMAGE has the value 0, the result shall be stored on all
!      images, otherwise, only on the specified image. This function
!      operates on numeric values and character strings.
  
  _Syntax_:
!      `void _gfortran_caf_co_max (gfc_descriptor_t *a, int result_image,
       int *stat, char *errmsg, int a_len, int errmsg_len)'
  
  _Arguments_:
!      A          intent(inout) And array descriptor with the
!                 data to be breoadcasted (on SOURCE_IMAGE) or
!                 to be received (other images).
       RESULT_IMAGEThe ID of the image to which the reduced value
!                 should be copied to; if zero, it has to be
!                 copied to all images.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      A_LEN      The string length of argument A.
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
       If RESULT_IMAGE is nonzero, the value on all images except of the
--- 4970,5101 ----
       the latter has the value specified by the passed condition value.
  
  _Syntax_:
!      'void _gfortran_caf_atomic_cas (caf_token_t token, size_t offset,
       int image_index, void *old, void *compare, void *new_val, int
       *stat, int type, int kind)'
  
  _Arguments_:
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      OFFSET      By which amount of bytes the actual data is
!                  shifted compared to the base address of the
!                  coarray.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number; zero indicates the current image when
!                  used noncoindexed.
!      OLD         intent(out) the value which the atomic variable
!                  had just before the cas operation.
!      COMPARE     intent(in) The value used for comparision.
!      NEW_VAL     intent(in) The new value for the atomic
!                  variable, assigned to the atomic variable, if
!                  'compare' equals the value of the atomic
!                  variable.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      TYPE        the data type, i.e.  'BT_INTEGER' (1) or
!                  'BT_LOGICAL' (2).
!      KIND        The kind value (only 4; always 'int')
  
  
  File: gfortran.info,  Node: _gfortran_caf_atomic_op,  Next: _gfortran_caf_co_broadcast,  Prev: _gfortran_caf_atomic_cas,  Up: Function ABI Documentation
  
! 8.2.23 '_gfortran_caf_atomic_op' -- Atomic operation
  ----------------------------------------------------
  
  _Description_:
       Apply an operation atomically to an atomic integer or logical
       variable.  After the operation, OLD contains the value just before
       the operation, which, respectively, adds (GFC_CAF_ATOMIC_ADD)
!      atomically the 'value' to the atomic integer variable or does a
       bitwise AND, OR or exclusive OR of the between the atomic variable
       and VALUE; the result is then stored in the atomic variable.
  
  _Syntax_:
!      'void _gfortran_caf_atomic_op (int op, caf_token_t token, size_t
       offset, int image_index, void *value, void *old, int *stat, int
       type, int kind)'
  
  _Arguments_:
!      OP          the operation to be performed; possible values
!                  'GFC_CAF_ATOMIC_ADD' (1), 'GFC_CAF_ATOMIC_AND'
!                  (2), 'GFC_CAF_ATOMIC_OR' (3),
!                  'GFC_CAF_ATOMIC_XOR' (4).
!      TOKEN       intent(in) An opaque pointer identifying the
!                  coarray.
!      OFFSET      By which amount of bytes the actual data is
!                  shifted compared to the base address of the
!                  coarray.
!      IMAGE_INDEX The ID of the remote image; must be a positive
!                  number; zero indicates the current image when
!                  used noncoindexed.
!      OLD         intent(out) the value which the atomic variable
!                  had just before the atomic operation.
!      VAL         intent(in) The new value for the atomic
!                  variable, assigned to the atomic variable, if
!                  'compare' equals the value of the atomic
!                  variable.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      TYPE        the data type, i.e.  'BT_INTEGER' (1) or
!                  'BT_LOGICAL' (2).
!      KIND        The kind value (only 4; always 'int')
  
  
  File: gfortran.info,  Node: _gfortran_caf_co_broadcast,  Next: _gfortran_caf_co_max,  Prev: _gfortran_caf_atomic_op,  Up: Function ABI Documentation
  
! 8.2.24 '_gfortran_caf_co_broadcast' -- Sending data to all images
  -----------------------------------------------------------------
  
  _Description_:
       Distribute a value from a given image to all other images in the
!      team.  Has to be called collectively.
  
  _Syntax_:
!      'void _gfortran_caf_co_broadcast (gfc_descriptor_t *a, int
       source_image, int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      A           intent(inout) And array descriptor with the data
!                  to be breoadcasted (on SOURCE_IMAGE) or to be
!                  received (other images).
       SOURCE_IMAGEThe ID of the image from which the data should
!                  be taken.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  
  File: gfortran.info,  Node: _gfortran_caf_co_max,  Next: _gfortran_caf_co_min,  Prev: _gfortran_caf_co_broadcast,  Up: Function ABI Documentation
  
! 8.2.25 '_gfortran_caf_co_max' -- Collective maximum reduction
  -------------------------------------------------------------
  
  _Description_:
       Calculates the for the each array element of the variable A the
!      maximum value for that element in the current team; if RESULT_IMAGE
!      has the value 0, the result shall be stored on all images,
!      otherwise, only on the specified image.  This function operates on
!      numeric values and character strings.
  
  _Syntax_:
!      'void _gfortran_caf_co_max (gfc_descriptor_t *a, int result_image,
       int *stat, char *errmsg, int a_len, int errmsg_len)'
  
  _Arguments_:
!      A           intent(inout) And array descriptor with the data
!                  to be breoadcasted (on SOURCE_IMAGE) or to be
!                  received (other images).
       RESULT_IMAGEThe ID of the image to which the reduced value
!                  should be copied to; if zero, it has to be
!                  copied to all images.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      A_LEN       The string length of argument A.
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
       If RESULT_IMAGE is nonzero, the value on all images except of the
*************** _NOTES_
*** 5152,5184 ****
  
  File: gfortran.info,  Node: _gfortran_caf_co_min,  Next: _gfortran_caf_co_sum,  Prev: _gfortran_caf_co_max,  Up: Function ABI Documentation
  
! 8.2.26 `_gfortran_caf_co_min' -- Collective minimum reduction
  -------------------------------------------------------------
  
  _Description_:
       Calculates the for the each array element of the variable A the
!      minimum value for that element in the current team; if
!      RESULT_IMAGE has the value 0, the result shall be stored on all
!      images, otherwise, only on the specified image. This function
!      operates on numeric values and character strings.
  
  _Syntax_:
!      `void _gfortran_caf_co_min (gfc_descriptor_t *a, int result_image,
       int *stat, char *errmsg, int a_len, int errmsg_len)'
  
  _Arguments_:
!      A          intent(inout) And array descriptor with the
!                 data to be breoadcasted (on SOURCE_IMAGE) or
!                 to be received (other images).
       RESULT_IMAGEThe ID of the image to which the reduced value
!                 should be copied to; if zero, it has to be
!                 copied to all images.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      A_LEN      The string length of argument A.
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
       If RESULT_IMAGE is nonzero, the value on all images except of the
--- 5105,5137 ----
  
  File: gfortran.info,  Node: _gfortran_caf_co_min,  Next: _gfortran_caf_co_sum,  Prev: _gfortran_caf_co_max,  Up: Function ABI Documentation
  
! 8.2.26 '_gfortran_caf_co_min' -- Collective minimum reduction
  -------------------------------------------------------------
  
  _Description_:
       Calculates the for the each array element of the variable A the
!      minimum value for that element in the current team; if RESULT_IMAGE
!      has the value 0, the result shall be stored on all images,
!      otherwise, only on the specified image.  This function operates on
!      numeric values and character strings.
  
  _Syntax_:
!      'void _gfortran_caf_co_min (gfc_descriptor_t *a, int result_image,
       int *stat, char *errmsg, int a_len, int errmsg_len)'
  
  _Arguments_:
!      A           intent(inout) And array descriptor with the data
!                  to be breoadcasted (on SOURCE_IMAGE) or to be
!                  received (other images).
       RESULT_IMAGEThe ID of the image to which the reduced value
!                  should be copied to; if zero, it has to be
!                  copied to all images.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      A_LEN       The string length of argument A.
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
       If RESULT_IMAGE is nonzero, the value on all images except of the
*************** _NOTES_
*** 5188,5218 ****
  
  File: gfortran.info,  Node: _gfortran_caf_co_sum,  Next: _gfortran_caf_co_reduce,  Prev: _gfortran_caf_co_min,  Up: Function ABI Documentation
  
! 8.2.27 `_gfortran_caf_co_sum' -- Collective summing reduction
  -------------------------------------------------------------
  
  _Description_:
       Calculates the for the each array element of the variable A the sum
       value for that element in the current team; if RESULT_IMAGE has the
       value 0, the result shall be stored on all images, otherwise, only
!      on the specified image. This function operates on numeric values.
  
  _Syntax_:
!      `void _gfortran_caf_co_sum (gfc_descriptor_t *a, int result_image,
       int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      A          intent(inout) And array descriptor with the
!                 data to be breoadcasted (on SOURCE_IMAGE) or
!                 to be received (other images).
       RESULT_IMAGEThe ID of the image to which the reduced value
!                 should be copied to; if zero, it has to be
!                 copied to all images.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
       If RESULT_IMAGE is nonzero, the value on all images except of the
--- 5141,5171 ----
  
  File: gfortran.info,  Node: _gfortran_caf_co_sum,  Next: _gfortran_caf_co_reduce,  Prev: _gfortran_caf_co_min,  Up: Function ABI Documentation
  
! 8.2.27 '_gfortran_caf_co_sum' -- Collective summing reduction
  -------------------------------------------------------------
  
  _Description_:
       Calculates the for the each array element of the variable A the sum
       value for that element in the current team; if RESULT_IMAGE has the
       value 0, the result shall be stored on all images, otherwise, only
!      on the specified image.  This function operates on numeric values.
  
  _Syntax_:
!      'void _gfortran_caf_co_sum (gfc_descriptor_t *a, int result_image,
       int *stat, char *errmsg, int errmsg_len)'
  
  _Arguments_:
!      A           intent(inout) And array descriptor with the data
!                  to be breoadcasted (on SOURCE_IMAGE) or to be
!                  received (other images).
       RESULT_IMAGEThe ID of the image to which the reduced value
!                  should be copied to; if zero, it has to be
!                  copied to all images.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
       If RESULT_IMAGE is nonzero, the value on all images except of the
*************** _NOTES_
*** 5222,5276 ****
  
  File: gfortran.info,  Node: _gfortran_caf_co_reduce,  Prev: _gfortran_caf_co_sum,  Up: Function ABI Documentation
  
! 8.2.28 `_gfortran_caf_co_reduce' -- Generic collective reduction
  ----------------------------------------------------------------
  
  _Description_:
       Calculates the for the each array element of the variable A the
       reduction value for that element in the current team; if
       RESULT_IMAGE has the value 0, the result shall be stored on all
!      images, otherwise, only on the specified image. The OPR is a pure
       function doing a mathematically commutative and associative
       operation.
  
       The OPR_FLAGS denote the following; the values are bitwise ored.
!      `GFC_CAF_BYREF' (1) if the result should be returned by value;
!      `GFC_CAF_HIDDENLEN' (2) whether the result and argument string
!      lengths shall be specified as hidden argument; `GFC_CAF_ARG_VALUE'
       (4) whether the arguments shall be passed by value,
!      `GFC_CAF_ARG_DESC' (8) whether the arguments shall be passed by
       descriptor.
  
  _Syntax_:
!      `void _gfortran_caf_co_reduce (gfc_descriptor_t *a, void * (*opr)
       (void *, void *), int opr_flags, int result_image, int *stat, char
       *errmsg, int a_len, int errmsg_len)'
  
  _Arguments_:
!      OPR        Function pointer to the reduction function.
!      OPR_FLAGS  Flags regarding the reduction function
!      A          intent(inout) And array descriptor with the
!                 data to be breoadcasted (on SOURCE_IMAGE) or
!                 to be received (other images).
       RESULT_IMAGEThe ID of the image to which the reduced value
!                 should be copied to; if zero, it has to be
!                 copied to all images.
!      STAT       intent(out) Stores the status STAT= and may be
!                 NULL.
!      ERRMSG     intent(out) When an error occurs, this will be
!                 set to an error message; may be NULL
!      A_LEN      The string length of argument A.
!      ERRMSG_LEN the buffer size of errmsg.
  
  _NOTES_
       If RESULT_IMAGE is nonzero, the value on all images except of the
       specified one become undefined; hence, the library may make use of
       this.  For character arguments, the result is passed as first
       argument, followed by the result string length, next come the two
!      string arguments, followed by the two hidden arguments. With C
!      binding, there are no hidden arguments and by-reference passing
!      and either only a single character is passed or an array
!      descriptor.
  
  
  File: gfortran.info,  Node: Intrinsic Procedures,  Next: Intrinsic Modules,  Prev: Coarray Programming,  Up: Top
--- 5175,5228 ----
  
  File: gfortran.info,  Node: _gfortran_caf_co_reduce,  Prev: _gfortran_caf_co_sum,  Up: Function ABI Documentation
  
! 8.2.28 '_gfortran_caf_co_reduce' -- Generic collective reduction
  ----------------------------------------------------------------
  
  _Description_:
       Calculates the for the each array element of the variable A the
       reduction value for that element in the current team; if
       RESULT_IMAGE has the value 0, the result shall be stored on all
!      images, otherwise, only on the specified image.  The OPR is a pure
       function doing a mathematically commutative and associative
       operation.
  
       The OPR_FLAGS denote the following; the values are bitwise ored.
!      'GFC_CAF_BYREF' (1) if the result should be returned by value;
!      'GFC_CAF_HIDDENLEN' (2) whether the result and argument string
!      lengths shall be specified as hidden argument; 'GFC_CAF_ARG_VALUE'
       (4) whether the arguments shall be passed by value,
!      'GFC_CAF_ARG_DESC' (8) whether the arguments shall be passed by
       descriptor.
  
  _Syntax_:
!      'void _gfortran_caf_co_reduce (gfc_descriptor_t *a, void * (*opr)
       (void *, void *), int opr_flags, int result_image, int *stat, char
       *errmsg, int a_len, int errmsg_len)'
  
  _Arguments_:
!      OPR         Function pointer to the reduction function.
!      OPR_FLAGS   Flags regarding the reduction function
!      A           intent(inout) And array descriptor with the data
!                  to be breoadcasted (on SOURCE_IMAGE) or to be
!                  received (other images).
       RESULT_IMAGEThe ID of the image to which the reduced value
!                  should be copied to; if zero, it has to be
!                  copied to all images.
!      STAT        intent(out) Stores the status STAT= and may be
!                  NULL.
!      ERRMSG      intent(out) When an error occurs, this will be
!                  set to an error message; may be NULL
!      A_LEN       The string length of argument A.
!      ERRMSG_LEN  the buffer size of errmsg.
  
  _NOTES_
       If RESULT_IMAGE is nonzero, the value on all images except of the
       specified one become undefined; hence, the library may make use of
       this.  For character arguments, the result is passed as first
       argument, followed by the result string length, next come the two
!      string arguments, followed by the two hidden arguments.  With C
!      binding, there are no hidden arguments and by-reference passing and
!      either only a single character is passed or an array descriptor.
  
  
  File: gfortran.info,  Node: Intrinsic Procedures,  Next: Intrinsic Modules,  Prev: Coarray Programming,  Up: Top
*************** File: gfortran.info,  Node: Intrinsic Pr
*** 5281,5556 ****
  * Menu:
  
  * Introduction:         Introduction to Intrinsics
! * `ABORT':         ABORT,     Abort the program
! * `ABS':           ABS,       Absolute value
! * `ACCESS':        ACCESS,    Checks file access modes
! * `ACHAR':         ACHAR,     Character in ASCII collating sequence
! * `ACOS':          ACOS,      Arccosine function
! * `ACOSH':         ACOSH,     Inverse hyperbolic cosine function
! * `ADJUSTL':       ADJUSTL,   Left adjust a string
! * `ADJUSTR':       ADJUSTR,   Right adjust a string
! * `AIMAG':         AIMAG,     Imaginary part of complex number
! * `AINT':          AINT,      Truncate to a whole number
! * `ALARM':         ALARM,     Set an alarm clock
! * `ALL':           ALL,       Determine if all values are true
! * `ALLOCATED':     ALLOCATED, Status of allocatable entity
! * `AND':           AND,       Bitwise logical AND
! * `ANINT':         ANINT,     Nearest whole number
! * `ANY':           ANY,       Determine if any values are true
! * `ASIN':          ASIN,      Arcsine function
! * `ASINH':         ASINH,     Inverse hyperbolic sine function
! * `ASSOCIATED':    ASSOCIATED, Status of a pointer or pointer/target pair
! * `ATAN':          ATAN,      Arctangent function
! * `ATAN2':         ATAN2,     Arctangent function
! * `ATANH':         ATANH,     Inverse hyperbolic tangent function
! * `ATOMIC_ADD':    ATOMIC_ADD, Atomic ADD operation
! * `ATOMIC_AND':    ATOMIC_AND, Atomic bitwise AND operation
! * `ATOMIC_CAS':    ATOMIC_CAS, Atomic compare and swap
! * `ATOMIC_DEFINE': ATOMIC_DEFINE, Setting a variable atomically
! * `ATOMIC_FETCH_ADD': ATOMIC_FETCH_ADD, Atomic ADD operation with prior fetch
! * `ATOMIC_FETCH_AND': ATOMIC_FETCH_AND, Atomic bitwise AND operation with prior fetch
! * `ATOMIC_FETCH_OR': ATOMIC_FETCH_OR, Atomic bitwise OR operation with prior fetch
! * `ATOMIC_FETCH_XOR': ATOMIC_FETCH_XOR, Atomic bitwise XOR operation with prior fetch
! * `ATOMIC_OR':     ATOMIC_OR, Atomic bitwise OR operation
! * `ATOMIC_REF':    ATOMIC_REF, Obtaining the value of a variable atomically
! * `ATOMIC_XOR':    ATOMIC_XOR, Atomic bitwise OR operation
! * `BACKTRACE':     BACKTRACE, Show a backtrace
! * `BESSEL_J0':     BESSEL_J0, Bessel function of the first kind of order 0
! * `BESSEL_J1':     BESSEL_J1, Bessel function of the first kind of order 1
! * `BESSEL_JN':     BESSEL_JN, Bessel function of the first kind
! * `BESSEL_Y0':     BESSEL_Y0, Bessel function of the second kind of order 0
! * `BESSEL_Y1':     BESSEL_Y1, Bessel function of the second kind of order 1
! * `BESSEL_YN':     BESSEL_YN, Bessel function of the second kind
! * `BGE':           BGE,       Bitwise greater than or equal to
! * `BGT':           BGT,       Bitwise greater than
! * `BIT_SIZE':      BIT_SIZE,  Bit size inquiry function
! * `BLE':           BLE,       Bitwise less than or equal to
! * `BLT':           BLT,       Bitwise less than
! * `BTEST':         BTEST,     Bit test function
! * `C_ASSOCIATED':  C_ASSOCIATED, Status of a C pointer
! * `C_F_POINTER':   C_F_POINTER, Convert C into Fortran pointer
! * `C_F_PROCPOINTER': C_F_PROCPOINTER, Convert C into Fortran procedure pointer
! * `C_FUNLOC':      C_FUNLOC,  Obtain the C address of a procedure
! * `C_LOC':         C_LOC,     Obtain the C address of an object
! * `C_SIZEOF':      C_SIZEOF,  Size in bytes of an expression
! * `CEILING':       CEILING,   Integer ceiling function
! * `CHAR':          CHAR,      Integer-to-character conversion function
! * `CHDIR':         CHDIR,     Change working directory
! * `CHMOD':         CHMOD,     Change access permissions of files
! * `CMPLX':         CMPLX,     Complex conversion function
! * `CO_BROADCAST':  CO_BROADCAST, Copy a value to all images the current set of images
! * `CO_MAX':        CO_MAX,    Maximal value on the current set of images
! * `CO_MIN':        CO_MIN,    Minimal value on the current set of images
! * `CO_REDUCE':     CO_REDUCE, Reduction of values on the current set of images
! * `CO_SUM':        CO_SUM,    Sum of values on the current set of images
! * `COMMAND_ARGUMENT_COUNT': COMMAND_ARGUMENT_COUNT, Get number of command line arguments
! * `COMPILER_OPTIONS': COMPILER_OPTIONS, Options passed to the compiler
! * `COMPILER_VERSION': COMPILER_VERSION, Compiler version string
! * `COMPLEX':       COMPLEX,   Complex conversion function
! * `CONJG':         CONJG,     Complex conjugate function
! * `COS':           COS,       Cosine function
! * `COSH':          COSH,      Hyperbolic cosine function
! * `COUNT':         COUNT,     Count occurrences of TRUE in an array
! * `CPU_TIME':      CPU_TIME,  CPU time subroutine
! * `CSHIFT':        CSHIFT,    Circular shift elements of an array
! * `CTIME':         CTIME,     Subroutine (or function) to convert a time into a string
! * `DATE_AND_TIME': DATE_AND_TIME, Date and time subroutine
! * `DBLE':          DBLE,      Double precision conversion function
! * `DCMPLX':        DCMPLX,    Double complex conversion function
! * `DIGITS':        DIGITS,    Significant digits function
! * `DIM':           DIM,       Positive difference
! * `DOT_PRODUCT':   DOT_PRODUCT, Dot product function
! * `DPROD':         DPROD,     Double product function
! * `DREAL':         DREAL,     Double real part function
! * `DSHIFTL':       DSHIFTL,   Combined left shift
! * `DSHIFTR':       DSHIFTR,   Combined right shift
! * `DTIME':         DTIME,     Execution time subroutine (or function)
! * `EOSHIFT':       EOSHIFT,   End-off shift elements of an array
! * `EPSILON':       EPSILON,   Epsilon function
! * `ERF':           ERF,       Error function
! * `ERFC':          ERFC,      Complementary error function
! * `ERFC_SCALED':   ERFC_SCALED, Exponentially-scaled complementary error function
! * `ETIME':         ETIME,     Execution time subroutine (or function)
! * `EXECUTE_COMMAND_LINE': EXECUTE_COMMAND_LINE, Execute a shell command
! * `EXIT':          EXIT,      Exit the program with status.
! * `EXP':           EXP,       Exponential function
! * `EXPONENT':      EXPONENT,  Exponent function
! * `EXTENDS_TYPE_OF': EXTENDS_TYPE_OF,  Query dynamic type for extension
! * `FDATE':         FDATE,     Subroutine (or function) to get the current time as a string
! * `FGET':          FGET,      Read a single character in stream mode from stdin
! * `FGETC':         FGETC,     Read a single character in stream mode
! * `FLOOR':         FLOOR,     Integer floor function
! * `FLUSH':         FLUSH,     Flush I/O unit(s)
! * `FNUM':          FNUM,      File number function
! * `FPUT':          FPUT,      Write a single character in stream mode to stdout
! * `FPUTC':         FPUTC,     Write a single character in stream mode
! * `FRACTION':      FRACTION,  Fractional part of the model representation
! * `FREE':          FREE,      Memory de-allocation subroutine
! * `FSEEK':         FSEEK,     Low level file positioning subroutine
! * `FSTAT':         FSTAT,     Get file status
! * `FTELL':         FTELL,     Current stream position
! * `GAMMA':         GAMMA,     Gamma function
! * `GERROR':        GERROR,    Get last system error message
! * `GETARG':        GETARG,    Get command line arguments
! * `GET_COMMAND':   GET_COMMAND, Get the entire command line
! * `GET_COMMAND_ARGUMENT': GET_COMMAND_ARGUMENT, Get command line arguments
! * `GETCWD':        GETCWD,    Get current working directory
! * `GETENV':        GETENV,    Get an environmental variable
! * `GET_ENVIRONMENT_VARIABLE': GET_ENVIRONMENT_VARIABLE, Get an environmental variable
! * `GETGID':        GETGID,    Group ID function
! * `GETLOG':        GETLOG,    Get login name
! * `GETPID':        GETPID,    Process ID function
! * `GETUID':        GETUID,    User ID function
! * `GMTIME':        GMTIME,    Convert time to GMT info
! * `HOSTNM':        HOSTNM,    Get system host name
! * `HUGE':          HUGE,      Largest number of a kind
! * `HYPOT':         HYPOT,     Euclidean distance function
! * `IACHAR':        IACHAR,    Code in ASCII collating sequence
! * `IALL':          IALL,      Bitwise AND of array elements
! * `IAND':          IAND,      Bitwise logical and
! * `IANY':          IANY,      Bitwise OR of array elements
! * `IARGC':         IARGC,     Get the number of command line arguments
! * `IBCLR':         IBCLR,     Clear bit
! * `IBITS':         IBITS,     Bit extraction
! * `IBSET':         IBSET,     Set bit
! * `ICHAR':         ICHAR,     Character-to-integer conversion function
! * `IDATE':         IDATE,     Current local time (day/month/year)
! * `IEOR':          IEOR,      Bitwise logical exclusive or
! * `IERRNO':        IERRNO,    Function to get the last system error number
! * `IMAGE_INDEX':   IMAGE_INDEX, Cosubscript to image index conversion
! * `INDEX':         INDEX intrinsic, Position of a substring within a string
! * `INT':           INT,       Convert to integer type
! * `INT2':          INT2,      Convert to 16-bit integer type
! * `INT8':          INT8,      Convert to 64-bit integer type
! * `IOR':           IOR,       Bitwise logical or
! * `IPARITY':       IPARITY,   Bitwise XOR of array elements
! * `IRAND':         IRAND,     Integer pseudo-random number
! * `IS_IOSTAT_END':  IS_IOSTAT_END, Test for end-of-file value
! * `IS_IOSTAT_EOR':  IS_IOSTAT_EOR, Test for end-of-record value
! * `ISATTY':        ISATTY,    Whether a unit is a terminal device
! * `ISHFT':         ISHFT,     Shift bits
! * `ISHFTC':        ISHFTC,    Shift bits circularly
! * `ISNAN':         ISNAN,     Tests for a NaN
! * `ITIME':         ITIME,     Current local time (hour/minutes/seconds)
! * `KILL':          KILL,      Send a signal to a process
! * `KIND':          KIND,      Kind of an entity
! * `LBOUND':        LBOUND,    Lower dimension bounds of an array
! * `LCOBOUND':      LCOBOUND,  Lower codimension bounds of an array
! * `LEADZ':         LEADZ,     Number of leading zero bits of an integer
! * `LEN':           LEN,       Length of a character entity
! * `LEN_TRIM':      LEN_TRIM,  Length of a character entity without trailing blank characters
! * `LGE':           LGE,       Lexical greater than or equal
! * `LGT':           LGT,       Lexical greater than
! * `LINK':          LINK,      Create a hard link
! * `LLE':           LLE,       Lexical less than or equal
! * `LLT':           LLT,       Lexical less than
! * `LNBLNK':        LNBLNK,    Index of the last non-blank character in a string
! * `LOC':           LOC,       Returns the address of a variable
! * `LOG':           LOG,       Logarithm function
! * `LOG10':         LOG10,     Base 10 logarithm function
! * `LOG_GAMMA':     LOG_GAMMA, Logarithm of the Gamma function
! * `LOGICAL':       LOGICAL,   Convert to logical type
! * `LONG':          LONG,      Convert to integer type
! * `LSHIFT':        LSHIFT,    Left shift bits
! * `LSTAT':         LSTAT,     Get file status
! * `LTIME':         LTIME,     Convert time to local time info
! * `MALLOC':        MALLOC,    Dynamic memory allocation function
! * `MASKL':         MASKL,     Left justified mask
! * `MASKR':         MASKR,     Right justified mask
! * `MATMUL':        MATMUL,    matrix multiplication
! * `MAX':           MAX,       Maximum value of an argument list
! * `MAXEXPONENT':   MAXEXPONENT, Maximum exponent of a real kind
! * `MAXLOC':        MAXLOC,    Location of the maximum value within an array
! * `MAXVAL':        MAXVAL,    Maximum value of an array
! * `MCLOCK':        MCLOCK,    Time function
! * `MCLOCK8':       MCLOCK8,   Time function (64-bit)
! * `MERGE':         MERGE,     Merge arrays
! * `MERGE_BITS':    MERGE_BITS, Merge of bits under mask
! * `MIN':           MIN,       Minimum value of an argument list
! * `MINEXPONENT':   MINEXPONENT, Minimum exponent of a real kind
! * `MINLOC':        MINLOC,    Location of the minimum value within an array
! * `MINVAL':        MINVAL,    Minimum value of an array
! * `MOD':           MOD,       Remainder function
! * `MODULO':        MODULO,    Modulo function
! * `MOVE_ALLOC':    MOVE_ALLOC, Move allocation from one object to another
! * `MVBITS':        MVBITS,    Move bits from one integer to another
! * `NEAREST':       NEAREST,   Nearest representable number
! * `NEW_LINE':      NEW_LINE,  New line character
! * `NINT':          NINT,      Nearest whole number
! * `NORM2':         NORM2,     Euclidean vector norm
! * `NOT':           NOT,       Logical negation
! * `NULL':          NULL,      Function that returns an disassociated pointer
! * `NUM_IMAGES':    NUM_IMAGES, Number of images
! * `OR':            OR,        Bitwise logical OR
! * `PACK':          PACK,      Pack an array into an array of rank one
! * `PARITY':        PARITY,    Reduction with exclusive OR
! * `PERROR':        PERROR,    Print system error message
! * `POPCNT':        POPCNT,    Number of bits set
! * `POPPAR':        POPPAR,    Parity of the number of bits set
! * `PRECISION':     PRECISION, Decimal precision of a real kind
! * `PRESENT':       PRESENT,   Determine whether an optional dummy argument is specified
! * `PRODUCT':       PRODUCT,   Product of array elements
! * `RADIX':         RADIX,     Base of a data model
! * `RAN':           RAN,       Real pseudo-random number
! * `RAND':          RAND,      Real pseudo-random number
! * `RANDOM_NUMBER': RANDOM_NUMBER, Pseudo-random number
! * `RANDOM_SEED':   RANDOM_SEED, Initialize a pseudo-random number sequence
! * `RANGE':         RANGE,     Decimal exponent range
! * `RANK' :         RANK,      Rank of a data object
! * `REAL':          REAL,      Convert to real type
! * `RENAME':        RENAME,    Rename a file
! * `REPEAT':        REPEAT,    Repeated string concatenation
! * `RESHAPE':       RESHAPE,   Function to reshape an array
! * `RRSPACING':     RRSPACING, Reciprocal of the relative spacing
! * `RSHIFT':        RSHIFT,    Right shift bits
! * `SAME_TYPE_AS':  SAME_TYPE_AS,  Query dynamic types for equality
! * `SCALE':         SCALE,     Scale a real value
! * `SCAN':          SCAN,      Scan a string for the presence of a set of characters
! * `SECNDS':        SECNDS,    Time function
! * `SECOND':        SECOND,    CPU time function
! * `SELECTED_CHAR_KIND': SELECTED_CHAR_KIND,  Choose character kind
! * `SELECTED_INT_KIND': SELECTED_INT_KIND,  Choose integer kind
! * `SELECTED_REAL_KIND': SELECTED_REAL_KIND,  Choose real kind
! * `SET_EXPONENT':  SET_EXPONENT, Set the exponent of the model
! * `SHAPE':         SHAPE,     Determine the shape of an array
! * `SHIFTA':        SHIFTA,    Right shift with fill
! * `SHIFTL':        SHIFTL,    Left shift
! * `SHIFTR':        SHIFTR,    Right shift
! * `SIGN':          SIGN,      Sign copying function
! * `SIGNAL':        SIGNAL,    Signal handling subroutine (or function)
! * `SIN':           SIN,       Sine function
! * `SINH':          SINH,      Hyperbolic sine function
! * `SIZE':          SIZE,      Function to determine the size of an array
! * `SIZEOF':        SIZEOF,    Determine the size in bytes of an expression
! * `SLEEP':         SLEEP,     Sleep for the specified number of seconds
! * `SPACING':       SPACING,   Smallest distance between two numbers of a given type
! * `SPREAD':        SPREAD,    Add a dimension to an array
! * `SQRT':          SQRT,      Square-root function
! * `SRAND':         SRAND,     Reinitialize the random number generator
! * `STAT':          STAT,      Get file status
! * `STORAGE_SIZE':  STORAGE_SIZE, Storage size in bits
! * `SUM':           SUM,       Sum of array elements
! * `SYMLNK':        SYMLNK,    Create a symbolic link
! * `SYSTEM':        SYSTEM,    Execute a shell command
! * `SYSTEM_CLOCK':  SYSTEM_CLOCK, Time function
! * `TAN':           TAN,       Tangent function
! * `TANH':          TANH,      Hyperbolic tangent function
! * `THIS_IMAGE':    THIS_IMAGE, Cosubscript index of this image
! * `TIME':          TIME,      Time function
! * `TIME8':         TIME8,     Time function (64-bit)
! * `TINY':          TINY,      Smallest positive number of a real kind
! * `TRAILZ':        TRAILZ,    Number of trailing zero bits of an integer
! * `TRANSFER':      TRANSFER,  Transfer bit patterns
! * `TRANSPOSE':     TRANSPOSE, Transpose an array of rank two
! * `TRIM':          TRIM,      Remove trailing blank characters of a string
! * `TTYNAM':        TTYNAM,    Get the name of a terminal device.
! * `UBOUND':        UBOUND,    Upper dimension bounds of an array
! * `UCOBOUND':      UCOBOUND,  Upper codimension bounds of an array
! * `UMASK':         UMASK,     Set the file creation mask
! * `UNLINK':        UNLINK,    Remove a file from the file system
! * `UNPACK':        UNPACK,    Unpack an array of rank one into an array
! * `VERIFY':        VERIFY,    Scan a string for the absence of a set of characters
! * `XOR':           XOR,       Bitwise logical exclusive or
  
  
  File: gfortran.info,  Node: Introduction to Intrinsics,  Next: ABORT,  Up: Intrinsic Procedures
--- 5233,5508 ----
  * Menu:
  
  * Introduction:         Introduction to Intrinsics
! * 'ABORT':         ABORT,     Abort the program
! * 'ABS':           ABS,       Absolute value
! * 'ACCESS':        ACCESS,    Checks file access modes
! * 'ACHAR':         ACHAR,     Character in ASCII collating sequence
! * 'ACOS':          ACOS,      Arccosine function
! * 'ACOSH':         ACOSH,     Inverse hyperbolic cosine function
! * 'ADJUSTL':       ADJUSTL,   Left adjust a string
! * 'ADJUSTR':       ADJUSTR,   Right adjust a string
! * 'AIMAG':         AIMAG,     Imaginary part of complex number
! * 'AINT':          AINT,      Truncate to a whole number
! * 'ALARM':         ALARM,     Set an alarm clock
! * 'ALL':           ALL,       Determine if all values are true
! * 'ALLOCATED':     ALLOCATED, Status of allocatable entity
! * 'AND':           AND,       Bitwise logical AND
! * 'ANINT':         ANINT,     Nearest whole number
! * 'ANY':           ANY,       Determine if any values are true
! * 'ASIN':          ASIN,      Arcsine function
! * 'ASINH':         ASINH,     Inverse hyperbolic sine function
! * 'ASSOCIATED':    ASSOCIATED, Status of a pointer or pointer/target pair
! * 'ATAN':          ATAN,      Arctangent function
! * 'ATAN2':         ATAN2,     Arctangent function
! * 'ATANH':         ATANH,     Inverse hyperbolic tangent function
! * 'ATOMIC_ADD':    ATOMIC_ADD, Atomic ADD operation
! * 'ATOMIC_AND':    ATOMIC_AND, Atomic bitwise AND operation
! * 'ATOMIC_CAS':    ATOMIC_CAS, Atomic compare and swap
! * 'ATOMIC_DEFINE': ATOMIC_DEFINE, Setting a variable atomically
! * 'ATOMIC_FETCH_ADD': ATOMIC_FETCH_ADD, Atomic ADD operation with prior fetch
! * 'ATOMIC_FETCH_AND': ATOMIC_FETCH_AND, Atomic bitwise AND operation with prior fetch
! * 'ATOMIC_FETCH_OR': ATOMIC_FETCH_OR, Atomic bitwise OR operation with prior fetch
! * 'ATOMIC_FETCH_XOR': ATOMIC_FETCH_XOR, Atomic bitwise XOR operation with prior fetch
! * 'ATOMIC_OR':     ATOMIC_OR, Atomic bitwise OR operation
! * 'ATOMIC_REF':    ATOMIC_REF, Obtaining the value of a variable atomically
! * 'ATOMIC_XOR':    ATOMIC_XOR, Atomic bitwise OR operation
! * 'BACKTRACE':     BACKTRACE, Show a backtrace
! * 'BESSEL_J0':     BESSEL_J0, Bessel function of the first kind of order 0
! * 'BESSEL_J1':     BESSEL_J1, Bessel function of the first kind of order 1
! * 'BESSEL_JN':     BESSEL_JN, Bessel function of the first kind
! * 'BESSEL_Y0':     BESSEL_Y0, Bessel function of the second kind of order 0
! * 'BESSEL_Y1':     BESSEL_Y1, Bessel function of the second kind of order 1
! * 'BESSEL_YN':     BESSEL_YN, Bessel function of the second kind
! * 'BGE':           BGE,       Bitwise greater than or equal to
! * 'BGT':           BGT,       Bitwise greater than
! * 'BIT_SIZE':      BIT_SIZE,  Bit size inquiry function
! * 'BLE':           BLE,       Bitwise less than or equal to
! * 'BLT':           BLT,       Bitwise less than
! * 'BTEST':         BTEST,     Bit test function
! * 'C_ASSOCIATED':  C_ASSOCIATED, Status of a C pointer
! * 'C_F_POINTER':   C_F_POINTER, Convert C into Fortran pointer
! * 'C_F_PROCPOINTER': C_F_PROCPOINTER, Convert C into Fortran procedure pointer
! * 'C_FUNLOC':      C_FUNLOC,  Obtain the C address of a procedure
! * 'C_LOC':         C_LOC,     Obtain the C address of an object
! * 'C_SIZEOF':      C_SIZEOF,  Size in bytes of an expression
! * 'CEILING':       CEILING,   Integer ceiling function
! * 'CHAR':          CHAR,      Integer-to-character conversion function
! * 'CHDIR':         CHDIR,     Change working directory
! * 'CHMOD':         CHMOD,     Change access permissions of files
! * 'CMPLX':         CMPLX,     Complex conversion function
! * 'CO_BROADCAST':  CO_BROADCAST, Copy a value to all images the current set of images
! * 'CO_MAX':        CO_MAX,    Maximal value on the current set of images
! * 'CO_MIN':        CO_MIN,    Minimal value on the current set of images
! * 'CO_REDUCE':     CO_REDUCE, Reduction of values on the current set of images
! * 'CO_SUM':        CO_SUM,    Sum of values on the current set of images
! * 'COMMAND_ARGUMENT_COUNT': COMMAND_ARGUMENT_COUNT, Get number of command line arguments
! * 'COMPILER_OPTIONS': COMPILER_OPTIONS, Options passed to the compiler
! * 'COMPILER_VERSION': COMPILER_VERSION, Compiler version string
! * 'COMPLEX':       COMPLEX,   Complex conversion function
! * 'CONJG':         CONJG,     Complex conjugate function
! * 'COS':           COS,       Cosine function
! * 'COSH':          COSH,      Hyperbolic cosine function
! * 'COUNT':         COUNT,     Count occurrences of TRUE in an array
! * 'CPU_TIME':      CPU_TIME,  CPU time subroutine
! * 'CSHIFT':        CSHIFT,    Circular shift elements of an array
! * 'CTIME':         CTIME,     Subroutine (or function) to convert a time into a string
! * 'DATE_AND_TIME': DATE_AND_TIME, Date and time subroutine
! * 'DBLE':          DBLE,      Double precision conversion function
! * 'DCMPLX':        DCMPLX,    Double complex conversion function
! * 'DIGITS':        DIGITS,    Significant digits function
! * 'DIM':           DIM,       Positive difference
! * 'DOT_PRODUCT':   DOT_PRODUCT, Dot product function
! * 'DPROD':         DPROD,     Double product function
! * 'DREAL':         DREAL,     Double real part function
! * 'DSHIFTL':       DSHIFTL,   Combined left shift
! * 'DSHIFTR':       DSHIFTR,   Combined right shift
! * 'DTIME':         DTIME,     Execution time subroutine (or function)
! * 'EOSHIFT':       EOSHIFT,   End-off shift elements of an array
! * 'EPSILON':       EPSILON,   Epsilon function
! * 'ERF':           ERF,       Error function
! * 'ERFC':          ERFC,      Complementary error function
! * 'ERFC_SCALED':   ERFC_SCALED, Exponentially-scaled complementary error function
! * 'ETIME':         ETIME,     Execution time subroutine (or function)
! * 'EXECUTE_COMMAND_LINE': EXECUTE_COMMAND_LINE, Execute a shell command
! * 'EXIT':          EXIT,      Exit the program with status.
! * 'EXP':           EXP,       Exponential function
! * 'EXPONENT':      EXPONENT,  Exponent function
! * 'EXTENDS_TYPE_OF': EXTENDS_TYPE_OF,  Query dynamic type for extension
! * 'FDATE':         FDATE,     Subroutine (or function) to get the current time as a string
! * 'FGET':          FGET,      Read a single character in stream mode from stdin
! * 'FGETC':         FGETC,     Read a single character in stream mode
! * 'FLOOR':         FLOOR,     Integer floor function
! * 'FLUSH':         FLUSH,     Flush I/O unit(s)
! * 'FNUM':          FNUM,      File number function
! * 'FPUT':          FPUT,      Write a single character in stream mode to stdout
! * 'FPUTC':         FPUTC,     Write a single character in stream mode
! * 'FRACTION':      FRACTION,  Fractional part of the model representation
! * 'FREE':          FREE,      Memory de-allocation subroutine
! * 'FSEEK':         FSEEK,     Low level file positioning subroutine
! * 'FSTAT':         FSTAT,     Get file status
! * 'FTELL':         FTELL,     Current stream position
! * 'GAMMA':         GAMMA,     Gamma function
! * 'GERROR':        GERROR,    Get last system error message
! * 'GETARG':        GETARG,    Get command line arguments
! * 'GET_COMMAND':   GET_COMMAND, Get the entire command line
! * 'GET_COMMAND_ARGUMENT': GET_COMMAND_ARGUMENT, Get command line arguments
! * 'GETCWD':        GETCWD,    Get current working directory
! * 'GETENV':        GETENV,    Get an environmental variable
! * 'GET_ENVIRONMENT_VARIABLE': GET_ENVIRONMENT_VARIABLE, Get an environmental variable
! * 'GETGID':        GETGID,    Group ID function
! * 'GETLOG':        GETLOG,    Get login name
! * 'GETPID':        GETPID,    Process ID function
! * 'GETUID':        GETUID,    User ID function
! * 'GMTIME':        GMTIME,    Convert time to GMT info
! * 'HOSTNM':        HOSTNM,    Get system host name
! * 'HUGE':          HUGE,      Largest number of a kind
! * 'HYPOT':         HYPOT,     Euclidean distance function
! * 'IACHAR':        IACHAR,    Code in ASCII collating sequence
! * 'IALL':          IALL,      Bitwise AND of array elements
! * 'IAND':          IAND,      Bitwise logical and
! * 'IANY':          IANY,      Bitwise OR of array elements
! * 'IARGC':         IARGC,     Get the number of command line arguments
! * 'IBCLR':         IBCLR,     Clear bit
! * 'IBITS':         IBITS,     Bit extraction
! * 'IBSET':         IBSET,     Set bit
! * 'ICHAR':         ICHAR,     Character-to-integer conversion function
! * 'IDATE':         IDATE,     Current local time (day/month/year)
! * 'IEOR':          IEOR,      Bitwise logical exclusive or
! * 'IERRNO':        IERRNO,    Function to get the last system error number
! * 'IMAGE_INDEX':   IMAGE_INDEX, Cosubscript to image index conversion
! * 'INDEX':         INDEX intrinsic, Position of a substring within a string
! * 'INT':           INT,       Convert to integer type
! * 'INT2':          INT2,      Convert to 16-bit integer type
! * 'INT8':          INT8,      Convert to 64-bit integer type
! * 'IOR':           IOR,       Bitwise logical or
! * 'IPARITY':       IPARITY,   Bitwise XOR of array elements
! * 'IRAND':         IRAND,     Integer pseudo-random number
! * 'IS_IOSTAT_END':  IS_IOSTAT_END, Test for end-of-file value
! * 'IS_IOSTAT_EOR':  IS_IOSTAT_EOR, Test for end-of-record value
! * 'ISATTY':        ISATTY,    Whether a unit is a terminal device
! * 'ISHFT':         ISHFT,     Shift bits
! * 'ISHFTC':        ISHFTC,    Shift bits circularly
! * 'ISNAN':         ISNAN,     Tests for a NaN
! * 'ITIME':         ITIME,     Current local time (hour/minutes/seconds)
! * 'KILL':          KILL,      Send a signal to a process
! * 'KIND':          KIND,      Kind of an entity
! * 'LBOUND':        LBOUND,    Lower dimension bounds of an array
! * 'LCOBOUND':      LCOBOUND,  Lower codimension bounds of an array
! * 'LEADZ':         LEADZ,     Number of leading zero bits of an integer
! * 'LEN':           LEN,       Length of a character entity
! * 'LEN_TRIM':      LEN_TRIM,  Length of a character entity without trailing blank characters
! * 'LGE':           LGE,       Lexical greater than or equal
! * 'LGT':           LGT,       Lexical greater than
! * 'LINK':          LINK,      Create a hard link
! * 'LLE':           LLE,       Lexical less than or equal
! * 'LLT':           LLT,       Lexical less than
! * 'LNBLNK':        LNBLNK,    Index of the last non-blank character in a string
! * 'LOC':           LOC,       Returns the address of a variable
! * 'LOG':           LOG,       Logarithm function
! * 'LOG10':         LOG10,     Base 10 logarithm function
! * 'LOG_GAMMA':     LOG_GAMMA, Logarithm of the Gamma function
! * 'LOGICAL':       LOGICAL,   Convert to logical type
! * 'LONG':          LONG,      Convert to integer type
! * 'LSHIFT':        LSHIFT,    Left shift bits
! * 'LSTAT':         LSTAT,     Get file status
! * 'LTIME':         LTIME,     Convert time to local time info
! * 'MALLOC':        MALLOC,    Dynamic memory allocation function
! * 'MASKL':         MASKL,     Left justified mask
! * 'MASKR':         MASKR,     Right justified mask
! * 'MATMUL':        MATMUL,    matrix multiplication
! * 'MAX':           MAX,       Maximum value of an argument list
! * 'MAXEXPONENT':   MAXEXPONENT, Maximum exponent of a real kind
! * 'MAXLOC':        MAXLOC,    Location of the maximum value within an array
! * 'MAXVAL':        MAXVAL,    Maximum value of an array
! * 'MCLOCK':        MCLOCK,    Time function
! * 'MCLOCK8':       MCLOCK8,   Time function (64-bit)
! * 'MERGE':         MERGE,     Merge arrays
! * 'MERGE_BITS':    MERGE_BITS, Merge of bits under mask
! * 'MIN':           MIN,       Minimum value of an argument list
! * 'MINEXPONENT':   MINEXPONENT, Minimum exponent of a real kind
! * 'MINLOC':        MINLOC,    Location of the minimum value within an array
! * 'MINVAL':        MINVAL,    Minimum value of an array
! * 'MOD':           MOD,       Remainder function
! * 'MODULO':        MODULO,    Modulo function
! * 'MOVE_ALLOC':    MOVE_ALLOC, Move allocation from one object to another
! * 'MVBITS':        MVBITS,    Move bits from one integer to another
! * 'NEAREST':       NEAREST,   Nearest representable number
! * 'NEW_LINE':      NEW_LINE,  New line character
! * 'NINT':          NINT,      Nearest whole number
! * 'NORM2':         NORM2,     Euclidean vector norm
! * 'NOT':           NOT,       Logical negation
! * 'NULL':          NULL,      Function that returns an disassociated pointer
! * 'NUM_IMAGES':    NUM_IMAGES, Number of images
! * 'OR':            OR,        Bitwise logical OR
! * 'PACK':          PACK,      Pack an array into an array of rank one
! * 'PARITY':        PARITY,    Reduction with exclusive OR
! * 'PERROR':        PERROR,    Print system error message
! * 'POPCNT':        POPCNT,    Number of bits set
! * 'POPPAR':        POPPAR,    Parity of the number of bits set
! * 'PRECISION':     PRECISION, Decimal precision of a real kind
! * 'PRESENT':       PRESENT,   Determine whether an optional dummy argument is specified
! * 'PRODUCT':       PRODUCT,   Product of array elements
! * 'RADIX':         RADIX,     Base of a data model
! * 'RAN':           RAN,       Real pseudo-random number
! * 'RAND':          RAND,      Real pseudo-random number
! * 'RANDOM_NUMBER': RANDOM_NUMBER, Pseudo-random number
! * 'RANDOM_SEED':   RANDOM_SEED, Initialize a pseudo-random number sequence
! * 'RANGE':         RANGE,     Decimal exponent range
! * 'RANK' :         RANK,      Rank of a data object
! * 'REAL':          REAL,      Convert to real type
! * 'RENAME':        RENAME,    Rename a file
! * 'REPEAT':        REPEAT,    Repeated string concatenation
! * 'RESHAPE':       RESHAPE,   Function to reshape an array
! * 'RRSPACING':     RRSPACING, Reciprocal of the relative spacing
! * 'RSHIFT':        RSHIFT,    Right shift bits
! * 'SAME_TYPE_AS':  SAME_TYPE_AS,  Query dynamic types for equality
! * 'SCALE':         SCALE,     Scale a real value
! * 'SCAN':          SCAN,      Scan a string for the presence of a set of characters
! * 'SECNDS':        SECNDS,    Time function
! * 'SECOND':        SECOND,    CPU time function
! * 'SELECTED_CHAR_KIND': SELECTED_CHAR_KIND,  Choose character kind
! * 'SELECTED_INT_KIND': SELECTED_INT_KIND,  Choose integer kind
! * 'SELECTED_REAL_KIND': SELECTED_REAL_KIND,  Choose real kind
! * 'SET_EXPONENT':  SET_EXPONENT, Set the exponent of the model
! * 'SHAPE':         SHAPE,     Determine the shape of an array
! * 'SHIFTA':        SHIFTA,    Right shift with fill
! * 'SHIFTL':        SHIFTL,    Left shift
! * 'SHIFTR':        SHIFTR,    Right shift
! * 'SIGN':          SIGN,      Sign copying function
! * 'SIGNAL':        SIGNAL,    Signal handling subroutine (or function)
! * 'SIN':           SIN,       Sine function
! * 'SINH':          SINH,      Hyperbolic sine function
! * 'SIZE':          SIZE,      Function to determine the size of an array
! * 'SIZEOF':        SIZEOF,    Determine the size in bytes of an expression
! * 'SLEEP':         SLEEP,     Sleep for the specified number of seconds
! * 'SPACING':       SPACING,   Smallest distance between two numbers of a given type
! * 'SPREAD':        SPREAD,    Add a dimension to an array
! * 'SQRT':          SQRT,      Square-root function
! * 'SRAND':         SRAND,     Reinitialize the random number generator
! * 'STAT':          STAT,      Get file status
! * 'STORAGE_SIZE':  STORAGE_SIZE, Storage size in bits
! * 'SUM':           SUM,       Sum of array elements
! * 'SYMLNK':        SYMLNK,    Create a symbolic link
! * 'SYSTEM':        SYSTEM,    Execute a shell command
! * 'SYSTEM_CLOCK':  SYSTEM_CLOCK, Time function
! * 'TAN':           TAN,       Tangent function
! * 'TANH':          TANH,      Hyperbolic tangent function
! * 'THIS_IMAGE':    THIS_IMAGE, Cosubscript index of this image
! * 'TIME':          TIME,      Time function
! * 'TIME8':         TIME8,     Time function (64-bit)
! * 'TINY':          TINY,      Smallest positive number of a real kind
! * 'TRAILZ':        TRAILZ,    Number of trailing zero bits of an integer
! * 'TRANSFER':      TRANSFER,  Transfer bit patterns
! * 'TRANSPOSE':     TRANSPOSE, Transpose an array of rank two
! * 'TRIM':          TRIM,      Remove trailing blank characters of a string
! * 'TTYNAM':        TTYNAM,    Get the name of a terminal device.
! * 'UBOUND':        UBOUND,    Upper dimension bounds of an array
! * 'UCOBOUND':      UCOBOUND,  Upper codimension bounds of an array
! * 'UMASK':         UMASK,     Set the file creation mask
! * 'UNLINK':        UNLINK,    Remove a file from the file system
! * 'UNPACK':        UNPACK,    Unpack an array of rank one into an array
! * 'VERIFY':        VERIFY,    Scan a string for the absence of a set of characters
! * 'XOR':           XOR,       Bitwise logical exclusive or
  
  
  File: gfortran.info,  Node: Introduction to Intrinsics,  Next: ABORT,  Up: Intrinsic Procedures
*************** either the Fortran 95 standard, the Fort
*** 5567,5610 ****
  2008 standard is unintentional, and the standard(s) should be considered
  authoritative.
  
!    The enumeration of the `KIND' type parameter is processor defined in
  the Fortran 95 standard.  GNU Fortran defines the default integer type
! and default real type by `INTEGER(KIND=4)' and `REAL(KIND=4)',
  respectively.  The standard mandates that both data types shall have
  another kind, which have more precision.  On typical target
! architectures supported by `gfortran', this kind type parameter is
! `KIND=8'.  Hence, `REAL(KIND=8)' and `DOUBLE PRECISION' are equivalent.
  In the description of generic intrinsic procedures, the kind type
! parameter will be specified by `KIND=*', and in the description of
  specific names for an intrinsic procedure the kind type parameter will
! be explicitly given (e.g., `REAL(KIND=4)' or `REAL(KIND=8)').  Finally,
! for brevity the optional `KIND=' syntax will be omitted.
  
     Many of the intrinsic procedures take one or more optional arguments.
  This document follows the convention used in the Fortran 95 standard,
  and denotes such arguments by square brackets.
  
!    GNU Fortran offers the `-std=f95' and `-std=gnu' options, which can
! be used to restrict the set of intrinsic procedures to a given
! standard.  By default, `gfortran' sets the `-std=gnu' option, and so
! all intrinsic procedures described here are accepted.  There is one
! caveat.  For a select group of intrinsic procedures, `g77' implemented
! both a function and a subroutine.  Both classes have been implemented
! in `gfortran' for backwards compatibility with `g77'.  It is noted here
! that these functions and subroutines cannot be intermixed in a given
! subprogram.  In the descriptions that follow, the applicable standard
! for each intrinsic procedure is noted.
  
  
  File: gfortran.info,  Node: ABORT,  Next: ABS,  Prev: Introduction to Intrinsics,  Up: Intrinsic Procedures
  
! 9.2 `ABORT' -- Abort the program
  ================================
  
  _Description_:
!      `ABORT' causes immediate termination of the program.  On operating
!      systems that support a core dump, `ABORT' will produce a core dump.
!      It will also print a backtrace, unless `-fno-backtrace' is given.
  
  _Standard_:
       GNU extension
--- 5519,5562 ----
  2008 standard is unintentional, and the standard(s) should be considered
  authoritative.
  
!    The enumeration of the 'KIND' type parameter is processor defined in
  the Fortran 95 standard.  GNU Fortran defines the default integer type
! and default real type by 'INTEGER(KIND=4)' and 'REAL(KIND=4)',
  respectively.  The standard mandates that both data types shall have
  another kind, which have more precision.  On typical target
! architectures supported by 'gfortran', this kind type parameter is
! 'KIND=8'.  Hence, 'REAL(KIND=8)' and 'DOUBLE PRECISION' are equivalent.
  In the description of generic intrinsic procedures, the kind type
! parameter will be specified by 'KIND=*', and in the description of
  specific names for an intrinsic procedure the kind type parameter will
! be explicitly given (e.g., 'REAL(KIND=4)' or 'REAL(KIND=8)').  Finally,
! for brevity the optional 'KIND=' syntax will be omitted.
  
     Many of the intrinsic procedures take one or more optional arguments.
  This document follows the convention used in the Fortran 95 standard,
  and denotes such arguments by square brackets.
  
!    GNU Fortran offers the '-std=f95' and '-std=gnu' options, which can
! be used to restrict the set of intrinsic procedures to a given standard.
! By default, 'gfortran' sets the '-std=gnu' option, and so all intrinsic
! procedures described here are accepted.  There is one caveat.  For a
! select group of intrinsic procedures, 'g77' implemented both a function
! and a subroutine.  Both classes have been implemented in 'gfortran' for
! backwards compatibility with 'g77'.  It is noted here that these
! functions and subroutines cannot be intermixed in a given subprogram.
! In the descriptions that follow, the applicable standard for each
! intrinsic procedure is noted.
  
  
  File: gfortran.info,  Node: ABORT,  Next: ABS,  Prev: Introduction to Intrinsics,  Up: Intrinsic Procedures
  
! 9.2 'ABORT' -- Abort the program
  ================================
  
  _Description_:
!      'ABORT' causes immediate termination of the program.  On operating
!      systems that support a core dump, 'ABORT' will produce a core dump.
!      It will also print a backtrace, unless '-fno-backtrace' is given.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 5613,5619 ****
       Subroutine
  
  _Syntax_:
!      `CALL ABORT'
  
  _Return value_:
       Does not return.
--- 5565,5571 ----
       Subroutine
  
  _Syntax_:
!      'CALL ABORT'
  
  _Return value_:
       Does not return.
*************** _Example_:
*** 5627,5641 ****
  _See also_:
       *note EXIT::, *note KILL::, *note BACKTRACE::
  
- 
  
  File: gfortran.info,  Node: ABS,  Next: ACCESS,  Prev: ABORT,  Up: Intrinsic Procedures
  
! 9.3 `ABS' -- Absolute value
  ===========================
  
  _Description_:
!      `ABS(A)' computes the absolute value of `A'.
  
  _Standard_:
       Fortran 77 and later, has overloads that are GNU extensions
--- 5579,5592 ----
  _See also_:
       *note EXIT::, *note KILL::, *note BACKTRACE::
  
  
  File: gfortran.info,  Node: ABS,  Next: ACCESS,  Prev: ABORT,  Up: Intrinsic Procedures
  
! 9.3 'ABS' -- Absolute value
  ===========================
  
  _Description_:
!      'ABS(A)' computes the absolute value of 'A'.
  
  _Standard_:
       Fortran 77 and later, has overloads that are GNU extensions
*************** _Class_:
*** 5644,5658 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ABS(A)'
  
  _Arguments_:
!      A          The type of the argument shall be an `INTEGER',
!                 `REAL', or `COMPLEX'.
  
  _Return value_:
       The return value is of the same type and kind as the argument
!      except the return value is `REAL' for a `COMPLEX' argument.
  
  _Example_:
            program test_abs
--- 5595,5609 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ABS(A)'
  
  _Arguments_:
!      A           The type of the argument shall be an 'INTEGER',
!                  'REAL', or 'COMPLEX'.
  
  _Return value_:
       The return value is of the same type and kind as the argument
!      except the return value is 'REAL' for a 'COMPLEX' argument.
  
  _Example_:
            program test_abs
*************** _Example_:
*** 5665,5694 ****
            end program test_abs
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `ABS(A)'      `REAL(4) A'   `REAL(4)'     Fortran 77 and
!                                                later
!      `CABS(A)'     `COMPLEX(4)   `REAL(4)'     Fortran 77 and
!                    A'                          later
!      `DABS(A)'     `REAL(8) A'   `REAL(8)'     Fortran 77 and
!                                                later
!      `IABS(A)'     `INTEGER(4)   `INTEGER(4)'  Fortran 77 and
!                    A'                          later
!      `ZABS(A)'     `COMPLEX(8)   `COMPLEX(8)'  GNU extension
!                    A'                          
!      `CDABS(A)'    `COMPLEX(8)   `COMPLEX(8)'  GNU extension
!                    A'                          
  
  
  File: gfortran.info,  Node: ACCESS,  Next: ACHAR,  Prev: ABS,  Up: Intrinsic Procedures
  
! 9.4 `ACCESS' -- Checks file access modes
  ========================================
  
  _Description_:
!      `ACCESS(NAME, MODE)' checks whether the file NAME exists, is
!      readable, writable or executable. Except for the executable check,
!      `ACCESS' can be replaced by Fortran 95's `INQUIRE'.
  
  _Standard_:
       GNU extension
--- 5616,5645 ----
            end program test_abs
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'ABS(A)'       'REAL(4) A'    'REAL(4)'      Fortran 77 and
!                                                   later
!      'CABS(A)'      'COMPLEX(4)    'REAL(4)'      Fortran 77 and
!                     A'                            later
!      'DABS(A)'      'REAL(8) A'    'REAL(8)'      Fortran 77 and
!                                                   later
!      'IABS(A)'      'INTEGER(4)    'INTEGER(4)'   Fortran 77 and
!                     A'                            later
!      'ZABS(A)'      'COMPLEX(8)    'COMPLEX(8)'   GNU extension
!                     A'
!      'CDABS(A)'     'COMPLEX(8)    'COMPLEX(8)'   GNU extension
!                     A'
  
  
  File: gfortran.info,  Node: ACCESS,  Next: ACHAR,  Prev: ABS,  Up: Intrinsic Procedures
  
! 9.4 'ACCESS' -- Checks file access modes
  ========================================
  
  _Description_:
!      'ACCESS(NAME, MODE)' checks whether the file NAME exists, is
!      readable, writable or executable.  Except for the executable check,
!      'ACCESS' can be replaced by Fortran 95's 'INQUIRE'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 5697,5719 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = ACCESS(NAME, MODE)'
  
  _Arguments_:
!      NAME       Scalar `CHARACTER' of default kind with the
!                 file name. Tailing blank are ignored unless
!                 the character `achar(0)' is present, then all
!                 characters up to and excluding `achar(0)' are
!                 used as file name.
!      MODE       Scalar `CHARACTER' of default kind with the
!                 file access mode, may be any concatenation of
!                 `"r"' (readable), `"w"' (writable) and `"x"'
!                 (executable), or `" "' to check for existence.
  
  _Return value_:
!      Returns a scalar `INTEGER', which is `0' if the file is accessible
       in the given mode; otherwise or if an invalid argument has been
!      given for `MODE' the value `1' is returned.
  
  _Example_:
            program access_test
--- 5648,5670 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = ACCESS(NAME, MODE)'
  
  _Arguments_:
!      NAME        Scalar 'CHARACTER' of default kind with the file
!                  name.  Tailing blank are ignored unless the
!                  character 'achar(0)' is present, then all
!                  characters up to and excluding 'achar(0)' are
!                  used as file name.
!      MODE        Scalar 'CHARACTER' of default kind with the file
!                  access mode, may be any concatenation of '"r"'
!                  (readable), '"w"' (writable) and '"x"'
!                  (executable), or '" "' to check for existence.
  
  _Return value_:
!      Returns a scalar 'INTEGER', which is '0' if the file is accessible
       in the given mode; otherwise or if an invalid argument has been
!      given for 'MODE' the value '1' is returned.
  
  _Example_:
            program access_test
*************** _Example_:
*** 5727,5745 ****
              if(access(file2,'rwx') == 0) &
                print *, trim(file2),' is readable, writable and executable'
            end program access_test
- 
  _Specific names_:
- 
  _See also_:
  
  
  File: gfortran.info,  Node: ACHAR,  Next: ACOS,  Prev: ACCESS,  Up: Intrinsic Procedures
  
! 9.5 `ACHAR' -- Character in ASCII collating sequence
  ====================================================
  
  _Description_:
!      `ACHAR(I)' returns the character located at position `I' in the
       ASCII collating sequence.
  
  _Standard_:
--- 5678,5694 ----
              if(access(file2,'rwx') == 0) &
                print *, trim(file2),' is readable, writable and executable'
            end program access_test
  _Specific names_:
  _See also_:
  
  
  File: gfortran.info,  Node: ACHAR,  Next: ACOS,  Prev: ACCESS,  Up: Intrinsic Procedures
  
! 9.5 'ACHAR' -- Character in ASCII collating sequence
  ====================================================
  
  _Description_:
!      'ACHAR(I)' returns the character located at position 'I' in the
       ASCII collating sequence.
  
  _Standard_:
*************** _Class_:
*** 5749,5764 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ACHAR(I [, KIND])'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `CHARACTER' with a length of one.  If
       the KIND argument is present, the return value is of the specified
       kind and of the default kind otherwise.
  
--- 5698,5713 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ACHAR(I [, KIND])'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'CHARACTER' with a length of one.  If
       the KIND argument is present, the return value is of the specified
       kind and of the default kind otherwise.
  
*************** _Note_:
*** 5775,5789 ****
  _See also_:
       *note CHAR::, *note IACHAR::, *note ICHAR::
  
- 
  
  File: gfortran.info,  Node: ACOS,  Next: ACOSH,  Prev: ACHAR,  Up: Intrinsic Procedures
  
! 9.6 `ACOS' -- Arccosine function
  ================================
  
  _Description_:
!      `ACOS(X)' computes the arccosine of X (inverse of `COS(X)').
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
--- 5724,5737 ----
  _See also_:
       *note CHAR::, *note IACHAR::, *note ICHAR::
  
  
  File: gfortran.info,  Node: ACOS,  Next: ACOSH,  Prev: ACHAR,  Up: Intrinsic Procedures
  
! 9.6 'ACOS' -- Arccosine function
  ================================
  
  _Description_:
!      'ACOS(X)' computes the arccosine of X (inverse of 'COS(X)').
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
*************** _Class_:
*** 5792,5803 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ACOS(X)'
  
  _Arguments_:
!      X          The type shall either be `REAL' with a
!                 magnitude that is less than or equal to one -
!                 or the type shall be `COMPLEX'.
  
  _Return value_:
       The return value is of the same type and kind as X.  The real part
--- 5740,5751 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ACOS(X)'
  
  _Arguments_:
!      X           The type shall either be 'REAL' with a magnitude
!                  that is less than or equal to one - or the type
!                  shall be 'COMPLEX'.
  
  _Return value_:
       The return value is of the same type and kind as X.  The real part
*************** _Example_:
*** 5811,5834 ****
            end program test_acos
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `ACOS(X)'     `REAL(4) X'   `REAL(4)'     Fortran 77 and
!                                                later
!      `DACOS(X)'    `REAL(8) X'   `REAL(8)'     Fortran 77 and
!                                                later
  
  _See also_:
       Inverse function: *note COS::
  
- 
  
  File: gfortran.info,  Node: ACOSH,  Next: ADJUSTL,  Prev: ACOS,  Up: Intrinsic Procedures
  
! 9.7 `ACOSH' -- Inverse hyperbolic cosine function
  =================================================
  
  _Description_:
!      `ACOSH(X)' computes the inverse hyperbolic cosine of X.
  
  _Standard_:
       Fortran 2008 and later
--- 5759,5781 ----
            end program test_acos
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'ACOS(X)'      'REAL(4) X'    'REAL(4)'      Fortran 77 and
!                                                   later
!      'DACOS(X)'     'REAL(8) X'    'REAL(8)'      Fortran 77 and
!                                                   later
  
  _See also_:
       Inverse function: *note COS::
  
  
  File: gfortran.info,  Node: ACOSH,  Next: ADJUSTL,  Prev: ACOS,  Up: Intrinsic Procedures
  
! 9.7 'ACOSH' -- Inverse hyperbolic cosine function
  =================================================
  
  _Description_:
!      'ACOSH(X)' computes the inverse hyperbolic cosine of X.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 5837,5850 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ACOSH(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
!      The return value has the same type and kind as X. If X is complex,
!      the imaginary part of the result is in radians and lies between  0
       \leq \Im \acosh(x) \leq \pi.
  
  _Example_:
--- 5784,5797 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ACOSH(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value has the same type and kind as X.  If X is complex,
!      the imaginary part of the result is in radians and lies between 0
       \leq \Im \acosh(x) \leq \pi.
  
  _Example_:
*************** _Example_:
*** 5854,5861 ****
            END PROGRAM
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DACOSH(X)'   `REAL(8) X'   `REAL(8)'     GNU extension
  
  _See also_:
       Inverse function: *note COSH::
--- 5801,5808 ----
            END PROGRAM
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DACOSH(X)'    'REAL(8) X'    'REAL(8)'      GNU extension
  
  _See also_:
       Inverse function: *note COSH::
*************** _See also_:
*** 5863,5873 ****
  
  File: gfortran.info,  Node: ADJUSTL,  Next: ADJUSTR,  Prev: ACOSH,  Up: Intrinsic Procedures
  
! 9.8 `ADJUSTL' -- Left adjust a string
  =====================================
  
  _Description_:
!      `ADJUSTL(STRING)' will left adjust a string by removing leading
       spaces.  Spaces are inserted at the end of the string as needed.
  
  _Standard_:
--- 5810,5820 ----
  
  File: gfortran.info,  Node: ADJUSTL,  Next: ADJUSTR,  Prev: ACOSH,  Up: Intrinsic Procedures
  
! 9.8 'ADJUSTL' -- Left adjust a string
  =====================================
  
  _Description_:
!      'ADJUSTL(STRING)' will left adjust a string by removing leading
       spaces.  Spaces are inserted at the end of the string as needed.
  
  _Standard_:
*************** _Class_:
*** 5877,5889 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ADJUSTL(STRING)'
  
  _Arguments_:
!      STRING     The type shall be `CHARACTER'.
  
  _Return value_:
!      The return value is of type `CHARACTER' and of the same kind as
       STRING where leading spaces are removed and the same number of
       spaces are inserted on the end of STRING.
  
--- 5824,5836 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ADJUSTL(STRING)'
  
  _Arguments_:
!      STRING      The type shall be 'CHARACTER'.
  
  _Return value_:
!      The return value is of type 'CHARACTER' and of the same kind as
       STRING where leading spaces are removed and the same number of
       spaces are inserted on the end of STRING.
  
*************** _See also_:
*** 5900,5910 ****
  
  File: gfortran.info,  Node: ADJUSTR,  Next: AIMAG,  Prev: ADJUSTL,  Up: Intrinsic Procedures
  
! 9.9 `ADJUSTR' -- Right adjust a string
  ======================================
  
  _Description_:
!      `ADJUSTR(STRING)' will right adjust a string by removing trailing
       spaces.  Spaces are inserted at the start of the string as needed.
  
  _Standard_:
--- 5847,5857 ----
  
  File: gfortran.info,  Node: ADJUSTR,  Next: AIMAG,  Prev: ADJUSTL,  Up: Intrinsic Procedures
  
! 9.9 'ADJUSTR' -- Right adjust a string
  ======================================
  
  _Description_:
!      'ADJUSTR(STRING)' will right adjust a string by removing trailing
       spaces.  Spaces are inserted at the start of the string as needed.
  
  _Standard_:
*************** _Class_:
*** 5914,5926 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ADJUSTR(STRING)'
  
  _Arguments_:
!      STR        The type shall be `CHARACTER'.
  
  _Return value_:
!      The return value is of type `CHARACTER' and of the same kind as
       STRING where trailing spaces are removed and the same number of
       spaces are inserted at the start of STRING.
  
--- 5861,5873 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ADJUSTR(STRING)'
  
  _Arguments_:
!      STR         The type shall be 'CHARACTER'.
  
  _Return value_:
!      The return value is of type 'CHARACTER' and of the same kind as
       STRING where trailing spaces are removed and the same number of
       spaces are inserted at the start of STRING.
  
*************** _See also_:
*** 5937,5949 ****
  
  File: gfortran.info,  Node: AIMAG,  Next: AINT,  Prev: ADJUSTR,  Up: Intrinsic Procedures
  
! 9.10 `AIMAG' -- Imaginary part of complex number
  ================================================
  
  _Description_:
!      `AIMAG(Z)' yields the imaginary part of complex argument `Z'.  The
!      `IMAG(Z)' and `IMAGPART(Z)' intrinsic functions are provided for
!      compatibility with `g77', and their use in new code is strongly
       discouraged.
  
  _Standard_:
--- 5884,5896 ----
  
  File: gfortran.info,  Node: AIMAG,  Next: AINT,  Prev: ADJUSTR,  Up: Intrinsic Procedures
  
! 9.10 'AIMAG' -- Imaginary part of complex number
  ================================================
  
  _Description_:
!      'AIMAG(Z)' yields the imaginary part of complex argument 'Z'.  The
!      'IMAG(Z)' and 'IMAGPART(Z)' intrinsic functions are provided for
!      compatibility with 'g77', and their use in new code is strongly
       discouraged.
  
  _Standard_:
*************** _Class_:
*** 5953,5965 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = AIMAG(Z)'
  
  _Arguments_:
!      Z          The type of the argument shall be `COMPLEX'.
  
  _Return value_:
!      The return value is of type `REAL' with the kind type parameter of
       the argument.
  
  _Example_:
--- 5900,5912 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = AIMAG(Z)'
  
  _Arguments_:
!      Z           The type of the argument shall be 'COMPLEX'.
  
  _Return value_:
!      The return value is of type 'REAL' with the kind type parameter of
       the argument.
  
  _Example_:
*************** _Example_:
*** 5972,5992 ****
            end program test_aimag
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `AIMAG(Z)'    `COMPLEX Z'   `REAL'        GNU extension
!      `DIMAG(Z)'    `COMPLEX(8)   `REAL(8)'     GNU extension
!                    Z'                          
!      `IMAG(Z)'     `COMPLEX Z'   `REAL'        GNU extension
!      `IMAGPART(Z)' `COMPLEX Z'   `REAL'        GNU extension
  
  
  File: gfortran.info,  Node: AINT,  Next: ALARM,  Prev: AIMAG,  Up: Intrinsic Procedures
  
! 9.11 `AINT' -- Truncate to a whole number
  =========================================
  
  _Description_:
!      `AINT(A [, KIND])' truncates its argument to a whole number.
  
  _Standard_:
       Fortran 77 and later
--- 5919,5939 ----
            end program test_aimag
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'AIMAG(Z)'     'COMPLEX Z'    'REAL'         GNU extension
!      'DIMAG(Z)'     'COMPLEX(8)    'REAL(8)'      GNU extension
!                     Z'
!      'IMAG(Z)'      'COMPLEX Z'    'REAL'         GNU extension
!      'IMAGPART(Z)'  'COMPLEX Z'    'REAL'         GNU extension
  
  
  File: gfortran.info,  Node: AINT,  Next: ALARM,  Prev: AIMAG,  Up: Intrinsic Procedures
  
! 9.11 'AINT' -- Truncate to a whole number
  =========================================
  
  _Description_:
!      'AINT(A [, KIND])' truncates its argument to a whole number.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 5995,6013 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = AINT(A [, KIND])'
  
  _Arguments_:
!      A          The type of the argument shall be `REAL'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `REAL' with the kind type parameter of
       the argument if the optional KIND is absent; otherwise, the kind
       type parameter will be given by KIND.  If the magnitude of X is
!      less than one, `AINT(X)' returns zero.  If the magnitude is equal
       to or greater than one then it returns the largest whole number
       that does not exceed its magnitude.  The sign is the same as the
       sign of X.
--- 5942,5960 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = AINT(A [, KIND])'
  
  _Arguments_:
!      A           The type of the argument shall be 'REAL'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'REAL' with the kind type parameter of
       the argument if the optional KIND is absent; otherwise, the kind
       type parameter will be given by KIND.  If the magnitude of X is
!      less than one, 'AINT(X)' returns zero.  If the magnitude is equal
       to or greater than one then it returns the largest whole number
       that does not exceed its magnitude.  The sign is the same as the
       sign of X.
*************** _Example_:
*** 6023,6047 ****
            end program test_aint
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `AINT(A)'     `REAL(4) A'   `REAL(4)'     Fortran 77 and
!                                                later
!      `DINT(A)'     `REAL(8) A'   `REAL(8)'     Fortran 77 and
!                                                later
  
  
  File: gfortran.info,  Node: ALARM,  Next: ALL,  Prev: AINT,  Up: Intrinsic Procedures
  
! 9.12 `ALARM' -- Execute a routine after a given delay
  =====================================================
  
  _Description_:
!      `ALARM(SECONDS, HANDLER [, STATUS])' causes external subroutine
!      HANDLER to be executed after a delay of SECONDS by using
!      `alarm(2)' to set up a signal and `signal(2)' to catch it. If
!      STATUS is supplied, it will be returned with the number of seconds
!      remaining until any previously scheduled alarm was due to be
!      delivered, or zero if there was no previously scheduled alarm.
  
  _Standard_:
       GNU extension
--- 5970,5994 ----
            end program test_aint
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'AINT(A)'      'REAL(4) A'    'REAL(4)'      Fortran 77 and
!                                                   later
!      'DINT(A)'      'REAL(8) A'    'REAL(8)'      Fortran 77 and
!                                                   later
  
  
  File: gfortran.info,  Node: ALARM,  Next: ALL,  Prev: AINT,  Up: Intrinsic Procedures
  
! 9.12 'ALARM' -- Execute a routine after a given delay
  =====================================================
  
  _Description_:
!      'ALARM(SECONDS, HANDLER [, STATUS])' causes external subroutine
!      HANDLER to be executed after a delay of SECONDS by using 'alarm(2)'
!      to set up a signal and 'signal(2)' to catch it.  If STATUS is
!      supplied, it will be returned with the number of seconds remaining
!      until any previously scheduled alarm was due to be delivered, or
!      zero if there was no previously scheduled alarm.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 6050,6069 ****
       Subroutine
  
  _Syntax_:
!      `CALL ALARM(SECONDS, HANDLER [, STATUS])'
  
  _Arguments_:
!      SECONDS    The type of the argument shall be a scalar
!                 `INTEGER'. It is `INTENT(IN)'.
!      HANDLER    Signal handler (`INTEGER FUNCTION' or
!                 `SUBROUTINE') or dummy/global `INTEGER'
!                 scalar. The scalar values may be either
!                 `SIG_IGN=1' to ignore the alarm generated or
!                 `SIG_DFL=0' to set the default action. It is
!                 `INTENT(IN)'.
!      STATUS     (Optional) STATUS shall be a scalar variable
!                 of the default `INTEGER' kind. It is
!                 `INTENT(OUT)'.
  
  _Example_:
            program test_alarm
--- 5997,6015 ----
       Subroutine
  
  _Syntax_:
!      'CALL ALARM(SECONDS, HANDLER [, STATUS])'
  
  _Arguments_:
!      SECONDS     The type of the argument shall be a scalar
!                  'INTEGER'.  It is 'INTENT(IN)'.
!      HANDLER     Signal handler ('INTEGER FUNCTION' or
!                  'SUBROUTINE') or dummy/global 'INTEGER' scalar.
!                  The scalar values may be either 'SIG_IGN=1' to
!                  ignore the alarm generated or 'SIG_DFL=0' to set
!                  the default action.  It is 'INTENT(IN)'.
!      STATUS      (Optional) STATUS shall be a scalar variable of
!                  the default 'INTEGER' kind.  It is
!                  'INTENT(OUT)'.
  
  _Example_:
            program test_alarm
*************** _Example_:
*** 6079,6089 ****
  
  File: gfortran.info,  Node: ALL,  Next: ALLOCATED,  Prev: ALARM,  Up: Intrinsic Procedures
  
! 9.13 `ALL' -- All values in MASK along DIM are true
  ===================================================
  
  _Description_:
!      `ALL(MASK [, DIM])' determines if all the values are true in MASK
       in the array along dimension DIM.
  
  _Standard_:
--- 6025,6035 ----
  
  File: gfortran.info,  Node: ALL,  Next: ALLOCATED,  Prev: ALARM,  Up: Intrinsic Procedures
  
! 9.13 'ALL' -- All values in MASK along DIM are true
  ===================================================
  
  _Description_:
!      'ALL(MASK [, DIM])' determines if all the values are true in MASK
       in the array along dimension DIM.
  
  _Standard_:
*************** _Class_:
*** 6093,6122 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = ALL(MASK [, DIM])'
  
  _Arguments_:
!      MASK       The type of the argument shall be `LOGICAL' and
!                 it shall not be scalar.
!      DIM        (Optional) DIM shall be a scalar integer with
!                 a value that lies between one and the rank of
!                 MASK.
  
  _Return value_:
!      `ALL(MASK)' returns a scalar value of type `LOGICAL' where the
!      kind type parameter is the same as the kind type parameter of
!      MASK.  If DIM is present, then `ALL(MASK, DIM)' returns an array
!      with the rank of MASK minus 1.  The shape is determined from the
!      shape of MASK where the DIM dimension is elided.
! 
!     (A)
!           `ALL(MASK)' is true if all elements of MASK are true.  It
!           also is true if MASK has zero size; otherwise, it is false.
  
!     (B)
!           If the rank of MASK is one, then `ALL(MASK,DIM)' is equivalent
!           to `ALL(MASK)'.  If the rank is greater than one, then
!           `ALL(MASK,DIM)' is determined by applying `ALL' to the array
            sections.
  
  _Example_:
--- 6039,6067 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = ALL(MASK [, DIM])'
  
  _Arguments_:
!      MASK        The type of the argument shall be 'LOGICAL' and
!                  it shall not be scalar.
!      DIM         (Optional) DIM shall be a scalar integer with a
!                  value that lies between one and the rank of
!                  MASK.
  
  _Return value_:
!      'ALL(MASK)' returns a scalar value of type 'LOGICAL' where the kind
!      type parameter is the same as the kind type parameter of MASK.  If
!      DIM is present, then 'ALL(MASK, DIM)' returns an array with the
!      rank of MASK minus 1.  The shape is determined from the shape of
!      MASK where the DIM dimension is elided.
  
!      (A)
!           'ALL(MASK)' is true if all elements of MASK are true.  It also
!           is true if MASK has zero size; otherwise, it is false.
!      (B)
!           If the rank of MASK is one, then 'ALL(MASK,DIM)' is equivalent
!           to 'ALL(MASK)'.  If the rank is greater than one, then
!           'ALL(MASK,DIM)' is determined by applying 'ALL' to the array
            sections.
  
  _Example_:
*************** _Example_:
*** 6139,6170 ****
  
  File: gfortran.info,  Node: ALLOCATED,  Next: AND,  Prev: ALL,  Up: Intrinsic Procedures
  
! 9.14 `ALLOCATED' -- Status of an allocatable entity
  ===================================================
  
  _Description_:
!      `ALLOCATED(ARRAY)' and `ALLOCATED(SCALAR)' check the allocation
       status of ARRAY and SCALAR, respectively.
  
  _Standard_:
!      Fortran 95 and later.  Note, the `SCALAR=' keyword and allocatable
       scalar entities are available in Fortran 2003 and later.
  
  _Class_:
       Inquiry function
  
  _Syntax_:
!      `RESULT = ALLOCATED(ARRAY)'
!      `RESULT = ALLOCATED(SCALAR)'
  
  _Arguments_:
!      ARRAY      The argument shall be an `ALLOCATABLE' array.
!      SCALAR     The argument shall be an `ALLOCATABLE' scalar.
  
  _Return value_:
!      The return value is a scalar `LOGICAL' with the default logical
!      kind type parameter.  If the argument is allocated, then the
!      result is `.TRUE.'; otherwise, it returns `.FALSE.'
  
  _Example_:
            program test_allocated
--- 6084,6115 ----
  
  File: gfortran.info,  Node: ALLOCATED,  Next: AND,  Prev: ALL,  Up: Intrinsic Procedures
  
! 9.14 'ALLOCATED' -- Status of an allocatable entity
  ===================================================
  
  _Description_:
!      'ALLOCATED(ARRAY)' and 'ALLOCATED(SCALAR)' check the allocation
       status of ARRAY and SCALAR, respectively.
  
  _Standard_:
!      Fortran 95 and later.  Note, the 'SCALAR=' keyword and allocatable
       scalar entities are available in Fortran 2003 and later.
  
  _Class_:
       Inquiry function
  
  _Syntax_:
!      'RESULT = ALLOCATED(ARRAY)'
!      'RESULT = ALLOCATED(SCALAR)'
  
  _Arguments_:
!      ARRAY       The argument shall be an 'ALLOCATABLE' array.
!      SCALAR      The argument shall be an 'ALLOCATABLE' scalar.
  
  _Return value_:
!      The return value is a scalar 'LOGICAL' with the default logical
!      kind type parameter.  If the argument is allocated, then the result
!      is '.TRUE.'; otherwise, it returns '.FALSE.'
  
  _Example_:
            program test_allocated
*************** _Example_:
*** 6176,6186 ****
  
  File: gfortran.info,  Node: AND,  Next: ANINT,  Prev: ALLOCATED,  Up: Intrinsic Procedures
  
! 9.15 `AND' -- Bitwise logical AND
  =================================
  
  _Description_:
!      Bitwise logical `AND'.
  
       This intrinsic routine is provided for backwards compatibility with
       GNU Fortran 77.  For integer arguments, programmers should consider
--- 6121,6131 ----
  
  File: gfortran.info,  Node: AND,  Next: ANINT,  Prev: ALLOCATED,  Up: Intrinsic Procedures
  
! 9.15 'AND' -- Bitwise logical AND
  =================================
  
  _Description_:
!      Bitwise logical 'AND'.
  
       This intrinsic routine is provided for backwards compatibility with
       GNU Fortran 77.  For integer arguments, programmers should consider
*************** _Class_:
*** 6194,6211 ****
       Function
  
  _Syntax_:
!      `RESULT = AND(I, J)'
  
  _Arguments_:
!      I          The type shall be either a scalar `INTEGER'
!                 type or a scalar `LOGICAL' type.
!      J          The type shall be the same as the type of I.
  
  _Return value_:
!      The return type is either a scalar `INTEGER' or a scalar
!      `LOGICAL'.  If the kind type parameters differ, then the smaller
!      kind type is implicitly converted to larger kind, and the return
!      has the larger kind.
  
  _Example_:
            PROGRAM test_and
--- 6139,6156 ----
       Function
  
  _Syntax_:
!      'RESULT = AND(I, J)'
  
  _Arguments_:
!      I           The type shall be either a scalar 'INTEGER' type
!                  or a scalar 'LOGICAL' type.
!      J           The type shall be the same as the type of I.
  
  _Return value_:
!      The return type is either a scalar 'INTEGER' or a scalar 'LOGICAL'.
!      If the kind type parameters differ, then the smaller kind type is
!      implicitly converted to larger kind, and the return has the larger
!      kind.
  
  _Example_:
            PROGRAM test_and
*************** _See also_:
*** 6223,6233 ****
  
  File: gfortran.info,  Node: ANINT,  Next: ANY,  Prev: AND,  Up: Intrinsic Procedures
  
! 9.16 `ANINT' -- Nearest whole number
  ====================================
  
  _Description_:
!      `ANINT(A [, KIND])' rounds its argument to the nearest whole
       number.
  
  _Standard_:
--- 6168,6178 ----
  
  File: gfortran.info,  Node: ANINT,  Next: ANY,  Prev: AND,  Up: Intrinsic Procedures
  
! 9.16 'ANINT' -- Nearest whole number
  ====================================
  
  _Description_:
!      'ANINT(A [, KIND])' rounds its argument to the nearest whole
       number.
  
  _Standard_:
*************** _Class_:
*** 6237,6256 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ANINT(A [, KIND])'
  
  _Arguments_:
!      A          The type of the argument shall be `REAL'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
       The return value is of type real with the kind type parameter of
       the argument if the optional KIND is absent; otherwise, the kind
       type parameter will be given by KIND.  If A is greater than zero,
!      `ANINT(A)' returns `AINT(X+0.5)'.  If A is less than or equal to
!      zero then it returns `AINT(X-0.5)'.
  
  _Example_:
            program test_anint
--- 6182,6201 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ANINT(A [, KIND])'
  
  _Arguments_:
!      A           The type of the argument shall be 'REAL'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
       The return value is of type real with the kind type parameter of
       the argument if the optional KIND is absent; otherwise, the kind
       type parameter will be given by KIND.  If A is greater than zero,
!      'ANINT(A)' returns 'AINT(X+0.5)'.  If A is less than or equal to
!      zero then it returns 'AINT(X-0.5)'.
  
  _Example_:
            program test_anint
*************** _Example_:
*** 6263,6283 ****
            end program test_anint
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `AINT(A)'     `REAL(4) A'   `REAL(4)'     Fortran 77 and
!                                                later
!      `DNINT(A)'    `REAL(8) A'   `REAL(8)'     Fortran 77 and
!                                                later
  
  
  File: gfortran.info,  Node: ANY,  Next: ASIN,  Prev: ANINT,  Up: Intrinsic Procedures
  
! 9.17 `ANY' -- Any value in MASK along DIM is true
  =================================================
  
  _Description_:
!      `ANY(MASK [, DIM])' determines if any of the values in the logical
!      array MASK along dimension DIM are `.TRUE.'.
  
  _Standard_:
       Fortran 95 and later
--- 6208,6228 ----
            end program test_anint
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'AINT(A)'      'REAL(4) A'    'REAL(4)'      Fortran 77 and
!                                                   later
!      'DNINT(A)'     'REAL(8) A'    'REAL(8)'      Fortran 77 and
!                                                   later
  
  
  File: gfortran.info,  Node: ANY,  Next: ASIN,  Prev: ANINT,  Up: Intrinsic Procedures
  
! 9.17 'ANY' -- Any value in MASK along DIM is true
  =================================================
  
  _Description_:
!      'ANY(MASK [, DIM])' determines if any of the values in the logical
!      array MASK along dimension DIM are '.TRUE.'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 6286,6316 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = ANY(MASK [, DIM])'
  
  _Arguments_:
!      MASK       The type of the argument shall be `LOGICAL' and
!                 it shall not be scalar.
!      DIM        (Optional) DIM shall be a scalar integer with
!                 a value that lies between one and the rank of
!                 MASK.
  
  _Return value_:
!      `ANY(MASK)' returns a scalar value of type `LOGICAL' where the
!      kind type parameter is the same as the kind type parameter of
!      MASK.  If DIM is present, then `ANY(MASK, DIM)' returns an array
!      with the rank of MASK minus 1.  The shape is determined from the
!      shape of MASK where the DIM dimension is elided.
! 
!     (A)
!           `ANY(MASK)' is true if any element of MASK is true;
!           otherwise, it is false.  It also is false if MASK has zero
!           size.
  
!     (B)
!           If the rank of MASK is one, then `ANY(MASK,DIM)' is equivalent
!           to `ANY(MASK)'.  If the rank is greater than one, then
!           `ANY(MASK,DIM)' is determined by applying `ANY' to the array
            sections.
  
  _Example_:
--- 6231,6259 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = ANY(MASK [, DIM])'
  
  _Arguments_:
!      MASK        The type of the argument shall be 'LOGICAL' and
!                  it shall not be scalar.
!      DIM         (Optional) DIM shall be a scalar integer with a
!                  value that lies between one and the rank of
!                  MASK.
  
  _Return value_:
!      'ANY(MASK)' returns a scalar value of type 'LOGICAL' where the kind
!      type parameter is the same as the kind type parameter of MASK.  If
!      DIM is present, then 'ANY(MASK, DIM)' returns an array with the
!      rank of MASK minus 1.  The shape is determined from the shape of
!      MASK where the DIM dimension is elided.
  
!      (A)
!           'ANY(MASK)' is true if any element of MASK is true; otherwise,
!           it is false.  It also is false if MASK has zero size.
!      (B)
!           If the rank of MASK is one, then 'ANY(MASK,DIM)' is equivalent
!           to 'ANY(MASK)'.  If the rank is greater than one, then
!           'ANY(MASK,DIM)' is determined by applying 'ANY' to the array
            sections.
  
  _Example_:
*************** _Example_:
*** 6333,6343 ****
  
  File: gfortran.info,  Node: ASIN,  Next: ASINH,  Prev: ANY,  Up: Intrinsic Procedures
  
! 9.18 `ASIN' -- Arcsine function
  ===============================
  
  _Description_:
!      `ASIN(X)' computes the arcsine of its X (inverse of `SIN(X)').
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
--- 6276,6286 ----
  
  File: gfortran.info,  Node: ASIN,  Next: ASINH,  Prev: ANY,  Up: Intrinsic Procedures
  
! 9.18 'ASIN' -- Arcsine function
  ===============================
  
  _Description_:
!      'ASIN(X)' computes the arcsine of its X (inverse of 'SIN(X)').
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
*************** _Class_:
*** 6346,6357 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ASIN(X)'
  
  _Arguments_:
!      X          The type shall be either `REAL' and a
!                 magnitude that is less than or equal to one -
!                 or be `COMPLEX'.
  
  _Return value_:
       The return value is of the same type and kind as X.  The real part
--- 6289,6300 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ASIN(X)'
  
  _Arguments_:
!      X           The type shall be either 'REAL' and a magnitude
!                  that is less than or equal to one - or be
!                  'COMPLEX'.
  
  _Return value_:
       The return value is of the same type and kind as X.  The real part
*************** _Example_:
*** 6365,6388 ****
            end program test_asin
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `ASIN(X)'     `REAL(4) X'   `REAL(4)'     Fortran 77 and
!                                                later
!      `DASIN(X)'    `REAL(8) X'   `REAL(8)'     Fortran 77 and
!                                                later
  
  _See also_:
       Inverse function: *note SIN::
  
- 
  
  File: gfortran.info,  Node: ASINH,  Next: ASSOCIATED,  Prev: ASIN,  Up: Intrinsic Procedures
  
! 9.19 `ASINH' -- Inverse hyperbolic sine function
  ================================================
  
  _Description_:
!      `ASINH(X)' computes the inverse hyperbolic sine of X.
  
  _Standard_:
       Fortran 2008 and later
--- 6308,6330 ----
            end program test_asin
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'ASIN(X)'      'REAL(4) X'    'REAL(4)'      Fortran 77 and
!                                                   later
!      'DASIN(X)'     'REAL(8) X'    'REAL(8)'      Fortran 77 and
!                                                   later
  
  _See also_:
       Inverse function: *note SIN::
  
  
  File: gfortran.info,  Node: ASINH,  Next: ASSOCIATED,  Prev: ASIN,  Up: Intrinsic Procedures
  
! 9.19 'ASINH' -- Inverse hyperbolic sine function
  ================================================
  
  _Description_:
!      'ASINH(X)' computes the inverse hyperbolic sine of X.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 6391,6403 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ASINH(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
!      The return value is of the same type and kind as  X. If X is
       complex, the imaginary part of the result is in radians and lies
       between -\pi/2 \leq \Im \asinh(x) \leq \pi/2.
  
--- 6333,6345 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ASINH(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value is of the same type and kind as X.  If X is
       complex, the imaginary part of the result is in radians and lies
       between -\pi/2 \leq \Im \asinh(x) \leq \pi/2.
  
*************** _Example_:
*** 6408,6415 ****
            END PROGRAM
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DASINH(X)'   `REAL(8) X'   `REAL(8)'     GNU extension.
  
  _See also_:
       Inverse function: *note SINH::
--- 6350,6357 ----
            END PROGRAM
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DASINH(X)'    'REAL(8) X'    'REAL(8)'      GNU extension.
  
  _See also_:
       Inverse function: *note SINH::
*************** _See also_:
*** 6417,6427 ****
  
  File: gfortran.info,  Node: ASSOCIATED,  Next: ATAN,  Prev: ASINH,  Up: Intrinsic Procedures
  
! 9.20 `ASSOCIATED' -- Status of a pointer or pointer/target pair
  ===============================================================
  
  _Description_:
!      `ASSOCIATED(POINTER [, TARGET])' determines the status of the
       pointer POINTER or if POINTER is associated with the target TARGET.
  
  _Standard_:
--- 6359,6369 ----
  
  File: gfortran.info,  Node: ASSOCIATED,  Next: ATAN,  Prev: ASINH,  Up: Intrinsic Procedures
  
! 9.20 'ASSOCIATED' -- Status of a pointer or pointer/target pair
  ===============================================================
  
  _Description_:
!      'ASSOCIATED(POINTER [, TARGET])' determines the status of the
       pointer POINTER or if POINTER is associated with the target TARGET.
  
  _Standard_:
*************** _Class_:
*** 6431,6473 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = ASSOCIATED(POINTER [, TARGET])'
  
  _Arguments_:
!      POINTER    POINTER shall have the `POINTER' attribute and
!                 it can be of any type.
!      TARGET     (Optional) TARGET shall be a pointer or a
!                 target.  It must have the same type, kind type
!                 parameter, and array rank as POINTER.
       The association status of neither POINTER nor TARGET shall be
       undefined.
  
  _Return value_:
!      `ASSOCIATED(POINTER)' returns a scalar value of type `LOGICAL(4)'.
       There are several cases:
!     (A) When the optional TARGET is not present then
!           `ASSOCIATED(POINTER)' is true if POINTER is associated with a
            target; otherwise, it returns false.
! 
!     (B) If TARGET is present and a scalar target, the result is true if
            TARGET is not a zero-sized storage sequence and the target
            associated with POINTER occupies the same storage units.  If
            POINTER is disassociated, the result is false.
! 
!     (C) If TARGET is present and an array target, the result is true if
            TARGET and POINTER have the same shape, are not zero-sized
            arrays, are arrays whose elements are not zero-sized storage
            sequences, and TARGET and POINTER occupy the same storage
            units in array element order.  As in case(B), the result is
            false, if POINTER is disassociated.
! 
!     (D) If TARGET is present and an scalar pointer, the result is true
            if TARGET is associated with POINTER, the target associated
            with TARGET are not zero-sized storage sequences and occupy
!           the same storage units.  The result is false, if either
!           TARGET or POINTER is disassociated.
! 
!     (E) If TARGET is present and an array pointer, the result is true if
            target associated with POINTER and the target associated with
            TARGET have the same shape, are not zero-sized arrays, are
            arrays whose elements are not zero-sized storage sequences,
--- 6373,6411 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = ASSOCIATED(POINTER [, TARGET])'
  
  _Arguments_:
!      POINTER     POINTER shall have the 'POINTER' attribute and
!                  it can be of any type.
!      TARGET      (Optional) TARGET shall be a pointer or a
!                  target.  It must have the same type, kind type
!                  parameter, and array rank as POINTER.
       The association status of neither POINTER nor TARGET shall be
       undefined.
  
  _Return value_:
!      'ASSOCIATED(POINTER)' returns a scalar value of type 'LOGICAL(4)'.
       There are several cases:
!      (A) When the optional TARGET is not present then
!           'ASSOCIATED(POINTER)' is true if POINTER is associated with a
            target; otherwise, it returns false.
!      (B) If TARGET is present and a scalar target, the result is true if
            TARGET is not a zero-sized storage sequence and the target
            associated with POINTER occupies the same storage units.  If
            POINTER is disassociated, the result is false.
!      (C) If TARGET is present and an array target, the result is true if
            TARGET and POINTER have the same shape, are not zero-sized
            arrays, are arrays whose elements are not zero-sized storage
            sequences, and TARGET and POINTER occupy the same storage
            units in array element order.  As in case(B), the result is
            false, if POINTER is disassociated.
!      (D) If TARGET is present and an scalar pointer, the result is true
            if TARGET is associated with POINTER, the target associated
            with TARGET are not zero-sized storage sequences and occupy
!           the same storage units.  The result is false, if either TARGET
!           or POINTER is disassociated.
!      (E) If TARGET is present and an array pointer, the result is true if
            target associated with POINTER and the target associated with
            TARGET have the same shape, are not zero-sized arrays, are
            arrays whose elements are not zero-sized storage sequences,
*************** _See also_:
*** 6491,6501 ****
  
  File: gfortran.info,  Node: ATAN,  Next: ATAN2,  Prev: ASSOCIATED,  Up: Intrinsic Procedures
  
! 9.21 `ATAN' -- Arctangent function
  ==================================
  
  _Description_:
!      `ATAN(X)' computes the arctangent of X.
  
  _Standard_:
       Fortran 77 and later, for a complex argument and for two arguments
--- 6429,6439 ----
  
  File: gfortran.info,  Node: ATAN,  Next: ATAN2,  Prev: ASSOCIATED,  Up: Intrinsic Procedures
  
! 9.21 'ATAN' -- Arctangent function
  ==================================
  
  _Description_:
!      'ATAN(X)' computes the arctangent of X.
  
  _Standard_:
       Fortran 77 and later, for a complex argument and for two arguments
*************** _Class_:
*** 6505,6525 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ATAN(X)'
!      `RESULT = ATAN(Y, X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'; if Y is
!                 present, X shall be REAL.
!      Y shall    
!      be of the  
!      same type  
!      and kind   
!      as X.      
  
  _Return value_:
       The return value is of the same type and kind as X.  If Y is
!      present, the result is identical to `ATAN2(Y,X)'.  Otherwise, it
       the arcus tangent of X, where the real part of the result is in
       radians and lies in the range -\pi/2 \leq \Re \atan(x) \leq \pi/2.
  
--- 6443,6463 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ATAN(X)'
!      'RESULT = ATAN(Y, X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'; if Y is
!                  present, X shall be REAL.
!      Y shall
!      be of the
!      same type
!      and kind
!      as X.
  
  _Return value_:
       The return value is of the same type and kind as X.  If Y is
!      present, the result is identical to 'ATAN2(Y,X)'.  Otherwise, it
       the arcus tangent of X, where the real part of the result is in
       radians and lies in the range -\pi/2 \leq \Re \atan(x) \leq \pi/2.
  
*************** _Example_:
*** 6530,6555 ****
            end program test_atan
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `ATAN(X)'     `REAL(4) X'   `REAL(4)'     Fortran 77 and
!                                                later
!      `DATAN(X)'    `REAL(8) X'   `REAL(8)'     Fortran 77 and
!                                                later
  
  _See also_:
       Inverse function: *note TAN::
  
- 
  
  File: gfortran.info,  Node: ATAN2,  Next: ATANH,  Prev: ATAN,  Up: Intrinsic Procedures
  
! 9.22 `ATAN2' -- Arctangent function
  ===================================
  
  _Description_:
!      `ATAN2(Y, X)' computes the principal value of the argument
!      function of the complex number X + i Y. This function can be used
!      to transform from Cartesian into polar coordinates and allows to
       determine the angle in the correct quadrant.
  
  _Standard_:
--- 6468,6492 ----
            end program test_atan
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'ATAN(X)'      'REAL(4) X'    'REAL(4)'      Fortran 77 and
!                                                   later
!      'DATAN(X)'     'REAL(8) X'    'REAL(8)'      Fortran 77 and
!                                                   later
  
  _See also_:
       Inverse function: *note TAN::
  
  
  File: gfortran.info,  Node: ATAN2,  Next: ATANH,  Prev: ATAN,  Up: Intrinsic Procedures
  
! 9.22 'ATAN2' -- Arctangent function
  ===================================
  
  _Description_:
!      'ATAN2(Y, X)' computes the principal value of the argument function
!      of the complex number X + i Y. This function can be used to
!      transform from Cartesian into polar coordinates and allows to
       determine the angle in the correct quadrant.
  
  _Standard_:
*************** _Class_:
*** 6559,6575 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ATAN2(Y, X)'
  
  _Arguments_:
!      Y          The type shall be `REAL'.
!      X          The type and kind type parameter shall be the
!                 same as Y.  If Y is zero, then X must be
!                 nonzero.
  
  _Return value_:
!      The return value has the same type and kind type parameter as Y. It
!      is the principal value of the complex number X + i Y.  If X is
       nonzero, then it lies in the range -\pi \le \atan (x) \leq \pi.
       The sign is positive if Y is positive.  If Y is zero, then the
       return value is zero if X is strictly positive, \pi if X is
--- 6496,6512 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ATAN2(Y, X)'
  
  _Arguments_:
!      Y           The type shall be 'REAL'.
!      X           The type and kind type parameter shall be the
!                  same as Y.  If Y is zero, then X must be
!                  nonzero.
  
  _Return value_:
!      The return value has the same type and kind type parameter as Y.
!      It is the principal value of the complex number X + i Y. If X is
       nonzero, then it lies in the range -\pi \le \atan (x) \leq \pi.
       The sign is positive if Y is positive.  If Y is zero, then the
       return value is zero if X is strictly positive, \pi if X is
*************** _Example_:
*** 6584,6603 ****
            end program test_atan2
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `ATAN2(X,     `REAL(4) X,   `REAL(4)'     Fortran 77 and
!      Y)'           Y'                          later
!      `DATAN2(X,    `REAL(8) X,   `REAL(8)'     Fortran 77 and
!      Y)'           Y'                          later
  
  
  File: gfortran.info,  Node: ATANH,  Next: ATOMIC_ADD,  Prev: ATAN2,  Up: Intrinsic Procedures
  
! 9.23 `ATANH' -- Inverse hyperbolic tangent function
  ===================================================
  
  _Description_:
!      `ATANH(X)' computes the inverse hyperbolic tangent of X.
  
  _Standard_:
       Fortran 2008 and later
--- 6521,6540 ----
            end program test_atan2
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'ATAN2(X,      'REAL(4) X,    'REAL(4)'      Fortran 77 and
!      Y)'            Y'                            later
!      'DATAN2(X,     'REAL(8) X,    'REAL(8)'      Fortran 77 and
!      Y)'            Y'                            later
  
  
  File: gfortran.info,  Node: ATANH,  Next: ATOMIC_ADD,  Prev: ATAN2,  Up: Intrinsic Procedures
  
! 9.23 'ATANH' -- Inverse hyperbolic tangent function
  ===================================================
  
  _Description_:
!      'ATANH(X)' computes the inverse hyperbolic tangent of X.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 6606,6618 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ATANH(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
!      The return value has same type and kind as X. If X is complex, the
       imaginary part of the result is in radians and lies between -\pi/2
       \leq \Im \atanh(x) \leq \pi/2.
  
--- 6543,6555 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ATANH(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value has same type and kind as X.  If X is complex, the
       imaginary part of the result is in radians and lies between -\pi/2
       \leq \Im \atanh(x) \leq \pi/2.
  
*************** _Example_:
*** 6623,6630 ****
            END PROGRAM
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DATANH(X)'   `REAL(8) X'   `REAL(8)'     GNU extension
  
  _See also_:
       Inverse function: *note TANH::
--- 6560,6567 ----
            END PROGRAM
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DATANH(X)'    'REAL(8) X'    'REAL(8)'      GNU extension
  
  _See also_:
       Inverse function: *note TANH::
*************** _See also_:
*** 6632,6649 ****
  
  File: gfortran.info,  Node: ATOMIC_ADD,  Next: ATOMIC_AND,  Prev: ATANH,  Up: Intrinsic Procedures
  
! 9.24 `ATOMIC_ADD' -- Atomic ADD operation
  =========================================
  
  _Description_:
!      `ATOMIC_ADD(ATOM, VALUE)' atomically adds the value of VAR to the
!      variable ATOM. When STAT is present and the invokation was
!      successful, it is assigned the value 0. If it is present and the
       invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
--- 6569,6586 ----
  
  File: gfortran.info,  Node: ATOMIC_ADD,  Next: ATOMIC_AND,  Prev: ATANH,  Up: Intrinsic Procedures
  
! 9.24 'ATOMIC_ADD' -- Atomic ADD operation
  =========================================
  
  _Description_:
!      'ATOMIC_ADD(ATOM, VALUE)' atomically adds the value of VAR to the
!      variable ATOM.  When STAT is present and the invokation was
!      successful, it is assigned the value 0.  If it is present and the
       invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of 'ISO_FORTRAN_ENV''s
!      'STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      'STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
*************** _Class_:
*** 6652,6667 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_ADD (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of integer
!                 type with `ATOMIC_INT_KIND' kind.
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 6589,6603 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_ADD (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of integer
!                  type with 'ATOMIC_INT_KIND' kind.
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 6678,6695 ****
  
  File: gfortran.info,  Node: ATOMIC_AND,  Next: ATOMIC_CAS,  Prev: ATOMIC_ADD,  Up: Intrinsic Procedures
  
! 9.25 `ATOMIC_AND' -- Atomic bitwise AND operation
  =================================================
  
  _Description_:
!      `ATOMIC_AND(ATOM, VALUE)' atomically defines ATOM with the bitwise
!      AND between the values of ATOM and VALUE. When STAT is present and
!      the invokation was successful, it is assigned the value 0. If it
!      is present and the invokation has failed, it is assigned a
!      positive value; in particular, for a coindexed ATOM, if the remote
!      image has stopped, it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
--- 6614,6631 ----
  
  File: gfortran.info,  Node: ATOMIC_AND,  Next: ATOMIC_CAS,  Prev: ATOMIC_ADD,  Up: Intrinsic Procedures
  
! 9.25 'ATOMIC_AND' -- Atomic bitwise AND operation
  =================================================
  
  _Description_:
!      'ATOMIC_AND(ATOM, VALUE)' atomically defines ATOM with the bitwise
!      AND between the values of ATOM and VALUE.  When STAT is present and
!      the invokation was successful, it is assigned the value 0.  If it
!      is present and the invokation has failed, it is assigned a positive
!      value; in particular, for a coindexed ATOM, if the remote image has
!      stopped, it is assigned the value of 'ISO_FORTRAN_ENV''s
!      'STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      'STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
*************** _Class_:
*** 6698,6713 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_AND (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of integer
!                 type with `ATOMIC_INT_KIND' kind.
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 6634,6648 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_AND (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of integer
!                  type with 'ATOMIC_INT_KIND' kind.
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 6724,6743 ****
  
  File: gfortran.info,  Node: ATOMIC_CAS,  Next: ATOMIC_DEFINE,  Prev: ATOMIC_AND,  Up: Intrinsic Procedures
  
! 9.26 `ATOMIC_CAS' -- Atomic compare and swap
  ============================================
  
  _Description_:
!      `ATOMIC_CAS' compares the variable ATOM with the value of COMPARE;
       if the value is the same, ATOM is set to the value of NEW.
!      Additionally, OLD is set to the value of ATOM that was used for
!      the comparison.  When STAT is present and the invokation was
!      successful, it is assigned the value 0. If it is present and the
       invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
--- 6659,6678 ----
  
  File: gfortran.info,  Node: ATOMIC_CAS,  Next: ATOMIC_DEFINE,  Prev: ATOMIC_AND,  Up: Intrinsic Procedures
  
! 9.26 'ATOMIC_CAS' -- Atomic compare and swap
  ============================================
  
  _Description_:
!      'ATOMIC_CAS' compares the variable ATOM with the value of COMPARE;
       if the value is the same, ATOM is set to the value of NEW.
!      Additionally, OLD is set to the value of ATOM that was used for the
!      comparison.  When STAT is present and the invokation was
!      successful, it is assigned the value 0.  If it is present and the
       invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of 'ISO_FORTRAN_ENV''s
!      'STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      'STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
*************** _Class_:
*** 6746,6765 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_CAS (ATOM, OLD, COMPARE, NEW [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of either
!                 integer type with `ATOMIC_INT_KIND' kind or
!                 logical type with `ATOMIC_LOGICAL_KIND' kind.
!      OLD        Scalar of the same type and kind as ATOM.
!      COMPARE    Scalar variable of the same type and kind as
!                 ATOM.
!      NEW        Scalar variable of the same type as ATOM. If
!                 kind is different, the value is converted to
!                 the kind of ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 6681,6699 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_CAS (ATOM, OLD, COMPARE, NEW [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of either
!                  integer type with 'ATOMIC_INT_KIND' kind or
!                  logical type with 'ATOMIC_LOGICAL_KIND' kind.
!      OLD         Scalar of the same type and kind as ATOM.
!      COMPARE     Scalar variable of the same type and kind as
!                  ATOM.
!      NEW         Scalar variable of the same type as ATOM.  If
!                  kind is different, the value is converted to the
!                  kind of ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 6774,6791 ****
  
  File: gfortran.info,  Node: ATOMIC_DEFINE,  Next: ATOMIC_FETCH_ADD,  Prev: ATOMIC_CAS,  Up: Intrinsic Procedures
  
! 9.27 `ATOMIC_DEFINE' -- Setting a variable atomically
  =====================================================
  
  _Description_:
!      `ATOMIC_DEFINE(ATOM, VALUE)' defines the variable ATOM with the
!      value VALUE atomically. When STAT is present and the invokation was
!      successful, it is assigned the value 0. If it is present and the
!      invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       Fortran 2008 and later; with STAT, TS 18508 or later
--- 6708,6725 ----
  
  File: gfortran.info,  Node: ATOMIC_DEFINE,  Next: ATOMIC_FETCH_ADD,  Prev: ATOMIC_CAS,  Up: Intrinsic Procedures
  
! 9.27 'ATOMIC_DEFINE' -- Setting a variable atomically
  =====================================================
  
  _Description_:
!      'ATOMIC_DEFINE(ATOM, VALUE)' defines the variable ATOM with the
!      value VALUE atomically.  When STAT is present and the invokation
!      was successful, it is assigned the value 0.  If it is present and
!      the invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of 'ISO_FORTRAN_ENV''s
!      'STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      'STAT_FAILED_IMAGE'.
  
  _Standard_:
       Fortran 2008 and later; with STAT, TS 18508 or later
*************** _Class_:
*** 6794,6810 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_DEFINE (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of either
!                 integer type with `ATOMIC_INT_KIND' kind or
!                 logical type with `ATOMIC_LOGICAL_KIND' kind.
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 6728,6744 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_DEFINE (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of either
!                  integer type with 'ATOMIC_INT_KIND' kind or
!                  logical type with 'ATOMIC_LOGICAL_KIND' kind.
!                  
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 6821,6838 ****
  
  File: gfortran.info,  Node: ATOMIC_FETCH_ADD,  Next: ATOMIC_FETCH_AND,  Prev: ATOMIC_DEFINE,  Up: Intrinsic Procedures
  
! 9.28 `ATOMIC_FETCH_ADD' -- Atomic ADD operation with prior fetch
  ================================================================
  
  _Description_:
!      `ATOMIC_FETCH_ADD(ATOM, VALUE, OLD)' atomically stores the value of
!      ATOM in OLD and adds the value of VAR to the variable ATOM. When
       STAT is present and the invokation was successful, it is assigned
!      the value 0. If it is present and the invokation has failed, it is
       assigned a positive value; in particular, for a coindexed ATOM, if
       the remote image has stopped, it is assigned the value of
!      `ISO_FORTRAN_ENV''s `STAT_STOPPED_IMAGE' and if the remote image
!      has failed, the value `STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
--- 6755,6772 ----
  
  File: gfortran.info,  Node: ATOMIC_FETCH_ADD,  Next: ATOMIC_FETCH_AND,  Prev: ATOMIC_DEFINE,  Up: Intrinsic Procedures
  
! 9.28 'ATOMIC_FETCH_ADD' -- Atomic ADD operation with prior fetch
  ================================================================
  
  _Description_:
!      'ATOMIC_FETCH_ADD(ATOM, VALUE, OLD)' atomically stores the value of
!      ATOM in OLD and adds the value of VAR to the variable ATOM.  When
       STAT is present and the invokation was successful, it is assigned
!      the value 0.  If it is present and the invokation has failed, it is
       assigned a positive value; in particular, for a coindexed ATOM, if
       the remote image has stopped, it is assigned the value of
!      'ISO_FORTRAN_ENV''s 'STAT_STOPPED_IMAGE' and if the remote image
!      has failed, the value 'STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
*************** _Class_:
*** 6841,6858 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_FETCH_ADD (ATOM, VALUE, old [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of integer
!                 type with `ATOMIC_INT_KIND' kind.
!                 `ATOMIC_LOGICAL_KIND' kind.
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      OLD        Scalar of the same type and kind as ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 6775,6792 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_FETCH_ADD (ATOM, VALUE, old [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of integer
!                  type with 'ATOMIC_INT_KIND' kind.
!                  'ATOMIC_LOGICAL_KIND' kind.
!                  
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      OLD         Scalar of the same type and kind as ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 6869,6887 ****
  
  File: gfortran.info,  Node: ATOMIC_FETCH_AND,  Next: ATOMIC_FETCH_OR,  Prev: ATOMIC_FETCH_ADD,  Up: Intrinsic Procedures
  
! 9.29 `ATOMIC_FETCH_AND' -- Atomic bitwise AND operation with prior fetch
  ========================================================================
  
  _Description_:
!      `ATOMIC_AND(ATOM, VALUE)' atomically stores the value of ATOM in
       OLD and defines ATOM with the bitwise AND between the values of
!      ATOM and VALUE. When STAT is present and the invokation was
!      successful, it is assigned the value 0. If it is present and the
       invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
--- 6803,6821 ----
  
  File: gfortran.info,  Node: ATOMIC_FETCH_AND,  Next: ATOMIC_FETCH_OR,  Prev: ATOMIC_FETCH_ADD,  Up: Intrinsic Procedures
  
! 9.29 'ATOMIC_FETCH_AND' -- Atomic bitwise AND operation with prior fetch
  ========================================================================
  
  _Description_:
!      'ATOMIC_AND(ATOM, VALUE)' atomically stores the value of ATOM in
       OLD and defines ATOM with the bitwise AND between the values of
!      ATOM and VALUE.  When STAT is present and the invokation was
!      successful, it is assigned the value 0.  If it is present and the
       invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of 'ISO_FORTRAN_ENV''s
!      'STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      'STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
*************** _Class_:
*** 6890,6906 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_FETCH_AND (ATOM, VALUE, OLD [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of integer
!                 type with `ATOMIC_INT_KIND' kind.
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      OLD        Scalar of the same type and kind as ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 6824,6839 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_FETCH_AND (ATOM, VALUE, OLD [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of integer
!                  type with 'ATOMIC_INT_KIND' kind.
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      OLD         Scalar of the same type and kind as ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 6917,6935 ****
  
  File: gfortran.info,  Node: ATOMIC_FETCH_OR,  Next: ATOMIC_FETCH_XOR,  Prev: ATOMIC_FETCH_AND,  Up: Intrinsic Procedures
  
! 9.30 `ATOMIC_FETCH_OR' -- Atomic bitwise OR operation with prior fetch
  ======================================================================
  
  _Description_:
!      `ATOMIC_OR(ATOM, VALUE)' atomically stores the value of ATOM in
!      OLD and defines ATOM with the bitwise OR between the values of
!      ATOM and VALUE. When STAT is present and the invokation was
!      successful, it is assigned the value 0. If it is present and the
!      invokation has failed, it is assigned a positive value; in
!      particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
--- 6850,6867 ----
  
  File: gfortran.info,  Node: ATOMIC_FETCH_OR,  Next: ATOMIC_FETCH_XOR,  Prev: ATOMIC_FETCH_AND,  Up: Intrinsic Procedures
  
! 9.30 'ATOMIC_FETCH_OR' -- Atomic bitwise OR operation with prior fetch
  ======================================================================
  
  _Description_:
!      'ATOMIC_OR(ATOM, VALUE)' atomically stores the value of ATOM in OLD
!      and defines ATOM with the bitwise OR between the values of ATOM and
!      VALUE.  When STAT is present and the invokation was successful, it
!      is assigned the value 0.  If it is present and the invokation has
!      failed, it is assigned a positive value; in particular, for a
!      coindexed ATOM, if the remote image has stopped, it is assigned the
!      value of 'ISO_FORTRAN_ENV''s 'STAT_STOPPED_IMAGE' and if the remote
!      image has failed, the value 'STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
*************** _Class_:
*** 6938,6954 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_FETCH_OR (ATOM, VALUE, OLD [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of integer
!                 type with `ATOMIC_INT_KIND' kind.
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      OLD        Scalar of the same type and kind as ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 6870,6885 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_FETCH_OR (ATOM, VALUE, OLD [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of integer
!                  type with 'ATOMIC_INT_KIND' kind.
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      OLD         Scalar of the same type and kind as ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 6965,6983 ****
  
  File: gfortran.info,  Node: ATOMIC_FETCH_XOR,  Next: ATOMIC_OR,  Prev: ATOMIC_FETCH_OR,  Up: Intrinsic Procedures
  
! 9.31 `ATOMIC_FETCH_XOR' -- Atomic bitwise XOR operation with prior fetch
  ========================================================================
  
  _Description_:
!      `ATOMIC_XOR(ATOM, VALUE)' atomically stores the value of ATOM in
       OLD and defines ATOM with the bitwise XOR between the values of
!      ATOM and VALUE. When STAT is present and the invokation was
!      successful, it is assigned the value 0. If it is present and the
       invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
--- 6896,6914 ----
  
  File: gfortran.info,  Node: ATOMIC_FETCH_XOR,  Next: ATOMIC_OR,  Prev: ATOMIC_FETCH_OR,  Up: Intrinsic Procedures
  
! 9.31 'ATOMIC_FETCH_XOR' -- Atomic bitwise XOR operation with prior fetch
  ========================================================================
  
  _Description_:
!      'ATOMIC_XOR(ATOM, VALUE)' atomically stores the value of ATOM in
       OLD and defines ATOM with the bitwise XOR between the values of
!      ATOM and VALUE.  When STAT is present and the invokation was
!      successful, it is assigned the value 0.  If it is present and the
       invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of 'ISO_FORTRAN_ENV''s
!      'STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      'STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
*************** _Class_:
*** 6986,7002 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_FETCH_XOR (ATOM, VALUE, OLD [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of integer
!                 type with `ATOMIC_INT_KIND' kind.
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      OLD        Scalar of the same type and kind as ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 6917,6932 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_FETCH_XOR (ATOM, VALUE, OLD [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of integer
!                  type with 'ATOMIC_INT_KIND' kind.
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      OLD         Scalar of the same type and kind as ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 7013,7030 ****
  
  File: gfortran.info,  Node: ATOMIC_OR,  Next: ATOMIC_REF,  Prev: ATOMIC_FETCH_XOR,  Up: Intrinsic Procedures
  
! 9.32 `ATOMIC_OR' -- Atomic bitwise OR operation
  ===============================================
  
  _Description_:
!      `ATOMIC_OR(ATOM, VALUE)' atomically defines ATOM with the bitwise
!      AND between the values of ATOM and VALUE. When STAT is present and
!      the invokation was successful, it is assigned the value 0. If it
!      is present and the invokation has failed, it is assigned a
!      positive value; in particular, for a coindexed ATOM, if the remote
!      image has stopped, it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
--- 6943,6960 ----
  
  File: gfortran.info,  Node: ATOMIC_OR,  Next: ATOMIC_REF,  Prev: ATOMIC_FETCH_XOR,  Up: Intrinsic Procedures
  
! 9.32 'ATOMIC_OR' -- Atomic bitwise OR operation
  ===============================================
  
  _Description_:
!      'ATOMIC_OR(ATOM, VALUE)' atomically defines ATOM with the bitwise
!      AND between the values of ATOM and VALUE.  When STAT is present and
!      the invokation was successful, it is assigned the value 0.  If it
!      is present and the invokation has failed, it is assigned a positive
!      value; in particular, for a coindexed ATOM, if the remote image has
!      stopped, it is assigned the value of 'ISO_FORTRAN_ENV''s
!      'STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      'STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
*************** _Class_:
*** 7033,7048 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_OR (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of integer
!                 type with `ATOMIC_INT_KIND' kind.
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 6963,6977 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_OR (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of integer
!                  type with 'ATOMIC_INT_KIND' kind.
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 7059,7076 ****
  
  File: gfortran.info,  Node: ATOMIC_REF,  Next: ATOMIC_XOR,  Prev: ATOMIC_OR,  Up: Intrinsic Procedures
  
! 9.33 `ATOMIC_REF' -- Obtaining the value of a variable atomically
  =================================================================
  
  _Description_:
!      `ATOMIC_DEFINE(ATOM, VALUE)' atomically assigns the value of the
!      variable ATOM to VALUE. When STAT is present and the invokation
!      was successful, it is assigned the value 0. If it is present and
       the invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       Fortran 2008 and later; with STAT, TS 18508 or later
--- 6988,7005 ----
  
  File: gfortran.info,  Node: ATOMIC_REF,  Next: ATOMIC_XOR,  Prev: ATOMIC_OR,  Up: Intrinsic Procedures
  
! 9.33 'ATOMIC_REF' -- Obtaining the value of a variable atomically
  =================================================================
  
  _Description_:
!      'ATOMIC_DEFINE(ATOM, VALUE)' atomically assigns the value of the
!      variable ATOM to VALUE.  When STAT is present and the invokation
!      was successful, it is assigned the value 0.  If it is present and
       the invokation has failed, it is assigned a positive value; in
       particular, for a coindexed ATOM, if the remote image has stopped,
!      it is assigned the value of 'ISO_FORTRAN_ENV''s
!      'STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      'STAT_FAILED_IMAGE'.
  
  _Standard_:
       Fortran 2008 and later; with STAT, TS 18508 or later
*************** _Class_:
*** 7079,7095 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_REF(VALUE, ATOM [, STAT])'
  
  _Arguments_:
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      ATOM       Scalar coarray or coindexed variable of either
!                 integer type with `ATOMIC_INT_KIND' kind or
!                 logical type with `ATOMIC_LOGICAL_KIND' kind.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 7008,7023 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_REF(VALUE, ATOM [, STAT])'
  
  _Arguments_:
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      ATOM        Scalar coarray or coindexed variable of either
!                  integer type with 'ATOMIC_INT_KIND' kind or
!                  logical type with 'ATOMIC_LOGICAL_KIND' kind.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 7112,7129 ****
  
  File: gfortran.info,  Node: ATOMIC_XOR,  Next: BACKTRACE,  Prev: ATOMIC_REF,  Up: Intrinsic Procedures
  
! 9.34 `ATOMIC_XOR' -- Atomic bitwise OR operation
  ================================================
  
  _Description_:
!      `ATOMIC_AND(ATOM, VALUE)' atomically defines ATOM with the bitwise
!      XOR between the values of ATOM and VALUE. When STAT is present and
!      the invokation was successful, it is assigned the value 0. If it
!      is present and the invokation has failed, it is assigned a
!      positive value; in particular, for a coindexed ATOM, if the remote
!      image has stopped, it is assigned the value of `ISO_FORTRAN_ENV''s
!      `STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      `STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
--- 7040,7057 ----
  
  File: gfortran.info,  Node: ATOMIC_XOR,  Next: BACKTRACE,  Prev: ATOMIC_REF,  Up: Intrinsic Procedures
  
! 9.34 'ATOMIC_XOR' -- Atomic bitwise OR operation
  ================================================
  
  _Description_:
!      'ATOMIC_AND(ATOM, VALUE)' atomically defines ATOM with the bitwise
!      XOR between the values of ATOM and VALUE.  When STAT is present and
!      the invokation was successful, it is assigned the value 0.  If it
!      is present and the invokation has failed, it is assigned a positive
!      value; in particular, for a coindexed ATOM, if the remote image has
!      stopped, it is assigned the value of 'ISO_FORTRAN_ENV''s
!      'STAT_STOPPED_IMAGE' and if the remote image has failed, the value
!      'STAT_FAILED_IMAGE'.
  
  _Standard_:
       TS 18508 or later
*************** _Class_:
*** 7132,7147 ****
       Atomic subroutine
  
  _Syntax_:
!      `CALL ATOMIC_XOR (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM       Scalar coarray or coindexed variable of integer
!                 type with `ATOMIC_INT_KIND' kind.
!      VALUE      Scalar of the same type as ATOM. If the kind
!                 is different, the value is converted to the
!                 kind of ATOM.
!      STAT       (optional) Scalar default-kind integer
!                 variable.
  
  _Example_:
            program atomic
--- 7060,7074 ----
       Atomic subroutine
  
  _Syntax_:
!      'CALL ATOMIC_XOR (ATOM, VALUE [, STAT])'
  
  _Arguments_:
!      ATOM        Scalar coarray or coindexed variable of integer
!                  type with 'ATOMIC_INT_KIND' kind.
!      VALUE       Scalar of the same type as ATOM.  If the kind is
!                  different, the value is converted to the kind of
!                  ATOM.
!      STAT        (optional) Scalar default-kind integer variable.
  
  _Example_:
            program atomic
*************** _See also_:
*** 7158,7171 ****
  
  File: gfortran.info,  Node: BACKTRACE,  Next: BESSEL_J0,  Prev: ATOMIC_XOR,  Up: Intrinsic Procedures
  
! 9.35 `BACKTRACE' -- Show a backtrace
  ====================================
  
  _Description_:
!      `BACKTRACE' shows a backtrace at an arbitrary place in user code.
!      Program execution continues normally afterwards. The backtrace
!      information is printed to the unit corresponding to `ERROR_UNIT'
!      in `ISO_FORTRAN_ENV'.
  
  _Standard_:
       GNU Extension
--- 7085,7098 ----
  
  File: gfortran.info,  Node: BACKTRACE,  Next: BESSEL_J0,  Prev: ATOMIC_XOR,  Up: Intrinsic Procedures
  
! 9.35 'BACKTRACE' -- Show a backtrace
  ====================================
  
  _Description_:
!      'BACKTRACE' shows a backtrace at an arbitrary place in user code.
!      Program execution continues normally afterwards.  The backtrace
!      information is printed to the unit corresponding to 'ERROR_UNIT' in
!      'ISO_FORTRAN_ENV'.
  
  _Standard_:
       GNU Extension
*************** _Class_:
*** 7174,7180 ****
       Subroutine
  
  _Syntax_:
!      `CALL BACKTRACE'
  
  _Arguments_:
       None
--- 7101,7107 ----
       Subroutine
  
  _Syntax_:
!      'CALL BACKTRACE'
  
  _Arguments_:
       None
*************** _See also_:
*** 7185,7196 ****
  
  File: gfortran.info,  Node: BESSEL_J0,  Next: BESSEL_J1,  Prev: BACKTRACE,  Up: Intrinsic Procedures
  
! 9.36 `BESSEL_J0' -- Bessel function of the first kind of order 0
  ================================================================
  
  _Description_:
!      `BESSEL_J0(X)' computes the Bessel function of the first kind of
!      order 0 of X. This function is available under the name `BESJ0' as
       a GNU extension.
  
  _Standard_:
--- 7112,7123 ----
  
  File: gfortran.info,  Node: BESSEL_J0,  Next: BESSEL_J1,  Prev: BACKTRACE,  Up: Intrinsic Procedures
  
! 9.36 'BESSEL_J0' -- Bessel function of the first kind of order 0
  ================================================================
  
  _Description_:
!      'BESSEL_J0(X)' computes the Bessel function of the first kind of
!      order 0 of X.  This function is available under the name 'BESJ0' as
       a GNU extension.
  
  _Standard_:
*************** _Class_:
*** 7200,7213 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = BESSEL_J0(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type `REAL' and lies in the range  -
!      0.4027... \leq Bessel (0,x) \leq 1. It has the same kind as X.
  
  _Example_:
            program test_besj0
--- 7127,7140 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = BESSEL_J0(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type 'REAL' and lies in the range -
!      0.4027... \leq Bessel (0,x) \leq 1.  It has the same kind as X.
  
  _Example_:
            program test_besj0
*************** _Example_:
*** 7216,7233 ****
            end program test_besj0
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DBESJ0(X)'   `REAL(8) X'   `REAL(8)'     GNU extension
  
  
  File: gfortran.info,  Node: BESSEL_J1,  Next: BESSEL_JN,  Prev: BESSEL_J0,  Up: Intrinsic Procedures
  
! 9.37 `BESSEL_J1' -- Bessel function of the first kind of order 1
  ================================================================
  
  _Description_:
!      `BESSEL_J1(X)' computes the Bessel function of the first kind of
!      order 1 of X. This function is available under the name `BESJ1' as
       a GNU extension.
  
  _Standard_:
--- 7143,7160 ----
            end program test_besj0
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DBESJ0(X)'    'REAL(8) X'    'REAL(8)'      GNU extension
  
  
  File: gfortran.info,  Node: BESSEL_J1,  Next: BESSEL_JN,  Prev: BESSEL_J0,  Up: Intrinsic Procedures
  
! 9.37 'BESSEL_J1' -- Bessel function of the first kind of order 1
  ================================================================
  
  _Description_:
!      'BESSEL_J1(X)' computes the Bessel function of the first kind of
!      order 1 of X.  This function is available under the name 'BESJ1' as
       a GNU extension.
  
  _Standard_:
*************** _Class_:
*** 7237,7250 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = BESSEL_J1(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type `REAL' and lies in the range  -
!      0.5818... \leq Bessel (0,x) \leq 0.5818 . It has the same kind as
       X.
  
  _Example_:
--- 7164,7177 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = BESSEL_J1(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type 'REAL' and lies in the range -
!      0.5818... \leq Bessel (0,x) \leq 0.5818 .  It has the same kind as
       X.
  
  _Example_:
*************** _Example_:
*** 7254,7275 ****
            end program test_besj1
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DBESJ1(X)'   `REAL(8) X'   `REAL(8)'     GNU extension
  
  
  File: gfortran.info,  Node: BESSEL_JN,  Next: BESSEL_Y0,  Prev: BESSEL_J1,  Up: Intrinsic Procedures
  
! 9.38 `BESSEL_JN' -- Bessel function of the first kind
  =====================================================
  
  _Description_:
!      `BESSEL_JN(N, X)' computes the Bessel function of the first kind of
!      order N of X. This function is available under the name `BESJN' as
       a GNU extension.  If N and X are arrays, their ranks and shapes
       shall conform.
  
!      `BESSEL_JN(N1, N2, X)' returns an array with the Bessel functions
       of the first kind of the orders N1 to N2.
  
  _Standard_:
--- 7181,7202 ----
            end program test_besj1
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DBESJ1(X)'    'REAL(8) X'    'REAL(8)'      GNU extension
  
  
  File: gfortran.info,  Node: BESSEL_JN,  Next: BESSEL_Y0,  Prev: BESSEL_J1,  Up: Intrinsic Procedures
  
! 9.38 'BESSEL_JN' -- Bessel function of the first kind
  =====================================================
  
  _Description_:
!      'BESSEL_JN(N, X)' computes the Bessel function of the first kind of
!      order N of X.  This function is available under the name 'BESJN' as
       a GNU extension.  If N and X are arrays, their ranks and shapes
       shall conform.
  
!      'BESSEL_JN(N1, N2, X)' returns an array with the Bessel functions
       of the first kind of the orders N1 to N2.
  
  _Standard_:
*************** _Standard_:
*** 7277,7300 ****
  
  _Class_:
       Elemental function, except for the transformational function
!      `BESSEL_JN(N1, N2, X)'
  
  _Syntax_:
!      `RESULT = BESSEL_JN(N, X)'
!      `RESULT = BESSEL_JN(N1, N2, X)'
  
  _Arguments_:
!      N          Shall be a scalar or an array of type
!                 `INTEGER'.
!      N1         Shall be a non-negative scalar of type
!                 `INTEGER'.
!      N2         Shall be a non-negative scalar of type
!                 `INTEGER'.
!      X          Shall be a scalar or an array of type  `REAL';
!                 for `BESSEL_JN(N1, N2, X)' it shall be scalar.
  
  _Return value_:
!      The return value is a scalar of type `REAL'. It has the same kind
       as X.
  
  _Note_:
--- 7204,7226 ----
  
  _Class_:
       Elemental function, except for the transformational function
!      'BESSEL_JN(N1, N2, X)'
  
  _Syntax_:
!      'RESULT = BESSEL_JN(N, X)'
!      'RESULT = BESSEL_JN(N1, N2, X)'
  
  _Arguments_:
!      N           Shall be a scalar or an array of type 'INTEGER'.
!      N1          Shall be a non-negative scalar of type
!                  'INTEGER'.
!      N2          Shall be a non-negative scalar of type
!                  'INTEGER'.
!      X           Shall be a scalar or an array of type 'REAL';
!                  for 'BESSEL_JN(N1, N2, X)' it shall be scalar.
  
  _Return value_:
!      The return value is a scalar of type 'REAL'.  It has the same kind
       as X.
  
  _Note_:
*************** _Example_:
*** 7309,7328 ****
            end program test_besjn
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DBESJN(N,    `INTEGER N'   `REAL(8)'     GNU extension
!      X)'                                       
!                    `REAL(8) X'                 
  
  
  File: gfortran.info,  Node: BESSEL_Y0,  Next: BESSEL_Y1,  Prev: BESSEL_JN,  Up: Intrinsic Procedures
  
! 9.39 `BESSEL_Y0' -- Bessel function of the second kind of order 0
  =================================================================
  
  _Description_:
!      `BESSEL_Y0(X)' computes the Bessel function of the second kind of
!      order 0 of X. This function is available under the name `BESY0' as
       a GNU extension.
  
  _Standard_:
--- 7235,7254 ----
            end program test_besjn
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DBESJN(N,     'INTEGER N'    'REAL(8)'      GNU extension
!      X)'
!                     'REAL(8) X'
  
  
  File: gfortran.info,  Node: BESSEL_Y0,  Next: BESSEL_Y1,  Prev: BESSEL_JN,  Up: Intrinsic Procedures
  
! 9.39 'BESSEL_Y0' -- Bessel function of the second kind of order 0
  =================================================================
  
  _Description_:
!      'BESSEL_Y0(X)' computes the Bessel function of the second kind of
!      order 0 of X.  This function is available under the name 'BESY0' as
       a GNU extension.
  
  _Standard_:
*************** _Class_:
*** 7332,7344 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = BESSEL_Y0(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type `REAL'. It has the same kind as X.
  
  _Example_:
            program test_besy0
--- 7258,7270 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = BESSEL_Y0(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type 'REAL'.  It has the same kind as X.
  
  _Example_:
            program test_besy0
*************** _Example_:
*** 7347,7364 ****
            end program test_besy0
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DBESY0(X)'   `REAL(8) X'   `REAL(8)'     GNU extension
  
  
  File: gfortran.info,  Node: BESSEL_Y1,  Next: BESSEL_YN,  Prev: BESSEL_Y0,  Up: Intrinsic Procedures
  
! 9.40 `BESSEL_Y1' -- Bessel function of the second kind of order 1
  =================================================================
  
  _Description_:
!      `BESSEL_Y1(X)' computes the Bessel function of the second kind of
!      order 1 of X. This function is available under the name `BESY1' as
       a GNU extension.
  
  _Standard_:
--- 7273,7290 ----
            end program test_besy0
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DBESY0(X)'    'REAL(8) X'    'REAL(8)'      GNU extension
  
  
  File: gfortran.info,  Node: BESSEL_Y1,  Next: BESSEL_YN,  Prev: BESSEL_Y0,  Up: Intrinsic Procedures
  
! 9.40 'BESSEL_Y1' -- Bessel function of the second kind of order 1
  =================================================================
  
  _Description_:
!      'BESSEL_Y1(X)' computes the Bessel function of the second kind of
!      order 1 of X.  This function is available under the name 'BESY1' as
       a GNU extension.
  
  _Standard_:
*************** _Class_:
*** 7368,7380 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = BESSEL_Y1(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type `REAL'. It has the same kind as X.
  
  _Example_:
            program test_besy1
--- 7294,7306 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = BESSEL_Y1(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type 'REAL'.  It has the same kind as X.
  
  _Example_:
            program test_besy1
*************** _Example_:
*** 7383,7404 ****
            end program test_besy1
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DBESY1(X)'   `REAL(8) X'   `REAL(8)'     GNU extension
  
  
  File: gfortran.info,  Node: BESSEL_YN,  Next: BGE,  Prev: BESSEL_Y1,  Up: Intrinsic Procedures
  
! 9.41 `BESSEL_YN' -- Bessel function of the second kind
  ======================================================
  
  _Description_:
!      `BESSEL_YN(N, X)' computes the Bessel function of the second kind
!      of order N of X. This function is available under the name `BESYN'
       as a GNU extension.  If N and X are arrays, their ranks and shapes
       shall conform.
  
!      `BESSEL_YN(N1, N2, X)' returns an array with the Bessel functions
       of the first kind of the orders N1 to N2.
  
  _Standard_:
--- 7309,7330 ----
            end program test_besy1
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DBESY1(X)'    'REAL(8) X'    'REAL(8)'      GNU extension
  
  
  File: gfortran.info,  Node: BESSEL_YN,  Next: BGE,  Prev: BESSEL_Y1,  Up: Intrinsic Procedures
  
! 9.41 'BESSEL_YN' -- Bessel function of the second kind
  ======================================================
  
  _Description_:
!      'BESSEL_YN(N, X)' computes the Bessel function of the second kind
!      of order N of X.  This function is available under the name 'BESYN'
       as a GNU extension.  If N and X are arrays, their ranks and shapes
       shall conform.
  
!      'BESSEL_YN(N1, N2, X)' returns an array with the Bessel functions
       of the first kind of the orders N1 to N2.
  
  _Standard_:
*************** _Standard_:
*** 7406,7429 ****
  
  _Class_:
       Elemental function, except for the transformational function
!      `BESSEL_YN(N1, N2, X)'
  
  _Syntax_:
!      `RESULT = BESSEL_YN(N, X)'
!      `RESULT = BESSEL_YN(N1, N2, X)'
  
  _Arguments_:
!      N          Shall be a scalar or an array of type
!                 `INTEGER' .
!      N1         Shall be a non-negative scalar of type
!                 `INTEGER'.
!      N2         Shall be a non-negative scalar of type
!                 `INTEGER'.
!      X          Shall be a scalar or an array of type  `REAL';
!                 for `BESSEL_YN(N1, N2, X)' it shall be scalar.
  
  _Return value_:
!      The return value is a scalar of type `REAL'. It has the same kind
       as X.
  
  _Note_:
--- 7332,7355 ----
  
  _Class_:
       Elemental function, except for the transformational function
!      'BESSEL_YN(N1, N2, X)'
  
  _Syntax_:
!      'RESULT = BESSEL_YN(N, X)'
!      'RESULT = BESSEL_YN(N1, N2, X)'
  
  _Arguments_:
!      N           Shall be a scalar or an array of type 'INTEGER'
!                  .
!      N1          Shall be a non-negative scalar of type
!                  'INTEGER'.
!      N2          Shall be a non-negative scalar of type
!                  'INTEGER'.
!      X           Shall be a scalar or an array of type 'REAL';
!                  for 'BESSEL_YN(N1, N2, X)' it shall be scalar.
  
  _Return value_:
!      The return value is a scalar of type 'REAL'.  It has the same kind
       as X.
  
  _Note_:
*************** _Example_:
*** 7438,7451 ****
            end program test_besyn
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DBESYN(N,X)' `INTEGER N'   `REAL(8)'     GNU extension
!                    `REAL(8) X'                 
  
  
  File: gfortran.info,  Node: BGE,  Next: BGT,  Prev: BESSEL_YN,  Up: Intrinsic Procedures
  
! 9.42 `BGE' -- Bitwise greater than or equal to
  ==============================================
  
  _Description_:
--- 7364,7377 ----
            end program test_besyn
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DBESYN(N,X)'  'INTEGER N'    'REAL(8)'      GNU extension
!                     'REAL(8) X'
  
  
  File: gfortran.info,  Node: BGE,  Next: BGT,  Prev: BESSEL_YN,  Up: Intrinsic Procedures
  
! 9.42 'BGE' -- Bitwise greater than or equal to
  ==============================================
  
  _Description_:
*************** _Class_:
*** 7459,7473 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = BGE(I, J)'
  
  _Arguments_:
!      I          Shall be of `INTEGER' type.
!      J          Shall be of `INTEGER' type, and of the same
!                 kind as I.
  
  _Return value_:
!      The return value is of type `LOGICAL' and of the default kind.
  
  _See also_:
       *note BGT::, *note BLE::, *note BLT::
--- 7385,7399 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = BGE(I, J)'
  
  _Arguments_:
!      I           Shall be of 'INTEGER' type.
!      J           Shall be of 'INTEGER' type, and of the same kind
!                  as I.
  
  _Return value_:
!      The return value is of type 'LOGICAL' and of the default kind.
  
  _See also_:
       *note BGT::, *note BLE::, *note BLT::
*************** _See also_:
*** 7475,7481 ****
  
  File: gfortran.info,  Node: BGT,  Next: BIT_SIZE,  Prev: BGE,  Up: Intrinsic Procedures
  
! 9.43 `BGT' -- Bitwise greater than
  ==================================
  
  _Description_:
--- 7401,7407 ----
  
  File: gfortran.info,  Node: BGT,  Next: BIT_SIZE,  Prev: BGE,  Up: Intrinsic Procedures
  
! 9.43 'BGT' -- Bitwise greater than
  ==================================
  
  _Description_:
*************** _Class_:
*** 7488,7502 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = BGT(I, J)'
  
  _Arguments_:
!      I          Shall be of `INTEGER' type.
!      J          Shall be of `INTEGER' type, and of the same
!                 kind as I.
  
  _Return value_:
!      The return value is of type `LOGICAL' and of the default kind.
  
  _See also_:
       *note BGE::, *note BLE::, *note BLT::
--- 7414,7428 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = BGT(I, J)'
  
  _Arguments_:
!      I           Shall be of 'INTEGER' type.
!      J           Shall be of 'INTEGER' type, and of the same kind
!                  as I.
  
  _Return value_:
!      The return value is of type 'LOGICAL' and of the default kind.
  
  _See also_:
       *note BGE::, *note BLE::, *note BLT::
*************** _See also_:
*** 7504,7516 ****
  
  File: gfortran.info,  Node: BIT_SIZE,  Next: BLE,  Prev: BGT,  Up: Intrinsic Procedures
  
! 9.44 `BIT_SIZE' -- Bit size inquiry function
  ============================================
  
  _Description_:
!      `BIT_SIZE(I)' returns the number of bits (integer precision plus
       sign bit) represented by the type of I.  The result of
!      `BIT_SIZE(I)' is independent of the actual value of I.
  
  _Standard_:
       Fortran 95 and later
--- 7430,7442 ----
  
  File: gfortran.info,  Node: BIT_SIZE,  Next: BLE,  Prev: BGT,  Up: Intrinsic Procedures
  
! 9.44 'BIT_SIZE' -- Bit size inquiry function
  ============================================
  
  _Description_:
!      'BIT_SIZE(I)' returns the number of bits (integer precision plus
       sign bit) represented by the type of I.  The result of
!      'BIT_SIZE(I)' is independent of the actual value of I.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 7519,7531 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = BIT_SIZE(I)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER'
  
  _Example_:
            program test_bit_size
--- 7445,7457 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = BIT_SIZE(I)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER'
  
  _Example_:
            program test_bit_size
*************** _Example_:
*** 7538,7544 ****
  
  File: gfortran.info,  Node: BLE,  Next: BLT,  Prev: BIT_SIZE,  Up: Intrinsic Procedures
  
! 9.45 `BLE' -- Bitwise less than or equal to
  ===========================================
  
  _Description_:
--- 7464,7470 ----
  
  File: gfortran.info,  Node: BLE,  Next: BLT,  Prev: BIT_SIZE,  Up: Intrinsic Procedures
  
! 9.45 'BLE' -- Bitwise less than or equal to
  ===========================================
  
  _Description_:
*************** _Class_:
*** 7552,7566 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = BLE(I, J)'
  
  _Arguments_:
!      I          Shall be of `INTEGER' type.
!      J          Shall be of `INTEGER' type, and of the same
!                 kind as I.
  
  _Return value_:
!      The return value is of type `LOGICAL' and of the default kind.
  
  _See also_:
       *note BGT::, *note BGE::, *note BLT::
--- 7478,7492 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = BLE(I, J)'
  
  _Arguments_:
!      I           Shall be of 'INTEGER' type.
!      J           Shall be of 'INTEGER' type, and of the same kind
!                  as I.
  
  _Return value_:
!      The return value is of type 'LOGICAL' and of the default kind.
  
  _See also_:
       *note BGT::, *note BGE::, *note BLT::
*************** _See also_:
*** 7568,7574 ****
  
  File: gfortran.info,  Node: BLT,  Next: BTEST,  Prev: BLE,  Up: Intrinsic Procedures
  
! 9.46 `BLT' -- Bitwise less than
  ===============================
  
  _Description_:
--- 7494,7500 ----
  
  File: gfortran.info,  Node: BLT,  Next: BTEST,  Prev: BLE,  Up: Intrinsic Procedures
  
! 9.46 'BLT' -- Bitwise less than
  ===============================
  
  _Description_:
*************** _Class_:
*** 7581,7595 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = BLT(I, J)'
  
  _Arguments_:
!      I          Shall be of `INTEGER' type.
!      J          Shall be of `INTEGER' type, and of the same
!                 kind as I.
  
  _Return value_:
!      The return value is of type `LOGICAL' and of the default kind.
  
  _See also_:
       *note BGE::, *note BGT::, *note BLE::
--- 7507,7521 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = BLT(I, J)'
  
  _Arguments_:
!      I           Shall be of 'INTEGER' type.
!      J           Shall be of 'INTEGER' type, and of the same kind
!                  as I.
  
  _Return value_:
!      The return value is of type 'LOGICAL' and of the default kind.
  
  _See also_:
       *note BGE::, *note BGT::, *note BLE::
*************** _See also_:
*** 7597,7607 ****
  
  File: gfortran.info,  Node: BTEST,  Next: C_ASSOCIATED,  Prev: BLT,  Up: Intrinsic Procedures
  
! 9.47 `BTEST' -- Bit test function
  =================================
  
  _Description_:
!      `BTEST(I,POS)' returns logical `.TRUE.' if the bit at POS in I is
       set.  The counting of the bits starts at 0.
  
  _Standard_:
--- 7523,7533 ----
  
  File: gfortran.info,  Node: BTEST,  Next: C_ASSOCIATED,  Prev: BLT,  Up: Intrinsic Procedures
  
! 9.47 'BTEST' -- Bit test function
  =================================
  
  _Description_:
!      'BTEST(I,POS)' returns logical '.TRUE.' if the bit at POS in I is
       set.  The counting of the bits starts at 0.
  
  _Standard_:
*************** _Class_:
*** 7611,7624 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = BTEST(I, POS)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      POS        The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `LOGICAL'
  
  _Example_:
            program test_btest
--- 7537,7550 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = BTEST(I, POS)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      POS         The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'LOGICAL'
  
  _Example_:
            program test_btest
*************** _Example_:
*** 7634,7644 ****
  
  File: gfortran.info,  Node: C_ASSOCIATED,  Next: C_F_POINTER,  Prev: BTEST,  Up: Intrinsic Procedures
  
! 9.48 `C_ASSOCIATED' -- Status of a C pointer
  ============================================
  
  _Description_:
!      `C_ASSOCIATED(c_ptr_1[, c_ptr_2])' determines the status of the C
       pointer C_PTR_1 or if C_PTR_1 is associated with the target
       C_PTR_2.
  
--- 7560,7570 ----
  
  File: gfortran.info,  Node: C_ASSOCIATED,  Next: C_F_POINTER,  Prev: BTEST,  Up: Intrinsic Procedures
  
! 9.48 'C_ASSOCIATED' -- Status of a C pointer
  ============================================
  
  _Description_:
!      'C_ASSOCIATED(c_ptr_1[, c_ptr_2])' determines the status of the C
       pointer C_PTR_1 or if C_PTR_1 is associated with the target
       C_PTR_2.
  
*************** _Class_:
*** 7649,7662 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = C_ASSOCIATED(c_ptr_1[, c_ptr_2])'
  
  _Arguments_:
!      C_PTR_1    Scalar of the type `C_PTR' or `C_FUNPTR'.
!      C_PTR_2    (Optional) Scalar of the same type as C_PTR_1.
  
  _Return value_:
!      The return value is of type `LOGICAL'; it is `.false.' if either
       C_PTR_1 is a C NULL pointer or if C_PTR1 and C_PTR_2 point to
       different addresses.
  
--- 7575,7588 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = C_ASSOCIATED(c_ptr_1[, c_ptr_2])'
  
  _Arguments_:
!      C_PTR_1     Scalar of the type 'C_PTR' or 'C_FUNPTR'.
!      C_PTR_2     (Optional) Scalar of the same type as C_PTR_1.
  
  _Return value_:
!      The return value is of type 'LOGICAL'; it is '.false.' if either
       C_PTR_1 is a C NULL pointer or if C_PTR1 and C_PTR_2 point to
       different addresses.
  
*************** _See also_:
*** 7676,7686 ****
  
  File: gfortran.info,  Node: C_F_POINTER,  Next: C_F_PROCPOINTER,  Prev: C_ASSOCIATED,  Up: Intrinsic Procedures
  
! 9.49 `C_F_POINTER' -- Convert C into Fortran pointer
  ====================================================
  
  _Description_:
!      `C_F_POINTER(CPTR, FPTR[, SHAPE])' assigns the target of the C
       pointer CPTR to the Fortran pointer FPTR and specifies its shape.
  
  _Standard_:
--- 7602,7612 ----
  
  File: gfortran.info,  Node: C_F_POINTER,  Next: C_F_PROCPOINTER,  Prev: C_ASSOCIATED,  Up: Intrinsic Procedures
  
! 9.49 'C_F_POINTER' -- Convert C into Fortran pointer
  ====================================================
  
  _Description_:
!      'C_F_POINTER(CPTR, FPTR[, SHAPE])' assigns the target of the C
       pointer CPTR to the Fortran pointer FPTR and specifies its shape.
  
  _Standard_:
*************** _Class_:
*** 7690,7705 ****
       Subroutine
  
  _Syntax_:
!      `CALL C_F_POINTER(CPTR, FPTR[, SHAPE])'
  
  _Arguments_:
!      CPTR       scalar of the type `C_PTR'. It is `INTENT(IN)'.
!      FPTR       pointer interoperable with CPTR. It is
!                 `INTENT(OUT)'.
!      SHAPE      (Optional) Rank-one array of type `INTEGER'
!                 with `INTENT(IN)'. It shall be present if and
!                 only if FPTR is an array. The size must be
!                 equal to the rank of FPTR.
  
  _Example_:
            program main
--- 7616,7631 ----
       Subroutine
  
  _Syntax_:
!      'CALL C_F_POINTER(CPTR, FPTR[, SHAPE])'
  
  _Arguments_:
!      CPTR        scalar of the type 'C_PTR'.  It is 'INTENT(IN)'.
!      FPTR        pointer interoperable with CPTR.  It is
!                  'INTENT(OUT)'.
!      SHAPE       (Optional) Rank-one array of type 'INTEGER' with
!                  'INTENT(IN)'.  It shall be present if and only
!                  if FPTR is an array.  The size must be equal to
!                  the rank of FPTR.
  
  _Example_:
            program main
*************** _See also_:
*** 7723,7733 ****
  
  File: gfortran.info,  Node: C_F_PROCPOINTER,  Next: C_FUNLOC,  Prev: C_F_POINTER,  Up: Intrinsic Procedures
  
! 9.50 `C_F_PROCPOINTER' -- Convert C into Fortran procedure pointer
  ==================================================================
  
  _Description_:
!      `C_F_PROCPOINTER(CPTR, FPTR)' Assign the target of the C function
       pointer CPTR to the Fortran procedure pointer FPTR.
  
  _Standard_:
--- 7649,7659 ----
  
  File: gfortran.info,  Node: C_F_PROCPOINTER,  Next: C_FUNLOC,  Prev: C_F_POINTER,  Up: Intrinsic Procedures
  
! 9.50 'C_F_PROCPOINTER' -- Convert C into Fortran procedure pointer
  ==================================================================
  
  _Description_:
!      'C_F_PROCPOINTER(CPTR, FPTR)' Assign the target of the C function
       pointer CPTR to the Fortran procedure pointer FPTR.
  
  _Standard_:
*************** _Class_:
*** 7737,7749 ****
       Subroutine
  
  _Syntax_:
!      `CALL C_F_PROCPOINTER(cptr, fptr)'
  
  _Arguments_:
!      CPTR       scalar of the type `C_FUNPTR'. It is
!                 `INTENT(IN)'.
!      FPTR       procedure pointer interoperable with CPTR. It
!                 is `INTENT(OUT)'.
  
  _Example_:
            program main
--- 7663,7675 ----
       Subroutine
  
  _Syntax_:
!      'CALL C_F_PROCPOINTER(cptr, fptr)'
  
  _Arguments_:
!      CPTR        scalar of the type 'C_FUNPTR'.  It is
!                  'INTENT(IN)'.
!      FPTR        procedure pointer interoperable with CPTR.  It
!                  is 'INTENT(OUT)'.
  
  _Example_:
            program main
*************** _See also_:
*** 7774,7784 ****
  
  File: gfortran.info,  Node: C_FUNLOC,  Next: C_LOC,  Prev: C_F_PROCPOINTER,  Up: Intrinsic Procedures
  
! 9.51 `C_FUNLOC' -- Obtain the C address of a procedure
  ======================================================
  
  _Description_:
!      `C_FUNLOC(x)' determines the C address of the argument.
  
  _Standard_:
       Fortran 2003 and later
--- 7700,7710 ----
  
  File: gfortran.info,  Node: C_FUNLOC,  Next: C_LOC,  Prev: C_F_PROCPOINTER,  Up: Intrinsic Procedures
  
! 9.51 'C_FUNLOC' -- Obtain the C address of a procedure
  ======================================================
  
  _Description_:
!      'C_FUNLOC(x)' determines the C address of the argument.
  
  _Standard_:
       Fortran 2003 and later
*************** _Class_:
*** 7787,7800 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = C_FUNLOC(x)'
  
  _Arguments_:
!      X          Interoperable function or pointer to such
!                 function.
  
  _Return value_:
!      The return value is of type `C_FUNPTR' and contains the C address
       of the argument.
  
  _Example_:
--- 7713,7726 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = C_FUNLOC(x)'
  
  _Arguments_:
!      X           Interoperable function or pointer to such
!                  function.
  
  _Return value_:
!      The return value is of type 'C_FUNPTR' and contains the C address
       of the argument.
  
  _Example_:
*************** _See also_:
*** 7827,7837 ****
  
  File: gfortran.info,  Node: C_LOC,  Next: C_SIZEOF,  Prev: C_FUNLOC,  Up: Intrinsic Procedures
  
! 9.52 `C_LOC' -- Obtain the C address of an object
  =================================================
  
  _Description_:
!      `C_LOC(X)' determines the C address of the argument.
  
  _Standard_:
       Fortran 2003 and later
--- 7753,7763 ----
  
  File: gfortran.info,  Node: C_LOC,  Next: C_SIZEOF,  Prev: C_FUNLOC,  Up: Intrinsic Procedures
  
! 9.52 'C_LOC' -- Obtain the C address of an object
  =================================================
  
  _Description_:
!      'C_LOC(X)' determines the C address of the argument.
  
  _Standard_:
       Fortran 2003 and later
*************** _Class_:
*** 7840,7857 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = C_LOC(X)'
  
  _Arguments_:
!      X       Shall have either the POINTER or TARGET
!              attribute. It shall not be a coindexed object. It
!              shall either be a variable with interoperable
!              type and kind type parameters, or be a scalar,
!              nonpolymorphic variable with no length type
!              parameters.
  
  _Return value_:
!      The return value is of type `C_PTR' and contains the C address of
       the argument.
  
  _Example_:
--- 7766,7783 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = C_LOC(X)'
  
  _Arguments_:
!      X       Shall have either the POINTER or TARGET attribute.
!              It shall not be a coindexed object.  It shall either
!              be a variable with interoperable type and kind type
!              parameters, or be a scalar, nonpolymorphic variable
!              with no length type parameters.
!              
  
  _Return value_:
!      The return value is of type 'C_PTR' and contains the C address of
       the argument.
  
  _Example_:
*************** _See also_:
*** 7871,7903 ****
  
  File: gfortran.info,  Node: C_SIZEOF,  Next: CEILING,  Prev: C_LOC,  Up: Intrinsic Procedures
  
! 9.53 `C_SIZEOF' -- Size in bytes of an expression
  =================================================
  
  _Description_:
!      `C_SIZEOF(X)' calculates the number of bytes of storage the
!      expression `X' occupies.
  
  _Standard_:
       Fortran 2008
  
  _Class_:
!      Inquiry function of the module `ISO_C_BINDING'
  
  _Syntax_:
!      `N = C_SIZEOF(X)'
  
  _Arguments_:
!      X          The argument shall be an interoperable data
!                 entity.
  
  _Return value_:
       The return value is of type integer and of the system-dependent
!      kind `C_SIZE_T' (from the `ISO_C_BINDING' module). Its value is the
!      number of bytes occupied by the argument.  If the argument has the
!      `POINTER' attribute, the number of bytes of the storage area
       pointed to is returned.  If the argument is of a derived type with
!      `POINTER' or `ALLOCATABLE' components, the return value does not
       account for the sizes of the data pointed to by these components.
  
  _Example_:
--- 7797,7829 ----
  
  File: gfortran.info,  Node: C_SIZEOF,  Next: CEILING,  Prev: C_LOC,  Up: Intrinsic Procedures
  
! 9.53 'C_SIZEOF' -- Size in bytes of an expression
  =================================================
  
  _Description_:
!      'C_SIZEOF(X)' calculates the number of bytes of storage the
!      expression 'X' occupies.
  
  _Standard_:
       Fortran 2008
  
  _Class_:
!      Inquiry function of the module 'ISO_C_BINDING'
  
  _Syntax_:
!      'N = C_SIZEOF(X)'
  
  _Arguments_:
!      X           The argument shall be an interoperable data
!                  entity.
  
  _Return value_:
       The return value is of type integer and of the system-dependent
!      kind 'C_SIZE_T' (from the 'ISO_C_BINDING' module).  Its value is
!      the number of bytes occupied by the argument.  If the argument has
!      the 'POINTER' attribute, the number of bytes of the storage area
       pointed to is returned.  If the argument is of a derived type with
!      'POINTER' or 'ALLOCATABLE' components, the return value does not
       account for the sizes of the data pointed to by these components.
  
  _Example_:
*************** _Example_:
*** 7906,7913 ****
               real(c_float) :: r, s(5)
               print *, (c_sizeof(s)/c_sizeof(r) == 5)
               end
!      The example will print `.TRUE.' unless you are using a platform
!      where default `REAL' variables are unusually padded.
  
  _See also_:
       *note SIZEOF::, *note STORAGE_SIZE::
--- 7832,7839 ----
               real(c_float) :: r, s(5)
               print *, (c_sizeof(s)/c_sizeof(r) == 5)
               end
!      The example will print '.TRUE.' unless you are using a platform
!      where default 'REAL' variables are unusually padded.
  
  _See also_:
       *note SIZEOF::, *note STORAGE_SIZE::
*************** _See also_:
*** 7915,7925 ****
  
  File: gfortran.info,  Node: CEILING,  Next: CHAR,  Prev: C_SIZEOF,  Up: Intrinsic Procedures
  
! 9.54 `CEILING' -- Integer ceiling function
  ==========================================
  
  _Description_:
!      `CEILING(A)' returns the least integer greater than or equal to A.
  
  _Standard_:
       Fortran 95 and later
--- 7841,7851 ----
  
  File: gfortran.info,  Node: CEILING,  Next: CHAR,  Prev: C_SIZEOF,  Up: Intrinsic Procedures
  
! 9.54 'CEILING' -- Integer ceiling function
  ==========================================
  
  _Description_:
!      'CEILING(A)' returns the least integer greater than or equal to A.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 7928,7944 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = CEILING(A [, KIND])'
  
  _Arguments_:
!      A          The type shall be `REAL'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER(KIND)' if KIND is present and
!      a default-kind `INTEGER' otherwise.
  
  _Example_:
            program test_ceiling
--- 7854,7870 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = CEILING(A [, KIND])'
  
  _Arguments_:
!      A           The type shall be 'REAL'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER(KIND)' if KIND is present and
!      a default-kind 'INTEGER' otherwise.
  
  _Example_:
            program test_ceiling
*************** _Example_:
*** 7951,7966 ****
  _See also_:
       *note FLOOR::, *note NINT::
  
- 
  
  File: gfortran.info,  Node: CHAR,  Next: CHDIR,  Prev: CEILING,  Up: Intrinsic Procedures
  
! 9.55 `CHAR' -- Character conversion function
  ============================================
  
  _Description_:
!      `CHAR(I [, KIND])' returns the character represented by the
!      integer I.
  
  _Standard_:
       Fortran 77 and later
--- 7877,7891 ----
  _See also_:
       *note FLOOR::, *note NINT::
  
  
  File: gfortran.info,  Node: CHAR,  Next: CHDIR,  Prev: CEILING,  Up: Intrinsic Procedures
  
! 9.55 'CHAR' -- Character conversion function
  ============================================
  
  _Description_:
!      'CHAR(I [, KIND])' returns the character represented by the integer
!      I.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 7969,7984 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = CHAR(I [, KIND])'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `CHARACTER(1)'
  
  _Example_:
            program test_char
--- 7894,7909 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = CHAR(I [, KIND])'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'CHARACTER(1)'
  
  _Example_:
            program test_char
*************** _Example_:
*** 7989,7996 ****
            end program test_char
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `CHAR(I)'     `INTEGER I'   `CHARACTER(LEN=1)'F77 and later
  
  _Note_:
       See *note ICHAR:: for a discussion of converting between numerical
--- 7914,7921 ----
            end program test_char
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'CHAR(I)'      'INTEGER I'    'CHARACTER(LEN=1)'F77 and later
  
  _Note_:
       See *note ICHAR:: for a discussion of converting between numerical
*************** _Note_:
*** 7999,8009 ****
  _See also_:
       *note ACHAR::, *note IACHAR::, *note ICHAR::
  
- 
  
  File: gfortran.info,  Node: CHDIR,  Next: CHMOD,  Prev: CHAR,  Up: Intrinsic Procedures
  
! 9.56 `CHDIR' -- Change working directory
  ========================================
  
  _Description_:
--- 7924,7933 ----
  _See also_:
       *note ACHAR::, *note IACHAR::, *note ICHAR::
  
  
  File: gfortran.info,  Node: CHDIR,  Next: CHMOD,  Prev: CHAR,  Up: Intrinsic Procedures
  
! 9.56 'CHDIR' -- Change working directory
  ========================================
  
  _Description_:
*************** _Class_:
*** 8019,8034 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL CHDIR(NAME [, STATUS])'
!      `STATUS = CHDIR(NAME)'
  
  _Arguments_:
!      NAME       The type shall be `CHARACTER' of default kind
!                 and shall specify a valid path within the file
!                 system.
!      STATUS     (Optional) `INTEGER' status flag of the default
!                 kind.  Returns 0 on success, and a system
!                 specific and nonzero error code otherwise.
  
  _Example_:
            PROGRAM test_chdir
--- 7943,7958 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL CHDIR(NAME [, STATUS])'
!      'STATUS = CHDIR(NAME)'
  
  _Arguments_:
!      NAME        The type shall be 'CHARACTER' of default kind
!                  and shall specify a valid path within the file
!                  system.
!      STATUS      (Optional) 'INTEGER' status flag of the default
!                  kind.  Returns 0 on success, and a system
!                  specific and nonzero error code otherwise.
  
  _Example_:
            PROGRAM test_chdir
*************** _See also_:
*** 8046,8056 ****
  
  File: gfortran.info,  Node: CHMOD,  Next: CMPLX,  Prev: CHDIR,  Up: Intrinsic Procedures
  
! 9.57 `CHMOD' -- Change access permissions of files
  ==================================================
  
  _Description_:
!      `CHMOD' changes the permissions of a file.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 7970,7980 ----
  
  File: gfortran.info,  Node: CHMOD,  Next: CMPLX,  Prev: CHDIR,  Up: Intrinsic Procedures
  
! 9.57 'CHMOD' -- Change access permissions of files
  ==================================================
  
  _Description_:
!      'CHMOD' changes the permissions of a file.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 8062,8098 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL CHMOD(NAME, MODE[, STATUS])'
!      `STATUS = CHMOD(NAME, MODE)'
  
  _Arguments_:
!      NAME       Scalar `CHARACTER' of default kind with the
!                 file name. Trailing blanks are ignored unless
!                 the character `achar(0)' is present, then all
!                 characters up to and excluding `achar(0)' are
!                 used as the file name.
!      MODE       Scalar `CHARACTER' of default kind giving the
!                 file permission. MODE uses the same syntax as
!                 the `chmod' utility as defined by the POSIX
!                 standard. The argument shall either be a
!                 string of a nonnegative octal number or a
!                 symbolic mode.
!      STATUS     (optional) scalar `INTEGER', which is `0' on
!                 success and nonzero otherwise.
  
  _Return value_:
!      In either syntax, STATUS is set to `0' on success and nonzero
       otherwise.
  
  _Example_:
!      `CHMOD' as subroutine
            program chmod_test
              implicit none
              integer :: status
              call chmod('test.dat','u+x',status)
              print *, 'Status: ', status
            end program chmod_test
!      `CHMOD' as function:
            program chmod_test
              implicit none
              integer :: status
--- 7986,8025 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL CHMOD(NAME, MODE[, STATUS])'
!      'STATUS = CHMOD(NAME, MODE)'
  
  _Arguments_:
! 
!      NAME        Scalar 'CHARACTER' of default kind with the file
!                  name.  Trailing blanks are ignored unless the
!                  character 'achar(0)' is present, then all
!                  characters up to and excluding 'achar(0)' are
!                  used as the file name.
!                  
!      MODE        Scalar 'CHARACTER' of default kind giving the
!                  file permission.  MODE uses the same syntax as
!                  the 'chmod' utility as defined by the POSIX
!                  standard.  The argument shall either be a string
!                  of a nonnegative octal number or a symbolic
!                  mode.
!                  
!      STATUS      (optional) scalar 'INTEGER', which is '0' on
!                  success and nonzero otherwise.
  
  _Return value_:
!      In either syntax, STATUS is set to '0' on success and nonzero
       otherwise.
  
  _Example_:
!      'CHMOD' as subroutine
            program chmod_test
              implicit none
              integer :: status
              call chmod('test.dat','u+x',status)
              print *, 'Status: ', status
            end program chmod_test
!      'CHMOD' as function:
            program chmod_test
              implicit none
              integer :: status
*************** _Example_:
*** 8100,8118 ****
              print *, 'Status: ', status
            end program chmod_test
  
- 
  
  File: gfortran.info,  Node: CMPLX,  Next: CO_BROADCAST,  Prev: CHMOD,  Up: Intrinsic Procedures
  
! 9.58 `CMPLX' -- Complex conversion function
  ===========================================
  
  _Description_:
!      `CMPLX(X [, Y [, KIND]])' returns a complex number where X is
       converted to the real component.  If Y is present it is converted
!      to the imaginary component.  If Y is not present then the
!      imaginary component is set to 0.0.  If X is complex then Y must
!      not be present.
  
  _Standard_:
       Fortran 77 and later
--- 8027,8044 ----
              print *, 'Status: ', status
            end program chmod_test
  
  
  File: gfortran.info,  Node: CMPLX,  Next: CO_BROADCAST,  Prev: CHMOD,  Up: Intrinsic Procedures
  
! 9.58 'CMPLX' -- Complex conversion function
  ===========================================
  
  _Description_:
!      'CMPLX(X [, Y [, KIND]])' returns a complex number where X is
       converted to the real component.  If Y is present it is converted
!      to the imaginary component.  If Y is not present then the imaginary
!      component is set to 0.0.  If X is complex then Y must not be
!      present.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 8121,8141 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = CMPLX(X [, Y [, KIND]])'
  
  _Arguments_:
!      X          The type may be `INTEGER', `REAL', or
!                 `COMPLEX'.
!      Y          (Optional; only allowed if X is not
!                 `COMPLEX'.)  May be `INTEGER' or `REAL'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of `COMPLEX' type, with a kind equal to KIND
!      if it is specified.  If KIND is not specified, the result is of
!      the default `COMPLEX' kind, regardless of the kinds of X and Y.
  
  _Example_:
            program test_cmplx
--- 8047,8066 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = CMPLX(X [, Y [, KIND]])'
  
  _Arguments_:
!      X           The type may be 'INTEGER', 'REAL', or 'COMPLEX'.
!      Y           (Optional; only allowed if X is not 'COMPLEX'.)
!                  May be 'INTEGER' or 'REAL'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of 'COMPLEX' type, with a kind equal to KIND if
!      it is specified.  If KIND is not specified, the result is of the
!      default 'COMPLEX' kind, regardless of the kinds of X and Y.
  
  _Example_:
            program test_cmplx
*************** _See also_:
*** 8152,8167 ****
  
  File: gfortran.info,  Node: CO_BROADCAST,  Next: CO_MAX,  Prev: CMPLX,  Up: Intrinsic Procedures
  
! 9.59 `CO_BROADCAST' -- Copy a value to all images the current set of images
  ===========================================================================
  
  _Description_:
!      `CO_BROADCAST' copies the value of argument A on the image with
!      image index `SOURCE_IMAGE' to all images in the current team.  A
       becomes defined as if by intrinsic assignment.  If the execution
       was successful and STAT is present, it is assigned the value zero.
!      If the execution failed, STAT gets assigned a nonzero value and,
!      if present, ERRMSG gets assigned a value describing the occurred
       error.
  
  _Standard_:
--- 8077,8092 ----
  
  File: gfortran.info,  Node: CO_BROADCAST,  Next: CO_MAX,  Prev: CMPLX,  Up: Intrinsic Procedures
  
! 9.59 'CO_BROADCAST' -- Copy a value to all images the current set of images
  ===========================================================================
  
  _Description_:
!      'CO_BROADCAST' copies the value of argument A on the image with
!      image index 'SOURCE_IMAGE' to all images in the current team.  A
       becomes defined as if by intrinsic assignment.  If the execution
       was successful and STAT is present, it is assigned the value zero.
!      If the execution failed, STAT gets assigned a nonzero value and, if
!      present, ERRMSG gets assigned a value describing the occurred
       error.
  
  _Standard_:
*************** _Class_:
*** 8171,8188 ****
       Collective subroutine
  
  _Syntax_:
!      `CALL CO_BROADCAST(A, SOURCE_IMAGE [, STAT, ERRMSG])'
  
  _Arguments_:
!      A          INTENT(INOUT) argument; shall have the same
!                 dynamic type and type paramters on all images
!                 of the current team. If it is an array, it
!                 shall have the same shape on all images.
!      SOURCE_IMAGEa scalar integer expression.  It shall have
!                 the same the same value on all images and
!                 refer to an image of the current team.
!      STAT       (optional) a scalar integer variable
!      ERRMSG     (optional) a scalar character variable
  
  _Example_:
            program test
--- 8096,8113 ----
       Collective subroutine
  
  _Syntax_:
!      'CALL CO_BROADCAST(A, SOURCE_IMAGE [, STAT, ERRMSG])'
  
  _Arguments_:
!      A           INTENT(INOUT) argument; shall have the same
!                  dynamic type and type paramters on all images of
!                  the current team.  If it is an array, it shall
!                  have the same shape on all images.
!      SOURCE_IMAGEa scalar integer expression.  It shall have the
!                  same the same value on all images and refer to
!                  an image of the current team.
!      STAT        (optional) a scalar integer variable
!      ERRMSG      (optional) a scalar character variable
  
  _Example_:
            program test
*************** _See also_:
*** 8200,8218 ****
  
  File: gfortran.info,  Node: CO_MAX,  Next: CO_MIN,  Prev: CO_BROADCAST,  Up: Intrinsic Procedures
  
! 9.60 `CO_MAX' -- Maximal value on the current set of images
  ===========================================================
  
  _Description_:
!      `CO_MAX' determines element-wise the maximal value of A on all
       images of the current team.  If RESULT_IMAGE is present, the
       maximum values are returned in A on the specified image only and
       the value of A on the other images become undefined.  If
       RESULT_IMAGE is not present, the value is returned on all images.
!      If the execution was successful and STAT is present, it is
!      assigned the value zero.  If the execution failed, STAT gets
!      assigned a nonzero value and, if present, ERRMSG gets assigned a
!      value describing the occurred error.
  
  _Standard_:
       Technical Specification (TS) 18508 or later
--- 8125,8143 ----
  
  File: gfortran.info,  Node: CO_MAX,  Next: CO_MIN,  Prev: CO_BROADCAST,  Up: Intrinsic Procedures
  
! 9.60 'CO_MAX' -- Maximal value on the current set of images
  ===========================================================
  
  _Description_:
!      'CO_MAX' determines element-wise the maximal value of A on all
       images of the current team.  If RESULT_IMAGE is present, the
       maximum values are returned in A on the specified image only and
       the value of A on the other images become undefined.  If
       RESULT_IMAGE is not present, the value is returned on all images.
!      If the execution was successful and STAT is present, it is assigned
!      the value zero.  If the execution failed, STAT gets assigned a
!      nonzero value and, if present, ERRMSG gets assigned a value
!      describing the occurred error.
  
  _Standard_:
       Technical Specification (TS) 18508 or later
*************** _Class_:
*** 8221,8238 ****
       Collective subroutine
  
  _Syntax_:
!      `CALL CO_MAX(A [, RESULT_IMAGE, STAT, ERRMSG])'
  
  _Arguments_:
!      A          shall be an integer, real or character
!                 variable, which has the same type and type
!                 parameters on all images of the team.
       RESULT_IMAGE(optional) a scalar integer expression; if
!                 present, it shall have the same the same value
!                 on all images and refer to an image of the
!                 current team.
!      STAT       (optional) a scalar integer variable
!      ERRMSG     (optional) a scalar character variable
  
  _Example_:
            program test
--- 8146,8163 ----
       Collective subroutine
  
  _Syntax_:
!      'CALL CO_MAX(A [, RESULT_IMAGE, STAT, ERRMSG])'
  
  _Arguments_:
!      A           shall be an integer, real or character variable,
!                  which has the same type and type parameters on
!                  all images of the team.
       RESULT_IMAGE(optional) a scalar integer expression; if
!                  present, it shall have the same the same value
!                  on all images and refer to an image of the
!                  current team.
!      STAT        (optional) a scalar integer variable
!      ERRMSG      (optional) a scalar character variable
  
  _Example_:
            program test
*************** _See also_:
*** 8251,8269 ****
  
  File: gfortran.info,  Node: CO_MIN,  Next: CO_REDUCE,  Prev: CO_MAX,  Up: Intrinsic Procedures
  
! 9.61 `CO_MIN' -- Minimal value on the current set of images
  ===========================================================
  
  _Description_:
!      `CO_MIN' determines element-wise the minimal value of A on all
       images of the current team.  If RESULT_IMAGE is present, the
       minimal values are returned in A on the specified image only and
       the value of A on the other images become undefined.  If
       RESULT_IMAGE is not present, the value is returned on all images.
!      If the execution was successful and STAT is present, it is
!      assigned the value zero.  If the execution failed, STAT gets
!      assigned a nonzero value and, if present, ERRMSG gets assigned a
!      value describing the occurred error.
  
  _Standard_:
       Technical Specification (TS) 18508 or later
--- 8176,8194 ----
  
  File: gfortran.info,  Node: CO_MIN,  Next: CO_REDUCE,  Prev: CO_MAX,  Up: Intrinsic Procedures
  
! 9.61 'CO_MIN' -- Minimal value on the current set of images
  ===========================================================
  
  _Description_:
!      'CO_MIN' determines element-wise the minimal value of A on all
       images of the current team.  If RESULT_IMAGE is present, the
       minimal values are returned in A on the specified image only and
       the value of A on the other images become undefined.  If
       RESULT_IMAGE is not present, the value is returned on all images.
!      If the execution was successful and STAT is present, it is assigned
!      the value zero.  If the execution failed, STAT gets assigned a
!      nonzero value and, if present, ERRMSG gets assigned a value
!      describing the occurred error.
  
  _Standard_:
       Technical Specification (TS) 18508 or later
*************** _Class_:
*** 8272,8289 ****
       Collective subroutine
  
  _Syntax_:
!      `CALL CO_MIN(A [, RESULT_IMAGE, STAT, ERRMSG])'
  
  _Arguments_:
!      A          shall be an integer, real or character
!                 variable, which has the same type and type
!                 parameters on all images of the team.
       RESULT_IMAGE(optional) a scalar integer expression; if
!                 present, it shall have the same the same value
!                 on all images and refer to an image of the
!                 current team.
!      STAT       (optional) a scalar integer variable
!      ERRMSG     (optional) a scalar character variable
  
  _Example_:
            program test
--- 8197,8214 ----
       Collective subroutine
  
  _Syntax_:
!      'CALL CO_MIN(A [, RESULT_IMAGE, STAT, ERRMSG])'
  
  _Arguments_:
!      A           shall be an integer, real or character variable,
!                  which has the same type and type parameters on
!                  all images of the team.
       RESULT_IMAGE(optional) a scalar integer expression; if
!                  present, it shall have the same the same value
!                  on all images and refer to an image of the
!                  current team.
!      STAT        (optional) a scalar integer variable
!      ERRMSG      (optional) a scalar character variable
  
  _Example_:
            program test
*************** _See also_:
*** 8302,8323 ****
  
  File: gfortran.info,  Node: CO_REDUCE,  Next: CO_SUM,  Prev: CO_MIN,  Up: Intrinsic Procedures
  
! 9.62 `CO_REDUCE' -- Reduction of values on the current set of images
  ====================================================================
  
  _Description_:
!      `CO_REDUCE' determines element-wise the reduction of the value of A
       on all images of the current team.  The pure function passed as
       OPERATOR is used to pairwise reduce the values of A by passing
       either the value of A of different images or the result values of
       such a reduction as argument.  If A is an array, the deduction is
!      done element wise. If RESULT_IMAGE is present, the result values
!      are returned in A on the specified image only and the value of A
!      on the other images become undefined.  If RESULT_IMAGE is not
!      present, the value is returned on all images.  If the execution
!      was successful and STAT is present, it is assigned the value zero.
!      If the execution failed, STAT gets assigned a nonzero value and,
!      if present, ERRMSG gets assigned a value describing the occurred
       error.
  
  _Standard_:
--- 8227,8248 ----
  
  File: gfortran.info,  Node: CO_REDUCE,  Next: CO_SUM,  Prev: CO_MIN,  Up: Intrinsic Procedures
  
! 9.62 'CO_REDUCE' -- Reduction of values on the current set of images
  ====================================================================
  
  _Description_:
!      'CO_REDUCE' determines element-wise the reduction of the value of A
       on all images of the current team.  The pure function passed as
       OPERATOR is used to pairwise reduce the values of A by passing
       either the value of A of different images or the result values of
       such a reduction as argument.  If A is an array, the deduction is
!      done element wise.  If RESULT_IMAGE is present, the result values
!      are returned in A on the specified image only and the value of A on
!      the other images become undefined.  If RESULT_IMAGE is not present,
!      the value is returned on all images.  If the execution was
!      successful and STAT is present, it is assigned the value zero.  If
!      the execution failed, STAT gets assigned a nonzero value and, if
!      present, ERRMSG gets assigned a value describing the occurred
       error.
  
  _Standard_:
*************** _Class_:
*** 8327,8358 ****
       Collective subroutine
  
  _Syntax_:
!      `CALL CO_REDUCE(A, OPERATOR, [, RESULT_IMAGE, STAT, ERRMSG])'
  
  _Arguments_:
!      A          is an `INTENT(INOUT)' argument and shall be
!                 nonpolymorphic. If it is allocatable, it shall
!                 be allocated; if it is a pointer, it shall be
!                 associated.  A shall have the same type and
!                 type parameters on all images of the team; if
!                 it is an array, it shall have the same shape
!                 on all images.
!      OPERATOR   pure function with two scalar nonallocatable
!                 arguments, which shall be nonpolymorphic and
!                 have the same type and type parameters as A.
!                 The function shall return a nonallocatable
!                 scalar of the same type and type parameters as
!                 A.  The function shall be the same on all
!                 images and with regards to the arguments
!                 mathematically commutative and associative.
!                 Note that OPERATOR may not be an elemental
!                 function, unless it is an intrisic function.
       RESULT_IMAGE(optional) a scalar integer expression; if
!                 present, it shall have the same the same value
!                 on all images and refer to an image of the
!                 current team.
!      STAT       (optional) a scalar integer variable
!      ERRMSG     (optional) a scalar character variable
  
  _Example_:
            program test
--- 8252,8283 ----
       Collective subroutine
  
  _Syntax_:
!      'CALL CO_REDUCE(A, OPERATOR, [, RESULT_IMAGE, STAT, ERRMSG])'
  
  _Arguments_:
!      A           is an 'INTENT(INOUT)' argument and shall be
!                  nonpolymorphic.  If it is allocatable, it shall
!                  be allocated; if it is a pointer, it shall be
!                  associated.  A shall have the same type and type
!                  parameters on all images of the team; if it is
!                  an array, it shall have the same shape on all
!                  images.
!      OPERATOR    pure function with two scalar nonallocatable
!                  arguments, which shall be nonpolymorphic and
!                  have the same type and type parameters as A.
!                  The function shall return a nonallocatable
!                  scalar of the same type and type parameters as
!                  A.  The function shall be the same on all images
!                  and with regards to the arguments mathematically
!                  commutative and associative.  Note that OPERATOR
!                  may not be an elemental function, unless it is
!                  an intrisic function.
       RESULT_IMAGE(optional) a scalar integer expression; if
!                  present, it shall have the same the same value
!                  on all images and refer to an image of the
!                  current team.
!      STAT        (optional) a scalar integer variable
!      ERRMSG      (optional) a scalar character variable
  
  _Example_:
            program test
*************** _See also_:
*** 8383,8397 ****
  
  File: gfortran.info,  Node: CO_SUM,  Next: COMMAND_ARGUMENT_COUNT,  Prev: CO_REDUCE,  Up: Intrinsic Procedures
  
! 9.63 `CO_SUM' -- Sum of values on the current set of images
  ===========================================================
  
  _Description_:
!      `CO_SUM' sums up the values of each element of A on all images of
!      the current team.  If RESULT_IMAGE is present, the summed-up
!      values are returned in A on the specified image only and the value
!      of A on the other images become undefined.  If RESULT_IMAGE is not
!      present, the value is returned on all images.  If the execution was
       successful and STAT is present, it is assigned the value zero.  If
       the execution failed, STAT gets assigned a nonzero value and, if
       present, ERRMSG gets assigned a value describing the occurred
--- 8308,8322 ----
  
  File: gfortran.info,  Node: CO_SUM,  Next: COMMAND_ARGUMENT_COUNT,  Prev: CO_REDUCE,  Up: Intrinsic Procedures
  
! 9.63 'CO_SUM' -- Sum of values on the current set of images
  ===========================================================
  
  _Description_:
!      'CO_SUM' sums up the values of each element of A on all images of
!      the current team.  If RESULT_IMAGE is present, the summed-up values
!      are returned in A on the specified image only and the value of A on
!      the other images become undefined.  If RESULT_IMAGE is not present,
!      the value is returned on all images.  If the execution was
       successful and STAT is present, it is assigned the value zero.  If
       the execution failed, STAT gets assigned a nonzero value and, if
       present, ERRMSG gets assigned a value describing the occurred
*************** _Class_:
*** 8404,8421 ****
       Collective subroutine
  
  _Syntax_:
!      `CALL CO_MIN(A [, RESULT_IMAGE, STAT, ERRMSG])'
  
  _Arguments_:
!      A          shall be an integer, real or complex variable,
!                 which has the same type and type parameters on
!                 all images of the team.
       RESULT_IMAGE(optional) a scalar integer expression; if
!                 present, it shall have the same the same value
!                 on all images and refer to an image of the
!                 current team.
!      STAT       (optional) a scalar integer variable
!      ERRMSG     (optional) a scalar character variable
  
  _Example_:
            program test
--- 8329,8346 ----
       Collective subroutine
  
  _Syntax_:
!      'CALL CO_MIN(A [, RESULT_IMAGE, STAT, ERRMSG])'
  
  _Arguments_:
!      A           shall be an integer, real or complex variable,
!                  which has the same type and type parameters on
!                  all images of the team.
       RESULT_IMAGE(optional) a scalar integer expression; if
!                  present, it shall have the same the same value
!                  on all images and refer to an image of the
!                  current team.
!      STAT        (optional) a scalar integer variable
!      ERRMSG      (optional) a scalar character variable
  
  _Example_:
            program test
*************** _See also_:
*** 8434,8444 ****
  
  File: gfortran.info,  Node: COMMAND_ARGUMENT_COUNT,  Next: COMPILER_OPTIONS,  Prev: CO_SUM,  Up: Intrinsic Procedures
  
! 9.64 `COMMAND_ARGUMENT_COUNT' -- Get number of command line arguments
  =====================================================================
  
  _Description_:
!      `COMMAND_ARGUMENT_COUNT' returns the number of arguments passed on
       the command line when the containing program was invoked.
  
  _Standard_:
--- 8359,8369 ----
  
  File: gfortran.info,  Node: COMMAND_ARGUMENT_COUNT,  Next: COMPILER_OPTIONS,  Prev: CO_SUM,  Up: Intrinsic Procedures
  
! 9.64 'COMMAND_ARGUMENT_COUNT' -- Get number of command line arguments
  =====================================================================
  
  _Description_:
!      'COMMAND_ARGUMENT_COUNT' returns the number of arguments passed on
       the command line when the containing program was invoked.
  
  _Standard_:
*************** _Class_:
*** 8448,8460 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = COMMAND_ARGUMENT_COUNT()'
  
  _Arguments_:
!      None       
  
  _Return value_:
!      The return value is an `INTEGER' of default kind.
  
  _Example_:
            program test_command_argument_count
--- 8373,8385 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = COMMAND_ARGUMENT_COUNT()'
  
  _Arguments_:
!      None
  
  _Return value_:
!      The return value is an 'INTEGER' of default kind.
  
  _Example_:
            program test_command_argument_count
*************** _See also_:
*** 8469,8489 ****
  
  File: gfortran.info,  Node: COMPILER_OPTIONS,  Next: COMPILER_VERSION,  Prev: COMMAND_ARGUMENT_COUNT,  Up: Intrinsic Procedures
  
! 9.65 `COMPILER_OPTIONS' -- Options passed to the compiler
  =========================================================
  
  _Description_:
!      `COMPILER_OPTIONS' returns a string with the options used for
       compiling.
  
  _Standard_:
       Fortran 2008
  
  _Class_:
!      Inquiry function of the module `ISO_FORTRAN_ENV'
  
  _Syntax_:
!      `STR = COMPILER_OPTIONS()'
  
  _Arguments_:
       None.
--- 8394,8414 ----
  
  File: gfortran.info,  Node: COMPILER_OPTIONS,  Next: COMPILER_VERSION,  Prev: COMMAND_ARGUMENT_COUNT,  Up: Intrinsic Procedures
  
! 9.65 'COMPILER_OPTIONS' -- Options passed to the compiler
  =========================================================
  
  _Description_:
!      'COMPILER_OPTIONS' returns a string with the options used for
       compiling.
  
  _Standard_:
       Fortran 2008
  
  _Class_:
!      Inquiry function of the module 'ISO_FORTRAN_ENV'
  
  _Syntax_:
!      'STR = COMPILER_OPTIONS()'
  
  _Arguments_:
       None.
*************** _Arguments_:
*** 8491,8497 ****
  _Return value_:
       The return value is a default-kind string with system-dependent
       length.  It contains the compiler flags used to compile the file,
!      which called the `COMPILER_OPTIONS' intrinsic.
  
  _Example_:
               use iso_fortran_env
--- 8416,8422 ----
  _Return value_:
       The return value is a default-kind string with system-dependent
       length.  It contains the compiler flags used to compile the file,
!      which called the 'COMPILER_OPTIONS' intrinsic.
  
  _Example_:
               use iso_fortran_env
*************** _See also_:
*** 8506,8526 ****
  
  File: gfortran.info,  Node: COMPILER_VERSION,  Next: COMPLEX,  Prev: COMPILER_OPTIONS,  Up: Intrinsic Procedures
  
! 9.66 `COMPILER_VERSION' -- Compiler version string
  ==================================================
  
  _Description_:
!      `COMPILER_VERSION' returns a string with the name and the version
       of the compiler.
  
  _Standard_:
       Fortran 2008
  
  _Class_:
!      Inquiry function of the module `ISO_FORTRAN_ENV'
  
  _Syntax_:
!      `STR = COMPILER_VERSION()'
  
  _Arguments_:
       None.
--- 8431,8451 ----
  
  File: gfortran.info,  Node: COMPILER_VERSION,  Next: COMPLEX,  Prev: COMPILER_OPTIONS,  Up: Intrinsic Procedures
  
! 9.66 'COMPILER_VERSION' -- Compiler version string
  ==================================================
  
  _Description_:
!      'COMPILER_VERSION' returns a string with the name and the version
       of the compiler.
  
  _Standard_:
       Fortran 2008
  
  _Class_:
!      Inquiry function of the module 'ISO_FORTRAN_ENV'
  
  _Syntax_:
!      'STR = COMPILER_VERSION()'
  
  _Arguments_:
       None.
*************** _See also_:
*** 8543,8553 ****
  
  File: gfortran.info,  Node: COMPLEX,  Next: CONJG,  Prev: COMPILER_VERSION,  Up: Intrinsic Procedures
  
! 9.67 `COMPLEX' -- Complex conversion function
  =============================================
  
  _Description_:
!      `COMPLEX(X, Y)' returns a complex number where X is converted to
       the real component and Y is converted to the imaginary component.
  
  _Standard_:
--- 8468,8478 ----
  
  File: gfortran.info,  Node: COMPLEX,  Next: CONJG,  Prev: COMPILER_VERSION,  Up: Intrinsic Procedures
  
! 9.67 'COMPLEX' -- Complex conversion function
  =============================================
  
  _Description_:
!      'COMPLEX(X, Y)' returns a complex number where X is converted to
       the real component and Y is converted to the imaginary component.
  
  _Standard_:
*************** _Class_:
*** 8557,8575 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = COMPLEX(X, Y)'
  
  _Arguments_:
!      X          The type may be `INTEGER' or `REAL'.
!      Y          The type may be `INTEGER' or `REAL'.
  
  _Return value_:
!      If X and Y are both of `INTEGER' type, then the return value is of
!      default `COMPLEX' type.
  
!      If X and Y are of `REAL' type, or one is of `REAL' type and one is
!      of `INTEGER' type, then the return value is of `COMPLEX' type with
!      a kind equal to that of the `REAL' argument with the highest
       precision.
  
  _Example_:
--- 8482,8500 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = COMPLEX(X, Y)'
  
  _Arguments_:
!      X           The type may be 'INTEGER' or 'REAL'.
!      Y           The type may be 'INTEGER' or 'REAL'.
  
  _Return value_:
!      If X and Y are both of 'INTEGER' type, then the return value is of
!      default 'COMPLEX' type.
  
!      If X and Y are of 'REAL' type, or one is of 'REAL' type and one is
!      of 'INTEGER' type, then the return value is of 'COMPLEX' type with
!      a kind equal to that of the 'REAL' argument with the highest
       precision.
  
  _Example_:
*************** _See also_:
*** 8585,8596 ****
  
  File: gfortran.info,  Node: CONJG,  Next: COS,  Prev: COMPLEX,  Up: Intrinsic Procedures
  
! 9.68 `CONJG' -- Complex conjugate function
  ==========================================
  
  _Description_:
!      `CONJG(Z)' returns the conjugate of Z.  If Z is `(x, y)' then the
!      result is `(x, -y)'
  
  _Standard_:
       Fortran 77 and later, has overloads that are GNU extensions
--- 8510,8521 ----
  
  File: gfortran.info,  Node: CONJG,  Next: COS,  Prev: COMPLEX,  Up: Intrinsic Procedures
  
! 9.68 'CONJG' -- Complex conjugate function
  ==========================================
  
  _Description_:
!      'CONJG(Z)' returns the conjugate of Z.  If Z is '(x, y)' then the
!      result is '(x, -y)'
  
  _Standard_:
       Fortran 77 and later, has overloads that are GNU extensions
*************** _Class_:
*** 8599,8611 ****
       Elemental function
  
  _Syntax_:
!      `Z = CONJG(Z)'
  
  _Arguments_:
!      Z          The type shall be `COMPLEX'.
  
  _Return value_:
!      The return value is of type `COMPLEX'.
  
  _Example_:
            program test_conjg
--- 8524,8536 ----
       Elemental function
  
  _Syntax_:
!      'Z = CONJG(Z)'
  
  _Arguments_:
!      Z           The type shall be 'COMPLEX'.
  
  _Return value_:
!      The return value is of type 'COMPLEX'.
  
  _Example_:
            program test_conjg
*************** _Example_:
*** 8618,8636 ****
            end program test_conjg
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `CONJG(Z)'    `COMPLEX Z'   `COMPLEX'     GNU extension
!      `DCONJG(Z)'   `COMPLEX(8)   `COMPLEX(8)'  GNU extension
!                    Z'                          
  
  
  File: gfortran.info,  Node: COS,  Next: COSH,  Prev: CONJG,  Up: Intrinsic Procedures
  
! 9.69 `COS' -- Cosine function
  =============================
  
  _Description_:
!      `COS(X)' computes the cosine of X.
  
  _Standard_:
       Fortran 77 and later, has overloads that are GNU extensions
--- 8543,8561 ----
            end program test_conjg
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'CONJG(Z)'     'COMPLEX Z'    'COMPLEX'      GNU extension
!      'DCONJG(Z)'    'COMPLEX(8)    'COMPLEX(8)'   GNU extension
!                     Z'
  
  
  File: gfortran.info,  Node: COS,  Next: COSH,  Prev: CONJG,  Up: Intrinsic Procedures
  
! 9.69 'COS' -- Cosine function
  =============================
  
  _Description_:
!      'COS(X)' computes the cosine of X.
  
  _Standard_:
       Fortran 77 and later, has overloads that are GNU extensions
*************** _Class_:
*** 8639,8653 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = COS(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
!      The return value is of the same type and kind as X. The real part
!      of the result is in radians. If X is of the type `REAL', the
!      return value lies in the range  -1 \leq \cos (x) \leq 1.
  
  _Example_:
            program test_cos
--- 8564,8578 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = COS(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value is of the same type and kind as X.  The real part
!      of the result is in radians.  If X is of the type 'REAL', the
!      return value lies in the range -1 \leq \cos (x) \leq 1.
  
  _Example_:
            program test_cos
*************** _Example_:
*** 8656,8685 ****
            end program test_cos
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `COS(X)'      `REAL(4) X'   `REAL(4)'     Fortran 77 and
!                                                later
!      `DCOS(X)'     `REAL(8) X'   `REAL(8)'     Fortran 77 and
!                                                later
!      `CCOS(X)'     `COMPLEX(4)   `COMPLEX(4)'  Fortran 77 and
!                    X'                          later
!      `ZCOS(X)'     `COMPLEX(8)   `COMPLEX(8)'  GNU extension
!                    X'                          
!      `CDCOS(X)'    `COMPLEX(8)   `COMPLEX(8)'  GNU extension
!                    X'                          
  
  _See also_:
       Inverse function: *note ACOS::
  
- 
  
  File: gfortran.info,  Node: COSH,  Next: COUNT,  Prev: COS,  Up: Intrinsic Procedures
  
! 9.70 `COSH' -- Hyperbolic cosine function
  =========================================
  
  _Description_:
!      `COSH(X)' computes the hyperbolic cosine of X.
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
--- 8581,8609 ----
            end program test_cos
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'COS(X)'       'REAL(4) X'    'REAL(4)'      Fortran 77 and
!                                                   later
!      'DCOS(X)'      'REAL(8) X'    'REAL(8)'      Fortran 77 and
!                                                   later
!      'CCOS(X)'      'COMPLEX(4)    'COMPLEX(4)'   Fortran 77 and
!                     X'                            later
!      'ZCOS(X)'      'COMPLEX(8)    'COMPLEX(8)'   GNU extension
!                     X'
!      'CDCOS(X)'     'COMPLEX(8)    'COMPLEX(8)'   GNU extension
!                     X'
  
  _See also_:
       Inverse function: *note ACOS::
  
  
  File: gfortran.info,  Node: COSH,  Next: COUNT,  Prev: COS,  Up: Intrinsic Procedures
  
! 9.70 'COSH' -- Hyperbolic cosine function
  =========================================
  
  _Description_:
!      'COSH(X)' computes the hyperbolic cosine of X.
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
*************** _Class_:
*** 8688,8701 ****
       Elemental function
  
  _Syntax_:
!      `X = COSH(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
!      The return value has same type and kind as X. If X is complex, the
!      imaginary part of the result is in radians. If X is `REAL', the
       return value has a lower bound of one, \cosh (x) \geq 1.
  
  _Example_:
--- 8612,8625 ----
       Elemental function
  
  _Syntax_:
!      'X = COSH(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value has same type and kind as X.  If X is complex, the
!      imaginary part of the result is in radians.  If X is 'REAL', the
       return value has a lower bound of one, \cosh (x) \geq 1.
  
  _Example_:
*************** _Example_:
*** 8705,8732 ****
            end program test_cosh
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `COSH(X)'     `REAL(4) X'   `REAL(4)'     Fortran 77 and
!                                                later
!      `DCOSH(X)'    `REAL(8) X'   `REAL(8)'     Fortran 77 and
!                                                later
  
  _See also_:
       Inverse function: *note ACOSH::
  
- 
  
  File: gfortran.info,  Node: COUNT,  Next: CPU_TIME,  Prev: COSH,  Up: Intrinsic Procedures
  
! 9.71 `COUNT' -- Count function
  ==============================
  
  _Description_:
!      Counts the number of `.TRUE.' elements in a logical MASK, or, if
       the DIM argument is supplied, counts the number of elements along
       each row of the array in the DIM direction.  If the array has zero
!      size, or all of the elements of MASK are `.FALSE.', then the
!      result is `0'.
  
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
--- 8629,8656 ----
            end program test_cosh
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'COSH(X)'      'REAL(4) X'    'REAL(4)'      Fortran 77 and
!                                                   later
!      'DCOSH(X)'     'REAL(8) X'    'REAL(8)'      Fortran 77 and
!                                                   later
  
  _See also_:
       Inverse function: *note ACOSH::
  
  
  File: gfortran.info,  Node: COUNT,  Next: CPU_TIME,  Prev: COSH,  Up: Intrinsic Procedures
  
! 9.71 'COUNT' -- Count function
  ==============================
  
  _Description_:
! 
!      Counts the number of '.TRUE.' elements in a logical MASK, or, if
       the DIM argument is supplied, counts the number of elements along
       each row of the array in the DIM direction.  If the array has zero
!      size, or all of the elements of MASK are '.FALSE.', then the result
!      is '0'.
  
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
*************** _Class_:
*** 8735,8751 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = COUNT(MASK [, DIM, KIND])'
  
  _Arguments_:
!      MASK       The type shall be `LOGICAL'.
!      DIM        (Optional) The type shall be `INTEGER'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.  If DIM is
       present, the result is an array with a rank one less than the rank
       of ARRAY, and a size corresponding to the shape of ARRAY with the
--- 8659,8675 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = COUNT(MASK [, DIM, KIND])'
  
  _Arguments_:
!      MASK        The type shall be 'LOGICAL'.
!      DIM         (Optional) The type shall be 'INTEGER'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.  If DIM is
       present, the result is an array with a rank one less than the rank
       of ARRAY, and a size corresponding to the shape of ARRAY with the
*************** _Example_:
*** 8777,8796 ****
  
  File: gfortran.info,  Node: CPU_TIME,  Next: CSHIFT,  Prev: COUNT,  Up: Intrinsic Procedures
  
! 9.72 `CPU_TIME' -- CPU elapsed time in seconds
  ==============================================
  
  _Description_:
!      Returns a `REAL' value representing the elapsed CPU time in
       seconds.  This is useful for testing segments of code to determine
       execution time.
  
       If a time source is available, time will be reported with
!      microsecond resolution. If no time source is available, TIME is
!      set to `-1.0'.
  
       Note that TIME may contain a, system dependent, arbitrary offset
!      and may not start with `0.0'. For `CPU_TIME', the absolute value
       is meaningless, only differences between subsequent calls to this
       subroutine, as shown in the example below, should be used.
  
--- 8701,8720 ----
  
  File: gfortran.info,  Node: CPU_TIME,  Next: CSHIFT,  Prev: COUNT,  Up: Intrinsic Procedures
  
! 9.72 'CPU_TIME' -- CPU elapsed time in seconds
  ==============================================
  
  _Description_:
!      Returns a 'REAL' value representing the elapsed CPU time in
       seconds.  This is useful for testing segments of code to determine
       execution time.
  
       If a time source is available, time will be reported with
!      microsecond resolution.  If no time source is available, TIME is
!      set to '-1.0'.
  
       Note that TIME may contain a, system dependent, arbitrary offset
!      and may not start with '0.0'.  For 'CPU_TIME', the absolute value
       is meaningless, only differences between subsequent calls to this
       subroutine, as shown in the example below, should be used.
  
*************** _Class_:
*** 8801,8810 ****
       Subroutine
  
  _Syntax_:
!      `CALL CPU_TIME(TIME)'
  
  _Arguments_:
!      TIME       The type shall be `REAL' with `INTENT(OUT)'.
  
  _Return value_:
       None
--- 8725,8734 ----
       Subroutine
  
  _Syntax_:
!      'CALL CPU_TIME(TIME)'
  
  _Arguments_:
!      TIME        The type shall be 'REAL' with 'INTENT(OUT)'.
  
  _Return value_:
       None
*************** _See also_:
*** 8824,8842 ****
  
  File: gfortran.info,  Node: CSHIFT,  Next: CTIME,  Prev: CPU_TIME,  Up: Intrinsic Procedures
  
! 9.73 `CSHIFT' -- Circular shift elements of an array
  ====================================================
  
  _Description_:
!      `CSHIFT(ARRAY, SHIFT [, DIM])' performs a circular shift on
!      elements of ARRAY along the dimension of DIM.  If DIM is omitted
!      it is taken to be `1'.  DIM is a scalar of type `INTEGER' in the
!      range of 1 \leq DIM \leq n) where n is the rank of ARRAY.  If the
!      rank of ARRAY is one, then all elements of ARRAY are shifted by
!      SHIFT places.  If rank is greater than one, then all complete rank
!      one sections of ARRAY along the given dimension are shifted.
!      Elements shifted out one end of each rank one section are shifted
!      back in the other end.
  
  _Standard_:
       Fortran 95 and later
--- 8748,8766 ----
  
  File: gfortran.info,  Node: CSHIFT,  Next: CTIME,  Prev: CPU_TIME,  Up: Intrinsic Procedures
  
! 9.73 'CSHIFT' -- Circular shift elements of an array
  ====================================================
  
  _Description_:
!      'CSHIFT(ARRAY, SHIFT [, DIM])' performs a circular shift on
!      elements of ARRAY along the dimension of DIM.  If DIM is omitted it
!      is taken to be '1'.  DIM is a scalar of type 'INTEGER' in the range
!      of 1 \leq DIM \leq n) where n is the rank of ARRAY.  If the rank of
!      ARRAY is one, then all elements of ARRAY are shifted by SHIFT
!      places.  If rank is greater than one, then all complete rank one
!      sections of ARRAY along the given dimension are shifted.  Elements
!      shifted out one end of each rank one section are shifted back in
!      the other end.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 8845,8856 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = CSHIFT(ARRAY, SHIFT [, DIM])'
  
  _Arguments_:
!      ARRAY      Shall be an array of any type.
!      SHIFT      The type shall be `INTEGER'.
!      DIM        The type shall be `INTEGER'.
  
  _Return value_:
       Returns an array of same type and rank as the ARRAY argument.
--- 8769,8780 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = CSHIFT(ARRAY, SHIFT [, DIM])'
  
  _Arguments_:
!      ARRAY       Shall be an array of any type.
!      SHIFT       The type shall be 'INTEGER'.
!      DIM         The type shall be 'INTEGER'.
  
  _Return value_:
       Returns an array of same type and rank as the ARRAY argument.
*************** _Example_:
*** 8872,8883 ****
  
  File: gfortran.info,  Node: CTIME,  Next: DATE_AND_TIME,  Prev: CSHIFT,  Up: Intrinsic Procedures
  
! 9.74 `CTIME' -- Convert a time into a string
  ============================================
  
  _Description_:
!      `CTIME' converts a system time value, such as returned by `TIME8',
!      to a string. The output will be of the form `Sat Aug 19 18:13:14
       1995'.
  
       This intrinsic is provided in both subroutine and function forms;
--- 8796,8807 ----
  
  File: gfortran.info,  Node: CTIME,  Next: DATE_AND_TIME,  Prev: CSHIFT,  Up: Intrinsic Procedures
  
! 9.74 'CTIME' -- Convert a time into a string
  ============================================
  
  _Description_:
!      'CTIME' converts a system time value, such as returned by 'TIME8',
!      to a string.  The output will be of the form 'Sat Aug 19 18:13:14
       1995'.
  
       This intrinsic is provided in both subroutine and function forms;
*************** _Class_:
*** 8890,8906 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL CTIME(TIME, RESULT)'.
!      `RESULT = CTIME(TIME)'.
  
  _Arguments_:
!      TIME       The type shall be of type `INTEGER'.
!      RESULT     The type shall be of type `CHARACTER' and of
!                 default kind. It is an `INTENT(OUT)' argument.
!                 If the length of this variable is too short
!                 for the time and date string to fit
!                 completely, it will be blank on procedure
!                 return.
  
  _Return value_:
       The converted date and time as a string.
--- 8814,8829 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL CTIME(TIME, RESULT)'.
!      'RESULT = CTIME(TIME)'.
  
  _Arguments_:
!      TIME        The type shall be of type 'INTEGER'.
!      RESULT      The type shall be of type 'CHARACTER' and of
!                  default kind.  It is an 'INTENT(OUT)' argument.
!                  If the length of this variable is too short for
!                  the time and date string to fit completely, it
!                  will be blank on procedure return.
  
  _Return value_:
       The converted date and time as a string.
*************** _Example_:
*** 8918,8952 ****
            end program test_ctime
  
  _See Also_:
!      *note DATE_AND_TIME::, *note GMTIME::, *note LTIME::, *note
!      TIME::, *note TIME8::
  
  
  File: gfortran.info,  Node: DATE_AND_TIME,  Next: DBLE,  Prev: CTIME,  Up: Intrinsic Procedures
  
! 9.75 `DATE_AND_TIME' -- Date and time subroutine
  ================================================
  
  _Description_:
!      `DATE_AND_TIME(DATE, TIME, ZONE, VALUES)' gets the corresponding
       date and time information from the real-time system clock.  DATE is
!      `INTENT(OUT)' and has form ccyymmdd.  TIME is `INTENT(OUT)' and
!      has form hhmmss.sss.  ZONE is `INTENT(OUT)' and has form (+-)hhmm,
       representing the difference with respect to Coordinated Universal
!      Time (UTC).  Unavailable time and date parameters return blanks.
  
!      VALUES is `INTENT(OUT)' and provides the following:
  
!                 `VALUE(1)':          The year
!                 `VALUE(2)':          The month
!                 `VALUE(3)':          The day of the month
!                 `VALUE(4)':          Time difference with UTC
!                                      in minutes
!                 `VALUE(5)':          The hour of the day
!                 `VALUE(6)':          The minutes of the hour
!                 `VALUE(7)':          The seconds of the minute
!                 `VALUE(8)':          The milliseconds of the
!                                      second
  
  _Standard_:
       Fortran 95 and later
--- 8841,8875 ----
            end program test_ctime
  
  _See Also_:
!      *note DATE_AND_TIME::, *note GMTIME::, *note LTIME::, *note TIME::,
!      *note TIME8::
  
  
  File: gfortran.info,  Node: DATE_AND_TIME,  Next: DBLE,  Prev: CTIME,  Up: Intrinsic Procedures
  
! 9.75 'DATE_AND_TIME' -- Date and time subroutine
  ================================================
  
  _Description_:
!      'DATE_AND_TIME(DATE, TIME, ZONE, VALUES)' gets the corresponding
       date and time information from the real-time system clock.  DATE is
!      'INTENT(OUT)' and has form ccyymmdd.  TIME is 'INTENT(OUT)' and has
!      form hhmmss.sss.  ZONE is 'INTENT(OUT)' and has form (+-)hhmm,
       representing the difference with respect to Coordinated Universal
!      Time (UTC). Unavailable time and date parameters return blanks.
  
!      VALUES is 'INTENT(OUT)' and provides the following:
  
!                  'VALUE(1)':            The year
!                  'VALUE(2)':            The month
!                  'VALUE(3)':            The day of the month
!                  'VALUE(4)':            Time difference with UTC in
!                                         minutes
!                  'VALUE(5)':            The hour of the day
!                  'VALUE(6)':            The minutes of the hour
!                  'VALUE(7)':            The seconds of the minute
!                  'VALUE(8)':            The milliseconds of the
!                                         second
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 8955,8971 ****
       Subroutine
  
  _Syntax_:
!      `CALL DATE_AND_TIME([DATE, TIME, ZONE, VALUES])'
  
  _Arguments_:
!      DATE       (Optional) The type shall be `CHARACTER(LEN=8)'
!                 or larger, and of default kind.
!      TIME       (Optional) The type shall be
!                 `CHARACTER(LEN=10)' or larger, and of default
!                 kind.
!      ZONE       (Optional) The type shall be `CHARACTER(LEN=5)'
!                 or larger, and of default kind.
!      VALUES     (Optional) The type shall be `INTEGER(8)'.
  
  _Return value_:
       None
--- 8878,8893 ----
       Subroutine
  
  _Syntax_:
!      'CALL DATE_AND_TIME([DATE, TIME, ZONE, VALUES])'
  
  _Arguments_:
!      DATE        (Optional) The type shall be 'CHARACTER(LEN=8)'
!                  or larger, and of default kind.
!      TIME        (Optional) The type shall be 'CHARACTER(LEN=10)'
!                  or larger, and of default kind.
!      ZONE        (Optional) The type shall be 'CHARACTER(LEN=5)'
!                  or larger, and of default kind.
!      VALUES      (Optional) The type shall be 'INTEGER(8)'.
  
  _Return value_:
       None
*************** _See also_:
*** 8991,9001 ****
  
  File: gfortran.info,  Node: DBLE,  Next: DCMPLX,  Prev: DATE_AND_TIME,  Up: Intrinsic Procedures
  
! 9.76 `DBLE' -- Double conversion function
  =========================================
  
  _Description_:
!      `DBLE(A)' Converts A to double precision real type.
  
  _Standard_:
       Fortran 77 and later
--- 8913,8923 ----
  
  File: gfortran.info,  Node: DBLE,  Next: DCMPLX,  Prev: DATE_AND_TIME,  Up: Intrinsic Procedures
  
! 9.76 'DBLE' -- Double conversion function
  =========================================
  
  _Description_:
!      'DBLE(A)' Converts A to double precision real type.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 9004,9014 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = DBLE(A)'
  
  _Arguments_:
!      A          The type shall be `INTEGER', `REAL', or
!                 `COMPLEX'.
  
  _Return value_:
       The return value is of type double precision real.
--- 8926,8936 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = DBLE(A)'
  
  _Arguments_:
!      A           The type shall be 'INTEGER', 'REAL', or
!                  'COMPLEX'.
  
  _Return value_:
       The return value is of type double precision real.
*************** _See also_:
*** 9027,9041 ****
  
  File: gfortran.info,  Node: DCMPLX,  Next: DIGITS,  Prev: DBLE,  Up: Intrinsic Procedures
  
! 9.77 `DCMPLX' -- Double complex conversion function
  ===================================================
  
  _Description_:
!      `DCMPLX(X [,Y])' returns a double complex number where X is
       converted to the real component.  If Y is present it is converted
!      to the imaginary component.  If Y is not present then the
!      imaginary component is set to 0.0.  If X is complex then Y must
!      not be present.
  
  _Standard_:
       GNU extension
--- 8949,8963 ----
  
  File: gfortran.info,  Node: DCMPLX,  Next: DIGITS,  Prev: DBLE,  Up: Intrinsic Procedures
  
! 9.77 'DCMPLX' -- Double complex conversion function
  ===================================================
  
  _Description_:
!      'DCMPLX(X [,Y])' returns a double complex number where X is
       converted to the real component.  If Y is present it is converted
!      to the imaginary component.  If Y is not present then the imaginary
!      component is set to 0.0.  If X is complex then Y must not be
!      present.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 9044,9059 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = DCMPLX(X [, Y])'
  
  _Arguments_:
!      X          The type may be `INTEGER', `REAL', or
!                 `COMPLEX'.
!      Y          (Optional if X is not `COMPLEX'.) May be
!                 `INTEGER' or `REAL'.
  
  _Return value_:
!      The return value is of type `COMPLEX(8)'
  
  _Example_:
            program test_dcmplx
--- 8966,8980 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = DCMPLX(X [, Y])'
  
  _Arguments_:
!      X           The type may be 'INTEGER', 'REAL', or 'COMPLEX'.
!      Y           (Optional if X is not 'COMPLEX'.)  May be
!                  'INTEGER' or 'REAL'.
  
  _Return value_:
!      The return value is of type 'COMPLEX(8)'
  
  _Example_:
            program test_dcmplx
*************** _Example_:
*** 9070,9083 ****
  
  File: gfortran.info,  Node: DIGITS,  Next: DIM,  Prev: DCMPLX,  Up: Intrinsic Procedures
  
! 9.78 `DIGITS' -- Significant binary digits function
  ===================================================
  
  _Description_:
!      `DIGITS(X)' returns the number of significant binary digits of the
!      internal model representation of X.  For example, on a system
!      using a 32-bit floating point representation, a default real
!      number would likely return 24.
  
  _Standard_:
       Fortran 95 and later
--- 8991,9004 ----
  
  File: gfortran.info,  Node: DIGITS,  Next: DIM,  Prev: DCMPLX,  Up: Intrinsic Procedures
  
! 9.78 'DIGITS' -- Significant binary digits function
  ===================================================
  
  _Description_:
!      'DIGITS(X)' returns the number of significant binary digits of the
!      internal model representation of X.  For example, on a system using
!      a 32-bit floating point representation, a default real number would
!      likely return 24.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 9086,9098 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = DIGITS(X)'
  
  _Arguments_:
!      X          The type may be `INTEGER' or `REAL'.
  
  _Return value_:
!      The return value is of type `INTEGER'.
  
  _Example_:
            program test_digits
--- 9007,9019 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = DIGITS(X)'
  
  _Arguments_:
!      X           The type may be 'INTEGER' or 'REAL'.
  
  _Return value_:
!      The return value is of type 'INTEGER'.
  
  _Example_:
            program test_digits
*************** _Example_:
*** 9107,9117 ****
  
  File: gfortran.info,  Node: DIM,  Next: DOT_PRODUCT,  Prev: DIGITS,  Up: Intrinsic Procedures
  
! 9.79 `DIM' -- Positive difference
  =================================
  
  _Description_:
!      `DIM(X,Y)' returns the difference `X-Y' if the result is positive;
       otherwise returns zero.
  
  _Standard_:
--- 9028,9038 ----
  
  File: gfortran.info,  Node: DIM,  Next: DOT_PRODUCT,  Prev: DIGITS,  Up: Intrinsic Procedures
  
! 9.79 'DIM' -- Positive difference
  =================================
  
  _Description_:
!      'DIM(X,Y)' returns the difference 'X-Y' if the result is positive;
       otherwise returns zero.
  
  _Standard_:
*************** _Class_:
*** 9121,9134 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = DIM(X, Y)'
  
  _Arguments_:
!      X          The type shall be `INTEGER' or `REAL'
!      Y          The type shall be the same type and kind as X.
  
  _Return value_:
!      The return value is of type `INTEGER' or `REAL'.
  
  _Example_:
            program test_dim
--- 9042,9055 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = DIM(X, Y)'
  
  _Arguments_:
!      X           The type shall be 'INTEGER' or 'REAL'
!      Y           The type shall be the same type and kind as X.
  
  _Return value_:
!      The return value is of type 'INTEGER' or 'REAL'.
  
  _Example_:
            program test_dim
*************** _Example_:
*** 9141,9169 ****
            end program test_dim
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DIM(X,Y)'    `REAL(4) X,   `REAL(4)'     Fortran 77 and
!                    Y'                          later
!      `IDIM(X,Y)'   `INTEGER(4)   `INTEGER(4)'  Fortran 77 and
!                    X, Y'                       later
!      `DDIM(X,Y)'   `REAL(8) X,   `REAL(8)'     Fortran 77 and
!                    Y'                          later
  
  
  File: gfortran.info,  Node: DOT_PRODUCT,  Next: DPROD,  Prev: DIM,  Up: Intrinsic Procedures
  
! 9.80 `DOT_PRODUCT' -- Dot product function
  ==========================================
  
  _Description_:
!      `DOT_PRODUCT(VECTOR_A, VECTOR_B)' computes the dot product
       multiplication of two vectors VECTOR_A and VECTOR_B.  The two
!      vectors may be either numeric or logical and must be arrays of
!      rank one and of equal size. If the vectors are `INTEGER' or
!      `REAL', the result is `SUM(VECTOR_A*VECTOR_B)'. If the vectors are
!      `COMPLEX', the result is `SUM(CONJG(VECTOR_A)*VECTOR_B)'. If the
!      vectors are `LOGICAL', the result is `ANY(VECTOR_A .AND.
!      VECTOR_B)'.
  
  _Standard_:
       Fortran 95 and later
--- 9062,9089 ----
            end program test_dim
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DIM(X,Y)'     'REAL(4) X,    'REAL(4)'      Fortran 77 and
!                     Y'                            later
!      'IDIM(X,Y)'    'INTEGER(4)    'INTEGER(4)'   Fortran 77 and
!                     X, Y'                         later
!      'DDIM(X,Y)'    'REAL(8) X,    'REAL(8)'      Fortran 77 and
!                     Y'                            later
  
  
  File: gfortran.info,  Node: DOT_PRODUCT,  Next: DPROD,  Prev: DIM,  Up: Intrinsic Procedures
  
! 9.80 'DOT_PRODUCT' -- Dot product function
  ==========================================
  
  _Description_:
!      'DOT_PRODUCT(VECTOR_A, VECTOR_B)' computes the dot product
       multiplication of two vectors VECTOR_A and VECTOR_B.  The two
!      vectors may be either numeric or logical and must be arrays of rank
!      one and of equal size.  If the vectors are 'INTEGER' or 'REAL', the
!      result is 'SUM(VECTOR_A*VECTOR_B)'.  If the vectors are 'COMPLEX',
!      the result is 'SUM(CONJG(VECTOR_A)*VECTOR_B)'.  If the vectors are
!      'LOGICAL', the result is 'ANY(VECTOR_A .AND. VECTOR_B)'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 9172,9190 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = DOT_PRODUCT(VECTOR_A, VECTOR_B)'
  
  _Arguments_:
!      VECTOR_A   The type shall be numeric or `LOGICAL', rank 1.
!      VECTOR_B   The type shall be numeric if VECTOR_A is of
!                 numeric type or `LOGICAL' if VECTOR_A is of
!                 type `LOGICAL'. VECTOR_B shall be a rank-one
!                 array.
  
  _Return value_:
       If the arguments are numeric, the return value is a scalar of
!      numeric type, `INTEGER', `REAL', or `COMPLEX'.  If the arguments
!      are `LOGICAL', the return value is `.TRUE.' or `.FALSE.'.
  
  _Example_:
            program test_dot_prod
--- 9092,9109 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = DOT_PRODUCT(VECTOR_A, VECTOR_B)'
  
  _Arguments_:
!      VECTOR_A    The type shall be numeric or 'LOGICAL', rank 1.
!      VECTOR_B    The type shall be numeric if VECTOR_A is of
!                  numeric type or 'LOGICAL' if VECTOR_A is of type
!                  'LOGICAL'.  VECTOR_B shall be a rank-one array.
  
  _Return value_:
       If the arguments are numeric, the return value is a scalar of
!      numeric type, 'INTEGER', 'REAL', or 'COMPLEX'.  If the arguments
!      are 'LOGICAL', the return value is '.TRUE.' or '.FALSE.'.
  
  _Example_:
            program test_dot_prod
*************** _Example_:
*** 9201,9211 ****
  
  File: gfortran.info,  Node: DPROD,  Next: DREAL,  Prev: DOT_PRODUCT,  Up: Intrinsic Procedures
  
! 9.81 `DPROD' -- Double product function
  =======================================
  
  _Description_:
!      `DPROD(X,Y)' returns the product `X*Y'.
  
  _Standard_:
       Fortran 77 and later
--- 9120,9130 ----
  
  File: gfortran.info,  Node: DPROD,  Next: DREAL,  Prev: DOT_PRODUCT,  Up: Intrinsic Procedures
  
! 9.81 'DPROD' -- Double product function
  =======================================
  
  _Description_:
!      'DPROD(X,Y)' returns the product 'X*Y'.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 9214,9227 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = DPROD(X, Y)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
!      Y          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type `REAL(8)'.
  
  _Example_:
            program test_dprod
--- 9133,9146 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = DPROD(X, Y)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
!      Y           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type 'REAL(8)'.
  
  _Example_:
            program test_dprod
*************** _Example_:
*** 9233,9251 ****
            end program test_dprod
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DPROD(X,Y)'  `REAL(4) X,   `REAL(8)'     Fortran 77 and
!                    Y'                          later
! 
  
  
  File: gfortran.info,  Node: DREAL,  Next: DSHIFTL,  Prev: DPROD,  Up: Intrinsic Procedures
  
! 9.82 `DREAL' -- Double real part function
  =========================================
  
  _Description_:
!      `DREAL(Z)' returns the real part of complex variable Z.
  
  _Standard_:
       GNU extension
--- 9152,9169 ----
            end program test_dprod
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DPROD(X,Y)'   'REAL(4) X,    'REAL(8)'      Fortran 77 and
!                     Y'                            later
  
  
  File: gfortran.info,  Node: DREAL,  Next: DSHIFTL,  Prev: DPROD,  Up: Intrinsic Procedures
  
! 9.82 'DREAL' -- Double real part function
  =========================================
  
  _Description_:
!      'DREAL(Z)' returns the real part of complex variable Z.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 9254,9266 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = DREAL(A)'
  
  _Arguments_:
!      A          The type shall be `COMPLEX(8)'.
  
  _Return value_:
!      The return value is of type `REAL(8)'.
  
  _Example_:
            program test_dreal
--- 9172,9184 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = DREAL(A)'
  
  _Arguments_:
!      A           The type shall be 'COMPLEX(8)'.
  
  _Return value_:
!      The return value is of type 'REAL(8)'.
  
  _Example_:
            program test_dreal
*************** _Example_:
*** 9271,9285 ****
  _See also_:
       *note AIMAG::
  
- 
  
  File: gfortran.info,  Node: DSHIFTL,  Next: DSHIFTR,  Prev: DREAL,  Up: Intrinsic Procedures
  
! 9.83 `DSHIFTL' -- Combined left shift
  =====================================
  
  _Description_:
!      `DSHIFTL(I, J, SHIFT)' combines bits of I and J. The rightmost
       SHIFT bits of the result are the leftmost SHIFT bits of J, and the
       remaining bits are the rightmost bits of I.
  
--- 9189,9202 ----
  _See also_:
       *note AIMAG::
  
  
  File: gfortran.info,  Node: DSHIFTL,  Next: DSHIFTR,  Prev: DREAL,  Up: Intrinsic Procedures
  
! 9.83 'DSHIFTL' -- Combined left shift
  =====================================
  
  _Description_:
!      'DSHIFTL(I, J, SHIFT)' combines bits of I and J.  The rightmost
       SHIFT bits of the result are the leftmost SHIFT bits of J, and the
       remaining bits are the rightmost bits of I.
  
*************** _Class_:
*** 9290,9312 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = DSHIFTL(I, J, SHIFT)'
  
  _Arguments_:
!      I          Shall be of type `INTEGER' or a BOZ constant.
!      J          Shall be of type `INTEGER' or a BOZ constant.
!                 If both I and J have integer type, then they
!                 shall have the same kind type parameter. I and
!                 J shall not both be BOZ constants.
!      SHIFT      Shall be of type `INTEGER'. It shall be
!                 nonnegative.  If I is not a BOZ constant, then
!                 SHIFT shall be less than or equal to
!                 `BIT_SIZE(I)'; otherwise, SHIFT shall be less
!                 than or equal to `BIT_SIZE(J)'.
  
  _Return value_:
       If either I or J is a BOZ constant, it is first converted as if by
!      the intrinsic function `INT' to an integer type with the kind type
       parameter of the other.
  
  _See also_:
--- 9207,9229 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = DSHIFTL(I, J, SHIFT)'
  
  _Arguments_:
!      I           Shall be of type 'INTEGER' or a BOZ constant.
!      J           Shall be of type 'INTEGER' or a BOZ constant.
!                  If both I and J have integer type, then they
!                  shall have the same kind type parameter.  I and
!                  J shall not both be BOZ constants.
!      SHIFT       Shall be of type 'INTEGER'.  It shall be
!                  nonnegative.  If I is not a BOZ constant, then
!                  SHIFT shall be less than or equal to
!                  'BIT_SIZE(I)'; otherwise, SHIFT shall be less
!                  than or equal to 'BIT_SIZE(J)'.
  
  _Return value_:
       If either I or J is a BOZ constant, it is first converted as if by
!      the intrinsic function 'INT' to an integer type with the kind type
       parameter of the other.
  
  _See also_:
*************** _See also_:
*** 9315,9327 ****
  
  File: gfortran.info,  Node: DSHIFTR,  Next: DTIME,  Prev: DSHIFTL,  Up: Intrinsic Procedures
  
! 9.84 `DSHIFTR' -- Combined right shift
  ======================================
  
  _Description_:
!      `DSHIFTR(I, J, SHIFT)' combines bits of I and J. The leftmost
!      SHIFT bits of the result are the rightmost SHIFT bits of I, and
!      the remaining bits are the leftmost bits of J.
  
  _Standard_:
       Fortran 2008 and later
--- 9232,9244 ----
  
  File: gfortran.info,  Node: DSHIFTR,  Next: DTIME,  Prev: DSHIFTL,  Up: Intrinsic Procedures
  
! 9.84 'DSHIFTR' -- Combined right shift
  ======================================
  
  _Description_:
!      'DSHIFTR(I, J, SHIFT)' combines bits of I and J.  The leftmost
!      SHIFT bits of the result are the rightmost SHIFT bits of I, and the
!      remaining bits are the leftmost bits of J.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 9330,9352 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = DSHIFTR(I, J, SHIFT)'
  
  _Arguments_:
!      I          Shall be of type `INTEGER' or a BOZ constant.
!      J          Shall be of type `INTEGER' or a BOZ constant.
!                 If both I and J have integer type, then they
!                 shall have the same kind type parameter. I and
!                 J shall not both be BOZ constants.
!      SHIFT      Shall be of type `INTEGER'. It shall be
!                 nonnegative.  If I is not a BOZ constant, then
!                 SHIFT shall be less than or equal to
!                 `BIT_SIZE(I)'; otherwise, SHIFT shall be less
!                 than or equal to `BIT_SIZE(J)'.
  
  _Return value_:
       If either I or J is a BOZ constant, it is first converted as if by
!      the intrinsic function `INT' to an integer type with the kind type
       parameter of the other.
  
  _See also_:
--- 9247,9269 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = DSHIFTR(I, J, SHIFT)'
  
  _Arguments_:
!      I           Shall be of type 'INTEGER' or a BOZ constant.
!      J           Shall be of type 'INTEGER' or a BOZ constant.
!                  If both I and J have integer type, then they
!                  shall have the same kind type parameter.  I and
!                  J shall not both be BOZ constants.
!      SHIFT       Shall be of type 'INTEGER'.  It shall be
!                  nonnegative.  If I is not a BOZ constant, then
!                  SHIFT shall be less than or equal to
!                  'BIT_SIZE(I)'; otherwise, SHIFT shall be less
!                  than or equal to 'BIT_SIZE(J)'.
  
  _Return value_:
       If either I or J is a BOZ constant, it is first converted as if by
!      the intrinsic function 'INT' to an integer type with the kind type
       parameter of the other.
  
  _See also_:
*************** _See also_:
*** 9355,9396 ****
  
  File: gfortran.info,  Node: DTIME,  Next: EOSHIFT,  Prev: DSHIFTR,  Up: Intrinsic Procedures
  
! 9.85 `DTIME' -- Execution time subroutine (or function)
  =======================================================
  
  _Description_:
!      `DTIME(VALUES, TIME)' initially returns the number of seconds of
       runtime since the start of the process's execution in TIME.  VALUES
!      returns the user and system components of this time in `VALUES(1)'
!      and `VALUES(2)' respectively. TIME is equal to `VALUES(1) +
       VALUES(2)'.
  
!      Subsequent invocations of `DTIME' return values accumulated since
       the previous invocation.
  
!      On some systems, the underlying timings are represented using
!      types with sufficiently small limits that overflows (wrap around)
!      are possible, such as 32-bit types. Therefore, the values returned
!      by this intrinsic might be, or become, negative, or numerically
!      less than previous values, during a single run of the compiled
!      program.
  
!      Please note, that this implementation is thread safe if used
!      within OpenMP directives, i.e., its state will be consistent while
!      called from multiple threads. However, if `DTIME' is called from
!      multiple threads, the result is still the time since the last
!      invocation. This may not give the intended results. If possible,
!      use `CPU_TIME' instead.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      VALUES and TIME are `INTENT(OUT)' and provide the following:
  
!                 `VALUES(1)':         User time in seconds.
!                 `VALUES(2)':         System time in seconds.
!                 `TIME':              Run time since start in
!                                      seconds.
  
  _Standard_:
       GNU extension
--- 9272,9312 ----
  
  File: gfortran.info,  Node: DTIME,  Next: EOSHIFT,  Prev: DSHIFTR,  Up: Intrinsic Procedures
  
! 9.85 'DTIME' -- Execution time subroutine (or function)
  =======================================================
  
  _Description_:
!      'DTIME(VALUES, TIME)' initially returns the number of seconds of
       runtime since the start of the process's execution in TIME.  VALUES
!      returns the user and system components of this time in 'VALUES(1)'
!      and 'VALUES(2)' respectively.  TIME is equal to 'VALUES(1) +
       VALUES(2)'.
  
!      Subsequent invocations of 'DTIME' return values accumulated since
       the previous invocation.
  
!      On some systems, the underlying timings are represented using types
!      with sufficiently small limits that overflows (wrap around) are
!      possible, such as 32-bit types.  Therefore, the values returned by
!      this intrinsic might be, or become, negative, or numerically less
!      than previous values, during a single run of the compiled program.
  
!      Please note, that this implementation is thread safe if used within
!      OpenMP directives, i.e., its state will be consistent while called
!      from multiple threads.  However, if 'DTIME' is called from multiple
!      threads, the result is still the time since the last invocation.
!      This may not give the intended results.  If possible, use
!      'CPU_TIME' instead.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      VALUES and TIME are 'INTENT(OUT)' and provide the following:
  
!                  'VALUES(1)':           User time in seconds.
!                  'VALUES(2)':           System time in seconds.
!                  'TIME':                Run time since start in
!                                         seconds.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 9399,9410 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL DTIME(VALUES, TIME)'.
!      `TIME = DTIME(VALUES)', (not recommended).
  
  _Arguments_:
!      VALUES     The type shall be `REAL(4), DIMENSION(2)'.
!      TIME       The type shall be `REAL(4)'.
  
  _Return value_:
       Elapsed time in seconds since the last invocation or since the
--- 9315,9326 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL DTIME(VALUES, TIME)'.
!      'TIME = DTIME(VALUES)', (not recommended).
  
  _Arguments_:
!      VALUES      The type shall be 'REAL(4), DIMENSION(2)'.
!      TIME        The type shall be 'REAL(4)'.
  
  _Return value_:
       Elapsed time in seconds since the last invocation or since the
*************** _Example_:
*** 9431,9461 ****
  _See also_:
       *note CPU_TIME::
  
- 
  
  File: gfortran.info,  Node: EOSHIFT,  Next: EPSILON,  Prev: DTIME,  Up: Intrinsic Procedures
  
! 9.86 `EOSHIFT' -- End-off shift elements of an array
  ====================================================
  
  _Description_:
!      `EOSHIFT(ARRAY, SHIFT[, BOUNDARY, DIM])' performs an end-off shift
!      on elements of ARRAY along the dimension of DIM.  If DIM is
!      omitted it is taken to be `1'.  DIM is a scalar of type `INTEGER'
!      in the range of 1 \leq DIM \leq n) where n is the rank of ARRAY.
!      If the rank of ARRAY is one, then all elements of ARRAY are
!      shifted by SHIFT places.  If rank is greater than one, then all
!      complete rank one sections of ARRAY along the given dimension are
!      shifted.  Elements shifted out one end of each rank one section
!      are dropped.  If BOUNDARY is present then the corresponding value
!      of from BOUNDARY is copied back in the other end.  If BOUNDARY is
!      not present then the following are copied in depending on the type
!      of ARRAY.
  
!      _Array     _Boundary Value_
!      Type_      
!      Numeric    0 of the type and kind of ARRAY.
!      Logical    `.FALSE.'.
       Character(LEN)LEN blanks.
  
  _Standard_:
--- 9347,9376 ----
  _See also_:
       *note CPU_TIME::
  
  
  File: gfortran.info,  Node: EOSHIFT,  Next: EPSILON,  Prev: DTIME,  Up: Intrinsic Procedures
  
! 9.86 'EOSHIFT' -- End-off shift elements of an array
  ====================================================
  
  _Description_:
!      'EOSHIFT(ARRAY, SHIFT[, BOUNDARY, DIM])' performs an end-off shift
!      on elements of ARRAY along the dimension of DIM.  If DIM is omitted
!      it is taken to be '1'.  DIM is a scalar of type 'INTEGER' in the
!      range of 1 \leq DIM \leq n) where n is the rank of ARRAY.  If the
!      rank of ARRAY is one, then all elements of ARRAY are shifted by
!      SHIFT places.  If rank is greater than one, then all complete rank
!      one sections of ARRAY along the given dimension are shifted.
!      Elements shifted out one end of each rank one section are dropped.
!      If BOUNDARY is present then the corresponding value of from
!      BOUNDARY is copied back in the other end.  If BOUNDARY is not
!      present then the following are copied in depending on the type of
!      ARRAY.
  
!      _Array      _Boundary Value_
!      Type_
!      Numeric     0 of the type and kind of ARRAY.
!      Logical     '.FALSE.'.
       Character(LEN)LEN blanks.
  
  _Standard_:
*************** _Class_:
*** 9465,9477 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = EOSHIFT(ARRAY, SHIFT [, BOUNDARY, DIM])'
  
  _Arguments_:
!      ARRAY      May be any type, not scalar.
!      SHIFT      The type shall be `INTEGER'.
!      BOUNDARY   Same type as ARRAY.
!      DIM        The type shall be `INTEGER'.
  
  _Return value_:
       Returns an array of same type and rank as the ARRAY argument.
--- 9380,9392 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = EOSHIFT(ARRAY, SHIFT [, BOUNDARY, DIM])'
  
  _Arguments_:
!      ARRAY       May be any type, not scalar.
!      SHIFT       The type shall be 'INTEGER'.
!      BOUNDARY    Same type as ARRAY.
!      DIM         The type shall be 'INTEGER'.
  
  _Return value_:
       Returns an array of same type and rank as the ARRAY argument.
*************** _Example_:
*** 9493,9503 ****
  
  File: gfortran.info,  Node: EPSILON,  Next: ERF,  Prev: EOSHIFT,  Up: Intrinsic Procedures
  
! 9.87 `EPSILON' -- Epsilon function
  ==================================
  
  _Description_:
!      `EPSILON(X)' returns the smallest number E of the same kind as X
       such that 1 + E > 1.
  
  _Standard_:
--- 9408,9418 ----
  
  File: gfortran.info,  Node: EPSILON,  Next: ERF,  Prev: EOSHIFT,  Up: Intrinsic Procedures
  
! 9.87 'EPSILON' -- Epsilon function
  ==================================
  
  _Description_:
!      'EPSILON(X)' returns the smallest number E of the same kind as X
       such that 1 + E > 1.
  
  _Standard_:
*************** _Class_:
*** 9507,9516 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = EPSILON(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
       The return value is of same type as the argument.
--- 9422,9431 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = EPSILON(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
       The return value is of same type as the argument.
*************** _Example_:
*** 9526,9536 ****
  
  File: gfortran.info,  Node: ERF,  Next: ERFC,  Prev: EPSILON,  Up: Intrinsic Procedures
  
! 9.88 `ERF' -- Error function
  ============================
  
  _Description_:
!      `ERF(X)' computes the error function of X.
  
  _Standard_:
       Fortran 2008 and later
--- 9441,9451 ----
  
  File: gfortran.info,  Node: ERF,  Next: ERFC,  Prev: EPSILON,  Up: Intrinsic Procedures
  
! 9.88 'ERF' -- Error function
  ============================
  
  _Description_:
!      'ERF(X)' computes the error function of X.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 9539,9551 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ERF(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type `REAL', of the same kind as X and lies
       in the range -1 \leq erf (x) \leq 1 .
  
  _Example_:
--- 9454,9466 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ERF(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type 'REAL', of the same kind as X and lies
       in the range -1 \leq erf (x) \leq 1 .
  
  _Example_:
*************** _Example_:
*** 9555,9571 ****
            end program test_erf
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DERF(X)'     `REAL(8) X'   `REAL(8)'     GNU extension
  
  
  File: gfortran.info,  Node: ERFC,  Next: ERFC_SCALED,  Prev: ERF,  Up: Intrinsic Procedures
  
! 9.89 `ERFC' -- Error function
  =============================
  
  _Description_:
!      `ERFC(X)' computes the complementary error function of X.
  
  _Standard_:
       Fortran 2008 and later
--- 9470,9486 ----
            end program test_erf
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DERF(X)'      'REAL(8) X'    'REAL(8)'      GNU extension
  
  
  File: gfortran.info,  Node: ERFC,  Next: ERFC_SCALED,  Prev: ERF,  Up: Intrinsic Procedures
  
! 9.89 'ERFC' -- Error function
  =============================
  
  _Description_:
!      'ERFC(X)' computes the complementary error function of X.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 9574,9587 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ERFC(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type `REAL' and of the same kind as X.  It
!      lies in the range  0 \leq erfc (x) \leq 2 .
  
  _Example_:
            program test_erfc
--- 9489,9502 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ERFC(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type 'REAL' and of the same kind as X.  It
!      lies in the range 0 \leq erfc (x) \leq 2 .
  
  _Example_:
            program test_erfc
*************** _Example_:
*** 9590,9606 ****
            end program test_erfc
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `DERFC(X)'    `REAL(8) X'   `REAL(8)'     GNU extension
  
  
  File: gfortran.info,  Node: ERFC_SCALED,  Next: ETIME,  Prev: ERFC,  Up: Intrinsic Procedures
  
! 9.90 `ERFC_SCALED' -- Error function
  ====================================
  
  _Description_:
!      `ERFC_SCALED(X)' computes the exponentially-scaled complementary
       error function of X.
  
  _Standard_:
--- 9505,9521 ----
            end program test_erfc
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'DERFC(X)'     'REAL(8) X'    'REAL(8)'      GNU extension
  
  
  File: gfortran.info,  Node: ERFC_SCALED,  Next: ETIME,  Prev: ERFC,  Up: Intrinsic Procedures
  
! 9.90 'ERFC_SCALED' -- Error function
  ====================================
  
  _Description_:
!      'ERFC_SCALED(X)' computes the exponentially-scaled complementary
       error function of X.
  
  _Standard_:
*************** _Class_:
*** 9610,9622 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ERFC_SCALED(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type `REAL' and of the same kind as X.
  
  _Example_:
            program test_erfc_scaled
--- 9525,9537 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ERFC_SCALED(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type 'REAL' and of the same kind as X.
  
  _Example_:
            program test_erfc_scaled
*************** _Example_:
*** 9627,9657 ****
  
  File: gfortran.info,  Node: ETIME,  Next: EXECUTE_COMMAND_LINE,  Prev: ERFC_SCALED,  Up: Intrinsic Procedures
  
! 9.91 `ETIME' -- Execution time subroutine (or function)
  =======================================================
  
  _Description_:
!      `ETIME(VALUES, TIME)' returns the number of seconds of runtime
!      since the start of the process's execution in TIME.  VALUES
!      returns the user and system components of this time in `VALUES(1)'
!      and `VALUES(2)' respectively. TIME is equal to `VALUES(1) +
       VALUES(2)'.
  
!      On some systems, the underlying timings are represented using
!      types with sufficiently small limits that overflows (wrap around)
!      are possible, such as 32-bit types. Therefore, the values returned
!      by this intrinsic might be, or become, negative, or numerically
!      less than previous values, during a single run of the compiled
!      program.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      VALUES and TIME are `INTENT(OUT)' and provide the following:
  
!                 `VALUES(1)':         User time in seconds.
!                 `VALUES(2)':         System time in seconds.
!                 `TIME':              Run time since start in seconds.
  
  _Standard_:
       GNU extension
--- 9542,9571 ----
  
  File: gfortran.info,  Node: ETIME,  Next: EXECUTE_COMMAND_LINE,  Prev: ERFC_SCALED,  Up: Intrinsic Procedures
  
! 9.91 'ETIME' -- Execution time subroutine (or function)
  =======================================================
  
  _Description_:
!      'ETIME(VALUES, TIME)' returns the number of seconds of runtime
!      since the start of the process's execution in TIME.  VALUES returns
!      the user and system components of this time in 'VALUES(1)' and
!      'VALUES(2)' respectively.  TIME is equal to 'VALUES(1) +
       VALUES(2)'.
  
!      On some systems, the underlying timings are represented using types
!      with sufficiently small limits that overflows (wrap around) are
!      possible, such as 32-bit types.  Therefore, the values returned by
!      this intrinsic might be, or become, negative, or numerically less
!      than previous values, during a single run of the compiled program.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      VALUES and TIME are 'INTENT(OUT)' and provide the following:
  
!                  'VALUES(1)':           User time in seconds.
!                  'VALUES(2)':           System time in seconds.
!                  'TIME':                Run time since start in seconds.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 9660,9671 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL ETIME(VALUES, TIME)'.
!      `TIME = ETIME(VALUES)', (not recommended).
  
  _Arguments_:
!      VALUES     The type shall be `REAL(4), DIMENSION(2)'.
!      TIME       The type shall be `REAL(4)'.
  
  _Return value_:
       Elapsed time in seconds since the start of program execution.
--- 9574,9585 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL ETIME(VALUES, TIME)'.
!      'TIME = ETIME(VALUES)', (not recommended).
  
  _Arguments_:
!      VALUES      The type shall be 'REAL(4), DIMENSION(2)'.
!      TIME        The type shall be 'REAL(4)'.
  
  _Return value_:
       Elapsed time in seconds since the start of program execution.
*************** _Example_:
*** 9691,9723 ****
  _See also_:
       *note CPU_TIME::
  
- 
  
  File: gfortran.info,  Node: EXECUTE_COMMAND_LINE,  Next: EXIT,  Prev: ETIME,  Up: Intrinsic Procedures
  
! 9.92 `EXECUTE_COMMAND_LINE' -- Execute a shell command
  ======================================================
  
  _Description_:
!      `EXECUTE_COMMAND_LINE' runs a shell command, synchronously or
       asynchronously.
  
!      The `COMMAND' argument is passed to the shell and executed, using
!      the C library's `system' call.  (The shell is `sh' on Unix
!      systems, and `cmd.exe' on Windows.)  If `WAIT' is present and has
!      the value false, the execution of the command is asynchronous if
!      the system supports it; otherwise, the command is executed
!      synchronously.
  
       The three last arguments allow the user to get status information.
!      After synchronous execution, `EXITSTAT' contains the integer exit
!      code of the command, as returned by `system'.  `CMDSTAT' is set to
       zero if the command line was executed (whatever its exit status
!      was).  `CMDMSG' is assigned an error message if an error has
       occurred.
  
!      Note that the `system' function need not be thread-safe. It is the
!      responsibility of the user to ensure that `system' is not called
       concurrently.
  
  _Standard_:
--- 9605,9635 ----
  _See also_:
       *note CPU_TIME::
  
  
  File: gfortran.info,  Node: EXECUTE_COMMAND_LINE,  Next: EXIT,  Prev: ETIME,  Up: Intrinsic Procedures
  
! 9.92 'EXECUTE_COMMAND_LINE' -- Execute a shell command
  ======================================================
  
  _Description_:
!      'EXECUTE_COMMAND_LINE' runs a shell command, synchronously or
       asynchronously.
  
!      The 'COMMAND' argument is passed to the shell and executed, using
!      the C library's 'system' call.  (The shell is 'sh' on Unix systems,
!      and 'cmd.exe' on Windows.)  If 'WAIT' is present and has the value
!      false, the execution of the command is asynchronous if the system
!      supports it; otherwise, the command is executed synchronously.
  
       The three last arguments allow the user to get status information.
!      After synchronous execution, 'EXITSTAT' contains the integer exit
!      code of the command, as returned by 'system'.  'CMDSTAT' is set to
       zero if the command line was executed (whatever its exit status
!      was).  'CMDMSG' is assigned an error message if an error has
       occurred.
  
!      Note that the 'system' function need not be thread-safe.  It is the
!      responsibility of the user to ensure that 'system' is not called
       concurrently.
  
  _Standard_:
*************** _Class_:
*** 9727,9744 ****
       Subroutine
  
  _Syntax_:
!      `CALL EXECUTE_COMMAND_LINE(COMMAND [, WAIT, EXITSTAT, CMDSTAT,
       CMDMSG ])'
  
  _Arguments_:
!      COMMAND    Shall be a default `CHARACTER' scalar.
!      WAIT       (Optional) Shall be a default `LOGICAL' scalar.
!      EXITSTAT   (Optional) Shall be an `INTEGER' of the
!                 default kind.
!      CMDSTAT    (Optional) Shall be an `INTEGER' of the
!                 default kind.
!      CMDMSG     (Optional) Shall be an `CHARACTER' scalar of
!                 the default kind.
  
  _Example_:
            program test_exec
--- 9639,9656 ----
       Subroutine
  
  _Syntax_:
!      'CALL EXECUTE_COMMAND_LINE(COMMAND [, WAIT, EXITSTAT, CMDSTAT,
       CMDMSG ])'
  
  _Arguments_:
!      COMMAND     Shall be a default 'CHARACTER' scalar.
!      WAIT        (Optional) Shall be a default 'LOGICAL' scalar.
!      EXITSTAT    (Optional) Shall be an 'INTEGER' of the default
!                  kind.
!      CMDSTAT     (Optional) Shall be an 'INTEGER' of the default
!                  kind.
!      CMDMSG      (Optional) Shall be an 'CHARACTER' scalar of the
!                  default kind.
  
  _Example_:
            program test_exec
*************** _Example_:
*** 9753,9763 ****
            end program test_exec
  
  _Note_:
!      Because this intrinsic is implemented in terms of the `system'
       function call, its behavior with respect to signaling is processor
!      dependent. In particular, on POSIX-compliant systems, the SIGINT
       and SIGQUIT signals will be ignored, and the SIGCHLD will be
!      blocked. As such, if the parent process is terminated, the child
       process might not be terminated alongside.
  
  _See also_:
--- 9665,9676 ----
            end program test_exec
  
  _Note_:
! 
!      Because this intrinsic is implemented in terms of the 'system'
       function call, its behavior with respect to signaling is processor
!      dependent.  In particular, on POSIX-compliant systems, the SIGINT
       and SIGQUIT signals will be ignored, and the SIGCHLD will be
!      blocked.  As such, if the parent process is terminated, the child
       process might not be terminated alongside.
  
  _See also_:
*************** _See also_:
*** 9766,9777 ****
  
  File: gfortran.info,  Node: EXIT,  Next: EXP,  Prev: EXECUTE_COMMAND_LINE,  Up: Intrinsic Procedures
  
! 9.93 `EXIT' -- Exit the program with status.
  ============================================
  
  _Description_:
!      `EXIT' causes immediate termination of the program with status.
!      If status is omitted it returns the canonical _success_ for the
       system.  All Fortran I/O units are closed.
  
  _Standard_:
--- 9679,9690 ----
  
  File: gfortran.info,  Node: EXIT,  Next: EXP,  Prev: EXECUTE_COMMAND_LINE,  Up: Intrinsic Procedures
  
! 9.93 'EXIT' -- Exit the program with status.
  ============================================
  
  _Description_:
!      'EXIT' causes immediate termination of the program with status.  If
!      status is omitted it returns the canonical _success_ for the
       system.  All Fortran I/O units are closed.
  
  _Standard_:
*************** _Class_:
*** 9781,9793 ****
       Subroutine
  
  _Syntax_:
!      `CALL EXIT([STATUS])'
  
  _Arguments_:
!      STATUS     Shall be an `INTEGER' of the default kind.
  
  _Return value_:
!      `STATUS' is passed to the parent process on exit.
  
  _Example_:
            program test_exit
--- 9694,9706 ----
       Subroutine
  
  _Syntax_:
!      'CALL EXIT([STATUS])'
  
  _Arguments_:
!      STATUS      Shall be an 'INTEGER' of the default kind.
  
  _Return value_:
!      'STATUS' is passed to the parent process on exit.
  
  _Example_:
            program test_exit
*************** _See also_:
*** 9802,9812 ****
  
  File: gfortran.info,  Node: EXP,  Next: EXPONENT,  Prev: EXIT,  Up: Intrinsic Procedures
  
! 9.94 `EXP' -- Exponential function
  ==================================
  
  _Description_:
!      `EXP(X)' computes the base e exponential of X.
  
  _Standard_:
       Fortran 77 and later, has overloads that are GNU extensions
--- 9715,9725 ----
  
  File: gfortran.info,  Node: EXP,  Next: EXPONENT,  Prev: EXIT,  Up: Intrinsic Procedures
  
! 9.94 'EXP' -- Exponential function
  ==================================
  
  _Description_:
!      'EXP(X)' computes the base e exponential of X.
  
  _Standard_:
       Fortran 77 and later, has overloads that are GNU extensions
*************** _Class_:
*** 9815,9824 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = EXP(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
       The return value has same type and kind as X.
--- 9728,9737 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = EXP(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
       The return value has same type and kind as X.
*************** _Example_:
*** 9830,9855 ****
            end program test_exp
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `EXP(X)'      `REAL(4) X'   `REAL(4)'     Fortran 77 and
!                                                later
!      `DEXP(X)'     `REAL(8) X'   `REAL(8)'     Fortran 77 and
!                                                later
!      `CEXP(X)'     `COMPLEX(4)   `COMPLEX(4)'  Fortran 77 and
!                    X'                          later
!      `ZEXP(X)'     `COMPLEX(8)   `COMPLEX(8)'  GNU extension
!                    X'                          
!      `CDEXP(X)'    `COMPLEX(8)   `COMPLEX(8)'  GNU extension
!                    X'                          
  
  
  File: gfortran.info,  Node: EXPONENT,  Next: EXTENDS_TYPE_OF,  Prev: EXP,  Up: Intrinsic Procedures
  
! 9.95 `EXPONENT' -- Exponent function
  ====================================
  
  _Description_:
!      `EXPONENT(X)' returns the value of the exponent part of X. If X is
       zero the value returned is zero.
  
  _Standard_:
--- 9743,9768 ----
            end program test_exp
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'EXP(X)'       'REAL(4) X'    'REAL(4)'      Fortran 77 and
!                                                   later
!      'DEXP(X)'      'REAL(8) X'    'REAL(8)'      Fortran 77 and
!                                                   later
!      'CEXP(X)'      'COMPLEX(4)    'COMPLEX(4)'   Fortran 77 and
!                     X'                            later
!      'ZEXP(X)'      'COMPLEX(8)    'COMPLEX(8)'   GNU extension
!                     X'
!      'CDEXP(X)'     'COMPLEX(8)    'COMPLEX(8)'   GNU extension
!                     X'
  
  
  File: gfortran.info,  Node: EXPONENT,  Next: EXTENDS_TYPE_OF,  Prev: EXP,  Up: Intrinsic Procedures
  
! 9.95 'EXPONENT' -- Exponent function
  ====================================
  
  _Description_:
!      'EXPONENT(X)' returns the value of the exponent part of X.  If X is
       zero the value returned is zero.
  
  _Standard_:
*************** _Class_:
*** 9859,9871 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = EXPONENT(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type default `INTEGER'.
  
  _Example_:
            program test_exponent
--- 9772,9784 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = EXPONENT(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type default 'INTEGER'.
  
  _Example_:
            program test_exponent
*************** _Example_:
*** 9879,9886 ****
  
  File: gfortran.info,  Node: EXTENDS_TYPE_OF,  Next: FDATE,  Prev: EXPONENT,  Up: Intrinsic Procedures
  
! 9.96 `EXTENDS_TYPE_OF' --  Query dynamic type for extension
! ===========================================================
  
  _Description_:
       Query dynamic type for extension.
--- 9792,9799 ----
  
  File: gfortran.info,  Node: EXTENDS_TYPE_OF,  Next: FDATE,  Prev: EXPONENT,  Up: Intrinsic Procedures
  
! 9.96 'EXTENDS_TYPE_OF' -- Query dynamic type for extension
! ==========================================================
  
  _Description_:
       Query dynamic type for extension.
*************** _Class_:
*** 9892,9907 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = EXTENDS_TYPE_OF(A, MOLD)'
  
  _Arguments_:
!      A          Shall be an object of extensible declared type
!                 or unlimited polymorphic.
!      MOLD       Shall be an object of extensible declared type
!                 or unlimited polymorphic.
  
  _Return value_:
!      The return value is a scalar of type default logical. It is true
       if and only if the dynamic type of A is an extension type of the
       dynamic type of MOLD.
  
--- 9805,9820 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = EXTENDS_TYPE_OF(A, MOLD)'
  
  _Arguments_:
!      A           Shall be an object of extensible declared type
!                  or unlimited polymorphic.
!      MOLD        Shall be an object of extensible declared type
!                  or unlimited polymorphic.
  
  _Return value_:
!      The return value is a scalar of type default logical.  It is true
       if and only if the dynamic type of A is an extension type of the
       dynamic type of MOLD.
  
*************** _See also_:
*** 9911,9922 ****
  
  File: gfortran.info,  Node: FDATE,  Next: FGET,  Prev: EXTENDS_TYPE_OF,  Up: Intrinsic Procedures
  
! 9.97 `FDATE' -- Get the current time as a string
  ================================================
  
  _Description_:
!      `FDATE(DATE)' returns the current date (using the same format as
!      `CTIME') in DATE. It is equivalent to `CALL CTIME(DATE, TIME())'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 9824,9835 ----
  
  File: gfortran.info,  Node: FDATE,  Next: FGET,  Prev: EXTENDS_TYPE_OF,  Up: Intrinsic Procedures
  
! 9.97 'FDATE' -- Get the current time as a string
  ================================================
  
  _Description_:
!      'FDATE(DATE)' returns the current date (using the same format as
!      'CTIME') in DATE.  It is equivalent to 'CALL CTIME(DATE, TIME())'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 9928,9943 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL FDATE(DATE)'.
!      `DATE = FDATE()'.
  
  _Arguments_:
!      DATE       The type shall be of type `CHARACTER' of the
!                 default kind. It is an `INTENT(OUT)' argument.
!                 If the length of this variable is too short
!                 for the date and time string to fit
!                 completely, it will be blank on procedure
!                 return.
  
  _Return value_:
       The current date and time as a string.
--- 9841,9855 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL FDATE(DATE)'.
!      'DATE = FDATE()'.
  
  _Arguments_:
!      DATE        The type shall be of type 'CHARACTER' of the
!                  default kind.  It is an 'INTENT(OUT)' argument.
!                  If the length of this variable is too short for
!                  the date and time string to fit completely, it
!                  will be blank on procedure return.
  
  _Return value_:
       The current date and time as a string.
*************** _See also_:
*** 9961,9983 ****
  
  File: gfortran.info,  Node: FGET,  Next: FGETC,  Prev: FDATE,  Up: Intrinsic Procedures
  
! 9.98 `FGET' -- Read a single character in stream mode from stdin
  ================================================================
  
  _Description_:
       Read a single character in stream mode from stdin by bypassing
!      normal formatted output. Stream I/O should not be mixed with
       normal record-oriented (formatted or unformatted) I/O on the same
       unit; the results are unpredictable.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the `FGET' intrinsic is provided for backwards
!      compatibility with `g77'.  GNU Fortran provides the Fortran 2003
!      Stream facility.  Programmers should consider the use of new
!      stream IO feature in new code for future portability. See also
!      *note Fortran 2003 status::.
  
  _Standard_:
       GNU extension
--- 9873,9895 ----
  
  File: gfortran.info,  Node: FGET,  Next: FGETC,  Prev: FDATE,  Up: Intrinsic Procedures
  
! 9.98 'FGET' -- Read a single character in stream mode from stdin
  ================================================================
  
  _Description_:
       Read a single character in stream mode from stdin by bypassing
!      normal formatted output.  Stream I/O should not be mixed with
       normal record-oriented (formatted or unformatted) I/O on the same
       unit; the results are unpredictable.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the 'FGET' intrinsic is provided for backwards
!      compatibility with 'g77'.  GNU Fortran provides the Fortran 2003
!      Stream facility.  Programmers should consider the use of new stream
!      IO feature in new code for future portability.  See also *note
!      Fortran 2003 status::.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 9986,10000 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL FGET(C [, STATUS])'
!      `STATUS = FGET(C)'
  
  _Arguments_:
!      C          The type shall be `CHARACTER' and of default
!                 kind.
!      STATUS     (Optional) status flag of type `INTEGER'.
!                 Returns 0 on success, -1 on end-of-file, and a
!                 system specific positive error code otherwise.
  
  _Example_:
            PROGRAM test_fget
--- 9898,9912 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL FGET(C [, STATUS])'
!      'STATUS = FGET(C)'
  
  _Arguments_:
!      C           The type shall be 'CHARACTER' and of default
!                  kind.
!      STATUS      (Optional) status flag of type 'INTEGER'.
!                  Returns 0 on success, -1 on end-of-file, and a
!                  system specific positive error code otherwise.
  
  _Example_:
            PROGRAM test_fget
*************** _See also_:
*** 10017,10023 ****
  
  File: gfortran.info,  Node: FGETC,  Next: FLOOR,  Prev: FGET,  Up: Intrinsic Procedures
  
! 9.99 `FGETC' -- Read a single character in stream mode
  ======================================================
  
  _Description_:
--- 9929,9935 ----
  
  File: gfortran.info,  Node: FGETC,  Next: FLOOR,  Prev: FGET,  Up: Intrinsic Procedures
  
! 9.99 'FGETC' -- Read a single character in stream mode
  ======================================================
  
  _Description_:
*************** _Description_:
*** 10029,10039 ****
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the `FGET' intrinsic is provided for backwards
!      compatibility with `g77'.  GNU Fortran provides the Fortran 2003
!      Stream facility.  Programmers should consider the use of new
!      stream IO feature in new code for future portability. See also
!      *note Fortran 2003 status::.
  
  _Standard_:
       GNU extension
--- 9941,9951 ----
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the 'FGET' intrinsic is provided for backwards
!      compatibility with 'g77'.  GNU Fortran provides the Fortran 2003
!      Stream facility.  Programmers should consider the use of new stream
!      IO feature in new code for future portability.  See also *note
!      Fortran 2003 status::.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 10042,10057 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL FGETC(UNIT, C [, STATUS])'
!      `STATUS = FGETC(UNIT, C)'
  
  _Arguments_:
!      UNIT       The type shall be `INTEGER'.
!      C          The type shall be `CHARACTER' and of default
!                 kind.
!      STATUS     (Optional) status flag of type `INTEGER'.
!                 Returns 0 on success, -1 on end-of-file and a
!                 system specific positive error code otherwise.
  
  _Example_:
            PROGRAM test_fgetc
--- 9954,9969 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL FGETC(UNIT, C [, STATUS])'
!      'STATUS = FGETC(UNIT, C)'
  
  _Arguments_:
!      UNIT        The type shall be 'INTEGER'.
!      C           The type shall be 'CHARACTER' and of default
!                  kind.
!      STATUS      (Optional) status flag of type 'INTEGER'.
!                  Returns 0 on success, -1 on end-of-file and a
!                  system specific positive error code otherwise.
  
  _Example_:
            PROGRAM test_fgetc
*************** _See also_:
*** 10073,10083 ****
  
  File: gfortran.info,  Node: FLOOR,  Next: FLUSH,  Prev: FGETC,  Up: Intrinsic Procedures
  
! 9.100 `FLOOR' -- Integer floor function
  =======================================
  
  _Description_:
!      `FLOOR(A)' returns the greatest integer less than or equal to X.
  
  _Standard_:
       Fortran 95 and later
--- 9985,9995 ----
  
  File: gfortran.info,  Node: FLOOR,  Next: FLUSH,  Prev: FGETC,  Up: Intrinsic Procedures
  
! 9.100 'FLOOR' -- Integer floor function
  =======================================
  
  _Description_:
!      'FLOOR(A)' returns the greatest integer less than or equal to X.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 10086,10102 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = FLOOR(A [, KIND])'
  
  _Arguments_:
!      A          The type shall be `REAL'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER(KIND)' if KIND is present and
!      of default-kind `INTEGER' otherwise.
  
  _Example_:
            program test_floor
--- 9998,10014 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = FLOOR(A [, KIND])'
  
  _Arguments_:
!      A           The type shall be 'REAL'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER(KIND)' if KIND is present and
!      of default-kind 'INTEGER' otherwise.
  
  _Example_:
            program test_floor
*************** _Example_:
*** 10109,10123 ****
  _See also_:
       *note CEILING::, *note NINT::
  
- 
  
  File: gfortran.info,  Node: FLUSH,  Next: FNUM,  Prev: FLOOR,  Up: Intrinsic Procedures
  
! 9.101 `FLUSH' -- Flush I/O unit(s)
  ==================================
  
  _Description_:
!      Flushes Fortran unit(s) currently open for output. Without the
       optional argument, all units are flushed, otherwise just the unit
       specified.
  
--- 10021,10034 ----
  _See also_:
       *note CEILING::, *note NINT::
  
  
  File: gfortran.info,  Node: FLUSH,  Next: FNUM,  Prev: FLOOR,  Up: Intrinsic Procedures
  
! 9.101 'FLUSH' -- Flush I/O unit(s)
  ==================================
  
  _Description_:
!      Flushes Fortran unit(s) currently open for output.  Without the
       optional argument, all units are flushed, otherwise just the unit
       specified.
  
*************** _Class_:
*** 10128,10151 ****
       Subroutine
  
  _Syntax_:
!      `CALL FLUSH(UNIT)'
  
  _Arguments_:
!      UNIT       (Optional) The type shall be `INTEGER'.
  
  _Note_:
!      Beginning with the Fortran 2003 standard, there is a `FLUSH'
!      statement that should be preferred over the `FLUSH' intrinsic.
  
!      The `FLUSH' intrinsic and the Fortran 2003 `FLUSH' statement have
       identical effect: they flush the runtime library's I/O buffer so
!      that the data becomes visible to other processes. This does not
       guarantee that the data is committed to disk.
  
!      On POSIX systems, you can request that all data is transferred  to
!      the storage device by calling the `fsync' function, with the POSIX
       file descriptor of the I/O unit as argument (retrieved with GNU
!      intrinsic `FNUM'). The following example shows how:
  
              ! Declare the interface for POSIX fsync function
              interface
--- 10039,10062 ----
       Subroutine
  
  _Syntax_:
!      'CALL FLUSH(UNIT)'
  
  _Arguments_:
!      UNIT        (Optional) The type shall be 'INTEGER'.
  
  _Note_:
!      Beginning with the Fortran 2003 standard, there is a 'FLUSH'
!      statement that should be preferred over the 'FLUSH' intrinsic.
  
!      The 'FLUSH' intrinsic and the Fortran 2003 'FLUSH' statement have
       identical effect: they flush the runtime library's I/O buffer so
!      that the data becomes visible to other processes.  This does not
       guarantee that the data is committed to disk.
  
!      On POSIX systems, you can request that all data is transferred to
!      the storage device by calling the 'fsync' function, with the POSIX
       file descriptor of the I/O unit as argument (retrieved with GNU
!      intrinsic 'FNUM').  The following example shows how:
  
              ! Declare the interface for POSIX fsync function
              interface
*************** _Note_:
*** 10173,10188 ****
              ! Handle possible error
              if (ret /= 0) stop "Error calling FSYNC"
  
- 
  
  File: gfortran.info,  Node: FNUM,  Next: FPUT,  Prev: FLUSH,  Up: Intrinsic Procedures
  
! 9.102 `FNUM' -- File number function
  ====================================
  
  _Description_:
!      `FNUM(UNIT)' returns the POSIX file descriptor number
!      corresponding to the open Fortran I/O unit `UNIT'.
  
  _Standard_:
       GNU extension
--- 10084,10098 ----
              ! Handle possible error
              if (ret /= 0) stop "Error calling FSYNC"
  
  
  File: gfortran.info,  Node: FNUM,  Next: FPUT,  Prev: FLUSH,  Up: Intrinsic Procedures
  
! 9.102 'FNUM' -- File number function
  ====================================
  
  _Description_:
!      'FNUM(UNIT)' returns the POSIX file descriptor number corresponding
!      to the open Fortran I/O unit 'UNIT'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 10191,10203 ****
       Function
  
  _Syntax_:
!      `RESULT = FNUM(UNIT)'
  
  _Arguments_:
!      UNIT       The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER'
  
  _Example_:
            program test_fnum
--- 10101,10113 ----
       Function
  
  _Syntax_:
!      'RESULT = FNUM(UNIT)'
  
  _Arguments_:
!      UNIT        The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER'
  
  _Example_:
            program test_fnum
*************** _Example_:
*** 10211,10233 ****
  
  File: gfortran.info,  Node: FPUT,  Next: FPUTC,  Prev: FNUM,  Up: Intrinsic Procedures
  
! 9.103 `FPUT' -- Write a single character in stream mode to stdout
  =================================================================
  
  _Description_:
       Write a single character in stream mode to stdout by bypassing
!      normal formatted output. Stream I/O should not be mixed with
       normal record-oriented (formatted or unformatted) I/O on the same
       unit; the results are unpredictable.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the `FGET' intrinsic is provided for backwards
!      compatibility with `g77'.  GNU Fortran provides the Fortran 2003
!      Stream facility.  Programmers should consider the use of new
!      stream IO feature in new code for future portability. See also
!      *note Fortran 2003 status::.
  
  _Standard_:
       GNU extension
--- 10121,10143 ----
  
  File: gfortran.info,  Node: FPUT,  Next: FPUTC,  Prev: FNUM,  Up: Intrinsic Procedures
  
! 9.103 'FPUT' -- Write a single character in stream mode to stdout
  =================================================================
  
  _Description_:
       Write a single character in stream mode to stdout by bypassing
!      normal formatted output.  Stream I/O should not be mixed with
       normal record-oriented (formatted or unformatted) I/O on the same
       unit; the results are unpredictable.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the 'FGET' intrinsic is provided for backwards
!      compatibility with 'g77'.  GNU Fortran provides the Fortran 2003
!      Stream facility.  Programmers should consider the use of new stream
!      IO feature in new code for future portability.  See also *note
!      Fortran 2003 status::.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 10236,10250 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL FPUT(C [, STATUS])'
!      `STATUS = FPUT(C)'
  
  _Arguments_:
!      C          The type shall be `CHARACTER' and of default
!                 kind.
!      STATUS     (Optional) status flag of type `INTEGER'.
!                 Returns 0 on success, -1 on end-of-file and a
!                 system specific positive error code otherwise.
  
  _Example_:
            PROGRAM test_fput
--- 10146,10160 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL FPUT(C [, STATUS])'
!      'STATUS = FPUT(C)'
  
  _Arguments_:
!      C           The type shall be 'CHARACTER' and of default
!                  kind.
!      STATUS      (Optional) status flag of type 'INTEGER'.
!                  Returns 0 on success, -1 on end-of-file and a
!                  system specific positive error code otherwise.
  
  _Example_:
            PROGRAM test_fput
*************** _See also_:
*** 10261,10283 ****
  
  File: gfortran.info,  Node: FPUTC,  Next: FRACTION,  Prev: FPUT,  Up: Intrinsic Procedures
  
! 9.104 `FPUTC' -- Write a single character in stream mode
  ========================================================
  
  _Description_:
       Write a single character in stream mode by bypassing normal
!      formatted output. Stream I/O should not be mixed with normal
       record-oriented (formatted or unformatted) I/O on the same unit;
       the results are unpredictable.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the `FGET' intrinsic is provided for backwards
!      compatibility with `g77'.  GNU Fortran provides the Fortran 2003
!      Stream facility.  Programmers should consider the use of new
!      stream IO feature in new code for future portability. See also
!      *note Fortran 2003 status::.
  
  _Standard_:
       GNU extension
--- 10171,10193 ----
  
  File: gfortran.info,  Node: FPUTC,  Next: FRACTION,  Prev: FPUT,  Up: Intrinsic Procedures
  
! 9.104 'FPUTC' -- Write a single character in stream mode
  ========================================================
  
  _Description_:
       Write a single character in stream mode by bypassing normal
!      formatted output.  Stream I/O should not be mixed with normal
       record-oriented (formatted or unformatted) I/O on the same unit;
       the results are unpredictable.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the 'FGET' intrinsic is provided for backwards
!      compatibility with 'g77'.  GNU Fortran provides the Fortran 2003
!      Stream facility.  Programmers should consider the use of new stream
!      IO feature in new code for future portability.  See also *note
!      Fortran 2003 status::.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 10286,10301 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL FPUTC(UNIT, C [, STATUS])'
!      `STATUS = FPUTC(UNIT, C)'
  
  _Arguments_:
!      UNIT       The type shall be `INTEGER'.
!      C          The type shall be `CHARACTER' and of default
!                 kind.
!      STATUS     (Optional) status flag of type `INTEGER'.
!                 Returns 0 on success, -1 on end-of-file and a
!                 system specific positive error code otherwise.
  
  _Example_:
            PROGRAM test_fputc
--- 10196,10211 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL FPUTC(UNIT, C [, STATUS])'
!      'STATUS = FPUTC(UNIT, C)'
  
  _Arguments_:
!      UNIT        The type shall be 'INTEGER'.
!      C           The type shall be 'CHARACTER' and of default
!                  kind.
!      STATUS      (Optional) status flag of type 'INTEGER'.
!                  Returns 0 on success, -1 on end-of-file and a
!                  system specific positive error code otherwise.
  
  _Example_:
            PROGRAM test_fputc
*************** _See also_:
*** 10315,10326 ****
  
  File: gfortran.info,  Node: FRACTION,  Next: FREE,  Prev: FPUTC,  Up: Intrinsic Procedures
  
! 9.105 `FRACTION' -- Fractional part of the model representation
  ===============================================================
  
  _Description_:
!      `FRACTION(X)' returns the fractional part of the model
!      representation of `X'.
  
  _Standard_:
       Fortran 95 and later
--- 10225,10236 ----
  
  File: gfortran.info,  Node: FRACTION,  Next: FREE,  Prev: FPUTC,  Up: Intrinsic Procedures
  
! 9.105 'FRACTION' -- Fractional part of the model representation
  ===============================================================
  
  _Description_:
!      'FRACTION(X)' returns the fractional part of the model
!      representation of 'X'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 10329,10343 ****
       Elemental function
  
  _Syntax_:
!      `Y = FRACTION(X)'
  
  _Arguments_:
!      X          The type of the argument shall be a `REAL'.
  
  _Return value_:
!      The return value is of the same type and kind as the argument.
!      The fractional part of the model representation of `X' is returned;
!      it is `X * RADIX(X)**(-EXPONENT(X))'.
  
  _Example_:
            program test_fraction
--- 10239,10253 ----
       Elemental function
  
  _Syntax_:
!      'Y = FRACTION(X)'
  
  _Arguments_:
!      X           The type of the argument shall be a 'REAL'.
  
  _Return value_:
!      The return value is of the same type and kind as the argument.  The
!      fractional part of the model representation of 'X' is returned; it
!      is 'X * RADIX(X)**(-EXPONENT(X))'.
  
  _Example_:
            program test_fraction
*************** _Example_:
*** 10346,10364 ****
              print *, fraction(x), x * radix(x)**(-exponent(x))
            end program test_fraction
  
- 
  
  File: gfortran.info,  Node: FREE,  Next: FSEEK,  Prev: FRACTION,  Up: Intrinsic Procedures
  
! 9.106 `FREE' -- Frees memory
  ============================
  
  _Description_:
!      Frees memory previously allocated by `MALLOC'. The `FREE'
       intrinsic is an extension intended to be used with Cray pointers,
       and is provided in GNU Fortran to allow user to compile legacy
!      code. For new code using Fortran 95 pointers, the memory
!      de-allocation intrinsic is `DEALLOCATE'.
  
  _Standard_:
       GNU extension
--- 10256,10273 ----
              print *, fraction(x), x * radix(x)**(-exponent(x))
            end program test_fraction
  
  
  File: gfortran.info,  Node: FREE,  Next: FSEEK,  Prev: FRACTION,  Up: Intrinsic Procedures
  
! 9.106 'FREE' -- Frees memory
  ============================
  
  _Description_:
!      Frees memory previously allocated by 'MALLOC'.  The 'FREE'
       intrinsic is an extension intended to be used with Cray pointers,
       and is provided in GNU Fortran to allow user to compile legacy
!      code.  For new code using Fortran 95 pointers, the memory
!      de-allocation intrinsic is 'DEALLOCATE'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 10367,10384 ****
       Subroutine
  
  _Syntax_:
!      `CALL FREE(PTR)'
  
  _Arguments_:
!      PTR        The type shall be `INTEGER'. It represents the
!                 location of the memory that should be
!                 de-allocated.
  
  _Return value_:
       None
  
  _Example_:
!      See `MALLOC' for an example.
  
  _See also_:
       *note MALLOC::
--- 10276,10293 ----
       Subroutine
  
  _Syntax_:
!      'CALL FREE(PTR)'
  
  _Arguments_:
!      PTR         The type shall be 'INTEGER'.  It represents the
!                  location of the memory that should be
!                  de-allocated.
  
  _Return value_:
       None
  
  _Example_:
!      See 'MALLOC' for an example.
  
  _See also_:
       *note MALLOC::
*************** _See also_:
*** 10386,10405 ****
  
  File: gfortran.info,  Node: FSEEK,  Next: FSTAT,  Prev: FREE,  Up: Intrinsic Procedures
  
! 9.107 `FSEEK' -- Low level file positioning subroutine
  ======================================================
  
  _Description_:
!      Moves UNIT to the specified OFFSET. If WHENCE is set to 0, the
!      OFFSET is taken as an absolute value `SEEK_SET', if set to 1,
!      OFFSET is taken to be relative to the current position `SEEK_CUR',
!      and if set to 2 relative to the end of the file `SEEK_END'.  On
!      error, STATUS is set to a nonzero value. If STATUS the seek fails
       silently.
  
       This intrinsic routine is not fully backwards compatible with
!      `g77'.  In `g77', the `FSEEK' takes a statement label instead of a
!      STATUS variable. If FSEEK is used in old code, change
              CALL FSEEK(UNIT, OFFSET, WHENCE, *label)
       to
              INTEGER :: status
--- 10295,10314 ----
  
  File: gfortran.info,  Node: FSEEK,  Next: FSTAT,  Prev: FREE,  Up: Intrinsic Procedures
  
! 9.107 'FSEEK' -- Low level file positioning subroutine
  ======================================================
  
  _Description_:
!      Moves UNIT to the specified OFFSET.  If WHENCE is set to 0, the
!      OFFSET is taken as an absolute value 'SEEK_SET', if set to 1,
!      OFFSET is taken to be relative to the current position 'SEEK_CUR',
!      and if set to 2 relative to the end of the file 'SEEK_END'.  On
!      error, STATUS is set to a nonzero value.  If STATUS the seek fails
       silently.
  
       This intrinsic routine is not fully backwards compatible with
!      'g77'.  In 'g77', the 'FSEEK' takes a statement label instead of a
!      STATUS variable.  If FSEEK is used in old code, change
              CALL FSEEK(UNIT, OFFSET, WHENCE, *label)
       to
              INTEGER :: status
*************** _Description_:
*** 10408,10414 ****
  
       Please note that GNU Fortran provides the Fortran 2003 Stream
       facility.  Programmers should consider the use of new stream IO
!      feature in new code for future portability. See also *note Fortran
       2003 status::.
  
  _Standard_:
--- 10317,10323 ----
  
       Please note that GNU Fortran provides the Fortran 2003 Stream
       facility.  Programmers should consider the use of new stream IO
!      feature in new code for future portability.  See also *note Fortran
       2003 status::.
  
  _Standard_:
*************** _Class_:
*** 10418,10432 ****
       Subroutine
  
  _Syntax_:
!      `CALL FSEEK(UNIT, OFFSET, WHENCE[, STATUS])'
  
  _Arguments_:
!      UNIT       Shall be a scalar of type `INTEGER'.
!      OFFSET     Shall be a scalar of type `INTEGER'.
!      WHENCE     Shall be a scalar of type `INTEGER'.  Its
!                 value shall be either 0, 1 or 2.
!      STATUS     (Optional) shall be a scalar of type
!                 `INTEGER(4)'.
  
  _Example_:
            PROGRAM test_fseek
--- 10327,10341 ----
       Subroutine
  
  _Syntax_:
!      'CALL FSEEK(UNIT, OFFSET, WHENCE[, STATUS])'
  
  _Arguments_:
!      UNIT        Shall be a scalar of type 'INTEGER'.
!      OFFSET      Shall be a scalar of type 'INTEGER'.
!      WHENCE      Shall be a scalar of type 'INTEGER'.  Its value
!                  shall be either 0, 1 or 2.
!      STATUS      (Optional) shall be a scalar of type
!                  'INTEGER(4)'.
  
  _Example_:
            PROGRAM test_fseek
*************** _See also_:
*** 10456,10469 ****
  
  File: gfortran.info,  Node: FSTAT,  Next: FTELL,  Prev: FSEEK,  Up: Intrinsic Procedures
  
! 9.108 `FSTAT' -- Get file status
  ================================
  
  _Description_:
!      `FSTAT' is identical to *note STAT::, except that information
!      about an already opened file is obtained.
  
!      The elements in `VALUES' are the same as described by *note STAT::.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 10365,10378 ----
  
  File: gfortran.info,  Node: FSTAT,  Next: FTELL,  Prev: FSEEK,  Up: Intrinsic Procedures
  
! 9.108 'FSTAT' -- Get file status
  ================================
  
  _Description_:
!      'FSTAT' is identical to *note STAT::, except that information about
!      an already opened file is obtained.
  
!      The elements in 'VALUES' are the same as described by *note STAT::.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 10475,10489 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL FSTAT(UNIT, VALUES [, STATUS])'
!      `STATUS = FSTAT(UNIT, VALUES)'
  
  _Arguments_:
!      UNIT       An open I/O unit number of type `INTEGER'.
!      VALUES     The type shall be `INTEGER(4), DIMENSION(13)'.
!      STATUS     (Optional) status flag of type `INTEGER(4)'.
!                 Returns 0 on success and a system specific
!                 error code otherwise.
  
  _Example_:
       See *note STAT:: for an example.
--- 10384,10398 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL FSTAT(UNIT, VALUES [, STATUS])'
!      'STATUS = FSTAT(UNIT, VALUES)'
  
  _Arguments_:
!      UNIT        An open I/O unit number of type 'INTEGER'.
!      VALUES      The type shall be 'INTEGER(4), DIMENSION(13)'.
!      STATUS      (Optional) status flag of type 'INTEGER(4)'.
!                  Returns 0 on success and a system specific error
!                  code otherwise.
  
  _Example_:
       See *note STAT:: for an example.
*************** _See also_:
*** 10494,10500 ****
  
  File: gfortran.info,  Node: FTELL,  Next: GAMMA,  Prev: FSTAT,  Up: Intrinsic Procedures
  
! 9.109 `FTELL' -- Current stream position
  ========================================
  
  _Description_:
--- 10403,10409 ----
  
  File: gfortran.info,  Node: FTELL,  Next: GAMMA,  Prev: FSTAT,  Up: Intrinsic Procedures
  
! 9.109 'FTELL' -- Current stream position
  ========================================
  
  _Description_:
*************** _Class_:
*** 10510,10521 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL FTELL(UNIT, OFFSET)'
!      `OFFSET = FTELL(UNIT)'
  
  _Arguments_:
!      OFFSET     Shall of type `INTEGER'.
!      UNIT       Shall of type `INTEGER'.
  
  _Return value_:
       In either syntax, OFFSET is set to the current offset of unit
--- 10419,10430 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL FTELL(UNIT, OFFSET)'
!      'OFFSET = FTELL(UNIT)'
  
  _Arguments_:
!      OFFSET      Shall of type 'INTEGER'.
!      UNIT        Shall of type 'INTEGER'.
  
  _Return value_:
       In either syntax, OFFSET is set to the current offset of unit
*************** _See also_:
*** 10535,10547 ****
  
  File: gfortran.info,  Node: GAMMA,  Next: GERROR,  Prev: FTELL,  Up: Intrinsic Procedures
  
! 9.110 `GAMMA' -- Gamma function
  ===============================
  
  _Description_:
!      `GAMMA(X)' computes Gamma (\Gamma) of X. For positive, integer
!      values of X the Gamma function simplifies to the factorial
!      function \Gamma(x)=(x-1)!.
  
  _Standard_:
       Fortran 2008 and later
--- 10444,10456 ----
  
  File: gfortran.info,  Node: GAMMA,  Next: GERROR,  Prev: FTELL,  Up: Intrinsic Procedures
  
! 9.110 'GAMMA' -- Gamma function
  ===============================
  
  _Description_:
!      'GAMMA(X)' computes Gamma (\Gamma) of X.  For positive, integer
!      values of X the Gamma function simplifies to the factorial function
!      \Gamma(x)=(x-1)!.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 10550,10563 ****
       Elemental function
  
  _Syntax_:
!      `X = GAMMA(X)'
  
  _Arguments_:
!      X          Shall be of type `REAL' and neither zero nor a
!                 negative integer.
  
  _Return value_:
!      The return value is of type `REAL' of the same kind as X.
  
  _Example_:
            program test_gamma
--- 10459,10472 ----
       Elemental function
  
  _Syntax_:
!      'X = GAMMA(X)'
  
  _Arguments_:
!      X           Shall be of type 'REAL' and neither zero nor a
!                  negative integer.
  
  _Return value_:
!      The return value is of type 'REAL' of the same kind as X.
  
  _Example_:
            program test_gamma
*************** _Example_:
*** 10566,10588 ****
            end program test_gamma
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `GAMMA(X)'    `REAL(4) X'   `REAL(4)'     GNU Extension
!      `DGAMMA(X)'   `REAL(8) X'   `REAL(8)'     GNU Extension
  
  _See also_:
       Logarithm of the Gamma function: *note LOG_GAMMA::
  
- 
  
  File: gfortran.info,  Node: GERROR,  Next: GETARG,  Prev: GAMMA,  Up: Intrinsic Procedures
  
! 9.111 `GERROR' -- Get last system error message
  ===============================================
  
  _Description_:
       Returns the system error message corresponding to the last system
!      error.  This resembles the functionality of `strerror(3)' in C.
  
  _Standard_:
       GNU extension
--- 10475,10496 ----
            end program test_gamma
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'GAMMA(X)'     'REAL(4) X'    'REAL(4)'      GNU Extension
!      'DGAMMA(X)'    'REAL(8) X'    'REAL(8)'      GNU Extension
  
  _See also_:
       Logarithm of the Gamma function: *note LOG_GAMMA::
  
  
  File: gfortran.info,  Node: GERROR,  Next: GETARG,  Prev: GAMMA,  Up: Intrinsic Procedures
  
! 9.111 'GERROR' -- Get last system error message
  ===============================================
  
  _Description_:
       Returns the system error message corresponding to the last system
!      error.  This resembles the functionality of 'strerror(3)' in C.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 10591,10600 ****
       Subroutine
  
  _Syntax_:
!      `CALL GERROR(RESULT)'
  
  _Arguments_:
!      RESULT     Shall of type `CHARACTER' and of default
  
  _Example_:
            PROGRAM test_gerror
--- 10499,10508 ----
       Subroutine
  
  _Syntax_:
!      'CALL GERROR(RESULT)'
  
  _Arguments_:
!      RESULT      Shall of type 'CHARACTER' and of default
  
  _Example_:
            PROGRAM test_gerror
*************** _See also_:
*** 10609,10615 ****
  
  File: gfortran.info,  Node: GETARG,  Next: GET_COMMAND,  Prev: GERROR,  Up: Intrinsic Procedures
  
! 9.112 `GETARG' -- Get command line arguments
  ============================================
  
  _Description_:
--- 10517,10523 ----
  
  File: gfortran.info,  Node: GETARG,  Next: GET_COMMAND,  Prev: GERROR,  Up: Intrinsic Procedures
  
! 9.112 'GETARG' -- Get command line arguments
  ============================================
  
  _Description_:
*************** _Class_:
*** 10628,10646 ****
       Subroutine
  
  _Syntax_:
!      `CALL GETARG(POS, VALUE)'
  
  _Arguments_:
!      POS        Shall be of type `INTEGER' and not wider than
!                 the default integer kind; POS \geq 0
!      VALUE      Shall be of type `CHARACTER' and of default
!                 kind.
!      VALUE      Shall be of type `CHARACTER'.
  
  _Return value_:
!      After `GETARG' returns, the VALUE argument holds the POSth command
!      line argument. If VALUE can not hold the argument, it is truncated
!      to fit the length of VALUE. If there are less than POS arguments
       specified at the command line, VALUE will be filled with blanks.
       If POS = 0, VALUE is set to the name of the program (on systems
       that support this feature).
--- 10536,10554 ----
       Subroutine
  
  _Syntax_:
!      'CALL GETARG(POS, VALUE)'
  
  _Arguments_:
!      POS         Shall be of type 'INTEGER' and not wider than
!                  the default integer kind; POS \geq 0
!      VALUE       Shall be of type 'CHARACTER' and of default
!                  kind.
!      VALUE       Shall be of type 'CHARACTER'.
  
  _Return value_:
!      After 'GETARG' returns, the VALUE argument holds the POSth command
!      line argument.  If VALUE can not hold the argument, it is truncated
!      to fit the length of VALUE.  If there are less than POS arguments
       specified at the command line, VALUE will be filled with blanks.
       If POS = 0, VALUE is set to the name of the program (on systems
       that support this feature).
*************** _See also_:
*** 10665,10671 ****
  
  File: gfortran.info,  Node: GET_COMMAND,  Next: GET_COMMAND_ARGUMENT,  Prev: GETARG,  Up: Intrinsic Procedures
  
! 9.113 `GET_COMMAND' -- Get the entire command line
  ==================================================
  
  _Description_:
--- 10573,10579 ----
  
  File: gfortran.info,  Node: GET_COMMAND,  Next: GET_COMMAND_ARGUMENT,  Prev: GETARG,  Up: Intrinsic Procedures
  
! 9.113 'GET_COMMAND' -- Get the entire command line
  ==================================================
  
  _Description_:
*************** _Class_:
*** 10679,10698 ****
       Subroutine
  
  _Syntax_:
!      `CALL GET_COMMAND([COMMAND, LENGTH, STATUS])'
  
  _Arguments_:
!      COMMAND    (Optional) shall be of type `CHARACTER' and of
!                 default kind.
!      LENGTH     (Optional) Shall be of type `INTEGER' and of
!                 default kind.
!      STATUS     (Optional) Shall be of type `INTEGER' and of
!                 default kind.
  
  _Return value_:
       If COMMAND is present, stores the entire command line that was used
!      to invoke the program in COMMAND. If LENGTH is present, it is
!      assigned the length of the command line. If STATUS is present, it
       is assigned 0 upon success of the command, -1 if COMMAND is too
       short to store the command line, or a positive value in case of an
       error.
--- 10587,10606 ----
       Subroutine
  
  _Syntax_:
!      'CALL GET_COMMAND([COMMAND, LENGTH, STATUS])'
  
  _Arguments_:
!      COMMAND     (Optional) shall be of type 'CHARACTER' and of
!                  default kind.
!      LENGTH      (Optional) Shall be of type 'INTEGER' and of
!                  default kind.
!      STATUS      (Optional) Shall be of type 'INTEGER' and of
!                  default kind.
  
  _Return value_:
       If COMMAND is present, stores the entire command line that was used
!      to invoke the program in COMMAND.  If LENGTH is present, it is
!      assigned the length of the command line.  If STATUS is present, it
       is assigned 0 upon success of the command, -1 if COMMAND is too
       short to store the command line, or a positive value in case of an
       error.
*************** _See also_:
*** 10710,10721 ****
  
  File: gfortran.info,  Node: GET_COMMAND_ARGUMENT,  Next: GETCWD,  Prev: GET_COMMAND,  Up: Intrinsic Procedures
  
! 9.114 `GET_COMMAND_ARGUMENT' -- Get command line arguments
  ==========================================================
  
  _Description_:
!      Retrieve the NUMBER-th argument that was passed on the command
!      line when the containing program was invoked.
  
  _Standard_:
       Fortran 2003 and later
--- 10618,10629 ----
  
  File: gfortran.info,  Node: GET_COMMAND_ARGUMENT,  Next: GETCWD,  Prev: GET_COMMAND,  Up: Intrinsic Procedures
  
! 9.114 'GET_COMMAND_ARGUMENT' -- Get command line arguments
  ==========================================================
  
  _Description_:
!      Retrieve the NUMBER-th argument that was passed on the command line
!      when the containing program was invoked.
  
  _Standard_:
       Fortran 2003 and later
*************** _Class_:
*** 10724,10752 ****
       Subroutine
  
  _Syntax_:
!      `CALL GET_COMMAND_ARGUMENT(NUMBER [, VALUE, LENGTH, STATUS])'
  
  _Arguments_:
!      NUMBER     Shall be a scalar of type `INTEGER' and of
!                 default kind, NUMBER \geq 0
!      VALUE      (Optional) Shall be a scalar of type
!                 `CHARACTER' and of default kind.
!      LENGTH     (Optional) Shall be a scalar of type `INTEGER'
!                 and of default kind.
!      STATUS     (Optional) Shall be a scalar of type `INTEGER'
!                 and of default kind.
  
  _Return value_:
!      After `GET_COMMAND_ARGUMENT' returns, the VALUE argument holds the
!      NUMBER-th command line argument. If VALUE can not hold the
!      argument, it is truncated to fit the length of VALUE. If there are
       less than NUMBER arguments specified at the command line, VALUE
       will be filled with blanks.  If NUMBER = 0, VALUE is set to the
!      name of the program (on systems that support this feature). The
       LENGTH argument contains the length of the NUMBER-th command line
!      argument. If the argument retrieval fails, STATUS is a positive
!      number; if VALUE contains a truncated command line argument,
!      STATUS is -1; and otherwise the STATUS is zero.
  
  _Example_:
            PROGRAM test_get_command_argument
--- 10632,10660 ----
       Subroutine
  
  _Syntax_:
!      'CALL GET_COMMAND_ARGUMENT(NUMBER [, VALUE, LENGTH, STATUS])'
  
  _Arguments_:
!      NUMBER      Shall be a scalar of type 'INTEGER' and of
!                  default kind, NUMBER \geq 0
!      VALUE       (Optional) Shall be a scalar of type 'CHARACTER'
!                  and of default kind.
!      LENGTH      (Optional) Shall be a scalar of type 'INTEGER'
!                  and of default kind.
!      STATUS      (Optional) Shall be a scalar of type 'INTEGER'
!                  and of default kind.
  
  _Return value_:
!      After 'GET_COMMAND_ARGUMENT' returns, the VALUE argument holds the
!      NUMBER-th command line argument.  If VALUE can not hold the
!      argument, it is truncated to fit the length of VALUE.  If there are
       less than NUMBER arguments specified at the command line, VALUE
       will be filled with blanks.  If NUMBER = 0, VALUE is set to the
!      name of the program (on systems that support this feature).  The
       LENGTH argument contains the length of the NUMBER-th command line
!      argument.  If the argument retrieval fails, STATUS is a positive
!      number; if VALUE contains a truncated command line argument, STATUS
!      is -1; and otherwise the STATUS is zero.
  
  _Example_:
            PROGRAM test_get_command_argument
*************** _See also_:
*** 10769,10775 ****
  
  File: gfortran.info,  Node: GETCWD,  Next: GETENV,  Prev: GET_COMMAND_ARGUMENT,  Up: Intrinsic Procedures
  
! 9.115 `GETCWD' -- Get current working directory
  ===============================================
  
  _Description_:
--- 10677,10683 ----
  
  File: gfortran.info,  Node: GETCWD,  Next: GETENV,  Prev: GET_COMMAND_ARGUMENT,  Up: Intrinsic Procedures
  
! 9.115 'GETCWD' -- Get current working directory
  ===============================================
  
  _Description_:
*************** _Class_:
*** 10785,10799 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL GETCWD(C [, STATUS])'
!      `STATUS = GETCWD(C)'
  
  _Arguments_:
!      C          The type shall be `CHARACTER' and of default
!                 kind.
!      STATUS     (Optional) status flag. Returns 0 on success,
!                 a system specific and nonzero error code
!                 otherwise.
  
  _Example_:
            PROGRAM test_getcwd
--- 10693,10707 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL GETCWD(C [, STATUS])'
!      'STATUS = GETCWD(C)'
  
  _Arguments_:
!      C           The type shall be 'CHARACTER' and of default
!                  kind.
!      STATUS      (Optional) status flag.  Returns 0 on success, a
!                  system specific and nonzero error code
!                  otherwise.
  
  _Example_:
            PROGRAM test_getcwd
*************** _See also_:
*** 10808,10814 ****
  
  File: gfortran.info,  Node: GETENV,  Next: GET_ENVIRONMENT_VARIABLE,  Prev: GETCWD,  Up: Intrinsic Procedures
  
! 9.116 `GETENV' -- Get an environmental variable
  ===============================================
  
  _Description_:
--- 10716,10722 ----
  
  File: gfortran.info,  Node: GETENV,  Next: GET_ENVIRONMENT_VARIABLE,  Prev: GETCWD,  Up: Intrinsic Procedures
  
! 9.116 'GETENV' -- Get an environmental variable
  ===============================================
  
  _Description_:
*************** _Description_:
*** 10819,10827 ****
       of the *note GET_ENVIRONMENT_VARIABLE:: intrinsic defined by the
       Fortran 2003 standard.
  
!      Note that `GETENV' need not be thread-safe. It is the
       responsibility of the user to ensure that the environment is not
!      being updated concurrently with a call to the `GETENV' intrinsic.
  
  _Standard_:
       GNU extension
--- 10727,10735 ----
       of the *note GET_ENVIRONMENT_VARIABLE:: intrinsic defined by the
       Fortran 2003 standard.
  
!      Note that 'GETENV' need not be thread-safe.  It is the
       responsibility of the user to ensure that the environment is not
!      being updated concurrently with a call to the 'GETENV' intrinsic.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 10830,10846 ****
       Subroutine
  
  _Syntax_:
!      `CALL GETENV(NAME, VALUE)'
  
  _Arguments_:
!      NAME       Shall be of type `CHARACTER' and of default
!                 kind.
!      VALUE      Shall be of type `CHARACTER' and of default
!                 kind.
  
  _Return value_:
!      Stores the value of NAME in VALUE. If VALUE is not large enough to
!      hold the data, it is truncated. If NAME is not set, VALUE will be
       filled with blanks.
  
  _Example_:
--- 10738,10754 ----
       Subroutine
  
  _Syntax_:
!      'CALL GETENV(NAME, VALUE)'
  
  _Arguments_:
!      NAME        Shall be of type 'CHARACTER' and of default
!                  kind.
!      VALUE       Shall be of type 'CHARACTER' and of default
!                  kind.
  
  _Return value_:
!      Stores the value of NAME in VALUE.  If VALUE is not large enough to
!      hold the data, it is truncated.  If NAME is not set, VALUE will be
       filled with blanks.
  
  _Example_:
*************** _See also_:
*** 10856,10871 ****
  
  File: gfortran.info,  Node: GET_ENVIRONMENT_VARIABLE,  Next: GETGID,  Prev: GETENV,  Up: Intrinsic Procedures
  
! 9.117 `GET_ENVIRONMENT_VARIABLE' -- Get an environmental variable
  =================================================================
  
  _Description_:
       Get the VALUE of the environmental variable NAME.
  
!      Note that `GET_ENVIRONMENT_VARIABLE' need not be thread-safe. It
       is the responsibility of the user to ensure that the environment is
       not being updated concurrently with a call to the
!      `GET_ENVIRONMENT_VARIABLE' intrinsic.
  
  _Standard_:
       Fortran 2003 and later
--- 10764,10779 ----
  
  File: gfortran.info,  Node: GET_ENVIRONMENT_VARIABLE,  Next: GETGID,  Prev: GETENV,  Up: Intrinsic Procedures
  
! 9.117 'GET_ENVIRONMENT_VARIABLE' -- Get an environmental variable
  =================================================================
  
  _Description_:
       Get the VALUE of the environmental variable NAME.
  
!      Note that 'GET_ENVIRONMENT_VARIABLE' need not be thread-safe.  It
       is the responsibility of the user to ensure that the environment is
       not being updated concurrently with a call to the
!      'GET_ENVIRONMENT_VARIABLE' intrinsic.
  
  _Standard_:
       Fortran 2003 and later
*************** _Class_:
*** 10874,10906 ****
       Subroutine
  
  _Syntax_:
!      `CALL GET_ENVIRONMENT_VARIABLE(NAME[, VALUE, LENGTH, STATUS,
       TRIM_NAME)'
  
  _Arguments_:
!      NAME       Shall be a scalar of type `CHARACTER' and of
!                 default kind.
!      VALUE      (Optional) Shall be a scalar of type
!                 `CHARACTER' and of default kind.
!      LENGTH     (Optional) Shall be a scalar of type `INTEGER'
!                 and of default kind.
!      STATUS     (Optional) Shall be a scalar of type `INTEGER'
!                 and of default kind.
!      TRIM_NAME  (Optional) Shall be a scalar of type `LOGICAL'
!                 and of default kind.
  
  _Return value_:
!      Stores the value of NAME in VALUE. If VALUE is not large enough to
!      hold the data, it is truncated. If NAME is not set, VALUE will be
!      filled with blanks. Argument LENGTH contains the length needed for
!      storing the environment variable NAME or zero if it is not
!      present. STATUS is -1 if VALUE is present but too short for the
!      environment variable; it is 1 if the environment variable does not
!      exist and 2 if the processor does not support environment
!      variables; in all other cases STATUS is zero. If TRIM_NAME is
!      present with the value `.FALSE.', the trailing blanks in NAME are
!      significant; otherwise they are not part of the environment
!      variable name.
  
  _Example_:
            PROGRAM test_getenv
--- 10782,10813 ----
       Subroutine
  
  _Syntax_:
!      'CALL GET_ENVIRONMENT_VARIABLE(NAME[, VALUE, LENGTH, STATUS,
       TRIM_NAME)'
  
  _Arguments_:
!      NAME        Shall be a scalar of type 'CHARACTER' and of
!                  default kind.
!      VALUE       (Optional) Shall be a scalar of type 'CHARACTER'
!                  and of default kind.
!      LENGTH      (Optional) Shall be a scalar of type 'INTEGER'
!                  and of default kind.
!      STATUS      (Optional) Shall be a scalar of type 'INTEGER'
!                  and of default kind.
!      TRIM_NAME   (Optional) Shall be a scalar of type 'LOGICAL'
!                  and of default kind.
  
  _Return value_:
!      Stores the value of NAME in VALUE.  If VALUE is not large enough to
!      hold the data, it is truncated.  If NAME is not set, VALUE will be
!      filled with blanks.  Argument LENGTH contains the length needed for
!      storing the environment variable NAME or zero if it is not present.
!      STATUS is -1 if VALUE is present but too short for the environment
!      variable; it is 1 if the environment variable does not exist and 2
!      if the processor does not support environment variables; in all
!      other cases STATUS is zero.  If TRIM_NAME is present with the value
!      '.FALSE.', the trailing blanks in NAME are significant; otherwise
!      they are not part of the environment variable name.
  
  _Example_:
            PROGRAM test_getenv
*************** _Example_:
*** 10912,10918 ****
  
  File: gfortran.info,  Node: GETGID,  Next: GETLOG,  Prev: GET_ENVIRONMENT_VARIABLE,  Up: Intrinsic Procedures
  
! 9.118 `GETGID' -- Group ID function
  ===================================
  
  _Description_:
--- 10819,10825 ----
  
  File: gfortran.info,  Node: GETGID,  Next: GETLOG,  Prev: GET_ENVIRONMENT_VARIABLE,  Up: Intrinsic Procedures
  
! 9.118 'GETGID' -- Group ID function
  ===================================
  
  _Description_:
*************** _Class_:
*** 10925,10937 ****
       Function
  
  _Syntax_:
!      `RESULT = GETGID()'
  
  _Return value_:
!      The return value of `GETGID' is an `INTEGER' of the default kind.
  
  _Example_:
!      See `GETPID' for an example.
  
  _See also_:
       *note GETPID::, *note GETUID::
--- 10832,10844 ----
       Function
  
  _Syntax_:
!      'RESULT = GETGID()'
  
  _Return value_:
!      The return value of 'GETGID' is an 'INTEGER' of the default kind.
  
  _Example_:
!      See 'GETPID' for an example.
  
  _See also_:
       *note GETPID::, *note GETUID::
*************** _See also_:
*** 10939,10945 ****
  
  File: gfortran.info,  Node: GETLOG,  Next: GETPID,  Prev: GETGID,  Up: Intrinsic Procedures
  
! 9.119 `GETLOG' -- Get login name
  ================================
  
  _Description_:
--- 10846,10852 ----
  
  File: gfortran.info,  Node: GETLOG,  Next: GETPID,  Prev: GETGID,  Up: Intrinsic Procedures
  
! 9.119 'GETLOG' -- Get login name
  ================================
  
  _Description_:
*************** _Class_:
*** 10952,10967 ****
       Subroutine
  
  _Syntax_:
!      `CALL GETLOG(C)'
  
  _Arguments_:
!      C          Shall be of type `CHARACTER' and of default
!                 kind.
  
  _Return value_:
       Stores the current user name in LOGIN.  (On systems where POSIX
!      functions `geteuid' and `getpwuid' are not available, and the
!      `getlogin' function is not implemented either, this will return a
       blank string.)
  
  _Example_:
--- 10859,10874 ----
       Subroutine
  
  _Syntax_:
!      'CALL GETLOG(C)'
  
  _Arguments_:
!      C           Shall be of type 'CHARACTER' and of default
!                  kind.
  
  _Return value_:
       Stores the current user name in LOGIN.  (On systems where POSIX
!      functions 'geteuid' and 'getpwuid' are not available, and the
!      'getlogin' function is not implemented either, this will return a
       blank string.)
  
  _Example_:
*************** _See also_:
*** 10977,10983 ****
  
  File: gfortran.info,  Node: GETPID,  Next: GETUID,  Prev: GETLOG,  Up: Intrinsic Procedures
  
! 9.120 `GETPID' -- Process ID function
  =====================================
  
  _Description_:
--- 10884,10890 ----
  
  File: gfortran.info,  Node: GETPID,  Next: GETUID,  Prev: GETLOG,  Up: Intrinsic Procedures
  
! 9.120 'GETPID' -- Process ID function
  =====================================
  
  _Description_:
*************** _Class_:
*** 10990,10999 ****
       Function
  
  _Syntax_:
!      `RESULT = GETPID()'
  
  _Return value_:
!      The return value of `GETPID' is an `INTEGER' of the default kind.
  
  _Example_:
            program info
--- 10897,10906 ----
       Function
  
  _Syntax_:
!      'RESULT = GETPID()'
  
  _Return value_:
!      The return value of 'GETPID' is an 'INTEGER' of the default kind.
  
  _Example_:
            program info
*************** _See also_:
*** 11008,11014 ****
  
  File: gfortran.info,  Node: GETUID,  Next: GMTIME,  Prev: GETPID,  Up: Intrinsic Procedures
  
! 9.121 `GETUID' -- User ID function
  ==================================
  
  _Description_:
--- 10915,10921 ----
  
  File: gfortran.info,  Node: GETUID,  Next: GMTIME,  Prev: GETPID,  Up: Intrinsic Procedures
  
! 9.121 'GETUID' -- User ID function
  ==================================
  
  _Description_:
*************** _Class_:
*** 11021,11033 ****
       Function
  
  _Syntax_:
!      `RESULT = GETUID()'
  
  _Return value_:
!      The return value of `GETUID' is an `INTEGER' of the default kind.
  
  _Example_:
!      See `GETPID' for an example.
  
  _See also_:
       *note GETPID::, *note GETLOG::
--- 10928,10940 ----
       Function
  
  _Syntax_:
!      'RESULT = GETUID()'
  
  _Return value_:
!      The return value of 'GETUID' is an 'INTEGER' of the default kind.
  
  _Example_:
!      See 'GETPID' for an example.
  
  _See also_:
       *note GETPID::, *note GETLOG::
*************** _See also_:
*** 11035,11048 ****
  
  File: gfortran.info,  Node: GMTIME,  Next: HOSTNM,  Prev: GETUID,  Up: Intrinsic Procedures
  
! 9.122 `GMTIME' -- Convert time to GMT info
  ==========================================
  
  _Description_:
!      Given a system time value TIME (as provided by the `TIME8'
       intrinsic), fills VALUES with values extracted from it appropriate
       to the UTC time zone (Universal Coordinated Time, also known in
!      some countries as GMT, Greenwich Mean Time), using `gmtime(3)'.
  
  _Standard_:
       GNU extension
--- 10942,10955 ----
  
  File: gfortran.info,  Node: GMTIME,  Next: HOSTNM,  Prev: GETUID,  Up: Intrinsic Procedures
  
! 9.122 'GMTIME' -- Convert time to GMT info
  ==========================================
  
  _Description_:
!      Given a system time value TIME (as provided by the 'TIME8'
       intrinsic), fills VALUES with values extracted from it appropriate
       to the UTC time zone (Universal Coordinated Time, also known in
!      some countries as GMT, Greenwich Mean Time), using 'gmtime(3)'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 11051,11083 ****
       Subroutine
  
  _Syntax_:
!      `CALL GMTIME(TIME, VALUES)'
  
  _Arguments_:
!      TIME       An `INTEGER' scalar expression corresponding
!                 to a system time, with `INTENT(IN)'.
!      VALUES     A default `INTEGER' array with 9 elements,
!                 with `INTENT(OUT)'.
  
  _Return value_:
       The elements of VALUES are assigned as follows:
         1. Seconds after the minute, range 0-59 or 0-61 to allow for leap
            seconds
- 
         2. Minutes after the hour, range 0-59
- 
         3. Hours past midnight, range 0-23
- 
         4. Day of month, range 0-31
- 
         5. Number of months since January, range 0-12
- 
         6. Years since 1900
- 
         7. Number of days since Sunday, range 0-6
- 
         8. Days since January 1
- 
         9. Daylight savings indicator: positive if daylight savings is in
            effect, zero if not, and negative if the information is not
            available.
--- 10958,10982 ----
       Subroutine
  
  _Syntax_:
!      'CALL GMTIME(TIME, VALUES)'
  
  _Arguments_:
!      TIME        An 'INTEGER' scalar expression corresponding to
!                  a system time, with 'INTENT(IN)'.
!      VALUES      A default 'INTEGER' array with 9 elements, with
!                  'INTENT(OUT)'.
  
  _Return value_:
       The elements of VALUES are assigned as follows:
         1. Seconds after the minute, range 0-59 or 0-61 to allow for leap
            seconds
         2. Minutes after the hour, range 0-59
         3. Hours past midnight, range 0-23
         4. Day of month, range 0-31
         5. Number of months since January, range 0-12
         6. Years since 1900
         7. Number of days since Sunday, range 0-6
         8. Days since January 1
         9. Daylight savings indicator: positive if daylight savings is in
            effect, zero if not, and negative if the information is not
            available.
*************** _Return value_:
*** 11085,11095 ****
  _See also_:
       *note CTIME::, *note LTIME::, *note TIME::, *note TIME8::
  
- 
  
  File: gfortran.info,  Node: HOSTNM,  Next: HUGE,  Prev: GMTIME,  Up: Intrinsic Procedures
  
! 9.123 `HOSTNM' -- Get system host name
  ======================================
  
  _Description_:
--- 10984,10993 ----
  _See also_:
       *note CTIME::, *note LTIME::, *note TIME::, *note TIME8::
  
  
  File: gfortran.info,  Node: HOSTNM,  Next: HUGE,  Prev: GMTIME,  Up: Intrinsic Procedures
  
! 9.123 'HOSTNM' -- Get system host name
  ======================================
  
  _Description_:
*************** _Class_:
*** 11106,11134 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL HOSTNM(C [, STATUS])'
!      `STATUS = HOSTNM(NAME)'
  
  _Arguments_:
!      C          Shall of type `CHARACTER' and of default kind.
!      STATUS     (Optional) status flag of type `INTEGER'.
!                 Returns 0 on success, or a system specific
!                 error code otherwise.
  
  _Return value_:
       In either syntax, NAME is set to the current hostname if it can be
       obtained, or to a blank string otherwise.
  
- 
  
  File: gfortran.info,  Node: HUGE,  Next: HYPOT,  Prev: HOSTNM,  Up: Intrinsic Procedures
  
! 9.124 `HUGE' -- Largest number of a kind
  ========================================
  
  _Description_:
!      `HUGE(X)' returns the largest number that is not an infinity in
!      the model of the type of `X'.
  
  _Standard_:
       Fortran 95 and later
--- 11004,11031 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL HOSTNM(C [, STATUS])'
!      'STATUS = HOSTNM(NAME)'
  
  _Arguments_:
!      C           Shall of type 'CHARACTER' and of default kind.
!      STATUS      (Optional) status flag of type 'INTEGER'.
!                  Returns 0 on success, or a system specific error
!                  code otherwise.
  
  _Return value_:
       In either syntax, NAME is set to the current hostname if it can be
       obtained, or to a blank string otherwise.
  
  
  File: gfortran.info,  Node: HUGE,  Next: HYPOT,  Prev: HOSTNM,  Up: Intrinsic Procedures
  
! 9.124 'HUGE' -- Largest number of a kind
  ========================================
  
  _Description_:
!      'HUGE(X)' returns the largest number that is not an infinity in the
!      model of the type of 'X'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 11137,11146 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = HUGE(X)'
  
  _Arguments_:
!      X          Shall be of type `REAL' or `INTEGER'.
  
  _Return value_:
       The return value is of the same type and kind as X
--- 11034,11043 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = HUGE(X)'
  
  _Arguments_:
!      X           Shall be of type 'REAL' or 'INTEGER'.
  
  _Return value_:
       The return value is of the same type and kind as X
*************** _Example_:
*** 11154,11165 ****
  
  File: gfortran.info,  Node: HYPOT,  Next: IACHAR,  Prev: HUGE,  Up: Intrinsic Procedures
  
! 9.125 `HYPOT' -- Euclidean distance function
  ============================================
  
  _Description_:
!      `HYPOT(X,Y)' is the Euclidean distance function. It is equal to
!      \sqrtX^2 + Y^2, without undue underflow or overflow.
  
  _Standard_:
       Fortran 2008 and later
--- 11051,11062 ----
  
  File: gfortran.info,  Node: HYPOT,  Next: IACHAR,  Prev: HUGE,  Up: Intrinsic Procedures
  
! 9.125 'HYPOT' -- Euclidean distance function
  ============================================
  
  _Description_:
!      'HYPOT(X,Y)' is the Euclidean distance function.  It is equal to
!      \sqrt{X^2 + Y^2}, without undue underflow or overflow.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 11168,11179 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = HYPOT(X, Y)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
!      Y          The type and kind type parameter shall be the
!                 same as X.
  
  _Return value_:
       The return value has the same type and kind type parameter as X.
--- 11065,11076 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = HYPOT(X, Y)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
!      Y           The type and kind type parameter shall be the
!                  same as X.
  
  _Return value_:
       The return value has the same type and kind type parameter as X.
*************** _Example_:
*** 11187,11198 ****
  
  File: gfortran.info,  Node: IACHAR,  Next: IALL,  Prev: HYPOT,  Up: Intrinsic Procedures
  
! 9.126 `IACHAR' -- Code in ASCII collating sequence
  ==================================================
  
  _Description_:
!      `IACHAR(C)' returns the code for the ASCII character in the first
!      character position of `C'.
  
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
--- 11084,11095 ----
  
  File: gfortran.info,  Node: IACHAR,  Next: IALL,  Prev: HYPOT,  Up: Intrinsic Procedures
  
! 9.126 'IACHAR' -- Code in ASCII collating sequence
  ==================================================
  
  _Description_:
!      'IACHAR(C)' returns the code for the ASCII character in the first
!      character position of 'C'.
  
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
*************** _Class_:
*** 11201,11217 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = IACHAR(C [, KIND])'
  
  _Arguments_:
!      C          Shall be a scalar `CHARACTER', with
!                 `INTENT(IN)'
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
--- 11098,11113 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = IACHAR(C [, KIND])'
  
  _Arguments_:
!      C           Shall be a scalar 'CHARACTER', with 'INTENT(IN)'
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
*************** _Note_:
*** 11227,11242 ****
  _See also_:
       *note ACHAR::, *note CHAR::, *note ICHAR::
  
- 
  
  File: gfortran.info,  Node: IALL,  Next: IAND,  Prev: IACHAR,  Up: Intrinsic Procedures
  
! 9.127 `IALL' -- Bitwise AND of array elements
  =============================================
  
  _Description_:
       Reduces with bitwise AND the elements of ARRAY along dimension DIM
!      if the corresponding element in MASK is `TRUE'.
  
  _Standard_:
       Fortran 2008 and later
--- 11123,11137 ----
  _See also_:
       *note ACHAR::, *note CHAR::, *note ICHAR::
  
  
  File: gfortran.info,  Node: IALL,  Next: IAND,  Prev: IACHAR,  Up: Intrinsic Procedures
  
! 9.127 'IALL' -- Bitwise AND of array elements
  =============================================
  
  _Description_:
       Reduces with bitwise AND the elements of ARRAY along dimension DIM
!      if the corresponding element in MASK is 'TRUE'.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 11245,11267 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = IALL(ARRAY[, MASK])'
!      `RESULT = IALL(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `INTEGER'
!      DIM        (Optional) shall be a scalar of type `INTEGER'
!                 with a value in the range from 1 to n, where n
!                 equals the rank of ARRAY.
!      MASK       (Optional) shall be of type `LOGICAL' and
!                 either be a scalar or an array of the same
!                 shape as ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the bitwise ALL of all elements in
!      ARRAY is returned. Otherwise, an array of rank n-1, where n equals
       the rank of ARRAY, and a shape similar to that of ARRAY with
       dimension DIM dropped is returned.
  
--- 11140,11162 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = IALL(ARRAY[, MASK])'
!      'RESULT = IALL(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'INTEGER'
!      DIM         (Optional) shall be a scalar of type 'INTEGER'
!                  with a value in the range from 1 to n, where n
!                  equals the rank of ARRAY.
!      MASK        (Optional) shall be of type 'LOGICAL' and either
!                  be a scalar or an array of the same shape as
!                  ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the bitwise ALL of all elements in
!      ARRAY is returned.  Otherwise, an array of rank n-1, where n equals
       the rank of ARRAY, and a shape similar to that of ARRAY with
       dimension DIM dropped is returned.
  
*************** _See also_:
*** 11282,11292 ****
  
  File: gfortran.info,  Node: IAND,  Next: IANY,  Prev: IALL,  Up: Intrinsic Procedures
  
! 9.128 `IAND' -- Bitwise logical and
  ===================================
  
  _Description_:
!      Bitwise logical `AND'.
  
  _Standard_:
       Fortran 95 and later
--- 11177,11187 ----
  
  File: gfortran.info,  Node: IAND,  Next: IANY,  Prev: IALL,  Up: Intrinsic Procedures
  
! 9.128 'IAND' -- Bitwise logical and
  ===================================
  
  _Description_:
!      Bitwise logical 'AND'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 11295,11312 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = IAND(I, J)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      J          The type shall be `INTEGER', of the same kind
!                 as I.  (As a GNU extension, different kinds
!                 are also permitted.)
  
  _Return value_:
!      The return type is `INTEGER', of the same kind as the arguments.
!      (If the argument kinds differ, it is of the same kind as the
!      larger argument.)
  
  _Example_:
            PROGRAM test_iand
--- 11190,11207 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = IAND(I, J)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      J           The type shall be 'INTEGER', of the same kind as
!                  I.  (As a GNU extension, different kinds are
!                  also permitted.)
  
  _Return value_:
!      The return type is 'INTEGER', of the same kind as the arguments.
!      (If the argument kinds differ, it is of the same kind as the larger
!      argument.)
  
  _Example_:
            PROGRAM test_iand
*************** _See also_:
*** 11319,11334 ****
       *note IOR::, *note IEOR::, *note IBITS::, *note IBSET::, *note
       IBCLR::, *note NOT::
  
- 
  
  File: gfortran.info,  Node: IANY,  Next: IARGC,  Prev: IAND,  Up: Intrinsic Procedures
  
! 9.129 `IANY' -- Bitwise OR of array elements
  ============================================
  
  _Description_:
       Reduces with bitwise OR (inclusive or) the elements of ARRAY along
!      dimension DIM if the corresponding element in MASK is `TRUE'.
  
  _Standard_:
       Fortran 2008 and later
--- 11214,11228 ----
       *note IOR::, *note IEOR::, *note IBITS::, *note IBSET::, *note
       IBCLR::, *note NOT::
  
  
  File: gfortran.info,  Node: IANY,  Next: IARGC,  Prev: IAND,  Up: Intrinsic Procedures
  
! 9.129 'IANY' -- Bitwise OR of array elements
  ============================================
  
  _Description_:
       Reduces with bitwise OR (inclusive or) the elements of ARRAY along
!      dimension DIM if the corresponding element in MASK is 'TRUE'.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 11337,11359 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = IANY(ARRAY[, MASK])'
!      `RESULT = IANY(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `INTEGER'
!      DIM        (Optional) shall be a scalar of type `INTEGER'
!                 with a value in the range from 1 to n, where n
!                 equals the rank of ARRAY.
!      MASK       (Optional) shall be of type `LOGICAL' and
!                 either be a scalar or an array of the same
!                 shape as ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the bitwise OR of all elements in
!      ARRAY is returned. Otherwise, an array of rank n-1, where n equals
       the rank of ARRAY, and a shape similar to that of ARRAY with
       dimension DIM dropped is returned.
  
--- 11231,11253 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = IANY(ARRAY[, MASK])'
!      'RESULT = IANY(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'INTEGER'
!      DIM         (Optional) shall be a scalar of type 'INTEGER'
!                  with a value in the range from 1 to n, where n
!                  equals the rank of ARRAY.
!      MASK        (Optional) shall be of type 'LOGICAL' and either
!                  be a scalar or an array of the same shape as
!                  ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the bitwise OR of all elements in
!      ARRAY is returned.  Otherwise, an array of rank n-1, where n equals
       the rank of ARRAY, and a shape similar to that of ARRAY with
       dimension DIM dropped is returned.
  
*************** _See also_:
*** 11374,11384 ****
  
  File: gfortran.info,  Node: IARGC,  Next: IBCLR,  Prev: IANY,  Up: Intrinsic Procedures
  
! 9.130 `IARGC' -- Get the number of command line arguments
  =========================================================
  
  _Description_:
!      `IARGC' returns the number of arguments passed on the command line
       when the containing program was invoked.
  
       This intrinsic routine is provided for backwards compatibility with
--- 11268,11278 ----
  
  File: gfortran.info,  Node: IARGC,  Next: IBCLR,  Prev: IANY,  Up: Intrinsic Procedures
  
! 9.130 'IARGC' -- Get the number of command line arguments
  =========================================================
  
  _Description_:
!      'IARGC' returns the number of arguments passed on the command line
       when the containing program was invoked.
  
       This intrinsic routine is provided for backwards compatibility with
*************** _Class_:
*** 11393,11405 ****
       Function
  
  _Syntax_:
!      `RESULT = IARGC()'
  
  _Arguments_:
       None.
  
  _Return value_:
!      The number of command line arguments, type `INTEGER(4)'.
  
  _Example_:
       See *note GETARG::
--- 11287,11299 ----
       Function
  
  _Syntax_:
!      'RESULT = IARGC()'
  
  _Arguments_:
       None.
  
  _Return value_:
!      The number of command line arguments, type 'INTEGER(4)'.
  
  _Example_:
       See *note GETARG::
*************** _See also_:
*** 11413,11423 ****
  
  File: gfortran.info,  Node: IBCLR,  Next: IBITS,  Prev: IARGC,  Up: Intrinsic Procedures
  
! 9.131 `IBCLR' -- Clear bit
  ==========================
  
  _Description_:
!      `IBCLR' returns the value of I with the bit at position POS set to
       zero.
  
  _Standard_:
--- 11307,11317 ----
  
  File: gfortran.info,  Node: IBCLR,  Next: IBITS,  Prev: IARGC,  Up: Intrinsic Procedures
  
! 9.131 'IBCLR' -- Clear bit
  ==========================
  
  _Description_:
!      'IBCLR' returns the value of I with the bit at position POS set to
       zero.
  
  _Standard_:
*************** _Class_:
*** 11427,11457 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = IBCLR(I, POS)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      POS        The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
       *note IBITS::, *note IBSET::, *note IAND::, *note IOR::, *note
       IEOR::, *note MVBITS::
  
- 
  
  File: gfortran.info,  Node: IBITS,  Next: IBSET,  Prev: IBCLR,  Up: Intrinsic Procedures
  
! 9.132 `IBITS' -- Bit extraction
  ===============================
  
  _Description_:
!      `IBITS' extracts a field of length LEN from I, starting from bit
       position POS and extending left for LEN bits.  The result is
       right-justified and the remaining bits are zeroed.  The value of
!      `POS+LEN' must be less than or equal to the value `BIT_SIZE(I)'.
  
  _Standard_:
       Fortran 95 and later
--- 11321,11350 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = IBCLR(I, POS)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      POS         The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
       *note IBITS::, *note IBSET::, *note IAND::, *note IOR::, *note
       IEOR::, *note MVBITS::
  
  
  File: gfortran.info,  Node: IBITS,  Next: IBSET,  Prev: IBCLR,  Up: Intrinsic Procedures
  
! 9.132 'IBITS' -- Bit extraction
  ===============================
  
  _Description_:
!      'IBITS' extracts a field of length LEN from I, starting from bit
       position POS and extending left for LEN bits.  The result is
       right-justified and the remaining bits are zeroed.  The value of
!      'POS+LEN' must be less than or equal to the value 'BIT_SIZE(I)'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 11460,11487 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = IBITS(I, POS, LEN)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      POS        The type shall be `INTEGER'.
!      LEN        The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
!      *note BIT_SIZE::, *note IBCLR::, *note IBSET::, *note IAND::,
!      *note IOR::, *note IEOR::
  
  
  File: gfortran.info,  Node: IBSET,  Next: ICHAR,  Prev: IBITS,  Up: Intrinsic Procedures
  
! 9.133 `IBSET' -- Set bit
  ========================
  
  _Description_:
!      `IBSET' returns the value of I with the bit at position POS set to
       one.
  
  _Standard_:
--- 11353,11380 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = IBITS(I, POS, LEN)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      POS         The type shall be 'INTEGER'.
!      LEN         The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
!      *note BIT_SIZE::, *note IBCLR::, *note IBSET::, *note IAND::, *note
!      IOR::, *note IEOR::
  
  
  File: gfortran.info,  Node: IBSET,  Next: ICHAR,  Prev: IBITS,  Up: Intrinsic Procedures
  
! 9.133 'IBSET' -- Set bit
  ========================
  
  _Description_:
!      'IBSET' returns the value of I with the bit at position POS set to
       one.
  
  _Standard_:
*************** _Class_:
*** 11491,11519 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = IBSET(I, POS)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      POS        The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
       *note IBCLR::, *note IBITS::, *note IAND::, *note IOR::, *note
       IEOR::, *note MVBITS::
  
- 
  
  File: gfortran.info,  Node: ICHAR,  Next: IDATE,  Prev: IBSET,  Up: Intrinsic Procedures
  
! 9.134 `ICHAR' -- Character-to-integer conversion function
  =========================================================
  
  _Description_:
!      `ICHAR(C)' returns the code for the character in the first
!      character position of `C' in the system's native character set.
       The correspondence between characters and their codes is not
       necessarily the same across different GNU Fortran implementations.
  
--- 11384,11411 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = IBSET(I, POS)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      POS         The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
       *note IBCLR::, *note IBITS::, *note IAND::, *note IOR::, *note
       IEOR::, *note MVBITS::
  
  
  File: gfortran.info,  Node: ICHAR,  Next: IDATE,  Prev: IBSET,  Up: Intrinsic Procedures
  
! 9.134 'ICHAR' -- Character-to-integer conversion function
  =========================================================
  
  _Description_:
!      'ICHAR(C)' returns the code for the character in the first
!      character position of 'C' in the system's native character set.
       The correspondence between characters and their codes is not
       necessarily the same across different GNU Fortran implementations.
  
*************** _Class_:
*** 11524,11540 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ICHAR(C [, KIND])'
  
  _Arguments_:
!      C          Shall be a scalar `CHARACTER', with
!                 `INTENT(IN)'
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
--- 11416,11431 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ICHAR(C [, KIND])'
  
  _Arguments_:
!      C           Shall be a scalar 'CHARACTER', with 'INTENT(IN)'
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
*************** _Example_:
*** 11544,11558 ****
            end program test_ichar
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `ICHAR(C)'    `CHARACTER    `INTEGER(4)'  Fortran 77 and
!                    C'                          later
  
  _Note_:
       No intrinsic exists to convert between a numeric value and a
       formatted character string representation - for instance, given the
!      `CHARACTER' value `'154'', obtaining an `INTEGER' or `REAL' value
!      with the value 154, or vice versa. Instead, this functionality is
       provided by internal-file I/O, as in the following example:
            program read_val
              integer value
--- 11435,11449 ----
            end program test_ichar
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'ICHAR(C)'     'CHARACTER     'INTEGER(4)'   Fortran 77 and
!                     C'                            later
  
  _Note_:
       No intrinsic exists to convert between a numeric value and a
       formatted character string representation - for instance, given the
!      'CHARACTER' value ''154'', obtaining an 'INTEGER' or 'REAL' value
!      with the value 154, or vice versa.  Instead, this functionality is
       provided by internal-file I/O, as in the following example:
            program read_val
              integer value
*************** _Note_:
*** 11571,11586 ****
  _See also_:
       *note ACHAR::, *note CHAR::, *note IACHAR::
  
- 
  
  File: gfortran.info,  Node: IDATE,  Next: IEOR,  Prev: ICHAR,  Up: Intrinsic Procedures
  
! 9.135 `IDATE' -- Get current local time subroutine (day/month/year)
  ===================================================================
  
  _Description_:
!      `IDATE(VALUES)' Fills VALUES with the numerical values at the
!      current local time. The day (in the range 1-31), month (in the
       range 1-12), and year appear in elements 1, 2, and 3 of VALUES,
       respectively.  The year has four significant digits.
  
--- 11462,11476 ----
  _See also_:
       *note ACHAR::, *note CHAR::, *note IACHAR::
  
  
  File: gfortran.info,  Node: IDATE,  Next: IEOR,  Prev: ICHAR,  Up: Intrinsic Procedures
  
! 9.135 'IDATE' -- Get current local time subroutine (day/month/year)
  ===================================================================
  
  _Description_:
!      'IDATE(VALUES)' Fills VALUES with the numerical values at the
!      current local time.  The day (in the range 1-31), month (in the
       range 1-12), and year appear in elements 1, 2, and 3 of VALUES,
       respectively.  The year has four significant digits.
  
*************** _Class_:
*** 11591,11601 ****
       Subroutine
  
  _Syntax_:
!      `CALL IDATE(VALUES)'
  
  _Arguments_:
!      VALUES     The type shall be `INTEGER, DIMENSION(3)' and
!                 the kind shall be the default integer kind.
  
  _Return value_:
       Does not return anything.
--- 11481,11491 ----
       Subroutine
  
  _Syntax_:
!      'CALL IDATE(VALUES)'
  
  _Arguments_:
!      VALUES      The type shall be 'INTEGER, DIMENSION(3)' and
!                  the kind shall be the default integer kind.
  
  _Return value_:
       Does not return anything.
*************** _Example_:
*** 11612,11622 ****
  
  File: gfortran.info,  Node: IEOR,  Next: IERRNO,  Prev: IDATE,  Up: Intrinsic Procedures
  
! 9.136 `IEOR' -- Bitwise logical exclusive or
  ============================================
  
  _Description_:
!      `IEOR' returns the bitwise Boolean exclusive-OR of I and J.
  
  _Standard_:
       Fortran 95 and later
--- 11502,11512 ----
  
  File: gfortran.info,  Node: IEOR,  Next: IERRNO,  Prev: IDATE,  Up: Intrinsic Procedures
  
! 9.136 'IEOR' -- Bitwise logical exclusive or
  ============================================
  
  _Description_:
!      'IEOR' returns the bitwise Boolean exclusive-OR of I and J.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 11625,11642 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = IEOR(I, J)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      J          The type shall be `INTEGER', of the same kind
!                 as I.  (As a GNU extension, different kinds
!                 are also permitted.)
  
  _Return value_:
!      The return type is `INTEGER', of the same kind as the arguments.
!      (If the argument kinds differ, it is of the same kind as the
!      larger argument.)
  
  _See also_:
       *note IOR::, *note IAND::, *note IBITS::, *note IBSET::, *note
--- 11515,11532 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = IEOR(I, J)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      J           The type shall be 'INTEGER', of the same kind as
!                  I.  (As a GNU extension, different kinds are
!                  also permitted.)
  
  _Return value_:
!      The return type is 'INTEGER', of the same kind as the arguments.
!      (If the argument kinds differ, it is of the same kind as the larger
!      argument.)
  
  _See also_:
       *note IOR::, *note IAND::, *note IBITS::, *note IBSET::, *note
*************** _See also_:
*** 11645,11655 ****
  
  File: gfortran.info,  Node: IERRNO,  Next: IMAGE_INDEX,  Prev: IEOR,  Up: Intrinsic Procedures
  
! 9.137 `IERRNO' -- Get the last system error number
  ==================================================
  
  _Description_:
!      Returns the last system error number, as given by the C `errno'
       variable.
  
  _Standard_:
--- 11535,11545 ----
  
  File: gfortran.info,  Node: IERRNO,  Next: IMAGE_INDEX,  Prev: IEOR,  Up: Intrinsic Procedures
  
! 9.137 'IERRNO' -- Get the last system error number
  ==================================================
  
  _Description_:
!      Returns the last system error number, as given by the C 'errno'
       variable.
  
  _Standard_:
*************** _Class_:
*** 11659,11671 ****
       Function
  
  _Syntax_:
!      `RESULT = IERRNO()'
  
  _Arguments_:
       None.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the default integer
       kind.
  
  _See also_:
--- 11549,11561 ----
       Function
  
  _Syntax_:
!      'RESULT = IERRNO()'
  
  _Arguments_:
       None.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the default integer
       kind.
  
  _See also_:
*************** _See also_:
*** 11674,11680 ****
  
  File: gfortran.info,  Node: IMAGE_INDEX,  Next: INDEX intrinsic,  Prev: IERRNO,  Up: Intrinsic Procedures
  
! 9.138 `IMAGE_INDEX' -- Function that converts a cosubscript to an image index
  =============================================================================
  
  _Description_:
--- 11564,11570 ----
  
  File: gfortran.info,  Node: IMAGE_INDEX,  Next: INDEX intrinsic,  Prev: IERRNO,  Up: Intrinsic Procedures
  
! 9.138 'IMAGE_INDEX' -- Function that converts a cosubscript to an image index
  =============================================================================
  
  _Description_:
*************** _Class_:
*** 11687,11702 ****
       Inquiry function.
  
  _Syntax_:
!      `RESULT = IMAGE_INDEX(COARRAY, SUB)'
  
  _Arguments_: None.
!      COARRAY    Coarray of any type.
!      SUB        default integer rank-1 array of a size equal to
!                 the corank of COARRAY.
  
  _Return value_:
       Scalar default integer with the value of the image index which
!      corresponds to the cosubscripts. For invalid cosubscripts the
       result is zero.
  
  _Example_:
--- 11577,11592 ----
       Inquiry function.
  
  _Syntax_:
!      'RESULT = IMAGE_INDEX(COARRAY, SUB)'
  
  _Arguments_: None.
!      COARRAY     Coarray of any type.
!      SUB         default integer rank-1 array of a size equal to
!                  the corank of COARRAY.
  
  _Return value_:
       Scalar default integer with the value of the image index which
!      corresponds to the cosubscripts.  For invalid cosubscripts the
       result is zero.
  
  _Example_:
*************** _See also_:
*** 11710,11716 ****
  
  File: gfortran.info,  Node: INDEX intrinsic,  Next: INT,  Prev: IMAGE_INDEX,  Up: Intrinsic Procedures
  
! 9.139 `INDEX' -- Position of a substring within a string
  ========================================================
  
  _Description_:
--- 11600,11606 ----
  
  File: gfortran.info,  Node: INDEX intrinsic,  Next: INT,  Prev: IMAGE_INDEX,  Up: Intrinsic Procedures
  
! 9.139 'INDEX' -- Position of a substring within a string
  ========================================================
  
  _Description_:
*************** _Class_:
*** 11727,11753 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = INDEX(STRING, SUBSTRING [, BACK [, KIND]])'
  
  _Arguments_:
!      STRING     Shall be a scalar `CHARACTER', with
!                 `INTENT(IN)'
!      SUBSTRING  Shall be a scalar `CHARACTER', with
!                 `INTENT(IN)'
!      BACK       (Optional) Shall be a scalar `LOGICAL', with
!                 `INTENT(IN)'
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `INDEX(STRING,`CHARACTER'   `INTEGER(4)'  Fortran 77 and
!      SUBSTRING)'                               later
  
  _See also_:
       *note SCAN::, *note VERIFY::
--- 11617,11641 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = INDEX(STRING, SUBSTRING [, BACK [, KIND]])'
  
  _Arguments_:
!      STRING      Shall be a scalar 'CHARACTER', with 'INTENT(IN)'
!      SUBSTRING   Shall be a scalar 'CHARACTER', with 'INTENT(IN)'
!      BACK        (Optional) Shall be a scalar 'LOGICAL', with
!                  'INTENT(IN)'
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'INDEX(STRING, 'CHARACTER'    'INTEGER(4)'   Fortran 77 and
!      SUBSTRING)'                                  later
  
  _See also_:
       *note SCAN::, *note VERIFY::
*************** _See also_:
*** 11755,11761 ****
  
  File: gfortran.info,  Node: INT,  Next: INT2,  Prev: INDEX intrinsic,  Up: Intrinsic Procedures
  
! 9.140 `INT' -- Convert to integer type
  ======================================
  
  _Description_:
--- 11643,11649 ----
  
  File: gfortran.info,  Node: INT,  Next: INT2,  Prev: INDEX intrinsic,  Up: Intrinsic Procedures
  
! 9.140 'INT' -- Convert to integer type
  ======================================
  
  _Description_:
*************** _Class_:
*** 11768,11797 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = INT(A [, KIND))'
  
  _Arguments_:
!      A          Shall be of type `INTEGER', `REAL', or
!                 `COMPLEX'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      These functions return a `INTEGER' variable or array under the
       following rules:
  
!     (A)
!           If A is of type `INTEGER', `INT(A) = A'
! 
!     (B)
!           If A is of type `REAL' and |A| < 1, `INT(A)' equals `0'. If
!           |A| \geq 1, then `INT(A)' is the integer whose magnitude is
            the largest integer that does not exceed the magnitude of A
            and whose sign is the same as the sign of A.
! 
!     (C)
!           If A is of type `COMPLEX', rule B is applied to the real part
            of A.
  
  _Example_:
--- 11656,11683 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = INT(A [, KIND))'
  
  _Arguments_:
!      A           Shall be of type 'INTEGER', 'REAL', or
!                  'COMPLEX'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      These functions return a 'INTEGER' variable or array under the
       following rules:
  
!      (A)
!           If A is of type 'INTEGER', 'INT(A) = A'
!      (B)
!           If A is of type 'REAL' and |A| < 1, 'INT(A)' equals '0'.  If
!           |A| \geq 1, then 'INT(A)' is the integer whose magnitude is
            the largest integer that does not exceed the magnitude of A
            and whose sign is the same as the sign of A.
!      (C)
!           If A is of type 'COMPLEX', rule B is applied to the real part
            of A.
  
  _Example_:
*************** _Example_:
*** 11803,11829 ****
            end program
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `INT(A)'      `REAL(4) A'   `INTEGER'     Fortran 77 and
!                                                later
!      `IFIX(A)'     `REAL(4) A'   `INTEGER'     Fortran 77 and
!                                                later
!      `IDINT(A)'    `REAL(8) A'   `INTEGER'     Fortran 77 and
!                                                later
! 
  
  
  File: gfortran.info,  Node: INT2,  Next: INT8,  Prev: INT,  Up: Intrinsic Procedures
  
! 9.141 `INT2' -- Convert to 16-bit integer type
  ==============================================
  
  _Description_:
!      Convert to a `KIND=2' integer type. This is equivalent to the
!      standard `INT' intrinsic with an optional argument of `KIND=2',
!      and is only included for backwards compatibility.
  
!      The `SHORT' intrinsic is equivalent to `INT2'.
  
  _Standard_:
       GNU extension
--- 11689,11714 ----
            end program
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'INT(A)'       'REAL(4) A'    'INTEGER'      Fortran 77 and
!                                                   later
!      'IFIX(A)'      'REAL(4) A'    'INTEGER'      Fortran 77 and
!                                                   later
!      'IDINT(A)'     'REAL(8) A'    'INTEGER'      Fortran 77 and
!                                                   later
  
  
  File: gfortran.info,  Node: INT2,  Next: INT8,  Prev: INT,  Up: Intrinsic Procedures
  
! 9.141 'INT2' -- Convert to 16-bit integer type
  ==============================================
  
  _Description_:
!      Convert to a 'KIND=2' integer type.  This is equivalent to the
!      standard 'INT' intrinsic with an optional argument of 'KIND=2', and
!      is only included for backwards compatibility.
  
!      The 'SHORT' intrinsic is equivalent to 'INT2'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 11832,11845 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = INT2(A)'
  
  _Arguments_:
!      A          Shall be of type `INTEGER', `REAL', or
!                 `COMPLEX'.
  
  _Return value_:
!      The return value is a `INTEGER(2)' variable.
  
  _See also_:
       *note INT::, *note INT8::, *note LONG::
--- 11717,11730 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = INT2(A)'
  
  _Arguments_:
!      A           Shall be of type 'INTEGER', 'REAL', or
!                  'COMPLEX'.
  
  _Return value_:
!      The return value is a 'INTEGER(2)' variable.
  
  _See also_:
       *note INT::, *note INT8::, *note LONG::
*************** _See also_:
*** 11847,11859 ****
  
  File: gfortran.info,  Node: INT8,  Next: IOR,  Prev: INT2,  Up: Intrinsic Procedures
  
! 9.142 `INT8' -- Convert to 64-bit integer type
  ==============================================
  
  _Description_:
!      Convert to a `KIND=8' integer type. This is equivalent to the
!      standard `INT' intrinsic with an optional argument of `KIND=8',
!      and is only included for backwards compatibility.
  
  _Standard_:
       GNU extension
--- 11732,11744 ----
  
  File: gfortran.info,  Node: INT8,  Next: IOR,  Prev: INT2,  Up: Intrinsic Procedures
  
! 9.142 'INT8' -- Convert to 64-bit integer type
  ==============================================
  
  _Description_:
!      Convert to a 'KIND=8' integer type.  This is equivalent to the
!      standard 'INT' intrinsic with an optional argument of 'KIND=8', and
!      is only included for backwards compatibility.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 11862,11875 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = INT8(A)'
  
  _Arguments_:
!      A          Shall be of type `INTEGER', `REAL', or
!                 `COMPLEX'.
  
  _Return value_:
!      The return value is a `INTEGER(8)' variable.
  
  _See also_:
       *note INT::, *note INT2::, *note LONG::
--- 11747,11760 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = INT8(A)'
  
  _Arguments_:
!      A           Shall be of type 'INTEGER', 'REAL', or
!                  'COMPLEX'.
  
  _Return value_:
!      The return value is a 'INTEGER(8)' variable.
  
  _See also_:
       *note INT::, *note INT2::, *note LONG::
*************** _See also_:
*** 11877,11887 ****
  
  File: gfortran.info,  Node: IOR,  Next: IPARITY,  Prev: INT8,  Up: Intrinsic Procedures
  
! 9.143 `IOR' -- Bitwise logical or
  =================================
  
  _Description_:
!      `IOR' returns the bitwise Boolean inclusive-OR of I and J.
  
  _Standard_:
       Fortran 95 and later
--- 11762,11772 ----
  
  File: gfortran.info,  Node: IOR,  Next: IPARITY,  Prev: INT8,  Up: Intrinsic Procedures
  
! 9.143 'IOR' -- Bitwise logical or
  =================================
  
  _Description_:
!      'IOR' returns the bitwise Boolean inclusive-OR of I and J.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 11890,11907 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = IOR(I, J)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      J          The type shall be `INTEGER', of the same kind
!                 as I.  (As a GNU extension, different kinds
!                 are also permitted.)
  
  _Return value_:
!      The return type is `INTEGER', of the same kind as the arguments.
!      (If the argument kinds differ, it is of the same kind as the
!      larger argument.)
  
  _See also_:
       *note IEOR::, *note IAND::, *note IBITS::, *note IBSET::, *note
--- 11775,11792 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = IOR(I, J)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      J           The type shall be 'INTEGER', of the same kind as
!                  I.  (As a GNU extension, different kinds are
!                  also permitted.)
  
  _Return value_:
!      The return type is 'INTEGER', of the same kind as the arguments.
!      (If the argument kinds differ, it is of the same kind as the larger
!      argument.)
  
  _See also_:
       *note IEOR::, *note IAND::, *note IBITS::, *note IBSET::, *note
*************** _See also_:
*** 11910,11921 ****
  
  File: gfortran.info,  Node: IPARITY,  Next: IRAND,  Prev: IOR,  Up: Intrinsic Procedures
  
! 9.144 `IPARITY' -- Bitwise XOR of array elements
  ================================================
  
  _Description_:
       Reduces with bitwise XOR (exclusive or) the elements of ARRAY along
!      dimension DIM if the corresponding element in MASK is `TRUE'.
  
  _Standard_:
       Fortran 2008 and later
--- 11795,11806 ----
  
  File: gfortran.info,  Node: IPARITY,  Next: IRAND,  Prev: IOR,  Up: Intrinsic Procedures
  
! 9.144 'IPARITY' -- Bitwise XOR of array elements
  ================================================
  
  _Description_:
       Reduces with bitwise XOR (exclusive or) the elements of ARRAY along
!      dimension DIM if the corresponding element in MASK is 'TRUE'.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 11924,11946 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = IPARITY(ARRAY[, MASK])'
!      `RESULT = IPARITY(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `INTEGER'
!      DIM        (Optional) shall be a scalar of type `INTEGER'
!                 with a value in the range from 1 to n, where n
!                 equals the rank of ARRAY.
!      MASK       (Optional) shall be of type `LOGICAL' and
!                 either be a scalar or an array of the same
!                 shape as ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the bitwise XOR of all elements in
!      ARRAY is returned. Otherwise, an array of rank n-1, where n equals
       the rank of ARRAY, and a shape similar to that of ARRAY with
       dimension DIM dropped is returned.
  
--- 11809,11831 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = IPARITY(ARRAY[, MASK])'
!      'RESULT = IPARITY(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'INTEGER'
!      DIM         (Optional) shall be a scalar of type 'INTEGER'
!                  with a value in the range from 1 to n, where n
!                  equals the rank of ARRAY.
!      MASK        (Optional) shall be of type 'LOGICAL' and either
!                  be a scalar or an array of the same shape as
!                  ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the bitwise XOR of all elements in
!      ARRAY is returned.  Otherwise, an array of rank n-1, where n equals
       the rank of ARRAY, and a shape similar to that of ARRAY with
       dimension DIM dropped is returned.
  
*************** _See also_:
*** 11961,11981 ****
  
  File: gfortran.info,  Node: IRAND,  Next: IS_IOSTAT_END,  Prev: IPARITY,  Up: Intrinsic Procedures
  
! 9.145 `IRAND' -- Integer pseudo-random number
  =============================================
  
  _Description_:
!      `IRAND(FLAG)' returns a pseudo-random number from a uniform
       distribution between 0 and a system-dependent limit (which is in
!      most cases 2147483647). If FLAG is 0, the next number in the
       current sequence is returned; if FLAG is 1, the generator is
!      restarted by `CALL SRAND(0)'; if FLAG has any other value, it is
!      used as a new seed with `SRAND'.
  
       This intrinsic routine is provided for backwards compatibility with
!      GNU Fortran 77. It implements a simple modulo generator as provided
!      by `g77'. For new code, one should consider the use of *note
!      RANDOM_NUMBER:: as it implements a superior algorithm.
  
  _Standard_:
       GNU extension
--- 11846,11866 ----
  
  File: gfortran.info,  Node: IRAND,  Next: IS_IOSTAT_END,  Prev: IPARITY,  Up: Intrinsic Procedures
  
! 9.145 'IRAND' -- Integer pseudo-random number
  =============================================
  
  _Description_:
!      'IRAND(FLAG)' returns a pseudo-random number from a uniform
       distribution between 0 and a system-dependent limit (which is in
!      most cases 2147483647).  If FLAG is 0, the next number in the
       current sequence is returned; if FLAG is 1, the generator is
!      restarted by 'CALL SRAND(0)'; if FLAG has any other value, it is
!      used as a new seed with 'SRAND'.
  
       This intrinsic routine is provided for backwards compatibility with
!      GNU Fortran 77.  It implements a simple modulo generator as
!      provided by 'g77'.  For new code, one should consider the use of
!      *note RANDOM_NUMBER:: as it implements a superior algorithm.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 11984,11996 ****
       Function
  
  _Syntax_:
!      `RESULT = IRAND(I)'
  
  _Arguments_:
!      I          Shall be a scalar `INTEGER' of kind 4.
  
  _Return value_:
!      The return value is of `INTEGER(kind=4)' type.
  
  _Example_:
            program test_irand
--- 11869,11881 ----
       Function
  
  _Syntax_:
!      'RESULT = IRAND(I)'
  
  _Arguments_:
!      I           Shall be a scalar 'INTEGER' of kind 4.
  
  _Return value_:
!      The return value is of 'INTEGER(kind=4)' type.
  
  _Example_:
            program test_irand
*************** _Example_:
*** 12001,12018 ****
              print *, irand(seed), irand(), irand(), irand()
            end program test_irand
  
- 
  
  File: gfortran.info,  Node: IS_IOSTAT_END,  Next: IS_IOSTAT_EOR,  Prev: IRAND,  Up: Intrinsic Procedures
  
! 9.146 `IS_IOSTAT_END' -- Test for end-of-file value
  ===================================================
  
  _Description_:
!      `IS_IOSTAT_END' tests whether an variable has the value of the I/O
!      status "end of file". The function is equivalent to comparing the
!      variable with the `IOSTAT_END' parameter of the intrinsic module
!      `ISO_FORTRAN_ENV'.
  
  _Standard_:
       Fortran 2003 and later
--- 11886,11902 ----
              print *, irand(seed), irand(), irand(), irand()
            end program test_irand
  
  
  File: gfortran.info,  Node: IS_IOSTAT_END,  Next: IS_IOSTAT_EOR,  Prev: IRAND,  Up: Intrinsic Procedures
  
! 9.146 'IS_IOSTAT_END' -- Test for end-of-file value
  ===================================================
  
  _Description_:
!      'IS_IOSTAT_END' tests whether an variable has the value of the I/O
!      status "end of file".  The function is equivalent to comparing the
!      variable with the 'IOSTAT_END' parameter of the intrinsic module
!      'ISO_FORTRAN_ENV'.
  
  _Standard_:
       Fortran 2003 and later
*************** _Class_:
*** 12021,12035 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = IS_IOSTAT_END(I)'
  
  _Arguments_:
!      I          Shall be of the type `INTEGER'.
  
  _Return value_:
!      Returns a `LOGICAL' of the default kind, which `.TRUE.' if I has
!      the value which indicates an end of file condition for `IOSTAT='
!      specifiers, and is `.FALSE.' otherwise.
  
  _Example_:
            PROGRAM iostat
--- 11905,11919 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = IS_IOSTAT_END(I)'
  
  _Arguments_:
!      I           Shall be of the type 'INTEGER'.
  
  _Return value_:
!      Returns a 'LOGICAL' of the default kind, which '.TRUE.' if I has
!      the value which indicates an end of file condition for 'IOSTAT='
!      specifiers, and is '.FALSE.' otherwise.
  
  _Example_:
            PROGRAM iostat
*************** _Example_:
*** 12043,12056 ****
  
  File: gfortran.info,  Node: IS_IOSTAT_EOR,  Next: ISATTY,  Prev: IS_IOSTAT_END,  Up: Intrinsic Procedures
  
! 9.147 `IS_IOSTAT_EOR' -- Test for end-of-record value
  =====================================================
  
  _Description_:
!      `IS_IOSTAT_EOR' tests whether an variable has the value of the I/O
!      status "end of record". The function is equivalent to comparing the
!      variable with the `IOSTAT_EOR' parameter of the intrinsic module
!      `ISO_FORTRAN_ENV'.
  
  _Standard_:
       Fortran 2003 and later
--- 11927,11940 ----
  
  File: gfortran.info,  Node: IS_IOSTAT_EOR,  Next: ISATTY,  Prev: IS_IOSTAT_END,  Up: Intrinsic Procedures
  
! 9.147 'IS_IOSTAT_EOR' -- Test for end-of-record value
  =====================================================
  
  _Description_:
!      'IS_IOSTAT_EOR' tests whether an variable has the value of the I/O
!      status "end of record".  The function is equivalent to comparing
!      the variable with the 'IOSTAT_EOR' parameter of the intrinsic
!      module 'ISO_FORTRAN_ENV'.
  
  _Standard_:
       Fortran 2003 and later
*************** _Class_:
*** 12059,12073 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = IS_IOSTAT_EOR(I)'
  
  _Arguments_:
!      I          Shall be of the type `INTEGER'.
  
  _Return value_:
!      Returns a `LOGICAL' of the default kind, which `.TRUE.' if I has
!      the value which indicates an end of file condition for `IOSTAT='
!      specifiers, and is `.FALSE.' otherwise.
  
  _Example_:
            PROGRAM iostat
--- 11943,11957 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = IS_IOSTAT_EOR(I)'
  
  _Arguments_:
!      I           Shall be of the type 'INTEGER'.
  
  _Return value_:
!      Returns a 'LOGICAL' of the default kind, which '.TRUE.' if I has
!      the value which indicates an end of file condition for 'IOSTAT='
!      specifiers, and is '.FALSE.' otherwise.
  
  _Example_:
            PROGRAM iostat
*************** _Example_:
*** 12081,12087 ****
  
  File: gfortran.info,  Node: ISATTY,  Next: ISHFT,  Prev: IS_IOSTAT_EOR,  Up: Intrinsic Procedures
  
! 9.148 `ISATTY' -- Whether a unit is a terminal device.
  ======================================================
  
  _Description_:
--- 11965,11971 ----
  
  File: gfortran.info,  Node: ISATTY,  Next: ISHFT,  Prev: IS_IOSTAT_EOR,  Up: Intrinsic Procedures
  
! 9.148 'ISATTY' -- Whether a unit is a terminal device.
  ======================================================
  
  _Description_:
*************** _Class_:
*** 12094,12107 ****
       Function
  
  _Syntax_:
!      `RESULT = ISATTY(UNIT)'
  
  _Arguments_:
!      UNIT       Shall be a scalar `INTEGER'.
  
  _Return value_:
!      Returns `.TRUE.' if the UNIT is connected to a terminal device,
!      `.FALSE.' otherwise.
  
  _Example_:
            PROGRAM test_isatty
--- 11978,11991 ----
       Function
  
  _Syntax_:
!      'RESULT = ISATTY(UNIT)'
  
  _Arguments_:
!      UNIT        Shall be a scalar 'INTEGER'.
  
  _Return value_:
!      Returns '.TRUE.' if the UNIT is connected to a terminal device,
!      '.FALSE.' otherwise.
  
  _Example_:
            PROGRAM test_isatty
*************** _Example_:
*** 12110,12131 ****
                write(*,*) isatty(unit=unit)
              END DO
            END PROGRAM
- 
  _See also_:
       *note TTYNAM::
  
  
  File: gfortran.info,  Node: ISHFT,  Next: ISHFTC,  Prev: ISATTY,  Up: Intrinsic Procedures
  
! 9.149 `ISHFT' -- Shift bits
  ===========================
  
  _Description_:
!      `ISHFT' returns a value corresponding to I with all of the bits
       shifted SHIFT places.  A value of SHIFT greater than zero
       corresponds to a left shift, a value of zero corresponds to no
!      shift, and a value less than zero corresponds to a right shift.
!      If the absolute value of SHIFT is greater than `BIT_SIZE(I)', the
       value is undefined.  Bits shifted out from the left end or right
       end are lost; zeros are shifted in from the opposite end.
  
--- 11994,12014 ----
                write(*,*) isatty(unit=unit)
              END DO
            END PROGRAM
  _See also_:
       *note TTYNAM::
  
  
  File: gfortran.info,  Node: ISHFT,  Next: ISHFTC,  Prev: ISATTY,  Up: Intrinsic Procedures
  
! 9.149 'ISHFT' -- Shift bits
  ===========================
  
  _Description_:
!      'ISHFT' returns a value corresponding to I with all of the bits
       shifted SHIFT places.  A value of SHIFT greater than zero
       corresponds to a left shift, a value of zero corresponds to no
!      shift, and a value less than zero corresponds to a right shift.  If
!      the absolute value of SHIFT is greater than 'BIT_SIZE(I)', the
       value is undefined.  Bits shifted out from the left end or right
       end are lost; zeros are shifted in from the opposite end.
  
*************** _Class_:
*** 12136,12149 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ISHFT(I, SHIFT)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      SHIFT      The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
       *note ISHFTC::
--- 12019,12032 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ISHFT(I, SHIFT)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      SHIFT       The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
       *note ISHFTC::
*************** _See also_:
*** 12151,12168 ****
  
  File: gfortran.info,  Node: ISHFTC,  Next: ISNAN,  Prev: ISHFT,  Up: Intrinsic Procedures
  
! 9.150 `ISHFTC' -- Shift bits circularly
  =======================================
  
  _Description_:
!      `ISHFTC' returns a value corresponding to I with the rightmost
!      SIZE bits shifted circularly SHIFT places; that is, bits shifted
!      out one end are shifted into the opposite end.  A value of SHIFT
!      greater than zero corresponds to a left shift, a value of zero
!      corresponds to no shift, and a value less than zero corresponds to
!      a right shift.  The absolute value of SHIFT must be less than
!      SIZE.  If the SIZE argument is omitted, it is taken to be
!      equivalent to `BIT_SIZE(I)'.
  
  _Standard_:
       Fortran 95 and later
--- 12034,12051 ----
  
  File: gfortran.info,  Node: ISHFTC,  Next: ISNAN,  Prev: ISHFT,  Up: Intrinsic Procedures
  
! 9.150 'ISHFTC' -- Shift bits circularly
  =======================================
  
  _Description_:
!      'ISHFTC' returns a value corresponding to I with the rightmost SIZE
!      bits shifted circularly SHIFT places; that is, bits shifted out one
!      end are shifted into the opposite end.  A value of SHIFT greater
!      than zero corresponds to a left shift, a value of zero corresponds
!      to no shift, and a value less than zero corresponds to a right
!      shift.  The absolute value of SHIFT must be less than SIZE.  If the
!      SIZE argument is omitted, it is taken to be equivalent to
!      'BIT_SIZE(I)'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 12171,12187 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = ISHFTC(I, SHIFT [, SIZE])'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      SHIFT      The type shall be `INTEGER'.
!      SIZE       (Optional) The type shall be `INTEGER'; the
!                 value must be greater than zero and less than
!                 or equal to `BIT_SIZE(I)'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
       *note ISHFT::
--- 12054,12070 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = ISHFTC(I, SHIFT [, SIZE])'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      SHIFT       The type shall be 'INTEGER'.
!      SIZE        (Optional) The type shall be 'INTEGER'; the
!                  value must be greater than zero and less than or
!                  equal to 'BIT_SIZE(I)'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
       *note ISHFT::
*************** _See also_:
*** 12189,12201 ****
  
  File: gfortran.info,  Node: ISNAN,  Next: ITIME,  Prev: ISHFTC,  Up: Intrinsic Procedures
  
! 9.151 `ISNAN' -- Test for a NaN
  ===============================
  
  _Description_:
!      `ISNAN' tests whether a floating-point value is an IEEE
       Not-a-Number (NaN).
- 
  _Standard_:
       GNU extension
  
--- 12072,12083 ----
  
  File: gfortran.info,  Node: ISNAN,  Next: ITIME,  Prev: ISHFTC,  Up: Intrinsic Procedures
  
! 9.151 'ISNAN' -- Test for a NaN
  ===============================
  
  _Description_:
!      'ISNAN' tests whether a floating-point value is an IEEE
       Not-a-Number (NaN).
  _Standard_:
       GNU extension
  
*************** _Class_:
*** 12203,12216 ****
       Elemental function
  
  _Syntax_:
!      `ISNAN(X)'
  
  _Arguments_:
!      X          Variable of the type `REAL'.
  
  _Return value_:
!      Returns a default-kind `LOGICAL'. The returned value is `TRUE' if
!      X is a NaN and `FALSE' otherwise.
  
  _Example_:
            program test_nan
--- 12085,12099 ----
       Elemental function
  
  _Syntax_:
!      'ISNAN(X)'
  
  _Arguments_:
!      X           Variable of the type 'REAL'.
!                  
  
  _Return value_:
!      Returns a default-kind 'LOGICAL'.  The returned value is 'TRUE' if
!      X is a NaN and 'FALSE' otherwise.
  
  _Example_:
            program test_nan
*************** _Example_:
*** 12224,12235 ****
  
  File: gfortran.info,  Node: ITIME,  Next: KILL,  Prev: ISNAN,  Up: Intrinsic Procedures
  
! 9.152 `ITIME' -- Get current local time subroutine (hour/minutes/seconds)
  =========================================================================
  
  _Description_:
!      `IDATE(VALUES)' Fills VALUES with the numerical values at the
!      current local time. The hour (in the range 1-24), minute (in the
       range 1-60), and seconds (in the range 1-60) appear in elements 1,
       2, and 3 of VALUES, respectively.
  
--- 12107,12118 ----
  
  File: gfortran.info,  Node: ITIME,  Next: KILL,  Prev: ISNAN,  Up: Intrinsic Procedures
  
! 9.152 'ITIME' -- Get current local time subroutine (hour/minutes/seconds)
  =========================================================================
  
  _Description_:
!      'IDATE(VALUES)' Fills VALUES with the numerical values at the
!      current local time.  The hour (in the range 1-24), minute (in the
       range 1-60), and seconds (in the range 1-60) appear in elements 1,
       2, and 3 of VALUES, respectively.
  
*************** _Class_:
*** 12240,12250 ****
       Subroutine
  
  _Syntax_:
!      `CALL ITIME(VALUES)'
  
  _Arguments_:
!      VALUES     The type shall be `INTEGER, DIMENSION(3)' and
!                 the kind shall be the default integer kind.
  
  _Return value_:
       Does not return anything.
--- 12123,12133 ----
       Subroutine
  
  _Syntax_:
!      'CALL ITIME(VALUES)'
  
  _Arguments_:
!      VALUES      The type shall be 'INTEGER, DIMENSION(3)' and
!                  the kind shall be the default integer kind.
  
  _Return value_:
       Does not return anything.
*************** _Example_:
*** 12261,12274 ****
  
  File: gfortran.info,  Node: KILL,  Next: KIND,  Prev: ITIME,  Up: Intrinsic Procedures
  
! 9.153 `KILL' -- Send a signal to a process
  ==========================================
  
  _Description_:
- 
  _Standard_:
       Sends the signal specified by SIGNAL to the process PID.  See
!      `kill(2)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 12144,12156 ----
  
  File: gfortran.info,  Node: KILL,  Next: KIND,  Prev: ITIME,  Up: Intrinsic Procedures
  
! 9.153 'KILL' -- Send a signal to a process
  ==========================================
  
  _Description_:
  _Standard_:
       Sends the signal specified by SIGNAL to the process PID.  See
!      'kill(2)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 12277,12291 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL KILL(C, VALUE [, STATUS])'
!      `STATUS = KILL(C, VALUE)'
  
  _Arguments_:
!      C          Shall be a scalar `INTEGER', with `INTENT(IN)'
!      VALUE      Shall be a scalar `INTEGER', with `INTENT(IN)'
!      STATUS     (Optional) status flag of type `INTEGER(4)' or
!                 `INTEGER(8)'. Returns 0 on success, or a
!                 system-specific error code otherwise.
  
  _See also_:
       *note ABORT::, *note EXIT::
--- 12159,12173 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL KILL(C, VALUE [, STATUS])'
!      'STATUS = KILL(C, VALUE)'
  
  _Arguments_:
!      C           Shall be a scalar 'INTEGER', with 'INTENT(IN)'
!      VALUE       Shall be a scalar 'INTEGER', with 'INTENT(IN)'
!      STATUS      (Optional) status flag of type 'INTEGER(4)' or
!                  'INTEGER(8)'.  Returns 0 on success, or a
!                  system-specific error code otherwise.
  
  _See also_:
       *note ABORT::, *note EXIT::
*************** _See also_:
*** 12293,12303 ****
  
  File: gfortran.info,  Node: KIND,  Next: LBOUND,  Prev: KILL,  Up: Intrinsic Procedures
  
! 9.154 `KIND' -- Kind of an entity
  =================================
  
  _Description_:
!      `KIND(X)' returns the kind value of the entity X.
  
  _Standard_:
       Fortran 95 and later
--- 12175,12185 ----
  
  File: gfortran.info,  Node: KIND,  Next: LBOUND,  Prev: KILL,  Up: Intrinsic Procedures
  
! 9.154 'KIND' -- Kind of an entity
  =================================
  
  _Description_:
!      'KIND(X)' returns the kind value of the entity X.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 12306,12319 ****
       Inquiry function
  
  _Syntax_:
!      `K = KIND(X)'
  
  _Arguments_:
!      X          Shall be of type `LOGICAL', `INTEGER', `REAL',
!                 `COMPLEX' or `CHARACTER'.
  
  _Return value_:
!      The return value is a scalar of type `INTEGER' and of the default
       integer kind.
  
  _Example_:
--- 12188,12201 ----
       Inquiry function
  
  _Syntax_:
!      'K = KIND(X)'
  
  _Arguments_:
!      X           Shall be of type 'LOGICAL', 'INTEGER', 'REAL',
!                  'COMPLEX' or 'CHARACTER'.
  
  _Return value_:
!      The return value is a scalar of type 'INTEGER' and of the default
       integer kind.
  
  _Example_:
*************** _Example_:
*** 12325,12341 ****
              print *, "The default logical kind is ", kl
            end program test_kind
  
- 
  
  File: gfortran.info,  Node: LBOUND,  Next: LCOBOUND,  Prev: KIND,  Up: Intrinsic Procedures
  
! 9.155 `LBOUND' -- Lower dimension bounds of an array
  ====================================================
  
  _Description_:
!      Returns the lower bounds of an array, or a single lower bound
!      along the DIM dimension.
! 
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
  
--- 12207,12221 ----
              print *, "The default logical kind is ", kl
            end program test_kind
  
  
  File: gfortran.info,  Node: LBOUND,  Next: LCOBOUND,  Prev: KIND,  Up: Intrinsic Procedures
  
! 9.155 'LBOUND' -- Lower dimension bounds of an array
  ====================================================
  
  _Description_:
!      Returns the lower bounds of an array, or a single lower bound along
!      the DIM dimension.
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
  
*************** _Class_:
*** 12343,12366 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = LBOUND(ARRAY [, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY      Shall be an array, of any type.
!      DIM        (Optional) Shall be a scalar `INTEGER'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.  If DIM is
       absent, the result is an array of the lower bounds of ARRAY.  If
       DIM is present, the result is a scalar corresponding to the lower
!      bound of the array along that dimension.  If ARRAY is an
!      expression rather than a whole array or array structure component,
!      or if it has a zero extent along the relevant dimension, the lower
!      bound is taken to be 1.
  
  _See also_:
       *note UBOUND::, *note LCOBOUND::
--- 12223,12246 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = LBOUND(ARRAY [, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY       Shall be an array, of any type.
!      DIM         (Optional) Shall be a scalar 'INTEGER'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.  If DIM is
       absent, the result is an array of the lower bounds of ARRAY.  If
       DIM is present, the result is a scalar corresponding to the lower
!      bound of the array along that dimension.  If ARRAY is an expression
!      rather than a whole array or array structure component, or if it
!      has a zero extent along the relevant dimension, the lower bound is
!      taken to be 1.
  
  _See also_:
       *note UBOUND::, *note LCOBOUND::
*************** _See also_:
*** 12368,12380 ****
  
  File: gfortran.info,  Node: LCOBOUND,  Next: LEADZ,  Prev: LBOUND,  Up: Intrinsic Procedures
  
! 9.156 `LCOBOUND' -- Lower codimension bounds of an array
  ========================================================
  
  _Description_:
       Returns the lower bounds of a coarray, or a single lower cobound
       along the DIM codimension.
- 
  _Standard_:
       Fortran 2008 and later
  
--- 12248,12259 ----
  
  File: gfortran.info,  Node: LCOBOUND,  Next: LEADZ,  Prev: LBOUND,  Up: Intrinsic Procedures
  
! 9.156 'LCOBOUND' -- Lower codimension bounds of an array
  ========================================================
  
  _Description_:
       Returns the lower bounds of a coarray, or a single lower cobound
       along the DIM codimension.
  _Standard_:
       Fortran 2008 and later
  
*************** _Class_:
*** 12382,12398 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = LCOBOUND(COARRAY [, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY      Shall be an coarray, of any type.
!      DIM        (Optional) Shall be a scalar `INTEGER'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.  If DIM is
       absent, the result is an array of the lower cobounds of COARRAY.
       If DIM is present, the result is a scalar corresponding to the
--- 12261,12277 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = LCOBOUND(COARRAY [, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY       Shall be an coarray, of any type.
!      DIM         (Optional) Shall be a scalar 'INTEGER'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.  If DIM is
       absent, the result is an array of the lower cobounds of COARRAY.
       If DIM is present, the result is a scalar corresponding to the
*************** _See also_:
*** 12404,12414 ****
  
  File: gfortran.info,  Node: LEADZ,  Next: LEN,  Prev: LCOBOUND,  Up: Intrinsic Procedures
  
! 9.157 `LEADZ' -- Number of leading zero bits of an integer
  ==========================================================
  
  _Description_:
!      `LEADZ' returns the number of leading zero bits of an integer.
  
  _Standard_:
       Fortran 2008 and later
--- 12283,12293 ----
  
  File: gfortran.info,  Node: LEADZ,  Next: LEN,  Prev: LCOBOUND,  Up: Intrinsic Procedures
  
! 9.157 'LEADZ' -- Number of leading zero bits of an integer
  ==========================================================
  
  _Description_:
!      'LEADZ' returns the number of leading zero bits of an integer.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 12417,12430 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LEADZ(I)'
  
  _Arguments_:
!      I          Shall be of type `INTEGER'.
  
  _Return value_:
!      The type of the return value is the default `INTEGER'.  If all the
!      bits of `I' are zero, the result value is `BIT_SIZE(I)'.
  
  _Example_:
            PROGRAM test_leadz
--- 12296,12309 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LEADZ(I)'
  
  _Arguments_:
!      I           Shall be of type 'INTEGER'.
  
  _Return value_:
!      The type of the return value is the default 'INTEGER'.  If all the
!      bits of 'I' are zero, the result value is 'BIT_SIZE(I)'.
  
  _Example_:
            PROGRAM test_leadz
*************** _See also_:
*** 12438,12444 ****
  
  File: gfortran.info,  Node: LEN,  Next: LEN_TRIM,  Prev: LEADZ,  Up: Intrinsic Procedures
  
! 9.158 `LEN' -- Length of a character entity
  ===========================================
  
  _Description_:
--- 12317,12323 ----
  
  File: gfortran.info,  Node: LEN,  Next: LEN_TRIM,  Prev: LEADZ,  Up: Intrinsic Procedures
  
! 9.158 'LEN' -- Length of a character entity
  ===========================================
  
  _Description_:
*************** _Class_:
*** 12454,12476 ****
       Inquiry function
  
  _Syntax_:
!      `L = LEN(STRING [, KIND])'
  
  _Arguments_:
!      STRING     Shall be a scalar or array of type
!                 `CHARACTER', with `INTENT(IN)'
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `LEN(STRING)' `CHARACTER'   `INTEGER'     Fortran 77 and
!                                                later
  
  _See also_:
       *note LEN_TRIM::, *note ADJUSTL::, *note ADJUSTR::
--- 12333,12355 ----
       Inquiry function
  
  _Syntax_:
!      'L = LEN(STRING [, KIND])'
  
  _Arguments_:
!      STRING      Shall be a scalar or array of type 'CHARACTER',
!                  with 'INTENT(IN)'
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'LEN(STRING)'  'CHARACTER'    'INTEGER'      Fortran 77 and
!                                                   later
  
  _See also_:
       *note LEN_TRIM::, *note ADJUSTL::, *note ADJUSTR::
*************** _See also_:
*** 12478,12484 ****
  
  File: gfortran.info,  Node: LEN_TRIM,  Next: LGE,  Prev: LEN,  Up: Intrinsic Procedures
  
! 9.159 `LEN_TRIM' -- Length of a character entity without trailing blank characters
  ==================================================================================
  
  _Description_:
--- 12357,12363 ----
  
  File: gfortran.info,  Node: LEN_TRIM,  Next: LGE,  Prev: LEN,  Up: Intrinsic Procedures
  
! 9.159 'LEN_TRIM' -- Length of a character entity without trailing blank characters
  ==================================================================================
  
  _Description_:
*************** _Class_:
*** 12492,12508 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LEN_TRIM(STRING [, KIND])'
  
  _Arguments_:
!      STRING     Shall be a scalar of type `CHARACTER', with
!                 `INTENT(IN)'
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.
  
  _See also_:
--- 12371,12387 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LEN_TRIM(STRING [, KIND])'
  
  _Arguments_:
!      STRING      Shall be a scalar of type 'CHARACTER', with
!                  'INTENT(IN)'
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.
  
  _See also_:
*************** _See also_:
*** 12511,12517 ****
  
  File: gfortran.info,  Node: LGE,  Next: LGT,  Prev: LEN_TRIM,  Up: Intrinsic Procedures
  
! 9.160 `LGE' -- Lexical greater than or equal
  ============================================
  
  _Description_:
--- 12390,12396 ----
  
  File: gfortran.info,  Node: LGE,  Next: LGT,  Prev: LEN_TRIM,  Up: Intrinsic Procedures
  
! 9.160 'LGE' -- Lexical greater than or equal
  ============================================
  
  _Description_:
*************** _Description_:
*** 12521,12531 ****
       same length, the shorter is compared as if spaces were appended to
       it to form a value that has the same length as the longer.
  
!      In general, the lexical comparison intrinsics `LGE', `LGT', `LLE',
!      and `LLT' differ from the corresponding intrinsic operators
!      `.GE.', `.GT.', `.LE.', and `.LT.', in that the latter use the
!      processor's character ordering (which is not ASCII on some
!      targets), whereas the former always use the ASCII ordering.
  
  _Standard_:
       Fortran 77 and later
--- 12400,12410 ----
       same length, the shorter is compared as if spaces were appended to
       it to form a value that has the same length as the longer.
  
!      In general, the lexical comparison intrinsics 'LGE', 'LGT', 'LLE',
!      and 'LLT' differ from the corresponding intrinsic operators '.GE.',
!      '.GT.', '.LE.', and '.LT.', in that the latter use the processor's
!      character ordering (which is not ASCII on some targets), whereas
!      the former always use the ASCII ordering.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 12534,12553 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LGE(STRING_A, STRING_B)'
  
  _Arguments_:
!      STRING_A   Shall be of default `CHARACTER' type.
!      STRING_B   Shall be of default `CHARACTER' type.
  
  _Return value_:
!      Returns `.TRUE.' if `STRING_A >= STRING_B', and `.FALSE.'
       otherwise, based on the ASCII ordering.
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `LGE(STRING_A,`CHARACTER'   `LOGICAL'     Fortran 77 and
!      STRING_B)'                                later
  
  _See also_:
       *note LGT::, *note LLE::, *note LLT::
--- 12413,12432 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LGE(STRING_A, STRING_B)'
  
  _Arguments_:
!      STRING_A    Shall be of default 'CHARACTER' type.
!      STRING_B    Shall be of default 'CHARACTER' type.
  
  _Return value_:
!      Returns '.TRUE.' if 'STRING_A >= STRING_B', and '.FALSE.'
       otherwise, based on the ASCII ordering.
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'LGE(STRING_A, 'CHARACTER'    'LOGICAL'      Fortran 77 and
!      STRING_B)'                                   later
  
  _See also_:
       *note LGT::, *note LLE::, *note LLT::
*************** _See also_:
*** 12555,12575 ****
  
  File: gfortran.info,  Node: LGT,  Next: LINK,  Prev: LGE,  Up: Intrinsic Procedures
  
! 9.161 `LGT' -- Lexical greater than
  ===================================
  
  _Description_:
       Determines whether one string is lexically greater than another
       string, where the two strings are interpreted as containing ASCII
       character codes.  If the String A and String B are not the same
!      length, the shorter is compared as if spaces were appended to it
!      to form a value that has the same length as the longer.
  
!      In general, the lexical comparison intrinsics `LGE', `LGT', `LLE',
!      and `LLT' differ from the corresponding intrinsic operators
!      `.GE.', `.GT.', `.LE.', and `.LT.', in that the latter use the
!      processor's character ordering (which is not ASCII on some
!      targets), whereas the former always use the ASCII ordering.
  
  _Standard_:
       Fortran 77 and later
--- 12434,12454 ----
  
  File: gfortran.info,  Node: LGT,  Next: LINK,  Prev: LGE,  Up: Intrinsic Procedures
  
! 9.161 'LGT' -- Lexical greater than
  ===================================
  
  _Description_:
       Determines whether one string is lexically greater than another
       string, where the two strings are interpreted as containing ASCII
       character codes.  If the String A and String B are not the same
!      length, the shorter is compared as if spaces were appended to it to
!      form a value that has the same length as the longer.
  
!      In general, the lexical comparison intrinsics 'LGE', 'LGT', 'LLE',
!      and 'LLT' differ from the corresponding intrinsic operators '.GE.',
!      '.GT.', '.LE.', and '.LT.', in that the latter use the processor's
!      character ordering (which is not ASCII on some targets), whereas
!      the former always use the ASCII ordering.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 12578,12597 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LGT(STRING_A, STRING_B)'
  
  _Arguments_:
!      STRING_A   Shall be of default `CHARACTER' type.
!      STRING_B   Shall be of default `CHARACTER' type.
  
  _Return value_:
!      Returns `.TRUE.' if `STRING_A > STRING_B', and `.FALSE.'
!      otherwise, based on the ASCII ordering.
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `LGT(STRING_A,`CHARACTER'   `LOGICAL'     Fortran 77 and
!      STRING_B)'                                later
  
  _See also_:
       *note LGE::, *note LLE::, *note LLT::
--- 12457,12476 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LGT(STRING_A, STRING_B)'
  
  _Arguments_:
!      STRING_A    Shall be of default 'CHARACTER' type.
!      STRING_B    Shall be of default 'CHARACTER' type.
  
  _Return value_:
!      Returns '.TRUE.' if 'STRING_A > STRING_B', and '.FALSE.' otherwise,
!      based on the ASCII ordering.
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'LGT(STRING_A, 'CHARACTER'    'LOGICAL'      Fortran 77 and
!      STRING_B)'                                   later
  
  _See also_:
       *note LGE::, *note LLE::, *note LLT::
*************** _See also_:
*** 12599,12613 ****
  
  File: gfortran.info,  Node: LINK,  Next: LLE,  Prev: LGT,  Up: Intrinsic Procedures
  
! 9.162 `LINK' -- Create a hard link
  ==================================
  
  _Description_:
!      Makes a (hard) link from file PATH1 to PATH2. A null character
!      (`CHAR(0)') can be used to mark the end of the names in PATH1 and
       PATH2; otherwise, trailing blanks in the file names are ignored.
       If the STATUS argument is supplied, it contains 0 on success or a
!      nonzero error code upon return; see `link(2)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 12478,12492 ----
  
  File: gfortran.info,  Node: LINK,  Next: LLE,  Prev: LGT,  Up: Intrinsic Procedures
  
! 9.162 'LINK' -- Create a hard link
  ==================================
  
  _Description_:
!      Makes a (hard) link from file PATH1 to PATH2.  A null character
!      ('CHAR(0)') can be used to mark the end of the names in PATH1 and
       PATH2; otherwise, trailing blanks in the file names are ignored.
       If the STATUS argument is supplied, it contains 0 on success or a
!      nonzero error code upon return; see 'link(2)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 12619,12631 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL LINK(PATH1, PATH2 [, STATUS])'
!      `STATUS = LINK(PATH1, PATH2)'
  
  _Arguments_:
!      PATH1      Shall be of default `CHARACTER' type.
!      PATH2      Shall be of default `CHARACTER' type.
!      STATUS     (Optional) Shall be of default `INTEGER' type.
  
  _See also_:
       *note SYMLNK::, *note UNLINK::
--- 12498,12510 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL LINK(PATH1, PATH2 [, STATUS])'
!      'STATUS = LINK(PATH1, PATH2)'
  
  _Arguments_:
!      PATH1       Shall be of default 'CHARACTER' type.
!      PATH2       Shall be of default 'CHARACTER' type.
!      STATUS      (Optional) Shall be of default 'INTEGER' type.
  
  _See also_:
       *note SYMLNK::, *note UNLINK::
*************** _See also_:
*** 12633,12654 ****
  
  File: gfortran.info,  Node: LLE,  Next: LLT,  Prev: LINK,  Up: Intrinsic Procedures
  
! 9.163 `LLE' -- Lexical less than or equal
  =========================================
  
  _Description_:
       Determines whether one string is lexically less than or equal to
!      another string, where the two strings are interpreted as
!      containing ASCII character codes.  If the String A and String B
!      are not the same length, the shorter is compared as if spaces were
!      appended to it to form a value that has the same length as the
!      longer.
  
!      In general, the lexical comparison intrinsics `LGE', `LGT', `LLE',
!      and `LLT' differ from the corresponding intrinsic operators
!      `.GE.', `.GT.', `.LE.', and `.LT.', in that the latter use the
!      processor's character ordering (which is not ASCII on some
!      targets), whereas the former always use the ASCII ordering.
  
  _Standard_:
       Fortran 77 and later
--- 12512,12532 ----
  
  File: gfortran.info,  Node: LLE,  Next: LLT,  Prev: LINK,  Up: Intrinsic Procedures
  
! 9.163 'LLE' -- Lexical less than or equal
  =========================================
  
  _Description_:
       Determines whether one string is lexically less than or equal to
!      another string, where the two strings are interpreted as containing
!      ASCII character codes.  If the String A and String B are not the
!      same length, the shorter is compared as if spaces were appended to
!      it to form a value that has the same length as the longer.
  
!      In general, the lexical comparison intrinsics 'LGE', 'LGT', 'LLE',
!      and 'LLT' differ from the corresponding intrinsic operators '.GE.',
!      '.GT.', '.LE.', and '.LT.', in that the latter use the processor's
!      character ordering (which is not ASCII on some targets), whereas
!      the former always use the ASCII ordering.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 12657,12676 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LLE(STRING_A, STRING_B)'
  
  _Arguments_:
!      STRING_A   Shall be of default `CHARACTER' type.
!      STRING_B   Shall be of default `CHARACTER' type.
  
  _Return value_:
!      Returns `.TRUE.' if `STRING_A <= STRING_B', and `.FALSE.'
       otherwise, based on the ASCII ordering.
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `LLE(STRING_A,`CHARACTER'   `LOGICAL'     Fortran 77 and
!      STRING_B)'                                later
  
  _See also_:
       *note LGE::, *note LGT::, *note LLT::
--- 12535,12554 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LLE(STRING_A, STRING_B)'
  
  _Arguments_:
!      STRING_A    Shall be of default 'CHARACTER' type.
!      STRING_B    Shall be of default 'CHARACTER' type.
  
  _Return value_:
!      Returns '.TRUE.' if 'STRING_A <= STRING_B', and '.FALSE.'
       otherwise, based on the ASCII ordering.
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'LLE(STRING_A, 'CHARACTER'    'LOGICAL'      Fortran 77 and
!      STRING_B)'                                   later
  
  _See also_:
       *note LGE::, *note LGT::, *note LLT::
*************** _See also_:
*** 12678,12698 ****
  
  File: gfortran.info,  Node: LLT,  Next: LNBLNK,  Prev: LLE,  Up: Intrinsic Procedures
  
! 9.164 `LLT' -- Lexical less than
  ================================
  
  _Description_:
       Determines whether one string is lexically less than another
       string, where the two strings are interpreted as containing ASCII
       character codes.  If the String A and String B are not the same
!      length, the shorter is compared as if spaces were appended to it
!      to form a value that has the same length as the longer.
  
!      In general, the lexical comparison intrinsics `LGE', `LGT', `LLE',
!      and `LLT' differ from the corresponding intrinsic operators
!      `.GE.', `.GT.', `.LE.', and `.LT.', in that the latter use the
!      processor's character ordering (which is not ASCII on some
!      targets), whereas the former always use the ASCII ordering.
  
  _Standard_:
       Fortran 77 and later
--- 12556,12576 ----
  
  File: gfortran.info,  Node: LLT,  Next: LNBLNK,  Prev: LLE,  Up: Intrinsic Procedures
  
! 9.164 'LLT' -- Lexical less than
  ================================
  
  _Description_:
       Determines whether one string is lexically less than another
       string, where the two strings are interpreted as containing ASCII
       character codes.  If the String A and String B are not the same
!      length, the shorter is compared as if spaces were appended to it to
!      form a value that has the same length as the longer.
  
!      In general, the lexical comparison intrinsics 'LGE', 'LGT', 'LLE',
!      and 'LLT' differ from the corresponding intrinsic operators '.GE.',
!      '.GT.', '.LE.', and '.LT.', in that the latter use the processor's
!      character ordering (which is not ASCII on some targets), whereas
!      the former always use the ASCII ordering.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 12701,12720 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LLT(STRING_A, STRING_B)'
  
  _Arguments_:
!      STRING_A   Shall be of default `CHARACTER' type.
!      STRING_B   Shall be of default `CHARACTER' type.
  
  _Return value_:
!      Returns `.TRUE.' if `STRING_A < STRING_B', and `.FALSE.'
!      otherwise, based on the ASCII ordering.
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `LLT(STRING_A,`CHARACTER'   `LOGICAL'     Fortran 77 and
!      STRING_B)'                                later
  
  _See also_:
       *note LGE::, *note LGT::, *note LLE::
--- 12579,12598 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LLT(STRING_A, STRING_B)'
  
  _Arguments_:
!      STRING_A    Shall be of default 'CHARACTER' type.
!      STRING_B    Shall be of default 'CHARACTER' type.
  
  _Return value_:
!      Returns '.TRUE.' if 'STRING_A < STRING_B', and '.FALSE.' otherwise,
!      based on the ASCII ordering.
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'LLT(STRING_A, 'CHARACTER'    'LOGICAL'      Fortran 77 and
!      STRING_B)'                                   later
  
  _See also_:
       *note LGE::, *note LGT::, *note LLE::
*************** _See also_:
*** 12722,12733 ****
  
  File: gfortran.info,  Node: LNBLNK,  Next: LOC,  Prev: LLT,  Up: Intrinsic Procedures
  
! 9.165 `LNBLNK' -- Index of the last non-blank character in a string
  ===================================================================
  
  _Description_:
       Returns the length of a character string, ignoring any trailing
!      blanks.  This is identical to the standard `LEN_TRIM' intrinsic,
       and is only included for backwards compatibility.
  
  _Standard_:
--- 12600,12611 ----
  
  File: gfortran.info,  Node: LNBLNK,  Next: LOC,  Prev: LLT,  Up: Intrinsic Procedures
  
! 9.165 'LNBLNK' -- Index of the last non-blank character in a string
  ===================================================================
  
  _Description_:
       Returns the length of a character string, ignoring any trailing
!      blanks.  This is identical to the standard 'LEN_TRIM' intrinsic,
       and is only included for backwards compatibility.
  
  _Standard_:
*************** _Class_:
*** 12737,12750 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LNBLNK(STRING)'
  
  _Arguments_:
!      STRING     Shall be a scalar of type `CHARACTER', with
!                 `INTENT(IN)'
  
  _Return value_:
!      The return value is of `INTEGER(kind=4)' type.
  
  _See also_:
       *note INDEX intrinsic::, *note LEN_TRIM::
--- 12615,12628 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LNBLNK(STRING)'
  
  _Arguments_:
!      STRING      Shall be a scalar of type 'CHARACTER', with
!                  'INTENT(IN)'
  
  _Return value_:
!      The return value is of 'INTEGER(kind=4)' type.
  
  _See also_:
       *note INDEX intrinsic::, *note LEN_TRIM::
*************** _See also_:
*** 12752,12762 ****
  
  File: gfortran.info,  Node: LOC,  Next: LOG,  Prev: LNBLNK,  Up: Intrinsic Procedures
  
! 9.166 `LOC' -- Returns the address of a variable
  ================================================
  
  _Description_:
!      `LOC(X)' returns the address of X as an integer.
  
  _Standard_:
       GNU extension
--- 12630,12640 ----
  
  File: gfortran.info,  Node: LOC,  Next: LOG,  Prev: LNBLNK,  Up: Intrinsic Procedures
  
! 9.166 'LOC' -- Returns the address of a variable
  ================================================
  
  _Description_:
!      'LOC(X)' returns the address of X as an integer.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 12765,12777 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = LOC(X)'
  
  _Arguments_:
!      X          Variable of any type.
  
  _Return value_:
!      The return value is of type `INTEGER', with a `KIND' corresponding
       to the size (in bytes) of a memory address on the target machine.
  
  _Example_:
--- 12643,12655 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = LOC(X)'
  
  _Arguments_:
!      X           Variable of any type.
  
  _Return value_:
!      The return value is of type 'INTEGER', with a 'KIND' corresponding
       to the size (in bytes) of a memory address on the target machine.
  
  _Example_:
*************** _Example_:
*** 12785,12795 ****
  
  File: gfortran.info,  Node: LOG,  Next: LOG10,  Prev: LOC,  Up: Intrinsic Procedures
  
! 9.167 `LOG' -- Natural logarithm function
  =========================================
  
  _Description_:
!      `LOG(X)' computes the natural logarithm of X, i.e. the logarithm
       to the base e.
  
  _Standard_:
--- 12663,12673 ----
  
  File: gfortran.info,  Node: LOG,  Next: LOG10,  Prev: LOC,  Up: Intrinsic Procedures
  
! 9.167 'LOG' -- Natural logarithm function
  =========================================
  
  _Description_:
!      'LOG(X)' computes the natural logarithm of X, i.e.  the logarithm
       to the base e.
  
  _Standard_:
*************** _Class_:
*** 12799,12812 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LOG(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
!      The return value is of type `REAL' or `COMPLEX'.  The kind type
!      parameter is the same as X.  If X is `COMPLEX', the imaginary part
       \omega is in the range -\pi < \omega \leq \pi.
  
  _Example_:
--- 12677,12690 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LOG(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value is of type 'REAL' or 'COMPLEX'.  The kind type
!      parameter is the same as X.  If X is 'COMPLEX', the imaginary part
       \omega is in the range -\pi < \omega \leq \pi.
  
  _Example_:
*************** _Example_:
*** 12818,12841 ****
            end program test_log
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `ALOG(X)'     `REAL(4) X'   `REAL(4)'     f95, gnu
!      `DLOG(X)'     `REAL(8) X'   `REAL(8)'     f95, gnu
!      `CLOG(X)'     `COMPLEX(4)   `COMPLEX(4)'  f95, gnu
!                    X'                          
!      `ZLOG(X)'     `COMPLEX(8)   `COMPLEX(8)'  f95, gnu
!                    X'                          
!      `CDLOG(X)'    `COMPLEX(8)   `COMPLEX(8)'  f95, gnu
!                    X'                          
  
  
  File: gfortran.info,  Node: LOG10,  Next: LOG_GAMMA,  Prev: LOG,  Up: Intrinsic Procedures
  
! 9.168 `LOG10' -- Base 10 logarithm function
  ===========================================
  
  _Description_:
!      `LOG10(X)' computes the base 10 logarithm of X.
  
  _Standard_:
       Fortran 77 and later
--- 12696,12719 ----
            end program test_log
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'ALOG(X)'      'REAL(4) X'    'REAL(4)'      f95, gnu
!      'DLOG(X)'      'REAL(8) X'    'REAL(8)'      f95, gnu
!      'CLOG(X)'      'COMPLEX(4)    'COMPLEX(4)'   f95, gnu
!                     X'
!      'ZLOG(X)'      'COMPLEX(8)    'COMPLEX(8)'   f95, gnu
!                     X'
!      'CDLOG(X)'     'COMPLEX(8)    'COMPLEX(8)'   f95, gnu
!                     X'
  
  
  File: gfortran.info,  Node: LOG10,  Next: LOG_GAMMA,  Prev: LOG,  Up: Intrinsic Procedures
  
! 9.168 'LOG10' -- Base 10 logarithm function
  ===========================================
  
  _Description_:
!      'LOG10(X)' computes the base 10 logarithm of X.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 12844,12856 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LOG10(X)'
  
  _Arguments_:
!      X          The type shall be `REAL'.
  
  _Return value_:
!      The return value is of type `REAL' or `COMPLEX'.  The kind type
       parameter is the same as X.
  
  _Example_:
--- 12722,12734 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LOG10(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL'.
  
  _Return value_:
!      The return value is of type 'REAL' or 'COMPLEX'.  The kind type
       parameter is the same as X.
  
  _Example_:
*************** _Example_:
*** 12860,12879 ****
            end program test_log10
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `ALOG10(X)'   `REAL(4) X'   `REAL(4)'     Fortran 95 and
!                                                later
!      `DLOG10(X)'   `REAL(8) X'   `REAL(8)'     Fortran 95 and
!                                                later
  
  
  File: gfortran.info,  Node: LOG_GAMMA,  Next: LOGICAL,  Prev: LOG10,  Up: Intrinsic Procedures
  
! 9.169 `LOG_GAMMA' -- Logarithm of the Gamma function
  ====================================================
  
  _Description_:
!      `LOG_GAMMA(X)' computes the natural logarithm of the absolute value
       of the Gamma (\Gamma) function.
  
  _Standard_:
--- 12738,12757 ----
            end program test_log10
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'ALOG10(X)'    'REAL(4) X'    'REAL(4)'      Fortran 95 and
!                                                   later
!      'DLOG10(X)'    'REAL(8) X'    'REAL(8)'      Fortran 95 and
!                                                   later
  
  
  File: gfortran.info,  Node: LOG_GAMMA,  Next: LOGICAL,  Prev: LOG10,  Up: Intrinsic Procedures
  
! 9.169 'LOG_GAMMA' -- Logarithm of the Gamma function
  ====================================================
  
  _Description_:
!      'LOG_GAMMA(X)' computes the natural logarithm of the absolute value
       of the Gamma (\Gamma) function.
  
  _Standard_:
*************** _Class_:
*** 12883,12896 ****
       Elemental function
  
  _Syntax_:
!      `X = LOG_GAMMA(X)'
  
  _Arguments_:
!      X          Shall be of type `REAL' and neither zero nor a
!                 negative integer.
  
  _Return value_:
!      The return value is of type `REAL' of the same kind as X.
  
  _Example_:
            program test_log_gamma
--- 12761,12774 ----
       Elemental function
  
  _Syntax_:
!      'X = LOG_GAMMA(X)'
  
  _Arguments_:
!      X           Shall be of type 'REAL' and neither zero nor a
!                  negative integer.
  
  _Return value_:
!      The return value is of type 'REAL' of the same kind as X.
  
  _Example_:
            program test_log_gamma
*************** _Example_:
*** 12899,12921 ****
            end program test_log_gamma
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `LGAMMA(X)'   `REAL(4) X'   `REAL(4)'     GNU Extension
!      `ALGAMA(X)'   `REAL(4) X'   `REAL(4)'     GNU Extension
!      `DLGAMA(X)'   `REAL(8) X'   `REAL(8)'     GNU Extension
  
  _See also_:
       Gamma function: *note GAMMA::
  
- 
  
  File: gfortran.info,  Node: LOGICAL,  Next: LONG,  Prev: LOG_GAMMA,  Up: Intrinsic Procedures
  
! 9.170 `LOGICAL' -- Convert to logical type
  ==========================================
  
  _Description_:
!      Converts one kind of `LOGICAL' variable to another.
  
  _Standard_:
       Fortran 95 and later
--- 12777,12798 ----
            end program test_log_gamma
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'LGAMMA(X)'    'REAL(4) X'    'REAL(4)'      GNU Extension
!      'ALGAMA(X)'    'REAL(4) X'    'REAL(4)'      GNU Extension
!      'DLGAMA(X)'    'REAL(8) X'    'REAL(8)'      GNU Extension
  
  _See also_:
       Gamma function: *note GAMMA::
  
  
  File: gfortran.info,  Node: LOGICAL,  Next: LONG,  Prev: LOG_GAMMA,  Up: Intrinsic Procedures
  
! 9.170 'LOGICAL' -- Convert to logical type
  ==========================================
  
  _Description_:
!      Converts one kind of 'LOGICAL' variable to another.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 12924,12939 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LOGICAL(L [, KIND])'
  
  _Arguments_:
!      L          The type shall be `LOGICAL'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is a `LOGICAL' value equal to L, with a kind
       corresponding to KIND, or of the default logical kind if KIND is
       not given.
  
--- 12801,12816 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LOGICAL(L [, KIND])'
  
  _Arguments_:
!      L           The type shall be 'LOGICAL'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is a 'LOGICAL' value equal to L, with a kind
       corresponding to KIND, or of the default logical kind if KIND is
       not given.
  
*************** _See also_:
*** 12943,12956 ****
  
  File: gfortran.info,  Node: LONG,  Next: LSHIFT,  Prev: LOGICAL,  Up: Intrinsic Procedures
  
! 9.171 `LONG' -- Convert to integer type
  =======================================
  
  _Description_:
!      Convert to a `KIND=4' integer type, which is the same size as a C
!      `long' integer.  This is equivalent to the standard `INT'
!      intrinsic with an optional argument of `KIND=4', and is only
!      included for backwards compatibility.
  
  _Standard_:
       GNU extension
--- 12820,12833 ----
  
  File: gfortran.info,  Node: LONG,  Next: LSHIFT,  Prev: LOGICAL,  Up: Intrinsic Procedures
  
! 9.171 'LONG' -- Convert to integer type
  =======================================
  
  _Description_:
!      Convert to a 'KIND=4' integer type, which is the same size as a C
!      'long' integer.  This is equivalent to the standard 'INT' intrinsic
!      with an optional argument of 'KIND=4', and is only included for
!      backwards compatibility.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 12959,12972 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LONG(A)'
  
  _Arguments_:
!      A          Shall be of type `INTEGER', `REAL', or
!                 `COMPLEX'.
  
  _Return value_:
!      The return value is a `INTEGER(4)' variable.
  
  _See also_:
       *note INT::, *note INT2::, *note INT8::
--- 12836,12849 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LONG(A)'
  
  _Arguments_:
!      A           Shall be of type 'INTEGER', 'REAL', or
!                  'COMPLEX'.
  
  _Return value_:
!      The return value is a 'INTEGER(4)' variable.
  
  _See also_:
       *note INT::, *note INT2::, *note INT8::
*************** _See also_:
*** 12974,12991 ****
  
  File: gfortran.info,  Node: LSHIFT,  Next: LSTAT,  Prev: LONG,  Up: Intrinsic Procedures
  
! 9.172 `LSHIFT' -- Left shift bits
  =================================
  
  _Description_:
!      `LSHIFT' returns a value corresponding to I with all of the bits
       shifted left by SHIFT places.  If the absolute value of SHIFT is
!      greater than `BIT_SIZE(I)', the value is undefined.  Bits shifted
       out from the left end are lost; zeros are shifted in from the
       opposite end.
  
!      This function has been superseded by the `ISHFT' intrinsic, which
!      is standard in Fortran 95 and later, and the `SHIFTL' intrinsic,
       which is standard in Fortran 2008 and later.
  
  _Standard_:
--- 12851,12868 ----
  
  File: gfortran.info,  Node: LSHIFT,  Next: LSTAT,  Prev: LONG,  Up: Intrinsic Procedures
  
! 9.172 'LSHIFT' -- Left shift bits
  =================================
  
  _Description_:
!      'LSHIFT' returns a value corresponding to I with all of the bits
       shifted left by SHIFT places.  If the absolute value of SHIFT is
!      greater than 'BIT_SIZE(I)', the value is undefined.  Bits shifted
       out from the left end are lost; zeros are shifted in from the
       opposite end.
  
!      This function has been superseded by the 'ISHFT' intrinsic, which
!      is standard in Fortran 95 and later, and the 'SHIFTL' intrinsic,
       which is standard in Fortran 2008 and later.
  
  _Standard_:
*************** _Class_:
*** 12995,13026 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = LSHIFT(I, SHIFT)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      SHIFT      The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
       *note ISHFT::, *note ISHFTC::, *note RSHIFT::, *note SHIFTA::,
       *note SHIFTL::, *note SHIFTR::
  
- 
  
  File: gfortran.info,  Node: LSTAT,  Next: LTIME,  Prev: LSHIFT,  Up: Intrinsic Procedures
  
! 9.173 `LSTAT' -- Get file status
  ================================
  
  _Description_:
!      `LSTAT' is identical to *note STAT::, except that if path is a
       symbolic link, then the link itself is statted, not the file that
       it refers to.
  
!      The elements in `VALUES' are the same as described by *note STAT::.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 12872,12902 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = LSHIFT(I, SHIFT)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      SHIFT       The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
       *note ISHFT::, *note ISHFTC::, *note RSHIFT::, *note SHIFTA::,
       *note SHIFTL::, *note SHIFTR::
  
  
  File: gfortran.info,  Node: LSTAT,  Next: LTIME,  Prev: LSHIFT,  Up: Intrinsic Procedures
  
! 9.173 'LSTAT' -- Get file status
  ================================
  
  _Description_:
!      'LSTAT' is identical to *note STAT::, except that if path is a
       symbolic link, then the link itself is statted, not the file that
       it refers to.
  
!      The elements in 'VALUES' are the same as described by *note STAT::.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 13032,13047 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL LSTAT(NAME, VALUES [, STATUS])'
!      `STATUS = LSTAT(NAME, VALUES)'
  
  _Arguments_:
!      NAME       The type shall be `CHARACTER' of the default
!                 kind, a valid path within the file system.
!      VALUES     The type shall be `INTEGER(4), DIMENSION(13)'.
!      STATUS     (Optional) status flag of type `INTEGER(4)'.
!                 Returns 0 on success and a system specific
!                 error code otherwise.
  
  _Example_:
       See *note STAT:: for an example.
--- 12908,12923 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL LSTAT(NAME, VALUES [, STATUS])'
!      'STATUS = LSTAT(NAME, VALUES)'
  
  _Arguments_:
!      NAME        The type shall be 'CHARACTER' of the default
!                  kind, a valid path within the file system.
!      VALUES      The type shall be 'INTEGER(4), DIMENSION(13)'.
!      STATUS      (Optional) status flag of type 'INTEGER(4)'.
!                  Returns 0 on success and a system specific error
!                  code otherwise.
  
  _Example_:
       See *note STAT:: for an example.
*************** _See also_:
*** 13052,13064 ****
  
  File: gfortran.info,  Node: LTIME,  Next: MALLOC,  Prev: LSTAT,  Up: Intrinsic Procedures
  
! 9.174 `LTIME' -- Convert time to local time info
  ================================================
  
  _Description_:
!      Given a system time value TIME (as provided by the `TIME8'
       intrinsic), fills VALUES with values extracted from it appropriate
!      to the local time zone using `localtime(3)'.
  
  _Standard_:
       GNU extension
--- 12928,12940 ----
  
  File: gfortran.info,  Node: LTIME,  Next: MALLOC,  Prev: LSTAT,  Up: Intrinsic Procedures
  
! 9.174 'LTIME' -- Convert time to local time info
  ================================================
  
  _Description_:
!      Given a system time value TIME (as provided by the 'TIME8'
       intrinsic), fills VALUES with values extracted from it appropriate
!      to the local time zone using 'localtime(3)'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 13067,13099 ****
       Subroutine
  
  _Syntax_:
!      `CALL LTIME(TIME, VALUES)'
  
  _Arguments_:
!      TIME       An `INTEGER' scalar expression corresponding
!                 to a system time, with `INTENT(IN)'.
!      VALUES     A default `INTEGER' array with 9 elements,
!                 with `INTENT(OUT)'.
  
  _Return value_:
       The elements of VALUES are assigned as follows:
         1. Seconds after the minute, range 0-59 or 0-61 to allow for leap
            seconds
- 
         2. Minutes after the hour, range 0-59
- 
         3. Hours past midnight, range 0-23
- 
         4. Day of month, range 0-31
- 
         5. Number of months since January, range 0-12
- 
         6. Years since 1900
- 
         7. Number of days since Sunday, range 0-6
- 
         8. Days since January 1
- 
         9. Daylight savings indicator: positive if daylight savings is in
            effect, zero if not, and negative if the information is not
            available.
--- 12943,12967 ----
       Subroutine
  
  _Syntax_:
!      'CALL LTIME(TIME, VALUES)'
  
  _Arguments_:
!      TIME        An 'INTEGER' scalar expression corresponding to
!                  a system time, with 'INTENT(IN)'.
!      VALUES      A default 'INTEGER' array with 9 elements, with
!                  'INTENT(OUT)'.
  
  _Return value_:
       The elements of VALUES are assigned as follows:
         1. Seconds after the minute, range 0-59 or 0-61 to allow for leap
            seconds
         2. Minutes after the hour, range 0-59
         3. Hours past midnight, range 0-23
         4. Day of month, range 0-31
         5. Number of months since January, range 0-12
         6. Years since 1900
         7. Number of days since Sunday, range 0-6
         8. Days since January 1
         9. Daylight savings indicator: positive if daylight savings is in
            effect, zero if not, and negative if the information is not
            available.
*************** _Return value_:
*** 13101,13120 ****
  _See also_:
       *note CTIME::, *note GMTIME::, *note TIME::, *note TIME8::
  
- 
  
  File: gfortran.info,  Node: MALLOC,  Next: MASKL,  Prev: LTIME,  Up: Intrinsic Procedures
  
! 9.175 `MALLOC' -- Allocate dynamic memory
  =========================================
  
  _Description_:
!      `MALLOC(SIZE)' allocates SIZE bytes of dynamic memory and returns
!      the address of the allocated memory. The `MALLOC' intrinsic is an
       extension intended to be used with Cray pointers, and is provided
!      in GNU Fortran to allow the user to compile legacy code. For new
       code using Fortran 95 pointers, the memory allocation intrinsic is
!      `ALLOCATE'.
  
  _Standard_:
       GNU extension
--- 12969,12987 ----
  _See also_:
       *note CTIME::, *note GMTIME::, *note TIME::, *note TIME8::
  
  
  File: gfortran.info,  Node: MALLOC,  Next: MASKL,  Prev: LTIME,  Up: Intrinsic Procedures
  
! 9.175 'MALLOC' -- Allocate dynamic memory
  =========================================
  
  _Description_:
!      'MALLOC(SIZE)' allocates SIZE bytes of dynamic memory and returns
!      the address of the allocated memory.  The 'MALLOC' intrinsic is an
       extension intended to be used with Cray pointers, and is provided
!      in GNU Fortran to allow the user to compile legacy code.  For new
       code using Fortran 95 pointers, the memory allocation intrinsic is
!      'ALLOCATE'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 13123,13140 ****
       Function
  
  _Syntax_:
!      `PTR = MALLOC(SIZE)'
  
  _Arguments_:
!      SIZE       The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER(K)', with K such that
!      variables of type `INTEGER(K)' have the same size as C pointers
!      (`sizeof(void *)').
  
  _Example_:
!      The following example demonstrates the use of `MALLOC' and `FREE'
       with Cray pointers.
  
            program test_malloc
--- 12990,13007 ----
       Function
  
  _Syntax_:
!      'PTR = MALLOC(SIZE)'
  
  _Arguments_:
!      SIZE        The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER(K)', with K such that
!      variables of type 'INTEGER(K)' have the same size as C pointers
!      ('sizeof(void *)').
  
  _Example_:
!      The following example demonstrates the use of 'MALLOC' and 'FREE'
       with Cray pointers.
  
            program test_malloc
*************** _See also_:
*** 13161,13171 ****
  
  File: gfortran.info,  Node: MASKL,  Next: MASKR,  Prev: MALLOC,  Up: Intrinsic Procedures
  
! 9.176 `MASKL' -- Left justified mask
  ====================================
  
  _Description_:
!      `MASKL(I[, KIND])' has its leftmost I bits set to 1, and the
       remaining bits set to 0.
  
  _Standard_:
--- 13028,13038 ----
  
  File: gfortran.info,  Node: MASKL,  Next: MASKR,  Prev: MALLOC,  Up: Intrinsic Procedures
  
! 9.176 'MASKL' -- Left justified mask
  ====================================
  
  _Description_:
!      'MASKL(I[, KIND])' has its leftmost I bits set to 1, and the
       remaining bits set to 0.
  
  _Standard_:
*************** _Class_:
*** 13175,13189 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = MASKL(I[, KIND])'
  
  _Arguments_:
!      I          Shall be of type `INTEGER'.
!      KIND       Shall be a scalar constant expression of type
!                 `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER'. If KIND is present, it
       specifies the kind value of the return type; otherwise, it is of
       the default integer kind.
  
--- 13042,13056 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = MASKL(I[, KIND])'
  
  _Arguments_:
!      I           Shall be of type 'INTEGER'.
!      KIND        Shall be a scalar constant expression of type
!                  'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER'.  If KIND is present, it
       specifies the kind value of the return type; otherwise, it is of
       the default integer kind.
  
*************** _See also_:
*** 13193,13203 ****
  
  File: gfortran.info,  Node: MASKR,  Next: MATMUL,  Prev: MASKL,  Up: Intrinsic Procedures
  
! 9.177 `MASKR' -- Right justified mask
  =====================================
  
  _Description_:
!      `MASKL(I[, KIND])' has its rightmost I bits set to 1, and the
       remaining bits set to 0.
  
  _Standard_:
--- 13060,13070 ----
  
  File: gfortran.info,  Node: MASKR,  Next: MATMUL,  Prev: MASKL,  Up: Intrinsic Procedures
  
! 9.177 'MASKR' -- Right justified mask
  =====================================
  
  _Description_:
!      'MASKL(I[, KIND])' has its rightmost I bits set to 1, and the
       remaining bits set to 0.
  
  _Standard_:
*************** _Class_:
*** 13207,13221 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = MASKR(I[, KIND])'
  
  _Arguments_:
!      I          Shall be of type `INTEGER'.
!      KIND       Shall be a scalar constant expression of type
!                 `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER'. If KIND is present, it
       specifies the kind value of the return type; otherwise, it is of
       the default integer kind.
  
--- 13074,13088 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = MASKR(I[, KIND])'
  
  _Arguments_:
!      I           Shall be of type 'INTEGER'.
!      KIND        Shall be a scalar constant expression of type
!                  'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER'.  If KIND is present, it
       specifies the kind value of the return type; otherwise, it is of
       the default integer kind.
  
*************** _See also_:
*** 13225,13231 ****
  
  File: gfortran.info,  Node: MATMUL,  Next: MAX,  Prev: MASKR,  Up: Intrinsic Procedures
  
! 9.178 `MATMUL' -- matrix multiplication
  =======================================
  
  _Description_:
--- 13092,13098 ----
  
  File: gfortran.info,  Node: MATMUL,  Next: MAX,  Prev: MASKR,  Up: Intrinsic Procedures
  
! 9.178 'MATMUL' -- matrix multiplication
  =======================================
  
  _Description_:
*************** _Class_:
*** 13238,13266 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = MATMUL(MATRIX_A, MATRIX_B)'
  
  _Arguments_:
!      MATRIX_A   An array of `INTEGER', `REAL', `COMPLEX', or
!                 `LOGICAL' type, with a rank of one or two.
!      MATRIX_B   An array of `INTEGER', `REAL', or `COMPLEX'
!                 type if MATRIX_A is of a numeric type;
!                 otherwise, an array of `LOGICAL' type. The
!                 rank shall be one or two, and the first (or
!                 only) dimension of MATRIX_B shall be equal to
!                 the last (or only) dimension of MATRIX_A.
  
  _Return value_:
       The matrix product of MATRIX_A and MATRIX_B.  The type and kind of
       the result follow the usual type and kind promotion rules, as for
!      the `*' or `.AND.' operators.
  
  _See also_:
  
  
  File: gfortran.info,  Node: MAX,  Next: MAXEXPONENT,  Prev: MATMUL,  Up: Intrinsic Procedures
  
! 9.179 `MAX' -- Maximum value of an argument list
  ================================================
  
  _Description_:
--- 13105,13133 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = MATMUL(MATRIX_A, MATRIX_B)'
  
  _Arguments_:
!      MATRIX_A    An array of 'INTEGER', 'REAL', 'COMPLEX', or
!                  'LOGICAL' type, with a rank of one or two.
!      MATRIX_B    An array of 'INTEGER', 'REAL', or 'COMPLEX' type
!                  if MATRIX_A is of a numeric type; otherwise, an
!                  array of 'LOGICAL' type.  The rank shall be one
!                  or two, and the first (or only) dimension of
!                  MATRIX_B shall be equal to the last (or only)
!                  dimension of MATRIX_A.
  
  _Return value_:
       The matrix product of MATRIX_A and MATRIX_B.  The type and kind of
       the result follow the usual type and kind promotion rules, as for
!      the '*' or '.AND.' operators.
  
  _See also_:
  
  
  File: gfortran.info,  Node: MAX,  Next: MAXEXPONENT,  Prev: MATMUL,  Up: Intrinsic Procedures
  
! 9.179 'MAX' -- Maximum value of an argument list
  ================================================
  
  _Description_:
*************** _Class_:
*** 13273,13316 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = MAX(A1, A2 [, A3 [, ...]])'
  
  _Arguments_:
!      A1         The type shall be `INTEGER' or `REAL'.
!      A2, A3,    An expression of the same type and kind as A1.
!      ...        (As a GNU extension, arguments of different
!                 kinds are permitted.)
  
  _Return value_:
       The return value corresponds to the maximum value among the
       arguments, and has the same type and kind as the first argument.
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `MAX0(A1)'    `INTEGER(4)   `INTEGER(4)'  Fortran 77 and
!                    A1'                         later
!      `AMAX0(A1)'   `INTEGER(4)   `REAL(MAX(X))'Fortran 77 and
!                    A1'                         later
!      `MAX1(A1)'    `REAL A1'     `INT(MAX(X))' Fortran 77 and
!                                                later
!      `AMAX1(A1)'   `REAL(4) A1'  `REAL(4)'     Fortran 77 and
!                                                later
!      `DMAX1(A1)'   `REAL(8) A1'  `REAL(8)'     Fortran 77 and
!                                                later
  
  _See also_:
       *note MAXLOC:: *note MAXVAL::, *note MIN::
  
- 
  
  File: gfortran.info,  Node: MAXEXPONENT,  Next: MAXLOC,  Prev: MAX,  Up: Intrinsic Procedures
  
! 9.180 `MAXEXPONENT' -- Maximum exponent of a real kind
  ======================================================
  
  _Description_:
!      `MAXEXPONENT(X)' returns the maximum exponent in the model of the
!      type of `X'.
  
  _Standard_:
       Fortran 95 and later
--- 13140,13182 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = MAX(A1, A2 [, A3 [, ...]])'
  
  _Arguments_:
!      A1          The type shall be 'INTEGER' or 'REAL'.
!      A2, A3,     An expression of the same type and kind as A1.
!      ...         (As a GNU extension, arguments of different
!                  kinds are permitted.)
  
  _Return value_:
       The return value corresponds to the maximum value among the
       arguments, and has the same type and kind as the first argument.
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'MAX0(A1)'     'INTEGER(4)    'INTEGER(4)'   Fortran 77 and
!                     A1'                           later
!      'AMAX0(A1)'    'INTEGER(4)    'REAL(MAX(X))' Fortran 77 and
!                     A1'                           later
!      'MAX1(A1)'     'REAL A1'      'INT(MAX(X))'  Fortran 77 and
!                                                   later
!      'AMAX1(A1)'    'REAL(4) A1'   'REAL(4)'      Fortran 77 and
!                                                   later
!      'DMAX1(A1)'    'REAL(8) A1'   'REAL(8)'      Fortran 77 and
!                                                   later
  
  _See also_:
       *note MAXLOC:: *note MAXVAL::, *note MIN::
  
  
  File: gfortran.info,  Node: MAXEXPONENT,  Next: MAXLOC,  Prev: MAX,  Up: Intrinsic Procedures
  
! 9.180 'MAXEXPONENT' -- Maximum exponent of a real kind
  ======================================================
  
  _Description_:
!      'MAXEXPONENT(X)' returns the maximum exponent in the model of the
!      type of 'X'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13319,13331 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = MAXEXPONENT(X)'
  
  _Arguments_:
!      X          Shall be of type `REAL'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the default integer
       kind.
  
  _Example_:
--- 13185,13197 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = MAXEXPONENT(X)'
  
  _Arguments_:
!      X           Shall be of type 'REAL'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the default integer
       kind.
  
  _Example_:
*************** _Example_:
*** 13340,13346 ****
  
  File: gfortran.info,  Node: MAXLOC,  Next: MAXVAL,  Prev: MAXEXPONENT,  Up: Intrinsic Procedures
  
! 9.181 `MAXLOC' -- Location of the maximum value within an array
  ===============================================================
  
  _Description_:
--- 13206,13212 ----
  
  File: gfortran.info,  Node: MAXLOC,  Next: MAXVAL,  Prev: MAXEXPONENT,  Up: Intrinsic Procedures
  
! 9.181 'MAXLOC' -- Location of the maximum value within an array
  ===============================================================
  
  _Description_:
*************** _Description_:
*** 13348,13360 ****
       maximum value, or, if the DIM argument is supplied, determines the
       locations of the maximum element along each row of the array in the
       DIM direction.  If MASK is present, only the elements for which
!      MASK is `.TRUE.' are considered.  If more than one element in the
       array has the maximum value, the location returned is that of the
       first such element in array element order.  If the array has zero
!      size, or all of the elements of MASK are `.FALSE.', then the
!      result is an array of zeroes.  Similarly, if DIM is supplied and
!      all of the elements of MASK along a given row are zero, the result
!      value for that row is zero.
  
  _Standard_:
       Fortran 95 and later
--- 13214,13226 ----
       maximum value, or, if the DIM argument is supplied, determines the
       locations of the maximum element along each row of the array in the
       DIM direction.  If MASK is present, only the elements for which
!      MASK is '.TRUE.' are considered.  If more than one element in the
       array has the maximum value, the location returned is that of the
       first such element in array element order.  If the array has zero
!      size, or all of the elements of MASK are '.FALSE.', then the result
!      is an array of zeroes.  Similarly, if DIM is supplied and all of
!      the elements of MASK along a given row are zero, the result value
!      for that row is zero.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13363,13379 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = MAXLOC(ARRAY, DIM [, MASK])'
!      `RESULT = MAXLOC(ARRAY [, MASK])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `INTEGER' or `REAL'.
!      DIM        (Optional) Shall be a scalar of type
!                 `INTEGER', with a value between one and the
!                 rank of ARRAY, inclusive.  It may not be an
!                 optional dummy argument.
!      MASK       Shall be an array of type `LOGICAL', and
!                 conformable with ARRAY.
  
  _Return value_:
       If DIM is absent, the result is a rank-one array with a length
--- 13229,13245 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = MAXLOC(ARRAY, DIM [, MASK])'
!      'RESULT = MAXLOC(ARRAY [, MASK])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'INTEGER' or 'REAL'.
!      DIM         (Optional) Shall be a scalar of type 'INTEGER',
!                  with a value between one and the rank of ARRAY,
!                  inclusive.  It may not be an optional dummy
!                  argument.
!      MASK        Shall be an array of type 'LOGICAL', and
!                  conformable with ARRAY.
  
  _Return value_:
       If DIM is absent, the result is a rank-one array with a length
*************** _Return value_:
*** 13381,13406 ****
       array with a rank one less than the rank of ARRAY, and a size
       corresponding to the size of ARRAY with the DIM dimension removed.
       If DIM is present and ARRAY has a rank of one, the result is a
!      scalar.  In all cases, the result is of default `INTEGER' type.
  
  _See also_:
       *note MAX::, *note MAXVAL::
  
- 
  
  File: gfortran.info,  Node: MAXVAL,  Next: MCLOCK,  Prev: MAXLOC,  Up: Intrinsic Procedures
  
! 9.182 `MAXVAL' -- Maximum value of an array
  ===========================================
  
  _Description_:
!      Determines the maximum value of the elements in an array value,
!      or, if the DIM argument is supplied, determines the maximum value
!      along each row of the array in the DIM direction.  If MASK is
!      present, only the elements for which MASK is `.TRUE.' are
!      considered.  If the array has zero size, or all of the elements of
!      MASK are `.FALSE.', then the result is `-HUGE(ARRAY)' if ARRAY is
!      numeric, or a string of nulls if ARRAY is of character type.
  
  _Standard_:
       Fortran 95 and later
--- 13247,13271 ----
       array with a rank one less than the rank of ARRAY, and a size
       corresponding to the size of ARRAY with the DIM dimension removed.
       If DIM is present and ARRAY has a rank of one, the result is a
!      scalar.  In all cases, the result is of default 'INTEGER' type.
  
  _See also_:
       *note MAX::, *note MAXVAL::
  
  
  File: gfortran.info,  Node: MAXVAL,  Next: MCLOCK,  Prev: MAXLOC,  Up: Intrinsic Procedures
  
! 9.182 'MAXVAL' -- Maximum value of an array
  ===========================================
  
  _Description_:
!      Determines the maximum value of the elements in an array value, or,
!      if the DIM argument is supplied, determines the maximum value along
!      each row of the array in the DIM direction.  If MASK is present,
!      only the elements for which MASK is '.TRUE.' are considered.  If
!      the array has zero size, or all of the elements of MASK are
!      '.FALSE.', then the result is '-HUGE(ARRAY)' if ARRAY is numeric,
!      or a string of nulls if ARRAY is of character type.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13409,13425 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = MAXVAL(ARRAY, DIM [, MASK])'
!      `RESULT = MAXVAL(ARRAY [, MASK])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `INTEGER' or `REAL'.
!      DIM        (Optional) Shall be a scalar of type
!                 `INTEGER', with a value between one and the
!                 rank of ARRAY, inclusive.  It may not be an
!                 optional dummy argument.
!      MASK       Shall be an array of type `LOGICAL', and
!                 conformable with ARRAY.
  
  _Return value_:
       If DIM is absent, or if ARRAY has a rank of one, the result is a
--- 13274,13290 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = MAXVAL(ARRAY, DIM [, MASK])'
!      'RESULT = MAXVAL(ARRAY [, MASK])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'INTEGER' or 'REAL'.
!      DIM         (Optional) Shall be a scalar of type 'INTEGER',
!                  with a value between one and the rank of ARRAY,
!                  inclusive.  It may not be an optional dummy
!                  argument.
!      MASK        Shall be an array of type 'LOGICAL', and
!                  conformable with ARRAY.
  
  _Return value_:
       If DIM is absent, or if ARRAY has a rank of one, the result is a
*************** _See also_:
*** 13434,13448 ****
  
  File: gfortran.info,  Node: MCLOCK,  Next: MCLOCK8,  Prev: MAXVAL,  Up: Intrinsic Procedures
  
! 9.183 `MCLOCK' -- Time function
  ===============================
  
  _Description_:
       Returns the number of clock ticks since the start of the process,
!      based on the function `clock(3)' in the C standard library.
  
       This intrinsic is not fully portable, such as to systems with
!      32-bit `INTEGER' types but supporting times wider than 32 bits.
       Therefore, the values returned by this intrinsic might be, or
       become, negative, or numerically less than previous values, during
       a single run of the compiled program.
--- 13299,13313 ----
  
  File: gfortran.info,  Node: MCLOCK,  Next: MCLOCK8,  Prev: MAXVAL,  Up: Intrinsic Procedures
  
! 9.183 'MCLOCK' -- Time function
  ===============================
  
  _Description_:
       Returns the number of clock ticks since the start of the process,
!      based on the function 'clock(3)' in the C standard library.
  
       This intrinsic is not fully portable, such as to systems with
!      32-bit 'INTEGER' types but supporting times wider than 32 bits.
       Therefore, the values returned by this intrinsic might be, or
       become, negative, or numerically less than previous values, during
       a single run of the compiled program.
*************** _Class_:
*** 13454,13489 ****
       Function
  
  _Syntax_:
!      `RESULT = MCLOCK()'
  
  _Return value_:
!      The return value is a scalar of type `INTEGER(4)', equal to the
!      number of clock ticks since the start of the process, or `-1' if
!      the system does not support `clock(3)'.
  
  _See also_:
!      *note CTIME::, *note GMTIME::, *note LTIME::, *note MCLOCK::,
!      *note TIME::
! 
  
  
  File: gfortran.info,  Node: MCLOCK8,  Next: MERGE,  Prev: MCLOCK,  Up: Intrinsic Procedures
  
! 9.184 `MCLOCK8' -- Time function (64-bit)
  =========================================
  
  _Description_:
       Returns the number of clock ticks since the start of the process,
!      based on the function `clock(3)' in the C standard library.
  
       _Warning:_ this intrinsic does not increase the range of the timing
!      values over that returned by `clock(3)'. On a system with a 32-bit
!      `clock(3)', `MCLOCK8' will return a 32-bit value, even though it
!      is converted to a 64-bit `INTEGER(8)' value. That means overflows
!      of the 32-bit value can still occur. Therefore, the values
!      returned by this intrinsic might be or become negative or
!      numerically less than previous values during a single run of the
!      compiled program.
  
  _Standard_:
       GNU extension
--- 13319,13352 ----
       Function
  
  _Syntax_:
!      'RESULT = MCLOCK()'
  
  _Return value_:
!      The return value is a scalar of type 'INTEGER(4)', equal to the
!      number of clock ticks since the start of the process, or '-1' if
!      the system does not support 'clock(3)'.
  
  _See also_:
!      *note CTIME::, *note GMTIME::, *note LTIME::, *note MCLOCK::, *note
!      TIME::
  
  
  File: gfortran.info,  Node: MCLOCK8,  Next: MERGE,  Prev: MCLOCK,  Up: Intrinsic Procedures
  
! 9.184 'MCLOCK8' -- Time function (64-bit)
  =========================================
  
  _Description_:
       Returns the number of clock ticks since the start of the process,
!      based on the function 'clock(3)' in the C standard library.
  
       _Warning:_ this intrinsic does not increase the range of the timing
!      values over that returned by 'clock(3)'.  On a system with a 32-bit
!      'clock(3)', 'MCLOCK8' will return a 32-bit value, even though it is
!      converted to a 64-bit 'INTEGER(8)' value.  That means overflows of
!      the 32-bit value can still occur.  Therefore, the values returned
!      by this intrinsic might be or become negative or numerically less
!      than previous values during a single run of the compiled program.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 13492,13519 ****
       Function
  
  _Syntax_:
!      `RESULT = MCLOCK8()'
  
  _Return value_:
!      The return value is a scalar of type `INTEGER(8)', equal to the
!      number of clock ticks since the start of the process, or `-1' if
!      the system does not support `clock(3)'.
  
  _See also_:
!      *note CTIME::, *note GMTIME::, *note LTIME::, *note MCLOCK::,
!      *note TIME8::
! 
  
  
  File: gfortran.info,  Node: MERGE,  Next: MERGE_BITS,  Prev: MCLOCK8,  Up: Intrinsic Procedures
  
! 9.185 `MERGE' -- Merge variables
  ================================
  
  _Description_:
       Select values from two arrays according to a logical mask.  The
!      result is equal to TSOURCE if MASK is `.TRUE.', or equal to
!      FSOURCE if it is `.FALSE.'.
  
  _Standard_:
       Fortran 95 and later
--- 13355,13381 ----
       Function
  
  _Syntax_:
!      'RESULT = MCLOCK8()'
  
  _Return value_:
!      The return value is a scalar of type 'INTEGER(8)', equal to the
!      number of clock ticks since the start of the process, or '-1' if
!      the system does not support 'clock(3)'.
  
  _See also_:
!      *note CTIME::, *note GMTIME::, *note LTIME::, *note MCLOCK::, *note
!      TIME8::
  
  
  File: gfortran.info,  Node: MERGE,  Next: MERGE_BITS,  Prev: MCLOCK8,  Up: Intrinsic Procedures
  
! 9.185 'MERGE' -- Merge variables
  ================================
  
  _Description_:
       Select values from two arrays according to a logical mask.  The
!      result is equal to TSOURCE if MASK is '.TRUE.', or equal to FSOURCE
!      if it is '.FALSE.'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13522,13550 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = MERGE(TSOURCE, FSOURCE, MASK)'
  
  _Arguments_:
!      TSOURCE    May be of any type.
!      FSOURCE    Shall be of the same type and type parameters
!                 as TSOURCE.
!      MASK       Shall be of type `LOGICAL'.
  
  _Return value_:
       The result is of the same type and type parameters as TSOURCE.
  
- 
  
  File: gfortran.info,  Node: MERGE_BITS,  Next: MIN,  Prev: MERGE,  Up: Intrinsic Procedures
  
! 9.186 `MERGE_BITS' -- Merge of bits under mask
  ==============================================
  
  _Description_:
!      `MERGE_BITS(I, J, MASK)' merges the bits of I and J as determined
       by the mask.  The i-th bit of the result is equal to the i-th bit
!      of I if the i-th bit of MASK is 1; it is equal to the i-th bit of
!      J otherwise.
  
  _Standard_:
       Fortran 2008 and later
--- 13384,13411 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = MERGE(TSOURCE, FSOURCE, MASK)'
  
  _Arguments_:
!      TSOURCE     May be of any type.
!      FSOURCE     Shall be of the same type and type parameters as
!                  TSOURCE.
!      MASK        Shall be of type 'LOGICAL'.
  
  _Return value_:
       The result is of the same type and type parameters as TSOURCE.
  
  
  File: gfortran.info,  Node: MERGE_BITS,  Next: MIN,  Prev: MERGE,  Up: Intrinsic Procedures
  
! 9.186 'MERGE_BITS' -- Merge of bits under mask
  ==============================================
  
  _Description_:
!      'MERGE_BITS(I, J, MASK)' merges the bits of I and J as determined
       by the mask.  The i-th bit of the result is equal to the i-th bit
!      of I if the i-th bit of MASK is 1; it is equal to the i-th bit of J
!      otherwise.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 13553,13575 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = MERGE_BITS(I, J, MASK)'
  
  _Arguments_:
!      I          Shall be of type `INTEGER'.
!      J          Shall be of type `INTEGER' and of the same
!                 kind as I.
!      MASK       Shall be of type `INTEGER' and of the same
!                 kind as I.
  
  _Return value_:
       The result is of the same type and kind as I.
  
- 
  
  File: gfortran.info,  Node: MIN,  Next: MINEXPONENT,  Prev: MERGE_BITS,  Up: Intrinsic Procedures
  
! 9.187 `MIN' -- Minimum value of an argument list
  ================================================
  
  _Description_:
--- 13414,13435 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = MERGE_BITS(I, J, MASK)'
  
  _Arguments_:
!      I           Shall be of type 'INTEGER'.
!      J           Shall be of type 'INTEGER' and of the same kind
!                  as I.
!      MASK        Shall be of type 'INTEGER' and of the same kind
!                  as I.
  
  _Return value_:
       The result is of the same type and kind as I.
  
  
  File: gfortran.info,  Node: MIN,  Next: MINEXPONENT,  Prev: MERGE_BITS,  Up: Intrinsic Procedures
  
! 9.187 'MIN' -- Minimum value of an argument list
  ================================================
  
  _Description_:
*************** _Class_:
*** 13582,13611 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = MIN(A1, A2 [, A3, ...])'
  
  _Arguments_:
!      A1         The type shall be `INTEGER' or `REAL'.
!      A2, A3,    An expression of the same type and kind as A1.
!      ...        (As a GNU extension, arguments of different
!                 kinds are permitted.)
  
  _Return value_:
       The return value corresponds to the maximum value among the
       arguments, and has the same type and kind as the first argument.
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `MIN0(A1)'    `INTEGER(4)   `INTEGER(4)'  Fortran 77 and
!                    A1'                         later
!      `AMIN0(A1)'   `INTEGER(4)   `REAL(4)'     Fortran 77 and
!                    A1'                         later
!      `MIN1(A1)'    `REAL A1'     `INTEGER(4)'  Fortran 77 and
!                                                later
!      `AMIN1(A1)'   `REAL(4) A1'  `REAL(4)'     Fortran 77 and
!                                                later
!      `DMIN1(A1)'   `REAL(8) A1'  `REAL(8)'     Fortran 77 and
!                                                later
  
  _See also_:
       *note MAX::, *note MINLOC::, *note MINVAL::
--- 13442,13471 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = MIN(A1, A2 [, A3, ...])'
  
  _Arguments_:
!      A1          The type shall be 'INTEGER' or 'REAL'.
!      A2, A3,     An expression of the same type and kind as A1.
!      ...         (As a GNU extension, arguments of different
!                  kinds are permitted.)
  
  _Return value_:
       The return value corresponds to the maximum value among the
       arguments, and has the same type and kind as the first argument.
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'MIN0(A1)'     'INTEGER(4)    'INTEGER(4)'   Fortran 77 and
!                     A1'                           later
!      'AMIN0(A1)'    'INTEGER(4)    'REAL(4)'      Fortran 77 and
!                     A1'                           later
!      'MIN1(A1)'     'REAL A1'      'INTEGER(4)'   Fortran 77 and
!                                                   later
!      'AMIN1(A1)'    'REAL(4) A1'   'REAL(4)'      Fortran 77 and
!                                                   later
!      'DMIN1(A1)'    'REAL(8) A1'   'REAL(8)'      Fortran 77 and
!                                                   later
  
  _See also_:
       *note MAX::, *note MINLOC::, *note MINVAL::
*************** _See also_:
*** 13613,13624 ****
  
  File: gfortran.info,  Node: MINEXPONENT,  Next: MINLOC,  Prev: MIN,  Up: Intrinsic Procedures
  
! 9.188 `MINEXPONENT' -- Minimum exponent of a real kind
  ======================================================
  
  _Description_:
!      `MINEXPONENT(X)' returns the minimum exponent in the model of the
!      type of `X'.
  
  _Standard_:
       Fortran 95 and later
--- 13473,13484 ----
  
  File: gfortran.info,  Node: MINEXPONENT,  Next: MINLOC,  Prev: MIN,  Up: Intrinsic Procedures
  
! 9.188 'MINEXPONENT' -- Minimum exponent of a real kind
  ======================================================
  
  _Description_:
!      'MINEXPONENT(X)' returns the minimum exponent in the model of the
!      type of 'X'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13627,13648 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = MINEXPONENT(X)'
  
  _Arguments_:
!      X          Shall be of type `REAL'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the default integer
       kind.
  
  _Example_:
!      See `MAXEXPONENT' for an example.
  
  
  File: gfortran.info,  Node: MINLOC,  Next: MINVAL,  Prev: MINEXPONENT,  Up: Intrinsic Procedures
  
! 9.189 `MINLOC' -- Location of the minimum value within an array
  ===============================================================
  
  _Description_:
--- 13487,13508 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = MINEXPONENT(X)'
  
  _Arguments_:
!      X           Shall be of type 'REAL'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the default integer
       kind.
  
  _Example_:
!      See 'MAXEXPONENT' for an example.
  
  
  File: gfortran.info,  Node: MINLOC,  Next: MINVAL,  Prev: MINEXPONENT,  Up: Intrinsic Procedures
  
! 9.189 'MINLOC' -- Location of the minimum value within an array
  ===============================================================
  
  _Description_:
*************** _Description_:
*** 13650,13662 ****
       minimum value, or, if the DIM argument is supplied, determines the
       locations of the minimum element along each row of the array in the
       DIM direction.  If MASK is present, only the elements for which
!      MASK is `.TRUE.' are considered.  If more than one element in the
       array has the minimum value, the location returned is that of the
       first such element in array element order.  If the array has zero
!      size, or all of the elements of MASK are `.FALSE.', then the
!      result is an array of zeroes.  Similarly, if DIM is supplied and
!      all of the elements of MASK along a given row are zero, the result
!      value for that row is zero.
  
  _Standard_:
       Fortran 95 and later
--- 13510,13522 ----
       minimum value, or, if the DIM argument is supplied, determines the
       locations of the minimum element along each row of the array in the
       DIM direction.  If MASK is present, only the elements for which
!      MASK is '.TRUE.' are considered.  If more than one element in the
       array has the minimum value, the location returned is that of the
       first such element in array element order.  If the array has zero
!      size, or all of the elements of MASK are '.FALSE.', then the result
!      is an array of zeroes.  Similarly, if DIM is supplied and all of
!      the elements of MASK along a given row are zero, the result value
!      for that row is zero.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13665,13681 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = MINLOC(ARRAY, DIM [, MASK])'
!      `RESULT = MINLOC(ARRAY [, MASK])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `INTEGER' or `REAL'.
!      DIM        (Optional) Shall be a scalar of type
!                 `INTEGER', with a value between one and the
!                 rank of ARRAY, inclusive.  It may not be an
!                 optional dummy argument.
!      MASK       Shall be an array of type `LOGICAL', and
!                 conformable with ARRAY.
  
  _Return value_:
       If DIM is absent, the result is a rank-one array with a length
--- 13525,13541 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = MINLOC(ARRAY, DIM [, MASK])'
!      'RESULT = MINLOC(ARRAY [, MASK])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'INTEGER' or 'REAL'.
!      DIM         (Optional) Shall be a scalar of type 'INTEGER',
!                  with a value between one and the rank of ARRAY,
!                  inclusive.  It may not be an optional dummy
!                  argument.
!      MASK        Shall be an array of type 'LOGICAL', and
!                  conformable with ARRAY.
  
  _Return value_:
       If DIM is absent, the result is a rank-one array with a length
*************** _Return value_:
*** 13683,13709 ****
       array with a rank one less than the rank of ARRAY, and a size
       corresponding to the size of ARRAY with the DIM dimension removed.
       If DIM is present and ARRAY has a rank of one, the result is a
!      scalar.  In all cases, the result is of default `INTEGER' type.
  
  _See also_:
       *note MIN::, *note MINVAL::
  
- 
  
  File: gfortran.info,  Node: MINVAL,  Next: MOD,  Prev: MINLOC,  Up: Intrinsic Procedures
  
! 9.190 `MINVAL' -- Minimum value of an array
  ===========================================
  
  _Description_:
!      Determines the minimum value of the elements in an array value,
!      or, if the DIM argument is supplied, determines the minimum value
!      along each row of the array in the DIM direction.  If MASK is
!      present, only the elements for which MASK is `.TRUE.' are
!      considered.  If the array has zero size, or all of the elements of
!      MASK are `.FALSE.', then the result is `HUGE(ARRAY)' if ARRAY is
!      numeric, or a string of `CHAR(255)' characters if ARRAY is of
!      character type.
  
  _Standard_:
       Fortran 95 and later
--- 13543,13567 ----
       array with a rank one less than the rank of ARRAY, and a size
       corresponding to the size of ARRAY with the DIM dimension removed.
       If DIM is present and ARRAY has a rank of one, the result is a
!      scalar.  In all cases, the result is of default 'INTEGER' type.
  
  _See also_:
       *note MIN::, *note MINVAL::
  
  
  File: gfortran.info,  Node: MINVAL,  Next: MOD,  Prev: MINLOC,  Up: Intrinsic Procedures
  
! 9.190 'MINVAL' -- Minimum value of an array
  ===========================================
  
  _Description_:
!      Determines the minimum value of the elements in an array value, or,
!      if the DIM argument is supplied, determines the minimum value along
!      each row of the array in the DIM direction.  If MASK is present,
!      only the elements for which MASK is '.TRUE.' are considered.  If
!      the array has zero size, or all of the elements of MASK are
!      '.FALSE.', then the result is 'HUGE(ARRAY)' if ARRAY is numeric, or
!      a string of 'CHAR(255)' characters if ARRAY is of character type.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13712,13728 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = MINVAL(ARRAY, DIM [, MASK])'
!      `RESULT = MINVAL(ARRAY [, MASK])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `INTEGER' or `REAL'.
!      DIM        (Optional) Shall be a scalar of type
!                 `INTEGER', with a value between one and the
!                 rank of ARRAY, inclusive.  It may not be an
!                 optional dummy argument.
!      MASK       Shall be an array of type `LOGICAL', and
!                 conformable with ARRAY.
  
  _Return value_:
       If DIM is absent, or if ARRAY has a rank of one, the result is a
--- 13570,13586 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = MINVAL(ARRAY, DIM [, MASK])'
!      'RESULT = MINVAL(ARRAY [, MASK])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'INTEGER' or 'REAL'.
!      DIM         (Optional) Shall be a scalar of type 'INTEGER',
!                  with a value between one and the rank of ARRAY,
!                  inclusive.  It may not be an optional dummy
!                  argument.
!      MASK        Shall be an array of type 'LOGICAL', and
!                  conformable with ARRAY.
  
  _Return value_:
       If DIM is absent, or if ARRAY has a rank of one, the result is a
*************** _Return value_:
*** 13734,13748 ****
  _See also_:
       *note MIN::, *note MINLOC::
  
- 
  
  File: gfortran.info,  Node: MOD,  Next: MODULO,  Prev: MINVAL,  Up: Intrinsic Procedures
  
! 9.191 `MOD' -- Remainder function
  =================================
  
  _Description_:
!      `MOD(A,P)' computes the remainder of the division of A by P.
  
  _Standard_:
       Fortran 77 and later
--- 13592,13605 ----
  _See also_:
       *note MIN::, *note MINLOC::
  
  
  File: gfortran.info,  Node: MOD,  Next: MODULO,  Prev: MINVAL,  Up: Intrinsic Procedures
  
! 9.191 'MOD' -- Remainder function
  =================================
  
  _Description_:
!      'MOD(A,P)' computes the remainder of the division of A by P.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 13751,13768 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = MOD(A, P)'
  
  _Arguments_:
!      A          Shall be a scalar of type `INTEGER' or `REAL'.
!      P          Shall be a scalar of the same type and kind as
!                 A and not equal to zero.
  
  _Return value_:
!      The return value is the result of `A - (INT(A/P) * P)'. The type
       and kind of the return value is the same as that of the arguments.
!      The returned value has the same sign as A and a magnitude less
!      than the magnitude of P.
  
  _Example_:
            program test_mod
--- 13608,13625 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = MOD(A, P)'
  
  _Arguments_:
!      A           Shall be a scalar of type 'INTEGER' or 'REAL'.
!      P           Shall be a scalar of the same type and kind as A
!                  and not equal to zero.
  
  _Return value_:
!      The return value is the result of 'A - (INT(A/P) * P)'.  The type
       and kind of the return value is the same as that of the arguments.
!      The returned value has the same sign as A and a magnitude less than
!      the magnitude of P.
  
  _Example_:
            program test_mod
*************** _Example_:
*** 13783,13808 ****
            end program test_mod
  
  _Specific names_:
!      Name          Arguments     Return type   Standard
!      `MOD(A,P)'    `INTEGER      `INTEGER'     Fortran 95 and
!                    A,P'                        later
!      `AMOD(A,P)'   `REAL(4)      `REAL(4)'     Fortran 95 and
!                    A,P'                        later
!      `DMOD(A,P)'   `REAL(8)      `REAL(8)'     Fortran 95 and
!                    A,P'                        later
  
  _See also_:
       *note MODULO::
  
- 
  
  File: gfortran.info,  Node: MODULO,  Next: MOVE_ALLOC,  Prev: MOD,  Up: Intrinsic Procedures
  
! 9.192 `MODULO' -- Modulo function
  =================================
  
  _Description_:
!      `MODULO(A,P)' computes the A modulo P.
  
  _Standard_:
       Fortran 95 and later
--- 13640,13664 ----
            end program test_mod
  
  _Specific names_:
!      Name           Arguments      Return type    Standard
!      'MOD(A,P)'     'INTEGER       'INTEGER'      Fortran 95 and
!                     A,P'                          later
!      'AMOD(A,P)'    'REAL(4)       'REAL(4)'      Fortran 95 and
!                     A,P'                          later
!      'DMOD(A,P)'    'REAL(8)       'REAL(8)'      Fortran 95 and
!                     A,P'                          later
  
  _See also_:
       *note MODULO::
  
  
  File: gfortran.info,  Node: MODULO,  Next: MOVE_ALLOC,  Prev: MOD,  Up: Intrinsic Procedures
  
! 9.192 'MODULO' -- Modulo function
  =================================
  
  _Description_:
!      'MODULO(A,P)' computes the A modulo P.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13811,13831 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = MODULO(A, P)'
  
  _Arguments_:
!      A          Shall be a scalar of type `INTEGER' or `REAL'.
!      P          Shall be a scalar of the same type and kind as
!                 A.  It shall not be zero.
  
  _Return value_:
       The type and kind of the result are those of the arguments.
!     If A and P are of type `INTEGER':
!           `MODULO(A,P)' has the value R such that `A=Q*P+R', where Q is
            an integer and R is between 0 (inclusive) and P (exclusive).
! 
!     If A and P are of type `REAL':
!           `MODULO(A,P)' has the value of `A - FLOOR (A / P) * P'.
       The returned value has the same sign as P and a magnitude less than
       the magnitude of P.
  
--- 13667,13686 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = MODULO(A, P)'
  
  _Arguments_:
!      A           Shall be a scalar of type 'INTEGER' or 'REAL'.
!      P           Shall be a scalar of the same type and kind as
!                  A.  It shall not be zero.
  
  _Return value_:
       The type and kind of the result are those of the arguments.
!      If A and P are of type 'INTEGER':
!           'MODULO(A,P)' has the value R such that 'A=Q*P+R', where Q is
            an integer and R is between 0 (inclusive) and P (exclusive).
!      If A and P are of type 'REAL':
!           'MODULO(A,P)' has the value of 'A - FLOOR (A / P) * P'.
       The returned value has the same sign as P and a magnitude less than
       the magnitude of P.
  
*************** _Example_:
*** 13844,13858 ****
  _See also_:
       *note MOD::
  
- 
  
  File: gfortran.info,  Node: MOVE_ALLOC,  Next: MVBITS,  Prev: MODULO,  Up: Intrinsic Procedures
  
! 9.193 `MOVE_ALLOC' -- Move allocation from one object to another
  ================================================================
  
  _Description_:
!      `MOVE_ALLOC(FROM, TO)' moves the allocation from FROM to TO.  FROM
       will become deallocated in the process.
  
  _Standard_:
--- 13699,13712 ----
  _See also_:
       *note MOD::
  
  
  File: gfortran.info,  Node: MOVE_ALLOC,  Next: MVBITS,  Prev: MODULO,  Up: Intrinsic Procedures
  
! 9.193 'MOVE_ALLOC' -- Move allocation from one object to another
  ================================================================
  
  _Description_:
!      'MOVE_ALLOC(FROM, TO)' moves the allocation from FROM to TO.  FROM
       will become deallocated in the process.
  
  _Standard_:
*************** _Class_:
*** 13862,13874 ****
       Pure subroutine
  
  _Syntax_:
!      `CALL MOVE_ALLOC(FROM, TO)'
  
  _Arguments_:
!      FROM       `ALLOCATABLE', `INTENT(INOUT)', may be of any
!                 type and kind.
!      TO         `ALLOCATABLE', `INTENT(OUT)', shall be of the
!                 same type, kind and rank as FROM.
  
  _Return value_:
       None
--- 13716,13728 ----
       Pure subroutine
  
  _Syntax_:
!      'CALL MOVE_ALLOC(FROM, TO)'
  
  _Arguments_:
!      FROM        'ALLOCATABLE', 'INTENT(INOUT)', may be of any
!                  type and kind.
!      TO          'ALLOCATABLE', 'INTENT(OUT)', shall be of the
!                  same type, kind and rank as FROM.
  
  _Return value_:
       None
*************** _Example_:
*** 13887,13901 ****
  
  File: gfortran.info,  Node: MVBITS,  Next: NEAREST,  Prev: MOVE_ALLOC,  Up: Intrinsic Procedures
  
! 9.194 `MVBITS' -- Move bits from one integer to another
  =======================================================
  
  _Description_:
!      Moves LEN bits from positions FROMPOS through `FROMPOS+LEN-1' of
!      FROM to positions TOPOS through `TOPOS+LEN-1' of TO. The portion
       of argument TO not affected by the movement of bits is unchanged.
!      The values of `FROMPOS+LEN-1' and `TOPOS+LEN-1' must be less than
!      `BIT_SIZE(FROM)'.
  
  _Standard_:
       Fortran 95 and later
--- 13741,13755 ----
  
  File: gfortran.info,  Node: MVBITS,  Next: NEAREST,  Prev: MOVE_ALLOC,  Up: Intrinsic Procedures
  
! 9.194 'MVBITS' -- Move bits from one integer to another
  =======================================================
  
  _Description_:
!      Moves LEN bits from positions FROMPOS through 'FROMPOS+LEN-1' of
!      FROM to positions TOPOS through 'TOPOS+LEN-1' of TO.  The portion
       of argument TO not affected by the movement of bits is unchanged.
!      The values of 'FROMPOS+LEN-1' and 'TOPOS+LEN-1' must be less than
!      'BIT_SIZE(FROM)'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13904,13918 ****
       Elemental subroutine
  
  _Syntax_:
!      `CALL MVBITS(FROM, FROMPOS, LEN, TO, TOPOS)'
  
  _Arguments_:
!      FROM       The type shall be `INTEGER'.
!      FROMPOS    The type shall be `INTEGER'.
!      LEN        The type shall be `INTEGER'.
!      TO         The type shall be `INTEGER', of the same kind
!                 as FROM.
!      TOPOS      The type shall be `INTEGER'.
  
  _See also_:
       *note IBCLR::, *note IBSET::, *note IBITS::, *note IAND::, *note
--- 13758,13772 ----
       Elemental subroutine
  
  _Syntax_:
!      'CALL MVBITS(FROM, FROMPOS, LEN, TO, TOPOS)'
  
  _Arguments_:
!      FROM        The type shall be 'INTEGER'.
!      FROMPOS     The type shall be 'INTEGER'.
!      LEN         The type shall be 'INTEGER'.
!      TO          The type shall be 'INTEGER', of the same kind as
!                  FROM.
!      TOPOS       The type shall be 'INTEGER'.
  
  _See also_:
       *note IBCLR::, *note IBSET::, *note IBITS::, *note IAND::, *note
*************** _See also_:
*** 13921,13932 ****
  
  File: gfortran.info,  Node: NEAREST,  Next: NEW_LINE,  Prev: MVBITS,  Up: Intrinsic Procedures
  
! 9.195 `NEAREST' -- Nearest representable number
  ===============================================
  
  _Description_:
!      `NEAREST(X, S)' returns the processor-representable number nearest
!      to `X' in the direction indicated by the sign of `S'.
  
  _Standard_:
       Fortran 95 and later
--- 13775,13786 ----
  
  File: gfortran.info,  Node: NEAREST,  Next: NEW_LINE,  Prev: MVBITS,  Up: Intrinsic Procedures
  
! 9.195 'NEAREST' -- Nearest representable number
  ===============================================
  
  _Description_:
!      'NEAREST(X, S)' returns the processor-representable number nearest
!      to 'X' in the direction indicated by the sign of 'S'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 13935,13951 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = NEAREST(X, S)'
  
  _Arguments_:
!      X          Shall be of type `REAL'.
!      S          Shall be of type `REAL' and not equal to zero.
  
  _Return value_:
!      The return value is of the same type as `X'. If `S' is positive,
!      `NEAREST' returns the processor-representable number greater than
!      `X' and nearest to it. If `S' is negative, `NEAREST' returns the
!      processor-representable number smaller than `X' and nearest to it.
  
  _Example_:
            program test_nearest
--- 13789,13805 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = NEAREST(X, S)'
  
  _Arguments_:
!      X           Shall be of type 'REAL'.
!      S           Shall be of type 'REAL' and not equal to zero.
  
  _Return value_:
!      The return value is of the same type as 'X'.  If 'S' is positive,
!      'NEAREST' returns the processor-representable number greater than
!      'X' and nearest to it.  If 'S' is negative, 'NEAREST' returns the
!      processor-representable number smaller than 'X' and nearest to it.
  
  _Example_:
            program test_nearest
*************** _Example_:
*** 13958,13968 ****
  
  File: gfortran.info,  Node: NEW_LINE,  Next: NINT,  Prev: NEAREST,  Up: Intrinsic Procedures
  
! 9.196 `NEW_LINE' -- New line character
  ======================================
  
  _Description_:
!      `NEW_LINE(C)' returns the new-line character.
  
  _Standard_:
       Fortran 2003 and later
--- 13812,13822 ----
  
  File: gfortran.info,  Node: NEW_LINE,  Next: NINT,  Prev: NEAREST,  Up: Intrinsic Procedures
  
! 9.196 'NEW_LINE' -- New line character
  ======================================
  
  _Description_:
!      'NEW_LINE(C)' returns the new-line character.
  
  _Standard_:
       Fortran 2003 and later
*************** _Class_:
*** 13971,13981 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = NEW_LINE(C)'
  
  _Arguments_:
!      C          The argument shall be a scalar or array of the
!                 type `CHARACTER'.
  
  _Return value_:
       Returns a CHARACTER scalar of length one with the new-line
--- 13825,13835 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = NEW_LINE(C)'
  
  _Arguments_:
!      C           The argument shall be a scalar or array of the
!                  type 'CHARACTER'.
  
  _Return value_:
       Returns a CHARACTER scalar of length one with the new-line
*************** _Example_:
*** 13990,14000 ****
  
  File: gfortran.info,  Node: NINT,  Next: NORM2,  Prev: NEW_LINE,  Up: Intrinsic Procedures
  
! 9.197 `NINT' -- Nearest whole number
  ====================================
  
  _Description_:
!      `NINT(A)' rounds its argument to the nearest whole number.
  
  _Standard_:
       Fortran 77 and later, with KIND argument Fortran 90 and later
--- 13844,13854 ----
  
  File: gfortran.info,  Node: NINT,  Next: NORM2,  Prev: NEW_LINE,  Up: Intrinsic Procedures
  
! 9.197 'NINT' -- Nearest whole number
  ====================================
  
  _Description_:
!      'NINT(A)' rounds its argument to the nearest whole number.
  
  _Standard_:
       Fortran 77 and later, with KIND argument Fortran 90 and later
*************** _Class_:
*** 14003,14020 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = NINT(A [, KIND])'
  
  _Arguments_:
!      A          The type of the argument shall be `REAL'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
       Returns A with the fractional portion of its magnitude eliminated
       by rounding to the nearest whole number and with its sign
!      preserved, converted to an `INTEGER' of the default kind.
  
  _Example_:
            program test_nint
--- 13857,13874 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = NINT(A [, KIND])'
  
  _Arguments_:
!      A           The type of the argument shall be 'REAL'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
       Returns A with the fractional portion of its magnitude eliminated
       by rounding to the nearest whole number and with its sign
!      preserved, converted to an 'INTEGER' of the default kind.
  
  _Example_:
            program test_nint
*************** _Example_:
*** 14026,14045 ****
            end program test_nint
  
  _Specific names_:
!      Name          Argument      Return Type   Standard
!      `NINT(A)'     `REAL(4) A'   `INTEGER'     Fortran 95 and
!                                                later
!      `IDNINT(A)'   `REAL(8) A'   `INTEGER'     Fortran 95 and
!                                                later
  
  _See also_:
       *note CEILING::, *note FLOOR::
  
- 
  
  File: gfortran.info,  Node: NORM2,  Next: NOT,  Prev: NINT,  Up: Intrinsic Procedures
  
! 9.198 `NORM2' -- Euclidean vector norms
  =======================================
  
  _Description_:
--- 13880,13898 ----
            end program test_nint
  
  _Specific names_:
!      Name           Argument       Return Type    Standard
!      'NINT(A)'      'REAL(4) A'    'INTEGER'      Fortran 95 and
!                                                   later
!      'IDNINT(A)'    'REAL(8) A'    'INTEGER'      Fortran 95 and
!                                                   later
  
  _See also_:
       *note CEILING::, *note FLOOR::
  
  
  File: gfortran.info,  Node: NORM2,  Next: NOT,  Prev: NINT,  Up: Intrinsic Procedures
  
! 9.198 'NORM2' -- Euclidean vector norms
  =======================================
  
  _Description_:
*************** _Class_:
*** 14053,14073 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = NORM2(ARRAY[, DIM])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `REAL'
!      DIM        (Optional) shall be a scalar of type `INTEGER'
!                 with a value in the range from 1 to n, where n
!                 equals the rank of ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the square root of the sum of all
!      elements in ARRAY squared  is returned. Otherwise, an array of
!      rank n-1, where n equals the rank of ARRAY, and a shape similar to
!      that of ARRAY with dimension DIM dropped is returned.
  
  _Example_:
            PROGRAM test_sum
--- 13906,13926 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = NORM2(ARRAY[, DIM])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'REAL'
!      DIM         (Optional) shall be a scalar of type 'INTEGER'
!                  with a value in the range from 1 to n, where n
!                  equals the rank of ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the square root of the sum of all
!      elements in ARRAY squared is returned.  Otherwise, an array of rank
!      n-1, where n equals the rank of ARRAY, and a shape similar to that
!      of ARRAY with dimension DIM dropped is returned.
  
  _Example_:
            PROGRAM test_sum
*************** _Example_:
*** 14078,14088 ****
  
  File: gfortran.info,  Node: NOT,  Next: NULL,  Prev: NORM2,  Up: Intrinsic Procedures
  
! 9.199 `NOT' -- Logical negation
  ===============================
  
  _Description_:
!      `NOT' returns the bitwise Boolean inverse of I.
  
  _Standard_:
       Fortran 95 and later
--- 13931,13941 ----
  
  File: gfortran.info,  Node: NOT,  Next: NULL,  Prev: NORM2,  Up: Intrinsic Procedures
  
! 9.199 'NOT' -- Logical negation
  ===============================
  
  _Description_:
!      'NOT' returns the bitwise Boolean inverse of I.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 14091,14113 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = NOT(I)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
  
  _Return value_:
!      The return type is `INTEGER', of the same kind as the argument.
  
  _See also_:
       *note IAND::, *note IEOR::, *note IOR::, *note IBITS::, *note
       IBSET::, *note IBCLR::
  
- 
  
  File: gfortran.info,  Node: NULL,  Next: NUM_IMAGES,  Prev: NOT,  Up: Intrinsic Procedures
  
! 9.200 `NULL' -- Function that returns an disassociated pointer
  ==============================================================
  
  _Description_:
--- 13944,13965 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = NOT(I)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
  
  _Return value_:
!      The return type is 'INTEGER', of the same kind as the argument.
  
  _See also_:
       *note IAND::, *note IEOR::, *note IOR::, *note IBITS::, *note
       IBSET::, *note IBCLR::
  
  
  File: gfortran.info,  Node: NULL,  Next: NUM_IMAGES,  Prev: NOT,  Up: Intrinsic Procedures
  
! 9.200 'NULL' -- Function that returns an disassociated pointer
  ==============================================================
  
  _Description_:
*************** _Description_:
*** 14116,14122 ****
       If MOLD is present, a disassociated pointer of the same type is
       returned, otherwise the type is determined by context.
  
!      In Fortran 95, MOLD is optional. Please note that Fortran 2003
       includes cases where it is required.
  
  _Standard_:
--- 13968,13974 ----
       If MOLD is present, a disassociated pointer of the same type is
       returned, otherwise the type is determined by context.
  
!      In Fortran 95, MOLD is optional.  Please note that Fortran 2003
       includes cases where it is required.
  
  _Standard_:
*************** _Class_:
*** 14126,14136 ****
       Transformational function
  
  _Syntax_:
!      `PTR => NULL([MOLD])'
  
  _Arguments_:
!      MOLD       (Optional) shall be a pointer of any
!                 association status and of any type.
  
  _Return value_:
       A disassociated pointer.
--- 13978,13988 ----
       Transformational function
  
  _Syntax_:
!      'PTR => NULL([MOLD])'
  
  _Arguments_:
!      MOLD        (Optional) shall be a pointer of any association
!                  status and of any type.
  
  _Return value_:
       A disassociated pointer.
*************** _See also_:
*** 14144,14180 ****
  
  File: gfortran.info,  Node: NUM_IMAGES,  Next: OR,  Prev: NULL,  Up: Intrinsic Procedures
  
! 9.201 `NUM_IMAGES' -- Function that returns the number of images
  ================================================================
  
  _Description_:
       Returns the number of images.
  
  _Standard_:
!      Fortran 2008 and later. With DISTANCE or FAILED argument,
       Technical Specification (TS) 18508 or later
  
  _Class_:
       Transformational function
  
  _Syntax_:
!      `RESULT = NUM_IMAGES(DISTANCE, FAILED)'
  
  _Arguments_:
!      DISTANCE   (optional, intent(in)) Nonnegative scalar
!                 integer
!      FAILED     (optional, intent(in)) Scalar logical
!                 expression
  
  _Return value_:
       Scalar default-kind integer.  If DISTANCE is not present or has
!      value 0, the number of images in the current team is returned. For
       values smaller or equal distance to the initial team, it returns
       the number of images index on the ancestor team which has a
!      distance of DISTANCE from the invoking team. If DISTANCE is larger
       than the distance to the initial team, the number of images of the
!      initial team is returned. If FAILED is not present the total
!      number of images is returned; if it has the value `.TRUE.', the
       number of failed images is returned, otherwise, the number of
       images which do have not the failed status.
  
--- 13996,14031 ----
  
  File: gfortran.info,  Node: NUM_IMAGES,  Next: OR,  Prev: NULL,  Up: Intrinsic Procedures
  
! 9.201 'NUM_IMAGES' -- Function that returns the number of images
  ================================================================
  
  _Description_:
       Returns the number of images.
  
  _Standard_:
!      Fortran 2008 and later.  With DISTANCE or FAILED argument,
       Technical Specification (TS) 18508 or later
  
  _Class_:
       Transformational function
  
  _Syntax_:
!      'RESULT = NUM_IMAGES(DISTANCE, FAILED)'
  
  _Arguments_:
!      DISTANCE    (optional, intent(in)) Nonnegative scalar
!                  integer
!      FAILED      (optional, intent(in)) Scalar logical expression
  
  _Return value_:
       Scalar default-kind integer.  If DISTANCE is not present or has
!      value 0, the number of images in the current team is returned.  For
       values smaller or equal distance to the initial team, it returns
       the number of images index on the ancestor team which has a
!      distance of DISTANCE from the invoking team.  If DISTANCE is larger
       than the distance to the initial team, the number of images of the
!      initial team is returned.  If FAILED is not present the total
!      number of images is returned; if it has the value '.TRUE.', the
       number of failed images is returned, otherwise, the number of
       images which do have not the failed status.
  
*************** _See also_:
*** 14195,14205 ****
  
  File: gfortran.info,  Node: OR,  Next: PACK,  Prev: NUM_IMAGES,  Up: Intrinsic Procedures
  
! 9.202 `OR' -- Bitwise logical OR
  ================================
  
  _Description_:
!      Bitwise logical `OR'.
  
       This intrinsic routine is provided for backwards compatibility with
       GNU Fortran 77.  For integer arguments, programmers should consider
--- 14046,14056 ----
  
  File: gfortran.info,  Node: OR,  Next: PACK,  Prev: NUM_IMAGES,  Up: Intrinsic Procedures
  
! 9.202 'OR' -- Bitwise logical OR
  ================================
  
  _Description_:
!      Bitwise logical 'OR'.
  
       This intrinsic routine is provided for backwards compatibility with
       GNU Fortran 77.  For integer arguments, programmers should consider
*************** _Class_:
*** 14213,14230 ****
       Function
  
  _Syntax_:
!      `RESULT = OR(I, J)'
  
  _Arguments_:
!      I          The type shall be either a scalar `INTEGER'
!                 type or a scalar `LOGICAL' type.
!      J          The type shall be the same as the type of J.
  
  _Return value_:
!      The return type is either a scalar `INTEGER' or a scalar
!      `LOGICAL'.  If the kind type parameters differ, then the smaller
!      kind type is implicitly converted to larger kind, and the return
!      has the larger kind.
  
  _Example_:
            PROGRAM test_or
--- 14064,14081 ----
       Function
  
  _Syntax_:
!      'RESULT = OR(I, J)'
  
  _Arguments_:
!      I           The type shall be either a scalar 'INTEGER' type
!                  or a scalar 'LOGICAL' type.
!      J           The type shall be the same as the type of J.
  
  _Return value_:
!      The return type is either a scalar 'INTEGER' or a scalar 'LOGICAL'.
!      If the kind type parameters differ, then the smaller kind type is
!      implicitly converted to larger kind, and the return has the larger
!      kind.
  
  _Example_:
            PROGRAM test_or
*************** _See also_:
*** 14242,14255 ****
  
  File: gfortran.info,  Node: PACK,  Next: PARITY,  Prev: OR,  Up: Intrinsic Procedures
  
! 9.203 `PACK' -- Pack an array into an array of rank one
  =======================================================
  
  _Description_:
       Stores the elements of ARRAY in an array of rank one.
  
       The beginning of the resulting array is made up of elements whose
!      MASK equals `TRUE'. Afterwards, positions are filled with elements
       taken from VECTOR.
  
  _Standard_:
--- 14093,14106 ----
  
  File: gfortran.info,  Node: PACK,  Next: PARITY,  Prev: OR,  Up: Intrinsic Procedures
  
! 9.203 'PACK' -- Pack an array into an array of rank one
  =======================================================
  
  _Description_:
       Stores the elements of ARRAY in an array of rank one.
  
       The beginning of the resulting array is made up of elements whose
!      MASK equals 'TRUE'.  Afterwards, positions are filled with elements
       taken from VECTOR.
  
  _Standard_:
*************** _Class_:
*** 14259,14283 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = PACK(ARRAY, MASK[,VECTOR])'
  
  _Arguments_:
!      ARRAY      Shall be an array of any type.
!      MASK       Shall be an array of type `LOGICAL' and of the
!                 same size as ARRAY. Alternatively, it may be a
!                 `LOGICAL' scalar.
!      VECTOR     (Optional) shall be an array of the same type
!                 as ARRAY and of rank one. If present, the
!                 number of elements in VECTOR shall be equal to
!                 or greater than the number of true elements in
!                 MASK. If MASK is scalar, the number of
!                 elements in VECTOR shall be equal to or
!                 greater than the number of elements in ARRAY.
  
  _Return value_:
       The result is an array of rank one and the same type as that of
       ARRAY.  If VECTOR is present, the result size is that of VECTOR,
!      the number of `TRUE' values in MASK otherwise.
  
  _Example_:
       Gathering nonzero elements from an array:
--- 14110,14134 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = PACK(ARRAY, MASK[,VECTOR])'
  
  _Arguments_:
!      ARRAY       Shall be an array of any type.
!      MASK        Shall be an array of type 'LOGICAL' and of the
!                  same size as ARRAY.  Alternatively, it may be a
!                  'LOGICAL' scalar.
!      VECTOR      (Optional) shall be an array of the same type as
!                  ARRAY and of rank one.  If present, the number
!                  of elements in VECTOR shall be equal to or
!                  greater than the number of true elements in
!                  MASK.  If MASK is scalar, the number of elements
!                  in VECTOR shall be equal to or greater than the
!                  number of elements in ARRAY.
  
  _Return value_:
       The result is an array of rank one and the same type as that of
       ARRAY.  If VECTOR is present, the result size is that of VECTOR,
!      the number of 'TRUE' values in MASK otherwise.
  
  _Example_:
       Gathering nonzero elements from an array:
*************** _See also_:
*** 14301,14311 ****
  
  File: gfortran.info,  Node: PARITY,  Next: PERROR,  Prev: PACK,  Up: Intrinsic Procedures
  
! 9.204 `PARITY' -- Reduction with exclusive OR
  =============================================
  
  _Description_:
!      Calculates the parity, i.e. the reduction using `.XOR.', of MASK
       along dimension DIM.
  
  _Standard_:
--- 14152,14162 ----
  
  File: gfortran.info,  Node: PARITY,  Next: PERROR,  Prev: PACK,  Up: Intrinsic Procedures
  
! 9.204 'PARITY' -- Reduction with exclusive OR
  =============================================
  
  _Description_:
!      Calculates the parity, i.e.  the reduction using '.XOR.', of MASK
       along dimension DIM.
  
  _Standard_:
*************** _Class_:
*** 14315,14333 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = PARITY(MASK[, DIM])'
  
  _Arguments_:
!      LOGICAL    Shall be an array of type `LOGICAL'
!      DIM        (Optional) shall be a scalar of type `INTEGER'
!                 with a value in the range from 1 to n, where n
!                 equals the rank of MASK.
  
  _Return value_:
       The result is of the same type as MASK.
  
       If DIM is absent, a scalar with the parity of all elements in MASK
!      is returned, i.e. true if an odd number of elements is `.true.'
       and false otherwise.  If DIM is present, an array of rank n-1,
       where n equals the rank of ARRAY, and a shape similar to that of
       MASK with dimension DIM dropped is returned.
--- 14166,14184 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = PARITY(MASK[, DIM])'
  
  _Arguments_:
!      LOGICAL     Shall be an array of type 'LOGICAL'
!      DIM         (Optional) shall be a scalar of type 'INTEGER'
!                  with a value in the range from 1 to n, where n
!                  equals the rank of MASK.
  
  _Return value_:
       The result is of the same type as MASK.
  
       If DIM is absent, a scalar with the parity of all elements in MASK
!      is returned, i.e.  true if an odd number of elements is '.true.'
       and false otherwise.  If DIM is present, an array of rank n-1,
       where n equals the rank of ARRAY, and a shape similar to that of
       MASK with dimension DIM dropped is returned.
*************** _Example_:
*** 14341,14353 ****
  
  File: gfortran.info,  Node: PERROR,  Next: POPCNT,  Prev: PARITY,  Up: Intrinsic Procedures
  
! 9.205 `PERROR' -- Print system error message
  ============================================
  
  _Description_:
!      Prints (on the C `stderr' stream) a newline-terminated error
!      message corresponding to the last system error. This is prefixed by
!      STRING, a colon and a space. See `perror(3)'.
  
  _Standard_:
       GNU extension
--- 14192,14204 ----
  
  File: gfortran.info,  Node: PERROR,  Next: POPCNT,  Prev: PARITY,  Up: Intrinsic Procedures
  
! 9.205 'PERROR' -- Print system error message
  ============================================
  
  _Description_:
!      Prints (on the C 'stderr' stream) a newline-terminated error
!      message corresponding to the last system error.  This is prefixed
!      by STRING, a colon and a space.  See 'perror(3)'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 14356,14366 ****
       Subroutine
  
  _Syntax_:
!      `CALL PERROR(STRING)'
  
  _Arguments_:
!      STRING     A scalar of type `CHARACTER' and of the
!                 default kind.
  
  _See also_:
       *note IERRNO::
--- 14207,14217 ----
       Subroutine
  
  _Syntax_:
!      'CALL PERROR(STRING)'
  
  _Arguments_:
!      STRING      A scalar of type 'CHARACTER' and of the default
!                  kind.
  
  _See also_:
       *note IERRNO::
*************** _See also_:
*** 14368,14379 ****
  
  File: gfortran.info,  Node: POPCNT,  Next: POPPAR,  Prev: PERROR,  Up: Intrinsic Procedures
  
! 9.206 `POPCNT' -- Number of bits set
  ====================================
  
  _Description_:
!      `POPCNT(I)' returns the number of bits set ('1' bits) in the binary
!      representation of `I'.
  
  _Standard_:
       Fortran 2008 and later
--- 14219,14230 ----
  
  File: gfortran.info,  Node: POPCNT,  Next: POPPAR,  Prev: PERROR,  Up: Intrinsic Procedures
  
! 9.206 'POPCNT' -- Number of bits set
  ====================================
  
  _Description_:
!      'POPCNT(I)' returns the number of bits set ('1' bits) in the binary
!      representation of 'I'.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 14382,14394 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = POPCNT(I)'
  
  _Arguments_:
!      I          Shall be of type `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the default integer
       kind.
  
  _See also_:
--- 14233,14245 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = POPCNT(I)'
  
  _Arguments_:
!      I           Shall be of type 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the default integer
       kind.
  
  _See also_:
*************** _Example_:
*** 14404,14416 ****
  
  File: gfortran.info,  Node: POPPAR,  Next: PRECISION,  Prev: POPCNT,  Up: Intrinsic Procedures
  
! 9.207 `POPPAR' -- Parity of the number of bits set
  ==================================================
  
  _Description_:
!      `POPPAR(I)' returns parity of the integer `I', i.e. the parity of
       the number of bits set ('1' bits) in the binary representation of
!      `I'. It is equal to 0 if `I' has an even number of bits set, and 1
       for an odd number of '1' bits.
  
  _Standard_:
--- 14255,14267 ----
  
  File: gfortran.info,  Node: POPPAR,  Next: PRECISION,  Prev: POPCNT,  Up: Intrinsic Procedures
  
! 9.207 'POPPAR' -- Parity of the number of bits set
  ==================================================
  
  _Description_:
!      'POPPAR(I)' returns parity of the integer 'I', i.e.  the parity of
       the number of bits set ('1' bits) in the binary representation of
!      'I'.  It is equal to 0 if 'I' has an even number of bits set, and 1
       for an odd number of '1' bits.
  
  _Standard_:
*************** _Class_:
*** 14420,14432 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = POPPAR(I)'
  
  _Arguments_:
!      I          Shall be of type `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the default integer
       kind.
  
  _See also_:
--- 14271,14283 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = POPPAR(I)'
  
  _Arguments_:
!      I           Shall be of type 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the default integer
       kind.
  
  _See also_:
*************** _Example_:
*** 14442,14453 ****
  
  File: gfortran.info,  Node: PRECISION,  Next: PRESENT,  Prev: POPPAR,  Up: Intrinsic Procedures
  
! 9.208 `PRECISION' -- Decimal precision of a real kind
  =====================================================
  
  _Description_:
!      `PRECISION(X)' returns the decimal precision in the model of the
!      type of `X'.
  
  _Standard_:
       Fortran 95 and later
--- 14293,14304 ----
  
  File: gfortran.info,  Node: PRECISION,  Next: PRESENT,  Prev: POPPAR,  Up: Intrinsic Procedures
  
! 9.208 'PRECISION' -- Decimal precision of a real kind
  =====================================================
  
  _Description_:
!      'PRECISION(X)' returns the decimal precision in the model of the
!      type of 'X'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 14456,14468 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = PRECISION(X)'
  
  _Arguments_:
!      X          Shall be of type `REAL' or `COMPLEX'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the default integer
       kind.
  
  _See also_:
--- 14307,14319 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = PRECISION(X)'
  
  _Arguments_:
!      X           Shall be of type 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the default integer
       kind.
  
  _See also_:
*************** _Example_:
*** 14480,14486 ****
  
  File: gfortran.info,  Node: PRESENT,  Next: PRODUCT,  Prev: PRECISION,  Up: Intrinsic Procedures
  
! 9.209 `PRESENT' -- Determine whether an optional dummy argument is specified
  ============================================================================
  
  _Description_:
--- 14331,14337 ----
  
  File: gfortran.info,  Node: PRESENT,  Next: PRODUCT,  Prev: PRECISION,  Up: Intrinsic Procedures
  
! 9.209 'PRESENT' -- Determine whether an optional dummy argument is specified
  ============================================================================
  
  _Description_:
*************** _Class_:
*** 14493,14510 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = PRESENT(A)'
  
  _Arguments_:
!      A          May be of any type and may be a pointer,
!                 scalar or array value, or a dummy procedure.
!                 It shall be the name of an optional dummy
!                 argument accessible within the current
!                 subroutine or function.
  
  _Return value_:
!      Returns either `TRUE' if the optional argument A is present, or
!      `FALSE' otherwise.
  
  _Example_:
            PROGRAM test_present
--- 14344,14361 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = PRESENT(A)'
  
  _Arguments_:
!      A           May be of any type and may be a pointer, scalar
!                  or array value, or a dummy procedure.  It shall
!                  be the name of an optional dummy argument
!                  accessible within the current subroutine or
!                  function.
  
  _Return value_:
!      Returns either 'TRUE' if the optional argument A is present, or
!      'FALSE' otherwise.
  
  _Example_:
            PROGRAM test_present
*************** _Example_:
*** 14519,14530 ****
  
  File: gfortran.info,  Node: PRODUCT,  Next: RADIX,  Prev: PRESENT,  Up: Intrinsic Procedures
  
! 9.210 `PRODUCT' -- Product of array elements
  ============================================
  
  _Description_:
       Multiplies the elements of ARRAY along dimension DIM if the
!      corresponding element in MASK is `TRUE'.
  
  _Standard_:
       Fortran 95 and later
--- 14370,14381 ----
  
  File: gfortran.info,  Node: PRODUCT,  Next: RADIX,  Prev: PRESENT,  Up: Intrinsic Procedures
  
! 9.210 'PRODUCT' -- Product of array elements
  ============================================
  
  _Description_:
       Multiplies the elements of ARRAY along dimension DIM if the
!      corresponding element in MASK is 'TRUE'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 14533,14556 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = PRODUCT(ARRAY[, MASK])'
!      `RESULT = PRODUCT(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `INTEGER', `REAL' or
!                 `COMPLEX'.
!      DIM        (Optional) shall be a scalar of type `INTEGER'
!                 with a value in the range from 1 to n, where n
!                 equals the rank of ARRAY.
!      MASK       (Optional) shall be of type `LOGICAL' and
!                 either be a scalar or an array of the same
!                 shape as ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the product of all elements in
!      ARRAY is returned. Otherwise, an array of rank n-1, where n equals
       the rank of ARRAY, and a shape similar to that of ARRAY with
       dimension DIM dropped is returned.
  
--- 14384,14407 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = PRODUCT(ARRAY[, MASK])'
!      'RESULT = PRODUCT(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'INTEGER', 'REAL' or
!                  'COMPLEX'.
!      DIM         (Optional) shall be a scalar of type 'INTEGER'
!                  with a value in the range from 1 to n, where n
!                  equals the rank of ARRAY.
!      MASK        (Optional) shall be of type 'LOGICAL' and either
!                  be a scalar or an array of the same shape as
!                  ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
       If DIM is absent, a scalar with the product of all elements in
!      ARRAY is returned.  Otherwise, an array of rank n-1, where n equals
       the rank of ARRAY, and a shape similar to that of ARRAY with
       dimension DIM dropped is returned.
  
*************** _See also_:
*** 14567,14577 ****
  
  File: gfortran.info,  Node: RADIX,  Next: RAN,  Prev: PRODUCT,  Up: Intrinsic Procedures
  
! 9.211 `RADIX' -- Base of a model number
  =======================================
  
  _Description_:
!      `RADIX(X)' returns the base of the model representing the entity X.
  
  _Standard_:
       Fortran 95 and later
--- 14418,14428 ----
  
  File: gfortran.info,  Node: RADIX,  Next: RAN,  Prev: PRODUCT,  Up: Intrinsic Procedures
  
! 9.211 'RADIX' -- Base of a model number
  =======================================
  
  _Description_:
!      'RADIX(X)' returns the base of the model representing the entity X.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 14580,14592 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = RADIX(X)'
  
  _Arguments_:
!      X          Shall be of type `INTEGER' or `REAL'
  
  _Return value_:
!      The return value is a scalar of type `INTEGER' and of the default
       integer kind.
  
  _See also_:
--- 14431,14443 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = RADIX(X)'
  
  _Arguments_:
!      X           Shall be of type 'INTEGER' or 'REAL'
  
  _Return value_:
!      The return value is a scalar of type 'INTEGER' and of the default
       integer kind.
  
  _See also_:
*************** _Example_:
*** 14598,14613 ****
              print *, "The radix for the default real kind is", radix(0.0)
            end program test_radix
  
- 
  
  File: gfortran.info,  Node: RAN,  Next: RAND,  Prev: RADIX,  Up: Intrinsic Procedures
  
! 9.212 `RAN' -- Real pseudo-random number
  ========================================
  
  _Description_:
!      For compatibility with HP FORTRAN 77/iX, the `RAN' intrinsic is
!      provided as an alias for `RAND'.  See *note RAND:: for complete
       documentation.
  
  _Standard_:
--- 14449,14463 ----
              print *, "The radix for the default real kind is", radix(0.0)
            end program test_radix
  
  
  File: gfortran.info,  Node: RAN,  Next: RAND,  Prev: RADIX,  Up: Intrinsic Procedures
  
! 9.212 'RAN' -- Real pseudo-random number
  ========================================
  
  _Description_:
!      For compatibility with HP FORTRAN 77/iX, the 'RAN' intrinsic is
!      provided as an alias for 'RAND'.  See *note RAND:: for complete
       documentation.
  
  _Standard_:
*************** _See also_:
*** 14622,14641 ****
  
  File: gfortran.info,  Node: RAND,  Next: RANDOM_NUMBER,  Prev: RAN,  Up: Intrinsic Procedures
  
! 9.213 `RAND' -- Real pseudo-random number
  =========================================
  
  _Description_:
!      `RAND(FLAG)' returns a pseudo-random number from a uniform
!      distribution between 0 and 1. If FLAG is 0, the next number in the
       current sequence is returned; if FLAG is 1, the generator is
!      restarted by `CALL SRAND(0)'; if FLAG has any other value, it is
!      used as a new seed with `SRAND'.
  
       This intrinsic routine is provided for backwards compatibility with
!      GNU Fortran 77. It implements a simple modulo generator as provided
!      by `g77'. For new code, one should consider the use of *note
!      RANDOM_NUMBER:: as it implements a superior algorithm.
  
  _Standard_:
       GNU extension
--- 14472,14491 ----
  
  File: gfortran.info,  Node: RAND,  Next: RANDOM_NUMBER,  Prev: RAN,  Up: Intrinsic Procedures
  
! 9.213 'RAND' -- Real pseudo-random number
  =========================================
  
  _Description_:
!      'RAND(FLAG)' returns a pseudo-random number from a uniform
!      distribution between 0 and 1.  If FLAG is 0, the next number in the
       current sequence is returned; if FLAG is 1, the generator is
!      restarted by 'CALL SRAND(0)'; if FLAG has any other value, it is
!      used as a new seed with 'SRAND'.
  
       This intrinsic routine is provided for backwards compatibility with
!      GNU Fortran 77.  It implements a simple modulo generator as
!      provided by 'g77'.  For new code, one should consider the use of
!      *note RANDOM_NUMBER:: as it implements a superior algorithm.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 14644,14656 ****
       Function
  
  _Syntax_:
!      `RESULT = RAND(I)'
  
  _Arguments_:
!      I          Shall be a scalar `INTEGER' of kind 4.
  
  _Return value_:
!      The return value is of `REAL' type and the default kind.
  
  _Example_:
            program test_rand
--- 14494,14506 ----
       Function
  
  _Syntax_:
!      'RESULT = RAND(I)'
  
  _Arguments_:
!      I           Shall be a scalar 'INTEGER' of kind 4.
  
  _Return value_:
!      The return value is of 'REAL' type and the default kind.
  
  _Example_:
            program test_rand
*************** _Example_:
*** 14664,14698 ****
  _See also_:
       *note SRAND::, *note RANDOM_NUMBER::
  
- 
  
  File: gfortran.info,  Node: RANDOM_NUMBER,  Next: RANDOM_SEED,  Prev: RAND,  Up: Intrinsic Procedures
  
! 9.214 `RANDOM_NUMBER' -- Pseudo-random number
  =============================================
  
  _Description_:
       Returns a single pseudorandom number or an array of pseudorandom
!      numbers from the uniform distribution over the range  0 \leq x < 1.
  
       The runtime-library implements George Marsaglia's KISS (Keep It
       Simple Stupid) random number generator (RNG). This RNG combines:
         1. The congruential generator x(n) = 69069 \cdot x(n-1) +
!           1327217885 with a period of 2^32,
! 
!        2. A 3-shift shift-register generator with a period of 2^32 - 1,
! 
         3. Two 16-bit multiply-with-carry generators with a period of
!           597273182964842497 > 2^59.
!           The overall period exceeds 2^123.
  
       Please note, this RNG is thread safe if used within OpenMP
       directives, i.e., its state will be consistent while called from
       multiple threads.  However, the KISS generator does not create
       random numbers in parallel from multiple sources, but in sequence
!      from a single source. If an OpenMP-enabled application heavily
!      relies on random numbers, one should consider employing a
!      dedicated parallel random number generator instead.
  
  _Standard_:
       Fortran 95 and later
--- 14514,14546 ----
  _See also_:
       *note SRAND::, *note RANDOM_NUMBER::
  
  
  File: gfortran.info,  Node: RANDOM_NUMBER,  Next: RANDOM_SEED,  Prev: RAND,  Up: Intrinsic Procedures
  
! 9.214 'RANDOM_NUMBER' -- Pseudo-random number
  =============================================
  
  _Description_:
       Returns a single pseudorandom number or an array of pseudorandom
!      numbers from the uniform distribution over the range 0 \leq x < 1.
  
       The runtime-library implements George Marsaglia's KISS (Keep It
       Simple Stupid) random number generator (RNG). This RNG combines:
         1. The congruential generator x(n) = 69069 \cdot x(n-1) +
!           1327217885 with a period of 2^{32},
!        2. A 3-shift shift-register generator with a period of 2^{32} -
!           1,
         3. Two 16-bit multiply-with-carry generators with a period of
!           597273182964842497 > 2^{59}.
!      The overall period exceeds 2^{123}.
  
       Please note, this RNG is thread safe if used within OpenMP
       directives, i.e., its state will be consistent while called from
       multiple threads.  However, the KISS generator does not create
       random numbers in parallel from multiple sources, but in sequence
!      from a single source.  If an OpenMP-enabled application heavily
!      relies on random numbers, one should consider employing a dedicated
!      parallel random number generator instead.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 14701,14710 ****
       Subroutine
  
  _Syntax_:
!      `RANDOM_NUMBER(HARVEST)'
  
  _Arguments_:
!      HARVEST    Shall be a scalar or an array of type `REAL'.
  
  _Example_:
            program test_random_number
--- 14549,14558 ----
       Subroutine
  
  _Syntax_:
!      'RANDOM_NUMBER(HARVEST)'
  
  _Arguments_:
!      HARVEST     Shall be a scalar or an array of type 'REAL'.
  
  _Example_:
            program test_random_number
*************** _See also_:
*** 14719,14737 ****
  
  File: gfortran.info,  Node: RANDOM_SEED,  Next: RANGE,  Prev: RANDOM_NUMBER,  Up: Intrinsic Procedures
  
! 9.215 `RANDOM_SEED' -- Initialize a pseudo-random number sequence
  =================================================================
  
  _Description_:
       Restarts or queries the state of the pseudorandom number generator
!      used by `RANDOM_NUMBER'.
  
!      If `RANDOM_SEED' is called without arguments, it is initialized to
!      a default state. The example below shows how to initialize the
       random seed with a varying seed in order to ensure a different
!      random number sequence for each invocation of the program. Note
!      that setting any of the seed values to zero should be avoided as
!      it can result in poor quality random numbers being generated.
  
  _Standard_:
       Fortran 95 and later
--- 14567,14585 ----
  
  File: gfortran.info,  Node: RANDOM_SEED,  Next: RANGE,  Prev: RANDOM_NUMBER,  Up: Intrinsic Procedures
  
! 9.215 'RANDOM_SEED' -- Initialize a pseudo-random number sequence
  =================================================================
  
  _Description_:
       Restarts or queries the state of the pseudorandom number generator
!      used by 'RANDOM_NUMBER'.
  
!      If 'RANDOM_SEED' is called without arguments, it is initialized to
!      a default state.  The example below shows how to initialize the
       random seed with a varying seed in order to ensure a different
!      random number sequence for each invocation of the program.  Note
!      that setting any of the seed values to zero should be avoided as it
!      can result in poor quality random numbers being generated.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 14740,14762 ****
       Subroutine
  
  _Syntax_:
!      `CALL RANDOM_SEED([SIZE, PUT, GET])'
  
  _Arguments_:
!      SIZE       (Optional) Shall be a scalar and of type
!                 default `INTEGER', with `INTENT(OUT)'. It
!                 specifies the minimum size of the arrays used
!                 with the PUT and GET arguments.
!      PUT        (Optional) Shall be an array of type default
!                 `INTEGER' and rank one. It is `INTENT(IN)' and
!                 the size of the array must be larger than or
!                 equal to the number returned by the SIZE
!                 argument.
!      GET        (Optional) Shall be an array of type default
!                 `INTEGER' and rank one. It is `INTENT(OUT)'
!                 and the size of the array must be larger than
!                 or equal to the number returned by the SIZE
!                 argument.
  
  _Example_:
            subroutine init_random_seed()
--- 14588,14610 ----
       Subroutine
  
  _Syntax_:
!      'CALL RANDOM_SEED([SIZE, PUT, GET])'
  
  _Arguments_:
!      SIZE        (Optional) Shall be a scalar and of type default
!                  'INTEGER', with 'INTENT(OUT)'.  It specifies the
!                  minimum size of the arrays used with the PUT and
!                  GET arguments.
!      PUT         (Optional) Shall be an array of type default
!                  'INTEGER' and rank one.  It is 'INTENT(IN)' and
!                  the size of the array must be larger than or
!                  equal to the number returned by the SIZE
!                  argument.
!      GET         (Optional) Shall be an array of type default
!                  'INTEGER' and rank one.  It is 'INTENT(OUT)' and
!                  the size of the array must be larger than or
!                  equal to the number returned by the SIZE
!                  argument.
  
  _Example_:
            subroutine init_random_seed()
*************** _See also_:
*** 14817,14828 ****
  
  File: gfortran.info,  Node: RANGE,  Next: RANK,  Prev: RANDOM_SEED,  Up: Intrinsic Procedures
  
! 9.216 `RANGE' -- Decimal exponent range
  =======================================
  
  _Description_:
!      `RANGE(X)' returns the decimal exponent range in the model of the
!      type of `X'.
  
  _Standard_:
       Fortran 95 and later
--- 14665,14676 ----
  
  File: gfortran.info,  Node: RANGE,  Next: RANK,  Prev: RANDOM_SEED,  Up: Intrinsic Procedures
  
! 9.216 'RANGE' -- Decimal exponent range
  =======================================
  
  _Description_:
!      'RANGE(X)' returns the decimal exponent range in the model of the
!      type of 'X'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 14831,14860 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = RANGE(X)'
  
  _Arguments_:
!      X          Shall be of type `INTEGER', `REAL' or
!                 `COMPLEX'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the default integer
       kind.
  
  _See also_:
       *note SELECTED_REAL_KIND::, *note PRECISION::
  
  _Example_:
!      See `PRECISION' for an example.
  
  
  File: gfortran.info,  Node: RANK,  Next: REAL,  Prev: RANGE,  Up: Intrinsic Procedures
  
! 9.217 `RANK' -- Rank of a data object
  =====================================
  
  _Description_:
!      `RANK(A)' returns the rank of a scalar or array data object.
  
  _Standard_:
       Technical Specification (TS) 29113
--- 14679,14707 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = RANGE(X)'
  
  _Arguments_:
!      X           Shall be of type 'INTEGER', 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the default integer
       kind.
  
  _See also_:
       *note SELECTED_REAL_KIND::, *note PRECISION::
  
  _Example_:
!      See 'PRECISION' for an example.
  
  
  File: gfortran.info,  Node: RANK,  Next: REAL,  Prev: RANGE,  Up: Intrinsic Procedures
  
! 9.217 'RANK' -- Rank of a data object
  =====================================
  
  _Description_:
!      'RANK(A)' returns the rank of a scalar or array data object.
  
  _Standard_:
       Technical Specification (TS) 29113
*************** _Class_:
*** 14863,14876 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = RANK(A)'
  
  _Arguments_:
!      A          can be of any type
  
  _Return value_:
!      The return value is of type `INTEGER' and of the default integer
!      kind. For arrays, their rank is returned; for scalars zero is
       returned.
  
  _Example_:
--- 14710,14723 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = RANK(A)'
  
  _Arguments_:
!      A           can be of any type
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the default integer
!      kind.  For arrays, their rank is returned; for scalars zero is
       returned.
  
  _Example_:
*************** _Example_:
*** 14881,14896 ****
              print *, rank(a), rank(b) ! Prints:  0  2
            end program test_rank
  
- 
  
  File: gfortran.info,  Node: REAL,  Next: RENAME,  Prev: RANK,  Up: Intrinsic Procedures
  
! 9.218 `REAL' -- Convert to real type
  ====================================
  
  _Description_:
!      `REAL(A [, KIND])' converts its argument A to a real type.  The
!      `REALPART' function is provided for compatibility with `g77', and
       its use is strongly discouraged.
  
  _Standard_:
--- 14728,14742 ----
              print *, rank(a), rank(b) ! Prints:  0  2
            end program test_rank
  
  
  File: gfortran.info,  Node: REAL,  Next: RENAME,  Prev: RANK,  Up: Intrinsic Procedures
  
! 9.218 'REAL' -- Convert to real type
  ====================================
  
  _Description_:
!      'REAL(A [, KIND])' converts its argument A to a real type.  The
!      'REALPART' function is provided for compatibility with 'g77', and
       its use is strongly discouraged.
  
  _Standard_:
*************** _Class_:
*** 14900,14928 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = REAL(A [, KIND])'
!      `RESULT = REALPART(Z)'
  
  _Arguments_:
!      A          Shall be `INTEGER', `REAL', or `COMPLEX'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      These functions return a `REAL' variable or array under the
       following rules:
  
!     (A)
!           `REAL(A)' is converted to a default real type if A is an
            integer or real variable.
! 
!     (B)
!           `REAL(A)' is converted to a real type with the kind type
            parameter of A if A is a complex variable.
! 
!     (C)
!           `REAL(A, KIND)' is converted to a real type with kind type
            parameter KIND if A is a complex, integer, or real variable.
  
  _Example_:
--- 14746,14772 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = REAL(A [, KIND])'
!      'RESULT = REALPART(Z)'
  
  _Arguments_:
!      A           Shall be 'INTEGER', 'REAL', or 'COMPLEX'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      These functions return a 'REAL' variable or array under the
       following rules:
  
!      (A)
!           'REAL(A)' is converted to a default real type if A is an
            integer or real variable.
!      (B)
!           'REAL(A)' is converted to a real type with the kind type
            parameter of A if A is a complex variable.
!      (C)
!           'REAL(A, KIND)' is converted to a real type with kind type
            parameter KIND if A is a complex, integer, or real variable.
  
  _Example_:
*************** _Example_:
*** 14932,14960 ****
            end program test_real
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `FLOAT(A)'    `INTEGER(4)'  `REAL(4)'     Fortran 77 and
!                                                later
!      `DFLOAT(A)'   `INTEGER(4)'  `REAL(8)'     GNU extension
!      `SNGL(A)'     `INTEGER(8)'  `REAL(4)'     Fortran 77 and
!                                                later
  
  _See also_:
       *note DBLE::
  
- 
  
  File: gfortran.info,  Node: RENAME,  Next: REPEAT,  Prev: REAL,  Up: Intrinsic Procedures
  
! 9.219 `RENAME' -- Rename a file
  ===============================
  
  _Description_:
!      Renames a file from file PATH1 to PATH2. A null character
!      (`CHAR(0)') can be used to mark the end of the names in PATH1 and
       PATH2; otherwise, trailing blanks in the file names are ignored.
       If the STATUS argument is supplied, it contains 0 on success or a
!      nonzero error code upon return; see `rename(2)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 14776,14803 ----
            end program test_real
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'FLOAT(A)'     'INTEGER(4)'   'REAL(4)'      Fortran 77 and
!                                                   later
!      'DFLOAT(A)'    'INTEGER(4)'   'REAL(8)'      GNU extension
!      'SNGL(A)'      'INTEGER(8)'   'REAL(4)'      Fortran 77 and
!                                                   later
  
  _See also_:
       *note DBLE::
  
  
  File: gfortran.info,  Node: RENAME,  Next: REPEAT,  Prev: REAL,  Up: Intrinsic Procedures
  
! 9.219 'RENAME' -- Rename a file
  ===============================
  
  _Description_:
!      Renames a file from file PATH1 to PATH2.  A null character
!      ('CHAR(0)') can be used to mark the end of the names in PATH1 and
       PATH2; otherwise, trailing blanks in the file names are ignored.
       If the STATUS argument is supplied, it contains 0 on success or a
!      nonzero error code upon return; see 'rename(2)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 14966,14987 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL RENAME(PATH1, PATH2 [, STATUS])'
!      `STATUS = RENAME(PATH1, PATH2)'
  
  _Arguments_:
!      PATH1      Shall be of default `CHARACTER' type.
!      PATH2      Shall be of default `CHARACTER' type.
!      STATUS     (Optional) Shall be of default `INTEGER' type.
  
  _See also_:
       *note LINK::
  
- 
  
  File: gfortran.info,  Node: REPEAT,  Next: RESHAPE,  Prev: RENAME,  Up: Intrinsic Procedures
  
! 9.220 `REPEAT' -- Repeated string concatenation
  ===============================================
  
  _Description_:
--- 14809,14829 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL RENAME(PATH1, PATH2 [, STATUS])'
!      'STATUS = RENAME(PATH1, PATH2)'
  
  _Arguments_:
!      PATH1       Shall be of default 'CHARACTER' type.
!      PATH2       Shall be of default 'CHARACTER' type.
!      STATUS      (Optional) Shall be of default 'INTEGER' type.
  
  _See also_:
       *note LINK::
  
  
  File: gfortran.info,  Node: REPEAT,  Next: RESHAPE,  Prev: RENAME,  Up: Intrinsic Procedures
  
! 9.220 'REPEAT' -- Repeated string concatenation
  ===============================================
  
  _Description_:
*************** _Class_:
*** 14994,15007 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = REPEAT(STRING, NCOPIES)'
  
  _Arguments_:
!      STRING     Shall be scalar and of type `CHARACTER'.
!      NCOPIES    Shall be scalar and of type `INTEGER'.
  
  _Return value_:
!      A new scalar of type `CHARACTER' built up from NCOPIES copies of
       STRING.
  
  _Example_:
--- 14836,14849 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = REPEAT(STRING, NCOPIES)'
  
  _Arguments_:
!      STRING      Shall be scalar and of type 'CHARACTER'.
!      NCOPIES     Shall be scalar and of type 'INTEGER'.
  
  _Return value_:
!      A new scalar of type 'CHARACTER' built up from NCOPIES copies of
       STRING.
  
  _Example_:
*************** _Example_:
*** 15012,15022 ****
  
  File: gfortran.info,  Node: RESHAPE,  Next: RRSPACING,  Prev: REPEAT,  Up: Intrinsic Procedures
  
! 9.221 `RESHAPE' -- Function to reshape an array
  ===============================================
  
  _Description_:
!      Reshapes SOURCE to correspond to SHAPE. If necessary, the new
       array may be padded with elements from PAD or permuted as defined
       by ORDER.
  
--- 14854,14864 ----
  
  File: gfortran.info,  Node: RESHAPE,  Next: RRSPACING,  Prev: REPEAT,  Up: Intrinsic Procedures
  
! 9.221 'RESHAPE' -- Function to reshape an array
  ===============================================
  
  _Description_:
!      Reshapes SOURCE to correspond to SHAPE.  If necessary, the new
       array may be padded with elements from PAD or permuted as defined
       by ORDER.
  
*************** _Class_:
*** 15027,15046 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = RESHAPE(SOURCE, SHAPE[, PAD, ORDER])'
  
  _Arguments_:
!      SOURCE     Shall be an array of any type.
!      SHAPE      Shall be of type `INTEGER' and an array of
!                 rank one. Its values must be positive or zero.
!      PAD        (Optional) shall be an array of the same type
!                 as SOURCE.
!      ORDER      (Optional) shall be of type `INTEGER' and an
!                 array of the same shape as SHAPE. Its values
!                 shall be a permutation of the numbers from 1
!                 to n, where n is the size of SHAPE. If ORDER
!                 is absent, the natural ordering shall be
!                 assumed.
  
  _Return value_:
       The result is an array of shape SHAPE with the same type as SOURCE.
--- 14869,14887 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = RESHAPE(SOURCE, SHAPE[, PAD, ORDER])'
  
  _Arguments_:
!      SOURCE      Shall be an array of any type.
!      SHAPE       Shall be of type 'INTEGER' and an array of rank
!                  one.  Its values must be positive or zero.
!      PAD         (Optional) shall be an array of the same type as
!                  SOURCE.
!      ORDER       (Optional) shall be of type 'INTEGER' and an
!                  array of the same shape as SHAPE.  Its values
!                  shall be a permutation of the numbers from 1 to
!                  n, where n is the size of SHAPE.  If ORDER is
!                  absent, the natural ordering shall be assumed.
  
  _Return value_:
       The result is an array of shape SHAPE with the same type as SOURCE.
*************** _See also_:
*** 15058,15068 ****
  
  File: gfortran.info,  Node: RRSPACING,  Next: RSHIFT,  Prev: RESHAPE,  Up: Intrinsic Procedures
  
! 9.222 `RRSPACING' -- Reciprocal of the relative spacing
  =======================================================
  
  _Description_:
!      `RRSPACING(X)' returns the  reciprocal of the relative spacing of
       model numbers near X.
  
  _Standard_:
--- 14899,14909 ----
  
  File: gfortran.info,  Node: RRSPACING,  Next: RSHIFT,  Prev: RESHAPE,  Up: Intrinsic Procedures
  
! 9.222 'RRSPACING' -- Reciprocal of the relative spacing
  =======================================================
  
  _Description_:
!      'RRSPACING(X)' returns the reciprocal of the relative spacing of
       model numbers near X.
  
  _Standard_:
*************** _Class_:
*** 15072,15085 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = RRSPACING(X)'
  
  _Arguments_:
!      X          Shall be of type `REAL'.
  
  _Return value_:
       The return value is of the same type and kind as X.  The value
!      returned is equal to `ABS(FRACTION(X)) *
       FLOAT(RADIX(X))**DIGITS(X)'.
  
  _See also_:
--- 14913,14926 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = RRSPACING(X)'
  
  _Arguments_:
!      X           Shall be of type 'REAL'.
  
  _Return value_:
       The return value is of the same type and kind as X.  The value
!      returned is equal to 'ABS(FRACTION(X)) *
       FLOAT(RADIX(X))**DIGITS(X)'.
  
  _See also_:
*************** _See also_:
*** 15088,15105 ****
  
  File: gfortran.info,  Node: RSHIFT,  Next: SAME_TYPE_AS,  Prev: RRSPACING,  Up: Intrinsic Procedures
  
! 9.223 `RSHIFT' -- Right shift bits
  ==================================
  
  _Description_:
!      `RSHIFT' returns a value corresponding to I with all of the bits
       shifted right by SHIFT places.  If the absolute value of SHIFT is
!      greater than `BIT_SIZE(I)', the value is undefined.  Bits shifted
!      out from the right end are lost. The fill is arithmetic: the bits
       shifted in from the left end are equal to the leftmost bit, which
       in two's complement representation is the sign bit.
  
!      This function has been superseded by the `SHIFTA' intrinsic, which
       is standard in Fortran 2008 and later.
  
  _Standard_:
--- 14929,14946 ----
  
  File: gfortran.info,  Node: RSHIFT,  Next: SAME_TYPE_AS,  Prev: RRSPACING,  Up: Intrinsic Procedures
  
! 9.223 'RSHIFT' -- Right shift bits
  ==================================
  
  _Description_:
!      'RSHIFT' returns a value corresponding to I with all of the bits
       shifted right by SHIFT places.  If the absolute value of SHIFT is
!      greater than 'BIT_SIZE(I)', the value is undefined.  Bits shifted
!      out from the right end are lost.  The fill is arithmetic: the bits
       shifted in from the left end are equal to the leftmost bit, which
       in two's complement representation is the sign bit.
  
!      This function has been superseded by the 'SHIFTA' intrinsic, which
       is standard in Fortran 2008 and later.
  
  _Standard_:
*************** _Class_:
*** 15109,15133 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = RSHIFT(I, SHIFT)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      SHIFT      The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
       *note ISHFT::, *note ISHFTC::, *note LSHIFT::, *note SHIFTA::,
       *note SHIFTR::, *note SHIFTL::
  
- 
  
  File: gfortran.info,  Node: SAME_TYPE_AS,  Next: SCALE,  Prev: RSHIFT,  Up: Intrinsic Procedures
  
! 9.224 `SAME_TYPE_AS' --  Query dynamic types for equality
! =========================================================
  
  _Description_:
       Query dynamic types for equality.
--- 14950,14973 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = RSHIFT(I, SHIFT)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      SHIFT       The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
       *note ISHFT::, *note ISHFTC::, *note LSHIFT::, *note SHIFTA::,
       *note SHIFTR::, *note SHIFTL::
  
  
  File: gfortran.info,  Node: SAME_TYPE_AS,  Next: SCALE,  Prev: RSHIFT,  Up: Intrinsic Procedures
  
! 9.224 'SAME_TYPE_AS' -- Query dynamic types for equality
! ========================================================
  
  _Description_:
       Query dynamic types for equality.
*************** _Class_:
*** 15139,15169 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = SAME_TYPE_AS(A, B)'
  
  _Arguments_:
!      A          Shall be an object of extensible declared type
!                 or unlimited polymorphic.
!      B          Shall be an object of extensible declared type
!                 or unlimited polymorphic.
  
  _Return value_:
!      The return value is a scalar of type default logical. It is true
       if and only if the dynamic type of A is the same as the dynamic
       type of B.
  
  _See also_:
       *note EXTENDS_TYPE_OF::
  
- 
  
  File: gfortran.info,  Node: SCALE,  Next: SCAN,  Prev: SAME_TYPE_AS,  Up: Intrinsic Procedures
  
! 9.225 `SCALE' -- Scale a real value
  ===================================
  
  _Description_:
!      `SCALE(X,I)' returns `X * RADIX(X)**I'.
  
  _Standard_:
       Fortran 95 and later
--- 14979,15008 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = SAME_TYPE_AS(A, B)'
  
  _Arguments_:
!      A           Shall be an object of extensible declared type
!                  or unlimited polymorphic.
!      B           Shall be an object of extensible declared type
!                  or unlimited polymorphic.
  
  _Return value_:
!      The return value is a scalar of type default logical.  It is true
       if and only if the dynamic type of A is the same as the dynamic
       type of B.
  
  _See also_:
       *note EXTENDS_TYPE_OF::
  
  
  File: gfortran.info,  Node: SCALE,  Next: SCAN,  Prev: SAME_TYPE_AS,  Up: Intrinsic Procedures
  
! 9.225 'SCALE' -- Scale a real value
  ===================================
  
  _Description_:
!      'SCALE(X,I)' returns 'X * RADIX(X)**I'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 15172,15186 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SCALE(X, I)'
  
  _Arguments_:
!      X          The type of the argument shall be a `REAL'.
!      I          The type of the argument shall be a `INTEGER'.
  
  _Return value_:
       The return value is of the same type and kind as X.  Its value is
!      `X * RADIX(X)**I'.
  
  _Example_:
            program test_scale
--- 15011,15025 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SCALE(X, I)'
  
  _Arguments_:
!      X           The type of the argument shall be a 'REAL'.
!      I           The type of the argument shall be a 'INTEGER'.
  
  _Return value_:
       The return value is of the same type and kind as X.  Its value is
!      'X * RADIX(X)**I'.
  
  _Example_:
            program test_scale
*************** _Example_:
*** 15189,15207 ****
              print *, scale(x,i), x*radix(x)**i
            end program test_scale
  
- 
  
  File: gfortran.info,  Node: SCAN,  Next: SECNDS,  Prev: SCALE,  Up: Intrinsic Procedures
  
! 9.226 `SCAN' -- Scan a string for the presence of a set of characters
  =====================================================================
  
  _Description_:
       Scans a STRING for any of the characters in a SET of characters.
  
!      If BACK is either absent or equals `FALSE', this function returns
       the position of the leftmost character of STRING that is in SET.
!      If BACK equals `TRUE', the rightmost position is returned. If no
       character of SET is found in STRING, the result is zero.
  
  _Standard_:
--- 15028,15045 ----
              print *, scale(x,i), x*radix(x)**i
            end program test_scale
  
  
  File: gfortran.info,  Node: SCAN,  Next: SECNDS,  Prev: SCALE,  Up: Intrinsic Procedures
  
! 9.226 'SCAN' -- Scan a string for the presence of a set of characters
  =====================================================================
  
  _Description_:
       Scans a STRING for any of the characters in a SET of characters.
  
!      If BACK is either absent or equals 'FALSE', this function returns
       the position of the leftmost character of STRING that is in SET.
!      If BACK equals 'TRUE', the rightmost position is returned.  If no
       character of SET is found in STRING, the result is zero.
  
  _Standard_:
*************** _Class_:
*** 15211,15228 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SCAN(STRING, SET[, BACK [, KIND]])'
  
  _Arguments_:
!      STRING     Shall be of type `CHARACTER'.
!      SET        Shall be of type `CHARACTER'.
!      BACK       (Optional) shall be of type `LOGICAL'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
--- 15049,15066 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SCAN(STRING, SET[, BACK [, KIND]])'
  
  _Arguments_:
!      STRING      Shall be of type 'CHARACTER'.
!      SET         Shall be of type 'CHARACTER'.
!      BACK        (Optional) shall be of type 'LOGICAL'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
*************** _See also_:
*** 15238,15250 ****
  
  File: gfortran.info,  Node: SECNDS,  Next: SECOND,  Prev: SCAN,  Up: Intrinsic Procedures
  
! 9.227 `SECNDS' -- Time function
  ===============================
  
  _Description_:
!      `SECNDS(X)' gets the time in seconds from the real-time system
!      clock.  X is a reference time, also in seconds. If this is zero,
!      the time in seconds from midnight is returned. This function is
       non-standard and its use is discouraged.
  
  _Standard_:
--- 15076,15088 ----
  
  File: gfortran.info,  Node: SECNDS,  Next: SECOND,  Prev: SCAN,  Up: Intrinsic Procedures
  
! 9.227 'SECNDS' -- Time function
  ===============================
  
  _Description_:
!      'SECNDS(X)' gets the time in seconds from the real-time system
!      clock.  X is a reference time, also in seconds.  If this is zero,
!      the time in seconds from midnight is returned.  This function is
       non-standard and its use is discouraged.
  
  _Standard_:
*************** _Class_:
*** 15254,15264 ****
       Function
  
  _Syntax_:
!      `RESULT = SECNDS (X)'
  
  _Arguments_:
!      T          Shall be of type `REAL(4)'.
!      X          Shall be of type `REAL(4)'.
  
  _Return value_:
       None
--- 15092,15102 ----
       Function
  
  _Syntax_:
!      'RESULT = SECNDS (X)'
  
  _Arguments_:
!      T           Shall be of type 'REAL(4)'.
!      X           Shall be of type 'REAL(4)'.
  
  _Return value_:
       None
*************** _Example_:
*** 15278,15290 ****
  
  File: gfortran.info,  Node: SECOND,  Next: SELECTED_CHAR_KIND,  Prev: SECNDS,  Up: Intrinsic Procedures
  
! 9.228 `SECOND' -- CPU time function
  ===================================
  
  _Description_:
!      Returns a `REAL(4)' value representing the elapsed CPU time in
       seconds.  This provides the same functionality as the standard
!      `CPU_TIME' intrinsic, and is only included for backwards
       compatibility.
  
       This intrinsic is provided in both subroutine and function forms;
--- 15116,15128 ----
  
  File: gfortran.info,  Node: SECOND,  Next: SELECTED_CHAR_KIND,  Prev: SECNDS,  Up: Intrinsic Procedures
  
! 9.228 'SECOND' -- CPU time function
  ===================================
  
  _Description_:
!      Returns a 'REAL(4)' value representing the elapsed CPU time in
       seconds.  This provides the same functionality as the standard
!      'CPU_TIME' intrinsic, and is only included for backwards
       compatibility.
  
       This intrinsic is provided in both subroutine and function forms;
*************** _Class_:
*** 15297,15307 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL SECOND(TIME)'
!      `TIME = SECOND()'
  
  _Arguments_:
!      TIME       Shall be of type `REAL(4)'.
  
  _Return value_:
       In either syntax, TIME is set to the process's current runtime in
--- 15135,15145 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL SECOND(TIME)'
!      'TIME = SECOND()'
  
  _Arguments_:
!      TIME        Shall be of type 'REAL(4)'.
  
  _Return value_:
       In either syntax, TIME is set to the process's current runtime in
*************** _Return value_:
*** 15310,15326 ****
  _See also_:
       *note CPU_TIME::
  
- 
  
  File: gfortran.info,  Node: SELECTED_CHAR_KIND,  Next: SELECTED_INT_KIND,  Prev: SECOND,  Up: Intrinsic Procedures
  
! 9.229 `SELECTED_CHAR_KIND' -- Choose character kind
  ===================================================
  
  _Description_:
!      `SELECTED_CHAR_KIND(NAME)' returns the kind value for the character
       set named NAME, if a character set with such a name is supported,
!      or -1 otherwise. Currently, supported character sets include
       "ASCII" and "DEFAULT", which are equivalent, and "ISO_10646"
       (Universal Character Set, UCS-4) which is commonly known as
       Unicode.
--- 15148,15164 ----
  _See also_:
       *note CPU_TIME::
  
  
  File: gfortran.info,  Node: SELECTED_CHAR_KIND,  Next: SELECTED_INT_KIND,  Prev: SECOND,  Up: Intrinsic Procedures
  
! 9.229 'SELECTED_CHAR_KIND' -- Choose character kind
  ===================================================
  
  _Description_:
! 
!      'SELECTED_CHAR_KIND(NAME)' returns the kind value for the character
       set named NAME, if a character set with such a name is supported,
!      or -1 otherwise.  Currently, supported character sets include
       "ASCII" and "DEFAULT", which are equivalent, and "ISO_10646"
       (Universal Character Set, UCS-4) which is commonly known as
       Unicode.
*************** _Class_:
*** 15332,15342 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = SELECTED_CHAR_KIND(NAME)'
  
  _Arguments_:
!      NAME       Shall be a scalar and of the default character
!                 type.
  
  _Example_:
            program character_kind
--- 15170,15180 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = SELECTED_CHAR_KIND(NAME)'
  
  _Arguments_:
!      NAME        Shall be a scalar and of the default character
!                  type.
  
  _Example_:
            program character_kind
*************** _Example_:
*** 15362,15375 ****
  
  File: gfortran.info,  Node: SELECTED_INT_KIND,  Next: SELECTED_REAL_KIND,  Prev: SELECTED_CHAR_KIND,  Up: Intrinsic Procedures
  
! 9.230 `SELECTED_INT_KIND' -- Choose integer kind
  ================================================
  
  _Description_:
!      `SELECTED_INT_KIND(R)' return the kind value of the smallest
       integer type that can represent all values ranging from -10^R
!      (exclusive) to 10^R (exclusive). If there is no integer kind that
!      accommodates this range, `SELECTED_INT_KIND' returns -1.
  
  _Standard_:
       Fortran 95 and later
--- 15200,15213 ----
  
  File: gfortran.info,  Node: SELECTED_INT_KIND,  Next: SELECTED_REAL_KIND,  Prev: SELECTED_CHAR_KIND,  Up: Intrinsic Procedures
  
! 9.230 'SELECTED_INT_KIND' -- Choose integer kind
  ================================================
  
  _Description_:
!      'SELECTED_INT_KIND(R)' return the kind value of the smallest
       integer type that can represent all values ranging from -10^R
!      (exclusive) to 10^R (exclusive).  If there is no integer kind that
!      accommodates this range, 'SELECTED_INT_KIND' returns -1.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 15378,15387 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = SELECTED_INT_KIND(R)'
  
  _Arguments_:
!      R          Shall be a scalar and of type `INTEGER'.
  
  _Example_:
            program large_integers
--- 15216,15225 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = SELECTED_INT_KIND(R)'
  
  _Arguments_:
!      R           Shall be a scalar and of type 'INTEGER'.
  
  _Example_:
            program large_integers
*************** _Example_:
*** 15400,15456 ****
  
  File: gfortran.info,  Node: SELECTED_REAL_KIND,  Next: SET_EXPONENT,  Prev: SELECTED_INT_KIND,  Up: Intrinsic Procedures
  
! 9.231 `SELECTED_REAL_KIND' -- Choose real kind
  ==============================================
  
  _Description_:
!      `SELECTED_REAL_KIND(P,R)' returns the kind value of a real data
!      type with decimal precision of at least `P' digits, exponent range
!      of at least `R', and with a radix of `RADIX'.
  
  _Standard_:
!      Fortran 95 and later, with `RADIX' Fortran 2008 or later
  
  _Class_:
       Transformational function
  
  _Syntax_:
!      `RESULT = SELECTED_REAL_KIND([P, R, RADIX])'
  
  _Arguments_:
!      P          (Optional) shall be a scalar and of type
!                 `INTEGER'.
!      R          (Optional) shall be a scalar and of type
!                 `INTEGER'.
!      RADIX      (Optional) shall be a scalar and of type
!                 `INTEGER'.
       Before Fortran 2008, at least one of the arguments R or P shall be
       present; since Fortran 2008, they are assumed to be zero if absent.
  
  _Return value_:
!      `SELECTED_REAL_KIND' returns the value of the kind type parameter
!      of a real data type with decimal precision of at least `P' digits,
!      a decimal exponent range of at least `R', and with the requested
!      `RADIX'. If the `RADIX' parameter is absent, real kinds with any
!      radix can be returned. If more than one real data type meet the
       criteria, the kind of the data type with the smallest decimal
!      precision is returned. If no real data type matches the criteria,
       the result is
!     -1 if the processor does not support a real data type with a
!           precision greater than or equal to `P', but the `R' and
!           `RADIX' requirements can be fulfilled
! 
!     -2 if the processor does not support a real type with an exponent
!           range greater than or equal to `R', but `P' and `RADIX' are
            fulfillable
! 
!     -3 if `RADIX' but not `P' and `R' requirements
            are fulfillable
! 
!     -4 if `RADIX' and either `P' or `R' requirements
            are fulfillable
! 
!     -5 if there is no real type with the given `RADIX'
  
  _See also_:
       *note PRECISION::, *note RANGE::, *note RADIX::
--- 15238,15291 ----
  
  File: gfortran.info,  Node: SELECTED_REAL_KIND,  Next: SET_EXPONENT,  Prev: SELECTED_INT_KIND,  Up: Intrinsic Procedures
  
! 9.231 'SELECTED_REAL_KIND' -- Choose real kind
  ==============================================
  
  _Description_:
!      'SELECTED_REAL_KIND(P,R)' returns the kind value of a real data
!      type with decimal precision of at least 'P' digits, exponent range
!      of at least 'R', and with a radix of 'RADIX'.
  
  _Standard_:
!      Fortran 95 and later, with 'RADIX' Fortran 2008 or later
  
  _Class_:
       Transformational function
  
  _Syntax_:
!      'RESULT = SELECTED_REAL_KIND([P, R, RADIX])'
  
  _Arguments_:
!      P           (Optional) shall be a scalar and of type
!                  'INTEGER'.
!      R           (Optional) shall be a scalar and of type
!                  'INTEGER'.
!      RADIX       (Optional) shall be a scalar and of type
!                  'INTEGER'.
       Before Fortran 2008, at least one of the arguments R or P shall be
       present; since Fortran 2008, they are assumed to be zero if absent.
  
  _Return value_:
! 
!      'SELECTED_REAL_KIND' returns the value of the kind type parameter
!      of a real data type with decimal precision of at least 'P' digits,
!      a decimal exponent range of at least 'R', and with the requested
!      'RADIX'.  If the 'RADIX' parameter is absent, real kinds with any
!      radix can be returned.  If more than one real data type meet the
       criteria, the kind of the data type with the smallest decimal
!      precision is returned.  If no real data type matches the criteria,
       the result is
!      -1 if the processor does not support a real data type with a
!           precision greater than or equal to 'P', but the 'R' and
!           'RADIX' requirements can be fulfilled
!      -2 if the processor does not support a real type with an exponent
!           range greater than or equal to 'R', but 'P' and 'RADIX' are
            fulfillable
!      -3 if 'RADIX' but not 'P' and 'R' requirements
            are fulfillable
!      -4 if 'RADIX' and either 'P' or 'R' requirements
            are fulfillable
!      -5 if there is no real type with the given 'RADIX'
  
  _See also_:
       *note PRECISION::, *note RANGE::, *note RADIX::
*************** _Example_:
*** 15472,15482 ****
  
  File: gfortran.info,  Node: SET_EXPONENT,  Next: SHAPE,  Prev: SELECTED_REAL_KIND,  Up: Intrinsic Procedures
  
! 9.232 `SET_EXPONENT' -- Set the exponent of the model
  =====================================================
  
  _Description_:
!      `SET_EXPONENT(X, I)' returns the real number whose fractional part
       is that that of X and whose exponent part is I.
  
  _Standard_:
--- 15307,15317 ----
  
  File: gfortran.info,  Node: SET_EXPONENT,  Next: SHAPE,  Prev: SELECTED_REAL_KIND,  Up: Intrinsic Procedures
  
! 9.232 'SET_EXPONENT' -- Set the exponent of the model
  =====================================================
  
  _Description_:
!      'SET_EXPONENT(X, I)' returns the real number whose fractional part
       is that that of X and whose exponent part is I.
  
  _Standard_:
*************** _Class_:
*** 15486,15501 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SET_EXPONENT(X, I)'
  
  _Arguments_:
!      X          Shall be of type `REAL'.
!      I          Shall be of type `INTEGER'.
  
  _Return value_:
       The return value is of the same type and kind as X.  The real
       number whose fractional part is that that of X and whose exponent
!      part if I is returned; it is `FRACTION(X) * RADIX(X)**I'.
  
  _Example_:
            PROGRAM test_setexp
--- 15321,15336 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SET_EXPONENT(X, I)'
  
  _Arguments_:
!      X           Shall be of type 'REAL'.
!      I           Shall be of type 'INTEGER'.
  
  _Return value_:
       The return value is of the same type and kind as X.  The real
       number whose fractional part is that that of X and whose exponent
!      part if I is returned; it is 'FRACTION(X) * RADIX(X)**I'.
  
  _Example_:
            PROGRAM test_setexp
*************** _Example_:
*** 15504,15514 ****
              PRINT *, SET_EXPONENT(x, i), FRACTION(x) * RADIX(x)**i
            END PROGRAM
  
- 
  
  File: gfortran.info,  Node: SHAPE,  Next: SHIFTA,  Prev: SET_EXPONENT,  Up: Intrinsic Procedures
  
! 9.233 `SHAPE' -- Determine the shape of an array
  ================================================
  
  _Description_:
--- 15339,15348 ----
              PRINT *, SET_EXPONENT(x, i), FRACTION(x) * RADIX(x)**i
            END PROGRAM
  
  
  File: gfortran.info,  Node: SHAPE,  Next: SHIFTA,  Prev: SET_EXPONENT,  Up: Intrinsic Procedures
  
! 9.233 'SHAPE' -- Determine the shape of an array
  ================================================
  
  _Description_:
*************** _Class_:
*** 15521,15543 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = SHAPE(SOURCE [, KIND])'
  
  _Arguments_:
!      SOURCE     Shall be an array or scalar of any type.  If
!                 SOURCE is a pointer it must be associated and
!                 allocatable arrays must be allocated.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      An `INTEGER' array of rank one with as many elements as SOURCE has
!      dimensions. The elements of the resulting array correspond to the
!      extend of SOURCE along the respective dimensions. If SOURCE is a
!      scalar, the result is the rank one array of size zero. If KIND is
!      absent, the return value has the default integer kind otherwise
!      the specified kind.
  
  _Example_:
            PROGRAM test_shape
--- 15355,15377 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = SHAPE(SOURCE [, KIND])'
  
  _Arguments_:
!      SOURCE      Shall be an array or scalar of any type.  If
!                  SOURCE is a pointer it must be associated and
!                  allocatable arrays must be allocated.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      An 'INTEGER' array of rank one with as many elements as SOURCE has
!      dimensions.  The elements of the resulting array correspond to the
!      extend of SOURCE along the respective dimensions.  If SOURCE is a
!      scalar, the result is the rank one array of size zero.  If KIND is
!      absent, the return value has the default integer kind otherwise the
!      specified kind.
  
  _Example_:
            PROGRAM test_shape
*************** _See also_:
*** 15552,15565 ****
  
  File: gfortran.info,  Node: SHIFTA,  Next: SHIFTL,  Prev: SHAPE,  Up: Intrinsic Procedures
  
! 9.234 `SHIFTA' -- Right shift with fill
  =======================================
  
  _Description_:
!      `SHIFTA' returns a value corresponding to I with all of the bits
       shifted right by SHIFT places.  If the absolute value of SHIFT is
!      greater than `BIT_SIZE(I)', the value is undefined.  Bits shifted
!      out from the right end are lost. The fill is arithmetic: the bits
       shifted in from the left end are equal to the leftmost bit, which
       in two's complement representation is the sign bit.
  
--- 15386,15399 ----
  
  File: gfortran.info,  Node: SHIFTA,  Next: SHIFTL,  Prev: SHAPE,  Up: Intrinsic Procedures
  
! 9.234 'SHIFTA' -- Right shift with fill
  =======================================
  
  _Description_:
!      'SHIFTA' returns a value corresponding to I with all of the bits
       shifted right by SHIFT places.  If the absolute value of SHIFT is
!      greater than 'BIT_SIZE(I)', the value is undefined.  Bits shifted
!      out from the right end are lost.  The fill is arithmetic: the bits
       shifted in from the left end are equal to the leftmost bit, which
       in two's complement representation is the sign bit.
  
*************** _Class_:
*** 15570,15583 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SHIFTA(I, SHIFT)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      SHIFT      The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
       *note SHIFTL::, *note SHIFTR::
--- 15404,15417 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SHIFTA(I, SHIFT)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      SHIFT       The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
       *note SHIFTL::, *note SHIFTR::
*************** _See also_:
*** 15585,15597 ****
  
  File: gfortran.info,  Node: SHIFTL,  Next: SHIFTR,  Prev: SHIFTA,  Up: Intrinsic Procedures
  
! 9.235 `SHIFTL' -- Left shift
  ============================
  
  _Description_:
!      `SHIFTL' returns a value corresponding to I with all of the bits
       shifted left by SHIFT places.  If the absolute value of SHIFT is
!      greater than `BIT_SIZE(I)', the value is undefined.  Bits shifted
       out from the left end are lost, and bits shifted in from the right
       end are set to 0.
  
--- 15419,15431 ----
  
  File: gfortran.info,  Node: SHIFTL,  Next: SHIFTR,  Prev: SHIFTA,  Up: Intrinsic Procedures
  
! 9.235 'SHIFTL' -- Left shift
  ============================
  
  _Description_:
!      'SHIFTL' returns a value corresponding to I with all of the bits
       shifted left by SHIFT places.  If the absolute value of SHIFT is
!      greater than 'BIT_SIZE(I)', the value is undefined.  Bits shifted
       out from the left end are lost, and bits shifted in from the right
       end are set to 0.
  
*************** _Class_:
*** 15602,15615 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SHIFTL(I, SHIFT)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      SHIFT      The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
       *note SHIFTA::, *note SHIFTR::
--- 15436,15449 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SHIFTL(I, SHIFT)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      SHIFT       The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
       *note SHIFTA::, *note SHIFTR::
*************** _See also_:
*** 15617,15629 ****
  
  File: gfortran.info,  Node: SHIFTR,  Next: SIGN,  Prev: SHIFTL,  Up: Intrinsic Procedures
  
! 9.236 `SHIFTR' -- Right shift
  =============================
  
  _Description_:
!      `SHIFTR' returns a value corresponding to I with all of the bits
       shifted right by SHIFT places.  If the absolute value of SHIFT is
!      greater than `BIT_SIZE(I)', the value is undefined.  Bits shifted
       out from the right end are lost, and bits shifted in from the left
       end are set to 0.
  
--- 15451,15463 ----
  
  File: gfortran.info,  Node: SHIFTR,  Next: SIGN,  Prev: SHIFTL,  Up: Intrinsic Procedures
  
! 9.236 'SHIFTR' -- Right shift
  =============================
  
  _Description_:
!      'SHIFTR' returns a value corresponding to I with all of the bits
       shifted right by SHIFT places.  If the absolute value of SHIFT is
!      greater than 'BIT_SIZE(I)', the value is undefined.  Bits shifted
       out from the right end are lost, and bits shifted in from the left
       end are set to 0.
  
*************** _Class_:
*** 15634,15647 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SHIFTR(I, SHIFT)'
  
  _Arguments_:
!      I          The type shall be `INTEGER'.
!      SHIFT      The type shall be `INTEGER'.
  
  _Return value_:
!      The return value is of type `INTEGER' and of the same kind as I.
  
  _See also_:
       *note SHIFTA::, *note SHIFTL::
--- 15468,15481 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SHIFTR(I, SHIFT)'
  
  _Arguments_:
!      I           The type shall be 'INTEGER'.
!      SHIFT       The type shall be 'INTEGER'.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of the same kind as I.
  
  _See also_:
       *note SHIFTA::, *note SHIFTL::
*************** _See also_:
*** 15649,15659 ****
  
  File: gfortran.info,  Node: SIGN,  Next: SIGNAL,  Prev: SHIFTR,  Up: Intrinsic Procedures
  
! 9.237 `SIGN' -- Sign copying function
  =====================================
  
  _Description_:
!      `SIGN(A,B)' returns the value of A with the sign of B.
  
  _Standard_:
       Fortran 77 and later
--- 15483,15493 ----
  
  File: gfortran.info,  Node: SIGN,  Next: SIGNAL,  Prev: SHIFTR,  Up: Intrinsic Procedures
  
! 9.237 'SIGN' -- Sign copying function
  =====================================
  
  _Description_:
!      'SIGN(A,B)' returns the value of A with the sign of B.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 15662,15676 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SIGN(A, B)'
  
  _Arguments_:
!      A          Shall be of type `INTEGER' or `REAL'
!      B          Shall be of the same type and kind as A
  
  _Return value_:
       The kind of the return value is that of A and B.  If B\ge 0 then
!      the result is `ABS(A)', else it is `-ABS(A)'.
  
  _Example_:
            program test_sign
--- 15496,15510 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SIGN(A, B)'
  
  _Arguments_:
!      A           Shall be of type 'INTEGER' or 'REAL'
!      B           Shall be of the same type and kind as A
  
  _Return value_:
       The kind of the return value is that of A and B.  If B\ge 0 then
!      the result is 'ABS(A)', else it is '-ABS(A)'.
  
  _Example_:
            program test_sign
*************** _Example_:
*** 15684,15712 ****
            end program test_sign
  
  _Specific names_:
!      Name          Arguments     Return type   Standard
!      `SIGN(A,B)'   `REAL(4) A,   `REAL(4)'     f77, gnu
!                    B'                          
!      `ISIGN(A,B)'  `INTEGER(4)   `INTEGER(4)'  f77, gnu
!                    A, B'                       
!      `DSIGN(A,B)'  `REAL(8) A,   `REAL(8)'     f77, gnu
!                    B'                          
  
  
  File: gfortran.info,  Node: SIGNAL,  Next: SIN,  Prev: SIGN,  Up: Intrinsic Procedures
  
! 9.238 `SIGNAL' -- Signal handling subroutine (or function)
  ==========================================================
  
  _Description_:
!      `SIGNAL(NUMBER, HANDLER [, STATUS])' causes external subroutine
       HANDLER to be executed with a single integer argument when signal
       NUMBER occurs.  If HANDLER is an integer, it can be used to turn
!      off handling of signal NUMBER or revert to its default action.
!      See `signal(2)'.
  
!      If `SIGNAL' is called as a subroutine and the STATUS argument is
!      supplied, it is set to the value returned by `signal(2)'.
  
  _Standard_:
       GNU extension
--- 15518,15546 ----
            end program test_sign
  
  _Specific names_:
!      Name           Arguments      Return type    Standard
!      'SIGN(A,B)'    'REAL(4) A,    'REAL(4)'      f77, gnu
!                     B'
!      'ISIGN(A,B)'   'INTEGER(4)    'INTEGER(4)'   f77, gnu
!                     A, B'
!      'DSIGN(A,B)'   'REAL(8) A,    'REAL(8)'      f77, gnu
!                     B'
  
  
  File: gfortran.info,  Node: SIGNAL,  Next: SIN,  Prev: SIGN,  Up: Intrinsic Procedures
  
! 9.238 'SIGNAL' -- Signal handling subroutine (or function)
  ==========================================================
  
  _Description_:
!      'SIGNAL(NUMBER, HANDLER [, STATUS])' causes external subroutine
       HANDLER to be executed with a single integer argument when signal
       NUMBER occurs.  If HANDLER is an integer, it can be used to turn
!      off handling of signal NUMBER or revert to its default action.  See
!      'signal(2)'.
  
!      If 'SIGNAL' is called as a subroutine and the STATUS argument is
!      supplied, it is set to the value returned by 'signal(2)'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 15715,15733 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL SIGNAL(NUMBER, HANDLER [, STATUS])'
!      `STATUS = SIGNAL(NUMBER, HANDLER)'
  
  _Arguments_:
!      NUMBER     Shall be a scalar integer, with `INTENT(IN)'
!      HANDLER    Signal handler (`INTEGER FUNCTION' or
!                 `SUBROUTINE') or dummy/global `INTEGER' scalar.
!                 `INTEGER'. It is `INTENT(IN)'.
!      STATUS     (Optional) STATUS shall be a scalar integer.
!                 It has `INTENT(OUT)'.
  
  _Return value_:
!      The `SIGNAL' function returns the value returned by `signal(2)'.
  
  _Example_:
            program test_signal
--- 15549,15567 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL SIGNAL(NUMBER, HANDLER [, STATUS])'
!      'STATUS = SIGNAL(NUMBER, HANDLER)'
  
  _Arguments_:
!      NUMBER      Shall be a scalar integer, with 'INTENT(IN)'
!      HANDLER     Signal handler ('INTEGER FUNCTION' or
!                  'SUBROUTINE') or dummy/global 'INTEGER' scalar.
!                  'INTEGER'.  It is 'INTENT(IN)'.
!      STATUS      (Optional) STATUS shall be a scalar integer.  It
!                  has 'INTENT(OUT)'.
  
  _Return value_:
!      The 'SIGNAL' function returns the value returned by 'signal(2)'.
  
  _Example_:
            program test_signal
*************** _Example_:
*** 15743,15753 ****
  
  File: gfortran.info,  Node: SIN,  Next: SINH,  Prev: SIGNAL,  Up: Intrinsic Procedures
  
! 9.239 `SIN' -- Sine function
  ============================
  
  _Description_:
!      `SIN(X)' computes the sine of X.
  
  _Standard_:
       Fortran 77 and later
--- 15577,15587 ----
  
  File: gfortran.info,  Node: SIN,  Next: SINH,  Prev: SIGNAL,  Up: Intrinsic Procedures
  
! 9.239 'SIN' -- Sine function
  ============================
  
  _Description_:
!      'SIN(X)' computes the sine of X.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 15756,15765 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SIN(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
       The return value has same type and kind as X.
--- 15590,15599 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SIN(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
       The return value has same type and kind as X.
*************** _Example_:
*** 15771,15785 ****
            end program test_sin
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `SIN(X)'      `REAL(4) X'   `REAL(4)'     f77, gnu
!      `DSIN(X)'     `REAL(8) X'   `REAL(8)'     f95, gnu
!      `CSIN(X)'     `COMPLEX(4)   `COMPLEX(4)'  f95, gnu
!                    X'                          
!      `ZSIN(X)'     `COMPLEX(8)   `COMPLEX(8)'  f95, gnu
!                    X'                          
!      `CDSIN(X)'    `COMPLEX(8)   `COMPLEX(8)'  f95, gnu
!                    X'                          
  
  _See also_:
       *note ASIN::
--- 15605,15619 ----
            end program test_sin
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'SIN(X)'       'REAL(4) X'    'REAL(4)'      f77, gnu
!      'DSIN(X)'      'REAL(8) X'    'REAL(8)'      f95, gnu
!      'CSIN(X)'      'COMPLEX(4)    'COMPLEX(4)'   f95, gnu
!                     X'
!      'ZSIN(X)'      'COMPLEX(8)    'COMPLEX(8)'   f95, gnu
!                     X'
!      'CDSIN(X)'     'COMPLEX(8)    'COMPLEX(8)'   f95, gnu
!                     X'
  
  _See also_:
       *note ASIN::
*************** _See also_:
*** 15787,15797 ****
  
  File: gfortran.info,  Node: SINH,  Next: SIZE,  Prev: SIN,  Up: Intrinsic Procedures
  
! 9.240 `SINH' -- Hyperbolic sine function
  ========================================
  
  _Description_:
!      `SINH(X)' computes the hyperbolic sine of X.
  
  _Standard_:
       Fortran 95 and later, for a complex argument Fortran 2008 or later
--- 15621,15631 ----
  
  File: gfortran.info,  Node: SINH,  Next: SIZE,  Prev: SIN,  Up: Intrinsic Procedures
  
! 9.240 'SINH' -- Hyperbolic sine function
  ========================================
  
  _Description_:
!      'SINH(X)' computes the hyperbolic sine of X.
  
  _Standard_:
       Fortran 95 and later, for a complex argument Fortran 2008 or later
*************** _Class_:
*** 15800,15809 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SINH(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
       The return value has same type and kind as X.
--- 15634,15643 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SINH(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
       The return value has same type and kind as X.
*************** _Example_:
*** 15815,15825 ****
            end program test_sinh
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `SINH(X)'     `REAL(4) X'   `REAL(4)'     Fortran 95 and
!                                                later
!      `DSINH(X)'    `REAL(8) X'   `REAL(8)'     Fortran 95 and
!                                                later
  
  _See also_:
       *note ASINH::
--- 15649,15659 ----
            end program test_sinh
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'SINH(X)'      'REAL(4) X'    'REAL(4)'      Fortran 95 and
!                                                   later
!      'DSINH(X)'     'REAL(8) X'    'REAL(8)'      Fortran 95 and
!                                                   later
  
  _See also_:
       *note ASINH::
*************** _See also_:
*** 15827,15833 ****
  
  File: gfortran.info,  Node: SIZE,  Next: SIZEOF,  Prev: SINH,  Up: Intrinsic Procedures
  
! 9.241 `SIZE' -- Determine the size of an array
  ==============================================
  
  _Description_:
--- 15661,15667 ----
  
  File: gfortran.info,  Node: SIZE,  Next: SIZEOF,  Prev: SINH,  Up: Intrinsic Procedures
  
! 9.241 'SIZE' -- Determine the size of an array
  ==============================================
  
  _Description_:
*************** _Class_:
*** 15841,15861 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = SIZE(ARRAY[, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY      Shall be an array of any type. If ARRAY is a
!                 pointer it must be associated and allocatable
!                 arrays must be allocated.
!      DIM        (Optional) shall be a scalar of type `INTEGER'
!                 and its value shall be in the range from 1 to
!                 n, where n equals the rank of ARRAY.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
--- 15675,15695 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = SIZE(ARRAY[, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY       Shall be an array of any type.  If ARRAY is a
!                  pointer it must be associated and allocatable
!                  arrays must be allocated.
!      DIM         (Optional) shall be a scalar of type 'INTEGER'
!                  and its value shall be in the range from 1 to n,
!                  where n equals the rank of ARRAY.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
*************** _See also_:
*** 15869,15880 ****
  
  File: gfortran.info,  Node: SIZEOF,  Next: SLEEP,  Prev: SIZE,  Up: Intrinsic Procedures
  
! 9.242 `SIZEOF' -- Size in bytes of an expression
  ================================================
  
  _Description_:
!      `SIZEOF(X)' calculates the number of bytes of storage the
!      expression `X' occupies.
  
  _Standard_:
       GNU extension
--- 15703,15714 ----
  
  File: gfortran.info,  Node: SIZEOF,  Next: SLEEP,  Prev: SIZE,  Up: Intrinsic Procedures
  
! 9.242 'SIZEOF' -- Size in bytes of an expression
  ================================================
  
  _Description_:
!      'SIZEOF(X)' calculates the number of bytes of storage the
!      expression 'X' occupies.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 15883,15905 ****
       Inquiry function
  
  _Syntax_:
!      `N = SIZEOF(X)'
  
  _Arguments_:
!      X          The argument shall be of any type, rank or
!                 shape.
  
  _Return value_:
       The return value is of type integer and of the system-dependent
!      kind C_SIZE_T (from the ISO_C_BINDING module). Its value is the
       number of bytes occupied by the argument.  If the argument has the
!      `POINTER' attribute, the number of bytes of the storage area
       pointed to is returned.  If the argument is of a derived type with
!      `POINTER' or `ALLOCATABLE' components, the return value does not
       account for the sizes of the data pointed to by these components.
       If the argument is polymorphic, the size according to the dynamic
!      type is returned. The argument may not be a procedure or procedure
!      pointer. Note that the code assumes for arrays that those are
       contiguous; for contiguous arrays, it returns the storage or an
       array element multiplied by the size of the array.
  
--- 15717,15739 ----
       Inquiry function
  
  _Syntax_:
!      'N = SIZEOF(X)'
  
  _Arguments_:
!      X           The argument shall be of any type, rank or
!                  shape.
  
  _Return value_:
       The return value is of type integer and of the system-dependent
!      kind C_SIZE_T (from the ISO_C_BINDING module).  Its value is the
       number of bytes occupied by the argument.  If the argument has the
!      'POINTER' attribute, the number of bytes of the storage area
       pointed to is returned.  If the argument is of a derived type with
!      'POINTER' or 'ALLOCATABLE' components, the return value does not
       account for the sizes of the data pointed to by these components.
       If the argument is polymorphic, the size according to the dynamic
!      type is returned.  The argument may not be a procedure or procedure
!      pointer.  Note that the code assumes for arrays that those are
       contiguous; for contiguous arrays, it returns the storage or an
       array element multiplied by the size of the array.
  
*************** _Example_:
*** 15908,15915 ****
               real :: r, s(5)
               print *, (sizeof(s)/sizeof(r) == 5)
               end
!      The example will print `.TRUE.' unless you are using a platform
!      where default `REAL' variables are unusually padded.
  
  _See also_:
       *note C_SIZEOF::, *note STORAGE_SIZE::
--- 15742,15749 ----
               real :: r, s(5)
               print *, (sizeof(s)/sizeof(r) == 5)
               end
!      The example will print '.TRUE.' unless you are using a platform
!      where default 'REAL' variables are unusually padded.
  
  _See also_:
       *note C_SIZEOF::, *note STORAGE_SIZE::
*************** _See also_:
*** 15917,15923 ****
  
  File: gfortran.info,  Node: SLEEP,  Next: SPACING,  Prev: SIZEOF,  Up: Intrinsic Procedures
  
! 9.243 `SLEEP' -- Sleep for the specified number of seconds
  ==========================================================
  
  _Description_:
--- 15751,15757 ----
  
  File: gfortran.info,  Node: SLEEP,  Next: SPACING,  Prev: SIZEOF,  Up: Intrinsic Procedures
  
! 9.243 'SLEEP' -- Sleep for the specified number of seconds
  ==========================================================
  
  _Description_:
*************** _Class_:
*** 15931,15940 ****
       Subroutine
  
  _Syntax_:
!      `CALL SLEEP(SECONDS)'
  
  _Arguments_:
!      SECONDS    The type shall be of default `INTEGER'.
  
  _Example_:
            program test_sleep
--- 15765,15774 ----
       Subroutine
  
  _Syntax_:
!      'CALL SLEEP(SECONDS)'
  
  _Arguments_:
!      SECONDS     The type shall be of default 'INTEGER'.
  
  _Example_:
            program test_sleep
*************** _Example_:
*** 15944,15950 ****
  
  File: gfortran.info,  Node: SPACING,  Next: SPREAD,  Prev: SLEEP,  Up: Intrinsic Procedures
  
! 9.244 `SPACING' -- Smallest distance between two numbers of a given type
  ========================================================================
  
  _Description_:
--- 15778,15784 ----
  
  File: gfortran.info,  Node: SPACING,  Next: SPREAD,  Prev: SLEEP,  Up: Intrinsic Procedures
  
! 9.244 'SPACING' -- Smallest distance between two numbers of a given type
  ========================================================================
  
  _Description_:
*************** _Class_:
*** 15958,15967 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SPACING(X)'
  
  _Arguments_:
!      X          Shall be of type `REAL'.
  
  _Return value_:
       The result is of the same type as the input argument X.
--- 15792,15801 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SPACING(X)'
  
  _Arguments_:
!      X           Shall be of type 'REAL'.
  
  _Return value_:
       The result is of the same type as the input argument X.
*************** _See also_:
*** 15981,15992 ****
  
  File: gfortran.info,  Node: SPREAD,  Next: SQRT,  Prev: SPACING,  Up: Intrinsic Procedures
  
! 9.245 `SPREAD' -- Add a dimension to an array
  =============================================
  
  _Description_:
!      Replicates a SOURCE array NCOPIES times along a specified
!      dimension DIM.
  
  _Standard_:
       Fortran 95 and later
--- 15815,15826 ----
  
  File: gfortran.info,  Node: SPREAD,  Next: SQRT,  Prev: SPACING,  Up: Intrinsic Procedures
  
! 9.245 'SPREAD' -- Add a dimension to an array
  =============================================
  
  _Description_:
!      Replicates a SOURCE array NCOPIES times along a specified dimension
!      DIM.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 15995,16009 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = SPREAD(SOURCE, DIM, NCOPIES)'
  
  _Arguments_:
!      SOURCE     Shall be a scalar or an array of any type and
!                 a rank less than seven.
!      DIM        Shall be a scalar of type `INTEGER' with a
!                 value in the range from 1 to n+1, where n
!                 equals the rank of SOURCE.
!      NCOPIES    Shall be a scalar of type `INTEGER'.
  
  _Return value_:
       The result is an array of the same type as SOURCE and has rank n+1
--- 15829,15843 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = SPREAD(SOURCE, DIM, NCOPIES)'
  
  _Arguments_:
!      SOURCE      Shall be a scalar or an array of any type and a
!                  rank less than seven.
!      DIM         Shall be a scalar of type 'INTEGER' with a value
!                  in the range from 1 to n+1, where n equals the
!                  rank of SOURCE.
!      NCOPIES     Shall be a scalar of type 'INTEGER'.
  
  _Return value_:
       The result is an array of the same type as SOURCE and has rank n+1
*************** _See also_:
*** 16022,16032 ****
  
  File: gfortran.info,  Node: SQRT,  Next: SRAND,  Prev: SPREAD,  Up: Intrinsic Procedures
  
! 9.246 `SQRT' -- Square-root function
  ====================================
  
  _Description_:
!      `SQRT(X)' computes the square root of X.
  
  _Standard_:
       Fortran 77 and later
--- 15856,15866 ----
  
  File: gfortran.info,  Node: SQRT,  Next: SRAND,  Prev: SPREAD,  Up: Intrinsic Procedures
  
! 9.246 'SQRT' -- Square-root function
  ====================================
  
  _Description_:
!      'SQRT(X)' computes the square root of X.
  
  _Standard_:
       Fortran 77 and later
*************** _Class_:
*** 16035,16047 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = SQRT(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
!      The return value is of type `REAL' or `COMPLEX'.  The kind type
       parameter is the same as X.
  
  _Example_:
--- 15869,15881 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = SQRT(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value is of type 'REAL' or 'COMPLEX'.  The kind type
       parameter is the same as X.
  
  _Example_:
*************** _Example_:
*** 16053,16079 ****
            end program test_sqrt
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `SQRT(X)'     `REAL(4) X'   `REAL(4)'     Fortran 95 and
!                                                later
!      `DSQRT(X)'    `REAL(8) X'   `REAL(8)'     Fortran 95 and
!                                                later
!      `CSQRT(X)'    `COMPLEX(4)   `COMPLEX(4)'  Fortran 95 and
!                    X'                          later
!      `ZSQRT(X)'    `COMPLEX(8)   `COMPLEX(8)'  GNU extension
!                    X'                          
!      `CDSQRT(X)'   `COMPLEX(8)   `COMPLEX(8)'  GNU extension
!                    X'                          
  
  
  File: gfortran.info,  Node: SRAND,  Next: STAT,  Prev: SQRT,  Up: Intrinsic Procedures
  
! 9.247 `SRAND' -- Reinitialize the random number generator
  =========================================================
  
  _Description_:
!      `SRAND' reinitializes the pseudo-random number generator called by
!      `RAND' and `IRAND'. The new seed used by the generator is
       specified by the required argument SEED.
  
  _Standard_:
--- 15887,15913 ----
            end program test_sqrt
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'SQRT(X)'      'REAL(4) X'    'REAL(4)'      Fortran 95 and
!                                                   later
!      'DSQRT(X)'     'REAL(8) X'    'REAL(8)'      Fortran 95 and
!                                                   later
!      'CSQRT(X)'     'COMPLEX(4)    'COMPLEX(4)'   Fortran 95 and
!                     X'                            later
!      'ZSQRT(X)'     'COMPLEX(8)    'COMPLEX(8)'   GNU extension
!                     X'
!      'CDSQRT(X)'    'COMPLEX(8)    'COMPLEX(8)'   GNU extension
!                     X'
  
  
  File: gfortran.info,  Node: SRAND,  Next: STAT,  Prev: SQRT,  Up: Intrinsic Procedures
  
! 9.247 'SRAND' -- Reinitialize the random number generator
  =========================================================
  
  _Description_:
!      'SRAND' reinitializes the pseudo-random number generator called by
!      'RAND' and 'IRAND'.  The new seed used by the generator is
       specified by the required argument SEED.
  
  _Standard_:
*************** _Class_:
*** 16083,16138 ****
       Subroutine
  
  _Syntax_:
!      `CALL SRAND(SEED)'
  
  _Arguments_:
!      SEED       Shall be a scalar `INTEGER(kind=4)'.
  
  _Return value_:
       Does not return anything.
  
  _Example_:
!      See `RAND' and `IRAND' for examples.
  
  _Notes_:
!      The Fortran 2003 standard specifies the intrinsic `RANDOM_SEED' to
!      initialize the pseudo-random numbers generator and `RANDOM_NUMBER'
!      to generate pseudo-random numbers. Please note that in GNU
!      Fortran, these two sets of intrinsics (`RAND', `IRAND' and `SRAND'
!      on the one hand, `RANDOM_NUMBER' and `RANDOM_SEED' on the other
       hand) access two independent pseudo-random number generators.
  
  _See also_:
       *note RAND::, *note RANDOM_SEED::, *note RANDOM_NUMBER::
  
- 
  
  File: gfortran.info,  Node: STAT,  Next: STORAGE_SIZE,  Prev: SRAND,  Up: Intrinsic Procedures
  
! 9.248 `STAT' -- Get file status
  ===============================
  
  _Description_:
!      This function returns information about a file. No permissions are
       required on the file itself, but execute (search) permission is
       required on all of the directories in path that lead to the file.
  
!      The elements that are obtained and stored in the array `VALUES':
!      `VALUES(1)'Device ID
!      `VALUES(2)'Inode number
!      `VALUES(3)'File mode
!      `VALUES(4)'Number of links
!      `VALUES(5)'Owner's uid
!      `VALUES(6)'Owner's gid
!      `VALUES(7)'ID of device containing directory entry for
!                 file (0 if not available)
!      `VALUES(8)'File size (bytes)
!      `VALUES(9)'Last access time
!      `VALUES(10)'Last modification time
!      `VALUES(11)'Last file status change time
!      `VALUES(12)'Preferred I/O block size (-1 if not available)
!      `VALUES(13)'Number of blocks allocated (-1 if not
!                 available)
  
       Not all these elements are relevant on all systems.  If an element
       is not relevant, it is returned as 0.
--- 15917,15970 ----
       Subroutine
  
  _Syntax_:
!      'CALL SRAND(SEED)'
  
  _Arguments_:
!      SEED        Shall be a scalar 'INTEGER(kind=4)'.
  
  _Return value_:
       Does not return anything.
  
  _Example_:
!      See 'RAND' and 'IRAND' for examples.
  
  _Notes_:
!      The Fortran 2003 standard specifies the intrinsic 'RANDOM_SEED' to
!      initialize the pseudo-random numbers generator and 'RANDOM_NUMBER'
!      to generate pseudo-random numbers.  Please note that in GNU
!      Fortran, these two sets of intrinsics ('RAND', 'IRAND' and 'SRAND'
!      on the one hand, 'RANDOM_NUMBER' and 'RANDOM_SEED' on the other
       hand) access two independent pseudo-random number generators.
  
  _See also_:
       *note RAND::, *note RANDOM_SEED::, *note RANDOM_NUMBER::
  
  
  File: gfortran.info,  Node: STAT,  Next: STORAGE_SIZE,  Prev: SRAND,  Up: Intrinsic Procedures
  
! 9.248 'STAT' -- Get file status
  ===============================
  
  _Description_:
!      This function returns information about a file.  No permissions are
       required on the file itself, but execute (search) permission is
       required on all of the directories in path that lead to the file.
  
!      The elements that are obtained and stored in the array 'VALUES':
!      'VALUES(1)' Device ID
!      'VALUES(2)' Inode number
!      'VALUES(3)' File mode
!      'VALUES(4)' Number of links
!      'VALUES(5)' Owner's uid
!      'VALUES(6)' Owner's gid
!      'VALUES(7)' ID of device containing directory entry for file
!                  (0 if not available)
!      'VALUES(8)' File size (bytes)
!      'VALUES(9)' Last access time
!      'VALUES(10)'Last modification time
!      'VALUES(11)'Last file status change time
!      'VALUES(12)'Preferred I/O block size (-1 if not available)
!      'VALUES(13)'Number of blocks allocated (-1 if not available)
  
       Not all these elements are relevant on all systems.  If an element
       is not relevant, it is returned as 0.
*************** _Class_:
*** 16147,16162 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL STAT(NAME, VALUES [, STATUS])'
!      `STATUS = STAT(NAME, VALUES)'
  
  _Arguments_:
!      NAME       The type shall be `CHARACTER', of the default
!                 kind and a valid path within the file system.
!      VALUES     The type shall be `INTEGER(4), DIMENSION(13)'.
!      STATUS     (Optional) status flag of type `INTEGER(4)'.
!                 Returns 0 on success and a system specific
!                 error code otherwise.
  
  _Example_:
            PROGRAM test_stat
--- 15979,15994 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL STAT(NAME, VALUES [, STATUS])'
!      'STATUS = STAT(NAME, VALUES)'
  
  _Arguments_:
!      NAME        The type shall be 'CHARACTER', of the default
!                  kind and a valid path within the file system.
!      VALUES      The type shall be 'INTEGER(4), DIMENSION(13)'.
!      STATUS      (Optional) status flag of type 'INTEGER(4)'.
!                  Returns 0 on success and a system specific error
!                  code otherwise.
  
  _Example_:
            PROGRAM test_stat
*************** _See also_:
*** 16188,16218 ****
  
  File: gfortran.info,  Node: STORAGE_SIZE,  Next: SUM,  Prev: STAT,  Up: Intrinsic Procedures
  
! 9.249 `STORAGE_SIZE' -- Storage size in bits
  ============================================
  
  _Description_:
       Returns the storage size of argument A in bits.
- 
  _Standard_:
       Fortran 2008 and later
- 
  _Class_:
       Inquiry function
- 
  _Syntax_:
!      `RESULT = STORAGE_SIZE(A [, KIND])'
  
  _Arguments_:
!      A          Shall be a scalar or array of any type.
!      KIND       (Optional) shall be a scalar integer constant
!                 expression.
  
  _Return Value_:
       The result is a scalar integer with the kind type parameter
       specified by KIND (or default integer type if KIND is missing).
!      The result value is the size expressed in bits for an element of
!      an array that has the dynamic type and type parameters of A.
  
  _See also_:
       *note C_SIZEOF::, *note SIZEOF::
--- 16020,16047 ----
  
  File: gfortran.info,  Node: STORAGE_SIZE,  Next: SUM,  Prev: STAT,  Up: Intrinsic Procedures
  
! 9.249 'STORAGE_SIZE' -- Storage size in bits
  ============================================
  
  _Description_:
       Returns the storage size of argument A in bits.
  _Standard_:
       Fortran 2008 and later
  _Class_:
       Inquiry function
  _Syntax_:
!      'RESULT = STORAGE_SIZE(A [, KIND])'
  
  _Arguments_:
!      A           Shall be a scalar or array of any type.
!      KIND        (Optional) shall be a scalar integer constant
!                  expression.
  
  _Return Value_:
       The result is a scalar integer with the kind type parameter
       specified by KIND (or default integer type if KIND is missing).
!      The result value is the size expressed in bits for an element of an
!      array that has the dynamic type and type parameters of A.
  
  _See also_:
       *note C_SIZEOF::, *note SIZEOF::
*************** _See also_:
*** 16220,16231 ****
  
  File: gfortran.info,  Node: SUM,  Next: SYMLNK,  Prev: STORAGE_SIZE,  Up: Intrinsic Procedures
  
! 9.250 `SUM' -- Sum of array elements
  ====================================
  
  _Description_:
!      Adds the elements of ARRAY along dimension DIM if the
!      corresponding element in MASK is `TRUE'.
  
  _Standard_:
       Fortran 95 and later
--- 16049,16060 ----
  
  File: gfortran.info,  Node: SUM,  Next: SYMLNK,  Prev: STORAGE_SIZE,  Up: Intrinsic Procedures
  
! 9.250 'SUM' -- Sum of array elements
  ====================================
  
  _Description_:
!      Adds the elements of ARRAY along dimension DIM if the corresponding
!      element in MASK is 'TRUE'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 16234,16259 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = SUM(ARRAY[, MASK])'
!      `RESULT = SUM(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY      Shall be an array of type `INTEGER', `REAL' or
!                 `COMPLEX'.
!      DIM        (Optional) shall be a scalar of type `INTEGER'
!                 with a value in the range from 1 to n, where n
!                 equals the rank of ARRAY.
!      MASK       (Optional) shall be of type `LOGICAL' and
!                 either be a scalar or an array of the same
!                 shape as ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
!      If DIM is absent, a scalar with the sum of all elements in ARRAY
!      is returned. Otherwise, an array of rank n-1, where n equals the
!      rank of ARRAY, and a shape similar to that of ARRAY with dimension
!      DIM dropped is returned.
  
  _Example_:
            PROGRAM test_sum
--- 16063,16088 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = SUM(ARRAY[, MASK])'
!      'RESULT = SUM(ARRAY, DIM[, MASK])'
  
  _Arguments_:
!      ARRAY       Shall be an array of type 'INTEGER', 'REAL' or
!                  'COMPLEX'.
!      DIM         (Optional) shall be a scalar of type 'INTEGER'
!                  with a value in the range from 1 to n, where n
!                  equals the rank of ARRAY.
!      MASK        (Optional) shall be of type 'LOGICAL' and either
!                  be a scalar or an array of the same shape as
!                  ARRAY.
  
  _Return value_:
       The result is of the same type as ARRAY.
  
!      If DIM is absent, a scalar with the sum of all elements in ARRAY is
!      returned.  Otherwise, an array of rank n-1, where n equals the rank
!      of ARRAY, and a shape similar to that of ARRAY with dimension DIM
!      dropped is returned.
  
  _Example_:
            PROGRAM test_sum
*************** _See also_:
*** 16268,16283 ****
  
  File: gfortran.info,  Node: SYMLNK,  Next: SYSTEM,  Prev: SUM,  Up: Intrinsic Procedures
  
! 9.251 `SYMLNK' -- Create a symbolic link
  ========================================
  
  _Description_:
!      Makes a symbolic link from file PATH1 to PATH2. A null character
!      (`CHAR(0)') can be used to mark the end of the names in PATH1 and
       PATH2; otherwise, trailing blanks in the file names are ignored.
       If the STATUS argument is supplied, it contains 0 on success or a
!      nonzero error code upon return; see `symlink(2)'.  If the system
!      does not supply `symlink(2)', `ENOSYS' is returned.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 16097,16112 ----
  
  File: gfortran.info,  Node: SYMLNK,  Next: SYSTEM,  Prev: SUM,  Up: Intrinsic Procedures
  
! 9.251 'SYMLNK' -- Create a symbolic link
  ========================================
  
  _Description_:
!      Makes a symbolic link from file PATH1 to PATH2.  A null character
!      ('CHAR(0)') can be used to mark the end of the names in PATH1 and
       PATH2; otherwise, trailing blanks in the file names are ignored.
       If the STATUS argument is supplied, it contains 0 on success or a
!      nonzero error code upon return; see 'symlink(2)'.  If the system
!      does not supply 'symlink(2)', 'ENOSYS' is returned.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 16289,16324 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL SYMLNK(PATH1, PATH2 [, STATUS])'
!      `STATUS = SYMLNK(PATH1, PATH2)'
  
  _Arguments_:
!      PATH1      Shall be of default `CHARACTER' type.
!      PATH2      Shall be of default `CHARACTER' type.
!      STATUS     (Optional) Shall be of default `INTEGER' type.
  
  _See also_:
       *note LINK::, *note UNLINK::
  
- 
  
  File: gfortran.info,  Node: SYSTEM,  Next: SYSTEM_CLOCK,  Prev: SYMLNK,  Up: Intrinsic Procedures
  
! 9.252 `SYSTEM' -- Execute a shell command
  =========================================
  
  _Description_:
!      Passes the command COMMAND to a shell (see `system(3)'). If
       argument STATUS is present, it contains the value returned by
!      `system(3)', which is presumably 0 if the shell command succeeded.
       Note that which shell is used to invoke the command is
       system-dependent and environment-dependent.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the `system' function need not be thread-safe. It is the
!      responsibility of the user to ensure that `system' is not called
       concurrently.
  
  _Standard_:
--- 16118,16152 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL SYMLNK(PATH1, PATH2 [, STATUS])'
!      'STATUS = SYMLNK(PATH1, PATH2)'
  
  _Arguments_:
!      PATH1       Shall be of default 'CHARACTER' type.
!      PATH2       Shall be of default 'CHARACTER' type.
!      STATUS      (Optional) Shall be of default 'INTEGER' type.
  
  _See also_:
       *note LINK::, *note UNLINK::
  
  
  File: gfortran.info,  Node: SYSTEM,  Next: SYSTEM_CLOCK,  Prev: SYMLNK,  Up: Intrinsic Procedures
  
! 9.252 'SYSTEM' -- Execute a shell command
  =========================================
  
  _Description_:
!      Passes the command COMMAND to a shell (see 'system(3)').  If
       argument STATUS is present, it contains the value returned by
!      'system(3)', which is presumably 0 if the shell command succeeded.
       Note that which shell is used to invoke the command is
       system-dependent and environment-dependent.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
  
!      Note that the 'system' function need not be thread-safe.  It is the
!      responsibility of the user to ensure that 'system' is not called
       concurrently.
  
  _Standard_:
*************** _Class_:
*** 16328,16339 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL SYSTEM(COMMAND [, STATUS])'
!      `STATUS = SYSTEM(COMMAND)'
  
  _Arguments_:
!      COMMAND    Shall be of default `CHARACTER' type.
!      STATUS     (Optional) Shall be of default `INTEGER' type.
  
  _See also_:
       *note EXECUTE_COMMAND_LINE::, which is part of the Fortran 2008
--- 16156,16167 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL SYSTEM(COMMAND [, STATUS])'
!      'STATUS = SYSTEM(COMMAND)'
  
  _Arguments_:
!      COMMAND     Shall be of default 'CHARACTER' type.
!      STATUS      (Optional) Shall be of default 'INTEGER' type.
  
  _See also_:
       *note EXECUTE_COMMAND_LINE::, which is part of the Fortran 2008
*************** _See also_:
*** 16342,16383 ****
  
  File: gfortran.info,  Node: SYSTEM_CLOCK,  Next: TAN,  Prev: SYSTEM,  Up: Intrinsic Procedures
  
! 9.253 `SYSTEM_CLOCK' -- Time function
  =====================================
  
  _Description_:
!      Determines the COUNT of a processor clock since an unspecified
!      time in the past modulo COUNT_MAX, COUNT_RATE determines the
!      number of clock ticks per second.  If the platform supports a
!      monotonic clock, that clock is used and can, depending on the
!      platform clock implementation, provide up to nanosecond
!      resolution.  If a monotonic clock is not available, the
!      implementation falls back to a realtime clock.
  
       COUNT_RATE is system dependent and can vary depending on the kind
!      of the arguments. For KIND=4 arguments (and smaller integer kinds),
!      COUNT represents milliseconds, while for KIND=8 arguments (and
!      larger integer kinds), COUNT typically represents micro- or
       nanoseconds depending on resolution of the underlying platform
!      clock.  COUNT_MAX usually equals `HUGE(COUNT_MAX)'. Note that the
!      millisecond resolution of the KIND=4 version implies that the
!      COUNT will wrap around in roughly 25 days. In order to avoid issues
!      with the wrap around and for more precise timing, please use the
!      KIND=8 version.
  
       If there is no clock, or querying the clock fails, COUNT is set to
!      `-HUGE(COUNT)', and COUNT_RATE and COUNT_MAX are set to zero.
  
       When running on a platform using the GNU C library (glibc) version
       2.16 or older, or a derivative thereof, the high resolution
!      monotonic clock is available only when linking with the RT
!      library.  This can be done explicitly by adding the `-lrt' flag
!      when linking the application, but is also done implicitly when
!      using OpenMP.
  
!      On the Windows platform, the version with KIND=4 arguments uses
!      the `GetTickCount' function, whereas the KIND=8 version uses
!      `QueryPerformanceCounter' and `QueryPerformanceCounterFrequency'.
       For more information, and potential caveats, please see the
       platform documentation.
  
--- 16170,16210 ----
  
  File: gfortran.info,  Node: SYSTEM_CLOCK,  Next: TAN,  Prev: SYSTEM,  Up: Intrinsic Procedures
  
! 9.253 'SYSTEM_CLOCK' -- Time function
  =====================================
  
  _Description_:
!      Determines the COUNT of a processor clock since an unspecified time
!      in the past modulo COUNT_MAX, COUNT_RATE determines the number of
!      clock ticks per second.  If the platform supports a monotonic
!      clock, that clock is used and can, depending on the platform clock
!      implementation, provide up to nanosecond resolution.  If a
!      monotonic clock is not available, the implementation falls back to
!      a realtime clock.
  
       COUNT_RATE is system dependent and can vary depending on the kind
!      of the arguments.  For KIND=4 arguments (and smaller integer
!      kinds), COUNT represents milliseconds, while for KIND=8 arguments
!      (and larger integer kinds), COUNT typically represents micro- or
       nanoseconds depending on resolution of the underlying platform
!      clock.  COUNT_MAX usually equals 'HUGE(COUNT_MAX)'.  Note that the
!      millisecond resolution of the KIND=4 version implies that the COUNT
!      will wrap around in roughly 25 days.  In order to avoid issues with
!      the wrap around and for more precise timing, please use the KIND=8
!      version.
  
       If there is no clock, or querying the clock fails, COUNT is set to
!      '-HUGE(COUNT)', and COUNT_RATE and COUNT_MAX are set to zero.
  
       When running on a platform using the GNU C library (glibc) version
       2.16 or older, or a derivative thereof, the high resolution
!      monotonic clock is available only when linking with the RT library.
!      This can be done explicitly by adding the '-lrt' flag when linking
!      the application, but is also done implicitly when using OpenMP.
  
!      On the Windows platform, the version with KIND=4 arguments uses the
!      'GetTickCount' function, whereas the KIND=8 version uses
!      'QueryPerformanceCounter' and 'QueryPerformanceCounterFrequency'.
       For more information, and potential caveats, please see the
       platform documentation.
  
*************** _Class_:
*** 16388,16402 ****
       Subroutine
  
  _Syntax_:
!      `CALL SYSTEM_CLOCK([COUNT, COUNT_RATE, COUNT_MAX])'
  
  _Arguments_:
!      COUNT      (Optional) shall be a scalar of type `INTEGER'
!                 with `INTENT(OUT)'.
!      COUNT_RATE (Optional) shall be a scalar of type `INTEGER'
!                 or `REAL', with `INTENT(OUT)'.
!      COUNT_MAX  (Optional) shall be a scalar of type `INTEGER'
!                 with `INTENT(OUT)'.
  
  _Example_:
            PROGRAM test_system_clock
--- 16215,16229 ----
       Subroutine
  
  _Syntax_:
!      'CALL SYSTEM_CLOCK([COUNT, COUNT_RATE, COUNT_MAX])'
  
  _Arguments_:
!      COUNT       (Optional) shall be a scalar of type 'INTEGER'
!                  with 'INTENT(OUT)'.
!      COUNT_RATE  (Optional) shall be a scalar of type 'INTEGER'
!                  or 'REAL', with 'INTENT(OUT)'.
!      COUNT_MAX   (Optional) shall be a scalar of type 'INTEGER'
!                  with 'INTENT(OUT)'.
  
  _Example_:
            PROGRAM test_system_clock
*************** _See also_:
*** 16411,16421 ****
  
  File: gfortran.info,  Node: TAN,  Next: TANH,  Prev: SYSTEM_CLOCK,  Up: Intrinsic Procedures
  
! 9.254 `TAN' -- Tangent function
  ===============================
  
  _Description_:
!      `TAN(X)' computes the tangent of X.
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
--- 16238,16248 ----
  
  File: gfortran.info,  Node: TAN,  Next: TANH,  Prev: SYSTEM_CLOCK,  Up: Intrinsic Procedures
  
! 9.254 'TAN' -- Tangent function
  ===============================
  
  _Description_:
!      'TAN(X)' computes the tangent of X.
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
*************** _Class_:
*** 16424,16433 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = TAN(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
       The return value has same type and kind as X.
--- 16251,16260 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = TAN(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
       The return value has same type and kind as X.
*************** _Example_:
*** 16439,16449 ****
            end program test_tan
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `TAN(X)'      `REAL(4) X'   `REAL(4)'     Fortran 95 and
!                                                later
!      `DTAN(X)'     `REAL(8) X'   `REAL(8)'     Fortran 95 and
!                                                later
  
  _See also_:
       *note ATAN::
--- 16266,16276 ----
            end program test_tan
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'TAN(X)'       'REAL(4) X'    'REAL(4)'      Fortran 95 and
!                                                   later
!      'DTAN(X)'      'REAL(8) X'    'REAL(8)'      Fortran 95 and
!                                                   later
  
  _See also_:
       *note ATAN::
*************** _See also_:
*** 16451,16461 ****
  
  File: gfortran.info,  Node: TANH,  Next: THIS_IMAGE,  Prev: TAN,  Up: Intrinsic Procedures
  
! 9.255 `TANH' -- Hyperbolic tangent function
  ===========================================
  
  _Description_:
!      `TANH(X)' computes the hyperbolic tangent of X.
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
--- 16278,16288 ----
  
  File: gfortran.info,  Node: TANH,  Next: THIS_IMAGE,  Prev: TAN,  Up: Intrinsic Procedures
  
! 9.255 'TANH' -- Hyperbolic tangent function
  ===========================================
  
  _Description_:
!      'TANH(X)' computes the hyperbolic tangent of X.
  
  _Standard_:
       Fortran 77 and later, for a complex argument Fortran 2008 or later
*************** _Class_:
*** 16464,16478 ****
       Elemental function
  
  _Syntax_:
!      `X = TANH(X)'
  
  _Arguments_:
!      X          The type shall be `REAL' or `COMPLEX'.
  
  _Return value_:
!      The return value has same type and kind as X. If X is complex, the
!      imaginary part of the result is in radians. If X is `REAL', the
!      return value lies in the range  - 1 \leq tanh(x) \leq 1 .
  
  _Example_:
            program test_tanh
--- 16291,16305 ----
       Elemental function
  
  _Syntax_:
!      'X = TANH(X)'
  
  _Arguments_:
!      X           The type shall be 'REAL' or 'COMPLEX'.
  
  _Return value_:
!      The return value has same type and kind as X.  If X is complex, the
!      imaginary part of the result is in radians.  If X is 'REAL', the
!      return value lies in the range - 1 \leq tanh(x) \leq 1 .
  
  _Example_:
            program test_tanh
*************** _Example_:
*** 16481,16491 ****
            end program test_tanh
  
  _Specific names_:
!      Name          Argument      Return type   Standard
!      `TANH(X)'     `REAL(4) X'   `REAL(4)'     Fortran 95 and
!                                                later
!      `DTANH(X)'    `REAL(8) X'   `REAL(8)'     Fortran 95 and
!                                                later
  
  _See also_:
       *note ATANH::
--- 16308,16318 ----
            end program test_tanh
  
  _Specific names_:
!      Name           Argument       Return type    Standard
!      'TANH(X)'      'REAL(4) X'    'REAL(4)'      Fortran 95 and
!                                                   later
!      'DTANH(X)'     'REAL(8) X'    'REAL(8)'      Fortran 95 and
!                                                   later
  
  _See also_:
       *note ATANH::
*************** _See also_:
*** 16493,16538 ****
  
  File: gfortran.info,  Node: THIS_IMAGE,  Next: TIME,  Prev: TANH,  Up: Intrinsic Procedures
  
! 9.256 `THIS_IMAGE' -- Function that returns the cosubscript index of this image
  ===============================================================================
  
  _Description_:
       Returns the cosubscript for this image.
  
  _Standard_:
!      Fortran 2008 and later. With DISTANCE argument, Technical
       Specification (TS) 18508 or later
  
  _Class_:
       Transformational function
  
  _Syntax_:
!      `RESULT = THIS_IMAGE()'
!      `RESULT = THIS_IMAGE(DISTANCE)'
!      `RESULT = THIS_IMAGE(COARRAY [, DIM])'
  
  _Arguments_:
!      DISTANCE   (optional, intent(in)) Nonnegative scalar
!                 integer (not permitted together with COARRAY).
!      COARRAY    Coarray of any type  (optional; if DIM
!                 present, required).
!      DIM        default integer scalar (optional). If present,
!                 DIM shall be between one and the corank of
!                 COARRAY.
  
  _Return value_:
!      Default integer. If COARRAY is not present, it is scalar; if
       DISTANCE is not present or has value 0, its value is the image
       index on the invoking image for the current team, for values
!      smaller or equal distance to the initial team, it returns the
!      image index on the ancestor team which has a distance of DISTANCE
!      from the invoking team. If DISTANCE is larger than the distance to
!      the initial team, the image index of the initial team is returned.
       Otherwise when the COARRAY is present, if DIM is not present, a
       rank-1 array with corank elements is returned, containing the
!      cosubscripts for COARRAY specifying the invoking image. If DIM is
!      present, a scalar is returned, with the value of the DIM element
!      of `THIS_IMAGE(COARRAY)'.
  
  _Example_:
            INTEGER :: value[*]
--- 16320,16365 ----
  
  File: gfortran.info,  Node: THIS_IMAGE,  Next: TIME,  Prev: TANH,  Up: Intrinsic Procedures
  
! 9.256 'THIS_IMAGE' -- Function that returns the cosubscript index of this image
  ===============================================================================
  
  _Description_:
       Returns the cosubscript for this image.
  
  _Standard_:
!      Fortran 2008 and later.  With DISTANCE argument, Technical
       Specification (TS) 18508 or later
  
  _Class_:
       Transformational function
  
  _Syntax_:
!      'RESULT = THIS_IMAGE()'
!      'RESULT = THIS_IMAGE(DISTANCE)'
!      'RESULT = THIS_IMAGE(COARRAY [, DIM])'
  
  _Arguments_:
!      DISTANCE    (optional, intent(in)) Nonnegative scalar
!                  integer (not permitted together with COARRAY).
!      COARRAY     Coarray of any type (optional; if DIM present,
!                  required).
!      DIM         default integer scalar (optional).  If present,
!                  DIM shall be between one and the corank of
!                  COARRAY.
  
  _Return value_:
!      Default integer.  If COARRAY is not present, it is scalar; if
       DISTANCE is not present or has value 0, its value is the image
       index on the invoking image for the current team, for values
!      smaller or equal distance to the initial team, it returns the image
!      index on the ancestor team which has a distance of DISTANCE from
!      the invoking team.  If DISTANCE is larger than the distance to the
!      initial team, the image index of the initial team is returned.
       Otherwise when the COARRAY is present, if DIM is not present, a
       rank-1 array with corank elements is returned, containing the
!      cosubscripts for COARRAY specifying the invoking image.  If DIM is
!      present, a scalar is returned, with the value of the DIM element of
!      'THIS_IMAGE(COARRAY)'.
  
  _Example_:
            INTEGER :: value[*]
*************** _See also_:
*** 16555,16570 ****
  
  File: gfortran.info,  Node: TIME,  Next: TIME8,  Prev: THIS_IMAGE,  Up: Intrinsic Procedures
  
! 9.257 `TIME' -- Time function
  =============================
  
  _Description_:
       Returns the current time encoded as an integer (in the manner of
!      the function `time(3)' in the C standard library). This value is
!      suitable for passing to `CTIME', `GMTIME', and `LTIME'.
  
       This intrinsic is not fully portable, such as to systems with
!      32-bit `INTEGER' types but supporting times wider than 32 bits.
       Therefore, the values returned by this intrinsic might be, or
       become, negative, or numerically less than previous values, during
       a single run of the compiled program.
--- 16382,16397 ----
  
  File: gfortran.info,  Node: TIME,  Next: TIME8,  Prev: THIS_IMAGE,  Up: Intrinsic Procedures
  
! 9.257 'TIME' -- Time function
  =============================
  
  _Description_:
       Returns the current time encoded as an integer (in the manner of
!      the function 'time(3)' in the C standard library).  This value is
!      suitable for passing to 'CTIME', 'GMTIME', and 'LTIME'.
  
       This intrinsic is not fully portable, such as to systems with
!      32-bit 'INTEGER' types but supporting times wider than 32 bits.
       Therefore, the values returned by this intrinsic might be, or
       become, negative, or numerically less than previous values, during
       a single run of the compiled program.
*************** _Class_:
*** 16580,16611 ****
       Function
  
  _Syntax_:
!      `RESULT = TIME()'
  
  _Return value_:
!      The return value is a scalar of type `INTEGER(4)'.
  
  _See also_:
!      *note CTIME::, *note GMTIME::, *note LTIME::, *note MCLOCK::,
!      *note TIME8::
! 
  
  
  File: gfortran.info,  Node: TIME8,  Next: TINY,  Prev: TIME,  Up: Intrinsic Procedures
  
! 9.258 `TIME8' -- Time function (64-bit)
  =======================================
  
  _Description_:
       Returns the current time encoded as an integer (in the manner of
!      the function `time(3)' in the C standard library). This value is
!      suitable for passing to `CTIME', `GMTIME', and `LTIME'.
  
       _Warning:_ this intrinsic does not increase the range of the timing
!      values over that returned by `time(3)'. On a system with a 32-bit
!      `time(3)', `TIME8' will return a 32-bit value, even though it is
!      converted to a 64-bit `INTEGER(8)' value. That means overflows of
!      the 32-bit value can still occur. Therefore, the values returned
       by this intrinsic might be or become negative or numerically less
       than previous values during a single run of the compiled program.
  
--- 16407,16437 ----
       Function
  
  _Syntax_:
!      'RESULT = TIME()'
  
  _Return value_:
!      The return value is a scalar of type 'INTEGER(4)'.
  
  _See also_:
!      *note CTIME::, *note GMTIME::, *note LTIME::, *note MCLOCK::, *note
!      TIME8::
  
  
  File: gfortran.info,  Node: TIME8,  Next: TINY,  Prev: TIME,  Up: Intrinsic Procedures
  
! 9.258 'TIME8' -- Time function (64-bit)
  =======================================
  
  _Description_:
       Returns the current time encoded as an integer (in the manner of
!      the function 'time(3)' in the C standard library).  This value is
!      suitable for passing to 'CTIME', 'GMTIME', and 'LTIME'.
  
       _Warning:_ this intrinsic does not increase the range of the timing
!      values over that returned by 'time(3)'.  On a system with a 32-bit
!      'time(3)', 'TIME8' will return a 32-bit value, even though it is
!      converted to a 64-bit 'INTEGER(8)' value.  That means overflows of
!      the 32-bit value can still occur.  Therefore, the values returned
       by this intrinsic might be or become negative or numerically less
       than previous values during a single run of the compiled program.
  
*************** _Class_:
*** 16616,16640 ****
       Function
  
  _Syntax_:
!      `RESULT = TIME8()'
  
  _Return value_:
!      The return value is a scalar of type `INTEGER(8)'.
  
  _See also_:
       *note CTIME::, *note GMTIME::, *note LTIME::, *note MCLOCK8::,
       *note TIME::
  
- 
  
  File: gfortran.info,  Node: TINY,  Next: TRAILZ,  Prev: TIME8,  Up: Intrinsic Procedures
  
! 9.259 `TINY' -- Smallest positive number of a real kind
  =======================================================
  
  _Description_:
!      `TINY(X)' returns the smallest positive (non zero) number in the
!      model of the type of `X'.
  
  _Standard_:
       Fortran 95 and later
--- 16442,16465 ----
       Function
  
  _Syntax_:
!      'RESULT = TIME8()'
  
  _Return value_:
!      The return value is a scalar of type 'INTEGER(8)'.
  
  _See also_:
       *note CTIME::, *note GMTIME::, *note LTIME::, *note MCLOCK8::,
       *note TIME::
  
  
  File: gfortran.info,  Node: TINY,  Next: TRAILZ,  Prev: TIME8,  Up: Intrinsic Procedures
  
! 9.259 'TINY' -- Smallest positive number of a real kind
  =======================================================
  
  _Description_:
!      'TINY(X)' returns the smallest positive (non zero) number in the
!      model of the type of 'X'.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 16643,16667 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = TINY(X)'
  
  _Arguments_:
!      X          Shall be of type `REAL'.
  
  _Return value_:
       The return value is of the same type and kind as X
  
  _Example_:
!      See `HUGE' for an example.
  
  
  File: gfortran.info,  Node: TRAILZ,  Next: TRANSFER,  Prev: TINY,  Up: Intrinsic Procedures
  
! 9.260 `TRAILZ' -- Number of trailing zero bits of an integer
  ============================================================
  
  _Description_:
!      `TRAILZ' returns the number of trailing zero bits of an integer.
  
  _Standard_:
       Fortran 2008 and later
--- 16468,16492 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = TINY(X)'
  
  _Arguments_:
!      X           Shall be of type 'REAL'.
  
  _Return value_:
       The return value is of the same type and kind as X
  
  _Example_:
!      See 'HUGE' for an example.
  
  
  File: gfortran.info,  Node: TRAILZ,  Next: TRANSFER,  Prev: TINY,  Up: Intrinsic Procedures
  
! 9.260 'TRAILZ' -- Number of trailing zero bits of an integer
  ============================================================
  
  _Description_:
!      'TRAILZ' returns the number of trailing zero bits of an integer.
  
  _Standard_:
       Fortran 2008 and later
*************** _Class_:
*** 16670,16683 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = TRAILZ(I)'
  
  _Arguments_:
!      I          Shall be of type `INTEGER'.
  
  _Return value_:
!      The type of the return value is the default `INTEGER'.  If all the
!      bits of `I' are zero, the result value is `BIT_SIZE(I)'.
  
  _Example_:
            PROGRAM test_trailz
--- 16495,16508 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = TRAILZ(I)'
  
  _Arguments_:
!      I           Shall be of type 'INTEGER'.
  
  _Return value_:
!      The type of the return value is the default 'INTEGER'.  If all the
!      bits of 'I' are zero, the result value is 'BIT_SIZE(I)'.
  
  _Example_:
            PROGRAM test_trailz
*************** _See also_:
*** 16690,16696 ****
  
  File: gfortran.info,  Node: TRANSFER,  Next: TRANSPOSE,  Prev: TRAILZ,  Up: Intrinsic Procedures
  
! 9.261 `TRANSFER' -- Transfer bit patterns
  =========================================
  
  _Description_:
--- 16515,16521 ----
  
  File: gfortran.info,  Node: TRANSFER,  Next: TRANSPOSE,  Prev: TRAILZ,  Up: Intrinsic Procedures
  
! 9.261 'TRANSFER' -- Transfer bit patterns
  =========================================
  
  _Description_:
*************** _Class_:
*** 16708,16719 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = TRANSFER(SOURCE, MOLD[, SIZE])'
  
  _Arguments_:
!      SOURCE     Shall be a scalar or an array of any type.
!      MOLD       Shall be a scalar or an array of any type.
!      SIZE       (Optional) shall be a scalar of type `INTEGER'.
  
  _Return value_:
       The result has the same type as MOLD, with the bit level
--- 16533,16544 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = TRANSFER(SOURCE, MOLD[, SIZE])'
  
  _Arguments_:
!      SOURCE      Shall be a scalar or an array of any type.
!      MOLD        Shall be a scalar or an array of any type.
!      SIZE        (Optional) shall be a scalar of type 'INTEGER'.
  
  _Return value_:
       The result has the same type as MOLD, with the bit level
*************** _Return value_:
*** 16721,16727 ****
       one-dimensional array of length SIZE.  If SIZE is absent but MOLD
       is an array (of any size or shape), the result is a one-
       dimensional array of the minimum length needed to contain the
!      entirety of the bitwise representation of SOURCE.   If SIZE is
       absent and MOLD is a scalar, the result is a scalar.
  
       If the bitwise representation of the result is longer than that of
--- 16546,16552 ----
       one-dimensional array of length SIZE.  If SIZE is absent but MOLD
       is an array (of any size or shape), the result is a one-
       dimensional array of the minimum length needed to contain the
!      entirety of the bitwise representation of SOURCE.  If SIZE is
       absent and MOLD is a scalar, the result is a scalar.
  
       If the bitwise representation of the result is longer than that of
*************** _Return value_:
*** 16731,16739 ****
       When the resulting bit representation does not correspond to a
       valid representation of a variable of the same type as MOLD, the
       results are undefined, and subsequent operations on the result
!      cannot be guaranteed to produce sensible behavior.  For example,
!      it is possible to create `LOGICAL' variables for which `VAR' and
!      `.NOT.VAR' both appear to be true.
  
  _Example_:
            PROGRAM test_transfer
--- 16556,16564 ----
       When the resulting bit representation does not correspond to a
       valid representation of a variable of the same type as MOLD, the
       results are undefined, and subsequent operations on the result
!      cannot be guaranteed to produce sensible behavior.  For example, it
!      is possible to create 'LOGICAL' variables for which 'VAR' and
!      '.NOT.VAR' both appear to be true.
  
  _Example_:
            PROGRAM test_transfer
*************** _Example_:
*** 16744,16755 ****
  
  File: gfortran.info,  Node: TRANSPOSE,  Next: TRIM,  Prev: TRANSFER,  Up: Intrinsic Procedures
  
! 9.262 `TRANSPOSE' -- Transpose an array of rank two
  ===================================================
  
  _Description_:
!      Transpose an array of rank two. Element (i, j) of the result has
!      the value `MATRIX(j, i)', for all i, j.
  
  _Standard_:
       Fortran 95 and later
--- 16569,16580 ----
  
  File: gfortran.info,  Node: TRANSPOSE,  Next: TRIM,  Prev: TRANSFER,  Up: Intrinsic Procedures
  
! 9.262 'TRANSPOSE' -- Transpose an array of rank two
  ===================================================
  
  _Description_:
!      Transpose an array of rank two.  Element (i, j) of the result has
!      the value 'MATRIX(j, i)', for all i, j.
  
  _Standard_:
       Fortran 95 and later
*************** _Class_:
*** 16758,16777 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = TRANSPOSE(MATRIX)'
  
  _Arguments_:
!      MATRIX     Shall be an array of any type and have a rank
!                 of two.
  
  _Return value_:
!      The result has the same type as MATRIX, and has shape `(/ m, n /)'
!      if MATRIX has shape `(/ n, m /)'.
  
  
  File: gfortran.info,  Node: TRIM,  Next: TTYNAM,  Prev: TRANSPOSE,  Up: Intrinsic Procedures
  
! 9.263 `TRIM' -- Remove trailing blank characters of a string
  ============================================================
  
  _Description_:
--- 16583,16602 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = TRANSPOSE(MATRIX)'
  
  _Arguments_:
!      MATRIX      Shall be an array of any type and have a rank of
!                  two.
  
  _Return value_:
!      The result has the same type as MATRIX, and has shape '(/ m, n /)'
!      if MATRIX has shape '(/ n, m /)'.
  
  
  File: gfortran.info,  Node: TRIM,  Next: TTYNAM,  Prev: TRANSPOSE,  Up: Intrinsic Procedures
  
! 9.263 'TRIM' -- Remove trailing blank characters of a string
  ============================================================
  
  _Description_:
*************** _Class_:
*** 16784,16796 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = TRIM(STRING)'
  
  _Arguments_:
!      STRING     Shall be a scalar of type `CHARACTER'.
  
  _Return value_:
!      A scalar of type `CHARACTER' which length is that of STRING less
       the number of trailing blanks.
  
  _Example_:
--- 16609,16621 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = TRIM(STRING)'
  
  _Arguments_:
!      STRING      Shall be a scalar of type 'CHARACTER'.
  
  _Return value_:
!      A scalar of type 'CHARACTER' which length is that of STRING less
       the number of trailing blanks.
  
  _Example_:
*************** _See also_:
*** 16805,16816 ****
  
  File: gfortran.info,  Node: TTYNAM,  Next: UBOUND,  Prev: TRIM,  Up: Intrinsic Procedures
  
! 9.264 `TTYNAM' -- Get the name of a terminal device.
  ====================================================
  
  _Description_:
!      Get the name of a terminal device. For more information, see
!      `ttyname(3)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 16630,16641 ----
  
  File: gfortran.info,  Node: TTYNAM,  Next: UBOUND,  Prev: TRIM,  Up: Intrinsic Procedures
  
! 9.264 'TTYNAM' -- Get the name of a terminal device.
  ====================================================
  
  _Description_:
!      Get the name of a terminal device.  For more information, see
!      'ttyname(3)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 16822,16833 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL TTYNAM(UNIT, NAME)'
!      `NAME = TTYNAM(UNIT)'
  
  _Arguments_:
!      UNIT       Shall be a scalar `INTEGER'.
!      NAME       Shall be of type `CHARACTER'.
  
  _Example_:
            PROGRAM test_ttynam
--- 16647,16658 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL TTYNAM(UNIT, NAME)'
!      'NAME = TTYNAM(UNIT)'
  
  _Arguments_:
!      UNIT        Shall be a scalar 'INTEGER'.
!      NAME        Shall be of type 'CHARACTER'.
  
  _Example_:
            PROGRAM test_ttynam
*************** _See also_:
*** 16843,16855 ****
  
  File: gfortran.info,  Node: UBOUND,  Next: UCOBOUND,  Prev: TTYNAM,  Up: Intrinsic Procedures
  
! 9.265 `UBOUND' -- Upper dimension bounds of an array
  ====================================================
  
  _Description_:
!      Returns the upper bounds of an array, or a single upper bound
!      along the DIM dimension.
! 
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
  
--- 16668,16679 ----
  
  File: gfortran.info,  Node: UBOUND,  Next: UCOBOUND,  Prev: TTYNAM,  Up: Intrinsic Procedures
  
! 9.265 'UBOUND' -- Upper dimension bounds of an array
  ====================================================
  
  _Description_:
!      Returns the upper bounds of an array, or a single upper bound along
!      the DIM dimension.
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
  
*************** _Class_:
*** 16857,16881 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = UBOUND(ARRAY [, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY      Shall be an array, of any type.
!      DIM        (Optional) Shall be a scalar `INTEGER'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.  If DIM is
       absent, the result is an array of the upper bounds of ARRAY.  If
       DIM is present, the result is a scalar corresponding to the upper
!      bound of the array along that dimension.  If ARRAY is an
!      expression rather than a whole array or array structure component,
!      or if it has a zero extent along the relevant dimension, the upper
!      bound is taken to be the number of elements along the relevant
!      dimension.
  
  _See also_:
       *note LBOUND::, *note LCOBOUND::
--- 16681,16704 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = UBOUND(ARRAY [, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY       Shall be an array, of any type.
!      DIM         (Optional) Shall be a scalar 'INTEGER'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.  If DIM is
       absent, the result is an array of the upper bounds of ARRAY.  If
       DIM is present, the result is a scalar corresponding to the upper
!      bound of the array along that dimension.  If ARRAY is an expression
!      rather than a whole array or array structure component, or if it
!      has a zero extent along the relevant dimension, the upper bound is
!      taken to be the number of elements along the relevant dimension.
  
  _See also_:
       *note LBOUND::, *note LCOBOUND::
*************** _See also_:
*** 16883,16895 ****
  
  File: gfortran.info,  Node: UCOBOUND,  Next: UMASK,  Prev: UBOUND,  Up: Intrinsic Procedures
  
! 9.266 `UCOBOUND' -- Upper codimension bounds of an array
  ========================================================
  
  _Description_:
       Returns the upper cobounds of a coarray, or a single upper cobound
       along the DIM codimension.
- 
  _Standard_:
       Fortran 2008 and later
  
--- 16706,16717 ----
  
  File: gfortran.info,  Node: UCOBOUND,  Next: UMASK,  Prev: UBOUND,  Up: Intrinsic Procedures
  
! 9.266 'UCOBOUND' -- Upper codimension bounds of an array
  ========================================================
  
  _Description_:
       Returns the upper cobounds of a coarray, or a single upper cobound
       along the DIM codimension.
  _Standard_:
       Fortran 2008 and later
  
*************** _Class_:
*** 16897,16913 ****
       Inquiry function
  
  _Syntax_:
!      `RESULT = UCOBOUND(COARRAY [, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY      Shall be an coarray, of any type.
!      DIM        (Optional) Shall be a scalar `INTEGER'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.  If DIM is
       absent, the result is an array of the lower cobounds of COARRAY.
       If DIM is present, the result is a scalar corresponding to the
--- 16719,16735 ----
       Inquiry function
  
  _Syntax_:
!      'RESULT = UCOBOUND(COARRAY [, DIM [, KIND]])'
  
  _Arguments_:
!      ARRAY       Shall be an coarray, of any type.
!      DIM         (Optional) Shall be a scalar 'INTEGER'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.  If DIM is
       absent, the result is an array of the lower cobounds of COARRAY.
       If DIM is present, the result is a scalar corresponding to the
*************** _See also_:
*** 16919,16931 ****
  
  File: gfortran.info,  Node: UMASK,  Next: UNLINK,  Prev: UCOBOUND,  Up: Intrinsic Procedures
  
! 9.267 `UMASK' -- Set the file creation mask
  ===========================================
  
  _Description_:
!      Sets the file creation mask to MASK. If called as a function, it
!      returns the old value. If called as a subroutine and argument OLD
!      if it is supplied, it is set to the old value. See `umask(2)'.
  
  _Standard_:
       GNU extension
--- 16741,16753 ----
  
  File: gfortran.info,  Node: UMASK,  Next: UNLINK,  Prev: UCOBOUND,  Up: Intrinsic Procedures
  
! 9.267 'UMASK' -- Set the file creation mask
  ===========================================
  
  _Description_:
!      Sets the file creation mask to MASK.  If called as a function, it
!      returns the old value.  If called as a subroutine and argument OLD
!      if it is supplied, it is set to the old value.  See 'umask(2)'.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 16934,16959 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL UMASK(MASK [, OLD])'
!      `OLD = UMASK(MASK)'
  
  _Arguments_:
!      MASK       Shall be a scalar of type `INTEGER'.
!      OLD        (Optional) Shall be a scalar of type `INTEGER'.
! 
  
  
  File: gfortran.info,  Node: UNLINK,  Next: UNPACK,  Prev: UMASK,  Up: Intrinsic Procedures
  
! 9.268 `UNLINK' -- Remove a file from the file system
  ====================================================
  
  _Description_:
!      Unlinks the file PATH. A null character (`CHAR(0)') can be used to
!      mark the end of the name in PATH; otherwise, trailing blanks in
!      the file name are ignored.  If the STATUS argument is supplied, it
       contains 0 on success or a nonzero error code upon return; see
!      `unlink(2)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
--- 16756,16780 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL UMASK(MASK [, OLD])'
!      'OLD = UMASK(MASK)'
  
  _Arguments_:
!      MASK        Shall be a scalar of type 'INTEGER'.
!      OLD         (Optional) Shall be a scalar of type 'INTEGER'.
  
  
  File: gfortran.info,  Node: UNLINK,  Next: UNPACK,  Prev: UMASK,  Up: Intrinsic Procedures
  
! 9.268 'UNLINK' -- Remove a file from the file system
  ====================================================
  
  _Description_:
!      Unlinks the file PATH.  A null character ('CHAR(0)') can be used to
!      mark the end of the name in PATH; otherwise, trailing blanks in the
!      file name are ignored.  If the STATUS argument is supplied, it
       contains 0 on success or a nonzero error code upon return; see
!      'unlink(2)'.
  
       This intrinsic is provided in both subroutine and function forms;
       however, only one form can be used in any given program unit.
*************** _Class_:
*** 16965,16976 ****
       Subroutine, function
  
  _Syntax_:
!      `CALL UNLINK(PATH [, STATUS])'
!      `STATUS = UNLINK(PATH)'
  
  _Arguments_:
!      PATH       Shall be of default `CHARACTER' type.
!      STATUS     (Optional) Shall be of default `INTEGER' type.
  
  _See also_:
       *note LINK::, *note SYMLNK::
--- 16786,16797 ----
       Subroutine, function
  
  _Syntax_:
!      'CALL UNLINK(PATH [, STATUS])'
!      'STATUS = UNLINK(PATH)'
  
  _Arguments_:
!      PATH        Shall be of default 'CHARACTER' type.
!      STATUS      (Optional) Shall be of default 'INTEGER' type.
  
  _See also_:
       *note LINK::, *note SYMLNK::
*************** _See also_:
*** 16978,16984 ****
  
  File: gfortran.info,  Node: UNPACK,  Next: VERIFY,  Prev: UNLINK,  Up: Intrinsic Procedures
  
! 9.269 `UNPACK' -- Unpack an array of rank one into an array
  ===========================================================
  
  _Description_:
--- 16799,16805 ----
  
  File: gfortran.info,  Node: UNPACK,  Next: VERIFY,  Prev: UNLINK,  Up: Intrinsic Procedures
  
! 9.269 'UNPACK' -- Unpack an array of rank one into an array
  ===========================================================
  
  _Description_:
*************** _Class_:
*** 16991,17008 ****
       Transformational function
  
  _Syntax_:
!      `RESULT = UNPACK(VECTOR, MASK, FIELD)'
  
  _Arguments_:
!      VECTOR     Shall be an array of any type and rank one. It
!                 shall have at least as many elements as MASK
!                 has `TRUE' values.
!      MASK       Shall be an array of type `LOGICAL'.
!      FIELD      Shall be of the same type as VECTOR and have
!                 the same shape as MASK.
  
  _Return value_:
!      The resulting array corresponds to FIELD with `TRUE' elements of
       MASK replaced by values from VECTOR in array element order.
  
  _Example_:
--- 16812,16829 ----
       Transformational function
  
  _Syntax_:
!      'RESULT = UNPACK(VECTOR, MASK, FIELD)'
  
  _Arguments_:
!      VECTOR      Shall be an array of any type and rank one.  It
!                  shall have at least as many elements as MASK has
!                  'TRUE' values.
!      MASK        Shall be an array of type 'LOGICAL'.
!      FIELD       Shall be of the same type as VECTOR and have the
!                  same shape as MASK.
  
  _Return value_:
!      The resulting array corresponds to FIELD with 'TRUE' elements of
       MASK replaced by values from VECTOR in array element order.
  
  _Example_:
*************** _See also_:
*** 17021,17037 ****
  
  File: gfortran.info,  Node: VERIFY,  Next: XOR,  Prev: UNPACK,  Up: Intrinsic Procedures
  
! 9.270 `VERIFY' -- Scan a string for characters not a given set
  ==============================================================
  
  _Description_:
       Verifies that all the characters in STRING belong to the set of
       characters in SET.
  
!      If BACK is either absent or equals `FALSE', this function returns
       the position of the leftmost character of STRING that is not in
!      SET. If BACK equals `TRUE', the rightmost position is returned. If
!      all characters of STRING are found in SET, the result is zero.
  
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
--- 16842,16858 ----
  
  File: gfortran.info,  Node: VERIFY,  Next: XOR,  Prev: UNPACK,  Up: Intrinsic Procedures
  
! 9.270 'VERIFY' -- Scan a string for characters not a given set
  ==============================================================
  
  _Description_:
       Verifies that all the characters in STRING belong to the set of
       characters in SET.
  
!      If BACK is either absent or equals 'FALSE', this function returns
       the position of the leftmost character of STRING that is not in
!      SET.  If BACK equals 'TRUE', the rightmost position is returned.
!      If all characters of STRING are found in SET, the result is zero.
  
  _Standard_:
       Fortran 95 and later, with KIND argument Fortran 2003 and later
*************** _Class_:
*** 17040,17057 ****
       Elemental function
  
  _Syntax_:
!      `RESULT = VERIFY(STRING, SET[, BACK [, KIND]])'
  
  _Arguments_:
!      STRING     Shall be of type `CHARACTER'.
!      SET        Shall be of type `CHARACTER'.
!      BACK       (Optional) shall be of type `LOGICAL'.
!      KIND       (Optional) An `INTEGER' initialization
!                 expression indicating the kind parameter of
!                 the result.
  
  _Return value_:
!      The return value is of type `INTEGER' and of kind KIND. If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
--- 16861,16878 ----
       Elemental function
  
  _Syntax_:
!      'RESULT = VERIFY(STRING, SET[, BACK [, KIND]])'
  
  _Arguments_:
!      STRING      Shall be of type 'CHARACTER'.
!      SET         Shall be of type 'CHARACTER'.
!      BACK        (Optional) shall be of type 'LOGICAL'.
!      KIND        (Optional) An 'INTEGER' initialization
!                  expression indicating the kind parameter of the
!                  result.
  
  _Return value_:
!      The return value is of type 'INTEGER' and of kind KIND.  If KIND is
       absent, the return value is of default integer kind.
  
  _Example_:
*************** _See also_:
*** 17069,17075 ****
  
  File: gfortran.info,  Node: XOR,  Prev: VERIFY,  Up: Intrinsic Procedures
  
! 9.271 `XOR' -- Bitwise logical exclusive OR
  ===========================================
  
  _Description_:
--- 16890,16896 ----
  
  File: gfortran.info,  Node: XOR,  Prev: VERIFY,  Up: Intrinsic Procedures
  
! 9.271 'XOR' -- Bitwise logical exclusive OR
  ===========================================
  
  _Description_:
*************** _Description_:
*** 17078,17084 ****
       This intrinsic routine is provided for backwards compatibility with
       GNU Fortran 77.  For integer arguments, programmers should consider
       the use of the *note IEOR:: intrinsic and for logical arguments the
!      `.NEQV.' operator, which are both defined by the Fortran standard.
  
  _Standard_:
       GNU extension
--- 16899,16905 ----
       This intrinsic routine is provided for backwards compatibility with
       GNU Fortran 77.  For integer arguments, programmers should consider
       the use of the *note IEOR:: intrinsic and for logical arguments the
!      '.NEQV.' operator, which are both defined by the Fortran standard.
  
  _Standard_:
       GNU extension
*************** _Class_:
*** 17087,17104 ****
       Function
  
  _Syntax_:
!      `RESULT = XOR(I, J)'
  
  _Arguments_:
!      I          The type shall be either  a scalar `INTEGER'
!                 type or a scalar `LOGICAL' type.
!      J          The type shall be the same as the type of I.
  
  _Return value_:
!      The return type is either a scalar `INTEGER' or a scalar
!      `LOGICAL'.  If the kind type parameters differ, then the smaller
!      kind type is implicitly converted to larger kind, and the return
!      has the larger kind.
  
  _Example_:
            PROGRAM test_xor
--- 16908,16925 ----
       Function
  
  _Syntax_:
!      'RESULT = XOR(I, J)'
  
  _Arguments_:
!      I           The type shall be either a scalar 'INTEGER' type
!                  or a scalar 'LOGICAL' type.
!      J           The type shall be the same as the type of I.
  
  _Return value_:
!      The return type is either a scalar 'INTEGER' or a scalar 'LOGICAL'.
!      If the kind type parameters differ, then the smaller kind type is
!      implicitly converted to larger kind, and the return has the larger
!      kind.
  
  _Example_:
            PROGRAM test_xor
*************** File: gfortran.info,  Node: Intrinsic Mo
*** 17130,17250 ****
  
  File: gfortran.info,  Node: ISO_FORTRAN_ENV,  Next: ISO_C_BINDING,  Up: Intrinsic Modules
  
! 10.1 `ISO_FORTRAN_ENV'
  ======================
  
  _Standard_:
       Fortran 2003 and later, except when otherwise noted
  
!    The `ISO_FORTRAN_ENV' module provides the following scalar
  default-integer named constants:
  
! `ATOMIC_INT_KIND':
       Default-kind integer constant to be used as kind parameter when
!      defining integer variables used in atomic operations. (Fortran
       2008 or later.)
  
! `ATOMIC_LOGICAL_KIND':
       Default-kind integer constant to be used as kind parameter when
!      defining logical variables used in atomic operations. (Fortran
       2008 or later.)
  
! `CHARACTER_KINDS':
       Default-kind integer constant array of rank one containing the
!      supported kind parameters of the `CHARACTER' type. (Fortran 2008
       or later.)
  
! `CHARACTER_STORAGE_SIZE':
       Size in bits of the character storage unit.
  
! `ERROR_UNIT':
       Identifies the preconnected unit used for error reporting.
  
! `FILE_STORAGE_SIZE':
       Size in bits of the file-storage unit.
  
! `INPUT_UNIT':
!      Identifies the preconnected unit identified by the asterisk (`*')
!      in `READ' statement.
  
! `INT8', `INT16', `INT32', `INT64':
!      Kind type parameters to specify an INTEGER type with a storage
!      size of 16, 32, and 64 bits. It is negative if a target platform
!      does not support the particular kind. (Fortran 2008 or later.)
  
! `INTEGER_KINDS':
       Default-kind integer constant array of rank one containing the
!      supported kind parameters of the `INTEGER' type. (Fortran 2008 or
       later.)
  
! `IOSTAT_END':
!      The value assigned to the variable passed to the `IOSTAT='
       specifier of an input/output statement if an end-of-file condition
       occurred.
  
! `IOSTAT_EOR':
!      The value assigned to the variable passed to the `IOSTAT='
       specifier of an input/output statement if an end-of-record
       condition occurred.
  
! `IOSTAT_INQUIRE_INTERNAL_UNIT':
!      Scalar default-integer constant, used by `INQUIRE' for the
!      `IOSTAT=' specifier to denote an that a unit number identifies an
!      internal unit. (Fortran 2008 or later.)
  
! `NUMERIC_STORAGE_SIZE':
       The size in bits of the numeric storage unit.
  
! `LOGICAL_KINDS':
       Default-kind integer constant array of rank one containing the
!      supported kind parameters of the `LOGICAL' type. (Fortran 2008 or
       later.)
  
! `OUTPUT_UNIT':
!      Identifies the preconnected unit identified by the asterisk (`*')
!      in `WRITE' statement.
  
! `REAL32', `REAL64', `REAL128':
       Kind type parameters to specify a REAL type with a storage size of
!      32, 64, and 128 bits. It is negative if a target platform does not
!      support the particular kind. (Fortran 2008 or later.)
  
! `REAL_KINDS':
       Default-kind integer constant array of rank one containing the
!      supported kind parameters of the `REAL' type. (Fortran 2008 or
       later.)
  
! `STAT_LOCKED':
       Scalar default-integer constant used as STAT= return value by
!      `LOCK' to denote that the lock variable is locked by the executing
!      image. (Fortran 2008 or later.)
  
! `STAT_LOCKED_OTHER_IMAGE':
       Scalar default-integer constant used as STAT= return value by
!      `UNLOCK' to denote that the lock variable is locked by another
!      image. (Fortran 2008 or later.)
  
! `STAT_STOPPED_IMAGE':
       Positive, scalar default-integer constant used as STAT= return
       value if the argument in the statement requires synchronisation
       with an image, which has initiated the termination of the
!      execution. (Fortran 2008 or later.)
  
! `STAT_FAILED_IMAGE':
       Positive, scalar default-integer constant used as STAT= return
       value if the argument in the statement requires communication with
!      an image, which has is in the failed state. (TS 18508 or later.)
  
! `STAT_UNLOCKED':
       Scalar default-integer constant used as STAT= return value by
!      `UNLOCK' to denote that the lock variable is unlocked. (Fortran
       2008 or later.)
  
     The module provides the following derived type:
  
! `LOCK_TYPE':
!      Derived type with private components to be use with the `LOCK' and
!      `UNLOCK' statement. A variable of its type has to be always
       declared as coarray and may not appear in a variable-definition
       context.  (Fortran 2008 or later.)
  
--- 16951,17071 ----
  
  File: gfortran.info,  Node: ISO_FORTRAN_ENV,  Next: ISO_C_BINDING,  Up: Intrinsic Modules
  
! 10.1 'ISO_FORTRAN_ENV'
  ======================
  
  _Standard_:
       Fortran 2003 and later, except when otherwise noted
  
!    The 'ISO_FORTRAN_ENV' module provides the following scalar
  default-integer named constants:
  
! 'ATOMIC_INT_KIND':
       Default-kind integer constant to be used as kind parameter when
!      defining integer variables used in atomic operations.  (Fortran
       2008 or later.)
  
! 'ATOMIC_LOGICAL_KIND':
       Default-kind integer constant to be used as kind parameter when
!      defining logical variables used in atomic operations.  (Fortran
       2008 or later.)
  
! 'CHARACTER_KINDS':
       Default-kind integer constant array of rank one containing the
!      supported kind parameters of the 'CHARACTER' type.  (Fortran 2008
       or later.)
  
! 'CHARACTER_STORAGE_SIZE':
       Size in bits of the character storage unit.
  
! 'ERROR_UNIT':
       Identifies the preconnected unit used for error reporting.
  
! 'FILE_STORAGE_SIZE':
       Size in bits of the file-storage unit.
  
! 'INPUT_UNIT':
!      Identifies the preconnected unit identified by the asterisk ('*')
!      in 'READ' statement.
  
! 'INT8', 'INT16', 'INT32', 'INT64':
!      Kind type parameters to specify an INTEGER type with a storage size
!      of 16, 32, and 64 bits.  It is negative if a target platform does
!      not support the particular kind.  (Fortran 2008 or later.)
  
! 'INTEGER_KINDS':
       Default-kind integer constant array of rank one containing the
!      supported kind parameters of the 'INTEGER' type.  (Fortran 2008 or
       later.)
  
! 'IOSTAT_END':
!      The value assigned to the variable passed to the 'IOSTAT='
       specifier of an input/output statement if an end-of-file condition
       occurred.
  
! 'IOSTAT_EOR':
!      The value assigned to the variable passed to the 'IOSTAT='
       specifier of an input/output statement if an end-of-record
       condition occurred.
  
! 'IOSTAT_INQUIRE_INTERNAL_UNIT':
!      Scalar default-integer constant, used by 'INQUIRE' for the
!      'IOSTAT=' specifier to denote an that a unit number identifies an
!      internal unit.  (Fortran 2008 or later.)
  
! 'NUMERIC_STORAGE_SIZE':
       The size in bits of the numeric storage unit.
  
! 'LOGICAL_KINDS':
       Default-kind integer constant array of rank one containing the
!      supported kind parameters of the 'LOGICAL' type.  (Fortran 2008 or
       later.)
  
! 'OUTPUT_UNIT':
!      Identifies the preconnected unit identified by the asterisk ('*')
!      in 'WRITE' statement.
  
! 'REAL32', 'REAL64', 'REAL128':
       Kind type parameters to specify a REAL type with a storage size of
!      32, 64, and 128 bits.  It is negative if a target platform does not
!      support the particular kind.  (Fortran 2008 or later.)
  
! 'REAL_KINDS':
       Default-kind integer constant array of rank one containing the
!      supported kind parameters of the 'REAL' type.  (Fortran 2008 or
       later.)
  
! 'STAT_LOCKED':
       Scalar default-integer constant used as STAT= return value by
!      'LOCK' to denote that the lock variable is locked by the executing
!      image.  (Fortran 2008 or later.)
  
! 'STAT_LOCKED_OTHER_IMAGE':
       Scalar default-integer constant used as STAT= return value by
!      'UNLOCK' to denote that the lock variable is locked by another
!      image.  (Fortran 2008 or later.)
  
! 'STAT_STOPPED_IMAGE':
       Positive, scalar default-integer constant used as STAT= return
       value if the argument in the statement requires synchronisation
       with an image, which has initiated the termination of the
!      execution.  (Fortran 2008 or later.)
  
! 'STAT_FAILED_IMAGE':
       Positive, scalar default-integer constant used as STAT= return
       value if the argument in the statement requires communication with
!      an image, which has is in the failed state.  (TS 18508 or later.)
  
! 'STAT_UNLOCKED':
       Scalar default-integer constant used as STAT= return value by
!      'UNLOCK' to denote that the lock variable is unlocked.  (Fortran
       2008 or later.)
  
     The module provides the following derived type:
  
! 'LOCK_TYPE':
!      Derived type with private components to be use with the 'LOCK' and
!      'UNLOCK' statement.  A variable of its type has to be always
       declared as coarray and may not appear in a variable-definition
       context.  (Fortran 2008 or later.)
  
*************** COMPILER_OPTIONS:: and *note COMPILER_VE
*** 17254,17260 ****
  
  File: gfortran.info,  Node: ISO_C_BINDING,  Next: IEEE modules,  Prev: ISO_FORTRAN_ENV,  Up: Intrinsic Modules
  
! 10.2 `ISO_C_BINDING'
  ====================
  
  _Standard_:
--- 17075,17081 ----
  
  File: gfortran.info,  Node: ISO_C_BINDING,  Next: IEEE modules,  Prev: ISO_FORTRAN_ENV,  Up: Intrinsic Modules
  
! 10.2 'ISO_C_BINDING'
  ====================
  
  _Standard_:
*************** _Standard_:
*** 17264,17461 ****
  definition can be found in the section Intrinsic Procedures of this
  manual.
  
! `C_ASSOCIATED'
! 
! `C_F_POINTER'
! 
! `C_F_PROCPOINTER'
! 
! `C_FUNLOC'
! 
! `C_LOC'
! 
! `C_SIZEOF'
  
!    The `ISO_C_BINDING' module provides the following named constants of
  type default integer, which can be used as KIND type parameters.
  
     In addition to the integer named constants required by the Fortran
! 2003 standard and `C_PTRDIFF_T' of TS 29113, GNU Fortran provides as an
  extension named constants for the 128-bit integer types supported by the
! C compiler: `C_INT128_T, C_INT_LEAST128_T, C_INT_FAST128_T'.
! Furthermore, if `__float128' is supported in C, the named constants
! `C_FLOAT128, C_FLOAT128_COMPLEX' are defined.
  
  Fortran     Named constant            C type                    Extension
! Type                                                            
! `INTEGER'   `C_INT'                   `int'                     
! `INTEGER'   `C_SHORT'                 `short int'               
! `INTEGER'   `C_LONG'                  `long int'                
! `INTEGER'   `C_LONG_LONG'             `long long int'           
! `INTEGER'   `C_SIGNED_CHAR'           `signed char'/`unsigned   
!                                       char'                     
! `INTEGER'   `C_SIZE_T'                `size_t'                  
! `INTEGER'   `C_INT8_T'                `int8_t'                  
! `INTEGER'   `C_INT16_T'               `int16_t'                 
! `INTEGER'   `C_INT32_T'               `int32_t'                 
! `INTEGER'   `C_INT64_T'               `int64_t'                 
! `INTEGER'   `C_INT128_T'              `int128_t'                Ext.
! `INTEGER'   `C_INT_LEAST8_T'          `int_least8_t'            
! `INTEGER'   `C_INT_LEAST16_T'         `int_least16_t'           
! `INTEGER'   `C_INT_LEAST32_T'         `int_least32_t'           
! `INTEGER'   `C_INT_LEAST64_T'         `int_least64_t'           
! `INTEGER'   `C_INT_LEAST128_T'        `int_least128_t'          Ext.
! `INTEGER'   `C_INT_FAST8_T'           `int_fast8_t'             
! `INTEGER'   `C_INT_FAST16_T'          `int_fast16_t'            
! `INTEGER'   `C_INT_FAST32_T'          `int_fast32_t'            
! `INTEGER'   `C_INT_FAST64_T'          `int_fast64_t'            
! `INTEGER'   `C_INT_FAST128_T'         `int_fast128_t'           Ext.
! `INTEGER'   `C_INTMAX_T'              `intmax_t'                
! `INTEGER'   `C_INTPTR_T'              `intptr_t'                
! `INTEGER'   `C_PTRDIFF_T'             `intptr_t'                TS 29113
! `REAL'      `C_FLOAT'                 `float'                   
! `REAL'      `C_DOUBLE'                `double'                  
! `REAL'      `C_LONG_DOUBLE'           `long double'             
! `REAL'      `C_FLOAT128'              `__float128'              Ext.
! `COMPLEX'   `C_FLOAT_COMPLEX'         `float _Complex'          
! `COMPLEX'   `C_DOUBLE_COMPLEX'        `double _Complex'         
! `COMPLEX'   `C_LONG_DOUBLE_COMPLEX'   `long double _Complex'    
! `REAL'      `C_FLOAT128_COMPLEX'      `__float128 _Complex'     Ext.
! `LOGICAL'   `C_BOOL'                  `_Bool'                   
! `CHARACTER' `C_CHAR'                  `char'                    
  
     Additionally, the following parameters of type
! `CHARACTER(KIND=C_CHAR)' are defined.
  
  Name           C definition                     Value
! `C_NULL_CHAR'  null character                   `'\0''
! `C_ALERT'      alert                            `'\a''
! `C_BACKSPACE'  backspace                        `'\b''
! `C_FORM_FEED'  form feed                        `'\f''
! `C_NEW_LINE'   new line                         `'\n''
! `C_CARRIAGE_RETURN'carriage return                  `'\r''
! `C_HORIZONTAL_TAB'horizontal tab                   `'\t''
! `C_VERTICAL_TAB'vertical tab                     `'\v''
  
     Moreover, the following two named constants are defined:
  
  Name           Type
! `C_NULL_PTR'   `C_PTR'
! `C_NULL_FUNPTR'`C_FUNPTR'
  
!    Both are equivalent to the value `NULL' in C.
  
  
  File: gfortran.info,  Node: IEEE modules,  Next: OpenMP Modules OMP_LIB and OMP_LIB_KINDS,  Prev: ISO_C_BINDING,  Up: Intrinsic Modules
  
! 10.3 IEEE modules: `IEEE_EXCEPTIONS', `IEEE_ARITHMETIC', and `IEEE_FEATURES'
  ============================================================================
  
  _Standard_:
       Fortran 2003 and later
  
!    The `IEEE_EXCEPTIONS', `IEEE_ARITHMETIC', and `IEEE_FEATURES'
  intrinsic modules provide support for exceptions and IEEE arithmetic, as
  defined in Fortran 2003 and later standards, and the IEC 60559:1989
  standard (_Binary floating-point arithmetic for microprocessor
! systems_). These modules are only provided on the following supported
  platforms:
  
     * i386 and x86_64 processors
- 
     * platforms which use the GNU C Library (glibc)
- 
     * platforms with support for SysV/386 routines for floating point
       interface (including Solaris and BSDs)
- 
     * platforms with the AIX OS
  
     For full compliance with the Fortran standards, code using the
! `IEEE_EXCEPTIONS' or `IEEE_ARITHMETIC' modules should be compiled with
! the following options: `-fno-unsafe-math-optimizations -frounding-math
  -fsignaling-nans'.
  
  
  File: gfortran.info,  Node: OpenMP Modules OMP_LIB and OMP_LIB_KINDS,  Next: OpenACC Module OPENACC,  Prev: IEEE modules,  Up: Intrinsic Modules
  
! 10.4 OpenMP Modules `OMP_LIB' and `OMP_LIB_KINDS'
  =================================================
  
  _Standard_:
       OpenMP Application Program Interface v4.0
  
     The OpenMP Fortran runtime library routines are provided both in a
! form of two Fortran 90 modules, named `OMP_LIB' and `OMP_LIB_KINDS',
! and in a form of a Fortran `include' file named `omp_lib.h'. The
! procedures provided by `OMP_LIB' can be found in the *note
! Introduction: (libgomp)Top. manual, the named constants defined in the
! modules are listed below.
  
     For details refer to the actual OpenMP Application Program Interface
  v4.0 (http://www.openmp.org/mp-documents/OpenMP4.0.0.pdf).
  
!    `OMP_LIB_KINDS' provides the following scalar default-integer named
  constants:
  
! `omp_lock_kind'
! 
! `omp_nest_lock_kind'
! 
! `omp_proc_bind_kind'
! 
! `omp_sched_kind'
  
!    `OMP_LIB' provides the scalar default-integer named constant
! `openmp_version' with a value of the form YYYYMM, where `yyyy' is the
  year and MM the month of the OpenMP version; for OpenMP v4.0 the value
! is `201307'.
  
     The following scalar integer named constants of the kind
! `omp_sched_kind':
! 
! `omp_sched_static'
! 
! `omp_sched_dynamic'
! 
! `omp_sched_guided'
  
! `omp_sched_auto'
  
     And the following scalar integer named constants of the kind
! `omp_proc_bind_kind':
! 
! `omp_proc_bind_false'
! 
! `omp_proc_bind_true'
! 
! `omp_proc_bind_master'
! 
! `omp_proc_bind_close'
  
! `omp_proc_bind_spread'
  
  
  File: gfortran.info,  Node: OpenACC Module OPENACC,  Prev: OpenMP Modules OMP_LIB and OMP_LIB_KINDS,  Up: Intrinsic Modules
  
! 10.5 OpenACC Module `OPENACC'
  =============================
  
  _Standard_:
       OpenACC Application Programming Interface v2.0
  
     The OpenACC Fortran runtime library routines are provided both in a
! form of a Fortran 90 module, named `OPENACC', and in form of a Fortran
! `include' file named `openacc_lib.h'.  The procedures provided by
! `OPENACC' can be found in the *note Introduction: (libgomp)Top. manual,
  the named constants defined in the modules are listed below.
  
     For details refer to the actual OpenACC Application Programming
  Interface v2.0 (http://www.openacc.org/).
  
!    `OPENACC' provides the scalar default-integer named constant
! `openacc_version' with a value of the form YYYYMM, where `yyyy' is the
! year and MM the month of the OpenACC version; for OpenACC v2.0 the
! value is `201306'.
  
  
  File: gfortran.info,  Node: Contributing,  Next: Copying,  Prev: Intrinsic Modules,  Up: Top
--- 17085,17264 ----
  definition can be found in the section Intrinsic Procedures of this
  manual.
  
! 'C_ASSOCIATED'
! 'C_F_POINTER'
! 'C_F_PROCPOINTER'
! 'C_FUNLOC'
! 'C_LOC'
! 'C_SIZEOF'
  
!    The 'ISO_C_BINDING' module provides the following named constants of
  type default integer, which can be used as KIND type parameters.
  
     In addition to the integer named constants required by the Fortran
! 2003 standard and 'C_PTRDIFF_T' of TS 29113, GNU Fortran provides as an
  extension named constants for the 128-bit integer types supported by the
! C compiler: 'C_INT128_T, C_INT_LEAST128_T, C_INT_FAST128_T'.
! Furthermore, if '__float128' is supported in C, the named constants
! 'C_FLOAT128, C_FLOAT128_COMPLEX' are defined.
  
  Fortran     Named constant            C type                    Extension
! Type
! 'INTEGER'   'C_INT'                   'int'
! 'INTEGER'   'C_SHORT'                 'short int'
! 'INTEGER'   'C_LONG'                  'long int'
! 'INTEGER'   'C_LONG_LONG'             'long long int'
! 'INTEGER'   'C_SIGNED_CHAR'           'signed char'/'unsigned
!                                       char'
! 'INTEGER'   'C_SIZE_T'                'size_t'
! 'INTEGER'   'C_INT8_T'                'int8_t'
! 'INTEGER'   'C_INT16_T'               'int16_t'
! 'INTEGER'   'C_INT32_T'               'int32_t'
! 'INTEGER'   'C_INT64_T'               'int64_t'
! 'INTEGER'   'C_INT128_T'              'int128_t'                Ext.
! 'INTEGER'   'C_INT_LEAST8_T'          'int_least8_t'
! 'INTEGER'   'C_INT_LEAST16_T'         'int_least16_t'
! 'INTEGER'   'C_INT_LEAST32_T'         'int_least32_t'
! 'INTEGER'   'C_INT_LEAST64_T'         'int_least64_t'
! 'INTEGER'   'C_INT_LEAST128_T'        'int_least128_t'          Ext.
! 'INTEGER'   'C_INT_FAST8_T'           'int_fast8_t'
! 'INTEGER'   'C_INT_FAST16_T'          'int_fast16_t'
! 'INTEGER'   'C_INT_FAST32_T'          'int_fast32_t'
! 'INTEGER'   'C_INT_FAST64_T'          'int_fast64_t'
! 'INTEGER'   'C_INT_FAST128_T'         'int_fast128_t'           Ext.
! 'INTEGER'   'C_INTMAX_T'              'intmax_t'
! 'INTEGER'   'C_INTPTR_T'              'intptr_t'
! 'INTEGER'   'C_PTRDIFF_T'             'intptr_t'                TS 29113
! 'REAL'      'C_FLOAT'                 'float'
! 'REAL'      'C_DOUBLE'                'double'
! 'REAL'      'C_LONG_DOUBLE'           'long double'
! 'REAL'      'C_FLOAT128'              '__float128'              Ext.
! 'COMPLEX'   'C_FLOAT_COMPLEX'         'float _Complex'
! 'COMPLEX'   'C_DOUBLE_COMPLEX'        'double _Complex'
! 'COMPLEX'   'C_LONG_DOUBLE_COMPLEX'   'long double _Complex'
! 'REAL'      'C_FLOAT128_COMPLEX'      '__float128 _Complex'     Ext.
! 'LOGICAL'   'C_BOOL'                  '_Bool'
! 'CHARACTER' 'C_CHAR'                  'char'
  
     Additionally, the following parameters of type
! 'CHARACTER(KIND=C_CHAR)' are defined.
  
  Name           C definition                     Value
! 'C_NULL_CHAR'  null character                   ''\0''
! 'C_ALERT'      alert                            ''\a''
! 'C_BACKSPACE'  backspace                        ''\b''
! 'C_FORM_FEED'  form feed                        ''\f''
! 'C_NEW_LINE'   new line                         ''\n''
! 'C_CARRIAGE_RETURN'carriage return              ''\r''
! 'C_HORIZONTAL_TAB'horizontal tab                ''\t''
! 'C_VERTICAL_TAB'vertical tab                    ''\v''
  
     Moreover, the following two named constants are defined:
  
  Name           Type
! 'C_NULL_PTR'   'C_PTR'
! 'C_NULL_FUNPTR''C_FUNPTR'
  
!    Both are equivalent to the value 'NULL' in C.
  
  
  File: gfortran.info,  Node: IEEE modules,  Next: OpenMP Modules OMP_LIB and OMP_LIB_KINDS,  Prev: ISO_C_BINDING,  Up: Intrinsic Modules
  
! 10.3 IEEE modules: 'IEEE_EXCEPTIONS', 'IEEE_ARITHMETIC', and 'IEEE_FEATURES'
  ============================================================================
  
  _Standard_:
       Fortran 2003 and later
  
!    The 'IEEE_EXCEPTIONS', 'IEEE_ARITHMETIC', and 'IEEE_FEATURES'
  intrinsic modules provide support for exceptions and IEEE arithmetic, as
  defined in Fortran 2003 and later standards, and the IEC 60559:1989
  standard (_Binary floating-point arithmetic for microprocessor
! systems_).  These modules are only provided on the following supported
  platforms:
  
     * i386 and x86_64 processors
     * platforms which use the GNU C Library (glibc)
     * platforms with support for SysV/386 routines for floating point
       interface (including Solaris and BSDs)
     * platforms with the AIX OS
  
     For full compliance with the Fortran standards, code using the
! 'IEEE_EXCEPTIONS' or 'IEEE_ARITHMETIC' modules should be compiled with
! the following options: '-fno-unsafe-math-optimizations -frounding-math
  -fsignaling-nans'.
  
  
  File: gfortran.info,  Node: OpenMP Modules OMP_LIB and OMP_LIB_KINDS,  Next: OpenACC Module OPENACC,  Prev: IEEE modules,  Up: Intrinsic Modules
  
! 10.4 OpenMP Modules 'OMP_LIB' and 'OMP_LIB_KINDS'
  =================================================
  
  _Standard_:
       OpenMP Application Program Interface v4.0
  
     The OpenMP Fortran runtime library routines are provided both in a
! form of two Fortran 90 modules, named 'OMP_LIB' and 'OMP_LIB_KINDS', and
! in a form of a Fortran 'include' file named 'omp_lib.h'.  The procedures
! provided by 'OMP_LIB' can be found in the *note Introduction:
! (libgomp)Top. manual, the named constants defined in the modules are
! listed below.
  
     For details refer to the actual OpenMP Application Program Interface
  v4.0 (http://www.openmp.org/mp-documents/OpenMP4.0.0.pdf).
  
!    'OMP_LIB_KINDS' provides the following scalar default-integer named
  constants:
  
! 'omp_lock_kind'
! 'omp_nest_lock_kind'
! 'omp_proc_bind_kind'
! 'omp_sched_kind'
  
!    'OMP_LIB' provides the scalar default-integer named constant
! 'openmp_version' with a value of the form YYYYMM, where 'yyyy' is the
  year and MM the month of the OpenMP version; for OpenMP v4.0 the value
! is '201307'.
  
     The following scalar integer named constants of the kind
! 'omp_sched_kind':
  
! 'omp_sched_static'
! 'omp_sched_dynamic'
! 'omp_sched_guided'
! 'omp_sched_auto'
  
     And the following scalar integer named constants of the kind
! 'omp_proc_bind_kind':
  
! 'omp_proc_bind_false'
! 'omp_proc_bind_true'
! 'omp_proc_bind_master'
! 'omp_proc_bind_close'
! 'omp_proc_bind_spread'
  
  
  File: gfortran.info,  Node: OpenACC Module OPENACC,  Prev: OpenMP Modules OMP_LIB and OMP_LIB_KINDS,  Up: Intrinsic Modules
  
! 10.5 OpenACC Module 'OPENACC'
  =============================
  
  _Standard_:
       OpenACC Application Programming Interface v2.0
  
     The OpenACC Fortran runtime library routines are provided both in a
! form of a Fortran 90 module, named 'OPENACC', and in form of a Fortran
! 'include' file named 'openacc_lib.h'.  The procedures provided by
! 'OPENACC' can be found in the *note Introduction: (libgomp)Top. manual,
  the named constants defined in the modules are listed below.
  
     For details refer to the actual OpenACC Application Programming
  Interface v2.0 (http://www.openacc.org/).
  
!    'OPENACC' provides the scalar default-integer named constant
! 'openacc_version' with a value of the form YYYYMM, where 'yyyy' is the
! year and MM the month of the OpenACC version; for OpenACC v2.0 the value
! is '201306'.
  
  
  File: gfortran.info,  Node: Contributing,  Next: Copying,  Prev: Intrinsic Modules,  Up: Top
*************** File: gfortran.info,  Node: Contributing
*** 17463,17471 ****
  Contributing
  ************
  
! Free software is only possible if people contribute to efforts to
! create it.  We're always in need of more people helping out with ideas
! and comments, writing documentation and contributing code.
  
     If you want to contribute to GNU Fortran, have a look at the long
  lists of projects you can take on.  Some of these projects are small,
--- 17266,17274 ----
  Contributing
  ************
  
! Free software is only possible if people contribute to efforts to create
! it.  We're always in need of more people helping out with ideas and
! comments, writing documentation and contributing code.
  
     If you want to contribute to GNU Fortran, have a look at the long
  lists of projects you can take on.  Some of these projects are small,
*************** with GCC was written by _Paul Brook_.
*** 17495,17563 ****
  significant help to the GNU Fortran project (in alphabetical order):
  
     - Janne Blomqvist
- 
     - Steven Bosscher
- 
     - Paul Brook
- 
     - Tobias Burnus
- 
     - Franc,ois-Xavier Coudert
- 
     - Bud Davis
- 
     - Jerry DeLisle
- 
     - Erik Edelmann
- 
     - Bernhard Fischer
- 
     - Daniel Franke
- 
     - Richard Guenther
- 
     - Richard Henderson
- 
     - Katherine Holcomb
- 
     - Jakub Jelinek
- 
     - Niels Kristian Bech Jensen
- 
     - Steven Johnson
- 
     - Steven G. Kargl
- 
     - Thomas Koenig
- 
     - Asher Langton
- 
     - H. J. Lu
- 
     - Toon Moene
- 
     - Brooks Moses
- 
     - Andrew Pinski
- 
     - Tim Prince
- 
     - Christopher D. Rickett
- 
     - Richard Sandiford
- 
     - Tobias Schlu"ter
- 
     - Roger Sayle
- 
     - Paul Thomas
- 
     - Andy Vaught
- 
     - Feng Wang
- 
     - Janus Weil
- 
     - Daniel Kraft
  
     The following people have contributed bug reports, smaller or larger
--- 17298,17334 ----
*************** patches, and much needed feedback and en
*** 17565,17577 ****
  project:
  
     - Bill Clodius
- 
     - Dominique d'Humie`res
- 
     - Kate Hedstrom
- 
     - Erik Schnetter
- 
     - Joost VandeVondele
  
     Many other individuals have helped debug, test and improve the GNU
--- 17336,17344 ----
*************** Projects
*** 17587,17615 ****
  
  _Help build the test suite_
       Solicit more code for donation to the test suite: the more
!      extensive the testsuite, the smaller the risk of breaking things
!      in the future! We can keep code private on request.
  
  _Bug hunting/squishing_
!      Find bugs and write more test cases! Test cases are especially very
!      welcome, because it allows us to concentrate on fixing bugs
       instead of isolating them.  Going through the bugzilla database at
!      `https://gcc.gnu.org/bugzilla/' to reduce testcases posted there
       and add more information (for example, for which version does the
!      testcase work, for which versions does it fail?) is also very
       helpful.
  
- 
  
  File: gfortran.info,  Node: Proposed Extensions,  Prev: Projects,  Up: Contributing
  
  Proposed Extensions
  ===================
  
! Here's a list of proposed extensions for the GNU Fortran compiler, in
! no particular order.  Most of these are necessary to be fully
! compatible with existing Fortran compilers, but they are not part of
! the official J3 Fortran 95 standard.
  
  Compiler extensions:
  --------------------
--- 17354,17381 ----
  
  _Help build the test suite_
       Solicit more code for donation to the test suite: the more
!      extensive the testsuite, the smaller the risk of breaking things in
!      the future!  We can keep code private on request.
  
  _Bug hunting/squishing_
!      Find bugs and write more test cases!  Test cases are especially
!      very welcome, because it allows us to concentrate on fixing bugs
       instead of isolating them.  Going through the bugzilla database at
!      <https://gcc.gnu.org/bugzilla/> to reduce testcases posted there
       and add more information (for example, for which version does the
!      testcase work, for which versions does it fail?)  is also very
       helpful.
  
  
  File: gfortran.info,  Node: Proposed Extensions,  Prev: Projects,  Up: Contributing
  
  Proposed Extensions
  ===================
  
! Here's a list of proposed extensions for the GNU Fortran compiler, in no
! particular order.  Most of these are necessary to be fully compatible
! with existing Fortran compilers, but they are not part of the official
! J3 Fortran 95 standard.
  
  Compiler extensions:
  --------------------
*************** Compiler extensions:
*** 17618,17625 ****
  
     * Automatically extend single precision constants to double.
  
!    * Compile code that conserves memory by dynamically allocating
!      common and module storage either on stack or heap.
  
     * Compile flag to generate code for array conformance checking
       (suggest -CC).
--- 17384,17391 ----
  
     * Automatically extend single precision constants to double.
  
!    * Compile code that conserves memory by dynamically allocating common
!      and module storage either on stack or heap.
  
     * Compile flag to generate code for array conformance checking
       (suggest -CC).
*************** Environment Options
*** 17667,17673 ****
     * Environment variable forcing standard output to be line buffered
       (Unix).
  
- 
  
  File: gfortran.info,  Node: Copying,  Next: GNU Free Documentation License,  Prev: Contributing,  Up: Top
  
--- 17433,17438 ----
*************** GNU General Public License
*** 17676,17682 ****
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
--- 17441,17447 ----
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
*************** want it, that you can change the softwar
*** 17704,17712 ****
  free programs, and that you know you can do these things.
  
     To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you
! have certain responsibilities if you distribute copies of the software,
! or if you modify it: responsibilities to respect the freedom of others.
  
     For example, if you distribute copies of such a program, whether
  gratis or for a fee, you must pass on to the recipients the same
--- 17469,17477 ----
  free programs, and that you know you can do these things.
  
     To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you have
! certain responsibilities if you distribute copies of the software, or if
! you modify it: responsibilities to respect the freedom of others.
  
     For example, if you distribute copies of such a program, whether
  gratis or for a fee, you must pass on to the recipients the same
*************** changed, so that their problems will not
*** 17725,17740 ****
  authors of previous versions.
  
     Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the
! manufacturer can do so.  This is fundamentally incompatible with the
! aim of protecting users' freedom to change the software.  The
! systematic pattern of such abuse occurs in the area of products for
! individuals to use, which is precisely where it is most unacceptable.
! Therefore, we have designed this version of the GPL to prohibit the
! practice for those products.  If such problems arise substantially in
! other domains, we stand ready to extend this provision to those domains
! in future versions of the GPL, as needed to protect the freedom of
! users.
  
     Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
--- 17490,17504 ----
  authors of previous versions.
  
     Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the manufacturer
! can do so.  This is fundamentally incompatible with the aim of
! protecting users' freedom to change the software.  The systematic
! pattern of such abuse occurs in the area of products for individuals to
! use, which is precisely where it is most unacceptable.  Therefore, we
! have designed this version of the GPL to prohibit the practice for those
! products.  If such problems arise substantially in other domains, we
! stand ready to extend this provision to those domains in future versions
! of the GPL, as needed to protect the freedom of users.
  
     Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
*************** TERMS AND CONDITIONS
*** 17771,17778 ****
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it
!      on a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
--- 17535,17542 ----
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it on
!      a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
*************** TERMS AND CONDITIONS
*** 17786,17793 ****
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may
!      convey the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
--- 17550,17557 ----
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may convey
!      the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
*************** TERMS AND CONDITIONS
*** 17795,17802 ****
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any
!      non-source form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
--- 17559,17566 ----
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any non-source
!      form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
*************** TERMS AND CONDITIONS
*** 17807,17816 ****
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work
!      with that Major Component, or to implement a Standard Interface
!      for which an implementation is available to the public in source
!      code form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
--- 17571,17580 ----
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work with
!      that Major Component, or to implement a Standard Interface for
!      which an implementation is available to the public in source code
!      form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
*************** TERMS AND CONDITIONS
*** 17818,17832 ****
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including
!      scripts to control those activities.  However, it does not include
!      the work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files
!      associated with source files for the work, and the source code for
!      shared libraries and dynamically linked subprograms that the work
!      is specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
--- 17582,17596 ----
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including scripts
!      to control those activities.  However, it does not include the
!      work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files associated
!      with source files for the work, and the source code for shared
!      libraries and dynamically linked subprograms that the work is
!      specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
*************** TERMS AND CONDITIONS
*** 17843,17864 ****
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output,
!      given its content, constitutes a covered work.  This License
!      acknowledges your rights of fair use or other equivalent, as
!      provided by copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for
!      you, or provide you with facilities for running those works,
!      provided that you comply with the terms of this License in
!      conveying all material for which you do not control copyright.
!      Those thus making or running the covered works for you must do so
!      exclusively on your behalf, under your direction and control, on
!      terms that prohibit them from making any copies of your
!      copyrighted material outside their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
--- 17607,17628 ----
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output, given
!      its content, constitutes a covered work.  This License acknowledges
!      your rights of fair use or other equivalent, as provided by
!      copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for you,
!      or provide you with facilities for running those works, provided
!      that you comply with the terms of this License in conveying all
!      material for which you do not control copyright.  Those thus making
!      or running the covered works for you must do so exclusively on your
!      behalf, under your direction and control, on terms that prohibit
!      them from making any copies of your copyrighted material outside
!      their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
*************** TERMS AND CONDITIONS
*** 17875,17882 ****
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention
!      to limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
--- 17639,17646 ----
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention to
!      limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
*************** TERMS AND CONDITIONS
*** 17946,17953 ****
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for
!           as long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
--- 17710,17717 ----
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for as
!           long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
*************** TERMS AND CONDITIONS
*** 17957,17988 ****
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of
!           the written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access
!           to the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated
!           by you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to
!           the object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long
!           as needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
- 
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
--- 17721,17751 ----
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of the
!           written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access to
!           the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated by
!           you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to the
!           object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long as
!           needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
*************** TERMS AND CONDITIONS
*** 17990,17997 ****
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product
!      is a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
--- 17753,17760 ----
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product is
!      a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
*************** TERMS AND CONDITIONS
*** 18022,18032 ****
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or
!      installed by the recipient, or for the User Product in which it
!      has been modified or installed.  Access to a network may be denied
!      when the modification itself materially and adversely affects the
!      operation of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
--- 17785,17795 ----
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or installed
!      by the recipient, or for the User Product in which it has been
!      modified or installed.  Access to a network may be denied when the
!      modification itself materially and adversely affects the operation
!      of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
*************** TERMS AND CONDITIONS
*** 18056,18063 ****
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License
!      with terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
--- 17819,17826 ----
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License with
!      terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
*************** TERMS AND CONDITIONS
*** 18067,18075 ****
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be
!           marked in reasonable ways as different from the original
!           version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
--- 17830,17837 ----
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be marked
!           in reasonable ways as different from the original version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
*************** TERMS AND CONDITIONS
*** 18088,18098 ****
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or
!      conveying under this License, you may add to a covered work
!      material governed by the terms of that license document, provided
!      that the further restriction does not survive such relicensing or
!      conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
--- 17850,17859 ----
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or conveying
!      under this License, you may add to a covered work material governed
!      by the terms of that license document, provided that the further
!      restriction does not survive such relicensing or conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
*************** TERMS AND CONDITIONS
*** 18108,18120 ****
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under
!      the third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 17869,17881 ----
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under the
!      third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** TERMS AND CONDITIONS
*** 18126,18135 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, you do not qualify to receive new
!      licenses for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
--- 17887,17896 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, you do not qualify to receive new licenses
!      for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
*************** TERMS AND CONDITIONS
*** 18143,18149 ****
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!  10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
--- 17904,17910 ----
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!   10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
*************** TERMS AND CONDITIONS
*** 18157,18177 ****
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to
!      possession of the Corresponding Source of the work from the
!      predecessor in interest, if the predecessor has it or can get it
!      with reasonable efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for
!      exercise of rights granted under this License, and you may not
!      initiate litigation (including a cross-claim or counterclaim in a
!      lawsuit) alleging that any patent claim is infringed by making,
!      using, selling, offering for sale, or importing the Program or any
!      portion of it.
  
!  11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
--- 17918,17938 ----
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to possession
!      of the Corresponding Source of the work from the predecessor in
!      interest, if the predecessor has it or can get it with reasonable
!      efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for exercise
!      of rights granted under this License, and you may not initiate
!      litigation (including a cross-claim or counterclaim in a lawsuit)
!      alleging that any patent claim is infringed by making, using,
!      selling, offering for sale, or importing the Program or any portion
!      of it.
  
!   11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
*************** TERMS AND CONDITIONS
*** 18191,18205 ****
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its
!      contributor version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To
!      "grant" such a patent license to a party means to make such an
!      agreement or commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
--- 17952,17966 ----
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its contributor
!      version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To "grant"
!      such a patent license to a party means to make such an agreement or
!      commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
*************** TERMS AND CONDITIONS
*** 18229,18264 ****
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under
!      which you make payment to the third party based on the extent of
!      your activity of conveying the work, and under which the third
!      party grants, to any of the parties who would receive the covered
!      work from you, a discriminatory patent license (a) in connection
!      with copies of the covered work conveyed by you (or copies made
!      from those copies), or (b) primarily for and in connection with
!      specific products or compilations that contain the covered work,
!      unless you entered into that arrangement, or that patent license
!      was granted, prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!  12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order,
!      agreement or otherwise) that contradict the conditions of this
!      License, they do not excuse you from the conditions of this
!      License.  If you cannot convey a covered work so as to satisfy
!      simultaneously your obligations under this License and any other
!      pertinent obligations, then as a consequence you may not convey it
!      at all.  For example, if you agree to terms that obligate you to
!      collect a royalty for further conveying from those to whom you
!      convey the Program, the only way you could satisfy both those
!      terms and this License would be to refrain entirely from conveying
!      the Program.
  
!  13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
--- 17990,18024 ----
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under which
!      you make payment to the third party based on the extent of your
!      activity of conveying the work, and under which the third party
!      grants, to any of the parties who would receive the covered work
!      from you, a discriminatory patent license (a) in connection with
!      copies of the covered work conveyed by you (or copies made from
!      those copies), or (b) primarily for and in connection with specific
!      products or compilations that contain the covered work, unless you
!      entered into that arrangement, or that patent license was granted,
!      prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!   12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order, agreement
!      or otherwise) that contradict the conditions of this License, they
!      do not excuse you from the conditions of this License.  If you
!      cannot convey a covered work so as to satisfy simultaneously your
!      obligations under this License and any other pertinent obligations,
!      then as a consequence you may not convey it at all.  For example,
!      if you agree to terms that obligate you to collect a royalty for
!      further conveying from those to whom you convey the Program, the
!      only way you could satisfy both those terms and this License would
!      be to refrain entirely from conveying the Program.
  
!   13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
*************** TERMS AND CONDITIONS
*** 18269,18290 ****
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!  14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.
!      Such new versions will be similar in spirit to the present
!      version, but may differ in detail to address new problems or
!      concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the
!      Free Software Foundation.  If the Program does not specify a
!      version number of the GNU General Public License, you may choose
!      any version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
--- 18029,18049 ----
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!   14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.  Such
!      new versions will be similar in spirit to the present version, but
!      may differ in detail to address new problems or concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the Free
!      Software Foundation.  If the Program does not specify a version
!      number of the GNU General Public License, you may choose any
!      version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
*************** TERMS AND CONDITIONS
*** 18296,18319 ****
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!  15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!  16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU
!      FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
--- 18055,18078 ----
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!   15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!   16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR
!      DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
*************** TERMS AND CONDITIONS
*** 18321,18327 ****
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!  17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
--- 18080,18086 ----
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!   17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
*************** TERMS AND CONDITIONS
*** 18330,18336 ****
       connection with the Program, unless a warranty or assumption of
       liability accompanies a copy of the Program in return for a fee.
  
- 
  END OF TERMS AND CONDITIONS
  ===========================
  
--- 18089,18094 ----
*************** state the exclusion of warranty; and eac
*** 18361,18367 ****
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see `http://www.gnu.org/licenses/'.
  
     Also add information on how to contact you by electronic and paper
  mail.
--- 18119,18125 ----
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see <http://www.gnu.org/licenses/>.
  
     Also add information on how to contact you by electronic and paper
  mail.
*************** mail.
*** 18370,18380 ****
  notice like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type `show c' for details.
  
!    The hypothetical commands `show w' and `show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
--- 18128,18138 ----
  notice like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type 'show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type 'show c' for details.
  
!    The hypothetical commands 'show w' and 'show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
*************** use an "about box".
*** 18382,18395 ****
     You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see `http://www.gnu.org/licenses/'.
  
     The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read `http://www.gnu.org/philosophy/why-not-lgpl.html'.
  
  
  File: gfortran.info,  Node: GNU Free Documentation License,  Next: Funding,  Prev: Copying,  Up: Top
--- 18140,18153 ----
     You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see <http://www.gnu.org/licenses/>.
  
     The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read <http://www.gnu.org/philosophy/why-not-lgpl.html>.
  
  
  File: gfortran.info,  Node: GNU Free Documentation License,  Next: Funding,  Prev: Copying,  Up: Top
*************** GNU Free Documentation License
*** 18400,18406 ****
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
--- 18158,18164 ----
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
*************** GNU Free Documentation License
*** 18425,18445 ****
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.
!      We recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it
!      can be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You
!      accept the license if you copy, modify or distribute the work in a
!      way requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
--- 18183,18203 ----
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.  We
!      recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it can
!      be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You accept
!      the license if you copy, modify or distribute the work in a way
!      requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
*************** GNU Free Documentation License
*** 18457,18468 ****
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in
!      the notice that says that the Document is released under this
!      License.  If a section does not fit the above definition of
!      Secondary then it is not allowed to be designated as Invariant.
!      The Document may contain zero Invariant Sections.  If the Document
!      does not identify any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
--- 18215,18226 ----
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in the
!      notice that says that the Document is released under this License.
!      If a section does not fit the above definition of Secondary then it
!      is not allowed to be designated as Invariant.  The Document may
!      contain zero Invariant Sections.  If the Document does not identify
!      any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
*************** GNU Free Documentation License
*** 18473,18499 ****
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images
!      composed of pixels) generic paint programs or (for drawings) some
!      widely available drawing editor, and that is suitable for input to
!      text formatters or for automatic translation to a variety of
!      formats suitable for input to text formatters.  A copy made in an
!      otherwise Transparent file format whose markup, or absence of
!      markup, has been arranged to thwart or discourage subsequent
!      modification by readers is not Transparent.  An image format is
!      not Transparent if used for any substantial amount of text.  A
!      copy that is not "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and
!      standard-conforming simple HTML, PostScript or PDF designed for
!      human modification.  Examples of transparent image formats include
!      PNG, XCF and JPG.  Opaque formats include proprietary formats that
!      can be read and edited only by proprietary word processors, SGML or
!      XML for which the DTD and/or processing tools are not generally
!      available, and the machine-generated HTML, PostScript or PDF
!      produced by some word processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
--- 18231,18257 ----
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images composed
!      of pixels) generic paint programs or (for drawings) some widely
!      available drawing editor, and that is suitable for input to text
!      formatters or for automatic translation to a variety of formats
!      suitable for input to text formatters.  A copy made in an otherwise
!      Transparent file format whose markup, or absence of markup, has
!      been arranged to thwart or discourage subsequent modification by
!      readers is not Transparent.  An image format is not Transparent if
!      used for any substantial amount of text.  A copy that is not
!      "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and standard-conforming
!      simple HTML, PostScript or PDF designed for human modification.
!      Examples of transparent image formats include PNG, XCF and JPG.
!      Opaque formats include proprietary formats that can be read and
!      edited only by proprietary word processors, SGML or XML for which
!      the DTD and/or processing tools are not generally available, and
!      the machine-generated HTML, PostScript or PDF produced by some word
!      processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
*************** GNU Free Documentation License
*** 18531,18538 ****
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow
!      the conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
--- 18289,18296 ----
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow the
!      conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
*************** GNU Free Documentation License
*** 18546,18557 ****
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the
!      title equally prominent and visible.  You may add other material
!      on the covers in addition.  Copying with changes limited to the
!      covers, as long as they preserve the title of the Document and
!      satisfy these conditions, can be treated as verbatim copying in
!      other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
--- 18304,18314 ----
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the title
!      equally prominent and visible.  You may add other material on the
!      covers in addition.  Copying with changes limited to the covers, as
!      long as they preserve the title of the Document and satisfy these
!      conditions, can be treated as verbatim copying in other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
*************** GNU Free Documentation License
*** 18559,18598 ****
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a
!      machine-readable Transparent copy along with each Opaque copy, or
!      state in or with each Opaque copy a computer-network location from
!      which the general network-using public has access to download
!      using public-standard network protocols a complete Transparent
!      copy of the Document, free of added material.  If you use the
!      latter option, you must take reasonably prudent steps, when you
!      begin distribution of Opaque copies in quantity, to ensure that
!      this Transparent copy will remain thus accessible at the stated
!      location until at least one year after the last time you
!      distribute an Opaque copy (directly or through your agents or
!      retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of
!      copies, to give them a chance to provide you with an updated
!      version of the Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with
!      the Modified Version filling the role of the Document, thus
!      licensing distribution and modification of the Modified Version to
!      whoever possesses a copy of it.  In addition, you must do these
!      things in the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of
!           previous versions (which should, if there were any, be listed
!           in the History section of the Document).  You may use the
!           same title as a previous version if the original publisher of
!           that version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
--- 18316,18354 ----
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a machine-readable
!      Transparent copy along with each Opaque copy, or state in or with
!      each Opaque copy a computer-network location from which the general
!      network-using public has access to download using public-standard
!      network protocols a complete Transparent copy of the Document, free
!      of added material.  If you use the latter option, you must take
!      reasonably prudent steps, when you begin distribution of Opaque
!      copies in quantity, to ensure that this Transparent copy will
!      remain thus accessible at the stated location until at least one
!      year after the last time you distribute an Opaque copy (directly or
!      through your agents or retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of copies,
!      to give them a chance to provide you with an updated version of the
!      Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with the
!      Modified Version filling the role of the Document, thus licensing
!      distribution and modification of the Modified Version to whoever
!      possesses a copy of it.  In addition, you must do these things in
!      the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of previous
!           versions (which should, if there were any, be listed in the
!           History section of the Document).  You may use the same title
!           as a previous version if the original publisher of that
!           version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
*************** GNU Free Documentation License
*** 18622,18652 ****
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on
!           the Title Page.  If there is no section Entitled "History" in
!           the Document, create one stating the title, year, authors,
!           and publisher of the Document as given on its Title Page,
!           then add an item describing the Modified Version as stated in
!           the previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in
!           the "History" section.  You may omit a network location for a
!           work that was published at least four years before the
!           Document itself, or if the original publisher of the version
!           it refers to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the
!           section all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document,
!           unaltered in their text and in their titles.  Section numbers
!           or the equivalent are not considered part of the section
!           titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
--- 18378,18407 ----
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on the
!           Title Page.  If there is no section Entitled "History" in the
!           Document, create one stating the title, year, authors, and
!           publisher of the Document as given on its Title Page, then add
!           an item describing the Modified Version as stated in the
!           previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in the
!           "History" section.  You may omit a network location for a work
!           that was published at least four years before the Document
!           itself, or if the original publisher of the version it refers
!           to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the section
!           all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document, unaltered
!           in their text and in their titles.  Section numbers or the
!           equivalent are not considered part of the section titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
*************** GNU Free Documentation License
*** 18659,18669 ****
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option
!      designate some or all of these sections as invariant.  To do this,
!      add their titles to the list of Invariant Sections in the Modified
!      Version's license notice.  These titles must be distinct from any
!      other section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
--- 18414,18424 ----
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option designate
!      some or all of these sections as invariant.  To do this, add their
!      titles to the list of Invariant Sections in the Modified Version's
!      license notice.  These titles must be distinct from any other
!      section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
*************** GNU Free Documentation License
*** 18672,18686 ****
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end
!      of the list of Cover Texts in the Modified Version.  Only one
!      passage of Front-Cover Text and one of Back-Cover Text may be
!      added by (or through arrangements made by) any one entity.  If the
!      Document already includes a cover text for the same cover,
!      previously added by you or by arrangement made by the same entity
!      you are acting on behalf of, you may not add another; but you may
!      replace the old one, on explicit permission from the previous
!      publisher that added the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
--- 18427,18441 ----
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end of
!      the list of Cover Texts in the Modified Version.  Only one passage
!      of Front-Cover Text and one of Back-Cover Text may be added by (or
!      through arrangements made by) any one entity.  If the Document
!      already includes a cover text for the same cover, previously added
!      by you or by arrangement made by the same entity you are acting on
!      behalf of, you may not add another; but you may replace the old
!      one, on explicit permission from the previous publisher that added
!      the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
*************** GNU Free Documentation License
*** 18690,18697 ****
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination
!      all of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
--- 18445,18452 ----
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination all
!      of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
*************** GNU Free Documentation License
*** 18718,18737 ****
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the
!      documents in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow
!      this License in all other respects regarding verbatim copying of
!      that document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of
!      a storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
--- 18473,18492 ----
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the documents
!      in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow this
!      License in all other respects regarding verbatim copying of that
!      document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of a
!      storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
*************** GNU Free Documentation License
*** 18776,18783 ****
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 18531,18538 ----
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** GNU Free Documentation License
*** 18789,18821 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, receipt of a copy of some or all of
!      the same material does not give you any rights to use it.
  
!  10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      `http://www.gnu.org/copyleft/'.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If
!      the Document does not specify a version number of this License,
!      you may choose any version ever published (not as a draft) by the
!      Free Software Foundation.  If the Document specifies that a proxy
!      can decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!  11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
--- 18544,18576 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, receipt of a copy of some or all of the
!      same material does not give you any rights to use it.
  
!   10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      <http://www.gnu.org/copyleft/>.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If the
!      Document does not specify a version number of this License, you may
!      choose any version ever published (not as a draft) by the Free
!      Software Foundation.  If the Document specifies that a proxy can
!      decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!   11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
*************** GNU Free Documentation License
*** 18845,18851 ****
       site under CC-BY-SA on the same site at any time before August 1,
       2009, provided the MMC is eligible for relicensing.
  
- 
  ADDENDUM: How to use this License for your documents
  ====================================================
  
--- 18600,18605 ----
*************** notices just after the title page:
*** 18862,18868 ****
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts." line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
--- 18616,18622 ----
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts."  line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
*************** combination of the three, merge those tw
*** 18873,18881 ****
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of
! free software license, such as the GNU General Public License, to
! permit their use in free software.
  
  
  File: gfortran.info,  Node: Funding,  Next: Option Index,  Prev: GNU Free Documentation License,  Up: Top
--- 18627,18635 ----
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of free
! software license, such as the GNU General Public License, to permit
! their use in free software.
  
  
  File: gfortran.info,  Node: Funding,  Next: Option Index,  Prev: GNU Free Documentation License,  Up: Top
*************** for comparison.
*** 18905,18912 ****
  
     Even a precise fraction "of the profits from this disk" is not very
  meaningful, since creative accounting and unrelated business decisions
! can greatly alter what fraction of the sales price counts as profit.
! If the price you pay is $50, ten percent of the profit is probably less
  than a dollar; it might be a few cents, or nothing at all.
  
     Some redistributors do development work themselves.  This is useful
--- 18659,18666 ----
  
     Even a precise fraction "of the profits from this disk" is not very
  meaningful, since creative accounting and unrelated business decisions
! can greatly alter what fraction of the sales price counts as profit.  If
! the price you pay is $50, ten percent of the profit is probably less
  than a dollar; it might be a few cents, or nothing at all.
  
     Some redistributors do development work themselves.  This is useful
*************** difference than others.  For example, ma
*** 18916,18923 ****
  a program contributes very little; maintaining the standard version of a
  program for the whole community contributes much.  Easy new ports
  contribute little, since someone else would surely do them; difficult
! ports such as adding a new CPU to the GNU Compiler Collection
! contribute more; major new features or packages contribute the most.
  
     By establishing the idea that supporting further development is "the
  proper thing to do" when distributing free software for a fee, we can
--- 18670,18677 ----
  a program contributes very little; maintaining the standard version of a
  program for the whole community contributes much.  Easy new ports
  contribute little, since someone else would surely do them; difficult
! ports such as adding a new CPU to the GNU Compiler Collection contribute
! more; major new features or packages contribute the most.
  
     By establishing the idea that supporting further development is "the
  proper thing to do" when distributing free software for a fee, we can
*************** File: gfortran.info,  Node: Option Index
*** 18933,18957 ****
  Option Index
  ************
  
! `gfortran''s command line options are indexed here without any initial
! `-' or `--'.  Where an option has both positive and negative forms
! (such as -foption and -fno-option), relevant entries in the manual are
! indexed under the most appropriate form; it may sometimes be useful to
! look up both forms.
  
  [index]
  * Menu:
  
  * A-PREDICATE=ANSWER:                    Preprocessing Options.
!                                                               (line 120)
  * APREDICATE=ANSWER:                     Preprocessing Options.
!                                                               (line 114)
  * backslash:                             Fortran Dialect Options.
                                                                (line  40)
  * C:                                     Preprocessing Options.
!                                                               (line 123)
  * CC:                                    Preprocessing Options.
!                                                               (line 138)
  * cpp:                                   Preprocessing Options.
                                                                (line  12)
  * dD:                                    Preprocessing Options.
--- 18687,18711 ----
  Option Index
  ************
  
! 'gfortran''s command line options are indexed here without any initial
! '-' or '--'.  Where an option has both positive and negative forms (such
! as -foption and -fno-option), relevant entries in the manual are indexed
! under the most appropriate form; it may sometimes be useful to look up
! both forms.
  
  [index]
  * Menu:
  
  * A-PREDICATE=ANSWER:                    Preprocessing Options.
!                                                               (line 119)
  * APREDICATE=ANSWER:                     Preprocessing Options.
!                                                               (line 113)
  * backslash:                             Fortran Dialect Options.
                                                                (line  40)
  * C:                                     Preprocessing Options.
!                                                               (line 122)
  * CC:                                    Preprocessing Options.
!                                                               (line 137)
  * cpp:                                   Preprocessing Options.
                                                                (line  12)
  * dD:                                    Preprocessing Options.
*************** look up both forms.
*** 18963,18982 ****
  * dN:                                    Preprocessing Options.
                                                                (line  41)
  * DNAME:                                 Preprocessing Options.
!                                                               (line 153)
  * DNAME=DEFINITION:                      Preprocessing Options.
!                                                               (line 156)
  * dU:                                    Preprocessing Options.
                                                                (line  44)
! * faggressive-function-elimination:      Code Gen Options.    (line 343)
! * falign-commons:                        Code Gen Options.    (line 316)
  * fall-intrinsics:                       Fortran Dialect Options.
                                                                (line  17)
! * fblas-matmul-limit:                    Code Gen Options.    (line 268)
! * fbounds-check:                         Code Gen Options.    (line 192)
! * fcheck:                                Code Gen Options.    (line 143)
! * fcheck-array-temporaries:              Code Gen Options.    (line 195)
! * fcoarray:                              Code Gen Options.    (line 129)
  * fconvert=CONVERSION:                   Runtime Options.     (line  10)
  * fcray-pointer:                         Fortran Dialect Options.
                                                                (line  86)
--- 18717,18736 ----
  * dN:                                    Preprocessing Options.
                                                                (line  41)
  * DNAME:                                 Preprocessing Options.
!                                                               (line 151)
  * DNAME=DEFINITION:                      Preprocessing Options.
!                                                               (line 154)
  * dU:                                    Preprocessing Options.
                                                                (line  44)
! * faggressive-function-elimination:      Code Gen Options.    (line 339)
! * falign-commons:                        Code Gen Options.    (line 312)
  * fall-intrinsics:                       Fortran Dialect Options.
                                                                (line  17)
! * fblas-matmul-limit:                    Code Gen Options.    (line 267)
! * fbounds-check:                         Code Gen Options.    (line 191)
! * fcheck:                                Code Gen Options.    (line 141)
! * fcheck-array-temporaries:              Code Gen Options.    (line 194)
! * fcoarray:                              Code Gen Options.    (line 127)
  * fconvert=CONVERSION:                   Runtime Options.     (line  10)
  * fcray-pointer:                         Fortran Dialect Options.
                                                                (line  86)
*************** look up both forms.
*** 18985,19007 ****
  * fd-lines-as-comments:                  Fortran Dialect Options.
                                                                (line  27)
  * fdefault-double-8:                     Fortran Dialect Options.
!                                                               (line 136)
  * fdefault-integer-8:                    Fortran Dialect Options.
!                                                               (line 122)
  * fdefault-real-8:                       Fortran Dialect Options.
!                                                               (line 128)
  * fdollar-ok:                            Fortran Dialect Options.
                                                                (line  34)
  * fdump-fortran-optimized:               Debugging Options.   (line  15)
  * fdump-fortran-original:                Debugging Options.   (line  10)
  * fdump-parse-tree:                      Debugging Options.   (line  19)
! * fexternal-blas:                        Code Gen Options.    (line 260)
  * ff2c:                                  Code Gen Options.    (line  25)
  * ffixed-form:                           Fortran Dialect Options.
                                                                (line  11)
  * ffixed-line-length-N:                  Fortran Dialect Options.
                                                                (line  57)
! * ffpe-summary=LIST:                     Debugging Options.   (line  52)
  * ffpe-trap=LIST:                        Debugging Options.   (line  25)
  * ffree-form:                            Fortran Dialect Options.
                                                                (line  11)
--- 18739,18761 ----
  * fd-lines-as-comments:                  Fortran Dialect Options.
                                                                (line  27)
  * fdefault-double-8:                     Fortran Dialect Options.
!                                                               (line 135)
  * fdefault-integer-8:                    Fortran Dialect Options.
!                                                               (line 121)
  * fdefault-real-8:                       Fortran Dialect Options.
!                                                               (line 127)
  * fdollar-ok:                            Fortran Dialect Options.
                                                                (line  34)
  * fdump-fortran-optimized:               Debugging Options.   (line  15)
  * fdump-fortran-original:                Debugging Options.   (line  10)
  * fdump-parse-tree:                      Debugging Options.   (line  19)
! * fexternal-blas:                        Code Gen Options.    (line 259)
  * ff2c:                                  Code Gen Options.    (line  25)
  * ffixed-form:                           Fortran Dialect Options.
                                                                (line  11)
  * ffixed-line-length-N:                  Fortran Dialect Options.
                                                                (line  57)
! * ffpe-summary=LIST:                     Debugging Options.   (line  51)
  * ffpe-trap=LIST:                        Debugging Options.   (line  25)
  * ffree-form:                            Fortran Dialect Options.
                                                                (line  11)
*************** look up both forms.
*** 19009,19102 ****
                                                                (line  70)
  * fimplicit-none:                        Fortran Dialect Options.
                                                                (line  81)
! * finit-character:                       Code Gen Options.    (line 288)
! * finit-integer:                         Code Gen Options.    (line 288)
! * finit-local-zero:                      Code Gen Options.    (line 288)
! * finit-logical:                         Code Gen Options.    (line 288)
! * finit-real:                            Code Gen Options.    (line 288)
  * finteger-4-integer-8:                  Fortran Dialect Options.
!                                                               (line 145)
  * fintrinsic-modules-path DIR:           Directory Options.   (line  36)
! * fmax-array-constructor:                Code Gen Options.    (line 198)
  * fmax-errors=N:                         Error and Warning Options.
                                                                (line  27)
  * fmax-identifier-length=N:              Fortran Dialect Options.
                                                                (line  77)
! * fmax-stack-var-size:                   Code Gen Options.    (line 216)
  * fmax-subrecord-length=LENGTH:          Runtime Options.     (line  29)
  * fmodule-private:                       Fortran Dialect Options.
                                                                (line  52)
  * fno-automatic:                         Code Gen Options.    (line  15)
! * fno-backtrace:                         Debugging Options.   (line  62)
! * fno-protect-parens:                    Code Gen Options.    (line 328)
  * fno-underscoring:                      Code Gen Options.    (line  54)
  * fopenacc:                              Fortran Dialect Options.
                                                                (line  90)
  * fopenmp:                               Fortran Dialect Options.
!                                                               (line 102)
! * fpack-derived:                         Code Gen Options.    (line 238)
  * fpp:                                   Preprocessing Options.
                                                                (line  12)
  * frange-check:                          Fortran Dialect Options.
!                                                               (line 110)
  * freal-4-real-10:                       Fortran Dialect Options.
!                                                               (line 161)
  * freal-4-real-16:                       Fortran Dialect Options.
!                                                               (line 161)
  * freal-4-real-8:                        Fortran Dialect Options.
!                                                               (line 161)
  * freal-8-real-10:                       Fortran Dialect Options.
!                                                               (line 161)
  * freal-8-real-16:                       Fortran Dialect Options.
!                                                               (line 161)
  * freal-8-real-4:                        Fortran Dialect Options.
!                                                               (line 161)
! * frealloc-lhs:                          Code Gen Options.    (line 337)
  * frecord-marker=LENGTH:                 Runtime Options.     (line  21)
! * frecursive:                            Code Gen Options.    (line 279)
! * frepack-arrays:                        Code Gen Options.    (line 244)
! * frontend-optimize:                     Code Gen Options.    (line 351)
! * fsecond-underscore:                    Code Gen Options.    (line 112)
  * fshort-enums <1>:                      Fortran 2003 status. (line  93)
- * fshort-enums:                          Code Gen Options.    (line 254)
  * fsign-zero:                            Runtime Options.     (line  34)
! * fstack-arrays:                         Code Gen Options.    (line 230)
  * fsyntax-only:                          Error and Warning Options.
                                                                (line  33)
  * fworking-directory:                    Preprocessing Options.
                                                                (line  55)
  * H:                                     Preprocessing Options.
!                                                               (line 176)
  * IDIR:                                  Directory Options.   (line  14)
  * idirafter DIR:                         Preprocessing Options.
!                                                               (line  70)
  * imultilib DIR:                         Preprocessing Options.
!                                                               (line  77)
  * iprefix PREFIX:                        Preprocessing Options.
!                                                               (line  81)
  * iquote DIR:                            Preprocessing Options.
!                                                               (line  90)
  * isysroot DIR:                          Preprocessing Options.
!                                                               (line  86)
  * isystem DIR:                           Preprocessing Options.
!                                                               (line  97)
  * JDIR:                                  Directory Options.   (line  29)
  * MDIR:                                  Directory Options.   (line  29)
  * nostdinc:                              Preprocessing Options.
!                                                               (line 105)
  * P:                                     Preprocessing Options.
!                                                               (line 181)
  * pedantic:                              Error and Warning Options.
                                                                (line  38)
  * pedantic-errors:                       Error and Warning Options.
                                                                (line  57)
  * static-libgfortran:                    Link Options.        (line  11)
  * std=STD option:                        Fortran Dialect Options.
!                                                               (line 172)
  * UNAME:                                 Preprocessing Options.
!                                                               (line 187)
  * undef:                                 Preprocessing Options.
!                                                               (line 110)
  * Waliasing:                             Error and Warning Options.
                                                                (line  69)
  * Walign-commons:                        Error and Warning Options.
--- 18763,18856 ----
                                                                (line  70)
  * fimplicit-none:                        Fortran Dialect Options.
                                                                (line  81)
! * finit-character:                       Code Gen Options.    (line 287)
! * finit-integer:                         Code Gen Options.    (line 287)
! * finit-local-zero:                      Code Gen Options.    (line 287)
! * finit-logical:                         Code Gen Options.    (line 287)
! * finit-real:                            Code Gen Options.    (line 287)
  * finteger-4-integer-8:                  Fortran Dialect Options.
!                                                               (line 144)
  * fintrinsic-modules-path DIR:           Directory Options.   (line  36)
! * fmax-array-constructor:                Code Gen Options.    (line 197)
  * fmax-errors=N:                         Error and Warning Options.
                                                                (line  27)
  * fmax-identifier-length=N:              Fortran Dialect Options.
                                                                (line  77)
! * fmax-stack-var-size:                   Code Gen Options.    (line 215)
  * fmax-subrecord-length=LENGTH:          Runtime Options.     (line  29)
  * fmodule-private:                       Fortran Dialect Options.
                                                                (line  52)
  * fno-automatic:                         Code Gen Options.    (line  15)
! * fno-backtrace:                         Debugging Options.   (line  61)
! * fno-protect-parens:                    Code Gen Options.    (line 324)
  * fno-underscoring:                      Code Gen Options.    (line  54)
  * fopenacc:                              Fortran Dialect Options.
                                                                (line  90)
  * fopenmp:                               Fortran Dialect Options.
!                                                               (line 101)
! * fpack-derived:                         Code Gen Options.    (line 237)
  * fpp:                                   Preprocessing Options.
                                                                (line  12)
  * frange-check:                          Fortran Dialect Options.
!                                                               (line 109)
  * freal-4-real-10:                       Fortran Dialect Options.
!                                                               (line 159)
  * freal-4-real-16:                       Fortran Dialect Options.
!                                                               (line 159)
  * freal-4-real-8:                        Fortran Dialect Options.
!                                                               (line 159)
  * freal-8-real-10:                       Fortran Dialect Options.
!                                                               (line 159)
  * freal-8-real-16:                       Fortran Dialect Options.
!                                                               (line 159)
  * freal-8-real-4:                        Fortran Dialect Options.
!                                                               (line 159)
! * frealloc-lhs:                          Code Gen Options.    (line 333)
  * frecord-marker=LENGTH:                 Runtime Options.     (line  21)
! * frecursive:                            Code Gen Options.    (line 278)
! * frepack-arrays:                        Code Gen Options.    (line 243)
! * frontend-optimize:                     Code Gen Options.    (line 347)
! * fsecond-underscore:                    Code Gen Options.    (line 110)
! * fshort-enums:                          Code Gen Options.    (line 253)
  * fshort-enums <1>:                      Fortran 2003 status. (line  93)
  * fsign-zero:                            Runtime Options.     (line  34)
! * fstack-arrays:                         Code Gen Options.    (line 229)
  * fsyntax-only:                          Error and Warning Options.
                                                                (line  33)
  * fworking-directory:                    Preprocessing Options.
                                                                (line  55)
  * H:                                     Preprocessing Options.
!                                                               (line 174)
  * IDIR:                                  Directory Options.   (line  14)
  * idirafter DIR:                         Preprocessing Options.
!                                                               (line  69)
  * imultilib DIR:                         Preprocessing Options.
!                                                               (line  76)
  * iprefix PREFIX:                        Preprocessing Options.
!                                                               (line  80)
  * iquote DIR:                            Preprocessing Options.
!                                                               (line  89)
  * isysroot DIR:                          Preprocessing Options.
!                                                               (line  85)
  * isystem DIR:                           Preprocessing Options.
!                                                               (line  96)
  * JDIR:                                  Directory Options.   (line  29)
  * MDIR:                                  Directory Options.   (line  29)
  * nostdinc:                              Preprocessing Options.
!                                                               (line 104)
  * P:                                     Preprocessing Options.
!                                                               (line 179)
  * pedantic:                              Error and Warning Options.
                                                                (line  38)
  * pedantic-errors:                       Error and Warning Options.
                                                                (line  57)
  * static-libgfortran:                    Link Options.        (line  11)
  * std=STD option:                        Fortran Dialect Options.
!                                                               (line 170)
  * UNAME:                                 Preprocessing Options.
!                                                               (line 185)
  * undef:                                 Preprocessing Options.
!                                                               (line 109)
  * Waliasing:                             Error and Warning Options.
                                                                (line  69)
  * Walign-commons:                        Error and Warning Options.
*************** look up both forms.
*** 19112,19124 ****
  * Wcharacter-truncation:                 Error and Warning Options.
                                                                (line 106)
  * Wcompare-reals:                        Error and Warning Options.
!                                                               (line 234)
  * Wconversion:                           Error and Warning Options.
                                                                (line 115)
  * Wconversion-extra:                     Error and Warning Options.
                                                                (line 119)
  * Werror:                                Error and Warning Options.
!                                                               (line 246)
  * Wextra:                                Error and Warning Options.
                                                                (line 123)
  * Wfunction-elimination:                 Error and Warning Options.
--- 18866,18878 ----
  * Wcharacter-truncation:                 Error and Warning Options.
                                                                (line 106)
  * Wcompare-reals:                        Error and Warning Options.
!                                                               (line 233)
  * Wconversion:                           Error and Warning Options.
                                                                (line 115)
  * Wconversion-extra:                     Error and Warning Options.
                                                                (line 119)
  * Werror:                                Error and Warning Options.
!                                                               (line 245)
  * Wextra:                                Error and Warning Options.
                                                                (line 123)
  * Wfunction-elimination:                 Error and Warning Options.
*************** look up both forms.
*** 19138,19150 ****
  * Wrealloc-lhs:                          Error and Warning Options.
                                                                (line 216)
  * Wrealloc-lhs-all:                      Error and Warning Options.
!                                                               (line 229)
  * Wsurprising:                           Error and Warning Options.
                                                                (line 149)
  * Wtabs:                                 Error and Warning Options.
                                                                (line 171)
  * Wtargt-lifetime:                       Error and Warning Options.
!                                                               (line 238)
  * Wunderflow:                            Error and Warning Options.
                                                                (line 179)
  * Wunused-dummy-argument:                Error and Warning Options.
--- 18892,18904 ----
  * Wrealloc-lhs:                          Error and Warning Options.
                                                                (line 216)
  * Wrealloc-lhs-all:                      Error and Warning Options.
!                                                               (line 228)
  * Wsurprising:                           Error and Warning Options.
                                                                (line 149)
  * Wtabs:                                 Error and Warning Options.
                                                                (line 171)
  * Wtargt-lifetime:                       Error and Warning Options.
!                                                               (line 237)
  * Wunderflow:                            Error and Warning Options.
                                                                (line 179)
  * Wunused-dummy-argument:                Error and Warning Options.
*************** look up both forms.
*** 19154,19160 ****
  * Wuse-without-only:                     Error and Warning Options.
                                                                (line 191)
  * Wzerotrip:                             Error and Warning Options.
!                                                               (line 242)
  
  
  File: gfortran.info,  Node: Keyword Index,  Prev: Option Index,  Up: Top
--- 18908,18914 ----
  * Wuse-without-only:                     Error and Warning Options.
                                                                (line 191)
  * Wzerotrip:                             Error and Warning Options.
!                                                               (line 241)
  
  
  File: gfortran.info,  Node: Keyword Index,  Prev: Option Index,  Up: Top
*************** Keyword Index
*** 19190,19201 ****
  * ABS:                                   ABS.                 (line   6)
  * absolute value:                        ABS.                 (line   6)
  * ACCESS:                                ACCESS.              (line   6)
! * ACCESS='STREAM' I/O:                   Fortran 2003 status. (line 105)
  * ACHAR:                                 ACHAR.               (line   6)
  * ACOS:                                  ACOS.                (line   6)
  * ACOSH:                                 ACOSH.               (line   6)
- * adjust string <1>:                     ADJUSTR.             (line   6)
  * adjust string:                         ADJUSTL.             (line   6)
  * ADJUSTL:                               ADJUSTL.             (line   6)
  * ADJUSTR:                               ADJUSTR.             (line   6)
  * AIMAG:                                 AIMAG.               (line   6)
--- 18944,18955 ----
  * ABS:                                   ABS.                 (line   6)
  * absolute value:                        ABS.                 (line   6)
  * ACCESS:                                ACCESS.              (line   6)
! * ACCESS='STREAM' I/O:                   Fortran 2003 status. (line 103)
  * ACHAR:                                 ACHAR.               (line   6)
  * ACOS:                                  ACOS.                (line   6)
  * ACOSH:                                 ACOSH.               (line   6)
  * adjust string:                         ADJUSTL.             (line   6)
+ * adjust string <1>:                     ADJUSTR.             (line   6)
  * ADJUSTL:                               ADJUSTL.             (line   6)
  * ADJUSTR:                               ADJUSTR.             (line   6)
  * AIMAG:                                 AIMAG.               (line   6)
*************** Keyword Index
*** 19204,19219 ****
  * ALGAMA:                                LOG_GAMMA.           (line   6)
  * aliasing:                              Error and Warning Options.
                                                                (line  69)
- * alignment of COMMON blocks <1>:        Code Gen Options.    (line 316)
  * alignment of COMMON blocks:            Error and Warning Options.
                                                                (line 206)
  * ALL:                                   ALL.                 (line   6)
  * all warnings:                          Error and Warning Options.
                                                                (line  61)
  * ALLOCATABLE components of derived types: Fortran 2003 status.
!                                                               (line 103)
  * ALLOCATABLE dummy arguments:           Fortran 2003 status. (line  99)
! * ALLOCATABLE function results:          Fortran 2003 status. (line 101)
  * ALLOCATED:                             ALLOCATED.           (line   6)
  * allocation, moving:                    MOVE_ALLOC.          (line   6)
  * allocation, status:                    ALLOCATED.           (line   6)
--- 18958,18973 ----
  * ALGAMA:                                LOG_GAMMA.           (line   6)
  * aliasing:                              Error and Warning Options.
                                                                (line  69)
  * alignment of COMMON blocks:            Error and Warning Options.
                                                                (line 206)
+ * alignment of COMMON blocks <1>:        Code Gen Options.    (line 312)
  * ALL:                                   ALL.                 (line   6)
  * all warnings:                          Error and Warning Options.
                                                                (line  61)
  * ALLOCATABLE components of derived types: Fortran 2003 status.
!                                                               (line 101)
  * ALLOCATABLE dummy arguments:           Fortran 2003 status. (line  99)
! * ALLOCATABLE function results:          Fortran 2003 status. (line 100)
  * ALLOCATED:                             ALLOCATED.           (line   6)
  * allocation, moving:                    MOVE_ALLOC.          (line   6)
  * allocation, status:                    ALLOCATED.           (line   6)
*************** Keyword Index
*** 19232,19253 ****
  * area hyperbolic tangent:               ATANH.               (line   6)
  * argument list functions:               Argument list functions.
                                                                (line   6)
- * arguments, to program <1>:             IARGC.               (line   6)
- * arguments, to program <2>:             GET_COMMAND_ARGUMENT.
-                                                               (line   6)
- * arguments, to program <3>:             GET_COMMAND.         (line   6)
- * arguments, to program <4>:             GETARG.              (line   6)
  * arguments, to program:                 COMMAND_ARGUMENT_COUNT.
                                                                (line   6)
  * array, add elements:                   SUM.                 (line   6)
  * array, AND:                            IALL.                (line   6)
- * array, apply condition <1>:            ANY.                 (line   6)
  * array, apply condition:                ALL.                 (line   6)
! * array, bounds checking:                Code Gen Options.    (line 143)
  * array, change dimensions:              RESHAPE.             (line   6)
  * array, combine arrays:                 MERGE.               (line   6)
- * array, condition testing <1>:          ANY.                 (line   6)
  * array, condition testing:              ALL.                 (line   6)
  * array, conditionally add elements:     SUM.                 (line   6)
  * array, conditionally count elements:   COUNT.               (line   6)
  * array, conditionally multiply elements: PRODUCT.            (line   6)
--- 18986,19007 ----
  * area hyperbolic tangent:               ATANH.               (line   6)
  * argument list functions:               Argument list functions.
                                                                (line   6)
  * arguments, to program:                 COMMAND_ARGUMENT_COUNT.
                                                                (line   6)
+ * arguments, to program <1>:             GETARG.              (line   6)
+ * arguments, to program <2>:             GET_COMMAND.         (line   6)
+ * arguments, to program <3>:             GET_COMMAND_ARGUMENT.
+                                                               (line   6)
+ * arguments, to program <4>:             IARGC.               (line   6)
  * array, add elements:                   SUM.                 (line   6)
  * array, AND:                            IALL.                (line   6)
  * array, apply condition:                ALL.                 (line   6)
! * array, apply condition <1>:            ANY.                 (line   6)
! * array, bounds checking:                Code Gen Options.    (line 141)
  * array, change dimensions:              RESHAPE.             (line   6)
  * array, combine arrays:                 MERGE.               (line   6)
  * array, condition testing:              ALL.                 (line   6)
+ * array, condition testing <1>:          ANY.                 (line   6)
  * array, conditionally add elements:     SUM.                 (line   6)
  * array, conditionally count elements:   COUNT.               (line   6)
  * array, conditionally multiply elements: PRODUCT.            (line   6)
*************** Keyword Index
*** 19257,19264 ****
  * array, duplicate elements:             SPREAD.              (line   6)
  * array, element counting:               COUNT.               (line   6)
  * array, gather elements:                PACK.                (line   6)
- * array, increase dimension <1>:         UNPACK.              (line   6)
  * array, increase dimension:             SPREAD.              (line   6)
  * array, indices of type real:           Real array indices.  (line   6)
  * array, location of maximum element:    MAXLOC.              (line   6)
  * array, location of minimum element:    MINLOC.              (line   6)
--- 19011,19018 ----
  * array, duplicate elements:             SPREAD.              (line   6)
  * array, element counting:               COUNT.               (line   6)
  * array, gather elements:                PACK.                (line   6)
  * array, increase dimension:             SPREAD.              (line   6)
+ * array, increase dimension <1>:         UNPACK.              (line   6)
  * array, indices of type real:           Real array indices.  (line   6)
  * array, location of maximum element:    MAXLOC.              (line   6)
  * array, location of minimum element:    MINLOC.              (line   6)
*************** Keyword Index
*** 19267,19274 ****
  * array, merge arrays:                   MERGE.               (line   6)
  * array, minimum value:                  MINVAL.              (line   6)
  * array, multiply elements:              PRODUCT.             (line   6)
- * array, number of elements <1>:         SIZE.                (line   6)
  * array, number of elements:             COUNT.               (line   6)
  * array, OR:                             IANY.                (line   6)
  * array, packing:                        PACK.                (line   6)
  * array, parity:                         IPARITY.             (line   6)
--- 19021,19028 ----
  * array, merge arrays:                   MERGE.               (line   6)
  * array, minimum value:                  MINVAL.              (line   6)
  * array, multiply elements:              PRODUCT.             (line   6)
  * array, number of elements:             COUNT.               (line   6)
+ * array, number of elements <1>:         SIZE.                (line   6)
  * array, OR:                             IANY.                (line   6)
  * array, packing:                        PACK.                (line   6)
  * array, parity:                         IPARITY.             (line   6)
*************** Keyword Index
*** 19287,19294 ****
  * array, unpacking:                      UNPACK.              (line   6)
  * array, upper bound:                    UBOUND.              (line   6)
  * array, XOR:                            IPARITY.             (line   6)
- * ASCII collating sequence <1>:          IACHAR.              (line   6)
  * ASCII collating sequence:              ACHAR.               (line   6)
  * ASIN:                                  ASIN.                (line   6)
  * ASINH:                                 ASINH.               (line   6)
  * ASSOCIATED:                            ASSOCIATED.          (line   6)
--- 19041,19048 ----
  * array, unpacking:                      UNPACK.              (line   6)
  * array, upper bound:                    UBOUND.              (line   6)
  * array, XOR:                            IPARITY.             (line   6)
  * ASCII collating sequence:              ACHAR.               (line   6)
+ * ASCII collating sequence <1>:          IACHAR.              (line   6)
  * ASIN:                                  ASIN.                (line   6)
  * ASINH:                                 ASINH.               (line   6)
  * ASSOCIATED:                            ASSOCIATED.          (line   6)
*************** Keyword Index
*** 19310,19317 ****
  * Atomic subroutine, XOR with fetch:     ATOMIC_FETCH_XOR.    (line   6)
  * ATOMIC_ADD:                            ATOMIC_ADD.          (line   6)
  * ATOMIC_AND:                            ATOMIC_AND.          (line   6)
- * ATOMIC_DEFINE <1>:                     ATOMIC_DEFINE.       (line   6)
  * ATOMIC_DEFINE:                         ATOMIC_CAS.          (line   6)
  * ATOMIC_FETCH_ADD:                      ATOMIC_FETCH_ADD.    (line   6)
  * ATOMIC_FETCH_AND:                      ATOMIC_FETCH_AND.    (line   6)
  * ATOMIC_FETCH_OR:                       ATOMIC_FETCH_OR.     (line   6)
--- 19064,19071 ----
  * Atomic subroutine, XOR with fetch:     ATOMIC_FETCH_XOR.    (line   6)
  * ATOMIC_ADD:                            ATOMIC_ADD.          (line   6)
  * ATOMIC_AND:                            ATOMIC_AND.          (line   6)
  * ATOMIC_DEFINE:                         ATOMIC_CAS.          (line   6)
+ * ATOMIC_DEFINE <1>:                     ATOMIC_DEFINE.       (line   6)
  * ATOMIC_FETCH_ADD:                      ATOMIC_FETCH_ADD.    (line   6)
  * ATOMIC_FETCH_AND:                      ATOMIC_FETCH_AND.    (line   6)
  * ATOMIC_FETCH_OR:                       ATOMIC_FETCH_OR.     (line   6)
*************** Keyword Index
*** 19324,19342 ****
                                                                (line  40)
  * BACKSPACE:                             Read/Write after EOF marker.
                                                                (line   6)
- * backtrace:                             BACKTRACE.           (line   6)
  * BACKTRACE:                             BACKTRACE.           (line   6)
! * backtrace:                             Debugging Options.   (line  62)
  * base 10 logarithm function:            LOG10.               (line   6)
  * BESJ0:                                 BESSEL_J0.           (line   6)
  * BESJ1:                                 BESSEL_J1.           (line   6)
  * BESJN:                                 BESSEL_JN.           (line   6)
- * Bessel function, first kind <1>:       BESSEL_JN.           (line   6)
- * Bessel function, first kind <2>:       BESSEL_J1.           (line   6)
  * Bessel function, first kind:           BESSEL_J0.           (line   6)
! * Bessel function, second kind <1>:      BESSEL_YN.           (line   6)
! * Bessel function, second kind <2>:      BESSEL_Y1.           (line   6)
  * Bessel function, second kind:          BESSEL_Y0.           (line   6)
  * BESSEL_J0:                             BESSEL_J0.           (line   6)
  * BESSEL_J1:                             BESSEL_J1.           (line   6)
  * BESSEL_JN:                             BESSEL_JN.           (line   6)
--- 19078,19096 ----
                                                                (line  40)
  * BACKSPACE:                             Read/Write after EOF marker.
                                                                (line   6)
  * BACKTRACE:                             BACKTRACE.           (line   6)
! * backtrace:                             Debugging Options.   (line  61)
! * backtrace <1>:                         BACKTRACE.           (line   6)
  * base 10 logarithm function:            LOG10.               (line   6)
  * BESJ0:                                 BESSEL_J0.           (line   6)
  * BESJ1:                                 BESSEL_J1.           (line   6)
  * BESJN:                                 BESSEL_JN.           (line   6)
  * Bessel function, first kind:           BESSEL_J0.           (line   6)
! * Bessel function, first kind <1>:       BESSEL_J1.           (line   6)
! * Bessel function, first kind <2>:       BESSEL_JN.           (line   6)
  * Bessel function, second kind:          BESSEL_Y0.           (line   6)
+ * Bessel function, second kind <1>:      BESSEL_Y1.           (line   6)
+ * Bessel function, second kind <2>:      BESSEL_YN.           (line   6)
  * BESSEL_J0:                             BESSEL_J0.           (line   6)
  * BESSEL_J1:                             BESSEL_J1.           (line   6)
  * BESSEL_JN:                             BESSEL_JN.           (line   6)
*************** Keyword Index
*** 19348,19401 ****
  * BESYN:                                 BESSEL_YN.           (line   6)
  * BGE:                                   BGE.                 (line   6)
  * BGT:                                   BGT.                 (line   6)
- * binary representation <1>:             POPPAR.              (line   6)
  * binary representation:                 POPCNT.              (line   6)
! * BIT_SIZE:                              BIT_SIZE.            (line   6)
  * bits set:                              POPCNT.              (line   6)
  * bits, AND of array elements:           IALL.                (line   6)
  * bits, clear:                           IBCLR.               (line   6)
  * bits, extract:                         IBITS.               (line   6)
  * bits, get:                             IBITS.               (line   6)
  * bits, merge:                           MERGE_BITS.          (line   6)
- * bits, move <1>:                        TRANSFER.            (line   6)
  * bits, move:                            MVBITS.              (line   6)
  * bits, negate:                          NOT.                 (line   6)
  * bits, number of:                       BIT_SIZE.            (line   6)
  * bits, OR of array elements:            IANY.                (line   6)
  * bits, set:                             IBSET.               (line   6)
  * bits, shift:                           ISHFT.               (line   6)
  * bits, shift circular:                  ISHFTC.              (line   6)
- * bits, shift left <1>:                  SHIFTL.              (line   6)
  * bits, shift left:                      LSHIFT.              (line   6)
! * bits, shift right <1>:                 SHIFTR.              (line   6)
! * bits, shift right <2>:                 SHIFTA.              (line   6)
  * bits, shift right:                     RSHIFT.              (line   6)
  * bits, testing:                         BTEST.               (line   6)
  * bits, unset:                           IBCLR.               (line   6)
  * bits, XOR of array elements:           IPARITY.             (line   6)
- * bitwise comparison <1>:                BLT.                 (line   6)
- * bitwise comparison <2>:                BLE.                 (line   6)
- * bitwise comparison <3>:                BGT.                 (line   6)
  * bitwise comparison:                    BGE.                 (line   6)
! * bitwise logical and <1>:               IAND.                (line   6)
  * bitwise logical and:                   AND.                 (line   6)
! * bitwise logical exclusive or <1>:      XOR.                 (line   6)
  * bitwise logical exclusive or:          IEOR.                (line   6)
  * bitwise logical not:                   NOT.                 (line   6)
- * bitwise logical or <1>:                OR.                  (line   6)
  * bitwise logical or:                    IOR.                 (line   6)
  * BLE:                                   BLE.                 (line   6)
  * BLT:                                   BLT.                 (line   6)
! * bounds checking:                       Code Gen Options.    (line 143)
  * BOZ literal constants:                 BOZ literal constants.
                                                                (line   6)
  * BTEST:                                 BTEST.               (line   6)
- * C_ASSOCIATED:                          C_ASSOCIATED.        (line   6)
- * C_F_POINTER:                           C_F_POINTER.         (line   6)
- * C_F_PROCPOINTER:                       C_F_PROCPOINTER.     (line   6)
- * C_FUNLOC:                              C_FUNLOC.            (line   6)
- * C_LOC:                                 C_LOC.               (line   6)
- * C_SIZEOF:                              C_SIZEOF.            (line   6)
  * CABS:                                  ABS.                 (line   6)
  * calling convention:                    Code Gen Options.    (line  25)
  * CCOS:                                  COS.                 (line   6)
--- 19102,19149 ----
  * BESYN:                                 BESSEL_YN.           (line   6)
  * BGE:                                   BGE.                 (line   6)
  * BGT:                                   BGT.                 (line   6)
  * binary representation:                 POPCNT.              (line   6)
! * binary representation <1>:             POPPAR.              (line   6)
  * bits set:                              POPCNT.              (line   6)
  * bits, AND of array elements:           IALL.                (line   6)
  * bits, clear:                           IBCLR.               (line   6)
  * bits, extract:                         IBITS.               (line   6)
  * bits, get:                             IBITS.               (line   6)
  * bits, merge:                           MERGE_BITS.          (line   6)
  * bits, move:                            MVBITS.              (line   6)
+ * bits, move <1>:                        TRANSFER.            (line   6)
  * bits, negate:                          NOT.                 (line   6)
  * bits, number of:                       BIT_SIZE.            (line   6)
  * bits, OR of array elements:            IANY.                (line   6)
  * bits, set:                             IBSET.               (line   6)
  * bits, shift:                           ISHFT.               (line   6)
  * bits, shift circular:                  ISHFTC.              (line   6)
  * bits, shift left:                      LSHIFT.              (line   6)
! * bits, shift left <1>:                  SHIFTL.              (line   6)
  * bits, shift right:                     RSHIFT.              (line   6)
+ * bits, shift right <1>:                 SHIFTA.              (line   6)
+ * bits, shift right <2>:                 SHIFTR.              (line   6)
  * bits, testing:                         BTEST.               (line   6)
  * bits, unset:                           IBCLR.               (line   6)
  * bits, XOR of array elements:           IPARITY.             (line   6)
  * bitwise comparison:                    BGE.                 (line   6)
! * bitwise comparison <1>:                BGT.                 (line   6)
! * bitwise comparison <2>:                BLE.                 (line   6)
! * bitwise comparison <3>:                BLT.                 (line   6)
  * bitwise logical and:                   AND.                 (line   6)
! * bitwise logical and <1>:               IAND.                (line   6)
  * bitwise logical exclusive or:          IEOR.                (line   6)
+ * bitwise logical exclusive or <1>:      XOR.                 (line   6)
  * bitwise logical not:                   NOT.                 (line   6)
  * bitwise logical or:                    IOR.                 (line   6)
+ * bitwise logical or <1>:                OR.                  (line   6)
+ * BIT_SIZE:                              BIT_SIZE.            (line   6)
  * BLE:                                   BLE.                 (line   6)
  * BLT:                                   BLT.                 (line   6)
! * bounds checking:                       Code Gen Options.    (line 141)
  * BOZ literal constants:                 BOZ literal constants.
                                                                (line   6)
  * BTEST:                                 BTEST.               (line   6)
  * CABS:                                  ABS.                 (line   6)
  * calling convention:                    Code Gen Options.    (line  25)
  * CCOS:                                  COS.                 (line   6)
*************** Keyword Index
*** 19405,19432 ****
  * CDLOG:                                 LOG.                 (line   6)
  * CDSIN:                                 SIN.                 (line   6)
  * CDSQRT:                                SQRT.                (line   6)
- * ceiling:                               CEILING.             (line   6)
  * CEILING:                               CEILING.             (line   6)
  * ceiling:                               ANINT.               (line   6)
  * CEXP:                                  EXP.                 (line   6)
  * CHAR:                                  CHAR.                (line   6)
  * character kind:                        SELECTED_CHAR_KIND.  (line   6)
  * character set:                         Fortran Dialect Options.
                                                                (line  34)
  * CHDIR:                                 CHDIR.               (line   6)
! * checking array temporaries:            Code Gen Options.    (line 143)
! * checking subscripts:                   Code Gen Options.    (line 143)
  * CHMOD:                                 CHMOD.               (line   6)
- * clock ticks <1>:                       SYSTEM_CLOCK.        (line   6)
- * clock ticks <2>:                       MCLOCK8.             (line   6)
  * clock ticks:                           MCLOCK.              (line   6)
  * CLOG:                                  LOG.                 (line   6)
  * CMPLX:                                 CMPLX.               (line   6)
! * CO_BROADCAST:                          CO_BROADCAST.        (line   6)
! * CO_MAX:                                CO_MAX.              (line   6)
! * CO_MIN:                                CO_MIN.              (line   6)
! * CO_REDUCE:                             CO_REDUCE.           (line   6)
! * CO_SUM:                                CO_SUM.              (line   6)
  * Coarray, _gfortran_caf_atomic_cas:     _gfortran_caf_atomic_cas.
                                                                (line   6)
  * Coarray, _gfortran_caf_atomic_define:  _gfortran_caf_atomic_define.
--- 19153,19180 ----
  * CDLOG:                                 LOG.                 (line   6)
  * CDSIN:                                 SIN.                 (line   6)
  * CDSQRT:                                SQRT.                (line   6)
  * CEILING:                               CEILING.             (line   6)
  * ceiling:                               ANINT.               (line   6)
+ * ceiling <1>:                           CEILING.             (line   6)
  * CEXP:                                  EXP.                 (line   6)
  * CHAR:                                  CHAR.                (line   6)
  * character kind:                        SELECTED_CHAR_KIND.  (line   6)
  * character set:                         Fortran Dialect Options.
                                                                (line  34)
  * CHDIR:                                 CHDIR.               (line   6)
! * checking array temporaries:            Code Gen Options.    (line 141)
! * checking subscripts:                   Code Gen Options.    (line 141)
  * CHMOD:                                 CHMOD.               (line   6)
  * clock ticks:                           MCLOCK.              (line   6)
+ * clock ticks <1>:                       MCLOCK8.             (line   6)
+ * clock ticks <2>:                       SYSTEM_CLOCK.        (line   6)
  * CLOG:                                  LOG.                 (line   6)
  * CMPLX:                                 CMPLX.               (line   6)
! * coarray, IMAGE_INDEX:                  IMAGE_INDEX.         (line   6)
! * coarray, lower bound:                  LCOBOUND.            (line   6)
! * coarray, NUM_IMAGES:                   NUM_IMAGES.          (line   6)
! * coarray, THIS_IMAGE:                   THIS_IMAGE.          (line   6)
! * coarray, upper bound:                  UCOBOUND.            (line   6)
  * Coarray, _gfortran_caf_atomic_cas:     _gfortran_caf_atomic_cas.
                                                                (line   6)
  * Coarray, _gfortran_caf_atomic_define:  _gfortran_caf_atomic_define.
*************** Keyword Index
*** 19445,19454 ****
                                                                (line   6)
  * Coarray, _gfortran_caf_co_sum:         _gfortran_caf_co_sum.
                                                                (line   6)
- * Coarray, _gfortran_caf_deregister <1>: _gfortran_caf_deregister.
-                                                               (line   6)
  * Coarray, _gfortran_caf_deregister:     _gfortran_caf_register.
                                                                (line   6)
  * Coarray, _gfortran_caf_error_stop:     _gfortran_caf_error_stop.
                                                                (line   6)
  * Coarray, _gfortran_caf_error_stop_str: _gfortran_caf_error_stop_str.
--- 19193,19202 ----
                                                                (line   6)
  * Coarray, _gfortran_caf_co_sum:         _gfortran_caf_co_sum.
                                                                (line   6)
  * Coarray, _gfortran_caf_deregister:     _gfortran_caf_register.
                                                                (line   6)
+ * Coarray, _gfortran_caf_deregister <1>: _gfortran_caf_deregister.
+                                                               (line   6)
  * Coarray, _gfortran_caf_error_stop:     _gfortran_caf_error_stop.
                                                                (line   6)
  * Coarray, _gfortran_caf_error_stop_str: _gfortran_caf_error_stop_str.
*************** Keyword Index
*** 19479,19494 ****
                                                                (line   6)
  * Coarray, _gfortran_caf_unlock:         _gfortran_caf_unlock.
                                                                (line   6)
! * coarray, IMAGE_INDEX:                  IMAGE_INDEX.         (line   6)
! * coarray, lower bound:                  LCOBOUND.            (line   6)
! * coarray, NUM_IMAGES:                   NUM_IMAGES.          (line   6)
! * coarray, THIS_IMAGE:                   THIS_IMAGE.          (line   6)
! * coarray, upper bound:                  UCOBOUND.            (line   6)
  * Coarrays:                              Coarray Programming. (line   6)
- * coarrays:                              Code Gen Options.    (line 129)
  * code generation, conventions:          Code Gen Options.    (line   6)
- * collating sequence, ASCII <1>:         IACHAR.              (line   6)
  * collating sequence, ASCII:             ACHAR.               (line   6)
  * Collectives, generic reduction:        CO_REDUCE.           (line   6)
  * Collectives, maximal value:            CO_MAX.              (line   6)
  * Collectives, minimal value:            CO_MIN.              (line   6)
--- 19227,19237 ----
                                                                (line   6)
  * Coarray, _gfortran_caf_unlock:         _gfortran_caf_unlock.
                                                                (line   6)
! * coarrays:                              Code Gen Options.    (line 127)
  * Coarrays:                              Coarray Programming. (line   6)
  * code generation, conventions:          Code Gen Options.    (line   6)
  * collating sequence, ASCII:             ACHAR.               (line   6)
+ * collating sequence, ASCII <1>:         IACHAR.              (line   6)
  * Collectives, generic reduction:        CO_REDUCE.           (line   6)
  * Collectives, maximal value:            CO_MAX.              (line   6)
  * Collectives, minimal value:            CO_MIN.              (line   6)
*************** Keyword Index
*** 19498,19513 ****
                                                                (line   6)
  * command options:                       Invoking GNU Fortran.
                                                                (line   6)
- * command-line arguments <1>:            IARGC.               (line   6)
- * command-line arguments <2>:            GET_COMMAND_ARGUMENT.
-                                                               (line   6)
- * command-line arguments <3>:            GET_COMMAND.         (line   6)
- * command-line arguments <4>:            GETARG.              (line   6)
  * command-line arguments:                COMMAND_ARGUMENT_COUNT.
                                                                (line   6)
! * command-line arguments, number of <1>: IARGC.               (line   6)
  * command-line arguments, number of:     COMMAND_ARGUMENT_COUNT.
                                                                (line   6)
  * COMMAND_ARGUMENT_COUNT:                COMMAND_ARGUMENT_COUNT.
                                                                (line   6)
  * COMMON:                                Volatile COMMON blocks.
--- 19241,19256 ----
                                                                (line   6)
  * command options:                       Invoking GNU Fortran.
                                                                (line   6)
  * command-line arguments:                COMMAND_ARGUMENT_COUNT.
                                                                (line   6)
! * command-line arguments <1>:            GETARG.              (line   6)
! * command-line arguments <2>:            GET_COMMAND.         (line   6)
! * command-line arguments <3>:            GET_COMMAND_ARGUMENT.
!                                                               (line   6)
! * command-line arguments <4>:            IARGC.               (line   6)
  * command-line arguments, number of:     COMMAND_ARGUMENT_COUNT.
                                                                (line   6)
+ * command-line arguments, number of <1>: IARGC.               (line   6)
  * COMMAND_ARGUMENT_COUNT:                COMMAND_ARGUMENT_COUNT.
                                                                (line   6)
  * COMMON:                                Volatile COMMON blocks.
*************** Keyword Index
*** 19520,19531 ****
  * complex conjugate:                     CONJG.               (line   6)
  * Complex function:                      Alternate complex function syntax.
                                                                (line   6)
- * complex numbers, conversion to <1>:    DCMPLX.              (line   6)
- * complex numbers, conversion to <2>:    COMPLEX.             (line   6)
  * complex numbers, conversion to:        CMPLX.               (line   6)
  * complex numbers, imaginary part:       AIMAG.               (line   6)
- * complex numbers, real part <1>:        REAL.                (line   6)
  * complex numbers, real part:            DREAL.               (line   6)
  * Conditional compilation:               Preprocessing and conditional compilation.
                                                                (line   6)
  * CONJG:                                 CONJG.               (line   6)
--- 19263,19274 ----
  * complex conjugate:                     CONJG.               (line   6)
  * Complex function:                      Alternate complex function syntax.
                                                                (line   6)
  * complex numbers, conversion to:        CMPLX.               (line   6)
+ * complex numbers, conversion to <1>:    COMPLEX.             (line   6)
+ * complex numbers, conversion to <2>:    DCMPLX.              (line   6)
  * complex numbers, imaginary part:       AIMAG.               (line   6)
  * complex numbers, real part:            DREAL.               (line   6)
+ * complex numbers, real part <1>:        REAL.                (line   6)
  * Conditional compilation:               Preprocessing and conditional compilation.
                                                                (line   6)
  * CONJG:                                 CONJG.               (line   6)
*************** Keyword Index
*** 19535,19557 ****
  * Contributors:                          Contributors.        (line   6)
  * conversion:                            Error and Warning Options.
                                                                (line 115)
  * conversion, to character:              CHAR.                (line   6)
- * conversion, to complex <1>:            DCMPLX.              (line   6)
- * conversion, to complex <2>:            COMPLEX.             (line   6)
  * conversion, to complex:                CMPLX.               (line   6)
! * conversion, to integer <1>:            LONG.                (line   6)
! * conversion, to integer <2>:            INT8.                (line   6)
! * conversion, to integer <3>:            INT2.                (line   6)
! * conversion, to integer <4>:            INT.                 (line   6)
! * conversion, to integer <5>:            ICHAR.               (line   6)
! * conversion, to integer <6>:            IACHAR.              (line   6)
  * conversion, to integer:                Implicitly convert LOGICAL and INTEGER values.
                                                                (line   6)
! * conversion, to logical <1>:            LOGICAL.             (line   6)
  * conversion, to logical:                Implicitly convert LOGICAL and INTEGER values.
                                                                (line   6)
! * conversion, to real <1>:               REAL.                (line   6)
  * conversion, to real:                   DBLE.                (line   6)
  * conversion, to string:                 CTIME.               (line   6)
  * CONVERT specifier:                     CONVERT specifier.   (line   6)
  * core, dump:                            ABORT.               (line   6)
--- 19278,19302 ----
  * Contributors:                          Contributors.        (line   6)
  * conversion:                            Error and Warning Options.
                                                                (line 115)
+ * conversion <1>:                        Error and Warning Options.
+                                                               (line 119)
  * conversion, to character:              CHAR.                (line   6)
  * conversion, to complex:                CMPLX.               (line   6)
! * conversion, to complex <1>:            COMPLEX.             (line   6)
! * conversion, to complex <2>:            DCMPLX.              (line   6)
  * conversion, to integer:                Implicitly convert LOGICAL and INTEGER values.
                                                                (line   6)
! * conversion, to integer <1>:            IACHAR.              (line   6)
! * conversion, to integer <2>:            ICHAR.               (line   6)
! * conversion, to integer <3>:            INT.                 (line   6)
! * conversion, to integer <4>:            INT2.                (line   6)
! * conversion, to integer <5>:            INT8.                (line   6)
! * conversion, to integer <6>:            LONG.                (line   6)
  * conversion, to logical:                Implicitly convert LOGICAL and INTEGER values.
                                                                (line   6)
! * conversion, to logical <1>:            LOGICAL.             (line   6)
  * conversion, to real:                   DBLE.                (line   6)
+ * conversion, to real <1>:               REAL.                (line   6)
  * conversion, to string:                 CTIME.               (line   6)
  * CONVERT specifier:                     CONVERT specifier.   (line   6)
  * core, dump:                            ABORT.               (line   6)
*************** Keyword Index
*** 19562,19585 ****
  * cosine, hyperbolic, inverse:           ACOSH.               (line   6)
  * cosine, inverse:                       ACOS.                (line   6)
  * COUNT:                                 COUNT.               (line   6)
! * CPP <1>:                               Preprocessing Options.
!                                                               (line   6)
  * CPP:                                   Preprocessing and conditional compilation.
                                                                (line   6)
  * CPU_TIME:                              CPU_TIME.            (line   6)
  * Credits:                               Contributors.        (line   6)
  * CSHIFT:                                CSHIFT.              (line   6)
  * CSIN:                                  SIN.                 (line   6)
  * CSQRT:                                 SQRT.                (line   6)
  * CTIME:                                 CTIME.               (line   6)
- * current date <1>:                      IDATE.               (line   6)
- * current date <2>:                      FDATE.               (line   6)
  * current date:                          DATE_AND_TIME.       (line   6)
! * current time <1>:                      TIME8.               (line   6)
! * current time <2>:                      TIME.                (line   6)
! * current time <3>:                      ITIME.               (line   6)
! * current time <4>:                      FDATE.               (line   6)
  * current time:                          DATE_AND_TIME.       (line   6)
  * DABS:                                  ABS.                 (line   6)
  * DACOS:                                 ACOS.                (line   6)
  * DACOSH:                                ACOSH.               (line   6)
--- 19307,19341 ----
  * cosine, hyperbolic, inverse:           ACOSH.               (line   6)
  * cosine, inverse:                       ACOS.                (line   6)
  * COUNT:                                 COUNT.               (line   6)
! * CO_BROADCAST:                          CO_BROADCAST.        (line   6)
! * CO_MAX:                                CO_MAX.              (line   6)
! * CO_MIN:                                CO_MIN.              (line   6)
! * CO_REDUCE:                             CO_REDUCE.           (line   6)
! * CO_SUM:                                CO_SUM.              (line   6)
  * CPP:                                   Preprocessing and conditional compilation.
                                                                (line   6)
+ * CPP <1>:                               Preprocessing Options.
+                                                               (line   6)
  * CPU_TIME:                              CPU_TIME.            (line   6)
  * Credits:                               Contributors.        (line   6)
  * CSHIFT:                                CSHIFT.              (line   6)
  * CSIN:                                  SIN.                 (line   6)
  * CSQRT:                                 SQRT.                (line   6)
  * CTIME:                                 CTIME.               (line   6)
  * current date:                          DATE_AND_TIME.       (line   6)
! * current date <1>:                      FDATE.               (line   6)
! * current date <2>:                      IDATE.               (line   6)
  * current time:                          DATE_AND_TIME.       (line   6)
+ * current time <1>:                      FDATE.               (line   6)
+ * current time <2>:                      ITIME.               (line   6)
+ * current time <3>:                      TIME.                (line   6)
+ * current time <4>:                      TIME8.               (line   6)
+ * C_ASSOCIATED:                          C_ASSOCIATED.        (line   6)
+ * C_FUNLOC:                              C_FUNLOC.            (line   6)
+ * C_F_POINTER:                           C_F_POINTER.         (line   6)
+ * C_F_PROCPOINTER:                       C_F_PROCPOINTER.     (line   6)
+ * C_LOC:                                 C_LOC.               (line   6)
+ * C_SIZEOF:                              C_SIZEOF.            (line   6)
  * DABS:                                  ABS.                 (line   6)
  * DACOS:                                 ACOS.                (line   6)
  * DACOSH:                                ACOSH.               (line   6)
*************** Keyword Index
*** 19588,19596 ****
  * DATAN:                                 ATAN.                (line   6)
  * DATAN2:                                ATAN2.               (line   6)
  * DATANH:                                ATANH.               (line   6)
- * date, current <1>:                     IDATE.               (line   6)
- * date, current <2>:                     FDATE.               (line   6)
  * date, current:                         DATE_AND_TIME.       (line   6)
  * DATE_AND_TIME:                         DATE_AND_TIME.       (line   6)
  * DBESJ0:                                BESSEL_J0.           (line   6)
  * DBESJ1:                                BESSEL_J1.           (line   6)
--- 19344,19352 ----
  * DATAN:                                 ATAN.                (line   6)
  * DATAN2:                                ATAN2.               (line   6)
  * DATANH:                                ATANH.               (line   6)
  * date, current:                         DATE_AND_TIME.       (line   6)
+ * date, current <1>:                     FDATE.               (line   6)
+ * date, current <2>:                     IDATE.               (line   6)
  * DATE_AND_TIME:                         DATE_AND_TIME.       (line   6)
  * DBESJ0:                                BESSEL_J0.           (line   6)
  * DBESJ1:                                BESSEL_J1.           (line   6)
*************** Keyword Index
*** 19607,19616 ****
  * debugging information options:         Debugging Options.   (line   6)
  * debugging, preprocessor:               Preprocessing Options.
                                                                (line  26)
  * DECODE:                                ENCODE and DECODE statements.
                                                                (line   6)
- * delayed execution <1>:                 SLEEP.               (line   6)
  * delayed execution:                     ALARM.               (line   6)
  * DEXP:                                  EXP.                 (line   6)
  * DFLOAT:                                REAL.                (line   6)
  * DGAMMA:                                GAMMA.               (line   6)
--- 19363,19380 ----
  * debugging information options:         Debugging Options.   (line   6)
  * debugging, preprocessor:               Preprocessing Options.
                                                                (line  26)
+ * debugging, preprocessor <1>:           Preprocessing Options.
+                                                               (line  35)
+ * debugging, preprocessor <2>:           Preprocessing Options.
+                                                               (line  41)
+ * debugging, preprocessor <3>:           Preprocessing Options.
+                                                               (line  44)
+ * debugging, preprocessor <4>:           Preprocessing Options.
+                                                               (line  51)
  * DECODE:                                ENCODE and DECODE statements.
                                                                (line   6)
  * delayed execution:                     ALARM.               (line   6)
+ * delayed execution <1>:                 SLEEP.               (line   6)
  * DEXP:                                  EXP.                 (line   6)
  * DFLOAT:                                REAL.                (line   6)
  * DGAMMA:                                GAMMA.               (line   6)
*************** Keyword Index
*** 19647,19666 ****
  * DTIME:                                 DTIME.               (line   6)
  * dummy argument, unused:                Error and Warning Options.
                                                                (line 195)
- * elapsed time <1>:                      SECOND.              (line   6)
- * elapsed time <2>:                      SECNDS.              (line   6)
  * elapsed time:                          DTIME.               (line   6)
  * Elimination of functions with identical argument lists: Code Gen Options.
!                                                               (line 343)
  * ENCODE:                                ENCODE and DECODE statements.
                                                                (line   6)
  * ENUM statement:                        Fortran 2003 status. (line  93)
  * ENUMERATOR statement:                  Fortran 2003 status. (line  93)
! * environment variable <1>:              GET_ENVIRONMENT_VARIABLE.
                                                                (line   6)
  * environment variable <2>:              GETENV.              (line   6)
! * environment variable <3>:              Runtime.             (line   6)
! * environment variable:                  Environment Variables.
                                                                (line   6)
  * EOF:                                   Read/Write after EOF marker.
                                                                (line   6)
--- 19411,19430 ----
  * DTIME:                                 DTIME.               (line   6)
  * dummy argument, unused:                Error and Warning Options.
                                                                (line 195)
  * elapsed time:                          DTIME.               (line   6)
+ * elapsed time <1>:                      SECNDS.              (line   6)
+ * elapsed time <2>:                      SECOND.              (line   6)
  * Elimination of functions with identical argument lists: Code Gen Options.
!                                                               (line 339)
  * ENCODE:                                ENCODE and DECODE statements.
                                                                (line   6)
  * ENUM statement:                        Fortran 2003 status. (line  93)
  * ENUMERATOR statement:                  Fortran 2003 status. (line  93)
! * environment variable:                  Environment Variables.
                                                                (line   6)
+ * environment variable <1>:              Runtime.             (line   6)
  * environment variable <2>:              GETENV.              (line   6)
! * environment variable <3>:              GET_ENVIRONMENT_VARIABLE.
                                                                (line   6)
  * EOF:                                   Read/Write after EOF marker.
                                                                (line   6)
*************** Keyword Index
*** 19686,19695 ****
  * EXP:                                   EXP.                 (line   6)
  * EXPONENT:                              EXPONENT.            (line   6)
  * exponential function:                  EXP.                 (line   6)
- * exponential function, inverse <1>:     LOG10.               (line   6)
  * exponential function, inverse:         LOG.                 (line   6)
! * expression size <1>:                   SIZEOF.              (line   6)
  * expression size:                       C_SIZEOF.            (line   6)
  * EXTENDS_TYPE_OF:                       EXTENDS_TYPE_OF.     (line   6)
  * extensions:                            Extensions.          (line   6)
  * extensions, implemented:               Extensions implemented in GNU Fortran.
--- 19450,19459 ----
  * EXP:                                   EXP.                 (line   6)
  * EXPONENT:                              EXPONENT.            (line   6)
  * exponential function:                  EXP.                 (line   6)
  * exponential function, inverse:         LOG.                 (line   6)
! * exponential function, inverse <1>:     LOG10.               (line   6)
  * expression size:                       C_SIZEOF.            (line   6)
+ * expression size <1>:                   SIZEOF.              (line   6)
  * EXTENDS_TYPE_OF:                       EXTENDS_TYPE_OF.     (line   6)
  * extensions:                            Extensions.          (line   6)
  * extensions, implemented:               Extensions implemented in GNU Fortran.
*************** Keyword Index
*** 19699,19704 ****
--- 19463,19469 ----
  * extra warnings:                        Error and Warning Options.
                                                                (line 123)
  * f2c calling convention:                Code Gen Options.    (line  25)
+ * f2c calling convention <1>:            Code Gen Options.    (line 110)
  * Factorial function:                    GAMMA.               (line   6)
  * FDATE:                                 FDATE.               (line   6)
  * FDL, GNU Free Documentation License:   GNU Free Documentation License.
*************** Keyword Index
*** 19707,19731 ****
  * FGETC:                                 FGETC.               (line   6)
  * file format, fixed:                    Fortran Dialect Options.
                                                                (line  11)
  * file format, free:                     Fortran Dialect Options.
                                                                (line  11)
  * file operation, file number:           FNUM.                (line   6)
  * file operation, flush:                 FLUSH.               (line   6)
- * file operation, position <1>:          FTELL.               (line   6)
  * file operation, position:              FSEEK.               (line   6)
! * file operation, read character <1>:    FGETC.               (line   6)
  * file operation, read character:        FGET.                (line   6)
  * file operation, seek:                  FSEEK.               (line   6)
- * file operation, write character <1>:   FPUTC.               (line   6)
  * file operation, write character:       FPUT.                (line   6)
  * file system, access mode:              ACCESS.              (line   6)
  * file system, change access mode:       CHMOD.               (line   6)
- * file system, create link <1>:          SYMLNK.              (line   6)
  * file system, create link:              LINK.                (line   6)
  * file system, file creation mask:       UMASK.               (line   6)
- * file system, file status <1>:          STAT.                (line   6)
- * file system, file status <2>:          LSTAT.               (line   6)
  * file system, file status:              FSTAT.               (line   6)
  * file system, hard link:                LINK.                (line   6)
  * file system, remove file:              UNLINK.              (line   6)
  * file system, rename file:              RENAME.              (line   6)
--- 19472,19500 ----
  * FGETC:                                 FGETC.               (line   6)
  * file format, fixed:                    Fortran Dialect Options.
                                                                (line  11)
+ * file format, fixed <1>:                Fortran Dialect Options.
+                                                               (line  57)
  * file format, free:                     Fortran Dialect Options.
                                                                (line  11)
+ * file format, free <1>:                 Fortran Dialect Options.
+                                                               (line  70)
  * file operation, file number:           FNUM.                (line   6)
  * file operation, flush:                 FLUSH.               (line   6)
  * file operation, position:              FSEEK.               (line   6)
! * file operation, position <1>:          FTELL.               (line   6)
  * file operation, read character:        FGET.                (line   6)
+ * file operation, read character <1>:    FGETC.               (line   6)
  * file operation, seek:                  FSEEK.               (line   6)
  * file operation, write character:       FPUT.                (line   6)
+ * file operation, write character <1>:   FPUTC.               (line   6)
  * file system, access mode:              ACCESS.              (line   6)
  * file system, change access mode:       CHMOD.               (line   6)
  * file system, create link:              LINK.                (line   6)
+ * file system, create link <1>:          SYMLNK.              (line   6)
  * file system, file creation mask:       UMASK.               (line   6)
  * file system, file status:              FSTAT.               (line   6)
+ * file system, file status <1>:          LSTAT.               (line   6)
+ * file system, file status <2>:          STAT.                (line   6)
  * file system, hard link:                LINK.                (line   6)
  * file system, remove file:              UNLINK.              (line   6)
  * file system, rename file:              RENAME.              (line   6)
*************** Keyword Index
*** 19735,19747 ****
  * floating point, exponent:              EXPONENT.            (line   6)
  * floating point, fraction:              FRACTION.            (line   6)
  * floating point, nearest different:     NEAREST.             (line   6)
- * floating point, relative spacing <1>:  SPACING.             (line   6)
  * floating point, relative spacing:      RRSPACING.           (line   6)
  * floating point, scale:                 SCALE.               (line   6)
  * floating point, set exponent:          SET_EXPONENT.        (line   6)
- * floor:                                 FLOOR.               (line   6)
  * FLOOR:                                 FLOOR.               (line   6)
  * floor:                                 AINT.                (line   6)
  * FLUSH:                                 FLUSH.               (line   6)
  * FLUSH statement:                       Fortran 2003 status. (line  89)
  * FNUM:                                  FNUM.                (line   6)
--- 19504,19516 ----
  * floating point, exponent:              EXPONENT.            (line   6)
  * floating point, fraction:              FRACTION.            (line   6)
  * floating point, nearest different:     NEAREST.             (line   6)
  * floating point, relative spacing:      RRSPACING.           (line   6)
+ * floating point, relative spacing <1>:  SPACING.             (line   6)
  * floating point, scale:                 SCALE.               (line   6)
  * floating point, set exponent:          SET_EXPONENT.        (line   6)
  * FLOOR:                                 FLOOR.               (line   6)
  * floor:                                 AINT.                (line   6)
+ * floor <1>:                             FLOOR.               (line   6)
  * FLUSH:                                 FLUSH.               (line   6)
  * FLUSH statement:                       Fortran 2003 status. (line  89)
  * FNUM:                                  FNUM.                (line   6)
*************** Keyword Index
*** 19754,19760 ****
  * FPUTC:                                 FPUTC.               (line   6)
  * FRACTION:                              FRACTION.            (line   6)
  * FREE:                                  FREE.                (line   6)
! * Front-end optimization:                Code Gen Options.    (line 351)
  * FSEEK:                                 FSEEK.               (line   6)
  * FSTAT:                                 FSTAT.               (line   6)
  * FTELL:                                 FTELL.               (line   6)
--- 19523,19529 ----
  * FPUTC:                                 FPUTC.               (line   6)
  * FRACTION:                              FRACTION.            (line   6)
  * FREE:                                  FREE.                (line   6)
! * Front-end optimization:                Code Gen Options.    (line 347)
  * FSEEK:                                 FSEEK.               (line   6)
  * FSTAT:                                 FSTAT.               (line   6)
  * FTELL:                                 FTELL.               (line   6)
*************** Keyword Index
*** 19762,19777 ****
                                                                (line 212)
  * g77:                                   GNU Fortran and G77. (line   6)
  * g77 calling convention:                Code Gen Options.    (line  25)
  * GAMMA:                                 GAMMA.               (line   6)
  * Gamma function:                        GAMMA.               (line   6)
  * Gamma function, logarithm of:          LOG_GAMMA.           (line   6)
  * GCC:                                   GNU Fortran and GCC. (line   6)
  * GERROR:                                GERROR.              (line   6)
- * GET_COMMAND:                           GET_COMMAND.         (line   6)
- * GET_COMMAND_ARGUMENT:                  GET_COMMAND_ARGUMENT.
-                                                               (line   6)
- * GET_ENVIRONMENT_VARIABLE:              GET_ENVIRONMENT_VARIABLE.
-                                                               (line   6)
  * GETARG:                                GETARG.              (line   6)
  * GETCWD:                                GETCWD.              (line   6)
  * GETENV:                                GETENV.              (line   6)
--- 19531,19542 ----
                                                                (line 212)
  * g77:                                   GNU Fortran and G77. (line   6)
  * g77 calling convention:                Code Gen Options.    (line  25)
+ * g77 calling convention <1>:            Code Gen Options.    (line 110)
  * GAMMA:                                 GAMMA.               (line   6)
  * Gamma function:                        GAMMA.               (line   6)
  * Gamma function, logarithm of:          LOG_GAMMA.           (line   6)
  * GCC:                                   GNU Fortran and GCC. (line   6)
  * GERROR:                                GERROR.              (line   6)
  * GETARG:                                GETARG.              (line   6)
  * GETCWD:                                GETCWD.              (line   6)
  * GETENV:                                GETENV.              (line   6)
*************** Keyword Index
*** 19779,19784 ****
--- 19544,19554 ----
  * GETLOG:                                GETLOG.              (line   6)
  * GETPID:                                GETPID.              (line   6)
  * GETUID:                                GETUID.              (line   6)
+ * GET_COMMAND:                           GET_COMMAND.         (line   6)
+ * GET_COMMAND_ARGUMENT:                  GET_COMMAND_ARGUMENT.
+                                                               (line   6)
+ * GET_ENVIRONMENT_VARIABLE:              GET_ENVIRONMENT_VARIABLE.
+                                                               (line   6)
  * GMTIME:                                GMTIME.              (line   6)
  * GNU Compiler Collection:               GNU Fortran and GCC. (line   6)
  * GNU Fortran command options:           Invoking GNU Fortran.
*************** Keyword Index
*** 19817,19828 ****
  * IERRNO:                                IERRNO.              (line   6)
  * IFIX:                                  INT.                 (line   6)
  * IMAG:                                  AIMAG.               (line   6)
- * IMAGE_INDEX:                           IMAGE_INDEX.         (line   6)
  * images, cosubscript to image index conversion: IMAGE_INDEX. (line   6)
  * images, index of this image:           THIS_IMAGE.          (line   6)
  * images, number of:                     NUM_IMAGES.          (line   6)
  * IMAGPART:                              AIMAG.               (line   6)
! * IMPORT statement:                      Fortran 2003 status. (line 122)
  * INCLUDE directive:                     Directory Options.   (line   6)
  * inclusion, directory search paths for: Directory Options.   (line  14)
  * INDEX:                                 INDEX intrinsic.     (line   6)
--- 19587,19598 ----
  * IERRNO:                                IERRNO.              (line   6)
  * IFIX:                                  INT.                 (line   6)
  * IMAG:                                  AIMAG.               (line   6)
  * images, cosubscript to image index conversion: IMAGE_INDEX. (line   6)
  * images, index of this image:           THIS_IMAGE.          (line   6)
  * images, number of:                     NUM_IMAGES.          (line   6)
+ * IMAGE_INDEX:                           IMAGE_INDEX.         (line   6)
  * IMAGPART:                              AIMAG.               (line   6)
! * IMPORT statement:                      Fortran 2003 status. (line 120)
  * INCLUDE directive:                     Directory Options.   (line   6)
  * inclusion, directory search paths for: Directory Options.   (line  14)
  * INDEX:                                 INDEX intrinsic.     (line   6)
*************** Keyword Index
*** 19834,19839 ****
--- 19604,19611 ----
                                                                (line   6)
  * intrinsic:                             Error and Warning Options.
                                                                (line 184)
+ * intrinsic <1>:                         Error and Warning Options.
+                                                               (line 191)
  * intrinsic Modules:                     Intrinsic Modules.   (line   6)
  * intrinsic procedures:                  Intrinsic Procedures.
                                                                (line   6)
*************** Keyword Index
*** 19847,19866 ****
  * IOSTAT, end of record:                 IS_IOSTAT_EOR.       (line   6)
  * IPARITY:                               IPARITY.             (line   6)
  * IRAND:                                 IRAND.               (line   6)
- * IS_IOSTAT_END:                         IS_IOSTAT_END.       (line   6)
- * IS_IOSTAT_EOR:                         IS_IOSTAT_EOR.       (line   6)
  * ISATTY:                                ISATTY.              (line   6)
  * ISHFT:                                 ISHFT.               (line   6)
  * ISHFTC:                                ISHFTC.              (line   6)
  * ISIGN:                                 SIGN.                (line   6)
  * ISNAN:                                 ISNAN.               (line   6)
! * ISO_FORTRAN_ENV statement:             Fortran 2003 status. (line 130)
  * ITIME:                                 ITIME.               (line   6)
  * KILL:                                  KILL.                (line   6)
- * kind:                                  KIND.                (line   6)
- * KIND:                                  KIND.                (line   6)
  * kind:                                  KIND Type Parameters.
                                                                (line   6)
  * kind, character:                       SELECTED_CHAR_KIND.  (line   6)
  * kind, integer:                         SELECTED_INT_KIND.   (line   6)
  * kind, old-style:                       Old-style kind specifications.
--- 19619,19638 ----
  * IOSTAT, end of record:                 IS_IOSTAT_EOR.       (line   6)
  * IPARITY:                               IPARITY.             (line   6)
  * IRAND:                                 IRAND.               (line   6)
  * ISATTY:                                ISATTY.              (line   6)
  * ISHFT:                                 ISHFT.               (line   6)
  * ISHFTC:                                ISHFTC.              (line   6)
  * ISIGN:                                 SIGN.                (line   6)
  * ISNAN:                                 ISNAN.               (line   6)
! * ISO_FORTRAN_ENV statement:             Fortran 2003 status. (line 128)
! * IS_IOSTAT_END:                         IS_IOSTAT_END.       (line   6)
! * IS_IOSTAT_EOR:                         IS_IOSTAT_EOR.       (line   6)
  * ITIME:                                 ITIME.               (line   6)
  * KILL:                                  KILL.                (line   6)
  * kind:                                  KIND Type Parameters.
                                                                (line   6)
+ * KIND:                                  KIND.                (line   6)
+ * kind <1>:                              KIND.                (line   6)
  * kind, character:                       SELECTED_CHAR_KIND.  (line   6)
  * kind, integer:                         SELECTED_INT_KIND.   (line   6)
  * kind, old-style:                       Old-style kind specifications.
*************** Keyword Index
*** 19875,19888 ****
  * left shift, combined:                  DSHIFTL.             (line   6)
  * LEN:                                   LEN.                 (line   6)
  * LEN_TRIM:                              LEN_TRIM.            (line   6)
- * lexical comparison of strings <1>:     LLT.                 (line   6)
- * lexical comparison of strings <2>:     LLE.                 (line   6)
- * lexical comparison of strings <3>:     LGT.                 (line   6)
  * lexical comparison of strings:         LGE.                 (line   6)
  * LGAMMA:                                LOG_GAMMA.           (line   6)
  * LGE:                                   LGE.                 (line   6)
  * LGT:                                   LGT.                 (line   6)
  * libf2c calling convention:             Code Gen Options.    (line  25)
  * libgfortran initialization, set_args:  _gfortran_set_args.  (line   6)
  * libgfortran initialization, set_convert: _gfortran_set_convert.
                                                                (line   6)
--- 19647,19661 ----
  * left shift, combined:                  DSHIFTL.             (line   6)
  * LEN:                                   LEN.                 (line   6)
  * LEN_TRIM:                              LEN_TRIM.            (line   6)
  * lexical comparison of strings:         LGE.                 (line   6)
+ * lexical comparison of strings <1>:     LGT.                 (line   6)
+ * lexical comparison of strings <2>:     LLE.                 (line   6)
+ * lexical comparison of strings <3>:     LLT.                 (line   6)
  * LGAMMA:                                LOG_GAMMA.           (line   6)
  * LGE:                                   LGE.                 (line   6)
  * LGT:                                   LGT.                 (line   6)
  * libf2c calling convention:             Code Gen Options.    (line  25)
+ * libf2c calling convention <1>:         Code Gen Options.    (line 110)
  * libgfortran initialization, set_args:  _gfortran_set_args.  (line   6)
  * libgfortran initialization, set_convert: _gfortran_set_convert.
                                                                (line   6)
*************** Keyword Index
*** 19904,19924 ****
  * location of a variable in memory:      LOC.                 (line   6)
  * LOG:                                   LOG.                 (line   6)
  * LOG10:                                 LOG10.               (line   6)
- * LOG_GAMMA:                             LOG_GAMMA.           (line   6)
  * logarithm function:                    LOG.                 (line   6)
  * logarithm function with base 10:       LOG10.               (line   6)
  * logarithm function, inverse:           EXP.                 (line   6)
  * LOGICAL:                               LOGICAL.             (line   6)
- * logical and, bitwise <1>:              IAND.                (line   6)
  * logical and, bitwise:                  AND.                 (line   6)
! * logical exclusive or, bitwise <1>:     XOR.                 (line   6)
  * logical exclusive or, bitwise:         IEOR.                (line   6)
  * logical not, bitwise:                  NOT.                 (line   6)
- * logical or, bitwise <1>:               OR.                  (line   6)
  * logical or, bitwise:                   IOR.                 (line   6)
  * logical, variable representation:      Internal representation of LOGICAL variables.
                                                                (line   6)
  * login name:                            GETLOG.              (line   6)
  * LONG:                                  LONG.                (line   6)
  * LSHIFT:                                LSHIFT.              (line   6)
  * LSTAT:                                 LSTAT.               (line   6)
--- 19677,19697 ----
  * location of a variable in memory:      LOC.                 (line   6)
  * LOG:                                   LOG.                 (line   6)
  * LOG10:                                 LOG10.               (line   6)
  * logarithm function:                    LOG.                 (line   6)
  * logarithm function with base 10:       LOG10.               (line   6)
  * logarithm function, inverse:           EXP.                 (line   6)
  * LOGICAL:                               LOGICAL.             (line   6)
  * logical and, bitwise:                  AND.                 (line   6)
! * logical and, bitwise <1>:              IAND.                (line   6)
  * logical exclusive or, bitwise:         IEOR.                (line   6)
+ * logical exclusive or, bitwise <1>:     XOR.                 (line   6)
  * logical not, bitwise:                  NOT.                 (line   6)
  * logical or, bitwise:                   IOR.                 (line   6)
+ * logical or, bitwise <1>:               OR.                  (line   6)
  * logical, variable representation:      Internal representation of LOGICAL variables.
                                                                (line   6)
  * login name:                            GETLOG.              (line   6)
+ * LOG_GAMMA:                             LOG_GAMMA.           (line   6)
  * LONG:                                  LONG.                (line   6)
  * LSHIFT:                                LSHIFT.              (line   6)
  * LSTAT:                                 LSTAT.               (line   6)
*************** Keyword Index
*** 19935,19947 ****
  * MAX0:                                  MAX.                 (line   6)
  * MAX1:                                  MAX.                 (line   6)
  * MAXEXPONENT:                           MAXEXPONENT.         (line   6)
- * maximum value <1>:                     MAXVAL.              (line   6)
  * maximum value:                         MAX.                 (line   6)
  * MAXLOC:                                MAXLOC.              (line   6)
  * MAXVAL:                                MAXVAL.              (line   6)
  * MCLOCK:                                MCLOCK.              (line   6)
  * MCLOCK8:                               MCLOCK8.             (line   6)
! * memory checking:                       Code Gen Options.    (line 143)
  * MERGE:                                 MERGE.               (line   6)
  * MERGE_BITS:                            MERGE_BITS.          (line   6)
  * messages, error:                       Error and Warning Options.
--- 19708,19720 ----
  * MAX0:                                  MAX.                 (line   6)
  * MAX1:                                  MAX.                 (line   6)
  * MAXEXPONENT:                           MAXEXPONENT.         (line   6)
  * maximum value:                         MAX.                 (line   6)
+ * maximum value <1>:                     MAXVAL.              (line   6)
  * MAXLOC:                                MAXLOC.              (line   6)
  * MAXVAL:                                MAXVAL.              (line   6)
  * MCLOCK:                                MCLOCK.              (line   6)
  * MCLOCK8:                               MCLOCK8.             (line   6)
! * memory checking:                       Code Gen Options.    (line 141)
  * MERGE:                                 MERGE.               (line   6)
  * MERGE_BITS:                            MERGE_BITS.          (line   6)
  * messages, error:                       Error and Warning Options.
*************** Keyword Index
*** 19952,19959 ****
  * MIN0:                                  MIN.                 (line   6)
  * MIN1:                                  MIN.                 (line   6)
  * MINEXPONENT:                           MINEXPONENT.         (line   6)
- * minimum value <1>:                     MINVAL.              (line   6)
  * minimum value:                         MIN.                 (line   6)
  * MINLOC:                                MINLOC.              (line   6)
  * MINVAL:                                MINVAL.              (line   6)
  * Mixed-language programming:            Mixed-Language Programming.
--- 19725,19732 ----
  * MIN0:                                  MIN.                 (line   6)
  * MIN1:                                  MIN.                 (line   6)
  * MINEXPONENT:                           MINEXPONENT.         (line   6)
  * minimum value:                         MIN.                 (line   6)
+ * minimum value <1>:                     MINVAL.              (line   6)
  * MINLOC:                                MINLOC.              (line   6)
  * MINVAL:                                MINVAL.              (line   6)
  * Mixed-language programming:            Mixed-Language Programming.
*************** Keyword Index
*** 19972,19979 ****
  * module entities:                       Fortran Dialect Options.
                                                                (line  52)
  * module search path:                    Directory Options.   (line  14)
! * modulo:                                MODULO.              (line   6)
  * MODULO:                                MODULO.              (line   6)
  * MOVE_ALLOC:                            MOVE_ALLOC.          (line   6)
  * moving allocation:                     MOVE_ALLOC.          (line   6)
  * multiply array elements:               PRODUCT.             (line   6)
--- 19745,19754 ----
  * module entities:                       Fortran Dialect Options.
                                                                (line  52)
  * module search path:                    Directory Options.   (line  14)
! * module search path <1>:                Directory Options.   (line  29)
! * module search path <2>:                Directory Options.   (line  36)
  * MODULO:                                MODULO.              (line   6)
+ * modulo:                                MODULO.              (line   6)
  * MOVE_ALLOC:                            MOVE_ALLOC.          (line   6)
  * moving allocation:                     MOVE_ALLOC.          (line   6)
  * multiply array elements:               PRODUCT.             (line   6)
*************** Keyword Index
*** 19982,19989 ****
                                                                (line   6)
  * natural logarithm function:            LOG.                 (line   6)
  * NEAREST:                               NEAREST.             (line   6)
- * NEW_LINE:                              NEW_LINE.            (line   6)
  * newline:                               NEW_LINE.            (line   6)
  * NINT:                                  NINT.                (line   6)
  * norm, Euclidean:                       NORM2.               (line   6)
  * NORM2:                                 NORM2.               (line   6)
--- 19757,19764 ----
                                                                (line   6)
  * natural logarithm function:            LOG.                 (line   6)
  * NEAREST:                               NEAREST.             (line   6)
  * newline:                               NEW_LINE.            (line   6)
+ * NEW_LINE:                              NEW_LINE.            (line   6)
  * NINT:                                  NINT.                (line   6)
  * norm, Euclidean:                       NORM2.               (line   6)
  * NORM2:                                 NORM2.               (line   6)
*************** Keyword Index
*** 19992,20003 ****
  * NUM_IMAGES:                            NUM_IMAGES.          (line   6)
  * open, action:                          Files opened without an explicit ACTION= specifier.
                                                                (line   6)
- * OpenACC <1>:                           OpenACC.             (line   6)
  * OpenACC:                               Fortran Dialect Options.
                                                                (line  90)
! * OpenMP <1>:                            OpenMP.              (line   6)
  * OpenMP:                                Fortran Dialect Options.
!                                                               (line 102)
  * operators, unary:                      Unary operators.     (line   6)
  * options inquiry function:              COMPILER_OPTIONS.    (line   6)
  * options, code generation:              Code Gen Options.    (line   6)
--- 19767,19778 ----
  * NUM_IMAGES:                            NUM_IMAGES.          (line   6)
  * open, action:                          Files opened without an explicit ACTION= specifier.
                                                                (line   6)
  * OpenACC:                               Fortran Dialect Options.
                                                                (line  90)
! * OpenACC <1>:                           OpenACC.             (line   6)
  * OpenMP:                                Fortran Dialect Options.
!                                                               (line 101)
! * OpenMP <1>:                            OpenMP.              (line   6)
  * operators, unary:                      Unary operators.     (line   6)
  * options inquiry function:              COMPILER_OPTIONS.    (line   6)
  * options, code generation:              Code Gen Options.    (line   6)
*************** Keyword Index
*** 20017,20023 ****
  * options, preprocessor:                 Preprocessing Options.
                                                                (line   6)
  * options, real kind type promotion:     Fortran Dialect Options.
!                                                               (line 161)
  * options, run-time:                     Code Gen Options.    (line   6)
  * options, runtime:                      Runtime Options.     (line   6)
  * options, warnings:                     Error and Warning Options.
--- 19792,19798 ----
  * options, preprocessor:                 Preprocessing Options.
                                                                (line   6)
  * options, real kind type promotion:     Fortran Dialect Options.
!                                                               (line 159)
  * options, run-time:                     Code Gen Options.    (line   6)
  * options, runtime:                      Runtime Options.     (line   6)
  * options, warnings:                     Error and Warning Options.
*************** Keyword Index
*** 20025,20046 ****
  * OR:                                    OR.                  (line   6)
  * output, newline:                       NEW_LINE.            (line   6)
  * PACK:                                  PACK.                (line   6)
- * parity:                                POPPAR.              (line   6)
- * Parity:                                PARITY.              (line   6)
  * PARITY:                                PARITY.              (line   6)
  * paths, search:                         Directory Options.   (line  14)
  * PERROR:                                PERROR.              (line   6)
! * pointer checking:                      Code Gen Options.    (line 143)
  * pointer, C address of pointers:        C_F_PROCPOINTER.     (line   6)
  * pointer, C address of procedures:      C_FUNLOC.            (line   6)
  * pointer, C association status:         C_ASSOCIATED.        (line   6)
  * pointer, convert C to Fortran:         C_F_POINTER.         (line   6)
- * pointer, cray <1>:                     MALLOC.              (line   6)
- * pointer, cray:                         FREE.                (line   6)
  * pointer, Cray:                         Cray pointers.       (line   6)
  * pointer, disassociated:                NULL.                (line   6)
- * pointer, status <1>:                   NULL.                (line   6)
  * pointer, status:                       ASSOCIATED.          (line   6)
  * POPCNT:                                POPCNT.              (line   6)
  * POPPAR:                                POPPAR.              (line   6)
  * positive difference:                   DIM.                 (line   6)
--- 19800,19823 ----
  * OR:                                    OR.                  (line   6)
  * output, newline:                       NEW_LINE.            (line   6)
  * PACK:                                  PACK.                (line   6)
  * PARITY:                                PARITY.              (line   6)
+ * Parity:                                PARITY.              (line   6)
+ * parity:                                POPPAR.              (line   6)
  * paths, search:                         Directory Options.   (line  14)
+ * paths, search <1>:                     Directory Options.   (line  29)
+ * paths, search <2>:                     Directory Options.   (line  36)
  * PERROR:                                PERROR.              (line   6)
! * pointer checking:                      Code Gen Options.    (line 141)
  * pointer, C address of pointers:        C_F_PROCPOINTER.     (line   6)
  * pointer, C address of procedures:      C_FUNLOC.            (line   6)
  * pointer, C association status:         C_ASSOCIATED.        (line   6)
  * pointer, convert C to Fortran:         C_F_POINTER.         (line   6)
  * pointer, Cray:                         Cray pointers.       (line   6)
+ * pointer, cray:                         FREE.                (line   6)
+ * pointer, cray <1>:                     MALLOC.              (line   6)
  * pointer, disassociated:                NULL.                (line   6)
  * pointer, status:                       ASSOCIATED.          (line   6)
+ * pointer, status <1>:                   NULL.                (line   6)
  * POPCNT:                                POPCNT.              (line   6)
  * POPPAR:                                POPPAR.              (line   6)
  * positive difference:                   DIM.                 (line   6)
*************** Keyword Index
*** 20048,20068 ****
  * Preprocessing:                         Preprocessing and conditional compilation.
                                                                (line   6)
  * preprocessing, assertion:              Preprocessing Options.
!                                                               (line 114)
  * preprocessing, define macros:          Preprocessing Options.
!                                                               (line 153)
  * preprocessing, include path:           Preprocessing Options.
!                                                               (line  70)
  * preprocessing, keep comments:          Preprocessing Options.
!                                                               (line 123)
  * preprocessing, no linemarkers:         Preprocessing Options.
!                                                               (line 181)
  * preprocessing, undefine macros:        Preprocessing Options.
!                                                               (line 187)
  * preprocessor:                          Preprocessing Options.
                                                                (line   6)
  * preprocessor, debugging:               Preprocessing Options.
                                                                (line  26)
  * preprocessor, disable:                 Preprocessing Options.
                                                                (line  12)
  * preprocessor, enable:                  Preprocessing Options.
--- 19825,19869 ----
  * Preprocessing:                         Preprocessing and conditional compilation.
                                                                (line   6)
  * preprocessing, assertion:              Preprocessing Options.
!                                                               (line 113)
! * preprocessing, assertion <1>:          Preprocessing Options.
!                                                               (line 119)
  * preprocessing, define macros:          Preprocessing Options.
!                                                               (line 151)
! * preprocessing, define macros <1>:      Preprocessing Options.
!                                                               (line 154)
  * preprocessing, include path:           Preprocessing Options.
!                                                               (line  69)
! * preprocessing, include path <1>:       Preprocessing Options.
!                                                               (line  76)
! * preprocessing, include path <2>:       Preprocessing Options.
!                                                               (line  80)
! * preprocessing, include path <3>:       Preprocessing Options.
!                                                               (line  85)
! * preprocessing, include path <4>:       Preprocessing Options.
!                                                               (line  89)
! * preprocessing, include path <5>:       Preprocessing Options.
!                                                               (line  96)
  * preprocessing, keep comments:          Preprocessing Options.
!                                                               (line 122)
! * preprocessing, keep comments <1>:      Preprocessing Options.
!                                                               (line 137)
  * preprocessing, no linemarkers:         Preprocessing Options.
!                                                               (line 179)
  * preprocessing, undefine macros:        Preprocessing Options.
!                                                               (line 185)
  * preprocessor:                          Preprocessing Options.
                                                                (line   6)
  * preprocessor, debugging:               Preprocessing Options.
                                                                (line  26)
+ * preprocessor, debugging <1>:           Preprocessing Options.
+                                                               (line  35)
+ * preprocessor, debugging <2>:           Preprocessing Options.
+                                                               (line  41)
+ * preprocessor, debugging <3>:           Preprocessing Options.
+                                                               (line  44)
+ * preprocessor, debugging <4>:           Preprocessing Options.
+                                                               (line  51)
  * preprocessor, disable:                 Preprocessing Options.
                                                                (line  12)
  * preprocessor, enable:                  Preprocessing Options.
*************** Keyword Index
*** 20082,20119 ****
  * product, vector:                       DOT_PRODUCT.         (line   6)
  * program termination:                   EXIT.                (line   6)
  * program termination, with core dump:   ABORT.               (line   6)
! * PROTECTED statement:                   Fortran 2003 status. (line 116)
  * Q exponent-letter:                     Q exponent-letter.   (line   6)
  * RADIX:                                 RADIX.               (line   6)
  * radix, real:                           SELECTED_REAL_KIND.  (line   6)
  * RAN:                                   RAN.                 (line   6)
  * RAND:                                  RAND.                (line   6)
- * random number generation <1>:          RANDOM_NUMBER.       (line   6)
- * random number generation <2>:          RAND.                (line   6)
- * random number generation <3>:          RAN.                 (line   6)
  * random number generation:              IRAND.               (line   6)
! * random number generation, seeding <1>: SRAND.               (line   6)
  * random number generation, seeding:     RANDOM_SEED.         (line   6)
  * RANDOM_NUMBER:                         RANDOM_NUMBER.       (line   6)
  * RANDOM_SEED:                           RANDOM_SEED.         (line   6)
  * RANGE:                                 RANGE.               (line   6)
! * range checking:                        Code Gen Options.    (line 143)
! * rank:                                  RANK.                (line   6)
  * RANK:                                  RANK.                (line   6)
  * re-association of parenthesized expressions: Code Gen Options.
!                                                               (line 328)
! * read character, stream mode <1>:       FGETC.               (line   6)
  * read character, stream mode:           FGET.                (line   6)
  * REAL:                                  REAL.                (line   6)
  * real kind:                             SELECTED_REAL_KIND.  (line   6)
  * real number, exponent:                 EXPONENT.            (line   6)
  * real number, fraction:                 FRACTION.            (line   6)
  * real number, nearest different:        NEAREST.             (line   6)
- * real number, relative spacing <1>:     SPACING.             (line   6)
  * real number, relative spacing:         RRSPACING.           (line   6)
  * real number, scale:                    SCALE.               (line   6)
  * real number, set exponent:             SET_EXPONENT.        (line   6)
! * Reallocate the LHS in assignments:     Code Gen Options.    (line 337)
  * Reallocate the LHS in assignments, notification: Error and Warning Options.
                                                                (line 216)
  * REALPART:                              REAL.                (line   6)
--- 19883,19920 ----
  * product, vector:                       DOT_PRODUCT.         (line   6)
  * program termination:                   EXIT.                (line   6)
  * program termination, with core dump:   ABORT.               (line   6)
! * PROTECTED statement:                   Fortran 2003 status. (line 114)
  * Q exponent-letter:                     Q exponent-letter.   (line   6)
  * RADIX:                                 RADIX.               (line   6)
  * radix, real:                           SELECTED_REAL_KIND.  (line   6)
  * RAN:                                   RAN.                 (line   6)
  * RAND:                                  RAND.                (line   6)
  * random number generation:              IRAND.               (line   6)
! * random number generation <1>:          RAN.                 (line   6)
! * random number generation <2>:          RAND.                (line   6)
! * random number generation <3>:          RANDOM_NUMBER.       (line   6)
  * random number generation, seeding:     RANDOM_SEED.         (line   6)
+ * random number generation, seeding <1>: SRAND.               (line   6)
  * RANDOM_NUMBER:                         RANDOM_NUMBER.       (line   6)
  * RANDOM_SEED:                           RANDOM_SEED.         (line   6)
  * RANGE:                                 RANGE.               (line   6)
! * range checking:                        Code Gen Options.    (line 141)
  * RANK:                                  RANK.                (line   6)
+ * rank:                                  RANK.                (line   6)
  * re-association of parenthesized expressions: Code Gen Options.
!                                                               (line 324)
  * read character, stream mode:           FGET.                (line   6)
+ * read character, stream mode <1>:       FGETC.               (line   6)
  * REAL:                                  REAL.                (line   6)
  * real kind:                             SELECTED_REAL_KIND.  (line   6)
  * real number, exponent:                 EXPONENT.            (line   6)
  * real number, fraction:                 FRACTION.            (line   6)
  * real number, nearest different:        NEAREST.             (line   6)
  * real number, relative spacing:         RRSPACING.           (line   6)
+ * real number, relative spacing <1>:     SPACING.             (line   6)
  * real number, scale:                    SCALE.               (line   6)
  * real number, set exponent:             SET_EXPONENT.        (line   6)
! * Reallocate the LHS in assignments:     Code Gen Options.    (line 333)
  * Reallocate the LHS in assignments, notification: Error and Warning Options.
                                                                (line 216)
  * REALPART:                              REAL.                (line   6)
*************** Keyword Index
*** 20122,20142 ****
  * Reduction, XOR:                        PARITY.              (line   6)
  * remainder:                             MOD.                 (line   6)
  * RENAME:                                RENAME.              (line   6)
! * repacking arrays:                      Code Gen Options.    (line 244)
  * REPEAT:                                REPEAT.              (line   6)
  * RESHAPE:                               RESHAPE.             (line   6)
  * REWIND:                                Read/Write after EOF marker.
                                                                (line   6)
  * right shift, combined:                 DSHIFTR.             (line   6)
  * root:                                  SQRT.                (line   6)
- * rounding, ceiling <1>:                 CEILING.             (line   6)
  * rounding, ceiling:                     ANINT.               (line   6)
! * rounding, floor <1>:                   FLOOR.               (line   6)
  * rounding, floor:                       AINT.                (line   6)
  * rounding, nearest whole number:        NINT.                (line   6)
  * RRSPACING:                             RRSPACING.           (line   6)
  * RSHIFT:                                RSHIFT.              (line   6)
! * run-time checking:                     Code Gen Options.    (line 143)
  * SAME_TYPE_AS:                          SAME_TYPE_AS.        (line   6)
  * SAVE statement:                        Code Gen Options.    (line  15)
  * SCALE:                                 SCALE.               (line   6)
--- 19923,19943 ----
  * Reduction, XOR:                        PARITY.              (line   6)
  * remainder:                             MOD.                 (line   6)
  * RENAME:                                RENAME.              (line   6)
! * repacking arrays:                      Code Gen Options.    (line 243)
  * REPEAT:                                REPEAT.              (line   6)
  * RESHAPE:                               RESHAPE.             (line   6)
  * REWIND:                                Read/Write after EOF marker.
                                                                (line   6)
  * right shift, combined:                 DSHIFTR.             (line   6)
  * root:                                  SQRT.                (line   6)
  * rounding, ceiling:                     ANINT.               (line   6)
! * rounding, ceiling <1>:                 CEILING.             (line   6)
  * rounding, floor:                       AINT.                (line   6)
+ * rounding, floor <1>:                   FLOOR.               (line   6)
  * rounding, nearest whole number:        NINT.                (line   6)
  * RRSPACING:                             RRSPACING.           (line   6)
  * RSHIFT:                                RSHIFT.              (line   6)
! * run-time checking:                     Code Gen Options.    (line 141)
  * SAME_TYPE_AS:                          SAME_TYPE_AS.        (line   6)
  * SAVE statement:                        Code Gen Options.    (line  15)
  * SCALE:                                 SCALE.               (line   6)
*************** Keyword Index
*** 20145,20161 ****
  * search paths, for included files:      Directory Options.   (line  14)
  * SECNDS:                                SECNDS.              (line   6)
  * SECOND:                                SECOND.              (line   6)
- * seeding a random number generator <1>: SRAND.               (line   6)
  * seeding a random number generator:     RANDOM_SEED.         (line   6)
  * SELECTED_CHAR_KIND:                    SELECTED_CHAR_KIND.  (line   6)
  * SELECTED_INT_KIND:                     SELECTED_INT_KIND.   (line   6)
  * SELECTED_REAL_KIND:                    SELECTED_REAL_KIND.  (line   6)
  * SET_EXPONENT:                          SET_EXPONENT.        (line   6)
  * SHAPE:                                 SHAPE.               (line   6)
- * shift, left <1>:                       SHIFTL.              (line   6)
  * shift, left:                           DSHIFTL.             (line   6)
! * shift, right <1>:                      SHIFTR.              (line   6)
  * shift, right:                          DSHIFTR.             (line   6)
  * shift, right with fill:                SHIFTA.              (line   6)
  * SHIFTA:                                SHIFTA.              (line   6)
  * SHIFTL:                                SHIFTL.              (line   6)
--- 19946,19962 ----
  * search paths, for included files:      Directory Options.   (line  14)
  * SECNDS:                                SECNDS.              (line   6)
  * SECOND:                                SECOND.              (line   6)
  * seeding a random number generator:     RANDOM_SEED.         (line   6)
+ * seeding a random number generator <1>: SRAND.               (line   6)
  * SELECTED_CHAR_KIND:                    SELECTED_CHAR_KIND.  (line   6)
  * SELECTED_INT_KIND:                     SELECTED_INT_KIND.   (line   6)
  * SELECTED_REAL_KIND:                    SELECTED_REAL_KIND.  (line   6)
  * SET_EXPONENT:                          SET_EXPONENT.        (line   6)
  * SHAPE:                                 SHAPE.               (line   6)
  * shift, left:                           DSHIFTL.             (line   6)
! * shift, left <1>:                       SHIFTL.              (line   6)
  * shift, right:                          DSHIFTR.             (line   6)
+ * shift, right <1>:                      SHIFTR.              (line   6)
  * shift, right with fill:                SHIFTA.              (line   6)
  * SHIFTA:                                SHIFTA.              (line   6)
  * SHIFTL:                                SHIFTL.              (line   6)
*************** Keyword Index
*** 20172,20179 ****
  * SINH:                                  SINH.                (line   6)
  * SIZE:                                  SIZE.                (line   6)
  * size of a variable, in bits:           BIT_SIZE.            (line   6)
- * size of an expression <1>:             SIZEOF.              (line   6)
  * size of an expression:                 C_SIZEOF.            (line   6)
  * SIZEOF:                                SIZEOF.              (line   6)
  * SLEEP:                                 SLEEP.               (line   6)
  * SNGL:                                  REAL.                (line   6)
--- 19973,19980 ----
  * SINH:                                  SINH.                (line   6)
  * SIZE:                                  SIZE.                (line   6)
  * size of a variable, in bits:           BIT_SIZE.            (line   6)
  * size of an expression:                 C_SIZEOF.            (line   6)
+ * size of an expression <1>:             SIZEOF.              (line   6)
  * SIZEOF:                                SIZEOF.              (line   6)
  * SLEEP:                                 SLEEP.               (line   6)
  * SNGL:                                  REAL.                (line   6)
*************** Keyword Index
*** 20187,20212 ****
  * statement, ENUM:                       Fortran 2003 status. (line  93)
  * statement, ENUMERATOR:                 Fortran 2003 status. (line  93)
  * statement, FLUSH:                      Fortran 2003 status. (line  89)
! * statement, IMPORT:                     Fortran 2003 status. (line 122)
! * statement, ISO_FORTRAN_ENV:            Fortran 2003 status. (line 130)
! * statement, PROTECTED:                  Fortran 2003 status. (line 116)
  * statement, SAVE:                       Code Gen Options.    (line  15)
! * statement, USE, INTRINSIC:             Fortran 2003 status. (line 130)
! * statement, VALUE:                      Fortran 2003 status. (line 118)
! * statement, VOLATILE:                   Fortran 2003 status. (line 120)
  * storage size:                          STORAGE_SIZE.        (line   6)
  * STORAGE_SIZE:                          STORAGE_SIZE.        (line   6)
! * STREAM I/O:                            Fortran 2003 status. (line 105)
! * stream mode, read character <1>:       FGETC.               (line   6)
  * stream mode, read character:           FGET.                (line   6)
! * stream mode, write character <1>:      FPUTC.               (line   6)
  * stream mode, write character:          FPUT.                (line   6)
  * string, adjust left:                   ADJUSTL.             (line   6)
  * string, adjust right:                  ADJUSTR.             (line   6)
- * string, comparison <1>:                LLT.                 (line   6)
- * string, comparison <2>:                LLE.                 (line   6)
- * string, comparison <3>:                LGT.                 (line   6)
  * string, comparison:                    LGE.                 (line   6)
  * string, concatenate:                   REPEAT.              (line   6)
  * string, find missing set:              VERIFY.              (line   6)
  * string, find non-blank character:      LNBLNK.              (line   6)
--- 19988,20013 ----
  * statement, ENUM:                       Fortran 2003 status. (line  93)
  * statement, ENUMERATOR:                 Fortran 2003 status. (line  93)
  * statement, FLUSH:                      Fortran 2003 status. (line  89)
! * statement, IMPORT:                     Fortran 2003 status. (line 120)
! * statement, ISO_FORTRAN_ENV:            Fortran 2003 status. (line 128)
! * statement, PROTECTED:                  Fortran 2003 status. (line 114)
  * statement, SAVE:                       Code Gen Options.    (line  15)
! * statement, USE, INTRINSIC:             Fortran 2003 status. (line 128)
! * statement, VALUE:                      Fortran 2003 status. (line 116)
! * statement, VOLATILE:                   Fortran 2003 status. (line 118)
  * storage size:                          STORAGE_SIZE.        (line   6)
  * STORAGE_SIZE:                          STORAGE_SIZE.        (line   6)
! * STREAM I/O:                            Fortran 2003 status. (line 103)
  * stream mode, read character:           FGET.                (line   6)
! * stream mode, read character <1>:       FGETC.               (line   6)
  * stream mode, write character:          FPUT.                (line   6)
+ * stream mode, write character <1>:      FPUTC.               (line   6)
  * string, adjust left:                   ADJUSTL.             (line   6)
  * string, adjust right:                  ADJUSTR.             (line   6)
  * string, comparison:                    LGE.                 (line   6)
+ * string, comparison <1>:                LGT.                 (line   6)
+ * string, comparison <2>:                LLE.                 (line   6)
+ * string, comparison <3>:                LLT.                 (line   6)
  * string, concatenate:                   REPEAT.              (line   6)
  * string, find missing set:              VERIFY.              (line   6)
  * string, find non-blank character:      LNBLNK.              (line   6)
*************** Keyword Index
*** 20220,20227 ****
                                                                (line   6)
  * STRUCTURE:                             STRUCTURE and RECORD.
                                                                (line   6)
! * structure packing:                     Code Gen Options.    (line 238)
! * subscript checking:                    Code Gen Options.    (line 143)
  * substring position:                    INDEX intrinsic.     (line   6)
  * SUM:                                   SUM.                 (line   6)
  * sum array elements:                    SUM.                 (line   6)
--- 20021,20028 ----
                                                                (line   6)
  * STRUCTURE:                             STRUCTURE and RECORD.
                                                                (line   6)
! * structure packing:                     Code Gen Options.    (line 237)
! * subscript checking:                    Code Gen Options.    (line 141)
  * substring position:                    INDEX intrinsic.     (line   6)
  * SUM:                                   SUM.                 (line   6)
  * sum array elements:                    SUM.                 (line   6)
*************** Keyword Index
*** 20230,20256 ****
  * symbol names:                          Fortran Dialect Options.
                                                                (line  34)
  * symbol names, transforming:            Code Gen Options.    (line  54)
  * symbol names, underscores:             Code Gen Options.    (line  54)
  * SYMLNK:                                SYMLNK.              (line   6)
  * syntax checking:                       Error and Warning Options.
                                                                (line  33)
  * SYSTEM:                                SYSTEM.              (line   6)
- * system, error handling <1>:            PERROR.              (line   6)
- * system, error handling <2>:            IERRNO.              (line   6)
  * system, error handling:                GERROR.              (line   6)
  * system, group ID:                      GETGID.              (line   6)
  * system, host name:                     HOSTNM.              (line   6)
  * system, login name:                    GETLOG.              (line   6)
  * system, process ID:                    GETPID.              (line   6)
  * system, signal handling:               SIGNAL.              (line   6)
- * system, system call <1>:               SYSTEM.              (line   6)
  * system, system call:                   EXECUTE_COMMAND_LINE.
                                                                (line   6)
! * system, terminal <1>:                  TTYNAM.              (line   6)
  * system, terminal:                      ISATTY.              (line   6)
  * system, user ID:                       GETUID.              (line   6)
- * system, working directory <1>:         GETCWD.              (line   6)
  * system, working directory:             CHDIR.               (line   6)
  * SYSTEM_CLOCK:                          SYSTEM_CLOCK.        (line   6)
  * tabulators:                            Error and Warning Options.
                                                                (line 171)
--- 20031,20059 ----
  * symbol names:                          Fortran Dialect Options.
                                                                (line  34)
  * symbol names, transforming:            Code Gen Options.    (line  54)
+ * symbol names, transforming <1>:        Code Gen Options.    (line 110)
  * symbol names, underscores:             Code Gen Options.    (line  54)
+ * symbol names, underscores <1>:         Code Gen Options.    (line 110)
  * SYMLNK:                                SYMLNK.              (line   6)
  * syntax checking:                       Error and Warning Options.
                                                                (line  33)
  * SYSTEM:                                SYSTEM.              (line   6)
  * system, error handling:                GERROR.              (line   6)
+ * system, error handling <1>:            IERRNO.              (line   6)
+ * system, error handling <2>:            PERROR.              (line   6)
  * system, group ID:                      GETGID.              (line   6)
  * system, host name:                     HOSTNM.              (line   6)
  * system, login name:                    GETLOG.              (line   6)
  * system, process ID:                    GETPID.              (line   6)
  * system, signal handling:               SIGNAL.              (line   6)
  * system, system call:                   EXECUTE_COMMAND_LINE.
                                                                (line   6)
! * system, system call <1>:               SYSTEM.              (line   6)
  * system, terminal:                      ISATTY.              (line   6)
+ * system, terminal <1>:                  TTYNAM.              (line   6)
  * system, user ID:                       GETUID.              (line   6)
  * system, working directory:             CHDIR.               (line   6)
+ * system, working directory <1>:         GETCWD.              (line   6)
  * SYSTEM_CLOCK:                          SYSTEM_CLOCK.        (line   6)
  * tabulators:                            Error and Warning Options.
                                                                (line 171)
*************** Keyword Index
*** 20258,20265 ****
  * tangent:                               TAN.                 (line   6)
  * tangent, hyperbolic:                   TANH.                (line   6)
  * tangent, hyperbolic, inverse:          ATANH.               (line   6)
- * tangent, inverse <1>:                  ATAN2.               (line   6)
  * tangent, inverse:                      ATAN.                (line   6)
  * TANH:                                  TANH.                (line   6)
  * terminate program:                     EXIT.                (line   6)
  * terminate program, with core dump:     ABORT.               (line   6)
--- 20061,20068 ----
  * tangent:                               TAN.                 (line   6)
  * tangent, hyperbolic:                   TANH.                (line   6)
  * tangent, hyperbolic, inverse:          ATANH.               (line   6)
  * tangent, inverse:                      ATAN.                (line   6)
+ * tangent, inverse <1>:                  ATAN2.               (line   6)
  * TANH:                                  TANH.                (line   6)
  * terminate program:                     EXIT.                (line   6)
  * terminate program, with core dump:     ABORT.               (line   6)
*************** Keyword Index
*** 20267,20304 ****
  * thread-safety, threads:                Thread-safety of the runtime library.
                                                                (line   6)
  * TIME:                                  TIME.                (line   6)
- * time, clock ticks <1>:                 SYSTEM_CLOCK.        (line   6)
- * time, clock ticks <2>:                 MCLOCK8.             (line   6)
  * time, clock ticks:                     MCLOCK.              (line   6)
  * time, conversion to GMT info:          GMTIME.              (line   6)
  * time, conversion to local time info:   LTIME.               (line   6)
  * time, conversion to string:            CTIME.               (line   6)
- * time, current <1>:                     TIME8.               (line   6)
- * time, current <2>:                     TIME.                (line   6)
- * time, current <3>:                     ITIME.               (line   6)
- * time, current <4>:                     FDATE.               (line   6)
  * time, current:                         DATE_AND_TIME.       (line   6)
! * time, elapsed <1>:                     SECOND.              (line   6)
! * time, elapsed <2>:                     SECNDS.              (line   6)
! * time, elapsed <3>:                     ETIME.               (line   6)
! * time, elapsed <4>:                     DTIME.               (line   6)
  * time, elapsed:                         CPU_TIME.            (line   6)
  * TIME8:                                 TIME8.               (line   6)
  * TINY:                                  TINY.                (line   6)
  * TR 15581:                              Fortran 2003 status. (line  98)
! * trace:                                 Debugging Options.   (line  62)
  * TRAILZ:                                TRAILZ.              (line   6)
  * TRANSFER:                              TRANSFER.            (line   6)
  * transforming symbol names:             Code Gen Options.    (line  54)
! * transpose:                             TRANSPOSE.           (line   6)
  * TRANSPOSE:                             TRANSPOSE.           (line   6)
  * trigonometric function, cosine:        COS.                 (line   6)
  * trigonometric function, cosine, inverse: ACOS.              (line   6)
  * trigonometric function, sine:          SIN.                 (line   6)
  * trigonometric function, sine, inverse: ASIN.                (line   6)
  * trigonometric function, tangent:       TAN.                 (line   6)
- * trigonometric function, tangent, inverse <1>: ATAN2.        (line   6)
  * trigonometric function, tangent, inverse: ATAN.             (line   6)
  * TRIM:                                  TRIM.                (line   6)
  * TTYNAM:                                TTYNAM.              (line   6)
  * type cast:                             TRANSFER.            (line   6)
--- 20070,20108 ----
  * thread-safety, threads:                Thread-safety of the runtime library.
                                                                (line   6)
  * TIME:                                  TIME.                (line   6)
  * time, clock ticks:                     MCLOCK.              (line   6)
+ * time, clock ticks <1>:                 MCLOCK8.             (line   6)
+ * time, clock ticks <2>:                 SYSTEM_CLOCK.        (line   6)
  * time, conversion to GMT info:          GMTIME.              (line   6)
  * time, conversion to local time info:   LTIME.               (line   6)
  * time, conversion to string:            CTIME.               (line   6)
  * time, current:                         DATE_AND_TIME.       (line   6)
! * time, current <1>:                     FDATE.               (line   6)
! * time, current <2>:                     ITIME.               (line   6)
! * time, current <3>:                     TIME.                (line   6)
! * time, current <4>:                     TIME8.               (line   6)
  * time, elapsed:                         CPU_TIME.            (line   6)
+ * time, elapsed <1>:                     DTIME.               (line   6)
+ * time, elapsed <2>:                     ETIME.               (line   6)
+ * time, elapsed <3>:                     SECNDS.              (line   6)
+ * time, elapsed <4>:                     SECOND.              (line   6)
  * TIME8:                                 TIME8.               (line   6)
  * TINY:                                  TINY.                (line   6)
  * TR 15581:                              Fortran 2003 status. (line  98)
! * trace:                                 Debugging Options.   (line  61)
  * TRAILZ:                                TRAILZ.              (line   6)
  * TRANSFER:                              TRANSFER.            (line   6)
  * transforming symbol names:             Code Gen Options.    (line  54)
! * transforming symbol names <1>:         Code Gen Options.    (line 110)
  * TRANSPOSE:                             TRANSPOSE.           (line   6)
+ * transpose:                             TRANSPOSE.           (line   6)
  * trigonometric function, cosine:        COS.                 (line   6)
  * trigonometric function, cosine, inverse: ACOS.              (line   6)
  * trigonometric function, sine:          SIN.                 (line   6)
  * trigonometric function, sine, inverse: ASIN.                (line   6)
  * trigonometric function, tangent:       TAN.                 (line   6)
  * trigonometric function, tangent, inverse: ATAN.             (line   6)
+ * trigonometric function, tangent, inverse <1>: ATAN2.        (line   6)
  * TRIM:                                  TRIM.                (line   6)
  * TTYNAM:                                TTYNAM.              (line   6)
  * type cast:                             TRANSFER.            (line   6)
*************** Keyword Index
*** 20308,20322 ****
  * underflow:                             Error and Warning Options.
                                                                (line 179)
  * underscore:                            Code Gen Options.    (line  54)
  * UNLINK:                                UNLINK.              (line   6)
  * UNPACK:                                UNPACK.              (line   6)
  * unused dummy argument:                 Error and Warning Options.
                                                                (line 195)
  * unused parameter:                      Error and Warning Options.
                                                                (line 199)
! * USE, INTRINSIC statement:              Fortran 2003 status. (line 130)
  * user id:                               GETUID.              (line   6)
! * VALUE statement:                       Fortran 2003 status. (line 118)
  * Varying length character strings:      Varying Length Character Strings.
                                                                (line   6)
  * Varying length strings:                Varying Length Character Strings.
--- 20112,20127 ----
  * underflow:                             Error and Warning Options.
                                                                (line 179)
  * underscore:                            Code Gen Options.    (line  54)
+ * underscore <1>:                        Code Gen Options.    (line 110)
  * UNLINK:                                UNLINK.              (line   6)
  * UNPACK:                                UNPACK.              (line   6)
  * unused dummy argument:                 Error and Warning Options.
                                                                (line 195)
  * unused parameter:                      Error and Warning Options.
                                                                (line 199)
! * USE, INTRINSIC statement:              Fortran 2003 status. (line 128)
  * user id:                               GETUID.              (line   6)
! * VALUE statement:                       Fortran 2003 status. (line 116)
  * Varying length character strings:      Varying Length Character Strings.
                                                                (line   6)
  * Varying length strings:                Varying Length Character Strings.
*************** Keyword Index
*** 20326,20332 ****
  * version of the compiler:               COMPILER_VERSION.    (line   6)
  * VOLATILE:                              Volatile COMMON blocks.
                                                                (line   6)
! * VOLATILE statement:                    Fortran 2003 status. (line 120)
  * warning, C binding type:               Error and Warning Options.
                                                                (line  99)
  * warnings, aliasing:                    Error and Warning Options.
--- 20131,20137 ----
  * version of the compiler:               COMPILER_VERSION.    (line   6)
  * VOLATILE:                              Volatile COMMON blocks.
                                                                (line   6)
! * VOLATILE statement:                    Fortran 2003 status. (line 118)
  * warning, C binding type:               Error and Warning Options.
                                                                (line  99)
  * warnings, aliasing:                    Error and Warning Options.
*************** Keyword Index
*** 20343,20348 ****
--- 20148,20155 ----
                                                                (line 106)
  * warnings, conversion:                  Error and Warning Options.
                                                                (line 115)
+ * warnings, conversion <1>:              Error and Warning Options.
+                                                               (line 119)
  * warnings, extra:                       Error and Warning Options.
                                                                (line 123)
  * warnings, function elimination:        Error and Warning Options.
*************** Keyword Index
*** 20368,20374 ****
  * warnings, tabs:                        Error and Warning Options.
                                                                (line 171)
  * warnings, to errors:                   Error and Warning Options.
!                                                               (line 246)
  * warnings, underflow:                   Error and Warning Options.
                                                                (line 179)
  * warnings, unused dummy argument:       Error and Warning Options.
--- 20175,20181 ----
  * warnings, tabs:                        Error and Warning Options.
                                                                (line 171)
  * warnings, to errors:                   Error and Warning Options.
!                                                               (line 245)
  * warnings, underflow:                   Error and Warning Options.
                                                                (line 179)
  * warnings, unused dummy argument:       Error and Warning Options.
*************** Keyword Index
*** 20377,20390 ****
                                                                (line 199)
  * warnings, use statements:              Error and Warning Options.
                                                                (line 191)
- * write character, stream mode <1>:      FPUTC.               (line   6)
  * write character, stream mode:          FPUT.                (line   6)
  * XOR:                                   XOR.                 (line   6)
  * XOR reduction:                         PARITY.              (line   6)
  * ZABS:                                  ABS.                 (line   6)
  * ZCOS:                                  COS.                 (line   6)
- * zero bits <1>:                         TRAILZ.              (line   6)
  * zero bits:                             LEADZ.               (line   6)
  * ZEXP:                                  EXP.                 (line   6)
  * ZLOG:                                  LOG.                 (line   6)
  * ZSIN:                                  SIN.                 (line   6)
--- 20184,20197 ----
                                                                (line 199)
  * warnings, use statements:              Error and Warning Options.
                                                                (line 191)
  * write character, stream mode:          FPUT.                (line   6)
+ * write character, stream mode <1>:      FPUTC.               (line   6)
  * XOR:                                   XOR.                 (line   6)
  * XOR reduction:                         PARITY.              (line   6)
  * ZABS:                                  ABS.                 (line   6)
  * ZCOS:                                  COS.                 (line   6)
  * zero bits:                             LEADZ.               (line   6)
+ * zero bits <1>:                         TRAILZ.              (line   6)
  * ZEXP:                                  EXP.                 (line   6)
  * ZLOG:                                  LOG.                 (line   6)
  * ZSIN:                                  SIN.                 (line   6)
*************** Keyword Index
*** 20393,20806 ****
  
  
  Tag Table:
! Node: Top2004
! Node: Introduction3415
! Node: About GNU Fortran4164
! Node: GNU Fortran and GCC8153
! Node: Preprocessing and conditional compilation10267
! Node: GNU Fortran and G7711911
! Node: Project Status12484
! Node: Standards15187
! Node: Varying Length Character Strings16480
! Node: Invoking GNU Fortran17231
! Node: Option Summary18954
! Node: Fortran Dialect Options22387
! Node: Preprocessing Options31660
! Node: Error and Warning Options39891
! Node: Debugging Options50437
! Node: Directory Options53909
! Node: Link Options55344
! Node: Runtime Options55968
! Node: Code Gen Options57873
! Node: Environment Variables74028
! Node: Runtime74633
! Node: TMPDIR75735
! Node: GFORTRAN_STDIN_UNIT76404
! Node: GFORTRAN_STDOUT_UNIT76786
! Node: GFORTRAN_STDERR_UNIT77187
! Node: GFORTRAN_UNBUFFERED_ALL77589
! Node: GFORTRAN_UNBUFFERED_PRECONNECTED78120
! Node: GFORTRAN_SHOW_LOCUS78764
! Node: GFORTRAN_OPTIONAL_PLUS79260
! Node: GFORTRAN_DEFAULT_RECL79736
! Node: GFORTRAN_LIST_SEPARATOR80225
! Node: GFORTRAN_CONVERT_UNIT80834
! Node: GFORTRAN_ERROR_BACKTRACE83697
! Node: Fortran 2003 and 2008 status84254
! Node: Fortran 2003 status84514
! Node: Fortran 2008 status89755
! Node: TS 29113 status94605
! Node: Compiler Characteristics95582
! Node: KIND Type Parameters96173
! Node: Internal representation of LOGICAL variables97602
! Node: Thread-safety of the runtime library98462
! Node: Data consistency and durability100866
! Node: Files opened without an explicit ACTION= specifier103967
! Node: Extensions104619
! Node: Extensions implemented in GNU Fortran105224
! Node: Old-style kind specifications106626
! Node: Old-style variable initialization107733
! Node: Extensions to namelist109045
! Node: X format descriptor without count field111347
! Node: Commas in FORMAT specifications111874
! Node: Missing period in FORMAT specifications112391
! Node: I/O item lists112953
! Node: `Q' exponent-letter113340
! Node: BOZ literal constants113940
! Node: Real array indices116519
! Node: Unary operators116818
! Node: Implicitly convert LOGICAL and INTEGER values117232
! Node: Hollerith constants support118192
! Node: Cray pointers119964
! Node: CONVERT specifier125411
! Node: OpenMP127409
! Node: OpenACC129667
! Node: Argument list functions130977
! Node: Read/Write after EOF marker132621
! Node: Extensions not implemented in GNU Fortran133194
! Node: STRUCTURE and RECORD134143
! Node: ENCODE and DECODE statements136579
! Node: Variable FORMAT expressions137939
! Node: Alternate complex function syntax139044
! Node: Volatile COMMON blocks139595
! Node: Mixed-Language Programming140071
! Node: Interoperability with C140654
! Node: Intrinsic Types141992
! Node: Derived Types and struct142988
! Node: Interoperable Global Variables144345
! Node: Interoperable Subroutines and Functions145621
! Node: Working with Pointers149417
! Node: Further Interoperability of Fortran with C153893
! Node: GNU Fortran Compiler Directives157242
! Node: Non-Fortran Main Program160496
! Node: _gfortran_set_args162686
! Node: _gfortran_set_options163621
! Node: _gfortran_set_convert166988
! Node: _gfortran_set_record_marker167852
! Node: _gfortran_set_fpe168660
! Node: _gfortran_set_max_subrecord_length169852
! Node: Naming and argument-passing conventions170772
! Node: Naming conventions171491
! Node: Argument passing conventions172961
! Node: Coarray Programming177457
! Node: Type and enum ABI Documentation177704
! Node: caf_token_t177946
! Node: caf_register_t178181
! Node: Function ABI Documentation178635
! Node: _gfortran_caf_init180378
! Node: _gfortran_caf_finish181815
! Node: _gfortran_caf_this_image182754
! Node: _gfortran_caf_num_images183505
! Node: _gfortran_caf_register184606
! Node: _gfortran_caf_deregister187790
! Node: _gfortran_caf_send188855
! Node: _gfortran_caf_get191649
! Node: _gfortran_caf_sendget194318
! Node: _gfortran_caf_lock197734
! Node: _gfortran_caf_unlock199453
! Node: _gfortran_caf_event_post200886
! Node: _gfortran_caf_event_wait202285
! Node: _gfortran_caf_event_query204332
! Node: _gfortran_caf_sync_all205624
! Node: _gfortran_caf_sync_images206538
! Node: _gfortran_caf_sync_memory208035
! Node: _gfortran_caf_error_stop209007
! Node: _gfortran_caf_error_stop_str209603
! Node: _gfortran_caf_atomic_define210271
! Node: _gfortran_caf_atomic_ref211531
! Node: _gfortran_caf_atomic_cas212811
! Node: _gfortran_caf_atomic_op214507
! Node: _gfortran_caf_co_broadcast216538
! Node: _gfortran_caf_co_max217603
! Node: _gfortran_caf_co_min219153
! Node: _gfortran_caf_co_sum220697
! Node: _gfortran_caf_co_reduce222153
! Node: Intrinsic Procedures224644
! Node: Introduction to Intrinsics241124
! Node: ABORT243476
! Node: ABS244222
! Node: ACCESS245839
! Node: ACHAR247760
! Node: ACOS248961
! Node: ACOSH250198
! Node: ADJUSTL251186
! Node: ADJUSTR252127
! Node: AIMAG253074
! Node: AINT254455
! Node: ALARM256042
! Node: ALL257676
! Node: ALLOCATED259594
! Node: AND260731
! Node: ANINT262028
! Node: ANY263506
! Node: ASIN265436
! Node: ASINH266662
! Node: ASSOCIATED267660
! Node: ATAN270665
! Node: ATAN2272084
! Node: ATANH273856
! Node: ATOMIC_ADD274853
! Node: ATOMIC_AND276392
! Node: ATOMIC_CAS277987
! Node: ATOMIC_DEFINE279850
! Node: ATOMIC_FETCH_ADD281557
! Node: ATOMIC_FETCH_AND283344
! Node: ATOMIC_FETCH_OR285140
! Node: ATOMIC_FETCH_XOR286928
! Node: ATOMIC_OR288717
! Node: ATOMIC_REF290309
! Node: ATOMIC_XOR292211
! Node: BACKTRACE293803
! Node: BESSEL_J0294382
! Node: BESSEL_J1295390
! Node: BESSEL_JN296399
! Node: BESSEL_Y0298281
! Node: BESSEL_Y1299227
! Node: BESSEL_YN300173
! Node: BGE302005
! Node: BGT302694
! Node: BIT_SIZE303341
! Node: BLE304162
! Node: BLT304841
! Node: BTEST305476
! Node: C_ASSOCIATED306359
! Node: C_F_POINTER307568
! Node: C_F_PROCPOINTER308992
! Node: C_FUNLOC310493
! Node: C_LOC311862
! Node: C_SIZEOF313139
! Node: CEILING314549
! Node: CHAR315554
! Node: CHDIR316758
! Node: CHMOD317926
! Node: CMPLX319789
! Node: CO_BROADCAST321243
! Node: CO_MAX323007
! Node: CO_MIN324879
! Node: CO_REDUCE326737
! Node: CO_SUM330214
! Node: COMMAND_ARGUMENT_COUNT332113
! Node: COMPILER_OPTIONS333037
! Node: COMPILER_VERSION334063
! Node: COMPLEX335027
! Node: CONJG336164
! Node: COS337235
! Node: COSH338681
! Node: COUNT339846
! Node: CPU_TIME341862
! Node: CSHIFT343216
! Node: CTIME344872
! Node: DATE_AND_TIME346382
! Node: DBLE348842
! Node: DCMPLX349635
! Node: DIGITS350829
! Node: DIM351795
! Node: DOT_PRODUCT353053
! Node: DPROD354709
! Node: DREAL355626
! Node: DSHIFTL356292
! Node: DSHIFTR357612
! Node: DTIME358933
! Node: EOSHIFT361736
! Node: EPSILON363809
! Node: ERF364535
! Node: ERFC365309
! Node: ERFC_SCALED366113
! Node: ETIME366805
! Node: EXECUTE_COMMAND_LINE369046
! Node: EXIT371626
! Node: EXP372500
! Node: EXPONENT373773
! Node: EXTENDS_TYPE_OF374533
! Node: FDATE375386
! Node: FGET376868
! Node: FGETC378686
! Node: FLOOR380485
! Node: FLUSH381471
! Node: FNUM383348
! Node: FPUT384072
! Node: FPUTC385699
! Node: FRACTION387472
! Node: FREE388375
! Node: FSEEK389212
! Node: FSTAT391508
! Node: FTELL392590
! Node: GAMMA393570
! Node: GERROR394613
! Node: GETARG395334
! Node: GET_COMMAND397100
! Node: GET_COMMAND_ARGUMENT398466
! Node: GETCWD400502
! Node: GETENV401476
! Node: GET_ENVIRONMENT_VARIABLE402901
! Node: GETGID405054
! Node: GETLOG405591
! Node: GETPID406451
! Node: GETUID407181
! Node: GMTIME407697
! Node: HOSTNM409186
! Node: HUGE410104
! Node: HYPOT410825
! Node: IACHAR411645
! Node: IALL412825
! Node: IAND414302
! Node: IANY415286
! Node: IARGC416772
! Node: IBCLR417793
! Node: IBITS418454
! Node: IBSET419369
! Node: ICHAR420025
! Node: IDATE422197
! Node: IEOR423224
! Node: IERRNO424100
! Node: IMAGE_INDEX424649
! Node: INDEX intrinsic425673
! Node: INT427214
! Node: INT2428946
! Node: INT8429711
! Node: IOR430423
! Node: IPARITY431275
! Node: IRAND432799
! Node: IS_IOSTAT_END434155
! Node: IS_IOSTAT_EOR435252
! Node: ISATTY436379
! Node: ISHFT437162
! Node: ISHFTC438142
! Node: ISNAN439358
! Node: ITIME440106
! Node: KILL441131
! Node: KIND442035
! Node: LBOUND442880
! Node: LCOBOUND444213
! Node: LEADZ445343
! Node: LEN446203
! Node: LEN_TRIM447484
! Node: LGE448466
! Node: LGT449968
! Node: LINK451435
! Node: LLE452470
! Node: LLT453964
! Node: LNBLNK455424
! Node: LOC456200
! Node: LOG456931
! Node: LOG10458331
! Node: LOG_GAMMA459305
! Node: LOGICAL460394
! Node: LONG461202
! Node: LSHIFT461958
! Node: LSTAT463043
! Node: LTIME464237
! Node: MALLOC465648
! Node: MASKL467107
! Node: MASKR467870
! Node: MATMUL468636
! Node: MAX469725
! Node: MAXEXPONENT471224
! Node: MAXLOC472040
! Node: MAXVAL474059
! Node: MCLOCK475692
! Node: MCLOCK8476716
! Node: MERGE477949
! Node: MERGE_BITS478698
! Node: MIN479559
! Node: MINEXPONENT481060
! Node: MINLOC481690
! Node: MINVAL483709
! Node: MOD485361
! Node: MODULO487106
! Node: MOVE_ALLOC488406
! Node: MVBITS489435
! Node: NEAREST490494
! Node: NEW_LINE491590
! Node: NINT492361
! Node: NORM2493764
! Node: NOT494902
! Node: NULL495486
! Node: NUM_IMAGES496391
! Node: OR498101
! Node: PACK499385
! Node: PARITY501378
! Node: PERROR502593
! Node: POPCNT503214
! Node: POPPAR504085
! Node: PRECISION505136
! Node: PRESENT506022
! Node: PRODUCT507128
! Node: RADIX508653
! Node: RAN509465
! Node: RAND509921
! Node: RANDOM_NUMBER511253
! Node: RANDOM_SEED512970
! Node: RANGE516782
! Node: RANK517478
! Node: REAL518258
! Node: RENAME520033
! Node: REPEAT521052
! Node: RESHAPE521778
! Node: RRSPACING523247
! Node: RSHIFT523940
! Node: SAME_TYPE_AS525078
! Node: SCALE525908
! Node: SCAN526688
! Node: SECNDS528238
! Node: SECOND529326
! Node: SELECTED_CHAR_KIND530202
! Node: SELECTED_INT_KIND531793
! Node: SELECTED_REAL_KIND532968
! Node: SET_EXPONENT535634
! Node: SHAPE536630
! Node: SHIFTA538045
! Node: SHIFTL539006
! Node: SHIFTR539841
! Node: SIGN540677
! Node: SIGNAL541961
! Node: SIN543458
! Node: SINH544556
! Node: SIZE545552
! Node: SIZEOF546860
! Node: SLEEP548510
! Node: SPACING549070
! Node: SPREAD550083
! Node: SQRT551228
! Node: SRAND552582
! Node: STAT553750
! Node: STORAGE_SIZE556917
! Node: SUM557796
! Node: SYMLNK559279
! Node: SYSTEM560411
! Node: SYSTEM_CLOCK561662
! Node: TAN564489
! Node: TANH565461
! Node: THIS_IMAGE566618
! Node: TIME568907
! Node: TIME8570032
! Node: TINY571182
! Node: TRAILZ571782
! Node: TRANSFER572599
! Node: TRANSPOSE574633
! Node: TRIM575320
! Node: TTYNAM576177
! Node: UBOUND577092
! Node: UCOBOUND578482
! Node: UMASK579614
! Node: UNLINK580292
! Node: UNPACK581269
! Node: VERIFY582557
! Node: XOR584278
! Node: Intrinsic Modules585650
! Node: ISO_FORTRAN_ENV585939
! Node: ISO_C_BINDING590325
! Node: IEEE modules594516
! Node: OpenMP Modules OMP_LIB and OMP_LIB_KINDS595661
! Node: OpenACC Module OPENACC597205
! Node: Contributing598132
! Node: Contributors598986
! Node: Projects600653
! Node: Proposed Extensions601458
! Node: Copying603469
! Node: GNU Free Documentation License641033
! Node: Funding666176
! Node: Option Index668701
! Node: Keyword Index684113
  
  End Tag Table
--- 20200,20613 ----
  
  
  Tag Table:
! Node: Top1950
! Node: Introduction3361
! Node: About GNU Fortran4110
! Node: GNU Fortran and GCC8099
! Node: Preprocessing and conditional compilation10213
! Node: GNU Fortran and G7711858
! Node: Project Status12431
! Node: Standards15132
! Node: Varying Length Character Strings16421
! Node: Invoking GNU Fortran17173
! Node: Option Summary18896
! Node: Fortran Dialect Options22334
! Node: Preprocessing Options31601
! Node: Error and Warning Options39842
! Node: Debugging Options50397
! Node: Directory Options53865
! Node: Link Options55300
! Node: Runtime Options55926
! Node: Code Gen Options57833
! Node: Environment Variables73996
! Node: Runtime74601
! Node: TMPDIR75701
! Node: GFORTRAN_STDIN_UNIT76371
! Node: GFORTRAN_STDOUT_UNIT76753
! Node: GFORTRAN_STDERR_UNIT77154
! Node: GFORTRAN_UNBUFFERED_ALL77556
! Node: GFORTRAN_UNBUFFERED_PRECONNECTED78087
! Node: GFORTRAN_SHOW_LOCUS78731
! Node: GFORTRAN_OPTIONAL_PLUS79227
! Node: GFORTRAN_DEFAULT_RECL79703
! Node: GFORTRAN_LIST_SEPARATOR80191
! Node: GFORTRAN_CONVERT_UNIT80800
! Node: GFORTRAN_ERROR_BACKTRACE83655
! Node: Fortran 2003 and 2008 status84212
! Node: Fortran 2003 status84472
! Node: Fortran 2008 status89715
! Node: TS 29113 status94565
! Node: Compiler Characteristics95543
! Node: KIND Type Parameters96134
! Node: Internal representation of LOGICAL variables97562
! Node: Thread-safety of the runtime library98422
! Node: Data consistency and durability100825
! Node: Files opened without an explicit ACTION= specifier103938
! Node: Extensions104587
! Node: Extensions implemented in GNU Fortran105192
! Node: Old-style kind specifications106591
! Node: Old-style variable initialization107693
! Node: Extensions to namelist109005
! Node: X format descriptor without count field111308
! Node: Commas in FORMAT specifications111835
! Node: Missing period in FORMAT specifications112352
! Node: I/O item lists112914
! Node: Q exponent-letter113299
! Node: BOZ literal constants113897
! Node: Real array indices116476
! Node: Unary operators116775
! Node: Implicitly convert LOGICAL and INTEGER values117189
! Node: Hollerith constants support118148
! Node: Cray pointers119920
! Node: CONVERT specifier125367
! Node: OpenMP127362
! Node: OpenACC129620
! Node: Argument list functions130929
! Node: Read/Write after EOF marker132572
! Node: Extensions not implemented in GNU Fortran133146
! Node: STRUCTURE and RECORD134095
! Node: ENCODE and DECODE statements136532
! Node: Variable FORMAT expressions137892
! Node: Alternate complex function syntax138997
! Node: Volatile COMMON blocks139547
! Node: Mixed-Language Programming140024
! Node: Interoperability with C140604
! Node: Intrinsic Types141938
! Node: Derived Types and struct142934
! Node: Interoperable Global Variables144292
! Node: Interoperable Subroutines and Functions145567
! Node: Working with Pointers149361
! Node: Further Interoperability of Fortran with C153837
! Node: GNU Fortran Compiler Directives157191
! Node: Non-Fortran Main Program160443
! Node: _gfortran_set_args162631
! Node: _gfortran_set_options163569
! Node: _gfortran_set_convert166969
! Node: _gfortran_set_record_marker167837
! Node: _gfortran_set_fpe168647
! Node: _gfortran_set_max_subrecord_length169845
! Node: Naming and argument-passing conventions170768
! Node: Naming conventions171487
! Node: Argument passing conventions172959
! Node: Coarray Programming177453
! Node: Type and enum ABI Documentation177700
! Node: caf_token_t177942
! Node: caf_register_t178178
! Node: Function ABI Documentation178632
! Node: _gfortran_caf_init180375
! Node: _gfortran_caf_finish181800
! Node: _gfortran_caf_this_image182739
! Node: _gfortran_caf_num_images183493
! Node: _gfortran_caf_register184599
! Node: _gfortran_caf_deregister187804
! Node: _gfortran_caf_send188873
! Node: _gfortran_caf_get191678
! Node: _gfortran_caf_sendget194357
! Node: _gfortran_caf_lock197785
! Node: _gfortran_caf_unlock199518
! Node: _gfortran_caf_event_post200963
! Node: _gfortran_caf_event_wait202374
! Node: _gfortran_caf_event_query204433
! Node: _gfortran_caf_sync_all205737
! Node: _gfortran_caf_sync_images206651
! Node: _gfortran_caf_sync_memory208163
! Node: _gfortran_caf_error_stop209141
! Node: _gfortran_caf_error_stop_str209738
! Node: _gfortran_caf_atomic_define210408
! Node: _gfortran_caf_atomic_ref211684
! Node: _gfortran_caf_atomic_cas212979
! Node: _gfortran_caf_atomic_op214696
! Node: _gfortran_caf_co_broadcast216751
! Node: _gfortran_caf_co_max217826
! Node: _gfortran_caf_co_min219388
! Node: _gfortran_caf_co_sum220944
! Node: _gfortran_caf_co_reduce222411
! Node: Intrinsic Procedures224912
! Node: Introduction to Intrinsics241392
! Node: ABORT243742
! Node: ABS244487
! Node: ACCESS246089
! Node: ACHAR248019
! Node: ACOS249223
! Node: ACOSH250477
! Node: ADJUSTL251472
! Node: ADJUSTR252414
! Node: AIMAG253362
! Node: AINT254734
! Node: ALARM256340
! Node: ALL257972
! Node: ALLOCATED259896
! Node: AND261035
! Node: ANINT262334
! Node: ANY263831
! Node: ASIN265757
! Node: ASINH267000
! Node: ASSOCIATED268005
! Node: ATAN271016
! Node: ATAN2272434
! Node: ATANH274224
! Node: ATOMIC_ADD275229
! Node: ATOMIC_AND276761
! Node: ATOMIC_CAS278349
! Node: ATOMIC_DEFINE280208
! Node: ATOMIC_FETCH_ADD281927
! Node: ATOMIC_FETCH_AND283727
! Node: ATOMIC_FETCH_OR285517
! Node: ATOMIC_FETCH_XOR287294
! Node: ATOMIC_OR289077
! Node: ATOMIC_REF290662
! Node: ATOMIC_XOR292558
! Node: BACKTRACE294143
! Node: BESSEL_J0294723
! Node: BESSEL_J1295739
! Node: BESSEL_JN296756
! Node: BESSEL_Y0298581
! Node: BESSEL_Y1299536
! Node: BESSEL_YN300491
! Node: BGE302322
! Node: BGT303014
! Node: BIT_SIZE303664
! Node: BLE304486
! Node: BLT305168
! Node: BTEST305806
! Node: C_ASSOCIATED306691
! Node: C_F_POINTER307902
! Node: C_F_PROCPOINTER309337
! Node: C_FUNLOC310844
! Node: C_LOC312215
! Node: C_SIZEOF313494
! Node: CEILING314907
! Node: CHAR315915
! Node: CHDIR317127
! Node: CHMOD318301
! Node: CMPLX320216
! Node: CO_BROADCAST321659
! Node: CO_MAX323432
! Node: CO_MIN325312
! Node: CO_REDUCE327178
! Node: CO_SUM330681
! Node: COMMAND_ARGUMENT_COUNT332588
! Node: COMPILER_OPTIONS333505
! Node: COMPILER_VERSION334531
! Node: COMPLEX335495
! Node: CONJG336634
! Node: COS337690
! Node: COSH339114
! Node: COUNT340296
! Node: CPU_TIME342319
! Node: CSHIFT343676
! Node: CTIME345336
! Node: DATE_AND_TIME346838
! Node: DBLE349318
! Node: DCMPLX350113
! Node: DIGITS351295
! Node: DIM352262
! Node: DOT_PRODUCT353543
! Node: DPROD355186
! Node: DREAL356113
! Node: DSHIFTL356779
! Node: DSHIFTR358112
! Node: DTIME359446
! Node: EOSHIFT362261
! Node: EPSILON364334
! Node: ERF365061
! Node: ERFC365842
! Node: ERFC_SCALED366652
! Node: ETIME367345
! Node: EXECUTE_COMMAND_LINE369593
! Node: EXIT372180
! Node: EXP373056
! Node: EXPONENT374307
! Node: EXTENDS_TYPE_OF375069
! Node: FDATE375925
! Node: FGET377398
! Node: FGETC379223
! Node: FLOOR381029
! Node: FLUSH382018
! Node: FNUM383897
! Node: FPUT384622
! Node: FPUTC386256
! Node: FRACTION388037
! Node: FREE388941
! Node: FSEEK389784
! Node: FSTAT392090
! Node: FTELL393177
! Node: GAMMA394159
! Node: GERROR395213
! Node: GETARG395935
! Node: GET_COMMAND397708
! Node: GET_COMMAND_ARGUMENT399082
! Node: GETCWD401130
! Node: GETENV402110
! Node: GET_ENVIRONMENT_VARIABLE403542
! Node: GETGID405705
! Node: GETLOG406242
! Node: GETPID407104
! Node: GETUID407834
! Node: GMTIME408350
! Node: HOSTNM409834
! Node: HUGE410755
! Node: HYPOT411477
! Node: IACHAR412303
! Node: IALL413471
! Node: IAND414956
! Node: IANY415943
! Node: IARGC417437
! Node: IBCLR418458
! Node: IBITS419120
! Node: IBSET420038
! Node: ICHAR420695
! Node: IDATE422865
! Node: IEOR423895
! Node: IERRNO424775
! Node: IMAGE_INDEX425324
! Node: INDEX intrinsic426352
! Node: INT427878
! Node: INT2429637
! Node: INT8430405
! Node: IOR431120
! Node: IPARITY431976
! Node: IRAND433508
! Node: IS_IOSTAT_END434867
! Node: IS_IOSTAT_EOR435966
! Node: ISATTY437095
! Node: ISHFT437878
! Node: ISHFTC438861
! Node: ISNAN440082
! Node: ITIME440849
! Node: KILL441877
! Node: KIND442786
! Node: LBOUND443632
! Node: LCOBOUND444970
! Node: LEADZ446105
! Node: LEN446966
! Node: LEN_TRIM448262
! Node: LGE449250
! Node: LGT450763
! Node: LINK452241
! Node: LLE453280
! Node: LLT454780
! Node: LNBLNK456251
! Node: LOC457029
! Node: LOG457761
! Node: LOG10459106
! Node: LOG_GAMMA460096
! Node: LOGICAL461198
! Node: LONG462010
! Node: LSHIFT462768
! Node: LSTAT463854
! Node: LTIME465054
! Node: MALLOC466460
! Node: MASKL467922
! Node: MASKR468689
! Node: MATMUL469459
! Node: MAX470557
! Node: MAXEXPONENT472092
! Node: MAXLOC472909
! Node: MAXVAL474934
! Node: MCLOCK476574
! Node: MCLOCK8477597
! Node: MERGE478827
! Node: MERGE_BITS479579
! Node: MIN480444
! Node: MINEXPONENT481982
! Node: MINLOC482613
! Node: MINVAL484638
! Node: MOD486291
! Node: MODULO488060
! Node: MOVE_ALLOC489363
! Node: MVBITS490396
! Node: NEAREST491462
! Node: NEW_LINE492562
! Node: NINT493335
! Node: NORM2494756
! Node: NOT495898
! Node: NULL496482
! Node: NUM_IMAGES497390
! Node: OR499091
! Node: PACK500377
! Node: PARITY502385
! Node: PERROR503606
! Node: POPCNT504231
! Node: POPPAR505103
! Node: PRECISION506157
! Node: PRESENT507044
! Node: PRODUCT508156
! Node: RADIX509690
! Node: RAN510502
! Node: RAND510958
! Node: RANDOM_NUMBER512293
! Node: RANDOM_SEED514022
! Node: RANGE517853
! Node: RANK518534
! Node: REAL519315
! Node: RENAME521112
! Node: REPEAT522134
! Node: RESHAPE522862
! Node: RRSPACING524329
! Node: RSHIFT525022
! Node: SAME_TYPE_AS526162
! Node: SCALE526994
! Node: SCAN527775
! Node: SECNDS529333
! Node: SECOND530425
! Node: SELECTED_CHAR_KIND531301
! Node: SELECTED_INT_KIND532896
! Node: SELECTED_REAL_KIND534073
! Node: SET_EXPONENT536750
! Node: SHAPE537747
! Node: SHIFTA539171
! Node: SHIFTL540135
! Node: SHIFTR540972
! Node: SIGN541810
! Node: SIGNAL543036
! Node: SIN544542
! Node: SINH545584
! Node: SIZE546596
! Node: SIZEOF547915
! Node: SLEEP549570
! Node: SPACING550131
! Node: SPREAD551145
! Node: SQRT552296
! Node: SRAND553628
! Node: STAT554798
! Node: STORAGE_SIZE557966
! Node: SUM558845
! Node: SYMLNK560337
! Node: SYSTEM561472
! Node: SYSTEM_CLOCK562727
! Node: TAN565557
! Node: TANH566545
! Node: THIS_IMAGE567719
! Node: TIME570019
! Node: TIME8571144
! Node: TINY572297
! Node: TRAILZ572898
! Node: TRANSFER573716
! Node: TRANSPOSE575752
! Node: TRIM576442
! Node: TTYNAM577300
! Node: UBOUND578218
! Node: UCOBOUND579608
! Node: UMASK580745
! Node: UNLINK581427
! Node: UNPACK582407
! Node: VERIFY583702
! Node: XOR585431
! Node: Intrinsic Modules586804
! Node: ISO_FORTRAN_ENV587093
! Node: ISO_C_BINDING591496
! Node: IEEE modules595202
! Node: OpenMP Modules OMP_LIB and OMP_LIB_KINDS596345
! Node: OpenACC Module OPENACC597880
! Node: Contributing598807
! Node: Contributors599661
! Node: Projects601292
! Node: Proposed Extensions602099
! Node: Copying604109
! Node: GNU Free Documentation License641655
! Node: Funding666779
! Node: Option Index669305
! Node: Keyword Index684717
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/gcc/fortran/interface.c gcc-5.5.0/gcc/fortran/interface.c
*** gcc-5.4.0/gcc/fortran/interface.c	Sun May 15 21:01:50 2016
--- gcc-5.5.0/gcc/fortran/interface.c	Thu Nov 24 20:11:49 2016
*************** gfc_compare_derived_types (gfc_symbol *d
*** 398,404 ****
    if (derived1 == derived2)
      return 1;
  
!   gcc_assert (derived1 && derived2);
  
    /* Special case for comparing derived types across namespaces.  If the
       true names and module names are the same and the module name is
--- 398,405 ----
    if (derived1 == derived2)
      return 1;
  
!   if (!derived1 || !derived2)
!     gfc_internal_error ("gfc_compare_derived_types: invalid derived type");
  
    /* Special case for comparing derived types across namespaces.  If the
       true names and module names are the same and the module name is
*************** compare_parameter (gfc_symbol *formal, g
*** 2026,2032 ****
      {
        if (where)
  	gfc_error ("Type mismatch in argument %qs at %L; passed %s to %s",
! 		   formal->name, &actual->where, gfc_typename (&actual->ts),
  		   gfc_typename (&formal->ts));
        return 0;
      }
--- 2027,2033 ----
      {
        if (where)
  	gfc_error ("Type mismatch in argument %qs at %L; passed %s to %s",
! 		   formal->name, where, gfc_typename (&actual->ts),
  		   gfc_typename (&formal->ts));
        return 0;
      }
*************** matching_typebound_op (gfc_expr** tb_bas
*** 3651,3657 ****
  
  	if (base->expr->ts.type == BT_CLASS)
  	  {
! 	    if (CLASS_DATA (base->expr) == NULL
  		|| !gfc_expr_attr (base->expr).class_ok)
  	      continue;
  	    derived = CLASS_DATA (base->expr)->ts.u.derived;
--- 3652,3658 ----
  
  	if (base->expr->ts.type == BT_CLASS)
  	  {
! 	    if (!base->expr->ts.u.derived || CLASS_DATA (base->expr) == NULL
  		|| !gfc_expr_attr (base->expr).class_ok)
  	      continue;
  	    derived = CLASS_DATA (base->expr)->ts.u.derived;
diff -Nrcpad gcc-5.4.0/gcc/fortran/intrinsic.c gcc-5.5.0/gcc/fortran/intrinsic.c
*** gcc-5.4.0/gcc/fortran/intrinsic.c	Fri Feb 12 16:31:25 2016
--- gcc-5.5.0/gcc/fortran/intrinsic.c	Thu Sep 29 20:32:22 2016
*************** add_functions (void)
*** 1205,1211 ****
      *z = "z", *ln = "len", *ut = "unit", *han = "handler",
      *num = "number", *tm = "time", *nm = "name", *md = "mode",
      *vl = "values", *p1 = "path1", *p2 = "path2", *com = "command",
!     *ca = "coarray", *sub = "sub", *dist = "distance", *failed="failed";
  
    int di, dr, dd, dl, dc, dz, ii;
  
--- 1205,1212 ----
      *z = "z", *ln = "len", *ut = "unit", *han = "handler",
      *num = "number", *tm = "time", *nm = "name", *md = "mode",
      *vl = "values", *p1 = "path1", *p2 = "path2", *com = "command",
!     *ca = "coarray", *sub = "sub", *dist = "distance", *failed="failed",
!     *c_ptr_1 = "c_ptr_1", *c_ptr_2 = "c_ptr_2";
  
    int di, dr, dd, dl, dc, dz, ii;
  
*************** add_functions (void)
*** 2775,2782 ****
    /* The following functions are part of ISO_C_BINDING.  */
    add_sym_2 ("c_associated", GFC_ISYM_C_ASSOCIATED, CLASS_INQUIRY, ACTUAL_NO,
  	     BT_LOGICAL, dl, GFC_STD_F2003, gfc_check_c_associated, NULL, NULL,
! 	     "C_PTR_1", BT_VOID, 0, REQUIRED,
! 	     "C_PTR_2", BT_VOID, 0, OPTIONAL);
    make_from_module();
  
    add_sym_1 ("c_loc", GFC_ISYM_C_LOC, CLASS_INQUIRY, ACTUAL_NO,
--- 2776,2783 ----
    /* The following functions are part of ISO_C_BINDING.  */
    add_sym_2 ("c_associated", GFC_ISYM_C_ASSOCIATED, CLASS_INQUIRY, ACTUAL_NO,
  	     BT_LOGICAL, dl, GFC_STD_F2003, gfc_check_c_associated, NULL, NULL,
! 	     c_ptr_1, BT_VOID, 0, REQUIRED,
! 	     c_ptr_2, BT_VOID, 0, OPTIONAL);
    make_from_module();
  
    add_sym_1 ("c_loc", GFC_ISYM_C_LOC, CLASS_INQUIRY, ACTUAL_NO,
diff -Nrcpad gcc-5.4.0/gcc/fortran/io.c gcc-5.5.0/gcc/fortran/io.c
*** gcc-5.4.0/gcc/fortran/io.c	Fri Nov 13 21:28:10 2015
--- gcc-5.5.0/gcc/fortran/io.c	Fri Sep 30 15:50:31 2016
*************** gfc_resolve_dt (gfc_dt *dt, locus *loc)
*** 3005,3011 ****
      }
  
    if (dt->extra_comma
!       && !gfc_notify_std (GFC_STD_GNU, "Comma before i/o item list at %L", 
  			  &dt->extra_comma->where))
      return false;
  
--- 3005,3011 ----
      }
  
    if (dt->extra_comma
!       && !gfc_notify_std (GFC_STD_LEGACY, "Comma before i/o item list at %L", 
  			  &dt->extra_comma->where))
      return false;
  
*************** gfc_resolve_dt (gfc_dt *dt, locus *loc)
*** 3050,3056 ****
        && dt->format_label->defined == ST_LABEL_UNKNOWN)
      {
        gfc_error ("FORMAT label %d at %L not defined", dt->format_label->value,
! 		 &dt->format_label->where);
        return false;
      }
  
--- 3050,3056 ----
        && dt->format_label->defined == ST_LABEL_UNKNOWN)
      {
        gfc_error ("FORMAT label %d at %L not defined", dt->format_label->value,
! 		 loc);
        return false;
      }
  
diff -Nrcpad gcc-5.4.0/gcc/fortran/match.c gcc-5.5.0/gcc/fortran/match.c
*** gcc-5.4.0/gcc/fortran/match.c	Fri Feb 12 16:31:25 2016
--- gcc-5.5.0/gcc/fortran/match.c	Sun Nov  6 20:30:31 2016
*************** gfc_match_cycle (void)
*** 2608,2627 ****
  }
  
  
! /* Match a number or character constant after an (ERROR) STOP or PAUSE
!    statement.  */
  
  static match
  gfc_match_stopcode (gfc_statement st)
  {
!   gfc_expr *e;
    match m;
  
!   e = NULL;
  
    if (gfc_match_eos () != MATCH_YES)
      {
!       m = gfc_match_init_expr (&e);
        if (m == MATCH_ERROR)
  	goto cleanup;
        if (m == MATCH_NO)
--- 2608,2699 ----
  }
  
  
! /* Match a stop-code after an (ERROR) STOP or PAUSE statement.  The
!    requirements for a stop-code differ in the standards.
! 
! Fortran 95 has
! 
!    R840 stop-stmt  is STOP [ stop-code ]
!    R841 stop-code  is scalar-char-constant
!                    or digit [ digit [ digit [ digit [ digit ] ] ] ]
! 
! Fortran 2003 matches Fortran 95 except R840 and R841 are now R849 and R850.
! Fortran 2008 has
! 
!    R855 stop-stmt     is STOP [ stop-code ]
!    R856 allstop-stmt  is ALL STOP [ stop-code ]
!    R857 stop-code     is scalar-default-char-constant-expr
!                       or scalar-int-constant-expr
! 
! For free-form source code, all standards contain a statement of the form:
! 
!    A blank shall be used to separate names, constants, or labels from
!    adjacent keywords, names, constants, or labels.
! 
! A stop-code is not a name, constant, or label.  So, under Fortran 95 and 2003,
! 
!   STOP123
! 
! is valid, but it is invalid Fortran 2008.  */
  
  static match
  gfc_match_stopcode (gfc_statement st)
  {
!   gfc_expr *e = NULL;
    match m;
+   bool f95, f03;
  
!   /* Set f95 for -std=f95.  */
!   f95 = gfc_option.allow_std == (GFC_STD_F95_OBS | GFC_STD_F95 | GFC_STD_F77
! 				 | GFC_STD_F2008_OBS);
! 
!   /* Set f03 for -std=f2003.  */
!   f03 = gfc_option.allow_std == (GFC_STD_F95_OBS | GFC_STD_F95 | GFC_STD_F77 
! 				 | GFC_STD_F2008_OBS | GFC_STD_F2003);
! 
!   /* Look for a blank between STOP and the stop-code for F2008 or later.  */
!   if (gfc_current_form != FORM_FIXED && !(f95 || f03))
!     {
!       char c = gfc_peek_ascii_char ();
! 
!       /* Look for end-of-statement.  There is no stop-code.  */
!       if (c == '\n' || c == '!' || c == ';')
!         goto done;
! 
!       if (c != ' ')
! 	{
! 	  gfc_error ("Blank required in %s statement near %C",
! 		     gfc_ascii_statement (st));
! 	  return MATCH_ERROR;
! 	}
!     }
  
    if (gfc_match_eos () != MATCH_YES)
      {
!       int stopcode;
!       locus old_locus;
! 
!       /* First look for the F95 or F2003 digit [...] construct.  */
!       old_locus = gfc_current_locus;
!       m = gfc_match_small_int (&stopcode);
!       if (m == MATCH_YES && (f95 || f03))
! 	{
! 	  if (stopcode < 0)
! 	    {
! 	      gfc_error ("STOP code at %C cannot be negative");
! 	      return MATCH_ERROR;
! 	    }
! 
! 	  if (stopcode > 99999)
! 	    {
! 	      gfc_error ("STOP code at %C contains too many digits");
! 	      return MATCH_ERROR;
! 	    }
! 	}
! 
!       /* Reset the locus and now load gfc_expr.  */
!       gfc_current_locus = old_locus;
!       m = gfc_match_expr (&e);
        if (m == MATCH_ERROR)
  	goto cleanup;
        if (m == MATCH_NO)
*************** gfc_match_stopcode (gfc_statement st)
*** 2662,2667 ****
--- 2734,2755 ----
  
    if (e != NULL)
      {
+       gfc_simplify_expr (e, 0);
+ 
+       /* Test for F95 and F2003 style STOP stop-code.  */
+       if (e->expr_type != EXPR_CONSTANT && (f95 || f03))
+ 	{
+ 	  gfc_error ("STOP code at %L must be a scalar CHARACTER constant or "
+ 		     "digit[digit[digit[digit[digit]]]]", &e->where);
+ 	  goto cleanup;
+ 	}
+ 
+       /* Use the machinery for an initialization expression to reduce the
+ 	 stop-code to a constant.  */
+       gfc_init_expr_flag = true;
+       gfc_reduce_init_expr (e);
+       gfc_init_expr_flag = false;
+ 
        if (!(e->ts.type == BT_CHARACTER || e->ts.type == BT_INTEGER))
  	{
  	  gfc_error ("STOP code at %L must be either INTEGER or CHARACTER type",
*************** gfc_match_stopcode (gfc_statement st)
*** 2671,2678 ****
  
        if (e->rank != 0)
  	{
! 	  gfc_error ("STOP code at %L must be scalar",
! 		     &e->where);
  	  goto cleanup;
  	}
  
--- 2759,2765 ----
  
        if (e->rank != 0)
  	{
! 	  gfc_error ("STOP code at %L must be scalar", &e->where);
  	  goto cleanup;
  	}
  
*************** gfc_match_stopcode (gfc_statement st)
*** 2684,2691 ****
  	  goto cleanup;
  	}
  
!       if (e->ts.type == BT_INTEGER
! 	  && e->ts.kind != gfc_default_integer_kind)
  	{
  	  gfc_error ("STOP code at %L must be default integer KIND=%d",
  		     &e->where, (int) gfc_default_integer_kind);
--- 2771,2777 ----
  	  goto cleanup;
  	}
  
!       if (e->ts.type == BT_INTEGER && e->ts.kind != gfc_default_integer_kind)
  	{
  	  gfc_error ("STOP code at %L must be default integer KIND=%d",
  		     &e->where, (int) gfc_default_integer_kind);
*************** gfc_match_stopcode (gfc_statement st)
*** 2693,2698 ****
--- 2779,2786 ----
  	}
      }
  
+ done:
+ 
    switch (st)
      {
      case ST_STOP:
*************** match_simple_where (void)
*** 5842,5847 ****
--- 5930,5936 ----
  
    c->next = XCNEW (gfc_code);
    *c->next = new_st;
+   c->next->loc = gfc_current_locus;
    gfc_clear_new_st ();
  
    new_st.op = EXEC_WHERE;
*************** gfc_match_where (gfc_statement *st)
*** 5898,5905 ****
--- 5987,5998 ----
    c = gfc_get_code (EXEC_WHERE);
    c->expr1 = expr;
  
+   /* Put in the assignment.  It will not be processed by add_statement, so we
+      need to copy the location here. */
+ 
    c->next = XCNEW (gfc_code);
    *c->next = new_st;
+   c->next->loc = gfc_current_locus;
    gfc_clear_new_st ();
  
    new_st.op = EXEC_WHERE;
diff -Nrcpad gcc-5.4.0/gcc/fortran/openmp.c gcc-5.5.0/gcc/fortran/openmp.c
*** gcc-5.4.0/gcc/fortran/openmp.c	Sun Feb  1 00:29:54 2015
--- gcc-5.5.0/gcc/fortran/openmp.c	Tue May 30 07:52:55 2017
*************** resolve_omp_clauses (gfc_code *code, loc
*** 3166,3171 ****
--- 3166,3176 ----
  		    else
  		      resolve_oacc_data_clauses (n->sym, *where, name);
  		  }
+ 		else if (list != OMP_LIST_DEPEND
+ 			 && n->sym->as
+ 			 && n->sym->as->type == AS_ASSUMED_SIZE)
+ 		  gfc_error ("Assumed size array %qs in %s clause at %L",
+ 			     n->sym->name, name, where);
  	      }
  
  	    if (list != OMP_LIST_DEPEND)
diff -Nrcpad gcc-5.4.0/gcc/fortran/parse.c gcc-5.5.0/gcc/fortran/parse.c
*** gcc-5.4.0/gcc/fortran/parse.c	Fri Feb 12 16:31:25 2016
--- gcc-5.5.0/gcc/fortran/parse.c	Fri Jul  8 21:58:57 2016
*************** decode_statement (void)
*** 564,584 ****
    return ST_NONE;
  }
  
! /* Like match, but set a flag simd_matched if keyword matched.  */
! #define matchs(keyword, subr, st)				\
!     do {							\
!       if (match_word_omp_simd (keyword, subr, &old_locus,	\
! 			       &simd_matched) == MATCH_YES)	\
! 	return st;						\
!       else							\
! 	undo_new_statement ();				  	\
!     } while (0);
! 
! /* Like match, but don't match anything if not -fopenmp.  */
! #define matcho(keyword, subr, st)				\
      do {							\
!       if (!flag_openmp)						\
! 	;							\
        else if (match_word (keyword, subr, &old_locus)		\
  	       == MATCH_YES)					\
  	return st;						\
--- 564,575 ----
    return ST_NONE;
  }
  
! /* Like match and if spec_only, goto do_spec_only without actually
!    matching.  */
! #define matcha(keyword, subr, st)				\
      do {							\
!       if (spec_only && gfc_match (keyword) == MATCH_YES)	\
! 	goto do_spec_only;					\
        else if (match_word (keyword, subr, &old_locus)		\
  	       == MATCH_YES)					\
  	return st;						\
*************** decode_oacc_directive (void)
*** 591,596 ****
--- 582,588 ----
  {
    locus old_locus;
    char c;
+   bool spec_only = false;
  
    gfc_enforce_clean_symbol_state ();
  
*************** decode_oacc_directive (void)
*** 605,610 ****
--- 597,606 ----
        return ST_NONE;
      }
  
+   if (gfc_current_state () == COMP_FUNCTION
+       && gfc_current_block ()->result->ts.kind == -1)
+     spec_only = true;
+ 
    gfc_unset_implicit_pure (NULL);
  
    old_locus = gfc_current_locus;
*************** decode_oacc_directive (void)
*** 618,662 ****
    switch (c)
      {
      case 'c':
!       match ("cache", gfc_match_oacc_cache, ST_OACC_CACHE);
        break;
      case 'd':
!       match ("data", gfc_match_oacc_data, ST_OACC_DATA);
        match ("declare", gfc_match_oacc_declare, ST_OACC_DECLARE);
        break;
      case 'e':
!       match ("end data", gfc_match_omp_eos, ST_OACC_END_DATA);
!       match ("end host_data", gfc_match_omp_eos, ST_OACC_END_HOST_DATA);
!       match ("end kernels loop", gfc_match_omp_eos, ST_OACC_END_KERNELS_LOOP);
!       match ("end kernels", gfc_match_omp_eos, ST_OACC_END_KERNELS);
!       match ("end loop", gfc_match_omp_eos, ST_OACC_END_LOOP);
!       match ("end parallel loop", gfc_match_omp_eos, ST_OACC_END_PARALLEL_LOOP);
!       match ("end parallel", gfc_match_omp_eos, ST_OACC_END_PARALLEL);
!       match ("enter data", gfc_match_oacc_enter_data, ST_OACC_ENTER_DATA);
!       match ("exit data", gfc_match_oacc_exit_data, ST_OACC_EXIT_DATA);
        break;
      case 'h':
!       match ("host_data", gfc_match_oacc_host_data, ST_OACC_HOST_DATA);
        break;
      case 'p':
!       match ("parallel loop", gfc_match_oacc_parallel_loop, ST_OACC_PARALLEL_LOOP);
!       match ("parallel", gfc_match_oacc_parallel, ST_OACC_PARALLEL);
        break;
      case 'k':
!       match ("kernels loop", gfc_match_oacc_kernels_loop, ST_OACC_KERNELS_LOOP);
!       match ("kernels", gfc_match_oacc_kernels, ST_OACC_KERNELS);
        break;
      case 'l':
!       match ("loop", gfc_match_oacc_loop, ST_OACC_LOOP);
        break;
      case 'r':
        match ("routine", gfc_match_oacc_routine, ST_OACC_ROUTINE);
        break;
      case 'u':
!       match ("update", gfc_match_oacc_update, ST_OACC_UPDATE);
        break;
      case 'w':
!       match ("wait", gfc_match_oacc_wait, ST_OACC_WAIT);
        break;
      }
  
--- 614,660 ----
    switch (c)
      {
      case 'c':
!       matcha ("cache", gfc_match_oacc_cache, ST_OACC_CACHE);
        break;
      case 'd':
!       matcha ("data", gfc_match_oacc_data, ST_OACC_DATA);
        match ("declare", gfc_match_oacc_declare, ST_OACC_DECLARE);
        break;
      case 'e':
!       matcha ("end data", gfc_match_omp_eos, ST_OACC_END_DATA);
!       matcha ("end host_data", gfc_match_omp_eos, ST_OACC_END_HOST_DATA);
!       matcha ("end kernels loop", gfc_match_omp_eos, ST_OACC_END_KERNELS_LOOP);
!       matcha ("end kernels", gfc_match_omp_eos, ST_OACC_END_KERNELS);
!       matcha ("end loop", gfc_match_omp_eos, ST_OACC_END_LOOP);
!       matcha ("end parallel loop", gfc_match_omp_eos,
! 	      ST_OACC_END_PARALLEL_LOOP);
!       matcha ("end parallel", gfc_match_omp_eos, ST_OACC_END_PARALLEL);
!       matcha ("enter data", gfc_match_oacc_enter_data, ST_OACC_ENTER_DATA);
!       matcha ("exit data", gfc_match_oacc_exit_data, ST_OACC_EXIT_DATA);
        break;
      case 'h':
!       matcha ("host_data", gfc_match_oacc_host_data, ST_OACC_HOST_DATA);
        break;
      case 'p':
!       matcha ("parallel loop", gfc_match_oacc_parallel_loop, ST_OACC_PARALLEL_LOOP);
!       matcha ("parallel", gfc_match_oacc_parallel, ST_OACC_PARALLEL);
        break;
      case 'k':
!       matcha ("kernels loop", gfc_match_oacc_kernels_loop,
! 	      ST_OACC_KERNELS_LOOP);
!       matcha ("kernels", gfc_match_oacc_kernels, ST_OACC_KERNELS);
        break;
      case 'l':
!       matcha ("loop", gfc_match_oacc_loop, ST_OACC_LOOP);
        break;
      case 'r':
        match ("routine", gfc_match_oacc_routine, ST_OACC_ROUTINE);
        break;
      case 'u':
!       matcha ("update", gfc_match_oacc_update, ST_OACC_UPDATE);
        break;
      case 'w':
!       matcha ("wait", gfc_match_oacc_wait, ST_OACC_WAIT);
        break;
      }
  
*************** decode_oacc_directive (void)
*** 671,684 ****
--- 669,740 ----
    gfc_error_recovery ();
  
    return ST_NONE;
+ 
+  do_spec_only:
+   reject_statement ();
+   gfc_clear_error ();
+   gfc_buffer_error (false);
+   gfc_current_locus = old_locus;
+   return ST_GET_FCN_CHARACTERISTICS;
  }
  
+ /* Like match, but set a flag simd_matched if keyword matched
+    and if spec_only, goto do_spec_only without actually matching.  */
+ #define matchs(keyword, subr, st)				\
+     do {							\
+       if (spec_only && gfc_match (keyword) == MATCH_YES)	\
+ 	goto do_spec_only;					\
+       if (match_word_omp_simd (keyword, subr, &old_locus,	\
+ 			       &simd_matched) == MATCH_YES)	\
+ 	return st;						\
+       else							\
+ 	undo_new_statement ();				  	\
+     } while (0);
+ 
+ /* Like match, but don't match anything if not -fopenmp
+    and if spec_only, goto do_spec_only without actually matching.  */
+ #define matcho(keyword, subr, st)				\
+     do {							\
+       if (!flag_openmp)						\
+ 	;							\
+       else if (spec_only && gfc_match (keyword) == MATCH_YES)	\
+ 	goto do_spec_only;					\
+       else if (match_word (keyword, subr, &old_locus)		\
+ 	       == MATCH_YES)					\
+ 	return st;						\
+       else							\
+ 	undo_new_statement ();				  	\
+     } while (0);
+ 
+ /* Like match, but set a flag simd_matched if keyword matched.  */
+ #define matchds(keyword, subr, st)				\
+     do {							\
+       if (match_word_omp_simd (keyword, subr, &old_locus,	\
+ 			       &simd_matched) == MATCH_YES)	\
+ 	return st;						\
+       else							\
+ 	undo_new_statement ();				  	\
+     } while (0);
+ 
+ /* Like match, but don't match anything if not -fopenmp.  */
+ #define matchdo(keyword, subr, st)				\
+     do {							\
+       if (!flag_openmp)						\
+ 	;							\
+       else if (match_word (keyword, subr, &old_locus)		\
+ 	       == MATCH_YES)					\
+ 	return st;						\
+       else							\
+ 	undo_new_statement ();				  	\
+     } while (0);
+ 
  static gfc_statement
  decode_omp_directive (void)
  {
    locus old_locus;
    char c;
    bool simd_matched = false;
+   bool spec_only = false;
  
    gfc_enforce_clean_symbol_state ();
  
*************** decode_omp_directive (void)
*** 693,698 ****
--- 749,758 ----
        return ST_NONE;
      }
  
+   if (gfc_current_state () == COMP_FUNCTION
+       && gfc_current_block ()->result->ts.kind == -1)
+     spec_only = true;
+ 
    gfc_unset_implicit_pure (NULL);
  
    old_locus = gfc_current_locus;
*************** decode_omp_directive (void)
*** 721,732 ****
        matcho ("critical", gfc_match_omp_critical, ST_OMP_CRITICAL);
        break;
      case 'd':
!       matchs ("declare reduction", gfc_match_omp_declare_reduction,
! 	      ST_OMP_DECLARE_REDUCTION);
!       matchs ("declare simd", gfc_match_omp_declare_simd,
! 	      ST_OMP_DECLARE_SIMD);
!       matcho ("declare target", gfc_match_omp_declare_target,
! 	      ST_OMP_DECLARE_TARGET);
        matchs ("distribute parallel do simd",
  	      gfc_match_omp_distribute_parallel_do_simd,
  	      ST_OMP_DISTRIBUTE_PARALLEL_DO_SIMD);
--- 781,792 ----
        matcho ("critical", gfc_match_omp_critical, ST_OMP_CRITICAL);
        break;
      case 'd':
!       matchds ("declare reduction", gfc_match_omp_declare_reduction,
! 	       ST_OMP_DECLARE_REDUCTION);
!       matchds ("declare simd", gfc_match_omp_declare_simd,
! 	       ST_OMP_DECLARE_SIMD);
!       matchdo ("declare target", gfc_match_omp_declare_target,
! 	       ST_OMP_DECLARE_TARGET);
        matchs ("distribute parallel do simd",
  	      gfc_match_omp_distribute_parallel_do_simd,
  	      ST_OMP_DISTRIBUTE_PARALLEL_DO_SIMD);
*************** decode_omp_directive (void)
*** 846,853 ****
        matcho ("teams distribute", gfc_match_omp_teams_distribute,
  	      ST_OMP_TEAMS_DISTRIBUTE);
        matcho ("teams", gfc_match_omp_teams, ST_OMP_TEAMS);
!       matcho ("threadprivate", gfc_match_omp_threadprivate,
! 	      ST_OMP_THREADPRIVATE);
        break;
      case 'w':
        matcho ("workshare", gfc_match_omp_workshare, ST_OMP_WORKSHARE);
--- 906,913 ----
        matcho ("teams distribute", gfc_match_omp_teams_distribute,
  	      ST_OMP_TEAMS_DISTRIBUTE);
        matcho ("teams", gfc_match_omp_teams, ST_OMP_TEAMS);
!       matchdo ("threadprivate", gfc_match_omp_threadprivate,
! 	       ST_OMP_THREADPRIVATE);
        break;
      case 'w':
        matcho ("workshare", gfc_match_omp_workshare, ST_OMP_WORKSHARE);
*************** decode_omp_directive (void)
*** 870,875 ****
--- 930,942 ----
    gfc_error_recovery ();
  
    return ST_NONE;
+ 
+  do_spec_only:
+   reject_statement ();
+   gfc_clear_error ();
+   gfc_buffer_error (false);
+   gfc_current_locus = old_locus;
+   return ST_GET_FCN_CHARACTERISTICS;
  }
  
  static gfc_statement
*************** next_statement (void)
*** 1290,1299 ****
  
    gfc_buffer_error (false);
  
!   if (st == ST_GET_FCN_CHARACTERISTICS && gfc_statement_label != NULL)
      {
!       gfc_free_st_label (gfc_statement_label);
!       gfc_statement_label = NULL;
        gfc_current_locus = old_locus;
      }
  
--- 1357,1369 ----
  
    gfc_buffer_error (false);
  
!   if (st == ST_GET_FCN_CHARACTERISTICS)
      {
!       if (gfc_statement_label != NULL)
! 	{
! 	  gfc_free_st_label (gfc_statement_label);
! 	  gfc_statement_label = NULL;
! 	}
        gfc_current_locus = old_locus;
      }
  
diff -Nrcpad gcc-5.4.0/gcc/fortran/primary.c gcc-5.5.0/gcc/fortran/primary.c
*** gcc-5.4.0/gcc/fortran/primary.c	Mon Jan 25 11:36:11 2016
--- gcc-5.5.0/gcc/fortran/primary.c	Fri Apr 14 13:00:02 2017
*************** gfc_match_structure_constructor (gfc_sym
*** 2657,2662 ****
--- 2657,2668 ----
         return MATCH_ERROR;
       }
  
+   /* If a structure constructor is in a DATA statement, then each entity
+      in the structure constructor must be a constant.  Try to reduce the
+      expression here.  */
+   if (gfc_in_match_data ())
+     gfc_reduce_init_expr (e);
+ 
     *result = e;
     return MATCH_YES;
  }
diff -Nrcpad gcc-5.4.0/gcc/fortran/resolve.c gcc-5.5.0/gcc/fortran/resolve.c
*** gcc-5.4.0/gcc/fortran/resolve.c	Wed Mar  9 20:49:58 2016
--- gcc-5.5.0/gcc/fortran/resolve.c	Sun Nov 20 20:14:18 2016
*************** resolve_variable (gfc_expr *e)
*** 5015,5020 ****
--- 5015,5025 ----
  
    if (sym->ts.type != BT_UNKNOWN)
      gfc_variable_attr (e, &e->ts);
+   else if (sym->attr.flavor == FL_PROCEDURE
+ 	   && sym->attr.function && sym->result
+ 	   && sym->result->ts.type != BT_UNKNOWN
+ 	   && sym->result->attr.proc_pointer)
+     e->ts = sym->result->ts;
    else
      {
        /* Must be a simple variable reference.  */
*************** gfc_resolve_iterator (gfc_iterator *iter
*** 6418,6432 ****
    /* Convert start, end, and step to the same type as var.  */
    if (iter->start->ts.kind != iter->var->ts.kind
        || iter->start->ts.type != iter->var->ts.type)
!     gfc_convert_type (iter->start, &iter->var->ts, 2);
  
    if (iter->end->ts.kind != iter->var->ts.kind
        || iter->end->ts.type != iter->var->ts.type)
!     gfc_convert_type (iter->end, &iter->var->ts, 2);
  
    if (iter->step->ts.kind != iter->var->ts.kind
        || iter->step->ts.type != iter->var->ts.type)
!     gfc_convert_type (iter->step, &iter->var->ts, 2);
  
    if (iter->start->expr_type == EXPR_CONSTANT
        && iter->end->expr_type == EXPR_CONSTANT
--- 6423,6437 ----
    /* Convert start, end, and step to the same type as var.  */
    if (iter->start->ts.kind != iter->var->ts.kind
        || iter->start->ts.type != iter->var->ts.type)
!     gfc_convert_type (iter->start, &iter->var->ts, 1);
  
    if (iter->end->ts.kind != iter->var->ts.kind
        || iter->end->ts.type != iter->var->ts.type)
!     gfc_convert_type (iter->end, &iter->var->ts, 1);
  
    if (iter->step->ts.kind != iter->var->ts.kind
        || iter->step->ts.type != iter->var->ts.type)
!     gfc_convert_type (iter->step, &iter->var->ts, 1);
  
    if (iter->start->expr_type == EXPR_CONSTANT
        && iter->end->expr_type == EXPR_CONSTANT
*************** resolve_assoc_var (gfc_symbol* sym, bool
*** 8060,8065 ****
--- 8065,8082 ----
    /* Mark this as an associate variable.  */
    sym->attr.associate_var = 1;
  
+   /* Fix up the type-spec for CHARACTER types.  */
+   if (sym->ts.type == BT_CHARACTER && !sym->attr.select_type_temporary)
+     {
+       if (!sym->ts.u.cl)
+ 	sym->ts.u.cl = target->ts.u.cl;
+ 
+       if (!sym->ts.u.cl->length)
+ 	sym->ts.u.cl->length
+ 	  = gfc_get_int_expr (gfc_default_integer_kind,
+ 			      NULL, target->value.character.length);
+     }
+ 
    /* If the target is a good class object, so is the associate variable.  */
    if (sym->ts.type == BT_CLASS && gfc_expr_attr (target).class_ok)
      sym->attr.class_ok = 1;
*************** resolve_branch (gfc_st_label *label, gfc
*** 8752,8758 ****
    if (label->defined == ST_LABEL_UNKNOWN)
      {
        gfc_error ("Label %d referenced at %L is never defined", label->value,
! 		 &label->where);
        return;
      }
  
--- 8769,8775 ----
    if (label->defined == ST_LABEL_UNKNOWN)
      {
        gfc_error ("Label %d referenced at %L is never defined", label->value,
! 		 &code->loc);
        return;
      }
  
*************** gfc_resolve_forall (gfc_code *code, gfc_
*** 9117,9132 ****
    static gfc_expr **var_expr;
    static int total_var = 0;
    static int nvar = 0;
!   int old_nvar, tmp;
    gfc_forall_iterator *fa;
-   int i;
  
    old_nvar = nvar;
  
    /* Start to resolve a FORALL construct   */
    if (forall_save == 0)
      {
!       /* Count the total number of FORALL index in the nested FORALL
           construct in order to allocate the VAR_EXPR with proper size.  */
        total_var = gfc_count_forall_iterators (code);
  
--- 9134,9148 ----
    static gfc_expr **var_expr;
    static int total_var = 0;
    static int nvar = 0;
!   int i, old_nvar, tmp;
    gfc_forall_iterator *fa;
  
    old_nvar = nvar;
  
    /* Start to resolve a FORALL construct   */
    if (forall_save == 0)
      {
!       /* Count the total number of FORALL indices in the nested FORALL
           construct in order to allocate the VAR_EXPR with proper size.  */
        total_var = gfc_count_forall_iterators (code);
  
*************** gfc_resolve_forall (gfc_code *code, gfc_
*** 9134,9152 ****
        var_expr = XCNEWVEC (gfc_expr *, total_var);
      }
  
!   /* The information about FORALL iterator, including FORALL index start, end
!      and stride. The FORALL index can not appear in start, end or stride.  */
    for (fa = code->ext.forall_iterator; fa; fa = fa->next)
      {
        /* Check if any outer FORALL index name is the same as the current
  	 one.  */
        for (i = 0; i < nvar; i++)
  	{
  	  if (fa->var->symtree->n.sym == var_expr[i]->symtree->n.sym)
! 	    {
! 	      gfc_error ("An outer FORALL construct already has an index "
! 			 "with this name %L", &fa->var->where);
! 	    }
  	}
  
        /* Record the current FORALL index.  */
--- 9150,9174 ----
        var_expr = XCNEWVEC (gfc_expr *, total_var);
      }
  
!   /* The information about FORALL iterator, including FORALL indices start, end
!      and stride.  An outer FORALL indice cannot appear in start, end or stride.  */
    for (fa = code->ext.forall_iterator; fa; fa = fa->next)
      {
+       /* Fortran 20008: C738 (R753).  */
+       if (fa->var->ref && fa->var->ref->type == REF_ARRAY)
+ 	{
+ 	  gfc_error ("FORALL index-name at %L must be a scalar variable "
+ 		     "of type integer", &fa->var->where);
+ 	  continue;
+ 	}
+ 
        /* Check if any outer FORALL index name is the same as the current
  	 one.  */
        for (i = 0; i < nvar; i++)
  	{
  	  if (fa->var->symtree->n.sym == var_expr[i]->symtree->n.sym)
! 	    gfc_error ("An outer FORALL construct already has an index "
! 			"with this name %L", &fa->var->where);
  	}
  
        /* Record the current FORALL index.  */
*************** resolve_fl_variable_derived (gfc_symbol
*** 11214,11219 ****
--- 11236,11262 ----
  }
  
  
+ /* F2008, C402 (R401):  A colon shall not be used as a type-param-value
+    except in the declaration of an entity or component that has the POINTER
+    or ALLOCATABLE attribute.  */
+ 
+ static bool
+ deferred_requirements (gfc_symbol *sym)
+ {
+   if (sym->ts.deferred
+       && !(sym->attr.pointer
+ 	   || sym->attr.allocatable
+ 	   || sym->attr.omp_udr_artificial_var))
+     {
+       gfc_error ("Entity %qs at %L has a deferred type parameter and "
+ 		 "requires either the POINTER or ALLOCATABLE attribute",
+ 		 sym->name, &sym->declared_at);
+       return false;
+     }
+   return true;
+ }
+ 
+ 
  /* Resolve symbols with flavor variable.  */
  
  static bool
*************** resolve_fl_variable (gfc_symbol *sym, in
*** 11253,11271 ****
      }
  
    /* Constraints on deferred type parameter.  */
!   if (sym->ts.deferred
!       && !(sym->attr.pointer
! 	   || sym->attr.allocatable
! 	   || sym->attr.omp_udr_artificial_var))
!     {
!       gfc_error ("Entity %qs at %L has a deferred type parameter and "
! 		 "requires either the pointer or allocatable attribute",
! 		     sym->name, &sym->declared_at);
!       specification_expr = saved_specification_expr;
!       return false;
!     }
  
!   if (sym->ts.type == BT_CHARACTER)
      {
        /* Make sure that character string variables with assumed length are
  	 dummy arguments.  */
--- 11296,11305 ----
      }
  
    /* Constraints on deferred type parameter.  */
!   if (!deferred_requirements (sym))
!     return false;
  
!   if (sym->ts.type == BT_CHARACTER && !sym->attr.associate_var)
      {
        /* Make sure that character string variables with assumed length are
  	 dummy arguments.  */
*************** resolve_fl_parameter (gfc_symbol *sym)
*** 13214,13219 ****
--- 13248,13257 ----
        return false;
      }
  
+   /* Constraints on deferred type parameter.  */
+   if (!deferred_requirements (sym))
+     return false;
+ 
    /* Make sure a parameter that has been implicitly typed still
       matches the implicit type, since PARAMETER statements can precede
       IMPLICIT statements.  */
diff -Nrcpad gcc-5.4.0/gcc/fortran/simplify.c gcc-5.5.0/gcc/fortran/simplify.c
*** gcc-5.4.0/gcc/fortran/simplify.c	Wed Nov 18 23:30:26 2015
--- gcc-5.5.0/gcc/fortran/simplify.c	Wed Nov 23 16:46:31 2016
*************** simplify_transformation_to_scalar (gfc_e
*** 490,495 ****
--- 490,497 ----
  	}
  
        result = op (result, gfc_copy_expr (a));
+       if (!result)
+ 	return result;
      }
  
    return result;
*************** gfc_simplify_extends_type_of (gfc_expr *
*** 2284,2290 ****
    if (UNLIMITED_POLY (a) || UNLIMITED_POLY (mold))
      return NULL;
  
!   /* Return .false. if the dynamic type can never be the same.  */
    if ((a->ts.type == BT_CLASS && mold->ts.type == BT_CLASS
         && !gfc_type_is_extension_of
  			(mold->ts.u.derived->components->ts.u.derived,
--- 2286,2292 ----
    if (UNLIMITED_POLY (a) || UNLIMITED_POLY (mold))
      return NULL;
  
!   /* Return .false. if the dynamic type can never be an extension.  */
    if ((a->ts.type == BT_CLASS && mold->ts.type == BT_CLASS
         && !gfc_type_is_extension_of
  			(mold->ts.u.derived->components->ts.u.derived,
*************** gfc_simplify_extends_type_of (gfc_expr *
*** 2294,2311 ****
  			 mold->ts.u.derived->components->ts.u.derived))
        || (a->ts.type == BT_DERIVED && mold->ts.type == BT_CLASS
  	  && !gfc_type_is_extension_of
- 			(a->ts.u.derived,
- 			 mold->ts.u.derived->components->ts.u.derived)
- 	  && !gfc_type_is_extension_of
  			(mold->ts.u.derived->components->ts.u.derived,
  			 a->ts.u.derived))
        || (a->ts.type == BT_CLASS && mold->ts.type == BT_DERIVED
  	  && !gfc_type_is_extension_of
  			(mold->ts.u.derived,
! 			 a->ts.u.derived->components->ts.u.derived)))
      return gfc_get_logical_expr (gfc_default_logical_kind, &a->where, false);
  
!   if (mold->ts.type == BT_DERIVED
        && gfc_type_is_extension_of (mold->ts.u.derived,
  				   a->ts.u.derived->components->ts.u.derived))
      return gfc_get_logical_expr (gfc_default_logical_kind, &a->where, true);
--- 2296,2314 ----
  			 mold->ts.u.derived->components->ts.u.derived))
        || (a->ts.type == BT_DERIVED && mold->ts.type == BT_CLASS
  	  && !gfc_type_is_extension_of
  			(mold->ts.u.derived->components->ts.u.derived,
  			 a->ts.u.derived))
        || (a->ts.type == BT_CLASS && mold->ts.type == BT_DERIVED
  	  && !gfc_type_is_extension_of
  			(mold->ts.u.derived,
! 			 a->ts.u.derived->components->ts.u.derived)
! 	  && !gfc_type_is_extension_of
! 			(a->ts.u.derived->components->ts.u.derived,
! 			 mold->ts.u.derived)))
      return gfc_get_logical_expr (gfc_default_logical_kind, &a->where, false);
  
!   /* Return .true. if the dynamic type is guaranteed to be an extension.  */
!   if (a->ts.type == BT_CLASS && mold->ts.type == BT_DERIVED
        && gfc_type_is_extension_of (mold->ts.u.derived,
  				   a->ts.u.derived->components->ts.u.derived))
      return gfc_get_logical_expr (gfc_default_logical_kind, &a->where, true);
*************** gfc_simplify_len (gfc_expr *e, gfc_expr
*** 3713,3720 ****
      }
    else if (e->expr_type == EXPR_VARIABLE && e->ts.type == BT_CHARACTER
  	   && e->symtree->n.sym
  	   && e->symtree->n.sym->assoc && e->symtree->n.sym->assoc->target
! 	   && e->symtree->n.sym->assoc->target->ts.type == BT_DERIVED)
      /* The expression in assoc->target points to a ref to the _data component
         of the unlimited polymorphic entity.  To get the _len component the last
         _data ref needs to be stripped and a ref to the _len component added.  */
--- 3716,3727 ----
      }
    else if (e->expr_type == EXPR_VARIABLE && e->ts.type == BT_CHARACTER
  	   && e->symtree->n.sym
+ 	   && e->symtree->n.sym->ts.type != BT_DERIVED
  	   && e->symtree->n.sym->assoc && e->symtree->n.sym->assoc->target
! 	   && e->symtree->n.sym->assoc->target->ts.type == BT_DERIVED
! 	   && e->symtree->n.sym->assoc->target->symtree->n.sym
! 	   && UNLIMITED_POLY (e->symtree->n.sym->assoc->target->symtree->n.sym))
! 
      /* The expression in assoc->target points to a ref to the _data component
         of the unlimited polymorphic entity.  To get the _len component the last
         _data ref needs to be stripped and a ref to the _len component added.  */
diff -Nrcpad gcc-5.4.0/gcc/fortran/trans-array.c gcc-5.5.0/gcc/fortran/trans-array.c
*** gcc-5.4.0/gcc/fortran/trans-array.c	Mon Apr  4 09:33:54 2016
--- gcc-5.5.0/gcc/fortran/trans-array.c	Mon Aug  8 08:24:22 2016
*************** gfc_trans_dummy_array_bias (gfc_symbol *
*** 5928,5934 ****
--- 5928,5939 ----
        return;
      }
  
+   loc.nextc = NULL;
    gfc_save_backend_locus (&loc);
+   /* loc.nextc is not set by save_backend_locus but the location routines
+      depend on it.  */
+   if (loc.nextc == NULL)
+     loc.nextc = loc.lb->line;
    gfc_set_backend_locus (&sym->declared_at);
  
    /* Descriptor type.  */
diff -Nrcpad gcc-5.4.0/gcc/fortran/trans-common.c gcc-5.5.0/gcc/fortran/trans-common.c
*** gcc-5.4.0/gcc/fortran/trans-common.c	Sun Feb  1 00:29:54 2015
--- gcc-5.5.0/gcc/fortran/trans-common.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 92,99 ****
     is examined for still-unused equivalence conditions.  We create a
     block for each merged equivalence list.  */
  
- #include <map>
  #include "config.h"
  #include "system.h"
  #include "coretypes.h"
  #include "tm.h"
--- 92,99 ----
     is examined for still-unused equivalence conditions.  We create a
     block for each merged equivalence list.  */
  
  #include "config.h"
+ #define INCLUDE_MAP
  #include "system.h"
  #include "coretypes.h"
  #include "tm.h"
*************** element_number (gfc_array_ref *ar)
*** 810,822 ****
        if (ar->dimen_type[i] != DIMEN_ELEMENT)
          gfc_internal_error ("element_number(): Bad dimension type");
  
!       mpz_sub (n, *get_mpz (ar->start[i]), *get_mpz (as->lower[i]));
   
        mpz_mul (n, n, multiplier);
        mpz_add (offset, offset, n);
   
!       mpz_sub (extent, *get_mpz (as->upper[i]), *get_mpz (as->lower[i]));
!       mpz_add_ui (extent, extent, 1);
   
        if (mpz_sgn (extent) < 0)
          mpz_set_ui (extent, 0);
--- 810,830 ----
        if (ar->dimen_type[i] != DIMEN_ELEMENT)
          gfc_internal_error ("element_number(): Bad dimension type");
  
!       if (as && as->lower[i])
! 	mpz_sub (n, *get_mpz (ar->start[i]), *get_mpz (as->lower[i]));
!       else
! 	mpz_sub_ui (n, *get_mpz (ar->start[i]), 1);
   
        mpz_mul (n, n, multiplier);
        mpz_add (offset, offset, n);
   
!       if (as && as->upper[i] && as->lower[i])
! 	{
! 	  mpz_sub (extent, *get_mpz (as->upper[i]), *get_mpz (as->lower[i]));
! 	  mpz_add_ui (extent, extent, 1);
! 	}
!       else
! 	mpz_set_ui (extent, 0);
   
        if (mpz_sgn (extent) < 0)
          mpz_set_ui (extent, 0);
*************** finish_equivalences (gfc_namespace *ns)
*** 1239,1246 ****
  	  {
  	    c = gfc_get_common_head ();
  	    /* We've lost the real location, so use the location of the
! 	       enclosing procedure.  */
! 	    c->where = ns->proc_name->declared_at;
  	    strcpy (c->name, z->module);
  	  }
  	else
--- 1247,1258 ----
  	  {
  	    c = gfc_get_common_head ();
  	    /* We've lost the real location, so use the location of the
! 	       enclosing procedure.  If we're in a BLOCK DATA block, then
! 	       use the location in the sym_root.  */
! 	    if (ns->proc_name)
! 	      c->where = ns->proc_name->declared_at;
! 	    else if (ns->is_block_data)
! 	      c->where = ns->sym_root->n.sym->declared_at;
  	    strcpy (c->name, z->module);
  	  }
  	else
diff -Nrcpad gcc-5.4.0/gcc/fortran/trans-decl.c gcc-5.5.0/gcc/fortran/trans-decl.c
*** gcc-5.4.0/gcc/fortran/trans-decl.c	Mon Mar 28 10:17:43 2016
--- gcc-5.5.0/gcc/fortran/trans-decl.c	Thu Sep 29 19:34:59 2016
*************** gfc_trans_deferred_vars (gfc_symbol * pr
*** 3975,3980 ****
--- 3975,3982 ----
        else if (proc_sym->as)
  	{
  	  tree result = TREE_VALUE (current_fake_result_decl);
+ 	  gfc_save_backend_locus (&loc);
+ 	  gfc_set_backend_locus (&proc_sym->declared_at);
  	  gfc_trans_dummy_array_bias (proc_sym, result, block);
  
  	  /* An automatic character length, pointer array result.  */
*************** gfc_trans_deferred_vars (gfc_symbol * pr
*** 3984,3991 ****
  	      tmp = NULL;
  	      if (proc_sym->ts.deferred)
  		{
- 		  gfc_save_backend_locus (&loc);
- 		  gfc_set_backend_locus (&proc_sym->declared_at);
  		  gfc_start_block (&init);
  		  tmp = gfc_null_and_pass_deferred_len (proc_sym, &init, &loc);
  		  gfc_add_init_cleanup (block, gfc_finish_block (&init), tmp);
--- 3986,3991 ----
*************** generate_local_decl (gfc_symbol * sym)
*** 5191,5199 ****
  	    }
  	  else if (!sym->attr.use_assoc)
  	    {
! 	      gfc_warning (OPT_Wunused_variable,
! 			   "Unused variable %qs declared at %L",
! 			   sym->name, &sym->declared_at);
  	      if (sym->backend_decl != NULL_TREE)
  		TREE_NO_WARNING(sym->backend_decl) = 1;
  	    }
--- 5191,5209 ----
  	    }
  	  else if (!sym->attr.use_assoc)
  	    {
! 	      /* Corner case: the symbol may be an entry point.  At this point,
! 		 it may appear to be an unused variable.  Suppress warning.  */
! 	      bool enter = false;
! 	      gfc_entry_list *el;
! 
! 	      for (el = sym->ns->entries; el; el=el->next)
! 		if (strcmp(sym->name, el->sym->name) == 0)
! 		  enter = true;
! 
! 	      if (!enter)
! 		gfc_warning (OPT_Wunused_variable,
! 			     "Unused variable %qs declared at %L",
! 			     sym->name, &sym->declared_at);
  	      if (sym->backend_decl != NULL_TREE)
  		TREE_NO_WARNING(sym->backend_decl) = 1;
  	    }
*************** gfc_generate_function_code (gfc_namespac
*** 6068,6074 ****
  	 function has already called cgraph_create_node, which also created
  	 the cgraph node for this function.  */
        if (!has_coarray_vars || flag_coarray != GFC_FCOARRAY_LIB)
! 	(void) cgraph_node::create (fndecl);
      }
    else
      cgraph_node::finalize_function (fndecl, true);
--- 6078,6084 ----
  	 function has already called cgraph_create_node, which also created
  	 the cgraph node for this function.  */
        if (!has_coarray_vars || flag_coarray != GFC_FCOARRAY_LIB)
! 	(void) cgraph_node::get_create (fndecl);
      }
    else
      cgraph_node::finalize_function (fndecl, true);
diff -Nrcpad gcc-5.4.0/gcc/fortran/trans-expr.c gcc-5.5.0/gcc/fortran/trans-expr.c
*** gcc-5.4.0/gcc/fortran/trans-expr.c	Thu Jun  2 17:44:59 2016
--- gcc-5.5.0/gcc/fortran/trans-expr.c	Fri Jun  9 19:23:48 2017
*************** gfc_conv_procedure_call (gfc_se * se, gf
*** 5855,5861 ****
       after use. This necessitates the creation of a temporary to
       hold the result to prevent duplicate calls.  */
    if (!byref && sym->ts.type != BT_CHARACTER
!       && sym->attr.allocatable && !sym->attr.dimension)
      {
        tmp = gfc_create_var (TREE_TYPE (se->expr), NULL);
        gfc_add_modify (&se->pre, tmp, se->expr);
--- 5855,5861 ----
       after use. This necessitates the creation of a temporary to
       hold the result to prevent duplicate calls.  */
    if (!byref && sym->ts.type != BT_CHARACTER
!       && sym->attr.allocatable && !sym->attr.dimension && !comp)
      {
        tmp = gfc_create_var (TREE_TYPE (se->expr), NULL);
        gfc_add_modify (&se->pre, tmp, se->expr);
*************** gfc_trans_subcomponent_assign (tree dest
*** 7012,7017 ****
--- 7012,7023 ----
        tmp = gfc_trans_alloc_subarray_assign (tmp, cm, expr);
        gfc_add_expr_to_block (&block, tmp);
      }
+   else if (init && cm->attr.allocatable && expr->expr_type == EXPR_NULL)
+     {
+       /* NULL initialization for allocatable components.  */
+       gfc_add_modify (&block, dest, fold_convert (TREE_TYPE (dest),
+ 						  null_pointer_node));
+     }
    else if (init && (cm->attr.allocatable
  	   || (cm->ts.type == BT_CLASS && CLASS_DATA (cm)->attr.allocatable
  	       && expr->ts.type != BT_CLASS)))
*************** gfc_trans_structure_assign (tree dest, g
*** 7158,7164 ****
      {
        gfc_se se, lse;
  
-       gcc_assert (cm->backend_decl == NULL);
        gfc_init_se (&se, NULL);
        gfc_init_se (&lse, NULL);
        gfc_conv_expr (&se, gfc_constructor_first (expr->value.constructor)->expr);
--- 7164,7169 ----
diff -Nrcpad gcc-5.4.0/gcc/fortran/trans-openmp.c gcc-5.5.0/gcc/fortran/trans-openmp.c
*** gcc-5.4.0/gcc/fortran/trans-openmp.c	Wed Feb 10 18:29:49 2016
--- gcc-5.5.0/gcc/fortran/trans-openmp.c	Tue May 30 07:52:55 2017
*************** along with GCC; see the file COPYING3.
*** 47,52 ****
--- 47,57 ----
  #include "arith.h"
  #include "omp-low.h"
  #include "gomp-constants.h"
+ #undef GCC_DIAG_STYLE
+ #define GCC_DIAG_STYLE __gcc_tdiag__
+ #include "diagnostic-core.h"
+ #undef GCC_DIAG_STYLE
+ #define GCC_DIAG_STYLE __gcc_gfc__
  
  int ompws_flags;
  
*************** gfc_omp_privatize_by_reference (const_tr
*** 71,76 ****
--- 76,82 ----
        if (GFC_DECL_GET_SCALAR_POINTER (decl)
  	  || GFC_DECL_GET_SCALAR_ALLOCATABLE (decl)
  	  || GFC_DECL_CRAY_POINTEE (decl)
+ 	  || GFC_DECL_ASSOCIATE_VAR_P (decl)
  	  || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (decl))))
  	return false;
  
*************** gfc_omp_private_outer_ref (tree decl)
*** 216,221 ****
--- 222,230 ----
  {
    tree type = TREE_TYPE (decl);
  
+   if (gfc_omp_privatize_by_reference (decl))
+     type = TREE_TYPE (type);
+ 
    if (GFC_DESCRIPTOR_TYPE_P (type)
        && GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ALLOCATABLE)
      return true;
*************** gfc_omp_private_outer_ref (tree decl)
*** 223,231 ****
    if (GFC_DECL_GET_SCALAR_ALLOCATABLE (decl))
      return true;
  
-   if (gfc_omp_privatize_by_reference (decl))
-     type = TREE_TYPE (type);
- 
    if (gfc_has_alloc_comps (type, decl))
      return true;
  
--- 232,237 ----
*************** gfc_omp_finish_clause (tree c, gimple_se
*** 1037,1042 ****
--- 1043,1063 ----
      return;
  
    tree decl = OMP_CLAUSE_DECL (c);
+ 
+   /* Assumed-size arrays can't be mapped implicitly, they have to be
+      mapped explicitly using array sections.  */
+   if (TREE_CODE (decl) == PARM_DECL
+       && GFC_ARRAY_TYPE_P (TREE_TYPE (decl))
+       && GFC_TYPE_ARRAY_AKIND (TREE_TYPE (decl)) == GFC_ARRAY_UNKNOWN
+       && GFC_TYPE_ARRAY_UBOUND (TREE_TYPE (decl),
+ 				GFC_TYPE_ARRAY_RANK (TREE_TYPE (decl)) - 1)
+ 	 == NULL)
+     {
+       error_at (OMP_CLAUSE_LOCATION (c),
+ 		"implicit mapping of assumed size array %qD", decl);
+       return;
+     }
+ 
    tree c2 = NULL_TREE, c3 = NULL_TREE, c4 = NULL_TREE;
    if (POINTER_TYPE_P (TREE_TYPE (decl)))
      {
*************** gfc_trans_omp_clauses (stmtblock_t *bloc
*** 2180,2185 ****
--- 2201,2208 ----
  		  tree decl = gfc_get_symbol_decl (n->sym);
  		  if (gfc_omp_privatize_by_reference (decl))
  		    decl = build_fold_indirect_ref (decl);
+ 		  else if (DECL_P (decl))
+ 		    TREE_ADDRESSABLE (decl) = 1;
  		  if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl)))
  		    {
  		      tree type = TREE_TYPE (decl);
*************** gfc_trans_omp_atomic (gfc_code *code)
*** 2789,2795 ****
    gfc_start_block (&block);
  
    expr2 = code->expr2;
!   if (expr2->expr_type == EXPR_FUNCTION
        && expr2->value.function.isym->id == GFC_ISYM_CONVERSION)
      expr2 = expr2->value.function.actual->expr;
  
--- 2812,2822 ----
    gfc_start_block (&block);
  
    expr2 = code->expr2;
!   if (((atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_MASK)
!        != GFC_OMP_ATOMIC_WRITE)
!       && (atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_SWAP) == 0
!       && expr2->expr_type == EXPR_FUNCTION
!       && expr2->value.function.isym
        && expr2->value.function.isym->id == GFC_ISYM_CONVERSION)
      expr2 = expr2->value.function.actual->expr;
  
*************** gfc_trans_omp_atomic (gfc_code *code)
*** 2828,2833 ****
--- 2855,2861 ----
  	  var = code->expr1->symtree->n.sym;
  	  expr2 = code->expr2;
  	  if (expr2->expr_type == EXPR_FUNCTION
+ 	      && expr2->value.function.isym
  	      && expr2->value.function.isym->id == GFC_ISYM_CONVERSION)
  	    expr2 = expr2->value.function.actual->expr;
  	}
*************** gfc_trans_omp_atomic (gfc_code *code)
*** 2885,2890 ****
--- 2913,2919 ----
  	}
        e = expr2->value.op.op1;
        if (e->expr_type == EXPR_FUNCTION
+ 	  && e->value.function.isym
  	  && e->value.function.isym->id == GFC_ISYM_CONVERSION)
  	e = e->value.function.actual->expr;
        if (e->expr_type == EXPR_VARIABLE
*************** gfc_trans_omp_atomic (gfc_code *code)
*** 2898,2903 ****
--- 2927,2933 ----
  	{
  	  e = expr2->value.op.op2;
  	  if (e->expr_type == EXPR_FUNCTION
+ 	      && e->value.function.isym
  	      && e->value.function.isym->id == GFC_ISYM_CONVERSION)
  	    e = e->value.function.actual->expr;
  	  gcc_assert (e->expr_type == EXPR_VARIABLE
*************** gfc_trans_omp_atomic (gfc_code *code)
*** 3012,3017 ****
--- 3042,3048 ----
  	  code = code->next;
  	  expr2 = code->expr2;
  	  if (expr2->expr_type == EXPR_FUNCTION
+ 	      && expr2->value.function.isym
  	      && expr2->value.function.isym->id == GFC_ISYM_CONVERSION)
  	    expr2 = expr2->value.function.actual->expr;
  
diff -Nrcpad gcc-5.4.0/gcc/fortran/trans-stmt.c gcc-5.5.0/gcc/fortran/trans-stmt.c
*** gcc-5.4.0/gcc/fortran/trans-stmt.c	Mon Apr  4 09:47:47 2016
--- gcc-5.5.0/gcc/fortran/trans-stmt.c	Thu Aug 11 07:57:58 2016
*************** gfc_trans_allocate (gfc_code * code)
*** 5303,5309 ****
    stmtblock_t block;
    stmtblock_t post;
    tree nelems;
!   bool upoly_expr, tmp_expr3_len_flag = false, al_len_needs_set;
    gfc_symtree *newsym = NULL;
  
    if (!code->ext.alloc.list)
--- 5303,5310 ----
    stmtblock_t block;
    stmtblock_t post;
    tree nelems;
!   bool upoly_expr, tmp_expr3_len_flag = false, al_len_needs_set,
!       do_assign = true;
    gfc_symtree *newsym = NULL;
  
    if (!code->ext.alloc.list)
*************** gfc_trans_allocate (gfc_code * code)
*** 5393,5398 ****
--- 5394,5407 ----
  		  expr3_len = se.string_length;
  		  gfc_add_block_to_block (&block, &se.pre);
  		  gfc_add_block_to_block (&post, &se.post);
+ 		  /* Special case when string in expr3 is zero.  */
+ 		  if (code->expr3->ts.type == BT_CHARACTER
+ 		      && integer_zerop (se.string_length))
+ 		    {
+ 		      expr3 = expr3_tmp = NULL_TREE;
+ 		      expr3_len = integer_zero_node;
+ 		      do_assign = false;
+ 		    }
  		}
  	      /* else expr3 = NULL_TREE set above.  */
  	    }
*************** gfc_trans_allocate (gfc_code * code)
*** 5415,5421 ****
  	      gfc_add_block_to_block (&block, &se.pre);
  	      gfc_add_block_to_block (&post, &se.post);
  
! 	      if (!VAR_P (se.expr))
  		{
  		  tree var;
  
--- 5424,5439 ----
  	      gfc_add_block_to_block (&block, &se.pre);
  	      gfc_add_block_to_block (&post, &se.post);
  
! 	      /* Special case when string in expr3 is zero.  */
! 	      if (code->expr3->ts.type == BT_CHARACTER
! 		  && integer_zerop (se.string_length))
! 		{
! 		  gfc_init_se (&se, NULL);
! 		  expr3_len = integer_zero_node;
! 		  tmp = NULL_TREE;
! 		  do_assign = false;
! 		}
! 	      else if (!VAR_P (se.expr))
  		{
  		  tree var;
  
*************** gfc_trans_allocate (gfc_code * code)
*** 5651,5659 ****
--- 5669,5679 ----
  	  tmp = gfc_get_char_type (code->ext.alloc.ts.kind);
  	  tmp = TYPE_SIZE_UNIT (tmp);
  	  tmp = fold_convert (TREE_TYPE (se_sz.expr), tmp);
+ 	  gfc_add_block_to_block (&block, &se_sz.pre);
  	  expr3_esize = fold_build2_loc (input_location, MULT_EXPR,
  					 TREE_TYPE (se_sz.expr),
  					 tmp, se_sz.expr);
+ 	  expr3_esize = gfc_evaluate_now (expr3_esize, &block);
  	}
      }
  
*************** gfc_trans_allocate (gfc_code * code)
*** 5848,5853 ****
--- 5868,5874 ----
  		 source= or mold= expression.  */
  	      gfc_init_se (&se_sz, NULL);
  	      gfc_conv_expr (&se_sz, code->ext.alloc.ts.u.cl->length);
+ 	      gfc_add_block_to_block (&block, &se_sz.pre);
  	      gfc_add_modify (&block, al_len,
  			      fold_convert (TREE_TYPE (al_len),
  					    se_sz.expr));
*************** gfc_trans_allocate (gfc_code * code)
*** 5932,5942 ****
  		 specified by a type spec for deferred length character
  		 arrays or unlimited polymorphic objects without a
  		 source= or mold= expression.  */
! 	      gfc_init_se (&se_sz, NULL);
! 	      gfc_conv_expr (&se_sz, code->ext.alloc.ts.u.cl->length);
! 	      gfc_add_modify (&block, al_len,
! 			      fold_convert (TREE_TYPE (al_len),
! 					    se_sz.expr));
  	    }
  	  else
  	    /* No length information needed, because type to allocate
--- 5953,5971 ----
  		 specified by a type spec for deferred length character
  		 arrays or unlimited polymorphic objects without a
  		 source= or mold= expression.  */
! 	      if (expr3_esize == NULL_TREE || code->ext.alloc.ts.kind != 1)
! 		{
! 		  gfc_init_se (&se_sz, NULL);
! 		  gfc_conv_expr (&se_sz, code->ext.alloc.ts.u.cl->length);
! 		  gfc_add_block_to_block (&block, &se_sz.pre);
! 		  gfc_add_modify (&block, al_len,
! 				  fold_convert (TREE_TYPE (al_len),
! 						se_sz.expr));
! 		}
! 	      else
! 		gfc_add_modify (&block, al_len,
! 				fold_convert (TREE_TYPE (al_len),
! 					      expr3_esize));
  	    }
  	  else
  	    /* No length information needed, because type to allocate
*************** gfc_trans_allocate (gfc_code * code)
*** 5945,5951 ****
  			    fold_convert (TREE_TYPE (al_len),
  					  integer_zero_node));
  	}
!       if (code->expr3 && !code->expr3->mold)
  	{
  	  /* Initialization via SOURCE block
  	     (or static default initializer).  */
--- 5974,5980 ----
  			    fold_convert (TREE_TYPE (al_len),
  					  integer_zero_node));
  	}
!       if (code->expr3 && !code->expr3->mold && do_assign)
  	{
  	  /* Initialization via SOURCE block
  	     (or static default initializer).  */
diff -Nrcpad gcc-5.4.0/gcc/fortran/trans-types.c gcc-5.5.0/gcc/fortran/trans-types.c
*** gcc-5.4.0/gcc/fortran/trans-types.c	Wed Mar  9 20:49:58 2016
--- gcc-5.5.0/gcc/fortran/trans-types.c	Mon May  1 10:51:22 2017
*************** gfc_get_int_kind_from_width_isofortranen
*** 256,282 ****
    return -1;
  }
  
! /* Get the kind number corresponding to a real of given storage size,
!    following the required return values for ISO_FORTRAN_ENV REAL* constants:
!    -2 is returned if we support a kind of larger size, -1 otherwise.  */
  int
  gfc_get_real_kind_from_width_isofortranenv (int size)
  {
!   int i;
  
    size /= 8;
  
    /* Look for a kind with matching storage size.  */
    for (i = 0; gfc_real_kinds[i].kind != 0; i++)
      if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) == size)
!       return gfc_real_kinds[i].kind;
  
    /* Look for a kind with larger storage size.  */
    for (i = 0; gfc_real_kinds[i].kind != 0; i++)
      if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) > size)
!       return -2;
  
!   return -1;
  }
  
  
--- 256,297 ----
    return -1;
  }
  
! 
! /* Get the kind number corresponding to a real of a given storage size.
!    If two real's have the same storage size, then choose the real with
!    the largest precision.  If a kind type is unavailable and a real
!    exists with wider storage, then return -2; otherwise, return -1.  */
! 
  int
  gfc_get_real_kind_from_width_isofortranenv (int size)
  {
!   int digits, i, kind;
  
    size /= 8;
  
+   kind = -1;
+   digits = 0;
+ 
    /* Look for a kind with matching storage size.  */
    for (i = 0; gfc_real_kinds[i].kind != 0; i++)
      if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) == size)
!       {
! 	if (gfc_real_kinds[i].digits > digits)
! 	  {
! 	    digits = gfc_real_kinds[i].digits;
! 	    kind = gfc_real_kinds[i].kind;
! 	  }
!       }
! 
!   if (kind != -1)
!     return kind;
  
    /* Look for a kind with larger storage size.  */
    for (i = 0; gfc_real_kinds[i].kind != 0; i++)
      if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) > size)
!       kind = -2;
  
!   return kind;
  }
  
  
*************** gfc_get_derived_type (gfc_symbol * deriv
*** 2539,2547 ****
  	 the same as derived, by forcing the procedure pointer component to
  	 be built as if the explicit interface does not exist.  */
        if (c->attr.proc_pointer
! 	  && ((c->ts.type != BT_DERIVED && c->ts.type != BT_CLASS)
! 	       || (c->ts.u.derived
! 		   && !gfc_compare_derived_types (derived, c->ts.u.derived))))
  	field_type = gfc_get_ppc_type (c);
        else if (c->attr.proc_pointer && derived->backend_decl)
  	{
--- 2554,2563 ----
  	 the same as derived, by forcing the procedure pointer component to
  	 be built as if the explicit interface does not exist.  */
        if (c->attr.proc_pointer
! 	  && (c->ts.type != BT_DERIVED || (c->ts.u.derived
! 		    && !gfc_compare_derived_types (derived, c->ts.u.derived)))
! 	  && (c->ts.type != BT_CLASS || (CLASS_DATA (c)->ts.u.derived
! 		    && !gfc_compare_derived_types (derived, CLASS_DATA (c)->ts.u.derived))))
  	field_type = gfc_get_ppc_type (c);
        else if (c->attr.proc_pointer && derived->backend_decl)
  	{
diff -Nrcpad gcc-5.4.0/gcc/fortran/trans.c gcc-5.5.0/gcc/fortran/trans.c
*** gcc-5.4.0/gcc/fortran/trans.c	Wed Mar  9 20:49:58 2016
--- gcc-5.5.0/gcc/fortran/trans.c	Wed May 10 10:01:23 2017
*************** gfc_add_modify_loc (location_t loc, stmt
*** 163,173 ****
    tree t1, t2;
    t1 = TREE_TYPE (rhs);
    t2 = TREE_TYPE (lhs);
!   /* Make sure that the types of the rhs and the lhs are the same
       for scalar assignments.  We should probably have something
       similar for aggregates, but right now removing that check just
       breaks everything.  */
!   gcc_assert (t1 == t2
  	      || AGGREGATE_TYPE_P (TREE_TYPE (lhs)));
  #endif
  
--- 163,173 ----
    tree t1, t2;
    t1 = TREE_TYPE (rhs);
    t2 = TREE_TYPE (lhs);
!   /* Make sure that the types of the rhs and the lhs are compatible
       for scalar assignments.  We should probably have something
       similar for aggregates, but right now removing that check just
       breaks everything.  */
!   gcc_assert (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2)
  	      || AGGREGATE_TYPE_P (TREE_TYPE (lhs)));
  #endif
  
diff -Nrcpad gcc-5.4.0/gcc/function.c gcc-5.5.0/gcc/function.c
*** gcc-5.4.0/gcc/function.c	Thu Jul 23 10:44:19 2015
--- gcc-5.5.0/gcc/function.c	Sat Sep 16 18:35:03 2017
*************** invoke_set_current_function_hook (tree f
*** 4688,4696 ****
  /* cfun should never be set directly; use this function.  */
  
  void
! set_cfun (struct function *new_cfun)
  {
!   if (cfun != new_cfun)
      {
        cfun = new_cfun;
        invoke_set_current_function_hook (new_cfun ? new_cfun->decl : NULL_TREE);
--- 4688,4696 ----
  /* cfun should never be set directly; use this function.  */
  
  void
! set_cfun (struct function *new_cfun, bool force)
  {
!   if (cfun != new_cfun || force)
      {
        cfun = new_cfun;
        invoke_set_current_function_hook (new_cfun ? new_cfun->decl : NULL_TREE);
*************** thread_prologue_and_epilogue_insns (void
*** 5961,5973 ****
--- 5961,5979 ----
    try_shrink_wrapping (&entry_edge, orig_entry_edge, &bb_flags, prologue_seq);
  #endif
  
+   rtx_insn *split_prologue_insn = split_prologue_seq;
    if (split_prologue_seq != NULL_RTX)
      {
+       while (split_prologue_insn && !NONDEBUG_INSN_P (split_prologue_insn))
+ 	split_prologue_insn = NEXT_INSN (split_prologue_insn);
        insert_insn_on_edge (split_prologue_seq, orig_entry_edge);
        inserted = true;
      }
+   rtx_insn *prologue_insn = prologue_seq;
    if (prologue_seq != NULL_RTX)
      {
+       while (prologue_insn && !NONDEBUG_INSN_P (prologue_insn))
+ 	prologue_insn = NEXT_INSN (prologue_insn);
        insert_insn_on_edge (prologue_seq, entry_edge);
        inserted = true;
      }
*************** epilogue_done:
*** 6115,6122 ****
--- 6121,6139 ----
        commit_edge_insertions ();
  
        /* Look for basic blocks within the prologue insns.  */
+       if (split_prologue_insn
+ 	  && BLOCK_FOR_INSN (split_prologue_insn) == NULL)
+ 	split_prologue_insn = NULL;
+       if (prologue_insn
+ 	  && BLOCK_FOR_INSN (prologue_insn) == NULL)
+ 	prologue_insn = NULL;
        blocks = sbitmap_alloc (last_basic_block_for_fn (cfun));
        bitmap_clear (blocks);
+       if (split_prologue_insn)
+ 	bitmap_set_bit (blocks,
+ 			BLOCK_FOR_INSN (split_prologue_insn)->index);
+       if (prologue_insn)
+ 	bitmap_set_bit (blocks, BLOCK_FOR_INSN (prologue_insn)->index);
        bitmap_set_bit (blocks, entry_edge->dest->index);
        bitmap_set_bit (blocks, orig_entry_edge->dest->index);
        find_many_sub_basic_blocks (blocks);
diff -Nrcpad gcc-5.4.0/gcc/function.h gcc-5.5.0/gcc/function.h
*** gcc-5.4.0/gcc/function.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/function.h	Fri Jan 20 12:09:22 2017
*************** extern tree block_chainon (tree, tree);
*** 891,897 ****
  extern void number_blocks (tree);
  
  /* cfun shouldn't be set directly; use one of these functions instead.  */
! extern void set_cfun (struct function *new_cfun);
  extern void push_cfun (struct function *new_cfun);
  extern void pop_cfun (void);
  
--- 891,897 ----
  extern void number_blocks (tree);
  
  /* cfun shouldn't be set directly; use one of these functions instead.  */
! extern void set_cfun (struct function *new_cfun, bool force = false);
  extern void push_cfun (struct function *new_cfun);
  extern void pop_cfun (void);
  
diff -Nrcpad gcc-5.4.0/gcc/fwprop.c gcc-5.5.0/gcc/fwprop.c
*** gcc-5.4.0/gcc/fwprop.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/fwprop.c	Thu Jul  7 12:34:07 2016
*************** try_fwprop_subst (df_ref use, rtx *loc,
*** 1013,1022 ****
  	 making a new one if one does not already exist.  */
        if (set_reg_equal)
  	{
! 	  if (dump_file)
! 	    fprintf (dump_file, " Setting REG_EQUAL note\n");
  
! 	  note = set_unique_reg_note (insn, REG_EQUAL, copy_rtx (new_rtx));
  	}
      }
  
--- 1013,1039 ----
  	 making a new one if one does not already exist.  */
        if (set_reg_equal)
  	{
! 	  /* If there are any paradoxical SUBREGs, don't add REG_EQUAL note,
! 	     because the bits in there can be anything and so might not
! 	     match the REG_EQUAL note content.  See PR70574.  */
! 	  subrtx_var_iterator::array_type array;
! 	  FOR_EACH_SUBRTX_VAR (iter, array, *loc, NONCONST)
! 	    {
! 	      rtx x = *iter;
! 	      if (SUBREG_P (x) && paradoxical_subreg_p (x))
! 		{
! 		  set_reg_equal = false;
! 		  break;
! 		}
! 	    }
  
! 	  if (set_reg_equal)
! 	    {
! 	      if (dump_file)
! 		fprintf (dump_file, " Setting REG_EQUAL note\n");
! 
! 	      note = set_unique_reg_note (insn, REG_EQUAL, copy_rtx (new_rtx));
! 	    }
  	}
      }
  
*************** forward_propagate_and_simplify (df_ref u
*** 1314,1327 ****
  	 that isn't mentioned in USE_SET, as the note would be invalid
  	 otherwise.  We also don't want to install a note if we are merely
  	 propagating a pseudo since verifying that this pseudo isn't dead
! 	 is a pain; moreover such a note won't help anything.  */
        set_reg_equal = (note == NULL_RTX
  		       && REG_P (SET_DEST (use_set))
  		       && !REG_P (src)
  		       && !(GET_CODE (src) == SUBREG
  			    && REG_P (SUBREG_REG (src)))
  		       && !reg_mentioned_p (SET_DEST (use_set),
! 					    SET_SRC (use_set)));
      }
  
    if (GET_MODE (*loc) == VOIDmode)
--- 1331,1349 ----
  	 that isn't mentioned in USE_SET, as the note would be invalid
  	 otherwise.  We also don't want to install a note if we are merely
  	 propagating a pseudo since verifying that this pseudo isn't dead
! 	 is a pain; moreover such a note won't help anything.
! 	 If the use is a paradoxical subreg, make sure we don't add a
! 	 REG_EQUAL note for it, because it is not equivalent, it is one
! 	 possible value for it, but we can't rely on it holding that value.
! 	 See PR70574.  */
        set_reg_equal = (note == NULL_RTX
  		       && REG_P (SET_DEST (use_set))
  		       && !REG_P (src)
  		       && !(GET_CODE (src) == SUBREG
  			    && REG_P (SUBREG_REG (src)))
  		       && !reg_mentioned_p (SET_DEST (use_set),
! 					    SET_SRC (use_set))
! 		       && !paradoxical_subreg_p (DF_REF_REG (use)));
      }
  
    if (GET_MODE (*loc) == VOIDmode)
diff -Nrcpad gcc-5.4.0/gcc/gcc.c gcc-5.5.0/gcc/gcc.c
*** gcc-5.4.0/gcc/gcc.c	Tue Mar 10 09:37:41 2015
--- gcc-5.5.0/gcc/gcc.c	Thu Jun 22 11:29:02 2017
*************** static int have_c = 0;
*** 1725,1730 ****
--- 1725,1733 ----
  /* Was the option -o passed.  */
  static int have_o = 0;
  
+ /* Was the option -E passed.  */
+ static int have_E = 0;
+ 
  /* Pointer to output file name passed in with -o. */
  static const char *output_file = 0;
  
*************** driver_handle_option (struct gcc_options
*** 3822,3827 ****
--- 3825,3834 ----
        validated = true;
        break;
  
+     case OPT_E:
+       have_E = true;
+       break;
+ 
      case OPT_x:
        spec_lang = arg;
        if (!strcmp (spec_lang, "none"))
*************** process_command (unsigned int decoded_op
*** 4196,4201 ****
--- 4203,4211 ----
  		       output_file);
      }
  
+   if (output_file != NULL && output_file[0] == '\0')
+     fatal_error (input_location, "output filename may not be empty");
+ 
    /* If -save-temps=obj and -o name, create the prefix to use for %b.
       Otherwise just make -save-temps=obj the same as -save-temps=cwd.  */
    if (save_temps_flag == SAVE_TEMPS_OBJ && save_temps_prefix != NULL)
*************** do_spec_1 (const char *spec, int inswitc
*** 5148,5155 ****
  			if (files_differ)
  #endif
  			  {
! 			    temp_filename = save_string (temp_filename,
! 							 temp_filename_length + 1);
  			    obstack_grow (&obstack, temp_filename,
  						    temp_filename_length);
  			    arg_going = 1;
--- 5158,5166 ----
  			if (files_differ)
  #endif
  			  {
! 			    temp_filename
! 			      = save_string (temp_filename,
! 					     temp_filename_length - 1);
  			    obstack_grow (&obstack, temp_filename,
  						    temp_filename_length);
  			    arg_going = 1;
*************** lookup_compiler (const char *name, size_
*** 7910,7916 ****
      {
        for (cp = compilers + n_compilers - 1; cp >= compilers; cp--)
  	if (cp->suffix[0] == '@' && !strcmp (cp->suffix + 1, language))
! 	  return cp;
  
        error ("language %s not recognized", language);
        return 0;
--- 7921,7937 ----
      {
        for (cp = compilers + n_compilers - 1; cp >= compilers; cp--)
  	if (cp->suffix[0] == '@' && !strcmp (cp->suffix + 1, language))
! 	  {
! 	    if (name != NULL && strcmp (name, "-") == 0
! 		&& (strcmp (cp->suffix, "@c-header") == 0
! 		    || strcmp (cp->suffix, "@c++-header") == 0)
! 		&& !have_E)
! 	      fatal_error (input_location,
! 			   "cannot use %<-%> as input filename for a "
! 			   "precompiled header");
! 
! 	    return cp;
! 	  }
  
        error ("language %s not recognized", language);
        return 0;
diff -Nrcpad gcc-5.4.0/gcc/gcov-dump.c gcc-5.5.0/gcc/gcov-dump.c
*** gcc-5.4.0/gcc/gcov-dump.c	Mon Jan  5 12:05:46 2015
--- gcc-5.5.0/gcc/gcov-dump.c	Thu Jun 22 11:27:50 2017
*************** print_usage (void)
*** 132,141 ****
    printf ("Usage: gcov-dump [OPTION] ... gcovfiles\n");
    printf ("Print coverage file contents\n");
    printf ("  -h, --help           Print this help\n");
-   printf ("  -v, --version        Print version number\n");
    printf ("  -l, --long           Dump record contents too\n");
    printf ("  -p, --positions      Dump record positions\n");
    printf ("  -w, --working-sets   Dump working set computed from summary\n");
  }
  
  static void
--- 132,143 ----
    printf ("Usage: gcov-dump [OPTION] ... gcovfiles\n");
    printf ("Print coverage file contents\n");
    printf ("  -h, --help           Print this help\n");
    printf ("  -l, --long           Dump record contents too\n");
    printf ("  -p, --positions      Dump record positions\n");
+   printf ("  -v, --version        Print version number\n");
    printf ("  -w, --working-sets   Dump working set computed from summary\n");
+   printf ("\nFor bug reporting instructions, please see:\n%s.\n",
+ 	   bug_report_url);
  }
  
  static void
diff -Nrcpad gcc-5.4.0/gcc/gcov-io.c gcc-5.5.0/gcc/gcov-io.c
*** gcc-5.4.0/gcc/gcov-io.c	Wed Feb  4 23:26:40 2015
--- gcc-5.5.0/gcc/gcov-io.c	Mon May 29 09:12:02 2017
*************** gcov_write_string (const char *string)
*** 372,379 ****
    buffer = gcov_write_words (1 + alloc);
  
    buffer[0] = alloc;
!   buffer[alloc] = 0;
!   memcpy (&buffer[1], string, length);
  }
  #endif
  
--- 372,383 ----
    buffer = gcov_write_words (1 + alloc);
  
    buffer[0] = alloc;
! 
!   if (alloc > 0)
!     {
!       buffer[alloc] = 0; /* place nul terminators.  */
!       memcpy (&buffer[1], string, length);
!     }
  }
  #endif
  
diff -Nrcpad gcc-5.4.0/gcc/gcov-tool.c gcc-5.5.0/gcc/gcov-tool.c
*** gcc-5.4.0/gcc/gcov-tool.c	Tue Feb 10 14:14:58 2015
--- gcc-5.5.0/gcc/gcov-tool.c	Thu Jun 22 11:27:50 2017
*************** extern int gcov_profile_normalize (struc
*** 46,51 ****
--- 46,52 ----
  extern int gcov_profile_scale (struct gcov_info*, float, int, int);
  extern struct gcov_info* gcov_read_profile_dir (const char*, int);
  extern void gcov_do_dump (struct gcov_info *, int);
+ extern const char *gcov_get_filename (struct gcov_info *list);
  extern void gcov_set_verbose (void);
  
  /* Set to verbose output mode.  */
*************** gcov_output_files (const char *out, stru
*** 114,119 ****
--- 115,128 ----
    if (ret)
      fatal_error (input_location, "Cannot change directory to %s", out);
  
+   /* Verify that output file does not exist (either was removed by
+      unlink_profile_data or removed by user).  */
+   const char *filename = gcov_get_filename (profile);
+ 
+   if (access (filename, F_OK) != -1)
+     fatal_error (input_location, "output file %s already exists in folder %s",
+ 		 filename, out);
+ 
    gcov_do_dump (profile, 0);
  
    ret = chdir (pwd);
*************** print_merge_usage_message (int error_p)
*** 164,171 ****
    FILE *file = error_p ? stderr : stdout;
  
    fnotice (file, "  merge [options] <dir1> <dir2>         Merge coverage file contents\n");
-   fnotice (file, "    -v, --verbose                       Verbose mode\n");
    fnotice (file, "    -o, --output <dir>                  Output directory\n");
    fnotice (file, "    -w, --weight <w1,w2>                Set weights (float point values)\n");
  }
  
--- 173,180 ----
    FILE *file = error_p ? stderr : stdout;
  
    fnotice (file, "  merge [options] <dir1> <dir2>         Merge coverage file contents\n");
    fnotice (file, "    -o, --output <dir>                  Output directory\n");
+   fnotice (file, "    -v, --verbose                       Verbose mode\n");
    fnotice (file, "    -w, --weight <w1,w2>                Set weights (float point values)\n");
  }
  
*************** print_rewrite_usage_message (int error_p
*** 261,270 ****
    FILE *file = error_p ? stderr : stdout;
  
    fnotice (file, "  rewrite [options] <dir>               Rewrite coverage file contents\n");
!   fnotice (file, "    -v, --verbose                       Verbose mode\n");
    fnotice (file, "    -o, --output <dir>                  Output directory\n");
    fnotice (file, "    -s, --scale <float or simple-frac>  Scale the profile counters\n");
    fnotice (file, "    -n, --normalize <long long>         Normalize the profile\n");
  }
  
  static const struct option rewrite_options[] =
--- 270,280 ----
    FILE *file = error_p ? stderr : stdout;
  
    fnotice (file, "  rewrite [options] <dir>               Rewrite coverage file contents\n");
!   fnotice (file, "    -n, --normalize <int64_t>           Normalize the profile\n");
    fnotice (file, "    -o, --output <dir>                  Output directory\n");
    fnotice (file, "    -s, --scale <float or simple-frac>  Scale the profile counters\n");
    fnotice (file, "    -n, --normalize <long long>         Normalize the profile\n");
+   fnotice (file, "    -v, --verbose                       Verbose mode\n");
  }
  
  static const struct option rewrite_options[] =
*************** print_overlap_usage_message (int error_p
*** 417,428 ****
    FILE *file = error_p ? stderr : stdout;
  
    fnotice (file, "  overlap [options] <dir1> <dir2>       Compute the overlap of two profiles\n");
-   fnotice (file, "    -v, --verbose                       Verbose mode\n");
-   fnotice (file, "    -h, --hotonly                       Only print info for hot objects/functions\n");
    fnotice (file, "    -f, --function                      Print function level info\n");
    fnotice (file, "    -F, --fullname                      Print full filename\n");
    fnotice (file, "    -o, --object                        Print object level info\n");
    fnotice (file, "    -t <float>, --hot_threshold <float> Set the threshold for hotness\n");
  
  }
  
--- 427,438 ----
    FILE *file = error_p ? stderr : stdout;
  
    fnotice (file, "  overlap [options] <dir1> <dir2>       Compute the overlap of two profiles\n");
    fnotice (file, "    -f, --function                      Print function level info\n");
    fnotice (file, "    -F, --fullname                      Print full filename\n");
+   fnotice (file, "    -h, --hotonly                       Only print info for hot objects/functions\n");
    fnotice (file, "    -o, --object                        Print object level info\n");
    fnotice (file, "    -t <float>, --hot_threshold <float> Set the threshold for hotness\n");
+   fnotice (file, "    -v, --verbose                       Verbose mode\n");
  
  }
  
diff -Nrcpad gcc-5.4.0/gcc/gcov.c gcc-5.5.0/gcc/gcov.c
*** gcc-5.4.0/gcc/gcov.c	Sat Apr 11 12:08:26 2015
--- gcc-5.5.0/gcc/gcov.c	Thu Jun 22 11:27:50 2017
*************** print_usage (int error_p)
*** 469,483 ****
    FILE *file = error_p ? stderr : stdout;
    int status = error_p ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE;
  
!   fnotice (file, "Usage: gcov [OPTION]... SOURCE|OBJ...\n\n");
    fnotice (file, "Print code coverage information.\n\n");
-   fnotice (file, "  -h, --help                      Print this help, then exit\n");
    fnotice (file, "  -a, --all-blocks                Show information for every basic block\n");
    fnotice (file, "  -b, --branch-probabilities      Include branch probabilities in output\n");
    fnotice (file, "  -c, --branch-counts             Output counts of branches taken\n\
                                      rather than percentages\n");
    fnotice (file, "  -d, --display-progress          Display progress information\n");
    fnotice (file, "  -f, --function-summaries        Output summaries for each function\n");
    fnotice (file, "  -i, --intermediate-format       Output .gcov file in intermediate text format\n");
    fnotice (file, "  -l, --long-file-names           Use long output file names for included\n\
                                      source files\n");
--- 469,483 ----
    FILE *file = error_p ? stderr : stdout;
    int status = error_p ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE;
  
!   fnotice (file, "Usage: gcov [OPTION...] SOURCE|OBJ...\n\n");
    fnotice (file, "Print code coverage information.\n\n");
    fnotice (file, "  -a, --all-blocks                Show information for every basic block\n");
    fnotice (file, "  -b, --branch-probabilities      Include branch probabilities in output\n");
    fnotice (file, "  -c, --branch-counts             Output counts of branches taken\n\
                                      rather than percentages\n");
    fnotice (file, "  -d, --display-progress          Display progress information\n");
    fnotice (file, "  -f, --function-summaries        Output summaries for each function\n");
+   fnotice (file, "  -h, --help                      Print this help, then exit\n");
    fnotice (file, "  -i, --intermediate-format       Output .gcov file in intermediate text format\n");
    fnotice (file, "  -l, --long-file-names           Use long output file names for included\n\
                                      source files\n");
*************** process_args (int argc, char **argv)
*** 602,632 ****
    return optind;
  }
  
- /* Get the name of the gcov file.  The return value must be free'd.
- 
-    It appends the '.gcov' extension to the *basename* of the file.
-    The resulting file name will be in PWD.
- 
-    e.g.,
-    input: foo.da,       output: foo.da.gcov
-    input: a/b/foo.cc,   output: foo.cc.gcov  */
- 
- static char *
- get_gcov_intermediate_filename (const char *file_name)
- {
-   const char *gcov = ".gcov";
-   char *result;
-   const char *cptr;
- 
-   /* Find the 'basename'.  */
-   cptr = lbasename (file_name);
- 
-   result = XNEWVEC (char, strlen (cptr) + strlen (gcov) + 1);
-   sprintf (result, "%s%s", cptr, gcov);
- 
-   return result;
- }
- 
  /* Output the result in intermediate format used by 'lcov'.
  
  The intermediate format contains a single file named 'foo.cc.gcov',
--- 602,607 ----
*************** process_file (const char *file_name)
*** 725,731 ****
  
        fns = fn->next;
        fn->next = NULL;
!       if (fn->counts)
  	{
  	  unsigned src = fn->src;
  	  unsigned line = fn->line;
--- 700,706 ----
  
        fns = fn->next;
        fn->next = NULL;
!       if (fn->counts || no_data_file)
  	{
  	  unsigned src = fn->src;
  	  unsigned line = fn->line;
*************** output_gcov_file (const char *file_name,
*** 792,798 ****
        if (gcov_file)
          {
            fnotice (stdout, "Creating '%s'\n", gcov_file_name);
!           output_lines (gcov_file, src);
            if (ferror (gcov_file))
              fnotice (stderr, "Error writing output file '%s'\n", gcov_file_name);
            fclose (gcov_file);
--- 767,777 ----
        if (gcov_file)
          {
            fnotice (stdout, "Creating '%s'\n", gcov_file_name);
! 
! 	  if (flag_intermediate_format)
! 	    output_intermediate_file (gcov_file, src);
! 	  else
! 	    output_lines (gcov_file, src);
            if (ferror (gcov_file))
              fnotice (stderr, "Error writing output file '%s'\n", gcov_file_name);
            fclose (gcov_file);
*************** generate_results (const char *file_name)
*** 814,821 ****
    unsigned ix;
    source_t *src;
    function_t *fn;
-   FILE *gcov_intermediate_file = NULL;
-   char *gcov_intermediate_filename = NULL;
  
    for (ix = n_sources, src = sources; ix--; src++)
      if (src->num_lines)
--- 793,798 ----
*************** generate_results (const char *file_name)
*** 845,864 ****
  	file_name = canonicalize_name (file_name);
      }
  
-   if (flag_gcov_file && flag_intermediate_format)
-     {
-       /* Open the intermediate file.  */
-       gcov_intermediate_filename =
-         get_gcov_intermediate_filename (file_name);
-       gcov_intermediate_file = fopen (gcov_intermediate_filename, "w");
-       if (!gcov_intermediate_file)
-         {
-           fnotice (stderr, "Cannot open intermediate output file %s\n",
-                    gcov_intermediate_filename);
-           return;
-         }
-     }
- 
    for (ix = n_sources, src = sources; ix--; src++)
      {
        if (flag_relative_only)
--- 822,827 ----
*************** generate_results (const char *file_name)
*** 881,903 ****
        total_executed += src->coverage.lines_executed;
        if (flag_gcov_file)
  	{
!           if (flag_intermediate_format)
!             /* Output the intermediate format without requiring source
!                files.  This outputs a section to a *single* file.  */
!             output_intermediate_file (gcov_intermediate_file, src);
!           else
!             output_gcov_file (file_name, src);
            fnotice (stdout, "\n");
          }
      }
  
-   if (flag_gcov_file && flag_intermediate_format)
-     {
-       /* Now we've finished writing the intermediate file.  */
-       fclose (gcov_intermediate_file);
-       XDELETEVEC (gcov_intermediate_filename);
-     }
- 
    if (!file_name)
      executed_summary (total_lines, total_executed);
  }
--- 844,854 ----
        total_executed += src->coverage.lines_executed;
        if (flag_gcov_file)
  	{
! 	  output_gcov_file (file_name, src);
            fnotice (stdout, "\n");
          }
      }
  
    if (!file_name)
      executed_summary (total_lines, total_executed);
  }
*************** format_gcov (gcov_type top, gcov_type bo
*** 1817,1822 ****
--- 1768,1780 ----
  {
    static char buffer[20];
  
+   /* Handle invalid values that would result in a misleading value.  */
+   if (bottom != 0 && top > bottom && dp >= 0)
+     {
+       sprintf (buffer, "NAN %%");
+       return buffer;
+     }
+ 
    if (dp >= 0)
      {
        float ratio = bottom ? (float)top / bottom : 0;
diff -Nrcpad gcc-5.4.0/gcc/gcse.c gcc-5.5.0/gcc/gcse.c
*** gcc-5.4.0/gcc/gcse.c	Tue Mar  1 22:34:40 2016
--- gcc-5.5.0/gcc/gcse.c	Wed Mar 22 12:28:21 2017
*************** struct gcse_expr
*** 311,317 ****
       to keep register pressure under control.
       A value of "0" removes restrictions on how far the expression can
       travel.  */
!   int max_distance;
  };
  
  /* Occurrence of an expression.
--- 311,317 ----
       to keep register pressure under control.
       A value of "0" removes restrictions on how far the expression can
       travel.  */
!   HOST_WIDE_INT max_distance;
  };
  
  /* Occurrence of an expression.
*************** static void hash_scan_insn (rtx_insn *,
*** 486,497 ****
  static void hash_scan_set (rtx, rtx_insn *, struct gcse_hash_table_d *);
  static void hash_scan_clobber (rtx, rtx_insn *, struct gcse_hash_table_d *);
  static void hash_scan_call (rtx, rtx_insn *, struct gcse_hash_table_d *);
! static int want_to_gcse_p (rtx, int *);
  static int oprs_unchanged_p (const_rtx, const rtx_insn *, int);
  static int oprs_anticipatable_p (const_rtx, const rtx_insn *);
  static int oprs_available_p (const_rtx, const rtx_insn *);
  static void insert_expr_in_table (rtx, machine_mode, rtx_insn *, int, int,
! 				  int, struct gcse_hash_table_d *);
  static unsigned int hash_expr (const_rtx, machine_mode, int *, int);
  static void record_last_reg_set_info (rtx, int);
  static void record_last_mem_set_info (rtx_insn *);
--- 486,497 ----
  static void hash_scan_set (rtx, rtx_insn *, struct gcse_hash_table_d *);
  static void hash_scan_clobber (rtx, rtx_insn *, struct gcse_hash_table_d *);
  static void hash_scan_call (rtx, rtx_insn *, struct gcse_hash_table_d *);
! static int want_to_gcse_p (rtx, HOST_WIDE_INT *);
  static int oprs_unchanged_p (const_rtx, const rtx_insn *, int);
  static int oprs_anticipatable_p (const_rtx, const rtx_insn *);
  static int oprs_available_p (const_rtx, const rtx_insn *);
  static void insert_expr_in_table (rtx, machine_mode, rtx_insn *, int, int,
! 				  HOST_WIDE_INT, struct gcse_hash_table_d *);
  static unsigned int hash_expr (const_rtx, machine_mode, int *, int);
  static void record_last_reg_set_info (rtx, int);
  static void record_last_mem_set_info (rtx_insn *);
*************** static void alloc_code_hoist_mem (int, i
*** 521,528 ****
  static void free_code_hoist_mem (void);
  static void compute_code_hoist_vbeinout (void);
  static void compute_code_hoist_data (void);
! static int should_hoist_expr_to_dom (basic_block, struct gcse_expr *, basic_block,
! 				     sbitmap, int, int *, enum reg_class,
  				     int *, bitmap, rtx_insn *);
  static int hoist_code (void);
  static enum reg_class get_regno_pressure_class (int regno, int *nregs);
--- 521,530 ----
  static void free_code_hoist_mem (void);
  static void compute_code_hoist_vbeinout (void);
  static void compute_code_hoist_data (void);
! static int should_hoist_expr_to_dom (basic_block, struct gcse_expr *,
! 				     basic_block,
! 				     sbitmap, HOST_WIDE_INT, int *,
! 				     enum reg_class,
  				     int *, bitmap, rtx_insn *);
  static int hoist_code (void);
  static enum reg_class get_regno_pressure_class (int regno, int *nregs);
*************** static basic_block current_bb;
*** 777,783 ****
     GCSE.  */
  
  static int
! want_to_gcse_p (rtx x, int *max_distance_ptr)
  {
  #ifdef STACK_REGS
    /* On register stack architectures, don't GCSE constants from the
--- 779,785 ----
     GCSE.  */
  
  static int
! want_to_gcse_p (rtx x, HOST_WIDE_INT *max_distance_ptr)
  {
  #ifdef STACK_REGS
    /* On register stack architectures, don't GCSE constants from the
*************** want_to_gcse_p (rtx x, int *max_distance
*** 824,830 ****
  	/* PRE doesn't implement max_distance restriction.  */
  	{
  	  int cost;
! 	  int max_distance;
  
  	  gcc_assert (!optimize_function_for_speed_p (cfun)
  		      && optimize_function_for_size_p (cfun));
--- 826,832 ----
  	/* PRE doesn't implement max_distance restriction.  */
  	{
  	  int cost;
! 	  HOST_WIDE_INT max_distance;
  
  	  gcc_assert (!optimize_function_for_speed_p (cfun)
  		      && optimize_function_for_size_p (cfun));
*************** want_to_gcse_p (rtx x, int *max_distance
*** 832,838 ****
  
  	  if (cost < COSTS_N_INSNS (GCSE_UNRESTRICTED_COST))
  	    {
! 	      max_distance = (GCSE_COST_DISTANCE_RATIO * cost) / 10;
  	      if (max_distance == 0)
  		return 0;
  
--- 834,841 ----
  
  	  if (cost < COSTS_N_INSNS (GCSE_UNRESTRICTED_COST))
  	    {
! 	      max_distance
! 		= ((HOST_WIDE_INT)GCSE_COST_DISTANCE_RATIO * cost) / 10;
  	      if (max_distance == 0)
  		return 0;
  
*************** expr_equiv_p (const_rtx x, const_rtx y)
*** 1149,1155 ****
  static void
  insert_expr_in_table (rtx x, machine_mode mode, rtx_insn *insn,
  		      int antic_p,
! 		      int avail_p, int max_distance, struct gcse_hash_table_d *table)
  {
    int found, do_not_record_p;
    unsigned int hash;
--- 1152,1159 ----
  static void
  insert_expr_in_table (rtx x, machine_mode mode, rtx_insn *insn,
  		      int antic_p,
! 		      int avail_p, HOST_WIDE_INT max_distance,
! 		      struct gcse_hash_table_d *table)
  {
    int found, do_not_record_p;
    unsigned int hash;
*************** hash_scan_set (rtx set, rtx_insn *insn,
*** 1265,1271 ****
    else if (REG_P (dest))
      {
        unsigned int regno = REGNO (dest);
!       int max_distance = 0;
  
        /* See if a REG_EQUAL note shows this equivalent to a simpler expression.
  
--- 1269,1275 ----
    else if (REG_P (dest))
      {
        unsigned int regno = REGNO (dest);
!       HOST_WIDE_INT max_distance = 0;
  
        /* See if a REG_EQUAL note shows this equivalent to a simpler expression.
  
*************** hash_scan_set (rtx set, rtx_insn *insn,
*** 1334,1340 ****
    else if (flag_gcse_las && REG_P (src) && MEM_P (dest))
        {
          unsigned int regno = REGNO (src);
! 	int max_distance = 0;
  
  	/* Only record sets of pseudo-regs in the hash table.  */
          if (regno >= FIRST_PSEUDO_REGISTER
--- 1338,1344 ----
    else if (flag_gcse_las && REG_P (src) && MEM_P (dest))
        {
          unsigned int regno = REGNO (src);
! 	HOST_WIDE_INT max_distance = 0;
  
  	/* Only record sets of pseudo-regs in the hash table.  */
          if (regno >= FIRST_PSEUDO_REGISTER
*************** dump_hash_table (FILE *file, const char
*** 1447,1453 ****
      if (flat_table[i] != 0)
        {
  	expr = flat_table[i];
! 	fprintf (file, "Index %d (hash value %d; max distance %d)\n  ",
  		 expr->bitmap_index, hash_val[i], expr->max_distance);
  	print_rtl (file, expr->expr);
  	fprintf (file, "\n");
--- 1451,1458 ----
      if (flat_table[i] != 0)
        {
  	expr = flat_table[i];
! 	fprintf (file, "Index %d (hash value %d; max distance "
! 		 HOST_WIDE_INT_PRINT_DEC ")\n  ",
  		 expr->bitmap_index, hash_val[i], expr->max_distance);
  	print_rtl (file, expr->expr);
  	fprintf (file, "\n");
*************** update_bb_reg_pressure (basic_block bb,
*** 2908,2914 ****
  
  static int
  should_hoist_expr_to_dom (basic_block expr_bb, struct gcse_expr *expr,
! 			  basic_block bb, sbitmap visited, int distance,
  			  int *bb_size, enum reg_class pressure_class,
  			  int *nregs, bitmap hoisted_bbs, rtx_insn *from)
  {
--- 2913,2920 ----
  
  static int
  should_hoist_expr_to_dom (basic_block expr_bb, struct gcse_expr *expr,
! 			  basic_block bb, sbitmap visited,
! 			  HOST_WIDE_INT distance,
  			  int *bb_size, enum reg_class pressure_class,
  			  int *nregs, bitmap hoisted_bbs, rtx_insn *from)
  {
*************** hoist_code (void)
*** 3185,3191 ****
  		 computes the expression.  */
  	      FOR_EACH_VEC_ELT (domby, j, dominated)
  		{
! 		  int max_distance;
  
  		  /* Ignore self dominance.  */
  		  if (bb == dominated)
--- 3191,3197 ----
  		 computes the expression.  */
  	      FOR_EACH_VEC_ELT (domby, j, dominated)
  		{
! 		  HOST_WIDE_INT max_distance;
  
  		  /* Ignore self dominance.  */
  		  if (bb == dominated)
diff -Nrcpad gcc-5.4.0/gcc/gengtype-lex.c gcc-5.5.0/gcc/gengtype-lex.c
*** gcc-5.4.0/gcc/gengtype-lex.c	Fri Jun  3 08:47:43 2016
--- gcc-5.5.0/gcc/gengtype-lex.c	Tue Oct 10 08:16:34 2017
***************
*** 9,16 ****
  
  #define FLEX_SCANNER
  #define YY_FLEX_MAJOR_VERSION 2
! #define YY_FLEX_MINOR_VERSION 5
! #define YY_FLEX_SUBMINOR_VERSION 35
  #if YY_FLEX_SUBMINOR_VERSION > 0
  #define FLEX_BETA
  #endif
--- 9,16 ----
  
  #define FLEX_SCANNER
  #define YY_FLEX_MAJOR_VERSION 2
! #define YY_FLEX_MINOR_VERSION 6
! #define YY_FLEX_SUBMINOR_VERSION 0
  #if YY_FLEX_SUBMINOR_VERSION > 0
  #define FLEX_BETA
  #endif
*************** typedef int flex_int32_t;
*** 55,61 ****
  typedef unsigned char flex_uint8_t; 
  typedef unsigned short int flex_uint16_t;
  typedef unsigned int flex_uint32_t;
- #endif /* ! C99 */
  
  /* Limits of integral types. */
  #ifndef INT8_MIN
--- 55,60 ----
*************** typedef unsigned int flex_uint32_t;
*** 86,91 ****
--- 85,92 ----
  #define UINT32_MAX             (4294967295U)
  #endif
  
+ #endif /* ! C99 */
+ 
  #endif /* ! FLEXINT_H */
  
  #ifdef __cplusplus
*************** typedef unsigned int flex_uint32_t;
*** 142,148 ****
--- 143,157 ----
  
  /* Size of default input buffer. */
  #ifndef YY_BUF_SIZE
+ #ifdef __ia64__
+ /* On IA-64, the buffer size is 16k, not 8k.
+  * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+  * Ditto for the __ia64__ case accordingly.
+  */
+ #define YY_BUF_SIZE 32768
+ #else
  #define YY_BUF_SIZE 16384
+ #endif /* __ia64__ */
  #endif
  
  /* The state buf must be large enough to hold one state per character in the main buffer.
*************** typedef unsigned int flex_uint32_t;
*** 154,160 ****
  typedef struct yy_buffer_state *YY_BUFFER_STATE;
  #endif
  
! extern int yyleng;
  
  extern FILE *yyin, *yyout;
  
--- 163,174 ----
  typedef struct yy_buffer_state *YY_BUFFER_STATE;
  #endif
  
! #ifndef YY_TYPEDEF_YY_SIZE_T
! #define YY_TYPEDEF_YY_SIZE_T
! typedef size_t yy_size_t;
! #endif
! 
! extern yy_size_t yyleng;
  
  extern FILE *yyin, *yyout;
  
*************** extern FILE *yyin, *yyout;
*** 163,175 ****
  #define EOB_ACT_LAST_MATCH 2
  
      #define YY_LESS_LINENO(n)
      
  /* Return all but the first "n" matched characters back to the input stream. */
  #define yyless(n) \
  	do \
  		{ \
  		/* Undo effects of setting up yytext. */ \
!         int yyless_macro_arg = (n); \
          YY_LESS_LINENO(yyless_macro_arg);\
  		*yy_cp = (yy_hold_char); \
  		YY_RESTORE_YY_MORE_OFFSET \
--- 177,190 ----
  #define EOB_ACT_LAST_MATCH 2
  
      #define YY_LESS_LINENO(n)
+     #define YY_LINENO_REWIND_TO(ptr)
      
  /* Return all but the first "n" matched characters back to the input stream. */
  #define yyless(n) \
  	do \
  		{ \
  		/* Undo effects of setting up yytext. */ \
!         yy_size_t yyless_macro_arg = (n); \
          YY_LESS_LINENO(yyless_macro_arg);\
  		*yy_cp = (yy_hold_char); \
  		YY_RESTORE_YY_MORE_OFFSET \
*************** extern FILE *yyin, *yyout;
*** 180,190 ****
  
  #define unput(c) yyunput( c, (yytext_ptr)  )
  
- #ifndef YY_TYPEDEF_YY_SIZE_T
- #define YY_TYPEDEF_YY_SIZE_T
- typedef size_t yy_size_t;
- #endif
- 
  #ifndef YY_STRUCT_YY_BUFFER_STATE
  #define YY_STRUCT_YY_BUFFER_STATE
  struct yy_buffer_state
--- 195,200 ----
*************** struct yy_buffer_state
*** 202,208 ****
  	/* Number of characters read into yy_ch_buf, not including EOB
  	 * characters.
  	 */
! 	int yy_n_chars;
  
  	/* Whether we "own" the buffer - i.e., we know we created it,
  	 * and can realloc() it to grow it, and should free() it to
--- 212,218 ----
  	/* Number of characters read into yy_ch_buf, not including EOB
  	 * characters.
  	 */
! 	yy_size_t yy_n_chars;
  
  	/* Whether we "own" the buffer - i.e., we know we created it,
  	 * and can realloc() it to grow it, and should free() it to
*************** static YY_BUFFER_STATE * yy_buffer_stack
*** 272,279 ****
  
  /* yy_hold_char holds the character lost when yytext is formed. */
  static char yy_hold_char;
! static int yy_n_chars;		/* number of characters read into yy_ch_buf */
! int yyleng;
  
  /* Points to current character in buffer. */
  static char *yy_c_buf_p = (char *) 0;
--- 282,289 ----
  
  /* yy_hold_char holds the character lost when yytext is formed. */
  static char yy_hold_char;
! static yy_size_t yy_n_chars;		/* number of characters read into yy_ch_buf */
! yy_size_t yyleng;
  
  /* Points to current character in buffer. */
  static char *yy_c_buf_p = (char *) 0;
*************** static void yy_init_buffer (YY_BUFFER_ST
*** 301,307 ****
  
  YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size  );
  YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str  );
! YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,int len  );
  
  void *yyalloc (yy_size_t  );
  void *yyrealloc (void *,yy_size_t  );
--- 311,317 ----
  
  YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size  );
  YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str  );
! YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,yy_size_t len  );
  
  void *yyalloc (yy_size_t  );
  void *yyrealloc (void *,yy_size_t  );
*************** void yyfree (void *  );
*** 333,339 ****
  
  /* Begin user sect3 */
  
! #define yywrap(n) 1
  #define YY_SKIP_YYWRAP
  
  typedef unsigned char YY_CHAR;
--- 343,349 ----
  
  /* Begin user sect3 */
  
! #define yywrap() (/*CONSTCOND*/1)
  #define YY_SKIP_YYWRAP
  
  typedef unsigned char YY_CHAR;
*************** extern int yylineno;
*** 347,357 ****
--- 357,373 ----
  int yylineno = 1;
  
  extern char *yytext;
+ #ifdef yytext_ptr
+ #undef yytext_ptr
+ #endif
  #define yytext_ptr yytext
  
  static yy_state_type yy_get_previous_state (void );
  static yy_state_type yy_try_NUL_trans (yy_state_type current_state  );
  static int yy_get_next_buffer (void );
+ #if defined(__GNUC__) && __GNUC__ >= 3
+ __attribute__((__noreturn__))
+ #endif
  static void yy_fatal_error (yyconst char msg[]  );
  
  /* Done after the current pattern has been matched and before the
*************** static yyconst flex_int16_t yy_accept[56
*** 438,444 ****
          0,   45,    0,    0,    0,    0,    0,    0,    0,    0
      } ;
  
! static yyconst flex_int32_t yy_ec[256] =
      {   0,
          1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
          2,    2,    2,    1,    1,    1,    1,    1,    1,    1,
--- 454,460 ----
          0,   45,    0,    0,    0,    0,    0,    0,    0,    0
      } ;
  
! static yyconst YY_CHAR yy_ec[256] =
      {   0,
          1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
          2,    2,    2,    1,    1,    1,    1,    1,    1,    1,
*************** static yyconst flex_int32_t yy_ec[256] =
*** 470,476 ****
          1,    1,    1,    1,    1
      } ;
  
! static yyconst flex_int32_t yy_meta[68] =
      {   0,
          1,    2,    3,    1,    1,    1,    1,    1,    1,    4,
          5,    1,    1,    6,    6,    7,    8,    9,    9,    9,
--- 486,492 ----
          1,    1,    1,    1,    1
      } ;
  
! static yyconst YY_CHAR yy_meta[68] =
      {   0,
          1,    2,    3,    1,    1,    1,    1,    1,    1,    4,
          5,    1,    1,    6,    6,    7,    8,    9,    9,    9,
*************** static yyconst flex_int32_t yy_meta[68]
*** 481,487 ****
         11,   11,   11,   11,   11,   11,    1
      } ;
  
! static yyconst flex_int16_t yy_base[608] =
      {   0,
          0,   67,  134,   16,   16,   17,   18,   20, 1232, 2403,
       2403,   19, 1191,   19,   31,   41,   43,   32,   33,   34,
--- 497,503 ----
         11,   11,   11,   11,   11,   11,    1
      } ;
  
! static yyconst flex_uint16_t yy_base[608] =
      {   0,
          0,   67,  134,   16,   16,   17,   18,   20, 1232, 2403,
       2403,   19, 1191,   19,   31,   41,   43,   32,   33,   34,
*************** static yyconst flex_int16_t yy_def[608]
*** 623,629 ****
        560,  560,  560,  560,  560,  560,  560
      } ;
  
! static yyconst flex_int16_t yy_nxt[2471] =
      {   0,
         10,   10,   11,   10,   12,   10,   10,   13,   10,   10,
         10,   10,   14,   10,   10,   10,   10,   56,   59,   59,
--- 639,645 ----
        560,  560,  560,  560,  560,  560,  560
      } ;
  
! static yyconst flex_uint16_t yy_nxt[2471] =
      {   0,
         10,   10,   11,   10,   12,   10,   10,   13,   10,   10,
         10,   10,   14,   10,   10,   10,   10,   56,   59,   59,
*************** int yy_flex_debug = 0;
*** 1187,1193 ****
  #define YY_MORE_ADJ 0
  #define YY_RESTORE_YY_MORE_OFFSET
  char *yytext;
! #line 1 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  /* -*- indented-text -*- */
  /* Process source files and output type information.
     Copyright (C) 2002-2015 Free Software Foundation, Inc.
--- 1203,1209 ----
  #define YY_MORE_ADJ 0
  #define YY_RESTORE_YY_MORE_OFFSET
  char *yytext;
! #line 1 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  /* -*- indented-text -*- */
  /* Process source files and output type information.
     Copyright (C) 2002-2015 Free Software Foundation, Inc.
*************** You should have received a copy of the G
*** 1208,1214 ****
  along with GCC; see the file COPYING3.  If not see
  <http://www.gnu.org/licenses/>.  */
  #define YY_NO_INPUT 1
! #line 24 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  #ifdef HOST_GENERATOR_FILE
  #include "config.h"
  #define GENERATOR_FILE 1
--- 1224,1230 ----
  along with GCC; see the file COPYING3.  If not see
  <http://www.gnu.org/licenses/>.  */
  #define YY_NO_INPUT 1
! #line 24 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  #ifdef HOST_GENERATOR_FILE
  #include "config.h"
  #define GENERATOR_FILE 1
*************** update_lineno (const char *l, size_t len
*** 1238,1244 ****
  
  /* Include '::' in identifiers to capture C++ scope qualifiers.  */
  
! #line 1241 "gengtype-lex.c"
  
  #define INITIAL 0
  #define in_struct 1
--- 1254,1260 ----
  
  /* Include '::' in identifiers to capture C++ scope qualifiers.  */
  
! #line 1257 "gengtype-lex.c"
  
  #define INITIAL 0
  #define in_struct 1
*************** void yyset_extra (YY_EXTRA_TYPE user_def
*** 1274,1292 ****
  
  FILE *yyget_in (void );
  
! void yyset_in  (FILE * in_str  );
  
  FILE *yyget_out (void );
  
! void yyset_out  (FILE * out_str  );
  
! int yyget_leng (void );
  
  char *yyget_text (void );
  
  int yyget_lineno (void );
  
! void yyset_lineno (int line_number  );
  
  /* Macros after this point can all be overridden by user definitions in
   * section 1.
--- 1290,1308 ----
  
  FILE *yyget_in (void );
  
! void yyset_in  (FILE * _in_str  );
  
  FILE *yyget_out (void );
  
! void yyset_out  (FILE * _out_str  );
  
! yy_size_t yyget_leng (void );
  
  char *yyget_text (void );
  
  int yyget_lineno (void );
  
! void yyset_lineno (int _line_number  );
  
  /* Macros after this point can all be overridden by user definitions in
   * section 1.
*************** extern int yywrap (void );
*** 1300,1305 ****
--- 1316,1325 ----
  #endif
  #endif
  
+ #ifndef YY_NO_UNPUT
+     
+ #endif
+ 
  #ifndef yytext_ptr
  static void yy_flex_strncpy (char *,yyconst char *,int );
  #endif
*************** static int input (void );
*** 1320,1326 ****
--- 1340,1351 ----
  
  /* Amount of stuff to slurp up with each read. */
  #ifndef YY_READ_BUF_SIZE
+ #ifdef __ia64__
+ /* On IA-64, the buffer size is 16k, not 8k */
+ #define YY_READ_BUF_SIZE 16384
+ #else
  #define YY_READ_BUF_SIZE 8192
+ #endif /* __ia64__ */
  #endif
  
  /* Copy whatever the last rule matched to the standard output. */
*************** static int input (void );
*** 1328,1334 ****
  /* This used to be an fputs(), but since the string might contain NUL's,
   * we now use fwrite().
   */
! #define ECHO fwrite( yytext, yyleng, 1, yyout )
  #endif
  
  /* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
--- 1353,1359 ----
  /* This used to be an fputs(), but since the string might contain NUL's,
   * we now use fwrite().
   */
! #define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0)
  #endif
  
  /* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
*************** static int input (void );
*** 1339,1345 ****
  	if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
  		{ \
  		int c = '*'; \
! 		int n; \
  		for ( n = 0; n < max_size && \
  			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
  			buf[n] = (char) c; \
--- 1364,1370 ----
  	if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
  		{ \
  		int c = '*'; \
! 		size_t n; \
  		for ( n = 0; n < max_size && \
  			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
  			buf[n] = (char) c; \
*************** extern int yylex (void);
*** 1407,1413 ****
  
  /* Code executed at the end of each rule. */
  #ifndef YY_BREAK
! #define YY_BREAK break;
  #endif
  
  #define YY_RULE_SETUP \
--- 1432,1438 ----
  
  /* Code executed at the end of each rule. */
  #ifndef YY_BREAK
! #define YY_BREAK /*LINTED*/break;
  #endif
  
  #define YY_RULE_SETUP \
*************** extern int yylex (void);
*** 1420,1442 ****
   */
  YY_DECL
  {
! 	register yy_state_type yy_current_state;
! 	register char *yy_cp, *yy_bp;
! 	register int yy_act;
      
- #line 66 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
- 
-   /* Do this on entry to yylex():  */
-   *yylval = 0;
-   if (lexer_toplevel_done)
-     {
-       BEGIN(INITIAL);
-       lexer_toplevel_done = 0;
-     }
- 
-   /* Things we look for in skipping mode: */
- #line 1438 "gengtype-lex.c"
- 
  	if ( !(yy_init) )
  		{
  		(yy_init) = 1;
--- 1445,1454 ----
   */
  YY_DECL
  {
! 	yy_state_type yy_current_state;
! 	char *yy_cp, *yy_bp;
! 	int yy_act;
      
  	if ( !(yy_init) )
  		{
  		(yy_init) = 1;
*************** YY_DECL
*** 1463,1469 ****
  		yy_load_buffer_state( );
  		}
  
! 	while ( 1 )		/* loops until end-of-file is reached */
  		{
  		yy_cp = (yy_c_buf_p);
  
--- 1475,1495 ----
  		yy_load_buffer_state( );
  		}
  
! 	{
! #line 66 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
! 
!   /* Do this on entry to yylex():  */
!   *yylval = 0;
!   if (lexer_toplevel_done)
!     {
!       BEGIN(INITIAL);
!       lexer_toplevel_done = 0;
!     }
! 
!   /* Things we look for in skipping mode: */
! #line 1490 "gengtype-lex.c"
! 
! 	while ( /*CONSTCOND*/1 )		/* loops until end-of-file is reached */
  		{
  		yy_cp = (yy_c_buf_p);
  
*************** YY_DECL
*** 1480,1486 ****
  yy_match:
  		do
  			{
! 			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
  			if ( yy_accept[yy_current_state] )
  				{
  				(yy_last_accepting_state) = yy_current_state;
--- 1506,1512 ----
  yy_match:
  		do
  			{
! 			YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)] ;
  			if ( yy_accept[yy_current_state] )
  				{
  				(yy_last_accepting_state) = yy_current_state;
*************** do_action:	/* This label is used only to
*** 1518,1527 ****
  case 1:
  /* rule 1 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 77 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return TYPEDEF;
--- 1544,1554 ----
  case 1:
  /* rule 1 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_cp - 1);
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 77 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return TYPEDEF;
*************** YY_RULE_SETUP
*** 1530,1539 ****
  case 2:
  /* rule 2 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 81 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return STRUCT;
--- 1557,1567 ----
  case 2:
  /* rule 2 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_cp - 1);
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 81 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return STRUCT;
*************** YY_RULE_SETUP
*** 1542,1551 ****
  case 3:
  /* rule 3 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 85 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return UNION;
--- 1570,1580 ----
  case 3:
  /* rule 3 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_cp - 1);
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 85 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return UNION;
*************** YY_RULE_SETUP
*** 1554,1563 ****
  case 4:
  /* rule 4 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 89 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return STRUCT;
--- 1583,1593 ----
  case 4:
  /* rule 4 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_cp - 1);
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 89 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return STRUCT;
*************** YY_RULE_SETUP
*** 1566,1575 ****
  case 5:
  /* rule 5 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 93 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return EXTERN;
--- 1596,1606 ----
  case 5:
  /* rule 5 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_cp - 1);
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 93 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return EXTERN;
*************** YY_RULE_SETUP
*** 1578,1587 ****
  case 6:
  /* rule 6 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 97 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return STATIC;
--- 1609,1619 ----
  case 6:
  /* rule 6 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_cp - 1);
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 97 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    BEGIN(in_struct);
    return STATIC;
*************** YY_RULE_SETUP
*** 1592,1643 ****
  
  case 7:
  YY_RULE_SETUP
! #line 105 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { BEGIN(in_struct_comment); }
  	YY_BREAK
  case 8:
  /* rule 8 can match eol */
  YY_RULE_SETUP
! #line 106 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 9:
  /* rule 9 can match eol */
  YY_RULE_SETUP
! #line 108 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { update_lineno (yytext, yyleng); }
  	YY_BREAK
  case 10:
  /* rule 10 can match eol */
  YY_RULE_SETUP
! #line 109 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 11:
  /* rule 11 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 5;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 111 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  /* don't care */
  	YY_BREAK
  case 12:
  /* rule 12 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
! #line 113 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  case 13:
  /* rule 13 can match eol */
! #line 114 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  case 14:
  /* rule 14 can match eol */
! #line 115 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  case 15:
  /* rule 15 can match eol */
  YY_RULE_SETUP
! #line 115 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
      *yylval = XDUPVAR (const char, yytext, yyleng, yyleng + 1);
      return IGNORABLE_CXX_KEYWORD;
--- 1624,1677 ----
  
  case 7:
  YY_RULE_SETUP
! #line 105 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { BEGIN(in_struct_comment); }
  	YY_BREAK
  case 8:
  /* rule 8 can match eol */
  YY_RULE_SETUP
! #line 106 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 9:
  /* rule 9 can match eol */
  YY_RULE_SETUP
! #line 108 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { update_lineno (yytext, yyleng); }
  	YY_BREAK
  case 10:
  /* rule 10 can match eol */
  YY_RULE_SETUP
! #line 109 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 11:
  /* rule 11 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 5);
  (yy_c_buf_p) = yy_cp = yy_bp + 5;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 111 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  /* don't care */
  	YY_BREAK
  case 12:
  /* rule 12 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_cp - 1);
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
! #line 113 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  case 13:
  /* rule 13 can match eol */
! #line 114 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  case 14:
  /* rule 14 can match eol */
! #line 115 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  case 15:
  /* rule 15 can match eol */
  YY_RULE_SETUP
! #line 115 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
      *yylval = XDUPVAR (const char, yytext, yyleng, yyleng + 1);
      return IGNORABLE_CXX_KEYWORD;
*************** YY_RULE_SETUP
*** 1646,1744 ****
  case 16:
  /* rule 16 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 3;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 119 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return GTY_TOKEN; }
  	YY_BREAK
  case 17:
  /* rule 17 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 5;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 120 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return UNION; }
  	YY_BREAK
  case 18:
  /* rule 18 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 6;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 121 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return STRUCT; }
  	YY_BREAK
  case 19:
  /* rule 19 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 5;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 122 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return STRUCT; }
  	YY_BREAK
  case 20:
  /* rule 20 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 7;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 123 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return TYPEDEF; }
  	YY_BREAK
  case 21:
  /* rule 21 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 4;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 124 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return ENUM; }
  	YY_BREAK
  case 22:
  /* rule 22 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 9;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 125 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return PTR_ALIAS; }
  	YY_BREAK
  case 23:
  /* rule 23 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 10;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 126 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return NESTED_PTR; }
  	YY_BREAK
  case 24:
  /* rule 24 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 4;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 127 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return USER_GTY; }
  	YY_BREAK
  case 25:
  YY_RULE_SETUP
! #line 128 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return NUM; }
  	YY_BREAK
  case 26:
  /* rule 26 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
! #line 131 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  case 27:
  /* rule 27 can match eol */
  YY_RULE_SETUP
! #line 131 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    size_t len;
  
--- 1680,1788 ----
  case 16:
  /* rule 16 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 3);
  (yy_c_buf_p) = yy_cp = yy_bp + 3;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 119 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return GTY_TOKEN; }
  	YY_BREAK
  case 17:
  /* rule 17 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 5);
  (yy_c_buf_p) = yy_cp = yy_bp + 5;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 120 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return UNION; }
  	YY_BREAK
  case 18:
  /* rule 18 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 6);
  (yy_c_buf_p) = yy_cp = yy_bp + 6;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 121 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return STRUCT; }
  	YY_BREAK
  case 19:
  /* rule 19 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 5);
  (yy_c_buf_p) = yy_cp = yy_bp + 5;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 122 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return STRUCT; }
  	YY_BREAK
  case 20:
  /* rule 20 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 7);
  (yy_c_buf_p) = yy_cp = yy_bp + 7;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 123 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return TYPEDEF; }
  	YY_BREAK
  case 21:
  /* rule 21 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 4);
  (yy_c_buf_p) = yy_cp = yy_bp + 4;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 124 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return ENUM; }
  	YY_BREAK
  case 22:
  /* rule 22 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 9);
  (yy_c_buf_p) = yy_cp = yy_bp + 9;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 125 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return PTR_ALIAS; }
  	YY_BREAK
  case 23:
  /* rule 23 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 10);
  (yy_c_buf_p) = yy_cp = yy_bp + 10;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 126 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return NESTED_PTR; }
  	YY_BREAK
  case 24:
  /* rule 24 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 4);
  (yy_c_buf_p) = yy_cp = yy_bp + 4;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 127 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return USER_GTY; }
  	YY_BREAK
  case 25:
  YY_RULE_SETUP
! #line 128 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return NUM; }
  	YY_BREAK
  case 26:
  /* rule 26 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_cp - 1);
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
! #line 131 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  case 27:
  /* rule 27 can match eol */
  YY_RULE_SETUP
! #line 131 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    size_t len;
  
*************** YY_RULE_SETUP
*** 1753,1762 ****
  case 28:
  /* rule 28 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 142 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    *yylval = XDUPVAR (const char, yytext, yyleng, yyleng+1);
    return ID;
--- 1797,1807 ----
  case 28:
  /* rule 28 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_cp - 1);
  (yy_c_buf_p) = yy_cp -= 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 142 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    *yylval = XDUPVAR (const char, yytext, yyleng, yyleng+1);
    return ID;
*************** YY_RULE_SETUP
*** 1765,1771 ****
  case 29:
  /* rule 29 can match eol */
  YY_RULE_SETUP
! #line 147 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    *yylval = XDUPVAR (const char, yytext+1, yyleng-2, yyleng-1);
    return STRING;
--- 1810,1816 ----
  case 29:
  /* rule 29 can match eol */
  YY_RULE_SETUP
! #line 147 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    *yylval = XDUPVAR (const char, yytext+1, yyleng-2, yyleng-1);
    return STRING;
*************** YY_RULE_SETUP
*** 1775,1781 ****
  case 30:
  /* rule 30 can match eol */
  YY_RULE_SETUP
! #line 152 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    *yylval = XDUPVAR (const char, yytext+1, yyleng-2, yyleng-1);
    return ARRAY;
--- 1820,1826 ----
  case 30:
  /* rule 30 can match eol */
  YY_RULE_SETUP
! #line 152 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    *yylval = XDUPVAR (const char, yytext+1, yyleng-2, yyleng-1);
    return ARRAY;
*************** YY_RULE_SETUP
*** 1784,1790 ****
  case 31:
  /* rule 31 can match eol */
  YY_RULE_SETUP
! #line 156 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    *yylval = XDUPVAR (const char, yytext+1, yyleng-2, yyleng);
    return CHAR;
--- 1829,1835 ----
  case 31:
  /* rule 31 can match eol */
  YY_RULE_SETUP
! #line 156 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    *yylval = XDUPVAR (const char, yytext+1, yyleng-2, yyleng);
    return CHAR;
*************** YY_RULE_SETUP
*** 1792,1815 ****
  	YY_BREAK
  case 32:
  YY_RULE_SETUP
! #line 161 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return ELLIPSIS; }
  	YY_BREAK
  case 33:
  YY_RULE_SETUP
! #line 162 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { return yytext[0]; }
  	YY_BREAK
  /* ignore pp-directives */
  case 34:
  /* rule 34 can match eol */
  YY_RULE_SETUP
! #line 165 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {lexer_line.line++;}
  	YY_BREAK
  case 35:
  YY_RULE_SETUP
! #line 167 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    error_at_line (&lexer_line, "unexpected character `%s'", yytext);
  }
--- 1837,1860 ----
  	YY_BREAK
  case 32:
  YY_RULE_SETUP
! #line 161 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return ELLIPSIS; }
  	YY_BREAK
  case 33:
  YY_RULE_SETUP
! #line 162 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { return yytext[0]; }
  	YY_BREAK
  /* ignore pp-directives */
  case 34:
  /* rule 34 can match eol */
  YY_RULE_SETUP
! #line 165 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {lexer_line.line++;}
  	YY_BREAK
  case 35:
  YY_RULE_SETUP
! #line 167 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    error_at_line (&lexer_line, "unexpected character `%s'", yytext);
  }
*************** YY_RULE_SETUP
*** 1817,1902 ****
  
  case 36:
  YY_RULE_SETUP
! #line 172 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { BEGIN(in_comment); }
  	YY_BREAK
  case 37:
  /* rule 37 can match eol */
  YY_RULE_SETUP
! #line 173 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 38:
  /* rule 38 can match eol */
  YY_RULE_SETUP
! #line 174 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 39:
! #line 176 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  case 40:
  /* rule 40 can match eol */
! #line 177 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  case 41:
  /* rule 41 can match eol */
  YY_RULE_SETUP
! #line 177 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  case 42:
  /* rule 42 can match eol */
  YY_RULE_SETUP
! #line 178 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { update_lineno (yytext, yyleng); }
  	YY_BREAK
  case 43:
  /* rule 43 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 179 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  
  case 44:
  /* rule 44 can match eol */
  YY_RULE_SETUP
! #line 182 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 45:
! #line 184 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  case 46:
  YY_RULE_SETUP
! #line 184 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  case 47:
  /* rule 47 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
  (yy_c_buf_p) = yy_cp = yy_bp + 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 185 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  
  case 48:
  YY_RULE_SETUP
! #line 188 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { BEGIN(INITIAL); } 
  	YY_BREAK
  case 49:
  YY_RULE_SETUP
! #line 189 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  { BEGIN(in_struct); }
  	YY_BREAK
  case 50:
! #line 192 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  case 51:
  YY_RULE_SETUP
! #line 192 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  {
    error_at_line (&lexer_line, 
  		 "unterminated comment or string; unexpected EOF");
--- 1862,1949 ----
  
  case 36:
  YY_RULE_SETUP
! #line 172 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { BEGIN(in_comment); }
  	YY_BREAK
  case 37:
  /* rule 37 can match eol */
  YY_RULE_SETUP
! #line 173 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 38:
  /* rule 38 can match eol */
  YY_RULE_SETUP
! #line 174 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 39:
! #line 176 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  case 40:
  /* rule 40 can match eol */
! #line 177 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  case 41:
  /* rule 41 can match eol */
  YY_RULE_SETUP
! #line 177 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  case 42:
  /* rule 42 can match eol */
  YY_RULE_SETUP
! #line 178 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { update_lineno (yytext, yyleng); }
  	YY_BREAK
  case 43:
  /* rule 43 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 1);
  (yy_c_buf_p) = yy_cp = yy_bp + 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 179 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  
  case 44:
  /* rule 44 can match eol */
  YY_RULE_SETUP
! #line 182 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { lexer_line.line++; }
  	YY_BREAK
  case 45:
! #line 184 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  case 46:
  YY_RULE_SETUP
! #line 184 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  case 47:
  /* rule 47 can match eol */
  *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */
+ YY_LINENO_REWIND_TO(yy_bp + 1);
  (yy_c_buf_p) = yy_cp = yy_bp + 1;
  YY_DO_BEFORE_ACTION; /* set up yytext again */
  YY_RULE_SETUP
! #line 185 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  
  case 48:
  YY_RULE_SETUP
! #line 188 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { BEGIN(INITIAL); } 
  	YY_BREAK
  case 49:
  YY_RULE_SETUP
! #line 189 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  { BEGIN(in_struct); }
  	YY_BREAK
  case 50:
! #line 192 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  case 51:
  YY_RULE_SETUP
! #line 192 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  {
    error_at_line (&lexer_line, 
  		 "unterminated comment or string; unexpected EOF");
*************** YY_RULE_SETUP
*** 1905,1919 ****
  case 52:
  /* rule 52 can match eol */
  YY_RULE_SETUP
! #line 197 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  case 53:
  YY_RULE_SETUP
! #line 199 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  YY_FATAL_ERROR( "flex scanner jammed" );
  	YY_BREAK
! #line 1916 "gengtype-lex.c"
  case YY_STATE_EOF(INITIAL):
  case YY_STATE_EOF(in_struct):
  case YY_STATE_EOF(in_struct_comment):
--- 1952,1966 ----
  case 52:
  /* rule 52 can match eol */
  YY_RULE_SETUP
! #line 197 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  /* do nothing */
  	YY_BREAK
  case 53:
  YY_RULE_SETUP
! #line 199 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  YY_FATAL_ERROR( "flex scanner jammed" );
  	YY_BREAK
! #line 1963 "gengtype-lex.c"
  case YY_STATE_EOF(INITIAL):
  case YY_STATE_EOF(in_struct):
  case YY_STATE_EOF(in_struct_comment):
*************** case YY_STATE_EOF(in_comment):
*** 2048,2053 ****
--- 2095,2101 ----
  			"fatal flex scanner internal error--no action found" );
  	} /* end of action switch */
  		} /* end of scanning one token */
+ 	} /* end of user's declarations */
  } /* end of yylex */
  
  /* yy_get_next_buffer - try to read in a new buffer
*************** case YY_STATE_EOF(in_comment):
*** 2059,2067 ****
   */
  static int yy_get_next_buffer (void)
  {
!     	register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
! 	register char *source = (yytext_ptr);
! 	register int number_to_move, i;
  	int ret_val;
  
  	if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
--- 2107,2115 ----
   */
  static int yy_get_next_buffer (void)
  {
!     	char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
! 	char *source = (yytext_ptr);
! 	yy_size_t number_to_move, i;
  	int ret_val;
  
  	if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
*************** static int yy_get_next_buffer (void)
*** 2090,2096 ****
  	/* Try to read more data. */
  
  	/* First move last chars to start of buffer. */
! 	number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1;
  
  	for ( i = 0; i < number_to_move; ++i )
  		*(dest++) = *(source++);
--- 2138,2144 ----
  	/* Try to read more data. */
  
  	/* First move last chars to start of buffer. */
! 	number_to_move = (yy_size_t) ((yy_c_buf_p) - (yytext_ptr)) - 1;
  
  	for ( i = 0; i < number_to_move; ++i )
  		*(dest++) = *(source++);
*************** static int yy_get_next_buffer (void)
*** 2110,2123 ****
  			{ /* Not enough room in the buffer - grow it. */
  
  			/* just a shorter name for the current buffer */
! 			YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
  
  			int yy_c_buf_p_offset =
  				(int) ((yy_c_buf_p) - b->yy_ch_buf);
  
  			if ( b->yy_is_our_buffer )
  				{
! 				int new_size = b->yy_buf_size * 2;
  
  				if ( new_size <= 0 )
  					b->yy_buf_size += b->yy_buf_size / 8;
--- 2158,2171 ----
  			{ /* Not enough room in the buffer - grow it. */
  
  			/* just a shorter name for the current buffer */
! 			YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE;
  
  			int yy_c_buf_p_offset =
  				(int) ((yy_c_buf_p) - b->yy_ch_buf);
  
  			if ( b->yy_is_our_buffer )
  				{
! 				yy_size_t new_size = b->yy_buf_size * 2;
  
  				if ( new_size <= 0 )
  					b->yy_buf_size += b->yy_buf_size / 8;
*************** static int yy_get_next_buffer (void)
*** 2148,2154 ****
  
  		/* Read in more data. */
  		YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
! 			(yy_n_chars), (size_t) num_to_read );
  
  		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
  		}
--- 2196,2202 ----
  
  		/* Read in more data. */
  		YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
! 			(yy_n_chars), num_to_read );
  
  		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
  		}
*************** static int yy_get_next_buffer (void)
*** 2193,2207 ****
  
      static yy_state_type yy_get_previous_state (void)
  {
! 	register yy_state_type yy_current_state;
! 	register char *yy_cp;
      
  	yy_current_state = (yy_start);
  	yy_current_state += YY_AT_BOL();
  
  	for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
  		{
! 		register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
  		if ( yy_accept[yy_current_state] )
  			{
  			(yy_last_accepting_state) = yy_current_state;
--- 2241,2255 ----
  
      static yy_state_type yy_get_previous_state (void)
  {
! 	yy_state_type yy_current_state;
! 	char *yy_cp;
      
  	yy_current_state = (yy_start);
  	yy_current_state += YY_AT_BOL();
  
  	for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
  		{
! 		YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
  		if ( yy_accept[yy_current_state] )
  			{
  			(yy_last_accepting_state) = yy_current_state;
*************** static int yy_get_next_buffer (void)
*** 2226,2235 ****
   */
      static yy_state_type yy_try_NUL_trans  (yy_state_type yy_current_state )
  {
! 	register int yy_is_jam;
!     	register char *yy_cp = (yy_c_buf_p);
  
! 	register YY_CHAR yy_c = 1;
  	if ( yy_accept[yy_current_state] )
  		{
  		(yy_last_accepting_state) = yy_current_state;
--- 2274,2283 ----
   */
      static yy_state_type yy_try_NUL_trans  (yy_state_type yy_current_state )
  {
! 	int yy_is_jam;
!     	char *yy_cp = (yy_c_buf_p);
  
! 	YY_CHAR yy_c = 1;
  	if ( yy_accept[yy_current_state] )
  		{
  		(yy_last_accepting_state) = yy_current_state;
*************** static int yy_get_next_buffer (void)
*** 2244,2252 ****
  	yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
  	yy_is_jam = (yy_current_state == 560);
  
! 	return yy_is_jam ? 0 : yy_current_state;
  }
  
  #ifndef YY_NO_INPUT
  #ifdef __cplusplus
      static int yyinput (void)
--- 2292,2304 ----
  	yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
  	yy_is_jam = (yy_current_state == 560);
  
! 		return yy_is_jam ? 0 : yy_current_state;
  }
  
+ #ifndef YY_NO_UNPUT
+ 
+ #endif
+ 
  #ifndef YY_NO_INPUT
  #ifdef __cplusplus
      static int yyinput (void)
*************** static int yy_get_next_buffer (void)
*** 2271,2277 ****
  
  		else
  			{ /* need more input */
! 			int offset = (yy_c_buf_p) - (yytext_ptr);
  			++(yy_c_buf_p);
  
  			switch ( yy_get_next_buffer(  ) )
--- 2323,2329 ----
  
  		else
  			{ /* need more input */
! 			yy_size_t offset = (yy_c_buf_p) - (yytext_ptr);
  			++(yy_c_buf_p);
  
  			switch ( yy_get_next_buffer(  ) )
*************** static void yy_load_buffer_state  (void)
*** 2398,2404 ****
  	if ( ! b )
  		YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
  
! 	b->yy_buf_size = size;
  
  	/* yy_ch_buf has to be 2 characters longer than the size given because
  	 * we need to put in 2 end-of-buffer characters.
--- 2450,2456 ----
  	if ( ! b )
  		YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
  
! 	b->yy_buf_size = (yy_size_t)size;
  
  	/* yy_ch_buf has to be 2 characters longer than the size given because
  	 * we need to put in 2 end-of-buffer characters.
*************** void yypop_buffer_state (void)
*** 2545,2551 ****
   */
  static void yyensure_buffer_stack (void)
  {
! 	int num_to_alloc;
      
  	if (!(yy_buffer_stack)) {
  
--- 2597,2603 ----
   */
  static void yyensure_buffer_stack (void)
  {
! 	yy_size_t num_to_alloc;
      
  	if (!(yy_buffer_stack)) {
  
*************** static void yyensure_buffer_stack (void)
*** 2553,2559 ****
  		 * scanner will even need a stack. We use 2 instead of 1 to avoid an
  		 * immediate realloc on the next call.
           */
! 		num_to_alloc = 1;
  		(yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
  								(num_to_alloc * sizeof(struct yy_buffer_state*)
  								);
--- 2605,2611 ----
  		 * scanner will even need a stack. We use 2 instead of 1 to avoid an
  		 * immediate realloc on the next call.
           */
!       num_to_alloc = 1; /* After all that talk, this was set to 1 anyways... */
  		(yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
  								(num_to_alloc * sizeof(struct yy_buffer_state*)
  								);
*************** static void yyensure_buffer_stack (void)
*** 2570,2576 ****
  	if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
  
  		/* Increase the buffer to prepare for a possible push. */
! 		int grow_size = 8 /* arbitrary grow size */;
  
  		num_to_alloc = (yy_buffer_stack_max) + grow_size;
  		(yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
--- 2622,2628 ----
  	if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
  
  		/* Increase the buffer to prepare for a possible push. */
! 		yy_size_t grow_size = 8 /* arbitrary grow size */;
  
  		num_to_alloc = (yy_buffer_stack_max) + grow_size;
  		(yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
*************** YY_BUFFER_STATE yy_scan_string (yyconst
*** 2637,2653 ****
  
  /** Setup the input buffer state to scan the given bytes. The next call to yylex() will
   * scan from a @e copy of @a bytes.
!  * @param bytes the byte buffer to scan
!  * @param len the number of bytes in the buffer pointed to by @a bytes.
   * 
   * @return the newly allocated buffer state object.
   */
! YY_BUFFER_STATE yy_scan_bytes  (yyconst char * yybytes, int  _yybytes_len )
  {
  	YY_BUFFER_STATE b;
  	char *buf;
  	yy_size_t n;
! 	int i;
      
  	/* Get memory for full buffer, including space for trailing EOB's. */
  	n = _yybytes_len + 2;
--- 2689,2705 ----
  
  /** Setup the input buffer state to scan the given bytes. The next call to yylex() will
   * scan from a @e copy of @a bytes.
!  * @param yybytes the byte buffer to scan
!  * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
   * 
   * @return the newly allocated buffer state object.
   */
! YY_BUFFER_STATE yy_scan_bytes  (yyconst char * yybytes, yy_size_t  _yybytes_len )
  {
  	YY_BUFFER_STATE b;
  	char *buf;
  	yy_size_t n;
! 	yy_size_t i;
      
  	/* Get memory for full buffer, including space for trailing EOB's. */
  	n = _yybytes_len + 2;
*************** YY_BUFFER_STATE yy_scan_bytes  (yyconst
*** 2678,2684 ****
  
  static void yy_fatal_error (yyconst char* msg )
  {
!     	(void) fprintf( stderr, "%s\n", msg );
  	exit( YY_EXIT_FAILURE );
  }
  
--- 2730,2736 ----
  
  static void yy_fatal_error (yyconst char* msg )
  {
! 			(void) fprintf( stderr, "%s\n", msg );
  	exit( YY_EXIT_FAILURE );
  }
  
*************** static void yy_fatal_error (yyconst char
*** 2689,2695 ****
  	do \
  		{ \
  		/* Undo effects of setting up yytext. */ \
!         int yyless_macro_arg = (n); \
          YY_LESS_LINENO(yyless_macro_arg);\
  		yytext[yyleng] = (yy_hold_char); \
  		(yy_c_buf_p) = yytext + yyless_macro_arg; \
--- 2741,2747 ----
  	do \
  		{ \
  		/* Undo effects of setting up yytext. */ \
!         yy_size_t yyless_macro_arg = (n); \
          YY_LESS_LINENO(yyless_macro_arg);\
  		yytext[yyleng] = (yy_hold_char); \
  		(yy_c_buf_p) = yytext + yyless_macro_arg; \
*************** FILE *yyget_out  (void)
*** 2729,2735 ****
  /** Get the length of the current token.
   * 
   */
! int yyget_leng  (void)
  {
          return yyleng;
  }
--- 2781,2787 ----
  /** Get the length of the current token.
   * 
   */
! yy_size_t yyget_leng  (void)
  {
          return yyleng;
  }
*************** char *yyget_text  (void)
*** 2744,2772 ****
  }
  
  /** Set the current line number.
!  * @param line_number
   * 
   */
! void yyset_lineno (int  line_number )
  {
      
!     yylineno = line_number;
  }
  
  /** Set the input stream. This does not discard the current
   * input buffer.
!  * @param in_str A readable stream.
   * 
   * @see yy_switch_to_buffer
   */
! void yyset_in (FILE *  in_str )
  {
!         yyin = in_str ;
  }
  
! void yyset_out (FILE *  out_str )
  {
!         yyout = out_str ;
  }
  
  int yyget_debug  (void)
--- 2796,2824 ----
  }
  
  /** Set the current line number.
!  * @param _line_number line number
   * 
   */
! void yyset_lineno (int  _line_number )
  {
      
!     yylineno = _line_number;
  }
  
  /** Set the input stream. This does not discard the current
   * input buffer.
!  * @param _in_str A readable stream.
   * 
   * @see yy_switch_to_buffer
   */
! void yyset_in (FILE *  _in_str )
  {
!         yyin = _in_str ;
  }
  
! void yyset_out (FILE *  _out_str )
  {
!         yyout = _out_str ;
  }
  
  int yyget_debug  (void)
*************** int yyget_debug  (void)
*** 2774,2782 ****
          return yy_flex_debug;
  }
  
! void yyset_debug (int  bdebug )
  {
!         yy_flex_debug = bdebug ;
  }
  
  static int yy_init_globals (void)
--- 2826,2834 ----
          return yy_flex_debug;
  }
  
! void yyset_debug (int  _bdebug )
  {
!         yy_flex_debug = _bdebug ;
  }
  
  static int yy_init_globals (void)
*************** int yylex_destroy  (void)
*** 2836,2842 ****
  #ifndef yytext_ptr
  static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
  {
! 	register int i;
  	for ( i = 0; i < n; ++i )
  		s1[i] = s2[i];
  }
--- 2888,2895 ----
  #ifndef yytext_ptr
  static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
  {
! 		
! 	int i;
  	for ( i = 0; i < n; ++i )
  		s1[i] = s2[i];
  }
*************** static void yy_flex_strncpy (char* s1, y
*** 2845,2851 ****
  #ifdef YY_NEED_STRLEN
  static int yy_flex_strlen (yyconst char * s )
  {
! 	register int n;
  	for ( n = 0; s[n]; ++n )
  		;
  
--- 2898,2904 ----
  #ifdef YY_NEED_STRLEN
  static int yy_flex_strlen (yyconst char * s )
  {
! 	int n;
  	for ( n = 0; s[n]; ++n )
  		;
  
*************** static int yy_flex_strlen (yyconst char
*** 2855,2865 ****
  
  void *yyalloc (yy_size_t  size )
  {
! 	return (void *) malloc( size );
  }
  
  void *yyrealloc  (void * ptr, yy_size_t  size )
  {
  	/* The cast to (char *) in the following accommodates both
  	 * implementations that use char* generic pointers, and those
  	 * that use void* generic pointers.  It works with the latter
--- 2908,2919 ----
  
  void *yyalloc (yy_size_t  size )
  {
! 			return (void *) malloc( size );
  }
  
  void *yyrealloc  (void * ptr, yy_size_t  size )
  {
+ 		
  	/* The cast to (char *) in the following accommodates both
  	 * implementations that use char* generic pointers, and those
  	 * that use void* generic pointers.  It works with the latter
*************** void *yyrealloc  (void * ptr, yy_size_t
*** 2872,2883 ****
  
  void yyfree (void * ptr )
  {
! 	free( (char *) ptr );	/* see yyrealloc() for (char *) cast */
  }
  
  #define YYTABLES_NAME "yytables"
  
! #line 199 "/space/rguenther/gcc-5.4.0/gcc-5.4.0/gcc/gengtype-lex.l"
  
  
  
--- 2926,2937 ----
  
  void yyfree (void * ptr )
  {
! 			free( (char *) ptr );	/* see yyrealloc() for (char *) cast */
  }
  
  #define YYTABLES_NAME "yytables"
  
! #line 199 "/d/gcc-5.5.0/gcc-5.5.0/gcc/gengtype-lex.l"
  
  
  
diff -Nrcpad gcc-5.4.0/gcc/genmatch.c gcc-5.5.0/gcc/genmatch.c
*** gcc-5.4.0/gcc/genmatch.c	Tue Jul 21 14:04:12 2015
--- gcc-5.5.0/gcc/genmatch.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 22,28 ****
  <http://www.gnu.org/licenses/>.  */
  
  #include "bconfig.h"
- #include <new>
  #include "system.h"
  #include "coretypes.h"
  #include "ggc.h"
--- 22,27 ----
diff -Nrcpad gcc-5.4.0/gcc/gimple-fold.c gcc-5.5.0/gcc/gimple-fold.c
*** gcc-5.4.0/gcc/gimple-fold.c	Tue Nov 24 15:34:29 2015
--- gcc-5.5.0/gcc/gimple-fold.c	Mon Sep 18 13:14:45 2017
*************** gimple_fold_builtin_memory_op (gimple_st
*** 948,968 ****
  	    {
  	      tree src_base, dest_base, fn;
  	      HOST_WIDE_INT src_offset = 0, dest_offset = 0;
! 	      HOST_WIDE_INT size = -1;
! 	      HOST_WIDE_INT maxsize = -1;
  
  	      srcvar = TREE_OPERAND (src, 0);
! 	      src_base = get_ref_base_and_extent (srcvar, &src_offset,
! 						  &size, &maxsize);
  	      destvar = TREE_OPERAND (dest, 0);
! 	      dest_base = get_ref_base_and_extent (destvar, &dest_offset,
! 						   &size, &maxsize);
  	      if (tree_fits_uhwi_p (len))
  		maxsize = tree_to_uhwi (len);
  	      else
  		maxsize = -1;
- 	      src_offset /= BITS_PER_UNIT;
- 	      dest_offset /= BITS_PER_UNIT;
  	      if (SSA_VAR_P (src_base)
  		  && SSA_VAR_P (dest_base))
  		{
--- 948,968 ----
  	    {
  	      tree src_base, dest_base, fn;
  	      HOST_WIDE_INT src_offset = 0, dest_offset = 0;
! 	      HOST_WIDE_INT maxsize;
  
  	      srcvar = TREE_OPERAND (src, 0);
! 	      src_base = get_addr_base_and_unit_offset (srcvar, &src_offset);
! 	      if (src_base == NULL)
! 		src_base = srcvar;
  	      destvar = TREE_OPERAND (dest, 0);
! 	      dest_base = get_addr_base_and_unit_offset (destvar,
! 							 &dest_offset);
! 	      if (dest_base == NULL)
! 		dest_base = destvar;
  	      if (tree_fits_uhwi_p (len))
  		maxsize = tree_to_uhwi (len);
  	      else
  		maxsize = -1;
  	      if (SSA_VAR_P (src_base)
  		  && SSA_VAR_P (dest_base))
  		{
*************** fold_ctor_reference (tree type, tree cto
*** 5483,5491 ****
        && !compare_tree_int (TYPE_SIZE (TREE_TYPE (ctor)), size))
      {
        ret = canonicalize_constructor_val (unshare_expr (ctor), from_decl);
-       ret = fold_unary (VIEW_CONVERT_EXPR, type, ret);
        if (ret)
! 	STRIP_USELESS_TYPE_CONVERSION (ret);
        return ret;
      }
    /* For constants and byte-aligned/sized reads try to go through
--- 5483,5494 ----
        && !compare_tree_int (TYPE_SIZE (TREE_TYPE (ctor)), size))
      {
        ret = canonicalize_constructor_val (unshare_expr (ctor), from_decl);
        if (ret)
! 	{
! 	  ret = fold_unary (VIEW_CONVERT_EXPR, type, ret);
! 	  if (ret)
! 	    STRIP_USELESS_TYPE_CONVERSION (ret);
! 	}
        return ret;
      }
    /* For constants and byte-aligned/sized reads try to go through
diff -Nrcpad gcc-5.4.0/gcc/gimple-ssa-strength-reduction.c gcc-5.5.0/gcc/gimple-ssa-strength-reduction.c
*** gcc-5.4.0/gcc/gimple-ssa-strength-reduction.c	Mon Jan 18 02:46:58 2016
--- gcc-5.5.0/gcc/gimple-ssa-strength-reduction.c	Mon Oct  2 18:10:40 2017
*************** find_phi_def (tree base)
*** 508,514 ****
  
    c = base_cand_from_table (base);
  
!   if (!c || c->kind != CAND_PHI)
      return 0;
  
    return c->cand_num;
--- 508,515 ----
  
    c = base_cand_from_table (base);
  
!   if (!c || c->kind != CAND_PHI
!       || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (gimple_phi_result (c->cand_stmt)))
      return 0;
  
    return c->cand_num;
*************** find_basis_for_base_expr (slsr_cand_t c,
*** 546,551 ****
--- 547,557 ----
  			      gimple_bb (one_basis->cand_stmt)))
  	continue;
  
+       tree lhs = gimple_assign_lhs (one_basis->cand_stmt);
+       if (lhs && TREE_CODE (lhs) == SSA_NAME
+ 	  && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs))
+ 	continue;
+ 
        if (!basis || basis->cand_num < one_basis->cand_num)
  	basis = one_basis;
      }
*************** replace_ref (tree *expr, slsr_cand_t c)
*** 1918,1924 ****
    if (align < TYPE_ALIGN (acc_type))
      acc_type = build_aligned_type (acc_type, align);
  
!   add_expr = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (c->base_expr),
  			  c->base_expr, c->stride);
    mem_ref = fold_build2 (MEM_REF, acc_type, add_expr,
  			 wide_int_to_tree (c->cand_type, c->index));
--- 1924,1930 ----
    if (align < TYPE_ALIGN (acc_type))
      acc_type = build_aligned_type (acc_type, align);
  
!   add_expr = fold_build2 (POINTER_PLUS_EXPR, c->cand_type,
  			  c->base_expr, c->stride);
    mem_ref = fold_build2 (MEM_REF, acc_type, add_expr,
  			 wide_int_to_tree (c->cand_type, c->index));
*************** replace_mult_candidate (slsr_cand_t c, t
*** 2041,2131 ****
    tree target_type = TREE_TYPE (gimple_assign_lhs (c->cand_stmt));
    enum tree_code cand_code = gimple_assign_rhs_code (c->cand_stmt);
  
!   /* It is highly unlikely, but possible, that the resulting
!      bump doesn't fit in a HWI.  Abandon the replacement
!      in this case.  This does not affect siblings or dependents
!      of C.  Restriction to signed HWI is conservative for unsigned
!      types but allows for safe negation without twisted logic.  */
!   if (wi::fits_shwi_p (bump)
!       && bump.to_shwi () != HOST_WIDE_INT_MIN
!       /* It is not useful to replace casts, copies, or adds of
! 	 an SSA name and a constant.  */
!       && cand_code != MODIFY_EXPR
!       && !CONVERT_EXPR_CODE_P (cand_code)
!       && cand_code != PLUS_EXPR
!       && cand_code != POINTER_PLUS_EXPR
!       && cand_code != MINUS_EXPR)
      {
!       enum tree_code code = PLUS_EXPR;
!       tree bump_tree;
!       gimple stmt_to_print = NULL;
  
!       /* If the basis name and the candidate's LHS have incompatible
! 	 types, introduce a cast.  */
!       if (!useless_type_conversion_p (target_type, TREE_TYPE (basis_name)))
! 	basis_name = introduce_cast_before_cand (c, target_type, basis_name);
!       if (wi::neg_p (bump))
! 	{
! 	  code = MINUS_EXPR;
! 	  bump = -bump;
! 	}
  
!       bump_tree = wide_int_to_tree (target_type, bump);
  
!       if (dump_file && (dump_flags & TDF_DETAILS))
! 	{
! 	  fputs ("Replacing: ", dump_file);
! 	  print_gimple_stmt (dump_file, c->cand_stmt, 0, 0);
! 	}
  
!       if (bump == 0)
  	{
- 	  tree lhs = gimple_assign_lhs (c->cand_stmt);
- 	  gassign *copy_stmt = gimple_build_assign (lhs, basis_name);
- 	  gimple_stmt_iterator gsi = gsi_for_stmt (c->cand_stmt);
- 	  gimple_set_location (copy_stmt, gimple_location (c->cand_stmt));
- 	  gsi_replace (&gsi, copy_stmt, false);
- 	  c->cand_stmt = copy_stmt;
  	  if (dump_file && (dump_flags & TDF_DETAILS))
! 	    stmt_to_print = copy_stmt;
  	}
        else
  	{
! 	  tree rhs1, rhs2;
! 	  if (cand_code != NEGATE_EXPR) {
! 	    rhs1 = gimple_assign_rhs1 (c->cand_stmt);
! 	    rhs2 = gimple_assign_rhs2 (c->cand_stmt);
! 	  }
! 	  if (cand_code != NEGATE_EXPR
! 	      && ((operand_equal_p (rhs1, basis_name, 0)
! 		   && operand_equal_p (rhs2, bump_tree, 0))
! 		  || (operand_equal_p (rhs1, bump_tree, 0)
! 		      && operand_equal_p (rhs2, basis_name, 0))))
! 	    {
! 	      if (dump_file && (dump_flags & TDF_DETAILS))
! 		{
! 		  fputs ("(duplicate, not actually replacing)", dump_file);
! 		  stmt_to_print = c->cand_stmt;
! 		}
! 	    }
! 	  else
! 	    {
! 	      gimple_stmt_iterator gsi = gsi_for_stmt (c->cand_stmt);
! 	      gimple_assign_set_rhs_with_ops (&gsi, code,
! 					      basis_name, bump_tree);
! 	      update_stmt (gsi_stmt (gsi));
!               c->cand_stmt = gsi_stmt (gsi);
! 	      if (dump_file && (dump_flags & TDF_DETAILS))
! 		stmt_to_print = gsi_stmt (gsi);
! 	    }
  	}
    
!       if (dump_file && (dump_flags & TDF_DETAILS))
! 	{
! 	  fputs ("With: ", dump_file);
! 	  print_gimple_stmt (dump_file, stmt_to_print, 0, 0);
! 	  fputs ("\n", dump_file);
!   	}
      }
  }
  
--- 2047,2138 ----
    tree target_type = TREE_TYPE (gimple_assign_lhs (c->cand_stmt));
    enum tree_code cand_code = gimple_assign_rhs_code (c->cand_stmt);
  
!   /* It is not useful to replace casts, copies, negates, or adds of
!      an SSA name and a constant.  */
!   if (cand_code == MODIFY_EXPR
!       || CONVERT_EXPR_CODE_P (cand_code)
!       || cand_code == PLUS_EXPR
!       || cand_code == POINTER_PLUS_EXPR
!       || cand_code == MINUS_EXPR
!       || cand_code == NEGATE_EXPR)
!     return;
! 
!   enum tree_code code = PLUS_EXPR;
!   tree bump_tree;
!   gimple stmt_to_print = NULL;
! 
!   /* If the basis name and the candidate's LHS have incompatible
!      types, introduce a cast.  */
!   if (!useless_type_conversion_p (target_type, TREE_TYPE (basis_name)))
!     basis_name = introduce_cast_before_cand (c, target_type, basis_name);
!   if (wi::neg_p (bump))
      {
!       code = MINUS_EXPR;
!       bump = -bump;
!     }
  
!  /* It is possible that the resulting bump doesn't fit in target_type.
!     Abandon the replacement in this case.  This does not affect
!     siblings or dependents of C.  */
!   if (bump != wi::ext (bump, TYPE_PRECISION (target_type),
! 		       TYPE_SIGN (target_type)))
!     return;
  
!   bump_tree = wide_int_to_tree (target_type, bump);
  
!   if (dump_file && (dump_flags & TDF_DETAILS))
!     {
!       fputs ("Replacing: ", dump_file);
!       print_gimple_stmt (dump_file, c->cand_stmt, 0, 0);
!     }
  
!   if (bump == 0)
!     {
!       tree lhs = gimple_assign_lhs (c->cand_stmt);
!       gassign *copy_stmt = gimple_build_assign (lhs, basis_name);
!       gimple_stmt_iterator gsi = gsi_for_stmt (c->cand_stmt);
!       gimple_set_location (copy_stmt, gimple_location (c->cand_stmt));
!       gsi_replace (&gsi, copy_stmt, false);
!       c->cand_stmt = copy_stmt;
!       if (dump_file && (dump_flags & TDF_DETAILS))
! 	stmt_to_print = copy_stmt;
!     }
!   else
!     {
!       tree rhs1, rhs2;
!       if (cand_code != NEGATE_EXPR) {
! 	rhs1 = gimple_assign_rhs1 (c->cand_stmt);
! 	rhs2 = gimple_assign_rhs2 (c->cand_stmt);
!       }
!       if (cand_code != NEGATE_EXPR
! 	  && ((operand_equal_p (rhs1, basis_name, 0)
! 	       && operand_equal_p (rhs2, bump_tree, 0))
! 	      || (operand_equal_p (rhs1, bump_tree, 0)
! 		  && operand_equal_p (rhs2, basis_name, 0))))
  	{
  	  if (dump_file && (dump_flags & TDF_DETAILS))
! 	    {
! 	      fputs ("(duplicate, not actually replacing)", dump_file);
! 	      stmt_to_print = c->cand_stmt;
! 	    }
  	}
        else
  	{
! 	  gimple_stmt_iterator gsi = gsi_for_stmt (c->cand_stmt);
! 	  gimple_assign_set_rhs_with_ops (&gsi, code,
! 					  basis_name, bump_tree);
! 	  update_stmt (gsi_stmt (gsi));
! 	  c->cand_stmt = gsi_stmt (gsi);
! 	  if (dump_file && (dump_flags & TDF_DETAILS))
! 	    stmt_to_print = gsi_stmt (gsi);
  	}
+     }
    
!   if (dump_file && (dump_flags & TDF_DETAILS))
!     {
!       fputs ("With: ", dump_file);
!       print_gimple_stmt (dump_file, stmt_to_print, 0, 0);
!       fputs ("\n", dump_file);
      }
  }
  
*************** create_add_on_incoming_edge (slsr_cand_t
*** 2177,2184 ****
  			     widest_int increment, edge e, location_t loc,
  			     bool known_stride)
  {
-   basic_block insert_bb;
-   gimple_stmt_iterator gsi;
    tree lhs, basis_type;
    gassign *new_stmt;
  
--- 2184,2189 ----
*************** create_add_on_incoming_edge (slsr_cand_t
*** 2191,2225 ****
    basis_type = TREE_TYPE (basis_name);
    lhs = make_temp_ssa_name (basis_type, NULL, "slsr");
  
    if (known_stride)
      {
        tree bump_tree;
!       enum tree_code code = PLUS_EXPR;
        widest_int bump = increment * wi::to_widest (c->stride);
!       if (wi::neg_p (bump))
  	{
  	  code = MINUS_EXPR;
  	  bump = -bump;
  	}
  
!       bump_tree = wide_int_to_tree (basis_type, bump);
        new_stmt = gimple_build_assign (lhs, code, basis_name, bump_tree);
      }
    else
      {
        int i;
!       bool negate_incr = (!address_arithmetic_p && wi::neg_p (increment));
        i = incr_vec_index (negate_incr ? -increment : increment);
        gcc_assert (i >= 0);
  
        if (incr_vec[i].initializer)
  	{
! 	  enum tree_code code = negate_incr ? MINUS_EXPR : PLUS_EXPR;
  	  new_stmt = gimple_build_assign (lhs, code, basis_name,
  					  incr_vec[i].initializer);
  	}
        else if (increment == 1)
! 	new_stmt = gimple_build_assign (lhs, PLUS_EXPR, basis_name, c->stride);
        else if (increment == -1)
  	new_stmt = gimple_build_assign (lhs, MINUS_EXPR, basis_name,
  					c->stride);
--- 2196,2236 ----
    basis_type = TREE_TYPE (basis_name);
    lhs = make_temp_ssa_name (basis_type, NULL, "slsr");
  
+   /* Occasionally people convert integers to pointers without a 
+      cast, leading us into trouble if we aren't careful.  */
+   enum tree_code plus_code
+     = POINTER_TYPE_P (basis_type) ? POINTER_PLUS_EXPR : PLUS_EXPR;
+ 
    if (known_stride)
      {
        tree bump_tree;
!       enum tree_code code = plus_code;
        widest_int bump = increment * wi::to_widest (c->stride);
!       if (wi::neg_p (bump) && !POINTER_TYPE_P (basis_type))
  	{
  	  code = MINUS_EXPR;
  	  bump = -bump;
  	}
  
!       tree stride_type = POINTER_TYPE_P (basis_type) ? sizetype : basis_type;
!       bump_tree = wide_int_to_tree (stride_type, bump);
        new_stmt = gimple_build_assign (lhs, code, basis_name, bump_tree);
      }
    else
      {
        int i;
!       bool negate_incr = !POINTER_TYPE_P (basis_type) && wi::neg_p (increment);
        i = incr_vec_index (negate_incr ? -increment : increment);
        gcc_assert (i >= 0);
  
        if (incr_vec[i].initializer)
  	{
! 	  enum tree_code code = negate_incr ? MINUS_EXPR : plus_code;
  	  new_stmt = gimple_build_assign (lhs, code, basis_name,
  					  incr_vec[i].initializer);
  	}
        else if (increment == 1)
! 	new_stmt = gimple_build_assign (lhs, plus_code, basis_name, c->stride);
        else if (increment == -1)
  	new_stmt = gimple_build_assign (lhs, MINUS_EXPR, basis_name,
  					c->stride);
*************** create_add_on_incoming_edge (slsr_cand_t
*** 2227,2245 ****
  	gcc_unreachable ();
      }
  
-   insert_bb = single_succ_p (e->src) ? e->src : split_edge (e);
-   gsi = gsi_last_bb (insert_bb);
- 
-   if (!gsi_end_p (gsi) && is_ctrl_stmt (gsi_stmt (gsi)))
-     gsi_insert_before (&gsi, new_stmt, GSI_NEW_STMT);
-   else
-     gsi_insert_after (&gsi, new_stmt, GSI_NEW_STMT);
- 
    gimple_set_location (new_stmt, loc);
  
    if (dump_file && (dump_flags & TDF_DETAILS))
      {
!       fprintf (dump_file, "Inserting in block %d: ", insert_bb->index);
        print_gimple_stmt (dump_file, new_stmt, 0, 0);
      }
  
--- 2238,2250 ----
  	gcc_unreachable ();
      }
  
    gimple_set_location (new_stmt, loc);
+   gsi_insert_on_edge (e, new_stmt);
  
    if (dump_file && (dump_flags & TDF_DETAILS))
      {
!       fprintf (dump_file, "Inserting on edge %d->%d: ", e->src->index,
! 	       e->dest->index);
        print_gimple_stmt (dump_file, new_stmt, 0, 0);
      }
  
*************** record_increment (slsr_cand_t c, widest_
*** 2538,2550 ****
        /* Optimistically record the first occurrence of this increment
  	 as providing an initializer (if it does); we will revise this
  	 opinion later if it doesn't dominate all other occurrences.
!          Exception:  increments of -1, 0, 1 never need initializers;
  	 and phi adjustments don't ever provide initializers.  */
        if (c->kind == CAND_ADD
  	  && !is_phi_adjust
  	  && c->index == increment
  	  && (wi::gts_p (increment, 1)
! 	      || wi::lts_p (increment, -1))
  	  && (gimple_assign_rhs_code (c->cand_stmt) == PLUS_EXPR
  	      || gimple_assign_rhs_code (c->cand_stmt) == POINTER_PLUS_EXPR))
  	{
--- 2543,2555 ----
        /* Optimistically record the first occurrence of this increment
  	 as providing an initializer (if it does); we will revise this
  	 opinion later if it doesn't dominate all other occurrences.
! 	 Exception:  increments of 0, 1 never need initializers;
  	 and phi adjustments don't ever provide initializers.  */
        if (c->kind == CAND_ADD
  	  && !is_phi_adjust
  	  && c->index == increment
  	  && (wi::gts_p (increment, 1)
! 	      || wi::lts_p (increment, 0))
  	  && (gimple_assign_rhs_code (c->cand_stmt) == PLUS_EXPR
  	      || gimple_assign_rhs_code (c->cand_stmt) == POINTER_PLUS_EXPR))
  	{
*************** analyze_increments (slsr_cand_t first_de
*** 2854,2863 ****
        else if (incr == 0
  	       || incr == 1
  	       || (incr == -1
! 		   && (gimple_assign_rhs_code (first_dep->cand_stmt)
! 		       != POINTER_PLUS_EXPR)))
  	incr_vec[i].cost = COST_NEUTRAL;
!       
        /* FORNOW: If we need to add an initializer, give up if a cast from
  	 the candidate's type to its stride's type can lose precision.
  	 This could eventually be handled better by expressly retaining the
--- 2859,2867 ----
        else if (incr == 0
  	       || incr == 1
  	       || (incr == -1
! 		   && !POINTER_TYPE_P (first_dep->cand_type)))
  	incr_vec[i].cost = COST_NEUTRAL;
! 
        /* FORNOW: If we need to add an initializer, give up if a cast from
  	 the candidate's type to its stride's type can lose precision.
  	 This could eventually be handled better by expressly retaining the
*************** insert_initializers (slsr_cand_t c)
*** 3144,3150 ****
        if (!profitable_increment_p (i)
  	  || incr == 1
  	  || (incr == -1
! 	      && gimple_assign_rhs_code (c->cand_stmt) != POINTER_PLUS_EXPR)
  	  || incr == 0)
  	continue;
  
--- 3148,3154 ----
        if (!profitable_increment_p (i)
  	  || incr == 1
  	  || (incr == -1
! 	      && (!POINTER_TYPE_P (lookup_cand (c->basis)->cand_type)))
  	  || incr == 0)
  	continue;
  
*************** insert_initializers (slsr_cand_t c)
*** 3167,3172 ****
--- 3171,3193 ----
  	 that block, the earliest one will be returned in WHERE.  */
        bb = nearest_common_dominator_for_cands (c, incr, &where);
  
+       /* If the NCD is not dominated by the block containing the
+ 	 definition of the stride, we can't legally insert a
+ 	 single initializer.  Mark the increment as unprofitable
+ 	 so we don't make any replacements.  FIXME: Multiple
+ 	 initializers could be placed with more analysis.  */
+       gimple stride_def = SSA_NAME_DEF_STMT (c->stride);
+       basic_block stride_bb = gimple_bb (stride_def);
+ 
+       if (stride_bb && !dominated_by_p (CDI_DOMINATORS, bb, stride_bb))
+ 	{
+ 	  if (dump_file && (dump_flags & TDF_DETAILS))
+ 	    fprintf (dump_file,
+ 		     "Initializer #%d cannot be legally placed\n", i);
+ 	  incr_vec[i].cost = COST_INFINITE;
+ 	  continue;
+ 	}
+ 
        /* Create a new SSA name to hold the initializer's value.  */
        stride_type = TREE_TYPE (c->stride);
        new_name = make_temp_ssa_name (stride_type, NULL, "slsr");
*************** analyze_candidates_and_replace (void)
*** 3608,3613 ****
--- 3629,3638 ----
  	  free (incr_vec);
  	}
      }
+ 
+   /* For conditional candidates, we may have uncommitted insertions
+      on edges to clean up.  */
+   gsi_commit_edge_inserts ();
  }
  
  namespace {
diff -Nrcpad gcc-5.4.0/gcc/gimplify.c gcc-5.5.0/gcc/gimplify.c
*** gcc-5.4.0/gcc/gimplify.c	Wed Feb 10 18:38:42 2016
--- gcc-5.5.0/gcc/gimplify.c	Tue May 30 08:17:18 2017
*************** gimplify_init_constructor (tree *expr_p,
*** 4095,4101 ****
  	  }
  
  	/* Vector types use CONSTRUCTOR all the way through gimple
! 	  compilation as a general initializer.  */
  	FOR_EACH_VEC_SAFE_ELT (elts, ix, ce)
  	  {
  	    enum gimplify_status tret;
--- 4095,4101 ----
  	  }
  
  	/* Vector types use CONSTRUCTOR all the way through gimple
! 	   compilation as a general initializer.  */
  	FOR_EACH_VEC_SAFE_ELT (elts, ix, ce)
  	  {
  	    enum gimplify_status tret;
*************** gimplify_init_constructor (tree *expr_p,
*** 4103,4108 ****
--- 4103,4112 ----
  				  fb_rvalue);
  	    if (tret == GS_ERROR)
  	      ret = GS_ERROR;
+ 	    else if (TREE_STATIC (ctor)
+ 		     && !initializer_constant_valid_p (ce->value,
+ 						       TREE_TYPE (ce->value)))
+ 	      TREE_STATIC (ctor) = 0;
  	  }
  	if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
  	  TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
*************** gimplify_init_constructor (tree *expr_p,
*** 4116,4139 ****
  
    if (ret == GS_ERROR)
      return GS_ERROR;
!   else if (want_value)
      {
        *expr_p = object;
        return GS_OK;
      }
    else
      {
!       /* If we have gimplified both sides of the initializer but have
! 	 not emitted an assignment, do so now.  */
!       if (*expr_p)
! 	{
! 	  tree lhs = TREE_OPERAND (*expr_p, 0);
! 	  tree rhs = TREE_OPERAND (*expr_p, 1);
! 	  gassign *init = gimple_build_assign (lhs, rhs);
! 	  gimplify_seq_add_stmt (pre_p, init);
! 	  *expr_p = NULL;
! 	}
! 
        return GS_ALL_DONE;
      }
  }
--- 4120,4142 ----
  
    if (ret == GS_ERROR)
      return GS_ERROR;
!   /* If we have gimplified both sides of the initializer but have
!      not emitted an assignment, do so now.  */
!   if (*expr_p)
!     {
!       tree lhs = TREE_OPERAND (*expr_p, 0);
!       tree rhs = TREE_OPERAND (*expr_p, 1);
!       gassign *init = gimple_build_assign (lhs, rhs);
!       gimplify_seq_add_stmt (pre_p, init);
!     }
!   if (want_value)
      {
        *expr_p = object;
        return GS_OK;
      }
    else
      {
!       *expr_p = NULL;
        return GS_ALL_DONE;
      }
  }
*************** gimplify_modify_expr_rhs (tree *expr_p,
*** 4290,4295 ****
--- 4293,4306 ----
  	      if (ret != GS_ERROR)
  		ret = GS_OK;
  
+ 	      /* If we are going to write RESULT more than once, clear
+ 		 TREE_READONLY flag, otherwise we might incorrectly promote
+ 		 the variable to static const and initialize it at compile
+ 		 time in one of the branches.  */
+ 	      if (VAR_P (result)
+ 		  && TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node
+ 		  && TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
+ 		TREE_READONLY (result) = 0;
  	      if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
  		TREE_OPERAND (cond, 1)
  		  = build2 (code, void_type_node, result,
*************** gimplify_function_tree (tree fndecl)
*** 9425,9430 ****
--- 9436,9445 ----
    /* ??? Add some way to ignore exceptions for this TFE.  */
    if (flag_instrument_function_entry_exit
        && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
+       /* Do not instrument extern inline functions.  */
+       && !(DECL_DECLARED_INLINE_P (fndecl)
+ 	   && DECL_EXTERNAL (fndecl)
+ 	   && DECL_DISREGARD_INLINE_LIMITS (fndecl))
        && !flag_instrument_functions_exclude_p (fndecl))
      {
        tree x;
diff -Nrcpad gcc-5.4.0/gcc/go/ChangeLog gcc-5.5.0/gcc/go/ChangeLog
*** gcc-5.4.0/gcc/go/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/go/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/graphite-isl-ast-to-gimple.c gcc-5.5.0/gcc/graphite-isl-ast-to-gimple.c
*** gcc-5.4.0/gcc/graphite-isl-ast-to-gimple.c	Mon Oct 12 10:59:21 2015
--- gcc-5.5.0/gcc/graphite-isl-ast-to-gimple.c	Mon Sep 25 23:49:58 2017
*************** extern "C" {
*** 38,43 ****
--- 38,44 ----
  #endif
  #endif
  
+ #define INCLUDE_MAP
  #include "system.h"
  #include "coretypes.h"
  #include "hash-set.h"
*************** extern "C" {
*** 75,81 ****
  #include "tree-scalar-evolution.h"
  #include "gimple-ssa.h"
  #include "tree-into-ssa.h"
- #include <map>
  
  #ifdef HAVE_isl
  #include "graphite-poly.h"
--- 76,81 ----
diff -Nrcpad gcc-5.4.0/gcc/incpath.c gcc-5.5.0/gcc/incpath.c
*** gcc-5.4.0/gcc/incpath.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/incpath.c	Mon Nov  7 18:35:50 2016
*************** remove_duplicates (cpp_reader *pfile, st
*** 255,262 ****
  
        if (stat (cur->name, &st))
  	{
! 	  /* Dirs that don't exist are silently ignored, unless verbose.  */
! 	  if (errno != ENOENT)
  	    cpp_errno (pfile, CPP_DL_ERROR, cur->name);
  	  else
  	    {
--- 255,263 ----
  
        if (stat (cur->name, &st))
  	{
! 	  /* Dirs that don't exist or have denied permissions are 
! 	     silently ignored, unless verbose.  */
! 	  if ((errno != ENOENT) && (errno != EPERM))
  	    cpp_errno (pfile, CPP_DL_ERROR, cur->name);
  	  else
  	    {
diff -Nrcpad gcc-5.4.0/gcc/internal-fn.c gcc-5.5.0/gcc/internal-fn.c
*** gcc-5.4.0/gcc/internal-fn.c	Thu Jan 15 22:58:42 2015
--- gcc-5.5.0/gcc/internal-fn.c	Tue May 30 07:23:20 2017
*************** expand_arith_overflow (enum tree_code co
*** 1786,1792 ****
  	    {
  	    case MINUS_EXPR:
  	      if (integer_zerop (arg0) && !unsr_p)
! 		expand_neg_overflow (loc, lhs, arg1, false);
  	      /* FALLTHRU */
  	    case PLUS_EXPR:
  	      expand_addsub_overflow (loc, code, lhs, arg0, arg1,
--- 1786,1795 ----
  	    {
  	    case MINUS_EXPR:
  	      if (integer_zerop (arg0) && !unsr_p)
! 		{
! 		  expand_neg_overflow (loc, lhs, arg1, false);
! 		  return;
! 		}
  	      /* FALLTHRU */
  	    case PLUS_EXPR:
  	      expand_addsub_overflow (loc, code, lhs, arg0, arg1,
diff -Nrcpad gcc-5.4.0/gcc/ipa-comdats.c gcc-5.5.0/gcc/ipa-comdats.c
*** gcc-5.4.0/gcc/ipa-comdats.c	Wed Apr  8 13:45:20 2015
--- gcc-5.5.0/gcc/ipa-comdats.c	Tue Jan 24 11:30:44 2017
*************** public:
*** 433,439 ****
  bool
  pass_ipa_comdats::gate (function *)
  {
!   return optimize;
  }
  
  } // anon namespace
--- 433,439 ----
  bool
  pass_ipa_comdats::gate (function *)
  {
!   return HAVE_COMDAT_GROUP && optimize;
  }
  
  } // anon namespace
diff -Nrcpad gcc-5.4.0/gcc/ipa-cp.c gcc-5.5.0/gcc/ipa-cp.c
*** gcc-5.4.0/gcc/ipa-cp.c	Mon Dec 14 16:31:26 2015
--- gcc-5.5.0/gcc/ipa-cp.c	Mon May 29 09:10:58 2017
*************** determine_versionability (struct cgraph_
*** 514,519 ****
--- 514,525 ----
       decloned constructors, inlining is always better anyway.  */
    else if (node->comdat_local_p ())
      reason = "comdat-local function";
+   else if (node->calls_comdat_local)
+     {
+       /* TODO: call is versionable if we make sure that all
+ 	 callers are inside of a comdat group.  */
+       reason = "calls comdat-local function";
+     }
  
    if (reason && dump_file && !node->alias && !node->thunk.thunk_p)
      fprintf (dump_file, "Function %s/%i is not versionable, reason: %s.\n",
diff -Nrcpad gcc-5.4.0/gcc/ipa-devirt.c gcc-5.5.0/gcc/ipa-devirt.c
*** gcc-5.4.0/gcc/ipa-devirt.c	Thu Dec 10 08:38:07 2015
--- gcc-5.5.0/gcc/ipa-devirt.c	Thu Jun 22 11:29:22 2017
*************** odr_types_equivalent_p (tree t1, tree t2
*** 1459,1465 ****
  		    if (DECL_ARTIFICIAL (f1))
  		      break;
  		    warn_odr (t1, t2, f1, f2, warn, warned,
! 			      G_("fields has different layout "
  				 "in another translation unit"));
  		    return false;
  		  }
--- 1459,1465 ----
  		    if (DECL_ARTIFICIAL (f1))
  		      break;
  		    warn_odr (t1, t2, f1, f2, warn, warned,
! 			      G_("fields have different layout "
  				 "in another translation unit"));
  		    return false;
  		  }
*************** dump_possible_polymorphic_call_targets (
*** 3211,3217 ****
        fprintf (f, "  Speculative targets:");
        dump_targets (f, targets);
      }
!   gcc_assert (targets.length () <= len);
    fprintf (f, "\n");
  }
  
--- 3211,3223 ----
        fprintf (f, "  Speculative targets:");
        dump_targets (f, targets);
      }
!   /* Ugly: during callgraph construction the target cache may get populated
!      before all targets are found.  While this is harmless (because all local
!      types are discovered and only in those case we devirtualize fully and we
!      don't do speculative devirtualization before IPA stage) it triggers
!      assert here when dumping at that stage also populates the case with
!      speculative targets.  Quietly ignore this.  */
!   gcc_assert (symtab->state < IPA_SSA || targets.length () <= len);
    fprintf (f, "\n");
  }
  
diff -Nrcpad gcc-5.4.0/gcc/ipa-icf-gimple.c gcc-5.5.0/gcc/ipa-icf-gimple.c
*** gcc-5.4.0/gcc/ipa-icf-gimple.c	Wed Apr 15 12:09:56 2015
--- gcc-5.5.0/gcc/ipa-icf-gimple.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 20,25 ****
--- 20,26 ----
  <http://www.gnu.org/licenses/>.  */
  
  #include "config.h"
+ #define INCLUDE_LIST
  #include "system.h"
  #include "coretypes.h"
  #include "hash-set.h"
*************** along with GCC; see the file COPYING3.
*** 74,80 ****
  #include "cgraph.h"
  #include "data-streamer.h"
  #include "ipa-utils.h"
- #include <list>
  #include "tree-ssanames.h"
  #include "tree-eh.h"
  #include "builtins.h"
--- 75,80 ----
*************** func_checker::compare_cst_or_decl (tree
*** 395,404 ****
        }
      case LABEL_DECL:
        {
  	int *bb1 = m_label_bb_map.get (t1);
  	int *bb2 = m_label_bb_map.get (t2);
  
! 	return return_with_debug (*bb1 == *bb2);
        }
      case PARM_DECL:
      case RESULT_DECL:
--- 395,408 ----
        }
      case LABEL_DECL:
        {
+ 	if (t1 == t2)
+ 	  return true;
+ 
  	int *bb1 = m_label_bb_map.get (t1);
  	int *bb2 = m_label_bb_map.get (t2);
  
! 	/* Labels can point to another function (non-local GOTOs).  */
! 	return return_with_debug (bb1 != NULL && bb2 != NULL && *bb1 == *bb2);
        }
      case PARM_DECL:
      case RESULT_DECL:
*************** func_checker::compare_operand (tree t1,
*** 573,583 ****
      }
  }
  
- /* Compares two tree list operands T1 and T2 and returns true if these
-    two trees are semantically equivalent.  */
- 
  bool
! func_checker::compare_tree_list_operand (tree t1, tree t2)
  {
    gcc_assert (TREE_CODE (t1) == TREE_LIST);
    gcc_assert (TREE_CODE (t2) == TREE_LIST);
--- 577,584 ----
      }
  }
  
  bool
! func_checker::compare_asm_inputs_outputs (tree t1, tree t2)
  {
    gcc_assert (TREE_CODE (t1) == TREE_LIST);
    gcc_assert (TREE_CODE (t2) == TREE_LIST);
*************** func_checker::compare_tree_list_operand
*** 590,595 ****
--- 591,606 ----
        if (!compare_operand (TREE_VALUE (t1), TREE_VALUE (t2)))
  	return return_false ();
  
+       tree p1 = TREE_PURPOSE (t1);
+       tree p2 = TREE_PURPOSE (t2);
+ 
+       gcc_assert (TREE_CODE (p1) == TREE_LIST);
+       gcc_assert (TREE_CODE (p2) == TREE_LIST);
+ 
+       if (strcmp (TREE_STRING_POINTER (TREE_VALUE (p1)),
+ 		  TREE_STRING_POINTER (TREE_VALUE (p2))) != 0)
+ 	return return_false ();
+ 
        t2 = TREE_CHAIN (t2);
      }
  
*************** func_checker::compare_gimple_asm (const
*** 1035,1041 ****
        tree input1 = gimple_asm_input_op (g1, i);
        tree input2 = gimple_asm_input_op (g2, i);
  
!       if (!compare_tree_list_operand (input1, input2))
  	return return_false_with_msg ("ASM input is different");
      }
  
--- 1046,1052 ----
        tree input1 = gimple_asm_input_op (g1, i);
        tree input2 = gimple_asm_input_op (g2, i);
  
!       if (!compare_asm_inputs_outputs (input1, input2))
  	return return_false_with_msg ("ASM input is different");
      }
  
*************** func_checker::compare_gimple_asm (const
*** 1044,1050 ****
        tree output1 = gimple_asm_output_op (g1, i);
        tree output2 = gimple_asm_output_op (g2, i);
  
!       if (!compare_tree_list_operand (output1, output2))
  	return return_false_with_msg ("ASM output is different");
      }
  
--- 1055,1061 ----
        tree output1 = gimple_asm_output_op (g1, i);
        tree output2 = gimple_asm_output_op (g2, i);
  
!       if (!compare_asm_inputs_outputs (output1, output2))
  	return return_false_with_msg ("ASM output is different");
      }
  
diff -Nrcpad gcc-5.4.0/gcc/ipa-icf-gimple.h gcc-5.5.0/gcc/ipa-icf-gimple.h
*** gcc-5.4.0/gcc/ipa-icf-gimple.h	Tue Mar 24 21:51:08 2015
--- gcc-5.5.0/gcc/ipa-icf-gimple.h	Fri Sep 15 12:14:19 2017
*************** public:
*** 215,223 ****
       is returned.  */
    bool compare_operand (tree t1, tree t2);
  
!   /* Compares two tree list operands T1 and T2 and returns true if these
!      two trees are semantically equivalent.  */
!   bool compare_tree_list_operand (tree t1, tree t2);
  
    /* Verifies that trees T1 and T2, representing function declarations
       are equivalent from perspective of ICF.  */
--- 215,223 ----
       is returned.  */
    bool compare_operand (tree t1, tree t2);
  
!   /* Compares GIMPLE ASM inputs (or outputs) where we iterate tree chain
!      and compare both TREE_PURPOSEs and TREE_VALUEs.  */
!   bool compare_asm_inputs_outputs (tree t1, tree t2);
  
    /* Verifies that trees T1 and T2, representing function declarations
       are equivalent from perspective of ICF.  */
diff -Nrcpad gcc-5.4.0/gcc/ipa-icf.c gcc-5.5.0/gcc/ipa-icf.c
*** gcc-5.4.0/gcc/ipa-icf.c	Tue Mar 22 11:30:49 2016
--- gcc-5.5.0/gcc/ipa-icf.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 52,59 ****
  */
  
  #include "config.h"
  #include "system.h"
- #include <list>
  #include "coretypes.h"
  #include "hash-set.h"
  #include "machmode.h"
--- 52,59 ----
  */
  
  #include "config.h"
+ #define INCLUDE_LIST
  #include "system.h"
  #include "coretypes.h"
  #include "hash-set.h"
  #include "machmode.h"
*************** symbol_compare_collection::symbol_compar
*** 172,187 ****
  
  /* Constructor for key value pair, where _ITEM is key and _INDEX is a target.  */
  
! sem_usage_pair::sem_usage_pair (sem_item *_item, unsigned int _index):
!   item (_item), index (_index)
  {
  }
  
! /* Semantic item constructor for a node of _TYPE, where STACK is used
!    for bitmap memory allocation.  */
! 
! sem_item::sem_item (sem_item_type _type,
! 		    bitmap_obstack *stack): type(_type), hash(0)
  {
    setup (stack);
  }
--- 172,184 ----
  
  /* Constructor for key value pair, where _ITEM is key and _INDEX is a target.  */
  
! sem_usage_pair::sem_usage_pair (sem_item *_item, unsigned int _index)
! : item (_item), index (_index)
  {
  }
  
! sem_item::sem_item (sem_item_type _type, bitmap_obstack *stack)
! : type(_type), hash(-1), m_hash_set (false)
  {
    setup (stack);
  }
*************** sem_item::sem_item (sem_item_type _type,
*** 191,198 ****
     with computed _HASH.  */
  
  sem_item::sem_item (sem_item_type _type, symtab_node *_node,
! 		    hashval_t _hash, bitmap_obstack *stack): type(_type),
!   node (_node), hash (_hash)
  {
    decl = node->decl;
    setup (stack);
--- 188,195 ----
     with computed _HASH.  */
  
  sem_item::sem_item (sem_item_type _type, symtab_node *_node,
! 		    bitmap_obstack *stack)
! : type(_type), node (_node), hash (-1), m_hash_set (false)
  {
    decl = node->decl;
    setup (stack);
*************** sem_item::target_supports_symbol_aliases
*** 268,273 ****
--- 265,276 ----
  #endif
  }
  
+ void sem_item::set_hash (hashval_t h)
+ {
+   hash = h;
+   m_hash_set = true;
+ }
+ 
  /* Semantic function constructor that uses STACK as bitmap memory stack.  */
  
  sem_function::sem_function (bitmap_obstack *stack): sem_item (FUNC, stack),
*************** sem_function::sem_function (bitmap_obsta
*** 277,288 ****
    bb_sorted.create (0);
  }
  
! /*  Constructor based on callgraph node _NODE with computed hash _HASH.
!     Bitmap STACK is used for memory allocation.  */
! sem_function::sem_function (cgraph_node *node, hashval_t hash,
! 			    bitmap_obstack *stack):
!   sem_item (FUNC, node, hash, stack),
!   m_checker (NULL), m_compared_func (NULL)
  {
    bb_sizes.create (0);
    bb_sorted.create (0);
--- 280,287 ----
    bb_sorted.create (0);
  }
  
! sem_function::sem_function (cgraph_node *node, bitmap_obstack *stack)
! : sem_item (FUNC, node, stack), m_checker (NULL), m_compared_func (NULL)
  {
    bb_sizes.create (0);
    bb_sorted.create (0);
*************** sem_function::get_bb_hash (const sem_bb
*** 315,321 ****
  hashval_t
  sem_function::get_hash (void)
  {
!   if(!hash)
      {
        inchash::hash hstate;
        hstate.add_int (177454); /* Random number for function type.  */
--- 314,320 ----
  hashval_t
  sem_function::get_hash (void)
  {
!   if(!m_hash_set)
      {
        inchash::hash hstate;
        hstate.add_int (177454); /* Random number for function type.  */
*************** sem_function::get_hash (void)
*** 345,351 ****
        hstate.add_flag (DECL_CXX_CONSTRUCTOR_P (decl));
        hstate.add_flag (DECL_CXX_DESTRUCTOR_P (decl));
  
!       hash = hstate.end ();
      }
  
    return hash;
--- 344,350 ----
        hstate.add_flag (DECL_CXX_CONSTRUCTOR_P (decl));
        hstate.add_flag (DECL_CXX_DESTRUCTOR_P (decl));
  
!       set_hash (hstate.end ());
      }
  
    return hash;
*************** sem_function::parse (cgraph_node *node,
*** 1533,1539 ****
        || DECL_STATIC_DESTRUCTOR (node->decl))
      return NULL;
  
!   sem_function *f = new sem_function (node, 0, stack);
  
    f->init ();
  
--- 1532,1538 ----
        || DECL_STATIC_DESTRUCTOR (node->decl))
      return NULL;
  
!   sem_function *f = new sem_function (node, stack);
  
    f->init ();
  
*************** sem_function::bb_dict_test (vec<int> *bb
*** 1637,1655 ****
      return (*bb_dict)[source] == target;
  }
  
- 
- /* Semantic variable constructor that uses STACK as bitmap memory stack.  */
- 
  sem_variable::sem_variable (bitmap_obstack *stack): sem_item (VAR, stack)
  {
  }
  
! /*  Constructor based on varpool node _NODE with computed hash _HASH.
!     Bitmap STACK is used for memory allocation.  */
! 
! sem_variable::sem_variable (varpool_node *node, hashval_t _hash,
! 			    bitmap_obstack *stack): sem_item(VAR,
! 				  node, _hash, stack)
  {
    gcc_checking_assert (node);
    gcc_checking_assert (get_node ());
--- 1636,1647 ----
      return (*bb_dict)[source] == target;
  }
  
  sem_variable::sem_variable (bitmap_obstack *stack): sem_item (VAR, stack)
  {
  }
  
! sem_variable::sem_variable (varpool_node *node, bitmap_obstack *stack)
! : sem_item (VAR, node, stack)
  {
    gcc_checking_assert (node);
    gcc_checking_assert (get_node ());
*************** sem_variable::parse (varpool_node *node,
*** 1947,1953 ****
        || node->alias)
      return NULL;
  
!   sem_variable *v = new sem_variable (node, 0, stack);
  
    v->init ();
  
--- 1939,1945 ----
        || node->alias)
      return NULL;
  
!   sem_variable *v = new sem_variable (node, stack);
  
    v->init ();
  
*************** sem_variable::parse (varpool_node *node,
*** 1959,1965 ****
  hashval_t
  sem_variable::get_hash (void)
  {
!   if (hash)
      return hash;
  
    /* All WPA streamed in symbols should have their hashes computed at compile
--- 1951,1957 ----
  hashval_t
  sem_variable::get_hash (void)
  {
!   if (m_hash_set)
      return hash;
  
    /* All WPA streamed in symbols should have their hashes computed at compile
*************** sem_variable::get_hash (void)
*** 1973,1979 ****
    if (DECL_SIZE (decl) && tree_fits_shwi_p (DECL_SIZE (decl)))
      hstate.add_wide_int (tree_to_shwi (DECL_SIZE (decl)));
    add_expr (ctor, hstate);
!   hash = hstate.end ();
  
    return hash;
  }
--- 1965,1971 ----
    if (DECL_SIZE (decl) && tree_fits_shwi_p (DECL_SIZE (decl)))
      hstate.add_wide_int (tree_to_shwi (DECL_SIZE (decl)));
    add_expr (ctor, hstate);
!   set_hash (hstate.end ());
  
    return hash;
  }
*************** sem_variable::dump_to_file (FILE *file)
*** 2114,2121 ****
  
  unsigned int sem_item_optimizer::class_id = 0;
  
! sem_item_optimizer::sem_item_optimizer (): worklist (0), m_classes (0),
!   m_classes_count (0), m_cgraph_node_hooks (NULL), m_varpool_node_hooks (NULL)
  {
    m_items.create (0);
    bitmap_obstack_initialize (&m_bmstack);
--- 2106,2114 ----
  
  unsigned int sem_item_optimizer::class_id = 0;
  
! sem_item_optimizer::sem_item_optimizer ()
! : worklist (0), m_classes (0), m_classes_count (0), m_cgraph_node_hooks (NULL),
!   m_varpool_node_hooks (NULL)
  {
    m_items.create (0);
    bitmap_obstack_initialize (&m_bmstack);
*************** sem_item_optimizer::read_section (lto_fi
*** 2235,2247 ****
  	{
  	  cgraph_node *cnode = dyn_cast <cgraph_node *> (node);
  
! 	  m_items.safe_push (new sem_function (cnode, hash, &m_bmstack));
  	}
        else
  	{
  	  varpool_node *vnode = dyn_cast <varpool_node *> (node);
  
! 	  m_items.safe_push (new sem_variable (vnode, hash, &m_bmstack));
  	}
      }
  
--- 2228,2244 ----
  	{
  	  cgraph_node *cnode = dyn_cast <cgraph_node *> (node);
  
! 	  sem_function *fn = new sem_function (cnode, &m_bmstack);
! 	  fn->set_hash (hash);
! 	  m_items.safe_push (fn);
  	}
        else
  	{
  	  varpool_node *vnode = dyn_cast <varpool_node *> (node);
  
! 	  sem_variable *var = new sem_variable (vnode, &m_bmstack);
! 	  var->set_hash (hash);
! 	  m_items.safe_push (var);
  	}
      }
  
*************** sem_item_optimizer::update_hash_by_addr_
*** 2552,2558 ****
  	     {
  	        tree class_type
  		  = method_class_type (TREE_TYPE (m_items[i]->decl));
! 		inchash::hash hstate (m_items[i]->hash);
  
  		if (TYPE_NAME (class_type)
  		     && DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (class_type)))
--- 2549,2555 ----
  	     {
  	        tree class_type
  		  = method_class_type (TREE_TYPE (m_items[i]->decl));
! 		inchash::hash hstate (m_items[i]->get_hash ());
  
  		if (TYPE_NAME (class_type)
  		     && DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (class_type)))
*************** sem_item_optimizer::update_hash_by_addr_
*** 2560,2566 ****
  		    (IDENTIFIER_HASH_VALUE
  		       (DECL_ASSEMBLER_NAME (TYPE_NAME (class_type))));
  
! 		m_items[i]->hash = hstate.end ();
  	     }
  	}
      }
--- 2557,2563 ----
  		    (IDENTIFIER_HASH_VALUE
  		       (DECL_ASSEMBLER_NAME (TYPE_NAME (class_type))));
  
! 		m_items[i]->set_hash (hstate.end ());
  	     }
  	}
      }
*************** sem_item_optimizer::update_hash_by_addr_
*** 2574,2580 ****
  
    /* Global hash value replace current hash values.  */
    for (unsigned i = 0; i < m_items.length (); i++)
!     m_items[i]->hash = m_items[i]->global_hash;
  }
  
  /* Congruence classes are built by hash value.  */
--- 2571,2577 ----
  
    /* Global hash value replace current hash values.  */
    for (unsigned i = 0; i < m_items.length (); i++)
!     m_items[i]->set_hash (m_items[i]->global_hash);
  }
  
  /* Congruence classes are built by hash value.  */
*************** sem_item_optimizer::build_hash_based_cla
*** 2586,2592 ****
      {
        sem_item *item = m_items[i];
  
!       congruence_class_group *group = get_group_by_hash (item->hash,
  				      item->type);
  
        if (!group->classes.length ())
--- 2583,2589 ----
      {
        sem_item *item = m_items[i];
  
!       congruence_class_group *group = get_group_by_hash (item->get_hash (),
  				      item->type);
  
        if (!group->classes.length ())
diff -Nrcpad gcc-5.4.0/gcc/ipa-icf.h gcc-5.5.0/gcc/ipa-icf.h
*** gcc-5.4.0/gcc/ipa-icf.h	Mon Nov 23 13:58:40 2015
--- gcc-5.5.0/gcc/ipa-icf.h	Thu Nov 24 10:12:24 2016
*************** public:
*** 152,161 ****
    sem_item (sem_item_type _type, bitmap_obstack *stack);
  
    /* Semantic item constructor for a node of _TYPE, where STACK is used
!      for bitmap memory allocation. The item is based on symtab node _NODE
!      with computed _HASH.  */
!   sem_item (sem_item_type _type, symtab_node *_node, hashval_t _hash,
! 	    bitmap_obstack *stack);
  
    virtual ~sem_item ();
  
--- 152,159 ----
    sem_item (sem_item_type _type, bitmap_obstack *stack);
  
    /* Semantic item constructor for a node of _TYPE, where STACK is used
!      for bitmap memory allocation.  The item is based on symtab node _NODE.  */
!   sem_item (sem_item_type _type, symtab_node *_node, bitmap_obstack *stack);
  
    virtual ~sem_item ();
  
*************** public:
*** 182,187 ****
--- 180,188 ----
    /* References independent hash function.  */
    virtual hashval_t get_hash (void) = 0;
  
+   /* Set new hash value of the item.  */
+   void set_hash (hashval_t hash);
+ 
    /* Merges instance with an ALIAS_ITEM, where alias, thunk or redirection can
       be applied.  */
    virtual bool merge (sem_item *alias_item) = 0;
*************** public:
*** 235,243 ****
    /* A set with symbol table references.  */
    hash_set <symtab_node *> refs_set;
  
-   /* Hash of item.  */
-   hashval_t hash;
- 
    /* Temporary hash used where hash values of references are added.  */
    hashval_t global_hash;
  protected:
--- 236,241 ----
*************** protected:
*** 256,261 ****
--- 254,265 ----
  				  symtab_node *n1, symtab_node *n2,
  				  bool address);
  
+   /* Hash of item.  */
+   hashval_t hash;
+ 
+   /* Indicated whether a hash value has been set or not.  */
+   bool m_hash_set;
+ 
  private:
    /* Initialize internal data structures. Bitmap STACK is used for
       bitmap memory allocation process.  */
*************** public:
*** 268,276 ****
    /* Semantic function constructor that uses STACK as bitmap memory stack.  */
    sem_function (bitmap_obstack *stack);
  
!   /*  Constructor based on callgraph node _NODE with computed hash _HASH.
        Bitmap STACK is used for memory allocation.  */
!   sem_function (cgraph_node *_node, hashval_t _hash, bitmap_obstack *stack);
  
    ~sem_function ();
  
--- 272,280 ----
    /* Semantic function constructor that uses STACK as bitmap memory stack.  */
    sem_function (bitmap_obstack *stack);
  
!   /*  Constructor based on callgraph node _NODE.
        Bitmap STACK is used for memory allocation.  */
!   sem_function (cgraph_node *_node, bitmap_obstack *stack);
  
    ~sem_function ();
  
*************** public:
*** 377,386 ****
    /* Semantic variable constructor that uses STACK as bitmap memory stack.  */
    sem_variable (bitmap_obstack *stack);
  
!   /*  Constructor based on callgraph node _NODE with computed hash _HASH.
        Bitmap STACK is used for memory allocation.  */
  
!   sem_variable (varpool_node *_node, hashval_t _hash, bitmap_obstack *stack);
  
    inline virtual void init_wpa (void) {}
  
--- 381,390 ----
    /* Semantic variable constructor that uses STACK as bitmap memory stack.  */
    sem_variable (bitmap_obstack *stack);
  
!   /*  Constructor based on callgraph node _NODE.
        Bitmap STACK is used for memory allocation.  */
  
!   sem_variable (varpool_node *_node, bitmap_obstack *stack);
  
    inline virtual void init_wpa (void) {}
  
diff -Nrcpad gcc-5.4.0/gcc/ipa-inline-transform.c gcc-5.5.0/gcc/ipa-inline-transform.c
*** gcc-5.4.0/gcc/ipa-inline-transform.c	Sun Apr 12 05:44:52 2015
--- gcc-5.5.0/gcc/ipa-inline-transform.c	Fri Jan 20 12:09:22 2017
*************** inline_call (struct cgraph_edge *e, bool
*** 342,347 ****
--- 342,368 ----
      DECL_FUNCTION_PERSONALITY (to->decl)
        = DECL_FUNCTION_PERSONALITY (callee->decl);
  
+   bool reload_optimization_node = false;
+   if (!opt_for_fn (callee->decl, flag_strict_aliasing)
+       && opt_for_fn (to->decl, flag_strict_aliasing))
+     {
+       struct gcc_options opts = global_options;
+ 
+       cl_optimization_restore (&opts, opts_for_fn (to->decl));
+       opts.x_flag_strict_aliasing = false;
+       if (dump_file)
+ 	fprintf (dump_file, "Dropping flag_strict_aliasing on %s:%i\n",
+ 		 to->name (), to->order);
+       build_optimization_node (&opts);
+       DECL_FUNCTION_SPECIFIC_OPTIMIZATION (to->decl)
+ 	 = build_optimization_node (&opts);
+       reload_optimization_node = true;
+     }
+ 
+   /* Reload global optimization flags.  */
+   if (reload_optimization_node && DECL_STRUCT_FUNCTION (to->decl) == cfun)
+     set_cfun (cfun, true);
+ 
    /* If aliases are involved, redirect edge to the actual destination and
       possibly remove the aliases.  */
    if (e->callee != callee)
diff -Nrcpad gcc-5.4.0/gcc/ipa-polymorphic-call.c gcc-5.5.0/gcc/ipa-polymorphic-call.c
*** gcc-5.4.0/gcc/ipa-polymorphic-call.c	Mon May 23 10:41:35 2016
--- gcc-5.5.0/gcc/ipa-polymorphic-call.c	Fri Jan 20 08:49:08 2017
*************** contains_type_p (tree outer_type, HOST_W
*** 506,517 ****
    /* Check that type is within range.  */
    if (offset < 0)
      return false;
!   if (TYPE_SIZE (outer_type) && TYPE_SIZE (otr_type)
!       && TREE_CODE (TYPE_SIZE (outer_type)) == INTEGER_CST
!       && TREE_CODE (TYPE_SIZE (otr_type)) == INTEGER_CST
!       && wi::ltu_p (wi::to_offset (TYPE_SIZE (outer_type)),
! 		    (wi::to_offset (TYPE_SIZE (otr_type)) + offset)))
!     return false;
  
    context.offset = offset;
    context.outer_type = TYPE_MAIN_VARIANT (outer_type);
--- 506,517 ----
    /* Check that type is within range.  */
    if (offset < 0)
      return false;
! 
!   /* PR ipa/71207
!      As OUTER_TYPE can be a type which has a diamond virtual inheritance,
!      it's not necessary that INNER_TYPE will fit within OUTER_TYPE with
!      a given offset.  It can happen that INNER_TYPE also contains a base object,
!      however it would point to the same instance in the OUTER_TYPE.  */
  
    context.offset = offset;
    context.outer_type = TYPE_MAIN_VARIANT (outer_type);
diff -Nrcpad gcc-5.4.0/gcc/ipa-prop.c gcc-5.5.0/gcc/ipa-prop.c
*** gcc-5.4.0/gcc/ipa-prop.c	Thu May 19 15:10:50 2016
--- gcc-5.5.0/gcc/ipa-prop.c	Wed Mar  1 13:54:56 2017
*************** ipa_prop_write_jump_functions (void)
*** 4777,4783 ****
    lto_symtab_encoder_iterator lsei;
    lto_symtab_encoder_t encoder;
  
!   if (!ipa_node_params_sum)
      return;
  
    ob = create_output_block (LTO_section_jump_functions);
--- 4777,4783 ----
    lto_symtab_encoder_iterator lsei;
    lto_symtab_encoder_t encoder;
  
!   if (!ipa_node_params_sum || !ipa_edge_args_vector)
      return;
  
    ob = create_output_block (LTO_section_jump_functions);
diff -Nrcpad gcc-5.4.0/gcc/ipa-pure-const.c gcc-5.5.0/gcc/ipa-pure-const.c
*** gcc-5.4.0/gcc/ipa-pure-const.c	Fri Mar 27 04:02:28 2015
--- gcc-5.5.0/gcc/ipa-pure-const.c	Tue May 30 07:51:12 2017
*************** warn_function_const (tree decl, bool kno
*** 249,259 ****
  static void
  warn_function_noreturn (tree decl)
  {
    static hash_set<tree> *warned_about;
    if (!lang_hooks.missing_noreturn_ok_p (decl)
        && targetm.warn_func_return (decl))
      warned_about 
!       = suggest_attribute (OPT_Wsuggest_attribute_noreturn, decl,
  			   true, warned_about, "noreturn");
  }
  
--- 249,265 ----
  static void
  warn_function_noreturn (tree decl)
  {
+   tree original_decl = decl;
+ 
+   cgraph_node *node = cgraph_node::get (decl);
+   if (node->instrumentation_clone)
+     decl = node->instrumented_version->decl;
+ 
    static hash_set<tree> *warned_about;
    if (!lang_hooks.missing_noreturn_ok_p (decl)
        && targetm.warn_func_return (decl))
      warned_about 
!       = suggest_attribute (OPT_Wsuggest_attribute_noreturn, original_decl,
  			   true, warned_about, "noreturn");
  }
  
*************** static bool
*** 1184,1190 ****
  cdtor_p (cgraph_node *n, void *)
  {
    if (DECL_STATIC_CONSTRUCTOR (n->decl) || DECL_STATIC_DESTRUCTOR (n->decl))
!     return !TREE_READONLY (n->decl) && !DECL_PURE_P (n->decl);
    return false;
  }
  
--- 1190,1197 ----
  cdtor_p (cgraph_node *n, void *)
  {
    if (DECL_STATIC_CONSTRUCTOR (n->decl) || DECL_STATIC_DESTRUCTOR (n->decl))
!     return ((!TREE_READONLY (n->decl) && !DECL_PURE_P (n->decl))
! 	    || DECL_LOOPING_CONST_OR_PURE_P (n->decl));
    return false;
  }
  
*************** pass_nothrow::execute (function *)
*** 1961,1970 ****
      }
  
    node->set_nothrow_flag (true);
    if (dump_file)
      fprintf (dump_file, "Function found to be nothrow: %s\n",
  	     current_function_name ());
!   return 0;
  }
  
  } // anon namespace
--- 1968,1992 ----
      }
  
    node->set_nothrow_flag (true);
+ 
+   bool cfg_changed = false;
+   if (self_recursive_p (node))
+     FOR_EACH_BB_FN (this_block, cfun)
+       if (gimple g = last_stmt (this_block))
+ 	if (is_gimple_call (g))
+ 	  {
+ 	    tree callee_t = gimple_call_fndecl (g);
+ 	    if (callee_t
+ 		&& recursive_call_p (current_function_decl, callee_t)
+ 		&& maybe_clean_eh_stmt (g)
+ 		&& gimple_purge_dead_eh_edges (this_block))
+ 	      cfg_changed = true;
+ 	  }
+ 
    if (dump_file)
      fprintf (dump_file, "Function found to be nothrow: %s\n",
  	     current_function_name ());
!   return cfg_changed ? TODO_cleanup_cfg : 0;
  }
  
  } // anon namespace
diff -Nrcpad gcc-5.4.0/gcc/ipa-split.c gcc-5.5.0/gcc/ipa-split.c
*** gcc-5.4.0/gcc/ipa-split.c	Wed Mar 30 12:27:12 2016
--- gcc-5.5.0/gcc/ipa-split.c	Mon May 29 09:11:42 2017
*************** split_function (basic_block return_bb, s
*** 1390,1395 ****
--- 1390,1404 ----
  
    node->split_part = true;
  
+   if (cur_node->same_comdat_group)
+     {
+       /* TODO: call is versionable if we make sure that all
+ 	 callers are inside of a comdat group.  */
+       cur_node->calls_comdat_local = 1;
+       node->add_to_same_comdat_group (cur_node);
+     }
+ 
+ 
    /* Let's take a time profile for splitted function.  */
    node->tp_first_run = cur_node->tp_first_run + 1;
  
diff -Nrcpad gcc-5.4.0/gcc/ipa-visibility.c gcc-5.5.0/gcc/ipa-visibility.c
*** gcc-5.4.0/gcc/ipa-visibility.c	Fri Feb 27 02:06:48 2015
--- gcc-5.5.0/gcc/ipa-visibility.c	Fri Sep 15 12:13:04 2017
*************** non_local_p (struct cgraph_node *node, v
*** 112,118 ****
  	   && !DECL_EXTERNAL (node->decl)
  	   && !node->externally_visible
  	   && !node->used_from_other_partition
! 	   && !node->in_other_partition);
  }
  
  /* Return true when function can be marked local.  */
--- 112,119 ----
  	   && !DECL_EXTERNAL (node->decl)
  	   && !node->externally_visible
  	   && !node->used_from_other_partition
! 	   && !node->in_other_partition
! 	   && node->get_availability () >= AVAIL_AVAILABLE);
  }
  
  /* Return true when function can be marked local.  */
diff -Nrcpad gcc-5.4.0/gcc/ira-build.c gcc-5.5.0/gcc/ira-build.c
*** gcc-5.4.0/gcc/ira-build.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/ira-build.c	Mon Jul 18 12:59:10 2016
*************** mark_loops_for_removal (void)
*** 2291,2297 ****
  	     );
        }
    qsort (sorted_loops, n, sizeof (ira_loop_tree_node_t), loop_compare_func);
!   for (i = 0; n - i + 1 > IRA_MAX_LOOPS_NUM; i++)
      {
        sorted_loops[i]->to_remove_p = true;
        if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL)
--- 2291,2297 ----
  	     );
        }
    qsort (sorted_loops, n, sizeof (ira_loop_tree_node_t), loop_compare_func);
!   for (i = 0; i < n - IRA_MAX_LOOPS_NUM; i++)
      {
        sorted_loops[i]->to_remove_p = true;
        if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL)
diff -Nrcpad gcc-5.4.0/gcc/ira-costs.c gcc-5.5.0/gcc/ira-costs.c
*** gcc-5.4.0/gcc/ira-costs.c	Fri Mar 27 14:47:24 2015
--- gcc-5.5.0/gcc/ira-costs.c	Tue May 30 07:57:10 2017
*************** static struct costs *costs;
*** 103,109 ****
  static struct costs *total_allocno_costs;
  
  /* It is the current size of struct costs.  */
! static int struct_costs_size;
  
  /* Return pointer to structure containing costs of allocno or pseudo
     with given NUM in array ARR.  */
--- 103,109 ----
  static struct costs *total_allocno_costs;
  
  /* It is the current size of struct costs.  */
! static size_t struct_costs_size;
  
  /* Return pointer to structure containing costs of allocno or pseudo
     with given NUM in array ARR.  */
diff -Nrcpad gcc-5.4.0/gcc/ira-int.h gcc-5.5.0/gcc/ira-int.h
*** gcc-5.4.0/gcc/ira-int.h	Wed Sep 30 16:39:44 2015
--- gcc-5.5.0/gcc/ira-int.h	Tue May 30 07:57:10 2017
*************** struct target_ira_int {
*** 784,790 ****
  
    /* Initialized once.  It is a maximal possible size of the allocated
       struct costs.  */
!   int x_max_struct_costs_size;
  
    /* Allocated and initialized once, and used to initialize cost values
       for each insn.  */
--- 784,790 ----
  
    /* Initialized once.  It is a maximal possible size of the allocated
       struct costs.  */
!   size_t x_max_struct_costs_size;
  
    /* Allocated and initialized once, and used to initialize cost values
       for each insn.  */
diff -Nrcpad gcc-5.4.0/gcc/ira-lives.c gcc-5.5.0/gcc/ira-lives.c
*** gcc-5.4.0/gcc/ira-lives.c	Wed Sep 30 16:39:44 2015
--- gcc-5.5.0/gcc/ira-lives.c	Wed Sep 28 21:36:59 2016
*************** find_call_crossed_cheap_reg (rtx_insn *i
*** 1042,1048 ****
  		  break;
  		}
  
! 	      if (reg_overlap_mentioned_p (reg, PATTERN (prev)))
  		break;
  	    }
  	  prev = PREV_INSN (prev);
--- 1042,1048 ----
  		  break;
  		}
  
! 	      if (reg_set_p (reg, prev))
  		break;
  	    }
  	  prev = PREV_INSN (prev);
diff -Nrcpad gcc-5.4.0/gcc/java/ChangeLog gcc-5.5.0/gcc/java/ChangeLog
*** gcc-5.4.0/gcc/java/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/java/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/jit/ChangeLog gcc-5.5.0/gcc/jit/ChangeLog
*** gcc-5.4.0/gcc/jit/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/jit/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/loop-doloop.c gcc-5.5.0/gcc/loop-doloop.c
*** gcc-5.4.0/gcc/loop-doloop.c	Thu Jan 15 13:28:42 2015
--- gcc-5.5.0/gcc/loop-doloop.c	Tue May 30 08:20:03 2017
*************** doloop_condition_get (rtx doloop_pat)
*** 179,188 ****
  	}
        else
          inc = PATTERN (prev_insn);
!       /* We expect the condition to be of the form (reg != 0)  */
!       cond = XEXP (SET_SRC (cmp), 0);
!       if (GET_CODE (cond) != NE || XEXP (cond, 1) != const0_rtx)
!         return 0;
      }
    else
      {
--- 179,191 ----
  	}
        else
          inc = PATTERN (prev_insn);
!       if (GET_CODE (cmp) == SET && GET_CODE (SET_SRC (cmp)) == IF_THEN_ELSE)
! 	{
! 	  /* We expect the condition to be of the form (reg != 0)  */
! 	  cond = XEXP (SET_SRC (cmp), 0);
! 	  if (GET_CODE (cond) != NE || XEXP (cond, 1) != const0_rtx)
! 	    return 0;
! 	}
      }
    else
      {
diff -Nrcpad gcc-5.4.0/gcc/loop-invariant.c gcc-5.5.0/gcc/loop-invariant.c
*** gcc-5.4.0/gcc/loop-invariant.c	Thu Jan 15 13:28:42 2015
--- gcc-5.5.0/gcc/loop-invariant.c	Tue Jan 24 08:06:29 2017
*************** find_exits (struct loop *loop, basic_blo
*** 624,636 ****
  
  	  FOR_EACH_EDGE (e, ei, body[i]->succs)
  	    {
! 	      if (flow_bb_inside_loop_p (loop, e->dest))
! 		continue;
! 
! 	      bitmap_set_bit (may_exit, i);
! 	      bitmap_set_bit (has_exit, i);
! 	      outermost_exit = find_common_loop (outermost_exit,
! 						 e->dest->loop_father);
  	    }
  	  continue;
  	}
--- 624,640 ----
  
  	  FOR_EACH_EDGE (e, ei, body[i]->succs)
  	    {
! 	      if (! flow_bb_inside_loop_p (loop, e->dest))
! 		{
! 		  bitmap_set_bit (may_exit, i);
! 		  bitmap_set_bit (has_exit, i);
! 		  outermost_exit = find_common_loop (outermost_exit,
! 						     e->dest->loop_father);
! 		}
! 	      /* If we enter a subloop that might never terminate treat
! 	         it like a possible exit.  */
! 	      if (flow_loop_nested_p (loop, e->dest->loop_father))
! 		bitmap_set_bit (may_exit, i);
  	    }
  	  continue;
  	}
*************** pre_check_invariant_p (bool simple, rtx
*** 913,919 ****
     unless the program ends due to a function call.  */
  
  static void
! find_invariant_insn (rtx_insn *insn, bool always_reached, bool always_executed)
  {
    df_ref ref;
    struct def *def;
--- 917,923 ----
     unless the program ends due to a function call.  */
  
  static void
! find_invariant_insn (rtx_insn *insn, bool, bool always_executed)
  {
    df_ref ref;
    struct def *def;
*************** find_invariant_insn (rtx_insn *insn, boo
*** 947,954 ****
    if (can_throw_internal (insn))
      return;
  
!   /* We cannot make trapping insn executed, unless it was executed before.  */
!   if (may_trap_or_fault_p (PATTERN (insn)) && !always_reached)
      return;
  
    depends_on = BITMAP_ALLOC (NULL);
--- 951,958 ----
    if (can_throw_internal (insn))
      return;
  
!   /* We cannot make trapping insn executed.  */
!   if (may_trap_or_fault_p (PATTERN (insn)))
      return;
  
    depends_on = BITMAP_ALLOC (NULL);
diff -Nrcpad gcc-5.4.0/gcc/lra-constraints.c gcc-5.5.0/gcc/lra-constraints.c
*** gcc-5.4.0/gcc/lra-constraints.c	Wed Mar 30 15:58:10 2016
--- gcc-5.5.0/gcc/lra-constraints.c	Tue Jun 27 18:24:51 2017
*************** simple_move_p (void)
*** 3283,3288 ****
--- 3283,3295 ----
    lra_assert (curr_insn_set != NULL_RTX);
    dest = SET_DEST (curr_insn_set);
    src = SET_SRC (curr_insn_set);
+ 
+   /* If the instruction has multiple sets we need to process it even if it
+      is single_set.  This can happen if one or more of the SETs are dead.
+      See PR73650.  */
+   if (multiple_sets (curr_insn))
+     return false;
+ 
    return ((dclass = get_op_class (dest)) != NO_REGS
  	  && (sclass = get_op_class (src)) != NO_REGS
  	  /* The backend guarantees that register moves of cost 2
diff -Nrcpad gcc-5.4.0/gcc/lra-remat.c gcc-5.5.0/gcc/lra-remat.c
*** gcc-5.4.0/gcc/lra-remat.c	Tue Feb 16 21:13:59 2016
--- gcc-5.5.0/gcc/lra-remat.c	Tue Jan 17 10:11:20 2017
*************** update_scratch_ops (rtx_insn *remat_insn
*** 1124,1129 ****
--- 1124,1130 ----
  static bool
  do_remat (void)
  {
+   unsigned regno;
    rtx_insn *insn;
    basic_block bb;
    bitmap_head avail_cands;
*************** do_remat (void)
*** 1131,1142 ****
    bool changed_p = false;
    /* Living hard regs and hard registers of living pseudos.  */
    HARD_REG_SET live_hard_regs;
  
    bitmap_initialize (&avail_cands, &reg_obstack);
    bitmap_initialize (&active_cands, &reg_obstack);
    FOR_EACH_BB_FN (bb, cfun)
      {
!       REG_SET_TO_HARD_REG_SET (live_hard_regs, df_get_live_out (bb));
        bitmap_and (&avail_cands, &get_remat_bb_data (bb)->avin_cands,
  		  &get_remat_bb_data (bb)->livein_cands);
        /* Activating insns are always in the same block as their corresponding
--- 1132,1152 ----
    bool changed_p = false;
    /* Living hard regs and hard registers of living pseudos.  */
    HARD_REG_SET live_hard_regs;
+   bitmap_iterator bi;
  
    bitmap_initialize (&avail_cands, &reg_obstack);
    bitmap_initialize (&active_cands, &reg_obstack);
    FOR_EACH_BB_FN (bb, cfun)
      {
!       CLEAR_HARD_REG_SET (live_hard_regs);
!       EXECUTE_IF_SET_IN_BITMAP (df_get_live_in (bb), 0, regno, bi)
! 	{
! 	  int hard_regno = regno < FIRST_PSEUDO_REGISTER
! 			   ? regno
! 			   : reg_renumber[regno];
! 	  if (hard_regno >= 0)
! 	    SET_HARD_REG_BIT (live_hard_regs, hard_regno);
! 	}
        bitmap_and (&avail_cands, &get_remat_bb_data (bb)->avin_cands,
  		  &get_remat_bb_data (bb)->livein_cands);
        /* Activating insns are always in the same block as their corresponding
diff -Nrcpad gcc-5.4.0/gcc/lto/ChangeLog gcc-5.5.0/gcc/lto/ChangeLog
*** gcc-5.4.0/gcc/lto/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/lto/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,16 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-01-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/50199
+ 	* lto-lang.c (lto_post_options): Force flag_merge_constants = 1
+ 	if it was 0.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/lto/lto-lang.c gcc-5.5.0/gcc/lto/lto-lang.c
*** gcc-5.4.0/gcc/lto/lto-lang.c	Tue Feb 24 17:00:36 2015
--- gcc-5.5.0/gcc/lto/lto-lang.c	Tue May 30 07:54:21 2017
*************** lto_post_options (const char **pfilename
*** 827,832 ****
--- 827,838 ----
       support.  */
    flag_excess_precision_cmdline = EXCESS_PRECISION_FAST;
  
+   /* When partitioning, we can tear appart STRING_CSTs uses from the same
+      TU into multiple partitions.  Without constant merging the constants
+      might not be equal at runtime.  See PR50199.  */
+   if (!flag_merge_constants)
+     flag_merge_constants = 1;
+ 
    /* Initialize the compiler back end.  */
    return false;
  }
diff -Nrcpad gcc-5.4.0/gcc/lto-cgraph.c gcc-5.5.0/gcc/lto-cgraph.c
*** gcc-5.4.0/gcc/lto-cgraph.c	Tue Oct  6 10:19:54 2015
--- gcc-5.5.0/gcc/lto-cgraph.c	Thu Jan 12 07:44:17 2017
*************** lto_output_varpool_node (struct lto_simp
*** 663,668 ****
--- 663,669 ----
      }
    bp_pack_value (&bp, node->tls_model, 3);
    bp_pack_value (&bp, node->used_by_single_function, 1);
+   bp_pack_value (&bp, node->dynamically_initialized, 1);
    bp_pack_value (&bp, node->need_bounds_init, 1);
    streamer_write_bitpack (&bp);
  
*************** input_varpool_node (struct lto_file_decl
*** 1425,1430 ****
--- 1426,1432 ----
      node->alias_target = get_alias_symbol (node->decl);
    node->tls_model = (enum tls_model)bp_unpack_value (&bp, 3);
    node->used_by_single_function = (enum tls_model)bp_unpack_value (&bp, 1);
+   node->dynamically_initialized = bp_unpack_value (&bp, 1);
    node->need_bounds_init = bp_unpack_value (&bp, 1);
    group = read_identifier (ib);
    if (group)
diff -Nrcpad gcc-5.4.0/gcc/lto-streamer.h gcc-5.5.0/gcc/lto-streamer.h
*** gcc-5.4.0/gcc/lto-streamer.h	Thu May 19 15:09:21 2016
--- gcc-5.5.0/gcc/lto-streamer.h	Thu Jan 12 07:44:17 2017
*************** along with GCC; see the file COPYING3.
*** 134,140 ****
       form followed by the data for the string.  */
  
  #define LTO_major_version 4
! #define LTO_minor_version 1
  
  typedef unsigned char	lto_decl_flags_t;
  
--- 134,140 ----
       form followed by the data for the string.  */
  
  #define LTO_major_version 4
! #define LTO_minor_version 2
  
  typedef unsigned char	lto_decl_flags_t;
  
diff -Nrcpad gcc-5.4.0/gcc/match.pd gcc-5.5.0/gcc/match.pd
*** gcc-5.4.0/gcc/match.pd	Wed Jan 20 11:24:51 2016
--- gcc-5.5.0/gcc/match.pd	Thu Jul  7 12:33:10 2016
*************** along with GCC; see the file COPYING3.
*** 370,381 ****
    (ne (bit_and:c (bit_not @0) @1) integer_zerop)
    (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
         && TYPE_PRECISION (TREE_TYPE (@1)) == 1)
!    (lt @0 @1)))
  (simplify
    (ne (bit_ior:c (bit_not @0) @1) integer_zerop)
    (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
         && TYPE_PRECISION (TREE_TYPE (@1)) == 1)
!    (le @0 @1)))
  
  /* ~~x -> x */
  (simplify
--- 370,385 ----
    (ne (bit_and:c (bit_not @0) @1) integer_zerop)
    (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
         && TYPE_PRECISION (TREE_TYPE (@1)) == 1)
!    (if (TYPE_UNSIGNED (TREE_TYPE (@1)))
!     (lt @0 @1))
!    (gt @0 @1)))
  (simplify
    (ne (bit_ior:c (bit_not @0) @1) integer_zerop)
    (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
         && TYPE_PRECISION (TREE_TYPE (@1)) == 1)
!    (if (TYPE_UNSIGNED (TREE_TYPE (@1)))
!     (le @0 @1))
!    (ge @0 @1)))
  
  /* ~~x -> x */
  (simplify
*************** along with GCC; see the file COPYING3.
*** 750,756 ****
  
     /* A truncation to an unsigned type (a zero-extension) should be
        canonicalized as bitwise and of a mask.  */
!    (if (final_int && inter_int && inside_int
  	&& final_prec == inside_prec
  	&& final_prec > inter_prec
  	&& inter_unsignedp)
--- 754,761 ----
  
     /* A truncation to an unsigned type (a zero-extension) should be
        canonicalized as bitwise and of a mask.  */
!    (if (GIMPLE /* PR70366: doing this in GENERIC breaks -Wconversion.  */
! 	&& final_int && inter_int && inside_int
  	&& final_prec == inside_prec
  	&& final_prec > inter_prec
  	&& inter_unsignedp)
diff -Nrcpad gcc-5.4.0/gcc/objc/ChangeLog gcc-5.5.0/gcc/objc/ChangeLog
*** gcc-5.4.0/gcc/objc/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/objc/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/objcp/ChangeLog gcc-5.5.0/gcc/objcp/ChangeLog
*** gcc-5.4.0/gcc/objcp/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/objcp/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/omp-low.c gcc-5.5.0/gcc/omp-low.c
*** gcc-5.4.0/gcc/omp-low.c	Tue Feb 16 13:49:22 2016
--- gcc-5.5.0/gcc/omp-low.c	Sat Sep 16 18:38:53 2017
*************** build_receiver_ref (tree var, bool by_re
*** 1166,1172 ****
     this is some variable.  */
  
  static tree
! build_outer_var_ref (tree var, omp_context *ctx)
  {
    tree x;
  
--- 1166,1173 ----
     this is some variable.  */
  
  static tree
! build_outer_var_ref (tree var, omp_context *ctx,
! 		     enum omp_clause_code code = OMP_CLAUSE_ERROR)
  {
    tree x;
  
*************** build_outer_var_ref (tree var, omp_conte
*** 1175,1181 ****
    else if (is_variable_sized (var))
      {
        x = TREE_OPERAND (DECL_VALUE_EXPR (var), 0);
!       x = build_outer_var_ref (x, ctx);
        x = build_simple_mem_ref (x);
      }
    else if (is_taskreg_ctx (ctx))
--- 1176,1182 ----
    else if (is_variable_sized (var))
      {
        x = TREE_OPERAND (DECL_VALUE_EXPR (var), 0);
!       x = build_outer_var_ref (x, ctx, code);
        x = build_simple_mem_ref (x);
      }
    else if (is_taskreg_ctx (ctx))
*************** build_outer_var_ref (tree var, omp_conte
*** 1183,1193 ****
        bool by_ref = use_pointer_for_field (var, NULL);
        x = build_receiver_ref (var, by_ref, ctx);
      }
!   else if (gimple_code (ctx->stmt) == GIMPLE_OMP_FOR
! 	   && gimple_omp_for_kind (ctx->stmt) & GF_OMP_FOR_SIMD)
      {
!       /* #pragma omp simd isn't a worksharing construct, and can reference even
! 	 private vars in its linear etc. clauses.  */
        x = NULL_TREE;
        if (ctx->outer && is_taskreg_ctx (ctx))
  	x = lookup_decl (var, ctx->outer);
--- 1184,1200 ----
        bool by_ref = use_pointer_for_field (var, NULL);
        x = build_receiver_ref (var, by_ref, ctx);
      }
!   else if ((gimple_code (ctx->stmt) == GIMPLE_OMP_FOR
! 	    && gimple_omp_for_kind (ctx->stmt) & GF_OMP_FOR_SIMD)
! 	   || (code == OMP_CLAUSE_PRIVATE
! 	       && (gimple_code (ctx->stmt) == GIMPLE_OMP_FOR
! 		   || gimple_code (ctx->stmt) == GIMPLE_OMP_SECTIONS
! 		   || gimple_code (ctx->stmt) == GIMPLE_OMP_SINGLE)))
      {
!       /* #pragma omp simd isn't a worksharing construct, and can reference
! 	 even private vars in its linear etc. clauses.
! 	 Similarly for OMP_CLAUSE_PRIVATE with outer ref, that can refer
! 	 to private vars in all worksharing constructs.  */
        x = NULL_TREE;
        if (ctx->outer && is_taskreg_ctx (ctx))
  	x = lookup_decl (var, ctx->outer);
*************** omp_copy_decl (tree var, copy_body_data
*** 1363,1368 ****
--- 1370,1377 ----
  
    if (TREE_CODE (var) == LABEL_DECL)
      {
+       if (FORCED_LABEL (var) || DECL_NONLOCAL (var))
+ 	return var;
        new_var = create_artificial_label (DECL_SOURCE_LOCATION (var));
        DECL_CONTEXT (new_var) = current_function_decl;
        insert_decl_map (&ctx->cb, var, new_var);
*************** scan_omp_task (gimple_stmt_iterator *gsi
*** 2371,2379 ****
    tree name, t;
    gomp_task *stmt = as_a <gomp_task *> (gsi_stmt (*gsi));
  
!   /* Ignore task directives with empty bodies.  */
    if (optimize > 0
!       && empty_body_p (gimple_omp_body (stmt)))
      {
        gsi_replace (gsi, gimple_build_nop (), false);
        return;
--- 2380,2390 ----
    tree name, t;
    gomp_task *stmt = as_a <gomp_task *> (gsi_stmt (*gsi));
  
!   /* Ignore task directives with empty bodies, unless they have depend
!      clause.  */
    if (optimize > 0
!       && empty_body_p (gimple_omp_body (stmt))
!       && !find_omp_clause (gimple_omp_task_clauses (stmt), OMP_CLAUSE_DEPEND))
      {
        gsi_replace (gsi, gimple_build_nop (), false);
        return;
*************** lower_rec_simd_input_clauses (tree new_v
*** 3546,3552 ****
  	{
  	  tree c = find_omp_clause (gimple_omp_for_clauses (ctx->stmt),
  				    OMP_CLAUSE_SAFELEN);
! 	  if (c && TREE_CODE (OMP_CLAUSE_SAFELEN_EXPR (c)) != INTEGER_CST)
  	    max_vf = 1;
  	  else if (c && compare_tree_int (OMP_CLAUSE_SAFELEN_EXPR (c),
  					  max_vf) == -1)
--- 3557,3565 ----
  	{
  	  tree c = find_omp_clause (gimple_omp_for_clauses (ctx->stmt),
  				    OMP_CLAUSE_SAFELEN);
! 	  if (c
! 	      && (TREE_CODE (OMP_CLAUSE_SAFELEN_EXPR (c)) != INTEGER_CST
! 		  || tree_int_cst_sgn (OMP_CLAUSE_SAFELEN_EXPR (c)) != 1))
  	    max_vf = 1;
  	  else if (c && compare_tree_int (OMP_CLAUSE_SAFELEN_EXPR (c),
  					  max_vf) == -1)
*************** lower_rec_input_clauses (tree clauses, g
*** 3884,3890 ****
  		  if (is_task_ctx (ctx))
  		    x = build_receiver_ref (var, false, ctx);
  		  else
! 		    x = build_outer_var_ref (var, ctx);
  		}
  	      else
  		x = NULL;
--- 3897,3903 ----
  		  if (is_task_ctx (ctx))
  		    x = build_receiver_ref (var, false, ctx);
  		  else
! 		    x = build_outer_var_ref (var, ctx, OMP_CLAUSE_PRIVATE);
  		}
  	      else
  		x = NULL;
*************** expand_omp_target (struct omp_region *re
*** 9123,9131 ****
        make_edge (else_bb, new_bb, EDGE_FALLTHRU);
  
        device = tmp_var;
      }
  
-   gsi = gsi_last_bb (new_bb);
    t = gimple_omp_target_data_arg (entry_stmt);
    if (t == NULL)
      {
--- 9136,9150 ----
        make_edge (else_bb, new_bb, EDGE_FALLTHRU);
  
        device = tmp_var;
+       gsi = gsi_last_bb (new_bb);
+     }
+   else
+     {
+       gsi = gsi_last_bb (new_bb);
+       device = force_gimple_operand_gsi (&gsi, device, true, NULL_TREE,
+ 					 true, GSI_SAME_STMT);
      }
  
    t = gimple_omp_target_data_arg (entry_stmt);
    if (t == NULL)
      {
*************** diagnose_sb_0 (gimple_stmt_iterator *gsi
*** 12042,12048 ****
      }
    if (kind == NULL)
      {
!       gcc_checking_assert (flag_openmp);
        kind = "OpenMP";
      }
  
--- 12061,12067 ----
      }
    if (kind == NULL)
      {
!       gcc_checking_assert (flag_openmp || flag_openmp_simd);
        kind = "OpenMP";
      }
  
*************** public:
*** 12448,12454 ****
    /* opt_pass methods: */
    virtual bool gate (function *)
    {
!     return flag_cilkplus || flag_openacc || flag_openmp;
    }
    virtual unsigned int execute (function *)
      {
--- 12467,12473 ----
    /* opt_pass methods: */
    virtual bool gate (function *)
    {
!     return flag_cilkplus || flag_openacc || flag_openmp || flag_openmp_simd;
    }
    virtual unsigned int execute (function *)
      {
*************** simd_clone_adjust_argument_types (struct
*** 12938,12944 ****
  
  	  if (node->definition)
  	    node->simdclone->args[i].simd_array
! 	      = create_tmp_simd_array (IDENTIFIER_POINTER (DECL_NAME (parm)),
  				       parm_type, node->simdclone->simdlen);
  	}
        adjustments.safe_push (adj);
--- 12957,12965 ----
  
  	  if (node->definition)
  	    node->simdclone->args[i].simd_array
! 	      = create_tmp_simd_array (DECL_NAME (parm)
! 				       ? IDENTIFIER_POINTER (DECL_NAME (parm))
! 				       : NULL,
  				       parm_type, node->simdclone->simdlen);
  	}
        adjustments.safe_push (adj);
diff -Nrcpad gcc-5.4.0/gcc/params.def gcc-5.5.0/gcc/params.def
*** gcc-5.4.0/gcc/params.def	Sat Apr  4 21:07:46 2015
--- gcc-5.5.0/gcc/params.def	Thu Jun 22 11:30:42 2017
*************** DEFPARAM (PARAM_COMDAT_SHARING_PROBABILI
*** 121,127 ****
  DEFPARAM (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY,
  	  "partial-inlining-entry-probability",
  	  "Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen",
! 	  70, 0, 0)
  
  /* Limit the number of expansions created by the variable expansion
     optimization to avoid register pressure.  */
--- 121,127 ----
  DEFPARAM (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY,
  	  "partial-inlining-entry-probability",
  	  "Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen",
! 	  70, 0, 100)
  
  /* Limit the number of expansions created by the variable expansion
     optimization to avoid register pressure.  */
*************** DEFPARAM(PARAM_SELSCHED_MAX_LOOKAHEAD,
*** 656,662 ****
  DEFPARAM(PARAM_SELSCHED_MAX_SCHED_TIMES,
           "selsched-max-sched-times",
           "Maximum number of times that an insn could be scheduled",
!          2, 0, 0)
  
  DEFPARAM(PARAM_SELSCHED_INSNS_TO_RENAME,
           "selsched-insns-to-rename",
--- 656,662 ----
  DEFPARAM(PARAM_SELSCHED_MAX_SCHED_TIMES,
           "selsched-max-sched-times",
           "Maximum number of times that an insn could be scheduled",
!          2, 1, 0)
  
  DEFPARAM(PARAM_SELSCHED_INSNS_TO_RENAME,
           "selsched-insns-to-rename",
diff -Nrcpad gcc-5.4.0/gcc/po/ChangeLog gcc-5.5.0/gcc/po/ChangeLog
*** gcc-5.4.0/gcc/po/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/po/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,13 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2016-12-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR translation/78745
+ 	* exgettext: Handle multi-line help texts in *.opt files.
+ 	* gcc.pot: Regenerate.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gcc/po/exgettext gcc-5.5.0/gcc/po/exgettext
*** gcc-5.4.0/gcc/po/exgettext	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/po/exgettext	Fri Dec 30 19:21:22 2016
*************** echo "scanning option files..." >&2
*** 237,242 ****
--- 237,244 ----
      field = 0
      while (getline < file) {
  	if (/^[ \t]*(;|$)/ || !/^[^ \t]/) {
+ 	    if (field > 2)
+ 		printf("_(\"%s\")\n", line)
  	    field = 0
  	} else {
  	    if ((field == 1) && /MissingArgError/) {
*************** echo "scanning option files..." >&2
*** 275,286 ****
  	    if (field == 2) {
  		line = $0
  		printf("#line %d \"%s\"\n", lineno, file)
! 		printf("_(\"%s\")\n", line)
  	    }
  	    field++;
  	}
  	lineno++;
      }
    }') >> $emsg
  
  # Run the xgettext commands, with temporary added as a file to scan.
--- 277,291 ----
  	    if (field == 2) {
  		line = $0
  		printf("#line %d \"%s\"\n", lineno, file)
! 	    } else if (field > 2) {
! 		line = line " " $0
  	    }
  	    field++;
  	}
  	lineno++;
      }
+     if (field > 2)
+ 	printf("_(\"%s\")\n", line)
    }') >> $emsg
  
  # Run the xgettext commands, with temporary added as a file to scan.
diff -Nrcpad gcc-5.4.0/gcc/po/gcc.pot gcc-5.5.0/gcc/po/gcc.pot
*** gcc-5.4.0/gcc/po/gcc.pot	Thu Jul  2 12:32:32 2015
--- gcc-5.5.0/gcc/po/gcc.pot	Fri Dec 30 19:21:22 2016
*************** msgid ""
*** 8,14 ****
  msgstr ""
  "Project-Id-Version: PACKAGE VERSION\n"
  "Report-Msgid-Bugs-To: http://gcc.gnu.org/bugs.html\n"
! "POT-Creation-Date: 2015-07-02 12:31+0000\n"
  "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
  "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
  "Language-Team: LANGUAGE <LL@li.org>\n"
--- 8,14 ----
  msgstr ""
  "Project-Id-Version: PACKAGE VERSION\n"
  "Report-Msgid-Bugs-To: http://gcc.gnu.org/bugs.html\n"
! "POT-Creation-Date: 2016-12-30 20:20+0100\n"
  "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
  "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
  "Language-Team: LANGUAGE <LL@li.org>\n"
*************** msgstr ""
*** 88,141 ****
  msgid "const/copy propagation disabled"
  msgstr ""
  
! #: diagnostic.c:212
  #, c-format
  msgid "%s: all warnings being treated as errors"
  msgstr ""
  
! #: diagnostic.c:217
  #, c-format
  msgid "%s: some warnings being treated as errors"
  msgstr ""
  
! #: diagnostic.c:299 input.c:170 c-family/c-opts.c:1300 cp/error.c:1207
! #: fortran/cpp.c:591 fortran/error.c:1181
  msgid "<built-in>"
  msgstr ""
  
! #: diagnostic.c:502
  #, c-format
  msgid "compilation terminated due to -Wfatal-errors.\n"
  msgstr ""
  
! #: diagnostic.c:513
  #, c-format
  msgid "compilation terminated due to -fmax-errors=%u.\n"
  msgstr ""
  
! #: diagnostic.c:534
  #, c-format
  msgid ""
  "Please submit a full bug report,\n"
  "with preprocessed source if appropriate.\n"
  msgstr ""
  
! #: diagnostic.c:540
  #, c-format
  msgid "See %s for instructions.\n"
  msgstr ""
  
! #: diagnostic.c:549
  #, c-format
  msgid "compilation terminated.\n"
  msgstr ""
  
! #: diagnostic.c:829
  #, c-format
  msgid "%s:%d: confused by earlier errors, bailing out\n"
  msgstr ""
  
! #: diagnostic.c:1273
  #, c-format
  msgid "Internal compiler error: Error reporting routines re-entered.\n"
  msgstr ""
--- 88,141 ----
  msgid "const/copy propagation disabled"
  msgstr ""
  
! #: diagnostic.c:211
  #, c-format
  msgid "%s: all warnings being treated as errors"
  msgstr ""
  
! #: diagnostic.c:216
  #, c-format
  msgid "%s: some warnings being treated as errors"
  msgstr ""
  
! #: diagnostic.c:298 input.c:170 c-family/c-opts.c:1300 cp/error.c:1207
! #: fortran/cpp.c:591 fortran/error.c:1184
  msgid "<built-in>"
  msgstr ""
  
! #: diagnostic.c:501
  #, c-format
  msgid "compilation terminated due to -Wfatal-errors.\n"
  msgstr ""
  
! #: diagnostic.c:512
  #, c-format
  msgid "compilation terminated due to -fmax-errors=%u.\n"
  msgstr ""
  
! #: diagnostic.c:533
  #, c-format
  msgid ""
  "Please submit a full bug report,\n"
  "with preprocessed source if appropriate.\n"
  msgstr ""
  
! #: diagnostic.c:539
  #, c-format
  msgid "See %s for instructions.\n"
  msgstr ""
  
! #: diagnostic.c:548
  #, c-format
  msgid "compilation terminated.\n"
  msgstr ""
  
! #: diagnostic.c:826
  #, c-format
  msgid "%s:%d: confused by earlier errors, bailing out\n"
  msgstr ""
  
! #: diagnostic.c:1270
  #, c-format
  msgid "Internal compiler error: Error reporting routines re-entered.\n"
  msgstr ""
*************** msgstr ""
*** 188,200 ****
  #. TARGET_PRINT_OPERAND must handle them.
  #. We can't handle floating point constants;
  #. PRINT_OPERAND must handle them.
! #: final.c:3973 config/arc/arc.c:4653 config/i386/i386.c:14715
  #: config/pdp11/pdp11.c:1727
  #, c-format
  msgid "floating constant misused"
  msgstr ""
  
! #: final.c:4031 config/arc/arc.c:4725 config/i386/i386.c:14813
  #: config/pdp11/pdp11.c:1768
  #, c-format
  msgid "invalid expression as operand"
--- 188,200 ----
  #. TARGET_PRINT_OPERAND must handle them.
  #. We can't handle floating point constants;
  #. PRINT_OPERAND must handle them.
! #: final.c:3973 config/arc/arc.c:4653 config/i386/i386.c:14779
  #: config/pdp11/pdp11.c:1727
  #, c-format
  msgid "floating constant misused"
  msgstr ""
  
! #: final.c:4031 config/arc/arc.c:4725 config/i386/i386.c:14877
  #: config/pdp11/pdp11.c:1768
  #, c-format
  msgid "invalid expression as operand"
*************** msgid ""
*** 491,572 ****
  " other options on to these processes the -W<letter> options must be used.\n"
  msgstr ""
  
! #: gcc.c:5637
  #, c-format
  msgid "Processing spec (%s), which is '%s'\n"
  msgstr ""
  
! #: gcc.c:6334
  #, c-format
  msgid "Target: %s\n"
  msgstr ""
  
! #: gcc.c:6335
  #, c-format
  msgid "Configured with: %s\n"
  msgstr ""
  
! #: gcc.c:6349
  #, c-format
  msgid "Thread model: %s\n"
  msgstr ""
  
! #: gcc.c:6360
  #, c-format
  msgid "gcc version %s %s\n"
  msgstr ""
  
! #: gcc.c:6363
  #, c-format
  msgid "gcc driver version %s %sexecuting gcc version %s\n"
  msgstr ""
  
! #: gcc.c:6436 gcc.c:6648
  #, c-format
  msgid ""
  "The bug is not reproducible, so it is likely a hardware or OS problem.\n"
  msgstr ""
  
! #: gcc.c:6572
  #, c-format
  msgid ""
  "Preprocessed source stored into %s file, please attach this to your "
  "bugreport.\n"
  msgstr ""
  
! #: gcc.c:7398
  #, c-format
  msgid "install: %s%s\n"
  msgstr ""
  
! #: gcc.c:7401
  #, c-format
  msgid "programs: %s\n"
  msgstr ""
  
! #: gcc.c:7403
  #, c-format
  msgid "libraries: %s\n"
  msgstr ""
  
! #: gcc.c:7520
  #, c-format
  msgid ""
  "\n"
  "For bug reporting instructions, please see:\n"
  msgstr ""
  
! #: gcc.c:7536 gcov-tool.c:528
  #, c-format
  msgid "%s %s%s\n"
  msgstr ""
  
! #: gcc.c:7539 gcov-tool.c:530 gcov.c:504 fortran/gfortranspec.c:280
  #: java/jcf-dump.c:1240
  msgid "(C)"
  msgstr ""
  
! #: gcc.c:7540 java/jcf-dump.c:1241
  #, c-format
  msgid ""
  "This is free software; see the source for copying conditions.  There is NO\n"
--- 491,572 ----
  " other options on to these processes the -W<letter> options must be used.\n"
  msgstr ""
  
! #: gcc.c:5638
  #, c-format
  msgid "Processing spec (%s), which is '%s'\n"
  msgstr ""
  
! #: gcc.c:6335
  #, c-format
  msgid "Target: %s\n"
  msgstr ""
  
! #: gcc.c:6336
  #, c-format
  msgid "Configured with: %s\n"
  msgstr ""
  
! #: gcc.c:6350
  #, c-format
  msgid "Thread model: %s\n"
  msgstr ""
  
! #: gcc.c:6361
  #, c-format
  msgid "gcc version %s %s\n"
  msgstr ""
  
! #: gcc.c:6364
  #, c-format
  msgid "gcc driver version %s %sexecuting gcc version %s\n"
  msgstr ""
  
! #: gcc.c:6437 gcc.c:6649
  #, c-format
  msgid ""
  "The bug is not reproducible, so it is likely a hardware or OS problem.\n"
  msgstr ""
  
! #: gcc.c:6573
  #, c-format
  msgid ""
  "Preprocessed source stored into %s file, please attach this to your "
  "bugreport.\n"
  msgstr ""
  
! #: gcc.c:7399
  #, c-format
  msgid "install: %s%s\n"
  msgstr ""
  
! #: gcc.c:7402
  #, c-format
  msgid "programs: %s\n"
  msgstr ""
  
! #: gcc.c:7404
  #, c-format
  msgid "libraries: %s\n"
  msgstr ""
  
! #: gcc.c:7521
  #, c-format
  msgid ""
  "\n"
  "For bug reporting instructions, please see:\n"
  msgstr ""
  
! #: gcc.c:7537 gcov-tool.c:528
  #, c-format
  msgid "%s %s%s\n"
  msgstr ""
  
! #: gcc.c:7540 gcov-tool.c:530 gcov.c:504 fortran/gfortranspec.c:280
  #: java/jcf-dump.c:1240
  msgid "(C)"
  msgstr ""
  
! #: gcc.c:7541 java/jcf-dump.c:1241
  #, c-format
  msgid ""
  "This is free software; see the source for copying conditions.  There is NO\n"
*************** msgid ""
*** 574,580 ****
  "\n"
  msgstr ""
  
! #: gcc.c:7845
  #, c-format
  msgid ""
  "\n"
--- 574,580 ----
  "\n"
  msgstr ""
  
! #: gcc.c:7846
  #, c-format
  msgid ""
  "\n"
*************** msgid ""
*** 583,596 ****
  "\n"
  msgstr ""
  
! #: gcc.c:7846
  #, c-format
  msgid ""
  "Use \"-Wl,OPTION\" to pass \"OPTION\" to the linker.\n"
  "\n"
  msgstr ""
  
! #: gcc.c:9110
  #, c-format
  msgid ""
  "Assembler options\n"
--- 583,596 ----
  "\n"
  msgstr ""
  
! #: gcc.c:7847
  #, c-format
  msgid ""
  "Use \"-Wl,OPTION\" to pass \"OPTION\" to the linker.\n"
  "\n"
  msgstr ""
  
! #: gcc.c:9111
  #, c-format
  msgid ""
  "Assembler options\n"
*************** msgid ""
*** 598,604 ****
  "\n"
  msgstr ""
  
! #: gcc.c:9111
  #, c-format
  msgid ""
  "Use \"-Wa,OPTION\" to pass \"OPTION\" to the assembler.\n"
--- 598,604 ----
  "\n"
  msgstr ""
  
! #: gcc.c:9112
  #, c-format
  msgid ""
  "Use \"-Wa,OPTION\" to pass \"OPTION\" to the assembler.\n"
*************** msgstr ""
*** 1075,1086 ****
  msgid "GCSE disabled"
  msgstr ""
  
! #: gimple-ssa-isolate-paths.c:441 c/c-typeck.c:9507
  #, gcc-internal-format
  msgid "function returns address of local variable"
  msgstr ""
  
! #: gimple-ssa-isolate-paths.c:443 gimple-ssa-isolate-paths.c:316
  #, gcc-internal-format
  msgid "function may return address of local variable"
  msgstr ""
--- 1075,1086 ----
  msgid "GCSE disabled"
  msgstr ""
  
! #: gimple-ssa-isolate-paths.c:448 c/c-typeck.c:9524
  #, gcc-internal-format
  msgid "function returns address of local variable"
  msgstr ""
  
! #: gimple-ssa-isolate-paths.c:450 gimple-ssa-isolate-paths.c:323
  #, gcc-internal-format
  msgid "function may return address of local variable"
  msgstr ""
*************** msgstr ""
*** 1100,1116 ****
  msgid "ignoring nonexistent directory \"%s\"\n"
  msgstr ""
  
! #: incpath.c:375
  #, c-format
  msgid "#include \"...\" search starts here:\n"
  msgstr ""
  
! #: incpath.c:379
  #, c-format
  msgid "#include <...> search starts here:\n"
  msgstr ""
  
! #: incpath.c:384
  #, c-format
  msgid "End of search list.\n"
  msgstr ""
--- 1100,1116 ----
  msgid "ignoring nonexistent directory \"%s\"\n"
  msgstr ""
  
! #: incpath.c:376
  #, c-format
  msgid "#include \"...\" search starts here:\n"
  msgstr ""
  
! #: incpath.c:380
  #, c-format
  msgid "#include <...> search starts here:\n"
  msgstr ""
  
! #: incpath.c:385
  #, c-format
  msgid "End of search list.\n"
  msgstr ""
*************** msgstr ""
*** 1139,1163 ****
  msgid "At top level:"
  msgstr ""
  
! #: langhooks.c:422 cp/error.c:3252
  #, c-format
  msgid "In member function %qs"
  msgstr ""
  
! #: langhooks.c:426 cp/error.c:3255
  #, c-format
  msgid "In function %qs"
  msgstr ""
  
! #: langhooks.c:477 cp/error.c:3205
  msgid "    inlined from %qs at %r%s:%d:%d%R"
  msgstr ""
  
! #: langhooks.c:482 cp/error.c:3210
  msgid "    inlined from %qs at %r%s:%d%R"
  msgstr ""
  
! #: langhooks.c:488 cp/error.c:3216
  #, c-format
  msgid "    inlined from %qs"
  msgstr ""
--- 1139,1163 ----
  msgid "At top level:"
  msgstr ""
  
! #: langhooks.c:422 cp/error.c:3253
  #, c-format
  msgid "In member function %qs"
  msgstr ""
  
! #: langhooks.c:426 cp/error.c:3256
  #, c-format
  msgid "In function %qs"
  msgstr ""
  
! #: langhooks.c:477 cp/error.c:3206
  msgid "    inlined from %qs at %r%s:%d:%d%R"
  msgstr ""
  
! #: langhooks.c:482 cp/error.c:3211
  msgid "    inlined from %qs at %r%s:%d%R"
  msgstr ""
  
! #: langhooks.c:488 cp/error.c:3217
  #, c-format
  msgid "    inlined from %qs"
  msgstr ""
*************** msgstr ""
*** 1307,1322 ****
  msgid "insn does not satisfy its constraints:"
  msgstr ""
  
! #: targhooks.c:1659
  #, c-format
  msgid "created and used with differing settings of '%s'"
  msgstr ""
  
! #: targhooks.c:1674
  msgid "created and used with different settings of -fpic"
  msgstr ""
  
! #: targhooks.c:1676
  msgid "created and used with different settings of -fpie"
  msgstr ""
  
--- 1307,1322 ----
  msgid "insn does not satisfy its constraints:"
  msgstr ""
  
! #: targhooks.c:1663
  #, c-format
  msgid "created and used with differing settings of '%s'"
  msgstr ""
  
! #: targhooks.c:1678
  msgid "created and used with different settings of -fpic"
  msgstr ""
  
! #: targhooks.c:1680
  msgid "created and used with different settings of -fpie"
  msgstr ""
  
*************** msgstr ""
*** 1345,1387 ****
  msgid "unrecoverable error"
  msgstr ""
  
! #: toplev.c:747
  #, c-format
  msgid ""
  "%s%s%s %sversion %s (%s)\n"
  "%s\tcompiled by GNU C version %s, "
  msgstr ""
  
! #: toplev.c:749
  #, c-format
  msgid "%s%s%s %sversion %s (%s) compiled by CC, "
  msgstr ""
  
! #: toplev.c:753
  #, c-format
  msgid "GMP version %s, MPFR version %s, MPC version %s\n"
  msgstr ""
  
! #: toplev.c:755
  #, c-format
  msgid "%s%swarning: %s header version %s differs from library version %s.\n"
  msgstr ""
  
! #: toplev.c:757
  #, c-format
  msgid ""
  "%s%sGGC heuristics: --param ggc-min-expand=%d --param ggc-min-heapsize=%d\n"
  msgstr ""
  
! #: toplev.c:923
  msgid "options passed: "
  msgstr ""
  
! #: toplev.c:951
  msgid "options enabled: "
  msgstr ""
  
! #: tree-diagnostic.c:306 c/c-decl.c:5184 c/c-typeck.c:6556 cp/error.c:700
  #: cp/error.c:1006 c-family/c-pretty-print.c:443
  #, gcc-internal-format
  msgid "<anonymous>"
--- 1345,1387 ----
  msgid "unrecoverable error"
  msgstr ""
  
! #: toplev.c:752
  #, c-format
  msgid ""
  "%s%s%s %sversion %s (%s)\n"
  "%s\tcompiled by GNU C version %s, "
  msgstr ""
  
! #: toplev.c:754
  #, c-format
  msgid "%s%s%s %sversion %s (%s) compiled by CC, "
  msgstr ""
  
! #: toplev.c:758
  #, c-format
  msgid "GMP version %s, MPFR version %s, MPC version %s\n"
  msgstr ""
  
! #: toplev.c:760
  #, c-format
  msgid "%s%swarning: %s header version %s differs from library version %s.\n"
  msgstr ""
  
! #: toplev.c:762
  #, c-format
  msgid ""
  "%s%sGGC heuristics: --param ggc-min-expand=%d --param ggc-min-heapsize=%d\n"
  msgstr ""
  
! #: toplev.c:928
  msgid "options passed: "
  msgstr ""
  
! #: toplev.c:956
  msgid "options enabled: "
  msgstr ""
  
! #: tree-diagnostic.c:306 c/c-decl.c:5213 c/c-typeck.c:6570 cp/error.c:700
  #: cp/error.c:1006 c-family/c-pretty-print.c:443
  #, gcc-internal-format
  msgid "<anonymous>"
*************** msgstr ""
*** 2700,2748 ****
  msgid "<command-line>"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4058 config/arm/arm.c:21673 config/arm/arm.c:21686
! #: config/arm/arm.c:21711 config/nios2/nios2.c:2118
  #, c-format
  msgid "Unsupported operand for code '%c'"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4070 config/aarch64/aarch64.c:4086
! #: config/aarch64/aarch64.c:4099 config/aarch64/aarch64.c:4111
! #: config/aarch64/aarch64.c:4122 config/aarch64/aarch64.c:4140
! #: config/aarch64/aarch64.c:4164 config/aarch64/aarch64.c:4215
! #: config/aarch64/aarch64.c:4412 config/aarch64/aarch64.c:4429
  #, c-format
  msgid "invalid operand for '%%%c'"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4182 config/aarch64/aarch64.c:4195
! #: config/aarch64/aarch64.c:4205
  #, c-format
  msgid "incompatible floating point / vector register operand for '%%%c'"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4251 config/arm/arm.c:22218
  #, c-format
  msgid "missing operand"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4315
  #, c-format
  msgid "invalid constant"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4318
  #, c-format
  msgid "invalid operand"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4440
  #, c-format
  msgid "invalid operand prefix '%%%c'"
  msgstr ""
  
! #: config/alpha/alpha.c:5173 config/i386/i386.c:15897
! #: config/rs6000/rs6000.c:19130 config/sparc/sparc.c:8825
  #, c-format
  msgid "'%%&' used without any local dynamic TLS references"
  msgstr ""
--- 2700,2748 ----
  msgid "<command-line>"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4084 config/arm/arm.c:21706 config/arm/arm.c:21719
! #: config/arm/arm.c:21744 config/nios2/nios2.c:2118
  #, c-format
  msgid "Unsupported operand for code '%c'"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4096 config/aarch64/aarch64.c:4112
! #: config/aarch64/aarch64.c:4125 config/aarch64/aarch64.c:4137
! #: config/aarch64/aarch64.c:4148 config/aarch64/aarch64.c:4166
! #: config/aarch64/aarch64.c:4190 config/aarch64/aarch64.c:4241
! #: config/aarch64/aarch64.c:4437 config/aarch64/aarch64.c:4454
  #, c-format
  msgid "invalid operand for '%%%c'"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4208 config/aarch64/aarch64.c:4221
! #: config/aarch64/aarch64.c:4231
  #, c-format
  msgid "incompatible floating point / vector register operand for '%%%c'"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4277 config/arm/arm.c:22251
  #, c-format
  msgid "missing operand"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4340
  #, c-format
  msgid "invalid constant"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4343
  #, c-format
  msgid "invalid operand"
  msgstr ""
  
! #: config/aarch64/aarch64.c:4465
  #, c-format
  msgid "invalid operand prefix '%%%c'"
  msgstr ""
  
! #: config/alpha/alpha.c:5173 config/i386/i386.c:15961
! #: config/rs6000/rs6000.c:19170 config/sparc/sparc.c:8831
  #, c-format
  msgid "'%%&' used without any local dynamic TLS references"
  msgstr ""
*************** msgstr ""
*** 2757,2780 ****
  msgid "invalid %%J value"
  msgstr ""
  
! #: config/alpha/alpha.c:5264 config/ia64/ia64.c:5528
  #, c-format
  msgid "invalid %%r value"
  msgstr ""
  
! #: config/alpha/alpha.c:5274 config/ia64/ia64.c:5482
! #: config/rs6000/rs6000.c:18779 config/xtensa/xtensa.c:2391
  #, c-format
  msgid "invalid %%R value"
  msgstr ""
  
! #: config/alpha/alpha.c:5280 config/rs6000/rs6000.c:18699
  #: config/xtensa/xtensa.c:2358
  #, c-format
  msgid "invalid %%N value"
  msgstr ""
  
! #: config/alpha/alpha.c:5288 config/rs6000/rs6000.c:18727
  #, c-format
  msgid "invalid %%P value"
  msgstr ""
--- 2757,2780 ----
  msgid "invalid %%J value"
  msgstr ""
  
! #: config/alpha/alpha.c:5264 config/ia64/ia64.c:5542
  #, c-format
  msgid "invalid %%r value"
  msgstr ""
  
! #: config/alpha/alpha.c:5274 config/ia64/ia64.c:5496
! #: config/rs6000/rs6000.c:18819 config/xtensa/xtensa.c:2391
  #, c-format
  msgid "invalid %%R value"
  msgstr ""
  
! #: config/alpha/alpha.c:5280 config/rs6000/rs6000.c:18739
  #: config/xtensa/xtensa.c:2358
  #, c-format
  msgid "invalid %%N value"
  msgstr ""
  
! #: config/alpha/alpha.c:5288 config/rs6000/rs6000.c:18767
  #, c-format
  msgid "invalid %%P value"
  msgstr ""
*************** msgstr ""
*** 2789,2800 ****
  msgid "invalid %%L value"
  msgstr ""
  
! #: config/alpha/alpha.c:5343 config/rs6000/rs6000.c:18681
  #, c-format
  msgid "invalid %%m value"
  msgstr ""
  
! #: config/alpha/alpha.c:5351 config/rs6000/rs6000.c:18689
  #, c-format
  msgid "invalid %%M value"
  msgstr ""
--- 2789,2800 ----
  msgid "invalid %%L value"
  msgstr ""
  
! #: config/alpha/alpha.c:5343 config/rs6000/rs6000.c:18721
  #, c-format
  msgid "invalid %%m value"
  msgstr ""
  
! #: config/alpha/alpha.c:5351 config/rs6000/rs6000.c:18729
  #, c-format
  msgid "invalid %%M value"
  msgstr ""
*************** msgid "invalid %%U value"
*** 2805,2811 ****
  msgstr ""
  
  #: config/alpha/alpha.c:5403 config/alpha/alpha.c:5414
! #: config/rs6000/rs6000.c:18787
  #, c-format
  msgid "invalid %%s value"
  msgstr ""
--- 2805,2811 ----
  msgstr ""
  
  #: config/alpha/alpha.c:5403 config/alpha/alpha.c:5414
! #: config/rs6000/rs6000.c:18827
  #, c-format
  msgid "invalid %%s value"
  msgstr ""
*************** msgstr ""
*** 2815,2821 ****
  msgid "invalid %%C value"
  msgstr ""
  
! #: config/alpha/alpha.c:5462 config/rs6000/rs6000.c:18546
  #, c-format
  msgid "invalid %%E value"
  msgstr ""
--- 2815,2821 ----
  msgid "invalid %%C value"
  msgstr ""
  
! #: config/alpha/alpha.c:5462 config/rs6000/rs6000.c:18586
  #, c-format
  msgid "invalid %%E value"
  msgstr ""
*************** msgid "unknown relocation unspec"
*** 2826,2832 ****
  msgstr ""
  
  #: config/alpha/alpha.c:5496 config/cr16/cr16.c:1570
! #: config/rs6000/rs6000.c:19135 config/spu/spu.c:1487
  #, c-format
  msgid "invalid %%xn code"
  msgstr ""
--- 2826,2832 ----
  msgstr ""
  
  #: config/alpha/alpha.c:5496 config/cr16/cr16.c:1570
! #: config/rs6000/rs6000.c:19175 config/spu/spu.c:1487
  #, c-format
  msgid "invalid %%xn code"
  msgstr ""
*************** msgstr ""
*** 2879,2885 ****
  #. Unknown flag.
  #. Undocumented flag.
  #: config/arc/arc.c:3155 config/epiphany/epiphany.c:1318
! #: config/m32r/m32r.c:2247 config/nds32/nds32.c:2329 config/sparc/sparc.c:9010
  #, c-format
  msgid "invalid operand output code"
  msgstr ""
--- 2879,2885 ----
  #. Unknown flag.
  #. Undocumented flag.
  #: config/arc/arc.c:3155 config/epiphany/epiphany.c:1318
! #: config/m32r/m32r.c:2247 config/nds32/nds32.c:2329 config/sparc/sparc.c:9016
  #, c-format
  msgid "invalid operand output code"
  msgstr ""
*************** msgstr ""
*** 2889,2917 ****
  msgid "invalid UNSPEC as operand: %d"
  msgstr ""
  
! #: config/arm/arm.c:18956 config/arm/arm.c:18981 config/arm/arm.c:18991
! #: config/arm/arm.c:19000 config/arm/arm.c:19008
  #, c-format
  msgid "invalid shift operand"
  msgstr ""
  
! #: config/arm/arm.c:21528 config/arm/arm.c:21546
  #, c-format
  msgid "predicated Thumb instruction"
  msgstr ""
  
! #: config/arm/arm.c:21534
  #, c-format
  msgid "predicated instruction in conditional sequence"
  msgstr ""
  
! #: config/arm/arm.c:21788 config/arm/arm.c:21810 config/arm/arm.c:21820
! #: config/arm/arm.c:21830 config/arm/arm.c:21840 config/arm/arm.c:21879
! #: config/arm/arm.c:21897 config/arm/arm.c:21922 config/arm/arm.c:21937
! #: config/arm/arm.c:21964 config/arm/arm.c:21971 config/arm/arm.c:21989
! #: config/arm/arm.c:21996 config/arm/arm.c:22004 config/arm/arm.c:22025
! #: config/arm/arm.c:22032 config/arm/arm.c:22165 config/arm/arm.c:22172
! #: config/arm/arm.c:22199 config/arm/arm.c:22206 config/bfin/bfin.c:1475
  #: config/bfin/bfin.c:1482 config/bfin/bfin.c:1489 config/bfin/bfin.c:1496
  #: config/bfin/bfin.c:1505 config/bfin/bfin.c:1512 config/bfin/bfin.c:1519
  #: config/bfin/bfin.c:1526
--- 2889,2917 ----
  msgid "invalid UNSPEC as operand: %d"
  msgstr ""
  
! #: config/arm/arm.c:18985 config/arm/arm.c:19010 config/arm/arm.c:19020
! #: config/arm/arm.c:19029 config/arm/arm.c:19037
  #, c-format
  msgid "invalid shift operand"
  msgstr ""
  
! #: config/arm/arm.c:21561 config/arm/arm.c:21579
  #, c-format
  msgid "predicated Thumb instruction"
  msgstr ""
  
! #: config/arm/arm.c:21567
  #, c-format
  msgid "predicated instruction in conditional sequence"
  msgstr ""
  
! #: config/arm/arm.c:21821 config/arm/arm.c:21843 config/arm/arm.c:21853
! #: config/arm/arm.c:21863 config/arm/arm.c:21873 config/arm/arm.c:21912
! #: config/arm/arm.c:21930 config/arm/arm.c:21955 config/arm/arm.c:21970
! #: config/arm/arm.c:21997 config/arm/arm.c:22004 config/arm/arm.c:22022
! #: config/arm/arm.c:22029 config/arm/arm.c:22037 config/arm/arm.c:22058
! #: config/arm/arm.c:22065 config/arm/arm.c:22198 config/arm/arm.c:22205
! #: config/arm/arm.c:22232 config/arm/arm.c:22239 config/bfin/bfin.c:1475
  #: config/bfin/bfin.c:1482 config/bfin/bfin.c:1489 config/bfin/bfin.c:1496
  #: config/bfin/bfin.c:1505 config/bfin/bfin.c:1512 config/bfin/bfin.c:1519
  #: config/bfin/bfin.c:1526
*************** msgstr ""
*** 2919,2940 ****
  msgid "invalid operand for code '%c'"
  msgstr ""
  
! #: config/arm/arm.c:21892
  #, c-format
  msgid "instruction never executed"
  msgstr ""
  
  #. Former Maverick support, removed after GCC-4.7.
! #: config/arm/arm.c:21913
  #, c-format
  msgid "obsolete Maverick format code '%c'"
  msgstr ""
  
! #: config/arm/arm.c:23339
  msgid "function parameters cannot have __fp16 type"
  msgstr ""
  
! #: config/arm/arm.c:23349
  msgid "functions cannot return __fp16 type"
  msgstr ""
  
--- 2919,2940 ----
  msgid "invalid operand for code '%c'"
  msgstr ""
  
! #: config/arm/arm.c:21925
  #, c-format
  msgid "instruction never executed"
  msgstr ""
  
  #. Former Maverick support, removed after GCC-4.7.
! #: config/arm/arm.c:21946
  #, c-format
  msgid "obsolete Maverick format code '%c'"
  msgstr ""
  
! #: config/arm/arm.c:23372
  msgid "function parameters cannot have __fp16 type"
  msgstr ""
  
! #: config/arm/arm.c:23382
  msgid "functions cannot return __fp16 type"
  msgstr ""
  
*************** msgstr ""
*** 2976,3007 ****
  msgid "internal compiler error.  Unknown mode:"
  msgstr ""
  
! #: config/avr/avr.c:3426 config/avr/avr.c:4356 config/avr/avr.c:4805
  msgid "invalid insn:"
  msgstr ""
  
! #: config/avr/avr.c:3480 config/avr/avr.c:3585 config/avr/avr.c:3643
! #: config/avr/avr.c:3689 config/avr/avr.c:3708 config/avr/avr.c:3900
! #: config/avr/avr.c:4208 config/avr/avr.c:4492 config/avr/avr.c:4698
! #: config/avr/avr.c:4862 config/avr/avr.c:4956 config/avr/avr.c:5152
  msgid "incorrect insn:"
  msgstr ""
  
! #: config/avr/avr.c:3724 config/avr/avr.c:3999 config/avr/avr.c:4279
! #: config/avr/avr.c:4564 config/avr/avr.c:4744 config/avr/avr.c:5012
! #: config/avr/avr.c:5210
  msgid "unknown move insn:"
  msgstr ""
  
! #: config/avr/avr.c:5641
  msgid "bad shift insn:"
  msgstr ""
  
! #: config/avr/avr.c:5749 config/avr/avr.c:6230 config/avr/avr.c:6645
  msgid "internal compiler error.  Incorrect shift:"
  msgstr ""
  
! #: config/avr/avr.c:7982
  msgid "unsupported fixed-point conversion"
  msgstr ""
  
--- 2976,3007 ----
  msgid "internal compiler error.  Unknown mode:"
  msgstr ""
  
! #: config/avr/avr.c:3462 config/avr/avr.c:4392 config/avr/avr.c:4841
  msgid "invalid insn:"
  msgstr ""
  
! #: config/avr/avr.c:3516 config/avr/avr.c:3621 config/avr/avr.c:3679
! #: config/avr/avr.c:3725 config/avr/avr.c:3744 config/avr/avr.c:3936
! #: config/avr/avr.c:4244 config/avr/avr.c:4528 config/avr/avr.c:4734
! #: config/avr/avr.c:4898 config/avr/avr.c:4992 config/avr/avr.c:5188
  msgid "incorrect insn:"
  msgstr ""
  
! #: config/avr/avr.c:3760 config/avr/avr.c:4035 config/avr/avr.c:4315
! #: config/avr/avr.c:4600 config/avr/avr.c:4780 config/avr/avr.c:5048
! #: config/avr/avr.c:5246
  msgid "unknown move insn:"
  msgstr ""
  
! #: config/avr/avr.c:5677
  msgid "bad shift insn:"
  msgstr ""
  
! #: config/avr/avr.c:5785 config/avr/avr.c:6266 config/avr/avr.c:6681
  msgid "internal compiler error.  Incorrect shift:"
  msgstr ""
  
! #: config/avr/avr.c:8018
  msgid "unsupported fixed-point conversion"
  msgstr ""
  
*************** msgid "invalid const_double operand"
*** 3031,3039 ****
  msgstr ""
  
  #: config/cris/cris.c:645 config/moxie/moxie.c:143 final.c:3440 final.c:3442
! #: fold-const.c:301 gcc.c:4972 gcc.c:4986 loop-iv.c:3100 loop-iv.c:3109
  #: rtl-error.c:103 toplev.c:383 tree-ssa-loop-niter.c:2075 tree-vrp.c:7565
! #: cp/typeck.c:5902 java/expr.c:402 lto/lto-object.c:211 lto/lto-object.c:308
  #: lto/lto-object.c:365 lto/lto-object.c:389
  #, gcc-internal-format, gfc-internal-format
  msgid "%s"
--- 3031,3039 ----
  msgstr ""
  
  #: config/cris/cris.c:645 config/moxie/moxie.c:143 final.c:3440 final.c:3442
! #: fold-const.c:302 gcc.c:4972 gcc.c:4986 loop-iv.c:3100 loop-iv.c:3109
  #: rtl-error.c:103 toplev.c:383 tree-ssa-loop-niter.c:2075 tree-vrp.c:7565
! #: cp/typeck.c:5920 java/expr.c:402 lto/lto-object.c:211 lto/lto-object.c:308
  #: lto/lto-object.c:365 lto/lto-object.c:389
  #, gcc-internal-format, gfc-internal-format
  msgid "%s"
*************** msgstr ""
*** 3253,3315 ****
  msgid "bad output_condmove_single operand"
  msgstr ""
  
! #: config/i386/i386.c:14807
  #, c-format
  msgid "invalid UNSPEC as operand"
  msgstr ""
  
! #: config/i386/i386.c:15521
  #, c-format
  msgid "invalid operand size for operand code 'O'"
  msgstr ""
  
! #: config/i386/i386.c:15556
  #, c-format
  msgid "invalid operand size for operand code 'z'"
  msgstr ""
  
! #: config/i386/i386.c:15626
  #, c-format
  msgid "invalid operand type used with operand code 'Z'"
  msgstr ""
  
! #: config/i386/i386.c:15631
  #, c-format
  msgid "invalid operand size for operand code 'Z'"
  msgstr ""
  
! #: config/i386/i386.c:15707
  #, c-format
  msgid "operand is not a condition code, invalid operand code 'Y'"
  msgstr ""
  
! #: config/i386/i386.c:15780
  #, c-format
  msgid "operand is not a condition code, invalid operand code 'D'"
  msgstr ""
  
! #: config/i386/i386.c:15797
  #, c-format
  msgid "operand is not a condition code, invalid operand code '%c'"
  msgstr ""
  
! #: config/i386/i386.c:15810
  #, c-format
  msgid ""
  "operand is not an offsettable memory reference, invalid operand code 'H'"
  msgstr ""
  
! #: config/i386/i386.c:15975
  #, c-format
  msgid "invalid operand code '%c'"
  msgstr ""
  
! #: config/i386/i386.c:16031
  #, c-format
  msgid "invalid constraints for operand"
  msgstr ""
  
! #: config/i386/i386.c:26087
  msgid "unknown insn mode"
  msgstr ""
  
--- 3253,3315 ----
  msgid "bad output_condmove_single operand"
  msgstr ""
  
! #: config/i386/i386.c:14871
  #, c-format
  msgid "invalid UNSPEC as operand"
  msgstr ""
  
! #: config/i386/i386.c:15585
  #, c-format
  msgid "invalid operand size for operand code 'O'"
  msgstr ""
  
! #: config/i386/i386.c:15620
  #, c-format
  msgid "invalid operand size for operand code 'z'"
  msgstr ""
  
! #: config/i386/i386.c:15690
  #, c-format
  msgid "invalid operand type used with operand code 'Z'"
  msgstr ""
  
! #: config/i386/i386.c:15695
  #, c-format
  msgid "invalid operand size for operand code 'Z'"
  msgstr ""
  
! #: config/i386/i386.c:15771
  #, c-format
  msgid "operand is not a condition code, invalid operand code 'Y'"
  msgstr ""
  
! #: config/i386/i386.c:15844
  #, c-format
  msgid "operand is not a condition code, invalid operand code 'D'"
  msgstr ""
  
! #: config/i386/i386.c:15861
  #, c-format
  msgid "operand is not a condition code, invalid operand code '%c'"
  msgstr ""
  
! #: config/i386/i386.c:15874
  #, c-format
  msgid ""
  "operand is not an offsettable memory reference, invalid operand code 'H'"
  msgstr ""
  
! #: config/i386/i386.c:16039
  #, c-format
  msgid "invalid operand code '%c'"
  msgstr ""
  
! #: config/i386/i386.c:16095
  #, c-format
  msgid "invalid constraints for operand"
  msgstr ""
  
! #: config/i386/i386.c:26171
  msgid "unknown insn mode"
  msgstr ""
  
*************** msgstr ""
*** 3321,3345 ****
  msgid "Use gcc default bitfield layout"
  msgstr ""
  
! #: config/ia64/ia64.c:5410
  #, c-format
  msgid "invalid %%G mode"
  msgstr ""
  
! #: config/ia64/ia64.c:5580
  #, c-format
  msgid "ia64_print_operand: unknown code"
  msgstr ""
  
! #: config/ia64/ia64.c:11156
  msgid "invalid conversion from %<__fpreg%>"
  msgstr ""
  
! #: config/ia64/ia64.c:11159
  msgid "invalid conversion to %<__fpreg%>"
  msgstr ""
  
! #: config/ia64/ia64.c:11172 config/ia64/ia64.c:11183
  msgid "invalid operation on %<__fpreg%>"
  msgstr ""
  
--- 3321,3345 ----
  msgid "Use gcc default bitfield layout"
  msgstr ""
  
! #: config/ia64/ia64.c:5424
  #, c-format
  msgid "invalid %%G mode"
  msgstr ""
  
! #: config/ia64/ia64.c:5594
  #, c-format
  msgid "ia64_print_operand: unknown code"
  msgstr ""
  
! #: config/ia64/ia64.c:11170
  msgid "invalid conversion from %<__fpreg%>"
  msgstr ""
  
! #: config/ia64/ia64.c:11173
  msgid "invalid conversion to %<__fpreg%>"
  msgstr ""
  
! #: config/ia64/ia64.c:11186 config/ia64/ia64.c:11197
  msgid "invalid operation on %<__fpreg%>"
  msgstr ""
  
*************** msgstr ""
*** 3349,3355 ****
  msgid "invalid %%P operand"
  msgstr ""
  
! #: config/iq2000/iq2000.c:3174 config/rs6000/rs6000.c:18717
  #, c-format
  msgid "invalid %%p value"
  msgstr ""
--- 3349,3355 ----
  msgid "invalid %%P operand"
  msgstr ""
  
! #: config/iq2000/iq2000.c:3174 config/rs6000/rs6000.c:18757
  #, c-format
  msgid "invalid %%p value"
  msgstr ""
*************** msgstr ""
*** 3412,3419 ****
  msgid "post-increment address is not a register"
  msgstr ""
  
! #: config/m32r/m32r.c:2351 config/m32r/m32r.c:2366
! #: config/rs6000/rs6000.c:29313
  msgid "bad address"
  msgstr ""
  
--- 3412,3418 ----
  msgid "post-increment address is not a register"
  msgstr ""
  
! #: config/m32r/m32r.c:2351 config/m32r/m32r.c:2366 config/rs6000/rs6000.c:29368
  msgid "bad address"
  msgstr ""
  
*************** msgstr ""
*** 3575,3820 ****
  msgid "-mquad-memory is not available in little endian mode"
  msgstr ""
  
! #: config/rs6000/rs6000.c:8925
  msgid "bad move"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18534
  #, c-format
  msgid "invalid %%e value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18555
  #, c-format
  msgid "invalid %%f value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18564
  #, c-format
  msgid "invalid %%F value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18573
  #, c-format
  msgid "invalid %%G value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18608
  #, c-format
  msgid "invalid %%j code"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18618
  #, c-format
  msgid "invalid %%J code"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18628
  #, c-format
  msgid "invalid %%k value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18643 config/xtensa/xtensa.c:2377
  #, c-format
  msgid "invalid %%K value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18707
  #, c-format
  msgid "invalid %%O value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18754
  #, c-format
  msgid "invalid %%q value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18797
  #, c-format
  msgid "invalid %%S value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18837
  #, c-format
  msgid "invalid %%T value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18849
  #, c-format
  msgid "invalid %%u value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18863 config/xtensa/xtensa.c:2347
  #, c-format
  msgid "invalid %%v value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18937 config/xtensa/xtensa.c:2398
  #, c-format
  msgid "invalid %%x value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:19079
  #, c-format
  msgid "invalid %%y value, try using the 'Z' constraint"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32204
  msgid "AltiVec argument passed to unprototyped function"
  msgstr ""
  
! #: config/rs6000/rs6000.c:33940
  msgid "Could not generate addis value for fusion"
  msgstr ""
  
! #: config/rs6000/rs6000.c:33999
  msgid "Unable to generate load offset for fusion"
  msgstr ""
  
! #: config/s390/s390.c:5396
  #, c-format
  msgid "symbolic memory references are only supported on z10 or later"
  msgstr ""
  
! #: config/s390/s390.c:5407
  #, c-format
  msgid "cannot decompose address"
  msgstr ""
  
! #: config/s390/s390.c:5473
  #, c-format
  msgid "invalid comparison operator for 'E' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5496
  #, c-format
  msgid "invalid reference for 'J' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5510
! #, c-format
! msgid "memory reference expected for 'O' output modifier"
! msgstr ""
! 
! #: config/s390/s390.c:5521
  #, c-format
  msgid "invalid address for 'O' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5539
! #, c-format
! msgid "memory reference expected for 'R' output modifier"
! msgstr ""
! 
! #: config/s390/s390.c:5550
  #, c-format
  msgid "invalid address for 'R' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5568
  #, c-format
  msgid "memory reference expected for 'S' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5578
  #, c-format
  msgid "invalid address for 'S' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5599
  #, c-format
  msgid "register or memory expression expected for 'N' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5610
  #, c-format
  msgid "register or memory expression expected for 'M' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5685 config/s390/s390.c:5705
  #, c-format
  msgid "invalid constant for output modifier '%c'"
  msgstr ""
  
! #: config/s390/s390.c:5702
  #, c-format
  msgid "invalid constant - try using an output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5712
  #, c-format
  msgid "invalid expression - try using an output modifier"
  msgstr ""
  
! #: config/s390/s390.c:5715
  #, c-format
  msgid "invalid expression for output modifier '%c'"
  msgstr ""
  
! #: config/sh/sh.c:1323
  #, c-format
  msgid "invalid operand to %%R"
  msgstr ""
  
! #: config/sh/sh.c:1350
  #, c-format
  msgid "invalid operand to %%S"
  msgstr ""
  
! #: config/sh/sh.c:9957
  msgid "created and used with different architectures / ABIs"
  msgstr ""
  
! #: config/sh/sh.c:9959
  msgid "created and used with different ABIs"
  msgstr ""
  
! #: config/sh/sh.c:9961
  msgid "created and used with different endianness"
  msgstr ""
  
! #: config/sparc/sparc.c:8834 config/sparc/sparc.c:8840
  #, c-format
  msgid "invalid %%Y operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8910
  #, c-format
  msgid "invalid %%A operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8920
  #, c-format
  msgid "invalid %%B operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8949 config/tilegx/tilegx.c:5134
  #: config/tilepro/tilepro.c:4550
  #, c-format
  msgid "invalid %%C operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8966 config/tilegx/tilegx.c:5167
  #, c-format
  msgid "invalid %%D operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8982
  #, c-format
  msgid "invalid %%f operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8996
  #, c-format
  msgid "invalid %%s operand"
  msgstr ""
  
! #: config/sparc/sparc.c:9050
  #, c-format
  msgid "long long constant not a valid immediate operand"
  msgstr ""
  
! #: config/sparc/sparc.c:9053
  #, c-format
  msgid "floating point constant not a valid immediate operand"
  msgstr ""
--- 3574,3836 ----
  msgid "-mquad-memory is not available in little endian mode"
  msgstr ""
  
! #: config/rs6000/rs6000.c:8949
  msgid "bad move"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18574
  #, c-format
  msgid "invalid %%e value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18595
  #, c-format
  msgid "invalid %%f value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18604
  #, c-format
  msgid "invalid %%F value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18613
  #, c-format
  msgid "invalid %%G value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18648
  #, c-format
  msgid "invalid %%j code"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18658
  #, c-format
  msgid "invalid %%J code"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18668
  #, c-format
  msgid "invalid %%k value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18683 config/xtensa/xtensa.c:2377
  #, c-format
  msgid "invalid %%K value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18747
  #, c-format
  msgid "invalid %%O value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18794
  #, c-format
  msgid "invalid %%q value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18837
  #, c-format
  msgid "invalid %%S value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18877
  #, c-format
  msgid "invalid %%T value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18889
  #, c-format
  msgid "invalid %%u value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18903 config/xtensa/xtensa.c:2347
  #, c-format
  msgid "invalid %%v value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:18977 config/xtensa/xtensa.c:2398
  #, c-format
  msgid "invalid %%x value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:19119
  #, c-format
  msgid "invalid %%y value, try using the 'Z' constraint"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32263
  msgid "AltiVec argument passed to unprototyped function"
  msgstr ""
  
! #: config/rs6000/rs6000.c:34001
  msgid "Could not generate addis value for fusion"
  msgstr ""
  
! #: config/rs6000/rs6000.c:34060
  msgid "Unable to generate load offset for fusion"
  msgstr ""
  
! #: config/s390/s390.c:6960
  #, c-format
  msgid "symbolic memory references are only supported on z10 or later"
  msgstr ""
  
! #: config/s390/s390.c:6971
  #, c-format
  msgid "cannot decompose address"
  msgstr ""
  
! #: config/s390/s390.c:7039
  #, c-format
  msgid "invalid comparison operator for 'E' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7062
  #, c-format
  msgid "invalid reference for 'J' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7080
  #, c-format
  msgid "invalid address for 'O' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7102
  #, c-format
  msgid "invalid address for 'R' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7120
  #, c-format
  msgid "memory reference expected for 'S' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7130
  #, c-format
  msgid "invalid address for 'S' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7151
  #, c-format
  msgid "register or memory expression expected for 'N' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7162
  #, c-format
  msgid "register or memory expression expected for 'M' output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7247 config/s390/s390.c:7267
  #, c-format
  msgid "invalid constant for output modifier '%c'"
  msgstr ""
  
! #: config/s390/s390.c:7264
  #, c-format
  msgid "invalid constant - try using an output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7305
! #, c-format
! msgid "invalid constant vector for output modifier '%c'"
! msgstr ""
! 
! #: config/s390/s390.c:7312
  #, c-format
  msgid "invalid expression - try using an output modifier"
  msgstr ""
  
! #: config/s390/s390.c:7315
  #, c-format
  msgid "invalid expression for output modifier '%c'"
  msgstr ""
  
! #: config/s390/s390.c:10991
! msgid "Vector argument passed to unprototyped function"
! msgstr ""
! 
! #: config/s390/s390.c:14176
! msgid "types differ in signess"
! msgstr ""
! 
! #: config/s390/s390.c:14186
! msgid "binary operator does not support two vector bool operands"
! msgstr ""
! 
! #: config/s390/s390.c:14189
! msgid "binary operator does not support vector bool operand"
! msgstr ""
! 
! #: config/s390/s390.c:14197
! msgid ""
! "binary operator does not support mixing vector bool with floating point "
! "vector operands"
! msgstr ""
! 
! #: config/sh/sh.c:1349
  #, c-format
  msgid "invalid operand to %%R"
  msgstr ""
  
! #: config/sh/sh.c:1376
  #, c-format
  msgid "invalid operand to %%S"
  msgstr ""
  
! #: config/sh/sh.c:9983
  msgid "created and used with different architectures / ABIs"
  msgstr ""
  
! #: config/sh/sh.c:9985
  msgid "created and used with different ABIs"
  msgstr ""
  
! #: config/sh/sh.c:9987
  msgid "created and used with different endianness"
  msgstr ""
  
! #: config/sparc/sparc.c:8840 config/sparc/sparc.c:8846
  #, c-format
  msgid "invalid %%Y operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8916
  #, c-format
  msgid "invalid %%A operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8926
  #, c-format
  msgid "invalid %%B operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8955 config/tilegx/tilegx.c:5134
  #: config/tilepro/tilepro.c:4550
  #, c-format
  msgid "invalid %%C operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8972 config/tilegx/tilegx.c:5167
  #, c-format
  msgid "invalid %%D operand"
  msgstr ""
  
! #: config/sparc/sparc.c:8988
  #, c-format
  msgid "invalid %%f operand"
  msgstr ""
  
! #: config/sparc/sparc.c:9002
  #, c-format
  msgid "invalid %%s operand"
  msgstr ""
  
! #: config/sparc/sparc.c:9056
  #, c-format
  msgid "long long constant not a valid immediate operand"
  msgstr ""
  
! #: config/sparc/sparc.c:9059
  #, c-format
  msgid "floating point constant not a valid immediate operand"
  msgstr ""
*************** msgstr ""
*** 4011,4188 ****
  msgid "({anonymous})"
  msgstr ""
  
! #: c/c-parser.c:2022 c/c-parser.c:2036 c/c-parser.c:4592 c/c-parser.c:4996
! #: c/c-parser.c:5117 c/c-parser.c:5410 c/c-parser.c:5574 c/c-parser.c:5605
! #: c/c-parser.c:5778 c/c-parser.c:8404 c/c-parser.c:8439 c/c-parser.c:8470
! #: c/c-parser.c:8517 c/c-parser.c:8698 c/c-parser.c:9478 c/c-parser.c:9548
! #: c/c-parser.c:9591 c/c-parser.c:12688 c/c-parser.c:12707 c/c-parser.c:12725
! #: c/c-parser.c:12879 c/c-parser.c:12922 c/c-parser.c:2806 c/c-parser.c:8691
! #: cp/parser.c:24294 cp/parser.c:24866
  #, gcc-internal-format
  msgid "expected %<;%>"
  msgstr ""
  
! #: c/c-parser.c:2063 c/c-parser.c:2744 c/c-parser.c:3041 c/c-parser.c:3108
! #: c/c-parser.c:3757 c/c-parser.c:3955 c/c-parser.c:3960 c/c-parser.c:5161
! #: c/c-parser.c:5299 c/c-parser.c:5490 c/c-parser.c:5714 c/c-parser.c:5837
! #: c/c-parser.c:6851 c/c-parser.c:7257 c/c-parser.c:7295 c/c-parser.c:7423
! #: c/c-parser.c:7606 c/c-parser.c:7621 c/c-parser.c:7645 c/c-parser.c:8989
! #: c/c-parser.c:9061 c/c-parser.c:10049 c/c-parser.c:10234 c/c-parser.c:10367
! #: c/c-parser.c:10419 c/c-parser.c:10572 c/c-parser.c:10617 c/c-parser.c:10662
! #: c/c-parser.c:10796 c/c-parser.c:10893 c/c-parser.c:11007 c/c-parser.c:11084
! #: c/c-parser.c:11128 c/c-parser.c:11176 c/c-parser.c:11215 c/c-parser.c:11261
! #: c/c-parser.c:11297 c/c-parser.c:11337 c/c-parser.c:11389 c/c-parser.c:11431
! #: c/c-parser.c:11466 c/c-parser.c:11514 c/c-parser.c:11572 c/c-parser.c:12841
! #: c/c-parser.c:14255 c/c-parser.c:14465 c/c-parser.c:14815 c/c-parser.c:14873
! #: c/c-parser.c:15298 c/c-parser.c:10492 c/c-parser.c:10517 cp/parser.c:22591
! #: cp/parser.c:24869
  #, gcc-internal-format
  msgid "expected %<(%>"
  msgstr ""
  
! #: c/c-parser.c:2068 c/c-parser.c:6878 c/c-parser.c:7265 c/c-parser.c:7303
! #: c/c-parser.c:7434 cp/parser.c:24292 cp/parser.c:24884
  #, gcc-internal-format
  msgid "expected %<,%>"
  msgstr ""
  
! #: c/c-parser.c:2089 c/c-parser.c:2456 c/c-parser.c:2759 c/c-parser.c:3082
! #: c/c-parser.c:3119 c/c-parser.c:3334 c/c-parser.c:3520 c/c-parser.c:3582
! #: c/c-parser.c:3634 c/c-parser.c:3764 c/c-parser.c:4048 c/c-parser.c:4059
! #: c/c-parser.c:4068 c/c-parser.c:5164 c/c-parser.c:5314 c/c-parser.c:5637
! #: c/c-parser.c:5772 c/c-parser.c:5845 c/c-parser.c:6414 c/c-parser.c:6626
! #: c/c-parser.c:6701 c/c-parser.c:6791 c/c-parser.c:6994 c/c-parser.c:7186
! #: c/c-parser.c:7204 c/c-parser.c:7225 c/c-parser.c:7274 c/c-parser.c:7378
! #: c/c-parser.c:7447 c/c-parser.c:7614 c/c-parser.c:7637 c/c-parser.c:7658
! #: c/c-parser.c:7872 c/c-parser.c:8247 c/c-parser.c:8783 c/c-parser.c:8804
! #: c/c-parser.c:9012 c/c-parser.c:9067 c/c-parser.c:9450 c/c-parser.c:10086
! #: c/c-parser.c:10237 c/c-parser.c:10370 c/c-parser.c:10450 c/c-parser.c:10579
! #: c/c-parser.c:10624 c/c-parser.c:10669 c/c-parser.c:10719 c/c-parser.c:10874
! #: c/c-parser.c:10957 c/c-parser.c:11014 c/c-parser.c:11091 c/c-parser.c:11135
! #: c/c-parser.c:11201 c/c-parser.c:11248 c/c-parser.c:11276 c/c-parser.c:11312
! #: c/c-parser.c:11365 c/c-parser.c:11371 c/c-parser.c:11408 c/c-parser.c:11420
! #: c/c-parser.c:11437 c/c-parser.c:11473 c/c-parser.c:11485 c/c-parser.c:11533
! #: c/c-parser.c:11541 c/c-parser.c:11576 c/c-parser.c:12761 c/c-parser.c:12887
! #: c/c-parser.c:12933 c/c-parser.c:14444 c/c-parser.c:14517 c/c-parser.c:14851
! #: c/c-parser.c:14935 c/c-parser.c:15307 cp/parser.c:22623 cp/parser.c:24914
  #, gcc-internal-format
  msgid "expected %<)%>"
  msgstr ""
  
! #: c/c-parser.c:3439 c/c-parser.c:4360 c/c-parser.c:4396 c/c-parser.c:5829
! #: c/c-parser.c:7370 c/c-parser.c:7705 c/c-parser.c:7849 c/c-parser.c:10172
! #: c/c-parser.c:15210 c/c-parser.c:15212 c/c-parser.c:15549 cp/parser.c:6487
! #: cp/parser.c:24878
  #, gcc-internal-format
  msgid "expected %<]%>"
  msgstr ""
  
! #: c/c-parser.c:3615
  msgid "expected %<;%>, %<,%> or %<)%>"
  msgstr ""
  
! #: c/c-parser.c:4220 c/c-parser.c:12708 cp/parser.c:24872 cp/parser.c:26744
  #, gcc-internal-format
  msgid "expected %<}%>"
  msgstr ""
  
! #: c/c-parser.c:4529 c/c-parser.c:9032 c/c-parser.c:13288 c/c-parser.c:2624
! #: c/c-parser.c:2827 c/c-parser.c:8586 cp/parser.c:15877 cp/parser.c:24875
  #, gcc-internal-format
  msgid "expected %<{%>"
  msgstr ""
  
! #: c/c-parser.c:4760 c/c-parser.c:4769 c/c-parser.c:5736 c/c-parser.c:6073
! #: c/c-parser.c:6926 c/c-parser.c:8797 c/c-parser.c:9180 c/c-parser.c:9241
! #: c/c-parser.c:10159 c/c-parser.c:10853 c/c-parser.c:11356 c/c-parser.c:14312
! #: c/c-parser.c:14368 cp/parser.c:24908 cp/parser.c:25966
  #, gcc-internal-format
  msgid "expected %<:%>"
  msgstr ""
  
! #: c/c-parser.c:5017 cp/semantics.c:633
  msgid "Cilk array notation cannot be used as a computed goto expression"
  msgstr ""
  
! #: c/c-parser.c:5075
  msgid "Cilk array notation cannot be used for a throw expression"
  msgstr ""
  
! #: c/c-parser.c:5310 cp/semantics.c:1153
  msgid "Cilk array notation cannot be used as a condition for switch statement"
  msgstr ""
  
! #: c/c-parser.c:5354 cp/semantics.c:808
  msgid "Cilk array notation cannot be used as a condition for while statement"
  msgstr ""
  
! #: c/c-parser.c:5396 cp/parser.c:24802
  #, gcc-internal-format
  msgid "expected %<while%>"
  msgstr ""
  
! #: c/c-parser.c:5403 cp/semantics.c:867
  msgid ""
  "Cilk array notation cannot be used as a condition for a do-while statement"
  msgstr ""
  
! #: c/c-parser.c:5601 cp/semantics.c:986
  msgid "Cilk array notation cannot be used in a condition for a for-loop"
  msgstr ""
  
! #: c/c-parser.c:7139
  msgid "expected %<.%>"
  msgstr ""
  
! #: c/c-parser.c:8257 c/c-parser.c:8289 c/c-parser.c:8529 cp/parser.c:26529
! #: cp/parser.c:26603
  #, gcc-internal-format
  msgid "expected %<@end%>"
  msgstr ""
  
! #: c/c-parser.c:8946 cp/parser.c:24893
  #, gcc-internal-format
  msgid "expected %<>%>"
  msgstr ""
  
! #: c/c-parser.c:10961 c/c-parser.c:11489 cp/parser.c:24917
  #, gcc-internal-format
  msgid "expected %<,%> or %<)%>"
  msgstr ""
  
! #: c/c-parser.c:12440 c/c-parser.c:12471 c/c-parser.c:12694 c/c-parser.c:12868
! #: c/c-parser.c:14502 c/c-parser.c:15037 c/c-parser.c:4419 cp/parser.c:24896
  #, gcc-internal-format
  msgid "expected %<=%>"
  msgstr ""
  
! #: c/c-parser.c:13331 c/c-parser.c:13321 cp/parser.c:30896
  #, gcc-internal-format
  msgid "expected %<#pragma omp section%> or %<}%>"
  msgstr ""
  
! #: c/c-parser.c:15198 c/c-parser.c:10134 cp/parser.c:24881 cp/parser.c:27827
  #, gcc-internal-format
  msgid "expected %<[%>"
  msgstr ""
  
! #: c/c-typeck.c:7146
  msgid "(anonymous)"
  msgstr ""
  
! #: cp/call.c:9242
  msgid "candidate 1:"
  msgstr ""
  
! #: cp/call.c:9243
  msgid "candidate 2:"
  msgstr ""
  
! #: cp/decl2.c:778
  msgid "candidates are: %+#D"
  msgstr ""
  
! #: cp/decl2.c:780
  msgid "candidate is: %+#D"
  msgstr ""
  
--- 4027,4204 ----
  msgid "({anonymous})"
  msgstr ""
  
! #: c/c-parser.c:2023 c/c-parser.c:2037 c/c-parser.c:4598 c/c-parser.c:5002
! #: c/c-parser.c:5123 c/c-parser.c:5416 c/c-parser.c:5580 c/c-parser.c:5611
! #: c/c-parser.c:5784 c/c-parser.c:8410 c/c-parser.c:8445 c/c-parser.c:8476
! #: c/c-parser.c:8523 c/c-parser.c:8704 c/c-parser.c:9484 c/c-parser.c:9554
! #: c/c-parser.c:9597 c/c-parser.c:12713 c/c-parser.c:12737 c/c-parser.c:12755
! #: c/c-parser.c:12925 c/c-parser.c:12968 c/c-parser.c:2807 c/c-parser.c:8697
! #: cp/parser.c:24334 cp/parser.c:24907
  #, gcc-internal-format
  msgid "expected %<;%>"
  msgstr ""
  
! #: c/c-parser.c:2064 c/c-parser.c:2745 c/c-parser.c:3042 c/c-parser.c:3109
! #: c/c-parser.c:3758 c/c-parser.c:3956 c/c-parser.c:3961 c/c-parser.c:5167
! #: c/c-parser.c:5305 c/c-parser.c:5496 c/c-parser.c:5720 c/c-parser.c:5843
! #: c/c-parser.c:6857 c/c-parser.c:7263 c/c-parser.c:7301 c/c-parser.c:7429
! #: c/c-parser.c:7612 c/c-parser.c:7627 c/c-parser.c:7651 c/c-parser.c:8995
! #: c/c-parser.c:9067 c/c-parser.c:10055 c/c-parser.c:10240 c/c-parser.c:10373
! #: c/c-parser.c:10425 c/c-parser.c:10578 c/c-parser.c:10623 c/c-parser.c:10668
! #: c/c-parser.c:10802 c/c-parser.c:10899 c/c-parser.c:11013 c/c-parser.c:11090
! #: c/c-parser.c:11134 c/c-parser.c:11182 c/c-parser.c:11221 c/c-parser.c:11267
! #: c/c-parser.c:11303 c/c-parser.c:11343 c/c-parser.c:11395 c/c-parser.c:11437
! #: c/c-parser.c:11472 c/c-parser.c:11520 c/c-parser.c:11578 c/c-parser.c:12872
! #: c/c-parser.c:14301 c/c-parser.c:14511 c/c-parser.c:14861 c/c-parser.c:14919
! #: c/c-parser.c:15344 c/c-parser.c:10498 c/c-parser.c:10523 cp/parser.c:22592
! #: cp/parser.c:24910
  #, gcc-internal-format
  msgid "expected %<(%>"
  msgstr ""
  
! #: c/c-parser.c:2069 c/c-parser.c:6884 c/c-parser.c:7271 c/c-parser.c:7309
! #: c/c-parser.c:7440 cp/parser.c:24332 cp/parser.c:24925
  #, gcc-internal-format
  msgid "expected %<,%>"
  msgstr ""
  
! #: c/c-parser.c:2090 c/c-parser.c:2457 c/c-parser.c:2760 c/c-parser.c:3083
! #: c/c-parser.c:3120 c/c-parser.c:3335 c/c-parser.c:3521 c/c-parser.c:3583
! #: c/c-parser.c:3635 c/c-parser.c:3765 c/c-parser.c:4049 c/c-parser.c:4060
! #: c/c-parser.c:4069 c/c-parser.c:5170 c/c-parser.c:5320 c/c-parser.c:5643
! #: c/c-parser.c:5778 c/c-parser.c:5851 c/c-parser.c:6420 c/c-parser.c:6632
! #: c/c-parser.c:6707 c/c-parser.c:6797 c/c-parser.c:7000 c/c-parser.c:7192
! #: c/c-parser.c:7210 c/c-parser.c:7231 c/c-parser.c:7280 c/c-parser.c:7384
! #: c/c-parser.c:7453 c/c-parser.c:7620 c/c-parser.c:7643 c/c-parser.c:7664
! #: c/c-parser.c:7878 c/c-parser.c:8253 c/c-parser.c:8789 c/c-parser.c:8810
! #: c/c-parser.c:9018 c/c-parser.c:9073 c/c-parser.c:9456 c/c-parser.c:10092
! #: c/c-parser.c:10243 c/c-parser.c:10376 c/c-parser.c:10456 c/c-parser.c:10585
! #: c/c-parser.c:10630 c/c-parser.c:10675 c/c-parser.c:10725 c/c-parser.c:10880
! #: c/c-parser.c:10963 c/c-parser.c:11020 c/c-parser.c:11097 c/c-parser.c:11141
! #: c/c-parser.c:11207 c/c-parser.c:11254 c/c-parser.c:11282 c/c-parser.c:11318
! #: c/c-parser.c:11371 c/c-parser.c:11377 c/c-parser.c:11414 c/c-parser.c:11426
! #: c/c-parser.c:11443 c/c-parser.c:11479 c/c-parser.c:11491 c/c-parser.c:11539
! #: c/c-parser.c:11547 c/c-parser.c:11582 c/c-parser.c:12791 c/c-parser.c:12933
! #: c/c-parser.c:12979 c/c-parser.c:14490 c/c-parser.c:14563 c/c-parser.c:14897
! #: c/c-parser.c:14981 c/c-parser.c:15353 cp/parser.c:22624 cp/parser.c:24955
  #, gcc-internal-format
  msgid "expected %<)%>"
  msgstr ""
  
! #: c/c-parser.c:3440 c/c-parser.c:4365 c/c-parser.c:4401 c/c-parser.c:5835
! #: c/c-parser.c:7376 c/c-parser.c:7711 c/c-parser.c:7855 c/c-parser.c:10178
! #: c/c-parser.c:15256 c/c-parser.c:15258 c/c-parser.c:15595 cp/parser.c:6488
! #: cp/parser.c:24919
  #, gcc-internal-format
  msgid "expected %<]%>"
  msgstr ""
  
! #: c/c-parser.c:3616
  msgid "expected %<;%>, %<,%> or %<)%>"
  msgstr ""
  
! #: c/c-parser.c:4225 c/c-parser.c:12738 cp/parser.c:24913 cp/parser.c:26785
  #, gcc-internal-format
  msgid "expected %<}%>"
  msgstr ""
  
! #: c/c-parser.c:4535 c/c-parser.c:9038 c/c-parser.c:13334 c/c-parser.c:2625
! #: c/c-parser.c:2828 c/c-parser.c:8592 cp/parser.c:15878 cp/parser.c:24916
  #, gcc-internal-format
  msgid "expected %<{%>"
  msgstr ""
  
! #: c/c-parser.c:4766 c/c-parser.c:4775 c/c-parser.c:5742 c/c-parser.c:6079
! #: c/c-parser.c:6932 c/c-parser.c:8803 c/c-parser.c:9186 c/c-parser.c:9247
! #: c/c-parser.c:10165 c/c-parser.c:10859 c/c-parser.c:11362 c/c-parser.c:14358
! #: c/c-parser.c:14414 cp/parser.c:24949 cp/parser.c:26007
  #, gcc-internal-format
  msgid "expected %<:%>"
  msgstr ""
  
! #: c/c-parser.c:5023 cp/semantics.c:633
  msgid "Cilk array notation cannot be used as a computed goto expression"
  msgstr ""
  
! #: c/c-parser.c:5081
  msgid "Cilk array notation cannot be used for a throw expression"
  msgstr ""
  
! #: c/c-parser.c:5316 cp/semantics.c:1153
  msgid "Cilk array notation cannot be used as a condition for switch statement"
  msgstr ""
  
! #: c/c-parser.c:5360 cp/semantics.c:808
  msgid "Cilk array notation cannot be used as a condition for while statement"
  msgstr ""
  
! #: c/c-parser.c:5402 cp/parser.c:24843
  #, gcc-internal-format
  msgid "expected %<while%>"
  msgstr ""
  
! #: c/c-parser.c:5409 cp/semantics.c:867
  msgid ""
  "Cilk array notation cannot be used as a condition for a do-while statement"
  msgstr ""
  
! #: c/c-parser.c:5607 cp/semantics.c:986
  msgid "Cilk array notation cannot be used in a condition for a for-loop"
  msgstr ""
  
! #: c/c-parser.c:7145
  msgid "expected %<.%>"
  msgstr ""
  
! #: c/c-parser.c:8263 c/c-parser.c:8295 c/c-parser.c:8535 cp/parser.c:26570
! #: cp/parser.c:26644
  #, gcc-internal-format
  msgid "expected %<@end%>"
  msgstr ""
  
! #: c/c-parser.c:8952 cp/parser.c:24934
  #, gcc-internal-format
  msgid "expected %<>%>"
  msgstr ""
  
! #: c/c-parser.c:10967 c/c-parser.c:11495 cp/parser.c:24958
  #, gcc-internal-format
  msgid "expected %<,%> or %<)%>"
  msgstr ""
  
! #: c/c-parser.c:12450 c/c-parser.c:12494 c/c-parser.c:12722 c/c-parser.c:12914
! #: c/c-parser.c:14548 c/c-parser.c:15083 c/c-parser.c:4424 cp/parser.c:24937
  #, gcc-internal-format
  msgid "expected %<=%>"
  msgstr ""
  
! #: c/c-parser.c:13377 c/c-parser.c:13367 cp/parser.c:30937
  #, gcc-internal-format
  msgid "expected %<#pragma omp section%> or %<}%>"
  msgstr ""
  
! #: c/c-parser.c:15244 c/c-parser.c:10140 cp/parser.c:24922 cp/parser.c:27868
  #, gcc-internal-format
  msgid "expected %<[%>"
  msgstr ""
  
! #: c/c-typeck.c:7160
  msgid "(anonymous)"
  msgstr ""
  
! #: cp/call.c:9286
  msgid "candidate 1:"
  msgstr ""
  
! #: cp/call.c:9287
  msgid "candidate 2:"
  msgstr ""
  
! #: cp/decl2.c:787
  msgid "candidates are: %+#D"
  msgstr ""
  
! #: cp/decl2.c:789
  msgid "candidate is: %+#D"
  msgstr ""
  
*************** msgstr ""
*** 4246,4402 ****
  msgid "<template arguments error>"
  msgstr ""
  
! #: cp/error.c:1252
  msgid "<enumerator>"
  msgstr ""
  
! #: cp/error.c:1292
  msgid "<declaration error>"
  msgstr ""
  
! #: cp/error.c:1793 cp/error.c:1813
  msgid "<template parameter error>"
  msgstr ""
  
! #: cp/error.c:1943
  msgid "<statement>"
  msgstr ""
  
! #: cp/error.c:1970 cp/error.c:2980 c-family/c-pretty-print.c:2207
  #, gcc-internal-format
  msgid "<unknown>"
  msgstr ""
  
  #. While waiting for caret diagnostics, avoid printing
  #. __cxa_allocate_exception, __cxa_throw, and the like.
! #: cp/error.c:1988
  msgid "<throw-expression>"
  msgstr ""
  
! #: cp/error.c:2089
  msgid "<ubsan routine call>"
  msgstr ""
  
! #: cp/error.c:2546
  msgid "<unparsed>"
  msgstr ""
  
! #: cp/error.c:2693
  msgid "<lambda>"
  msgstr ""
  
! #: cp/error.c:2703
  msgid "*this"
  msgstr ""
  
! #: cp/error.c:2713
  msgid "<expression error>"
  msgstr ""
  
! #: cp/error.c:2728
  msgid "<unknown operator>"
  msgstr ""
  
! #: cp/error.c:3024
  msgid "{unknown}"
  msgstr ""
  
! #: cp/error.c:3136
  msgid "At global scope:"
  msgstr ""
  
! #: cp/error.c:3242
  #, c-format
  msgid "In static member function %qs"
  msgstr ""
  
! #: cp/error.c:3244
  #, c-format
  msgid "In copy constructor %qs"
  msgstr ""
  
! #: cp/error.c:3246
  #, c-format
  msgid "In constructor %qs"
  msgstr ""
  
! #: cp/error.c:3248
  #, c-format
  msgid "In destructor %qs"
  msgstr ""
  
! #: cp/error.c:3250
  msgid "In lambda function"
  msgstr ""
  
! #: cp/error.c:3270
  #, c-format
  msgid "%s: In substitution of %qS:\n"
  msgstr ""
  
! #: cp/error.c:3271
  msgid "%s: In instantiation of %q#D:\n"
  msgstr ""
  
! #: cp/error.c:3296
  msgid "%r%s:%d:%d:%R   "
  msgstr ""
  
! #: cp/error.c:3299
  msgid "%r%s:%d:%R   "
  msgstr ""
  
! #: cp/error.c:3307
  #, c-format
  msgid "recursively required by substitution of %qS\n"
  msgstr ""
  
! #: cp/error.c:3308
  #, c-format
  msgid "required by substitution of %qS\n"
  msgstr ""
  
! #: cp/error.c:3313
  msgid "recursively required from %q#D\n"
  msgstr ""
  
! #: cp/error.c:3314
  msgid "required from %q#D\n"
  msgstr ""
  
! #: cp/error.c:3321
  msgid "recursively required from here"
  msgstr ""
  
! #: cp/error.c:3322
  msgid "required from here"
  msgstr ""
  
! #: cp/error.c:3374
  msgid ""
  "%r%s:%d:%d:%R   [ skipping %d instantiation contexts, use -ftemplate-"
  "backtrace-limit=0 to disable ]\n"
  msgstr ""
  
! #: cp/error.c:3380
  msgid ""
  "%r%s:%d:%R   [ skipping %d instantiation contexts, use -ftemplate-backtrace-"
  "limit=0 to disable ]\n"
  msgstr ""
  
! #: cp/error.c:3435
  msgid "%r%s:%d:%d:%R   in constexpr expansion of %qs"
  msgstr ""
  
! #: cp/error.c:3439
  msgid "%r%s:%d:%R   in constexpr expansion of %qs"
  msgstr ""
  
! #: cp/pt.c:1808 cp/semantics.c:4856
  msgid "candidates are:"
  msgstr ""
  
! #: cp/pt.c:19576
  msgid "candidate is:"
  msgid_plural "candidates are:"
  msgstr[0] ""
--- 4262,4418 ----
  msgid "<template arguments error>"
  msgstr ""
  
! #: cp/error.c:1253
  msgid "<enumerator>"
  msgstr ""
  
! #: cp/error.c:1293
  msgid "<declaration error>"
  msgstr ""
  
! #: cp/error.c:1794 cp/error.c:1814
  msgid "<template parameter error>"
  msgstr ""
  
! #: cp/error.c:1944
  msgid "<statement>"
  msgstr ""
  
! #: cp/error.c:1971 cp/error.c:2981 c-family/c-pretty-print.c:2207
  #, gcc-internal-format
  msgid "<unknown>"
  msgstr ""
  
  #. While waiting for caret diagnostics, avoid printing
  #. __cxa_allocate_exception, __cxa_throw, and the like.
! #: cp/error.c:1989
  msgid "<throw-expression>"
  msgstr ""
  
! #: cp/error.c:2090
  msgid "<ubsan routine call>"
  msgstr ""
  
! #: cp/error.c:2547
  msgid "<unparsed>"
  msgstr ""
  
! #: cp/error.c:2694
  msgid "<lambda>"
  msgstr ""
  
! #: cp/error.c:2704
  msgid "*this"
  msgstr ""
  
! #: cp/error.c:2714
  msgid "<expression error>"
  msgstr ""
  
! #: cp/error.c:2729
  msgid "<unknown operator>"
  msgstr ""
  
! #: cp/error.c:3025
  msgid "{unknown}"
  msgstr ""
  
! #: cp/error.c:3137
  msgid "At global scope:"
  msgstr ""
  
! #: cp/error.c:3243
  #, c-format
  msgid "In static member function %qs"
  msgstr ""
  
! #: cp/error.c:3245
  #, c-format
  msgid "In copy constructor %qs"
  msgstr ""
  
! #: cp/error.c:3247
  #, c-format
  msgid "In constructor %qs"
  msgstr ""
  
! #: cp/error.c:3249
  #, c-format
  msgid "In destructor %qs"
  msgstr ""
  
! #: cp/error.c:3251
  msgid "In lambda function"
  msgstr ""
  
! #: cp/error.c:3271
  #, c-format
  msgid "%s: In substitution of %qS:\n"
  msgstr ""
  
! #: cp/error.c:3272
  msgid "%s: In instantiation of %q#D:\n"
  msgstr ""
  
! #: cp/error.c:3297
  msgid "%r%s:%d:%d:%R   "
  msgstr ""
  
! #: cp/error.c:3300
  msgid "%r%s:%d:%R   "
  msgstr ""
  
! #: cp/error.c:3308
  #, c-format
  msgid "recursively required by substitution of %qS\n"
  msgstr ""
  
! #: cp/error.c:3309
  #, c-format
  msgid "required by substitution of %qS\n"
  msgstr ""
  
! #: cp/error.c:3314
  msgid "recursively required from %q#D\n"
  msgstr ""
  
! #: cp/error.c:3315
  msgid "required from %q#D\n"
  msgstr ""
  
! #: cp/error.c:3322
  msgid "recursively required from here"
  msgstr ""
  
! #: cp/error.c:3323
  msgid "required from here"
  msgstr ""
  
! #: cp/error.c:3375
  msgid ""
  "%r%s:%d:%d:%R   [ skipping %d instantiation contexts, use -ftemplate-"
  "backtrace-limit=0 to disable ]\n"
  msgstr ""
  
! #: cp/error.c:3381
  msgid ""
  "%r%s:%d:%R   [ skipping %d instantiation contexts, use -ftemplate-backtrace-"
  "limit=0 to disable ]\n"
  msgstr ""
  
! #: cp/error.c:3436
  msgid "%r%s:%d:%d:%R   in constexpr expansion of %qs"
  msgstr ""
  
! #: cp/error.c:3440
  msgid "%r%s:%d:%R   in constexpr expansion of %qs"
  msgstr ""
  
! #: cp/pt.c:1809 cp/semantics.c:4857
  msgid "candidates are:"
  msgstr ""
  
! #: cp/pt.c:19705
  msgid "candidate is:"
  msgid_plural "candidates are:"
  msgstr[0] ""
*************** msgstr ""
*** 4438,4489 ****
  msgid "conversion casts away constness"
  msgstr ""
  
! #: cp/rtti.c:777
  msgid "source type is not polymorphic"
  msgstr ""
  
! #: cp/typeck.c:5654 c/c-typeck.c:3884
  #, gcc-internal-format
  msgid "wrong type argument to unary minus"
  msgstr ""
  
! #: cp/typeck.c:5655 c/c-typeck.c:3871
  #, gcc-internal-format
  msgid "wrong type argument to unary plus"
  msgstr ""
  
! #: cp/typeck.c:5682 c/c-typeck.c:3910
  #, gcc-internal-format
  msgid "wrong type argument to bit-complement"
  msgstr ""
  
! #: cp/typeck.c:5689 c/c-typeck.c:3918
  #, gcc-internal-format
  msgid "wrong type argument to abs"
  msgstr ""
  
! #: cp/typeck.c:5701 c/c-typeck.c:3930
  #, gcc-internal-format
  msgid "wrong type argument to conjugation"
  msgstr ""
  
! #: cp/typeck.c:5719
  msgid "in argument to unary !"
  msgstr ""
  
! #: cp/typeck.c:5768
  msgid "no pre-increment operator for type"
  msgstr ""
  
! #: cp/typeck.c:5770
  msgid "no post-increment operator for type"
  msgstr ""
  
! #: cp/typeck.c:5772
  msgid "no pre-decrement operator for type"
  msgstr ""
  
! #: cp/typeck.c:5774
  msgid "no post-decrement operator for type"
  msgstr ""
  
--- 4454,4505 ----
  msgid "conversion casts away constness"
  msgstr ""
  
! #: cp/rtti.c:779
  msgid "source type is not polymorphic"
  msgstr ""
  
! #: cp/typeck.c:5672 c/c-typeck.c:3884
  #, gcc-internal-format
  msgid "wrong type argument to unary minus"
  msgstr ""
  
! #: cp/typeck.c:5673 c/c-typeck.c:3871
  #, gcc-internal-format
  msgid "wrong type argument to unary plus"
  msgstr ""
  
! #: cp/typeck.c:5700 c/c-typeck.c:3910
  #, gcc-internal-format
  msgid "wrong type argument to bit-complement"
  msgstr ""
  
! #: cp/typeck.c:5707 c/c-typeck.c:3918
  #, gcc-internal-format
  msgid "wrong type argument to abs"
  msgstr ""
  
! #: cp/typeck.c:5719 c/c-typeck.c:3930
  #, gcc-internal-format
  msgid "wrong type argument to conjugation"
  msgstr ""
  
! #: cp/typeck.c:5737
  msgid "in argument to unary !"
  msgstr ""
  
! #: cp/typeck.c:5786
  msgid "no pre-increment operator for type"
  msgstr ""
  
! #: cp/typeck.c:5788
  msgid "no post-increment operator for type"
  msgstr ""
  
! #: cp/typeck.c:5790
  msgid "no pre-decrement operator for type"
  msgstr ""
  
! #: cp/typeck.c:5792
  msgid "no post-decrement operator for type"
  msgstr ""
  
*************** msgstr ""
*** 4519,4565 ****
  msgid "elemental binary operation"
  msgstr ""
  
! #: fortran/check.c:2063 fortran/check.c:3054 fortran/check.c:3108
  #, c-format
  msgid "arguments '%s' and '%s' for intrinsic %s"
  msgstr ""
  
! #: fortran/check.c:2860
  #, c-format
  msgid "arguments 'a%d' and 'a%d' for intrinsic '%s'"
  msgstr ""
  
! #: fortran/check.c:3383 fortran/intrinsic.c:4237
  #, c-format
  msgid "arguments '%s' and '%s' for intrinsic '%s'"
  msgstr ""
  
! #: fortran/error.c:827 fortran/error.c:949 fortran/error.c:1087
! #: fortran/error.c:1368
  msgid "Warning:"
  msgstr ""
  
! #: fortran/error.c:951 fortran/error.c:1348 fortran/error.c:1462
  msgid "Error:"
  msgstr ""
  
! #: fortran/error.c:959 fortran/error.c:1028
  msgid "Fortran 2008 obsolescent feature:"
  msgstr ""
  
! #: fortran/error.c:968 fortran/error.c:1037
  msgid "GNU Extension:"
  msgstr ""
  
! #: fortran/error.c:971 fortran/error.c:1040
  msgid "Legacy Extension:"
  msgstr ""
  
! #: fortran/error.c:974 fortran/error.c:1043
  msgid "Obsolescent feature:"
  msgstr ""
  
! #: fortran/error.c:977 fortran/error.c:1046
  msgid "Deleted feature:"
  msgstr ""
  
--- 4535,4581 ----
  msgid "elemental binary operation"
  msgstr ""
  
! #: fortran/check.c:2131 fortran/check.c:3122 fortran/check.c:3176
  #, c-format
  msgid "arguments '%s' and '%s' for intrinsic %s"
  msgstr ""
  
! #: fortran/check.c:2928
  #, c-format
  msgid "arguments 'a%d' and 'a%d' for intrinsic '%s'"
  msgstr ""
  
! #: fortran/check.c:3451 fortran/intrinsic.c:4245
  #, c-format
  msgid "arguments '%s' and '%s' for intrinsic '%s'"
  msgstr ""
  
! #: fortran/error.c:830 fortran/error.c:952 fortran/error.c:1090
! #: fortran/error.c:1371
  msgid "Warning:"
  msgstr ""
  
! #: fortran/error.c:954 fortran/error.c:1351 fortran/error.c:1472
  msgid "Error:"
  msgstr ""
  
! #: fortran/error.c:962 fortran/error.c:1031
  msgid "Fortran 2008 obsolescent feature:"
  msgstr ""
  
! #: fortran/error.c:971 fortran/error.c:1040
  msgid "GNU Extension:"
  msgstr ""
  
! #: fortran/error.c:974 fortran/error.c:1043
  msgid "Legacy Extension:"
  msgstr ""
  
! #: fortran/error.c:977 fortran/error.c:1046
  msgid "Obsolescent feature:"
  msgstr ""
  
! #: fortran/error.c:980 fortran/error.c:1049
  msgid "Deleted feature:"
  msgstr ""
  
*************** msgstr ""
*** 4578,4584 ****
  msgid "Integer value too large in expression at %C"
  msgstr ""
  
! #: fortran/expr.c:3196
  msgid "array assignment"
  msgstr ""
  
--- 4594,4600 ----
  msgid "Integer value too large in expression at %C"
  msgstr ""
  
! #: fortran/expr.c:3207
  msgid "array assignment"
  msgstr ""
  
*************** msgstr ""
*** 4597,4603 ****
  msgid "Driving:"
  msgstr ""
  
! #: fortran/interface.c:2908 fortran/intrinsic.c:3941
  msgid "actual argument to INTENT = OUT/INOUT"
  msgstr ""
  
--- 4613,4619 ----
  msgid "Driving:"
  msgstr ""
  
! #: fortran/interface.c:2926 fortran/intrinsic.c:3949
  msgid "actual argument to INTENT = OUT/INOUT"
  msgstr ""
  
*************** msgstr ""
*** 4658,4675 ****
  msgid "Period required in format specifier"
  msgstr ""
  
! #: fortran/io.c:1532
  #, c-format
  msgid "%s tag"
  msgstr ""
  
! #: fortran/io.c:2861
  msgid "internal unit in WRITE"
  msgstr ""
  
  #. For INQUIRE, all tags except FILE, ID and UNIT are variable definition
  #. contexts.  Thus, use an extended RESOLVE_TAG macro for that.
! #: fortran/io.c:4053
  #, c-format
  msgid "%s tag with INQUIRE"
  msgstr ""
--- 4674,4691 ----
  msgid "Period required in format specifier"
  msgstr ""
  
! #: fortran/io.c:1571
  #, c-format
  msgid "%s tag"
  msgstr ""
  
! #: fortran/io.c:2964
  msgid "internal unit in WRITE"
  msgstr ""
  
  #. For INQUIRE, all tags except FILE, ID and UNIT are variable definition
  #. contexts.  Thus, use an extended RESOLVE_TAG macro for that.
! #: fortran/io.c:4183
  #, c-format
  msgid "%s tag with INQUIRE"
  msgstr ""
*************** msgstr ""
*** 4711,4717 ****
  msgid "Expected integer"
  msgstr ""
  
! #: fortran/module.c:1467 fortran/module.c:2408
  msgid "Expected string"
  msgstr ""
  
--- 4727,4733 ----
  msgid "Expected integer"
  msgstr ""
  
! #: fortran/module.c:1467 fortran/module.c:2414
  msgid "Expected string"
  msgstr ""
  
*************** msgstr ""
*** 4719,4789 ****
  msgid "find_enum(): Enum not found"
  msgstr ""
  
! #: fortran/module.c:2148
  msgid "Expected attribute bit name"
  msgstr ""
  
! #: fortran/module.c:3012
  msgid "Expected integer string"
  msgstr ""
  
! #: fortran/module.c:3016
  msgid "Error converting integer"
  msgstr ""
  
! #: fortran/module.c:3038
  msgid "Expected real string"
  msgstr ""
  
! #: fortran/module.c:3262
  msgid "Expected expression type"
  msgstr ""
  
! #: fortran/module.c:3342
  msgid "Bad operator"
  msgstr ""
  
! #: fortran/module.c:3457
  msgid "Bad type in constant expression"
  msgstr ""
  
! #: fortran/module.c:6741
  msgid "Unexpected end of module"
  msgstr ""
  
! #: fortran/parse.c:1563
  msgid "arithmetic IF"
  msgstr ""
  
! #: fortran/parse.c:1572
  msgid "attribute declaration"
  msgstr ""
  
! #: fortran/parse.c:1608
  msgid "data declaration"
  msgstr ""
  
! #: fortran/parse.c:1617
  msgid "derived type declaration"
  msgstr ""
  
! #: fortran/parse.c:1711
  msgid "block IF"
  msgstr ""
  
! #: fortran/parse.c:1720
  msgid "implied END DO"
  msgstr ""
  
! #: fortran/parse.c:1811 fortran/resolve.c:10175
  msgid "assignment"
  msgstr ""
  
! #: fortran/parse.c:1814 fortran/resolve.c:10220 fortran/resolve.c:10223
  msgid "pointer assignment"
  msgstr ""
  
! #: fortran/parse.c:1832
  msgid "simple IF"
  msgstr ""
  
--- 4735,4805 ----
  msgid "find_enum(): Enum not found"
  msgstr ""
  
! #: fortran/module.c:2151
  msgid "Expected attribute bit name"
  msgstr ""
  
! #: fortran/module.c:3018
  msgid "Expected integer string"
  msgstr ""
  
! #: fortran/module.c:3022
  msgid "Error converting integer"
  msgstr ""
  
! #: fortran/module.c:3044
  msgid "Expected real string"
  msgstr ""
  
! #: fortran/module.c:3268
  msgid "Expected expression type"
  msgstr ""
  
! #: fortran/module.c:3348
  msgid "Bad operator"
  msgstr ""
  
! #: fortran/module.c:3463
  msgid "Bad type in constant expression"
  msgstr ""
  
! #: fortran/module.c:6747
  msgid "Unexpected end of module"
  msgstr ""
  
! #: fortran/parse.c:1636
  msgid "arithmetic IF"
  msgstr ""
  
! #: fortran/parse.c:1645
  msgid "attribute declaration"
  msgstr ""
  
! #: fortran/parse.c:1681
  msgid "data declaration"
  msgstr ""
  
! #: fortran/parse.c:1690
  msgid "derived type declaration"
  msgstr ""
  
! #: fortran/parse.c:1790
  msgid "block IF"
  msgstr ""
  
! #: fortran/parse.c:1799
  msgid "implied END DO"
  msgstr ""
  
! #: fortran/parse.c:1890 fortran/resolve.c:10297
  msgid "assignment"
  msgstr ""
  
! #: fortran/parse.c:1893 fortran/resolve.c:10347 fortran/resolve.c:10350
  msgid "pointer assignment"
  msgstr ""
  
! #: fortran/parse.c:1911
  msgid "simple IF"
  msgstr ""
  
*************** msgstr ""
*** 4937,4983 ****
  msgid "Inconsistent ranks for operator at %%L and %%L"
  msgstr ""
  
! #: fortran/resolve.c:6380
  msgid "Loop variable"
  msgstr ""
  
! #: fortran/resolve.c:6384
  msgid "iterator variable"
  msgstr ""
  
! #: fortran/resolve.c:6388
  msgid "Start expression in DO loop"
  msgstr ""
  
! #: fortran/resolve.c:6392
  msgid "End expression in DO loop"
  msgstr ""
  
! #: fortran/resolve.c:6396
  msgid "Step expression in DO loop"
  msgstr ""
  
! #: fortran/resolve.c:6653 fortran/resolve.c:6656
  msgid "DEALLOCATE object"
  msgstr ""
  
! #: fortran/resolve.c:7008 fortran/resolve.c:7011
  msgid "ALLOCATE object"
  msgstr ""
  
! #: fortran/resolve.c:7213 fortran/resolve.c:8567
  msgid "STAT variable"
  msgstr ""
  
! #: fortran/resolve.c:7257 fortran/resolve.c:8579
  msgid "ERRMSG variable"
  msgstr ""
  
! #: fortran/resolve.c:8428
  msgid "item in READ"
  msgstr ""
  
! #: fortran/resolve.c:8591
  msgid "ACQUIRED_LOCK variable"
  msgstr ""
  
--- 4953,4999 ----
  msgid "Inconsistent ranks for operator at %%L and %%L"
  msgstr ""
  
! #: fortran/resolve.c:6391
  msgid "Loop variable"
  msgstr ""
  
! #: fortran/resolve.c:6395
  msgid "iterator variable"
  msgstr ""
  
! #: fortran/resolve.c:6399
  msgid "Start expression in DO loop"
  msgstr ""
  
! #: fortran/resolve.c:6403
  msgid "End expression in DO loop"
  msgstr ""
  
! #: fortran/resolve.c:6407
  msgid "Step expression in DO loop"
  msgstr ""
  
! #: fortran/resolve.c:6664 fortran/resolve.c:6667
  msgid "DEALLOCATE object"
  msgstr ""
  
! #: fortran/resolve.c:7034 fortran/resolve.c:7037
  msgid "ALLOCATE object"
  msgstr ""
  
! #: fortran/resolve.c:7246 fortran/resolve.c:8631
  msgid "STAT variable"
  msgstr ""
  
! #: fortran/resolve.c:7290 fortran/resolve.c:8643
  msgid "ERRMSG variable"
  msgstr ""
  
! #: fortran/resolve.c:8473
  msgid "item in READ"
  msgstr ""
  
! #: fortran/resolve.c:8655
  msgid "ACQUIRED_LOCK variable"
  msgstr ""
  
*************** msgstr ""
*** 4986,5025 ****
  msgid "Different CHARACTER lengths (%ld/%ld) in array constructor"
  msgstr ""
  
! #: fortran/trans-array.c:5307
  msgid "Integer overflow when calculating the amount of memory to allocate"
  msgstr ""
  
! #: fortran/trans-decl.c:5315
  #, c-format
  msgid ""
  "Actual string length does not match the declared one for dummy argument "
  "'%s' (%ld/%ld)"
  msgstr ""
  
! #: fortran/trans-decl.c:5323
  #, c-format
  msgid ""
  "Actual string length is shorter than the declared one for dummy argument "
  "'%s' (%ld/%ld)"
  msgstr ""
  
! #: fortran/trans-expr.c:7807
  #, c-format
  msgid "Target of rank remapping is too small (%ld < %ld)"
  msgstr ""
  
  #: fortran/trans-intrinsic.c:908
  #, c-format
  msgid "Unequal character lengths (%ld/%ld) in %s"
  msgstr ""
  
! #: fortran/trans-intrinsic.c:6947
  #, c-format
  msgid "Argument NCOPIES of REPEAT intrinsic is negative (its value is %ld)"
  msgstr ""
  
! #: fortran/trans-intrinsic.c:6979
  msgid "Argument NCOPIES of REPEAT intrinsic is too large"
  msgstr ""
  
--- 5002,5045 ----
  msgid "Different CHARACTER lengths (%ld/%ld) in array constructor"
  msgstr ""
  
! #: fortran/trans-array.c:5324
  msgid "Integer overflow when calculating the amount of memory to allocate"
  msgstr ""
  
! #: fortran/trans-decl.c:5425
  #, c-format
  msgid ""
  "Actual string length does not match the declared one for dummy argument "
  "'%s' (%ld/%ld)"
  msgstr ""
  
! #: fortran/trans-decl.c:5433
  #, c-format
  msgid ""
  "Actual string length is shorter than the declared one for dummy argument "
  "'%s' (%ld/%ld)"
  msgstr ""
  
! #: fortran/trans-expr.c:7953
  #, c-format
  msgid "Target of rank remapping is too small (%ld < %ld)"
  msgstr ""
  
+ #: fortran/trans-expr.c:9157
+ msgid "Assignment of scalar to unallocated array"
+ msgstr ""
+ 
  #: fortran/trans-intrinsic.c:908
  #, c-format
  msgid "Unequal character lengths (%ld/%ld) in %s"
  msgstr ""
  
! #: fortran/trans-intrinsic.c:6978
  #, c-format
  msgid "Argument NCOPIES of REPEAT intrinsic is negative (its value is %ld)"
  msgstr ""
  
! #: fortran/trans-intrinsic.c:7010
  msgid "Argument NCOPIES of REPEAT intrinsic is too large"
  msgstr ""
  
*************** msgstr ""
*** 5035,5050 ****
  msgid "Assigned label is not a target label"
  msgstr ""
  
! #: fortran/trans-stmt.c:929
  #, c-format
  msgid "Invalid image number %d in SYNC IMAGES"
  msgstr ""
  
! #: fortran/trans-stmt.c:1670 fortran/trans-stmt.c:1955
  msgid "Loop variable has been modified"
  msgstr ""
  
! #: fortran/trans-stmt.c:1810
  msgid "DO step value is zero"
  msgstr ""
  
--- 5055,5070 ----
  msgid "Assigned label is not a target label"
  msgstr ""
  
! #: fortran/trans-stmt.c:1107
  #, c-format
  msgid "Invalid image number %d in SYNC IMAGES"
  msgstr ""
  
! #: fortran/trans-stmt.c:1883 fortran/trans-stmt.c:2168
  msgid "Loop variable has been modified"
  msgstr ""
  
! #: fortran/trans-stmt.c:2023
  msgid "DO step value is zero"
  msgstr ""
  
*************** msgstr ""
*** 5056,5079 ****
  msgid "Incorrect function return value"
  msgstr ""
  
! #: fortran/trans.c:588
  msgid "Memory allocation failed"
  msgstr ""
  
! #: fortran/trans.c:674 fortran/trans.c:1513
  msgid "Allocation would exceed memory limit"
  msgstr ""
  
! #: fortran/trans.c:836
  #, c-format
  msgid "Attempting to allocate already allocated variable '%s'"
  msgstr ""
  
! #: fortran/trans.c:842
  msgid "Attempting to allocate already allocated variable"
  msgstr ""
  
! #: fortran/trans.c:1266 fortran/trans.c:1412
  #, c-format
  msgid "Attempt to DEALLOCATE unallocated '%s'"
  msgstr ""
--- 5076,5099 ----
  msgid "Incorrect function return value"
  msgstr ""
  
! #: fortran/trans.c:607
  msgid "Memory allocation failed"
  msgstr ""
  
! #: fortran/trans.c:693 fortran/trans.c:1558
  msgid "Allocation would exceed memory limit"
  msgstr ""
  
! #: fortran/trans.c:871
  #, c-format
  msgid "Attempting to allocate already allocated variable '%s'"
  msgstr ""
  
! #: fortran/trans.c:877
  msgid "Attempting to allocate already allocated variable"
  msgstr ""
  
! #: fortran/trans.c:1301 fortran/trans.c:1457
  #, c-format
  msgid "Attempt to DEALLOCATE unallocated '%s'"
  msgstr ""
*************** msgstr ""
*** 5355,5443 ****
  msgid "-private_bundle not allowed with -dynamiclib"
  msgstr ""
  
! #: config/rx/rx.h:75
! msgid "-mas100-syntax is incompatible with -gdwarf"
  msgstr ""
  
! #: config/rx/rx.h:76
! msgid "rx100 cpu does not have FPU hardware"
  msgstr ""
  
! #: config/rx/rx.h:77
! msgid "rx200 cpu does not have FPU hardware"
  msgstr ""
  
! #: config/sol2.h:222 config/sol2.h:227
  msgid "does not support multilib"
  msgstr ""
  
! #: config/arc/arc.h:128 config/mips/mips.h:1322
! msgid "may not use both -EB and -EL"
  msgstr ""
  
  #: config/vxworks.h:70
  msgid "-Xbind-now and -Xbind-lazy are incompatible"
  msgstr ""
  
! #: config/vax/vax.h:46 config/vax/vax.h:47
! msgid "profiling not supported with -mg"
! msgstr ""
! 
! #: config/mips/r3900.h:37
! msgid "-mhard-float not supported"
! msgstr ""
! 
! #: config/mips/r3900.h:39
! msgid "-msingle-float and -msoft-float cannot both be specified"
! msgstr ""
! 
! #: config/cris/cris.h:184
! msgid "do not specify both -march=... and -mcpu=..."
! msgstr ""
! 
! #: objc/lang-specs.h:30 objc/lang-specs.h:41
! msgid "GNU Objective C no longer supports traditional compilation"
! msgstr ""
! 
! #: objc/lang-specs.h:55
! msgid ""
! "objc-cpp-output is deprecated; please use objective-c-cpp-output instead"
! msgstr ""
! 
! #: ada/gcc-interface/lang-specs.h:34
! msgid "-c or -S required for Ada"
! msgstr ""
! 
! #: ada/gcc-interface/lang-specs.h:52
! msgid "-c required for gnat2why"
! msgstr ""
! 
! #: ada/gcc-interface/lang-specs.h:65
! msgid "-c required for gnat2scil"
! msgstr ""
! 
! #: config/nios2/elf.h:44
! msgid "You need a C startup file for -msys-crt0="
! msgstr ""
! 
! #: config/dragonfly.h:76 config/sparc/freebsd.h:45 config/rs6000/sysv4.h:731
! #: config/alpha/freebsd.h:33 config/ia64/freebsd.h:26 config/i386/freebsd.h:82
! #: config/i386/freebsd64.h:35
! msgid "consider using '-pg' instead of '-p' with gprof(1)"
! msgstr ""
! 
! #: config/sparc/linux64.h:149 config/sparc/linux64.h:156
! #: config/sparc/netbsd-elf.h:108 config/sparc/netbsd-elf.h:117
! #: config/sparc/sol2.h:219 config/sparc/sol2.h:225
! msgid "may not use both -m32 and -m64"
! msgstr ""
! 
! #: config/rs6000/freebsd64.h:161 config/rs6000/freebsd64.h:173
! msgid "consider using `-pg' instead of `-p' with gprof(1)"
! msgstr ""
! 
! #: config/s390/tpf.h:106
! msgid "static is not supported on TPF-OS"
  msgstr ""
  
  #: config/arm/arm.h:225
--- 5375,5408 ----
  msgid "-private_bundle not allowed with -dynamiclib"
  msgstr ""
  
! #: config/dragonfly.h:76 config/alpha/freebsd.h:33 config/i386/freebsd.h:82
! #: config/i386/freebsd64.h:35 config/ia64/freebsd.h:26
! #: config/rs6000/sysv4.h:726 config/sparc/freebsd.h:45
! msgid "consider using '-pg' instead of '-p' with gprof(1)"
  msgstr ""
  
! #: config/lynx.h:69
! msgid "cannot use mthreads and mlegacy-threads together"
  msgstr ""
  
! #: config/lynx.h:94
! msgid "cannot use mshared and static together"
  msgstr ""
  
! #: config/sol2.h:242 config/sol2.h:247
  msgid "does not support multilib"
  msgstr ""
  
! #: config/sol2.h:337
! msgid "-pie is not supported in this configuration"
  msgstr ""
  
  #: config/vxworks.h:70
  msgid "-Xbind-now and -Xbind-lazy are incompatible"
  msgstr ""
  
! #: config/arc/arc.h:128 config/mips/mips.h:1322
! msgid "may not use both -EB and -EL"
  msgstr ""
  
  #: config/arm/arm.h:225
*************** msgstr ""
*** 5448,5496 ****
  msgid "-mbig-endian and -mlittle-endian may not be used together"
  msgstr ""
  
! #: config/mcore/mcore.h:53
! msgid "the m210 does not have little endian support"
  msgstr ""
  
  #: config/avr/specs.h:68
  msgid "shared is not supported"
  msgstr ""
  
! #: objcp/lang-specs.h:58
! msgid ""
! "objc++-cpp-output is deprecated; please use objective-c++-cpp-output instead"
  msgstr ""
  
! #: fortran/lang-specs.h:54 fortran/lang-specs.h:68
! msgid "gfortran does not support -E without -cpp"
  msgstr ""
  
! #: config/arm/freebsd.h:49
! msgid "consider using `-pg' instead of `-p' with gprof (1) "
  msgstr ""
  
! #: config/i386/mingw-w64.h:87 config/i386/cygwin-w64.h:64
! #: config/i386/mingw32.h:117 config/i386/cygwin.h:129
! msgid "shared and mdll are not compatible"
  msgstr ""
  
! #: config/bfin/elf.h:55
! msgid "no processor type specified for linking"
  msgstr ""
  
  #: config/pa/pa-hpux10.h:102 config/pa/pa-hpux10.h:105
  #: config/pa/pa-hpux10.h:113 config/pa/pa-hpux10.h:116
! #: config/pa/pa-hpux11.h:134 config/pa/pa-hpux11.h:137
! #: config/pa/pa64-hpux.h:29 config/pa/pa64-hpux.h:32 config/pa/pa64-hpux.h:41
! #: config/pa/pa64-hpux.h:44
  msgid "warning: consider linking with '-static' as system libraries with"
  msgstr ""
  
  #: config/pa/pa-hpux10.h:103 config/pa/pa-hpux10.h:106
  #: config/pa/pa-hpux10.h:114 config/pa/pa-hpux10.h:117
! #: config/pa/pa-hpux11.h:135 config/pa/pa-hpux11.h:138
! #: config/pa/pa64-hpux.h:30 config/pa/pa64-hpux.h:33 config/pa/pa64-hpux.h:42
! #: config/pa/pa64-hpux.h:45
  msgid "  profiling support are only provided in archive format"
  msgstr ""
  
--- 5413,5466 ----
  msgid "-mbig-endian and -mlittle-endian may not be used together"
  msgstr ""
  
! #: config/arm/freebsd.h:49
! msgid "consider using `-pg' instead of `-p' with gprof (1) "
  msgstr ""
  
  #: config/avr/specs.h:68
  msgid "shared is not supported"
  msgstr ""
  
! #: config/bfin/elf.h:55
! msgid "no processor type specified for linking"
  msgstr ""
  
! #: config/cris/cris.h:184
! msgid "do not specify both -march=... and -mcpu=..."
  msgstr ""
  
! #: config/i386/cygwin-w64.h:64 config/i386/cygwin.h:129
! #: config/i386/mingw-w64.h:87 config/i386/mingw32.h:117
! msgid "shared and mdll are not compatible"
  msgstr ""
  
! #: config/mcore/mcore.h:53
! msgid "the m210 does not have little endian support"
  msgstr ""
  
! #: config/mips/r3900.h:37
! msgid "-mhard-float not supported"
! msgstr ""
! 
! #: config/mips/r3900.h:39
! msgid "-msingle-float and -msoft-float cannot both be specified"
! msgstr ""
! 
! #: config/nios2/elf.h:44
! msgid "You need a C startup file for -msys-crt0="
  msgstr ""
  
  #: config/pa/pa-hpux10.h:102 config/pa/pa-hpux10.h:105
  #: config/pa/pa-hpux10.h:113 config/pa/pa-hpux10.h:116
! #: config/pa/pa-hpux11.h:134 config/pa/pa-hpux11.h:137 config/pa/pa64-hpux.h:29
! #: config/pa/pa64-hpux.h:32 config/pa/pa64-hpux.h:41 config/pa/pa64-hpux.h:44
  msgid "warning: consider linking with '-static' as system libraries with"
  msgstr ""
  
  #: config/pa/pa-hpux10.h:103 config/pa/pa-hpux10.h:106
  #: config/pa/pa-hpux10.h:114 config/pa/pa-hpux10.h:117
! #: config/pa/pa-hpux11.h:135 config/pa/pa-hpux11.h:138 config/pa/pa64-hpux.h:30
! #: config/pa/pa64-hpux.h:33 config/pa/pa64-hpux.h:42 config/pa/pa64-hpux.h:45
  msgid "  profiling support are only provided in archive format"
  msgstr ""
  
*************** msgstr ""
*** 5498,8560 ****
  msgid " conflicting code gen style switches are used"
  msgstr ""
  
! #: config/sh/sh.h:375 config/sh/sh.h:378
! msgid "SH2a does not support little-endian"
! msgstr ""
! 
! #: config/lynx.h:69
! msgid "cannot use mthreads and mlegacy-threads together"
! msgstr ""
! 
! #: config/lynx.h:94
! msgid "cannot use mshared and static together"
! msgstr ""
! 
! #: java/lang-specs.h:32
! msgid "-fjni and -femit-class-files are incompatible"
! msgstr ""
! 
! #: java/lang-specs.h:33
! msgid "-fjni and -femit-class-file are incompatible"
! msgstr ""
! 
! #: java/lang-specs.h:34 java/lang-specs.h:35
! msgid "-femit-class-file should used along with -fsyntax-only"
! msgstr ""
! 
! #: config/vax/netbsd-elf.h:51
! msgid "the -shared option is not currently supported for VAX ELF"
! msgstr ""
! 
! #: fortran/lang.opt:146
! msgid "-J<directory>\tPut MODULE files in 'directory'"
! msgstr ""
! 
! #: fortran/lang.opt:198
! msgid "Warn about possible aliasing of dummy arguments"
! msgstr ""
! 
! #: fortran/lang.opt:202
! msgid "Warn about alignment of COMMON blocks"
! msgstr ""
! 
! #: fortran/lang.opt:206
! msgid "Warn about missing ampersand in continued character constants"
! msgstr ""
! 
! #: fortran/lang.opt:210
! msgid "Warn about creation of array temporaries"
! msgstr ""
! 
! #: fortran/lang.opt:214
! msgid "Warn if the type of a variable might be not interoperable with C"
! msgstr ""
! 
! #: fortran/lang.opt:222
! msgid "Warn about truncated character expressions"
! msgstr ""
! 
! #: fortran/lang.opt:226
! msgid "Warn about equality comparisons involving REAL or COMPLEX expressions"
! msgstr ""
! 
! #: fortran/lang.opt:234
! msgid "Warn about most implicit conversions"
! msgstr ""
! 
! #: fortran/lang.opt:242
! msgid "Warn about function call elimination"
! msgstr ""
! 
! #: fortran/lang.opt:246
! msgid "Warn about calls with implicit interface"
! msgstr ""
! 
! #: fortran/lang.opt:250
! msgid "Warn about called procedures not explicitly declared"
! msgstr ""
! 
! #: fortran/lang.opt:254
! msgid "Warn about truncated source lines"
! msgstr ""
! 
! #: fortran/lang.opt:258
! msgid "Warn on intrinsics not part of the selected standard"
! msgstr ""
! 
! #: fortran/lang.opt:270
! msgid "Warn about USE statements that have no ONLY qualifier"
! msgstr ""
! 
! #: fortran/lang.opt:282
! msgid "Warn about real-literal-constants with 'q' exponent-letter"
! msgstr ""
! 
! #: fortran/lang.opt:286
! msgid "Warn when a left-hand-side array variable is reallocated"
! msgstr ""
! 
! #: fortran/lang.opt:290
! msgid "Warn when a left-hand-side variable is reallocated"
  msgstr ""
  
! #: fortran/lang.opt:294
! msgid "Warn if the pointer in a pointer assignment might outlive its target"
  msgstr ""
  
! #: fortran/lang.opt:302
! msgid "Warn about \"suspicious\" constructs"
  msgstr ""
  
! #: fortran/lang.opt:306
! msgid "Permit nonconforming uses of the tab character"
  msgstr ""
  
! #: fortran/lang.opt:310
! msgid "Warn about underflow of numerical constant expressions"
  msgstr ""
  
! #: fortran/lang.opt:318
! msgid "Warn if a user-procedure has the same name as an intrinsic"
  msgstr ""
  
! #: fortran/lang.opt:326
! msgid "Warn about unused dummy arguments."
  msgstr ""
  
! #: fortran/lang.opt:330
! msgid "Warn about zero-trip DO loops"
  msgstr ""
  
! #: fortran/lang.opt:334
! msgid "Enable preprocessing"
  msgstr ""
  
! #: fortran/lang.opt:342
! msgid "Disable preprocessing"
  msgstr ""
  
! #: fortran/lang.opt:350
! msgid "Eliminate multiple function invokations also for impure functions"
  msgstr ""
  
! #: fortran/lang.opt:354
! msgid "Enable alignment of COMMON blocks"
  msgstr ""
  
! #: fortran/lang.opt:358
! msgid "All intrinsics procedures are available regardless of selected standard"
  msgstr ""
  
! #: fortran/lang.opt:366
! msgid ""
! "Do not treat local variables and COMMON blocks as if they were named in SAVE "
! "statements"
  msgstr ""
  
! #: fortran/lang.opt:370
! msgid "Specify that backslash in string introduces an escape character"
  msgstr ""
  
! #: fortran/lang.opt:374
! msgid "Produce a backtrace when a runtime error is encountered"
  msgstr ""
  
! #: fortran/lang.opt:378
! msgid ""
! "-fblas-matmul-limit=<n>\tSize of the smallest matrix for which matmul will "
! "use BLAS"
  msgstr ""
  
! #: fortran/lang.opt:382
  msgid ""
! "Produce a warning at runtime if a array temporary has been created for a "
! "procedure argument"
  msgstr ""
  
! #: fortran/lang.opt:386
  msgid ""
! "-fconvert=<big-endian|little-endian|native|swap> The endianness used for "
! "unformatted files."
! msgstr ""
! 
! #: fortran/lang.opt:389
! #, c-format
! msgid "Unrecognized option to endianess value: %qs"
! msgstr ""
! 
! #: fortran/lang.opt:405
! msgid "Use the Cray Pointer extension"
! msgstr ""
! 
! #: fortran/lang.opt:409
! msgid "Ignore 'D' in column one in fixed form"
! msgstr ""
! 
! #: fortran/lang.opt:413
! msgid "Treat lines with 'D' in column one as comments"
! msgstr ""
! 
! #: fortran/lang.opt:417
! msgid "Set the default double precision kind to an 8 byte wide type"
! msgstr ""
! 
! #: fortran/lang.opt:421
! msgid "Set the default integer kind to an 8 byte wide type"
  msgstr ""
  
! #: fortran/lang.opt:425
! msgid "Set the default real kind to an 8 byte wide type"
  msgstr ""
  
! #: fortran/lang.opt:429
! msgid "Allow dollar signs in entity names"
  msgstr ""
  
! #: fortran/lang.opt:433 config/alpha/alpha.opt:31 common.opt:696
! #: common.opt:881 common.opt:885 common.opt:889 common.opt:893 common.opt:1349
! #: common.opt:1498 common.opt:1502 common.opt:1724 common.opt:1866
! #: common.opt:2489
  msgid "Does nothing. Preserved for backward compatibility."
  msgstr ""
  
! #: fortran/lang.opt:437
! msgid "Display the code tree after parsing"
! msgstr ""
! 
! #: fortran/lang.opt:441
! msgid "Display the code tree after front end optimization"
! msgstr ""
! 
! #: fortran/lang.opt:445
! msgid "Display the code tree after parsing; deprecated option"
! msgstr ""
! 
! #: fortran/lang.opt:449
! msgid ""
! "Specify that an external BLAS library should be used for matmul calls on "
! "large-size arrays"
! msgstr ""
! 
! #: fortran/lang.opt:453
! msgid "Use f2c calling convention"
! msgstr ""
! 
! #: fortran/lang.opt:457
! msgid "Assume that the source file is fixed form"
! msgstr ""
! 
! #: fortran/lang.opt:461
! msgid "Interpret any INTEGER(4) as an INTEGER(8)"
! msgstr ""
! 
! #: fortran/lang.opt:465 fortran/lang.opt:469
! msgid "Specify where to find the compiled intrinsic modules"
! msgstr ""
! 
! #: fortran/lang.opt:473
! msgid "Allow arbitrary character line width in fixed mode"
! msgstr ""
! 
! #: fortran/lang.opt:477
! msgid "-ffixed-line-length-<n>\tUse n as character line width in fixed mode"
! msgstr ""
! 
! #: fortran/lang.opt:481
! msgid "-ffpe-trap=[...]\tStop on following floating point exceptions"
  msgstr ""
  
! #: fortran/lang.opt:485
! msgid "-ffpe-summary=[...]\tPrint summary of floating point exceptions"
  msgstr ""
  
! #: fortran/lang.opt:489
! msgid "Assume that the source file is free form"
  msgstr ""
  
! #: fortran/lang.opt:493
! msgid "Allow arbitrary character line width in free mode"
  msgstr ""
  
! #: fortran/lang.opt:497
! msgid "-ffree-line-length-<n>\tUse n as character line width in free mode"
  msgstr ""
  
! #: fortran/lang.opt:501
! msgid "Enable front end optimization"
  msgstr ""
  
! #: fortran/lang.opt:505
! msgid ""
! "Specify that no implicit typing is allowed, unless overridden by explicit "
! "IMPLICIT statements"
  msgstr ""
  
! #: fortran/lang.opt:509
! msgid ""
! "-finit-character=<n>\tInitialize local character variables to ASCII value n"
  msgstr ""
  
! #: fortran/lang.opt:513
! msgid "-finit-integer=<n>\tInitialize local integer variables to n"
  msgstr ""
  
! #: fortran/lang.opt:517
! msgid "Initialize local variables to zero (from g77)"
  msgstr ""
  
! #: fortran/lang.opt:521
! msgid "-finit-logical=<true|false>\tInitialize local logical variables"
  msgstr ""
  
! #: fortran/lang.opt:525
! msgid "-finit-real=<zero|snan|nan|inf|-inf>\tInitialize local real variables"
  msgstr ""
  
! #: fortran/lang.opt:528
! #, c-format
! msgid "Unrecognized option to floating-point init value: %qs"
  msgstr ""
  
! #: fortran/lang.opt:547
! msgid ""
! "-fmax-array-constructor=<n>\tMaximum number of objects in an array "
! "constructor"
  msgstr ""
  
! #: fortran/lang.opt:551
! msgid "-fmax-identifier-length=<n>\tMaximum identifier length"
  msgstr ""
  
! #: fortran/lang.opt:555
! msgid "-fmax-subrecord-length=<n>\tMaximum length for subrecords"
  msgstr ""
  
! #: fortran/lang.opt:559
! msgid ""
! "-fmax-stack-var-size=<n>\tSize in bytes of the largest array that will be "
! "put on the stack"
  msgstr ""
  
! #: fortran/lang.opt:563
! msgid "Put all local arrays on stack."
  msgstr ""
  
! #: fortran/lang.opt:567
! msgid "Set default accessibility of module entities to PRIVATE."
  msgstr ""
  
! #: fortran/lang.opt:583
! msgid "Try to lay out derived types as compactly as possible"
  msgstr ""
  
! #: fortran/lang.opt:591
! msgid "Protect parentheses in expressions"
  msgstr ""
  
! #: fortran/lang.opt:595
! msgid "Enable range checking during compilation"
  msgstr ""
  
! #: fortran/lang.opt:599
! msgid "Interpret any REAL(4) as a REAL(8)"
  msgstr ""
  
! #: fortran/lang.opt:603
! msgid "Interpret any REAL(4) as a REAL(10)"
  msgstr ""
  
! #: fortran/lang.opt:607
! msgid "Interpret any REAL(4) as a REAL(16)"
  msgstr ""
  
! #: fortran/lang.opt:611
! msgid "Interpret any REAL(8) as a REAL(4)"
  msgstr ""
  
! #: fortran/lang.opt:615
! msgid "Interpret any REAL(8) as a REAL(10)"
  msgstr ""
  
! #: fortran/lang.opt:619
! msgid "Interpret any REAL(8) as a REAL(16)"
  msgstr ""
  
! #: fortran/lang.opt:623
! msgid "Reallocate the LHS in assignments"
  msgstr ""
  
! #: fortran/lang.opt:627
! msgid "Use a 4-byte record marker for unformatted files"
  msgstr ""
  
! #: fortran/lang.opt:631
! msgid "Use an 8-byte record marker for unformatted files"
  msgstr ""
  
! #: fortran/lang.opt:635
! msgid "Allocate local variables on the stack to allow indirect recursion"
  msgstr ""
  
! #: fortran/lang.opt:639
! msgid "Copy array sections into a contiguous block on procedure entry"
  msgstr ""
  
! #: fortran/lang.opt:643
  msgid ""
! "-fcoarray=<none|single|lib>\tSpecify which coarray parallelization should be "
! "used"
! msgstr ""
! 
! #: fortran/lang.opt:646
! #, c-format
! msgid "Unrecognized option: %qs"
! msgstr ""
! 
! #: fortran/lang.opt:659
! msgid "-fcheck=[...]\tSpecify which runtime checks are to be performed"
! msgstr ""
! 
! #: fortran/lang.opt:663
! msgid "Append a second underscore if the name already contains an underscore"
! msgstr ""
! 
! #: fortran/lang.opt:671
! msgid "Apply negative sign to zero values"
! msgstr ""
! 
! #: fortran/lang.opt:675
! msgid "Append underscores to externally visible names"
! msgstr ""
! 
! #: fortran/lang.opt:679 c-family/c.opt:1064 c-family/c.opt:1088
! #: c-family/c.opt:1314 config/pa/pa.opt:42 config/pa/pa.opt:66
! #: config/sh/sh.opt:213 common.opt:1026 common.opt:1249 common.opt:1577
! #: common.opt:1903 common.opt:1939 common.opt:2028 common.opt:2032
! #: common.opt:2124 common.opt:2206 common.opt:2230 common.opt:2331
! #: common.opt:2449
! msgid "Does nothing.  Preserved for backward compatibility."
! msgstr ""
! 
! #: fortran/lang.opt:719
! msgid "Statically link the GNU Fortran helper library (libgfortran)"
! msgstr ""
! 
! #: fortran/lang.opt:723
! msgid "Conform to the ISO Fortran 2003 standard"
! msgstr ""
! 
! #: fortran/lang.opt:727
! msgid "Conform to the ISO Fortran 2008 standard"
! msgstr ""
! 
! #: fortran/lang.opt:731
! msgid "Conform to the ISO Fortran 2008 standard including TS 29113"
! msgstr ""
! 
! #: fortran/lang.opt:735
! msgid "Conform to the ISO Fortran 95 standard"
! msgstr ""
! 
! #: fortran/lang.opt:739
! msgid "Conform to nothing in particular"
  msgstr ""
  
! #: fortran/lang.opt:743
! msgid "Accept extensions to support legacy code"
  msgstr ""
  
! #: c-family/c.opt:43 c-family/c.opt:46 c-family/c.opt:181
! #, c-format
! msgid "assertion missing after %qs"
  msgstr ""
  
! #: c-family/c.opt:55 c-family/c.opt:58 c-family/c.opt:163 c-family/c.opt:166
! #: c-family/c.opt:193 c-family/c.opt:252
! #, c-format
! msgid "macro name missing after %qs"
  msgstr ""
  
! #: c-family/c.opt:70 c-family/c.opt:73 c-family/c.opt:76 c-family/c.opt:79
! #: c-family/c.opt:175 c-family/c.opt:178 c-family/c.opt:216 c-family/c.opt:220
! #: c-family/c.opt:232 c-family/c.opt:1497 c-family/c.opt:1505
! #: config/darwin.opt:53 common.opt:316 common.opt:319 common.opt:2704
! #, c-format
! msgid "missing filename after %qs"
  msgstr ""
  
! #: c-family/c.opt:85 c-family/c.opt:88 c-family/c.opt:91 c-family/c.opt:94
! #: c-family/c.opt:200 c-family/c.opt:208 c-family/c.opt:1493
! #: c-family/c.opt:1513 c-family/c.opt:1517 c-family/c.opt:1521
! #, c-format
! msgid "missing path after %qs"
  msgstr ""
  
! #: c-family/c.opt:182
! msgid ""
! "-A<question>=<answer>\tAssert the <answer> to <question>.  Putting '-' "
! "before <question> disables the <answer> to <question>"
  msgstr ""
  
! #: c-family/c.opt:186
! msgid "Do not discard comments"
  msgstr ""
  
! #: c-family/c.opt:190
! msgid "Do not discard comments in macro expansions"
  msgstr ""
  
! #: c-family/c.opt:194
  msgid ""
! "-D<macro>[=<val>]\tDefine a <macro> with <val> as its value.  If just "
! "<macro> is given, <val> is taken to be 1"
! msgstr ""
! 
! #: c-family/c.opt:201
! msgid "-F <dir>\tAdd <dir> to the end of the main framework include path"
  msgstr ""
  
! #: c-family/c.opt:205
! msgid "Print the name of header files as they are used"
  msgstr ""
  
! #: c-family/c.opt:209
! msgid "-I <dir>\tAdd <dir> to the end of the main include path"
  msgstr ""
  
! #: c-family/c.opt:213
! msgid "Generate make dependencies"
  msgstr ""
  
! #: c-family/c.opt:217
! msgid "Generate make dependencies and compile"
  msgstr ""
  
! #: c-family/c.opt:221
! msgid "-MF <file>\tWrite dependency output to the given file"
  msgstr ""
  
! #: c-family/c.opt:225
! msgid "Treat missing header files as generated files"
  msgstr ""
  
! #: c-family/c.opt:229
! msgid "Like -M but ignore system header files"
  msgstr ""
  
! #: c-family/c.opt:233
! msgid "Like -MD but ignore system header files"
  msgstr ""
  
! #: c-family/c.opt:237
! msgid "Generate phony targets for all headers"
  msgstr ""
  
! #: c-family/c.opt:240 c-family/c.opt:244
! #, c-format
! msgid "missing makefile target after %qs"
  msgstr ""
  
! #: c-family/c.opt:241
! msgid "-MQ <target>\tAdd a MAKE-quoted target"
  msgstr ""
  
! #: c-family/c.opt:245
! msgid "-MT <target>\tAdd an unquoted target"
  msgstr ""
  
! #: c-family/c.opt:249
! msgid "Do not generate #line directives"
  msgstr ""
  
! #: c-family/c.opt:253
! msgid "-U<macro>\tUndefine <macro>"
  msgstr ""
  
! #: c-family/c.opt:257
! msgid ""
! "Warn about things that will change when compiling with an ABI-compliant "
! "compiler"
  msgstr ""
  
! #: c-family/c.opt:261
! msgid ""
! "Warn about things that change between the current -fabi-version and the "
! "specified version"
  msgstr ""
  
! #: c-family/c.opt:265
! msgid ""
! "Warn if a subobject has an abi_tag attribute that the complete object type "
! "does not have"
  msgstr ""
  
! #: c-family/c.opt:272
! msgid "Warn about suspicious uses of memory addresses"
  msgstr ""
  
! #: c-family/c.opt:276 ada/gcc-interface/lang.opt:57
! msgid "Enable most warning messages"
  msgstr ""
  
! #: c-family/c.opt:288
! msgid ""
! "Warn whenever an Objective-C assignment is being intercepted by the garbage "
! "collector"
  msgstr ""
  
! #: c-family/c.opt:292
! msgid "Warn about casting functions to incompatible types"
  msgstr ""
  
! #: c-family/c.opt:296
  msgid ""
! "Warn about boolean expression compared with an integer value different from "
! "true/false"
! msgstr ""
! 
! #: c-family/c.opt:300
! msgid "Warn when a built-in preprocessor macro is undefined or redefined"
! msgstr ""
! 
! #: c-family/c.opt:304
! msgid "Warn about features not present in ISO C90, but present in ISO C99"
! msgstr ""
! 
! #: c-family/c.opt:308
! msgid "Warn about features not present in ISO C99, but present in ISO C11"
  msgstr ""
  
! #: c-family/c.opt:312
! msgid "Warn about C constructs that are not in the common subset of C and C++"
  msgstr ""
  
! #: c-family/c.opt:316
! msgid "Deprecated in favor of -Wc++11-compat"
  msgstr ""
  
! #: c-family/c.opt:320
! msgid ""
! "Warn about C++ constructs whose meaning differs between ISO C++ 1998 and ISO "
! "C++ 2011"
  msgstr ""
  
! #: c-family/c.opt:324
  msgid ""
! "Warn about C++ constructs whose meaning differs between ISO C++ 2011 and ISO "
! "C++ 2014"
! msgstr ""
! 
! #: c-family/c.opt:328
! msgid "Warn about casts which discard qualifiers"
  msgstr ""
  
! #: c-family/c.opt:332
! msgid "Warn about subscripts whose type is \"char\""
  msgstr ""
  
! #: c-family/c.opt:336
! msgid "Warn about memory access errors found by Pointer Bounds Checker"
  msgstr ""
  
! #: c-family/c.opt:340
! msgid "Warn about variables that might be changed by \"longjmp\" or \"vfork\""
  msgstr ""
  
! #: c-family/c.opt:344
  msgid ""
! "Warn about possibly nested block comments, and C++ comments spanning more "
! "than one physical line"
! msgstr ""
! 
! #: c-family/c.opt:348
! msgid "Synonym for -Wcomment"
! msgstr ""
! 
! #: c-family/c.opt:352
! msgid "Warn for conditionally-supported constructs"
! msgstr ""
! 
! #: c-family/c.opt:356
! msgid "Warn for implicit type conversions that may change a value"
! msgstr ""
! 
! #: c-family/c.opt:360
! msgid "Warn for converting NULL from/to a non-pointer type"
! msgstr ""
! 
! #: c-family/c.opt:368
! msgid "Warn when all constructors and destructors are private"
! msgstr ""
! 
! #: c-family/c.opt:372
! msgid "Warn about __TIME__, __DATE__ and __TIMESTAMP__ usage"
! msgstr ""
! 
! #: c-family/c.opt:376
! msgid "Warn when a declaration is found after a statement"
! msgstr ""
! 
! #: c-family/c.opt:380
! msgid "Warn when deleting a pointer to incomplete type"
  msgstr ""
  
! #: c-family/c.opt:384
! msgid "Warn about deleting polymorphic objects with non-virtual destructors"
  msgstr ""
  
! #: c-family/c.opt:388
! msgid "Warn if a deprecated compiler feature, class, method, or field is used"
  msgstr ""
  
! #: c-family/c.opt:392
! msgid ""
! "Warn about positional initialization of structs requiring designated "
! "initializers"
  msgstr ""
  
! #: c-family/c.opt:396
! msgid "Warn if qualifiers on arrays which are pointer targets are discarded"
  msgstr ""
  
! #: c-family/c.opt:400
! msgid "Warn if type qualifiers on pointers are discarded"
  msgstr ""
  
! #: c-family/c.opt:404
! msgid "Warn about compile-time integer division by zero"
  msgstr ""
  
! #: c-family/c.opt:408
! msgid "Warn about violations of Effective C++ style rules"
  msgstr ""
  
! #: c-family/c.opt:412
! msgid "Warn about an empty body in an if or else statement"
  msgstr ""
  
! #: c-family/c.opt:416
! msgid "Warn about stray tokens after #elif and #endif"
  msgstr ""
  
! #: c-family/c.opt:420
! msgid "Warn about comparison of different enum types"
  msgstr ""
  
! #: c-family/c.opt:428
! msgid ""
! "This switch is deprecated; use -Werror=implicit-function-declaration instead"
  msgstr ""
  
! #: c-family/c.opt:432
! msgid ""
! "Warn for implicit type conversions that cause loss of floating point "
! "precision"
  msgstr ""
  
! #: c-family/c.opt:436
! msgid "Warn if testing floating point numbers for equality"
  msgstr ""
  
! #: c-family/c.opt:440 c-family/c.opt:472
! msgid "Warn about printf/scanf/strftime/strfmon format string anomalies"
  msgstr ""
  
! #: c-family/c.opt:444
! msgid "Warn about format strings that contain NUL bytes"
  msgstr ""
  
! #: c-family/c.opt:448
! msgid "Warn if passing too many arguments to a function for its format string"
  msgstr ""
  
! #: c-family/c.opt:452
! msgid "Warn about format strings that are not literals"
  msgstr ""
  
! #: c-family/c.opt:456
! msgid "Warn about possible security problems with format functions"
  msgstr ""
  
! #: c-family/c.opt:460
! msgid "Warn about sign differences with format functions"
  msgstr ""
  
! #: c-family/c.opt:464
! msgid "Warn about strftime formats yielding 2-digit years"
  msgstr ""
  
! #: c-family/c.opt:468
! msgid "Warn about zero-length formats"
  msgstr ""
  
! #: c-family/c.opt:476
! msgid "Warn whenever type qualifiers are ignored."
  msgstr ""
  
! #: c-family/c.opt:480
  msgid ""
! "Warn when there is a conversion between pointers that have incompatible types"
! msgstr ""
! 
! #: c-family/c.opt:484
! msgid "Warn about variables which are initialized to themselves"
! msgstr ""
! 
! #: c-family/c.opt:488
! msgid "Warn about implicit declarations"
! msgstr ""
! 
! #: c-family/c.opt:492
! msgid "Warn about implicit conversions from \"float\" to \"double\""
! msgstr ""
! 
! #: c-family/c.opt:496
! msgid "Warn about implicit function declarations"
  msgstr ""
  
! #: c-family/c.opt:500
! msgid "Warn when a declaration does not specify a type"
  msgstr ""
  
! #: c-family/c.opt:507
! msgid ""
! "Warn about C++11 inheriting constructors when the base has a variadic "
! "constructor"
  msgstr ""
  
! #: c-family/c.opt:511
  msgid ""
! "Warn about incompatible integer to pointer and pointer to integer conversions"
  msgstr ""
  
! #: c-family/c.opt:515
  msgid ""
! "Warn when there is a cast to a pointer from an integer of a different size"
! msgstr ""
! 
! #: c-family/c.opt:519
! msgid "Warn about invalid uses of the \"offsetof\" macro"
! msgstr ""
! 
! #: c-family/c.opt:523
! msgid "Warn about PCH files that are found but not used"
  msgstr ""
  
! #: c-family/c.opt:527
! msgid "Warn when a jump misses a variable initialization"
  msgstr ""
  
! #: c-family/c.opt:531
! msgid ""
! "Warn when a string or character literal is followed by a ud-suffix which "
! "does not begin with an underscore."
  msgstr ""
  
! #: c-family/c.opt:535
! msgid ""
! "Warn when a logical operator is suspiciously always evaluating to true or "
! "false"
  msgstr ""
  
! #: c-family/c.opt:539
! msgid ""
! "Warn when logical not is used on the left hand side operand of a comparison"
  msgstr ""
  
! #: c-family/c.opt:543
! msgid "Do not warn about using \"long long\" when -pedantic"
  msgstr ""
  
! #: c-family/c.opt:547
! msgid "Warn about suspicious declarations of \"main\""
  msgstr ""
  
! #: c-family/c.opt:555
! msgid ""
! "Warn about suspicious calls to memset where the third argument is constant "
! "literal zero and the second is not"
  msgstr ""
  
! #: c-family/c.opt:559
! msgid "Warn about possibly missing braces around initializers"
  msgstr ""
  
! #: c-family/c.opt:563
! msgid "Warn about global functions without previous declarations"
  msgstr ""
  
! #: c-family/c.opt:567
! msgid "Warn about missing fields in struct initializers"
  msgstr ""
  
! #: c-family/c.opt:571
! msgid "Warn about missing sized deallocation functions"
  msgstr ""
  
! #: c-family/c.opt:575
! msgid ""
! "Warn about suspicious length parameters to certain string functions if the "
! "argument uses sizeof"
  msgstr ""
  
! #: c-family/c.opt:579
! msgid "Warn when sizeof is applied on a parameter declared as an array"
  msgstr ""
  
! #: c-family/c.opt:583
! msgid "Warn about functions which might be candidates for format attributes"
  msgstr ""
  
! #: c-family/c.opt:587
! msgid ""
! "Suggest that the override keyword be used when the declaration of a virtual"
  msgstr ""
  
! #: c-family/c.opt:592
! msgid "Warn about enumerated switches, with no default, missing a case"
  msgstr ""
  
! #: c-family/c.opt:596
! msgid "Warn about enumerated switches missing a \"default:\" statement"
  msgstr ""
  
! #: c-family/c.opt:600
! msgid "Warn about all enumerated switches missing a specific case"
  msgstr ""
  
! #: c-family/c.opt:604
! msgid "Warn about switches with boolean controlling expression"
  msgstr ""
  
! #: c-family/c.opt:612
! msgid "Warn about user-specified include directories that do not exist"
  msgstr ""
  
! #: c-family/c.opt:616
! msgid ""
! "Warn about function parameters declared without a type specifier in K&R-"
! "style functions"
  msgstr ""
  
! #: c-family/c.opt:620
! msgid "Warn about global functions without prototypes"
  msgstr ""
  
! #: c-family/c.opt:623 c-family/c.opt:937 c-family/c.opt:944
! #: c-family/c.opt:1114 c-family/c.opt:1133 c-family/c.opt:1156
! #: c-family/c.opt:1162 c-family/c.opt:1169 c-family/c.opt:1193
! #: c-family/c.opt:1204 c-family/c.opt:1207 c-family/c.opt:1210
! #: c-family/c.opt:1213 c-family/c.opt:1216 c-family/c.opt:1253
! #: c-family/c.opt:1384 c-family/c.opt:1395 c-family/c.opt:1413
! #: c-family/c.opt:1444 c-family/c.opt:1448 c-family/c.opt:1464
! #: config/ia64/ia64.opt:167 config/ia64/ia64.opt:170 c-family/c-opts.c:426
! #, gcc-internal-format
! msgid "switch %qs is no longer supported"
  msgstr ""
  
! #: c-family/c.opt:627
! msgid "Warn about use of multi-character character constants"
  msgstr ""
  
! #: c-family/c.opt:631
  msgid ""
! "Warn about narrowing conversions within { } that are ill-formed in C++11"
  msgstr ""
  
! #: c-family/c.opt:635
! msgid "Warn about \"extern\" declarations not at file scope"
  msgstr ""
  
! #: c-family/c.opt:639
! msgid ""
! "Warn when a noexcept expression evaluates to false even though the "
! "expression can't actually throw"
  msgstr ""
  
! #: c-family/c.opt:643
! msgid ""
! "Warn when non-templatized friend functions are declared within a template"
  msgstr ""
  
! #: c-family/c.opt:647
! msgid "Warn about non-virtual destructors"
  msgstr ""
  
! #: c-family/c.opt:651
! msgid ""
! "Warn about NULL being passed to argument slots marked as requiring non-NULL"
  msgstr ""
  
! #: c-family/c.opt:663
! msgid ""
! "-Wnormalized=<none|id|nfc|nfkc>\tWarn about non-normalised Unicode strings"
  msgstr ""
  
! #: c-family/c.opt:670
! msgid "argument %qs to %<-Wnormalized%> not recognized"
  msgstr ""
  
! #: c-family/c.opt:686
! msgid "Warn if a C-style cast is used in a program"
  msgstr ""
  
! #: c-family/c.opt:690
! msgid "Warn for obsolescent usage in a declaration"
  msgstr ""
  
! #: c-family/c.opt:694
! msgid "Warn if an old-style parameter definition is used"
  msgstr ""
  
! #: c-family/c.opt:698
! msgid "Warn if a simd directive is overridden by the vectorizer cost model"
  msgstr ""
  
! #: c-family/c.opt:702
  msgid ""
! "Warn if a string is longer than the maximum portable length specified by the "
! "standard"
! msgstr ""
! 
! #: c-family/c.opt:706
! msgid "Warn about overloaded virtual function names"
! msgstr ""
! 
! #: c-family/c.opt:710
! msgid "Warn about overriding initializers without side effects"
! msgstr ""
! 
! #: c-family/c.opt:714
! msgid "Warn about packed bit-fields whose offset changed in GCC 4.4"
! msgstr ""
! 
! #: c-family/c.opt:718
! msgid "Warn about possibly missing parentheses"
! msgstr ""
! 
! #: c-family/c.opt:726
! msgid "Warn when converting the type of pointers to member functions"
! msgstr ""
! 
! #: c-family/c.opt:730
! msgid "Warn about function pointer arithmetic"
! msgstr ""
! 
! #: c-family/c.opt:734
! msgid "Warn when a pointer differs in signedness in an assignment"
! msgstr ""
! 
! #: c-family/c.opt:738
! msgid "Warn when a pointer is cast to an integer of a different size"
! msgstr ""
! 
! #: c-family/c.opt:742
! msgid "Warn about misuses of pragmas"
  msgstr ""
  
! #: c-family/c.opt:746
  msgid ""
! "Warn if a property for an Objective-C object has no assign semantics "
! "specified"
! msgstr ""
! 
! #: c-family/c.opt:750
! msgid "Warn if inherited methods are unimplemented"
! msgstr ""
! 
! #: c-family/c.opt:754
! msgid "Warn about multiple declarations of the same object"
  msgstr ""
  
! #: c-family/c.opt:758
! msgid "Warn when the compiler reorders code"
  msgstr ""
  
! #: c-family/c.opt:762
  msgid ""
! "Warn whenever a function's return type defaults to \"int\" (C), or about "
! "inconsistent return types (C++)"
! msgstr ""
! 
! #: c-family/c.opt:766
! msgid "Warn if a selector has multiple methods"
! msgstr ""
! 
! #: c-family/c.opt:770
! msgid "Warn about possible violations of sequence point rules"
! msgstr ""
! 
! #: c-family/c.opt:774
! msgid "Warn if a local declaration hides an instance variable"
! msgstr ""
! 
! #: c-family/c.opt:778
! msgid "Warn if shift count is negative"
  msgstr ""
  
! #: c-family/c.opt:782
! msgid "Warn if shift count >= width of type"
  msgstr ""
  
! #: c-family/c.opt:786
! msgid "Warn about signed-unsigned comparisons"
  msgstr ""
  
! #: c-family/c.opt:794
! msgid "Warn for implicit type conversions between signed and unsigned integers"
  msgstr ""
  
! #: c-family/c.opt:798
! msgid "Warn when overload promotes from unsigned to signed"
  msgstr ""
  
! #: c-family/c.opt:802
! msgid "Warn about uncasted NULL used as sentinel"
  msgstr ""
  
! #: c-family/c.opt:806
! msgid "Warn about unprototyped function declarations"
  msgstr ""
  
! #: c-family/c.opt:818
! msgid "Warn if type signatures of candidate methods do not match exactly"
  msgstr ""
  
! #: c-family/c.opt:822
! msgid ""
! "Warn when __sync_fetch_and_nand and __sync_nand_and_fetch built-in functions "
! "are used"
  msgstr ""
  
! #: c-family/c.opt:826
! msgid "Deprecated.  This switch has no effect"
  msgstr ""
  
! #: c-family/c.opt:834
! msgid "Warn about features not present in traditional C"
  msgstr ""
  
! #: c-family/c.opt:838
! msgid ""
! "Warn of prototypes causing type conversions different from what would happen "
! "in the absence of prototype"
  msgstr ""
  
! #: c-family/c.opt:842
! msgid ""
! "Warn if trigraphs are encountered that might affect the meaning of the "
! "program"
  msgstr ""
  
! #: c-family/c.opt:846
! msgid "Warn about @selector()s without previously declared methods"
  msgstr ""
  
! #: c-family/c.opt:850
! msgid "Warn if an undefined macro is used in an #if directive"
  msgstr ""
  
! #: c-family/c.opt:862
! msgid "Warn about unrecognized pragmas"
  msgstr ""
  
! #: c-family/c.opt:866
! msgid "Warn about unsuffixed float constants"
  msgstr ""
  
! #: c-family/c.opt:874
! msgid "Warn when typedefs locally defined in a function are not used"
  msgstr ""
  
! #: c-family/c.opt:878
! msgid "Warn about macros defined in the main file that are not used"
  msgstr ""
  
! #: c-family/c.opt:882
! msgid ""
! "Warn if a caller of a function, marked with attribute warn_unused_result, "
! "does not use its return value"
  msgstr ""
  
! #: c-family/c.opt:886
! msgid "Warn about using variadic macros"
  msgstr ""
  
! #: c-family/c.opt:890
! msgid ""
! "Warn about questionable usage of the macros used to retrieve variable "
! "arguments"
  msgstr ""
  
! #: c-family/c.opt:894
! msgid "Warn if a variable length array is used"
  msgstr ""
  
! #: c-family/c.opt:898
! msgid "Warn when a register variable is declared volatile"
  msgstr ""
  
! #: c-family/c.opt:902
! msgid "Warn if a virtual base has a non-trivial move assignment operator"
  msgstr ""
  
! #: c-family/c.opt:906
! msgid ""
! "In C++, nonzero means warn about deprecated conversion from string literals "
! "to 'char *'.  In C, similar warning, except that the conversion is of course "
! "not deprecated by the ISO C standard."
  msgstr ""
  
! #: c-family/c.opt:910
! msgid "Warn when a literal '0' is used as null pointer"
  msgstr ""
  
! #: c-family/c.opt:914
! msgid "Warn about useless casts"
  msgstr ""
  
! #: c-family/c.opt:918
! msgid "A synonym for -std=c89 (for C) or -std=c++98 (for C++)"
  msgstr ""
  
! #: c-family/c.opt:926
! msgid ""
! "The version of the C++ ABI used for -Wabi warnings and link compatibility "
! "aliases"
  msgstr ""
  
! #: c-family/c.opt:930
! msgid "Enforce class member access control semantics"
  msgstr ""
  
! #: c-family/c.opt:934
! msgid "-fada-spec-parent=unit  Dump Ada specs as child units of given parent"
  msgstr ""
  
! #: c-family/c.opt:941
! msgid "Allow variadic functions without named parameter"
  msgstr ""
  
! #: c-family/c.opt:945 c-family/c.opt:1170 c-family/c.opt:1445
! #: c-family/c.opt:1449 c-family/c.opt:1465
! msgid "No longer supported"
  msgstr ""
  
! #: c-family/c.opt:949
! msgid "Recognize the \"asm\" keyword"
  msgstr ""
  
! #: c-family/c.opt:957
! msgid "Recognize built-in functions"
  msgstr ""
  
! #: c-family/c.opt:964
! msgid "Where shorter, use canonicalized paths to systems headers."
  msgstr ""
  
! #: c-family/c.opt:968
! msgid "Add Pointer Bounds Checker instrumentation.  fchkp-* flags are used to"
  msgstr ""
  
! #: c-family/c.opt:973
! msgid "Generate pointer bounds checks for variables with incomplete type"
  msgstr ""
  
! #: c-family/c.opt:977
! msgid ""
! "Use zero bounds for all incoming arguments in 'main' function.  It helps when"
  msgstr ""
  
! #: c-family/c.opt:982
! msgid ""
! "Forces Pointer Bounds Checker to use narrowed bounds for address of the first"
  msgstr ""
  
! #: c-family/c.opt:988
  msgid ""
! "Control how Pointer Bounds Checker handle pointers to object fields.  When"
  msgstr ""
  
! #: c-family/c.opt:993
! msgid ""
! "Forces Pointer Bounds Checker to use bounds of the innermost arrays in case "
! "of"
  msgstr ""
  
! #: c-family/c.opt:998
! msgid "Allow Pointer Bounds Checker optimizations.  By default allowed"
  msgstr ""
  
! #: c-family/c.opt:1003
! msgid ""
! "Allow to use *_nobnd versions of string functions by Pointer Bounds Checker."
  msgstr ""
  
! #: c-family/c.opt:1007
  msgid ""
! "Allow to use *_nochk versions of string functions by Pointer Bounds Checker."
! msgstr ""
! 
! #: c-family/c.opt:1011
! msgid "Use statically initialized variable for vars bounds instead of"
! msgstr ""
! 
! #: c-family/c.opt:1016
! msgid "Use statically initialized variable for constant bounds instead of"
! msgstr ""
! 
! #: c-family/c.opt:1021
! msgid "With this option zero size obtained dynamically for objects with"
! msgstr ""
! 
! #: c-family/c.opt:1026
! msgid "Generate checks for all read accesses to memory."
! msgstr ""
! 
! #: c-family/c.opt:1030
! msgid "Generate checks for all write accesses to memory."
! msgstr ""
! 
! #: c-family/c.opt:1034
! msgid "Generate bounds stores for pointer writes."
! msgstr ""
! 
! #: c-family/c.opt:1038
! msgid "Generate bounds passing for calls."
! msgstr ""
! 
! #: c-family/c.opt:1042
! msgid "Instrument only functions marked with bnd_instrument attribute."
! msgstr ""
! 
! #: c-family/c.opt:1046
! msgid "Transform instrumented builtin calls into calls to wrappers."
! msgstr ""
! 
! #: c-family/c.opt:1056
! msgid "Enable Cilk Plus"
! msgstr ""
! 
! #: c-family/c.opt:1060
! msgid "Allow the arguments of the '?' operator to have different types"
! msgstr ""
! 
! #: c-family/c.opt:1067
! #, c-format
! msgid "no class name specified with %qs"
  msgstr ""
  
! #: c-family/c.opt:1068
! msgid "-fconst-string-class=<name>\tUse class <name> for constant strings"
  msgstr ""
  
! #: c-family/c.opt:1072
! msgid "-fconstexpr-depth=<number>\tSpecify maximum constexpr recursion depth"
  msgstr ""
  
! #: c-family/c.opt:1076
! msgid "Emit debug annotations during preprocessing"
  msgstr ""
  
! #: c-family/c.opt:1080
  msgid ""
! "-fdeduce-init-list\tenable deduction of std::initializer_list for a template "
! "type parameter from a brace-enclosed initializer-list"
! msgstr ""
! 
! #: c-family/c.opt:1084
! msgid "Factor complex constructors and destructors to favor space over speed"
  msgstr ""
  
! #: c-family/c.opt:1092
! msgid "Preprocess directives only."
  msgstr ""
  
! #: c-family/c.opt:1096
! msgid "Permit '$' as an identifier character"
  msgstr ""
  
! #: c-family/c.opt:1100
! msgid "Write all declarations as Ada code transitively"
  msgstr ""
  
! #: c-family/c.opt:1104
! msgid "Write all declarations as Ada code for the given file only"
  msgstr ""
  
! #: c-family/c.opt:1111
! msgid "Generate code to check exception specifications"
  msgstr ""
  
! #: c-family/c.opt:1118
! msgid ""
! "-fexec-charset=<cset>\tConvert all strings and character constants to "
! "character set <cset>"
  msgstr ""
  
! #: c-family/c.opt:1122
! msgid "Permit universal character names (\\u and \\U) in identifiers"
  msgstr ""
  
! #: c-family/c.opt:1126
! msgid ""
! "-finput-charset=<cset>\tSpecify the default character set for source files"
  msgstr ""
  
! #: c-family/c.opt:1130
! msgid ""
! "Support dynamic initialization of thread-local variables in a different "
! "translation unit"
  msgstr ""
  
! #: c-family/c.opt:1137
! msgid "Scope of for-init-statement variables is local to the loop"
  msgstr ""
  
! #: c-family/c.opt:1141
! msgid "Do not assume that standard C libraries and \"main\" exist"
  msgstr ""
  
! #: c-family/c.opt:1145
! msgid "Recognize GNU-defined keywords"
  msgstr ""
  
! #: c-family/c.opt:1149
! msgid "Generate code for GNU runtime environment"
  msgstr ""
  
! #: c-family/c.opt:1153
! msgid "Use traditional GNU semantics for inline functions"
  msgstr ""
  
! #: c-family/c.opt:1159
! msgid ""
! "-fhandle-exceptions has been renamed -fexceptions (and is now on by default)"
  msgstr ""
  
! #: c-family/c.opt:1166
! msgid "Assume normal C execution environment"
  msgstr ""
  
! #: c-family/c.opt:1174
! msgid "Export functions even if they can be inlined"
  msgstr ""
  
! #: c-family/c.opt:1178
! msgid "Emit implicit instantiations of inline templates"
  msgstr ""
  
! #: c-family/c.opt:1182
! msgid "Emit implicit instantiations of templates"
  msgstr ""
  
! #: c-family/c.opt:1186
! msgid "Inject friend functions into enclosing namespace"
  msgstr ""
  
! #: c-family/c.opt:1190
! msgid "Don't emit dllexported inline functions unless needed"
  msgstr ""
  
! #: c-family/c.opt:1197
  msgid ""
! "Allow implicit conversions between vectors with differing numbers of "
! "subparts and/or differing element types."
! msgstr ""
! 
! #: c-family/c.opt:1201
! msgid "Don't warn about uses of Microsoft extensions"
! msgstr ""
! 
! #: c-family/c.opt:1220
! msgid "Generate code for NeXT (Apple Mac OS X) runtime environment"
  msgstr ""
  
! #: c-family/c.opt:1224
! msgid "Assume that receivers of Objective-C messages may be nil"
  msgstr ""
  
! #: c-family/c.opt:1228
! msgid ""
! "Allow access to instance variables as if they were local declarations within "
! "instance method implementations."
  msgstr ""
  
! #: c-family/c.opt:1232
! msgid ""
! "-fvisibility=[private|protected|public|package]\tSet the default symbol "
! "visibility"
  msgstr ""
  
! #: c-family/c.opt:1235
! #, c-format
! msgid "unrecognized ivar visibility value %qs"
  msgstr ""
  
! #: c-family/c.opt:1257
! msgid ""
! "Treat a throw() exception specification as noexcept to improve code size"
  msgstr ""
  
! #: c-family/c.opt:1261
! msgid ""
! "Specify which ABI to use for Objective-C family code and meta-data "
! "generation."
  msgstr ""
  
! #: c-family/c.opt:1267
  msgid ""
! "Generate special Objective-C methods to initialize/destroy non-POD C++ "
! "ivars, if needed"
! msgstr ""
! 
! #: c-family/c.opt:1271
! msgid "Allow fast jumps to the message dispatcher"
  msgstr ""
  
! #: c-family/c.opt:1277
! msgid "Enable Objective-C exception and synchronization syntax"
  msgstr ""
  
! #: c-family/c.opt:1281
! msgid "Enable garbage collection (GC) in Objective-C/Objective-C++ programs"
  msgstr ""
  
! #: c-family/c.opt:1285
! msgid ""
! "Enable inline checks for nil receivers with the NeXT runtime and ABI version "
! "2."
  msgstr ""
  
! #: c-family/c.opt:1290
! msgid "Enable Objective-C setjmp exception handling runtime"
  msgstr ""
  
! #: c-family/c.opt:1294
! msgid "Conform to the Objective-C 1.0 language as implemented in GCC 4.0"
  msgstr ""
  
! #: c-family/c.opt:1298
! msgid "Enable OpenACC"
  msgstr ""
  
! #: c-family/c.opt:1302
! msgid "Enable OpenMP (implies -frecursive in Fortran)"
  msgstr ""
  
! #: c-family/c.opt:1306
! msgid "Enable OpenMP's SIMD directives"
  msgstr ""
  
! #: c-family/c.opt:1310
! msgid "Recognize C++ keywords like \"compl\" and \"xor\""
  msgstr ""
  
! #: c-family/c.opt:1321
! msgid "Look for and use PCH files even when preprocessing"
  msgstr ""
  
! #: c-family/c.opt:1325
! msgid "Downgrade conformance errors to warnings"
  msgstr ""
  
! #: c-family/c.opt:1329
! msgid "Enable Plan 9 language extensions"
  msgstr ""
  
! #: c-family/c.opt:1333
! msgid "Treat the input file as already preprocessed"
  msgstr ""
  
! #: c-family/c.opt:1341
! msgid ""
! "-ftrack-macro-expansion=<0|1|2>  Track locations of tokens coming from macro "
! "expansion and display them in error messages"
  msgstr ""
  
! #: c-family/c.opt:1345
  msgid ""
! "-fno-pretty-templates Do not pretty-print template specializations as the "
! "template signature followed by the arguments"
  msgstr ""
  
! #: c-family/c.opt:1349
  msgid ""
! "Used in Fix-and-Continue mode to indicate that object files may be swapped "
! "in at runtime"
! msgstr ""
! 
! #: c-family/c.opt:1353
! msgid "Enable automatic template instantiation"
! msgstr ""
! 
! #: c-family/c.opt:1357
! msgid "Generate run time type descriptor information"
! msgstr ""
! 
! #: c-family/c.opt:1361
! msgid "Use the same size for double as for float"
! msgstr ""
! 
! #: c-family/c.opt:1365 ada/gcc-interface/lang.opt:77
! msgid "Use the narrowest integer type possible for enumeration types"
! msgstr ""
! 
! #: c-family/c.opt:1369
! msgid "Force the underlying type for \"wchar_t\" to be \"unsigned short\""
! msgstr ""
! 
! #: c-family/c.opt:1373
! msgid "When \"signed\" or \"unsigned\" is not given make the bitfield signed"
! msgstr ""
! 
! #: c-family/c.opt:1377
! msgid "Make \"char\" signed by default"
  msgstr ""
  
! #: c-family/c.opt:1381
! msgid "Enable C++14 sized deallocation support"
  msgstr ""
  
! #: c-family/c.opt:1388
! msgid "Display statistics accumulated during compilation"
  msgstr ""
  
! #: c-family/c.opt:1392
  msgid ""
! "Assume that values of enumeration type are always within the minimum range "
! "of that type"
  msgstr ""
  
! #: c-family/c.opt:1399
! msgid "-ftabstop=<number>\tDistance between tab stops for column reporting"
  msgstr ""
  
! #: c-family/c.opt:1403
! msgid ""
! "Set the maximum number of template instantiation notes for a single warning "
! "or error"
  msgstr ""
  
! #: c-family/c.opt:1410
! msgid "-ftemplate-depth=<number>\tSpecify maximum template instantiation depth"
  msgstr ""
  
! #: c-family/c.opt:1417
  msgid ""
! "-fno-threadsafe-statics\tDo not generate thread-safe code for initializing "
! "local statics"
! msgstr ""
! 
! #: c-family/c.opt:1421
! msgid "When \"signed\" or \"unsigned\" is not given make the bitfield unsigned"
! msgstr ""
! 
! #: c-family/c.opt:1425
! msgid "Make \"char\" unsigned by default"
! msgstr ""
! 
! #: c-family/c.opt:1429
! msgid "Use __cxa_atexit to register destructors"
! msgstr ""
! 
! #: c-family/c.opt:1433
! msgid "Use __cxa_get_exception_ptr in exception handling"
! msgstr ""
! 
! #: c-family/c.opt:1437
! msgid "Marks all inlined functions and methods as having hidden visibility"
! msgstr ""
! 
! #: c-family/c.opt:1441
! msgid "Changes visibility to match Microsoft Visual Studio by default"
  msgstr ""
  
! #: c-family/c.opt:1453
! msgid "Emit common-like symbols as weak symbols"
  msgstr ""
  
! #: c-family/c.opt:1457
! msgid ""
! "-fwide-exec-charset=<cset>\tConvert all wide strings and character constants "
! "to character set <cset>"
  msgstr ""
  
! #: c-family/c.opt:1461
! msgid "Generate a #line directive pointing at the current working directory"
  msgstr ""
  
! #: c-family/c.opt:1469
  msgid ""
! "Generate lazy class lookup (via objc_getClass()) for use in Zero-Link mode"
! msgstr ""
! 
! #: c-family/c.opt:1473
! msgid "Dump declarations to a .decl file"
  msgstr ""
  
! #: c-family/c.opt:1477
! msgid "-femit-struct-debug-baseonly\tAggressive reduced debug info for structs"
  msgstr ""
  
! #: c-family/c.opt:1481
  msgid ""
! "-femit-struct-debug-reduced\tConservative reduced debug info for structs"
  msgstr ""
  
! #: c-family/c.opt:1485
! msgid ""
! "-femit-struct-debug-detailed=<spec-list>\tDetailed reduced debug info for "
! "structs"
  msgstr ""
  
! #: c-family/c.opt:1489
  msgid ""
! "Interpret imaginary, fixed-point, or other gnu number suffix as the "
! "corresponding"
! msgstr ""
! 
! #: c-family/c.opt:1494
! msgid "-idirafter <dir>\tAdd <dir> to the end of the system include path"
  msgstr ""
  
! #: c-family/c.opt:1498
! msgid "-imacros <file>\tAccept definition of macros in <file>"
  msgstr ""
  
! #: c-family/c.opt:1502
! msgid "-imultilib <dir>\tSet <dir> to be the multilib include subdirectory"
  msgstr ""
  
! #: c-family/c.opt:1506
! msgid "-include <file>\tInclude the contents of <file> before other files"
  msgstr ""
  
! #: c-family/c.opt:1510
! msgid "-iprefix <path>\tSpecify <path> as a prefix for next two options"
  msgstr ""
  
! #: c-family/c.opt:1514
! msgid "-isysroot <dir>\tSet <dir> to be the system root directory"
  msgstr ""
  
! #: c-family/c.opt:1518
! msgid "-isystem <dir>\tAdd <dir> to the start of the system include path"
  msgstr ""
  
! #: c-family/c.opt:1522
! msgid "-iquote <dir>\tAdd <dir> to the end of the quote include path"
  msgstr ""
  
! #: c-family/c.opt:1526
! msgid "-iwithprefix <dir>\tAdd <dir> to the end of the system include path"
  msgstr ""
  
! #: c-family/c.opt:1530
! msgid "-iwithprefixbefore <dir>\tAdd <dir> to the end of the main include path"
  msgstr ""
  
! #: c-family/c.opt:1540
  msgid ""
! "Do not search standard system include directories (those specified with -"
! "isystem will still be used)"
! msgstr ""
! 
! #: c-family/c.opt:1544
! msgid "Do not search standard system include directories for C++"
! msgstr ""
! 
! #: c-family/c.opt:1556
! msgid "Generate C header of platform-specific features"
  msgstr ""
  
! #: c-family/c.opt:1560
! msgid "Remap file names when including files"
  msgstr ""
  
! #: c-family/c.opt:1564 c-family/c.opt:1568
  msgid ""
! "Conform to the ISO 1998 C++ standard revised by the 2003 technical "
! "corrigendum"
! msgstr ""
! 
! #: c-family/c.opt:1572
! msgid "Conform to the ISO 2011 C++ standard"
! msgstr ""
! 
! #: c-family/c.opt:1576
! msgid "Deprecated in favor of -std=c++11"
  msgstr ""
  
! #: c-family/c.opt:1580
! msgid "Deprecated in favor of -std=c++14"
  msgstr ""
  
! #: c-family/c.opt:1584
! msgid ""
! "Conform to the ISO 2014 C++ standard (experimental and incomplete support)"
  msgstr ""
  
! #: c-family/c.opt:1588
! msgid ""
! "Conform to the ISO 2017(?) C++ draft standard (experimental and incomplete "
! "support)"
  msgstr ""
  
! #: c-family/c.opt:1595 c-family/c.opt:1691
  msgid ""
! "Conform to the ISO 2011 C standard (experimental and incomplete support)"
! msgstr ""
! 
! #: c-family/c.opt:1599
! msgid "Deprecated in favor of -std=c11"
  msgstr ""
  
! #: c-family/c.opt:1603 c-family/c.opt:1607 c-family/c.opt:1675
! msgid "Conform to the ISO 1990 C standard"
  msgstr ""
  
! #: c-family/c.opt:1611 c-family/c.opt:1683
! msgid "Conform to the ISO 1999 C standard"
  msgstr ""
  
! #: c-family/c.opt:1615
! msgid "Deprecated in favor of -std=c99"
  msgstr ""
  
! #: c-family/c.opt:1619 c-family/c.opt:1624
! msgid "Conform to the ISO 1998 C++ standard revised by the 2003 technical"
  msgstr ""
  
! #: c-family/c.opt:1629
! msgid ""
! "Conform to the ISO 2011 C++ standard with GNU extensions (experimental and "
! "incomplete support)"
  msgstr ""
  
! #: c-family/c.opt:1633
! msgid "Deprecated in favor of -std=gnu++11"
  msgstr ""
  
! #: c-family/c.opt:1640
! msgid ""
! "Conform to the ISO 2014 C++ standard with GNU extensions (experimental and "
! "incomplete support)"
  msgstr ""
  
! #: c-family/c.opt:1644
! msgid ""
! "Conform to the ISO 201z(7?) C++ draft standard with GNU extensions "
! "(experimental and incomplete support)"
  msgstr ""
  
! #: c-family/c.opt:1651
! msgid ""
! "Conform to the ISO 2011 C standard with GNU extensions (experimental and "
! "incomplete support)"
  msgstr ""
  
! #: c-family/c.opt:1655
! msgid "Deprecated in favor of -std=gnu11"
  msgstr ""
  
! #: c-family/c.opt:1659 c-family/c.opt:1663
! msgid "Conform to the ISO 1990 C standard with GNU extensions"
  msgstr ""
  
! #: c-family/c.opt:1667
! msgid "Conform to the ISO 1999 C standard with GNU extensions"
  msgstr ""
  
! #: c-family/c.opt:1671
! msgid "Deprecated in favor of -std=gnu99"
  msgstr ""
  
! #: c-family/c.opt:1679
! msgid "Conform to the ISO 1990 C standard as amended in 1994"
  msgstr ""
  
! #: c-family/c.opt:1687
! msgid "Deprecated in favor of -std=iso9899:1999"
  msgstr ""
  
! #: c-family/c.opt:1698
! msgid "Enable traditional preprocessing"
  msgstr ""
  
! #: c-family/c.opt:1702
! msgid "-trigraphs\tSupport ISO C trigraphs"
  msgstr ""
  
! #: c-family/c.opt:1706
! msgid "Do not predefine system-specific and GCC-specific macros"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:61
! msgid "Synonym of -gnatk8"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:69
! msgid "Do not look for object files in standard path"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:73
! msgid "Select the runtime"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:81
! msgid "Catch typos"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:85
! msgid "Set name of output ALI file (internal switch)"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:89
! msgid "-gnat<options>\tSpecify options to GNAT"
  msgstr ""
  
! #: go/lang.opt:42
! msgid "Add explicit checks for division by zero"
  msgstr ""
  
! #: go/lang.opt:46
! msgid "Add explicit checks for division overflow in INT_MIN / -1"
  msgstr ""
  
! #: go/lang.opt:50
! msgid "-fgo-dump-<type>\tDump Go frontend internal information"
  msgstr ""
  
! #: go/lang.opt:54
! msgid "-fgo-optimize-<type>\tTurn on optimization passes in the frontend"
  msgstr ""
  
! #: go/lang.opt:58
! msgid "-fgo-pkgpath=<string>\tSet Go package path"
  msgstr ""
  
! #: go/lang.opt:62
! msgid "-fgo-prefix=<string>\tSet package-specific prefix for exported Go names"
  msgstr ""
  
! #: go/lang.opt:66
! msgid ""
! "-fgo-relative-import-path=<path> Treat a relative import as relative to path"
  msgstr ""
  
! #: go/lang.opt:70
! msgid "Functions which return values must end with return statements"
  msgstr ""
  
! #: config/vms/vms.opt:27
! msgid "Malloc data into P2 space"
  msgstr ""
  
! #: config/vms/vms.opt:31
! msgid "Set name of main routine for the debugger"
  msgstr ""
  
! #: config/vms/vms.opt:35
! msgid "Use VMS exit codes instead of posix ones"
  msgstr ""
  
! #: config/vms/vms.opt:39
! msgid "-mpointer-size=[no,32,short,64,long]\tSet the default pointer size"
  msgstr ""
  
! #: config/vms/vms.opt:42
! #, c-format
! msgid "unknown pointer size model %qs"
  msgstr ""
  
! #: config/mcore/mcore.opt:23
! msgid "Generate code for the M*Core M210"
  msgstr ""
  
! #: config/mcore/mcore.opt:27
! msgid "Generate code for the M*Core M340"
  msgstr ""
  
! #: config/mcore/mcore.opt:31
! msgid "Force functions to be aligned to a 4 byte boundary"
  msgstr ""
  
! #: config/mcore/mcore.opt:35 config/moxie/moxie.opt:23
! msgid "Generate big-endian code"
  msgstr ""
  
! #: config/mcore/mcore.opt:39
! msgid "Emit call graph information"
  msgstr ""
  
! #: config/mcore/mcore.opt:43
! msgid "Use the divide instruction"
  msgstr ""
  
! #: config/mcore/mcore.opt:47
! msgid "Inline constants if it can be done in 2 insns or less"
  msgstr ""
  
! #: config/mcore/mcore.opt:51 config/moxie/moxie.opt:27
! msgid "Generate little-endian code"
  msgstr ""
  
! #: config/mcore/mcore.opt:56 config/fr30/fr30.opt:27
! msgid ""
! "Assume that run-time support has been provided, so omit -lsim from the "
! "linker command line"
  msgstr ""
  
! #: config/mcore/mcore.opt:60
! msgid "Use arbitrary sized immediates in bit operations"
  msgstr ""
  
! #: config/mcore/mcore.opt:64
! msgid "Prefer word accesses over byte accesses"
  msgstr ""
  
! #: config/mcore/mcore.opt:71
! msgid "Set the maximum amount for a single stack increment operation"
  msgstr ""
  
! #: config/mcore/mcore.opt:75
! msgid "Always treat bitfields as int-sized"
  msgstr ""
  
! #: config/linux-android.opt:23
! msgid "Generate code for the Android platform."
  msgstr ""
  
! #: config/mmix/mmix.opt:24
! msgid "For intrinsics library: pass all parameters in registers"
  msgstr ""
  
! #: config/mmix/mmix.opt:28
! msgid "Use register stack for parameters and return value"
  msgstr ""
  
! #: config/mmix/mmix.opt:32
! msgid "Use call-clobbered registers for parameters and return value"
  msgstr ""
  
! #: config/mmix/mmix.opt:37
! msgid "Use epsilon-respecting floating point compare instructions"
  msgstr ""
  
! #: config/mmix/mmix.opt:41
! msgid "Use zero-extending memory loads, not sign-extending ones"
  msgstr ""
  
! #: config/mmix/mmix.opt:45
! msgid ""
! "Generate divide results with reminder having the same sign as the divisor "
! "(not the dividend)"
  msgstr ""
  
! #: config/mmix/mmix.opt:49
! msgid "Prepend global symbols with \":\" (for use with PREFIX)"
  msgstr ""
  
! #: config/mmix/mmix.opt:53
! msgid "Do not provide a default start-address 0x100 of the program"
  msgstr ""
  
! #: config/mmix/mmix.opt:57
! msgid "Link to emit program in ELF format (rather than mmo)"
  msgstr ""
  
! #: config/mmix/mmix.opt:61
! msgid "Use P-mnemonics for branches statically predicted as taken"
  msgstr ""
  
! #: config/mmix/mmix.opt:65
! msgid "Don't use P-mnemonics for branches"
  msgstr ""
  
! #: config/mmix/mmix.opt:79
! msgid "Use addresses that allocate global registers"
  msgstr ""
  
! #: config/mmix/mmix.opt:83
! msgid "Do not use addresses that allocate global registers"
  msgstr ""
  
! #: config/mmix/mmix.opt:87
! msgid "Generate a single exit point for each function"
  msgstr ""
  
! #: config/mmix/mmix.opt:91
! msgid "Do not generate a single exit point for each function"
  msgstr ""
  
! #: config/mmix/mmix.opt:95
! msgid "Set start-address of the program"
  msgstr ""
  
! #: config/mmix/mmix.opt:99
! msgid "Set start-address of data"
  msgstr ""
  
! #: config/darwin.opt:114
! msgid "Generate compile-time CFString objects"
  msgstr ""
  
! #: config/darwin.opt:208
! msgid "Warn if constant CFString objects contain non-portable characters"
  msgstr ""
  
! #: config/darwin.opt:213
! msgid "Generate AT&T-style stubs for Mach-O"
  msgstr ""
  
! #: config/darwin.opt:217
! msgid "Generate code suitable for executables (NOT shared libs)"
  msgstr ""
  
! #: config/darwin.opt:221
! msgid "Generate code suitable for fast turn around debugging"
  msgstr ""
  
! #: config/darwin.opt:230
! msgid "The earliest MacOS X version on which this program will run"
  msgstr ""
  
! #: config/darwin.opt:234
! msgid "Set sizeof(bool) to 1"
  msgstr ""
  
! #: config/darwin.opt:238
! msgid "Generate code for darwin loadable kernel extensions"
  msgstr ""
  
! #: config/darwin.opt:242
! msgid "Generate code for the kernel or loadable kernel extensions"
  msgstr ""
  
! #: config/darwin.opt:246
  msgid ""
! "-iframework <dir>\tAdd <dir> to the end of the system framework include path"
! msgstr ""
! 
! #: config/bfin/bfin.opt:40 config/msp430/msp430.opt:3 config/c6x/c6x.opt:38
! #: config/mep/mep.opt:143
! msgid "Use simulator runtime"
! msgstr ""
! 
! #: config/bfin/bfin.opt:44 config/arm/arm.opt:106
! msgid "Specify the name of the target CPU"
! msgstr ""
! 
! #: config/bfin/bfin.opt:48
! msgid "Omit frame pointer for leaf functions"
  msgstr ""
  
! #: config/bfin/bfin.opt:52
! msgid "Program is entirely located in low 64k of memory"
  msgstr ""
  
! #: config/bfin/bfin.opt:56
! msgid "Work around a hardware anomaly by adding a number of NOPs before a"
  msgstr ""
  
! #: config/bfin/bfin.opt:61
! msgid "Avoid speculative loads to work around a hardware anomaly."
  msgstr ""
  
! #: config/bfin/bfin.opt:65
! msgid "Enabled ID based shared library"
  msgstr ""
  
! #: config/bfin/bfin.opt:69
! msgid ""
! "Generate code that won't be linked against any other ID shared libraries,"
  msgstr ""
  
! #: config/bfin/bfin.opt:74 config/m68k/m68k.opt:171
! msgid "ID of shared library to build"
  msgstr ""
  
! #: config/bfin/bfin.opt:78 config/m68k/m68k.opt:167
! msgid "Enable separate data segment"
  msgstr ""
  
! #: config/bfin/bfin.opt:82 config/c6x/c6x.opt:63
! msgid "Avoid generating pc-relative calls; use indirection"
  msgstr ""
  
! #: config/bfin/bfin.opt:86
! msgid "Link with the fast floating-point library"
  msgstr ""
  
! #: config/bfin/bfin.opt:90 config/frv/frv.opt:130
! msgid "Enable Function Descriptor PIC mode"
  msgstr ""
  
! #: config/bfin/bfin.opt:94 config/frv/frv.opt:162
! msgid "Enable inlining of PLT in function calls"
  msgstr ""
  
! #: config/bfin/bfin.opt:98
! msgid "Do stack checking using bounds in L1 scratch memory"
  msgstr ""
  
! #: config/bfin/bfin.opt:102
! msgid "Enable multicore support"
  msgstr ""
  
! #: config/bfin/bfin.opt:106
! msgid "Build for Core A"
  msgstr ""
  
! #: config/bfin/bfin.opt:110
! msgid "Build for Core B"
  msgstr ""
  
! #: config/bfin/bfin.opt:114
! msgid "Build for SDRAM"
  msgstr ""
  
! #: config/bfin/bfin.opt:118
! msgid "Assume ICPLBs are enabled at runtime."
  msgstr ""
  
! #: config/m68k/m68k-tables.opt:25
! msgid "Known M68K CPUs (for use with the -mcpu= option):"
  msgstr ""
  
! #: config/m68k/m68k-tables.opt:365
! msgid "Known M68K microarchitectures (for use with the -mtune= option):"
  msgstr ""
  
! #: config/m68k/m68k-tables.opt:411
! msgid "Known M68K ISAs (for use with the -march= option):"
  msgstr ""
  
! #: config/m68k/ieee.opt:24 config/i386/i386.opt:358
! msgid "Use IEEE math for fp comparisons"
  msgstr ""
  
! #: config/m68k/m68k.opt:30
! msgid "Generate code for a 520X"
  msgstr ""
  
! #: config/m68k/m68k.opt:34
! msgid "Generate code for a 5206e"
  msgstr ""
  
! #: config/m68k/m68k.opt:38
! msgid "Generate code for a 528x"
  msgstr ""
  
! #: config/m68k/m68k.opt:42
! msgid "Generate code for a 5307"
  msgstr ""
  
! #: config/m68k/m68k.opt:46
! msgid "Generate code for a 5407"
  msgstr ""
  
! #: config/m68k/m68k.opt:50 config/m68k/m68k.opt:111
! msgid "Generate code for a 68000"
  msgstr ""
  
! #: config/m68k/m68k.opt:54
! msgid "Generate code for a 68010"
  msgstr ""
  
! #: config/m68k/m68k.opt:58 config/m68k/m68k.opt:115
! msgid "Generate code for a 68020"
  msgstr ""
  
! #: config/m68k/m68k.opt:62
! msgid "Generate code for a 68040, without any new instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:66
! msgid "Generate code for a 68060, without any new instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:70
! msgid "Generate code for a 68030"
  msgstr ""
  
! #: config/m68k/m68k.opt:74
! msgid "Generate code for a 68040"
  msgstr ""
  
! #: config/m68k/m68k.opt:78
! msgid "Generate code for a 68060"
  msgstr ""
  
! #: config/m68k/m68k.opt:82
! msgid "Generate code for a 68302"
  msgstr ""
  
! #: config/m68k/m68k.opt:86
! msgid "Generate code for a 68332"
  msgstr ""
  
! #: config/m68k/m68k.opt:91
! msgid "Generate code for a 68851"
  msgstr ""
  
! #: config/m68k/m68k.opt:95
! msgid "Generate code that uses 68881 floating-point instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:99
! msgid "Align variables on a 32-bit boundary"
  msgstr ""
  
! #: config/m68k/m68k.opt:103 config/arm/arm.opt:81 config/c6x/c6x.opt:67
! msgid "Specify the name of the target architecture"
  msgstr ""
  
! #: config/m68k/m68k.opt:107
! msgid "Use the bit-field instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:119
! msgid "Generate code for a ColdFire v4e"
  msgstr ""
  
! #: config/m68k/m68k.opt:123
! msgid "Specify the target CPU"
  msgstr ""
  
! #: config/m68k/m68k.opt:127
! msgid "Generate code for a cpu32"
  msgstr ""
  
! #: config/m68k/m68k.opt:131
! msgid "Use hardware division instructions on ColdFire"
  msgstr ""
  
! #: config/m68k/m68k.opt:135
! msgid "Generate code for a Fido A"
  msgstr ""
  
! #: config/m68k/m68k.opt:139
! msgid "Generate code which uses hardware floating point instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:143
! msgid "Enable ID based shared library"
  msgstr ""
  
! #: config/m68k/m68k.opt:147
! msgid "Do not use the bit-field instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:151
! msgid "Use normal calling convention"
  msgstr ""
  
! #: config/m68k/m68k.opt:155
! msgid "Consider type 'int' to be 32 bits wide"
  msgstr ""
  
! #: config/m68k/m68k.opt:159
! msgid "Generate pc-relative code"
  msgstr ""
  
! #: config/m68k/m68k.opt:163
! msgid "Use different calling convention using 'rtd'"
  msgstr ""
  
! #: config/m68k/m68k.opt:175
! msgid "Consider type 'int' to be 16 bits wide"
  msgstr ""
  
! #: config/m68k/m68k.opt:179
! msgid "Generate code with library calls for floating point"
  msgstr ""
  
! #: config/m68k/m68k.opt:183
! msgid "Do not use unaligned memory references"
  msgstr ""
  
! #: config/m68k/m68k.opt:187
! msgid "Tune for the specified target CPU or architecture"
  msgstr ""
  
! #: config/m68k/m68k.opt:191
! msgid "Support more than 8192 GOT entries on ColdFire"
  msgstr ""
  
! #: config/m68k/m68k.opt:195
! msgid "Support TLS segment larger than 64K"
  msgstr ""
  
! #: config/m32c/m32c.opt:23
! msgid "-msim\tUse simulator runtime"
  msgstr ""
  
! #: config/m32c/m32c.opt:27
! msgid "-mcpu=r8c\tCompile code for R8C variants"
  msgstr ""
  
! #: config/m32c/m32c.opt:31
! msgid "-mcpu=m16c\tCompile code for M16C variants"
  msgstr ""
  
! #: config/m32c/m32c.opt:35
! msgid "-mcpu=m32cm\tCompile code for M32CM variants"
  msgstr ""
  
! #: config/m32c/m32c.opt:39
! msgid "-mcpu=m32c\tCompile code for M32C variants"
  msgstr ""
  
! #: config/m32c/m32c.opt:43
! msgid "-memregs=\tNumber of memreg bytes (default: 16, range: 0..16)"
  msgstr ""
  
! #: config/msp430/msp430.opt:7
! msgid "Force assembly output to always use hex constants"
  msgstr ""
  
! #: config/msp430/msp430.opt:11
! msgid "Specify the MCU to build for."
  msgstr ""
  
! #: config/msp430/msp430.opt:15
! msgid "Specify the ISA to build for: msp430, mdsp430x, msp430xv2"
  msgstr ""
  
! #: config/msp430/msp430.opt:19
! msgid "Select large model - 20-bit addresses/pointers"
  msgstr ""
  
! #: config/msp430/msp430.opt:23
! msgid "Select small model - 16-bit addresses/pointers (default)"
  msgstr ""
  
! #: config/msp430/msp430.opt:27
! msgid "Optimize opcode sizes at link time"
  msgstr ""
  
! #: config/msp430/msp430.opt:34
! msgid ""
! "Use a minimum runtime (no static initializers or ctors) for memory-"
! "constrained devices."
  msgstr ""
  
! #: config/msp430/msp430.opt:41
! msgid "Specify the type of hardware multiply to support"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:28
! msgid "The possible TLS dialects:"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:40
! msgid "The code model option names for -mcmodel:"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:64 config/arm/arm.opt:94
! #: config/microblaze/microblaze.opt:60
! msgid "Assume target CPU is configured as big endian"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:68
! msgid "Generate code which uses only the general registers"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:72
! msgid "Workaround for ARM Cortex-A53 Erratum number 835769"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:76
! msgid "Workaround for ARM Cortex-A53 Erratum number 843419"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:80 config/arm/arm.opt:151
! #: config/microblaze/microblaze.opt:64
! msgid "Assume target CPU is configured as little endian"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:84
! msgid "Specify the code model"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:88
! msgid "Don't assume that unaligned accesses are handled by the system"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:92 config/i386/i386.opt:390
! msgid "Omit the frame pointer in leaf functions"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:96
! msgid "Specify TLS dialect"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:100
! msgid "-march=ARCH\tUse features of architecture ARCH"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:104
! msgid "-mcpu=CPU\tUse features of and optimize for CPU"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:108
! msgid "-mtune=CPU\tOptimize for CPU"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:112
! msgid "-mabi=ABI\tGenerate code that conforms to the specified ABI"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:116
! msgid "Known AArch64 ABIs (for use with the -mabi= option):"
  msgstr ""
  
! #: config/linux.opt:24
! msgid "Use Bionic C library"
  msgstr ""
  
! #: config/linux.opt:28
! msgid "Use GNU C library"
  msgstr ""
  
! #: config/linux.opt:32
! msgid "Use uClibc C library"
  msgstr ""
  
! #: config/ia64/ilp32.opt:3
! msgid "Generate ILP32 code"
  msgstr ""
  
! #: config/ia64/ilp32.opt:7
! msgid "Generate LP64 code"
  msgstr ""
  
! #: config/ia64/ia64.opt:28
! msgid "Generate big endian code"
  msgstr ""
  
! #: config/ia64/ia64.opt:32
! msgid "Generate little endian code"
  msgstr ""
  
! #: config/ia64/ia64.opt:36
! msgid "Generate code for GNU as"
  msgstr ""
  
! #: config/ia64/ia64.opt:40
! msgid "Generate code for GNU ld"
  msgstr ""
  
! #: config/ia64/ia64.opt:44
! msgid "Emit stop bits before and after volatile extended asms"
  msgstr ""
  
! #: config/ia64/ia64.opt:48
! msgid "Use in/loc/out register names"
  msgstr ""
  
! #: config/ia64/ia64.opt:55
! msgid "Enable use of sdata/scommon/sbss"
  msgstr ""
  
! #: config/ia64/ia64.opt:59
! msgid "Generate code without GP reg"
  msgstr ""
  
! #: config/ia64/ia64.opt:63
! msgid "gp is constant (but save/restore gp on indirect calls)"
  msgstr ""
  
! #: config/ia64/ia64.opt:67
! msgid "Generate self-relocatable code"
  msgstr ""
  
! #: config/ia64/ia64.opt:71
! msgid "Generate inline floating point division, optimize for latency"
  msgstr ""
  
! #: config/ia64/ia64.opt:75
! msgid "Generate inline floating point division, optimize for throughput"
  msgstr ""
  
! #: config/ia64/ia64.opt:82
! msgid "Generate inline integer division, optimize for latency"
  msgstr ""
  
! #: config/ia64/ia64.opt:86
! msgid "Generate inline integer division, optimize for throughput"
  msgstr ""
  
! #: config/ia64/ia64.opt:90
! msgid "Do not inline integer division"
  msgstr ""
  
! #: config/ia64/ia64.opt:94
! msgid "Generate inline square root, optimize for latency"
  msgstr ""
  
! #: config/ia64/ia64.opt:98
! msgid "Generate inline square root, optimize for throughput"
  msgstr ""
  
! #: config/ia64/ia64.opt:102
! msgid "Do not inline square root"
  msgstr ""
  
! #: config/ia64/ia64.opt:106
! msgid "Enable Dwarf 2 line debug info via GNU as"
  msgstr ""
  
! #: config/ia64/ia64.opt:110
! msgid "Enable earlier placing stop bits for better scheduling"
  msgstr ""
  
! #: config/ia64/ia64.opt:114 config/spu/spu.opt:72 config/pa/pa.opt:58
! #: config/sh/sh.opt:269
! msgid "Specify range of registers to make fixed"
  msgstr ""
  
! #: config/ia64/ia64.opt:118 config/rs6000/sysv4.opt:32
! #: config/alpha/alpha.opt:130
! msgid "Specify bit size of immediate TLS offsets"
  msgstr ""
  
! #: config/ia64/ia64.opt:122 config/spu/spu.opt:84 config/i386/i386.opt:504
! #: config/s390/s390.opt:143 config/sparc/sparc.opt:126
! #: config/visium/visium.opt:49
! msgid "Schedule code for given CPU"
  msgstr ""
  
! #: config/ia64/ia64.opt:126
! msgid "Known Itanium CPUs (for use with the -mtune= option):"
  msgstr ""
  
! #: config/ia64/ia64.opt:136
! msgid "Use data speculation before reload"
  msgstr ""
  
! #: config/ia64/ia64.opt:140
! msgid "Use data speculation after reload"
  msgstr ""
  
! #: config/ia64/ia64.opt:144
! msgid "Use control speculation"
  msgstr ""
  
! #: config/ia64/ia64.opt:148
! msgid "Use in block data speculation before reload"
  msgstr ""
  
! #: config/ia64/ia64.opt:152
! msgid "Use in block data speculation after reload"
  msgstr ""
  
! #: config/ia64/ia64.opt:156
! msgid "Use in block control speculation"
  msgstr ""
  
! #: config/ia64/ia64.opt:160
! msgid "Use simple data speculation check"
  msgstr ""
  
! #: config/ia64/ia64.opt:164
! msgid "Use simple data speculation check for control speculation"
  msgstr ""
  
! #: config/ia64/ia64.opt:174
  msgid ""
! "Count speculative dependencies while calculating priority of instructions"
  msgstr ""
  
! #: config/ia64/ia64.opt:178
! msgid "Place a stop bit after every cycle when scheduling"
  msgstr ""
  
! #: config/ia64/ia64.opt:182
! msgid ""
! "Assume that floating-point stores and loads are not likely to cause conflict "
! "when placed into one instruction group"
  msgstr ""
  
! #: config/ia64/ia64.opt:186
! msgid ""
! "Soft limit on number of memory insns per instruction group, giving lower "
! "priority to subsequent memory insns attempting to schedule in the same insn "
! "group. Frequently useful to prevent cache bank conflicts.  Default value is 1"
  msgstr ""
  
! #: config/ia64/ia64.opt:190
! msgid ""
! "Disallow more than 'msched-max-memory-insns' in instruction group. "
! "Otherwise, limit is 'soft' (prefer non-memory operations when limit is "
! "reached)"
  msgstr ""
  
! #: config/ia64/ia64.opt:194
! msgid "Don't generate checks for control speculation in selective scheduling"
  msgstr ""
  
! #: config/spu/spu.opt:20
! msgid "Emit warnings when run-time relocations are generated"
  msgstr ""
  
! #: config/spu/spu.opt:24
! msgid "Emit errors when run-time relocations are generated"
  msgstr ""
  
! #: config/spu/spu.opt:28
! msgid "Specify cost of branches (Default 20)"
  msgstr ""
  
! #: config/spu/spu.opt:32
! msgid "Make sure loads and stores are not moved past DMA instructions"
  msgstr ""
  
! #: config/spu/spu.opt:36
! msgid "volatile must be specified on any memory that is effected by DMA"
  msgstr ""
  
! #: config/spu/spu.opt:40 config/spu/spu.opt:44
  msgid ""
! "Insert nops when it might improve performance by allowing dual issue "
! "(default)"
  msgstr ""
  
! #: config/spu/spu.opt:48
! msgid "Use standard main function as entry for startup"
  msgstr ""
  
! #: config/spu/spu.opt:52
! msgid "Generate branch hints for branches"
  msgstr ""
  
! #: config/spu/spu.opt:56
! msgid "Maximum number of nops to insert for a hint (Default 2)"
  msgstr ""
  
! #: config/spu/spu.opt:60
! msgid ""
! "Approximate maximum number of instructions to allow between a hint and its "
! "branch [125]"
  msgstr ""
  
! #: config/spu/spu.opt:64
! msgid "Generate code for 18 bit addressing"
  msgstr ""
  
! #: config/spu/spu.opt:68
! msgid "Generate code for 32 bit addressing"
  msgstr ""
  
! #: config/spu/spu.opt:76
! msgid ""
! "Insert hbrp instructions after hinted branch targets to avoid the SPU hang "
! "issue"
  msgstr ""
  
! #: config/spu/spu.opt:80 config/i386/i386.opt:247 config/s390/s390.opt:47
! msgid "Generate code for given CPU"
  msgstr ""
  
! #: config/spu/spu.opt:88
! msgid "Access variables in 32-bit PPU objects (default)"
  msgstr ""
  
! #: config/spu/spu.opt:92
! msgid "Access variables in 64-bit PPU objects"
  msgstr ""
  
! #: config/spu/spu.opt:96
! msgid "Allow conversions between __ea and generic pointers (default)"
  msgstr ""
  
! #: config/spu/spu.opt:100
! msgid "Size (in KB) of software data cache"
  msgstr ""
  
! #: config/spu/spu.opt:104
! msgid "Atomically write back software data cache lines (default)"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:24
! msgid "Don't use any of r32..r63."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:28
! msgid ""
! "preferentially allocate registers that allow short instruction generation."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:32
! msgid "Set branch cost"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:36
! msgid "enable conditional move instruction usage."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:40
! msgid "set number of nops to emit before each insn pattern"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:52
! msgid "Use software floating point comparisons"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:56
! msgid "Enable split of 32 bit immediate loads into low / high part"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:60
! msgid "Enable use of POST_INC / POST_DEC"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:64
! msgid "Enable use of POST_MODIFY"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:68
! msgid "Set number of bytes on the stack preallocated for use by the callee."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:72
! msgid "Assume round to nearest is selected for purposes of scheduling."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:76
! msgid "Generate call insns as indirect calls"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:80
! msgid "Generate call insns as direct calls"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:84
! msgid ""
! "Assume labels and symbols can be addressed using 16 bit absolute addresses."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:108
! msgid ""
! "A floatig point to integer truncation may be replaced with rounding to save "
! "mode switching"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:112
! msgid "Vectorize for double-word operations."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:128
! msgid ""
! "Split unaligned 8 byte vector moves before post-modify address generation."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:132
! msgid "Use the floating point unit for integer add/subtract."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:136
! msgid "Set register to hold -1."
  msgstr ""
  
! #: config/h8300/h8300.opt:23
! msgid "Generate H8S code"
  msgstr ""
  
! #: config/h8300/h8300.opt:27
! msgid "Generate H8SX code"
  msgstr ""
  
! #: config/h8300/h8300.opt:31
! msgid "Generate H8S/2600 code"
  msgstr ""
  
! #: config/h8300/h8300.opt:35
! msgid "Make integers 32 bits wide"
  msgstr ""
  
! #: config/h8300/h8300.opt:42
! msgid "Use registers for argument passing"
  msgstr ""
  
! #: config/h8300/h8300.opt:46
! msgid "Consider access to byte sized memory slow"
  msgstr ""
  
! #: config/h8300/h8300.opt:50
! msgid "Enable linker relaxing"
  msgstr ""
  
! #: config/h8300/h8300.opt:54
! msgid "Generate H8/300H code"
  msgstr ""
  
! #: config/h8300/h8300.opt:58
! msgid "Enable the normal mode"
  msgstr ""
  
! #: config/h8300/h8300.opt:62
! msgid "Use H8/300 alignment rules"
  msgstr ""
  
! #: config/h8300/h8300.opt:66
! msgid "Push extended registers on stack in monitor functions"
  msgstr ""
  
! #: config/h8300/h8300.opt:70
! msgid "Do not push extended registers on stack in monitor functions"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:23
! msgid "Generate code for an 11/10"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:27
! msgid "Generate code for an 11/40"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:31
! msgid "Generate code for an 11/45"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:35
! msgid "Return floating-point results in ac0 (fr0 in Unix assembler syntax)"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:39
! msgid "Do not use inline patterns for copying memory"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:43
! msgid "Use inline patterns for copying memory"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:47
! msgid "Do not pretend that branches are expensive"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:51
! msgid "Pretend that branches are expensive"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:55
! msgid "Use the DEC assembler syntax"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:59
! msgid "Use 32 bit float"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:63
! msgid "Use 64 bit float"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:67 config/rs6000/rs6000.opt:177
! #: config/frv/frv.opt:158
! msgid "Use hardware floating point"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:71
! msgid "Use 16 bit int"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:75
! msgid "Use 32 bit int"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:79 config/rs6000/rs6000.opt:173
! msgid "Do not use hardware floating point"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:83
! msgid "Target has split I&D"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:87
! msgid "Use UNIX assembler syntax"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:23
! msgid "Use CONST16 instruction to load constants"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:27
! msgid "Disable position-independent code (PIC) for use in OS kernel code"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:31
! msgid "Use indirect CALLXn instructions for large programs"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:35
! msgid "Automatically align branch targets to reduce branch penalties"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:39
! msgid "Intersperse literal pools with code in the text section"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:43
! msgid ""
! "-mno-serialize-volatile\tDo not serialize volatile memory references with "
! "MEMW instructions"
  msgstr ""
  
! #: config/i386/cygming.opt:23
! msgid "Create console application"
  msgstr ""
  
! #: config/i386/cygming.opt:27
! msgid "Generate code for a DLL"
  msgstr ""
  
! #: config/i386/cygming.opt:31
! msgid "Ignore dllimport for functions"
  msgstr ""
  
! #: config/i386/cygming.opt:35
! msgid "Use Mingw-specific thread support"
  msgstr ""
  
! #: config/i386/cygming.opt:39
! msgid "Set Windows defines"
  msgstr ""
  
! #: config/i386/cygming.opt:43
! msgid "Create GUI application"
  msgstr ""
  
! #: config/i386/cygming.opt:47 config/i386/interix.opt:32
! msgid "Use the GNU extension to the PE format for aligned common data"
  msgstr ""
  
! #: config/i386/cygming.opt:51
  msgid ""
! "Compile code that relies on Cygwin DLL wrappers to support C++ operator new/"
! "delete replacement"
! msgstr ""
! 
! #: config/i386/cygming.opt:58
! msgid "Put relocated read-only data into .data section."
  msgstr ""
  
! #: config/i386/mingw.opt:29
! msgid "Warn about none ISO msvcrt scanf/printf width extensions"
  msgstr ""
  
! #: config/i386/mingw.opt:33
! msgid "For nested functions on stack executable permission is set."
  msgstr ""
  
! #: config/i386/mingw-w64.opt:23
! msgid "Use unicode startup and define UNICODE macro"
  msgstr ""
  
! #: config/i386/djgpp.opt:25
! msgid "Ignored (obsolete)"
  msgstr ""
  
  #: config/i386/i386.opt:182
--- 5468,7930 ----
  msgid " conflicting code gen style switches are used"
  msgstr ""
  
! #: config/rs6000/freebsd64.h:171
! msgid "consider using `-pg' instead of `-p' with gprof(1)"
  msgstr ""
  
! #: config/rx/rx.h:75
! msgid "-mas100-syntax is incompatible with -gdwarf"
  msgstr ""
  
! #: config/rx/rx.h:76
! msgid "rx100 cpu does not have FPU hardware"
  msgstr ""
  
! #: config/rx/rx.h:77
! msgid "rx200 cpu does not have FPU hardware"
  msgstr ""
  
! #: config/s390/tpf.h:106
! msgid "static is not supported on TPF-OS"
  msgstr ""
  
! #: config/sh/sh.h:375 config/sh/sh.h:378
! msgid "SH2a does not support little-endian"
  msgstr ""
  
! #: config/sparc/linux64.h:149 config/sparc/linux64.h:156
! #: config/sparc/netbsd-elf.h:108 config/sparc/netbsd-elf.h:117
! #: config/sparc/sol2.h:219 config/sparc/sol2.h:225
! msgid "may not use both -m32 and -m64"
  msgstr ""
  
! #: config/vax/netbsd-elf.h:51
! msgid "the -shared option is not currently supported for VAX ELF"
  msgstr ""
  
! #: config/vax/vax.h:46 config/vax/vax.h:47
! msgid "profiling not supported with -mg"
  msgstr ""
  
! #: ada/gcc-interface/lang-specs.h:34
! msgid "-c or -S required for Ada"
  msgstr ""
  
! #: ada/gcc-interface/lang-specs.h:52
! msgid "-c required for gnat2why"
  msgstr ""
  
! #: ada/gcc-interface/lang-specs.h:65
! msgid "-c required for gnat2scil"
  msgstr ""
  
! #: fortran/lang-specs.h:54 fortran/lang-specs.h:68
! msgid "gfortran does not support -E without -cpp"
  msgstr ""
  
! #: java/lang-specs.h:32
! msgid "-fjni and -femit-class-files are incompatible"
  msgstr ""
  
! #: java/lang-specs.h:33
! msgid "-fjni and -femit-class-file are incompatible"
  msgstr ""
  
! #: java/lang-specs.h:34 java/lang-specs.h:35
! msgid "-femit-class-file should used along with -fsyntax-only"
  msgstr ""
  
! #: objc/lang-specs.h:30 objc/lang-specs.h:41
! msgid "GNU Objective C no longer supports traditional compilation"
  msgstr ""
  
! #: objc/lang-specs.h:55
  msgid ""
! "objc-cpp-output is deprecated; please use objective-c-cpp-output instead"
  msgstr ""
  
! #: objcp/lang-specs.h:58
  msgid ""
! "objc++-cpp-output is deprecated; please use objective-c++-cpp-output instead"
  msgstr ""
  
! #: config/alpha/alpha.opt:23 config/i386/i386.opt:430
! msgid "Do not use hardware fp"
  msgstr ""
  
! #: config/alpha/alpha.opt:27
! msgid "Use fp registers"
  msgstr ""
  
! #: config/alpha/alpha.opt:31 common.opt:696 common.opt:881 common.opt:885
! #: common.opt:889 common.opt:893 common.opt:1349 common.opt:1498
! #: common.opt:1502 common.opt:1724 common.opt:1866 common.opt:2489
! #: fortran/lang.opt:433
  msgid "Does nothing. Preserved for backward compatibility."
  msgstr ""
  
! #: config/alpha/alpha.opt:35
! msgid "Request IEEE-conformant math library routines (OSF/1)"
  msgstr ""
  
! #: config/alpha/alpha.opt:39
! msgid "Emit IEEE-conformant code, without inexact exceptions"
  msgstr ""
  
! #: config/alpha/alpha.opt:46
! msgid "Do not emit complex integer constants to read-only memory"
  msgstr ""
  
! #: config/alpha/alpha.opt:50
! msgid "Use VAX fp"
  msgstr ""
  
! #: config/alpha/alpha.opt:54
! msgid "Do not use VAX fp"
  msgstr ""
  
! #: config/alpha/alpha.opt:58
! msgid "Emit code for the byte/word ISA extension"
  msgstr ""
  
! #: config/alpha/alpha.opt:62
! msgid "Emit code for the motion video ISA extension"
  msgstr ""
  
! #: config/alpha/alpha.opt:66
! msgid "Emit code for the fp move and sqrt ISA extension"
  msgstr ""
  
! #: config/alpha/alpha.opt:70
! msgid "Emit code for the counting ISA extension"
  msgstr ""
  
! #: config/alpha/alpha.opt:74
! msgid "Emit code using explicit relocation directives"
  msgstr ""
  
! #: config/alpha/alpha.opt:78
! msgid "Emit 16-bit relocations to the small data areas"
  msgstr ""
  
! #: config/alpha/alpha.opt:82
! msgid "Emit 32-bit relocations to the small data areas"
  msgstr ""
  
! #: config/alpha/alpha.opt:86
! msgid "Emit direct branches to local functions"
  msgstr ""
  
! #: config/alpha/alpha.opt:90
! msgid "Emit indirect branches to local functions"
  msgstr ""
  
! #: config/alpha/alpha.opt:94
! msgid "Emit rdval instead of rduniq for thread pointer"
  msgstr ""
  
! #: config/alpha/alpha.opt:98 config/s390/s390.opt:114 config/i386/i386.opt:202
! #: config/sparc/long-double-switch.opt:23
! msgid "Use 128-bit long double"
  msgstr ""
  
! #: config/alpha/alpha.opt:102 config/s390/s390.opt:118 config/i386/i386.opt:198
! #: config/sparc/long-double-switch.opt:27
! msgid "Use 64-bit long double"
  msgstr ""
  
! #: config/alpha/alpha.opt:106
! msgid "Use features of and schedule given CPU"
  msgstr ""
  
! #: config/alpha/alpha.opt:110
! msgid "Schedule given CPU"
  msgstr ""
  
! #: config/alpha/alpha.opt:114
! msgid "Control the generated fp rounding mode"
  msgstr ""
  
! #: config/alpha/alpha.opt:118
! msgid "Control the IEEE trap mode"
  msgstr ""
  
! #: config/alpha/alpha.opt:122
! msgid "Control the precision given to fp exceptions"
  msgstr ""
  
! #: config/alpha/alpha.opt:126
! msgid "Tune expected memory latency"
  msgstr ""
  
! #: config/alpha/alpha.opt:130 config/ia64/ia64.opt:118
! #: config/rs6000/sysv4.opt:32
! msgid "Specify bit size of immediate TLS offsets"
  msgstr ""
  
! #: config/fused-madd.opt:22
! msgid "%<-mfused-madd%> is deprecated; use %<-ffp-contract=%> instead"
  msgstr ""
  
! #: config/mips/mips-tables.opt:24
! msgid "Known MIPS CPUs (for use with the -march= and -mtune= options):"
  msgstr ""
  
! #: config/mips/mips-tables.opt:28
! msgid "Known MIPS ISA levels (for use with the -mips option):"
  msgstr ""
  
! #: config/mips/mips.opt:32
! msgid "-mabi=ABI\tGenerate code that conforms to the given ABI"
  msgstr ""
  
! #: config/mips/mips.opt:36
! msgid "Known MIPS ABIs (for use with the -mabi= option):"
  msgstr ""
  
! #: config/mips/mips.opt:55
! msgid "Generate code that can be used in SVR4-style dynamic objects"
  msgstr ""
  
! #: config/mips/mips.opt:59
! msgid "Use PMC-style 'mad' instructions"
  msgstr ""
  
! #: config/mips/mips.opt:63
! msgid "Use integer madd/msub instructions"
  msgstr ""
  
! #: config/mips/mips.opt:67
! msgid "-march=ISA\tGenerate code for the given ISA"
  msgstr ""
  
! #: config/mips/mips.opt:71
  msgid ""
! "-mbranch-cost=COST\tSet the cost of branches to roughly COST instructions"
  msgstr ""
  
! #: config/mips/mips.opt:75
! msgid "Use Branch Likely instructions, overriding the architecture default"
  msgstr ""
  
! #: config/mips/mips.opt:79
! msgid "Switch on/off MIPS16 ASE on alternating functions for compiler testing"
  msgstr ""
  
! #: config/mips/mips.opt:83
! msgid "Trap on integer divide by zero"
  msgstr ""
  
! #: config/mips/mips.opt:87
! msgid ""
! "-mcode-readable=SETTING\tSpecify when instructions are allowed to access code"
  msgstr ""
  
! #: config/mips/mips.opt:91
! msgid "Valid arguments to -mcode-readable=:"
  msgstr ""
  
! #: config/mips/mips.opt:104
! msgid "Use branch-and-break sequences to check for integer divide by zero"
  msgstr ""
  
! #: config/mips/mips.opt:108
! msgid "Use trap instructions to check for integer divide by zero"
  msgstr ""
  
! #: config/mips/mips.opt:112
! msgid "Allow the use of MDMX instructions"
  msgstr ""
  
! #: config/mips/mips.opt:116
  msgid ""
! "Allow hardware floating-point instructions to cover both 32-bit and 64-bit "
! "operations"
  msgstr ""
  
! #: config/mips/mips.opt:120
! msgid "Use MIPS-DSP instructions"
  msgstr ""
  
! #: config/mips/mips.opt:124
! msgid "Use MIPS-DSP REV 2 instructions"
  msgstr ""
  
! #: config/mips/mips.opt:134 config/c6x/c6x.opt:30 config/nios2/nios2.opt:94
! #: config/mep/mep.opt:82
! msgid "Use big-endian byte order"
  msgstr ""
  
! #: config/mips/mips.opt:138 config/c6x/c6x.opt:34 config/nios2/nios2.opt:98
! #: config/mep/mep.opt:86
! msgid "Use little-endian byte order"
  msgstr ""
  
! #: config/mips/mips.opt:142 config/iq2000/iq2000.opt:61
! msgid "Use ROM instead of RAM"
  msgstr ""
  
! #: config/mips/mips.opt:146
! msgid "Use Enhanced Virtual Addressing instructions"
  msgstr ""
  
! #: config/mips/mips.opt:150
! msgid "Use NewABI-style %reloc() assembly operators"
  msgstr ""
  
! #: config/mips/mips.opt:154
! msgid "Use -G for data that is not defined by the current object"
  msgstr ""
  
! #: config/mips/mips.opt:158
! msgid "Work around certain 24K errata"
  msgstr ""
  
! #: config/mips/mips.opt:162
! msgid "Work around certain R4000 errata"
  msgstr ""
  
! #: config/mips/mips.opt:166
! msgid "Work around certain R4400 errata"
  msgstr ""
  
! #: config/mips/mips.opt:170
! msgid "Work around certain RM7000 errata"
  msgstr ""
  
! #: config/mips/mips.opt:174
! msgid "Work around certain R10000 errata"
  msgstr ""
  
! #: config/mips/mips.opt:178
! msgid "Work around errata for early SB-1 revision 2 cores"
  msgstr ""
  
! #: config/mips/mips.opt:182
! msgid "Work around certain VR4120 errata"
  msgstr ""
  
! #: config/mips/mips.opt:186
! msgid "Work around VR4130 mflo/mfhi errata"
  msgstr ""
  
! #: config/mips/mips.opt:190
! msgid "Work around an early 4300 hardware bug"
  msgstr ""
  
! #: config/mips/mips.opt:194
! msgid "FP exceptions are enabled"
  msgstr ""
  
! #: config/mips/mips.opt:198
! msgid "Use 32-bit floating-point registers"
  msgstr ""
  
! #: config/mips/mips.opt:202
! msgid "Conform to the o32 FPXX ABI"
  msgstr ""
  
! #: config/mips/mips.opt:206
! msgid "Use 64-bit floating-point registers"
  msgstr ""
  
! #: config/mips/mips.opt:210
  msgid ""
! "-mflush-func=FUNC\tUse FUNC to flush the cache before calling stack "
! "trampolines"
  msgstr ""
  
! #: config/mips/mips.opt:214
! msgid "Generate floating-point multiply-add instructions"
  msgstr ""
  
! #: config/mips/mips.opt:218
! msgid "-mabs=MODE\tSelect the IEEE 754 ABS/NEG instruction execution mode"
  msgstr ""
  
! #: config/mips/mips.opt:222
! msgid "-mnan=ENCODING\tSelect the IEEE 754 NaN data encoding"
  msgstr ""
  
! #: config/mips/mips.opt:226
  msgid ""
! "Known MIPS IEEE 754 settings (for use with the -mabs= and -mnan= options):"
  msgstr ""
  
! #: config/mips/mips.opt:236
! msgid "Use 32-bit general registers"
  msgstr ""
  
! #: config/mips/mips.opt:240
! msgid "Use 64-bit general registers"
  msgstr ""
  
! #: config/mips/mips.opt:244
! msgid "Use GP-relative addressing to access small data"
  msgstr ""
  
! #: config/mips/mips.opt:248
  msgid ""
! "When generating -mabicalls code, allow executables to use PLTs and copy "
! "relocations"
  msgstr ""
  
! #: config/mips/mips.opt:252
! msgid "Allow the use of hardware floating-point ABI and instructions"
  msgstr ""
  
! #: config/mips/mips.opt:256
! msgid "Generate code that is link-compatible with MIPS16 and microMIPS code."
  msgstr ""
  
! #: config/mips/mips.opt:260
! msgid "An alias for minterlink-compressed provided for backward-compatibility."
  msgstr ""
  
! #: config/mips/mips.opt:264
! msgid "-mipsN\tGenerate code for ISA level N"
  msgstr ""
  
! #: config/mips/mips.opt:268
! msgid "Generate MIPS16 code"
  msgstr ""
  
! #: config/mips/mips.opt:272
! msgid "Use MIPS-3D instructions"
  msgstr ""
  
! #: config/mips/mips.opt:276
! msgid "Use ll, sc and sync instructions"
  msgstr ""
  
! #: config/mips/mips.opt:280
! msgid "Use -G for object-local data"
  msgstr ""
  
! #: config/mips/mips.opt:284
! msgid "Use indirect calls"
  msgstr ""
  
! #: config/mips/mips.opt:288
! msgid "Use a 32-bit long type"
  msgstr ""
  
! #: config/mips/mips.opt:292
! msgid "Use a 64-bit long type"
  msgstr ""
  
! #: config/mips/mips.opt:296
! msgid "Pass the address of the ra save location to _mcount in $12"
  msgstr ""
  
! #: config/mips/mips.opt:300
! msgid "Don't optimize block moves"
  msgstr ""
  
! #: config/mips/mips.opt:304
! msgid "Use microMIPS instructions"
  msgstr ""
  
! #: config/mips/mips.opt:308
! msgid "Allow the use of MT instructions"
  msgstr ""
  
! #: config/mips/mips.opt:312
! msgid "Prevent the use of all floating-point operations"
  msgstr ""
  
! #: config/mips/mips.opt:316
! msgid "Use MCU instructions"
  msgstr ""
  
! #: config/mips/mips.opt:320
! msgid "Do not use a cache-flushing function before calling stack trampolines"
  msgstr ""
  
! #: config/mips/mips.opt:324
! msgid "Do not use MDMX instructions"
  msgstr ""
  
! #: config/mips/mips.opt:328
! msgid "Generate normal-mode code"
  msgstr ""
  
! #: config/mips/mips.opt:332
! msgid "Do not use MIPS-3D instructions"
  msgstr ""
  
! #: config/mips/mips.opt:336
! msgid "Use paired-single floating-point instructions"
  msgstr ""
  
! #: config/mips/mips.opt:340
  msgid ""
! "-mr10k-cache-barrier=SETTING\tSpecify when r10k cache barriers should be "
! "inserted"
  msgstr ""
  
! #: config/mips/mips.opt:344
! msgid "Valid arguments to -mr10k-cache-barrier=:"
  msgstr ""
  
! #: config/mips/mips.opt:357
! msgid "Try to allow the linker to turn PIC calls into direct calls"
  msgstr ""
  
! #: config/mips/mips.opt:361
  msgid ""
! "When generating -mabicalls code, make the code suitable for use in shared "
! "libraries"
  msgstr ""
  
! #: config/mips/mips.opt:365
  msgid ""
! "Restrict the use of hardware floating-point instructions to 32-bit operations"
  msgstr ""
  
! #: config/mips/mips.opt:369
! msgid "Use SmartMIPS instructions"
  msgstr ""
  
! #: config/mips/mips.opt:373
! msgid "Prevent the use of all hardware floating-point instructions"
  msgstr ""
  
! #: config/mips/mips.opt:377
! msgid "Optimize lui/addiu address loads"
  msgstr ""
  
! #: config/mips/mips.opt:381
! msgid "Assume all symbols have 32-bit values"
  msgstr ""
  
! #: config/mips/mips.opt:385
! msgid "Use synci instruction to invalidate i-cache"
  msgstr ""
  
! #: config/mips/mips.opt:389 config/s390/s390.opt:180
! #: config/rs6000/rs6000.opt:474
! msgid "Use LRA instead of reload"
  msgstr ""
  
! #: config/mips/mips.opt:393
! msgid "-mtune=PROCESSOR\tOptimize the output for PROCESSOR"
  msgstr ""
  
! #: config/mips/mips.opt:397 config/iq2000/iq2000.opt:74
! msgid "Put uninitialized constants in ROM (needs -membedded-data)"
  msgstr ""
  
! #: config/mips/mips.opt:401
! msgid "Use Virtualization Application Specific instructions"
  msgstr ""
  
! #: config/mips/mips.opt:405
! msgid "Use eXtended Physical Address (XPA) instructions"
  msgstr ""
  
! #: config/mips/mips.opt:409
! msgid "Perform VR4130-specific alignment optimizations"
  msgstr ""
  
! #: config/mips/mips.opt:413
! msgid "Lift restrictions on GOT size"
  msgstr ""
  
! #: config/mips/mips.opt:417
! msgid "Enable use of odd-numbered single-precision registers"
  msgstr ""
  
! #: config/visium/visium.opt:25
! msgid "Link with libc.a and libdebug.a"
  msgstr ""
  
! #: config/visium/visium.opt:29
! msgid "Link with libc.a and libsim.a"
  msgstr ""
  
! #: config/visium/visium.opt:33
! msgid "Use hardware FP (default)"
  msgstr ""
  
! #: config/visium/visium.opt:37 config/sparc/sparc.opt:30
! #: config/sparc/sparc.opt:34
! msgid "Use hardware FP"
  msgstr ""
  
! #: config/visium/visium.opt:41 config/sparc/sparc.opt:38
! msgid "Do not use hardware FP"
  msgstr ""
  
! #: config/visium/visium.opt:45 config/sparc/sparc.opt:122
! msgid "Use features of and schedule code for given CPU"
  msgstr ""
  
! #: config/visium/visium.opt:49 config/spu/spu.opt:84 config/s390/s390.opt:150
! #: config/i386/i386.opt:504 config/sparc/sparc.opt:126 config/ia64/ia64.opt:122
! msgid "Schedule code for given CPU"
  msgstr ""
  
! #: config/visium/visium.opt:65
! msgid "Generate code for the supervisor mode (default)"
  msgstr ""
  
! #: config/visium/visium.opt:69
! msgid "Generate code for the user mode"
  msgstr ""
  
! #: config/visium/visium.opt:73
! msgid "Only retained for backward compatibility."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:24
! msgid "Don't use any of r32..r63."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:28
  msgid ""
! "preferentially allocate registers that allow short instruction generation."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:32
! msgid "Set branch cost"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:36
! msgid "enable conditional move instruction usage."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:40
! msgid "set number of nops to emit before each insn pattern"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:52
! msgid "Use software floating point comparisons"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:56
! msgid "Enable split of 32 bit immediate loads into low / high part"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:60
! msgid "Enable use of POST_INC / POST_DEC"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:64
! msgid "Enable use of POST_MODIFY"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:68
! msgid "Set number of bytes on the stack preallocated for use by the callee."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:72
! msgid "Assume round to nearest is selected for purposes of scheduling."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:76
! msgid "Generate call insns as indirect calls"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:80
! msgid "Generate call insns as direct calls"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:84
  msgid ""
! "Assume labels and symbols can be addressed using 16 bit absolute addresses."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:108
  msgid ""
! "A floatig point to integer truncation may be replaced with rounding to save "
! "mode switching"
  msgstr ""
  
! #: config/epiphany/epiphany.opt:112
! msgid "Vectorize for double-word operations."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:128
  msgid ""
! "Split unaligned 8 byte vector moves before post-modify address generation."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:132
! msgid "Use the floating point unit for integer add/subtract."
  msgstr ""
  
! #: config/epiphany/epiphany.opt:136
! msgid "Set register to hold -1."
  msgstr ""
  
! #: config/mn10300/mn10300.opt:30
! msgid "Target the AM33 processor"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:34
! msgid "Target the AM33/2.0 processor"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:38
! msgid "Target the AM34 processor"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:42 config/arm/arm.opt:223
! msgid "Tune code for the given processor"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:46
! msgid "Work around hardware multiply bug"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:55
! msgid "Enable linker relaxations"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:59
! msgid "Return pointers in both a0 and d0"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:63
! msgid "Allow gcc to generate LIW instructions"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:67
! msgid "Allow gcc to generate the SETLB and Lcc instructions"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:40
! msgid "Use software emulation for floating point (default)"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:44
! msgid "Use hardware floating point instructions"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:48
! msgid "Use table lookup optimization for small signed integer divisions"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:52
! msgid "-mcpu=PROCESSOR\t\tUse features of and schedule code for given CPU"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:56
! msgid "Don't optimize block moves, use memcpy"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:60 config/arm/arm.opt:94
! #: config/aarch64/aarch64.opt:64
! msgid "Assume target CPU is configured as big endian"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:64 config/arm/arm.opt:151
! #: config/aarch64/aarch64.opt:80
! msgid "Assume target CPU is configured as little endian"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:68
! msgid "Use the soft multiply emulation (default)"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:72
! msgid "Use reorder instructions (swap and byte reversed load/store) (default)"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:76
! msgid "Use the software emulation for divides (default)"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:80
! msgid "Use the hardware barrel shifter instead of emulation"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:84
! msgid "Use pattern compare instructions"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:87
! #, c-format
! msgid "%qs is deprecated; use -fstack-check"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:88
! msgid "Check for stack overflow at runtime"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:92 config/iq2000/iq2000.opt:65
! msgid "Use GP relative sdata/sbss sections"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:95
! #, c-format
! msgid "%qs is deprecated; use -fno-zero-initialized-in-bss"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:96
! msgid "Clear the BSS to zero and place zero initialized in BSS"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:100
! msgid "Use multiply high instructions for high part of 32x32 multiply"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:104
! msgid "Use hardware floating point conversion instructions"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:108
! msgid "Use hardware floating point square root instruction"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:112
! msgid "Description for mxl-mode-executable"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:116
! msgid "Description for mxl-mode-xmdstub"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:120
! msgid "Description for mxl-mode-bootstrap"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:124
! msgid "Description for mxl-mode-novectors"
  msgstr ""
  
! #: config/spu/spu.opt:20
! msgid "Emit warnings when run-time relocations are generated"
  msgstr ""
  
! #: config/spu/spu.opt:24
! msgid "Emit errors when run-time relocations are generated"
  msgstr ""
  
! #: config/spu/spu.opt:28
! msgid "Specify cost of branches (Default 20)"
  msgstr ""
  
! #: config/spu/spu.opt:32
! msgid "Make sure loads and stores are not moved past DMA instructions"
  msgstr ""
  
! #: config/spu/spu.opt:36
! msgid "volatile must be specified on any memory that is effected by DMA"
  msgstr ""
  
! #: config/spu/spu.opt:40 config/spu/spu.opt:44
  msgid ""
! "Insert nops when it might improve performance by allowing dual issue "
! "(default)"
  msgstr ""
  
! #: config/spu/spu.opt:48
! msgid "Use standard main function as entry for startup"
  msgstr ""
  
! #: config/spu/spu.opt:52
! msgid "Generate branch hints for branches"
  msgstr ""
  
! #: config/spu/spu.opt:56
! msgid "Maximum number of nops to insert for a hint (Default 2)"
  msgstr ""
  
! #: config/spu/spu.opt:60
  msgid ""
! "Approximate maximum number of instructions to allow between a hint and its "
! "branch [125]"
  msgstr ""
  
! #: config/spu/spu.opt:64
! msgid "Generate code for 18 bit addressing"
  msgstr ""
  
! #: config/spu/spu.opt:68
! msgid "Generate code for 32 bit addressing"
  msgstr ""
  
! #: config/spu/spu.opt:72 config/sh/sh.opt:269 config/ia64/ia64.opt:114
! #: config/pa/pa.opt:58
! msgid "Specify range of registers to make fixed"
  msgstr ""
  
! #: config/spu/spu.opt:76
  msgid ""
! "Insert hbrp instructions after hinted branch targets to avoid the SPU hang "
! "issue"
  msgstr ""
  
! #: config/spu/spu.opt:80 config/s390/s390.opt:47 config/i386/i386.opt:247
! msgid "Generate code for given CPU"
  msgstr ""
  
! #: config/spu/spu.opt:88
! msgid "Access variables in 32-bit PPU objects (default)"
  msgstr ""
  
! #: config/spu/spu.opt:92
! msgid "Access variables in 64-bit PPU objects"
  msgstr ""
  
! #: config/spu/spu.opt:96
! msgid "Allow conversions between __ea and generic pointers (default)"
  msgstr ""
  
! #: config/spu/spu.opt:100
! msgid "Size (in KB) of software data cache"
  msgstr ""
  
! #: config/spu/spu.opt:104
! msgid "Atomically write back software data cache lines (default)"
  msgstr ""
  
! #: config/c6x/c6x-tables.opt:24
! msgid "Known C6X ISAs (for use with the -march= option):"
  msgstr ""
  
! #: config/c6x/c6x.opt:38 config/msp430/msp430.opt:3 config/mep/mep.opt:143
! #: config/bfin/bfin.opt:40
! msgid "Use simulator runtime"
  msgstr ""
  
! #: config/c6x/c6x.opt:42 config/rs6000/sysv4.opt:28
! msgid "Select method for sdata handling"
  msgstr ""
  
! #: config/c6x/c6x.opt:46
! msgid "Valid arguments for the -msdata= option"
  msgstr ""
  
! #: config/c6x/c6x.opt:59
! msgid "Compile for the DSBT shared library ABI"
  msgstr ""
  
! #: config/c6x/c6x.opt:63 config/bfin/bfin.opt:82
! msgid "Avoid generating pc-relative calls; use indirection"
  msgstr ""
  
! #: config/c6x/c6x.opt:67 config/m68k/m68k.opt:103 config/arm/arm.opt:81
! msgid "Specify the name of the target architecture"
  msgstr ""
  
! #: config/mcore/mcore.opt:23
! msgid "Generate code for the M*Core M210"
  msgstr ""
  
! #: config/mcore/mcore.opt:27
! msgid "Generate code for the M*Core M340"
  msgstr ""
  
! #: config/mcore/mcore.opt:31
! msgid "Force functions to be aligned to a 4 byte boundary"
  msgstr ""
  
! #: config/mcore/mcore.opt:35 config/moxie/moxie.opt:23
! msgid "Generate big-endian code"
  msgstr ""
  
! #: config/mcore/mcore.opt:39
! msgid "Emit call graph information"
  msgstr ""
  
! #: config/mcore/mcore.opt:43
! msgid "Use the divide instruction"
  msgstr ""
  
! #: config/mcore/mcore.opt:47
! msgid "Inline constants if it can be done in 2 insns or less"
  msgstr ""
  
! #: config/mcore/mcore.opt:51 config/moxie/moxie.opt:27
! msgid "Generate little-endian code"
  msgstr ""
  
! #: config/mcore/mcore.opt:56 config/fr30/fr30.opt:27
  msgid ""
! "Assume that run-time support has been provided, so omit -lsim from the "
! "linker command line"
  msgstr ""
  
! #: config/mcore/mcore.opt:60
! msgid "Use arbitrary sized immediates in bit operations"
  msgstr ""
  
! #: config/mcore/mcore.opt:64
! msgid "Prefer word accesses over byte accesses"
  msgstr ""
  
! #: config/mcore/mcore.opt:71
! msgid "Set the maximum amount for a single stack increment operation"
  msgstr ""
  
! #: config/mcore/mcore.opt:75
! msgid "Always treat bitfields as int-sized"
  msgstr ""
  
! #: config/arc/arc.opt:26
! msgid "Compile code for big endian mode"
  msgstr ""
  
! #: config/arc/arc.opt:30
! msgid "Compile code for little endian mode.  This is the default"
  msgstr ""
  
! #: config/arc/arc.opt:34
  msgid ""
! "Disable ARCompact specific pass to generate conditional execution "
! "instructions"
  msgstr ""
  
! #: config/arc/arc.opt:38
! msgid "Generate ARCompact 32-bit code for ARCtangent-A5 processor"
  msgstr ""
  
! #: config/arc/arc.opt:42
! msgid "Generate ARCompact 32-bit code for ARC600 processor"
  msgstr ""
  
! #: config/arc/arc.opt:46
! msgid "Same as -mA6"
  msgstr ""
  
! #: config/arc/arc.opt:50
! msgid "Generate ARCompact 32-bit code for ARC601 processor"
  msgstr ""
  
! #: config/arc/arc.opt:54
! msgid "Generate ARCompact 32-bit code for ARC700 processor"
  msgstr ""
  
! #: config/arc/arc.opt:58
! msgid "Same as -mA7"
  msgstr ""
  
! #: config/arc/arc.opt:62
! msgid "Tweak register allocation to help 16-bit instruction generation"
  msgstr ""
  
! #: config/arc/arc.opt:72
! msgid "Use ordinarily cached memory accesses for volatile references"
  msgstr ""
  
! #: config/arc/arc.opt:76
! msgid "Enable cache bypass for volatile references"
  msgstr ""
  
! #: config/arc/arc.opt:80
! msgid "Generate instructions supported by barrel shifter"
  msgstr ""
  
! #: config/arc/arc.opt:84
! msgid "Generate norm instruction"
  msgstr ""
  
! #: config/arc/arc.opt:88
! msgid "Generate swap instruction"
  msgstr ""
  
! #: config/arc/arc.opt:92
! msgid "Generate mul64 and mulu64 instructions"
  msgstr ""
  
! #: config/arc/arc.opt:96
! msgid "Do not generate mpy instructions for ARC700"
  msgstr ""
  
! #: config/arc/arc.opt:100
  msgid ""
! "Generate Extended arithmetic instructions.  Currently only divaw, adds, subs "
! "and sat16 are supported"
  msgstr ""
  
! #: config/arc/arc.opt:104
  msgid ""
! "Dummy flag. This is the default unless FPX switches are provided explicitly"
  msgstr ""
  
! #: config/arc/arc.opt:108
! msgid "Generate call insns as register indirect calls"
  msgstr ""
  
! #: config/arc/arc.opt:112
! msgid "Do no generate BRcc instructions in arc_reorg."
  msgstr ""
  
! #: config/arc/arc.opt:116
  msgid ""
! "Generate sdata references.  This is the default, unless you compile for PIC."
  msgstr ""
  
! #: config/arc/arc.opt:120
! msgid "Do not generate millicode thunks (needed only with -Os)"
  msgstr ""
  
! #: config/arc/arc.opt:124 config/arc/arc.opt:128
! msgid "FPX: Generate Single Precision FPX (compact) instructions."
  msgstr ""
  
! #: config/arc/arc.opt:132
! msgid "FPX: Generate Single Precision FPX (fast) instructions."
  msgstr ""
  
! #: config/arc/arc.opt:136
  msgid ""
! "FPX: Enable Argonaut ARC CPU Double Precision Floating Point extensions."
  msgstr ""
  
! #: config/arc/arc.opt:140 config/arc/arc.opt:144
! msgid "FPX: Generate Double Precision FPX (compact) instructions."
  msgstr ""
  
! #: config/arc/arc.opt:148
! msgid "FPX: Generate Double Precision FPX (fast) instructions."
  msgstr ""
  
! #: config/arc/arc.opt:152
! msgid "Disable LR and SR instructions from using FPX extension aux registers."
  msgstr ""
  
! #: config/arc/arc.opt:156
  msgid ""
! "Enable generation of ARC SIMD instructions via target-specific builtins."
  msgstr ""
  
! #: config/arc/arc.opt:160
! msgid "-mcpu=CPU\tCompile code for ARC variant CPU"
  msgstr ""
  
! #: config/arc/arc.opt:179
  msgid ""
! "size optimization level: 0:none 1:opportunistic 2: regalloc 3:drop align, -Os"
  msgstr ""
  
! #: config/arc/arc.opt:183 config/sh/sh.opt:297
! msgid "Annotate assembler instructions with estimated addresses"
  msgstr ""
  
! #: config/arc/arc.opt:187
  msgid ""
! "Cost to assume for a multiply instruction, with 4 being equal to a normal "
! "insn."
  msgstr ""
  
! #: config/arc/arc.opt:191
! msgid "Tune for ARC600 cpu."
  msgstr ""
  
! #: config/arc/arc.opt:195
! msgid "Tune for ARC601 cpu."
  msgstr ""
  
! #: config/arc/arc.opt:199
! msgid "Tune for ARC700 R4.2 Cpu with standard multiplier block."
  msgstr ""
  
! #: config/arc/arc.opt:203 config/arc/arc.opt:207 config/arc/arc.opt:211
! msgid "Tune for ARC700 R4.2 Cpu with XMAC block."
  msgstr ""
  
! #: config/arc/arc.opt:215
! msgid "Enable the use of indexed loads"
  msgstr ""
  
! #: config/arc/arc.opt:219
! msgid "Enable the use of pre/post modify with register displacement."
  msgstr ""
  
! #: config/arc/arc.opt:223
! msgid "Generate 32x16 multiply and mac instructions"
  msgstr ""
  
! #: config/arc/arc.opt:229
! msgid "Set probability threshold for unaligning branches"
  msgstr ""
  
! #: config/arc/arc.opt:233
! msgid "Don't use less than 25 bit addressing range for calls."
  msgstr ""
  
! #: config/arc/arc.opt:237
  msgid ""
! "Explain what alignment considerations lead to the decision to make an insn "
! "short or long."
  msgstr ""
  
! #: config/arc/arc.opt:241
! msgid "Do alignment optimizations for call instructions."
  msgstr ""
  
! #: config/arc/arc.opt:245
  msgid ""
! "Enable Rcq constraint handling - most short code generation depends on this."
  msgstr ""
  
! #: config/arc/arc.opt:249
! msgid "Enable Rcw constraint handling - ccfsm condexec mostly depends on this."
  msgstr ""
  
! #: config/arc/arc.opt:253
! msgid "Enable pre-reload use of cbranchsi pattern"
  msgstr ""
  
! #: config/arc/arc.opt:257
! msgid "Enable bbit peephole2"
  msgstr ""
  
! #: config/arc/arc.opt:261
  msgid ""
! "Use pc-relative switch case tables - this enables case table shortening."
  msgstr ""
  
! #: config/arc/arc.opt:265
! msgid "Enable compact casesi pattern"
  msgstr ""
  
! #: config/arc/arc.opt:269
! msgid "Enable 'q' instruction alternatives."
  msgstr ""
  
! #: config/arc/arc.opt:273
! msgid "Expand adddi3 and subdi3 at rtl generation time into add.f / adc etc."
  msgstr ""
  
! #: config/arc/arc.opt:280
! msgid "Enable variable polynomial CRC extension"
  msgstr ""
  
! #: config/arc/arc.opt:284
! msgid "Enable DSP 3.1 Pack A extensions"
  msgstr ""
  
! #: config/arc/arc.opt:288
! msgid "Enable dual viterbi butterfly extension"
  msgstr ""
  
! #: config/arc/arc.opt:298
! msgid "Enable Dual and Single Operand Instructions for Telephony"
  msgstr ""
  
! #: config/arc/arc.opt:302
! msgid "Enable XY Memory extension (DSP version 3)"
  msgstr ""
  
! #: config/arc/arc.opt:307
! msgid "Enable Locked Load/Store Conditional extension"
  msgstr ""
  
! #: config/arc/arc.opt:311
! msgid "Enable swap byte ordering extension instruction"
  msgstr ""
  
! #: config/arc/arc.opt:315
! msgid "Enable 64-bit Time-Stamp Counter extension instruction"
  msgstr ""
  
! #: config/arc/arc.opt:319
! msgid "Disable generation of cfi for epilogues."
  msgstr ""
  
! #: config/arc/arc.opt:323
! msgid "Enable generation of cfi for epilogues."
  msgstr ""
  
! #: config/arc/arc.opt:327
! msgid "Pass -EB option through to linker."
  msgstr ""
  
! #: config/arc/arc.opt:331
! msgid "Pass -EL option through to linker."
  msgstr ""
  
! #: config/arc/arc.opt:335
! msgid "Pass -marclinux option through to linker."
  msgstr ""
  
! #: config/arc/arc.opt:339
! msgid "Pass -marclinux_prof option through to linker."
  msgstr ""
  
! #: config/arc/arc.opt:347
! msgid "Enable lra"
  msgstr ""
  
! #: config/arc/arc.opt:351
! msgid "Don't indicate any priority with TARGET_REGISTER_PRIORITY"
  msgstr ""
  
! #: config/arc/arc.opt:355
! msgid "Indicate priority for r0..r3 / r12..r15 with TARGET_REGISTER_PRIORITY"
  msgstr ""
  
! #: config/arc/arc.opt:359
! msgid "Reduce priority for r0..r3 / r12..r15 with TARGET_REGISTER_PRIORITY"
  msgstr ""
  
! #: config/arc/arc.opt:363
! msgid "instrument with mcount calls as in the ucb code"
  msgstr ""
  
! #: config/m68k/m68k.opt:30
! msgid "Generate code for a 520X"
  msgstr ""
  
! #: config/m68k/m68k.opt:34
! msgid "Generate code for a 5206e"
  msgstr ""
  
! #: config/m68k/m68k.opt:38
! msgid "Generate code for a 528x"
  msgstr ""
  
! #: config/m68k/m68k.opt:42
! msgid "Generate code for a 5307"
  msgstr ""
  
! #: config/m68k/m68k.opt:46
! msgid "Generate code for a 5407"
  msgstr ""
  
! #: config/m68k/m68k.opt:50 config/m68k/m68k.opt:111
! msgid "Generate code for a 68000"
  msgstr ""
  
! #: config/m68k/m68k.opt:54
! msgid "Generate code for a 68010"
  msgstr ""
  
! #: config/m68k/m68k.opt:58 config/m68k/m68k.opt:115
! msgid "Generate code for a 68020"
  msgstr ""
  
! #: config/m68k/m68k.opt:62
! msgid "Generate code for a 68040, without any new instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:66
! msgid "Generate code for a 68060, without any new instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:70
! msgid "Generate code for a 68030"
  msgstr ""
  
! #: config/m68k/m68k.opt:74
! msgid "Generate code for a 68040"
  msgstr ""
  
! #: config/m68k/m68k.opt:78
! msgid "Generate code for a 68060"
  msgstr ""
  
! #: config/m68k/m68k.opt:82
! msgid "Generate code for a 68302"
  msgstr ""
  
! #: config/m68k/m68k.opt:86
! msgid "Generate code for a 68332"
  msgstr ""
  
! #: config/m68k/m68k.opt:91
! msgid "Generate code for a 68851"
  msgstr ""
  
! #: config/m68k/m68k.opt:95
! msgid "Generate code that uses 68881 floating-point instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:99
! msgid "Align variables on a 32-bit boundary"
  msgstr ""
  
! #: config/m68k/m68k.opt:107
! msgid "Use the bit-field instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:119
! msgid "Generate code for a ColdFire v4e"
  msgstr ""
  
! #: config/m68k/m68k.opt:123
! msgid "Specify the target CPU"
  msgstr ""
  
! #: config/m68k/m68k.opt:127
! msgid "Generate code for a cpu32"
  msgstr ""
  
! #: config/m68k/m68k.opt:131
! msgid "Use hardware division instructions on ColdFire"
  msgstr ""
  
! #: config/m68k/m68k.opt:135
! msgid "Generate code for a Fido A"
  msgstr ""
  
! #: config/m68k/m68k.opt:139
! msgid "Generate code which uses hardware floating point instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:143
! msgid "Enable ID based shared library"
  msgstr ""
  
! #: config/m68k/m68k.opt:147
! msgid "Do not use the bit-field instructions"
  msgstr ""
  
! #: config/m68k/m68k.opt:151
! msgid "Use normal calling convention"
  msgstr ""
  
! #: config/m68k/m68k.opt:155
! msgid "Consider type 'int' to be 32 bits wide"
  msgstr ""
  
! #: config/m68k/m68k.opt:159
! msgid "Generate pc-relative code"
  msgstr ""
  
! #: config/m68k/m68k.opt:163
! msgid "Use different calling convention using 'rtd'"
  msgstr ""
  
! #: config/m68k/m68k.opt:167 config/bfin/bfin.opt:78
! msgid "Enable separate data segment"
  msgstr ""
  
! #: config/m68k/m68k.opt:171 config/bfin/bfin.opt:74
! msgid "ID of shared library to build"
  msgstr ""
  
! #: config/m68k/m68k.opt:175
! msgid "Consider type 'int' to be 16 bits wide"
  msgstr ""
  
! #: config/m68k/m68k.opt:179
! msgid "Generate code with library calls for floating point"
  msgstr ""
  
! #: config/m68k/m68k.opt:183
! msgid "Do not use unaligned memory references"
  msgstr ""
  
! #: config/m68k/m68k.opt:187
! msgid "Tune for the specified target CPU or architecture"
  msgstr ""
  
! #: config/m68k/m68k.opt:191
! msgid "Support more than 8192 GOT entries on ColdFire"
  msgstr ""
  
! #: config/m68k/m68k.opt:195
! msgid "Support TLS segment larger than 64K"
  msgstr ""
  
! #: config/m68k/ieee.opt:24 config/i386/i386.opt:358
! msgid "Use IEEE math for fp comparisons"
  msgstr ""
  
! #: config/m68k/m68k-tables.opt:25
! msgid "Known M68K CPUs (for use with the -mcpu= option):"
  msgstr ""
  
! #: config/m68k/m68k-tables.opt:365
! msgid "Known M68K microarchitectures (for use with the -mtune= option):"
  msgstr ""
  
! #: config/m68k/m68k-tables.opt:411
! msgid "Known M68K ISAs (for use with the -march= option):"
  msgstr ""
  
! #: config/v850/v850.opt:29
! msgid "Use registers r2 and r5"
  msgstr ""
  
! #: config/v850/v850.opt:33
! msgid "Use 4 byte entries in switch tables"
  msgstr ""
  
! #: config/v850/v850.opt:37
! msgid "Enable backend debugging"
  msgstr ""
  
! #: config/v850/v850.opt:41
! msgid "Do not use the callt instruction (default)"
  msgstr ""
  
! #: config/v850/v850.opt:45
! msgid "Reuse r30 on a per function basis"
  msgstr ""
  
! #: config/v850/v850.opt:52
! msgid "Prohibit PC relative function calls"
  msgstr ""
  
! #: config/v850/v850.opt:56
! msgid "Use stubs for function prologues"
  msgstr ""
  
! #: config/v850/v850.opt:60
! msgid "Set the max size of data eligible for the SDA area"
  msgstr ""
  
! #: config/v850/v850.opt:67
! msgid "Enable the use of the short load instructions"
  msgstr ""
  
! #: config/v850/v850.opt:71
! msgid "Same as: -mep -mprolog-function"
  msgstr ""
  
! #: config/v850/v850.opt:75
! msgid "Set the max size of data eligible for the TDA area"
  msgstr ""
  
! #: config/v850/v850.opt:82
! msgid "Do not enforce strict alignment"
  msgstr ""
  
! #: config/v850/v850.opt:86
  msgid ""
! "Put jump tables for switch statements into the .data section rather than "
! "the .code section"
  msgstr ""
  
! #: config/v850/v850.opt:93
! msgid "Compile for the v850 processor"
  msgstr ""
  
! #: config/v850/v850.opt:97
! msgid "Compile for the v850e processor"
  msgstr ""
  
! #: config/v850/v850.opt:101
! msgid "Compile for the v850e1 processor"
  msgstr ""
  
! #: config/v850/v850.opt:105
! msgid "Compile for the v850es variant of the v850e1"
  msgstr ""
  
! #: config/v850/v850.opt:109
! msgid "Compile for the v850e2 processor"
  msgstr ""
  
! #: config/v850/v850.opt:113
! msgid "Compile for the v850e2v3 processor"
  msgstr ""
  
! #: config/v850/v850.opt:117
! msgid "Compile for the v850e3v5 processor"
  msgstr ""
  
! #: config/v850/v850.opt:124
! msgid "Enable v850e3v5 loop instructions"
  msgstr ""
  
! #: config/v850/v850.opt:128
! msgid "Set the max size of data eligible for the ZDA area"
  msgstr ""
  
! #: config/v850/v850.opt:135
! msgid "Enable relaxing in the assembler"
  msgstr ""
  
! #: config/v850/v850.opt:139
! msgid "Prohibit PC relative jumps"
  msgstr ""
  
! #: config/v850/v850.opt:143
! msgid "Inhibit the use of hardware floating point instructions"
  msgstr ""
  
! #: config/v850/v850.opt:147
! msgid ""
! "Allow the use of hardware floating point instructions for V850E2V3 and up"
  msgstr ""
  
! #: config/v850/v850.opt:151
! msgid "Enable support for the RH850 ABI.  This is the default"
  msgstr ""
  
! #: config/v850/v850.opt:155
! msgid "Enable support for the old GCC ABI"
  msgstr ""
  
! #: config/v850/v850.opt:159
! msgid "Support alignments of up to 64-bits"
  msgstr ""
  
! #: config/m32r/m32r.opt:34
! msgid "Compile for the m32rx"
  msgstr ""
  
! #: config/m32r/m32r.opt:38
! msgid "Compile for the m32r2"
  msgstr ""
  
! #: config/m32r/m32r.opt:42
! msgid "Compile for the m32r"
  msgstr ""
  
! #: config/m32r/m32r.opt:46
! msgid "Align all loops to 32 byte boundary"
  msgstr ""
  
! #: config/m32r/m32r.opt:50
! msgid "Prefer branches over conditional execution"
  msgstr ""
  
! #: config/m32r/m32r.opt:54
! msgid "Give branches their default cost"
  msgstr ""
  
! #: config/m32r/m32r.opt:58
! msgid "Display compile time statistics"
  msgstr ""
  
! #: config/m32r/m32r.opt:62
! msgid "Specify cache flush function"
  msgstr ""
  
! #: config/m32r/m32r.opt:66
! msgid "Specify cache flush trap number"
  msgstr ""
  
! #: config/m32r/m32r.opt:70
! msgid "Only issue one instruction per cycle"
  msgstr ""
  
! #: config/m32r/m32r.opt:74
! msgid "Allow two instructions to be issued per cycle"
  msgstr ""
  
! #: config/m32r/m32r.opt:78
! msgid "Code size: small, medium or large"
  msgstr ""
  
! #: config/m32r/m32r.opt:94
! msgid "Don't call any cache flush functions"
  msgstr ""
  
! #: config/m32r/m32r.opt:98
! msgid "Don't call any cache flush trap"
  msgstr ""
  
! #: config/m32r/m32r.opt:105
! msgid "Small data area: none, sdata, use"
  msgstr ""
  
! #: config/arm/arm.opt:26
! msgid "TLS dialect to use:"
  msgstr ""
  
! #: config/arm/arm.opt:36
! msgid "Specify an ABI"
  msgstr ""
  
! #: config/arm/arm.opt:40
! msgid "Known ARM ABIs (for use with the -mabi= option):"
  msgstr ""
  
! #: config/arm/arm.opt:59
! msgid "Generate a call to abort if a noreturn function returns"
  msgstr ""
  
! #: config/arm/arm.opt:66
! msgid "Pass FP arguments in FP registers"
  msgstr ""
  
! #: config/arm/arm.opt:70
! msgid "Generate APCS conformant stack frames"
  msgstr ""
  
! #: config/arm/arm.opt:74
! msgid "Generate re-entrant, PIC code"
  msgstr ""
  
! #: config/arm/arm.opt:90
! msgid "Generate code in 32 bit ARM state."
  msgstr ""
  
! #: config/arm/arm.opt:98
! msgid "Thumb: Assume non-static functions may be called from ARM code"
  msgstr ""
  
! #: config/arm/arm.opt:102
! msgid "Thumb: Assume function pointers may go to non-Thumb aware code"
  msgstr ""
  
! #: config/arm/arm.opt:106 config/bfin/bfin.opt:44
! msgid "Specify the name of the target CPU"
  msgstr ""
  
! #: config/arm/arm.opt:110
! msgid "Specify if floating point hardware should be used"
  msgstr ""
  
! #: config/arm/arm.opt:114
! msgid "Known floating-point ABIs (for use with the -mfloat-abi= option):"
  msgstr ""
  
! #: config/arm/arm.opt:127
! msgid "Specify the __fp16 floating-point format"
  msgstr ""
  
! #: config/arm/arm.opt:131
! msgid "Known __fp16 formats (for use with the -mfp16-format= option):"
  msgstr ""
  
! #: config/arm/arm.opt:144
! msgid "Specify the name of the target floating point hardware/format"
  msgstr ""
  
! #: config/arm/arm.opt:155
! msgid "Generate call insns as indirect calls, if necessary"
  msgstr ""
  
! #: config/arm/arm.opt:159
! msgid "Assume data segments are relative to text segment."
  msgstr ""
  
! #: config/arm/arm.opt:163
! msgid "Specify the register to be used for PIC addressing"
  msgstr ""
  
! #: config/arm/arm.opt:167
! msgid "Store function names in object code"
  msgstr ""
  
! #: config/arm/arm.opt:171
! msgid "Permit scheduling of a function's prologue sequence"
  msgstr ""
  
! #: config/arm/arm.opt:175 config/rs6000/rs6000.opt:248
! msgid "Do not load the PIC register in function prologues"
  msgstr ""
  
! #: config/arm/arm.opt:182
! msgid "Specify the minimum bit alignment of structures"
  msgstr ""
  
! #: config/arm/arm.opt:186
! msgid "Generate code for Thumb state"
  msgstr ""
  
! #: config/arm/arm.opt:190
! msgid "Support calls between Thumb and ARM instruction sets"
  msgstr ""
  
! #: config/arm/arm.opt:194
! msgid "Specify thread local storage scheme"
  msgstr ""
  
! #: config/arm/arm.opt:198
! msgid "Specify how to access the thread pointer"
  msgstr ""
  
! #: config/arm/arm.opt:202
! msgid "Valid arguments to -mtp=:"
  msgstr ""
  
! #: config/arm/arm.opt:215
! msgid "Thumb: Generate (non-leaf) stack frames even if not needed"
  msgstr ""
  
! #: config/arm/arm.opt:219
! msgid "Thumb: Generate (leaf) stack frames even if not needed"
  msgstr ""
  
! #: config/arm/arm.opt:227
! msgid ""
! "Print CPU tuning information as comment in assembler file.  This is an "
! "option used only for regression testing of the compiler and not intended for "
! "ordinary use in compiling code."
  msgstr ""
  
! #: config/arm/arm.opt:238
! msgid ""
! "Use Neon quad-word (rather than double-word) registers for vectorization"
  msgstr ""
  
! #: config/arm/arm.opt:242
! msgid ""
! "Use Neon double-word (rather than quad-word) registers for vectorization"
  msgstr ""
  
! #: config/arm/arm.opt:246
! msgid "Only generate absolute relocations on word sized values."
  msgstr ""
  
! #: config/arm/arm.opt:250
! msgid "Generate IT blocks appropriate for ARMv8."
  msgstr ""
  
! #: config/arm/arm.opt:254
! msgid "Use the old RTX costing tables (transitional)."
  msgstr ""
  
! #: config/arm/arm.opt:258
! msgid ""
! "Use the new generic RTX cost tables if new core-specific cost table not "
! "available (transitional)."
  msgstr ""
  
! #: config/arm/arm.opt:262
! msgid ""
! "Avoid overlapping destination and address registers on LDRD instructions "
! "that may trigger Cortex-M3 errata."
  msgstr ""
  
! #: config/arm/arm.opt:267
! msgid "Enable unaligned word and halfword accesses to packed data."
  msgstr ""
  
! #: config/arm/arm.opt:271
! msgid "Use Neon to perform 64-bits operations rather than core registers."
  msgstr ""
  
! #: config/arm/arm.opt:275
! msgid "Assume loading data from flash is slower than fetching instructions."
  msgstr ""
  
! #: config/arm/arm.opt:279
! msgid "Assume unified syntax for Thumb inline assembly code."
  msgstr ""
  
! #: config/arm/arm-tables.opt:25
! msgid "Known ARM CPUs (for use with the -mcpu= and -mtune= options):"
  msgstr ""
  
! #: config/arm/arm-tables.opt:329
! msgid "Known ARM architectures (for use with the -march= option):"
  msgstr ""
  
! #: config/arm/arm-tables.opt:417
! msgid "Known ARM FPUs (for use with the -mfpu= option):"
  msgstr ""
  
! #: config/tilepro/tilepro.opt:23
! msgid ""
! "Compile with 32 bit longs and pointers, which is the only supported behavior "
! "and thus the flag is ignored."
  msgstr ""
  
! #: config/tilepro/tilepro.opt:28 config/tilegx/tilegx.opt:26
! msgid "-mcpu=CPU\tUse features of and schedule code for given CPU"
  msgstr ""
  
! #: config/tilepro/tilepro.opt:32
! msgid "Known TILEPro CPUs (for use with the -mcpu= option):"
  msgstr ""
  
! #: config/sol2.opt:32
! msgid "Clear hardware capabilities when linking"
  msgstr ""
  
! #: config/sol2.opt:36
! msgid "Pass -z text to linker"
  msgstr ""
  
! #: config/vms/vms.opt:27
! msgid "Malloc data into P2 space"
  msgstr ""
  
! #: config/vms/vms.opt:31
! msgid "Set name of main routine for the debugger"
  msgstr ""
  
! #: config/vms/vms.opt:35
! msgid "Use VMS exit codes instead of posix ones"
  msgstr ""
  
! #: config/vms/vms.opt:39
! msgid "-mpointer-size=[no,32,short,64,long]\tSet the default pointer size"
  msgstr ""
  
! #: config/vms/vms.opt:42
! #, c-format
! msgid "unknown pointer size model %qs"
  msgstr ""
  
! #: config/avr/avr.opt:23
! msgid "Use subroutines for function prologues and epilogues"
  msgstr ""
  
! #: config/avr/avr.opt:26
! #, c-format
! msgid "missing device or architecture after %qs"
  msgstr ""
  
! #: config/avr/avr.opt:27
! msgid "-mmcu=MCU\tSelect the target MCU"
  msgstr ""
  
! #: config/avr/avr.opt:31
! msgid "Set the number of 64 KiB flash segments"
  msgstr ""
  
! #: config/avr/avr.opt:35
! msgid "Indicate presence of a processor erratum"
  msgstr ""
  
! #: config/avr/avr.opt:39
! msgid "Enable Read-Modify-Write (RMW) instructions support/use"
  msgstr ""
  
! #: config/avr/avr.opt:49
! msgid "Use an 8-bit 'int' type"
  msgstr ""
  
! #: config/avr/avr.opt:53
! msgid "Change the stack pointer without disabling interrupts"
  msgstr ""
  
! #: config/avr/avr.opt:57
! msgid ""
! "Set the branch costs for conditional branch instructions.  Reasonable values "
! "are small, non-negative integers.  The default branch cost is 0."
  msgstr ""
  
! #: config/avr/avr.opt:67
! msgid "Change only the low 8 bits of the stack pointer"
  msgstr ""
  
! #: config/avr/avr.opt:71
! msgid "Relax branches"
  msgstr ""
  
! #: config/avr/avr.opt:75
! msgid ""
! "Make the linker relaxation machine assume that a program counter wrap-around "
! "occurs."
  msgstr ""
  
! #: config/avr/avr.opt:79
! msgid ""
! "Accumulate outgoing function arguments and acquire/release the needed stack "
! "space for outpoing function arguments in function prologue/epilogue.  "
! "Without this option, outgoing arguments are pushed before calling a function "
! "and popped afterwards.  This option can lead to reduced code size for "
! "functions that call many functions that get their arguments on the stack "
! "like, for example printf."
  msgstr ""
  
! #: config/avr/avr.opt:83
! msgid ""
! "When accessing RAM, use X as imposed by the hardware, i.e. just use pre-"
! "decrement, post-increment and indirect addressing with the X register.  "
! "Without this option, the compiler may assume that there is an addressing "
! "mode X+const similar to Y+const and Z+const and emit instructions to emulate "
! "such an addressing mode for X."
  msgstr ""
  
! #: config/avr/avr.opt:88
! msgid ""
! "The device has no SPH special function register. This option will be "
! "overridden by the compiler driver with the correct setting if presence/"
! "absence of SPH can be deduced from -mmcu=MCU."
  msgstr ""
  
! #: config/avr/avr.opt:92
! msgid "Warn if the address space of an address is changed."
  msgstr ""
  
! #: config/avr/avr.opt:96
! msgid ""
! "Allow to use truncation instead of rounding towards 0 for fractional int "
! "types"
  msgstr ""
  
! #: config/avr/avr.opt:100
! msgid "Do not link against the device-specific library lib<MCU>.a"
  msgstr ""
  
! #: config/s390/tpf.opt:23
! msgid "Enable TPF-OS tracing code"
  msgstr ""
  
! #: config/s390/tpf.opt:27
! msgid "Specify main object for TPF-OS"
  msgstr ""
  
! #: config/s390/s390.opt:39
! msgid "31 bit ABI"
  msgstr ""
  
! #: config/s390/s390.opt:43
! msgid "64 bit ABI"
  msgstr ""
  
! #: config/s390/s390.opt:84
! msgid "Maintain backchain pointer"
  msgstr ""
  
! #: config/s390/s390.opt:88
! msgid "Additional debug prints"
  msgstr ""
  
! #: config/s390/s390.opt:92
! msgid "ESA/390 architecture"
  msgstr ""
  
! #: config/s390/s390.opt:96
! msgid "Enable decimal floating point hardware support"
  msgstr ""
  
! #: config/s390/s390.opt:100
! msgid "Enable hardware floating point"
  msgstr ""
  
! #: config/s390/s390.opt:104
! msgid ""
! "Takes two non-negative integer numbers separated by a comma. Prepend the "
! "function label with the number of two-byte Nop instructions indicated by the "
! "first.  Append Nop instructions covering the number of halfwords indicated "
! "by the second after the label.  Nop instructions of the largest possible "
! "size are used (six, four or two bytes), beginning with the largest possible "
! "size.  Using 0 for both values disables hotpatching."
  msgstr ""
  
! #: config/s390/s390.opt:122
! msgid "Use hardware transactional execution instructions"
  msgstr ""
  
! #: config/s390/s390.opt:126
! msgid "Use hardware vector facility instructions and enable the vector ABI"
  msgstr ""
  
! #: config/s390/s390.opt:130
! msgid "Use packed stack layout"
  msgstr ""
  
! #: config/s390/s390.opt:134
! msgid "Use bras for executable < 64k"
  msgstr ""
  
! #: config/s390/s390.opt:138
! msgid "Disable hardware floating point"
  msgstr ""
  
! #: config/s390/s390.opt:142
! msgid ""
! "Set the max. number of bytes which has to be left to stack size before a "
! "trap instruction is triggered"
  msgstr ""
  
! #: config/s390/s390.opt:146
! msgid ""
! "Emit extra code in the function prologue in order to trap if the stack size "
! "exceeds the given limit"
  msgstr ""
  
! #: config/s390/s390.opt:154
! msgid "mvcle use"
  msgstr ""
  
! #: config/s390/s390.opt:158
! msgid ""
! "Enable the z vector language extension providing the context-sensitive "
! "vector macro."
  msgstr ""
  
! #: config/s390/s390.opt:162
! msgid "Warn if a function uses alloca or creates an array with dynamic size"
  msgstr ""
  
! #: config/s390/s390.opt:166
! msgid "Warn if a single function's framesize exceeds the given framesize"
  msgstr ""
  
! #: config/s390/s390.opt:170
! msgid "z/Architecture"
  msgstr ""
  
! #: config/s390/s390.opt:174
  msgid ""
! "Set the branch costs for conditional branch instructions.  Reasonable values "
! "are small, non-negative integers.  The default branch cost is 1."
  msgstr ""
  
! #: config/darwin.opt:53 common.opt:316 common.opt:319 common.opt:2704
! #: c-family/c.opt:70 c-family/c.opt:73 c-family/c.opt:76 c-family/c.opt:79
! #: c-family/c.opt:175 c-family/c.opt:178 c-family/c.opt:216 c-family/c.opt:220
! #: c-family/c.opt:232 c-family/c.opt:1497 c-family/c.opt:1505
! #, c-format
! msgid "missing filename after %qs"
  msgstr ""
  
! #: config/darwin.opt:114
! msgid "Generate compile-time CFString objects"
  msgstr ""
  
! #: config/darwin.opt:208
! msgid "Warn if constant CFString objects contain non-portable characters"
  msgstr ""
  
! #: config/darwin.opt:213
! msgid "Generate AT&T-style stubs for Mach-O"
  msgstr ""
  
! #: config/darwin.opt:217
! msgid "Generate code suitable for executables (NOT shared libs)"
  msgstr ""
  
! #: config/darwin.opt:221
! msgid "Generate code suitable for fast turn around debugging"
  msgstr ""
  
! #: config/darwin.opt:230
! msgid "The earliest MacOS X version on which this program will run"
  msgstr ""
  
! #: config/darwin.opt:234
! msgid "Set sizeof(bool) to 1"
  msgstr ""
  
! #: config/darwin.opt:238
! msgid "Generate code for darwin loadable kernel extensions"
  msgstr ""
  
! #: config/darwin.opt:242
! msgid "Generate code for the kernel or loadable kernel extensions"
  msgstr ""
  
! #: config/darwin.opt:246
  msgid ""
! "-iframework <dir>\tAdd <dir> to the end of the system framework include path"
  msgstr ""
  
! #: config/sh/superh.opt:6
! msgid "Board name [and memory region]."
  msgstr ""
  
! #: config/sh/superh.opt:10
! msgid "Runtime name."
  msgstr ""
  
! #: config/sh/sh.opt:48
! msgid "Generate SH1 code"
  msgstr ""
  
! #: config/sh/sh.opt:52
! msgid "Generate SH2 code"
  msgstr ""
  
! #: config/sh/sh.opt:56
! msgid "Generate default double-precision SH2a-FPU code"
  msgstr ""
  
! #: config/sh/sh.opt:60
! msgid "Generate SH2a FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:64
! msgid "Generate default single-precision SH2a-FPU code"
  msgstr ""
  
! #: config/sh/sh.opt:68
! msgid "Generate only single-precision SH2a-FPU code"
  msgstr ""
  
! #: config/sh/sh.opt:72
! msgid "Generate SH2e code"
  msgstr ""
  
! #: config/sh/sh.opt:76
! msgid "Generate SH3 code"
  msgstr ""
  
! #: config/sh/sh.opt:80
! msgid "Generate SH3e code"
  msgstr ""
  
! #: config/sh/sh.opt:84
! msgid "Generate SH4 code"
  msgstr ""
  
! #: config/sh/sh.opt:88
! msgid "Generate SH4-100 code"
  msgstr ""
  
! #: config/sh/sh.opt:92
! msgid "Generate SH4-200 code"
  msgstr ""
  
! #: config/sh/sh.opt:98
! msgid "Generate SH4-300 code"
  msgstr ""
  
! #: config/sh/sh.opt:102
! msgid "Generate SH4 FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:106
! msgid "Generate SH4-100 FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:110
! msgid "Generate SH4-200 FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:114
! msgid "Generate SH4-300 FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:118
! msgid "Generate code for SH4 340 series (MMU/FPU-less)"
  msgstr ""
  
! #: config/sh/sh.opt:123
! msgid "Generate code for SH4 400 series (MMU/FPU-less)"
  msgstr ""
  
! #: config/sh/sh.opt:128
! msgid "Generate code for SH4 500 series (FPU-less)."
  msgstr ""
  
! #: config/sh/sh.opt:133
! msgid "Generate default single-precision SH4 code"
  msgstr ""
  
! #: config/sh/sh.opt:137
! msgid "Generate default single-precision SH4-100 code"
  msgstr ""
  
! #: config/sh/sh.opt:141
! msgid "Generate default single-precision SH4-200 code"
  msgstr ""
  
! #: config/sh/sh.opt:145
! msgid "Generate default single-precision SH4-300 code"
  msgstr ""
  
! #: config/sh/sh.opt:149
! msgid "Generate only single-precision SH4 code"
  msgstr ""
  
! #: config/sh/sh.opt:153
! msgid "Generate only single-precision SH4-100 code"
  msgstr ""
  
! #: config/sh/sh.opt:157
! msgid "Generate only single-precision SH4-200 code"
  msgstr ""
  
! #: config/sh/sh.opt:161
! msgid "Generate only single-precision SH4-300 code"
  msgstr ""
  
! #: config/sh/sh.opt:165
! msgid "Generate SH4a code"
  msgstr ""
  
! #: config/sh/sh.opt:169
! msgid "Generate SH4a FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:173
! msgid "Generate default single-precision SH4a code"
  msgstr ""
  
! #: config/sh/sh.opt:177
! msgid "Generate only single-precision SH4a code"
  msgstr ""
  
! #: config/sh/sh.opt:181
! msgid "Generate SH4al-dsp code"
  msgstr ""
  
! #: config/sh/sh.opt:185
! msgid "Generate 32-bit SHmedia code"
  msgstr ""
  
! #: config/sh/sh.opt:189
! msgid "Generate 32-bit FPU-less SHmedia code"
  msgstr ""
  
! #: config/sh/sh.opt:193
! msgid "Generate 64-bit SHmedia code"
  msgstr ""
  
! #: config/sh/sh.opt:197
! msgid "Generate 64-bit FPU-less SHmedia code"
  msgstr ""
  
! #: config/sh/sh.opt:201
! msgid "Generate SHcompact code"
  msgstr ""
  
! #: config/sh/sh.opt:205
! msgid "Generate FPU-less SHcompact code"
  msgstr ""
  
! #: config/sh/sh.opt:209 config/i386/i386.opt:206
! msgid "Reserve space for outgoing arguments in the function prologue"
  msgstr ""
  
! #: config/sh/sh.opt:213 config/pa/pa.opt:42 config/pa/pa.opt:66 common.opt:1026
! #: common.opt:1249 common.opt:1577 common.opt:1903 common.opt:1939
! #: common.opt:2028 common.opt:2032 common.opt:2124 common.opt:2206
! #: common.opt:2230 common.opt:2331 common.opt:2449 c-family/c.opt:1064
! #: c-family/c.opt:1088 c-family/c.opt:1314 fortran/lang.opt:679
! msgid "Does nothing.  Preserved for backward compatibility."
  msgstr ""
  
! #: config/sh/sh.opt:217
! msgid "Generate code in big endian mode"
  msgstr ""
  
! #: config/sh/sh.opt:221
! msgid "Generate 32-bit offsets in switch tables"
  msgstr ""
  
! #: config/sh/sh.opt:225
! msgid "Generate bit instructions"
  msgstr ""
  
! #: config/sh/sh.opt:229
! msgid "Cost to assume for a branch insn"
  msgstr ""
  
! #: config/sh/sh.opt:233
! msgid "Assume that zero displacement conditional branches are fast"
  msgstr ""
  
! #: config/sh/sh.opt:236 config/sh/sh.opt:240
! #, c-format
! msgid "%qs is deprecated and has no effect"
  msgstr ""
  
! #: config/sh/sh.opt:237
! msgid "Enable cbranchdi4 pattern"
  msgstr ""
  
! #: config/sh/sh.opt:241
! msgid "Emit cmpeqdi_t pattern even when -mcbranchdi is in effect."
  msgstr ""
  
! #: config/sh/sh.opt:245
! msgid "Force the usage of delay slots for conditional branches."
  msgstr ""
  
! #: config/sh/sh.opt:249
! msgid "Enable SH5 cut2 workaround"
  msgstr ""
  
! #: config/sh/sh.opt:253
! msgid "Align doubles at 64-bit boundaries"
  msgstr ""
  
! #: config/sh/sh.opt:257
! msgid ""
! "Division strategy, one of: call, call2, fp, inv, inv:minlat, inv20u, inv20l, "
! "inv:call, inv:call2, inv:fp, call-div1, call-fp, call-table"
  msgstr ""
  
! #: config/sh/sh.opt:261
! msgid "Specify name for 32 bit signed division function"
  msgstr ""
  
! #: config/sh/sh.opt:265
! msgid ""
! "Enable the use of 64-bit floating point registers in fmov instructions.  See "
! "-mdalign if 64-bit alignment is required."
  msgstr ""
  
! #: config/sh/sh.opt:273
! msgid "Cost to assume for gettr insn"
  msgstr ""
  
! #: config/sh/sh.opt:277 config/sh/sh.opt:327
! msgid "Follow Renesas (formerly Hitachi) / SuperH calling conventions"
  msgstr ""
  
! #: config/sh/sh.opt:281
! msgid "Increase the IEEE compliance for floating-point comparisons"
  msgstr ""
  
! #: config/sh/sh.opt:285
! msgid "Enable the use of the indexed addressing mode for SHmedia32/SHcompact"
  msgstr ""
  
! #: config/sh/sh.opt:289
! msgid ""
! "inline code to invalidate instruction cache entries after setting up nested "
! "function trampolines"
  msgstr ""
  
! #: config/sh/sh.opt:293
! msgid "Assume symbols might be invalid"
  msgstr ""
  
! #: config/sh/sh.opt:301
! msgid "Generate code in little endian mode"
  msgstr ""
  
! #: config/sh/sh.opt:305
! msgid "Mark MAC register as call-clobbered"
  msgstr ""
  
! #: config/sh/sh.opt:311
! msgid "Make structs a multiple of 4 bytes (warning: ABI altered)"
  msgstr ""
  
! #: config/sh/sh.opt:315
! msgid "Emit function-calls using global offset table when generating PIC"
  msgstr ""
  
! #: config/sh/sh.opt:319
! msgid "Assume pt* instructions won't trap"
  msgstr ""
  
! #: config/sh/sh.opt:323
! msgid "Shorten address references during linking"
  msgstr ""
  
! #: config/sh/sh.opt:331
! msgid "Deprecated.  Use -matomic= instead to select the atomic model"
  msgstr ""
  
! #: config/sh/sh.opt:335
! msgid "Specify the model for atomic operations"
  msgstr ""
  
! #: config/sh/sh.opt:339
! msgid "Use tas.b instruction for __atomic_test_and_set"
  msgstr ""
  
! #: config/sh/sh.opt:343
! msgid "Deprecated.  Use -Os instead"
  msgstr ""
  
! #: config/sh/sh.opt:347
! msgid "Cost to assume for a multiply insn"
  msgstr ""
  
! #: config/sh/sh.opt:351
  msgid ""
! "Don't generate privileged-mode only code; implies -mno-inline-ic_invalidate "
! "if the inline code would not work in user mode."
  msgstr ""
  
! #: config/sh/sh.opt:357
! msgid "Pretend a branch-around-a-move is a conditional move."
  msgstr ""
  
! #: config/sh/sh.opt:361
! msgid "Enable the use of the fsca instruction"
  msgstr ""
  
! #: config/sh/sh.opt:365
! msgid "Enable the use of the fsrra instruction"
  msgstr ""
  
! #: config/sh/sh.opt:369
! msgid "Use LRA instead of reload (transitional)"
  msgstr ""
  
  #: config/i386/i386.opt:182
*************** msgstr ""
*** 8573,8592 ****
  msgid "Use 80-bit long double"
  msgstr ""
  
- #: config/i386/i386.opt:198 config/s390/s390.opt:115
- #: config/sparc/long-double-switch.opt:27 config/alpha/alpha.opt:102
- msgid "Use 64-bit long double"
- msgstr ""
- 
- #: config/i386/i386.opt:202 config/s390/s390.opt:111
- #: config/sparc/long-double-switch.opt:23 config/alpha/alpha.opt:98
- msgid "Use 128-bit long double"
- msgstr ""
- 
- #: config/i386/i386.opt:206 config/sh/sh.opt:209
- msgid "Reserve space for outgoing arguments in the function prologue"
- msgstr ""
- 
  #: config/i386/i386.opt:210
  msgid "Align some doubles on dword boundary"
  msgstr ""
--- 7943,7948 ----
*************** msgstr ""
*** 8637,8644 ****
  msgid "Use given x86-64 code model"
  msgstr ""
  
! #: config/i386/i386.opt:277 config/rs6000/aix64.opt:36
! #: config/rs6000/linux64.opt:32 config/tilegx/tilegx.opt:57
  msgid "Known code models (for use with the -mcmodel= option):"
  msgstr ""
  
--- 7993,8000 ----
  msgid "Use given x86-64 code model"
  msgstr ""
  
! #: config/i386/i386.opt:277 config/tilegx/tilegx.opt:57
! #: config/rs6000/aix64.opt:36 config/rs6000/linux64.opt:32
  msgid "Known code models (for use with the -mcmodel= option):"
  msgstr ""
  
*************** msgid ""
*** 8690,8695 ****
--- 8046,8055 ----
  "masm=intel%> and %<-masm=att%> instead"
  msgstr ""
  
+ #: config/i386/i386.opt:390 config/aarch64/aarch64.opt:92
+ msgid "Omit the frame pointer in leaf functions"
+ msgstr ""
+ 
  #: config/i386/i386.opt:394
  msgid "Set 80387 floating-point precision to 32-bit"
  msgstr ""
*************** msgstr ""
*** 8726,8735 ****
  msgid "Alternate calling convention"
  msgstr ""
  
- #: config/i386/i386.opt:430 config/alpha/alpha.opt:23
- msgid "Do not use hardware fp"
- msgstr ""
- 
  #: config/i386/i386.opt:434
  msgid "Use SSE register passing conventions for SF and DF mode"
  msgstr ""
--- 8086,8091 ----
*************** msgstr ""
*** 8814,8826 ****
  
  #: config/i386/i386.opt:563
  msgid ""
! "Generate vzeroupper instruction before a transfer of control flow out of"
  msgstr ""
  
  #: config/i386/i386.opt:568
  msgid ""
  "Do dispatch scheduling if processor is bdver1 or bdver2 or bdver3 or bdver4 "
! "and Haifa scheduling"
  msgstr ""
  
  #: config/i386/i386.opt:573
--- 8170,8183 ----
  
  #: config/i386/i386.opt:563
  msgid ""
! "Generate vzeroupper instruction before a transfer of control flow out of the "
! "function."
  msgstr ""
  
  #: config/i386/i386.opt:568
  msgid ""
  "Do dispatch scheduling if processor is bdver1 or bdver2 or bdver3 or bdver4 "
! "and Haifa scheduling is selected."
  msgstr ""
  
  #: config/i386/i386.opt:573
*************** msgstr ""
*** 9028,9035 ****
  msgid "Support CLWB instruction"
  msgstr ""
  
! #: config/i386/i386.opt:751
! msgid "Support PCOMMIT instruction"
  msgstr ""
  
  #: config/i386/i386.opt:755
--- 8385,8392 ----
  msgid "Support CLWB instruction"
  msgstr ""
  
! #: config/i386/i386.opt:750
! msgid "%<-mpcommit%> was deprecated"
  msgstr ""
  
  #: config/i386/i386.opt:755
*************** msgid "Generate __mcount_loc section wit
*** 9113,9119 ****
  msgstr ""
  
  #: config/i386/i386.opt:835
! msgid "Generate mcount/__fentry__ calls as nops. To activate they need to be"
  msgstr ""
  
  #: config/i386/i386.opt:840
--- 8470,8478 ----
  msgstr ""
  
  #: config/i386/i386.opt:835
! msgid ""
! "Generate mcount/__fentry__ calls as nops. To activate they need to be "
! "patched in."
  msgstr ""
  
  #: config/i386/i386.opt:840
*************** msgid ""
*** 9156,9908 ****
  "option):"
  msgstr ""
  
! #: config/i386/stringop.opt:8
! msgid "the Free Software Foundation; either version 3, or (at your option)"
! msgstr ""
! 
! #: config/i386/stringop.opt:13
! msgid "MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the"
! msgstr ""
! 
! #: config/i386/stringop.opt:18
! msgid "see <http://www.gnu.org/licenses/>.  */"
! msgstr ""
! 
! #: config/pa/pa64-hpux.opt:23
! msgid "Assume code will be linked by GNU ld"
! msgstr ""
! 
! #: config/pa/pa64-hpux.opt:27
! msgid "Assume code will be linked by HP ld"
! msgstr ""
! 
! #: config/pa/pa-hpux1010.opt:23 config/pa/pa-hpux.opt:31
! #: config/pa/pa-hpux1131.opt:23 config/pa/pa-hpux1111.opt:23
! msgid "Specify UNIX standard for predefines and linking"
! msgstr ""
! 
! #: config/pa/pa-hpux.opt:27
! msgid "Generate cpp defines for server IO"
! msgstr ""
! 
! #: config/pa/pa-hpux.opt:35
! msgid "Generate cpp defines for workstation IO"
! msgstr ""
! 
! #: config/pa/pa.opt:30 config/pa/pa.opt:83 config/pa/pa.opt:91
! msgid "Generate PA1.0 code"
! msgstr ""
! 
! #: config/pa/pa.opt:34 config/pa/pa.opt:95 config/pa/pa.opt:136
! msgid "Generate PA1.1 code"
! msgstr ""
! 
! #: config/pa/pa.opt:38 config/pa/pa.opt:99
! msgid "Generate PA2.0 code (requires binutils 2.10 or later)"
! msgstr ""
! 
! #: config/pa/pa.opt:46
! msgid "Disable FP regs"
! msgstr ""
! 
! #: config/pa/pa.opt:50
! msgid "Disable indexed addressing"
! msgstr ""
! 
! #: config/pa/pa.opt:54
! msgid "Generate fast indirect calls"
! msgstr ""
! 
! #: config/pa/pa.opt:62
! msgid "Assume code will be assembled by GAS"
! msgstr ""
! 
! #: config/pa/pa.opt:71
! msgid "Enable linker optimizations"
! msgstr ""
! 
! #: config/pa/pa.opt:75
! msgid "Always generate long calls"
! msgstr ""
! 
! #: config/pa/pa.opt:79
! msgid "Emit long load/store sequences"
! msgstr ""
! 
! #: config/pa/pa.opt:87
! msgid "Disable space regs"
! msgstr ""
! 
! #: config/pa/pa.opt:103
! msgid "Use portable calling conventions"
! msgstr ""
! 
! #: config/pa/pa.opt:107
! msgid ""
! "Specify CPU for scheduling purposes.  Valid arguments are 700, 7100, 7100LC, "
! "7200, 7300, and 8000"
! msgstr ""
! 
! #: config/pa/pa.opt:132 config/frv/frv.opt:215
! msgid "Use software floating point"
! msgstr ""
! 
! #: config/pa/pa.opt:140
! msgid "Do not disable space regs"
! msgstr ""
! 
! #: config/v850/v850.opt:29
! msgid "Use registers r2 and r5"
! msgstr ""
! 
! #: config/v850/v850.opt:33
! msgid "Use 4 byte entries in switch tables"
! msgstr ""
! 
! #: config/v850/v850.opt:37
! msgid "Enable backend debugging"
! msgstr ""
! 
! #: config/v850/v850.opt:41
! msgid "Do not use the callt instruction (default)"
! msgstr ""
! 
! #: config/v850/v850.opt:45
! msgid "Reuse r30 on a per function basis"
! msgstr ""
! 
! #: config/v850/v850.opt:52
! msgid "Prohibit PC relative function calls"
! msgstr ""
! 
! #: config/v850/v850.opt:56
! msgid "Use stubs for function prologues"
! msgstr ""
! 
! #: config/v850/v850.opt:60
! msgid "Set the max size of data eligible for the SDA area"
! msgstr ""
! 
! #: config/v850/v850.opt:67
! msgid "Enable the use of the short load instructions"
! msgstr ""
! 
! #: config/v850/v850.opt:71
! msgid "Same as: -mep -mprolog-function"
! msgstr ""
! 
! #: config/v850/v850.opt:75
! msgid "Set the max size of data eligible for the TDA area"
! msgstr ""
! 
! #: config/v850/v850.opt:82
! msgid "Do not enforce strict alignment"
! msgstr ""
! 
! #: config/v850/v850.opt:86
! msgid ""
! "Put jump tables for switch statements into the .data section rather than "
! "the .code section"
! msgstr ""
! 
! #: config/v850/v850.opt:93
! msgid "Compile for the v850 processor"
! msgstr ""
! 
! #: config/v850/v850.opt:97
! msgid "Compile for the v850e processor"
! msgstr ""
! 
! #: config/v850/v850.opt:101
! msgid "Compile for the v850e1 processor"
! msgstr ""
! 
! #: config/v850/v850.opt:105
! msgid "Compile for the v850es variant of the v850e1"
! msgstr ""
! 
! #: config/v850/v850.opt:109
! msgid "Compile for the v850e2 processor"
! msgstr ""
! 
! #: config/v850/v850.opt:113
! msgid "Compile for the v850e2v3 processor"
! msgstr ""
! 
! #: config/v850/v850.opt:117
! msgid "Compile for the v850e3v5 processor"
! msgstr ""
! 
! #: config/v850/v850.opt:124
! msgid "Enable v850e3v5 loop instructions"
! msgstr ""
! 
! #: config/v850/v850.opt:128
! msgid "Set the max size of data eligible for the ZDA area"
! msgstr ""
! 
! #: config/v850/v850.opt:135
! msgid "Enable relaxing in the assembler"
! msgstr ""
! 
! #: config/v850/v850.opt:139
! msgid "Prohibit PC relative jumps"
! msgstr ""
! 
! #: config/v850/v850.opt:143
! msgid "Inhibit the use of hardware floating point instructions"
! msgstr ""
! 
! #: config/v850/v850.opt:147
! msgid ""
! "Allow the use of hardware floating point instructions for V850E2V3 and up"
! msgstr ""
! 
! #: config/v850/v850.opt:151
! msgid "Enable support for the RH850 ABI.  This is the default"
! msgstr ""
! 
! #: config/v850/v850.opt:155
! msgid "Enable support for the old GCC ABI"
! msgstr ""
! 
! #: config/v850/v850.opt:159
! msgid "Support alignments of up to 64-bits"
! msgstr ""
! 
! #: config/g.opt:27
! msgid ""
! "-G<number>\tPut global and static data smaller than <number> bytes into a "
! "special section (on some targets)"
! msgstr ""
! 
! #: config/lynx.opt:23
! msgid "Support legacy multi-threading"
! msgstr ""
! 
! #: config/lynx.opt:27
! msgid "Use shared libraries"
! msgstr ""
! 
! #: config/lynx.opt:31
! msgid "Support multi-threading"
! msgstr ""
! 
! #: config/nvptx/nvptx.opt:22
! msgid "Generate code for a 32-bit ABI"
! msgstr ""
! 
! #: config/nvptx/nvptx.opt:26
! msgid "Generate code for a 64-bit ABI"
! msgstr ""
! 
! #: config/nvptx/nvptx.opt:30
! msgid "Link in code for a __main kernel."
! msgstr ""
! 
! #: config/vxworks.opt:36
! msgid "Assume the VxWorks RTP environment"
! msgstr ""
! 
! #: config/vxworks.opt:43
! msgid "Assume the VxWorks vThreads environment"
! msgstr ""
! 
! #: config/cr16/cr16.opt:23
! msgid "-msim   Use simulator runtime"
! msgstr ""
! 
! #: config/cr16/cr16.opt:27
! msgid "Generate SBIT, CBIT instructions"
! msgstr ""
! 
! #: config/cr16/cr16.opt:31
! msgid "Support multiply accumulate instructions"
! msgstr ""
! 
! #: config/cr16/cr16.opt:38
! msgid "Treat data references as near, far or medium. medium is default"
! msgstr ""
! 
! #: config/cr16/cr16.opt:42
! msgid "Generate code for CR16C architecture"
! msgstr ""
! 
! #: config/cr16/cr16.opt:46
! msgid "Generate code for CR16C+ architecture (Default)"
! msgstr ""
! 
! #: config/cr16/cr16.opt:50
! msgid "Treat integers as 32-bit."
! msgstr ""
! 
! #: config/avr/avr.opt:23
! msgid "Use subroutines for function prologues and epilogues"
! msgstr ""
! 
! #: config/avr/avr.opt:26
! #, c-format
! msgid "missing device or architecture after %qs"
! msgstr ""
! 
! #: config/avr/avr.opt:27
! msgid "-mmcu=MCU\tSelect the target MCU"
! msgstr ""
! 
! #: config/avr/avr.opt:31
! msgid "Set the number of 64 KiB flash segments"
! msgstr ""
! 
! #: config/avr/avr.opt:35
! msgid "Indicate presence of a processor erratum"
! msgstr ""
! 
! #: config/avr/avr.opt:39
! msgid "Enable Read-Modify-Write (RMW) instructions support/use"
! msgstr ""
! 
! #: config/avr/avr.opt:49
! msgid "Use an 8-bit 'int' type"
! msgstr ""
! 
! #: config/avr/avr.opt:53
! msgid "Change the stack pointer without disabling interrupts"
! msgstr ""
! 
! #: config/avr/avr.opt:57
! msgid ""
! "Set the branch costs for conditional branch instructions.  Reasonable values "
! "are small, non-negative integers.  The default branch cost is 0."
! msgstr ""
! 
! #: config/avr/avr.opt:67
! msgid "Change only the low 8 bits of the stack pointer"
! msgstr ""
! 
! #: config/avr/avr.opt:71
! msgid "Relax branches"
! msgstr ""
! 
! #: config/avr/avr.opt:75
! msgid ""
! "Make the linker relaxation machine assume that a program counter wrap-around "
! "occurs."
! msgstr ""
! 
! #: config/avr/avr.opt:79
! msgid ""
! "Accumulate outgoing function arguments and acquire/release the needed stack "
! "space for outpoing function arguments in function prologue/epilogue.  "
! "Without this option, outgoing arguments are pushed before calling a function "
! "and popped afterwards.  This option can lead to reduced code size for "
! "functions that call many functions that get their arguments on the stack "
! "like, for example printf."
! msgstr ""
! 
! #: config/avr/avr.opt:83
! msgid ""
! "When accessing RAM, use X as imposed by the hardware, i.e. just use pre-"
! "decrement, post-increment and indirect addressing with the X register.  "
! "Without this option, the compiler may assume that there is an addressing "
! "mode X+const similar to Y+const and Z+const and emit instructions to emulate "
! "such an addressing mode for X."
! msgstr ""
! 
! #: config/avr/avr.opt:88
! msgid ""
! "The device has no SPH special function register. This option will be "
! "overridden by the compiler driver with the correct setting if presence/"
! "absence of SPH can be deduced from -mmcu=MCU."
! msgstr ""
! 
! #: config/avr/avr.opt:92
! msgid "Warn if the address space of an address is changed."
! msgstr ""
! 
! #: config/avr/avr.opt:96
! msgid ""
! "Allow to use truncation instead of rounding towards 0 for fractional int "
! "types"
! msgstr ""
! 
! #: config/avr/avr.opt:100
! msgid "Do not link against the device-specific library lib<MCU>.a"
! msgstr ""
! 
! #: config/m32r/m32r.opt:34
! msgid "Compile for the m32rx"
! msgstr ""
! 
! #: config/m32r/m32r.opt:38
! msgid "Compile for the m32r2"
! msgstr ""
! 
! #: config/m32r/m32r.opt:42
! msgid "Compile for the m32r"
! msgstr ""
! 
! #: config/m32r/m32r.opt:46
! msgid "Align all loops to 32 byte boundary"
! msgstr ""
! 
! #: config/m32r/m32r.opt:50
! msgid "Prefer branches over conditional execution"
! msgstr ""
! 
! #: config/m32r/m32r.opt:54
! msgid "Give branches their default cost"
! msgstr ""
! 
! #: config/m32r/m32r.opt:58
! msgid "Display compile time statistics"
! msgstr ""
! 
! #: config/m32r/m32r.opt:62
! msgid "Specify cache flush function"
! msgstr ""
! 
! #: config/m32r/m32r.opt:66
! msgid "Specify cache flush trap number"
! msgstr ""
! 
! #: config/m32r/m32r.opt:70
! msgid "Only issue one instruction per cycle"
! msgstr ""
! 
! #: config/m32r/m32r.opt:74
! msgid "Allow two instructions to be issued per cycle"
! msgstr ""
! 
! #: config/m32r/m32r.opt:78
! msgid "Code size: small, medium or large"
! msgstr ""
! 
! #: config/m32r/m32r.opt:94
! msgid "Don't call any cache flush functions"
! msgstr ""
! 
! #: config/m32r/m32r.opt:98
! msgid "Don't call any cache flush trap"
! msgstr ""
! 
! #: config/m32r/m32r.opt:105
! msgid "Small data area: none, sdata, use"
! msgstr ""
! 
! #: config/s390/tpf.opt:23
! msgid "Enable TPF-OS tracing code"
! msgstr ""
! 
! #: config/s390/tpf.opt:27
! msgid "Specify main object for TPF-OS"
! msgstr ""
! 
! #: config/s390/s390.opt:39
! msgid "31 bit ABI"
! msgstr ""
! 
! #: config/s390/s390.opt:43
! msgid "64 bit ABI"
! msgstr ""
! 
! #: config/s390/s390.opt:81
! msgid "Maintain backchain pointer"
! msgstr ""
! 
! #: config/s390/s390.opt:85
! msgid "Additional debug prints"
! msgstr ""
! 
! #: config/s390/s390.opt:89
! msgid "ESA/390 architecture"
! msgstr ""
! 
! #: config/s390/s390.opt:93
! msgid "Enable decimal floating point hardware support"
! msgstr ""
! 
! #: config/s390/s390.opt:97
! msgid "Enable hardware floating point"
! msgstr ""
! 
! #: config/s390/s390.opt:101
! msgid "Takes two non-negative integer numbers separated by a comma."
! msgstr ""
! 
! #: config/s390/s390.opt:119
! msgid "Use hardware transactional execution instructions"
! msgstr ""
! 
! #: config/s390/s390.opt:123
! msgid "Use packed stack layout"
! msgstr ""
! 
! #: config/s390/s390.opt:127
! msgid "Use bras for executable < 64k"
! msgstr ""
! 
! #: config/s390/s390.opt:131
! msgid "Disable hardware floating point"
! msgstr ""
! 
! #: config/s390/s390.opt:135
! msgid ""
! "Set the max. number of bytes which has to be left to stack size before a "
! "trap instruction is triggered"
! msgstr ""
! 
! #: config/s390/s390.opt:139
! msgid ""
! "Emit extra code in the function prologue in order to trap if the stack size "
! "exceeds the given limit"
! msgstr ""
! 
! #: config/s390/s390.opt:147
! msgid "mvcle use"
! msgstr ""
! 
! #: config/s390/s390.opt:151
! msgid "Warn if a function uses alloca or creates an array with dynamic size"
! msgstr ""
! 
! #: config/s390/s390.opt:155
! msgid "Warn if a single function's framesize exceeds the given framesize"
! msgstr ""
! 
! #: config/s390/s390.opt:159
! msgid "z/Architecture"
! msgstr ""
! 
! #: config/s390/s390.opt:163
! msgid "Set the branch costs for conditional branch instructions.  Reasonable"
  msgstr ""
  
! #: config/s390/s390.opt:169 config/rs6000/rs6000.opt:474
! #: config/mips/mips.opt:389
! msgid "Use LRA instead of reload"
  msgstr ""
  
! #: config/rl78/rl78.opt:27 config/rx/rx.opt:87
! msgid "Use the simulator runtime."
  msgstr ""
  
! #: config/rl78/rl78.opt:31
! msgid "Select hardware or software multiplication support."
  msgstr ""
  
! #: config/rl78/rl78.opt:47
! msgid "Use all registers, reserving none for interrupt handlers."
  msgstr ""
  
! #: config/rl78/rl78.opt:51
! msgid "Enable assembler and linker relaxation.  Enabled by default at -Os."
  msgstr ""
  
! #: config/rl78/rl78.opt:55
! msgid "Target the RL78/G10 series"
  msgstr ""
  
! #: config/rl78/rl78.opt:59
  msgid ""
! "Assume ES is zero throughout program execution, use ES: for read-only data."
! msgstr ""
! 
! #: config/stormy16/stormy16.opt:24
! msgid "Provide libraries for the simulator"
! msgstr ""
! 
! #: config/arm/arm-tables.opt:25
! msgid "Known ARM CPUs (for use with the -mcpu= and -mtune= options):"
! msgstr ""
! 
! #: config/arm/arm-tables.opt:329
! msgid "Known ARM architectures (for use with the -march= option):"
! msgstr ""
! 
! #: config/arm/arm-tables.opt:417
! msgid "Known ARM FPUs (for use with the -mfpu= option):"
! msgstr ""
! 
! #: config/arm/arm.opt:26
! msgid "TLS dialect to use:"
! msgstr ""
! 
! #: config/arm/arm.opt:36
! msgid "Specify an ABI"
! msgstr ""
! 
! #: config/arm/arm.opt:40
! msgid "Known ARM ABIs (for use with the -mabi= option):"
! msgstr ""
! 
! #: config/arm/arm.opt:59
! msgid "Generate a call to abort if a noreturn function returns"
! msgstr ""
! 
! #: config/arm/arm.opt:66
! msgid "Pass FP arguments in FP registers"
! msgstr ""
! 
! #: config/arm/arm.opt:70
! msgid "Generate APCS conformant stack frames"
! msgstr ""
! 
! #: config/arm/arm.opt:74
! msgid "Generate re-entrant, PIC code"
! msgstr ""
! 
! #: config/arm/arm.opt:90
! msgid "Generate code in 32 bit ARM state."
! msgstr ""
! 
! #: config/arm/arm.opt:98
! msgid "Thumb: Assume non-static functions may be called from ARM code"
! msgstr ""
! 
! #: config/arm/arm.opt:102
! msgid "Thumb: Assume function pointers may go to non-Thumb aware code"
! msgstr ""
! 
! #: config/arm/arm.opt:110
! msgid "Specify if floating point hardware should be used"
! msgstr ""
! 
! #: config/arm/arm.opt:114
! msgid "Known floating-point ABIs (for use with the -mfloat-abi= option):"
! msgstr ""
! 
! #: config/arm/arm.opt:127
! msgid "Specify the __fp16 floating-point format"
! msgstr ""
! 
! #: config/arm/arm.opt:131
! msgid "Known __fp16 formats (for use with the -mfp16-format= option):"
! msgstr ""
! 
! #: config/arm/arm.opt:144
! msgid "Specify the name of the target floating point hardware/format"
! msgstr ""
! 
! #: config/arm/arm.opt:155
! msgid "Generate call insns as indirect calls, if necessary"
! msgstr ""
! 
! #: config/arm/arm.opt:159
! msgid "Assume data segments are relative to text segment."
! msgstr ""
! 
! #: config/arm/arm.opt:163
! msgid "Specify the register to be used for PIC addressing"
! msgstr ""
! 
! #: config/arm/arm.opt:167
! msgid "Store function names in object code"
! msgstr ""
! 
! #: config/arm/arm.opt:171
! msgid "Permit scheduling of a function's prologue sequence"
! msgstr ""
! 
! #: config/arm/arm.opt:175 config/rs6000/rs6000.opt:248
! msgid "Do not load the PIC register in function prologues"
! msgstr ""
! 
! #: config/arm/arm.opt:182
! msgid "Specify the minimum bit alignment of structures"
! msgstr ""
! 
! #: config/arm/arm.opt:186
! msgid "Generate code for Thumb state"
! msgstr ""
! 
! #: config/arm/arm.opt:190
! msgid "Support calls between Thumb and ARM instruction sets"
! msgstr ""
! 
! #: config/arm/arm.opt:194
! msgid "Specify thread local storage scheme"
! msgstr ""
! 
! #: config/arm/arm.opt:198
! msgid "Specify how to access the thread pointer"
  msgstr ""
  
! #: config/arm/arm.opt:202
! msgid "Valid arguments to -mtp=:"
  msgstr ""
  
! #: config/arm/arm.opt:215
! msgid "Thumb: Generate (non-leaf) stack frames even if not needed"
  msgstr ""
  
! #: config/arm/arm.opt:219
! msgid "Thumb: Generate (leaf) stack frames even if not needed"
  msgstr ""
  
! #: config/arm/arm.opt:223 config/mn10300/mn10300.opt:42
! msgid "Tune code for the given processor"
  msgstr ""
  
! #: config/arm/arm.opt:227
! msgid "Print CPU tuning information as comment in assembler file.  This is"
  msgstr ""
  
! #: config/arm/arm.opt:238
! msgid ""
! "Use Neon quad-word (rather than double-word) registers for vectorization"
  msgstr ""
  
! #: config/arm/arm.opt:242
! msgid ""
! "Use Neon double-word (rather than quad-word) registers for vectorization"
  msgstr ""
  
! #: config/arm/arm.opt:246
! msgid "Only generate absolute relocations on word sized values."
  msgstr ""
  
! #: config/arm/arm.opt:250
! msgid "Generate IT blocks appropriate for ARMv8."
  msgstr ""
  
! #: config/arm/arm.opt:254
! msgid "Use the old RTX costing tables (transitional)."
  msgstr ""
  
! #: config/arm/arm.opt:258
! msgid ""
! "Use the new generic RTX cost tables if new core-specific cost table not "
! "available (transitional)."
  msgstr ""
  
! #: config/arm/arm.opt:262
  msgid ""
! "Avoid overlapping destination and address registers on LDRD instructions"
! msgstr ""
! 
! #: config/arm/arm.opt:267
! msgid "Enable unaligned word and halfword accesses to packed data."
! msgstr ""
! 
! #: config/arm/arm.opt:271
! msgid "Use Neon to perform 64-bits operations rather than core registers."
! msgstr ""
! 
! #: config/arm/arm.opt:275
! msgid "Assume loading data from flash is slower than fetching instructions."
! msgstr ""
! 
! #: config/arm/arm.opt:279
! msgid "Assume unified syntax for Thumb inline assembly code."
! msgstr ""
! 
! #: config/sparc/sparc.opt:30 config/sparc/sparc.opt:34
! #: config/visium/visium.opt:37
! msgid "Use hardware FP"
! msgstr ""
! 
! #: config/sparc/sparc.opt:38 config/visium/visium.opt:41
! msgid "Do not use hardware FP"
  msgstr ""
  
  #: config/sparc/sparc.opt:42
--- 8515,8602 ----
  "option):"
  msgstr ""
  
! #: config/i386/interix.opt:32 config/i386/cygming.opt:47
! msgid "Use the GNU extension to the PE format for aligned common data"
  msgstr ""
  
! #: config/i386/cygming.opt:23
! msgid "Create console application"
  msgstr ""
  
! #: config/i386/cygming.opt:27
! msgid "Generate code for a DLL"
  msgstr ""
  
! #: config/i386/cygming.opt:31
! msgid "Ignore dllimport for functions"
  msgstr ""
  
! #: config/i386/cygming.opt:35
! msgid "Use Mingw-specific thread support"
  msgstr ""
  
! #: config/i386/cygming.opt:39
! msgid "Set Windows defines"
  msgstr ""
  
! #: config/i386/cygming.opt:43
! msgid "Create GUI application"
  msgstr ""
  
! #: config/i386/cygming.opt:51
  msgid ""
! "Compile code that relies on Cygwin DLL wrappers to support C++ operator new/"
! "delete replacement"
  msgstr ""
  
! #: config/i386/cygming.opt:58
! msgid "Put relocated read-only data into .data section."
  msgstr ""
  
! #: config/i386/djgpp.opt:25
! msgid "Ignored (obsolete)"
  msgstr ""
  
! #: config/i386/mingw-w64.opt:23
! msgid "Use unicode startup and define UNICODE macro"
  msgstr ""
  
! #: config/i386/mingw.opt:29
! msgid "Warn about none ISO msvcrt scanf/printf width extensions"
  msgstr ""
  
! #: config/i386/mingw.opt:33
! msgid "For nested functions on stack executable permission is set."
  msgstr ""
  
! #: config/moxie/moxie.opt:31
! msgid "Enable MUL.X and UMUL.X instructions"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:23
! msgid "Use CONST16 instruction to load constants"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:27
! msgid "Disable position-independent code (PIC) for use in OS kernel code"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:31
! msgid "Use indirect CALLXn instructions for large programs"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:35
! msgid "Automatically align branch targets to reduce branch penalties"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:39
! msgid "Intersperse literal pools with code in the text section"
  msgstr ""
  
! #: config/xtensa/xtensa.opt:43
  msgid ""
! "-mno-serialize-volatile\tDo not serialize volatile memory references with "
! "MEMW instructions"
  msgstr ""
  
  #: config/sparc/sparc.opt:42
*************** msgid "Optimize tail call instructions i
*** 9982,9992 ****
  msgstr ""
  
  #: config/sparc/sparc.opt:118
! msgid "Do not generate code that can only run in supervisor mode"
! msgstr ""
! 
! #: config/sparc/sparc.opt:122 config/visium/visium.opt:45
! msgid "Use features of and schedule code for given CPU"
  msgstr ""
  
  #: config/sparc/sparc.opt:199
--- 8676,8682 ----
  msgstr ""
  
  #: config/sparc/sparc.opt:118
! msgid "Do not generate code that can only run in supervisor mode (default)"
  msgstr ""
  
  #: config/sparc/sparc.opt:199
*************** msgid "Enable strict 32-bit psABI struct
*** 10002,10008 ****
  msgstr ""
  
  #: config/sparc/sparc.opt:211
! msgid "Enable workaround for single erratum of AT697F processor"
  msgstr ""
  
  #: config/sparc/sparc.opt:216
--- 8692,8700 ----
  msgstr ""
  
  #: config/sparc/sparc.opt:211
! msgid ""
! "Enable workaround for single erratum of AT697F processor (corresponding to "
! "erratum #13 of AT697E processor)"
  msgstr ""
  
  #: config/sparc/sparc.opt:216
*************** msgstr ""
*** 10013,10636 ****
  msgid "Specify the memory model in effect for the program."
  msgstr ""
  
! #: config/rs6000/darwin.opt:38 config/rs6000/sysv4.opt:141
! msgid "Generate 64-bit code"
! msgstr ""
! 
! #: config/rs6000/darwin.opt:42 config/rs6000/sysv4.opt:145
! msgid "Generate 32-bit code"
! msgstr ""
! 
! #: config/rs6000/rs6000-tables.opt:24
! msgid "Known CPUs (for use with the -mcpu= and -mtune= options):"
! msgstr ""
! 
! #: config/rs6000/476.opt:24
! msgid ""
! "Preserve the PowerPC 476's link stack by matching up a blr with the bcl/bl "
! "insns used for GOT accesses"
! msgstr ""
! 
! #: config/rs6000/aix64.opt:24
! msgid "Compile for 64-bit pointers"
! msgstr ""
! 
! #: config/rs6000/aix64.opt:28
! msgid "Compile for 32-bit pointers"
! msgstr ""
! 
! #: config/rs6000/aix64.opt:32 config/rs6000/linux64.opt:28
! msgid "Select code model"
! msgstr ""
! 
! #: config/rs6000/aix64.opt:49
! msgid "Support message passing with the Parallel Environment"
! msgstr ""
! 
! #: config/rs6000/linux64.opt:24
! msgid "Call mcount for profiling before a function prologue"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:109
! msgid "Use PowerPC-64 instruction set"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:113
! msgid "Use PowerPC General Purpose group optional instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:117
! msgid "Use PowerPC Graphics group optional instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:121
! msgid "Use PowerPC V2.01 single field mfcr instruction"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:125
! msgid "Use PowerPC V2.02 popcntb instruction"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:129
! msgid "Use PowerPC V2.02 floating point rounding instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:133
! msgid "Use PowerPC V2.05 compare bytes instruction"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:137
! msgid "Use extended PowerPC V2.05 move floating point to/from GPR instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:141
! msgid "Use AltiVec instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:145
! msgid "Generate Altivec instructions using little-endian element order"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:149
! msgid "Generate Altivec instructions using big-endian element order"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:153
! msgid "Use decimal floating point instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:157
! msgid "Use 4xx half-word multiply instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:161
! msgid "Use 4xx string-search dlmzb instruction"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:165
! msgid "Generate load/store multiple instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:169
! msgid "Generate string instructions for block moves"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:181
! msgid "Use PowerPC V2.06 popcntd instruction"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:185
! msgid ""
! "Under -ffast-math, generate a FRIZ instruction for (double)(long long) "
! "conversions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:193
! msgid "Use vector/scalar (VSX) instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:240
! msgid "Do not generate load/store with update instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:244
! msgid "Generate load/store with update instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:252
! msgid "Avoid generation of indexed load/store instructions when possible"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:256
! msgid "Mark __tls_get_addr calls with argument info"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:263
! msgid "Schedule the start and end of the procedure"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:267
! msgid "Return all structures in memory (AIX default)"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:271
! msgid "Return small structures in registers (SVR4 default)"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:275
! msgid "Conform more closely to IBM XLC semantics"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:279 config/rs6000/rs6000.opt:283
! msgid ""
! "Generate software reciprocal divide and square root for better throughput."
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:287
! msgid "Assume that the reciprocal estimate instructions provide more accuracy."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:291
! msgid "Do not place floating point constants in TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:295
! msgid "Place floating point constants in TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:299
! msgid "Do not place symbol+offset constants in TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:303
! msgid "Place symbol+offset constants in TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:314
! msgid "Use only one TOC entry per procedure"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:318
! msgid "Put everything in the regular TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:322
! msgid "Generate VRSAVE instructions when generating AltiVec code"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:326
! msgid "Deprecated option.  Use -mno-vrsave instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:330
! msgid "Deprecated option.  Use -mvrsave instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:334
  msgid ""
! "Specify how many bytes should be moved inline before calling out to memcpy/"
! "memmove"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:338
! msgid "Generate isel instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:342
! msgid "Deprecated option.  Use -mno-isel instead"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:346
! msgid "Deprecated option.  Use -misel instead"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:350
! msgid "Generate SPE SIMD instructions on E500"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:354
! msgid "Generate PPC750CL paired-single instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:358
! msgid "Deprecated option.  Use -mno-spe instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:362
! msgid "Deprecated option.  Use -mspe instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:366
! msgid "-mdebug=\tEnable debug output"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:370
! msgid "Use the AltiVec ABI extensions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:374
! msgid "Do not use the AltiVec ABI extensions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:378
! msgid "Use the SPE ABI extensions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:382
! msgid "Do not use the SPE ABI extensions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:386
! msgid "Use the ELFv1 ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:390
! msgid "Use the ELFv2 ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:397
! msgid "using darwin64 ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:400
! msgid "using old darwin ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:403
! msgid "using IEEE extended precision long double"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:406
! msgid "using IBM extended precision long double"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:410
! msgid "-mcpu=\tUse features of and schedule code for given CPU"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:414
! msgid "-mtune=\tSchedule code for given CPU"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:418
! msgid "-mtraceback=\tSelect full, part, or no traceback table"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:434
! msgid "Avoid all range limits on call instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:438
! msgid "Generate Cell microcode"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:442
! msgid "Warn when a Cell microcoded instruction is emitted"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:446
! msgid "Warn about deprecated 'vector long ...' AltiVec type usage"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:450
! msgid "-mfloat-gprs=\tSelect GPR floating point method"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:454
! msgid "Valid arguments to -mfloat-gprs=:"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:470
! msgid "-mlong-double-<n>\tSpecify size of long double (64 or 128 bits)"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:478
! msgid "Determine which dependences between insns are considered costly"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:482
! msgid "Specify which post scheduling nop insertion scheme to apply"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:486
! msgid "Specify alignment of structure fields default/natural"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:490
! msgid "Valid arguments to -malign-:"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:500
! msgid "Specify scheduling priority for dispatch slot restricted insns"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:504
! msgid "Single-precision floating point unit"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:508
! msgid "Double-precision floating point unit"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:512
! msgid "Floating point unit does not support divide & sqrt"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:516
! msgid "-mfpu=\tSpecify FP (sp, dp, sp-lite, dp-lite) (implies -mxilinx-fpu)"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:538
! msgid "Specify Xilinx FPU."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:542
! msgid ""
! "Use/do not use r11 to hold the static link in calls to functions via "
! "pointers."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:546
  msgid ""
! "Control whether we save the TOC in the prologue for indirect calls or "
! "generate the save inline"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:550
! msgid "Allow 128-bit integers in VSX registers"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:554
  msgid ""
! "Fuse certain integer operations together for better performance on power8"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:558
! msgid "Allow sign extension in fusion operations"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:562
! msgid "Use/do not use vector and scalar instructions added in ISA 2.07."
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:566
! msgid "Use ISA 2.07 Category:Vector.AES and Category:Vector.SHA2 instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:570
! msgid "Use ISA 2.07 direct move between GPR & VSX register instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:574
! msgid "Use ISA 2.07 transactional memory (HTM) instructions"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:578
! msgid "Generate the quad word memory instructions (lq/stq)."
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:582
! msgid "Generate the quad word memory atomic instructions (lqarx/stqcx)."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:586
  msgid ""
! "Generate aggregate parameter passing code with at most 64-bit alignment."
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:590
! msgid "Allow double variables in upper registers with -mcpu=power7 or -mvsx"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:594
  msgid ""
! "Allow float variables in upper registers with -mcpu=power8 or -mpower8-vector"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:598
! msgid "Allow float/double variables in upper registers if cpu allows it"
! msgstr ""
! 
! #: config/rs6000/rs6000.opt:602
! msgid "Analyze and remove doubleword swaps from VSX computations."
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:24
! msgid "Select ABI calling convention"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:28 config/c6x/c6x.opt:42
! msgid "Select method for sdata handling"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:48 config/rs6000/sysv4.opt:52
! msgid "Align to the base type of the bit-field"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:57 config/rs6000/sysv4.opt:61
! msgid "Produce code relocatable at runtime"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:65 config/rs6000/sysv4.opt:69
! msgid "Produce little endian code"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:73 config/rs6000/sysv4.opt:77
! msgid "Produce big endian code"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:82 config/rs6000/sysv4.opt:86
! #: config/rs6000/sysv4.opt:95 config/rs6000/sysv4.opt:137
! #: config/rs6000/sysv4.opt:149
! msgid "no description yet"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:90
! msgid "Assume all variable arg functions are prototyped"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:99
! msgid "Use EABI"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:103
! msgid "Allow bit-fields to cross word boundaries"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:107
! msgid "Use alternate register names"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:113
! msgid "Use default method for sdata handling"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:117
! msgid "Link with libsim.a, libc.a and sim-crt0.o"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:121
! msgid "Link with libads.a, libc.a and crt0.o"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:125
! msgid "Link with libyk.a, libc.a and crt0.o"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:129
! msgid "Link with libmvme.a, libc.a and crt0.o"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:133
! msgid "Set the PPC_EMB bit in the ELF flags header"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:153
! msgid "Generate code to use a non-exec PLT and GOT"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:157
! msgid "Generate code for old exec BSS PLT"
! msgstr ""
! 
! #: config/alpha/alpha.opt:27
! msgid "Use fp registers"
! msgstr ""
! 
! #: config/alpha/alpha.opt:35
! msgid "Request IEEE-conformant math library routines (OSF/1)"
! msgstr ""
! 
! #: config/alpha/alpha.opt:39
! msgid "Emit IEEE-conformant code, without inexact exceptions"
! msgstr ""
! 
! #: config/alpha/alpha.opt:46
! msgid "Do not emit complex integer constants to read-only memory"
! msgstr ""
! 
! #: config/alpha/alpha.opt:50
! msgid "Use VAX fp"
! msgstr ""
! 
! #: config/alpha/alpha.opt:54
! msgid "Do not use VAX fp"
! msgstr ""
! 
! #: config/alpha/alpha.opt:58
! msgid "Emit code for the byte/word ISA extension"
! msgstr ""
! 
! #: config/alpha/alpha.opt:62
! msgid "Emit code for the motion video ISA extension"
! msgstr ""
! 
! #: config/alpha/alpha.opt:66
! msgid "Emit code for the fp move and sqrt ISA extension"
! msgstr ""
! 
! #: config/alpha/alpha.opt:70
! msgid "Emit code for the counting ISA extension"
! msgstr ""
! 
! #: config/alpha/alpha.opt:74
! msgid "Emit code using explicit relocation directives"
! msgstr ""
! 
! #: config/alpha/alpha.opt:78
! msgid "Emit 16-bit relocations to the small data areas"
! msgstr ""
! 
! #: config/alpha/alpha.opt:82
! msgid "Emit 32-bit relocations to the small data areas"
! msgstr ""
! 
! #: config/alpha/alpha.opt:86
! msgid "Emit direct branches to local functions"
! msgstr ""
! 
! #: config/alpha/alpha.opt:90
! msgid "Emit indirect branches to local functions"
! msgstr ""
! 
! #: config/alpha/alpha.opt:94
! msgid "Emit rdval instead of rduniq for thread pointer"
! msgstr ""
! 
! #: config/alpha/alpha.opt:106
! msgid "Use features of and schedule given CPU"
! msgstr ""
! 
! #: config/alpha/alpha.opt:110
! msgid "Schedule given CPU"
! msgstr ""
! 
! #: config/alpha/alpha.opt:114
! msgid "Control the generated fp rounding mode"
! msgstr ""
! 
! #: config/alpha/alpha.opt:118
! msgid "Control the IEEE trap mode"
! msgstr ""
! 
! #: config/alpha/alpha.opt:122
! msgid "Control the precision given to fp exceptions"
! msgstr ""
! 
! #: config/alpha/alpha.opt:126
! msgid "Tune expected memory latency"
! msgstr ""
! 
! #: config/tilepro/tilepro.opt:23
! msgid "Compile with 32 bit longs and pointers, which is the only supported"
! msgstr ""
! 
! #: config/tilepro/tilepro.opt:28 config/tilegx/tilegx.opt:26
! msgid "-mcpu=CPU\tUse features of and schedule code for given CPU"
! msgstr ""
! 
! #: config/tilepro/tilepro.opt:32
! msgid "Known TILEPro CPUs (for use with the -mcpu= option):"
! msgstr ""
! 
! #: config/lm32/lm32.opt:24
! msgid "Enable multiply instructions"
! msgstr ""
! 
! #: config/lm32/lm32.opt:28
! msgid "Enable divide and modulus instructions"
! msgstr ""
! 
! #: config/lm32/lm32.opt:32
! msgid "Enable barrel shift instructions"
! msgstr ""
! 
! #: config/lm32/lm32.opt:36
! msgid "Enable sign extend instructions"
  msgstr ""
  
! #: config/lm32/lm32.opt:40
! msgid "Enable user-defined instructions"
  msgstr ""
  
  #: config/nios2/elf.opt:26
--- 8705,8927 ----
  msgid "Specify the memory model in effect for the program."
  msgstr ""
  
! #: config/m32c/m32c.opt:23
! msgid "-msim\tUse simulator runtime"
  msgstr ""
  
! #: config/m32c/m32c.opt:27
! msgid "-mcpu=r8c\tCompile code for R8C variants"
  msgstr ""
  
! #: config/m32c/m32c.opt:31
! msgid "-mcpu=m16c\tCompile code for M16C variants"
  msgstr ""
  
! #: config/m32c/m32c.opt:35
! msgid "-mcpu=m32cm\tCompile code for M32CM variants"
  msgstr ""
  
! #: config/m32c/m32c.opt:39
! msgid "-mcpu=m32c\tCompile code for M32C variants"
  msgstr ""
  
! #: config/m32c/m32c.opt:43
! msgid "-memregs=\tNumber of memreg bytes (default: 16, range: 0..16)"
  msgstr ""
  
! #: config/iq2000/iq2000.opt:31
! msgid "Specify CPU for code generation purposes"
  msgstr ""
  
! #: config/iq2000/iq2000.opt:47
! msgid "Specify CPU for scheduling purposes"
  msgstr ""
  
! #: config/iq2000/iq2000.opt:51
! msgid "Known IQ2000 CPUs (for use with the -mcpu= option):"
  msgstr ""
  
! #: config/iq2000/iq2000.opt:70
! msgid "No default crt0.o"
  msgstr ""
  
! #: config/g.opt:27
  msgid ""
! "-G<number>\tPut global and static data smaller than <number> bytes into a "
! "special section (on some targets)"
  msgstr ""
  
! #: config/linux-android.opt:23
! msgid "Generate code for the Android platform."
  msgstr ""
  
! #: config/ia64/ilp32.opt:3
! msgid "Generate ILP32 code"
  msgstr ""
  
! #: config/ia64/ilp32.opt:7
! msgid "Generate LP64 code"
  msgstr ""
  
! #: config/ia64/ia64.opt:28
! msgid "Generate big endian code"
  msgstr ""
  
! #: config/ia64/ia64.opt:32
! msgid "Generate little endian code"
  msgstr ""
  
! #: config/ia64/ia64.opt:36
! msgid "Generate code for GNU as"
  msgstr ""
  
! #: config/ia64/ia64.opt:40
! msgid "Generate code for GNU ld"
  msgstr ""
  
! #: config/ia64/ia64.opt:44
! msgid "Emit stop bits before and after volatile extended asms"
  msgstr ""
  
! #: config/ia64/ia64.opt:48
! msgid "Use in/loc/out register names"
  msgstr ""
  
! #: config/ia64/ia64.opt:55
! msgid "Enable use of sdata/scommon/sbss"
  msgstr ""
  
! #: config/ia64/ia64.opt:59
! msgid "Generate code without GP reg"
  msgstr ""
  
! #: config/ia64/ia64.opt:63
! msgid "gp is constant (but save/restore gp on indirect calls)"
  msgstr ""
  
! #: config/ia64/ia64.opt:67
! msgid "Generate self-relocatable code"
  msgstr ""
  
! #: config/ia64/ia64.opt:71
! msgid "Generate inline floating point division, optimize for latency"
  msgstr ""
  
! #: config/ia64/ia64.opt:75
! msgid "Generate inline floating point division, optimize for throughput"
  msgstr ""
  
! #: config/ia64/ia64.opt:82
! msgid "Generate inline integer division, optimize for latency"
  msgstr ""
  
! #: config/ia64/ia64.opt:86
! msgid "Generate inline integer division, optimize for throughput"
  msgstr ""
  
! #: config/ia64/ia64.opt:90
! msgid "Do not inline integer division"
  msgstr ""
  
! #: config/ia64/ia64.opt:94
! msgid "Generate inline square root, optimize for latency"
  msgstr ""
  
! #: config/ia64/ia64.opt:98
! msgid "Generate inline square root, optimize for throughput"
  msgstr ""
  
! #: config/ia64/ia64.opt:102
! msgid "Do not inline square root"
  msgstr ""
  
! #: config/ia64/ia64.opt:106
! msgid "Enable Dwarf 2 line debug info via GNU as"
  msgstr ""
  
! #: config/ia64/ia64.opt:110
! msgid "Enable earlier placing stop bits for better scheduling"
  msgstr ""
  
! #: config/ia64/ia64.opt:126
! msgid "Known Itanium CPUs (for use with the -mtune= option):"
  msgstr ""
  
! #: config/ia64/ia64.opt:136
! msgid "Use data speculation before reload"
  msgstr ""
  
! #: config/ia64/ia64.opt:140
! msgid "Use data speculation after reload"
  msgstr ""
  
! #: config/ia64/ia64.opt:144
! msgid "Use control speculation"
  msgstr ""
  
! #: config/ia64/ia64.opt:148
! msgid "Use in block data speculation before reload"
  msgstr ""
  
! #: config/ia64/ia64.opt:152
! msgid "Use in block data speculation after reload"
  msgstr ""
  
! #: config/ia64/ia64.opt:156
! msgid "Use in block control speculation"
  msgstr ""
  
! #: config/ia64/ia64.opt:160
! msgid "Use simple data speculation check"
  msgstr ""
  
! #: config/ia64/ia64.opt:164
! msgid "Use simple data speculation check for control speculation"
  msgstr ""
  
! #: config/ia64/ia64.opt:167 config/ia64/ia64.opt:170 c-family/c.opt:623
! #: c-family/c.opt:937 c-family/c.opt:944 c-family/c.opt:1114
! #: c-family/c.opt:1133 c-family/c.opt:1156 c-family/c.opt:1162
! #: c-family/c.opt:1169 c-family/c.opt:1193 c-family/c.opt:1204
! #: c-family/c.opt:1207 c-family/c.opt:1210 c-family/c.opt:1213
! #: c-family/c.opt:1216 c-family/c.opt:1253 c-family/c.opt:1384
! #: c-family/c.opt:1395 c-family/c.opt:1413 c-family/c.opt:1444
! #: c-family/c.opt:1448 c-family/c.opt:1464 c-family/c-opts.c:426
! #, gcc-internal-format
! msgid "switch %qs is no longer supported"
  msgstr ""
  
! #: config/ia64/ia64.opt:174
  msgid ""
! "Count speculative dependencies while calculating priority of instructions"
  msgstr ""
  
! #: config/ia64/ia64.opt:178
! msgid "Place a stop bit after every cycle when scheduling"
  msgstr ""
  
! #: config/ia64/ia64.opt:182
  msgid ""
! "Assume that floating-point stores and loads are not likely to cause conflict "
! "when placed into one instruction group"
  msgstr ""
  
! #: config/ia64/ia64.opt:186
  msgid ""
! "Soft limit on number of memory insns per instruction group, giving lower "
! "priority to subsequent memory insns attempting to schedule in the same insn "
! "group. Frequently useful to prevent cache bank conflicts.  Default value is 1"
  msgstr ""
  
! #: config/ia64/ia64.opt:190
  msgid ""
! "Disallow more than 'msched-max-memory-insns' in instruction group. "
! "Otherwise, limit is 'soft' (prefer non-memory operations when limit is "
! "reached)"
  msgstr ""
  
! #: config/ia64/ia64.opt:194
! msgid "Don't generate checks for control speculation in selective scheduling"
  msgstr ""
  
  #: config/nios2/elf.opt:26
*************** msgstr ""
*** 10693,10708 ****
  msgid "Equivalent to -mgpopt=none."
  msgstr ""
  
- #: config/nios2/nios2.opt:94 config/c6x/c6x.opt:30 config/mep/mep.opt:82
- #: config/mips/mips.opt:134
- msgid "Use big-endian byte order"
- msgstr ""
- 
- #: config/nios2/nios2.opt:98 config/c6x/c6x.opt:34 config/mep/mep.opt:86
- #: config/mips/mips.opt:138
- msgid "Use little-endian byte order"
- msgstr ""
- 
  #: config/nios2/nios2.opt:102
  msgid "Floating point custom instruction configuration name"
  msgstr ""
--- 8984,8989 ----
*************** msgstr ""
*** 11171,11176 ****
--- 9452,9511 ----
  msgid "Integer id (N) of round custom instruction"
  msgstr ""
  
+ #: config/lm32/lm32.opt:24
+ msgid "Enable multiply instructions"
+ msgstr ""
+ 
+ #: config/lm32/lm32.opt:28
+ msgid "Enable divide and modulus instructions"
+ msgstr ""
+ 
+ #: config/lm32/lm32.opt:32
+ msgid "Enable barrel shift instructions"
+ msgstr ""
+ 
+ #: config/lm32/lm32.opt:36
+ msgid "Enable sign extend instructions"
+ msgstr ""
+ 
+ #: config/lm32/lm32.opt:40
+ msgid "Enable user-defined instructions"
+ msgstr ""
+ 
+ #: config/msp430/msp430.opt:7
+ msgid "Force assembly output to always use hex constants"
+ msgstr ""
+ 
+ #: config/msp430/msp430.opt:11
+ msgid "Specify the MCU to build for."
+ msgstr ""
+ 
+ #: config/msp430/msp430.opt:15
+ msgid "Specify the ISA to build for: msp430, mdsp430x, msp430xv2"
+ msgstr ""
+ 
+ #: config/msp430/msp430.opt:19
+ msgid "Select large model - 20-bit addresses/pointers"
+ msgstr ""
+ 
+ #: config/msp430/msp430.opt:23
+ msgid "Select small model - 16-bit addresses/pointers (default)"
+ msgstr ""
+ 
+ #: config/msp430/msp430.opt:27
+ msgid "Optimize opcode sizes at link time"
+ msgstr ""
+ 
+ #: config/msp430/msp430.opt:34
+ msgid ""
+ "Use a minimum runtime (no static initializers or ctors) for memory-"
+ "constrained devices."
+ msgstr ""
+ 
+ #: config/msp430/msp430.opt:41
+ msgid "Specify the type of hardware multiply to support"
+ msgstr ""
+ 
  #: config/rx/rx.opt:29
  msgid "Store doubles in 64 bits."
  msgstr ""
*************** msgid ""
*** 11205,11210 ****
--- 9540,9549 ----
  "small data area."
  msgstr ""
  
+ #: config/rx/rx.opt:87 config/rl78/rl78.opt:27
+ msgid "Use the simulator runtime."
+ msgstr ""
+ 
  #: config/rx/rx.opt:93
  msgid ""
  "Generate assembler output that is compatible with the Renesas AS100 "
*************** msgstr ""
*** 11256,12110 ****
  msgid "Enable the use of the LRA register allocator."
  msgstr ""
  
! #: config/visium/visium.opt:25
! msgid "Link with libc.a and libdebug.a"
! msgstr ""
! 
! #: config/visium/visium.opt:29
! msgid "Link with libc.a and libsim.a"
! msgstr ""
! 
! #: config/visium/visium.opt:33
! msgid "Use hardware FP (default)"
! msgstr ""
! 
! #: config/visium/visium.opt:65
! msgid "Generate code for the supervisor mode (default)"
! msgstr ""
! 
! #: config/visium/visium.opt:69
! msgid "Generate code for the user mode"
! msgstr ""
! 
! #: config/visium/visium.opt:73
! msgid "Only retained for backward compatibility."
! msgstr ""
! 
! #: config/fused-madd.opt:22
! msgid "%<-mfused-madd%> is deprecated; use %<-ffp-contract=%> instead"
! msgstr ""
! 
! #: config/sol2.opt:32
! msgid "Clear hardware capabilities when linking"
! msgstr ""
! 
! #: config/sol2.opt:36
! msgid "Pass -z text to linker"
! msgstr ""
! 
! #: config/moxie/moxie.opt:31
! msgid "Enable MUL.X and UMUL.X instructions"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:40
! msgid "Use software emulation for floating point (default)"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:44
! msgid "Use hardware floating point instructions"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:48
! msgid "Use table lookup optimization for small signed integer divisions"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:52
! msgid "-mcpu=PROCESSOR\t\tUse features of and schedule code for given CPU"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:56
! msgid "Don't optimize block moves, use memcpy"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:68
! msgid "Use the soft multiply emulation (default)"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:72
! msgid "Use reorder instructions (swap and byte reversed load/store) (default)"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:76
! msgid "Use the software emulation for divides (default)"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:80
! msgid "Use the hardware barrel shifter instead of emulation"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:84
! msgid "Use pattern compare instructions"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:87
! #, c-format
! msgid "%qs is deprecated; use -fstack-check"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:88
! msgid "Check for stack overflow at runtime"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:92 config/iq2000/iq2000.opt:65
! msgid "Use GP relative sdata/sbss sections"
! msgstr ""
! 
! #: config/microblaze/microblaze.opt:95
! #, c-format
! msgid "%qs is deprecated; use -fno-zero-initialized-in-bss"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:96
! msgid "Clear the BSS to zero and place zero initialized in BSS"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:100
! msgid "Use multiply high instructions for high part of 32x32 multiply"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:104
! msgid "Use hardware floating point conversion instructions"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:108
! msgid "Use hardware floating point square root instruction"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:112
! msgid "Description for mxl-mode-executable"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:116
! msgid "Description for mxl-mode-xmdstub"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:120
! msgid "Description for mxl-mode-bootstrap"
  msgstr ""
  
! #: config/microblaze/microblaze.opt:124
! msgid "Description for mxl-mode-novectors"
  msgstr ""
  
! #: config/vax/vax.opt:23 config/vax/vax.opt:27
! msgid "Target DFLOAT double precision code"
  msgstr ""
  
! #: config/vax/vax.opt:31 config/vax/vax.opt:35
! msgid "Generate GFLOAT double precision code"
  msgstr ""
  
! #: config/vax/vax.opt:39
! msgid "Generate code for GNU assembler (gas)"
  msgstr ""
  
! #: config/vax/vax.opt:43
! msgid "Generate code for UNIX assembler"
  msgstr ""
  
! #: config/vax/vax.opt:47
! msgid "Use VAXC structure conventions"
  msgstr ""
  
! #: config/vax/vax.opt:51
! msgid "Use new adddi3/subdi3 patterns"
  msgstr ""
  
! #: config/frv/frv.opt:30
! msgid "Use 4 media accumulators"
  msgstr ""
  
! #: config/frv/frv.opt:34
! msgid "Use 8 media accumulators"
  msgstr ""
  
! #: config/frv/frv.opt:38
! msgid "Enable label alignment optimizations"
  msgstr ""
  
! #: config/frv/frv.opt:42
! msgid "Dynamically allocate cc registers"
  msgstr ""
  
! #: config/frv/frv.opt:49
! msgid "Set the cost of branches"
  msgstr ""
  
! #: config/frv/frv.opt:53
! msgid "Enable conditional execution other than moves/scc"
  msgstr ""
  
! #: config/frv/frv.opt:57
! msgid "Change the maximum length of conditionally-executed sequences"
  msgstr ""
  
! #: config/frv/frv.opt:61
  msgid ""
! "Change the number of temporary registers that are available to conditionally-"
! "executed sequences"
! msgstr ""
! 
! #: config/frv/frv.opt:65
! msgid "Enable conditional moves"
! msgstr ""
! 
! #: config/frv/frv.opt:69
! msgid "Set the target CPU type"
! msgstr ""
! 
! #: config/frv/frv.opt:73
! msgid "Known FR-V CPUs (for use with the -mcpu= option):"
! msgstr ""
! 
! #: config/frv/frv.opt:122
! msgid "Use fp double instructions"
! msgstr ""
! 
! #: config/frv/frv.opt:126
! msgid "Change the ABI to allow double word insns"
! msgstr ""
! 
! #: config/frv/frv.opt:134
! msgid "Just use icc0/fcc0"
! msgstr ""
! 
! #: config/frv/frv.opt:138
! msgid "Only use 32 FPRs"
! msgstr ""
! 
! #: config/frv/frv.opt:142
! msgid "Use 64 FPRs"
! msgstr ""
! 
! #: config/frv/frv.opt:146
! msgid "Only use 32 GPRs"
! msgstr ""
! 
! #: config/frv/frv.opt:150
! msgid "Use 64 GPRs"
! msgstr ""
! 
! #: config/frv/frv.opt:154
! msgid "Enable use of GPREL for read-only data in FDPIC"
! msgstr ""
! 
! #: config/frv/frv.opt:166
! msgid "Enable PIC support for building libraries"
! msgstr ""
! 
! #: config/frv/frv.opt:170
! msgid "Follow the EABI linkage requirements"
! msgstr ""
! 
! #: config/frv/frv.opt:174
! msgid "Disallow direct calls to global functions"
! msgstr ""
! 
! #: config/frv/frv.opt:178
! msgid "Use media instructions"
! msgstr ""
! 
! #: config/frv/frv.opt:182
! msgid "Use multiply add/subtract instructions"
! msgstr ""
! 
! #: config/frv/frv.opt:186
! msgid "Enable optimizing &&/|| in conditional execution"
! msgstr ""
! 
! #: config/frv/frv.opt:190
! msgid "Enable nested conditional execution optimizations"
! msgstr ""
! 
! #: config/frv/frv.opt:195
! msgid "Do not mark ABI switches in e_flags"
! msgstr ""
! 
! #: config/frv/frv.opt:199
! msgid "Remove redundant membars"
! msgstr ""
! 
! #: config/frv/frv.opt:203
! msgid "Pack VLIW instructions"
! msgstr ""
! 
! #: config/frv/frv.opt:207
! msgid "Enable setting GPRs to the result of comparisons"
! msgstr ""
! 
! #: config/frv/frv.opt:211
! msgid "Change the amount of scheduler lookahead"
! msgstr ""
! 
! #: config/frv/frv.opt:219
! msgid "Assume a large TLS segment"
! msgstr ""
! 
! #: config/frv/frv.opt:223
! msgid "Do not assume a large TLS segment"
! msgstr ""
! 
! #: config/frv/frv.opt:228
! msgid "Cause gas to print tomcat statistics"
! msgstr ""
! 
! #: config/frv/frv.opt:233
! msgid "Link with the library-pic libraries"
! msgstr ""
! 
! #: config/frv/frv.opt:237
! msgid "Allow branches to be packed with other instructions"
! msgstr ""
! 
! #: config/mn10300/mn10300.opt:30
! msgid "Target the AM33 processor"
! msgstr ""
! 
! #: config/mn10300/mn10300.opt:34
! msgid "Target the AM33/2.0 processor"
! msgstr ""
! 
! #: config/mn10300/mn10300.opt:38
! msgid "Target the AM34 processor"
! msgstr ""
! 
! #: config/mn10300/mn10300.opt:46
! msgid "Work around hardware multiply bug"
! msgstr ""
! 
! #: config/mn10300/mn10300.opt:55
! msgid "Enable linker relaxations"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:59
! msgid "Return pointers in both a0 and d0"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:63
! msgid "Allow gcc to generate LIW instructions"
  msgstr ""
  
! #: config/mn10300/mn10300.opt:67
! msgid "Allow gcc to generate the SETLB and Lcc instructions"
  msgstr ""
  
! #: config/nds32/nds32.opt:26
! msgid "Generate code in big-endian mode."
  msgstr ""
  
! #: config/nds32/nds32.opt:30
! msgid "Generate code in little-endian mode."
  msgstr ""
  
! #: config/nds32/nds32.opt:34
! msgid "Use reduced-set registers for register allocation."
  msgstr ""
  
! #: config/nds32/nds32.opt:38
! msgid "Use full-set registers for register allocation."
  msgstr ""
  
! #: config/nds32/nds32.opt:42
! msgid "Generate conditional move instructions."
  msgstr ""
  
! #: config/nds32/nds32.opt:46
! msgid "Generate performance extension instructions."
  msgstr ""
  
! #: config/nds32/nds32.opt:50
! msgid "Generate v3 push25/pop25 instructions."
  msgstr ""
  
! #: config/nds32/nds32.opt:54
! msgid "Generate 16-bit instructions."
  msgstr ""
  
! #: config/nds32/nds32.opt:58
! msgid "Specify the size of each interrupt vector, which must be 4 or 16."
  msgstr ""
  
! #: config/nds32/nds32.opt:62
! msgid ""
! "Specify the size of each cache block, which must be a power of 2 between 4 "
! "and 512."
  msgstr ""
  
! #: config/nds32/nds32.opt:66
! msgid "Specify the name of the target architecture."
  msgstr ""
  
! #: config/nds32/nds32.opt:70
! msgid "Known arch types (for use with the -march= option):"
  msgstr ""
  
! #: config/nds32/nds32.opt:83
! msgid "Specify the address generation strategy for code model."
  msgstr ""
  
! #: config/nds32/nds32.opt:87
! msgid "Known cmodel types (for use with the -mcmodel= option):"
  msgstr ""
  
! #: config/nds32/nds32.opt:100
! msgid "Enable constructor/destructor feature."
  msgstr ""
  
! #: config/nds32/nds32.opt:104
! msgid "Guide linker to relax instructions."
  msgstr ""
  
! #: config/iq2000/iq2000.opt:31
! msgid "Specify CPU for code generation purposes"
  msgstr ""
  
! #: config/iq2000/iq2000.opt:47
! msgid "Specify CPU for scheduling purposes"
  msgstr ""
  
! #: config/iq2000/iq2000.opt:51
! msgid "Known IQ2000 CPUs (for use with the -mcpu= option):"
  msgstr ""
  
! #: config/iq2000/iq2000.opt:61 config/mips/mips.opt:142
! msgid "Use ROM instead of RAM"
  msgstr ""
  
! #: config/iq2000/iq2000.opt:70
! msgid "No default crt0.o"
  msgstr ""
  
! #: config/iq2000/iq2000.opt:74 config/mips/mips.opt:397
! msgid "Put uninitialized constants in ROM (needs -membedded-data)"
  msgstr ""
  
! #: config/c6x/c6x-tables.opt:24
! msgid "Known C6X ISAs (for use with the -march= option):"
  msgstr ""
  
! #: config/c6x/c6x.opt:46
! msgid "Valid arguments for the -msdata= option"
  msgstr ""
  
! #: config/c6x/c6x.opt:59
! msgid "Compile for the DSBT shared library ABI"
  msgstr ""
  
! #: config/cris/linux.opt:27
! msgid "Together with -fpic and -fPIC, do not use GOTPLT references"
  msgstr ""
  
! #: config/cris/cris.opt:45
! msgid "Work around bug in multiplication instruction"
  msgstr ""
  
! #: config/cris/cris.opt:51
! msgid "Compile for ETRAX 4 (CRIS v3)"
  msgstr ""
  
! #: config/cris/cris.opt:56
! msgid "Compile for ETRAX 100 (CRIS v8)"
  msgstr ""
  
! #: config/cris/cris.opt:64
! msgid "Emit verbose debug information in assembly code"
  msgstr ""
  
! #: config/cris/cris.opt:71
! msgid "Do not use condition codes from normal instructions"
  msgstr ""
  
! #: config/cris/cris.opt:80
! msgid "Do not emit addressing modes with side-effect assignment"
  msgstr ""
  
! #: config/cris/cris.opt:89
! msgid "Do not tune stack alignment"
  msgstr ""
  
! #: config/cris/cris.opt:98
! msgid "Do not tune writable data alignment"
  msgstr ""
  
! #: config/cris/cris.opt:107
! msgid "Do not tune code and read-only data alignment"
  msgstr ""
  
! #: config/cris/cris.opt:116
! msgid "Align code and data to 32 bits"
  msgstr ""
  
! #: config/cris/cris.opt:133
! msgid "Don't align items in code or data"
  msgstr ""
  
! #: config/cris/cris.opt:142
! msgid "Do not emit function prologue or epilogue"
  msgstr ""
  
! #: config/cris/cris.opt:149
! msgid "Use the most feature-enabling options allowed by other options"
  msgstr ""
  
! #: config/cris/cris.opt:158
! msgid "Override -mbest-lib-options"
  msgstr ""
  
! #: config/cris/cris.opt:165
! msgid "-march=ARCH\tGenerate code for the specified chip or CPU version"
  msgstr ""
  
! #: config/cris/cris.opt:169
! msgid "-mtune=ARCH\tTune alignment for the specified chip or CPU version"
  msgstr ""
  
! #: config/cris/cris.opt:173
! msgid ""
! "-mmax-stackframe=SIZE\tWarn when a stackframe is larger than the specified "
! "size"
  msgstr ""
  
! #: config/cris/cris.opt:180
! msgid ""
! "Emit traps as \"break 8\", default for CRIS v3 and up.  If disabled, calls "
! "to abort() are used."
  msgstr ""
  
! #: config/cris/cris.opt:184
! msgid ""
! "Emit checks causing \"break 8\" instructions to execute when applying atomic "
! "builtins on misaligned memory"
  msgstr ""
  
! #: config/cris/cris.opt:188
  msgid ""
! "Handle atomic builtins that may be applied to unaligned data by calling "
! "library functions. Overrides -mtrap-unaligned-atomic."
! msgstr ""
! 
! #: config/sh/superh.opt:6
! msgid "Board name [and memory region]."
! msgstr ""
! 
! #: config/sh/superh.opt:10
! msgid "Runtime name."
! msgstr ""
! 
! #: config/sh/sh.opt:48
! msgid "Generate SH1 code"
! msgstr ""
! 
! #: config/sh/sh.opt:52
! msgid "Generate SH2 code"
! msgstr ""
! 
! #: config/sh/sh.opt:56
! msgid "Generate default double-precision SH2a-FPU code"
! msgstr ""
! 
! #: config/sh/sh.opt:60
! msgid "Generate SH2a FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:64
! msgid "Generate default single-precision SH2a-FPU code"
  msgstr ""
  
! #: config/sh/sh.opt:68
! msgid "Generate only single-precision SH2a-FPU code"
  msgstr ""
  
! #: config/sh/sh.opt:72
! msgid "Generate SH2e code"
  msgstr ""
  
! #: config/sh/sh.opt:76
! msgid "Generate SH3 code"
  msgstr ""
  
! #: config/sh/sh.opt:80
! msgid "Generate SH3e code"
  msgstr ""
  
! #: config/sh/sh.opt:84
! msgid "Generate SH4 code"
  msgstr ""
  
! #: config/sh/sh.opt:88
! msgid "Generate SH4-100 code"
  msgstr ""
  
! #: config/sh/sh.opt:92
! msgid "Generate SH4-200 code"
  msgstr ""
  
! #: config/sh/sh.opt:98
! msgid "Generate SH4-300 code"
  msgstr ""
  
! #: config/sh/sh.opt:102
! msgid "Generate SH4 FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:106
! msgid "Generate SH4-100 FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:110
! msgid "Generate SH4-200 FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:114
! msgid "Generate SH4-300 FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:118
! msgid "Generate code for SH4 340 series (MMU/FPU-less)"
  msgstr ""
  
! #: config/sh/sh.opt:123
! msgid "Generate code for SH4 400 series (MMU/FPU-less)"
  msgstr ""
  
! #: config/sh/sh.opt:128
! msgid "Generate code for SH4 500 series (FPU-less)."
  msgstr ""
  
! #: config/sh/sh.opt:133
! msgid "Generate default single-precision SH4 code"
  msgstr ""
  
! #: config/sh/sh.opt:137
! msgid "Generate default single-precision SH4-100 code"
  msgstr ""
  
! #: config/sh/sh.opt:141
! msgid "Generate default single-precision SH4-200 code"
  msgstr ""
  
! #: config/sh/sh.opt:145
! msgid "Generate default single-precision SH4-300 code"
  msgstr ""
  
! #: config/sh/sh.opt:149
! msgid "Generate only single-precision SH4 code"
  msgstr ""
  
! #: config/sh/sh.opt:153
! msgid "Generate only single-precision SH4-100 code"
  msgstr ""
  
! #: config/sh/sh.opt:157
! msgid "Generate only single-precision SH4-200 code"
  msgstr ""
  
! #: config/sh/sh.opt:161
! msgid "Generate only single-precision SH4-300 code"
  msgstr ""
  
! #: config/sh/sh.opt:165
! msgid "Generate SH4a code"
  msgstr ""
  
! #: config/sh/sh.opt:169
! msgid "Generate SH4a FPU-less code"
  msgstr ""
  
! #: config/sh/sh.opt:173
! msgid "Generate default single-precision SH4a code"
  msgstr ""
  
! #: config/sh/sh.opt:177
! msgid "Generate only single-precision SH4a code"
  msgstr ""
  
! #: config/sh/sh.opt:181
! msgid "Generate SH4al-dsp code"
  msgstr ""
  
! #: config/sh/sh.opt:185
! msgid "Generate 32-bit SHmedia code"
  msgstr ""
  
! #: config/sh/sh.opt:189
! msgid "Generate 32-bit FPU-less SHmedia code"
  msgstr ""
  
! #: config/sh/sh.opt:193
! msgid "Generate 64-bit SHmedia code"
  msgstr ""
  
! #: config/sh/sh.opt:197
! msgid "Generate 64-bit FPU-less SHmedia code"
  msgstr ""
  
! #: config/sh/sh.opt:201
! msgid "Generate SHcompact code"
  msgstr ""
  
! #: config/sh/sh.opt:205
! msgid "Generate FPU-less SHcompact code"
  msgstr ""
  
! #: config/sh/sh.opt:217
! msgid "Generate code in big endian mode"
  msgstr ""
  
! #: config/sh/sh.opt:221
! msgid "Generate 32-bit offsets in switch tables"
  msgstr ""
  
! #: config/sh/sh.opt:225
! msgid "Generate bit instructions"
  msgstr ""
  
! #: config/sh/sh.opt:229
! msgid "Cost to assume for a branch insn"
  msgstr ""
  
! #: config/sh/sh.opt:233
! msgid "Assume that zero displacement conditional branches are fast"
  msgstr ""
  
! #: config/sh/sh.opt:236 config/sh/sh.opt:240
! #, c-format
! msgid "%qs is deprecated and has no effect"
  msgstr ""
  
! #: config/sh/sh.opt:237
! msgid "Enable cbranchdi4 pattern"
  msgstr ""
  
! #: config/sh/sh.opt:241
! msgid "Emit cmpeqdi_t pattern even when -mcbranchdi is in effect."
  msgstr ""
  
! #: config/sh/sh.opt:245
! msgid "Force the usage of delay slots for conditional branches."
  msgstr ""
  
! #: config/sh/sh.opt:249
! msgid "Enable SH5 cut2 workaround"
  msgstr ""
  
! #: config/sh/sh.opt:253
! msgid "Align doubles at 64-bit boundaries"
  msgstr ""
  
! #: config/sh/sh.opt:257
! msgid ""
! "Division strategy, one of: call, call2, fp, inv, inv:minlat, inv20u, inv20l, "
! "inv:call, inv:call2, inv:fp, call-div1, call-fp, call-table"
  msgstr ""
  
! #: config/sh/sh.opt:261
! msgid "Specify name for 32 bit signed division function"
  msgstr ""
  
! #: config/sh/sh.opt:265
! msgid ""
! "Enable the use of 64-bit floating point registers in fmov instructions.  See "
! "-mdalign if 64-bit alignment is required."
  msgstr ""
  
! #: config/sh/sh.opt:273
! msgid "Cost to assume for gettr insn"
  msgstr ""
  
! #: config/sh/sh.opt:277 config/sh/sh.opt:327
! msgid "Follow Renesas (formerly Hitachi) / SuperH calling conventions"
  msgstr ""
  
! #: config/sh/sh.opt:281
! msgid "Increase the IEEE compliance for floating-point comparisons"
  msgstr ""
  
! #: config/sh/sh.opt:285
! msgid "Enable the use of the indexed addressing mode for SHmedia32/SHcompact"
  msgstr ""
  
! #: config/sh/sh.opt:289
! msgid ""
! "inline code to invalidate instruction cache entries after setting up nested "
! "function trampolines"
  msgstr ""
  
! #: config/sh/sh.opt:293
! msgid "Assume symbols might be invalid"
  msgstr ""
  
! #: config/sh/sh.opt:297 config/arc/arc.opt:183
! msgid "Annotate assembler instructions with estimated addresses"
  msgstr ""
  
! #: config/sh/sh.opt:301
! msgid "Generate code in little endian mode"
  msgstr ""
  
! #: config/sh/sh.opt:305
! msgid "Mark MAC register as call-clobbered"
  msgstr ""
  
! #: config/sh/sh.opt:311
! msgid "Make structs a multiple of 4 bytes (warning: ABI altered)"
  msgstr ""
  
! #: config/sh/sh.opt:315
! msgid "Emit function-calls using global offset table when generating PIC"
  msgstr ""
  
! #: config/sh/sh.opt:319
! msgid "Assume pt* instructions won't trap"
  msgstr ""
  
! #: config/sh/sh.opt:323
! msgid "Shorten address references during linking"
  msgstr ""
  
! #: config/sh/sh.opt:331
! msgid "Deprecated.  Use -matomic= instead to select the atomic model"
  msgstr ""
  
! #: config/sh/sh.opt:335
! msgid "Specify the model for atomic operations"
  msgstr ""
  
! #: config/sh/sh.opt:339
! msgid "Use tas.b instruction for __atomic_test_and_set"
  msgstr ""
  
! #: config/sh/sh.opt:343
! msgid "Deprecated.  Use -Os instead"
  msgstr ""
  
! #: config/sh/sh.opt:347
! msgid "Cost to assume for a multiply insn"
  msgstr ""
  
! #: config/sh/sh.opt:351
! msgid ""
! "Don't generate privileged-mode only code; implies -mno-inline-ic_invalidate "
! "if the inline code would not work in user mode."
  msgstr ""
  
! #: config/sh/sh.opt:357
! msgid "Pretend a branch-around-a-move is a conditional move."
  msgstr ""
  
! #: config/sh/sh.opt:361
! msgid "Enable the use of the fsca instruction"
  msgstr ""
  
! #: config/sh/sh.opt:365
! msgid "Enable the use of the fsrra instruction"
  msgstr ""
  
! #: config/sh/sh.opt:369
! msgid "Use LRA instead of reload (transitional)"
  msgstr ""
  
! #: config/fr30/fr30.opt:23
! msgid "Assume small address space"
  msgstr ""
  
  #: config/mep/mep.opt:23
--- 9595,10186 ----
  msgid "Enable the use of the LRA register allocator."
  msgstr ""
  
! #: config/cr16/cr16.opt:23
! msgid "-msim   Use simulator runtime"
  msgstr ""
  
! #: config/cr16/cr16.opt:27
! msgid "Generate SBIT, CBIT instructions"
  msgstr ""
  
! #: config/cr16/cr16.opt:31
! msgid "Support multiply accumulate instructions"
  msgstr ""
  
! #: config/cr16/cr16.opt:38
! msgid "Treat data references as near, far or medium. medium is default"
  msgstr ""
  
! #: config/cr16/cr16.opt:42
! msgid "Generate code for CR16C architecture"
  msgstr ""
  
! #: config/cr16/cr16.opt:46
! msgid "Generate code for CR16C+ architecture (Default)"
  msgstr ""
  
! #: config/cr16/cr16.opt:50
! msgid "Treat integers as 32-bit."
  msgstr ""
  
! #: config/pa/pa-hpux.opt:27
! msgid "Generate cpp defines for server IO"
  msgstr ""
  
! #: config/pa/pa-hpux.opt:31 config/pa/pa-hpux1131.opt:23
! #: config/pa/pa-hpux1111.opt:23 config/pa/pa-hpux1010.opt:23
! msgid "Specify UNIX standard for predefines and linking"
  msgstr ""
  
! #: config/pa/pa-hpux.opt:35
! msgid "Generate cpp defines for workstation IO"
  msgstr ""
  
! #: config/pa/pa.opt:30 config/pa/pa.opt:83 config/pa/pa.opt:91
! msgid "Generate PA1.0 code"
  msgstr ""
  
! #: config/pa/pa.opt:34 config/pa/pa.opt:95 config/pa/pa.opt:136
! msgid "Generate PA1.1 code"
  msgstr ""
  
! #: config/pa/pa.opt:38 config/pa/pa.opt:99
! msgid "Generate PA2.0 code (requires binutils 2.10 or later)"
  msgstr ""
  
! #: config/pa/pa.opt:46
! msgid "Disable FP regs"
  msgstr ""
  
! #: config/pa/pa.opt:50
! msgid "Disable indexed addressing"
  msgstr ""
  
! #: config/pa/pa.opt:54
! msgid "Generate fast indirect calls"
  msgstr ""
  
! #: config/pa/pa.opt:62
! msgid "Assume code will be assembled by GAS"
  msgstr ""
  
! #: config/pa/pa.opt:71
! msgid "Enable linker optimizations"
  msgstr ""
  
! #: config/pa/pa.opt:75
! msgid "Always generate long calls"
  msgstr ""
  
! #: config/pa/pa.opt:79
! msgid "Emit long load/store sequences"
  msgstr ""
  
! #: config/pa/pa.opt:87
! msgid "Disable space regs"
  msgstr ""
  
! #: config/pa/pa.opt:103
! msgid "Use portable calling conventions"
  msgstr ""
  
! #: config/pa/pa.opt:107
  msgid ""
! "Specify CPU for scheduling purposes.  Valid arguments are 700, 7100, 7100LC, "
! "7200, 7300, and 8000"
  msgstr ""
  
! #: config/pa/pa.opt:132 config/frv/frv.opt:215
! msgid "Use software floating point"
  msgstr ""
  
! #: config/pa/pa.opt:140
! msgid "Do not disable space regs"
  msgstr ""
  
! #: config/pa/pa64-hpux.opt:23
! msgid "Assume code will be linked by GNU ld"
  msgstr ""
  
! #: config/pa/pa64-hpux.opt:27
! msgid "Assume code will be linked by HP ld"
  msgstr ""
  
! #: config/vxworks.opt:36
! msgid "Assume the VxWorks RTP environment"
  msgstr ""
  
! #: config/vxworks.opt:43
! msgid "Assume the VxWorks vThreads environment"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:28
! msgid "The possible TLS dialects:"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:40
! msgid "The code model option names for -mcmodel:"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:68
! msgid "Generate code which uses only the general registers"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:72
! msgid "Workaround for ARM Cortex-A53 Erratum number 835769"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:76
! msgid "Workaround for ARM Cortex-A53 Erratum number 843419"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:84
! msgid "Specify the code model"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:88
! msgid "Don't assume that unaligned accesses are handled by the system"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:96
! msgid "Specify TLS dialect"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:100
! msgid "-march=ARCH\tUse features of architecture ARCH"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:104
! msgid "-mcpu=CPU\tUse features of and optimize for CPU"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:108
! msgid "-mtune=CPU\tOptimize for CPU"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:112
! msgid "-mabi=ABI\tGenerate code that conforms to the specified ABI"
  msgstr ""
  
! #: config/aarch64/aarch64.opt:116
! msgid "Known AArch64 ABIs (for use with the -mabi= option):"
  msgstr ""
  
! #: config/h8300/h8300.opt:23
! msgid "Generate H8S code"
  msgstr ""
  
! #: config/h8300/h8300.opt:27
! msgid "Generate H8SX code"
  msgstr ""
  
! #: config/h8300/h8300.opt:31
! msgid "Generate H8S/2600 code"
  msgstr ""
  
! #: config/h8300/h8300.opt:35
! msgid "Make integers 32 bits wide"
  msgstr ""
  
! #: config/h8300/h8300.opt:42
! msgid "Use registers for argument passing"
  msgstr ""
  
! #: config/h8300/h8300.opt:46
! msgid "Consider access to byte sized memory slow"
  msgstr ""
  
! #: config/h8300/h8300.opt:50
! msgid "Enable linker relaxing"
  msgstr ""
  
! #: config/h8300/h8300.opt:54
! msgid "Generate H8/300H code"
  msgstr ""
  
! #: config/h8300/h8300.opt:58
! msgid "Enable the normal mode"
  msgstr ""
  
! #: config/h8300/h8300.opt:62
! msgid "Use H8/300 alignment rules"
  msgstr ""
  
! #: config/h8300/h8300.opt:66
! msgid "Push extended registers on stack in monitor functions"
  msgstr ""
  
! #: config/h8300/h8300.opt:70
! msgid "Do not push extended registers on stack in monitor functions"
  msgstr ""
  
! #: config/nvptx/nvptx.opt:22
! msgid "Generate code for a 32-bit ABI"
  msgstr ""
  
! #: config/nvptx/nvptx.opt:26
! msgid "Generate code for a 64-bit ABI"
  msgstr ""
  
! #: config/nvptx/nvptx.opt:30
! msgid "Link in code for a __main kernel."
  msgstr ""
  
! #: config/vax/vax.opt:23 config/vax/vax.opt:27
! msgid "Target DFLOAT double precision code"
  msgstr ""
  
! #: config/vax/vax.opt:31 config/vax/vax.opt:35
! msgid "Generate GFLOAT double precision code"
  msgstr ""
  
! #: config/vax/vax.opt:39
! msgid "Generate code for GNU assembler (gas)"
  msgstr ""
  
! #: config/vax/vax.opt:43
! msgid "Generate code for UNIX assembler"
  msgstr ""
  
! #: config/vax/vax.opt:47
! msgid "Use VAXC structure conventions"
  msgstr ""
  
! #: config/vax/vax.opt:51
! msgid "Use new adddi3/subdi3 patterns"
  msgstr ""
  
! #: config/linux.opt:24
! msgid "Use Bionic C library"
  msgstr ""
  
! #: config/linux.opt:28
! msgid "Use GNU C library"
  msgstr ""
  
! #: config/linux.opt:32
! msgid "Use uClibc C library"
  msgstr ""
  
! #: config/mmix/mmix.opt:24
! msgid "For intrinsics library: pass all parameters in registers"
  msgstr ""
  
! #: config/mmix/mmix.opt:28
! msgid "Use register stack for parameters and return value"
  msgstr ""
  
! #: config/mmix/mmix.opt:32
! msgid "Use call-clobbered registers for parameters and return value"
  msgstr ""
  
! #: config/mmix/mmix.opt:37
! msgid "Use epsilon-respecting floating point compare instructions"
  msgstr ""
  
! #: config/mmix/mmix.opt:41
! msgid "Use zero-extending memory loads, not sign-extending ones"
  msgstr ""
  
! #: config/mmix/mmix.opt:45
  msgid ""
! "Generate divide results with reminder having the same sign as the divisor "
! "(not the dividend)"
  msgstr ""
  
! #: config/mmix/mmix.opt:49
! msgid "Prepend global symbols with \":\" (for use with PREFIX)"
  msgstr ""
  
! #: config/mmix/mmix.opt:53
! msgid "Do not provide a default start-address 0x100 of the program"
  msgstr ""
  
! #: config/mmix/mmix.opt:57
! msgid "Link to emit program in ELF format (rather than mmo)"
  msgstr ""
  
! #: config/mmix/mmix.opt:61
! msgid "Use P-mnemonics for branches statically predicted as taken"
  msgstr ""
  
! #: config/mmix/mmix.opt:65
! msgid "Don't use P-mnemonics for branches"
  msgstr ""
  
! #: config/mmix/mmix.opt:79
! msgid "Use addresses that allocate global registers"
  msgstr ""
  
! #: config/mmix/mmix.opt:83
! msgid "Do not use addresses that allocate global registers"
  msgstr ""
  
! #: config/mmix/mmix.opt:87
! msgid "Generate a single exit point for each function"
  msgstr ""
  
! #: config/mmix/mmix.opt:91
! msgid "Do not generate a single exit point for each function"
  msgstr ""
  
! #: config/mmix/mmix.opt:95
! msgid "Set start-address of the program"
  msgstr ""
  
! #: config/mmix/mmix.opt:99
! msgid "Set start-address of data"
  msgstr ""
  
! #: config/fr30/fr30.opt:23
! msgid "Assume small address space"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:23
! msgid "Generate code for an 11/10"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:27
! msgid "Generate code for an 11/40"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:31
! msgid "Generate code for an 11/45"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:35
! msgid "Return floating-point results in ac0 (fr0 in Unix assembler syntax)"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:39
! msgid "Do not use inline patterns for copying memory"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:43
! msgid "Use inline patterns for copying memory"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:47
! msgid "Do not pretend that branches are expensive"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:51
! msgid "Pretend that branches are expensive"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:55
! msgid "Use the DEC assembler syntax"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:59
! msgid "Use 32 bit float"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:63
! msgid "Use 64 bit float"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:67 config/frv/frv.opt:158
! #: config/rs6000/rs6000.opt:177
! msgid "Use hardware floating point"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:71
! msgid "Use 16 bit int"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:75
! msgid "Use 32 bit int"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:79 config/rs6000/rs6000.opt:173
! msgid "Do not use hardware floating point"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:83
! msgid "Target has split I&D"
  msgstr ""
  
! #: config/pdp11/pdp11.opt:87
! msgid "Use UNIX assembler syntax"
  msgstr ""
  
! #: config/frv/frv.opt:30
! msgid "Use 4 media accumulators"
  msgstr ""
  
! #: config/frv/frv.opt:34
! msgid "Use 8 media accumulators"
  msgstr ""
  
! #: config/frv/frv.opt:38
! msgid "Enable label alignment optimizations"
  msgstr ""
  
! #: config/frv/frv.opt:42
! msgid "Dynamically allocate cc registers"
  msgstr ""
  
! #: config/frv/frv.opt:49
! msgid "Set the cost of branches"
  msgstr ""
  
! #: config/frv/frv.opt:53
! msgid "Enable conditional execution other than moves/scc"
  msgstr ""
  
! #: config/frv/frv.opt:57
! msgid "Change the maximum length of conditionally-executed sequences"
  msgstr ""
  
! #: config/frv/frv.opt:61
! msgid ""
! "Change the number of temporary registers that are available to conditionally-"
! "executed sequences"
  msgstr ""
  
! #: config/frv/frv.opt:65
! msgid "Enable conditional moves"
  msgstr ""
  
! #: config/frv/frv.opt:69
! msgid "Set the target CPU type"
  msgstr ""
  
! #: config/frv/frv.opt:73
! msgid "Known FR-V CPUs (for use with the -mcpu= option):"
  msgstr ""
  
! #: config/frv/frv.opt:122
! msgid "Use fp double instructions"
  msgstr ""
  
! #: config/frv/frv.opt:126
! msgid "Change the ABI to allow double word insns"
  msgstr ""
  
! #: config/frv/frv.opt:130 config/bfin/bfin.opt:90
! msgid "Enable Function Descriptor PIC mode"
  msgstr ""
  
! #: config/frv/frv.opt:134
! msgid "Just use icc0/fcc0"
  msgstr ""
  
! #: config/frv/frv.opt:138
! msgid "Only use 32 FPRs"
  msgstr ""
  
! #: config/frv/frv.opt:142
! msgid "Use 64 FPRs"
  msgstr ""
  
! #: config/frv/frv.opt:146
! msgid "Only use 32 GPRs"
  msgstr ""
  
! #: config/frv/frv.opt:150
! msgid "Use 64 GPRs"
  msgstr ""
  
! #: config/frv/frv.opt:154
! msgid "Enable use of GPREL for read-only data in FDPIC"
  msgstr ""
  
! #: config/frv/frv.opt:162 config/bfin/bfin.opt:94
! msgid "Enable inlining of PLT in function calls"
  msgstr ""
  
! #: config/frv/frv.opt:166
! msgid "Enable PIC support for building libraries"
  msgstr ""
  
! #: config/frv/frv.opt:170
! msgid "Follow the EABI linkage requirements"
  msgstr ""
  
! #: config/frv/frv.opt:174
! msgid "Disallow direct calls to global functions"
  msgstr ""
  
! #: config/frv/frv.opt:178
! msgid "Use media instructions"
  msgstr ""
  
! #: config/frv/frv.opt:182
! msgid "Use multiply add/subtract instructions"
  msgstr ""
  
! #: config/frv/frv.opt:186
! msgid "Enable optimizing &&/|| in conditional execution"
  msgstr ""
  
! #: config/frv/frv.opt:190
! msgid "Enable nested conditional execution optimizations"
  msgstr ""
  
! #: config/frv/frv.opt:195
! msgid "Do not mark ABI switches in e_flags"
  msgstr ""
  
! #: config/frv/frv.opt:199
! msgid "Remove redundant membars"
  msgstr ""
  
! #: config/frv/frv.opt:203
! msgid "Pack VLIW instructions"
  msgstr ""
  
! #: config/frv/frv.opt:207
! msgid "Enable setting GPRs to the result of comparisons"
  msgstr ""
  
! #: config/frv/frv.opt:211
! msgid "Change the amount of scheduler lookahead"
  msgstr ""
  
! #: config/frv/frv.opt:219
! msgid "Assume a large TLS segment"
  msgstr ""
  
! #: config/frv/frv.opt:223
! msgid "Do not assume a large TLS segment"
  msgstr ""
  
! #: config/frv/frv.opt:228
! msgid "Cause gas to print tomcat statistics"
  msgstr ""
  
! #: config/frv/frv.opt:233
! msgid "Link with the library-pic libraries"
  msgstr ""
  
! #: config/frv/frv.opt:237
! msgid "Allow branches to be packed with other instructions"
  msgstr ""
  
! #: config/tilegx/tilegx.opt:30
! msgid "Known TILE-Gx CPUs (for use with the -mcpu= option):"
  msgstr ""
  
! #: config/tilegx/tilegx.opt:37
! msgid "Compile with 32 bit longs and pointers."
  msgstr ""
  
! #: config/tilegx/tilegx.opt:41
! msgid "Compile with 64 bit longs and pointers."
  msgstr ""
  
! #: config/tilegx/tilegx.opt:45
! msgid "Use big-endian byte order."
  msgstr ""
  
! #: config/tilegx/tilegx.opt:49
! msgid "Use little-endian byte order."
  msgstr ""
  
! #: config/tilegx/tilegx.opt:53
! msgid "Use given TILE-Gx code model"
  msgstr ""
  
  #: config/mep/mep.opt:23
*************** msgstr ""
*** 12219,13023 ****
  msgid "Variables this size and smaller go in the tiny section. (default 4)"
  msgstr ""
  
! #: config/mips/mips.opt:32
! msgid "-mabi=ABI\tGenerate code that conforms to the given ABI"
  msgstr ""
  
! #: config/mips/mips.opt:36
! msgid "Known MIPS ABIs (for use with the -mabi= option):"
  msgstr ""
  
! #: config/mips/mips.opt:55
! msgid "Generate code that can be used in SVR4-style dynamic objects"
  msgstr ""
  
! #: config/mips/mips.opt:59
! msgid "Use PMC-style 'mad' instructions"
  msgstr ""
  
! #: config/mips/mips.opt:63
! msgid "Use integer madd/msub instructions"
  msgstr ""
  
! #: config/mips/mips.opt:67
! msgid "-march=ISA\tGenerate code for the given ISA"
  msgstr ""
  
! #: config/mips/mips.opt:71
  msgid ""
! "-mbranch-cost=COST\tSet the cost of branches to roughly COST instructions"
! msgstr ""
! 
! #: config/mips/mips.opt:75
! msgid "Use Branch Likely instructions, overriding the architecture default"
  msgstr ""
  
! #: config/mips/mips.opt:79
! msgid "Switch on/off MIPS16 ASE on alternating functions for compiler testing"
  msgstr ""
  
! #: config/mips/mips.opt:83
! msgid "Trap on integer divide by zero"
  msgstr ""
  
! #: config/mips/mips.opt:87
  msgid ""
! "-mcode-readable=SETTING\tSpecify when instructions are allowed to access code"
  msgstr ""
  
! #: config/mips/mips.opt:91
! msgid "Valid arguments to -mcode-readable=:"
  msgstr ""
  
! #: config/mips/mips.opt:104
! msgid "Use branch-and-break sequences to check for integer divide by zero"
  msgstr ""
  
! #: config/mips/mips.opt:108
! msgid "Use trap instructions to check for integer divide by zero"
  msgstr ""
  
! #: config/mips/mips.opt:112
! msgid "Allow the use of MDMX instructions"
  msgstr ""
  
! #: config/mips/mips.opt:116
! msgid ""
! "Allow hardware floating-point instructions to cover both 32-bit and 64-bit "
! "operations"
  msgstr ""
  
! #: config/mips/mips.opt:120
! msgid "Use MIPS-DSP instructions"
  msgstr ""
  
! #: config/mips/mips.opt:124
! msgid "Use MIPS-DSP REV 2 instructions"
  msgstr ""
  
! #: config/mips/mips.opt:146
! msgid "Use Enhanced Virtual Addressing instructions"
  msgstr ""
  
! #: config/mips/mips.opt:150
! msgid "Use NewABI-style %reloc() assembly operators"
  msgstr ""
  
! #: config/mips/mips.opt:154
! msgid "Use -G for data that is not defined by the current object"
  msgstr ""
  
! #: config/mips/mips.opt:158
! msgid "Work around certain 24K errata"
  msgstr ""
  
! #: config/mips/mips.opt:162
! msgid "Work around certain R4000 errata"
  msgstr ""
  
! #: config/mips/mips.opt:166
! msgid "Work around certain R4400 errata"
  msgstr ""
  
! #: config/mips/mips.opt:170
! msgid "Work around certain RM7000 errata"
  msgstr ""
  
! #: config/mips/mips.opt:174
! msgid "Work around certain R10000 errata"
  msgstr ""
  
! #: config/mips/mips.opt:178
! msgid "Work around errata for early SB-1 revision 2 cores"
  msgstr ""
  
! #: config/mips/mips.opt:182
! msgid "Work around certain VR4120 errata"
  msgstr ""
  
! #: config/mips/mips.opt:186
! msgid "Work around VR4130 mflo/mfhi errata"
  msgstr ""
  
! #: config/mips/mips.opt:190
! msgid "Work around an early 4300 hardware bug"
  msgstr ""
  
! #: config/mips/mips.opt:194
! msgid "FP exceptions are enabled"
  msgstr ""
  
! #: config/mips/mips.opt:198
! msgid "Use 32-bit floating-point registers"
  msgstr ""
  
! #: config/mips/mips.opt:202
! msgid "Conform to the o32 FPXX ABI"
  msgstr ""
  
! #: config/mips/mips.opt:206
! msgid "Use 64-bit floating-point registers"
  msgstr ""
  
! #: config/mips/mips.opt:210
  msgid ""
! "-mflush-func=FUNC\tUse FUNC to flush the cache before calling stack "
! "trampolines"
! msgstr ""
! 
! #: config/mips/mips.opt:214
! msgid "Generate floating-point multiply-add instructions"
  msgstr ""
  
! #: config/mips/mips.opt:218
! msgid "-mabs=MODE\tSelect the IEEE 754 ABS/NEG instruction execution mode"
  msgstr ""
  
! #: config/mips/mips.opt:222
! msgid "-mnan=ENCODING\tSelect the IEEE 754 NaN data encoding"
  msgstr ""
  
! #: config/mips/mips.opt:226
  msgid ""
! "Known MIPS IEEE 754 settings (for use with the -mabs= and -mnan= options):"
  msgstr ""
  
! #: config/mips/mips.opt:236
! msgid "Use 32-bit general registers"
  msgstr ""
  
! #: config/mips/mips.opt:240
! msgid "Use 64-bit general registers"
  msgstr ""
  
! #: config/mips/mips.opt:244
! msgid "Use GP-relative addressing to access small data"
  msgstr ""
  
! #: config/mips/mips.opt:248
! msgid ""
! "When generating -mabicalls code, allow executables to use PLTs and copy "
! "relocations"
  msgstr ""
  
! #: config/mips/mips.opt:252
! msgid "Allow the use of hardware floating-point ABI and instructions"
  msgstr ""
  
! #: config/mips/mips.opt:256
! msgid "Generate code that is link-compatible with MIPS16 and microMIPS code."
  msgstr ""
  
! #: config/mips/mips.opt:260
! msgid "An alias for minterlink-compressed provided for backward-compatibility."
  msgstr ""
  
! #: config/mips/mips.opt:264
! msgid "-mipsN\tGenerate code for ISA level N"
  msgstr ""
  
! #: config/mips/mips.opt:268
! msgid "Generate MIPS16 code"
  msgstr ""
  
! #: config/mips/mips.opt:272
! msgid "Use MIPS-3D instructions"
  msgstr ""
  
! #: config/mips/mips.opt:276
! msgid "Use ll, sc and sync instructions"
  msgstr ""
  
! #: config/mips/mips.opt:280
! msgid "Use -G for object-local data"
  msgstr ""
  
! #: config/mips/mips.opt:284
! msgid "Use indirect calls"
  msgstr ""
  
! #: config/mips/mips.opt:288
! msgid "Use a 32-bit long type"
  msgstr ""
  
! #: config/mips/mips.opt:292
! msgid "Use a 64-bit long type"
  msgstr ""
  
! #: config/mips/mips.opt:296
! msgid "Pass the address of the ra save location to _mcount in $12"
  msgstr ""
  
! #: config/mips/mips.opt:300
! msgid "Don't optimize block moves"
  msgstr ""
  
! #: config/mips/mips.opt:304
! msgid "Use microMIPS instructions"
  msgstr ""
  
! #: config/mips/mips.opt:308
! msgid "Allow the use of MT instructions"
  msgstr ""
  
! #: config/mips/mips.opt:312
! msgid "Prevent the use of all floating-point operations"
  msgstr ""
  
! #: config/mips/mips.opt:316
! msgid "Use MCU instructions"
  msgstr ""
  
! #: config/mips/mips.opt:320
! msgid "Do not use a cache-flushing function before calling stack trampolines"
  msgstr ""
  
! #: config/mips/mips.opt:324
! msgid "Do not use MDMX instructions"
  msgstr ""
  
! #: config/mips/mips.opt:328
! msgid "Generate normal-mode code"
  msgstr ""
  
! #: config/mips/mips.opt:332
! msgid "Do not use MIPS-3D instructions"
  msgstr ""
  
! #: config/mips/mips.opt:336
! msgid "Use paired-single floating-point instructions"
  msgstr ""
  
! #: config/mips/mips.opt:340
! msgid ""
! "-mr10k-cache-barrier=SETTING\tSpecify when r10k cache barriers should be "
! "inserted"
  msgstr ""
  
! #: config/mips/mips.opt:344
! msgid "Valid arguments to -mr10k-cache-barrier=:"
  msgstr ""
  
! #: config/mips/mips.opt:357
! msgid "Try to allow the linker to turn PIC calls into direct calls"
  msgstr ""
  
! #: config/mips/mips.opt:361
  msgid ""
! "When generating -mabicalls code, make the code suitable for use in shared "
! "libraries"
  msgstr ""
  
! #: config/mips/mips.opt:365
! msgid ""
! "Restrict the use of hardware floating-point instructions to 32-bit operations"
  msgstr ""
  
! #: config/mips/mips.opt:369
! msgid "Use SmartMIPS instructions"
  msgstr ""
  
! #: config/mips/mips.opt:373
! msgid "Prevent the use of all hardware floating-point instructions"
  msgstr ""
  
! #: config/mips/mips.opt:377
! msgid "Optimize lui/addiu address loads"
  msgstr ""
  
! #: config/mips/mips.opt:381
! msgid "Assume all symbols have 32-bit values"
  msgstr ""
  
! #: config/mips/mips.opt:385
! msgid "Use synci instruction to invalidate i-cache"
  msgstr ""
  
! #: config/mips/mips.opt:393
! msgid "-mtune=PROCESSOR\tOptimize the output for PROCESSOR"
  msgstr ""
  
! #: config/mips/mips.opt:401
! msgid "Use Virtualization Application Specific instructions"
  msgstr ""
  
! #: config/mips/mips.opt:405
! msgid "Use eXtended Physical Address (XPA) instructions"
  msgstr ""
  
! #: config/mips/mips.opt:409
! msgid "Perform VR4130-specific alignment optimizations"
  msgstr ""
  
! #: config/mips/mips.opt:413
! msgid "Lift restrictions on GOT size"
  msgstr ""
  
! #: config/mips/mips.opt:417
! msgid "Enable use of odd-numbered single-precision registers"
  msgstr ""
  
! #: config/mips/mips-tables.opt:24
! msgid "Known MIPS CPUs (for use with the -march= and -mtune= options):"
  msgstr ""
  
! #: config/mips/mips-tables.opt:28
! msgid "Known MIPS ISA levels (for use with the -mips option):"
  msgstr ""
  
! #: config/tilegx/tilegx.opt:30
! msgid "Known TILE-Gx CPUs (for use with the -mcpu= option):"
  msgstr ""
  
! #: config/tilegx/tilegx.opt:37
! msgid "Compile with 32 bit longs and pointers."
  msgstr ""
  
! #: config/tilegx/tilegx.opt:41
! msgid "Compile with 64 bit longs and pointers."
  msgstr ""
  
! #: config/tilegx/tilegx.opt:45
! msgid "Use big-endian byte order."
  msgstr ""
  
! #: config/tilegx/tilegx.opt:49
! msgid "Use little-endian byte order."
  msgstr ""
  
! #: config/tilegx/tilegx.opt:53
! msgid "Use given TILE-Gx code model"
  msgstr ""
  
! #: config/arc/arc.opt:26
! msgid "Compile code for big endian mode"
  msgstr ""
  
! #: config/arc/arc.opt:30
! msgid "Compile code for little endian mode.  This is the default"
  msgstr ""
  
! #: config/arc/arc.opt:34
! msgid ""
! "Disable ARCompact specific pass to generate conditional execution "
! "instructions"
  msgstr ""
  
! #: config/arc/arc.opt:38
! msgid "Generate ARCompact 32-bit code for ARCtangent-A5 processor"
  msgstr ""
  
! #: config/arc/arc.opt:42
! msgid "Generate ARCompact 32-bit code for ARC600 processor"
  msgstr ""
  
! #: config/arc/arc.opt:46
! msgid "Same as -mA6"
  msgstr ""
  
! #: config/arc/arc.opt:50
! msgid "Generate ARCompact 32-bit code for ARC601 processor"
  msgstr ""
  
! #: config/arc/arc.opt:54
! msgid "Generate ARCompact 32-bit code for ARC700 processor"
  msgstr ""
  
! #: config/arc/arc.opt:58
! msgid "Same as -mA7"
  msgstr ""
  
! #: config/arc/arc.opt:62
! msgid "Tweak register allocation to help 16-bit instruction generation"
  msgstr ""
  
! #: config/arc/arc.opt:72
! msgid "Use ordinarily cached memory accesses for volatile references"
  msgstr ""
  
! #: config/arc/arc.opt:76
! msgid "Enable cache bypass for volatile references"
  msgstr ""
  
! #: config/arc/arc.opt:80
! msgid "Generate instructions supported by barrel shifter"
  msgstr ""
  
! #: config/arc/arc.opt:84
! msgid "Generate norm instruction"
  msgstr ""
  
! #: config/arc/arc.opt:88
! msgid "Generate swap instruction"
  msgstr ""
  
! #: config/arc/arc.opt:92
! msgid "Generate mul64 and mulu64 instructions"
  msgstr ""
  
! #: config/arc/arc.opt:96
! msgid "Do not generate mpy instructions for ARC700"
  msgstr ""
  
! #: config/arc/arc.opt:100
! msgid ""
! "Generate Extended arithmetic instructions.  Currently only divaw, adds, subs "
! "and sat16 are supported"
  msgstr ""
  
! #: config/arc/arc.opt:104
! msgid ""
! "Dummy flag. This is the default unless FPX switches are provided explicitly"
  msgstr ""
  
! #: config/arc/arc.opt:108
! msgid "Generate call insns as register indirect calls"
  msgstr ""
  
! #: config/arc/arc.opt:112
! msgid "Do no generate BRcc instructions in arc_reorg."
  msgstr ""
  
! #: config/arc/arc.opt:116
! msgid ""
! "Generate sdata references.  This is the default, unless you compile for PIC."
  msgstr ""
  
! #: config/arc/arc.opt:120
! msgid "Do not generate millicode thunks (needed only with -Os)"
  msgstr ""
  
! #: config/arc/arc.opt:124 config/arc/arc.opt:128
! msgid "FPX: Generate Single Precision FPX (compact) instructions."
  msgstr ""
  
! #: config/arc/arc.opt:132
! msgid "FPX: Generate Single Precision FPX (fast) instructions."
  msgstr ""
  
! #: config/arc/arc.opt:136
! msgid ""
! "FPX: Enable Argonaut ARC CPU Double Precision Floating Point extensions."
  msgstr ""
  
! #: config/arc/arc.opt:140 config/arc/arc.opt:144
! msgid "FPX: Generate Double Precision FPX (compact) instructions."
  msgstr ""
  
! #: config/arc/arc.opt:148
! msgid "FPX: Generate Double Precision FPX (fast) instructions."
  msgstr ""
  
! #: config/arc/arc.opt:152
! msgid "Disable LR and SR instructions from using FPX extension aux registers."
  msgstr ""
  
! #: config/arc/arc.opt:156
  msgid ""
! "Enable generation of ARC SIMD instructions via target-specific builtins."
  msgstr ""
  
! #: config/arc/arc.opt:160
! msgid "-mcpu=CPU\tCompile code for ARC variant CPU"
  msgstr ""
  
! #: config/arc/arc.opt:179
! msgid ""
! "size optimization level: 0:none 1:opportunistic 2: regalloc 3:drop align, -Os"
  msgstr ""
  
! #: config/arc/arc.opt:187
  msgid ""
! "Cost to assume for a multiply instruction, with 4 being equal to a normal "
! "insn."
  msgstr ""
  
! #: config/arc/arc.opt:191
! msgid "Tune for ARC600 cpu."
  msgstr ""
  
! #: config/arc/arc.opt:195
! msgid "Tune for ARC601 cpu."
  msgstr ""
  
! #: config/arc/arc.opt:199
! msgid "Tune for ARC700 R4.2 Cpu with standard multiplier block."
  msgstr ""
  
! #: config/arc/arc.opt:203 config/arc/arc.opt:207 config/arc/arc.opt:211
! msgid "Tune for ARC700 R4.2 Cpu with XMAC block."
  msgstr ""
  
! #: config/arc/arc.opt:215
! msgid "Enable the use of indexed loads"
  msgstr ""
  
! #: config/arc/arc.opt:219
! msgid "Enable the use of pre/post modify with register displacement."
  msgstr ""
  
! #: config/arc/arc.opt:223
! msgid "Generate 32x16 multiply and mac instructions"
  msgstr ""
  
! #: config/arc/arc.opt:229
! msgid "Set probability threshold for unaligning branches"
  msgstr ""
  
! #: config/arc/arc.opt:233
! msgid "Don't use less than 25 bit addressing range for calls."
  msgstr ""
  
! #: config/arc/arc.opt:237
  msgid ""
! "Explain what alignment considerations lead to the decision to make an insn "
! "short or long."
  msgstr ""
  
! #: config/arc/arc.opt:241
! msgid "Do alignment optimizations for call instructions."
  msgstr ""
  
! #: config/arc/arc.opt:245
! msgid ""
! "Enable Rcq constraint handling - most short code generation depends on this."
  msgstr ""
  
! #: config/arc/arc.opt:249
! msgid "Enable Rcw constraint handling - ccfsm condexec mostly depends on this."
  msgstr ""
  
! #: config/arc/arc.opt:253
! msgid "Enable pre-reload use of cbranchsi pattern"
  msgstr ""
  
! #: config/arc/arc.opt:257
! msgid "Enable bbit peephole2"
  msgstr ""
  
! #: config/arc/arc.opt:261
  msgid ""
! "Use pc-relative switch case tables - this enables case table shortening."
  msgstr ""
  
! #: config/arc/arc.opt:265
! msgid "Enable compact casesi pattern"
  msgstr ""
  
! #: config/arc/arc.opt:269
! msgid "Enable 'q' instruction alternatives."
  msgstr ""
  
! #: config/arc/arc.opt:273
! msgid "Expand adddi3 and subdi3 at rtl generation time into add.f / adc etc."
  msgstr ""
  
! #: config/arc/arc.opt:280
! msgid "Enable variable polynomial CRC extension"
  msgstr ""
  
! #: config/arc/arc.opt:284
! msgid "Enable DSP 3.1 Pack A extensions"
  msgstr ""
  
! #: config/arc/arc.opt:288
! msgid "Enable dual viterbi butterfly extension"
  msgstr ""
  
! #: config/arc/arc.opt:298
! msgid "Enable Dual and Single Operand Instructions for Telephony"
  msgstr ""
  
! #: config/arc/arc.opt:302
! msgid "Enable XY Memory extension (DSP version 3)"
  msgstr ""
  
! #: config/arc/arc.opt:307
! msgid "Enable Locked Load/Store Conditional extension"
  msgstr ""
  
! #: config/arc/arc.opt:311
! msgid "Enable swap byte ordering extension instruction"
  msgstr ""
  
! #: config/arc/arc.opt:315
! msgid "Enable 64-bit Time-Stamp Counter extension instruction"
  msgstr ""
  
! #: config/arc/arc.opt:319
! msgid "Disable generation of cfi for epilogues."
  msgstr ""
  
! #: config/arc/arc.opt:323
! msgid "Enable generation of cfi for epilogues."
  msgstr ""
  
! #: config/arc/arc.opt:327
! msgid "Pass -EB option through to linker."
  msgstr ""
  
! #: config/arc/arc.opt:331
! msgid "Pass -EL option through to linker."
  msgstr ""
  
! #: config/arc/arc.opt:335
! msgid "Pass -marclinux option through to linker."
  msgstr ""
  
! #: config/arc/arc.opt:339
! msgid "Pass -marclinux_prof option through to linker."
  msgstr ""
  
! #: config/arc/arc.opt:347
! msgid "Enable lra"
  msgstr ""
  
! #: config/arc/arc.opt:351
! msgid "Don't indicate any priority with TARGET_REGISTER_PRIORITY"
  msgstr ""
  
! #: config/arc/arc.opt:355
! msgid "Indicate priority for r0..r3 / r12..r15 with TARGET_REGISTER_PRIORITY"
  msgstr ""
  
! #: config/arc/arc.opt:359
! msgid "Reduce priority for r0..r3 / r12..r15 with TARGET_REGISTER_PRIORITY"
  msgstr ""
  
! #: config/arc/arc.opt:363
! msgid "instrument with mcount calls as in the ucb code"
  msgstr ""
  
! #: java/lang.opt:122
! msgid "Warn if deprecated empty statements are found"
  msgstr ""
  
! #: java/lang.opt:126
! msgid "Warn if .class files are out of date"
  msgstr ""
  
! #: java/lang.opt:130
! msgid "Warn if modifiers are specified when not necessary"
  msgstr ""
  
! #: java/lang.opt:150
! msgid "--CLASSPATH\tDeprecated; use --classpath instead"
  msgstr ""
  
! #: java/lang.opt:157
! msgid "Permit the use of the assert keyword"
  msgstr ""
  
! #: java/lang.opt:179
! msgid "--bootclasspath=<path>\tReplace system path"
  msgstr ""
  
! #: java/lang.opt:183
! msgid "Generate checks for references to NULL"
  msgstr ""
  
! #: java/lang.opt:187
! msgid "--classpath=<path>\tSet class path"
  msgstr ""
  
! #: java/lang.opt:194
! msgid "Output a class file"
  msgstr ""
  
! #: java/lang.opt:198
! msgid "Alias for -femit-class-file"
  msgstr ""
  
! #: java/lang.opt:202
! msgid ""
! "--encoding=<encoding>\tChoose input encoding (defaults from your locale)"
  msgstr ""
  
! #: java/lang.opt:206
! msgid "--extdirs=<path>\tSet the extension directory path"
  msgstr ""
  
! #: java/lang.opt:216
! msgid "Input file is a file with a list of filenames to compile"
  msgstr ""
  
! #: java/lang.opt:223
! msgid "Always check for non gcj generated classes archives"
  msgstr ""
  
! #: java/lang.opt:227
  msgid ""
! "Assume the runtime uses a hash table to map an object to its synchronization "
! "structure"
  msgstr ""
  
! #: java/lang.opt:231
! msgid "Generate instances of Class at runtime"
  msgstr ""
  
! #: java/lang.opt:235
! msgid "Use offset tables for virtual method calls"
  msgstr ""
  
! #: java/lang.opt:242
! msgid "Assume native functions are implemented using JNI"
  msgstr ""
  
! #: java/lang.opt:246
! msgid "Enable optimization of static class initialization code"
  msgstr ""
  
! #: java/lang.opt:253
! msgid "Reduce the amount of reflection meta-data generated"
  msgstr ""
  
! #: java/lang.opt:257
! msgid "Enable assignability checks for stores into object arrays"
  msgstr ""
  
! #: java/lang.opt:261
! msgid "Generate code for the Boehm GC"
  msgstr ""
  
! #: java/lang.opt:265
! msgid "Call a library routine to do integer divisions"
  msgstr ""
  
! #: java/lang.opt:269
! msgid "Generate code for built-in atomic operations"
  msgstr ""
  
! #: java/lang.opt:273
! msgid "Generated should be loaded by bootstrap loader"
  msgstr ""
  
! #: java/lang.opt:277
! msgid "Set the source language version"
  msgstr ""
  
! #: java/lang.opt:281
! msgid "Set the target VM version"
  msgstr ""
  
! #: lto/lang.opt:29
! msgid "Run the link-time optimizer in local transformation (LTRANS) mode."
  msgstr ""
  
! #: lto/lang.opt:33
! msgid "Specify a file to which a list of files output by LTRANS is written."
  msgstr ""
  
! #: lto/lang.opt:37
! msgid "Run the link-time optimizer in whole program analysis (WPA) mode."
  msgstr ""
  
! #: lto/lang.opt:41
  msgid ""
! "Whole program analysis (WPA) mode with number of parallel jobs specified."
  msgstr ""
  
! #: lto/lang.opt:45
! msgid "The resolution file"
  msgstr ""
  
  #: common.opt:282
--- 10295,11116 ----
  msgid "Variables this size and smaller go in the tiny section. (default 4)"
  msgstr ""
  
! #: config/lynx.opt:23
! msgid "Support legacy multi-threading"
  msgstr ""
  
! #: config/lynx.opt:27
! msgid "Use shared libraries"
  msgstr ""
  
! #: config/lynx.opt:31
! msgid "Support multi-threading"
  msgstr ""
  
! #: config/stormy16/stormy16.opt:24
! msgid "Provide libraries for the simulator"
  msgstr ""
  
! #: config/bfin/bfin.opt:48
! msgid "Omit frame pointer for leaf functions"
  msgstr ""
  
! #: config/bfin/bfin.opt:52
! msgid "Program is entirely located in low 64k of memory"
  msgstr ""
  
! #: config/bfin/bfin.opt:56
  msgid ""
! "Work around a hardware anomaly by adding a number of NOPs before a CSYNC or "
! "SSYNC instruction."
  msgstr ""
  
! #: config/bfin/bfin.opt:61
! msgid "Avoid speculative loads to work around a hardware anomaly."
  msgstr ""
  
! #: config/bfin/bfin.opt:65
! msgid "Enabled ID based shared library"
  msgstr ""
  
! #: config/bfin/bfin.opt:69
  msgid ""
! "Generate code that won't be linked against any other ID shared libraries, "
! "but may be used as a shared library."
  msgstr ""
  
! #: config/bfin/bfin.opt:86
! msgid "Link with the fast floating-point library"
  msgstr ""
  
! #: config/bfin/bfin.opt:98
! msgid "Do stack checking using bounds in L1 scratch memory"
  msgstr ""
  
! #: config/bfin/bfin.opt:102
! msgid "Enable multicore support"
  msgstr ""
  
! #: config/bfin/bfin.opt:106
! msgid "Build for Core A"
  msgstr ""
  
! #: config/bfin/bfin.opt:110
! msgid "Build for Core B"
  msgstr ""
  
! #: config/bfin/bfin.opt:114
! msgid "Build for SDRAM"
  msgstr ""
  
! #: config/bfin/bfin.opt:118
! msgid "Assume ICPLBs are enabled at runtime."
  msgstr ""
  
! #: config/cris/cris.opt:45
! msgid "Work around bug in multiplication instruction"
  msgstr ""
  
! #: config/cris/cris.opt:51
! msgid "Compile for ETRAX 4 (CRIS v3)"
  msgstr ""
  
! #: config/cris/cris.opt:56
! msgid "Compile for ETRAX 100 (CRIS v8)"
  msgstr ""
  
! #: config/cris/cris.opt:64
! msgid "Emit verbose debug information in assembly code"
  msgstr ""
  
! #: config/cris/cris.opt:71
! msgid "Do not use condition codes from normal instructions"
  msgstr ""
  
! #: config/cris/cris.opt:80
! msgid "Do not emit addressing modes with side-effect assignment"
  msgstr ""
  
! #: config/cris/cris.opt:89
! msgid "Do not tune stack alignment"
  msgstr ""
  
! #: config/cris/cris.opt:98
! msgid "Do not tune writable data alignment"
  msgstr ""
  
! #: config/cris/cris.opt:107
! msgid "Do not tune code and read-only data alignment"
  msgstr ""
  
! #: config/cris/cris.opt:116
! msgid "Align code and data to 32 bits"
  msgstr ""
  
! #: config/cris/cris.opt:133
! msgid "Don't align items in code or data"
  msgstr ""
  
! #: config/cris/cris.opt:142
! msgid "Do not emit function prologue or epilogue"
  msgstr ""
  
! #: config/cris/cris.opt:149
! msgid "Use the most feature-enabling options allowed by other options"
  msgstr ""
  
! #: config/cris/cris.opt:158
! msgid "Override -mbest-lib-options"
  msgstr ""
  
! #: config/cris/cris.opt:165
! msgid "-march=ARCH\tGenerate code for the specified chip or CPU version"
  msgstr ""
  
! #: config/cris/cris.opt:169
! msgid "-mtune=ARCH\tTune alignment for the specified chip or CPU version"
  msgstr ""
  
! #: config/cris/cris.opt:173
  msgid ""
! "-mmax-stackframe=SIZE\tWarn when a stackframe is larger than the specified "
! "size"
  msgstr ""
  
! #: config/cris/cris.opt:180
! msgid ""
! "Emit traps as \"break 8\", default for CRIS v3 and up.  If disabled, calls "
! "to abort() are used."
  msgstr ""
  
! #: config/cris/cris.opt:184
! msgid ""
! "Emit checks causing \"break 8\" instructions to execute when applying atomic "
! "builtins on misaligned memory"
  msgstr ""
  
! #: config/cris/cris.opt:188
  msgid ""
! "Handle atomic builtins that may be applied to unaligned data by calling "
! "library functions. Overrides -mtrap-unaligned-atomic."
  msgstr ""
  
! #: config/cris/linux.opt:27
! msgid "Together with -fpic and -fPIC, do not use GOTPLT references"
  msgstr ""
  
! #: config/rs6000/rs6000-tables.opt:24
! msgid "Known CPUs (for use with the -mcpu= and -mtune= options):"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:109
! msgid "Use PowerPC-64 instruction set"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:113
! msgid "Use PowerPC General Purpose group optional instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:117
! msgid "Use PowerPC Graphics group optional instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:121
! msgid "Use PowerPC V2.01 single field mfcr instruction"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:125
! msgid "Use PowerPC V2.02 popcntb instruction"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:129
! msgid "Use PowerPC V2.02 floating point rounding instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:133
! msgid "Use PowerPC V2.05 compare bytes instruction"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:137
! msgid "Use extended PowerPC V2.05 move floating point to/from GPR instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:141
! msgid "Use AltiVec instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:145
! msgid "Generate Altivec instructions using little-endian element order"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:149
! msgid "Generate Altivec instructions using big-endian element order"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:153
! msgid "Use decimal floating point instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:157
! msgid "Use 4xx half-word multiply instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:161
! msgid "Use 4xx string-search dlmzb instruction"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:165
! msgid "Generate load/store multiple instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:169
! msgid "Generate string instructions for block moves"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:181
! msgid "Use PowerPC V2.06 popcntd instruction"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:185
! msgid ""
! "Under -ffast-math, generate a FRIZ instruction for (double)(long long) "
! "conversions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:193
! msgid "Use vector/scalar (VSX) instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:240
! msgid "Do not generate load/store with update instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:244
! msgid "Generate load/store with update instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:252
! msgid "Avoid generation of indexed load/store instructions when possible"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:256
! msgid "Mark __tls_get_addr calls with argument info"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:263
! msgid "Schedule the start and end of the procedure"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:267
! msgid "Return all structures in memory (AIX default)"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:271
! msgid "Return small structures in registers (SVR4 default)"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:275
! msgid "Conform more closely to IBM XLC semantics"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:279 config/rs6000/rs6000.opt:283
  msgid ""
! "Generate software reciprocal divide and square root for better throughput."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:287
! msgid "Assume that the reciprocal estimate instructions provide more accuracy."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:291
! msgid "Do not place floating point constants in TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:295
! msgid "Place floating point constants in TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:299
! msgid "Do not place symbol+offset constants in TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:303
! msgid "Place symbol+offset constants in TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:314
! msgid "Use only one TOC entry per procedure"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:318
! msgid "Put everything in the regular TOC"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:322
! msgid "Generate VRSAVE instructions when generating AltiVec code"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:326
! msgid "Deprecated option.  Use -mno-vrsave instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:330
! msgid "Deprecated option.  Use -mvrsave instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:334
! msgid ""
! "Specify how many bytes should be moved inline before calling out to memcpy/"
! "memmove"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:338
! msgid "Generate isel instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:342
! msgid "Deprecated option.  Use -mno-isel instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:346
! msgid "Deprecated option.  Use -misel instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:350
! msgid "Generate SPE SIMD instructions on E500"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:354
! msgid "Generate PPC750CL paired-single instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:358
! msgid "Deprecated option.  Use -mno-spe instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:362
! msgid "Deprecated option.  Use -mspe instead"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:366
! msgid "-mdebug=\tEnable debug output"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:370
! msgid "Use the AltiVec ABI extensions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:374
! msgid "Do not use the AltiVec ABI extensions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:378
! msgid "Use the SPE ABI extensions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:382
! msgid "Do not use the SPE ABI extensions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:386
! msgid "Use the ELFv1 ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:390
! msgid "Use the ELFv2 ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:397
! msgid "using darwin64 ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:400
! msgid "using old darwin ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:403
! msgid "using IEEE extended precision long double"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:406
! msgid "using IBM extended precision long double"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:410
! msgid "-mcpu=\tUse features of and schedule code for given CPU"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:414
! msgid "-mtune=\tSchedule code for given CPU"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:418
! msgid "-mtraceback=\tSelect full, part, or no traceback table"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:434
! msgid "Avoid all range limits on call instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:438
! msgid "Generate Cell microcode"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:442
! msgid "Warn when a Cell microcoded instruction is emitted"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:446
! msgid "Warn about deprecated 'vector long ...' AltiVec type usage"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:450
! msgid "-mfloat-gprs=\tSelect GPR floating point method"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:454
! msgid "Valid arguments to -mfloat-gprs=:"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:470
! msgid "-mlong-double-<n>\tSpecify size of long double (64 or 128 bits)"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:478
! msgid "Determine which dependences between insns are considered costly"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:482
! msgid "Specify which post scheduling nop insertion scheme to apply"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:486
! msgid "Specify alignment of structure fields default/natural"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:490
! msgid "Valid arguments to -malign-:"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:500
! msgid "Specify scheduling priority for dispatch slot restricted insns"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:504
! msgid "Single-precision floating point unit"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:508
! msgid "Double-precision floating point unit"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:512
! msgid "Floating point unit does not support divide & sqrt"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:516
! msgid "-mfpu=\tSpecify FP (sp, dp, sp-lite, dp-lite) (implies -mxilinx-fpu)"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:538
! msgid "Specify Xilinx FPU."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:542
  msgid ""
! "Use/do not use r11 to hold the static link in calls to functions via "
! "pointers."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:546
! msgid ""
! "Control whether we save the TOC in the prologue for indirect calls or "
! "generate the save inline"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:550
! msgid "Allow 128-bit integers in VSX registers"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:554
  msgid ""
! "Fuse certain integer operations together for better performance on power8"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:558
! msgid "Allow sign extension in fusion operations"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:562
! msgid "Use/do not use vector and scalar instructions added in ISA 2.07."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:566
! msgid "Use ISA 2.07 Category:Vector.AES and Category:Vector.SHA2 instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:570
! msgid "Use ISA 2.07 direct move between GPR & VSX register instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:574
! msgid "Use ISA 2.07 transactional memory (HTM) instructions"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:578
! msgid "Generate the quad word memory instructions (lq/stq)."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:582
! msgid "Generate the quad word memory atomic instructions (lqarx/stqcx)."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:586
! msgid ""
! "Generate aggregate parameter passing code with at most 64-bit alignment."
  msgstr ""
  
! #: config/rs6000/rs6000.opt:590
! msgid "Allow double variables in upper registers with -mcpu=power7 or -mvsx"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:594
  msgid ""
! "Allow float variables in upper registers with -mcpu=power8 or -mpower8-vector"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:598
! msgid "Allow float/double variables in upper registers if cpu allows it"
  msgstr ""
  
! #: config/rs6000/rs6000.opt:602
! msgid "Analyze and remove doubleword swaps from VSX computations."
  msgstr ""
  
! #: config/rs6000/darwin.opt:38 config/rs6000/sysv4.opt:141
! msgid "Generate 64-bit code"
  msgstr ""
  
! #: config/rs6000/darwin.opt:42 config/rs6000/sysv4.opt:145
! msgid "Generate 32-bit code"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:24
! msgid "Select ABI calling convention"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:48
! msgid "Align to the base type of the bit-field"
! msgstr ""
! 
! #: config/rs6000/sysv4.opt:52
  msgid ""
! "Align to the base type of the bit-field Don't assume that unaligned accesses "
! "are handled by the system"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:57 config/rs6000/sysv4.opt:61
! msgid "Produce code relocatable at runtime"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:65 config/rs6000/sysv4.opt:69
! msgid "Produce little endian code"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:73 config/rs6000/sysv4.opt:77
! msgid "Produce big endian code"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:82 config/rs6000/sysv4.opt:86
! #: config/rs6000/sysv4.opt:95 config/rs6000/sysv4.opt:137
! #: config/rs6000/sysv4.opt:149
! msgid "no description yet"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:90
! msgid "Assume all variable arg functions are prototyped"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:99
! msgid "Use EABI"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:103
! msgid "Allow bit-fields to cross word boundaries"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:107
! msgid "Use alternate register names"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:113
! msgid "Use default method for sdata handling"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:117
! msgid "Link with libsim.a, libc.a and sim-crt0.o"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:121
! msgid "Link with libads.a, libc.a and crt0.o"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:125
! msgid "Link with libyk.a, libc.a and crt0.o"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:129
! msgid "Link with libmvme.a, libc.a and crt0.o"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:133
! msgid "Set the PPC_EMB bit in the ELF flags header"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:153
! msgid "Generate code to use a non-exec PLT and GOT"
  msgstr ""
  
! #: config/rs6000/sysv4.opt:157
! msgid "Generate code for old exec BSS PLT"
  msgstr ""
  
! #: config/rs6000/aix64.opt:24
! msgid "Compile for 64-bit pointers"
  msgstr ""
  
! #: config/rs6000/aix64.opt:28
! msgid "Compile for 32-bit pointers"
  msgstr ""
  
! #: config/rs6000/aix64.opt:32 config/rs6000/linux64.opt:28
! msgid "Select code model"
  msgstr ""
  
! #: config/rs6000/aix64.opt:49
! msgid "Support message passing with the Parallel Environment"
  msgstr ""
  
! #: config/rs6000/linux64.opt:24
! msgid "Call mcount for profiling before a function prologue"
  msgstr ""
  
! #: config/rs6000/476.opt:24
! msgid ""
! "Preserve the PowerPC 476's link stack by matching up a blr with the bcl/bl "
! "insns used for GOT accesses"
  msgstr ""
  
! #: config/rl78/rl78.opt:31
! msgid "Select hardware or software multiplication support."
  msgstr ""
  
! #: config/rl78/rl78.opt:47
! msgid "Use all registers, reserving none for interrupt handlers."
  msgstr ""
  
! #: config/rl78/rl78.opt:51
! msgid "Enable assembler and linker relaxation.  Enabled by default at -Os."
  msgstr ""
  
! #: config/rl78/rl78.opt:55
! msgid "Target the RL78/G10 series"
  msgstr ""
  
! #: config/rl78/rl78.opt:59
! msgid ""
! "Assume ES is zero throughout program execution, use ES: for read-only data."
  msgstr ""
  
! #: config/nds32/nds32.opt:26
! msgid "Generate code in big-endian mode."
  msgstr ""
  
! #: config/nds32/nds32.opt:30
! msgid "Generate code in little-endian mode."
  msgstr ""
  
! #: config/nds32/nds32.opt:34
! msgid "Use reduced-set registers for register allocation."
  msgstr ""
  
! #: config/nds32/nds32.opt:38
! msgid "Use full-set registers for register allocation."
  msgstr ""
  
! #: config/nds32/nds32.opt:42
! msgid "Generate conditional move instructions."
  msgstr ""
  
! #: config/nds32/nds32.opt:46
! msgid "Generate performance extension instructions."
  msgstr ""
  
! #: config/nds32/nds32.opt:50
! msgid "Generate v3 push25/pop25 instructions."
  msgstr ""
  
! #: config/nds32/nds32.opt:54
! msgid "Generate 16-bit instructions."
  msgstr ""
  
! #: config/nds32/nds32.opt:58
! msgid "Specify the size of each interrupt vector, which must be 4 or 16."
  msgstr ""
  
! #: config/nds32/nds32.opt:62
  msgid ""
! "Specify the size of each cache block, which must be a power of 2 between 4 "
! "and 512."
  msgstr ""
  
! #: config/nds32/nds32.opt:66
! msgid "Specify the name of the target architecture."
  msgstr ""
  
! #: config/nds32/nds32.opt:70
! msgid "Known arch types (for use with the -march= option):"
  msgstr ""
  
! #: config/nds32/nds32.opt:83
! msgid "Specify the address generation strategy for code model."
  msgstr ""
  
! #: config/nds32/nds32.opt:87
! msgid "Known cmodel types (for use with the -mcmodel= option):"
  msgstr ""
  
! #: config/nds32/nds32.opt:100
! msgid "Enable constructor/destructor feature."
  msgstr ""
  
! #: config/nds32/nds32.opt:104
! msgid "Guide linker to relax instructions."
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:57 c-family/c.opt:276
! msgid "Enable most warning messages"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:61
! msgid "Synonym of -gnatk8"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:69
! msgid "Do not look for object files in standard path"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:73
! msgid "Select the runtime"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:77 c-family/c.opt:1365
! msgid "Use the narrowest integer type possible for enumeration types"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:81
! msgid "Catch typos"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:85
! msgid "Set name of output ALI file (internal switch)"
  msgstr ""
  
! #: ada/gcc-interface/lang.opt:89
! msgid "-gnat<options>\tSpecify options to GNAT"
  msgstr ""
  
! #: go/lang.opt:42
! msgid "Add explicit checks for division by zero"
  msgstr ""
  
! #: go/lang.opt:46
! msgid "Add explicit checks for division overflow in INT_MIN / -1"
! msgstr ""
! 
! #: go/lang.opt:50
! msgid "-fgo-dump-<type>\tDump Go frontend internal information"
! msgstr ""
! 
! #: go/lang.opt:54
! msgid "-fgo-optimize-<type>\tTurn on optimization passes in the frontend"
! msgstr ""
! 
! #: go/lang.opt:58
! msgid "-fgo-pkgpath=<string>\tSet Go package path"
! msgstr ""
! 
! #: go/lang.opt:62
! msgid "-fgo-prefix=<string>\tSet package-specific prefix for exported Go names"
! msgstr ""
! 
! #: go/lang.opt:66
  msgid ""
! "-fgo-relative-import-path=<path> Treat a relative import as relative to path"
  msgstr ""
  
! #: go/lang.opt:70
! msgid "Functions which return values must end with return statements"
  msgstr ""
  
  #: common.opt:282
*************** msgid "Generate auto-inc/dec instruction
*** 13343,13353 ****
  msgstr ""
  
  #: common.opt:925
! msgid "Use sample profile information for call graph node weights. The default"
  msgstr ""
  
  #: common.opt:930
! msgid "Use sample profile information for call graph node weights. The profile"
  msgstr ""
  
  #: common.opt:939
--- 11436,11450 ----
  msgstr ""
  
  #: common.opt:925
! msgid ""
! "Use sample profile information for call graph node weights. The default "
! "profile file is fbdata.afdo in 'pwd'."
  msgstr ""
  
  #: common.opt:930
! msgid ""
! "Use sample profile information for call graph node weights. The profile file "
! "is specified in the argument."
  msgstr ""
  
  #: common.opt:939
*************** msgid "Suppress output of addresses in d
*** 13547,13553 ****
  msgstr ""
  
  #: common.opt:1164
! msgid "Collect and dump debug information into temporary file if ICE in C/C++"
  msgstr ""
  
  #: common.opt:1169
--- 11644,11652 ----
  msgstr ""
  
  #: common.opt:1164
! msgid ""
! "Collect and dump debug information into temporary file if ICE in C/C++ "
! "compiler occured."
  msgstr ""
  
  #: common.opt:1169
*************** msgstr ""
*** 13667,13678 ****
  
  #: common.opt:1297
  msgid ""
! "Perform redundant load after store elimination in global common subexpression"
  msgstr ""
  
  #: common.opt:1302
  msgid ""
! "Perform global common subexpression elimination after register allocation"
  msgstr ""
  
  #: common.opt:1308
--- 11766,11779 ----
  
  #: common.opt:1297
  msgid ""
! "Perform redundant load after store elimination in global common "
! "subexpression elimination"
  msgstr ""
  
  #: common.opt:1302
  msgid ""
! "Perform global common subexpression elimination after register allocation "
! "has finished"
  msgstr ""
  
  #: common.opt:1308
*************** msgid "Enable Graphite Identity transfor
*** 13684,13690 ****
  msgstr ""
  
  #: common.opt:1316
! msgid "Enable hoisting adjacent loads to encourage generating conditional move"
  msgstr ""
  
  #: common.opt:1321
--- 11785,11793 ----
  msgstr ""
  
  #: common.opt:1316
! msgid ""
! "Enable hoisting adjacent loads to encourage generating conditional move "
! "instructions"
  msgstr ""
  
  #: common.opt:1321
*************** msgstr ""
*** 13874,13881 ****
  msgid "unknown IRA region %qs"
  msgstr ""
  
! #: common.opt:1535 common.opt:1540
! msgid "Use IRA based register pressure calculation"
  msgstr ""
  
  #: common.opt:1545
--- 11977,11988 ----
  msgid "unknown IRA region %qs"
  msgstr ""
  
! #: common.opt:1535
! msgid "Use IRA based register pressure calculation in RTL hoist optimizations."
! msgstr ""
! 
! #: common.opt:1540
! msgid "Use IRA based register pressure calculation in RTL loop optimizations."
  msgstr ""
  
  #: common.opt:1545
*************** msgid "Insert arc-based program profilin
*** 14126,14132 ****
  msgstr ""
  
  #: common.opt:1808
! msgid "Set the top-level directory for storing the profile data."
  msgstr ""
  
  #: common.opt:1813
--- 12233,12241 ----
  msgstr ""
  
  #: common.opt:1808
! msgid ""
! "Set the top-level directory for storing the profile data. The default is "
! "'pwd'."
  msgstr ""
  
  #: common.opt:1813
*************** msgid "Enable function reordering that i
*** 14169,14175 ****
  msgstr ""
  
  #: common.opt:1848
! msgid "-frandom-seed=<number>\tMake compile reproducible using <number>"
  msgstr ""
  
  #: common.opt:1858
--- 12278,12284 ----
  msgstr ""
  
  #: common.opt:1848
! msgid "-frandom-seed=<string>\tMake compile reproducible using <string>"
  msgstr ""
  
  #: common.opt:1858
*************** msgid "Return small aggregates in regist
*** 14181,14187 ****
  msgstr ""
  
  #: common.opt:1870
! msgid "Tell DSE that the storage for a C++ object is dead when the constructor"
  msgstr ""
  
  #: common.opt:1875
--- 12290,12298 ----
  msgstr ""
  
  #: common.opt:1870
! msgid ""
! "Tell DSE that the storage for a C++ object is dead when the constructor "
! "starts and when the destructor finishes."
  msgstr ""
  
  #: common.opt:1875
*************** msgid "Show column numbers in diagnostic
*** 14336,14342 ****
  msgstr ""
  
  #: common.opt:2044
! msgid "Emit function prologues only before parts of the function that need it,"
  msgstr ""
  
  #: common.opt:2049
--- 12447,12455 ----
  msgstr ""
  
  #: common.opt:2044
! msgid ""
! "Emit function prologues only before parts of the function that need it, "
! "rather than at the top of the function."
  msgstr ""
  
  #: common.opt:2049
*************** msgid "Enable string length optimization
*** 14538,14549 ****
  msgstr ""
  
  #: common.opt:2270
! msgid "Detect paths that trigger erroneous or undefined behavior due to"
  msgstr ""
  
  #: common.opt:2276
  msgid ""
! "Detect paths that trigger erroneous or undefined behavior due a null value"
  msgstr ""
  
  #: common.opt:2283
--- 12651,12668 ----
  msgstr ""
  
  #: common.opt:2270
! msgid ""
! "Detect paths that trigger erroneous or undefined behavior due to "
! "dereferencing a null pointer.  Isolate those paths from the main control "
! "flow and turn the statement with erroneous or undefined behavior into a trap."
  msgstr ""
  
  #: common.opt:2276
  msgid ""
! "Detect paths that trigger erroneous or undefined behavior due a null value "
! "being used in a way forbidden by a returns_nonnull or nonnull attribute.  "
! "Isolate those paths from the main control flow and turn the statement with "
! "erroneous or undefined behavior into a trap. "
  msgstr ""
  
  #: common.opt:2283
*************** msgid "Allow loop optimizations to assum
*** 14637,14643 ****
  msgstr ""
  
  #: common.opt:2378
! msgid "Allow optimization for floating-point arithmetic which may change the"
  msgstr ""
  
  #: common.opt:2383
--- 12756,12764 ----
  msgstr ""
  
  #: common.opt:2378
! msgid ""
! "Allow optimization for floating-point arithmetic which may change the result "
! "of the operation due to rounding."
  msgstr ""
  
  #: common.opt:2383
*************** msgstr ""
*** 14914,14921 ****
  msgid "Use caller save register across calls if possible"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:93 c-family/c-common.c:1910 cp/cvt.c:1182
! #: cp/cvt.c:1430
  #, gcc-internal-format
  msgid "value computed is not used"
  msgstr ""
--- 13035,15010 ----
  msgid "Use caller save register across calls if possible"
  msgstr ""
  
! #: java/lang.opt:122
! msgid "Warn if deprecated empty statements are found"
! msgstr ""
! 
! #: java/lang.opt:126
! msgid "Warn if .class files are out of date"
! msgstr ""
! 
! #: java/lang.opt:130
! msgid "Warn if modifiers are specified when not necessary"
! msgstr ""
! 
! #: java/lang.opt:150
! msgid "--CLASSPATH\tDeprecated; use --classpath instead"
! msgstr ""
! 
! #: java/lang.opt:157
! msgid "Permit the use of the assert keyword"
! msgstr ""
! 
! #: java/lang.opt:179
! msgid "--bootclasspath=<path>\tReplace system path"
! msgstr ""
! 
! #: java/lang.opt:183
! msgid "Generate checks for references to NULL"
! msgstr ""
! 
! #: java/lang.opt:187
! msgid "--classpath=<path>\tSet class path"
! msgstr ""
! 
! #: java/lang.opt:194
! msgid "Output a class file"
! msgstr ""
! 
! #: java/lang.opt:198
! msgid "Alias for -femit-class-file"
! msgstr ""
! 
! #: java/lang.opt:202
! msgid ""
! "--encoding=<encoding>\tChoose input encoding (defaults from your locale)"
! msgstr ""
! 
! #: java/lang.opt:206
! msgid "--extdirs=<path>\tSet the extension directory path"
! msgstr ""
! 
! #: java/lang.opt:216
! msgid "Input file is a file with a list of filenames to compile"
! msgstr ""
! 
! #: java/lang.opt:223
! msgid "Always check for non gcj generated classes archives"
! msgstr ""
! 
! #: java/lang.opt:227
! msgid ""
! "Assume the runtime uses a hash table to map an object to its synchronization "
! "structure"
! msgstr ""
! 
! #: java/lang.opt:231
! msgid "Generate instances of Class at runtime"
! msgstr ""
! 
! #: java/lang.opt:235
! msgid "Use offset tables for virtual method calls"
! msgstr ""
! 
! #: java/lang.opt:242
! msgid "Assume native functions are implemented using JNI"
! msgstr ""
! 
! #: java/lang.opt:246
! msgid "Enable optimization of static class initialization code"
! msgstr ""
! 
! #: java/lang.opt:253
! msgid "Reduce the amount of reflection meta-data generated"
! msgstr ""
! 
! #: java/lang.opt:257
! msgid "Enable assignability checks for stores into object arrays"
! msgstr ""
! 
! #: java/lang.opt:261
! msgid "Generate code for the Boehm GC"
! msgstr ""
! 
! #: java/lang.opt:265
! msgid "Call a library routine to do integer divisions"
! msgstr ""
! 
! #: java/lang.opt:269
! msgid "Generate code for built-in atomic operations"
! msgstr ""
! 
! #: java/lang.opt:273
! msgid "Generated should be loaded by bootstrap loader"
! msgstr ""
! 
! #: java/lang.opt:277
! msgid "Set the source language version"
! msgstr ""
! 
! #: java/lang.opt:281
! msgid "Set the target VM version"
! msgstr ""
! 
! #: c-family/c.opt:43 c-family/c.opt:46 c-family/c.opt:181
! #, c-format
! msgid "assertion missing after %qs"
! msgstr ""
! 
! #: c-family/c.opt:55 c-family/c.opt:58 c-family/c.opt:163 c-family/c.opt:166
! #: c-family/c.opt:193 c-family/c.opt:252
! #, c-format
! msgid "macro name missing after %qs"
! msgstr ""
! 
! #: c-family/c.opt:85 c-family/c.opt:88 c-family/c.opt:91 c-family/c.opt:94
! #: c-family/c.opt:200 c-family/c.opt:208 c-family/c.opt:1493
! #: c-family/c.opt:1513 c-family/c.opt:1517 c-family/c.opt:1521
! #, c-format
! msgid "missing path after %qs"
! msgstr ""
! 
! #: c-family/c.opt:182
! msgid ""
! "-A<question>=<answer>\tAssert the <answer> to <question>.  Putting '-' "
! "before <question> disables the <answer> to <question>"
! msgstr ""
! 
! #: c-family/c.opt:186
! msgid "Do not discard comments"
! msgstr ""
! 
! #: c-family/c.opt:190
! msgid "Do not discard comments in macro expansions"
! msgstr ""
! 
! #: c-family/c.opt:194
! msgid ""
! "-D<macro>[=<val>]\tDefine a <macro> with <val> as its value.  If just "
! "<macro> is given, <val> is taken to be 1"
! msgstr ""
! 
! #: c-family/c.opt:201
! msgid "-F <dir>\tAdd <dir> to the end of the main framework include path"
! msgstr ""
! 
! #: c-family/c.opt:205
! msgid "Print the name of header files as they are used"
! msgstr ""
! 
! #: c-family/c.opt:209
! msgid "-I <dir>\tAdd <dir> to the end of the main include path"
! msgstr ""
! 
! #: c-family/c.opt:213
! msgid "Generate make dependencies"
! msgstr ""
! 
! #: c-family/c.opt:217
! msgid "Generate make dependencies and compile"
! msgstr ""
! 
! #: c-family/c.opt:221
! msgid "-MF <file>\tWrite dependency output to the given file"
! msgstr ""
! 
! #: c-family/c.opt:225
! msgid "Treat missing header files as generated files"
! msgstr ""
! 
! #: c-family/c.opt:229
! msgid "Like -M but ignore system header files"
! msgstr ""
! 
! #: c-family/c.opt:233
! msgid "Like -MD but ignore system header files"
! msgstr ""
! 
! #: c-family/c.opt:237
! msgid "Generate phony targets for all headers"
! msgstr ""
! 
! #: c-family/c.opt:240 c-family/c.opt:244
! #, c-format
! msgid "missing makefile target after %qs"
! msgstr ""
! 
! #: c-family/c.opt:241
! msgid "-MQ <target>\tAdd a MAKE-quoted target"
! msgstr ""
! 
! #: c-family/c.opt:245
! msgid "-MT <target>\tAdd an unquoted target"
! msgstr ""
! 
! #: c-family/c.opt:249
! msgid "Do not generate #line directives"
! msgstr ""
! 
! #: c-family/c.opt:253
! msgid "-U<macro>\tUndefine <macro>"
! msgstr ""
! 
! #: c-family/c.opt:257
! msgid ""
! "Warn about things that will change when compiling with an ABI-compliant "
! "compiler"
! msgstr ""
! 
! #: c-family/c.opt:261
! msgid ""
! "Warn about things that change between the current -fabi-version and the "
! "specified version"
! msgstr ""
! 
! #: c-family/c.opt:265
! msgid ""
! "Warn if a subobject has an abi_tag attribute that the complete object type "
! "does not have"
! msgstr ""
! 
! #: c-family/c.opt:272
! msgid "Warn about suspicious uses of memory addresses"
! msgstr ""
! 
! #: c-family/c.opt:288
! msgid ""
! "Warn whenever an Objective-C assignment is being intercepted by the garbage "
! "collector"
! msgstr ""
! 
! #: c-family/c.opt:292
! msgid "Warn about casting functions to incompatible types"
! msgstr ""
! 
! #: c-family/c.opt:296
! msgid ""
! "Warn about boolean expression compared with an integer value different from "
! "true/false"
! msgstr ""
! 
! #: c-family/c.opt:300
! msgid "Warn when a built-in preprocessor macro is undefined or redefined"
! msgstr ""
! 
! #: c-family/c.opt:304
! msgid "Warn about features not present in ISO C90, but present in ISO C99"
! msgstr ""
! 
! #: c-family/c.opt:308
! msgid "Warn about features not present in ISO C99, but present in ISO C11"
! msgstr ""
! 
! #: c-family/c.opt:312
! msgid "Warn about C constructs that are not in the common subset of C and C++"
! msgstr ""
! 
! #: c-family/c.opt:316
! msgid "Deprecated in favor of -Wc++11-compat"
! msgstr ""
! 
! #: c-family/c.opt:320
! msgid ""
! "Warn about C++ constructs whose meaning differs between ISO C++ 1998 and ISO "
! "C++ 2011"
! msgstr ""
! 
! #: c-family/c.opt:324
! msgid ""
! "Warn about C++ constructs whose meaning differs between ISO C++ 2011 and ISO "
! "C++ 2014"
! msgstr ""
! 
! #: c-family/c.opt:328
! msgid "Warn about casts which discard qualifiers"
! msgstr ""
! 
! #: c-family/c.opt:332
! msgid "Warn about subscripts whose type is \"char\""
! msgstr ""
! 
! #: c-family/c.opt:336
! msgid "Warn about memory access errors found by Pointer Bounds Checker"
! msgstr ""
! 
! #: c-family/c.opt:340
! msgid "Warn about variables that might be changed by \"longjmp\" or \"vfork\""
! msgstr ""
! 
! #: c-family/c.opt:344
! msgid ""
! "Warn about possibly nested block comments, and C++ comments spanning more "
! "than one physical line"
! msgstr ""
! 
! #: c-family/c.opt:348
! msgid "Synonym for -Wcomment"
! msgstr ""
! 
! #: c-family/c.opt:352
! msgid "Warn for conditionally-supported constructs"
! msgstr ""
! 
! #: c-family/c.opt:356
! msgid "Warn for implicit type conversions that may change a value"
! msgstr ""
! 
! #: c-family/c.opt:360
! msgid "Warn for converting NULL from/to a non-pointer type"
! msgstr ""
! 
! #: c-family/c.opt:368
! msgid "Warn when all constructors and destructors are private"
! msgstr ""
! 
! #: c-family/c.opt:372
! msgid "Warn about __TIME__, __DATE__ and __TIMESTAMP__ usage"
! msgstr ""
! 
! #: c-family/c.opt:376
! msgid "Warn when a declaration is found after a statement"
! msgstr ""
! 
! #: c-family/c.opt:380
! msgid "Warn when deleting a pointer to incomplete type"
! msgstr ""
! 
! #: c-family/c.opt:384
! msgid "Warn about deleting polymorphic objects with non-virtual destructors"
! msgstr ""
! 
! #: c-family/c.opt:388
! msgid "Warn if a deprecated compiler feature, class, method, or field is used"
! msgstr ""
! 
! #: c-family/c.opt:392
! msgid ""
! "Warn about positional initialization of structs requiring designated "
! "initializers"
! msgstr ""
! 
! #: c-family/c.opt:396
! msgid "Warn if qualifiers on arrays which are pointer targets are discarded"
! msgstr ""
! 
! #: c-family/c.opt:400
! msgid "Warn if type qualifiers on pointers are discarded"
! msgstr ""
! 
! #: c-family/c.opt:404
! msgid "Warn about compile-time integer division by zero"
! msgstr ""
! 
! #: c-family/c.opt:408
! msgid "Warn about violations of Effective C++ style rules"
! msgstr ""
! 
! #: c-family/c.opt:412
! msgid "Warn about an empty body in an if or else statement"
! msgstr ""
! 
! #: c-family/c.opt:416
! msgid "Warn about stray tokens after #elif and #endif"
! msgstr ""
! 
! #: c-family/c.opt:420
! msgid "Warn about comparison of different enum types"
! msgstr ""
! 
! #: c-family/c.opt:428
! msgid ""
! "This switch is deprecated; use -Werror=implicit-function-declaration instead"
! msgstr ""
! 
! #: c-family/c.opt:432
! msgid ""
! "Warn for implicit type conversions that cause loss of floating point "
! "precision"
! msgstr ""
! 
! #: c-family/c.opt:436
! msgid "Warn if testing floating point numbers for equality"
! msgstr ""
! 
! #: c-family/c.opt:440 c-family/c.opt:472
! msgid "Warn about printf/scanf/strftime/strfmon format string anomalies"
! msgstr ""
! 
! #: c-family/c.opt:444
! msgid "Warn about format strings that contain NUL bytes"
! msgstr ""
! 
! #: c-family/c.opt:448
! msgid "Warn if passing too many arguments to a function for its format string"
! msgstr ""
! 
! #: c-family/c.opt:452
! msgid "Warn about format strings that are not literals"
! msgstr ""
! 
! #: c-family/c.opt:456
! msgid "Warn about possible security problems with format functions"
! msgstr ""
! 
! #: c-family/c.opt:460
! msgid "Warn about sign differences with format functions"
! msgstr ""
! 
! #: c-family/c.opt:464
! msgid "Warn about strftime formats yielding 2-digit years"
! msgstr ""
! 
! #: c-family/c.opt:468
! msgid "Warn about zero-length formats"
! msgstr ""
! 
! #: c-family/c.opt:476
! msgid "Warn whenever type qualifiers are ignored."
! msgstr ""
! 
! #: c-family/c.opt:480
! msgid ""
! "Warn when there is a conversion between pointers that have incompatible types"
! msgstr ""
! 
! #: c-family/c.opt:484
! msgid "Warn about variables which are initialized to themselves"
! msgstr ""
! 
! #: c-family/c.opt:488
! msgid "Warn about implicit declarations"
! msgstr ""
! 
! #: c-family/c.opt:492
! msgid "Warn about implicit conversions from \"float\" to \"double\""
! msgstr ""
! 
! #: c-family/c.opt:496
! msgid "Warn about implicit function declarations"
! msgstr ""
! 
! #: c-family/c.opt:500
! msgid "Warn when a declaration does not specify a type"
! msgstr ""
! 
! #: c-family/c.opt:507
! msgid ""
! "Warn about C++11 inheriting constructors when the base has a variadic "
! "constructor"
! msgstr ""
! 
! #: c-family/c.opt:511
! msgid ""
! "Warn about incompatible integer to pointer and pointer to integer conversions"
! msgstr ""
! 
! #: c-family/c.opt:515
! msgid ""
! "Warn when there is a cast to a pointer from an integer of a different size"
! msgstr ""
! 
! #: c-family/c.opt:519
! msgid "Warn about invalid uses of the \"offsetof\" macro"
! msgstr ""
! 
! #: c-family/c.opt:523
! msgid "Warn about PCH files that are found but not used"
! msgstr ""
! 
! #: c-family/c.opt:527
! msgid "Warn when a jump misses a variable initialization"
! msgstr ""
! 
! #: c-family/c.opt:531
! msgid ""
! "Warn when a string or character literal is followed by a ud-suffix which "
! "does not begin with an underscore."
! msgstr ""
! 
! #: c-family/c.opt:535
! msgid ""
! "Warn when a logical operator is suspiciously always evaluating to true or "
! "false"
! msgstr ""
! 
! #: c-family/c.opt:539
! msgid ""
! "Warn when logical not is used on the left hand side operand of a comparison"
! msgstr ""
! 
! #: c-family/c.opt:543
! msgid "Do not warn about using \"long long\" when -pedantic"
! msgstr ""
! 
! #: c-family/c.opt:547
! msgid "Warn about suspicious declarations of \"main\""
! msgstr ""
! 
! #: c-family/c.opt:555
! msgid ""
! "Warn about suspicious calls to memset where the third argument is constant "
! "literal zero and the second is not"
! msgstr ""
! 
! #: c-family/c.opt:559
! msgid "Warn about possibly missing braces around initializers"
! msgstr ""
! 
! #: c-family/c.opt:563
! msgid "Warn about global functions without previous declarations"
! msgstr ""
! 
! #: c-family/c.opt:567
! msgid "Warn about missing fields in struct initializers"
! msgstr ""
! 
! #: c-family/c.opt:571
! msgid "Warn about missing sized deallocation functions"
! msgstr ""
! 
! #: c-family/c.opt:575
! msgid ""
! "Warn about suspicious length parameters to certain string functions if the "
! "argument uses sizeof"
! msgstr ""
! 
! #: c-family/c.opt:579
! msgid "Warn when sizeof is applied on a parameter declared as an array"
! msgstr ""
! 
! #: c-family/c.opt:583
! msgid "Warn about functions which might be candidates for format attributes"
! msgstr ""
! 
! #: c-family/c.opt:587
! msgid ""
! "Suggest that the override keyword be used when the declaration of a virtual "
! "function overrides another."
! msgstr ""
! 
! #: c-family/c.opt:592
! msgid "Warn about enumerated switches, with no default, missing a case"
! msgstr ""
! 
! #: c-family/c.opt:596
! msgid "Warn about enumerated switches missing a \"default:\" statement"
! msgstr ""
! 
! #: c-family/c.opt:600
! msgid "Warn about all enumerated switches missing a specific case"
! msgstr ""
! 
! #: c-family/c.opt:604
! msgid "Warn about switches with boolean controlling expression"
! msgstr ""
! 
! #: c-family/c.opt:612
! msgid "Warn about user-specified include directories that do not exist"
! msgstr ""
! 
! #: c-family/c.opt:616
! msgid ""
! "Warn about function parameters declared without a type specifier in K&R-"
! "style functions"
! msgstr ""
! 
! #: c-family/c.opt:620
! msgid "Warn about global functions without prototypes"
! msgstr ""
! 
! #: c-family/c.opt:627
! msgid "Warn about use of multi-character character constants"
! msgstr ""
! 
! #: c-family/c.opt:631
! msgid ""
! "Warn about narrowing conversions within { } that are ill-formed in C++11"
! msgstr ""
! 
! #: c-family/c.opt:635
! msgid "Warn about \"extern\" declarations not at file scope"
! msgstr ""
! 
! #: c-family/c.opt:639
! msgid ""
! "Warn when a noexcept expression evaluates to false even though the "
! "expression can't actually throw"
! msgstr ""
! 
! #: c-family/c.opt:643
! msgid ""
! "Warn when non-templatized friend functions are declared within a template"
! msgstr ""
! 
! #: c-family/c.opt:647
! msgid "Warn about non-virtual destructors"
! msgstr ""
! 
! #: c-family/c.opt:651
! msgid ""
! "Warn about NULL being passed to argument slots marked as requiring non-NULL"
! msgstr ""
! 
! #: c-family/c.opt:663
! msgid ""
! "-Wnormalized=<none|id|nfc|nfkc>\tWarn about non-normalised Unicode strings"
! msgstr ""
! 
! #: c-family/c.opt:670
! msgid "argument %qs to %<-Wnormalized%> not recognized"
! msgstr ""
! 
! #: c-family/c.opt:686
! msgid "Warn if a C-style cast is used in a program"
! msgstr ""
! 
! #: c-family/c.opt:690
! msgid "Warn for obsolescent usage in a declaration"
! msgstr ""
! 
! #: c-family/c.opt:694
! msgid "Warn if an old-style parameter definition is used"
! msgstr ""
! 
! #: c-family/c.opt:698
! msgid "Warn if a simd directive is overridden by the vectorizer cost model"
! msgstr ""
! 
! #: c-family/c.opt:702
! msgid ""
! "Warn if a string is longer than the maximum portable length specified by the "
! "standard"
! msgstr ""
! 
! #: c-family/c.opt:706
! msgid "Warn about overloaded virtual function names"
! msgstr ""
! 
! #: c-family/c.opt:710
! msgid "Warn about overriding initializers without side effects"
! msgstr ""
! 
! #: c-family/c.opt:714
! msgid "Warn about packed bit-fields whose offset changed in GCC 4.4"
! msgstr ""
! 
! #: c-family/c.opt:718
! msgid "Warn about possibly missing parentheses"
! msgstr ""
! 
! #: c-family/c.opt:726
! msgid "Warn when converting the type of pointers to member functions"
! msgstr ""
! 
! #: c-family/c.opt:730
! msgid "Warn about function pointer arithmetic"
! msgstr ""
! 
! #: c-family/c.opt:734
! msgid "Warn when a pointer differs in signedness in an assignment"
! msgstr ""
! 
! #: c-family/c.opt:738
! msgid "Warn when a pointer is cast to an integer of a different size"
! msgstr ""
! 
! #: c-family/c.opt:742
! msgid "Warn about misuses of pragmas"
! msgstr ""
! 
! #: c-family/c.opt:746
! msgid ""
! "Warn if a property for an Objective-C object has no assign semantics "
! "specified"
! msgstr ""
! 
! #: c-family/c.opt:750
! msgid "Warn if inherited methods are unimplemented"
! msgstr ""
! 
! #: c-family/c.opt:754
! msgid "Warn about multiple declarations of the same object"
! msgstr ""
! 
! #: c-family/c.opt:758
! msgid "Warn when the compiler reorders code"
! msgstr ""
! 
! #: c-family/c.opt:762
! msgid ""
! "Warn whenever a function's return type defaults to \"int\" (C), or about "
! "inconsistent return types (C++)"
! msgstr ""
! 
! #: c-family/c.opt:766
! msgid "Warn if a selector has multiple methods"
! msgstr ""
! 
! #: c-family/c.opt:770
! msgid "Warn about possible violations of sequence point rules"
! msgstr ""
! 
! #: c-family/c.opt:774
! msgid "Warn if a local declaration hides an instance variable"
! msgstr ""
! 
! #: c-family/c.opt:778
! msgid "Warn if shift count is negative"
! msgstr ""
! 
! #: c-family/c.opt:782
! msgid "Warn if shift count >= width of type"
! msgstr ""
! 
! #: c-family/c.opt:786
! msgid "Warn about signed-unsigned comparisons"
! msgstr ""
! 
! #: c-family/c.opt:794
! msgid "Warn for implicit type conversions between signed and unsigned integers"
! msgstr ""
! 
! #: c-family/c.opt:798
! msgid "Warn when overload promotes from unsigned to signed"
! msgstr ""
! 
! #: c-family/c.opt:802
! msgid "Warn about uncasted NULL used as sentinel"
! msgstr ""
! 
! #: c-family/c.opt:806
! msgid "Warn about unprototyped function declarations"
! msgstr ""
! 
! #: c-family/c.opt:818
! msgid "Warn if type signatures of candidate methods do not match exactly"
! msgstr ""
! 
! #: c-family/c.opt:822
! msgid ""
! "Warn when __sync_fetch_and_nand and __sync_nand_and_fetch built-in functions "
! "are used"
! msgstr ""
! 
! #: c-family/c.opt:826
! msgid "Deprecated.  This switch has no effect"
! msgstr ""
! 
! #: c-family/c.opt:834
! msgid "Warn about features not present in traditional C"
! msgstr ""
! 
! #: c-family/c.opt:838
! msgid ""
! "Warn of prototypes causing type conversions different from what would happen "
! "in the absence of prototype"
! msgstr ""
! 
! #: c-family/c.opt:842
! msgid ""
! "Warn if trigraphs are encountered that might affect the meaning of the "
! "program"
! msgstr ""
! 
! #: c-family/c.opt:846
! msgid "Warn about @selector()s without previously declared methods"
! msgstr ""
! 
! #: c-family/c.opt:850
! msgid "Warn if an undefined macro is used in an #if directive"
! msgstr ""
! 
! #: c-family/c.opt:862
! msgid "Warn about unrecognized pragmas"
! msgstr ""
! 
! #: c-family/c.opt:866
! msgid "Warn about unsuffixed float constants"
! msgstr ""
! 
! #: c-family/c.opt:874
! msgid "Warn when typedefs locally defined in a function are not used"
! msgstr ""
! 
! #: c-family/c.opt:878
! msgid "Warn about macros defined in the main file that are not used"
! msgstr ""
! 
! #: c-family/c.opt:882
! msgid ""
! "Warn if a caller of a function, marked with attribute warn_unused_result, "
! "does not use its return value"
! msgstr ""
! 
! #: c-family/c.opt:886
! msgid "Warn about using variadic macros"
! msgstr ""
! 
! #: c-family/c.opt:890
! msgid ""
! "Warn about questionable usage of the macros used to retrieve variable "
! "arguments"
! msgstr ""
! 
! #: c-family/c.opt:894
! msgid "Warn if a variable length array is used"
! msgstr ""
! 
! #: c-family/c.opt:898
! msgid "Warn when a register variable is declared volatile"
! msgstr ""
! 
! #: c-family/c.opt:902
! msgid "Warn if a virtual base has a non-trivial move assignment operator"
! msgstr ""
! 
! #: c-family/c.opt:906
! msgid ""
! "In C++, nonzero means warn about deprecated conversion from string literals "
! "to 'char *'.  In C, similar warning, except that the conversion is of course "
! "not deprecated by the ISO C standard."
! msgstr ""
! 
! #: c-family/c.opt:910
! msgid "Warn when a literal '0' is used as null pointer"
! msgstr ""
! 
! #: c-family/c.opt:914
! msgid "Warn about useless casts"
! msgstr ""
! 
! #: c-family/c.opt:918
! msgid "A synonym for -std=c89 (for C) or -std=c++98 (for C++)"
! msgstr ""
! 
! #: c-family/c.opt:926
! msgid ""
! "The version of the C++ ABI used for -Wabi warnings and link compatibility "
! "aliases"
! msgstr ""
! 
! #: c-family/c.opt:930
! msgid "Enforce class member access control semantics"
! msgstr ""
! 
! #: c-family/c.opt:934
! msgid "-fada-spec-parent=unit  Dump Ada specs as child units of given parent"
! msgstr ""
! 
! #: c-family/c.opt:941
! msgid "Allow variadic functions without named parameter"
! msgstr ""
! 
! #: c-family/c.opt:945 c-family/c.opt:1170 c-family/c.opt:1445
! #: c-family/c.opt:1449 c-family/c.opt:1465
! msgid "No longer supported"
! msgstr ""
! 
! #: c-family/c.opt:949
! msgid "Recognize the \"asm\" keyword"
! msgstr ""
! 
! #: c-family/c.opt:957
! msgid "Recognize built-in functions"
! msgstr ""
! 
! #: c-family/c.opt:964
! msgid "Where shorter, use canonicalized paths to systems headers."
! msgstr ""
! 
! #: c-family/c.opt:968
! msgid ""
! "Add Pointer Bounds Checker instrumentation.  fchkp-* flags are used to "
! "control instrumentation.  Currently available for C, C++ and ObjC."
! msgstr ""
! 
! #: c-family/c.opt:973
! msgid "Generate pointer bounds checks for variables with incomplete type"
! msgstr ""
! 
! #: c-family/c.opt:977
! msgid ""
! "Use zero bounds for all incoming arguments in 'main' function.  It helps "
! "when instrumented binaries are used with legacy libs."
! msgstr ""
! 
! #: c-family/c.opt:982
! msgid ""
! "Forces Pointer Bounds Checker to use narrowed bounds for address of the "
! "first field in the structure.  By default pointer to the first field has the "
! "same bounds as pointer to the whole structure."
! msgstr ""
! 
! #: c-family/c.opt:988
! msgid ""
! "Control how Pointer Bounds Checker handle pointers to object fields.  When "
! "narrowing is on, field bounds are used.  Otherwise full object bounds are "
! "used."
! msgstr ""
! 
! #: c-family/c.opt:993
! msgid ""
! "Forces Pointer Bounds Checker to use bounds of the innermost arrays in case "
! "of nested static arryas access.  By default outermost array is used."
! msgstr ""
! 
! #: c-family/c.opt:998
! msgid ""
! "Allow Pointer Bounds Checker optimizations.  By default allowed on "
! "optimization levels >0."
! msgstr ""
! 
! #: c-family/c.opt:1003
! msgid ""
! "Allow to use *_nobnd versions of string functions by Pointer Bounds Checker."
! msgstr ""
! 
! #: c-family/c.opt:1007
! msgid ""
! "Allow to use *_nochk versions of string functions by Pointer Bounds Checker."
! msgstr ""
! 
! #: c-family/c.opt:1011
! msgid ""
! "Use statically initialized variable for vars bounds instead of generating "
! "them each time it is required."
! msgstr ""
! 
! #: c-family/c.opt:1016
! msgid ""
! "Use statically initialized variable for constant bounds instead of "
! "generating them each time it is required."
! msgstr ""
! 
! #: c-family/c.opt:1021
! msgid ""
! "With this option zero size obtained dynamically for objects with incomplete "
! "type will be treated as infinite."
! msgstr ""
! 
! #: c-family/c.opt:1026
! msgid "Generate checks for all read accesses to memory."
! msgstr ""
! 
! #: c-family/c.opt:1030
! msgid "Generate checks for all write accesses to memory."
! msgstr ""
! 
! #: c-family/c.opt:1034
! msgid "Generate bounds stores for pointer writes."
! msgstr ""
! 
! #: c-family/c.opt:1038
! msgid "Generate bounds passing for calls."
! msgstr ""
! 
! #: c-family/c.opt:1042
! msgid "Instrument only functions marked with bnd_instrument attribute."
! msgstr ""
! 
! #: c-family/c.opt:1046
! msgid "Transform instrumented builtin calls into calls to wrappers."
! msgstr ""
! 
! #: c-family/c.opt:1056
! msgid "Enable Cilk Plus"
! msgstr ""
! 
! #: c-family/c.opt:1060
! msgid "Allow the arguments of the '?' operator to have different types"
! msgstr ""
! 
! #: c-family/c.opt:1067
! #, c-format
! msgid "no class name specified with %qs"
! msgstr ""
! 
! #: c-family/c.opt:1068
! msgid "-fconst-string-class=<name>\tUse class <name> for constant strings"
! msgstr ""
! 
! #: c-family/c.opt:1072
! msgid "-fconstexpr-depth=<number>\tSpecify maximum constexpr recursion depth"
! msgstr ""
! 
! #: c-family/c.opt:1076
! msgid "Emit debug annotations during preprocessing"
! msgstr ""
! 
! #: c-family/c.opt:1080
! msgid ""
! "-fdeduce-init-list\tenable deduction of std::initializer_list for a template "
! "type parameter from a brace-enclosed initializer-list"
! msgstr ""
! 
! #: c-family/c.opt:1084
! msgid "Factor complex constructors and destructors to favor space over speed"
! msgstr ""
! 
! #: c-family/c.opt:1092
! msgid "Preprocess directives only."
! msgstr ""
! 
! #: c-family/c.opt:1096
! msgid "Permit '$' as an identifier character"
! msgstr ""
! 
! #: c-family/c.opt:1100
! msgid "Write all declarations as Ada code transitively"
! msgstr ""
! 
! #: c-family/c.opt:1104
! msgid "Write all declarations as Ada code for the given file only"
! msgstr ""
! 
! #: c-family/c.opt:1111
! msgid "Generate code to check exception specifications"
! msgstr ""
! 
! #: c-family/c.opt:1118
! msgid ""
! "-fexec-charset=<cset>\tConvert all strings and character constants to "
! "character set <cset>"
! msgstr ""
! 
! #: c-family/c.opt:1122
! msgid "Permit universal character names (\\u and \\U) in identifiers"
! msgstr ""
! 
! #: c-family/c.opt:1126
! msgid ""
! "-finput-charset=<cset>\tSpecify the default character set for source files"
! msgstr ""
! 
! #: c-family/c.opt:1130
! msgid ""
! "Support dynamic initialization of thread-local variables in a different "
! "translation unit"
! msgstr ""
! 
! #: c-family/c.opt:1137
! msgid "Scope of for-init-statement variables is local to the loop"
! msgstr ""
! 
! #: c-family/c.opt:1141
! msgid "Do not assume that standard C libraries and \"main\" exist"
! msgstr ""
! 
! #: c-family/c.opt:1145
! msgid "Recognize GNU-defined keywords"
! msgstr ""
! 
! #: c-family/c.opt:1149
! msgid "Generate code for GNU runtime environment"
! msgstr ""
! 
! #: c-family/c.opt:1153
! msgid "Use traditional GNU semantics for inline functions"
! msgstr ""
! 
! #: c-family/c.opt:1159
! msgid ""
! "-fhandle-exceptions has been renamed -fexceptions (and is now on by default)"
! msgstr ""
! 
! #: c-family/c.opt:1166
! msgid "Assume normal C execution environment"
! msgstr ""
! 
! #: c-family/c.opt:1174
! msgid "Export functions even if they can be inlined"
! msgstr ""
! 
! #: c-family/c.opt:1178
! msgid "Emit implicit instantiations of inline templates"
! msgstr ""
! 
! #: c-family/c.opt:1182
! msgid "Emit implicit instantiations of templates"
! msgstr ""
! 
! #: c-family/c.opt:1186
! msgid "Inject friend functions into enclosing namespace"
! msgstr ""
! 
! #: c-family/c.opt:1190
! msgid "Don't emit dllexported inline functions unless needed"
! msgstr ""
! 
! #: c-family/c.opt:1197
! msgid ""
! "Allow implicit conversions between vectors with differing numbers of "
! "subparts and/or differing element types."
! msgstr ""
! 
! #: c-family/c.opt:1201
! msgid "Don't warn about uses of Microsoft extensions"
! msgstr ""
! 
! #: c-family/c.opt:1220
! msgid "Generate code for NeXT (Apple Mac OS X) runtime environment"
! msgstr ""
! 
! #: c-family/c.opt:1224
! msgid "Assume that receivers of Objective-C messages may be nil"
! msgstr ""
! 
! #: c-family/c.opt:1228
! msgid ""
! "Allow access to instance variables as if they were local declarations within "
! "instance method implementations."
! msgstr ""
! 
! #: c-family/c.opt:1232
! msgid ""
! "-fvisibility=[private|protected|public|package]\tSet the default symbol "
! "visibility"
! msgstr ""
! 
! #: c-family/c.opt:1235
! #, c-format
! msgid "unrecognized ivar visibility value %qs"
! msgstr ""
! 
! #: c-family/c.opt:1257
! msgid ""
! "Treat a throw() exception specification as noexcept to improve code size"
! msgstr ""
! 
! #: c-family/c.opt:1261
! msgid ""
! "Specify which ABI to use for Objective-C family code and meta-data "
! "generation."
! msgstr ""
! 
! #: c-family/c.opt:1267
! msgid ""
! "Generate special Objective-C methods to initialize/destroy non-POD C++ "
! "ivars, if needed"
! msgstr ""
! 
! #: c-family/c.opt:1271
! msgid "Allow fast jumps to the message dispatcher"
! msgstr ""
! 
! #: c-family/c.opt:1277
! msgid "Enable Objective-C exception and synchronization syntax"
! msgstr ""
! 
! #: c-family/c.opt:1281
! msgid "Enable garbage collection (GC) in Objective-C/Objective-C++ programs"
! msgstr ""
! 
! #: c-family/c.opt:1285
! msgid ""
! "Enable inline checks for nil receivers with the NeXT runtime and ABI version "
! "2."
! msgstr ""
! 
! #: c-family/c.opt:1290
! msgid "Enable Objective-C setjmp exception handling runtime"
! msgstr ""
! 
! #: c-family/c.opt:1294
! msgid "Conform to the Objective-C 1.0 language as implemented in GCC 4.0"
! msgstr ""
! 
! #: c-family/c.opt:1298
! msgid "Enable OpenACC"
! msgstr ""
! 
! #: c-family/c.opt:1302
! msgid "Enable OpenMP (implies -frecursive in Fortran)"
! msgstr ""
! 
! #: c-family/c.opt:1306
! msgid "Enable OpenMP's SIMD directives"
! msgstr ""
! 
! #: c-family/c.opt:1310
! msgid "Recognize C++ keywords like \"compl\" and \"xor\""
! msgstr ""
! 
! #: c-family/c.opt:1321
! msgid "Look for and use PCH files even when preprocessing"
! msgstr ""
! 
! #: c-family/c.opt:1325
! msgid "Downgrade conformance errors to warnings"
! msgstr ""
! 
! #: c-family/c.opt:1329
! msgid "Enable Plan 9 language extensions"
! msgstr ""
! 
! #: c-family/c.opt:1333
! msgid "Treat the input file as already preprocessed"
! msgstr ""
! 
! #: c-family/c.opt:1341
! msgid ""
! "-ftrack-macro-expansion=<0|1|2>  Track locations of tokens coming from macro "
! "expansion and display them in error messages"
! msgstr ""
! 
! #: c-family/c.opt:1345
! msgid ""
! "-fno-pretty-templates Do not pretty-print template specializations as the "
! "template signature followed by the arguments"
! msgstr ""
! 
! #: c-family/c.opt:1349
! msgid ""
! "Used in Fix-and-Continue mode to indicate that object files may be swapped "
! "in at runtime"
! msgstr ""
! 
! #: c-family/c.opt:1353
! msgid "Enable automatic template instantiation"
! msgstr ""
! 
! #: c-family/c.opt:1357
! msgid "Generate run time type descriptor information"
! msgstr ""
! 
! #: c-family/c.opt:1361
! msgid "Use the same size for double as for float"
! msgstr ""
! 
! #: c-family/c.opt:1369
! msgid "Force the underlying type for \"wchar_t\" to be \"unsigned short\""
! msgstr ""
! 
! #: c-family/c.opt:1373
! msgid "When \"signed\" or \"unsigned\" is not given make the bitfield signed"
! msgstr ""
! 
! #: c-family/c.opt:1377
! msgid "Make \"char\" signed by default"
! msgstr ""
! 
! #: c-family/c.opt:1381
! msgid "Enable C++14 sized deallocation support"
! msgstr ""
! 
! #: c-family/c.opt:1388
! msgid "Display statistics accumulated during compilation"
! msgstr ""
! 
! #: c-family/c.opt:1392
! msgid ""
! "Assume that values of enumeration type are always within the minimum range "
! "of that type"
! msgstr ""
! 
! #: c-family/c.opt:1399
! msgid "-ftabstop=<number>\tDistance between tab stops for column reporting"
! msgstr ""
! 
! #: c-family/c.opt:1403
! msgid ""
! "Set the maximum number of template instantiation notes for a single warning "
! "or error"
! msgstr ""
! 
! #: c-family/c.opt:1410
! msgid "-ftemplate-depth=<number>\tSpecify maximum template instantiation depth"
! msgstr ""
! 
! #: c-family/c.opt:1417
! msgid ""
! "-fno-threadsafe-statics\tDo not generate thread-safe code for initializing "
! "local statics"
! msgstr ""
! 
! #: c-family/c.opt:1421
! msgid "When \"signed\" or \"unsigned\" is not given make the bitfield unsigned"
! msgstr ""
! 
! #: c-family/c.opt:1425
! msgid "Make \"char\" unsigned by default"
! msgstr ""
! 
! #: c-family/c.opt:1429
! msgid "Use __cxa_atexit to register destructors"
! msgstr ""
! 
! #: c-family/c.opt:1433
! msgid "Use __cxa_get_exception_ptr in exception handling"
! msgstr ""
! 
! #: c-family/c.opt:1437
! msgid "Marks all inlined functions and methods as having hidden visibility"
! msgstr ""
! 
! #: c-family/c.opt:1441
! msgid "Changes visibility to match Microsoft Visual Studio by default"
! msgstr ""
! 
! #: c-family/c.opt:1453
! msgid "Emit common-like symbols as weak symbols"
! msgstr ""
! 
! #: c-family/c.opt:1457
! msgid ""
! "-fwide-exec-charset=<cset>\tConvert all wide strings and character constants "
! "to character set <cset>"
! msgstr ""
! 
! #: c-family/c.opt:1461
! msgid "Generate a #line directive pointing at the current working directory"
! msgstr ""
! 
! #: c-family/c.opt:1469
! msgid ""
! "Generate lazy class lookup (via objc_getClass()) for use in Zero-Link mode"
! msgstr ""
! 
! #: c-family/c.opt:1473
! msgid "Dump declarations to a .decl file"
! msgstr ""
! 
! #: c-family/c.opt:1477
! msgid "-femit-struct-debug-baseonly\tAggressive reduced debug info for structs"
! msgstr ""
! 
! #: c-family/c.opt:1481
! msgid ""
! "-femit-struct-debug-reduced\tConservative reduced debug info for structs"
! msgstr ""
! 
! #: c-family/c.opt:1485
! msgid ""
! "-femit-struct-debug-detailed=<spec-list>\tDetailed reduced debug info for "
! "structs"
! msgstr ""
! 
! #: c-family/c.opt:1489
! msgid ""
! "Interpret imaginary, fixed-point, or other gnu number suffix as the "
! "corresponding number literal rather than a user-defined number literal."
! msgstr ""
! 
! #: c-family/c.opt:1494
! msgid "-idirafter <dir>\tAdd <dir> to the end of the system include path"
! msgstr ""
! 
! #: c-family/c.opt:1498
! msgid "-imacros <file>\tAccept definition of macros in <file>"
! msgstr ""
! 
! #: c-family/c.opt:1502
! msgid "-imultilib <dir>\tSet <dir> to be the multilib include subdirectory"
! msgstr ""
! 
! #: c-family/c.opt:1506
! msgid "-include <file>\tInclude the contents of <file> before other files"
! msgstr ""
! 
! #: c-family/c.opt:1510
! msgid "-iprefix <path>\tSpecify <path> as a prefix for next two options"
! msgstr ""
! 
! #: c-family/c.opt:1514
! msgid "-isysroot <dir>\tSet <dir> to be the system root directory"
! msgstr ""
! 
! #: c-family/c.opt:1518
! msgid "-isystem <dir>\tAdd <dir> to the start of the system include path"
! msgstr ""
! 
! #: c-family/c.opt:1522
! msgid "-iquote <dir>\tAdd <dir> to the end of the quote include path"
! msgstr ""
! 
! #: c-family/c.opt:1526
! msgid "-iwithprefix <dir>\tAdd <dir> to the end of the system include path"
! msgstr ""
! 
! #: c-family/c.opt:1530
! msgid "-iwithprefixbefore <dir>\tAdd <dir> to the end of the main include path"
! msgstr ""
! 
! #: c-family/c.opt:1540
! msgid ""
! "Do not search standard system include directories (those specified with -"
! "isystem will still be used)"
! msgstr ""
! 
! #: c-family/c.opt:1544
! msgid "Do not search standard system include directories for C++"
! msgstr ""
! 
! #: c-family/c.opt:1556
! msgid "Generate C header of platform-specific features"
! msgstr ""
! 
! #: c-family/c.opt:1560
! msgid "Remap file names when including files"
! msgstr ""
! 
! #: c-family/c.opt:1564 c-family/c.opt:1568
! msgid ""
! "Conform to the ISO 1998 C++ standard revised by the 2003 technical "
! "corrigendum"
! msgstr ""
! 
! #: c-family/c.opt:1572
! msgid "Conform to the ISO 2011 C++ standard"
! msgstr ""
! 
! #: c-family/c.opt:1576
! msgid "Deprecated in favor of -std=c++11"
! msgstr ""
! 
! #: c-family/c.opt:1580
! msgid "Deprecated in favor of -std=c++14"
! msgstr ""
! 
! #: c-family/c.opt:1584
! msgid ""
! "Conform to the ISO 2014 C++ standard (experimental and incomplete support)"
! msgstr ""
! 
! #: c-family/c.opt:1588
! msgid ""
! "Conform to the ISO 2017(?) C++ draft standard (experimental and incomplete "
! "support)"
! msgstr ""
! 
! #: c-family/c.opt:1595 c-family/c.opt:1691
! msgid "Conform to the ISO 2011 C standard"
! msgstr ""
! 
! #: c-family/c.opt:1599
! msgid "Deprecated in favor of -std=c11"
! msgstr ""
! 
! #: c-family/c.opt:1603 c-family/c.opt:1607 c-family/c.opt:1675
! msgid "Conform to the ISO 1990 C standard"
! msgstr ""
! 
! #: c-family/c.opt:1611 c-family/c.opt:1683
! msgid "Conform to the ISO 1999 C standard"
! msgstr ""
! 
! #: c-family/c.opt:1615
! msgid "Deprecated in favor of -std=c99"
! msgstr ""
! 
! #: c-family/c.opt:1619 c-family/c.opt:1624
! msgid ""
! "Conform to the ISO 1998 C++ standard revised by the 2003 technical "
! "corrigendum with GNU extensions"
! msgstr ""
! 
! #: c-family/c.opt:1629
! msgid ""
! "Conform to the ISO 2011 C++ standard with GNU extensions (experimental and "
! "incomplete support)"
! msgstr ""
! 
! #: c-family/c.opt:1633
! msgid "Deprecated in favor of -std=gnu++11"
! msgstr ""
! 
! #: c-family/c.opt:1640
! msgid ""
! "Conform to the ISO 2014 C++ standard with GNU extensions (experimental and "
! "incomplete support)"
! msgstr ""
! 
! #: c-family/c.opt:1644
! msgid ""
! "Conform to the ISO 201z(7?) C++ draft standard with GNU extensions "
! "(experimental and incomplete support)"
! msgstr ""
! 
! #: c-family/c.opt:1651
! msgid "Conform to the ISO 2011 C standard with GNU extensions"
! msgstr ""
! 
! #: c-family/c.opt:1655
! msgid "Deprecated in favor of -std=gnu11"
! msgstr ""
! 
! #: c-family/c.opt:1659 c-family/c.opt:1663
! msgid "Conform to the ISO 1990 C standard with GNU extensions"
! msgstr ""
! 
! #: c-family/c.opt:1667
! msgid "Conform to the ISO 1999 C standard with GNU extensions"
! msgstr ""
! 
! #: c-family/c.opt:1671
! msgid "Deprecated in favor of -std=gnu99"
! msgstr ""
! 
! #: c-family/c.opt:1679
! msgid "Conform to the ISO 1990 C standard as amended in 1994"
! msgstr ""
! 
! #: c-family/c.opt:1687
! msgid "Deprecated in favor of -std=iso9899:1999"
! msgstr ""
! 
! #: c-family/c.opt:1698
! msgid "Enable traditional preprocessing"
! msgstr ""
! 
! #: c-family/c.opt:1702
! msgid "-trigraphs\tSupport ISO C trigraphs"
! msgstr ""
! 
! #: c-family/c.opt:1706
! msgid "Do not predefine system-specific and GCC-specific macros"
! msgstr ""
! 
! #: fortran/lang.opt:146
! msgid "-J<directory>\tPut MODULE files in 'directory'"
! msgstr ""
! 
! #: fortran/lang.opt:198
! msgid "Warn about possible aliasing of dummy arguments"
! msgstr ""
! 
! #: fortran/lang.opt:202
! msgid "Warn about alignment of COMMON blocks"
! msgstr ""
! 
! #: fortran/lang.opt:206
! msgid "Warn about missing ampersand in continued character constants"
! msgstr ""
! 
! #: fortran/lang.opt:210
! msgid "Warn about creation of array temporaries"
! msgstr ""
! 
! #: fortran/lang.opt:214
! msgid "Warn if the type of a variable might be not interoperable with C"
! msgstr ""
! 
! #: fortran/lang.opt:222
! msgid "Warn about truncated character expressions"
! msgstr ""
! 
! #: fortran/lang.opt:226
! msgid "Warn about equality comparisons involving REAL or COMPLEX expressions"
! msgstr ""
! 
! #: fortran/lang.opt:234
! msgid "Warn about most implicit conversions"
! msgstr ""
! 
! #: fortran/lang.opt:242
! msgid "Warn about function call elimination"
! msgstr ""
! 
! #: fortran/lang.opt:246
! msgid "Warn about calls with implicit interface"
! msgstr ""
! 
! #: fortran/lang.opt:250
! msgid "Warn about called procedures not explicitly declared"
! msgstr ""
! 
! #: fortran/lang.opt:254
! msgid "Warn about truncated source lines"
! msgstr ""
! 
! #: fortran/lang.opt:258
! msgid "Warn on intrinsics not part of the selected standard"
! msgstr ""
! 
! #: fortran/lang.opt:270
! msgid "Warn about USE statements that have no ONLY qualifier"
! msgstr ""
! 
! #: fortran/lang.opt:282
! msgid "Warn about real-literal-constants with 'q' exponent-letter"
! msgstr ""
! 
! #: fortran/lang.opt:286
! msgid "Warn when a left-hand-side array variable is reallocated"
! msgstr ""
! 
! #: fortran/lang.opt:290
! msgid "Warn when a left-hand-side variable is reallocated"
! msgstr ""
! 
! #: fortran/lang.opt:294
! msgid "Warn if the pointer in a pointer assignment might outlive its target"
! msgstr ""
! 
! #: fortran/lang.opt:302
! msgid "Warn about \"suspicious\" constructs"
! msgstr ""
! 
! #: fortran/lang.opt:306
! msgid "Permit nonconforming uses of the tab character"
! msgstr ""
! 
! #: fortran/lang.opt:310
! msgid "Warn about underflow of numerical constant expressions"
! msgstr ""
! 
! #: fortran/lang.opt:318
! msgid "Warn if a user-procedure has the same name as an intrinsic"
! msgstr ""
! 
! #: fortran/lang.opt:326
! msgid "Warn about unused dummy arguments."
! msgstr ""
! 
! #: fortran/lang.opt:330
! msgid "Warn about zero-trip DO loops"
! msgstr ""
! 
! #: fortran/lang.opt:334
! msgid "Enable preprocessing"
! msgstr ""
! 
! #: fortran/lang.opt:342
! msgid "Disable preprocessing"
! msgstr ""
! 
! #: fortran/lang.opt:350
! msgid "Eliminate multiple function invokations also for impure functions"
! msgstr ""
! 
! #: fortran/lang.opt:354
! msgid "Enable alignment of COMMON blocks"
! msgstr ""
! 
! #: fortran/lang.opt:358
! msgid "All intrinsics procedures are available regardless of selected standard"
! msgstr ""
! 
! #: fortran/lang.opt:366
! msgid ""
! "Do not treat local variables and COMMON blocks as if they were named in SAVE "
! "statements"
! msgstr ""
! 
! #: fortran/lang.opt:370
! msgid "Specify that backslash in string introduces an escape character"
! msgstr ""
! 
! #: fortran/lang.opt:374
! msgid "Produce a backtrace when a runtime error is encountered"
! msgstr ""
! 
! #: fortran/lang.opt:378
! msgid ""
! "-fblas-matmul-limit=<n>\tSize of the smallest matrix for which matmul will "
! "use BLAS"
! msgstr ""
! 
! #: fortran/lang.opt:382
! msgid ""
! "Produce a warning at runtime if a array temporary has been created for a "
! "procedure argument"
! msgstr ""
! 
! #: fortran/lang.opt:386
! msgid ""
! "-fconvert=<big-endian|little-endian|native|swap> The endianness used for "
! "unformatted files."
! msgstr ""
! 
! #: fortran/lang.opt:389
! #, c-format
! msgid "Unrecognized option to endianess value: %qs"
! msgstr ""
! 
! #: fortran/lang.opt:405
! msgid "Use the Cray Pointer extension"
! msgstr ""
! 
! #: fortran/lang.opt:409
! msgid "Ignore 'D' in column one in fixed form"
! msgstr ""
! 
! #: fortran/lang.opt:413
! msgid "Treat lines with 'D' in column one as comments"
! msgstr ""
! 
! #: fortran/lang.opt:417
! msgid "Set the default double precision kind to an 8 byte wide type"
! msgstr ""
! 
! #: fortran/lang.opt:421
! msgid "Set the default integer kind to an 8 byte wide type"
! msgstr ""
! 
! #: fortran/lang.opt:425
! msgid "Set the default real kind to an 8 byte wide type"
! msgstr ""
! 
! #: fortran/lang.opt:429
! msgid "Allow dollar signs in entity names"
! msgstr ""
! 
! #: fortran/lang.opt:437
! msgid "Display the code tree after parsing"
! msgstr ""
! 
! #: fortran/lang.opt:441
! msgid "Display the code tree after front end optimization"
! msgstr ""
! 
! #: fortran/lang.opt:445
! msgid "Display the code tree after parsing; deprecated option"
! msgstr ""
! 
! #: fortran/lang.opt:449
! msgid ""
! "Specify that an external BLAS library should be used for matmul calls on "
! "large-size arrays"
! msgstr ""
! 
! #: fortran/lang.opt:453
! msgid "Use f2c calling convention"
! msgstr ""
! 
! #: fortran/lang.opt:457
! msgid "Assume that the source file is fixed form"
! msgstr ""
! 
! #: fortran/lang.opt:461
! msgid "Interpret any INTEGER(4) as an INTEGER(8)"
! msgstr ""
! 
! #: fortran/lang.opt:465 fortran/lang.opt:469
! msgid "Specify where to find the compiled intrinsic modules"
! msgstr ""
! 
! #: fortran/lang.opt:473
! msgid "Allow arbitrary character line width in fixed mode"
! msgstr ""
! 
! #: fortran/lang.opt:477
! msgid "-ffixed-line-length-<n>\tUse n as character line width in fixed mode"
! msgstr ""
! 
! #: fortran/lang.opt:481
! msgid "-ffpe-trap=[...]\tStop on following floating point exceptions"
! msgstr ""
! 
! #: fortran/lang.opt:485
! msgid "-ffpe-summary=[...]\tPrint summary of floating point exceptions"
! msgstr ""
! 
! #: fortran/lang.opt:489
! msgid "Assume that the source file is free form"
! msgstr ""
! 
! #: fortran/lang.opt:493
! msgid "Allow arbitrary character line width in free mode"
! msgstr ""
! 
! #: fortran/lang.opt:497
! msgid "-ffree-line-length-<n>\tUse n as character line width in free mode"
! msgstr ""
! 
! #: fortran/lang.opt:501
! msgid "Enable front end optimization"
! msgstr ""
! 
! #: fortran/lang.opt:505
! msgid ""
! "Specify that no implicit typing is allowed, unless overridden by explicit "
! "IMPLICIT statements"
! msgstr ""
! 
! #: fortran/lang.opt:509
! msgid ""
! "-finit-character=<n>\tInitialize local character variables to ASCII value n"
! msgstr ""
! 
! #: fortran/lang.opt:513
! msgid "-finit-integer=<n>\tInitialize local integer variables to n"
! msgstr ""
! 
! #: fortran/lang.opt:517
! msgid "Initialize local variables to zero (from g77)"
! msgstr ""
! 
! #: fortran/lang.opt:521
! msgid "-finit-logical=<true|false>\tInitialize local logical variables"
! msgstr ""
! 
! #: fortran/lang.opt:525
! msgid "-finit-real=<zero|snan|nan|inf|-inf>\tInitialize local real variables"
! msgstr ""
! 
! #: fortran/lang.opt:528
! #, c-format
! msgid "Unrecognized option to floating-point init value: %qs"
! msgstr ""
! 
! #: fortran/lang.opt:547
! msgid ""
! "-fmax-array-constructor=<n>\tMaximum number of objects in an array "
! "constructor"
! msgstr ""
! 
! #: fortran/lang.opt:551
! msgid "-fmax-identifier-length=<n>\tMaximum identifier length"
! msgstr ""
! 
! #: fortran/lang.opt:555
! msgid "-fmax-subrecord-length=<n>\tMaximum length for subrecords"
! msgstr ""
! 
! #: fortran/lang.opt:559
! msgid ""
! "-fmax-stack-var-size=<n>\tSize in bytes of the largest array that will be "
! "put on the stack"
! msgstr ""
! 
! #: fortran/lang.opt:563
! msgid "Put all local arrays on stack."
! msgstr ""
! 
! #: fortran/lang.opt:567
! msgid "Set default accessibility of module entities to PRIVATE."
! msgstr ""
! 
! #: fortran/lang.opt:583
! msgid "Try to lay out derived types as compactly as possible"
! msgstr ""
! 
! #: fortran/lang.opt:591
! msgid "Protect parentheses in expressions"
! msgstr ""
! 
! #: fortran/lang.opt:595
! msgid "Enable range checking during compilation"
! msgstr ""
! 
! #: fortran/lang.opt:599
! msgid "Interpret any REAL(4) as a REAL(8)"
! msgstr ""
! 
! #: fortran/lang.opt:603
! msgid "Interpret any REAL(4) as a REAL(10)"
! msgstr ""
! 
! #: fortran/lang.opt:607
! msgid "Interpret any REAL(4) as a REAL(16)"
! msgstr ""
! 
! #: fortran/lang.opt:611
! msgid "Interpret any REAL(8) as a REAL(4)"
! msgstr ""
! 
! #: fortran/lang.opt:615
! msgid "Interpret any REAL(8) as a REAL(10)"
! msgstr ""
! 
! #: fortran/lang.opt:619
! msgid "Interpret any REAL(8) as a REAL(16)"
! msgstr ""
! 
! #: fortran/lang.opt:623
! msgid "Reallocate the LHS in assignments"
! msgstr ""
! 
! #: fortran/lang.opt:627
! msgid "Use a 4-byte record marker for unformatted files"
! msgstr ""
! 
! #: fortran/lang.opt:631
! msgid "Use an 8-byte record marker for unformatted files"
! msgstr ""
! 
! #: fortran/lang.opt:635
! msgid "Allocate local variables on the stack to allow indirect recursion"
! msgstr ""
! 
! #: fortran/lang.opt:639
! msgid "Copy array sections into a contiguous block on procedure entry"
! msgstr ""
! 
! #: fortran/lang.opt:643
! msgid ""
! "-fcoarray=<none|single|lib>\tSpecify which coarray parallelization should be "
! "used"
! msgstr ""
! 
! #: fortran/lang.opt:646
! #, c-format
! msgid "Unrecognized option: %qs"
! msgstr ""
! 
! #: fortran/lang.opt:659
! msgid "-fcheck=[...]\tSpecify which runtime checks are to be performed"
! msgstr ""
! 
! #: fortran/lang.opt:663
! msgid "Append a second underscore if the name already contains an underscore"
! msgstr ""
! 
! #: fortran/lang.opt:671
! msgid "Apply negative sign to zero values"
! msgstr ""
! 
! #: fortran/lang.opt:675
! msgid "Append underscores to externally visible names"
! msgstr ""
! 
! #: fortran/lang.opt:719
! msgid "Statically link the GNU Fortran helper library (libgfortran)"
! msgstr ""
! 
! #: fortran/lang.opt:723
! msgid "Conform to the ISO Fortran 2003 standard"
! msgstr ""
! 
! #: fortran/lang.opt:727
! msgid "Conform to the ISO Fortran 2008 standard"
! msgstr ""
! 
! #: fortran/lang.opt:731
! msgid "Conform to the ISO Fortran 2008 standard including TS 29113"
! msgstr ""
! 
! #: fortran/lang.opt:735
! msgid "Conform to the ISO Fortran 95 standard"
! msgstr ""
! 
! #: fortran/lang.opt:739
! msgid "Conform to nothing in particular"
! msgstr ""
! 
! #: fortran/lang.opt:743
! msgid "Accept extensions to support legacy code"
! msgstr ""
! 
! #: lto/lang.opt:29
! msgid "Run the link-time optimizer in local transformation (LTRANS) mode."
! msgstr ""
! 
! #: lto/lang.opt:33
! msgid "Specify a file to which a list of files output by LTRANS is written."
! msgstr ""
! 
! #: lto/lang.opt:37
! msgid "Run the link-time optimizer in whole program analysis (WPA) mode."
! msgstr ""
! 
! #: lto/lang.opt:41
! msgid ""
! "Whole program analysis (WPA) mode with number of parallel jobs specified."
! msgstr ""
! 
! #: lto/lang.opt:45
! msgid "The resolution file"
! msgstr ""
! 
! #: go/gofrontend/expressions.cc:93 c-family/c-common.c:1910 cp/cvt.c:1183
! #: cp/cvt.c:1431
  #, gcc-internal-format
  msgid "value computed is not used"
  msgstr ""
*************** msgstr ""
*** 14992,15008 ****
  #: go/gofrontend/expressions.cc:6827 go/gofrontend/expressions.cc:6888
  #: go/gofrontend/expressions.cc:6990 go/gofrontend/expressions.cc:7804
  #: go/gofrontend/expressions.cc:7953 go/gofrontend/expressions.cc:7999
! #: go/gofrontend/expressions.cc:8058 go/gofrontend/expressions.cc:9210
! #: go/gofrontend/expressions.cc:9227 go/gofrontend/expressions.cc:9243
  msgid "not enough arguments"
  msgstr ""
  
  #: go/gofrontend/expressions.cc:6829 go/gofrontend/expressions.cc:6890
  #: go/gofrontend/expressions.cc:7809 go/gofrontend/expressions.cc:7936
  #: go/gofrontend/expressions.cc:7958 go/gofrontend/expressions.cc:8004
! #: go/gofrontend/expressions.cc:8060 go/gofrontend/expressions.cc:8808
! #: go/gofrontend/expressions.cc:9215 go/gofrontend/expressions.cc:9229
! #: go/gofrontend/expressions.cc:9250
  msgid "too many arguments"
  msgstr ""
  
--- 15081,15097 ----
  #: go/gofrontend/expressions.cc:6827 go/gofrontend/expressions.cc:6888
  #: go/gofrontend/expressions.cc:6990 go/gofrontend/expressions.cc:7804
  #: go/gofrontend/expressions.cc:7953 go/gofrontend/expressions.cc:7999
! #: go/gofrontend/expressions.cc:8058 go/gofrontend/expressions.cc:9220
! #: go/gofrontend/expressions.cc:9237 go/gofrontend/expressions.cc:9253
  msgid "not enough arguments"
  msgstr ""
  
  #: go/gofrontend/expressions.cc:6829 go/gofrontend/expressions.cc:6890
  #: go/gofrontend/expressions.cc:7809 go/gofrontend/expressions.cc:7936
  #: go/gofrontend/expressions.cc:7958 go/gofrontend/expressions.cc:8004
! #: go/gofrontend/expressions.cc:8060 go/gofrontend/expressions.cc:8818
! #: go/gofrontend/expressions.cc:9225 go/gofrontend/expressions.cc:9239
! #: go/gofrontend/expressions.cc:9260
  msgid "too many arguments"
  msgstr ""
  
*************** msgstr ""
*** 15082,15165 ****
  msgid "complex arguments must have floating-point type"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:8620 go/gofrontend/expressions.cc:9156
! #: go/gofrontend/expressions.cc:9592
  msgid "expected function"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:8647
  msgid "multiple-value argument in single-value context"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:8812
  msgid "invalid use of %<...%> with non-slice"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9164
  msgid "function result count mismatch"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9182
  msgid "incompatible type for receiver"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9200
  msgid "invalid use of %<...%> calling non-variadic function"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9601 go/gofrontend/expressions.cc:9615
  msgid "number of results does not match number of values"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9971 go/gofrontend/expressions.cc:10483
  msgid "index must be integer"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9979 go/gofrontend/expressions.cc:10491
  msgid "slice end must be integer"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9987
  msgid "slice capacity must be integer"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:10037 go/gofrontend/expressions.cc:10522
  msgid "inverted slice range"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:10080
  msgid "slice of unaddressable value"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:10741
  msgid "incompatible type for map index"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:11120
  msgid "expected interface or pointer to interface"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:11859
  msgid "too many expressions for struct"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:11872
  msgid "too few expressions for struct"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:13620 go/gofrontend/statements.cc:1585
  msgid "type assertion only valid for interface types"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:13632
  msgid "impossible type assertion: type does not implement interface"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:13811 go/gofrontend/statements.cc:1430
  msgid "expected channel"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:13816 go/gofrontend/statements.cc:1435
  msgid "invalid receive on send-only channel"
  msgstr ""
  
--- 15171,15254 ----
  msgid "complex arguments must have floating-point type"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:8630 go/gofrontend/expressions.cc:9166
! #: go/gofrontend/expressions.cc:9602
  msgid "expected function"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:8657
  msgid "multiple-value argument in single-value context"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:8822
  msgid "invalid use of %<...%> with non-slice"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9174
  msgid "function result count mismatch"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9192
  msgid "incompatible type for receiver"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9210
  msgid "invalid use of %<...%> calling non-variadic function"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9611 go/gofrontend/expressions.cc:9625
  msgid "number of results does not match number of values"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9981 go/gofrontend/expressions.cc:10493
  msgid "index must be integer"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9989 go/gofrontend/expressions.cc:10501
  msgid "slice end must be integer"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:9997
  msgid "slice capacity must be integer"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:10047 go/gofrontend/expressions.cc:10532
  msgid "inverted slice range"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:10090
  msgid "slice of unaddressable value"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:10751
  msgid "incompatible type for map index"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:11130
  msgid "expected interface or pointer to interface"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:11869
  msgid "too many expressions for struct"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:11882
  msgid "too few expressions for struct"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:13630 go/gofrontend/statements.cc:1585
  msgid "type assertion only valid for interface types"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:13642
  msgid "impossible type assertion: type does not implement interface"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:13821 go/gofrontend/statements.cc:1430
  msgid "expected channel"
  msgstr ""
  
! #: go/gofrontend/expressions.cc:13826 go/gofrontend/statements.cc:1435
  msgid "invalid receive on send-only channel"
  msgstr ""
  
*************** msgstr ""
*** 15270,15340 ****
  msgid "cannot use type %s as type %s"
  msgstr ""
  
! #: go/gofrontend/types.cc:3479
  msgid "different receiver types"
  msgstr ""
  
! #: go/gofrontend/types.cc:3499 go/gofrontend/types.cc:3512
! #: go/gofrontend/types.cc:3527
  msgid "different number of parameters"
  msgstr ""
  
! #: go/gofrontend/types.cc:3520
  msgid "different parameter types"
  msgstr ""
  
! #: go/gofrontend/types.cc:3535
  msgid "different varargs"
  msgstr ""
  
! #: go/gofrontend/types.cc:3544 go/gofrontend/types.cc:3557
! #: go/gofrontend/types.cc:3572
  msgid "different number of results"
  msgstr ""
  
! #: go/gofrontend/types.cc:3565
  msgid "different result types"
  msgstr ""
  
! #: go/gofrontend/types.cc:7359
  #, c-format
  msgid "need explicit conversion; missing method %s%s%s"
  msgstr ""
  
! #: go/gofrontend/types.cc:7376 go/gofrontend/types.cc:7518
  #, c-format
  msgid "incompatible type for method %s%s%s"
  msgstr ""
  
! #: go/gofrontend/types.cc:7380 go/gofrontend/types.cc:7522
  #, c-format
  msgid "incompatible type for method %s%s%s (%s)"
  msgstr ""
  
! #: go/gofrontend/types.cc:7459 go/gofrontend/types.cc:7472
  msgid "pointer to interface type has no methods"
  msgstr ""
  
! #: go/gofrontend/types.cc:7461 go/gofrontend/types.cc:7474
  msgid "type has no methods"
  msgstr ""
  
! #: go/gofrontend/types.cc:7495
  #, c-format
  msgid "ambiguous method %s%s%s"
  msgstr ""
  
! #: go/gofrontend/types.cc:7498
  #, c-format
  msgid "missing method %s%s%s"
  msgstr ""
  
! #: go/gofrontend/types.cc:7539
  #, c-format
  msgid "method %s%s%s requires a pointer receiver"
  msgstr ""
  
! #: go/gofrontend/types.cc:7557
  #, c-format
  msgid "method %s%s%s is marked go:nointerface"
  msgstr ""
--- 15359,15429 ----
  msgid "cannot use type %s as type %s"
  msgstr ""
  
! #: go/gofrontend/types.cc:3488
  msgid "different receiver types"
  msgstr ""
  
! #: go/gofrontend/types.cc:3508 go/gofrontend/types.cc:3521
! #: go/gofrontend/types.cc:3536
  msgid "different number of parameters"
  msgstr ""
  
! #: go/gofrontend/types.cc:3529
  msgid "different parameter types"
  msgstr ""
  
! #: go/gofrontend/types.cc:3544
  msgid "different varargs"
  msgstr ""
  
! #: go/gofrontend/types.cc:3553 go/gofrontend/types.cc:3566
! #: go/gofrontend/types.cc:3581
  msgid "different number of results"
  msgstr ""
  
! #: go/gofrontend/types.cc:3574
  msgid "different result types"
  msgstr ""
  
! #: go/gofrontend/types.cc:7368
  #, c-format
  msgid "need explicit conversion; missing method %s%s%s"
  msgstr ""
  
! #: go/gofrontend/types.cc:7385 go/gofrontend/types.cc:7527
  #, c-format
  msgid "incompatible type for method %s%s%s"
  msgstr ""
  
! #: go/gofrontend/types.cc:7389 go/gofrontend/types.cc:7531
  #, c-format
  msgid "incompatible type for method %s%s%s (%s)"
  msgstr ""
  
! #: go/gofrontend/types.cc:7468 go/gofrontend/types.cc:7481
  msgid "pointer to interface type has no methods"
  msgstr ""
  
! #: go/gofrontend/types.cc:7470 go/gofrontend/types.cc:7483
  msgid "type has no methods"
  msgstr ""
  
! #: go/gofrontend/types.cc:7504
  #, c-format
  msgid "ambiguous method %s%s%s"
  msgstr ""
  
! #: go/gofrontend/types.cc:7507
  #, c-format
  msgid "missing method %s%s%s"
  msgstr ""
  
! #: go/gofrontend/types.cc:7548
  #, c-format
  msgid "method %s%s%s requires a pointer receiver"
  msgstr ""
  
! #: go/gofrontend/types.cc:7566
  #, c-format
  msgid "method %s%s%s is marked go:nointerface"
  msgstr ""
*************** msgid ""
*** 15430,15656 ****
  "branch target register load optimization is not intended to be run twice"
  msgstr ""
  
! #: builtins.c:639
  #, gcc-internal-format
  msgid "offset outside bounds of constant string"
  msgstr ""
  
! #: builtins.c:1268
  #, gcc-internal-format
  msgid "second argument to %<__builtin_prefetch%> must be a constant"
  msgstr ""
  
! #: builtins.c:1275
  #, gcc-internal-format
  msgid "invalid second argument to %<__builtin_prefetch%>; using zero"
  msgstr ""
  
! #: builtins.c:1283
  #, gcc-internal-format
  msgid "third argument to %<__builtin_prefetch%> must be a constant"
  msgstr ""
  
! #: builtins.c:1290
  #, gcc-internal-format
  msgid "invalid third argument to %<__builtin_prefetch%>; using zero"
  msgstr ""
  
! #: builtins.c:4486 gimplify.c:2351
  #, gcc-internal-format
  msgid "too few arguments to function %<va_start%>"
  msgstr ""
  
! #: builtins.c:4586
  #, gcc-internal-format
  msgid "invalid argument to %<__builtin_frame_address%>"
  msgstr ""
  
! #: builtins.c:4588
  #, gcc-internal-format
  msgid "invalid argument to %<__builtin_return_address%>"
  msgstr ""
  
! #: builtins.c:4601
  #, gcc-internal-format
  msgid "unsupported argument to %<__builtin_frame_address%>"
  msgstr ""
  
! #: builtins.c:4603
  #, gcc-internal-format
  msgid "unsupported argument to %<__builtin_return_address%>"
  msgstr ""
  
! #: builtins.c:4853
  #, gcc-internal-format
  msgid "both arguments to %<__builtin___clear_cache%> must be pointers"
  msgstr ""
  
! #: builtins.c:4952
  #, gcc-internal-format
  msgid "trampoline generated for nested function %qD"
  msgstr ""
  
! #: builtins.c:5248 builtins.c:5261
  #, gcc-internal-format
  msgid "%qD changed semantics in GCC 4.4"
  msgstr ""
  
! #: builtins.c:5365
  #, gcc-internal-format
  msgid "Unknown architecture specifier in memory model to builtin."
  msgstr ""
  
! #: builtins.c:5372
  #, gcc-internal-format
  msgid "invalid memory model argument to builtin"
  msgstr ""
  
! #: builtins.c:5431
  #, gcc-internal-format
  msgid ""
  "failure memory model cannot be stronger than success memory model for "
  "%<__atomic_compare_exchange%>"
  msgstr ""
  
! #: builtins.c:5440
  #, gcc-internal-format
  msgid "invalid failure memory model for %<__atomic_compare_exchange%>"
  msgstr ""
  
! #: builtins.c:5503
  #, gcc-internal-format
  msgid "invalid memory model for %<__atomic_load%>"
  msgstr ""
  
! #: builtins.c:5534 builtins.c:5643
  #, gcc-internal-format
  msgid "invalid memory model for %<__atomic_store%>"
  msgstr ""
  
! #: builtins.c:5752
  #, gcc-internal-format
  msgid "non-constant argument 1 to __atomic_always_lock_free"
  msgstr ""
  
! #: builtins.c:5794
  #, gcc-internal-format
  msgid "non-integer argument 1 to __atomic_is_lock_free"
  msgstr ""
  
! #: builtins.c:5858
  #, gcc-internal-format
  msgid "__builtin_thread_pointer is not supported on this target"
  msgstr ""
  
! #: builtins.c:5878
  #, gcc-internal-format
  msgid "__builtin_set_thread_pointer is not supported on this target"
  msgstr ""
  
  #. All valid uses of __builtin_va_arg_pack () are removed during
  #. inlining.
! #: builtins.c:6222 expr.c:10463
  #, gcc-internal-format
  msgid "%Kinvalid use of %<__builtin_va_arg_pack ()%>"
  msgstr ""
  
  #. All valid uses of __builtin_va_arg_pack_len () are removed during
  #. inlining.
! #: builtins.c:6228
  #, gcc-internal-format
  msgid "%Kinvalid use of %<__builtin_va_arg_pack_len ()%>"
  msgstr ""
  
! #: builtins.c:6447
  #, gcc-internal-format
  msgid "%<__builtin_longjmp%> second argument must be 1"
  msgstr ""
  
  #. Software implementation of Pointer Bounds Checker is NYI.
  #. Target support is required.
! #: builtins.c:7086
  #, gcc-internal-format
  msgid "Your target platform does not support -fcheck-pointer-bounds"
  msgstr ""
  
! #: builtins.c:7408
  #, gcc-internal-format
  msgid "target format does not support infinity"
  msgstr ""
  
! #: builtins.c:11228
  #, gcc-internal-format
  msgid "%<va_start%> used in function with fixed args"
  msgstr ""
  
! #: builtins.c:11236
  #, gcc-internal-format
  msgid "wrong number of arguments to function %<va_start%>"
  msgstr ""
  
! #: builtins.c:11251
  #, gcc-internal-format
  msgid "%<__builtin_next_arg%> called without an argument"
  msgstr ""
  
! #: builtins.c:11256
  #, gcc-internal-format
  msgid "wrong number of arguments to function %<__builtin_next_arg%>"
  msgstr ""
  
! #: builtins.c:11288
  #, gcc-internal-format
  msgid "second parameter of %<va_start%> not last named argument"
  msgstr ""
  
! #: builtins.c:11301
  #, gcc-internal-format
  msgid ""
  "undefined behaviour when second parameter of %<va_start%> is declared with "
  "%<register%> storage"
  msgstr ""
  
! #: builtins.c:11330
  #, gcc-internal-format
  msgid "%Kfirst argument of %D must be a pointer, second integer constant"
  msgstr ""
  
! #: builtins.c:11343
  #, gcc-internal-format
  msgid "%Klast argument of %D is not integer constant between 0 and 3"
  msgstr ""
  
! #: builtins.c:11388 builtins.c:11539 builtins.c:11596
  #, gcc-internal-format
  msgid "%Kcall to %D will always overflow destination buffer"
  msgstr ""
  
! #: builtins.c:11529
  #, gcc-internal-format
  msgid "%Kcall to %D might overflow destination buffer"
  msgstr ""
  
! #: builtins.c:11617
  #, gcc-internal-format
  msgid "%Kattempt to free a non-heap object %qD"
  msgstr ""
  
! #: builtins.c:11620
  #, gcc-internal-format
  msgid "%Kattempt to free a non-heap object"
  msgstr ""
  
! #: calls.c:2503
  #, gcc-internal-format
  msgid "function call has aggregate value"
  msgstr ""
  
! #: calls.c:3195
  #, gcc-internal-format
  msgid "passing too large argument on stack"
  msgstr ""
  
! #: cfgexpand.c:1376 function.c:1002 varasm.c:2163
  #, gcc-internal-format
  msgid "size of variable %q+D is too large"
  msgstr ""
--- 15519,15745 ----
  "branch target register load optimization is not intended to be run twice"
  msgstr ""
  
! #: builtins.c:643
  #, gcc-internal-format
  msgid "offset outside bounds of constant string"
  msgstr ""
  
! #: builtins.c:1272
  #, gcc-internal-format
  msgid "second argument to %<__builtin_prefetch%> must be a constant"
  msgstr ""
  
! #: builtins.c:1279
  #, gcc-internal-format
  msgid "invalid second argument to %<__builtin_prefetch%>; using zero"
  msgstr ""
  
! #: builtins.c:1287
  #, gcc-internal-format
  msgid "third argument to %<__builtin_prefetch%> must be a constant"
  msgstr ""
  
! #: builtins.c:1294
  #, gcc-internal-format
  msgid "invalid third argument to %<__builtin_prefetch%>; using zero"
  msgstr ""
  
! #: builtins.c:4490 gimplify.c:2352
  #, gcc-internal-format
  msgid "too few arguments to function %<va_start%>"
  msgstr ""
  
! #: builtins.c:4590
  #, gcc-internal-format
  msgid "invalid argument to %<__builtin_frame_address%>"
  msgstr ""
  
! #: builtins.c:4592
  #, gcc-internal-format
  msgid "invalid argument to %<__builtin_return_address%>"
  msgstr ""
  
! #: builtins.c:4605
  #, gcc-internal-format
  msgid "unsupported argument to %<__builtin_frame_address%>"
  msgstr ""
  
! #: builtins.c:4607
  #, gcc-internal-format
  msgid "unsupported argument to %<__builtin_return_address%>"
  msgstr ""
  
! #: builtins.c:4857
  #, gcc-internal-format
  msgid "both arguments to %<__builtin___clear_cache%> must be pointers"
  msgstr ""
  
! #: builtins.c:4956
  #, gcc-internal-format
  msgid "trampoline generated for nested function %qD"
  msgstr ""
  
! #: builtins.c:5252 builtins.c:5265
  #, gcc-internal-format
  msgid "%qD changed semantics in GCC 4.4"
  msgstr ""
  
! #: builtins.c:5369
  #, gcc-internal-format
  msgid "Unknown architecture specifier in memory model to builtin."
  msgstr ""
  
! #: builtins.c:5377
  #, gcc-internal-format
  msgid "invalid memory model argument to builtin"
  msgstr ""
  
! #: builtins.c:5436
  #, gcc-internal-format
  msgid ""
  "failure memory model cannot be stronger than success memory model for "
  "%<__atomic_compare_exchange%>"
  msgstr ""
  
! #: builtins.c:5444
  #, gcc-internal-format
  msgid "invalid failure memory model for %<__atomic_compare_exchange%>"
  msgstr ""
  
! #: builtins.c:5506
  #, gcc-internal-format
  msgid "invalid memory model for %<__atomic_load%>"
  msgstr ""
  
! #: builtins.c:5536 builtins.c:5643
  #, gcc-internal-format
  msgid "invalid memory model for %<__atomic_store%>"
  msgstr ""
  
! #: builtins.c:5764
  #, gcc-internal-format
  msgid "non-constant argument 1 to __atomic_always_lock_free"
  msgstr ""
  
! #: builtins.c:5806
  #, gcc-internal-format
  msgid "non-integer argument 1 to __atomic_is_lock_free"
  msgstr ""
  
! #: builtins.c:5870
  #, gcc-internal-format
  msgid "__builtin_thread_pointer is not supported on this target"
  msgstr ""
  
! #: builtins.c:5890
  #, gcc-internal-format
  msgid "__builtin_set_thread_pointer is not supported on this target"
  msgstr ""
  
  #. All valid uses of __builtin_va_arg_pack () are removed during
  #. inlining.
! #: builtins.c:6234 expr.c:10470
  #, gcc-internal-format
  msgid "%Kinvalid use of %<__builtin_va_arg_pack ()%>"
  msgstr ""
  
  #. All valid uses of __builtin_va_arg_pack_len () are removed during
  #. inlining.
! #: builtins.c:6240
  #, gcc-internal-format
  msgid "%Kinvalid use of %<__builtin_va_arg_pack_len ()%>"
  msgstr ""
  
! #: builtins.c:6459
  #, gcc-internal-format
  msgid "%<__builtin_longjmp%> second argument must be 1"
  msgstr ""
  
  #. Software implementation of Pointer Bounds Checker is NYI.
  #. Target support is required.
! #: builtins.c:7098
  #, gcc-internal-format
  msgid "Your target platform does not support -fcheck-pointer-bounds"
  msgstr ""
  
! #: builtins.c:7420
  #, gcc-internal-format
  msgid "target format does not support infinity"
  msgstr ""
  
! #: builtins.c:11318
  #, gcc-internal-format
  msgid "%<va_start%> used in function with fixed args"
  msgstr ""
  
! #: builtins.c:11326
  #, gcc-internal-format
  msgid "wrong number of arguments to function %<va_start%>"
  msgstr ""
  
! #: builtins.c:11341
  #, gcc-internal-format
  msgid "%<__builtin_next_arg%> called without an argument"
  msgstr ""
  
! #: builtins.c:11346
  #, gcc-internal-format
  msgid "wrong number of arguments to function %<__builtin_next_arg%>"
  msgstr ""
  
! #: builtins.c:11378
  #, gcc-internal-format
  msgid "second parameter of %<va_start%> not last named argument"
  msgstr ""
  
! #: builtins.c:11391
  #, gcc-internal-format
  msgid ""
  "undefined behaviour when second parameter of %<va_start%> is declared with "
  "%<register%> storage"
  msgstr ""
  
! #: builtins.c:11420
  #, gcc-internal-format
  msgid "%Kfirst argument of %D must be a pointer, second integer constant"
  msgstr ""
  
! #: builtins.c:11433
  #, gcc-internal-format
  msgid "%Klast argument of %D is not integer constant between 0 and 3"
  msgstr ""
  
! #: builtins.c:11478 builtins.c:11629 builtins.c:11686
  #, gcc-internal-format
  msgid "%Kcall to %D will always overflow destination buffer"
  msgstr ""
  
! #: builtins.c:11619
  #, gcc-internal-format
  msgid "%Kcall to %D might overflow destination buffer"
  msgstr ""
  
! #: builtins.c:11707
  #, gcc-internal-format
  msgid "%Kattempt to free a non-heap object %qD"
  msgstr ""
  
! #: builtins.c:11710
  #, gcc-internal-format
  msgid "%Kattempt to free a non-heap object"
  msgstr ""
  
! #: calls.c:2511
  #, gcc-internal-format
  msgid "function call has aggregate value"
  msgstr ""
  
! #: calls.c:3212
  #, gcc-internal-format
  msgid "passing too large argument on stack"
  msgstr ""
  
! #: cfgexpand.c:1376 function.c:1002 varasm.c:2166
  #, gcc-internal-format
  msgid "size of variable %q+D is too large"
  msgstr ""
*************** msgstr ""
*** 15705,15716 ****
  msgid "asm clobber conflict with input operand"
  msgstr ""
  
! #: cfgexpand.c:6011
  #, gcc-internal-format
  msgid "stack protector not protecting local variables: variable length buffer"
  msgstr ""
  
! #: cfgexpand.c:6015
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "stack protector not protecting function: all local arrays are less than %d "
--- 15794,15805 ----
  msgid "asm clobber conflict with input operand"
  msgstr ""
  
! #: cfgexpand.c:6036
  #, gcc-internal-format
  msgid "stack protector not protecting local variables: variable length buffer"
  msgstr ""
  
! #: cfgexpand.c:6040
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "stack protector not protecting function: all local arrays are less than %d "
*************** msgstr ""
*** 16207,16532 ****
  msgid "number of bb notes in insn chain (%d) != n_basic_blocks (%d)"
  msgstr ""
  
! #: cgraph.c:2675
  #, gcc-internal-format
  msgid "caller edge count is negative"
  msgstr ""
  
! #: cgraph.c:2680
  #, gcc-internal-format
  msgid "caller edge frequency is negative"
  msgstr ""
  
! #: cgraph.c:2685
  #, gcc-internal-format
  msgid "caller edge frequency is too large"
  msgstr ""
  
! #: cgraph.c:2769
  #, gcc-internal-format, gfc-internal-format
  msgid "aux field set for edge %s->%s"
  msgstr ""
  
! #: cgraph.c:2776
  #, gcc-internal-format
  msgid "execution count is negative"
  msgstr ""
  
! #: cgraph.c:2781
  #, gcc-internal-format
  msgid "inline clone in same comdat group list"
  msgstr ""
  
! #: cgraph.c:2786
  #, gcc-internal-format
  msgid "local symbols must be defined"
  msgstr ""
  
! #: cgraph.c:2791
  #, gcc-internal-format
  msgid "externally visible inline clone"
  msgstr ""
  
! #: cgraph.c:2796
  #, gcc-internal-format
  msgid "inline clone with address taken"
  msgstr ""
  
! #: cgraph.c:2801
  #, gcc-internal-format
  msgid "inline clone is forced to output"
  msgstr ""
  
! #: cgraph.c:2808
  #, gcc-internal-format, gfc-internal-format
  msgid "aux field set for indirect edge from %s"
  msgstr ""
  
! #: cgraph.c:2815
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "An indirect edge from %s is not marked as indirect or has associated "
  "indirect_info, the corresponding statement is: "
  msgstr ""
  
! #: cgraph.c:2830
  #, gcc-internal-format, gfc-internal-format
  msgid "comdat-local function called by %s outside its comdat"
  msgstr ""
  
! #: cgraph.c:2840
  #, gcc-internal-format
  msgid "inlined_to pointer is wrong"
  msgstr ""
  
! #: cgraph.c:2845
  #, gcc-internal-format
  msgid "multiple inline callers"
  msgstr ""
  
! #: cgraph.c:2852
  #, gcc-internal-format
  msgid "inlined_to pointer set for noninline callers"
  msgstr ""
  
! #: cgraph.c:2871
  #, gcc-internal-format, gfc-internal-format
  msgid "caller edge frequency %i does not match BB frequency %i"
  msgstr ""
  
! #: cgraph.c:2889
  #, gcc-internal-format, gfc-internal-format
  msgid "indirect call frequency %i does not match BB frequency %i"
  msgstr ""
  
! #: cgraph.c:2898
  #, gcc-internal-format
  msgid "inlined_to pointer is set but no predecessors found"
  msgstr ""
  
! #: cgraph.c:2903
  #, gcc-internal-format
  msgid "inlined_to pointer refers to itself"
  msgstr ""
  
! #: cgraph.c:2915
  #, gcc-internal-format
  msgid "cgraph_node has wrong clone_of"
  msgstr ""
  
! #: cgraph.c:2927
  #, gcc-internal-format
  msgid "cgraph_node has wrong clone list"
  msgstr ""
  
! #: cgraph.c:2933
  #, gcc-internal-format
  msgid "cgraph_node is in clone list but it is not clone"
  msgstr ""
  
! #: cgraph.c:2938
  #, gcc-internal-format
  msgid "cgraph_node has wrong prev_clone pointer"
  msgstr ""
  
! #: cgraph.c:2943
  #, gcc-internal-format
  msgid "double linked list of clones corrupted"
  msgstr ""
  
! #: cgraph.c:2955
  #, gcc-internal-format
  msgid "Alias has call edges"
  msgstr ""
  
! #: cgraph.c:2963
  #, gcc-internal-format
  msgid "Alias has non-alias reference"
  msgstr ""
  
! #: cgraph.c:2968
  #, gcc-internal-format
  msgid "Alias has more than one alias reference"
  msgstr ""
  
! #: cgraph.c:2975
  #, gcc-internal-format
  msgid "Analyzed alias has no reference"
  msgstr ""
  
! #: cgraph.c:2984
  #, gcc-internal-format
  msgid "Instrumentation clone does not reference original node"
  msgstr ""
  
! #: cgraph.c:2991
  #, gcc-internal-format
  msgid "Not instrumented node has non-NULL original declaration"
  msgstr ""
  
! #: cgraph.c:3001
  #, gcc-internal-format
  msgid "Instrumented node has wrong original declaration"
  msgstr ""
  
! #: cgraph.c:3019
  #, gcc-internal-format
  msgid "Node has more than one chkp reference"
  msgstr ""
  
! #: cgraph.c:3024
  #, gcc-internal-format
  msgid "Wrong node is referenced with chkp reference"
  msgstr ""
  
! #: cgraph.c:3032
  #, gcc-internal-format
  msgid "Analyzed node has no reference to instrumented version"
  msgstr ""
  
! #: cgraph.c:3046
  #, gcc-internal-format
  msgid "Alias chain for instrumented node is broken"
  msgstr ""
  
! #: cgraph.c:3055
  #, gcc-internal-format
  msgid "No edge out of thunk node"
  msgstr ""
  
! #: cgraph.c:3060
  #, gcc-internal-format
  msgid "More than one edge out of thunk node"
  msgstr ""
  
! #: cgraph.c:3065
  #, gcc-internal-format
  msgid "Thunk is not supposed to have body"
  msgstr ""
  
! #: cgraph.c:3071
  #, gcc-internal-format
  msgid "Instrumentation thunk has wrong edge callee"
  msgstr ""
  
! #: cgraph.c:3107
  #, gcc-internal-format
  msgid "shared call_stmt:"
  msgstr ""
  
! #: cgraph.c:3115
  #, gcc-internal-format
  msgid "edge points to wrong declaration:"
  msgstr ""
  
! #: cgraph.c:3124
  #, gcc-internal-format
  msgid ""
  "an indirect edge with unknown callee corresponding to a call_stmt with a "
  "known declaration:"
  msgstr ""
  
! #: cgraph.c:3134
  #, gcc-internal-format
  msgid "missing callgraph edge for call stmt:"
  msgstr ""
  
! #: cgraph.c:3144
  #, gcc-internal-format
  msgid "reference to dead statement"
  msgstr ""
  
! #: cgraph.c:3157
  #, gcc-internal-format, gfc-internal-format
  msgid "edge %s->%s has no corresponding call_stmt"
  msgstr ""
  
! #: cgraph.c:3169
  #, gcc-internal-format, gfc-internal-format
  msgid "an indirect edge from %s has no corresponding call_stmt"
  msgstr ""
  
! #: cgraph.c:3180
  #, gcc-internal-format
  msgid "verify_cgraph_node failed"
  msgstr ""
  
! #: cgraph.c:3275 varpool.c:326
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: section %s is missing"
  msgstr ""
  
! #: cgraphunit.c:689
  #, gcc-internal-format
  msgid "%<weakref%> attribute should be accompanied with an %<alias%> attribute"
  msgstr ""
  
! #: cgraphunit.c:741 cgraphunit.c:777
  #, gcc-internal-format
  msgid "%<externally_visible%> attribute have effect only on public objects"
  msgstr ""
  
! #: cgraphunit.c:748
  #, gcc-internal-format
  msgid "%<weakref%> attribute ignored because function is defined"
  msgstr ""
  
! #: cgraphunit.c:760
  #, gcc-internal-format
  msgid "always_inline function might not be inlinable"
  msgstr ""
  
! #: cgraphunit.c:785
  #, gcc-internal-format
  msgid "%<weakref%> attribute ignored because variable is initialized"
  msgstr ""
  
! #: cgraphunit.c:1187 c-family/c-pragma.c:362
  #, gcc-internal-format
  msgid "%q+D aliased to undefined symbol %qE"
  msgstr ""
  
! #: cgraphunit.c:1203
  #, gcc-internal-format
  msgid "%q+D aliased to external symbol %qE"
  msgstr ""
  
! #: cgraphunit.c:1224
  #, gcc-internal-format
  msgid "%q+D alias in between function and variable is not supported"
  msgstr ""
  
! #: cgraphunit.c:1226
  #, gcc-internal-format
  msgid "%q+D aliased declaration"
  msgstr ""
  
! #: cgraphunit.c:1299
  #, gcc-internal-format
  msgid "failed to reclaim unneeded function"
  msgstr ""
  
! #: cgraphunit.c:1329
  #, gcc-internal-format
  msgid "failed to reclaim unneeded function in same comdat group"
  msgstr ""
  
! #: cgraphunit.c:1572
  #, gcc-internal-format
  msgid "generic thunk code fails for method %qD which uses %<...%>"
  msgstr ""
  
! #: cgraphunit.c:1921
  #, gcc-internal-format
  msgid "size of return value of %q+D is %u bytes"
  msgstr ""
  
! #: cgraphunit.c:1924
  #, gcc-internal-format
  msgid "size of return value of %q+D is larger than %wd bytes"
  msgstr ""
  
! #: cgraphunit.c:2414
  #, gcc-internal-format
  msgid "nodes with unreleased memory found"
  msgstr ""
--- 16296,16621 ----
  msgid "number of bb notes in insn chain (%d) != n_basic_blocks (%d)"
  msgstr ""
  
! #: cgraph.c:2676
  #, gcc-internal-format
  msgid "caller edge count is negative"
  msgstr ""
  
! #: cgraph.c:2681
  #, gcc-internal-format
  msgid "caller edge frequency is negative"
  msgstr ""
  
! #: cgraph.c:2686
  #, gcc-internal-format
  msgid "caller edge frequency is too large"
  msgstr ""
  
! #: cgraph.c:2770
  #, gcc-internal-format, gfc-internal-format
  msgid "aux field set for edge %s->%s"
  msgstr ""
  
! #: cgraph.c:2777
  #, gcc-internal-format
  msgid "execution count is negative"
  msgstr ""
  
! #: cgraph.c:2782
  #, gcc-internal-format
  msgid "inline clone in same comdat group list"
  msgstr ""
  
! #: cgraph.c:2787
  #, gcc-internal-format
  msgid "local symbols must be defined"
  msgstr ""
  
! #: cgraph.c:2792
  #, gcc-internal-format
  msgid "externally visible inline clone"
  msgstr ""
  
! #: cgraph.c:2797
  #, gcc-internal-format
  msgid "inline clone with address taken"
  msgstr ""
  
! #: cgraph.c:2802
  #, gcc-internal-format
  msgid "inline clone is forced to output"
  msgstr ""
  
! #: cgraph.c:2809
  #, gcc-internal-format, gfc-internal-format
  msgid "aux field set for indirect edge from %s"
  msgstr ""
  
! #: cgraph.c:2816
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "An indirect edge from %s is not marked as indirect or has associated "
  "indirect_info, the corresponding statement is: "
  msgstr ""
  
! #: cgraph.c:2831
  #, gcc-internal-format, gfc-internal-format
  msgid "comdat-local function called by %s outside its comdat"
  msgstr ""
  
! #: cgraph.c:2841
  #, gcc-internal-format
  msgid "inlined_to pointer is wrong"
  msgstr ""
  
! #: cgraph.c:2846
  #, gcc-internal-format
  msgid "multiple inline callers"
  msgstr ""
  
! #: cgraph.c:2853
  #, gcc-internal-format
  msgid "inlined_to pointer set for noninline callers"
  msgstr ""
  
! #: cgraph.c:2872
  #, gcc-internal-format, gfc-internal-format
  msgid "caller edge frequency %i does not match BB frequency %i"
  msgstr ""
  
! #: cgraph.c:2890
  #, gcc-internal-format, gfc-internal-format
  msgid "indirect call frequency %i does not match BB frequency %i"
  msgstr ""
  
! #: cgraph.c:2899
  #, gcc-internal-format
  msgid "inlined_to pointer is set but no predecessors found"
  msgstr ""
  
! #: cgraph.c:2904
  #, gcc-internal-format
  msgid "inlined_to pointer refers to itself"
  msgstr ""
  
! #: cgraph.c:2916
  #, gcc-internal-format
  msgid "cgraph_node has wrong clone_of"
  msgstr ""
  
! #: cgraph.c:2928
  #, gcc-internal-format
  msgid "cgraph_node has wrong clone list"
  msgstr ""
  
! #: cgraph.c:2934
  #, gcc-internal-format
  msgid "cgraph_node is in clone list but it is not clone"
  msgstr ""
  
! #: cgraph.c:2939
  #, gcc-internal-format
  msgid "cgraph_node has wrong prev_clone pointer"
  msgstr ""
  
! #: cgraph.c:2944
  #, gcc-internal-format
  msgid "double linked list of clones corrupted"
  msgstr ""
  
! #: cgraph.c:2956
  #, gcc-internal-format
  msgid "Alias has call edges"
  msgstr ""
  
! #: cgraph.c:2964
  #, gcc-internal-format
  msgid "Alias has non-alias reference"
  msgstr ""
  
! #: cgraph.c:2969
  #, gcc-internal-format
  msgid "Alias has more than one alias reference"
  msgstr ""
  
! #: cgraph.c:2976
  #, gcc-internal-format
  msgid "Analyzed alias has no reference"
  msgstr ""
  
! #: cgraph.c:2985
  #, gcc-internal-format
  msgid "Instrumentation clone does not reference original node"
  msgstr ""
  
! #: cgraph.c:2992
  #, gcc-internal-format
  msgid "Not instrumented node has non-NULL original declaration"
  msgstr ""
  
! #: cgraph.c:3002
  #, gcc-internal-format
  msgid "Instrumented node has wrong original declaration"
  msgstr ""
  
! #: cgraph.c:3020
  #, gcc-internal-format
  msgid "Node has more than one chkp reference"
  msgstr ""
  
! #: cgraph.c:3025
  #, gcc-internal-format
  msgid "Wrong node is referenced with chkp reference"
  msgstr ""
  
! #: cgraph.c:3033
  #, gcc-internal-format
  msgid "Analyzed node has no reference to instrumented version"
  msgstr ""
  
! #: cgraph.c:3047
  #, gcc-internal-format
  msgid "Alias chain for instrumented node is broken"
  msgstr ""
  
! #: cgraph.c:3056
  #, gcc-internal-format
  msgid "No edge out of thunk node"
  msgstr ""
  
! #: cgraph.c:3061
  #, gcc-internal-format
  msgid "More than one edge out of thunk node"
  msgstr ""
  
! #: cgraph.c:3066
  #, gcc-internal-format
  msgid "Thunk is not supposed to have body"
  msgstr ""
  
! #: cgraph.c:3072
  #, gcc-internal-format
  msgid "Instrumentation thunk has wrong edge callee"
  msgstr ""
  
! #: cgraph.c:3108
  #, gcc-internal-format
  msgid "shared call_stmt:"
  msgstr ""
  
! #: cgraph.c:3116
  #, gcc-internal-format
  msgid "edge points to wrong declaration:"
  msgstr ""
  
! #: cgraph.c:3125
  #, gcc-internal-format
  msgid ""
  "an indirect edge with unknown callee corresponding to a call_stmt with a "
  "known declaration:"
  msgstr ""
  
! #: cgraph.c:3135
  #, gcc-internal-format
  msgid "missing callgraph edge for call stmt:"
  msgstr ""
  
! #: cgraph.c:3145
  #, gcc-internal-format
  msgid "reference to dead statement"
  msgstr ""
  
! #: cgraph.c:3158
  #, gcc-internal-format, gfc-internal-format
  msgid "edge %s->%s has no corresponding call_stmt"
  msgstr ""
  
! #: cgraph.c:3170
  #, gcc-internal-format, gfc-internal-format
  msgid "an indirect edge from %s has no corresponding call_stmt"
  msgstr ""
  
! #: cgraph.c:3181
  #, gcc-internal-format
  msgid "verify_cgraph_node failed"
  msgstr ""
  
! #: cgraph.c:3276 varpool.c:326
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: section %s is missing"
  msgstr ""
  
! #: cgraphunit.c:690
  #, gcc-internal-format
  msgid "%<weakref%> attribute should be accompanied with an %<alias%> attribute"
  msgstr ""
  
! #: cgraphunit.c:742 cgraphunit.c:778
  #, gcc-internal-format
  msgid "%<externally_visible%> attribute have effect only on public objects"
  msgstr ""
  
! #: cgraphunit.c:749
  #, gcc-internal-format
  msgid "%<weakref%> attribute ignored because function is defined"
  msgstr ""
  
! #: cgraphunit.c:761
  #, gcc-internal-format
  msgid "always_inline function might not be inlinable"
  msgstr ""
  
! #: cgraphunit.c:786
  #, gcc-internal-format
  msgid "%<weakref%> attribute ignored because variable is initialized"
  msgstr ""
  
! #: cgraphunit.c:1188 c-family/c-pragma.c:362
  #, gcc-internal-format
  msgid "%q+D aliased to undefined symbol %qE"
  msgstr ""
  
! #: cgraphunit.c:1204
  #, gcc-internal-format
  msgid "%q+D aliased to external symbol %qE"
  msgstr ""
  
! #: cgraphunit.c:1225
  #, gcc-internal-format
  msgid "%q+D alias in between function and variable is not supported"
  msgstr ""
  
! #: cgraphunit.c:1227
  #, gcc-internal-format
  msgid "%q+D aliased declaration"
  msgstr ""
  
! #: cgraphunit.c:1300
  #, gcc-internal-format
  msgid "failed to reclaim unneeded function"
  msgstr ""
  
! #: cgraphunit.c:1330
  #, gcc-internal-format
  msgid "failed to reclaim unneeded function in same comdat group"
  msgstr ""
  
! #: cgraphunit.c:1573
  #, gcc-internal-format
  msgid "generic thunk code fails for method %qD which uses %<...%>"
  msgstr ""
  
! #: cgraphunit.c:1922
  #, gcc-internal-format
  msgid "size of return value of %q+D is %u bytes"
  msgstr ""
  
! #: cgraphunit.c:1925
  #, gcc-internal-format
  msgid "size of return value of %q+D is larger than %wd bytes"
  msgstr ""
  
! #: cgraphunit.c:2415
  #, gcc-internal-format
  msgid "nodes with unreleased memory found"
  msgstr ""
*************** msgstr ""
*** 16566,16577 ****
  msgid "cannot find '%s'"
  msgstr ""
  
! #: collect-utils.c:183 collect2.c:2350 collect2.c:2549 gcc.c:2860 gcc.c:6483
  #, gcc-internal-format
  msgid "pex_init failed: %m"
  msgstr ""
  
! #: collect-utils.c:192 collect2.c:2359 collect2.c:2557 gcc.c:7986
  #, gcc-internal-format
  msgid "%s: %m"
  msgstr ""
--- 16655,16666 ----
  msgid "cannot find '%s'"
  msgstr ""
  
! #: collect-utils.c:183 collect2.c:2350 collect2.c:2549 gcc.c:2860 gcc.c:6484
  #, gcc-internal-format
  msgid "pex_init failed: %m"
  msgstr ""
  
! #: collect-utils.c:192 collect2.c:2359 collect2.c:2557 gcc.c:7987
  #, gcc-internal-format
  msgid "%s: %m"
  msgstr ""
*************** msgstr ""
*** 16581,16588 ****
  msgid "COLLECT_LTO_WRAPPER must be set"
  msgstr ""
  
! #: collect2.c:966 gcc.c:6986 lto-wrapper.c:1356
! #: config/i386/intelmic-mkoffload.c:504
  #, gcc-internal-format
  msgid "atexit failed"
  msgstr ""
--- 16670,16677 ----
  msgid "COLLECT_LTO_WRAPPER must be set"
  msgstr ""
  
! #: collect2.c:966 gcc.c:6987 lto-wrapper.c:1356
! #: config/i386/intelmic-mkoffload.c:505
  #, gcc-internal-format
  msgid "atexit failed"
  msgstr ""
*************** msgstr ""
*** 16791,16802 ****
  msgid "cannot open %s"
  msgstr ""
  
! #: cprop.c:1760 gcse.c:4009
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: %d basic blocks and %d edges/basic block"
  msgstr ""
  
! #: cprop.c:1774 gcse.c:4023
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: %d basic blocks and %d registers"
  msgstr ""
--- 16880,16891 ----
  msgid "cannot open %s"
  msgstr ""
  
! #: cprop.c:1760 gcse.c:4016
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: %d basic blocks and %d edges/basic block"
  msgstr ""
  
! #: cprop.c:1774 gcse.c:4030
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: %d basic blocks and %d registers"
  msgstr ""
*************** msgstr ""
*** 16841,16847 ****
  msgid "global constructors not supported on this target"
  msgstr ""
  
! #: diagnostic.c:1291
  #, gcc-internal-format, gfc-internal-format
  msgid "in %s, at %s:%d"
  msgstr ""
--- 16930,16936 ----
  msgid "global constructors not supported on this target"
  msgstr ""
  
! #: diagnostic.c:1288
  #, gcc-internal-format, gfc-internal-format
  msgid "in %s, at %s:%d"
  msgstr ""
*************** msgstr ""
*** 16876,16894 ****
  msgid "ignoring possibly conflicting option %<-fopt-info-%s%>"
  msgstr ""
  
! #: dwarf2out.c:1113
  #, gcc-internal-format
  msgid ""
  "multiple EH personalities are supported only with assemblers supporting ."
  "cfi_personality directive"
  msgstr ""
  
! #: dwarf2out.c:11638
  #, gcc-internal-format, gfc-internal-format
  msgid "non-delegitimized UNSPEC %s (%d) found in variable location"
  msgstr ""
  
! #: dwarf2out.c:22674
  #, gcc-internal-format
  msgid "-feliminate-dwarf2-dups is broken for C++, ignoring"
  msgstr ""
--- 16965,16983 ----
  msgid "ignoring possibly conflicting option %<-fopt-info-%s%>"
  msgstr ""
  
! #: dwarf2out.c:1115
  #, gcc-internal-format
  msgid ""
  "multiple EH personalities are supported only with assemblers supporting ."
  "cfi_personality directive"
  msgstr ""
  
! #: dwarf2out.c:11640
  #, gcc-internal-format, gfc-internal-format
  msgid "non-delegitimized UNSPEC %s (%d) found in variable location"
  msgstr ""
  
! #: dwarf2out.c:22683
  #, gcc-internal-format
  msgid "-feliminate-dwarf2-dups is broken for C++, ignoring"
  msgstr ""
*************** msgstr ""
*** 16973,16979 ****
  msgid "verify_eh_tree failed"
  msgstr ""
  
! #: explow.c:1427
  #, gcc-internal-format
  msgid "stack limits not supported on this target"
  msgstr ""
--- 17062,17068 ----
  msgid "verify_eh_tree failed"
  msgstr ""
  
! #: explow.c:1433
  #, gcc-internal-format
  msgid "stack limits not supported on this target"
  msgstr ""
*************** msgid ""
*** 16985,17001 ****
  "truncated into %wu-bit"
  msgstr ""
  
! #: expr.c:7732
  #, gcc-internal-format
  msgid "local frame unavailable (naked function?)"
  msgstr ""
  
! #: expr.c:10470
  #, gcc-internal-format
  msgid "%Kcall to %qs declared with attribute error: %s"
  msgstr ""
  
! #: expr.c:10477
  #, gcc-internal-format
  msgid "%Kcall to %qs declared with attribute warning: %s"
  msgstr ""
--- 17074,17090 ----
  "truncated into %wu-bit"
  msgstr ""
  
! #: expr.c:7739
  #, gcc-internal-format
  msgid "local frame unavailable (naked function?)"
  msgstr ""
  
! #: expr.c:10477
  #, gcc-internal-format
  msgid "%Kcall to %qs declared with attribute error: %s"
  msgstr ""
  
! #: expr.c:10484
  #, gcc-internal-format
  msgid "%Kcall to %qs declared with attribute warning: %s"
  msgstr ""
*************** msgstr ""
*** 17010,17016 ****
  msgid "the frame size of %wd bytes is larger than %wd bytes"
  msgstr ""
  
! #: final.c:4636 toplev.c:1481 tree-cfgcleanup.c:1120
  #, gcc-internal-format
  msgid "could not open final insn dump file %qs: %m"
  msgstr ""
--- 17099,17105 ----
  msgid "the frame size of %wd bytes is larger than %wd bytes"
  msgstr ""
  
! #: final.c:4636 toplev.c:1472 tree-cfgcleanup.c:1120
  #, gcc-internal-format
  msgid "could not open final insn dump file %qs: %m"
  msgstr ""
*************** msgstr ""
*** 17025,17087 ****
  msgid "large fixed-point constant implicitly truncated to fixed-point type"
  msgstr ""
  
! #: fold-const.c:697
  #, gcc-internal-format
  msgid "assuming signed overflow does not occur when negating a division"
  msgstr ""
  
! #: fold-const.c:3811 fold-const.c:3821
  #, gcc-internal-format, gfc-internal-format
  msgid "comparison is always %d due to width of bit-field"
  msgstr ""
  
! #: fold-const.c:5185 tree-ssa-reassoc.c:2144
  #, gcc-internal-format
  msgid "assuming signed overflow does not occur when simplifying range test"
  msgstr ""
  
! #: fold-const.c:5626 fold-const.c:5640
  #, gcc-internal-format, gfc-internal-format
  msgid "comparison is always %d"
  msgstr ""
  
! #: fold-const.c:5773
  #, gcc-internal-format
  msgid "%<or%> of unmatched not-equal tests is always 1"
  msgstr ""
  
! #: fold-const.c:5778
  #, gcc-internal-format
  msgid "%<and%> of mutually exclusive equal-tests is always 0"
  msgstr ""
  
! #: fold-const.c:8641
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when reducing constant in comparison"
  msgstr ""
  
! #: fold-const.c:8811
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when changing X +- C1 cmp C2 to X "
  "cmp C2 -+ C1"
  msgstr ""
  
! #: fold-const.c:8829
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when changing X - Y cmp 0 to X cmp Y"
  msgstr ""
  
! #: fold-const.c:9087
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when combining constants around a "
  "comparison"
  msgstr ""
  
! #: fold-const.c:14075
  #, gcc-internal-format
  msgid "fold check: original tree changed by fold"
  msgstr ""
--- 17114,17176 ----
  msgid "large fixed-point constant implicitly truncated to fixed-point type"
  msgstr ""
  
! #: fold-const.c:711
  #, gcc-internal-format
  msgid "assuming signed overflow does not occur when negating a division"
  msgstr ""
  
! #: fold-const.c:3836 fold-const.c:3846
  #, gcc-internal-format, gfc-internal-format
  msgid "comparison is always %d due to width of bit-field"
  msgstr ""
  
! #: fold-const.c:5208 tree-ssa-reassoc.c:2166
  #, gcc-internal-format
  msgid "assuming signed overflow does not occur when simplifying range test"
  msgstr ""
  
! #: fold-const.c:5649 fold-const.c:5663
  #, gcc-internal-format, gfc-internal-format
  msgid "comparison is always %d"
  msgstr ""
  
! #: fold-const.c:5796
  #, gcc-internal-format
  msgid "%<or%> of unmatched not-equal tests is always 1"
  msgstr ""
  
! #: fold-const.c:5801
  #, gcc-internal-format
  msgid "%<and%> of mutually exclusive equal-tests is always 0"
  msgstr ""
  
! #: fold-const.c:8680
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when reducing constant in comparison"
  msgstr ""
  
! #: fold-const.c:8836
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when changing X +- C1 cmp C2 to X "
  "cmp C2 -+ C1"
  msgstr ""
  
! #: fold-const.c:8854
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when changing X - Y cmp 0 to X cmp Y"
  msgstr ""
  
! #: fold-const.c:9134
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when combining constants around a "
  "comparison"
  msgstr ""
  
! #: fold-const.c:14159
  #, gcc-internal-format
  msgid "fold check: original tree changed by fold"
  msgstr ""
*************** msgstr ""
*** 17091,17117 ****
  msgid "total size of local objects too large"
  msgstr ""
  
! #: function.c:1774 gimplify.c:5192
  #, gcc-internal-format
  msgid "impossible constraint in %<asm%>"
  msgstr ""
  
! #: function.c:4266
  #, gcc-internal-format
  msgid "variable %q+D might be clobbered by %<longjmp%> or %<vfork%>"
  msgstr ""
  
! #: function.c:4287
  #, gcc-internal-format
  msgid "argument %q+D might be clobbered by %<longjmp%> or %<vfork%>"
  msgstr ""
  
! #: function.c:4900
  #, gcc-internal-format
  msgid "function returns an aggregate"
  msgstr ""
  
! #: function.c:5246
  #, gcc-internal-format
  msgid "unused parameter %q+D"
  msgstr ""
--- 17180,17206 ----
  msgid "total size of local objects too large"
  msgstr ""
  
! #: function.c:1774 gimplify.c:5196
  #, gcc-internal-format
  msgid "impossible constraint in %<asm%>"
  msgstr ""
  
! #: function.c:4267
  #, gcc-internal-format
  msgid "variable %q+D might be clobbered by %<longjmp%> or %<vfork%>"
  msgstr ""
  
! #: function.c:4288
  #, gcc-internal-format
  msgid "argument %q+D might be clobbered by %<longjmp%> or %<vfork%>"
  msgstr ""
  
! #: function.c:4901
  #, gcc-internal-format
  msgid "function returns an aggregate"
  msgstr ""
  
! #: function.c:5247
  #, gcc-internal-format
  msgid "unused parameter %q+D"
  msgstr ""
*************** msgstr ""
*** 17191,17197 ****
  msgid "%qs is an unknown -save-temps option"
  msgstr ""
  
! #: gcc.c:4195 toplev.c:992
  #, gcc-internal-format
  msgid "input file %qs is the same as output file"
  msgstr ""
--- 17280,17286 ----
  msgid "%qs is an unknown -save-temps option"
  msgstr ""
  
! #: gcc.c:4195 toplev.c:997
  #, gcc-internal-format
  msgid "input file %qs is the same as output file"
  msgstr ""
*************** msgstr ""
*** 17246,17257 ****
  msgid "spec %qs has invalid %<%%0%c%>"
  msgstr ""
  
! #: gcc.c:5380
  #, gcc-internal-format
  msgid "spec %qs has invalid %<%%W%c%>"
  msgstr ""
  
! #: gcc.c:5403
  #, gcc-internal-format
  msgid "spec %qs has invalid %<%%x%c%>"
  msgstr ""
--- 17335,17346 ----
  msgid "spec %qs has invalid %<%%0%c%>"
  msgstr ""
  
! #: gcc.c:5381
  #, gcc-internal-format
  msgid "spec %qs has invalid %<%%W%c%>"
  msgstr ""
  
! #: gcc.c:5404
  #, gcc-internal-format
  msgid "spec %qs has invalid %<%%x%c%>"
  msgstr ""
*************** msgstr ""
*** 17259,17471 ****
  #. Catch the case where a spec string contains something like
  #. '%{foo:%*}'.  i.e. there is no * in the pattern on the left
  #. hand side of the :.
! #: gcc.c:5614
  #, gcc-internal-format
  msgid "spec failure: %<%%*%> has not been initialized by pattern match"
  msgstr ""
  
! #: gcc.c:5657
  #, gcc-internal-format
  msgid "spec failure: unrecognized spec option %qc"
  msgstr ""
  
! #: gcc.c:5719
  #, gcc-internal-format
  msgid "unknown spec function %qs"
  msgstr ""
  
! #: gcc.c:5749
  #, gcc-internal-format
  msgid "error in args to spec function %qs"
  msgstr ""
  
! #: gcc.c:5803
  #, gcc-internal-format
  msgid "malformed spec function name"
  msgstr ""
  
  #. )
! #: gcc.c:5806
  #, gcc-internal-format
  msgid "no arguments for spec function"
  msgstr ""
  
! #: gcc.c:5825
  #, gcc-internal-format
  msgid "malformed spec function arguments"
  msgstr ""
  
! #: gcc.c:6099
  #, gcc-internal-format
  msgid "braced spec %qs is invalid at %qc"
  msgstr ""
  
! #: gcc.c:6187
  #, gcc-internal-format
  msgid "braced spec body %qs is invalid"
  msgstr ""
  
! #: gcc.c:6793
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: could not determine length of compare-debug file %s"
  msgstr ""
  
! #: gcc.c:6804
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: -fcompare-debug failure (length)"
  msgstr ""
  
! #: gcc.c:6814 gcc.c:6855
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: could not open compare-debug file %s"
  msgstr ""
  
! #: gcc.c:6834 gcc.c:6871
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: -fcompare-debug failure"
  msgstr ""
  
! #: gcc.c:7156
  #, gcc-internal-format
  msgid "spec failure: more than one arg to SYSROOT_SUFFIX_SPEC"
  msgstr ""
  
! #: gcc.c:7180
  #, gcc-internal-format
  msgid "spec failure: more than one arg to SYSROOT_HEADERS_SUFFIX_SPEC"
  msgstr ""
  
! #: gcc.c:7387
  #, gcc-internal-format
  msgid "unrecognized command line option %<-%s%>"
  msgstr ""
  
! #: gcc.c:7511
  #, gcc-internal-format
  msgid "not configured with sysroot headers suffix"
  msgstr ""
  
! #: gcc.c:7572
  #, gcc-internal-format
  msgid "no input files"
  msgstr ""
  
! #: gcc.c:7623
  #, gcc-internal-format
  msgid "cannot specify -o with -c, -S or -E with multiple files"
  msgstr ""
  
! #: gcc.c:7664
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: %s compiler not installed on this system"
  msgstr ""
  
! #: gcc.c:7688
  #, gcc-internal-format
  msgid "recompiling with -fcompare-debug"
  msgstr ""
  
! #: gcc.c:7704
  #, gcc-internal-format
  msgid "during -fcompare-debug recompilation"
  msgstr ""
  
! #: gcc.c:7713
  #, gcc-internal-format
  msgid "comparing final insns dumps"
  msgstr ""
  
! #: gcc.c:7830
  #, gcc-internal-format, gfc-internal-format
  msgid "-fuse-linker-plugin, but %s not found"
  msgstr ""
  
! #: gcc.c:7863
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: linker input file unused because linking not done"
  msgstr ""
  
! #: gcc.c:7915
  #, gcc-internal-format, gfc-internal-format
  msgid "language %s not recognized"
  msgstr ""
  
! #: gcc.c:8142
  #, gcc-internal-format
  msgid "multilib spec %qs is invalid"
  msgstr ""
  
! #: gcc.c:8336
  #, gcc-internal-format
  msgid "multilib exclusions %qs is invalid"
  msgstr ""
  
! #: gcc.c:8400
  #, gcc-internal-format
  msgid "multilib select %qs %qs is invalid"
  msgstr ""
  
! #: gcc.c:8562
  #, gcc-internal-format
  msgid "multilib select %qs is invalid"
  msgstr ""
  
! #: gcc.c:8602
  #, gcc-internal-format
  msgid "multilib exclusion %qs is invalid"
  msgstr ""
  
! #: gcc.c:8809
  #, gcc-internal-format
  msgid "environment variable %qs not defined"
  msgstr ""
  
! #: gcc.c:8948 gcc.c:8953
  #, gcc-internal-format
  msgid "invalid version number %qs"
  msgstr ""
  
! #: gcc.c:8996
  #, gcc-internal-format, gfc-internal-format
  msgid "too few arguments to %%:version-compare"
  msgstr ""
  
! #: gcc.c:9002
  #, gcc-internal-format, gfc-internal-format
  msgid "too many arguments to %%:version-compare"
  msgstr ""
  
! #: gcc.c:9044
  #, gcc-internal-format
  msgid "unknown operator %qs in %%:version-compare"
  msgstr ""
  
! #: gcc.c:9168
  #, gcc-internal-format, gfc-internal-format
  msgid "too many arguments to %%:compare-debug-dump-opt"
  msgstr ""
  
! #: gcc.c:9241
  #, gcc-internal-format, gfc-internal-format
  msgid "too many arguments to %%:compare-debug-self-opt"
  msgstr ""
  
! #: gcc.c:9277
  #, gcc-internal-format, gfc-internal-format
  msgid "too few arguments to %%:compare-debug-auxbase-opt"
  msgstr ""
  
! #: gcc.c:9281
  #, gcc-internal-format, gfc-internal-format
  msgid "too many arguments to %%:compare-debug-auxbase-opt"
  msgstr ""
  
! #: gcc.c:9288
  #, gcc-internal-format, gfc-internal-format
  msgid "argument to %%:compare-debug-auxbase-opt does not end in .gk"
  msgstr ""
  
! #: gcc.c:9362
  #, gcc-internal-format, gfc-internal-format
  msgid "too few arguments to %%:replace-extension"
  msgstr ""
--- 17348,17560 ----
  #. Catch the case where a spec string contains something like
  #. '%{foo:%*}'.  i.e. there is no * in the pattern on the left
  #. hand side of the :.
! #: gcc.c:5615
  #, gcc-internal-format
  msgid "spec failure: %<%%*%> has not been initialized by pattern match"
  msgstr ""
  
! #: gcc.c:5658
  #, gcc-internal-format
  msgid "spec failure: unrecognized spec option %qc"
  msgstr ""
  
! #: gcc.c:5720
  #, gcc-internal-format
  msgid "unknown spec function %qs"
  msgstr ""
  
! #: gcc.c:5750
  #, gcc-internal-format
  msgid "error in args to spec function %qs"
  msgstr ""
  
! #: gcc.c:5804
  #, gcc-internal-format
  msgid "malformed spec function name"
  msgstr ""
  
  #. )
! #: gcc.c:5807
  #, gcc-internal-format
  msgid "no arguments for spec function"
  msgstr ""
  
! #: gcc.c:5826
  #, gcc-internal-format
  msgid "malformed spec function arguments"
  msgstr ""
  
! #: gcc.c:6100
  #, gcc-internal-format
  msgid "braced spec %qs is invalid at %qc"
  msgstr ""
  
! #: gcc.c:6188
  #, gcc-internal-format
  msgid "braced spec body %qs is invalid"
  msgstr ""
  
! #: gcc.c:6794
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: could not determine length of compare-debug file %s"
  msgstr ""
  
! #: gcc.c:6805
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: -fcompare-debug failure (length)"
  msgstr ""
  
! #: gcc.c:6815 gcc.c:6856
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: could not open compare-debug file %s"
  msgstr ""
  
! #: gcc.c:6835 gcc.c:6872
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: -fcompare-debug failure"
  msgstr ""
  
! #: gcc.c:7157
  #, gcc-internal-format
  msgid "spec failure: more than one arg to SYSROOT_SUFFIX_SPEC"
  msgstr ""
  
! #: gcc.c:7181
  #, gcc-internal-format
  msgid "spec failure: more than one arg to SYSROOT_HEADERS_SUFFIX_SPEC"
  msgstr ""
  
! #: gcc.c:7388
  #, gcc-internal-format
  msgid "unrecognized command line option %<-%s%>"
  msgstr ""
  
! #: gcc.c:7512
  #, gcc-internal-format
  msgid "not configured with sysroot headers suffix"
  msgstr ""
  
! #: gcc.c:7573
  #, gcc-internal-format
  msgid "no input files"
  msgstr ""
  
! #: gcc.c:7624
  #, gcc-internal-format
  msgid "cannot specify -o with -c, -S or -E with multiple files"
  msgstr ""
  
! #: gcc.c:7665
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: %s compiler not installed on this system"
  msgstr ""
  
! #: gcc.c:7689
  #, gcc-internal-format
  msgid "recompiling with -fcompare-debug"
  msgstr ""
  
! #: gcc.c:7705
  #, gcc-internal-format
  msgid "during -fcompare-debug recompilation"
  msgstr ""
  
! #: gcc.c:7714
  #, gcc-internal-format
  msgid "comparing final insns dumps"
  msgstr ""
  
! #: gcc.c:7831
  #, gcc-internal-format, gfc-internal-format
  msgid "-fuse-linker-plugin, but %s not found"
  msgstr ""
  
! #: gcc.c:7864
  #, gcc-internal-format, gfc-internal-format
  msgid "%s: linker input file unused because linking not done"
  msgstr ""
  
! #: gcc.c:7916
  #, gcc-internal-format, gfc-internal-format
  msgid "language %s not recognized"
  msgstr ""
  
! #: gcc.c:8143
  #, gcc-internal-format
  msgid "multilib spec %qs is invalid"
  msgstr ""
  
! #: gcc.c:8337
  #, gcc-internal-format
  msgid "multilib exclusions %qs is invalid"
  msgstr ""
  
! #: gcc.c:8401
  #, gcc-internal-format
  msgid "multilib select %qs %qs is invalid"
  msgstr ""
  
! #: gcc.c:8563
  #, gcc-internal-format
  msgid "multilib select %qs is invalid"
  msgstr ""
  
! #: gcc.c:8603
  #, gcc-internal-format
  msgid "multilib exclusion %qs is invalid"
  msgstr ""
  
! #: gcc.c:8810
  #, gcc-internal-format
  msgid "environment variable %qs not defined"
  msgstr ""
  
! #: gcc.c:8949 gcc.c:8954
  #, gcc-internal-format
  msgid "invalid version number %qs"
  msgstr ""
  
! #: gcc.c:8997
  #, gcc-internal-format, gfc-internal-format
  msgid "too few arguments to %%:version-compare"
  msgstr ""
  
! #: gcc.c:9003
  #, gcc-internal-format, gfc-internal-format
  msgid "too many arguments to %%:version-compare"
  msgstr ""
  
! #: gcc.c:9045
  #, gcc-internal-format
  msgid "unknown operator %qs in %%:version-compare"
  msgstr ""
  
! #: gcc.c:9169
  #, gcc-internal-format, gfc-internal-format
  msgid "too many arguments to %%:compare-debug-dump-opt"
  msgstr ""
  
! #: gcc.c:9242
  #, gcc-internal-format, gfc-internal-format
  msgid "too many arguments to %%:compare-debug-self-opt"
  msgstr ""
  
! #: gcc.c:9278
  #, gcc-internal-format, gfc-internal-format
  msgid "too few arguments to %%:compare-debug-auxbase-opt"
  msgstr ""
  
! #: gcc.c:9282
  #, gcc-internal-format, gfc-internal-format
  msgid "too many arguments to %%:compare-debug-auxbase-opt"
  msgstr ""
  
! #: gcc.c:9289
  #, gcc-internal-format, gfc-internal-format
  msgid "argument to %%:compare-debug-auxbase-opt does not end in .gk"
  msgstr ""
  
! #: gcc.c:9363
  #, gcc-internal-format, gfc-internal-format
  msgid "too few arguments to %%:replace-extension"
  msgstr ""
*************** msgstr ""
*** 17537,17546 ****
  msgid "can%'t write PCH file"
  msgstr ""
  
! #: gimple-ssa-isolate-paths.c:319 gimple-ssa-isolate-paths.c:448 tree.c:12136
! #: tree.c:12173 c/c-typeck.c:2789 c/c-typeck.c:2872 cp/constexpr.c:757
! #: cp/decl2.c:4971 cp/pt.c:7091 cp/semantics.c:1742 cp/typeck.c:1643
! #: cp/typeck.c:3589
  #, gcc-internal-format
  msgid "declared here"
  msgstr ""
--- 17626,17635 ----
  msgid "can%'t write PCH file"
  msgstr ""
  
! #: gimple-ssa-isolate-paths.c:326 gimple-ssa-isolate-paths.c:455 tree.c:12135
! #: tree.c:12172 c/c-typeck.c:2789 c/c-typeck.c:2872 cp/constexpr.c:760
! #: cp/decl2.c:5061 cp/pt.c:7111 cp/semantics.c:1742 cp/typeck.c:1643
! #: cp/typeck.c:3591
  #, gcc-internal-format
  msgid "declared here"
  msgstr ""
*************** msgstr ""
*** 17555,17702 ****
  msgid "gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d"
  msgstr ""
  
! #: gimplify.c:2503
  #, gcc-internal-format
  msgid "using result of function returning %<void%>"
  msgstr ""
  
! #: gimplify.c:5077
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid lvalue in asm output %d"
  msgstr ""
  
! #: gimplify.c:5193
  #, gcc-internal-format, gfc-internal-format
  msgid "non-memory input %d must stay in memory"
  msgstr ""
  
! #: gimplify.c:5215
  #, gcc-internal-format, gfc-internal-format
  msgid "memory input %d is not directly addressable"
  msgstr ""
  
! #: gimplify.c:5736
  #, gcc-internal-format
  msgid "threadprivate variable %qE used in target region"
  msgstr ""
  
! #: gimplify.c:5738
  #, gcc-internal-format
  msgid "enclosing target region"
  msgstr ""
  
! #: gimplify.c:5750
  #, gcc-internal-format
  msgid "threadprivate variable %qE used in untied task"
  msgstr ""
  
! #: gimplify.c:5752 gimplify.c:5847
  #, gcc-internal-format
  msgid "enclosing task"
  msgstr ""
  
! #: gimplify.c:5799
  #, gcc-internal-format
  msgid "%qD referenced in target region does not have a mappable type"
  msgstr ""
  
! #: gimplify.c:5839
  #, gcc-internal-format
  msgid "%qE not specified in enclosing parallel"
  msgstr ""
  
! #: gimplify.c:5841
  #, gcc-internal-format
  msgid "enclosing parallel"
  msgstr ""
  
! #: gimplify.c:5845
  #, gcc-internal-format
  msgid "%qE not specified in enclosing task"
  msgstr ""
  
! #: gimplify.c:5851
  #, gcc-internal-format
  msgid "%qE not specified in enclosing teams construct"
  msgstr ""
  
! #: gimplify.c:5853
  #, gcc-internal-format
  msgid "enclosing teams construct"
  msgstr ""
  
! #: gimplify.c:5971 gimplify.c:6000
  #, gcc-internal-format
  msgid "iteration variable %qE is predetermined linear"
  msgstr ""
  
! #: gimplify.c:5974
  #, gcc-internal-format
  msgid "iteration variable %qE should be private"
  msgstr ""
  
! #: gimplify.c:5988
  #, gcc-internal-format
  msgid "iteration variable %qE should not be firstprivate"
  msgstr ""
  
! #: gimplify.c:5991
  #, gcc-internal-format
  msgid "iteration variable %qE should not be reduction"
  msgstr ""
  
! #: gimplify.c:5994
  #, gcc-internal-format
  msgid "iteration variable %qE should not be lastprivate"
  msgstr ""
  
! #: gimplify.c:5997
  #, gcc-internal-format
  msgid "iteration variable %qE should not be private"
  msgstr ""
  
! #: gimplify.c:6416
  #, gcc-internal-format
  msgid ""
  "copyprivate variable %qE is not threadprivate or private in outer context"
  msgstr ""
  
! #: gimplify.c:6426
  #, gcc-internal-format
  msgid "%s variable %qE is private in outer context"
  msgstr ""
  
! #: gimplify.c:8525 gimplify.c:8531 gimplify.c:8539
  #, gcc-internal-format
  msgid "directive not yet implemented"
  msgstr ""
  
! #: gimplify.c:8691
  #, gcc-internal-format
  msgid "expected %<_Cilk_spawn%> before %<_Cilk_sync%>"
  msgstr ""
  
! #: gimplify.c:8987
  #, gcc-internal-format
  msgid "gimplification failed"
  msgstr ""
  
! #: gimplify.c:9452
  #, gcc-internal-format
  msgid "first argument to %<va_arg%> not of type %<va_list%>"
  msgstr ""
  
! #: gimplify.c:9468
  #, gcc-internal-format
  msgid "%qT is promoted to %qT when passed through %<...%>"
  msgstr ""
  
! #: gimplify.c:9473
  #, gcc-internal-format
  msgid "(so you should pass %qT not %qT to %<va_arg%>)"
  msgstr ""
  
! #: gimplify.c:9480
  #, gcc-internal-format
  msgid "if this code is reached, the program will abort"
  msgstr ""
--- 17644,17791 ----
  msgid "gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d"
  msgstr ""
  
! #: gimplify.c:2504
  #, gcc-internal-format
  msgid "using result of function returning %<void%>"
  msgstr ""
  
! #: gimplify.c:5081
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid lvalue in asm output %d"
  msgstr ""
  
! #: gimplify.c:5197
  #, gcc-internal-format, gfc-internal-format
  msgid "non-memory input %d must stay in memory"
  msgstr ""
  
! #: gimplify.c:5236 gimplify.c:5245
  #, gcc-internal-format, gfc-internal-format
  msgid "memory input %d is not directly addressable"
  msgstr ""
  
! #: gimplify.c:5766
  #, gcc-internal-format
  msgid "threadprivate variable %qE used in target region"
  msgstr ""
  
! #: gimplify.c:5768
  #, gcc-internal-format
  msgid "enclosing target region"
  msgstr ""
  
! #: gimplify.c:5780
  #, gcc-internal-format
  msgid "threadprivate variable %qE used in untied task"
  msgstr ""
  
! #: gimplify.c:5782 gimplify.c:5877
  #, gcc-internal-format
  msgid "enclosing task"
  msgstr ""
  
! #: gimplify.c:5829
  #, gcc-internal-format
  msgid "%qD referenced in target region does not have a mappable type"
  msgstr ""
  
! #: gimplify.c:5869
  #, gcc-internal-format
  msgid "%qE not specified in enclosing parallel"
  msgstr ""
  
! #: gimplify.c:5871
  #, gcc-internal-format
  msgid "enclosing parallel"
  msgstr ""
  
! #: gimplify.c:5875
  #, gcc-internal-format
  msgid "%qE not specified in enclosing task"
  msgstr ""
  
! #: gimplify.c:5881
  #, gcc-internal-format
  msgid "%qE not specified in enclosing teams construct"
  msgstr ""
  
! #: gimplify.c:5883
  #, gcc-internal-format
  msgid "enclosing teams construct"
  msgstr ""
  
! #: gimplify.c:6001 gimplify.c:6030
  #, gcc-internal-format
  msgid "iteration variable %qE is predetermined linear"
  msgstr ""
  
! #: gimplify.c:6004
  #, gcc-internal-format
  msgid "iteration variable %qE should be private"
  msgstr ""
  
! #: gimplify.c:6018
  #, gcc-internal-format
  msgid "iteration variable %qE should not be firstprivate"
  msgstr ""
  
! #: gimplify.c:6021
  #, gcc-internal-format
  msgid "iteration variable %qE should not be reduction"
  msgstr ""
  
! #: gimplify.c:6024
  #, gcc-internal-format
  msgid "iteration variable %qE should not be lastprivate"
  msgstr ""
  
! #: gimplify.c:6027
  #, gcc-internal-format
  msgid "iteration variable %qE should not be private"
  msgstr ""
  
! #: gimplify.c:6449
  #, gcc-internal-format
  msgid ""
  "copyprivate variable %qE is not threadprivate or private in outer context"
  msgstr ""
  
! #: gimplify.c:6459
  #, gcc-internal-format
  msgid "%s variable %qE is private in outer context"
  msgstr ""
  
! #: gimplify.c:8601 gimplify.c:8607 gimplify.c:8615
  #, gcc-internal-format
  msgid "directive not yet implemented"
  msgstr ""
  
! #: gimplify.c:8767
  #, gcc-internal-format
  msgid "expected %<_Cilk_spawn%> before %<_Cilk_sync%>"
  msgstr ""
  
! #: gimplify.c:9063
  #, gcc-internal-format
  msgid "gimplification failed"
  msgstr ""
  
! #: gimplify.c:9528
  #, gcc-internal-format
  msgid "first argument to %<va_arg%> not of type %<va_list%>"
  msgstr ""
  
! #: gimplify.c:9544
  #, gcc-internal-format
  msgid "%qT is promoted to %qT when passed through %<...%>"
  msgstr ""
  
! #: gimplify.c:9549
  #, gcc-internal-format
  msgid "(so you should pass %qT not %qT to %<va_arg%>)"
  msgstr ""
  
! #: gimplify.c:9556
  #, gcc-internal-format
  msgid "if this code is reached, the program will abort"
  msgstr ""
*************** msgstr ""
*** 17711,17728 ****
  msgid "could not open Go dump file %qs: %m"
  msgstr ""
  
! #: graph.c:66 toplev.c:1589 java/jcf-parse.c:1774 java/jcf-parse.c:1913
  #: objc/objc-act.c:488
  #, gcc-internal-format
  msgid "can%'t open %s: %m"
  msgstr ""
  
! #: graphite.c:326
  #, gcc-internal-format
  msgid "Graphite loop optimizations cannot be used (ISL is not available)."
  msgstr ""
  
! #: ipa-chkp.c:666
  #, gcc-internal-format
  msgid "function cannot be instrumented"
  msgstr ""
--- 17800,17817 ----
  msgid "could not open Go dump file %qs: %m"
  msgstr ""
  
! #: graph.c:66 toplev.c:1580 java/jcf-parse.c:1774 java/jcf-parse.c:1913
  #: objc/objc-act.c:488
  #, gcc-internal-format
  msgid "can%'t open %s: %m"
  msgstr ""
  
! #: graphite.c:327
  #, gcc-internal-format
  msgid "Graphite loop optimizations cannot be used (ISL is not available)."
  msgstr ""
  
! #: ipa-chkp.c:693
  #, gcc-internal-format
  msgid "function cannot be instrumented"
  msgstr ""
*************** msgid ""
*** 18030,18051 ****
  "unit"
  msgstr ""
  
! #: ipa-devirt.c:1551
  #, gcc-internal-format
  msgid "a type with different size is defined in another translation unit"
  msgstr ""
  
! #: ipa-devirt.c:1559
  #, gcc-internal-format
  msgid "a type with different alignment is defined in another translation unit"
  msgstr ""
  
! #: ipa-devirt.c:1674
  #, gcc-internal-format
  msgid "the extra base is defined here"
  msgstr ""
  
! #: ipa-devirt.c:3629
  #, gcc-internal-format
  msgid "Declaring type %qD final would enable devirtualization of %i call"
  msgid_plural ""
--- 18119,18140 ----
  "unit"
  msgstr ""
  
! #: ipa-devirt.c:1552
  #, gcc-internal-format
  msgid "a type with different size is defined in another translation unit"
  msgstr ""
  
! #: ipa-devirt.c:1560
  #, gcc-internal-format
  msgid "a type with different alignment is defined in another translation unit"
  msgstr ""
  
! #: ipa-devirt.c:1675
  #, gcc-internal-format
  msgid "the extra base is defined here"
  msgstr ""
  
! #: ipa-devirt.c:3630
  #, gcc-internal-format
  msgid "Declaring type %qD final would enable devirtualization of %i call"
  msgid_plural ""
*************** msgid_plural ""
*** 18053,18059 ****
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3638
  #, gcc-internal-format
  msgid ""
  "Declaring type %qD final would enable devirtualization of %i call executed "
--- 18142,18148 ----
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3639
  #, gcc-internal-format
  msgid ""
  "Declaring type %qD final would enable devirtualization of %i call executed "
*************** msgid_plural ""
*** 18064,18070 ****
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3667
  #, gcc-internal-format
  msgid ""
  "Declaring virtual destructor of %qD final would enable devirtualization of "
--- 18153,18159 ----
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3668
  #, gcc-internal-format
  msgid ""
  "Declaring virtual destructor of %qD final would enable devirtualization of "
*************** msgid_plural ""
*** 18075,18081 ****
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3675
  #, gcc-internal-format
  msgid "Declaring method %qD final would enable devirtualization of %i call"
  msgid_plural ""
--- 18164,18170 ----
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3676
  #, gcc-internal-format
  msgid "Declaring method %qD final would enable devirtualization of %i call"
  msgid_plural ""
*************** msgid_plural ""
*** 18083,18089 ****
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3683
  #, gcc-internal-format
  msgid ""
  "Declaring virtual destructor of %qD final would enable devirtualization of "
--- 18172,18178 ----
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3684
  #, gcc-internal-format
  msgid ""
  "Declaring virtual destructor of %qD final would enable devirtualization of "
*************** msgid_plural ""
*** 18094,18100 ****
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3693
  #, gcc-internal-format
  msgid ""
  "Declaring method %qD final would enable devirtualization of %i call executed "
--- 18183,18189 ----
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-devirt.c:3694
  #, gcc-internal-format
  msgid ""
  "Declaring method %qD final would enable devirtualization of %i call executed "
*************** msgid_plural ""
*** 18105,18111 ****
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-inline-analysis.c:4311
  #, gcc-internal-format
  msgid "ipa inline summary is missing in input file"
  msgstr ""
--- 18194,18200 ----
  msgstr[0] ""
  msgstr[1] ""
  
! #: ipa-inline-analysis.c:4336
  #, gcc-internal-format
  msgid "ipa inline summary is missing in input file"
  msgstr ""
*************** msgstr ""
*** 18115,18131 ****
  msgid "ipa reference summary is missing in ltrans unit"
  msgstr ""
  
! #: ira.c:2339 ira.c:2352 ira.c:2366
  #, gcc-internal-format, gfc-internal-format
  msgid "%s cannot be used in asm here"
  msgstr ""
  
! #: ira.c:5505
  #, gcc-internal-format
  msgid "frame pointer required, but reserved"
  msgstr ""
  
! #: ira.c:5506
  #, gcc-internal-format
  msgid "for %qD"
  msgstr ""
--- 18204,18220 ----
  msgid "ipa reference summary is missing in ltrans unit"
  msgstr ""
  
! #: ira.c:2342 ira.c:2355 ira.c:2369
  #, gcc-internal-format, gfc-internal-format
  msgid "%s cannot be used in asm here"
  msgstr ""
  
! #: ira.c:5529
  #, gcc-internal-format
  msgid "frame pointer required, but reserved"
  msgstr ""
  
! #: ira.c:5530
  #, gcc-internal-format
  msgid "for %qD"
  msgstr ""
*************** msgstr ""
*** 18150,18201 ****
  msgid "inconsistent operand constraints in an %<asm%>"
  msgstr ""
  
! #: lra-constraints.c:4366
  #, gcc-internal-format, gfc-internal-format
  msgid "Max. number of generated reload insns per insn is achieved (%d)\n"
  msgstr ""
  
! #: lto-cgraph.c:1332
  #, gcc-internal-format, gfc-internal-format
  msgid "bytecode stream: found multiple instances of cgraph node with uid %d"
  msgstr ""
  
! #: lto-cgraph.c:1509
  #, gcc-internal-format
  msgid "bytecode stream: no caller found while reading edge"
  msgstr ""
  
! #: lto-cgraph.c:1515
  #, gcc-internal-format
  msgid "bytecode stream: no callee found while reading edge"
  msgstr ""
  
! #: lto-cgraph.c:1590
  #, gcc-internal-format
  msgid "bytecode stream: found empty cgraph node"
  msgstr ""
  
! #: lto-cgraph.c:1764
  #, gcc-internal-format, gfc-internal-format
  msgid "At most %i profile runs is supported. Perhaps corrupted profile?"
  msgstr ""
  
! #: lto-cgraph.c:1851
  #, gcc-internal-format, gfc-internal-format
  msgid "Profile information in %s corrupted"
  msgstr ""
  
! #: lto-cgraph.c:1884
  #, gcc-internal-format, gfc-internal-format
  msgid "cannot find LTO cgraph in %s"
  msgstr ""
  
! #: lto-cgraph.c:1894
  #, gcc-internal-format, gfc-internal-format
  msgid "cannot find LTO section refs in %s"
  msgstr ""
  
! #: lto-cgraph.c:1962
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid offload table in %s"
  msgstr ""
--- 18239,18290 ----
  msgid "inconsistent operand constraints in an %<asm%>"
  msgstr ""
  
! #: lra-constraints.c:4369
  #, gcc-internal-format, gfc-internal-format
  msgid "Max. number of generated reload insns per insn is achieved (%d)\n"
  msgstr ""
  
! #: lto-cgraph.c:1318
  #, gcc-internal-format, gfc-internal-format
  msgid "bytecode stream: found multiple instances of cgraph node with uid %d"
  msgstr ""
  
! #: lto-cgraph.c:1495
  #, gcc-internal-format
  msgid "bytecode stream: no caller found while reading edge"
  msgstr ""
  
! #: lto-cgraph.c:1501
  #, gcc-internal-format
  msgid "bytecode stream: no callee found while reading edge"
  msgstr ""
  
! #: lto-cgraph.c:1576
  #, gcc-internal-format
  msgid "bytecode stream: found empty cgraph node"
  msgstr ""
  
! #: lto-cgraph.c:1753
  #, gcc-internal-format, gfc-internal-format
  msgid "At most %i profile runs is supported. Perhaps corrupted profile?"
  msgstr ""
  
! #: lto-cgraph.c:1840
  #, gcc-internal-format, gfc-internal-format
  msgid "Profile information in %s corrupted"
  msgstr ""
  
! #: lto-cgraph.c:1873
  #, gcc-internal-format, gfc-internal-format
  msgid "cannot find LTO cgraph in %s"
  msgstr ""
  
! #: lto-cgraph.c:1883
  #, gcc-internal-format, gfc-internal-format
  msgid "cannot find LTO section refs in %s"
  msgstr ""
  
! #: lto-cgraph.c:1951
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid offload table in %s"
  msgstr ""
*************** msgstr ""
*** 18314,18320 ****
  msgid "environment variable COLLECT_GCC must be set"
  msgstr ""
  
! #: lto-wrapper.c:908 config/nvptx/mkoffload.c:883
  #, gcc-internal-format
  msgid "environment variable COLLECT_GCC_OPTIONS must be set"
  msgstr ""
--- 18403,18409 ----
  msgid "environment variable COLLECT_GCC must be set"
  msgstr ""
  
! #: lto-wrapper.c:908 config/nvptx/mkoffload.c:886
  #, gcc-internal-format
  msgid "environment variable COLLECT_GCC_OPTIONS must be set"
  msgstr ""
*************** msgstr ""
*** 18467,18499 ****
  msgid "setjmp/longjmp inside simd construct"
  msgstr ""
  
! #: omp-low.c:12080
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid exit from %s structured block"
  msgstr ""
  
! #: omp-low.c:12082 omp-low.c:12087
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid entry to %s structured block"
  msgstr ""
  
  #. Otherwise, be vague and lazy, but efficient.
! #: omp-low.c:12091
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid branch to/from %s structured block"
  msgstr ""
  
! #: omp-low.c:12590
  #, gcc-internal-format
  msgid "ignoring large linear step"
  msgstr ""
  
! #: omp-low.c:12597
  #, gcc-internal-format
  msgid "ignoring zero linear step"
  msgstr ""
  
! #: optabs.c:4526
  #, gcc-internal-format
  msgid "indirect jumps are not available on this target"
  msgstr ""
--- 18556,18588 ----
  msgid "setjmp/longjmp inside simd construct"
  msgstr ""
  
! #: omp-low.c:12086
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid exit from %s structured block"
  msgstr ""
  
! #: omp-low.c:12088 omp-low.c:12093
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid entry to %s structured block"
  msgstr ""
  
  #. Otherwise, be vague and lazy, but efficient.
! #: omp-low.c:12097
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid branch to/from %s structured block"
  msgstr ""
  
! #: omp-low.c:12596
  #, gcc-internal-format
  msgid "ignoring large linear step"
  msgstr ""
  
! #: omp-low.c:12603
  #, gcc-internal-format
  msgid "ignoring zero linear step"
  msgstr ""
  
! #: optabs.c:4545
  #, gcc-internal-format
  msgid "indirect jumps are not available on this target"
  msgstr ""
*************** msgstr ""
*** 18607,18613 ****
  msgid "section anchors must be disabled when toplevel reorder is disabled"
  msgstr ""
  
! #: opts.c:773 config/darwin.c:3161
  #, gcc-internal-format
  msgid ""
  "-freorder-blocks-and-partition does not work with exceptions on this "
--- 18696,18702 ----
  msgid "section anchors must be disabled when toplevel reorder is disabled"
  msgstr ""
  
! #: opts.c:773 config/darwin.c:3166
  #, gcc-internal-format
  msgid ""
  "-freorder-blocks-and-partition does not work with exceptions on this "
*************** msgstr ""
*** 19014,19022 ****
  msgid "can%'t use %qs as a fixed register"
  msgstr ""
  
! #: reginfo.c:790 config/ia64/ia64.c:5983 config/ia64/ia64.c:5990
! #: config/pa/pa.c:466 config/pa/pa.c:473 config/sh/sh.c:9544
! #: config/sh/sh.c:9551 config/spu/spu.c:4956 config/spu/spu.c:4963
  #, gcc-internal-format, gfc-internal-format
  msgid "unknown register name: %s"
  msgstr ""
--- 19103,19111 ----
  msgid "can%'t use %qs as a fixed register"
  msgstr ""
  
! #: reginfo.c:790 config/ia64/ia64.c:5997 config/ia64/ia64.c:6004
! #: config/pa/pa.c:466 config/pa/pa.c:473 config/sh/sh.c:9570
! #: config/sh/sh.c:9577 config/spu/spu.c:4956 config/spu/spu.c:4963
  #, gcc-internal-format, gfc-internal-format
  msgid "unknown register name: %s"
  msgstr ""
*************** msgstr ""
*** 19162,19168 ****
  msgid "operand constraint contains incorrectly positioned %<+%> or %<=%>"
  msgstr ""
  
! #: stmt.c:304 stmt.c:394
  #, gcc-internal-format
  msgid "%<%%%> constraint used with last operand"
  msgstr ""
--- 19251,19257 ----
  msgid "operand constraint contains incorrectly positioned %<+%> or %<=%>"
  msgstr ""
  
! #: stmt.c:304 stmt.c:388
  #, gcc-internal-format
  msgid "%<%%%> constraint used with last operand"
  msgstr ""
*************** msgstr ""
*** 19172,19208 ****
  msgid "matching constraint not valid in output operand"
  msgstr ""
  
! #: stmt.c:385
  #, gcc-internal-format
  msgid "input operand constraint contains %qc"
  msgstr ""
  
! #: stmt.c:424
  #, gcc-internal-format
  msgid "matching constraint references invalid operand number"
  msgstr ""
  
! #: stmt.c:458
  #, gcc-internal-format
  msgid "invalid punctuation %qc in constraint"
  msgstr ""
  
! #: stmt.c:479
  #, gcc-internal-format
  msgid "matching constraint does not allow a register"
  msgstr ""
  
! #: stmt.c:573
  #, gcc-internal-format
  msgid "duplicate asm operand name %qs"
  msgstr ""
  
! #: stmt.c:669
  #, gcc-internal-format
  msgid "missing close brace for named operand"
  msgstr ""
  
! #: stmt.c:694
  #, gcc-internal-format
  msgid "undefined named operand %qs"
  msgstr ""
--- 19261,19297 ----
  msgid "matching constraint not valid in output operand"
  msgstr ""
  
! #: stmt.c:379
  #, gcc-internal-format
  msgid "input operand constraint contains %qc"
  msgstr ""
  
! #: stmt.c:418
  #, gcc-internal-format
  msgid "matching constraint references invalid operand number"
  msgstr ""
  
! #: stmt.c:452
  #, gcc-internal-format
  msgid "invalid punctuation %qc in constraint"
  msgstr ""
  
! #: stmt.c:467
  #, gcc-internal-format
  msgid "matching constraint does not allow a register"
  msgstr ""
  
! #: stmt.c:561
  #, gcc-internal-format
  msgid "duplicate asm operand name %qs"
  msgstr ""
  
! #: stmt.c:657
  #, gcc-internal-format
  msgid "missing close brace for named operand"
  msgstr ""
  
! #: stmt.c:682
  #, gcc-internal-format
  msgid "undefined named operand %qs"
  msgstr ""
*************** msgstr ""
*** 19262,19268 ****
  msgid "packed attribute is unnecessary"
  msgstr ""
  
! #: stor-layout.c:2388
  #, gcc-internal-format
  msgid "alignment of array elements is greater than element size"
  msgstr ""
--- 19351,19357 ----
  msgid "packed attribute is unnecessary"
  msgstr ""
  
! #: stor-layout.c:2400
  #, gcc-internal-format
  msgid "alignment of array elements is greater than element size"
  msgstr ""
*************** msgstr ""
*** 19434,19440 ****
  msgid "target attribute is not supported on this machine"
  msgstr ""
  
! #: targhooks.c:1316
  #, gcc-internal-format
  msgid "#pragma GCC target is not supported for this machine"
  msgstr ""
--- 19523,19529 ----
  msgid "target attribute is not supported on this machine"
  msgstr ""
  
! #: targhooks.c:1320
  #, gcc-internal-format
  msgid "#pragma GCC target is not supported for this machine"
  msgstr ""
*************** msgstr ""
*** 19466,19472 ****
  msgid "ld returned %d exit status"
  msgstr ""
  
! #: toplev.c:522 c/c-decl.c:10662
  #, gcc-internal-format
  msgid "%q+F used but never defined"
  msgstr ""
--- 19555,19561 ----
  msgid "ld returned %d exit status"
  msgstr ""
  
! #: toplev.c:522 c/c-decl.c:10721
  #, gcc-internal-format
  msgid "%q+F used but never defined"
  msgstr ""
*************** msgstr ""
*** 19481,19527 ****
  msgid "%q+D defined but not used"
  msgstr ""
  
! #: toplev.c:996
  #, gcc-internal-format
  msgid "can%'t open %qs for writing: %m"
  msgstr ""
  
! #: toplev.c:1017
  #, gcc-internal-format
  msgid "-frecord-gcc-switches is not supported by the current target"
  msgstr ""
  
! #: toplev.c:1065
  #, gcc-internal-format
  msgid "stack usage computation not supported for this target"
  msgstr ""
  
! #: toplev.c:1134
  #, gcc-internal-format
  msgid "stack usage might be unbounded"
  msgstr ""
  
! #: toplev.c:1139
  #, gcc-internal-format
  msgid "stack usage might be %wd bytes"
  msgstr ""
  
! #: toplev.c:1142
  #, gcc-internal-format
  msgid "stack usage is %wd bytes"
  msgstr ""
  
! #: toplev.c:1158
  #, gcc-internal-format
  msgid "can%'t open %s for writing: %m"
  msgstr ""
  
! #: toplev.c:1341
  #, gcc-internal-format
  msgid "this target does not support %qs"
  msgstr ""
  
! #: toplev.c:1369
  #, gcc-internal-format
  msgid ""
  "Graphite loop optimizations cannot be used (ISL is not available)(-"
--- 19570,19616 ----
  msgid "%q+D defined but not used"
  msgstr ""
  
! #: toplev.c:1001
  #, gcc-internal-format
  msgid "can%'t open %qs for writing: %m"
  msgstr ""
  
! #: toplev.c:1022
  #, gcc-internal-format
  msgid "-frecord-gcc-switches is not supported by the current target"
  msgstr ""
  
! #: toplev.c:1070
  #, gcc-internal-format
  msgid "stack usage computation not supported for this target"
  msgstr ""
  
! #: toplev.c:1139
  #, gcc-internal-format
  msgid "stack usage might be unbounded"
  msgstr ""
  
! #: toplev.c:1144
  #, gcc-internal-format
  msgid "stack usage might be %wd bytes"
  msgstr ""
  
! #: toplev.c:1147
  #, gcc-internal-format
  msgid "stack usage is %wd bytes"
  msgstr ""
  
! #: toplev.c:1163
  #, gcc-internal-format
  msgid "can%'t open %s for writing: %m"
  msgstr ""
  
! #: toplev.c:1332
  #, gcc-internal-format
  msgid "this target does not support %qs"
  msgstr ""
  
! #: toplev.c:1360
  #, gcc-internal-format
  msgid ""
  "Graphite loop optimizations cannot be used (ISL is not available)(-"
*************** msgid ""
*** 19530,19645 ****
  "linear)"
  msgstr ""
  
! #: toplev.c:1379
  #, gcc-internal-format
  msgid "-fcheck-pointer-bounds is not supported for this target"
  msgstr ""
  
! #: toplev.c:1385
  #, gcc-internal-format
  msgid "-fcheck-pointer-bounds is not supported with Address Sanitizer"
  msgstr ""
  
  #. -fabi-version=1 support was removed after GCC 4.9.
! #: toplev.c:1399
  #, gcc-internal-format
  msgid "%<-fabi-version=1%> is no longer supported"
  msgstr ""
  
! #: toplev.c:1426
  #, gcc-internal-format
  msgid "instruction scheduling not supported on this target machine"
  msgstr ""
  
! #: toplev.c:1430
  #, gcc-internal-format
  msgid "this target machine does not have delayed branches"
  msgstr ""
  
! #: toplev.c:1444
  #, gcc-internal-format, gfc-internal-format
  msgid "-f%sleading-underscore not supported on this target machine"
  msgstr ""
  
! #: toplev.c:1487
  #, gcc-internal-format
  msgid "could not close zeroed insn dump file %qs: %m"
  msgstr ""
  
! #: toplev.c:1521
  #, gcc-internal-format
  msgid "target system does not support the %qs debug format"
  msgstr ""
  
! #: toplev.c:1533
  #, gcc-internal-format
  msgid "variable tracking requested, but useless unless producing debug info"
  msgstr ""
  
! #: toplev.c:1536
  #, gcc-internal-format
  msgid "variable tracking requested, but not supported by this debug format"
  msgstr ""
  
! #: toplev.c:1573
  #, gcc-internal-format
  msgid "var-tracking-assignments changes selective scheduling"
  msgstr ""
  
! #: toplev.c:1596
  #, gcc-internal-format
  msgid "-ffunction-sections not supported for this target"
  msgstr ""
  
! #: toplev.c:1601
  #, gcc-internal-format
  msgid "-fdata-sections not supported for this target"
  msgstr ""
  
! #: toplev.c:1609
  #, gcc-internal-format
  msgid "-fprefetch-loop-arrays not supported for this target"
  msgstr ""
  
! #: toplev.c:1615
  #, gcc-internal-format
  msgid ""
  "-fprefetch-loop-arrays not supported for this target (try -march switches)"
  msgstr ""
  
! #: toplev.c:1624
  #, gcc-internal-format
  msgid "-fprefetch-loop-arrays is not supported with -Os"
  msgstr ""
  
! #: toplev.c:1635
  #, gcc-internal-format
  msgid "-fassociative-math disabled; other options take precedence"
  msgstr ""
  
! #: toplev.c:1651
  #, gcc-internal-format
  msgid "-fstack-protector not supported for this target"
  msgstr ""
  
! #: toplev.c:1663
  #, gcc-internal-format
  msgid ""
  "-fsanitize=address and -fsanitize=kernel-address are not supported for this "
  "target"
  msgstr ""
  
! #: toplev.c:1671
  #, gcc-internal-format
  msgid "-fsanitize=address not supported for this target"
  msgstr ""
  
! #: toplev.c:1986
  #, gcc-internal-format
  msgid "error writing to %s: %m"
  msgstr ""
  
! #: toplev.c:1988 java/jcf-parse.c:1793
  #, gcc-internal-format
  msgid "error closing %s: %m"
  msgstr ""
--- 19619,19734 ----
  "linear)"
  msgstr ""
  
! #: toplev.c:1370
  #, gcc-internal-format
  msgid "-fcheck-pointer-bounds is not supported for this target"
  msgstr ""
  
! #: toplev.c:1376
  #, gcc-internal-format
  msgid "-fcheck-pointer-bounds is not supported with Address Sanitizer"
  msgstr ""
  
  #. -fabi-version=1 support was removed after GCC 4.9.
! #: toplev.c:1390
  #, gcc-internal-format
  msgid "%<-fabi-version=1%> is no longer supported"
  msgstr ""
  
! #: toplev.c:1417
  #, gcc-internal-format
  msgid "instruction scheduling not supported on this target machine"
  msgstr ""
  
! #: toplev.c:1421
  #, gcc-internal-format
  msgid "this target machine does not have delayed branches"
  msgstr ""
  
! #: toplev.c:1435
  #, gcc-internal-format, gfc-internal-format
  msgid "-f%sleading-underscore not supported on this target machine"
  msgstr ""
  
! #: toplev.c:1478
  #, gcc-internal-format
  msgid "could not close zeroed insn dump file %qs: %m"
  msgstr ""
  
! #: toplev.c:1512
  #, gcc-internal-format
  msgid "target system does not support the %qs debug format"
  msgstr ""
  
! #: toplev.c:1524
  #, gcc-internal-format
  msgid "variable tracking requested, but useless unless producing debug info"
  msgstr ""
  
! #: toplev.c:1527
  #, gcc-internal-format
  msgid "variable tracking requested, but not supported by this debug format"
  msgstr ""
  
! #: toplev.c:1564
  #, gcc-internal-format
  msgid "var-tracking-assignments changes selective scheduling"
  msgstr ""
  
! #: toplev.c:1587
  #, gcc-internal-format
  msgid "-ffunction-sections not supported for this target"
  msgstr ""
  
! #: toplev.c:1592
  #, gcc-internal-format
  msgid "-fdata-sections not supported for this target"
  msgstr ""
  
! #: toplev.c:1600
  #, gcc-internal-format
  msgid "-fprefetch-loop-arrays not supported for this target"
  msgstr ""
  
! #: toplev.c:1606
  #, gcc-internal-format
  msgid ""
  "-fprefetch-loop-arrays not supported for this target (try -march switches)"
  msgstr ""
  
! #: toplev.c:1615
  #, gcc-internal-format
  msgid "-fprefetch-loop-arrays is not supported with -Os"
  msgstr ""
  
! #: toplev.c:1626
  #, gcc-internal-format
  msgid "-fassociative-math disabled; other options take precedence"
  msgstr ""
  
! #: toplev.c:1642
  #, gcc-internal-format
  msgid "-fstack-protector not supported for this target"
  msgstr ""
  
! #: toplev.c:1654
  #, gcc-internal-format
  msgid ""
  "-fsanitize=address and -fsanitize=kernel-address are not supported for this "
  "target"
  msgstr ""
  
! #: toplev.c:1662
  #, gcc-internal-format
  msgid "-fsanitize=address not supported for this target"
  msgstr ""
  
! #: toplev.c:1977
  #, gcc-internal-format
  msgid "error writing to %s: %m"
  msgstr ""
  
! #: toplev.c:1979 java/jcf-parse.c:1793
  #, gcc-internal-format
  msgid "error closing %s: %m"
  msgstr ""
*************** msgstr ""
*** 19810,19817 ****
  #: tree-cfg.c:2933
  #, gcc-internal-format
  msgid ""
! "mode precision of non-integral result does not match field size of "
! "BIT_FIELD_REF"
  msgstr ""
  
  #: tree-cfg.c:2941
--- 19899,19905 ----
  #: tree-cfg.c:2933
  #, gcc-internal-format
  msgid ""
! "mode size of non-integral result does not match field size of BIT_FIELD_REF"
  msgstr ""
  
  #: tree-cfg.c:2941
*************** msgstr ""
*** 20459,20500 ****
  msgid "memory access check always fail"
  msgstr ""
  
! #: tree-chkp.c:1994
  #, gcc-internal-format, gfc-internal-format
  msgid "-fcheck-pointer-bounds requires '%s' name for internal usage"
  msgstr ""
  
! #: tree-chkp.c:2701
  #, gcc-internal-format, gfc-internal-format
  msgid "pointer bounds were lost due to unexpected expression %s"
  msgstr ""
  
! #: tree-chkp.c:2776
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_get_bounds_by_definition: Unexpected var of type %s"
  msgstr ""
  
! #: tree-chkp.c:2819
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_get_bounds_by_definition: Unexpected GIMPLE code %s"
  msgstr ""
  
! #: tree-chkp.c:3440
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_make_addressed_object_bounds: Unexpected tree code %s"
  msgstr ""
  
! #: tree-chkp.c:3592
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_find_bounds: Unexpected tree code %s"
  msgstr ""
  
! #: tree-chkp.c:3603
  #, gcc-internal-format
  msgid "chkp_find_bounds: Cannot find bounds for pointer"
  msgstr ""
  
! #: tree-chkp.c:3719
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_walk_pointer_assignments: unexpected RHS type: %s"
  msgstr ""
--- 20547,20588 ----
  msgid "memory access check always fail"
  msgstr ""
  
! #: tree-chkp.c:2019
  #, gcc-internal-format, gfc-internal-format
  msgid "-fcheck-pointer-bounds requires '%s' name for internal usage"
  msgstr ""
  
! #: tree-chkp.c:2730
  #, gcc-internal-format, gfc-internal-format
  msgid "pointer bounds were lost due to unexpected expression %s"
  msgstr ""
  
! #: tree-chkp.c:2818
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_get_bounds_by_definition: Unexpected var of type %s"
  msgstr ""
  
! #: tree-chkp.c:2861
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_get_bounds_by_definition: Unexpected GIMPLE code %s"
  msgstr ""
  
! #: tree-chkp.c:3482
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_make_addressed_object_bounds: Unexpected tree code %s"
  msgstr ""
  
! #: tree-chkp.c:3634
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_find_bounds: Unexpected tree code %s"
  msgstr ""
  
! #: tree-chkp.c:3645
  #, gcc-internal-format
  msgid "chkp_find_bounds: Cannot find bounds for pointer"
  msgstr ""
  
! #: tree-chkp.c:3761
  #, gcc-internal-format, gfc-internal-format
  msgid "chkp_walk_pointer_assignments: unexpected RHS type: %s"
  msgstr ""
*************** msgstr ""
*** 20554,20637 ****
  msgid "BB %i has incorrect fallthru edge"
  msgstr ""
  
! #: tree-inline.c:3566
  #, gcc-internal-format
  msgid "function %q+F can never be copied because it receives a non-local goto"
  msgstr ""
  
! #: tree-inline.c:3580
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be copied because it saves address of local label in "
  "a static variable"
  msgstr ""
  
! #: tree-inline.c:3620
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses alloca (override using "
  "the always_inline attribute)"
  msgstr ""
  
! #: tree-inline.c:3634
  #, gcc-internal-format
  msgid "function %q+F can never be inlined because it uses setjmp"
  msgstr ""
  
! #: tree-inline.c:3648
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses variable argument lists"
  msgstr ""
  
! #: tree-inline.c:3660
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses setjmp-longjmp exception "
  "handling"
  msgstr ""
  
! #: tree-inline.c:3668
  #, gcc-internal-format
  msgid "function %q+F can never be inlined because it uses non-local goto"
  msgstr ""
  
! #: tree-inline.c:3680
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses __builtin_return or "
  "__builtin_apply_args"
  msgstr ""
  
! #: tree-inline.c:3700
  #, gcc-internal-format
  msgid "function %q+F can never be inlined because it contains a computed goto"
  msgstr ""
  
! #: tree-inline.c:3801
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it is suppressed using -fno-inline"
  msgstr ""
  
! #: tree-inline.c:3809
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses attributes conflicting "
  "with inlining"
  msgstr ""
  
! #: tree-inline.c:4430
  #, gcc-internal-format
  msgid "inlining failed in call to always_inline %q+F: %s"
  msgstr ""
  
! #: tree-inline.c:4432 tree-inline.c:4447
  #, gcc-internal-format
  msgid "called from here"
  msgstr ""
  
! #: tree-inline.c:4445
  #, gcc-internal-format
  msgid "inlining failed in call to %q+F: %s"
  msgstr ""
--- 20642,20725 ----
  msgid "BB %i has incorrect fallthru edge"
  msgstr ""
  
! #: tree-inline.c:3568
  #, gcc-internal-format
  msgid "function %q+F can never be copied because it receives a non-local goto"
  msgstr ""
  
! #: tree-inline.c:3582
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be copied because it saves address of local label in "
  "a static variable"
  msgstr ""
  
! #: tree-inline.c:3622
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses alloca (override using "
  "the always_inline attribute)"
  msgstr ""
  
! #: tree-inline.c:3636
  #, gcc-internal-format
  msgid "function %q+F can never be inlined because it uses setjmp"
  msgstr ""
  
! #: tree-inline.c:3650
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses variable argument lists"
  msgstr ""
  
! #: tree-inline.c:3662
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses setjmp-longjmp exception "
  "handling"
  msgstr ""
  
! #: tree-inline.c:3670
  #, gcc-internal-format
  msgid "function %q+F can never be inlined because it uses non-local goto"
  msgstr ""
  
! #: tree-inline.c:3682
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses __builtin_return or "
  "__builtin_apply_args"
  msgstr ""
  
! #: tree-inline.c:3702
  #, gcc-internal-format
  msgid "function %q+F can never be inlined because it contains a computed goto"
  msgstr ""
  
! #: tree-inline.c:3803
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it is suppressed using -fno-inline"
  msgstr ""
  
! #: tree-inline.c:3811
  #, gcc-internal-format
  msgid ""
  "function %q+F can never be inlined because it uses attributes conflicting "
  "with inlining"
  msgstr ""
  
! #: tree-inline.c:4486
  #, gcc-internal-format
  msgid "inlining failed in call to always_inline %q+F: %s"
  msgstr ""
  
! #: tree-inline.c:4488 tree-inline.c:4503
  #, gcc-internal-format
  msgid "called from here"
  msgstr ""
  
! #: tree-inline.c:4501
  #, gcc-internal-format
  msgid "inlining failed in call to %q+F: %s"
  msgstr ""
*************** msgid "cannot update SSA form"
*** 20647,20653 ****
  msgstr ""
  
  #: tree-into-ssa.c:3332 tree-outof-ssa.c:891 tree-outof-ssa.c:948
! #: tree-ssa-coalesce.c:927 tree-ssa-live.c:1417
  #, gcc-internal-format
  msgid "SSA corruption"
  msgstr ""
--- 20735,20741 ----
  msgstr ""
  
  #: tree-into-ssa.c:3332 tree-outof-ssa.c:891 tree-outof-ssa.c:948
! #: tree-ssa-coalesce.c:927 tree-ssa-live.c:1426
  #, gcc-internal-format
  msgid "SSA corruption"
  msgstr ""
*************** msgstr ""
*** 20702,20728 ****
  msgid "stmt volatile flag not up-to-date"
  msgstr ""
  
! #: tree-ssa-uninit.c:195 varasm.c:350
  #, gcc-internal-format
  msgid "%qD was declared here"
  msgstr ""
  
! #: tree-ssa-uninit.c:227
  #, gcc-internal-format
  msgid "%qD is used uninitialized in this function"
  msgstr ""
  
! #: tree-ssa-uninit.c:232 tree-ssa-uninit.c:2368
  #, gcc-internal-format
  msgid "%qD may be used uninitialized in this function"
  msgstr ""
  
! #: tree-ssa-uninit.c:263
  #, gcc-internal-format
  msgid "%qE is used uninitialized in this function"
  msgstr ""
  
! #: tree-ssa-uninit.c:268
  #, gcc-internal-format
  msgid "%qE may be used uninitialized in this function"
  msgstr ""
--- 20790,20816 ----
  msgid "stmt volatile flag not up-to-date"
  msgstr ""
  
! #: tree-ssa-uninit.c:220 varasm.c:350
  #, gcc-internal-format
  msgid "%qD was declared here"
  msgstr ""
  
! #: tree-ssa-uninit.c:252
  #, gcc-internal-format
  msgid "%qD is used uninitialized in this function"
  msgstr ""
  
! #: tree-ssa-uninit.c:257 tree-ssa-uninit.c:2396
  #, gcc-internal-format
  msgid "%qD may be used uninitialized in this function"
  msgstr ""
  
! #: tree-ssa-uninit.c:288
  #, gcc-internal-format
  msgid "%qE is used uninitialized in this function"
  msgstr ""
  
! #: tree-ssa-uninit.c:293
  #, gcc-internal-format
  msgid "%qE may be used uninitialized in this function"
  msgstr ""
*************** msgstr ""
*** 20879,20885 ****
  msgid "vector condition will be expanded piecewise"
  msgstr ""
  
! #: tree-vect-generic.c:1295
  #, gcc-internal-format
  msgid "vector shuffling operation will be expanded piecewise"
  msgstr ""
--- 20967,20973 ----
  msgid "vector condition will be expanded piecewise"
  msgstr ""
  
! #: tree-vect-generic.c:1319
  #, gcc-internal-format
  msgid "vector shuffling operation will be expanded piecewise"
  msgstr ""
*************** msgid ""
*** 20911,20917 ****
  "constant"
  msgstr ""
  
! #: tree-vrp.c:7553 tree-vrp.c:9463 tree-vrp.c:9507 tree-vrp.c:9568
  #, gcc-internal-format
  msgid "assuming signed overflow does not occur when simplifying conditional"
  msgstr ""
--- 20999,21005 ----
  "constant"
  msgstr ""
  
! #: tree-vrp.c:7553 tree-vrp.c:9466 tree-vrp.c:9510 tree-vrp.c:9572
  #, gcc-internal-format
  msgid "assuming signed overflow does not occur when simplifying conditional"
  msgstr ""
*************** msgstr ""
*** 20926,20968 ****
  msgid "comparison always true due to limited range of data type"
  msgstr ""
  
! #: tree-vrp.c:9098
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when simplifying %</%> or %<%%%> to "
  "%<>>%> or %<&%>"
  msgstr ""
  
! #: tree-vrp.c:9180
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when simplifying %<abs (X)%> to %<X"
  "%> or %<-X%>"
  msgstr ""
  
! #: tree.c:4753
  #, gcc-internal-format
  msgid "ignoring attributes applied to %qT after definition"
  msgstr ""
  
! #: tree.c:6149
  #, gcc-internal-format
  msgid "%q+D already declared with dllexport attribute: dllimport ignored"
  msgstr ""
  
! #: tree.c:6161
  #, gcc-internal-format
  msgid ""
  "%q+D redeclared without dllimport attribute after being referenced with dll "
  "linkage"
  msgstr ""
  
! #: tree.c:6176
  #, gcc-internal-format
  msgid "%q+D redeclared without dllimport attribute: previous dllimport ignored"
  msgstr ""
  
! #: tree.c:6219 tree.c:6231 tree.c:6241 c-family/c-common.c:6623
  #: c-family/c-common.c:6642 c-family/c-common.c:6660 c-family/c-common.c:6690
  #: c-family/c-common.c:6718 c-family/c-common.c:6746 c-family/c-common.c:6762
  #: c-family/c-common.c:6777 c-family/c-common.c:6795 c-family/c-common.c:6810
--- 21014,21056 ----
  msgid "comparison always true due to limited range of data type"
  msgstr ""
  
! #: tree-vrp.c:9101
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when simplifying %</%> or %<%%%> to "
  "%<>>%> or %<&%>"
  msgstr ""
  
! #: tree-vrp.c:9183
  #, gcc-internal-format
  msgid ""
  "assuming signed overflow does not occur when simplifying %<abs (X)%> to %<X"
  "%> or %<-X%>"
  msgstr ""
  
! #: tree.c:4752
  #, gcc-internal-format
  msgid "ignoring attributes applied to %qT after definition"
  msgstr ""
  
! #: tree.c:6148
  #, gcc-internal-format
  msgid "%q+D already declared with dllexport attribute: dllimport ignored"
  msgstr ""
  
! #: tree.c:6160
  #, gcc-internal-format
  msgid ""
  "%q+D redeclared without dllimport attribute after being referenced with dll "
  "linkage"
  msgstr ""
  
! #: tree.c:6175
  #, gcc-internal-format
  msgid "%q+D redeclared without dllimport attribute: previous dllimport ignored"
  msgstr ""
  
! #: tree.c:6218 tree.c:6230 tree.c:6240 c-family/c-common.c:6623
  #: c-family/c-common.c:6642 c-family/c-common.c:6660 c-family/c-common.c:6690
  #: c-family/c-common.c:6718 c-family/c-common.c:6746 c-family/c-common.c:6762
  #: c-family/c-common.c:6777 c-family/c-common.c:6795 c-family/c-common.c:6810
*************** msgstr ""
*** 20979,21112 ****
  #: c-family/c-common.c:8680 c-family/c-common.c:8701 c-family/c-common.c:8815
  #: c-family/c-common.c:8842 c-family/c-common.c:9155 c-family/c-common.c:9178
  #: c-family/c-common.c:9217 c-family/c-common.c:9299 c-family/c-common.c:9446
! #: config/darwin.c:2069 config/arm/arm.c:6250 config/arm/arm.c:6278
! #: config/arm/arm.c:6295 config/avr/avr.c:8975 config/h8300/h8300.c:5496
! #: config/h8300/h8300.c:5520 config/i386/i386.c:5608 config/i386/i386.c:42946
! #: config/ia64/ia64.c:797 config/rs6000/rs6000.c:29090 config/spu/spu.c:3790
! #: ada/gcc-interface/utils.c:5814 ada/gcc-interface/utils.c:5840
  #: lto/lto-lang.c:260
  #, gcc-internal-format
  msgid "%qE attribute ignored"
  msgstr ""
  
! #: tree.c:6259
  #, gcc-internal-format
  msgid "inline function %q+D declared as  dllimport: attribute ignored"
  msgstr ""
  
! #: tree.c:6267
  #, gcc-internal-format
  msgid "function %q+D definition is marked dllimport"
  msgstr ""
  
! #: tree.c:6275
  #, gcc-internal-format
  msgid "variable %q+D definition is marked dllimport"
  msgstr ""
  
! #: tree.c:6303
  #, gcc-internal-format
  msgid "external linkage required for symbol %q+D because of %qE attribute"
  msgstr ""
  
! #: tree.c:6317
  #, gcc-internal-format
  msgid ""
  "%qE implies default visibility, but %qD has already been declared with a "
  "different visibility"
  msgstr ""
  
! #: tree.c:7960
  #, gcc-internal-format
  msgid "arrays of functions are not meaningful"
  msgstr ""
  
! #: tree.c:8128
  #, gcc-internal-format
  msgid "function return type cannot be function"
  msgstr ""
  
! #: tree.c:9295 tree.c:9380 tree.c:9441
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: %s, have %s in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9332
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: expected none of %s, have %s in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9345
  #, gcc-internal-format
  msgid "tree check: expected class %qs, have %qs (%s) in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9394
  #, gcc-internal-format
  msgid "tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9407
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: expected omp_clause %s, have %s in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9467
  #, gcc-internal-format
  msgid ""
  "tree check: expected tree that contains %qs structure, have %qs in %s, at %s:"
  "%d"
  msgstr ""
  
! #: tree.c:9481
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9493
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9506
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: accessed operand %d of %s with %d operands in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9519
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "tree check: accessed operand %d of omp_clause %s with %d operands in %s, at "
  "%s:%d"
  msgstr ""
  
! #: tree.c:12131
  #, gcc-internal-format
  msgid "%qD is deprecated: %s"
  msgstr ""
  
! #: tree.c:12134
  #, gcc-internal-format
  msgid "%qD is deprecated"
  msgstr ""
  
! #: tree.c:12158 tree.c:12180
  #, gcc-internal-format
  msgid "%qE is deprecated: %s"
  msgstr ""
  
! #: tree.c:12161 tree.c:12183
  #, gcc-internal-format
  msgid "%qE is deprecated"
  msgstr ""
  
! #: tree.c:12167 tree.c:12188
  #, gcc-internal-format, gfc-internal-format
  msgid "type is deprecated: %s"
  msgstr ""
  
! #: tree.c:12170 tree.c:12191
  #, gcc-internal-format
  msgid "type is deprecated"
  msgstr ""
--- 21067,21200 ----
  #: c-family/c-common.c:8680 c-family/c-common.c:8701 c-family/c-common.c:8815
  #: c-family/c-common.c:8842 c-family/c-common.c:9155 c-family/c-common.c:9178
  #: c-family/c-common.c:9217 c-family/c-common.c:9299 c-family/c-common.c:9446
! #: config/darwin.c:2074 config/arm/arm.c:6265 config/arm/arm.c:6293
! #: config/arm/arm.c:6310 config/avr/avr.c:9011 config/h8300/h8300.c:5496
! #: config/h8300/h8300.c:5520 config/i386/i386.c:5624 config/i386/i386.c:43047
! #: config/ia64/ia64.c:797 config/rs6000/rs6000.c:29145 config/spu/spu.c:3790
! #: ada/gcc-interface/utils.c:5822 ada/gcc-interface/utils.c:5848
  #: lto/lto-lang.c:260
  #, gcc-internal-format
  msgid "%qE attribute ignored"
  msgstr ""
  
! #: tree.c:6258
  #, gcc-internal-format
  msgid "inline function %q+D declared as  dllimport: attribute ignored"
  msgstr ""
  
! #: tree.c:6266
  #, gcc-internal-format
  msgid "function %q+D definition is marked dllimport"
  msgstr ""
  
! #: tree.c:6274
  #, gcc-internal-format
  msgid "variable %q+D definition is marked dllimport"
  msgstr ""
  
! #: tree.c:6302
  #, gcc-internal-format
  msgid "external linkage required for symbol %q+D because of %qE attribute"
  msgstr ""
  
! #: tree.c:6316
  #, gcc-internal-format
  msgid ""
  "%qE implies default visibility, but %qD has already been declared with a "
  "different visibility"
  msgstr ""
  
! #: tree.c:7959
  #, gcc-internal-format
  msgid "arrays of functions are not meaningful"
  msgstr ""
  
! #: tree.c:8127
  #, gcc-internal-format
  msgid "function return type cannot be function"
  msgstr ""
  
! #: tree.c:9294 tree.c:9379 tree.c:9440
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: %s, have %s in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9331
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: expected none of %s, have %s in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9344
  #, gcc-internal-format
  msgid "tree check: expected class %qs, have %qs (%s) in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9393
  #, gcc-internal-format
  msgid "tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9406
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: expected omp_clause %s, have %s in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9466
  #, gcc-internal-format
  msgid ""
  "tree check: expected tree that contains %qs structure, have %qs in %s, at %s:"
  "%d"
  msgstr ""
  
! #: tree.c:9480
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9492
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9505
  #, gcc-internal-format, gfc-internal-format
  msgid "tree check: accessed operand %d of %s with %d operands in %s, at %s:%d"
  msgstr ""
  
! #: tree.c:9518
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "tree check: accessed operand %d of omp_clause %s with %d operands in %s, at "
  "%s:%d"
  msgstr ""
  
! #: tree.c:12130
  #, gcc-internal-format
  msgid "%qD is deprecated: %s"
  msgstr ""
  
! #: tree.c:12133
  #, gcc-internal-format
  msgid "%qD is deprecated"
  msgstr ""
  
! #: tree.c:12157 tree.c:12179
  #, gcc-internal-format
  msgid "%qE is deprecated: %s"
  msgstr ""
  
! #: tree.c:12160 tree.c:12182
  #, gcc-internal-format
  msgid "%qE is deprecated"
  msgstr ""
  
! #: tree.c:12166 tree.c:12187
  #, gcc-internal-format, gfc-internal-format
  msgid "type is deprecated: %s"
  msgstr ""
  
! #: tree.c:12169 tree.c:12190
  #, gcc-internal-format
  msgid "type is deprecated"
  msgstr ""
*************** msgid ""
*** 21135,21148 ****
  "basic-block count (%d)"
  msgstr ""
  
! #: var-tracking.c:7115
  #, gcc-internal-format
  msgid ""
  "variable tracking size limit exceeded with -fvar-tracking-assignments, "
  "retrying without"
  msgstr ""
  
! #: var-tracking.c:7119
  #, gcc-internal-format
  msgid "variable tracking size limit exceeded"
  msgstr ""
--- 21223,21236 ----
  "basic-block count (%d)"
  msgstr ""
  
! #: var-tracking.c:7110
  #, gcc-internal-format
  msgid ""
  "variable tracking size limit exceeded with -fvar-tracking-assignments, "
  "retrying without"
  msgstr ""
  
! #: var-tracking.c:7114
  #, gcc-internal-format
  msgid "variable tracking size limit exceeded"
  msgstr ""
*************** msgstr ""
*** 21215,21307 ****
  msgid "optimization may eliminate reads and/or writes to register variables"
  msgstr ""
  
! #: varasm.c:1448
  #, gcc-internal-format
  msgid "register name given for non-register variable %q+D"
  msgstr ""
  
! #: varasm.c:2002
  #, gcc-internal-format
  msgid "thread-local COMMON data not implemented"
  msgstr ""
  
! #: varasm.c:2035
  #, gcc-internal-format
  msgid ""
  "requested alignment for %q+D is greater than implemented alignment of %wu"
  msgstr ""
  
! #: varasm.c:2137 c/c-decl.c:4805
  #, gcc-internal-format
  msgid "storage size of %q+D isn%'t known"
  msgstr ""
  
! #: varasm.c:4770
  #, gcc-internal-format
  msgid "initializer for integer/fixed-point value is too complicated"
  msgstr ""
  
! #: varasm.c:4775
  #, gcc-internal-format
  msgid "initializer for floating value is not a floating constant"
  msgstr ""
  
! #: varasm.c:5071
  #, gcc-internal-format
  msgid "invalid initial value for member %qE"
  msgstr ""
  
! #: varasm.c:5327 c-family/c-common.c:7871
  #, gcc-internal-format
  msgid "%+D declared weak after being used"
  msgstr ""
  
! #: varasm.c:5409
  #, gcc-internal-format
  msgid "weak declaration of %q+D must be public"
  msgstr ""
  
! #: varasm.c:5411
  #, gcc-internal-format
  msgid "weak declaration of %q+D not supported"
  msgstr ""
  
! #: varasm.c:5440 varasm.c:5744
  #, gcc-internal-format
  msgid "only weak aliases are supported in this configuration"
  msgstr ""
  
! #: varasm.c:5634
  #, gcc-internal-format
  msgid "weakref is not supported in this configuration"
  msgstr ""
  
! #: varasm.c:5666
  #, gcc-internal-format
  msgid "ifunc is not supported on this target"
  msgstr ""
  
! #: varasm.c:5724
  #, gcc-internal-format
  msgid "weakref %q+D ultimately targets itself"
  msgstr ""
  
! #: varasm.c:5726
  #, gcc-internal-format
  msgid "weakref %q+D must have static linkage"
  msgstr ""
  
! #: varasm.c:5733
  #, gcc-internal-format
  msgid "alias definitions not supported in this configuration"
  msgstr ""
  
! #: varasm.c:5741
  #, gcc-internal-format
  msgid "ifunc is not supported in this configuration"
  msgstr ""
  
! #: varasm.c:5966 config/sol2.c:167 config/i386/winnt.c:293
  #, gcc-internal-format
  msgid "visibility attribute not supported in this configuration; ignored"
  msgstr ""
--- 21303,21395 ----
  msgid "optimization may eliminate reads and/or writes to register variables"
  msgstr ""
  
! #: varasm.c:1451
  #, gcc-internal-format
  msgid "register name given for non-register variable %q+D"
  msgstr ""
  
! #: varasm.c:2005
  #, gcc-internal-format
  msgid "thread-local COMMON data not implemented"
  msgstr ""
  
! #: varasm.c:2038
  #, gcc-internal-format
  msgid ""
  "requested alignment for %q+D is greater than implemented alignment of %wu"
  msgstr ""
  
! #: varasm.c:2140 c/c-decl.c:4834
  #, gcc-internal-format
  msgid "storage size of %q+D isn%'t known"
  msgstr ""
  
! #: varasm.c:4773
  #, gcc-internal-format
  msgid "initializer for integer/fixed-point value is too complicated"
  msgstr ""
  
! #: varasm.c:4778
  #, gcc-internal-format
  msgid "initializer for floating value is not a floating constant"
  msgstr ""
  
! #: varasm.c:5079
  #, gcc-internal-format
  msgid "invalid initial value for member %qE"
  msgstr ""
  
! #: varasm.c:5335 c-family/c-common.c:7871
  #, gcc-internal-format
  msgid "%+D declared weak after being used"
  msgstr ""
  
! #: varasm.c:5417
  #, gcc-internal-format
  msgid "weak declaration of %q+D must be public"
  msgstr ""
  
! #: varasm.c:5419
  #, gcc-internal-format
  msgid "weak declaration of %q+D not supported"
  msgstr ""
  
! #: varasm.c:5448 varasm.c:5752
  #, gcc-internal-format
  msgid "only weak aliases are supported in this configuration"
  msgstr ""
  
! #: varasm.c:5642
  #, gcc-internal-format
  msgid "weakref is not supported in this configuration"
  msgstr ""
  
! #: varasm.c:5674
  #, gcc-internal-format
  msgid "ifunc is not supported on this target"
  msgstr ""
  
! #: varasm.c:5732
  #, gcc-internal-format
  msgid "weakref %q+D ultimately targets itself"
  msgstr ""
  
! #: varasm.c:5734
  #, gcc-internal-format
  msgid "weakref %q+D must have static linkage"
  msgstr ""
  
! #: varasm.c:5741
  #, gcc-internal-format
  msgid "alias definitions not supported in this configuration"
  msgstr ""
  
! #: varasm.c:5749
  #, gcc-internal-format
  msgid "ifunc is not supported in this configuration"
  msgstr ""
  
! #: varasm.c:5974 config/sol2.c:170 config/i386/winnt.c:293
  #, gcc-internal-format
  msgid "visibility attribute not supported in this configuration; ignored"
  msgstr ""
*************** msgid ""
*** 21381,21407 ****
  "required to support"
  msgstr ""
  
! #: c-family/c-common.c:1374 c/c-typeck.c:10711 cp/typeck.c:4331
  #, gcc-internal-format
  msgid "left shift count is negative"
  msgstr ""
  
! #: c-family/c-common.c:1375 c/c-typeck.c:10661 cp/typeck.c:4286
  #, gcc-internal-format
  msgid "right shift count is negative"
  msgstr ""
  
! #: c-family/c-common.c:1380 c/c-typeck.c:10719 cp/typeck.c:4339
  #, gcc-internal-format
  msgid "left shift count >= width of type"
  msgstr ""
  
! #: c-family/c-common.c:1381 c/c-typeck.c:10673 cp/typeck.c:4294
  #, gcc-internal-format
  msgid "right shift count >= width of type"
  msgstr ""
  
! #: c-family/c-common.c:1614 c-family/c-common.c:1626 cp/constexpr.c:1528
  #, gcc-internal-format
  msgid "overflow in constant expression"
  msgstr ""
--- 21469,21495 ----
  "required to support"
  msgstr ""
  
! #: c-family/c-common.c:1374 c/c-typeck.c:10728 cp/typeck.c:4333
  #, gcc-internal-format
  msgid "left shift count is negative"
  msgstr ""
  
! #: c-family/c-common.c:1375 c/c-typeck.c:10678 cp/typeck.c:4288
  #, gcc-internal-format
  msgid "right shift count is negative"
  msgstr ""
  
! #: c-family/c-common.c:1380 c/c-typeck.c:10736 cp/typeck.c:4341
  #, gcc-internal-format
  msgid "left shift count >= width of type"
  msgstr ""
  
! #: c-family/c-common.c:1381 c/c-typeck.c:10690 cp/typeck.c:4296
  #, gcc-internal-format
  msgid "right shift count >= width of type"
  msgstr ""
  
! #: c-family/c-common.c:1614 c-family/c-common.c:1626 cp/constexpr.c:1521
  #, gcc-internal-format
  msgid "overflow in constant expression"
  msgstr ""
*************** msgstr ""
*** 21771,21782 ****
  msgid "the address of %qD will always evaluate as %<true%>"
  msgstr ""
  
! #: c-family/c-common.c:4809 cp/semantics.c:680 cp/typeck.c:8248
  #, gcc-internal-format
  msgid "suggest parentheses around assignment used as truth value"
  msgstr ""
  
! #: c-family/c-common.c:4888 c/c-decl.c:4102 c/c-typeck.c:12630
  #, gcc-internal-format
  msgid "invalid use of %<restrict%>"
  msgstr ""
--- 21859,21870 ----
  msgid "the address of %qD will always evaluate as %<true%>"
  msgstr ""
  
! #: c-family/c-common.c:4809 cp/semantics.c:680 cp/typeck.c:8267
  #, gcc-internal-format
  msgid "suggest parentheses around assignment used as truth value"
  msgstr ""
  
! #: c-family/c-common.c:4888 c/c-decl.c:4131 c/c-typeck.c:12684
  #, gcc-internal-format
  msgid "invalid use of %<restrict%>"
  msgstr ""
*************** msgstr ""
*** 22243,22265 ****
  msgid "number of components of the vector not a power of two"
  msgstr ""
  
! #: c-family/c-common.c:8924 ada/gcc-interface/utils.c:5674
  #, gcc-internal-format
  msgid "nonnull attribute without arguments on a non-prototype"
  msgstr ""
  
! #: c-family/c-common.c:8943 ada/gcc-interface/utils.c:5688
  #, gcc-internal-format, gfc-internal-format
  msgid "nonnull argument has invalid operand number (argument %lu)"
  msgstr ""
  
! #: c-family/c-common.c:8965 ada/gcc-interface/utils.c:5710
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "nonnull argument with out-of-range operand number (argument %lu, operand %lu)"
  msgstr ""
  
! #: c-family/c-common.c:8973 ada/gcc-interface/utils.c:5719
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "nonnull argument references non-pointer operand (argument %lu, operand %lu)"
--- 22331,22353 ----
  msgid "number of components of the vector not a power of two"
  msgstr ""
  
! #: c-family/c-common.c:8924 ada/gcc-interface/utils.c:5682
  #, gcc-internal-format
  msgid "nonnull attribute without arguments on a non-prototype"
  msgstr ""
  
! #: c-family/c-common.c:8943 ada/gcc-interface/utils.c:5696
  #, gcc-internal-format, gfc-internal-format
  msgid "nonnull argument has invalid operand number (argument %lu)"
  msgstr ""
  
! #: c-family/c-common.c:8965 ada/gcc-interface/utils.c:5718
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "nonnull argument with out-of-range operand number (argument %lu, operand %lu)"
  msgstr ""
  
! #: c-family/c-common.c:8973 ada/gcc-interface/utils.c:5727
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "nonnull argument references non-pointer operand (argument %lu, operand %lu)"
*************** msgstr ""
*** 22300,22311 ****
  msgid "%qE attribute only applies to variadic functions"
  msgstr ""
  
! #: c-family/c-common.c:9257 ada/gcc-interface/utils.c:5761
  #, gcc-internal-format
  msgid "requested position is not an integer constant"
  msgstr ""
  
! #: c-family/c-common.c:9265 ada/gcc-interface/utils.c:5768
  #, gcc-internal-format
  msgid "requested position is less than zero"
  msgstr ""
--- 22388,22399 ----
  msgid "%qE attribute only applies to variadic functions"
  msgstr ""
  
! #: c-family/c-common.c:9257 ada/gcc-interface/utils.c:5769
  #, gcc-internal-format
  msgid "requested position is not an integer constant"
  msgstr ""
  
! #: c-family/c-common.c:9265 ada/gcc-interface/utils.c:5776
  #, gcc-internal-format
  msgid "requested position is less than zero"
  msgstr ""
*************** msgstr ""
*** 22386,22392 ****
  msgid "cannot apply %<offsetof%> to a non constant address"
  msgstr ""
  
! #: c-family/c-common.c:10096 cp/typeck.c:5567
  #, gcc-internal-format
  msgid "attempt to take address of bit-field structure member %qD"
  msgstr ""
--- 22474,22480 ----
  msgid "cannot apply %<offsetof%> to a non constant address"
  msgstr ""
  
! #: c-family/c-common.c:10096 cp/typeck.c:5585
  #, gcc-internal-format
  msgid "attempt to take address of bit-field structure member %qD"
  msgstr ""
*************** msgstr ""
*** 22598,22604 ****
  msgid "invalid type argument of implicit conversion (have %qT)"
  msgstr ""
  
! #: c-family/c-common.c:10468 cp/init.c:2472
  #, gcc-internal-format
  msgid "size of array is too large"
  msgstr ""
--- 22686,22692 ----
  msgid "invalid type argument of implicit conversion (have %qT)"
  msgstr ""
  
! #: c-family/c-common.c:10468 cp/init.c:2490
  #, gcc-internal-format
  msgid "size of array is too large"
  msgstr ""
*************** msgstr ""
*** 22608,22614 ****
  msgid "too few arguments to function %qE"
  msgstr ""
  
! #: c-family/c-common.c:10540 config/mep/mep.c:6201 c/c-typeck.c:6368
  #, gcc-internal-format
  msgid "incompatible type for argument %d of %qE"
  msgstr ""
--- 22696,22702 ----
  msgid "too few arguments to function %qE"
  msgstr ""
  
! #: c-family/c-common.c:10540 config/mep/mep.c:6201 c/c-typeck.c:6382
  #, gcc-internal-format
  msgid "incompatible type for argument %d of %qE"
  msgstr ""
*************** msgstr ""
*** 22762,22768 ****
  msgid "division by zero"
  msgstr ""
  
! #: c-family/c-common.c:11567
  #, gcc-internal-format
  msgid "comparison between types %qT and %qT"
  msgstr ""
--- 22850,22857 ----
  msgid "division by zero"
  msgstr ""
  
! #: c-family/c-common.c:11567 c/c-typeck.c:10776 c/c-typeck.c:10932
! #: cp/typeck.c:4687
  #, gcc-internal-format
  msgid "comparison between types %qT and %qT"
  msgstr ""
*************** msgid "index value is out of bound"
*** 22808,22814 ****
  msgstr ""
  
  #: c-family/c-common.c:12214 c-family/c-common.c:12264
! #: c-family/c-common.c:12279 cp/call.c:4641 cp/call.c:4648
  #, gcc-internal-format
  msgid "conversion of scalar %qT to vector %qT involves truncation"
  msgstr ""
--- 22897,22903 ----
  msgstr ""
  
  #: c-family/c-common.c:12214 c-family/c-common.c:12264
! #: c-family/c-common.c:12279 cp/call.c:4643 cp/call.c:4650
  #, gcc-internal-format
  msgid "conversion of scalar %qT to vector %qT involves truncation"
  msgstr ""
*************** msgstr ""
*** 23266,23272 ****
  msgid "%<#pragma omp atomic capture%> uses two different variables for memory"
  msgstr ""
  
! #: c-family/c-omp.c:474 cp/semantics.c:6635
  #, gcc-internal-format
  msgid "invalid type for iteration variable %qE"
  msgstr ""
--- 23355,23361 ----
  msgid "%<#pragma omp atomic capture%> uses two different variables for memory"
  msgstr ""
  
! #: c-family/c-omp.c:474 cp/semantics.c:6640
  #, gcc-internal-format
  msgid "invalid type for iteration variable %qE"
  msgstr ""
*************** msgstr ""
*** 23276,23297 ****
  msgid "%qE is not initialized"
  msgstr ""
  
! #: c-family/c-omp.c:507 cp/semantics.c:6541
  #, gcc-internal-format
  msgid "missing controlling predicate"
  msgstr ""
  
! #: c-family/c-omp.c:592 cp/semantics.c:6285
  #, gcc-internal-format
  msgid "invalid controlling predicate"
  msgstr ""
  
! #: c-family/c-omp.c:599 cp/semantics.c:6547
  #, gcc-internal-format
  msgid "missing increment expression"
  msgstr ""
  
! #: c-family/c-omp.c:663 cp/semantics.c:6395
  #, gcc-internal-format
  msgid "invalid increment expression"
  msgstr ""
--- 23365,23386 ----
  msgid "%qE is not initialized"
  msgstr ""
  
! #: c-family/c-omp.c:507 cp/semantics.c:6546
  #, gcc-internal-format
  msgid "missing controlling predicate"
  msgstr ""
  
! #: c-family/c-omp.c:592 cp/semantics.c:6289
  #, gcc-internal-format
  msgid "invalid controlling predicate"
  msgstr ""
  
! #: c-family/c-omp.c:599 cp/semantics.c:6552
  #, gcc-internal-format
  msgid "missing increment expression"
  msgstr ""
  
! #: c-family/c-omp.c:663 cp/semantics.c:6399
  #, gcc-internal-format
  msgid "invalid increment expression"
  msgstr ""
*************** msgstr ""
*** 23793,23799 ****
  msgid "wrong type argument to %s"
  msgstr ""
  
! #: c-family/cilk.c:116 cp/parser.c:5997
  #, gcc-internal-format
  msgid "%<_Cilk_spawn%> may only be used inside a function"
  msgstr ""
--- 23882,23888 ----
  msgid "wrong type argument to %s"
  msgstr ""
  
! #: c-family/cilk.c:116 cp/parser.c:5998
  #, gcc-internal-format
  msgid "%<_Cilk_spawn%> may only be used inside a function"
  msgstr ""
*************** msgstr ""
*** 23868,23914 ****
  msgid "-mcpu=%s has invalid silicon revision"
  msgstr ""
  
! #: common/config/i386/i386-common.c:954
  #, gcc-internal-format
  msgid "-malign-loops is obsolete, use -falign-loops"
  msgstr ""
  
! #: common/config/i386/i386-common.c:956
  #, gcc-internal-format, gfc-internal-format
  msgid "-malign-loops=%d is not between 0 and %d"
  msgstr ""
  
! #: common/config/i386/i386-common.c:963
  #, gcc-internal-format
  msgid "-malign-jumps is obsolete, use -falign-jumps"
  msgstr ""
  
! #: common/config/i386/i386-common.c:965
  #, gcc-internal-format, gfc-internal-format
  msgid "-malign-jumps=%d is not between 0 and %d"
  msgstr ""
  
! #: common/config/i386/i386-common.c:973
  #, gcc-internal-format
  msgid "-malign-functions is obsolete, use -falign-functions"
  msgstr ""
  
! #: common/config/i386/i386-common.c:975
  #, gcc-internal-format, gfc-internal-format
  msgid "-malign-functions=%d is not between 0 and %d"
  msgstr ""
  
! #: common/config/i386/i386-common.c:984
  #, gcc-internal-format, gfc-internal-format
  msgid "-mbranch-cost=%d is not between 0 and 5"
  msgstr ""
  
! #: common/config/i386/i386-common.c:1035
  #, gcc-internal-format
  msgid "%<-fsplit-stack%> currently only supported on GNU/Linux"
  msgstr ""
  
! #: common/config/i386/i386-common.c:1041
  #, gcc-internal-format
  msgid "%<-fsplit-stack%> requires assembler support for CFI directives"
  msgstr ""
--- 23957,24003 ----
  msgid "-mcpu=%s has invalid silicon revision"
  msgstr ""
  
! #: common/config/i386/i386-common.c:939
  #, gcc-internal-format
  msgid "-malign-loops is obsolete, use -falign-loops"
  msgstr ""
  
! #: common/config/i386/i386-common.c:941
  #, gcc-internal-format, gfc-internal-format
  msgid "-malign-loops=%d is not between 0 and %d"
  msgstr ""
  
! #: common/config/i386/i386-common.c:948
  #, gcc-internal-format
  msgid "-malign-jumps is obsolete, use -falign-jumps"
  msgstr ""
  
! #: common/config/i386/i386-common.c:950
  #, gcc-internal-format, gfc-internal-format
  msgid "-malign-jumps=%d is not between 0 and %d"
  msgstr ""
  
! #: common/config/i386/i386-common.c:958
  #, gcc-internal-format
  msgid "-malign-functions is obsolete, use -falign-functions"
  msgstr ""
  
! #: common/config/i386/i386-common.c:960
  #, gcc-internal-format, gfc-internal-format
  msgid "-malign-functions=%d is not between 0 and %d"
  msgstr ""
  
! #: common/config/i386/i386-common.c:969
  #, gcc-internal-format, gfc-internal-format
  msgid "-mbranch-cost=%d is not between 0 and 5"
  msgstr ""
  
! #: common/config/i386/i386-common.c:1020
  #, gcc-internal-format
  msgid "%<-fsplit-stack%> currently only supported on GNU/Linux"
  msgstr ""
  
! #: common/config/i386/i386-common.c:1026
  #, gcc-internal-format
  msgid "%<-fsplit-stack%> requires assembler support for CFI directives"
  msgstr ""
*************** msgstr ""
*** 23965,23976 ****
  msgid "the RX100 cpu does not have FPU hardware"
  msgstr ""
  
! #: common/config/s390/s390-common.c:98
  #, gcc-internal-format
  msgid "stack guard value must be an exact power of 2"
  msgstr ""
  
! #: common/config/s390/s390-common.c:103
  #, gcc-internal-format
  msgid "stack size must be an exact power of 2"
  msgstr ""
--- 24054,24065 ----
  msgid "the RX100 cpu does not have FPU hardware"
  msgstr ""
  
! #: common/config/s390/s390-common.c:101
  #, gcc-internal-format
  msgid "stack guard value must be an exact power of 2"
  msgstr ""
  
! #: common/config/s390/s390-common.c:106
  #, gcc-internal-format
  msgid "stack size must be an exact power of 2"
  msgstr ""
*************** msgstr ""
*** 24051,24131 ****
  msgid "couldn%'t understand kern.osversion %q.*s"
  msgstr ""
  
! #: config/darwin.c:1698
  #, gcc-internal-format
  msgid ""
  "the use of _OBJC_-prefixed variable names to select meta-data sections is "
  "deprecated at 4.6 and will be removed in 4.7"
  msgstr ""
  
! #: config/darwin.c:1953
  #, gcc-internal-format, gfc-internal-format
  msgid "failed to open temporary file %s for LTO output"
  msgstr ""
  
! #: config/darwin.c:2042
  #, gcc-internal-format
  msgid ""
  "%qE 2.95 vtable-compatibility attribute applies only when compiling a kext"
  msgstr ""
  
! #: config/darwin.c:2049
  #, gcc-internal-format
  msgid "%qE 2.95 vtable-compatibility attribute applies only to C++ classes"
  msgstr ""
  
! #: config/darwin.c:2761
  #, gcc-internal-format
  msgid ""
  "protected visibility attribute not supported in this configuration; ignored"
  msgstr ""
  
! #: config/darwin.c:2947
  #, gcc-internal-format, gfc-internal-format
  msgid "failed to open temporary file %s with LTO output"
  msgstr ""
  
! #: config/darwin.c:3120
  #, gcc-internal-format
  msgid ""
  "%<-fobjc-abi-version%> >= 2 must be used for %<-m64%> targets with %<-fnext-"
  "runtime%>"
  msgstr ""
  
! #: config/darwin.c:3124
  #, gcc-internal-format
  msgid ""
  "%<-fobjc-abi-version%> >= 2 is not supported on %<-m32%> targets with %<-"
  "fnext-runtime%>"
  msgstr ""
  
! #: config/darwin.c:3209
  #, gcc-internal-format
  msgid ""
  "%<-mdynamic-no-pic%> overrides %<-fpic%>, %<-fPIC%>, %<-fpie%> or %<-fPIE%>"
  msgstr ""
  
! #: config/darwin.c:3397
  #, gcc-internal-format
  msgid "built-in function %qD requires the %<-mconstant-cfstrings%> flag"
  msgstr ""
  
! #: config/darwin.c:3404
  #, gcc-internal-format
  msgid "built-in function %qD takes one argument only"
  msgstr ""
  
! #: config/darwin.c:3490
  #, gcc-internal-format
  msgid "CFString literal is missing"
  msgstr ""
  
! #: config/darwin.c:3501
  #, gcc-internal-format
  msgid "CFString literal expression is not a string constant"
  msgstr ""
  
! #: config/darwin.c:3524
  #, gcc-internal-format, gfc-internal-format
  msgid "%s in CFString literal"
  msgstr ""
--- 24140,24220 ----
  msgid "couldn%'t understand kern.osversion %q.*s"
  msgstr ""
  
! #: config/darwin.c:1703
  #, gcc-internal-format
  msgid ""
  "the use of _OBJC_-prefixed variable names to select meta-data sections is "
  "deprecated at 4.6 and will be removed in 4.7"
  msgstr ""
  
! #: config/darwin.c:1958
  #, gcc-internal-format, gfc-internal-format
  msgid "failed to open temporary file %s for LTO output"
  msgstr ""
  
! #: config/darwin.c:2047
  #, gcc-internal-format
  msgid ""
  "%qE 2.95 vtable-compatibility attribute applies only when compiling a kext"
  msgstr ""
  
! #: config/darwin.c:2054
  #, gcc-internal-format
  msgid "%qE 2.95 vtable-compatibility attribute applies only to C++ classes"
  msgstr ""
  
! #: config/darwin.c:2766
  #, gcc-internal-format
  msgid ""
  "protected visibility attribute not supported in this configuration; ignored"
  msgstr ""
  
! #: config/darwin.c:2952
  #, gcc-internal-format, gfc-internal-format
  msgid "failed to open temporary file %s with LTO output"
  msgstr ""
  
! #: config/darwin.c:3125
  #, gcc-internal-format
  msgid ""
  "%<-fobjc-abi-version%> >= 2 must be used for %<-m64%> targets with %<-fnext-"
  "runtime%>"
  msgstr ""
  
! #: config/darwin.c:3129
  #, gcc-internal-format
  msgid ""
  "%<-fobjc-abi-version%> >= 2 is not supported on %<-m32%> targets with %<-"
  "fnext-runtime%>"
  msgstr ""
  
! #: config/darwin.c:3214
  #, gcc-internal-format
  msgid ""
  "%<-mdynamic-no-pic%> overrides %<-fpic%>, %<-fPIC%>, %<-fpie%> or %<-fPIE%>"
  msgstr ""
  
! #: config/darwin.c:3402
  #, gcc-internal-format
  msgid "built-in function %qD requires the %<-mconstant-cfstrings%> flag"
  msgstr ""
  
! #: config/darwin.c:3409
  #, gcc-internal-format
  msgid "built-in function %qD takes one argument only"
  msgstr ""
  
! #: config/darwin.c:3495
  #, gcc-internal-format
  msgid "CFString literal is missing"
  msgstr ""
  
! #: config/darwin.c:3506
  #, gcc-internal-format
  msgid "CFString literal expression is not a string constant"
  msgstr ""
  
! #: config/darwin.c:3529
  #, gcc-internal-format, gfc-internal-format
  msgid "%s in CFString literal"
  msgstr ""
*************** msgstr ""
*** 24205,24211 ****
  #. coalesced sections.  Weak aliases (or any other kind of aliases) are
  #. not supported.  Weak symbols that aren't visible outside the .s file
  #. are not supported.
! #: config/darwin.h:444
  #, gcc-internal-format
  msgid "alias definitions not supported in Mach-O; ignored"
  msgstr ""
--- 24294,24300 ----
  #. coalesced sections.  Weak aliases (or any other kind of aliases) are
  #. not supported.  Weak symbols that aren't visible outside the .s file
  #. are not supported.
! #: config/darwin.h:445
  #, gcc-internal-format
  msgid "alias definitions not supported in Mach-O; ignored"
  msgstr ""
*************** msgstr ""
*** 24216,24302 ****
  msgid "profiler support for VxWorks"
  msgstr ""
  
! #: config/aarch64/aarch64-builtins.c:947
  #, gcc-internal-format
  msgid "%Kargument %d must be a constant immediate"
  msgstr ""
  
! #: config/aarch64/aarch64-builtins.c:1018
  #, gcc-internal-format
  msgid "%Klane index must be a constant immediate"
  msgstr ""
  
! #: config/aarch64/aarch64-builtins.c:1021
  #, gcc-internal-format
  msgid "%Ktotal size and element size must be a non-zero constant immediate"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6643
  #, gcc-internal-format
  msgid "missing feature modifier after %qs"
  msgstr ""
  
  #. Extension not found in list.
! #: config/aarch64/aarch64.c:6665
  #, gcc-internal-format
  msgid "unknown feature modifier %qs"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6696
  #, gcc-internal-format
  msgid "missing arch name in -march=%qs"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6719 config/arm/arm.c:2660
  #, gcc-internal-format, gfc-internal-format
  msgid "switch -mcpu=%s conflicts with -march=%s switch"
  msgstr ""
  
  #. ARCH name not found in list.
! #: config/aarch64/aarch64.c:6728
  #, gcc-internal-format
  msgid "unknown value %qs for -march"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6753
  #, gcc-internal-format
  msgid "missing cpu name in -mcpu=%qs"
  msgstr ""
  
  #. CPU name not found in list.
! #: config/aarch64/aarch64.c:6776
  #, gcc-internal-format
  msgid "unknown value %qs for -mcpu"
  msgstr ""
  
  #. CPU name not found in list.
! #: config/aarch64/aarch64.c:6800
  #, gcc-internal-format
  msgid "unknown value %qs for -mtune"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6836
  #, gcc-internal-format
  msgid "Assembler does not support -mabi=ilp32"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6930
  #, gcc-internal-format
  msgid "code model %qs with -f%s"
  msgstr ""
  
! #: config/aarch64/aarch64.c:7239 config/aarch64/aarch64.c:7347
! #: config/aarch64/aarch64.c:7586
  #, gcc-internal-format
  msgid "%qs and floating point or vector arguments"
  msgstr ""
  
! #: config/aarch64/aarch64.c:8566
  #, gcc-internal-format
  msgid "%Klane %ld out of range %ld - %ld"
  msgstr ""
  
! #: config/aarch64/aarch64.c:8568
  #, gcc-internal-format, gfc-internal-format
  msgid "lane %ld out of range %ld - %ld"
  msgstr ""
--- 24305,24391 ----
  msgid "profiler support for VxWorks"
  msgstr ""
  
! #: config/aarch64/aarch64-builtins.c:949
  #, gcc-internal-format
  msgid "%Kargument %d must be a constant immediate"
  msgstr ""
  
! #: config/aarch64/aarch64-builtins.c:1020
  #, gcc-internal-format
  msgid "%Klane index must be a constant immediate"
  msgstr ""
  
! #: config/aarch64/aarch64-builtins.c:1023
  #, gcc-internal-format
  msgid "%Ktotal size and element size must be a non-zero constant immediate"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6680
  #, gcc-internal-format
  msgid "missing feature modifier after %qs"
  msgstr ""
  
  #. Extension not found in list.
! #: config/aarch64/aarch64.c:6702
  #, gcc-internal-format
  msgid "unknown feature modifier %qs"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6733
  #, gcc-internal-format
  msgid "missing arch name in -march=%qs"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6756 config/arm/arm.c:2660
  #, gcc-internal-format, gfc-internal-format
  msgid "switch -mcpu=%s conflicts with -march=%s switch"
  msgstr ""
  
  #. ARCH name not found in list.
! #: config/aarch64/aarch64.c:6765
  #, gcc-internal-format
  msgid "unknown value %qs for -march"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6790
  #, gcc-internal-format
  msgid "missing cpu name in -mcpu=%qs"
  msgstr ""
  
  #. CPU name not found in list.
! #: config/aarch64/aarch64.c:6813
  #, gcc-internal-format
  msgid "unknown value %qs for -mcpu"
  msgstr ""
  
  #. CPU name not found in list.
! #: config/aarch64/aarch64.c:6837
  #, gcc-internal-format
  msgid "unknown value %qs for -mtune"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6873
  #, gcc-internal-format
  msgid "Assembler does not support -mabi=ilp32"
  msgstr ""
  
! #: config/aarch64/aarch64.c:6983
  #, gcc-internal-format
  msgid "code model %qs with -f%s"
  msgstr ""
  
! #: config/aarch64/aarch64.c:7292 config/aarch64/aarch64.c:7400
! #: config/aarch64/aarch64.c:7639
  #, gcc-internal-format
  msgid "%qs and floating point or vector arguments"
  msgstr ""
  
! #: config/aarch64/aarch64.c:8619
  #, gcc-internal-format
  msgid "%Klane %ld out of range %ld - %ld"
  msgstr ""
  
! #: config/aarch64/aarch64.c:8621
  #, gcc-internal-format, gfc-internal-format
  msgid "lane %ld out of range %ld - %ld"
  msgstr ""
*************** msgstr ""
*** 24356,24363 ****
  msgid "bad value %qs for -mmemory-latency"
  msgstr ""
  
! #: config/alpha/alpha.c:6732 config/alpha/alpha.c:6735
! #: config/s390/s390.c:10100 config/s390/s390.c:10103
  #: config/tilegx/tilegx.c:3579 config/tilepro/tilepro.c:3147
  #, gcc-internal-format
  msgid "bad builtin fcode"
--- 24445,24451 ----
  msgid "bad value %qs for -mmemory-latency"
  msgstr ""
  
! #: config/alpha/alpha.c:6732 config/alpha/alpha.c:6735 config/s390/s390.c:827
  #: config/tilegx/tilegx.c:3579 config/tilepro/tilepro.c:3147
  #, gcc-internal-format
  msgid "bad builtin fcode"
*************** msgid "incompatible type for argument %d
*** 24522,24720 ****
  msgstr ""
  
  #. @@@ better error message
! #: config/arm/arm-builtins.c:2300 config/arm/arm-builtins.c:2404
  #, gcc-internal-format
  msgid "selector must be an immediate"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2308 config/arm/arm-builtins.c:2353
! #: config/arm/arm-builtins.c:2411 config/arm/arm-builtins.c:2420
  #, gcc-internal-format
  msgid "the range of selector should be in 0 to 7"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2313 config/arm/arm-builtins.c:2422
  #, gcc-internal-format
  msgid "the range of selector should be in 0 to 3"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2318 config/arm/arm-builtins.c:2424
  #, gcc-internal-format
  msgid "the range of selector should be in 0 to 1"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2490
  #, gcc-internal-format
  msgid "mask must be an immediate"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2495
  #, gcc-internal-format
  msgid "the range of mask should be in 0 to 255"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2683
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 32.  please check the intrinsic "
  "_mm_rori_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2685
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 32.  please check the intrinsic "
  "_mm_rori_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2687
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 32.  please check the intrinsic "
  "_mm_ror_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2689
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 32.  please check the intrinsic "
  "_mm_ror_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2695
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 64.  please check the intrinsic "
  "_mm_rori_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2697
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 64.  please check the intrinsic "
  "_mm_ror_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2702
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srli_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2704
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srli_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2706
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srli_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2708
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_slli_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2710
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_slli_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2712
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_slli_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2714
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srai_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2716
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srai_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2718
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srai_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2720
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_srl_pi16 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2722
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_srl_pi32 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2724
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_srl_si64 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2726
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sll_pi16 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2728
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sll_pi32 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2730
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sll_si64 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2732
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sra_pi16 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2734
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sra_pi32 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2736
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sra_si64 "
--- 24610,24808 ----
  msgstr ""
  
  #. @@@ better error message
! #: config/arm/arm-builtins.c:2301 config/arm/arm-builtins.c:2405
  #, gcc-internal-format
  msgid "selector must be an immediate"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2309 config/arm/arm-builtins.c:2354
! #: config/arm/arm-builtins.c:2412 config/arm/arm-builtins.c:2421
  #, gcc-internal-format
  msgid "the range of selector should be in 0 to 7"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2314 config/arm/arm-builtins.c:2423
  #, gcc-internal-format
  msgid "the range of selector should be in 0 to 3"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2319 config/arm/arm-builtins.c:2425
  #, gcc-internal-format
  msgid "the range of selector should be in 0 to 1"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2491
  #, gcc-internal-format
  msgid "mask must be an immediate"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2496
  #, gcc-internal-format
  msgid "the range of mask should be in 0 to 255"
  msgstr ""
  
! #: config/arm/arm-builtins.c:2684
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 32.  please check the intrinsic "
  "_mm_rori_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2686
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 32.  please check the intrinsic "
  "_mm_rori_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2688
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 32.  please check the intrinsic "
  "_mm_ror_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2690
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 32.  please check the intrinsic "
  "_mm_ror_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2696
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 64.  please check the intrinsic "
  "_mm_rori_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2698
  #, gcc-internal-format
  msgid ""
  "the range of count should be in 0 to 64.  please check the intrinsic "
  "_mm_ror_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2703
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srli_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2705
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srli_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2707
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srli_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2709
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_slli_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2711
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_slli_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2713
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_slli_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2715
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srai_pi16 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2717
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srai_pi32 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2719
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic "
  "_mm_srai_si64 in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2721
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_srl_pi16 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2723
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_srl_pi32 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2725
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_srl_si64 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2727
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sll_pi16 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2729
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sll_pi32 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2731
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sll_si64 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2733
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sra_pi16 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2735
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sra_pi32 "
  "in code."
  msgstr ""
  
! #: config/arm/arm-builtins.c:2737
  #, gcc-internal-format
  msgid ""
  "the count should be no less than 0.  please check the intrinsic _mm_sra_si64 "
*************** msgstr ""
*** 24884,24921 ****
  msgid "Thumb-1 hard-float VFP ABI"
  msgstr ""
  
! #: config/arm/arm.c:6218 config/arm/arm.c:6236 config/avr/avr.c:8995
! #: config/avr/avr.c:9011 config/bfin/bfin.c:4699 config/bfin/bfin.c:4760
  #: config/bfin/bfin.c:4789 config/epiphany/epiphany.c:507
! #: config/h8300/h8300.c:5472 config/i386/i386.c:5563 config/i386/i386.c:42850
! #: config/i386/i386.c:42900 config/i386/i386.c:42970 config/m68k/m68k.c:764
! #: config/mcore/mcore.c:3079 config/mep/mep.c:3929 config/mep/mep.c:3943
! #: config/mep/mep.c:4017 config/msp430/msp430.c:1312 config/nvptx/nvptx.c:2001
! #: config/rl78/rl78.c:734 config/rs6000/rs6000.c:29016 config/rx/rx.c:2696
! #: config/rx/rx.c:2722 config/s390/s390.c:480 config/sh/sh.c:9697
! #: config/sh/sh.c:9715 config/sh/sh.c:9744 config/sh/sh.c:9826
! #: config/sh/sh.c:9849 config/spu/spu.c:3732 config/stormy16/stormy16.c:2251
  #: config/v850/v850.c:2117 config/visium/visium.c:653
  #, gcc-internal-format
  msgid "%qE attribute only applies to functions"
  msgstr ""
  
! #: config/arm/arm.c:23326
  #, gcc-internal-format
  msgid "unable to compute real location of stacked parameter"
  msgstr ""
  
! #: config/arm/arm.c:23944
  #, gcc-internal-format
  msgid "Unexpected thumb1 far jump"
  msgstr ""
  
! #: config/arm/arm.c:24211
  #, gcc-internal-format
  msgid "no low registers available for popping high registers"
  msgstr ""
  
! #: config/arm/arm.c:24436
  #, gcc-internal-format
  msgid "interrupt Service Routines cannot be coded in Thumb mode"
  msgstr ""
--- 24972,25010 ----
  msgid "Thumb-1 hard-float VFP ABI"
  msgstr ""
  
! #: config/arm/arm.c:6233 config/arm/arm.c:6251 config/avr/avr.c:9031
! #: config/avr/avr.c:9047 config/bfin/bfin.c:4699 config/bfin/bfin.c:4760
  #: config/bfin/bfin.c:4789 config/epiphany/epiphany.c:507
! #: config/h8300/h8300.c:5472 config/i386/i386.c:5579 config/i386/i386.c:10740
! #: config/i386/i386.c:42951 config/i386/i386.c:43001 config/i386/i386.c:43071
! #: config/m68k/m68k.c:764 config/mcore/mcore.c:3079 config/mep/mep.c:3929
! #: config/mep/mep.c:3943 config/mep/mep.c:4017 config/msp430/msp430.c:1312
! #: config/nvptx/nvptx.c:2001 config/rl78/rl78.c:734
! #: config/rs6000/rs6000.c:29071 config/rx/rx.c:2696 config/rx/rx.c:2722
! #: config/s390/s390.c:1029 config/sh/sh.c:9723 config/sh/sh.c:9741
! #: config/sh/sh.c:9770 config/sh/sh.c:9852 config/sh/sh.c:9875
! #: config/spu/spu.c:3732 config/stormy16/stormy16.c:2251
  #: config/v850/v850.c:2117 config/visium/visium.c:653
  #, gcc-internal-format
  msgid "%qE attribute only applies to functions"
  msgstr ""
  
! #: config/arm/arm.c:23359
  #, gcc-internal-format
  msgid "unable to compute real location of stacked parameter"
  msgstr ""
  
! #: config/arm/arm.c:23977
  #, gcc-internal-format
  msgid "Unexpected thumb1 far jump"
  msgstr ""
  
! #: config/arm/arm.c:24244
  #, gcc-internal-format
  msgid "no low registers available for popping high registers"
  msgstr ""
  
! #: config/arm/arm.c:24474
  #, gcc-internal-format
  msgid "interrupt Service Routines cannot be coded in Thumb mode"
  msgstr ""
*************** msgstr ""
*** 25039,25167 ****
  msgid "accessing program memory with data memory address"
  msgstr ""
  
! #: config/avr/avr.c:2857
  #, gcc-internal-format, gfc-internal-format
  msgid "fixed register %s used to pass parameter to function"
  msgstr ""
  
! #: config/avr/avr.c:3128
  #, gcc-internal-format
  msgid "writing to address space %qs not supported"
  msgstr ""
  
! #: config/avr/avr.c:9028 config/bfin/bfin.c:4821 config/i386/winnt.c:97
  #: config/mep/mep.c:3833 config/mep/mep.c:3971
  #, gcc-internal-format
  msgid "%qE attribute only applies to variables"
  msgstr ""
  
! #: config/avr/avr.c:9039 config/mep/mep.c:3981
  #, gcc-internal-format
  msgid "%qE attribute allows only an integer constant argument"
  msgstr ""
  
! #: config/avr/avr.c:9049
  #, gcc-internal-format
  msgid "%qE attribute address out of range"
  msgstr ""
  
! #: config/avr/avr.c:9062
  #, gcc-internal-format
  msgid "both %s and %qE attribute provide address"
  msgstr ""
  
! #: config/avr/avr.c:9072
  #, gcc-internal-format
  msgid "%qE attribute on non-volatile variable"
  msgstr ""
  
! #: config/avr/avr.c:9274
  #, gcc-internal-format
  msgid "%qT uses address space %qs beyond flash of %d KiB"
  msgstr ""
  
! #: config/avr/avr.c:9277
  #, gcc-internal-format
  msgid "%s %q+D uses address space %qs beyond flash of %d KiB"
  msgstr ""
  
! #: config/avr/avr.c:9283
  #, gcc-internal-format
  msgid "pointer targeting address space %qs must be const in %qT"
  msgstr ""
  
! #: config/avr/avr.c:9286
  #, gcc-internal-format
  msgid "pointer targeting address space %qs must be const in %s %q+D"
  msgstr ""
  
! #: config/avr/avr.c:9324
  #, gcc-internal-format
  msgid "variable %q+D located in address space %qs beyond flash of %d KiB"
  msgstr ""
  
! #: config/avr/avr.c:9329
  #, gcc-internal-format
  msgid ""
  "variable %q+D located in address space %qs which is not supported for "
  "architecture %qs"
  msgstr ""
  
! #: config/avr/avr.c:9345
  #, gcc-internal-format
  msgid ""
  "variable %q+D must be const in order to be put into read-only section by "
  "means of %qs"
  msgstr ""
  
! #: config/avr/avr.c:9385
  #, gcc-internal-format
  msgid "static IO declaration for %q+D needs an address"
  msgstr ""
  
! #: config/avr/avr.c:9417
  #, gcc-internal-format
  msgid "IO definition for %q+D needs an address"
  msgstr ""
  
! #: config/avr/avr.c:9601
  #, gcc-internal-format
  msgid "only uninitialized variables can be placed in the .noinit section"
  msgstr ""
  
! #: config/avr/avr.c:9642
  #, gcc-internal-format
  msgid "uninitialized variable %q+D put into program memory area"
  msgstr ""
  
! #: config/avr/avr.c:9752
  #, gcc-internal-format
  msgid "architecture %qs supported for assembler only"
  msgstr ""
  
! #: config/avr/avr.c:12265
  #, gcc-internal-format
  msgid "conversion from address space %qs to address space %qs"
  msgstr ""
  
! #: config/avr/avr.c:13321
  #, gcc-internal-format, gfc-internal-format
  msgid "%s expects a compile time integer constant"
  msgstr ""
  
! #: config/avr/avr.c:13335
  #, gcc-internal-format, gfc-internal-format
  msgid "%s expects a compile time long integer constant as first argument"
  msgstr ""
  
! #: config/avr/avr.c:13363
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "rounding to %d bits has no effect for fixed-point value with %d fractional "
  "bits"
  msgstr ""
  
! #: config/avr/avr.c:13372
  #, gcc-internal-format
  msgid "rounding result will always be 0"
  msgstr ""
--- 25128,25256 ----
  msgid "accessing program memory with data memory address"
  msgstr ""
  
! #: config/avr/avr.c:2893
  #, gcc-internal-format, gfc-internal-format
  msgid "fixed register %s used to pass parameter to function"
  msgstr ""
  
! #: config/avr/avr.c:3164
  #, gcc-internal-format
  msgid "writing to address space %qs not supported"
  msgstr ""
  
! #: config/avr/avr.c:9064 config/bfin/bfin.c:4821 config/i386/winnt.c:97
  #: config/mep/mep.c:3833 config/mep/mep.c:3971
  #, gcc-internal-format
  msgid "%qE attribute only applies to variables"
  msgstr ""
  
! #: config/avr/avr.c:9075 config/mep/mep.c:3981
  #, gcc-internal-format
  msgid "%qE attribute allows only an integer constant argument"
  msgstr ""
  
! #: config/avr/avr.c:9085
  #, gcc-internal-format
  msgid "%qE attribute address out of range"
  msgstr ""
  
! #: config/avr/avr.c:9098
  #, gcc-internal-format
  msgid "both %s and %qE attribute provide address"
  msgstr ""
  
! #: config/avr/avr.c:9108
  #, gcc-internal-format
  msgid "%qE attribute on non-volatile variable"
  msgstr ""
  
! #: config/avr/avr.c:9312
  #, gcc-internal-format
  msgid "%qT uses address space %qs beyond flash of %d KiB"
  msgstr ""
  
! #: config/avr/avr.c:9315
  #, gcc-internal-format
  msgid "%s %q+D uses address space %qs beyond flash of %d KiB"
  msgstr ""
  
! #: config/avr/avr.c:9321
  #, gcc-internal-format
  msgid "pointer targeting address space %qs must be const in %qT"
  msgstr ""
  
! #: config/avr/avr.c:9324
  #, gcc-internal-format
  msgid "pointer targeting address space %qs must be const in %s %q+D"
  msgstr ""
  
! #: config/avr/avr.c:9362
  #, gcc-internal-format
  msgid "variable %q+D located in address space %qs beyond flash of %d KiB"
  msgstr ""
  
! #: config/avr/avr.c:9367
  #, gcc-internal-format
  msgid ""
  "variable %q+D located in address space %qs which is not supported for "
  "architecture %qs"
  msgstr ""
  
! #: config/avr/avr.c:9383
  #, gcc-internal-format
  msgid ""
  "variable %q+D must be const in order to be put into read-only section by "
  "means of %qs"
  msgstr ""
  
! #: config/avr/avr.c:9423
  #, gcc-internal-format
  msgid "static IO declaration for %q+D needs an address"
  msgstr ""
  
! #: config/avr/avr.c:9455
  #, gcc-internal-format
  msgid "IO definition for %q+D needs an address"
  msgstr ""
  
! #: config/avr/avr.c:9639
  #, gcc-internal-format
  msgid "only uninitialized variables can be placed in the .noinit section"
  msgstr ""
  
! #: config/avr/avr.c:9680
  #, gcc-internal-format
  msgid "uninitialized variable %q+D put into program memory area"
  msgstr ""
  
! #: config/avr/avr.c:9790
  #, gcc-internal-format
  msgid "architecture %qs supported for assembler only"
  msgstr ""
  
! #: config/avr/avr.c:12307
  #, gcc-internal-format
  msgid "conversion from address space %qs to address space %qs"
  msgstr ""
  
! #: config/avr/avr.c:13363
  #, gcc-internal-format, gfc-internal-format
  msgid "%s expects a compile time integer constant"
  msgstr ""
  
! #: config/avr/avr.c:13377
  #, gcc-internal-format, gfc-internal-format
  msgid "%s expects a compile time long integer constant as first argument"
  msgstr ""
  
! #: config/avr/avr.c:13405
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "rounding to %d bits has no effect for fixed-point value with %d fractional "
  "bits"
  msgstr ""
  
! #: config/avr/avr.c:13414
  #, gcc-internal-format
  msgid "rounding result will always be 0"
  msgstr ""
*************** msgstr ""
*** 25587,25593 ****
  msgid "Unknown parameter to option -mtune-ctrl: %s"
  msgstr ""
  
! #: config/i386/i386.c:3467
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "%stune=x86-64%s is deprecated; use %stune=k8%s or %stune=generic%s instead "
--- 25676,25682 ----
  msgid "Unknown parameter to option -mtune-ctrl: %s"
  msgstr ""
  
! #: config/i386/i386.c:3466
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "%stune=x86-64%s is deprecated; use %stune=k8%s or %stune=generic%s instead "
*************** msgid ""
*** 25595,25942 ****
  msgstr ""
  
  #. rep; movq isn't available in 32-bit code.
! #: config/i386/i386.c:3494
  #, gcc-internal-format
  msgid "-mstringop-strategy=rep_8byte not supported for 32-bit code"
  msgstr ""
  
! #: config/i386/i386.c:3511
  #, gcc-internal-format
  msgid "address mode %qs not supported in the %s bit mode"
  msgstr ""
  
! #: config/i386/i386.c:3537 config/i386/i386.c:3546 config/i386/i386.c:3558
! #: config/i386/i386.c:3569 config/i386/i386.c:3580
  #, gcc-internal-format
  msgid "code model %qs not supported in the %s bit mode"
  msgstr ""
  
! #: config/i386/i386.c:3549 config/i386/i386.c:3561
  #, gcc-internal-format
  msgid "code model %qs not supported in x32 mode"
  msgstr ""
  
! #: config/i386/i386.c:3567 config/i386/i386.c:3576 config/i386/i386.c:4619
  #, gcc-internal-format, gfc-internal-format
  msgid "code model %s does not support PIC mode"
  msgstr ""
  
! #: config/i386/i386.c:3604
  #, gcc-internal-format
  msgid "-masm=intel not supported in this configuration"
  msgstr ""
  
! #: config/i386/i386.c:3609
  #, gcc-internal-format, gfc-internal-format
  msgid "%i-bit mode not compiled in"
  msgstr ""
  
! #: config/i386/i386.c:3622 config/i386/i386.c:3840
  #, gcc-internal-format
  msgid "CPU you selected does not support x86-64 instruction set"
  msgstr ""
  
! #: config/i386/i386.c:3801 config/i386/i386.c:3804
  #, gcc-internal-format
  msgid "Intel MPX does not support x32"
  msgstr ""
  
! #: config/i386/i386.c:3807
  #, gcc-internal-format, gfc-internal-format
  msgid "generic CPU can be used only for %stune=%s %s"
  msgstr ""
  
! #: config/i386/i386.c:3810
  #, gcc-internal-format, gfc-internal-format
  msgid "intel CPU can be used only for %stune=%s %s"
  msgstr ""
  
! #: config/i386/i386.c:3813
  #, gcc-internal-format, gfc-internal-format
  msgid "bad value (%s) for %sarch=%s %s"
  msgstr ""
  
! #: config/i386/i386.c:3856
  #, gcc-internal-format, gfc-internal-format
  msgid "bad value (%s) for %stune=%s %s"
  msgstr ""
  
! #: config/i386/i386.c:3911
  #, gcc-internal-format
  msgid "-mregparm is ignored in 64-bit mode"
  msgstr ""
  
! #: config/i386/i386.c:3914
  #, gcc-internal-format, gfc-internal-format
  msgid "-mregparm=%d is not between 0 and %d"
  msgstr ""
  
! #: config/i386/i386.c:3957
  #, gcc-internal-format, gfc-internal-format
  msgid "%srtd%s is ignored in 64bit mode"
  msgstr ""
  
! #: config/i386/i386.c:4035
  #, gcc-internal-format
  msgid "-mpreferred-stack-boundary is not supported for this target"
  msgstr ""
  
! #: config/i386/i386.c:4038
  #, gcc-internal-format, gfc-internal-format
  msgid "-mpreferred-stack-boundary=%d is not between %d and %d"
  msgstr ""
  
! #: config/i386/i386.c:4060
  #, gcc-internal-format, gfc-internal-format
  msgid "-mincoming-stack-boundary=%d is not between %d and 12"
  msgstr ""
  
! #: config/i386/i386.c:4074
  #, gcc-internal-format
  msgid "-mnop-mcount is not compatible with this target"
  msgstr ""
  
! #: config/i386/i386.c:4077
  #, gcc-internal-format
  msgid "-mnop-mcount is not implemented for -fPIC"
  msgstr ""
  
! #: config/i386/i386.c:4082
  #, gcc-internal-format, gfc-internal-format
  msgid "%ssseregparm%s used without SSE enabled"
  msgstr ""
  
! #: config/i386/i386.c:4090
  #, gcc-internal-format
  msgid "SSE instruction set disabled, using 387 arithmetics"
  msgstr ""
  
! #: config/i386/i386.c:4096
  #, gcc-internal-format
  msgid "387 instruction set disabled, using SSE arithmetics"
  msgstr ""
  
! #: config/i386/i386.c:4148
  #, gcc-internal-format, gfc-internal-format
  msgid "stack probing requires %saccumulate-outgoing-args%s for correctness"
  msgstr ""
  
! #: config/i386/i386.c:4251
  #, gcc-internal-format
  msgid "-mfentry isn%'t supported for 32-bit in combination with -fpic"
  msgstr ""
  
! #: config/i386/i386.c:4258
  #, gcc-internal-format
  msgid "-mno-fentry isn%'t compatible with SEH"
  msgstr ""
  
! #: config/i386/i386.c:4315 config/rs6000/rs6000.c:4240
  #, gcc-internal-format, gfc-internal-format
  msgid "unknown option for -mrecip=%s"
  msgstr ""
  
! #: config/i386/i386.c:4821
  #, gcc-internal-format
  msgid "attribute %<target%> argument not a string"
  msgstr ""
  
! #: config/i386/i386.c:4887 config/i386/i386.c:4934
  #, gcc-internal-format, gfc-internal-format
  msgid "attribute(target(\"%s\")) is unknown"
  msgstr ""
  
! #: config/i386/i386.c:4915
  #, gcc-internal-format, gfc-internal-format
  msgid "option(\"%s\") was already specified"
  msgstr ""
  
! #: config/i386/i386.c:5576 config/i386/i386.c:5627
  #, gcc-internal-format
  msgid "fastcall and regparm attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5581
  #, gcc-internal-format
  msgid "regparam and thiscall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5588 config/i386/i386.c:42870
  #, gcc-internal-format
  msgid "%qE attribute requires an integer constant argument"
  msgstr ""
  
! #: config/i386/i386.c:5594
  #, gcc-internal-format
  msgid "argument to %qE attribute larger than %d"
  msgstr ""
  
! #: config/i386/i386.c:5619 config/i386/i386.c:5662
  #, gcc-internal-format
  msgid "fastcall and cdecl attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5623
  #, gcc-internal-format
  msgid "fastcall and stdcall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5631 config/i386/i386.c:5680
  #, gcc-internal-format
  msgid "fastcall and thiscall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5641 config/i386/i386.c:5658
  #, gcc-internal-format
  msgid "stdcall and cdecl attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5645
  #, gcc-internal-format
  msgid "stdcall and fastcall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5649 config/i386/i386.c:5676
  #, gcc-internal-format
  msgid "stdcall and thiscall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5666 config/i386/i386.c:5684
  #, gcc-internal-format
  msgid "cdecl and thiscall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5672
  #, gcc-internal-format
  msgid "%qE attribute is used for non-class method"
  msgstr ""
  
! #: config/i386/i386.c:5910
  #, gcc-internal-format
  msgid "calling %qD with attribute sseregparm without SSE/SSE2 enabled"
  msgstr ""
  
! #: config/i386/i386.c:5913
  #, gcc-internal-format
  msgid "calling %qT with attribute sseregparm without SSE/SSE2 enabled"
  msgstr ""
  
! #: config/i386/i386.c:6235
  #, gcc-internal-format
  msgid "X32 does not support ms_abi attribute"
  msgstr ""
  
! #: config/i386/i386.c:6264
  #, gcc-internal-format
  msgid "ms_hook_prologue is not compatible with nested function"
  msgstr ""
  
! #: config/i386/i386.c:6599
  #, gcc-internal-format
  msgid "AVX512F vector argument without AVX512F enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6605
  #, gcc-internal-format
  msgid "AVX512F vector return without AVX512F enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6619
  #, gcc-internal-format
  msgid "AVX vector argument without AVX enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6625
  #, gcc-internal-format
  msgid "AVX vector return without AVX enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6640
  #, gcc-internal-format
  msgid "SSE vector argument without SSE enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6646
  #, gcc-internal-format
  msgid "SSE vector return without SSE enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6658
  #, gcc-internal-format
  msgid "MMX vector argument without MMX enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6664
  #, gcc-internal-format
  msgid "MMX vector return without MMX enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6847
  #, gcc-internal-format
  msgid ""
  "the ABI of passing struct with a flexible array member has changed in GCC 4.4"
  msgstr ""
  
! #: config/i386/i386.c:6964
  #, gcc-internal-format
  msgid "the ABI of passing union with long double has changed in GCC 4.4"
  msgstr ""
  
! #: config/i386/i386.c:7082
  #, gcc-internal-format
  msgid ""
  "the ABI of passing structure with complex float member has changed in GCC 4.4"
  msgstr ""
  
! #: config/i386/i386.c:7245
  #, gcc-internal-format
  msgid "SSE register return with SSE disabled"
  msgstr ""
  
! #: config/i386/i386.c:7251
  #, gcc-internal-format
  msgid "SSE register argument with SSE disabled"
  msgstr ""
  
! #: config/i386/i386.c:7267
  #, gcc-internal-format
  msgid "x87 register return with x87 disabled"
  msgstr ""
  
! #: config/i386/i386.c:7551 config/i386/i386.c:7801
  #, gcc-internal-format
  msgid "calling %qD with SSE calling convention without SSE/SSE2 enabled"
  msgstr ""
  
! #: config/i386/i386.c:7553 config/i386/i386.c:7803 config/i386/i386.c:8289
  #, gcc-internal-format
  msgid ""
  "this is a GCC bug that can be worked around by adding attribute used to "
  "function called"
  msgstr ""
  
! #: config/i386/i386.c:8190
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The ABI for passing parameters with %d-byte alignment has changed in GCC 4.6"
  msgstr ""
  
! #: config/i386/i386.c:8287
  #, gcc-internal-format
  msgid "calling %qD with SSE caling convention without SSE/SSE2 enabled"
  msgstr ""
  
! #: config/i386/i386.c:11378
  #, gcc-internal-format
  msgid "ms_hook_prologue attribute isn%'t compatible with -mfentry for 32-bit"
  msgstr ""
  
! #: config/i386/i386.c:12416
  #, gcc-internal-format
  msgid "-fsplit-stack does not support fastcall with nested function"
  msgstr ""
  
! #: config/i386/i386.c:12436
  #, gcc-internal-format
  msgid ""
  "-fsplit-stack does not support 2 register parameters for a nested function"
--- 25684,26036 ----
  msgstr ""
  
  #. rep; movq isn't available in 32-bit code.
! #: config/i386/i386.c:3493
  #, gcc-internal-format
  msgid "-mstringop-strategy=rep_8byte not supported for 32-bit code"
  msgstr ""
  
! #: config/i386/i386.c:3510
  #, gcc-internal-format
  msgid "address mode %qs not supported in the %s bit mode"
  msgstr ""
  
! #: config/i386/i386.c:3536 config/i386/i386.c:3545 config/i386/i386.c:3557
! #: config/i386/i386.c:3568 config/i386/i386.c:3579
  #, gcc-internal-format
  msgid "code model %qs not supported in the %s bit mode"
  msgstr ""
  
! #: config/i386/i386.c:3548 config/i386/i386.c:3560
  #, gcc-internal-format
  msgid "code model %qs not supported in x32 mode"
  msgstr ""
  
! #: config/i386/i386.c:3566 config/i386/i386.c:3575 config/i386/i386.c:4626
  #, gcc-internal-format, gfc-internal-format
  msgid "code model %s does not support PIC mode"
  msgstr ""
  
! #: config/i386/i386.c:3603
  #, gcc-internal-format
  msgid "-masm=intel not supported in this configuration"
  msgstr ""
  
! #: config/i386/i386.c:3608
  #, gcc-internal-format, gfc-internal-format
  msgid "%i-bit mode not compiled in"
  msgstr ""
  
! #: config/i386/i386.c:3621 config/i386/i386.c:3836
  #, gcc-internal-format
  msgid "CPU you selected does not support x86-64 instruction set"
  msgstr ""
  
! #: config/i386/i386.c:3797 config/i386/i386.c:3800
  #, gcc-internal-format
  msgid "Intel MPX does not support x32"
  msgstr ""
  
! #: config/i386/i386.c:3803
  #, gcc-internal-format, gfc-internal-format
  msgid "generic CPU can be used only for %stune=%s %s"
  msgstr ""
  
! #: config/i386/i386.c:3806
  #, gcc-internal-format, gfc-internal-format
  msgid "intel CPU can be used only for %stune=%s %s"
  msgstr ""
  
! #: config/i386/i386.c:3809
  #, gcc-internal-format, gfc-internal-format
  msgid "bad value (%s) for %sarch=%s %s"
  msgstr ""
  
! #: config/i386/i386.c:3852
  #, gcc-internal-format, gfc-internal-format
  msgid "bad value (%s) for %stune=%s %s"
  msgstr ""
  
! #: config/i386/i386.c:3907
  #, gcc-internal-format
  msgid "-mregparm is ignored in 64-bit mode"
  msgstr ""
  
! #: config/i386/i386.c:3910
  #, gcc-internal-format, gfc-internal-format
  msgid "-mregparm=%d is not between 0 and %d"
  msgstr ""
  
! #: config/i386/i386.c:3953
  #, gcc-internal-format, gfc-internal-format
  msgid "%srtd%s is ignored in 64bit mode"
  msgstr ""
  
! #: config/i386/i386.c:4031
  #, gcc-internal-format
  msgid "-mpreferred-stack-boundary is not supported for this target"
  msgstr ""
  
! #: config/i386/i386.c:4034
  #, gcc-internal-format, gfc-internal-format
  msgid "-mpreferred-stack-boundary=%d is not between %d and %d"
  msgstr ""
  
! #: config/i386/i386.c:4056
  #, gcc-internal-format, gfc-internal-format
  msgid "-mincoming-stack-boundary=%d is not between %d and 12"
  msgstr ""
  
! #: config/i386/i386.c:4070
  #, gcc-internal-format
  msgid "-mnop-mcount is not compatible with this target"
  msgstr ""
  
! #: config/i386/i386.c:4073
  #, gcc-internal-format
  msgid "-mnop-mcount is not implemented for -fPIC"
  msgstr ""
  
! #: config/i386/i386.c:4078
  #, gcc-internal-format, gfc-internal-format
  msgid "%ssseregparm%s used without SSE enabled"
  msgstr ""
  
! #: config/i386/i386.c:4086
  #, gcc-internal-format
  msgid "SSE instruction set disabled, using 387 arithmetics"
  msgstr ""
  
! #: config/i386/i386.c:4092
  #, gcc-internal-format
  msgid "387 instruction set disabled, using SSE arithmetics"
  msgstr ""
  
! #: config/i386/i386.c:4144
  #, gcc-internal-format, gfc-internal-format
  msgid "stack probing requires %saccumulate-outgoing-args%s for correctness"
  msgstr ""
  
! #: config/i386/i386.c:4155
! #, gcc-internal-format, gfc-internal-format
! msgid "fixed ebp register requires %saccumulate-outgoing-args%s"
! msgstr ""
! 
! #: config/i386/i386.c:4258
  #, gcc-internal-format
  msgid "-mfentry isn%'t supported for 32-bit in combination with -fpic"
  msgstr ""
  
! #: config/i386/i386.c:4265
  #, gcc-internal-format
  msgid "-mno-fentry isn%'t compatible with SEH"
  msgstr ""
  
! #: config/i386/i386.c:4322 config/rs6000/rs6000.c:4280
  #, gcc-internal-format, gfc-internal-format
  msgid "unknown option for -mrecip=%s"
  msgstr ""
  
! #: config/i386/i386.c:4827
  #, gcc-internal-format
  msgid "attribute %<target%> argument not a string"
  msgstr ""
  
! #: config/i386/i386.c:4893 config/i386/i386.c:4940
  #, gcc-internal-format, gfc-internal-format
  msgid "attribute(target(\"%s\")) is unknown"
  msgstr ""
  
! #: config/i386/i386.c:4921
  #, gcc-internal-format, gfc-internal-format
  msgid "option(\"%s\") was already specified"
  msgstr ""
  
! #: config/i386/i386.c:5592 config/i386/i386.c:5643
  #, gcc-internal-format
  msgid "fastcall and regparm attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5597
  #, gcc-internal-format
  msgid "regparam and thiscall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5604 config/i386/i386.c:42971
  #, gcc-internal-format
  msgid "%qE attribute requires an integer constant argument"
  msgstr ""
  
! #: config/i386/i386.c:5610
  #, gcc-internal-format
  msgid "argument to %qE attribute larger than %d"
  msgstr ""
  
! #: config/i386/i386.c:5635 config/i386/i386.c:5678
  #, gcc-internal-format
  msgid "fastcall and cdecl attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5639
  #, gcc-internal-format
  msgid "fastcall and stdcall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5647 config/i386/i386.c:5696
  #, gcc-internal-format
  msgid "fastcall and thiscall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5657 config/i386/i386.c:5674
  #, gcc-internal-format
  msgid "stdcall and cdecl attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5661
  #, gcc-internal-format
  msgid "stdcall and fastcall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5665 config/i386/i386.c:5692
  #, gcc-internal-format
  msgid "stdcall and thiscall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5682 config/i386/i386.c:5700
  #, gcc-internal-format
  msgid "cdecl and thiscall attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:5688
  #, gcc-internal-format
  msgid "%qE attribute is used for non-class method"
  msgstr ""
  
! #: config/i386/i386.c:5926
  #, gcc-internal-format
  msgid "calling %qD with attribute sseregparm without SSE/SSE2 enabled"
  msgstr ""
  
! #: config/i386/i386.c:5929
  #, gcc-internal-format
  msgid "calling %qT with attribute sseregparm without SSE/SSE2 enabled"
  msgstr ""
  
! #: config/i386/i386.c:6251
  #, gcc-internal-format
  msgid "X32 does not support ms_abi attribute"
  msgstr ""
  
! #: config/i386/i386.c:6280
  #, gcc-internal-format
  msgid "ms_hook_prologue is not compatible with nested function"
  msgstr ""
  
! #: config/i386/i386.c:6608
  #, gcc-internal-format
  msgid "AVX512F vector argument without AVX512F enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6614
  #, gcc-internal-format
  msgid "AVX512F vector return without AVX512F enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6628
  #, gcc-internal-format
  msgid "AVX vector argument without AVX enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6634
  #, gcc-internal-format
  msgid "AVX vector return without AVX enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6649
  #, gcc-internal-format
  msgid "SSE vector argument without SSE enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6655
  #, gcc-internal-format
  msgid "SSE vector return without SSE enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6667
  #, gcc-internal-format
  msgid "MMX vector argument without MMX enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6673
  #, gcc-internal-format
  msgid "MMX vector return without MMX enabled changes the ABI"
  msgstr ""
  
! #: config/i386/i386.c:6856
  #, gcc-internal-format
  msgid ""
  "the ABI of passing struct with a flexible array member has changed in GCC 4.4"
  msgstr ""
  
! #: config/i386/i386.c:6973
  #, gcc-internal-format
  msgid "the ABI of passing union with long double has changed in GCC 4.4"
  msgstr ""
  
! #: config/i386/i386.c:7091
  #, gcc-internal-format
  msgid ""
  "the ABI of passing structure with complex float member has changed in GCC 4.4"
  msgstr ""
  
! #: config/i386/i386.c:7254
  #, gcc-internal-format
  msgid "SSE register return with SSE disabled"
  msgstr ""
  
! #: config/i386/i386.c:7260
  #, gcc-internal-format
  msgid "SSE register argument with SSE disabled"
  msgstr ""
  
! #: config/i386/i386.c:7276
  #, gcc-internal-format
  msgid "x87 register return with x87 disabled"
  msgstr ""
  
! #: config/i386/i386.c:7560 config/i386/i386.c:7810
  #, gcc-internal-format
  msgid "calling %qD with SSE calling convention without SSE/SSE2 enabled"
  msgstr ""
  
! #: config/i386/i386.c:7562 config/i386/i386.c:7812 config/i386/i386.c:8299
  #, gcc-internal-format
  msgid ""
  "this is a GCC bug that can be worked around by adding attribute used to "
  "function called"
  msgstr ""
  
! #: config/i386/i386.c:8199
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The ABI for passing parameters with %d-byte alignment has changed in GCC 4.6"
  msgstr ""
  
! #: config/i386/i386.c:8297
  #, gcc-internal-format
  msgid "calling %qD with SSE caling convention without SSE/SSE2 enabled"
  msgstr ""
  
! #: config/i386/i386.c:11425
  #, gcc-internal-format
  msgid "ms_hook_prologue attribute isn%'t compatible with -mfentry for 32-bit"
  msgstr ""
  
! #: config/i386/i386.c:12478
  #, gcc-internal-format
  msgid "-fsplit-stack does not support fastcall with nested function"
  msgstr ""
  
! #: config/i386/i386.c:12498
  #, gcc-internal-format
  msgid ""
  "-fsplit-stack does not support 2 register parameters for a nested function"
*************** msgstr ""
*** 25944,26196 ****
  
  #. FIXME: We could make this work by pushing a register
  #. around the addition and comparison.
! #: config/i386/i386.c:12447
  #, gcc-internal-format
  msgid "-fsplit-stack does not support 3 register parameters"
  msgstr ""
  
! #: config/i386/i386.c:15303
  #, gcc-internal-format
  msgid "extended registers have no high halves"
  msgstr ""
  
! #: config/i386/i386.c:15318
  #, gcc-internal-format
  msgid "unsupported operand size for extended register"
  msgstr ""
  
! #: config/i386/i386.c:15563
  #, gcc-internal-format
  msgid "non-integer operand used with operand code 'z'"
  msgstr ""
  
! #: config/i386/i386.c:34694
  #, gcc-internal-format
  msgid "No dispatcher found for the versioning attributes"
  msgstr ""
  
! #: config/i386/i386.c:34744
  #, gcc-internal-format, gfc-internal-format
  msgid "No dispatcher found for %s"
  msgstr ""
  
! #: config/i386/i386.c:34754
  #, gcc-internal-format, gfc-internal-format
  msgid "No dispatcher found for the versioning attributes : %s"
  msgstr ""
  
! #: config/i386/i386.c:35002
  #, gcc-internal-format
  msgid ""
  "Function versions cannot be marked as gnu_inline, bodies have to be generated"
  msgstr ""
  
! #: config/i386/i386.c:35007 config/i386/i386.c:35455
  #, gcc-internal-format
  msgid "Virtual function multiversioning not supported"
  msgstr ""
  
! #: config/i386/i386.c:35072
  #, gcc-internal-format
  msgid "missing %<target%> attribute for multi-versioned %D"
  msgstr ""
  
! #: config/i386/i386.c:35075
  #, gcc-internal-format
  msgid "previous declaration of %D"
  msgstr ""
  
! #: config/i386/i386.c:35294
  #, gcc-internal-format
  msgid "multiversioning needs ifunc which is not supported on this target"
  msgstr ""
  
! #: config/i386/i386.c:35672
  #, gcc-internal-format
  msgid "Parameter to builtin must be a string constant or literal"
  msgstr ""
  
! #: config/i386/i386.c:35697 config/i386/i386.c:35747
  #, gcc-internal-format, gfc-internal-format
  msgid "Parameter to builtin not valid: %s"
  msgstr ""
  
! #: config/i386/i386.c:36158 config/i386/i386.c:37566
  #, gcc-internal-format
  msgid "the last argument must be a 2-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:36555
  #, gcc-internal-format
  msgid "the fifth argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:36650
  #, gcc-internal-format
  msgid "the third argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37497
  #, gcc-internal-format
  msgid "the last argument must be an 1-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37512
  #, gcc-internal-format
  msgid "the last argument must be a 3-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37545
  #, gcc-internal-format
  msgid "the last argument must be a 4-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37585
  #, gcc-internal-format
  msgid "the last argument must be a 1-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37598
  #, gcc-internal-format
  msgid "the last argument must be a 5-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37608
  #, gcc-internal-format
  msgid "the next to last argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37612 config/i386/i386.c:38385
  #, gcc-internal-format
  msgid "the last argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37779
  #, gcc-internal-format
  msgid "the third argument must be comparison constant"
  msgstr ""
  
! #: config/i386/i386.c:37784
  #, gcc-internal-format
  msgid "incorrect comparison mode"
  msgstr ""
  
! #: config/i386/i386.c:37790 config/i386/i386.c:37992
  #, gcc-internal-format
  msgid "incorrect rounding operand"
  msgstr ""
  
! #: config/i386/i386.c:37974
  #, gcc-internal-format
  msgid "the immediate argument must be a 4-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37980
  #, gcc-internal-format
  msgid "the immediate argument must be a 5-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37983
  #, gcc-internal-format
  msgid "the immediate argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:38383
  #, gcc-internal-format
  msgid "the last argument must be a 32-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:38465 config/rs6000/rs6000.c:13277
  #, gcc-internal-format
  msgid "selector must be an integer constant in the range 0..%wi"
  msgstr ""
  
! #: config/i386/i386.c:38660
  #, gcc-internal-format
  msgid "%qE needs unknown isa option"
  msgstr ""
  
! #: config/i386/i386.c:38664
  #, gcc-internal-format
  msgid "%qE needs isa option %s"
  msgstr ""
  
! #: config/i386/i386.c:39418
  #, gcc-internal-format
  msgid "last argument must be an immediate"
  msgstr ""
  
! #: config/i386/i386.c:40014 config/i386/i386.c:40166
  #, gcc-internal-format
  msgid "the last argument must be scale 1, 2, 4, 8"
  msgstr ""
  
! #: config/i386/i386.c:40220
  #, gcc-internal-format
  msgid "the forth argument must be scale 1, 2, 4, 8"
  msgstr ""
  
! #: config/i386/i386.c:40226
  #, gcc-internal-format
  msgid "incorrect hint operand"
  msgstr ""
  
! #: config/i386/i386.c:40245
  #, gcc-internal-format
  msgid "the xabort's argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:42857
  #, gcc-internal-format
  msgid "%qE attribute only available for 32-bit"
  msgstr ""
  
! #: config/i386/i386.c:42878
  #, gcc-internal-format
  msgid "argument to %qE attribute is neither zero, nor one"
  msgstr ""
  
! #: config/i386/i386.c:42911 config/i386/i386.c:42920
  #, gcc-internal-format
  msgid "ms_abi and sysv_abi attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:42956 config/rs6000/rs6000.c:29099
  #, gcc-internal-format
  msgid "%qE incompatible attribute ignored"
  msgstr ""
  
! #: config/i386/i386.c:51527
  #, gcc-internal-format
  msgid "Unknown architecture specific memory model"
  msgstr ""
  
! #: config/i386/i386.c:51534
  #, gcc-internal-format
  msgid "HLE_ACQUIRE not used with ACQUIRE or stronger memory model"
  msgstr ""
  
! #: config/i386/i386.c:51540
  #, gcc-internal-format
  msgid "HLE_RELEASE not used with RELEASE or stronger memory model"
  msgstr ""
  
! #: config/i386/i386.c:51564
  #, gcc-internal-format, gfc-internal-format
  msgid "unsupported simdlen %d"
  msgstr ""
  
! #: config/i386/i386.c:51583
  #, gcc-internal-format
  msgid "unsupported return type %qT for simd\n"
  msgstr ""
  
! #: config/i386/i386.c:51605
  #, gcc-internal-format
  msgid "unsupported argument type %qT for simd\n"
  msgstr ""
  
! #: config/i386/i386.c:51889
  #, gcc-internal-format
  msgid ""
  "Pointer Checker requires MPX support on this target. Use -mmpx options to "
--- 26038,26290 ----
  
  #. FIXME: We could make this work by pushing a register
  #. around the addition and comparison.
! #: config/i386/i386.c:12509
  #, gcc-internal-format
  msgid "-fsplit-stack does not support 3 register parameters"
  msgstr ""
  
! #: config/i386/i386.c:15367
  #, gcc-internal-format
  msgid "extended registers have no high halves"
  msgstr ""
  
! #: config/i386/i386.c:15382
  #, gcc-internal-format
  msgid "unsupported operand size for extended register"
  msgstr ""
  
! #: config/i386/i386.c:15627
  #, gcc-internal-format
  msgid "non-integer operand used with operand code 'z'"
  msgstr ""
  
! #: config/i386/i386.c:34780
  #, gcc-internal-format
  msgid "No dispatcher found for the versioning attributes"
  msgstr ""
  
! #: config/i386/i386.c:34830
  #, gcc-internal-format, gfc-internal-format
  msgid "No dispatcher found for %s"
  msgstr ""
  
! #: config/i386/i386.c:34840
  #, gcc-internal-format, gfc-internal-format
  msgid "No dispatcher found for the versioning attributes : %s"
  msgstr ""
  
! #: config/i386/i386.c:35088
  #, gcc-internal-format
  msgid ""
  "Function versions cannot be marked as gnu_inline, bodies have to be generated"
  msgstr ""
  
! #: config/i386/i386.c:35093 config/i386/i386.c:35541
  #, gcc-internal-format
  msgid "Virtual function multiversioning not supported"
  msgstr ""
  
! #: config/i386/i386.c:35158
  #, gcc-internal-format
  msgid "missing %<target%> attribute for multi-versioned %D"
  msgstr ""
  
! #: config/i386/i386.c:35161
  #, gcc-internal-format
  msgid "previous declaration of %D"
  msgstr ""
  
! #: config/i386/i386.c:35380
  #, gcc-internal-format
  msgid "multiversioning needs ifunc which is not supported on this target"
  msgstr ""
  
! #: config/i386/i386.c:35758
  #, gcc-internal-format
  msgid "Parameter to builtin must be a string constant or literal"
  msgstr ""
  
! #: config/i386/i386.c:35783 config/i386/i386.c:35833
  #, gcc-internal-format, gfc-internal-format
  msgid "Parameter to builtin not valid: %s"
  msgstr ""
  
! #: config/i386/i386.c:36244 config/i386/i386.c:37652
  #, gcc-internal-format
  msgid "the last argument must be a 2-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:36641
  #, gcc-internal-format
  msgid "the fifth argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:36736
  #, gcc-internal-format
  msgid "the third argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37583
  #, gcc-internal-format
  msgid "the last argument must be an 1-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37598
  #, gcc-internal-format
  msgid "the last argument must be a 3-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37631
  #, gcc-internal-format
  msgid "the last argument must be a 4-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37671
  #, gcc-internal-format
  msgid "the last argument must be a 1-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37684
  #, gcc-internal-format
  msgid "the last argument must be a 5-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37694
  #, gcc-internal-format
  msgid "the next to last argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37698 config/i386/i386.c:38473
  #, gcc-internal-format
  msgid "the last argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:37866
  #, gcc-internal-format
  msgid "the third argument must be comparison constant"
  msgstr ""
  
! #: config/i386/i386.c:37871
  #, gcc-internal-format
  msgid "incorrect comparison mode"
  msgstr ""
  
! #: config/i386/i386.c:37877 config/i386/i386.c:38079
  #, gcc-internal-format
  msgid "incorrect rounding operand"
  msgstr ""
  
! #: config/i386/i386.c:38061
  #, gcc-internal-format
  msgid "the immediate argument must be a 4-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:38067
  #, gcc-internal-format
  msgid "the immediate argument must be a 5-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:38070
  #, gcc-internal-format
  msgid "the immediate argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:38471
  #, gcc-internal-format
  msgid "the last argument must be a 32-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:38553 config/rs6000/rs6000.c:13303
  #, gcc-internal-format
  msgid "selector must be an integer constant in the range 0..%wi"
  msgstr ""
  
! #: config/i386/i386.c:38748
  #, gcc-internal-format
  msgid "%qE needs unknown isa option"
  msgstr ""
  
! #: config/i386/i386.c:38752
  #, gcc-internal-format
  msgid "%qE needs isa option %s"
  msgstr ""
  
! #: config/i386/i386.c:39506
  #, gcc-internal-format
  msgid "last argument must be an immediate"
  msgstr ""
  
! #: config/i386/i386.c:40103 config/i386/i386.c:40255
  #, gcc-internal-format
  msgid "the last argument must be scale 1, 2, 4, 8"
  msgstr ""
  
! #: config/i386/i386.c:40308
  #, gcc-internal-format
  msgid "the forth argument must be scale 1, 2, 4, 8"
  msgstr ""
  
! #: config/i386/i386.c:40314
  #, gcc-internal-format
  msgid "incorrect hint operand"
  msgstr ""
  
! #: config/i386/i386.c:40333
  #, gcc-internal-format
  msgid "the xabort's argument must be an 8-bit immediate"
  msgstr ""
  
! #: config/i386/i386.c:42958
  #, gcc-internal-format
  msgid "%qE attribute only available for 32-bit"
  msgstr ""
  
! #: config/i386/i386.c:42979
  #, gcc-internal-format
  msgid "argument to %qE attribute is neither zero, nor one"
  msgstr ""
  
! #: config/i386/i386.c:43012 config/i386/i386.c:43021
  #, gcc-internal-format
  msgid "ms_abi and sysv_abi attributes are not compatible"
  msgstr ""
  
! #: config/i386/i386.c:43057 config/rs6000/rs6000.c:29154
  #, gcc-internal-format
  msgid "%qE incompatible attribute ignored"
  msgstr ""
  
! #: config/i386/i386.c:51712
  #, gcc-internal-format
  msgid "Unknown architecture specific memory model"
  msgstr ""
  
! #: config/i386/i386.c:51719
  #, gcc-internal-format
  msgid "HLE_ACQUIRE not used with ACQUIRE or stronger memory model"
  msgstr ""
  
! #: config/i386/i386.c:51725
  #, gcc-internal-format
  msgid "HLE_RELEASE not used with RELEASE or stronger memory model"
  msgstr ""
  
! #: config/i386/i386.c:51749
  #, gcc-internal-format, gfc-internal-format
  msgid "unsupported simdlen %d"
  msgstr ""
  
! #: config/i386/i386.c:51768
  #, gcc-internal-format
  msgid "unsupported return type %qT for simd\n"
  msgstr ""
  
! #: config/i386/i386.c:51790
  #, gcc-internal-format
  msgid "unsupported argument type %qT for simd\n"
  msgstr ""
  
! #: config/i386/i386.c:52074
  #, gcc-internal-format
  msgid ""
  "Pointer Checker requires MPX support on this target. Use -mmpx options to "
*************** msgid ""
*** 26198,26204 ****
  msgstr ""
  
  #: config/i386/intelmic-mkoffload.c:241 config/i386/intelmic-mkoffload.c:301
! #: config/i386/intelmic-mkoffload.c:338 config/nvptx/mkoffload.c:1008
  #, gcc-internal-format, gfc-internal-format
  msgid "cannot open '%s'"
  msgstr ""
--- 26292,26298 ----
  msgstr ""
  
  #: config/i386/intelmic-mkoffload.c:241 config/i386/intelmic-mkoffload.c:301
! #: config/i386/intelmic-mkoffload.c:338 config/nvptx/mkoffload.c:1000
  #, gcc-internal-format, gfc-internal-format
  msgid "cannot open '%s'"
  msgstr ""
*************** msgstr ""
*** 26208,26224 ****
  msgid "output file not specified"
  msgstr ""
  
! #: config/i386/intelmic-mkoffload.c:508
  #, gcc-internal-format
  msgid "COLLECT_GCC must be set"
  msgstr ""
  
! #: config/i386/intelmic-mkoffload.c:513 config/nvptx/mkoffload.c:959
  #, gcc-internal-format, gfc-internal-format
  msgid "offload compiler %s not found"
  msgstr ""
  
! #: config/i386/intelmic-mkoffload.c:528
  #, gcc-internal-format
  msgid "unrecognizable argument of option -foffload-abi"
  msgstr ""
--- 26302,26318 ----
  msgid "output file not specified"
  msgstr ""
  
! #: config/i386/intelmic-mkoffload.c:509
  #, gcc-internal-format
  msgid "COLLECT_GCC must be set"
  msgstr ""
  
! #: config/i386/intelmic-mkoffload.c:514 config/nvptx/mkoffload.c:963
  #, gcc-internal-format, gfc-internal-format
  msgid "offload compiler %s not found"
  msgstr ""
  
! #: config/i386/intelmic-mkoffload.c:529 config/nvptx/mkoffload.c:977
  #, gcc-internal-format
  msgid "unrecognizable argument of option -foffload-abi"
  msgstr ""
*************** msgstr ""
*** 26284,26302 ****
  msgid "%qE attribute requires a string constant argument"
  msgstr ""
  
! #: config/ia64/ia64.c:5971 config/pa/pa.c:454 config/sh/sh.c:9533
  #: config/spu/spu.c:4945
  #, gcc-internal-format
  msgid "value of -mfixed-range must have form REG1-REG2"
  msgstr ""
  
! #: config/ia64/ia64.c:5998 config/pa/pa.c:481 config/sh/sh.c:9559
  #: config/spu/spu.c:4971
  #, gcc-internal-format, gfc-internal-format
  msgid "%s-%s is an empty range"
  msgstr ""
  
! #: config/ia64/ia64.c:11203
  #, gcc-internal-format
  msgid "version attribute is not a string"
  msgstr ""
--- 26378,26396 ----
  msgid "%qE attribute requires a string constant argument"
  msgstr ""
  
! #: config/ia64/ia64.c:5985 config/pa/pa.c:454 config/sh/sh.c:9559
  #: config/spu/spu.c:4945
  #, gcc-internal-format
  msgid "value of -mfixed-range must have form REG1-REG2"
  msgstr ""
  
! #: config/ia64/ia64.c:6012 config/pa/pa.c:481 config/sh/sh.c:9585
  #: config/spu/spu.c:4971
  #, gcc-internal-format, gfc-internal-format
  msgid "%s-%s is an empty range"
  msgstr ""
  
! #: config/ia64/ia64.c:11217
  #, gcc-internal-format
  msgid "version attribute is not a string"
  msgstr ""
*************** msgid "%qE attribute is not supported fo
*** 26362,26368 ****
  msgstr ""
  
  #. The argument must be a constant integer.
! #: config/m32c/m32c.c:2982 config/sh/sh.c:9752 config/sh/sh.c:9858
  #, gcc-internal-format
  msgid "%qE attribute argument not an integer constant"
  msgstr ""
--- 26456,26462 ----
  msgstr ""
  
  #. The argument must be a constant integer.
! #: config/m32c/m32c.c:2982 config/sh/sh.c:9778 config/sh/sh.c:9884
  #, gcc-internal-format
  msgid "%qE attribute argument not an integer constant"
  msgstr ""
*************** msgstr ""
*** 26422,26428 ****
  msgid "interrupt_thread is available only on fido"
  msgstr ""
  
! #: config/m68k/m68k.c:1112 config/rs6000/rs6000.c:22683
  #, gcc-internal-format
  msgid "stack limit expression is not supported"
  msgstr ""
--- 26516,26522 ----
  msgid "interrupt_thread is available only on fido"
  msgstr ""
  
! #: config/m68k/m68k.c:1112 config/rs6000/rs6000.c:22734
  #, gcc-internal-format
  msgid "stack limit expression is not supported"
  msgstr ""
*************** msgstr ""
*** 27233,27254 ****
  msgid "%<%s%> is unknown"
  msgstr ""
  
! #: config/nvptx/mkoffload.c:140
  #, gcc-internal-format
  msgid "deleting file %s: %m"
  msgstr ""
  
! #: config/nvptx/mkoffload.c:167
  #, gcc-internal-format
  msgid "malformed ptx file"
  msgstr ""
  
! #: config/nvptx/mkoffload.c:911
  #, gcc-internal-format
  msgid "COLLECT_GCC must be set."
  msgstr ""
  
! #: config/nvptx/mkoffload.c:1002
  #, gcc-internal-format
  msgid "cannot open intermediate ptx file"
  msgstr ""
--- 27327,27348 ----
  msgid "%<%s%> is unknown"
  msgstr ""
  
! #: config/nvptx/mkoffload.c:143
  #, gcc-internal-format
  msgid "deleting file %s: %m"
  msgstr ""
  
! #: config/nvptx/mkoffload.c:170
  #, gcc-internal-format
  msgid "malformed ptx file"
  msgstr ""
  
! #: config/nvptx/mkoffload.c:915
  #, gcc-internal-format
  msgid "COLLECT_GCC must be set."
  msgstr ""
  
! #: config/nvptx/mkoffload.c:1028
  #, gcc-internal-format
  msgid "cannot open intermediate ptx file"
  msgstr ""
*************** msgstr ""
*** 27283,27289 ****
  msgid "-g option disabled"
  msgstr ""
  
! #: config/pa/pa.c:8648
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "alignment (%u) for %s exceeds maximum alignment for global common data.  "
--- 27377,27383 ----
  msgid "-g option disabled"
  msgstr ""
  
! #: config/pa/pa.c:8687
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "alignment (%u) for %s exceeds maximum alignment for global common data.  "
*************** msgstr ""
*** 27372,27422 ****
  msgid "junk at end of #pragma longcall"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4367
  #, gcc-internal-format
  msgid ""
  "vec_lvsl is deprecated for little endian; use assignment for unaligned loads "
  "and stores"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4370
  #, gcc-internal-format
  msgid ""
  "vec_lvsr is deprecated for little endian; use assignment for unaligned loads "
  "and stores"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4386
  #, gcc-internal-format, gfc-internal-format
  msgid "%s only accepts %d arguments"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4391
  #, gcc-internal-format, gfc-internal-format
  msgid "%s only accepts 1 argument"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4396
  #, gcc-internal-format, gfc-internal-format
  msgid "%s only accepts 2 arguments"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4462
  #, gcc-internal-format
  msgid "vec_extract only accepts 2 arguments"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4564
  #, gcc-internal-format
  msgid "vec_insert only accepts 3 arguments"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4696
  #, gcc-internal-format
  msgid "passing arg %d of %qE discards qualifiers frompointer target type"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4740
  #, gcc-internal-format
  msgid "invalid parameter combination for AltiVec intrinsic"
  msgstr ""
--- 27466,27516 ----
  msgid "junk at end of #pragma longcall"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4385
  #, gcc-internal-format
  msgid ""
  "vec_lvsl is deprecated for little endian; use assignment for unaligned loads "
  "and stores"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4388
  #, gcc-internal-format
  msgid ""
  "vec_lvsr is deprecated for little endian; use assignment for unaligned loads "
  "and stores"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4404
  #, gcc-internal-format, gfc-internal-format
  msgid "%s only accepts %d arguments"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4409
  #, gcc-internal-format, gfc-internal-format
  msgid "%s only accepts 1 argument"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4414
  #, gcc-internal-format, gfc-internal-format
  msgid "%s only accepts 2 arguments"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4480
  #, gcc-internal-format
  msgid "vec_extract only accepts 2 arguments"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4582
  #, gcc-internal-format
  msgid "vec_insert only accepts 3 arguments"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4714
  #, gcc-internal-format
  msgid "passing arg %d of %qE discards qualifiers frompointer target type"
  msgstr ""
  
! #: config/rs6000/rs6000-c.c:4758
  #, gcc-internal-format
  msgid "invalid parameter combination for AltiVec intrinsic"
  msgstr ""
*************** msgstr ""
*** 27523,27881 ****
  msgid "-mupper-regs-sf requires -mpower8-vector"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3748
  #, gcc-internal-format, gfc-internal-format
  msgid "unknown vectorization library ABI type (%s) for -mveclibabi= switch"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3760
  #, gcc-internal-format
  msgid "target attribute or pragma changes long double size"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3782 config/rs6000/rs6000.c:3797
  #, gcc-internal-format
  msgid "target attribute or pragma changes AltiVec ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3810
  #, gcc-internal-format
  msgid "target attribute or pragma changes darwin64 ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3876
  #, gcc-internal-format
  msgid "target attribute or pragma changes single precision floating point"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3879
  #, gcc-internal-format
  msgid "target attribute or pragma changes double precision floating point"
  msgstr ""
  
! #: config/rs6000/rs6000.c:6189
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "the layout of aggregates containing vectors with %d-byte alignment has "
  "changed in GCC 5"
  msgstr ""
  
! #: config/rs6000/rs6000.c:9264
  #, gcc-internal-format
  msgid ""
  "GCC vector returned by reference: non-standard ABI extension with no "
  "compatibility guarantee"
  msgstr ""
  
! #: config/rs6000/rs6000.c:9415
  #, gcc-internal-format
  msgid ""
  "cannot return value in vector register because altivec instructions are "
  "disabled, use -maltivec to enable them"
  msgstr ""
  
! #: config/rs6000/rs6000.c:9573
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "the ABI of passing aggregates with %d-byte alignment has changed in GCC 5"
  msgstr ""
  
! #: config/rs6000/rs6000.c:9835
  #, gcc-internal-format
  msgid ""
  "cannot pass argument in vector register because altivec instructions are "
  "disabled, use -maltivec to enable them"
  msgstr ""
  
! #: config/rs6000/rs6000.c:10694
  #, gcc-internal-format
  msgid "the ABI of passing homogeneous float aggregates has changed in GCC 5"
  msgstr ""
  
! #: config/rs6000/rs6000.c:10865
  #, gcc-internal-format
  msgid ""
  "GCC vector passed by reference: non-standard ABI extension with no "
  "compatibility guarantee"
  msgstr ""
  
! #: config/rs6000/rs6000.c:11657
  #, gcc-internal-format, gfc-internal-format
  msgid "internal error: builtin function %s already processed"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12099
  #, gcc-internal-format
  msgid "argument 1 must be an 8-bit field value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12146
  #, gcc-internal-format
  msgid "argument 1 must be a 5-bit signed literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12249 config/rs6000/rs6000.c:13740
  #, gcc-internal-format
  msgid "argument 2 must be a 5-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12288
  #, gcc-internal-format
  msgid "argument 1 of __builtin_altivec_predicate must be a constant"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12340
  #, gcc-internal-format
  msgid "argument 1 of __builtin_altivec_predicate is out of range"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12714
  #, gcc-internal-format, gfc-internal-format
  msgid "builtin %s is only valid in 64-bit mode"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12763
  #, gcc-internal-format, gfc-internal-format
  msgid "argument %d must be an unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12765
  #, gcc-internal-format, gfc-internal-format
  msgid "argument %d is an unsigned literal that is out of range"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12928
  #, gcc-internal-format
  msgid "argument 3 must be a 4-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12946
  #, gcc-internal-format
  msgid "argument 3 must be a 2-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12966
  #, gcc-internal-format
  msgid "argument 3 must be a 1-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12978
  #, gcc-internal-format
  msgid "argument 1 must be 0 or 2"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12990
  #, gcc-internal-format
  msgid "argument 1 must be a 1-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13004
  #, gcc-internal-format
  msgid "argument 2 must be a 6-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13016
  #, gcc-internal-format
  msgid "argument 2 must be 0 or 1"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13023
  #, gcc-internal-format
  msgid "argument 3 must be in the range 0..15"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13210
  #, gcc-internal-format
  msgid "argument to %qs must be a 2-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13363
  #, gcc-internal-format
  msgid "unresolved overload for Altivec builtin %qF"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13493
  #, gcc-internal-format
  msgid "argument to dss must be a 2-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13860
  #, gcc-internal-format
  msgid "argument 1 of __builtin_paired_predicate must be a constant"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13907
  #, gcc-internal-format
  msgid "argument 1 of __builtin_paired_predicate is out of range"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13932
  #, gcc-internal-format
  msgid "argument 1 of __builtin_spe_predicate must be a constant"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14004
  #, gcc-internal-format
  msgid "argument 1 of __builtin_spe_predicate is out of range"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14086
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s is only valid for the cell processor"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14088
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mvsx option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14090
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mhtm option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14092
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -maltivec option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14094
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mpaired option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14096
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mspe option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14099
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mhard-dfp and -mpower8-vector options"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14102
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mhard-dfp option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14104
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mpower8-vector option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14107
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Builtin function %s requires the -mhard-float and -mlong-double-128 options"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14110
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mhard-float option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14112
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s is not supported with the current options"
  msgstr ""
  
! #: config/rs6000/rs6000.c:15628
  #, gcc-internal-format, gfc-internal-format
  msgid "internal error: builtin function %s had no type"
  msgstr ""
  
! #: config/rs6000/rs6000.c:15636
  #, gcc-internal-format, gfc-internal-format
  msgid "internal error: builtin function %s had an unexpected return type %s"
  msgstr ""
  
! #: config/rs6000/rs6000.c:15653
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "internal error: builtin function %s, argument %d had unexpected argument "
  "type %s"
  msgstr ""
  
! #: config/rs6000/rs6000.c:22653
  #, gcc-internal-format
  msgid "stack frame too large"
  msgstr ""
  
! #: config/rs6000/rs6000.c:26723
  #, gcc-internal-format
  msgid "no profiling of 64-bit code for this ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28801
  #, gcc-internal-format
  msgid ""
  "You cannot take the address of a nested function if you use the -mno-"
  "pointers-to-nested-functions option."
  msgstr ""
  
! #: config/rs6000/rs6000.c:28883
  #, gcc-internal-format
  msgid "use of %<long double%> in AltiVec types is invalid"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28885
  #, gcc-internal-format
  msgid "use of boolean types in AltiVec types is invalid"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28887
  #, gcc-internal-format
  msgid "use of %<complex%> in AltiVec types is invalid"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28889
  #, gcc-internal-format
  msgid "use of decimal floating point types in AltiVec types is invalid"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28895
  #, gcc-internal-format
  msgid ""
  "use of %<long%> in AltiVec types is invalid for 64-bit code without -mvsx"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28898
  #, gcc-internal-format
  msgid "use of %<long%> in AltiVec types is deprecated; use %<int%>"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28903
  #, gcc-internal-format
  msgid "use of %<long long%> in AltiVec types is invalid without -mvsx"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28906
  #, gcc-internal-format
  msgid "use of %<double%> in AltiVec types is invalid without -mvsx"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32239
  #, gcc-internal-format, gfc-internal-format
  msgid "emitting microcode insn %s\t[%s] #%d"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32243
  #, gcc-internal-format, gfc-internal-format
  msgid "emitting conditional microcode insn %s\t[%s] #%d"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32533
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid cpu \"%s\" for %s\"%s\"%s"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32536
  #, gcc-internal-format, gfc-internal-format
  msgid "%s\"%s\"%s is not allowed"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32538
  #, gcc-internal-format, gfc-internal-format
  msgid "%s\"%s\"%s is invalid"
  msgstr ""
--- 27617,27990 ----
  msgid "-mupper-regs-sf requires -mpower8-vector"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3706
! #, gcc-internal-format
! msgid "-mallow-movmisalign requires -mvsx"
! msgstr ""
! 
! #: config/rs6000/rs6000.c:3721
! #, gcc-internal-format
! msgid "-mefficient-unaligned-vsx requires -mvsx"
! msgstr ""
! 
! #: config/rs6000/rs6000.c:3729
! #, gcc-internal-format
! msgid "-mefficient-unaligned-vsx requires -mallow-movmisalign"
! msgstr ""
! 
! #: config/rs6000/rs6000.c:3788
  #, gcc-internal-format, gfc-internal-format
  msgid "unknown vectorization library ABI type (%s) for -mveclibabi= switch"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3800
  #, gcc-internal-format
  msgid "target attribute or pragma changes long double size"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3822 config/rs6000/rs6000.c:3837
  #, gcc-internal-format
  msgid "target attribute or pragma changes AltiVec ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3850
  #, gcc-internal-format
  msgid "target attribute or pragma changes darwin64 ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3916
  #, gcc-internal-format
  msgid "target attribute or pragma changes single precision floating point"
  msgstr ""
  
! #: config/rs6000/rs6000.c:3919
  #, gcc-internal-format
  msgid "target attribute or pragma changes double precision floating point"
  msgstr ""
  
! #: config/rs6000/rs6000.c:6213
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "the layout of aggregates containing vectors with %d-byte alignment has "
  "changed in GCC 5"
  msgstr ""
  
! #: config/rs6000/rs6000.c:9288
  #, gcc-internal-format
  msgid ""
  "GCC vector returned by reference: non-standard ABI extension with no "
  "compatibility guarantee"
  msgstr ""
  
! #: config/rs6000/rs6000.c:9439
  #, gcc-internal-format
  msgid ""
  "cannot return value in vector register because altivec instructions are "
  "disabled, use -maltivec to enable them"
  msgstr ""
  
! #: config/rs6000/rs6000.c:9597
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "the ABI of passing aggregates with %d-byte alignment has changed in GCC 5"
  msgstr ""
  
! #: config/rs6000/rs6000.c:9859
  #, gcc-internal-format
  msgid ""
  "cannot pass argument in vector register because altivec instructions are "
  "disabled, use -maltivec to enable them"
  msgstr ""
  
! #: config/rs6000/rs6000.c:10718
  #, gcc-internal-format
  msgid "the ABI of passing homogeneous float aggregates has changed in GCC 5"
  msgstr ""
  
! #: config/rs6000/rs6000.c:10889
  #, gcc-internal-format
  msgid ""
  "GCC vector passed by reference: non-standard ABI extension with no "
  "compatibility guarantee"
  msgstr ""
  
! #: config/rs6000/rs6000.c:11681
  #, gcc-internal-format, gfc-internal-format
  msgid "internal error: builtin function %s already processed"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12123
  #, gcc-internal-format
  msgid "argument 1 must be an 8-bit field value"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12170
  #, gcc-internal-format
  msgid "argument 1 must be a 5-bit signed literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12273 config/rs6000/rs6000.c:13766
  #, gcc-internal-format
  msgid "argument 2 must be a 5-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12312
  #, gcc-internal-format
  msgid "argument 1 of __builtin_altivec_predicate must be a constant"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12364
  #, gcc-internal-format
  msgid "argument 1 of __builtin_altivec_predicate is out of range"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12738
  #, gcc-internal-format, gfc-internal-format
  msgid "builtin %s is only valid in 64-bit mode"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12787
  #, gcc-internal-format, gfc-internal-format
  msgid "argument %d must be an unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12789
  #, gcc-internal-format, gfc-internal-format
  msgid "argument %d is an unsigned literal that is out of range"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12952
  #, gcc-internal-format
  msgid "argument 3 must be a 4-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12970
  #, gcc-internal-format
  msgid "argument 3 must be a 2-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:12990
  #, gcc-internal-format
  msgid "argument 3 must be a 1-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13002
  #, gcc-internal-format
  msgid "argument 1 must be 0 or 2"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13014
  #, gcc-internal-format
  msgid "argument 1 must be a 1-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13028
  #, gcc-internal-format
  msgid "argument 2 must be a 6-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13040
  #, gcc-internal-format
  msgid "argument 2 must be 0 or 1"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13047
  #, gcc-internal-format
  msgid "argument 3 must be in the range 0..15"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13236
  #, gcc-internal-format
  msgid "argument to %qs must be a 2-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13389
  #, gcc-internal-format
  msgid "unresolved overload for Altivec builtin %qF"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13519
  #, gcc-internal-format
  msgid "argument to dss must be a 2-bit unsigned literal"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13886
  #, gcc-internal-format
  msgid "argument 1 of __builtin_paired_predicate must be a constant"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13933
  #, gcc-internal-format
  msgid "argument 1 of __builtin_paired_predicate is out of range"
  msgstr ""
  
! #: config/rs6000/rs6000.c:13958
  #, gcc-internal-format
  msgid "argument 1 of __builtin_spe_predicate must be a constant"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14030
  #, gcc-internal-format
  msgid "argument 1 of __builtin_spe_predicate is out of range"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14112
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s is only valid for the cell processor"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14114
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mvsx option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14116
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mhtm option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14118
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -maltivec option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14120
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mpaired option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14122
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mspe option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14125
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mhard-dfp and -mpower8-vector options"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14128
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mhard-dfp option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14130
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mpower8-vector option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14133
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Builtin function %s requires the -mhard-float and -mlong-double-128 options"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14136
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s requires the -mhard-float option"
  msgstr ""
  
! #: config/rs6000/rs6000.c:14138
  #, gcc-internal-format, gfc-internal-format
  msgid "Builtin function %s is not supported with the current options"
  msgstr ""
  
! #: config/rs6000/rs6000.c:15654
  #, gcc-internal-format, gfc-internal-format
  msgid "internal error: builtin function %s had no type"
  msgstr ""
  
! #: config/rs6000/rs6000.c:15662
  #, gcc-internal-format, gfc-internal-format
  msgid "internal error: builtin function %s had an unexpected return type %s"
  msgstr ""
  
! #: config/rs6000/rs6000.c:15679
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "internal error: builtin function %s, argument %d had unexpected argument "
  "type %s"
  msgstr ""
  
! #: config/rs6000/rs6000.c:22704
  #, gcc-internal-format
  msgid "stack frame too large"
  msgstr ""
  
! #: config/rs6000/rs6000.c:26778
  #, gcc-internal-format
  msgid "no profiling of 64-bit code for this ABI"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28856
  #, gcc-internal-format
  msgid ""
  "You cannot take the address of a nested function if you use the -mno-"
  "pointers-to-nested-functions option."
  msgstr ""
  
! #: config/rs6000/rs6000.c:28938
  #, gcc-internal-format
  msgid "use of %<long double%> in AltiVec types is invalid"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28940
  #, gcc-internal-format
  msgid "use of boolean types in AltiVec types is invalid"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28942
  #, gcc-internal-format
  msgid "use of %<complex%> in AltiVec types is invalid"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28944
  #, gcc-internal-format
  msgid "use of decimal floating point types in AltiVec types is invalid"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28950
  #, gcc-internal-format
  msgid ""
  "use of %<long%> in AltiVec types is invalid for 64-bit code without -mvsx"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28953
  #, gcc-internal-format
  msgid "use of %<long%> in AltiVec types is deprecated; use %<int%>"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28958
  #, gcc-internal-format
  msgid "use of %<long long%> in AltiVec types is invalid without -mvsx"
  msgstr ""
  
! #: config/rs6000/rs6000.c:28961
  #, gcc-internal-format
  msgid "use of %<double%> in AltiVec types is invalid without -mvsx"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32298
  #, gcc-internal-format, gfc-internal-format
  msgid "emitting microcode insn %s\t[%s] #%d"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32302
  #, gcc-internal-format, gfc-internal-format
  msgid "emitting conditional microcode insn %s\t[%s] #%d"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32594
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid cpu \"%s\" for %s\"%s\"%s"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32597
  #, gcc-internal-format, gfc-internal-format
  msgid "%s\"%s\"%s is not allowed"
  msgstr ""
  
! #: config/rs6000/rs6000.c:32599
  #, gcc-internal-format, gfc-internal-format
  msgid "%s\"%s\"%s is invalid"
  msgstr ""
*************** msgid ""
*** 28009,28015 ****
  "-maix64 required: 64-bit computation with 32-bit addressing not yet supported"
  msgstr ""
  
! #: config/rs6000/aix61.h:47 config/rs6000/freebsd64.h:107
  #: config/rs6000/linux64.h:139
  #, gcc-internal-format
  msgid "-mcmodel incompatible with other toc options"
--- 28118,28124 ----
  "-maix64 required: 64-bit computation with 32-bit addressing not yet supported"
  msgstr ""
  
! #: config/rs6000/aix61.h:47 config/rs6000/freebsd64.h:120
  #: config/rs6000/linux64.h:139
  #, gcc-internal-format
  msgid "-mcmodel incompatible with other toc options"
*************** msgstr ""
*** 28035,28048 ****
  msgid "E500 and FPRs not supported"
  msgstr ""
  
! #: config/rs6000/freebsd64.h:100 config/rs6000/linux64.h:132
  #, gcc-internal-format
! msgid "-m64 requires a PowerPC64 cpu"
  msgstr ""
  
! #: config/rs6000/linux64.h:112
  #, gcc-internal-format
! msgid "-mcall-aixdesc incompatible with -mabi=elfv2"
  msgstr ""
  
  #. The macro SUBTARGET_OVERRIDE_OPTIONS is provided for subtargets, to
--- 28144,28157 ----
  msgid "E500 and FPRs not supported"
  msgstr ""
  
! #: config/rs6000/freebsd64.h:98 config/rs6000/linux64.h:112
  #, gcc-internal-format
! msgid "-mcall-aixdesc incompatible with -mabi=elfv2"
  msgstr ""
  
! #: config/rs6000/freebsd64.h:113 config/rs6000/linux64.h:132
  #, gcc-internal-format
! msgid "-m64 requires a PowerPC64 cpu"
  msgstr ""
  
  #. The macro SUBTARGET_OVERRIDE_OPTIONS is provided for subtargets, to
*************** msgstr ""
*** 28122,28147 ****
  msgid "RX FPU instructions do not support NaNs and infinities"
  msgstr ""
  
! #: config/s390/s390.c:503
  #, gcc-internal-format
  msgid ""
  "requested %qE attribute is not a comma separated pair of non-negative "
  "integer constants or too large (max. %d)"
  msgstr ""
  
! #: config/s390/s390.c:7794
  #, gcc-internal-format
  msgid "total size of local variables exceeds architecture limit"
  msgstr ""
  
! #: config/s390/s390.c:8794
  #, gcc-internal-format
  msgid ""
  "frame size of function %qs is %wd bytes exceeding user provided stack limit "
  "of %d bytes.  An unconditional trap is added."
  msgstr ""
  
! #: config/s390/s390.c:8809
  #, gcc-internal-format
  msgid ""
  "frame size of function %qs is %wd bytes which is more than half the stack "
--- 28231,28331 ----
  msgid "RX FPU instructions do not support NaNs and infinities"
  msgstr ""
  
! #: config/s390/s390-c.c:367
! #, gcc-internal-format
! msgid "Builtin vec_step can only be used on vector types."
! msgstr ""
! 
! #: config/s390/s390-c.c:587
! #, gcc-internal-format
! msgid ""
! "valid values for builtin %qF argument %d are 64, 128, 256, 512, 1024, 2048, "
! "and 4096"
! msgstr ""
! 
! #: config/s390/s390-c.c:757
! #, gcc-internal-format
! msgid "Builtin %qF is for GCC internal use only."
! msgstr ""
! 
! #: config/s390/s390-c.c:774
! #, gcc-internal-format
! msgid "Mismatch in number of arguments for builtin %qF. Expected: %d got %d"
! msgstr ""
! 
! #: config/s390/s390-c.c:823
! #, gcc-internal-format
! msgid "invalid parameter combination for intrinsic %qs"
! msgstr ""
! 
! #: config/s390/s390-c.c:829
! #, gcc-internal-format
! msgid "ambiguous overload for intrinsic %qs"
! msgstr ""
! 
! #: config/s390/s390-c.c:869
! #, gcc-internal-format
! msgid "constant argument %d for builtin %qF is out of range for target type"
! msgstr ""
! 
! #: config/s390/s390.c:748
! #, gcc-internal-format
! msgid "constant argument %d for builtin %qF is out of range (0.."
! msgstr ""
! 
! #: config/s390/s390.c:765
! #, gcc-internal-format
! msgid "constant argument %d for builtin %qF is out of range ("
! msgstr ""
! 
! #: config/s390/s390.c:823
! #, gcc-internal-format
! msgid "Unresolved overloaded builtin"
! msgstr ""
! 
! #: config/s390/s390.c:830 config/tilegx/tilegx.c:3582
! #: config/tilepro/tilepro.c:3150
! #, gcc-internal-format
! msgid "bad builtin icode"
! msgstr ""
! 
! #: config/s390/s390.c:866
! #, gcc-internal-format
! msgid "constant value required for builtin %qF argument %d"
! msgstr ""
! 
! #: config/s390/s390.c:943
! #, gcc-internal-format
! msgid "Invalid argument %d for builtin %qF"
! msgstr ""
! 
! #: config/s390/s390.c:951
! #, gcc-internal-format
! msgid ""
! "Vector type builtin %qF is not supported without -mvx (default with -"
! "march=z13)."
! msgstr ""
! 
! #: config/s390/s390.c:1052
  #, gcc-internal-format
  msgid ""
  "requested %qE attribute is not a comma separated pair of non-negative "
  "integer constants or too large (max. %d)"
  msgstr ""
  
! #: config/s390/s390.c:9449
  #, gcc-internal-format
  msgid "total size of local variables exceeds architecture limit"
  msgstr ""
  
! #: config/s390/s390.c:10542
  #, gcc-internal-format
  msgid ""
  "frame size of function %qs is %wd bytes exceeding user provided stack limit "
  "of %d bytes.  An unconditional trap is added."
  msgstr ""
  
! #: config/s390/s390.c:10557
  #, gcc-internal-format
  msgid ""
  "frame size of function %qs is %wd bytes which is more than half the stack "
*************** msgid ""
*** 28149,28286 ****
  "function."
  msgstr ""
  
! #: config/s390/s390.c:8837
  #, gcc-internal-format
  msgid "frame size of %qs is %wd bytes"
  msgstr ""
  
! #: config/s390/s390.c:8841
  #, gcc-internal-format
  msgid "%qs uses dynamic stack allocation"
  msgstr ""
  
- #: config/s390/s390.c:10106
- #, gcc-internal-format
- msgid "Transactional execution builtins not enabled (-mhtm)\n"
- msgstr ""
- 
  #. argument is not a plain number
! #: config/s390/s390.c:11945
  #, gcc-internal-format
  msgid "arguments to %qs should be non-negative integers"
  msgstr ""
  
! #: config/s390/s390.c:11952
  #, gcc-internal-format
  msgid "argument to %qs is too large (max. %d)"
  msgstr ""
  
! #: config/s390/s390.c:11995
  #, gcc-internal-format, gfc-internal-format
  msgid "z/Architecture mode not supported on %s"
  msgstr ""
  
! #: config/s390/s390.c:11997
  #, gcc-internal-format
  msgid "64-bit ABI not supported in ESA/390 mode"
  msgstr ""
  
! #: config/s390/s390.c:12014
  #, gcc-internal-format, gfc-internal-format
  msgid "hardware decimal floating point instructions not available on %s"
  msgstr ""
  
! #: config/s390/s390.c:12017
  #, gcc-internal-format
  msgid ""
  "hardware decimal floating point instructions not available in ESA/390 mode"
  msgstr ""
  
! #: config/s390/s390.c:12027
  #, gcc-internal-format
  msgid "-mhard-dfp can%'t be used in conjunction with -msoft-float"
  msgstr ""
  
! #: config/s390/s390.c:12055
  #, gcc-internal-format
  msgid ""
  "-mbackchain -mpacked-stack -mhard-float are not supported in combination"
  msgstr ""
  
! #: config/s390/s390.c:12061
  #, gcc-internal-format
  msgid "stack size must be greater than the stack guard value"
  msgstr ""
  
! #: config/s390/s390.c:12063
  #, gcc-internal-format
  msgid "stack size must not be greater than 64k"
  msgstr ""
  
! #: config/s390/s390.c:12066
  #, gcc-internal-format
  msgid "-mstack-guard implies use of -mstack-size"
  msgstr ""
  
! #: config/sh/sh.c:1046
  #, gcc-internal-format
  msgid "ignoring -fschedule-insns because of exception handling bug"
  msgstr ""
  
! #: config/sh/sh.c:1063
  #, gcc-internal-format
  msgid ""
  "unwind tables currently require either a frame pointer or -maccumulate-"
  "outgoing-args for correctness"
  msgstr ""
  
! #: config/sh/sh.c:8418
  #, gcc-internal-format
  msgid "__builtin_saveregs not supported by this subtarget"
  msgstr ""
  
! #: config/sh/sh.c:9621
  #, gcc-internal-format
  msgid "%qE attribute only applies to interrupt functions"
  msgstr ""
  
! #: config/sh/sh.c:9691
  #, gcc-internal-format
  msgid "%qE attribute is supported only for SH2A"
  msgstr ""
  
! #: config/sh/sh.c:9721
  #, gcc-internal-format
  msgid "attribute interrupt_handler is not compatible with -m5-compact"
  msgstr ""
  
! #: config/sh/sh.c:9738
  #, gcc-internal-format
  msgid "%qE attribute only applies to SH2A"
  msgstr ""
  
! #: config/sh/sh.c:9760
  #, gcc-internal-format
  msgid "%qE attribute argument should be between 0 to 255"
  msgstr ""
  
  #. The argument must be a constant string.
! #: config/sh/sh.c:9833
  #, gcc-internal-format
  msgid "%qE attribute argument not a string constant"
  msgstr ""
  
! #: config/sh/sh.c:12596
  #, gcc-internal-format
  msgid "r0 needs to be available as a call-clobbered register"
  msgstr ""
  
! #: config/sh/sh.c:12617
  #, gcc-internal-format
  msgid "need a second call-clobbered general purpose register"
  msgstr ""
  
! #: config/sh/sh.c:12625
  #, gcc-internal-format
  msgid "need a call-clobbered target register"
  msgstr ""
--- 28333,28475 ----
  "function."
  msgstr ""
  
! #: config/s390/s390.c:10585
  #, gcc-internal-format
  msgid "frame size of %qs is %wd bytes"
  msgstr ""
  
! #: config/s390/s390.c:10589
  #, gcc-internal-format
  msgid "%qs uses dynamic stack allocation"
  msgstr ""
  
  #. argument is not a plain number
! #: config/s390/s390.c:13759
  #, gcc-internal-format
  msgid "arguments to %qs should be non-negative integers"
  msgstr ""
  
! #: config/s390/s390.c:13766
  #, gcc-internal-format
  msgid "argument to %qs is too large (max. %d)"
  msgstr ""
  
! #: config/s390/s390.c:13809
  #, gcc-internal-format, gfc-internal-format
  msgid "z/Architecture mode not supported on %s"
  msgstr ""
  
! #: config/s390/s390.c:13811
  #, gcc-internal-format
  msgid "64-bit ABI not supported in ESA/390 mode"
  msgstr ""
  
! #: config/s390/s390.c:13828
! #, gcc-internal-format, gfc-internal-format
! msgid "hardware vector support not available on %s"
! msgstr ""
! 
! #: config/s390/s390.c:13831
! #, gcc-internal-format
! msgid "hardware vector support not available with -msoft-float"
! msgstr ""
! 
! #: config/s390/s390.c:13844
  #, gcc-internal-format, gfc-internal-format
  msgid "hardware decimal floating point instructions not available on %s"
  msgstr ""
  
! #: config/s390/s390.c:13847
  #, gcc-internal-format
  msgid ""
  "hardware decimal floating point instructions not available in ESA/390 mode"
  msgstr ""
  
! #: config/s390/s390.c:13857
  #, gcc-internal-format
  msgid "-mhard-dfp can%'t be used in conjunction with -msoft-float"
  msgstr ""
  
! #: config/s390/s390.c:13886
  #, gcc-internal-format
  msgid ""
  "-mbackchain -mpacked-stack -mhard-float are not supported in combination"
  msgstr ""
  
! #: config/s390/s390.c:13892
  #, gcc-internal-format
  msgid "stack size must be greater than the stack guard value"
  msgstr ""
  
! #: config/s390/s390.c:13894
  #, gcc-internal-format
  msgid "stack size must not be greater than 64k"
  msgstr ""
  
! #: config/s390/s390.c:13897
  #, gcc-internal-format
  msgid "-mstack-guard implies use of -mstack-size"
  msgstr ""
  
! #: config/sh/sh.c:1050
  #, gcc-internal-format
  msgid "ignoring -fschedule-insns because of exception handling bug"
  msgstr ""
  
! #: config/sh/sh.c:1067
  #, gcc-internal-format
  msgid ""
  "unwind tables currently require either a frame pointer or -maccumulate-"
  "outgoing-args for correctness"
  msgstr ""
  
! #: config/sh/sh.c:8444
  #, gcc-internal-format
  msgid "__builtin_saveregs not supported by this subtarget"
  msgstr ""
  
! #: config/sh/sh.c:9647
  #, gcc-internal-format
  msgid "%qE attribute only applies to interrupt functions"
  msgstr ""
  
! #: config/sh/sh.c:9717
  #, gcc-internal-format
  msgid "%qE attribute is supported only for SH2A"
  msgstr ""
  
! #: config/sh/sh.c:9747
  #, gcc-internal-format
  msgid "attribute interrupt_handler is not compatible with -m5-compact"
  msgstr ""
  
! #: config/sh/sh.c:9764
  #, gcc-internal-format
  msgid "%qE attribute only applies to SH2A"
  msgstr ""
  
! #: config/sh/sh.c:9786
  #, gcc-internal-format
  msgid "%qE attribute argument should be between 0 to 255"
  msgstr ""
  
  #. The argument must be a constant string.
! #: config/sh/sh.c:9859
  #, gcc-internal-format
  msgid "%qE attribute argument not a string constant"
  msgstr ""
  
! #: config/sh/sh.c:12622
  #, gcc-internal-format
  msgid "r0 needs to be available as a call-clobbered register"
  msgstr ""
  
! #: config/sh/sh.c:12643
  #, gcc-internal-format
  msgid "need a second call-clobbered general purpose register"
  msgstr ""
  
! #: config/sh/sh.c:12651
  #, gcc-internal-format
  msgid "need a call-clobbered target register"
  msgstr ""
*************** msgstr ""
*** 28402,28412 ****
  msgid "__BELOW100__ attribute not allowed with auto storage class"
  msgstr ""
  
- #: config/tilegx/tilegx.c:3582 config/tilepro/tilepro.c:3150
- #, gcc-internal-format
- msgid "bad builtin icode"
- msgstr ""
- 
  #: config/tilegx/tilegx.c:3623 config/tilepro/tilepro.c:3176
  #, gcc-internal-format
  msgid "operand must be an immediate of the right size"
--- 28591,28596 ----
*************** msgstr ""
*** 28627,28633 ****
  msgid "only uninitialized variables can be placed in a .bss section"
  msgstr ""
  
! #: ada/gcc-interface/decl.c:2219 ada/gcc-interface/decl.c:2955
  #, gcc-internal-format
  msgid "non-default Scalar_Storage_Order"
  msgstr ""
--- 28811,28817 ----
  msgid "only uninitialized variables can be placed in a .bss section"
  msgstr ""
  
! #: ada/gcc-interface/decl.c:2220 ada/gcc-interface/decl.c:2956
  #, gcc-internal-format
  msgid "non-default Scalar_Storage_Order"
  msgstr ""
*************** msgstr ""
*** 28642,28658 ****
  msgid "-fexcess-precision=standard for Ada"
  msgstr ""
  
! #: ada/gcc-interface/trans.c:1529
  #, gcc-internal-format
  msgid "subprogram %q+F not marked Inline_Always"
  msgstr ""
  
! #: ada/gcc-interface/trans.c:1530 ada/gcc-interface/trans.c:1536
  #, gcc-internal-format
  msgid "parent subprogram cannot be inlined"
  msgstr ""
  
! #: ada/gcc-interface/trans.c:1534
  #, gcc-internal-format
  msgid "subprogram %q+F not marked Inline"
  msgstr ""
--- 28826,28842 ----
  msgid "-fexcess-precision=standard for Ada"
  msgstr ""
  
! #: ada/gcc-interface/trans.c:1535
  #, gcc-internal-format
  msgid "subprogram %q+F not marked Inline_Always"
  msgstr ""
  
! #: ada/gcc-interface/trans.c:1536 ada/gcc-interface/trans.c:1542
  #, gcc-internal-format
  msgid "parent subprogram cannot be inlined"
  msgstr ""
  
! #: ada/gcc-interface/trans.c:1540
  #, gcc-internal-format
  msgid "subprogram %q+F not marked Inline"
  msgstr ""
*************** msgstr ""
*** 28667,28699 ****
  msgid "number of components of vector not a power of two"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5623 ada/gcc-interface/utils.c:5797
! #: ada/gcc-interface/utils.c:5859
  #, gcc-internal-format
  msgid "%qs attribute ignored"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5740
  #, gcc-internal-format
  msgid "%qs attribute requires prototypes with named arguments"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5749
  #, gcc-internal-format
  msgid "%qs attribute only applies to variadic functions"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5819
  #, gcc-internal-format
  msgid "%qE attribute has no effect"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5943
  #, gcc-internal-format
  msgid "attribute %qs applies to array types only"
  msgstr ""
  
! #: c/c-array-notation.c:229 c/c-array-notation.c:258 cp/call.c:7581
  #: cp/cp-array-notation.c:264
  #, gcc-internal-format
  msgid "Invalid builtin arguments"
--- 28851,28883 ----
  msgid "number of components of vector not a power of two"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5631 ada/gcc-interface/utils.c:5805
! #: ada/gcc-interface/utils.c:5867
  #, gcc-internal-format
  msgid "%qs attribute ignored"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5748
  #, gcc-internal-format
  msgid "%qs attribute requires prototypes with named arguments"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5757
  #, gcc-internal-format
  msgid "%qs attribute only applies to variadic functions"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5827
  #, gcc-internal-format
  msgid "%qE attribute has no effect"
  msgstr ""
  
! #: ada/gcc-interface/utils.c:5951
  #, gcc-internal-format
  msgid "attribute %qs applies to array types only"
  msgstr ""
  
! #: c/c-array-notation.c:229 c/c-array-notation.c:258 cp/call.c:7625
  #: cp/cp-array-notation.c:264
  #, gcc-internal-format
  msgid "Invalid builtin arguments"
*************** msgid ""
*** 28706,28713 ****
  "dimension greater than 1"
  msgstr ""
  
! #: c/c-array-notation.c:731 c/c-array-notation.c:737
! #: cp/cp-array-notation.c:620
  #, gcc-internal-format
  msgid "%qE cannot be scalar when %qE is not"
  msgstr ""
--- 28890,28896 ----
  "dimension greater than 1"
  msgstr ""
  
! #: c/c-array-notation.c:731 c/c-array-notation.c:737 cp/cp-array-notation.c:620
  #, gcc-internal-format
  msgid "%qE cannot be scalar when %qE is not"
  msgstr ""
*************** msgstr ""
*** 28752,28759 ****
  #. an unprototyped function, it is compile-time undefined;
  #. making it a constraint in that case was rejected in
  #. DR#252.
! #: c/c-convert.c:110 c/c-typeck.c:2144 c/c-typeck.c:5879 c/c-typeck.c:11329
! #: cp/typeck.c:1952 cp/typeck.c:7374 cp/typeck.c:8085
  #, gcc-internal-format
  msgid "void value not ignored as it ought to be"
  msgstr ""
--- 28935,28942 ----
  #. an unprototyped function, it is compile-time undefined;
  #. making it a constraint in that case was rejected in
  #. DR#252.
! #: c/c-convert.c:110 c/c-typeck.c:2144 c/c-typeck.c:5893 c/c-typeck.c:11374
! #: cp/typeck.c:1952 cp/typeck.c:7393 cp/typeck.c:8104
  #, gcc-internal-format
  msgid "void value not ignored as it ought to be"
  msgstr ""
*************** msgstr ""
*** 28813,28819 ****
  msgid "type of array %q+D completed incompatibly with implicit initialization"
  msgstr ""
  
! #: c/c-decl.c:1589 c/c-decl.c:6359 c/c-decl.c:7221 c/c-decl.c:7930
  #, gcc-internal-format
  msgid "originally defined here"
  msgstr ""
--- 28996,29002 ----
  msgid "type of array %q+D completed incompatibly with implicit initialization"
  msgstr ""
  
! #: c/c-decl.c:1589 c/c-decl.c:6400 c/c-decl.c:7273 c/c-decl.c:7982
  #, gcc-internal-format
  msgid "originally defined here"
  msgstr ""
*************** msgstr ""
*** 28882,28888 ****
  msgid "built-in function %q+D declared as non-function"
  msgstr ""
  
! #: c/c-decl.c:1856 c/c-decl.c:2026 c/c-decl.c:2802
  #, gcc-internal-format
  msgid "declaration of %q+D shadows a built-in function"
  msgstr ""
--- 29065,29071 ----
  msgid "built-in function %q+D declared as non-function"
  msgstr ""
  
! #: c/c-decl.c:1856 c/c-decl.c:2026 c/c-decl.c:2831
  #, gcc-internal-format
  msgid "declaration of %q+D shadows a built-in function"
  msgstr ""
*************** msgstr ""
*** 29022,29240 ****
  msgid "redundant redeclaration of %q+D"
  msgstr ""
  
! #: c/c-decl.c:2777
  #, gcc-internal-format
  msgid "declaration of %q+D shadows previous non-variable"
  msgstr ""
  
! #: c/c-decl.c:2783
  #, gcc-internal-format
  msgid "declaration of %q+D shadows a parameter"
  msgstr ""
  
! #: c/c-decl.c:2795 cp/name-lookup.c:1284
  #, gcc-internal-format
  msgid "declaration of %qD shadows a global declaration"
  msgstr ""
  
! #: c/c-decl.c:2807
  #, gcc-internal-format
  msgid "declaration of %q+D shadows a previous local"
  msgstr ""
  
! #: c/c-decl.c:2812 cp/name-lookup.c:1227 cp/name-lookup.c:1269
  #: cp/name-lookup.c:1287
  #, gcc-internal-format
  msgid "shadowed declaration is here"
  msgstr ""
  
! #: c/c-decl.c:2939
  #, gcc-internal-format
  msgid "nested extern declaration of %qD"
  msgstr ""
  
! #: c/c-decl.c:3115 c/c-decl.c:3118
  #, gcc-internal-format
  msgid "implicit declaration of function %qE"
  msgstr ""
  
! #: c/c-decl.c:3364
  #, gcc-internal-format
  msgid "incompatible implicit declaration of built-in function %qD"
  msgstr ""
  
! #: c/c-decl.c:3371
  #, gcc-internal-format
  msgid "include %qs or provide a declaration of %qD"
  msgstr ""
  
! #: c/c-decl.c:3380
  #, gcc-internal-format
  msgid "incompatible implicit declaration of function %qD"
  msgstr ""
  
! #: c/c-decl.c:3434
  #, gcc-internal-format
  msgid "%qE undeclared here (not in a function)"
  msgstr ""
  
! #: c/c-decl.c:3440
  #, gcc-internal-format
  msgid "%qE undeclared (first use in this function)"
  msgstr ""
  
! #: c/c-decl.c:3443
  #, gcc-internal-format
  msgid ""
  "each undeclared identifier is reported only once for each function it "
  "appears in"
  msgstr ""
  
! #: c/c-decl.c:3491 cp/decl.c:2838
  #, gcc-internal-format
  msgid "label %qE referenced outside of any function"
  msgstr ""
  
! #: c/c-decl.c:3527
  #, gcc-internal-format
  msgid "jump into scope of identifier with variably modified type"
  msgstr ""
  
! #: c/c-decl.c:3530
  #, gcc-internal-format
  msgid "jump skips variable initialization"
  msgstr ""
  
! #: c/c-decl.c:3531 c/c-decl.c:3586 c/c-decl.c:3675
  #, gcc-internal-format
  msgid "label %qD defined here"
  msgstr ""
  
! #: c/c-decl.c:3532 c/c-decl.c:3803 c/c-typeck.c:7634 cp/class.c:1435
! #: cp/class.c:3260 cp/decl.c:3631 cp/parser.c:5464
  #, gcc-internal-format
  msgid "%qD declared here"
  msgstr ""
  
! #: c/c-decl.c:3585 c/c-decl.c:3674
  #, gcc-internal-format
  msgid "jump into statement expression"
  msgstr ""
  
! #: c/c-decl.c:3607
  #, gcc-internal-format
  msgid "duplicate label declaration %qE"
  msgstr ""
  
! #: c/c-decl.c:3705 cp/decl.c:3182
  #, gcc-internal-format
  msgid "duplicate label %qD"
  msgstr ""
  
! #: c/c-decl.c:3736
  #, gcc-internal-format
  msgid ""
  "traditional C lacks a separate namespace for labels, identifier %qE conflicts"
  msgstr ""
  
! #: c/c-decl.c:3801
  #, gcc-internal-format
  msgid "switch jumps over variable initialization"
  msgstr ""
  
! #: c/c-decl.c:3802 c/c-decl.c:3813
  #, gcc-internal-format
  msgid "switch starts here"
  msgstr ""
  
! #: c/c-decl.c:3812
  #, gcc-internal-format
  msgid "switch jumps into statement expression"
  msgstr ""
  
! #: c/c-decl.c:3883
  #, gcc-internal-format
  msgid "%qE defined as wrong kind of tag"
  msgstr ""
  
! #: c/c-decl.c:4112
  #, gcc-internal-format
  msgid "unnamed struct/union that defines no instances"
  msgstr ""
  
! #: c/c-decl.c:4122
  #, gcc-internal-format
  msgid "empty declaration with storage class specifier does not redeclare tag"
  msgstr ""
  
! #: c/c-decl.c:4137
  #, gcc-internal-format
  msgid "empty declaration with type qualifier does not redeclare tag"
  msgstr ""
  
! #: c/c-decl.c:4148
  #, gcc-internal-format
  msgid "empty declaration with %<_Alignas%> does not redeclare tag"
  msgstr ""
  
! #: c/c-decl.c:4170 c/c-decl.c:4178
  #, gcc-internal-format
  msgid "useless type name in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4186
  #, gcc-internal-format
  msgid "%<inline%> in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4192
  #, gcc-internal-format
  msgid "%<_Noreturn%> in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4198
  #, gcc-internal-format
  msgid "%<auto%> in file-scope empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4204
  #, gcc-internal-format
  msgid "%<register%> in file-scope empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4211
  #, gcc-internal-format
  msgid "useless storage class specifier in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4217
  #, gcc-internal-format
  msgid "useless %qs in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4230
  #, gcc-internal-format
  msgid "useless type qualifier in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4237
  #, gcc-internal-format
  msgid "useless %<_Alignas%> in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4244 c/c-parser.c:1594
  #, gcc-internal-format
  msgid "empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4315
  #, gcc-internal-format
  msgid ""
  "ISO C90 does not support %<static%> or type qualifiers in parameter array "
  "declarators"
  msgstr ""
  
! #: c/c-decl.c:4319
  #, gcc-internal-format
  msgid "ISO C90 does not support %<[*]%> array declarators"
  msgstr ""
--- 29205,29423 ----
  msgid "redundant redeclaration of %q+D"
  msgstr ""
  
! #: c/c-decl.c:2806
  #, gcc-internal-format
  msgid "declaration of %q+D shadows previous non-variable"
  msgstr ""
  
! #: c/c-decl.c:2812
  #, gcc-internal-format
  msgid "declaration of %q+D shadows a parameter"
  msgstr ""
  
! #: c/c-decl.c:2824 cp/name-lookup.c:1284
  #, gcc-internal-format
  msgid "declaration of %qD shadows a global declaration"
  msgstr ""
  
! #: c/c-decl.c:2836
  #, gcc-internal-format
  msgid "declaration of %q+D shadows a previous local"
  msgstr ""
  
! #: c/c-decl.c:2841 cp/name-lookup.c:1227 cp/name-lookup.c:1269
  #: cp/name-lookup.c:1287
  #, gcc-internal-format
  msgid "shadowed declaration is here"
  msgstr ""
  
! #: c/c-decl.c:2968
  #, gcc-internal-format
  msgid "nested extern declaration of %qD"
  msgstr ""
  
! #: c/c-decl.c:3144 c/c-decl.c:3147
  #, gcc-internal-format
  msgid "implicit declaration of function %qE"
  msgstr ""
  
! #: c/c-decl.c:3393
  #, gcc-internal-format
  msgid "incompatible implicit declaration of built-in function %qD"
  msgstr ""
  
! #: c/c-decl.c:3400
  #, gcc-internal-format
  msgid "include %qs or provide a declaration of %qD"
  msgstr ""
  
! #: c/c-decl.c:3409
  #, gcc-internal-format
  msgid "incompatible implicit declaration of function %qD"
  msgstr ""
  
! #: c/c-decl.c:3463
  #, gcc-internal-format
  msgid "%qE undeclared here (not in a function)"
  msgstr ""
  
! #: c/c-decl.c:3469
  #, gcc-internal-format
  msgid "%qE undeclared (first use in this function)"
  msgstr ""
  
! #: c/c-decl.c:3472
  #, gcc-internal-format
  msgid ""
  "each undeclared identifier is reported only once for each function it "
  "appears in"
  msgstr ""
  
! #: c/c-decl.c:3520 cp/decl.c:2870
  #, gcc-internal-format
  msgid "label %qE referenced outside of any function"
  msgstr ""
  
! #: c/c-decl.c:3556
  #, gcc-internal-format
  msgid "jump into scope of identifier with variably modified type"
  msgstr ""
  
! #: c/c-decl.c:3559
  #, gcc-internal-format
  msgid "jump skips variable initialization"
  msgstr ""
  
! #: c/c-decl.c:3560 c/c-decl.c:3615 c/c-decl.c:3704
  #, gcc-internal-format
  msgid "label %qD defined here"
  msgstr ""
  
! #: c/c-decl.c:3561 c/c-decl.c:3832 c/c-typeck.c:7645 cp/class.c:1435
! #: cp/class.c:3269 cp/decl.c:3678 cp/parser.c:5465
  #, gcc-internal-format
  msgid "%qD declared here"
  msgstr ""
  
! #: c/c-decl.c:3614 c/c-decl.c:3703
  #, gcc-internal-format
  msgid "jump into statement expression"
  msgstr ""
  
! #: c/c-decl.c:3636
  #, gcc-internal-format
  msgid "duplicate label declaration %qE"
  msgstr ""
  
! #: c/c-decl.c:3734 cp/decl.c:3229
  #, gcc-internal-format
  msgid "duplicate label %qD"
  msgstr ""
  
! #: c/c-decl.c:3765
  #, gcc-internal-format
  msgid ""
  "traditional C lacks a separate namespace for labels, identifier %qE conflicts"
  msgstr ""
  
! #: c/c-decl.c:3830
  #, gcc-internal-format
  msgid "switch jumps over variable initialization"
  msgstr ""
  
! #: c/c-decl.c:3831 c/c-decl.c:3842
  #, gcc-internal-format
  msgid "switch starts here"
  msgstr ""
  
! #: c/c-decl.c:3841
  #, gcc-internal-format
  msgid "switch jumps into statement expression"
  msgstr ""
  
! #: c/c-decl.c:3912
  #, gcc-internal-format
  msgid "%qE defined as wrong kind of tag"
  msgstr ""
  
! #: c/c-decl.c:4141
  #, gcc-internal-format
  msgid "unnamed struct/union that defines no instances"
  msgstr ""
  
! #: c/c-decl.c:4151
  #, gcc-internal-format
  msgid "empty declaration with storage class specifier does not redeclare tag"
  msgstr ""
  
! #: c/c-decl.c:4166
  #, gcc-internal-format
  msgid "empty declaration with type qualifier does not redeclare tag"
  msgstr ""
  
! #: c/c-decl.c:4177
  #, gcc-internal-format
  msgid "empty declaration with %<_Alignas%> does not redeclare tag"
  msgstr ""
  
! #: c/c-decl.c:4199 c/c-decl.c:4207
  #, gcc-internal-format
  msgid "useless type name in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4215
  #, gcc-internal-format
  msgid "%<inline%> in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4221
  #, gcc-internal-format
  msgid "%<_Noreturn%> in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4227
  #, gcc-internal-format
  msgid "%<auto%> in file-scope empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4233
  #, gcc-internal-format
  msgid "%<register%> in file-scope empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4240
  #, gcc-internal-format
  msgid "useless storage class specifier in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4246
  #, gcc-internal-format
  msgid "useless %qs in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4259
  #, gcc-internal-format
  msgid "useless type qualifier in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4266
  #, gcc-internal-format
  msgid "useless %<_Alignas%> in empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4273 c/c-parser.c:1595
  #, gcc-internal-format
  msgid "empty declaration"
  msgstr ""
  
! #: c/c-decl.c:4344
  #, gcc-internal-format
  msgid ""
  "ISO C90 does not support %<static%> or type qualifiers in parameter array "
  "declarators"
  msgstr ""
  
! #: c/c-decl.c:4348
  #, gcc-internal-format
  msgid "ISO C90 does not support %<[*]%> array declarators"
  msgstr ""
*************** msgstr ""
*** 29242,29279 ****
  #. C99 6.7.5.2p4
  #. A function definition isn't function prototype scope C99 6.2.1p4.
  #. C99 6.7.5.2p4
! #: c/c-decl.c:4325 c/c-decl.c:6789
  #, gcc-internal-format
  msgid "%<[*]%> not allowed in other than function prototype scope"
  msgstr ""
  
! #: c/c-decl.c:4415 cp/decl2.c:1458
  #, gcc-internal-format
  msgid "%q+D in block scope inside of declare target directive"
  msgstr ""
  
! #: c/c-decl.c:4419 cp/decl2.c:1463
  #, gcc-internal-format
  msgid "%q+D in declare target directive does not have mappable type"
  msgstr ""
  
! #: c/c-decl.c:4468
  #, gcc-internal-format
  msgid "%q+D is usually a function"
  msgstr ""
  
! #: c/c-decl.c:4477
  #, gcc-internal-format
  msgid "typedef %qD is initialized (use __typeof__ instead)"
  msgstr ""
  
! #: c/c-decl.c:4482
  #, gcc-internal-format
  msgid "function %qD is initialized like a variable"
  msgstr ""
  
  #. DECL_INITIAL in a PARM_DECL is really DECL_ARG_TYPE.
! #: c/c-decl.c:4488
  #, gcc-internal-format
  msgid "parameter %qD is initialized"
  msgstr ""
--- 29425,29462 ----
  #. C99 6.7.5.2p4
  #. A function definition isn't function prototype scope C99 6.2.1p4.
  #. C99 6.7.5.2p4
! #: c/c-decl.c:4354 c/c-decl.c:6841
  #, gcc-internal-format
  msgid "%<[*]%> not allowed in other than function prototype scope"
  msgstr ""
  
! #: c/c-decl.c:4444 cp/decl2.c:1467
  #, gcc-internal-format
  msgid "%q+D in block scope inside of declare target directive"
  msgstr ""
  
! #: c/c-decl.c:4448 cp/decl2.c:1472
  #, gcc-internal-format
  msgid "%q+D in declare target directive does not have mappable type"
  msgstr ""
  
! #: c/c-decl.c:4497
  #, gcc-internal-format
  msgid "%q+D is usually a function"
  msgstr ""
  
! #: c/c-decl.c:4506
  #, gcc-internal-format
  msgid "typedef %qD is initialized (use __typeof__ instead)"
  msgstr ""
  
! #: c/c-decl.c:4511
  #, gcc-internal-format
  msgid "function %qD is initialized like a variable"
  msgstr ""
  
  #. DECL_INITIAL in a PARM_DECL is really DECL_ARG_TYPE.
! #: c/c-decl.c:4517
  #, gcc-internal-format
  msgid "parameter %qD is initialized"
  msgstr ""
*************** msgstr ""
*** 29282,29538 ****
  #. of VLAs themselves count as VLAs, it does not make
  #. sense to permit them to be initialized given that
  #. ordinary VLAs may not be initialized.
! #: c/c-decl.c:4507 c/c-decl.c:4522 c/c-typeck.c:6929
  #, gcc-internal-format
  msgid "variable-sized object may not be initialized"
  msgstr ""
  
! #: c/c-decl.c:4513
  #, gcc-internal-format
  msgid "variable %qD has initializer but incomplete type"
  msgstr ""
  
! #: c/c-decl.c:4602 cp/decl.c:4732 cp/decl.c:13377
  #, gcc-internal-format
  msgid "inline function %q+D given attribute noinline"
  msgstr ""
  
! #: c/c-decl.c:4653
  #, gcc-internal-format
  msgid "uninitialized const member in %qT is invalid in C++"
  msgstr ""
  
! #: c/c-decl.c:4655
  #, gcc-internal-format
  msgid "%qD should be initialized"
  msgstr ""
  
! #: c/c-decl.c:4733
  #, gcc-internal-format
  msgid "initializer fails to determine size of %q+D"
  msgstr ""
  
! #: c/c-decl.c:4738
  #, gcc-internal-format
  msgid "array size missing in %q+D"
  msgstr ""
  
! #: c/c-decl.c:4750
  #, gcc-internal-format
  msgid "zero or negative size array %q+D"
  msgstr ""
  
! #: c/c-decl.c:4816
  #, gcc-internal-format
  msgid "storage size of %q+D isn%'t constant"
  msgstr ""
  
! #: c/c-decl.c:4866
  #, gcc-internal-format
  msgid "ignoring asm-specifier for non-static local variable %q+D"
  msgstr ""
  
! #: c/c-decl.c:4896
  #, gcc-internal-format
  msgid "cannot put object with volatile field into register"
  msgstr ""
  
! #: c/c-decl.c:4983
  #, gcc-internal-format
  msgid "uninitialized const %qD is invalid in C++"
  msgstr ""
  
! #: c/c-decl.c:5041
  #, gcc-internal-format
  msgid "ISO C forbids forward parameter declarations"
  msgstr ""
  
! #: c/c-decl.c:5138
  #, gcc-internal-format
  msgid "defining a type in a compound literal is invalid in C++"
  msgstr ""
  
! #: c/c-decl.c:5190 c/c-decl.c:5205
  #, gcc-internal-format
  msgid "bit-field %qs width not an integer constant"
  msgstr ""
  
! #: c/c-decl.c:5200
  #, gcc-internal-format
  msgid "bit-field %qs width not an integer constant expression"
  msgstr ""
  
! #: c/c-decl.c:5211
  #, gcc-internal-format
  msgid "negative width in bit-field %qs"
  msgstr ""
  
! #: c/c-decl.c:5216
  #, gcc-internal-format
  msgid "zero width for bit-field %qs"
  msgstr ""
  
! #: c/c-decl.c:5226
  #, gcc-internal-format
  msgid "bit-field %qs has invalid type"
  msgstr ""
  
! #: c/c-decl.c:5236
  #, gcc-internal-format
  msgid "type of bit-field %qs is a GCC extension"
  msgstr ""
  
! #: c/c-decl.c:5242
  #, gcc-internal-format
  msgid "width of %qs exceeds its type"
  msgstr ""
  
! #: c/c-decl.c:5255
  #, gcc-internal-format
  msgid "%qs is narrower than values of its type"
  msgstr ""
  
! #: c/c-decl.c:5270
  #, gcc-internal-format
  msgid "ISO C90 forbids array %qE whose size can%'t be evaluated"
  msgstr ""
  
! #: c/c-decl.c:5273
  #, gcc-internal-format
  msgid "ISO C90 forbids array whose size can%'t be evaluated"
  msgstr ""
  
! #: c/c-decl.c:5280
  #, gcc-internal-format
  msgid "ISO C90 forbids variable length array %qE"
  msgstr ""
  
! #: c/c-decl.c:5282
  #, gcc-internal-format
  msgid "ISO C90 forbids variable length array"
  msgstr ""
  
! #: c/c-decl.c:5458 c/c-decl.c:5816 c/c-decl.c:5826
  #, gcc-internal-format
  msgid "variably modified %qE at file scope"
  msgstr ""
  
! #: c/c-decl.c:5460
  #, gcc-internal-format
  msgid "variably modified field at file scope"
  msgstr ""
  
! #: c/c-decl.c:5480
  #, gcc-internal-format
  msgid "type defaults to %<int%> in declaration of %qE"
  msgstr ""
  
! #: c/c-decl.c:5484
  #, gcc-internal-format
  msgid "type defaults to %<int%> in type name"
  msgstr ""
  
! #: c/c-decl.c:5516
  #, gcc-internal-format
  msgid "duplicate %<const%>"
  msgstr ""
  
! #: c/c-decl.c:5518
  #, gcc-internal-format
  msgid "duplicate %<restrict%>"
  msgstr ""
  
! #: c/c-decl.c:5520
  #, gcc-internal-format
  msgid "duplicate %<volatile%>"
  msgstr ""
  
! #: c/c-decl.c:5522
  #, gcc-internal-format
  msgid "duplicate %<_Atomic%>"
  msgstr ""
  
! #: c/c-decl.c:5525
  #, gcc-internal-format, gfc-internal-format
  msgid "conflicting named address spaces (%s vs %s)"
  msgstr ""
  
! #: c/c-decl.c:5543 c/c-parser.c:2460
  #, gcc-internal-format
  msgid "%<_Atomic%>-qualified array type"
  msgstr ""
  
! #: c/c-decl.c:5557
  #, gcc-internal-format
  msgid "function definition declared %<auto%>"
  msgstr ""
  
! #: c/c-decl.c:5559
  #, gcc-internal-format
  msgid "function definition declared %<register%>"
  msgstr ""
  
! #: c/c-decl.c:5561
  #, gcc-internal-format
  msgid "function definition declared %<typedef%>"
  msgstr ""
  
! #: c/c-decl.c:5563
  #, gcc-internal-format
  msgid "function definition declared %qs"
  msgstr ""
  
! #: c/c-decl.c:5581
  #, gcc-internal-format
  msgid "storage class specified for structure field %qE"
  msgstr ""
  
! #: c/c-decl.c:5584
  #, gcc-internal-format
  msgid "storage class specified for structure field"
  msgstr ""
  
! #: c/c-decl.c:5588
  #, gcc-internal-format
  msgid "storage class specified for parameter %qE"
  msgstr ""
  
! #: c/c-decl.c:5591
  #, gcc-internal-format
  msgid "storage class specified for unnamed parameter"
  msgstr ""
  
! #: c/c-decl.c:5594 cp/decl.c:9593
  #, gcc-internal-format
  msgid "storage class specified for typename"
  msgstr ""
  
! #: c/c-decl.c:5611
  #, gcc-internal-format
  msgid "%qE initialized and declared %<extern%>"
  msgstr ""
  
! #: c/c-decl.c:5615
  #, gcc-internal-format
  msgid "%qE has both %<extern%> and initializer"
  msgstr ""
  
! #: c/c-decl.c:5620
  #, gcc-internal-format
  msgid "file-scope declaration of %qE specifies %<auto%>"
  msgstr ""
  
! #: c/c-decl.c:5624
  #, gcc-internal-format
  msgid "file-scope declaration of %qE specifies %<register%>"
  msgstr ""
  
! #: c/c-decl.c:5629
  #, gcc-internal-format
  msgid "nested function %qE declared %<extern%>"
  msgstr ""
  
! #: c/c-decl.c:5632
  #, gcc-internal-format
  msgid "function-scope %qE implicitly auto and declared %qs"
  msgstr ""
--- 29465,29721 ----
  #. of VLAs themselves count as VLAs, it does not make
  #. sense to permit them to be initialized given that
  #. ordinary VLAs may not be initialized.
! #: c/c-decl.c:4536 c/c-decl.c:4551 c/c-typeck.c:6943
  #, gcc-internal-format
  msgid "variable-sized object may not be initialized"
  msgstr ""
  
! #: c/c-decl.c:4542
  #, gcc-internal-format
  msgid "variable %qD has initializer but incomplete type"
  msgstr ""
  
! #: c/c-decl.c:4631 cp/decl.c:4779 cp/decl.c:13428
  #, gcc-internal-format
  msgid "inline function %q+D given attribute noinline"
  msgstr ""
  
! #: c/c-decl.c:4682
  #, gcc-internal-format
  msgid "uninitialized const member in %qT is invalid in C++"
  msgstr ""
  
! #: c/c-decl.c:4684
  #, gcc-internal-format
  msgid "%qD should be initialized"
  msgstr ""
  
! #: c/c-decl.c:4762
  #, gcc-internal-format
  msgid "initializer fails to determine size of %q+D"
  msgstr ""
  
! #: c/c-decl.c:4767
  #, gcc-internal-format
  msgid "array size missing in %q+D"
  msgstr ""
  
! #: c/c-decl.c:4779
  #, gcc-internal-format
  msgid "zero or negative size array %q+D"
  msgstr ""
  
! #: c/c-decl.c:4845
  #, gcc-internal-format
  msgid "storage size of %q+D isn%'t constant"
  msgstr ""
  
! #: c/c-decl.c:4895
  #, gcc-internal-format
  msgid "ignoring asm-specifier for non-static local variable %q+D"
  msgstr ""
  
! #: c/c-decl.c:4925
  #, gcc-internal-format
  msgid "cannot put object with volatile field into register"
  msgstr ""
  
! #: c/c-decl.c:5012
  #, gcc-internal-format
  msgid "uninitialized const %qD is invalid in C++"
  msgstr ""
  
! #: c/c-decl.c:5070
  #, gcc-internal-format
  msgid "ISO C forbids forward parameter declarations"
  msgstr ""
  
! #: c/c-decl.c:5167
  #, gcc-internal-format
  msgid "defining a type in a compound literal is invalid in C++"
  msgstr ""
  
! #: c/c-decl.c:5219 c/c-decl.c:5234
  #, gcc-internal-format
  msgid "bit-field %qs width not an integer constant"
  msgstr ""
  
! #: c/c-decl.c:5229
  #, gcc-internal-format
  msgid "bit-field %qs width not an integer constant expression"
  msgstr ""
  
! #: c/c-decl.c:5240
  #, gcc-internal-format
  msgid "negative width in bit-field %qs"
  msgstr ""
  
! #: c/c-decl.c:5245
  #, gcc-internal-format
  msgid "zero width for bit-field %qs"
  msgstr ""
  
! #: c/c-decl.c:5255
  #, gcc-internal-format
  msgid "bit-field %qs has invalid type"
  msgstr ""
  
! #: c/c-decl.c:5265
  #, gcc-internal-format
  msgid "type of bit-field %qs is a GCC extension"
  msgstr ""
  
! #: c/c-decl.c:5271
  #, gcc-internal-format
  msgid "width of %qs exceeds its type"
  msgstr ""
  
! #: c/c-decl.c:5284
  #, gcc-internal-format
  msgid "%qs is narrower than values of its type"
  msgstr ""
  
! #: c/c-decl.c:5299
  #, gcc-internal-format
  msgid "ISO C90 forbids array %qE whose size can%'t be evaluated"
  msgstr ""
  
! #: c/c-decl.c:5302
  #, gcc-internal-format
  msgid "ISO C90 forbids array whose size can%'t be evaluated"
  msgstr ""
  
! #: c/c-decl.c:5309
  #, gcc-internal-format
  msgid "ISO C90 forbids variable length array %qE"
  msgstr ""
  
! #: c/c-decl.c:5311
  #, gcc-internal-format
  msgid "ISO C90 forbids variable length array"
  msgstr ""
  
! #: c/c-decl.c:5489 c/c-decl.c:5852 c/c-decl.c:5862
  #, gcc-internal-format
  msgid "variably modified %qE at file scope"
  msgstr ""
  
! #: c/c-decl.c:5491
  #, gcc-internal-format
  msgid "variably modified field at file scope"
  msgstr ""
  
! #: c/c-decl.c:5511
  #, gcc-internal-format
  msgid "type defaults to %<int%> in declaration of %qE"
  msgstr ""
  
! #: c/c-decl.c:5515
  #, gcc-internal-format
  msgid "type defaults to %<int%> in type name"
  msgstr ""
  
! #: c/c-decl.c:5547
  #, gcc-internal-format
  msgid "duplicate %<const%>"
  msgstr ""
  
! #: c/c-decl.c:5549
  #, gcc-internal-format
  msgid "duplicate %<restrict%>"
  msgstr ""
  
! #: c/c-decl.c:5551
  #, gcc-internal-format
  msgid "duplicate %<volatile%>"
  msgstr ""
  
! #: c/c-decl.c:5553
  #, gcc-internal-format
  msgid "duplicate %<_Atomic%>"
  msgstr ""
  
! #: c/c-decl.c:5556
  #, gcc-internal-format, gfc-internal-format
  msgid "conflicting named address spaces (%s vs %s)"
  msgstr ""
  
! #: c/c-decl.c:5579 c/c-parser.c:2461
  #, gcc-internal-format
  msgid "%<_Atomic%>-qualified array type"
  msgstr ""
  
! #: c/c-decl.c:5593
  #, gcc-internal-format
  msgid "function definition declared %<auto%>"
  msgstr ""
  
! #: c/c-decl.c:5595
  #, gcc-internal-format
  msgid "function definition declared %<register%>"
  msgstr ""
  
! #: c/c-decl.c:5597
  #, gcc-internal-format
  msgid "function definition declared %<typedef%>"
  msgstr ""
  
! #: c/c-decl.c:5599
  #, gcc-internal-format
  msgid "function definition declared %qs"
  msgstr ""
  
! #: c/c-decl.c:5617
  #, gcc-internal-format
  msgid "storage class specified for structure field %qE"
  msgstr ""
  
! #: c/c-decl.c:5620
  #, gcc-internal-format
  msgid "storage class specified for structure field"
  msgstr ""
  
! #: c/c-decl.c:5624
  #, gcc-internal-format
  msgid "storage class specified for parameter %qE"
  msgstr ""
  
! #: c/c-decl.c:5627
  #, gcc-internal-format
  msgid "storage class specified for unnamed parameter"
  msgstr ""
  
! #: c/c-decl.c:5630 cp/decl.c:9644
  #, gcc-internal-format
  msgid "storage class specified for typename"
  msgstr ""
  
! #: c/c-decl.c:5647
  #, gcc-internal-format
  msgid "%qE initialized and declared %<extern%>"
  msgstr ""
  
! #: c/c-decl.c:5651
  #, gcc-internal-format
  msgid "%qE has both %<extern%> and initializer"
  msgstr ""
  
! #: c/c-decl.c:5656
  #, gcc-internal-format
  msgid "file-scope declaration of %qE specifies %<auto%>"
  msgstr ""
  
! #: c/c-decl.c:5660
  #, gcc-internal-format
  msgid "file-scope declaration of %qE specifies %<register%>"
  msgstr ""
  
! #: c/c-decl.c:5665
  #, gcc-internal-format
  msgid "nested function %qE declared %<extern%>"
  msgstr ""
  
! #: c/c-decl.c:5668
  #, gcc-internal-format
  msgid "function-scope %qE implicitly auto and declared %qs"
  msgstr ""
*************** msgstr ""
*** 29540,30224 ****
  #. Only the innermost declarator (making a parameter be of
  #. array type which is converted to pointer type)
  #. may have static or type qualifiers.
! #: c/c-decl.c:5679 c/c-decl.c:6022
  #, gcc-internal-format
  msgid "static or type qualifiers in non-parameter array declarator"
  msgstr ""
  
! #: c/c-decl.c:5727
  #, gcc-internal-format
  msgid "declaration of %qE as array of voids"
  msgstr ""
  
! #: c/c-decl.c:5729
  #, gcc-internal-format
  msgid "declaration of type name as array of voids"
  msgstr ""
  
! #: c/c-decl.c:5736
  #, gcc-internal-format
  msgid "declaration of %qE as array of functions"
  msgstr ""
  
! #: c/c-decl.c:5739
  #, gcc-internal-format
  msgid "declaration of type name as array of functions"
  msgstr ""
  
! #: c/c-decl.c:5747 c/c-decl.c:7710
  #, gcc-internal-format
  msgid "invalid use of structure with flexible array member"
  msgstr ""
  
! #: c/c-decl.c:5773
  #, gcc-internal-format
  msgid "size of array %qE has non-integer type"
  msgstr ""
  
! #: c/c-decl.c:5777
  #, gcc-internal-format
  msgid "size of unnamed array has non-integer type"
  msgstr ""
  
! #: c/c-decl.c:5787
  #, gcc-internal-format
  msgid "ISO C forbids zero-size array %qE"
  msgstr ""
  
! #: c/c-decl.c:5790
  #, gcc-internal-format
  msgid "ISO C forbids zero-size array"
  msgstr ""
  
! #: c/c-decl.c:5799
  #, gcc-internal-format
  msgid "size of array %qE is negative"
  msgstr ""
  
! #: c/c-decl.c:5801
  #, gcc-internal-format
  msgid "size of unnamed array is negative"
  msgstr ""
  
! #: c/c-decl.c:5886 c/c-decl.c:6309
  #, gcc-internal-format
  msgid "size of array %qE is too large"
  msgstr ""
  
! #: c/c-decl.c:5889 c/c-decl.c:6311
  #, gcc-internal-format
  msgid "size of unnamed array is too large"
  msgstr ""
  
! #: c/c-decl.c:5925 c/c-decl.c:6520
  #, gcc-internal-format
  msgid "ISO C90 does not support flexible array members"
  msgstr ""
  
  #. C99 6.7.5.2p4
! #: c/c-decl.c:5947
  #, gcc-internal-format
  msgid "%<[*]%> not in a declaration"
  msgstr ""
  
! #: c/c-decl.c:5960
  #, gcc-internal-format
  msgid "array type has incomplete element type %qT"
  msgstr ""
  
! #: c/c-decl.c:6055
  #, gcc-internal-format
  msgid "%qE declared as function returning a function"
  msgstr ""
  
! #: c/c-decl.c:6058
  #, gcc-internal-format
  msgid "type name declared as function returning a function"
  msgstr ""
  
! #: c/c-decl.c:6065
  #, gcc-internal-format
  msgid "%qE declared as function returning an array"
  msgstr ""
  
! #: c/c-decl.c:6068
  #, gcc-internal-format
  msgid "type name declared as function returning an array"
  msgstr ""
  
! #: c/c-decl.c:6096
  #, gcc-internal-format
  msgid "function definition has qualified void return type"
  msgstr ""
  
! #: c/c-decl.c:6099 cp/decl.c:9720
  #, gcc-internal-format
  msgid "type qualifiers ignored on function return type"
  msgstr ""
  
! #: c/c-decl.c:6128 c/c-decl.c:6326 c/c-decl.c:6379 c/c-decl.c:6454
! #: c/c-decl.c:6569 c/c-parser.c:2462
  #, gcc-internal-format
  msgid "%<_Atomic%>-qualified function type"
  msgstr ""
  
! #: c/c-decl.c:6134 c/c-decl.c:6332 c/c-decl.c:6459 c/c-decl.c:6574
  #, gcc-internal-format
  msgid "ISO C forbids qualified function types"
  msgstr ""
  
! #: c/c-decl.c:6201
  #, gcc-internal-format
  msgid "%qs combined with %<auto%> qualifier for %qE"
  msgstr ""
  
! #: c/c-decl.c:6205
  #, gcc-internal-format
  msgid "%qs combined with %<register%> qualifier for %qE"
  msgstr ""
  
! #: c/c-decl.c:6211
  #, gcc-internal-format
  msgid "%qs specified for auto variable %qE"
  msgstr ""
  
! #: c/c-decl.c:6227
  #, gcc-internal-format
  msgid "%qs specified for parameter %qE"
  msgstr ""
  
! #: c/c-decl.c:6230
  #, gcc-internal-format
  msgid "%qs specified for unnamed parameter"
  msgstr ""
  
! #: c/c-decl.c:6236
  #, gcc-internal-format
  msgid "%qs specified for structure field %qE"
  msgstr ""
  
! #: c/c-decl.c:6239
  #, gcc-internal-format
  msgid "%qs specified for structure field"
  msgstr ""
  
! #: c/c-decl.c:6254
  #, gcc-internal-format
  msgid "bit-field %qE has atomic type"
  msgstr ""
  
! #: c/c-decl.c:6256
  #, gcc-internal-format
  msgid "bit-field has atomic type"
  msgstr ""
  
! #: c/c-decl.c:6265
  #, gcc-internal-format
  msgid "alignment specified for typedef %qE"
  msgstr ""
  
! #: c/c-decl.c:6267
  #, gcc-internal-format
  msgid "alignment specified for %<register%> object %qE"
  msgstr ""
  
! #: c/c-decl.c:6272
  #, gcc-internal-format
  msgid "alignment specified for parameter %qE"
  msgstr ""
  
! #: c/c-decl.c:6274
  #, gcc-internal-format
  msgid "alignment specified for unnamed parameter"
  msgstr ""
  
! #: c/c-decl.c:6279
  #, gcc-internal-format
  msgid "alignment specified for bit-field %qE"
  msgstr ""
  
! #: c/c-decl.c:6281
  #, gcc-internal-format
  msgid "alignment specified for unnamed bit-field"
  msgstr ""
  
! #: c/c-decl.c:6284
  #, gcc-internal-format
  msgid "alignment specified for function %qE"
  msgstr ""
  
! #: c/c-decl.c:6291
  #, gcc-internal-format
  msgid "%<_Alignas%> specifiers cannot reduce alignment of %qE"
  msgstr ""
  
! #: c/c-decl.c:6294
  #, gcc-internal-format
  msgid "%<_Alignas%> specifiers cannot reduce alignment of unnamed field"
  msgstr ""
  
! #: c/c-decl.c:6340
  #, gcc-internal-format
  msgid "typedef %q+D declared %<inline%>"
  msgstr ""
  
! #: c/c-decl.c:6342
  #, gcc-internal-format
  msgid "typedef %q+D declared %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6385
  #, gcc-internal-format
  msgid "ISO C forbids const or volatile function types"
  msgstr ""
  
  #. C99 6.7.2.1p8
! #: c/c-decl.c:6395
  #, gcc-internal-format
  msgid "a member of a structure or union cannot have a variably modified type"
  msgstr ""
  
! #: c/c-decl.c:6412 cp/decl.c:8828
  #, gcc-internal-format
  msgid "variable or field %qE declared void"
  msgstr ""
  
! #: c/c-decl.c:6444
  #, gcc-internal-format
  msgid "attributes in parameter array declarator ignored"
  msgstr ""
  
! #: c/c-decl.c:6486
  #, gcc-internal-format
  msgid "parameter %q+D declared %<inline%>"
  msgstr ""
  
! #: c/c-decl.c:6488
  #, gcc-internal-format
  msgid "parameter %q+D declared %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6501
  #, gcc-internal-format
  msgid "field %qE declared as a function"
  msgstr ""
  
! #: c/c-decl.c:6508
  #, gcc-internal-format
  msgid "field %qE has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:6510
  #, gcc-internal-format
  msgid "unnamed field has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:6540 c/c-decl.c:6551 c/c-decl.c:6554
  #, gcc-internal-format
  msgid "invalid storage class for function %qE"
  msgstr ""
  
! #: c/c-decl.c:6611
  #, gcc-internal-format
  msgid "cannot inline function %<main%>"
  msgstr ""
  
! #: c/c-decl.c:6613
  #, gcc-internal-format
  msgid "%<main%> declared %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6624
  #, gcc-internal-format
  msgid "ISO C99 does not support %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6627
  #, gcc-internal-format
  msgid "ISO C90 does not support %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6655
  #, gcc-internal-format
  msgid "variable previously declared %<static%> redeclared %<extern%>"
  msgstr ""
  
! #: c/c-decl.c:6665
  #, gcc-internal-format
  msgid "variable %q+D declared %<inline%>"
  msgstr ""
  
! #: c/c-decl.c:6667
  #, gcc-internal-format
  msgid "variable %q+D declared %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6702
  #, gcc-internal-format
  msgid "non-nested function with variably modified type"
  msgstr ""
  
! #: c/c-decl.c:6704
  #, gcc-internal-format
  msgid "object with variably modified type must have no linkage"
  msgstr ""
  
! #: c/c-decl.c:6795 c/c-decl.c:8353
  #, gcc-internal-format
  msgid "function declaration isn%'t a prototype"
  msgstr ""
  
! #: c/c-decl.c:6804
  #, gcc-internal-format
  msgid "parameter names (without types) in function declaration"
  msgstr ""
  
! #: c/c-decl.c:6842
  #, gcc-internal-format
  msgid "parameter %u (%q+D) has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:6846
  #, gcc-internal-format, gfc-internal-format
  msgid "parameter %u has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:6857
  #, gcc-internal-format
  msgid "parameter %u (%q+D) has void type"
  msgstr ""
  
! #: c/c-decl.c:6861
  #, gcc-internal-format, gfc-internal-format
  msgid "parameter %u has void type"
  msgstr ""
  
! #: c/c-decl.c:6945
  #, gcc-internal-format
  msgid "%<void%> as only parameter may not be qualified"
  msgstr ""
  
! #: c/c-decl.c:6949 c/c-decl.c:6984
  #, gcc-internal-format
  msgid "%<void%> must be the only parameter"
  msgstr ""
  
! #: c/c-decl.c:6978
  #, gcc-internal-format
  msgid "parameter %q+D has just a forward declaration"
  msgstr ""
  
  #. The %s will be one of 'struct', 'union', or 'enum'.
! #: c/c-decl.c:7023
  #, gcc-internal-format
  msgid "%<%s %E%> declared inside parameter list"
  msgstr ""
  
  #. The %s will be one of 'struct', 'union', or 'enum'.
! #: c/c-decl.c:7027
  #, gcc-internal-format, gfc-internal-format
  msgid "anonymous %s declared inside parameter list"
  msgstr ""
  
! #: c/c-decl.c:7032
  #, gcc-internal-format
  msgid ""
  "its scope is only this definition or declaration, which is probably not what "
  "you want"
  msgstr ""
  
! #: c/c-decl.c:7132
  #, gcc-internal-format
  msgid "enum type defined here"
  msgstr ""
  
! #: c/c-decl.c:7138
  #, gcc-internal-format
  msgid "struct defined here"
  msgstr ""
  
! #: c/c-decl.c:7144
  #, gcc-internal-format
  msgid "union defined here"
  msgstr ""
  
! #: c/c-decl.c:7217
  #, gcc-internal-format
  msgid "redefinition of %<union %E%>"
  msgstr ""
  
! #: c/c-decl.c:7219
  #, gcc-internal-format
  msgid "redefinition of %<struct %E%>"
  msgstr ""
  
! #: c/c-decl.c:7228
  #, gcc-internal-format
  msgid "nested redefinition of %<union %E%>"
  msgstr ""
  
! #: c/c-decl.c:7230
  #, gcc-internal-format
  msgid "nested redefinition of %<struct %E%>"
  msgstr ""
  
! #: c/c-decl.c:7262 c/c-decl.c:7948
  #, gcc-internal-format
  msgid "defining type in %qs expression is invalid in C++"
  msgstr ""
  
! #: c/c-decl.c:7331 cp/decl.c:4448
  #, gcc-internal-format
  msgid "declaration does not declare anything"
  msgstr ""
  
! #: c/c-decl.c:7336
  #, gcc-internal-format
  msgid "ISO C99 doesn%'t support unnamed structs/unions"
  msgstr ""
  
! #: c/c-decl.c:7339
  #, gcc-internal-format
  msgid "ISO C90 doesn%'t support unnamed structs/unions"
  msgstr ""
  
! #: c/c-decl.c:7430 c/c-decl.c:7449 c/c-decl.c:7512
  #, gcc-internal-format
  msgid "duplicate member %q+D"
  msgstr ""
  
! #: c/c-decl.c:7618
  #, gcc-internal-format
  msgid "union has no named members"
  msgstr ""
  
! #: c/c-decl.c:7620
  #, gcc-internal-format
  msgid "union has no members"
  msgstr ""
  
! #: c/c-decl.c:7625
  #, gcc-internal-format
  msgid "struct has no named members"
  msgstr ""
  
! #: c/c-decl.c:7627
  #, gcc-internal-format
  msgid "struct has no members"
  msgstr ""
  
! #: c/c-decl.c:7690
  #, gcc-internal-format
  msgid "flexible array member in union"
  msgstr ""
  
! #: c/c-decl.c:7696
  #, gcc-internal-format
  msgid "flexible array member not at end of struct"
  msgstr ""
  
! #: c/c-decl.c:7702
  #, gcc-internal-format
  msgid "flexible array member in otherwise empty struct"
  msgstr ""
  
! #: c/c-decl.c:7731 cp/class.c:6493
  #, gcc-internal-format
  msgid "type %qT is too large"
  msgstr ""
  
! #: c/c-decl.c:7827
  #, gcc-internal-format
  msgid "union cannot be made transparent"
  msgstr ""
  
! #: c/c-decl.c:7921
  #, gcc-internal-format
  msgid "nested redefinition of %<enum %E%>"
  msgstr ""
  
  #. This enum is a named one that has been declared already.
! #: c/c-decl.c:7928
  #, gcc-internal-format
  msgid "redeclaration of %<enum %E%>"
  msgstr ""
  
! #: c/c-decl.c:8004
  #, gcc-internal-format
! msgid "enumeration values exceed range of largest integer"
  msgstr ""
  
! #: c/c-decl.c:8021
  #, gcc-internal-format
! msgid "specified mode too small for enumeral values"
  msgstr ""
  
! #: c/c-decl.c:8126 c/c-decl.c:8142
  #, gcc-internal-format
  msgid "enumerator value for %qE is not an integer constant"
  msgstr ""
  
! #: c/c-decl.c:8137
  #, gcc-internal-format
  msgid "enumerator value for %qE is not an integer constant expression"
  msgstr ""
  
! #: c/c-decl.c:8161
  #, gcc-internal-format
  msgid "overflow in enumeration values"
  msgstr ""
  
! #: c/c-decl.c:8169
  #, gcc-internal-format
  msgid "ISO C restricts enumerator values to range of %<int%>"
  msgstr ""
  
! #: c/c-decl.c:8254
  #, gcc-internal-format
  msgid "inline function %qD given attribute noinline"
  msgstr ""
  
! #: c/c-decl.c:8272
  #, gcc-internal-format
  msgid "return type is an incomplete type"
  msgstr ""
  
! #: c/c-decl.c:8283
  #, gcc-internal-format
  msgid "return type defaults to %<int%>"
  msgstr ""
  
! #: c/c-decl.c:8362
  #, gcc-internal-format
  msgid "no previous prototype for %qD"
  msgstr ""
  
! #: c/c-decl.c:8371
  #, gcc-internal-format
  msgid "%qD was used with no prototype before its definition"
  msgstr ""
  
! #: c/c-decl.c:8379
  #, gcc-internal-format
  msgid "no previous declaration for %qD"
  msgstr ""
  
! #: c/c-decl.c:8389
  #, gcc-internal-format
  msgid "%qD was used with no declaration before its definition"
  msgstr ""
  
! #: c/c-decl.c:8408
  #, gcc-internal-format
  msgid "return type of %qD is not %<int%>"
  msgstr ""
  
! #: c/c-decl.c:8410
  #, gcc-internal-format
  msgid "%<_Atomic%>-qualified return type of %qD"
  msgstr ""
  
! #: c/c-decl.c:8417
  #, gcc-internal-format
  msgid "%qD is normally a non-static function"
  msgstr ""
  
! #: c/c-decl.c:8454
  #, gcc-internal-format
  msgid "old-style parameter declarations in prototyped function definition"
  msgstr ""
  
! #: c/c-decl.c:8469
  #, gcc-internal-format
  msgid "traditional C rejects ISO C style function definitions"
  msgstr ""
  
! #: c/c-decl.c:8485
  #, gcc-internal-format
  msgid "parameter name omitted"
  msgstr ""
  
! #: c/c-decl.c:8522
  #, gcc-internal-format
  msgid "old-style function definition"
  msgstr ""
  
! #: c/c-decl.c:8531
  #, gcc-internal-format
  msgid "parameter name missing from parameter list"
  msgstr ""
  
! #: c/c-decl.c:8546
  #, gcc-internal-format
  msgid "%qD declared as a non-parameter"
  msgstr ""
  
! #: c/c-decl.c:8552
  #, gcc-internal-format
  msgid "multiple parameters named %qD"
  msgstr ""
  
! #: c/c-decl.c:8561
  #, gcc-internal-format
  msgid "parameter %qD declared with void type"
  msgstr ""
  
! #: c/c-decl.c:8590 c/c-decl.c:8595
  #, gcc-internal-format
  msgid "type of %qD defaults to %<int%>"
  msgstr ""
  
! #: c/c-decl.c:8615
  #, gcc-internal-format
  msgid "parameter %qD has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:8622
  #, gcc-internal-format
  msgid "declaration for parameter %qD but no such parameter"
  msgstr ""
  
! #: c/c-decl.c:8672
  #, gcc-internal-format
  msgid "number of arguments doesn%'t match built-in prototype"
  msgstr ""
  
! #: c/c-decl.c:8683
  #, gcc-internal-format
  msgid "number of arguments doesn%'t match prototype"
  msgstr ""
  
! #: c/c-decl.c:8686 c/c-decl.c:8733 c/c-decl.c:8747
  #, gcc-internal-format
  msgid "prototype declaration"
  msgstr ""
  
! #: c/c-decl.c:8725
  #, gcc-internal-format
  msgid "promoted argument %qD doesn%'t match built-in prototype"
  msgstr ""
  
! #: c/c-decl.c:8730
  #, gcc-internal-format
  msgid "promoted argument %qD doesn%'t match prototype"
  msgstr ""
  
! #: c/c-decl.c:8740
  #, gcc-internal-format
  msgid "argument %qD doesn%'t match built-in prototype"
  msgstr ""
  
! #: c/c-decl.c:8745
  #, gcc-internal-format
  msgid "argument %qD doesn%'t match prototype"
  msgstr ""
  
! #: c/c-decl.c:8972 cp/decl.c:14284
  #, gcc-internal-format
  msgid "no return statement in function returning non-void"
  msgstr ""
  
! #: c/c-decl.c:8992
  #, gcc-internal-format
  msgid "parameter %qD set but not used"
  msgstr ""
--- 29723,30407 ----
  #. Only the innermost declarator (making a parameter be of
  #. array type which is converted to pointer type)
  #. may have static or type qualifiers.
! #: c/c-decl.c:5715 c/c-decl.c:6058
  #, gcc-internal-format
  msgid "static or type qualifiers in non-parameter array declarator"
  msgstr ""
  
! #: c/c-decl.c:5763
  #, gcc-internal-format
  msgid "declaration of %qE as array of voids"
  msgstr ""
  
! #: c/c-decl.c:5765
  #, gcc-internal-format
  msgid "declaration of type name as array of voids"
  msgstr ""
  
! #: c/c-decl.c:5772
  #, gcc-internal-format
  msgid "declaration of %qE as array of functions"
  msgstr ""
  
! #: c/c-decl.c:5775
  #, gcc-internal-format
  msgid "declaration of type name as array of functions"
  msgstr ""
  
! #: c/c-decl.c:5783 c/c-decl.c:7762
  #, gcc-internal-format
  msgid "invalid use of structure with flexible array member"
  msgstr ""
  
! #: c/c-decl.c:5809
  #, gcc-internal-format
  msgid "size of array %qE has non-integer type"
  msgstr ""
  
! #: c/c-decl.c:5813
  #, gcc-internal-format
  msgid "size of unnamed array has non-integer type"
  msgstr ""
  
! #: c/c-decl.c:5823
  #, gcc-internal-format
  msgid "ISO C forbids zero-size array %qE"
  msgstr ""
  
! #: c/c-decl.c:5826
  #, gcc-internal-format
  msgid "ISO C forbids zero-size array"
  msgstr ""
  
! #: c/c-decl.c:5835
  #, gcc-internal-format
  msgid "size of array %qE is negative"
  msgstr ""
  
! #: c/c-decl.c:5837
  #, gcc-internal-format
  msgid "size of unnamed array is negative"
  msgstr ""
  
! #: c/c-decl.c:5922 c/c-decl.c:6349
  #, gcc-internal-format
  msgid "size of array %qE is too large"
  msgstr ""
  
! #: c/c-decl.c:5925 c/c-decl.c:6351
  #, gcc-internal-format
  msgid "size of unnamed array is too large"
  msgstr ""
  
! #: c/c-decl.c:5961 c/c-decl.c:6570
  #, gcc-internal-format
  msgid "ISO C90 does not support flexible array members"
  msgstr ""
  
  #. C99 6.7.5.2p4
! #: c/c-decl.c:5983
  #, gcc-internal-format
  msgid "%<[*]%> not in a declaration"
  msgstr ""
  
! #: c/c-decl.c:5996
  #, gcc-internal-format
  msgid "array type has incomplete element type %qT"
  msgstr ""
  
! #: c/c-decl.c:6093
  #, gcc-internal-format
  msgid "%qE declared as function returning a function"
  msgstr ""
  
! #: c/c-decl.c:6096
  #, gcc-internal-format
  msgid "type name declared as function returning a function"
  msgstr ""
  
! #: c/c-decl.c:6103
  #, gcc-internal-format
  msgid "%qE declared as function returning an array"
  msgstr ""
  
! #: c/c-decl.c:6106
  #, gcc-internal-format
  msgid "type name declared as function returning an array"
  msgstr ""
  
! #: c/c-decl.c:6134
  #, gcc-internal-format
  msgid "function definition has qualified void return type"
  msgstr ""
  
! #: c/c-decl.c:6137 cp/decl.c:9771
  #, gcc-internal-format
  msgid "type qualifiers ignored on function return type"
  msgstr ""
  
! #: c/c-decl.c:6166 c/c-decl.c:6366 c/c-decl.c:6420 c/c-decl.c:6504
! #: c/c-decl.c:6620 c/c-parser.c:2463
  #, gcc-internal-format
  msgid "%<_Atomic%>-qualified function type"
  msgstr ""
  
! #: c/c-decl.c:6172 c/c-decl.c:6372 c/c-decl.c:6509 c/c-decl.c:6625
  #, gcc-internal-format
  msgid "ISO C forbids qualified function types"
  msgstr ""
  
! #: c/c-decl.c:6241
  #, gcc-internal-format
  msgid "%qs combined with %<auto%> qualifier for %qE"
  msgstr ""
  
! #: c/c-decl.c:6245
  #, gcc-internal-format
  msgid "%qs combined with %<register%> qualifier for %qE"
  msgstr ""
  
! #: c/c-decl.c:6251
  #, gcc-internal-format
  msgid "%qs specified for auto variable %qE"
  msgstr ""
  
! #: c/c-decl.c:6267
  #, gcc-internal-format
  msgid "%qs specified for parameter %qE"
  msgstr ""
  
! #: c/c-decl.c:6270
  #, gcc-internal-format
  msgid "%qs specified for unnamed parameter"
  msgstr ""
  
! #: c/c-decl.c:6276
  #, gcc-internal-format
  msgid "%qs specified for structure field %qE"
  msgstr ""
  
! #: c/c-decl.c:6279
  #, gcc-internal-format
  msgid "%qs specified for structure field"
  msgstr ""
  
! #: c/c-decl.c:6294
  #, gcc-internal-format
  msgid "bit-field %qE has atomic type"
  msgstr ""
  
! #: c/c-decl.c:6296
  #, gcc-internal-format
  msgid "bit-field has atomic type"
  msgstr ""
  
! #: c/c-decl.c:6305
  #, gcc-internal-format
  msgid "alignment specified for typedef %qE"
  msgstr ""
  
! #: c/c-decl.c:6307
  #, gcc-internal-format
  msgid "alignment specified for %<register%> object %qE"
  msgstr ""
  
! #: c/c-decl.c:6312
  #, gcc-internal-format
  msgid "alignment specified for parameter %qE"
  msgstr ""
  
! #: c/c-decl.c:6314
  #, gcc-internal-format
  msgid "alignment specified for unnamed parameter"
  msgstr ""
  
! #: c/c-decl.c:6319
  #, gcc-internal-format
  msgid "alignment specified for bit-field %qE"
  msgstr ""
  
! #: c/c-decl.c:6321
  #, gcc-internal-format
  msgid "alignment specified for unnamed bit-field"
  msgstr ""
  
! #: c/c-decl.c:6324
  #, gcc-internal-format
  msgid "alignment specified for function %qE"
  msgstr ""
  
! #: c/c-decl.c:6331
  #, gcc-internal-format
  msgid "%<_Alignas%> specifiers cannot reduce alignment of %qE"
  msgstr ""
  
! #: c/c-decl.c:6334
  #, gcc-internal-format
  msgid "%<_Alignas%> specifiers cannot reduce alignment of unnamed field"
  msgstr ""
  
! #: c/c-decl.c:6381
  #, gcc-internal-format
  msgid "typedef %q+D declared %<inline%>"
  msgstr ""
  
! #: c/c-decl.c:6383
  #, gcc-internal-format
  msgid "typedef %q+D declared %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6426
  #, gcc-internal-format
  msgid "ISO C forbids const or volatile function types"
  msgstr ""
  
  #. C99 6.7.2.1p8
! #: c/c-decl.c:6437
  #, gcc-internal-format
  msgid "a member of a structure or union cannot have a variably modified type"
  msgstr ""
  
! #: c/c-decl.c:6454 cp/decl.c:8879
  #, gcc-internal-format
  msgid "variable or field %qE declared void"
  msgstr ""
  
! #: c/c-decl.c:6494
  #, gcc-internal-format
  msgid "attributes in parameter array declarator ignored"
  msgstr ""
  
! #: c/c-decl.c:6536
  #, gcc-internal-format
  msgid "parameter %q+D declared %<inline%>"
  msgstr ""
  
! #: c/c-decl.c:6538
  #, gcc-internal-format
  msgid "parameter %q+D declared %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6551
  #, gcc-internal-format
  msgid "field %qE declared as a function"
  msgstr ""
  
! #: c/c-decl.c:6558
  #, gcc-internal-format
  msgid "field %qE has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:6560
  #, gcc-internal-format
  msgid "unnamed field has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:6591 c/c-decl.c:6602 c/c-decl.c:6605
  #, gcc-internal-format
  msgid "invalid storage class for function %qE"
  msgstr ""
  
! #: c/c-decl.c:6662
  #, gcc-internal-format
  msgid "cannot inline function %<main%>"
  msgstr ""
  
! #: c/c-decl.c:6664
  #, gcc-internal-format
  msgid "%<main%> declared %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6675
  #, gcc-internal-format
  msgid "ISO C99 does not support %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6678
  #, gcc-internal-format
  msgid "ISO C90 does not support %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6707
  #, gcc-internal-format
  msgid "variable previously declared %<static%> redeclared %<extern%>"
  msgstr ""
  
! #: c/c-decl.c:6717
  #, gcc-internal-format
  msgid "variable %q+D declared %<inline%>"
  msgstr ""
  
! #: c/c-decl.c:6719
  #, gcc-internal-format
  msgid "variable %q+D declared %<_Noreturn%>"
  msgstr ""
  
! #: c/c-decl.c:6754
  #, gcc-internal-format
  msgid "non-nested function with variably modified type"
  msgstr ""
  
! #: c/c-decl.c:6756
  #, gcc-internal-format
  msgid "object with variably modified type must have no linkage"
  msgstr ""
  
! #: c/c-decl.c:6847 c/c-decl.c:8411
  #, gcc-internal-format
  msgid "function declaration isn%'t a prototype"
  msgstr ""
  
! #: c/c-decl.c:6856
  #, gcc-internal-format
  msgid "parameter names (without types) in function declaration"
  msgstr ""
  
! #: c/c-decl.c:6894
  #, gcc-internal-format
  msgid "parameter %u (%q+D) has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:6898
  #, gcc-internal-format, gfc-internal-format
  msgid "parameter %u has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:6909
  #, gcc-internal-format
  msgid "parameter %u (%q+D) has void type"
  msgstr ""
  
! #: c/c-decl.c:6913
  #, gcc-internal-format, gfc-internal-format
  msgid "parameter %u has void type"
  msgstr ""
  
! #: c/c-decl.c:6997
  #, gcc-internal-format
  msgid "%<void%> as only parameter may not be qualified"
  msgstr ""
  
! #: c/c-decl.c:7001 c/c-decl.c:7036
  #, gcc-internal-format
  msgid "%<void%> must be the only parameter"
  msgstr ""
  
! #: c/c-decl.c:7030
  #, gcc-internal-format
  msgid "parameter %q+D has just a forward declaration"
  msgstr ""
  
  #. The %s will be one of 'struct', 'union', or 'enum'.
! #: c/c-decl.c:7075
  #, gcc-internal-format
  msgid "%<%s %E%> declared inside parameter list"
  msgstr ""
  
  #. The %s will be one of 'struct', 'union', or 'enum'.
! #: c/c-decl.c:7079
  #, gcc-internal-format, gfc-internal-format
  msgid "anonymous %s declared inside parameter list"
  msgstr ""
  
! #: c/c-decl.c:7084
  #, gcc-internal-format
  msgid ""
  "its scope is only this definition or declaration, which is probably not what "
  "you want"
  msgstr ""
  
! #: c/c-decl.c:7184
  #, gcc-internal-format
  msgid "enum type defined here"
  msgstr ""
  
! #: c/c-decl.c:7190
  #, gcc-internal-format
  msgid "struct defined here"
  msgstr ""
  
! #: c/c-decl.c:7196
  #, gcc-internal-format
  msgid "union defined here"
  msgstr ""
  
! #: c/c-decl.c:7269
  #, gcc-internal-format
  msgid "redefinition of %<union %E%>"
  msgstr ""
  
! #: c/c-decl.c:7271
  #, gcc-internal-format
  msgid "redefinition of %<struct %E%>"
  msgstr ""
  
! #: c/c-decl.c:7280
  #, gcc-internal-format
  msgid "nested redefinition of %<union %E%>"
  msgstr ""
  
! #: c/c-decl.c:7282
  #, gcc-internal-format
  msgid "nested redefinition of %<struct %E%>"
  msgstr ""
  
! #: c/c-decl.c:7314 c/c-decl.c:8000
  #, gcc-internal-format
  msgid "defining type in %qs expression is invalid in C++"
  msgstr ""
  
! #: c/c-decl.c:7383 cp/decl.c:4495
  #, gcc-internal-format
  msgid "declaration does not declare anything"
  msgstr ""
  
! #: c/c-decl.c:7388
  #, gcc-internal-format
  msgid "ISO C99 doesn%'t support unnamed structs/unions"
  msgstr ""
  
! #: c/c-decl.c:7391
  #, gcc-internal-format
  msgid "ISO C90 doesn%'t support unnamed structs/unions"
  msgstr ""
  
! #: c/c-decl.c:7482 c/c-decl.c:7501 c/c-decl.c:7564
  #, gcc-internal-format
  msgid "duplicate member %q+D"
  msgstr ""
  
! #: c/c-decl.c:7670
  #, gcc-internal-format
  msgid "union has no named members"
  msgstr ""
  
! #: c/c-decl.c:7672
  #, gcc-internal-format
  msgid "union has no members"
  msgstr ""
  
! #: c/c-decl.c:7677
  #, gcc-internal-format
  msgid "struct has no named members"
  msgstr ""
  
! #: c/c-decl.c:7679
  #, gcc-internal-format
  msgid "struct has no members"
  msgstr ""
  
! #: c/c-decl.c:7742
  #, gcc-internal-format
  msgid "flexible array member in union"
  msgstr ""
  
! #: c/c-decl.c:7748
  #, gcc-internal-format
  msgid "flexible array member not at end of struct"
  msgstr ""
  
! #: c/c-decl.c:7754
  #, gcc-internal-format
  msgid "flexible array member in otherwise empty struct"
  msgstr ""
  
! #: c/c-decl.c:7783 cp/class.c:6502
  #, gcc-internal-format
  msgid "type %qT is too large"
  msgstr ""
  
! #: c/c-decl.c:7879
  #, gcc-internal-format
  msgid "union cannot be made transparent"
  msgstr ""
  
! #: c/c-decl.c:7973
  #, gcc-internal-format
  msgid "nested redefinition of %<enum %E%>"
  msgstr ""
  
  #. This enum is a named one that has been declared already.
! #: c/c-decl.c:7980
  #, gcc-internal-format
  msgid "redeclaration of %<enum %E%>"
  msgstr ""
  
! #: c/c-decl.c:8058
  #, gcc-internal-format
! msgid "specified mode too small for enumeral values"
  msgstr ""
  
! #: c/c-decl.c:8071
  #, gcc-internal-format
! msgid "enumeration values exceed range of largest integer"
  msgstr ""
  
! #: c/c-decl.c:8184 c/c-decl.c:8200
  #, gcc-internal-format
  msgid "enumerator value for %qE is not an integer constant"
  msgstr ""
  
! #: c/c-decl.c:8195
  #, gcc-internal-format
  msgid "enumerator value for %qE is not an integer constant expression"
  msgstr ""
  
! #: c/c-decl.c:8219
  #, gcc-internal-format
  msgid "overflow in enumeration values"
  msgstr ""
  
! #: c/c-decl.c:8227
  #, gcc-internal-format
  msgid "ISO C restricts enumerator values to range of %<int%>"
  msgstr ""
  
! #: c/c-decl.c:8312
  #, gcc-internal-format
  msgid "inline function %qD given attribute noinline"
  msgstr ""
  
! #: c/c-decl.c:8330
  #, gcc-internal-format
  msgid "return type is an incomplete type"
  msgstr ""
  
! #: c/c-decl.c:8341
  #, gcc-internal-format
  msgid "return type defaults to %<int%>"
  msgstr ""
  
! #: c/c-decl.c:8420
  #, gcc-internal-format
  msgid "no previous prototype for %qD"
  msgstr ""
  
! #: c/c-decl.c:8429
  #, gcc-internal-format
  msgid "%qD was used with no prototype before its definition"
  msgstr ""
  
! #: c/c-decl.c:8437
  #, gcc-internal-format
  msgid "no previous declaration for %qD"
  msgstr ""
  
! #: c/c-decl.c:8447
  #, gcc-internal-format
  msgid "%qD was used with no declaration before its definition"
  msgstr ""
  
! #: c/c-decl.c:8466
  #, gcc-internal-format
  msgid "return type of %qD is not %<int%>"
  msgstr ""
  
! #: c/c-decl.c:8468
  #, gcc-internal-format
  msgid "%<_Atomic%>-qualified return type of %qD"
  msgstr ""
  
! #: c/c-decl.c:8475
  #, gcc-internal-format
  msgid "%qD is normally a non-static function"
  msgstr ""
  
! #: c/c-decl.c:8512
  #, gcc-internal-format
  msgid "old-style parameter declarations in prototyped function definition"
  msgstr ""
  
! #: c/c-decl.c:8527
  #, gcc-internal-format
  msgid "traditional C rejects ISO C style function definitions"
  msgstr ""
  
! #: c/c-decl.c:8543
  #, gcc-internal-format
  msgid "parameter name omitted"
  msgstr ""
  
! #: c/c-decl.c:8580
  #, gcc-internal-format
  msgid "old-style function definition"
  msgstr ""
  
! #: c/c-decl.c:8589
  #, gcc-internal-format
  msgid "parameter name missing from parameter list"
  msgstr ""
  
! #: c/c-decl.c:8604
  #, gcc-internal-format
  msgid "%qD declared as a non-parameter"
  msgstr ""
  
! #: c/c-decl.c:8610
  #, gcc-internal-format
  msgid "multiple parameters named %qD"
  msgstr ""
  
! #: c/c-decl.c:8619
  #, gcc-internal-format
  msgid "parameter %qD declared with void type"
  msgstr ""
  
! #: c/c-decl.c:8648 c/c-decl.c:8653
  #, gcc-internal-format
  msgid "type of %qD defaults to %<int%>"
  msgstr ""
  
! #: c/c-decl.c:8673
  #, gcc-internal-format
  msgid "parameter %qD has incomplete type"
  msgstr ""
  
! #: c/c-decl.c:8680
  #, gcc-internal-format
  msgid "declaration for parameter %qD but no such parameter"
  msgstr ""
  
! #: c/c-decl.c:8730
  #, gcc-internal-format
  msgid "number of arguments doesn%'t match built-in prototype"
  msgstr ""
  
! #: c/c-decl.c:8741
  #, gcc-internal-format
  msgid "number of arguments doesn%'t match prototype"
  msgstr ""
  
! #: c/c-decl.c:8744 c/c-decl.c:8791 c/c-decl.c:8805
  #, gcc-internal-format
  msgid "prototype declaration"
  msgstr ""
  
! #: c/c-decl.c:8783
  #, gcc-internal-format
  msgid "promoted argument %qD doesn%'t match built-in prototype"
  msgstr ""
  
! #: c/c-decl.c:8788
  #, gcc-internal-format
  msgid "promoted argument %qD doesn%'t match prototype"
  msgstr ""
  
! #: c/c-decl.c:8798
  #, gcc-internal-format
  msgid "argument %qD doesn%'t match built-in prototype"
  msgstr ""
  
! #: c/c-decl.c:8803
  #, gcc-internal-format
  msgid "argument %qD doesn%'t match prototype"
  msgstr ""
  
! #: c/c-decl.c:9031 cp/decl.c:14337
  #, gcc-internal-format
  msgid "no return statement in function returning non-void"
  msgstr ""
  
! #: c/c-decl.c:9051
  #, gcc-internal-format
  msgid "parameter %qD set but not used"
  msgstr ""
*************** msgstr ""
*** 30226,30426 ****
  #. If we get here, declarations have been used in a for loop without
  #. the C99 for loop scope.  This doesn't make much sense, so don't
  #. allow it.
! #: c/c-decl.c:9081
  #, gcc-internal-format
  msgid "%<for%> loop initial declarations are only allowed in C99 or C11 mode"
  msgstr ""
  
! #: c/c-decl.c:9086
  #, gcc-internal-format
  msgid ""
  "use option -std=c99, -std=gnu99, -std=c11 or -std=gnu11 to compile your code"
  msgstr ""
  
! #: c/c-decl.c:9121
  #, gcc-internal-format
  msgid "declaration of static variable %qD in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9125
  #, gcc-internal-format
  msgid ""
  "declaration of %<extern%> variable %qD in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9132
  #, gcc-internal-format
  msgid "%<struct %E%> declared in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9137
  #, gcc-internal-format
  msgid "%<union %E%> declared in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9141
  #, gcc-internal-format
  msgid "%<enum %E%> declared in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9145
  #, gcc-internal-format
  msgid "declaration of non-variable %qD in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9419
  #, gcc-internal-format
  msgid "incompatible address space qualifiers %qs and %qs"
  msgstr ""
  
! #: c/c-decl.c:9469 c/c-decl.c:9826 c/c-decl.c:10316
  #, gcc-internal-format
  msgid "duplicate %qE"
  msgstr ""
  
! #: c/c-decl.c:9495 c/c-decl.c:9838 c/c-decl.c:10159
  #, gcc-internal-format
  msgid "two or more data types in declaration specifiers"
  msgstr ""
  
! #: c/c-decl.c:9507 cp/parser.c:24713
  #, gcc-internal-format
  msgid "%<long long long%> is too long for GCC"
  msgstr ""
  
! #: c/c-decl.c:9520
  #, gcc-internal-format
  msgid "ISO C90 does not support %<long long%>"
  msgstr ""
  
! #: c/c-decl.c:9717 c/c-parser.c:7557
  #, gcc-internal-format
  msgid "ISO C90 does not support complex types"
  msgstr ""
  
! #: c/c-decl.c:9763
  #, gcc-internal-format
  msgid "ISO C does not support saturating types"
  msgstr ""
  
! #: c/c-decl.c:9881
  #, gcc-internal-format
  msgid "ISO C does not support %<__int%d%> types"
  msgstr ""
  
! #: c/c-decl.c:9901
  #, gcc-internal-format
  msgid "%<__int%d%> is not supported on this target"
  msgstr ""
  
! #: c/c-decl.c:9943
  #, gcc-internal-format
  msgid "ISO C90 does not support boolean types"
  msgstr ""
  
! #: c/c-decl.c:10117
  #, gcc-internal-format
  msgid "ISO C does not support decimal floating point"
  msgstr ""
  
! #: c/c-decl.c:10140 c/c-decl.c:10406 c/c-parser.c:7092
  #, gcc-internal-format
  msgid "fixed-point types not supported for this target"
  msgstr ""
  
! #: c/c-decl.c:10142
  #, gcc-internal-format
  msgid "ISO C does not support fixed-point types"
  msgstr ""
  
! #: c/c-decl.c:10177
  #, gcc-internal-format
  msgid "C++ lookup of %qD would return a field, not a type"
  msgstr ""
  
! #: c/c-decl.c:10190
  #, gcc-internal-format
  msgid "%qE fails to be a typedef or built in type"
  msgstr ""
  
! #: c/c-decl.c:10238
  #, gcc-internal-format
  msgid "%qE is not at beginning of declaration"
  msgstr ""
  
! #: c/c-decl.c:10259
  #, gcc-internal-format
  msgid "%qE used with %<auto%>"
  msgstr ""
  
! #: c/c-decl.c:10261
  #, gcc-internal-format
  msgid "%qE used with %<register%>"
  msgstr ""
  
! #: c/c-decl.c:10263
  #, gcc-internal-format
  msgid "%qE used with %<typedef%>"
  msgstr ""
  
! #: c/c-decl.c:10277 c/c-parser.c:6681
  #, gcc-internal-format
  msgid "ISO C99 does not support %qE"
  msgstr ""
  
! #: c/c-decl.c:10280 c/c-parser.c:6684
  #, gcc-internal-format
  msgid "ISO C90 does not support %qE"
  msgstr ""
  
! #: c/c-decl.c:10292
  #, gcc-internal-format
  msgid "%<__thread%> before %<extern%>"
  msgstr ""
  
! #: c/c-decl.c:10301
  #, gcc-internal-format
  msgid "%<__thread%> before %<static%>"
  msgstr ""
  
! #: c/c-decl.c:10314
  #, gcc-internal-format
  msgid "duplicate %<_Thread_local%> or %<__thread%>"
  msgstr ""
  
! #: c/c-decl.c:10322
  #, gcc-internal-format
  msgid "multiple storage classes in declaration specifiers"
  msgstr ""
  
! #: c/c-decl.c:10330
  #, gcc-internal-format
  msgid "%qs used with %qE"
  msgstr ""
  
! #: c/c-decl.c:10403
  #, gcc-internal-format
  msgid "%<_Sat%> is used without %<_Fract%> or %<_Accum%>"
  msgstr ""
  
! #: c/c-decl.c:10418
  #, gcc-internal-format
  msgid "ISO C does not support plain %<complex%> meaning %<double complex%>"
  msgstr ""
  
! #: c/c-decl.c:10469 c/c-decl.c:10482 c/c-decl.c:10508
  #, gcc-internal-format
  msgid "ISO C does not support complex integer types"
  msgstr ""
  
! #: c/c-decl.c:10926 cp/semantics.c:4936
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare reduction%> combiner refers to variable %qD which is "
  "not %<omp_out%> nor %<omp_in%>"
  msgstr ""
  
! #: c/c-decl.c:10930 cp/semantics.c:4940
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare reduction%> initializer refers to variable %qD which "
--- 30409,30609 ----
  #. If we get here, declarations have been used in a for loop without
  #. the C99 for loop scope.  This doesn't make much sense, so don't
  #. allow it.
! #: c/c-decl.c:9140
  #, gcc-internal-format
  msgid "%<for%> loop initial declarations are only allowed in C99 or C11 mode"
  msgstr ""
  
! #: c/c-decl.c:9145
  #, gcc-internal-format
  msgid ""
  "use option -std=c99, -std=gnu99, -std=c11 or -std=gnu11 to compile your code"
  msgstr ""
  
! #: c/c-decl.c:9180
  #, gcc-internal-format
  msgid "declaration of static variable %qD in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9184
  #, gcc-internal-format
  msgid ""
  "declaration of %<extern%> variable %qD in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9191
  #, gcc-internal-format
  msgid "%<struct %E%> declared in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9196
  #, gcc-internal-format
  msgid "%<union %E%> declared in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9200
  #, gcc-internal-format
  msgid "%<enum %E%> declared in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9204
  #, gcc-internal-format
  msgid "declaration of non-variable %qD in %<for%> loop initial declaration"
  msgstr ""
  
! #: c/c-decl.c:9478
  #, gcc-internal-format
  msgid "incompatible address space qualifiers %qs and %qs"
  msgstr ""
  
! #: c/c-decl.c:9528 c/c-decl.c:9885 c/c-decl.c:10375
  #, gcc-internal-format
  msgid "duplicate %qE"
  msgstr ""
  
! #: c/c-decl.c:9554 c/c-decl.c:9897 c/c-decl.c:10218
  #, gcc-internal-format
  msgid "two or more data types in declaration specifiers"
  msgstr ""
  
! #: c/c-decl.c:9566 cp/parser.c:24754
  #, gcc-internal-format
  msgid "%<long long long%> is too long for GCC"
  msgstr ""
  
! #: c/c-decl.c:9579
  #, gcc-internal-format
  msgid "ISO C90 does not support %<long long%>"
  msgstr ""
  
! #: c/c-decl.c:9776 c/c-parser.c:7563
  #, gcc-internal-format
  msgid "ISO C90 does not support complex types"
  msgstr ""
  
! #: c/c-decl.c:9822
  #, gcc-internal-format
  msgid "ISO C does not support saturating types"
  msgstr ""
  
! #: c/c-decl.c:9940
  #, gcc-internal-format
  msgid "ISO C does not support %<__int%d%> types"
  msgstr ""
  
! #: c/c-decl.c:9960
  #, gcc-internal-format
  msgid "%<__int%d%> is not supported on this target"
  msgstr ""
  
! #: c/c-decl.c:10002
  #, gcc-internal-format
  msgid "ISO C90 does not support boolean types"
  msgstr ""
  
! #: c/c-decl.c:10176
  #, gcc-internal-format
  msgid "ISO C does not support decimal floating point"
  msgstr ""
  
! #: c/c-decl.c:10199 c/c-decl.c:10465 c/c-parser.c:7098
  #, gcc-internal-format
  msgid "fixed-point types not supported for this target"
  msgstr ""
  
! #: c/c-decl.c:10201
  #, gcc-internal-format
  msgid "ISO C does not support fixed-point types"
  msgstr ""
  
! #: c/c-decl.c:10236
  #, gcc-internal-format
  msgid "C++ lookup of %qD would return a field, not a type"
  msgstr ""
  
! #: c/c-decl.c:10249
  #, gcc-internal-format
  msgid "%qE fails to be a typedef or built in type"
  msgstr ""
  
! #: c/c-decl.c:10297
  #, gcc-internal-format
  msgid "%qE is not at beginning of declaration"
  msgstr ""
  
! #: c/c-decl.c:10318
  #, gcc-internal-format
  msgid "%qE used with %<auto%>"
  msgstr ""
  
! #: c/c-decl.c:10320
  #, gcc-internal-format
  msgid "%qE used with %<register%>"
  msgstr ""
  
! #: c/c-decl.c:10322
  #, gcc-internal-format
  msgid "%qE used with %<typedef%>"
  msgstr ""
  
! #: c/c-decl.c:10336 c/c-parser.c:6687
  #, gcc-internal-format
  msgid "ISO C99 does not support %qE"
  msgstr ""
  
! #: c/c-decl.c:10339 c/c-parser.c:6690
  #, gcc-internal-format
  msgid "ISO C90 does not support %qE"
  msgstr ""
  
! #: c/c-decl.c:10351
  #, gcc-internal-format
  msgid "%<__thread%> before %<extern%>"
  msgstr ""
  
! #: c/c-decl.c:10360
  #, gcc-internal-format
  msgid "%<__thread%> before %<static%>"
  msgstr ""
  
! #: c/c-decl.c:10373
  #, gcc-internal-format
  msgid "duplicate %<_Thread_local%> or %<__thread%>"
  msgstr ""
  
! #: c/c-decl.c:10381
  #, gcc-internal-format
  msgid "multiple storage classes in declaration specifiers"
  msgstr ""
  
! #: c/c-decl.c:10389
  #, gcc-internal-format
  msgid "%qs used with %qE"
  msgstr ""
  
! #: c/c-decl.c:10462
  #, gcc-internal-format
  msgid "%<_Sat%> is used without %<_Fract%> or %<_Accum%>"
  msgstr ""
  
! #: c/c-decl.c:10477
  #, gcc-internal-format
  msgid "ISO C does not support plain %<complex%> meaning %<double complex%>"
  msgstr ""
  
! #: c/c-decl.c:10528 c/c-decl.c:10541 c/c-decl.c:10567
  #, gcc-internal-format
  msgid "ISO C does not support complex integer types"
  msgstr ""
  
! #: c/c-decl.c:10985 cp/semantics.c:4937
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare reduction%> combiner refers to variable %qD which is "
  "not %<omp_out%> nor %<omp_in%>"
  msgstr ""
  
! #: c/c-decl.c:10989 cp/semantics.c:4941
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare reduction%> initializer refers to variable %qD which "
*************** msgstr ""
*** 30432,30494 ****
  msgid "identifier %qE conflicts with C++ keyword"
  msgstr ""
  
! #: c/c-parser.c:1000 cp/parser.c:24920
  #, gcc-internal-format
  msgid "expected end of line"
  msgstr ""
  
! #: c/c-parser.c:1330
  #, gcc-internal-format
  msgid "ISO C forbids an empty translation unit"
  msgstr ""
  
! #: c/c-parser.c:1428 c/c-parser.c:8633
  #, gcc-internal-format
  msgid "ISO C does not allow extra %<;%> outside of a function"
  msgstr ""
  
! #: c/c-parser.c:1558 c/c-parser.c:2286 c/c-parser.c:3665
  #, gcc-internal-format
  msgid "unknown type name %qE"
  msgstr ""
  
! #: c/c-parser.c:1579 c/c-parser.c:9770 c/c-parser.c:13881 cp/parser.c:31461
! #: cp/parser.c:33174
  #, gcc-internal-format
  msgid "expected declaration specifiers"
  msgstr ""
  
! #: c/c-parser.c:1588
  #, gcc-internal-format
  msgid "%<__auto_type%> in empty declaration"
  msgstr ""
  
! #: c/c-parser.c:1607 c/c-parser.c:2944
  #, gcc-internal-format
  msgid "expected %<;%>, identifier or %<(%>"
  msgstr ""
  
! #: c/c-parser.c:1625 cp/parser.c:26518 cp/parser.c:26592
  #, gcc-internal-format
  msgid "prefix attributes are ignored for methods"
  msgstr ""
  
! #: c/c-parser.c:1660
  #, gcc-internal-format
  msgid "prefix attributes are ignored for implementations"
  msgstr ""
  
! #: c/c-parser.c:1681
  #, gcc-internal-format
  msgid "unexpected attribute"
  msgstr ""
  
! #: c/c-parser.c:1719
  #, gcc-internal-format
  msgid "%<__auto_type%> requires a plain identifier as declarator"
  msgstr ""
  
! #: c/c-parser.c:1736
  #, gcc-internal-format
  msgid "data definition has no type or storage class"
  msgstr ""
--- 30615,30677 ----
  msgid "identifier %qE conflicts with C++ keyword"
  msgstr ""
  
! #: c/c-parser.c:1000 cp/parser.c:24961
  #, gcc-internal-format
  msgid "expected end of line"
  msgstr ""
  
! #: c/c-parser.c:1331
  #, gcc-internal-format
  msgid "ISO C forbids an empty translation unit"
  msgstr ""
  
! #: c/c-parser.c:1429 c/c-parser.c:8639
  #, gcc-internal-format
  msgid "ISO C does not allow extra %<;%> outside of a function"
  msgstr ""
  
! #: c/c-parser.c:1559 c/c-parser.c:2287 c/c-parser.c:3666
  #, gcc-internal-format
  msgid "unknown type name %qE"
  msgstr ""
  
! #: c/c-parser.c:1580 c/c-parser.c:9776 c/c-parser.c:13927 cp/parser.c:31502
! #: cp/parser.c:33216
  #, gcc-internal-format
  msgid "expected declaration specifiers"
  msgstr ""
  
! #: c/c-parser.c:1589
  #, gcc-internal-format
  msgid "%<__auto_type%> in empty declaration"
  msgstr ""
  
! #: c/c-parser.c:1608 c/c-parser.c:2945
  #, gcc-internal-format
  msgid "expected %<;%>, identifier or %<(%>"
  msgstr ""
  
! #: c/c-parser.c:1626 cp/parser.c:26559 cp/parser.c:26633
  #, gcc-internal-format
  msgid "prefix attributes are ignored for methods"
  msgstr ""
  
! #: c/c-parser.c:1661
  #, gcc-internal-format
  msgid "prefix attributes are ignored for implementations"
  msgstr ""
  
! #: c/c-parser.c:1682
  #, gcc-internal-format
  msgid "unexpected attribute"
  msgstr ""
  
! #: c/c-parser.c:1720
  #, gcc-internal-format
  msgid "%<__auto_type%> requires a plain identifier as declarator"
  msgstr ""
  
! #: c/c-parser.c:1737
  #, gcc-internal-format
  msgid "data definition has no type or storage class"
  msgstr ""
*************** msgstr ""
*** 30496,30523 ****
  #. This means there is an attribute specifier after
  #. the declarator in a function definition.  Provide
  #. some more information for the user.
! #: c/c-parser.c:1751
  #, gcc-internal-format
  msgid ""
  "attributes should be specified before the declarator in a function definition"
  msgstr ""
  
! #: c/c-parser.c:1771
  #, gcc-internal-format
  msgid "%<__auto_type%> used with a bit-field initializer"
  msgstr ""
  
! #: c/c-parser.c:1839 c/c-parser.c:1924
  #, gcc-internal-format
  msgid "%<__auto_type%> requires an initialized data declaration"
  msgstr ""
  
! #: c/c-parser.c:1887
  #, gcc-internal-format
  msgid "%<__auto_type%> may only be used with a single declarator"
  msgstr ""
  
! #: c/c-parser.c:1916 cp/parser.c:11654
  #, gcc-internal-format
  msgid "expected %<,%> or %<;%>"
  msgstr ""
--- 30679,30706 ----
  #. This means there is an attribute specifier after
  #. the declarator in a function definition.  Provide
  #. some more information for the user.
! #: c/c-parser.c:1752
  #, gcc-internal-format
  msgid ""
  "attributes should be specified before the declarator in a function definition"
  msgstr ""
  
! #: c/c-parser.c:1772
  #, gcc-internal-format
  msgid "%<__auto_type%> used with a bit-field initializer"
  msgstr ""
  
! #: c/c-parser.c:1840 c/c-parser.c:1925
  #, gcc-internal-format
  msgid "%<__auto_type%> requires an initialized data declaration"
  msgstr ""
  
! #: c/c-parser.c:1888
  #, gcc-internal-format
  msgid "%<__auto_type%> may only be used with a single declarator"
  msgstr ""
  
! #: c/c-parser.c:1917 cp/parser.c:11655
  #, gcc-internal-format
  msgid "expected %<,%> or %<;%>"
  msgstr ""
*************** msgstr ""
*** 30525,30781 ****
  #. This can appear in many cases looking nothing like a
  #. function definition, so we don't give a more specific
  #. error suggesting there was one.
! #: c/c-parser.c:1930 c/c-parser.c:1946
  #, gcc-internal-format
  msgid "expected %<=%>, %<,%>, %<;%>, %<asm%> or %<__attribute__%>"
  msgstr ""
  
! #: c/c-parser.c:1938
  #, gcc-internal-format
  msgid "ISO C forbids nested functions"
  msgstr ""
  
! #: c/c-parser.c:2058
  #, gcc-internal-format
  msgid "ISO C99 does not support %<_Static_assert%>"
  msgstr ""
  
! #: c/c-parser.c:2061
  #, gcc-internal-format
  msgid "ISO C90 does not support %<_Static_assert%>"
  msgstr ""
  
! #: c/c-parser.c:2085 c/c-parser.c:3733 c/c-parser.c:9825 cp/parser.c:32904
  #, gcc-internal-format
  msgid "expected string literal"
  msgstr ""
  
! #: c/c-parser.c:2093
  #, gcc-internal-format
  msgid "expression in static assertion is not an integer"
  msgstr ""
  
! #: c/c-parser.c:2102
  #, gcc-internal-format
  msgid "expression in static assertion is not an integer constant expression"
  msgstr ""
  
! #: c/c-parser.c:2107
  #, gcc-internal-format
  msgid "expression in static assertion is not constant"
  msgstr ""
  
! #: c/c-parser.c:2112
  #, gcc-internal-format
  msgid "static assertion failed: %E"
  msgstr ""
  
! #: c/c-parser.c:2427
  #, gcc-internal-format
  msgid "%<_Atomic%> in Objective-C"
  msgstr ""
  
! #: c/c-parser.c:2431
  #, gcc-internal-format
  msgid "%<_Atomic%> with OpenMP"
  msgstr ""
  
! #: c/c-parser.c:2434
  #, gcc-internal-format
  msgid "ISO C99 does not support the %<_Atomic%> qualifier"
  msgstr ""
  
! #: c/c-parser.c:2437
  #, gcc-internal-format
  msgid "ISO C90 does not support the %<_Atomic%> qualifier"
  msgstr ""
  
! #: c/c-parser.c:2464
  #, gcc-internal-format
  msgid "%<_Atomic%> applied to a qualified type"
  msgstr ""
  
! #: c/c-parser.c:2567 c/c-parser.c:3505 c/c-parser.c:4283 c/c-parser.c:4579
! #: c/c-parser.c:5824 c/c-parser.c:5911 c/c-parser.c:6565 c/c-parser.c:7146
! #: c/c-parser.c:7351 c/c-parser.c:7376 c/c-parser.c:7628 c/c-parser.c:7918
! #: c/c-parser.c:7947 c/c-parser.c:8217 c/c-parser.c:8266 c/c-parser.c:8426
! #: c/c-parser.c:8456 c/c-parser.c:8464 c/c-parser.c:8493 c/c-parser.c:8506
! #: c/c-parser.c:8811 c/c-parser.c:8935 c/c-parser.c:9375 c/c-parser.c:9410
! #: c/c-parser.c:9463 c/c-parser.c:9516 c/c-parser.c:9532 c/c-parser.c:9578
! #: c/c-parser.c:10109 c/c-parser.c:12764 c/c-parser.c:14880 c/c-parser.c:15208
! #: cp/parser.c:24923 cp/parser.c:27361 cp/parser.c:27391 cp/parser.c:27461
! #: cp/parser.c:32625 cp/parser.c:33319
  #, gcc-internal-format
  msgid "expected identifier"
  msgstr ""
  
! #: c/c-parser.c:2601 cp/parser.c:16088
  #, gcc-internal-format
  msgid "comma at end of enumerator list"
  msgstr ""
  
! #: c/c-parser.c:2607
  #, gcc-internal-format
  msgid "expected %<,%> or %<}%>"
  msgstr ""
  
! #: c/c-parser.c:2638
  #, gcc-internal-format
  msgid "ISO C forbids forward references to %<enum%> types"
  msgstr ""
  
! #: c/c-parser.c:2754
  #, gcc-internal-format
  msgid "expected class name"
  msgstr ""
  
! #: c/c-parser.c:2773
  #, gcc-internal-format
  msgid "extra semicolon in struct or union specified"
  msgstr ""
  
! #: c/c-parser.c:2802
  #, gcc-internal-format
  msgid "no semicolon at end of struct or union"
  msgstr ""
  
! #: c/c-parser.c:2906 c/c-parser.c:4096
  #, gcc-internal-format
  msgid "expected specifier-qualifier-list"
  msgstr ""
  
! #: c/c-parser.c:2917
  #, gcc-internal-format
  msgid "ISO C forbids member declarations with no members"
  msgstr ""
  
! #: c/c-parser.c:3007
  #, gcc-internal-format
  msgid "expected %<,%>, %<;%> or %<}%>"
  msgstr ""
  
! #: c/c-parser.c:3014
  #, gcc-internal-format
  msgid "expected %<:%>, %<,%>, %<;%>, %<}%> or %<__attribute__%>"
  msgstr ""
  
! #: c/c-parser.c:3067
  #, gcc-internal-format
  msgid "%<typeof%> applied to a bit-field"
  msgstr ""
  
! #: c/c-parser.c:3104
  #, gcc-internal-format
  msgid "ISO C99 does not support %<_Alignas%>"
  msgstr ""
  
! #: c/c-parser.c:3107
  #, gcc-internal-format
  msgid "ISO C90 does not support %<_Alignas%>"
  msgstr ""
  
! #: c/c-parser.c:3342
  #, gcc-internal-format
  msgid "expected identifier or %<(%>"
  msgstr ""
  
! #: c/c-parser.c:3403 c/c-parser.c:3432
  #, gcc-internal-format
  msgid "array notations cannot be used in declaration"
  msgstr ""
  
! #: c/c-parser.c:3571
  #, gcc-internal-format
  msgid "ISO C requires a named argument before %<...%>"
  msgstr ""
  
! #: c/c-parser.c:3672
  #, gcc-internal-format
  msgid "expected declaration specifiers or %<...%>"
  msgstr ""
  
! #: c/c-parser.c:3727
  #, gcc-internal-format
  msgid "wide string literal in %<asm%>"
  msgstr ""
  
! #: c/c-parser.c:4196
  #, gcc-internal-format
  msgid "ISO C forbids empty initializer braces"
  msgstr ""
  
! #: c/c-parser.c:4248
  #, gcc-internal-format
  msgid "obsolete use of designated initializer with %<:%>"
  msgstr ""
  
! #: c/c-parser.c:4392
  #, gcc-internal-format
  msgid "ISO C forbids specifying range of elements to initialize"
  msgstr ""
  
! #: c/c-parser.c:4404
  #, gcc-internal-format
  msgid "ISO C90 forbids specifying subobject to initialize"
  msgstr ""
  
! #: c/c-parser.c:4412
  #, gcc-internal-format
  msgid "obsolete use of designated initializer without %<=%>"
  msgstr ""
  
! #: c/c-parser.c:4594
  #, gcc-internal-format
  msgid "ISO C forbids label declarations"
  msgstr ""
  
! #: c/c-parser.c:4600 c/c-parser.c:4677
  #, gcc-internal-format
  msgid "expected declaration or statement"
  msgstr ""
  
! #: c/c-parser.c:4630 c/c-parser.c:4658
  #, gcc-internal-format
  msgid "ISO C90 forbids mixed declarations and code"
  msgstr ""
  
! #: c/c-parser.c:4685
  #, gcc-internal-format
  msgid "expected %<}%> before %<else%>"
  msgstr ""
  
! #: c/c-parser.c:4690 cp/parser.c:10109
  #, gcc-internal-format
  msgid "%<else%> without a previous %<if%>"
  msgstr ""
  
! #: c/c-parser.c:4707
  #, gcc-internal-format
  msgid "label at end of compound statement"
  msgstr ""
  
! #: c/c-parser.c:4764
  #, gcc-internal-format
  msgid "expected %<:%> or %<...%>"
  msgstr ""
  
! #: c/c-parser.c:4795
  #, gcc-internal-format
  msgid ""
  "a label can only be part of a statement and a declaration is not a statement"
  msgstr ""
  
! #: c/c-parser.c:4988 cp/parser.c:9714
  #, gcc-internal-format
  msgid "-fcilkplus must be enabled to use %<_Cilk_for%>"
  msgstr ""
  
! #: c/c-parser.c:4998 cp/parser.c:9740
  #, gcc-internal-format
  msgid "-fcilkplus must be enabled to use %<_Cilk_sync%>"
  msgstr ""
  
! #: c/c-parser.c:5025
  #, gcc-internal-format
  msgid "expected identifier or %<*%>"
  msgstr ""
--- 30708,30964 ----
  #. This can appear in many cases looking nothing like a
  #. function definition, so we don't give a more specific
  #. error suggesting there was one.
! #: c/c-parser.c:1931 c/c-parser.c:1947
  #, gcc-internal-format
  msgid "expected %<=%>, %<,%>, %<;%>, %<asm%> or %<__attribute__%>"
  msgstr ""
  
! #: c/c-parser.c:1939
  #, gcc-internal-format
  msgid "ISO C forbids nested functions"
  msgstr ""
  
! #: c/c-parser.c:2059
  #, gcc-internal-format
  msgid "ISO C99 does not support %<_Static_assert%>"
  msgstr ""
  
! #: c/c-parser.c:2062
  #, gcc-internal-format
  msgid "ISO C90 does not support %<_Static_assert%>"
  msgstr ""
  
! #: c/c-parser.c:2086 c/c-parser.c:3734 c/c-parser.c:9831 cp/parser.c:32946
  #, gcc-internal-format
  msgid "expected string literal"
  msgstr ""
  
! #: c/c-parser.c:2094
  #, gcc-internal-format
  msgid "expression in static assertion is not an integer"
  msgstr ""
  
! #: c/c-parser.c:2103
  #, gcc-internal-format
  msgid "expression in static assertion is not an integer constant expression"
  msgstr ""
  
! #: c/c-parser.c:2108
  #, gcc-internal-format
  msgid "expression in static assertion is not constant"
  msgstr ""
  
! #: c/c-parser.c:2113
  #, gcc-internal-format
  msgid "static assertion failed: %E"
  msgstr ""
  
! #: c/c-parser.c:2428
  #, gcc-internal-format
  msgid "%<_Atomic%> in Objective-C"
  msgstr ""
  
! #: c/c-parser.c:2432
  #, gcc-internal-format
  msgid "%<_Atomic%> with OpenMP"
  msgstr ""
  
! #: c/c-parser.c:2435
  #, gcc-internal-format
  msgid "ISO C99 does not support the %<_Atomic%> qualifier"
  msgstr ""
  
! #: c/c-parser.c:2438
  #, gcc-internal-format
  msgid "ISO C90 does not support the %<_Atomic%> qualifier"
  msgstr ""
  
! #: c/c-parser.c:2465
  #, gcc-internal-format
  msgid "%<_Atomic%> applied to a qualified type"
  msgstr ""
  
! #: c/c-parser.c:2568 c/c-parser.c:3506 c/c-parser.c:4288 c/c-parser.c:4585
! #: c/c-parser.c:5830 c/c-parser.c:5917 c/c-parser.c:6571 c/c-parser.c:7152
! #: c/c-parser.c:7357 c/c-parser.c:7382 c/c-parser.c:7634 c/c-parser.c:7924
! #: c/c-parser.c:7953 c/c-parser.c:8223 c/c-parser.c:8272 c/c-parser.c:8432
! #: c/c-parser.c:8462 c/c-parser.c:8470 c/c-parser.c:8499 c/c-parser.c:8512
! #: c/c-parser.c:8817 c/c-parser.c:8941 c/c-parser.c:9381 c/c-parser.c:9416
! #: c/c-parser.c:9469 c/c-parser.c:9522 c/c-parser.c:9538 c/c-parser.c:9584
! #: c/c-parser.c:10115 c/c-parser.c:12794 c/c-parser.c:14926 c/c-parser.c:15254
! #: cp/parser.c:24964 cp/parser.c:27402 cp/parser.c:27432 cp/parser.c:27502
! #: cp/parser.c:32667 cp/parser.c:33361
  #, gcc-internal-format
  msgid "expected identifier"
  msgstr ""
  
! #: c/c-parser.c:2602 cp/parser.c:16089
  #, gcc-internal-format
  msgid "comma at end of enumerator list"
  msgstr ""
  
! #: c/c-parser.c:2608
  #, gcc-internal-format
  msgid "expected %<,%> or %<}%>"
  msgstr ""
  
! #: c/c-parser.c:2639
  #, gcc-internal-format
  msgid "ISO C forbids forward references to %<enum%> types"
  msgstr ""
  
! #: c/c-parser.c:2755
  #, gcc-internal-format
  msgid "expected class name"
  msgstr ""
  
! #: c/c-parser.c:2774
  #, gcc-internal-format
  msgid "extra semicolon in struct or union specified"
  msgstr ""
  
! #: c/c-parser.c:2803
  #, gcc-internal-format
  msgid "no semicolon at end of struct or union"
  msgstr ""
  
! #: c/c-parser.c:2907 c/c-parser.c:4097
  #, gcc-internal-format
  msgid "expected specifier-qualifier-list"
  msgstr ""
  
! #: c/c-parser.c:2918
  #, gcc-internal-format
  msgid "ISO C forbids member declarations with no members"
  msgstr ""
  
! #: c/c-parser.c:3008
  #, gcc-internal-format
  msgid "expected %<,%>, %<;%> or %<}%>"
  msgstr ""
  
! #: c/c-parser.c:3015
  #, gcc-internal-format
  msgid "expected %<:%>, %<,%>, %<;%>, %<}%> or %<__attribute__%>"
  msgstr ""
  
! #: c/c-parser.c:3068
  #, gcc-internal-format
  msgid "%<typeof%> applied to a bit-field"
  msgstr ""
  
! #: c/c-parser.c:3105
  #, gcc-internal-format
  msgid "ISO C99 does not support %<_Alignas%>"
  msgstr ""
  
! #: c/c-parser.c:3108
  #, gcc-internal-format
  msgid "ISO C90 does not support %<_Alignas%>"
  msgstr ""
  
! #: c/c-parser.c:3343
  #, gcc-internal-format
  msgid "expected identifier or %<(%>"
  msgstr ""
  
! #: c/c-parser.c:3404 c/c-parser.c:3433
  #, gcc-internal-format
  msgid "array notations cannot be used in declaration"
  msgstr ""
  
! #: c/c-parser.c:3572
  #, gcc-internal-format
  msgid "ISO C requires a named argument before %<...%>"
  msgstr ""
  
! #: c/c-parser.c:3673
  #, gcc-internal-format
  msgid "expected declaration specifiers or %<...%>"
  msgstr ""
  
! #: c/c-parser.c:3728
  #, gcc-internal-format
  msgid "wide string literal in %<asm%>"
  msgstr ""
  
! #: c/c-parser.c:4201
  #, gcc-internal-format
  msgid "ISO C forbids empty initializer braces"
  msgstr ""
  
! #: c/c-parser.c:4253
  #, gcc-internal-format
  msgid "obsolete use of designated initializer with %<:%>"
  msgstr ""
  
! #: c/c-parser.c:4397
  #, gcc-internal-format
  msgid "ISO C forbids specifying range of elements to initialize"
  msgstr ""
  
! #: c/c-parser.c:4409
  #, gcc-internal-format
  msgid "ISO C90 forbids specifying subobject to initialize"
  msgstr ""
  
! #: c/c-parser.c:4417
  #, gcc-internal-format
  msgid "obsolete use of designated initializer without %<=%>"
  msgstr ""
  
! #: c/c-parser.c:4600
  #, gcc-internal-format
  msgid "ISO C forbids label declarations"
  msgstr ""
  
! #: c/c-parser.c:4606 c/c-parser.c:4683
  #, gcc-internal-format
  msgid "expected declaration or statement"
  msgstr ""
  
! #: c/c-parser.c:4636 c/c-parser.c:4664
  #, gcc-internal-format
  msgid "ISO C90 forbids mixed declarations and code"
  msgstr ""
  
! #: c/c-parser.c:4691
  #, gcc-internal-format
  msgid "expected %<}%> before %<else%>"
  msgstr ""
  
! #: c/c-parser.c:4696 cp/parser.c:10110
  #, gcc-internal-format
  msgid "%<else%> without a previous %<if%>"
  msgstr ""
  
! #: c/c-parser.c:4713
  #, gcc-internal-format
  msgid "label at end of compound statement"
  msgstr ""
  
! #: c/c-parser.c:4770
  #, gcc-internal-format
  msgid "expected %<:%> or %<...%>"
  msgstr ""
  
! #: c/c-parser.c:4801
  #, gcc-internal-format
  msgid ""
  "a label can only be part of a statement and a declaration is not a statement"
  msgstr ""
  
! #: c/c-parser.c:4994 cp/parser.c:9715
  #, gcc-internal-format
  msgid "-fcilkplus must be enabled to use %<_Cilk_for%>"
  msgstr ""
  
! #: c/c-parser.c:5004 cp/parser.c:9741
  #, gcc-internal-format
  msgid "-fcilkplus must be enabled to use %<_Cilk_sync%>"
  msgstr ""
  
! #: c/c-parser.c:5031
  #, gcc-internal-format
  msgid "expected identifier or %<*%>"
  msgstr ""
*************** msgstr ""
*** 30784,31650 ****
  #. c_parser_skip_until_found stops at a closing nesting
  #. delimiter without consuming it, but here we need to consume
  #. it to proceed further.
! #: c/c-parser.c:5107 cp/parser.c:9814
  #, gcc-internal-format
  msgid "expected statement"
  msgstr ""
  
! #: c/c-parser.c:5201 cp/parser.c:10191
  #, gcc-internal-format
  msgid "suggest braces around empty body in an %<if%> statement"
  msgstr ""
  
! #: c/c-parser.c:5225 cp/parser.c:10214
  #, gcc-internal-format
  msgid "suggest braces around empty body in an %<else%> statement"
  msgstr ""
  
! #: c/c-parser.c:5259
  #, gcc-internal-format
  msgid "if statement cannot contain %<Cilk_spawn%>"
  msgstr ""
  
! #: c/c-parser.c:5388
  #, gcc-internal-format
  msgid "suggest braces around empty body in %<do%> statement"
  msgstr ""
  
! #: c/c-parser.c:5512 c/c-parser.c:5542
  #, gcc-internal-format
  msgid "multiple iterating variables in fast enumeration"
  msgstr ""
  
! #: c/c-parser.c:5566
  #, gcc-internal-format
  msgid "invalid iterating variable in fast enumeration"
  msgstr ""
  
! #: c/c-parser.c:5587 cp/parser.c:10434
  #, gcc-internal-format
  msgid "missing loop condition in loop with %<GCC ivdep%> pragma"
  msgstr ""
  
! #: c/c-parser.c:5619
  #, gcc-internal-format
  msgid "missing collection in fast enumeration"
  msgstr ""
  
! #: c/c-parser.c:5694
  #, gcc-internal-format
  msgid "%E qualifier ignored on asm"
  msgstr ""
  
! #: c/c-parser.c:6044
  #, gcc-internal-format
  msgid "ISO C forbids omitting the middle term of a ?: expression"
  msgstr ""
  
! #: c/c-parser.c:6530
  #, gcc-internal-format
  msgid "traditional C rejects the unary plus operator"
  msgstr ""
  
! #: c/c-parser.c:6659
  #, gcc-internal-format
  msgid "%<sizeof%> applied to a bit-field"
  msgstr ""
  
! #: c/c-parser.c:6737
  #, gcc-internal-format
  msgid "ISO C does not allow %<%E (expression)%>"
  msgstr ""
  
! #: c/c-parser.c:6764
  #, gcc-internal-format
  msgid "cannot take address of %qs"
  msgstr ""
  
! #: c/c-parser.c:6846
  #, gcc-internal-format
  msgid "ISO C99 does not support %<_Generic%>"
  msgstr ""
  
! #: c/c-parser.c:6849
  #, gcc-internal-format
  msgid "ISO C90 does not support %<_Generic%>"
  msgstr ""
  
! #: c/c-parser.c:6915
  #, gcc-internal-format
  msgid "%<_Generic%> association has function type"
  msgstr ""
  
! #: c/c-parser.c:6918
  #, gcc-internal-format
  msgid "%<_Generic%> association has incomplete type"
  msgstr ""
  
! #: c/c-parser.c:6922
  #, gcc-internal-format
  msgid "%<_Generic%> association has variable length type"
  msgstr ""
  
! #: c/c-parser.c:6946
  #, gcc-internal-format
  msgid "duplicate %<default%> case in %<_Generic%>"
  msgstr ""
  
! #: c/c-parser.c:6947
  #, gcc-internal-format
  msgid "original %<default%> is here"
  msgstr ""
  
! #: c/c-parser.c:6955
  #, gcc-internal-format
  msgid "%<_Generic%> specifies two compatible types"
  msgstr ""
  
! #: c/c-parser.c:6956
  #, gcc-internal-format
  msgid "compatible type is here"
  msgstr ""
  
! #: c/c-parser.c:6979
  #, gcc-internal-format
  msgid "%<_Generic> selector matches multiple associations"
  msgstr ""
  
! #: c/c-parser.c:6981
  #, gcc-internal-format
  msgid "other match is here"
  msgstr ""
  
! #: c/c-parser.c:7002
  #, gcc-internal-format
  msgid ""
  "%<_Generic%> selector of type %qT is not compatible with any association"
  msgstr ""
  
! #: c/c-parser.c:7157 c/c-parser.c:7692 c/c-parser.c:7711
  #, gcc-internal-format
  msgid "expected expression"
  msgstr ""
  
! #: c/c-parser.c:7175
  #, gcc-internal-format
  msgid "braced-group within expression allowed only inside a function"
  msgstr ""
  
! #: c/c-parser.c:7188
  #, gcc-internal-format
  msgid "ISO C forbids braced-groups within expressions"
  msgstr ""
  
! #: c/c-parser.c:7232
  #, gcc-internal-format
  msgid "ISO C does not support %<__FUNCTION__%> predefined identifier"
  msgstr ""
  
! #: c/c-parser.c:7240
  #, gcc-internal-format
  msgid "ISO C does not support %<__PRETTY_FUNCTION__%> predefined identifier"
  msgstr ""
  
! #: c/c-parser.c:7248
  #, gcc-internal-format
  msgid "ISO C90 does not support %<__func__%> predefined identifier"
  msgstr ""
  
! #: c/c-parser.c:7399
  #, gcc-internal-format
  msgid "wrong number of arguments to %<__builtin_choose_expr%>"
  msgstr ""
  
! #: c/c-parser.c:7415
  #, gcc-internal-format
  msgid "first argument to %<__builtin_choose_expr%> not a constant"
  msgstr ""
  
! #: c/c-parser.c:7481
  #, gcc-internal-format
  msgid "wrong number of arguments to %<__builtin_call_with_static_chain%>"
  msgstr ""
  
! #: c/c-parser.c:7494
  #, gcc-internal-format
  msgid ""
  "first argument to %<__builtin_call_with_static_chain%> must be a call "
  "expression"
  msgstr ""
  
! #: c/c-parser.c:7498
  #, gcc-internal-format
  msgid ""
  "second argument to %<__builtin_call_with_static_chain%> must be a pointer "
  "type"
  msgstr ""
  
! #: c/c-parser.c:7521
  #, gcc-internal-format
  msgid "wrong number of arguments to %<__builtin_complex%>"
  msgstr ""
  
! #: c/c-parser.c:7543
  #, gcc-internal-format
  msgid "%<__builtin_complex%> operand not of real binary floating-point type"
  msgstr ""
  
! #: c/c-parser.c:7552
  #, gcc-internal-format
  msgid "%<__builtin_complex%> operands of different types"
  msgstr ""
  
! #: c/c-parser.c:7597 cp/parser.c:6060
  #, gcc-internal-format
  msgid "wrong number of arguments to %<__builtin_shuffle%>"
  msgstr ""
  
! #: c/c-parser.c:7671 cp/parser.c:6014
  #, gcc-internal-format
  msgid "-fcilkplus must be enabled to use %<_Cilk_spawn%>"
  msgstr ""
  
! #: c/c-parser.c:7678 cp/parser.c:6020
  #, gcc-internal-format
  msgid "consecutive %<_Cilk_spawn%> keywords are not permitted"
  msgstr ""
  
! #: c/c-parser.c:7746
  #, gcc-internal-format
  msgid "compound literal has variable size"
  msgstr ""
  
! #: c/c-parser.c:7757
  #, gcc-internal-format
  msgid "compound literal qualified by address-space qualifier"
  msgstr ""
  
! #: c/c-parser.c:7761
  #, gcc-internal-format
  msgid "ISO C90 forbids compound literals"
  msgstr ""
  
! #: c/c-parser.c:7890 cp/parser.c:6306
  #, gcc-internal-format
  msgid ""
  "%<memset%> used with constant zero length parameter; this could be due to "
  "transposed parameters"
  msgstr ""
  
! #: c/c-parser.c:8237
  #, gcc-internal-format
  msgid "expected identifier or %<)%>"
  msgstr ""
  
! #: c/c-parser.c:8333
  #, gcc-internal-format
  msgid "extra semicolon"
  msgstr ""
  
! #: c/c-parser.c:8581
  #, gcc-internal-format
  msgid "extra semicolon in method definition specified"
  msgstr ""
  
! #: c/c-parser.c:8713
  #, gcc-internal-format
  msgid "method attributes must be specified at the end only"
  msgstr ""
  
! #: c/c-parser.c:8733
  #, gcc-internal-format
  msgid "expected %<;%> or %<{%> after method attribute definition"
  msgstr ""
  
! #: c/c-parser.c:8854
  #, gcc-internal-format
  msgid "objective-c method declaration is expected"
  msgstr ""
  
! #: c/c-parser.c:9289
  #, gcc-internal-format
  msgid "no type or storage class may be specified here,"
  msgstr ""
  
! #: c/c-parser.c:9379 c/c-parser.c:9436 cp/parser.c:27421
  #, gcc-internal-format
  msgid "unknown property attribute"
  msgstr ""
  
! #: c/c-parser.c:9400 cp/parser.c:27381
  #, gcc-internal-format
  msgid "missing %<=%> (after %<getter%> attribute)"
  msgstr ""
  
! #: c/c-parser.c:9403 cp/parser.c:27384
  #, gcc-internal-format
  msgid "missing %<=%> (after %<setter%> attribute)"
  msgstr ""
  
! #: c/c-parser.c:9417 cp/parser.c:27399
  #, gcc-internal-format
  msgid "the %<setter%> attribute may only be specified once"
  msgstr ""
  
! #: c/c-parser.c:9422 cp/parser.c:27405
  #, gcc-internal-format
  msgid "setter name must terminate with %<:%>"
  msgstr ""
  
! #: c/c-parser.c:9429 cp/parser.c:27413
  #, gcc-internal-format
  msgid "the %<getter%> attribute may only be specified once"
  msgstr ""
  
! #: c/c-parser.c:9623
  #, gcc-internal-format
  msgid "%<#pragma acc update%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9634 cp/parser.c:32980
  #, gcc-internal-format
  msgid "%<#pragma omp barrier%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9645 cp/parser.c:32995
  #, gcc-internal-format
  msgid "%<#pragma omp flush%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9656 cp/parser.c:33011
  #, gcc-internal-format
  msgid "%<#pragma omp taskwait%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9667 cp/parser.c:33027
  #, gcc-internal-format
  msgid "%<#pragma omp taskyield%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9678 cp/parser.c:33043
  #, gcc-internal-format
  msgid "%<#pragma omp cancel%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9689 cp/parser.c:33059
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp cancellation point%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9709 cp/parser.c:33111
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp section%> may only be used in %<#pragma omp sections%> "
  "construct"
  msgstr ""
  
! #: c/c-parser.c:9724 cp/parser.c:33130
  #, gcc-internal-format
  msgid "for, while or do statement expected"
  msgstr ""
  
! #: c/c-parser.c:9736 cp/parser.c:32970
  #, gcc-internal-format
  msgid "%<#pragma GCC pch_preprocess%> must be first"
  msgstr ""
  
! #: c/c-parser.c:9749
  #, gcc-internal-format
  msgid "%<#pragma grainsize%> ignored because -fcilkplus is not enabled"
  msgstr ""
  
! #: c/c-parser.c:9757
  #, gcc-internal-format
  msgid "%<#pragma grainsize%> must be inside a function"
  msgstr ""
  
! #: c/c-parser.c:10035 cp/parser.c:27769
  #, gcc-internal-format
  msgid "too many %qs clauses"
  msgstr ""
  
! #: c/c-parser.c:10056 cp/parser.c:28111
  #, gcc-internal-format
  msgid "expected integer expression before ')'"
  msgstr ""
  
! #: c/c-parser.c:10071
  #, gcc-internal-format
  msgid "expression must be integral"
  msgstr ""
  
! #: c/c-parser.c:10184 c/c-parser.c:10192 cp/parser.c:27869 cp/parser.c:27877
  #, gcc-internal-format
  msgid "%qD is not a constant"
  msgstr ""
  
! #: c/c-parser.c:10338 c/c-parser.c:14741 cp/parser.c:28040
  #, gcc-internal-format
  msgid "%qD is not a variable"
  msgstr ""
  
! #: c/c-parser.c:10342 cp/parser.c:28044
  #, gcc-internal-format
  msgid "%qD is not a pointer variable"
  msgstr ""
  
! #: c/c-parser.c:10382 cp/parser.c:28189
  #, gcc-internal-format
  msgid "collapse argument needs positive constant integer expression"
  msgstr ""
  
! #: c/c-parser.c:10448 cp/parser.c:28240
  #, gcc-internal-format
  msgid "expected %<none%> or %<shared%>"
  msgstr ""
  
! #: c/c-parser.c:10583 c/c-parser.c:10628 c/c-parser.c:10673 c/c-parser.c:10717
! #: c/c-parser.c:10955 c/c-parser.c:11018 c/c-parser.c:11095 c/c-parser.c:11139
! #: c/c-parser.c:11441
  #, gcc-internal-format
  msgid "expected integer expression"
  msgstr ""
  
! #: c/c-parser.c:10595
  #, gcc-internal-format
  msgid "%<num_gangs%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:10640
  #, gcc-internal-format
  msgid "%<num_threads%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:10685
  #, gcc-internal-format
  msgid "%<num_workers%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:10846
  #, gcc-internal-format
  msgid ""
  "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, %<|%>, %<&&%>, %<||%>, %<min%> "
  "or %<max%>"
  msgstr ""
  
! #: c/c-parser.c:10946 cp/parser.c:28642
  #, gcc-internal-format
  msgid "schedule %<runtime%> does not take a %<chunk_size%> parameter"
  msgstr ""
  
! #: c/c-parser.c:10950 cp/parser.c:28645
  #, gcc-internal-format
  msgid "schedule %<auto%> does not take a %<chunk_size%> parameter"
  msgstr ""
  
! #: c/c-parser.c:10968 cp/parser.c:28661
  #, gcc-internal-format
  msgid "invalid schedule kind"
  msgstr ""
  
! #: c/c-parser.c:11030
  #, gcc-internal-format
  msgid "%<vector_length%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:11106
  #, gcc-internal-format
  msgid "%<num_teams%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:11150
  #, gcc-internal-format
  msgid "%<thread_limit%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:11192 cp/semantics.c:5731
  #, gcc-internal-format
  msgid ""
  "%<aligned%> clause alignment expression must be positive constant integer "
  "expression"
  msgstr ""
  
! #: c/c-parser.c:11229 cp/parser.c:28833
  #, gcc-internal-format
  msgid "using parameters for %<linear%> step is not supported yet"
  msgstr ""
  
! #: c/c-parser.c:11234
  #, gcc-internal-format
  msgid "%<linear%> clause step expression must be integral"
  msgstr ""
  
! #: c/c-parser.c:11271
  #, gcc-internal-format
  msgid ""
  "%<safelen%> clause expression must be positive constant integer expression"
  msgstr ""
  
! #: c/c-parser.c:11307
  #, gcc-internal-format
  msgid ""
  "%<simdlen%> clause expression must be positive constant integer expression"
  msgstr ""
  
! #: c/c-parser.c:11369 cp/parser.c:28954 cp/parser.c:29137
  #, gcc-internal-format
  msgid "invalid depend kind"
  msgstr ""
  
! #: c/c-parser.c:11406 cp/parser.c:28994
  #, gcc-internal-format
  msgid "invalid map kind"
  msgstr ""
  
! #: c/c-parser.c:11471 cp/parser.c:29084
  #, gcc-internal-format
  msgid "invalid dist_schedule kind"
  msgstr ""
  
! #: c/c-parser.c:11540
  #, gcc-internal-format
  msgid "invalid proc_bind kind"
  msgstr ""
  
! #: c/c-parser.c:11703 cp/parser.c:29293
  #, gcc-internal-format
  msgid "expected %<#pragma acc%> clause"
  msgstr ""
  
! #: c/c-parser.c:11714 c/c-parser.c:11943 cp/parser.c:29304 cp/parser.c:29555
  #, gcc-internal-format
  msgid "%qs is not valid for %qs"
  msgstr ""
  
! #: c/c-parser.c:11840 cp/parser.c:29445
  #, gcc-internal-format
  msgid "%qs must be the first clause of %qs"
  msgstr ""
  
! #: c/c-parser.c:11932 cp/parser.c:29544
  #, gcc-internal-format
  msgid "expected %<#pragma omp%> clause"
  msgstr ""
  
! #: c/c-parser.c:12125 cp/parser.c:31627
  #, gcc-internal-format
  msgid "expected %<data%> in %<#pragma acc enter data%>"
  msgstr ""
  
! #: c/c-parser.c:12134 cp/parser.c:31637
  #, gcc-internal-format
  msgid "invalid pragma"
  msgstr ""
  
! #: c/c-parser.c:12151 cp/parser.c:31654
  #, gcc-internal-format
  msgid "%<#pragma acc enter data%> has no data movement clause"
  msgstr ""
  
! #: c/c-parser.c:12278 cp/parser.c:31793
  #, gcc-internal-format
  msgid ""
  "%<#pragma acc update%> must contain at least one %<device%> or %<host/self%> "
  "clause"
  msgstr ""
  
! #: c/c-parser.c:12666 cp/parser.c:29921 cp/parser.c:29947
  #, gcc-internal-format
  msgid "invalid form of %<#pragma omp atomic%>"
  msgstr ""
  
! #: c/c-parser.c:12670 cp/parser.c:29978 cp/parser.c:29994
  #, gcc-internal-format
  msgid "invalid operator for %<#pragma omp atomic%>"
  msgstr ""
  
! #: c/c-parser.c:12714 cp/semantics.c:6897 cp/semantics.c:6907
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp atomic capture%> uses two different expressions for memory"
  msgstr ""
  
! #: c/c-parser.c:12767 c/c-parser.c:12788
  #, gcc-internal-format
  msgid "expected %<(%> or end of line"
  msgstr ""
  
! #: c/c-parser.c:12825 cp/parser.c:30451 cp/parser.c:33496
  #, gcc-internal-format
  msgid "for statement expected"
  msgstr ""
  
! #: c/c-parser.c:12831 cp/parser.c:30457
  #, gcc-internal-format
  msgid "_Cilk_for statement expected"
  msgstr ""
  
! #: c/c-parser.c:12885 cp/semantics.c:6531 cp/semantics.c:6601
  #, gcc-internal-format
  msgid "expected iteration declaration or initialization"
  msgstr ""
  
! #: c/c-parser.c:12970
  #, gcc-internal-format
  msgid "not enough perfectly nested loops"
  msgstr ""
  
! #: c/c-parser.c:13026 cp/parser.c:30666
  #, gcc-internal-format
  msgid "collapsed loops not perfectly nested"
  msgstr ""
  
! #: c/c-parser.c:13066 cp/parser.c:30500 cp/parser.c:30542 cp/pt.c:13808
  #, gcc-internal-format
  msgid "iteration variable %qD should not be firstprivate"
  msgstr ""
  
! #: c/c-parser.c:13441 cp/parser.c:31010
  #, gcc-internal-format
  msgid "expected %<for%> after %qs"
  msgstr ""
  
! #: c/c-parser.c:13633 cp/parser.c:31197
  #, gcc-internal-format
  msgid "expected %<point%>"
  msgstr ""
  
! #: c/c-parser.c:13838 cp/parser.c:31420
  #, gcc-internal-format
  msgid "%<#pragma omp target update%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:13851 cp/parser.c:31433
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp target update%> must contain at least one %<from%> or %<to%> "
  "clauses"
  msgstr ""
  
! #: c/c-parser.c:13993
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> must be followed by function declaration or "
  "definition or another %<#pragma omp declare simd%>"
  msgstr ""
  
! #: c/c-parser.c:14044 c/c-parser.c:14072
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> must be followed by function declaration or "
  "definition"
  msgstr ""
  
! #: c/c-parser.c:14091 cp/parser.c:31908
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> cannot be used in the same function marked as a "
  "Cilk Plus SIMD-enabled function"
  msgstr ""
  
! #: c/c-parser.c:14104
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> not immediately followed by a function "
  "declaration or definition"
  msgstr ""
  
! #: c/c-parser.c:14112 cp/parser.c:31964
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> not immediately followed by a single function "
  "declaration or definition"
  msgstr ""
  
! #: c/c-parser.c:14210 cp/parser.c:32032
  #, gcc-internal-format
  msgid "expected %<target%>"
  msgstr ""
  
! #: c/c-parser.c:14217 cp/parser.c:32039
  #, gcc-internal-format
  msgid "expected %<declare%>"
  msgstr ""
  
! #: c/c-parser.c:14223 cp/parser.c:32046
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp end declare target%> without corresponding %<#pragma omp "
  "declare target%>"
  msgstr ""
  
! #: c/c-parser.c:14251
  #, gcc-internal-format
  msgid "%<#pragma omp declare reduction%> not at file or block scope"
  msgstr ""
  
! #: c/c-parser.c:14301
  #, gcc-internal-format
  msgid ""
  "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, %<|%>, %<&&%>, %<||%>, %<min%> "
  "or identifier"
  msgstr ""
  
! #: c/c-parser.c:14328
  #, gcc-internal-format
  msgid "predeclared arithmetic type in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: c/c-parser.c:14332
  #, gcc-internal-format
  msgid "function or array type in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: c/c-parser.c:14335
  #, gcc-internal-format
  msgid ""
  "const, volatile or restrict qualified type in %<#pragma omp declare reduction"
  "%>"
  msgstr ""
  
! #: c/c-parser.c:14343
  #, gcc-internal-format
  msgid "redeclaration of %qs %<#pragma omp declare reduction%> for type %qT"
  msgstr ""
  
! #: c/c-parser.c:14352
  #, gcc-internal-format
  msgid "previous %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: c/c-parser.c:14469
  #, gcc-internal-format
  msgid "expected %<omp_priv%> or function-name"
  msgstr ""
  
! #: c/c-parser.c:14480
  #, gcc-internal-format
  msgid "expected function-name %<(%>"
  msgstr ""
  
! #: c/c-parser.c:14495
  #, gcc-internal-format
  msgid "one of the initializer call arguments should be %<&omp_priv%>"
  msgstr ""
  
! #: c/c-parser.c:14615 cp/parser.c:32490
  #, gcc-internal-format
  msgid "expected %<simd%> or %<reduction%> or %<target%>"
  msgstr ""
  
! #: c/c-parser.c:14743 cp/semantics.c:6086
  #, gcc-internal-format
  msgid "%qE declared %<threadprivate%> after first use"
  msgstr ""
  
! #: c/c-parser.c:14745 cp/semantics.c:6088
  #, gcc-internal-format
  msgid "automatic variable %qE cannot be %<threadprivate%>"
  msgstr ""
  
! #: c/c-parser.c:14749 cp/semantics.c:6090
  #, gcc-internal-format
  msgid "%<threadprivate%> %qE has incomplete type"
  msgstr ""
  
! #: c/c-parser.c:14780
  #, gcc-internal-format
  msgid "pragma simd ignored because -fcilkplus is not enabled"
  msgstr ""
  
! #: c/c-parser.c:14786
  #, gcc-internal-format
  msgid "pragma simd must be inside a function"
  msgstr ""
  
! #: c/c-parser.c:14830 cp/parser.c:33267
  #, gcc-internal-format
  msgid "vectorlength must be an integer constant"
  msgstr ""
  
! #: c/c-parser.c:14832 cp/parser.c:33270
  #, gcc-internal-format
  msgid "vectorlength must be a power of 2"
  msgstr ""
  
! #: c/c-parser.c:14915 cp/parser.c:33377
  #, gcc-internal-format
  msgid "step size must be an integer constant expression or an integer variable"
  msgstr ""
  
! #: c/c-parser.c:15014 cp/parser.c:33470
  #, gcc-internal-format
  msgid "expected %<#pragma simd%> clause"
  msgstr ""
  
! #: c/c-parser.c:15058 cp/parser.c:32943
  #, gcc-internal-format
  msgid "%<#pragma cilk grainsize%> is not followed by %<_Cilk_for%>"
  msgstr ""
  
! #: c/c-parser.c:15355 cp/parser.c:32835
  #, gcc-internal-format
  msgid "%<__transaction_cancel%> without transactional memory support enabled"
  msgstr ""
  
! #: c/c-parser.c:15361 cp/parser.c:32841
  #, gcc-internal-format
  msgid "%<__transaction_cancel%> within a %<__transaction_relaxed%>"
  msgstr ""
  
! #: c/c-parser.c:15370 cp/parser.c:32850
  #, gcc-internal-format
  msgid ""
  "outer %<__transaction_cancel%> not within outer %<__transaction_atomic%>"
  msgstr ""
  
! #: c/c-parser.c:15372 cp/parser.c:32853
  #, gcc-internal-format
  msgid "  or a %<transaction_may_cancel_outer%> function"
  msgstr ""
  
! #: c/c-parser.c:15378 cp/parser.c:32859
  #, gcc-internal-format
  msgid "%<__transaction_cancel%> not within %<__transaction_atomic%>"
  msgstr ""
  
! #: c/c-parser.c:15446 cp/cp-array-notation.c:1418
  #, gcc-internal-format
  msgid "base of array section must be pointer or array type"
  msgstr ""
  
! #: c/c-parser.c:15455 cp/parser.c:6476
  #, gcc-internal-format
  msgid "expected %<:%> or numeral"
  msgstr ""
  
! #: c/c-parser.c:15466
  #, gcc-internal-format
  msgid ""
  "start-index and length fields necessary for using array notations in pointers"
  msgstr ""
  
! #: c/c-parser.c:15473 c/c-parser.c:15516
  #, gcc-internal-format
  msgid "array notations cannot be used with function type"
  msgstr ""
  
! #: c/c-parser.c:15482
  #, gcc-internal-format
  msgid ""
  "start-index and length fields necessary for using array notations in "
  "dimensionless arrays"
  msgstr ""
  
! #: c/c-parser.c:15494
  #, gcc-internal-format
  msgid ""
  "start-index and length fields necessary for using array notations in "
  "variable-length arrays"
  msgstr ""
  
! #: c/c-parser.c:15544 c/c-parser.c:15547
  #, gcc-internal-format
  msgid "expected array notation expression"
  msgstr ""
--- 30967,31833 ----
  #. c_parser_skip_until_found stops at a closing nesting
  #. delimiter without consuming it, but here we need to consume
  #. it to proceed further.
! #: c/c-parser.c:5113 cp/parser.c:9815
  #, gcc-internal-format
  msgid "expected statement"
  msgstr ""
  
! #: c/c-parser.c:5207 cp/parser.c:10192
  #, gcc-internal-format
  msgid "suggest braces around empty body in an %<if%> statement"
  msgstr ""
  
! #: c/c-parser.c:5231 cp/parser.c:10215
  #, gcc-internal-format
  msgid "suggest braces around empty body in an %<else%> statement"
  msgstr ""
  
! #: c/c-parser.c:5265
  #, gcc-internal-format
  msgid "if statement cannot contain %<Cilk_spawn%>"
  msgstr ""
  
! #: c/c-parser.c:5394
  #, gcc-internal-format
  msgid "suggest braces around empty body in %<do%> statement"
  msgstr ""
  
! #: c/c-parser.c:5518 c/c-parser.c:5548
  #, gcc-internal-format
  msgid "multiple iterating variables in fast enumeration"
  msgstr ""
  
! #: c/c-parser.c:5572
  #, gcc-internal-format
  msgid "invalid iterating variable in fast enumeration"
  msgstr ""
  
! #: c/c-parser.c:5593 cp/parser.c:10435
  #, gcc-internal-format
  msgid "missing loop condition in loop with %<GCC ivdep%> pragma"
  msgstr ""
  
! #: c/c-parser.c:5625
  #, gcc-internal-format
  msgid "missing collection in fast enumeration"
  msgstr ""
  
! #: c/c-parser.c:5700
  #, gcc-internal-format
  msgid "%E qualifier ignored on asm"
  msgstr ""
  
! #: c/c-parser.c:6050
  #, gcc-internal-format
  msgid "ISO C forbids omitting the middle term of a ?: expression"
  msgstr ""
  
! #: c/c-parser.c:6536
  #, gcc-internal-format
  msgid "traditional C rejects the unary plus operator"
  msgstr ""
  
! #: c/c-parser.c:6665
  #, gcc-internal-format
  msgid "%<sizeof%> applied to a bit-field"
  msgstr ""
  
! #: c/c-parser.c:6743
  #, gcc-internal-format
  msgid "ISO C does not allow %<%E (expression)%>"
  msgstr ""
  
! #: c/c-parser.c:6770
  #, gcc-internal-format
  msgid "cannot take address of %qs"
  msgstr ""
  
! #: c/c-parser.c:6852
  #, gcc-internal-format
  msgid "ISO C99 does not support %<_Generic%>"
  msgstr ""
  
! #: c/c-parser.c:6855
  #, gcc-internal-format
  msgid "ISO C90 does not support %<_Generic%>"
  msgstr ""
  
! #: c/c-parser.c:6921
  #, gcc-internal-format
  msgid "%<_Generic%> association has function type"
  msgstr ""
  
! #: c/c-parser.c:6924
  #, gcc-internal-format
  msgid "%<_Generic%> association has incomplete type"
  msgstr ""
  
! #: c/c-parser.c:6928
  #, gcc-internal-format
  msgid "%<_Generic%> association has variable length type"
  msgstr ""
  
! #: c/c-parser.c:6952
  #, gcc-internal-format
  msgid "duplicate %<default%> case in %<_Generic%>"
  msgstr ""
  
! #: c/c-parser.c:6953
  #, gcc-internal-format
  msgid "original %<default%> is here"
  msgstr ""
  
! #: c/c-parser.c:6961
  #, gcc-internal-format
  msgid "%<_Generic%> specifies two compatible types"
  msgstr ""
  
! #: c/c-parser.c:6962
  #, gcc-internal-format
  msgid "compatible type is here"
  msgstr ""
  
! #: c/c-parser.c:6985
  #, gcc-internal-format
  msgid "%<_Generic> selector matches multiple associations"
  msgstr ""
  
! #: c/c-parser.c:6987
  #, gcc-internal-format
  msgid "other match is here"
  msgstr ""
  
! #: c/c-parser.c:7008
  #, gcc-internal-format
  msgid ""
  "%<_Generic%> selector of type %qT is not compatible with any association"
  msgstr ""
  
! #: c/c-parser.c:7163 c/c-parser.c:7698 c/c-parser.c:7717
  #, gcc-internal-format
  msgid "expected expression"
  msgstr ""
  
! #: c/c-parser.c:7181
  #, gcc-internal-format
  msgid "braced-group within expression allowed only inside a function"
  msgstr ""
  
! #: c/c-parser.c:7194
  #, gcc-internal-format
  msgid "ISO C forbids braced-groups within expressions"
  msgstr ""
  
! #: c/c-parser.c:7238
  #, gcc-internal-format
  msgid "ISO C does not support %<__FUNCTION__%> predefined identifier"
  msgstr ""
  
! #: c/c-parser.c:7246
  #, gcc-internal-format
  msgid "ISO C does not support %<__PRETTY_FUNCTION__%> predefined identifier"
  msgstr ""
  
! #: c/c-parser.c:7254
  #, gcc-internal-format
  msgid "ISO C90 does not support %<__func__%> predefined identifier"
  msgstr ""
  
! #: c/c-parser.c:7405
  #, gcc-internal-format
  msgid "wrong number of arguments to %<__builtin_choose_expr%>"
  msgstr ""
  
! #: c/c-parser.c:7421
  #, gcc-internal-format
  msgid "first argument to %<__builtin_choose_expr%> not a constant"
  msgstr ""
  
! #: c/c-parser.c:7487
  #, gcc-internal-format
  msgid "wrong number of arguments to %<__builtin_call_with_static_chain%>"
  msgstr ""
  
! #: c/c-parser.c:7500
  #, gcc-internal-format
  msgid ""
  "first argument to %<__builtin_call_with_static_chain%> must be a call "
  "expression"
  msgstr ""
  
! #: c/c-parser.c:7504
  #, gcc-internal-format
  msgid ""
  "second argument to %<__builtin_call_with_static_chain%> must be a pointer "
  "type"
  msgstr ""
  
! #: c/c-parser.c:7527
  #, gcc-internal-format
  msgid "wrong number of arguments to %<__builtin_complex%>"
  msgstr ""
  
! #: c/c-parser.c:7549
  #, gcc-internal-format
  msgid "%<__builtin_complex%> operand not of real binary floating-point type"
  msgstr ""
  
! #: c/c-parser.c:7558
  #, gcc-internal-format
  msgid "%<__builtin_complex%> operands of different types"
  msgstr ""
  
! #: c/c-parser.c:7603 cp/parser.c:6061
  #, gcc-internal-format
  msgid "wrong number of arguments to %<__builtin_shuffle%>"
  msgstr ""
  
! #: c/c-parser.c:7677 cp/parser.c:6015
  #, gcc-internal-format
  msgid "-fcilkplus must be enabled to use %<_Cilk_spawn%>"
  msgstr ""
  
! #: c/c-parser.c:7684 cp/parser.c:6021
  #, gcc-internal-format
  msgid "consecutive %<_Cilk_spawn%> keywords are not permitted"
  msgstr ""
  
! #: c/c-parser.c:7752
  #, gcc-internal-format
  msgid "compound literal has variable size"
  msgstr ""
  
! #: c/c-parser.c:7763
  #, gcc-internal-format
  msgid "compound literal qualified by address-space qualifier"
  msgstr ""
  
! #: c/c-parser.c:7767
  #, gcc-internal-format
  msgid "ISO C90 forbids compound literals"
  msgstr ""
  
! #: c/c-parser.c:7896 cp/parser.c:6307
  #, gcc-internal-format
  msgid ""
  "%<memset%> used with constant zero length parameter; this could be due to "
  "transposed parameters"
  msgstr ""
  
! #: c/c-parser.c:8243
  #, gcc-internal-format
  msgid "expected identifier or %<)%>"
  msgstr ""
  
! #: c/c-parser.c:8339
  #, gcc-internal-format
  msgid "extra semicolon"
  msgstr ""
  
! #: c/c-parser.c:8587
  #, gcc-internal-format
  msgid "extra semicolon in method definition specified"
  msgstr ""
  
! #: c/c-parser.c:8719
  #, gcc-internal-format
  msgid "method attributes must be specified at the end only"
  msgstr ""
  
! #: c/c-parser.c:8739
  #, gcc-internal-format
  msgid "expected %<;%> or %<{%> after method attribute definition"
  msgstr ""
  
! #: c/c-parser.c:8860
  #, gcc-internal-format
  msgid "objective-c method declaration is expected"
  msgstr ""
  
! #: c/c-parser.c:9295
  #, gcc-internal-format
  msgid "no type or storage class may be specified here,"
  msgstr ""
  
! #: c/c-parser.c:9385 c/c-parser.c:9442 cp/parser.c:27462
  #, gcc-internal-format
  msgid "unknown property attribute"
  msgstr ""
  
! #: c/c-parser.c:9406 cp/parser.c:27422
  #, gcc-internal-format
  msgid "missing %<=%> (after %<getter%> attribute)"
  msgstr ""
  
! #: c/c-parser.c:9409 cp/parser.c:27425
  #, gcc-internal-format
  msgid "missing %<=%> (after %<setter%> attribute)"
  msgstr ""
  
! #: c/c-parser.c:9423 cp/parser.c:27440
  #, gcc-internal-format
  msgid "the %<setter%> attribute may only be specified once"
  msgstr ""
  
! #: c/c-parser.c:9428 cp/parser.c:27446
  #, gcc-internal-format
  msgid "setter name must terminate with %<:%>"
  msgstr ""
  
! #: c/c-parser.c:9435 cp/parser.c:27454
  #, gcc-internal-format
  msgid "the %<getter%> attribute may only be specified once"
  msgstr ""
  
! #: c/c-parser.c:9629
  #, gcc-internal-format
  msgid "%<#pragma acc update%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9640 cp/parser.c:33022
  #, gcc-internal-format
  msgid "%<#pragma omp barrier%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9651 cp/parser.c:33037
  #, gcc-internal-format
  msgid "%<#pragma omp flush%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9662 cp/parser.c:33053
  #, gcc-internal-format
  msgid "%<#pragma omp taskwait%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9673 cp/parser.c:33069
  #, gcc-internal-format
  msgid "%<#pragma omp taskyield%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9684 cp/parser.c:33085
  #, gcc-internal-format
  msgid "%<#pragma omp cancel%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9695 cp/parser.c:33101
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp cancellation point%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:9715 cp/parser.c:33153
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp section%> may only be used in %<#pragma omp sections%> "
  "construct"
  msgstr ""
  
! #: c/c-parser.c:9730 cp/parser.c:33172
  #, gcc-internal-format
  msgid "for, while or do statement expected"
  msgstr ""
  
! #: c/c-parser.c:9742 cp/parser.c:33012
  #, gcc-internal-format
  msgid "%<#pragma GCC pch_preprocess%> must be first"
  msgstr ""
  
! #: c/c-parser.c:9755
  #, gcc-internal-format
  msgid "%<#pragma grainsize%> ignored because -fcilkplus is not enabled"
  msgstr ""
  
! #: c/c-parser.c:9763
  #, gcc-internal-format
  msgid "%<#pragma grainsize%> must be inside a function"
  msgstr ""
  
! #: c/c-parser.c:10041 cp/parser.c:27810
  #, gcc-internal-format
  msgid "too many %qs clauses"
  msgstr ""
  
! #: c/c-parser.c:10062 cp/parser.c:28152
  #, gcc-internal-format
  msgid "expected integer expression before ')'"
  msgstr ""
  
! #: c/c-parser.c:10077
  #, gcc-internal-format
  msgid "expression must be integral"
  msgstr ""
  
! #: c/c-parser.c:10190 c/c-parser.c:10198 cp/parser.c:27910 cp/parser.c:27918
  #, gcc-internal-format
  msgid "%qD is not a constant"
  msgstr ""
  
! #: c/c-parser.c:10344 c/c-parser.c:14787 cp/parser.c:28081
  #, gcc-internal-format
  msgid "%qD is not a variable"
  msgstr ""
  
! #: c/c-parser.c:10348 cp/parser.c:28085
  #, gcc-internal-format
  msgid "%qD is not a pointer variable"
  msgstr ""
  
! #: c/c-parser.c:10388 cp/parser.c:28230
  #, gcc-internal-format
  msgid "collapse argument needs positive constant integer expression"
  msgstr ""
  
! #: c/c-parser.c:10454 cp/parser.c:28281
  #, gcc-internal-format
  msgid "expected %<none%> or %<shared%>"
  msgstr ""
  
! #: c/c-parser.c:10589 c/c-parser.c:10634 c/c-parser.c:10679 c/c-parser.c:10723
! #: c/c-parser.c:10961 c/c-parser.c:11024 c/c-parser.c:11101 c/c-parser.c:11145
! #: c/c-parser.c:11447
  #, gcc-internal-format
  msgid "expected integer expression"
  msgstr ""
  
! #: c/c-parser.c:10601
  #, gcc-internal-format
  msgid "%<num_gangs%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:10646
  #, gcc-internal-format
  msgid "%<num_threads%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:10691
  #, gcc-internal-format
  msgid "%<num_workers%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:10852
  #, gcc-internal-format
  msgid ""
  "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, %<|%>, %<&&%>, %<||%>, %<min%> "
  "or %<max%>"
  msgstr ""
  
! #: c/c-parser.c:10952 cp/parser.c:28683
  #, gcc-internal-format
  msgid "schedule %<runtime%> does not take a %<chunk_size%> parameter"
  msgstr ""
  
! #: c/c-parser.c:10956 cp/parser.c:28686
  #, gcc-internal-format
  msgid "schedule %<auto%> does not take a %<chunk_size%> parameter"
  msgstr ""
  
! #: c/c-parser.c:10974 cp/parser.c:28702
  #, gcc-internal-format
  msgid "invalid schedule kind"
  msgstr ""
  
! #: c/c-parser.c:11036
  #, gcc-internal-format
  msgid "%<vector_length%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:11112
  #, gcc-internal-format
  msgid "%<num_teams%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:11156
  #, gcc-internal-format
  msgid "%<thread_limit%> value must be positive"
  msgstr ""
  
! #: c/c-parser.c:11198 cp/semantics.c:5735
  #, gcc-internal-format
  msgid ""
  "%<aligned%> clause alignment expression must be positive constant integer "
  "expression"
  msgstr ""
  
! #: c/c-parser.c:11235 cp/parser.c:28874
  #, gcc-internal-format
  msgid "using parameters for %<linear%> step is not supported yet"
  msgstr ""
  
! #: c/c-parser.c:11240
  #, gcc-internal-format
  msgid "%<linear%> clause step expression must be integral"
  msgstr ""
  
! #: c/c-parser.c:11277
  #, gcc-internal-format
  msgid ""
  "%<safelen%> clause expression must be positive constant integer expression"
  msgstr ""
  
! #: c/c-parser.c:11313
  #, gcc-internal-format
  msgid ""
  "%<simdlen%> clause expression must be positive constant integer expression"
  msgstr ""
  
! #: c/c-parser.c:11375 cp/parser.c:28995 cp/parser.c:29178
  #, gcc-internal-format
  msgid "invalid depend kind"
  msgstr ""
  
! #: c/c-parser.c:11412 cp/parser.c:29035
  #, gcc-internal-format
  msgid "invalid map kind"
  msgstr ""
  
! #: c/c-parser.c:11477 cp/parser.c:29125
  #, gcc-internal-format
  msgid "invalid dist_schedule kind"
  msgstr ""
  
! #: c/c-parser.c:11546
  #, gcc-internal-format
  msgid "invalid proc_bind kind"
  msgstr ""
  
! #: c/c-parser.c:11709 cp/parser.c:29334
  #, gcc-internal-format
  msgid "expected %<#pragma acc%> clause"
  msgstr ""
  
! #: c/c-parser.c:11720 c/c-parser.c:11949 cp/parser.c:29345 cp/parser.c:29596
  #, gcc-internal-format
  msgid "%qs is not valid for %qs"
  msgstr ""
  
! #: c/c-parser.c:11846 cp/parser.c:29486
  #, gcc-internal-format
  msgid "%qs must be the first clause of %qs"
  msgstr ""
  
! #: c/c-parser.c:11938 cp/parser.c:29585
  #, gcc-internal-format
  msgid "expected %<#pragma omp%> clause"
  msgstr ""
  
! #: c/c-parser.c:12131 cp/parser.c:31668
  #, gcc-internal-format
  msgid "expected %<data%> in %<#pragma acc enter data%>"
  msgstr ""
  
! #: c/c-parser.c:12140 cp/parser.c:31678
  #, gcc-internal-format
  msgid "invalid pragma"
  msgstr ""
  
! #: c/c-parser.c:12157 cp/parser.c:31695
  #, gcc-internal-format
  msgid "%<#pragma acc enter data%> has no data movement clause"
  msgstr ""
  
! #: c/c-parser.c:12284 cp/parser.c:31834
  #, gcc-internal-format
  msgid ""
  "%<#pragma acc update%> must contain at least one %<device%> or %<host/self%> "
  "clause"
  msgstr ""
  
! #: c/c-parser.c:12691 cp/parser.c:29962 cp/parser.c:29988
  #, gcc-internal-format
  msgid "invalid form of %<#pragma omp atomic%>"
  msgstr ""
  
! #: c/c-parser.c:12695 cp/parser.c:30019 cp/parser.c:30035
  #, gcc-internal-format
  msgid "invalid operator for %<#pragma omp atomic%>"
  msgstr ""
  
! #: c/c-parser.c:12744 cp/semantics.c:6902 cp/semantics.c:6912
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp atomic capture%> uses two different expressions for memory"
  msgstr ""
  
! #: c/c-parser.c:12797 c/c-parser.c:12818
  #, gcc-internal-format
  msgid "expected %<(%> or end of line"
  msgstr ""
  
! #: c/c-parser.c:12856 cp/parser.c:30492 cp/parser.c:33538
  #, gcc-internal-format
  msgid "for statement expected"
  msgstr ""
  
! #: c/c-parser.c:12862 cp/parser.c:30498
  #, gcc-internal-format
  msgid "_Cilk_for statement expected"
  msgstr ""
  
! #: c/c-parser.c:12931 cp/semantics.c:6536 cp/semantics.c:6606
  #, gcc-internal-format
  msgid "expected iteration declaration or initialization"
  msgstr ""
  
! #: c/c-parser.c:13016
  #, gcc-internal-format
  msgid "not enough perfectly nested loops"
  msgstr ""
  
! #: c/c-parser.c:13072 cp/parser.c:30707
  #, gcc-internal-format
  msgid "collapsed loops not perfectly nested"
  msgstr ""
  
! #: c/c-parser.c:13112 cp/parser.c:30541 cp/parser.c:30583 cp/pt.c:13884
  #, gcc-internal-format
  msgid "iteration variable %qD should not be firstprivate"
  msgstr ""
  
! #: c/c-parser.c:13487 cp/parser.c:31051
  #, gcc-internal-format
  msgid "expected %<for%> after %qs"
  msgstr ""
  
! #: c/c-parser.c:13679 cp/parser.c:31238
  #, gcc-internal-format
  msgid "expected %<point%>"
  msgstr ""
  
! #: c/c-parser.c:13884 cp/parser.c:31461
  #, gcc-internal-format
  msgid "%<#pragma omp target update%> may only be used in compound statements"
  msgstr ""
  
! #: c/c-parser.c:13897 cp/parser.c:31474
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp target update%> must contain at least one %<from%> or %<to%> "
  "clauses"
  msgstr ""
  
! #: c/c-parser.c:14039
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> must be followed by function declaration or "
  "definition or another %<#pragma omp declare simd%>"
  msgstr ""
  
! #: c/c-parser.c:14090 c/c-parser.c:14118
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> must be followed by function declaration or "
  "definition"
  msgstr ""
  
! #: c/c-parser.c:14137 cp/parser.c:31949
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> cannot be used in the same function marked as a "
  "Cilk Plus SIMD-enabled function"
  msgstr ""
  
! #: c/c-parser.c:14150
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> not immediately followed by a function "
  "declaration or definition"
  msgstr ""
  
! #: c/c-parser.c:14158 cp/parser.c:32005
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> not immediately followed by a single function "
  "declaration or definition"
  msgstr ""
  
! #: c/c-parser.c:14256 cp/parser.c:32073
  #, gcc-internal-format
  msgid "expected %<target%>"
  msgstr ""
  
! #: c/c-parser.c:14263 cp/parser.c:32080
  #, gcc-internal-format
  msgid "expected %<declare%>"
  msgstr ""
  
! #: c/c-parser.c:14269 cp/parser.c:32087
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp end declare target%> without corresponding %<#pragma omp "
  "declare target%>"
  msgstr ""
  
! #: c/c-parser.c:14297
  #, gcc-internal-format
  msgid "%<#pragma omp declare reduction%> not at file or block scope"
  msgstr ""
  
! #: c/c-parser.c:14347
  #, gcc-internal-format
  msgid ""
  "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, %<|%>, %<&&%>, %<||%>, %<min%> "
  "or identifier"
  msgstr ""
  
! #: c/c-parser.c:14374
  #, gcc-internal-format
  msgid "predeclared arithmetic type in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: c/c-parser.c:14378
  #, gcc-internal-format
  msgid "function or array type in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: c/c-parser.c:14381
  #, gcc-internal-format
  msgid ""
  "const, volatile or restrict qualified type in %<#pragma omp declare reduction"
  "%>"
  msgstr ""
  
! #: c/c-parser.c:14389
  #, gcc-internal-format
  msgid "redeclaration of %qs %<#pragma omp declare reduction%> for type %qT"
  msgstr ""
  
! #: c/c-parser.c:14398
  #, gcc-internal-format
  msgid "previous %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: c/c-parser.c:14515
  #, gcc-internal-format
  msgid "expected %<omp_priv%> or function-name"
  msgstr ""
  
! #: c/c-parser.c:14526
  #, gcc-internal-format
  msgid "expected function-name %<(%>"
  msgstr ""
  
! #: c/c-parser.c:14541
  #, gcc-internal-format
  msgid "one of the initializer call arguments should be %<&omp_priv%>"
  msgstr ""
  
! #: c/c-parser.c:14661 cp/parser.c:32532
  #, gcc-internal-format
  msgid "expected %<simd%> or %<reduction%> or %<target%>"
  msgstr ""
  
! #: c/c-parser.c:14789 cp/semantics.c:6090
  #, gcc-internal-format
  msgid "%qE declared %<threadprivate%> after first use"
  msgstr ""
  
! #: c/c-parser.c:14791 cp/semantics.c:6092
  #, gcc-internal-format
  msgid "automatic variable %qE cannot be %<threadprivate%>"
  msgstr ""
  
! #: c/c-parser.c:14795 cp/semantics.c:6094
  #, gcc-internal-format
  msgid "%<threadprivate%> %qE has incomplete type"
  msgstr ""
  
! #: c/c-parser.c:14826
  #, gcc-internal-format
  msgid "pragma simd ignored because -fcilkplus is not enabled"
  msgstr ""
  
! #: c/c-parser.c:14832
  #, gcc-internal-format
  msgid "pragma simd must be inside a function"
  msgstr ""
  
! #: c/c-parser.c:14876 cp/parser.c:33309
  #, gcc-internal-format
  msgid "vectorlength must be an integer constant"
  msgstr ""
  
! #: c/c-parser.c:14878 cp/parser.c:33312
  #, gcc-internal-format
  msgid "vectorlength must be a power of 2"
  msgstr ""
  
! #: c/c-parser.c:14961 cp/parser.c:33419
  #, gcc-internal-format
  msgid "step size must be an integer constant expression or an integer variable"
  msgstr ""
  
! #: c/c-parser.c:15060 cp/parser.c:33512
  #, gcc-internal-format
  msgid "expected %<#pragma simd%> clause"
  msgstr ""
  
! #: c/c-parser.c:15104 cp/parser.c:32985
  #, gcc-internal-format
  msgid "%<#pragma cilk grainsize%> is not followed by %<_Cilk_for%>"
  msgstr ""
  
! #: c/c-parser.c:15401 cp/parser.c:32877
  #, gcc-internal-format
  msgid "%<__transaction_cancel%> without transactional memory support enabled"
  msgstr ""
  
! #: c/c-parser.c:15407 cp/parser.c:32883
  #, gcc-internal-format
  msgid "%<__transaction_cancel%> within a %<__transaction_relaxed%>"
  msgstr ""
  
! #: c/c-parser.c:15416 cp/parser.c:32892
  #, gcc-internal-format
  msgid ""
  "outer %<__transaction_cancel%> not within outer %<__transaction_atomic%>"
  msgstr ""
  
! #: c/c-parser.c:15418 cp/parser.c:32895
  #, gcc-internal-format
  msgid "  or a %<transaction_may_cancel_outer%> function"
  msgstr ""
  
! #: c/c-parser.c:15424 cp/parser.c:32901
  #, gcc-internal-format
  msgid "%<__transaction_cancel%> not within %<__transaction_atomic%>"
  msgstr ""
  
! #: c/c-parser.c:15492 cp/cp-array-notation.c:1418
  #, gcc-internal-format
  msgid "base of array section must be pointer or array type"
  msgstr ""
  
! #: c/c-parser.c:15501 cp/parser.c:6477
  #, gcc-internal-format
  msgid "expected %<:%> or numeral"
  msgstr ""
  
! #: c/c-parser.c:15512
  #, gcc-internal-format
  msgid ""
  "start-index and length fields necessary for using array notations in pointers"
  msgstr ""
  
! #: c/c-parser.c:15519 c/c-parser.c:15562
  #, gcc-internal-format
  msgid "array notations cannot be used with function type"
  msgstr ""
  
! #: c/c-parser.c:15528
  #, gcc-internal-format
  msgid ""
  "start-index and length fields necessary for using array notations in "
  "dimensionless arrays"
  msgstr ""
  
! #: c/c-parser.c:15540
  #, gcc-internal-format
  msgid ""
  "start-index and length fields necessary for using array notations in "
  "variable-length arrays"
  msgstr ""
  
! #: c/c-parser.c:15590 c/c-parser.c:15593
  #, gcc-internal-format
  msgid "expected array notation expression"
  msgstr ""
*************** msgstr ""
*** 31654,31660 ****
  msgid "%qD has an incomplete type"
  msgstr ""
  
! #: c/c-typeck.c:261 c/c-typeck.c:9258 c/c-typeck.c:9300 cp/call.c:3955
  #, gcc-internal-format
  msgid "invalid use of void expression"
  msgstr ""
--- 31837,31843 ----
  msgid "%qD has an incomplete type"
  msgstr ""
  
! #: c/c-typeck.c:261 c/c-typeck.c:9271 c/c-typeck.c:9313 cp/call.c:3957
  #, gcc-internal-format
  msgid "invalid use of void expression"
  msgstr ""
*************** msgstr ""
*** 31760,31766 ****
  msgid "subscripted value is neither array nor pointer nor vector"
  msgstr ""
  
! #: c/c-typeck.c:2503 cp/typeck.c:3101 cp/typeck.c:3193
  #, gcc-internal-format
  msgid "array subscript is not an integer"
  msgstr ""
--- 31943,31949 ----
  msgid "subscripted value is neither array nor pointer nor vector"
  msgstr ""
  
! #: c/c-typeck.c:2503 cp/typeck.c:3102 cp/typeck.c:3194
  #, gcc-internal-format
  msgid "array subscript is not an integer"
  msgstr ""
*************** msgstr ""
*** 31891,31897 ****
  msgid "passing argument %d of %qE as signed due to prototype"
  msgstr ""
  
! #: c/c-typeck.c:3354 cp/call.c:6627
  #, gcc-internal-format
  msgid "implicit conversion from %qT to %qT when passing argument to function"
  msgstr ""
--- 32074,32080 ----
  msgid "passing argument %d of %qE as signed due to prototype"
  msgstr ""
  
! #: c/c-typeck.c:3354 cp/call.c:6631
  #, gcc-internal-format
  msgid "implicit conversion from %qT to %qT when passing argument to function"
  msgstr ""
*************** msgstr ""
*** 31921,31927 ****
  msgid "arithmetic on pointer to an incomplete type"
  msgstr ""
  
! #: c/c-typeck.c:3588 cp/typeck.c:5137
  #, gcc-internal-format
  msgid "arithmetic on pointer to an empty aggregate"
  msgstr ""
--- 32104,32110 ----
  msgid "arithmetic on pointer to an incomplete type"
  msgstr ""
  
! #: c/c-typeck.c:3588 cp/typeck.c:5153
  #, gcc-internal-format
  msgid "arithmetic on pointer to an empty aggregate"
  msgstr ""
*************** msgstr ""
*** 32006,32012 ****
  msgid "non-lvalue array in conditional expression"
  msgstr ""
  
! #: c/c-typeck.c:4568 cp/call.c:5037
  #, gcc-internal-format
  msgid ""
  "implicit conversion from %qT to %qT to match other result of conditional"
--- 32189,32195 ----
  msgid "non-lvalue array in conditional expression"
  msgstr ""
  
! #: c/c-typeck.c:4568 cp/call.c:5039
  #, gcc-internal-format
  msgid ""
  "implicit conversion from %qT to %qT to match other result of conditional"
*************** msgstr ""
*** 32042,32048 ****
  msgid "pointer/integer type mismatch in conditional expression"
  msgstr ""
  
! #: c/c-typeck.c:4816 cp/typeck.c:6268
  #, gcc-internal-format
  msgid "spawned function call cannot be part of a comma expression"
  msgstr ""
--- 32225,32231 ----
  msgid "pointer/integer type mismatch in conditional expression"
  msgstr ""
  
! #: c/c-typeck.c:4816 cp/typeck.c:6285
  #, gcc-internal-format
  msgid "spawned function call cannot be part of a comma expression"
  msgstr ""
*************** msgstr ""
*** 32052,32058 ****
  msgid "left-hand operand of comma expression has no effect"
  msgstr ""
  
! #: c/c-typeck.c:4868 c/c-typeck.c:9945
  #, gcc-internal-format
  msgid "right-hand operand of comma expression has no effect"
  msgstr ""
--- 32235,32241 ----
  msgid "left-hand operand of comma expression has no effect"
  msgstr ""
  
! #: c/c-typeck.c:4868 c/c-typeck.c:9962
  #, gcc-internal-format
  msgid "right-hand operand of comma expression has no effect"
  msgstr ""
*************** msgstr ""
*** 32129,32135 ****
  msgid "cast from function call of type %qT to non-matching type %qT"
  msgstr ""
  
! #: c/c-typeck.c:5157 cp/typeck.c:7223
  #, gcc-internal-format
  msgid "cast to pointer from integer of different size"
  msgstr ""
--- 32312,32318 ----
  msgid "cast from function call of type %qT to non-matching type %qT"
  msgstr ""
  
! #: c/c-typeck.c:5157 cp/typeck.c:7242
  #, gcc-internal-format
  msgid "cast to pointer from integer of different size"
  msgstr ""
*************** msgstr ""
*** 32154,32170 ****
  msgid "assignment to expression with array type"
  msgstr ""
  
! #: c/c-typeck.c:5430 c/c-typeck.c:5860
  #, gcc-internal-format
  msgid "enum conversion in assignment is invalid in C++"
  msgstr ""
  
! #: c/c-typeck.c:5626 c/c-typeck.c:5644 c/c-typeck.c:5663
  #, gcc-internal-format
  msgid "(near initialization for %qs)"
  msgstr ""
  
! #: c/c-typeck.c:5678
  #, gcc-internal-format
  msgid "array initialized from parenthesized string constant"
  msgstr ""
--- 32337,32353 ----
  msgid "assignment to expression with array type"
  msgstr ""
  
! #: c/c-typeck.c:5430 c/c-typeck.c:5874
  #, gcc-internal-format
  msgid "enum conversion in assignment is invalid in C++"
  msgstr ""
  
! #: c/c-typeck.c:5626 c/c-typeck.c:5649 c/c-typeck.c:5673
  #, gcc-internal-format
  msgid "(near initialization for %qs)"
  msgstr ""
  
! #: c/c-typeck.c:5688
  #, gcc-internal-format
  msgid "array initialized from parenthesized string constant"
  msgstr ""
*************** msgstr ""
*** 32180,33628 ****
  #. strings are complete sentences, visible to gettext and checked at
  #. compile time.  It is the same as PEDWARN_FOR_QUALIFIERS but uses
  #. warning_at instead of pedwarn.
! #: c/c-typeck.c:5740 c/c-typeck.c:5769 c/c-typeck.c:5798 c/c-typeck.c:6372
  #, gcc-internal-format
  msgid "expected %qT but argument is of type %qT"
  msgstr ""
  
! #: c/c-typeck.c:5858
  #, gcc-internal-format
  msgid "enum conversion when passing argument %d of %qE is invalid in C++"
  msgstr ""
  
! #: c/c-typeck.c:5862 c/c-typeck.c:8465
  #, gcc-internal-format
  msgid "enum conversion in initialization is invalid in C++"
  msgstr ""
  
! #: c/c-typeck.c:5864
  #, gcc-internal-format
  msgid "enum conversion in return is invalid in C++"
  msgstr ""
  
! #: c/c-typeck.c:5891
  #, gcc-internal-format
  msgid "cannot pass rvalue to reference parameter"
  msgstr ""
  
! #: c/c-typeck.c:6024 c/c-typeck.c:6289
  msgid ""
  "passing argument %d of %qE makes %q#v qualified function pointer from "
  "unqualified"
  msgstr ""
  
! #: c/c-typeck.c:6027 c/c-typeck.c:6292
  msgid "assignment makes %q#v qualified function pointer from unqualified"
  msgstr ""
  
! #: c/c-typeck.c:6030 c/c-typeck.c:6294
  msgid "initialization makes %q#v qualified function pointer from unqualified"
  msgstr ""
  
! #: c/c-typeck.c:6033 c/c-typeck.c:6296
  msgid "return makes %q#v qualified function pointer from unqualified"
  msgstr ""
  
! #: c/c-typeck.c:6041 c/c-typeck.c:6208 c/c-typeck.c:6251
  msgid ""
  "passing argument %d of %qE discards %qv qualifier from pointer target type"
  msgstr ""
  
! #: c/c-typeck.c:6043 c/c-typeck.c:6210 c/c-typeck.c:6253
  msgid "assignment discards %qv qualifier from pointer target type"
  msgstr ""
  
! #: c/c-typeck.c:6045 c/c-typeck.c:6212 c/c-typeck.c:6255
  msgid "initialization discards %qv qualifier from pointer target type"
  msgstr ""
  
! #: c/c-typeck.c:6047 c/c-typeck.c:6214 c/c-typeck.c:6257
  msgid "return discards %qv qualifier from pointer target type"
  msgstr ""
  
! #: c/c-typeck.c:6056
  #, gcc-internal-format
  msgid "ISO C prohibits argument conversion to union type"
  msgstr ""
  
! #: c/c-typeck.c:6118
  #, gcc-internal-format
  msgid "request for implicit conversion from %qT to %qT not permitted in C++"
  msgstr ""
  
! #: c/c-typeck.c:6130
  #, gcc-internal-format
  msgid "passing argument %d of %qE from pointer to non-enclosed address space"
  msgstr ""
  
! #: c/c-typeck.c:6134
  #, gcc-internal-format
  msgid "assignment from pointer to non-enclosed address space"
  msgstr ""
  
! #: c/c-typeck.c:6138
  #, gcc-internal-format
  msgid "initialization from pointer to non-enclosed address space"
  msgstr ""
  
! #: c/c-typeck.c:6142
  #, gcc-internal-format
  msgid "return from pointer to non-enclosed address space"
  msgstr ""
  
! #: c/c-typeck.c:6160
  #, gcc-internal-format
  msgid "argument %d of %qE might be a candidate for a format attribute"
  msgstr ""
  
! #: c/c-typeck.c:6166
  #, gcc-internal-format
  msgid "assignment left-hand side might be a candidate for a format attribute"
  msgstr ""
  
! #: c/c-typeck.c:6171
  #, gcc-internal-format
  msgid ""
  "initialization left-hand side might be a candidate for a format attribute"
  msgstr ""
  
! #: c/c-typeck.c:6176 cp/typeck.c:8223
  #, gcc-internal-format
  msgid "return type might be a candidate for a format attribute"
  msgstr ""
  
! #: c/c-typeck.c:6225
  #, gcc-internal-format
  msgid ""
  "ISO C forbids passing argument %d of %qE between function pointer and %<void "
  "*%>"
  msgstr ""
  
! #: c/c-typeck.c:6228
  #, gcc-internal-format
  msgid "ISO C forbids assignment between function pointer and %<void *%>"
  msgstr ""
  
! #: c/c-typeck.c:6230
  #, gcc-internal-format
  msgid "ISO C forbids initialization between function pointer and %<void *%>"
  msgstr ""
  
! #: c/c-typeck.c:6232
  #, gcc-internal-format
  msgid "ISO C forbids return between function pointer and %<void *%>"
  msgstr ""
  
! #: c/c-typeck.c:6269
  #, gcc-internal-format
  msgid "pointer targets in passing argument %d of %qE differ in signedness"
  msgstr ""
  
! #: c/c-typeck.c:6271
  #, gcc-internal-format
  msgid "pointer targets in assignment differ in signedness"
  msgstr ""
  
! #: c/c-typeck.c:6273
  #, gcc-internal-format
  msgid "pointer targets in initialization differ in signedness"
  msgstr ""
  
! #: c/c-typeck.c:6275
  #, gcc-internal-format
  msgid "pointer targets in return differ in signedness"
  msgstr ""
  
! #: c/c-typeck.c:6306
  #, gcc-internal-format
  msgid "passing argument %d of %qE from incompatible pointer type"
  msgstr ""
  
! #: c/c-typeck.c:6308
  #, gcc-internal-format
  msgid "assignment from incompatible pointer type"
  msgstr ""
  
! #: c/c-typeck.c:6309
  #, gcc-internal-format
  msgid "initialization from incompatible pointer type"
  msgstr ""
  
! #: c/c-typeck.c:6311
  #, gcc-internal-format
  msgid "return from incompatible pointer type"
  msgstr ""
  
  #. ??? This should not be an error when inlining calls to
  #. unprototyped functions.
! #: c/c-typeck.c:6319 c/c-typeck.c:6813 cp/typeck.c:1981
  #, gcc-internal-format
  msgid "invalid use of non-lvalue array"
  msgstr ""
  
! #: c/c-typeck.c:6330
  #, gcc-internal-format
  msgid "passing argument %d of %qE makes pointer from integer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6332
  #, gcc-internal-format
  msgid "assignment makes pointer from integer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6334
  #, gcc-internal-format
  msgid "initialization makes pointer from integer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6336
  #, gcc-internal-format
  msgid "return makes pointer from integer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6345
  #, gcc-internal-format
  msgid "passing argument %d of %qE makes integer from pointer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6347
  #, gcc-internal-format
  msgid "assignment makes integer from pointer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6349
  #, gcc-internal-format
  msgid "initialization makes integer from pointer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6351
  #, gcc-internal-format
  msgid "return makes integer from pointer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6375
  #, gcc-internal-format
  msgid "incompatible types when assigning to type %qT from type %qT"
  msgstr ""
  
! #: c/c-typeck.c:6380
  #, gcc-internal-format
  msgid "incompatible types when initializing type %qT using type %qT"
  msgstr ""
  
! #: c/c-typeck.c:6385
  #, gcc-internal-format
  msgid "incompatible types when returning type %qT but %qT was expected"
  msgstr ""
  
! #: c/c-typeck.c:6449
  #, gcc-internal-format
  msgid "traditional C rejects automatic aggregate initialization"
  msgstr ""
  
! #: c/c-typeck.c:6686 c/c-typeck.c:7577
  #, gcc-internal-format
  msgid "initialization of a flexible array member"
  msgstr ""
  
! #: c/c-typeck.c:6696 cp/typeck2.c:1024
  #, gcc-internal-format
  msgid "char-array initialized from wide string"
  msgstr ""
  
! #: c/c-typeck.c:6705
  #, gcc-internal-format
  msgid "wide character array initialized from non-wide string"
  msgstr ""
  
! #: c/c-typeck.c:6711
  #, gcc-internal-format
  msgid "wide character array initialized from incompatible wide string"
  msgstr ""
  
! #: c/c-typeck.c:6745
  #, gcc-internal-format
  msgid "array of inappropriate type initialized from string constant"
  msgstr ""
  
! #: c/c-typeck.c:6832 c/c-typeck.c:6856 c/c-typeck.c:6859 c/c-typeck.c:6867
! #: c/c-typeck.c:6907 c/c-typeck.c:8407 c/c-typeck.c:8438
  #, gcc-internal-format
  msgid "initializer element is not constant"
  msgstr ""
  
! #: c/c-typeck.c:6841
  #, gcc-internal-format
  msgid "array initialized from non-constant array expression"
  msgstr ""
  
! #: c/c-typeck.c:6872 c/c-typeck.c:6920 c/c-typeck.c:8448
  #, gcc-internal-format
  msgid "initializer element is not a constant expression"
  msgstr ""
  
! #: c/c-typeck.c:6914 c/c-typeck.c:8443
  #, gcc-internal-format
  msgid "initializer element is not computable at load time"
  msgstr ""
  
! #: c/c-typeck.c:6933
  #, gcc-internal-format
  msgid "invalid initializer"
  msgstr ""
  
! #: c/c-typeck.c:7211 cp/decl.c:5929
  #, gcc-internal-format
  msgid "opaque vector types cannot be initialized"
  msgstr ""
  
! #: c/c-typeck.c:7435
  #, gcc-internal-format
  msgid "extra brace group at end of initializer"
  msgstr ""
  
! #: c/c-typeck.c:7514
  #, gcc-internal-format
  msgid "braces around scalar initializer"
  msgstr ""
  
! #: c/c-typeck.c:7574 c/c-typeck.c:8880
  #, gcc-internal-format
  msgid "initialization of flexible array member in a nested context"
  msgstr ""
  
! #: c/c-typeck.c:7608
  #, gcc-internal-format
  msgid "missing braces around initializer"
  msgstr ""
  
! #: c/c-typeck.c:7630
  #, gcc-internal-format
  msgid "missing initializer for field %qD of %qT"
  msgstr ""
  
! #: c/c-typeck.c:7655
  #, gcc-internal-format
  msgid "empty scalar initializer"
  msgstr ""
  
! #: c/c-typeck.c:7660
  #, gcc-internal-format
  msgid "extra elements in scalar initializer"
  msgstr ""
  
! #: c/c-typeck.c:7772 c/c-typeck.c:7853
  #, gcc-internal-format
  msgid "array index in non-array initializer"
  msgstr ""
  
! #: c/c-typeck.c:7777 c/c-typeck.c:7916
  #, gcc-internal-format
  msgid "field name not in record or union initializer"
  msgstr ""
  
! #: c/c-typeck.c:7826
  #, gcc-internal-format
  msgid "array index in initializer not of integer type"
  msgstr ""
  
! #: c/c-typeck.c:7835 c/c-typeck.c:7844
  #, gcc-internal-format
  msgid "array index in initializer is not an integer constant expression"
  msgstr ""
  
! #: c/c-typeck.c:7849 c/c-typeck.c:7851
  #, gcc-internal-format
  msgid "nonconstant array index in initializer"
  msgstr ""
  
! #: c/c-typeck.c:7855 c/c-typeck.c:7858
  #, gcc-internal-format
  msgid "array index in initializer exceeds array bounds"
  msgstr ""
  
! #: c/c-typeck.c:7877
  #, gcc-internal-format
  msgid "empty index range in initializer"
  msgstr ""
  
! #: c/c-typeck.c:7886
  #, gcc-internal-format
  msgid "array index range in initializer exceeds array bounds"
  msgstr ""
  
! #: c/c-typeck.c:7923
  #, gcc-internal-format
  msgid "unknown field %qE specified in initializer"
  msgstr ""
  
! #: c/c-typeck.c:7976 c/c-typeck.c:8006 c/c-typeck.c:8538
  #, gcc-internal-format
  msgid "initialized field with side-effects overwritten"
  msgstr ""
  
! #: c/c-typeck.c:7980 c/c-typeck.c:8010 c/c-typeck.c:8541
  #, gcc-internal-format
  msgid "initialized field overwritten"
  msgstr ""
  
! #: c/c-typeck.c:8762
  #, gcc-internal-format
  msgid "excess elements in char array initializer"
  msgstr ""
  
! #: c/c-typeck.c:8769 c/c-typeck.c:8839
  #, gcc-internal-format
  msgid "excess elements in struct initializer"
  msgstr ""
  
! #: c/c-typeck.c:8784
  #, gcc-internal-format
  msgid ""
  "positional initialization of field in %<struct%> declared with "
  "%<designated_init%> attribute"
  msgstr ""
  
! #: c/c-typeck.c:8854
  #, gcc-internal-format
  msgid "non-static initialization of a flexible array member"
  msgstr ""
  
! #: c/c-typeck.c:8953
  #, gcc-internal-format
  msgid "excess elements in union initializer"
  msgstr ""
  
! #: c/c-typeck.c:8975
  #, gcc-internal-format
  msgid "traditional C rejects initialization of unions"
  msgstr ""
  
! #: c/c-typeck.c:9043
  #, gcc-internal-format
  msgid "excess elements in array initializer"
  msgstr ""
  
! #: c/c-typeck.c:9077
  #, gcc-internal-format
  msgid "excess elements in vector initializer"
  msgstr ""
  
! #: c/c-typeck.c:9109
  #, gcc-internal-format
  msgid "excess elements in scalar initializer"
  msgstr ""
  
! #: c/c-typeck.c:9349
  #, gcc-internal-format
  msgid "ISO C forbids %<goto *expr;%>"
  msgstr ""
  
! #: c/c-typeck.c:9373 cp/typeck.c:8446
  #, gcc-internal-format
  msgid "function declared %<noreturn%> has a %<return%> statement"
  msgstr ""
  
! #: c/c-typeck.c:9383 cp/cp-array-notation.c:1103
  #, gcc-internal-format
  msgid "array notation expression cannot be used as a return value"
  msgstr ""
  
! #: c/c-typeck.c:9390 cp/typeck.c:8437
  #, gcc-internal-format
  msgid "use of %<_Cilk_spawn%> in a return statement is not allowed"
  msgstr ""
  
! #: c/c-typeck.c:9415 c/c-typeck.c:9418
  #, gcc-internal-format
  msgid "%<return%> with no value, in function returning non-void"
  msgstr ""
  
! #: c/c-typeck.c:9428
  #, gcc-internal-format
  msgid "%<return%> with a value, in function returning void"
  msgstr ""
  
! #: c/c-typeck.c:9430
  #, gcc-internal-format
  msgid "ISO C forbids %<return%> with expression, in function returning void"
  msgstr ""
  
! #: c/c-typeck.c:9503
  #, gcc-internal-format
  msgid "function returns address of label"
  msgstr ""
  
! #: c/c-typeck.c:9585 cp/semantics.c:1163
  #, gcc-internal-format
  msgid "switch quantity not an integer"
  msgstr ""
  
! #: c/c-typeck.c:9605
  #, gcc-internal-format
  msgid "switch condition has boolean value"
  msgstr ""
  
! #: c/c-typeck.c:9611
  #, gcc-internal-format
  msgid "%<long%> switch expression not converted to %<int%> in ISO C"
  msgstr ""
  
! #: c/c-typeck.c:9647 c/c-typeck.c:9655
  #, gcc-internal-format
  msgid "case label is not an integer constant expression"
  msgstr ""
  
! #: c/c-typeck.c:9661 cp/parser.c:9932
  #, gcc-internal-format
  msgid "case label not within a switch statement"
  msgstr ""
  
! #: c/c-typeck.c:9663
  #, gcc-internal-format
  msgid "%<default%> label not within a switch statement"
  msgstr ""
  
! #: c/c-typeck.c:9733
  #, gcc-internal-format
  msgid "rank-mismatch between if-statement%'s condition and the then-block"
  msgstr ""
  
! #: c/c-typeck.c:9739
  #, gcc-internal-format
  msgid "rank-mismatch between if-statement%'s condition and the else-block"
  msgstr ""
  
! #: c/c-typeck.c:9775 cp/parser.c:10240
  #, gcc-internal-format
  msgid "suggest explicit braces to avoid ambiguous %<else%>"
  msgstr ""
  
! #: c/c-typeck.c:9887 cp/parser.c:11013
  #, gcc-internal-format
  msgid "break statement not within loop or switch"
  msgstr ""
  
! #: c/c-typeck.c:9889 cp/parser.c:11039
  #, gcc-internal-format
  msgid "continue statement not within a loop"
  msgstr ""
  
! #: c/c-typeck.c:9894 cp/parser.c:11026
  #, gcc-internal-format
  msgid "break statement used with OpenMP for loop"
  msgstr ""
  
! #: c/c-typeck.c:9899
  #, gcc-internal-format
  msgid "break statement within %<#pragma simd%> loop body"
  msgstr ""
  
! #: c/c-typeck.c:9901 cp/parser.c:11043
  #, gcc-internal-format
  msgid "continue statement within %<#pragma simd%> loop body"
  msgstr ""
  
! #: c/c-typeck.c:9927 cp/cp-gimplify.c:439
  #, gcc-internal-format
  msgid "statement with no effect"
  msgstr ""
  
! #: c/c-typeck.c:9971
  #, gcc-internal-format
  msgid "expression statement has incomplete type"
  msgstr ""
  
! #: c/c-typeck.c:10737 c/c-typeck.c:10879 cp/typeck.c:4655
  #, gcc-internal-format
  msgid "comparing vectors with different element types"
  msgstr ""
  
! #: c/c-typeck.c:10744 c/c-typeck.c:10886 cp/typeck.c:4667
  #, gcc-internal-format
  msgid "comparing vectors with different number of elements"
  msgstr ""
  
! #: c/c-typeck.c:10760 cp/typeck.c:4383
  #, gcc-internal-format
  msgid "comparing floating point with == or != is unsafe"
  msgstr ""
  
! #: c/c-typeck.c:10777 c/c-typeck.c:10797
  #, gcc-internal-format
  msgid ""
  "the comparison will always evaluate as %<false%> for the address of %qD will "
  "never be NULL"
  msgstr ""
  
! #: c/c-typeck.c:10783 c/c-typeck.c:10803
  #, gcc-internal-format
  msgid ""
  "the comparison will always evaluate as %<true%> for the address of %qD will "
  "never be NULL"
  msgstr ""
  
! #: c/c-typeck.c:10824 c/c-typeck.c:10929
  #, gcc-internal-format
  msgid "comparison of pointers to disjoint address spaces"
  msgstr ""
  
! #: c/c-typeck.c:10831 c/c-typeck.c:10837
  #, gcc-internal-format
  msgid "ISO C forbids comparison of %<void *%> with function pointer"
  msgstr ""
  
! #: c/c-typeck.c:10844 c/c-typeck.c:10939
  #, gcc-internal-format
  msgid "comparison of distinct pointer types lacks a cast"
  msgstr ""
  
! #: c/c-typeck.c:10856 c/c-typeck.c:10861 c/c-typeck.c:10965 c/c-typeck.c:10970
  #, gcc-internal-format
  msgid "comparison between pointer and integer"
  msgstr ""
  
! #: c/c-typeck.c:10917
  #, gcc-internal-format
  msgid "comparison of complete and incomplete pointers"
  msgstr ""
  
! #: c/c-typeck.c:10919
  #, gcc-internal-format
  msgid "ISO C forbids ordered comparisons of pointers to functions"
  msgstr ""
  
! #: c/c-typeck.c:10924
  #, gcc-internal-format
  msgid "ordered comparison of pointer with null pointer"
  msgstr ""
  
! #: c/c-typeck.c:10947 c/c-typeck.c:10950 c/c-typeck.c:10957 c/c-typeck.c:10960
! #: cp/typeck.c:4704 cp/typeck.c:4711
  #, gcc-internal-format
  msgid "ordered comparison of pointer with integer zero"
  msgstr ""
  
! #: c/c-typeck.c:11008 cp/typeck.c:4784
  #, gcc-internal-format
  msgid ""
  "implicit conversion from %qT to %qT to match other operand of binary "
  "expression"
  msgstr ""
  
! #: c/c-typeck.c:11317
  #, gcc-internal-format
  msgid "used array that cannot be converted to pointer where scalar is required"
  msgstr ""
  
! #: c/c-typeck.c:11321
  #, gcc-internal-format
  msgid "used struct type value where scalar is required"
  msgstr ""
  
! #: c/c-typeck.c:11325
  #, gcc-internal-format
  msgid "used union type value where scalar is required"
  msgstr ""
  
! #: c/c-typeck.c:11336
  #, gcc-internal-format
  msgid "used vector type where scalar is required"
  msgstr ""
  
! #: c/c-typeck.c:11527 cp/semantics.c:7003
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp cancel must specify one of %<parallel%>, %<for%>, %<sections%> "
  "or %<taskgroup%> clauses"
  msgstr ""
  
! #: c/c-typeck.c:11566 cp/semantics.c:7040
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp cancellation point must specify one of %<parallel%>, %<for%>, "
  "%<sections%> or %<taskgroup%> clauses"
  msgstr ""
  
! #: c/c-typeck.c:11609 cp/semantics.c:4305 cp/semantics.c:5800
  #, gcc-internal-format
  msgid "%qD is not a variable in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11613 c/c-typeck.c:12388 cp/semantics.c:4309
! #: cp/semantics.c:5803
  #, gcc-internal-format
  msgid "%qE is not a variable in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11621 c/c-typeck.c:12395 cp/semantics.c:4317
! #: cp/semantics.c:5809
  #, gcc-internal-format
  msgid "%qD is threadprivate variable in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11643 cp/semantics.c:4343
  #, gcc-internal-format
  msgid "low bound %qE of array section does not have integral type"
  msgstr ""
  
! #: c/c-typeck.c:11650 cp/semantics.c:4350
  #, gcc-internal-format
  msgid "length %qE of array section does not have integral type"
  msgstr ""
  
! #: c/c-typeck.c:11682 cp/semantics.c:4386
  #, gcc-internal-format
  msgid "for unknown bound array type length expression must be specified"
  msgstr ""
  
! #: c/c-typeck.c:11690 cp/semantics.c:4394
  #, gcc-internal-format
  msgid "negative low bound in array section in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11699 cp/semantics.c:4403
  #, gcc-internal-format
  msgid "negative length in array section in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11716 cp/semantics.c:4420
  #, gcc-internal-format
  msgid "low bound %qE above array section size in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11741 cp/semantics.c:4445
  #, gcc-internal-format
  msgid "length %qE above array section size in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11756 cp/semantics.c:4460
  #, gcc-internal-format
  msgid "high bound %qE above array section size in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11787 cp/semantics.c:4491
  #, gcc-internal-format
  msgid "for pointer type length expression must be specified"
  msgstr ""
  
! #: c/c-typeck.c:11796 c/c-typeck.c:11911 cp/semantics.c:4500
! #: cp/semantics.c:4611
  #, gcc-internal-format
  msgid "array section is not contiguous in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11804 cp/semantics.c:4508
  #, gcc-internal-format
  msgid "%qE does not have pointer or array type"
  msgstr ""
  
! #: c/c-typeck.c:12124
  #, gcc-internal-format
  msgid "%qE has invalid type for %<reduction(%s)%>"
  msgstr ""
  
! #: c/c-typeck.c:12133 cp/semantics.c:5292
  #, gcc-internal-format
  msgid "user defined reduction not found for %qD"
  msgstr ""
  
! #: c/c-typeck.c:12205 c/c-typeck.c:12443 cp/semantics.c:5939
  #, gcc-internal-format
  msgid "%<nowait%> clause must not be used together with %<copyprivate%>"
  msgstr ""
  
! #: c/c-typeck.c:12217 cp/semantics.c:5979
  #, gcc-internal-format
  msgid "%qE must be %<threadprivate%> for %<copyin%>"
  msgstr ""
  
! #: c/c-typeck.c:12229
  #, gcc-internal-format
  msgid ""
  "linear clause applied to non-integral non-pointer variable with type %qT"
  msgstr ""
  
! #: c/c-typeck.c:12255 cp/semantics.c:5397
  #, gcc-internal-format
  msgid "%qE is not a variable in clause %qs"
  msgstr ""
  
! #: c/c-typeck.c:12264 c/c-typeck.c:12285 c/c-typeck.c:12306
  #, gcc-internal-format
  msgid "%qE appears more than once in data clauses"
  msgstr ""
  
! #: c/c-typeck.c:12278 cp/semantics.c:5421
  #, gcc-internal-format
  msgid "%qE is not a variable in clause %<firstprivate%>"
  msgstr ""
  
! #: c/c-typeck.c:12299 cp/semantics.c:5443
  #, gcc-internal-format
  msgid "%qE is not a variable in clause %<lastprivate%>"
  msgstr ""
  
! #: c/c-typeck.c:12318 cp/semantics.c:5687
  #, gcc-internal-format
  msgid "%qE is not a variable in %<aligned%> clause"
  msgstr ""
  
! #: c/c-typeck.c:12325
  #, gcc-internal-format
  msgid "%qE in %<aligned%> clause is neither a pointer nor an array"
  msgstr ""
  
! #: c/c-typeck.c:12332
  #, gcc-internal-format
  msgid "%qE appears more than once in %<aligned%> clauses"
  msgstr ""
  
! #: c/c-typeck.c:12353 cp/semantics.c:5757
  #, gcc-internal-format
  msgid "%qE is not a variable in %<depend%> clause"
  msgstr ""
  
! #: c/c-typeck.c:12375 cp/semantics.c:5782
  #, gcc-internal-format
  msgid "array section does not have mappable type in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:12408 cp/semantics.c:5826
  #, gcc-internal-format
  msgid "%qD does not have a mappable type in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:12415 cp/semantics.c:5833
  #, gcc-internal-format
  msgid "%qD appears more than once in motion clauses"
  msgstr ""
  
! #: c/c-typeck.c:12417 cp/semantics.c:5835
  #, gcc-internal-format
  msgid "%qD appears more than once in map clauses"
  msgstr ""
  
! #: c/c-typeck.c:12430 cp/semantics.c:5849
  #, gcc-internal-format
  msgid "%qD is not an argument in %<uniform%> clause"
  msgstr ""
  
! #: c/c-typeck.c:12433 cp/semantics.c:5851
  #, gcc-internal-format
  msgid "%qE is not an argument in %<uniform%> clause"
  msgstr ""
  
! #: c/c-typeck.c:12491 cp/semantics.c:5875
  #, gcc-internal-format
  msgid "%<inbranch%> clause is incompatible with %<notinbranch%>"
  msgstr ""
  
! #: c/c-typeck.c:12541 cp/semantics.c:6026
  #, gcc-internal-format
  msgid "%qE is predetermined %qs for %qs"
  msgstr ""
  
! #: c/c-typeck.c:12644
  #, gcc-internal-format
  msgid "C++ requires promoted type, not enum type, in %<va_arg%>"
  msgstr ""
  
  #. A bad conversion for 'this' must be discarding cv-quals.
! #: cp/call.c:3301
  #, gcc-internal-format
  msgid "  passing %qT as %<this%> argument discards qualifiers"
  msgstr ""
  
! #: cp/call.c:3305
  #, gcc-internal-format
  msgid "  no known conversion for implicit %<this%> parameter from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:3312
  #, gcc-internal-format, gfc-internal-format
  msgid "  conversion of argument %d would be ill-formed:"
  msgstr ""
  
  #. Conversion of conversion function return value failed.
! #: cp/call.c:3319
  #, gcc-internal-format
  msgid "  no known conversion from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:3322
  #, gcc-internal-format
  msgid "  no known conversion for argument %d from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:3333 cp/pt.c:5714
  #, gcc-internal-format, gfc-internal-format
  msgid "  candidate expects %d argument, %d provided"
  msgid_plural "  candidate expects %d arguments, %d provided"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/call.c:3358
  #, gcc-internal-format
  msgid "%s%D(%T, %T, %T) <built-in>"
  msgstr ""
  
! #: cp/call.c:3363
  #, gcc-internal-format
  msgid "%s%D(%T, %T) <built-in>"
  msgstr ""
  
! #: cp/call.c:3367
  #, gcc-internal-format
  msgid "%s%D(%T) <built-in>"
  msgstr ""
  
! #: cp/call.c:3371
  #, gcc-internal-format
  msgid "%s%T <conversion>"
  msgstr ""
  
! #: cp/call.c:3373
  #, gcc-internal-format
  msgid "%s%#D <near match>"
  msgstr ""
  
! #: cp/call.c:3375
  #, gcc-internal-format
  msgid "%s%#D <deleted>"
  msgstr ""
  
! #: cp/call.c:3377
  #, gcc-internal-format
  msgid "%s%#D"
  msgstr ""
  
! #: cp/call.c:3396
  #, gcc-internal-format
  msgid ""
  "  return type %qT of explicit conversion function cannot be converted to %qT "
  "with a qualification conversion"
  msgstr ""
  
! #: cp/call.c:3402
  #, gcc-internal-format
  msgid ""
  "  conversion from return type %qT of template conversion function "
  "specialization to %qT is not an exact match"
  msgstr ""
  
! #: cp/call.c:3413
  #, gcc-internal-format
  msgid ""
  "  substitution of deduced template arguments resulted in errors seen above"
  msgstr ""
  
  #. Re-run template unification with diagnostics.
! #: cp/call.c:3418
  #, gcc-internal-format
  msgid "  template argument deduction/substitution failed:"
  msgstr ""
  
! #: cp/call.c:3432
  #, gcc-internal-format
  msgid ""
  "  a constructor taking a single argument of its own class type is invalid"
  msgstr ""
  
! #: cp/call.c:3793
  #, gcc-internal-format
  msgid "conversion from %qT to %qT is ambiguous"
  msgstr ""
  
! #: cp/call.c:3920
  #, gcc-internal-format
  msgid ""
  "conversion from %qT to %qT not considered for non-type template argument"
  msgstr ""
  
! #: cp/call.c:4038
  #, gcc-internal-format
  msgid "no matching function for call to %<%D(%A)%>"
  msgstr ""
  
! #: cp/call.c:4041
  #, gcc-internal-format
  msgid "call of overloaded %<%D(%A)%> is ambiguous"
  msgstr ""
  
  #. It's no good looking for an overloaded operator() on a
  #. pointer-to-member-function.
! #: cp/call.c:4250
  #, gcc-internal-format
  msgid ""
  "pointer-to-member function %E cannot be called without an object; consider "
  "using .* or ->*"
  msgstr ""
  
! #: cp/call.c:4321
  #, gcc-internal-format
  msgid "no match for call to %<(%T) (%A)%>"
  msgstr ""
  
! #: cp/call.c:4334
  #, gcc-internal-format
  msgid "call of %<(%T) (%A)%> is ambiguous"
  msgstr ""
  
! #: cp/call.c:4382
  #, gcc-internal-format
  msgid "ambiguous overload for "
  msgstr ""
  
! #: cp/call.c:4383
  #, gcc-internal-format
  msgid "no match for "
  msgstr ""
  
! #: cp/call.c:4386
  #, gcc-internal-format
  msgid " (operand types are %qT, %qT, and %qT)"
  msgstr ""
  
! #: cp/call.c:4388
  #, gcc-internal-format
  msgid " (operand types are %qT and %qT)"
  msgstr ""
  
! #: cp/call.c:4390
  #, gcc-internal-format
  msgid " (operand type is %qT)"
  msgstr ""
  
! #: cp/call.c:4410
  #, gcc-internal-format
  msgid "ternary %<operator?:%>"
  msgstr ""
  
! #: cp/call.c:4414
  #, gcc-internal-format
  msgid "ternary %<operator?:%> in %<%E ? %E : %E%>"
  msgstr ""
  
! #: cp/call.c:4423 cp/call.c:4454 cp/call.c:4463
  #, gcc-internal-format
  msgid "%<operator%s%>"
  msgstr ""
  
! #: cp/call.c:4426
  #, gcc-internal-format
  msgid "%<operator%s%> in %<%E%s%>"
  msgstr ""
  
! #: cp/call.c:4433
  #, gcc-internal-format
  msgid "%<operator[]%>"
  msgstr ""
  
! #: cp/call.c:4436
  #, gcc-internal-format
  msgid "%<operator[]%> in %<%E[%E]%>"
  msgstr ""
  
! #: cp/call.c:4444
  #, gcc-internal-format
  msgid "%qs"
  msgstr ""
  
! #: cp/call.c:4447
  #, gcc-internal-format
  msgid "%qs in %<%s %E%>"
  msgstr ""
  
! #: cp/call.c:4457
  #, gcc-internal-format
  msgid "%<operator%s%> in %<%E %s %E%>"
  msgstr ""
  
! #: cp/call.c:4466
  #, gcc-internal-format
  msgid "%<operator%s%> in %<%s%E%>"
  msgstr ""
  
! #: cp/call.c:4575
  #, gcc-internal-format
  msgid "ISO C++ forbids omitting the middle term of a ?: expression"
  msgstr ""
  
! #: cp/call.c:4624
  #, gcc-internal-format
  msgid ""
  "inferred scalar type %qT is not an integer or floating point type of the "
  "same size as %qT"
  msgstr ""
  
! #: cp/call.c:4702
  #, gcc-internal-format
  msgid "incompatible vector types in conditional expression: %qT, %qT and %qT"
  msgstr ""
  
! #: cp/call.c:4790
  #, gcc-internal-format
  msgid ""
  "second operand to the conditional operator is of type %<void%>, but the "
  "third operand is neither a throw-expression nor of type %<void%>"
  msgstr ""
  
! #: cp/call.c:4795
  #, gcc-internal-format
  msgid ""
  "third operand to the conditional operator is of type %<void%>, but the "
  "second operand is neither a throw-expression nor of type %<void%>"
  msgstr ""
  
! #: cp/call.c:4846 cp/call.c:4962 cp/call.c:5105
  #, gcc-internal-format
  msgid "operands to ?: have different types %qT and %qT"
  msgstr ""
  
! #: cp/call.c:4849
  #, gcc-internal-format
  msgid "  and each type can be converted to the other"
  msgstr ""
  
! #: cp/call.c:5050
  #, gcc-internal-format
  msgid "enumeral mismatch in conditional expression: %qT vs %qT"
  msgstr ""
  
! #: cp/call.c:5062
  #, gcc-internal-format
  msgid "enumeral and non-enumeral type in conditional expression"
  msgstr ""
  
! #: cp/call.c:5528
  #, gcc-internal-format
  msgid "no %<%D(int)%> declared for postfix %qs, trying prefix operator instead"
  msgstr ""
  
! #: cp/call.c:5530
  #, gcc-internal-format
  msgid "no %<%D(int)%> declared for postfix %qs"
  msgstr ""
  
! #: cp/call.c:5623
  #, gcc-internal-format
  msgid "comparison between %q#T and %q#T"
  msgstr ""
  
! #: cp/call.c:5893
  #, gcc-internal-format
  msgid "non-placement deallocation function %q+D"
  msgstr ""
  
! #: cp/call.c:5894
  #, gcc-internal-format
  msgid "selected for placement delete"
  msgstr ""
  
! #: cp/call.c:6008
  #, gcc-internal-format
  msgid "no corresponding deallocation function for %qD"
  msgstr ""
  
! #: cp/call.c:6014
  #, gcc-internal-format
  msgid "no suitable %<operator %s%> for %qT"
  msgstr ""
  
! #: cp/call.c:6035
  #, gcc-internal-format
  msgid "%q+#D is private"
  msgstr ""
  
! #: cp/call.c:6037
  #, gcc-internal-format
  msgid "%q+#D is protected"
  msgstr ""
  
! #: cp/call.c:6039
  #, gcc-internal-format
  msgid "%q+#D is inaccessible"
  msgstr ""
  
! #: cp/call.c:6040
  #, gcc-internal-format
  msgid "within this context"
  msgstr ""
  
! #: cp/call.c:6091
  #, gcc-internal-format
  msgid "passing NULL to non-pointer argument %P of %qD"
  msgstr ""
  
! #: cp/call.c:6095
  #, gcc-internal-format
  msgid "converting to non-pointer type %qT from NULL"
  msgstr ""
  
! #: cp/call.c:6104
  #, gcc-internal-format
  msgid "converting %<false%> to pointer type for argument %P of %qD"
  msgstr ""
  
! #: cp/call.c:6108
  #, gcc-internal-format
  msgid "converting %<false%> to pointer type %qT"
  msgstr ""
  
! #: cp/call.c:6171
  #, gcc-internal-format
  msgid "too many braces around initializer for %qT"
  msgstr ""
  
! #: cp/call.c:6182
  #, gcc-internal-format
  msgid "converting to %qT from %qT requires direct-initialization"
  msgstr ""
  
! #: cp/call.c:6190
  #, gcc-internal-format
  msgid "invalid user-defined conversion from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:6207 cp/call.c:6231 cp/call.c:6459
  #, gcc-internal-format
  msgid "  initializing argument %P of %qD"
  msgstr ""
  
! #: cp/call.c:6227 cp/cvt.c:236
  #, gcc-internal-format
  msgid "invalid conversion from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:6255
  #, gcc-internal-format
  msgid ""
  "converting to %qT from initializer list would use explicit constructor %qD"
  msgstr ""
  
! #: cp/call.c:6335 cp/call.c:6487
  #, gcc-internal-format
  msgid "  initializing argument %P of %q+D"
  msgstr ""
  
! #: cp/call.c:6473
  #, gcc-internal-format
  msgid "cannot bind %qT lvalue to %qT"
  msgstr ""
  
! #: cp/call.c:6477 cp/call.c:9733
  #, gcc-internal-format
  msgid ""
  "invalid initialization of non-const reference of type %qT from an rvalue of "
  "type %qT"
  msgstr ""
  
! #: cp/call.c:6480
  #, gcc-internal-format
  msgid "binding %qT to reference of type %qT discards qualifiers"
  msgstr ""
  
! #: cp/call.c:6516
  #, gcc-internal-format
  msgid "cannot bind bitfield %qE to %qT"
  msgstr ""
  
! #: cp/call.c:6519 cp/call.c:6536
  #, gcc-internal-format
  msgid "cannot bind packed field %qE to %qT"
  msgstr ""
  
! #: cp/call.c:6522
  #, gcc-internal-format
  msgid "cannot bind rvalue %qE to %qT"
  msgstr ""
  
! #: cp/call.c:6644 cp/cvt.c:1746
  #, gcc-internal-format
  msgid ""
  "scoped enum %qT passed through ... as %qT before -fabi-version=6, %qT after"
  msgstr ""
  
! #: cp/call.c:6685
  #, gcc-internal-format
  msgid ""
  "passing objects of non-trivially-copyable type %q#T through %<...%> is "
  "conditionally supported"
  msgstr ""
  
! #: cp/call.c:6716
  #, gcc-internal-format
  msgid "cannot receive reference type %qT through %<...%>"
  msgstr ""
  
! #: cp/call.c:6726
  #, gcc-internal-format
  msgid ""
  "receiving objects of non-trivially-copyable type %q#T through %<...%> is "
  "conditionally-supported"
  msgstr ""
  
! #: cp/call.c:6786
  #, gcc-internal-format
  msgid "recursive evaluation of default argument for %q#D"
  msgstr ""
  
! #: cp/call.c:6795
  #, gcc-internal-format
  msgid ""
  "call to %qD uses the default argument for parameter %P, which is not yet "
  "defined"
  msgstr ""
  
! #: cp/call.c:6897
  #, gcc-internal-format
  msgid "argument of function call might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/call.c:6944
  #, gcc-internal-format
  msgid "use of multiversioned function without a default"
  msgstr ""
  
! #: cp/call.c:7189
  #, gcc-internal-format
  msgid "passing %qT as %<this%> argument discards qualifiers"
  msgstr ""
  
! #: cp/call.c:7192 cp/call.c:8973 cp/name-lookup.c:5713
  #, gcc-internal-format
  msgid "  in call to %qD"
  msgstr ""
  
! #: cp/call.c:7222
  #, gcc-internal-format
  msgid "%qT is not an accessible base of %qT"
  msgstr ""
  
! #: cp/call.c:7304
  #, gcc-internal-format
  msgid "deducing %qT as %qT"
  msgstr ""
  
! #: cp/call.c:7307
  #, gcc-internal-format
  msgid "  in call to %q+D"
  msgstr ""
  
! #: cp/call.c:7309
  #, gcc-internal-format
  msgid "  (you can disable this with -fno-deduce-init-list)"
  msgstr ""
  
! #: cp/call.c:7663
  #, gcc-internal-format
  msgid "could not find class$ field in java interface type %qT"
  msgstr ""
  
! #: cp/call.c:7838
  #, gcc-internal-format
  msgid "constructor delegates to itself"
  msgstr ""
  
! #: cp/call.c:7928
  #, gcc-internal-format
  msgid "call to non-function %qD"
  msgstr ""
  
! #: cp/call.c:7974 cp/typeck.c:2750
  #, gcc-internal-format
  msgid "cannot call constructor %<%T::%D%> directly"
  msgstr ""
  
! #: cp/call.c:7976
  #, gcc-internal-format
  msgid "for a function-style cast, remove the redundant %<::%D%>"
  msgstr ""
  
! #: cp/call.c:8103
  #, gcc-internal-format
  msgid "no matching function for call to %<%T::operator %T(%A)%#V%>"
  msgstr ""
  
! #: cp/call.c:8116
  #, gcc-internal-format
  msgid "no matching function for call to %<%T::%s(%A)%#V%>"
  msgstr ""
  
! #: cp/call.c:8142
  #, gcc-internal-format
  msgid "no matching function for call to %<%s(%A)%>"
  msgstr ""
  
! #: cp/call.c:8145
  #, gcc-internal-format
  msgid "call of overloaded %<%s(%A)%> is ambiguous"
  msgstr ""
  
! #: cp/call.c:8166
  #, gcc-internal-format
  msgid "pure virtual %q#D called from non-static data member initializer"
  msgstr ""
  
! #: cp/call.c:8192
  #, gcc-internal-format
  msgid "cannot call member function %qD without object"
  msgstr ""
  
! #: cp/call.c:8971
  #, gcc-internal-format
  msgid "passing %qT chooses %qT over %qT"
  msgstr ""
  
! #: cp/call.c:9031
  #, gcc-internal-format
  msgid "choosing %qD over %qD"
  msgstr ""
  
! #: cp/call.c:9032
  #, gcc-internal-format
  msgid "  for conversion from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:9035
  #, gcc-internal-format
  msgid "  because conversion sequence for the argument is better"
  msgstr ""
  
! #: cp/call.c:9188
  #, gcc-internal-format
  msgid "default argument mismatch in overload resolution"
  msgstr ""
  
! #: cp/call.c:9192
  #, gcc-internal-format
  msgid " candidate 1: %q+#F"
  msgstr ""
  
! #: cp/call.c:9194
  #, gcc-internal-format
  msgid " candidate 2: %q+#F"
  msgstr ""
  
! #: cp/call.c:9239
  #, gcc-internal-format
  msgid ""
  "ISO C++ says that these are ambiguous, even though the worst conversion for "
  "the first is better than the worst conversion for the second:"
  msgstr ""
  
! #: cp/call.c:9417
  #, gcc-internal-format
  msgid "could not convert %qE from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:9610
  #, gcc-internal-format
  msgid "a temporary bound to %qD only persists until the constructor exits"
  msgstr ""
  
! #: cp/call.c:9737
  #, gcc-internal-format
  msgid ""
  "invalid initialization of reference of type %qT from expression of type %qT"
--- 32363,33811 ----
  #. strings are complete sentences, visible to gettext and checked at
  #. compile time.  It is the same as PEDWARN_FOR_QUALIFIERS but uses
  #. warning_at instead of pedwarn.
! #: c/c-typeck.c:5754 c/c-typeck.c:5783 c/c-typeck.c:5812 c/c-typeck.c:6386
  #, gcc-internal-format
  msgid "expected %qT but argument is of type %qT"
  msgstr ""
  
! #: c/c-typeck.c:5872
  #, gcc-internal-format
  msgid "enum conversion when passing argument %d of %qE is invalid in C++"
  msgstr ""
  
! #: c/c-typeck.c:5876 c/c-typeck.c:8477
  #, gcc-internal-format
  msgid "enum conversion in initialization is invalid in C++"
  msgstr ""
  
! #: c/c-typeck.c:5878
  #, gcc-internal-format
  msgid "enum conversion in return is invalid in C++"
  msgstr ""
  
! #: c/c-typeck.c:5905
  #, gcc-internal-format
  msgid "cannot pass rvalue to reference parameter"
  msgstr ""
  
! #: c/c-typeck.c:6038 c/c-typeck.c:6303
  msgid ""
  "passing argument %d of %qE makes %q#v qualified function pointer from "
  "unqualified"
  msgstr ""
  
! #: c/c-typeck.c:6041 c/c-typeck.c:6306
  msgid "assignment makes %q#v qualified function pointer from unqualified"
  msgstr ""
  
! #: c/c-typeck.c:6044 c/c-typeck.c:6308
  msgid "initialization makes %q#v qualified function pointer from unqualified"
  msgstr ""
  
! #: c/c-typeck.c:6047 c/c-typeck.c:6310
  msgid "return makes %q#v qualified function pointer from unqualified"
  msgstr ""
  
! #: c/c-typeck.c:6055 c/c-typeck.c:6222 c/c-typeck.c:6265
  msgid ""
  "passing argument %d of %qE discards %qv qualifier from pointer target type"
  msgstr ""
  
! #: c/c-typeck.c:6057 c/c-typeck.c:6224 c/c-typeck.c:6267
  msgid "assignment discards %qv qualifier from pointer target type"
  msgstr ""
  
! #: c/c-typeck.c:6059 c/c-typeck.c:6226 c/c-typeck.c:6269
  msgid "initialization discards %qv qualifier from pointer target type"
  msgstr ""
  
! #: c/c-typeck.c:6061 c/c-typeck.c:6228 c/c-typeck.c:6271
  msgid "return discards %qv qualifier from pointer target type"
  msgstr ""
  
! #: c/c-typeck.c:6070
  #, gcc-internal-format
  msgid "ISO C prohibits argument conversion to union type"
  msgstr ""
  
! #: c/c-typeck.c:6132
  #, gcc-internal-format
  msgid "request for implicit conversion from %qT to %qT not permitted in C++"
  msgstr ""
  
! #: c/c-typeck.c:6144
  #, gcc-internal-format
  msgid "passing argument %d of %qE from pointer to non-enclosed address space"
  msgstr ""
  
! #: c/c-typeck.c:6148
  #, gcc-internal-format
  msgid "assignment from pointer to non-enclosed address space"
  msgstr ""
  
! #: c/c-typeck.c:6152
  #, gcc-internal-format
  msgid "initialization from pointer to non-enclosed address space"
  msgstr ""
  
! #: c/c-typeck.c:6156
  #, gcc-internal-format
  msgid "return from pointer to non-enclosed address space"
  msgstr ""
  
! #: c/c-typeck.c:6174
  #, gcc-internal-format
  msgid "argument %d of %qE might be a candidate for a format attribute"
  msgstr ""
  
! #: c/c-typeck.c:6180
  #, gcc-internal-format
  msgid "assignment left-hand side might be a candidate for a format attribute"
  msgstr ""
  
! #: c/c-typeck.c:6185
  #, gcc-internal-format
  msgid ""
  "initialization left-hand side might be a candidate for a format attribute"
  msgstr ""
  
! #: c/c-typeck.c:6190 cp/typeck.c:8242
  #, gcc-internal-format
  msgid "return type might be a candidate for a format attribute"
  msgstr ""
  
! #: c/c-typeck.c:6239
  #, gcc-internal-format
  msgid ""
  "ISO C forbids passing argument %d of %qE between function pointer and %<void "
  "*%>"
  msgstr ""
  
! #: c/c-typeck.c:6242
  #, gcc-internal-format
  msgid "ISO C forbids assignment between function pointer and %<void *%>"
  msgstr ""
  
! #: c/c-typeck.c:6244
  #, gcc-internal-format
  msgid "ISO C forbids initialization between function pointer and %<void *%>"
  msgstr ""
  
! #: c/c-typeck.c:6246
  #, gcc-internal-format
  msgid "ISO C forbids return between function pointer and %<void *%>"
  msgstr ""
  
! #: c/c-typeck.c:6283
  #, gcc-internal-format
  msgid "pointer targets in passing argument %d of %qE differ in signedness"
  msgstr ""
  
! #: c/c-typeck.c:6285
  #, gcc-internal-format
  msgid "pointer targets in assignment differ in signedness"
  msgstr ""
  
! #: c/c-typeck.c:6287
  #, gcc-internal-format
  msgid "pointer targets in initialization differ in signedness"
  msgstr ""
  
! #: c/c-typeck.c:6289
  #, gcc-internal-format
  msgid "pointer targets in return differ in signedness"
  msgstr ""
  
! #: c/c-typeck.c:6320
  #, gcc-internal-format
  msgid "passing argument %d of %qE from incompatible pointer type"
  msgstr ""
  
! #: c/c-typeck.c:6322
  #, gcc-internal-format
  msgid "assignment from incompatible pointer type"
  msgstr ""
  
! #: c/c-typeck.c:6323
  #, gcc-internal-format
  msgid "initialization from incompatible pointer type"
  msgstr ""
  
! #: c/c-typeck.c:6325
  #, gcc-internal-format
  msgid "return from incompatible pointer type"
  msgstr ""
  
  #. ??? This should not be an error when inlining calls to
  #. unprototyped functions.
! #: c/c-typeck.c:6333 c/c-typeck.c:6827 cp/typeck.c:1981
  #, gcc-internal-format
  msgid "invalid use of non-lvalue array"
  msgstr ""
  
! #: c/c-typeck.c:6344
  #, gcc-internal-format
  msgid "passing argument %d of %qE makes pointer from integer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6346
  #, gcc-internal-format
  msgid "assignment makes pointer from integer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6348
  #, gcc-internal-format
  msgid "initialization makes pointer from integer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6350
  #, gcc-internal-format
  msgid "return makes pointer from integer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6359
  #, gcc-internal-format
  msgid "passing argument %d of %qE makes integer from pointer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6361
  #, gcc-internal-format
  msgid "assignment makes integer from pointer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6363
  #, gcc-internal-format
  msgid "initialization makes integer from pointer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6365
  #, gcc-internal-format
  msgid "return makes integer from pointer without a cast"
  msgstr ""
  
! #: c/c-typeck.c:6389
  #, gcc-internal-format
  msgid "incompatible types when assigning to type %qT from type %qT"
  msgstr ""
  
! #: c/c-typeck.c:6394
  #, gcc-internal-format
  msgid "incompatible types when initializing type %qT using type %qT"
  msgstr ""
  
! #: c/c-typeck.c:6399
  #, gcc-internal-format
  msgid "incompatible types when returning type %qT but %qT was expected"
  msgstr ""
  
! #: c/c-typeck.c:6463
  #, gcc-internal-format
  msgid "traditional C rejects automatic aggregate initialization"
  msgstr ""
  
! #: c/c-typeck.c:6700 c/c-typeck.c:7588
  #, gcc-internal-format
  msgid "initialization of a flexible array member"
  msgstr ""
  
! #: c/c-typeck.c:6710 cp/typeck2.c:1019
  #, gcc-internal-format
  msgid "char-array initialized from wide string"
  msgstr ""
  
! #: c/c-typeck.c:6719
  #, gcc-internal-format
  msgid "wide character array initialized from non-wide string"
  msgstr ""
  
! #: c/c-typeck.c:6725
  #, gcc-internal-format
  msgid "wide character array initialized from incompatible wide string"
  msgstr ""
  
! #: c/c-typeck.c:6759
  #, gcc-internal-format
  msgid "array of inappropriate type initialized from string constant"
  msgstr ""
  
! #: c/c-typeck.c:6846 c/c-typeck.c:6870 c/c-typeck.c:6873 c/c-typeck.c:6881
! #: c/c-typeck.c:6921 c/c-typeck.c:8419 c/c-typeck.c:8450
  #, gcc-internal-format
  msgid "initializer element is not constant"
  msgstr ""
  
! #: c/c-typeck.c:6855
  #, gcc-internal-format
  msgid "array initialized from non-constant array expression"
  msgstr ""
  
! #: c/c-typeck.c:6886 c/c-typeck.c:6934 c/c-typeck.c:8460
  #, gcc-internal-format
  msgid "initializer element is not a constant expression"
  msgstr ""
  
! #: c/c-typeck.c:6928 c/c-typeck.c:8455
  #, gcc-internal-format
  msgid "initializer element is not computable at load time"
  msgstr ""
  
! #: c/c-typeck.c:6947
  #, gcc-internal-format
  msgid "invalid initializer"
  msgstr ""
  
! #: c/c-typeck.c:7225 cp/decl.c:5976
  #, gcc-internal-format
  msgid "opaque vector types cannot be initialized"
  msgstr ""
  
! #: c/c-typeck.c:7446
  #, gcc-internal-format
  msgid "extra brace group at end of initializer"
  msgstr ""
  
! #: c/c-typeck.c:7525
  #, gcc-internal-format
  msgid "braces around scalar initializer"
  msgstr ""
  
! #: c/c-typeck.c:7585 c/c-typeck.c:8892
  #, gcc-internal-format
  msgid "initialization of flexible array member in a nested context"
  msgstr ""
  
! #: c/c-typeck.c:7619
  #, gcc-internal-format
  msgid "missing braces around initializer"
  msgstr ""
  
! #: c/c-typeck.c:7641
  #, gcc-internal-format
  msgid "missing initializer for field %qD of %qT"
  msgstr ""
  
! #: c/c-typeck.c:7666
  #, gcc-internal-format
  msgid "empty scalar initializer"
  msgstr ""
  
! #: c/c-typeck.c:7671
  #, gcc-internal-format
  msgid "extra elements in scalar initializer"
  msgstr ""
  
! #: c/c-typeck.c:7783 c/c-typeck.c:7865
  #, gcc-internal-format
  msgid "array index in non-array initializer"
  msgstr ""
  
! #: c/c-typeck.c:7788 c/c-typeck.c:7928
  #, gcc-internal-format
  msgid "field name not in record or union initializer"
  msgstr ""
  
! #: c/c-typeck.c:7838
  #, gcc-internal-format
  msgid "array index in initializer not of integer type"
  msgstr ""
  
! #: c/c-typeck.c:7847 c/c-typeck.c:7856
  #, gcc-internal-format
  msgid "array index in initializer is not an integer constant expression"
  msgstr ""
  
! #: c/c-typeck.c:7861 c/c-typeck.c:7863
  #, gcc-internal-format
  msgid "nonconstant array index in initializer"
  msgstr ""
  
! #: c/c-typeck.c:7867 c/c-typeck.c:7870
  #, gcc-internal-format
  msgid "array index in initializer exceeds array bounds"
  msgstr ""
  
! #: c/c-typeck.c:7889
  #, gcc-internal-format
  msgid "empty index range in initializer"
  msgstr ""
  
! #: c/c-typeck.c:7898
  #, gcc-internal-format
  msgid "array index range in initializer exceeds array bounds"
  msgstr ""
  
! #: c/c-typeck.c:7935
  #, gcc-internal-format
  msgid "unknown field %qE specified in initializer"
  msgstr ""
  
! #: c/c-typeck.c:7988 c/c-typeck.c:8018 c/c-typeck.c:8550
  #, gcc-internal-format
  msgid "initialized field with side-effects overwritten"
  msgstr ""
  
! #: c/c-typeck.c:7992 c/c-typeck.c:8022 c/c-typeck.c:8553
  #, gcc-internal-format
  msgid "initialized field overwritten"
  msgstr ""
  
! #: c/c-typeck.c:8774
  #, gcc-internal-format
  msgid "excess elements in char array initializer"
  msgstr ""
  
! #: c/c-typeck.c:8781 c/c-typeck.c:8851
  #, gcc-internal-format
  msgid "excess elements in struct initializer"
  msgstr ""
  
! #: c/c-typeck.c:8796
  #, gcc-internal-format
  msgid ""
  "positional initialization of field in %<struct%> declared with "
  "%<designated_init%> attribute"
  msgstr ""
  
! #: c/c-typeck.c:8866
  #, gcc-internal-format
  msgid "non-static initialization of a flexible array member"
  msgstr ""
  
! #: c/c-typeck.c:8965
  #, gcc-internal-format
  msgid "excess elements in union initializer"
  msgstr ""
  
! #: c/c-typeck.c:8987
  #, gcc-internal-format
  msgid "traditional C rejects initialization of unions"
  msgstr ""
  
! #: c/c-typeck.c:9055
  #, gcc-internal-format
  msgid "excess elements in array initializer"
  msgstr ""
  
! #: c/c-typeck.c:9089
  #, gcc-internal-format
  msgid "excess elements in vector initializer"
  msgstr ""
  
! #: c/c-typeck.c:9121
  #, gcc-internal-format
  msgid "excess elements in scalar initializer"
  msgstr ""
  
! #: c/c-typeck.c:9362
  #, gcc-internal-format
  msgid "ISO C forbids %<goto *expr;%>"
  msgstr ""
  
! #: c/c-typeck.c:9390 cp/typeck.c:8465
  #, gcc-internal-format
  msgid "function declared %<noreturn%> has a %<return%> statement"
  msgstr ""
  
! #: c/c-typeck.c:9400 cp/cp-array-notation.c:1103
  #, gcc-internal-format
  msgid "array notation expression cannot be used as a return value"
  msgstr ""
  
! #: c/c-typeck.c:9407 cp/typeck.c:8456
  #, gcc-internal-format
  msgid "use of %<_Cilk_spawn%> in a return statement is not allowed"
  msgstr ""
  
! #: c/c-typeck.c:9432 c/c-typeck.c:9435
  #, gcc-internal-format
  msgid "%<return%> with no value, in function returning non-void"
  msgstr ""
  
! #: c/c-typeck.c:9445
  #, gcc-internal-format
  msgid "%<return%> with a value, in function returning void"
  msgstr ""
  
! #: c/c-typeck.c:9447
  #, gcc-internal-format
  msgid "ISO C forbids %<return%> with expression, in function returning void"
  msgstr ""
  
! #: c/c-typeck.c:9520
  #, gcc-internal-format
  msgid "function returns address of label"
  msgstr ""
  
! #: c/c-typeck.c:9602 cp/semantics.c:1163
  #, gcc-internal-format
  msgid "switch quantity not an integer"
  msgstr ""
  
! #: c/c-typeck.c:9622
  #, gcc-internal-format
  msgid "switch condition has boolean value"
  msgstr ""
  
! #: c/c-typeck.c:9628
  #, gcc-internal-format
  msgid "%<long%> switch expression not converted to %<int%> in ISO C"
  msgstr ""
  
! #: c/c-typeck.c:9664 c/c-typeck.c:9672
  #, gcc-internal-format
  msgid "case label is not an integer constant expression"
  msgstr ""
  
! #: c/c-typeck.c:9678 cp/parser.c:9933
  #, gcc-internal-format
  msgid "case label not within a switch statement"
  msgstr ""
  
! #: c/c-typeck.c:9680
  #, gcc-internal-format
  msgid "%<default%> label not within a switch statement"
  msgstr ""
  
! #: c/c-typeck.c:9750
  #, gcc-internal-format
  msgid "rank-mismatch between if-statement%'s condition and the then-block"
  msgstr ""
  
! #: c/c-typeck.c:9756
  #, gcc-internal-format
  msgid "rank-mismatch between if-statement%'s condition and the else-block"
  msgstr ""
  
! #: c/c-typeck.c:9792 cp/parser.c:10241
  #, gcc-internal-format
  msgid "suggest explicit braces to avoid ambiguous %<else%>"
  msgstr ""
  
! #: c/c-typeck.c:9904 cp/parser.c:11014
  #, gcc-internal-format
  msgid "break statement not within loop or switch"
  msgstr ""
  
! #: c/c-typeck.c:9906 cp/parser.c:11040
  #, gcc-internal-format
  msgid "continue statement not within a loop"
  msgstr ""
  
! #: c/c-typeck.c:9911 cp/parser.c:11027
  #, gcc-internal-format
  msgid "break statement used with OpenMP for loop"
  msgstr ""
  
! #: c/c-typeck.c:9916
  #, gcc-internal-format
  msgid "break statement within %<#pragma simd%> loop body"
  msgstr ""
  
! #: c/c-typeck.c:9918 cp/parser.c:11044
  #, gcc-internal-format
  msgid "continue statement within %<#pragma simd%> loop body"
  msgstr ""
  
! #: c/c-typeck.c:9944 cp/cp-gimplify.c:439
  #, gcc-internal-format
  msgid "statement with no effect"
  msgstr ""
  
! #: c/c-typeck.c:9988
  #, gcc-internal-format
  msgid "expression statement has incomplete type"
  msgstr ""
  
! #: c/c-typeck.c:10754 c/c-typeck.c:10910 cp/typeck.c:4657
  #, gcc-internal-format
  msgid "comparing vectors with different element types"
  msgstr ""
  
! #: c/c-typeck.c:10761 c/c-typeck.c:10917 cp/typeck.c:4669
  #, gcc-internal-format
  msgid "comparing vectors with different number of elements"
  msgstr ""
  
! #: c/c-typeck.c:10791 cp/typeck.c:4385
  #, gcc-internal-format
  msgid "comparing floating point with == or != is unsafe"
  msgstr ""
  
! #: c/c-typeck.c:10808 c/c-typeck.c:10828
  #, gcc-internal-format
  msgid ""
  "the comparison will always evaluate as %<false%> for the address of %qD will "
  "never be NULL"
  msgstr ""
  
! #: c/c-typeck.c:10814 c/c-typeck.c:10834
  #, gcc-internal-format
  msgid ""
  "the comparison will always evaluate as %<true%> for the address of %qD will "
  "never be NULL"
  msgstr ""
  
! #: c/c-typeck.c:10855 c/c-typeck.c:10974
  #, gcc-internal-format
  msgid "comparison of pointers to disjoint address spaces"
  msgstr ""
  
! #: c/c-typeck.c:10862 c/c-typeck.c:10868
  #, gcc-internal-format
  msgid "ISO C forbids comparison of %<void *%> with function pointer"
  msgstr ""
  
! #: c/c-typeck.c:10875 c/c-typeck.c:10984
  #, gcc-internal-format
  msgid "comparison of distinct pointer types lacks a cast"
  msgstr ""
  
! #: c/c-typeck.c:10887 c/c-typeck.c:10892 c/c-typeck.c:11010 c/c-typeck.c:11015
  #, gcc-internal-format
  msgid "comparison between pointer and integer"
  msgstr ""
  
! #: c/c-typeck.c:10962
  #, gcc-internal-format
  msgid "comparison of complete and incomplete pointers"
  msgstr ""
  
! #: c/c-typeck.c:10964
  #, gcc-internal-format
  msgid "ISO C forbids ordered comparisons of pointers to functions"
  msgstr ""
  
! #: c/c-typeck.c:10969
  #, gcc-internal-format
  msgid "ordered comparison of pointer with null pointer"
  msgstr ""
  
! #: c/c-typeck.c:10992 c/c-typeck.c:10995 c/c-typeck.c:11002 c/c-typeck.c:11005
! #: cp/typeck.c:4720 cp/typeck.c:4727
  #, gcc-internal-format
  msgid "ordered comparison of pointer with integer zero"
  msgstr ""
  
! #: c/c-typeck.c:11053 cp/typeck.c:4800
  #, gcc-internal-format
  msgid ""
  "implicit conversion from %qT to %qT to match other operand of binary "
  "expression"
  msgstr ""
  
! #: c/c-typeck.c:11362
  #, gcc-internal-format
  msgid "used array that cannot be converted to pointer where scalar is required"
  msgstr ""
  
! #: c/c-typeck.c:11366
  #, gcc-internal-format
  msgid "used struct type value where scalar is required"
  msgstr ""
  
! #: c/c-typeck.c:11370
  #, gcc-internal-format
  msgid "used union type value where scalar is required"
  msgstr ""
  
! #: c/c-typeck.c:11381
  #, gcc-internal-format
  msgid "used vector type where scalar is required"
  msgstr ""
  
! #: c/c-typeck.c:11572 cp/semantics.c:7008
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp cancel must specify one of %<parallel%>, %<for%>, %<sections%> "
  "or %<taskgroup%> clauses"
  msgstr ""
  
! #: c/c-typeck.c:11611 cp/semantics.c:7045
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp cancellation point must specify one of %<parallel%>, %<for%>, "
  "%<sections%> or %<taskgroup%> clauses"
  msgstr ""
  
! #: c/c-typeck.c:11654 cp/semantics.c:4304 cp/semantics.c:5804
  #, gcc-internal-format
  msgid "%qD is not a variable in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11658 c/c-typeck.c:12433 cp/semantics.c:4308
! #: cp/semantics.c:5807
  #, gcc-internal-format
  msgid "%qE is not a variable in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11666 c/c-typeck.c:12440 cp/semantics.c:4316
! #: cp/semantics.c:5813
  #, gcc-internal-format
  msgid "%qD is threadprivate variable in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11688 cp/semantics.c:4344
  #, gcc-internal-format
  msgid "low bound %qE of array section does not have integral type"
  msgstr ""
  
! #: c/c-typeck.c:11695 cp/semantics.c:4351
  #, gcc-internal-format
  msgid "length %qE of array section does not have integral type"
  msgstr ""
  
! #: c/c-typeck.c:11727 cp/semantics.c:4387
  #, gcc-internal-format
  msgid "for unknown bound array type length expression must be specified"
  msgstr ""
  
! #: c/c-typeck.c:11735 cp/semantics.c:4395
  #, gcc-internal-format
  msgid "negative low bound in array section in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11744 cp/semantics.c:4404
  #, gcc-internal-format
  msgid "negative length in array section in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11761 cp/semantics.c:4421
  #, gcc-internal-format
  msgid "low bound %qE above array section size in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11786 cp/semantics.c:4446
  #, gcc-internal-format
  msgid "length %qE above array section size in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11801 cp/semantics.c:4461
  #, gcc-internal-format
  msgid "high bound %qE above array section size in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11832 cp/semantics.c:4492
  #, gcc-internal-format
  msgid "for pointer type length expression must be specified"
  msgstr ""
  
! #: c/c-typeck.c:11841 c/c-typeck.c:11956 cp/semantics.c:4501
! #: cp/semantics.c:4612
  #, gcc-internal-format
  msgid "array section is not contiguous in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:11849 cp/semantics.c:4509
  #, gcc-internal-format
  msgid "%qE does not have pointer or array type"
  msgstr ""
  
! #: c/c-typeck.c:12169
  #, gcc-internal-format
  msgid "%qE has invalid type for %<reduction(%s)%>"
  msgstr ""
  
! #: c/c-typeck.c:12178 cp/semantics.c:5293
  #, gcc-internal-format
  msgid "user defined reduction not found for %qD"
  msgstr ""
  
! #: c/c-typeck.c:12250 c/c-typeck.c:12488 cp/semantics.c:5943
  #, gcc-internal-format
  msgid "%<nowait%> clause must not be used together with %<copyprivate%>"
  msgstr ""
  
! #: c/c-typeck.c:12262 cp/semantics.c:5983
  #, gcc-internal-format
  msgid "%qE must be %<threadprivate%> for %<copyin%>"
  msgstr ""
  
! #: c/c-typeck.c:12274
  #, gcc-internal-format
  msgid ""
  "linear clause applied to non-integral non-pointer variable with type %qT"
  msgstr ""
  
! #: c/c-typeck.c:12300 cp/semantics.c:5401
  #, gcc-internal-format
  msgid "%qE is not a variable in clause %qs"
  msgstr ""
  
! #: c/c-typeck.c:12309 c/c-typeck.c:12330 c/c-typeck.c:12351
  #, gcc-internal-format
  msgid "%qE appears more than once in data clauses"
  msgstr ""
  
! #: c/c-typeck.c:12323 cp/semantics.c:5425
  #, gcc-internal-format
  msgid "%qE is not a variable in clause %<firstprivate%>"
  msgstr ""
  
! #: c/c-typeck.c:12344 cp/semantics.c:5447
  #, gcc-internal-format
  msgid "%qE is not a variable in clause %<lastprivate%>"
  msgstr ""
  
! #: c/c-typeck.c:12363 cp/semantics.c:5691
  #, gcc-internal-format
  msgid "%qE is not a variable in %<aligned%> clause"
  msgstr ""
  
! #: c/c-typeck.c:12370
  #, gcc-internal-format
  msgid "%qE in %<aligned%> clause is neither a pointer nor an array"
  msgstr ""
  
! #: c/c-typeck.c:12377
  #, gcc-internal-format
  msgid "%qE appears more than once in %<aligned%> clauses"
  msgstr ""
  
! #: c/c-typeck.c:12398 cp/semantics.c:5761
  #, gcc-internal-format
  msgid "%qE is not a variable in %<depend%> clause"
  msgstr ""
  
! #: c/c-typeck.c:12420 cp/semantics.c:5786
  #, gcc-internal-format
  msgid "array section does not have mappable type in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:12453 cp/semantics.c:5830
  #, gcc-internal-format
  msgid "%qD does not have a mappable type in %qs clause"
  msgstr ""
  
! #: c/c-typeck.c:12460 cp/semantics.c:5837
  #, gcc-internal-format
  msgid "%qD appears more than once in motion clauses"
  msgstr ""
  
! #: c/c-typeck.c:12462 cp/semantics.c:5839
  #, gcc-internal-format
  msgid "%qD appears more than once in map clauses"
  msgstr ""
  
! #: c/c-typeck.c:12475 cp/semantics.c:5853
  #, gcc-internal-format
  msgid "%qD is not an argument in %<uniform%> clause"
  msgstr ""
  
! #: c/c-typeck.c:12478 cp/semantics.c:5855
  #, gcc-internal-format
  msgid "%qE is not an argument in %<uniform%> clause"
  msgstr ""
  
! #: c/c-typeck.c:12536 cp/semantics.c:5879
  #, gcc-internal-format
  msgid "%<inbranch%> clause is incompatible with %<notinbranch%>"
  msgstr ""
  
! #: c/c-typeck.c:12586 cp/semantics.c:6030
  #, gcc-internal-format
  msgid "%qE is predetermined %qs for %qs"
  msgstr ""
  
! #: c/c-typeck.c:12701
  #, gcc-internal-format
  msgid "C++ requires promoted type, not enum type, in %<va_arg%>"
  msgstr ""
  
  #. A bad conversion for 'this' must be discarding cv-quals.
! #: cp/call.c:3303
  #, gcc-internal-format
  msgid "  passing %qT as %<this%> argument discards qualifiers"
  msgstr ""
  
! #: cp/call.c:3307
  #, gcc-internal-format
  msgid "  no known conversion for implicit %<this%> parameter from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:3314
  #, gcc-internal-format, gfc-internal-format
  msgid "  conversion of argument %d would be ill-formed:"
  msgstr ""
  
  #. Conversion of conversion function return value failed.
! #: cp/call.c:3321
  #, gcc-internal-format
  msgid "  no known conversion from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:3324
  #, gcc-internal-format
  msgid "  no known conversion for argument %d from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:3335 cp/pt.c:5733
  #, gcc-internal-format, gfc-internal-format
  msgid "  candidate expects %d argument, %d provided"
  msgid_plural "  candidate expects %d arguments, %d provided"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/call.c:3360
  #, gcc-internal-format
  msgid "%s%D(%T, %T, %T) <built-in>"
  msgstr ""
  
! #: cp/call.c:3365
  #, gcc-internal-format
  msgid "%s%D(%T, %T) <built-in>"
  msgstr ""
  
! #: cp/call.c:3369
  #, gcc-internal-format
  msgid "%s%D(%T) <built-in>"
  msgstr ""
  
! #: cp/call.c:3373
  #, gcc-internal-format
  msgid "%s%T <conversion>"
  msgstr ""
  
! #: cp/call.c:3375
  #, gcc-internal-format
  msgid "%s%#D <near match>"
  msgstr ""
  
! #: cp/call.c:3377
  #, gcc-internal-format
  msgid "%s%#D <deleted>"
  msgstr ""
  
! #: cp/call.c:3379
  #, gcc-internal-format
  msgid "%s%#D"
  msgstr ""
  
! #: cp/call.c:3398
  #, gcc-internal-format
  msgid ""
  "  return type %qT of explicit conversion function cannot be converted to %qT "
  "with a qualification conversion"
  msgstr ""
  
! #: cp/call.c:3404
  #, gcc-internal-format
  msgid ""
  "  conversion from return type %qT of template conversion function "
  "specialization to %qT is not an exact match"
  msgstr ""
  
! #: cp/call.c:3415
  #, gcc-internal-format
  msgid ""
  "  substitution of deduced template arguments resulted in errors seen above"
  msgstr ""
  
  #. Re-run template unification with diagnostics.
! #: cp/call.c:3420
  #, gcc-internal-format
  msgid "  template argument deduction/substitution failed:"
  msgstr ""
  
! #: cp/call.c:3434
  #, gcc-internal-format
  msgid ""
  "  a constructor taking a single argument of its own class type is invalid"
  msgstr ""
  
! #: cp/call.c:3795
  #, gcc-internal-format
  msgid "conversion from %qT to %qT is ambiguous"
  msgstr ""
  
! #: cp/call.c:3922
  #, gcc-internal-format
  msgid ""
  "conversion from %qT to %qT not considered for non-type template argument"
  msgstr ""
  
! #: cp/call.c:4040
  #, gcc-internal-format
  msgid "no matching function for call to %<%D(%A)%>"
  msgstr ""
  
! #: cp/call.c:4043
  #, gcc-internal-format
  msgid "call of overloaded %<%D(%A)%> is ambiguous"
  msgstr ""
  
  #. It's no good looking for an overloaded operator() on a
  #. pointer-to-member-function.
! #: cp/call.c:4252
  #, gcc-internal-format
  msgid ""
  "pointer-to-member function %E cannot be called without an object; consider "
  "using .* or ->*"
  msgstr ""
  
! #: cp/call.c:4323
  #, gcc-internal-format
  msgid "no match for call to %<(%T) (%A)%>"
  msgstr ""
  
! #: cp/call.c:4336
  #, gcc-internal-format
  msgid "call of %<(%T) (%A)%> is ambiguous"
  msgstr ""
  
! #: cp/call.c:4384
  #, gcc-internal-format
  msgid "ambiguous overload for "
  msgstr ""
  
! #: cp/call.c:4385
  #, gcc-internal-format
  msgid "no match for "
  msgstr ""
  
! #: cp/call.c:4388
  #, gcc-internal-format
  msgid " (operand types are %qT, %qT, and %qT)"
  msgstr ""
  
! #: cp/call.c:4390
  #, gcc-internal-format
  msgid " (operand types are %qT and %qT)"
  msgstr ""
  
! #: cp/call.c:4392
  #, gcc-internal-format
  msgid " (operand type is %qT)"
  msgstr ""
  
! #: cp/call.c:4412
  #, gcc-internal-format
  msgid "ternary %<operator?:%>"
  msgstr ""
  
! #: cp/call.c:4416
  #, gcc-internal-format
  msgid "ternary %<operator?:%> in %<%E ? %E : %E%>"
  msgstr ""
  
! #: cp/call.c:4425 cp/call.c:4456 cp/call.c:4465
  #, gcc-internal-format
  msgid "%<operator%s%>"
  msgstr ""
  
! #: cp/call.c:4428
  #, gcc-internal-format
  msgid "%<operator%s%> in %<%E%s%>"
  msgstr ""
  
! #: cp/call.c:4435
  #, gcc-internal-format
  msgid "%<operator[]%>"
  msgstr ""
  
! #: cp/call.c:4438
  #, gcc-internal-format
  msgid "%<operator[]%> in %<%E[%E]%>"
  msgstr ""
  
! #: cp/call.c:4446
  #, gcc-internal-format
  msgid "%qs"
  msgstr ""
  
! #: cp/call.c:4449
  #, gcc-internal-format
  msgid "%qs in %<%s %E%>"
  msgstr ""
  
! #: cp/call.c:4459
  #, gcc-internal-format
  msgid "%<operator%s%> in %<%E %s %E%>"
  msgstr ""
  
! #: cp/call.c:4468
  #, gcc-internal-format
  msgid "%<operator%s%> in %<%s%E%>"
  msgstr ""
  
! #: cp/call.c:4577
  #, gcc-internal-format
  msgid "ISO C++ forbids omitting the middle term of a ?: expression"
  msgstr ""
  
! #: cp/call.c:4626
  #, gcc-internal-format
  msgid ""
  "inferred scalar type %qT is not an integer or floating point type of the "
  "same size as %qT"
  msgstr ""
  
! #: cp/call.c:4704
  #, gcc-internal-format
  msgid "incompatible vector types in conditional expression: %qT, %qT and %qT"
  msgstr ""
  
! #: cp/call.c:4792
  #, gcc-internal-format
  msgid ""
  "second operand to the conditional operator is of type %<void%>, but the "
  "third operand is neither a throw-expression nor of type %<void%>"
  msgstr ""
  
! #: cp/call.c:4797
  #, gcc-internal-format
  msgid ""
  "third operand to the conditional operator is of type %<void%>, but the "
  "second operand is neither a throw-expression nor of type %<void%>"
  msgstr ""
  
! #: cp/call.c:4848 cp/call.c:4964 cp/call.c:5107
  #, gcc-internal-format
  msgid "operands to ?: have different types %qT and %qT"
  msgstr ""
  
! #: cp/call.c:4851
  #, gcc-internal-format
  msgid "  and each type can be converted to the other"
  msgstr ""
  
! #: cp/call.c:5052
  #, gcc-internal-format
  msgid "enumeral mismatch in conditional expression: %qT vs %qT"
  msgstr ""
  
! #: cp/call.c:5064
  #, gcc-internal-format
  msgid "enumeral and non-enumeral type in conditional expression"
  msgstr ""
  
! #: cp/call.c:5530
  #, gcc-internal-format
  msgid "no %<%D(int)%> declared for postfix %qs, trying prefix operator instead"
  msgstr ""
  
! #: cp/call.c:5532
  #, gcc-internal-format
  msgid "no %<%D(int)%> declared for postfix %qs"
  msgstr ""
  
! #: cp/call.c:5625
  #, gcc-internal-format
  msgid "comparison between %q#T and %q#T"
  msgstr ""
  
! #: cp/call.c:5895
  #, gcc-internal-format
  msgid "non-placement deallocation function %q+D"
  msgstr ""
  
! #: cp/call.c:5896
  #, gcc-internal-format
  msgid "selected for placement delete"
  msgstr ""
  
! #: cp/call.c:6011
  #, gcc-internal-format
  msgid "no corresponding deallocation function for %qD"
  msgstr ""
  
! #: cp/call.c:6017
  #, gcc-internal-format
  msgid "no suitable %<operator %s%> for %qT"
  msgstr ""
  
! #: cp/call.c:6038
  #, gcc-internal-format
  msgid "%q+#D is private"
  msgstr ""
  
! #: cp/call.c:6040
  #, gcc-internal-format
  msgid "%q+#D is protected"
  msgstr ""
  
! #: cp/call.c:6042
  #, gcc-internal-format
  msgid "%q+#D is inaccessible"
  msgstr ""
  
! #: cp/call.c:6043
  #, gcc-internal-format
  msgid "within this context"
  msgstr ""
  
! #: cp/call.c:6094
  #, gcc-internal-format
  msgid "passing NULL to non-pointer argument %P of %qD"
  msgstr ""
  
! #: cp/call.c:6098
  #, gcc-internal-format
  msgid "converting to non-pointer type %qT from NULL"
  msgstr ""
  
! #: cp/call.c:6107
  #, gcc-internal-format
  msgid "converting %<false%> to pointer type for argument %P of %qD"
  msgstr ""
  
! #: cp/call.c:6111
  #, gcc-internal-format
  msgid "converting %<false%> to pointer type %qT"
  msgstr ""
  
! #: cp/call.c:6174
  #, gcc-internal-format
  msgid "too many braces around initializer for %qT"
  msgstr ""
  
! #: cp/call.c:6185
  #, gcc-internal-format
  msgid "converting to %qT from %qT requires direct-initialization"
  msgstr ""
  
! #: cp/call.c:6193
  #, gcc-internal-format
  msgid "invalid user-defined conversion from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:6210 cp/call.c:6234 cp/call.c:6463
  #, gcc-internal-format
  msgid "  initializing argument %P of %qD"
  msgstr ""
  
! #: cp/call.c:6230 cp/cvt.c:236
  #, gcc-internal-format
  msgid "invalid conversion from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:6259
  #, gcc-internal-format
  msgid ""
  "converting to %qT from initializer list would use explicit constructor %qD"
  msgstr ""
  
! #: cp/call.c:6339 cp/call.c:6491
  #, gcc-internal-format
  msgid "  initializing argument %P of %q+D"
  msgstr ""
  
! #: cp/call.c:6477
  #, gcc-internal-format
  msgid "cannot bind %qT lvalue to %qT"
  msgstr ""
  
! #: cp/call.c:6481 cp/call.c:9777
  #, gcc-internal-format
  msgid ""
  "invalid initialization of non-const reference of type %qT from an rvalue of "
  "type %qT"
  msgstr ""
  
! #: cp/call.c:6484
  #, gcc-internal-format
  msgid "binding %qT to reference of type %qT discards qualifiers"
  msgstr ""
  
! #: cp/call.c:6520
  #, gcc-internal-format
  msgid "cannot bind bitfield %qE to %qT"
  msgstr ""
  
! #: cp/call.c:6523 cp/call.c:6540
  #, gcc-internal-format
  msgid "cannot bind packed field %qE to %qT"
  msgstr ""
  
! #: cp/call.c:6526
  #, gcc-internal-format
  msgid "cannot bind rvalue %qE to %qT"
  msgstr ""
  
! #: cp/call.c:6648 cp/cvt.c:1747
  #, gcc-internal-format
  msgid ""
  "scoped enum %qT passed through ... as %qT before -fabi-version=6, %qT after"
  msgstr ""
  
! #: cp/call.c:6689
  #, gcc-internal-format
  msgid ""
  "passing objects of non-trivially-copyable type %q#T through %<...%> is "
  "conditionally supported"
  msgstr ""
  
! #: cp/call.c:6720
  #, gcc-internal-format
  msgid "cannot receive reference type %qT through %<...%>"
  msgstr ""
  
! #: cp/call.c:6730
  #, gcc-internal-format
  msgid ""
  "receiving objects of non-trivially-copyable type %q#T through %<...%> is "
  "conditionally-supported"
  msgstr ""
  
! #: cp/call.c:6790
  #, gcc-internal-format
  msgid "recursive evaluation of default argument for %q#D"
  msgstr ""
  
! #: cp/call.c:6799
  #, gcc-internal-format
  msgid ""
  "call to %qD uses the default argument for parameter %P, which is not yet "
  "defined"
  msgstr ""
  
! #: cp/call.c:6901
  #, gcc-internal-format
  msgid "argument of function call might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/call.c:6948
  #, gcc-internal-format
  msgid "use of multiversioned function without a default"
  msgstr ""
  
! #: cp/call.c:7230
  #, gcc-internal-format
  msgid "passing %qT as %<this%> argument discards qualifiers"
  msgstr ""
  
! #: cp/call.c:7233 cp/call.c:9017 cp/name-lookup.c:5713
  #, gcc-internal-format
  msgid "  in call to %qD"
  msgstr ""
  
! #: cp/call.c:7263
  #, gcc-internal-format
  msgid "%qT is not an accessible base of %qT"
  msgstr ""
  
! #: cp/call.c:7345
  #, gcc-internal-format
  msgid "deducing %qT as %qT"
  msgstr ""
  
! #: cp/call.c:7348
  #, gcc-internal-format
  msgid "  in call to %q+D"
  msgstr ""
  
! #: cp/call.c:7350
  #, gcc-internal-format
  msgid "  (you can disable this with -fno-deduce-init-list)"
  msgstr ""
  
! #: cp/call.c:7707
  #, gcc-internal-format
  msgid "could not find class$ field in java interface type %qT"
  msgstr ""
  
! #: cp/call.c:7882
  #, gcc-internal-format
  msgid "constructor delegates to itself"
  msgstr ""
  
! #: cp/call.c:7972
  #, gcc-internal-format
  msgid "call to non-function %qD"
  msgstr ""
  
! #: cp/call.c:8018 cp/typeck.c:2751
  #, gcc-internal-format
  msgid "cannot call constructor %<%T::%D%> directly"
  msgstr ""
  
! #: cp/call.c:8020
  #, gcc-internal-format
  msgid "for a function-style cast, remove the redundant %<::%D%>"
  msgstr ""
  
! #: cp/call.c:8147
  #, gcc-internal-format
  msgid "no matching function for call to %<%T::operator %T(%A)%#V%>"
  msgstr ""
  
! #: cp/call.c:8160
  #, gcc-internal-format
  msgid "no matching function for call to %<%T::%s(%A)%#V%>"
  msgstr ""
  
! #: cp/call.c:8186
  #, gcc-internal-format
  msgid "no matching function for call to %<%s(%A)%>"
  msgstr ""
  
! #: cp/call.c:8189
  #, gcc-internal-format
  msgid "call of overloaded %<%s(%A)%> is ambiguous"
  msgstr ""
  
! #: cp/call.c:8210
  #, gcc-internal-format
  msgid "pure virtual %q#D called from non-static data member initializer"
  msgstr ""
  
! #: cp/call.c:8236
  #, gcc-internal-format
  msgid "cannot call member function %qD without object"
  msgstr ""
  
! #: cp/call.c:9015
  #, gcc-internal-format
  msgid "passing %qT chooses %qT over %qT"
  msgstr ""
  
! #: cp/call.c:9075
  #, gcc-internal-format
  msgid "choosing %qD over %qD"
  msgstr ""
  
! #: cp/call.c:9076
  #, gcc-internal-format
  msgid "  for conversion from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:9079
  #, gcc-internal-format
  msgid "  because conversion sequence for the argument is better"
  msgstr ""
  
! #: cp/call.c:9232
  #, gcc-internal-format
  msgid "default argument mismatch in overload resolution"
  msgstr ""
  
! #: cp/call.c:9236
  #, gcc-internal-format
  msgid " candidate 1: %q+#F"
  msgstr ""
  
! #: cp/call.c:9238
  #, gcc-internal-format
  msgid " candidate 2: %q+#F"
  msgstr ""
  
! #: cp/call.c:9283
  #, gcc-internal-format
  msgid ""
  "ISO C++ says that these are ambiguous, even though the worst conversion for "
  "the first is better than the worst conversion for the second:"
  msgstr ""
  
! #: cp/call.c:9461
  #, gcc-internal-format
  msgid "could not convert %qE from %qT to %qT"
  msgstr ""
  
! #: cp/call.c:9654
  #, gcc-internal-format
  msgid "a temporary bound to %qD only persists until the constructor exits"
  msgstr ""
  
! #: cp/call.c:9781
  #, gcc-internal-format
  msgid ""
  "invalid initialization of reference of type %qT from expression of type %qT"
*************** msgstr ""
*** 33740,34128 ****
  msgid "cannot derive from %<final%> base %qT in derived type %qT"
  msgstr ""
  
! #: cp/class.c:2123
  #, gcc-internal-format
  msgid "all member functions in class %qT are private"
  msgstr ""
  
! #: cp/class.c:2135
  #, gcc-internal-format
  msgid "%q#T only defines a private destructor and has no friends"
  msgstr ""
  
! #: cp/class.c:2180
  #, gcc-internal-format
  msgid "%q#T only defines private constructors and has no friends"
  msgstr ""
  
! #: cp/class.c:2573
  #, gcc-internal-format
  msgid "no unique final overrider for %qD in %qT"
  msgstr ""
  
! #: cp/class.c:2936
  #, gcc-internal-format
  msgid "%q+D can be marked override"
  msgstr ""
  
! #: cp/class.c:2948
  #, gcc-internal-format
  msgid "%q+#D marked %<final%>, but is not virtual"
  msgstr ""
  
! #: cp/class.c:2950
  #, gcc-internal-format
  msgid "%q+#D marked %<override%>, but does not override"
  msgstr ""
  
  #. Here we know it is a hider, and no overrider exists.
! #: cp/class.c:3018
  #, gcc-internal-format
  msgid "%q+D was hidden"
  msgstr ""
  
! #: cp/class.c:3019
  #, gcc-internal-format
  msgid "  by %q+D"
  msgstr ""
  
! #: cp/class.c:3053 cp/decl2.c:1537
  #, gcc-internal-format
  msgid "%q+#D invalid; an anonymous union can only have non-static data members"
  msgstr ""
  
! #: cp/class.c:3057
  #, gcc-internal-format
  msgid ""
  "%q+#D invalid; an anonymous struct can only have non-static data members"
  msgstr ""
  
! #: cp/class.c:3069 cp/decl2.c:1543
  #, gcc-internal-format
  msgid "private member %q+#D in anonymous union"
  msgstr ""
  
! #: cp/class.c:3072
  #, gcc-internal-format
  msgid "private member %q+#D in anonymous struct"
  msgstr ""
  
! #: cp/class.c:3078 cp/decl2.c:1545
  #, gcc-internal-format
  msgid "protected member %q+#D in anonymous union"
  msgstr ""
  
! #: cp/class.c:3081
  #, gcc-internal-format
  msgid "protected member %q+#D in anonymous struct"
  msgstr ""
  
! #: cp/class.c:3259
  #, gcc-internal-format
  msgid "the ellipsis in %qD is not inherited"
  msgstr ""
  
! #: cp/class.c:3434
  #, gcc-internal-format
  msgid "bit-field %q+#D with non-integral type"
  msgstr ""
  
! #: cp/class.c:3450
  #, gcc-internal-format
  msgid "bit-field %q+D width not an integer constant"
  msgstr ""
  
! #: cp/class.c:3455
  #, gcc-internal-format
  msgid "negative width in bit-field %q+D"
  msgstr ""
  
! #: cp/class.c:3460
  #, gcc-internal-format
  msgid "zero width for bit-field %q+D"
  msgstr ""
  
! #: cp/class.c:3469
  #, gcc-internal-format
  msgid "width of %q+D exceeds its type"
  msgstr ""
  
! #: cp/class.c:3473
  #, gcc-internal-format
  msgid "%q+D is too small to hold all values of %q#T"
  msgstr ""
  
! #: cp/class.c:3532
  #, gcc-internal-format
  msgid "member %q+#D with constructor not allowed in union"
  msgstr ""
  
! #: cp/class.c:3535
  #, gcc-internal-format
  msgid "member %q+#D with destructor not allowed in union"
  msgstr ""
  
! #: cp/class.c:3537
  #, gcc-internal-format
  msgid "member %q+#D with copy assignment operator not allowed in union"
  msgstr ""
  
! #: cp/class.c:3541
  #, gcc-internal-format
  msgid "unrestricted unions only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/class.c:3578
  #, gcc-internal-format
  msgid "multiple fields in union %qT initialized"
  msgstr ""
  
! #: cp/class.c:3666
  #, gcc-internal-format
  msgid "in C++98 %q+D may not be static because it is a member of a union"
  msgstr ""
  
! #: cp/class.c:3672
  #, gcc-internal-format
  msgid ""
  "in C++98 %q+D may not have reference type %qT because it is a member of a "
  "union"
  msgstr ""
  
! #: cp/class.c:3682
  #, gcc-internal-format
  msgid "field %q+D invalidly declared function type"
  msgstr ""
  
! #: cp/class.c:3688
  #, gcc-internal-format
  msgid "field %q+D invalidly declared method type"
  msgstr ""
  
! #: cp/class.c:3748
  #, gcc-internal-format
  msgid "ignoring packed attribute because of unpacked non-POD field %q+#D"
  msgstr ""
  
! #: cp/class.c:3796
  #, gcc-internal-format
  msgid "member %q+D cannot be declared both %<const%> and %<mutable%>"
  msgstr ""
  
! #: cp/class.c:3802
  #, gcc-internal-format
  msgid "member %q+D cannot be declared as a %<mutable%> reference"
  msgstr ""
  
! #: cp/class.c:3863
  #, gcc-internal-format
  msgid "field %q+#D with same name as class"
  msgstr ""
  
! #: cp/class.c:3886
  #, gcc-internal-format
  msgid "%q#T has pointer data members"
  msgstr ""
  
! #: cp/class.c:3891
  #, gcc-internal-format
  msgid "  but does not override %<%T(const %T&)%>"
  msgstr ""
  
! #: cp/class.c:3893
  #, gcc-internal-format
  msgid "  or %<operator=(const %T&)%>"
  msgstr ""
  
! #: cp/class.c:3897
  #, gcc-internal-format
  msgid "  but does not override %<operator=(const %T&)%>"
  msgstr ""
  
! #: cp/class.c:4300
  #, gcc-internal-format
  msgid "alignment of %qD increased in -fabi-version=9 (GCC 5.2)"
  msgstr ""
  
! #: cp/class.c:4303
  #, gcc-internal-format
  msgid "alignment of %qD will increase in -fabi-version=9"
  msgstr ""
  
! #: cp/class.c:4557
  #, gcc-internal-format
  msgid "initializer specified for non-virtual method %q+D"
  msgstr ""
  
! #: cp/class.c:4978
  #, gcc-internal-format
  msgid "method overrides both %<transaction_pure%> and %qE methods"
  msgstr ""
  
! #: cp/class.c:4999
  #, gcc-internal-format
  msgid "method declared %qE overriding %qE method"
  msgstr ""
  
! #: cp/class.c:5551 cp/constexpr.c:228
  #, gcc-internal-format
  msgid ""
  "enclosing class of constexpr non-static member function %q+#D is not a "
  "literal type"
  msgstr ""
  
! #: cp/class.c:5576
  #, gcc-internal-format
  msgid "%q+T is not literal because:"
  msgstr ""
  
! #: cp/class.c:5578
  #, gcc-internal-format
  msgid "  %q+T has a non-trivial destructor"
  msgstr ""
  
! #: cp/class.c:5583
  #, gcc-internal-format
  msgid ""
  "  %q+T is not an aggregate, does not have a trivial default constructor, and "
  "has no constexpr constructor that is not a copy or move constructor"
  msgstr ""
  
! #: cp/class.c:5618
  #, gcc-internal-format
  msgid "  base class %qT of %q+T is non-literal"
  msgstr ""
  
! #: cp/class.c:5632
  #, gcc-internal-format
  msgid "  non-static data member %q+D has non-literal type"
  msgstr ""
  
! #: cp/class.c:5638
  #, gcc-internal-format
  msgid "  non-static data member %q+D has volatile type"
  msgstr ""
  
! #: cp/class.c:5756
  #, gcc-internal-format
  msgid "base class %q#T has accessible non-virtual destructor"
  msgstr ""
  
! #: cp/class.c:5784
  #, gcc-internal-format
  msgid "non-static reference %q+#D in class without a constructor"
  msgstr ""
  
! #: cp/class.c:5789
  #, gcc-internal-format
  msgid "non-static const member %q+#D in class without a constructor"
  msgstr ""
  
  #. If the function is defaulted outside the class, we just
  #. give the synthesis error.
! #: cp/class.c:5815
  #, gcc-internal-format
  msgid ""
  "%q+D declared to take const reference, but implicit declaration would take "
  "non-const"
  msgstr ""
  
! #: cp/class.c:6092
  #, gcc-internal-format
  msgid "direct base %qT inaccessible in %qT due to ambiguity"
  msgstr ""
  
! #: cp/class.c:6104
  #, gcc-internal-format
  msgid "virtual base %qT inaccessible in %qT due to ambiguity"
  msgstr ""
  
! #: cp/class.c:6331
  #, gcc-internal-format
  msgid ""
  "offset of %q+D is not ABI-compliant and may change in a future version of GCC"
  msgstr ""
  
! #: cp/class.c:6573 cp/decl.c:12519 cp/parser.c:20506
  #, gcc-internal-format
  msgid "redefinition of %q#T"
  msgstr ""
  
! #: cp/class.c:6712
  #, gcc-internal-format
  msgid "%q#T has virtual functions and accessible non-virtual destructor"
  msgstr ""
  
! #: cp/class.c:6740
  #, gcc-internal-format
  msgid "type transparent %q#T does not have any fields"
  msgstr ""
  
! #: cp/class.c:6746
  #, gcc-internal-format
  msgid "type transparent class %qT has base classes"
  msgstr ""
  
! #: cp/class.c:6750
  #, gcc-internal-format
  msgid "type transparent class %qT has virtual functions"
  msgstr ""
  
! #: cp/class.c:6756
  #, gcc-internal-format
  msgid ""
  "type transparent %q#T cannot be made transparent because the type of the "
  "first field has a different ABI from the class overall"
  msgstr ""
  
! #: cp/class.c:6920
  #, gcc-internal-format
  msgid ""
  "definition of std::initializer_list does not match #include "
  "<initializer_list>"
  msgstr ""
  
! #: cp/class.c:6931
  #, gcc-internal-format
  msgid "trying to finish struct, but kicked out due to previous parse errors"
  msgstr ""
  
! #: cp/class.c:7465
  #, gcc-internal-format
  msgid "language string %<\"%E\"%> not recognized"
  msgstr ""
  
! #: cp/class.c:7555
  #, gcc-internal-format
  msgid "cannot resolve overloaded function %qD based on conversion to type %qT"
  msgstr ""
  
! #: cp/class.c:7692
  #, gcc-internal-format
  msgid "no matches converting function %qD to type %q#T"
  msgstr ""
  
! #: cp/class.c:7720
  #, gcc-internal-format
  msgid "converting overloaded function %qD to type %q#T is ambiguous"
  msgstr ""
  
! #: cp/class.c:7747
  #, gcc-internal-format
  msgid "assuming pointer to member %qD"
  msgstr ""
  
! #: cp/class.c:7750
  #, gcc-internal-format
  msgid "(a pointer to member can only be formed with %<&%E%>)"
  msgstr ""
  
! #: cp/class.c:7825 cp/class.c:7860
  #, gcc-internal-format
  msgid "not enough type information"
  msgstr ""
  
! #: cp/class.c:7843 cp/cvt.c:183 cp/cvt.c:210 cp/cvt.c:259
  #, gcc-internal-format
  msgid "cannot convert %qE from type %qT to type %qT"
  msgstr ""
--- 33923,34311 ----
  msgid "cannot derive from %<final%> base %qT in derived type %qT"
  msgstr ""
  
! #: cp/class.c:2132
  #, gcc-internal-format
  msgid "all member functions in class %qT are private"
  msgstr ""
  
! #: cp/class.c:2144
  #, gcc-internal-format
  msgid "%q#T only defines a private destructor and has no friends"
  msgstr ""
  
! #: cp/class.c:2189
  #, gcc-internal-format
  msgid "%q#T only defines private constructors and has no friends"
  msgstr ""
  
! #: cp/class.c:2582
  #, gcc-internal-format
  msgid "no unique final overrider for %qD in %qT"
  msgstr ""
  
! #: cp/class.c:2945
  #, gcc-internal-format
  msgid "%q+D can be marked override"
  msgstr ""
  
! #: cp/class.c:2957
  #, gcc-internal-format
  msgid "%q+#D marked %<final%>, but is not virtual"
  msgstr ""
  
! #: cp/class.c:2959
  #, gcc-internal-format
  msgid "%q+#D marked %<override%>, but does not override"
  msgstr ""
  
  #. Here we know it is a hider, and no overrider exists.
! #: cp/class.c:3027
  #, gcc-internal-format
  msgid "%q+D was hidden"
  msgstr ""
  
! #: cp/class.c:3028
  #, gcc-internal-format
  msgid "  by %q+D"
  msgstr ""
  
! #: cp/class.c:3062 cp/decl2.c:1546
  #, gcc-internal-format
  msgid "%q+#D invalid; an anonymous union can only have non-static data members"
  msgstr ""
  
! #: cp/class.c:3066
  #, gcc-internal-format
  msgid ""
  "%q+#D invalid; an anonymous struct can only have non-static data members"
  msgstr ""
  
! #: cp/class.c:3078 cp/decl2.c:1552
  #, gcc-internal-format
  msgid "private member %q+#D in anonymous union"
  msgstr ""
  
! #: cp/class.c:3081
  #, gcc-internal-format
  msgid "private member %q+#D in anonymous struct"
  msgstr ""
  
! #: cp/class.c:3087 cp/decl2.c:1554
  #, gcc-internal-format
  msgid "protected member %q+#D in anonymous union"
  msgstr ""
  
! #: cp/class.c:3090
  #, gcc-internal-format
  msgid "protected member %q+#D in anonymous struct"
  msgstr ""
  
! #: cp/class.c:3268
  #, gcc-internal-format
  msgid "the ellipsis in %qD is not inherited"
  msgstr ""
  
! #: cp/class.c:3443
  #, gcc-internal-format
  msgid "bit-field %q+#D with non-integral type"
  msgstr ""
  
! #: cp/class.c:3459
  #, gcc-internal-format
  msgid "bit-field %q+D width not an integer constant"
  msgstr ""
  
! #: cp/class.c:3464
  #, gcc-internal-format
  msgid "negative width in bit-field %q+D"
  msgstr ""
  
! #: cp/class.c:3469
  #, gcc-internal-format
  msgid "zero width for bit-field %q+D"
  msgstr ""
  
! #: cp/class.c:3478
  #, gcc-internal-format
  msgid "width of %q+D exceeds its type"
  msgstr ""
  
! #: cp/class.c:3482
  #, gcc-internal-format
  msgid "%q+D is too small to hold all values of %q#T"
  msgstr ""
  
! #: cp/class.c:3541
  #, gcc-internal-format
  msgid "member %q+#D with constructor not allowed in union"
  msgstr ""
  
! #: cp/class.c:3544
  #, gcc-internal-format
  msgid "member %q+#D with destructor not allowed in union"
  msgstr ""
  
! #: cp/class.c:3546
  #, gcc-internal-format
  msgid "member %q+#D with copy assignment operator not allowed in union"
  msgstr ""
  
! #: cp/class.c:3550
  #, gcc-internal-format
  msgid "unrestricted unions only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/class.c:3587
  #, gcc-internal-format
  msgid "multiple fields in union %qT initialized"
  msgstr ""
  
! #: cp/class.c:3675
  #, gcc-internal-format
  msgid "in C++98 %q+D may not be static because it is a member of a union"
  msgstr ""
  
! #: cp/class.c:3681
  #, gcc-internal-format
  msgid ""
  "in C++98 %q+D may not have reference type %qT because it is a member of a "
  "union"
  msgstr ""
  
! #: cp/class.c:3691
  #, gcc-internal-format
  msgid "field %q+D invalidly declared function type"
  msgstr ""
  
! #: cp/class.c:3697
  #, gcc-internal-format
  msgid "field %q+D invalidly declared method type"
  msgstr ""
  
! #: cp/class.c:3757
  #, gcc-internal-format
  msgid "ignoring packed attribute because of unpacked non-POD field %q+#D"
  msgstr ""
  
! #: cp/class.c:3805
  #, gcc-internal-format
  msgid "member %q+D cannot be declared both %<const%> and %<mutable%>"
  msgstr ""
  
! #: cp/class.c:3811
  #, gcc-internal-format
  msgid "member %q+D cannot be declared as a %<mutable%> reference"
  msgstr ""
  
! #: cp/class.c:3872
  #, gcc-internal-format
  msgid "field %q+#D with same name as class"
  msgstr ""
  
! #: cp/class.c:3895
  #, gcc-internal-format
  msgid "%q#T has pointer data members"
  msgstr ""
  
! #: cp/class.c:3900
  #, gcc-internal-format
  msgid "  but does not override %<%T(const %T&)%>"
  msgstr ""
  
! #: cp/class.c:3902
  #, gcc-internal-format
  msgid "  or %<operator=(const %T&)%>"
  msgstr ""
  
! #: cp/class.c:3906
  #, gcc-internal-format
  msgid "  but does not override %<operator=(const %T&)%>"
  msgstr ""
  
! #: cp/class.c:4309
  #, gcc-internal-format
  msgid "alignment of %qD increased in -fabi-version=9 (GCC 5.2)"
  msgstr ""
  
! #: cp/class.c:4312
  #, gcc-internal-format
  msgid "alignment of %qD will increase in -fabi-version=9"
  msgstr ""
  
! #: cp/class.c:4566
  #, gcc-internal-format
  msgid "initializer specified for non-virtual method %q+D"
  msgstr ""
  
! #: cp/class.c:4987
  #, gcc-internal-format
  msgid "method overrides both %<transaction_pure%> and %qE methods"
  msgstr ""
  
! #: cp/class.c:5008
  #, gcc-internal-format
  msgid "method declared %qE overriding %qE method"
  msgstr ""
  
! #: cp/class.c:5560 cp/constexpr.c:228
  #, gcc-internal-format
  msgid ""
  "enclosing class of constexpr non-static member function %q+#D is not a "
  "literal type"
  msgstr ""
  
! #: cp/class.c:5585
  #, gcc-internal-format
  msgid "%q+T is not literal because:"
  msgstr ""
  
! #: cp/class.c:5587
  #, gcc-internal-format
  msgid "  %q+T has a non-trivial destructor"
  msgstr ""
  
! #: cp/class.c:5592
  #, gcc-internal-format
  msgid ""
  "  %q+T is not an aggregate, does not have a trivial default constructor, and "
  "has no constexpr constructor that is not a copy or move constructor"
  msgstr ""
  
! #: cp/class.c:5627
  #, gcc-internal-format
  msgid "  base class %qT of %q+T is non-literal"
  msgstr ""
  
! #: cp/class.c:5641
  #, gcc-internal-format
  msgid "  non-static data member %q+D has non-literal type"
  msgstr ""
  
! #: cp/class.c:5647
  #, gcc-internal-format
  msgid "  non-static data member %q+D has volatile type"
  msgstr ""
  
! #: cp/class.c:5765
  #, gcc-internal-format
  msgid "base class %q#T has accessible non-virtual destructor"
  msgstr ""
  
! #: cp/class.c:5793
  #, gcc-internal-format
  msgid "non-static reference %q+#D in class without a constructor"
  msgstr ""
  
! #: cp/class.c:5798
  #, gcc-internal-format
  msgid "non-static const member %q+#D in class without a constructor"
  msgstr ""
  
  #. If the function is defaulted outside the class, we just
  #. give the synthesis error.
! #: cp/class.c:5824
  #, gcc-internal-format
  msgid ""
  "%q+D declared to take const reference, but implicit declaration would take "
  "non-const"
  msgstr ""
  
! #: cp/class.c:6101
  #, gcc-internal-format
  msgid "direct base %qT inaccessible in %qT due to ambiguity"
  msgstr ""
  
! #: cp/class.c:6113
  #, gcc-internal-format
  msgid "virtual base %qT inaccessible in %qT due to ambiguity"
  msgstr ""
  
! #: cp/class.c:6340
  #, gcc-internal-format
  msgid ""
  "offset of %q+D is not ABI-compliant and may change in a future version of GCC"
  msgstr ""
  
! #: cp/class.c:6582 cp/decl.c:12570 cp/parser.c:20507
  #, gcc-internal-format
  msgid "redefinition of %q#T"
  msgstr ""
  
! #: cp/class.c:6721
  #, gcc-internal-format
  msgid "%q#T has virtual functions and accessible non-virtual destructor"
  msgstr ""
  
! #: cp/class.c:6749
  #, gcc-internal-format
  msgid "type transparent %q#T does not have any fields"
  msgstr ""
  
! #: cp/class.c:6755
  #, gcc-internal-format
  msgid "type transparent class %qT has base classes"
  msgstr ""
  
! #: cp/class.c:6759
  #, gcc-internal-format
  msgid "type transparent class %qT has virtual functions"
  msgstr ""
  
! #: cp/class.c:6765
  #, gcc-internal-format
  msgid ""
  "type transparent %q#T cannot be made transparent because the type of the "
  "first field has a different ABI from the class overall"
  msgstr ""
  
! #: cp/class.c:6929
  #, gcc-internal-format
  msgid ""
  "definition of std::initializer_list does not match #include "
  "<initializer_list>"
  msgstr ""
  
! #: cp/class.c:6940
  #, gcc-internal-format
  msgid "trying to finish struct, but kicked out due to previous parse errors"
  msgstr ""
  
! #: cp/class.c:7474
  #, gcc-internal-format
  msgid "language string %<\"%E\"%> not recognized"
  msgstr ""
  
! #: cp/class.c:7564
  #, gcc-internal-format
  msgid "cannot resolve overloaded function %qD based on conversion to type %qT"
  msgstr ""
  
! #: cp/class.c:7701
  #, gcc-internal-format
  msgid "no matches converting function %qD to type %q#T"
  msgstr ""
  
! #: cp/class.c:7729
  #, gcc-internal-format
  msgid "converting overloaded function %qD to type %q#T is ambiguous"
  msgstr ""
  
! #: cp/class.c:7756
  #, gcc-internal-format
  msgid "assuming pointer to member %qD"
  msgstr ""
  
! #: cp/class.c:7759
  #, gcc-internal-format
  msgid "(a pointer to member can only be formed with %<&%E%>)"
  msgstr ""
  
! #: cp/class.c:7834 cp/class.c:7869
  #, gcc-internal-format
  msgid "not enough type information"
  msgstr ""
  
! #: cp/class.c:7852 cp/cvt.c:183 cp/cvt.c:210 cp/cvt.c:259
  #, gcc-internal-format
  msgid "cannot convert %qE from type %qT to type %qT"
  msgstr ""
*************** msgstr ""
*** 34132,34143 ****
  #. A name N used in a class S shall refer to the same declaration
  #. in its context and when re-evaluated in the completed scope of
  #. S.
! #: cp/class.c:8121
  #, gcc-internal-format
  msgid "declaration of %q#D"
  msgstr ""
  
! #: cp/class.c:8122
  #, gcc-internal-format
  msgid "changes meaning of %qD from %q+#D"
  msgstr ""
--- 34315,34326 ----
  #. A name N used in a class S shall refer to the same declaration
  #. in its context and when re-evaluated in the completed scope of
  #. S.
! #: cp/class.c:8130
  #, gcc-internal-format
  msgid "declaration of %q#D"
  msgstr ""
  
! #: cp/class.c:8131
  #, gcc-internal-format
  msgid "changes meaning of %qD from %q+#D"
  msgstr ""
*************** msgstr ""
*** 34177,34446 ****
  msgid "constexpr constructor does not have empty body"
  msgstr ""
  
! #: cp/constexpr.c:584
  #, gcc-internal-format
  msgid "body of %<constexpr%> constructor cannot be a function-try-block"
  msgstr ""
  
! #: cp/constexpr.c:715
  #, gcc-internal-format
  msgid ""
  "%<constexpr%> constructor for union %qT must initialize exactly one non-"
  "static data member"
  msgstr ""
  
! #: cp/constexpr.c:755
  #, gcc-internal-format
  msgid ""
  "member %qD must be initialized by mem-initializer in %<constexpr%> "
  "constructor"
  msgstr ""
  
! #: cp/constexpr.c:787
  #, gcc-internal-format
  msgid "body of constexpr function %qD not a return-statement"
  msgstr ""
  
! #: cp/constexpr.c:840
  #, gcc-internal-format
  msgid "%q+D is not usable as a constexpr function because:"
  msgstr ""
  
! #: cp/constexpr.c:1199 cp/constexpr.c:3987
  #, gcc-internal-format
  msgid "call to internal function"
  msgstr ""
  
! #: cp/constexpr.c:1217
  #, gcc-internal-format
  msgid "expression %qE does not designate a constexpr function"
  msgstr ""
  
! #: cp/constexpr.c:1235 cp/constexpr.c:4004
  #, gcc-internal-format
  msgid "call to non-constexpr function %qD"
  msgstr ""
  
  #. The definition of fun was somehow unsuitable.
! #: cp/constexpr.c:1279
  #, gcc-internal-format
  msgid "%qD called in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:1283
  #, gcc-internal-format
  msgid "%qD used before its definition"
  msgstr ""
  
! #: cp/constexpr.c:1336
  #, gcc-internal-format
  msgid "call has circular dependency"
  msgstr ""
  
! #: cp/constexpr.c:1347
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "constexpr evaluation depth exceeds maximum of %d (use -fconstexpr-depth= to "
  "increase the maximum)"
  msgstr ""
  
! #: cp/constexpr.c:1434
  #, gcc-internal-format
  msgid "constexpr call flows off the end of the function"
  msgstr ""
  
! #: cp/constexpr.c:1521
  #, gcc-internal-format
  msgid "%q+E is not a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:1561
  #, gcc-internal-format
  msgid "right operand of shift expression %q+E is negative"
  msgstr ""
  
! #: cp/constexpr.c:1568
  #, gcc-internal-format
  msgid ""
  "right operand of shift expression %q+E is >= than the precision of the left "
  "operand"
  msgstr ""
  
! #: cp/constexpr.c:1585
  #, gcc-internal-format
  msgid "left operand of shift expression %q+E is negative"
  msgstr ""
  
! #: cp/constexpr.c:1604
  #, gcc-internal-format
  msgid "shift expression %q+E overflows"
  msgstr ""
  
! #: cp/constexpr.c:1766
  #, gcc-internal-format
! msgid "array subscript out of bound"
  msgstr ""
  
! #: cp/constexpr.c:1773
  #, gcc-internal-format
! msgid "negative array subscript"
  msgstr ""
  
! #: cp/constexpr.c:1819 cp/constexpr.c:1898 cp/constexpr.c:3120
  #, gcc-internal-format
  msgid "%qE is not a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:1825
  #, gcc-internal-format
  msgid "mutable %qD is not usable in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:1846
  #, gcc-internal-format
  msgid ""
  "accessing %qD member instead of initialized %qD member in constant expression"
  msgstr ""
  
! #: cp/constexpr.c:1858
  #, gcc-internal-format
  msgid "accessing uninitialized member %qD"
  msgstr ""
  
! #: cp/constexpr.c:2513
  #, gcc-internal-format
  msgid "accessing value of %qE through a %qT glvalue in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:2550
  #, gcc-internal-format
  msgid "the value of %qD is not usable in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:2557
  #, gcc-internal-format
  msgid "%qD used in its own initializer"
  msgstr ""
  
! #: cp/constexpr.c:2562
  #, gcc-internal-format
  msgid "%q#D is not const"
  msgstr ""
  
! #: cp/constexpr.c:2565
  #, gcc-internal-format
  msgid "%q#D is volatile"
  msgstr ""
  
! #: cp/constexpr.c:2569
  #, gcc-internal-format
  msgid "%qD was not initialized with a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:2578
  #, gcc-internal-format
  msgid "%qD was not declared %<constexpr%>"
  msgstr ""
  
! #: cp/constexpr.c:2581
  #, gcc-internal-format
  msgid "%qD does not have integral or enumeration type"
  msgstr ""
  
! #: cp/constexpr.c:2686
  #, gcc-internal-format
  msgid "modification of %qE is not a constant-expression"
  msgstr ""
  
! #: cp/constexpr.c:3164 cp/constexpr.c:4379
  #, gcc-internal-format
  msgid "temporary of non-literal type %qT in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:3486 cp/constexpr.c:4094
  #, gcc-internal-format
  msgid "reinterpret_cast from integer to pointer"
  msgstr ""
  
! #: cp/constexpr.c:3543 cp/constexpr.c:4251 cp/constexpr.c:4544
  #, gcc-internal-format
  msgid "expression %qE is not a constant-expression"
  msgstr ""
  
! #: cp/constexpr.c:3594
  #, gcc-internal-format
  msgid "statement is not a constant-expression"
  msgstr ""
  
! #: cp/constexpr.c:3597
  #, gcc-internal-format
  msgid "unexpected expression %qE of kind %s"
  msgstr ""
  
! #: cp/constexpr.c:3664
  #, gcc-internal-format
  msgid ""
  "%qE is not a constant expression because it refers to mutable subobjects of "
  "%qT"
  msgstr ""
  
! #: cp/constexpr.c:3677
  #, gcc-internal-format
  msgid ""
  "conversion from pointer type %qT to arithmetic type %qT in a constant-"
  "expression"
  msgstr ""
  
! #: cp/constexpr.c:3925
  #, gcc-internal-format
  msgid "expression %qE has side-effects"
  msgstr ""
  
! #: cp/constexpr.c:4120
  #, gcc-internal-format
  msgid ""
  "address-of an object %qE with thread local or automatic storage is not a "
  "constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4150
  #, gcc-internal-format
  msgid "use of %<this%> in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4263
  #, gcc-internal-format
  msgid ""
  "typeid-expression is not a constant expression because %qE is of polymorphic "
  "type"
  msgstr ""
  
! #: cp/constexpr.c:4276
  #, gcc-internal-format
  msgid "difference of two pointer expressions is not a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4295
  #, gcc-internal-format
  msgid "pointer comparison expression is not a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4342
  #, gcc-internal-format
  msgid "cast to non-integral type %qT in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4427
  #, gcc-internal-format
  msgid "division by zero is not a constant-expression"
  msgstr ""
  
! #: cp/constexpr.c:4552
  #, gcc-internal-format
  msgid "non-constant array initialization"
  msgstr ""
  
! #: cp/constexpr.c:4566
  #, gcc-internal-format, gfc-internal-format
  msgid "unexpected AST of kind %s"
  msgstr ""
--- 34360,34629 ----
  msgid "constexpr constructor does not have empty body"
  msgstr ""
  
! #: cp/constexpr.c:587
  #, gcc-internal-format
  msgid "body of %<constexpr%> constructor cannot be a function-try-block"
  msgstr ""
  
! #: cp/constexpr.c:718
  #, gcc-internal-format
  msgid ""
  "%<constexpr%> constructor for union %qT must initialize exactly one non-"
  "static data member"
  msgstr ""
  
! #: cp/constexpr.c:758
  #, gcc-internal-format
  msgid ""
  "member %qD must be initialized by mem-initializer in %<constexpr%> "
  "constructor"
  msgstr ""
  
! #: cp/constexpr.c:790
  #, gcc-internal-format
  msgid "body of constexpr function %qD not a return-statement"
  msgstr ""
  
! #: cp/constexpr.c:843
  #, gcc-internal-format
  msgid "%q+D is not usable as a constexpr function because:"
  msgstr ""
  
! #: cp/constexpr.c:1205 cp/constexpr.c:4241
  #, gcc-internal-format
  msgid "call to internal function"
  msgstr ""
  
! #: cp/constexpr.c:1223
  #, gcc-internal-format
  msgid "expression %qE does not designate a constexpr function"
  msgstr ""
  
! #: cp/constexpr.c:1241 cp/constexpr.c:4258
  #, gcc-internal-format
  msgid "call to non-constexpr function %qD"
  msgstr ""
  
  #. The definition of fun was somehow unsuitable.
! #: cp/constexpr.c:1270
  #, gcc-internal-format
  msgid "%qD called in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:1274
  #, gcc-internal-format
  msgid "%qD used before its definition"
  msgstr ""
  
! #: cp/constexpr.c:1327
  #, gcc-internal-format
  msgid "call has circular dependency"
  msgstr ""
  
! #: cp/constexpr.c:1338
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "constexpr evaluation depth exceeds maximum of %d (use -fconstexpr-depth= to "
  "increase the maximum)"
  msgstr ""
  
! #: cp/constexpr.c:1427
  #, gcc-internal-format
  msgid "constexpr call flows off the end of the function"
  msgstr ""
  
! #: cp/constexpr.c:1514
  #, gcc-internal-format
  msgid "%q+E is not a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:1554
  #, gcc-internal-format
  msgid "right operand of shift expression %q+E is negative"
  msgstr ""
  
! #: cp/constexpr.c:1561
  #, gcc-internal-format
  msgid ""
  "right operand of shift expression %q+E is >= than the precision of the left "
  "operand"
  msgstr ""
  
! #: cp/constexpr.c:1578
  #, gcc-internal-format
  msgid "left operand of shift expression %q+E is negative"
  msgstr ""
  
! #: cp/constexpr.c:1597
  #, gcc-internal-format
  msgid "shift expression %q+E overflows"
  msgstr ""
  
! #: cp/constexpr.c:1901
  #, gcc-internal-format
! msgid "negative array subscript"
  msgstr ""
  
! #: cp/constexpr.c:1930
  #, gcc-internal-format
! msgid "array subscript out of bound"
  msgstr ""
  
! #: cp/constexpr.c:1968 cp/constexpr.c:2052 cp/constexpr.c:3364
  #, gcc-internal-format
  msgid "%qE is not a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:1974
  #, gcc-internal-format
  msgid "mutable %qD is not usable in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:1995
  #, gcc-internal-format
  msgid ""
  "accessing %qD member instead of initialized %qD member in constant expression"
  msgstr ""
  
! #: cp/constexpr.c:2012
  #, gcc-internal-format
  msgid "accessing uninitialized member %qD"
  msgstr ""
  
! #: cp/constexpr.c:2669
  #, gcc-internal-format
  msgid "accessing value of %qE through a %qT glvalue in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:2706
  #, gcc-internal-format
  msgid "the value of %qD is not usable in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:2713
  #, gcc-internal-format
  msgid "%qD used in its own initializer"
  msgstr ""
  
! #: cp/constexpr.c:2718
  #, gcc-internal-format
  msgid "%q#D is not const"
  msgstr ""
  
! #: cp/constexpr.c:2721
  #, gcc-internal-format
  msgid "%q#D is volatile"
  msgstr ""
  
! #: cp/constexpr.c:2725
  #, gcc-internal-format
  msgid "%qD was not initialized with a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:2734
  #, gcc-internal-format
  msgid "%qD was not declared %<constexpr%>"
  msgstr ""
  
! #: cp/constexpr.c:2737
  #, gcc-internal-format
  msgid "%qD does not have integral or enumeration type"
  msgstr ""
  
! #: cp/constexpr.c:2842
  #, gcc-internal-format
  msgid "modification of %qE is not a constant-expression"
  msgstr ""
  
! #: cp/constexpr.c:3410 cp/constexpr.c:4633
  #, gcc-internal-format
  msgid "temporary of non-literal type %qT in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:3735 cp/constexpr.c:4348
  #, gcc-internal-format
  msgid "reinterpret_cast from integer to pointer"
  msgstr ""
  
! #: cp/constexpr.c:3792 cp/constexpr.c:4505 cp/constexpr.c:4798
  #, gcc-internal-format
  msgid "expression %qE is not a constant-expression"
  msgstr ""
  
! #: cp/constexpr.c:3843
  #, gcc-internal-format
  msgid "statement is not a constant-expression"
  msgstr ""
  
! #: cp/constexpr.c:3846
  #, gcc-internal-format
  msgid "unexpected expression %qE of kind %s"
  msgstr ""
  
! #: cp/constexpr.c:3916
  #, gcc-internal-format
  msgid ""
  "%qE is not a constant expression because it refers to mutable subobjects of "
  "%qT"
  msgstr ""
  
! #: cp/constexpr.c:3929
  #, gcc-internal-format
  msgid ""
  "conversion from pointer type %qT to arithmetic type %qT in a constant-"
  "expression"
  msgstr ""
  
! #: cp/constexpr.c:4179
  #, gcc-internal-format
  msgid "expression %qE has side-effects"
  msgstr ""
  
! #: cp/constexpr.c:4374
  #, gcc-internal-format
  msgid ""
  "address-of an object %qE with thread local or automatic storage is not a "
  "constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4404
  #, gcc-internal-format
  msgid "use of %<this%> in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4517
  #, gcc-internal-format
  msgid ""
  "typeid-expression is not a constant expression because %qE is of polymorphic "
  "type"
  msgstr ""
  
! #: cp/constexpr.c:4530
  #, gcc-internal-format
  msgid "difference of two pointer expressions is not a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4549
  #, gcc-internal-format
  msgid "pointer comparison expression is not a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4596
  #, gcc-internal-format
  msgid "cast to non-integral type %qT in a constant expression"
  msgstr ""
  
! #: cp/constexpr.c:4681
  #, gcc-internal-format
  msgid "division by zero is not a constant-expression"
  msgstr ""
  
! #: cp/constexpr.c:4806
  #, gcc-internal-format
  msgid "non-constant array initialization"
  msgstr ""
  
! #: cp/constexpr.c:4820
  #, gcc-internal-format, gfc-internal-format
  msgid "unexpected AST of kind %s"
  msgstr ""
*************** msgstr ""
*** 34555,34561 ****
  msgid "conversion from %qT to %qT discards qualifiers"
  msgstr ""
  
! #: cp/cvt.c:501 cp/typeck.c:6814
  #, gcc-internal-format
  msgid "casting %qT to %qT does not dereference pointer"
  msgstr ""
--- 34738,34744 ----
  msgid "conversion from %qT to %qT discards qualifiers"
  msgstr ""
  
! #: cp/cvt.c:501 cp/typeck.c:6833
  #, gcc-internal-format
  msgid "casting %qT to %qT does not dereference pointer"
  msgstr ""
*************** msgstr ""
*** 34565,34913 ****
  msgid "cannot convert type %qT to type %qT"
  msgstr ""
  
! #: cp/cvt.c:761
  #, gcc-internal-format
  msgid "conversion from %q#T to %q#T"
  msgstr ""
  
! #: cp/cvt.c:778
  #, gcc-internal-format
  msgid ""
  "the result of the conversion is unspecified because %qE is outside the range "
  "of type %qT"
  msgstr ""
  
! #: cp/cvt.c:789 cp/cvt.c:833
  #, gcc-internal-format
  msgid "%q#T used where a %qT was expected"
  msgstr ""
  
! #: cp/cvt.c:798
  #, gcc-internal-format
  msgid "could not convert %qE from %<void%> to %<bool%>"
  msgstr ""
  
! #: cp/cvt.c:849
  #, gcc-internal-format
  msgid "%q#T used where a floating point value was expected"
  msgstr ""
  
! #: cp/cvt.c:908
  #, gcc-internal-format
  msgid "conversion from %qT to non-scalar type %qT requested"
  msgstr ""
  
! #: cp/cvt.c:968
  #, gcc-internal-format
  msgid "pseudo-destructor is not called"
  msgstr ""
  
! #: cp/cvt.c:1045
  #, gcc-internal-format
  msgid "conversion to void will not access object of incomplete type %qT"
  msgstr ""
  
! #: cp/cvt.c:1049
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in second operand "
  "of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1054
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in third operand "
  "of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1059
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in right operand "
  "of comma operator"
  msgstr ""
  
! #: cp/cvt.c:1064
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in left operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1069
  #, gcc-internal-format
  msgid "indirection will not access object of incomplete type %qT in statement"
  msgstr ""
  
! #: cp/cvt.c:1073
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in for increment "
  "expression"
  msgstr ""
  
! #: cp/cvt.c:1089
  #, gcc-internal-format
  msgid "conversion to void will not access object of type %qT"
  msgstr ""
  
! #: cp/cvt.c:1093
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in second operand of "
  "conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1098
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in third operand of "
  "conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1103
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in right operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1108
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in left operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1113
  #, gcc-internal-format
  msgid "implicit dereference will not access object of type %qT in statement"
  msgstr ""
  
! #: cp/cvt.c:1117
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in for increment "
  "expression"
  msgstr ""
  
! #: cp/cvt.c:1131
  #, gcc-internal-format
  msgid ""
  "conversion to void will not access object of non-trivially-copyable type %qT"
  msgstr ""
  
! #: cp/cvt.c:1136
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "second operand of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1141
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "third operand of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1146
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "right operand of comma operator"
  msgstr ""
  
! #: cp/cvt.c:1151
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "left operand of comma operator"
  msgstr ""
  
! #: cp/cvt.c:1156
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "statement"
  msgstr ""
  
! #: cp/cvt.c:1161
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in for "
  "increment expression"
  msgstr ""
  
! #: cp/cvt.c:1199
  #, gcc-internal-format
  msgid "conversion to void will not access object %qE of incomplete type %qT"
  msgstr ""
  
! #: cp/cvt.c:1203
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in second operand "
  "of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1208
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in third operand of "
  "conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1213
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in right operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1218
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in left operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1223
  #, gcc-internal-format
  msgid "variable %qE of incomplete type %qT will not be accessed in statement"
  msgstr ""
  
! #: cp/cvt.c:1227
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in for increment "
  "expression"
  msgstr ""
  
! #: cp/cvt.c:1276
  #, gcc-internal-format
  msgid "conversion to void cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1280
  #, gcc-internal-format
  msgid ""
  "second operand of conditional expression cannot resolve address of "
  "overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1284
  #, gcc-internal-format
  msgid ""
  "third operand of conditional expression cannot resolve address of overloaded "
  "function"
  msgstr ""
  
! #: cp/cvt.c:1288
  #, gcc-internal-format
  msgid ""
  "right operand of comma operator cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1292
  #, gcc-internal-format
  msgid ""
  "left operand of comma operator cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1296
  #, gcc-internal-format
  msgid "statement cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1300
  #, gcc-internal-format
  msgid "for increment expression cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1316
  #, gcc-internal-format
  msgid ""
  "second operand of conditional expression is a reference, not call, to "
  "function %qE"
  msgstr ""
  
! #: cp/cvt.c:1321
  #, gcc-internal-format
  msgid ""
  "third operand of conditional expression is a reference, not call, to "
  "function %qE"
  msgstr ""
  
! #: cp/cvt.c:1326
  #, gcc-internal-format
  msgid ""
  "right operand of comma operator is a reference, not call, to function %qE"
  msgstr ""
  
! #: cp/cvt.c:1331
  #, gcc-internal-format
  msgid ""
  "left operand of comma operator is a reference, not call, to function %qE"
  msgstr ""
  
! #: cp/cvt.c:1336
  #, gcc-internal-format
  msgid "statement is a reference, not call, to function %qE"
  msgstr ""
  
! #: cp/cvt.c:1341
  #, gcc-internal-format
  msgid "for increment expression is a reference, not call, to function %qE"
  msgstr ""
  
! #: cp/cvt.c:1368
  #, gcc-internal-format
  msgid "second operand of conditional expression has no effect"
  msgstr ""
  
! #: cp/cvt.c:1373
  #, gcc-internal-format
  msgid "third operand of conditional expression has no effect"
  msgstr ""
  
! #: cp/cvt.c:1378
  #, gcc-internal-format
  msgid "right operand of comma operator has no effect"
  msgstr ""
  
! #: cp/cvt.c:1382
  #, gcc-internal-format
  msgid "left operand of comma operator has no effect"
  msgstr ""
  
! #: cp/cvt.c:1386
  #, gcc-internal-format
  msgid "statement has no effect"
  msgstr ""
  
! #: cp/cvt.c:1390
  #, gcc-internal-format
  msgid "for increment expression has no effect"
  msgstr ""
  
! #: cp/cvt.c:1547
  #, gcc-internal-format
  msgid "converting NULL to non-pointer type"
  msgstr ""
  
! #: cp/cvt.c:1662
  #, gcc-internal-format
  msgid "default type conversion can't deduce template argument for %qD"
  msgstr ""
  
! #: cp/cvt.c:1677
  #, gcc-internal-format
  msgid "ambiguous default type conversion from %qT"
  msgstr ""
  
! #: cp/cvt.c:1680
  #, gcc-internal-format
  msgid "  candidate conversions include %qD and %qD"
  msgstr ""
--- 34748,35096 ----
  msgid "cannot convert type %qT to type %qT"
  msgstr ""
  
! #: cp/cvt.c:762
  #, gcc-internal-format
  msgid "conversion from %q#T to %q#T"
  msgstr ""
  
! #: cp/cvt.c:779
  #, gcc-internal-format
  msgid ""
  "the result of the conversion is unspecified because %qE is outside the range "
  "of type %qT"
  msgstr ""
  
! #: cp/cvt.c:790 cp/cvt.c:834
  #, gcc-internal-format
  msgid "%q#T used where a %qT was expected"
  msgstr ""
  
! #: cp/cvt.c:799
  #, gcc-internal-format
  msgid "could not convert %qE from %<void%> to %<bool%>"
  msgstr ""
  
! #: cp/cvt.c:850
  #, gcc-internal-format
  msgid "%q#T used where a floating point value was expected"
  msgstr ""
  
! #: cp/cvt.c:909
  #, gcc-internal-format
  msgid "conversion from %qT to non-scalar type %qT requested"
  msgstr ""
  
! #: cp/cvt.c:969
  #, gcc-internal-format
  msgid "pseudo-destructor is not called"
  msgstr ""
  
! #: cp/cvt.c:1046
  #, gcc-internal-format
  msgid "conversion to void will not access object of incomplete type %qT"
  msgstr ""
  
! #: cp/cvt.c:1050
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in second operand "
  "of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1055
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in third operand "
  "of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1060
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in right operand "
  "of comma operator"
  msgstr ""
  
! #: cp/cvt.c:1065
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in left operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1070
  #, gcc-internal-format
  msgid "indirection will not access object of incomplete type %qT in statement"
  msgstr ""
  
! #: cp/cvt.c:1074
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of incomplete type %qT in for increment "
  "expression"
  msgstr ""
  
! #: cp/cvt.c:1090
  #, gcc-internal-format
  msgid "conversion to void will not access object of type %qT"
  msgstr ""
  
! #: cp/cvt.c:1094
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in second operand of "
  "conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1099
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in third operand of "
  "conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1104
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in right operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1109
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in left operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1114
  #, gcc-internal-format
  msgid "implicit dereference will not access object of type %qT in statement"
  msgstr ""
  
! #: cp/cvt.c:1118
  #, gcc-internal-format
  msgid ""
  "implicit dereference will not access object of type %qT in for increment "
  "expression"
  msgstr ""
  
! #: cp/cvt.c:1132
  #, gcc-internal-format
  msgid ""
  "conversion to void will not access object of non-trivially-copyable type %qT"
  msgstr ""
  
! #: cp/cvt.c:1137
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "second operand of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1142
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "third operand of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1147
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "right operand of comma operator"
  msgstr ""
  
! #: cp/cvt.c:1152
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "left operand of comma operator"
  msgstr ""
  
! #: cp/cvt.c:1157
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in "
  "statement"
  msgstr ""
  
! #: cp/cvt.c:1162
  #, gcc-internal-format
  msgid ""
  "indirection will not access object of non-trivially-copyable type %qT in for "
  "increment expression"
  msgstr ""
  
! #: cp/cvt.c:1200
  #, gcc-internal-format
  msgid "conversion to void will not access object %qE of incomplete type %qT"
  msgstr ""
  
! #: cp/cvt.c:1204
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in second operand "
  "of conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1209
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in third operand of "
  "conditional expression"
  msgstr ""
  
! #: cp/cvt.c:1214
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in right operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1219
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in left operand of "
  "comma operator"
  msgstr ""
  
! #: cp/cvt.c:1224
  #, gcc-internal-format
  msgid "variable %qE of incomplete type %qT will not be accessed in statement"
  msgstr ""
  
! #: cp/cvt.c:1228
  #, gcc-internal-format
  msgid ""
  "variable %qE of incomplete type %qT will not be accessed in for increment "
  "expression"
  msgstr ""
  
! #: cp/cvt.c:1277
  #, gcc-internal-format
  msgid "conversion to void cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1281
  #, gcc-internal-format
  msgid ""
  "second operand of conditional expression cannot resolve address of "
  "overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1285
  #, gcc-internal-format
  msgid ""
  "third operand of conditional expression cannot resolve address of overloaded "
  "function"
  msgstr ""
  
! #: cp/cvt.c:1289
  #, gcc-internal-format
  msgid ""
  "right operand of comma operator cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1293
  #, gcc-internal-format
  msgid ""
  "left operand of comma operator cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1297
  #, gcc-internal-format
  msgid "statement cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1301
  #, gcc-internal-format
  msgid "for increment expression cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/cvt.c:1317
  #, gcc-internal-format
  msgid ""
  "second operand of conditional expression is a reference, not call, to "
  "function %qE"
  msgstr ""
  
! #: cp/cvt.c:1322
  #, gcc-internal-format
  msgid ""
  "third operand of conditional expression is a reference, not call, to "
  "function %qE"
  msgstr ""
  
! #: cp/cvt.c:1327
  #, gcc-internal-format
  msgid ""
  "right operand of comma operator is a reference, not call, to function %qE"
  msgstr ""
  
! #: cp/cvt.c:1332
  #, gcc-internal-format
  msgid ""
  "left operand of comma operator is a reference, not call, to function %qE"
  msgstr ""
  
! #: cp/cvt.c:1337
  #, gcc-internal-format
  msgid "statement is a reference, not call, to function %qE"
  msgstr ""
  
! #: cp/cvt.c:1342
  #, gcc-internal-format
  msgid "for increment expression is a reference, not call, to function %qE"
  msgstr ""
  
! #: cp/cvt.c:1369
  #, gcc-internal-format
  msgid "second operand of conditional expression has no effect"
  msgstr ""
  
! #: cp/cvt.c:1374
  #, gcc-internal-format
  msgid "third operand of conditional expression has no effect"
  msgstr ""
  
! #: cp/cvt.c:1379
  #, gcc-internal-format
  msgid "right operand of comma operator has no effect"
  msgstr ""
  
! #: cp/cvt.c:1383
  #, gcc-internal-format
  msgid "left operand of comma operator has no effect"
  msgstr ""
  
! #: cp/cvt.c:1387
  #, gcc-internal-format
  msgid "statement has no effect"
  msgstr ""
  
! #: cp/cvt.c:1391
  #, gcc-internal-format
  msgid "for increment expression has no effect"
  msgstr ""
  
! #: cp/cvt.c:1548
  #, gcc-internal-format
  msgid "converting NULL to non-pointer type"
  msgstr ""
  
! #: cp/cvt.c:1663
  #, gcc-internal-format
  msgid "default type conversion can't deduce template argument for %qD"
  msgstr ""
  
! #: cp/cvt.c:1678
  #, gcc-internal-format
  msgid "ambiguous default type conversion from %qT"
  msgstr ""
  
! #: cp/cvt.c:1681
  #, gcc-internal-format
  msgid "  candidate conversions include %qD and %qD"
  msgstr ""
*************** msgstr ""
*** 35130,35136 ****
  msgid "redundant redeclaration of %qD in same scope"
  msgstr ""
  
! #: cp/decl.c:1859 cp/decl.c:1869 cp/decl.c:2371
  #, gcc-internal-format
  msgid "previous declaration of %qD"
  msgstr ""
--- 35313,35319 ----
  msgid "redundant redeclaration of %qD in same scope"
  msgstr ""
  
! #: cp/decl.c:1859 cp/decl.c:1869 cp/decl.c:2403
  #, gcc-internal-format
  msgid "previous declaration of %qD"
  msgstr ""
*************** msgstr ""
*** 35148,35159 ****
  #. that specialization that would cause an implicit
  #. instantiation to take place, in every translation unit in
  #. which such a use occurs.
! #: cp/decl.c:2237
  #, gcc-internal-format
  msgid "explicit specialization of %qD after first use"
  msgstr ""
  
! #: cp/decl.c:2368
  #, gcc-internal-format
  msgid ""
  "%qD: visibility attribute ignored because it conflicts with previous "
--- 35331,35342 ----
  #. that specialization that would cause an implicit
  #. instantiation to take place, in every translation unit in
  #. which such a use occurs.
! #: cp/decl.c:2269
  #, gcc-internal-format
  msgid "explicit specialization of %qD after first use"
  msgstr ""
  
! #: cp/decl.c:2400
  #, gcc-internal-format
  msgid ""
  "%qD: visibility attribute ignored because it conflicts with previous "
*************** msgid ""
*** 35161,35187 ****
  msgstr ""
  
  #. Reject two definitions.
! #: cp/decl.c:2609 cp/decl.c:2638 cp/decl.c:2671 cp/decl.c:2688 cp/decl.c:2761
  #, gcc-internal-format
  msgid "redefinition of %q#D"
  msgstr ""
  
! #: cp/decl.c:2625
  #, gcc-internal-format
  msgid "%qD conflicts with used function"
  msgstr ""
  
! #: cp/decl.c:2635
  #, gcc-internal-format
  msgid "%q#D not declared in class"
  msgstr ""
  
! #: cp/decl.c:2649 cp/decl.c:2698
  #, gcc-internal-format
  msgid "%q+D redeclared inline with %<gnu_inline%> attribute"
  msgstr ""
  
! #: cp/decl.c:2652 cp/decl.c:2701
  #, gcc-internal-format
  msgid "%q+D redeclared inline without %<gnu_inline%> attribute"
  msgstr ""
--- 35344,35370 ----
  msgstr ""
  
  #. Reject two definitions.
! #: cp/decl.c:2641 cp/decl.c:2670 cp/decl.c:2703 cp/decl.c:2720 cp/decl.c:2793
  #, gcc-internal-format
  msgid "redefinition of %q#D"
  msgstr ""
  
! #: cp/decl.c:2657
  #, gcc-internal-format
  msgid "%qD conflicts with used function"
  msgstr ""
  
! #: cp/decl.c:2667
  #, gcc-internal-format
  msgid "%q#D not declared in class"
  msgstr ""
  
! #: cp/decl.c:2681 cp/decl.c:2730
  #, gcc-internal-format
  msgid "%q+D redeclared inline with %<gnu_inline%> attribute"
  msgstr ""
  
! #: cp/decl.c:2684 cp/decl.c:2733
  #, gcc-internal-format
  msgid "%q+D redeclared inline without %<gnu_inline%> attribute"
  msgstr ""
*************** msgstr ""
*** 35189,35560 ****
  #. is_primary=
  #. is_partial=
  #. is_friend_decl=
! #: cp/decl.c:2718
  #, gcc-internal-format
  msgid "redeclaration of friend %q#D may not have default template arguments"
  msgstr ""
  
! #: cp/decl.c:2732
  #, gcc-internal-format
  msgid "thread-local declaration of %q#D follows non-thread-local declaration"
  msgstr ""
  
! #: cp/decl.c:2735
  #, gcc-internal-format
  msgid "non-thread-local declaration of %q#D follows thread-local declaration"
  msgstr ""
  
! #: cp/decl.c:2750 cp/decl.c:2769 cp/name-lookup.c:597 cp/name-lookup.c:1180
  #: cp/name-lookup.c:1203
  #, gcc-internal-format
  msgid "redeclaration of %q#D"
  msgstr ""
  
! #: cp/decl.c:2916
  #, gcc-internal-format
  msgid "jump to label %qD"
  msgstr ""
  
! #: cp/decl.c:2917
  #, gcc-internal-format
  msgid "jump to case label"
  msgstr ""
  
! #: cp/decl.c:2919 cp/decl.c:3073 cp/decl.c:3125
  #, gcc-internal-format
  msgid "  from here"
  msgstr ""
  
! #: cp/decl.c:2941 cp/decl.c:3129
  #, gcc-internal-format
  msgid "  exits OpenMP structured block"
  msgstr ""
  
! #: cp/decl.c:2966
  #, gcc-internal-format
  msgid "  crosses initialization of %q+#D"
  msgstr ""
  
! #: cp/decl.c:2968 cp/decl.c:3093
  #, gcc-internal-format
  msgid "  enters scope of %q+#D which has non-trivial destructor"
  msgstr ""
  
! #: cp/decl.c:2985 cp/decl.c:3101
  #, gcc-internal-format
  msgid "  enters try block"
  msgstr ""
  
! #: cp/decl.c:2987 cp/decl.c:3085 cp/decl.c:3103
  #, gcc-internal-format
  msgid "  enters catch block"
  msgstr ""
  
! #: cp/decl.c:2999 cp/decl.c:3109
  #, gcc-internal-format
  msgid "  enters OpenMP structured block"
  msgstr ""
  
! #: cp/decl.c:3071 cp/decl.c:3123
! #, gcc-internal-format
! msgid "jump to label %q+D"
! msgstr ""
! 
! #: cp/decl.c:3091
  #, gcc-internal-format
  msgid "  skips initialization of %q+#D"
  msgstr ""
  
! #: cp/decl.c:3146 cp/parser.c:11023 cp/parser.c:11050
  #, gcc-internal-format
  msgid "invalid exit from OpenMP structured block"
  msgstr ""
  
! #: cp/decl.c:3178
  #, gcc-internal-format
  msgid "label named wchar_t"
  msgstr ""
  
! #: cp/decl.c:3488
  #, gcc-internal-format
  msgid "%qD is not a type"
  msgstr ""
  
! #: cp/decl.c:3495 cp/parser.c:5503
  #, gcc-internal-format
  msgid "%qD used without template parameters"
  msgstr ""
  
! #: cp/decl.c:3504
  #, gcc-internal-format
  msgid "%q#T is not a class"
  msgstr ""
  
! #: cp/decl.c:3528 cp/decl.c:3620
  #, gcc-internal-format
  msgid "no class template named %q#T in %q#T"
  msgstr ""
  
! #: cp/decl.c:3529
  #, gcc-internal-format
  msgid "no type named %q#T in %q#T"
  msgstr ""
  
! #: cp/decl.c:3541
  #, gcc-internal-format
  msgid "lookup of %qT in %qT is ambiguous"
  msgstr ""
  
! #: cp/decl.c:3550
  #, gcc-internal-format
  msgid "%<typename %T::%D%> names %q#T, which is not a class template"
  msgstr ""
  
! #: cp/decl.c:3557
  #, gcc-internal-format
  msgid "%<typename %T::%D%> names %q#T, which is not a type"
  msgstr ""
  
! #: cp/decl.c:3629
  #, gcc-internal-format
  msgid "template parameters do not match template %qD"
  msgstr ""
  
! #: cp/decl.c:4358
  #, gcc-internal-format
  msgid "an anonymous struct cannot have function members"
  msgstr ""
  
! #: cp/decl.c:4361
  #, gcc-internal-format
  msgid "an anonymous union cannot have function members"
  msgstr ""
  
! #: cp/decl.c:4379
  #, gcc-internal-format
  msgid "member %q+#D with constructor not allowed in anonymous aggregate"
  msgstr ""
  
! #: cp/decl.c:4382
  #, gcc-internal-format
  msgid "member %q+#D with destructor not allowed in anonymous aggregate"
  msgstr ""
  
! #: cp/decl.c:4385
  #, gcc-internal-format
  msgid ""
  "member %q+#D with copy assignment operator not allowed in anonymous aggregate"
  msgstr ""
  
! #: cp/decl.c:4403
  #, gcc-internal-format
  msgid "attribute ignored in declaration of %q#T"
  msgstr ""
  
! #: cp/decl.c:4406
  #, gcc-internal-format
  msgid "attribute for %q#T must follow the %qs keyword"
  msgstr ""
  
! #: cp/decl.c:4429
  #, gcc-internal-format
  msgid "multiple types in one declaration"
  msgstr ""
  
! #: cp/decl.c:4434
  #, gcc-internal-format
  msgid "redeclaration of C++ built-in type %qT"
  msgstr ""
  
! #: cp/decl.c:4451
  #, gcc-internal-format
  msgid "%<auto%> can only be specified for variables or function declarations"
  msgstr ""
  
! #: cp/decl.c:4477
  #, gcc-internal-format
  msgid "missing type-name in typedef-declaration"
  msgstr ""
  
! #: cp/decl.c:4485
  #, gcc-internal-format
  msgid "ISO C++ prohibits anonymous structs"
  msgstr ""
  
! #: cp/decl.c:4492
  #, gcc-internal-format
  msgid "%qs can only be specified for functions"
  msgstr ""
  
! #: cp/decl.c:4498
  #, gcc-internal-format
  msgid "%<friend%> can only be specified inside a class"
  msgstr ""
  
! #: cp/decl.c:4500
  #, gcc-internal-format
  msgid "%<explicit%> can only be specified for constructors"
  msgstr ""
  
! #: cp/decl.c:4502
  #, gcc-internal-format
  msgid "a storage class can only be specified for objects and functions"
  msgstr ""
  
! #: cp/decl.c:4508
  #, gcc-internal-format
  msgid "qualifiers can only be specified for objects and functions"
  msgstr ""
  
! #: cp/decl.c:4511
  #, gcc-internal-format
  msgid "%<typedef%> was ignored in this declaration"
  msgstr ""
  
! #: cp/decl.c:4513
  #, gcc-internal-format
  msgid "%<constexpr%> cannot be used for type declarations"
  msgstr ""
  
! #: cp/decl.c:4535
  #, gcc-internal-format
  msgid "attribute ignored in explicit instantiation %q#T"
  msgstr ""
  
! #: cp/decl.c:4538
  #, gcc-internal-format
  msgid "no attribute can be applied to an explicit instantiation"
  msgstr ""
  
! #: cp/decl.c:4610
  #, gcc-internal-format
  msgid "ignoring attributes applied to class type %qT outside of definition"
  msgstr ""
  
  #. A template type parameter or other dependent type.
! #: cp/decl.c:4614
  #, gcc-internal-format
  msgid ""
  "ignoring attributes applied to dependent type %qT without an associated "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:4683 cp/decl2.c:889
  #, gcc-internal-format
  msgid "typedef %qD is initialized (use decltype instead)"
  msgstr ""
  
! #: cp/decl.c:4691
  #, gcc-internal-format
  msgid "declaration of %q#D has %<extern%> and is initialized"
  msgstr ""
  
! #: cp/decl.c:4720
  #, gcc-internal-format
  msgid "definition of %q#D is marked %<dllimport%>"
  msgstr ""
  
! #: cp/decl.c:4743
  #, gcc-internal-format
  msgid "%q+#D is not a static data member of %q#T"
  msgstr ""
  
! #: cp/decl.c:4752
  #, gcc-internal-format
  msgid "non-member-template declaration of %qD"
  msgstr ""
  
! #: cp/decl.c:4753
  #, gcc-internal-format
  msgid "does not match member template declaration here"
  msgstr ""
  
! #: cp/decl.c:4766
  #, gcc-internal-format
  msgid "ISO C++ does not permit %<%T::%D%> to be defined as %<%T::%D%>"
  msgstr ""
  
! #: cp/decl.c:4778
  #, gcc-internal-format
  msgid "duplicate initialization of %qD"
  msgstr ""
  
! #: cp/decl.c:4783
  #, gcc-internal-format
  msgid "%qD declared %<constexpr%> outside its class"
  msgstr ""
  
! #: cp/decl.c:4826
  #, gcc-internal-format
  msgid "declaration of %q#D outside of class is not definition"
  msgstr ""
  
! #: cp/decl.c:4859
  #, gcc-internal-format
  msgid "%qD declared %<thread_local%> in %<constexpr%> function"
  msgstr ""
  
! #: cp/decl.c:4862
  #, gcc-internal-format
  msgid "%qD declared %<static%> in %<constexpr%> function"
  msgstr ""
  
! #: cp/decl.c:4927
  #, gcc-internal-format
  msgid "variable %q#D has initializer but incomplete type"
  msgstr ""
  
! #: cp/decl.c:4933 cp/decl.c:5796
  #, gcc-internal-format
  msgid "elements of array %q#D have incomplete type"
  msgstr ""
  
! #: cp/decl.c:4940 cp/decl.c:6416
  #, gcc-internal-format
  msgid "declaration of %q#D has no initializer"
  msgstr ""
  
! #: cp/decl.c:4942
  #, gcc-internal-format
  msgid "aggregate %q#D has incomplete type and cannot be defined"
  msgstr ""
  
! #: cp/decl.c:4976
  #, gcc-internal-format
  msgid "%qD declared as reference but not initialized"
  msgstr ""
  
! #: cp/decl.c:5033
  #, gcc-internal-format
  msgid "name used in a GNU-style designated initializer for an array"
  msgstr ""
  
! #: cp/decl.c:5039
  #, gcc-internal-format
  msgid "name %qD used in a GNU-style designated initializer for an array"
  msgstr ""
  
! #: cp/decl.c:5055 cp/typeck2.c:1273 cp/typeck2.c:1384
  #, gcc-internal-format
  msgid "non-trivial designated initializers not supported"
  msgstr ""
  
! #: cp/decl.c:5058
  #, gcc-internal-format
  msgid "C99 designator %qE is not an integral constant-expression"
  msgstr ""
  
! #: cp/decl.c:5106
  #, gcc-internal-format
  msgid "initializer fails to determine size of %qD"
  msgstr ""
  
! #: cp/decl.c:5112
  #, gcc-internal-format
  msgid "array size missing in %qD"
  msgstr ""
  
! #: cp/decl.c:5123
  #, gcc-internal-format
  msgid "zero-size array %qD"
  msgstr ""
--- 35372,35738 ----
  #. is_primary=
  #. is_partial=
  #. is_friend_decl=
! #: cp/decl.c:2750
  #, gcc-internal-format
  msgid "redeclaration of friend %q#D may not have default template arguments"
  msgstr ""
  
! #: cp/decl.c:2764
  #, gcc-internal-format
  msgid "thread-local declaration of %q#D follows non-thread-local declaration"
  msgstr ""
  
! #: cp/decl.c:2767
  #, gcc-internal-format
  msgid "non-thread-local declaration of %q#D follows thread-local declaration"
  msgstr ""
  
! #: cp/decl.c:2782 cp/decl.c:2801 cp/name-lookup.c:597 cp/name-lookup.c:1180
  #: cp/name-lookup.c:1203
  #, gcc-internal-format
  msgid "redeclaration of %q#D"
  msgstr ""
  
! #: cp/decl.c:2950
  #, gcc-internal-format
  msgid "jump to label %qD"
  msgstr ""
  
! #: cp/decl.c:2951
  #, gcc-internal-format
  msgid "jump to case label"
  msgstr ""
  
! #: cp/decl.c:2953
  #, gcc-internal-format
  msgid "  from here"
  msgstr ""
  
! #: cp/decl.c:2976 cp/decl.c:3176
  #, gcc-internal-format
  msgid "  exits OpenMP structured block"
  msgstr ""
  
! #: cp/decl.c:3003
  #, gcc-internal-format
  msgid "  crosses initialization of %q+#D"
  msgstr ""
  
! #: cp/decl.c:3005 cp/decl.c:3141
  #, gcc-internal-format
  msgid "  enters scope of %q+#D which has non-trivial destructor"
  msgstr ""
  
! #: cp/decl.c:3023 cp/decl.c:3149
  #, gcc-internal-format
  msgid "  enters try block"
  msgstr ""
  
! #: cp/decl.c:3025 cp/decl.c:3133 cp/decl.c:3151
  #, gcc-internal-format
  msgid "  enters catch block"
  msgstr ""
  
! #: cp/decl.c:3038 cp/decl.c:3157
  #, gcc-internal-format
  msgid "  enters OpenMP structured block"
  msgstr ""
  
! #: cp/decl.c:3139
  #, gcc-internal-format
  msgid "  skips initialization of %q+#D"
  msgstr ""
  
! #: cp/decl.c:3193 cp/parser.c:11024 cp/parser.c:11051
  #, gcc-internal-format
  msgid "invalid exit from OpenMP structured block"
  msgstr ""
  
! #: cp/decl.c:3225
  #, gcc-internal-format
  msgid "label named wchar_t"
  msgstr ""
  
! #: cp/decl.c:3535
  #, gcc-internal-format
  msgid "%qD is not a type"
  msgstr ""
  
! #: cp/decl.c:3542 cp/parser.c:5504
  #, gcc-internal-format
  msgid "%qD used without template parameters"
  msgstr ""
  
! #: cp/decl.c:3551
  #, gcc-internal-format
  msgid "%q#T is not a class"
  msgstr ""
  
! #: cp/decl.c:3575 cp/decl.c:3667
  #, gcc-internal-format
  msgid "no class template named %q#T in %q#T"
  msgstr ""
  
! #: cp/decl.c:3576
  #, gcc-internal-format
  msgid "no type named %q#T in %q#T"
  msgstr ""
  
! #: cp/decl.c:3588
  #, gcc-internal-format
  msgid "lookup of %qT in %qT is ambiguous"
  msgstr ""
  
! #: cp/decl.c:3597
  #, gcc-internal-format
  msgid "%<typename %T::%D%> names %q#T, which is not a class template"
  msgstr ""
  
! #: cp/decl.c:3604
  #, gcc-internal-format
  msgid "%<typename %T::%D%> names %q#T, which is not a type"
  msgstr ""
  
! #: cp/decl.c:3676
  #, gcc-internal-format
  msgid "template parameters do not match template %qD"
  msgstr ""
  
! #: cp/decl.c:4405
  #, gcc-internal-format
  msgid "an anonymous struct cannot have function members"
  msgstr ""
  
! #: cp/decl.c:4408
  #, gcc-internal-format
  msgid "an anonymous union cannot have function members"
  msgstr ""
  
! #: cp/decl.c:4426
  #, gcc-internal-format
  msgid "member %q+#D with constructor not allowed in anonymous aggregate"
  msgstr ""
  
! #: cp/decl.c:4429
  #, gcc-internal-format
  msgid "member %q+#D with destructor not allowed in anonymous aggregate"
  msgstr ""
  
! #: cp/decl.c:4432
  #, gcc-internal-format
  msgid ""
  "member %q+#D with copy assignment operator not allowed in anonymous aggregate"
  msgstr ""
  
! #: cp/decl.c:4450
  #, gcc-internal-format
  msgid "attribute ignored in declaration of %q#T"
  msgstr ""
  
! #: cp/decl.c:4453
  #, gcc-internal-format
  msgid "attribute for %q#T must follow the %qs keyword"
  msgstr ""
  
! #: cp/decl.c:4476
  #, gcc-internal-format
  msgid "multiple types in one declaration"
  msgstr ""
  
! #: cp/decl.c:4481
  #, gcc-internal-format
  msgid "redeclaration of C++ built-in type %qT"
  msgstr ""
  
! #: cp/decl.c:4498
  #, gcc-internal-format
  msgid "%<auto%> can only be specified for variables or function declarations"
  msgstr ""
  
! #: cp/decl.c:4524
  #, gcc-internal-format
  msgid "missing type-name in typedef-declaration"
  msgstr ""
  
! #: cp/decl.c:4532
  #, gcc-internal-format
  msgid "ISO C++ prohibits anonymous structs"
  msgstr ""
  
! #: cp/decl.c:4539
  #, gcc-internal-format
  msgid "%qs can only be specified for functions"
  msgstr ""
  
! #: cp/decl.c:4545
  #, gcc-internal-format
  msgid "%<friend%> can only be specified inside a class"
  msgstr ""
  
! #: cp/decl.c:4547
  #, gcc-internal-format
  msgid "%<explicit%> can only be specified for constructors"
  msgstr ""
  
! #: cp/decl.c:4549
  #, gcc-internal-format
  msgid "a storage class can only be specified for objects and functions"
  msgstr ""
  
! #: cp/decl.c:4555
  #, gcc-internal-format
  msgid "qualifiers can only be specified for objects and functions"
  msgstr ""
  
! #: cp/decl.c:4558
  #, gcc-internal-format
  msgid "%<typedef%> was ignored in this declaration"
  msgstr ""
  
! #: cp/decl.c:4560
  #, gcc-internal-format
  msgid "%<constexpr%> cannot be used for type declarations"
  msgstr ""
  
! #: cp/decl.c:4582
  #, gcc-internal-format
  msgid "attribute ignored in explicit instantiation %q#T"
  msgstr ""
  
! #: cp/decl.c:4585
  #, gcc-internal-format
  msgid "no attribute can be applied to an explicit instantiation"
  msgstr ""
  
! #: cp/decl.c:4657
  #, gcc-internal-format
  msgid "ignoring attributes applied to class type %qT outside of definition"
  msgstr ""
  
  #. A template type parameter or other dependent type.
! #: cp/decl.c:4661
  #, gcc-internal-format
  msgid ""
  "ignoring attributes applied to dependent type %qT without an associated "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:4730 cp/decl2.c:898
  #, gcc-internal-format
  msgid "typedef %qD is initialized (use decltype instead)"
  msgstr ""
  
! #: cp/decl.c:4738
  #, gcc-internal-format
  msgid "declaration of %q#D has %<extern%> and is initialized"
  msgstr ""
  
! #: cp/decl.c:4767
  #, gcc-internal-format
  msgid "definition of %q#D is marked %<dllimport%>"
  msgstr ""
  
! #: cp/decl.c:4790
  #, gcc-internal-format
  msgid "%q+#D is not a static data member of %q#T"
  msgstr ""
  
! #: cp/decl.c:4799
  #, gcc-internal-format
  msgid "non-member-template declaration of %qD"
  msgstr ""
  
! #: cp/decl.c:4800
  #, gcc-internal-format
  msgid "does not match member template declaration here"
  msgstr ""
  
! #: cp/decl.c:4813
  #, gcc-internal-format
  msgid "ISO C++ does not permit %<%T::%D%> to be defined as %<%T::%D%>"
  msgstr ""
  
! #: cp/decl.c:4825
  #, gcc-internal-format
  msgid "duplicate initialization of %qD"
  msgstr ""
  
! #: cp/decl.c:4830
  #, gcc-internal-format
  msgid "%qD declared %<constexpr%> outside its class"
  msgstr ""
  
! #: cp/decl.c:4873
  #, gcc-internal-format
  msgid "declaration of %q#D outside of class is not definition"
  msgstr ""
  
! #: cp/decl.c:4906
  #, gcc-internal-format
  msgid "%qD declared %<thread_local%> in %<constexpr%> function"
  msgstr ""
  
! #: cp/decl.c:4909
  #, gcc-internal-format
  msgid "%qD declared %<static%> in %<constexpr%> function"
  msgstr ""
  
! #: cp/decl.c:4974
  #, gcc-internal-format
  msgid "variable %q#D has initializer but incomplete type"
  msgstr ""
  
! #: cp/decl.c:4980 cp/decl.c:5843
  #, gcc-internal-format
  msgid "elements of array %q#D have incomplete type"
  msgstr ""
  
! #: cp/decl.c:4987 cp/decl.c:6466
  #, gcc-internal-format
  msgid "declaration of %q#D has no initializer"
  msgstr ""
  
! #: cp/decl.c:4989
  #, gcc-internal-format
  msgid "aggregate %q#D has incomplete type and cannot be defined"
  msgstr ""
  
! #: cp/decl.c:5023
  #, gcc-internal-format
  msgid "%qD declared as reference but not initialized"
  msgstr ""
  
! #: cp/decl.c:5080
  #, gcc-internal-format
  msgid "name used in a GNU-style designated initializer for an array"
  msgstr ""
  
! #: cp/decl.c:5086
  #, gcc-internal-format
  msgid "name %qD used in a GNU-style designated initializer for an array"
  msgstr ""
  
! #: cp/decl.c:5102 cp/typeck2.c:1268 cp/typeck2.c:1379
  #, gcc-internal-format
  msgid "non-trivial designated initializers not supported"
  msgstr ""
  
! #: cp/decl.c:5105
  #, gcc-internal-format
  msgid "C99 designator %qE is not an integral constant-expression"
  msgstr ""
  
! #: cp/decl.c:5153
  #, gcc-internal-format
  msgid "initializer fails to determine size of %qD"
  msgstr ""
  
! #: cp/decl.c:5159
  #, gcc-internal-format
  msgid "array size missing in %qD"
  msgstr ""
  
! #: cp/decl.c:5170
  #, gcc-internal-format
  msgid "zero-size array %qD"
  msgstr ""
*************** msgstr ""
*** 35562,36414 ****
  #. An automatic variable with an incomplete type: that is an error.
  #. Don't talk about array types here, since we took care of that
  #. message in grokdeclarator.
! #: cp/decl.c:5165
  #, gcc-internal-format
  msgid "storage size of %qD isn%'t known"
  msgstr ""
  
! #: cp/decl.c:5188
  #, gcc-internal-format
  msgid "storage size of %qD isn%'t constant"
  msgstr ""
  
! #: cp/decl.c:5234
  #, gcc-internal-format
  msgid ""
  "sorry: semantics of inline function static data %q#D are wrong (you%'ll wind "
  "up with multiple copies)"
  msgstr ""
  
! #: cp/decl.c:5238
  #, gcc-internal-format
  msgid "you can work around this by removing the initializer"
  msgstr ""
  
! #: cp/decl.c:5265
  #, gcc-internal-format
  msgid "uninitialized const %qD"
  msgstr ""
  
! #: cp/decl.c:5269
  #, gcc-internal-format
  msgid "uninitialized variable %qD in %<constexpr%> function"
  msgstr ""
  
! #: cp/decl.c:5279
  #, gcc-internal-format
  msgid "%q#T has no user-provided default constructor"
  msgstr ""
  
! #: cp/decl.c:5283
  #, gcc-internal-format
  msgid ""
  "constructor is not user-provided because it is explicitly defaulted in the "
  "class body"
  msgstr ""
  
! #: cp/decl.c:5285
  #, gcc-internal-format
  msgid "and the implicitly-defined constructor does not initialize %q+#D"
  msgstr ""
  
! #: cp/decl.c:5408
  #, gcc-internal-format
  msgid "invalid type %qT as initializer for a vector of type %qT"
  msgstr ""
  
! #: cp/decl.c:5449
  #, gcc-internal-format
  msgid "initializer for %qT must be brace-enclosed"
  msgstr ""
  
! #: cp/decl.c:5475
  #, gcc-internal-format
  msgid "%<[%E] =%> used in a GNU-style designated initializer for class %qT"
  msgstr ""
  
! #: cp/decl.c:5483
  #, gcc-internal-format
  msgid "%qT has no non-static data member named %qD"
  msgstr ""
  
! #: cp/decl.c:5503
  #, gcc-internal-format
  msgid "invalid initializer for %q#D"
  msgstr ""
  
! #: cp/decl.c:5533
  #, gcc-internal-format
  msgid "C99 designator %qE outside aggregate initializer"
  msgstr ""
  
! #: cp/decl.c:5570 cp/decl.c:5775 cp/typeck2.c:1260 cp/typeck2.c:1470
! #: cp/typeck2.c:1499 cp/typeck2.c:1546
  #, gcc-internal-format
  msgid "too many initializers for %qT"
  msgstr ""
  
! #: cp/decl.c:5609
  #, gcc-internal-format
  msgid "braces around scalar initializer for type %qT"
  msgstr ""
  
! #: cp/decl.c:5716
  #, gcc-internal-format
  msgid "missing braces around initializer for %qT"
  msgstr ""
  
! #: cp/decl.c:5798
  #, gcc-internal-format
  msgid "elements of array %q#T have incomplete type"
  msgstr ""
  
! #: cp/decl.c:5806
  #, gcc-internal-format
  msgid "variable-sized compound literal"
  msgstr ""
  
! #: cp/decl.c:5860
  #, gcc-internal-format
  msgid "%q#D has incomplete type"
  msgstr ""
  
! #: cp/decl.c:5880
  #, gcc-internal-format
  msgid "scalar object %qD requires one element in initializer"
  msgstr ""
  
! #: cp/decl.c:5923
  #, gcc-internal-format
  msgid "in C++98 %qD must be initialized by constructor, not by %<{...}%>"
  msgstr ""
  
! #: cp/decl.c:6017
  #, gcc-internal-format
  msgid "array %qD initialized by parenthesized string literal %qE"
  msgstr ""
  
! #: cp/decl.c:6048
  #, gcc-internal-format
  msgid "initializer invalid for static member with constructor"
  msgstr ""
  
! #: cp/decl.c:6050
  #, gcc-internal-format
  msgid "non-constant in-class initialization invalid for static member %qD"
  msgstr ""
  
! #: cp/decl.c:6055
  #, gcc-internal-format
  msgid "(an out of class initialization is required)"
  msgstr ""
  
! #: cp/decl.c:6229
  #, gcc-internal-format
  msgid "reference %qD is initialized with itself"
  msgstr ""
  
! #: cp/decl.c:6375
  #, gcc-internal-format
  msgid "assignment (not initialization) in declaration"
  msgstr ""
  
! #: cp/decl.c:6552
  #, gcc-internal-format
  msgid "shadowing previous type declaration of %q#D"
  msgstr ""
  
! #: cp/decl.c:6619
  #, gcc-internal-format
  msgid "Java object %qD not allocated with %<new%>"
  msgstr ""
  
! #: cp/decl.c:6667
  #, gcc-internal-format
  msgid "non-static data member %qD has Java class type"
  msgstr ""
  
! #: cp/decl.c:6748
  #, gcc-internal-format
  msgid "function %q#D is initialized like a variable"
  msgstr ""
  
! #: cp/decl.c:7182
  #, gcc-internal-format
  msgid ""
  "non-local variable %qD declared %<__thread%> needs dynamic initialization"
  msgstr ""
  
! #: cp/decl.c:7185
  #, gcc-internal-format
  msgid ""
  "non-local variable %qD declared %<__thread%> has a non-trivial destructor"
  msgstr ""
  
! #: cp/decl.c:7191
  #, gcc-internal-format
  msgid "C++11 %<thread_local%> allows dynamic initialization and destruction"
  msgstr ""
  
! #: cp/decl.c:7425
  #, gcc-internal-format
  msgid "initializer fails to determine size of %qT"
  msgstr ""
  
! #: cp/decl.c:7429
  #, gcc-internal-format
  msgid "array size missing in %qT"
  msgstr ""
  
! #: cp/decl.c:7432
  #, gcc-internal-format
  msgid "zero-size array %qT"
  msgstr ""
  
! #: cp/decl.c:7448
  #, gcc-internal-format
  msgid "destructor for alien class %qT cannot be a member"
  msgstr ""
  
! #: cp/decl.c:7450
  #, gcc-internal-format
  msgid "constructor for alien class %qT cannot be a member"
  msgstr ""
  
! #: cp/decl.c:7474
  #, gcc-internal-format
  msgid "%qD declared as a %<virtual%> variable"
  msgstr ""
  
! #: cp/decl.c:7476
  #, gcc-internal-format
  msgid "%qD declared as an %<inline%> variable"
  msgstr ""
  
! #: cp/decl.c:7478
  #, gcc-internal-format
  msgid ""
  "%<const%> and %<volatile%> function specifiers on %qD invalid in variable "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:7483
  #, gcc-internal-format
  msgid "%qD declared as a %<virtual%> parameter"
  msgstr ""
  
! #: cp/decl.c:7485
  #, gcc-internal-format
  msgid "%qD declared as an %<inline%> parameter"
  msgstr ""
  
! #: cp/decl.c:7487
  #, gcc-internal-format
  msgid ""
  "%<const%> and %<volatile%> function specifiers on %qD invalid in parameter "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:7492
  #, gcc-internal-format
  msgid "%qD declared as a %<virtual%> type"
  msgstr ""
  
! #: cp/decl.c:7494
  #, gcc-internal-format
  msgid "%qD declared as an %<inline%> type"
  msgstr ""
  
! #: cp/decl.c:7496
  #, gcc-internal-format
  msgid ""
  "%<const%> and %<volatile%> function specifiers on %qD invalid in type "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:7501
  #, gcc-internal-format
  msgid "%qD declared as a %<virtual%> field"
  msgstr ""
  
! #: cp/decl.c:7503
  #, gcc-internal-format
  msgid "%qD declared as an %<inline%> field"
  msgstr ""
  
! #: cp/decl.c:7505
  #, gcc-internal-format
  msgid ""
  "%<const%> and %<volatile%> function specifiers on %qD invalid in field "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:7512
  #, gcc-internal-format
  msgid "%q+D declared as a friend"
  msgstr ""
  
! #: cp/decl.c:7518
  #, gcc-internal-format
  msgid "%q+D declared with an exception specification"
  msgstr ""
  
! #: cp/decl.c:7551
  #, gcc-internal-format
  msgid "definition of %qD is not in namespace enclosing %qT"
  msgstr ""
  
! #: cp/decl.c:7591
  #, gcc-internal-format
  msgid "static member function %q#D declared with type qualifiers"
  msgstr ""
  
! #: cp/decl.c:7710
  #, gcc-internal-format
  msgid "defining explicit specialization %qD in friend declaration"
  msgstr ""
  
  #. Something like `template <class T> friend void f<T>()'.
! #: cp/decl.c:7720
  #, gcc-internal-format
  msgid "invalid use of template-id %qD in declaration of primary template"
  msgstr ""
  
! #: cp/decl.c:7738
  #, gcc-internal-format
  msgid ""
  "default arguments are not allowed in declaration of friend template "
  "specialization %qD"
  msgstr ""
  
! #: cp/decl.c:7745
  #, gcc-internal-format
  msgid ""
  "%<inline%> is not allowed in declaration of friend template specialization "
  "%qD"
  msgstr ""
  
! #: cp/decl.c:7749
  #, gcc-internal-format
  msgid ""
  "%<constexpr%> is not allowed in declaration of friend template "
  "specialization %qD"
  msgstr ""
  
! #: cp/decl.c:7796
  #, gcc-internal-format
  msgid "cannot declare %<::main%> to be a template"
  msgstr ""
  
! #: cp/decl.c:7798
  #, gcc-internal-format
  msgid "cannot declare %<::main%> to be inline"
  msgstr ""
  
! #: cp/decl.c:7800
  #, gcc-internal-format
  msgid "cannot declare %<::main%> to be constexpr"
  msgstr ""
  
! #: cp/decl.c:7802
  #, gcc-internal-format
  msgid "cannot declare %<::main%> to be static"
  msgstr ""
  
! #: cp/decl.c:7846
  #, gcc-internal-format
  msgid "static member function %qD cannot have cv-qualifier"
  msgstr ""
  
! #: cp/decl.c:7847
  #, gcc-internal-format
  msgid "non-member function %qD cannot have cv-qualifier"
  msgstr ""
  
! #: cp/decl.c:7855
  #, gcc-internal-format
  msgid "static member function %qD cannot have ref-qualifier"
  msgstr ""
  
! #: cp/decl.c:7856
  #, gcc-internal-format
  msgid "non-member function %qD cannot have ref-qualifier"
  msgstr ""
  
! #: cp/decl.c:7873
  #, gcc-internal-format
  msgid "literal operator with C linkage"
  msgstr ""
  
! #: cp/decl.c:7882
  #, gcc-internal-format
  msgid "%qD has invalid argument list"
  msgstr ""
  
! #: cp/decl.c:7890
  #, gcc-internal-format
  msgid "integer suffix %<%s%> shadowed by implementation"
  msgstr ""
  
! #: cp/decl.c:7896
  #, gcc-internal-format
  msgid "floating point suffix %<%s%> shadowed by implementation"
  msgstr ""
  
! #: cp/decl.c:7902
  #, gcc-internal-format
  msgid "%qD must be a non-member function"
  msgstr ""
  
! #: cp/decl.c:7980
  #, gcc-internal-format
  msgid "%<::main%> must return %<int%>"
  msgstr ""
  
! #: cp/decl.c:8022
  #, gcc-internal-format
  msgid "definition of implicitly-declared %qD"
  msgstr ""
  
! #: cp/decl.c:8027
  #, gcc-internal-format
  msgid "definition of explicitly-defaulted %q+D"
  msgstr ""
  
! #: cp/decl.c:8028
  #, gcc-internal-format
  msgid "%q+#D explicitly defaulted here"
  msgstr ""
  
! #: cp/decl.c:8045 cp/decl2.c:787
  #, gcc-internal-format
  msgid "no %q#D member function declared in class %qT"
  msgstr ""
  
! #: cp/decl.c:8324
  #, gcc-internal-format
  msgid "in-class initialization of static data member %q#D of incomplete type"
  msgstr ""
  
! #: cp/decl.c:8328
  #, gcc-internal-format
  msgid ""
  "%<constexpr%> needed for in-class initialization of static data member %q#D "
  "of non-integral type"
  msgstr ""
  
! #: cp/decl.c:8331
  #, gcc-internal-format
  msgid "in-class initialization of static data member %q#D of non-literal type"
  msgstr ""
  
! #: cp/decl.c:8344
  #, gcc-internal-format
  msgid ""
  "invalid in-class initialization of static data member of non-integral type "
  "%qT"
  msgstr ""
  
! #: cp/decl.c:8350
  #, gcc-internal-format
  msgid "ISO C++ forbids in-class initialization of non-const static member %qD"
  msgstr ""
  
! #: cp/decl.c:8354
  #, gcc-internal-format
  msgid ""
  "ISO C++ forbids initialization of member constant %qD of non-integral type "
  "%qT"
  msgstr ""
  
! #: cp/decl.c:8458 cp/decl.c:8485
  #, gcc-internal-format
  msgid "size of array %qD has non-integral type %qT"
  msgstr ""
  
! #: cp/decl.c:8461 cp/decl.c:8487
  #, gcc-internal-format
  msgid "size of array has non-integral type %qT"
  msgstr ""
  
! #: cp/decl.c:8526
  #, gcc-internal-format
  msgid "size of array %qD is negative"
  msgstr ""
  
! #: cp/decl.c:8528
  #, gcc-internal-format
  msgid "size of array is negative"
  msgstr ""
  
! #: cp/decl.c:8542
  #, gcc-internal-format
  msgid "ISO C++ forbids zero-size array %qD"
  msgstr ""
  
! #: cp/decl.c:8544
  #, gcc-internal-format
  msgid "ISO C++ forbids zero-size array"
  msgstr ""
  
! #: cp/decl.c:8557
  #, gcc-internal-format
  msgid "size of array %qD is not an integral constant-expression"
  msgstr ""
  
! #: cp/decl.c:8560
  #, gcc-internal-format
  msgid "size of array is not an integral constant-expression"
  msgstr ""
  
! #: cp/decl.c:8566
  #, gcc-internal-format
  msgid "ISO C++ forbids variable length array %qD"
  msgstr ""
  
! #: cp/decl.c:8568
  #, gcc-internal-format
  msgid "ISO C++ forbids variable length array"
  msgstr ""
  
! #: cp/decl.c:8574
  #, gcc-internal-format
  msgid "variable length array %qD is used"
  msgstr ""
  
! #: cp/decl.c:8577
  #, gcc-internal-format
  msgid "variable length array is used"
  msgstr ""
  
! #: cp/decl.c:8640
  #, gcc-internal-format
  msgid "overflow in array dimension"
  msgstr ""
  
! #: cp/decl.c:8693
  #, gcc-internal-format
  msgid "%qD declared as array of %qT"
  msgstr ""
  
! #: cp/decl.c:8703
  #, gcc-internal-format
  msgid "declaration of %qD as array of void"
  msgstr ""
  
! #: cp/decl.c:8705
  #, gcc-internal-format
  msgid "creating array of void"
  msgstr ""
  
! #: cp/decl.c:8710
  #, gcc-internal-format
  msgid "declaration of %qD as array of functions"
  msgstr ""
  
! #: cp/decl.c:8712
  #, gcc-internal-format
  msgid "creating array of functions"
  msgstr ""
  
! #: cp/decl.c:8717
  #, gcc-internal-format
  msgid "declaration of %qD as array of references"
  msgstr ""
  
! #: cp/decl.c:8719
  #, gcc-internal-format
  msgid "creating array of references"
  msgstr ""
  
! #: cp/decl.c:8724
  #, gcc-internal-format
  msgid "declaration of %qD as array of function members"
  msgstr ""
  
! #: cp/decl.c:8726
  #, gcc-internal-format
  msgid "creating array of function members"
  msgstr ""
  
! #: cp/decl.c:8740
  #, gcc-internal-format
  msgid ""
  "declaration of %qD as multidimensional array must have bounds for all "
  "dimensions except the first"
  msgstr ""
  
! #: cp/decl.c:8744
  #, gcc-internal-format
  msgid ""
  "multidimensional array must have bounds for all dimensions except the first"
  msgstr ""
  
! #: cp/decl.c:8779
  #, gcc-internal-format
  msgid "return type specification for constructor invalid"
  msgstr ""
  
! #: cp/decl.c:8789
  #, gcc-internal-format
  msgid "return type specification for destructor invalid"
  msgstr ""
  
! #: cp/decl.c:8802
  #, gcc-internal-format
  msgid "return type specified for %<operator %T%>"
  msgstr ""
  
! #: cp/decl.c:8824
  #, gcc-internal-format
  msgid "unnamed variable or field declared void"
  msgstr ""
  
! #: cp/decl.c:8831
  #, gcc-internal-format
  msgid "variable or field declared void"
  msgstr ""
  
! #: cp/decl.c:9021
  #, gcc-internal-format
  msgid "invalid use of qualified-name %<::%D%>"
  msgstr ""
  
! #: cp/decl.c:9024 cp/decl.c:9044
  #, gcc-internal-format
  msgid "invalid use of qualified-name %<%T::%D%>"
  msgstr ""
  
! #: cp/decl.c:9027
  #, gcc-internal-format
  msgid "invalid use of qualified-name %<%D::%D%>"
  msgstr ""
  
! #: cp/decl.c:9036
  #, gcc-internal-format
  msgid "%q#T is not a class or a namespace"
  msgstr ""
  
! #: cp/decl.c:9060 cp/decl.c:9157 cp/decl.c:9166 cp/decl.c:10569
  #, gcc-internal-format
  msgid "declaration of %qD as non-function"
  msgstr ""
  
! #: cp/decl.c:9066
  #, gcc-internal-format
  msgid "declaration of %qD as non-member"
  msgstr ""
  
! #: cp/decl.c:9102
  #, gcc-internal-format
  msgid "declarator-id missing; using reserved word %qD"
  msgstr ""
  
! #: cp/decl.c:9149
  #, gcc-internal-format
  msgid "function definition does not declare parameters"
  msgstr ""
  
! #: cp/decl.c:9174
  #, gcc-internal-format
  msgid "declaration of %qD as %<typedef%>"
  msgstr ""
  
! #: cp/decl.c:9179
  #, gcc-internal-format
  msgid "declaration of %qD as parameter"
  msgstr ""
  
! #: cp/decl.c:9212
  #, gcc-internal-format
  msgid "%<constexpr%> cannot appear in a typedef declaration"
  msgstr ""
  
! #: cp/decl.c:9220
  #, gcc-internal-format
  msgid "two or more data types in declaration of %qs"
  msgstr ""
  
! #: cp/decl.c:9226
  #, gcc-internal-format
  msgid "conflicting specifiers in declaration of %qs"
  msgstr ""
  
! #: cp/decl.c:9267
  #, gcc-internal-format
  msgid "ISO C++ does not support plain %<complex%> meaning %<double complex%>"
  msgstr ""
  
! #: cp/decl.c:9310 cp/decl.c:9313 cp/decl.c:9316
  #, gcc-internal-format
  msgid "ISO C++ forbids declaration of %qs with no type"
  msgstr ""
  
! #: cp/decl.c:9327
  #, gcc-internal-format
  msgid "%<__int%d%> is not supported by this target"
  msgstr ""
  
! #: cp/decl.c:9333
  #, gcc-internal-format
  msgid "ISO C++ does not support %<__int%d%> for %qs"
  msgstr ""
  
! #: cp/decl.c:9355 cp/decl.c:9375
  #, gcc-internal-format
  msgid "%<signed%> or %<unsigned%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9357
  #, gcc-internal-format
  msgid "%<signed%> and %<unsigned%> specified together for %qs"
  msgstr ""
  
! #: cp/decl.c:9359
  #, gcc-internal-format
  msgid "%<long long%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9361
  #, gcc-internal-format
  msgid "%<long%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9363
  #, gcc-internal-format
  msgid "%<short%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9365
  #, gcc-internal-format
  msgid "%<long%> or %<short%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9367
  #, gcc-internal-format
  msgid "%<long%>, %<int%>, %<short%>, or %<char%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9369
  #, gcc-internal-format
  msgid "%<long%> or %<short%> specified with char for %qs"
  msgstr ""
  
! #: cp/decl.c:9371
  #, gcc-internal-format
  msgid "%<long%> and %<short%> specified together for %qs"
  msgstr ""
  
! #: cp/decl.c:9377
  #, gcc-internal-format
  msgid "%<short%> or %<long%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9385
  #, gcc-internal-format
  msgid "long, short, signed or unsigned used invalidly for %qs"
  msgstr ""
  
! #: cp/decl.c:9453
  #, gcc-internal-format
  msgid "complex invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9476
  #, gcc-internal-format
  msgid "qualifiers are not allowed on declaration of %<operator %T%>"
  msgstr ""
  
! #: cp/decl.c:9509
  #, gcc-internal-format
  msgid "member %qD cannot be declared both virtual and static"
  msgstr ""
  
! #: cp/decl.c:9520
  #, gcc-internal-format
  msgid "typedef declaration invalid in parameter declaration"
  msgstr ""
  
! #: cp/decl.c:9525
  #, gcc-internal-format
  msgid "storage class specified for template parameter %qs"
  msgstr ""
  
! #: cp/decl.c:9531
  #, gcc-internal-format
  msgid "storage class specifiers invalid in parameter declarations"
  msgstr ""
  
! #: cp/decl.c:9537
  #, gcc-internal-format
  msgid "a parameter cannot be declared %<constexpr%>"
  msgstr ""
  
! #: cp/decl.c:9546
  #, gcc-internal-format
  msgid "%<virtual%> outside class declaration"
  msgstr ""
  
! #: cp/decl.c:9564
  #, gcc-internal-format
  msgid "multiple storage classes in declaration of %qs"
  msgstr ""
  
! #: cp/decl.c:9587
  #, gcc-internal-format
  msgid "storage class specified for %qs"
  msgstr ""
  
! #: cp/decl.c:9591
  #, gcc-internal-format
  msgid "storage class specified for parameter %qs"
  msgstr ""
  
! #: cp/decl.c:9604
  #, gcc-internal-format
  msgid "nested function %qs declared %<extern%>"
  msgstr ""
  
! #: cp/decl.c:9608
  #, gcc-internal-format
  msgid "top-level declaration of %qs specifies %<auto%>"
  msgstr ""
  
! #: cp/decl.c:9615
  #, gcc-internal-format
  msgid "function-scope %qs implicitly auto and declared %<__thread%>"
  msgstr ""
  
! #: cp/decl.c:9627
  #, gcc-internal-format
  msgid "storage class specifiers invalid in friend function declarations"
  msgstr ""
  
! #: cp/decl.c:9736
  #, gcc-internal-format
  msgid "%qs declared as function returning a function"
  msgstr ""
  
! #: cp/decl.c:9741
  #, gcc-internal-format
  msgid "%qs declared as function returning an array"
  msgstr ""
  
! #: cp/decl.c:9778
  #, gcc-internal-format
  msgid "%qs function uses %<auto%> type specifier without trailing return type"
  msgstr ""
  
! #: cp/decl.c:9781
  #, gcc-internal-format
  msgid "deduced return type only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/decl.c:9787
  #, gcc-internal-format
  msgid "virtual function cannot have deduced return type"
  msgstr ""
  
! #: cp/decl.c:9794
  #, gcc-internal-format
  msgid ""
  "%qs function with trailing return type has %qT as its type rather than plain "
--- 35740,36592 ----
  #. An automatic variable with an incomplete type: that is an error.
  #. Don't talk about array types here, since we took care of that
  #. message in grokdeclarator.
! #: cp/decl.c:5212
  #, gcc-internal-format
  msgid "storage size of %qD isn%'t known"
  msgstr ""
  
! #: cp/decl.c:5235
  #, gcc-internal-format
  msgid "storage size of %qD isn%'t constant"
  msgstr ""
  
! #: cp/decl.c:5281
  #, gcc-internal-format
  msgid ""
  "sorry: semantics of inline function static data %q#D are wrong (you%'ll wind "
  "up with multiple copies)"
  msgstr ""
  
! #: cp/decl.c:5285
  #, gcc-internal-format
  msgid "you can work around this by removing the initializer"
  msgstr ""
  
! #: cp/decl.c:5312
  #, gcc-internal-format
  msgid "uninitialized const %qD"
  msgstr ""
  
! #: cp/decl.c:5316
  #, gcc-internal-format
  msgid "uninitialized variable %qD in %<constexpr%> function"
  msgstr ""
  
! #: cp/decl.c:5326
  #, gcc-internal-format
  msgid "%q#T has no user-provided default constructor"
  msgstr ""
  
! #: cp/decl.c:5330
  #, gcc-internal-format
  msgid ""
  "constructor is not user-provided because it is explicitly defaulted in the "
  "class body"
  msgstr ""
  
! #: cp/decl.c:5332
  #, gcc-internal-format
  msgid "and the implicitly-defined constructor does not initialize %q+#D"
  msgstr ""
  
! #: cp/decl.c:5455
  #, gcc-internal-format
  msgid "invalid type %qT as initializer for a vector of type %qT"
  msgstr ""
  
! #: cp/decl.c:5496
  #, gcc-internal-format
  msgid "initializer for %qT must be brace-enclosed"
  msgstr ""
  
! #: cp/decl.c:5522
  #, gcc-internal-format
  msgid "%<[%E] =%> used in a GNU-style designated initializer for class %qT"
  msgstr ""
  
! #: cp/decl.c:5530
  #, gcc-internal-format
  msgid "%qT has no non-static data member named %qD"
  msgstr ""
  
! #: cp/decl.c:5550
  #, gcc-internal-format
  msgid "invalid initializer for %q#D"
  msgstr ""
  
! #: cp/decl.c:5580
  #, gcc-internal-format
  msgid "C99 designator %qE outside aggregate initializer"
  msgstr ""
  
! #: cp/decl.c:5617 cp/decl.c:5822 cp/typeck2.c:1255 cp/typeck2.c:1465
! #: cp/typeck2.c:1509 cp/typeck2.c:1556
  #, gcc-internal-format
  msgid "too many initializers for %qT"
  msgstr ""
  
! #: cp/decl.c:5656
  #, gcc-internal-format
  msgid "braces around scalar initializer for type %qT"
  msgstr ""
  
! #: cp/decl.c:5763
  #, gcc-internal-format
  msgid "missing braces around initializer for %qT"
  msgstr ""
  
! #: cp/decl.c:5845
  #, gcc-internal-format
  msgid "elements of array %q#T have incomplete type"
  msgstr ""
  
! #: cp/decl.c:5853
  #, gcc-internal-format
  msgid "variable-sized compound literal"
  msgstr ""
  
! #: cp/decl.c:5907
  #, gcc-internal-format
  msgid "%q#D has incomplete type"
  msgstr ""
  
! #: cp/decl.c:5927
  #, gcc-internal-format
  msgid "scalar object %qD requires one element in initializer"
  msgstr ""
  
! #: cp/decl.c:5970
  #, gcc-internal-format
  msgid "in C++98 %qD must be initialized by constructor, not by %<{...}%>"
  msgstr ""
  
! #: cp/decl.c:6064
  #, gcc-internal-format
  msgid "array %qD initialized by parenthesized string literal %qE"
  msgstr ""
  
! #: cp/decl.c:6095
  #, gcc-internal-format
  msgid "initializer invalid for static member with constructor"
  msgstr ""
  
! #: cp/decl.c:6097
  #, gcc-internal-format
  msgid "non-constant in-class initialization invalid for static member %qD"
  msgstr ""
  
! #: cp/decl.c:6102
  #, gcc-internal-format
  msgid "(an out of class initialization is required)"
  msgstr ""
  
! #: cp/decl.c:6279
  #, gcc-internal-format
  msgid "reference %qD is initialized with itself"
  msgstr ""
  
! #: cp/decl.c:6425
  #, gcc-internal-format
  msgid "assignment (not initialization) in declaration"
  msgstr ""
  
! #: cp/decl.c:6602
  #, gcc-internal-format
  msgid "shadowing previous type declaration of %q#D"
  msgstr ""
  
! #: cp/decl.c:6669
  #, gcc-internal-format
  msgid "Java object %qD not allocated with %<new%>"
  msgstr ""
  
! #: cp/decl.c:6717
  #, gcc-internal-format
  msgid "non-static data member %qD has Java class type"
  msgstr ""
  
! #: cp/decl.c:6798
  #, gcc-internal-format
  msgid "function %q#D is initialized like a variable"
  msgstr ""
  
! #: cp/decl.c:7232
  #, gcc-internal-format
  msgid ""
  "non-local variable %qD declared %<__thread%> needs dynamic initialization"
  msgstr ""
  
! #: cp/decl.c:7235
  #, gcc-internal-format
  msgid ""
  "non-local variable %qD declared %<__thread%> has a non-trivial destructor"
  msgstr ""
  
! #: cp/decl.c:7241
  #, gcc-internal-format
  msgid "C++11 %<thread_local%> allows dynamic initialization and destruction"
  msgstr ""
  
! #: cp/decl.c:7476
  #, gcc-internal-format
  msgid "initializer fails to determine size of %qT"
  msgstr ""
  
! #: cp/decl.c:7480
  #, gcc-internal-format
  msgid "array size missing in %qT"
  msgstr ""
  
! #: cp/decl.c:7483
  #, gcc-internal-format
  msgid "zero-size array %qT"
  msgstr ""
  
! #: cp/decl.c:7499
  #, gcc-internal-format
  msgid "destructor for alien class %qT cannot be a member"
  msgstr ""
  
! #: cp/decl.c:7501
  #, gcc-internal-format
  msgid "constructor for alien class %qT cannot be a member"
  msgstr ""
  
! #: cp/decl.c:7525
  #, gcc-internal-format
  msgid "%qD declared as a %<virtual%> variable"
  msgstr ""
  
! #: cp/decl.c:7527
  #, gcc-internal-format
  msgid "%qD declared as an %<inline%> variable"
  msgstr ""
  
! #: cp/decl.c:7529
  #, gcc-internal-format
  msgid ""
  "%<const%> and %<volatile%> function specifiers on %qD invalid in variable "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:7534
  #, gcc-internal-format
  msgid "%qD declared as a %<virtual%> parameter"
  msgstr ""
  
! #: cp/decl.c:7536
  #, gcc-internal-format
  msgid "%qD declared as an %<inline%> parameter"
  msgstr ""
  
! #: cp/decl.c:7538
  #, gcc-internal-format
  msgid ""
  "%<const%> and %<volatile%> function specifiers on %qD invalid in parameter "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:7543
  #, gcc-internal-format
  msgid "%qD declared as a %<virtual%> type"
  msgstr ""
  
! #: cp/decl.c:7545
  #, gcc-internal-format
  msgid "%qD declared as an %<inline%> type"
  msgstr ""
  
! #: cp/decl.c:7547
  #, gcc-internal-format
  msgid ""
  "%<const%> and %<volatile%> function specifiers on %qD invalid in type "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:7552
  #, gcc-internal-format
  msgid "%qD declared as a %<virtual%> field"
  msgstr ""
  
! #: cp/decl.c:7554
  #, gcc-internal-format
  msgid "%qD declared as an %<inline%> field"
  msgstr ""
  
! #: cp/decl.c:7556
  #, gcc-internal-format
  msgid ""
  "%<const%> and %<volatile%> function specifiers on %qD invalid in field "
  "declaration"
  msgstr ""
  
! #: cp/decl.c:7563
  #, gcc-internal-format
  msgid "%q+D declared as a friend"
  msgstr ""
  
! #: cp/decl.c:7569
  #, gcc-internal-format
  msgid "%q+D declared with an exception specification"
  msgstr ""
  
! #: cp/decl.c:7602
  #, gcc-internal-format
  msgid "definition of %qD is not in namespace enclosing %qT"
  msgstr ""
  
! #: cp/decl.c:7642
  #, gcc-internal-format
  msgid "static member function %q#D declared with type qualifiers"
  msgstr ""
  
! #: cp/decl.c:7761
  #, gcc-internal-format
  msgid "defining explicit specialization %qD in friend declaration"
  msgstr ""
  
  #. Something like `template <class T> friend void f<T>()'.
! #: cp/decl.c:7771
  #, gcc-internal-format
  msgid "invalid use of template-id %qD in declaration of primary template"
  msgstr ""
  
! #: cp/decl.c:7789
  #, gcc-internal-format
  msgid ""
  "default arguments are not allowed in declaration of friend template "
  "specialization %qD"
  msgstr ""
  
! #: cp/decl.c:7796
  #, gcc-internal-format
  msgid ""
  "%<inline%> is not allowed in declaration of friend template specialization "
  "%qD"
  msgstr ""
  
! #: cp/decl.c:7800
  #, gcc-internal-format
  msgid ""
  "%<constexpr%> is not allowed in declaration of friend template "
  "specialization %qD"
  msgstr ""
  
! #: cp/decl.c:7847
  #, gcc-internal-format
  msgid "cannot declare %<::main%> to be a template"
  msgstr ""
  
! #: cp/decl.c:7849
  #, gcc-internal-format
  msgid "cannot declare %<::main%> to be inline"
  msgstr ""
  
! #: cp/decl.c:7851
  #, gcc-internal-format
  msgid "cannot declare %<::main%> to be constexpr"
  msgstr ""
  
! #: cp/decl.c:7853
  #, gcc-internal-format
  msgid "cannot declare %<::main%> to be static"
  msgstr ""
  
! #: cp/decl.c:7897
  #, gcc-internal-format
  msgid "static member function %qD cannot have cv-qualifier"
  msgstr ""
  
! #: cp/decl.c:7898
  #, gcc-internal-format
  msgid "non-member function %qD cannot have cv-qualifier"
  msgstr ""
  
! #: cp/decl.c:7906
  #, gcc-internal-format
  msgid "static member function %qD cannot have ref-qualifier"
  msgstr ""
  
! #: cp/decl.c:7907
  #, gcc-internal-format
  msgid "non-member function %qD cannot have ref-qualifier"
  msgstr ""
  
! #: cp/decl.c:7924
  #, gcc-internal-format
  msgid "literal operator with C linkage"
  msgstr ""
  
! #: cp/decl.c:7933
  #, gcc-internal-format
  msgid "%qD has invalid argument list"
  msgstr ""
  
! #: cp/decl.c:7941
  #, gcc-internal-format
  msgid "integer suffix %<%s%> shadowed by implementation"
  msgstr ""
  
! #: cp/decl.c:7947
  #, gcc-internal-format
  msgid "floating point suffix %<%s%> shadowed by implementation"
  msgstr ""
  
! #: cp/decl.c:7953
  #, gcc-internal-format
  msgid "%qD must be a non-member function"
  msgstr ""
  
! #: cp/decl.c:8031
  #, gcc-internal-format
  msgid "%<::main%> must return %<int%>"
  msgstr ""
  
! #: cp/decl.c:8073
  #, gcc-internal-format
  msgid "definition of implicitly-declared %qD"
  msgstr ""
  
! #: cp/decl.c:8078
  #, gcc-internal-format
  msgid "definition of explicitly-defaulted %q+D"
  msgstr ""
  
! #: cp/decl.c:8079
  #, gcc-internal-format
  msgid "%q+#D explicitly defaulted here"
  msgstr ""
  
! #: cp/decl.c:8096 cp/decl2.c:796
  #, gcc-internal-format
  msgid "no %q#D member function declared in class %qT"
  msgstr ""
  
! #: cp/decl.c:8375
  #, gcc-internal-format
  msgid "in-class initialization of static data member %q#D of incomplete type"
  msgstr ""
  
! #: cp/decl.c:8379
  #, gcc-internal-format
  msgid ""
  "%<constexpr%> needed for in-class initialization of static data member %q#D "
  "of non-integral type"
  msgstr ""
  
! #: cp/decl.c:8382
  #, gcc-internal-format
  msgid "in-class initialization of static data member %q#D of non-literal type"
  msgstr ""
  
! #: cp/decl.c:8395
  #, gcc-internal-format
  msgid ""
  "invalid in-class initialization of static data member of non-integral type "
  "%qT"
  msgstr ""
  
! #: cp/decl.c:8401
  #, gcc-internal-format
  msgid "ISO C++ forbids in-class initialization of non-const static member %qD"
  msgstr ""
  
! #: cp/decl.c:8405
  #, gcc-internal-format
  msgid ""
  "ISO C++ forbids initialization of member constant %qD of non-integral type "
  "%qT"
  msgstr ""
  
! #: cp/decl.c:8509 cp/decl.c:8536
  #, gcc-internal-format
  msgid "size of array %qD has non-integral type %qT"
  msgstr ""
  
! #: cp/decl.c:8512 cp/decl.c:8538
  #, gcc-internal-format
  msgid "size of array has non-integral type %qT"
  msgstr ""
  
! #: cp/decl.c:8577
  #, gcc-internal-format
  msgid "size of array %qD is negative"
  msgstr ""
  
! #: cp/decl.c:8579
  #, gcc-internal-format
  msgid "size of array is negative"
  msgstr ""
  
! #: cp/decl.c:8593
  #, gcc-internal-format
  msgid "ISO C++ forbids zero-size array %qD"
  msgstr ""
  
! #: cp/decl.c:8595
  #, gcc-internal-format
  msgid "ISO C++ forbids zero-size array"
  msgstr ""
  
! #: cp/decl.c:8608
  #, gcc-internal-format
  msgid "size of array %qD is not an integral constant-expression"
  msgstr ""
  
! #: cp/decl.c:8611
  #, gcc-internal-format
  msgid "size of array is not an integral constant-expression"
  msgstr ""
  
! #: cp/decl.c:8617
  #, gcc-internal-format
  msgid "ISO C++ forbids variable length array %qD"
  msgstr ""
  
! #: cp/decl.c:8619
  #, gcc-internal-format
  msgid "ISO C++ forbids variable length array"
  msgstr ""
  
! #: cp/decl.c:8625
  #, gcc-internal-format
  msgid "variable length array %qD is used"
  msgstr ""
  
! #: cp/decl.c:8628
  #, gcc-internal-format
  msgid "variable length array is used"
  msgstr ""
  
! #: cp/decl.c:8691
  #, gcc-internal-format
  msgid "overflow in array dimension"
  msgstr ""
  
! #: cp/decl.c:8744
  #, gcc-internal-format
  msgid "%qD declared as array of %qT"
  msgstr ""
  
! #: cp/decl.c:8754
  #, gcc-internal-format
  msgid "declaration of %qD as array of void"
  msgstr ""
  
! #: cp/decl.c:8756
  #, gcc-internal-format
  msgid "creating array of void"
  msgstr ""
  
! #: cp/decl.c:8761
  #, gcc-internal-format
  msgid "declaration of %qD as array of functions"
  msgstr ""
  
! #: cp/decl.c:8763
  #, gcc-internal-format
  msgid "creating array of functions"
  msgstr ""
  
! #: cp/decl.c:8768
  #, gcc-internal-format
  msgid "declaration of %qD as array of references"
  msgstr ""
  
! #: cp/decl.c:8770
  #, gcc-internal-format
  msgid "creating array of references"
  msgstr ""
  
! #: cp/decl.c:8775
  #, gcc-internal-format
  msgid "declaration of %qD as array of function members"
  msgstr ""
  
! #: cp/decl.c:8777
  #, gcc-internal-format
  msgid "creating array of function members"
  msgstr ""
  
! #: cp/decl.c:8791
  #, gcc-internal-format
  msgid ""
  "declaration of %qD as multidimensional array must have bounds for all "
  "dimensions except the first"
  msgstr ""
  
! #: cp/decl.c:8795
  #, gcc-internal-format
  msgid ""
  "multidimensional array must have bounds for all dimensions except the first"
  msgstr ""
  
! #: cp/decl.c:8830
  #, gcc-internal-format
  msgid "return type specification for constructor invalid"
  msgstr ""
  
! #: cp/decl.c:8840
  #, gcc-internal-format
  msgid "return type specification for destructor invalid"
  msgstr ""
  
! #: cp/decl.c:8853
  #, gcc-internal-format
  msgid "return type specified for %<operator %T%>"
  msgstr ""
  
! #: cp/decl.c:8875
  #, gcc-internal-format
  msgid "unnamed variable or field declared void"
  msgstr ""
  
! #: cp/decl.c:8882
  #, gcc-internal-format
  msgid "variable or field declared void"
  msgstr ""
  
! #: cp/decl.c:9072
  #, gcc-internal-format
  msgid "invalid use of qualified-name %<::%D%>"
  msgstr ""
  
! #: cp/decl.c:9075 cp/decl.c:9095
  #, gcc-internal-format
  msgid "invalid use of qualified-name %<%T::%D%>"
  msgstr ""
  
! #: cp/decl.c:9078
  #, gcc-internal-format
  msgid "invalid use of qualified-name %<%D::%D%>"
  msgstr ""
  
! #: cp/decl.c:9087
  #, gcc-internal-format
  msgid "%q#T is not a class or a namespace"
  msgstr ""
  
! #: cp/decl.c:9111 cp/decl.c:9208 cp/decl.c:9217 cp/decl.c:10620
  #, gcc-internal-format
  msgid "declaration of %qD as non-function"
  msgstr ""
  
! #: cp/decl.c:9117
  #, gcc-internal-format
  msgid "declaration of %qD as non-member"
  msgstr ""
  
! #: cp/decl.c:9153
  #, gcc-internal-format
  msgid "declarator-id missing; using reserved word %qD"
  msgstr ""
  
! #: cp/decl.c:9200
  #, gcc-internal-format
  msgid "function definition does not declare parameters"
  msgstr ""
  
! #: cp/decl.c:9225
  #, gcc-internal-format
  msgid "declaration of %qD as %<typedef%>"
  msgstr ""
  
! #: cp/decl.c:9230
  #, gcc-internal-format
  msgid "declaration of %qD as parameter"
  msgstr ""
  
! #: cp/decl.c:9263
  #, gcc-internal-format
  msgid "%<constexpr%> cannot appear in a typedef declaration"
  msgstr ""
  
! #: cp/decl.c:9271
  #, gcc-internal-format
  msgid "two or more data types in declaration of %qs"
  msgstr ""
  
! #: cp/decl.c:9277
  #, gcc-internal-format
  msgid "conflicting specifiers in declaration of %qs"
  msgstr ""
  
! #: cp/decl.c:9318
  #, gcc-internal-format
  msgid "ISO C++ does not support plain %<complex%> meaning %<double complex%>"
  msgstr ""
  
! #: cp/decl.c:9361 cp/decl.c:9364 cp/decl.c:9367
  #, gcc-internal-format
  msgid "ISO C++ forbids declaration of %qs with no type"
  msgstr ""
  
! #: cp/decl.c:9378
  #, gcc-internal-format
  msgid "%<__int%d%> is not supported by this target"
  msgstr ""
  
! #: cp/decl.c:9384
  #, gcc-internal-format
  msgid "ISO C++ does not support %<__int%d%> for %qs"
  msgstr ""
  
! #: cp/decl.c:9406 cp/decl.c:9426
  #, gcc-internal-format
  msgid "%<signed%> or %<unsigned%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9408
  #, gcc-internal-format
  msgid "%<signed%> and %<unsigned%> specified together for %qs"
  msgstr ""
  
! #: cp/decl.c:9410
  #, gcc-internal-format
  msgid "%<long long%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9412
  #, gcc-internal-format
  msgid "%<long%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9414
  #, gcc-internal-format
  msgid "%<short%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9416
  #, gcc-internal-format
  msgid "%<long%> or %<short%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9418
  #, gcc-internal-format
  msgid "%<long%>, %<int%>, %<short%>, or %<char%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9420
  #, gcc-internal-format
  msgid "%<long%> or %<short%> specified with char for %qs"
  msgstr ""
  
! #: cp/decl.c:9422
  #, gcc-internal-format
  msgid "%<long%> and %<short%> specified together for %qs"
  msgstr ""
  
! #: cp/decl.c:9428
  #, gcc-internal-format
  msgid "%<short%> or %<long%> invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9436
  #, gcc-internal-format
  msgid "long, short, signed or unsigned used invalidly for %qs"
  msgstr ""
  
! #: cp/decl.c:9504
  #, gcc-internal-format
  msgid "complex invalid for %qs"
  msgstr ""
  
! #: cp/decl.c:9527
  #, gcc-internal-format
  msgid "qualifiers are not allowed on declaration of %<operator %T%>"
  msgstr ""
  
! #: cp/decl.c:9560
  #, gcc-internal-format
  msgid "member %qD cannot be declared both virtual and static"
  msgstr ""
  
! #: cp/decl.c:9571
  #, gcc-internal-format
  msgid "typedef declaration invalid in parameter declaration"
  msgstr ""
  
! #: cp/decl.c:9576
  #, gcc-internal-format
  msgid "storage class specified for template parameter %qs"
  msgstr ""
  
! #: cp/decl.c:9582
  #, gcc-internal-format
  msgid "storage class specifiers invalid in parameter declarations"
  msgstr ""
  
! #: cp/decl.c:9588
  #, gcc-internal-format
  msgid "a parameter cannot be declared %<constexpr%>"
  msgstr ""
  
! #: cp/decl.c:9597
  #, gcc-internal-format
  msgid "%<virtual%> outside class declaration"
  msgstr ""
  
! #: cp/decl.c:9615
  #, gcc-internal-format
  msgid "multiple storage classes in declaration of %qs"
  msgstr ""
  
! #: cp/decl.c:9638
  #, gcc-internal-format
  msgid "storage class specified for %qs"
  msgstr ""
  
! #: cp/decl.c:9642
  #, gcc-internal-format
  msgid "storage class specified for parameter %qs"
  msgstr ""
  
! #: cp/decl.c:9655
  #, gcc-internal-format
  msgid "nested function %qs declared %<extern%>"
  msgstr ""
  
! #: cp/decl.c:9659
  #, gcc-internal-format
  msgid "top-level declaration of %qs specifies %<auto%>"
  msgstr ""
  
! #: cp/decl.c:9666
  #, gcc-internal-format
  msgid "function-scope %qs implicitly auto and declared %<__thread%>"
  msgstr ""
  
! #: cp/decl.c:9678
  #, gcc-internal-format
  msgid "storage class specifiers invalid in friend function declarations"
  msgstr ""
  
! #: cp/decl.c:9787
  #, gcc-internal-format
  msgid "%qs declared as function returning a function"
  msgstr ""
  
! #: cp/decl.c:9792
  #, gcc-internal-format
  msgid "%qs declared as function returning an array"
  msgstr ""
  
! #: cp/decl.c:9829
  #, gcc-internal-format
  msgid "%qs function uses %<auto%> type specifier without trailing return type"
  msgstr ""
  
! #: cp/decl.c:9832
  #, gcc-internal-format
  msgid "deduced return type only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/decl.c:9838
  #, gcc-internal-format
  msgid "virtual function cannot have deduced return type"
  msgstr ""
  
! #: cp/decl.c:9845
  #, gcc-internal-format
  msgid ""
  "%qs function with trailing return type has %qT as its type rather than plain "
*************** msgstr ""
*** 36417,36896 ****
  
  #. Not using maybe_warn_cpp0x because this should
  #. always be an error.
! #: cp/decl.c:9805
  #, gcc-internal-format
  msgid "trailing return type only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/decl.c:9808
  #, gcc-internal-format
  msgid ""
  "%qs function with trailing return type not declared with %<auto%> type "
  "specifier"
  msgstr ""
  
! #: cp/decl.c:9845
  #, gcc-internal-format
  msgid "destructor cannot be static member function"
  msgstr ""
  
! #: cp/decl.c:9846
  #, gcc-internal-format
  msgid "constructor cannot be static member function"
  msgstr ""
  
! #: cp/decl.c:9850
  #, gcc-internal-format
  msgid "destructors may not be cv-qualified"
  msgstr ""
  
! #: cp/decl.c:9851
  #, gcc-internal-format
  msgid "constructors may not be cv-qualified"
  msgstr ""
  
! #: cp/decl.c:9859
  #, gcc-internal-format
  msgid "destructors may not be ref-qualified"
  msgstr ""
  
! #: cp/decl.c:9877
  #, gcc-internal-format
  msgid "constructors cannot be declared virtual"
  msgstr ""
  
  #. Cannot be both friend and virtual.
! #: cp/decl.c:9892
  #, gcc-internal-format
  msgid "virtual functions cannot be friends"
  msgstr ""
  
! #: cp/decl.c:9896
  #, gcc-internal-format
  msgid "friend declaration not in class definition"
  msgstr ""
  
! #: cp/decl.c:9898
  #, gcc-internal-format
  msgid "can%'t define friend function %qs in a local class definition"
  msgstr ""
  
! #: cp/decl.c:9919
  #, gcc-internal-format
  msgid "destructors may not have parameters"
  msgstr ""
  
! #: cp/decl.c:9945
  #, gcc-internal-format
  msgid "cannot declare pointer to %q#T"
  msgstr ""
  
! #: cp/decl.c:9958 cp/decl.c:9965
  #, gcc-internal-format
  msgid "cannot declare reference to %q#T"
  msgstr ""
  
! #: cp/decl.c:9967
  #, gcc-internal-format
  msgid "cannot declare pointer to %q#T member"
  msgstr ""
  
! #: cp/decl.c:9996
  #, gcc-internal-format
  msgid "cannot declare reference to qualified function type %qT"
  msgstr ""
  
! #: cp/decl.c:9997
  #, gcc-internal-format
  msgid "cannot declare pointer to qualified function type %qT"
  msgstr ""
  
! #: cp/decl.c:10067
  #, gcc-internal-format
  msgid ""
  "cannot declare reference to %q#T, which is not a typedef or a template type "
  "argument"
  msgstr ""
  
! #: cp/decl.c:10137
  #, gcc-internal-format
  msgid "template-id %qD used as a declarator"
  msgstr ""
  
! #: cp/decl.c:10161
  #, gcc-internal-format
  msgid "member functions are implicitly friends of their class"
  msgstr ""
  
! #: cp/decl.c:10166
  #, gcc-internal-format
  msgid "extra qualification %<%T::%> on member %qs"
  msgstr ""
  
! #: cp/decl.c:10196
  #, gcc-internal-format
  msgid "cannot define member function %<%T::%s%> within %<%T%>"
  msgstr ""
  
! #: cp/decl.c:10198
  #, gcc-internal-format
  msgid "cannot declare member function %<%T::%s%> within %<%T%>"
  msgstr ""
  
! #: cp/decl.c:10206
  #, gcc-internal-format
  msgid "cannot declare member %<%T::%s%> within %qT"
  msgstr ""
  
! #: cp/decl.c:10239
  #, gcc-internal-format
  msgid "non-parameter %qs cannot be a parameter pack"
  msgstr ""
  
! #: cp/decl.c:10249
  #, gcc-internal-format
  msgid "size of array %qs is too large"
  msgstr ""
  
! #: cp/decl.c:10260
  #, gcc-internal-format
  msgid "data member may not have variably modified type %qT"
  msgstr ""
  
! #: cp/decl.c:10262
  #, gcc-internal-format
  msgid "parameter may not have variably modified type %qT"
  msgstr ""
  
! #: cp/decl.c:10272
  #, gcc-internal-format
  msgid "%<explicit%> outside class declaration"
  msgstr ""
  
! #: cp/decl.c:10274
  #, gcc-internal-format
  msgid "%<explicit%> in friend declaration"
  msgstr ""
  
! #: cp/decl.c:10276
  #, gcc-internal-format
  msgid ""
  "only declarations of constructors and conversion operators can be %<explicit"
  "%>"
  msgstr ""
  
! #: cp/decl.c:10285
  #, gcc-internal-format
  msgid "non-member %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10290
  #, gcc-internal-format
  msgid "non-object member %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10296
  #, gcc-internal-format
  msgid "function %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10301
  #, gcc-internal-format
  msgid "static %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10306
  #, gcc-internal-format
  msgid "const %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10311
  #, gcc-internal-format
  msgid "reference %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10347
  #, gcc-internal-format
  msgid "typedef declared %<auto%>"
  msgstr ""
  
! #: cp/decl.c:10357
  #, gcc-internal-format
  msgid "typedef name may not be a nested-name-specifier"
  msgstr ""
  
! #: cp/decl.c:10378
  #, gcc-internal-format
  msgid "ISO C++ forbids nested type %qD with same name as enclosing class"
  msgstr ""
  
! #: cp/decl.c:10497
  #, gcc-internal-format
  msgid "type qualifiers specified for friend class declaration"
  msgstr ""
  
! #: cp/decl.c:10502
  #, gcc-internal-format
  msgid "%<inline%> specified for friend class declaration"
  msgstr ""
  
! #: cp/decl.c:10510
  #, gcc-internal-format
  msgid "template parameters cannot be friends"
  msgstr ""
  
! #: cp/decl.c:10512
  #, gcc-internal-format
  msgid "friend declaration requires class-key, i.e. %<friend class %T::%D%>"
  msgstr ""
  
! #: cp/decl.c:10516
  #, gcc-internal-format
  msgid "friend declaration requires class-key, i.e. %<friend %#T%>"
  msgstr ""
  
! #: cp/decl.c:10529
  #, gcc-internal-format
  msgid "trying to make class %qT a friend of global scope"
  msgstr ""
  
! #: cp/decl.c:10549
  #, gcc-internal-format
  msgid "invalid qualifiers on non-member function type"
  msgstr ""
  
! #: cp/decl.c:10559
  #, gcc-internal-format
  msgid "abstract declarator %qT used as declaration"
  msgstr ""
  
! #: cp/decl.c:10588
  #, gcc-internal-format
  msgid "cannot use %<::%> in parameter declaration"
  msgstr ""
  
! #: cp/decl.c:10593
  #, gcc-internal-format
  msgid "%<auto%> parameter not permitted in this context"
  msgstr ""
  
! #: cp/decl.c:10595
  #, gcc-internal-format
  msgid "parameter declared %<auto%>"
  msgstr ""
  
! #: cp/decl.c:10641
  #, gcc-internal-format
  msgid "non-static data member declared %<auto%>"
  msgstr ""
  
  #. Something like struct S { int N::j; };
! #: cp/decl.c:10663
  #, gcc-internal-format
  msgid "invalid use of %<::%>"
  msgstr ""
  
! #: cp/decl.c:10685
  #, gcc-internal-format
  msgid "declaration of function %qD in invalid context"
  msgstr ""
  
! #: cp/decl.c:10694
  #, gcc-internal-format
  msgid "function %qD declared virtual inside a union"
  msgstr ""
  
! #: cp/decl.c:10703
  #, gcc-internal-format
  msgid "%qD cannot be declared virtual, since it is always static"
  msgstr ""
  
! #: cp/decl.c:10719
  #, gcc-internal-format
  msgid "expected qualified name in friend declaration for destructor %qD"
  msgstr ""
  
! #: cp/decl.c:10726
  #, gcc-internal-format
  msgid "declaration of %qD as member of %qT"
  msgstr ""
  
! #: cp/decl.c:10732
  #, gcc-internal-format
  msgid "a destructor cannot be %<constexpr%>"
  msgstr ""
  
! #: cp/decl.c:10738
  #, gcc-internal-format
  msgid "expected qualified name in friend declaration for constructor %qD"
  msgstr ""
  
! #: cp/decl.c:10749
  #, gcc-internal-format
  msgid "specialization of variable template %qD declared as function"
  msgstr ""
  
! #: cp/decl.c:10752
  #, gcc-internal-format
  msgid "variable template declared here"
  msgstr ""
  
! #: cp/decl.c:10804
  #, gcc-internal-format
  msgid "field %qD has incomplete type %qT"
  msgstr ""
  
! #: cp/decl.c:10809
  #, gcc-internal-format
  msgid "name %qT has incomplete type"
  msgstr ""
  
! #: cp/decl.c:10818
  #, gcc-internal-format
  msgid "%qE is neither function nor member function; cannot be declared friend"
  msgstr ""
  
! #: cp/decl.c:10877
  #, gcc-internal-format
  msgid "constexpr static data member %qD must have an initializer"
  msgstr ""
  
! #: cp/decl.c:10886
  #, gcc-internal-format
  msgid "non-static data member %qE declared %<constexpr%>"
  msgstr ""
  
! #: cp/decl.c:10936
  #, gcc-internal-format
  msgid "storage class %<auto%> invalid for function %qs"
  msgstr ""
  
! #: cp/decl.c:10938
  #, gcc-internal-format
  msgid "storage class %<register%> invalid for function %qs"
  msgstr ""
  
! #: cp/decl.c:10942
  #, gcc-internal-format
  msgid "storage class %<__thread%> invalid for function %qs"
  msgstr ""
  
! #: cp/decl.c:10945
  #, gcc-internal-format
  msgid "storage class %<thread_local%> invalid for function %qs"
  msgstr ""
  
! #: cp/decl.c:10950
  #, gcc-internal-format
  msgid "virt-specifiers in %qs not allowed outside a class definition"
  msgstr ""
  
! #: cp/decl.c:10961
  #, gcc-internal-format
  msgid ""
  "%<static%> specified invalid for function %qs declared out of global scope"
  msgstr ""
  
! #: cp/decl.c:10965
  #, gcc-internal-format
  msgid ""
  "%<inline%> specifier invalid for function %qs declared out of global scope"
  msgstr ""
  
! #: cp/decl.c:10973
  #, gcc-internal-format
  msgid "virtual non-class function %qs"
  msgstr ""
  
! #: cp/decl.c:10980
  #, gcc-internal-format
  msgid "%qs defined in a non-class scope"
  msgstr ""
  
! #: cp/decl.c:10981
  #, gcc-internal-format
  msgid "%qs declared in a non-class scope"
  msgstr ""
  
! #: cp/decl.c:11012
  #, gcc-internal-format
  msgid "cannot declare member function %qD to have static linkage"
  msgstr ""
  
  #. FIXME need arm citation
! #: cp/decl.c:11019
  #, gcc-internal-format
  msgid "cannot declare static function inside another function"
  msgstr ""
  
! #: cp/decl.c:11053
  #, gcc-internal-format
  msgid ""
  "%<static%> may not be used when defining (as opposed to declaring) a static "
  "data member"
  msgstr ""
  
! #: cp/decl.c:11060
  #, gcc-internal-format
  msgid "static member %qD declared %<register%>"
  msgstr ""
  
! #: cp/decl.c:11066
  #, gcc-internal-format
  msgid "cannot explicitly declare member %q#D to have extern linkage"
  msgstr ""
  
! #: cp/decl.c:11073
  #, gcc-internal-format
  msgid "declaration of constexpr variable %qD is not a definition"
  msgstr ""
  
! #: cp/decl.c:11086
  #, gcc-internal-format
  msgid "%qs initialized and declared %<extern%>"
  msgstr ""
  
! #: cp/decl.c:11090
  #, gcc-internal-format
  msgid "%qs has both %<extern%> and initializer"
  msgstr ""
  
! #: cp/decl.c:11237
  #, gcc-internal-format
  msgid "default argument %qE uses %qD"
  msgstr ""
  
! #: cp/decl.c:11240
  #, gcc-internal-format
  msgid "default argument %qE uses local variable %qD"
  msgstr ""
  
! #: cp/decl.c:11321
  #, gcc-internal-format
  msgid "invalid use of cv-qualified type %qT in parameter declaration"
  msgstr ""
  
! #: cp/decl.c:11325
  #, gcc-internal-format
  msgid "invalid use of type %<void%> in parameter declaration"
  msgstr ""
  
! #: cp/decl.c:11338
  #, gcc-internal-format
  msgid "parameter %qD has Java class type"
  msgstr ""
  
! #: cp/decl.c:11366
  #, gcc-internal-format
  msgid "parameter %qD invalidly declared method type"
  msgstr ""
  
! #: cp/decl.c:11391
  #, gcc-internal-format
  msgid "parameter %qD includes pointer to array of unknown bound %qT"
  msgstr ""
  
! #: cp/decl.c:11393
  #, gcc-internal-format
  msgid "parameter %qD includes reference to array of unknown bound %qT"
  msgstr ""
--- 36595,37074 ----
  
  #. Not using maybe_warn_cpp0x because this should
  #. always be an error.
! #: cp/decl.c:9856
  #, gcc-internal-format
  msgid "trailing return type only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/decl.c:9859
  #, gcc-internal-format
  msgid ""
  "%qs function with trailing return type not declared with %<auto%> type "
  "specifier"
  msgstr ""
  
! #: cp/decl.c:9896
  #, gcc-internal-format
  msgid "destructor cannot be static member function"
  msgstr ""
  
! #: cp/decl.c:9897
  #, gcc-internal-format
  msgid "constructor cannot be static member function"
  msgstr ""
  
! #: cp/decl.c:9901
  #, gcc-internal-format
  msgid "destructors may not be cv-qualified"
  msgstr ""
  
! #: cp/decl.c:9902
  #, gcc-internal-format
  msgid "constructors may not be cv-qualified"
  msgstr ""
  
! #: cp/decl.c:9910
  #, gcc-internal-format
  msgid "destructors may not be ref-qualified"
  msgstr ""
  
! #: cp/decl.c:9928
  #, gcc-internal-format
  msgid "constructors cannot be declared virtual"
  msgstr ""
  
  #. Cannot be both friend and virtual.
! #: cp/decl.c:9943
  #, gcc-internal-format
  msgid "virtual functions cannot be friends"
  msgstr ""
  
! #: cp/decl.c:9947
  #, gcc-internal-format
  msgid "friend declaration not in class definition"
  msgstr ""
  
! #: cp/decl.c:9949
  #, gcc-internal-format
  msgid "can%'t define friend function %qs in a local class definition"
  msgstr ""
  
! #: cp/decl.c:9970
  #, gcc-internal-format
  msgid "destructors may not have parameters"
  msgstr ""
  
! #: cp/decl.c:9996
  #, gcc-internal-format
  msgid "cannot declare pointer to %q#T"
  msgstr ""
  
! #: cp/decl.c:10009 cp/decl.c:10016
  #, gcc-internal-format
  msgid "cannot declare reference to %q#T"
  msgstr ""
  
! #: cp/decl.c:10018
  #, gcc-internal-format
  msgid "cannot declare pointer to %q#T member"
  msgstr ""
  
! #: cp/decl.c:10047
  #, gcc-internal-format
  msgid "cannot declare reference to qualified function type %qT"
  msgstr ""
  
! #: cp/decl.c:10048
  #, gcc-internal-format
  msgid "cannot declare pointer to qualified function type %qT"
  msgstr ""
  
! #: cp/decl.c:10118
  #, gcc-internal-format
  msgid ""
  "cannot declare reference to %q#T, which is not a typedef or a template type "
  "argument"
  msgstr ""
  
! #: cp/decl.c:10188
  #, gcc-internal-format
  msgid "template-id %qD used as a declarator"
  msgstr ""
  
! #: cp/decl.c:10212
  #, gcc-internal-format
  msgid "member functions are implicitly friends of their class"
  msgstr ""
  
! #: cp/decl.c:10217
  #, gcc-internal-format
  msgid "extra qualification %<%T::%> on member %qs"
  msgstr ""
  
! #: cp/decl.c:10247
  #, gcc-internal-format
  msgid "cannot define member function %<%T::%s%> within %<%T%>"
  msgstr ""
  
! #: cp/decl.c:10249
  #, gcc-internal-format
  msgid "cannot declare member function %<%T::%s%> within %<%T%>"
  msgstr ""
  
! #: cp/decl.c:10257
  #, gcc-internal-format
  msgid "cannot declare member %<%T::%s%> within %qT"
  msgstr ""
  
! #: cp/decl.c:10290
  #, gcc-internal-format
  msgid "non-parameter %qs cannot be a parameter pack"
  msgstr ""
  
! #: cp/decl.c:10300
  #, gcc-internal-format
  msgid "size of array %qs is too large"
  msgstr ""
  
! #: cp/decl.c:10311
  #, gcc-internal-format
  msgid "data member may not have variably modified type %qT"
  msgstr ""
  
! #: cp/decl.c:10313
  #, gcc-internal-format
  msgid "parameter may not have variably modified type %qT"
  msgstr ""
  
! #: cp/decl.c:10323
  #, gcc-internal-format
  msgid "%<explicit%> outside class declaration"
  msgstr ""
  
! #: cp/decl.c:10325
  #, gcc-internal-format
  msgid "%<explicit%> in friend declaration"
  msgstr ""
  
! #: cp/decl.c:10327
  #, gcc-internal-format
  msgid ""
  "only declarations of constructors and conversion operators can be %<explicit"
  "%>"
  msgstr ""
  
! #: cp/decl.c:10336
  #, gcc-internal-format
  msgid "non-member %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10341
  #, gcc-internal-format
  msgid "non-object member %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10347
  #, gcc-internal-format
  msgid "function %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10352
  #, gcc-internal-format
  msgid "static %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10357
  #, gcc-internal-format
  msgid "const %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10362
  #, gcc-internal-format
  msgid "reference %qs cannot be declared %<mutable%>"
  msgstr ""
  
! #: cp/decl.c:10398
  #, gcc-internal-format
  msgid "typedef declared %<auto%>"
  msgstr ""
  
! #: cp/decl.c:10408
  #, gcc-internal-format
  msgid "typedef name may not be a nested-name-specifier"
  msgstr ""
  
! #: cp/decl.c:10429
  #, gcc-internal-format
  msgid "ISO C++ forbids nested type %qD with same name as enclosing class"
  msgstr ""
  
! #: cp/decl.c:10548
  #, gcc-internal-format
  msgid "type qualifiers specified for friend class declaration"
  msgstr ""
  
! #: cp/decl.c:10553
  #, gcc-internal-format
  msgid "%<inline%> specified for friend class declaration"
  msgstr ""
  
! #: cp/decl.c:10561
  #, gcc-internal-format
  msgid "template parameters cannot be friends"
  msgstr ""
  
! #: cp/decl.c:10563
  #, gcc-internal-format
  msgid "friend declaration requires class-key, i.e. %<friend class %T::%D%>"
  msgstr ""
  
! #: cp/decl.c:10567
  #, gcc-internal-format
  msgid "friend declaration requires class-key, i.e. %<friend %#T%>"
  msgstr ""
  
! #: cp/decl.c:10580
  #, gcc-internal-format
  msgid "trying to make class %qT a friend of global scope"
  msgstr ""
  
! #: cp/decl.c:10600
  #, gcc-internal-format
  msgid "invalid qualifiers on non-member function type"
  msgstr ""
  
! #: cp/decl.c:10610
  #, gcc-internal-format
  msgid "abstract declarator %qT used as declaration"
  msgstr ""
  
! #: cp/decl.c:10639
  #, gcc-internal-format
  msgid "cannot use %<::%> in parameter declaration"
  msgstr ""
  
! #: cp/decl.c:10644
  #, gcc-internal-format
  msgid "%<auto%> parameter not permitted in this context"
  msgstr ""
  
! #: cp/decl.c:10646
  #, gcc-internal-format
  msgid "parameter declared %<auto%>"
  msgstr ""
  
! #: cp/decl.c:10692
  #, gcc-internal-format
  msgid "non-static data member declared %<auto%>"
  msgstr ""
  
  #. Something like struct S { int N::j; };
! #: cp/decl.c:10714
  #, gcc-internal-format
  msgid "invalid use of %<::%>"
  msgstr ""
  
! #: cp/decl.c:10736
  #, gcc-internal-format
  msgid "declaration of function %qD in invalid context"
  msgstr ""
  
! #: cp/decl.c:10745
  #, gcc-internal-format
  msgid "function %qD declared virtual inside a union"
  msgstr ""
  
! #: cp/decl.c:10754
  #, gcc-internal-format
  msgid "%qD cannot be declared virtual, since it is always static"
  msgstr ""
  
! #: cp/decl.c:10770
  #, gcc-internal-format
  msgid "expected qualified name in friend declaration for destructor %qD"
  msgstr ""
  
! #: cp/decl.c:10777
  #, gcc-internal-format
  msgid "declaration of %qD as member of %qT"
  msgstr ""
  
! #: cp/decl.c:10783
  #, gcc-internal-format
  msgid "a destructor cannot be %<constexpr%>"
  msgstr ""
  
! #: cp/decl.c:10789
  #, gcc-internal-format
  msgid "expected qualified name in friend declaration for constructor %qD"
  msgstr ""
  
! #: cp/decl.c:10800
  #, gcc-internal-format
  msgid "specialization of variable template %qD declared as function"
  msgstr ""
  
! #: cp/decl.c:10803
  #, gcc-internal-format
  msgid "variable template declared here"
  msgstr ""
  
! #: cp/decl.c:10855
  #, gcc-internal-format
  msgid "field %qD has incomplete type %qT"
  msgstr ""
  
! #: cp/decl.c:10860
  #, gcc-internal-format
  msgid "name %qT has incomplete type"
  msgstr ""
  
! #: cp/decl.c:10869
  #, gcc-internal-format
  msgid "%qE is neither function nor member function; cannot be declared friend"
  msgstr ""
  
! #: cp/decl.c:10928
  #, gcc-internal-format
  msgid "constexpr static data member %qD must have an initializer"
  msgstr ""
  
! #: cp/decl.c:10937
  #, gcc-internal-format
  msgid "non-static data member %qE declared %<constexpr%>"
  msgstr ""
  
! #: cp/decl.c:10987
  #, gcc-internal-format
  msgid "storage class %<auto%> invalid for function %qs"
  msgstr ""
  
! #: cp/decl.c:10989
  #, gcc-internal-format
  msgid "storage class %<register%> invalid for function %qs"
  msgstr ""
  
! #: cp/decl.c:10993
  #, gcc-internal-format
  msgid "storage class %<__thread%> invalid for function %qs"
  msgstr ""
  
! #: cp/decl.c:10996
  #, gcc-internal-format
  msgid "storage class %<thread_local%> invalid for function %qs"
  msgstr ""
  
! #: cp/decl.c:11001
  #, gcc-internal-format
  msgid "virt-specifiers in %qs not allowed outside a class definition"
  msgstr ""
  
! #: cp/decl.c:11012
  #, gcc-internal-format
  msgid ""
  "%<static%> specified invalid for function %qs declared out of global scope"
  msgstr ""
  
! #: cp/decl.c:11016
  #, gcc-internal-format
  msgid ""
  "%<inline%> specifier invalid for function %qs declared out of global scope"
  msgstr ""
  
! #: cp/decl.c:11024
  #, gcc-internal-format
  msgid "virtual non-class function %qs"
  msgstr ""
  
! #: cp/decl.c:11031
  #, gcc-internal-format
  msgid "%qs defined in a non-class scope"
  msgstr ""
  
! #: cp/decl.c:11032
  #, gcc-internal-format
  msgid "%qs declared in a non-class scope"
  msgstr ""
  
! #: cp/decl.c:11063
  #, gcc-internal-format
  msgid "cannot declare member function %qD to have static linkage"
  msgstr ""
  
  #. FIXME need arm citation
! #: cp/decl.c:11070
  #, gcc-internal-format
  msgid "cannot declare static function inside another function"
  msgstr ""
  
! #: cp/decl.c:11104
  #, gcc-internal-format
  msgid ""
  "%<static%> may not be used when defining (as opposed to declaring) a static "
  "data member"
  msgstr ""
  
! #: cp/decl.c:11111
  #, gcc-internal-format
  msgid "static member %qD declared %<register%>"
  msgstr ""
  
! #: cp/decl.c:11117
  #, gcc-internal-format
  msgid "cannot explicitly declare member %q#D to have extern linkage"
  msgstr ""
  
! #: cp/decl.c:11124
  #, gcc-internal-format
  msgid "declaration of constexpr variable %qD is not a definition"
  msgstr ""
  
! #: cp/decl.c:11137
  #, gcc-internal-format
  msgid "%qs initialized and declared %<extern%>"
  msgstr ""
  
! #: cp/decl.c:11141
  #, gcc-internal-format
  msgid "%qs has both %<extern%> and initializer"
  msgstr ""
  
! #: cp/decl.c:11288
  #, gcc-internal-format
  msgid "default argument %qE uses %qD"
  msgstr ""
  
! #: cp/decl.c:11291
  #, gcc-internal-format
  msgid "default argument %qE uses local variable %qD"
  msgstr ""
  
! #: cp/decl.c:11372
  #, gcc-internal-format
  msgid "invalid use of cv-qualified type %qT in parameter declaration"
  msgstr ""
  
! #: cp/decl.c:11376
  #, gcc-internal-format
  msgid "invalid use of type %<void%> in parameter declaration"
  msgstr ""
  
! #: cp/decl.c:11389
  #, gcc-internal-format
  msgid "parameter %qD has Java class type"
  msgstr ""
  
! #: cp/decl.c:11417
  #, gcc-internal-format
  msgid "parameter %qD invalidly declared method type"
  msgstr ""
  
! #: cp/decl.c:11442
  #, gcc-internal-format
  msgid "parameter %qD includes pointer to array of unknown bound %qT"
  msgstr ""
  
! #: cp/decl.c:11444
  #, gcc-internal-format
  msgid "parameter %qD includes reference to array of unknown bound %qT"
  msgstr ""
*************** msgstr ""
*** 36910,37090 ****
  #. or implicitly defined), there's no need to worry about their
  #. existence.  Theoretically, they should never even be
  #. instantiated, but that's hard to forestall.
! #: cp/decl.c:11643
  #, gcc-internal-format
  msgid "invalid constructor; you probably meant %<%T (const %T&)%>"
  msgstr ""
  
! #: cp/decl.c:11765
  #, gcc-internal-format
  msgid "%qD may not be declared within a namespace"
  msgstr ""
  
! #: cp/decl.c:11770
  #, gcc-internal-format
  msgid "%qD may not be declared as static"
  msgstr ""
  
! #: cp/decl.c:11779
  #, gcc-internal-format
  msgid ""
  "%qD is a usual (non-placement) deallocation function in C++14 (or with -"
  "fsized-deallocation)"
  msgstr ""
  
! #: cp/decl.c:11806
  #, gcc-internal-format
  msgid "%qD must be a nonstatic member function"
  msgstr ""
  
! #: cp/decl.c:11815
  #, gcc-internal-format
  msgid ""
  "%qD must be either a non-static member function or a non-member function"
  msgstr ""
  
! #: cp/decl.c:11837
  #, gcc-internal-format
  msgid "%qD must have an argument of class or enumerated type"
  msgstr ""
  
! #: cp/decl.c:11866
  #, gcc-internal-format
  msgid ""
  "conversion to a reference to void will never use a type conversion operator"
  msgstr ""
  
! #: cp/decl.c:11868
  #, gcc-internal-format
  msgid "conversion to void will never use a type conversion operator"
  msgstr ""
  
! #: cp/decl.c:11875
  #, gcc-internal-format
  msgid ""
  "conversion to a reference to the same type will never use a type conversion "
  "operator"
  msgstr ""
  
! #: cp/decl.c:11877
  #, gcc-internal-format
  msgid "conversion to the same type will never use a type conversion operator"
  msgstr ""
  
! #: cp/decl.c:11885
  #, gcc-internal-format
  msgid ""
  "conversion to a reference to a base class will never use a type conversion "
  "operator"
  msgstr ""
  
! #: cp/decl.c:11887
  #, gcc-internal-format
  msgid "conversion to a base class will never use a type conversion operator"
  msgstr ""
  
  #. 13.4.0.3
! #: cp/decl.c:11896
  #, gcc-internal-format
  msgid "ISO C++ prohibits overloading operator ?:"
  msgstr ""
  
! #: cp/decl.c:11901
  #, gcc-internal-format
  msgid "%qD must not have variable number of arguments"
  msgstr ""
  
! #: cp/decl.c:11952
  #, gcc-internal-format
  msgid "postfix %qD must take %<int%> as its argument"
  msgstr ""
  
! #: cp/decl.c:11955
  #, gcc-internal-format
  msgid "postfix %qD must take %<int%> as its second argument"
  msgstr ""
  
! #: cp/decl.c:11963
  #, gcc-internal-format
  msgid "%qD must take either zero or one argument"
  msgstr ""
  
! #: cp/decl.c:11965
  #, gcc-internal-format
  msgid "%qD must take either one or two arguments"
  msgstr ""
  
! #: cp/decl.c:11987
  #, gcc-internal-format
  msgid "prefix %qD should return %qT"
  msgstr ""
  
! #: cp/decl.c:11993
  #, gcc-internal-format
  msgid "postfix %qD should return %qT"
  msgstr ""
  
! #: cp/decl.c:12002
  #, gcc-internal-format
  msgid "%qD must take %<void%>"
  msgstr ""
  
! #: cp/decl.c:12004 cp/decl.c:12013
  #, gcc-internal-format
  msgid "%qD must take exactly one argument"
  msgstr ""
  
! #: cp/decl.c:12015
  #, gcc-internal-format
  msgid "%qD must take exactly two arguments"
  msgstr ""
  
! #: cp/decl.c:12024
  #, gcc-internal-format
  msgid "user-defined %qD always evaluates both arguments"
  msgstr ""
  
! #: cp/decl.c:12038
  #, gcc-internal-format
  msgid "%qD should return by value"
  msgstr ""
  
! #: cp/decl.c:12049 cp/decl.c:12054
  #, gcc-internal-format
  msgid "%qD cannot have default arguments"
  msgstr ""
  
! #: cp/decl.c:12112
  #, gcc-internal-format
  msgid "using template type parameter %qT after %qs"
  msgstr ""
  
! #: cp/decl.c:12135
  #, gcc-internal-format
  msgid "using alias template specialization %qT after %qs"
  msgstr ""
  
! #: cp/decl.c:12138
  #, gcc-internal-format
  msgid "using typedef-name %qD after %qs"
  msgstr ""
  
! #: cp/decl.c:12140
  #, gcc-internal-format
  msgid "%qD has a previous declaration here"
  msgstr ""
  
! #: cp/decl.c:12148
  #, gcc-internal-format
  msgid "%qT referred to as %qs"
  msgstr ""
  
! #: cp/decl.c:12149 cp/decl.c:12156
  #, gcc-internal-format
  msgid "%q+T has a previous declaration here"
  msgstr ""
  
! #: cp/decl.c:12155
  #, gcc-internal-format
  msgid "%qT referred to as enum"
  msgstr ""
--- 37088,37268 ----
  #. or implicitly defined), there's no need to worry about their
  #. existence.  Theoretically, they should never even be
  #. instantiated, but that's hard to forestall.
! #: cp/decl.c:11694
  #, gcc-internal-format
  msgid "invalid constructor; you probably meant %<%T (const %T&)%>"
  msgstr ""
  
! #: cp/decl.c:11816
  #, gcc-internal-format
  msgid "%qD may not be declared within a namespace"
  msgstr ""
  
! #: cp/decl.c:11821
  #, gcc-internal-format
  msgid "%qD may not be declared as static"
  msgstr ""
  
! #: cp/decl.c:11830
  #, gcc-internal-format
  msgid ""
  "%qD is a usual (non-placement) deallocation function in C++14 (or with -"
  "fsized-deallocation)"
  msgstr ""
  
! #: cp/decl.c:11857
  #, gcc-internal-format
  msgid "%qD must be a nonstatic member function"
  msgstr ""
  
! #: cp/decl.c:11866
  #, gcc-internal-format
  msgid ""
  "%qD must be either a non-static member function or a non-member function"
  msgstr ""
  
! #: cp/decl.c:11888
  #, gcc-internal-format
  msgid "%qD must have an argument of class or enumerated type"
  msgstr ""
  
! #: cp/decl.c:11917
  #, gcc-internal-format
  msgid ""
  "conversion to a reference to void will never use a type conversion operator"
  msgstr ""
  
! #: cp/decl.c:11919
  #, gcc-internal-format
  msgid "conversion to void will never use a type conversion operator"
  msgstr ""
  
! #: cp/decl.c:11926
  #, gcc-internal-format
  msgid ""
  "conversion to a reference to the same type will never use a type conversion "
  "operator"
  msgstr ""
  
! #: cp/decl.c:11928
  #, gcc-internal-format
  msgid "conversion to the same type will never use a type conversion operator"
  msgstr ""
  
! #: cp/decl.c:11936
  #, gcc-internal-format
  msgid ""
  "conversion to a reference to a base class will never use a type conversion "
  "operator"
  msgstr ""
  
! #: cp/decl.c:11938
  #, gcc-internal-format
  msgid "conversion to a base class will never use a type conversion operator"
  msgstr ""
  
  #. 13.4.0.3
! #: cp/decl.c:11947
  #, gcc-internal-format
  msgid "ISO C++ prohibits overloading operator ?:"
  msgstr ""
  
! #: cp/decl.c:11952
  #, gcc-internal-format
  msgid "%qD must not have variable number of arguments"
  msgstr ""
  
! #: cp/decl.c:12003
  #, gcc-internal-format
  msgid "postfix %qD must take %<int%> as its argument"
  msgstr ""
  
! #: cp/decl.c:12006
  #, gcc-internal-format
  msgid "postfix %qD must take %<int%> as its second argument"
  msgstr ""
  
! #: cp/decl.c:12014
  #, gcc-internal-format
  msgid "%qD must take either zero or one argument"
  msgstr ""
  
! #: cp/decl.c:12016
  #, gcc-internal-format
  msgid "%qD must take either one or two arguments"
  msgstr ""
  
! #: cp/decl.c:12038
  #, gcc-internal-format
  msgid "prefix %qD should return %qT"
  msgstr ""
  
! #: cp/decl.c:12044
  #, gcc-internal-format
  msgid "postfix %qD should return %qT"
  msgstr ""
  
! #: cp/decl.c:12053
  #, gcc-internal-format
  msgid "%qD must take %<void%>"
  msgstr ""
  
! #: cp/decl.c:12055 cp/decl.c:12064
  #, gcc-internal-format
  msgid "%qD must take exactly one argument"
  msgstr ""
  
! #: cp/decl.c:12066
  #, gcc-internal-format
  msgid "%qD must take exactly two arguments"
  msgstr ""
  
! #: cp/decl.c:12075
  #, gcc-internal-format
  msgid "user-defined %qD always evaluates both arguments"
  msgstr ""
  
! #: cp/decl.c:12089
  #, gcc-internal-format
  msgid "%qD should return by value"
  msgstr ""
  
! #: cp/decl.c:12100 cp/decl.c:12105
  #, gcc-internal-format
  msgid "%qD cannot have default arguments"
  msgstr ""
  
! #: cp/decl.c:12163
  #, gcc-internal-format
  msgid "using template type parameter %qT after %qs"
  msgstr ""
  
! #: cp/decl.c:12186
  #, gcc-internal-format
  msgid "using alias template specialization %qT after %qs"
  msgstr ""
  
! #: cp/decl.c:12189
  #, gcc-internal-format
  msgid "using typedef-name %qD after %qs"
  msgstr ""
  
! #: cp/decl.c:12191
  #, gcc-internal-format
  msgid "%qD has a previous declaration here"
  msgstr ""
  
! #: cp/decl.c:12199
  #, gcc-internal-format
  msgid "%qT referred to as %qs"
  msgstr ""
  
! #: cp/decl.c:12200 cp/decl.c:12207
  #, gcc-internal-format
  msgid "%q+T has a previous declaration here"
  msgstr ""
  
! #: cp/decl.c:12206
  #, gcc-internal-format
  msgid "%qT referred to as enum"
  msgstr ""
*************** msgstr ""
*** 37096,37183 ****
  #. void f(class C);		// No template header here
  #.
  #. then the required template argument is missing.
! #: cp/decl.c:12170
  #, gcc-internal-format
  msgid "template argument required for %<%s %T%>"
  msgstr ""
  
! #: cp/decl.c:12224 cp/name-lookup.c:3202
  #, gcc-internal-format
  msgid "%qD has the same name as the class in which it is declared"
  msgstr ""
  
! #: cp/decl.c:12254 cp/name-lookup.c:2692 cp/name-lookup.c:3530
! #: cp/name-lookup.c:3575 cp/parser.c:5513 cp/parser.c:22982
  #, gcc-internal-format
  msgid "reference to %qD is ambiguous"
  msgstr ""
  
! #: cp/decl.c:12375
  #, gcc-internal-format
  msgid "use of enum %q#D without previous declaration"
  msgstr ""
  
! #: cp/decl.c:12400
  #, gcc-internal-format
  msgid "redeclaration of %qT as a non-template"
  msgstr ""
  
! #: cp/decl.c:12401
  #, gcc-internal-format
  msgid "previous declaration %q+D"
  msgstr ""
  
! #: cp/decl.c:12542
  #, gcc-internal-format
  msgid "derived union %qT invalid"
  msgstr ""
  
! #: cp/decl.c:12551
  #, gcc-internal-format
  msgid "Java class %qT cannot have multiple bases"
  msgstr ""
  
! #: cp/decl.c:12562
  #, gcc-internal-format
  msgid "Java class %qT cannot have virtual bases"
  msgstr ""
  
! #: cp/decl.c:12582
  #, gcc-internal-format
  msgid "base type %qT fails to be a struct or class type"
  msgstr ""
  
! #: cp/decl.c:12615
  #, gcc-internal-format
  msgid "recursive type %qT undefined"
  msgstr ""
  
! #: cp/decl.c:12617
  #, gcc-internal-format
  msgid "duplicate base type %qT invalid"
  msgstr ""
  
! #: cp/decl.c:12741
  #, gcc-internal-format
  msgid "scoped/unscoped mismatch in enum %q#T"
  msgstr ""
  
! #: cp/decl.c:12744 cp/decl.c:12752 cp/decl.c:12764 cp/parser.c:15987
  #, gcc-internal-format
  msgid "previous definition here"
  msgstr ""
  
! #: cp/decl.c:12749
  #, gcc-internal-format
  msgid "underlying type mismatch in enum %q#T"
  msgstr ""
  
! #: cp/decl.c:12761
  #, gcc-internal-format
  msgid "different underlying type in enum %q#T"
  msgstr ""
  
! #: cp/decl.c:12828
  #, gcc-internal-format
  msgid "underlying type %<%T%> of %<%T%> must be an integral type"
  msgstr ""
--- 37274,37361 ----
  #. void f(class C);		// No template header here
  #.
  #. then the required template argument is missing.
! #: cp/decl.c:12221
  #, gcc-internal-format
  msgid "template argument required for %<%s %T%>"
  msgstr ""
  
! #: cp/decl.c:12275 cp/name-lookup.c:3202
  #, gcc-internal-format
  msgid "%qD has the same name as the class in which it is declared"
  msgstr ""
  
! #: cp/decl.c:12305 cp/name-lookup.c:2692 cp/name-lookup.c:3530
! #: cp/name-lookup.c:3575 cp/parser.c:5514 cp/parser.c:22986
  #, gcc-internal-format
  msgid "reference to %qD is ambiguous"
  msgstr ""
  
! #: cp/decl.c:12426
  #, gcc-internal-format
  msgid "use of enum %q#D without previous declaration"
  msgstr ""
  
! #: cp/decl.c:12451
  #, gcc-internal-format
  msgid "redeclaration of %qT as a non-template"
  msgstr ""
  
! #: cp/decl.c:12452
  #, gcc-internal-format
  msgid "previous declaration %q+D"
  msgstr ""
  
! #: cp/decl.c:12593
  #, gcc-internal-format
  msgid "derived union %qT invalid"
  msgstr ""
  
! #: cp/decl.c:12602
  #, gcc-internal-format
  msgid "Java class %qT cannot have multiple bases"
  msgstr ""
  
! #: cp/decl.c:12613
  #, gcc-internal-format
  msgid "Java class %qT cannot have virtual bases"
  msgstr ""
  
! #: cp/decl.c:12633
  #, gcc-internal-format
  msgid "base type %qT fails to be a struct or class type"
  msgstr ""
  
! #: cp/decl.c:12666
  #, gcc-internal-format
  msgid "recursive type %qT undefined"
  msgstr ""
  
! #: cp/decl.c:12668
  #, gcc-internal-format
  msgid "duplicate base type %qT invalid"
  msgstr ""
  
! #: cp/decl.c:12792
  #, gcc-internal-format
  msgid "scoped/unscoped mismatch in enum %q#T"
  msgstr ""
  
! #: cp/decl.c:12795 cp/decl.c:12803 cp/decl.c:12815 cp/parser.c:15988
  #, gcc-internal-format
  msgid "previous definition here"
  msgstr ""
  
! #: cp/decl.c:12800
  #, gcc-internal-format
  msgid "underlying type mismatch in enum %q#T"
  msgstr ""
  
! #: cp/decl.c:12812
  #, gcc-internal-format
  msgid "different underlying type in enum %q#T"
  msgstr ""
  
! #: cp/decl.c:12879
  #, gcc-internal-format
  msgid "underlying type %<%T%> of %<%T%> must be an integral type"
  msgstr ""
*************** msgstr ""
*** 37186,37329 ****
  #.
  #. IF no integral type can represent all the enumerator values, the
  #. enumeration is ill-formed.
! #: cp/decl.c:12962
  #, gcc-internal-format
  msgid "no integral type can represent all of the enumerator values for %qT"
  msgstr ""
  
! #: cp/decl.c:13124
  #, gcc-internal-format
  msgid "enumerator value for %qD is not an integer constant"
  msgstr ""
  
! #: cp/decl.c:13171
  #, gcc-internal-format
  msgid "incremented enumerator value is too large for %<unsigned long%>"
  msgstr ""
  
! #: cp/decl.c:13183
  #, gcc-internal-format
  msgid "overflow in enumeration values at %qD"
  msgstr ""
  
! #: cp/decl.c:13203
  #, gcc-internal-format
  msgid "enumerator value %E is outside the range of underlying type %<%T%>"
  msgstr ""
  
! #: cp/decl.c:13293
  #, gcc-internal-format
  msgid "return type %q#T is incomplete"
  msgstr ""
  
! #: cp/decl.c:13295
  #, gcc-internal-format
  msgid "return type has Java class type %q#T"
  msgstr ""
  
! #: cp/decl.c:13419 cp/typeck.c:8605
  #, gcc-internal-format
  msgid "%<operator=%> should return a reference to %<*this%>"
  msgstr ""
  
! #: cp/decl.c:13519
  #, gcc-internal-format
  msgid "no previous declaration for %q+D"
  msgstr ""
  
! #: cp/decl.c:13743
  #, gcc-internal-format
  msgid "invalid function declaration"
  msgstr ""
  
! #: cp/decl.c:13825
  #, gcc-internal-format
  msgid "parameter %qD declared void"
  msgstr ""
  
! #: cp/decl.c:14215
  #, gcc-internal-format
  msgid "no return statements in function returning %qT"
  msgstr ""
  
! #: cp/decl.c:14217 cp/typeck.c:8488
  #, gcc-internal-format
  msgid "only plain %<auto%> return type can be deduced to %<void%>"
  msgstr ""
  
! #: cp/decl.c:14315
  #, gcc-internal-format
  msgid "parameter %q+D set but not used"
  msgstr ""
  
! #: cp/decl.c:14411
  #, gcc-internal-format
  msgid "invalid member function declaration"
  msgstr ""
  
! #: cp/decl.c:14425
  #, gcc-internal-format
  msgid "%qD is already defined in class %qT"
  msgstr ""
  
! #: cp/decl.c:14792 cp/decl2.c:4990 cp/decl2.c:5047
  #, gcc-internal-format
  msgid "use of %qD before deduction of %<auto%>"
  msgstr ""
  
! #: cp/decl2.c:344
  #, gcc-internal-format
  msgid "name missing for member function"
  msgstr ""
  
! #: cp/decl2.c:420 cp/decl2.c:434
  #, gcc-internal-format
  msgid "ambiguous conversion for array subscript"
  msgstr ""
  
! #: cp/decl2.c:428
  #, gcc-internal-format
  msgid "invalid types %<%T[%T]%> for array subscript"
  msgstr ""
  
! #: cp/decl2.c:471
  #, gcc-internal-format
  msgid "deleting array %q#E"
  msgstr ""
  
! #: cp/decl2.c:477
  #, gcc-internal-format
  msgid "type %q#T argument given to %<delete%>, expected pointer"
  msgstr ""
  
! #: cp/decl2.c:489
  #, gcc-internal-format
  msgid ""
  "cannot delete a function.  Only pointer-to-objects are valid arguments to "
  "%<delete%>"
  msgstr ""
  
! #: cp/decl2.c:497
  #, gcc-internal-format
  msgid "deleting %qT is undefined"
  msgstr ""
  
! #: cp/decl2.c:545 cp/pt.c:4843
  #, gcc-internal-format
  msgid "template declaration of %q#D"
  msgstr ""
  
! #: cp/decl2.c:597
  #, gcc-internal-format
  msgid "Java method %qD has non-Java return type %qT"
  msgstr ""
  
! #: cp/decl2.c:614
  #, gcc-internal-format
  msgid "Java method %qD has non-Java parameter type %qT"
  msgstr ""
  
! #: cp/decl2.c:663
  #, gcc-internal-format
  msgid ""
  "template parameter lists provided don%'t match the template parameters of %qD"
--- 37364,37507 ----
  #.
  #. IF no integral type can represent all the enumerator values, the
  #. enumeration is ill-formed.
! #: cp/decl.c:13013
  #, gcc-internal-format
  msgid "no integral type can represent all of the enumerator values for %qT"
  msgstr ""
  
! #: cp/decl.c:13175
  #, gcc-internal-format
  msgid "enumerator value for %qD is not an integer constant"
  msgstr ""
  
! #: cp/decl.c:13222
  #, gcc-internal-format
  msgid "incremented enumerator value is too large for %<unsigned long%>"
  msgstr ""
  
! #: cp/decl.c:13234
  #, gcc-internal-format
  msgid "overflow in enumeration values at %qD"
  msgstr ""
  
! #: cp/decl.c:13254
  #, gcc-internal-format
  msgid "enumerator value %E is outside the range of underlying type %<%T%>"
  msgstr ""
  
! #: cp/decl.c:13344
  #, gcc-internal-format
  msgid "return type %q#T is incomplete"
  msgstr ""
  
! #: cp/decl.c:13346
  #, gcc-internal-format
  msgid "return type has Java class type %q#T"
  msgstr ""
  
! #: cp/decl.c:13470 cp/typeck.c:8624
  #, gcc-internal-format
  msgid "%<operator=%> should return a reference to %<*this%>"
  msgstr ""
  
! #: cp/decl.c:13570
  #, gcc-internal-format
  msgid "no previous declaration for %q+D"
  msgstr ""
  
! #: cp/decl.c:13794
  #, gcc-internal-format
  msgid "invalid function declaration"
  msgstr ""
  
! #: cp/decl.c:13876
  #, gcc-internal-format
  msgid "parameter %qD declared void"
  msgstr ""
  
! #: cp/decl.c:14268
  #, gcc-internal-format
  msgid "no return statements in function returning %qT"
  msgstr ""
  
! #: cp/decl.c:14270 cp/typeck.c:8507
  #, gcc-internal-format
  msgid "only plain %<auto%> return type can be deduced to %<void%>"
  msgstr ""
  
! #: cp/decl.c:14368
  #, gcc-internal-format
  msgid "parameter %q+D set but not used"
  msgstr ""
  
! #: cp/decl.c:14464
  #, gcc-internal-format
  msgid "invalid member function declaration"
  msgstr ""
  
! #: cp/decl.c:14478
  #, gcc-internal-format
  msgid "%qD is already defined in class %qT"
  msgstr ""
  
! #: cp/decl.c:14853 cp/decl2.c:5080 cp/decl2.c:5137
  #, gcc-internal-format
  msgid "use of %qD before deduction of %<auto%>"
  msgstr ""
  
! #: cp/decl2.c:353
  #, gcc-internal-format
  msgid "name missing for member function"
  msgstr ""
  
! #: cp/decl2.c:429 cp/decl2.c:443
  #, gcc-internal-format
  msgid "ambiguous conversion for array subscript"
  msgstr ""
  
! #: cp/decl2.c:437
  #, gcc-internal-format
  msgid "invalid types %<%T[%T]%> for array subscript"
  msgstr ""
  
! #: cp/decl2.c:480
  #, gcc-internal-format
  msgid "deleting array %q#E"
  msgstr ""
  
! #: cp/decl2.c:486
  #, gcc-internal-format
  msgid "type %q#T argument given to %<delete%>, expected pointer"
  msgstr ""
  
! #: cp/decl2.c:498
  #, gcc-internal-format
  msgid ""
  "cannot delete a function.  Only pointer-to-objects are valid arguments to "
  "%<delete%>"
  msgstr ""
  
! #: cp/decl2.c:506
  #, gcc-internal-format
  msgid "deleting %qT is undefined"
  msgstr ""
  
! #: cp/decl2.c:554 cp/pt.c:4851
  #, gcc-internal-format
  msgid "template declaration of %q#D"
  msgstr ""
  
! #: cp/decl2.c:606
  #, gcc-internal-format
  msgid "Java method %qD has non-Java return type %qT"
  msgstr ""
  
! #: cp/decl2.c:623
  #, gcc-internal-format
  msgid "Java method %qD has non-Java parameter type %qT"
  msgstr ""
  
! #: cp/decl2.c:672
  #, gcc-internal-format
  msgid ""
  "template parameter lists provided don%'t match the template parameters of %qD"
*************** msgstr ""
*** 37332,37448 ****
  #. [temp.mem]
  #.
  #. A destructor shall not be a member template.
! #: cp/decl2.c:678 cp/pt.c:4813
  #, gcc-internal-format
  msgid "destructor %qD declared as member template"
  msgstr ""
  
! #: cp/decl2.c:749
  #, gcc-internal-format
  msgid "prototype for %q#D does not match any in class %qT"
  msgstr ""
  
! #: cp/decl2.c:835
  #, gcc-internal-format
  msgid "local class %q#T shall not have static data member %q#D"
  msgstr ""
  
! #: cp/decl2.c:843
  #, gcc-internal-format
  msgid "static data member %qD in unnamed class"
  msgstr ""
  
! #: cp/decl2.c:845
  #, gcc-internal-format
  msgid "unnamed class defined here"
  msgstr ""
  
! #: cp/decl2.c:904
  #, gcc-internal-format
  msgid "explicit template argument list not allowed"
  msgstr ""
  
! #: cp/decl2.c:910
  #, gcc-internal-format
  msgid "member %qD conflicts with virtual function table field name"
  msgstr ""
  
! #: cp/decl2.c:952
  #, gcc-internal-format
  msgid "%qD is already defined in %qT"
  msgstr ""
  
! #: cp/decl2.c:979 cp/decl2.c:987
  #, gcc-internal-format
  msgid "invalid initializer for member function %qD"
  msgstr ""
  
! #: cp/decl2.c:994
  #, gcc-internal-format
  msgid "initializer specified for friend function %qD"
  msgstr ""
  
! #: cp/decl2.c:997
  #, gcc-internal-format
  msgid "initializer specified for static member function %qD"
  msgstr ""
  
! #: cp/decl2.c:1041
  #, gcc-internal-format
  msgid "%<asm%> specifiers are not permitted on non-static data members"
  msgstr ""
  
! #: cp/decl2.c:1094
  #, gcc-internal-format
  msgid "bit-field %qD with non-integral type"
  msgstr ""
  
! #: cp/decl2.c:1100
  #, gcc-internal-format
  msgid "cannot declare %qD to be a bit-field type"
  msgstr ""
  
! #: cp/decl2.c:1110
  #, gcc-internal-format
  msgid "cannot declare bit-field %qD with function type"
  msgstr ""
  
! #: cp/decl2.c:1117
  #, gcc-internal-format
  msgid "%qD is already defined in the class %qT"
  msgstr ""
  
! #: cp/decl2.c:1124
  #, gcc-internal-format
  msgid "static member %qD cannot be a bit-field"
  msgstr ""
  
! #: cp/decl2.c:1134
  #, gcc-internal-format
  msgid "width of bit-field %qD has non-integral type %qT"
  msgstr ""
  
! #: cp/decl2.c:1453
  #, gcc-internal-format
  msgid "%q+D static data member inside of declare target directive"
  msgstr ""
  
! #: cp/decl2.c:1522
  #, gcc-internal-format
  msgid "anonymous struct not inside named type"
  msgstr ""
  
! #: cp/decl2.c:1610
  #, gcc-internal-format
  msgid "namespace-scope anonymous aggregates must be static"
  msgstr ""
  
! #: cp/decl2.c:1619
  #, gcc-internal-format
  msgid "anonymous union with no members"
  msgstr ""
  
! #: cp/decl2.c:1652
  #, gcc-internal-format
  msgid "%<operator new%> must return type %qT"
  msgstr ""
--- 37510,37626 ----
  #. [temp.mem]
  #.
  #. A destructor shall not be a member template.
! #: cp/decl2.c:687 cp/pt.c:4821
  #, gcc-internal-format
  msgid "destructor %qD declared as member template"
  msgstr ""
  
! #: cp/decl2.c:758
  #, gcc-internal-format
  msgid "prototype for %q#D does not match any in class %qT"
  msgstr ""
  
! #: cp/decl2.c:844
  #, gcc-internal-format
  msgid "local class %q#T shall not have static data member %q#D"
  msgstr ""
  
! #: cp/decl2.c:852
  #, gcc-internal-format
  msgid "static data member %qD in unnamed class"
  msgstr ""
  
! #: cp/decl2.c:854
  #, gcc-internal-format
  msgid "unnamed class defined here"
  msgstr ""
  
! #: cp/decl2.c:913
  #, gcc-internal-format
  msgid "explicit template argument list not allowed"
  msgstr ""
  
! #: cp/decl2.c:919
  #, gcc-internal-format
  msgid "member %qD conflicts with virtual function table field name"
  msgstr ""
  
! #: cp/decl2.c:961
  #, gcc-internal-format
  msgid "%qD is already defined in %qT"
  msgstr ""
  
! #: cp/decl2.c:988 cp/decl2.c:996
  #, gcc-internal-format
  msgid "invalid initializer for member function %qD"
  msgstr ""
  
! #: cp/decl2.c:1003
  #, gcc-internal-format
  msgid "initializer specified for friend function %qD"
  msgstr ""
  
! #: cp/decl2.c:1006
  #, gcc-internal-format
  msgid "initializer specified for static member function %qD"
  msgstr ""
  
! #: cp/decl2.c:1050
  #, gcc-internal-format
  msgid "%<asm%> specifiers are not permitted on non-static data members"
  msgstr ""
  
! #: cp/decl2.c:1103
  #, gcc-internal-format
  msgid "bit-field %qD with non-integral type"
  msgstr ""
  
! #: cp/decl2.c:1109
  #, gcc-internal-format
  msgid "cannot declare %qD to be a bit-field type"
  msgstr ""
  
! #: cp/decl2.c:1119
  #, gcc-internal-format
  msgid "cannot declare bit-field %qD with function type"
  msgstr ""
  
! #: cp/decl2.c:1126
  #, gcc-internal-format
  msgid "%qD is already defined in the class %qT"
  msgstr ""
  
! #: cp/decl2.c:1133
  #, gcc-internal-format
  msgid "static member %qD cannot be a bit-field"
  msgstr ""
  
! #: cp/decl2.c:1143
  #, gcc-internal-format
  msgid "width of bit-field %qD has non-integral type %qT"
  msgstr ""
  
! #: cp/decl2.c:1462
  #, gcc-internal-format
  msgid "%q+D static data member inside of declare target directive"
  msgstr ""
  
! #: cp/decl2.c:1531
  #, gcc-internal-format
  msgid "anonymous struct not inside named type"
  msgstr ""
  
! #: cp/decl2.c:1619
  #, gcc-internal-format
  msgid "namespace-scope anonymous aggregates must be static"
  msgstr ""
  
! #: cp/decl2.c:1628
  #, gcc-internal-format
  msgid "anonymous union with no members"
  msgstr ""
  
! #: cp/decl2.c:1661
  #, gcc-internal-format
  msgid "%<operator new%> must return type %qT"
  msgstr ""
*************** msgstr ""
*** 37451,37497 ****
  #.
  #. The first parameter shall not have an associated default
  #. argument.
! #: cp/decl2.c:1663
  #, gcc-internal-format
  msgid "the first parameter of %<operator new%> cannot have a default argument"
  msgstr ""
  
! #: cp/decl2.c:1679
  #, gcc-internal-format
  msgid "%<operator new%> takes type %<size_t%> (%qT) as first parameter"
  msgstr ""
  
! #: cp/decl2.c:1708
  #, gcc-internal-format
  msgid "%<operator delete%> must return type %qT"
  msgstr ""
  
! #: cp/decl2.c:1717
  #, gcc-internal-format
  msgid "%<operator delete%> takes type %qT as first parameter"
  msgstr ""
  
! #: cp/decl2.c:2559
  #, gcc-internal-format
  msgid "%qT has a field %qD whose type uses the anonymous namespace"
  msgstr ""
  
! #: cp/decl2.c:2566
  #, gcc-internal-format
  msgid "%qT declared with greater visibility than the type of its field %qD"
  msgstr ""
  
! #: cp/decl2.c:2579
  #, gcc-internal-format
  msgid "%qT has a base %qT whose type uses the anonymous namespace"
  msgstr ""
  
! #: cp/decl2.c:2585
  #, gcc-internal-format
  msgid "%qT declared with greater visibility than its base %qT"
  msgstr ""
  
! #: cp/decl2.c:4213
  #, gcc-internal-format
  msgid "%q#D, declared using anonymous type, is used but never defined"
  msgstr ""
--- 37629,37675 ----
  #.
  #. The first parameter shall not have an associated default
  #. argument.
! #: cp/decl2.c:1672
  #, gcc-internal-format
  msgid "the first parameter of %<operator new%> cannot have a default argument"
  msgstr ""
  
! #: cp/decl2.c:1688
  #, gcc-internal-format
  msgid "%<operator new%> takes type %<size_t%> (%qT) as first parameter"
  msgstr ""
  
! #: cp/decl2.c:1717
  #, gcc-internal-format
  msgid "%<operator delete%> must return type %qT"
  msgstr ""
  
! #: cp/decl2.c:1726
  #, gcc-internal-format
  msgid "%<operator delete%> takes type %qT as first parameter"
  msgstr ""
  
! #: cp/decl2.c:2571
  #, gcc-internal-format
  msgid "%qT has a field %qD whose type uses the anonymous namespace"
  msgstr ""
  
! #: cp/decl2.c:2578
  #, gcc-internal-format
  msgid "%qT declared with greater visibility than the type of its field %qD"
  msgstr ""
  
! #: cp/decl2.c:2591
  #, gcc-internal-format
  msgid "%qT has a base %qT whose type uses the anonymous namespace"
  msgstr ""
  
! #: cp/decl2.c:2597
  #, gcc-internal-format
  msgid "%qT declared with greater visibility than its base %qT"
  msgstr ""
  
! #: cp/decl2.c:4234
  #, gcc-internal-format
  msgid "%q#D, declared using anonymous type, is used but never defined"
  msgstr ""
*************** msgstr ""
*** 37500,37674 ****
  #. no linkage can only be used to declare extern "C"
  #. entities.  Since it's not always an error in the
  #. ISO C++ 90 Standard, we only issue a warning.
! #: cp/decl2.c:4222
  #, gcc-internal-format
  msgid ""
  "anonymous type with no linkage used to declare variable %q#D with linkage"
  msgstr ""
  
! #: cp/decl2.c:4226
  #, gcc-internal-format
  msgid ""
  "anonymous type with no linkage used to declare function %q#D with linkage"
  msgstr ""
  
! #: cp/decl2.c:4230
  #, gcc-internal-format
  msgid ""
  "%q#D does not refer to the unqualified type, so it is not used for linkage"
  msgstr ""
  
! #: cp/decl2.c:4235
  #, gcc-internal-format
  msgid "%q#D, declared using local type %qT, is used but never defined"
  msgstr ""
  
! #: cp/decl2.c:4238
  #, gcc-internal-format
  msgid "type %qT with no linkage used to declare variable %q#D with linkage"
  msgstr ""
  
! #: cp/decl2.c:4241
  #, gcc-internal-format
  msgid "type %qT with no linkage used to declare function %q#D with linkage"
  msgstr ""
  
! #: cp/decl2.c:4362 cp/decl2.c:4365
  #, gcc-internal-format
  msgid "the program should also define %qD"
  msgstr ""
  
! #: cp/decl2.c:4700
  #, gcc-internal-format
  msgid "inline function %q+D used but never defined"
  msgstr ""
  
! #: cp/decl2.c:4898
  #, gcc-internal-format
  msgid "default argument missing for parameter %P of %q+#D"
  msgstr ""
  
  #. We mark a lambda conversion op as deleted if we can't
  #. generate it properly; see maybe_add_lambda_conv_op.
! #: cp/decl2.c:4962
  #, gcc-internal-format
  msgid "converting lambda which uses %<...%> to function pointer"
  msgstr ""
  
! #: cp/decl2.c:4969
  #, gcc-internal-format
  msgid "use of deleted function %qD"
  msgstr ""
  
! #: cp/error.c:1446
  #, gcc-internal-format
  msgid "with"
  msgstr ""
  
! #: cp/error.c:3538
  #, gcc-internal-format
  msgid ""
  "extended initializer lists only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3543
  #, gcc-internal-format
  msgid ""
  "explicit conversion operators only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3548
  #, gcc-internal-format
  msgid "variadic templates only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3553
  #, gcc-internal-format
  msgid "lambda expressions only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3558
  #, gcc-internal-format
  msgid "C++11 auto only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3562
  #, gcc-internal-format
  msgid "scoped enums only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3566
  #, gcc-internal-format
  msgid ""
  "defaulted and deleted functions only available with -std=c++11 or -std=gnu+"
  "+11"
  msgstr ""
  
! #: cp/error.c:3571
  #, gcc-internal-format
  msgid "inline namespaces only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3576
  #, gcc-internal-format
  msgid ""
  "override controls (override/final) only available with -std=c++11 or -std=gnu"
  "++11"
  msgstr ""
  
! #: cp/error.c:3581
  #, gcc-internal-format
  msgid ""
  "non-static data member initializers only available with -std=c++11 or -"
  "std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3586
  #, gcc-internal-format
  msgid "user-defined literals only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3591
  #, gcc-internal-format
  msgid "delegating constructors only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3596
  #, gcc-internal-format
  msgid "inheriting constructors only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3601
  #, gcc-internal-format
  msgid "c++11 attributes only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3606
  #, gcc-internal-format
  msgid "ref-qualifiers only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3655
  #, gcc-internal-format
  msgid "incomplete type %qT used in nested name specifier"
  msgstr ""
  
! #: cp/error.c:3659
  #, gcc-internal-format
  msgid "reference to %<%T::%D%> is ambiguous"
  msgstr ""
  
! #: cp/error.c:3664 cp/typeck.c:2321
  #, gcc-internal-format
  msgid "%qD is not a member of %qT"
  msgstr ""
  
! #: cp/error.c:3668
  #, gcc-internal-format
  msgid "%qD is not a member of %qD"
  msgstr ""
  
! #: cp/error.c:3673
  #, gcc-internal-format
  msgid "%<::%D%> has not been declared"
  msgstr ""
--- 37678,37852 ----
  #. no linkage can only be used to declare extern "C"
  #. entities.  Since it's not always an error in the
  #. ISO C++ 90 Standard, we only issue a warning.
! #: cp/decl2.c:4243
  #, gcc-internal-format
  msgid ""
  "anonymous type with no linkage used to declare variable %q#D with linkage"
  msgstr ""
  
! #: cp/decl2.c:4247
  #, gcc-internal-format
  msgid ""
  "anonymous type with no linkage used to declare function %q#D with linkage"
  msgstr ""
  
! #: cp/decl2.c:4251
  #, gcc-internal-format
  msgid ""
  "%q#D does not refer to the unqualified type, so it is not used for linkage"
  msgstr ""
  
! #: cp/decl2.c:4259
  #, gcc-internal-format
  msgid "%q#D, declared using local type %qT, is used but never defined"
  msgstr ""
  
! #: cp/decl2.c:4263
  #, gcc-internal-format
  msgid "type %qT with no linkage used to declare variable %q#D with linkage"
  msgstr ""
  
! #: cp/decl2.c:4266
  #, gcc-internal-format
  msgid "type %qT with no linkage used to declare function %q#D with linkage"
  msgstr ""
  
! #: cp/decl2.c:4450 cp/decl2.c:4453
  #, gcc-internal-format
  msgid "the program should also define %qD"
  msgstr ""
  
! #: cp/decl2.c:4790
  #, gcc-internal-format
  msgid "inline function %q+D used but never defined"
  msgstr ""
  
! #: cp/decl2.c:4988
  #, gcc-internal-format
  msgid "default argument missing for parameter %P of %q+#D"
  msgstr ""
  
  #. We mark a lambda conversion op as deleted if we can't
  #. generate it properly; see maybe_add_lambda_conv_op.
! #: cp/decl2.c:5052
  #, gcc-internal-format
  msgid "converting lambda which uses %<...%> to function pointer"
  msgstr ""
  
! #: cp/decl2.c:5059
  #, gcc-internal-format
  msgid "use of deleted function %qD"
  msgstr ""
  
! #: cp/error.c:1447
  #, gcc-internal-format
  msgid "with"
  msgstr ""
  
! #: cp/error.c:3539
  #, gcc-internal-format
  msgid ""
  "extended initializer lists only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3544
  #, gcc-internal-format
  msgid ""
  "explicit conversion operators only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3549
  #, gcc-internal-format
  msgid "variadic templates only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3554
  #, gcc-internal-format
  msgid "lambda expressions only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3559
  #, gcc-internal-format
  msgid "C++11 auto only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3563
  #, gcc-internal-format
  msgid "scoped enums only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3567
  #, gcc-internal-format
  msgid ""
  "defaulted and deleted functions only available with -std=c++11 or -std=gnu+"
  "+11"
  msgstr ""
  
! #: cp/error.c:3572
  #, gcc-internal-format
  msgid "inline namespaces only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3577
  #, gcc-internal-format
  msgid ""
  "override controls (override/final) only available with -std=c++11 or -std=gnu"
  "++11"
  msgstr ""
  
! #: cp/error.c:3582
  #, gcc-internal-format
  msgid ""
  "non-static data member initializers only available with -std=c++11 or -"
  "std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3587
  #, gcc-internal-format
  msgid "user-defined literals only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3592
  #, gcc-internal-format
  msgid "delegating constructors only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3597
  #, gcc-internal-format
  msgid "inheriting constructors only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3602
  #, gcc-internal-format
  msgid "c++11 attributes only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3607
  #, gcc-internal-format
  msgid "ref-qualifiers only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/error.c:3656
  #, gcc-internal-format
  msgid "incomplete type %qT used in nested name specifier"
  msgstr ""
  
! #: cp/error.c:3660
  #, gcc-internal-format
  msgid "reference to %<%T::%D%> is ambiguous"
  msgstr ""
  
! #: cp/error.c:3665 cp/typeck.c:2322
  #, gcc-internal-format
  msgid "%qD is not a member of %qT"
  msgstr ""
  
! #: cp/error.c:3669
  #, gcc-internal-format
  msgid "%qD is not a member of %qD"
  msgstr ""
  
! #: cp/error.c:3674
  #, gcc-internal-format
  msgid "%<::%D%> has not been declared"
  msgstr ""
*************** msgstr ""
*** 37705,37711 ****
  msgid "throwing NULL, which has integral, not pointer type"
  msgstr ""
  
! #: cp/except.c:754 cp/init.c:2531
  #, gcc-internal-format
  msgid "%qD should never be overloaded"
  msgstr ""
--- 37883,37889 ----
  msgid "throwing NULL, which has integral, not pointer type"
  msgstr ""
  
! #: cp/except.c:754 cp/init.c:2549
  #, gcc-internal-format
  msgid "%qD should never be overloaded"
  msgstr ""
*************** msgstr ""
*** 37732,37758 ****
  msgid "cannot catch type %qT because it involves types of variable size"
  msgstr ""
  
! #: cp/except.c:1093
  #, gcc-internal-format
  msgid "exception of type %qT will be caught"
  msgstr ""
  
! #: cp/except.c:1096
  #, gcc-internal-format
  msgid "   by earlier handler for %qT"
  msgstr ""
  
! #: cp/except.c:1125
  #, gcc-internal-format
  msgid "%<...%> handler must be the last handler for its try block"
  msgstr ""
  
! #: cp/except.c:1205
  #, gcc-internal-format
  msgid "noexcept-expression evaluates to %<false%> because of a call to %qD"
  msgstr ""
  
! #: cp/except.c:1207
  #, gcc-internal-format
  msgid "but %q+D does not throw; perhaps it should be declared %<noexcept%>"
  msgstr ""
--- 37910,37936 ----
  msgid "cannot catch type %qT because it involves types of variable size"
  msgstr ""
  
! #: cp/except.c:1094
  #, gcc-internal-format
  msgid "exception of type %qT will be caught"
  msgstr ""
  
! #: cp/except.c:1097
  #, gcc-internal-format
  msgid "   by earlier handler for %qT"
  msgstr ""
  
! #: cp/except.c:1126
  #, gcc-internal-format
  msgid "%<...%> handler must be the last handler for its try block"
  msgstr ""
  
! #: cp/except.c:1206
  #, gcc-internal-format
  msgid "noexcept-expression evaluates to %<false%> because of a call to %qD"
  msgstr ""
  
! #: cp/except.c:1208
  #, gcc-internal-format
  msgid "but %q+D does not throw; perhaps it should be declared %<noexcept%>"
  msgstr ""
*************** msgstr ""
*** 37894,38202 ****
  msgid "invalid initializer for array member %q#D"
  msgstr ""
  
! #: cp/init.c:743 cp/init.c:767 cp/init.c:2208 cp/method.c:1234
  #, gcc-internal-format
  msgid "uninitialized const member in %q#T"
  msgstr ""
  
! #: cp/init.c:745 cp/init.c:762 cp/init.c:769 cp/init.c:2193 cp/init.c:2221
! #: cp/method.c:1237 cp/method.c:1248
  #, gcc-internal-format
  msgid "%q#D should be initialized"
  msgstr ""
  
! #: cp/init.c:760 cp/init.c:2180 cp/method.c:1245
  #, gcc-internal-format
  msgid "uninitialized reference member in %q#T"
  msgstr ""
  
! #: cp/init.c:926
  #, gcc-internal-format
  msgid "%q+D will be initialized after"
  msgstr ""
  
! #: cp/init.c:929
  #, gcc-internal-format
  msgid "base %qT will be initialized after"
  msgstr ""
  
! #: cp/init.c:932
  #, gcc-internal-format
  msgid "  %q+#D"
  msgstr ""
  
! #: cp/init.c:934
  #, gcc-internal-format
  msgid "  base %qT"
  msgstr ""
  
! #: cp/init.c:936
  #, gcc-internal-format
  msgid "  when initialized here"
  msgstr ""
  
! #: cp/init.c:953
  #, gcc-internal-format
  msgid "multiple initializations given for %qD"
  msgstr ""
  
! #: cp/init.c:957
  #, gcc-internal-format
  msgid "multiple initializations given for base %qT"
  msgstr ""
  
! #: cp/init.c:1043
  #, gcc-internal-format
  msgid "initializations for multiple members of %qT"
  msgstr ""
  
! #: cp/init.c:1122
  #, gcc-internal-format
  msgid ""
  "base class %q#T should be explicitly initialized in the copy constructor"
  msgstr ""
  
! #: cp/init.c:1346 cp/init.c:1365
  #, gcc-internal-format
  msgid "class %qT does not have any field named %qD"
  msgstr ""
  
! #: cp/init.c:1352
  #, gcc-internal-format
  msgid ""
  "%q#D is a static data member; it can only be initialized at its definition"
  msgstr ""
  
! #: cp/init.c:1359
  #, gcc-internal-format
  msgid "%q#D is not a non-static data member of %qT"
  msgstr ""
  
! #: cp/init.c:1398
  #, gcc-internal-format
  msgid "unnamed initializer for %qT, which has no base classes"
  msgstr ""
  
! #: cp/init.c:1406
  #, gcc-internal-format
  msgid "unnamed initializer for %qT, which uses multiple inheritance"
  msgstr ""
  
! #: cp/init.c:1453
  #, gcc-internal-format
  msgid "%qD is both a direct base and an indirect virtual base"
  msgstr ""
  
! #: cp/init.c:1461
  #, gcc-internal-format
  msgid "type %qT is not a direct or virtual base of %qT"
  msgstr ""
  
! #: cp/init.c:1464
  #, gcc-internal-format
  msgid "type %qT is not a direct base of %qT"
  msgstr ""
  
! #: cp/init.c:1549
  #, gcc-internal-format
  msgid "bad array initializer"
  msgstr ""
  
! #: cp/init.c:1845 cp/semantics.c:3037
  #, gcc-internal-format
  msgid "%qT is not a class type"
  msgstr ""
  
! #: cp/init.c:1901
  #, gcc-internal-format
  msgid "incomplete type %qT does not have member %qD"
  msgstr ""
  
! #: cp/init.c:1915
  #, gcc-internal-format
  msgid "invalid pointer to bit-field %qD"
  msgstr ""
  
! #: cp/init.c:1996
  #, gcc-internal-format
  msgid "invalid use of non-static member function %qD"
  msgstr ""
  
! #: cp/init.c:2003 cp/semantics.c:1741
  #, gcc-internal-format
  msgid "invalid use of non-static data member %qD"
  msgstr ""
  
! #: cp/init.c:2177
  #, gcc-internal-format
  msgid ""
  "uninitialized reference member in %q#T using %<new%> without new-initializer"
  msgstr ""
  
! #: cp/init.c:2185
  #, gcc-internal-format
  msgid ""
  "uninitialized reference member in base %q#T of %q#T using %<new%> without "
  "new-initializer"
  msgstr ""
  
! #: cp/init.c:2189
  #, gcc-internal-format
  msgid "uninitialized reference member in base %q#T of %q#T"
  msgstr ""
  
! #: cp/init.c:2205
  #, gcc-internal-format
  msgid ""
  "uninitialized const member in %q#T using %<new%> without new-initializer"
  msgstr ""
  
! #: cp/init.c:2213
  #, gcc-internal-format
  msgid ""
  "uninitialized const member in base %q#T of %q#T using %<new%> without new-"
  "initializer"
  msgstr ""
  
! #: cp/init.c:2217
  #, gcc-internal-format
  msgid "uninitialized const member in base %q#T of %q#T"
  msgstr ""
  
! #: cp/init.c:2345
  #, gcc-internal-format
  msgid "integer overflow in array size"
  msgstr ""
  
! #: cp/init.c:2355
  #, gcc-internal-format
  msgid "array size in new-expression must be constant"
  msgstr ""
  
! #: cp/init.c:2369
  #, gcc-internal-format
  msgid "variably modified type not allowed in new-expression"
  msgstr ""
  
! #: cp/init.c:2400
  #, gcc-internal-format
  msgid "invalid type %<void%> for new"
  msgstr ""
  
! #: cp/init.c:2443
  #, gcc-internal-format
  msgid "uninitialized const in %<new%> of %q#T"
  msgstr ""
  
! #: cp/init.c:2512
  #, gcc-internal-format
  msgid "%qT isn%'t a valid Java class type"
  msgstr ""
  
! #: cp/init.c:2525
  #, gcc-internal-format
  msgid "call to Java constructor with %qs undefined"
  msgstr ""
  
! #: cp/init.c:2541
  #, gcc-internal-format
  msgid "Java class %q#T object allocated using placement new"
  msgstr ""
  
! #: cp/init.c:2583
  #, gcc-internal-format
  msgid "no suitable %qD found in class %qT"
  msgstr ""
  
! #: cp/init.c:2590 cp/search.c:1122
  #, gcc-internal-format
  msgid "request for member %qD is ambiguous"
  msgstr ""
  
! #: cp/init.c:2809
  #, gcc-internal-format
  msgid "parenthesized initializer in array new"
  msgstr ""
  
! #: cp/init.c:3047
  #, gcc-internal-format
  msgid "size in array new must have integral type"
  msgstr ""
  
! #: cp/init.c:3061
  #, gcc-internal-format
  msgid "new cannot be applied to a reference type"
  msgstr ""
  
! #: cp/init.c:3070
  #, gcc-internal-format
  msgid "new cannot be applied to a function type"
  msgstr ""
  
! #: cp/init.c:3114
  #, gcc-internal-format
  msgid "call to Java constructor, while %<jclass%> undefined"
  msgstr ""
  
! #: cp/init.c:3132
  #, gcc-internal-format
  msgid "can%'t find %<class$%> in %qT"
  msgstr ""
  
! #: cp/init.c:3192
  #, gcc-internal-format
  msgid "possible problem detected in invocation of delete [] operator:"
  msgstr ""
  
! #: cp/init.c:3196
  #, gcc-internal-format
  msgid ""
  "neither the destructor nor the class-specific operator delete [] will be "
  "called, even if they are declared when the class is defined"
  msgstr ""
  
! #: cp/init.c:3682
  #, gcc-internal-format
  msgid "initializer ends prematurely"
  msgstr ""
  
! #: cp/init.c:3768
  #, gcc-internal-format
  msgid "cannot initialize multi-dimensional array with initializer"
  msgstr ""
  
! #: cp/init.c:3975
  #, gcc-internal-format
  msgid "unknown array size in delete"
  msgstr ""
  
! #: cp/init.c:3999
  #, gcc-internal-format
  msgid "possible problem detected in invocation of delete operator:"
  msgstr ""
  
! #: cp/init.c:4004
  #, gcc-internal-format
  msgid ""
  "neither the destructor nor the class-specific operator delete will be "
  "called, even if they are declared when the class is defined"
  msgstr ""
  
! #: cp/init.c:4019
  #, gcc-internal-format
  msgid ""
  "deleting object of abstract class type %qT which has non-virtual destructor "
  "will cause undefined behaviour"
  msgstr ""
  
! #: cp/init.c:4024
  #, gcc-internal-format
  msgid ""
  "deleting object of polymorphic class type %qT which has non-virtual "
  "destructor might cause undefined behaviour"
  msgstr ""
  
! #: cp/init.c:4321
  #, gcc-internal-format
  msgid "type to vector delete is neither pointer or array type"
  msgstr ""
--- 38072,38380 ----
  msgid "invalid initializer for array member %q#D"
  msgstr ""
  
! #: cp/init.c:743 cp/init.c:767 cp/init.c:2226 cp/method.c:1237
  #, gcc-internal-format
  msgid "uninitialized const member in %q#T"
  msgstr ""
  
! #: cp/init.c:745 cp/init.c:762 cp/init.c:769 cp/init.c:2211 cp/init.c:2239
! #: cp/method.c:1240 cp/method.c:1251
  #, gcc-internal-format
  msgid "%q#D should be initialized"
  msgstr ""
  
! #: cp/init.c:760 cp/init.c:2198 cp/method.c:1248
  #, gcc-internal-format
  msgid "uninitialized reference member in %q#T"
  msgstr ""
  
! #: cp/init.c:938
  #, gcc-internal-format
  msgid "%q+D will be initialized after"
  msgstr ""
  
! #: cp/init.c:941
  #, gcc-internal-format
  msgid "base %qT will be initialized after"
  msgstr ""
  
! #: cp/init.c:944
  #, gcc-internal-format
  msgid "  %q+#D"
  msgstr ""
  
! #: cp/init.c:946
  #, gcc-internal-format
  msgid "  base %qT"
  msgstr ""
  
! #: cp/init.c:948
  #, gcc-internal-format
  msgid "  when initialized here"
  msgstr ""
  
! #: cp/init.c:965
  #, gcc-internal-format
  msgid "multiple initializations given for %qD"
  msgstr ""
  
! #: cp/init.c:969
  #, gcc-internal-format
  msgid "multiple initializations given for base %qT"
  msgstr ""
  
! #: cp/init.c:1056
  #, gcc-internal-format
  msgid "initializations for multiple members of %qT"
  msgstr ""
  
! #: cp/init.c:1135
  #, gcc-internal-format
  msgid ""
  "base class %q#T should be explicitly initialized in the copy constructor"
  msgstr ""
  
! #: cp/init.c:1359 cp/init.c:1378
  #, gcc-internal-format
  msgid "class %qT does not have any field named %qD"
  msgstr ""
  
! #: cp/init.c:1365
  #, gcc-internal-format
  msgid ""
  "%q#D is a static data member; it can only be initialized at its definition"
  msgstr ""
  
! #: cp/init.c:1372
  #, gcc-internal-format
  msgid "%q#D is not a non-static data member of %qT"
  msgstr ""
  
! #: cp/init.c:1411
  #, gcc-internal-format
  msgid "unnamed initializer for %qT, which has no base classes"
  msgstr ""
  
! #: cp/init.c:1419
  #, gcc-internal-format
  msgid "unnamed initializer for %qT, which uses multiple inheritance"
  msgstr ""
  
! #: cp/init.c:1466
  #, gcc-internal-format
  msgid "%qD is both a direct base and an indirect virtual base"
  msgstr ""
  
! #: cp/init.c:1474
  #, gcc-internal-format
  msgid "type %qT is not a direct or virtual base of %qT"
  msgstr ""
  
! #: cp/init.c:1477
  #, gcc-internal-format
  msgid "type %qT is not a direct base of %qT"
  msgstr ""
  
! #: cp/init.c:1562
  #, gcc-internal-format
  msgid "bad array initializer"
  msgstr ""
  
! #: cp/init.c:1858 cp/semantics.c:3037
  #, gcc-internal-format
  msgid "%qT is not a class type"
  msgstr ""
  
! #: cp/init.c:1914
  #, gcc-internal-format
  msgid "incomplete type %qT does not have member %qD"
  msgstr ""
  
! #: cp/init.c:1928
  #, gcc-internal-format
  msgid "invalid pointer to bit-field %qD"
  msgstr ""
  
! #: cp/init.c:2009
  #, gcc-internal-format
  msgid "invalid use of non-static member function %qD"
  msgstr ""
  
! #: cp/init.c:2016 cp/semantics.c:1741
  #, gcc-internal-format
  msgid "invalid use of non-static data member %qD"
  msgstr ""
  
! #: cp/init.c:2195
  #, gcc-internal-format
  msgid ""
  "uninitialized reference member in %q#T using %<new%> without new-initializer"
  msgstr ""
  
! #: cp/init.c:2203
  #, gcc-internal-format
  msgid ""
  "uninitialized reference member in base %q#T of %q#T using %<new%> without "
  "new-initializer"
  msgstr ""
  
! #: cp/init.c:2207
  #, gcc-internal-format
  msgid "uninitialized reference member in base %q#T of %q#T"
  msgstr ""
  
! #: cp/init.c:2223
  #, gcc-internal-format
  msgid ""
  "uninitialized const member in %q#T using %<new%> without new-initializer"
  msgstr ""
  
! #: cp/init.c:2231
  #, gcc-internal-format
  msgid ""
  "uninitialized const member in base %q#T of %q#T using %<new%> without new-"
  "initializer"
  msgstr ""
  
! #: cp/init.c:2235
  #, gcc-internal-format
  msgid "uninitialized const member in base %q#T of %q#T"
  msgstr ""
  
! #: cp/init.c:2363
  #, gcc-internal-format
  msgid "integer overflow in array size"
  msgstr ""
  
! #: cp/init.c:2373
  #, gcc-internal-format
  msgid "array size in new-expression must be constant"
  msgstr ""
  
! #: cp/init.c:2387
  #, gcc-internal-format
  msgid "variably modified type not allowed in new-expression"
  msgstr ""
  
! #: cp/init.c:2418
  #, gcc-internal-format
  msgid "invalid type %<void%> for new"
  msgstr ""
  
! #: cp/init.c:2461
  #, gcc-internal-format
  msgid "uninitialized const in %<new%> of %q#T"
  msgstr ""
  
! #: cp/init.c:2530
  #, gcc-internal-format
  msgid "%qT isn%'t a valid Java class type"
  msgstr ""
  
! #: cp/init.c:2543
  #, gcc-internal-format
  msgid "call to Java constructor with %qs undefined"
  msgstr ""
  
! #: cp/init.c:2559
  #, gcc-internal-format
  msgid "Java class %q#T object allocated using placement new"
  msgstr ""
  
! #: cp/init.c:2601
  #, gcc-internal-format
  msgid "no suitable %qD found in class %qT"
  msgstr ""
  
! #: cp/init.c:2608 cp/search.c:1122
  #, gcc-internal-format
  msgid "request for member %qD is ambiguous"
  msgstr ""
  
! #: cp/init.c:2827
  #, gcc-internal-format
  msgid "parenthesized initializer in array new"
  msgstr ""
  
! #: cp/init.c:3065
  #, gcc-internal-format
  msgid "size in array new must have integral type"
  msgstr ""
  
! #: cp/init.c:3079
  #, gcc-internal-format
  msgid "new cannot be applied to a reference type"
  msgstr ""
  
! #: cp/init.c:3088
  #, gcc-internal-format
  msgid "new cannot be applied to a function type"
  msgstr ""
  
! #: cp/init.c:3132
  #, gcc-internal-format
  msgid "call to Java constructor, while %<jclass%> undefined"
  msgstr ""
  
! #: cp/init.c:3150
  #, gcc-internal-format
  msgid "can%'t find %<class$%> in %qT"
  msgstr ""
  
! #: cp/init.c:3210
  #, gcc-internal-format
  msgid "possible problem detected in invocation of delete [] operator:"
  msgstr ""
  
! #: cp/init.c:3214
  #, gcc-internal-format
  msgid ""
  "neither the destructor nor the class-specific operator delete [] will be "
  "called, even if they are declared when the class is defined"
  msgstr ""
  
! #: cp/init.c:3700
  #, gcc-internal-format
  msgid "initializer ends prematurely"
  msgstr ""
  
! #: cp/init.c:3786
  #, gcc-internal-format
  msgid "cannot initialize multi-dimensional array with initializer"
  msgstr ""
  
! #: cp/init.c:3993
  #, gcc-internal-format
  msgid "unknown array size in delete"
  msgstr ""
  
! #: cp/init.c:4017
  #, gcc-internal-format
  msgid "possible problem detected in invocation of delete operator:"
  msgstr ""
  
! #: cp/init.c:4022
  #, gcc-internal-format
  msgid ""
  "neither the destructor nor the class-specific operator delete will be "
  "called, even if they are declared when the class is defined"
  msgstr ""
  
! #: cp/init.c:4037
  #, gcc-internal-format
  msgid ""
  "deleting object of abstract class type %qT which has non-virtual destructor "
  "will cause undefined behaviour"
  msgstr ""
  
! #: cp/init.c:4042
  #, gcc-internal-format
  msgid ""
  "deleting object of polymorphic class type %qT which has non-virtual "
  "destructor might cause undefined behaviour"
  msgstr ""
  
! #: cp/init.c:4339
  #, gcc-internal-format
  msgid "type to vector delete is neither pointer or array type"
  msgstr ""
*************** msgstr ""
*** 38311,38363 ****
  msgid "mangling unknown fixed point type"
  msgstr ""
  
! #: cp/mangle.c:2947
  #, gcc-internal-format
  msgid ""
  "use of built-in trait %qE in function signature; use library traits instead"
  msgstr ""
  
! #: cp/mangle.c:2952
  #, gcc-internal-format, gfc-internal-format
  msgid "mangling %C"
  msgstr ""
  
! #: cp/mangle.c:3029
  #, gcc-internal-format
  msgid "omitted middle operand to %<?:%> operand cannot be mangled"
  msgstr ""
  
! #: cp/mangle.c:3093
  #, gcc-internal-format
  msgid "string literal in function template signature"
  msgstr ""
  
! #: cp/mangle.c:3557
  #, gcc-internal-format
  msgid ""
  "a later -fabi-version= (or =0) avoids this error with a change in mangling"
  msgstr ""
  
! #: cp/mangle.c:3574
  #, gcc-internal-format
  msgid ""
  "the mangled name of %q+D changed between -fabi-version=%d (%D) and -fabi-"
  "version=%d (%D)"
  msgstr ""
  
! #: cp/mangle.c:3579
  #, gcc-internal-format
  msgid ""
  "the mangled name of %q+D changes between -fabi-version=%d (%D) and -fabi-"
  "version=%d (%D)"
  msgstr ""
  
! #: cp/method.c:713 cp/method.c:1191
  #, gcc-internal-format
  msgid "non-static const member %q#D, can%'t use default assignment operator"
  msgstr ""
  
! #: cp/method.c:719 cp/method.c:1197
  #, gcc-internal-format
  msgid ""
  "non-static reference member %q#D, can%'t use default assignment operator"
--- 38489,38541 ----
  msgid "mangling unknown fixed point type"
  msgstr ""
  
! #: cp/mangle.c:2949
  #, gcc-internal-format
  msgid ""
  "use of built-in trait %qE in function signature; use library traits instead"
  msgstr ""
  
! #: cp/mangle.c:2954
  #, gcc-internal-format, gfc-internal-format
  msgid "mangling %C"
  msgstr ""
  
! #: cp/mangle.c:3031
  #, gcc-internal-format
  msgid "omitted middle operand to %<?:%> operand cannot be mangled"
  msgstr ""
  
! #: cp/mangle.c:3095
  #, gcc-internal-format
  msgid "string literal in function template signature"
  msgstr ""
  
! #: cp/mangle.c:3559
  #, gcc-internal-format
  msgid ""
  "a later -fabi-version= (or =0) avoids this error with a change in mangling"
  msgstr ""
  
! #: cp/mangle.c:3576
  #, gcc-internal-format
  msgid ""
  "the mangled name of %q+D changed between -fabi-version=%d (%D) and -fabi-"
  "version=%d (%D)"
  msgstr ""
  
! #: cp/mangle.c:3581
  #, gcc-internal-format
  msgid ""
  "the mangled name of %q+D changes between -fabi-version=%d (%D) and -fabi-"
  "version=%d (%D)"
  msgstr ""
  
! #: cp/method.c:713 cp/method.c:1194
  #, gcc-internal-format
  msgid "non-static const member %q#D, can%'t use default assignment operator"
  msgstr ""
  
! #: cp/method.c:719 cp/method.c:1200
  #, gcc-internal-format
  msgid ""
  "non-static reference member %q#D, can%'t use default assignment operator"
*************** msgstr ""
*** 38378,38476 ****
  msgid "defaulted constructor calls non-constexpr %q+D"
  msgstr ""
  
! #: cp/method.c:1213
  #, gcc-internal-format
  msgid "initializer for %q+#D is invalid"
  msgstr ""
  
! #: cp/method.c:1264
  #, gcc-internal-format
  msgid "defaulted default constructor does not initialize %q+#D"
  msgstr ""
  
! #: cp/method.c:1275
  #, gcc-internal-format
  msgid "copying non-static data member %q#D of rvalue reference type"
  msgstr ""
  
  #. A trivial constructor doesn't have any NSDMI.
! #: cp/method.c:1433
  #, gcc-internal-format
  msgid ""
  "defaulted default constructor does not initialize any non-static data member"
  msgstr ""
  
! #: cp/method.c:1510
  #, gcc-internal-format
  msgid ""
  "defaulted move assignment for %qT calls a non-trivial move assignment "
  "operator for virtual base %qT"
  msgstr ""
  
! #: cp/method.c:1616
  #, gcc-internal-format
  msgid "a lambda closure type has a deleted default constructor"
  msgstr ""
  
! #: cp/method.c:1619
  #, gcc-internal-format
  msgid "a lambda closure type has a deleted copy assignment operator"
  msgstr ""
  
! #: cp/method.c:1629
  #, gcc-internal-format
  msgid ""
  "%q+#D is implicitly declared as deleted because %qT declares a move "
  "constructor or move assignment operator"
  msgstr ""
  
! #: cp/method.c:1648
  #, gcc-internal-format
  msgid ""
  "%q+#D is implicitly deleted because the default definition would be ill-"
  "formed:"
  msgstr ""
  
! #: cp/method.c:1657
  msgid ""
  "%q#F is implicitly deleted because its exception-specification does not "
  "match the implicit exception-specification %qX"
  msgstr ""
  
! #: cp/method.c:1973
  #, gcc-internal-format
  msgid "defaulted declaration %q+D"
  msgstr ""
  
! #: cp/method.c:1975
  #, gcc-internal-format
  msgid "does not match expected signature %qD"
  msgstr ""
  
! #: cp/method.c:2007
  msgid ""
  "function %q+D defaulted on its redeclaration with an exception-specification "
  "that differs from the implicit exception-specification %qX"
  msgstr ""
  
! #: cp/method.c:2029
  #, gcc-internal-format
  msgid ""
  "explicitly defaulted function %q+D cannot be declared as constexpr because "
  "the implicit declaration is not constexpr:"
  msgstr ""
  
! #: cp/method.c:2075
  #, gcc-internal-format
  msgid "a template cannot be defaulted"
  msgstr ""
  
! #: cp/method.c:2103
  #, gcc-internal-format
  msgid "%qD cannot be defaulted"
  msgstr ""
  
! #: cp/method.c:2112
  #, gcc-internal-format
  msgid "defaulted function %q+D with default argument"
  msgstr ""
--- 38556,38654 ----
  msgid "defaulted constructor calls non-constexpr %q+D"
  msgstr ""
  
! #: cp/method.c:1216
  #, gcc-internal-format
  msgid "initializer for %q+#D is invalid"
  msgstr ""
  
! #: cp/method.c:1267
  #, gcc-internal-format
  msgid "defaulted default constructor does not initialize %q+#D"
  msgstr ""
  
! #: cp/method.c:1278
  #, gcc-internal-format
  msgid "copying non-static data member %q#D of rvalue reference type"
  msgstr ""
  
  #. A trivial constructor doesn't have any NSDMI.
! #: cp/method.c:1445
  #, gcc-internal-format
  msgid ""
  "defaulted default constructor does not initialize any non-static data member"
  msgstr ""
  
! #: cp/method.c:1522
  #, gcc-internal-format
  msgid ""
  "defaulted move assignment for %qT calls a non-trivial move assignment "
  "operator for virtual base %qT"
  msgstr ""
  
! #: cp/method.c:1628
  #, gcc-internal-format
  msgid "a lambda closure type has a deleted default constructor"
  msgstr ""
  
! #: cp/method.c:1631
  #, gcc-internal-format
  msgid "a lambda closure type has a deleted copy assignment operator"
  msgstr ""
  
! #: cp/method.c:1641
  #, gcc-internal-format
  msgid ""
  "%q+#D is implicitly declared as deleted because %qT declares a move "
  "constructor or move assignment operator"
  msgstr ""
  
! #: cp/method.c:1660
  #, gcc-internal-format
  msgid ""
  "%q+#D is implicitly deleted because the default definition would be ill-"
  "formed:"
  msgstr ""
  
! #: cp/method.c:1669
  msgid ""
  "%q#F is implicitly deleted because its exception-specification does not "
  "match the implicit exception-specification %qX"
  msgstr ""
  
! #: cp/method.c:1985
  #, gcc-internal-format
  msgid "defaulted declaration %q+D"
  msgstr ""
  
! #: cp/method.c:1987
  #, gcc-internal-format
  msgid "does not match expected signature %qD"
  msgstr ""
  
! #: cp/method.c:2019
  msgid ""
  "function %q+D defaulted on its redeclaration with an exception-specification "
  "that differs from the implicit exception-specification %qX"
  msgstr ""
  
! #: cp/method.c:2041
  #, gcc-internal-format
  msgid ""
  "explicitly defaulted function %q+D cannot be declared as constexpr because "
  "the implicit declaration is not constexpr:"
  msgstr ""
  
! #: cp/method.c:2087
  #, gcc-internal-format
  msgid "a template cannot be defaulted"
  msgstr ""
  
! #: cp/method.c:2115
  #, gcc-internal-format
  msgid "%qD cannot be defaulted"
  msgstr ""
  
! #: cp/method.c:2124
  #, gcc-internal-format
  msgid "defaulted function %q+D with default argument"
  msgstr ""
*************** msgstr ""
*** 38766,38772 ****
  msgid "XXX leaving pop_everything ()\n"
  msgstr ""
  
! #: cp/optimize.c:594
  #, gcc-internal-format
  msgid "making multiple clones of %qD"
  msgstr ""
--- 38944,38950 ----
  msgid "XXX leaving pop_everything ()\n"
  msgstr ""
  
! #: cp/optimize.c:601
  #, gcc-internal-format
  msgid "making multiple clones of %qD"
  msgstr ""
*************** msgstr ""
*** 38776,38782 ****
  msgid "identifier %qE is a keyword in C++11"
  msgstr ""
  
! #: cp/parser.c:1313 cp/parser.c:31888
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> not immediately followed by function "
--- 38954,38960 ----
  msgid "identifier %qE is a keyword in C++11"
  msgstr ""
  
! #: cp/parser.c:1313 cp/parser.c:31929
  #, gcc-internal-format
  msgid ""
  "%<#pragma omp declare simd%> not immediately followed by function "
*************** msgstr ""
*** 38803,38809 ****
  msgid "request for member %qE in non-class type %qT"
  msgstr ""
  
! #: cp/parser.c:2645 cp/parser.c:15943
  #, gcc-internal-format
  msgid "%<%T::%E%> has not been declared"
  msgstr ""
--- 38981,38987 ----
  msgid "request for member %qE in non-class type %qT"
  msgstr ""
  
! #: cp/parser.c:2645 cp/parser.c:15944
  #, gcc-internal-format
  msgid "%<%T::%E%> has not been declared"
  msgstr ""
*************** msgstr ""
*** 38868,38874 ****
  msgid "(perhaps a semicolon is missing after the definition of %qT)"
  msgstr ""
  
! #: cp/parser.c:2790 cp/parser.c:5562 cp/pt.c:7654
  #, gcc-internal-format
  msgid "%qT is not a template"
  msgstr ""
--- 39046,39052 ----
  msgid "(perhaps a semicolon is missing after the definition of %qT)"
  msgstr ""
  
! #: cp/parser.c:2790 cp/parser.c:5563 cp/pt.c:7674
  #, gcc-internal-format
  msgid "%qT is not a template"
  msgstr ""
*************** msgstr ""
*** 38893,38899 ****
  msgid "floating-point literal cannot appear in a constant-expression"
  msgstr ""
  
! #: cp/parser.c:2836 cp/pt.c:14791
  #, gcc-internal-format
  msgid ""
  "a cast to a type other than an integral or enumeration type cannot appear in "
--- 39071,39077 ----
  msgid "floating-point literal cannot appear in a constant-expression"
  msgstr ""
  
! #: cp/parser.c:2836 cp/pt.c:14880
  #, gcc-internal-format
  msgid ""
  "a cast to a type other than an integral or enumeration type cannot appear in "
*************** msgstr ""
*** 39095,39101 ****
  msgid "unable to find string literal operator %qD with %qT, %qT arguments"
  msgstr ""
  
! #: cp/parser.c:4124 cp/parser.c:11544
  #, gcc-internal-format
  msgid "expected declaration"
  msgstr ""
--- 39273,39279 ----
  msgid "unable to find string literal operator %qD with %qT, %qT arguments"
  msgstr ""
  
! #: cp/parser.c:4124 cp/parser.c:11545
  #, gcc-internal-format
  msgid "expected declaration"
  msgstr ""
*************** msgid ""
*** 39117,39940 ****
  "argument lists"
  msgstr ""
  
! #: cp/parser.c:4465 cp/parser.c:4618 cp/parser.c:4771
  #, gcc-internal-format
  msgid "expected primary-expression"
  msgstr ""
  
! #: cp/parser.c:4495
  #, gcc-internal-format
  msgid "%<this%> may not be used in this context"
  msgstr ""
  
! #: cp/parser.c:4613
  #, gcc-internal-format
  msgid "a template declaration cannot appear at block scope"
  msgstr ""
  
! #: cp/parser.c:4747
  #, gcc-internal-format
  msgid "local variable %qD may not appear in this context"
  msgstr ""
  
! #: cp/parser.c:4923
  #, gcc-internal-format
  msgid "expected id-expression"
  msgstr ""
  
! #: cp/parser.c:5055
  #, gcc-internal-format
  msgid "scope %qT before %<~%> is not a class-name"
  msgstr ""
  
! #: cp/parser.c:5084 cp/parser.c:7051
  #, gcc-internal-format
  msgid "%<~auto%> only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:5188
  #, gcc-internal-format
  msgid "declaration of %<~%T%> as member of %qT"
  msgstr ""
  
! #: cp/parser.c:5203
  #, gcc-internal-format
  msgid "typedef-name %qD used as destructor declarator"
  msgstr ""
  
! #: cp/parser.c:5238
  #, gcc-internal-format
  msgid ""
  "literal operator suffixes not preceded by %<_%> are reserved for future "
  "standardization"
  msgstr ""
  
! #: cp/parser.c:5249 cp/parser.c:17809
  #, gcc-internal-format
  msgid "expected unqualified-id"
  msgstr ""
  
! #: cp/parser.c:5356
  #, gcc-internal-format
  msgid "found %<:%> in nested-name-specifier, expected %<::%>"
  msgstr ""
  
! #: cp/parser.c:5425
  #, gcc-internal-format
  msgid "decltype evaluates to %qT, which is not a class or enumeration type"
  msgstr ""
  
! #: cp/parser.c:5451
  #, gcc-internal-format
  msgid "function template-id %qD in nested-name-specifier"
  msgstr ""
  
! #: cp/parser.c:5459
  #, gcc-internal-format
  msgid "variable template-id %qD in nested-name-specifier"
  msgstr ""
  
! #: cp/parser.c:5563 cp/typeck.c:2585 cp/typeck.c:2605
  #, gcc-internal-format
  msgid "%qD is not a template"
  msgstr ""
  
! #: cp/parser.c:5641
  #, gcc-internal-format
  msgid "expected nested-name-specifier"
  msgstr ""
  
! #: cp/parser.c:5866 cp/parser.c:7956
  #, gcc-internal-format
  msgid "types may not be defined in casts"
  msgstr ""
  
! #: cp/parser.c:5936
  #, gcc-internal-format
  msgid "types may not be defined in a %<typeid%> expression"
  msgstr ""
  
! #: cp/parser.c:5990
  #, gcc-internal-format
  msgid "%<_Cilk_spawn%> must be followed by an expression"
  msgstr ""
  
! #: cp/parser.c:6128
  #, gcc-internal-format
  msgid "ISO C++ forbids compound-literals"
  msgstr ""
  
! #: cp/parser.c:6186
  #, gcc-internal-format
  msgid "two consecutive %<[%> shall only introduce an attribute"
  msgstr ""
  
! #: cp/parser.c:6582
  #, gcc-internal-format
  msgid "braced list index is not allowed with array notation"
  msgstr ""
  
! #: cp/parser.c:6674
  #, gcc-internal-format
  msgid "%qE does not have class type"
  msgstr ""
  
! #: cp/parser.c:6763 cp/typeck.c:2478
  #, gcc-internal-format
  msgid "invalid use of %qD"
  msgstr ""
  
! #: cp/parser.c:6772
  #, gcc-internal-format
  msgid "%<%D::%D%> is not a class member"
  msgstr ""
  
! #: cp/parser.c:7103
  #, gcc-internal-format
  msgid "non-scalar type"
  msgstr ""
  
! #: cp/parser.c:7202
  #, gcc-internal-format
  msgid "ISO C++ does not allow %<alignof%> with a non-type"
  msgstr ""
  
! #: cp/parser.c:7287
  #, gcc-internal-format
  msgid "types may not be defined in %<noexcept%> expressions"
  msgstr ""
  
! #: cp/parser.c:7522
  #, gcc-internal-format
  msgid "types may not be defined in a new-expression"
  msgstr ""
  
! #: cp/parser.c:7535
  #, gcc-internal-format
  msgid "array bound forbidden after parenthesized type-id"
  msgstr ""
  
! #: cp/parser.c:7537
  #, gcc-internal-format
  msgid "try removing the parentheses around the type-id"
  msgstr ""
  
! #: cp/parser.c:7616
  #, gcc-internal-format
  msgid "types may not be defined in a new-type-id"
  msgstr ""
  
! #: cp/parser.c:7744
  #, gcc-internal-format
  msgid "expression in new-declarator must have integral or enumeration type"
  msgstr ""
  
! #: cp/parser.c:8050
  #, gcc-internal-format
  msgid "use of old-style cast"
  msgstr ""
  
! #: cp/parser.c:8189
  #, gcc-internal-format
  msgid "%<>>%> operator is treated as two right angle brackets in C++11"
  msgstr ""
  
! #: cp/parser.c:8192
  #, gcc-internal-format
  msgid "suggest parentheses around %<>>%> expression"
  msgstr ""
  
! #: cp/parser.c:8369
  #, gcc-internal-format
  msgid "ISO C++ does not allow ?: with omitted middle operand"
  msgstr ""
  
! #: cp/parser.c:9020
  #, gcc-internal-format
  msgid "lambda-expression in unevaluated context"
  msgstr ""
  
! #: cp/parser.c:9029
  #, gcc-internal-format
  msgid "lambda-expression in template-argument"
  msgstr ""
  
! #: cp/parser.c:9180
  #, gcc-internal-format
  msgid "expected end of capture-list"
  msgstr ""
  
! #: cp/parser.c:9194
  #, gcc-internal-format
  msgid ""
  "explicit by-copy capture of %<this%> redundant with by-copy capture default"
  msgstr ""
  
! #: cp/parser.c:9238
  #, gcc-internal-format
  msgid ""
  "lambda capture initializers only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:9245
  #, gcc-internal-format
  msgid "empty initializer for lambda init-capture"
  msgstr ""
  
! #: cp/parser.c:9268
  #, gcc-internal-format
  msgid "capture of non-variable %qD "
  msgstr ""
  
! #: cp/parser.c:9270 cp/parser.c:9279 cp/semantics.c:3201 cp/semantics.c:3211
  #, gcc-internal-format
  msgid "%q+#D declared here"
  msgstr ""
  
! #: cp/parser.c:9276
  #, gcc-internal-format
  msgid "capture of variable %qD with non-automatic storage duration"
  msgstr ""
  
! #: cp/parser.c:9313
  #, gcc-internal-format
  msgid "explicit by-copy capture of %qD redundant with by-copy capture default"
  msgstr ""
  
! #: cp/parser.c:9318
  #, gcc-internal-format
  msgid ""
  "explicit by-reference capture of %qD redundant with by-reference capture "
  "default"
  msgstr ""
  
! #: cp/parser.c:9364
  #, gcc-internal-format
  msgid "lambda templates are only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:9394
  #, gcc-internal-format
  msgid "default argument specified for lambda parameter"
  msgstr ""
  
! #: cp/parser.c:9854
  #, gcc-internal-format
  msgid "attributes at the beginning of statement are ignored"
  msgstr ""
  
! #: cp/parser.c:9882
  #, gcc-internal-format
  msgid "expected labeled-statement"
  msgstr ""
  
! #: cp/parser.c:9920
  #, gcc-internal-format
  msgid "case label %qE not within a switch statement"
  msgstr ""
  
! #: cp/parser.c:10005
  #, gcc-internal-format
  msgid "need %<typename%> before %qE because %qT is a dependent scope"
  msgstr ""
  
! #: cp/parser.c:10014
  #, gcc-internal-format
  msgid "%<%T::%D%> names the constructor, not the type"
  msgstr ""
  
! #: cp/parser.c:10061
  #, gcc-internal-format
  msgid "compound-statement in constexpr function"
  msgstr ""
  
! #: cp/parser.c:10273 cp/parser.c:24926
  #, gcc-internal-format
  msgid "expected selection-statement"
  msgstr ""
  
! #: cp/parser.c:10306
  #, gcc-internal-format
  msgid "types may not be defined in conditions"
  msgstr ""
  
! #: cp/parser.c:10675
  #, gcc-internal-format
  msgid "range-based %<for%> expression of type %qT has incomplete type"
  msgstr ""
  
! #: cp/parser.c:10713
  #, gcc-internal-format
  msgid ""
  "range-based %<for%> expression of type %qT has an %<end%> member but not a "
  "%<begin%>"
  msgstr ""
  
! #: cp/parser.c:10719
  #, gcc-internal-format
  msgid ""
  "range-based %<for%> expression of type %qT has a %<begin%> member but not an "
  "%<end%>"
  msgstr ""
  
! #: cp/parser.c:10760
  #, gcc-internal-format
  msgid ""
  "inconsistent begin/end types in range-based %<for%> statement: %qT and %qT"
  msgstr ""
  
! #: cp/parser.c:10891 cp/parser.c:24929
  #, gcc-internal-format
  msgid "expected iteration-statement"
  msgstr ""
  
! #: cp/parser.c:10925
  #, gcc-internal-format
  msgid ""
  "range-based for loop without a type-specifier only available with -std=c++1z "
  "or -std=gnu++1z"
  msgstr ""
  
! #: cp/parser.c:10955
  #, gcc-internal-format
  msgid ""
  "range-based %<for%> loops only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/parser.c:11029
  #, gcc-internal-format
  msgid "break statement used with Cilk Plus for loop"
  msgstr ""
  
! #: cp/parser.c:11086
  #, gcc-internal-format
  msgid "%<goto%> in %<constexpr%> function"
  msgstr ""
  
  #. Issue a warning about this use of a GNU extension.
! #: cp/parser.c:11094
  #, gcc-internal-format
  msgid "ISO C++ forbids computed gotos"
  msgstr ""
  
! #: cp/parser.c:11107 cp/parser.c:24932
  #, gcc-internal-format
  msgid "expected jump-statement"
  msgstr ""
  
! #: cp/parser.c:11236 cp/parser.c:20846
  #, gcc-internal-format
  msgid "extra %<;%>"
  msgstr ""
  
! #: cp/parser.c:11469
  #, gcc-internal-format
  msgid "%<__label__%> not at the beginning of a block"
  msgstr ""
  
! #: cp/parser.c:11627
  #, gcc-internal-format
  msgid "mixing declarations and function-definitions is forbidden"
  msgstr ""
  
! #: cp/parser.c:11697
  #, gcc-internal-format
  msgid "initializer in range-based %<for%> loop"
  msgstr ""
  
! #: cp/parser.c:11700
  #, gcc-internal-format
  msgid "multiple declarations in range-based %<for%> loop"
  msgstr ""
  
! #: cp/parser.c:11836
  #, gcc-internal-format
  msgid "%<friend%> used outside of class"
  msgstr ""
  
  #. Complain about `auto' as a storage specifier, if
  #. we're complaining about C++0x compatibility.
! #: cp/parser.c:11895
  #, gcc-internal-format
  msgid "%<auto%> changes meaning in C++11; please remove it"
  msgstr ""
  
! #: cp/parser.c:11931
  #, gcc-internal-format
  msgid "decl-specifier invalid in condition"
  msgstr ""
  
! #: cp/parser.c:12023
  #, gcc-internal-format
  msgid "class definition may not be declared a friend"
  msgstr ""
  
! #: cp/parser.c:12091 cp/parser.c:21252
  #, gcc-internal-format
  msgid "templates may not be %<virtual%>"
  msgstr ""
  
! #: cp/parser.c:12131
  #, gcc-internal-format
  msgid "invalid linkage-specification"
  msgstr ""
  
! #: cp/parser.c:12390
  #, gcc-internal-format
  msgid "types may not be defined in %<decltype%> expressions"
  msgstr ""
  
! #: cp/parser.c:12531
  #, gcc-internal-format
  msgid "types may not be defined in a conversion-type-id"
  msgstr ""
  
! #: cp/parser.c:12558
  #, gcc-internal-format
  msgid "invalid use of %<auto%> in conversion operator"
  msgstr ""
  
! #: cp/parser.c:12562
  #, gcc-internal-format
  msgid ""
  "use of %<auto%> in member template conversion operator can never be deduced"
  msgstr ""
  
! #: cp/parser.c:12651
  #, gcc-internal-format
  msgid "only constructors take member initializers"
  msgstr ""
  
! #: cp/parser.c:12673
  #, gcc-internal-format
  msgid "cannot expand initializer for member %<%D%>"
  msgstr ""
  
! #: cp/parser.c:12685
  #, gcc-internal-format
  msgid "mem-initializer for %qD follows constructor delegation"
  msgstr ""
  
! #: cp/parser.c:12697
  #, gcc-internal-format
  msgid "constructor delegation follows mem-initializer for %qD"
  msgstr ""
  
! #: cp/parser.c:12749
  #, gcc-internal-format
  msgid "anachronistic old-style base class initializer"
  msgstr ""
  
! #: cp/parser.c:12818
  #, gcc-internal-format
  msgid ""
  "keyword %<typename%> not allowed in this context (a qualified member "
  "initializer is implicitly a type)"
  msgstr ""
  
! #: cp/parser.c:13167
  #, gcc-internal-format
  msgid "unexpected keyword; remove space between quotes and suffix identifier"
  msgstr ""
  
! #: cp/parser.c:13173
  #, gcc-internal-format
  msgid "expected suffix identifier"
  msgstr ""
  
! #: cp/parser.c:13182
  #, gcc-internal-format
  msgid "expected empty string after %<operator%> keyword"
  msgstr ""
  
! #: cp/parser.c:13188
  #, gcc-internal-format
  msgid "invalid encoding prefix in literal operator"
  msgstr ""
  
! #: cp/parser.c:13211
  #, gcc-internal-format
  msgid "expected operator"
  msgstr ""
  
  #. Warn that we do not support `export'.
! #: cp/parser.c:13248
  #, gcc-internal-format
  msgid "keyword %<export%> not implemented, and will be ignored"
  msgstr ""
  
! #: cp/parser.c:13447 cp/parser.c:13545 cp/parser.c:13654 cp/parser.c:19145
  #, gcc-internal-format
  msgid "template parameter pack %qD cannot have a default argument"
  msgstr ""
  
! #: cp/parser.c:13451 cp/parser.c:19153
  #, gcc-internal-format
  msgid "template parameter pack cannot have a default argument"
  msgstr ""
  
! #: cp/parser.c:13549 cp/parser.c:13658
  #, gcc-internal-format
  msgid "template parameter packs cannot have default arguments"
  msgstr ""
  
! #: cp/parser.c:13742
  #, gcc-internal-format
  msgid "expected template-id"
  msgstr ""
  
! #: cp/parser.c:13790 cp/parser.c:24890
  #, gcc-internal-format
  msgid "expected %<<%>"
  msgstr ""
  
! #: cp/parser.c:13797
  #, gcc-internal-format
  msgid "%<<::%> cannot begin a template-argument list"
  msgstr ""
  
! #: cp/parser.c:13801
  #, gcc-internal-format
  msgid ""
  "%<<:%> is an alternate spelling for %<[%>. Insert whitespace between %<<%> "
  "and %<::%>"
  msgstr ""
  
! #: cp/parser.c:13805
  #, gcc-internal-format
  msgid ""
  "(if you use %<-fpermissive%> or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
  "accept your code)"
  msgstr ""
  
! #: cp/parser.c:13891
  #, gcc-internal-format
  msgid "parse error in template argument list"
  msgstr ""
  
  #. The name does not name a template.
! #: cp/parser.c:13960 cp/parser.c:14081 cp/parser.c:14293
  #, gcc-internal-format
  msgid "expected template-name"
  msgstr ""
  
  #. Explain what went wrong.
! #: cp/parser.c:14006
  #, gcc-internal-format
  msgid "non-template %qD used as template"
  msgstr ""
  
! #: cp/parser.c:14008
  #, gcc-internal-format
  msgid "use %<%T::template %D%> to indicate that it is a template"
  msgstr ""
  
! #: cp/parser.c:14148
  #, gcc-internal-format
  msgid "expected parameter pack before %<...%>"
  msgstr ""
  
! #: cp/parser.c:14258 cp/parser.c:14276 cp/parser.c:14425
  #, gcc-internal-format
  msgid "expected template-argument"
  msgstr ""
  
! #: cp/parser.c:14410
  #, gcc-internal-format
  msgid "invalid non-type template argument"
  msgstr ""
  
! #: cp/parser.c:14527
  #, gcc-internal-format
  msgid "explicit instantiation shall not use %<inline%> specifier"
  msgstr ""
  
! #: cp/parser.c:14531
  #, gcc-internal-format
  msgid "explicit instantiation shall not use %<constexpr%> specifier"
  msgstr ""
  
! #: cp/parser.c:14590
  #, gcc-internal-format
  msgid "template specialization with C linkage"
  msgstr ""
  
! #: cp/parser.c:14810
  #, gcc-internal-format
  msgid "expected type specifier"
  msgstr ""
  
! #: cp/parser.c:14969
  #, gcc-internal-format
  msgid ""
  "use of %<auto%> in lambda parameter declaration only available with -std=c+"
  "+14 or -std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:14975
  #, gcc-internal-format
  msgid ""
  "use of %<auto%> in parameter declaration only available with -std=c++14 or -"
  "std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:14980
  #, gcc-internal-format
  msgid "ISO C++ forbids use of %<auto%> in parameter declaration"
  msgstr ""
  
! #: cp/parser.c:15124
  #, gcc-internal-format
  msgid "expected template-id for type"
  msgstr ""
  
! #: cp/parser.c:15151
  #, gcc-internal-format
  msgid "expected type-name"
  msgstr ""
  
! #: cp/parser.c:15372
  #, gcc-internal-format
  msgid ""
  "elaborated-type-specifier for a scoped enum must not use the %<%D%> keyword"
  msgstr ""
  
! #: cp/parser.c:15581
  #, gcc-internal-format
  msgid "declaration %qD does not declare anything"
  msgstr ""
  
! #: cp/parser.c:15668
  #, gcc-internal-format
  msgid "attributes ignored on uninstantiated type"
  msgstr ""
  
! #: cp/parser.c:15672
  #, gcc-internal-format
  msgid "attributes ignored on template instantiation"
  msgstr ""
  
! #: cp/parser.c:15677
  #, gcc-internal-format
  msgid ""
  "attributes ignored on elaborated-type-specifier that is not a forward "
  "declaration"
  msgstr ""
  
! #: cp/parser.c:15811
  #, gcc-internal-format
  msgid "%qD is an enumeration template"
  msgstr ""
  
! #: cp/parser.c:15821
  #, gcc-internal-format
  msgid "%qD is not an enumerator-name"
  msgstr ""
  
! #: cp/parser.c:15833
  #, gcc-internal-format
  msgid "anonymous scoped enum is not allowed"
  msgstr ""
  
! #: cp/parser.c:15888
  #, gcc-internal-format
  msgid "expected %<;%> or %<{%>"
  msgstr ""
  
! #: cp/parser.c:15937
  #, gcc-internal-format
  msgid "cannot add an enumerator list to a template instantiation"
  msgstr ""
  
! #: cp/parser.c:15955 cp/parser.c:20360
  #, gcc-internal-format
  msgid "declaration of %qD in namespace %qD which does not enclose %qD"
  msgstr ""
  
! #: cp/parser.c:15960 cp/parser.c:20365
  #, gcc-internal-format
  msgid "declaration of %qD in %qD which does not enclose %qD"
  msgstr ""
  
! #: cp/parser.c:15985
  #, gcc-internal-format
  msgid "multiple definition of %q#T"
  msgstr ""
  
! #: cp/parser.c:15998
  #, gcc-internal-format
  msgid "ISO C++ forbids empty anonymous enum"
  msgstr ""
  
! #: cp/parser.c:16018
  #, gcc-internal-format
  msgid "opaque-enum-specifier without name"
  msgstr ""
  
! #: cp/parser.c:16021
  #, gcc-internal-format
  msgid "opaque-enum-specifier must use a simple identifier"
  msgstr ""
  
! #: cp/parser.c:16191
  #, gcc-internal-format
  msgid "%qD is not a namespace-name"
  msgstr ""
  
! #: cp/parser.c:16192
  #, gcc-internal-format
  msgid "expected namespace-name"
  msgstr ""
  
! #: cp/parser.c:16318
  #, gcc-internal-format
  msgid "%<namespace%> definition is not allowed here"
  msgstr ""
  
! #: cp/parser.c:16473
  #, gcc-internal-format
  msgid "a template-id may not appear in a using-declaration"
  msgstr ""
  
! #: cp/parser.c:16519
  #, gcc-internal-format
  msgid ""
  "access declarations are deprecated in favour of using-declarations; "
  "suggestion: add the %<using%> keyword"
  msgstr ""
  
! #: cp/parser.c:16584
  #, gcc-internal-format
  msgid "types may not be defined in alias template declarations"
  msgstr ""
  
! #: cp/parser.c:16729
  #, gcc-internal-format
  msgid "%<asm%> in %<constexpr%> function"
  msgstr ""
  
! #: cp/parser.c:17067
  #, gcc-internal-format
  msgid "a function-definition is not allowed here"
  msgstr ""
  
! #: cp/parser.c:17078
  #, gcc-internal-format
  msgid "an asm-specification is not allowed on a function-definition"
  msgstr ""
  
! #: cp/parser.c:17082
  #, gcc-internal-format
  msgid "attributes are not allowed on a function-definition"
  msgstr ""
  
! #: cp/parser.c:17133
  #, gcc-internal-format
  msgid "expected constructor, destructor, or type conversion"
  msgstr ""
  
  #. Anything else is an error.
! #: cp/parser.c:17172 cp/parser.c:19333
  #, gcc-internal-format
  msgid "expected initializer"
  msgstr ""
  
! #: cp/parser.c:17252
  #, gcc-internal-format
  msgid "initializer provided for function"
  msgstr ""
  
! #: cp/parser.c:17286
  #, gcc-internal-format
  msgid "attributes after parenthesized initializer ignored"
  msgstr ""
  
! #: cp/parser.c:17291
  #, gcc-internal-format
  msgid "non-function %qD declared as implicit template"
  msgstr ""
  
! #: cp/parser.c:17729
  #, gcc-internal-format
  msgid "array bound is not an integer constant"
  msgstr ""
  
! #: cp/parser.c:17855
  #, gcc-internal-format
  msgid "cannot define member of dependent typedef %qT"
  msgstr ""
  
! #: cp/parser.c:17859
  #, gcc-internal-format
  msgid "%<%T::%E%> is not a type"
  msgstr ""
  
! #: cp/parser.c:17887
  #, gcc-internal-format
  msgid "invalid use of constructor as a template"
  msgstr ""
  
! #: cp/parser.c:17889
  #, gcc-internal-format
  msgid ""
  "use %<%T::%D%> instead of %<%T::%D%> to name the constructor in a qualified "
--- 39295,40118 ----
  "argument lists"
  msgstr ""
  
! #: cp/parser.c:4466 cp/parser.c:4619 cp/parser.c:4772
  #, gcc-internal-format
  msgid "expected primary-expression"
  msgstr ""
  
! #: cp/parser.c:4496
  #, gcc-internal-format
  msgid "%<this%> may not be used in this context"
  msgstr ""
  
! #: cp/parser.c:4614
  #, gcc-internal-format
  msgid "a template declaration cannot appear at block scope"
  msgstr ""
  
! #: cp/parser.c:4748
  #, gcc-internal-format
  msgid "local variable %qD may not appear in this context"
  msgstr ""
  
! #: cp/parser.c:4924
  #, gcc-internal-format
  msgid "expected id-expression"
  msgstr ""
  
! #: cp/parser.c:5056
  #, gcc-internal-format
  msgid "scope %qT before %<~%> is not a class-name"
  msgstr ""
  
! #: cp/parser.c:5085 cp/parser.c:7052
  #, gcc-internal-format
  msgid "%<~auto%> only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:5189
  #, gcc-internal-format
  msgid "declaration of %<~%T%> as member of %qT"
  msgstr ""
  
! #: cp/parser.c:5204
  #, gcc-internal-format
  msgid "typedef-name %qD used as destructor declarator"
  msgstr ""
  
! #: cp/parser.c:5239
  #, gcc-internal-format
  msgid ""
  "literal operator suffixes not preceded by %<_%> are reserved for future "
  "standardization"
  msgstr ""
  
! #: cp/parser.c:5250 cp/parser.c:17810
  #, gcc-internal-format
  msgid "expected unqualified-id"
  msgstr ""
  
! #: cp/parser.c:5357
  #, gcc-internal-format
  msgid "found %<:%> in nested-name-specifier, expected %<::%>"
  msgstr ""
  
! #: cp/parser.c:5426
  #, gcc-internal-format
  msgid "decltype evaluates to %qT, which is not a class or enumeration type"
  msgstr ""
  
! #: cp/parser.c:5452
  #, gcc-internal-format
  msgid "function template-id %qD in nested-name-specifier"
  msgstr ""
  
! #: cp/parser.c:5460
  #, gcc-internal-format
  msgid "variable template-id %qD in nested-name-specifier"
  msgstr ""
  
! #: cp/parser.c:5564 cp/typeck.c:2586 cp/typeck.c:2606
  #, gcc-internal-format
  msgid "%qD is not a template"
  msgstr ""
  
! #: cp/parser.c:5642
  #, gcc-internal-format
  msgid "expected nested-name-specifier"
  msgstr ""
  
! #: cp/parser.c:5867 cp/parser.c:7957
  #, gcc-internal-format
  msgid "types may not be defined in casts"
  msgstr ""
  
! #: cp/parser.c:5937
  #, gcc-internal-format
  msgid "types may not be defined in a %<typeid%> expression"
  msgstr ""
  
! #: cp/parser.c:5991
  #, gcc-internal-format
  msgid "%<_Cilk_spawn%> must be followed by an expression"
  msgstr ""
  
! #: cp/parser.c:6129
  #, gcc-internal-format
  msgid "ISO C++ forbids compound-literals"
  msgstr ""
  
! #: cp/parser.c:6187
  #, gcc-internal-format
  msgid "two consecutive %<[%> shall only introduce an attribute"
  msgstr ""
  
! #: cp/parser.c:6583
  #, gcc-internal-format
  msgid "braced list index is not allowed with array notation"
  msgstr ""
  
! #: cp/parser.c:6675
  #, gcc-internal-format
  msgid "%qE does not have class type"
  msgstr ""
  
! #: cp/parser.c:6764 cp/typeck.c:2479
  #, gcc-internal-format
  msgid "invalid use of %qD"
  msgstr ""
  
! #: cp/parser.c:6773
  #, gcc-internal-format
  msgid "%<%D::%D%> is not a class member"
  msgstr ""
  
! #: cp/parser.c:7104
  #, gcc-internal-format
  msgid "non-scalar type"
  msgstr ""
  
! #: cp/parser.c:7203
  #, gcc-internal-format
  msgid "ISO C++ does not allow %<alignof%> with a non-type"
  msgstr ""
  
! #: cp/parser.c:7288
  #, gcc-internal-format
  msgid "types may not be defined in %<noexcept%> expressions"
  msgstr ""
  
! #: cp/parser.c:7523
  #, gcc-internal-format
  msgid "types may not be defined in a new-expression"
  msgstr ""
  
! #: cp/parser.c:7536
  #, gcc-internal-format
  msgid "array bound forbidden after parenthesized type-id"
  msgstr ""
  
! #: cp/parser.c:7538
  #, gcc-internal-format
  msgid "try removing the parentheses around the type-id"
  msgstr ""
  
! #: cp/parser.c:7617
  #, gcc-internal-format
  msgid "types may not be defined in a new-type-id"
  msgstr ""
  
! #: cp/parser.c:7745
  #, gcc-internal-format
  msgid "expression in new-declarator must have integral or enumeration type"
  msgstr ""
  
! #: cp/parser.c:8051
  #, gcc-internal-format
  msgid "use of old-style cast"
  msgstr ""
  
! #: cp/parser.c:8190
  #, gcc-internal-format
  msgid "%<>>%> operator is treated as two right angle brackets in C++11"
  msgstr ""
  
! #: cp/parser.c:8193
  #, gcc-internal-format
  msgid "suggest parentheses around %<>>%> expression"
  msgstr ""
  
! #: cp/parser.c:8370
  #, gcc-internal-format
  msgid "ISO C++ does not allow ?: with omitted middle operand"
  msgstr ""
  
! #: cp/parser.c:9021
  #, gcc-internal-format
  msgid "lambda-expression in unevaluated context"
  msgstr ""
  
! #: cp/parser.c:9030
  #, gcc-internal-format
  msgid "lambda-expression in template-argument"
  msgstr ""
  
! #: cp/parser.c:9181
  #, gcc-internal-format
  msgid "expected end of capture-list"
  msgstr ""
  
! #: cp/parser.c:9195
  #, gcc-internal-format
  msgid ""
  "explicit by-copy capture of %<this%> redundant with by-copy capture default"
  msgstr ""
  
! #: cp/parser.c:9239
  #, gcc-internal-format
  msgid ""
  "lambda capture initializers only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:9246
  #, gcc-internal-format
  msgid "empty initializer for lambda init-capture"
  msgstr ""
  
! #: cp/parser.c:9269
  #, gcc-internal-format
  msgid "capture of non-variable %qD "
  msgstr ""
  
! #: cp/parser.c:9271 cp/parser.c:9280 cp/semantics.c:3202 cp/semantics.c:3212
  #, gcc-internal-format
  msgid "%q+#D declared here"
  msgstr ""
  
! #: cp/parser.c:9277
  #, gcc-internal-format
  msgid "capture of variable %qD with non-automatic storage duration"
  msgstr ""
  
! #: cp/parser.c:9314
  #, gcc-internal-format
  msgid "explicit by-copy capture of %qD redundant with by-copy capture default"
  msgstr ""
  
! #: cp/parser.c:9319
  #, gcc-internal-format
  msgid ""
  "explicit by-reference capture of %qD redundant with by-reference capture "
  "default"
  msgstr ""
  
! #: cp/parser.c:9365
  #, gcc-internal-format
  msgid "lambda templates are only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:9395
  #, gcc-internal-format
  msgid "default argument specified for lambda parameter"
  msgstr ""
  
! #: cp/parser.c:9855
  #, gcc-internal-format
  msgid "attributes at the beginning of statement are ignored"
  msgstr ""
  
! #: cp/parser.c:9883
  #, gcc-internal-format
  msgid "expected labeled-statement"
  msgstr ""
  
! #: cp/parser.c:9921
  #, gcc-internal-format
  msgid "case label %qE not within a switch statement"
  msgstr ""
  
! #: cp/parser.c:10006
  #, gcc-internal-format
  msgid "need %<typename%> before %qE because %qT is a dependent scope"
  msgstr ""
  
! #: cp/parser.c:10015
  #, gcc-internal-format
  msgid "%<%T::%D%> names the constructor, not the type"
  msgstr ""
  
! #: cp/parser.c:10062
  #, gcc-internal-format
  msgid "compound-statement in constexpr function"
  msgstr ""
  
! #: cp/parser.c:10274 cp/parser.c:24967
  #, gcc-internal-format
  msgid "expected selection-statement"
  msgstr ""
  
! #: cp/parser.c:10307
  #, gcc-internal-format
  msgid "types may not be defined in conditions"
  msgstr ""
  
! #: cp/parser.c:10676
  #, gcc-internal-format
  msgid "range-based %<for%> expression of type %qT has incomplete type"
  msgstr ""
  
! #: cp/parser.c:10714
  #, gcc-internal-format
  msgid ""
  "range-based %<for%> expression of type %qT has an %<end%> member but not a "
  "%<begin%>"
  msgstr ""
  
! #: cp/parser.c:10720
  #, gcc-internal-format
  msgid ""
  "range-based %<for%> expression of type %qT has a %<begin%> member but not an "
  "%<end%>"
  msgstr ""
  
! #: cp/parser.c:10761
  #, gcc-internal-format
  msgid ""
  "inconsistent begin/end types in range-based %<for%> statement: %qT and %qT"
  msgstr ""
  
! #: cp/parser.c:10892 cp/parser.c:24970
  #, gcc-internal-format
  msgid "expected iteration-statement"
  msgstr ""
  
! #: cp/parser.c:10926
  #, gcc-internal-format
  msgid ""
  "range-based for loop without a type-specifier only available with -std=c++1z "
  "or -std=gnu++1z"
  msgstr ""
  
! #: cp/parser.c:10956
  #, gcc-internal-format
  msgid ""
  "range-based %<for%> loops only available with -std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/parser.c:11030
  #, gcc-internal-format
  msgid "break statement used with Cilk Plus for loop"
  msgstr ""
  
! #: cp/parser.c:11087
  #, gcc-internal-format
  msgid "%<goto%> in %<constexpr%> function"
  msgstr ""
  
  #. Issue a warning about this use of a GNU extension.
! #: cp/parser.c:11095
  #, gcc-internal-format
  msgid "ISO C++ forbids computed gotos"
  msgstr ""
  
! #: cp/parser.c:11108 cp/parser.c:24973
  #, gcc-internal-format
  msgid "expected jump-statement"
  msgstr ""
  
! #: cp/parser.c:11237 cp/parser.c:20847
  #, gcc-internal-format
  msgid "extra %<;%>"
  msgstr ""
  
! #: cp/parser.c:11470
  #, gcc-internal-format
  msgid "%<__label__%> not at the beginning of a block"
  msgstr ""
  
! #: cp/parser.c:11628
  #, gcc-internal-format
  msgid "mixing declarations and function-definitions is forbidden"
  msgstr ""
  
! #: cp/parser.c:11698
  #, gcc-internal-format
  msgid "initializer in range-based %<for%> loop"
  msgstr ""
  
! #: cp/parser.c:11701
  #, gcc-internal-format
  msgid "multiple declarations in range-based %<for%> loop"
  msgstr ""
  
! #: cp/parser.c:11837
  #, gcc-internal-format
  msgid "%<friend%> used outside of class"
  msgstr ""
  
  #. Complain about `auto' as a storage specifier, if
  #. we're complaining about C++0x compatibility.
! #: cp/parser.c:11896
  #, gcc-internal-format
  msgid "%<auto%> changes meaning in C++11; please remove it"
  msgstr ""
  
! #: cp/parser.c:11932
  #, gcc-internal-format
  msgid "decl-specifier invalid in condition"
  msgstr ""
  
! #: cp/parser.c:12024
  #, gcc-internal-format
  msgid "class definition may not be declared a friend"
  msgstr ""
  
! #: cp/parser.c:12092 cp/parser.c:21253
  #, gcc-internal-format
  msgid "templates may not be %<virtual%>"
  msgstr ""
  
! #: cp/parser.c:12132
  #, gcc-internal-format
  msgid "invalid linkage-specification"
  msgstr ""
  
! #: cp/parser.c:12391
  #, gcc-internal-format
  msgid "types may not be defined in %<decltype%> expressions"
  msgstr ""
  
! #: cp/parser.c:12532
  #, gcc-internal-format
  msgid "types may not be defined in a conversion-type-id"
  msgstr ""
  
! #: cp/parser.c:12559
  #, gcc-internal-format
  msgid "invalid use of %<auto%> in conversion operator"
  msgstr ""
  
! #: cp/parser.c:12563
  #, gcc-internal-format
  msgid ""
  "use of %<auto%> in member template conversion operator can never be deduced"
  msgstr ""
  
! #: cp/parser.c:12652
  #, gcc-internal-format
  msgid "only constructors take member initializers"
  msgstr ""
  
! #: cp/parser.c:12674
  #, gcc-internal-format
  msgid "cannot expand initializer for member %<%D%>"
  msgstr ""
  
! #: cp/parser.c:12686
  #, gcc-internal-format
  msgid "mem-initializer for %qD follows constructor delegation"
  msgstr ""
  
! #: cp/parser.c:12698
  #, gcc-internal-format
  msgid "constructor delegation follows mem-initializer for %qD"
  msgstr ""
  
! #: cp/parser.c:12750
  #, gcc-internal-format
  msgid "anachronistic old-style base class initializer"
  msgstr ""
  
! #: cp/parser.c:12819
  #, gcc-internal-format
  msgid ""
  "keyword %<typename%> not allowed in this context (a qualified member "
  "initializer is implicitly a type)"
  msgstr ""
  
! #: cp/parser.c:13168
  #, gcc-internal-format
  msgid "unexpected keyword; remove space between quotes and suffix identifier"
  msgstr ""
  
! #: cp/parser.c:13174
  #, gcc-internal-format
  msgid "expected suffix identifier"
  msgstr ""
  
! #: cp/parser.c:13183
  #, gcc-internal-format
  msgid "expected empty string after %<operator%> keyword"
  msgstr ""
  
! #: cp/parser.c:13189
  #, gcc-internal-format
  msgid "invalid encoding prefix in literal operator"
  msgstr ""
  
! #: cp/parser.c:13212
  #, gcc-internal-format
  msgid "expected operator"
  msgstr ""
  
  #. Warn that we do not support `export'.
! #: cp/parser.c:13249
  #, gcc-internal-format
  msgid "keyword %<export%> not implemented, and will be ignored"
  msgstr ""
  
! #: cp/parser.c:13448 cp/parser.c:13546 cp/parser.c:13655 cp/parser.c:19146
  #, gcc-internal-format
  msgid "template parameter pack %qD cannot have a default argument"
  msgstr ""
  
! #: cp/parser.c:13452 cp/parser.c:19154
  #, gcc-internal-format
  msgid "template parameter pack cannot have a default argument"
  msgstr ""
  
! #: cp/parser.c:13550 cp/parser.c:13659
  #, gcc-internal-format
  msgid "template parameter packs cannot have default arguments"
  msgstr ""
  
! #: cp/parser.c:13743
  #, gcc-internal-format
  msgid "expected template-id"
  msgstr ""
  
! #: cp/parser.c:13791 cp/parser.c:24931
  #, gcc-internal-format
  msgid "expected %<<%>"
  msgstr ""
  
! #: cp/parser.c:13798
  #, gcc-internal-format
  msgid "%<<::%> cannot begin a template-argument list"
  msgstr ""
  
! #: cp/parser.c:13802
  #, gcc-internal-format
  msgid ""
  "%<<:%> is an alternate spelling for %<[%>. Insert whitespace between %<<%> "
  "and %<::%>"
  msgstr ""
  
! #: cp/parser.c:13806
  #, gcc-internal-format
  msgid ""
  "(if you use %<-fpermissive%> or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
  "accept your code)"
  msgstr ""
  
! #: cp/parser.c:13892
  #, gcc-internal-format
  msgid "parse error in template argument list"
  msgstr ""
  
  #. The name does not name a template.
! #: cp/parser.c:13961 cp/parser.c:14082 cp/parser.c:14294
  #, gcc-internal-format
  msgid "expected template-name"
  msgstr ""
  
  #. Explain what went wrong.
! #: cp/parser.c:14007
  #, gcc-internal-format
  msgid "non-template %qD used as template"
  msgstr ""
  
! #: cp/parser.c:14009
  #, gcc-internal-format
  msgid "use %<%T::template %D%> to indicate that it is a template"
  msgstr ""
  
! #: cp/parser.c:14149
  #, gcc-internal-format
  msgid "expected parameter pack before %<...%>"
  msgstr ""
  
! #: cp/parser.c:14259 cp/parser.c:14277 cp/parser.c:14426
  #, gcc-internal-format
  msgid "expected template-argument"
  msgstr ""
  
! #: cp/parser.c:14411
  #, gcc-internal-format
  msgid "invalid non-type template argument"
  msgstr ""
  
! #: cp/parser.c:14528
  #, gcc-internal-format
  msgid "explicit instantiation shall not use %<inline%> specifier"
  msgstr ""
  
! #: cp/parser.c:14532
  #, gcc-internal-format
  msgid "explicit instantiation shall not use %<constexpr%> specifier"
  msgstr ""
  
! #: cp/parser.c:14591
  #, gcc-internal-format
  msgid "template specialization with C linkage"
  msgstr ""
  
! #: cp/parser.c:14811
  #, gcc-internal-format
  msgid "expected type specifier"
  msgstr ""
  
! #: cp/parser.c:14970
  #, gcc-internal-format
  msgid ""
  "use of %<auto%> in lambda parameter declaration only available with -std=c+"
  "+14 or -std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:14976
  #, gcc-internal-format
  msgid ""
  "use of %<auto%> in parameter declaration only available with -std=c++14 or -"
  "std=gnu++14"
  msgstr ""
  
! #: cp/parser.c:14981
  #, gcc-internal-format
  msgid "ISO C++ forbids use of %<auto%> in parameter declaration"
  msgstr ""
  
! #: cp/parser.c:15125
  #, gcc-internal-format
  msgid "expected template-id for type"
  msgstr ""
  
! #: cp/parser.c:15152
  #, gcc-internal-format
  msgid "expected type-name"
  msgstr ""
  
! #: cp/parser.c:15373
  #, gcc-internal-format
  msgid ""
  "elaborated-type-specifier for a scoped enum must not use the %<%D%> keyword"
  msgstr ""
  
! #: cp/parser.c:15582
  #, gcc-internal-format
  msgid "declaration %qD does not declare anything"
  msgstr ""
  
! #: cp/parser.c:15669
  #, gcc-internal-format
  msgid "attributes ignored on uninstantiated type"
  msgstr ""
  
! #: cp/parser.c:15673
  #, gcc-internal-format
  msgid "attributes ignored on template instantiation"
  msgstr ""
  
! #: cp/parser.c:15678
  #, gcc-internal-format
  msgid ""
  "attributes ignored on elaborated-type-specifier that is not a forward "
  "declaration"
  msgstr ""
  
! #: cp/parser.c:15812
  #, gcc-internal-format
  msgid "%qD is an enumeration template"
  msgstr ""
  
! #: cp/parser.c:15822
  #, gcc-internal-format
  msgid "%qD is not an enumerator-name"
  msgstr ""
  
! #: cp/parser.c:15834
  #, gcc-internal-format
  msgid "anonymous scoped enum is not allowed"
  msgstr ""
  
! #: cp/parser.c:15889
  #, gcc-internal-format
  msgid "expected %<;%> or %<{%>"
  msgstr ""
  
! #: cp/parser.c:15938
  #, gcc-internal-format
  msgid "cannot add an enumerator list to a template instantiation"
  msgstr ""
  
! #: cp/parser.c:15956 cp/parser.c:20361
  #, gcc-internal-format
  msgid "declaration of %qD in namespace %qD which does not enclose %qD"
  msgstr ""
  
! #: cp/parser.c:15961 cp/parser.c:20366
  #, gcc-internal-format
  msgid "declaration of %qD in %qD which does not enclose %qD"
  msgstr ""
  
! #: cp/parser.c:15986
  #, gcc-internal-format
  msgid "multiple definition of %q#T"
  msgstr ""
  
! #: cp/parser.c:15999
  #, gcc-internal-format
  msgid "ISO C++ forbids empty anonymous enum"
  msgstr ""
  
! #: cp/parser.c:16019
  #, gcc-internal-format
  msgid "opaque-enum-specifier without name"
  msgstr ""
  
! #: cp/parser.c:16022
  #, gcc-internal-format
  msgid "opaque-enum-specifier must use a simple identifier"
  msgstr ""
  
! #: cp/parser.c:16192
  #, gcc-internal-format
  msgid "%qD is not a namespace-name"
  msgstr ""
  
! #: cp/parser.c:16193
  #, gcc-internal-format
  msgid "expected namespace-name"
  msgstr ""
  
! #: cp/parser.c:16319
  #, gcc-internal-format
  msgid "%<namespace%> definition is not allowed here"
  msgstr ""
  
! #: cp/parser.c:16474
  #, gcc-internal-format
  msgid "a template-id may not appear in a using-declaration"
  msgstr ""
  
! #: cp/parser.c:16520
  #, gcc-internal-format
  msgid ""
  "access declarations are deprecated in favour of using-declarations; "
  "suggestion: add the %<using%> keyword"
  msgstr ""
  
! #: cp/parser.c:16585
  #, gcc-internal-format
  msgid "types may not be defined in alias template declarations"
  msgstr ""
  
! #: cp/parser.c:16730
  #, gcc-internal-format
  msgid "%<asm%> in %<constexpr%> function"
  msgstr ""
  
! #: cp/parser.c:17068
  #, gcc-internal-format
  msgid "a function-definition is not allowed here"
  msgstr ""
  
! #: cp/parser.c:17079
  #, gcc-internal-format
  msgid "an asm-specification is not allowed on a function-definition"
  msgstr ""
  
! #: cp/parser.c:17083
  #, gcc-internal-format
  msgid "attributes are not allowed on a function-definition"
  msgstr ""
  
! #: cp/parser.c:17134
  #, gcc-internal-format
  msgid "expected constructor, destructor, or type conversion"
  msgstr ""
  
  #. Anything else is an error.
! #: cp/parser.c:17173 cp/parser.c:19334
  #, gcc-internal-format
  msgid "expected initializer"
  msgstr ""
  
! #: cp/parser.c:17253
  #, gcc-internal-format
  msgid "initializer provided for function"
  msgstr ""
  
! #: cp/parser.c:17287
  #, gcc-internal-format
  msgid "attributes after parenthesized initializer ignored"
  msgstr ""
  
! #: cp/parser.c:17292
  #, gcc-internal-format
  msgid "non-function %qD declared as implicit template"
  msgstr ""
  
! #: cp/parser.c:17730
  #, gcc-internal-format
  msgid "array bound is not an integer constant"
  msgstr ""
  
! #: cp/parser.c:17856
  #, gcc-internal-format
  msgid "cannot define member of dependent typedef %qT"
  msgstr ""
  
! #: cp/parser.c:17860
  #, gcc-internal-format
  msgid "%<%T::%E%> is not a type"
  msgstr ""
  
! #: cp/parser.c:17888
  #, gcc-internal-format
  msgid "invalid use of constructor as a template"
  msgstr ""
  
! #: cp/parser.c:17890
  #, gcc-internal-format
  msgid ""
  "use %<%T::%D%> instead of %<%T::%D%> to name the constructor in a qualified "
*************** msgstr ""
*** 39945,40249 ****
  #. here because we do not have enough
  #. information about its original syntactic
  #. form.
! #: cp/parser.c:17906
  #, gcc-internal-format
  msgid "invalid declarator"
  msgstr ""
  
  #. But declarations with qualified-ids can't appear in a
  #. function.
! #: cp/parser.c:17976
  #, gcc-internal-format
  msgid "qualified-id in declaration"
  msgstr ""
  
! #: cp/parser.c:18001
  #, gcc-internal-format
  msgid "expected declarator"
  msgstr ""
  
! #: cp/parser.c:18104
  #, gcc-internal-format
  msgid "%qD is a namespace"
  msgstr ""
  
! #: cp/parser.c:18106
  #, gcc-internal-format
  msgid "cannot form pointer to member of non-class %q#T"
  msgstr ""
  
! #: cp/parser.c:18127
  #, gcc-internal-format
  msgid "expected ptr-operator"
  msgstr ""
  
! #: cp/parser.c:18186
  #, gcc-internal-format
  msgid "duplicate cv-qualifier"
  msgstr ""
  
! #: cp/parser.c:18240
  #, gcc-internal-format
  msgid "multiple ref-qualifiers"
  msgstr ""
  
! #: cp/parser.c:18298
  #, gcc-internal-format
  msgid "duplicate virt-specifier"
  msgstr ""
  
! #: cp/parser.c:18505 cp/typeck2.c:541 cp/typeck2.c:1928
  #, gcc-internal-format
  msgid "invalid use of %<auto%>"
  msgstr ""
  
! #: cp/parser.c:18524
  #, gcc-internal-format
  msgid "types may not be defined in template arguments"
  msgstr ""
  
! #: cp/parser.c:18529
  #, gcc-internal-format
  msgid "invalid use of %<auto%> in template argument"
  msgstr ""
  
! #: cp/parser.c:18616
  #, gcc-internal-format
  msgid "expected type-specifier"
  msgstr ""
  
! #: cp/parser.c:18922
  #, gcc-internal-format
  msgid "expected %<,%> or %<...%>"
  msgstr ""
  
! #: cp/parser.c:18996
  #, gcc-internal-format
  msgid "types may not be defined in parameter types"
  msgstr ""
  
! #: cp/parser.c:19124
  #, gcc-internal-format
  msgid "deprecated use of default argument for parameter of non-function"
  msgstr ""
  
! #: cp/parser.c:19128
  #, gcc-internal-format
  msgid "default arguments are only permitted for function parameters"
  msgstr ""
  
! #: cp/parser.c:19147
  #, gcc-internal-format
  msgid "parameter pack %qD cannot have a default argument"
  msgstr ""
  
! #: cp/parser.c:19155
  #, gcc-internal-format
  msgid "parameter pack cannot have a default argument"
  msgstr ""
  
! #: cp/parser.c:19526
  #, gcc-internal-format
  msgid "ISO C++ does not allow designated initializers"
  msgstr ""
  
! #: cp/parser.c:19540
  #, gcc-internal-format
  msgid "ISO C++ does not allow C99 designated initializers"
  msgstr ""
  
! #: cp/parser.c:19658 cp/parser.c:19783
  #, gcc-internal-format
  msgid "expected class-name"
  msgstr ""
  
! #: cp/parser.c:19965
  #, gcc-internal-format
  msgid "expected %<;%> after class definition"
  msgstr ""
  
! #: cp/parser.c:19967
  #, gcc-internal-format
  msgid "expected %<;%> after struct definition"
  msgstr ""
  
! #: cp/parser.c:19969
  #, gcc-internal-format
  msgid "expected %<;%> after union definition"
  msgstr ""
  
! #: cp/parser.c:20308
  #, gcc-internal-format
  msgid "expected %<{%> or %<:%>"
  msgstr ""
  
! #: cp/parser.c:20319
  #, gcc-internal-format
  msgid "cannot specify %<override%> for a class"
  msgstr ""
  
! #: cp/parser.c:20327
  #, gcc-internal-format
  msgid "global qualification of class name is invalid"
  msgstr ""
  
! #: cp/parser.c:20334
  #, gcc-internal-format
  msgid "qualified name does not name a class"
  msgstr ""
  
! #: cp/parser.c:20346
  #, gcc-internal-format
  msgid "invalid class name in declaration of %qD"
  msgstr ""
  
! #: cp/parser.c:20379
  #, gcc-internal-format
  msgid "extra qualification not allowed"
  msgstr ""
  
! #: cp/parser.c:20391
  #, gcc-internal-format
  msgid "an explicit specialization must be preceded by %<template <>%>"
  msgstr ""
  
! #: cp/parser.c:20421
  #, gcc-internal-format
  msgid "function template %qD redeclared as a class template"
  msgstr ""
  
! #: cp/parser.c:20452
  #, gcc-internal-format
  msgid "could not resolve typename type"
  msgstr ""
  
! #: cp/parser.c:20508
  #, gcc-internal-format
  msgid "previous definition of %q+#T"
  msgstr ""
  
! #: cp/parser.c:20599 cp/parser.c:24935
  #, gcc-internal-format
  msgid "expected class-key"
  msgstr ""
  
! #: cp/parser.c:20623
  #, gcc-internal-format
  msgid ""
  "ISO C++ forbids typename key in template template parameter; use -std=c++1z "
  "or -std=gnu++1z"
  msgstr ""
  
! #: cp/parser.c:20627
  #, gcc-internal-format
  msgid "expected %<class%> or %<typename%>"
  msgstr ""
  
! #: cp/parser.c:20866
  #, gcc-internal-format
  msgid "in C++03 a class-key must be used when declaring a friend"
  msgstr ""
  
! #: cp/parser.c:20884
  #, gcc-internal-format
  msgid "friend declaration does not name a class or function"
  msgstr ""
  
! #: cp/parser.c:20902
  #, gcc-internal-format
  msgid "a storage class on an anonymous aggregate in class scope is not allowed"
  msgstr ""
  
! #: cp/parser.c:21106
  #, gcc-internal-format
  msgid "pure-specifier on function-definition"
  msgstr ""
  
! #: cp/parser.c:21160
  #, gcc-internal-format
  msgid "stray %<,%> at end of member declaration"
  msgstr ""
  
! #: cp/parser.c:21172
  #, gcc-internal-format
  msgid "expected %<;%> at end of member declaration"
  msgstr ""
  
! #: cp/parser.c:21246
  #, gcc-internal-format
  msgid "invalid pure specifier (only %<= 0%> is allowed)"
  msgstr ""
  
! #: cp/parser.c:21281
  #, gcc-internal-format
  msgid "a brace-enclosed initializer is not allowed here"
  msgstr ""
  
! #: cp/parser.c:21410
  #, gcc-internal-format
  msgid "%<virtual%> specified more than once in base-specified"
  msgstr ""
  
! #: cp/parser.c:21430
  #, gcc-internal-format
  msgid "more than one access specifier in base-specified"
  msgstr ""
  
! #: cp/parser.c:21454
  #, gcc-internal-format
  msgid "keyword %<typename%> not allowed outside of templates"
  msgstr ""
  
! #: cp/parser.c:21457
  #, gcc-internal-format
  msgid ""
  "keyword %<typename%> not allowed in this context (the base class is "
  "implicitly a type)"
  msgstr ""
  
! #: cp/parser.c:21550 cp/parser.c:21632
  #, gcc-internal-format
  msgid "types may not be defined in an exception-specification"
  msgstr ""
  
! #: cp/parser.c:21614
  #, gcc-internal-format
  msgid ""
  "dynamic exception specifications are deprecated in C++0x; use %<noexcept%> "
  "instead"
  msgstr ""
  
! #: cp/parser.c:21704
  #, gcc-internal-format
  msgid "%<try%> in %<constexpr%> function"
  msgstr ""
  
! #: cp/parser.c:21817
  #, gcc-internal-format
  msgid "types may not be defined in exception-declarations"
  msgstr ""
  
! #: cp/parser.c:22441
  #, gcc-internal-format
  msgid "expected an identifier for the attribute name"
  msgstr ""
  
! #: cp/parser.c:22460
  #, gcc-internal-format
  msgid "%<deprecated%> is a C++14 feature; use %<gnu::deprecated%>"
  msgstr ""
  
! #: cp/parser.c:23141
  #, gcc-internal-format
  msgid "specializing member %<%T::%E%> requires %<template<>%> syntax"
  msgstr ""
  
! #: cp/parser.c:23146
  #, gcc-internal-format
  msgid "invalid declaration of %<%T::%E%>"
  msgstr ""
  
! #: cp/parser.c:23150
  #, gcc-internal-format
  msgid "too few template-parameter-lists"
  msgstr ""
--- 40123,40427 ----
  #. here because we do not have enough
  #. information about its original syntactic
  #. form.
! #: cp/parser.c:17907
  #, gcc-internal-format
  msgid "invalid declarator"
  msgstr ""
  
  #. But declarations with qualified-ids can't appear in a
  #. function.
! #: cp/parser.c:17977
  #, gcc-internal-format
  msgid "qualified-id in declaration"
  msgstr ""
  
! #: cp/parser.c:18002
  #, gcc-internal-format
  msgid "expected declarator"
  msgstr ""
  
! #: cp/parser.c:18105
  #, gcc-internal-format
  msgid "%qD is a namespace"
  msgstr ""
  
! #: cp/parser.c:18107
  #, gcc-internal-format
  msgid "cannot form pointer to member of non-class %q#T"
  msgstr ""
  
! #: cp/parser.c:18128
  #, gcc-internal-format
  msgid "expected ptr-operator"
  msgstr ""
  
! #: cp/parser.c:18187
  #, gcc-internal-format
  msgid "duplicate cv-qualifier"
  msgstr ""
  
! #: cp/parser.c:18241
  #, gcc-internal-format
  msgid "multiple ref-qualifiers"
  msgstr ""
  
! #: cp/parser.c:18299
  #, gcc-internal-format
  msgid "duplicate virt-specifier"
  msgstr ""
  
! #: cp/parser.c:18506 cp/typeck2.c:541 cp/typeck2.c:1938
  #, gcc-internal-format
  msgid "invalid use of %<auto%>"
  msgstr ""
  
! #: cp/parser.c:18525
  #, gcc-internal-format
  msgid "types may not be defined in template arguments"
  msgstr ""
  
! #: cp/parser.c:18530
  #, gcc-internal-format
  msgid "invalid use of %<auto%> in template argument"
  msgstr ""
  
! #: cp/parser.c:18617
  #, gcc-internal-format
  msgid "expected type-specifier"
  msgstr ""
  
! #: cp/parser.c:18923
  #, gcc-internal-format
  msgid "expected %<,%> or %<...%>"
  msgstr ""
  
! #: cp/parser.c:18997
  #, gcc-internal-format
  msgid "types may not be defined in parameter types"
  msgstr ""
  
! #: cp/parser.c:19125
  #, gcc-internal-format
  msgid "deprecated use of default argument for parameter of non-function"
  msgstr ""
  
! #: cp/parser.c:19129
  #, gcc-internal-format
  msgid "default arguments are only permitted for function parameters"
  msgstr ""
  
! #: cp/parser.c:19148
  #, gcc-internal-format
  msgid "parameter pack %qD cannot have a default argument"
  msgstr ""
  
! #: cp/parser.c:19156
  #, gcc-internal-format
  msgid "parameter pack cannot have a default argument"
  msgstr ""
  
! #: cp/parser.c:19527
  #, gcc-internal-format
  msgid "ISO C++ does not allow designated initializers"
  msgstr ""
  
! #: cp/parser.c:19541
  #, gcc-internal-format
  msgid "ISO C++ does not allow C99 designated initializers"
  msgstr ""
  
! #: cp/parser.c:19659 cp/parser.c:19784
  #, gcc-internal-format
  msgid "expected class-name"
  msgstr ""
  
! #: cp/parser.c:19966
  #, gcc-internal-format
  msgid "expected %<;%> after class definition"
  msgstr ""
  
! #: cp/parser.c:19968
  #, gcc-internal-format
  msgid "expected %<;%> after struct definition"
  msgstr ""
  
! #: cp/parser.c:19970
  #, gcc-internal-format
  msgid "expected %<;%> after union definition"
  msgstr ""
  
! #: cp/parser.c:20309
  #, gcc-internal-format
  msgid "expected %<{%> or %<:%>"
  msgstr ""
  
! #: cp/parser.c:20320
  #, gcc-internal-format
  msgid "cannot specify %<override%> for a class"
  msgstr ""
  
! #: cp/parser.c:20328
  #, gcc-internal-format
  msgid "global qualification of class name is invalid"
  msgstr ""
  
! #: cp/parser.c:20335
  #, gcc-internal-format
  msgid "qualified name does not name a class"
  msgstr ""
  
! #: cp/parser.c:20347
  #, gcc-internal-format
  msgid "invalid class name in declaration of %qD"
  msgstr ""
  
! #: cp/parser.c:20380
  #, gcc-internal-format
  msgid "extra qualification not allowed"
  msgstr ""
  
! #: cp/parser.c:20392
  #, gcc-internal-format
  msgid "an explicit specialization must be preceded by %<template <>%>"
  msgstr ""
  
! #: cp/parser.c:20422
  #, gcc-internal-format
  msgid "function template %qD redeclared as a class template"
  msgstr ""
  
! #: cp/parser.c:20453
  #, gcc-internal-format
  msgid "could not resolve typename type"
  msgstr ""
  
! #: cp/parser.c:20509
  #, gcc-internal-format
  msgid "previous definition of %q+#T"
  msgstr ""
  
! #: cp/parser.c:20600 cp/parser.c:24976
  #, gcc-internal-format
  msgid "expected class-key"
  msgstr ""
  
! #: cp/parser.c:20624
  #, gcc-internal-format
  msgid ""
  "ISO C++ forbids typename key in template template parameter; use -std=c++1z "
  "or -std=gnu++1z"
  msgstr ""
  
! #: cp/parser.c:20628
  #, gcc-internal-format
  msgid "expected %<class%> or %<typename%>"
  msgstr ""
  
! #: cp/parser.c:20867
  #, gcc-internal-format
  msgid "in C++03 a class-key must be used when declaring a friend"
  msgstr ""
  
! #: cp/parser.c:20885
  #, gcc-internal-format
  msgid "friend declaration does not name a class or function"
  msgstr ""
  
! #: cp/parser.c:20903
  #, gcc-internal-format
  msgid "a storage class on an anonymous aggregate in class scope is not allowed"
  msgstr ""
  
! #: cp/parser.c:21107
  #, gcc-internal-format
  msgid "pure-specifier on function-definition"
  msgstr ""
  
! #: cp/parser.c:21161
  #, gcc-internal-format
  msgid "stray %<,%> at end of member declaration"
  msgstr ""
  
! #: cp/parser.c:21173
  #, gcc-internal-format
  msgid "expected %<;%> at end of member declaration"
  msgstr ""
  
! #: cp/parser.c:21247
  #, gcc-internal-format
  msgid "invalid pure specifier (only %<= 0%> is allowed)"
  msgstr ""
  
! #: cp/parser.c:21282
  #, gcc-internal-format
  msgid "a brace-enclosed initializer is not allowed here"
  msgstr ""
  
! #: cp/parser.c:21411
  #, gcc-internal-format
  msgid "%<virtual%> specified more than once in base-specified"
  msgstr ""
  
! #: cp/parser.c:21431
  #, gcc-internal-format
  msgid "more than one access specifier in base-specified"
  msgstr ""
  
! #: cp/parser.c:21455
  #, gcc-internal-format
  msgid "keyword %<typename%> not allowed outside of templates"
  msgstr ""
  
! #: cp/parser.c:21458
  #, gcc-internal-format
  msgid ""
  "keyword %<typename%> not allowed in this context (the base class is "
  "implicitly a type)"
  msgstr ""
  
! #: cp/parser.c:21551 cp/parser.c:21633
  #, gcc-internal-format
  msgid "types may not be defined in an exception-specification"
  msgstr ""
  
! #: cp/parser.c:21615
  #, gcc-internal-format
  msgid ""
  "dynamic exception specifications are deprecated in C++0x; use %<noexcept%> "
  "instead"
  msgstr ""
  
! #: cp/parser.c:21705
  #, gcc-internal-format
  msgid "%<try%> in %<constexpr%> function"
  msgstr ""
  
! #: cp/parser.c:21818
  #, gcc-internal-format
  msgid "types may not be defined in exception-declarations"
  msgstr ""
  
! #: cp/parser.c:22442
  #, gcc-internal-format
  msgid "expected an identifier for the attribute name"
  msgstr ""
  
! #: cp/parser.c:22461
  #, gcc-internal-format
  msgid "%<deprecated%> is a C++14 feature; use %<gnu::deprecated%>"
  msgstr ""
  
! #: cp/parser.c:23145
  #, gcc-internal-format
  msgid "specializing member %<%T::%E%> requires %<template<>%> syntax"
  msgstr ""
  
! #: cp/parser.c:23150
  #, gcc-internal-format
  msgid "invalid declaration of %<%T::%E%>"
  msgstr ""
  
! #: cp/parser.c:23154
  #, gcc-internal-format
  msgid "too few template-parameter-lists"
  msgstr ""
*************** msgstr ""
*** 40252,40867 ****
  #. something like:
  #.
  #. template <class T> template <class U> void S::f();
! #: cp/parser.c:23157
  #, gcc-internal-format
  msgid "too many template-parameter-lists"
  msgstr ""
  
! #: cp/parser.c:23481
  #, gcc-internal-format
  msgid "named return values are no longer supported"
  msgstr ""
  
! #: cp/parser.c:23578
  #, gcc-internal-format
  msgid "invalid declaration of member template in local class"
  msgstr ""
  
! #: cp/parser.c:23587
  #, gcc-internal-format
  msgid "template with C linkage"
  msgstr ""
  
! #: cp/parser.c:23606
  #, gcc-internal-format
  msgid "invalid explicit specialization"
  msgstr ""
  
! #: cp/parser.c:23704
  #, gcc-internal-format
  msgid ""
  "literal operator template %qD has invalid parameter list.  Expected non-type "
  "template argument pack <char...> or <typename CharT, CharT...>"
  msgstr ""
  
! #: cp/parser.c:23709
  #, gcc-internal-format
  msgid ""
  "literal operator template %qD has invalid parameter list.  Expected non-type "
  "template argument pack <char...>"
  msgstr ""
  
! #: cp/parser.c:23783
  #, gcc-internal-format
  msgid "template declaration of %<typedef%>"
  msgstr ""
  
! #: cp/parser.c:23860
  #, gcc-internal-format
  msgid "explicit template specialization cannot have a storage class"
  msgstr ""
  
! #: cp/parser.c:24105
  #, gcc-internal-format
  msgid "%<>>%> should be %<> >%> within a nested template argument list"
  msgstr ""
  
! #: cp/parser.c:24118
  #, gcc-internal-format
  msgid "spurious %<>>%>, use %<>%> to terminate a template argument list"
  msgstr ""
  
! #: cp/parser.c:24415
  #, gcc-internal-format
  msgid "%<sizeof...%> argument must be surrounded by parentheses"
  msgstr ""
  
! #: cp/parser.c:24570
  #, gcc-internal-format
  msgid "invalid use of %qD in linkage specification"
  msgstr ""
  
! #: cp/parser.c:24585
  #, gcc-internal-format
  msgid "%<__thread%> before %qD"
  msgstr ""
  
! #: cp/parser.c:24719
  #, gcc-internal-format
  msgid "ISO C++ 1998 does not support %<long long%>"
  msgstr ""
  
! #: cp/parser.c:24727
  #, gcc-internal-format
  msgid "both %<__thread%> and %<thread_local%> specified"
  msgstr ""
  
! #: cp/parser.c:24729
  #, gcc-internal-format
  msgid "duplicate %qD"
  msgstr ""
  
! #: cp/parser.c:24751
  #, gcc-internal-format
  msgid "duplicate %qs"
  msgstr ""
  
! #: cp/parser.c:24793
  #, gcc-internal-format
  msgid "expected %<new%>"
  msgstr ""
  
! #: cp/parser.c:24796
  #, gcc-internal-format
  msgid "expected %<delete%>"
  msgstr ""
  
! #: cp/parser.c:24799
  #, gcc-internal-format
  msgid "expected %<return%>"
  msgstr ""
  
! #: cp/parser.c:24805
  #, gcc-internal-format
  msgid "expected %<extern%>"
  msgstr ""
  
! #: cp/parser.c:24808
  #, gcc-internal-format
  msgid "expected %<static_assert%>"
  msgstr ""
  
! #: cp/parser.c:24811
  #, gcc-internal-format
  msgid "expected %<decltype%>"
  msgstr ""
  
! #: cp/parser.c:24814
  #, gcc-internal-format
  msgid "expected %<operator%>"
  msgstr ""
  
! #: cp/parser.c:24817
  #, gcc-internal-format
  msgid "expected %<class%>"
  msgstr ""
  
! #: cp/parser.c:24820
  #, gcc-internal-format
  msgid "expected %<template%>"
  msgstr ""
  
! #: cp/parser.c:24823
  #, gcc-internal-format
  msgid "expected %<namespace%>"
  msgstr ""
  
! #: cp/parser.c:24826
  #, gcc-internal-format
  msgid "expected %<using%>"
  msgstr ""
  
! #: cp/parser.c:24829
  #, gcc-internal-format
  msgid "expected %<asm%>"
  msgstr ""
  
! #: cp/parser.c:24832
  #, gcc-internal-format
  msgid "expected %<try%>"
  msgstr ""
  
! #: cp/parser.c:24835
  #, gcc-internal-format
  msgid "expected %<catch%>"
  msgstr ""
  
! #: cp/parser.c:24838
  #, gcc-internal-format
  msgid "expected %<throw%>"
  msgstr ""
  
! #: cp/parser.c:24841
  #, gcc-internal-format
  msgid "expected %<__label__%>"
  msgstr ""
  
! #: cp/parser.c:24844
  #, gcc-internal-format
  msgid "expected %<@try%>"
  msgstr ""
  
! #: cp/parser.c:24847
  #, gcc-internal-format
  msgid "expected %<@synchronized%>"
  msgstr ""
  
! #: cp/parser.c:24850
  #, gcc-internal-format
  msgid "expected %<@throw%>"
  msgstr ""
  
! #: cp/parser.c:24853
  #, gcc-internal-format
  msgid "expected %<__transaction_atomic%>"
  msgstr ""
  
! #: cp/parser.c:24856
  #, gcc-internal-format
  msgid "expected %<__transaction_relaxed%>"
  msgstr ""
  
! #: cp/parser.c:24887
  #, gcc-internal-format
  msgid "expected %<::%>"
  msgstr ""
  
! #: cp/parser.c:24899
  #, gcc-internal-format
  msgid "expected %<...%>"
  msgstr ""
  
! #: cp/parser.c:24902
  #, gcc-internal-format
  msgid "expected %<*%>"
  msgstr ""
  
! #: cp/parser.c:24905
  #, gcc-internal-format
  msgid "expected %<~%>"
  msgstr ""
  
! #: cp/parser.c:24911
  #, gcc-internal-format
  msgid "expected %<:%> or %<::%>"
  msgstr ""
  
! #: cp/parser.c:24939
  #, gcc-internal-format
  msgid "expected %<class%>, %<typename%>, or %<template%>"
  msgstr ""
  
! #: cp/parser.c:25200
  #, gcc-internal-format
  msgid "%qs tag used in naming %q#T"
  msgstr ""
  
! #: cp/parser.c:25205
  #, gcc-internal-format
  msgid "%q#T was previously declared here"
  msgstr ""
  
! #: cp/parser.c:25224
  #, gcc-internal-format
  msgid "%qD redeclared with different access"
  msgstr ""
  
! #: cp/parser.c:25245
  #, gcc-internal-format
  msgid ""
  "in C++98 %<template%> (as a disambiguator) is only allowed within templates"
  msgstr ""
  
! #: cp/parser.c:25477
  #, gcc-internal-format
  msgid "file ends in default argument"
  msgstr ""
  
! #: cp/parser.c:25707 cp/parser.c:26974 cp/parser.c:27160
  #, gcc-internal-format
  msgid "misplaced %<@%D%> Objective-C++ construct"
  msgstr ""
  
! #: cp/parser.c:25765
  #, gcc-internal-format
  msgid "objective-c++ message receiver expected"
  msgstr ""
  
! #: cp/parser.c:25835
  #, gcc-internal-format
  msgid "objective-c++ message argument(s) are expected"
  msgstr ""
  
! #: cp/parser.c:25864
  #, gcc-internal-format
  msgid "%<@encode%> must specify a type as an argument"
  msgstr ""
  
! #: cp/parser.c:26240
  #, gcc-internal-format
  msgid "invalid Objective-C++ selector name"
  msgstr ""
  
! #: cp/parser.c:26315 cp/parser.c:26333
  #, gcc-internal-format
  msgid "objective-c++ method declaration is expected"
  msgstr ""
  
! #: cp/parser.c:26327 cp/parser.c:26392
  #, gcc-internal-format
  msgid "method attributes must be specified at the end"
  msgstr ""
  
! #: cp/parser.c:26435
  #, gcc-internal-format
  msgid "stray %qs between Objective-C++ methods"
  msgstr ""
  
! #: cp/parser.c:26641 cp/parser.c:26648 cp/parser.c:26655
  #, gcc-internal-format
  msgid "invalid type for instance variable"
  msgstr ""
  
! #: cp/parser.c:26768
  #, gcc-internal-format
  msgid "identifier expected after %<@protocol%>"
  msgstr ""
  
! #: cp/parser.c:26939
  #, gcc-internal-format
  msgid ""
  "attributes may not be specified before the %<@%D%> Objective-C++ keyword"
  msgstr ""
  
! #: cp/parser.c:26946
  #, gcc-internal-format
  msgid "prefix attributes are ignored before %<@%D%>"
  msgstr ""
  
! #: cp/parser.c:27219 cp/parser.c:27226 cp/parser.c:27233
  #, gcc-internal-format
  msgid "invalid type for property"
  msgstr ""
  
! #: cp/parser.c:28072 cp/parser.c:28370 cp/parser.c:28436
  #, gcc-internal-format
  msgid "expected positive integer expression"
  msgstr ""
  
! #: cp/parser.c:28128
  #, gcc-internal-format
  msgid "%<wait%> expression must be integral"
  msgstr ""
  
! #: cp/parser.c:28554
  #, gcc-internal-format
  msgid "invalid reduction-identifier"
  msgstr ""
  
! #: cp/parser.c:30306
  #, gcc-internal-format
  msgid "parenthesized initialization is not allowed in OpenMP %<for%> loop"
  msgstr ""
  
! #: cp/parser.c:30309
  #, gcc-internal-format
  msgid "parenthesized initialization is not allowed in for-loop"
  msgstr ""
  
! #: cp/parser.c:30378
  #, gcc-internal-format
  msgid ""
  "%<_Cilk_for%> allows expression instead of declaration only in C, not in C++"
  msgstr ""
  
! #: cp/parser.c:30547 cp/pt.c:13811
  #, gcc-internal-format
  msgid "iteration variable %qD should not be reduction"
  msgstr ""
  
! #: cp/parser.c:30617
  #, gcc-internal-format
  msgid "not enough collapsed for loops"
  msgstr ""
  
! #: cp/parser.c:31916
  #, gcc-internal-format
  msgid ""
  "vector attribute not immediately followed by a single function declaration "
  "or definition"
  msgstr ""
  
! #: cp/parser.c:32143
  #, gcc-internal-format
  msgid "invalid initializer clause"
  msgstr ""
  
! #: cp/parser.c:32171
  #, gcc-internal-format
  msgid "expected id-expression (arguments)"
  msgstr ""
  
! #: cp/parser.c:32183
  #, gcc-internal-format
  msgid ""
  "one of the initializer call arguments should be %<omp_priv%> or %<&omp_priv%>"
  msgstr ""
  
! #: cp/parser.c:32264
  #, gcc-internal-format
  msgid ""
  "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, %<|%>, %<&&%>, %<||%> or "
  "identifier"
  msgstr ""
  
! #: cp/parser.c:32283
  #, gcc-internal-format
  msgid "types may not be defined in declare reduction type list"
  msgstr ""
  
! #: cp/parser.c:32305 cp/semantics.c:4993
  #, gcc-internal-format
  msgid "predeclared arithmetic type %qT in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: cp/parser.c:32310 cp/semantics.c:5002
  #, gcc-internal-format
  msgid "function or array type %qT in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: cp/parser.c:32313 cp/pt.c:10978 cp/semantics.c:5008
  #, gcc-internal-format
  msgid "reference type %qT in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: cp/parser.c:32316 cp/semantics.c:5014
  #, gcc-internal-format
  msgid ""
  "const, volatile or __restrict qualified type %qT in %<#pragma omp declare "
  "reduction%>"
  msgstr ""
  
! #: cp/parser.c:32703 cp/semantics.c:7070
  #, gcc-internal-format
  msgid "%<__transaction_relaxed%> without transactional memory support enabled"
  msgstr ""
  
! #: cp/parser.c:32705 cp/semantics.c:7072
  #, gcc-internal-format
  msgid "%<__transaction_atomic%> without transactional memory support enabled"
  msgstr ""
  
! #: cp/parser.c:32901
  #, gcc-internal-format
  msgid "junk at end of %<#pragma GCC pch_preprocess%>"
  msgstr ""
  
! #: cp/parser.c:32934
  #, gcc-internal-format
  msgid "invalid grainsize for _Cilk_for"
  msgstr ""
  
! #: cp/parser.c:33120
  #, gcc-internal-format
  msgid "%<#pragma GCC ivdep%> must be inside a function"
  msgstr ""
  
! #: cp/parser.c:33141
  #, gcc-internal-format
  msgid "%<#pragma simd%> must be inside a function"
  msgstr ""
  
! #: cp/parser.c:33151
  #, gcc-internal-format
  msgid "%<#pragma cilk grainsize%> must be inside a function"
  msgstr ""
  
! #: cp/parser.c:33163
  #, gcc-internal-format
  msgid "-fcilkplus must be enabled to use %<#pragma cilk grainsize%>"
  msgstr ""
  
! #: cp/parser.c:33221
  #, gcc-internal-format
  msgid "inter-module optimizations not implemented for C++"
  msgstr ""
  
! #: cp/parser.c:33331
  #, gcc-internal-format
  msgid "expected variable-name"
  msgstr ""
  
! #: cp/parser.c:33395
  #, gcc-internal-format
  msgid "expected %<,%> or %<)%> after %qE"
  msgstr ""
  
! #: cp/parser.c:33736
  #, gcc-internal-format
  msgid "implicit templates may not be %<virtual%>"
  msgstr ""
  
! #: cp/pt.c:297
  #, gcc-internal-format
  msgid "data member %qD cannot be a member template"
  msgstr ""
  
! #: cp/pt.c:309
  #, gcc-internal-format
  msgid "invalid member template declaration %qD"
  msgstr ""
  
! #: cp/pt.c:690
  #, gcc-internal-format
  msgid "explicit specialization in non-namespace scope %qD"
  msgstr ""
  
! #: cp/pt.c:704
  #, gcc-internal-format
  msgid "enclosing class templates are not explicitly specialized"
  msgstr ""
  
! #: cp/pt.c:790
  #, gcc-internal-format
  msgid "specialization of %qD must appear at namespace scope"
  msgstr ""
  
! #: cp/pt.c:798
  #, gcc-internal-format
  msgid "specialization of %qD in different namespace"
  msgstr ""
  
! #: cp/pt.c:799 cp/pt.c:926
  #, gcc-internal-format
  msgid "  from definition of %q+#D"
  msgstr ""
  
! #: cp/pt.c:816
  #, gcc-internal-format
  msgid ""
  "explicit instantiation of %qD in namespace %qD (which does not enclose "
  "namespace %qD)"
  msgstr ""
  
! #: cp/pt.c:839
  #, gcc-internal-format
  msgid "name of class shadows template template parameter %qD"
  msgstr ""
  
! #: cp/pt.c:850
  #, gcc-internal-format
  msgid "specialization of alias template %qD"
  msgstr ""
  
! #: cp/pt.c:853 cp/pt.c:988
  #, gcc-internal-format
  msgid "explicit specialization of non-template %qT"
  msgstr ""
  
! #: cp/pt.c:885
  #, gcc-internal-format
  msgid "specialization of %qT after instantiation"
  msgstr ""
  
! #: cp/pt.c:925
  #, gcc-internal-format
  msgid "specializing %q#T in different namespace"
  msgstr ""
  
  #. But if we've had an implicit instantiation, that's a
  #. problem ([temp.expl.spec]/6).
! #: cp/pt.c:966
  #, gcc-internal-format
  msgid "specialization %qT after instantiation %qT"
  msgstr ""
  
! #: cp/pt.c:984
  #, gcc-internal-format
  msgid "template specialization of %qD not allowed by ISO C++"
  msgstr ""
  
! #: cp/pt.c:1416
  #, gcc-internal-format
  msgid "specialization of %qD after instantiation"
  msgstr ""
  
! #: cp/pt.c:1804
  #, gcc-internal-format
  msgid "candidate is: %#D"
  msgstr ""
  
! #: cp/pt.c:1811 cp/semantics.c:4862
  #, gcc-internal-format
  msgid "%s %#D"
  msgstr ""
  
! #: cp/pt.c:1905
  #, gcc-internal-format
  msgid "%qD is not a function template"
  msgstr ""
  
! #: cp/pt.c:1910
  #, gcc-internal-format
  msgid "%qD is not a variable template"
  msgstr ""
  
! #: cp/pt.c:2132
  #, gcc-internal-format
  msgid "template-id %qD for %q+D does not match any template declaration"
  msgstr ""
  
! #: cp/pt.c:2135
  #, gcc-internal-format
  msgid ""
  "saw %d %<template<>%>, need %d for specializing a member function template"
  msgstr ""
  
! #: cp/pt.c:2144
  #, gcc-internal-format
  msgid "ambiguous template specialization %qD for %q+D"
  msgstr ""
  
! #: cp/pt.c:2350
  #, gcc-internal-format
  msgid "variable templates only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/pt.c:2359
  #, gcc-internal-format
  msgid "too many template headers for %D (should be %d)"
  msgstr ""
  
! #: cp/pt.c:2364
  #, gcc-internal-format
  msgid ""
  "members of an explicitly specialized class are defined without a template "
--- 40430,41045 ----
  #. something like:
  #.
  #. template <class T> template <class U> void S::f();
! #: cp/parser.c:23161
  #, gcc-internal-format
  msgid "too many template-parameter-lists"
  msgstr ""
  
! #: cp/parser.c:23485
  #, gcc-internal-format
  msgid "named return values are no longer supported"
  msgstr ""
  
! #: cp/parser.c:23582
  #, gcc-internal-format
  msgid "invalid declaration of member template in local class"
  msgstr ""
  
! #: cp/parser.c:23591
  #, gcc-internal-format
  msgid "template with C linkage"
  msgstr ""
  
! #: cp/parser.c:23610
  #, gcc-internal-format
  msgid "invalid explicit specialization"
  msgstr ""
  
! #: cp/parser.c:23708
  #, gcc-internal-format
  msgid ""
  "literal operator template %qD has invalid parameter list.  Expected non-type "
  "template argument pack <char...> or <typename CharT, CharT...>"
  msgstr ""
  
! #: cp/parser.c:23713
  #, gcc-internal-format
  msgid ""
  "literal operator template %qD has invalid parameter list.  Expected non-type "
  "template argument pack <char...>"
  msgstr ""
  
! #: cp/parser.c:23787
  #, gcc-internal-format
  msgid "template declaration of %<typedef%>"
  msgstr ""
  
! #: cp/parser.c:23864
  #, gcc-internal-format
  msgid "explicit template specialization cannot have a storage class"
  msgstr ""
  
! #: cp/parser.c:24145
  #, gcc-internal-format
  msgid "%<>>%> should be %<> >%> within a nested template argument list"
  msgstr ""
  
! #: cp/parser.c:24158
  #, gcc-internal-format
  msgid "spurious %<>>%>, use %<>%> to terminate a template argument list"
  msgstr ""
  
! #: cp/parser.c:24455
  #, gcc-internal-format
  msgid "%<sizeof...%> argument must be surrounded by parentheses"
  msgstr ""
  
! #: cp/parser.c:24611
  #, gcc-internal-format
  msgid "invalid use of %qD in linkage specification"
  msgstr ""
  
! #: cp/parser.c:24626
  #, gcc-internal-format
  msgid "%<__thread%> before %qD"
  msgstr ""
  
! #: cp/parser.c:24760
  #, gcc-internal-format
  msgid "ISO C++ 1998 does not support %<long long%>"
  msgstr ""
  
! #: cp/parser.c:24768
  #, gcc-internal-format
  msgid "both %<__thread%> and %<thread_local%> specified"
  msgstr ""
  
! #: cp/parser.c:24770
  #, gcc-internal-format
  msgid "duplicate %qD"
  msgstr ""
  
! #: cp/parser.c:24792
  #, gcc-internal-format
  msgid "duplicate %qs"
  msgstr ""
  
! #: cp/parser.c:24834
  #, gcc-internal-format
  msgid "expected %<new%>"
  msgstr ""
  
! #: cp/parser.c:24837
  #, gcc-internal-format
  msgid "expected %<delete%>"
  msgstr ""
  
! #: cp/parser.c:24840
  #, gcc-internal-format
  msgid "expected %<return%>"
  msgstr ""
  
! #: cp/parser.c:24846
  #, gcc-internal-format
  msgid "expected %<extern%>"
  msgstr ""
  
! #: cp/parser.c:24849
  #, gcc-internal-format
  msgid "expected %<static_assert%>"
  msgstr ""
  
! #: cp/parser.c:24852
  #, gcc-internal-format
  msgid "expected %<decltype%>"
  msgstr ""
  
! #: cp/parser.c:24855
  #, gcc-internal-format
  msgid "expected %<operator%>"
  msgstr ""
  
! #: cp/parser.c:24858
  #, gcc-internal-format
  msgid "expected %<class%>"
  msgstr ""
  
! #: cp/parser.c:24861
  #, gcc-internal-format
  msgid "expected %<template%>"
  msgstr ""
  
! #: cp/parser.c:24864
  #, gcc-internal-format
  msgid "expected %<namespace%>"
  msgstr ""
  
! #: cp/parser.c:24867
  #, gcc-internal-format
  msgid "expected %<using%>"
  msgstr ""
  
! #: cp/parser.c:24870
  #, gcc-internal-format
  msgid "expected %<asm%>"
  msgstr ""
  
! #: cp/parser.c:24873
  #, gcc-internal-format
  msgid "expected %<try%>"
  msgstr ""
  
! #: cp/parser.c:24876
  #, gcc-internal-format
  msgid "expected %<catch%>"
  msgstr ""
  
! #: cp/parser.c:24879
  #, gcc-internal-format
  msgid "expected %<throw%>"
  msgstr ""
  
! #: cp/parser.c:24882
  #, gcc-internal-format
  msgid "expected %<__label__%>"
  msgstr ""
  
! #: cp/parser.c:24885
  #, gcc-internal-format
  msgid "expected %<@try%>"
  msgstr ""
  
! #: cp/parser.c:24888
  #, gcc-internal-format
  msgid "expected %<@synchronized%>"
  msgstr ""
  
! #: cp/parser.c:24891
  #, gcc-internal-format
  msgid "expected %<@throw%>"
  msgstr ""
  
! #: cp/parser.c:24894
  #, gcc-internal-format
  msgid "expected %<__transaction_atomic%>"
  msgstr ""
  
! #: cp/parser.c:24897
  #, gcc-internal-format
  msgid "expected %<__transaction_relaxed%>"
  msgstr ""
  
! #: cp/parser.c:24928
  #, gcc-internal-format
  msgid "expected %<::%>"
  msgstr ""
  
! #: cp/parser.c:24940
  #, gcc-internal-format
  msgid "expected %<...%>"
  msgstr ""
  
! #: cp/parser.c:24943
  #, gcc-internal-format
  msgid "expected %<*%>"
  msgstr ""
  
! #: cp/parser.c:24946
  #, gcc-internal-format
  msgid "expected %<~%>"
  msgstr ""
  
! #: cp/parser.c:24952
  #, gcc-internal-format
  msgid "expected %<:%> or %<::%>"
  msgstr ""
  
! #: cp/parser.c:24980
  #, gcc-internal-format
  msgid "expected %<class%>, %<typename%>, or %<template%>"
  msgstr ""
  
! #: cp/parser.c:25241
  #, gcc-internal-format
  msgid "%qs tag used in naming %q#T"
  msgstr ""
  
! #: cp/parser.c:25246
  #, gcc-internal-format
  msgid "%q#T was previously declared here"
  msgstr ""
  
! #: cp/parser.c:25265
  #, gcc-internal-format
  msgid "%qD redeclared with different access"
  msgstr ""
  
! #: cp/parser.c:25286
  #, gcc-internal-format
  msgid ""
  "in C++98 %<template%> (as a disambiguator) is only allowed within templates"
  msgstr ""
  
! #: cp/parser.c:25518
  #, gcc-internal-format
  msgid "file ends in default argument"
  msgstr ""
  
! #: cp/parser.c:25748 cp/parser.c:27015 cp/parser.c:27201
  #, gcc-internal-format
  msgid "misplaced %<@%D%> Objective-C++ construct"
  msgstr ""
  
! #: cp/parser.c:25806
  #, gcc-internal-format
  msgid "objective-c++ message receiver expected"
  msgstr ""
  
! #: cp/parser.c:25876
  #, gcc-internal-format
  msgid "objective-c++ message argument(s) are expected"
  msgstr ""
  
! #: cp/parser.c:25905
  #, gcc-internal-format
  msgid "%<@encode%> must specify a type as an argument"
  msgstr ""
  
! #: cp/parser.c:26281
  #, gcc-internal-format
  msgid "invalid Objective-C++ selector name"
  msgstr ""
  
! #: cp/parser.c:26356 cp/parser.c:26374
  #, gcc-internal-format
  msgid "objective-c++ method declaration is expected"
  msgstr ""
  
! #: cp/parser.c:26368 cp/parser.c:26433
  #, gcc-internal-format
  msgid "method attributes must be specified at the end"
  msgstr ""
  
! #: cp/parser.c:26476
  #, gcc-internal-format
  msgid "stray %qs between Objective-C++ methods"
  msgstr ""
  
! #: cp/parser.c:26682 cp/parser.c:26689 cp/parser.c:26696
  #, gcc-internal-format
  msgid "invalid type for instance variable"
  msgstr ""
  
! #: cp/parser.c:26809
  #, gcc-internal-format
  msgid "identifier expected after %<@protocol%>"
  msgstr ""
  
! #: cp/parser.c:26980
  #, gcc-internal-format
  msgid ""
  "attributes may not be specified before the %<@%D%> Objective-C++ keyword"
  msgstr ""
  
! #: cp/parser.c:26987
  #, gcc-internal-format
  msgid "prefix attributes are ignored before %<@%D%>"
  msgstr ""
  
! #: cp/parser.c:27260 cp/parser.c:27267 cp/parser.c:27274
  #, gcc-internal-format
  msgid "invalid type for property"
  msgstr ""
  
! #: cp/parser.c:28113 cp/parser.c:28411 cp/parser.c:28477
  #, gcc-internal-format
  msgid "expected positive integer expression"
  msgstr ""
  
! #: cp/parser.c:28169
  #, gcc-internal-format
  msgid "%<wait%> expression must be integral"
  msgstr ""
  
! #: cp/parser.c:28595
  #, gcc-internal-format
  msgid "invalid reduction-identifier"
  msgstr ""
  
! #: cp/parser.c:30347
  #, gcc-internal-format
  msgid "parenthesized initialization is not allowed in OpenMP %<for%> loop"
  msgstr ""
  
! #: cp/parser.c:30350
  #, gcc-internal-format
  msgid "parenthesized initialization is not allowed in for-loop"
  msgstr ""
  
! #: cp/parser.c:30419
  #, gcc-internal-format
  msgid ""
  "%<_Cilk_for%> allows expression instead of declaration only in C, not in C++"
  msgstr ""
  
! #: cp/parser.c:30588 cp/pt.c:13887
  #, gcc-internal-format
  msgid "iteration variable %qD should not be reduction"
  msgstr ""
  
! #: cp/parser.c:30658
  #, gcc-internal-format
  msgid "not enough collapsed for loops"
  msgstr ""
  
! #: cp/parser.c:31957
  #, gcc-internal-format
  msgid ""
  "vector attribute not immediately followed by a single function declaration "
  "or definition"
  msgstr ""
  
! #: cp/parser.c:32184
  #, gcc-internal-format
  msgid "invalid initializer clause"
  msgstr ""
  
! #: cp/parser.c:32212
  #, gcc-internal-format
  msgid "expected id-expression (arguments)"
  msgstr ""
  
! #: cp/parser.c:32224
  #, gcc-internal-format
  msgid ""
  "one of the initializer call arguments should be %<omp_priv%> or %<&omp_priv%>"
  msgstr ""
  
! #: cp/parser.c:32305
  #, gcc-internal-format
  msgid ""
  "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, %<|%>, %<&&%>, %<||%> or "
  "identifier"
  msgstr ""
  
! #: cp/parser.c:32324
  #, gcc-internal-format
  msgid "types may not be defined in declare reduction type list"
  msgstr ""
  
! #: cp/parser.c:32346 cp/semantics.c:4994
  #, gcc-internal-format
  msgid "predeclared arithmetic type %qT in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: cp/parser.c:32351 cp/semantics.c:5003
  #, gcc-internal-format
  msgid "function or array type %qT in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: cp/parser.c:32354 cp/pt.c:11033 cp/semantics.c:5009
  #, gcc-internal-format
  msgid "reference type %qT in %<#pragma omp declare reduction%>"
  msgstr ""
  
! #: cp/parser.c:32357 cp/semantics.c:5015
  #, gcc-internal-format
  msgid ""
  "const, volatile or __restrict qualified type %qT in %<#pragma omp declare "
  "reduction%>"
  msgstr ""
  
! #: cp/parser.c:32745 cp/semantics.c:7075
  #, gcc-internal-format
  msgid "%<__transaction_relaxed%> without transactional memory support enabled"
  msgstr ""
  
! #: cp/parser.c:32747 cp/semantics.c:7077
  #, gcc-internal-format
  msgid "%<__transaction_atomic%> without transactional memory support enabled"
  msgstr ""
  
! #: cp/parser.c:32943
  #, gcc-internal-format
  msgid "junk at end of %<#pragma GCC pch_preprocess%>"
  msgstr ""
  
! #: cp/parser.c:32976
  #, gcc-internal-format
  msgid "invalid grainsize for _Cilk_for"
  msgstr ""
  
! #: cp/parser.c:33162
  #, gcc-internal-format
  msgid "%<#pragma GCC ivdep%> must be inside a function"
  msgstr ""
  
! #: cp/parser.c:33183
  #, gcc-internal-format
  msgid "%<#pragma simd%> must be inside a function"
  msgstr ""
  
! #: cp/parser.c:33193
  #, gcc-internal-format
  msgid "%<#pragma cilk grainsize%> must be inside a function"
  msgstr ""
  
! #: cp/parser.c:33205
  #, gcc-internal-format
  msgid "-fcilkplus must be enabled to use %<#pragma cilk grainsize%>"
  msgstr ""
  
! #: cp/parser.c:33263
  #, gcc-internal-format
  msgid "inter-module optimizations not implemented for C++"
  msgstr ""
  
! #: cp/parser.c:33373
  #, gcc-internal-format
  msgid "expected variable-name"
  msgstr ""
  
! #: cp/parser.c:33437
  #, gcc-internal-format
  msgid "expected %<,%> or %<)%> after %qE"
  msgstr ""
  
! #: cp/parser.c:33778
  #, gcc-internal-format
  msgid "implicit templates may not be %<virtual%>"
  msgstr ""
  
! #: cp/pt.c:298
  #, gcc-internal-format
  msgid "data member %qD cannot be a member template"
  msgstr ""
  
! #: cp/pt.c:310
  #, gcc-internal-format
  msgid "invalid member template declaration %qD"
  msgstr ""
  
! #: cp/pt.c:691
  #, gcc-internal-format
  msgid "explicit specialization in non-namespace scope %qD"
  msgstr ""
  
! #: cp/pt.c:705
  #, gcc-internal-format
  msgid "enclosing class templates are not explicitly specialized"
  msgstr ""
  
! #: cp/pt.c:791
  #, gcc-internal-format
  msgid "specialization of %qD must appear at namespace scope"
  msgstr ""
  
! #: cp/pt.c:799
  #, gcc-internal-format
  msgid "specialization of %qD in different namespace"
  msgstr ""
  
! #: cp/pt.c:800 cp/pt.c:927
  #, gcc-internal-format
  msgid "  from definition of %q+#D"
  msgstr ""
  
! #: cp/pt.c:817
  #, gcc-internal-format
  msgid ""
  "explicit instantiation of %qD in namespace %qD (which does not enclose "
  "namespace %qD)"
  msgstr ""
  
! #: cp/pt.c:840
  #, gcc-internal-format
  msgid "name of class shadows template template parameter %qD"
  msgstr ""
  
! #: cp/pt.c:851
  #, gcc-internal-format
  msgid "specialization of alias template %qD"
  msgstr ""
  
! #: cp/pt.c:854 cp/pt.c:989
  #, gcc-internal-format
  msgid "explicit specialization of non-template %qT"
  msgstr ""
  
! #: cp/pt.c:886
  #, gcc-internal-format
  msgid "specialization of %qT after instantiation"
  msgstr ""
  
! #: cp/pt.c:926
  #, gcc-internal-format
  msgid "specializing %q#T in different namespace"
  msgstr ""
  
  #. But if we've had an implicit instantiation, that's a
  #. problem ([temp.expl.spec]/6).
! #: cp/pt.c:967
  #, gcc-internal-format
  msgid "specialization %qT after instantiation %qT"
  msgstr ""
  
! #: cp/pt.c:985
  #, gcc-internal-format
  msgid "template specialization of %qD not allowed by ISO C++"
  msgstr ""
  
! #: cp/pt.c:1417
  #, gcc-internal-format
  msgid "specialization of %qD after instantiation"
  msgstr ""
  
! #: cp/pt.c:1805
  #, gcc-internal-format
  msgid "candidate is: %#D"
  msgstr ""
  
! #: cp/pt.c:1812 cp/semantics.c:4863
  #, gcc-internal-format
  msgid "%s %#D"
  msgstr ""
  
! #: cp/pt.c:1906
  #, gcc-internal-format
  msgid "%qD is not a function template"
  msgstr ""
  
! #: cp/pt.c:1911
  #, gcc-internal-format
  msgid "%qD is not a variable template"
  msgstr ""
  
! #: cp/pt.c:2133
  #, gcc-internal-format
  msgid "template-id %qD for %q+D does not match any template declaration"
  msgstr ""
  
! #: cp/pt.c:2136
  #, gcc-internal-format
  msgid ""
  "saw %d %<template<>%>, need %d for specializing a member function template"
  msgstr ""
  
! #: cp/pt.c:2145
  #, gcc-internal-format
  msgid "ambiguous template specialization %qD for %q+D"
  msgstr ""
  
! #: cp/pt.c:2351
  #, gcc-internal-format
  msgid "variable templates only available with -std=c++14 or -std=gnu++14"
  msgstr ""
  
! #: cp/pt.c:2360
  #, gcc-internal-format
  msgid "too many template headers for %D (should be %d)"
  msgstr ""
  
! #: cp/pt.c:2365
  #, gcc-internal-format
  msgid ""
  "members of an explicitly specialized class are defined without a template "
*************** msgstr ""
*** 40870,40926 ****
  
  #. This case handles bogus declarations like template <>
  #. template <class T> void f<int>();
! #: cp/pt.c:2452 cp/pt.c:2508
  #, gcc-internal-format
  msgid "template-id %qD in declaration of primary template"
  msgstr ""
  
! #: cp/pt.c:2465
  #, gcc-internal-format
  msgid "template parameter list used in explicit instantiation"
  msgstr ""
  
! #: cp/pt.c:2471
  #, gcc-internal-format
  msgid "definition provided for explicit instantiation"
  msgstr ""
  
! #: cp/pt.c:2479
  #, gcc-internal-format
  msgid "too many template parameter lists in declaration of %qD"
  msgstr ""
  
! #: cp/pt.c:2482
  #, gcc-internal-format
  msgid "too few template parameter lists in declaration of %qD"
  msgstr ""
  
! #: cp/pt.c:2484
  #, gcc-internal-format
  msgid "explicit specialization of %qD must be introduced by %<template <>%>"
  msgstr ""
  
! #: cp/pt.c:2518
  #, gcc-internal-format
  msgid "non-type partial specialization %qD is not allowed"
  msgstr ""
  
! #: cp/pt.c:2521
  #, gcc-internal-format
  msgid "non-class, non-variable partial specialization %qD is not allowed"
  msgstr ""
  
! #: cp/pt.c:2554
  #, gcc-internal-format
  msgid "default argument specified in explicit specialization"
  msgstr ""
  
! #: cp/pt.c:2585
  #, gcc-internal-format
  msgid "%qD is not a template function"
  msgstr ""
  
! #: cp/pt.c:2593
  #, gcc-internal-format
  msgid "%qD is not declared in %qD"
  msgstr ""
--- 41048,41104 ----
  
  #. This case handles bogus declarations like template <>
  #. template <class T> void f<int>();
! #: cp/pt.c:2453 cp/pt.c:2509
  #, gcc-internal-format
  msgid "template-id %qD in declaration of primary template"
  msgstr ""
  
! #: cp/pt.c:2466
  #, gcc-internal-format
  msgid "template parameter list used in explicit instantiation"
  msgstr ""
  
! #: cp/pt.c:2472
  #, gcc-internal-format
  msgid "definition provided for explicit instantiation"
  msgstr ""
  
! #: cp/pt.c:2480
  #, gcc-internal-format
  msgid "too many template parameter lists in declaration of %qD"
  msgstr ""
  
! #: cp/pt.c:2483
  #, gcc-internal-format
  msgid "too few template parameter lists in declaration of %qD"
  msgstr ""
  
! #: cp/pt.c:2485
  #, gcc-internal-format
  msgid "explicit specialization of %qD must be introduced by %<template <>%>"
  msgstr ""
  
! #: cp/pt.c:2519
  #, gcc-internal-format
  msgid "non-type partial specialization %qD is not allowed"
  msgstr ""
  
! #: cp/pt.c:2522
  #, gcc-internal-format
  msgid "non-class, non-variable partial specialization %qD is not allowed"
  msgstr ""
  
! #: cp/pt.c:2555
  #, gcc-internal-format
  msgid "default argument specified in explicit specialization"
  msgstr ""
  
! #: cp/pt.c:2586
  #, gcc-internal-format
  msgid "%qD is not a template function"
  msgstr ""
  
! #: cp/pt.c:2594
  #, gcc-internal-format
  msgid "%qD is not declared in %qD"
  msgstr ""
*************** msgstr ""
*** 40933,41040 ****
  #. program is ill-formed.
  #.
  #. Similar language is found in [temp.explicit].
! #: cp/pt.c:2658
  #, gcc-internal-format
  msgid "specialization of implicitly-declared special member function"
  msgstr ""
  
! #: cp/pt.c:2702
  #, gcc-internal-format
  msgid "no member function %qD declared in %qT"
  msgstr ""
  
! #: cp/pt.c:3382
  #, gcc-internal-format
  msgid "base initializer expansion %<%T%> contains no parameter packs"
  msgstr ""
  
! #: cp/pt.c:3443
  #, gcc-internal-format
  msgid "expansion pattern %<%T%> contains no argument packs"
  msgstr ""
  
! #: cp/pt.c:3445
  #, gcc-internal-format
  msgid "expansion pattern %<%E%> contains no argument packs"
  msgstr ""
  
! #: cp/pt.c:3488
  #, gcc-internal-format
  msgid "parameter packs not expanded with %<...%>:"
  msgstr ""
  
! #: cp/pt.c:3503 cp/pt.c:4214
  #, gcc-internal-format
  msgid "        %qD"
  msgstr ""
  
! #: cp/pt.c:3505
  #, gcc-internal-format
  msgid "        <anonymous>"
  msgstr ""
  
! #: cp/pt.c:3628
  #, gcc-internal-format
  msgid "declaration of %q+#D"
  msgstr ""
  
! #: cp/pt.c:3629
  #, gcc-internal-format
  msgid " shadows template parm %q+#D"
  msgstr ""
  
! #: cp/pt.c:4209
  #, gcc-internal-format
  msgid "template parameters not deducible in partial specialization:"
  msgstr ""
  
! #: cp/pt.c:4228
  #, gcc-internal-format
  msgid "partial specialization %qD does not specialize any template arguments"
  msgstr ""
  
! #: cp/pt.c:4236
  #, gcc-internal-format
  msgid ""
  "partial specialization is not more specialized than the primary template "
  "because it replaces multiple parameters with a pack expansion"
  msgstr ""
  
! #: cp/pt.c:4239
  #, gcc-internal-format
  msgid "primary template here"
  msgstr ""
  
! #: cp/pt.c:4286
  #, gcc-internal-format
  msgid ""
  "parameter pack argument %qE must be at the end of the template argument list"
  msgstr ""
  
! #: cp/pt.c:4289
  #, gcc-internal-format
  msgid ""
  "parameter pack argument %qT must be at the end of the template argument list"
  msgstr ""
  
! #: cp/pt.c:4310
  #, gcc-internal-format
  msgid "template argument %qE involves template parameter(s)"
  msgstr ""
  
! #: cp/pt.c:4356
  #, gcc-internal-format
  msgid "type %qT of template argument %qE depends on a template parameter"
  msgid_plural "type %qT of template argument %qE depends on template parameters"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/pt.c:4400
  #, gcc-internal-format
  msgid "partial specialization of %qD after instantiation of %qD"
  msgstr ""
  
! #: cp/pt.c:4576
  #, gcc-internal-format
  msgid "no default argument for %qD"
  msgstr ""
--- 41111,41218 ----
  #. program is ill-formed.
  #.
  #. Similar language is found in [temp.explicit].
! #: cp/pt.c:2659
  #, gcc-internal-format
  msgid "specialization of implicitly-declared special member function"
  msgstr ""
  
! #: cp/pt.c:2703
  #, gcc-internal-format
  msgid "no member function %qD declared in %qT"
  msgstr ""
  
! #: cp/pt.c:3390
  #, gcc-internal-format
  msgid "base initializer expansion %<%T%> contains no parameter packs"
  msgstr ""
  
! #: cp/pt.c:3451
  #, gcc-internal-format
  msgid "expansion pattern %<%T%> contains no argument packs"
  msgstr ""
  
! #: cp/pt.c:3453
  #, gcc-internal-format
  msgid "expansion pattern %<%E%> contains no argument packs"
  msgstr ""
  
! #: cp/pt.c:3496
  #, gcc-internal-format
  msgid "parameter packs not expanded with %<...%>:"
  msgstr ""
  
! #: cp/pt.c:3511 cp/pt.c:4222
  #, gcc-internal-format
  msgid "        %qD"
  msgstr ""
  
! #: cp/pt.c:3513
  #, gcc-internal-format
  msgid "        <anonymous>"
  msgstr ""
  
! #: cp/pt.c:3636
  #, gcc-internal-format
  msgid "declaration of %q+#D"
  msgstr ""
  
! #: cp/pt.c:3637
  #, gcc-internal-format
  msgid " shadows template parm %q+#D"
  msgstr ""
  
! #: cp/pt.c:4217
  #, gcc-internal-format
  msgid "template parameters not deducible in partial specialization:"
  msgstr ""
  
! #: cp/pt.c:4236
  #, gcc-internal-format
  msgid "partial specialization %qD does not specialize any template arguments"
  msgstr ""
  
! #: cp/pt.c:4244
  #, gcc-internal-format
  msgid ""
  "partial specialization is not more specialized than the primary template "
  "because it replaces multiple parameters with a pack expansion"
  msgstr ""
  
! #: cp/pt.c:4247
  #, gcc-internal-format
  msgid "primary template here"
  msgstr ""
  
! #: cp/pt.c:4294
  #, gcc-internal-format
  msgid ""
  "parameter pack argument %qE must be at the end of the template argument list"
  msgstr ""
  
! #: cp/pt.c:4297
  #, gcc-internal-format
  msgid ""
  "parameter pack argument %qT must be at the end of the template argument list"
  msgstr ""
  
! #: cp/pt.c:4318
  #, gcc-internal-format
  msgid "template argument %qE involves template parameter(s)"
  msgstr ""
  
! #: cp/pt.c:4364
  #, gcc-internal-format
  msgid "type %qT of template argument %qE depends on a template parameter"
  msgid_plural "type %qT of template argument %qE depends on template parameters"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/pt.c:4408
  #, gcc-internal-format
  msgid "partial specialization of %qD after instantiation of %qD"
  msgstr ""
  
! #: cp/pt.c:4584
  #, gcc-internal-format
  msgid "no default argument for %qD"
  msgstr ""
*************** msgstr ""
*** 41042,41089 ****
  #. A primary class template can only have one
  #. parameter pack, at the end of the template
  #. parameter list.
! #: cp/pt.c:4598
  #, gcc-internal-format
  msgid "parameter pack %q+D must be at the end of the template parameter list"
  msgstr ""
  
! #: cp/pt.c:4634
  #, gcc-internal-format
  msgid ""
  "default template arguments may not be used in function template friend re-"
  "declaration"
  msgstr ""
  
! #: cp/pt.c:4637
  #, gcc-internal-format
  msgid ""
  "default template arguments may not be used in function template friend "
  "declarations"
  msgstr ""
  
! #: cp/pt.c:4640
  #, gcc-internal-format
  msgid ""
  "default template arguments may not be used in function templates without -"
  "std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/pt.c:4643
  #, gcc-internal-format
  msgid "default template arguments may not be used in partial specializations"
  msgstr ""
  
! #: cp/pt.c:4646 cp/pt.c:4697
  #, gcc-internal-format
  msgid "default argument for template parameter for class enclosing %qD"
  msgstr ""
  
! #: cp/pt.c:4798
  #, gcc-internal-format
  msgid "template class without a name"
  msgstr ""
  
! #: cp/pt.c:4806
  #, gcc-internal-format
  msgid "member template %qD may not have virt-specifiers"
  msgstr ""
--- 41220,41267 ----
  #. A primary class template can only have one
  #. parameter pack, at the end of the template
  #. parameter list.
! #: cp/pt.c:4606
  #, gcc-internal-format
  msgid "parameter pack %q+D must be at the end of the template parameter list"
  msgstr ""
  
! #: cp/pt.c:4642
  #, gcc-internal-format
  msgid ""
  "default template arguments may not be used in function template friend re-"
  "declaration"
  msgstr ""
  
! #: cp/pt.c:4645
  #, gcc-internal-format
  msgid ""
  "default template arguments may not be used in function template friend "
  "declarations"
  msgstr ""
  
! #: cp/pt.c:4648
  #, gcc-internal-format
  msgid ""
  "default template arguments may not be used in function templates without -"
  "std=c++11 or -std=gnu++11"
  msgstr ""
  
! #: cp/pt.c:4651
  #, gcc-internal-format
  msgid "default template arguments may not be used in partial specializations"
  msgstr ""
  
! #: cp/pt.c:4654 cp/pt.c:4705
  #, gcc-internal-format
  msgid "default argument for template parameter for class enclosing %qD"
  msgstr ""
  
! #: cp/pt.c:4806
  #, gcc-internal-format
  msgid "template class without a name"
  msgstr ""
  
! #: cp/pt.c:4814
  #, gcc-internal-format
  msgid "member template %qD may not have virt-specifiers"
  msgstr ""
*************** msgstr ""
*** 41093,41168 ****
  #. An allocation function can be a function
  #. template. ... Template allocation functions shall
  #. have two or more parameters.
! #: cp/pt.c:4828
  #, gcc-internal-format
  msgid "invalid template declaration of %qD"
  msgstr ""
  
! #: cp/pt.c:4956
  #, gcc-internal-format
  msgid "template definition of non-template %q#D"
  msgstr ""
  
! #: cp/pt.c:4999
  #, gcc-internal-format
  msgid "expected %d levels of template parms for %q#D, got %d"
  msgstr ""
  
! #: cp/pt.c:5013
  #, gcc-internal-format
  msgid "got %d template parameters for %q#D"
  msgstr ""
  
! #: cp/pt.c:5016
  #, gcc-internal-format
  msgid "got %d template parameters for %q#T"
  msgstr ""
  
! #: cp/pt.c:5018
  #, gcc-internal-format, gfc-internal-format
  msgid "  but %d required"
  msgstr ""
  
! #: cp/pt.c:5039
  #, gcc-internal-format
  msgid "template arguments to %qD do not match original template %qD"
  msgstr ""
  
! #: cp/pt.c:5043
  #, gcc-internal-format
  msgid "use template<> for an explicit specialization"
  msgstr ""
  
! #: cp/pt.c:5181
  #, gcc-internal-format
  msgid "%qT is not a template type"
  msgstr ""
  
! #: cp/pt.c:5194
  #, gcc-internal-format
  msgid "template specifiers not specified in declaration of %qD"
  msgstr ""
  
! #: cp/pt.c:5205
  #, gcc-internal-format, gfc-internal-format
  msgid "redeclared with %d template parameter"
  msgid_plural "redeclared with %d template parameters"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/pt.c:5209
  #, gcc-internal-format
  msgid "previous declaration %q+D used %d template parameter"
  msgid_plural "previous declaration %q+D used %d template parameters"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/pt.c:5246
  #, gcc-internal-format
  msgid "template parameter %q+#D"
  msgstr ""
  
! #: cp/pt.c:5247
  #, gcc-internal-format
  msgid "redeclared here as %q#D"
  msgstr ""
--- 41271,41346 ----
  #. An allocation function can be a function
  #. template. ... Template allocation functions shall
  #. have two or more parameters.
! #: cp/pt.c:4836
  #, gcc-internal-format
  msgid "invalid template declaration of %qD"
  msgstr ""
  
! #: cp/pt.c:4964
  #, gcc-internal-format
  msgid "template definition of non-template %q#D"
  msgstr ""
  
! #: cp/pt.c:5007
  #, gcc-internal-format
  msgid "expected %d levels of template parms for %q#D, got %d"
  msgstr ""
  
! #: cp/pt.c:5021
  #, gcc-internal-format
  msgid "got %d template parameters for %q#D"
  msgstr ""
  
! #: cp/pt.c:5024
  #, gcc-internal-format
  msgid "got %d template parameters for %q#T"
  msgstr ""
  
! #: cp/pt.c:5026
  #, gcc-internal-format, gfc-internal-format
  msgid "  but %d required"
  msgstr ""
  
! #: cp/pt.c:5047
  #, gcc-internal-format
  msgid "template arguments to %qD do not match original template %qD"
  msgstr ""
  
! #: cp/pt.c:5051
  #, gcc-internal-format
  msgid "use template<> for an explicit specialization"
  msgstr ""
  
! #: cp/pt.c:5189
  #, gcc-internal-format
  msgid "%qT is not a template type"
  msgstr ""
  
! #: cp/pt.c:5202
  #, gcc-internal-format
  msgid "template specifiers not specified in declaration of %qD"
  msgstr ""
  
! #: cp/pt.c:5213
  #, gcc-internal-format, gfc-internal-format
  msgid "redeclared with %d template parameter"
  msgid_plural "redeclared with %d template parameters"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/pt.c:5217
  #, gcc-internal-format
  msgid "previous declaration %q+D used %d template parameter"
  msgid_plural "previous declaration %q+D used %d template parameters"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/pt.c:5254
  #, gcc-internal-format
  msgid "template parameter %q+#D"
  msgstr ""
  
! #: cp/pt.c:5255
  #, gcc-internal-format
  msgid "redeclared here as %q#D"
  msgstr ""
*************** msgstr ""
*** 41171,41552 ****
  #.
  #. A template-parameter may not be given default arguments
  #. by two different declarations in the same scope.
! #: cp/pt.c:5257
  #, gcc-internal-format
  msgid "redefinition of default argument for %q#D"
  msgstr ""
  
! #: cp/pt.c:5259
  #, gcc-internal-format
  msgid "original definition appeared here"
  msgstr ""
  
! #: cp/pt.c:5492 cp/pt.c:5543
  #, gcc-internal-format
  msgid "%qE is not a valid template argument for type %qT"
  msgstr ""
  
! #: cp/pt.c:5495
  #, gcc-internal-format
  msgid "it must be the address of a function with external linkage"
  msgstr ""
  
! #: cp/pt.c:5498
  #, gcc-internal-format
  msgid "it must be the name of a function with external linkage"
  msgstr ""
  
! #: cp/pt.c:5510
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because %qD has no linkage"
  msgstr ""
  
! #: cp/pt.c:5514
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because %qD does not have "
  "external linkage"
  msgstr ""
  
! #: cp/pt.c:5545
  #, gcc-internal-format
  msgid "it must be a pointer-to-member of the form %<&X::Y%>"
  msgstr ""
  
! #: cp/pt.c:5596
  #, gcc-internal-format
  msgid "  couldn't deduce template parameter %qD"
  msgstr ""
  
! #: cp/pt.c:5611
  #, gcc-internal-format
  msgid "  types %qT and %qT have incompatible cv-qualifiers"
  msgstr ""
  
! #: cp/pt.c:5620
  #, gcc-internal-format
  msgid "  mismatched types %qT and %qT"
  msgstr ""
  
! #: cp/pt.c:5629
  #, gcc-internal-format
  msgid "  template parameter %qD is not a parameter pack, but argument %qD is"
  msgstr ""
  
! #: cp/pt.c:5640
  #, gcc-internal-format
  msgid "  template argument %qE does not match pointer-to-member constant %qE"
  msgstr ""
  
! #: cp/pt.c:5650
  #, gcc-internal-format
  msgid "  %qE is not equivalent to %qE"
  msgstr ""
  
! #: cp/pt.c:5659
  #, gcc-internal-format
  msgid "  inconsistent parameter pack deduction with %qT and %qT"
  msgstr ""
  
! #: cp/pt.c:5671
  #, gcc-internal-format
  msgid "  deduced conflicting types for parameter %qT (%qT and %qT)"
  msgstr ""
  
! #: cp/pt.c:5675
  #, gcc-internal-format
  msgid "  deduced conflicting values for non-type parameter %qE (%qE and %qE)"
  msgstr ""
  
! #: cp/pt.c:5686
  #, gcc-internal-format
  msgid "  variable-sized array type %qT is not a valid template argument"
  msgstr ""
  
! #: cp/pt.c:5697
  #, gcc-internal-format
  msgid "  member function type %qT is not a valid template argument"
  msgstr ""
  
! #: cp/pt.c:5709
  #, gcc-internal-format, gfc-internal-format
  msgid "  candidate expects at least %d argument, %d provided"
  msgid_plural "  candidate expects at least %d arguments, %d provided"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/pt.c:5740
  #, gcc-internal-format
  msgid "  cannot convert %qE (type %qT) to type %qT"
  msgstr ""
  
! #: cp/pt.c:5753
  #, gcc-internal-format
  msgid "  %qT is an ambiguous base class of %qT"
  msgstr ""
  
! #: cp/pt.c:5757
  #, gcc-internal-format
  msgid "  %qT is not derived from %qT"
  msgstr ""
  
! #: cp/pt.c:5768
  #, gcc-internal-format
  msgid ""
  "  template parameters of a template template argument are inconsistent with "
  "other deduced template arguments"
  msgstr ""
  
! #: cp/pt.c:5778
  #, gcc-internal-format
  msgid "  can't deduce a template for %qT from non-template type %qT"
  msgstr ""
  
! #: cp/pt.c:5788
  #, gcc-internal-format
  msgid "  template argument %qE does not match %qD"
  msgstr ""
  
! #: cp/pt.c:5797
  #, gcc-internal-format
  msgid "  could not resolve address from overloaded function %qE"
  msgstr ""
  
! #: cp/pt.c:5836
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because string literals "
  "can never be used in this context"
  msgstr ""
  
! #: cp/pt.c:5990
  #, gcc-internal-format
  msgid "in template argument for type %qT "
  msgstr ""
  
! #: cp/pt.c:6037
  #, gcc-internal-format
  msgid ""
  "%qD is not a valid template argument because %qD is a variable, not the "
  "address of a variable"
  msgstr ""
  
! #: cp/pt.c:6045
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for %qT because it is not the address "
  "of a variable"
  msgstr ""
  
! #: cp/pt.c:6063
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument of type %qT because %qE is not a "
  "variable"
  msgstr ""
  
! #: cp/pt.c:6070
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument of type %qT because %qD does not have "
  "external linkage"
  msgstr ""
  
! #: cp/pt.c:6078
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument of type %qT because %qD has no linkage"
  msgstr ""
  
! #: cp/pt.c:6108
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because of conflicts in cv-"
  "qualification"
  msgstr ""
  
! #: cp/pt.c:6116
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because it is not an lvalue"
  msgstr ""
  
! #: cp/pt.c:6134
  #, gcc-internal-format
  msgid ""
  "%q#D is not a valid template argument for type %qT because a reference "
  "variable does not have a constant address"
  msgstr ""
  
! #: cp/pt.c:6144
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because it is not an "
  "object with external linkage"
  msgstr ""
  
! #: cp/pt.c:6153
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because object %qD has not "
  "external linkage"
  msgstr ""
  
! #: cp/pt.c:6199
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because it is a pointer"
  msgstr ""
  
! #: cp/pt.c:6201
  #, gcc-internal-format
  msgid "try using %qE instead"
  msgstr ""
  
! #: cp/pt.c:6243 cp/pt.c:6274
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because it is of type %qT"
  msgstr ""
  
! #: cp/pt.c:6249
  #, gcc-internal-format
  msgid "standard conversions are not allowed in this context"
  msgstr ""
  
! #: cp/pt.c:6561
  #, gcc-internal-format
  msgid "ignoring attributes on template argument %qT"
  msgstr ""
  
! #: cp/pt.c:6622
  #, gcc-internal-format
  msgid "injected-class-name %qD used as template template argument"
  msgstr ""
  
! #: cp/pt.c:6651
  #, gcc-internal-format
  msgid "invalid use of destructor %qE as a type"
  msgstr ""
  
! #: cp/pt.c:6656
  #, gcc-internal-format
  msgid "to refer to a type member of a template parameter, use %<typename %E%>"
  msgstr ""
  
! #: cp/pt.c:6672 cp/pt.c:6694 cp/pt.c:6747
  #, gcc-internal-format
  msgid "type/value mismatch at argument %d in template parameter list for %qD"
  msgstr ""
  
! #: cp/pt.c:6677
  #, gcc-internal-format
  msgid "  expected a constant of type %qT, got %qT"
  msgstr ""
  
! #: cp/pt.c:6682
  #, gcc-internal-format
  msgid "  expected a class template, got %qE"
  msgstr ""
  
! #: cp/pt.c:6685
  #, gcc-internal-format
  msgid "  expected a type, got %qE"
  msgstr ""
  
! #: cp/pt.c:6699
  #, gcc-internal-format
  msgid "  expected a type, got %qT"
  msgstr ""
  
! #: cp/pt.c:6702
  #, gcc-internal-format
  msgid "  expected a class template, got %qT"
  msgstr ""
  
! #: cp/pt.c:6751
  #, gcc-internal-format
  msgid "  expected a template of type %qD, got %qT"
  msgstr ""
  
  #. Not sure if this is reachable, but it doesn't hurt
  #. to be robust.
! #: cp/pt.c:6784
  #, gcc-internal-format
  msgid "type mismatch in nontype parameter pack"
  msgstr ""
  
! #: cp/pt.c:6807
  #, gcc-internal-format
  msgid "could not convert template argument %qE to %qT"
  msgstr ""
  
! #: cp/pt.c:6918 cp/pt.c:7215
  #, gcc-internal-format, gfc-internal-format
  msgid "template argument %d is invalid"
  msgstr ""
  
! #: cp/pt.c:6933 cp/pt.c:7064 cp/pt.c:7240
  #, gcc-internal-format, gfc-internal-format
  msgid "wrong number of template arguments (%d, should be %d)"
  msgstr ""
  
! #: cp/pt.c:7060
  #, gcc-internal-format, gfc-internal-format
  msgid "wrong number of template arguments (%d, should be at least %d)"
  msgstr ""
  
! #: cp/pt.c:7068 cp/pt.c:7243
  #, gcc-internal-format
  msgid "provided for %q+D"
  msgstr ""
  
! #: cp/pt.c:7089
  #, gcc-internal-format
  msgid ""
  "pack expansion argument for non-pack parameter %qD of alias template %qD"
  msgstr ""
  
! #: cp/pt.c:7181
  #, gcc-internal-format
  msgid ""
  "so any instantiation with a non-empty parameter pack would be ill-formed"
  msgstr ""
  
! #: cp/pt.c:7499
  #, gcc-internal-format
  msgid "%q#D is not a function template"
  msgstr ""
  
! #: cp/pt.c:7666
  #, gcc-internal-format
  msgid "non-template type %qT used as a template"
  msgstr ""
  
! #: cp/pt.c:7668
  #, gcc-internal-format
  msgid "for template declaration %q+D"
  msgstr ""
  
! #: cp/pt.c:8557
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "template instantiation depth exceeds maximum of %d (use -ftemplate-depth= to "
  "increase the maximum)"
  msgstr ""
  
! #: cp/pt.c:10138
  #, gcc-internal-format
  msgid "mismatched argument pack lengths while expanding %<%T%>"
  msgstr ""
  
! #: cp/pt.c:10142
  #, gcc-internal-format
  msgid "mismatched argument pack lengths while expanding %<%E%>"
  msgstr ""
  
! #: cp/pt.c:10635
  #, gcc-internal-format
  msgid "  when instantiating default argument for call to %D"
  msgstr ""
--- 41349,41730 ----
  #.
  #. A template-parameter may not be given default arguments
  #. by two different declarations in the same scope.
! #: cp/pt.c:5265
  #, gcc-internal-format
  msgid "redefinition of default argument for %q#D"
  msgstr ""
  
! #: cp/pt.c:5267
  #, gcc-internal-format
  msgid "original definition appeared here"
  msgstr ""
  
! #: cp/pt.c:5511 cp/pt.c:5562
  #, gcc-internal-format
  msgid "%qE is not a valid template argument for type %qT"
  msgstr ""
  
! #: cp/pt.c:5514
  #, gcc-internal-format
  msgid "it must be the address of a function with external linkage"
  msgstr ""
  
! #: cp/pt.c:5517
  #, gcc-internal-format
  msgid "it must be the name of a function with external linkage"
  msgstr ""
  
! #: cp/pt.c:5529
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because %qD has no linkage"
  msgstr ""
  
! #: cp/pt.c:5533
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because %qD does not have "
  "external linkage"
  msgstr ""
  
! #: cp/pt.c:5564
  #, gcc-internal-format
  msgid "it must be a pointer-to-member of the form %<&X::Y%>"
  msgstr ""
  
! #: cp/pt.c:5615
  #, gcc-internal-format
  msgid "  couldn't deduce template parameter %qD"
  msgstr ""
  
! #: cp/pt.c:5630
  #, gcc-internal-format
  msgid "  types %qT and %qT have incompatible cv-qualifiers"
  msgstr ""
  
! #: cp/pt.c:5639
  #, gcc-internal-format
  msgid "  mismatched types %qT and %qT"
  msgstr ""
  
! #: cp/pt.c:5648
  #, gcc-internal-format
  msgid "  template parameter %qD is not a parameter pack, but argument %qD is"
  msgstr ""
  
! #: cp/pt.c:5659
  #, gcc-internal-format
  msgid "  template argument %qE does not match pointer-to-member constant %qE"
  msgstr ""
  
! #: cp/pt.c:5669
  #, gcc-internal-format
  msgid "  %qE is not equivalent to %qE"
  msgstr ""
  
! #: cp/pt.c:5678
  #, gcc-internal-format
  msgid "  inconsistent parameter pack deduction with %qT and %qT"
  msgstr ""
  
! #: cp/pt.c:5690
  #, gcc-internal-format
  msgid "  deduced conflicting types for parameter %qT (%qT and %qT)"
  msgstr ""
  
! #: cp/pt.c:5694
  #, gcc-internal-format
  msgid "  deduced conflicting values for non-type parameter %qE (%qE and %qE)"
  msgstr ""
  
! #: cp/pt.c:5705
  #, gcc-internal-format
  msgid "  variable-sized array type %qT is not a valid template argument"
  msgstr ""
  
! #: cp/pt.c:5716
  #, gcc-internal-format
  msgid "  member function type %qT is not a valid template argument"
  msgstr ""
  
! #: cp/pt.c:5728
  #, gcc-internal-format, gfc-internal-format
  msgid "  candidate expects at least %d argument, %d provided"
  msgid_plural "  candidate expects at least %d arguments, %d provided"
  msgstr[0] ""
  msgstr[1] ""
  
! #: cp/pt.c:5759
  #, gcc-internal-format
  msgid "  cannot convert %qE (type %qT) to type %qT"
  msgstr ""
  
! #: cp/pt.c:5772
  #, gcc-internal-format
  msgid "  %qT is an ambiguous base class of %qT"
  msgstr ""
  
! #: cp/pt.c:5776
  #, gcc-internal-format
  msgid "  %qT is not derived from %qT"
  msgstr ""
  
! #: cp/pt.c:5787
  #, gcc-internal-format
  msgid ""
  "  template parameters of a template template argument are inconsistent with "
  "other deduced template arguments"
  msgstr ""
  
! #: cp/pt.c:5797
  #, gcc-internal-format
  msgid "  can't deduce a template for %qT from non-template type %qT"
  msgstr ""
  
! #: cp/pt.c:5807
  #, gcc-internal-format
  msgid "  template argument %qE does not match %qD"
  msgstr ""
  
! #: cp/pt.c:5816
  #, gcc-internal-format
  msgid "  could not resolve address from overloaded function %qE"
  msgstr ""
  
! #: cp/pt.c:5855
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because string literals "
  "can never be used in this context"
  msgstr ""
  
! #: cp/pt.c:6009
  #, gcc-internal-format
  msgid "in template argument for type %qT "
  msgstr ""
  
! #: cp/pt.c:6056
  #, gcc-internal-format
  msgid ""
  "%qD is not a valid template argument because %qD is a variable, not the "
  "address of a variable"
  msgstr ""
  
! #: cp/pt.c:6064
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for %qT because it is not the address "
  "of a variable"
  msgstr ""
  
! #: cp/pt.c:6082
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument of type %qT because %qE is not a "
  "variable"
  msgstr ""
  
! #: cp/pt.c:6089
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument of type %qT because %qD does not have "
  "external linkage"
  msgstr ""
  
! #: cp/pt.c:6097
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument of type %qT because %qD has no linkage"
  msgstr ""
  
! #: cp/pt.c:6127
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because of conflicts in cv-"
  "qualification"
  msgstr ""
  
! #: cp/pt.c:6135
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because it is not an lvalue"
  msgstr ""
  
! #: cp/pt.c:6153
  #, gcc-internal-format
  msgid ""
  "%q#D is not a valid template argument for type %qT because a reference "
  "variable does not have a constant address"
  msgstr ""
  
! #: cp/pt.c:6163
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because it is not an "
  "object with external linkage"
  msgstr ""
  
! #: cp/pt.c:6172
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because object %qD has not "
  "external linkage"
  msgstr ""
  
! #: cp/pt.c:6218
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because it is a pointer"
  msgstr ""
  
! #: cp/pt.c:6220
  #, gcc-internal-format
  msgid "try using %qE instead"
  msgstr ""
  
! #: cp/pt.c:6262 cp/pt.c:6293
  #, gcc-internal-format
  msgid ""
  "%qE is not a valid template argument for type %qT because it is of type %qT"
  msgstr ""
  
! #: cp/pt.c:6268
  #, gcc-internal-format
  msgid "standard conversions are not allowed in this context"
  msgstr ""
  
! #: cp/pt.c:6580
  #, gcc-internal-format
  msgid "ignoring attributes on template argument %qT"
  msgstr ""
  
! #: cp/pt.c:6641
  #, gcc-internal-format
  msgid "injected-class-name %qD used as template template argument"
  msgstr ""
  
! #: cp/pt.c:6670
  #, gcc-internal-format
  msgid "invalid use of destructor %qE as a type"
  msgstr ""
  
! #: cp/pt.c:6675
  #, gcc-internal-format
  msgid "to refer to a type member of a template parameter, use %<typename %E%>"
  msgstr ""
  
! #: cp/pt.c:6691 cp/pt.c:6713 cp/pt.c:6766
  #, gcc-internal-format
  msgid "type/value mismatch at argument %d in template parameter list for %qD"
  msgstr ""
  
! #: cp/pt.c:6696
  #, gcc-internal-format
  msgid "  expected a constant of type %qT, got %qT"
  msgstr ""
  
! #: cp/pt.c:6701
  #, gcc-internal-format
  msgid "  expected a class template, got %qE"
  msgstr ""
  
! #: cp/pt.c:6704
  #, gcc-internal-format
  msgid "  expected a type, got %qE"
  msgstr ""
  
! #: cp/pt.c:6718
  #, gcc-internal-format
  msgid "  expected a type, got %qT"
  msgstr ""
  
! #: cp/pt.c:6721
  #, gcc-internal-format
  msgid "  expected a class template, got %qT"
  msgstr ""
  
! #: cp/pt.c:6770
  #, gcc-internal-format
  msgid "  expected a template of type %qD, got %qT"
  msgstr ""
  
  #. Not sure if this is reachable, but it doesn't hurt
  #. to be robust.
! #: cp/pt.c:6803
  #, gcc-internal-format
  msgid "type mismatch in nontype parameter pack"
  msgstr ""
  
! #: cp/pt.c:6826
  #, gcc-internal-format
  msgid "could not convert template argument %qE to %qT"
  msgstr ""
  
! #: cp/pt.c:6938 cp/pt.c:7235
  #, gcc-internal-format, gfc-internal-format
  msgid "template argument %d is invalid"
  msgstr ""
  
! #: cp/pt.c:6953 cp/pt.c:7084 cp/pt.c:7260
  #, gcc-internal-format, gfc-internal-format
  msgid "wrong number of template arguments (%d, should be %d)"
  msgstr ""
  
! #: cp/pt.c:7080
  #, gcc-internal-format, gfc-internal-format
  msgid "wrong number of template arguments (%d, should be at least %d)"
  msgstr ""
  
! #: cp/pt.c:7088 cp/pt.c:7263
  #, gcc-internal-format
  msgid "provided for %q+D"
  msgstr ""
  
! #: cp/pt.c:7109
  #, gcc-internal-format
  msgid ""
  "pack expansion argument for non-pack parameter %qD of alias template %qD"
  msgstr ""
  
! #: cp/pt.c:7201
  #, gcc-internal-format
  msgid ""
  "so any instantiation with a non-empty parameter pack would be ill-formed"
  msgstr ""
  
! #: cp/pt.c:7519
  #, gcc-internal-format
  msgid "%q#D is not a function template"
  msgstr ""
  
! #: cp/pt.c:7686
  #, gcc-internal-format
  msgid "non-template type %qT used as a template"
  msgstr ""
  
! #: cp/pt.c:7688
  #, gcc-internal-format
  msgid "for template declaration %q+D"
  msgstr ""
  
! #: cp/pt.c:8576
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "template instantiation depth exceeds maximum of %d (use -ftemplate-depth= to "
  "increase the maximum)"
  msgstr ""
  
! #: cp/pt.c:10161
  #, gcc-internal-format
  msgid "mismatched argument pack lengths while expanding %<%T%>"
  msgstr ""
  
! #: cp/pt.c:10165
  #, gcc-internal-format
  msgid "mismatched argument pack lengths while expanding %<%E%>"
  msgstr ""
  
! #: cp/pt.c:10690
  #, gcc-internal-format
  msgid "  when instantiating default argument for call to %D"
  msgstr ""
*************** msgstr ""
*** 41564,41833 ****
  #.
  #. is an attempt to declare a variable with function
  #. type.
! #: cp/pt.c:11467
  #, gcc-internal-format
  msgid "variable %qD has function type"
  msgstr ""
  
! #: cp/pt.c:11627
  #, gcc-internal-format
  msgid "invalid parameter type %qT"
  msgstr ""
  
! #: cp/pt.c:11629
  #, gcc-internal-format
  msgid "in declaration %q+D"
  msgstr ""
  
! #: cp/pt.c:11740
  #, gcc-internal-format
  msgid "function returning an array"
  msgstr ""
  
! #: cp/pt.c:11742
  #, gcc-internal-format
  msgid "function returning a function"
  msgstr ""
  
! #: cp/pt.c:11782
  #, gcc-internal-format
  msgid "creating pointer to member function of non-class type %qT"
  msgstr ""
  
! #: cp/pt.c:12355
  #, gcc-internal-format
  msgid "forming reference to void"
  msgstr ""
  
! #: cp/pt.c:12357
  #, gcc-internal-format
  msgid "forming pointer to reference type %qT"
  msgstr ""
  
! #: cp/pt.c:12359
  #, gcc-internal-format
  msgid "forming reference to reference type %qT"
  msgstr ""
  
! #: cp/pt.c:12372
  #, gcc-internal-format
  msgid "forming pointer to qualified function type %qT"
  msgstr ""
  
! #: cp/pt.c:12375
  #, gcc-internal-format
  msgid "forming reference to qualified function type %qT"
  msgstr ""
  
! #: cp/pt.c:12423
  #, gcc-internal-format
  msgid "creating pointer to member of non-class type %qT"
  msgstr ""
  
! #: cp/pt.c:12429
  #, gcc-internal-format
  msgid "creating pointer to member reference type %qT"
  msgstr ""
  
! #: cp/pt.c:12435
  #, gcc-internal-format
  msgid "creating pointer to member of type void"
  msgstr ""
  
! #: cp/pt.c:12501
  #, gcc-internal-format
  msgid "creating array of %qT"
  msgstr ""
  
! #: cp/pt.c:12532
  #, gcc-internal-format
  msgid "%qT is not a class, struct, or union type"
  msgstr ""
  
! #: cp/pt.c:12569
  #, gcc-internal-format
  msgid "%qT resolves to %qT, which is not an enumeration type"
  msgstr ""
  
! #: cp/pt.c:12577
  #, gcc-internal-format
  msgid "%qT resolves to %qT, which is is not a class type"
  msgstr ""
  
! #: cp/pt.c:12706
  #, gcc-internal-format
  msgid "use of %qs in template"
  msgstr ""
  
! #: cp/pt.c:12848
  #, gcc-internal-format
  msgid "qualifying type %qT does not match destructor name ~%qT"
  msgstr ""
  
! #: cp/pt.c:12863
  #, gcc-internal-format
  msgid ""
  "dependent-name %qE is parsed as a non-type, but instantiation yields a type"
  msgstr ""
  
! #: cp/pt.c:12865
  #, gcc-internal-format
  msgid "say %<typename %E%> if a type is meant"
  msgstr ""
  
! #: cp/pt.c:13069
  #, gcc-internal-format
  msgid "using invalid field %qD"
  msgstr ""
  
! #: cp/pt.c:13510 cp/pt.c:14499
  #, gcc-internal-format
  msgid "invalid use of pack expansion expression"
  msgstr ""
  
! #: cp/pt.c:13514 cp/pt.c:14503
  #, gcc-internal-format
  msgid "use %<...%> to expand argument pack"
  msgstr ""
  
! #: cp/pt.c:15265
  #, gcc-internal-format
  msgid ""
  "%qD was not declared in this scope, and no declarations were found by "
  "argument-dependent lookup at the point of instantiation"
  msgstr ""
  
! #: cp/pt.c:15277
  #, gcc-internal-format
  msgid "declarations in dependent base %qT are not found by unqualified lookup"
  msgstr ""
  
! #: cp/pt.c:15282
  #, gcc-internal-format
  msgid "use %<this->%D%> instead"
  msgstr ""
  
! #: cp/pt.c:15285
  #, gcc-internal-format
  msgid "use %<%T::%D%> instead"
  msgstr ""
  
! #: cp/pt.c:15289
  #, gcc-internal-format
  msgid "%q+D declared here, later in the translation unit"
  msgstr ""
  
! #: cp/pt.c:15560
  #, gcc-internal-format
  msgid "%qT is not a class or namespace"
  msgstr ""
  
! #: cp/pt.c:15563
  #, gcc-internal-format
  msgid "%qD is not a class or namespace"
  msgstr ""
  
! #: cp/pt.c:15917
  #, gcc-internal-format
  msgid "%qT is/uses anonymous type"
  msgstr ""
  
! #: cp/pt.c:15919
  #, gcc-internal-format
  msgid "template argument for %qD uses local type %qT"
  msgstr ""
  
! #: cp/pt.c:15929
  #, gcc-internal-format
  msgid "%qT is a variably modified type"
  msgstr ""
  
! #: cp/pt.c:15944
  #, gcc-internal-format
  msgid "integral expression %qE is not constant"
  msgstr ""
  
! #: cp/pt.c:15962
  #, gcc-internal-format
  msgid "  trying to instantiate %qD"
  msgstr ""
  
! #: cp/pt.c:19573
  #, gcc-internal-format
  msgid "ambiguous template instantiation for %q#T"
  msgstr ""
  
! #: cp/pt.c:19575
  #, gcc-internal-format
  msgid "ambiguous template instantiation for %q#D"
  msgstr ""
  
! #: cp/pt.c:19581
  msgid "%s %#S"
  msgstr ""
  
! #: cp/pt.c:19605 cp/pt.c:19692
  #, gcc-internal-format
  msgid "explicit instantiation of non-template %q#D"
  msgstr ""
  
! #: cp/pt.c:19624
  #, gcc-internal-format
  msgid "%qD is not a static data member of a class template"
  msgstr ""
  
! #: cp/pt.c:19630 cp/pt.c:19687
  #, gcc-internal-format
  msgid "no matching template for %qD found"
  msgstr ""
  
! #: cp/pt.c:19635
  #, gcc-internal-format
  msgid ""
  "type %qT for explicit instantiation %qD does not match declared type %qT"
  msgstr ""
  
! #: cp/pt.c:19643
  #, gcc-internal-format
  msgid "explicit instantiation of %q#D"
  msgstr ""
  
! #: cp/pt.c:19679
  #, gcc-internal-format
  msgid "duplicate explicit instantiation of %q#D"
  msgstr ""
  
! #: cp/pt.c:19702 cp/pt.c:19799
  #, gcc-internal-format
  msgid "ISO C++ 1998 forbids the use of %<extern%> on explicit instantiations"
  msgstr ""
  
! #: cp/pt.c:19707 cp/pt.c:19816
  #, gcc-internal-format
  msgid "storage class %qD applied to template instantiation"
  msgstr ""
  
! #: cp/pt.c:19775
  #, gcc-internal-format
  msgid "explicit instantiation of non-class template %qD"
  msgstr ""
  
! #: cp/pt.c:19777
  #, gcc-internal-format
  msgid "explicit instantiation of non-template type %qT"
  msgstr ""
  
! #: cp/pt.c:19786
  #, gcc-internal-format
  msgid "explicit instantiation of %q#T before definition of template"
  msgstr ""
  
! #: cp/pt.c:19804
  #, gcc-internal-format
  msgid "ISO C++ forbids the use of %qE on explicit instantiations"
  msgstr ""
  
! #: cp/pt.c:19850
  #, gcc-internal-format
  msgid "duplicate explicit instantiation of %q#T"
  msgstr ""
--- 41742,42011 ----
  #.
  #. is an attempt to declare a variable with function
  #. type.
! #: cp/pt.c:11522
  #, gcc-internal-format
  msgid "variable %qD has function type"
  msgstr ""
  
! #: cp/pt.c:11688
  #, gcc-internal-format
  msgid "invalid parameter type %qT"
  msgstr ""
  
! #: cp/pt.c:11690
  #, gcc-internal-format
  msgid "in declaration %q+D"
  msgstr ""
  
! #: cp/pt.c:11801
  #, gcc-internal-format
  msgid "function returning an array"
  msgstr ""
  
! #: cp/pt.c:11803
  #, gcc-internal-format
  msgid "function returning a function"
  msgstr ""
  
! #: cp/pt.c:11843
  #, gcc-internal-format
  msgid "creating pointer to member function of non-class type %qT"
  msgstr ""
  
! #: cp/pt.c:12416
  #, gcc-internal-format
  msgid "forming reference to void"
  msgstr ""
  
! #: cp/pt.c:12418
  #, gcc-internal-format
  msgid "forming pointer to reference type %qT"
  msgstr ""
  
! #: cp/pt.c:12420
  #, gcc-internal-format
  msgid "forming reference to reference type %qT"
  msgstr ""
  
! #: cp/pt.c:12433
  #, gcc-internal-format
  msgid "forming pointer to qualified function type %qT"
  msgstr ""
  
! #: cp/pt.c:12436
  #, gcc-internal-format
  msgid "forming reference to qualified function type %qT"
  msgstr ""
  
! #: cp/pt.c:12484
  #, gcc-internal-format
  msgid "creating pointer to member of non-class type %qT"
  msgstr ""
  
! #: cp/pt.c:12490
  #, gcc-internal-format
  msgid "creating pointer to member reference type %qT"
  msgstr ""
  
! #: cp/pt.c:12496
  #, gcc-internal-format
  msgid "creating pointer to member of type void"
  msgstr ""
  
! #: cp/pt.c:12562
  #, gcc-internal-format
  msgid "creating array of %qT"
  msgstr ""
  
! #: cp/pt.c:12593
  #, gcc-internal-format
  msgid "%qT is not a class, struct, or union type"
  msgstr ""
  
! #: cp/pt.c:12630
  #, gcc-internal-format
  msgid "%qT resolves to %qT, which is not an enumeration type"
  msgstr ""
  
! #: cp/pt.c:12638
  #, gcc-internal-format
  msgid "%qT resolves to %qT, which is is not a class type"
  msgstr ""
  
! #: cp/pt.c:12767
  #, gcc-internal-format
  msgid "use of %qs in template"
  msgstr ""
  
! #: cp/pt.c:12911
  #, gcc-internal-format
  msgid "qualifying type %qT does not match destructor name ~%qT"
  msgstr ""
  
! #: cp/pt.c:12926
  #, gcc-internal-format
  msgid ""
  "dependent-name %qE is parsed as a non-type, but instantiation yields a type"
  msgstr ""
  
! #: cp/pt.c:12928
  #, gcc-internal-format
  msgid "say %<typename %E%> if a type is meant"
  msgstr ""
  
! #: cp/pt.c:13134
  #, gcc-internal-format
  msgid "using invalid field %qD"
  msgstr ""
  
! #: cp/pt.c:13586 cp/pt.c:14575
  #, gcc-internal-format
  msgid "invalid use of pack expansion expression"
  msgstr ""
  
! #: cp/pt.c:13590 cp/pt.c:14579
  #, gcc-internal-format
  msgid "use %<...%> to expand argument pack"
  msgstr ""
  
! #: cp/pt.c:15355
  #, gcc-internal-format
  msgid ""
  "%qD was not declared in this scope, and no declarations were found by "
  "argument-dependent lookup at the point of instantiation"
  msgstr ""
  
! #: cp/pt.c:15367
  #, gcc-internal-format
  msgid "declarations in dependent base %qT are not found by unqualified lookup"
  msgstr ""
  
! #: cp/pt.c:15372
  #, gcc-internal-format
  msgid "use %<this->%D%> instead"
  msgstr ""
  
! #: cp/pt.c:15375
  #, gcc-internal-format
  msgid "use %<%T::%D%> instead"
  msgstr ""
  
! #: cp/pt.c:15379
  #, gcc-internal-format
  msgid "%q+D declared here, later in the translation unit"
  msgstr ""
  
! #: cp/pt.c:15652
  #, gcc-internal-format
  msgid "%qT is not a class or namespace"
  msgstr ""
  
! #: cp/pt.c:15655
  #, gcc-internal-format
  msgid "%qD is not a class or namespace"
  msgstr ""
  
! #: cp/pt.c:16012
  #, gcc-internal-format
  msgid "%qT is/uses anonymous type"
  msgstr ""
  
! #: cp/pt.c:16014
  #, gcc-internal-format
  msgid "template argument for %qD uses local type %qT"
  msgstr ""
  
! #: cp/pt.c:16024
  #, gcc-internal-format
  msgid "%qT is a variably modified type"
  msgstr ""
  
! #: cp/pt.c:16039
  #, gcc-internal-format
  msgid "integral expression %qE is not constant"
  msgstr ""
  
! #: cp/pt.c:16057
  #, gcc-internal-format
  msgid "  trying to instantiate %qD"
  msgstr ""
  
! #: cp/pt.c:19702
  #, gcc-internal-format
  msgid "ambiguous template instantiation for %q#T"
  msgstr ""
  
! #: cp/pt.c:19704
  #, gcc-internal-format
  msgid "ambiguous template instantiation for %q#D"
  msgstr ""
  
! #: cp/pt.c:19710
  msgid "%s %#S"
  msgstr ""
  
! #: cp/pt.c:19734 cp/pt.c:19821
  #, gcc-internal-format
  msgid "explicit instantiation of non-template %q#D"
  msgstr ""
  
! #: cp/pt.c:19753
  #, gcc-internal-format
  msgid "%qD is not a static data member of a class template"
  msgstr ""
  
! #: cp/pt.c:19759 cp/pt.c:19816
  #, gcc-internal-format
  msgid "no matching template for %qD found"
  msgstr ""
  
! #: cp/pt.c:19764
  #, gcc-internal-format
  msgid ""
  "type %qT for explicit instantiation %qD does not match declared type %qT"
  msgstr ""
  
! #: cp/pt.c:19772
  #, gcc-internal-format
  msgid "explicit instantiation of %q#D"
  msgstr ""
  
! #: cp/pt.c:19808
  #, gcc-internal-format
  msgid "duplicate explicit instantiation of %q#D"
  msgstr ""
  
! #: cp/pt.c:19831 cp/pt.c:19928
  #, gcc-internal-format
  msgid "ISO C++ 1998 forbids the use of %<extern%> on explicit instantiations"
  msgstr ""
  
! #: cp/pt.c:19836 cp/pt.c:19945
  #, gcc-internal-format
  msgid "storage class %qD applied to template instantiation"
  msgstr ""
  
! #: cp/pt.c:19904
  #, gcc-internal-format
  msgid "explicit instantiation of non-class template %qD"
  msgstr ""
  
! #: cp/pt.c:19906
  #, gcc-internal-format
  msgid "explicit instantiation of non-template type %qT"
  msgstr ""
  
! #: cp/pt.c:19915
  #, gcc-internal-format
  msgid "explicit instantiation of %q#T before definition of template"
  msgstr ""
  
! #: cp/pt.c:19933
  #, gcc-internal-format
  msgid "ISO C++ forbids the use of %qE on explicit instantiations"
  msgstr ""
  
! #: cp/pt.c:19979
  #, gcc-internal-format
  msgid "duplicate explicit instantiation of %q#T"
  msgstr ""
*************** msgstr ""
*** 41839,41850 ****
  #. member function or static data member of a class template
  #. shall be present in every translation unit in which it is
  #. explicitly instantiated.
! #: cp/pt.c:20385
  #, gcc-internal-format
  msgid "explicit instantiation of %qD but no definition available"
  msgstr ""
  
! #: cp/pt.c:20611
  #, gcc-internal-format
  msgid ""
  "template instantiation depth exceeds maximum of %d instantiating %q+D, "
--- 42017,42028 ----
  #. member function or static data member of a class template
  #. shall be present in every translation unit in which it is
  #. explicitly instantiated.
! #: cp/pt.c:20517
  #, gcc-internal-format
  msgid "explicit instantiation of %qD but no definition available"
  msgstr ""
  
! #: cp/pt.c:20743
  #, gcc-internal-format
  msgid ""
  "template instantiation depth exceeds maximum of %d instantiating %q+D, "
*************** msgid ""
*** 41852,41907 ****
  "the maximum)"
  msgstr ""
  
! #: cp/pt.c:20947
  #, gcc-internal-format
  msgid "invalid template non-type parameter"
  msgstr ""
  
! #: cp/pt.c:20949
  #, gcc-internal-format
  msgid "%q#T is not a valid type for a template non-type parameter"
  msgstr ""
  
! #: cp/pt.c:22238
  #, gcc-internal-format
  msgid ""
  "deducing from brace-enclosed initializer list requires #include "
  "<initializer_list>"
  msgstr ""
  
! #: cp/pt.c:22289
  #, gcc-internal-format
  msgid "direct-list-initialization of %<auto%> requires exactly one element"
  msgstr ""
  
! #: cp/pt.c:22292
  #, gcc-internal-format
  msgid ""
  "for deduction to %<std::initializer_list%>, use copy-list-initialization (i."
  "e. add %<=%> before the %<{%>)"
  msgstr ""
  
! #: cp/pt.c:22309
  #, gcc-internal-format
  msgid "%qT as type rather than plain %<decltype(auto)%>"
  msgstr ""
  
! #: cp/pt.c:22336
  #, gcc-internal-format
  msgid "unable to deduce lambda return type from %qE"
  msgstr ""
  
! #: cp/pt.c:22338
  #, gcc-internal-format
  msgid "unable to deduce %qT from %qE"
  msgstr ""
  
! #: cp/pt.c:22353
  #, gcc-internal-format
  msgid "inconsistent types %qT and %qT deduced for lambda return type"
  msgstr ""
  
! #: cp/pt.c:22357
  #, gcc-internal-format
  msgid "inconsistent deduction for %qT: %qT and then %qT"
  msgstr ""
--- 42030,42085 ----
  "the maximum)"
  msgstr ""
  
! #: cp/pt.c:21079
  #, gcc-internal-format
  msgid "invalid template non-type parameter"
  msgstr ""
  
! #: cp/pt.c:21081
  #, gcc-internal-format
  msgid "%q#T is not a valid type for a template non-type parameter"
  msgstr ""
  
! #: cp/pt.c:22370
  #, gcc-internal-format
  msgid ""
  "deducing from brace-enclosed initializer list requires #include "
  "<initializer_list>"
  msgstr ""
  
! #: cp/pt.c:22421
  #, gcc-internal-format
  msgid "direct-list-initialization of %<auto%> requires exactly one element"
  msgstr ""
  
! #: cp/pt.c:22424
  #, gcc-internal-format
  msgid ""
  "for deduction to %<std::initializer_list%>, use copy-list-initialization (i."
  "e. add %<=%> before the %<{%>)"
  msgstr ""
  
! #: cp/pt.c:22441
  #, gcc-internal-format
  msgid "%qT as type rather than plain %<decltype(auto)%>"
  msgstr ""
  
! #: cp/pt.c:22468
  #, gcc-internal-format
  msgid "unable to deduce lambda return type from %qE"
  msgstr ""
  
! #: cp/pt.c:22470
  #, gcc-internal-format
  msgid "unable to deduce %qT from %qE"
  msgstr ""
  
! #: cp/pt.c:22485
  #, gcc-internal-format
  msgid "inconsistent types %qT and %qT deduced for lambda return type"
  msgstr ""
  
! #: cp/pt.c:22489
  #, gcc-internal-format
  msgid "inconsistent deduction for %qT: %qT and then %qT"
  msgstr ""
*************** msgstr ""
*** 41953,41959 ****
  msgid "%<dynamic_cast%> not permitted with -fno-rtti"
  msgstr ""
  
! #: cp/rtti.c:781
  #, gcc-internal-format
  msgid "cannot dynamic_cast %qE (of type %q#T) to type %q#T (%s)"
  msgstr ""
--- 42131,42137 ----
  msgid "%<dynamic_cast%> not permitted with -fno-rtti"
  msgstr ""
  
! #: cp/rtti.c:783
  #, gcc-internal-format
  msgid "cannot dynamic_cast %qE (of type %q#T) to type %q#T (%s)"
  msgstr ""
*************** msgstr ""
*** 42095,42101 ****
  msgid "invalid qualifying scope in pseudo-destructor name"
  msgstr ""
  
! #: cp/semantics.c:2533 cp/typeck.c:2510
  #, gcc-internal-format
  msgid "qualified type %qT does not match destructor name ~%qT"
  msgstr ""
--- 42273,42279 ----
  msgid "invalid qualifying scope in pseudo-destructor name"
  msgstr ""
  
! #: cp/semantics.c:2533 cp/typeck.c:2511
  #, gcc-internal-format
  msgid "qualified type %qT does not match destructor name ~%qT"
  msgstr ""
*************** msgstr ""
*** 42141,42535 ****
  msgid "invalid base-class specification"
  msgstr ""
  
! #: cp/semantics.c:3178
  #, gcc-internal-format
  msgid "cannot capture member %qD of anonymous union"
  msgstr ""
  
! #: cp/semantics.c:3191 cp/semantics.c:7740
  #, gcc-internal-format
  msgid "%qD is not captured"
  msgstr ""
  
! #: cp/semantics.c:3196
  #, gcc-internal-format
  msgid "the lambda has no capture-default"
  msgstr ""
  
! #: cp/semantics.c:3198
  #, gcc-internal-format
  msgid ""
  "lambda in local class %q+T cannot capture variables from the enclosing "
  "context"
  msgstr ""
  
! #: cp/semantics.c:3209
  #, gcc-internal-format
  msgid "use of local variable with automatic storage from containing function"
  msgstr ""
  
! #: cp/semantics.c:3210
  #, gcc-internal-format
  msgid "use of parameter from containing function"
  msgstr ""
  
! #: cp/semantics.c:3372
  #, gcc-internal-format
  msgid ""
  "template parameter %qD of type %qT is not allowed in an integral constant "
  "expression because it is not of integral or enumeration type"
  msgstr ""
  
! #: cp/semantics.c:3523
  #, gcc-internal-format
  msgid "use of namespace %qD as expression"
  msgstr ""
  
! #: cp/semantics.c:3528
  #, gcc-internal-format
  msgid "use of class template %qT as expression"
  msgstr ""
  
  #. Ambiguous reference to base members.
! #: cp/semantics.c:3534
  #, gcc-internal-format
  msgid "request for member %qD is ambiguous in multiple inheritance lattice"
  msgstr ""
  
! #: cp/semantics.c:3560
  #, gcc-internal-format
  msgid "%qD cannot appear in a constant-expression"
  msgstr ""
  
! #: cp/semantics.c:3689
  #, gcc-internal-format
  msgid "type of %qE is unknown"
  msgstr ""
  
! #: cp/semantics.c:3717
  #, gcc-internal-format
  msgid "%qT is not an enumeration type"
  msgstr ""
  
  #. Parameter packs can only be used in templates
! #: cp/semantics.c:3866
  #, gcc-internal-format
  msgid "Parameter pack __bases only valid in template declaration"
  msgstr ""
  
! #: cp/semantics.c:3895
  #, gcc-internal-format
  msgid "cannot apply %<offsetof%> to destructor %<~%T%>"
  msgstr ""
  
! #: cp/semantics.c:3904
  #, gcc-internal-format
  msgid ""
  "second operand of %<offsetof%> is neither a single identifier nor a sequence "
  "of member accesses and array references"
  msgstr ""
  
! #: cp/semantics.c:3912
  #, gcc-internal-format
  msgid "cannot apply %<offsetof%> to member function %qD"
  msgstr ""
  
! #: cp/semantics.c:3928
  #, gcc-internal-format
  msgid "offsetof within non-standard-layout type %qT is undefined"
  msgstr ""
  
! #: cp/semantics.c:4859
  #, gcc-internal-format
  msgid "user defined reduction lookup is ambiguous"
  msgstr ""
  
! #: cp/semantics.c:5144
  #, gcc-internal-format
  msgid "%qE has invalid type for %<reduction%>"
  msgstr ""
  
! #: cp/semantics.c:5245
  #, gcc-internal-format
  msgid "user defined reduction with constructor initializer for base class %qT"
  msgstr ""
  
! #: cp/semantics.c:5339
  #, gcc-internal-format
  msgid ""
  "linear clause applied to non-integral non-pointer variable with %qT type"
  msgstr ""
  
! #: cp/semantics.c:5355
  #, gcc-internal-format
  msgid "linear step expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5394
  #, gcc-internal-format
  msgid "%qD is not a variable in clause %qs"
  msgstr ""
  
! #: cp/semantics.c:5405 cp/semantics.c:5427 cp/semantics.c:5449
  #, gcc-internal-format
  msgid "%qD appears more than once in data clauses"
  msgstr ""
  
! #: cp/semantics.c:5419
  #, gcc-internal-format
  msgid "%qD is not a variable in clause %<firstprivate%>"
  msgstr ""
  
! #: cp/semantics.c:5441
  #, gcc-internal-format
  msgid "%qD is not a variable in clause %<lastprivate%>"
  msgstr ""
  
! #: cp/semantics.c:5483
  #, gcc-internal-format
  msgid "num_threads expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5506
  #, gcc-internal-format
  msgid "schedule chunk size expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5538
  #, gcc-internal-format
  msgid "%qs length expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5551
  #, gcc-internal-format
  msgid "%qs length expression must be positive constant integer expression"
  msgstr ""
  
! #: cp/semantics.c:5568
  #, gcc-internal-format
  msgid "%<num_teams%> expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5587
  #, gcc-internal-format
  msgid "%<async%> expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5625
  #, gcc-internal-format
  msgid "%<thread_limit%> expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5644
  #, gcc-internal-format
  msgid "%<device%> id must be integral"
  msgstr ""
  
! #: cp/semantics.c:5665
  #, gcc-internal-format
  msgid "%<dist_schedule%> chunk size expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5685
  #, gcc-internal-format
  msgid "%qD is not a variable in %<aligned%> clause"
  msgstr ""
  
! #: cp/semantics.c:5699
  #, gcc-internal-format
  msgid ""
  "%qE in %<aligned%> clause is neither a pointer nor an array nor a reference "
  "to pointer or array"
  msgstr ""
  
! #: cp/semantics.c:5705
  #, gcc-internal-format
  msgid "%qD appears more than once in %<aligned%> clauses"
  msgstr ""
  
! #: cp/semantics.c:5718
  #, gcc-internal-format
  msgid "%<aligned%> clause alignment expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5755
  #, gcc-internal-format
  msgid "%qD is not a variable in %<depend%> clause"
  msgstr ""
  
! #: cp/semantics.c:5996
  #, gcc-internal-format
  msgid "%qE has reference type for %qs"
  msgstr ""
  
! #: cp/semantics.c:6079
  #, gcc-internal-format
  msgid "%<threadprivate%> %qD is not file, namespace or block scope variable"
  msgstr ""
  
! #: cp/semantics.c:6093
  #, gcc-internal-format
  msgid "%<threadprivate%> %qE directive not in %qT definition"
  msgstr ""
  
! #: cp/semantics.c:6295
  #, gcc-internal-format
  msgid "difference between %qE and %qD does not have integer type"
  msgstr ""
  
! #: cp/semantics.c:6619
  #, gcc-internal-format
  msgid "%<#pragma omp simd%> used with class iteration variable %qE"
  msgstr ""
  
! #: cp/semantics.c:6894 cp/semantics.c:6904
  #, gcc-internal-format
  msgid "%<#pragma omp atomic update%> uses two different expressions for memory"
  msgstr ""
  
  #. Report the error.
! #: cp/semantics.c:7193
  #, gcc-internal-format, gfc-internal-format
  msgid "static assertion failed: %s"
  msgstr ""
  
! #: cp/semantics.c:7196
  #, gcc-internal-format
  msgid "non-constant condition for static assertion"
  msgstr ""
  
! #: cp/semantics.c:7226
  #, gcc-internal-format
  msgid "argument to decltype must be an expression"
  msgstr ""
  
! #: cp/semantics.c:7254
  #, gcc-internal-format
  msgid "decltype cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/tree.c:1144
  #, gcc-internal-format
  msgid "%qV qualifiers cannot be applied to %qT"
  msgstr ""
  
! #: cp/tree.c:1518
  #, gcc-internal-format
  msgid "lambda-expression in a constant expression"
  msgstr ""
  
! #: cp/tree.c:3375
  #, gcc-internal-format
  msgid "%qE attribute can only be applied to Java class definitions"
  msgstr ""
  
! #: cp/tree.c:3404
  #, gcc-internal-format
  msgid "%qE attribute can only be applied to class definitions"
  msgstr ""
  
! #: cp/tree.c:3410
  #, gcc-internal-format
  msgid "%qE is obsolete; g++ vtables are now COM-compatible by default"
  msgstr ""
  
! #: cp/tree.c:3435
  #, gcc-internal-format
  msgid "requested init_priority is not an integer constant"
  msgstr ""
  
! #: cp/tree.c:3456
  #, gcc-internal-format
  msgid ""
  "can only use %qE attribute on file-scope definitions of objects of class type"
  msgstr ""
  
! #: cp/tree.c:3464
  #, gcc-internal-format
  msgid "requested init_priority is out of range"
  msgstr ""
  
! #: cp/tree.c:3474
  #, gcc-internal-format
  msgid "requested init_priority is reserved for internal use"
  msgstr ""
  
! #: cp/tree.c:3485
  #, gcc-internal-format
  msgid "%qE attribute is not supported on this platform"
  msgstr ""
  
! #: cp/tree.c:3512
  #, gcc-internal-format
  msgid "redeclaration of %qD adds abi tag %E"
  msgstr ""
  
! #: cp/tree.c:3518
  #, gcc-internal-format
  msgid "previous declaration here"
  msgstr ""
  
! #: cp/tree.c:3532
  #, gcc-internal-format
  msgid "the %qE attribute requires arguments"
  msgstr ""
  
! #: cp/tree.c:3543
  #, gcc-internal-format
  msgid "arguments to the %qE attribute must be narrow string literals"
  msgstr ""
  
! #: cp/tree.c:3556 cp/tree.c:3569
  #, gcc-internal-format
  msgid "arguments to the %qE attribute must contain valid identifiers"
  msgstr ""
  
! #: cp/tree.c:3558
  #, gcc-internal-format
  msgid "%<%c%> is not a valid first character for an identifier"
  msgstr ""
  
! #: cp/tree.c:3571
  #, gcc-internal-format
  msgid "%<%c%> is not a valid character in an identifier"
  msgstr ""
  
! #: cp/tree.c:3595
  #, gcc-internal-format
  msgid "%qE attribute applied to non-class, non-enum type %qT"
  msgstr ""
  
! #: cp/tree.c:3601
  #, gcc-internal-format
  msgid "%qE attribute applied to %qT after its definition"
  msgstr ""
  
! #: cp/tree.c:3607
  #, gcc-internal-format
  msgid "ignoring %qE attribute applied to template instantiation %qT"
  msgstr ""
  
! #: cp/tree.c:3613
  #, gcc-internal-format
  msgid "ignoring %qE attribute applied to template specialization %qT"
  msgstr ""
  
! #: cp/tree.c:3636
  #, gcc-internal-format
  msgid "%qE attribute applied to non-function, non-variable %qD"
  msgstr ""
  
! #: cp/tree.c:3642
  #, gcc-internal-format
  msgid "%qE attribute applied to extern \"C\" declaration %qD"
  msgstr ""
  
! #: cp/tree.c:4342
  #, gcc-internal-format
  msgid "zero as null pointer constant"
  msgstr ""
  
! #: cp/tree.c:4355
  #, gcc-internal-format, gfc-internal-format
  msgid "lang_* check: failed in %s, at %s:%d"
  msgstr ""
--- 42319,42713 ----
  msgid "invalid base-class specification"
  msgstr ""
  
! #: cp/semantics.c:3179
  #, gcc-internal-format
  msgid "cannot capture member %qD of anonymous union"
  msgstr ""
  
! #: cp/semantics.c:3192 cp/semantics.c:7747
  #, gcc-internal-format
  msgid "%qD is not captured"
  msgstr ""
  
! #: cp/semantics.c:3197
  #, gcc-internal-format
  msgid "the lambda has no capture-default"
  msgstr ""
  
! #: cp/semantics.c:3199
  #, gcc-internal-format
  msgid ""
  "lambda in local class %q+T cannot capture variables from the enclosing "
  "context"
  msgstr ""
  
! #: cp/semantics.c:3210
  #, gcc-internal-format
  msgid "use of local variable with automatic storage from containing function"
  msgstr ""
  
! #: cp/semantics.c:3211
  #, gcc-internal-format
  msgid "use of parameter from containing function"
  msgstr ""
  
! #: cp/semantics.c:3373
  #, gcc-internal-format
  msgid ""
  "template parameter %qD of type %qT is not allowed in an integral constant "
  "expression because it is not of integral or enumeration type"
  msgstr ""
  
! #: cp/semantics.c:3524
  #, gcc-internal-format
  msgid "use of namespace %qD as expression"
  msgstr ""
  
! #: cp/semantics.c:3529
  #, gcc-internal-format
  msgid "use of class template %qT as expression"
  msgstr ""
  
  #. Ambiguous reference to base members.
! #: cp/semantics.c:3535
  #, gcc-internal-format
  msgid "request for member %qD is ambiguous in multiple inheritance lattice"
  msgstr ""
  
! #: cp/semantics.c:3561
  #, gcc-internal-format
  msgid "%qD cannot appear in a constant-expression"
  msgstr ""
  
! #: cp/semantics.c:3691
  #, gcc-internal-format
  msgid "type of %qE is unknown"
  msgstr ""
  
! #: cp/semantics.c:3719
  #, gcc-internal-format
  msgid "%qT is not an enumeration type"
  msgstr ""
  
  #. Parameter packs can only be used in templates
! #: cp/semantics.c:3868
  #, gcc-internal-format
  msgid "Parameter pack __bases only valid in template declaration"
  msgstr ""
  
! #: cp/semantics.c:3897
  #, gcc-internal-format
  msgid "cannot apply %<offsetof%> to destructor %<~%T%>"
  msgstr ""
  
! #: cp/semantics.c:3906
  #, gcc-internal-format
  msgid ""
  "second operand of %<offsetof%> is neither a single identifier nor a sequence "
  "of member accesses and array references"
  msgstr ""
  
! #: cp/semantics.c:3914
  #, gcc-internal-format
  msgid "cannot apply %<offsetof%> to member function %qD"
  msgstr ""
  
! #: cp/semantics.c:3930
  #, gcc-internal-format
  msgid "offsetof within non-standard-layout type %qT is undefined"
  msgstr ""
  
! #: cp/semantics.c:4860
  #, gcc-internal-format
  msgid "user defined reduction lookup is ambiguous"
  msgstr ""
  
! #: cp/semantics.c:5145
  #, gcc-internal-format
  msgid "%qE has invalid type for %<reduction%>"
  msgstr ""
  
! #: cp/semantics.c:5246
  #, gcc-internal-format
  msgid "user defined reduction with constructor initializer for base class %qT"
  msgstr ""
  
! #: cp/semantics.c:5341
  #, gcc-internal-format
  msgid ""
  "linear clause applied to non-integral non-pointer variable with %qT type"
  msgstr ""
  
! #: cp/semantics.c:5357
  #, gcc-internal-format
  msgid "linear step expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5398
  #, gcc-internal-format
  msgid "%qD is not a variable in clause %qs"
  msgstr ""
  
! #: cp/semantics.c:5409 cp/semantics.c:5431 cp/semantics.c:5453
  #, gcc-internal-format
  msgid "%qD appears more than once in data clauses"
  msgstr ""
  
! #: cp/semantics.c:5423
  #, gcc-internal-format
  msgid "%qD is not a variable in clause %<firstprivate%>"
  msgstr ""
  
! #: cp/semantics.c:5445
  #, gcc-internal-format
  msgid "%qD is not a variable in clause %<lastprivate%>"
  msgstr ""
  
! #: cp/semantics.c:5487
  #, gcc-internal-format
  msgid "num_threads expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5510
  #, gcc-internal-format
  msgid "schedule chunk size expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5542
  #, gcc-internal-format
  msgid "%qs length expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5555
  #, gcc-internal-format
  msgid "%qs length expression must be positive constant integer expression"
  msgstr ""
  
! #: cp/semantics.c:5572
  #, gcc-internal-format
  msgid "%<num_teams%> expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5591
  #, gcc-internal-format
  msgid "%<async%> expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5629
  #, gcc-internal-format
  msgid "%<thread_limit%> expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5648
  #, gcc-internal-format
  msgid "%<device%> id must be integral"
  msgstr ""
  
! #: cp/semantics.c:5669
  #, gcc-internal-format
  msgid "%<dist_schedule%> chunk size expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5689
  #, gcc-internal-format
  msgid "%qD is not a variable in %<aligned%> clause"
  msgstr ""
  
! #: cp/semantics.c:5703
  #, gcc-internal-format
  msgid ""
  "%qE in %<aligned%> clause is neither a pointer nor an array nor a reference "
  "to pointer or array"
  msgstr ""
  
! #: cp/semantics.c:5709
  #, gcc-internal-format
  msgid "%qD appears more than once in %<aligned%> clauses"
  msgstr ""
  
! #: cp/semantics.c:5722
  #, gcc-internal-format
  msgid "%<aligned%> clause alignment expression must be integral"
  msgstr ""
  
! #: cp/semantics.c:5759
  #, gcc-internal-format
  msgid "%qD is not a variable in %<depend%> clause"
  msgstr ""
  
! #: cp/semantics.c:6000
  #, gcc-internal-format
  msgid "%qE has reference type for %qs"
  msgstr ""
  
! #: cp/semantics.c:6083
  #, gcc-internal-format
  msgid "%<threadprivate%> %qD is not file, namespace or block scope variable"
  msgstr ""
  
! #: cp/semantics.c:6097
  #, gcc-internal-format
  msgid "%<threadprivate%> %qE directive not in %qT definition"
  msgstr ""
  
! #: cp/semantics.c:6299
  #, gcc-internal-format
  msgid "difference between %qE and %qD does not have integer type"
  msgstr ""
  
! #: cp/semantics.c:6624
  #, gcc-internal-format
  msgid "%<#pragma omp simd%> used with class iteration variable %qE"
  msgstr ""
  
! #: cp/semantics.c:6899 cp/semantics.c:6909
  #, gcc-internal-format
  msgid "%<#pragma omp atomic update%> uses two different expressions for memory"
  msgstr ""
  
  #. Report the error.
! #: cp/semantics.c:7198
  #, gcc-internal-format, gfc-internal-format
  msgid "static assertion failed: %s"
  msgstr ""
  
! #: cp/semantics.c:7201
  #, gcc-internal-format
  msgid "non-constant condition for static assertion"
  msgstr ""
  
! #: cp/semantics.c:7231
  #, gcc-internal-format
  msgid "argument to decltype must be an expression"
  msgstr ""
  
! #: cp/semantics.c:7259
  #, gcc-internal-format
  msgid "decltype cannot resolve address of overloaded function"
  msgstr ""
  
! #: cp/tree.c:1145
  #, gcc-internal-format
  msgid "%qV qualifiers cannot be applied to %qT"
  msgstr ""
  
! #: cp/tree.c:1533
  #, gcc-internal-format
  msgid "lambda-expression in a constant expression"
  msgstr ""
  
! #: cp/tree.c:3390
  #, gcc-internal-format
  msgid "%qE attribute can only be applied to Java class definitions"
  msgstr ""
  
! #: cp/tree.c:3419
  #, gcc-internal-format
  msgid "%qE attribute can only be applied to class definitions"
  msgstr ""
  
! #: cp/tree.c:3425
  #, gcc-internal-format
  msgid "%qE is obsolete; g++ vtables are now COM-compatible by default"
  msgstr ""
  
! #: cp/tree.c:3450
  #, gcc-internal-format
  msgid "requested init_priority is not an integer constant"
  msgstr ""
  
! #: cp/tree.c:3471
  #, gcc-internal-format
  msgid ""
  "can only use %qE attribute on file-scope definitions of objects of class type"
  msgstr ""
  
! #: cp/tree.c:3479
  #, gcc-internal-format
  msgid "requested init_priority is out of range"
  msgstr ""
  
! #: cp/tree.c:3489
  #, gcc-internal-format
  msgid "requested init_priority is reserved for internal use"
  msgstr ""
  
! #: cp/tree.c:3500
  #, gcc-internal-format
  msgid "%qE attribute is not supported on this platform"
  msgstr ""
  
! #: cp/tree.c:3527
  #, gcc-internal-format
  msgid "redeclaration of %qD adds abi tag %E"
  msgstr ""
  
! #: cp/tree.c:3533
  #, gcc-internal-format
  msgid "previous declaration here"
  msgstr ""
  
! #: cp/tree.c:3547
  #, gcc-internal-format
  msgid "the %qE attribute requires arguments"
  msgstr ""
  
! #: cp/tree.c:3558
  #, gcc-internal-format
  msgid "arguments to the %qE attribute must be narrow string literals"
  msgstr ""
  
! #: cp/tree.c:3571 cp/tree.c:3584
  #, gcc-internal-format
  msgid "arguments to the %qE attribute must contain valid identifiers"
  msgstr ""
  
! #: cp/tree.c:3573
  #, gcc-internal-format
  msgid "%<%c%> is not a valid first character for an identifier"
  msgstr ""
  
! #: cp/tree.c:3586
  #, gcc-internal-format
  msgid "%<%c%> is not a valid character in an identifier"
  msgstr ""
  
! #: cp/tree.c:3610
  #, gcc-internal-format
  msgid "%qE attribute applied to non-class, non-enum type %qT"
  msgstr ""
  
! #: cp/tree.c:3616
  #, gcc-internal-format
  msgid "%qE attribute applied to %qT after its definition"
  msgstr ""
  
! #: cp/tree.c:3623
  #, gcc-internal-format
  msgid "ignoring %qE attribute applied to template instantiation %qT"
  msgstr ""
  
! #: cp/tree.c:3630
  #, gcc-internal-format
  msgid "ignoring %qE attribute applied to template specialization %qT"
  msgstr ""
  
! #: cp/tree.c:3653
  #, gcc-internal-format
  msgid "%qE attribute applied to non-function, non-variable %qD"
  msgstr ""
  
! #: cp/tree.c:3659
  #, gcc-internal-format
  msgid "%qE attribute applied to extern \"C\" declaration %qD"
  msgstr ""
  
! #: cp/tree.c:4359
  #, gcc-internal-format
  msgid "zero as null pointer constant"
  msgstr ""
  
! #: cp/tree.c:4372
  #, gcc-internal-format, gfc-internal-format
  msgid "lang_* check: failed in %s, at %s:%d"
  msgstr ""
*************** msgstr ""
*** 42647,42964 ****
  msgid "deprecated conversion from string constant to %qT"
  msgstr ""
  
! #: cp/typeck.c:2285 cp/typeck.c:2678
  #, gcc-internal-format
  msgid ""
  "request for member %qD in %qE, which is of pointer type %qT (maybe you meant "
  "to use %<->%> ?)"
  msgstr ""
  
! #: cp/typeck.c:2289 cp/typeck.c:2682
  #, gcc-internal-format
  msgid "request for member %qD in %qE, which is of non-class type %qT"
  msgstr ""
  
! #: cp/typeck.c:2319
  #, gcc-internal-format
  msgid "invalid use of nonstatic data member %qE"
  msgstr ""
  
! #: cp/typeck.c:2375
  #, gcc-internal-format
  msgid ""
  "invalid access to non-static data member %qD in virtual base of NULL object"
  msgstr ""
  
! #: cp/typeck.c:2525
  #, gcc-internal-format
  msgid "object type %qT does not match destructor name ~%qT"
  msgstr ""
  
! #: cp/typeck.c:2534
  #, gcc-internal-format
  msgid "the type being destroyed is %qT, but the destructor refers to %qT"
  msgstr ""
  
! #: cp/typeck.c:2722 cp/typeck.c:2734
  #, gcc-internal-format
  msgid "%<%D::%D%> is not a member of %qT"
  msgstr ""
  
! #: cp/typeck.c:2763
  #, gcc-internal-format
  msgid "%qT is not a base of %qT"
  msgstr ""
  
! #: cp/typeck.c:2783
  #, gcc-internal-format
  msgid "%q#T has no member named %qE"
  msgstr ""
  
! #: cp/typeck.c:2801
  #, gcc-internal-format
  msgid "%qD is not a member template function"
  msgstr ""
  
! #: cp/typeck.c:2960
  #, gcc-internal-format
  msgid "%qT is not a pointer-to-object type"
  msgstr ""
  
! #: cp/typeck.c:2991
  #, gcc-internal-format
  msgid "invalid use of array indexing on pointer to member"
  msgstr ""
  
! #: cp/typeck.c:2994
  #, gcc-internal-format
  msgid "invalid use of unary %<*%> on pointer to member"
  msgstr ""
  
! #: cp/typeck.c:2997
  #, gcc-internal-format
  msgid "invalid use of implicit conversion on pointer to member"
  msgstr ""
  
! #: cp/typeck.c:3000
  #, gcc-internal-format
  msgid ""
  "left hand operand of %<->*%> must be a pointer to class, but is a pointer to "
  "member of type %qT"
  msgstr ""
  
! #: cp/typeck.c:3036
  #, gcc-internal-format
  msgid "subscript missing in array reference"
  msgstr ""
  
! #: cp/typeck.c:3052
  #, gcc-internal-format
  msgid "rank of the array%'s index is greater than 1"
  msgstr ""
  
! #: cp/typeck.c:3148
  #, gcc-internal-format
  msgid "subscripting array declared %<register%>"
  msgstr ""
  
! #: cp/typeck.c:3187
  #, gcc-internal-format
  msgid "subscripted value is neither array nor pointer"
  msgstr ""
  
! #: cp/typeck.c:3260
  #, gcc-internal-format
  msgid "object missing in use of %qE"
  msgstr ""
  
! #: cp/typeck.c:3479
  #, gcc-internal-format
  msgid "ISO C++ forbids calling %<::main%> from within program"
  msgstr ""
  
! #: cp/typeck.c:3500
  #, gcc-internal-format
  msgid ""
  "must use %<.*%> or %<->*%> to call pointer-to-member function in %<%E "
  "(...)%>, e.g. %<(... ->* %E) (...)%>"
  msgstr ""
  
! #: cp/typeck.c:3517
  #, gcc-internal-format
  msgid "%qE cannot be used as a function"
  msgstr ""
  
! #: cp/typeck.c:3520
  #, gcc-internal-format
  msgid "%qD cannot be used as a function"
  msgstr ""
  
! #: cp/typeck.c:3523
  #, gcc-internal-format
  msgid "expression cannot be used as a function"
  msgstr ""
  
! #: cp/typeck.c:3572
  #, gcc-internal-format
  msgid "too many arguments to constructor %q#D"
  msgstr ""
  
! #: cp/typeck.c:3573
  #, gcc-internal-format
  msgid "too few arguments to constructor %q#D"
  msgstr ""
  
! #: cp/typeck.c:3578
  #, gcc-internal-format
  msgid "too many arguments to member function %q#D"
  msgstr ""
  
! #: cp/typeck.c:3579
  #, gcc-internal-format
  msgid "too few arguments to member function %q#D"
  msgstr ""
  
! #: cp/typeck.c:3585
  #, gcc-internal-format
  msgid "too many arguments to function %q#D"
  msgstr ""
  
! #: cp/typeck.c:3586
  #, gcc-internal-format
  msgid "too few arguments to function %q#D"
  msgstr ""
  
! #: cp/typeck.c:3596
  #, gcc-internal-format
  msgid "too many arguments to method %q#D"
  msgstr ""
  
! #: cp/typeck.c:3597
  #, gcc-internal-format
  msgid "too few arguments to method %q#D"
  msgstr ""
  
! #: cp/typeck.c:3600
  #, gcc-internal-format
  msgid "too many arguments to function"
  msgstr ""
  
! #: cp/typeck.c:3601
  #, gcc-internal-format
  msgid "too few arguments to function"
  msgstr ""
  
! #: cp/typeck.c:3680
  #, gcc-internal-format
  msgid "parameter %P of %qD has incomplete type %qT"
  msgstr ""
  
! #: cp/typeck.c:3683
  #, gcc-internal-format
  msgid "parameter %P has incomplete type %qT"
  msgstr ""
  
! #: cp/typeck.c:3990 cp/typeck.c:4001
  #, gcc-internal-format
  msgid "assuming cast to type %qT from overloaded function"
  msgstr ""
  
! #: cp/typeck.c:4047
  #, gcc-internal-format
  msgid "NULL used in arithmetic"
  msgstr ""
  
! #: cp/typeck.c:4358
  #, gcc-internal-format
  msgid "left rotate count is negative"
  msgstr ""
  
! #: cp/typeck.c:4359
  #, gcc-internal-format
  msgid "right rotate count is negative"
  msgstr ""
  
! #: cp/typeck.c:4365
  #, gcc-internal-format
  msgid "left rotate count >= width of type"
  msgstr ""
  
! #: cp/typeck.c:4366
  #, gcc-internal-format
  msgid "right rotate count >= width of type"
  msgstr ""
  
! #: cp/typeck.c:4387 cp/typeck.c:4642
  #, gcc-internal-format
  msgid "comparison with string literal results in unspecified behaviour"
  msgstr ""
  
! #: cp/typeck.c:4413 cp/typeck.c:4435
  #, gcc-internal-format
  msgid "the address of %qD will never be NULL"
  msgstr ""
  
! #: cp/typeck.c:4450 cp/typeck.c:4458 cp/typeck.c:4720 cp/typeck.c:4728
  #, gcc-internal-format
  msgid "ISO C++ forbids comparison between pointer and integer"
  msgstr ""
  
! #: cp/typeck.c:4657 cp/typeck.c:4669
  #, gcc-internal-format
  msgid "operand types are %qT and %qT"
  msgstr ""
  
! #: cp/typeck.c:4681
  #, gcc-internal-format
  msgid "could not find an integer type of the same size as %qT"
  msgstr ""
  
! #: cp/typeck.c:4745
  #, gcc-internal-format
  msgid "unordered comparison on non-floating point argument"
  msgstr ""
  
! #: cp/typeck.c:4793
  #, gcc-internal-format
  msgid "invalid operands of types %qT and %qT to binary %qO"
  msgstr ""
  
! #: cp/typeck.c:5093
  #, gcc-internal-format
  msgid "ISO C++ forbids using pointer of type %<void *%> in subtraction"
  msgstr ""
  
! #: cp/typeck.c:5101
  #, gcc-internal-format
  msgid "ISO C++ forbids using pointer to a function in subtraction"
  msgstr ""
  
! #: cp/typeck.c:5109
  #, gcc-internal-format
  msgid "ISO C++ forbids using pointer to a method in subtraction"
  msgstr ""
  
! #: cp/typeck.c:5128
  #, gcc-internal-format
  msgid "invalid use of a pointer to an incomplete type in pointer arithmetic"
  msgstr ""
  
! #: cp/typeck.c:5201
  #, gcc-internal-format
  msgid "taking address of constructor %qE"
  msgstr ""
  
! #: cp/typeck.c:5202
  #, gcc-internal-format
  msgid "taking address of destructor %qE"
  msgstr ""
  
! #: cp/typeck.c:5218
  #, gcc-internal-format
  msgid "invalid use of %qE to form a pointer-to-member-function"
  msgstr ""
  
! #: cp/typeck.c:5221
  #, gcc-internal-format
  msgid "  a qualified-id is required"
  msgstr ""
  
! #: cp/typeck.c:5228
  #, gcc-internal-format
  msgid ""
  "parentheses around %qE cannot be used to form a pointer-to-member-function"
  msgstr ""
  
  #. An expression like &memfn.
! #: cp/typeck.c:5380
  #, gcc-internal-format
  msgid ""
  "ISO C++ forbids taking the address of an unqualified or parenthesized non-"
  "static member function to form a pointer to member function.  Say %<&%T::%D%>"
  msgstr ""
  
! #: cp/typeck.c:5385
  #, gcc-internal-format
  msgid ""
  "ISO C++ forbids taking the address of a bound member function to form a "
--- 42825,43142 ----
  msgid "deprecated conversion from string constant to %qT"
  msgstr ""
  
! #: cp/typeck.c:2285 cp/typeck.c:2679
  #, gcc-internal-format
  msgid ""
  "request for member %qD in %qE, which is of pointer type %qT (maybe you meant "
  "to use %<->%> ?)"
  msgstr ""
  
! #: cp/typeck.c:2289 cp/typeck.c:2683
  #, gcc-internal-format
  msgid "request for member %qD in %qE, which is of non-class type %qT"
  msgstr ""
  
! #: cp/typeck.c:2320
  #, gcc-internal-format
  msgid "invalid use of nonstatic data member %qE"
  msgstr ""
  
! #: cp/typeck.c:2376
  #, gcc-internal-format
  msgid ""
  "invalid access to non-static data member %qD in virtual base of NULL object"
  msgstr ""
  
! #: cp/typeck.c:2526
  #, gcc-internal-format
  msgid "object type %qT does not match destructor name ~%qT"
  msgstr ""
  
! #: cp/typeck.c:2535
  #, gcc-internal-format
  msgid "the type being destroyed is %qT, but the destructor refers to %qT"
  msgstr ""
  
! #: cp/typeck.c:2723 cp/typeck.c:2735
  #, gcc-internal-format
  msgid "%<%D::%D%> is not a member of %qT"
  msgstr ""
  
! #: cp/typeck.c:2764
  #, gcc-internal-format
  msgid "%qT is not a base of %qT"
  msgstr ""
  
! #: cp/typeck.c:2784
  #, gcc-internal-format
  msgid "%q#T has no member named %qE"
  msgstr ""
  
! #: cp/typeck.c:2802
  #, gcc-internal-format
  msgid "%qD is not a member template function"
  msgstr ""
  
! #: cp/typeck.c:2961
  #, gcc-internal-format
  msgid "%qT is not a pointer-to-object type"
  msgstr ""
  
! #: cp/typeck.c:2992
  #, gcc-internal-format
  msgid "invalid use of array indexing on pointer to member"
  msgstr ""
  
! #: cp/typeck.c:2995
  #, gcc-internal-format
  msgid "invalid use of unary %<*%> on pointer to member"
  msgstr ""
  
! #: cp/typeck.c:2998
  #, gcc-internal-format
  msgid "invalid use of implicit conversion on pointer to member"
  msgstr ""
  
! #: cp/typeck.c:3001
  #, gcc-internal-format
  msgid ""
  "left hand operand of %<->*%> must be a pointer to class, but is a pointer to "
  "member of type %qT"
  msgstr ""
  
! #: cp/typeck.c:3037
  #, gcc-internal-format
  msgid "subscript missing in array reference"
  msgstr ""
  
! #: cp/typeck.c:3053
  #, gcc-internal-format
  msgid "rank of the array%'s index is greater than 1"
  msgstr ""
  
! #: cp/typeck.c:3149
  #, gcc-internal-format
  msgid "subscripting array declared %<register%>"
  msgstr ""
  
! #: cp/typeck.c:3188
  #, gcc-internal-format
  msgid "subscripted value is neither array nor pointer"
  msgstr ""
  
! #: cp/typeck.c:3261
  #, gcc-internal-format
  msgid "object missing in use of %qE"
  msgstr ""
  
! #: cp/typeck.c:3481
  #, gcc-internal-format
  msgid "ISO C++ forbids calling %<::main%> from within program"
  msgstr ""
  
! #: cp/typeck.c:3502
  #, gcc-internal-format
  msgid ""
  "must use %<.*%> or %<->*%> to call pointer-to-member function in %<%E "
  "(...)%>, e.g. %<(... ->* %E) (...)%>"
  msgstr ""
  
! #: cp/typeck.c:3519
  #, gcc-internal-format
  msgid "%qE cannot be used as a function"
  msgstr ""
  
! #: cp/typeck.c:3522
  #, gcc-internal-format
  msgid "%qD cannot be used as a function"
  msgstr ""
  
! #: cp/typeck.c:3525
  #, gcc-internal-format
  msgid "expression cannot be used as a function"
  msgstr ""
  
! #: cp/typeck.c:3574
  #, gcc-internal-format
  msgid "too many arguments to constructor %q#D"
  msgstr ""
  
! #: cp/typeck.c:3575
  #, gcc-internal-format
  msgid "too few arguments to constructor %q#D"
  msgstr ""
  
! #: cp/typeck.c:3580
  #, gcc-internal-format
  msgid "too many arguments to member function %q#D"
  msgstr ""
  
! #: cp/typeck.c:3581
  #, gcc-internal-format
  msgid "too few arguments to member function %q#D"
  msgstr ""
  
! #: cp/typeck.c:3587
  #, gcc-internal-format
  msgid "too many arguments to function %q#D"
  msgstr ""
  
! #: cp/typeck.c:3588
  #, gcc-internal-format
  msgid "too few arguments to function %q#D"
  msgstr ""
  
! #: cp/typeck.c:3598
  #, gcc-internal-format
  msgid "too many arguments to method %q#D"
  msgstr ""
  
! #: cp/typeck.c:3599
  #, gcc-internal-format
  msgid "too few arguments to method %q#D"
  msgstr ""
  
! #: cp/typeck.c:3602
  #, gcc-internal-format
  msgid "too many arguments to function"
  msgstr ""
  
! #: cp/typeck.c:3603
  #, gcc-internal-format
  msgid "too few arguments to function"
  msgstr ""
  
! #: cp/typeck.c:3682
  #, gcc-internal-format
  msgid "parameter %P of %qD has incomplete type %qT"
  msgstr ""
  
! #: cp/typeck.c:3685
  #, gcc-internal-format
  msgid "parameter %P has incomplete type %qT"
  msgstr ""
  
! #: cp/typeck.c:3992 cp/typeck.c:4003
  #, gcc-internal-format
  msgid "assuming cast to type %qT from overloaded function"
  msgstr ""
  
! #: cp/typeck.c:4049
  #, gcc-internal-format
  msgid "NULL used in arithmetic"
  msgstr ""
  
! #: cp/typeck.c:4360
  #, gcc-internal-format
  msgid "left rotate count is negative"
  msgstr ""
  
! #: cp/typeck.c:4361
  #, gcc-internal-format
  msgid "right rotate count is negative"
  msgstr ""
  
! #: cp/typeck.c:4367
  #, gcc-internal-format
  msgid "left rotate count >= width of type"
  msgstr ""
  
! #: cp/typeck.c:4368
  #, gcc-internal-format
  msgid "right rotate count >= width of type"
  msgstr ""
  
! #: cp/typeck.c:4389 cp/typeck.c:4644
  #, gcc-internal-format
  msgid "comparison with string literal results in unspecified behaviour"
  msgstr ""
  
! #: cp/typeck.c:4415 cp/typeck.c:4437
  #, gcc-internal-format
  msgid "the address of %qD will never be NULL"
  msgstr ""
  
! #: cp/typeck.c:4452 cp/typeck.c:4460 cp/typeck.c:4736 cp/typeck.c:4744
  #, gcc-internal-format
  msgid "ISO C++ forbids comparison between pointer and integer"
  msgstr ""
  
! #: cp/typeck.c:4659 cp/typeck.c:4671
  #, gcc-internal-format
  msgid "operand types are %qT and %qT"
  msgstr ""
  
! #: cp/typeck.c:4697
  #, gcc-internal-format
  msgid "could not find an integer type of the same size as %qT"
  msgstr ""
  
! #: cp/typeck.c:4761
  #, gcc-internal-format
  msgid "unordered comparison on non-floating point argument"
  msgstr ""
  
! #: cp/typeck.c:4809
  #, gcc-internal-format
  msgid "invalid operands of types %qT and %qT to binary %qO"
  msgstr ""
  
! #: cp/typeck.c:5109
  #, gcc-internal-format
  msgid "ISO C++ forbids using pointer of type %<void *%> in subtraction"
  msgstr ""
  
! #: cp/typeck.c:5117
  #, gcc-internal-format
  msgid "ISO C++ forbids using pointer to a function in subtraction"
  msgstr ""
  
! #: cp/typeck.c:5125
  #, gcc-internal-format
  msgid "ISO C++ forbids using pointer to a method in subtraction"
  msgstr ""
  
! #: cp/typeck.c:5144
  #, gcc-internal-format
  msgid "invalid use of a pointer to an incomplete type in pointer arithmetic"
  msgstr ""
  
! #: cp/typeck.c:5217
  #, gcc-internal-format
  msgid "taking address of constructor %qE"
  msgstr ""
  
! #: cp/typeck.c:5218
  #, gcc-internal-format
  msgid "taking address of destructor %qE"
  msgstr ""
  
! #: cp/typeck.c:5234
  #, gcc-internal-format
  msgid "invalid use of %qE to form a pointer-to-member-function"
  msgstr ""
  
! #: cp/typeck.c:5237
  #, gcc-internal-format
  msgid "  a qualified-id is required"
  msgstr ""
  
! #: cp/typeck.c:5244
  #, gcc-internal-format
  msgid ""
  "parentheses around %qE cannot be used to form a pointer-to-member-function"
  msgstr ""
  
  #. An expression like &memfn.
! #: cp/typeck.c:5397
  #, gcc-internal-format
  msgid ""
  "ISO C++ forbids taking the address of an unqualified or parenthesized non-"
  "static member function to form a pointer to member function.  Say %<&%T::%D%>"
  msgstr ""
  
! #: cp/typeck.c:5402
  #, gcc-internal-format
  msgid ""
  "ISO C++ forbids taking the address of a bound member function to form a "
*************** msgid ""
*** 42966,43343 ****
  msgstr ""
  
  #. Make this a permerror because we used to accept it.
! #: cp/typeck.c:5422
  #, gcc-internal-format
  msgid "taking address of temporary"
  msgstr ""
  
! #: cp/typeck.c:5424
  #, gcc-internal-format
  msgid "taking address of xvalue (rvalue reference)"
  msgstr ""
  
! #: cp/typeck.c:5441
  #, gcc-internal-format
  msgid "ISO C++ forbids taking address of function %<::main%>"
  msgstr ""
  
! #: cp/typeck.c:5496
  #, gcc-internal-format
  msgid "ISO C++ forbids taking the address of a cast to a non-lvalue expression"
  msgstr ""
  
! #: cp/typeck.c:5524
  #, gcc-internal-format
  msgid "cannot create pointer to reference member %qD"
  msgstr ""
  
! #: cp/typeck.c:5804
  #, gcc-internal-format
  msgid "ISO C++ forbids incrementing an enum"
  msgstr ""
  
! #: cp/typeck.c:5805
  #, gcc-internal-format
  msgid "ISO C++ forbids decrementing an enum"
  msgstr ""
  
! #: cp/typeck.c:5821
  #, gcc-internal-format
  msgid "cannot increment a pointer to incomplete type %qT"
  msgstr ""
  
! #: cp/typeck.c:5822
  #, gcc-internal-format
  msgid "cannot decrement a pointer to incomplete type %qT"
  msgstr ""
  
! #: cp/typeck.c:5833
  #, gcc-internal-format
  msgid "ISO C++ forbids incrementing a pointer of type %qT"
  msgstr ""
  
! #: cp/typeck.c:5834
  #, gcc-internal-format
  msgid "ISO C++ forbids decrementing a pointer of type %qT"
  msgstr ""
  
! #: cp/typeck.c:5869
  #, gcc-internal-format
  msgid "invalid use of Boolean expression as operand to %<operator--%>"
  msgstr ""
  
! #: cp/typeck.c:6031
  #, gcc-internal-format
  msgid "cannot take the address of %<this%>, which is an rvalue expression"
  msgstr ""
  
! #: cp/typeck.c:6053
  #, gcc-internal-format
  msgid "address of explicit register variable %qD requested"
  msgstr ""
  
! #: cp/typeck.c:6058
  #, gcc-internal-format
  msgid "address requested for %qD, which is declared %<register%>"
  msgstr ""
  
! #: cp/typeck.c:6141
  #, gcc-internal-format
  msgid "list-initializer for non-class type must not be parenthesized"
  msgstr ""
  
! #: cp/typeck.c:6153
  #, gcc-internal-format
  msgid "expression list treated as compound expression in initializer"
  msgstr ""
  
! #: cp/typeck.c:6157
  #, gcc-internal-format
  msgid "expression list treated as compound expression in mem-initializer"
  msgstr ""
  
! #: cp/typeck.c:6161
  #, gcc-internal-format
  msgid "expression list treated as compound expression in functional cast"
  msgstr ""
  
! #: cp/typeck.c:6198
  #, gcc-internal-format, gfc-internal-format
  msgid "%s expression list treated as compound expression"
  msgstr ""
  
! #: cp/typeck.c:6288
  #, gcc-internal-format
  msgid "no context to resolve type of %qE"
  msgstr ""
  
! #: cp/typeck.c:6321
  #, gcc-internal-format
  msgid "cast from type %qT to type %qT casts away qualifiers"
  msgstr ""
  
! #: cp/typeck.c:6327
  #, gcc-internal-format
  msgid "static_cast from type %qT to type %qT casts away qualifiers"
  msgstr ""
  
! #: cp/typeck.c:6333
  #, gcc-internal-format
  msgid "reinterpret_cast from type %qT to type %qT casts away qualifiers"
  msgstr ""
  
! #: cp/typeck.c:6356
  #, gcc-internal-format
  msgid "useless cast to type %qT"
  msgstr ""
  
! #: cp/typeck.c:6723
  #, gcc-internal-format
  msgid "invalid static_cast from type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:6749
  #, gcc-internal-format
  msgid "converting from %qT to %qT"
  msgstr ""
  
! #: cp/typeck.c:6801
  #, gcc-internal-format
  msgid "invalid cast of an rvalue expression of type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:6871
  #, gcc-internal-format
  msgid "cast from %qT to %qT loses precision"
  msgstr ""
  
! #: cp/typeck.c:6911
  #, gcc-internal-format
  msgid "cast from %qT to %qT increases required alignment of target type"
  msgstr ""
  
! #: cp/typeck.c:6929
  #, gcc-internal-format
  msgid ""
  "casting between pointer-to-function and pointer-to-object is conditionally-"
  "supported"
  msgstr ""
  
! #: cp/typeck.c:6943
  #, gcc-internal-format
  msgid "invalid cast from type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:7004
  #, gcc-internal-format
  msgid ""
  "invalid use of const_cast with type %qT, which is not a pointer, reference, "
  "nor a pointer-to-data-member type"
  msgstr ""
  
! #: cp/typeck.c:7013
  #, gcc-internal-format
  msgid ""
  "invalid use of const_cast with type %qT, which is a pointer or reference to "
  "a function type"
  msgstr ""
  
! #: cp/typeck.c:7053
  #, gcc-internal-format
  msgid "invalid const_cast of an rvalue of type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:7114
  #, gcc-internal-format
  msgid "invalid const_cast from type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:7195 cp/typeck.c:7203
  #, gcc-internal-format
  msgid "ISO C++ forbids casting to an array type %qT"
  msgstr ""
  
! #: cp/typeck.c:7212
  #, gcc-internal-format
  msgid "invalid cast to function type %qT"
  msgstr ""
  
! #: cp/typeck.c:7493
  #, gcc-internal-format
  msgid "  in evaluation of %<%Q(%#T, %#T)%>"
  msgstr ""
  
! #: cp/typeck.c:7554
  #, gcc-internal-format
  msgid "assigning to an array from an initializer list"
  msgstr ""
  
! #: cp/typeck.c:7580
  #, gcc-internal-format
  msgid "incompatible types in assignment of %qT to %qT"
  msgstr ""
  
! #: cp/typeck.c:7594
  #, gcc-internal-format
  msgid "array used as initializer"
  msgstr ""
  
! #: cp/typeck.c:7596
  #, gcc-internal-format
  msgid "invalid array assignment"
  msgstr ""
  
! #: cp/typeck.c:7703
  #, gcc-internal-format
  msgid "   in pointer to member function conversion"
  msgstr ""
  
! #: cp/typeck.c:7717
  #, gcc-internal-format
  msgid "pointer to member conversion via virtual base %qT"
  msgstr ""
  
! #: cp/typeck.c:7764 cp/typeck.c:7783
  #, gcc-internal-format
  msgid "   in pointer to member conversion"
  msgstr ""
  
! #: cp/typeck.c:7865
  #, gcc-internal-format
  msgid "invalid conversion to type %qT from type %qT"
  msgstr ""
  
! #: cp/typeck.c:8147
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT for argument %qP to %qD"
  msgstr ""
  
! #: cp/typeck.c:8153
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in default argument"
  msgstr ""
  
! #: cp/typeck.c:8157
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in argument passing"
  msgstr ""
  
! #: cp/typeck.c:8161
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT"
  msgstr ""
  
! #: cp/typeck.c:8165
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in initialization"
  msgstr ""
  
! #: cp/typeck.c:8169
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in return"
  msgstr ""
  
! #: cp/typeck.c:8173
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in assignment"
  msgstr ""
  
! #: cp/typeck.c:8186
  #, gcc-internal-format
  msgid "class type %qT is incomplete"
  msgstr ""
  
! #: cp/typeck.c:8204
  #, gcc-internal-format
  msgid "parameter %qP of %qD might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8208
  #, gcc-internal-format
  msgid "parameter might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8213
  #, gcc-internal-format
  msgid "target of conversion might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8218
  #, gcc-internal-format
  msgid "target of initialization might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8228
  #, gcc-internal-format
  msgid ""
  "left-hand side of assignment might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8321
  #, gcc-internal-format
  msgid "in passing argument %P of %q+D"
  msgstr ""
  
! #: cp/typeck.c:8380
  #, gcc-internal-format
  msgid "returning reference to temporary"
  msgstr ""
  
! #: cp/typeck.c:8387
  #, gcc-internal-format
  msgid "reference to non-lvalue returned"
  msgstr ""
  
! #: cp/typeck.c:8400
  #, gcc-internal-format
  msgid "reference to local variable %q+D returned"
  msgstr ""
  
! #: cp/typeck.c:8403
  #, gcc-internal-format
  msgid "address of label %q+D returned"
  msgstr ""
  
! #: cp/typeck.c:8406
  #, gcc-internal-format
  msgid "address of local variable %q+D returned"
  msgstr ""
  
! #: cp/typeck.c:8452
  #, gcc-internal-format
  msgid "returning a value from a destructor"
  msgstr ""
  
  #. If a return statement appears in a handler of the
  #. function-try-block of a constructor, the program is ill-formed.
! #: cp/typeck.c:8460
  #, gcc-internal-format
  msgid "cannot return from a handler of a function-try-block of a constructor"
  msgstr ""
  
  #. You can't return a value from a constructor.
! #: cp/typeck.c:8463
  #, gcc-internal-format
  msgid "returning a value from a constructor"
  msgstr ""
  
  #. Give a helpful error message.
! #: cp/typeck.c:8486 cp/typeck.c:8530
  #, gcc-internal-format
  msgid "return-statement with no value, in function returning %qT"
  msgstr ""
  
! #: cp/typeck.c:8494
  #, gcc-internal-format
  msgid "returning initializer list"
  msgstr ""
  
! #: cp/typeck.c:8549
  #, gcc-internal-format
  msgid "return-statement with a value, in function returning 'void'"
  msgstr ""
  
! #: cp/typeck.c:8579
  #, gcc-internal-format
  msgid ""
  "%<operator new%> must not return NULL unless it is declared %<throw()%> (or -"
--- 43144,43521 ----
  msgstr ""
  
  #. Make this a permerror because we used to accept it.
! #: cp/typeck.c:5439
  #, gcc-internal-format
  msgid "taking address of temporary"
  msgstr ""
  
! #: cp/typeck.c:5441
  #, gcc-internal-format
  msgid "taking address of xvalue (rvalue reference)"
  msgstr ""
  
! #: cp/typeck.c:5458
  #, gcc-internal-format
  msgid "ISO C++ forbids taking address of function %<::main%>"
  msgstr ""
  
! #: cp/typeck.c:5513
  #, gcc-internal-format
  msgid "ISO C++ forbids taking the address of a cast to a non-lvalue expression"
  msgstr ""
  
! #: cp/typeck.c:5541
  #, gcc-internal-format
  msgid "cannot create pointer to reference member %qD"
  msgstr ""
  
! #: cp/typeck.c:5822
  #, gcc-internal-format
  msgid "ISO C++ forbids incrementing an enum"
  msgstr ""
  
! #: cp/typeck.c:5823
  #, gcc-internal-format
  msgid "ISO C++ forbids decrementing an enum"
  msgstr ""
  
! #: cp/typeck.c:5839
  #, gcc-internal-format
  msgid "cannot increment a pointer to incomplete type %qT"
  msgstr ""
  
! #: cp/typeck.c:5840
  #, gcc-internal-format
  msgid "cannot decrement a pointer to incomplete type %qT"
  msgstr ""
  
! #: cp/typeck.c:5851
  #, gcc-internal-format
  msgid "ISO C++ forbids incrementing a pointer of type %qT"
  msgstr ""
  
! #: cp/typeck.c:5852
  #, gcc-internal-format
  msgid "ISO C++ forbids decrementing a pointer of type %qT"
  msgstr ""
  
! #: cp/typeck.c:5887
  #, gcc-internal-format
  msgid "invalid use of Boolean expression as operand to %<operator--%>"
  msgstr ""
  
! #: cp/typeck.c:6049
  #, gcc-internal-format
  msgid "cannot take the address of %<this%>, which is an rvalue expression"
  msgstr ""
  
! #: cp/typeck.c:6071
  #, gcc-internal-format
  msgid "address of explicit register variable %qD requested"
  msgstr ""
  
! #: cp/typeck.c:6076
  #, gcc-internal-format
  msgid "address requested for %qD, which is declared %<register%>"
  msgstr ""
  
! #: cp/typeck.c:6158
  #, gcc-internal-format
  msgid "list-initializer for non-class type must not be parenthesized"
  msgstr ""
  
! #: cp/typeck.c:6170
  #, gcc-internal-format
  msgid "expression list treated as compound expression in initializer"
  msgstr ""
  
! #: cp/typeck.c:6174
  #, gcc-internal-format
  msgid "expression list treated as compound expression in mem-initializer"
  msgstr ""
  
! #: cp/typeck.c:6178
  #, gcc-internal-format
  msgid "expression list treated as compound expression in functional cast"
  msgstr ""
  
! #: cp/typeck.c:6215
  #, gcc-internal-format, gfc-internal-format
  msgid "%s expression list treated as compound expression"
  msgstr ""
  
! #: cp/typeck.c:6305
  #, gcc-internal-format
  msgid "no context to resolve type of %qE"
  msgstr ""
  
! #: cp/typeck.c:6338
  #, gcc-internal-format
  msgid "cast from type %qT to type %qT casts away qualifiers"
  msgstr ""
  
! #: cp/typeck.c:6344
  #, gcc-internal-format
  msgid "static_cast from type %qT to type %qT casts away qualifiers"
  msgstr ""
  
! #: cp/typeck.c:6350
  #, gcc-internal-format
  msgid "reinterpret_cast from type %qT to type %qT casts away qualifiers"
  msgstr ""
  
! #: cp/typeck.c:6373
  #, gcc-internal-format
  msgid "useless cast to type %qT"
  msgstr ""
  
! #: cp/typeck.c:6742
  #, gcc-internal-format
  msgid "invalid static_cast from type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:6768
  #, gcc-internal-format
  msgid "converting from %qT to %qT"
  msgstr ""
  
! #: cp/typeck.c:6820
  #, gcc-internal-format
  msgid "invalid cast of an rvalue expression of type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:6890
  #, gcc-internal-format
  msgid "cast from %qT to %qT loses precision"
  msgstr ""
  
! #: cp/typeck.c:6930
  #, gcc-internal-format
  msgid "cast from %qT to %qT increases required alignment of target type"
  msgstr ""
  
! #: cp/typeck.c:6948
  #, gcc-internal-format
  msgid ""
  "casting between pointer-to-function and pointer-to-object is conditionally-"
  "supported"
  msgstr ""
  
! #: cp/typeck.c:6962
  #, gcc-internal-format
  msgid "invalid cast from type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:7023
  #, gcc-internal-format
  msgid ""
  "invalid use of const_cast with type %qT, which is not a pointer, reference, "
  "nor a pointer-to-data-member type"
  msgstr ""
  
! #: cp/typeck.c:7032
  #, gcc-internal-format
  msgid ""
  "invalid use of const_cast with type %qT, which is a pointer or reference to "
  "a function type"
  msgstr ""
  
! #: cp/typeck.c:7072
  #, gcc-internal-format
  msgid "invalid const_cast of an rvalue of type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:7133
  #, gcc-internal-format
  msgid "invalid const_cast from type %qT to type %qT"
  msgstr ""
  
! #: cp/typeck.c:7214 cp/typeck.c:7222
  #, gcc-internal-format
  msgid "ISO C++ forbids casting to an array type %qT"
  msgstr ""
  
! #: cp/typeck.c:7231
  #, gcc-internal-format
  msgid "invalid cast to function type %qT"
  msgstr ""
  
! #: cp/typeck.c:7512
  #, gcc-internal-format
  msgid "  in evaluation of %<%Q(%#T, %#T)%>"
  msgstr ""
  
! #: cp/typeck.c:7573
  #, gcc-internal-format
  msgid "assigning to an array from an initializer list"
  msgstr ""
  
! #: cp/typeck.c:7599
  #, gcc-internal-format
  msgid "incompatible types in assignment of %qT to %qT"
  msgstr ""
  
! #: cp/typeck.c:7613
  #, gcc-internal-format
  msgid "array used as initializer"
  msgstr ""
  
! #: cp/typeck.c:7615
  #, gcc-internal-format
  msgid "invalid array assignment"
  msgstr ""
  
! #: cp/typeck.c:7722
  #, gcc-internal-format
  msgid "   in pointer to member function conversion"
  msgstr ""
  
! #: cp/typeck.c:7736
  #, gcc-internal-format
  msgid "pointer to member conversion via virtual base %qT"
  msgstr ""
  
! #: cp/typeck.c:7783 cp/typeck.c:7802
  #, gcc-internal-format
  msgid "   in pointer to member conversion"
  msgstr ""
  
! #: cp/typeck.c:7884
  #, gcc-internal-format
  msgid "invalid conversion to type %qT from type %qT"
  msgstr ""
  
! #: cp/typeck.c:8166
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT for argument %qP to %qD"
  msgstr ""
  
! #: cp/typeck.c:8172
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in default argument"
  msgstr ""
  
! #: cp/typeck.c:8176
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in argument passing"
  msgstr ""
  
! #: cp/typeck.c:8180
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT"
  msgstr ""
  
! #: cp/typeck.c:8184
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in initialization"
  msgstr ""
  
! #: cp/typeck.c:8188
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in return"
  msgstr ""
  
! #: cp/typeck.c:8192
  #, gcc-internal-format
  msgid "cannot convert %qT to %qT in assignment"
  msgstr ""
  
! #: cp/typeck.c:8205
  #, gcc-internal-format
  msgid "class type %qT is incomplete"
  msgstr ""
  
! #: cp/typeck.c:8223
  #, gcc-internal-format
  msgid "parameter %qP of %qD might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8227
  #, gcc-internal-format
  msgid "parameter might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8232
  #, gcc-internal-format
  msgid "target of conversion might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8237
  #, gcc-internal-format
  msgid "target of initialization might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8247
  #, gcc-internal-format
  msgid ""
  "left-hand side of assignment might be a candidate for a format attribute"
  msgstr ""
  
! #: cp/typeck.c:8340
  #, gcc-internal-format
  msgid "in passing argument %P of %q+D"
  msgstr ""
  
! #: cp/typeck.c:8399
  #, gcc-internal-format
  msgid "returning reference to temporary"
  msgstr ""
  
! #: cp/typeck.c:8406
  #, gcc-internal-format
  msgid "reference to non-lvalue returned"
  msgstr ""
  
! #: cp/typeck.c:8419
  #, gcc-internal-format
  msgid "reference to local variable %q+D returned"
  msgstr ""
  
! #: cp/typeck.c:8422
  #, gcc-internal-format
  msgid "address of label %q+D returned"
  msgstr ""
  
! #: cp/typeck.c:8425
  #, gcc-internal-format
  msgid "address of local variable %q+D returned"
  msgstr ""
  
! #: cp/typeck.c:8471
  #, gcc-internal-format
  msgid "returning a value from a destructor"
  msgstr ""
  
  #. If a return statement appears in a handler of the
  #. function-try-block of a constructor, the program is ill-formed.
! #: cp/typeck.c:8479
  #, gcc-internal-format
  msgid "cannot return from a handler of a function-try-block of a constructor"
  msgstr ""
  
  #. You can't return a value from a constructor.
! #: cp/typeck.c:8482
  #, gcc-internal-format
  msgid "returning a value from a constructor"
  msgstr ""
  
  #. Give a helpful error message.
! #: cp/typeck.c:8505 cp/typeck.c:8549
  #, gcc-internal-format
  msgid "return-statement with no value, in function returning %qT"
  msgstr ""
  
! #: cp/typeck.c:8513
  #, gcc-internal-format
  msgid "returning initializer list"
  msgstr ""
  
! #: cp/typeck.c:8568
  #, gcc-internal-format
  msgid "return-statement with a value, in function returning 'void'"
  msgstr ""
  
! #: cp/typeck.c:8598
  #, gcc-internal-format
  msgid ""
  "%<operator new%> must not return NULL unless it is declared %<throw()%> (or -"
*************** msgid ""
*** 43345,43356 ****
  msgstr ""
  
  #. Make this a permerror because we used to accept it.
! #: cp/typeck.c:9191
  #, gcc-internal-format
  msgid "using temporary as lvalue"
  msgstr ""
  
! #: cp/typeck.c:9193
  #, gcc-internal-format
  msgid "using xvalue (rvalue reference) as lvalue"
  msgstr ""
--- 43523,43534 ----
  msgstr ""
  
  #. Make this a permerror because we used to accept it.
! #: cp/typeck.c:9210
  #, gcc-internal-format
  msgid "using temporary as lvalue"
  msgstr ""
  
! #: cp/typeck.c:9212
  #, gcc-internal-format
  msgid "using xvalue (rvalue reference) as lvalue"
  msgstr ""
*************** msgstr ""
*** 43567,43699 ****
  msgid "insufficient contextual information to determine type"
  msgstr ""
  
! #: cp/typeck2.c:801
  #, gcc-internal-format
  msgid "constructor syntax used, but no constructor declared for type %qT"
  msgstr ""
  
! #: cp/typeck2.c:947
  #, gcc-internal-format
  msgid ""
  "narrowing conversion of %qE from %qT to %qT inside { } is ill-formed in C++11"
  msgstr ""
  
! #: cp/typeck2.c:954 cp/typeck2.c:964
  #, gcc-internal-format
  msgid "narrowing conversion of %qE from %qT to %qT inside { }"
  msgstr ""
  
! #: cp/typeck2.c:1033
  #, gcc-internal-format
  msgid "int-array initialized from non-wide string"
  msgstr ""
  
! #: cp/typeck2.c:1039
  #, gcc-internal-format
  msgid "int-array initialized from incompatible wide string"
  msgstr ""
  
! #: cp/typeck2.c:1059
  #, gcc-internal-format
  msgid "initializer-string for array of chars is too long"
  msgstr ""
  
! #: cp/typeck2.c:1120
  #, gcc-internal-format
  msgid "cannot initialize aggregate of type %qT with a compound literal"
  msgstr ""
  
! #: cp/typeck2.c:1138
  #, gcc-internal-format
  msgid "array must be initialized with a brace-enclosed initializer"
  msgstr ""
  
! #: cp/typeck2.c:1421 cp/typeck2.c:1445
  #, gcc-internal-format
  msgid "missing initializer for member %qD"
  msgstr ""
  
! #: cp/typeck2.c:1428
  #, gcc-internal-format
  msgid "member %qD is uninitialized reference"
  msgstr ""
  
! #: cp/typeck2.c:1435
  #, gcc-internal-format
  msgid "member %qD with uninitialized reference fields"
  msgstr ""
  
! #: cp/typeck2.c:1521
  #, gcc-internal-format
  msgid "no field %qD found in union being initialized"
  msgstr ""
  
! #: cp/typeck2.c:1532
  #, gcc-internal-format
  msgid "index value instead of field name in union initializer"
  msgstr ""
  
! #: cp/typeck2.c:1714
  #, gcc-internal-format
  msgid "circular pointer delegation detected"
  msgstr ""
  
! #: cp/typeck2.c:1728
  #, gcc-internal-format
  msgid "base operand of %<->%> has non-pointer type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1754
  #, gcc-internal-format
  msgid "result of %<operator->()%> yields non-pointer result"
  msgstr ""
  
! #: cp/typeck2.c:1756
  #, gcc-internal-format
  msgid "base operand of %<->%> is not a pointer"
  msgstr ""
  
! #: cp/typeck2.c:1783
  #, gcc-internal-format
  msgid "%qE cannot be used as a member pointer, since it is of type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1792
  #, gcc-internal-format
  msgid "cannot apply member pointer %qE to %qE, which is of non-class type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1814
  #, gcc-internal-format
  msgid "pointer to member type %qT incompatible with object type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1873
  #, gcc-internal-format
  msgid "pointer-to-member-function type %qT requires an rvalue"
  msgstr ""
  
! #: cp/typeck2.c:1880
  #, gcc-internal-format
  msgid "pointer-to-member-function type %qT requires an lvalue"
  msgstr ""
  
! #: cp/typeck2.c:1921
  #, gcc-internal-format
  msgid "functional cast to array type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1942
  #, gcc-internal-format
  msgid "invalid value-initialization of reference type"
  msgstr ""
  
! #: cp/typeck2.c:2168
  #, gcc-internal-format
  msgid "call to function %qD which throws incomplete type %q#T"
  msgstr ""
  
! #: cp/typeck2.c:2171
  #, gcc-internal-format
  msgid "call to function which throws incomplete type %q#T"
  msgstr ""
--- 43745,43877 ----
  msgid "insufficient contextual information to determine type"
  msgstr ""
  
! #: cp/typeck2.c:796
  #, gcc-internal-format
  msgid "constructor syntax used, but no constructor declared for type %qT"
  msgstr ""
  
! #: cp/typeck2.c:942
  #, gcc-internal-format
  msgid ""
  "narrowing conversion of %qE from %qT to %qT inside { } is ill-formed in C++11"
  msgstr ""
  
! #: cp/typeck2.c:949 cp/typeck2.c:959
  #, gcc-internal-format
  msgid "narrowing conversion of %qE from %qT to %qT inside { }"
  msgstr ""
  
! #: cp/typeck2.c:1028
  #, gcc-internal-format
  msgid "int-array initialized from non-wide string"
  msgstr ""
  
! #: cp/typeck2.c:1034
  #, gcc-internal-format
  msgid "int-array initialized from incompatible wide string"
  msgstr ""
  
! #: cp/typeck2.c:1054
  #, gcc-internal-format
  msgid "initializer-string for array of chars is too long"
  msgstr ""
  
! #: cp/typeck2.c:1115
  #, gcc-internal-format
  msgid "cannot initialize aggregate of type %qT with a compound literal"
  msgstr ""
  
! #: cp/typeck2.c:1133
  #, gcc-internal-format
  msgid "array must be initialized with a brace-enclosed initializer"
  msgstr ""
  
! #: cp/typeck2.c:1416 cp/typeck2.c:1440
  #, gcc-internal-format
  msgid "missing initializer for member %qD"
  msgstr ""
  
! #: cp/typeck2.c:1423
  #, gcc-internal-format
  msgid "member %qD is uninitialized reference"
  msgstr ""
  
! #: cp/typeck2.c:1430
  #, gcc-internal-format
  msgid "member %qD with uninitialized reference fields"
  msgstr ""
  
! #: cp/typeck2.c:1531
  #, gcc-internal-format
  msgid "no field %qD found in union being initialized"
  msgstr ""
  
! #: cp/typeck2.c:1542
  #, gcc-internal-format
  msgid "index value instead of field name in union initializer"
  msgstr ""
  
! #: cp/typeck2.c:1724
  #, gcc-internal-format
  msgid "circular pointer delegation detected"
  msgstr ""
  
! #: cp/typeck2.c:1738
  #, gcc-internal-format
  msgid "base operand of %<->%> has non-pointer type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1764
  #, gcc-internal-format
  msgid "result of %<operator->()%> yields non-pointer result"
  msgstr ""
  
! #: cp/typeck2.c:1766
  #, gcc-internal-format
  msgid "base operand of %<->%> is not a pointer"
  msgstr ""
  
! #: cp/typeck2.c:1793
  #, gcc-internal-format
  msgid "%qE cannot be used as a member pointer, since it is of type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1802
  #, gcc-internal-format
  msgid "cannot apply member pointer %qE to %qE, which is of non-class type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1824
  #, gcc-internal-format
  msgid "pointer to member type %qT incompatible with object type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1883
  #, gcc-internal-format
  msgid "pointer-to-member-function type %qT requires an rvalue"
  msgstr ""
  
! #: cp/typeck2.c:1890
  #, gcc-internal-format
  msgid "pointer-to-member-function type %qT requires an lvalue"
  msgstr ""
  
! #: cp/typeck2.c:1931
  #, gcc-internal-format
  msgid "functional cast to array type %qT"
  msgstr ""
  
! #: cp/typeck2.c:1952
  #, gcc-internal-format
  msgid "invalid value-initialization of reference type"
  msgstr ""
  
! #: cp/typeck2.c:2178
  #, gcc-internal-format
  msgid "call to function %qD which throws incomplete type %q#T"
  msgstr ""
  
! #: cp/typeck2.c:2181
  #, gcc-internal-format
  msgid "call to function which throws incomplete type %q#T"
  msgstr ""
*************** msgstr ""
*** 43876,43885 ****
  msgid "Array reference at %C cannot have more than %d dimensions"
  msgstr ""
  
! #: fortran/array.c:213 fortran/array.c:596 fortran/check.c:2581
! #: fortran/check.c:4859 fortran/check.c:4897 fortran/check.c:4939
! #: fortran/check.c:5138 fortran/match.c:1680 fortran/match.c:2781
! #: fortran/match.c:2977 fortran/simplify.c:4646
  #, gcc-internal-format
  msgid "Coarrays disabled at %C, use %<-fcoarray=%> to enable"
  msgstr ""
--- 44054,44063 ----
  msgid "Array reference at %C cannot have more than %d dimensions"
  msgstr ""
  
! #: fortran/array.c:213 fortran/array.c:610 fortran/check.c:2649
! #: fortran/check.c:4957 fortran/check.c:4995 fortran/check.c:5037
! #: fortran/check.c:5236 fortran/match.c:1685 fortran/match.c:2880
! #: fortran/match.c:3075 fortran/match.c:3271 fortran/simplify.c:4651
  #, gcc-internal-format
  msgid "Coarrays disabled at %C, use %<-fcoarray=%> to enable"
  msgstr ""
*************** msgstr ""
*** 43929,44099 ****
  msgid "Expected expression in array specification at %C"
  msgstr ""
  
! #: fortran/array.c:471
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank array at %C"
  msgstr ""
  
! #: fortran/array.c:505
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array specification for implied-shape array at %C"
  msgstr ""
  
! #: fortran/array.c:521 fortran/array.c:634
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array specification for an explicitly shaped array at %C"
  msgstr ""
  
! #: fortran/array.c:531 fortran/array.c:644
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array specification for assumed shape array at %C"
  msgstr ""
  
! #: fortran/array.c:545 fortran/array.c:658
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad specification for deferred shape array at %C"
  msgstr ""
  
! #: fortran/array.c:555 fortran/array.c:662
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad specification for assumed size array at %C"
  msgstr ""
  
! #: fortran/array.c:567 fortran/array.c:674
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected another dimension in array declaration at %C"
  msgstr ""
  
! #: fortran/array.c:573 fortran/array.c:602 fortran/array.c:680
  #, gcc-internal-format, gfc-internal-format
  msgid "Array specification at %C has more than %d dimensions"
  msgstr ""
  
! #: fortran/array.c:579
  #, gcc-internal-format, gfc-internal-format
  msgid "Array specification at %C with more than 7 dimensions"
  msgstr ""
  
! #: fortran/array.c:591
  #, gcc-internal-format, gfc-internal-format
  msgid "Coarray declaration at %C"
  msgstr ""
  
! #: fortran/array.c:688
  #, gcc-internal-format
  msgid "Upper bound of last coarray dimension must be %<*%> at %C"
  msgstr ""
  
! #: fortran/array.c:756
  #, gcc-internal-format
  msgid "The assumed-rank array %qs at %L shall not have a codimension"
  msgstr ""
  
! #: fortran/array.c:840
  #, gcc-internal-format
  msgid "gfc_compare_array_spec(): Array spec clobbered"
  msgstr ""
  
! #: fortran/array.c:916
  #, gcc-internal-format
  msgid "DO-iterator %qs at %L is inside iterator of the same name"
  msgstr ""
  
! #: fortran/array.c:1008 fortran/array.c:1152
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in array constructor at %C"
  msgstr ""
  
! #: fortran/array.c:1061
  #, gcc-internal-format, gfc-internal-format
  msgid "[...] style array constructors at %C"
  msgstr ""
  
! #: fortran/array.c:1083
  #, gcc-internal-format, gfc-internal-format
  msgid "Array constructor including type specification at %C"
  msgstr ""
  
! #: fortran/array.c:1092 fortran/match.c:3407
  #, gcc-internal-format, gfc-internal-format
  msgid "Type-spec at %L cannot contain a deferred type parameter"
  msgstr ""
  
! #: fortran/array.c:1114
  #, gcc-internal-format, gfc-internal-format
  msgid "Empty array constructor at %C is not allowed"
  msgstr ""
  
! #: fortran/array.c:1199
  #, gcc-internal-format, gfc-internal-format
  msgid "Element in %s array constructor at %L is %s"
  msgstr ""
  
! #: fortran/array.c:1530
  #, gcc-internal-format, gfc-internal-format
  msgid "Iterator step at %L cannot be zero"
  msgstr ""
  
! #: fortran/array.c:1667
  #, gcc-internal-format
  msgid ""
  "The number of elements in the array constructor at %L requires an increase "
  "of the allowed %d upper limit.   See %<-fmax-array-constructor%> option"
  msgstr ""
  
! #: fortran/array.c:1837
  #, gcc-internal-format, gfc-internal-format
  msgid "AC-IMPLIED-DO initial expression references control variable at %L"
  msgstr ""
  
! #: fortran/array.c:1844
  #, gcc-internal-format, gfc-internal-format
  msgid "AC-IMPLIED-DO final expression references control variable at %L"
  msgstr ""
  
! #: fortran/array.c:1851
  #, gcc-internal-format, gfc-internal-format
  msgid "AC-IMPLIED-DO step expression references control variable at %L"
  msgstr ""
  
! #: fortran/array.c:1863
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Array constructor value at %L shall not be unlimited polymorphic [F2008: "
  "C4106]"
  msgstr ""
  
! #: fortran/array.c:1946
  #, gcc-internal-format, gfc-internal-format
  msgid "Different CHARACTER lengths (%d/%d) in array constructor at %L"
  msgstr ""
  
! #: fortran/array.c:2064
  #, gcc-internal-format
  msgid "spec_dimen_size(): Bad dimension"
  msgstr ""
  
! #: fortran/array.c:2122
  #, gcc-internal-format
  msgid "gfc_ref_dimen_size(): Bad dimension"
  msgstr ""
  
! #: fortran/array.c:2250
  #, gcc-internal-format
  msgid "gfc_ref_dimen_size(): Bad dimen_type"
  msgstr ""
  
! #: fortran/array.c:2301
  #, gcc-internal-format
  msgid "gfc_array_dimen_size(): Bad dimension"
  msgstr ""
  
! #: fortran/array.c:2346
  #, gcc-internal-format
  msgid "gfc_array_dimen_size(): Bad EXPR_ARRAY expr"
  msgstr ""
  
! #: fortran/array.c:2490
  #, gcc-internal-format
  msgid "gfc_find_array_ref(): No ref found"
  msgstr ""
--- 44107,44292 ----
  msgid "Expected expression in array specification at %C"
  msgstr ""
  
! #: fortran/array.c:422 fortran/array.c:449
! #, gcc-internal-format, gfc-internal-format
! msgid "Expecting a scalar INTEGER expression at %C"
! msgstr ""
! 
! #: fortran/array.c:485
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank array at %C"
  msgstr ""
  
! #: fortran/array.c:519
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array specification for implied-shape array at %C"
  msgstr ""
  
! #: fortran/array.c:535 fortran/array.c:648
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array specification for an explicitly shaped array at %C"
  msgstr ""
  
! #: fortran/array.c:545 fortran/array.c:658
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array specification for assumed shape array at %C"
  msgstr ""
  
! #: fortran/array.c:559 fortran/array.c:672
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad specification for deferred shape array at %C"
  msgstr ""
  
! #: fortran/array.c:569 fortran/array.c:676
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad specification for assumed size array at %C"
  msgstr ""
  
! #: fortran/array.c:581 fortran/array.c:688
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected another dimension in array declaration at %C"
  msgstr ""
  
! #: fortran/array.c:587 fortran/array.c:616 fortran/array.c:694
  #, gcc-internal-format, gfc-internal-format
  msgid "Array specification at %C has more than %d dimensions"
  msgstr ""
  
! #: fortran/array.c:593
  #, gcc-internal-format, gfc-internal-format
  msgid "Array specification at %C with more than 7 dimensions"
  msgstr ""
  
! #: fortran/array.c:605
  #, gcc-internal-format, gfc-internal-format
  msgid "Coarray declaration at %C"
  msgstr ""
  
! #: fortran/array.c:702
  #, gcc-internal-format
  msgid "Upper bound of last coarray dimension must be %<*%> at %C"
  msgstr ""
  
! #: fortran/array.c:770
  #, gcc-internal-format
  msgid "The assumed-rank array %qs at %L shall not have a codimension"
  msgstr ""
  
! #: fortran/array.c:854
  #, gcc-internal-format
  msgid "gfc_compare_array_spec(): Array spec clobbered"
  msgstr ""
  
! #: fortran/array.c:930
  #, gcc-internal-format
  msgid "DO-iterator %qs at %L is inside iterator of the same name"
  msgstr ""
  
! #: fortran/array.c:1022 fortran/array.c:1218
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in array constructor at %C"
  msgstr ""
  
! #: fortran/array.c:1076
  #, gcc-internal-format, gfc-internal-format
  msgid "[...] style array constructors at %C"
  msgstr ""
  
! #: fortran/array.c:1099
  #, gcc-internal-format, gfc-internal-format
  msgid "Array constructor including type specification at %C"
  msgstr ""
  
! #: fortran/array.c:1108 fortran/match.c:3701
  #, gcc-internal-format, gfc-internal-format
  msgid "Type-spec at %L cannot contain a deferred type parameter"
  msgstr ""
  
! #: fortran/array.c:1117
! #, gcc-internal-format, gfc-internal-format
! msgid "Type-spec at %L cannot contain an asterisk for a type parameter"
! msgstr ""
! 
! #: fortran/array.c:1144
  #, gcc-internal-format, gfc-internal-format
  msgid "Empty array constructor at %C is not allowed"
  msgstr ""
  
! #: fortran/array.c:1181 fortran/array.c:1191
! #, gcc-internal-format, gfc-internal-format
! msgid "Incompatiable typespec for array element at %L"
! msgstr ""
! 
! #: fortran/array.c:1265
  #, gcc-internal-format, gfc-internal-format
  msgid "Element in %s array constructor at %L is %s"
  msgstr ""
  
! #: fortran/array.c:1596
  #, gcc-internal-format, gfc-internal-format
  msgid "Iterator step at %L cannot be zero"
  msgstr ""
  
! #: fortran/array.c:1733
  #, gcc-internal-format
  msgid ""
  "The number of elements in the array constructor at %L requires an increase "
  "of the allowed %d upper limit.   See %<-fmax-array-constructor%> option"
  msgstr ""
  
! #: fortran/array.c:1903
  #, gcc-internal-format, gfc-internal-format
  msgid "AC-IMPLIED-DO initial expression references control variable at %L"
  msgstr ""
  
! #: fortran/array.c:1910
  #, gcc-internal-format, gfc-internal-format
  msgid "AC-IMPLIED-DO final expression references control variable at %L"
  msgstr ""
  
! #: fortran/array.c:1917
  #, gcc-internal-format, gfc-internal-format
  msgid "AC-IMPLIED-DO step expression references control variable at %L"
  msgstr ""
  
! #: fortran/array.c:1929
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Array constructor value at %L shall not be unlimited polymorphic [F2008: "
  "C4106]"
  msgstr ""
  
! #: fortran/array.c:2012
  #, gcc-internal-format, gfc-internal-format
  msgid "Different CHARACTER lengths (%d/%d) in array constructor at %L"
  msgstr ""
  
! #: fortran/array.c:2130
  #, gcc-internal-format
  msgid "spec_dimen_size(): Bad dimension"
  msgstr ""
  
! #: fortran/array.c:2188
  #, gcc-internal-format
  msgid "gfc_ref_dimen_size(): Bad dimension"
  msgstr ""
  
! #: fortran/array.c:2316
  #, gcc-internal-format
  msgid "gfc_ref_dimen_size(): Bad dimen_type"
  msgstr ""
  
! #: fortran/array.c:2367
  #, gcc-internal-format
  msgid "gfc_array_dimen_size(): Bad dimension"
  msgstr ""
  
! #: fortran/array.c:2412
  #, gcc-internal-format
  msgid "gfc_array_dimen_size(): Bad EXPR_ARRAY expr"
  msgstr ""
  
! #: fortran/array.c:2556
  #, gcc-internal-format
  msgid "gfc_find_array_ref(): No ref found"
  msgstr ""
*************** msgstr ""
*** 44114,44419 ****
  msgid "%qs argument of %qs intrinsic at %L must be %s"
  msgstr ""
  
! #: fortran/check.c:89
  #, gcc-internal-format
! msgid "%qs argument of %qs intrinsic at %L must be a numeric type"
  msgstr ""
  
! #: fortran/check.c:104
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be INTEGER or REAL"
  msgstr ""
  
! #: fortran/check.c:121
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be REAL or COMPLEX"
  msgstr ""
  
! #: fortran/check.c:138
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be INTEGER or PROCEDURE"
  msgstr ""
  
! #: fortran/check.c:167 fortran/check.c:6252
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a constant"
  msgstr ""
  
! #: fortran/check.c:176
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid kind for %s at %L"
  msgstr ""
  
! #: fortran/check.c:195
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be double precision"
  msgstr ""
  
! #: fortran/check.c:218
  #, gcc-internal-format
  msgid "Expected coarray variable as %qs argument to the %s intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:235
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a logical array"
  msgstr ""
  
! #: fortran/check.c:261
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be an array"
  msgstr ""
  
! #: fortran/check.c:282
  #, gcc-internal-format
  msgid "%qs at %L must be nonnegative"
  msgstr ""
  
! #: fortran/check.c:313
  #, gcc-internal-format
  msgid ""
  "The absolute value of SHIFT at %L must be less than or equal to BIT_SIZE(%qs)"
  msgstr ""
  
! #: fortran/check.c:324
  #, gcc-internal-format
  msgid "%qs at %L must be less than or equal to BIT_SIZE(%qs)"
  msgstr ""
  
! #: fortran/check.c:334
  #, gcc-internal-format
  msgid "%qs at %L must be less than BIT_SIZE(%qs)"
  msgstr ""
  
! #: fortran/check.c:361
  #, gcc-internal-format
  msgid ""
  "%qs at %L must be less than or equal to the BIT_SIZE of INTEGER(KIND=%d)"
  msgstr ""
  
! #: fortran/check.c:387
  #, gcc-internal-format
  msgid "%<%s + %s%> at %L must be less than or equal to BIT_SIZE(%qs)"
  msgstr ""
  
! #: fortran/check.c:405
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be the same type and kind as %qs"
  msgstr ""
  
! #: fortran/check.c:422
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of rank %d"
  msgstr ""
  
! #: fortran/check.c:437
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must not be OPTIONAL"
  msgstr ""
  
! #: fortran/check.c:458
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be ALLOCATABLE"
  msgstr ""
  
! #: fortran/check.c:476
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of kind %d"
  msgstr ""
  
! #: fortran/check.c:514
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L cannot be INTENT(IN)"
  msgstr ""
  
! #: fortran/check.c:535
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a variable"
  msgstr ""
  
! #: fortran/check.c:584
  #, gcc-internal-format
  msgid ""
  "%<dim%> argument of %qs intrinsic at %L is not a valid codimension index"
  msgstr ""
  
! #: fortran/check.c:634
  #, gcc-internal-format
  msgid "%<dim%> argument of %qs intrinsic at %L is not a valid dimension index"
  msgstr ""
  
! #: fortran/check.c:737
  #, gcc-internal-format, gfc-internal-format
  msgid "Unequal character lengths (%ld/%ld) in %s at %L"
  msgstr ""
  
! #: fortran/check.c:859 fortran/check.c:6196
  #, gcc-internal-format
  msgid "%qs and %qs arguments of %qs intrinsic at %L must have the same type"
  msgstr ""
  
! #: fortran/check.c:868 fortran/check.c:2218 fortran/check.c:2344
! #: fortran/check.c:2418 fortran/check.c:2845
  #, gcc-internal-format, gfc-internal-format
  msgid "Different type kinds at %L"
  msgstr ""
  
! #: fortran/check.c:904
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a POINTER"
  msgstr ""
  
! #: fortran/check.c:913 fortran/check.c:949 fortran/check.c:3363
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:931
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be a pointer or target VARIABLE or "
  "FUNCTION"
  msgstr ""
  
! #: fortran/check.c:940
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a POINTER or a TARGET"
  msgstr ""
  
! #: fortran/check.c:965
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Array section with a vector subscript at %L shall not be the target of a "
  "pointer"
  msgstr ""
  
! #: fortran/check.c:976
  #, gcc-internal-format
  msgid ""
  "NULL pointer at %L is not permitted as actual argument of %qs intrinsic "
  "function"
  msgstr ""
  
! #: fortran/check.c:1019
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "ATOM argument at %L to intrinsic function %s shall be an integer of "
  "ATOMIC_INT_KIND or a logical of ATOMIC_LOGICAL_KIND"
  msgstr ""
  
! #: fortran/check.c:1027
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "ATOM argument at %L of the %s intrinsic function shall be a coarray or "
  "coindexed"
  msgstr ""
  
! #: fortran/check.c:1034
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "'%s' argument of '%s' intrinsic at %L shall have the same type as '%s' at %L"
  msgstr ""
  
! #: fortran/check.c:1052
  #, gcc-internal-format, gfc-internal-format
  msgid "STAT= argument to %s at %L"
  msgstr ""
  
! #: fortran/check.c:1071 fortran/check.c:1137 fortran/check.c:1181
  #, gcc-internal-format, gfc-internal-format
  msgid "ATOM argument of the %s intrinsic function at %L shall be definable"
  msgstr ""
  
! #: fortran/check.c:1085 fortran/check.c:1164
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "ATOM argument at %L to intrinsic function %s shall be an integer of "
  "ATOMIC_INT_KIND"
  msgstr ""
  
! #: fortran/check.c:1105
  #, gcc-internal-format, gfc-internal-format
  msgid "VALUE argument of the %s intrinsic function at %L shall be definable"
  msgstr ""
  
! #: fortran/check.c:1144 fortran/check.c:1188
  #, gcc-internal-format, gfc-internal-format
  msgid "OLD argument of the %s intrinsic function at %L shall be definable"
  msgstr ""
  
! #: fortran/check.c:1208
  #, gcc-internal-format, gfc-internal-format
  msgid "Negative argument N at %L"
  msgstr ""
  
! #: fortran/check.c:1380 fortran/check.c:1837
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must not be present if %<x%> is COMPLEX"
  msgstr ""
  
! #: fortran/check.c:1389 fortran/check.c:1846
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must have a type of either REAL or "
  "INTEGER"
  msgstr ""
  
! #: fortran/check.c:1403 fortran/check.c:1409
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Conversion from %s to default-kind COMPLEX(%d) at %L might lose precision, "
  "consider using the KIND argument"
  msgstr ""
  
! #: fortran/check.c:1431
  #, gcc-internal-format
  msgid ""
  "Argument %<A%> with INTENT(INOUT) at %L of the intrinsic subroutine %s shall "
  "not have a vector subscript"
  msgstr ""
  
! #: fortran/check.c:1439
  #, gcc-internal-format, gfc-internal-format
  msgid "The A argument at %L to the intrinsic %s shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:1462
  #, gcc-internal-format, gfc-internal-format
  msgid "The stat= argument at %L must be a kind=4 integer variable"
  msgstr ""
  
! #: fortran/check.c:1478
  #, gcc-internal-format, gfc-internal-format
  msgid "The errmsg= argument at %L must be a default-kind character variable"
  msgstr ""
  
! #: fortran/check.c:1486
  #, gcc-internal-format
  msgid "Coarrays disabled at %L, use %<-fcoarray=%> to enable"
  msgstr ""
  
! #: fortran/check.c:1501
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Support for the A argument at %L which is polymorphic A argument or has "
  "allocatable components is not yet implemented"
  msgstr ""
  
! #: fortran/check.c:1520
  #, gcc-internal-format, gfc-internal-format
  msgid "The A argument at %L of CO_REDUCE shall not be polymorphic"
  msgstr ""
  
! #: fortran/check.c:1527
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Support for the A argument at %L with allocatable components is not yet "
  "implemented"
  msgstr ""
  
! #: fortran/check.c:1541
  #, gcc-internal-format, gfc-internal-format
  msgid "OPERATOR argument at %L must be a PURE function"
  msgstr ""
--- 44307,44631 ----
  msgid "%qs argument of %qs intrinsic at %L must be %s"
  msgstr ""
  
! #: fortran/check.c:96
  #, gcc-internal-format
! msgid "%qs argument of %qs intrinsic at %L must have a numeric type"
  msgstr ""
  
! #: fortran/check.c:111
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be INTEGER or REAL"
  msgstr ""
  
! #: fortran/check.c:128
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be REAL or COMPLEX"
  msgstr ""
  
! #: fortran/check.c:145
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be INTEGER or PROCEDURE"
  msgstr ""
  
! #: fortran/check.c:174 fortran/check.c:6350
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a constant"
  msgstr ""
  
! #: fortran/check.c:183
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid kind for %s at %L"
  msgstr ""
  
! #: fortran/check.c:202
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be double precision"
  msgstr ""
  
! #: fortran/check.c:225
  #, gcc-internal-format
  msgid "Expected coarray variable as %qs argument to the %s intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:242
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a logical array"
  msgstr ""
  
! #: fortran/check.c:268
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be an array"
  msgstr ""
  
! #: fortran/check.c:289
  #, gcc-internal-format
  msgid "%qs at %L must be nonnegative"
  msgstr ""
  
! #: fortran/check.c:320
  #, gcc-internal-format
  msgid ""
  "The absolute value of SHIFT at %L must be less than or equal to BIT_SIZE(%qs)"
  msgstr ""
  
! #: fortran/check.c:331
  #, gcc-internal-format
  msgid "%qs at %L must be less than or equal to BIT_SIZE(%qs)"
  msgstr ""
  
! #: fortran/check.c:341
  #, gcc-internal-format
  msgid "%qs at %L must be less than BIT_SIZE(%qs)"
  msgstr ""
  
! #: fortran/check.c:368
  #, gcc-internal-format
  msgid ""
  "%qs at %L must be less than or equal to the BIT_SIZE of INTEGER(KIND=%d)"
  msgstr ""
  
! #: fortran/check.c:394
  #, gcc-internal-format
  msgid "%<%s + %s%> at %L must be less than or equal to BIT_SIZE(%qs)"
  msgstr ""
  
! #: fortran/check.c:420
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be the same type and kind as %qs"
  msgstr ""
  
! #: fortran/check.c:437
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of rank %d"
  msgstr ""
  
! #: fortran/check.c:452
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must not be OPTIONAL"
  msgstr ""
  
! #: fortran/check.c:473
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be ALLOCATABLE"
  msgstr ""
  
! #: fortran/check.c:491
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of kind %d"
  msgstr ""
  
! #: fortran/check.c:529
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L cannot be INTENT(IN)"
  msgstr ""
  
! #: fortran/check.c:550
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a variable"
  msgstr ""
  
! #: fortran/check.c:599
  #, gcc-internal-format
  msgid ""
  "%<dim%> argument of %qs intrinsic at %L is not a valid codimension index"
  msgstr ""
  
! #: fortran/check.c:649
  #, gcc-internal-format
  msgid "%<dim%> argument of %qs intrinsic at %L is not a valid dimension index"
  msgstr ""
  
! #: fortran/check.c:752
  #, gcc-internal-format, gfc-internal-format
  msgid "Unequal character lengths (%ld/%ld) in %s at %L"
  msgstr ""
  
! #: fortran/check.c:874 fortran/check.c:6294
  #, gcc-internal-format
  msgid "%qs and %qs arguments of %qs intrinsic at %L must have the same type"
  msgstr ""
  
! #: fortran/check.c:883 fortran/check.c:2286 fortran/check.c:2412
! #: fortran/check.c:2486 fortran/check.c:2913
  #, gcc-internal-format, gfc-internal-format
  msgid "Different type kinds at %L"
  msgstr ""
  
! #: fortran/check.c:919
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a POINTER"
  msgstr ""
  
! #: fortran/check.c:928 fortran/check.c:964 fortran/check.c:3431
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:946
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be a pointer or target VARIABLE or "
  "FUNCTION"
  msgstr ""
  
! #: fortran/check.c:955
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a POINTER or a TARGET"
  msgstr ""
  
! #: fortran/check.c:980
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Array section with a vector subscript at %L shall not be the target of a "
  "pointer"
  msgstr ""
  
! #: fortran/check.c:991
  #, gcc-internal-format
  msgid ""
  "NULL pointer at %L is not permitted as actual argument of %qs intrinsic "
  "function"
  msgstr ""
  
! #: fortran/check.c:1034
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "ATOM argument at %L to intrinsic function %s shall be an integer of "
  "ATOMIC_INT_KIND or a logical of ATOMIC_LOGICAL_KIND"
  msgstr ""
  
! #: fortran/check.c:1042
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "ATOM argument at %L of the %s intrinsic function shall be a coarray or "
  "coindexed"
  msgstr ""
  
! #: fortran/check.c:1049
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "'%s' argument of '%s' intrinsic at %L shall have the same type as '%s' at %L"
  msgstr ""
  
! #: fortran/check.c:1067 fortran/check.c:1212
  #, gcc-internal-format, gfc-internal-format
  msgid "STAT= argument to %s at %L"
  msgstr ""
  
! #: fortran/check.c:1086 fortran/check.c:1152 fortran/check.c:1249
  #, gcc-internal-format, gfc-internal-format
  msgid "ATOM argument of the %s intrinsic function at %L shall be definable"
  msgstr ""
  
! #: fortran/check.c:1100 fortran/check.c:1232
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "ATOM argument at %L to intrinsic function %s shall be an integer of "
  "ATOMIC_INT_KIND"
  msgstr ""
  
! #: fortran/check.c:1120
  #, gcc-internal-format, gfc-internal-format
  msgid "VALUE argument of the %s intrinsic function at %L shall be definable"
  msgstr ""
  
! #: fortran/check.c:1159 fortran/check.c:1256
  #, gcc-internal-format, gfc-internal-format
  msgid "OLD argument of the %s intrinsic function at %L shall be definable"
  msgstr ""
  
! #: fortran/check.c:1174
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "EVENT argument at %L to the intrinsic EVENT_QUERY shall be of type EVENT_TYPE"
! msgstr ""
! 
! #: fortran/check.c:1184
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "COUNT argument of the EVENT_QUERY intrinsic function at %L shall be definable"
! msgstr ""
! 
! #: fortran/check.c:1197
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "COUNT argument of the EVENT_QUERY intrinsic function at %L shall have at "
! "least the range of the default integer"
! msgstr ""
! 
! #: fortran/check.c:1276
  #, gcc-internal-format, gfc-internal-format
  msgid "Negative argument N at %L"
  msgstr ""
  
! #: fortran/check.c:1448 fortran/check.c:1905
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must not be present if %<x%> is COMPLEX"
  msgstr ""
  
! #: fortran/check.c:1457 fortran/check.c:1914
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must have a type of either REAL or "
  "INTEGER"
  msgstr ""
  
! #: fortran/check.c:1471 fortran/check.c:1477
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Conversion from %s to default-kind COMPLEX(%d) at %L might lose precision, "
  "consider using the KIND argument"
  msgstr ""
  
! #: fortran/check.c:1499
  #, gcc-internal-format
  msgid ""
  "Argument %<A%> with INTENT(INOUT) at %L of the intrinsic subroutine %s shall "
  "not have a vector subscript"
  msgstr ""
  
! #: fortran/check.c:1507
  #, gcc-internal-format, gfc-internal-format
  msgid "The A argument at %L to the intrinsic %s shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:1530
  #, gcc-internal-format, gfc-internal-format
  msgid "The stat= argument at %L must be a kind=4 integer variable"
  msgstr ""
  
! #: fortran/check.c:1546
  #, gcc-internal-format, gfc-internal-format
  msgid "The errmsg= argument at %L must be a default-kind character variable"
  msgstr ""
  
! #: fortran/check.c:1554
  #, gcc-internal-format
  msgid "Coarrays disabled at %L, use %<-fcoarray=%> to enable"
  msgstr ""
  
! #: fortran/check.c:1569
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Support for the A argument at %L which is polymorphic A argument or has "
  "allocatable components is not yet implemented"
  msgstr ""
  
! #: fortran/check.c:1588
  #, gcc-internal-format, gfc-internal-format
  msgid "The A argument at %L of CO_REDUCE shall not be polymorphic"
  msgstr ""
  
! #: fortran/check.c:1595
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Support for the A argument at %L with allocatable components is not yet "
  "implemented"
  msgstr ""
  
! #: fortran/check.c:1609
  #, gcc-internal-format, gfc-internal-format
  msgid "OPERATOR argument at %L must be a PURE function"
  msgstr ""
*************** msgstr ""
*** 44421,45105 ****
  #. None of the intrinsics fulfills the criteria of taking two arguments,
  #. returning the same type and kind as the arguments and being permitted
  #. as actual argument.
! #: fortran/check.c:1551
  #, gcc-internal-format, gfc-internal-format
  msgid "Intrinsic function %s at %L is not permitted for CO_REDUCE"
  msgstr ""
  
! #: fortran/check.c:1568
  #, gcc-internal-format, gfc-internal-format
  msgid "The function passed as OPERATOR at %L shall have two arguments"
  msgstr ""
  
! #: fortran/check.c:1578
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "A argument at %L has type %s but the function passed as OPERATOR at %L "
  "returns %s"
  msgstr ""
  
! #: fortran/check.c:1587
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L has arguments of type %s and %s but "
  "shall have type %s"
  msgstr ""
  
! #: fortran/check.c:1598
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall have scalar nonallocatable "
  "nonpointer arguments and return a nonallocatable nonpointer scalar"
  msgstr ""
  
! #: fortran/check.c:1606
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall have the VALUE attribute either "
  "for none or both arguments"
  msgstr ""
  
! #: fortran/check.c:1613
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall have the TARGET attribute either "
  "for none or both arguments"
  msgstr ""
  
! #: fortran/check.c:1620
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall have the ASYNCHRONOUS attribute "
  "either for none or both arguments"
  msgstr ""
  
! #: fortran/check.c:1628
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall not have the OPTIONAL attribute "
  "for either of the arguments"
  msgstr ""
  
! #: fortran/check.c:1658
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The character length of the A argument at %L and of the arguments of the "
  "OPERATOR at %L shall be the same"
  msgstr ""
  
! #: fortran/check.c:1665
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The character length of the A argument at %L and of the function result of "
  "the OPERATOR at %L shall be the same"
  msgstr ""
  
! #: fortran/check.c:1683
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "'%s' argument of '%s' intrinsic at %L shall be of type integer, real or "
  "character"
  msgstr ""
  
! #: fortran/check.c:1731 fortran/check.c:2263 fortran/check.c:2366
! #: fortran/check.c:2567 fortran/check.c:2612 fortran/check.c:3893
! #: fortran/check.c:4027 fortran/check.c:4082 fortran/check.c:5124
! #: fortran/check.c:5253
  #, gcc-internal-format
  msgid "%qs intrinsic with KIND argument at %L"
  msgstr ""
  
! #: fortran/check.c:1778 fortran/check.c:2029
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L has invalid shape in dimension %d (%ld/"
  "%ld)"
  msgstr ""
  
! #: fortran/check.c:1793 fortran/check.c:2044 fortran/check.c:2072
  #, gcc-internal-format
  msgid "%qs argument of intrinsic %qs at %L of must have rank %d or be a scalar"
  msgstr ""
  
! #: fortran/check.c:1896 fortran/check.c:2939 fortran/check.c:2947
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be numeric or LOGICAL"
  msgstr ""
  
! #: fortran/check.c:1910
  #, gcc-internal-format
  msgid ""
  "Different shape for arguments %qs and %qs at %L for intrinsic %<dot_product%>"
  msgstr ""
  
! #: fortran/check.c:1930 fortran/check.c:1938
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be default real"
  msgstr ""
  
! #: fortran/check.c:1959
  #, gcc-internal-format, gfc-internal-format
  msgid "'I' at %L and 'J' at %L cannot both be BOZ literal constants"
  msgstr ""
  
! #: fortran/check.c:2090
  #, gcc-internal-format, gfc-internal-format
  msgid "non-default INTEGER kind argument to %s intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:2150
  #, gcc-internal-format
  msgid "COMPLEX argument %qs of %qs intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:2314
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of %s at %L must be of length one"
  msgstr ""
  
! #: fortran/check.c:2373
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be the same kind as %qs"
  msgstr ""
  
! #: fortran/check.c:2463
  #, gcc-internal-format, gfc-internal-format
  msgid "SIZE at %L must be positive"
  msgstr ""
  
! #: fortran/check.c:2475
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The absolute value of SHIFT at %L must be less than or equal to SIZE at %L"
  msgstr ""
  
! #: fortran/check.c:2536
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of intrinsic type"
  msgstr ""
  
! #: fortran/check.c:2543
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a data entity"
  msgstr ""
  
! #: fortran/check.c:2754
  #, gcc-internal-format
  msgid "Intrinsic %qs at %L must have at least two arguments"
  msgstr ""
  
! #: fortran/check.c:2802
  #, gcc-internal-format
  msgid "Missing %qs argument to the %s intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:2817
  #, gcc-internal-format
  msgid "Duplicate argument %qs at %L to intrinsic %s"
  msgstr ""
  
! #: fortran/check.c:2822
  #, gcc-internal-format
  msgid "Unknown argument %qs at %L to intrinsic %s"
  msgstr ""
  
! #: fortran/check.c:2851
  #, gcc-internal-format
  msgid "%<a%d%> argument of %qs intrinsic at %L must be %s(%d)"
  msgstr ""
  
! #: fortran/check.c:2882
  #, gcc-internal-format
  msgid "%qs intrinsic with CHARACTER argument at %L"
  msgstr ""
  
! #: fortran/check.c:2889
  #, gcc-internal-format
  msgid ""
  "%<a1%> argument of %qs intrinsic at %L must be INTEGER, REAL or CHARACTER"
  msgstr ""
  
! #: fortran/check.c:2956
  #, gcc-internal-format
  msgid "Argument types of %qs intrinsic at %L must match (%s/%s)"
  msgstr ""
  
! #: fortran/check.c:2970
  #, gcc-internal-format
  msgid ""
  "Different shape on dimension 1 for arguments %qs and %qs at %L for intrinsic "
  "matmul"
  msgstr ""
  
! #: fortran/check.c:2989
  #, gcc-internal-format
  msgid ""
  "Different shape on dimension 2 for argument %qs and dimension 1 for argument "
  "%qs at %L for intrinsic matmul"
  msgstr ""
  
! #: fortran/check.c:2998
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of rank 1 or 2"
  msgstr ""
  
! #: fortran/check.c:3173
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be INTEGER"
  msgstr ""
  
! #: fortran/check.c:3233
  #, gcc-internal-format, gfc-internal-format
  msgid "The FROM argument to MOVE_ALLOC at %L shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:3244
  #, gcc-internal-format, gfc-internal-format
  msgid "The TO argument to MOVE_ALLOC at %L shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:3251
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The TO arguments in MOVE_ALLOC at %L must be polymorphic if FROM is "
  "polymorphic"
  msgstr ""
  
! #: fortran/check.c:3262
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The FROM and TO arguments of the MOVE_ALLOC intrinsic at %L must have the "
  "same rank %d/%d"
  msgstr ""
  
! #: fortran/check.c:3271
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The FROM and TO arguments of the MOVE_ALLOC intrinsic at %L must have the "
  "same corank %d/%d"
  msgstr ""
  
! #: fortran/check.c:3298
  #, gcc-internal-format
  msgid "Argument %<S%> of NEAREST at %L shall not be zero"
  msgstr ""
  
! #: fortran/check.c:3348
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be a POINTER, ALLOCATABLE or "
  "procedure pointer"
  msgstr ""
  
! #: fortran/check.c:3356
  #, gcc-internal-format, gfc-internal-format
  msgid "NULL intrinsic with allocatable MOLD at %L"
  msgstr ""
  
! #: fortran/check.c:3435 fortran/check.c:5200
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must provide at least as many elements "
  "as there are .TRUE. values in %qs (%ld/%d)"
  msgstr ""
  
! #: fortran/check.c:3493
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of a dummy variable"
  msgstr ""
  
! #: fortran/check.c:3501
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be of an OPTIONAL dummy variable"
  msgstr ""
  
! #: fortran/check.c:3520
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must not be a subobject of %qs"
  msgstr ""
  
! #: fortran/check.c:3568
  #, gcc-internal-format, gfc-internal-format
  msgid "The argument of the RANK intrinsic at %L must be a data object"
  msgstr ""
  
! #: fortran/check.c:3672
  #, gcc-internal-format
  msgid ""
  "%<shape%> argument of %<reshape%> intrinsic at %L must be an array of "
  "constant size"
  msgstr ""
  
! #: fortran/check.c:3682
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L is empty"
  msgstr ""
  
! #: fortran/check.c:3689
  #, gcc-internal-format
  msgid ""
  "%<shape%> argument of %<reshape%> intrinsic at %L has more than %d elements"
  msgstr ""
  
! #: fortran/check.c:3706
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L has negative element (%d)"
  msgstr ""
  
! #: fortran/check.c:3746
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L has wrong number of elements (%d/%d)"
  msgstr ""
  
! #: fortran/check.c:3764
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L has out-of-range dimension (%d)"
  msgstr ""
  
! #: fortran/check.c:3773
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L has invalid permutation of dimensions "
  "(dimension %<%d%> duplicated)"
  msgstr ""
  
! #: fortran/check.c:3809
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Without padding, there are not enough elements in the intrinsic RESHAPE "
  "source at %L to match the shape"
  msgstr ""
  
! #: fortran/check.c:3826 fortran/check.c:3845
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L cannot be of type %s"
  msgstr ""
  
! #: fortran/check.c:3836 fortran/check.c:3855
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of an extensible type"
  msgstr ""
  
! #: fortran/check.c:3954
  #, gcc-internal-format
  msgid "SELECTED_REAL_KIND with neither %<P%> nor %<R%> argument at %L"
  msgstr ""
  
! #: fortran/check.c:3985
  #, gcc-internal-format
  msgid "%qs intrinsic with RADIX argument at %L"
  msgstr ""
  
! #: fortran/check.c:4020
  #, gcc-internal-format
  msgid ""
  "%<source%> argument of %<shape%> intrinsic at %L must not be an assumed size "
  "array"
  msgstr ""
  
! #: fortran/check.c:4097 fortran/check.c:6235
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L shall not be a procedure"
  msgstr ""
  
! #: fortran/check.c:4110 fortran/check.c:4249 fortran/check.c:6227
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L shall not be TYPE(*)"
  msgstr ""
  
! #: fortran/check.c:4121 fortran/check.c:4261
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L shall not be an assumed-size array"
  msgstr ""
  
! #: fortran/check.c:4191
  #, gcc-internal-format
  msgid "is_c_interoperable(): gfc_simplify_expr failed"
  msgstr ""
  
! #: fortran/check.c:4240
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be an interoperable data entity: %s"
  msgstr ""
  
! #: fortran/check.c:4279
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument C_PTR_1 at %L to C_ASSOCIATED shall have the type TYPE(C_PTR) or "
  "TYPE(C_FUNPTR)"
  msgstr ""
  
! #: fortran/check.c:4293
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument C_PTR_2 at %L to C_ASSOCIATED shall have the same type as C_PTR_1: "
  "%s instead of %s"
  msgstr ""
  
! #: fortran/check.c:4317
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument CPTR at %L to C_F_POINTER shall have the type TYPE(C_PTR)"
  msgstr ""
  
! #: fortran/check.c:4329
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument FPTR at %L to C_F_POINTER must be a pointer"
  msgstr ""
  
! #: fortran/check.c:4336
  #, gcc-internal-format, gfc-internal-format
  msgid "FPTR argument at %L to C_F_POINTER shall not be polymorphic"
  msgstr ""
  
! #: fortran/check.c:4343
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument FPTR at %L to C_F_POINTER shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:4350
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected SHAPE argument at %L to C_F_POINTER with scalar FPTR"
  msgstr ""
  
! #: fortran/check.c:4356
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected SHAPE argument to C_F_POINTER with array FPTR at %L"
  msgstr ""
  
! #: fortran/check.c:4375
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "SHAPE argument at %L to C_F_POINTER must have the same size as the RANK of "
  "FPTR"
  msgstr ""
  
! #: fortran/check.c:4385
  #, gcc-internal-format, gfc-internal-format
  msgid "Polymorphic FPTR at %L to C_F_POINTER"
  msgstr ""
  
! #: fortran/check.c:4390
  #, gcc-internal-format, gfc-internal-format
  msgid "Noninteroperable array FPTR at %L to C_F_POINTER: %s"
  msgstr ""
  
! #: fortran/check.c:4406
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument CPTR at %L to C_F_PROCPOINTER shall have the type TYPE(C_FUNPTR)"
  msgstr ""
  
! #: fortran/check.c:4418
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument FPTR at %L to C_F_PROCPOINTER shall be a procedure pointer"
  msgstr ""
  
! #: fortran/check.c:4425
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument FPTR at %L to C_F_PROCPOINTER shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:4431
  #, gcc-internal-format, gfc-internal-format
  msgid "Noninteroperable procedure pointer at %L to C_F_PROCPOINTER"
  msgstr ""
  
! #: fortran/check.c:4445
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument X at %L to C_FUNLOC shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:4460
  #, gcc-internal-format
  msgid "Function result %qs at %L is invalid as X argument to C_FUNLOC"
  msgstr ""
  
! #: fortran/check.c:4468
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument X at %L to C_FUNLOC shall be a procedure or a procedure pointer"
  msgstr ""
  
! #: fortran/check.c:4474
  #, gcc-internal-format, gfc-internal-format
  msgid "Noninteroperable procedure at %L to C_FUNLOC"
  msgstr ""
  
! #: fortran/check.c:4488
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument X at %L to C_LOC shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:4494
  #, gcc-internal-format, gfc-internal-format
  msgid "X argument at %L to C_LOC shall not be polymorphic"
  msgstr ""
  
! #: fortran/check.c:4505
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument X at %L to C_LOC shall have either the POINTER or the TARGET "
  "attribute"
  msgstr ""
  
! #: fortran/check.c:4513
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument X at %L to C_LOC shall be not be a zero-sized string"
  msgstr ""
  
! #: fortran/check.c:4522
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument at %L to C_LOC shall not be polymorphic"
  msgstr ""
  
! #: fortran/check.c:4529
  #, gcc-internal-format, gfc-internal-format
  msgid "Noninteroperable array at %L as argument to C_LOC: %s"
  msgstr ""
  
! #: fortran/check.c:4540
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Array of interoperable type at %L to C_LOC which is nonallocatable and "
  "neither assumed size nor explicit size"
  msgstr ""
  
! #: fortran/check.c:4545
  #, gcc-internal-format, gfc-internal-format
  msgid "Array section at %L to C_LOC"
  msgstr ""
  
! #: fortran/check.c:4573
  #, gcc-internal-format, gfc-internal-format
  msgid "non double precision REAL argument to %s intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:4586
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be less than rank %d"
  msgstr ""
  
! #: fortran/check.c:4605
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L is not a valid dimension index"
  msgstr ""
  
! #: fortran/check.c:4868
  #, gcc-internal-format, gfc-internal-format
  msgid "%s argument to IMAGE_INDEX must be a rank one array at %L"
  msgstr ""
  
! #: fortran/check.c:4879
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The number of array elements of the SUB argument to IMAGE_INDEX at %L shall "
  "be %d (corank) not %d"
  msgstr ""
  
! #: fortran/check.c:4912
  #, gcc-internal-format, gfc-internal-format
  msgid "DISTANCE= argument to NUM_IMAGES at %L"
  msgstr ""
  
! #: fortran/check.c:4925
  #, gcc-internal-format, gfc-internal-format
  msgid "FAILED= argument to NUM_IMAGES at %L"
  msgstr ""
  
! #: fortran/check.c:4948
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "DIM argument without COARRAY argument not allowed for THIS_IMAGE intrinsic "
  "at %L"
  msgstr ""
  
! #: fortran/check.c:4955
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The DISTANCE argument may not be specified together with the COARRAY or DIM "
  "argument in intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:4966
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected DIM argument with noncoarray argument at %L"
  msgstr ""
  
! #: fortran/check.c:4984
  #, gcc-internal-format, gfc-internal-format
  msgid "DISTANCE= argument to THIS_IMAGE at %L"
  msgstr ""
  
! #: fortran/check.c:5064
  #, gcc-internal-format
  msgid "%<MOLD%> argument of %<TRANSFER%> intrinsic at %L must not be %s"
  msgstr ""
  
! #: fortran/check.c:5092
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Intrinsic TRANSFER at %L has partly undefined result: source size %ld < "
  "result size %ld"
  msgstr ""
  
! #: fortran/check.c:5214
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must have the same rank as %qs or be a "
  "scalar"
  msgstr ""
  
! #: fortran/check.c:5227
  #, gcc-internal-format
  msgid "%qs and %qs arguments of %qs intrinsic at %L must have identical shape."
  msgstr ""
  
! #: fortran/check.c:5485 fortran/check.c:5517
  #, gcc-internal-format
  msgid "Size of %qs argument of %qs intrinsic at %L too small (%i/%i)"
  msgstr ""
  
! #: fortran/check.c:5525
  #, gcc-internal-format, gfc-internal-format
  msgid "Too many arguments to %s at %L"
  msgstr ""
  
! #: fortran/check.c:5565
  #, gcc-internal-format, gfc-internal-format
  msgid "COUNT argument to SYSTEM_CLOCK at %L has non-default kind"
  msgstr ""
  
! #: fortran/check.c:5584
  #, gcc-internal-format, gfc-internal-format
  msgid "Real COUNT_RATE argument to SYSTEM_CLOCK at %L"
  msgstr ""
  
! #: fortran/check.c:5594
  #, gcc-internal-format, gfc-internal-format
  msgid "COUNT_RATE argument to SYSTEM_CLOCK at %L has non-default kind"
  msgstr ""
  
! #: fortran/check.c:5611
  #, gcc-internal-format, gfc-internal-format
  msgid "COUNT_MAX argument to SYSTEM_CLOCK at %L has non-default kind"
  msgstr ""
  
! #: fortran/check.c:5828
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be of a kind not wider than the "
  "default kind (%d)"
  msgstr ""
  
! #: fortran/check.c:6180 fortran/check.c:6188
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be INTEGER or LOGICAL"
  msgstr ""
  
! #: fortran/check.c:6219
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Intrinsic function NULL at %L cannot be an actual argument to STORAGE_SIZE, "
--- 44633,45322 ----
  #. None of the intrinsics fulfills the criteria of taking two arguments,
  #. returning the same type and kind as the arguments and being permitted
  #. as actual argument.
! #: fortran/check.c:1619
  #, gcc-internal-format, gfc-internal-format
  msgid "Intrinsic function %s at %L is not permitted for CO_REDUCE"
  msgstr ""
  
! #: fortran/check.c:1636
  #, gcc-internal-format, gfc-internal-format
  msgid "The function passed as OPERATOR at %L shall have two arguments"
  msgstr ""
  
! #: fortran/check.c:1646
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "A argument at %L has type %s but the function passed as OPERATOR at %L "
  "returns %s"
  msgstr ""
  
! #: fortran/check.c:1655
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L has arguments of type %s and %s but "
  "shall have type %s"
  msgstr ""
  
! #: fortran/check.c:1666
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall have scalar nonallocatable "
  "nonpointer arguments and return a nonallocatable nonpointer scalar"
  msgstr ""
  
! #: fortran/check.c:1674
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall have the VALUE attribute either "
  "for none or both arguments"
  msgstr ""
  
! #: fortran/check.c:1681
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall have the TARGET attribute either "
  "for none or both arguments"
  msgstr ""
  
! #: fortran/check.c:1688
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall have the ASYNCHRONOUS attribute "
  "either for none or both arguments"
  msgstr ""
  
! #: fortran/check.c:1696
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The function passed as OPERATOR at %L shall not have the OPTIONAL attribute "
  "for either of the arguments"
  msgstr ""
  
! #: fortran/check.c:1726
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The character length of the A argument at %L and of the arguments of the "
  "OPERATOR at %L shall be the same"
  msgstr ""
  
! #: fortran/check.c:1733
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The character length of the A argument at %L and of the function result of "
  "the OPERATOR at %L shall be the same"
  msgstr ""
  
! #: fortran/check.c:1751
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "'%s' argument of '%s' intrinsic at %L shall be of type integer, real or "
  "character"
  msgstr ""
  
! #: fortran/check.c:1799 fortran/check.c:2331 fortran/check.c:2434
! #: fortran/check.c:2635 fortran/check.c:2680 fortran/check.c:3991
! #: fortran/check.c:4125 fortran/check.c:4180 fortran/check.c:5222
! #: fortran/check.c:5351
  #, gcc-internal-format
  msgid "%qs intrinsic with KIND argument at %L"
  msgstr ""
  
! #: fortran/check.c:1846 fortran/check.c:2097
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L has invalid shape in dimension %d (%ld/"
  "%ld)"
  msgstr ""
  
! #: fortran/check.c:1861 fortran/check.c:2112 fortran/check.c:2140
  #, gcc-internal-format
  msgid "%qs argument of intrinsic %qs at %L of must have rank %d or be a scalar"
  msgstr ""
  
! #: fortran/check.c:1964 fortran/check.c:3007 fortran/check.c:3015
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be numeric or LOGICAL"
  msgstr ""
  
! #: fortran/check.c:1978
  #, gcc-internal-format
  msgid ""
  "Different shape for arguments %qs and %qs at %L for intrinsic %<dot_product%>"
  msgstr ""
  
! #: fortran/check.c:1998 fortran/check.c:2006
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be default real"
  msgstr ""
  
! #: fortran/check.c:2027
  #, gcc-internal-format, gfc-internal-format
  msgid "'I' at %L and 'J' at %L cannot both be BOZ literal constants"
  msgstr ""
  
! #: fortran/check.c:2158
  #, gcc-internal-format, gfc-internal-format
  msgid "non-default INTEGER kind argument to %s intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:2218
  #, gcc-internal-format
  msgid "COMPLEX argument %qs of %qs intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:2382
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of %s at %L must be of length one"
  msgstr ""
  
! #: fortran/check.c:2441
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be the same kind as %qs"
  msgstr ""
  
! #: fortran/check.c:2531
  #, gcc-internal-format, gfc-internal-format
  msgid "SIZE at %L must be positive"
  msgstr ""
  
! #: fortran/check.c:2543
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The absolute value of SHIFT at %L must be less than or equal to SIZE at %L"
  msgstr ""
  
! #: fortran/check.c:2604
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of intrinsic type"
  msgstr ""
  
! #: fortran/check.c:2611
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be a data entity"
  msgstr ""
  
! #: fortran/check.c:2822
  #, gcc-internal-format
  msgid "Intrinsic %qs at %L must have at least two arguments"
  msgstr ""
  
! #: fortran/check.c:2870
  #, gcc-internal-format
  msgid "Missing %qs argument to the %s intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:2885
  #, gcc-internal-format
  msgid "Duplicate argument %qs at %L to intrinsic %s"
  msgstr ""
  
! #: fortran/check.c:2890
  #, gcc-internal-format
  msgid "Unknown argument %qs at %L to intrinsic %s"
  msgstr ""
  
! #: fortran/check.c:2919
  #, gcc-internal-format
  msgid "%<a%d%> argument of %qs intrinsic at %L must be %s(%d)"
  msgstr ""
  
! #: fortran/check.c:2950
  #, gcc-internal-format
  msgid "%qs intrinsic with CHARACTER argument at %L"
  msgstr ""
  
! #: fortran/check.c:2957
  #, gcc-internal-format
  msgid ""
  "%<a1%> argument of %qs intrinsic at %L must be INTEGER, REAL or CHARACTER"
  msgstr ""
  
! #: fortran/check.c:3024
  #, gcc-internal-format
  msgid "Argument types of %qs intrinsic at %L must match (%s/%s)"
  msgstr ""
  
! #: fortran/check.c:3038
  #, gcc-internal-format
  msgid ""
  "Different shape on dimension 1 for arguments %qs and %qs at %L for intrinsic "
  "matmul"
  msgstr ""
  
! #: fortran/check.c:3057
  #, gcc-internal-format
  msgid ""
  "Different shape on dimension 2 for argument %qs and dimension 1 for argument "
  "%qs at %L for intrinsic matmul"
  msgstr ""
  
! #: fortran/check.c:3066
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of rank 1 or 2"
  msgstr ""
  
! #: fortran/check.c:3241
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be INTEGER"
  msgstr ""
  
! #: fortran/check.c:3301
  #, gcc-internal-format, gfc-internal-format
  msgid "The FROM argument to MOVE_ALLOC at %L shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:3312
  #, gcc-internal-format, gfc-internal-format
  msgid "The TO argument to MOVE_ALLOC at %L shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:3319
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The TO arguments in MOVE_ALLOC at %L must be polymorphic if FROM is "
  "polymorphic"
  msgstr ""
  
! #: fortran/check.c:3330
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The FROM and TO arguments of the MOVE_ALLOC intrinsic at %L must have the "
  "same rank %d/%d"
  msgstr ""
  
! #: fortran/check.c:3339
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The FROM and TO arguments of the MOVE_ALLOC intrinsic at %L must have the "
  "same corank %d/%d"
  msgstr ""
  
! #: fortran/check.c:3366
  #, gcc-internal-format
  msgid "Argument %<S%> of NEAREST at %L shall not be zero"
  msgstr ""
  
! #: fortran/check.c:3416
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be a POINTER, ALLOCATABLE or "
  "procedure pointer"
  msgstr ""
  
! #: fortran/check.c:3424
  #, gcc-internal-format, gfc-internal-format
  msgid "NULL intrinsic with allocatable MOLD at %L"
  msgstr ""
  
! #: fortran/check.c:3503 fortran/check.c:5298
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must provide at least as many elements "
  "as there are .TRUE. values in %qs (%ld/%d)"
  msgstr ""
  
! #: fortran/check.c:3561
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of a dummy variable"
  msgstr ""
  
! #: fortran/check.c:3569
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be of an OPTIONAL dummy variable"
  msgstr ""
  
! #: fortran/check.c:3588
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must not be a subobject of %qs"
  msgstr ""
  
! #: fortran/check.c:3636
  #, gcc-internal-format, gfc-internal-format
  msgid "The argument of the RANK intrinsic at %L must be a data object"
  msgstr ""
  
! #: fortran/check.c:3740
  #, gcc-internal-format
  msgid ""
  "%<shape%> argument of %<reshape%> intrinsic at %L must be an array of "
  "constant size"
  msgstr ""
  
! #: fortran/check.c:3750
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L is empty"
  msgstr ""
  
! #: fortran/check.c:3757
  #, gcc-internal-format
  msgid ""
  "%<shape%> argument of %<reshape%> intrinsic at %L has more than %d elements"
  msgstr ""
  
! #: fortran/check.c:3774
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L has negative element (%d)"
  msgstr ""
  
! #: fortran/check.c:3806
! #, gcc-internal-format, gfc-internal-format
! msgid "Element %d of actual argument of RESHAPE at %L cannot be negative"
! msgstr ""
! 
! #: fortran/check.c:3844
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L has wrong number of elements (%d/%d)"
  msgstr ""
  
! #: fortran/check.c:3862
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L has out-of-range dimension (%d)"
  msgstr ""
  
! #: fortran/check.c:3871
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L has invalid permutation of dimensions "
  "(dimension %<%d%> duplicated)"
  msgstr ""
  
! #: fortran/check.c:3907
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Without padding, there are not enough elements in the intrinsic RESHAPE "
  "source at %L to match the shape"
  msgstr ""
  
! #: fortran/check.c:3924 fortran/check.c:3943
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L cannot be of type %s"
  msgstr ""
  
! #: fortran/check.c:3934 fortran/check.c:3953
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be of an extensible type"
  msgstr ""
  
! #: fortran/check.c:4052
  #, gcc-internal-format
  msgid "SELECTED_REAL_KIND with neither %<P%> nor %<R%> argument at %L"
  msgstr ""
  
! #: fortran/check.c:4083
  #, gcc-internal-format
  msgid "%qs intrinsic with RADIX argument at %L"
  msgstr ""
  
! #: fortran/check.c:4118
  #, gcc-internal-format
  msgid ""
  "%<source%> argument of %<shape%> intrinsic at %L must not be an assumed size "
  "array"
  msgstr ""
  
! #: fortran/check.c:4195 fortran/check.c:6333
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L shall not be a procedure"
  msgstr ""
  
! #: fortran/check.c:4208 fortran/check.c:4347 fortran/check.c:6325
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L shall not be TYPE(*)"
  msgstr ""
  
! #: fortran/check.c:4219 fortran/check.c:4359
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L shall not be an assumed-size array"
  msgstr ""
  
! #: fortran/check.c:4289
  #, gcc-internal-format
  msgid "is_c_interoperable(): gfc_simplify_expr failed"
  msgstr ""
  
! #: fortran/check.c:4338
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be an interoperable data entity: %s"
  msgstr ""
  
! #: fortran/check.c:4377
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument C_PTR_1 at %L to C_ASSOCIATED shall have the type TYPE(C_PTR) or "
  "TYPE(C_FUNPTR)"
  msgstr ""
  
! #: fortran/check.c:4391
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument C_PTR_2 at %L to C_ASSOCIATED shall have the same type as C_PTR_1: "
  "%s instead of %s"
  msgstr ""
  
! #: fortran/check.c:4415
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument CPTR at %L to C_F_POINTER shall have the type TYPE(C_PTR)"
  msgstr ""
  
! #: fortran/check.c:4427
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument FPTR at %L to C_F_POINTER must be a pointer"
  msgstr ""
  
! #: fortran/check.c:4434
  #, gcc-internal-format, gfc-internal-format
  msgid "FPTR argument at %L to C_F_POINTER shall not be polymorphic"
  msgstr ""
  
! #: fortran/check.c:4441
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument FPTR at %L to C_F_POINTER shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:4448
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected SHAPE argument at %L to C_F_POINTER with scalar FPTR"
  msgstr ""
  
! #: fortran/check.c:4454
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected SHAPE argument to C_F_POINTER with array FPTR at %L"
  msgstr ""
  
! #: fortran/check.c:4473
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "SHAPE argument at %L to C_F_POINTER must have the same size as the RANK of "
  "FPTR"
  msgstr ""
  
! #: fortran/check.c:4483
  #, gcc-internal-format, gfc-internal-format
  msgid "Polymorphic FPTR at %L to C_F_POINTER"
  msgstr ""
  
! #: fortran/check.c:4488
  #, gcc-internal-format, gfc-internal-format
  msgid "Noninteroperable array FPTR at %L to C_F_POINTER: %s"
  msgstr ""
  
! #: fortran/check.c:4504
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument CPTR at %L to C_F_PROCPOINTER shall have the type TYPE(C_FUNPTR)"
  msgstr ""
  
! #: fortran/check.c:4516
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument FPTR at %L to C_F_PROCPOINTER shall be a procedure pointer"
  msgstr ""
  
! #: fortran/check.c:4523
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument FPTR at %L to C_F_PROCPOINTER shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:4529
  #, gcc-internal-format, gfc-internal-format
  msgid "Noninteroperable procedure pointer at %L to C_F_PROCPOINTER"
  msgstr ""
  
! #: fortran/check.c:4543
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument X at %L to C_FUNLOC shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:4558
  #, gcc-internal-format
  msgid "Function result %qs at %L is invalid as X argument to C_FUNLOC"
  msgstr ""
  
! #: fortran/check.c:4566
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument X at %L to C_FUNLOC shall be a procedure or a procedure pointer"
  msgstr ""
  
! #: fortran/check.c:4572
  #, gcc-internal-format, gfc-internal-format
  msgid "Noninteroperable procedure at %L to C_FUNLOC"
  msgstr ""
  
! #: fortran/check.c:4586
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument X at %L to C_LOC shall not be coindexed"
  msgstr ""
  
! #: fortran/check.c:4592
  #, gcc-internal-format, gfc-internal-format
  msgid "X argument at %L to C_LOC shall not be polymorphic"
  msgstr ""
  
! #: fortran/check.c:4603
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument X at %L to C_LOC shall have either the POINTER or the TARGET "
  "attribute"
  msgstr ""
  
! #: fortran/check.c:4611
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument X at %L to C_LOC shall be not be a zero-sized string"
  msgstr ""
  
! #: fortran/check.c:4620
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument at %L to C_LOC shall not be polymorphic"
  msgstr ""
  
! #: fortran/check.c:4627
  #, gcc-internal-format, gfc-internal-format
  msgid "Noninteroperable array at %L as argument to C_LOC: %s"
  msgstr ""
  
! #: fortran/check.c:4638
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Array of interoperable type at %L to C_LOC which is nonallocatable and "
  "neither assumed size nor explicit size"
  msgstr ""
  
! #: fortran/check.c:4643
  #, gcc-internal-format, gfc-internal-format
  msgid "Array section at %L to C_LOC"
  msgstr ""
  
! #: fortran/check.c:4671
  #, gcc-internal-format, gfc-internal-format
  msgid "non double precision REAL argument to %s intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:4684
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be less than rank %d"
  msgstr ""
  
! #: fortran/check.c:4703
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L is not a valid dimension index"
  msgstr ""
  
! #: fortran/check.c:4966
  #, gcc-internal-format, gfc-internal-format
  msgid "%s argument to IMAGE_INDEX must be a rank one array at %L"
  msgstr ""
  
! #: fortran/check.c:4977
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The number of array elements of the SUB argument to IMAGE_INDEX at %L shall "
  "be %d (corank) not %d"
  msgstr ""
  
! #: fortran/check.c:5010
  #, gcc-internal-format, gfc-internal-format
  msgid "DISTANCE= argument to NUM_IMAGES at %L"
  msgstr ""
  
! #: fortran/check.c:5023
  #, gcc-internal-format, gfc-internal-format
  msgid "FAILED= argument to NUM_IMAGES at %L"
  msgstr ""
  
! #: fortran/check.c:5046
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "DIM argument without COARRAY argument not allowed for THIS_IMAGE intrinsic "
  "at %L"
  msgstr ""
  
! #: fortran/check.c:5053
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The DISTANCE argument may not be specified together with the COARRAY or DIM "
  "argument in intrinsic at %L"
  msgstr ""
  
! #: fortran/check.c:5064
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected DIM argument with noncoarray argument at %L"
  msgstr ""
  
! #: fortran/check.c:5082
  #, gcc-internal-format, gfc-internal-format
  msgid "DISTANCE= argument to THIS_IMAGE at %L"
  msgstr ""
  
! #: fortran/check.c:5162
  #, gcc-internal-format
  msgid "%<MOLD%> argument of %<TRANSFER%> intrinsic at %L must not be %s"
  msgstr ""
  
! #: fortran/check.c:5190
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Intrinsic TRANSFER at %L has partly undefined result: source size %ld < "
  "result size %ld"
  msgstr ""
  
! #: fortran/check.c:5312
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must have the same rank as %qs or be a "
  "scalar"
  msgstr ""
  
! #: fortran/check.c:5325
  #, gcc-internal-format
  msgid "%qs and %qs arguments of %qs intrinsic at %L must have identical shape."
  msgstr ""
  
! #: fortran/check.c:5583 fortran/check.c:5615
  #, gcc-internal-format
  msgid "Size of %qs argument of %qs intrinsic at %L too small (%i/%i)"
  msgstr ""
  
! #: fortran/check.c:5623
  #, gcc-internal-format, gfc-internal-format
  msgid "Too many arguments to %s at %L"
  msgstr ""
  
! #: fortran/check.c:5663
  #, gcc-internal-format, gfc-internal-format
  msgid "COUNT argument to SYSTEM_CLOCK at %L has non-default kind"
  msgstr ""
  
! #: fortran/check.c:5682
  #, gcc-internal-format, gfc-internal-format
  msgid "Real COUNT_RATE argument to SYSTEM_CLOCK at %L"
  msgstr ""
  
! #: fortran/check.c:5692
  #, gcc-internal-format, gfc-internal-format
  msgid "COUNT_RATE argument to SYSTEM_CLOCK at %L has non-default kind"
  msgstr ""
  
! #: fortran/check.c:5709
  #, gcc-internal-format, gfc-internal-format
  msgid "COUNT_MAX argument to SYSTEM_CLOCK at %L has non-default kind"
  msgstr ""
  
! #: fortran/check.c:5926
  #, gcc-internal-format
  msgid ""
  "%qs argument of %qs intrinsic at %L must be of a kind not wider than the "
  "default kind (%d)"
  msgstr ""
  
! #: fortran/check.c:6278 fortran/check.c:6286
  #, gcc-internal-format
  msgid "%qs argument of %qs intrinsic at %L must be INTEGER or LOGICAL"
  msgstr ""
  
! #: fortran/check.c:6317
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Intrinsic function NULL at %L cannot be an actual argument to STORAGE_SIZE, "
*************** msgstr ""
*** 45115,45126 ****
  
  #. Since the extension field is 8 bit wide, we can only have
  #. up to 255 extension levels.
! #: fortran/class.c:725 fortran/decl.c:7810
  #, gcc-internal-format
  msgid "Maximum extension level reached with type %qs at %L"
  msgstr ""
  
! #: fortran/class.c:2761 fortran/class.c:2835
  #, gcc-internal-format
  msgid "%qs of %qs is PRIVATE at %L"
  msgstr ""
--- 45332,45343 ----
  
  #. Since the extension field is 8 bit wide, we can only have
  #. up to 255 extension levels.
! #: fortran/class.c:725 fortran/decl.c:7943
  #, gcc-internal-format
  msgid "Maximum extension level reached with type %qs at %L"
  msgstr ""
  
! #: fortran/class.c:2766 fortran/class.c:2840
  #, gcc-internal-format
  msgid "%qs of %qs is PRIVATE at %L"
  msgstr ""
*************** msgstr ""
*** 45145,45178 ****
  msgid "failure to simplify substring reference in DATA statement at %L"
  msgstr ""
  
! #: fortran/data.c:167
  #, gcc-internal-format, gfc-internal-format
! msgid ""
! "Initialization string starting at %L was truncated to fit the variable (%d/"
! "%d)"
  msgstr ""
  
! #: fortran/data.c:256
  #, gcc-internal-format, gfc-internal-format
  msgid "'%s' at %L already is initialized at %L"
  msgstr ""
  
! #: fortran/data.c:280
  #, gcc-internal-format, gfc-internal-format
  msgid "Data element below array lower bound at %L"
  msgstr ""
  
! #: fortran/data.c:297 fortran/data.c:386
  #, gcc-internal-format, gfc-internal-format
  msgid "Data element above array upper bound at %L"
  msgstr ""
  
! #: fortran/data.c:327 fortran/data.c:493
  #, gcc-internal-format
  msgid "re-initialization of %qs at %L"
  msgstr ""
  
! #: fortran/data.c:693
  #, gcc-internal-format
  msgid "TODO: Vector sections in data statements"
  msgstr ""
--- 45362,45398 ----
  msgid "failure to simplify substring reference in DATA statement at %L"
  msgstr ""
  
! #: fortran/data.c:170
  #, gcc-internal-format, gfc-internal-format
! msgid "Unused initialization string at %L because variable has zero length"
  msgstr ""
  
! #: fortran/data.c:176
! #, gcc-internal-format, gfc-internal-format
! msgid "Initialization string at %L was truncated to fit the variable (%d/%d)"
! msgstr ""
! 
! #: fortran/data.c:266
  #, gcc-internal-format, gfc-internal-format
  msgid "'%s' at %L already is initialized at %L"
  msgstr ""
  
! #: fortran/data.c:290
  #, gcc-internal-format, gfc-internal-format
  msgid "Data element below array lower bound at %L"
  msgstr ""
  
! #: fortran/data.c:307 fortran/data.c:396
  #, gcc-internal-format, gfc-internal-format
  msgid "Data element above array upper bound at %L"
  msgstr ""
  
! #: fortran/data.c:337 fortran/data.c:503
  #, gcc-internal-format
  msgid "re-initialization of %qs at %L"
  msgstr ""
  
! #: fortran/data.c:703
  #, gcc-internal-format
  msgid "TODO: Vector sections in data statements"
  msgstr ""
*************** msgstr ""
*** 45192,46597 ****
  msgid "Symbol %qs must be a PARAMETER in DATA statement at %C"
  msgstr ""
  
! #: fortran/decl.c:430
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid initializer %s in Data statement at %C"
  msgstr ""
  
! #: fortran/decl.c:532
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization at %C is not allowed in a PURE procedure"
  msgstr ""
  
! #: fortran/decl.c:592
  #, gcc-internal-format, gfc-internal-format
  msgid "DATA statement at %C is not allowed in a PURE procedure"
  msgstr ""
  
! #: fortran/decl.c:619
  #, gcc-internal-format, gfc-internal-format
  msgid "The assumed-rank array at %C shall not have a codimension"
  msgstr ""
  
! #: fortran/decl.c:687
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad INTENT specification at %C"
  msgstr ""
  
! #: fortran/decl.c:708
  #, gcc-internal-format, gfc-internal-format
  msgid "deferred type parameter at %C"
  msgstr ""
  
! #: fortran/decl.c:745
  #, gcc-internal-format, gfc-internal-format
! msgid "Conflict in attributes of function argument at %C"
  msgstr ""
  
! #: fortran/decl.c:771
  #, gcc-internal-format, gfc-internal-format
  msgid "Old-style character length at %C"
  msgstr ""
  
! #: fortran/decl.c:802
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in character length specification at %C"
  msgstr ""
  
! #: fortran/decl.c:924
  #, gcc-internal-format, gfc-internal-format
  msgid "Procedure '%s' at %C is already defined at %L"
  msgstr ""
  
! #: fortran/decl.c:932
  #, gcc-internal-format, gfc-internal-format
  msgid "Name '%s' at %C is already defined as a generic interface at %L"
  msgstr ""
  
! #: fortran/decl.c:945
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Procedure '%s' at %C has an explicit interface and must not have attributes "
  "declared at %L"
  msgstr ""
  
! #: fortran/decl.c:1016
  #, gcc-internal-format
  msgid ""
  "Procedure %qs at %L must have the BIND(C) attribute to be C interoperable"
  msgstr ""
  
! #: fortran/decl.c:1043
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is a dummy argument to the BIND(C) procedure %qs but is "
  "not C interoperable because derived type %qs is not C interoperable"
  msgstr ""
  
! #: fortran/decl.c:1050
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is a dummy argument to the BIND(C) procedure %qs but is "
  "not C interoperable because it is polymorphic"
  msgstr ""
  
! #: fortran/decl.c:1057
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is a dummy argument of the BIND(C) procedure %qs but may "
  "not be C interoperable"
  msgstr ""
  
! #: fortran/decl.c:1072
  #, gcc-internal-format
  msgid ""
  "Character argument %qs at %L must be length 1 because procedure %qs is "
  "BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1085
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L with ALLOCATABLE attribute in procedure %qs with BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1093
  #, gcc-internal-format
  msgid "Variable %qs at %L with POINTER attribute in procedure %qs with BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1102
  #, gcc-internal-format
  msgid ""
  "Scalar variable %qs at %L with POINTER or ALLOCATABLE in procedure %qs with "
  "BIND(C) is not yet supported"
  msgstr ""
  
! #: fortran/decl.c:1111
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L cannot have both the OPTIONAL and the VALUE attribute "
  "because procedure %qs is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1118
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L with OPTIONAL attribute in procedure %qs which is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1129
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-shape array '%s' at %L as dummy argument to the BIND(C) procedure "
  "'%s' at %L"
  msgstr ""
  
! #: fortran/decl.c:1209
  #, gcc-internal-format
  msgid ""
  "Variable %qs in common block %qs at %C must be declared with a C "
  "interoperable kind since common block %qs is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1252
  #, gcc-internal-format, gfc-internal-format
  msgid "CHARACTER expression at %L is being truncated (%d/%d)"
  msgstr ""
  
! #: fortran/decl.c:1259
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The CHARACTER elements of the array constructor at %L must have the same "
  "length (%d/%d)"
  msgstr ""
  
! #: fortran/decl.c:1349
  #, gcc-internal-format
  msgid "Initializer not allowed for PARAMETER %qs at %C"
  msgstr ""
  
! #: fortran/decl.c:1359
  #, gcc-internal-format, gfc-internal-format
  msgid "PARAMETER at %L is missing an initializer"
  msgstr ""
  
! #: fortran/decl.c:1369
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %C with an initializer already appears in a DATA statement"
  msgstr ""
  
! #: fortran/decl.c:1448
  #, gcc-internal-format, gfc-internal-format
  msgid "Can't initialize implied-shape array at %L with scalar"
  msgstr ""
  
! #: fortran/decl.c:1466
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-constant lower bound in implied-shape declaration at %L"
  msgstr ""
  
! #: fortran/decl.c:1561
  #, gcc-internal-format, gfc-internal-format
  msgid "Component at %C must have the POINTER attribute"
  msgstr ""
  
! #: fortran/decl.c:1569
  #, gcc-internal-format, gfc-internal-format
  msgid "Array component of structure at %C must have explicit or deferred shape"
  msgstr ""
  
! #: fortran/decl.c:1650
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer array component of structure at %C must have a deferred shape"
  msgstr ""
  
! #: fortran/decl.c:1659
  #, gcc-internal-format, gfc-internal-format
  msgid "Allocatable component of structure at %C must have a deferred shape"
  msgstr ""
  
! #: fortran/decl.c:1668
  #, gcc-internal-format, gfc-internal-format
  msgid "Array component of structure at %C must have an explicit shape"
  msgstr ""
  
! #: fortran/decl.c:1722
  #, gcc-internal-format, gfc-internal-format
  msgid "NULL() initialization at %C is ambiguous"
  msgstr ""
  
! #: fortran/decl.c:1739
  #, gcc-internal-format, gfc-internal-format
  msgid "NULL() initialization at %C may not have MOLD"
  msgstr ""
  
! #: fortran/decl.c:1756
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization of pointer at %C is not allowed in a PURE procedure"
  msgstr ""
  
! #: fortran/decl.c:1777
  #, gcc-internal-format, gfc-internal-format
  msgid "Error in pointer initialization at %C"
  msgstr ""
  
! #: fortran/decl.c:1784
  #, gcc-internal-format, gfc-internal-format
  msgid "non-NULL pointer initialization at %C"
  msgstr ""
  
! #: fortran/decl.c:1807
  #, gcc-internal-format
  msgid "Function name %qs not allowed at %C"
  msgstr ""
  
! #: fortran/decl.c:1874
  #, gcc-internal-format
  msgid "Non-PARAMETER symbol %qs at %L can't be implied-shape"
  msgstr ""
  
! #: fortran/decl.c:1884
  #, gcc-internal-format, gfc-internal-format
  msgid "Implied-shape array at %L"
  msgstr ""
  
! #: fortran/decl.c:1949 fortran/decl.c:6678
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate array spec for Cray pointee at %C"
  msgstr ""
  
! #: fortran/decl.c:1957
  #, gcc-internal-format
  msgid "Couldn't set pointee array spec."
  msgstr ""
  
! #: fortran/decl.c:2020
  #, gcc-internal-format, gfc-internal-format
  msgid "Old-style initialization at %C"
  msgstr ""
  
! #: fortran/decl.c:2025
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid old style initialization for derived type component at %C"
  msgstr ""
  
! #: fortran/decl.c:2042 fortran/decl.c:5053
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization at %C isn't for a pointer variable"
  msgstr ""
  
! #: fortran/decl.c:2055
  #, gcc-internal-format
  msgid "Pointer initialization at %C requires %<=>%>, not %<=%>"
  msgstr ""
  
! #: fortran/decl.c:2064 fortran/decl.c:7959
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected an initialization expression at %C"
  msgstr ""
  
! #: fortran/decl.c:2071
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization of variable at %C is not allowed in a PURE procedure"
  msgstr ""
  
! #: fortran/decl.c:2088
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization of allocatable component at %C is not allowed"
  msgstr ""
  
! #: fortran/decl.c:2142 fortran/decl.c:2178
  #, gcc-internal-format, gfc-internal-format
  msgid "Old-style type declaration %s*%d not supported at %C"
  msgstr ""
  
! #: fortran/decl.c:2184
  #, gcc-internal-format, gfc-internal-format
  msgid "Nonstandard type declaration %s*%d at %C"
  msgstr ""
  
! #: fortran/decl.c:2235 fortran/decl.c:2311
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing right parenthesis at %C"
  msgstr ""
  
! #: fortran/decl.c:2248 fortran/decl.c:2382
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected initialization expression at %C"
  msgstr ""
  
! #: fortran/decl.c:2256 fortran/decl.c:2388
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected scalar initialization expression at %C"
  msgstr ""
  
! #: fortran/decl.c:2287
  #, gcc-internal-format, gfc-internal-format
  msgid "Kind %d not supported for type %s at %C"
  msgstr ""
  
! #: fortran/decl.c:2300
  #, gcc-internal-format, gfc-internal-format
  msgid "C kind type parameter is for type %s but type at %L is %s"
  msgstr ""
  
! #: fortran/decl.c:2309
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing right parenthesis or comma at %C"
  msgstr ""
  
! #: fortran/decl.c:2408
  #, gcc-internal-format, gfc-internal-format
  msgid "Kind %d is not supported for CHARACTER at %C"
  msgstr ""
  
! #: fortran/decl.c:2540
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in CHARACTER declaration at %C"
  msgstr ""
  
! #: fortran/decl.c:2625
  #, gcc-internal-format, gfc-internal-format
  msgid "BYTE type at %C"
  msgstr ""
  
! #: fortran/decl.c:2630
  #, gcc-internal-format, gfc-internal-format
  msgid "BYTE type used at %C is not available on the target machine"
  msgstr ""
  
! #: fortran/decl.c:2652
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed type at %C is not allowed for components"
  msgstr ""
  
! #: fortran/decl.c:2655
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed type at %C"
  msgstr ""
  
! #: fortran/decl.c:2678 fortran/decl.c:2709 fortran/decl.c:2738
! #: fortran/decl.c:2917
  #, gcc-internal-format, gfc-internal-format
  msgid "TYPE with intrinsic-type-spec at %C"
  msgstr ""
  
! #: fortran/decl.c:2734
  #, gcc-internal-format, gfc-internal-format
  msgid "DOUBLE COMPLEX at %C"
  msgstr ""
  
! #: fortran/decl.c:2808
  #, gcc-internal-format, gfc-internal-format
  msgid "CLASS statement at %C"
  msgstr ""
  
! #: fortran/decl.c:2843 fortran/decl.c:2856 fortran/decl.c:3301
! #: fortran/decl.c:3309
  #, gcc-internal-format
  msgid "Type name %qs at %C is ambiguous"
  msgstr ""
  
! #: fortran/decl.c:2871
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Type name '%s' at %C conflicts with previously declared entity at %L, which "
  "has the same name"
  msgstr ""
  
! #: fortran/decl.c:2984
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate IMPLICIT NONE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:2993
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPORT NONE with spec list at %C"
  msgstr ""
  
! #: fortran/decl.c:3052
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing character range in IMPLICIT at %C"
  msgstr ""
  
! #: fortran/decl.c:3098
  #, gcc-internal-format, gfc-internal-format
  msgid "Letters must be in alphabetic order in IMPLICIT statement at %C"
  msgstr ""
  
! #: fortran/decl.c:3151
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPLICIT statement at %C following an IMPLICIT NONE (type) statement"
  msgstr ""
  
! #: fortran/decl.c:3161
  #, gcc-internal-format, gfc-internal-format
  msgid "Empty IMPLICIT statement at %C"
  msgstr ""
  
! #: fortran/decl.c:3267
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPORT statement at %C only permitted in an INTERFACE body"
  msgstr ""
  
! #: fortran/decl.c:3272
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPORT statement at %C"
  msgstr ""
  
! #: fortran/decl.c:3286
  #, gcc-internal-format, gfc-internal-format
  msgid "Expecting list of named entities at %C"
  msgstr ""
  
! #: fortran/decl.c:3315
  #, gcc-internal-format
  msgid "Cannot IMPORT %qs from host scoping unit at %C - does not exist."
  msgstr ""
  
! #: fortran/decl.c:3322
  #, gcc-internal-format
  msgid "%qs is already IMPORTed from host scoping unit at %C"
  msgstr ""
  
! #: fortran/decl.c:3365
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in IMPORT statement at %C"
  msgstr ""
  
! #: fortran/decl.c:3664
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing codimension specification at %C"
  msgstr ""
  
! #: fortran/decl.c:3666
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing dimension specification at %C"
  msgstr ""
  
! #: fortran/decl.c:3749
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate %s attribute at %L"
  msgstr ""
  
! #: fortran/decl.c:3768
  #, gcc-internal-format, gfc-internal-format
  msgid "ALLOCATABLE attribute at %C in a TYPE definition"
  msgstr ""
  
! #: fortran/decl.c:3777
  #, gcc-internal-format, gfc-internal-format
  msgid "Attribute at %L is not allowed in a TYPE definition"
  msgstr ""
  
! #: fortran/decl.c:3795
  #, gcc-internal-format, gfc-internal-format
  msgid "Attribute %s at %L in a TYPE definition"
  msgstr ""
  
! #: fortran/decl.c:3805
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "%s attribute at %L is not allowed outside of the specification part of a "
  "module"
  msgstr ""
  
! #: fortran/decl.c:3819
  #, gcc-internal-format, gfc-internal-format
  msgid "ASYNCHRONOUS attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:3830
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTIGUOUS attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:3875 fortran/decl.c:6974
  #, gcc-internal-format, gfc-internal-format
  msgid "PROTECTED at %C only allowed in specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:3881
  #, gcc-internal-format, gfc-internal-format
  msgid "PROTECTED attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:3910
  #, gcc-internal-format, gfc-internal-format
  msgid "VALUE attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:3917
  #, gcc-internal-format, gfc-internal-format
  msgid "VOLATILE attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:3924
  #, gcc-internal-format
  msgid "match_attr_spec(): Bad attribute"
  msgstr ""
  
! #: fortran/decl.c:3962
  #, gcc-internal-format, gfc-internal-format
  msgid "Multiple identifiers provided with single NAME= specifier at %C"
  msgstr ""
  
! #: fortran/decl.c:4060
  #, gcc-internal-format
  msgid ""
  "Implicitly declared BIND(C) function %qs at %L may not be C interoperable"
  msgstr ""
  
! #: fortran/decl.c:4082
  #, gcc-internal-format
  msgid ""
  "Variable %qs in common block %qs at %L may not be a C interoperable kind "
  "though common block %qs is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:4091
  #, gcc-internal-format
  msgid "Type declaration %qs at %L is not C interoperable but it is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:4095
  #, gcc-internal-format
  msgid "Variable %qs at %L may not be a C interoperable kind but it is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:4107
  #, gcc-internal-format
  msgid ""
  "Variable %qs in common block %qs at %L cannot be declared with BIND(C) since "
  "it is not a global"
  msgstr ""
  
! #: fortran/decl.c:4121
  #, gcc-internal-format
  msgid "Variable %qs at %L cannot have both the POINTER and BIND(C) attributes"
  msgstr ""
  
! #: fortran/decl.c:4129
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L cannot have both the ALLOCATABLE and BIND(C) attributes"
  msgstr ""
  
! #: fortran/decl.c:4141
  #, gcc-internal-format
  msgid "Return type of BIND(C) function %qs at %L cannot be an array"
  msgstr ""
  
! #: fortran/decl.c:4149
  #, gcc-internal-format
  msgid "Return type of BIND(C) function %qs at %L cannot be a character string"
  msgstr ""
  
  #. Use gfc_warning_now because we won't say that the symbol fails
  #. just because of this.
! #: fortran/decl.c:4160
  #, gcc-internal-format
  msgid ""
  "Symbol %qs at %L is marked PRIVATE but has been given the binding label %qs"
  msgstr ""
  
! #: fortran/decl.c:4234
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Need either entity or common block name for attribute specification "
  "statement at %C"
  msgstr ""
  
! #: fortran/decl.c:4279
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Missing entity or common block name for attribute specification statement at "
  "%C"
  msgstr ""
  
! #: fortran/decl.c:4286
  #, gcc-internal-format
  msgid "Missing symbol"
  msgstr ""
  
! #: fortran/decl.c:4315
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) statement at %C"
  msgstr ""
  
! #: fortran/decl.c:4393
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Derived type at %C has not been previously defined and so cannot appear in a "
  "derived type definition"
  msgstr ""
  
! #: fortran/decl.c:4425
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in data declaration at %C"
  msgstr ""
  
! #: fortran/decl.c:4498
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPURE procedure at %C"
  msgstr ""
  
! #: fortran/decl.c:4510
  #, gcc-internal-format, gfc-internal-format
  msgid "PURE and IMPURE must not appear both at %C"
  msgstr ""
  
! #: fortran/decl.c:4578 fortran/primary.c:1719
  #, gcc-internal-format, gfc-internal-format
  msgid "Alternate-return argument at %C"
  msgstr ""
  
! #: fortran/decl.c:4624
  #, gcc-internal-format
  msgid "Name %qs at %C is the name of the procedure"
  msgstr ""
  
! #: fortran/decl.c:4636
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected junk in formal argument list at %C"
  msgstr ""
  
! #: fortran/decl.c:4653
  #, gcc-internal-format
  msgid "Duplicate symbol %qs in formal argument list at %C"
  msgstr ""
  
! #: fortran/decl.c:4703
  #, gcc-internal-format, gfc-internal-format
  msgid "RESULT variable at %C must be different than function name"
  msgstr ""
  
! #: fortran/decl.c:4780
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected junk after function declaration at %C"
  msgstr ""
  
! #: fortran/decl.c:4790 fortran/decl.c:5856
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) attribute at %L may not be specified for an internal procedure"
  msgstr ""
  
! #: fortran/decl.c:4992
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) attribute at %C requires an interface with BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:4999
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) procedure with NAME may not have POINTER attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:5005
  #, gcc-internal-format, gfc-internal-format
  msgid "Dummy procedure at %C may not have BIND(C) attribute with NAME"
  msgstr ""
  
! #: fortran/decl.c:5028
  #, gcc-internal-format
  msgid "Procedure %qs at %L already has basic type of %s"
  msgstr ""
  
! #: fortran/decl.c:5074 fortran/decl.c:5262 fortran/decl.c:8440
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in PROCEDURE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:5123 fortran/decl.c:8342
  #, gcc-internal-format
  msgid "Expected %<::%> after binding-attributes at %C"
  msgstr ""
  
! #: fortran/decl.c:5130
  #, gcc-internal-format, gfc-internal-format
  msgid "NOPASS or explicit interface required at %C"
  msgstr ""
  
! #: fortran/decl.c:5134
  #, gcc-internal-format, gfc-internal-format
  msgid "Procedure pointer component at %C"
  msgstr ""
  
! #: fortran/decl.c:5206
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in procedure pointer component at %C"
  msgstr ""
  
! #: fortran/decl.c:5224
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE at %C must be in a generic interface"
  msgstr ""
  
! #: fortran/decl.c:5233 fortran/decl.c:7471
  #, gcc-internal-format, gfc-internal-format
  msgid "double colon in MODULE PROCEDURE statement at %L"
  msgstr ""
  
! #: fortran/decl.c:5302
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:5369
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected formal argument list in function definition at %C"
  msgstr ""
  
! #: fortran/decl.c:5393 fortran/decl.c:5397 fortran/decl.c:5631
! #: fortran/decl.c:5635 fortran/decl.c:5824 fortran/decl.c:5828
  #: fortran/symbol.c:1617
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) attribute at %L can only be used for variables or common blocks"
  msgstr ""
  
! #: fortran/decl.c:5543
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C"
  msgstr ""
  
! #: fortran/decl.c:5552
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a PROGRAM"
  msgstr ""
  
! #: fortran/decl.c:5555
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a MODULE"
  msgstr ""
  
! #: fortran/decl.c:5558
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a BLOCK DATA"
  msgstr ""
  
! #: fortran/decl.c:5562
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within an INTERFACE"
  msgstr ""
  
! #: fortran/decl.c:5566
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a DERIVED TYPE block"
  msgstr ""
  
! #: fortran/decl.c:5570
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within an IF-THEN block"
  msgstr ""
  
! #: fortran/decl.c:5575
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a DO block"
  msgstr ""
  
! #: fortran/decl.c:5579
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a SELECT block"
  msgstr ""
  
! #: fortran/decl.c:5583
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a FORALL block"
  msgstr ""
  
! #: fortran/decl.c:5587
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a WHERE block"
  msgstr ""
  
! #: fortran/decl.c:5591
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a contained subprogram"
  msgstr ""
  
! #: fortran/decl.c:5595
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected ENTRY statement at %C"
  msgstr ""
  
! #: fortran/decl.c:5609
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear in a contained procedure"
  msgstr ""
  
! #: fortran/decl.c:5660 fortran/decl.c:5863
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing required parentheses before BIND(C) at %C"
  msgstr ""
  
! #: fortran/decl.c:5920 fortran/decl.c:5927
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid C identifier in NAME= specifier at %C"
  msgstr ""
  
! #: fortran/decl.c:5967
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in NAME= specifier for binding label at %C"
  msgstr ""
  
! #: fortran/decl.c:5983
  #, gcc-internal-format, gfc-internal-format
  msgid "NAME= specifier at %C should be a constant expression"
  msgstr ""
  
! #: fortran/decl.c:5991
  #, gcc-internal-format, gfc-internal-format
  msgid "NAME= specifier at %C should be a scalar of default character kind"
  msgstr ""
  
! #: fortran/decl.c:6010
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing closing paren for binding label at %C"
  msgstr ""
  
! #: fortran/decl.c:6016
  #, gcc-internal-format, gfc-internal-format
  msgid "No binding name is allowed in BIND(C) at %C"
  msgstr ""
  
! #: fortran/decl.c:6022
  #, gcc-internal-format, gfc-internal-format
  msgid "For dummy procedure %s, no binding name is allowed in BIND(C) at %C"
  msgstr ""
  
! #: fortran/decl.c:6051
  #, gcc-internal-format, gfc-internal-format
  msgid "NAME not allowed on BIND(C) for ABSTRACT INTERFACE at %C"
  msgstr ""
  
! #: fortran/decl.c:6258
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected END statement at %C"
  msgstr ""
  
! #: fortran/decl.c:6267
  #, gcc-internal-format, gfc-internal-format
  msgid "END statement instead of %s statement at %L"
  msgstr ""
  
  #. We would have required END [something].
! #: fortran/decl.c:6275
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement expected at %L"
  msgstr ""
  
! #: fortran/decl.c:6286
  #, gcc-internal-format, gfc-internal-format
  msgid "Expecting %s statement at %L"
  msgstr ""
  
! #: fortran/decl.c:6304
  #, gcc-internal-format
  msgid "Expected block name of %qs in %s statement at %L"
  msgstr ""
  
! #: fortran/decl.c:6321
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected terminating name at %C"
  msgstr ""
  
! #: fortran/decl.c:6330 fortran/decl.c:6338
  #, gcc-internal-format
  msgid "Expected label %qs for %s statement at %C"
  msgstr ""
  
! #: fortran/decl.c:6435
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing array specification at %L in DIMENSION statement"
  msgstr ""
  
! #: fortran/decl.c:6443
  #, gcc-internal-format, gfc-internal-format
  msgid "Dimensions specified for %s at %L after its initialisation"
  msgstr ""
  
! #: fortran/decl.c:6451
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing array specification at %L in CODIMENSION statement"
  msgstr ""
  
! #: fortran/decl.c:6460
  #, gcc-internal-format, gfc-internal-format
  msgid "Array specification must be deferred at %L"
  msgstr ""
  
! #: fortran/decl.c:6558
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected character in variable list at %C"
  msgstr ""
  
! #: fortran/decl.c:6595
  #, gcc-internal-format
  msgid "Expected %<(%> at %C"
  msgstr ""
  
! #: fortran/decl.c:6609 fortran/decl.c:6649
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected variable name at %C"
  msgstr ""
  
! #: fortran/decl.c:6625
  #, gcc-internal-format, gfc-internal-format
  msgid "Cray pointer at %C must be an integer"
  msgstr ""
  
! #: fortran/decl.c:6629
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Cray pointer at %C has %d bytes of precision; memory addresses require %d "
  "bytes"
  msgstr ""
  
! #: fortran/decl.c:6635
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected \",\" at %C"
  msgstr ""
  
! #: fortran/decl.c:6674
  #, gcc-internal-format
  msgid "Couldn't set Cray pointee array spec."
  msgstr ""
  
! #: fortran/decl.c:6698
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected \")\" at %C"
  msgstr ""
  
! #: fortran/decl.c:6710
  #, gcc-internal-format
  msgid "Expected %<,%> or end of statement at %C"
  msgstr ""
  
! #: fortran/decl.c:6736
  #, gcc-internal-format, gfc-internal-format
  msgid "INTENT is not allowed inside of BLOCK at %C"
  msgstr ""
  
! #: fortran/decl.c:6768
  #, gcc-internal-format, gfc-internal-format
  msgid "OPTIONAL is not allowed inside of BLOCK at %C"
  msgstr ""
  
! #: fortran/decl.c:6787
  #, gcc-internal-format, gfc-internal-format
  msgid "Cray pointer declaration at %C requires -fcray-pointer flag"
  msgstr ""
  
! #: fortran/decl.c:6826
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTIGUOUS statement at %C"
  msgstr ""
  
! #: fortran/decl.c:6924
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Access specification of the %s operator at %C has already been specified"
  msgstr ""
  
! #: fortran/decl.c:6941
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Access specification of the .%s. operator at %C has already been specified"
  msgstr ""
  
! #: fortran/decl.c:6980
  #, gcc-internal-format, gfc-internal-format
  msgid "PROTECTED statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7018
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in PROTECTED statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7042
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "PRIVATE statement at %C is only allowed in the specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:7079
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "PUBLIC statement at %C is only allowed in the specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:7107
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected variable name at %C in PARAMETER statement"
  msgstr ""
  
! #: fortran/decl.c:7114
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected = sign in PARAMETER statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7120
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected expression at %C in PARAMETER statement"
  msgstr ""
  
! #: fortran/decl.c:7140
  #, gcc-internal-format, gfc-internal-format
  msgid "Initializing already initialized variable at %C"
  msgstr ""
  
! #: fortran/decl.c:7175
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected characters in PARAMETER statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7199
  #, gcc-internal-format, gfc-internal-format
  msgid "Blanket SAVE statement at %C follows previous SAVE statement"
  msgstr ""
  
! #: fortran/decl.c:7210
  #, gcc-internal-format, gfc-internal-format
  msgid "SAVE statement at %C follows blanket SAVE statement"
  msgstr ""
  
! #: fortran/decl.c:7256
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in SAVE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7270
  #, gcc-internal-format, gfc-internal-format
  msgid "VALUE is not allowed inside of BLOCK at %C"
  msgstr ""
  
! #: fortran/decl.c:7274
  #, gcc-internal-format, gfc-internal-format
  msgid "VALUE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7312
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in VALUE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7323
  #, gcc-internal-format, gfc-internal-format
  msgid "VOLATILE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7346
  #, gcc-internal-format
  msgid ""
  "Specifying VOLATILE for coarray variable %qs at %C, which is use-/host-"
  "associated"
  msgstr ""
  
! #: fortran/decl.c:7371
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in VOLATILE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7382
  #, gcc-internal-format, gfc-internal-format
  msgid "ASYNCHRONOUS statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7422
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in ASYNCHRONOUS statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7446
  #, gcc-internal-format, gfc-internal-format
  msgid "MODULE PROCEDURE at %C must be in a generic module interface"
  msgstr ""
  
! #: fortran/decl.c:7504
  #, gcc-internal-format, gfc-internal-format
  msgid "Intrinsic procedure at %L cannot be a MODULE PROCEDURE"
  msgstr ""
  
! #: fortran/decl.c:7553
  #, gcc-internal-format, gfc-internal-format
  msgid "Ambiguous symbol in TYPE definition at %C"
  msgstr ""
  
! #: fortran/decl.c:7562
  #, gcc-internal-format
  msgid "Symbol %qs at %C has not been previously defined"
  msgstr ""
  
! #: fortran/decl.c:7568
  #, gcc-internal-format
  msgid "%qs in EXTENDS expression at %C is not a derived type"
  msgstr ""
  
! #: fortran/decl.c:7575
  #, gcc-internal-format
  msgid "%qs cannot be extended at %C because it is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:7582
  #, gcc-internal-format
  msgid "%qs cannot be extended at %C because it is a SEQUENCE type"
  msgstr ""
  
! #: fortran/decl.c:7605
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Derived type at %C can only be PRIVATE in the specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:7617
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Derived type at %C can only be PUBLIC in the specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:7638
  #, gcc-internal-format, gfc-internal-format
  msgid "ABSTRACT type at %C"
  msgstr ""
  
! #: fortran/decl.c:7702
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected :: in TYPE definition at %C"
  msgstr ""
  
! #: fortran/decl.c:7713
  #, gcc-internal-format
  msgid "Type name %qs at %C cannot be the same as an intrinsic type"
  msgstr ""
  
! #: fortran/decl.c:7723
  #, gcc-internal-format
  msgid "Derived type name %qs at %C already has a basic type of %s"
  msgstr ""
  
! #: fortran/decl.c:7740
  #, gcc-internal-format
  msgid "Derived type definition of %qs at %C has already been defined"
  msgstr ""
  
! #: fortran/decl.c:7845
  #, gcc-internal-format, gfc-internal-format
  msgid "Cray Pointee at %C cannot be assumed shape array"
  msgstr ""
  
! #: fortran/decl.c:7865
  #, gcc-internal-format, gfc-internal-format
  msgid "ENUM and ENUMERATOR at %C"
  msgstr ""
  
! #: fortran/decl.c:7897
  #, gcc-internal-format, gfc-internal-format
  msgid "Enumerator exceeds the C integer type at %C"
  msgstr ""
  
! #: fortran/decl.c:7976
  #, gcc-internal-format, gfc-internal-format
  msgid "ENUMERATOR %L not initialized with integer expression"
  msgstr ""
  
! #: fortran/decl.c:8024
  #, gcc-internal-format, gfc-internal-format
  msgid "ENUM definition statement expected before %C"
  msgstr ""
  
! #: fortran/decl.c:8060
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in ENUMERATOR definition at %C"
  msgstr ""
  
! #: fortran/decl.c:8107 fortran/decl.c:8122
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate access-specifier at %C"
  msgstr ""
  
! #: fortran/decl.c:8142
  #, gcc-internal-format, gfc-internal-format
  msgid "Binding attributes already specify passing, illegal NOPASS at %C"
  msgstr ""
  
! #: fortran/decl.c:8162
  #, gcc-internal-format, gfc-internal-format
  msgid "Binding attributes already specify passing, illegal PASS at %C"
  msgstr ""
  
! #: fortran/decl.c:8189
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate POINTER attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:8207
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate NON_OVERRIDABLE at %C"
  msgstr ""
  
! #: fortran/decl.c:8223
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate DEFERRED at %C"
  msgstr ""
  
! #: fortran/decl.c:8236
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected access-specifier at %C"
  msgstr ""
  
! #: fortran/decl.c:8238
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected binding attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:8246
  #, gcc-internal-format, gfc-internal-format
  msgid "NON_OVERRIDABLE and DEFERRED can't both appear at %C"
  msgstr ""
  
! #: fortran/decl.c:8258
  #, gcc-internal-format, gfc-internal-format
  msgid "POINTER attribute is required for procedure pointer component at %C"
  msgstr ""
  
! #: fortran/decl.c:8300
  #, gcc-internal-format
  msgid "Interface-name expected after %<(%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8306
  #, gcc-internal-format
  msgid "%<)%> expected at %C"
  msgstr ""
  
! #: fortran/decl.c:8326
  #, gcc-internal-format, gfc-internal-format
  msgid "Interface must be specified for DEFERRED binding at %C"
  msgstr ""
  
! #: fortran/decl.c:8331
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE(interface) at %C should be declared DEFERRED"
  msgstr ""
  
! #: fortran/decl.c:8354
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected binding name at %C"
  msgstr ""
  
! #: fortran/decl.c:8358
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE list at %C"
  msgstr ""
  
! #: fortran/decl.c:8370
  #, gcc-internal-format
  msgid "%<=> target%> is invalid for DEFERRED binding at %C"
  msgstr ""
  
! #: fortran/decl.c:8376
  #, gcc-internal-format
  msgid "%<::%> needed in PROCEDURE binding with explicit target at %C"
  msgstr ""
  
! #: fortran/decl.c:8386
  #, gcc-internal-format
  msgid "Expected binding target after %<=>%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8403
  #, gcc-internal-format
  msgid "Type %qs containing DEFERRED binding at %C is not ABSTRACT"
  msgstr ""
  
! #: fortran/decl.c:8414
  #, gcc-internal-format
  msgid ""
  "There is already a procedure with binding name %qs for the derived type %qs "
  "at %C"
  msgstr ""
  
! #: fortran/decl.c:8463
  #, gcc-internal-format, gfc-internal-format
  msgid "GENERIC at %C must be inside a derived-type CONTAINS"
  msgstr ""
  
! #: fortran/decl.c:8483
  #, gcc-internal-format
  msgid "Expected %<::%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8495
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected generic name or operator descriptor at %C"
  msgstr ""
  
! #: fortran/decl.c:8515
  #, gcc-internal-format, gfc-internal-format
  msgid "Malformed GENERIC statement at %C"
  msgstr ""
  
! #: fortran/decl.c:8526
  #, gcc-internal-format
  msgid "Expected %<=>%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8568
  #, gcc-internal-format
  msgid ""
  "There's already a non-generic procedure with binding name %qs for the "
  "derived type %qs at %C"
  msgstr ""
  
! #: fortran/decl.c:8576
  #, gcc-internal-format
  msgid "Binding at %C must have the same access as already defined binding %qs"
  msgstr ""
  
! #: fortran/decl.c:8625
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected specific binding name at %C"
  msgstr ""
  
! #: fortran/decl.c:8635
  #, gcc-internal-format
  msgid "%qs already defined as specific binding for the generic %qs at %C"
  msgstr ""
  
! #: fortran/decl.c:8653
  #, gcc-internal-format, gfc-internal-format
  msgid "Junk after GENERIC binding at %C"
  msgstr ""
  
! #: fortran/decl.c:8688
  #, gcc-internal-format, gfc-internal-format
  msgid "FINAL declaration at %C must be inside a derived type CONTAINS section"
  msgstr ""
  
! #: fortran/decl.c:8699
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Derived type declaration with FINAL at %C must be in the specification part "
  "of a MODULE"
  msgstr ""
  
! #: fortran/decl.c:8721
  #, gcc-internal-format, gfc-internal-format
  msgid "Empty FINAL at %C"
  msgstr ""
  
! #: fortran/decl.c:8728
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected module procedure name at %C"
  msgstr ""
  
! #: fortran/decl.c:8738
  #, gcc-internal-format
  msgid "Expected %<,%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8744
  #, gcc-internal-format
  msgid "Unknown procedure name %qs at %C"
  msgstr ""
  
! #: fortran/decl.c:8757
  #, gcc-internal-format
  msgid "%qs at %C is already defined as FINAL procedure!"
  msgstr ""
  
! #: fortran/decl.c:8827
  #, gcc-internal-format, gfc-internal-format
  msgid "Unknown attribute in !GCC$ ATTRIBUTES statement at %C"
  msgstr ""
  
! #: fortran/decl.c:8873
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in !GCC$ ATTRIBUTES statement at %C"
  msgstr ""
  
! #: fortran/dependency.c:192
  #, gcc-internal-format
  msgid "are_identical_variables: Bad type"
  msgstr ""
--- 45412,46837 ----
  msgid "Symbol %qs must be a PARAMETER in DATA statement at %C"
  msgstr ""
  
! #: fortran/decl.c:431
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid initializer %s in Data statement at %C"
  msgstr ""
  
! #: fortran/decl.c:533
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization at %C is not allowed in a PURE procedure"
  msgstr ""
  
! #: fortran/decl.c:570
! #, gcc-internal-format, gfc-internal-format
! msgid "DATA statement at %C cannot appear within an INTERFACE"
! msgstr ""
! 
! #: fortran/decl.c:602
  #, gcc-internal-format, gfc-internal-format
  msgid "DATA statement at %C is not allowed in a PURE procedure"
  msgstr ""
  
! #: fortran/decl.c:629
  #, gcc-internal-format, gfc-internal-format
  msgid "The assumed-rank array at %C shall not have a codimension"
  msgstr ""
  
! #: fortran/decl.c:697
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad INTENT specification at %C"
  msgstr ""
  
! #: fortran/decl.c:718
  #, gcc-internal-format, gfc-internal-format
  msgid "deferred type parameter at %C"
  msgstr ""
  
! #: fortran/decl.c:801
  #, gcc-internal-format, gfc-internal-format
! msgid "Scalar INTEGER expression expected at %L"
  msgstr ""
  
! #: fortran/decl.c:827
  #, gcc-internal-format, gfc-internal-format
  msgid "Old-style character length at %C"
  msgstr ""
  
! #: fortran/decl.c:858
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in character length specification at %C"
  msgstr ""
  
! #: fortran/decl.c:981
  #, gcc-internal-format, gfc-internal-format
  msgid "Procedure '%s' at %C is already defined at %L"
  msgstr ""
  
! #: fortran/decl.c:989
  #, gcc-internal-format, gfc-internal-format
  msgid "Name '%s' at %C is already defined as a generic interface at %L"
  msgstr ""
  
! #: fortran/decl.c:1002
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Procedure '%s' at %C has an explicit interface and must not have attributes "
  "declared at %L"
  msgstr ""
  
! #: fortran/decl.c:1073
  #, gcc-internal-format
  msgid ""
  "Procedure %qs at %L must have the BIND(C) attribute to be C interoperable"
  msgstr ""
  
! #: fortran/decl.c:1100
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is a dummy argument to the BIND(C) procedure %qs but is "
  "not C interoperable because derived type %qs is not C interoperable"
  msgstr ""
  
! #: fortran/decl.c:1107
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is a dummy argument to the BIND(C) procedure %qs but is "
  "not C interoperable because it is polymorphic"
  msgstr ""
  
! #: fortran/decl.c:1114
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is a dummy argument of the BIND(C) procedure %qs but may "
  "not be C interoperable"
  msgstr ""
  
! #: fortran/decl.c:1129
  #, gcc-internal-format
  msgid ""
  "Character argument %qs at %L must be length 1 because procedure %qs is "
  "BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1142
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L with ALLOCATABLE attribute in procedure %qs with BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1150
  #, gcc-internal-format
  msgid "Variable %qs at %L with POINTER attribute in procedure %qs with BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1159
  #, gcc-internal-format
  msgid ""
  "Scalar variable %qs at %L with POINTER or ALLOCATABLE in procedure %qs with "
  "BIND(C) is not yet supported"
  msgstr ""
  
! #: fortran/decl.c:1168
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L cannot have both the OPTIONAL and the VALUE attribute "
  "because procedure %qs is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1175
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L with OPTIONAL attribute in procedure %qs which is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1186
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-shape array '%s' at %L as dummy argument to the BIND(C) procedure "
  "'%s' at %L"
  msgstr ""
  
! #: fortran/decl.c:1235
! #, gcc-internal-format
! msgid "Symbol %qs at %C also declared as a type"
! msgstr ""
! 
! #: fortran/decl.c:1293
  #, gcc-internal-format
  msgid ""
  "Variable %qs in common block %qs at %C must be declared with a C "
  "interoperable kind since common block %qs is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:1327
! #, gcc-internal-format, gfc-internal-format
! msgid "CHARACTER length must be a constant at %L"
! msgstr ""
! 
! #: fortran/decl.c:1342
  #, gcc-internal-format, gfc-internal-format
  msgid "CHARACTER expression at %L is being truncated (%d/%d)"
  msgstr ""
  
! #: fortran/decl.c:1349
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The CHARACTER elements of the array constructor at %L must have the same "
  "length (%d/%d)"
  msgstr ""
  
! #: fortran/decl.c:1439
  #, gcc-internal-format
  msgid "Initializer not allowed for PARAMETER %qs at %C"
  msgstr ""
  
! #: fortran/decl.c:1449
  #, gcc-internal-format, gfc-internal-format
  msgid "PARAMETER at %L is missing an initializer"
  msgstr ""
  
! #: fortran/decl.c:1459
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %C with an initializer already appears in a DATA statement"
  msgstr ""
  
! #: fortran/decl.c:1552
  #, gcc-internal-format, gfc-internal-format
  msgid "Can't initialize implied-shape array at %L with scalar"
  msgstr ""
  
! #: fortran/decl.c:1587
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-constant lower bound in implied-shape declaration at %L"
  msgstr ""
  
! #: fortran/decl.c:1672
  #, gcc-internal-format, gfc-internal-format
  msgid "Component at %C must have the POINTER attribute"
  msgstr ""
  
! #: fortran/decl.c:1680
  #, gcc-internal-format, gfc-internal-format
  msgid "Array component of structure at %C must have explicit or deferred shape"
  msgstr ""
  
! #: fortran/decl.c:1763
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer array component of structure at %C must have a deferred shape"
  msgstr ""
  
! #: fortran/decl.c:1772
  #, gcc-internal-format, gfc-internal-format
  msgid "Allocatable component of structure at %C must have a deferred shape"
  msgstr ""
  
! #: fortran/decl.c:1781
  #, gcc-internal-format, gfc-internal-format
  msgid "Array component of structure at %C must have an explicit shape"
  msgstr ""
  
! #: fortran/decl.c:1835
  #, gcc-internal-format, gfc-internal-format
  msgid "NULL() initialization at %C is ambiguous"
  msgstr ""
  
! #: fortran/decl.c:1852
  #, gcc-internal-format, gfc-internal-format
  msgid "NULL() initialization at %C may not have MOLD"
  msgstr ""
  
! #: fortran/decl.c:1869
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization of pointer at %C is not allowed in a PURE procedure"
  msgstr ""
  
! #: fortran/decl.c:1890
  #, gcc-internal-format, gfc-internal-format
  msgid "Error in pointer initialization at %C"
  msgstr ""
  
! #: fortran/decl.c:1897
  #, gcc-internal-format, gfc-internal-format
  msgid "non-NULL pointer initialization at %C"
  msgstr ""
  
! #: fortran/decl.c:1920
  #, gcc-internal-format
  msgid "Function name %qs not allowed at %C"
  msgstr ""
  
! #: fortran/decl.c:1987
  #, gcc-internal-format
  msgid "Non-PARAMETER symbol %qs at %L can't be implied-shape"
  msgstr ""
  
! #: fortran/decl.c:1997
  #, gcc-internal-format, gfc-internal-format
  msgid "Implied-shape array at %L"
  msgstr ""
  
! #: fortran/decl.c:2062 fortran/decl.c:6811
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate array spec for Cray pointee at %C"
  msgstr ""
  
! #: fortran/decl.c:2070
  #, gcc-internal-format
  msgid "Couldn't set pointee array spec."
  msgstr ""
  
! #: fortran/decl.c:2133
  #, gcc-internal-format, gfc-internal-format
  msgid "Old-style initialization at %C"
  msgstr ""
  
! #: fortran/decl.c:2138
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid old style initialization for derived type component at %C"
  msgstr ""
  
! #: fortran/decl.c:2155 fortran/decl.c:5172
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization at %C isn't for a pointer variable"
  msgstr ""
  
! #: fortran/decl.c:2168
  #, gcc-internal-format
  msgid "Pointer initialization at %C requires %<=>%>, not %<=%>"
  msgstr ""
  
! #: fortran/decl.c:2177 fortran/decl.c:8092
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected an initialization expression at %C"
  msgstr ""
  
! #: fortran/decl.c:2184
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization of variable at %C is not allowed in a PURE procedure"
  msgstr ""
  
! #: fortran/decl.c:2201
  #, gcc-internal-format, gfc-internal-format
  msgid "Initialization of allocatable component at %C is not allowed"
  msgstr ""
  
! #: fortran/decl.c:2255 fortran/decl.c:2291
  #, gcc-internal-format, gfc-internal-format
  msgid "Old-style type declaration %s*%d not supported at %C"
  msgstr ""
  
! #: fortran/decl.c:2297
  #, gcc-internal-format, gfc-internal-format
  msgid "Nonstandard type declaration %s*%d at %C"
  msgstr ""
  
! #: fortran/decl.c:2348 fortran/decl.c:2424
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing right parenthesis at %C"
  msgstr ""
  
! #: fortran/decl.c:2361 fortran/decl.c:2495
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected initialization expression at %C"
  msgstr ""
  
! #: fortran/decl.c:2369 fortran/decl.c:2501
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected scalar initialization expression at %C"
  msgstr ""
  
! #: fortran/decl.c:2400
  #, gcc-internal-format, gfc-internal-format
  msgid "Kind %d not supported for type %s at %C"
  msgstr ""
  
! #: fortran/decl.c:2413
  #, gcc-internal-format, gfc-internal-format
  msgid "C kind type parameter is for type %s but type at %L is %s"
  msgstr ""
  
! #: fortran/decl.c:2422
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing right parenthesis or comma at %C"
  msgstr ""
  
! #: fortran/decl.c:2521
  #, gcc-internal-format, gfc-internal-format
  msgid "Kind %d is not supported for CHARACTER at %C"
  msgstr ""
  
! #: fortran/decl.c:2653
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in CHARACTER declaration at %C"
  msgstr ""
  
! #: fortran/decl.c:2738
  #, gcc-internal-format, gfc-internal-format
  msgid "BYTE type at %C"
  msgstr ""
  
! #: fortran/decl.c:2743
  #, gcc-internal-format, gfc-internal-format
  msgid "BYTE type used at %C is not available on the target machine"
  msgstr ""
  
! #: fortran/decl.c:2765
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed type at %C is not allowed for components"
  msgstr ""
  
! #: fortran/decl.c:2768
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed type at %C"
  msgstr ""
  
! #: fortran/decl.c:2791 fortran/decl.c:2822 fortran/decl.c:2851
! #: fortran/decl.c:3030
  #, gcc-internal-format, gfc-internal-format
  msgid "TYPE with intrinsic-type-spec at %C"
  msgstr ""
  
! #: fortran/decl.c:2847
  #, gcc-internal-format, gfc-internal-format
  msgid "DOUBLE COMPLEX at %C"
  msgstr ""
  
! #: fortran/decl.c:2921
  #, gcc-internal-format, gfc-internal-format
  msgid "CLASS statement at %C"
  msgstr ""
  
! #: fortran/decl.c:2956 fortran/decl.c:2969 fortran/decl.c:3418
! #: fortran/decl.c:3426
  #, gcc-internal-format
  msgid "Type name %qs at %C is ambiguous"
  msgstr ""
  
! #: fortran/decl.c:2984
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Type name '%s' at %C conflicts with previously declared entity at %L, which "
  "has the same name"
  msgstr ""
  
! #: fortran/decl.c:3101
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate IMPLICIT NONE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:3110
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPORT NONE with spec list at %C"
  msgstr ""
  
! #: fortran/decl.c:3169
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing character range in IMPLICIT at %C"
  msgstr ""
  
! #: fortran/decl.c:3215
  #, gcc-internal-format, gfc-internal-format
  msgid "Letters must be in alphabetic order in IMPLICIT statement at %C"
  msgstr ""
  
! #: fortran/decl.c:3268
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPLICIT statement at %C following an IMPLICIT NONE (type) statement"
  msgstr ""
  
! #: fortran/decl.c:3278
  #, gcc-internal-format, gfc-internal-format
  msgid "Empty IMPLICIT statement at %C"
  msgstr ""
  
! #: fortran/decl.c:3384
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPORT statement at %C only permitted in an INTERFACE body"
  msgstr ""
  
! #: fortran/decl.c:3389
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPORT statement at %C"
  msgstr ""
  
! #: fortran/decl.c:3403
  #, gcc-internal-format, gfc-internal-format
  msgid "Expecting list of named entities at %C"
  msgstr ""
  
! #: fortran/decl.c:3432
  #, gcc-internal-format
  msgid "Cannot IMPORT %qs from host scoping unit at %C - does not exist."
  msgstr ""
  
! #: fortran/decl.c:3439
  #, gcc-internal-format
  msgid "%qs is already IMPORTed from host scoping unit at %C"
  msgstr ""
  
! #: fortran/decl.c:3482
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in IMPORT statement at %C"
  msgstr ""
  
! #: fortran/decl.c:3781
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing codimension specification at %C"
  msgstr ""
  
! #: fortran/decl.c:3783
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing dimension specification at %C"
  msgstr ""
  
! #: fortran/decl.c:3866
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate %s attribute at %L"
  msgstr ""
  
! #: fortran/decl.c:3885
  #, gcc-internal-format, gfc-internal-format
  msgid "ALLOCATABLE attribute at %C in a TYPE definition"
  msgstr ""
  
! #: fortran/decl.c:3894
  #, gcc-internal-format, gfc-internal-format
  msgid "Attribute at %L is not allowed in a TYPE definition"
  msgstr ""
  
! #: fortran/decl.c:3912
  #, gcc-internal-format, gfc-internal-format
  msgid "Attribute %s at %L in a TYPE definition"
  msgstr ""
  
! #: fortran/decl.c:3922
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "%s attribute at %L is not allowed outside of the specification part of a "
  "module"
  msgstr ""
  
! #: fortran/decl.c:3936
  #, gcc-internal-format, gfc-internal-format
  msgid "ASYNCHRONOUS attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:3947
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTIGUOUS attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:3994 fortran/decl.c:7107
  #, gcc-internal-format, gfc-internal-format
  msgid "PROTECTED at %C only allowed in specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:4000
  #, gcc-internal-format, gfc-internal-format
  msgid "PROTECTED attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:4029
  #, gcc-internal-format, gfc-internal-format
  msgid "VALUE attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:4036
  #, gcc-internal-format, gfc-internal-format
  msgid "VOLATILE attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:4043
  #, gcc-internal-format
  msgid "match_attr_spec(): Bad attribute"
  msgstr ""
  
! #: fortran/decl.c:4081
  #, gcc-internal-format, gfc-internal-format
  msgid "Multiple identifiers provided with single NAME= specifier at %C"
  msgstr ""
  
! #: fortran/decl.c:4179
  #, gcc-internal-format
  msgid ""
  "Implicitly declared BIND(C) function %qs at %L may not be C interoperable"
  msgstr ""
  
! #: fortran/decl.c:4201
  #, gcc-internal-format
  msgid ""
  "Variable %qs in common block %qs at %L may not be a C interoperable kind "
  "though common block %qs is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:4210
  #, gcc-internal-format
  msgid "Type declaration %qs at %L is not C interoperable but it is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:4214
  #, gcc-internal-format
  msgid "Variable %qs at %L may not be a C interoperable kind but it is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:4226
  #, gcc-internal-format
  msgid ""
  "Variable %qs in common block %qs at %L cannot be declared with BIND(C) since "
  "it is not a global"
  msgstr ""
  
! #: fortran/decl.c:4240
  #, gcc-internal-format
  msgid "Variable %qs at %L cannot have both the POINTER and BIND(C) attributes"
  msgstr ""
  
! #: fortran/decl.c:4248
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L cannot have both the ALLOCATABLE and BIND(C) attributes"
  msgstr ""
  
! #: fortran/decl.c:4260
  #, gcc-internal-format
  msgid "Return type of BIND(C) function %qs at %L cannot be an array"
  msgstr ""
  
! #: fortran/decl.c:4268
  #, gcc-internal-format
  msgid "Return type of BIND(C) function %qs at %L cannot be a character string"
  msgstr ""
  
  #. Use gfc_warning_now because we won't say that the symbol fails
  #. just because of this.
! #: fortran/decl.c:4279
  #, gcc-internal-format
  msgid ""
  "Symbol %qs at %L is marked PRIVATE but has been given the binding label %qs"
  msgstr ""
  
! #: fortran/decl.c:4353
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Need either entity or common block name for attribute specification "
  "statement at %C"
  msgstr ""
  
! #: fortran/decl.c:4398
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Missing entity or common block name for attribute specification statement at "
  "%C"
  msgstr ""
  
! #: fortran/decl.c:4405
  #, gcc-internal-format
  msgid "Missing symbol"
  msgstr ""
  
! #: fortran/decl.c:4434
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) statement at %C"
  msgstr ""
  
! #: fortran/decl.c:4512
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Derived type at %C has not been previously defined and so cannot appear in a "
  "derived type definition"
  msgstr ""
  
! #: fortran/decl.c:4544
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in data declaration at %C"
  msgstr ""
  
! #: fortran/decl.c:4617
  #, gcc-internal-format, gfc-internal-format
  msgid "IMPURE procedure at %C"
  msgstr ""
  
! #: fortran/decl.c:4629
  #, gcc-internal-format, gfc-internal-format
  msgid "PURE and IMPURE must not appear both at %C"
  msgstr ""
  
! #: fortran/decl.c:4697 fortran/primary.c:1722
  #, gcc-internal-format, gfc-internal-format
  msgid "Alternate-return argument at %C"
  msgstr ""
  
! #: fortran/decl.c:4743
  #, gcc-internal-format
  msgid "Name %qs at %C is the name of the procedure"
  msgstr ""
  
! #: fortran/decl.c:4755
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected junk in formal argument list at %C"
  msgstr ""
  
! #: fortran/decl.c:4772
  #, gcc-internal-format
  msgid "Duplicate symbol %qs in formal argument list at %C"
  msgstr ""
  
! #: fortran/decl.c:4822
  #, gcc-internal-format, gfc-internal-format
  msgid "RESULT variable at %C must be different than function name"
  msgstr ""
  
! #: fortran/decl.c:4899
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected junk after function declaration at %C"
  msgstr ""
  
! #: fortran/decl.c:4909 fortran/decl.c:5982
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) attribute at %L may not be specified for an internal procedure"
  msgstr ""
  
! #: fortran/decl.c:5111
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) attribute at %C requires an interface with BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:5118
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) procedure with NAME may not have POINTER attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:5124
  #, gcc-internal-format, gfc-internal-format
  msgid "Dummy procedure at %C may not have BIND(C) attribute with NAME"
  msgstr ""
  
! #: fortran/decl.c:5147
  #, gcc-internal-format
  msgid "Procedure %qs at %L already has basic type of %s"
  msgstr ""
  
! #: fortran/decl.c:5193 fortran/decl.c:5381 fortran/decl.c:8573
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in PROCEDURE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:5242 fortran/decl.c:8475
  #, gcc-internal-format
  msgid "Expected %<::%> after binding-attributes at %C"
  msgstr ""
  
! #: fortran/decl.c:5249
  #, gcc-internal-format, gfc-internal-format
  msgid "NOPASS or explicit interface required at %C"
  msgstr ""
  
! #: fortran/decl.c:5253
  #, gcc-internal-format, gfc-internal-format
  msgid "Procedure pointer component at %C"
  msgstr ""
  
! #: fortran/decl.c:5325
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in procedure pointer component at %C"
  msgstr ""
  
! #: fortran/decl.c:5343
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE at %C must be in a generic interface"
  msgstr ""
  
! #: fortran/decl.c:5352 fortran/decl.c:7604
  #, gcc-internal-format, gfc-internal-format
  msgid "double colon in MODULE PROCEDURE statement at %L"
  msgstr ""
  
! #: fortran/decl.c:5421
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:5488
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected formal argument list in function definition at %C"
  msgstr ""
  
! #: fortran/decl.c:5512 fortran/decl.c:5516 fortran/decl.c:5757
! #: fortran/decl.c:5761 fortran/decl.c:5950 fortran/decl.c:5954
  #: fortran/symbol.c:1617
  #, gcc-internal-format, gfc-internal-format
  msgid "BIND(C) attribute at %L can only be used for variables or common blocks"
  msgstr ""
  
! #: fortran/decl.c:5662
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C"
  msgstr ""
  
! #: fortran/decl.c:5671
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a PROGRAM"
  msgstr ""
  
! #: fortran/decl.c:5674
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a MODULE"
  msgstr ""
  
! #: fortran/decl.c:5677
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a BLOCK DATA"
  msgstr ""
  
! #: fortran/decl.c:5681 fortran/decl.c:5722
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within an INTERFACE"
  msgstr ""
  
! #: fortran/decl.c:5685
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a DERIVED TYPE block"
  msgstr ""
  
! #: fortran/decl.c:5689
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within an IF-THEN block"
  msgstr ""
  
! #: fortran/decl.c:5694
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a DO block"
  msgstr ""
  
! #: fortran/decl.c:5698
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a SELECT block"
  msgstr ""
  
! #: fortran/decl.c:5702
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a FORALL block"
  msgstr ""
  
! #: fortran/decl.c:5706
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a WHERE block"
  msgstr ""
  
! #: fortran/decl.c:5710
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear within a contained subprogram"
  msgstr ""
  
! #: fortran/decl.c:5714
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected ENTRY statement at %C"
  msgstr ""
  
! #: fortran/decl.c:5735
  #, gcc-internal-format, gfc-internal-format
  msgid "ENTRY statement at %C cannot appear in a contained procedure"
  msgstr ""
  
! #: fortran/decl.c:5786 fortran/decl.c:5989
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing required parentheses before BIND(C) at %C"
  msgstr ""
  
! #: fortran/decl.c:6046 fortran/decl.c:6053
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid C identifier in NAME= specifier at %C"
  msgstr ""
  
! #: fortran/decl.c:6093
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in NAME= specifier for binding label at %C"
  msgstr ""
  
! #: fortran/decl.c:6109
  #, gcc-internal-format, gfc-internal-format
  msgid "NAME= specifier at %C should be a constant expression"
  msgstr ""
  
! #: fortran/decl.c:6117
  #, gcc-internal-format, gfc-internal-format
  msgid "NAME= specifier at %C should be a scalar of default character kind"
  msgstr ""
  
! #: fortran/decl.c:6136
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing closing paren for binding label at %C"
  msgstr ""
  
! #: fortran/decl.c:6142
  #, gcc-internal-format, gfc-internal-format
  msgid "No binding name is allowed in BIND(C) at %C"
  msgstr ""
  
! #: fortran/decl.c:6148
  #, gcc-internal-format, gfc-internal-format
  msgid "For dummy procedure %s, no binding name is allowed in BIND(C) at %C"
  msgstr ""
  
! #: fortran/decl.c:6177
  #, gcc-internal-format, gfc-internal-format
  msgid "NAME not allowed on BIND(C) for ABSTRACT INTERFACE at %C"
  msgstr ""
  
! #: fortran/decl.c:6384
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected END statement at %C"
  msgstr ""
  
! #: fortran/decl.c:6393
  #, gcc-internal-format, gfc-internal-format
  msgid "END statement instead of %s statement at %L"
  msgstr ""
  
  #. We would have required END [something].
! #: fortran/decl.c:6401
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement expected at %L"
  msgstr ""
  
! #: fortran/decl.c:6412
  #, gcc-internal-format, gfc-internal-format
  msgid "Expecting %s statement at %L"
  msgstr ""
  
! #: fortran/decl.c:6430
  #, gcc-internal-format
  msgid "Expected block name of %qs in %s statement at %L"
  msgstr ""
  
! #: fortran/decl.c:6447
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected terminating name at %C"
  msgstr ""
  
! #: fortran/decl.c:6456 fortran/decl.c:6464
  #, gcc-internal-format
  msgid "Expected label %qs for %s statement at %C"
  msgstr ""
  
! #: fortran/decl.c:6568
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing array specification at %L in DIMENSION statement"
  msgstr ""
  
! #: fortran/decl.c:6576
  #, gcc-internal-format, gfc-internal-format
  msgid "Dimensions specified for %s at %L after its initialisation"
  msgstr ""
  
! #: fortran/decl.c:6584
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing array specification at %L in CODIMENSION statement"
  msgstr ""
  
! #: fortran/decl.c:6593
  #, gcc-internal-format, gfc-internal-format
  msgid "Array specification must be deferred at %L"
  msgstr ""
  
! #: fortran/decl.c:6691
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected character in variable list at %C"
  msgstr ""
  
! #: fortran/decl.c:6728
  #, gcc-internal-format
  msgid "Expected %<(%> at %C"
  msgstr ""
  
! #: fortran/decl.c:6742 fortran/decl.c:6782
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected variable name at %C"
  msgstr ""
  
! #: fortran/decl.c:6758
  #, gcc-internal-format, gfc-internal-format
  msgid "Cray pointer at %C must be an integer"
  msgstr ""
  
! #: fortran/decl.c:6762
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Cray pointer at %C has %d bytes of precision; memory addresses require %d "
  "bytes"
  msgstr ""
  
! #: fortran/decl.c:6768
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected \",\" at %C"
  msgstr ""
  
! #: fortran/decl.c:6807
  #, gcc-internal-format
  msgid "Couldn't set Cray pointee array spec."
  msgstr ""
  
! #: fortran/decl.c:6831
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected \")\" at %C"
  msgstr ""
  
! #: fortran/decl.c:6843
  #, gcc-internal-format
  msgid "Expected %<,%> or end of statement at %C"
  msgstr ""
  
! #: fortran/decl.c:6869
  #, gcc-internal-format, gfc-internal-format
  msgid "INTENT is not allowed inside of BLOCK at %C"
  msgstr ""
  
! #: fortran/decl.c:6901
  #, gcc-internal-format, gfc-internal-format
  msgid "OPTIONAL is not allowed inside of BLOCK at %C"
  msgstr ""
  
! #: fortran/decl.c:6920
  #, gcc-internal-format, gfc-internal-format
  msgid "Cray pointer declaration at %C requires -fcray-pointer flag"
  msgstr ""
  
! #: fortran/decl.c:6959
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTIGUOUS statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7057
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Access specification of the %s operator at %C has already been specified"
  msgstr ""
  
! #: fortran/decl.c:7074
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Access specification of the .%s. operator at %C has already been specified"
  msgstr ""
  
! #: fortran/decl.c:7113
  #, gcc-internal-format, gfc-internal-format
  msgid "PROTECTED statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7151
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in PROTECTED statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7175
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "PRIVATE statement at %C is only allowed in the specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:7212
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "PUBLIC statement at %C is only allowed in the specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:7240
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected variable name at %C in PARAMETER statement"
  msgstr ""
  
! #: fortran/decl.c:7247
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected = sign in PARAMETER statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7253
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected expression at %C in PARAMETER statement"
  msgstr ""
  
! #: fortran/decl.c:7273
  #, gcc-internal-format, gfc-internal-format
  msgid "Initializing already initialized variable at %C"
  msgstr ""
  
! #: fortran/decl.c:7308
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected characters in PARAMETER statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7332
  #, gcc-internal-format, gfc-internal-format
  msgid "Blanket SAVE statement at %C follows previous SAVE statement"
  msgstr ""
  
! #: fortran/decl.c:7343
  #, gcc-internal-format, gfc-internal-format
  msgid "SAVE statement at %C follows blanket SAVE statement"
  msgstr ""
  
! #: fortran/decl.c:7389
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in SAVE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7403
  #, gcc-internal-format, gfc-internal-format
  msgid "VALUE is not allowed inside of BLOCK at %C"
  msgstr ""
  
! #: fortran/decl.c:7407
  #, gcc-internal-format, gfc-internal-format
  msgid "VALUE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7445
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in VALUE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7456
  #, gcc-internal-format, gfc-internal-format
  msgid "VOLATILE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7479
  #, gcc-internal-format
  msgid ""
  "Specifying VOLATILE for coarray variable %qs at %C, which is use-/host-"
  "associated"
  msgstr ""
  
! #: fortran/decl.c:7504
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in VOLATILE statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7515
  #, gcc-internal-format, gfc-internal-format
  msgid "ASYNCHRONOUS statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7555
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in ASYNCHRONOUS statement at %C"
  msgstr ""
  
! #: fortran/decl.c:7579
  #, gcc-internal-format, gfc-internal-format
  msgid "MODULE PROCEDURE at %C must be in a generic module interface"
  msgstr ""
  
! #: fortran/decl.c:7637
  #, gcc-internal-format, gfc-internal-format
  msgid "Intrinsic procedure at %L cannot be a MODULE PROCEDURE"
  msgstr ""
  
! #: fortran/decl.c:7686
  #, gcc-internal-format, gfc-internal-format
  msgid "Ambiguous symbol in TYPE definition at %C"
  msgstr ""
  
! #: fortran/decl.c:7695
  #, gcc-internal-format
  msgid "Symbol %qs at %C has not been previously defined"
  msgstr ""
  
! #: fortran/decl.c:7701
  #, gcc-internal-format
  msgid "%qs in EXTENDS expression at %C is not a derived type"
  msgstr ""
  
! #: fortran/decl.c:7708
  #, gcc-internal-format
  msgid "%qs cannot be extended at %C because it is BIND(C)"
  msgstr ""
  
! #: fortran/decl.c:7715
  #, gcc-internal-format
  msgid "%qs cannot be extended at %C because it is a SEQUENCE type"
  msgstr ""
  
! #: fortran/decl.c:7738
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Derived type at %C can only be PRIVATE in the specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:7750
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Derived type at %C can only be PUBLIC in the specification part of a module"
  msgstr ""
  
! #: fortran/decl.c:7771
  #, gcc-internal-format, gfc-internal-format
  msgid "ABSTRACT type at %C"
  msgstr ""
  
! #: fortran/decl.c:7835
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected :: in TYPE definition at %C"
  msgstr ""
  
! #: fortran/decl.c:7846
  #, gcc-internal-format
  msgid "Type name %qs at %C cannot be the same as an intrinsic type"
  msgstr ""
  
! #: fortran/decl.c:7856
  #, gcc-internal-format
  msgid "Derived type name %qs at %C already has a basic type of %s"
  msgstr ""
  
! #: fortran/decl.c:7873
  #, gcc-internal-format
  msgid "Derived type definition of %qs at %C has already been defined"
  msgstr ""
  
! #: fortran/decl.c:7978
  #, gcc-internal-format, gfc-internal-format
  msgid "Cray Pointee at %C cannot be assumed shape array"
  msgstr ""
  
! #: fortran/decl.c:7998
  #, gcc-internal-format, gfc-internal-format
  msgid "ENUM and ENUMERATOR at %C"
  msgstr ""
  
! #: fortran/decl.c:8030
  #, gcc-internal-format, gfc-internal-format
  msgid "Enumerator exceeds the C integer type at %C"
  msgstr ""
  
! #: fortran/decl.c:8109
  #, gcc-internal-format, gfc-internal-format
  msgid "ENUMERATOR %L not initialized with integer expression"
  msgstr ""
  
! #: fortran/decl.c:8157
  #, gcc-internal-format, gfc-internal-format
  msgid "ENUM definition statement expected before %C"
  msgstr ""
  
! #: fortran/decl.c:8193
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in ENUMERATOR definition at %C"
  msgstr ""
  
! #: fortran/decl.c:8240 fortran/decl.c:8255
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate access-specifier at %C"
  msgstr ""
  
! #: fortran/decl.c:8275
  #, gcc-internal-format, gfc-internal-format
  msgid "Binding attributes already specify passing, illegal NOPASS at %C"
  msgstr ""
  
! #: fortran/decl.c:8295
  #, gcc-internal-format, gfc-internal-format
  msgid "Binding attributes already specify passing, illegal PASS at %C"
  msgstr ""
  
! #: fortran/decl.c:8322
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate POINTER attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:8340
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate NON_OVERRIDABLE at %C"
  msgstr ""
  
! #: fortran/decl.c:8356
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate DEFERRED at %C"
  msgstr ""
  
! #: fortran/decl.c:8369
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected access-specifier at %C"
  msgstr ""
  
! #: fortran/decl.c:8371
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected binding attribute at %C"
  msgstr ""
  
! #: fortran/decl.c:8379
  #, gcc-internal-format, gfc-internal-format
  msgid "NON_OVERRIDABLE and DEFERRED can't both appear at %C"
  msgstr ""
  
! #: fortran/decl.c:8391
  #, gcc-internal-format, gfc-internal-format
  msgid "POINTER attribute is required for procedure pointer component at %C"
  msgstr ""
  
! #: fortran/decl.c:8433
  #, gcc-internal-format
  msgid "Interface-name expected after %<(%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8439
  #, gcc-internal-format
  msgid "%<)%> expected at %C"
  msgstr ""
  
! #: fortran/decl.c:8459
  #, gcc-internal-format, gfc-internal-format
  msgid "Interface must be specified for DEFERRED binding at %C"
  msgstr ""
  
! #: fortran/decl.c:8464
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE(interface) at %C should be declared DEFERRED"
  msgstr ""
  
! #: fortran/decl.c:8487
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected binding name at %C"
  msgstr ""
  
! #: fortran/decl.c:8491
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE list at %C"
  msgstr ""
  
! #: fortran/decl.c:8503
  #, gcc-internal-format
  msgid "%<=> target%> is invalid for DEFERRED binding at %C"
  msgstr ""
  
! #: fortran/decl.c:8509
  #, gcc-internal-format
  msgid "%<::%> needed in PROCEDURE binding with explicit target at %C"
  msgstr ""
  
! #: fortran/decl.c:8519
  #, gcc-internal-format
  msgid "Expected binding target after %<=>%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8536
  #, gcc-internal-format
  msgid "Type %qs containing DEFERRED binding at %C is not ABSTRACT"
  msgstr ""
  
! #: fortran/decl.c:8547
  #, gcc-internal-format
  msgid ""
  "There is already a procedure with binding name %qs for the derived type %qs "
  "at %C"
  msgstr ""
  
! #: fortran/decl.c:8596
  #, gcc-internal-format, gfc-internal-format
  msgid "GENERIC at %C must be inside a derived-type CONTAINS"
  msgstr ""
  
! #: fortran/decl.c:8616
  #, gcc-internal-format
  msgid "Expected %<::%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8628
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected generic name or operator descriptor at %C"
  msgstr ""
  
! #: fortran/decl.c:8648
  #, gcc-internal-format, gfc-internal-format
  msgid "Malformed GENERIC statement at %C"
  msgstr ""
  
! #: fortran/decl.c:8659
  #, gcc-internal-format
  msgid "Expected %<=>%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8701
  #, gcc-internal-format
  msgid ""
  "There's already a non-generic procedure with binding name %qs for the "
  "derived type %qs at %C"
  msgstr ""
  
! #: fortran/decl.c:8709
  #, gcc-internal-format
  msgid "Binding at %C must have the same access as already defined binding %qs"
  msgstr ""
  
! #: fortran/decl.c:8758
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected specific binding name at %C"
  msgstr ""
  
! #: fortran/decl.c:8768
  #, gcc-internal-format
  msgid "%qs already defined as specific binding for the generic %qs at %C"
  msgstr ""
  
! #: fortran/decl.c:8786
  #, gcc-internal-format, gfc-internal-format
  msgid "Junk after GENERIC binding at %C"
  msgstr ""
  
! #: fortran/decl.c:8821
  #, gcc-internal-format, gfc-internal-format
  msgid "FINAL declaration at %C must be inside a derived type CONTAINS section"
  msgstr ""
  
! #: fortran/decl.c:8832
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Derived type declaration with FINAL at %C must be in the specification part "
  "of a MODULE"
  msgstr ""
  
! #: fortran/decl.c:8854
  #, gcc-internal-format, gfc-internal-format
  msgid "Empty FINAL at %C"
  msgstr ""
  
! #: fortran/decl.c:8861
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected module procedure name at %C"
  msgstr ""
  
! #: fortran/decl.c:8871
  #, gcc-internal-format
  msgid "Expected %<,%> at %C"
  msgstr ""
  
! #: fortran/decl.c:8877
  #, gcc-internal-format
  msgid "Unknown procedure name %qs at %C"
  msgstr ""
  
! #: fortran/decl.c:8890
  #, gcc-internal-format
  msgid "%qs at %C is already defined as FINAL procedure!"
  msgstr ""
  
! #: fortran/decl.c:8960
  #, gcc-internal-format, gfc-internal-format
  msgid "Unknown attribute in !GCC$ ATTRIBUTES statement at %C"
  msgstr ""
  
! #: fortran/decl.c:9006
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in !GCC$ ATTRIBUTES statement at %C"
  msgstr ""
  
! #: fortran/dependency.c:106
! #, gcc-internal-format
! msgid "identical_array_ref(): inconsistent dimensions"
! msgstr ""
! 
! #: fortran/dependency.c:194
  #, gcc-internal-format
  msgid "are_identical_variables: Bad type"
  msgstr ""
*************** msgstr ""
*** 46601,46607 ****
  #. If a dependency is found in the case
  #. elemental == ELEM_CHECK_VARIABLE, we will generate
  #. a temporary, so we don't need to bother the user.
! #: fortran/dependency.c:959
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "INTENT(%s) actual argument at %L might interfere with actual argument at %L."
--- 46841,46847 ----
  #. If a dependency is found in the case
  #. elemental == ELEM_CHECK_VARIABLE, we will generate
  #. a temporary, so we don't need to bother the user.
! #: fortran/dependency.c:978
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "INTENT(%s) actual argument at %L might interfere with actual argument at %L."
*************** msgstr ""
*** 46632,46638 ****
  msgid "show_expr(): Don't know how to show expr"
  msgstr ""
  
! #: fortran/dump-parse-tree.c:2479
  #, gcc-internal-format
  msgid "show_code_node(): Bad statement code"
  msgstr ""
--- 46872,46878 ----
  msgid "show_expr(): Don't know how to show expr"
  msgstr ""
  
! #: fortran/dump-parse-tree.c:2506
  #, gcc-internal-format
  msgid "show_code_node(): Bad statement code"
  msgstr ""
*************** msgstr ""
*** 46761,47261 ****
  msgid "Evaluation of nonstandard initialization expression at %L"
  msgstr ""
  
! #: fortran/expr.c:2495
  #, gcc-internal-format
  msgid ""
  "Function %qs in initialization expression at %L must be an intrinsic function"
  msgstr ""
  
! #: fortran/expr.c:2507
  #, gcc-internal-format
  msgid ""
  "Intrinsic function %qs at %L is not permitted in an initialization expression"
  msgstr ""
  
! #: fortran/expr.c:2542
  #, gcc-internal-format
  msgid "PARAMETER %qs is used at %L before its definition is complete"
  msgstr ""
  
! #: fortran/expr.c:2562
  #, gcc-internal-format
  msgid ""
  "Assumed size array %qs at %L is not permitted in an initialization expression"
  msgstr ""
  
! #: fortran/expr.c:2568
  #, gcc-internal-format
  msgid ""
  "Assumed shape array %qs at %L is not permitted in an initialization "
  "expression"
  msgstr ""
  
! #: fortran/expr.c:2574
  #, gcc-internal-format
  msgid ""
  "Deferred array %qs at %L is not permitted in an initialization expression"
  msgstr ""
  
! #: fortran/expr.c:2580
  #, gcc-internal-format
  msgid ""
  "Array %qs at %L is a variable, which does not reduce to a constant expression"
  msgstr ""
  
! #: fortran/expr.c:2590
  #, gcc-internal-format
  msgid ""
  "Parameter %qs at %L has not been declared or is a variable, which does not "
  "reduce to a constant expression"
  msgstr ""
  
! #: fortran/expr.c:2640
  #, gcc-internal-format
  msgid "check_init_expr(): Unknown expression type"
  msgstr ""
  
! #: fortran/expr.c:2743
  #, gcc-internal-format
  msgid "Specification function %qs at %L cannot be a statement function"
  msgstr ""
  
! #: fortran/expr.c:2750
  #, gcc-internal-format
  msgid "Specification function %qs at %L cannot be an internal function"
  msgstr ""
  
! #: fortran/expr.c:2757
  #, gcc-internal-format
  msgid "Specification function %qs at %L must be PURE"
  msgstr ""
  
! #: fortran/expr.c:2764
  #, gcc-internal-format
  msgid "Specification function %qs at %L cannot be RECURSIVE"
  msgstr ""
  
! #: fortran/expr.c:2898
  #, gcc-internal-format
  msgid "Dummy argument %qs not allowed in expression at %L"
  msgstr ""
  
! #: fortran/expr.c:2905
  #, gcc-internal-format
  msgid "Dummy argument %qs at %L cannot be OPTIONAL"
  msgstr ""
  
! #: fortran/expr.c:2912
  #, gcc-internal-format
  msgid "Dummy argument %qs at %L cannot be INTENT(OUT)"
  msgstr ""
  
! #: fortran/expr.c:2943
  #, gcc-internal-format
  msgid "Variable %qs cannot appear in the expression at %L"
  msgstr ""
  
! #: fortran/expr.c:2974
  #, gcc-internal-format
  msgid "check_restricted(): Unknown expression type"
  msgstr ""
  
! #: fortran/expr.c:2994
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression at %L must be of INTEGER type, found %s"
  msgstr ""
  
! #: fortran/expr.c:3006
  #, gcc-internal-format
  msgid "Function %qs at %L must be PURE"
  msgstr ""
  
! #: fortran/expr.c:3015
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression at %L must be scalar"
  msgstr ""
  
! #: fortran/expr.c:3049
  #, gcc-internal-format, gfc-internal-format
  msgid "Incompatible ranks in %s (%d and %d) at %L"
  msgstr ""
  
! #: fortran/expr.c:3063
  #, gcc-internal-format, gfc-internal-format
  msgid "Different shape for %s at %L on dimension %d (%d and %d)"
  msgstr ""
  
! #: fortran/expr.c:3155
  #, gcc-internal-format
  msgid "%qs at %L is not a VALUE"
  msgstr ""
  
! #: fortran/expr.c:3162
  #, gcc-internal-format, gfc-internal-format
  msgid "Incompatible ranks %d and %d in assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3169
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable type is UNKNOWN in assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3181
  #, gcc-internal-format, gfc-internal-format
  msgid "NULL appears on right-hand side in assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3191
  #, gcc-internal-format, gfc-internal-format
  msgid "POINTER-valued function appears on right-hand side of assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3201
  #, gcc-internal-format
  msgid "BOZ literal at %L used to initialize non-integer variable %qs"
  msgstr ""
  
! #: fortran/expr.c:3206 fortran/resolve.c:9308
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "BOZ literal at %L outside a DATA statement and outside INT/REAL/DBLE/CMPLX"
  msgstr ""
  
! #: fortran/expr.c:3217 fortran/resolve.c:9319
  #, gcc-internal-format
  msgid "BOZ literal at %L is bitwise transferred non-integer symbol %qs"
  msgstr ""
  
! #: fortran/expr.c:3225 fortran/resolve.c:9328
  #, gcc-internal-format
  msgid ""
  "Arithmetic underflow of bit-wise transferred BOZ at %L. This check can be "
  "disabled with the option %<-fno-range-check%>"
  msgstr ""
  
! #: fortran/expr.c:3229 fortran/resolve.c:9332
  #, gcc-internal-format
  msgid ""
  "Arithmetic overflow of bit-wise transferred BOZ at %L. This check can be "
  "disabled with the option %<-fno-range-check%>"
  msgstr ""
  
! #: fortran/expr.c:3233 fortran/resolve.c:9336
  #, gcc-internal-format
  msgid ""
  "Arithmetic NaN of bit-wise transferred BOZ at %L. This check can be disabled "
  "with the option %<-fno-range-check%>"
  msgstr ""
  
! #: fortran/expr.c:3266
  #, gcc-internal-format
  msgid "Change of value in conversion from  %qs to %qs at %L"
  msgstr ""
  
! #: fortran/expr.c:3275
  #, gcc-internal-format
  msgid "Possible change of value in conversion from %qs to %qs at %L"
  msgstr ""
  
! #: fortran/expr.c:3283
  #, gcc-internal-format
  msgid "Conversion from %qs to %qs at %L"
  msgstr ""
  
! #: fortran/expr.c:3304
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Incompatible types in DATA statement at %L; attempted conversion of %s to %s"
  msgstr ""
  
! #: fortran/expr.c:3340
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer assignment target is not a POINTER at %L"
  msgstr ""
  
! #: fortran/expr.c:3348
  #, gcc-internal-format
  msgid ""
  "%qs in the pointer assignment at %L cannot be an l-value since it is a "
  "procedure"
  msgstr ""
  
! #: fortran/expr.c:3371
  #, gcc-internal-format
  msgid "Expected bounds specification for %qs at %L"
  msgstr ""
  
! #: fortran/expr.c:3376
  #, gcc-internal-format
  msgid "Bounds specification for %qs in pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3389
  #, gcc-internal-format, gfc-internal-format
  msgid "Lower bound has to be present at %L"
  msgstr ""
  
! #: fortran/expr.c:3395
  #, gcc-internal-format, gfc-internal-format
  msgid "Stride must not be present at %L"
  msgstr ""
  
! #: fortran/expr.c:3407
  #, gcc-internal-format, gfc-internal-format
  msgid "Either all or none of the upper bounds must be specified at %L"
  msgstr ""
  
! #: fortran/expr.c:3433
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer object at %L shall not have a coindex"
  msgstr ""
  
! #: fortran/expr.c:3454
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid procedure pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3478
  #, gcc-internal-format
  msgid ""
  "Function result %qs is invalid as proc-target in procedure pointer "
  "assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3487
  #, gcc-internal-format
  msgid "Abstract interface %qs is invalid in procedure pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3497
  #, gcc-internal-format
  msgid "Statement function %qs is invalid in procedure pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3503
  #, gcc-internal-format
  msgid "Internal procedure %qs is invalid in procedure pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3510
  #, gcc-internal-format
  msgid "Intrinsic %qs at %L is invalid in procedure pointer assignment"
  msgstr ""
  
! #: fortran/expr.c:3518
  #, gcc-internal-format
  msgid ""
  "Nonintrinsic elemental procedure %qs is invalid in procedure pointer "
  "assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3541
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Mismatch in the procedure pointer assignment at %L: mismatch in the calling "
  "convention"
  msgstr ""
  
! #: fortran/expr.c:3597 fortran/expr.c:3604 fortran/resolve.c:2445
  #, gcc-internal-format
  msgid "Explicit interface required for %qs at %L: %s"
  msgstr ""
  
! #: fortran/expr.c:3612
  #, gcc-internal-format, gfc-internal-format
  msgid "Interface mismatch in procedure pointer assignment at %L: %s"
  msgstr ""
  
! #: fortran/expr.c:3621
  #, gcc-internal-format
  msgid ""
  "Procedure pointer target %qs at %L must be either an intrinsic, host or use "
  "associated, referenced or have the EXTERNAL attribute"
  msgstr ""
  
! #: fortran/expr.c:3638
  #, gcc-internal-format, gfc-internal-format
  msgid ""
! "Data-pointer-object &L must be unlimited polymorphic, a sequence derived "
! "type or of a type with the BIND attribute assignment at %L to be compatible "
! "with an unlimited polymorphic target"
  msgstr ""
  
! #: fortran/expr.c:3644
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Different types in pointer assignment at %L; attempted assignment of %s to %s"
  msgstr ""
  
! #: fortran/expr.c:3653
  #, gcc-internal-format, gfc-internal-format
  msgid "Different kind type parameters in pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3660
  #, gcc-internal-format, gfc-internal-format
  msgid "Different ranks in pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3679
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Rank remapping target is smaller than size of the pointer (%ld < %ld) at %L"
  msgstr ""
  
! #: fortran/expr.c:3692
  #, gcc-internal-format, gfc-internal-format
  msgid "Rank remapping target must be rank 1 or simply contiguous at %L"
  msgstr ""
  
! #: fortran/expr.c:3696
  #, gcc-internal-format, gfc-internal-format
  msgid "Rank remapping target is not rank 1 at %L"
  msgstr ""
  
! #: fortran/expr.c:3720
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Target expression in pointer assignment at %L must deliver a pointer result"
  msgstr ""
  
! #: fortran/expr.c:3728
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer assignment target is neither TARGET nor POINTER at %L"
  msgstr ""
  
! #: fortran/expr.c:3735
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad target in pointer assignment in PURE procedure at %L"
  msgstr ""
  
! #: fortran/expr.c:3744
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer assignment with vector subscript on rhs at %L"
  msgstr ""
  
! #: fortran/expr.c:3752
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer assignment target has PROTECTED attribute at %L"
  msgstr ""
  
! #: fortran/expr.c:3765
  #, gcc-internal-format, gfc-internal-format
  msgid "Data target at %L shall not have a coindex"
  msgstr ""
  
! #: fortran/expr.c:3806
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer at %L in pointer assignment might outlive the pointer target"
  msgstr ""
  
! #: fortran/expr.c:3872
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer initialization target at %L must not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/expr.c:3878
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer initialization target at %L must have the TARGET attribute"
  msgstr ""
  
! #: fortran/expr.c:3893 fortran/resolve.c:1337
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer initialization target at %L must have the SAVE attribute"
  msgstr ""
  
! #: fortran/expr.c:3905
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Procedure pointer initialization target at %L may not be a procedure pointer"
  msgstr ""
  
! #: fortran/expr.c:4793
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Fortran 2008: Pointer functions in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4801
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-variable expression in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4809
  #, gcc-internal-format
  msgid "Named constant %qs in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4818
  #, gcc-internal-format
  msgid "%qs in variable definition context (%s) at %L is not a variable"
  msgstr ""
  
! #: fortran/expr.c:4829
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-POINTER in pointer association context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4842
  #, gcc-internal-format, gfc-internal-format
  msgid "LOCK_TYPE in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4871
  #, gcc-internal-format
  msgid ""
  "Dummy argument %qs with INTENT(IN) in pointer association context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4879
  #, gcc-internal-format
  msgid ""
  "Dummy argument %qs with INTENT(IN) in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4892
  #, gcc-internal-format
  msgid ""
  "Variable %qs is PROTECTED and can not appear in a pointer association "
  "context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4900
  #, gcc-internal-format
  msgid ""
  "Variable %qs is PROTECTED and can not appear in a variable definition "
  "context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4912
  #, gcc-internal-format
  msgid ""
  "Variable %qs can not appear in a variable definition context (%s) at %L in "
  "PURE procedure"
  msgstr ""
  
! #: fortran/expr.c:4971
  #, gcc-internal-format
  msgid ""
  "%qs at %L associated to vector-indexed target can not be used in a variable "
  "definition context (%s)"
  msgstr ""
  
! #: fortran/expr.c:4975
  #, gcc-internal-format
  msgid ""
  "%qs at %L associated to expression can not be used in a variable definition "
  "context (%s)"
  msgstr ""
  
! #: fortran/expr.c:4986
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Associate-name '%s' can not appear in a variable definition context (%s) at "
  "%L because its target at %L can not, either"
  msgstr ""
  
! #: fortran/expr.c:5028
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Elements with the same value at %L and %L in vector subscript in a variable "
--- 47001,47506 ----
  msgid "Evaluation of nonstandard initialization expression at %L"
  msgstr ""
  
! #: fortran/expr.c:2502
  #, gcc-internal-format
  msgid ""
  "Function %qs in initialization expression at %L must be an intrinsic function"
  msgstr ""
  
! #: fortran/expr.c:2514
  #, gcc-internal-format
  msgid ""
  "Intrinsic function %qs at %L is not permitted in an initialization expression"
  msgstr ""
  
! #: fortran/expr.c:2549
  #, gcc-internal-format
  msgid "PARAMETER %qs is used at %L before its definition is complete"
  msgstr ""
  
! #: fortran/expr.c:2569
  #, gcc-internal-format
  msgid ""
  "Assumed size array %qs at %L is not permitted in an initialization expression"
  msgstr ""
  
! #: fortran/expr.c:2575
  #, gcc-internal-format
  msgid ""
  "Assumed shape array %qs at %L is not permitted in an initialization "
  "expression"
  msgstr ""
  
! #: fortran/expr.c:2581
  #, gcc-internal-format
  msgid ""
  "Deferred array %qs at %L is not permitted in an initialization expression"
  msgstr ""
  
! #: fortran/expr.c:2587
  #, gcc-internal-format
  msgid ""
  "Array %qs at %L is a variable, which does not reduce to a constant expression"
  msgstr ""
  
! #: fortran/expr.c:2597
  #, gcc-internal-format
  msgid ""
  "Parameter %qs at %L has not been declared or is a variable, which does not "
  "reduce to a constant expression"
  msgstr ""
  
! #: fortran/expr.c:2651
  #, gcc-internal-format
  msgid "check_init_expr(): Unknown expression type"
  msgstr ""
  
! #: fortran/expr.c:2754
  #, gcc-internal-format
  msgid "Specification function %qs at %L cannot be a statement function"
  msgstr ""
  
! #: fortran/expr.c:2761
  #, gcc-internal-format
  msgid "Specification function %qs at %L cannot be an internal function"
  msgstr ""
  
! #: fortran/expr.c:2768
  #, gcc-internal-format
  msgid "Specification function %qs at %L must be PURE"
  msgstr ""
  
! #: fortran/expr.c:2775
  #, gcc-internal-format
  msgid "Specification function %qs at %L cannot be RECURSIVE"
  msgstr ""
  
! #: fortran/expr.c:2909
  #, gcc-internal-format
  msgid "Dummy argument %qs not allowed in expression at %L"
  msgstr ""
  
! #: fortran/expr.c:2916
  #, gcc-internal-format
  msgid "Dummy argument %qs at %L cannot be OPTIONAL"
  msgstr ""
  
! #: fortran/expr.c:2923
  #, gcc-internal-format
  msgid "Dummy argument %qs at %L cannot be INTENT(OUT)"
  msgstr ""
  
! #: fortran/expr.c:2954
  #, gcc-internal-format
  msgid "Variable %qs cannot appear in the expression at %L"
  msgstr ""
  
! #: fortran/expr.c:2985
  #, gcc-internal-format
  msgid "check_restricted(): Unknown expression type"
  msgstr ""
  
! #: fortran/expr.c:3005
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression at %L must be of INTEGER type, found %s"
  msgstr ""
  
! #: fortran/expr.c:3017
  #, gcc-internal-format
  msgid "Function %qs at %L must be PURE"
  msgstr ""
  
! #: fortran/expr.c:3026
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression at %L must be scalar"
  msgstr ""
  
! #: fortran/expr.c:3060
  #, gcc-internal-format, gfc-internal-format
  msgid "Incompatible ranks in %s (%d and %d) at %L"
  msgstr ""
  
! #: fortran/expr.c:3074
  #, gcc-internal-format, gfc-internal-format
  msgid "Different shape for %s at %L on dimension %d (%d and %d)"
  msgstr ""
  
! #: fortran/expr.c:3166
  #, gcc-internal-format
  msgid "%qs at %L is not a VALUE"
  msgstr ""
  
! #: fortran/expr.c:3173
  #, gcc-internal-format, gfc-internal-format
  msgid "Incompatible ranks %d and %d in assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3180
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable type is UNKNOWN in assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3192
  #, gcc-internal-format, gfc-internal-format
  msgid "NULL appears on right-hand side in assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3202
  #, gcc-internal-format, gfc-internal-format
  msgid "POINTER-valued function appears on right-hand side of assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3212
  #, gcc-internal-format
  msgid "BOZ literal at %L used to initialize non-integer variable %qs"
  msgstr ""
  
! #: fortran/expr.c:3217 fortran/resolve.c:9384
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "BOZ literal at %L outside a DATA statement and outside INT/REAL/DBLE/CMPLX"
  msgstr ""
  
! #: fortran/expr.c:3228 fortran/resolve.c:9395
  #, gcc-internal-format
  msgid "BOZ literal at %L is bitwise transferred non-integer symbol %qs"
  msgstr ""
  
! #: fortran/expr.c:3236 fortran/resolve.c:9404
  #, gcc-internal-format
  msgid ""
  "Arithmetic underflow of bit-wise transferred BOZ at %L. This check can be "
  "disabled with the option %<-fno-range-check%>"
  msgstr ""
  
! #: fortran/expr.c:3240 fortran/resolve.c:9408
  #, gcc-internal-format
  msgid ""
  "Arithmetic overflow of bit-wise transferred BOZ at %L. This check can be "
  "disabled with the option %<-fno-range-check%>"
  msgstr ""
  
! #: fortran/expr.c:3244 fortran/resolve.c:9412
  #, gcc-internal-format
  msgid ""
  "Arithmetic NaN of bit-wise transferred BOZ at %L. This check can be disabled "
  "with the option %<-fno-range-check%>"
  msgstr ""
  
! #: fortran/expr.c:3277
  #, gcc-internal-format
  msgid "Change of value in conversion from  %qs to %qs at %L"
  msgstr ""
  
! #: fortran/expr.c:3286
  #, gcc-internal-format
  msgid "Possible change of value in conversion from %qs to %qs at %L"
  msgstr ""
  
! #: fortran/expr.c:3294
  #, gcc-internal-format
  msgid "Conversion from %qs to %qs at %L"
  msgstr ""
  
! #: fortran/expr.c:3315
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Incompatible types in DATA statement at %L; attempted conversion of %s to %s"
  msgstr ""
  
! #: fortran/expr.c:3351
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer assignment target is not a POINTER at %L"
  msgstr ""
  
! #: fortran/expr.c:3359
  #, gcc-internal-format
  msgid ""
  "%qs in the pointer assignment at %L cannot be an l-value since it is a "
  "procedure"
  msgstr ""
  
! #: fortran/expr.c:3382
  #, gcc-internal-format
  msgid "Expected bounds specification for %qs at %L"
  msgstr ""
  
! #: fortran/expr.c:3387
  #, gcc-internal-format
  msgid "Bounds specification for %qs in pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3400
  #, gcc-internal-format, gfc-internal-format
  msgid "Lower bound has to be present at %L"
  msgstr ""
  
! #: fortran/expr.c:3406
  #, gcc-internal-format, gfc-internal-format
  msgid "Stride must not be present at %L"
  msgstr ""
  
! #: fortran/expr.c:3418
  #, gcc-internal-format, gfc-internal-format
  msgid "Either all or none of the upper bounds must be specified at %L"
  msgstr ""
  
! #: fortran/expr.c:3444
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer object at %L shall not have a coindex"
  msgstr ""
  
! #: fortran/expr.c:3465
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid procedure pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3489
  #, gcc-internal-format
  msgid ""
  "Function result %qs is invalid as proc-target in procedure pointer "
  "assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3498
  #, gcc-internal-format
  msgid "Abstract interface %qs is invalid in procedure pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3508
  #, gcc-internal-format
  msgid "Statement function %qs is invalid in procedure pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3514
  #, gcc-internal-format
  msgid "Internal procedure %qs is invalid in procedure pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3521
  #, gcc-internal-format
  msgid "Intrinsic %qs at %L is invalid in procedure pointer assignment"
  msgstr ""
  
! #: fortran/expr.c:3529
  #, gcc-internal-format
  msgid ""
  "Nonintrinsic elemental procedure %qs is invalid in procedure pointer "
  "assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3552
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Mismatch in the procedure pointer assignment at %L: mismatch in the calling "
  "convention"
  msgstr ""
  
! #: fortran/expr.c:3608 fortran/expr.c:3615 fortran/resolve.c:2445
  #, gcc-internal-format
  msgid "Explicit interface required for %qs at %L: %s"
  msgstr ""
  
! #: fortran/expr.c:3623
  #, gcc-internal-format, gfc-internal-format
  msgid "Interface mismatch in procedure pointer assignment at %L: %s"
  msgstr ""
  
! #: fortran/expr.c:3632
  #, gcc-internal-format
  msgid ""
  "Procedure pointer target %qs at %L must be either an intrinsic, host or use "
  "associated, referenced or have the EXTERNAL attribute"
  msgstr ""
  
! #: fortran/expr.c:3649
  #, gcc-internal-format, gfc-internal-format
  msgid ""
! "Data-pointer-object at %L must be unlimited polymorphic, or of a type with "
! "the BIND or SEQUENCE attribute, to be compatible with an unlimited "
! "polymorphic target"
  msgstr ""
  
! #: fortran/expr.c:3654
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Different types in pointer assignment at %L; attempted assignment of %s to %s"
  msgstr ""
  
! #: fortran/expr.c:3663
  #, gcc-internal-format, gfc-internal-format
  msgid "Different kind type parameters in pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3670
  #, gcc-internal-format, gfc-internal-format
  msgid "Different ranks in pointer assignment at %L"
  msgstr ""
  
! #: fortran/expr.c:3689
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Rank remapping target is smaller than size of the pointer (%ld < %ld) at %L"
  msgstr ""
  
! #: fortran/expr.c:3702
  #, gcc-internal-format, gfc-internal-format
  msgid "Rank remapping target must be rank 1 or simply contiguous at %L"
  msgstr ""
  
! #: fortran/expr.c:3706
  #, gcc-internal-format, gfc-internal-format
  msgid "Rank remapping target is not rank 1 at %L"
  msgstr ""
  
! #: fortran/expr.c:3730
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Target expression in pointer assignment at %L must deliver a pointer result"
  msgstr ""
  
! #: fortran/expr.c:3738
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer assignment target is neither TARGET nor POINTER at %L"
  msgstr ""
  
! #: fortran/expr.c:3745
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad target in pointer assignment in PURE procedure at %L"
  msgstr ""
  
! #: fortran/expr.c:3754
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer assignment with vector subscript on rhs at %L"
  msgstr ""
  
! #: fortran/expr.c:3762
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer assignment target has PROTECTED attribute at %L"
  msgstr ""
  
! #: fortran/expr.c:3775
  #, gcc-internal-format, gfc-internal-format
  msgid "Data target at %L shall not have a coindex"
  msgstr ""
  
! #: fortran/expr.c:3816
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer at %L in pointer assignment might outlive the pointer target"
  msgstr ""
  
! #: fortran/expr.c:3892
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer initialization target at %L must not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/expr.c:3898
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer initialization target at %L must have the TARGET attribute"
  msgstr ""
  
! #: fortran/expr.c:3913 fortran/resolve.c:1337
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer initialization target at %L must have the SAVE attribute"
  msgstr ""
  
! #: fortran/expr.c:3925
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Procedure pointer initialization target at %L may not be a procedure pointer"
  msgstr ""
  
! #: fortran/expr.c:4813
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Fortran 2008: Pointer functions in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4821
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-variable expression in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4829
  #, gcc-internal-format
  msgid "Named constant %qs in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4838
  #, gcc-internal-format
  msgid "%qs in variable definition context (%s) at %L is not a variable"
  msgstr ""
  
! #: fortran/expr.c:4849
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-POINTER in pointer association context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4862
  #, gcc-internal-format, gfc-internal-format
  msgid "LOCK_TYPE in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4875
! #, gcc-internal-format, gfc-internal-format
! msgid "LOCK_EVENT in variable definition context (%s) at %L"
! msgstr ""
! 
! #: fortran/expr.c:4905
  #, gcc-internal-format
  msgid ""
  "Dummy argument %qs with INTENT(IN) in pointer association context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4913
  #, gcc-internal-format
  msgid ""
  "Dummy argument %qs with INTENT(IN) in variable definition context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4926
  #, gcc-internal-format
  msgid ""
  "Variable %qs is PROTECTED and can not appear in a pointer association "
  "context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4934
  #, gcc-internal-format
  msgid ""
  "Variable %qs is PROTECTED and can not appear in a variable definition "
  "context (%s) at %L"
  msgstr ""
  
! #: fortran/expr.c:4946
  #, gcc-internal-format
  msgid ""
  "Variable %qs can not appear in a variable definition context (%s) at %L in "
  "PURE procedure"
  msgstr ""
  
! #: fortran/expr.c:5005
  #, gcc-internal-format
  msgid ""
  "%qs at %L associated to vector-indexed target can not be used in a variable "
  "definition context (%s)"
  msgstr ""
  
! #: fortran/expr.c:5009
  #, gcc-internal-format
  msgid ""
  "%qs at %L associated to expression can not be used in a variable definition "
  "context (%s)"
  msgstr ""
  
! #: fortran/expr.c:5020
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Associate-name '%s' can not appear in a variable definition context (%s) at "
  "%L because its target at %L can not, either"
  msgstr ""
  
! #: fortran/expr.c:5062
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Elements with the same value at %L and %L in vector subscript in a variable "
*************** msgstr ""
*** 47267,47316 ****
  msgid "can't open input file: %s"
  msgstr ""
  
! #: fortran/frontend-passes.c:278
  #, gcc-internal-format
  msgid "Illegal id in copy_walk_reduction_arg"
  msgstr ""
  
! #: fortran/frontend-passes.c:658 fortran/trans-array.c:1057
! #: fortran/trans-array.c:5979 fortran/trans-array.c:7267
! #: fortran/trans-intrinsic.c:6225
  #, gcc-internal-format, gfc-internal-format
  msgid "Creating array temporary at %L"
  msgstr ""
  
! #: fortran/frontend-passes.c:681 fortran/frontend-passes.c:684
  #, gcc-internal-format
  msgid "Removing call to function %qs at %L"
  msgstr ""
  
! #: fortran/frontend-passes.c:1656
  #, gcc-internal-format
  msgid "illegal OP in optimize_comparison"
  msgstr ""
  
! #: fortran/frontend-passes.c:1848
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L set to undefined value inside loop  beginning at %L as "
  "INTENT(OUT) argument to subroutine '%s'"
  msgstr ""
  
! #: fortran/frontend-passes.c:1855
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L not definable inside loop beginning at %L as "
  "INTENT(INOUT) argument to subroutine '%s'"
  msgstr ""
  
! #: fortran/frontend-passes.c:1920
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L set to undefined value inside loop beginning at %L as "
  "INTENT(OUT) argument to function '%s'"
  msgstr ""
  
! #: fortran/frontend-passes.c:1926
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L not definable inside loop beginning at %L as "
--- 47512,47561 ----
  msgid "can't open input file: %s"
  msgstr ""
  
! #: fortran/frontend-passes.c:306
  #, gcc-internal-format
  msgid "Illegal id in copy_walk_reduction_arg"
  msgstr ""
  
! #: fortran/frontend-passes.c:684 fortran/trans-array.c:1057
! #: fortran/trans-array.c:6001 fortran/trans-array.c:7301
! #: fortran/trans-intrinsic.c:6256
  #, gcc-internal-format, gfc-internal-format
  msgid "Creating array temporary at %L"
  msgstr ""
  
! #: fortran/frontend-passes.c:707 fortran/frontend-passes.c:710
  #, gcc-internal-format
  msgid "Removing call to function %qs at %L"
  msgstr ""
  
! #: fortran/frontend-passes.c:1695
  #, gcc-internal-format
  msgid "illegal OP in optimize_comparison"
  msgstr ""
  
! #: fortran/frontend-passes.c:1887
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L set to undefined value inside loop  beginning at %L as "
  "INTENT(OUT) argument to subroutine '%s'"
  msgstr ""
  
! #: fortran/frontend-passes.c:1894
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L not definable inside loop beginning at %L as "
  "INTENT(INOUT) argument to subroutine '%s'"
  msgstr ""
  
! #: fortran/frontend-passes.c:1959
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L set to undefined value inside loop beginning at %L as "
  "INTENT(OUT) argument to function '%s'"
  msgstr ""
  
! #: fortran/frontend-passes.c:1965
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L not definable inside loop beginning at %L as "
*************** msgstr ""
*** 47387,47575 ****
  msgid "Expecting %<END INTERFACE %s%> at %C"
  msgstr ""
  
! #: fortran/interface.c:651
  #, gcc-internal-format, gfc-internal-format
  msgid "Alternate return cannot appear in operator interface at %L"
  msgstr ""
  
! #: fortran/interface.c:680
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment operator interface at %L must have two arguments"
  msgstr ""
  
! #: fortran/interface.c:683
  #, gcc-internal-format, gfc-internal-format
  msgid "Operator interface at %L has the wrong number of arguments"
  msgstr ""
  
! #: fortran/interface.c:696
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment operator interface at %L must be a SUBROUTINE"
  msgstr ""
  
! #: fortran/interface.c:714
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assignment operator interface at %L must not redefine an INTRINSIC type "
  "assignment"
  msgstr ""
  
! #: fortran/interface.c:723
  #, gcc-internal-format, gfc-internal-format
  msgid "Intrinsic operator interface at %L must be a FUNCTION"
  msgstr ""
  
! #: fortran/interface.c:734
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "First argument of defined assignment at %L must be INTENT(OUT) or "
  "INTENT(INOUT)"
  msgstr ""
  
! #: fortran/interface.c:741
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of defined assignment at %L must be INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:750 fortran/resolve.c:14870
  #, gcc-internal-format, gfc-internal-format
  msgid "First argument of operator interface at %L must be INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:757 fortran/resolve.c:14888
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of operator interface at %L must be INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:862
  #, gcc-internal-format, gfc-internal-format
  msgid "Operator interface at %L conflicts with intrinsic interface"
  msgstr ""
  
! #: fortran/interface.c:1193 fortran/interface.c:1252
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "check_dummy_characteristics: Unexpected result %i of gfc_dep_compare_expr"
  msgstr ""
  
! #: fortran/interface.c:1365
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "check_result_characteristics (1): Unexpected result %i of "
  "gfc_dep_compare_expr"
  msgstr ""
  
! #: fortran/interface.c:1412
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "check_result_characteristics (2): Unexpected result %i of "
  "gfc_dep_compare_expr"
  msgstr ""
  
! #: fortran/interface.c:1579
  #, gcc-internal-format
  msgid "Procedure %qs in %s at %L has no explicit interface"
  msgstr ""
  
! #: fortran/interface.c:1582
  #, gcc-internal-format
  msgid "Procedure %qs in %s at %L is neither function nor subroutine"
  msgstr ""
  
! #: fortran/interface.c:1594
  #, gcc-internal-format, gfc-internal-format
  msgid "In %s at %L procedures must be either all SUBROUTINEs or all FUNCTIONs"
  msgstr ""
  
! #: fortran/interface.c:1598
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "In %s at %L procedures must be all FUNCTIONs as the generic name is also the "
  "name of a derived type"
  msgstr ""
  
! #: fortran/interface.c:1606
  #, gcc-internal-format
  msgid "Internal procedure %qs in %s at %L"
  msgstr ""
  
! #: fortran/interface.c:1663 fortran/interface.c:1667
  #, gcc-internal-format
  msgid "Ambiguous interfaces %qs and %qs in %s at %L"
  msgstr ""
  
! #: fortran/interface.c:1671
  #, gcc-internal-format
  msgid "Although not referenced, %qs has ambiguous interfaces at %L"
  msgstr ""
  
! #: fortran/interface.c:1705
  #, gcc-internal-format
  msgid "%qs at %L is not a module procedure"
  msgstr ""
  
! #: fortran/interface.c:1909
  #, gcc-internal-format
  msgid ""
  "The assumed-rank array at %L requires that the dummy argument %qs has "
  "assumed-rank"
  msgstr ""
  
! #: fortran/interface.c:1914
  #, gcc-internal-format
  msgid "Rank mismatch in argument %qs at %L (scalar and rank-%d)"
  msgstr ""
  
! #: fortran/interface.c:1919
  #, gcc-internal-format
  msgid "Rank mismatch in argument %qs at %L (rank-%d and scalar)"
  msgstr ""
  
! #: fortran/interface.c:1924
  #, gcc-internal-format
  msgid "Rank mismatch in argument %qs at %L (rank-%d and rank-%d)"
  msgstr ""
  
! #: fortran/interface.c:1967
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid procedure argument at %L"
  msgstr ""
  
! #: fortran/interface.c:1975 fortran/interface.c:2002
  #, gcc-internal-format
  msgid "Interface mismatch in dummy procedure %qs at %L: %s"
  msgstr ""
  
! #: fortran/interface.c:2013
  #, gcc-internal-format
  msgid ""
  "Actual argument to contiguous pointer dummy %qs at %L must be simply "
  "contiguous"
  msgstr ""
  
! #: fortran/interface.c:2028
  #, gcc-internal-format
  msgid "Type mismatch in argument %qs at %L; passed %s to %s"
  msgstr ""
  
! #: fortran/interface.c:2037
  #, gcc-internal-format
  msgid ""
  "Assumed-type actual argument at %L requires that dummy argument %qs is of "
  "assumed type"
  msgstr ""
  
! #: fortran/interface.c:2053
  #, gcc-internal-format
  msgid "Actual argument to %qs at %L must be polymorphic"
  msgstr ""
  
! #: fortran/interface.c:2066
  #, gcc-internal-format
  msgid "Actual argument to %qs at %L must have the same declared type"
  msgstr ""
  
! #: fortran/interface.c:2081
  #, gcc-internal-format
  msgid ""
  "Actual argument to %qs at %L must be unlimited polymorphic since the formal "
--- 47632,47825 ----
  msgid "Expecting %<END INTERFACE %s%> at %C"
  msgstr ""
  
! #: fortran/interface.c:402
! #, gcc-internal-format
! msgid "gfc_compare_derived_types: invalid derived type"
! msgstr ""
! 
! #: fortran/interface.c:652
  #, gcc-internal-format, gfc-internal-format
  msgid "Alternate return cannot appear in operator interface at %L"
  msgstr ""
  
! #: fortran/interface.c:681
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment operator interface at %L must have two arguments"
  msgstr ""
  
! #: fortran/interface.c:684
  #, gcc-internal-format, gfc-internal-format
  msgid "Operator interface at %L has the wrong number of arguments"
  msgstr ""
  
! #: fortran/interface.c:697
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment operator interface at %L must be a SUBROUTINE"
  msgstr ""
  
! #: fortran/interface.c:715
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assignment operator interface at %L must not redefine an INTRINSIC type "
  "assignment"
  msgstr ""
  
! #: fortran/interface.c:724
  #, gcc-internal-format, gfc-internal-format
  msgid "Intrinsic operator interface at %L must be a FUNCTION"
  msgstr ""
  
! #: fortran/interface.c:735
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "First argument of defined assignment at %L must be INTENT(OUT) or "
  "INTENT(INOUT)"
  msgstr ""
  
! #: fortran/interface.c:742
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of defined assignment at %L must be INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:751 fortran/resolve.c:15035
  #, gcc-internal-format, gfc-internal-format
  msgid "First argument of operator interface at %L must be INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:758 fortran/resolve.c:15053
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of operator interface at %L must be INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:863
  #, gcc-internal-format, gfc-internal-format
  msgid "Operator interface at %L conflicts with intrinsic interface"
  msgstr ""
  
! #: fortran/interface.c:1194 fortran/interface.c:1253
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "check_dummy_characteristics: Unexpected result %i of gfc_dep_compare_expr"
  msgstr ""
  
! #: fortran/interface.c:1366
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "check_result_characteristics (1): Unexpected result %i of "
  "gfc_dep_compare_expr"
  msgstr ""
  
! #: fortran/interface.c:1413
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "check_result_characteristics (2): Unexpected result %i of "
  "gfc_dep_compare_expr"
  msgstr ""
  
! #: fortran/interface.c:1580
  #, gcc-internal-format
  msgid "Procedure %qs in %s at %L has no explicit interface"
  msgstr ""
  
! #: fortran/interface.c:1583
  #, gcc-internal-format
  msgid "Procedure %qs in %s at %L is neither function nor subroutine"
  msgstr ""
  
! #: fortran/interface.c:1595
  #, gcc-internal-format, gfc-internal-format
  msgid "In %s at %L procedures must be either all SUBROUTINEs or all FUNCTIONs"
  msgstr ""
  
! #: fortran/interface.c:1599
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "In %s at %L procedures must be all FUNCTIONs as the generic name is also the "
  "name of a derived type"
  msgstr ""
  
! #: fortran/interface.c:1607
  #, gcc-internal-format
  msgid "Internal procedure %qs in %s at %L"
  msgstr ""
  
! #: fortran/interface.c:1664 fortran/interface.c:1668
  #, gcc-internal-format
  msgid "Ambiguous interfaces %qs and %qs in %s at %L"
  msgstr ""
  
! #: fortran/interface.c:1672
  #, gcc-internal-format
  msgid "Although not referenced, %qs has ambiguous interfaces at %L"
  msgstr ""
  
! #: fortran/interface.c:1706
  #, gcc-internal-format
  msgid "%qs at %L is not a module procedure"
  msgstr ""
  
! #: fortran/interface.c:1910
  #, gcc-internal-format
  msgid ""
  "The assumed-rank array at %L requires that the dummy argument %qs has "
  "assumed-rank"
  msgstr ""
  
! #: fortran/interface.c:1915
  #, gcc-internal-format
  msgid "Rank mismatch in argument %qs at %L (scalar and rank-%d)"
  msgstr ""
  
! #: fortran/interface.c:1920
  #, gcc-internal-format
  msgid "Rank mismatch in argument %qs at %L (rank-%d and scalar)"
  msgstr ""
  
! #: fortran/interface.c:1925
  #, gcc-internal-format
  msgid "Rank mismatch in argument %qs at %L (rank-%d and rank-%d)"
  msgstr ""
  
! #: fortran/interface.c:1968
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid procedure argument at %L"
  msgstr ""
  
! #: fortran/interface.c:1976 fortran/interface.c:2003
  #, gcc-internal-format
  msgid "Interface mismatch in dummy procedure %qs at %L: %s"
  msgstr ""
  
! #: fortran/interface.c:2014
  #, gcc-internal-format
  msgid ""
  "Actual argument to contiguous pointer dummy %qs at %L must be simply "
  "contiguous"
  msgstr ""
  
! #: fortran/interface.c:2029
  #, gcc-internal-format
  msgid "Type mismatch in argument %qs at %L; passed %s to %s"
  msgstr ""
  
! #: fortran/interface.c:2038
  #, gcc-internal-format
  msgid ""
  "Assumed-type actual argument at %L requires that dummy argument %qs is of "
  "assumed type"
  msgstr ""
  
! #: fortran/interface.c:2054
  #, gcc-internal-format
  msgid "Actual argument to %qs at %L must be polymorphic"
  msgstr ""
  
! #: fortran/interface.c:2067
  #, gcc-internal-format
  msgid "Actual argument to %qs at %L must have the same declared type"
  msgstr ""
  
! #: fortran/interface.c:2082
  #, gcc-internal-format
  msgid ""
  "Actual argument to %qs at %L must be unlimited polymorphic since the formal "
*************** msgid ""
*** 47577,47605 ****
  "12.5.2.5]"
  msgstr ""
  
! #: fortran/interface.c:2092
  #, gcc-internal-format
  msgid "Actual argument to %qs at %L must be a coarray"
  msgstr ""
  
! #: fortran/interface.c:2111
  #, gcc-internal-format
  msgid "Corank mismatch in argument %qs at %L (%d and %d)"
  msgstr ""
  
! #: fortran/interface.c:2128
  #, gcc-internal-format
  msgid "Actual argument to %qs at %L must be simply contiguous"
  msgstr ""
  
! #: fortran/interface.c:2142
  #, gcc-internal-format
  msgid ""
  "Actual argument to non-INTENT(INOUT) dummy %qs at %L, which is LOCK_TYPE or "
  "has a LOCK_TYPE component"
  msgstr ""
  
! #: fortran/interface.c:2160
  #, gcc-internal-format
  msgid ""
  "Dummy argument %qs has to be a pointer, assumed-shape or assumed-rank array "
--- 47827,47862 ----
  "12.5.2.5]"
  msgstr ""
  
! #: fortran/interface.c:2093
  #, gcc-internal-format
  msgid "Actual argument to %qs at %L must be a coarray"
  msgstr ""
  
! #: fortran/interface.c:2112
  #, gcc-internal-format
  msgid "Corank mismatch in argument %qs at %L (%d and %d)"
  msgstr ""
  
! #: fortran/interface.c:2129
  #, gcc-internal-format
  msgid "Actual argument to %qs at %L must be simply contiguous"
  msgstr ""
  
! #: fortran/interface.c:2143
  #, gcc-internal-format
  msgid ""
  "Actual argument to non-INTENT(INOUT) dummy %qs at %L, which is LOCK_TYPE or "
  "has a LOCK_TYPE component"
  msgstr ""
  
! #: fortran/interface.c:2158
! #, gcc-internal-format
! msgid ""
! "Actual argument to non-INTENT(INOUT) dummy %qs at %L, which is EVENT_TYPE or "
! "has a EVENT_TYPE component"
! msgstr ""
! 
! #: fortran/interface.c:2176
  #, gcc-internal-format
  msgid ""
  "Dummy argument %qs has to be a pointer, assumed-shape or assumed-rank array "
*************** msgid ""
*** 47607,47791 ****
  "contiguous and both are ASYNCHRONOUS or VOLATILE"
  msgstr ""
  
! #: fortran/interface.c:2173
  #, gcc-internal-format
  msgid ""
  "Passing coarray at %L to allocatable, noncoarray, INTENT(OUT) dummy argument "
  "%qs"
  msgstr ""
  
! #: fortran/interface.c:2180
  #, gcc-internal-format
  msgid ""
  "Passing coarray at %L to allocatable, noncoarray dummy argument %qs, which "
  "is invalid if the allocation status is modified"
  msgstr ""
  
! #: fortran/interface.c:2243
  #, gcc-internal-format
  msgid "Polymorphic scalar passed to array dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2252
  #, gcc-internal-format
  msgid ""
  "Element of assumed-shaped or pointer array passed to array dummy argument "
  "%qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2264
  #, gcc-internal-format
  msgid ""
  "Extension: Scalar non-default-kind, non-C_CHAR-kind CHARACTER actual "
  "argument with array dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2272
  #, gcc-internal-format
  msgid ""
  "Fortran 2003: Scalar CHARACTER actual argument with array dummy argument %qs "
  "at %L"
  msgstr ""
  
! #: fortran/interface.c:2599
  #, gcc-internal-format
  msgid "Keyword argument %qs at %L is not in the procedure"
  msgstr ""
  
! #: fortran/interface.c:2607
  #, gcc-internal-format
  msgid ""
  "Keyword argument %qs at %L is already associated with another actual argument"
  msgstr ""
  
! #: fortran/interface.c:2617
  #, gcc-internal-format, gfc-internal-format
  msgid "More actual than formal arguments in procedure call at %L"
  msgstr ""
  
! #: fortran/interface.c:2629 fortran/interface.c:2999
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing alternate return spec in subroutine call at %L"
  msgstr ""
  
! #: fortran/interface.c:2637
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected alternate return spec in subroutine call at %L"
  msgstr ""
  
! #: fortran/interface.c:2664
  #, gcc-internal-format
  msgid "Unexpected NULL() intrinsic at %L to dummy %qs"
  msgstr ""
  
! #: fortran/interface.c:2667
  #, gcc-internal-format
  msgid "Fortran 2008: Null pointer at %L to non-pointer dummy %qs"
  msgstr ""
  
! #: fortran/interface.c:2691
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Actual argument at %L to assumed-type dummy is of derived type with type-"
  "bound or FINAL procedures"
  msgstr ""
  
! #: fortran/interface.c:2713
  #, gcc-internal-format
  msgid ""
  "Character length mismatch (%ld/%ld) between actual argument and pointer or "
  "allocatable dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2721
  #, gcc-internal-format
  msgid ""
  "Character length mismatch (%ld/%ld) between actual argument and assumed-"
  "shape dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2735
  #, gcc-internal-format
  msgid ""
  "Actual argument at %L to allocatable or pointer dummy argument %qs must have "
  "a deferred length type parameter if and only if the dummy has one"
  msgstr ""
  
! #: fortran/interface.c:2752
  #, gcc-internal-format
  msgid ""
  "Character length of actual argument shorter than of dummy argument %qs (%lu/"
  "%lu) at %L"
  msgstr ""
  
! #: fortran/interface.c:2757
  #, gcc-internal-format
  msgid ""
  "Actual argument contains too few elements for dummy argument %qs (%lu/%lu) "
  "at %L"
  msgstr ""
  
! #: fortran/interface.c:2776
  #, gcc-internal-format
  msgid "Expected a procedure pointer for argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2792
  #, gcc-internal-format
  msgid "Expected a procedure for argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2806
  #, gcc-internal-format
  msgid "Actual argument for %qs cannot be an assumed-size array at %L"
  msgstr ""
  
! #: fortran/interface.c:2815
  #, gcc-internal-format
  msgid "Actual argument for %qs must be a pointer at %L"
  msgstr ""
  
! #: fortran/interface.c:2825
  #, gcc-internal-format
  msgid "Fortran 2008: Non-pointer actual argument at %L to pointer dummy %qs"
  msgstr ""
  
! #: fortran/interface.c:2835
  #, gcc-internal-format
  msgid "Coindexed actual argument at %L to pointer dummy %qs"
  msgstr ""
  
! #: fortran/interface.c:2848
  #, gcc-internal-format
  msgid ""
  "Coindexed actual argument at %L to allocatable dummy %qs requires INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:2862
  #, gcc-internal-format
  msgid ""
  "Coindexed ASYNCHRONOUS or VOLATILE actual argument at %L requires that dummy "
  "%qs has neither ASYNCHRONOUS nor VOLATILE"
  msgstr ""
  
! #: fortran/interface.c:2876
  #, gcc-internal-format
  msgid ""
  "Coindexed actual argument at %L with allocatable ultimate component to dummy "
  "%qs requires either VALUE or INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:2888
  #, gcc-internal-format
  msgid "Actual CLASS array argument for %qs must be a full array at %L"
  msgstr ""
  
! #: fortran/interface.c:2898
  #, gcc-internal-format
  msgid "Actual argument for %qs must be ALLOCATABLE at %L"
  msgstr ""
  
! #: fortran/interface.c:2927
  #, gcc-internal-format
  msgid ""
  "Array-section actual argument with vector subscripts at %L is incompatible "
--- 47864,48048 ----
  "contiguous and both are ASYNCHRONOUS or VOLATILE"
  msgstr ""
  
! #: fortran/interface.c:2189
  #, gcc-internal-format
  msgid ""
  "Passing coarray at %L to allocatable, noncoarray, INTENT(OUT) dummy argument "
  "%qs"
  msgstr ""
  
! #: fortran/interface.c:2196
  #, gcc-internal-format
  msgid ""
  "Passing coarray at %L to allocatable, noncoarray dummy argument %qs, which "
  "is invalid if the allocation status is modified"
  msgstr ""
  
! #: fortran/interface.c:2259
  #, gcc-internal-format
  msgid "Polymorphic scalar passed to array dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2268
  #, gcc-internal-format
  msgid ""
  "Element of assumed-shaped or pointer array passed to array dummy argument "
  "%qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2280
  #, gcc-internal-format
  msgid ""
  "Extension: Scalar non-default-kind, non-C_CHAR-kind CHARACTER actual "
  "argument with array dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2288
  #, gcc-internal-format
  msgid ""
  "Fortran 2003: Scalar CHARACTER actual argument with array dummy argument %qs "
  "at %L"
  msgstr ""
  
! #: fortran/interface.c:2617
  #, gcc-internal-format
  msgid "Keyword argument %qs at %L is not in the procedure"
  msgstr ""
  
! #: fortran/interface.c:2625
  #, gcc-internal-format
  msgid ""
  "Keyword argument %qs at %L is already associated with another actual argument"
  msgstr ""
  
! #: fortran/interface.c:2635
  #, gcc-internal-format, gfc-internal-format
  msgid "More actual than formal arguments in procedure call at %L"
  msgstr ""
  
! #: fortran/interface.c:2647 fortran/interface.c:3017
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing alternate return spec in subroutine call at %L"
  msgstr ""
  
! #: fortran/interface.c:2655
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected alternate return spec in subroutine call at %L"
  msgstr ""
  
! #: fortran/interface.c:2682
  #, gcc-internal-format
  msgid "Unexpected NULL() intrinsic at %L to dummy %qs"
  msgstr ""
  
! #: fortran/interface.c:2685
  #, gcc-internal-format
  msgid "Fortran 2008: Null pointer at %L to non-pointer dummy %qs"
  msgstr ""
  
! #: fortran/interface.c:2709
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Actual argument at %L to assumed-type dummy is of derived type with type-"
  "bound or FINAL procedures"
  msgstr ""
  
! #: fortran/interface.c:2731
  #, gcc-internal-format
  msgid ""
  "Character length mismatch (%ld/%ld) between actual argument and pointer or "
  "allocatable dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2739
  #, gcc-internal-format
  msgid ""
  "Character length mismatch (%ld/%ld) between actual argument and assumed-"
  "shape dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2753
  #, gcc-internal-format
  msgid ""
  "Actual argument at %L to allocatable or pointer dummy argument %qs must have "
  "a deferred length type parameter if and only if the dummy has one"
  msgstr ""
  
! #: fortran/interface.c:2770
  #, gcc-internal-format
  msgid ""
  "Character length of actual argument shorter than of dummy argument %qs (%lu/"
  "%lu) at %L"
  msgstr ""
  
! #: fortran/interface.c:2775
  #, gcc-internal-format
  msgid ""
  "Actual argument contains too few elements for dummy argument %qs (%lu/%lu) "
  "at %L"
  msgstr ""
  
! #: fortran/interface.c:2794
  #, gcc-internal-format
  msgid "Expected a procedure pointer for argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2810
  #, gcc-internal-format
  msgid "Expected a procedure for argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:2824
  #, gcc-internal-format
  msgid "Actual argument for %qs cannot be an assumed-size array at %L"
  msgstr ""
  
! #: fortran/interface.c:2833
  #, gcc-internal-format
  msgid "Actual argument for %qs must be a pointer at %L"
  msgstr ""
  
! #: fortran/interface.c:2843
  #, gcc-internal-format
  msgid "Fortran 2008: Non-pointer actual argument at %L to pointer dummy %qs"
  msgstr ""
  
! #: fortran/interface.c:2853
  #, gcc-internal-format
  msgid "Coindexed actual argument at %L to pointer dummy %qs"
  msgstr ""
  
! #: fortran/interface.c:2866
  #, gcc-internal-format
  msgid ""
  "Coindexed actual argument at %L to allocatable dummy %qs requires INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:2880
  #, gcc-internal-format
  msgid ""
  "Coindexed ASYNCHRONOUS or VOLATILE actual argument at %L requires that dummy "
  "%qs has neither ASYNCHRONOUS nor VOLATILE"
  msgstr ""
  
! #: fortran/interface.c:2894
  #, gcc-internal-format
  msgid ""
  "Coindexed actual argument at %L with allocatable ultimate component to dummy "
  "%qs requires either VALUE or INTENT(IN)"
  msgstr ""
  
! #: fortran/interface.c:2906
  #, gcc-internal-format
  msgid "Actual CLASS array argument for %qs must be a full array at %L"
  msgstr ""
  
! #: fortran/interface.c:2916
  #, gcc-internal-format
  msgid "Actual argument for %qs must be ALLOCATABLE at %L"
  msgstr ""
  
! #: fortran/interface.c:2945
  #, gcc-internal-format
  msgid ""
  "Array-section actual argument with vector subscripts at %L is incompatible "
*************** msgid ""
*** 47793,48051 ****
  "dummy argument %qs"
  msgstr ""
  
! #: fortran/interface.c:2945
  #, gcc-internal-format
  msgid ""
  "Assumed-shape actual argument at %L is incompatible with the non-assumed-"
  "shape dummy argument %qs due to VOLATILE attribute"
  msgstr ""
  
! #: fortran/interface.c:2957
  #, gcc-internal-format
  msgid ""
  "Array-section actual argument at %L is incompatible with the non-assumed-"
  "shape dummy argument %qs due to VOLATILE attribute"
  msgstr ""
  
! #: fortran/interface.c:2976
  #, gcc-internal-format
  msgid ""
  "Pointer-array actual argument at %L requires an assumed-shape or pointer-"
  "array dummy argument %qs due to VOLATILE attribute"
  msgstr ""
  
! #: fortran/interface.c:3006
  #, gcc-internal-format
  msgid "Missing actual argument for argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:3128
  #, gcc-internal-format
  msgid "compare_actual_expr(): Bad component code"
  msgstr ""
  
! #: fortran/interface.c:3157
  #, gcc-internal-format
  msgid "check_some_aliasing(): List mismatch"
  msgstr ""
  
! #: fortran/interface.c:3183
  #, gcc-internal-format
  msgid "check_some_aliasing(): corrupted data"
  msgstr ""
  
! #: fortran/interface.c:3193
  #, gcc-internal-format
  msgid ""
  "Same actual argument associated with INTENT(%s) argument %qs and INTENT(%s) "
  "argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:3223
  #, gcc-internal-format
  msgid "check_intents(): List mismatch"
  msgstr ""
  
! #: fortran/interface.c:3243
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Procedure argument at %L is local to a PURE procedure and has the POINTER "
  "attribute"
  msgstr ""
  
! #: fortran/interface.c:3255
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Coindexed actual argument at %L in PURE procedure is passed to an INTENT(%s) "
  "argument"
  msgstr ""
  
! #: fortran/interface.c:3265
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Coindexed actual argument at %L in PURE procedure is passed to a POINTER "
  "dummy argument"
  msgstr ""
  
! #: fortran/interface.c:3276
  #, gcc-internal-format
  msgid ""
  "Coindexed polymorphic actual argument at %L is passed polymorphic dummy "
  "argument %qs"
  msgstr ""
  
! #: fortran/interface.c:3304 fortran/interface.c:3314
  #, gcc-internal-format
  msgid "Procedure %qs called at %L is not explicitly declared"
  msgstr ""
  
! #: fortran/interface.c:3310
  #, gcc-internal-format
  msgid "Procedure %qs called with an implicit interface at %L"
  msgstr ""
  
! #: fortran/interface.c:3324
  #, gcc-internal-format
  msgid ""
  "The pointer object %qs at %L must have an explicit function interface or be "
  "declared as array"
  msgstr ""
  
! #: fortran/interface.c:3332
  #, gcc-internal-format
  msgid ""
  "The allocatable object %qs at %L must have an explicit function interface or "
  "be declared as array"
  msgstr ""
  
! #: fortran/interface.c:3340
  #, gcc-internal-format
  msgid "Allocatable function %qs at %L must have an explicit function interface"
  msgstr ""
  
! #: fortran/interface.c:3350
  #, gcc-internal-format
  msgid "Keyword argument requires explicit interface for procedure %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:3359
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type argument %s at %L requires an explicit interface"
  msgstr ""
  
! #: fortran/interface.c:3372
  #, gcc-internal-format
  msgid ""
  "Actual argument of LOCK_TYPE or with LOCK_TYPE component at %L requires an "
  "explicit interface for procedure %qs"
  msgstr ""
  
! #: fortran/interface.c:3381
  #, gcc-internal-format, gfc-internal-format
  msgid "MOLD argument to NULL required at %L"
  msgstr ""
  
! #: fortran/interface.c:3389
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank argument requires an explicit interface at %L"
  msgstr ""
  
! #: fortran/interface.c:3427
  #, gcc-internal-format
  msgid "Procedure pointer component %qs called with an implicit interface at %L"
  msgstr ""
  
! #: fortran/interface.c:3438
  #, gcc-internal-format
  msgid ""
  "Keyword argument requires explicit interface for procedure pointer component "
  "%qs at %L"
  msgstr ""
  
! #: fortran/interface.c:3522
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "MOLD= required in NULL() argument at %L: Ambiguity between specific "
  "functions %s and %s"
  msgstr ""
  
! #: fortran/interface.c:3592
  #, gcc-internal-format
  msgid "Unable to find symbol %qs"
  msgstr ""
  
! #: fortran/interface.c:3959
  #, gcc-internal-format
  msgid "Entity %qs at %L is already present in the interface"
  msgstr ""
  
! #: fortran/interface.c:4075
  #, gcc-internal-format
  msgid "gfc_add_interface(): Bad interface type"
  msgstr ""
  
! #: fortran/interface.c:4170
  #, gcc-internal-format
  msgid "Can't overwrite GENERIC %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:4182
  #, gcc-internal-format
  msgid "%qs at %L overrides a procedure binding declared NON_OVERRIDABLE"
  msgstr ""
  
! #: fortran/interface.c:4190
  #, gcc-internal-format
  msgid "%qs at %L must not be DEFERRED as it overrides a non-DEFERRED binding"
  msgstr ""
  
! #: fortran/interface.c:4198
  #, gcc-internal-format
  msgid "%qs at %L overrides a PURE procedure and must also be PURE"
  msgstr ""
  
! #: fortran/interface.c:4207
  #, gcc-internal-format
  msgid "%qs at %L overrides an ELEMENTAL procedure and must also be ELEMENTAL"
  msgstr ""
  
! #: fortran/interface.c:4213
  #, gcc-internal-format
  msgid ""
  "%qs at %L overrides a non-ELEMENTAL procedure and must not be ELEMENTAL, "
  "either"
  msgstr ""
  
! #: fortran/interface.c:4222
  #, gcc-internal-format
  msgid "%qs at %L overrides a SUBROUTINE and must also be a SUBROUTINE"
  msgstr ""
  
! #: fortran/interface.c:4233
  #, gcc-internal-format
  msgid "%qs at %L overrides a FUNCTION and must also be a FUNCTION"
  msgstr ""
  
! #: fortran/interface.c:4241
  #, gcc-internal-format
  msgid "Result mismatch for the overriding procedure %qs at %L: %s"
  msgstr ""
  
! #: fortran/interface.c:4252
  #, gcc-internal-format
  msgid "%qs at %L overrides a PUBLIC procedure and must not be PRIVATE"
  msgstr ""
  
! #: fortran/interface.c:4282
  #, gcc-internal-format
  msgid ""
  "Dummy argument %qs of %qs at %L should be named %qs as to match the "
  "corresponding argument of the overridden procedure"
  msgstr ""
  
! #: fortran/interface.c:4293
  #, gcc-internal-format
  msgid "Argument mismatch for the overriding procedure %qs at %L: %s"
  msgstr ""
  
! #: fortran/interface.c:4302
  #, gcc-internal-format
  msgid ""
  "%qs at %L must have the same number of formal arguments as the overridden "
  "procedure"
  msgstr ""
  
! #: fortran/interface.c:4311
  #, gcc-internal-format
  msgid "%qs at %L overrides a NOPASS binding and must also be NOPASS"
  msgstr ""
  
! #: fortran/interface.c:4322
  #, gcc-internal-format
  msgid "%qs at %L overrides a binding with PASS and must also be PASS"
  msgstr ""
  
! #: fortran/interface.c:4329
  #, gcc-internal-format
  msgid ""
  "Passed-object dummy argument of %qs at %L must be at the same position as "
--- 48050,48315 ----
  "dummy argument %qs"
  msgstr ""
  
! #: fortran/interface.c:2963
  #, gcc-internal-format
  msgid ""
  "Assumed-shape actual argument at %L is incompatible with the non-assumed-"
  "shape dummy argument %qs due to VOLATILE attribute"
  msgstr ""
  
! #: fortran/interface.c:2975
  #, gcc-internal-format
  msgid ""
  "Array-section actual argument at %L is incompatible with the non-assumed-"
  "shape dummy argument %qs due to VOLATILE attribute"
  msgstr ""
  
! #: fortran/interface.c:2994
  #, gcc-internal-format
  msgid ""
  "Pointer-array actual argument at %L requires an assumed-shape or pointer-"
  "array dummy argument %qs due to VOLATILE attribute"
  msgstr ""
  
! #: fortran/interface.c:3024
  #, gcc-internal-format
  msgid "Missing actual argument for argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:3146
  #, gcc-internal-format
  msgid "compare_actual_expr(): Bad component code"
  msgstr ""
  
! #: fortran/interface.c:3175
  #, gcc-internal-format
  msgid "check_some_aliasing(): List mismatch"
  msgstr ""
  
! #: fortran/interface.c:3201
  #, gcc-internal-format
  msgid "check_some_aliasing(): corrupted data"
  msgstr ""
  
! #: fortran/interface.c:3211
  #, gcc-internal-format
  msgid ""
  "Same actual argument associated with INTENT(%s) argument %qs and INTENT(%s) "
  "argument %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:3241
  #, gcc-internal-format
  msgid "check_intents(): List mismatch"
  msgstr ""
  
! #: fortran/interface.c:3261
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Procedure argument at %L is local to a PURE procedure and has the POINTER "
  "attribute"
  msgstr ""
  
! #: fortran/interface.c:3273
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Coindexed actual argument at %L in PURE procedure is passed to an INTENT(%s) "
  "argument"
  msgstr ""
  
! #: fortran/interface.c:3283
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Coindexed actual argument at %L in PURE procedure is passed to a POINTER "
  "dummy argument"
  msgstr ""
  
! #: fortran/interface.c:3294
  #, gcc-internal-format
  msgid ""
  "Coindexed polymorphic actual argument at %L is passed polymorphic dummy "
  "argument %qs"
  msgstr ""
  
! #: fortran/interface.c:3322 fortran/interface.c:3332
  #, gcc-internal-format
  msgid "Procedure %qs called at %L is not explicitly declared"
  msgstr ""
  
! #: fortran/interface.c:3328
  #, gcc-internal-format
  msgid "Procedure %qs called with an implicit interface at %L"
  msgstr ""
  
! #: fortran/interface.c:3342
  #, gcc-internal-format
  msgid ""
  "The pointer object %qs at %L must have an explicit function interface or be "
  "declared as array"
  msgstr ""
  
! #: fortran/interface.c:3350
  #, gcc-internal-format
  msgid ""
  "The allocatable object %qs at %L must have an explicit function interface or "
  "be declared as array"
  msgstr ""
  
! #: fortran/interface.c:3358
  #, gcc-internal-format
  msgid "Allocatable function %qs at %L must have an explicit function interface"
  msgstr ""
  
! #: fortran/interface.c:3368
  #, gcc-internal-format
  msgid "Keyword argument requires explicit interface for procedure %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:3377
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type argument %s at %L requires an explicit interface"
  msgstr ""
  
! #: fortran/interface.c:3390
  #, gcc-internal-format
  msgid ""
  "Actual argument of LOCK_TYPE or with LOCK_TYPE component at %L requires an "
  "explicit interface for procedure %qs"
  msgstr ""
  
! #: fortran/interface.c:3403
! #, gcc-internal-format
! msgid ""
! "Actual argument of EVENT_TYPE or with EVENT_TYPE component at %L requires an "
! "explicit interface for procedure %qs"
! msgstr ""
! 
! #: fortran/interface.c:3412
  #, gcc-internal-format, gfc-internal-format
  msgid "MOLD argument to NULL required at %L"
  msgstr ""
  
! #: fortran/interface.c:3420
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank argument requires an explicit interface at %L"
  msgstr ""
  
! #: fortran/interface.c:3458
  #, gcc-internal-format
  msgid "Procedure pointer component %qs called with an implicit interface at %L"
  msgstr ""
  
! #: fortran/interface.c:3469
  #, gcc-internal-format
  msgid ""
  "Keyword argument requires explicit interface for procedure pointer component "
  "%qs at %L"
  msgstr ""
  
! #: fortran/interface.c:3553
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "MOLD= required in NULL() argument at %L: Ambiguity between specific "
  "functions %s and %s"
  msgstr ""
  
! #: fortran/interface.c:3623
  #, gcc-internal-format
  msgid "Unable to find symbol %qs"
  msgstr ""
  
! #: fortran/interface.c:3990
  #, gcc-internal-format
  msgid "Entity %qs at %L is already present in the interface"
  msgstr ""
  
! #: fortran/interface.c:4106
  #, gcc-internal-format
  msgid "gfc_add_interface(): Bad interface type"
  msgstr ""
  
! #: fortran/interface.c:4201
  #, gcc-internal-format
  msgid "Can't overwrite GENERIC %qs at %L"
  msgstr ""
  
! #: fortran/interface.c:4213
  #, gcc-internal-format
  msgid "%qs at %L overrides a procedure binding declared NON_OVERRIDABLE"
  msgstr ""
  
! #: fortran/interface.c:4221
  #, gcc-internal-format
  msgid "%qs at %L must not be DEFERRED as it overrides a non-DEFERRED binding"
  msgstr ""
  
! #: fortran/interface.c:4229
  #, gcc-internal-format
  msgid "%qs at %L overrides a PURE procedure and must also be PURE"
  msgstr ""
  
! #: fortran/interface.c:4238
  #, gcc-internal-format
  msgid "%qs at %L overrides an ELEMENTAL procedure and must also be ELEMENTAL"
  msgstr ""
  
! #: fortran/interface.c:4244
  #, gcc-internal-format
  msgid ""
  "%qs at %L overrides a non-ELEMENTAL procedure and must not be ELEMENTAL, "
  "either"
  msgstr ""
  
! #: fortran/interface.c:4253
  #, gcc-internal-format
  msgid "%qs at %L overrides a SUBROUTINE and must also be a SUBROUTINE"
  msgstr ""
  
! #: fortran/interface.c:4264
  #, gcc-internal-format
  msgid "%qs at %L overrides a FUNCTION and must also be a FUNCTION"
  msgstr ""
  
! #: fortran/interface.c:4272
  #, gcc-internal-format
  msgid "Result mismatch for the overriding procedure %qs at %L: %s"
  msgstr ""
  
! #: fortran/interface.c:4283
  #, gcc-internal-format
  msgid "%qs at %L overrides a PUBLIC procedure and must not be PRIVATE"
  msgstr ""
  
! #: fortran/interface.c:4313
  #, gcc-internal-format
  msgid ""
  "Dummy argument %qs of %qs at %L should be named %qs as to match the "
  "corresponding argument of the overridden procedure"
  msgstr ""
  
! #: fortran/interface.c:4324
  #, gcc-internal-format
  msgid "Argument mismatch for the overriding procedure %qs at %L: %s"
  msgstr ""
  
! #: fortran/interface.c:4333
  #, gcc-internal-format
  msgid ""
  "%qs at %L must have the same number of formal arguments as the overridden "
  "procedure"
  msgstr ""
  
! #: fortran/interface.c:4342
  #, gcc-internal-format
  msgid "%qs at %L overrides a NOPASS binding and must also be NOPASS"
  msgstr ""
  
! #: fortran/interface.c:4353
  #, gcc-internal-format
  msgid "%qs at %L overrides a binding with PASS and must also be PASS"
  msgstr ""
  
! #: fortran/interface.c:4360
  #, gcc-internal-format
  msgid ""
  "Passed-object dummy argument of %qs at %L must be at the same position as "
*************** msgstr ""
*** 48110,48233 ****
  msgid "make_generic(): Can't find generic symbol %qs"
  msgstr ""
  
! #: fortran/intrinsic.c:3818
  #, gcc-internal-format
  msgid "Too many arguments in call to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3833
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The argument list functions %%VAL, %%LOC or %%REF are not allowed in this "
  "context at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3836
  #, gcc-internal-format
  msgid "Can't find keyword named %qs in call to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3843
  #, gcc-internal-format
  msgid "Argument %qs appears twice in call to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3857
  #, gcc-internal-format
  msgid "Missing actual argument %qs in call to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3872
  #, gcc-internal-format, gfc-internal-format
  msgid "ALTERNATE RETURN not permitted at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3929
  #, gcc-internal-format
  msgid "Type of argument %qs in call to %qs at %L should be %s, not %s"
  msgstr ""
  
! #: fortran/intrinsic.c:4035
  #, gcc-internal-format
  msgid "resolve_intrinsic(): Too many args for intrinsic"
  msgstr ""
  
! #: fortran/intrinsic.c:4121
  #, gcc-internal-format
  msgid "do_simplify(): Too many args for intrinsic"
  msgstr ""
  
! #: fortran/intrinsic.c:4160
  #, gcc-internal-format
  msgid "init_arglist(): too many arguments"
  msgstr ""
  
! #: fortran/intrinsic.c:4310
  #, gcc-internal-format
  msgid "Invalid standard code on intrinsic %qs (%d)"
  msgstr ""
  
! #: fortran/intrinsic.c:4319
  #, gcc-internal-format
  msgid "Intrinsic %qs (is %s) is used at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4390
  #, gcc-internal-format
  msgid "Function %qs as initialization expression at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4466
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Elemental function as initialization expression with non-integer/non-"
  "character arguments at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4537
  #, gcc-internal-format
  msgid ""
  "Subroutine call to intrinsic %qs in DO CONCURRENT block at %L is not PURE"
  msgstr ""
  
! #: fortran/intrinsic.c:4544
  #, gcc-internal-format
  msgid "Subroutine call to intrinsic %qs at %L is not PURE"
  msgstr ""
  
! #: fortran/intrinsic.c:4620
  #, gcc-internal-format, gfc-internal-format
  msgid "Extension: Conversion from %s to %s at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4654 fortran/intrinsic.c:4670
  #, gcc-internal-format, gfc-internal-format
  msgid "Possible change of value in conversion from %s to %s at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4659 fortran/intrinsic.c:4679
  #, gcc-internal-format, gfc-internal-format
  msgid "Conversion from %s to %s at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4732
  #, gcc-internal-format, gfc-internal-format
  msgid "Can't convert %s to %s at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4737
  #, gcc-internal-format
  msgid "Can't convert %qs to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4827
  #, gcc-internal-format
  msgid ""
  "%qs declared at %L may shadow the intrinsic of the same name.  In order to "
  "call the intrinsic, explicit INTRINSIC declarations may be required."
  msgstr ""
  
! #: fortran/intrinsic.c:4833
  #, gcc-internal-format
  msgid ""
  "%qs declared at %L is also the name of an intrinsic.  It can only be called "
--- 48374,48497 ----
  msgid "make_generic(): Can't find generic symbol %qs"
  msgstr ""
  
! #: fortran/intrinsic.c:3826
  #, gcc-internal-format
  msgid "Too many arguments in call to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3841
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The argument list functions %%VAL, %%LOC or %%REF are not allowed in this "
  "context at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3844
  #, gcc-internal-format
  msgid "Can't find keyword named %qs in call to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3851
  #, gcc-internal-format
  msgid "Argument %qs appears twice in call to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3865
  #, gcc-internal-format
  msgid "Missing actual argument %qs in call to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3880
  #, gcc-internal-format, gfc-internal-format
  msgid "ALTERNATE RETURN not permitted at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:3937
  #, gcc-internal-format
  msgid "Type of argument %qs in call to %qs at %L should be %s, not %s"
  msgstr ""
  
! #: fortran/intrinsic.c:4043
  #, gcc-internal-format
  msgid "resolve_intrinsic(): Too many args for intrinsic"
  msgstr ""
  
! #: fortran/intrinsic.c:4129
  #, gcc-internal-format
  msgid "do_simplify(): Too many args for intrinsic"
  msgstr ""
  
! #: fortran/intrinsic.c:4168
  #, gcc-internal-format
  msgid "init_arglist(): too many arguments"
  msgstr ""
  
! #: fortran/intrinsic.c:4318
  #, gcc-internal-format
  msgid "Invalid standard code on intrinsic %qs (%d)"
  msgstr ""
  
! #: fortran/intrinsic.c:4327
  #, gcc-internal-format
  msgid "Intrinsic %qs (is %s) is used at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4398
  #, gcc-internal-format
  msgid "Function %qs as initialization expression at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4474
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Elemental function as initialization expression with non-integer/non-"
  "character arguments at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4545
  #, gcc-internal-format
  msgid ""
  "Subroutine call to intrinsic %qs in DO CONCURRENT block at %L is not PURE"
  msgstr ""
  
! #: fortran/intrinsic.c:4552
  #, gcc-internal-format
  msgid "Subroutine call to intrinsic %qs at %L is not PURE"
  msgstr ""
  
! #: fortran/intrinsic.c:4628
  #, gcc-internal-format, gfc-internal-format
  msgid "Extension: Conversion from %s to %s at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4662 fortran/intrinsic.c:4678
  #, gcc-internal-format, gfc-internal-format
  msgid "Possible change of value in conversion from %s to %s at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4667 fortran/intrinsic.c:4687
  #, gcc-internal-format, gfc-internal-format
  msgid "Conversion from %s to %s at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4740
  #, gcc-internal-format, gfc-internal-format
  msgid "Can't convert %s to %s at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4745
  #, gcc-internal-format
  msgid "Can't convert %qs to %qs at %L"
  msgstr ""
  
! #: fortran/intrinsic.c:4835
  #, gcc-internal-format
  msgid ""
  "%qs declared at %L may shadow the intrinsic of the same name.  In order to "
  "call the intrinsic, explicit INTRINSIC declarations may be required."
  msgstr ""
  
! #: fortran/intrinsic.c:4841
  #, gcc-internal-format
  msgid ""
  "%qs declared at %L is also the name of an intrinsic.  It can only be called "
*************** msgstr ""
*** 48319,48727 ****
  msgid "Format statement in module main block at %C"
  msgstr ""
  
! #: fortran/io.c:1205
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing format label at %C"
  msgstr ""
  
! #: fortran/io.c:1260 fortran/io.c:1291 fortran/io.c:1357
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid value for %s specification at %C"
  msgstr ""
  
! #: fortran/io.c:1266 fortran/io.c:1297
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate %s specification at %C"
  msgstr ""
  
! #: fortran/io.c:1304
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable %s cannot be INTENT(IN) at %C"
  msgstr ""
  
! #: fortran/io.c:1312
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable %s cannot be assigned in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:1363
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate %s label specification at %C"
  msgstr ""
  
! #: fortran/io.c:1383
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Constant expression in FORMAT tag at %L must be of type default CHARACTER"
  msgstr ""
  
! #: fortran/io.c:1401
  #, gcc-internal-format, gfc-internal-format
  msgid "FORMAT tag at %L must be of type default-kind CHARACTER or of INTEGER"
  msgstr ""
  
! #: fortran/io.c:1407
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSIGNED variable in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1412
  #, gcc-internal-format
  msgid "Variable %qs at %L has not been assigned a format label"
  msgstr ""
  
! #: fortran/io.c:1419
  #, gcc-internal-format
  msgid "Scalar %qs in FORMAT tag at %L is not an ASSIGNED variable"
  msgstr ""
  
! #: fortran/io.c:1431
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-character in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1437
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-character assumed shape array element in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1444
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-character assumed size array element in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1451
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-character pointer array element in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1477
  #, gcc-internal-format, gfc-internal-format
  msgid "%s tag at %L must be of type %s"
  msgstr ""
  
! #: fortran/io.c:1484
  #, gcc-internal-format, gfc-internal-format
  msgid "%s tag at %L must be a character string of default kind"
  msgstr ""
  
! #: fortran/io.c:1491
  #, gcc-internal-format, gfc-internal-format
  msgid "%s tag at %L must be scalar"
  msgstr ""
  
! #: fortran/io.c:1497
  #, gcc-internal-format, gfc-internal-format
  msgid "IOMSG tag at %L"
  msgstr ""
  
! #: fortran/io.c:1505
  #, gcc-internal-format, gfc-internal-format
  msgid "Fortran 95 requires default INTEGER in %s tag at %L"
  msgstr ""
  
! #: fortran/io.c:1514
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-default LOGICAL kind in %s tag at %L"
  msgstr ""
  
! #: fortran/io.c:1521
  #, gcc-internal-format, gfc-internal-format
  msgid "NEWUNIT specifier at %L"
  msgstr ""
  
! #: fortran/io.c:1539
  #, gcc-internal-format, gfc-internal-format
  msgid "CONVERT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1724
  #, gcc-internal-format
  msgid "Fortran 2003: %s specifier in %s statement at %C has value %qs"
  msgstr ""
  
! #: fortran/io.c:1732 fortran/io.c:1759
  #, gcc-internal-format
  msgid "%s specifier in %s statement at %C has value %qs"
  msgstr ""
  
! #: fortran/io.c:1751
  #, gcc-internal-format
  msgid "Extension: %s specifier in %s statement at %C has value %qs"
  msgstr ""
  
! #: fortran/io.c:1773 fortran/io.c:1781
  #, gcc-internal-format
  msgid "%s specifier in %s statement at %C has invalid value %qs"
  msgstr ""
  
! #: fortran/io.c:1834
  #, gcc-internal-format, gfc-internal-format
  msgid "OPEN statement not allowed in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:1847
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT specifier not allowed with NEWUNIT at %C"
  msgstr ""
  
! #: fortran/io.c:1855
  #, gcc-internal-format, gfc-internal-format
  msgid "NEWUNIT specifier must have FILE= or STATUS='scratch' at %C"
  msgstr ""
  
! #: fortran/io.c:1862
  #, gcc-internal-format, gfc-internal-format
  msgid "OPEN statement at %C must have UNIT or NEWUNIT specified"
  msgstr ""
  
! #: fortran/io.c:1894
  #, gcc-internal-format, gfc-internal-format
  msgid "ASYNCHRONOUS= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:1912 fortran/io.c:3350
  #, gcc-internal-format, gfc-internal-format
  msgid "BLANK= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:1930 fortran/io.c:3329
  #, gcc-internal-format, gfc-internal-format
  msgid "DECIMAL= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:1962
  #, gcc-internal-format, gfc-internal-format
  msgid "ENCODING= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:2013 fortran/io.c:3392
  #, gcc-internal-format, gfc-internal-format
  msgid "ROUND= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:2033
  #, gcc-internal-format, gfc-internal-format
  msgid "SIGN= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:2246
  #, gcc-internal-format, gfc-internal-format
  msgid "CLOSE statement not allowed in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:2305
  #, gcc-internal-format, gfc-internal-format
  msgid "CLOSE statement at %L requires a UNIT number"
  msgstr ""
  
! #: fortran/io.c:2313
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT number in CLOSE statement at %L must be non-negative"
  msgstr ""
  
! #: fortran/io.c:2409 fortran/match.c:2634
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement not allowed in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:2443 fortran/io.c:2874
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT number in statement at %L must be non-negative"
  msgstr ""
  
! #: fortran/io.c:2475
  #, gcc-internal-format, gfc-internal-format
  msgid "FLUSH statement at %C"
  msgstr ""
  
! #: fortran/io.c:2530
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate UNIT specification at %C"
  msgstr ""
  
! #: fortran/io.c:2604
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate format specification at %C"
  msgstr ""
  
! #: fortran/io.c:2621
  #, gcc-internal-format
  msgid "Symbol %qs in namelist %qs is INTENT(IN) at %C"
  msgstr ""
  
! #: fortran/io.c:2657
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate NML specification at %C"
  msgstr ""
  
! #: fortran/io.c:2666
  #, gcc-internal-format
  msgid "Symbol %qs at %C must be a NAMELIST group name"
  msgstr ""
  
! #: fortran/io.c:2731
  #, gcc-internal-format, gfc-internal-format
  msgid "END tag at %C not allowed in output statement"
  msgstr ""
  
! #: fortran/io.c:2808
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT not specified at %L"
  msgstr ""
  
! #: fortran/io.c:2820
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "UNIT specification at %L must be an INTEGER expression or a CHARACTER "
  "variable"
  msgstr ""
  
! #: fortran/io.c:2842
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid form of WRITE statement at %L, UNIT required"
  msgstr ""
  
! #: fortran/io.c:2853
  #, gcc-internal-format, gfc-internal-format
  msgid "Internal unit with vector subscript at %L"
  msgstr ""
  
! #: fortran/io.c:2867
  #, gcc-internal-format, gfc-internal-format
  msgid "External IO UNIT cannot be an array at %L"
  msgstr ""
  
! #: fortran/io.c:2895
  #, gcc-internal-format
  msgid ""
  "NAMELIST %qs in READ statement at %L contains the symbol %qs which may not "
  "appear in a variable definition context"
  msgstr ""
  
! #: fortran/io.c:2905
  #, gcc-internal-format, gfc-internal-format
  msgid "Comma before i/o item list at %L"
  msgstr ""
  
! #: fortran/io.c:2915
  #, gcc-internal-format, gfc-internal-format
  msgid "ERR tag label %d at %L not defined"
  msgstr ""
  
! #: fortran/io.c:2927
  #, gcc-internal-format, gfc-internal-format
  msgid "END tag label %d at %L not defined"
  msgstr ""
  
! #: fortran/io.c:2939
  #, gcc-internal-format, gfc-internal-format
  msgid "EOR tag label %d at %L not defined"
  msgstr ""
  
! #: fortran/io.c:2949
  #, gcc-internal-format, gfc-internal-format
  msgid "FORMAT label %d at %L not defined"
  msgstr ""
  
! #: fortran/io.c:2980
  #, gcc-internal-format
  msgid "io_kind_name(): bad I/O-kind"
  msgstr ""
  
! #: fortran/io.c:3069
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in I/O iterator at %C"
  msgstr ""
  
! #: fortran/io.c:3100
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected variable in READ statement at %C"
  msgstr ""
  
! #: fortran/io.c:3106
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected expression in %s statement at %C"
  msgstr ""
  
  #. A general purpose syntax error.
! #: fortran/io.c:3163 fortran/io.c:3758 fortran/gfortran.h:2685
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in %s statement at %C"
  msgstr ""
  
! #: fortran/io.c:3247
  #, gcc-internal-format, gfc-internal-format
  msgid "Internal file at %L with namelist"
  msgstr ""
  
! #: fortran/io.c:3303
  #, gcc-internal-format, gfc-internal-format
  msgid "ASYNCHRONOUS= specifier at %L must be an initialization expression"
  msgstr ""
  
! #: fortran/io.c:3371
  #, gcc-internal-format, gfc-internal-format
  msgid "PAD= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:3437
  #, gcc-internal-format, gfc-internal-format
  msgid "DELIM= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:3586
  #, gcc-internal-format, gfc-internal-format
  msgid "PRINT namelist at %C is an extension"
  msgstr ""
  
! #: fortran/io.c:3729
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected comma in I/O list at %C"
  msgstr ""
  
! #: fortran/io.c:3792
  #, gcc-internal-format, gfc-internal-format
  msgid "PRINT statement at %C not allowed within PURE procedure"
  msgstr ""
  
! #: fortran/io.c:3951 fortran/io.c:4011
  #, gcc-internal-format, gfc-internal-format
  msgid "INQUIRE statement not allowed in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:3979
  #, gcc-internal-format, gfc-internal-format
  msgid "IOLENGTH tag invalid in INQUIRE statement at %C"
  msgstr ""
  
! #: fortran/io.c:3989 fortran/trans-io.c:1315
  #, gcc-internal-format, gfc-internal-format
  msgid "INQUIRE statement at %L cannot contain both FILE and UNIT specifiers"
  msgstr ""
  
! #: fortran/io.c:3996
  #, gcc-internal-format, gfc-internal-format
  msgid "INQUIRE statement at %L requires either FILE or UNIT specifier"
  msgstr ""
  
! #: fortran/io.c:4005
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT number in INQUIRE statement at %L can not be -1"
  msgstr ""
  
! #: fortran/io.c:4019
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "INQUIRE statement at %L requires a PENDING= specifier with the ID= specifier"
  msgstr ""
  
! #: fortran/io.c:4193
  #, gcc-internal-format, gfc-internal-format
  msgid "WAIT at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:4199
  #, gcc-internal-format, gfc-internal-format
  msgid "WAIT statement not allowed in PURE procedure at %C"
  msgstr ""
--- 48583,49011 ----
  msgid "Format statement in module main block at %C"
  msgstr ""
  
! #: fortran/io.c:1208
! #, gcc-internal-format, gfc-internal-format
! msgid "FORMAT statement at %C cannot appear within an INTERFACE"
! msgstr ""
! 
! #: fortran/io.c:1214
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing format label at %C"
  msgstr ""
  
! #: fortran/io.c:1262
! #, gcc-internal-format, gfc-internal-format
! msgid "IOMSG must be a scalar-default-char-variable at %L"
! msgstr ""
! 
! #: fortran/io.c:1276
! #, gcc-internal-format, gfc-internal-format
! msgid "%s requires a scalar-default-char-expr at %L"
! msgstr ""
! 
! #: fortran/io.c:1299 fortran/io.c:1330 fortran/io.c:1396
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid value for %s specification at %C"
  msgstr ""
  
! #: fortran/io.c:1305 fortran/io.c:1336
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate %s specification at %C"
  msgstr ""
  
! #: fortran/io.c:1343
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable %s cannot be INTENT(IN) at %C"
  msgstr ""
  
! #: fortran/io.c:1351
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable %s cannot be assigned in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:1402
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate %s label specification at %C"
  msgstr ""
  
! #: fortran/io.c:1422
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Constant expression in FORMAT tag at %L must be of type default CHARACTER"
  msgstr ""
  
! #: fortran/io.c:1440
  #, gcc-internal-format, gfc-internal-format
  msgid "FORMAT tag at %L must be of type default-kind CHARACTER or of INTEGER"
  msgstr ""
  
! #: fortran/io.c:1446
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSIGNED variable in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1451
  #, gcc-internal-format
  msgid "Variable %qs at %L has not been assigned a format label"
  msgstr ""
  
! #: fortran/io.c:1458
  #, gcc-internal-format
  msgid "Scalar %qs in FORMAT tag at %L is not an ASSIGNED variable"
  msgstr ""
  
! #: fortran/io.c:1470
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-character in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1476
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-character assumed shape array element in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1483
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-character assumed size array element in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1490
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-character pointer array element in FORMAT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1516
  #, gcc-internal-format, gfc-internal-format
  msgid "%s tag at %L must be of type %s"
  msgstr ""
  
! #: fortran/io.c:1523
  #, gcc-internal-format, gfc-internal-format
  msgid "%s tag at %L must be a character string of default kind"
  msgstr ""
  
! #: fortran/io.c:1530
  #, gcc-internal-format, gfc-internal-format
  msgid "%s tag at %L must be scalar"
  msgstr ""
  
! #: fortran/io.c:1536
  #, gcc-internal-format, gfc-internal-format
  msgid "IOMSG tag at %L"
  msgstr ""
  
! #: fortran/io.c:1544
  #, gcc-internal-format, gfc-internal-format
  msgid "Fortran 95 requires default INTEGER in %s tag at %L"
  msgstr ""
  
! #: fortran/io.c:1553
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-default LOGICAL kind in %s tag at %L"
  msgstr ""
  
! #: fortran/io.c:1560
  #, gcc-internal-format, gfc-internal-format
  msgid "NEWUNIT specifier at %L"
  msgstr ""
  
! #: fortran/io.c:1578
  #, gcc-internal-format, gfc-internal-format
  msgid "CONVERT tag at %L"
  msgstr ""
  
! #: fortran/io.c:1767
  #, gcc-internal-format
  msgid "Fortran 2003: %s specifier in %s statement at %C has value %qs"
  msgstr ""
  
! #: fortran/io.c:1775 fortran/io.c:1802
  #, gcc-internal-format
  msgid "%s specifier in %s statement at %C has value %qs"
  msgstr ""
  
! #: fortran/io.c:1794
  #, gcc-internal-format
  msgid "Extension: %s specifier in %s statement at %C has value %qs"
  msgstr ""
  
! #: fortran/io.c:1816 fortran/io.c:1824
  #, gcc-internal-format
  msgid "%s specifier in %s statement at %C has invalid value %qs"
  msgstr ""
  
! #: fortran/io.c:1877
  #, gcc-internal-format, gfc-internal-format
  msgid "OPEN statement not allowed in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:1890
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT specifier not allowed with NEWUNIT at %C"
  msgstr ""
  
! #: fortran/io.c:1898
  #, gcc-internal-format, gfc-internal-format
  msgid "NEWUNIT specifier must have FILE= or STATUS='scratch' at %C"
  msgstr ""
  
! #: fortran/io.c:1905
  #, gcc-internal-format, gfc-internal-format
  msgid "OPEN statement at %C must have UNIT or NEWUNIT specified"
  msgstr ""
  
! #: fortran/io.c:1943
  #, gcc-internal-format, gfc-internal-format
  msgid "ASYNCHRONOUS= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:1964 fortran/io.c:3459
  #, gcc-internal-format, gfc-internal-format
  msgid "BLANK= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:1985 fortran/io.c:3435
  #, gcc-internal-format, gfc-internal-format
  msgid "DECIMAL= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:2023
  #, gcc-internal-format, gfc-internal-format
  msgid "ENCODING= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:2086 fortran/io.c:3508
  #, gcc-internal-format, gfc-internal-format
  msgid "ROUND= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:2109
  #, gcc-internal-format, gfc-internal-format
  msgid "SIGN= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:2330
  #, gcc-internal-format, gfc-internal-format
  msgid "CLOSE statement not allowed in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:2392
  #, gcc-internal-format, gfc-internal-format
  msgid "CLOSE statement at %L requires a UNIT number"
  msgstr ""
  
! #: fortran/io.c:2400
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT number in CLOSE statement at %L must be non-negative"
  msgstr ""
  
! #: fortran/io.c:2498 fortran/match.c:2716
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement not allowed in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:2532
! #, gcc-internal-format, gfc-internal-format
! msgid "UNIT number missing in statement at %L"
! msgstr ""
! 
! #: fortran/io.c:2540 fortran/io.c:2977
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT number in statement at %L must be non-negative"
  msgstr ""
  
! #: fortran/io.c:2573
  #, gcc-internal-format, gfc-internal-format
  msgid "FLUSH statement at %C"
  msgstr ""
  
! #: fortran/io.c:2628
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate UNIT specification at %C"
  msgstr ""
  
! #: fortran/io.c:2702
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate format specification at %C"
  msgstr ""
  
! #: fortran/io.c:2719
  #, gcc-internal-format
  msgid "Symbol %qs in namelist %qs is INTENT(IN) at %C"
  msgstr ""
  
! #: fortran/io.c:2755
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate NML specification at %C"
  msgstr ""
  
! #: fortran/io.c:2764
  #, gcc-internal-format
  msgid "Symbol %qs at %C must be a NAMELIST group name"
  msgstr ""
  
! #: fortran/io.c:2834
  #, gcc-internal-format, gfc-internal-format
  msgid "END tag at %C not allowed in output statement"
  msgstr ""
  
! #: fortran/io.c:2911
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT not specified at %L"
  msgstr ""
  
! #: fortran/io.c:2923
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "UNIT specification at %L must be an INTEGER expression or a CHARACTER "
  "variable"
  msgstr ""
  
! #: fortran/io.c:2945
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid form of WRITE statement at %L, UNIT required"
  msgstr ""
  
! #: fortran/io.c:2956
  #, gcc-internal-format, gfc-internal-format
  msgid "Internal unit with vector subscript at %L"
  msgstr ""
  
! #: fortran/io.c:2970
  #, gcc-internal-format, gfc-internal-format
  msgid "External IO UNIT cannot be an array at %L"
  msgstr ""
  
! #: fortran/io.c:2998
  #, gcc-internal-format
  msgid ""
  "NAMELIST %qs in READ statement at %L contains the symbol %qs which may not "
  "appear in a variable definition context"
  msgstr ""
  
! #: fortran/io.c:3008
  #, gcc-internal-format, gfc-internal-format
  msgid "Comma before i/o item list at %L"
  msgstr ""
  
! #: fortran/io.c:3018
  #, gcc-internal-format, gfc-internal-format
  msgid "ERR tag label %d at %L not defined"
  msgstr ""
  
! #: fortran/io.c:3030
  #, gcc-internal-format, gfc-internal-format
  msgid "END tag label %d at %L not defined"
  msgstr ""
  
! #: fortran/io.c:3042
  #, gcc-internal-format, gfc-internal-format
  msgid "EOR tag label %d at %L not defined"
  msgstr ""
  
! #: fortran/io.c:3052
  #, gcc-internal-format, gfc-internal-format
  msgid "FORMAT label %d at %L not defined"
  msgstr ""
  
! #: fortran/io.c:3083
  #, gcc-internal-format
  msgid "io_kind_name(): bad I/O-kind"
  msgstr ""
  
! #: fortran/io.c:3172
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in I/O iterator at %C"
  msgstr ""
  
! #: fortran/io.c:3203
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected variable in READ statement at %C"
  msgstr ""
  
! #: fortran/io.c:3209
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected expression in %s statement at %C"
  msgstr ""
  
  #. A general purpose syntax error.
! #: fortran/io.c:3266 fortran/io.c:3884 fortran/gfortran.h:2687
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in %s statement at %C"
  msgstr ""
  
! #: fortran/io.c:3350
  #, gcc-internal-format, gfc-internal-format
  msgid "Internal file at %L with namelist"
  msgstr ""
  
! #: fortran/io.c:3406
  #, gcc-internal-format, gfc-internal-format
  msgid "ASYNCHRONOUS= specifier at %L must be an initialization expression"
  msgstr ""
  
! #: fortran/io.c:3484
  #, gcc-internal-format, gfc-internal-format
  msgid "PAD= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:3560
  #, gcc-internal-format, gfc-internal-format
  msgid "DELIM= at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:3712
  #, gcc-internal-format, gfc-internal-format
  msgid "PRINT namelist at %C is an extension"
  msgstr ""
  
! #: fortran/io.c:3855
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected comma in I/O list at %C"
  msgstr ""
  
! #: fortran/io.c:3918
  #, gcc-internal-format, gfc-internal-format
  msgid "PRINT statement at %C not allowed within PURE procedure"
  msgstr ""
  
! #: fortran/io.c:4081 fortran/io.c:4141
  #, gcc-internal-format, gfc-internal-format
  msgid "INQUIRE statement not allowed in PURE procedure at %C"
  msgstr ""
  
! #: fortran/io.c:4109
  #, gcc-internal-format, gfc-internal-format
  msgid "IOLENGTH tag invalid in INQUIRE statement at %C"
  msgstr ""
  
! #: fortran/io.c:4119 fortran/trans-io.c:1315
  #, gcc-internal-format, gfc-internal-format
  msgid "INQUIRE statement at %L cannot contain both FILE and UNIT specifiers"
  msgstr ""
  
! #: fortran/io.c:4126
  #, gcc-internal-format, gfc-internal-format
  msgid "INQUIRE statement at %L requires either FILE or UNIT specifier"
  msgstr ""
  
! #: fortran/io.c:4135
  #, gcc-internal-format, gfc-internal-format
  msgid "UNIT number in INQUIRE statement at %L can not be -1"
  msgstr ""
  
! #: fortran/io.c:4149
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "INQUIRE statement at %L requires a PENDING= specifier with the ID= specifier"
  msgstr ""
  
! #: fortran/io.c:4325
  #, gcc-internal-format, gfc-internal-format
  msgid "WAIT at %C not allowed in Fortran 95"
  msgstr ""
  
! #: fortran/io.c:4331
  #, gcc-internal-format, gfc-internal-format
  msgid "WAIT statement not allowed in PURE procedure at %C"
  msgstr ""
*************** msgstr ""
*** 48746,48752 ****
  msgid "Integer too large at %C"
  msgstr ""
  
! #: fortran/match.c:472 fortran/parse.c:946
  #, gcc-internal-format, gfc-internal-format
  msgid "Too many digits in statement label at %C"
  msgstr ""
--- 49030,49036 ----
  msgid "Integer too large at %C"
  msgstr ""
  
! #: fortran/match.c:472 fortran/parse.c:1015
  #, gcc-internal-format, gfc-internal-format
  msgid "Too many digits in statement label at %C"
  msgstr ""
*************** msgstr ""
*** 48766,49311 ****
  msgid "Duplicate construct label %qs at %C"
  msgstr ""
  
! #: fortran/match.c:548
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid character in name at %C"
  msgstr ""
  
! #: fortran/match.c:561
  #, gcc-internal-format, gfc-internal-format
  msgid "Name at %C is too long"
  msgstr ""
  
! #: fortran/match.c:572
  #, gcc-internal-format
  msgid ""
  "Invalid character %<$%> at %L. Use %<-fdollar-ok%> to allow it as an "
  "extension"
  msgstr ""
  
! #: fortran/match.c:891
  #, gcc-internal-format, gfc-internal-format
  msgid "Loop variable at %C cannot be a coarray"
  msgstr ""
  
! #: fortran/match.c:897
  #, gcc-internal-format, gfc-internal-format
  msgid "Loop variable at %C cannot be a sub-component"
  msgstr ""
  
! #: fortran/match.c:931
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected a step value in iterator at %C"
  msgstr ""
  
! #: fortran/match.c:943
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in iterator at %C"
  msgstr ""
  
! #: fortran/match.c:1111
  #, gcc-internal-format, gfc-internal-format
  msgid "gfc_match(): Bad match code %c"
  msgstr ""
  
! #: fortran/match.c:1184
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid form of PROGRAM statement at %C"
  msgstr ""
  
! #: fortran/match.c:1314 fortran/match.c:1394
  #, gcc-internal-format, gfc-internal-format
  msgid "Arithmetic IF statement at %C"
  msgstr ""
  
! #: fortran/match.c:1369
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in IF-expression at %C"
  msgstr ""
  
! #: fortran/match.c:1380
  #, gcc-internal-format, gfc-internal-format
  msgid "Block label not appropriate for arithmetic IF statement at %C"
  msgstr ""
  
! #: fortran/match.c:1417
  #, gcc-internal-format, gfc-internal-format
  msgid "Block label is not appropriate for IF statement at %C"
  msgstr ""
  
! #: fortran/match.c:1503
  #, gcc-internal-format, gfc-internal-format
  msgid "Cannot assign to a named constant at %C"
  msgstr ""
  
! #: fortran/match.c:1513
  #, gcc-internal-format, gfc-internal-format
  msgid "Unclassifiable statement in IF-clause at %C"
  msgstr ""
  
! #: fortran/match.c:1520
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in IF-clause at %C"
  msgstr ""
  
! #: fortran/match.c:1563
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected junk after ELSE statement at %C"
  msgstr ""
  
! #: fortran/match.c:1569 fortran/match.c:1604
  #, gcc-internal-format
  msgid "Label %qs at %C doesn't match IF label %qs"
  msgstr ""
  
! #: fortran/match.c:1598
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected junk after ELSE IF statement at %C"
  msgstr ""
  
! #: fortran/match.c:1662
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement CRITICAL at %C in PURE procedure"
  msgstr ""
  
! #: fortran/match.c:1668
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement CRITICAL at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:1675
  #, gcc-internal-format, gfc-internal-format
  msgid "CRITICAL statement at %C"
  msgstr ""
  
! #: fortran/match.c:1687
  #, gcc-internal-format, gfc-internal-format
  msgid "Nested CRITICAL block at %C"
  msgstr ""
  
! #: fortran/match.c:1739
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected association list at %C"
  msgstr ""
  
! #: fortran/match.c:1752
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected association at %C"
  msgstr ""
  
! #: fortran/match.c:1761
  #, gcc-internal-format
  msgid "Duplicate name %qs in association at %C"
  msgstr ""
  
! #: fortran/match.c:1769
  #, gcc-internal-format, gfc-internal-format
  msgid "Association target at %C must not be coindexed"
  msgstr ""
  
! #: fortran/match.c:1787
  #, gcc-internal-format
  msgid "Expected %<)%> or %<,%> at %C"
  msgstr ""
  
! #: fortran/match.c:1805
  #, gcc-internal-format, gfc-internal-format
  msgid "Junk after ASSOCIATE statement at %C"
  msgstr ""
  
! #: fortran/match.c:1874
  #, gcc-internal-format
  msgid "Derived type %qs at %L may not be ABSTRACT"
  msgstr ""
  
! #: fortran/match.c:1937
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid type-spec at %C"
  msgstr ""
  
! #: fortran/match.c:2031
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in FORALL iterator at %C"
  msgstr ""
  
! #: fortran/match.c:2296
  #, gcc-internal-format, gfc-internal-format
  msgid "DO CONCURRENT construct at %C"
  msgstr ""
  
! #: fortran/match.c:2421
  #, gcc-internal-format
  msgid "Name %qs in %s statement at %C is unknown"
  msgstr ""
  
! #: fortran/match.c:2429
  #, gcc-internal-format
  msgid "Name %qs in %s statement at %C is not a construct name"
  msgstr ""
  
! #: fortran/match.c:2441
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C leaves CRITICAL construct"
  msgstr ""
  
  #. F2008, C821 & C845.
! #: fortran/match.c:2449
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C leaves DO CONCURRENT construct"
  msgstr ""
  
! #: fortran/match.c:2461
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C is not within a construct"
  msgstr ""
  
! #: fortran/match.c:2464
  #, gcc-internal-format
  msgid "%s statement at %C is not within construct %qs"
  msgstr ""
  
! #: fortran/match.c:2489
  #, gcc-internal-format
  msgid "CYCLE statement at %C is not applicable to non-loop construct %qs"
  msgstr ""
  
! #: fortran/match.c:2494
  #, gcc-internal-format, gfc-internal-format
  msgid "EXIT statement with no do-construct-name at %C"
  msgstr ""
  
! #: fortran/match.c:2500
  #, gcc-internal-format
  msgid "%s statement at %C is not applicable to construct %qs"
  msgstr ""
  
! #: fortran/match.c:2508
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C leaving OpenACC structured block"
  msgstr ""
  
! #: fortran/match.c:2533
  #, gcc-internal-format, gfc-internal-format
  msgid "EXIT statement at %C terminating !$ACC LOOP loop"
  msgstr ""
  
! #: fortran/match.c:2538
  #, gcc-internal-format, gfc-internal-format
  msgid "CYCLE statement at %C to non-innermost collapsed !$ACC LOOP loop"
  msgstr ""
  
! #: fortran/match.c:2563
  #, gcc-internal-format, gfc-internal-format
  msgid "EXIT statement at %C terminating !$OMP DO loop"
  msgstr ""
  
! #: fortran/match.c:2568
  #, gcc-internal-format, gfc-internal-format
  msgid "CYCLE statement at %C to non-innermost collapsed !$OMP DO loop"
  msgstr ""
  
! #: fortran/match.c:2628
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C in PURE procedure"
  msgstr ""
  
! #: fortran/match.c:2644
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement STOP at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:2649
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement STOP at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:2657
  #, gcc-internal-format, gfc-internal-format
  msgid "STOP code at %L must be either INTEGER or CHARACTER type"
  msgstr ""
  
! #: fortran/match.c:2664
  #, gcc-internal-format, gfc-internal-format
  msgid "STOP code at %L must be scalar"
  msgstr ""
  
! #: fortran/match.c:2672
  #, gcc-internal-format, gfc-internal-format
  msgid "STOP code at %L must be default character KIND=%d"
  msgstr ""
  
! #: fortran/match.c:2680
  #, gcc-internal-format, gfc-internal-format
  msgid "STOP code at %L must be default integer KIND=%d"
  msgstr ""
  
! #: fortran/match.c:2726
  #, gcc-internal-format, gfc-internal-format
  msgid "PAUSE statement at %C"
  msgstr ""
  
! #: fortran/match.c:2747
  #, gcc-internal-format, gfc-internal-format
  msgid "ERROR STOP statement at %C"
  msgstr ""
  
! #: fortran/match.c:2772
  #, gcc-internal-format, gfc-internal-format
! msgid "Image control statement %s at %C in PURE procedure"
  msgstr ""
  
! #: fortran/match.c:2787
  #, gcc-internal-format, gfc-internal-format
! msgid "Image control statement %s at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:2794
  #, gcc-internal-format, gfc-internal-format
! msgid "Image control statement %s at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:2824 fortran/match.c:3036 fortran/match.c:3546
! #: fortran/match.c:3883
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant STAT tag found at %L "
  msgstr ""
  
! #: fortran/match.c:2845 fortran/match.c:3056 fortran/match.c:3572
! #: fortran/match.c:3908
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant ERRMSG tag found at %L "
  msgstr ""
  
! #: fortran/match.c:2866
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant ACQUIRED_LOCK tag found at %L "
  msgstr ""
  
! #: fortran/match.c:2931
  #, gcc-internal-format, gfc-internal-format
  msgid "LOCK statement at %C"
  msgstr ""
  
! #: fortran/match.c:2941
  #, gcc-internal-format, gfc-internal-format
  msgid "UNLOCK statement at %C"
  msgstr ""
  
! #: fortran/match.c:2966
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement SYNC at %C in PURE procedure"
  msgstr ""
  
! #: fortran/match.c:2972
  #, gcc-internal-format, gfc-internal-format
  msgid "SYNC statement at %C"
  msgstr ""
  
! #: fortran/match.c:2984
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement SYNC at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:2990
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement SYNC at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:3170
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSIGN statement at %C"
  msgstr ""
  
! #: fortran/match.c:3214
  #, gcc-internal-format, gfc-internal-format
  msgid "Assigned GOTO statement at %C"
  msgstr ""
  
! #: fortran/match.c:3258 fortran/match.c:3309
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement label list in GOTO at %C cannot be empty"
  msgstr ""
  
! #: fortran/match.c:3319
  #, gcc-internal-format, gfc-internal-format
  msgid "Computed GOTO at %C"
  msgstr ""
  
! #: fortran/match.c:3391
  #, gcc-internal-format, gfc-internal-format
  msgid "Error in type-spec at %L"
  msgstr ""
  
! #: fortran/match.c:3401
  #, gcc-internal-format, gfc-internal-format
  msgid "typespec in ALLOCATE at %L"
  msgstr ""
  
! #: fortran/match.c:3444
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad allocate-object at %C for a PURE procedure"
  msgstr ""
  
! #: fortran/match.c:3468
  #, gcc-internal-format, gfc-internal-format
  msgid "ALLOCATE of coarray at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:3473
  #, gcc-internal-format, gfc-internal-format
  msgid "ALLOCATE of coarray at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:3495
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocate-object at %L is neither a data pointer nor an allocatable variable"
  msgstr ""
  
! #: fortran/match.c:3507
  #, gcc-internal-format, gfc-internal-format
  msgid "Type of entity at %L is type incompatible with typespec"
  msgstr ""
  
! #: fortran/match.c:3515
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Kind type parameter for entity at %L differs from the kind type parameter of "
  "the typespec"
  msgstr ""
  
! #: fortran/match.c:3529
  #, gcc-internal-format, gfc-internal-format
  msgid "Shape specification for allocatable scalar at %C"
  msgstr ""
  
! #: fortran/match.c:3566
  #, gcc-internal-format, gfc-internal-format
  msgid "ERRMSG tag at %L"
  msgstr ""
  
! #: fortran/match.c:3589
  #, gcc-internal-format, gfc-internal-format
  msgid "SOURCE tag at %L"
  msgstr ""
  
! #: fortran/match.c:3595
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant SOURCE tag found at %L "
  msgstr ""
  
! #: fortran/match.c:3602
  #, gcc-internal-format, gfc-internal-format
  msgid "SOURCE tag at %L conflicts with the typespec at %L"
  msgstr ""
  
! #: fortran/match.c:3608
  #, gcc-internal-format, gfc-internal-format
  msgid "SOURCE tag at %L with more than a single allocate object"
  msgstr ""
  
! #: fortran/match.c:3626
  #, gcc-internal-format, gfc-internal-format
  msgid "MOLD tag at %L"
  msgstr ""
  
! #: fortran/match.c:3632
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant MOLD tag found at %L "
  msgstr ""
  
! #: fortran/match.c:3639
  #, gcc-internal-format, gfc-internal-format
  msgid "MOLD tag at %L conflicts with the typespec at %L"
  msgstr ""
  
! #: fortran/match.c:3665
  #, gcc-internal-format, gfc-internal-format
  msgid "MOLD tag at %L conflicts with SOURCE tag at %L"
  msgstr ""
  
! #: fortran/match.c:3673
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocate-object at %L with a deferred type parameter requires either a type-"
  "spec or SOURCE tag or a MOLD tag"
  msgstr ""
  
! #: fortran/match.c:3685
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Unlimited polymorphic allocate-object at %L requires either a type-spec or "
  "SOURCE tag or a MOLD tag"
  msgstr ""
  
! #: fortran/match.c:3747
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer object at %C shall not be coindexed"
  msgstr ""
  
! #: fortran/match.c:3833
  #, gcc-internal-format, gfc-internal-format
  msgid "Illegal allocate-object at %C for a PURE procedure"
  msgstr ""
  
! #: fortran/match.c:3843
  #, gcc-internal-format, gfc-internal-format
  msgid "DEALLOCATE of coarray at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:3850
  #, gcc-internal-format, gfc-internal-format
  msgid "DEALLOCATE of coarray at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:3866
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocate-object at %C is not a nonprocedure pointer nor an allocatable "
  "variable"
  msgstr ""
  
! #: fortran/match.c:3903
  #, gcc-internal-format, gfc-internal-format
  msgid "ERRMSG at %L"
  msgstr ""
  
! #: fortran/match.c:3960
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement RETURN at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:3966
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement RETURN at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:3975
  #, gcc-internal-format, gfc-internal-format
  msgid "Alternate RETURN statement at %C is only allowed within a SUBROUTINE"
  msgstr ""
  
! #: fortran/match.c:4006
  #, gcc-internal-format, gfc-internal-format
  msgid "RETURN statement in main program at %C"
  msgstr ""
  
! #: fortran/match.c:4034
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected component reference at %C"
  msgstr ""
  
! #: fortran/match.c:4043
  #, gcc-internal-format, gfc-internal-format
  msgid "Junk after CALL at %C"
  msgstr ""
  
! #: fortran/match.c:4054
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected type-bound procedure or procedure pointer component at %C"
  msgstr ""
  
! #: fortran/match.c:4275
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in common block name at %C"
  msgstr ""
--- 49050,49647 ----
  msgid "Duplicate construct label %qs at %C"
  msgstr ""
  
! #: fortran/match.c:551
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid character in name at %C"
  msgstr ""
  
! #: fortran/match.c:564
  #, gcc-internal-format, gfc-internal-format
  msgid "Name at %C is too long"
  msgstr ""
  
! #: fortran/match.c:575
  #, gcc-internal-format
  msgid ""
  "Invalid character %<$%> at %L. Use %<-fdollar-ok%> to allow it as an "
  "extension"
  msgstr ""
  
! #: fortran/match.c:894
  #, gcc-internal-format, gfc-internal-format
  msgid "Loop variable at %C cannot be a coarray"
  msgstr ""
  
! #: fortran/match.c:900
  #, gcc-internal-format, gfc-internal-format
  msgid "Loop variable at %C cannot be a sub-component"
  msgstr ""
  
! #: fortran/match.c:934
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected a step value in iterator at %C"
  msgstr ""
  
! #: fortran/match.c:946
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in iterator at %C"
  msgstr ""
  
! #: fortran/match.c:1114
  #, gcc-internal-format, gfc-internal-format
  msgid "gfc_match(): Bad match code %c"
  msgstr ""
  
! #: fortran/match.c:1187
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid form of PROGRAM statement at %C"
  msgstr ""
  
! #: fortran/match.c:1317 fortran/match.c:1397
  #, gcc-internal-format, gfc-internal-format
  msgid "Arithmetic IF statement at %C"
  msgstr ""
  
! #: fortran/match.c:1372
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in IF-expression at %C"
  msgstr ""
  
! #: fortran/match.c:1383
  #, gcc-internal-format, gfc-internal-format
  msgid "Block label not appropriate for arithmetic IF statement at %C"
  msgstr ""
  
! #: fortran/match.c:1420
  #, gcc-internal-format, gfc-internal-format
  msgid "Block label is not appropriate for IF statement at %C"
  msgstr ""
  
! #: fortran/match.c:1508
  #, gcc-internal-format, gfc-internal-format
  msgid "Cannot assign to a named constant at %C"
  msgstr ""
  
! #: fortran/match.c:1518
  #, gcc-internal-format, gfc-internal-format
  msgid "Unclassifiable statement in IF-clause at %C"
  msgstr ""
  
! #: fortran/match.c:1525
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in IF-clause at %C"
  msgstr ""
  
! #: fortran/match.c:1568
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected junk after ELSE statement at %C"
  msgstr ""
  
! #: fortran/match.c:1574 fortran/match.c:1609
  #, gcc-internal-format
  msgid "Label %qs at %C doesn't match IF label %qs"
  msgstr ""
  
! #: fortran/match.c:1603
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected junk after ELSE IF statement at %C"
  msgstr ""
  
! #: fortran/match.c:1667
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement CRITICAL at %C in PURE procedure"
  msgstr ""
  
! #: fortran/match.c:1673
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement CRITICAL at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:1680
  #, gcc-internal-format, gfc-internal-format
  msgid "CRITICAL statement at %C"
  msgstr ""
  
! #: fortran/match.c:1692
  #, gcc-internal-format, gfc-internal-format
  msgid "Nested CRITICAL block at %C"
  msgstr ""
  
! #: fortran/match.c:1744
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected association list at %C"
  msgstr ""
  
! #: fortran/match.c:1757
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected association at %C"
  msgstr ""
  
! #: fortran/match.c:1766
  #, gcc-internal-format
  msgid "Duplicate name %qs in association at %C"
  msgstr ""
  
! #: fortran/match.c:1774
  #, gcc-internal-format, gfc-internal-format
  msgid "Association target at %C must not be coindexed"
  msgstr ""
  
! #: fortran/match.c:1792
  #, gcc-internal-format
  msgid "Expected %<)%> or %<,%> at %C"
  msgstr ""
  
! #: fortran/match.c:1810
  #, gcc-internal-format, gfc-internal-format
  msgid "Junk after ASSOCIATE statement at %C"
  msgstr ""
  
! #: fortran/match.c:1879
  #, gcc-internal-format
  msgid "Derived type %qs at %L may not be ABSTRACT"
  msgstr ""
  
! #: fortran/match.c:1942
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid type-spec at %C"
  msgstr ""
  
! #: fortran/match.c:2041
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in FORALL iterator at %C"
  msgstr ""
  
! #: fortran/match.c:2306
  #, gcc-internal-format, gfc-internal-format
  msgid "DO CONCURRENT construct at %C"
  msgstr ""
  
! #: fortran/match.c:2431
  #, gcc-internal-format
  msgid "Name %qs in %s statement at %C is unknown"
  msgstr ""
  
! #: fortran/match.c:2439
  #, gcc-internal-format
  msgid "Name %qs in %s statement at %C is not a construct name"
  msgstr ""
  
! #: fortran/match.c:2451
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C leaves CRITICAL construct"
  msgstr ""
  
  #. F2008, C821 & C845.
! #: fortran/match.c:2459
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C leaves DO CONCURRENT construct"
  msgstr ""
  
! #: fortran/match.c:2471
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C is not within a construct"
  msgstr ""
  
! #: fortran/match.c:2474
  #, gcc-internal-format
  msgid "%s statement at %C is not within construct %qs"
  msgstr ""
  
! #: fortran/match.c:2499
  #, gcc-internal-format
  msgid "CYCLE statement at %C is not applicable to non-loop construct %qs"
  msgstr ""
  
! #: fortran/match.c:2504
  #, gcc-internal-format, gfc-internal-format
  msgid "EXIT statement with no do-construct-name at %C"
  msgstr ""
  
! #: fortran/match.c:2510
  #, gcc-internal-format
  msgid "%s statement at %C is not applicable to construct %qs"
  msgstr ""
  
! #: fortran/match.c:2518
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C leaving OpenACC structured block"
  msgstr ""
  
! #: fortran/match.c:2543
  #, gcc-internal-format, gfc-internal-format
  msgid "EXIT statement at %C terminating !$ACC LOOP loop"
  msgstr ""
  
! #: fortran/match.c:2548
  #, gcc-internal-format, gfc-internal-format
  msgid "CYCLE statement at %C to non-innermost collapsed !$ACC LOOP loop"
  msgstr ""
  
! #: fortran/match.c:2573
  #, gcc-internal-format, gfc-internal-format
  msgid "EXIT statement at %C terminating !$OMP DO loop"
  msgstr ""
  
! #: fortran/match.c:2578
  #, gcc-internal-format, gfc-internal-format
  msgid "CYCLE statement at %C to non-innermost collapsed !$OMP DO loop"
  msgstr ""
  
! #: fortran/match.c:2665
! #, gcc-internal-format, gfc-internal-format
! msgid "Blank required in %s statement near %C"
! msgstr ""
! 
! #: fortran/match.c:2683
! #, gcc-internal-format, gfc-internal-format
! msgid "STOP code at %C cannot be negative"
! msgstr ""
! 
! #: fortran/match.c:2689
! #, gcc-internal-format, gfc-internal-format
! msgid "STOP code at %C contains too many digits"
! msgstr ""
! 
! #: fortran/match.c:2710
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C in PURE procedure"
  msgstr ""
  
! #: fortran/match.c:2726
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement STOP at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:2731
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement STOP at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:2742
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "STOP code at %L must be a scalar CHARACTER constant or "
! "digit[digit[digit[digit[digit]]]]"
! msgstr ""
! 
! #: fortran/match.c:2755
  #, gcc-internal-format, gfc-internal-format
  msgid "STOP code at %L must be either INTEGER or CHARACTER type"
  msgstr ""
  
! #: fortran/match.c:2762
  #, gcc-internal-format, gfc-internal-format
  msgid "STOP code at %L must be scalar"
  msgstr ""
  
! #: fortran/match.c:2769
  #, gcc-internal-format, gfc-internal-format
  msgid "STOP code at %L must be default character KIND=%d"
  msgstr ""
  
! #: fortran/match.c:2776
  #, gcc-internal-format, gfc-internal-format
  msgid "STOP code at %L must be default integer KIND=%d"
  msgstr ""
  
! #: fortran/match.c:2824
  #, gcc-internal-format, gfc-internal-format
  msgid "PAUSE statement at %C"
  msgstr ""
  
! #: fortran/match.c:2845
  #, gcc-internal-format, gfc-internal-format
  msgid "ERROR STOP statement at %C"
  msgstr ""
  
! #: fortran/match.c:2871
  #, gcc-internal-format, gfc-internal-format
! msgid "Image control statement EVENT %s at %C in PURE procedure"
  msgstr ""
  
! #: fortran/match.c:2886
  #, gcc-internal-format, gfc-internal-format
! msgid "Image control statement EVENT %s at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:2893
  #, gcc-internal-format, gfc-internal-format
! msgid "Image control statement EVENT %s at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:2923 fortran/match.c:3118 fortran/match.c:3330
! #: fortran/match.c:3840 fortran/match.c:4177
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant STAT tag found at %L "
  msgstr ""
  
! #: fortran/match.c:2944 fortran/match.c:3139 fortran/match.c:3350
! #: fortran/match.c:3866 fortran/match.c:4202
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant ERRMSG tag found at %L "
  msgstr ""
  
! #: fortran/match.c:2965
! #, gcc-internal-format, gfc-internal-format
! msgid "Redundant UNTIL_COUNT tag found at %L "
! msgstr ""
! 
! #: fortran/match.c:3031
! #, gcc-internal-format, gfc-internal-format
! msgid "EVENT POST statement at %C"
! msgstr ""
! 
! #: fortran/match.c:3041
! #, gcc-internal-format, gfc-internal-format
! msgid "EVENT WAIT statement at %C"
! msgstr ""
! 
! #: fortran/match.c:3066
! #, gcc-internal-format, gfc-internal-format
! msgid "Image control statement %s at %C in PURE procedure"
! msgstr ""
! 
! #: fortran/match.c:3081
! #, gcc-internal-format, gfc-internal-format
! msgid "Image control statement %s at %C in CRITICAL block"
! msgstr ""
! 
! #: fortran/match.c:3088
! #, gcc-internal-format, gfc-internal-format
! msgid "Image control statement %s at %C in DO CONCURRENT block"
! msgstr ""
! 
! #: fortran/match.c:3160
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant ACQUIRED_LOCK tag found at %L "
  msgstr ""
  
! #: fortran/match.c:3225
  #, gcc-internal-format, gfc-internal-format
  msgid "LOCK statement at %C"
  msgstr ""
  
! #: fortran/match.c:3235
  #, gcc-internal-format, gfc-internal-format
  msgid "UNLOCK statement at %C"
  msgstr ""
  
! #: fortran/match.c:3260
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement SYNC at %C in PURE procedure"
  msgstr ""
  
! #: fortran/match.c:3266
  #, gcc-internal-format, gfc-internal-format
  msgid "SYNC statement at %C"
  msgstr ""
  
! #: fortran/match.c:3278
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement SYNC at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:3284
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement SYNC at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:3464
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSIGN statement at %C"
  msgstr ""
  
! #: fortran/match.c:3508
  #, gcc-internal-format, gfc-internal-format
  msgid "Assigned GOTO statement at %C"
  msgstr ""
  
! #: fortran/match.c:3552 fortran/match.c:3603
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement label list in GOTO at %C cannot be empty"
  msgstr ""
  
! #: fortran/match.c:3613
  #, gcc-internal-format, gfc-internal-format
  msgid "Computed GOTO at %C"
  msgstr ""
  
! #: fortran/match.c:3685
  #, gcc-internal-format, gfc-internal-format
  msgid "Error in type-spec at %L"
  msgstr ""
  
! #: fortran/match.c:3695
  #, gcc-internal-format, gfc-internal-format
  msgid "typespec in ALLOCATE at %L"
  msgstr ""
  
! #: fortran/match.c:3738
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad allocate-object at %C for a PURE procedure"
  msgstr ""
  
! #: fortran/match.c:3762
  #, gcc-internal-format, gfc-internal-format
  msgid "ALLOCATE of coarray at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:3767
  #, gcc-internal-format, gfc-internal-format
  msgid "ALLOCATE of coarray at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:3789
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocate-object at %L is neither a data pointer nor an allocatable variable"
  msgstr ""
  
! #: fortran/match.c:3801
  #, gcc-internal-format, gfc-internal-format
  msgid "Type of entity at %L is type incompatible with typespec"
  msgstr ""
  
! #: fortran/match.c:3809
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Kind type parameter for entity at %L differs from the kind type parameter of "
  "the typespec"
  msgstr ""
  
! #: fortran/match.c:3823
  #, gcc-internal-format, gfc-internal-format
  msgid "Shape specification for allocatable scalar at %C"
  msgstr ""
  
! #: fortran/match.c:3860
  #, gcc-internal-format, gfc-internal-format
  msgid "ERRMSG tag at %L"
  msgstr ""
  
! #: fortran/match.c:3883
  #, gcc-internal-format, gfc-internal-format
  msgid "SOURCE tag at %L"
  msgstr ""
  
! #: fortran/match.c:3889
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant SOURCE tag found at %L "
  msgstr ""
  
! #: fortran/match.c:3896
  #, gcc-internal-format, gfc-internal-format
  msgid "SOURCE tag at %L conflicts with the typespec at %L"
  msgstr ""
  
! #: fortran/match.c:3902
  #, gcc-internal-format, gfc-internal-format
  msgid "SOURCE tag at %L with more than a single allocate object"
  msgstr ""
  
! #: fortran/match.c:3920
  #, gcc-internal-format, gfc-internal-format
  msgid "MOLD tag at %L"
  msgstr ""
  
! #: fortran/match.c:3926
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant MOLD tag found at %L "
  msgstr ""
  
! #: fortran/match.c:3933
  #, gcc-internal-format, gfc-internal-format
  msgid "MOLD tag at %L conflicts with the typespec at %L"
  msgstr ""
  
! #: fortran/match.c:3959
  #, gcc-internal-format, gfc-internal-format
  msgid "MOLD tag at %L conflicts with SOURCE tag at %L"
  msgstr ""
  
! #: fortran/match.c:3967
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocate-object at %L with a deferred type parameter requires either a type-"
  "spec or SOURCE tag or a MOLD tag"
  msgstr ""
  
! #: fortran/match.c:3979
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Unlimited polymorphic allocate-object at %L requires either a type-spec or "
  "SOURCE tag or a MOLD tag"
  msgstr ""
  
! #: fortran/match.c:4041
  #, gcc-internal-format, gfc-internal-format
  msgid "Pointer object at %C shall not be coindexed"
  msgstr ""
  
! #: fortran/match.c:4127
  #, gcc-internal-format, gfc-internal-format
  msgid "Illegal allocate-object at %C for a PURE procedure"
  msgstr ""
  
! #: fortran/match.c:4137
  #, gcc-internal-format, gfc-internal-format
  msgid "DEALLOCATE of coarray at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:4144
  #, gcc-internal-format, gfc-internal-format
  msgid "DEALLOCATE of coarray at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:4160
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocate-object at %C is not a nonprocedure pointer nor an allocatable "
  "variable"
  msgstr ""
  
! #: fortran/match.c:4197
  #, gcc-internal-format, gfc-internal-format
  msgid "ERRMSG at %L"
  msgstr ""
  
! #: fortran/match.c:4254
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement RETURN at %C in CRITICAL block"
  msgstr ""
  
! #: fortran/match.c:4260
  #, gcc-internal-format, gfc-internal-format
  msgid "Image control statement RETURN at %C in DO CONCURRENT block"
  msgstr ""
  
! #: fortran/match.c:4269
  #, gcc-internal-format, gfc-internal-format
  msgid "Alternate RETURN statement at %C is only allowed within a SUBROUTINE"
  msgstr ""
  
! #: fortran/match.c:4300
  #, gcc-internal-format, gfc-internal-format
  msgid "RETURN statement in main program at %C"
  msgstr ""
  
! #: fortran/match.c:4328
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected component reference at %C"
  msgstr ""
  
! #: fortran/match.c:4337
  #, gcc-internal-format, gfc-internal-format
  msgid "Junk after CALL at %C"
  msgstr ""
  
! #: fortran/match.c:4348
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected type-bound procedure or procedure pointer component at %C"
  msgstr ""
  
! #: fortran/match.c:4569
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in common block name at %C"
  msgstr ""
*************** msgstr ""
*** 49313,49471 ****
  #. If we find an error, just print it and continue,
  #. cause it's just semantic, and we can see if there
  #. are more errors.
! #: fortran/match.c:4353
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L in common block '%s' at %C must be declared with a C "
  "interoperable kind since common block '%s' is bind(c)"
  msgstr ""
  
! #: fortran/match.c:4362
  #, gcc-internal-format
  msgid ""
  "Variable %qs in common block %qs at %C can not be bind(c) since it is not "
  "global"
  msgstr ""
  
! #: fortran/match.c:4369
  #, gcc-internal-format
  msgid "Symbol %qs at %C is already in a COMMON block"
  msgstr ""
  
! #: fortran/match.c:4377
  #, gcc-internal-format
  msgid "Initialized symbol %qs at %C can only be COMMON in BLOCK DATA"
  msgstr ""
  
! #: fortran/match.c:4403
  #, gcc-internal-format
  msgid "Array specification for symbol %qs in COMMON at %C must be explicit"
  msgstr ""
  
! #: fortran/match.c:4413
  #, gcc-internal-format
  msgid "Symbol %qs in COMMON at %C cannot be a POINTER array"
  msgstr ""
  
! #: fortran/match.c:4445
  #, gcc-internal-format
  msgid ""
  "Symbol %qs, in COMMON block %qs at %C is being indirectly equivalenced to "
  "another COMMON block %qs"
  msgstr ""
  
! #: fortran/match.c:4573
  #, gcc-internal-format
  msgid "Namelist group name %qs at %C already has a basic type of %s"
  msgstr ""
  
! #: fortran/match.c:4581
  #, gcc-internal-format
  msgid ""
  "Namelist group name %qs at %C already is USE associated and cannot be "
  "respecified."
  msgstr ""
  
! #: fortran/match.c:4607
  #, gcc-internal-format
  msgid "Assumed size array %qs in namelist %qs at %C is not allowed"
  msgstr ""
  
! #: fortran/match.c:4741
  #, gcc-internal-format, gfc-internal-format
  msgid "Derived type component %C is not a permitted EQUIVALENCE member"
  msgstr ""
  
! #: fortran/match.c:4749
  #, gcc-internal-format, gfc-internal-format
  msgid "Array reference in EQUIVALENCE at %C cannot be an array section"
  msgstr ""
  
! #: fortran/match.c:4777
  #, gcc-internal-format, gfc-internal-format
  msgid "EQUIVALENCE at %C requires two or more objects"
  msgstr ""
  
! #: fortran/match.c:4791
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Attempt to indirectly overlap COMMON blocks %s and %s by EQUIVALENCE at %C"
  msgstr ""
  
! #: fortran/match.c:4804
  #, gcc-internal-format, gfc-internal-format
  msgid "Expecting a comma in EQUIVALENCE at %C"
  msgstr ""
  
! #: fortran/match.c:4922
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement function at %L is recursive"
  msgstr ""
  
! #: fortran/match.c:4928
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement function at %C"
  msgstr ""
  
! #: fortran/match.c:5013
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected initialization expression in CASE at %C"
  msgstr ""
  
! #: fortran/match.c:5045
  #, gcc-internal-format
  msgid "Expected block name %qs of SELECT construct at %C"
  msgstr ""
  
! #: fortran/match.c:5325
  #, gcc-internal-format, gfc-internal-format
  msgid "parse error in SELECT TYPE statement at %C"
  msgstr ""
  
! #: fortran/match.c:5349
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Selector in SELECT TYPE at %C is not a named variable; use associate-name=>"
  msgstr ""
  
! #: fortran/match.c:5383
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected CASE statement at %C"
  msgstr ""
  
! #: fortran/match.c:5435
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in CASE specification at %C"
  msgstr ""
  
! #: fortran/match.c:5453
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected TYPE IS statement at %C"
  msgstr ""
  
! #: fortran/match.c:5485
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The type-spec shall not specify a sequence derived type or a type with the "
  "BIND attribute in SELECT TYPE at %C [F2003:C815]"
  msgstr ""
  
! #: fortran/match.c:5497
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in TYPE IS specification at %C"
  msgstr ""
  
! #: fortran/match.c:5573
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in CLASS IS specification at %C"
  msgstr ""
  
! #: fortran/match.c:5691
  #, gcc-internal-format, gfc-internal-format
  msgid "ELSEWHERE statement at %C not enclosed in WHERE block"
  msgstr ""
  
! #: fortran/match.c:5729
  #, gcc-internal-format
  msgid "Label %qs at %C doesn't match WHERE label %qs"
  msgstr ""
--- 49649,49817 ----
  #. If we find an error, just print it and continue,
  #. cause it's just semantic, and we can see if there
  #. are more errors.
! #: fortran/match.c:4647
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable '%s' at %L in common block '%s' at %C must be declared with a C "
  "interoperable kind since common block '%s' is bind(c)"
  msgstr ""
  
! #: fortran/match.c:4656
  #, gcc-internal-format
  msgid ""
  "Variable %qs in common block %qs at %C can not be bind(c) since it is not "
  "global"
  msgstr ""
  
! #: fortran/match.c:4663
  #, gcc-internal-format
  msgid "Symbol %qs at %C is already in a COMMON block"
  msgstr ""
  
! #: fortran/match.c:4671
  #, gcc-internal-format
  msgid "Initialized symbol %qs at %C can only be COMMON in BLOCK DATA"
  msgstr ""
  
! #: fortran/match.c:4697
  #, gcc-internal-format
  msgid "Array specification for symbol %qs in COMMON at %C must be explicit"
  msgstr ""
  
! #: fortran/match.c:4707
  #, gcc-internal-format
  msgid "Symbol %qs in COMMON at %C cannot be a POINTER array"
  msgstr ""
  
! #: fortran/match.c:4739
  #, gcc-internal-format
  msgid ""
  "Symbol %qs, in COMMON block %qs at %C is being indirectly equivalenced to "
  "another COMMON block %qs"
  msgstr ""
  
! #: fortran/match.c:4867
  #, gcc-internal-format
  msgid "Namelist group name %qs at %C already has a basic type of %s"
  msgstr ""
  
! #: fortran/match.c:4875
  #, gcc-internal-format
  msgid ""
  "Namelist group name %qs at %C already is USE associated and cannot be "
  "respecified."
  msgstr ""
  
! #: fortran/match.c:4901
  #, gcc-internal-format
  msgid "Assumed size array %qs in namelist %qs at %C is not allowed"
  msgstr ""
  
! #: fortran/match.c:5035
  #, gcc-internal-format, gfc-internal-format
  msgid "Derived type component %C is not a permitted EQUIVALENCE member"
  msgstr ""
  
! #: fortran/match.c:5043
  #, gcc-internal-format, gfc-internal-format
  msgid "Array reference in EQUIVALENCE at %C cannot be an array section"
  msgstr ""
  
! #: fortran/match.c:5071
  #, gcc-internal-format, gfc-internal-format
  msgid "EQUIVALENCE at %C requires two or more objects"
  msgstr ""
  
! #: fortran/match.c:5085
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Attempt to indirectly overlap COMMON blocks %s and %s by EQUIVALENCE at %C"
  msgstr ""
  
! #: fortran/match.c:5098
  #, gcc-internal-format, gfc-internal-format
  msgid "Expecting a comma in EQUIVALENCE at %C"
  msgstr ""
  
! #: fortran/match.c:5216
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement function at %L is recursive"
  msgstr ""
  
! #: fortran/match.c:5226
! #, gcc-internal-format, gfc-internal-format
! msgid "Statement function at %L cannot appear within an INTERFACE"
! msgstr ""
! 
! #: fortran/match.c:5231
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement function at %C"
  msgstr ""
  
! #: fortran/match.c:5296 fortran/match.c:5312
! #, gcc-internal-format, gfc-internal-format
! msgid "Expression in CASE selector at %L cannot be %s"
! msgstr ""
! 
! #: fortran/match.c:5334
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected initialization expression in CASE at %C"
  msgstr ""
  
! #: fortran/match.c:5366
  #, gcc-internal-format
  msgid "Expected block name %qs of SELECT construct at %C"
  msgstr ""
  
! #: fortran/match.c:5646
  #, gcc-internal-format, gfc-internal-format
  msgid "parse error in SELECT TYPE statement at %C"
  msgstr ""
  
! #: fortran/match.c:5670
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Selector in SELECT TYPE at %C is not a named variable; use associate-name=>"
  msgstr ""
  
! #: fortran/match.c:5704
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected CASE statement at %C"
  msgstr ""
  
! #: fortran/match.c:5756
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in CASE specification at %C"
  msgstr ""
  
! #: fortran/match.c:5774
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected TYPE IS statement at %C"
  msgstr ""
  
! #: fortran/match.c:5806
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The type-spec shall not specify a sequence derived type or a type with the "
  "BIND attribute in SELECT TYPE at %C [F2003:C815]"
  msgstr ""
  
! #: fortran/match.c:5818
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in TYPE IS specification at %C"
  msgstr ""
  
! #: fortran/match.c:5894
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in CLASS IS specification at %C"
  msgstr ""
  
! #: fortran/match.c:6017
  #, gcc-internal-format, gfc-internal-format
  msgid "ELSEWHERE statement at %C not enclosed in WHERE block"
  msgstr ""
  
! #: fortran/match.c:6055
  #, gcc-internal-format
  msgid "Label %qs at %C doesn't match WHERE label %qs"
  msgstr ""
*************** msgstr ""
*** 49605,49795 ****
  msgid "unquote_string(): got bad string"
  msgstr ""
  
! #: fortran/module.c:2523
  #, gcc-internal-format
  msgid "mio_array_ref(): Unknown array ref"
  msgstr ""
  
! #: fortran/module.c:3499
  #, gcc-internal-format, gfc-internal-format
  msgid "Namelist %s cannot be renamed by USE association to %s"
  msgstr ""
  
! #: fortran/module.c:4619
  #, gcc-internal-format, gfc-internal-format
  msgid "Ambiguous !$OMP DECLARE REDUCTION from module %s at %L"
  msgstr ""
  
! #: fortran/module.c:4622
  #, gcc-internal-format, gfc-internal-format
  msgid "Previous !$OMP DECLARE REDUCTION from module %s at %L"
  msgstr ""
  
! #: fortran/module.c:4810
  #, gcc-internal-format
  msgid ""
  "%qs of module %qs, imported at %C, is also the name of the current program "
  "unit"
  msgstr ""
  
! #: fortran/module.c:5161
  #, gcc-internal-format
  msgid "Symbol %qs referenced at %L not found in module %qs"
  msgstr ""
  
! #: fortran/module.c:5168
  #, gcc-internal-format
  msgid "User operator %qs referenced at %L not found in module %qs"
  msgstr ""
  
! #: fortran/module.c:5173
  #, gcc-internal-format
  msgid "Intrinsic operator %qs referenced at %L not found in module %qs"
  msgstr ""
  
! #: fortran/module.c:5403
  #, gcc-internal-format
  msgid "write_symbol(): bad module symbol %qs"
  msgstr ""
  
! #: fortran/module.c:5736
  #, gcc-internal-format
  msgid "write_symtree(): Symbol not written"
  msgstr ""
  
! #: fortran/module.c:5910
  #, gcc-internal-format
  msgid "Can't open module file %qs for writing at %C: %s"
  msgstr ""
  
! #: fortran/module.c:5930
  #, gcc-internal-format
  msgid "Error writing module file %qs for writing: %s"
  msgstr ""
  
! #: fortran/module.c:5941
  #, gcc-internal-format
  msgid "Can't delete module file %qs: %s"
  msgstr ""
  
! #: fortran/module.c:5944
  #, gcc-internal-format
  msgid "Can't rename module file %qs to %qs: %s"
  msgstr ""
  
! #: fortran/module.c:5950
  #, gcc-internal-format
  msgid "Can't delete temporary module file %qs: %s"
  msgstr ""
  
! #: fortran/module.c:5970 fortran/module.c:6297 fortran/module.c:6330
! #: fortran/module.c:6372
  #, gcc-internal-format
  msgid "Symbol %qs already declared"
  msgstr ""
  
! #: fortran/module.c:6040
  #, gcc-internal-format, gfc-internal-format
  msgid "import_iso_c_binding_module(): Unable to create symbol for %s"
  msgstr ""
  
! #: fortran/module.c:6148 fortran/module.c:6492
  #, gcc-internal-format
  msgid "The symbol %qs, referenced at %L, is not in the selected standard"
  msgstr ""
  
! #: fortran/module.c:6276
  #, gcc-internal-format
  msgid "Symbol %qs referenced at %L not found in intrinsic module ISO_C_BINDING"
  msgstr ""
  
! #: fortran/module.c:6477
  #, gcc-internal-format
  msgid ""
  "Use of intrinsic module %qs at %C conflicts with non-intrinsic module name "
  "used previously"
  msgstr ""
  
! #: fortran/module.c:6499
  #, gcc-internal-format
  msgid ""
  "Use of the NUMERIC_STORAGE_SIZE named constant from intrinsic module "
  "ISO_FORTRAN_ENV at %L is incompatible with option %qs"
  msgstr ""
  
! #: fortran/module.c:6567
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Use of the NUMERIC_STORAGE_SIZE named constant from intrinsic module "
  "ISO_FORTRAN_ENV at %C is incompatible with option %s"
  msgstr ""
  
! #: fortran/module.c:6621
  #, gcc-internal-format
  msgid ""
  "Symbol %qs referenced at %L not found in intrinsic module ISO_FORTRAN_ENV"
  msgstr ""
  
! #: fortran/module.c:6647
  #, gcc-internal-format, gfc-internal-format
  msgid "USE statement at %C has no ONLY qualifier"
  msgstr ""
  
! #: fortran/module.c:6665
  #, gcc-internal-format, gfc-internal-format
  msgid "ISO_FORTRAN_ENV intrinsic module at %C"
  msgstr ""
  
! #: fortran/module.c:6677
  #, gcc-internal-format, gfc-internal-format
  msgid "ISO_C_BINDING module at %C"
  msgstr ""
  
! #: fortran/module.c:6690
  #, gcc-internal-format
  msgid "Can't find an intrinsic module named %qs at %C"
  msgstr ""
  
! #: fortran/module.c:6696
  #, gcc-internal-format, gfc-internal-format
  msgid "IEEE_FEATURES module at %C"
  msgstr ""
  
! #: fortran/module.c:6702
  #, gcc-internal-format, gfc-internal-format
  msgid "IEEE_EXCEPTIONS module at %C"
  msgstr ""
  
! #: fortran/module.c:6708
  #, gcc-internal-format, gfc-internal-format
  msgid "IEEE_ARITHMETIC module at %C"
  msgstr ""
  
! #: fortran/module.c:6715
  #, gcc-internal-format
  msgid "Can't open module file %qs for reading at %C: %s"
  msgstr ""
  
! #: fortran/module.c:6723
  #, gcc-internal-format
  msgid ""
  "Use of non-intrinsic module %qs at %C conflicts with intrinsic module name "
  "used previously"
  msgstr ""
  
! #: fortran/module.c:6746
  #, gcc-internal-format
  msgid "File %qs opened at %C is not a GNU Fortran module file"
  msgstr ""
  
! #: fortran/module.c:6754
  #, gcc-internal-format
  msgid ""
  "Cannot read module file %qs opened at %C, because it was created by a "
  "different version of GNU Fortran"
  msgstr ""
  
! #: fortran/module.c:6768
  #, gcc-internal-format
  msgid "Can't USE the same module we're building!"
  msgstr ""
--- 49951,50141 ----
  msgid "unquote_string(): got bad string"
  msgstr ""
  
! #: fortran/module.c:2529
  #, gcc-internal-format
  msgid "mio_array_ref(): Unknown array ref"
  msgstr ""
  
! #: fortran/module.c:3505
  #, gcc-internal-format, gfc-internal-format
  msgid "Namelist %s cannot be renamed by USE association to %s"
  msgstr ""
  
! #: fortran/module.c:4625
  #, gcc-internal-format, gfc-internal-format
  msgid "Ambiguous !$OMP DECLARE REDUCTION from module %s at %L"
  msgstr ""
  
! #: fortran/module.c:4628
  #, gcc-internal-format, gfc-internal-format
  msgid "Previous !$OMP DECLARE REDUCTION from module %s at %L"
  msgstr ""
  
! #: fortran/module.c:4816
  #, gcc-internal-format
  msgid ""
  "%qs of module %qs, imported at %C, is also the name of the current program "
  "unit"
  msgstr ""
  
! #: fortran/module.c:5167
  #, gcc-internal-format
  msgid "Symbol %qs referenced at %L not found in module %qs"
  msgstr ""
  
! #: fortran/module.c:5174
  #, gcc-internal-format
  msgid "User operator %qs referenced at %L not found in module %qs"
  msgstr ""
  
! #: fortran/module.c:5179
  #, gcc-internal-format
  msgid "Intrinsic operator %qs referenced at %L not found in module %qs"
  msgstr ""
  
! #: fortran/module.c:5409
  #, gcc-internal-format
  msgid "write_symbol(): bad module symbol %qs"
  msgstr ""
  
! #: fortran/module.c:5742
  #, gcc-internal-format
  msgid "write_symtree(): Symbol not written"
  msgstr ""
  
! #: fortran/module.c:5916
  #, gcc-internal-format
  msgid "Can't open module file %qs for writing at %C: %s"
  msgstr ""
  
! #: fortran/module.c:5936
  #, gcc-internal-format
  msgid "Error writing module file %qs for writing: %s"
  msgstr ""
  
! #: fortran/module.c:5947
  #, gcc-internal-format
  msgid "Can't delete module file %qs: %s"
  msgstr ""
  
! #: fortran/module.c:5950
  #, gcc-internal-format
  msgid "Can't rename module file %qs to %qs: %s"
  msgstr ""
  
! #: fortran/module.c:5956
  #, gcc-internal-format
  msgid "Can't delete temporary module file %qs: %s"
  msgstr ""
  
! #: fortran/module.c:5976 fortran/module.c:6303 fortran/module.c:6336
! #: fortran/module.c:6378
  #, gcc-internal-format
  msgid "Symbol %qs already declared"
  msgstr ""
  
! #: fortran/module.c:6046
  #, gcc-internal-format, gfc-internal-format
  msgid "import_iso_c_binding_module(): Unable to create symbol for %s"
  msgstr ""
  
! #: fortran/module.c:6154 fortran/module.c:6498
  #, gcc-internal-format
  msgid "The symbol %qs, referenced at %L, is not in the selected standard"
  msgstr ""
  
! #: fortran/module.c:6282
  #, gcc-internal-format
  msgid "Symbol %qs referenced at %L not found in intrinsic module ISO_C_BINDING"
  msgstr ""
  
! #: fortran/module.c:6483
  #, gcc-internal-format
  msgid ""
  "Use of intrinsic module %qs at %C conflicts with non-intrinsic module name "
  "used previously"
  msgstr ""
  
! #: fortran/module.c:6505
  #, gcc-internal-format
  msgid ""
  "Use of the NUMERIC_STORAGE_SIZE named constant from intrinsic module "
  "ISO_FORTRAN_ENV at %L is incompatible with option %qs"
  msgstr ""
  
! #: fortran/module.c:6573
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Use of the NUMERIC_STORAGE_SIZE named constant from intrinsic module "
  "ISO_FORTRAN_ENV at %C is incompatible with option %s"
  msgstr ""
  
! #: fortran/module.c:6627
  #, gcc-internal-format
  msgid ""
  "Symbol %qs referenced at %L not found in intrinsic module ISO_FORTRAN_ENV"
  msgstr ""
  
! #: fortran/module.c:6653
  #, gcc-internal-format, gfc-internal-format
  msgid "USE statement at %C has no ONLY qualifier"
  msgstr ""
  
! #: fortran/module.c:6671
  #, gcc-internal-format, gfc-internal-format
  msgid "ISO_FORTRAN_ENV intrinsic module at %C"
  msgstr ""
  
! #: fortran/module.c:6683
  #, gcc-internal-format, gfc-internal-format
  msgid "ISO_C_BINDING module at %C"
  msgstr ""
  
! #: fortran/module.c:6696
  #, gcc-internal-format
  msgid "Can't find an intrinsic module named %qs at %C"
  msgstr ""
  
! #: fortran/module.c:6702
  #, gcc-internal-format, gfc-internal-format
  msgid "IEEE_FEATURES module at %C"
  msgstr ""
  
! #: fortran/module.c:6708
  #, gcc-internal-format, gfc-internal-format
  msgid "IEEE_EXCEPTIONS module at %C"
  msgstr ""
  
! #: fortran/module.c:6714
  #, gcc-internal-format, gfc-internal-format
  msgid "IEEE_ARITHMETIC module at %C"
  msgstr ""
  
! #: fortran/module.c:6721
  #, gcc-internal-format
  msgid "Can't open module file %qs for reading at %C: %s"
  msgstr ""
  
! #: fortran/module.c:6729
  #, gcc-internal-format
  msgid ""
  "Use of non-intrinsic module %qs at %C conflicts with intrinsic module name "
  "used previously"
  msgstr ""
  
! #: fortran/module.c:6752
  #, gcc-internal-format
  msgid "File %qs opened at %C is not a GNU Fortran module file"
  msgstr ""
  
! #: fortran/module.c:6760
  #, gcc-internal-format
  msgid ""
  "Cannot read module file %qs opened at %C, because it was created by a "
  "different version of GNU Fortran"
  msgstr ""
  
! #: fortran/module.c:6774
  #, gcc-internal-format
  msgid "Can't USE the same module we're building!"
  msgstr ""
*************** msgid ""
*** 50088,50094 ****
  "Implicitly declared subroutine %s used in !$OMP DECLARE REDUCTION at %L "
  msgstr ""
  
! #: fortran/openmp.c:2885 fortran/resolve.c:9163 fortran/resolve.c:10248
  #, gcc-internal-format, gfc-internal-format
  msgid "IF clause at %L requires a scalar LOGICAL expression"
  msgstr ""
--- 50434,50440 ----
  "Implicitly declared subroutine %s used in !$OMP DECLARE REDUCTION at %L "
  msgstr ""
  
! #: fortran/openmp.c:2885 fortran/resolve.c:9239 fortran/resolve.c:10382
  #, gcc-internal-format, gfc-internal-format
  msgid "IF clause at %L requires a scalar LOGICAL expression"
  msgstr ""
*************** msgstr ""
*** 50768,50779 ****
  msgid "The value of n in %<-finit-character=n%> must be between 0 and 127"
  msgstr ""
  
! #: fortran/parse.c:556
  #, gcc-internal-format, gfc-internal-format
  msgid "Unclassifiable statement at %C"
  msgstr ""
  
! #: fortran/parse.c:600
  #, gcc-internal-format, gfc-internal-format
  msgid "OpenACC directives at %C may not appear in PURE procedures"
  msgstr ""
--- 51114,51125 ----
  msgid "The value of n in %<-finit-character=n%> must be between 0 and 127"
  msgstr ""
  
! #: fortran/parse.c:558
  #, gcc-internal-format, gfc-internal-format
  msgid "Unclassifiable statement at %C"
  msgstr ""
  
! #: fortran/parse.c:594
  #, gcc-internal-format, gfc-internal-format
  msgid "OpenACC directives at %C may not appear in PURE procedures"
  msgstr ""
*************** msgstr ""
*** 50783,50954 ****
  msgid "Unclassifiable OpenACC directive at %C"
  msgstr ""
  
! #: fortran/parse.c:688
  #, gcc-internal-format, gfc-internal-format
  msgid "OpenMP directives at %C may not appear in PURE or ELEMENTAL procedures"
  msgstr ""
  
! #: fortran/parse.c:863
  #, gcc-internal-format, gfc-internal-format
  msgid "Unclassifiable OpenMP directive at %C"
  msgstr ""
  
! #: fortran/parse.c:890
  #, gcc-internal-format, gfc-internal-format
  msgid "Unclassifiable GCC directive at %C"
  msgstr ""
  
! #: fortran/parse.c:949 fortran/parse.c:1181
  #, gcc-internal-format, gfc-internal-format
  msgid "Zero is not a valid statement label at %C"
  msgstr ""
  
! #: fortran/parse.c:956 fortran/parse.c:1173
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-numeric character in statement label at %C"
  msgstr ""
  
! #: fortran/parse.c:968 fortran/parse.c:1222
  #, gcc-internal-format, gfc-internal-format
  msgid "Semicolon at %C needs to be preceded by statement"
  msgstr ""
  
! #: fortran/parse.c:976 fortran/parse.c:1237
  #, gcc-internal-format, gfc-internal-format
  msgid "Ignoring statement label in empty statement at %L"
  msgstr ""
  
! #: fortran/parse.c:1043 fortran/parse.c:1224
  #, gcc-internal-format, gfc-internal-format
  msgid "Fortran 2008: Semicolon at %C without preceding statement"
  msgstr ""
  
! #: fortran/parse.c:1066 fortran/parse.c:1200
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad continuation line at %C"
  msgstr ""
  
! #: fortran/parse.c:1485
  #, gcc-internal-format, gfc-internal-format
  msgid "FORMAT statement at %L does not have a statement label"
  msgstr ""
  
! #: fortran/parse.c:2147
  #, gcc-internal-format
  msgid "gfc_ascii_statement(): Bad statement code"
  msgstr ""
  
! #: fortran/parse.c:2291
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement at %C"
  msgstr ""
  
! #: fortran/parse.c:2438
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C cannot follow %s statement at %L"
  msgstr ""
  
! #: fortran/parse.c:2455
  #, gcc-internal-format
  msgid "Unexpected end of file in %qs"
  msgstr ""
  
! #: fortran/parse.c:2487
  #, gcc-internal-format
  msgid "Derived-type %qs with SEQUENCE must not have a CONTAINS section at %C"
  msgstr ""
  
! #: fortran/parse.c:2490
  #, gcc-internal-format
  msgid "Derived-type %qs with BIND(C) must not have a CONTAINS section at %C"
  msgstr ""
  
! #: fortran/parse.c:2510
  #, gcc-internal-format, gfc-internal-format
  msgid "Components in TYPE at %C must precede CONTAINS"
  msgstr ""
  
! #: fortran/parse.c:2514
  #, gcc-internal-format, gfc-internal-format
  msgid "Type-bound procedure at %C"
  msgstr ""
  
! #: fortran/parse.c:2522
  #, gcc-internal-format, gfc-internal-format
  msgid "GENERIC binding at %C"
  msgstr ""
  
! #: fortran/parse.c:2530
  #, gcc-internal-format, gfc-internal-format
  msgid "FINAL procedure declaration at %C"
  msgstr ""
  
! #: fortran/parse.c:2542
  #, gcc-internal-format, gfc-internal-format
  msgid "Derived type definition at %C with empty CONTAINS section"
  msgstr ""
  
! #: fortran/parse.c:2552 fortran/parse.c:2655
  #, gcc-internal-format, gfc-internal-format
  msgid "PRIVATE statement in TYPE at %C must be inside a MODULE"
  msgstr ""
  
! #: fortran/parse.c:2559
  #, gcc-internal-format, gfc-internal-format
  msgid "PRIVATE statement at %C must precede procedure bindings"
  msgstr ""
  
! #: fortran/parse.c:2566 fortran/parse.c:2668
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate PRIVATE statement at %C"
  msgstr ""
  
! #: fortran/parse.c:2576
  #, gcc-internal-format, gfc-internal-format
  msgid "SEQUENCE statement at %C must precede CONTAINS"
  msgstr ""
  
! #: fortran/parse.c:2580
  #, gcc-internal-format, gfc-internal-format
  msgid "Already inside a CONTAINS block at %C"
  msgstr ""
  
! #: fortran/parse.c:2638
  #, gcc-internal-format, gfc-internal-format
  msgid "FINAL declaration at %C must be inside CONTAINS"
  msgstr ""
  
! #: fortran/parse.c:2646
  #, gcc-internal-format, gfc-internal-format
  msgid "Derived type definition at %C without components"
  msgstr ""
  
! #: fortran/parse.c:2662
  #, gcc-internal-format, gfc-internal-format
  msgid "PRIVATE statement at %C must precede structure components"
  msgstr ""
  
! #: fortran/parse.c:2679
  #, gcc-internal-format, gfc-internal-format
  msgid "SEQUENCE statement at %C must precede structure components"
  msgstr ""
  
! #: fortran/parse.c:2685
  #, gcc-internal-format, gfc-internal-format
  msgid "SEQUENCE attribute at %C already specified in TYPE statement"
  msgstr ""
  
! #: fortran/parse.c:2690
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate SEQUENCE statement at %C"
  msgstr ""
  
! #: fortran/parse.c:2700
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTAINS block in derived type definition at %C"
  msgstr ""
  
! #: fortran/parse.c:2788
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Component %s at %L of type LOCK_TYPE must have a codimension or be a "
--- 51129,51300 ----
  msgid "Unclassifiable OpenACC directive at %C"
  msgstr ""
  
! #: fortran/parse.c:746
  #, gcc-internal-format, gfc-internal-format
  msgid "OpenMP directives at %C may not appear in PURE or ELEMENTAL procedures"
  msgstr ""
  
! #: fortran/parse.c:925
  #, gcc-internal-format, gfc-internal-format
  msgid "Unclassifiable OpenMP directive at %C"
  msgstr ""
  
! #: fortran/parse.c:959
  #, gcc-internal-format, gfc-internal-format
  msgid "Unclassifiable GCC directive at %C"
  msgstr ""
  
! #: fortran/parse.c:1018 fortran/parse.c:1250
  #, gcc-internal-format, gfc-internal-format
  msgid "Zero is not a valid statement label at %C"
  msgstr ""
  
! #: fortran/parse.c:1025 fortran/parse.c:1242
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-numeric character in statement label at %C"
  msgstr ""
  
! #: fortran/parse.c:1037 fortran/parse.c:1291
  #, gcc-internal-format, gfc-internal-format
  msgid "Semicolon at %C needs to be preceded by statement"
  msgstr ""
  
! #: fortran/parse.c:1045 fortran/parse.c:1306
  #, gcc-internal-format, gfc-internal-format
  msgid "Ignoring statement label in empty statement at %L"
  msgstr ""
  
! #: fortran/parse.c:1112 fortran/parse.c:1293
  #, gcc-internal-format, gfc-internal-format
  msgid "Fortran 2008: Semicolon at %C without preceding statement"
  msgstr ""
  
! #: fortran/parse.c:1135 fortran/parse.c:1269
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad continuation line at %C"
  msgstr ""
  
! #: fortran/parse.c:1558
  #, gcc-internal-format, gfc-internal-format
  msgid "FORMAT statement at %L does not have a statement label"
  msgstr ""
  
! #: fortran/parse.c:2226
  #, gcc-internal-format
  msgid "gfc_ascii_statement(): Bad statement code"
  msgstr ""
  
! #: fortran/parse.c:2370
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement at %C"
  msgstr ""
  
! #: fortran/parse.c:2517
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C cannot follow %s statement at %L"
  msgstr ""
  
! #: fortran/parse.c:2534
  #, gcc-internal-format
  msgid "Unexpected end of file in %qs"
  msgstr ""
  
! #: fortran/parse.c:2566
  #, gcc-internal-format
  msgid "Derived-type %qs with SEQUENCE must not have a CONTAINS section at %C"
  msgstr ""
  
! #: fortran/parse.c:2569
  #, gcc-internal-format
  msgid "Derived-type %qs with BIND(C) must not have a CONTAINS section at %C"
  msgstr ""
  
! #: fortran/parse.c:2589
  #, gcc-internal-format, gfc-internal-format
  msgid "Components in TYPE at %C must precede CONTAINS"
  msgstr ""
  
! #: fortran/parse.c:2593
  #, gcc-internal-format, gfc-internal-format
  msgid "Type-bound procedure at %C"
  msgstr ""
  
! #: fortran/parse.c:2601
  #, gcc-internal-format, gfc-internal-format
  msgid "GENERIC binding at %C"
  msgstr ""
  
! #: fortran/parse.c:2609
  #, gcc-internal-format, gfc-internal-format
  msgid "FINAL procedure declaration at %C"
  msgstr ""
  
! #: fortran/parse.c:2621
  #, gcc-internal-format, gfc-internal-format
  msgid "Derived type definition at %C with empty CONTAINS section"
  msgstr ""
  
! #: fortran/parse.c:2631 fortran/parse.c:2734
  #, gcc-internal-format, gfc-internal-format
  msgid "PRIVATE statement in TYPE at %C must be inside a MODULE"
  msgstr ""
  
! #: fortran/parse.c:2638
  #, gcc-internal-format, gfc-internal-format
  msgid "PRIVATE statement at %C must precede procedure bindings"
  msgstr ""
  
! #: fortran/parse.c:2645 fortran/parse.c:2747
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate PRIVATE statement at %C"
  msgstr ""
  
! #: fortran/parse.c:2655
  #, gcc-internal-format, gfc-internal-format
  msgid "SEQUENCE statement at %C must precede CONTAINS"
  msgstr ""
  
! #: fortran/parse.c:2659
  #, gcc-internal-format, gfc-internal-format
  msgid "Already inside a CONTAINS block at %C"
  msgstr ""
  
! #: fortran/parse.c:2717
  #, gcc-internal-format, gfc-internal-format
  msgid "FINAL declaration at %C must be inside CONTAINS"
  msgstr ""
  
! #: fortran/parse.c:2725
  #, gcc-internal-format, gfc-internal-format
  msgid "Derived type definition at %C without components"
  msgstr ""
  
! #: fortran/parse.c:2741
  #, gcc-internal-format, gfc-internal-format
  msgid "PRIVATE statement at %C must precede structure components"
  msgstr ""
  
! #: fortran/parse.c:2758
  #, gcc-internal-format, gfc-internal-format
  msgid "SEQUENCE statement at %C must precede structure components"
  msgstr ""
  
! #: fortran/parse.c:2764
  #, gcc-internal-format, gfc-internal-format
  msgid "SEQUENCE attribute at %C already specified in TYPE statement"
  msgstr ""
  
! #: fortran/parse.c:2769
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate SEQUENCE statement at %C"
  msgstr ""
  
! #: fortran/parse.c:2779
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTAINS block in derived type definition at %C"
  msgstr ""
  
! #: fortran/parse.c:2884
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Component %s at %L of type LOCK_TYPE must have a codimension or be a "
*************** msgid ""
*** 50956,50982 ****
  "pointer attribute"
  msgstr ""
  
! #: fortran/parse.c:2794
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Pointer component %s at %L has a noncoarray subcomponent of type LOCK_TYPE, "
  "which must have a codimension or be a subcomponent of a coarray"
  msgstr ""
  
! #: fortran/parse.c:2799
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocatable component %s at %L of type LOCK_TYPE must have a codimension"
  msgstr ""
  
! #: fortran/parse.c:2803
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocatable component %s at %L must have a codimension as it has a "
  "noncoarray subcomponent of type LOCK_TYPE"
  msgstr ""
  
! #: fortran/parse.c:2808
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Noncoarray component %s at %L of type LOCK_TYPE or with subcomponent of type "
--- 51302,51328 ----
  "pointer attribute"
  msgstr ""
  
! #: fortran/parse.c:2890
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Pointer component %s at %L has a noncoarray subcomponent of type LOCK_TYPE, "
  "which must have a codimension or be a subcomponent of a coarray"
  msgstr ""
  
! #: fortran/parse.c:2895
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocatable component %s at %L of type LOCK_TYPE must have a codimension"
  msgstr ""
  
! #: fortran/parse.c:2899
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocatable component %s at %L must have a codimension as it has a "
  "noncoarray subcomponent of type LOCK_TYPE"
  msgstr ""
  
! #: fortran/parse.c:2904
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Noncoarray component %s at %L of type LOCK_TYPE or with subcomponent of type "
*************** msgid ""
*** 50985,50991 ****
  "subcomponent exists)"
  msgstr ""
  
! #: fortran/parse.c:2815
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Noncoarray component %s at %L of type LOCK_TYPE or with subcomponent of type "
--- 51331,51337 ----
  "subcomponent exists)"
  msgstr ""
  
! #: fortran/parse.c:2911
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Noncoarray component %s at %L of type LOCK_TYPE or with subcomponent of type "
*************** msgid ""
*** 50994,51224 ****
  "codimension or a coarray subcomponent)"
  msgstr ""
  
! #: fortran/parse.c:2867
  #, gcc-internal-format, gfc-internal-format
  msgid "ENUM declaration at %C has no ENUMERATORS"
  msgstr ""
  
! #: fortran/parse.c:2950
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in INTERFACE block at %C"
  msgstr ""
  
! #: fortran/parse.c:2974
  #, gcc-internal-format
  msgid ""
  "Name %qs of ABSTRACT INTERFACE at %C cannot be the same as an intrinsic type"
  msgstr ""
  
! #: fortran/parse.c:3007
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement at %C in INTERFACE body"
  msgstr ""
  
! #: fortran/parse.c:3025
  #, gcc-internal-format
  msgid ""
  "INTERFACE procedure %qs at %L has the same name as the enclosing procedure"
  msgstr ""
  
! #: fortran/parse.c:3150
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement is not allowed inside of BLOCK at %C"
  msgstr ""
  
! #: fortran/parse.c:3180
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement is not allowed inside of BLOCK DATA at %C"
  msgstr ""
  
! #: fortran/parse.c:3264
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement must appear in a MODULE"
  msgstr ""
  
! #: fortran/parse.c:3272
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C follows another accessibility specification"
  msgstr ""
  
! #: fortran/parse.c:3336
  #, gcc-internal-format
  msgid "Bad kind expression for function %qs at %L"
  msgstr ""
  
! #: fortran/parse.c:3340
  #, gcc-internal-format
  msgid "The type for function %qs at %L is not accessible"
  msgstr ""
  
! #: fortran/parse.c:3398
  #, gcc-internal-format, gfc-internal-format
  msgid "ELSEWHERE statement at %C follows previous unmasked ELSEWHERE"
  msgstr ""
  
! #: fortran/parse.c:3420
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in WHERE block at %C"
  msgstr ""
  
! #: fortran/parse.c:3479
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in FORALL block at %C"
  msgstr ""
  
! #: fortran/parse.c:3530
  #, gcc-internal-format, gfc-internal-format
  msgid "ELSE IF statement at %C cannot follow ELSE statement at %L"
  msgstr ""
  
! #: fortran/parse.c:3548
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate ELSE statements at %L and %C"
  msgstr ""
  
! #: fortran/parse.c:3609
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected a CASE or END SELECT statement following SELECT CASE at %C"
  msgstr ""
  
! #: fortran/parse.c:3692
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Expected TYPE IS, CLASS IS or END SELECT statement following SELECT TYPE at "
  "%C"
  msgstr ""
  
! #: fortran/parse.c:3754
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable '%s' at %C cannot be redefined inside loop beginning at %L"
  msgstr ""
  
! #: fortran/parse.c:3787
  #, gcc-internal-format, gfc-internal-format
  msgid "End of nonblock DO statement at %C is within another block"
  msgstr ""
  
! #: fortran/parse.c:3797
  #, gcc-internal-format, gfc-internal-format
  msgid "End of nonblock DO statement at %C is interwoven with another DO loop"
  msgstr ""
  
! #: fortran/parse.c:3823
  #, gcc-internal-format, gfc-internal-format
  msgid "CRITICAL block inside of OpenACC region at %C"
  msgstr ""
  
! #: fortran/parse.c:3850
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement label in END CRITICAL at %C does not match CRITICAL label"
  msgstr ""
  
! #: fortran/parse.c:3918
  #, gcc-internal-format, gfc-internal-format
  msgid "BLOCK construct at %C"
  msgstr ""
  
! #: fortran/parse.c:3948
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSOCIATE construct at %C"
  msgstr ""
  
! #: fortran/parse.c:4048
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement label in ENDDO at %C doesn't match DO label"
  msgstr ""
  
! #: fortran/parse.c:4064
  #, gcc-internal-format, gfc-internal-format
  msgid "Named block DO at %L requires matching ENDDO name"
  msgstr ""
  
! #: fortran/parse.c:4235
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing !$OMP END ATOMIC after !$OMP ATOMIC CAPTURE at %C"
  msgstr ""
  
! #: fortran/parse.c:4251 fortran/parse.c:4308
  #, gcc-internal-format, gfc-internal-format
  msgid "OpenACC directive inside of CRITICAL block at %C"
  msgstr ""
  
! #: fortran/parse.c:4284
  #, gcc-internal-format, gfc-internal-format
  msgid "Expecting %s at %C"
  msgstr ""
  
! #: fortran/parse.c:4327
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected DO loop at %C"
  msgstr ""
  
! #: fortran/parse.c:4347
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant !$ACC END LOOP at %C"
  msgstr ""
  
! #: fortran/parse.c:4560
  #, gcc-internal-format, gfc-internal-format
  msgid "Name after !$omp critical and !$omp end critical does not match at %C"
  msgstr ""
  
! #: fortran/parse.c:4617
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C cannot terminate a non-block DO loop"
  msgstr ""
  
! #: fortran/parse.c:4631
  #, gcc-internal-format, gfc-internal-format
  msgid "DATA statement at %C after the first executable statement"
  msgstr ""
  
! #: fortran/parse.c:4858
  #, gcc-internal-format
  msgid "Contained procedure %qs at %C is already ambiguous"
  msgstr ""
  
! #: fortran/parse.c:4914
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in CONTAINS section at %C"
  msgstr ""
  
! #: fortran/parse.c:4938
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTAINS statement without FUNCTION or SUBROUTINE statement at %C"
  msgstr ""
  
! #: fortran/parse.c:5015
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTAINS statement at %C is already in a contained program unit"
  msgstr ""
  
! #: fortran/parse.c:5068
  #, gcc-internal-format
  msgid "gfc_global_used(): Bad type"
  msgstr ""
  
! #: fortran/parse.c:5073
  #, gcc-internal-format, gfc-internal-format
  msgid "Global binding name '%s' at %L is already being used as a %s at %L"
  msgstr ""
  
! #: fortran/parse.c:5076
  #, gcc-internal-format, gfc-internal-format
  msgid "Global name '%s' at %L is already being used as a %s at %L"
  msgstr ""
  
! #: fortran/parse.c:5097
  #, gcc-internal-format, gfc-internal-format
  msgid "Blank BLOCK DATA at %C conflicts with prior BLOCK DATA at %L"
  msgstr ""
  
! #: fortran/parse.c:5123
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in BLOCK DATA at %C"
  msgstr ""
  
! #: fortran/parse.c:5168
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in MODULE at %C"
  msgstr ""
--- 51340,51616 ----
  "codimension or a coarray subcomponent)"
  msgstr ""
  
! #: fortran/parse.c:2921
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "Component %s at %L of type EVENT_TYPE must have a codimension or be a "
! "subcomponent of a coarray, which is not possible as the component has the "
! "pointer attribute"
! msgstr ""
! 
! #: fortran/parse.c:2927
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "Pointer component %s at %L has a noncoarray subcomponent of type EVENT_TYPE, "
! "which must have a codimension or be a subcomponent of a coarray"
! msgstr ""
! 
! #: fortran/parse.c:2932
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "Allocatable component %s at %L of type EVENT_TYPE must have a codimension"
! msgstr ""
! 
! #: fortran/parse.c:2936
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "Allocatable component %s at %L must have a codimension as it has a "
! "noncoarray subcomponent of type EVENT_TYPE"
! msgstr ""
! 
! #: fortran/parse.c:2941
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "Noncoarray component %s at %L of type EVENT_TYPE or with subcomponent of "
! "type EVENT_TYPE must have a codimension or be a subcomponent of a coarray. "
! "(Variables of type %s may not have a codimension as already a coarray "
! "subcomponent exists)"
! msgstr ""
! 
! #: fortran/parse.c:2948
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "Noncoarray component %s at %L of type EVENT_TYPE or with subcomponent of "
! "type EVENT_TYPE must have a codimension or be a subcomponent of a coarray. "
! "(Variables of type %s may not have a codimension as %s at %L has a "
! "codimension or a coarray subcomponent)"
! msgstr ""
! 
! #: fortran/parse.c:3000
  #, gcc-internal-format, gfc-internal-format
  msgid "ENUM declaration at %C has no ENUMERATORS"
  msgstr ""
  
! #: fortran/parse.c:3083
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in INTERFACE block at %C"
  msgstr ""
  
! #: fortran/parse.c:3107
  #, gcc-internal-format
  msgid ""
  "Name %qs of ABSTRACT INTERFACE at %C cannot be the same as an intrinsic type"
  msgstr ""
  
! #: fortran/parse.c:3140
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement at %C in INTERFACE body"
  msgstr ""
  
! #: fortran/parse.c:3158
  #, gcc-internal-format
  msgid ""
  "INTERFACE procedure %qs at %L has the same name as the enclosing procedure"
  msgstr ""
  
! #: fortran/parse.c:3286
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement is not allowed inside of BLOCK at %C"
  msgstr ""
  
! #: fortran/parse.c:3316
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement is not allowed inside of BLOCK DATA at %C"
  msgstr ""
  
! #: fortran/parse.c:3400
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement must appear in a MODULE"
  msgstr ""
  
! #: fortran/parse.c:3408
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C follows another accessibility specification"
  msgstr ""
  
! #: fortran/parse.c:3472
  #, gcc-internal-format
  msgid "Bad kind expression for function %qs at %L"
  msgstr ""
  
! #: fortran/parse.c:3476
  #, gcc-internal-format
  msgid "The type for function %qs at %L is not accessible"
  msgstr ""
  
! #: fortran/parse.c:3534
  #, gcc-internal-format, gfc-internal-format
  msgid "ELSEWHERE statement at %C follows previous unmasked ELSEWHERE"
  msgstr ""
  
! #: fortran/parse.c:3556
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in WHERE block at %C"
  msgstr ""
  
! #: fortran/parse.c:3615
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in FORALL block at %C"
  msgstr ""
  
! #: fortran/parse.c:3666
  #, gcc-internal-format, gfc-internal-format
  msgid "ELSE IF statement at %C cannot follow ELSE statement at %L"
  msgstr ""
  
! #: fortran/parse.c:3684
  #, gcc-internal-format, gfc-internal-format
  msgid "Duplicate ELSE statements at %L and %C"
  msgstr ""
  
! #: fortran/parse.c:3745
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected a CASE or END SELECT statement following SELECT CASE at %C"
  msgstr ""
  
! #: fortran/parse.c:3828
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Expected TYPE IS, CLASS IS or END SELECT statement following SELECT TYPE at "
  "%C"
  msgstr ""
  
! #: fortran/parse.c:3890
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable '%s' at %C cannot be redefined inside loop beginning at %L"
  msgstr ""
  
! #: fortran/parse.c:3923
  #, gcc-internal-format, gfc-internal-format
  msgid "End of nonblock DO statement at %C is within another block"
  msgstr ""
  
! #: fortran/parse.c:3933
  #, gcc-internal-format, gfc-internal-format
  msgid "End of nonblock DO statement at %C is interwoven with another DO loop"
  msgstr ""
  
! #: fortran/parse.c:3959
  #, gcc-internal-format, gfc-internal-format
  msgid "CRITICAL block inside of OpenACC region at %C"
  msgstr ""
  
! #: fortran/parse.c:3986
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement label in END CRITICAL at %C does not match CRITICAL label"
  msgstr ""
  
! #: fortran/parse.c:4054
  #, gcc-internal-format, gfc-internal-format
  msgid "BLOCK construct at %C"
  msgstr ""
  
! #: fortran/parse.c:4084
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSOCIATE construct at %C"
  msgstr ""
  
! #: fortran/parse.c:4184
  #, gcc-internal-format, gfc-internal-format
  msgid "Statement label in ENDDO at %C doesn't match DO label"
  msgstr ""
  
! #: fortran/parse.c:4200
  #, gcc-internal-format, gfc-internal-format
  msgid "Named block DO at %L requires matching ENDDO name"
  msgstr ""
  
! #: fortran/parse.c:4371
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing !$OMP END ATOMIC after !$OMP ATOMIC CAPTURE at %C"
  msgstr ""
  
! #: fortran/parse.c:4387 fortran/parse.c:4444
  #, gcc-internal-format, gfc-internal-format
  msgid "OpenACC directive inside of CRITICAL block at %C"
  msgstr ""
  
! #: fortran/parse.c:4420
  #, gcc-internal-format, gfc-internal-format
  msgid "Expecting %s at %C"
  msgstr ""
  
! #: fortran/parse.c:4463
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected DO loop at %C"
  msgstr ""
  
! #: fortran/parse.c:4483
  #, gcc-internal-format, gfc-internal-format
  msgid "Redundant !$ACC END LOOP at %C"
  msgstr ""
  
! #: fortran/parse.c:4696
  #, gcc-internal-format, gfc-internal-format
  msgid "Name after !$omp critical and !$omp end critical does not match at %C"
  msgstr ""
  
! #: fortran/parse.c:4753
  #, gcc-internal-format, gfc-internal-format
  msgid "%s statement at %C cannot terminate a non-block DO loop"
  msgstr ""
  
! #: fortran/parse.c:4767
  #, gcc-internal-format, gfc-internal-format
  msgid "DATA statement at %C after the first executable statement"
  msgstr ""
  
! #: fortran/parse.c:4994
  #, gcc-internal-format
  msgid "Contained procedure %qs at %C is already ambiguous"
  msgstr ""
  
! #: fortran/parse.c:5050
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in CONTAINS section at %C"
  msgstr ""
  
! #: fortran/parse.c:5074
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTAINS statement without FUNCTION or SUBROUTINE statement at %C"
  msgstr ""
  
! #: fortran/parse.c:5151
  #, gcc-internal-format, gfc-internal-format
  msgid "CONTAINS statement at %C is already in a contained program unit"
  msgstr ""
  
! #: fortran/parse.c:5204
  #, gcc-internal-format
  msgid "gfc_global_used(): Bad type"
  msgstr ""
  
! #: fortran/parse.c:5209
  #, gcc-internal-format, gfc-internal-format
  msgid "Global binding name '%s' at %L is already being used as a %s at %L"
  msgstr ""
  
! #: fortran/parse.c:5212
  #, gcc-internal-format, gfc-internal-format
  msgid "Global name '%s' at %L is already being used as a %s at %L"
  msgstr ""
  
! #: fortran/parse.c:5233
  #, gcc-internal-format, gfc-internal-format
  msgid "Blank BLOCK DATA at %C conflicts with prior BLOCK DATA at %L"
  msgstr ""
  
! #: fortran/parse.c:5259
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in BLOCK DATA at %C"
  msgstr ""
  
! #: fortran/parse.c:5304
  #, gcc-internal-format, gfc-internal-format
  msgid "Unexpected %s statement in MODULE at %C"
  msgstr ""
*************** msgstr ""
*** 51226,51232 ****
  #. If we see a duplicate main program, shut down.  If the second
  #. instance is an implied main program, i.e. data decls or executable
  #. statements, we're in for lots of errors.
! #: fortran/parse.c:5546
  #, gcc-internal-format, gfc-internal-format
  msgid "Two main PROGRAMs at %L and %C"
  msgstr ""
--- 51618,51624 ----
  #. If we see a duplicate main program, shut down.  If the second
  #. instance is an implied main program, i.e. data decls or executable
  #. statements, we're in for lots of errors.
! #: fortran/parse.c:5682
  #, gcc-internal-format, gfc-internal-format
  msgid "Two main PROGRAMs at %L and %C"
  msgstr ""
*************** msgstr ""
*** 51388,51603 ****
  msgid "Expected PARAMETER symbol in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1207
  #, gcc-internal-format, gfc-internal-format
  msgid "Numeric PARAMETER required in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1213
  #, gcc-internal-format, gfc-internal-format
  msgid "Scalar PARAMETER required in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1217
  #, gcc-internal-format, gfc-internal-format
  msgid "PARAMETER symbol in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1240
  #, gcc-internal-format
  msgid "gfc_match_sym_complex_part(): Bad type"
  msgstr ""
  
! #: fortran/primary.c:1247
  #, gcc-internal-format, gfc-internal-format
  msgid "Error converting PARAMETER constant in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1376
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in COMPLEX constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1583
  #, gcc-internal-format
  msgid "Keyword %qs at %C has already appeared in the current argument list"
  msgstr ""
  
! #: fortran/primary.c:1647
  #, gcc-internal-format, gfc-internal-format
  msgid "argument list function at %C"
  msgstr ""
  
! #: fortran/primary.c:1715
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected alternate return label at %C"
  msgstr ""
  
! #: fortran/primary.c:1737
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing keyword name in actual argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:1783
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:1804
  #, gcc-internal-format
  msgid "extend_ref(): Bad tail"
  msgstr ""
  
! #: fortran/primary.c:1842
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Array section designator, e.g. '(:)', is required besides the coarray "
  "designator '[...]' at %C"
  msgstr ""
  
! #: fortran/primary.c:1850
  #, gcc-internal-format
  msgid "Coarray designator at %C but %qs is not a coarray"
  msgstr ""
  
! #: fortran/primary.c:1920
  #, gcc-internal-format
  msgid "Symbol %qs at %C has no IMPLICIT type"
  msgstr ""
  
! #: fortran/primary.c:1926
  #, gcc-internal-format
  msgid "Unexpected %<%%%> for nonderived-type variable %qs at %C"
  msgstr ""
  
! #: fortran/primary.c:1944
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected structure component name at %C"
  msgstr ""
  
! #: fortran/primary.c:1995
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:2026
  #, gcc-internal-format
  msgid "Procedure pointer component %qs requires an argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:2113
  #, gcc-internal-format, gfc-internal-format
  msgid "Coindexed procedure-pointer component at %C"
  msgstr ""
  
! #: fortran/primary.c:2148
  #, gcc-internal-format
  msgid "gfc_variable_attr(): Expression isn't a variable"
  msgstr ""
  
! #: fortran/primary.c:2216
  #, gcc-internal-format
  msgid "gfc_variable_attr(): Bad array reference"
  msgstr ""
  
! #: fortran/primary.c:2386
  #, gcc-internal-format, gfc-internal-format
  msgid "Structure constructor with missing optional arguments at %C"
  msgstr ""
  
! #: fortran/primary.c:2395
  #, gcc-internal-format
  msgid ""
  "No initializer for allocatable component '%qs' given in the structure "
  "constructor at %C"
  msgstr ""
  
! #: fortran/primary.c:2402
  #, gcc-internal-format
  msgid ""
  "No initializer for component %qs given in the structure constructor at %C!"
  msgstr ""
  
! #: fortran/primary.c:2450
  #, gcc-internal-format
  msgid "Can't construct ABSTRACT type %qs at %L"
  msgstr ""
  
! #: fortran/primary.c:2470
  #, gcc-internal-format, gfc-internal-format
  msgid "Structure constructor with named arguments at %C"
  msgstr ""
  
! #: fortran/primary.c:2485
  #, gcc-internal-format, gfc-internal-format
  msgid "Component initializer without name after component named %s at %L!"
  msgstr ""
  
! #: fortran/primary.c:2490
  #, gcc-internal-format, gfc-internal-format
  msgid "Too many components in structure constructor at %L!"
  msgstr ""
  
! #: fortran/primary.c:2527
  #, gcc-internal-format
  msgid "Component %qs is initialized twice in the structure constructor at %L!"
  msgstr ""
  
! #: fortran/primary.c:2539
  #, gcc-internal-format
  msgid ""
  "Coindexed expression to pointer component %qs in structure constructor at %L!"
  msgstr ""
  
! #: fortran/primary.c:2593
  #, gcc-internal-format
  msgid ""
  "component %qs at %L has already been set by a parent derived type constructor"
  msgstr ""
  
! #: fortran/primary.c:2776
  #, gcc-internal-format
  msgid ""
  "%qs at %C is the name of a recursive function and so refers to the result "
  "variable. Use an explicit RESULT variable for direct recursion (12.5.2.1)"
  msgstr ""
  
! #: fortran/primary.c:2899
  #, gcc-internal-format
  msgid "Unexpected use of subroutine name %qs at %C"
  msgstr ""
  
! #: fortran/primary.c:2930
  #, gcc-internal-format
  msgid "Statement function %qs requires argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:2933
  #, gcc-internal-format
  msgid "Function %qs requires an argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:2983
  #, gcc-internal-format
  msgid "Missing argument to %qs at %C"
  msgstr ""
  
! #: fortran/primary.c:3139
  #, gcc-internal-format
  msgid "Missing argument list in function %qs at %C"
  msgstr ""
  
! #: fortran/primary.c:3173
  #, gcc-internal-format, gfc-internal-format
  msgid "Symbol at %C is not appropriate for an expression"
  msgstr ""
  
! #: fortran/primary.c:3272
  #, gcc-internal-format, gfc-internal-format
  msgid "Named constant at %C in an EQUIVALENCE"
  msgstr ""
  
! #: fortran/primary.c:3306
  #, gcc-internal-format
  msgid "%qs at %C is not a variable"
  msgstr ""
--- 51780,51995 ----
  msgid "Expected PARAMETER symbol in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1210
  #, gcc-internal-format, gfc-internal-format
  msgid "Numeric PARAMETER required in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1216
  #, gcc-internal-format, gfc-internal-format
  msgid "Scalar PARAMETER required in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1220
  #, gcc-internal-format, gfc-internal-format
  msgid "PARAMETER symbol in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1243
  #, gcc-internal-format
  msgid "gfc_match_sym_complex_part(): Bad type"
  msgstr ""
  
! #: fortran/primary.c:1250
  #, gcc-internal-format, gfc-internal-format
  msgid "Error converting PARAMETER constant in complex constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1379
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in COMPLEX constant at %C"
  msgstr ""
  
! #: fortran/primary.c:1586
  #, gcc-internal-format
  msgid "Keyword %qs at %C has already appeared in the current argument list"
  msgstr ""
  
! #: fortran/primary.c:1650
  #, gcc-internal-format, gfc-internal-format
  msgid "argument list function at %C"
  msgstr ""
  
! #: fortran/primary.c:1718
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected alternate return label at %C"
  msgstr ""
  
! #: fortran/primary.c:1740
  #, gcc-internal-format, gfc-internal-format
  msgid "Missing keyword name in actual argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:1786
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:1807
  #, gcc-internal-format
  msgid "extend_ref(): Bad tail"
  msgstr ""
  
! #: fortran/primary.c:1845
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Array section designator, e.g. '(:)', is required besides the coarray "
  "designator '[...]' at %C"
  msgstr ""
  
! #: fortran/primary.c:1853
  #, gcc-internal-format
  msgid "Coarray designator at %C but %qs is not a coarray"
  msgstr ""
  
! #: fortran/primary.c:1923
  #, gcc-internal-format
  msgid "Symbol %qs at %C has no IMPLICIT type"
  msgstr ""
  
! #: fortran/primary.c:1929
  #, gcc-internal-format
  msgid "Unexpected %<%%%> for nonderived-type variable %qs at %C"
  msgstr ""
  
! #: fortran/primary.c:1947
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected structure component name at %C"
  msgstr ""
  
! #: fortran/primary.c:1998
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:2029
  #, gcc-internal-format
  msgid "Procedure pointer component %qs requires an argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:2117
  #, gcc-internal-format, gfc-internal-format
  msgid "Coindexed procedure-pointer component at %C"
  msgstr ""
  
! #: fortran/primary.c:2152
  #, gcc-internal-format
  msgid "gfc_variable_attr(): Expression isn't a variable"
  msgstr ""
  
! #: fortran/primary.c:2207
  #, gcc-internal-format
  msgid "gfc_variable_attr(): Bad array reference"
  msgstr ""
  
! #: fortran/primary.c:2377
  #, gcc-internal-format, gfc-internal-format
  msgid "Structure constructor with missing optional arguments at %C"
  msgstr ""
  
! #: fortran/primary.c:2386
  #, gcc-internal-format
  msgid ""
  "No initializer for allocatable component '%qs' given in the structure "
  "constructor at %C"
  msgstr ""
  
! #: fortran/primary.c:2393
  #, gcc-internal-format
  msgid ""
  "No initializer for component %qs given in the structure constructor at %C!"
  msgstr ""
  
! #: fortran/primary.c:2441
  #, gcc-internal-format
  msgid "Can't construct ABSTRACT type %qs at %L"
  msgstr ""
  
! #: fortran/primary.c:2461
  #, gcc-internal-format, gfc-internal-format
  msgid "Structure constructor with named arguments at %C"
  msgstr ""
  
! #: fortran/primary.c:2476
  #, gcc-internal-format, gfc-internal-format
  msgid "Component initializer without name after component named %s at %L!"
  msgstr ""
  
! #: fortran/primary.c:2481
  #, gcc-internal-format, gfc-internal-format
  msgid "Too many components in structure constructor at %L!"
  msgstr ""
  
! #: fortran/primary.c:2518
  #, gcc-internal-format
  msgid "Component %qs is initialized twice in the structure constructor at %L!"
  msgstr ""
  
! #: fortran/primary.c:2530
  #, gcc-internal-format
  msgid ""
  "Coindexed expression to pointer component %qs in structure constructor at %L!"
  msgstr ""
  
! #: fortran/primary.c:2584
  #, gcc-internal-format
  msgid ""
  "component %qs at %L has already been set by a parent derived type constructor"
  msgstr ""
  
! #: fortran/primary.c:2767
  #, gcc-internal-format
  msgid ""
  "%qs at %C is the name of a recursive function and so refers to the result "
  "variable. Use an explicit RESULT variable for direct recursion (12.5.2.1)"
  msgstr ""
  
! #: fortran/primary.c:2890
  #, gcc-internal-format
  msgid "Unexpected use of subroutine name %qs at %C"
  msgstr ""
  
! #: fortran/primary.c:2921
  #, gcc-internal-format
  msgid "Statement function %qs requires argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:2924
  #, gcc-internal-format
  msgid "Function %qs requires an argument list at %C"
  msgstr ""
  
! #: fortran/primary.c:2974
  #, gcc-internal-format
  msgid "Missing argument to %qs at %C"
  msgstr ""
  
! #: fortran/primary.c:3130
  #, gcc-internal-format
  msgid "Missing argument list in function %qs at %C"
  msgstr ""
  
! #: fortran/primary.c:3164
  #, gcc-internal-format, gfc-internal-format
  msgid "Symbol at %C is not appropriate for an expression"
  msgstr ""
  
! #: fortran/primary.c:3263
  #, gcc-internal-format, gfc-internal-format
  msgid "Named constant at %C in an EQUIVALENCE"
  msgstr ""
  
! #: fortran/primary.c:3297
  #, gcc-internal-format
  msgid "%qs at %C is not a variable"
  msgstr ""
*************** msgid ""
*** 51983,51989 ****
  "Declare it RECURSIVE or use %<-frecursive%>"
  msgstr ""
  
! #: fortran/resolve.c:1773 fortran/resolve.c:8700 fortran/resolve.c:10195
  #, gcc-internal-format, gfc-internal-format
  msgid "Label %d referenced at %L is never defined"
  msgstr ""
--- 52375,52381 ----
  "Declare it RECURSIVE or use %<-frecursive%>"
  msgstr ""
  
! #: fortran/resolve.c:1773 fortran/resolve.c:8771 fortran/resolve.c:10322
  #, gcc-internal-format, gfc-internal-format
  msgid "Label %d referenced at %L is never defined"
  msgstr ""
*************** msgstr ""
*** 52100,52106 ****
  msgid "Unable to resolve the specific function %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:2732 fortran/resolve.c:14805
  #, gcc-internal-format
  msgid "Function %qs at %L has no IMPLICIT type"
  msgstr ""
--- 52492,52498 ----
  msgid "Unable to resolve the specific function %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:2732 fortran/resolve.c:14970
  #, gcc-internal-format
  msgid "Function %qs at %L has no IMPLICIT type"
  msgstr ""
*************** msgstr ""
*** 52392,52435 ****
  msgid "Substring end index at %L is too large"
  msgstr ""
  
! #: fortran/resolve.c:4664
  #, gcc-internal-format
  msgid "resolve_ref(): Bad array reference"
  msgstr ""
  
! #: fortran/resolve.c:4678
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Component to the right of a part reference with nonzero rank must not have "
  "the POINTER attribute at %L"
  msgstr ""
  
! #: fortran/resolve.c:4688
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Component to the right of a part reference with nonzero rank must not have "
  "the ALLOCATABLE attribute at %L"
  msgstr ""
  
! #: fortran/resolve.c:4707
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Two or more part references with nonzero rank must not be specified at %L"
  msgstr ""
  
! #: fortran/resolve.c:4805
  #, gcc-internal-format
  msgid "expression_rank(): Two array specs"
  msgstr ""
  
! #: fortran/resolve.c:4887
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute may only be used as actual "
  "argument"
  msgstr ""
  
! #: fortran/resolve.c:4897
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type variable %s at %L may only be used as actual argument"
  msgstr ""
--- 52784,52827 ----
  msgid "Substring end index at %L is too large"
  msgstr ""
  
! #: fortran/resolve.c:4670
  #, gcc-internal-format
  msgid "resolve_ref(): Bad array reference"
  msgstr ""
  
! #: fortran/resolve.c:4684
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Component to the right of a part reference with nonzero rank must not have "
  "the POINTER attribute at %L"
  msgstr ""
  
! #: fortran/resolve.c:4694
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Component to the right of a part reference with nonzero rank must not have "
  "the ALLOCATABLE attribute at %L"
  msgstr ""
  
! #: fortran/resolve.c:4713
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Two or more part references with nonzero rank must not be specified at %L"
  msgstr ""
  
! #: fortran/resolve.c:4811
  #, gcc-internal-format
  msgid "expression_rank(): Two array specs"
  msgstr ""
  
! #: fortran/resolve.c:4893
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute may only be used as actual "
  "argument"
  msgstr ""
  
! #: fortran/resolve.c:4903
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type variable %s at %L may only be used as actual argument"
  msgstr ""
*************** msgstr ""
*** 52438,52451 ****
  #. for all inquiry functions in resolve_function; the reason is
  #. that the function-name resolution happens too late in that
  #. function.
! #: fortran/resolve.c:4907
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-type variable %s at %L as actual argument to an inquiry function "
  "shall be the first argument"
  msgstr ""
  
! #: fortran/resolve.c:4922
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank variable %s at %L may only be used as actual argument"
  msgstr ""
--- 52830,52843 ----
  #. for all inquiry functions in resolve_function; the reason is
  #. that the function-name resolution happens too late in that
  #. function.
! #: fortran/resolve.c:4913
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-type variable %s at %L as actual argument to an inquiry function "
  "shall be the first argument"
  msgstr ""
  
! #: fortran/resolve.c:4928
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank variable %s at %L may only be used as actual argument"
  msgstr ""
*************** msgstr ""
*** 52454,52723 ****
  #. for all inquiry functions in resolve_function; the reason is
  #. that the function-name resolution happens too late in that
  #. function.
! #: fortran/resolve.c:4932
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-rank variable %s at %L as actual argument to an inquiry function "
  "shall be the first argument"
  msgstr ""
  
! #: fortran/resolve.c:4943
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute shall not have a subobject "
  "reference"
  msgstr ""
  
! #: fortran/resolve.c:4952
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type variable %s at %L shall not have a subobject reference"
  msgstr ""
  
! #: fortran/resolve.c:4967
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank variable %s at %L shall not have a subobject reference"
  msgstr ""
  
! #: fortran/resolve.c:5057
  #, gcc-internal-format
  msgid ""
  "Variable %qs, used in a specification expression, is referenced at %L before "
  "the ENTRY statement in which it is a parameter"
  msgstr ""
  
! #: fortran/resolve.c:5062
  #, gcc-internal-format
  msgid ""
  "Variable %qs is used at %L before the ENTRY statement in which it is a "
  "parameter"
  msgstr ""
  
! #: fortran/resolve.c:5132
  #, gcc-internal-format, gfc-internal-format
  msgid "Polymorphic subobject of coindexed object at %L"
  msgstr ""
  
! #: fortran/resolve.c:5145
  #, gcc-internal-format, gfc-internal-format
  msgid "Coindexed object with polymorphic allocatable subcomponent at %L"
  msgstr ""
  
! #: fortran/resolve.c:5483
  #, gcc-internal-format, gfc-internal-format
  msgid "Passed-object at %L must be scalar"
  msgstr ""
  
! #: fortran/resolve.c:5490
  #, gcc-internal-format
  msgid ""
  "Base object for procedure-pointer component call at %L is of ABSTRACT type "
  "%qs"
  msgstr ""
  
! #: fortran/resolve.c:5525
  #, gcc-internal-format
  msgid "Base object for type-bound procedure call at %L is of ABSTRACT type %qs"
  msgstr ""
  
! #: fortran/resolve.c:5534
  #, gcc-internal-format, gfc-internal-format
  msgid "Base object for NOPASS type-bound procedure call at %L must be scalar"
  msgstr ""
  
  #. Nothing matching found!
! #: fortran/resolve.c:5722
  #, gcc-internal-format
  msgid ""
  "Found no matching specific binding for the call to the GENERIC %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:5749
  #, gcc-internal-format
  msgid "%qs at %L should be a SUBROUTINE"
  msgstr ""
  
! #: fortran/resolve.c:5800
  #, gcc-internal-format
  msgid "%qs at %L should be a FUNCTION"
  msgstr ""
  
! #: fortran/resolve.c:6317
  #, gcc-internal-format
  msgid "gfc_resolve_expr(): Bad expression type"
  msgstr ""
  
! #: fortran/resolve.c:6343
  #, gcc-internal-format, gfc-internal-format
  msgid "%s at %L must be a scalar"
  msgstr ""
  
! #: fortran/resolve.c:6353
  #, gcc-internal-format, gfc-internal-format
  msgid "%s at %L must be integer"
  msgstr ""
  
! #: fortran/resolve.c:6357 fortran/resolve.c:6364
  #, gcc-internal-format, gfc-internal-format
  msgid "%s at %L must be INTEGER"
  msgstr ""
  
! #: fortran/resolve.c:6406
  #, gcc-internal-format, gfc-internal-format
  msgid "Step expression in DO loop at %L cannot be zero"
  msgstr ""
  
! #: fortran/resolve.c:6442
  #, gcc-internal-format, gfc-internal-format
  msgid "DO loop at %L will be executed zero times"
  msgstr ""
  
! #: fortran/resolve.c:6503
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL index-name at %L must be a scalar INTEGER"
  msgstr ""
  
! #: fortran/resolve.c:6508
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL start expression at %L must be a scalar INTEGER"
  msgstr ""
  
! #: fortran/resolve.c:6515
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL end expression at %L must be a scalar INTEGER"
  msgstr ""
  
! #: fortran/resolve.c:6523
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL stride expression at %L must be a scalar %s"
  msgstr ""
  
! #: fortran/resolve.c:6528
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL stride expression at %L cannot be zero"
  msgstr ""
  
! #: fortran/resolve.c:6541
  #, gcc-internal-format
  msgid "FORALL index %qs may not appear in triplet specification at %L"
  msgstr ""
  
! #: fortran/resolve.c:6639 fortran/resolve.c:6931
  #, gcc-internal-format, gfc-internal-format
  msgid "Allocate-object at %L must be ALLOCATABLE or a POINTER"
  msgstr ""
  
! #: fortran/resolve.c:6647 fortran/resolve.c:6896
  #, gcc-internal-format, gfc-internal-format
  msgid "Coindexed allocatable object at %L"
  msgstr ""
  
! #: fortran/resolve.c:6753
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Source-expr at %L must be scalar or have the same rank as the allocate-"
  "object at %L"
  msgstr ""
  
! #: fortran/resolve.c:6784
  #, gcc-internal-format, gfc-internal-format
  msgid "Source-expr at %L and allocate-object at %L must have the same shape"
  msgstr ""
  
! #: fortran/resolve.c:6942
  #, gcc-internal-format, gfc-internal-format
  msgid "Type of entity at %L is type incompatible with source-expr at %L"
  msgstr ""
  
! #: fortran/resolve.c:6954
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The allocate-object at %L and the source-expr at %L shall have the same kind "
  "type parameter"
  msgstr ""
  
! #: fortran/resolve.c:6968
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The source-expr at %L shall neither be of type LOCK_TYPE nor have a "
  "LOCK_TYPE component if allocate-object at %L is a coarray"
  msgstr ""
  
! #: fortran/resolve.c:6981
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocating %s of ABSTRACT base type at %L requires a type-spec or source-expr"
  msgstr ""
  
! #: fortran/resolve.c:6994
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocating %s at %L with type-spec requires the same character-length "
  "parameter as in the declaration"
  msgstr ""
  
! #: fortran/resolve.c:7102
  #, gcc-internal-format, gfc-internal-format
  msgid "Array specification required in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7116
  #, gcc-internal-format, gfc-internal-format
  msgid "Coarray specification required in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7143
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array specification in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7162
  #, gcc-internal-format
  msgid ""
  "%qs must not appear in the array specification at %L in the same ALLOCATE "
  "statement where it is itself allocated"
  msgstr ""
  
! #: fortran/resolve.c:7177
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected '*' in coindex specification in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7188
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad coarray specification in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7219
  #, gcc-internal-format, gfc-internal-format
  msgid "Stat-variable at %L must be a scalar INTEGER variable"
  msgstr ""
  
! #: fortran/resolve.c:7242
  #, gcc-internal-format, gfc-internal-format
  msgid "Stat-variable at %L shall not be %sd within the same %s statement"
  msgstr ""
  
! #: fortran/resolve.c:7253
  #, gcc-internal-format, gfc-internal-format
  msgid "ERRMSG at %L is useless without a STAT tag"
  msgstr ""
  
! #: fortran/resolve.c:7264
  #, gcc-internal-format, gfc-internal-format
  msgid "Errmsg-variable at %L must be a scalar CHARACTER variable"
  msgstr ""
  
! #: fortran/resolve.c:7287
  #, gcc-internal-format, gfc-internal-format
  msgid "Errmsg-variable at %L shall not be %sd within the same %s statement"
  msgstr ""
  
! #: fortran/resolve.c:7317
  #, gcc-internal-format, gfc-internal-format
  msgid "Allocate-object at %L also appears at %L"
  msgstr ""
  
! #: fortran/resolve.c:7323 fortran/resolve.c:7329
  #, gcc-internal-format, gfc-internal-format
  msgid "Allocate-object at %L is subobject of object at %L"
  msgstr ""
--- 52846,53122 ----
  #. for all inquiry functions in resolve_function; the reason is
  #. that the function-name resolution happens too late in that
  #. function.
! #: fortran/resolve.c:4938
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-rank variable %s at %L as actual argument to an inquiry function "
  "shall be the first argument"
  msgstr ""
  
! #: fortran/resolve.c:4949
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute shall not have a subobject "
  "reference"
  msgstr ""
  
! #: fortran/resolve.c:4958
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type variable %s at %L shall not have a subobject reference"
  msgstr ""
  
! #: fortran/resolve.c:4973
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank variable %s at %L shall not have a subobject reference"
  msgstr ""
  
! #: fortran/resolve.c:5068
  #, gcc-internal-format
  msgid ""
  "Variable %qs, used in a specification expression, is referenced at %L before "
  "the ENTRY statement in which it is a parameter"
  msgstr ""
  
! #: fortran/resolve.c:5073
  #, gcc-internal-format
  msgid ""
  "Variable %qs is used at %L before the ENTRY statement in which it is a "
  "parameter"
  msgstr ""
  
! #: fortran/resolve.c:5143
  #, gcc-internal-format, gfc-internal-format
  msgid "Polymorphic subobject of coindexed object at %L"
  msgstr ""
  
! #: fortran/resolve.c:5156
  #, gcc-internal-format, gfc-internal-format
  msgid "Coindexed object with polymorphic allocatable subcomponent at %L"
  msgstr ""
  
! #: fortran/resolve.c:5494
  #, gcc-internal-format, gfc-internal-format
  msgid "Passed-object at %L must be scalar"
  msgstr ""
  
! #: fortran/resolve.c:5501
  #, gcc-internal-format
  msgid ""
  "Base object for procedure-pointer component call at %L is of ABSTRACT type "
  "%qs"
  msgstr ""
  
! #: fortran/resolve.c:5536
  #, gcc-internal-format
  msgid "Base object for type-bound procedure call at %L is of ABSTRACT type %qs"
  msgstr ""
  
! #: fortran/resolve.c:5545
  #, gcc-internal-format, gfc-internal-format
  msgid "Base object for NOPASS type-bound procedure call at %L must be scalar"
  msgstr ""
  
  #. Nothing matching found!
! #: fortran/resolve.c:5733
  #, gcc-internal-format
  msgid ""
  "Found no matching specific binding for the call to the GENERIC %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:5760
  #, gcc-internal-format
  msgid "%qs at %L should be a SUBROUTINE"
  msgstr ""
  
! #: fortran/resolve.c:5811
  #, gcc-internal-format
  msgid "%qs at %L should be a FUNCTION"
  msgstr ""
  
! #: fortran/resolve.c:6328
  #, gcc-internal-format
  msgid "gfc_resolve_expr(): Bad expression type"
  msgstr ""
  
! #: fortran/resolve.c:6354
  #, gcc-internal-format, gfc-internal-format
  msgid "%s at %L must be a scalar"
  msgstr ""
  
! #: fortran/resolve.c:6364
  #, gcc-internal-format, gfc-internal-format
  msgid "%s at %L must be integer"
  msgstr ""
  
! #: fortran/resolve.c:6368 fortran/resolve.c:6375
  #, gcc-internal-format, gfc-internal-format
  msgid "%s at %L must be INTEGER"
  msgstr ""
  
! #: fortran/resolve.c:6417
  #, gcc-internal-format, gfc-internal-format
  msgid "Step expression in DO loop at %L cannot be zero"
  msgstr ""
  
! #: fortran/resolve.c:6453
  #, gcc-internal-format, gfc-internal-format
  msgid "DO loop at %L will be executed zero times"
  msgstr ""
  
! #: fortran/resolve.c:6514
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL index-name at %L must be a scalar INTEGER"
  msgstr ""
  
! #: fortran/resolve.c:6519
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL start expression at %L must be a scalar INTEGER"
  msgstr ""
  
! #: fortran/resolve.c:6526
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL end expression at %L must be a scalar INTEGER"
  msgstr ""
  
! #: fortran/resolve.c:6534
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL stride expression at %L must be a scalar %s"
  msgstr ""
  
! #: fortran/resolve.c:6539
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL stride expression at %L cannot be zero"
  msgstr ""
  
! #: fortran/resolve.c:6552
  #, gcc-internal-format
  msgid "FORALL index %qs may not appear in triplet specification at %L"
  msgstr ""
  
! #: fortran/resolve.c:6650 fortran/resolve.c:6942
  #, gcc-internal-format, gfc-internal-format
  msgid "Allocate-object at %L must be ALLOCATABLE or a POINTER"
  msgstr ""
  
! #: fortran/resolve.c:6658 fortran/resolve.c:6907
  #, gcc-internal-format, gfc-internal-format
  msgid "Coindexed allocatable object at %L"
  msgstr ""
  
! #: fortran/resolve.c:6764
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Source-expr at %L must be scalar or have the same rank as the allocate-"
  "object at %L"
  msgstr ""
  
! #: fortran/resolve.c:6795
  #, gcc-internal-format, gfc-internal-format
  msgid "Source-expr at %L and allocate-object at %L must have the same shape"
  msgstr ""
  
! #: fortran/resolve.c:6953
  #, gcc-internal-format, gfc-internal-format
  msgid "Type of entity at %L is type incompatible with source-expr at %L"
  msgstr ""
  
! #: fortran/resolve.c:6965
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The allocate-object at %L and the source-expr at %L shall have the same kind "
  "type parameter"
  msgstr ""
  
! #: fortran/resolve.c:6979
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The source-expr at %L shall neither be of type LOCK_TYPE nor have a "
  "LOCK_TYPE component if allocate-object at %L is a coarray"
  msgstr ""
  
! #: fortran/resolve.c:6994
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "The source-expr at %L shall neither be of type EVENT_TYPE nor have a "
! "EVENT_TYPE component if allocate-object at %L is a coarray"
! msgstr ""
! 
! #: fortran/resolve.c:7007
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocating %s of ABSTRACT base type at %L requires a type-spec or source-expr"
  msgstr ""
  
! #: fortran/resolve.c:7020
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Allocating %s at %L with type-spec requires the same character-length "
  "parameter as in the declaration"
  msgstr ""
  
! #: fortran/resolve.c:7135
  #, gcc-internal-format, gfc-internal-format
  msgid "Array specification required in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7149
  #, gcc-internal-format, gfc-internal-format
  msgid "Coarray specification required in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7176
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array specification in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7195
  #, gcc-internal-format
  msgid ""
  "%qs must not appear in the array specification at %L in the same ALLOCATE "
  "statement where it is itself allocated"
  msgstr ""
  
! #: fortran/resolve.c:7210
  #, gcc-internal-format, gfc-internal-format
  msgid "Expected '*' in coindex specification in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7221
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad coarray specification in ALLOCATE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:7252
  #, gcc-internal-format, gfc-internal-format
  msgid "Stat-variable at %L must be a scalar INTEGER variable"
  msgstr ""
  
! #: fortran/resolve.c:7275
  #, gcc-internal-format, gfc-internal-format
  msgid "Stat-variable at %L shall not be %sd within the same %s statement"
  msgstr ""
  
! #: fortran/resolve.c:7286
  #, gcc-internal-format, gfc-internal-format
  msgid "ERRMSG at %L is useless without a STAT tag"
  msgstr ""
  
! #: fortran/resolve.c:7297
  #, gcc-internal-format, gfc-internal-format
  msgid "Errmsg-variable at %L must be a scalar CHARACTER variable"
  msgstr ""
  
! #: fortran/resolve.c:7320
  #, gcc-internal-format, gfc-internal-format
  msgid "Errmsg-variable at %L shall not be %sd within the same %s statement"
  msgstr ""
  
! #: fortran/resolve.c:7350
  #, gcc-internal-format, gfc-internal-format
  msgid "Allocate-object at %L also appears at %L"
  msgstr ""
  
! #: fortran/resolve.c:7356 fortran/resolve.c:7362
  #, gcc-internal-format, gfc-internal-format
  msgid "Allocate-object at %L is subobject of object at %L"
  msgstr ""
*************** msgstr ""
*** 52726,52939 ****
  #. element in the list.  Either way, we must
  #. issue an error and get the next case from P.
  #. FIXME: Sort P and Q by line number.
! #: fortran/resolve.c:7533
  #, gcc-internal-format, gfc-internal-format
  msgid "CASE label at %L overlaps with CASE label at %L"
  msgstr ""
  
! #: fortran/resolve.c:7584
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression in CASE statement at %L must be of type %s"
  msgstr ""
  
! #: fortran/resolve.c:7595
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression in CASE statement at %L must be of kind %d"
  msgstr ""
  
! #: fortran/resolve.c:7608
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression in CASE statement at %L must be scalar"
  msgstr ""
  
! #: fortran/resolve.c:7654
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Selection expression in computed GOTO statement at %L must be a scalar "
  "integer expression"
  msgstr ""
  
! #: fortran/resolve.c:7673
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of SELECT statement at %L cannot be %s"
  msgstr ""
  
! #: fortran/resolve.c:7683
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of SELECT statement at %L must be a scalar expression"
  msgstr ""
  
! #: fortran/resolve.c:7701 fortran/resolve.c:7709
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression in CASE statement at %L is not in the range of %s"
  msgstr ""
  
! #: fortran/resolve.c:7771 fortran/resolve.c:8144
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The DEFAULT CASE at %L cannot be followed by a second DEFAULT CASE at %L"
  msgstr ""
  
! #: fortran/resolve.c:7797
  #, gcc-internal-format, gfc-internal-format
  msgid "Logical range in CASE statement at %L is not allowed"
  msgstr ""
  
! #: fortran/resolve.c:7809
  #, gcc-internal-format, gfc-internal-format
  msgid "Constant logical value in CASE statement is repeated at %L"
  msgstr ""
  
! #: fortran/resolve.c:7824
  #, gcc-internal-format, gfc-internal-format
  msgid "Range specification at %L can never be matched"
  msgstr ""
  
! #: fortran/resolve.c:7927
  #, gcc-internal-format, gfc-internal-format
  msgid "Logical SELECT CASE block at %L has more that two cases"
  msgstr ""
  
! #: fortran/resolve.c:7999
  #, gcc-internal-format
  msgid "Associate-name %qs at %L is used as array"
  msgstr ""
  
! #: fortran/resolve.c:8009
  #, gcc-internal-format, gfc-internal-format
  msgid "CLASS selector at %L needs a temporary which is not yet implemented"
  msgstr ""
  
! #: fortran/resolve.c:8063
  #, gcc-internal-format, gfc-internal-format
  msgid "Selector shall be polymorphic in SELECT TYPE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:8080 fortran/resolve.c:8092
  #, gcc-internal-format, gfc-internal-format
  msgid "Selector at %L must not be coindexed"
  msgstr ""
  
! #: fortran/resolve.c:8108
  #, gcc-internal-format
  msgid "Derived type %qs at %L must be extensible"
  msgstr ""
  
! #: fortran/resolve.c:8120
  #, gcc-internal-format
  msgid "Derived type %qs at %L must be an extension of %qs"
  msgstr ""
  
! #: fortran/resolve.c:8123
  #, gcc-internal-format
  msgid "Unexpected intrinsic type %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:8132
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The type-spec at %L shall specify that each length type parameter is assumed"
  msgstr ""
  
! #: fortran/resolve.c:8324
  #, gcc-internal-format, gfc-internal-format
  msgid "Double CLASS IS block in SELECT TYPE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:8413
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid context for NULL () intrinsic at %L"
  msgstr ""
  
  #. FIXME: Test for defined input/output.
! #: fortran/resolve.c:8441
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Data transfer element at %L cannot be polymorphic unless it is processed by "
  "a defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:8453
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Data transfer element at %L cannot have POINTER components unless it is "
  "processed by a defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:8462
  #, gcc-internal-format, gfc-internal-format
  msgid "Data transfer element at %L cannot have procedure pointer components"
  msgstr ""
  
! #: fortran/resolve.c:8469
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Data transfer element at %L cannot have ALLOCATABLE components unless it is "
  "processed by a defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:8480 fortran/resolve.c:8486
  #, gcc-internal-format, gfc-internal-format
  msgid "Data transfer element at %L cannot have PRIVATE components"
  msgstr ""
  
! #: fortran/resolve.c:8500
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Data transfer element at %L cannot be a full reference to an assumed-size "
  "array"
  msgstr ""
  
! #: fortran/resolve.c:8555
  #, gcc-internal-format, gfc-internal-format
  msgid "Lock variable at %L must be a scalar of type LOCK_TYPE"
  msgstr ""
  
! #: fortran/resolve.c:8562 fortran/resolve.c:8673
  #, gcc-internal-format, gfc-internal-format
  msgid "STAT= argument at %L must be a scalar INTEGER variable"
  msgstr ""
  
! #: fortran/resolve.c:8574 fortran/resolve.c:8680
  #, gcc-internal-format, gfc-internal-format
  msgid "ERRMSG= argument at %L must be a scalar CHARACTER variable"
  msgstr ""
  
! #: fortran/resolve.c:8586
  #, gcc-internal-format, gfc-internal-format
  msgid "ACQUIRED_LOCK= argument at %L must be a scalar LOGICAL variable"
  msgstr ""
  
! #: fortran/resolve.c:8650
  #, gcc-internal-format, gfc-internal-format
  msgid "Imageset argument at %L must be a scalar or rank-1 INTEGER expression"
  msgstr ""
  
! #: fortran/resolve.c:8654 fortran/resolve.c:8664
  #, gcc-internal-format, gfc-internal-format
  msgid "Imageset argument at %L must between 1 and num_images()"
  msgstr ""
  
! #: fortran/resolve.c:8707
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Statement at %L is not a valid branch target statement for the branch "
  "statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:8717
  #, gcc-internal-format, gfc-internal-format
  msgid "Branch at %L may result in an infinite loop"
  msgstr ""
  
  #. Note: A label at END CRITICAL does not leave the CRITICAL
  #. construct as END CRITICAL is still part of it.
! #: fortran/resolve.c:8734 fortran/resolve.c:8757
  #, gcc-internal-format, gfc-internal-format
  msgid "GOTO statement at %L leaves CRITICAL construct for label at %L"
  msgstr ""
  
! #: fortran/resolve.c:8738 fortran/resolve.c:8763
  #, gcc-internal-format, gfc-internal-format
  msgid "GOTO statement at %L leaves DO CONCURRENT construct for label at %L"
  msgstr ""
--- 53125,53358 ----
  #. element in the list.  Either way, we must
  #. issue an error and get the next case from P.
  #. FIXME: Sort P and Q by line number.
! #: fortran/resolve.c:7566
  #, gcc-internal-format, gfc-internal-format
  msgid "CASE label at %L overlaps with CASE label at %L"
  msgstr ""
  
! #: fortran/resolve.c:7617
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression in CASE statement at %L must be of type %s"
  msgstr ""
  
! #: fortran/resolve.c:7628
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression in CASE statement at %L must be of kind %d"
  msgstr ""
  
! #: fortran/resolve.c:7641
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression in CASE statement at %L must be scalar"
  msgstr ""
  
! #: fortran/resolve.c:7687
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Selection expression in computed GOTO statement at %L must be a scalar "
  "integer expression"
  msgstr ""
  
! #: fortran/resolve.c:7706
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of SELECT statement at %L cannot be %s"
  msgstr ""
  
! #: fortran/resolve.c:7716
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of SELECT statement at %L must be a scalar expression"
  msgstr ""
  
! #: fortran/resolve.c:7734 fortran/resolve.c:7742
  #, gcc-internal-format, gfc-internal-format
  msgid "Expression in CASE statement at %L is not in the range of %s"
  msgstr ""
  
! #: fortran/resolve.c:7804 fortran/resolve.c:8189
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The DEFAULT CASE at %L cannot be followed by a second DEFAULT CASE at %L"
  msgstr ""
  
! #: fortran/resolve.c:7830
  #, gcc-internal-format, gfc-internal-format
  msgid "Logical range in CASE statement at %L is not allowed"
  msgstr ""
  
! #: fortran/resolve.c:7842
  #, gcc-internal-format, gfc-internal-format
  msgid "Constant logical value in CASE statement is repeated at %L"
  msgstr ""
  
! #: fortran/resolve.c:7857
  #, gcc-internal-format, gfc-internal-format
  msgid "Range specification at %L can never be matched"
  msgstr ""
  
! #: fortran/resolve.c:7960
  #, gcc-internal-format, gfc-internal-format
  msgid "Logical SELECT CASE block at %L has more that two cases"
  msgstr ""
  
! #: fortran/resolve.c:8032
  #, gcc-internal-format
  msgid "Associate-name %qs at %L is used as array"
  msgstr ""
  
! #: fortran/resolve.c:8042
  #, gcc-internal-format, gfc-internal-format
  msgid "CLASS selector at %L needs a temporary which is not yet implemented"
  msgstr ""
  
! #: fortran/resolve.c:8108
  #, gcc-internal-format, gfc-internal-format
  msgid "Selector shall be polymorphic in SELECT TYPE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:8125 fortran/resolve.c:8137
  #, gcc-internal-format, gfc-internal-format
  msgid "Selector at %L must not be coindexed"
  msgstr ""
  
! #: fortran/resolve.c:8153
  #, gcc-internal-format
  msgid "Derived type %qs at %L must be extensible"
  msgstr ""
  
! #: fortran/resolve.c:8165
  #, gcc-internal-format
  msgid "Derived type %qs at %L must be an extension of %qs"
  msgstr ""
  
! #: fortran/resolve.c:8168
  #, gcc-internal-format
  msgid "Unexpected intrinsic type %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:8177
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The type-spec at %L shall specify that each length type parameter is assumed"
  msgstr ""
  
! #: fortran/resolve.c:8369
  #, gcc-internal-format, gfc-internal-format
  msgid "Double CLASS IS block in SELECT TYPE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:8458
  #, gcc-internal-format, gfc-internal-format
  msgid "Invalid context for NULL () intrinsic at %L"
  msgstr ""
  
  #. FIXME: Test for defined input/output.
! #: fortran/resolve.c:8486
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Data transfer element at %L cannot be polymorphic unless it is processed by "
  "a defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:8498
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Data transfer element at %L cannot have POINTER components unless it is "
  "processed by a defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:8507
  #, gcc-internal-format, gfc-internal-format
  msgid "Data transfer element at %L cannot have procedure pointer components"
  msgstr ""
  
! #: fortran/resolve.c:8514
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Data transfer element at %L cannot have ALLOCATABLE components unless it is "
  "processed by a defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:8525 fortran/resolve.c:8531
  #, gcc-internal-format, gfc-internal-format
  msgid "Data transfer element at %L cannot have PRIVATE components"
  msgstr ""
  
! #: fortran/resolve.c:8545
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Data transfer element at %L cannot be a full reference to an assumed-size "
  "array"
  msgstr ""
  
! #: fortran/resolve.c:8602
  #, gcc-internal-format, gfc-internal-format
  msgid "Lock variable at %L must be a scalar of type LOCK_TYPE"
  msgstr ""
  
! #: fortran/resolve.c:8612
! #, gcc-internal-format, gfc-internal-format
! msgid "Event variable at %L must be a scalar of type EVENT_TYPE"
! msgstr ""
! 
! #: fortran/resolve.c:8616
! #, gcc-internal-format, gfc-internal-format
! msgid "Event variable argument at %L must be a coarray or coindexed"
! msgstr ""
! 
! #: fortran/resolve.c:8619
! #, gcc-internal-format, gfc-internal-format
! msgid "Event variable argument at %L must be a coarray but not coindexed"
! msgstr ""
! 
! #: fortran/resolve.c:8626 fortran/resolve.c:8744
  #, gcc-internal-format, gfc-internal-format
  msgid "STAT= argument at %L must be a scalar INTEGER variable"
  msgstr ""
  
! #: fortran/resolve.c:8638 fortran/resolve.c:8751
  #, gcc-internal-format, gfc-internal-format
  msgid "ERRMSG= argument at %L must be a scalar CHARACTER variable"
  msgstr ""
  
! #: fortran/resolve.c:8650
  #, gcc-internal-format, gfc-internal-format
  msgid "ACQUIRED_LOCK= argument at %L must be a scalar LOGICAL variable"
  msgstr ""
  
! #: fortran/resolve.c:8661
! #, gcc-internal-format, gfc-internal-format
! msgid "UNTIL_COUNT= argument at %L must be a scalar INTEGER expression"
! msgstr ""
! 
! #: fortran/resolve.c:8721
  #, gcc-internal-format, gfc-internal-format
  msgid "Imageset argument at %L must be a scalar or rank-1 INTEGER expression"
  msgstr ""
  
! #: fortran/resolve.c:8725 fortran/resolve.c:8735
  #, gcc-internal-format, gfc-internal-format
  msgid "Imageset argument at %L must between 1 and num_images()"
  msgstr ""
  
! #: fortran/resolve.c:8778
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Statement at %L is not a valid branch target statement for the branch "
  "statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:8788
  #, gcc-internal-format, gfc-internal-format
  msgid "Branch at %L may result in an infinite loop"
  msgstr ""
  
  #. Note: A label at END CRITICAL does not leave the CRITICAL
  #. construct as END CRITICAL is still part of it.
! #: fortran/resolve.c:8805 fortran/resolve.c:8828
  #, gcc-internal-format, gfc-internal-format
  msgid "GOTO statement at %L leaves CRITICAL construct for label at %L"
  msgstr ""
  
! #: fortran/resolve.c:8809 fortran/resolve.c:8834
  #, gcc-internal-format, gfc-internal-format
  msgid "GOTO statement at %L leaves DO CONCURRENT construct for label at %L"
  msgstr ""
*************** msgstr ""
*** 52941,53033 ****
  #. The label is not in an enclosing block, so illegal.  This was
  #. allowed in Fortran 66, so we allow it as extension.  No
  #. further checks are necessary in this case.
! #: fortran/resolve.c:8778
  #, gcc-internal-format, gfc-internal-format
  msgid "Label at %L is not in the same block as the GOTO statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:8850
  #, gcc-internal-format, gfc-internal-format
  msgid "WHERE mask at %L has inconsistent shape"
  msgstr ""
  
! #: fortran/resolve.c:8866
  #, gcc-internal-format, gfc-internal-format
  msgid "WHERE assignment target at %L has inconsistent shape"
  msgstr ""
  
! #: fortran/resolve.c:8874 fortran/resolve.c:8961
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-ELEMENTAL user-defined assignment in WHERE at %L"
  msgstr ""
  
! #: fortran/resolve.c:8884 fortran/resolve.c:8971
  #, gcc-internal-format, gfc-internal-format
  msgid "Unsupported statement inside WHERE at %L"
  msgstr ""
  
! #: fortran/resolve.c:8915
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment to a FORALL index variable at %L"
  msgstr ""
  
! #: fortran/resolve.c:8924
  #, gcc-internal-format
  msgid ""
  "The FORALL with index %qs is not used on the left side of the assignment at "
  "%L and so might cause multiple assignment to this object"
  msgstr ""
  
! #: fortran/resolve.c:9093
  #, gcc-internal-format, gfc-internal-format
  msgid "An outer FORALL construct already has an index with this name %L"
  msgstr ""
  
! #: fortran/resolve.c:9171
  #, gcc-internal-format, gfc-internal-format
  msgid "WHERE/ELSEWHERE clause at %L requires a LOGICAL array"
  msgstr ""
  
! #: fortran/resolve.c:9247
  #, gcc-internal-format
  msgid "gfc_resolve_blocks(): Bad block type"
  msgstr ""
  
! #: fortran/resolve.c:9361
  #, gcc-internal-format, gfc-internal-format
  msgid "CHARACTER expression will be truncated in assignment (%d/%d) at %L"
  msgstr ""
  
! #: fortran/resolve.c:9393
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Coindexed expression at %L is assigned to a derived type variable with a "
  "POINTER component in a PURE procedure"
  msgstr ""
  
! #: fortran/resolve.c:9398
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The impure variable at %L is assigned to a derived type variable with a "
  "POINTER component in a PURE procedure (12.6)"
  msgstr ""
  
! #: fortran/resolve.c:9408
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment to coindexed variable at %L in a PURE procedure"
  msgstr ""
  
! #: fortran/resolve.c:9440
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment to polymorphic coarray at %L is not permitted"
  msgstr ""
  
! #: fortran/resolve.c:9444
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment to an allocatable polymorphic variable at %L"
  msgstr ""
  
! #: fortran/resolve.c:9449
  #, gcc-internal-format
  msgid ""
  "Assignment to an allocatable polymorphic variable at %L requires %<-frealloc-"
--- 53360,53457 ----
  #. The label is not in an enclosing block, so illegal.  This was
  #. allowed in Fortran 66, so we allow it as extension.  No
  #. further checks are necessary in this case.
! #: fortran/resolve.c:8849
  #, gcc-internal-format, gfc-internal-format
  msgid "Label at %L is not in the same block as the GOTO statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:8921
  #, gcc-internal-format, gfc-internal-format
  msgid "WHERE mask at %L has inconsistent shape"
  msgstr ""
  
! #: fortran/resolve.c:8937
  #, gcc-internal-format, gfc-internal-format
  msgid "WHERE assignment target at %L has inconsistent shape"
  msgstr ""
  
! #: fortran/resolve.c:8945 fortran/resolve.c:9032
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-ELEMENTAL user-defined assignment in WHERE at %L"
  msgstr ""
  
! #: fortran/resolve.c:8955 fortran/resolve.c:9042
  #, gcc-internal-format, gfc-internal-format
  msgid "Unsupported statement inside WHERE at %L"
  msgstr ""
  
! #: fortran/resolve.c:8986
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment to a FORALL index variable at %L"
  msgstr ""
  
! #: fortran/resolve.c:8995
  #, gcc-internal-format
  msgid ""
  "The FORALL with index %qs is not used on the left side of the assignment at "
  "%L and so might cause multiple assignment to this object"
  msgstr ""
  
! #: fortran/resolve.c:9160
! #, gcc-internal-format, gfc-internal-format
! msgid "FORALL index-name at %L must be a scalar variable of type integer"
! msgstr ""
! 
! #: fortran/resolve.c:9170
  #, gcc-internal-format, gfc-internal-format
  msgid "An outer FORALL construct already has an index with this name %L"
  msgstr ""
  
! #: fortran/resolve.c:9247
  #, gcc-internal-format, gfc-internal-format
  msgid "WHERE/ELSEWHERE clause at %L requires a LOGICAL array"
  msgstr ""
  
! #: fortran/resolve.c:9323
  #, gcc-internal-format
  msgid "gfc_resolve_blocks(): Bad block type"
  msgstr ""
  
! #: fortran/resolve.c:9437
  #, gcc-internal-format, gfc-internal-format
  msgid "CHARACTER expression will be truncated in assignment (%d/%d) at %L"
  msgstr ""
  
! #: fortran/resolve.c:9469
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Coindexed expression at %L is assigned to a derived type variable with a "
  "POINTER component in a PURE procedure"
  msgstr ""
  
! #: fortran/resolve.c:9474
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The impure variable at %L is assigned to a derived type variable with a "
  "POINTER component in a PURE procedure (12.6)"
  msgstr ""
  
! #: fortran/resolve.c:9484
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment to coindexed variable at %L in a PURE procedure"
  msgstr ""
  
! #: fortran/resolve.c:9516
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment to polymorphic coarray at %L is not permitted"
  msgstr ""
  
! #: fortran/resolve.c:9520
  #, gcc-internal-format, gfc-internal-format
  msgid "Assignment to an allocatable polymorphic variable at %L"
  msgstr ""
  
! #: fortran/resolve.c:9525
  #, gcc-internal-format
  msgid ""
  "Assignment to an allocatable polymorphic variable at %L requires %<-frealloc-"
*************** msgid ""
*** 53035,53115 ****
  msgstr ""
  
  #. See PR 43366.
! #: fortran/resolve.c:9454
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assignment to an allocatable polymorphic variable at %L is not yet supported"
  msgstr ""
  
! #: fortran/resolve.c:9460
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Nonallocatable variable must not be polymorphic in intrinsic assignment at "
  "%L - check that there is a matching specific subroutine for '=' operator"
  msgstr ""
  
! #: fortran/resolve.c:9471
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Coindexed variable must not have an allocatable ultimate component in "
  "assignment at %L"
  msgstr ""
  
! #: fortran/resolve.c:9766
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "TODO: type-bound defined assignment(s) at %L not done because multiple part "
  "array references would occur in intermediate expressions."
  msgstr ""
  
! #: fortran/resolve.c:10141
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSIGNED GOTO statement at %L requires an INTEGER variable"
  msgstr ""
  
! #: fortran/resolve.c:10144
  #, gcc-internal-format
  msgid "Variable %qs has not been assigned a target label at %L"
  msgstr ""
  
! #: fortran/resolve.c:10155
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Alternate RETURN statement at %L requires a SCALAR-INTEGER return specifier"
  msgstr ""
  
! #: fortran/resolve.c:10203
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSIGN statement at %L requires a scalar default INTEGER variable"
  msgstr ""
  
! #: fortran/resolve.c:10236
  #, gcc-internal-format, gfc-internal-format
! msgid "Arithmetic IF statement at %L requires a numeric expression"
  msgstr ""
  
! #: fortran/resolve.c:10291
  #, gcc-internal-format
  msgid "gfc_resolve_code(): No expression on DO WHILE"
  msgstr ""
  
! #: fortran/resolve.c:10296
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Exit condition of DO WHILE loop at %L must be a scalar LOGICAL expression"
  msgstr ""
  
! #: fortran/resolve.c:10380
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL mask clause at %L requires a scalar LOGICAL expression"
  msgstr ""
  
! #: fortran/resolve.c:10449
  #, gcc-internal-format
  msgid "gfc_resolve_code(): Bad statement code"
  msgstr ""
  
! #: fortran/resolve.c:10544
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s with binding label %s at %L uses the same global identifier as "
--- 53459,53545 ----
  msgstr ""
  
  #. See PR 43366.
! #: fortran/resolve.c:9530
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assignment to an allocatable polymorphic variable at %L is not yet supported"
  msgstr ""
  
! #: fortran/resolve.c:9536
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Nonallocatable variable must not be polymorphic in intrinsic assignment at "
  "%L - check that there is a matching specific subroutine for '=' operator"
  msgstr ""
  
! #: fortran/resolve.c:9547
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Coindexed variable must not have an allocatable ultimate component in "
  "assignment at %L"
  msgstr ""
  
! #: fortran/resolve.c:9842
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "TODO: type-bound defined assignment(s) at %L not done because multiple part "
  "array references would occur in intermediate expressions."
  msgstr ""
  
! #: fortran/resolve.c:10263
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSIGNED GOTO statement at %L requires an INTEGER variable"
  msgstr ""
  
! #: fortran/resolve.c:10266
  #, gcc-internal-format
  msgid "Variable %qs has not been assigned a target label at %L"
  msgstr ""
  
! #: fortran/resolve.c:10277
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Alternate RETURN statement at %L requires a SCALAR-INTEGER return specifier"
  msgstr ""
  
! #: fortran/resolve.c:10330
  #, gcc-internal-format, gfc-internal-format
  msgid "ASSIGN statement at %L requires a scalar default INTEGER variable"
  msgstr ""
  
! #: fortran/resolve.c:10365
  #, gcc-internal-format, gfc-internal-format
! msgid "Invalid NULL at %L"
  msgstr ""
  
! #: fortran/resolve.c:10369
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "Arithmetic IF statement at %L requires a scalar REAL or INTEGER expression"
! msgstr ""
! 
! #: fortran/resolve.c:10425
  #, gcc-internal-format
  msgid "gfc_resolve_code(): No expression on DO WHILE"
  msgstr ""
  
! #: fortran/resolve.c:10430
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Exit condition of DO WHILE loop at %L must be a scalar LOGICAL expression"
  msgstr ""
  
! #: fortran/resolve.c:10514
  #, gcc-internal-format, gfc-internal-format
  msgid "FORALL mask clause at %L requires a scalar LOGICAL expression"
  msgstr ""
  
! #: fortran/resolve.c:10583
  #, gcc-internal-format
  msgid "gfc_resolve_code(): Bad statement code"
  msgstr ""
  
! #: fortran/resolve.c:10678
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s with binding label %s at %L uses the same global identifier as "
*************** msgstr ""
*** 53118,53124 ****
  
  #. This can only happen if the variable is defined in a module - if it
  #. isn't the same module, reject it.
! #: fortran/resolve.c:10557
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s from module %s with binding label %s at %L uses the same global "
--- 53548,53554 ----
  
  #. This can only happen if the variable is defined in a module - if it
  #. isn't the same module, reject it.
! #: fortran/resolve.c:10691
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s from module %s with binding label %s at %L uses the same global "
*************** msgstr ""
*** 53128,53654 ****
  #. Print an error if the procedure is defined multiple times; we have to
  #. exclude references to the same procedure via module association or
  #. multiple checks for the same procedure.
! #: fortran/resolve.c:10574
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Procedure %s with binding label %s at %L uses the same global identifier as "
  "entity at %L"
  msgstr ""
  
! #: fortran/resolve.c:10645
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "CHARACTER variable at %L has negative length %d, the length has been set to "
! "zero"
! msgstr ""
! 
! #: fortran/resolve.c:10658
  #, gcc-internal-format, gfc-internal-format
  msgid "String length at %L is too large"
  msgstr ""
  
! #: fortran/resolve.c:10994
  #, gcc-internal-format
  msgid "Allocatable array %qs at %L must have a deferred shape or assumed rank"
  msgstr ""
  
! #: fortran/resolve.c:10998
  #, gcc-internal-format
  msgid "Scalar object %qs at %L may not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:11006
  #, gcc-internal-format
  msgid "Array pointer %qs at %L must have a deferred shape or assumed rank"
  msgstr ""
  
! #: fortran/resolve.c:11016
  #, gcc-internal-format
  msgid "Array %qs at %L cannot have a deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:11031
  #, gcc-internal-format
  msgid "Type %qs of CLASS variable %qs at %L is not extensible"
  msgstr ""
  
! #: fortran/resolve.c:11043
  #, gcc-internal-format
  msgid "CLASS variable %qs at %L must be dummy, allocatable or pointer"
  msgstr ""
  
! #: fortran/resolve.c:11074
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The type '%s' cannot be host associated at %L because it is blocked by an "
  "incompatible object of the same name declared at %L"
  msgstr ""
  
! #: fortran/resolve.c:11096
  #, gcc-internal-format
  msgid ""
  "Implied SAVE for module variable %qs at %L, needed due to the default "
  "initialization"
  msgstr ""
  
  #. The shape of a main program or module array needs to be
  #. constant.
! #: fortran/resolve.c:11144
  #, gcc-internal-format, gfc-internal-format
  msgid "The module or main program array '%s' at %L must have constant shape"
  msgstr ""
  
! #: fortran/resolve.c:11156
! #, gcc-internal-format
! msgid ""
! "Entity %qs at %L has a deferred type parameter and requires either the "
! "pointer or allocatable attribute"
! msgstr ""
! 
! #: fortran/resolve.c:11172
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Entity with assumed character length at %L must be a dummy argument or a "
  "PARAMETER"
  msgstr ""
  
! #: fortran/resolve.c:11193
  #, gcc-internal-format, gfc-internal-format
  msgid "'%s' at %L must have constant character length in this context"
  msgstr ""
  
! #: fortran/resolve.c:11200
  #, gcc-internal-format
  msgid "COMMON variable %qs at %L must have constant character length"
  msgstr ""
  
! #: fortran/resolve.c:11247
  #, gcc-internal-format
  msgid "Allocatable %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11250
  #, gcc-internal-format
  msgid "External %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11254
  #, gcc-internal-format
  msgid "Dummy %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11257
  #, gcc-internal-format
  msgid "Intrinsic %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11260
  #, gcc-internal-format
  msgid "Function result %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11263
  #, gcc-internal-format
  msgid "Automatic array %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11306
  #, gcc-internal-format
  msgid "Character-valued statement function %qs at %L must have constant length"
  msgstr ""
  
! #: fortran/resolve.c:11328
  #, gcc-internal-format
  msgid ""
  "%qs is of a PRIVATE type and cannot be a dummy argument of %qs, which is "
  "PUBLIC at %L"
  msgstr ""
  
! #: fortran/resolve.c:11350
  #, gcc-internal-format
  msgid ""
  "Procedure %qs in PUBLIC interface %qs at %L takes dummy arguments of %qs "
  "which is PRIVATE"
  msgstr ""
  
! #: fortran/resolve.c:11368
  #, gcc-internal-format
  msgid "Function %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11377
  #, gcc-internal-format
  msgid "External object %qs at %L may not have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11385
  #, gcc-internal-format
  msgid "ELEMENTAL function %qs at %L must have a scalar result"
  msgstr ""
  
! #: fortran/resolve.c:11395
  #, gcc-internal-format
  msgid ""
  "Statement function %qs at %L may not have pointer or allocatable attribute"
  msgstr ""
  
! #: fortran/resolve.c:11414
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L cannot be array-valued"
  msgstr ""
  
! #: fortran/resolve.c:11418
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L cannot be pointer-valued"
  msgstr ""
  
! #: fortran/resolve.c:11422
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L cannot be pure"
  msgstr ""
  
! #: fortran/resolve.c:11426
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L cannot be recursive"
  msgstr ""
  
! #: fortran/resolve.c:11439
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11448
  #, gcc-internal-format
  msgid "Procedure pointer %qs at %L shall not be elemental"
  msgstr ""
  
! #: fortran/resolve.c:11454
  #, gcc-internal-format
  msgid "Dummy procedure %qs at %L shall not be elemental"
  msgstr ""
  
! #: fortran/resolve.c:11510
  #, gcc-internal-format
  msgid "PROCEDURE attribute conflicts with SAVE attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11516
  #, gcc-internal-format
  msgid "PROCEDURE attribute conflicts with INTENT attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11522
  #, gcc-internal-format
  msgid "PROCEDURE attribute conflicts with RESULT attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11530
  #, gcc-internal-format
  msgid "EXTERNAL attribute conflicts with FUNCTION attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11536
  #, gcc-internal-format
  msgid "Procedure pointer result %qs at %L is missing the pointer attribute"
  msgstr ""
  
! #: fortran/resolve.c:11613
  #, gcc-internal-format
  msgid "FINAL procedure %qs at %L is not a SUBROUTINE"
  msgstr ""
  
! #: fortran/resolve.c:11622
  #, gcc-internal-format, gfc-internal-format
  msgid "FINAL procedure at %L must have exactly one argument"
  msgstr ""
  
! #: fortran/resolve.c:11631
  #, gcc-internal-format
  msgid "Argument of FINAL procedure at %L must be of type %qs"
  msgstr ""
  
! #: fortran/resolve.c:11639
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of FINAL procedure at %L must not be a POINTER"
  msgstr ""
  
! #: fortran/resolve.c:11645
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of FINAL procedure at %L must not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:11651
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of FINAL procedure at %L must not be OPTIONAL"
  msgstr ""
  
! #: fortran/resolve.c:11659
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of FINAL procedure at %L must not be INTENT(OUT)"
  msgstr ""
  
! #: fortran/resolve.c:11668
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-scalar FINAL procedure at %L should have assumed shape argument"
  msgstr ""
  
! #: fortran/resolve.c:11690
  #, gcc-internal-format
  msgid "FINAL procedure %qs declared at %L has the same rank (%d) as %qs"
  msgstr ""
  
! #: fortran/resolve.c:11727
  #, gcc-internal-format
  msgid ""
  "Only array FINAL procedures declared for derived type %qs defined at %L, "
  "suggest also scalar one"
  msgstr ""
  
! #: fortran/resolve.c:11767
  #, gcc-internal-format
  msgid "%qs and %qs can't be mixed FUNCTION/SUBROUTINE for GENERIC %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11803
  #, gcc-internal-format
  msgid "%qs and %qs for GENERIC %qs at %L are ambiguous"
  msgstr ""
  
! #: fortran/resolve.c:11862
  #, gcc-internal-format
  msgid "Undefined specific binding %qs as target of GENERIC %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11874
  #, gcc-internal-format
  msgid "GENERIC %qs at %L must target a specific binding, %qs is GENERIC, too"
  msgstr ""
  
! #: fortran/resolve.c:11902
  #, gcc-internal-format
  msgid "GENERIC %qs at %L can't overwrite specific binding with the same name"
  msgstr ""
  
! #: fortran/resolve.c:11958
  #, gcc-internal-format, gfc-internal-format
  msgid "Type-bound operator at %L can't be NOPASS"
  msgstr ""
  
! #: fortran/resolve.c:12140
  #, gcc-internal-format
  msgid ""
  "%qs must be a module procedure or an external procedure with an explicit "
  "interface at %L"
  msgstr ""
  
! #: fortran/resolve.c:12182
  #, gcc-internal-format
  msgid "Procedure %qs with PASS(%s) at %L has no argument %qs"
  msgstr ""
  
! #: fortran/resolve.c:12196
  #, gcc-internal-format
  msgid "Procedure %qs with PASS at %L must have at least one argument"
  msgstr ""
  
! #: fortran/resolve.c:12210 fortran/resolve.c:12705
  #, gcc-internal-format
  msgid "Non-polymorphic passed-object dummy argument of %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:12218
  #, gcc-internal-format
  msgid "Argument %qs of %qs with PASS(%s) at %L must be of the derived-type %qs"
  msgstr ""
  
! #: fortran/resolve.c:12227
  #, gcc-internal-format
  msgid "Passed-object dummy argument of %qs at %L must be scalar"
  msgstr ""
  
! #: fortran/resolve.c:12233
  #, gcc-internal-format
  msgid "Passed-object dummy argument of %qs at %L must not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:12239
  #, gcc-internal-format
  msgid "Passed-object dummy argument of %qs at %L must not be POINTER"
  msgstr ""
  
! #: fortran/resolve.c:12268
  #, gcc-internal-format
  msgid "Procedure %qs at %L has the same name as a component of %qs"
  msgstr ""
  
! #: fortran/resolve.c:12277
  #, gcc-internal-format
  msgid "Procedure %qs at %L has the same name as an inherited component of %qs"
  msgstr ""
  
! #: fortran/resolve.c:12369
  #, gcc-internal-format
  msgid ""
  "Derived-type %qs declared at %L must be ABSTRACT because %qs is DEFERRED and "
  "not overridden"
  msgstr ""
  
! #: fortran/resolve.c:12467
  #, gcc-internal-format
  msgid ""
  "As extending type %qs at %L has a coarray component, parent type %qs shall "
  "also have one"
  msgstr ""
  
! #: fortran/resolve.c:12480
  #, gcc-internal-format
  msgid "Non-extensible derived-type %qs at %L must not be ABSTRACT"
  msgstr ""
  
! #: fortran/resolve.c:12500
  #, gcc-internal-format
  msgid "Coarray component %qs at %L must be allocatable with deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:12510
  #, gcc-internal-format
  msgid ""
  "Component %qs at %L of TYPE(C_PTR) or TYPE(C_FUNPTR) shall not be a coarray"
  msgstr ""
  
! #: fortran/resolve.c:12521
  #, gcc-internal-format
  msgid ""
  "Component %qs at %L with coarray component shall be a nonpointer, "
  "nonallocatable scalar"
  msgstr ""
  
! #: fortran/resolve.c:12531
  #, gcc-internal-format
  msgid ""
  "Component %qs at %L has the CONTIGUOUS attribute but is not an array pointer"
  msgstr ""
  
! #: fortran/resolve.c:12632
  #, gcc-internal-format
  msgid "Procedure pointer component %qs with PASS(%s) at %L has no argument %qs"
  msgstr ""
  
! #: fortran/resolve.c:12647
  #, gcc-internal-format
  msgid ""
  "Procedure pointer component %qs with PASS at %L must have at least one "
  "argument"
  msgstr ""
  
! #: fortran/resolve.c:12664
  #, gcc-internal-format
  msgid "Argument %qs of %qs with PASS(%s) at %L must be of the derived type %qs"
  msgstr ""
  
! #: fortran/resolve.c:12675
  #, gcc-internal-format
  msgid "Argument %qs of %qs with PASS(%s) at %L must be scalar"
  msgstr ""
  
! #: fortran/resolve.c:12685
  #, gcc-internal-format
  msgid ""
  "Argument %qs of %qs with PASS(%s) at %L may not have the POINTER attribute"
  msgstr ""
  
! #: fortran/resolve.c:12695
  #, gcc-internal-format
  msgid "Argument %qs of %qs with PASS(%s) at %L may not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:12737
  #, gcc-internal-format
  msgid ""
  "Component %qs of %qs at %L has the same name as an inherited type-bound "
  "procedure"
  msgstr ""
  
! #: fortran/resolve.c:12750
  #, gcc-internal-format
  msgid ""
  "Character length of component %qs needs to be a constant specification "
  "expression at %L"
  msgstr ""
  
! #: fortran/resolve.c:12761
  #, gcc-internal-format
  msgid ""
  "Character component %qs of %qs at %L with deferred length must be a POINTER "
  "or ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:12792
  #, gcc-internal-format
  msgid ""
  "the component %qs is a PRIVATE type and cannot be a component of %qs, which "
  "is PUBLIC at %L"
  msgstr ""
  
! #: fortran/resolve.c:12800
  #, gcc-internal-format, gfc-internal-format
  msgid "Polymorphic component %s at %L in SEQUENCE or BIND(C) type %s"
  msgstr ""
  
! #: fortran/resolve.c:12809
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Component %s of SEQUENCE type declared at %L does not have the SEQUENCE "
  "attribute"
  msgstr ""
  
! #: fortran/resolve.c:12827 fortran/resolve.c:12839
  #, gcc-internal-format
  msgid ""
  "The pointer component %qs of %qs at %L is a type that has not been declared"
  msgstr ""
  
! #: fortran/resolve.c:12851
  #, gcc-internal-format
  msgid "Component %qs with CLASS at %L must be allocatable or pointer"
  msgstr ""
  
! #: fortran/resolve.c:12919
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Generic name '%s' of function '%s' at %L being the same name as derived type "
  "at %L"
  msgstr ""
  
! #: fortran/resolve.c:12975
  #, gcc-internal-format
  msgid "Assumed size array %qs in namelist %qs at %L is not allowed"
  msgstr ""
  
! #: fortran/resolve.c:12981
  #, gcc-internal-format
  msgid "NAMELIST array object %qs with assumed shape in namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:12987
  #, gcc-internal-format
  msgid "NAMELIST array object %qs with nonconstant shape in namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:12995
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs with nonconstant character length in namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13005
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs in namelist %qs at %L is polymorphic and requires a "
  "defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:13015
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs in namelist %qs at %L with ALLOCATABLE or POINTER "
--- 53558,54077 ----
  #. Print an error if the procedure is defined multiple times; we have to
  #. exclude references to the same procedure via module association or
  #. multiple checks for the same procedure.
! #: fortran/resolve.c:10708
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Procedure %s with binding label %s at %L uses the same global identifier as "
  "entity at %L"
  msgstr ""
  
! #: fortran/resolve.c:10785
  #, gcc-internal-format, gfc-internal-format
  msgid "String length at %L is too large"
  msgstr ""
  
! #: fortran/resolve.c:11121
  #, gcc-internal-format
  msgid "Allocatable array %qs at %L must have a deferred shape or assumed rank"
  msgstr ""
  
! #: fortran/resolve.c:11125
  #, gcc-internal-format
  msgid "Scalar object %qs at %L may not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:11133
  #, gcc-internal-format
  msgid "Array pointer %qs at %L must have a deferred shape or assumed rank"
  msgstr ""
  
! #: fortran/resolve.c:11143
  #, gcc-internal-format
  msgid "Array %qs at %L cannot have a deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:11158
  #, gcc-internal-format
  msgid "Type %qs of CLASS variable %qs at %L is not extensible"
  msgstr ""
  
! #: fortran/resolve.c:11170
  #, gcc-internal-format
  msgid "CLASS variable %qs at %L must be dummy, allocatable or pointer"
  msgstr ""
  
! #: fortran/resolve.c:11201
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "The type '%s' cannot be host associated at %L because it is blocked by an "
  "incompatible object of the same name declared at %L"
  msgstr ""
  
! #: fortran/resolve.c:11223
  #, gcc-internal-format
  msgid ""
  "Implied SAVE for module variable %qs at %L, needed due to the default "
  "initialization"
  msgstr ""
  
+ #: fortran/resolve.c:11251
+ #, gcc-internal-format
+ msgid ""
+ "Entity %qs at %L has a deferred type parameter and requires either the "
+ "POINTER or ALLOCATABLE attribute"
+ msgstr ""
+ 
  #. The shape of a main program or module array needs to be
  #. constant.
! #: fortran/resolve.c:11292
  #, gcc-internal-format, gfc-internal-format
  msgid "The module or main program array '%s' at %L must have constant shape"
  msgstr ""
  
! #: fortran/resolve.c:11311
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Entity with assumed character length at %L must be a dummy argument or a "
  "PARAMETER"
  msgstr ""
  
! #: fortran/resolve.c:11332
  #, gcc-internal-format, gfc-internal-format
  msgid "'%s' at %L must have constant character length in this context"
  msgstr ""
  
! #: fortran/resolve.c:11339
  #, gcc-internal-format
  msgid "COMMON variable %qs at %L must have constant character length"
  msgstr ""
  
! #: fortran/resolve.c:11386
  #, gcc-internal-format
  msgid "Allocatable %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11389
  #, gcc-internal-format
  msgid "External %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11393
  #, gcc-internal-format
  msgid "Dummy %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11396
  #, gcc-internal-format
  msgid "Intrinsic %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11399
  #, gcc-internal-format
  msgid "Function result %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11402
  #, gcc-internal-format
  msgid "Automatic array %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11445
  #, gcc-internal-format
  msgid "Character-valued statement function %qs at %L must have constant length"
  msgstr ""
  
! #: fortran/resolve.c:11467
  #, gcc-internal-format
  msgid ""
  "%qs is of a PRIVATE type and cannot be a dummy argument of %qs, which is "
  "PUBLIC at %L"
  msgstr ""
  
! #: fortran/resolve.c:11489
  #, gcc-internal-format
  msgid ""
  "Procedure %qs in PUBLIC interface %qs at %L takes dummy arguments of %qs "
  "which is PRIVATE"
  msgstr ""
  
! #: fortran/resolve.c:11507
  #, gcc-internal-format
  msgid "Function %qs at %L cannot have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11516
  #, gcc-internal-format
  msgid "External object %qs at %L may not have an initializer"
  msgstr ""
  
! #: fortran/resolve.c:11524
  #, gcc-internal-format
  msgid "ELEMENTAL function %qs at %L must have a scalar result"
  msgstr ""
  
! #: fortran/resolve.c:11534
  #, gcc-internal-format
  msgid ""
  "Statement function %qs at %L may not have pointer or allocatable attribute"
  msgstr ""
  
! #: fortran/resolve.c:11553
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L cannot be array-valued"
  msgstr ""
  
! #: fortran/resolve.c:11557
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L cannot be pointer-valued"
  msgstr ""
  
! #: fortran/resolve.c:11561
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L cannot be pure"
  msgstr ""
  
! #: fortran/resolve.c:11565
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L cannot be recursive"
  msgstr ""
  
! #: fortran/resolve.c:11578
  #, gcc-internal-format
  msgid "CHARACTER(*) function %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11587
  #, gcc-internal-format
  msgid "Procedure pointer %qs at %L shall not be elemental"
  msgstr ""
  
! #: fortran/resolve.c:11593
  #, gcc-internal-format
  msgid "Dummy procedure %qs at %L shall not be elemental"
  msgstr ""
  
! #: fortran/resolve.c:11649
  #, gcc-internal-format
  msgid "PROCEDURE attribute conflicts with SAVE attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11655
  #, gcc-internal-format
  msgid "PROCEDURE attribute conflicts with INTENT attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11661
  #, gcc-internal-format
  msgid "PROCEDURE attribute conflicts with RESULT attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11669
  #, gcc-internal-format
  msgid "EXTERNAL attribute conflicts with FUNCTION attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11675
  #, gcc-internal-format
  msgid "Procedure pointer result %qs at %L is missing the pointer attribute"
  msgstr ""
  
! #: fortran/resolve.c:11752
  #, gcc-internal-format
  msgid "FINAL procedure %qs at %L is not a SUBROUTINE"
  msgstr ""
  
! #: fortran/resolve.c:11761
  #, gcc-internal-format, gfc-internal-format
  msgid "FINAL procedure at %L must have exactly one argument"
  msgstr ""
  
! #: fortran/resolve.c:11770
  #, gcc-internal-format
  msgid "Argument of FINAL procedure at %L must be of type %qs"
  msgstr ""
  
! #: fortran/resolve.c:11778
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of FINAL procedure at %L must not be a POINTER"
  msgstr ""
  
! #: fortran/resolve.c:11784
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of FINAL procedure at %L must not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:11790
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of FINAL procedure at %L must not be OPTIONAL"
  msgstr ""
  
! #: fortran/resolve.c:11798
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of FINAL procedure at %L must not be INTENT(OUT)"
  msgstr ""
  
! #: fortran/resolve.c:11807
  #, gcc-internal-format, gfc-internal-format
  msgid "Non-scalar FINAL procedure at %L should have assumed shape argument"
  msgstr ""
  
! #: fortran/resolve.c:11829
  #, gcc-internal-format
  msgid "FINAL procedure %qs declared at %L has the same rank (%d) as %qs"
  msgstr ""
  
! #: fortran/resolve.c:11866
  #, gcc-internal-format
  msgid ""
  "Only array FINAL procedures declared for derived type %qs defined at %L, "
  "suggest also scalar one"
  msgstr ""
  
! #: fortran/resolve.c:11906
  #, gcc-internal-format
  msgid "%qs and %qs can't be mixed FUNCTION/SUBROUTINE for GENERIC %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:11942
  #, gcc-internal-format
  msgid "%qs and %qs for GENERIC %qs at %L are ambiguous"
  msgstr ""
  
! #: fortran/resolve.c:12001
  #, gcc-internal-format
  msgid "Undefined specific binding %qs as target of GENERIC %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:12013
  #, gcc-internal-format
  msgid "GENERIC %qs at %L must target a specific binding, %qs is GENERIC, too"
  msgstr ""
  
! #: fortran/resolve.c:12041
  #, gcc-internal-format
  msgid "GENERIC %qs at %L can't overwrite specific binding with the same name"
  msgstr ""
  
! #: fortran/resolve.c:12097
  #, gcc-internal-format, gfc-internal-format
  msgid "Type-bound operator at %L can't be NOPASS"
  msgstr ""
  
! #: fortran/resolve.c:12279
  #, gcc-internal-format
  msgid ""
  "%qs must be a module procedure or an external procedure with an explicit "
  "interface at %L"
  msgstr ""
  
! #: fortran/resolve.c:12321
  #, gcc-internal-format
  msgid "Procedure %qs with PASS(%s) at %L has no argument %qs"
  msgstr ""
  
! #: fortran/resolve.c:12335
  #, gcc-internal-format
  msgid "Procedure %qs with PASS at %L must have at least one argument"
  msgstr ""
  
! #: fortran/resolve.c:12349 fortran/resolve.c:12844
  #, gcc-internal-format
  msgid "Non-polymorphic passed-object dummy argument of %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:12357
  #, gcc-internal-format
  msgid "Argument %qs of %qs with PASS(%s) at %L must be of the derived-type %qs"
  msgstr ""
  
! #: fortran/resolve.c:12366
  #, gcc-internal-format
  msgid "Passed-object dummy argument of %qs at %L must be scalar"
  msgstr ""
  
! #: fortran/resolve.c:12372
  #, gcc-internal-format
  msgid "Passed-object dummy argument of %qs at %L must not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:12378
  #, gcc-internal-format
  msgid "Passed-object dummy argument of %qs at %L must not be POINTER"
  msgstr ""
  
! #: fortran/resolve.c:12407
  #, gcc-internal-format
  msgid "Procedure %qs at %L has the same name as a component of %qs"
  msgstr ""
  
! #: fortran/resolve.c:12416
  #, gcc-internal-format
  msgid "Procedure %qs at %L has the same name as an inherited component of %qs"
  msgstr ""
  
! #: fortran/resolve.c:12508
  #, gcc-internal-format
  msgid ""
  "Derived-type %qs declared at %L must be ABSTRACT because %qs is DEFERRED and "
  "not overridden"
  msgstr ""
  
! #: fortran/resolve.c:12606
  #, gcc-internal-format
  msgid ""
  "As extending type %qs at %L has a coarray component, parent type %qs shall "
  "also have one"
  msgstr ""
  
! #: fortran/resolve.c:12619
  #, gcc-internal-format
  msgid "Non-extensible derived-type %qs at %L must not be ABSTRACT"
  msgstr ""
  
! #: fortran/resolve.c:12639
  #, gcc-internal-format
  msgid "Coarray component %qs at %L must be allocatable with deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:12649
  #, gcc-internal-format
  msgid ""
  "Component %qs at %L of TYPE(C_PTR) or TYPE(C_FUNPTR) shall not be a coarray"
  msgstr ""
  
! #: fortran/resolve.c:12660
  #, gcc-internal-format
  msgid ""
  "Component %qs at %L with coarray component shall be a nonpointer, "
  "nonallocatable scalar"
  msgstr ""
  
! #: fortran/resolve.c:12670
  #, gcc-internal-format
  msgid ""
  "Component %qs at %L has the CONTIGUOUS attribute but is not an array pointer"
  msgstr ""
  
! #: fortran/resolve.c:12771
  #, gcc-internal-format
  msgid "Procedure pointer component %qs with PASS(%s) at %L has no argument %qs"
  msgstr ""
  
! #: fortran/resolve.c:12786
  #, gcc-internal-format
  msgid ""
  "Procedure pointer component %qs with PASS at %L must have at least one "
  "argument"
  msgstr ""
  
! #: fortran/resolve.c:12803
  #, gcc-internal-format
  msgid "Argument %qs of %qs with PASS(%s) at %L must be of the derived type %qs"
  msgstr ""
  
! #: fortran/resolve.c:12814
  #, gcc-internal-format
  msgid "Argument %qs of %qs with PASS(%s) at %L must be scalar"
  msgstr ""
  
! #: fortran/resolve.c:12824
  #, gcc-internal-format
  msgid ""
  "Argument %qs of %qs with PASS(%s) at %L may not have the POINTER attribute"
  msgstr ""
  
! #: fortran/resolve.c:12834
  #, gcc-internal-format
  msgid "Argument %qs of %qs with PASS(%s) at %L may not be ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:12876
  #, gcc-internal-format
  msgid ""
  "Component %qs of %qs at %L has the same name as an inherited type-bound "
  "procedure"
  msgstr ""
  
! #: fortran/resolve.c:12889
  #, gcc-internal-format
  msgid ""
  "Character length of component %qs needs to be a constant specification "
  "expression at %L"
  msgstr ""
  
! #: fortran/resolve.c:12900
  #, gcc-internal-format
  msgid ""
  "Character component %qs of %qs at %L with deferred length must be a POINTER "
  "or ALLOCATABLE"
  msgstr ""
  
! #: fortran/resolve.c:12931
  #, gcc-internal-format
  msgid ""
  "the component %qs is a PRIVATE type and cannot be a component of %qs, which "
  "is PUBLIC at %L"
  msgstr ""
  
! #: fortran/resolve.c:12939
  #, gcc-internal-format, gfc-internal-format
  msgid "Polymorphic component %s at %L in SEQUENCE or BIND(C) type %s"
  msgstr ""
  
! #: fortran/resolve.c:12948
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Component %s of SEQUENCE type declared at %L does not have the SEQUENCE "
  "attribute"
  msgstr ""
  
! #: fortran/resolve.c:12966 fortran/resolve.c:12978
  #, gcc-internal-format
  msgid ""
  "The pointer component %qs of %qs at %L is a type that has not been declared"
  msgstr ""
  
! #: fortran/resolve.c:12990
  #, gcc-internal-format
  msgid "Component %qs with CLASS at %L must be allocatable or pointer"
  msgstr ""
  
! #: fortran/resolve.c:13058
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Generic name '%s' of function '%s' at %L being the same name as derived type "
  "at %L"
  msgstr ""
  
! #: fortran/resolve.c:13114
  #, gcc-internal-format
  msgid "Assumed size array %qs in namelist %qs at %L is not allowed"
  msgstr ""
  
! #: fortran/resolve.c:13120
  #, gcc-internal-format
  msgid "NAMELIST array object %qs with assumed shape in namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13126
  #, gcc-internal-format
  msgid "NAMELIST array object %qs with nonconstant shape in namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13134
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs with nonconstant character length in namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13144
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs in namelist %qs at %L is polymorphic and requires a "
  "defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:13154
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs in namelist %qs at %L with ALLOCATABLE or POINTER "
*************** msgstr ""
*** 53657,54115 ****
  
  #. FIXME: Once UDDTIO is implemented, the following can be
  #. removed.
! #: fortran/resolve.c:13023
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs in namelist %qs at %L has ALLOCATABLE or POINTER "
  "components and thus requires a defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:13040
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs was declared PRIVATE and cannot be member of PUBLIC "
  "namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13050
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs has use-associated PRIVATE components and cannot be "
  "member of namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13061
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs has PRIVATE components and cannot be a member of PUBLIC "
  "namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13088
  #, gcc-internal-format
  msgid "PROCEDURE attribute conflicts with NAMELIST attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13107
  #, gcc-internal-format
  msgid "Parameter array %qs at %L cannot be automatic or of deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:13119
  #, gcc-internal-format
  msgid ""
  "Implicitly typed PARAMETER %qs at %L doesn't match a later IMPLICIT type"
  msgstr ""
  
! #: fortran/resolve.c:13130
  #, gcc-internal-format, gfc-internal-format
  msgid "Incompatible derived type in PARAMETER at %L"
  msgstr ""
  
! #: fortran/resolve.c:13217
  #, gcc-internal-format, gfc-internal-format
  msgid "PROTECTED attribute conflicts with EXTERNAL attribute at %L"
  msgstr ""
  
! #: fortran/resolve.c:13220
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE attribute conflicts with PROTECTED attribute at %L"
  msgstr ""
  
! #: fortran/resolve.c:13309
  #, gcc-internal-format
  msgid ""
  "%qs at %L has the CONTIGUOUS attribute but is not an array pointer or an "
  "assumed-shape or assumed-rank array"
  msgstr ""
  
! #: fortran/resolve.c:13327
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed size array at %L must be a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13330
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed shape array at %L must be a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13338
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank array at %L must be a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13345
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-rank array at %L may not have the VALUE or CODIMENSION attribute"
  msgstr ""
  
! #: fortran/resolve.c:13358
  #, gcc-internal-format, gfc-internal-format
  msgid "Symbol at %L is not a DUMMY variable"
  msgstr ""
  
! #: fortran/resolve.c:13364
  #, gcc-internal-format
  msgid ""
  "%qs at %L cannot have the VALUE attribute because it is not a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13374
  #, gcc-internal-format
  msgid ""
  "Character dummy variable %qs at %L with VALUE attribute must have constant "
  "length"
  msgstr ""
  
! #: fortran/resolve.c:13383
  #, gcc-internal-format
  msgid ""
  "C interoperable character dummy variable %qs at %L with VALUE attribute must "
  "have length one"
  msgstr ""
  
! #: fortran/resolve.c:13396 fortran/resolve.c:13563
  #, gcc-internal-format
  msgid "The derived type %qs at %L is of type %qs, which has not been defined"
  msgstr ""
  
! #: fortran/resolve.c:13410
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable %s at %L with NO_ARG_CHECK attribute shall be a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13419
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute shall be of type TYPE(*) or of "
  "an numeric intrinsic type"
  msgstr ""
  
! #: fortran/resolve.c:13428
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute may not have the ALLOCATABLE, "
  "CODIMENSION, POINTER or VALUE attribute"
  msgstr ""
  
! #: fortran/resolve.c:13436
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute may not have the INTENT(OUT) "
  "attribute"
  msgstr ""
  
! #: fortran/resolve.c:13443
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute shall either be a scalar or an "
  "assumed-size array"
  msgstr ""
  
! #: fortran/resolve.c:13463
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed type of variable %s at %L is only permitted for dummy variables"
  msgstr ""
  
! #: fortran/resolve.c:13470
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-type variable %s at %L may not have the ALLOCATABLE, CODIMENSION, "
  "POINTER or VALUE attribute"
  msgstr ""
  
! #: fortran/resolve.c:13477
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type variable %s at %L may not have the INTENT(OUT) attribute"
  msgstr ""
  
! #: fortran/resolve.c:13484
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type variable %s at %L shall not be an explicit-shape array"
  msgstr ""
  
! #: fortran/resolve.c:13509
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L cannot be BIND(C) because it is neither a COMMON block "
  "nor declared at the module level scope"
  msgstr ""
  
! #: fortran/resolve.c:13589
  #, gcc-internal-format
  msgid "PUBLIC %s %qs at %L of PRIVATE derived type %qs"
  msgstr ""
  
! #: fortran/resolve.c:13604
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L of type LOCK_TYPE or with subcomponent of type LOCK_TYPE "
  "must be a coarray"
  msgstr ""
  
! #: fortran/resolve.c:13622
  #, gcc-internal-format
  msgid ""
  "The INTENT(OUT) dummy argument %qs at %L is ASSUMED SIZE and so cannot have "
  "a default initializer"
  msgstr ""
  
! #: fortran/resolve.c:13634
  #, gcc-internal-format
  msgid "Dummy argument %qs at %L of LOCK_TYPE shall not be INTENT(OUT)"
  msgstr ""
  
! #: fortran/resolve.c:13646
  #, gcc-internal-format
  msgid ""
  "Function result %qs at %L shall not be a coarray or have a coarray component"
  msgstr ""
  
! #: fortran/resolve.c:13655
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L of TYPE(C_PTR) or TYPE(C_FUNPTR) shall not be a coarray"
  msgstr ""
  
! #: fortran/resolve.c:13667
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L with coarray component shall be a nonpointer, "
  "nonallocatable scalar, which is not a coarray"
  msgstr ""
  
! #: fortran/resolve.c:13682
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is a coarray and is not ALLOCATABLE, SAVE nor a dummy "
  "argument"
  msgstr ""
  
! #: fortran/resolve.c:13690
  #, gcc-internal-format
  msgid ""
  "Coarray variable %qs at %L shall not have codimensions with deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:13697
  #, gcc-internal-format
  msgid "Allocatable coarray variable %qs at %L must have deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:13709
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is INTENT(OUT) and can thus not be an allocatable coarray "
  "or have coarray components"
  msgstr ""
  
! #: fortran/resolve.c:13718
  #, gcc-internal-format
  msgid "Coarray dummy variable %qs at %L not allowed in BIND(C) procedure %qs"
  msgstr ""
  
! #: fortran/resolve.c:13734
  #, gcc-internal-format
  msgid ""
  "LOGICAL dummy argument %qs at %L with non-C_Bool kind in BIND(C) procedure "
  "%qs"
  msgstr ""
  
! #: fortran/resolve.c:13740
  #, gcc-internal-format
  msgid ""
  "LOGICAL result variable %qs at %L with non-C_Bool kind in BIND(C) procedure "
  "%qs"
  msgstr ""
  
! #: fortran/resolve.c:13819
  #, gcc-internal-format, gfc-internal-format
  msgid "Threadprivate at %L isn't SAVEd"
  msgstr ""
  
! #: fortran/resolve.c:13830
  #, gcc-internal-format
  msgid "!$OMP DECLARE TARGET variable %qs at %L isn't SAVEd"
  msgstr ""
  
! #: fortran/resolve.c:13917
  #, gcc-internal-format
  msgid "check_data_variable(): Bad expression"
  msgstr ""
  
! #: fortran/resolve.c:13923
  #, gcc-internal-format
  msgid "BLOCK DATA element %qs at %L must be in COMMON"
  msgstr ""
  
! #: fortran/resolve.c:13929
  #, gcc-internal-format
  msgid "DATA array %qs at %L must be specified in a previous declaration"
  msgstr ""
  
! #: fortran/resolve.c:13938
  #, gcc-internal-format
  msgid "DATA element %qs at %L cannot have a coindex"
  msgstr ""
  
! #: fortran/resolve.c:13952
  #, gcc-internal-format
  msgid "DATA element %qs at %L is a pointer and so must be a full array"
  msgstr ""
  
! #: fortran/resolve.c:13998
  #, gcc-internal-format, gfc-internal-format
  msgid "Nonconstant array section at %L in DATA statement"
  msgstr ""
  
! #: fortran/resolve.c:14011
  #, gcc-internal-format, gfc-internal-format
  msgid "DATA statement at %L has more variables than values"
  msgstr ""
  
! #: fortran/resolve.c:14110
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "start of implied-do loop at %L could not be simplified to a constant value"
  msgstr ""
  
! #: fortran/resolve.c:14118
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "end of implied-do loop at %L could not be simplified to a constant value"
  msgstr ""
  
! #: fortran/resolve.c:14126
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "step of implied-do loop at %L could not be simplified to a constant value"
  msgstr ""
  
! #: fortran/resolve.c:14251
  #, gcc-internal-format, gfc-internal-format
  msgid "DATA statement at %L has more values than variables"
  msgstr ""
  
! #: fortran/resolve.c:14416
  #, gcc-internal-format, gfc-internal-format
  msgid "Label %d at %L defined but not used"
  msgstr ""
  
! #: fortran/resolve.c:14421
  #, gcc-internal-format, gfc-internal-format
  msgid "Label %d at %L defined but cannot be used"
  msgstr ""
  
! #: fortran/resolve.c:14505
  #, gcc-internal-format
  msgid ""
  "Derived type variable %qs at %L must have SEQUENCE attribute to be an "
  "EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14514
  #, gcc-internal-format
  msgid ""
  "Derived type variable %qs at %L cannot have ALLOCATABLE components to be an "
  "EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14522
  #, gcc-internal-format
  msgid ""
  "Derived type variable %qs at %L with default initialization cannot be in "
  "EQUIVALENCE with a variable in COMMON"
  msgstr ""
  
! #: fortran/resolve.c:14538
  #, gcc-internal-format
  msgid ""
  "Derived type variable %qs at %L with pointer component(s) cannot be an "
  "EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14641
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in EQUIVALENCE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:14656
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Either all or none of the objects in the EQUIVALENCE set at %L shall have "
  "the PROTECTED attribute"
  msgstr ""
  
! #: fortran/resolve.c:14668
  #, gcc-internal-format
  msgid ""
  "Common block member %qs at %L cannot be an EQUIVALENCE object in the pure "
  "procedure %qs"
  msgstr ""
  
! #: fortran/resolve.c:14677
  #, gcc-internal-format
  msgid "Named constant %qs at %L cannot be an EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14750
  #, gcc-internal-format
  msgid ""
  "Array %qs at %L with non-constant bounds cannot be an EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14761
  #, gcc-internal-format
  msgid "Structure component %qs at %L cannot be an EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14772
  #, gcc-internal-format, gfc-internal-format
  msgid "Substring at %L has length zero"
  msgstr ""
  
! #: fortran/resolve.c:14815
  #, gcc-internal-format
  msgid "PUBLIC function %qs at %L of PRIVATE type %qs"
  msgstr ""
  
! #: fortran/resolve.c:14828
  #, gcc-internal-format
  msgid "ENTRY %qs at %L has no IMPLICIT type"
  msgstr ""
  
! #: fortran/resolve.c:14845
  #, gcc-internal-format
  msgid "User operator procedure %qs at %L must be a FUNCTION"
  msgstr ""
  
! #: fortran/resolve.c:14855
  #, gcc-internal-format
  msgid "User operator procedure %qs at %L cannot be assumed character length"
  msgstr ""
  
! #: fortran/resolve.c:14863
  #, gcc-internal-format
  msgid "User operator procedure %qs at %L must have at least one argument"
  msgstr ""
  
! #: fortran/resolve.c:14877
  #, gcc-internal-format, gfc-internal-format
  msgid "First argument of operator interface at %L cannot be optional"
  msgstr ""
  
! #: fortran/resolve.c:14895
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of operator interface at %L cannot be optional"
  msgstr ""
  
! #: fortran/resolve.c:14902
  #, gcc-internal-format, gfc-internal-format
  msgid "Operator interface at %L must have, at most, two arguments"
  msgstr ""
  
! #: fortran/resolve.c:14980
  #, gcc-internal-format
  msgid "Contained procedure %qs at %L of a PURE procedure must also be PURE"
  msgstr ""
--- 54080,54550 ----
  
  #. FIXME: Once UDDTIO is implemented, the following can be
  #. removed.
! #: fortran/resolve.c:13162
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs in namelist %qs at %L has ALLOCATABLE or POINTER "
  "components and thus requires a defined input/output procedure"
  msgstr ""
  
! #: fortran/resolve.c:13179
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs was declared PRIVATE and cannot be member of PUBLIC "
  "namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13189
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs has use-associated PRIVATE components and cannot be "
  "member of namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13200
  #, gcc-internal-format
  msgid ""
  "NAMELIST object %qs has PRIVATE components and cannot be a member of PUBLIC "
  "namelist %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13227
  #, gcc-internal-format
  msgid "PROCEDURE attribute conflicts with NAMELIST attribute in %qs at %L"
  msgstr ""
  
! #: fortran/resolve.c:13246
  #, gcc-internal-format
  msgid "Parameter array %qs at %L cannot be automatic or of deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:13262
  #, gcc-internal-format
  msgid ""
  "Implicitly typed PARAMETER %qs at %L doesn't match a later IMPLICIT type"
  msgstr ""
  
! #: fortran/resolve.c:13273
  #, gcc-internal-format, gfc-internal-format
  msgid "Incompatible derived type in PARAMETER at %L"
  msgstr ""
  
! #: fortran/resolve.c:13360
  #, gcc-internal-format, gfc-internal-format
  msgid "PROTECTED attribute conflicts with EXTERNAL attribute at %L"
  msgstr ""
  
! #: fortran/resolve.c:13363
  #, gcc-internal-format, gfc-internal-format
  msgid "PROCEDURE attribute conflicts with PROTECTED attribute at %L"
  msgstr ""
  
! #: fortran/resolve.c:13452
  #, gcc-internal-format
  msgid ""
  "%qs at %L has the CONTIGUOUS attribute but is not an array pointer or an "
  "assumed-shape or assumed-rank array"
  msgstr ""
  
! #: fortran/resolve.c:13470
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed size array at %L must be a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13473
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed shape array at %L must be a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13481
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-rank array at %L must be a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13488
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-rank array at %L may not have the VALUE or CODIMENSION attribute"
  msgstr ""
  
! #: fortran/resolve.c:13501
  #, gcc-internal-format, gfc-internal-format
  msgid "Symbol at %L is not a DUMMY variable"
  msgstr ""
  
! #: fortran/resolve.c:13507
  #, gcc-internal-format
  msgid ""
  "%qs at %L cannot have the VALUE attribute because it is not a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13517
  #, gcc-internal-format
  msgid ""
  "Character dummy variable %qs at %L with VALUE attribute must have constant "
  "length"
  msgstr ""
  
! #: fortran/resolve.c:13526
  #, gcc-internal-format
  msgid ""
  "C interoperable character dummy variable %qs at %L with VALUE attribute must "
  "have length one"
  msgstr ""
  
! #: fortran/resolve.c:13539 fortran/resolve.c:13706
  #, gcc-internal-format
  msgid "The derived type %qs at %L is of type %qs, which has not been defined"
  msgstr ""
  
! #: fortran/resolve.c:13553
  #, gcc-internal-format, gfc-internal-format
  msgid "Variable %s at %L with NO_ARG_CHECK attribute shall be a dummy argument"
  msgstr ""
  
! #: fortran/resolve.c:13562
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute shall be of type TYPE(*) or of "
  "an numeric intrinsic type"
  msgstr ""
  
! #: fortran/resolve.c:13571
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute may not have the ALLOCATABLE, "
  "CODIMENSION, POINTER or VALUE attribute"
  msgstr ""
  
! #: fortran/resolve.c:13579
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute may not have the INTENT(OUT) "
  "attribute"
  msgstr ""
  
! #: fortran/resolve.c:13586
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L with NO_ARG_CHECK attribute shall either be a scalar or an "
  "assumed-size array"
  msgstr ""
  
! #: fortran/resolve.c:13606
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed type of variable %s at %L is only permitted for dummy variables"
  msgstr ""
  
! #: fortran/resolve.c:13613
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Assumed-type variable %s at %L may not have the ALLOCATABLE, CODIMENSION, "
  "POINTER or VALUE attribute"
  msgstr ""
  
! #: fortran/resolve.c:13620
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type variable %s at %L may not have the INTENT(OUT) attribute"
  msgstr ""
  
! #: fortran/resolve.c:13627
  #, gcc-internal-format, gfc-internal-format
  msgid "Assumed-type variable %s at %L shall not be an explicit-shape array"
  msgstr ""
  
! #: fortran/resolve.c:13652
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L cannot be BIND(C) because it is neither a COMMON block "
  "nor declared at the module level scope"
  msgstr ""
  
! #: fortran/resolve.c:13732
  #, gcc-internal-format
  msgid "PUBLIC %s %qs at %L of PRIVATE derived type %qs"
  msgstr ""
  
! #: fortran/resolve.c:13747
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Variable %s at %L of type LOCK_TYPE or with subcomponent of type LOCK_TYPE "
  "must be a coarray"
  msgstr ""
  
! #: fortran/resolve.c:13760
! #, gcc-internal-format, gfc-internal-format
! msgid ""
! "Variable %s at %L of type EVENT_TYPE or with subcomponent of type LOCK_TYPE "
! "must be a coarray"
! msgstr ""
! 
! #: fortran/resolve.c:13778
  #, gcc-internal-format
  msgid ""
  "The INTENT(OUT) dummy argument %qs at %L is ASSUMED SIZE and so cannot have "
  "a default initializer"
  msgstr ""
  
! #: fortran/resolve.c:13790
  #, gcc-internal-format
  msgid "Dummy argument %qs at %L of LOCK_TYPE shall not be INTENT(OUT)"
  msgstr ""
  
! #: fortran/resolve.c:13799
! #, gcc-internal-format
! msgid "Dummy argument %qs at %L of EVENT_TYPE shall not be INTENT(OUT)"
! msgstr ""
! 
! #: fortran/resolve.c:13811
  #, gcc-internal-format
  msgid ""
  "Function result %qs at %L shall not be a coarray or have a coarray component"
  msgstr ""
  
! #: fortran/resolve.c:13820
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L of TYPE(C_PTR) or TYPE(C_FUNPTR) shall not be a coarray"
  msgstr ""
  
! #: fortran/resolve.c:13832
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L with coarray component shall be a nonpointer, "
  "nonallocatable scalar, which is not a coarray"
  msgstr ""
  
! #: fortran/resolve.c:13847
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is a coarray and is not ALLOCATABLE, SAVE nor a dummy "
  "argument"
  msgstr ""
  
! #: fortran/resolve.c:13855
  #, gcc-internal-format
  msgid ""
  "Coarray variable %qs at %L shall not have codimensions with deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:13862
  #, gcc-internal-format
  msgid "Allocatable coarray variable %qs at %L must have deferred shape"
  msgstr ""
  
! #: fortran/resolve.c:13874
  #, gcc-internal-format
  msgid ""
  "Variable %qs at %L is INTENT(OUT) and can thus not be an allocatable coarray "
  "or have coarray components"
  msgstr ""
  
! #: fortran/resolve.c:13883
  #, gcc-internal-format
  msgid "Coarray dummy variable %qs at %L not allowed in BIND(C) procedure %qs"
  msgstr ""
  
! #: fortran/resolve.c:13899
  #, gcc-internal-format
  msgid ""
  "LOGICAL dummy argument %qs at %L with non-C_Bool kind in BIND(C) procedure "
  "%qs"
  msgstr ""
  
! #: fortran/resolve.c:13905
  #, gcc-internal-format
  msgid ""
  "LOGICAL result variable %qs at %L with non-C_Bool kind in BIND(C) procedure "
  "%qs"
  msgstr ""
  
! #: fortran/resolve.c:13984
  #, gcc-internal-format, gfc-internal-format
  msgid "Threadprivate at %L isn't SAVEd"
  msgstr ""
  
! #: fortran/resolve.c:13995
  #, gcc-internal-format
  msgid "!$OMP DECLARE TARGET variable %qs at %L isn't SAVEd"
  msgstr ""
  
! #: fortran/resolve.c:14082
  #, gcc-internal-format
  msgid "check_data_variable(): Bad expression"
  msgstr ""
  
! #: fortran/resolve.c:14088
  #, gcc-internal-format
  msgid "BLOCK DATA element %qs at %L must be in COMMON"
  msgstr ""
  
! #: fortran/resolve.c:14094
  #, gcc-internal-format
  msgid "DATA array %qs at %L must be specified in a previous declaration"
  msgstr ""
  
! #: fortran/resolve.c:14103
  #, gcc-internal-format
  msgid "DATA element %qs at %L cannot have a coindex"
  msgstr ""
  
! #: fortran/resolve.c:14117
  #, gcc-internal-format
  msgid "DATA element %qs at %L is a pointer and so must be a full array"
  msgstr ""
  
! #: fortran/resolve.c:14163
  #, gcc-internal-format, gfc-internal-format
  msgid "Nonconstant array section at %L in DATA statement"
  msgstr ""
  
! #: fortran/resolve.c:14176
  #, gcc-internal-format, gfc-internal-format
  msgid "DATA statement at %L has more variables than values"
  msgstr ""
  
! #: fortran/resolve.c:14275
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "start of implied-do loop at %L could not be simplified to a constant value"
  msgstr ""
  
! #: fortran/resolve.c:14283
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "end of implied-do loop at %L could not be simplified to a constant value"
  msgstr ""
  
! #: fortran/resolve.c:14291
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "step of implied-do loop at %L could not be simplified to a constant value"
  msgstr ""
  
! #: fortran/resolve.c:14416
  #, gcc-internal-format, gfc-internal-format
  msgid "DATA statement at %L has more values than variables"
  msgstr ""
  
! #: fortran/resolve.c:14581
  #, gcc-internal-format, gfc-internal-format
  msgid "Label %d at %L defined but not used"
  msgstr ""
  
! #: fortran/resolve.c:14586
  #, gcc-internal-format, gfc-internal-format
  msgid "Label %d at %L defined but cannot be used"
  msgstr ""
  
! #: fortran/resolve.c:14670
  #, gcc-internal-format
  msgid ""
  "Derived type variable %qs at %L must have SEQUENCE attribute to be an "
  "EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14679
  #, gcc-internal-format
  msgid ""
  "Derived type variable %qs at %L cannot have ALLOCATABLE components to be an "
  "EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14687
  #, gcc-internal-format
  msgid ""
  "Derived type variable %qs at %L with default initialization cannot be in "
  "EQUIVALENCE with a variable in COMMON"
  msgstr ""
  
! #: fortran/resolve.c:14703
  #, gcc-internal-format
  msgid ""
  "Derived type variable %qs at %L with pointer component(s) cannot be an "
  "EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14806
  #, gcc-internal-format, gfc-internal-format
  msgid "Syntax error in EQUIVALENCE statement at %L"
  msgstr ""
  
! #: fortran/resolve.c:14821
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Either all or none of the objects in the EQUIVALENCE set at %L shall have "
  "the PROTECTED attribute"
  msgstr ""
  
! #: fortran/resolve.c:14833
  #, gcc-internal-format
  msgid ""
  "Common block member %qs at %L cannot be an EQUIVALENCE object in the pure "
  "procedure %qs"
  msgstr ""
  
! #: fortran/resolve.c:14842
  #, gcc-internal-format
  msgid "Named constant %qs at %L cannot be an EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14915
  #, gcc-internal-format
  msgid ""
  "Array %qs at %L with non-constant bounds cannot be an EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14926
  #, gcc-internal-format
  msgid "Structure component %qs at %L cannot be an EQUIVALENCE object"
  msgstr ""
  
! #: fortran/resolve.c:14937
  #, gcc-internal-format, gfc-internal-format
  msgid "Substring at %L has length zero"
  msgstr ""
  
! #: fortran/resolve.c:14980
  #, gcc-internal-format
  msgid "PUBLIC function %qs at %L of PRIVATE type %qs"
  msgstr ""
  
! #: fortran/resolve.c:14993
  #, gcc-internal-format
  msgid "ENTRY %qs at %L has no IMPLICIT type"
  msgstr ""
  
! #: fortran/resolve.c:15010
  #, gcc-internal-format
  msgid "User operator procedure %qs at %L must be a FUNCTION"
  msgstr ""
  
! #: fortran/resolve.c:15020
  #, gcc-internal-format
  msgid "User operator procedure %qs at %L cannot be assumed character length"
  msgstr ""
  
! #: fortran/resolve.c:15028
  #, gcc-internal-format
  msgid "User operator procedure %qs at %L must have at least one argument"
  msgstr ""
  
! #: fortran/resolve.c:15042
  #, gcc-internal-format, gfc-internal-format
  msgid "First argument of operator interface at %L cannot be optional"
  msgstr ""
  
! #: fortran/resolve.c:15060
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of operator interface at %L cannot be optional"
  msgstr ""
  
! #: fortran/resolve.c:15067
  #, gcc-internal-format, gfc-internal-format
  msgid "Operator interface at %L must have, at most, two arguments"
  msgstr ""
  
! #: fortran/resolve.c:15145
  #, gcc-internal-format
  msgid "Contained procedure %qs at %L of a PURE procedure must also be PURE"
  msgstr ""
*************** msgstr ""
*** 54158,54189 ****
  msgid "Missing %<&%> in continued character constant at %C"
  msgstr ""
  
! #: fortran/scanner.c:1634
  #, gcc-internal-format, gfc-internal-format
  msgid "Nonconforming tab character at %C"
  msgstr ""
  
! #: fortran/scanner.c:1722 fortran/scanner.c:1725
  #, gcc-internal-format
  msgid "%<&%> not allowed by itself in line %d"
  msgstr ""
  
! #: fortran/scanner.c:1784
  #, gcc-internal-format, gfc-internal-format
  msgid "Nonconforming tab character in column %d of line %d"
  msgstr ""
  
! #: fortran/scanner.c:2009
  #, gcc-internal-format, gfc-internal-format
  msgid "%s:%d: file %s left but not entered"
  msgstr ""
  
! #: fortran/scanner.c:2043
  #, gcc-internal-format, gfc-internal-format
  msgid "%s:%d: Illegal preprocessor directive"
  msgstr ""
  
! #: fortran/scanner.c:2168
  #, gcc-internal-format
  msgid "Can't open file %qs"
  msgstr ""
--- 54593,54624 ----
  msgid "Missing %<&%> in continued character constant at %C"
  msgstr ""
  
! #: fortran/scanner.c:1635
  #, gcc-internal-format, gfc-internal-format
  msgid "Nonconforming tab character at %C"
  msgstr ""
  
! #: fortran/scanner.c:1723 fortran/scanner.c:1726
  #, gcc-internal-format
  msgid "%<&%> not allowed by itself in line %d"
  msgstr ""
  
! #: fortran/scanner.c:1785
  #, gcc-internal-format, gfc-internal-format
  msgid "Nonconforming tab character in column %d of line %d"
  msgstr ""
  
! #: fortran/scanner.c:2010
  #, gcc-internal-format, gfc-internal-format
  msgid "%s:%d: file %s left but not entered"
  msgstr ""
  
! #: fortran/scanner.c:2044
  #, gcc-internal-format, gfc-internal-format
  msgid "%s:%d: Illegal preprocessor directive"
  msgstr ""
  
! #: fortran/scanner.c:2169
  #, gcc-internal-format
  msgid "Can't open file %qs"
  msgstr ""
*************** msgstr ""
*** 54218,54423 ****
  msgid "Invalid KIND parameter of %s at %L"
  msgstr ""
  
! #: fortran/simplify.c:692
  #, gcc-internal-format
  msgid "gfc_simplify_abs(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:713
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of %s function at %L is negative"
  msgstr ""
  
! #: fortran/simplify.c:720
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of %s function at %L outside of range [0,127]"
  msgstr ""
  
! #: fortran/simplify.c:738
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument of %s function at %L is too large for the collating sequence of "
  "kind %d"
  msgstr ""
  
! #: fortran/simplify.c:775
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ACOS at %L must be between -1 and 1"
  msgstr ""
  
! #: fortran/simplify.c:789
  #, gcc-internal-format
  msgid "in gfc_simplify_acos(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:808
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ACOSH at %L must not be less than 1"
  msgstr ""
  
! #: fortran/simplify.c:823
  #, gcc-internal-format
  msgid "in gfc_simplify_acosh(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1052
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ASIN at %L must be between -1 and 1"
  msgstr ""
  
! #: fortran/simplify.c:1066
  #, gcc-internal-format
  msgid "in gfc_simplify_asin(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1094
  #, gcc-internal-format
  msgid "in gfc_simplify_asinh(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1122
  #, gcc-internal-format
  msgid "in gfc_simplify_atan(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1143
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ATANH at %L must be inside the range -1 to 1"
  msgstr ""
  
! #: fortran/simplify.c:1157
  #, gcc-internal-format
  msgid "in gfc_simplify_atanh(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1174
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "If first argument of ATAN2 %L is zero, then the second argument must not be "
  "zero"
  msgstr ""
  
! #: fortran/simplify.c:1266
  #, gcc-internal-format, gfc-internal-format
  msgid "Result of BESSEL_YN is -INF at %L"
  msgstr ""
  
! #: fortran/simplify.c:1635
  #, gcc-internal-format
  msgid "gfc_simplify_dcmplx(): Bad type (x)"
  msgstr ""
  
! #: fortran/simplify.c:1654
  #, gcc-internal-format
  msgid "gfc_simplify_dcmplx(): Bad type (y)"
  msgstr ""
  
! #: fortran/simplify.c:1731
  #, gcc-internal-format
  msgid "in gfc_simplify_cos(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1876
  #, gcc-internal-format
  msgid "gfc_simplify_dim(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:2184
  #, gcc-internal-format
  msgid "in gfc_simplify_exp(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:2350
  #, gcc-internal-format
  msgid "gfc_simplify_floor(): Bad kind"
  msgstr ""
  
! #: fortran/simplify.c:2502
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of IACHAR at %L must be of length one"
  msgstr ""
  
! #: fortran/simplify.c:2510
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of IACHAR function at %L outside of range 0..127"
  msgstr ""
  
! #: fortran/simplify.c:2625
  #, gcc-internal-format, gfc-internal-format
  msgid "Sum of second and third arguments of IBITS exceeds bit size at %L"
  msgstr ""
  
! #: fortran/simplify.c:2649
  #, gcc-internal-format
  msgid "IBITS: Bad bit"
  msgstr ""
  
! #: fortran/simplify.c:2700
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ICHAR at %L must be of length one"
  msgstr ""
  
  #. Left shift, as in SHIFTL.
! #: fortran/simplify.c:3065 fortran/simplify.c:3073
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of %s is negative at %L"
  msgstr ""
  
! #: fortran/simplify.c:3085
  #, gcc-internal-format, gfc-internal-format
  msgid "Magnitude of second argument of %s exceeds bit size at %L"
  msgstr ""
  
! #: fortran/simplify.c:3211
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Magnitude of second argument of ISHFTC exceeds BIT_SIZE of first argument at "
  "%L"
  msgstr ""
  
! #: fortran/simplify.c:3514 fortran/simplify.c:3649
  #, gcc-internal-format, gfc-internal-format
  msgid "DIM argument at %L is out of bounds"
  msgstr ""
  
! #: fortran/simplify.c:3828
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of LOG at %L cannot be less than or equal to zero"
  msgstr ""
  
! #: fortran/simplify.c:3841
  #, gcc-internal-format, gfc-internal-format
  msgid "Complex argument of LOG at %L cannot be zero"
  msgstr ""
  
! #: fortran/simplify.c:3852
  #, gcc-internal-format
  msgid "gfc_simplify_log: bad type"
  msgstr ""
  
! #: fortran/simplify.c:3869
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of LOG10 at %L cannot be less than or equal to zero"
  msgstr ""
  
! #: fortran/simplify.c:4172
  #, gcc-internal-format
  msgid "simplify_min_max(): Bad type in arglist"
  msgstr ""
  
  #. Result is processor-dependent.
! #: fortran/simplify.c:4348
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument MOD at %L is zero"
  msgstr ""
  
  #. Result is processor-dependent.
! #: fortran/simplify.c:4359
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of MOD at %L is zero"
  msgstr ""
  
! #: fortran/simplify.c:4370
  #, gcc-internal-format
  msgid "gfc_simplify_mod(): Bad arguments"
  msgstr ""
--- 54653,54858 ----
  msgid "Invalid KIND parameter of %s at %L"
  msgstr ""
  
! #: fortran/simplify.c:694
  #, gcc-internal-format
  msgid "gfc_simplify_abs(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:715
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of %s function at %L is negative"
  msgstr ""
  
! #: fortran/simplify.c:722
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of %s function at %L outside of range [0,127]"
  msgstr ""
  
! #: fortran/simplify.c:740
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Argument of %s function at %L is too large for the collating sequence of "
  "kind %d"
  msgstr ""
  
! #: fortran/simplify.c:777
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ACOS at %L must be between -1 and 1"
  msgstr ""
  
! #: fortran/simplify.c:791
  #, gcc-internal-format
  msgid "in gfc_simplify_acos(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:810
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ACOSH at %L must not be less than 1"
  msgstr ""
  
! #: fortran/simplify.c:825
  #, gcc-internal-format
  msgid "in gfc_simplify_acosh(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1054
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ASIN at %L must be between -1 and 1"
  msgstr ""
  
! #: fortran/simplify.c:1068
  #, gcc-internal-format
  msgid "in gfc_simplify_asin(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1096
  #, gcc-internal-format
  msgid "in gfc_simplify_asinh(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1124
  #, gcc-internal-format
  msgid "in gfc_simplify_atan(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1145
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ATANH at %L must be inside the range -1 to 1"
  msgstr ""
  
! #: fortran/simplify.c:1159
  #, gcc-internal-format
  msgid "in gfc_simplify_atanh(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1176
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "If first argument of ATAN2 %L is zero, then the second argument must not be "
  "zero"
  msgstr ""
  
! #: fortran/simplify.c:1268
  #, gcc-internal-format, gfc-internal-format
  msgid "Result of BESSEL_YN is -INF at %L"
  msgstr ""
  
! #: fortran/simplify.c:1637
  #, gcc-internal-format
  msgid "gfc_simplify_dcmplx(): Bad type (x)"
  msgstr ""
  
! #: fortran/simplify.c:1656
  #, gcc-internal-format
  msgid "gfc_simplify_dcmplx(): Bad type (y)"
  msgstr ""
  
! #: fortran/simplify.c:1733
  #, gcc-internal-format
  msgid "in gfc_simplify_cos(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:1878
  #, gcc-internal-format
  msgid "gfc_simplify_dim(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:2186
  #, gcc-internal-format
  msgid "in gfc_simplify_exp(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:2353
  #, gcc-internal-format
  msgid "gfc_simplify_floor(): Bad kind"
  msgstr ""
  
! #: fortran/simplify.c:2503
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of IACHAR at %L must be of length one"
  msgstr ""
  
! #: fortran/simplify.c:2511
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of IACHAR function at %L outside of range 0..127"
  msgstr ""
  
! #: fortran/simplify.c:2626
  #, gcc-internal-format, gfc-internal-format
  msgid "Sum of second and third arguments of IBITS exceeds bit size at %L"
  msgstr ""
  
! #: fortran/simplify.c:2650
  #, gcc-internal-format
  msgid "IBITS: Bad bit"
  msgstr ""
  
! #: fortran/simplify.c:2701
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of ICHAR at %L must be of length one"
  msgstr ""
  
  #. Left shift, as in SHIFTL.
! #: fortran/simplify.c:3066 fortran/simplify.c:3074
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of %s is negative at %L"
  msgstr ""
  
! #: fortran/simplify.c:3086
  #, gcc-internal-format, gfc-internal-format
  msgid "Magnitude of second argument of %s exceeds bit size at %L"
  msgstr ""
  
! #: fortran/simplify.c:3212
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Magnitude of second argument of ISHFTC exceeds BIT_SIZE of first argument at "
  "%L"
  msgstr ""
  
! #: fortran/simplify.c:3515 fortran/simplify.c:3650
  #, gcc-internal-format, gfc-internal-format
  msgid "DIM argument at %L is out of bounds"
  msgstr ""
  
! #: fortran/simplify.c:3833
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of LOG at %L cannot be less than or equal to zero"
  msgstr ""
  
! #: fortran/simplify.c:3846
  #, gcc-internal-format, gfc-internal-format
  msgid "Complex argument of LOG at %L cannot be zero"
  msgstr ""
  
! #: fortran/simplify.c:3857
  #, gcc-internal-format
  msgid "gfc_simplify_log: bad type"
  msgstr ""
  
! #: fortran/simplify.c:3874
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of LOG10 at %L cannot be less than or equal to zero"
  msgstr ""
  
! #: fortran/simplify.c:4177
  #, gcc-internal-format
  msgid "simplify_min_max(): Bad type in arglist"
  msgstr ""
  
  #. Result is processor-dependent.
! #: fortran/simplify.c:4353
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument MOD at %L is zero"
  msgstr ""
  
  #. Result is processor-dependent.
! #: fortran/simplify.c:4364
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of MOD at %L is zero"
  msgstr ""
  
! #: fortran/simplify.c:4375
  #, gcc-internal-format
  msgid "gfc_simplify_mod(): Bad arguments"
  msgstr ""
*************** msgstr ""
*** 54425,54516 ****
  #. Result is processor-dependent. This processor just opts
  #. to not handle it at all.
  #. Result is processor-dependent.
! #: fortran/simplify.c:4396 fortran/simplify.c:4408
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of MODULO at %L is zero"
  msgstr ""
  
! #: fortran/simplify.c:4428
  #, gcc-internal-format
  msgid "gfc_simplify_modulo(): Bad arguments"
  msgstr ""
  
! #: fortran/simplify.c:4488
  #, gcc-internal-format, gfc-internal-format
  msgid "Result of NEAREST is NaN at %L"
  msgstr ""
  
! #: fortran/simplify.c:4964
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument NCOPIES of REPEAT intrinsic is negative at %L"
  msgstr ""
  
! #: fortran/simplify.c:5019
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument NCOPIES of REPEAT intrinsic is too large at %L"
  msgstr ""
  
! #: fortran/simplify.c:5169
  #, gcc-internal-format, gfc-internal-format
  msgid "Reshaped array too large at %C"
  msgstr ""
  
! #: fortran/simplify.c:5283
  #, gcc-internal-format, gfc-internal-format
  msgid "Result of SCALE overflows its kind at %L"
  msgstr ""
  
! #: fortran/simplify.c:5943
  #, gcc-internal-format
  msgid "Bad type in gfc_simplify_sign"
  msgstr ""
  
! #: fortran/simplify.c:5972
  #, gcc-internal-format
  msgid "in gfc_simplify_sin(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:6099 fortran/simplify.c:6331
  #, gcc-internal-format
  msgid "Failure getting length of a constant array."
  msgstr ""
  
! #: fortran/simplify.c:6187
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of SQRT at %L has a negative value"
  msgstr ""
  
! #: fortran/simplify.c:6203
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid argument of SQRT at %L"
  msgstr ""
  
! #: fortran/simplify.c:6498
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Out of bounds in IMAGE_INDEX at %L for dimension %d, SUB has %ld and COARRAY "
  "lower bound is %ld)"
  msgstr ""
  
! #: fortran/simplify.c:6521
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Out of bounds in IMAGE_INDEX at %L for dimension %d, SUB has %ld and COARRAY "
  "upper bound is %ld)"
  msgstr ""
  
! #: fortran/simplify.c:6856
  #, gcc-internal-format
  msgid "gfc_convert_constant(): Unexpected type"
  msgstr ""
  
! #: fortran/simplify.c:6942
  #, gcc-internal-format
  msgid ""
  "Character %qs in string at %L cannot be converted into character kind %d"
  msgstr ""
  
! #: fortran/st.c:254
  #, gcc-internal-format
  msgid "gfc_free_statement(): Bad statement"
  msgstr ""
--- 54860,54951 ----
  #. Result is processor-dependent. This processor just opts
  #. to not handle it at all.
  #. Result is processor-dependent.
! #: fortran/simplify.c:4401 fortran/simplify.c:4413
  #, gcc-internal-format, gfc-internal-format
  msgid "Second argument of MODULO at %L is zero"
  msgstr ""
  
! #: fortran/simplify.c:4433
  #, gcc-internal-format
  msgid "gfc_simplify_modulo(): Bad arguments"
  msgstr ""
  
! #: fortran/simplify.c:4493
  #, gcc-internal-format, gfc-internal-format
  msgid "Result of NEAREST is NaN at %L"
  msgstr ""
  
! #: fortran/simplify.c:4969
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument NCOPIES of REPEAT intrinsic is negative at %L"
  msgstr ""
  
! #: fortran/simplify.c:5024
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument NCOPIES of REPEAT intrinsic is too large at %L"
  msgstr ""
  
! #: fortran/simplify.c:5174
  #, gcc-internal-format, gfc-internal-format
  msgid "Reshaped array too large at %C"
  msgstr ""
  
! #: fortran/simplify.c:5288
  #, gcc-internal-format, gfc-internal-format
  msgid "Result of SCALE overflows its kind at %L"
  msgstr ""
  
! #: fortran/simplify.c:5948
  #, gcc-internal-format
  msgid "Bad type in gfc_simplify_sign"
  msgstr ""
  
! #: fortran/simplify.c:5977
  #, gcc-internal-format
  msgid "in gfc_simplify_sin(): Bad type"
  msgstr ""
  
! #: fortran/simplify.c:6104 fortran/simplify.c:6336
  #, gcc-internal-format
  msgid "Failure getting length of a constant array."
  msgstr ""
  
! #: fortran/simplify.c:6192
  #, gcc-internal-format, gfc-internal-format
  msgid "Argument of SQRT at %L has a negative value"
  msgstr ""
  
! #: fortran/simplify.c:6208
  #, gcc-internal-format, gfc-internal-format
  msgid "invalid argument of SQRT at %L"
  msgstr ""
  
! #: fortran/simplify.c:6503
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Out of bounds in IMAGE_INDEX at %L for dimension %d, SUB has %ld and COARRAY "
  "lower bound is %ld)"
  msgstr ""
  
! #: fortran/simplify.c:6526
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Out of bounds in IMAGE_INDEX at %L for dimension %d, SUB has %ld and COARRAY "
  "upper bound is %ld)"
  msgstr ""
  
! #: fortran/simplify.c:6861
  #, gcc-internal-format
  msgid "gfc_convert_constant(): Unexpected type"
  msgstr ""
  
! #: fortran/simplify.c:6947
  #, gcc-internal-format
  msgid ""
  "Character %qs in string at %L cannot be converted into character kind %d"
  msgstr ""
  
! #: fortran/st.c:256
  #, gcc-internal-format
  msgid "gfc_free_statement(): Bad statement"
  msgstr ""
*************** msgstr ""
*** 54951,54969 ****
  
  #. Problems occur when we get something like
  #. integer :: a(lots) = (/(i, i=1, lots)/)
! #: fortran/trans-array.c:5482
  #, gcc-internal-format
  msgid ""
  "The number of elements in the array constructor at %L requires an increase "
  "of the allowed %d upper limit. See %<-fmax-array-constructor%> option"
  msgstr ""
  
! #: fortran/trans-array.c:7263
  #, gcc-internal-format
  msgid "Creating array temporary at %L for argument %qs"
  msgstr ""
  
! #: fortran/trans-array.c:9170
  #, gcc-internal-format, gfc-internal-format
  msgid "bad expression type during walk (%d)"
  msgstr ""
--- 55386,55404 ----
  
  #. Problems occur when we get something like
  #. integer :: a(lots) = (/(i, i=1, lots)/)
! #: fortran/trans-array.c:5499
  #, gcc-internal-format
  msgid ""
  "The number of elements in the array constructor at %L requires an increase "
  "of the allowed %d upper limit. See %<-fmax-array-constructor%> option"
  msgstr ""
  
! #: fortran/trans-array.c:7297
  #, gcc-internal-format
  msgid "Creating array temporary at %L for argument %qs"
  msgstr ""
  
! #: fortran/trans-array.c:9367
  #, gcc-internal-format, gfc-internal-format
  msgid "bad expression type during walk (%d)"
  msgstr ""
*************** msgstr ""
*** 54985,55051 ****
  msgid "element_number(): Bad dimension type"
  msgstr ""
  
! #: fortran/trans-common.c:873
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array reference at %L"
  msgstr ""
  
! #: fortran/trans-common.c:881
  #, gcc-internal-format, gfc-internal-format
  msgid "Illegal reference type at %L as EQUIVALENCE object"
  msgstr ""
  
! #: fortran/trans-common.c:921
  #, gcc-internal-format, gfc-internal-format
  msgid "Inconsistent equivalence rules involving '%s' at %L and '%s' at %L"
  msgstr ""
  
  #. Aligning this field would misalign a previous field.
! #: fortran/trans-common.c:1054
  #, gcc-internal-format
  msgid ""
  "The equivalence set for variable %qs declared at %L violates alignment "
  "requirements"
  msgstr ""
  
! #: fortran/trans-common.c:1119
  #, gcc-internal-format
  msgid "Equivalence for %qs does not match ordering of COMMON %qs at %L"
  msgstr ""
  
! #: fortran/trans-common.c:1134
  #, gcc-internal-format
  msgid ""
  "The equivalence set for %qs cause an invalid extension to COMMON %qs at %L"
  msgstr ""
  
! #: fortran/trans-common.c:1150
  #, gcc-internal-format
  msgid ""
  "Padding of %d bytes required before %qs in COMMON %qs at %L; reorder "
  "elements or use -fno-align-commons"
  msgstr ""
  
! #: fortran/trans-common.c:1156
  #, gcc-internal-format
  msgid ""
  "Padding of %d bytes required before %qs in COMMON at %L; reorder elements or "
  "use -fno-align-commons"
  msgstr ""
  
! #: fortran/trans-common.c:1177
  #, gcc-internal-format, gfc-internal-format
  msgid "COMMON '%s' at %L does not exist"
  msgstr ""
  
! #: fortran/trans-common.c:1186
  #, gcc-internal-format
  msgid ""
  "COMMON %qs at %L requires %d bytes of padding; reorder elements or use %<-"
  "fno-align-commons%>"
  msgstr ""
  
! #: fortran/trans-common.c:1191
  #, gcc-internal-format
  msgid ""
  "COMMON at %L requires %d bytes of padding; reorder elements or use %<-fno-"
--- 55420,55486 ----
  msgid "element_number(): Bad dimension type"
  msgstr ""
  
! #: fortran/trans-common.c:881
  #, gcc-internal-format, gfc-internal-format
  msgid "Bad array reference at %L"
  msgstr ""
  
! #: fortran/trans-common.c:889
  #, gcc-internal-format, gfc-internal-format
  msgid "Illegal reference type at %L as EQUIVALENCE object"
  msgstr ""
  
! #: fortran/trans-common.c:929
  #, gcc-internal-format, gfc-internal-format
  msgid "Inconsistent equivalence rules involving '%s' at %L and '%s' at %L"
  msgstr ""
  
  #. Aligning this field would misalign a previous field.
! #: fortran/trans-common.c:1062
  #, gcc-internal-format
  msgid ""
  "The equivalence set for variable %qs declared at %L violates alignment "
  "requirements"
  msgstr ""
  
! #: fortran/trans-common.c:1127
  #, gcc-internal-format
  msgid "Equivalence for %qs does not match ordering of COMMON %qs at %L"
  msgstr ""
  
! #: fortran/trans-common.c:1142
  #, gcc-internal-format
  msgid ""
  "The equivalence set for %qs cause an invalid extension to COMMON %qs at %L"
  msgstr ""
  
! #: fortran/trans-common.c:1158
  #, gcc-internal-format
  msgid ""
  "Padding of %d bytes required before %qs in COMMON %qs at %L; reorder "
  "elements or use -fno-align-commons"
  msgstr ""
  
! #: fortran/trans-common.c:1164
  #, gcc-internal-format
  msgid ""
  "Padding of %d bytes required before %qs in COMMON at %L; reorder elements or "
  "use -fno-align-commons"
  msgstr ""
  
! #: fortran/trans-common.c:1185
  #, gcc-internal-format, gfc-internal-format
  msgid "COMMON '%s' at %L does not exist"
  msgstr ""
  
! #: fortran/trans-common.c:1194
  #, gcc-internal-format
  msgid ""
  "COMMON %qs at %L requires %d bytes of padding; reorder elements or use %<-"
  "fno-align-commons%>"
  msgstr ""
  
! #: fortran/trans-common.c:1199
  #, gcc-internal-format
  msgid ""
  "COMMON at %L requires %d bytes of padding; reorder elements or use %<-fno-"
*************** msgstr ""
*** 55067,55181 ****
  msgid "non-constant initialization expression at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:1494
  #, gcc-internal-format
  msgid "intrinsic variable which isn't a procedure"
  msgstr ""
  
! #: fortran/trans-decl.c:3869 fortran/trans-decl.c:5880
  #, gcc-internal-format
  msgid "Return value of function %qs at %L not set"
  msgstr ""
  
! #: fortran/trans-decl.c:4262
  #, gcc-internal-format
  msgid "Deferred type parameter not yet supported"
  msgstr ""
  
! #: fortran/trans-decl.c:4489
  #, gcc-internal-format
  msgid "backend decl for module variable %qs already exists"
  msgstr ""
  
! #: fortran/trans-decl.c:4502
  #, gcc-internal-format
  msgid "Unused PRIVATE module variable %qs declared at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5065
  #, gcc-internal-format
  msgid "Dummy argument %qs at %L was declared INTENT(OUT) but was not set"
  msgstr ""
  
! #: fortran/trans-decl.c:5071
  #, gcc-internal-format
  msgid ""
  "Derived-type dummy argument %qs at %L was declared INTENT(OUT) but was not "
  "set and does not have a default initializer"
  msgstr ""
  
! #: fortran/trans-decl.c:5081 fortran/trans-decl.c:5202
  #, gcc-internal-format
  msgid "Unused dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5096
  #, gcc-internal-format
  msgid "Unused module variable %qs which has been explicitly imported at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5105
  #, gcc-internal-format
  msgid "Unused variable %qs declared at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5154
  #, gcc-internal-format
  msgid "Unused parameter %qs declared at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5158
  #, gcc-internal-format
  msgid "Unused parameter %qs which has been explicitly imported at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5174
  #, gcc-internal-format
  msgid "Return value %qs of function %qs declared at %L not set"
  msgstr ""
  
! #: fortran/trans-expr.c:797
  #, gcc-internal-format, gfc-internal-format
  msgid "Can't compute the length of the char array at %L."
  msgstr ""
  
! #: fortran/trans-expr.c:1396
  #, gcc-internal-format, gfc-internal-format
  msgid "Code for reallocating the allocatable array at %L will be added"
  msgstr ""
  
! #: fortran/trans-expr.c:1400
  #, gcc-internal-format, gfc-internal-format
  msgid "Code for reallocating the allocatable variable at %L will be added"
  msgstr ""
  
! #: fortran/trans-expr.c:1708
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Sorry, coindexed access to a pointer or allocatable component of the "
  "coindexed coarray at %L is not yet supported"
  msgstr ""
  
! #: fortran/trans-expr.c:1722
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Sorry, coindexed coarray at %L with allocatable component is not yet "
  "supported"
  msgstr ""
  
! #: fortran/trans-expr.c:1745
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Sorry, coindexed access at %L to a scalar component with an array partref is "
  "not yet supported"
  msgstr ""
  
! #: fortran/trans-expr.c:3109
  #, gcc-internal-format
  msgid "Unknown intrinsic op"
  msgstr ""
  
! #: fortran/trans-expr.c:4397
  #, gcc-internal-format, gfc-internal-format
  msgid "Unknown argument list function at %L"
  msgstr ""
--- 55502,55616 ----
  msgid "non-constant initialization expression at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:1506
  #, gcc-internal-format
  msgid "intrinsic variable which isn't a procedure"
  msgstr ""
  
! #: fortran/trans-decl.c:3972 fortran/trans-decl.c:5990
  #, gcc-internal-format
  msgid "Return value of function %qs at %L not set"
  msgstr ""
  
! #: fortran/trans-decl.c:4346
  #, gcc-internal-format
  msgid "Deferred type parameter not yet supported"
  msgstr ""
  
! #: fortran/trans-decl.c:4573
  #, gcc-internal-format
  msgid "backend decl for module variable %qs already exists"
  msgstr ""
  
! #: fortran/trans-decl.c:4586
  #, gcc-internal-format
  msgid "Unused PRIVATE module variable %qs declared at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5155
  #, gcc-internal-format
  msgid "Dummy argument %qs at %L was declared INTENT(OUT) but was not set"
  msgstr ""
  
! #: fortran/trans-decl.c:5161
  #, gcc-internal-format
  msgid ""
  "Derived-type dummy argument %qs at %L was declared INTENT(OUT) but was not "
  "set and does not have a default initializer"
  msgstr ""
  
! #: fortran/trans-decl.c:5171 fortran/trans-decl.c:5312
  #, gcc-internal-format
  msgid "Unused dummy argument %qs at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5186
  #, gcc-internal-format
  msgid "Unused module variable %qs which has been explicitly imported at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5205
  #, gcc-internal-format
  msgid "Unused variable %qs declared at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5254
  #, gcc-internal-format
  msgid "Unused parameter %qs declared at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5258
  #, gcc-internal-format
  msgid "Unused parameter %qs which has been explicitly imported at %L"
  msgstr ""
  
! #: fortran/trans-decl.c:5284
  #, gcc-internal-format
  msgid "Return value %qs of function %qs declared at %L not set"
  msgstr ""
  
! #: fortran/trans-expr.c:816
  #, gcc-internal-format, gfc-internal-format
  msgid "Can't compute the length of the char array at %L."
  msgstr ""
  
! #: fortran/trans-expr.c:1436
  #, gcc-internal-format, gfc-internal-format
  msgid "Code for reallocating the allocatable array at %L will be added"
  msgstr ""
  
! #: fortran/trans-expr.c:1440
  #, gcc-internal-format, gfc-internal-format
  msgid "Code for reallocating the allocatable variable at %L will be added"
  msgstr ""
  
! #: fortran/trans-expr.c:1748
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Sorry, coindexed access to a pointer or allocatable component of the "
  "coindexed coarray at %L is not yet supported"
  msgstr ""
  
! #: fortran/trans-expr.c:1762
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Sorry, coindexed coarray at %L with allocatable component is not yet "
  "supported"
  msgstr ""
  
! #: fortran/trans-expr.c:1785
  #, gcc-internal-format, gfc-internal-format
  msgid ""
  "Sorry, coindexed access at %L to a scalar component with an array partref is "
  "not yet supported"
  msgstr ""
  
! #: fortran/trans-expr.c:3149
  #, gcc-internal-format
  msgid "Unknown intrinsic op"
  msgstr ""
  
! #: fortran/trans-expr.c:4437
  #, gcc-internal-format, gfc-internal-format
  msgid "Unknown argument list function at %L"
  msgstr ""
*************** msgstr ""
*** 55185,55196 ****
  msgid "Intrinsic function %qs (%d) not recognized"
  msgstr ""
  
! #: fortran/trans-intrinsic.c:1487 fortran/trans-intrinsic.c:1873
! #: fortran/trans-intrinsic.c:2069
  #, gcc-internal-format
  msgid "%<dim%> argument of %s intrinsic at %L is not a valid dimension index"
  msgstr ""
  
  #: fortran/trans-io.c:1861
  #, gcc-internal-format
  msgid "build_dt: format with namelist"
--- 55620,55641 ----
  msgid "Intrinsic function %qs (%d) not recognized"
  msgstr ""
  
! #: fortran/trans-intrinsic.c:1518 fortran/trans-intrinsic.c:1904
! #: fortran/trans-intrinsic.c:2100
  #, gcc-internal-format
  msgid "%<dim%> argument of %s intrinsic at %L is not a valid dimension index"
  msgstr ""
  
+ #: fortran/trans-intrinsic.c:9324 fortran/trans-stmt.c:933
+ #, gcc-internal-format, gfc-internal-format
+ msgid "Sorry, the event component of derived type at %L is not yet supported"
+ msgstr ""
+ 
+ #: fortran/trans-intrinsic.c:9331
+ #, gcc-internal-format, gfc-internal-format
+ msgid "The event variable at %L shall not be coindexed "
+ msgstr ""
+ 
  #: fortran/trans-io.c:1861
  #, gcc-internal-format
  msgid "build_dt: format with namelist"
*************** msgstr ""
*** 55201,55207 ****
  msgid "Bad IO basetype (%d)"
  msgstr ""
  
! #: fortran/trans-openmp.c:4300
  #, gcc-internal-format
  msgid "gfc_trans_omp_workshare(): Bad statement code"
  msgstr ""
--- 55646,55652 ----
  msgid "Bad IO basetype (%d)"
  msgstr ""
  
! #: fortran/trans-openmp.c:4305
  #, gcc-internal-format
  msgid "gfc_trans_omp_workshare(): Bad statement code"
  msgstr ""
*************** msgstr ""
*** 55211,55227 ****
  msgid "An alternate return at %L without a * dummy argument"
  msgstr ""
  
! #: fortran/trans-stmt.c:729
  #, gcc-internal-format, gfc-internal-format
  msgid "Sorry, the lock component of derived type at %L is not yet supported"
  msgstr ""
  
! #: fortran/trans-stmt.c:994
  #, gcc-internal-format, gfc-internal-format
  msgid "Sorry, only support for integer kind %d implemented for image-set at %L"
  msgstr ""
  
! #: fortran/trans-stmt.c:2723
  #, gcc-internal-format
  msgid "gfc_trans_select(): Bad type for case expr."
  msgstr ""
--- 55656,55672 ----
  msgid "An alternate return at %L without a * dummy argument"
  msgstr ""
  
! #: fortran/trans-stmt.c:735
  #, gcc-internal-format, gfc-internal-format
  msgid "Sorry, the lock component of derived type at %L is not yet supported"
  msgstr ""
  
! #: fortran/trans-stmt.c:1186
  #, gcc-internal-format, gfc-internal-format
  msgid "Sorry, only support for integer kind %d implemented for image-set at %L"
  msgstr ""
  
! #: fortran/trans-stmt.c:2936
  #, gcc-internal-format
  msgid "gfc_trans_select(): Bad type for case expr."
  msgstr ""
*************** msgstr ""
*** 55286,55297 ****
  msgid "gfc_validate_kind(): Got bad kind"
  msgstr ""
  
! #: fortran/trans-types.c:1473
  #, gcc-internal-format, gfc-internal-format
  msgid "Array element size too big at %C"
  msgstr ""
  
! #: fortran/trans.c:1934
  #, gcc-internal-format
  msgid "gfc_trans_code(): Bad statement code"
  msgstr ""
--- 55731,55742 ----
  msgid "gfc_validate_kind(): Got bad kind"
  msgstr ""
  
! #: fortran/trans-types.c:1475
  #, gcc-internal-format, gfc-internal-format
  msgid "Array element size too big at %C"
  msgstr ""
  
! #: fortran/trans.c:1985
  #, gcc-internal-format
  msgid "gfc_trans_code(): Bad statement code"
  msgstr ""
*************** msgstr ""
*** 55326,55347 ****
  msgid "non-static method %q+D overrides static method"
  msgstr ""
  
! #: java/decl.c:1225
  #, gcc-internal-format
  msgid "%q+D used prior to declaration"
  msgstr ""
  
! #: java/decl.c:1648
  #, gcc-internal-format
  msgid "In %+D: overlapped variable and exception ranges at %d"
  msgstr ""
  
! #: java/decl.c:1699
  #, gcc-internal-format
  msgid "bad type in parameter debug info"
  msgstr ""
  
! #: java/decl.c:1708
  #, gcc-internal-format
  msgid "bad PC range for debug info for local %q+D"
  msgstr ""
--- 55771,55792 ----
  msgid "non-static method %q+D overrides static method"
  msgstr ""
  
! #: java/decl.c:1219
  #, gcc-internal-format
  msgid "%q+D used prior to declaration"
  msgstr ""
  
! #: java/decl.c:1642
  #, gcc-internal-format
  msgid "In %+D: overlapped variable and exception ranges at %d"
  msgstr ""
  
! #: java/decl.c:1693
  #, gcc-internal-format
  msgid "bad type in parameter debug info"
  msgstr ""
  
! #: java/decl.c:1702
  #, gcc-internal-format
  msgid "bad PC range for debug info for local %q+D"
  msgstr ""
diff -Nrcpad gcc-5.4.0/gcc/postreload.c gcc-5.5.0/gcc/postreload.c
*** gcc-5.4.0/gcc/postreload.c	Tue Mar 15 03:14:38 2016
--- gcc-5.5.0/gcc/postreload.c	Thu Jan 12 17:41:49 2017
*************** reload_cse_simplify (rtx_insn *insn, rtx
*** 120,125 ****
--- 120,132 ----
    basic_block insn_bb = BLOCK_FOR_INSN (insn);
    unsigned insn_bb_succs = EDGE_COUNT (insn_bb->succs);
  
+   /* If NO_FUNCTION_CSE has been set by the target, then we should not try
+      to cse function calls.  */
+ #ifdef NO_FUNCTION_CSE
+   if (CALL_P (insn))
+     return false;
+ #endif
+ 
    if (GET_CODE (body) == SET)
      {
        int count = 0;
diff -Nrcpad gcc-5.4.0/gcc/pretty-print.c gcc-5.5.0/gcc/pretty-print.c
*** gcc-5.4.0/gcc/pretty-print.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/pretty-print.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 25,32 ****
  #include "pretty-print.h"
  #include "diagnostic-color.h"
  
- #include <new>                    // For placement-new.
- 
  #if HAVE_ICONV
  #include <iconv.h>
  #endif
--- 25,30 ----
diff -Nrcpad gcc-5.4.0/gcc/real.c gcc-5.5.0/gcc/real.c
*** gcc-5.4.0/gcc/real.c	Fri Mar  6 12:05:38 2015
--- gcc-5.5.0/gcc/real.c	Tue Jun 27 18:24:51 2017
*************** do_compare (const REAL_VALUE_TYPE *a, co
*** 950,961 ****
        gcc_unreachable ();
      }
  
-   if (a->sign != b->sign)
-     return -a->sign - -b->sign;
- 
    if (a->decimal || b->decimal)
      return decimal_do_compare (a, b, nan_result);
  
    if (REAL_EXP (a) > REAL_EXP (b))
      ret = 1;
    else if (REAL_EXP (a) < REAL_EXP (b))
--- 950,961 ----
        gcc_unreachable ();
      }
  
    if (a->decimal || b->decimal)
      return decimal_do_compare (a, b, nan_result);
  
+   if (a->sign != b->sign)
+     return -a->sign - -b->sign;
+ 
    if (REAL_EXP (a) > REAL_EXP (b))
      ret = 1;
    else if (REAL_EXP (a) < REAL_EXP (b))
diff -Nrcpad gcc-5.4.0/gcc/ree.c gcc-5.5.0/gcc/ree.c
*** gcc-5.4.0/gcc/ree.c	Tue Nov 24 14:24:24 2015
--- gcc-5.5.0/gcc/ree.c	Fri Dec  2 12:22:54 2016
*************** get_defs (rtx_insn *insn, rtx reg, vec<r
*** 529,534 ****
--- 529,542 ----
          return NULL;
        if (DF_REF_INSN_INFO (ref_link->ref) == NULL)
          return NULL;
+       /* As global regs are assumed to be defined at each function call
+ 	 dataflow can report a call_insn as being a definition of REG.
+ 	 But we can't do anything with that in this pass so proceed only
+ 	 if the instruction really sets REG in a way that can be deduced
+ 	 from the RTL structure.  */
+       if (global_regs[REGNO (reg)]
+ 	  && !set_of (reg, DF_REF_INSN (ref_link->ref)))
+ 	return NULL;
      }
  
    if (dest)
*************** make_defs_and_copies_lists (rtx_insn *ex
*** 627,633 ****
  
    /* Initialize the work list.  */
    if (!get_defs (extend_insn, src_reg, &state->work_list))
!     gcc_unreachable ();
  
    is_insn_visited = XCNEWVEC (bool, max_insn_uid);
  
--- 635,641 ----
  
    /* Initialize the work list.  */
    if (!get_defs (extend_insn, src_reg, &state->work_list))
!     return false;
  
    is_insn_visited = XCNEWVEC (bool, max_insn_uid);
  
diff -Nrcpad gcc-5.4.0/gcc/rtl.h gcc-5.5.0/gcc/rtl.h
*** gcc-5.4.0/gcc/rtl.h	Wed Apr  6 07:45:34 2016
--- gcc-5.5.0/gcc/rtl.h	Thu Jul  7 12:39:40 2016
*************** extern unsigned int subreg_highpart_offs
*** 2609,2614 ****
--- 2609,2616 ----
  					    machine_mode);
  extern int byte_lowpart_offset (machine_mode, machine_mode);
  extern rtx make_safe_from (rtx, rtx);
+ extern rtx convert_memory_address_addr_space_1 (machine_mode, rtx,
+ 						addr_space_t, bool, bool);
  extern rtx convert_memory_address_addr_space (machine_mode, rtx,
  					      addr_space_t);
  #define convert_memory_address(to_mode,x) \
diff -Nrcpad gcc-5.4.0/gcc/sel-sched.c gcc-5.5.0/gcc/sel-sched.c
*** gcc-5.4.0/gcc/sel-sched.c	Thu Mar 31 14:50:57 2016
--- gcc-5.5.0/gcc/sel-sched.c	Tue May 30 08:03:03 2017
*************** moveup_expr_cached (expr_t expr, insn_t
*** 2559,2564 ****
--- 2559,2565 ----
      }
  
    if (DEBUG_INSN_P (EXPR_INSN_RTX (expr))
+       && BLOCK_FOR_INSN (EXPR_INSN_RTX (expr))
        && (sel_bb_head (BLOCK_FOR_INSN (EXPR_INSN_RTX (expr)))
  	  == EXPR_INSN_RTX (expr)))
      /* Don't use cached information for debug insns that are heads of
diff -Nrcpad gcc-5.4.0/gcc/simplify-rtx.c gcc-5.5.0/gcc/simplify-rtx.c
*** gcc-5.4.0/gcc/simplify-rtx.c	Wed Jul 15 15:13:36 2015
--- gcc-5.5.0/gcc/simplify-rtx.c	Tue Aug 22 10:07:51 2017
*************** avoid_constant_pool_reference (rtx x)
*** 283,297 ****
        /* If we're accessing the constant in a different mode than it was
           originally stored, attempt to fix that up via subreg simplifications.
           If that fails we have no choice but to return the original memory.  */
!       if ((offset != 0 || cmode != GET_MODE (x))
! 	  && offset >= 0 && offset < GET_MODE_SIZE (cmode))
          {
            rtx tem = simplify_subreg (GET_MODE (x), c, cmode, offset);
            if (tem && CONSTANT_P (tem))
              return tem;
          }
-       else
-         return c;
      }
  
    return x;
--- 283,296 ----
        /* If we're accessing the constant in a different mode than it was
           originally stored, attempt to fix that up via subreg simplifications.
           If that fails we have no choice but to return the original memory.  */
!       if (offset == 0 && cmode == GET_MODE (x))
! 	return c;
!       else if (offset >= 0 && offset < GET_MODE_SIZE (cmode))
          {
            rtx tem = simplify_subreg (GET_MODE (x), c, cmode, offset);
            if (tem && CONSTANT_P (tem))
              return tem;
          }
      }
  
    return x;
*************** simplify_unary_operation_1 (enum rtx_cod
*** 875,882 ****
  	  && XEXP (op, 1) == constm1_rtx)
  	return simplify_gen_unary (NEG, mode, XEXP (op, 0), mode);
  
!       /* Similarly, (not (neg X)) is (plus X -1).  */
!       if (GET_CODE (op) == NEG)
  	return simplify_gen_binary (PLUS, mode, XEXP (op, 0),
  				    CONSTM1_RTX (mode));
  
--- 874,883 ----
  	  && XEXP (op, 1) == constm1_rtx)
  	return simplify_gen_unary (NEG, mode, XEXP (op, 0), mode);
  
!       /* Similarly, (not (neg X)) is (plus X -1).  Only do this for
! 	 modes that have CONSTM1_RTX, i.e. MODE_INT, MODE_PARTIAL_INT
! 	 and MODE_VECTOR_INT.  */
!       if (GET_CODE (op) == NEG && CONSTM1_RTX (mode))
  	return simplify_gen_binary (PLUS, mode, XEXP (op, 0),
  				    CONSTM1_RTX (mode));
  
*************** simplify_unary_operation_1 (enum rtx_cod
*** 1438,1444 ****
  		  && REG_P (SUBREG_REG (op))
  		  && REG_POINTER (SUBREG_REG (op))
  		  && GET_MODE (SUBREG_REG (op)) == Pmode)))
! 	return convert_memory_address (Pmode, op);
  #endif
        break;
  
--- 1439,1452 ----
  		  && REG_P (SUBREG_REG (op))
  		  && REG_POINTER (SUBREG_REG (op))
  		  && GET_MODE (SUBREG_REG (op)) == Pmode)))
! 	{
! 	  temp
! 	    = convert_memory_address_addr_space_1 (Pmode, op,
! 						   ADDR_SPACE_GENERIC, false,
! 						   true);
! 	  if (temp)
! 	    return temp;
! 	}
  #endif
        break;
  
*************** simplify_unary_operation_1 (enum rtx_cod
*** 1559,1565 ****
  		  && REG_P (SUBREG_REG (op))
  		  && REG_POINTER (SUBREG_REG (op))
  		  && GET_MODE (SUBREG_REG (op)) == Pmode)))
! 	return convert_memory_address (Pmode, op);
  #endif
        break;
  
--- 1567,1580 ----
  		  && REG_P (SUBREG_REG (op))
  		  && REG_POINTER (SUBREG_REG (op))
  		  && GET_MODE (SUBREG_REG (op)) == Pmode)))
! 	{
! 	  temp
! 	    = convert_memory_address_addr_space_1 (Pmode, op,
! 						   ADDR_SPACE_GENERIC, false,
! 						   true);
! 	  if (temp)
! 	    return temp;
! 	}
  #endif
        break;
  
*************** simplify_const_relational_operation (enu
*** 5102,5135 ****
  	{
  	case LT:
  	  /* Optimize abs(x) < 0.0.  */
! 	  if (!HONOR_SNANS (mode)
! 	      && (!INTEGRAL_MODE_P (mode)
! 		  || (!flag_wrapv && !flag_trapv && flag_strict_overflow)))
! 	    {
! 	      if (INTEGRAL_MODE_P (mode)
! 		  && (issue_strict_overflow_warning
! 		      (WARN_STRICT_OVERFLOW_CONDITIONAL)))
! 		warning (OPT_Wstrict_overflow,
! 			 ("assuming signed overflow does not occur when "
! 			  "assuming abs (x) < 0 is false"));
! 	       return const0_rtx;
! 	    }
  	  break;
  
  	case GE:
  	  /* Optimize abs(x) >= 0.0.  */
! 	  if (!HONOR_NANS (mode)
! 	      && (!INTEGRAL_MODE_P (mode)
! 		  || (!flag_wrapv && !flag_trapv && flag_strict_overflow)))
! 	    {
! 	      if (INTEGRAL_MODE_P (mode)
! 	          && (issue_strict_overflow_warning
! 	    	  (WARN_STRICT_OVERFLOW_CONDITIONAL)))
! 	        warning (OPT_Wstrict_overflow,
! 			 ("assuming signed overflow does not occur when "
! 			  "assuming abs (x) >= 0 is true"));
! 	      return const_true_rtx;
! 	    }
  	  break;
  
  	case UNGE:
--- 5117,5130 ----
  	{
  	case LT:
  	  /* Optimize abs(x) < 0.0.  */
! 	  if (!INTEGRAL_MODE_P (mode) && !HONOR_SNANS (mode))
! 	    return const0_rtx;
  	  break;
  
  	case GE:
  	  /* Optimize abs(x) >= 0.0.  */
! 	  if (!INTEGRAL_MODE_P (mode) && !HONOR_NANS (mode))
! 	    return const_true_rtx;
  	  break;
  
  	case UNGE:
diff -Nrcpad gcc-5.4.0/gcc/system.h gcc-5.5.0/gcc/system.h
*** gcc-5.4.0/gcc/system.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/gcc/system.h	Mon Sep 25 23:49:58 2017
*************** extern int errno;
*** 215,220 ****
--- 215,232 ----
  #endif
  
  #ifdef __cplusplus
+ # ifdef INCLUDE_LIST
+ #  include <list>
+ # endif
+ # ifdef INCLUDE_MAP
+ #  include <map>
+ # endif
+ # ifdef INCLUDE_SET
+ #  include <set>
+ # endif
+ # ifdef INCLUDE_VECTOR
+ #  include <vector>
+ # endif
  # include <algorithm>
  # include <cstring>
  # include <utility>
diff -Nrcpad gcc-5.4.0/gcc/testsuite/ChangeLog gcc-5.5.0/gcc/testsuite/ChangeLog
*** gcc-5.4.0/gcc/testsuite/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gcc/testsuite/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,2016 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-10-02  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-09-29  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/82337
+ 	* gcc.c-torture/compile/pr82337.c: New file.
+ 
+ 2017-09-19  Martin Liska  <mliska@suse.cz>
+ 
+ 	Revert backport:
+ 	2017-08-10  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR c++/81355
+ 	* g++.dg/other/pr81355.C: New test.
+ 
+ 2017-09-18  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2017-04-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/80362
+ 	* gcc.dg/torture/pr80362.c: New testcase.
+ 
+ 	2015-11-25  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/68528
+ 	* gcc.dg/torture/pr68528.c: New testcase.
+ 
+ 	2017-03-27  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/80171
+ 	* g++.dg/torture/pr80171.C: New testcase.
+ 
+ 	2016-06-13  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/64516
+ 	* gcc.dg/align-3.c: New testcase.
+ 
+ 2017-09-18  Martin Liska  <mliska@suse.cz>
+ 
+ 	* gcc.dg/asan/pr81224.c: Remove.
+ 
+ 2017-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-09-12  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/82112
+ 	* gcc.target/powerpc/pr82112.c: New test.
+ 	* g++.dg/ext/altivec-18.C: New test.
+ 
+ 	PR target/82112
+ 	* c-c++-common/pr82112.c: New test.
+ 	* gcc.dg/pr82112.c: New test.
+ 
+ 	2017-08-08  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/81766
+ 	* gcc.target/i386/pr81766.c: New testcase.
+ 
+ 	2017-08-03  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/81621
+ 	* gcc.dg/pr81621.c: New test.
+ 
+ 	PR middle-end/81052
+ 	* c-c++-common/pr81052.c: New test.
+ 
+ 	2017-08-02  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/79499
+ 	* gcc.dg/pr79499.c: New test.
+ 
+ 	2017-06-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/81154
+ 	* g++.dg/gomp/pr81154.C: New test.
+ 
+ 	2017-06-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/80984
+ 	* g++.dg/opt/nrv18.C: New test.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-08-11  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-opt/79987
+ 	* gcc.target/i386/mpx/pr79987.c: New test.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-06-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR sanitizer/81224
+ 	* gcc.dg/asan/pr81224.c: New test.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-08-30  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR inline-asm/82001
+ 	* gcc.dg/ipa/pr82001.c: New test.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-08-10  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR c++/81355
+ 	* g++.dg/other/pr81355.C: New test.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-08-08  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-opt/81696
+ 	* gcc.dg/ipa/pr81696.c: New test.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-07-19  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR sanitizer/63361
+ 	* c-c++-common/ubsan/float-cast-overflow-1.c: Add either
+ 	-ffloat-store or -mieee for targets that need it.
+ 
+ 2017-09-15  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-06-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/81128
+ 	* gcc.target/i386/pr81128.c: New test.
+ 
+ 2017-09-12  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-09-05  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR target/81833
+ 	* gcc.target/powerpc/pr81833-1.c: New file.
+ 	* gcc.target/powerpc/pr81833-2.c: New file.
+ 
+ 2017-09-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR c++/81852
+ 	* g++.dg/cpp1y/feat-cxx11.C: Check __cpp_threadsafe_static_init.
+ 	* g++.dg/cpp1y/feat-cxx14.C: Likewise.
+ 	* g++.dg/cpp1y/feat-cxx98.C: Likewise.
+ 	* g++.dg/cpp1y/feat-neg.C: Likewise.
+ 
+ 2017-09-06  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline:
+ 	2017-08-30  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/81987
+ 	* g++.dg/torture/pr81987.C: New file.
+ 
+ 2017-09-05  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-08-29  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 		    Jakub Jelinek  <jakub@redhat.com>
+ 		    Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/81503
+ 	* gcc.c-torture/execute/pr81503.c: New file.
+ 
+ 2017-09-02  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/81770
+ 	* gfortran.dg/warn_target_lifetime_3.f90: Fix a typo.
+ 	* gfortran.dg/warn_target_lifetime_4.f90: New testcase.
+ 
+ 2017-08-22  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-08-17  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	PR target/80210
+ 	* gcc.target/powerpc/pr80210.c: New test.
+ 
+ 2017-08-22  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from trunk r247719.
+ 	2017-05-06  Richard Sandiford  <richard.sandiford@linaro.org>
+ 
+ 	PR rtl-optimization/75964
+ 	* gcc.dg/torture/pr75964.c: New test.
+ 
+ 2017-08-22  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2017-07-05 trunk r249995, r249996.
+ 
+ 	PR target/81305
+ 	* gcc.target/avr/isr-test.h: New file.
+ 	* gcc.target/avr/torture/isr-01-simple.c: New test.
+ 	* gcc.target/avr/torture/isr-02-call.c: New test.
+ 	* gcc.target/avr/torture/isr-03-fixed.c: New test.
+ 
+ 2017-08-16  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-08-08  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/81354
+ 	* g++.dg/torture/pr81354.C: New file.
+ 
+ 2017-07-31  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/81604
+ 	* c-c++-common/ubsan/pr81604.c: New test.
+ 
+ 2017-07-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/81555
+ 	PR tree-optimization/81556
+ 	* gcc.c-torture/execute/pr81555.c: New test.
+ 	* gcc.c-torture/execute/pr81556.c: New test.
+ 
+ 2016-07-25  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-07-14  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/81162
+ 	* gcc.dg/ubsan/pr81162.c: New file.
+ 
+ 2017-07-24  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/80569
+ 	* gcc.target/i386/pr80569.c: New test.
+ 
+ 2017-07-18  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/81471
+ 	* gcc.target/i386/pr81471.c: New test.
+ 
+ 2017-07-14  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-07-10  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/81375
+ 	* gcc.target/i386/pr81375.c: New test.
+ 
+ 	Backport from mainline
+ 	2017-07-04  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/81300
+ 	* gcc.target/i386/pr81300.c: New test.
+ 
+ 2017-07-03  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	* gcc.target/arm/fpscr.c: Require arm_vfp_ok instead of arm_fp_ok and
+ 	add -mfpu=vfp -mfloat-abi=softfp instead of fp_ok options.
+ 
+ 2017-07-03  Tom de Vries  <tom@codesourcery.com>
+ 
+ 	backport from mainline:
+ 	PR tree-optimization/81192
+ 	2017-07-03  Tom de Vries  <tom@codesourcery.com>
+ 
+ 	* gcc.dg/pr81192.c: New test.
+ 
+ 2017-06-27  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	Revert:
+ 	Backport from trunk:
+ 
+ 	2017-06-09  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR target/80966
+ 	* gcc.target/powerpc/stack-limit.c: New testcase.
+ 
+ 2017-06-27  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	Backports from trunk:
+ 
+ 	2017-05-17  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR middle-end/80692
+ 	* gcc.c-torture/execute/pr80692.c: New testcase.
+ 
+ 	2017-06-09  Segher Boessenkool  <segher@kernel.crashing.org>
+ 	PR target/80966
+ 	* gcc.target/powerpc/stack-limit.c: New testcase.
+ 
+ 2017-06-23  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2017-05-04  Prakhar Bahuguna  <prakhar.bahuguna@arm.com>
+ 
+ 	* gcc.target/arm/fpscr.c: New file.
+ 
+ 2017-06-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-05-26  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/80663
+ 	* g++.dg/ipa/pr80212.C: Remove the test as it does not longer
+ 	split at the problematic spot.
+ 	* gcc.dg/ipa/pr48195.c: Change 101 to 100 as 101 is no longer
+ 	a valid value of the param.
+ 
+ 2017-06-09  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/70601
+ 	* gfortran.dg/proc_ptr_comp_50.f90: New test.
+ 
+ 2017-06-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/81006
+ 	* c-c++-common/gomp/pr81006.c: New test.
+ 
+ 2017-06-06  David S. Miller  <davem@davemloft.net>
+ 
+ 	* gcc.target/sparc/sparc-ret-3.c: New test.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-04-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/80385
+ 	* g++.dg/opt/pr80385.C: New test.
+ 
+ 	PR c++/80363
+ 	* g++.dg/ext/pr80363.C: New test.
+ 
+ 	2017-04-10  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/80176
+ 	* g++.dg/init/ref23.C: New test.
+ 
+ 	2017-04-04  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/80286
+ 	* gcc.target/i386/avx-pr80286.c: New test.
+ 	* gcc.dg/pr80286.c: New test.
+ 
+ 	2017-03-31  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR debug/80025
+ 	* gcc.dg/torture/pr80025.c: New test.
+ 
+ 	2017-03-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/80168
+ 	* gcc.dg/asan/pr80168.c: New test.
+ 
+ 	2017-03-24  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/80112
+ 	* gcc.dg/pr80112.c: New test.
+ 
+ 	2017-03-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/80141
+ 	* g++.dg/gomp/pr80141.C: New test.
+ 
+ 	PR c++/80129
+ 	* g++.dg/torture/pr80129.C: New test.
+ 
+ 	2017-03-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/80097
+ 	* gcc.dg/ubsan/pr80097.c: New test.
+ 
+ 	2017-03-10  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/79896
+ 	* g++.dg/ext/int128-5.C: New test.
+ 
+ 	2017-03-09  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/79944
+ 	* c-c++-common/asan/pr79944.c: New test.
+ 
+ 	PR target/79932
+ 	* gcc.target/i386/pr79932-2.c: New test.
+ 
+ 	PR target/79932
+ 	* gcc.target/i386/pr79932-1.c: New test.
+ 
+ 	2017-03-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/79901
+ 	* gcc.target/i386/pr79901.c: New test.
+ 
+ 	2017-03-03  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79807
+ 	* gcc.target/i386/pr79807.c: New test.
+ 
+ 	2017-02-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79729
+ 	* gcc.target/i386/pr79729.c: New test.
+ 
+ 	2017-02-25  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/79396
+ 	* g++.dg/opt/pr79396.C: New test.
+ 
+ 	2017-02-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/79664
+ 	* g++.dg/gomp/pr79664.C: New test.
+ 
+ 	2017-02-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79570
+ 	* gcc.dg/pr79570.c: New test.
+ 
+ 	PR c++/79641
+ 	* c-c++-common/pr79641.c: New test.
+ 
+ 	PR target/79494
+ 	* gcc.dg/pr79494.c: New test.
+ 
+ 	2017-02-20  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79568
+ 	* gcc.target/i386/pr79568-1.c: New test.
+ 	* gcc.target/i386/pr79568-2.c: New test.
+ 	* gcc.target/i386/pr79568-3.c: New test.
+ 
+ 	2017-02-18  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79559
+ 	* gcc.target/i386/pr79559.c: New test.
+ 
+ 	2017-02-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/79512
+ 	* c-c++-common/gomp/pr79512.c: New test.
+ 
+ 	2017-02-10  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/79411
+ 	* gcc.c-torture/compile/pr79411.c: New test.
+ 
+ 	2017-02-02  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/79197
+ 	* gcc.target/powerpc/pr79197.c: New test.
+ 	* gcc.c-torture/compile/pr79197.c: New test.
+ 
+ 	2017-01-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/78341
+ 	* g++.dg/cpp0x/pr78341.C: New test.
+ 
+ 	PR middle-end/50199
+ 	* gcc.dg/lto/pr50199_0.c: New test.
+ 
+ 	2017-01-04  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/78949
+ 	* c-c++-common/Wunused-var-16.c: New test.
+ 
+ 	2016-12-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/78866
+ 	* gfortran.dg/gomp/map-1.f90: Add expected error.
+ 	* gfortran.dg/gomp/pr78866-1.f90: New test.
+ 	* gfortran.dg/gomp/pr78866-2.f90: New test.
+ 
+ 	PR c/77767
+ 	* gcc.c-torture/execute/pr77767.c: New test.
+ 
+ 	2016-12-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR ipa/77905
+ 	* g++.dg/ipa/pr77905.C: New test.
+ 
+ 	2016-12-14  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/78796
+ 	* gcc.dg/tls/pr78796.c: New test.
+ 
+ 	2016-12-02  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/78649
+ 	* g++.dg/cpp0x/pr78649.C: New test.
+ 
+ 	2016-11-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/78298
+ 	* gfortran.dg/gomp/pr78298.f90: New test.
+ 
+ 	2016-11-23  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/69183
+ 	* gfortran.dg/gomp/pr69183.f90: New test.
+ 
+ 	PR c++/77739
+ 	* g++.dg/cpp1y/pr77739.C: New test.
+ 
+ 	2016-11-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/78416
+ 	* gcc.dg/torture/pr78416.c: New test.
+ 
+ 	2016-11-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/67335
+ 	* g++.dg/vect/simd-clone-7.cc: New test.
+ 
+ 	2016-11-18  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77285
+ 	* g++.dg/tls/pr77285-1.C: New test.
+ 	* g++.dg/tls/pr77285-2.C: New test.
+ 
+ 	2016-11-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/78378
+ 	* gcc.c-torture/execute/pr78378.c: New test.
+ 
+ 	2016-11-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/78227
+ 	* gcc.target/i386/pr78227-1.c: New test.
+ 	* gcc.target/i386/pr78227-2.c: New test.
+ 
+ 	2016-10-31  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/78089
+ 	* c-c++-common/builtin-shuffle-1.c: New test.
+ 
+ 	2016-10-29  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/77919
+ 	* g++.dg/torture/pr77919-2.C: New test.
+ 
+ 	2016-10-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/77919
+ 	* g++.dg/torture/pr77919.C: New test.
+ 
+ 	2016-10-05  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/66343
+ 	* gcc.dg/pch/pr66343-1.c: New test.
+ 	* gcc.dg/pch/pr66343-1.hs: New file.
+ 	* gcc.dg/pch/pr66343-2.c: New test.
+ 	* gcc.dg/pch/pr66343-2.hs: New file.
+ 
+ 	2016-09-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77467
+ 	* g++.dg/cpp1y/constexpr-77467.C: New test.
+ 
+ 	2016-09-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77722
+ 	* g++.dg/ubsan/return-4.C: New test.
+ 	* g++.dg/ubsan/return-5.C: New test.
+ 	* g++.dg/ubsan/return-6.C: New test.
+ 
+ 	PR fortran/77666
+ 	* gfortran.dg/gomp/pr77666.f90: New test.
+ 
+ 	2016-09-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/77665
+ 	* gfortran.dg/gomp/pr77665.f90: New test.
+ 
+ 	2016-09-20  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77637
+ 	* g++.dg/cpp0x/gen-attrs-62.C: New test.
+ 
+ 	PR middle-end/77624
+ 	* c-c++-common/pr77624-1.c: New test.
+ 	* c-c++-common/pr77624-2.c: New test.
+ 
+ 	2016-09-19  Jakub Jelinek  <jakub@redhat.com>
+ 		    Jan Hubicka  <jh@suse.cz>
+ 
+ 	PR target/77587
+ 	* gcc.dg/pr77587.c: New test.
+ 	* gcc.dg/pr77587a.c: New file.
+ 
+ 	2016-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/77375
+ 	* g++.dg/cpp0x/mutable1.C: New test.
+ 
+ 	2016-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 		    Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	PR middle-end/77594
+ 	* gcc.target/i386/pr77594.c: New test.
+ 
+ 	2016-09-14  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/68260
+ 	* c-c++-common/tsan/pr68260.c: New test.
+ 
+ 	2016-09-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/77500
+ 	* gfortran.dg/gomp/pr77500.f90: New test.
+ 
+ 	PR fortran/77516
+ 	* gfortran.dg/gomp/pr77516.f90: New test.
+ 
+ 	2016-09-05  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/77396
+ 	* g++.dg/asan/pr77396-2.C: New test.
+ 
+ 	2016-09-02  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/77396
+ 	* g++.dg/asan/pr77396.C: New test.
+ 
+ 	2016-08-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR debug/77363
+ 	* g++.dg/debug/dwarf2/pr77363.C: New test.
+ 
+ 	PR middle-end/77377
+ 	* gcc.target/i386/pr77377.c: New test.
+ 
+ 	2016-08-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/71910
+ 	* g++.dg/gomp/pr71910.C: New test.
+ 
+ 	2016-08-15  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/72824
+ 	* gcc.c-torture/execute/ieee/pr72824-2.c: New test.
+ 
+ 	2016-08-12  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/67410
+ 	* gcc.dg/pr67410.c: New test.
+ 
+ 	2016-08-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/72868
+ 	* g++.dg/cpp1y/constexpr-switch4.C: New test.
+ 
+ 	PR c/72816
+ 	* gcc.dg/pr72816.c: Remove dg-error.
+ 
+ 	2016-08-09  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/72824
+ 	* gcc.c-torture/execute/ieee/pr72824.c: New test.
+ 
+ 	2016-08-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/72816
+ 	* gcc.dg/pr72816.c: New test.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-24  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR middle-end/79931
+ 	* g++.dg/ipa/pr79931.C: New test.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-11  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/80212
+ 	* g++.dg/ipa/pr80212.C: New test.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-11  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR sanitizer/70878
+ 	* gcc.dg/ubsan/pr70878.c: New test.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-06  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR sanitizer/80166
+ 	* gcc.dg/asan/pr80166.c: New test.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/80205
+ 	* g++.dg/ipa/pr80205.C: New test.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-28  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/80104
+ 	* gcc.dg/ipa/pr80104.c: New test.
+ 
+ 2017-05-19  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-05-18  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/80799
+ 	* g++.dg/other/i386-11.C: New test.
+ 
+ 2017-05-15  Richard Biener  <rguenther@suse.de>
+ 
+ 	Revert backport of
+ 	PR middle-end/80222
+ 	* g++.dg/pr80222.C: New testcase.
+ 
+ 2017-05-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2017-03-02  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR c/79756
+ 	* gcc.dg/vector-1.c: New testcase.
+ 
+ 	2017-02-28  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/79732
+ 	* gcc.dg/torture/pr79732.c: New testcase.
+ 
+ 	2017-02-22  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/79666
+ 	* gcc.dg/torture/pr79666.c: New testcase.
+ 
+ 2017-05-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2017-03-21  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/80122
+ 	* gcc.dg/torture/pr80122.c: New testcase.
+ 
+ 	2017-03-28  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/80222
+ 	* g++.dg/pr80222.C: New testcase.
+ 
+ 	2017-04-06  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/80334
+ 	* g++.dg/torture/pr80334.C: New testcase.
+ 
+ 	2017-04-27  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/80539
+ 	* gcc.dg/torture/pr80539.c: New testcase.
+ 
+ 2016-05-08  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	PR target/69868 + swap optimization backports
+ 	* gcc.target/powerpc/swaps-p8-20.c: New.
+ 	* gcc.target/powerpc/swaps-p8-23.c: New.
+ 	* gcc.target/powerpc/swaps-p8-24.c: New.
+ 
+ 2017-05-01  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/80392
+ 	* gfortran.dg/proc_ptr_comp_49.f90: New test case.
+ 
+ 2017-04-21  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/80361
+ 	* gfortran.dg/class_62.f90: New test case.
+ 
+ 2017-04-21  Christophe Lyon  <christophe.lyon@linaro.org>
+ 
+ 	Backport from mainline
+ 	2015-11-23  Kugan Vivekanandarajah  <kuganv@linaro.org>
+ 
+ 	PR target/68390
+ 	* gcc.c-torture/execute/pr68390.c: New test.
+ 
+ 2017-04-14  Dominique d'Humieres  <dominiq@lps.ens.fr>
+ 
+ 	Backport from trunk
+ 	2015-11-18  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/59910
+ 	PR fortran/80388
+ 	* gfortran.dg/pr59910.f90: New test.
+ 
+ 2017-04-11  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from GCC 6
+ 	2017-04-06  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	PR target/80082
+ 	* gcc.target/arm/atomic_loaddi_10.c: New testcase.
+ 	* gcc.target/arm/atomic_loaddi_11.c: Likewise.
+ 
+ 2017-04-11  Martin Jambor  <mjambor@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-30  Martin Jambor  <mjambor@suse.cz>
+ 
+ 	PR ipa/77333
+ 	* g++.dg/ipa/pr77333.C: New test.
+ 
+ 2017-04-11  Bin Cheng  <bin.cheng@arm.com>
+ 
+ 	PR tree-optimization/80345
+ 	* gcc.c-torture/compile/pr80345.c
+ 
+ 	Backport from mainline
+ 	2016-02-10  Bin Cheng  <bin.cheng@arm.com>
+ 
+ 	PR tree-optimization/68021
+ 	* gcc.dg/tree-ssa/pr68021.c: New test.
+ 
+ 2017-04-07  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-04-06  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/79733
+ 	* gcc.target/i386/pr79733.c: New test.
+ 
+ 2017-04-03  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-04-03  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	PR target/80246
+ 	* gcc.target/powerpc/dfp-builtin-1.c: Require hard_dfp, not
+ 	powerpc_vsx_ok.
+ 	(std, ld): Limit scan-assembler-times check to lp64.
+ 	(stwu, stw, lwz): Add scan-assembler-times check for ilp32.
+ 	* gcc.target/powerpc/dfp-builtin-2.c: Require hard_dfp, not
+ 	powerpc_vsx_ok.
+ 
+ 	PR target/80246
+ 	* gcc.target/powerpc/pr80246.c: Require hard_dfp.
+ 
+ 2017-03-30  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-03-30  Peter Bergner  <bergner@vnet.ibm.com>
+ 
+ 	PR target/80246
+ 	* gcc.target/powerpc/dfp-builtin-1.c: Remove unneeded dg-skip-if for
+ 	Darwin and SPE.
+ 	(dxex, dxexq): Update return type.
+ 	(diex, diexq): Update argument type.
+ 	* gcc.target/powerpc/pr80246.c: New test.
+ 
+ >>>>>>> .r248557
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-02-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR lto/79587
+ 	* gcc.dg/tree-prof/pr79587.c: New test.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR target/79906
+ 	* g++.dg/ext/mv8.C: Add power* targets.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-21  Martin Liska  <mliska@suse.cz>
+ 
+ 	* gcc.target/i386/pr65044.c: Add '.' in order to catch
+ 	apostrophes.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR middle-end/79753
+ 	* gcc.target/i386/mpx/pr79753.c: New test.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR target/79769
+ 	PR target/79770
+ 	* g++.dg/pr79769.C: New test.
+ 	* gcc.target/i386/mpx/pr79770.c: New test.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR middle-end/78339
+ 	* gcc.target/i386/mpx/pr78339.c: New test.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-06-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR sanitizer/71458
+ 	* gcc.target/i386/pr71458.c: New test.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-09  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/79631
+ 	* gcc.target/i386/mpx/pr79631.c: New test.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-09  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/79761
+ 	* g++.dg/pr79761.C: New test.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/79803
+ 	* gcc.dg/tree-ssa/pr79803.c: New test.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-03-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR rtl-optimization/79574
+ 	* gcc.dg/pr79574-2.c: New test.
+ 
+ 2017-03-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-02-17  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR rtl-optimization/79574
+ 	* gcc.dg/pr79574.c: New test.
+ 
+ 2017-03-21  Martin Sebor  <msebor@redhat.com>
+ 
+ 	PR c++/79548
+ 	* g++.dg/warn/Wunused-var-26.C: New test.
+ 
+ 2017-03-21  Pat Haugen  <pthaugen@us.ibm.com>
+ 
+ 	Backport from mainline:
+ 	2017-03-17  Pat Haugen  <pthaugen@us.ibm.com>
+ 
+ 	* gcc.target/powerpc/pr79951.c: New.
+ 
+ 2017-03-15  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/80019
+ 	* gcc.target/i386/pr80019.c: New test.
+ 
+ 2017-03-10  Michael Meissner  <meissner@linux.vnet.ibm.com>
+ 
+ 	Back port from trunk
+ 	2017-03-01  Michael Meissner  <meissner@linux.vnet.ibm.com>
+ 
+ 	PR target/79439
+ 	* gcc.target/powerpc/pr79439.c: New test.
+ 
+ 2017-03-02  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/79514
+ 	* gcc.target/i386/pr79514.c: New test.
+ 
+ 2017-03-01  Pat Haugen  <pthaugen@us.ibm.com>
+ 
+ 	Backport from mainline:
+ 	2017-03-01  Pat Haugen  <pthaugen@us.ibm.com>
+ 
+ 	* gcc.target/powerpc/pr79544.c: Add test for vec_vsrad and fix up
+ 	scan string.
+ 
+ 	2017-02-27  Pat Haugen  <pthaugen@us.ibm.com>
+ 
+ 	PR target/79544
+ 	* gcc.target/powerpc/pr79544.c: New.
+ 
+ 2017-02-28  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* gcc.target/sparc/20170228-1.c: New test.
+ 
+ 2017-02-24  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* gnat.dg/opt63.adb: New test.
+ 
+ 2017-02-22  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-02-17  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR target/79261
+ 	* gcc.target/powerpc/vec-xxpermdi.c: New file.
+ 
+ 2017-01-16  Carl Love  <cel@us.ibm.com>
+ 
+ 	Backport from mainline commit r245460 on 2017-02-14
+ 
+ 	PR 79545
+ 	* gcc.target/powerpc/vsx-builtin-3.c: Add missing test case for the
+ 	xvcvsxdsp and xvcvuxdsp instructions.
+ 
+ 2017-02-06  Carl Love  <cel@us.ibm.com>
+ 
+ 	* gcc.target/powerpc/builtins-3-p8.c:  Add new testfile for missing
+ 	vec_packs built-in tests.
+ 
+ 2017-02-03  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2017-01-27  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR target/65484
+ 	* g++.dg/vect/pr36648.cc: Modify to reflect that the loop is not
+ 	vectorized on POWER unless hardware misaligned loads are
+ 	available.
+ 
+ 2017-01-26  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-01-10  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/79034
+ 	* g++.dg/torture/pr79034.C: New testcase.
+ 
+ 	2016-11-07  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/78224
+ 	* g++.dg/torture/pr78224.C: New testcase.
+ 
+ 2017-01-26  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-09-27  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77745
+ 	* g++.dg/torture/pr77745.C: New testcase.
+ 
+ 	2016-09-29  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77768
+ 	* gcc.dg/torture/pr77768.c: New testcase.
+ 
+ 2017-01-24  Wilco Dijkstra  <wdijkstr@arm.com>
+ 
+ 	Backport from mainline
+ 	PR target/78041
+ 	* gcc.target/arm/pr78041.c: New test.
+ 
+ 2017-01-24  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-09-20  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77646
+ 	* gcc.dg/torture/pr77646.c: New testcase.
+ 
+ 	2016-11-05  David Edelsohn  <dje.gcc@gmail.com>
+ 		Richard Biener  <rguenther@suse.de>
+ 
+ 	PR bootstrap/78188
+ 	PR c++/71848
+ 	* g++.dg/ipa/pr78188.C: New test.	
+ 
+ 	2016-09-21  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77648
+ 	* gcc.dg/torture/pr77648-1.c: New testcase.
+ 	* gcc.dg/torture/pr77648-2.c: Likewise.
+ 
+ 2017-01-24  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-10-06  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77855
+ 	* gcc.dg/torture/pr77855.c: New testcase.
+ 
+ 	2016-09-01  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/77436
+ 	* gcc.dg/torture/pr77436.c: New testcase.
+ 
+ 	2016-09-06  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR c/77450
+ 	* gcc.dg/pr77450.c: New testcase.
+ 
+ 	2016-09-19  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/77605
+ 	* gcc.dg/torture/pr77605.c: New testcase.
+ 
+ 	2016-11-02  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/78185
+ 	* gcc.dg/pr78185.c: New testcase.
+ 
+ 	2016-11-16  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/78333
+ 	* gcc.dg/pr78333.c: New testcase.
+ 
+ 2017-01-23  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-01-23  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	* gcc.dg/lto/pr69188_0.c: Require profiling support for testcase.
+ 
+ 2017-01-23  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR lto/69188
+ 	* gcc.dg/lto/pr69188_0.c: New test.
+ 	* gcc.dg/lto/pr69188_1.c: New test.
+ 
+ 2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-01-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/79043
+ 	* gcc.c-torture/execute/pr79043.c: New test.
+ 
+ 2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2015-12-01  Jan Hubicka  <hubicka@ucw.cz>
+ 
+ 	* gcc.c-torture/execute/alias-1.c: New testcase.
+ 
+ 2017-01-20  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-01-17  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR ipa/71207
+ 	* g++.dg/ipa/pr71207.C: New test.
+ 
+ 2017-01-17 Thomas Preud'homme <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-07 Thomas Preud'homme <thomas.preudhomme@arm.com>
+ 
+ 	PR rtl-optimization/78617
+ 	* gcc.c-torture/execute/pr78617.c: New test.
+ 
+ 2017-01-12  Nathan Sidwell  <nathan@acm.org>
+ 
+ 	PR c++/77812
+ 	* g++.dg/pr77812.C: New.
+ 
+ 2017-01-11  Andre Vieira <andre.simoesdiasvieira@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-20  Andre Vieira  <andre.simoesdiasvieira@arm.com>
+ 
+ 	* gcc.target/arm/pr78255-2.c: Fix to work for targets
+ 	that do not optimize for tailcall.
+ 
+ 2017-01-11  Andre Vieira <andre.simoesdiasvieira@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-09  Andre Vieira <andre.simoesdiasvieira@arm.com>
+ 
+ 	PR rtl-optimization/78255
+ 	* gcc.target/aarch64/pr78255.c: New.
+ 	* gcc.target/arm/pr78255-1.c: New.
+ 	* gcc.target/arm/pr78255-2.c: New.
+ 
+ 2017-01-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-12-22  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/78886
+ 	* gcc.dg/tree-ssa/pr78886.c: New test.
+ 
+ 2017-01-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-12-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/78428
+ 	* gcc.dg/tree-ssa/pr78428.c: New test.
+ 
+ 2016-12-22  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/78239
+ 	* gfortran.dg/fimplicit_none_1.f90:  New test.
+ 	* gfortran.dg/fimplicit_none_2.f90:  New test.
+ 
+ 2016-12-14  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/78731
+ 	* gcc.dg/torture/pr78731.c: New testcase.
+ 
+ 2016-12-14  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-11-25  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	PR tree-optimization/77673
+ 	* gcc.dg/pr77673.c: New test.
+ 
+ 2016-12-13  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-11-17  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	PR target/77933
+ 	* gcc.target/arm/pr77933-1.c: New test.
+ 	* gcc.target/arm/pr77933-2.c: Likewise.
+ 
+ 2016-12-12  Bernd Schmidt  <bschmidt@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-11-07  Bernd Schmidt  <bschmidt@redhat.com>
+ 
+ 	PR rtl-optimization/77309
+ 	* gcc.dg/torture/pr77309.c: New test.
+ 
+ 2016-12-08  Nathan Sidwell  <nathan@acm.org>
+ 
+ 	PR c++/78551
+ 	* g++.dg/cpp1y/pr78551.C: New.
+ 
+ 2016-12-07  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-11-16  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	* gcc.target/arm/empty_fiq_handler.c: New test.
+ 
+ 	Backport from mainline
+ 	2016-11-21  Thomas Preud'homme  <thomas.preudhomme@arm.com>
+ 
+ 	* gcc.target/arm/empty_fiq_handler.c: Skip if -mthumb is passed in and
+ 	target is Thumb-only.
+ 
+ 2016-12-04  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/78443
+ 	* gfortran.dg/typebound_proc_35.f90: New test case.
+ 
+ 2016-12-02  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-10-21  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	PR rtl-optimization/78038
+ 	* gcc.target/aarch64/pr78038.c: New test.
+ 
+ 2016-12-02  Andreas Krebbel  <krebbel@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-12-02  Andreas Krebbel  <krebbel@linux.vnet.ibm.com>
+ 
+ 	* gcc.target/s390/vector/vec-scalar-cmp-1.c: Fix and harden the
+ 	pattern checks.
+ 	* gcc.target/s390/zvector/vec-cmp-1.c: New test.
+ 
+ 2016-12-01  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/78279
+ 	* gfortran.dg/pr78279.f90: New test.
+ 
+ 2016-11-24  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/78500
+ 	* gfortran.dg/class_result_4.f90: New test.
+ 
+ 2016-11-23  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/78297
+ 	* gfortran.dg/pr78297.f90: New test.
+ 
+ 2016-11-23  Janus Weil  <janus@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/66227
+ 	* gfortran.dg/extends_type_of_3.f90: Fix and extend the test case.
+ 
+ 2016-11-20  Harald Anlauf  <anlauf@gmx.de>
+ 
+ 	PR fortran/69741
+ 	* gfortran.dg/forall_18.f90: New testcase.
+ 
+ 2016-11-11  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/78310
+ 	* gcc.target/i386/pr78310.c: New test.
+ 
+ 2016-11-09  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/78262
+ 	* gcc.target/i386/pr78262.c: New test.
+ 
+ 2016-11-06  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/69544
+ 	PR fortran/78178
+ 	* gfortran.dg/where_5.f90:  New test.
+ 	* gfortran.dg/where_6.f90:  New test.
+ 
+ 2016-11-05  Martin Sebor  <msebor@redhat.com>
+ 
+ 	Backport from trunk.
+ 	PR c/71115
+ 	* gcc.dg/init-excess-2.c: New test.
+ 	* gcc.dg/Woverride-init-1.c: Adjust.
+ 	* gcc.dg/Woverride-init-2.c: Same.
+ 
+ 2016-11-03  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2016-08-12  Martin Liska  <mliska@suse.cz>
+ 
+ 	* g++.dg/gcov/gcov-16.C: New test.
+ 	* lib/gcov.exp: Support new argument for run-gcov function.
+ 
+ 2016-11-02  Will Schmidt  <will_schmidt@vnet.ibm.com>
+ 
+ 	Backport from trunk
+ 	2016-10-26  Will Schmidt <will_schmidt@vnet.ibm.com>
+ 
+ 	PR middle-end/72747
+ 	* c-c++-common/pr72747-1.c: New test.
+ 	* c-c++-common/pr72747-2.c: Likewise.
+ 
+ 2016-11-02  Rainer Orth  <ro@CeBiTec.Uni-Bielefeld.DE>
+ 
+ 	* lib/target-supports.exp (check_gc_sections_available): Use
+ 	-print-prog-name=ld to determine linker used.
+ 
+ 2016-10-31  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/71902
+ 	* gfortran.dg/dependency_47.f90:  New test.
+ 	* gfortran.dg/dependency_49.f90:  New test.
+ 
+ 2016-10-31  Jerry DeLisle  <jvdelisle@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/78123
+ 	* gfortran.dg/fmt_t_9.f: New test.
+ 
+ 2016-10-24  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/78021
+ 	* gfortran.dg/string_length_3.f90:  New test.
+ 
+ 2016-10-24  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/71895
+ 	* gfortran.dg/pr71895.f90: New test.
+ 
+ 2016-10-24  Paul Thomas  <pault@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/61420
+ 	PR fortran/78013
+ 	* gfortran.dg/proc_ptr_49.f90: New test.
+ 
+ 2016-10-23  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-10-17  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/77916
+ 	* gcc.dg/torture/pr77916.c: New.
+ 
+ 2016-10-19  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/77991
+ 	* gcc.target/i386/pr77991.c: New test.
+ 
+ 2016-10-17  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/77978
+ 	* gfortran.dg/pr77978_1.f90: New test.
+ 	* gfortran.dg/pr77978_2.f90: Ditto.
+ 	* gfortran.dg/pr77978_3.f90: Ditto.
+ 
+ 2016-10-17  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-10-13  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR tree-optimization/77937
+ 	* gcc.dg/torture/pr77937-1.c: New.
+ 	* gcc.dg/torture/pr77937-2.c: New.
+ 
+ 2016-10-17  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backported from mainline
+ 	2016-10-13  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR tree-optimization/77943
+ 	* g++.dg/tree-ssa/pr77943.C: New test.
+ 
+ 2016-10-15  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* gcc.target/sparc/bmaskbshuf.c: Rename to...
+ 	* gcc.target/sparc/bmaskbshuf-1.c: ...this.
+ 	* gcc.target/sparc/bmaskbshuf-2.c: New test.
+ 
+ 2016-10-13  Andrew Senkevich  <andrew.senkevich@intel.com>
+ 
+ 	Backport from trunk
+ 	* gcc.target/i386/pcommit-1.c: Deleted test.
+ 	* gcc.target/i386/sse-12.c: Deleted -pcommit option.
+ 	* gcc.target/i386/sse-13.c: Ditto.
+ 	* gcc.target/i386/sse-14.c: Ditto.
+ 	* gcc.target/i386/sse-22.c: Ditto.
+ 	* gcc.target/i386/sse-23.c: Ditto.
+ 	* g++.dg/other/i386-2.C: Ditto.
+ 	* g++.dg/other/i386-3.C: Ditto.
+ 
+ 2016-10-10  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	* gnat.dg/biased_subtype.adb: New test.
+ 
+ 2016-10-05  Steven G. Kargl  <kargls@gcc.gnu.org>
+ 
+ 	PR fortran/58991
+ 	PR fortran/58992
+ 	* gfortran.dg/associate_22.f90: New test.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/77391
+ 	* gfortran.dg/pr77391.f90: New test.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/77380
+ 	* gfortran.dg/pr77380.f90: New test.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/61318
+ 	* gfortran.dg/pr61318.f90: New test.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/71859
+ 	* check.c(numeric_check): Prevent ICE.  Issue error for invalid
+ 	subroutine as an actual argument when numeric argument is expected.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/69867
+ 	* gfortran.dg/pr69867.f90: New test.
+ 
+ 	PR fortran/69962
+ 	* gfortran.dg/pr69962.f90: New test.
+ 
+ 2016-09-30  Steven g. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/77351
+ 	* gfortran.dg/pr77351.f90: New test.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/68566
+ 	* gfortran.dg/pr68566.f90: new test.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/71799
+ 	* gfortran.dg/pr71799.f90: New test.
+ 
+ 2016-09-30  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/70006
+ 	* gfortran.dg/pr70006.f90: New test.
+ 
+ 2016-09-29  Jerry DeLisle  <jvdelisle@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR libgfortran/77707
+ 	* gfortran.dg/inquire_17.f90: New test.
+ 
+ 2016-09-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 
+ 	PR fortran/77420
+ 	* gfortran.dg/pr77420_1.f90: New test.
+ 	* gfortran.dg/pr77420_2.f90: Ditto.
+ 	* gfortran.dg/pr77420_3.f90: New test. Requires ...
+ 	* gfortran.dg/pr77420_4.f90: this file.
+ 
+ 	PR fortran/77460
+ 	* gfortran.dg/pr77460.f90: New test.
+ 
+ 2016-09-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/77506
+ 	* gfortran.dg/pr77506.f90: New test.
+ 
+ 	PR fortran/77507
+ 	* gfortran.dg/pr77507.f90: New test.
+ 
+ 2016-09-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/71067
+ 	* gfortran.dg/pr71067_1.f90: New test.
+ 	* gfortran.dg/pr71067_2.f90: Ditto.
+ 
+ 	PR fortran/77260
+ 	* gfortran.dg/pr77260_1.f90: New test.
+ 	* gfortran.dg/pr77260_2.f90: Ditto.
+ 
+ 2016-09-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 	    Louis Krupp      <lkrupp@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/69514
+ 	* gfortran.dg/pr69514_1.f90: New test.
+ 	* gfortran.dg/pr69514_2.f90: New test.
+ 
+ 2016-09-28  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	backport from trunk
+ 	PR fortran/71730
+ 	* gfortran.dg/pr71730.f90: New test.
+ 	* gfortran.dg/bounds_check_strlen_2.f90: Fix invalid code.
+ 	* gfortran.dg/array_constructor_27.f03: Update dg-error message.
+ 	* gfortran.dg/array_constructor_26.f03: Ditto.
+ 
+ 	PR fortran/77612
+ 	* gfortran.dg/pr77612.f90: New test.
+ 
+ 2016-09-28  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	backport from trunk
+ 	PR fortran/77694
+ 	* gfortran.dg/pr77694.f90: New test.
+ 
+ 2016-09-28  Bernd Edlinger  <bernd.edlinger@hotmail.de>
+ 
+ 	backport from mainline
+ 	2016-09-23  Bernd Edlinger  <bernd.edlinger@hotmail.de>
+ 		    Tom de Vries  <tom@codesourcery.com>
+ 
+ 	PR testsuite/77411
+ 	* c-c++-common/ubsan/object-size-9.c: Call __builtin_exit in C++.
+ 
+ 2016-09-27  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/77478
+ 	* gcc.dg/torture/pr77478.c: New testcase.
+ 
+ 2016-09-27  Senthil Kumar Selvaraj  <senthil_kumar.selvaraj@atmel.com>
+ 
+ 	Backport from trunk r227496
+ 
+ 	PR target/65210
+ 	* gcc.target/avr/pr65210.c: New test.
+ 
+ 2016-09-21  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* gcc.c-torture/unsorted/dump-noaddr.x: Remove debug statements.
+ 
+ 2016-09-21  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2016-09-21 trunk r240306.
+ 
+ 	PR target/77326
+ 	* gcc.target/avr/torture/pr77326.c: New test.
+ 
+ 2016-09-07  Dominique d'Humieres  <dominiq@lps.ens.fr>
+ 
+ 	PR debug/57519
+ 	* g++.dg/debug/dwarf2/imported-decl-2.C: Likewise.
+ 
+ 2016-09-06  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* gfortran.dg/c_by_val_1.f: Correct the call to c_to_c and c_to_c8.
+ 
+ 2016-08-29  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/77403
+ 	* gcc.target/i386/pr77403.c: New test.
+ 
+ 2016-08-29  Tom de Vries  <tom@codesourcery.com>
+ 
+ 	backport from trunk:
+ 	2015-09-17  Bernd Edlinger  <bernd.edlinger@hotmail.de>
+ 
+ 	PR sanitizer/64078
+ 	* c-c++-common/ubsan/object-size-9.c (s): Add alignment attribute.
+ 	(f2, f3): Make the function static.
+ 	* c-c++-common/ubsan/object-size-10.c (a, b): Add alignment attribute.
+ 
+ 2016-08-29  Tom de Vries  <tom@codesourcery.com>
+ 
+ 	backport from trunk:
+ 	PR testsuite/65940
+ 	2016-02-01  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* g++.dg/other/anon5.C (dg-opetions): Use -gdwarf-2 instead of -g.
+ 
+ 2016-08-28  Tom de Vries  <tom@codesourcery.com>
+ 
+ 	PR testsuite/77034
+ 	Backported from mainline
+ 	2016-07-25  Jason Merrill  <jason@redhat.com>
+ 
+ 	* g++.dg/init/elide5.C (operator new): Use decltype(sizeof(1)) instead
+ 	of unsigned long.
+ 
+ 2016-08-26  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-04-20  Andrew Pinski  <apinski@cavium.com>
+ 	            Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	PR target/64971
+ 	* gcc.c-torture/compile/pr37433-1.c: New testcase.
+ 
+ 2016-08-25  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	Backport from mainline
+ 	2016-08-11  Bill Schmidt  <wschmidt@linux.vnet.ibm.com>
+ 
+ 	PR target/72863
+ 	* gcc.target/powerpc/pr72863.c: New test.
+ 
+ 2016-08-25  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	Backport from mainline
+ 	2016-07-12  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
+ 
+ 	PR middle-end/71700
+ 	* gcc.c-torture/execute/pr71700.c: New test.
+ 
+ 2016-08-22  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-08-14  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/76342
+ 	* gcc.target/i386/pr76342.c: New test.
+ 
+ 2016-08-13  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	* gfortran.dg/realloc_on_assign_26.f90:  New test case.
+ 
+ 2016-08-12  Bernd Edlinger  <bernd.edlinger@hotmail.de>
+ 
+ 	Backport from mainline
+ 	2016-08-11  Bernd Edlinger  <bernd.edlinger@hotmail.de>
+ 
+ 	PR tree-optimization/71083
+ 	* gcc.c-torture/execute/pr71083.c: New test.
+ 	* gnat.dg/loop_optimization23.adb: New test.
+ 	* gnat.dg/loop_optimization23_pkg.ads: New test.
+ 	* gnat.dg/loop_optimization23_pkg.adb: New test.
+ 
+ 2016-08-11  Jerry DeLisle  <jvdelisle@gcc.gnu.org>
+ 
+ 	Backport from trunk.
+ 	PR fortran/71123
+ 	* gfortran.dg/namelist_90.f: New test.
+ 
+ 2016-08-11  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/72698
+ 	* gfortran.dg/allocate_with_source_20.f03: New test.
+ 
+ 2016-08-09  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/71795
+ 	* gfortran.dg/array_constructor_50.f90:  New test.
+ 
+ 2016-08-09  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	PR fortran/69742
+ 	* gfortran.dg/associate_21.f90:  New test.
+ 
+ 2016-08-08  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	PR fortran/60526
+ 	* gfortran.dg/type_decl_4.f90:  New test.
+ 
+ 2016-08-08  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/70524
+ 	* gfortran.dg/dependency_48.f90: New test.
+ 
+ 2016-08-08  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	PR fortran/70040
+ 	Backport from trunk
+ 	* gfortran.dg/pr70040.f90:  New testcase.
+ 
+ 2016-08-05  Nathan Sidwell  <nathan@acm.org>
+ 
+ 	PR c++/68724
+ 	* g++.dg/cpp0x/pr68724.C: New.
+ 
+ 2016-07-29  Paul Thomas  <pault@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71883
+ 	* gfortran.dg/pr71883.f90 : New test.
+ 
+ 2016-07-22  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71807
+ 	* gfortran.dg/null_9.f90: New test.
+ 
+ 2016-07-22  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/70842
+ 	* gfortran.dg/select_type_35.f03: New test.
+ 
+ 2016-07-20  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/71909
+ 	* g++.dg/parse/pr71909.C: New test.
+ 	* g++.dg/tm/pr71909.C: New test.
+ 
+ 2016-07-20  Martin Jambor  <mjambor@suse.cz>
+ 
+ 	PR fortran/71688
+ 	* gfortran.dg/pr71688.f90: New test.
+ 
+ 2016-07-19  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71874
+ 	* g++.dg/torture/pr71874.C: New test.
+ 
+ 	Backported from mainline
+ 	2016-07-18  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/71871
+ 	* g++.dg/ext/vector31.C: New test.
+ 
+ 	2016-07-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71758
+ 	* c-c++-common/gomp/pr71758.c: New test.
+ 	* gfortran.dg/gomp/pr71758.f90: New test.
+ 
+ 2016-07-15  Jerry DeLisle  <jvdelisle@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71764
+ 	* gfortran.dg/pr71764.f90: New test.
+ 
+ 2016-07-13  Andre Vehreschild  <vehre@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71623
+ 	* gfortran.dg/deferred_character_18.f90: New test.
+ 
+ 2016-07-12  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	Backport from mainline
+ 	2016-07-06  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	PR target/70098
+ 	PR target/71763
+ 	* gcc.target/powerpc/pr71763.c: New file.
+ 
+ 2016-07-11  Thomas Koenig  <tkoenig@gcc.gnu.org>
+ 
+ 	Backport from trunk:
+ 	PR fortran/71783
+ 	* gfortran.dg/dependency_46.f90:  New test.
+ 
+ 2016-07-08  Cesar Philippidis  <cesar@codesourcery.com>
+ 
+ 	Backport from trunk:
+ 	2016-07-08  Cesar Philippidis  <cesar@codesourcery.com>
+ 
+ 	* gfortran.dg/goacc/pr71704.f90: New test.
+ 
+ 2016-07-08  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backported from mainline
+ 	2016-07-08  Martin Liska  <mliska@suse.cz>
+ 
+ 	* gcc.dg/torture/pr71606.c: New test.
+ 
+ 2016-07-07  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	PR target/69019
+ 	* gcc.target/powerpc/ti_math1.c: Allow addze as well as adde.
+ 
+ 2016-07-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-03-02  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/68062
+ 	* c-c++-common/vector-compare-4.c: Add -Wno-psabi to dg-options.
+ 
+ 	2016-02-02  Segher Boessenkool  <segher@kernel.crashing.org>
+ 
+ 	* c-c++-common/vector-compare-4.c: Prune "non-standard ABI extension"
+ 	warning.
+ 
+ 	2016-06-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/71704
+ 	* gfortran.dg/gomp/pr71704.f90: New test.
+ 
+ 	PR fortran/71705
+ 	* gfortran.dg/gomp/pr71705.f90: New test.
+ 
+ 	2016-06-28  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71626
+ 	* gcc.c-torture/execute/pr71626-1.c: New test.
+ 	* gcc.c-torture/execute/pr71626-2.c: New test.
+ 
+ 	2016-06-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR tree-optimization/71588
+ 	* gcc.dg/pr71558.c: New test.
+ 
+ 	2016-06-20  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71581
+ 	* gcc.dg/pr71581.c: New test.
+ 
+ 	2016-06-14  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/71528
+ 	* g++.dg/opt/pr71528.C: New test.
+ 
+ 	PR c++/71516
+ 	* g++.dg/init/pr71516.C: New test.
+ 
+ 	2016-06-10  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71494
+ 	* gcc.c-torture/execute/pr71494.c: New test.
+ 
+ 	2016-06-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/71498
+ 	* c-c++-common/ubsan/bounds-13.c: New test.
+ 
+ 	2016-04-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/70641
+ 	* g++.dg/opt/pr70641.C: New test.
+ 
+ 	PR middle-end/70633
+ 	* gcc.c-torture/compile/pr70633.c: New test.
+ 
+ 	PR debug/70628
+ 	* gcc.dg/torture/pr70628.c: New test.
+ 
+ 	2016-04-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR rtl-optimization/70574
+ 	* gcc.target/i386/avx2-pr70574.c: New test.
+ 
+ 	2016-04-05  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/70336
+ 	* c-c++-common/pr70336.c: New test.
+ 	* gcc.dg/torture/builtin-isinf_sign-1.c (foo): Guard tests
+ 	no longer optimized away at -O0 with #ifndef __OPTIMIZE__.
+ 
+ 2016-07-07  Richard Biener  <rguenther@suse.de>
+ 
+ 	Backport from mainline
+ 	2016-06-07  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR middle-end/71423
+ 	* gcc.dg/torture/pr71423.c: New testcase.
+ 
+ 	2016-06-08  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/71452
+ 	* gcc.dg/torture/pr71452.c: New testcase.
+ 
+ 	2016-06-14  Richard Biener  <rguenther@suse.de>
+ 
+ 	PR tree-optimization/71522
+ 	* gcc.dg/torture/pr71522.c: New testcase.
+ 
+ 2016-06-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR middle-end/71693
+ 	* gcc.c-torture/compile/pr71693.c: New test.
+ 
+ 2016-06-27  Paul Thomas  <pault@gcc.gnu.org>
+ 
+ 	PR fortran/70673
+ 	* gfortran.dg/pr70673.f90: New test.
+ 
+ 2016-06-20  Georg-Johann Lay  <avr@gjlay.de>
+ 	    Pitchumani Sivanupandi  <pitchumani.s@atmel.com>
+ 
+ 	Backport from 2016-06-20 trunk r237589, r236558.
+ 
+ 	PR target/71103
+ 	* gcc.target/avr/pr71103.c: New test.
+ 	* gcc.target/avr/torture/pr71103-2.c: New test.
+ 
+ 2016-06-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR target/71554
+ 	* gcc.c-torture/execute/pr71554.c: New test.
+ 
+ 2016-06-12  Dominique d'Humieres  <dominiq@lps.ens.fr>
+ 
+ 	PR target/60751
+ 	* gfortran.dg/comma_IO_extension_1.f90: New test.
+ 	* gfortran.dg/comma_IO_extension_2.f90: Likewise.
+ 	* gfortran.dg/array_constructor_49.f90: Remove extra comma in WRITE
+ 	statement.
+ 	* gfortran.dg/graphite/pr38083.f90: Likewise.
+ 	* gfortran.dg/guality/pr41558.f90: Likewise.
+ 	* gfortran.dg/integer_exponentiation_6.F90: Likewise and add
+ 	missing format.
+ 
+ 2016-06-08  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/71442
+ 	* g++.dg/cpp0x/Wunused-variable-1.C: New test.
+ 
+ 2016-06-07  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	PR target/71389
+ 	* g++.dg/pr71389.C: New test.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
***************
*** 31,37 ****
  	* gcc.dg/pr69634.c: New.
  
  	2016-03-23  Patrick Palka  <ppalka@gcc.gnu.org>
!  
  	PR c++/70347
  	* g++.dg/cpp1y/nsdmi-union1.C: New test.
  
--- 2044,2050 ----
  	* gcc.dg/pr69634.c: New.
  
  	2016-03-23  Patrick Palka  <ppalka@gcc.gnu.org>
! 
  	PR c++/70347
  	* g++.dg/cpp1y/nsdmi-union1.C: New test.
  
***************
*** 42,48 ****
  
  	2016-03-24  Richard Henderson  <rth@redhat.com>
  
!         PR middle-end/69845
  	* gcc.dg/tree-ssa/pr69845-1.c: New test.
  	* gcc.dg/tree-ssa/pr69845-2.c: New test.
  
--- 2055,2061 ----
  
  	2016-03-24  Richard Henderson  <rth@redhat.com>
  
! 	PR middle-end/69845
  	* gcc.dg/tree-ssa/pr69845-1.c: New test.
  	* gcc.dg/tree-ssa/pr69845-2.c: New test.
  
***************
*** 105,112 ****
  	PR middle-end/67278
  	* gcc.dg/simd-7.c: Add -w -Wno-psabi to dg-options.
  
!  	PR target/67278
!  	* gcc.dg/simd-8.c: Add -w -Wno-psabi to dg-options.
  
  2016-05-20  Richard Biener  <rguenther@suse.de>
  
--- 2118,2125 ----
  	PR middle-end/67278
  	* gcc.dg/simd-7.c: Add -w -Wno-psabi to dg-options.
  
! 	PR target/67278
! 	* gcc.dg/simd-8.c: Add -w -Wno-psabi to dg-options.
  
  2016-05-20  Richard Biener  <rguenther@suse.de>
  
***************
*** 130,142 ****
  	* gcc.dg/torture/pr70941.c: New testcase.
  
  	2016-05-06  Jakub Jelinek  <jakub@redhat.com>
!  
  	PR middle-end/70941
  	* gcc.dg/torture/pr70941.c (abort): Remove prototype.
  	(a, b, c, d): Change type from char to signed char.
  	(main): Compare against (signed char) -1634678893 instead of
  	hardcoded -109.  Use __builtin_abort instead of abort.
!  
  	2016-05-06  Richard Biener  <rguenther@suse.de>
  
  	PR middle-end/70931
--- 2143,2155 ----
  	* gcc.dg/torture/pr70941.c: New testcase.
  
  	2016-05-06  Jakub Jelinek  <jakub@redhat.com>
! 
  	PR middle-end/70941
  	* gcc.dg/torture/pr70941.c (abort): Remove prototype.
  	(a, b, c, d): Change type from char to signed char.
  	(main): Compare against (signed char) -1634678893 instead of
  	hardcoded -109.  Use __builtin_abort instead of abort.
! 
  	2016-05-06  Richard Biener  <rguenther@suse.de>
  
  	PR middle-end/70931
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/Wunused-var-16.c gcc-5.5.0/gcc/testsuite/c-c++-common/Wunused-var-16.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/Wunused-var-16.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/Wunused-var-16.c	Tue May 30 07:53:35 2017
***************
*** 0 ****
--- 1,15 ----
+ /* PR c++/78949 */
+ /* { dg-do compile } */
+ /* { dg-options "-Wunused" } */
+ 
+ typedef unsigned char V __attribute__((vector_size(16)));
+ V v;
+ 
+ void
+ foo ()
+ {
+   V y = {};
+   V x = {};	// { dg-bogus "set but not used" }
+   y &= ~x;
+   v = y;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/asan/pr79944.c gcc-5.5.0/gcc/testsuite/c-c++-common/asan/pr79944.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/asan/pr79944.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/asan/pr79944.c	Tue May 30 08:13:33 2017
***************
*** 0 ****
--- 1,18 ----
+ /* PR sanitizer/79944 */
+ /* { dg-do run } */
+ 
+ struct S { int i; char p[1024]; };
+ 
+ int
+ main ()
+ {
+   struct S *p = (struct S *) __builtin_malloc (__builtin_offsetof (struct S, p) + 64);
+   p->i = 5;
+   asm volatile ("" : "+r" (p) : : "memory");
+   __atomic_fetch_add ((int *) p, 5, __ATOMIC_RELAXED);
+   asm volatile ("" : "+r" (p) : : "memory");
+   if (p->i != 10)
+     __builtin_abort ();
+   __builtin_free (p);
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/builtin-shuffle-1.c gcc-5.5.0/gcc/testsuite/c-c++-common/builtin-shuffle-1.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/builtin-shuffle-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/builtin-shuffle-1.c	Tue May 30 07:37:39 2017
***************
*** 0 ****
--- 1,22 ----
+ /* PR c++/78089 */
+ /* { dg-do run } */
+ 
+ typedef int V __attribute__((vector_size (16)));
+ V a, b, c;
+ 
+ int
+ foo ()
+ {
+   return __builtin_shuffle (a, b, c)[3];
+ }
+ 
+ int
+ main ()
+ {
+   a = (V) { 1, 2, 3, 4 };
+   b = (V) { 5, 6, 7, 8 };
+   c = (V) { 7, 2, 5, 6 };
+   if (foo () != 7)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/gomp/pr71758.c gcc-5.5.0/gcc/testsuite/c-c++-common/gomp/pr71758.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/gomp/pr71758.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/gomp/pr71758.c	Tue Jul 19 09:02:11 2016
***************
*** 0 ****
--- 1,10 ----
+ /* PR middle-end/71758 */
+ 
+ void
+ foo (int *p)
+ {
+   long long i = 0;
+   #pragma omp target device (i)
+   ;
+   #pragma omp target update device (i) to (p[0])
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/gomp/pr79512.c gcc-5.5.0/gcc/testsuite/c-c++-common/gomp/pr79512.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/gomp/pr79512.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/gomp/pr79512.c	Tue May 30 07:58:55 2017
***************
*** 0 ****
--- 1,14 ----
+ /* PR c++/79512 */
+ /* { dg-options "-fopenmp-simd" } */
+ 
+ void
+ foo (void)
+ {
+   #pragma omp target
+   #pragma omp teams
+   {
+     int i;
+     for (i = 0; i < 10; i++)
+       ;
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/gomp/pr81006.c gcc-5.5.0/gcc/testsuite/c-c++-common/gomp/pr81006.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/gomp/pr81006.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/gomp/pr81006.c	Thu Jun  8 19:23:34 2017
***************
*** 0 ****
--- 1,10 ----
+ /* PR c/81006 */
+ /* { dg-do compile } */
+ 
+ int a[] = {};
+ 
+ void foo()
+ {
+   #pragma omp task depend(out: a[:])	/* { dg-error "zero length array section in .depend. clause" "" { xfail *-*-* } } */
+     {}
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/pr70336.c gcc-5.5.0/gcc/testsuite/c-c++-common/pr70336.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/pr70336.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/pr70336.c	Thu Jul  7 12:33:10 2016
***************
*** 0 ****
--- 1,37 ----
+ /* PR c++/70336 */
+ /* { dg-do compile } */
+ /* { dg-options "-Wconversion" } */
+ 
+ void
+ f1 (unsigned char * x, int y, int z)
+ {
+   x[z / 8] |= (unsigned char) (0x80 >> y);	/* { dg-bogus "may alter its value" } */
+ }
+ 
+ unsigned char
+ f2 (unsigned char x, int y)
+ {
+   x = x | (unsigned char) (0x80 >> y);		/* { dg-bogus "may alter its value" } */
+   return x;
+ }
+ 
+ unsigned char
+ f3 (unsigned char x, int y)
+ {
+   x = x | (unsigned char) (y & 255);		/* { dg-bogus "may alter its value" } */
+   return x;
+ }
+ 
+ unsigned char
+ f4 (unsigned char x, unsigned char y)
+ {
+   x = x | (unsigned char) (y & 255);		/* { dg-bogus "may alter its value" } */
+   return x;
+ }
+ 
+ unsigned char
+ f5 (unsigned char x, int y)
+ {
+   x = (unsigned char) (y & 255);		/* { dg-bogus "may alter its value" } */
+   return x;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/pr72747-1.c gcc-5.5.0/gcc/testsuite/c-c++-common/pr72747-1.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/pr72747-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/pr72747-1.c	Wed Nov  2 14:13:07 2016
***************
*** 0 ****
--- 1,16 ----
+ /* { dg-do compile } */
+ /* { dg-require-effective-target powerpc_altivec_ok } */
+ /* { dg-options "-maltivec -fdump-tree-gimple" } */
+ 
+ /* PR 72747: Test that cascaded definition is happening for constant vectors. */
+ 
+ #include <altivec.h>
+ 
+ int main (int argc, char *argv[])
+ {
+ 	__vector int v1,v2;
+ 	v1 = v2 = vec_splats ((int) 42);
+ 	return 0;
+ }
+ /* { dg-final { scan-tree-dump-times " v2 = { 42, 42, 42, 42 }" 1 "gimple" } } */
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/pr72747-2.c gcc-5.5.0/gcc/testsuite/c-c++-common/pr72747-2.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/pr72747-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/pr72747-2.c	Wed Nov  2 14:13:07 2016
***************
*** 0 ****
--- 1,18 ----
+ /* { dg-do compile } */
+ /* { dg-require-effective-target powerpc_altivec_ok } */
+ /* { dg-options "-c -maltivec -fdump-tree-gimple" } */
+ 
+ /* PR 72747: test that cascaded definition is happening for non constants. */
+ 
+ void foo ()
+ {
+   extern int i;
+   __vector int v,w;
+     v = w = (vector int) { i };
+ }
+ 
+ int main (int argc, char *argv[])
+ {
+   return 0;
+ }
+ /* { dg-final { scan-tree-dump-times " w = " 1 "gimple" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/pr77624-1.c gcc-5.5.0/gcc/testsuite/c-c++-common/pr77624-1.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/pr77624-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/pr77624-1.c	Tue May 30 07:26:43 2017
***************
*** 0 ****
--- 1,14 ----
+ /* PR middle-end/77624 */
+ /* { dg-do compile } */
+ 
+ int
+ foo (int a)
+ {
+   return __atomic_is_lock_free (2, a);		/* { dg-warning "pointer from integer" "" { target c } } */
+ }						/* { dg-error "invalid conversion" "" { target c++ } 7 } */
+ 
+ int
+ bar (int a)
+ {
+   return __atomic_always_lock_free (2, a);	/* { dg-warning "pointer from integer" "" { target c } } */
+ }						/* { dg-error "invalid conversion" "" { target c++ } 13 } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/pr77624-2.c gcc-5.5.0/gcc/testsuite/c-c++-common/pr77624-2.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/pr77624-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/pr77624-2.c	Tue May 30 07:26:43 2017
***************
*** 0 ****
--- 1,26 ----
+ /* PR middle-end/77624 */
+ /* { dg-do compile } */
+ 
+ void
+ foo (int *a)
+ {
+   double b = 0;
+   __atomic_is_lock_free (2, a, 2);	/* { dg-error "too many arguments" } */
+   __atomic_is_lock_free (2);		/* { dg-error "too few arguments" } */
+   __atomic_is_lock_free (2, b);		/* { dg-error "incompatible type" "" { target c } } */
+ 					/* { dg-message "expected" "" { target c } 10 } */
+ 					/* { dg-error "convert" "" { target c++ } 10 } */
+   __atomic_is_lock_free (2, 0);
+ }
+ 
+ void
+ bar (int *a)
+ {
+   double b = 0;
+   __atomic_always_lock_free (2, a, 2);	/* { dg-error "too many arguments" } */
+   __atomic_always_lock_free (2);	/* { dg-error "too few arguments" } */
+   __atomic_always_lock_free (2, b);	/* { dg-error "incompatible type" "" { target c } } */
+ 					/* { dg-message "expected" "" { target c } 22 } */
+ 					/* { dg-error "convert" "" { target c++ } 22 } */
+   __atomic_always_lock_free (2, 0);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/pr79641.c gcc-5.5.0/gcc/testsuite/c-c++-common/pr79641.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/pr79641.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/pr79641.c	Tue May 30 08:02:18 2017
***************
*** 0 ****
--- 1,4 ----
+ /* PR c++/79641 */
+ /* { dg-do compile } */
+ 
+ const int __attribute__((__mode__ (__QI__))) i = 0;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/pr81052.c gcc-5.5.0/gcc/testsuite/c-c++-common/pr81052.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/pr81052.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/pr81052.c	Sat Sep 16 18:37:09 2017
***************
*** 0 ****
--- 1,28 ----
+ /* PR middle-end/81052 */
+ /* { dg-do compile } */
+ /* { dg-options "-fopenmp-simd -O2" } */
+ 
+ int
+ foo (int x, int y)
+ {
+   int i;
+ #pragma omp simd
+   for (i = x; i < y; ++i)
+     return 0;			/* { dg-error "invalid branch to/from OpenMP structured block" } */
+   return 1;
+ }
+ 
+ #ifdef __cplusplus
+ template <typename T>
+ T
+ bar (T x, T y)
+ {
+   T i;
+ #pragma omp simd
+   for (i = x; i < y; ++i)
+     return 0;			/* { dg-error "invalid branch to/from OpenMP structured block" "" { target c++ } } */
+   return 1;
+ }
+ 
+ int x = bar (1, 7);
+ #endif
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/pr82112.c gcc-5.5.0/gcc/testsuite/c-c++-common/pr82112.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/pr82112.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/pr82112.c	Sat Sep 16 18:39:47 2017
***************
*** 0 ****
--- 1,13 ----
+ /* PR target/82112 */
+ /* { dg-do compile } */
+ 
+ int c[10], d[10], e[10], f[10], g[10], h[10], i[10], j[10], k[10], l[10];
+ 
+ void
+ foo (void)
+ {
+   __atomic_load (c, d, __ATOMIC_ACQUIRE);
+   __atomic_store (e, f, __ATOMIC_SEQ_CST);
+   __atomic_exchange (g, h, i, __ATOMIC_RELAXED);
+   __atomic_compare_exchange (j, k, l, 1, __ATOMIC_RELAXED, __ATOMIC_RELAXED);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/tsan/pr68260.c gcc-5.5.0/gcc/testsuite/c-c++-common/tsan/pr68260.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/tsan/pr68260.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/tsan/pr68260.c	Tue May 30 07:22:25 2017
***************
*** 0 ****
--- 1,28 ----
+ /* PR sanitizer/68260 */
+ 
+ #include <pthread.h>
+ #include <stdbool.h>
+ 
+ bool lock;
+ int counter;
+ 
+ void *
+ tf (void *arg)
+ {
+   (void) arg;
+   while (__atomic_test_and_set (&lock, __ATOMIC_ACQUIRE))
+     ;
+   ++counter;
+   __atomic_clear (&lock, __ATOMIC_RELEASE);
+   return (void *) 0;
+ }
+ 
+ int
+ main ()
+ {
+   pthread_t thr;
+   pthread_create (&thr, 0, tf, 0);
+   tf ((void *) 0);
+   pthread_join (thr, 0);
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/bounds-13.c gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/bounds-13.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/bounds-13.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/bounds-13.c	Thu Jul  7 12:42:43 2016
***************
*** 0 ****
--- 1,31 ----
+ /* PR sanitizer/71498 */
+ /* { dg-do run } */
+ /* { dg-options "-fsanitize=bounds -Wno-array-bounds" } */
+ 
+ struct S { int a[100]; int b, c; } s;
+ 
+ __attribute__((noinline, noclone)) int
+ foo (int x)
+ {
+   return s.a[x];
+ }
+ 
+ __attribute__((noinline, noclone)) int
+ bar (int x)
+ {
+   static int *d = &s.a[99];
+   asm volatile ("" : : "r" (&d));
+   return s.a[x];
+ }
+ 
+ int
+ main ()
+ {
+   volatile int a = 0;
+   a += foo (100);
+   a += bar (100);
+   return 0;
+ }
+ 
+ /* { dg-output "index 100 out of bounds for type 'int \\\[100\\\]'\[^\n\r]*(\n|\r\n|\r)" } */
+ /* { dg-output "\[^\n\r]*index 100 out of bounds for type 'int \\\[100\\\]'\[^\n\r]*(\n|\r\n|\r)" } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-1.c gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-1.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-1.c	Thu Jul 17 10:50:25 2014
--- gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/float-cast-overflow-1.c	Fri Sep 15 12:13:21 2017
***************
*** 1,6 ****
  /* { dg-do run { target { lp64 || ilp32 } } } */
  /* { dg-options "-fsanitize=float-cast-overflow" } */
! /* { dg-additional-options "-msse2 -mfpmath=sse" { target { sse2_runtime && ia32 } } } */
  
  #include <limits.h>
  #include "float-cast.h"
--- 1,7 ----
  /* { dg-do run { target { lp64 || ilp32 } } } */
  /* { dg-options "-fsanitize=float-cast-overflow" } */
! /* { dg-additional-options "-ffloat-store" { target { ia32 } } } */
! /* { dg-additional-options "-mieee" { target { { alpha*-*-* } || { sh*-*-* } } } } */
  
  #include <limits.h>
  #include "float-cast.h"
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/object-size-10.c gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/object-size-10.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/object-size-10.c	Tue Nov  4 09:30:47 2014
--- gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/object-size-10.c	Mon Aug 29 07:57:16 2016
***************
*** 2,9 ****
  /* { dg-skip-if "" { *-*-* } { "*" } { "-O2" } } */
  /* { dg-options "-fsanitize=undefined" } */
  
! static char a[128];
! static int b[128];
  
  __attribute__ ((noinline, noclone)) int
  fn1 (int i)
--- 2,9 ----
  /* { dg-skip-if "" { *-*-* } { "*" } { "-O2" } } */
  /* { dg-options "-fsanitize=undefined" } */
  
! static char a[128] __attribute__ ((aligned(4096)));
! static int b[128] __attribute__ ((aligned(4096)));
  
  __attribute__ ((noinline, noclone)) int
  fn1 (int i)
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/object-size-9.c gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/object-size-9.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/object-size-9.c	Fri Oct 10 17:19:25 2014
--- gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/object-size-9.c	Wed Sep 28 12:48:16 2016
*************** struct C { C () : d("abcdefg"), e(1) {}
*** 11,17 ****
  #endif
  struct U { int a : 5; int b : 19; int c : 8; };
  struct S { struct U d[10]; };
! struct S s;
  
  int
  f1 (struct T x, int i)
--- 11,17 ----
  #endif
  struct U { int a : 5; int b : 19; int c : 8; };
  struct S { struct U d[10]; };
! struct S s __attribute__ ((aligned(4096)));
  
  int
  f1 (struct T x, int i)
*************** f1 (struct T x, int i)
*** 27,33 ****
  /* { dg-output "\[^\n\r]*\\^\[^\n\r]*(\n|\r\n|\r)" } */
  
  #ifdef __cplusplus
! struct C
  f2 (int i)
  {
    struct C x;
--- 27,33 ----
  /* { dg-output "\[^\n\r]*\\^\[^\n\r]*(\n|\r\n|\r)" } */
  
  #ifdef __cplusplus
! static struct C
  f2 (int i)
  {
    struct C x;
*************** f2 (int i)
*** 41,47 ****
  /* { dg-output "\[^\n\r]*\[^\n\r]*(\n|\r\n|\r)" { target { c++ } } } */
  /* { dg-output "\[^\n\r]*\\^\[^\n\r]*(\n|\r\n|\r)" { target { c++ } } } */
  
! struct C
  f3 (int i)
  {
    struct C x;
--- 41,47 ----
  /* { dg-output "\[^\n\r]*\[^\n\r]*(\n|\r\n|\r)" { target { c++ } } } */
  /* { dg-output "\[^\n\r]*\\^\[^\n\r]*(\n|\r\n|\r)" { target { c++ } } } */
  
! static struct C
  f3 (int i)
  {
    struct C x;
*************** main (void)
*** 93,97 ****
--- 93,101 ----
  #endif
    f4 (12);
    f5 (12);
+ #ifdef __cplusplus
+   /* Stack may be smashed by f2/f3 above.  */
+   __builtin_exit (0);
+ #endif
    return 0;
  }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/pr81604.c gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/pr81604.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/ubsan/pr81604.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/c-c++-common/ubsan/pr81604.c	Mon Jul 31 09:29:58 2017
***************
*** 0 ****
--- 1,31 ----
+ /* PR sanitizer/81604 */
+ /* { dg-do run } */
+ /* { dg-options "-fsanitize=bounds,signed-integer-overflow" } */
+ 
+ long a[10];
+ 
+ __attribute__((noinline, noclone)) long *
+ foo (int i)
+ {
+   return &a[i];
+ }
+ 
+ __attribute__((noinline, noclone)) long
+ bar (long x, long y)
+ {
+   return x * y;
+ }
+ 
+ int
+ main ()
+ {
+   volatile int i = -1;
+   volatile long l = __LONG_MAX__;
+   long *volatile p;
+   p = foo (i);
+   l = bar (l, l);
+   return 0;
+ }
+ 
+ /* { dg-output "index -1 out of bounds for type 'long int \\\[10\\\]'\[^\n\r]*(\n|\r\n|\r)" } */
+ /* { dg-output "\[^\n\r]*signed integer overflow: \[0-9]+ \\* \[0-9]+ cannot be represented in type 'long int'" } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/c-c++-common/vector-compare-4.c gcc-5.5.0/gcc/testsuite/c-c++-common/vector-compare-4.c
*** gcc-5.4.0/gcc/testsuite/c-c++-common/vector-compare-4.c	Wed Jan 27 20:31:00 2016
--- gcc-5.5.0/gcc/testsuite/c-c++-common/vector-compare-4.c	Thu Jul  7 12:59:39 2016
***************
*** 1,6 ****
  /* PR c/68062 */
  /* { dg-do compile } */
! /* { dg-options "-Wsign-compare" } */
  
  typedef signed char __attribute__ ((vector_size (4))) v4qi;
  typedef unsigned char __attribute__ ((vector_size (4))) uv4qi;
--- 1,8 ----
  /* PR c/68062 */
  /* { dg-do compile } */
! /* { dg-options "-Wsign-compare -Wno-psabi" } */
! /* Ignore warning on some powerpc configurations. */
! /* { dg-prune-output "non-standard ABI extension" } */
  
  typedef signed char __attribute__ ((vector_size (4))) v4qi;
  typedef unsigned char __attribute__ ((vector_size (4))) uv4qi;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/asan/pr77396-2.C gcc-5.5.0/gcc/testsuite/g++.dg/asan/pr77396-2.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/asan/pr77396-2.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/asan/pr77396-2.C	Tue May 30 07:19:49 2017
***************
*** 0 ****
--- 1,12 ----
+ // PR sanitizer/77396
+ // { dg-do run }
+ // { dg-set-target-env-var ASAN_OPTIONS "check_initialization_order=true" }
+ 
+ struct S { S () { asm volatile ("" : : : "memory"); } };
+ static S c;
+ 
+ int
+ main ()
+ {
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/asan/pr77396.C gcc-5.5.0/gcc/testsuite/g++.dg/asan/pr77396.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/asan/pr77396.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/asan/pr77396.C	Tue May 30 07:19:49 2017
***************
*** 0 ****
--- 1,12 ----
+ // PR sanitizer/77396
+ // { dg-do run }
+ // { dg-set-target-env-var ASAN_OPTIONS "check_initialization_order=true" }
+ 
+ static int a = 0; 
+ static int b = a; 
+ 
+ int
+ main ()
+ {
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/Wunused-variable-1.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/Wunused-variable-1.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/Wunused-variable-1.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/Wunused-variable-1.C	Wed Jun  8 18:05:38 2016
***************
*** 0 ****
--- 1,37 ----
+ // PR c++/71442
+ // { dg-do compile { target c++11 } }
+ // { dg-options "-Wunused-variable" }
+ 
+ struct C
+ {
+   template<typename... Ts>
+   int operator()(Ts &&...)
+   {
+     return sizeof...(Ts);
+   }
+ };
+ 
+ int
+ foo ()
+ {
+   C {} (1, 1L, 1LL, 1.0);
+ }
+ 
+ template<int N>
+ void
+ bar ()
+ {
+   char a;		// { dg-warning "unused variable" }
+   short b;		// { dg-warning "unused variable" }
+   int c;		// { dg-warning "unused variable" }
+   long d;		// { dg-warning "unused variable" }
+   long long e;		// { dg-warning "unused variable" }
+   float f;		// { dg-warning "unused variable" }
+   double g;		// { dg-warning "unused variable" }
+ }
+ 
+ void
+ baz ()
+ {
+   bar <0> ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/constexpr-list1.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/constexpr-list1.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/constexpr-list1.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/constexpr-list1.C	Mon Sep 18 18:33:58 2017
***************
*** 0 ****
--- 1,15 ----
+ // PR c++/72457
+ // { dg-do compile { target c++11 } }
+ 
+ struct A {
+   int i;
+   constexpr A(): i(0) {}
+ };
+ 
+ struct B: A { };
+ 
+ struct C
+ {
+   B b;
+   constexpr C() : b{} {}
+ };
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/gen-attrs-62.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/gen-attrs-62.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/gen-attrs-62.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/gen-attrs-62.C	Tue May 30 07:27:33 2017
***************
*** 0 ****
--- 1,5 ----
+ // PR c++/77637
+ // { dg-do compile { target c++11 } }
+ 
+ int [[...]] a;		// { dg-error "expected attribute before '...'" }
+ int [[,,...]] b;	// { dg-error "expected attribute before '...'" }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/initlist-base2.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/initlist-base2.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/initlist-base2.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/initlist-base2.C	Mon Sep 18 18:33:52 2017
***************
*** 0 ****
--- 1,21 ----
+ // PR c++/55922
+ // { dg-do run { target c++11 } }
+ 
+ bool called = false;
+ 
+ struct Base {
+   Base() { if (called) throw 1; called = true; }
+ };
+ 
+ struct B1 : virtual Base {
+   B1() { }
+ };
+ 
+ struct C : B1, virtual Base {
+   C() : B1{}
+   { }
+ };
+ 
+ int main() {
+   C c;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/initlist-base3.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/initlist-base3.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/initlist-base3.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/initlist-base3.C	Mon Sep 18 18:33:52 2017
***************
*** 0 ****
--- 1,17 ----
+ // PR c++/71774
+ // { dg-do compile { target c++11 } }
+ 
+ class Meow
+ {
+   protected:
+     Meow() =default;
+     virtual void f() {}
+ };
+ 
+ class Purr : public Meow
+ {
+   public:
+     Purr()
+       : Meow{}
+     {}
+ };
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-deduce3.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-deduce3.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-deduce3.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-deduce3.C	Fri Jul 22 03:51:22 2016
***************
*** 0 ****
--- 1,15 ----
+ // PR c++/69223
+ // { dg-do compile { target c++11 } }
+ 
+ template <class T> struct A
+ {
+   T x[20];
+ };
+ 
+ int main()
+ {
+   auto l = [](const A<int>& i){ return i; };
+   A<int> a;
+ 
+   l(a);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/mutable1.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/mutable1.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/mutable1.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/mutable1.C	Tue May 30 07:24:56 2017
***************
*** 0 ****
--- 1,12 ----
+ // PR c++/77375
+ // { dg-do run { target c++11 } }
+ 
+ struct Base { mutable int i; };
+ struct Derived : Base {};
+ const Derived foo{};
+ 
+ int
+ main ()
+ {
+   foo.i = 42;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/pr68724.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/pr68724.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/pr68724.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/pr68724.C	Fri Aug  5 19:58:36 2016
***************
*** 0 ****
--- 1,15 ----
+ // PR 68724 ICE in  unificiation
+ // { dg-do compile { target c++11 } }
+ 
+ template <typename _Tp, _Tp>
+ struct integral_constant
+ {
+ };
+ 
+ integral_constant<bool, true> inst;
+ 
+ template <typename _Tp>
+ struct integral_constant<bool, __is_enum(_Tp)> // { dg-error "" }
+ {
+ };
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/pr78341.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/pr78341.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/pr78341.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/pr78341.C	Tue May 30 07:55:06 2017
***************
*** 0 ****
--- 1,4 ----
+ // PR c++/78341
+ // { dg-do compile { target c++11 } }
+ 
+ alignas (alignas double // { dg-error "" }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/pr78649.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/pr78649.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/pr78649.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/pr78649.C	Tue May 30 07:46:27 2017
***************
*** 0 ****
--- 1,16 ----
+ // PR c++/78649
+ // { dg-do compile { target c++11 } }
+ 
+ template <class> void foo ();
+ template <class T, class... U>
+ void
+ test ()
+ {
+   T t (foo<U>...);	// { dg-error "declared void" }
+ }
+ 
+ int
+ main ()
+ {
+   test<void> ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/variadic-nested1.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/variadic-nested1.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp0x/variadic-nested1.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp0x/variadic-nested1.C	Tue Jul 26 20:29:12 2016
***************
*** 0 ****
--- 1,9 ----
+ // PR c++/71833
+ // { dg-do compile { target c++11 } }
+ 
+ template < typename ... Ts > struct A 
+ {
+   template < Ts ..., typename ... Us > struct B {};
+ };
+ 
+ A <>::B < int > e;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/constexpr-77467.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/constexpr-77467.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/constexpr-77467.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/constexpr-77467.C	Tue May 30 07:32:25 2017
***************
*** 0 ****
--- 1,128 ----
+ // PR c++/77467
+ // { dg-do compile { target c++14 } }
+ 
+ constexpr int
+ foo (const int x, const unsigned n) noexcept
+ {
+   switch (n)
+     {
+     case 0:
+       return 1;
+     case 1:
+       return x;
+     default:
+       const auto m = (n >> 1);
+       const auto y = foo (x, m);
+       return ((m << 1) == n) ? y * y : x * y * y;
+     }
+ }
+ 
+ static_assert (foo (3, 2) == 9, "");
+ static_assert (foo (2, 3) == 8, "");
+ 
+ constexpr int
+ bar (int x)
+ {
+   int a = x;
+   switch (x)
+     a = x + 1;
+   return a;
+ }
+ 
+ static_assert (bar (0) == 0, "");
+ static_assert (bar (1) == 1, "");
+ 
+ constexpr int
+ baz (const int x, int y) noexcept
+ {
+   switch (x)
+     {
+     case 0:
+       return 1;
+     case 1:
+       return x;
+     case 2:
+       if ((y += 2) == 0)
+ 	{
+ 	case 3:
+ 	  y += 4;
+ 	  break;
+ 	}
+       else
+ 	{
+ 	case 4:
+ 	  y += 8;
+ 	  break;
+ 	}
+       break;
+     case 5:
+       for (y = 0; y < 3; y++)
+ 	{
+ 	case 7:
+ 	  if (y == -4)
+ 	    y += 3;
+ 	  if (y == -3)
+ 	    continue;
+ 	  if (y == -2)
+ 	    {
+ 	      y += 18;
+ 	      break;
+ 	    }
+ 	  if (y == 2)
+ 	    {
+ 	    case 6:
+ 	      y += 12;
+ 	    default:
+ 	      y++;
+ 	      break;
+ 	    }
+ 	}
+       break;
+     case -1:
+     case -2:
+       switch (y)
+ 	{
+ 	case 19:
+ 	  y += 2;
+ 	  break;
+ 	case 20:
+ 	  y += 3;
+ 	  if (x == 2)
+ 	    case 21:;
+ 	  y += 2;
+ 	  if (x == 3)
+ 	    default:;
+ 	  y += 4;
+ 	  break;
+ 	}
+       return x + y + 1;
+     }
+   return x + y;
+ }
+ 
+ static_assert (baz (0, 7) == 1, "");
+ static_assert (baz (1, 7) == 1, "");
+ static_assert (baz (2, -2) == 6, "");
+ static_assert (baz (2, 0) == 12, "");
+ static_assert (baz (3, 1) == 8, "");
+ static_assert (baz (4, 2) == 14, "");
+ static_assert (baz (5, -20) == 20, "");
+ static_assert (baz (6, 5) == 24, "");
+ static_assert (baz (7, -5) == 22, "");
+ static_assert (baz (7, -4) == 22, "");
+ static_assert (baz (7, -3) == 23, "");
+ static_assert (baz (7, -2) == 23, "");
+ static_assert (baz (7, -1) == 22, "");
+ static_assert (baz (7, 0) == 22, "");
+ static_assert (baz (7, 2) == 22, "");
+ static_assert (baz (7, 6) == 14, "");
+ static_assert (baz (8, 9) == 18, "");
+ static_assert (baz (8, -2) == 7, "");
+ static_assert (baz (-1, 19) == 21, "");
+ static_assert (baz (-1, 20) == 29, "");
+ static_assert (baz (-1, 21) == 27, "");
+ static_assert (baz (-1, 5) == 9, "");
+ static_assert (baz (-2, 19) == 20, "");
+ static_assert (baz (-2, 20) == 28, "");
+ static_assert (baz (-2, 21) == 26, "");
+ static_assert (baz (-2, 5) == 8, "");
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/constexpr-empty3.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/constexpr-empty3.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/constexpr-empty3.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/constexpr-empty3.C	Mon Sep 18 18:34:10 2017
***************
*** 0 ****
--- 1,14 ----
+ // PR c++/80294
+ // { dg-do compile { target c++14 } }
+ // { dg-final { scan-assembler-not "static_init" } }
+ 
+ struct A {
+   constexpr int f() { A a = *this; return 42; }
+ };
+ struct B: A
+ {
+   int i;
+   constexpr B(): i(f()) {}
+ };
+ 
+ B b;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/constexpr-switch4.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/constexpr-switch4.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/constexpr-switch4.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/constexpr-switch4.C	Tue May 30 07:11:09 2017
***************
*** 0 ****
--- 1,27 ----
+ // PR c++/72868
+ // { dg-do compile }
+ // { dg-options "-std=gnu++14" }
+ 
+ constexpr int
+ foo (int i)
+ {
+   switch (i)
+     {
+     case 11 ... 12:
+       return 4;
+     case 0 ... 9:
+       return 3;
+     default:
+       return 7;
+     }
+ }
+ 
+ #define SA(X) static_assert((X),#X)
+ SA (foo (-1) == 7);
+ SA (foo (0) == 3);
+ SA (foo (3) == 3);
+ SA (foo (9) == 3);
+ SA (foo (10) == 7);
+ SA (foo (11) == 4);
+ SA (foo (12) == 4);
+ SA (foo (13) == 7);
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx11.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx11.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx11.C	Fri Dec 12 03:49:13 2014
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx11.C	Mon Sep 11 10:44:11 2017
***************
*** 77,86 ****
  #  error "__cpp_attributes != 200809"
  #endif
  
! #ifndef __cpp_rvalue_reference
! #  error "__cpp_rvalue_reference"
! #elif __cpp_rvalue_reference != 200610
! #  error "__cpp_rvalue_reference != 200610"
  #endif
  
  #ifndef __cpp_variadic_templates
--- 77,86 ----
  #  error "__cpp_attributes != 200809"
  #endif
  
! #ifndef __cpp_rvalue_references
! #  error "__cpp_rvalue_references"
! #elif __cpp_rvalue_references != 200610
! #  error "__cpp_rvalue_references != 200610"
  #endif
  
  #ifndef __cpp_variadic_templates
***************
*** 125,130 ****
--- 125,136 ----
  #  error "__cpp_alias_templates != 200704"
  #endif
  
+ #ifndef __cpp_threadsafe_static_init
+ #  error "__cpp_threadsafe_static_init"
+ #elif __cpp_threadsafe_static_init != 200806
+ #  error "__cpp_threadsafe_static_init != 200806"
+ #endif
+ 
  //  C++14 features allowed in C++11 in non-ANSI modes:
  
  #ifndef __cpp_binary_literals
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx14.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx14.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx14.C	Sat Dec 20 01:21:15 2014
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx14.C	Mon Sep 11 10:44:11 2017
***************
*** 71,80 ****
  #  error "__cpp_attributes != 200809"
  #endif
  
! #ifndef __cpp_rvalue_reference
! #  error "__cpp_rvalue_reference"
! #elif __cpp_rvalue_reference != 200610
! #  error "__cpp_rvalue_reference != 200610"
  #endif
  
  #ifndef __cpp_variadic_templates
--- 71,80 ----
  #  error "__cpp_attributes != 200809"
  #endif
  
! #ifndef __cpp_rvalue_references
! #  error "__cpp_rvalue_references"
! #elif __cpp_rvalue_references != 200610
! #  error "__cpp_rvalue_references != 200610"
  #endif
  
  #ifndef __cpp_variadic_templates
***************
*** 119,124 ****
--- 119,130 ----
  #  error "__cpp_alias_templates != 200704"
  #endif
  
+ #ifndef __cpp_threadsafe_static_init
+ #  error "__cpp_threadsafe_static_init"
+ #elif __cpp_threadsafe_static_init != 200806
+ #  error "__cpp_threadsafe_static_init != 200806"
+ #endif
+ 
  //  C++14 features:
  
  #ifndef __cpp_binary_literals
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx98-neg.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx98-neg.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx98-neg.C	Sat Dec 20 01:21:15 2014
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx98-neg.C	Tue Jul  5 17:58:35 2016
***************
*** 42,49 ****
  #  error "__cpp_attributes" // { dg-error "error" }
  #endif
  
! #ifndef __cpp_rvalue_reference
! #  error "__cpp_rvalue_reference" // { dg-error "error" }
  #endif
  
  #ifndef __cpp_variadic_templates
--- 42,49 ----
  #  error "__cpp_attributes" // { dg-error "error" }
  #endif
  
! #ifndef __cpp_rvalue_references
! #  error "__cpp_rvalue_references" // { dg-error "error" }
  #endif
  
  #ifndef __cpp_variadic_templates
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx98.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx98.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx98.C	Fri Dec 12 03:49:13 2014
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-cxx98.C	Mon Sep 11 10:44:11 2017
***************
*** 15,20 ****
--- 15,28 ----
  #  error "__cpp_exceptions != 199711"
  #endif
  
+ //  C++11 features allowed in C++98:
+ 
+ #ifndef __cpp_threadsafe_static_init
+ #  error "__cpp_threadsafe_static_init"
+ #elif __cpp_threadsafe_static_init != 200806
+ #  error "__cpp_threadsafe_static_init != 200806"
+ #endif
+ 
  //  C++14 features allowed in C++98 in non-ANSI modes:
  
  #ifndef __cpp_binary_literals
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-neg.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-neg.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/feat-neg.C	Mon Nov 10 15:53:12 2014
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/feat-neg.C	Mon Sep 11 10:44:11 2017
***************
*** 1,5 ****
  // { dg-do compile }
! // { dg-options "-fno-rtti -fno-exceptions" }
  
  //  C++98 features with explicit opt-out:
  
--- 1,5 ----
  // { dg-do compile }
! // { dg-options "-fno-rtti -fno-exceptions -fno-threadsafe-statics" }
  
  //  C++98 features with explicit opt-out:
  
***************
*** 10,12 ****
--- 10,18 ----
  #ifndef __cpp_exceptions
  #  error "__cpp_exceptions" // { dg-error "error" }
  #endif
+ 
+ //  C++11 features with explicit opt-out:
+ 
+ #ifndef __cpp_threadsafe_static_init
+ #  error "__cpp_threadsafe_static_init" // { dg-error "error" }
+ #endif
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/pr77739.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/pr77739.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/pr77739.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/pr77739.C	Tue May 30 07:44:11 2017
***************
*** 0 ****
--- 1,15 ----
+ // PR c++/77739
+ // { dg-do compile { target c++14 } }
+ 
+ struct A {
+   A();
+   A(const A &);
+ };
+ struct B {
+   B();
+   template <typename... Args> auto g(Args &&... p1) {
+     return [=] { f(p1...); };
+   }
+   void f(A, const char *);
+ };
+ B::B() { g(A(), ""); }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/pr78551.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/pr78551.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/pr78551.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/pr78551.C	Thu Dec  8 19:27:32 2016
***************
*** 0 ****
--- 1,32 ----
+ // { dg-do compile { target c++14 } }
+ 
+ // PR c++/78551 ICE in constexpr evaluation overwriting array
+ // intialized by string constant.
+ 
+ constexpr char Foo (char x, int ix)
+ {
+   char d[4] = "012";
+   d[0] = x;
+   return d[ix];
+ }
+ 
+ static const char a = Foo ('a', 1);
+ static const char b = Foo ('a', 0);
+ 
+ static_assert (a == '1', "");
+ static_assert (b == 'a', "");
+ 
+ struct A {
+   union {
+     long s;
+     char d[4];
+   };
+   constexpr A (char x)
+     : d("012")
+   { d[0] = x; }
+ };
+ 
+ static constexpr A c{'a'};
+ 
+ static_assert (c.d[0] == 'a', "");
+ static_assert (c.d[1] == '1', "");
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/var-templ53.C gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/var-templ53.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/cpp1y/var-templ53.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/cpp1y/var-templ53.C	Fri Jul 22 03:51:15 2016
***************
*** 0 ****
--- 1,10 ----
+ // PR c++/71630
+ // { dg-do compile { target c++14 } }
+ 
+ template <class T>
+ extern T pi;
+ 
+ int main()
+ {
+   return pi<int>;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/debug/dwarf2/imported-decl-2.C gcc-5.5.0/gcc/testsuite/g++.dg/debug/dwarf2/imported-decl-2.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/debug/dwarf2/imported-decl-2.C	Mon Jun  2 22:10:57 2014
--- gcc-5.5.0/gcc/testsuite/g++.dg/debug/dwarf2/imported-decl-2.C	Tue Sep  6 22:26:11 2016
***************
*** 1,5 ****
  // { dg-do compile }
! // { dg-options "-gdwarf-2 -dA -O0 -fno-merge-debug-strings" }
  
  class AAAA
  {
--- 1,5 ----
  // { dg-do compile }
! // { dg-options "-gdwarf-2 -gno-strict-dwarf -dA -O0 -fno-merge-debug-strings" }
  
  class AAAA
  {
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/debug/dwarf2/pr77363.C gcc-5.5.0/gcc/testsuite/g++.dg/debug/dwarf2/pr77363.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/debug/dwarf2/pr77363.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/debug/dwarf2/pr77363.C	Tue May 30 07:18:37 2017
***************
*** 0 ****
--- 1,20 ----
+ // PR debug/77363
+ // { dg-options "-gdwarf-2 -dA -fno-merge-debug-strings" }
+ // { dg-final { scan-assembler "DIE \\(\[^\n\r\]*\\) DW_TAG_typedef\[^\n\r\]*\[\n\r]*\[^\n\r\]*type2\[^\n\r\]* DW_AT_name\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_decl_file\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_decl_line\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_type" } }
+ // { dg-final { scan-assembler "DIE \\(\[^\n\r\]*\\) DW_TAG_typedef\[^\n\r\]*\[\n\r]*\[^\n\r\]*type3\[^\n\r\]* DW_AT_name\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_decl_file\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_decl_line\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_type" } }
+ // { dg-final { scan-assembler "DIE \\(\[^\n\r\]*\\) DW_TAG_typedef\[^\n\r\]*\[\n\r]*\[^\n\r\]*type4\[^\n\r\]* DW_AT_name\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_decl_file\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_decl_line\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_type" } }
+ // { dg-final { scan-assembler "DIE \\(\[^\n\r\]*\\) DW_TAG_typedef\[^\n\r\]*\[\n\r]*\[^\n\r\]*type5\[^\n\r\]* DW_AT_name\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_decl_file\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_decl_line\[^\n\r\]*\[\n\r]*\[^\n\r\]* DW_AT_type" } }
+ 
+ typedef unsigned short type1;
+ typedef unsigned char type2;
+ typedef type2 type3[16];
+ typedef unsigned char type4[16];
+ typedef struct
+ {
+   struct
+   {
+     type3 a;
+     type4 b;
+   } c;
+ } type5;
+ type5 var;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ext/altivec-18.C gcc-5.5.0/gcc/testsuite/g++.dg/ext/altivec-18.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ext/altivec-18.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ext/altivec-18.C	Sat Sep 16 18:40:37 2017
***************
*** 0 ****
--- 1,14 ----
+ // PR target/82112
+ // { dg-do compile { target powerpc*-*-* } }
+ // { dg-require-effective-target powerpc_altivec_ok }
+ // { dg-options "-maltivec" }
+ 
+ #include <altivec.h>
+ 
+ __attribute__((aligned (16))) extern const unsigned char c[16];
+ 
+ void
+ foo (void)
+ {
+   vec_ld (0, c);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ext/int128-5.C gcc-5.5.0/gcc/testsuite/g++.dg/ext/int128-5.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ext/int128-5.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ext/int128-5.C	Tue May 30 08:15:55 2017
***************
*** 0 ****
--- 1,10 ----
+ // PR c++/79896
+ // { dg-do compile { target { ilp32 && { ! int128 } } } }
+ // { dg-options "" }
+ 
+ enum E
+ {
+   e1 = 0xffffffffffffffffULL,
+   e2,			// { dg-error "overflow in enumeration values" }
+   e3
+ } e = e3;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ext/mv8.C gcc-5.5.0/gcc/testsuite/g++.dg/ext/mv8.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ext/mv8.C	Wed Jan 30 18:04:34 2013
--- gcc-5.5.0/gcc/testsuite/g++.dg/ext/mv8.C	Wed Mar 22 12:33:33 2017
***************
*** 1,4 ****
! // { dg-do compile { target i?86-*-* x86_64-*-* } }
  // { dg-options "" }
  
  __attribute__((target (11,12)))
--- 1,4 ----
! // { dg-do compile { target i?86-*-* x86_64-*-* powerpc*-*-* } }
  // { dg-options "" }
  
  __attribute__((target (11,12)))
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ext/pr80363.C gcc-5.5.0/gcc/testsuite/g++.dg/ext/pr80363.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ext/pr80363.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ext/pr80363.C	Tue May 30 08:25:10 2017
***************
*** 0 ****
--- 1,12 ----
+ // PR c++/80363
+ // { dg-do compile }
+ 
+ typedef int V __attribute__((vector_size (16)));
+ 
+ int
+ foo (V *a, V *b)
+ {
+   if (*a < *b)	// { dg-error "could not convert\[^#]*from" }
+     return 1;
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ext/vector31.C gcc-5.5.0/gcc/testsuite/g++.dg/ext/vector31.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ext/vector31.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ext/vector31.C	Tue Jul 19 09:25:10 2016
***************
*** 0 ****
--- 1,29 ----
+ // PR c++/71871
+ // { dg-do compile }
+ 
+ typedef unsigned int V __attribute__ ((__vector_size__ (32)));
+ 
+ template <int N>
+ void
+ foo (V *x)
+ {
+   V a = *x;
+   a = a ? a : -1;
+   *x = a;
+ }
+ 
+ template <typename T>
+ void
+ bar (T *x)
+ {
+   T a = *x;
+   a = a ? a : -1;
+   *x = a;
+ }
+ 
+ void
+ test (V *x, V *y)
+ {
+   foo<0> (x);
+   bar<V> (y);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/gcov/gcov-16.C gcc-5.5.0/gcc/testsuite/g++.dg/gcov/gcov-16.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/gcov/gcov-16.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/gcov/gcov-16.C	Thu Nov  3 13:43:12 2016
***************
*** 0 ****
--- 1,10 ----
+ // PR gcov-profile/64634
+ // { dg-options "-fprofile-arcs -ftest-coverage" }
+ // { dg-do run { target native } }
+ 
+ int main()
+ {
+   return 0;   /* count(#####) */
+ }
+ 
+ // { dg-final { run-gcov remove-gcda gcov-16.C } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/gomp/pr71910.C gcc-5.5.0/gcc/testsuite/g++.dg/gomp/pr71910.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/gomp/pr71910.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/gomp/pr71910.C	Tue May 30 07:15:49 2017
***************
*** 0 ****
--- 1,13 ----
+ // PR target/71910
+ // { dg-do compile }
+ // { dg-additional-options "-O2" }
+ 
+ #include <vector>
+ 
+ int
+ main ()
+ {
+   std::vector<double> vec(10);
+ #pragma omp parallel
+   __builtin_exit (0);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/gomp/pr79664.C gcc-5.5.0/gcc/testsuite/g++.dg/gomp/pr79664.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/gomp/pr79664.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/gomp/pr79664.C	Tue May 30 08:04:55 2017
***************
*** 0 ****
--- 1,142 ----
+ // PR c++/79664
+ // { dg-do compile }
+ // { dg-options "-std=c++14 -fopenmp" }
+ 
+ constexpr int
+ f1 ()
+ {
+   int i = 0;
+ #pragma omp parallel for			// { dg-error "is not a constant-expression" }
+   for (i = 0; i < 10; ++i)
+     ;
+   return 0;
+ }
+ 
+ constexpr int
+ f2 ()
+ {
+   int i = 0;
+ #pragma omp parallel				// { dg-error "is not a constant-expression" }
+   i = 5;
+   return 0;
+ }
+ 
+ constexpr int
+ f3 ()
+ {
+   int i = 0;
+ #pragma omp task				// { dg-error "is not a constant-expression" }
+   i = 5;
+   return 0;
+ }
+ 
+ constexpr int
+ f4 ()
+ {
+   int i = 0;
+ #pragma omp for					// { dg-error "is not a constant-expression" }
+   for (i = 0; i < 10; ++i)
+     ;
+   return 0;
+ }
+ 
+ constexpr int
+ f6 ()
+ {
+   int i = 0;
+ #pragma omp target teams			// { dg-error "is not a constant-expression" }
+   i = 5;
+   return 0;
+ }
+ 
+ constexpr int
+ f7 ()
+ {
+   int i = 0;
+ #pragma omp target data map(tofrom:i)		// { dg-error "is not a constant-expression" }
+   i = 5;
+   return 0;
+ }
+ 
+ constexpr int
+ f8 ()
+ {
+   int i = 0;
+ #pragma omp target				// { dg-error "is not a constant-expression" }
+   i = 5;
+   return 0;
+ }
+ 
+ constexpr int
+ f9 ()
+ {
+   int i = 0;
+ #pragma omp sections				// { dg-error "is not a constant-expression" }
+   {
+ #pragma omp section
+     i = 5;
+   }
+   return 0;
+ }
+ 
+ constexpr int
+ f10 ()
+ {
+   int i = 0;
+ #pragma omp ordered				// { dg-error "is not a constant-expression" }
+   i = 1;
+   return 0;
+ }
+ 
+ constexpr int
+ f11 ()
+ {
+   int i = 0;
+ #pragma omp critical				// { dg-error "is not a constant-expression" }
+   i = 1;
+   return 0;
+ }
+ 
+ constexpr int
+ f12 ()
+ {
+   int i = 0;
+ #pragma omp single				// { dg-error "is not a constant-expression" }
+   i = 1;
+   return 0;
+ }
+ 
+ constexpr int
+ f13 ()
+ {
+   int i = 0;
+ #pragma omp master				// { dg-error "is not a constant-expression" }
+   i = 1;
+   return 0;
+ }
+ 
+ constexpr int
+ f14 ()
+ {
+   int i = 0;
+ #pragma omp taskgroup				// { dg-error "is not a constant-expression" }
+   i = 1;
+   return 0;
+ }
+ 
+ constexpr int
+ f15 ()
+ {
+   int i = 0;
+ #pragma omp target update to(i)			// { dg-error "is not a constant-expression" }
+   i = 1;
+   return 0;
+ }
+ 
+ constexpr int
+ f16 ()
+ {
+   int i = 0;
+ #pragma omp target update to(i)			// { dg-error "is not a constant-expression" }
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/gomp/pr80141.C gcc-5.5.0/gcc/testsuite/g++.dg/gomp/pr80141.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/gomp/pr80141.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/gomp/pr80141.C	Tue May 30 08:17:54 2017
***************
*** 0 ****
--- 1,8 ----
+ // PR c++/80141
+ // { dg-do compile }
+ 
+ #pragma omp declare simd aligned (p : 2 && 2)
+ template<int> void foo (int *p);
+ 
+ #pragma omp declare simd simdlen (2 && 2)
+ template<int> void bar (int *p);
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/gomp/pr81154.C gcc-5.5.0/gcc/testsuite/g++.dg/gomp/pr81154.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/gomp/pr81154.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/gomp/pr81154.C	Sat Sep 16 18:31:58 2017
***************
*** 0 ****
--- 1,51 ----
+ // PR c++/81154
+ // { dg-do compile }
+ 
+ template <typename T>
+ struct C
+ {
+   int foo (T n) const
+   {
+ #pragma omp parallel shared (foo)	// { dg-error "is not a variable in clause" }
+     ;
+ #pragma omp parallel private (foo)	// { dg-error "is not a variable in clause" }
+     ;
+ #pragma omp parallel firstprivate (foo)	// { dg-error "is not a variable in clause" }
+     ;
+ #pragma omp parallel for lastprivate (foo)	// { dg-error "is not a variable in clause" }
+     for (T i = 0; i < n; i++)
+       ;
+ #pragma omp parallel reduction (+:foo)	// { dg-error "is not a variable in clause" }
+     ;
+     return 0;
+   }
+   int foo (int x, int y) { return x; }
+ };
+ 
+ struct D
+ {
+   typedef int T;
+   int foo (T n) const
+   {
+ #pragma omp parallel shared (foo)	// { dg-error "is not a variable in clause" }
+     ;
+ #pragma omp parallel private (foo)	// { dg-error "is not a variable in clause" }
+     ;
+ #pragma omp parallel firstprivate (foo)	// { dg-error "is not a variable in clause" }
+     ;
+ #pragma omp parallel for lastprivate (foo)	// { dg-error "is not a variable in clause" }
+     for (T i = 0; i < n; i++)
+       ;
+ #pragma omp parallel reduction (+:foo)	// { dg-error "is not a variable in clause" }
+     ;
+     return 0;
+   }
+   int foo (int x, int y) { return x; }
+ };
+ 
+ int
+ main ()
+ {
+   C<int> ().foo (1);
+   D ().foo (1);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/init/elide5.C gcc-5.5.0/gcc/testsuite/g++.dg/init/elide5.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/init/elide5.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/init/elide5.C	Sun Aug 28 22:02:07 2016
***************
*** 0 ****
--- 1,26 ----
+ // PR c++/71913
+ // { dg-do link { target c++11 } }
+ 
+ void* operator new(decltype(sizeof(1)), void* p) { return p; }
+ 
+ struct IndirectReturn {
+   IndirectReturn() {}
+   // Undefined so we get a link error if the indirect return value is copied
+   IndirectReturn(const IndirectReturn&);
+   IndirectReturn& operator=(const IndirectReturn&) = delete;
+   ~IndirectReturn() {}
+ };
+ 
+ IndirectReturn foo() { return IndirectReturn(); }
+ 
+ void bar(void* ptr) {
+   new (ptr) IndirectReturn(foo());
+ }
+ 
+ alignas (alignof (IndirectReturn))
+ unsigned char c[sizeof(IndirectReturn)];
+ 
+ int main()
+ {
+   bar(c);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/init/pr71516.C gcc-5.5.0/gcc/testsuite/g++.dg/init/pr71516.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/init/pr71516.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/init/pr71516.C	Thu Jul  7 12:44:33 2016
***************
*** 0 ****
--- 1,10 ----
+ // PR c++/71516
+ // { dg-do compile }
+ 
+ struct A;	// { dg-message "forward declaration of" }
+ struct B
+ { 
+   static A a;
+ };
+ A B::a = A();	// { dg-error "has initializer but incomplete type|invalid use of incomplete type" }
+ struct A {};
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/init/ref23.C gcc-5.5.0/gcc/testsuite/g++.dg/init/ref23.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/init/ref23.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/init/ref23.C	Tue May 30 08:24:21 2017
***************
*** 0 ****
--- 1,15 ----
+ // PR c++/80176
+ // { dg-do compile }
+ 
+ struct X { static void foo(); static void baz(int); static int baz(double); } x;
+ struct Y { void o(unsigned char); static void o(int); void o(double); } y;
+ void X::foo() {}
+ static void bar() {}
+ void (&r1)() = x.foo;
+ void (&r2)() = X::foo;
+ void (&r3)() = bar;
+ void (&r4)(int) = x.baz;
+ int (&r5)(double) = x.baz;
+ void (&r6)(int) = X::baz;
+ int (&r7)(double) = X::baz;
+ void (&r8)(int) = y.o;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr71207.C gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr71207.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr71207.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr71207.C	Fri Jan 20 08:49:08 2017
***************
*** 0 ****
--- 1,42 ----
+ /* PR ipa/71207 */
+ /* { dg-do run } */
+ 
+ class Class1
+ {
+ public:
+   Class1() {};
+   virtual ~Class1() {};
+ 
+ protected:
+   unsigned Field1;
+ };
+ 
+ class Class2 : public virtual Class1
+ {
+ };
+ 
+ class Class3 : public virtual Class1
+ {
+ public:
+   virtual void Method1() = 0;
+ 
+   void Method2()
+   {
+     Method1();
+   }
+ };
+ 
+ class Class4 : public Class2, public virtual Class3
+ {
+ public:
+   Class4() {};
+   virtual void Method1() {};
+ };
+ 
+ int main()
+ {
+   Class4 var1;
+   var1.Method2();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr77333.C gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr77333.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr77333.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr77333.C	Tue Apr 11 13:31:16 2017
***************
*** 0 ****
--- 1,65 ----
+ // { dg-do run }
+ // { dg-options "-O2 -fno-ipa-sra" }
+ 
+ volatile int global;
+ int __attribute__((noinline, noclone))
+ get_data (int i)
+ {
+   global = i;
+   return i;
+ }
+ 
+ typedef int array[32];
+ 
+ namespace {
+ 
+ char buf[512];
+ 
+ class A
+ {
+ public:
+   int field;
+   char *s;
+ 
+   A() : field(223344)
+   {
+     s = buf;
+   }
+ 
+   int __attribute__((noinline))
+   foo (int a, int b, int c, int d, int e, int f, int g, int h, int i, int j,
+        int k, int l, int m, int n, int o, int p, int q, int r, int s, int t)
+   {
+     global = a+b+c+d+e+f+g+h+i+j+k+l+m+n+o+p+q+r+s+t;
+     return global;
+   }
+ 
+   int __attribute__((noinline))
+   bar()
+   {
+     int r = foo (get_data (1), get_data (1), get_data (1), get_data (1),
+ 		 get_data (1), get_data (1), get_data (1), get_data (1),
+ 		 get_data (1), get_data (1), get_data (1), get_data (1),
+ 		 get_data (1), get_data (1), get_data (1), get_data (1),
+ 		 get_data (1), get_data (1), get_data (1), get_data (1));
+ 
+     if (field != 223344)
+       __builtin_abort ();
+     return 0;
+   }
+ };
+ 
+ }
+ 
+ int main (int argc, char **argv)
+ {
+   A a;
+   int r = a.bar();
+   r = a.bar ();
+   if (a.field != 223344)
+       __builtin_abort ();
+   if (global != 20)
+     __builtin_abort ();
+ 
+   return r;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr77905.C gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr77905.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr77905.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr77905.C	Tue May 30 07:51:12 2017
***************
*** 0 ****
--- 1,21 ----
+ // PR ipa/77905
+ // { dg-do compile }
+ // { dg-options "-O2" }
+ 
+ struct A {
+   A(int);
+ };
+ struct B : A {
+   B();
+ } A;
+ struct C : virtual A {
+   C(int);
+ };
+ A::A(int x) {
+   if (x)
+     A(0);
+ }
+ 
+ B::B() : A(1) {}
+ 
+ C::C(int) : A(1) {}
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr78188.C gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr78188.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr78188.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr78188.C	Tue Jan 24 11:30:44 2017
***************
*** 0 ****
--- 1,20 ----
+ // { dg-do compile }
+ // { dg-options "-O2 -fno-exceptions" }
+ 
+ int a;
+ static void __attribute__((noinline)) foo () { a = 1; }
+ static void __attribute__((noinline)) foo2 () { a = 2; }
+ 
+ struct X
+ {
+   virtual void bar (int i) { if (!i) { foo (); __builtin_abort (); } }
+ };
+ 
+ void baz (int i)
+ {
+   if (!i)
+      { foo2 (); __builtin_abort (); }
+ }
+ 
+ X xx;
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr79931.C gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr79931.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr79931.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr79931.C	Mon May 29 09:13:50 2017
***************
*** 0 ****
--- 1,24 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O2 -fdump-ipa-all" } */
+ 
+ class DocumentImpl;
+ struct NodeImpl
+ {
+   virtual DocumentImpl * getOwnerDocument();
+   virtual NodeImpl * getParentNode();
+   virtual NodeImpl * removeChild(NodeImpl *oldChild);
+ };
+ struct AttrImpl : NodeImpl
+ {
+   NodeImpl *insertBefore(NodeImpl *newChild, NodeImpl *refChild);
+ };
+ struct DocumentImpl : NodeImpl
+ {
+   virtual NodeImpl *removeChild(NodeImpl *oldChild);
+   virtual int* getRanges();
+ };
+ NodeImpl *AttrImpl::insertBefore(NodeImpl *newChild, NodeImpl *refChild) {
+   NodeImpl *oldparent = newChild->getParentNode();
+   oldparent->removeChild(newChild);
+   this->getOwnerDocument()->getRanges();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr80205.C gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr80205.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ipa/pr80205.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ipa/pr80205.C	Mon May 29 09:08:48 2017
***************
*** 0 ****
--- 1,34 ----
+ // PR ipa/80205
+ // { dg-options "-fnon-call-exceptions --param early-inlining-insns=100 -O2" }
+ 
+ class a
+ {
+ public:
+   virtual ~a ();
+ };
+ class b
+ {
+ public:
+   template <typename c> b (c);
+   ~b () { delete d; }
+   void
+   operator= (b e)
+   {
+     b (e).f (*this);
+   }
+   void
+   f (b &e)
+   {
+     a g;
+     d = e.d;
+     e.d = &g;
+   }
+   a *d;
+ };
+ void
+ h ()
+ {
+   b i = int();
+   void j ();
+   i = j;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/opt/nrv18.C gcc-5.5.0/gcc/testsuite/g++.dg/opt/nrv18.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/opt/nrv18.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/opt/nrv18.C	Sat Sep 16 18:33:01 2017
***************
*** 0 ****
--- 1,12 ----
+ // PR c++/80984
+ // { dg-do compile }
+ 
+ struct A { ~A (); };
+ 
+ A
+ foo ()
+ {
+   A a;
+ a:
+   return a;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/opt/pr70641.C gcc-5.5.0/gcc/testsuite/g++.dg/opt/pr70641.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/opt/pr70641.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/opt/pr70641.C	Thu Jul  7 12:41:25 2016
***************
*** 0 ****
--- 1,10 ----
+ // PR c++/70641
+ // { dg-do compile }
+ // { dg-options "-O2" }
+ 
+ void
+ foo ()
+ {
+   try { foo (); }
+   catch (...) { __builtin_abort (); }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/opt/pr71528.C gcc-5.5.0/gcc/testsuite/g++.dg/opt/pr71528.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/opt/pr71528.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/opt/pr71528.C	Thu Jul  7 12:45:44 2016
***************
*** 0 ****
--- 1,23 ----
+ // PR c++/71528
+ // { dg-do run }
+ // { dg-options "-O2" }
+ 
+ extern int &x;
+ int y;
+ 
+ int &
+ foo ()
+ {
+   return y;
+ }
+ 
+ int &x = foo ();
+ 
+ int
+ main ()
+ {
+   if (&x != &y)
+     __builtin_abort ();
+ }
+ 
+ extern int &x;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/opt/pr79396.C gcc-5.5.0/gcc/testsuite/g++.dg/opt/pr79396.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/opt/pr79396.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/opt/pr79396.C	Tue May 30 08:05:47 2017
***************
*** 0 ****
--- 1,13 ----
+ // PR middle-end/79396
+ // { dg-do compile }
+ // { dg-options "-fnon-call-exceptions -O2" }
+ // { dg-additional-options "-mfma" { target i?86-*-* x86_64-*-* } }
+ 
+ struct A { A (); ~A (); };
+ 
+ float
+ foo (float x)
+ {
+   A a;
+   return __builtin_pow (x, 2) + 2;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/opt/pr80385.C gcc-5.5.0/gcc/testsuite/g++.dg/opt/pr80385.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/opt/pr80385.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/opt/pr80385.C	Tue May 30 08:26:33 2017
***************
*** 0 ****
--- 1,14 ----
+ // PR rtl-optimization/80385
+ // { dg-do compile { target { i?86-*-* x86_64-*-* } } }
+ // { dg-options "-Ofast -msse2" }
+ 
+ #include <x86intrin.h>
+ 
+ __m128 a, e;
+ struct A { __m128 b; A (); A (__m128 x) : b(x) {} };
+ A operator+ (A, A);
+ A operator- (A) { __m128 c = -a; return c; }
+ A foo (A x) { __m128 d = x.b; return _mm_andnot_ps (d, e); }
+ struct B { A n[1]; };
+ void bar (B x) { A f = foo (x.n[0]); A g = f + A (); }
+ void baz () { B h; B i; A j; i.n[0] = -j; h = i; B k = h; bar (k); }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/other/anon5.C gcc-5.5.0/gcc/testsuite/g++.dg/other/anon5.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/other/anon5.C	Thu Jan 15 16:33:37 2015
--- gcc-5.5.0/gcc/testsuite/g++.dg/other/anon5.C	Mon Aug 29 07:20:03 2016
***************
*** 1,6 ****
  // PR c++/34094
  // { dg-do link { target { ! { *-*-darwin* *-*-hpux* *-*-solaris2.* } } } }
! // { dg-options "-g" }
  // Ignore additional message on powerpc-ibm-aix
  // { dg-prune-output "obtain more information" } */
  // Ignore additional messages on Linux/x86 with PIE
--- 1,6 ----
  // PR c++/34094
  // { dg-do link { target { ! { *-*-darwin* *-*-hpux* *-*-solaris2.* } } } }
! // { dg-options "-gdwarf-2" }
  // Ignore additional message on powerpc-ibm-aix
  // { dg-prune-output "obtain more information" } */
  // Ignore additional messages on Linux/x86 with PIE
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/other/i386-11.C gcc-5.5.0/gcc/testsuite/g++.dg/other/i386-11.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/other/i386-11.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/other/i386-11.C	Fri May 19 18:08:19 2017
***************
*** 0 ****
--- 1,57 ----
+ // PR target/80799
+ // { dg-do compile { target i?86-*-* x86_64-*-* } }
+ // { dg-require-effective-target c++11 }
+ // { dg-options "-O2 -msse2" }
+ 
+ #include <xmmintrin.h>
+ #include <emmintrin.h>
+ 
+ class alignas(16) GSVector4i
+ {
+ public:
+     __m128i m;
+ 
+ 	explicit GSVector4i(__m128i m)
+ 	{
+ 		this->m = m;
+ 	}
+ 
+ 	static void storel(void* p, const GSVector4i& v)
+ 	{
+ 		_mm_storel_epi64((__m128i*)p, v.m);
+ 	}
+ 
+ 	static GSVector4i loadl(const void* p)
+ 	{
+ 		return GSVector4i(_mm_loadl_epi64((__m128i*)p));
+ 	}
+ 
+ 	bool eq(const GSVector4i& v) const
+ 	{
+ 		return _mm_movemask_epi8(_mm_cmpeq_epi32(m, v.m)) == 0xffff;
+ 	}
+ };
+ 
+ 
+ union GIFRegTRXPOS
+ {
+ 	unsigned long long u64;
+ 	void operator = (const GSVector4i& v) {GSVector4i::storel(this, v);}
+ 	bool operator != (const union GIFRegTRXPOS& r) const {return !((GSVector4i)r).eq(*this);}
+ 	operator GSVector4i() const {return GSVector4i::loadl(this);}
+ };
+ 
+ extern void dummy_call();
+ extern GIFRegTRXPOS TRXPOS;
+ 
+ void GIFRegHandlerTRXPOS(const GIFRegTRXPOS&  p)
+ {
+ 	if(p != TRXPOS)
+ 	{
+ 		dummy_call();
+ 	}
+ 
+ 	TRXPOS = (GSVector4i)p;
+ }
+ 
+ // { dg-final { scan-assembler-not "%mm" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/other/i386-2.C gcc-5.5.0/gcc/testsuite/g++.dg/other/i386-2.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/other/i386-2.C	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/testsuite/g++.dg/other/i386-2.C	Thu Oct 13 21:19:00 2016
***************
*** 1,5 ****
  /* { dg-do compile { target i?86-*-* x86_64-*-* } } */
! /* { dg-options "-O -pedantic-errors -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt  -mavx512dq -mavx512bw -mavx512vl -mavx512ifma -mavx512vbmi -mclwb -mpcommit -mmwaitx" } */
  
  /* Test that {,x,e,p,t,s,w,a,b,i}mmintrin.h, mm3dnow.h, fma4intrin.h,
     xopintrin.h, abmintrin.h, bmiintrin.h, tbmintrin.h, lwpintrin.h,
--- 1,5 ----
  /* { dg-do compile { target i?86-*-* x86_64-*-* } } */
! /* { dg-options "-O -pedantic-errors -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt  -mavx512dq -mavx512bw -mavx512vl -mavx512ifma -mavx512vbmi -mclwb -mmwaitx" } */
  
  /* Test that {,x,e,p,t,s,w,a,b,i}mmintrin.h, mm3dnow.h, fma4intrin.h,
     xopintrin.h, abmintrin.h, bmiintrin.h, tbmintrin.h, lwpintrin.h,
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/other/i386-3.C gcc-5.5.0/gcc/testsuite/g++.dg/other/i386-3.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/other/i386-3.C	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/testsuite/g++.dg/other/i386-3.C	Thu Oct 13 21:19:00 2016
***************
*** 1,5 ****
  /* { dg-do compile { target i?86-*-* x86_64-*-* } } */
! /* { dg-options "-O -fkeep-inline-functions -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt -mavx512dq -mavx512bw -mavx512vl -mavx512ifma -mavx512vbmi -mclwb -mpcommit -mmwaitx" } */
  
  /* Test that {,x,e,p,t,s,w,a,b,i}mmintrin.h, mm3dnow.h, fma4intrin.h,
     xopintrin.h, abmintrin.h, bmiintrin.h, tbmintrin.h, lwpintrin.h,
--- 1,5 ----
  /* { dg-do compile { target i?86-*-* x86_64-*-* } } */
! /* { dg-options "-O -fkeep-inline-functions -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt -mavx512dq -mavx512bw -mavx512vl -mavx512ifma -mavx512vbmi -mclwb -mmwaitx" } */
  
  /* Test that {,x,e,p,t,s,w,a,b,i}mmintrin.h, mm3dnow.h, fma4intrin.h,
     xopintrin.h, abmintrin.h, bmiintrin.h, tbmintrin.h, lwpintrin.h,
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/parse/pr71909.C gcc-5.5.0/gcc/testsuite/g++.dg/parse/pr71909.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/parse/pr71909.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/parse/pr71909.C	Wed Jul 20 14:16:40 2016
***************
*** 0 ****
--- 1,22 ----
+ // PR c++/71909
+ // { dg-do compile }
+ 
+ struct S
+ {
+   S () try : m (0) {}
+   catch (...) {}
+   void foo () try {}
+   catch (int) {}
+   catch (...) {}
+   int m;
+ };
+ 
+ struct T
+ {
+   T () : m (0) {}
+   catch (...) {}	// { dg-error "expected unqualified-id before" }
+   void foo () {}
+   catch (int) {}	// { dg-error "expected unqualified-id before" }
+   catch (...) {}	// { dg-error "expected unqualified-id before" }
+   int m;
+ };
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/pr71389.C gcc-5.5.0/gcc/testsuite/g++.dg/pr71389.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/pr71389.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/pr71389.C	Tue Jun  7 15:23:42 2016
***************
*** 0 ****
--- 1,23 ----
+ // { dg-do compile { target i?86-*-* x86_64-*-* } }
+ // { dg-options "-std=c++11 -O3 -march=ivybridge" }
+ 
+ #include <functional>
+ 
+ extern int le_s6, le_s9, le_s11;
+ long foo_v14[16][16];
+ 
+ void fn1() {
+   std::array<std::array<int, 16>, 16> v13;
+   for (; le_s6;)
+     for (int k1 = 2; k1 < 4; k1 = k1 + 1) {
+       for (int n1 = 0; n1 < le_s9; n1 = 8) {
+         *foo_v14[6] = 20923310;
+         for (int i2 = n1; i2 < n1 + 8; i2 = i2 + 1)
+           v13.at(5).at(i2 + 6 - n1) = 306146921;
+       }
+ 
+       for (int l2 = 0; l2 < le_s11; l2 = l2 + 1)
+           *(l2 + v13.at(5).begin()) = 306146921;
+     }
+   v13.at(le_s6 - 4);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/pr77812.C gcc-5.5.0/gcc/testsuite/g++.dg/pr77812.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/pr77812.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/pr77812.C	Thu Jan 12 12:40:28 2017
***************
*** 0 ****
--- 1,18 ----
+ // PR77812
+ // struct-stat hack failure when first overload is a template
+ 
+ enum f {};
+ 
+ template <typename>
+ void f ()
+ {
+ }
+ enum f F;
+ 
+ struct g {};
+ 
+ template <typename>
+ void g ()
+ {
+ }
+ struct g G;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/pr79761.C gcc-5.5.0/gcc/testsuite/g++.dg/pr79761.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/pr79761.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/pr79761.C	Wed Mar 22 12:29:36 2017
***************
*** 0 ****
--- 1,34 ----
+ /* { dg-do compile { target { { i?86-*-* x86_64-*-* } && { ! x32 } } } } */
+ /* { dg-options "-fcheck-pointer-bounds -mmpx -mabi=ms" } */
+ 
+ struct Foo
+ {
+   Foo() : a(1), b(1), c('a') {}
+   int a;
+   int b;
+   char c;
+ };
+ 
+ static Foo copy_foo(Foo) __attribute__((noinline, noclone));
+ 
+ static Foo copy_foo(Foo A)
+ {
+   return A;
+ }
+ 
+ struct Bar : Foo
+ {
+   Bar(Foo t) : Foo(copy_foo(t)) {}
+ };
+ 
+ Foo F;
+ 
+ int main (void)
+ {
+   Bar B (F);
+ 
+   if (B.a != 1 || B.b != 1 || B.c != 'a')
+     __builtin_abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/pr79769.C gcc-5.5.0/gcc/testsuite/g++.dg/pr79769.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/pr79769.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/pr79769.C	Wed Mar 22 12:31:53 2017
***************
*** 0 ****
--- 1,4 ----
+ /* { dg-do compile { target { { i?86-*-* x86_64-*-* } && { ! x32 } } } } */
+ /* { dg-options "-fcheck-pointer-bounds -mmpx -mabi=ms" } */
+ 
+ void a (_Complex) { a (3); }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/template/init11.C gcc-5.5.0/gcc/testsuite/g++.dg/template/init11.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/template/init11.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/template/init11.C	Mon Sep 18 18:34:03 2017
***************
*** 0 ****
--- 1,9 ----
+ // PR c++/79607
+ // { dg-do compile { target c++11 } }
+ 
+ template<typename T> struct A
+ {
+   static const int i = int{T{}};
+ };
+ 
+ A<int> a;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/tls/pr77285-1.C gcc-5.5.0/gcc/testsuite/g++.dg/tls/pr77285-1.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/tls/pr77285-1.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/tls/pr77285-1.C	Tue May 30 07:41:57 2017
***************
*** 0 ****
--- 1,7 ----
+ // { dg-do link { target c++11 } }
+ // { dg-require-effective-target tls }
+ // { dg-additional-sources pr77285-2.C }
+ 
+ struct __attribute__((abi_tag("tag"))) X { ~X () {} int i = 0; };
+ thread_local X var1;
+ X var2;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/tls/pr77285-2.C gcc-5.5.0/gcc/testsuite/g++.dg/tls/pr77285-2.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/tls/pr77285-2.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/tls/pr77285-2.C	Tue May 30 07:41:57 2017
***************
*** 0 ****
--- 1,17 ----
+ // PR c++/77285
+ // { dg-do compile { target c++11 } }
+ // { dg-require-effective-target tls }
+ // { dg-final { scan-assembler "_Z4var1B3tag" } }
+ // { dg-final { scan-assembler "_Z4var2B3tag" } }
+ // { dg-final { scan-assembler "_ZTH4var1B3tag" } }
+ // { dg-final { scan-assembler "_ZTW4var1B3tag" } }
+ 
+ struct __attribute__((abi_tag("tag"))) X { ~X () {} int i = 0; };
+ extern thread_local X var1;
+ extern X var2;
+ 
+ int
+ main ()
+ {
+  return var1.i + var2.i;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/tm/pr71909.C gcc-5.5.0/gcc/testsuite/g++.dg/tm/pr71909.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/tm/pr71909.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/tm/pr71909.C	Wed Jul 20 14:16:40 2016
***************
*** 0 ****
--- 1,18 ----
+ // PR c++/71909
+ // { dg-do compile { target c++11 } }
+ // { dg-options "-fgnu-tm" }
+ 
+ struct S
+ {
+   S () __transaction_atomic [[outer]] try : m {0} {} catch (int) {} catch (...) {}
+   int m;
+ };
+ 
+ struct T
+ {
+   T () __transaction_atomic __attribute__((outer)) try : m {0} {} catch (int) {} catch (...) {}
+   int m;
+ };
+ 
+ void foo () __transaction_atomic [[outer]] try {} catch (int) {} catch (...) {}
+ void bar () __transaction_atomic __attribute__((outer)) try {} catch (int) {} catch (...) {}
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr71452.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr71452.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr71452.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr71452.C	Thu Jul  7 10:33:01 2016
***************
*** 0 ****
--- 1,10 ----
+ // { dg-do run }
+ 
+ int main()
+ {
+   bool b;
+   *(char *)&b = 123;
+   if (*(char *)&b != 123)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr71874.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr71874.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr71874.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr71874.C	Tue Jul 19 17:39:26 2016
***************
*** 0 ****
--- 1,12 ----
+ // PR middle-end/71874
+ // { dg-do run }
+ 
+ int
+ main ()
+ {
+   char str[] = "abcdefghijklmnopqrstuvwxyzABCDEF";
+   __builtin_memmove (str + 20, str + 15, 11);
+   if (__builtin_strcmp (str, "abcdefghijklmnopqrstpqrstuvwxyzF") != 0)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr77745.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr77745.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr77745.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr77745.C	Thu Jan 26 08:16:37 2017
***************
*** 0 ****
--- 1,25 ----
+ // { dg-do run }
+ // { dg-additional-options "-std=gnu++14" }
+ 
+ inline void* operator new(__SIZE_TYPE__, void* __p) noexcept { return __p; }
+ 
+ long foo(char *c1, char *c2)
+ {
+   long *p1 = new (c1) long;
+   *p1 = 100;
+   long long *p2 = new (c2) long long;
+   *p2 = 200;
+   long *p3 = new (c2) long;
+   *p3 = 200;
+   return *p1;
+ }
+ int main()
+ {
+   union {
+       char c;
+       long l;
+       long long ll;
+   } c;
+   if (foo(&c.c, &c.c) != 200)
+     __builtin_abort();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr77919-2.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr77919-2.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr77919-2.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr77919-2.C	Tue May 30 07:36:52 2017
***************
*** 0 ****
--- 1,10 ----
+ // PR rtl-optimization/77919
+ // { dg-do compile }
+ 
+ typedef _Complex long long B;
+ struct A { A (double) {} _Complex double i; };
+ typedef struct { B b; } C;
+ struct D { D (const B &x) : b (x) {} B b; };
+ static inline B foo (const double *x) { C *a; a = (C *) x; return a->b; }
+ static inline D baz (const A &x) { return foo ((double *) &x); }
+ D b = baz (0);
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr77919.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr77919.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr77919.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr77919.C	Tue May 30 07:36:13 2017
***************
*** 0 ****
--- 1,11 ----
+ // PR rtl-optimization/77919
+ // { dg-do compile }
+ // { dg-additional-options "-Wno-psabi" }
+ 
+ struct A { A (double) {} _Complex double i; };
+ typedef int __attribute__ ((vector_size (16))) B;
+ typedef struct { B b; } C;
+ struct D { D (const B &x) : b (x) {} B b; };
+ static inline B foo (const double *x) { C *a; a = (C *) x; return a->b; }
+ static inline D baz (const A &x) { return foo ((double *) &x); }
+ D b = baz (0);
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr78224.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr78224.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr78224.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr78224.C	Thu Jan 26 13:08:43 2017
***************
*** 0 ****
--- 1,51 ----
+ // { dg-do compile }
+ 
+ extern "C"{
+   float sqrtf(float);
+ }
+ 
+ inline float squareroot(const float f)
+ {
+   return sqrtf(f);
+ }
+ 
+ inline int squareroot(const int f)
+ {
+   return static_cast<int>(sqrtf(static_cast<float>(f)));
+ }
+ 
+ template <class T>
+ class vector2d
+ {
+ public:
+   vector2d(T nx, T ny) : X(nx), Y(ny) {}
+   T getLength() const { return squareroot( X*X + Y*Y ); }
+   T X;
+   T Y;
+ };
+ 
+ vector2d<int> getMousePos();
+ 
+ class Client
+ {
+ public:
+   Client();
+   ~Client();
+ };
+ 
+ void the_game(float turn_amount)
+ {
+   Client client;
+   bool first = true;
+ 
+   while (1) {
+       if (first) {
+         first = false;
+       } else {
+         int dx = getMousePos().X;
+         int dy = getMousePos().Y;
+ 
+         turn_amount = vector2d<float>(dx, dy).getLength();
+       }
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr79034.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr79034.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr79034.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr79034.C	Thu Jan 26 13:08:43 2017
***************
*** 0 ****
--- 1,52 ----
+ /* { dg-do compile } */
+ 
+ extern "C" {
+     float sqrtf(float);
+ }
+ 
+ class T {
+ public:
+     float floats[1];
+ 
+     inline float length() const {
+ 	return sqrtf(floats[0]);
+     }
+ };
+ 
+ void destruct(void *);
+ 
+ class Container {
+ 
+     T Ts[1];
+ 
+ public:
+     ~Container() {
+ 	destruct((void *)Ts);
+     }
+ 
+     T& operator[](int n) {
+ 	return Ts[0];
+     }
+ };
+ 
+ void fill(Container&);
+ 
+ void doit()
+ {
+   Container data;
+   float max = 10;
+ 
+   int i, j, k;
+ 
+   for (i = 0; i < 10; i++) {
+       for (j = 1; j < 10; j++) {
+ 	  if (max < 5)
+ 	    break;
+ 	  fill( data);
+ 	  max = data[0].length();
+ 	  for (k = 1; k < j; k++) {
+ 	      max = 5;
+ 	  }
+       }
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr80129.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr80129.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr80129.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr80129.C	Tue May 30 08:17:18 2017
***************
*** 0 ****
--- 1,14 ----
+ // PR c++/80129
+ // { dg-do run }
+ // { dg-options "-std=c++11" }
+ 
+ struct A { bool a; int b; };
+ 
+ int
+ main ()
+ {
+   bool c = false;
+   const A x = c ? A {true, 1} : A {false, 0};
+   if (x.a)
+     __builtin_abort ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr80171.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr80171.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr80171.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr80171.C	Mon Sep 18 13:14:45 2017
***************
*** 0 ****
--- 1,184 ----
+ // { dg-do compile }
+ // { dg-additional-options "-std=c++11" }
+ 
+ template <typename> struct remove_reference;
+ template <typename _Tp> struct remove_reference<_Tp &> { typedef _Tp type; };
+ template <typename _Tp> typename remove_reference<_Tp>::type move(_Tp &&p1) {
+   return static_cast<typename remove_reference<_Tp>::type &&>(p1);
+ }
+ void *operator new(__SIZE_TYPE__, void *p2) { return p2; }
+ struct Trans_NS__v1_GenericTlv {
+   virtual int getMinimumValueLength();
+   virtual unsigned long getValueLength() const;
+ };
+ struct IPv4NeighborAddressSubTlv;
+ struct Trans_NS__v1_GenericTlvBase : Trans_NS__v1_GenericTlv {
+   virtual bool operator==(const IPv4NeighborAddressSubTlv &) const;
+ };
+ struct Trans_NS__v1_GenericUnsupportedTlv;
+ template <typename> struct backup_holder {
+   Trans_NS__v1_GenericUnsupportedTlv *backup_;
+   Trans_NS__v1_GenericUnsupportedTlv &get() { return *backup_; }
+ };
+ template <typename> struct make_reference_content {
+   typedef IPv4NeighborAddressSubTlv type;
+ };
+ template <typename> struct unwrap_recursive {
+   typedef IPv4NeighborAddressSubTlv type;
+ };
+ template <typename> struct begin_impl;
+ template <typename Sequence> struct begin {
+   typedef typename Sequence::tag tag_;
+   typedef typename begin_impl<tag_>::template apply<Sequence>::type type;
+ };
+ struct long_ {
+   static const int value = 0;
+ };
+ template <typename> struct O1_size_impl;
+ template <typename Sequence>
+ struct O1_size
+     : O1_size_impl<typename Sequence::tag>::template apply<Sequence> {};
+ template <typename F, typename T2>
+ struct apply_wrap2 : F::template apply<int, T2> {};
+ template <int, typename, typename> struct iter_fold_impl;
+ template <typename First, typename ForwardOp>
+ struct iter_fold_impl<0, First, ForwardOp> {
+   typedef typename apply_wrap2<ForwardOp, First>::type state;
+ };
+ template <typename Sequence, typename ForwardOp> struct iter_fold {
+   typedef
+       typename iter_fold_impl<O1_size<Sequence>::value,
+                               typename begin<Sequence>::type, ForwardOp>::state
+           type;
+ };
+ template <typename> struct deref;
+ template <typename T1> struct pair { typedef T1 first; };
+ struct make_initializer_node {
+   template <typename, typename Iterator> struct apply {
+     struct initializer_node {
+       typedef typename deref<Iterator>::type recursive_enabled_T;
+       static int
+       initialize(void *p1,
+                  typename unwrap_recursive<recursive_enabled_T>::type) {
+         new (p1) typename make_reference_content<recursive_enabled_T>::type;
+       }
+     };
+     typedef pair<initializer_node> type;
+   };
+ };
+ struct l_item {
+   typedef int tag;
+   typedef l_item type;
+   typedef long_ size;
+   typedef int item;
+ };
+ template <> struct O1_size_impl<int> {
+   template <typename List> struct apply : List::size {};
+ };
+ template <typename> struct l_iter;
+ template <typename Node> struct deref<l_iter<Node>> {
+   typedef typename Node::item type;
+ };
+ template <> struct begin_impl<int> {
+   template <typename List> struct apply {
+     typedef l_iter<typename List::type> type;
+   };
+ };
+ template <typename, typename, typename, typename, typename, typename, typename>
+ struct list : l_item {};
+ template <typename... T> struct make_variant_list { typedef list<T...> type; };
+ template <typename T> T cast_storage(void *p1) { return *static_cast<T *>(p1); }
+ struct visitation_impl_step {
+   typedef Trans_NS__v1_GenericUnsupportedTlv type;
+ };
+ template <typename Visitor, typename VoidPtrCV, typename T>
+ void visitation_impl_invoke_impl(Visitor p1, VoidPtrCV p2, T *) {
+   backup_holder<Trans_NS__v1_GenericUnsupportedTlv> __trans_tmp_8 =
+       cast_storage<backup_holder<T>>(p2);
+   p1.internal_visit(__trans_tmp_8, 0);
+ }
+ template <typename Visitor, typename VoidPtrCV, typename T,
+           typename NoBackupFlag>
+ void visitation_impl_invoke(Visitor p1, VoidPtrCV p2, T p3, NoBackupFlag) {
+   visitation_impl_invoke_impl(p1, p2, p3);
+ }
+ template <typename Which, typename step0, typename Visitor, typename VoidPtrCV,
+           typename NoBackupFlag>
+ void visitation_impl(Visitor p1, VoidPtrCV p2, NoBackupFlag, Which, step0 *) {
+   visitation_impl_invoke(p1, p2, static_cast<typename step0::type *>(0), 0);
+ }
+ struct move_into {
+   move_into(void *);
+   template <typename T> void internal_visit(backup_holder<T> p1, int) {
+     T __trans_tmp_2 = p1.get();
+     new (0) T(__trans_tmp_2);
+   }
+ };
+ template <typename, typename... TN> struct variant {
+   struct initializer : iter_fold<typename make_variant_list<int, TN...>::type,
+                                  make_initializer_node>::type::first {};
+   template <typename T> void convert_construct(T p1, int) {
+     void *__trans_tmp_9 = this;
+     initializer::initialize(__trans_tmp_9, p1);
+   }
+   template <typename T> variant(T p1) { convert_construct(p1, 0); }
+   variant(variant &&p1) {
+     move_into visitor(0);
+     p1.internal_apply_visitor(visitor);
+   }
+   template <typename Visitor> void internal_apply_visitor(Visitor p1) {
+     void *__trans_tmp_10 = this;
+     visitation_impl(p1, __trans_tmp_10, 0, 0,
+                     static_cast<visitation_impl_step *>(0));
+   }
+ };
+ template <class...> struct generic_element_tlvs;
+ template <typename TlvConfig, class UnsupportedTlvClass, class TlvF,
+           class... TlvR>
+ struct generic_element_tlvs<TlvConfig, UnsupportedTlvClass, TlvF, TlvR...> {
+   typedef variant<UnsupportedTlvClass, TlvF, TlvR...> variant_type;
+ };
+ template <typename, typename> struct Trans_NS__v1_GenericTlvContainer {
+   template <class TlvClass> void addTlv(const TlvClass &);
+ };
+ template <typename TlvConfig, typename ElementTlvs>
+ template <class TlvClass>
+ void Trans_NS__v1_GenericTlvContainer<TlvConfig, ElementTlvs>::addTlv(
+     const TlvClass &p1) {
+   typename ElementTlvs::variant_type wrap(p1);
+   move(wrap);
+ }
+ template <typename ElementTlvs>
+ struct Trans_NS__v1_GenericContainerEntryBase
+     : Trans_NS__v1_GenericTlvContainer<int, ElementTlvs> {};
+ template <class>
+ struct Trans_NS__v1_GenericFixedLengthTlvBase : Trans_NS__v1_GenericTlvBase {
+   unsigned long getValueLength() const;
+ };
+ struct Trans_NS__v1_GenericUnsupportedTlv : Trans_NS__v1_GenericTlv {
+   long getHeaderLengthconst;
+ };
+ using isis_tlv_config = int;
+ template <class... TlvClasses>
+ using isis_element_tlvs =
+     generic_element_tlvs<isis_tlv_config, Trans_NS__v1_GenericUnsupportedTlv,
+                          TlvClasses...>;
+ template <int, class, typename ElementTlvs>
+ using ContainerEntryBase = Trans_NS__v1_GenericContainerEntryBase<ElementTlvs>;
+ template <int, class ImplClass, int>
+ using FixedLengthTlvBase = Trans_NS__v1_GenericFixedLengthTlvBase<ImplClass>;
+ struct IPv4NeighborAddressSubTlv
+     : FixedLengthTlvBase<0, IPv4NeighborAddressSubTlv, 0> {
+   bool operator==(const IPv4NeighborAddressSubTlv &) const;
+ };
+ void test() {
+   ContainerEntryBase<
+       0, int,
+       isis_element_tlvs<
+           FixedLengthTlvBase<0, int, 0>, FixedLengthTlvBase<0, int, 0>,
+           IPv4NeighborAddressSubTlv, FixedLengthTlvBase<0, int, 0>,
+           FixedLengthTlvBase<0, int, 0>, FixedLengthTlvBase<0, int, 0>>>
+       isEntry;
+   IPv4NeighborAddressSubTlv nbAddressSubTlv;
+   isEntry.addTlv(nbAddressSubTlv);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr80334.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr80334.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr80334.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr80334.C	Wed May 10 07:53:45 2017
***************
*** 0 ****
--- 1,19 ----
+ // { dg-do run }
+ // { dg-additional-options "-std=c++11" }
+ 
+ struct A { alignas(16) char c; };
+ struct B { A unpacked; char d; } __attribute__((packed));
+ 
+ char x;
+ 
+ int
+ main()
+ {
+   alignas(__BIGGEST_ALIGNMENT__) B b[3];
+   for (int i = 0; i < 3; i++) b[i].unpacked.c = 'a' + i;
+   for (int i = 0; i < 3; i++)
+     {
+       auto a = new A(b[i].unpacked);
+       x = a->c;
+     }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr81354.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr81354.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr81354.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr81354.C	Wed Aug 16 14:13:27 2017
***************
*** 0 ****
--- 1,24 ----
+ // PR81354 reported this test as crashing in a limited range of revisions.
+ // { dg-do compile }
+ 
+ struct T { double a; double b; };
+ 
+ void foo(T Ad[], int As[2])
+ {
+   int j;
+   int i;
+   int Bs[2] = {0,0};
+   T Bd[16];
+ 
+   for (j = 0; j < 4; j++) {
+     for (i = 0; i + 1 <= j + 1; i++) {
+       Ad[i + As[0] * j] = Bd[i + Bs[0] * j];
+     }
+ 
+     i = j + 1;  // <- comment out this line and it does not crash
+     for (; i + 1 < 5; i++) {
+       Ad[i + As[0] * j].a = 0.0;
+       Ad[i + As[0] * j].b = 0.0;
+     }
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr81987.C gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr81987.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/torture/pr81987.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/torture/pr81987.C	Wed Sep  6 18:48:50 2017
***************
*** 0 ****
--- 1,61 ----
+ extern short var_1;
+ extern const short var_3;
+ extern unsigned long int var_9;
+ extern short var_13;
+ extern const unsigned long int var_15;
+ extern const unsigned long int var_37;
+ extern unsigned long int var_40;
+ extern long long int var_47;
+ extern short var_48;
+ extern const short var_54;
+ extern long long int var_79;
+ extern long long int var_81;
+ extern long long int var_94;
+ extern long long int var_95;
+ extern long long int var_701;
+ extern unsigned long int var_786;
+ extern short var_788;
+ extern long long int var_844;
+ 
+ struct struct_1 {
+   short member_1_2 : 15;
+   static long long int member_1_3;
+ };
+ 
+ extern struct_1 struct_obj_6;
+ extern struct_1 struct_obj_8;
+ 
+ void foo() {
+   int a = var_3 <= 602154393864UL;
+   if (var_81 ? 0 : var_3 && var_9)
+     ;
+   else {
+     var_94 = 0;
+     if (var_3 && var_48 || var_13) {
+       if (var_48)
+ 	var_95 = 0;
+       short b((2364461588881776511UL + var_3) * (2 ? var_13 : 0) || var_1);
+       struct_obj_8.member_1_2 = b;
+       if (var_15) {
+ 	if (var_81)
+ 	  if (var_47)
+ 	    ;
+ 	  else if (var_40)
+ 	    var_701 = 0;
+       } else {
+ 	if (var_40)
+ 	  var_79 = 0;
+ 	if (var_54) {
+ 	  if (var_37)
+ 	    var_786 = 0;
+ 	  else
+ 	    var_788 = 0;
+ 	            struct_obj_6.member_1_3 =
+ 		      (2364461588881776511UL + var_3) * (2 ? var_13 : 0);
+ 	}
+       }
+       if ((2364461588881776511UL + var_3) * (2 ? var_13 : 0))
+ 	var_844 = 0;
+     }
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/tree-ssa/pr77943.C gcc-5.5.0/gcc/testsuite/g++.dg/tree-ssa/pr77943.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/tree-ssa/pr77943.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/tree-ssa/pr77943.C	Mon Oct 17 13:19:04 2016
***************
*** 0 ****
--- 1,25 ----
+ /* { dg-do run } */
+ /* { dg-options "-O2 -std=c++11" } */
+ 
+ void thrower[[gnu::noinline]]() {
+     throw 1;
+ }
+ 
+ inline void fatal() noexcept {thrower();}
+ inline void notFatal() {thrower();}
+ 
+ void func(bool callFatal) {
+     if (callFatal) {
+         fatal();
+     } else { 
+         notFatal();
+     }
+ }
+ 
+ int main(int argc, const char* argv[]) {
+     try {
+         bool callFatal = argc > 1;
+         func(callFatal);
+     } catch (...) {
+     }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ubsan/return-4.C gcc-5.5.0/gcc/testsuite/g++.dg/ubsan/return-4.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ubsan/return-4.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ubsan/return-4.C	Tue May 30 07:31:03 2017
***************
*** 0 ****
--- 1,18 ----
+ // PR c++/77722
+ // { dg-do run }
+ // { dg-options "-fsanitize=return -w" }
+ // { dg-shouldfail "ubsan" }
+ 
+ int
+ foo ()
+ {
+ }
+ 
+ int
+ main ()
+ {
+   foo ();
+   return 0;
+ }
+ 
+ // { dg-output "execution reached the end of a value-returning function without returning a value" }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ubsan/return-5.C gcc-5.5.0/gcc/testsuite/g++.dg/ubsan/return-5.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ubsan/return-5.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ubsan/return-5.C	Tue May 30 07:31:03 2017
***************
*** 0 ****
--- 1,19 ----
+ // PR c++/77722
+ // { dg-do run }
+ // { dg-options "-fsanitize=return -w" }
+ // { dg-shouldfail "ubsan" }
+ 
+ int
+ foo ()
+ {
+   int a = 5;
+ }
+ 
+ int
+ main ()
+ {
+   foo ();
+   return 0;
+ }
+ 
+ // { dg-output "execution reached the end of a value-returning function without returning a value" }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/ubsan/return-6.C gcc-5.5.0/gcc/testsuite/g++.dg/ubsan/return-6.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/ubsan/return-6.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/ubsan/return-6.C	Tue May 30 07:31:03 2017
***************
*** 0 ****
--- 1,20 ----
+ // PR c++/77722
+ // { dg-do run }
+ // { dg-options "-fsanitize=return -w" }
+ // { dg-shouldfail "ubsan" }
+ 
+ int
+ foo ()
+ {
+   int a = 5;
+   int b = 5;
+ }
+ 
+ int
+ main ()
+ {
+   foo ();
+   return 0;
+ }
+ 
+ // { dg-output "execution reached the end of a value-returning function without returning a value" }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/vect/pr36648.cc gcc-5.5.0/gcc/testsuite/g++.dg/vect/pr36648.cc
*** gcc-5.4.0/gcc/testsuite/g++.dg/vect/pr36648.cc	Fri Nov 14 20:15:11 2008
--- gcc-5.5.0/gcc/testsuite/g++.dg/vect/pr36648.cc	Fri Feb  3 19:06:58 2017
*************** Foo foo;
*** 17,24 ****
  
  int main() { }
  
! /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { !  vect_no_align } } } } */
! /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target { ! vect_no_align } } } } */
  /* { dg-final { cleanup-tree-dump "vect" } } */
  
  
--- 17,29 ----
  
  int main() { }
  
! /* On older powerpc hardware (POWER7 and earlier), the default flag
!    -mno-allow-movmisalign prevents vectorization.  On POWER8 and later,
!    when vect_hw_misalign is true, vectorization occurs.  For other
!    targets, ! vect_no_align is a sufficient test.  */
!  
! /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { { { !  vect_no_align } && { ! powerpc*-*-* } } || { powerpc*-*-* && vect_hw_misalign } } } } } */
! /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target { { { ! vect_no_align } && { ! powerpc*-*-* } } || { powerpc*-*-* && vect_hw_misalign } } } } } */
  /* { dg-final { cleanup-tree-dump "vect" } } */
  
  
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/vect/simd-clone-7.cc gcc-5.5.0/gcc/testsuite/g++.dg/vect/simd-clone-7.cc
*** gcc-5.4.0/gcc/testsuite/g++.dg/vect/simd-clone-7.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/vect/simd-clone-7.cc	Tue May 30 07:42:48 2017
***************
*** 0 ****
--- 1,10 ----
+ // PR middle-end/67335
+ // { dg-do compile }
+ // { dg-additional-options "-fopenmp-simd" }
+ 
+ #pragma omp declare simd notinbranch uniform(y)
+ float
+ bar (float x, float *y, int)
+ {
+   return y[0] + y[1] * x;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/g++.dg/warn/Wunused-var-26.C gcc-5.5.0/gcc/testsuite/g++.dg/warn/Wunused-var-26.C
*** gcc-5.4.0/gcc/testsuite/g++.dg/warn/Wunused-var-26.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/g++.dg/warn/Wunused-var-26.C	Tue Mar 21 23:56:52 2017
***************
*** 0 ****
--- 1,147 ----
+ // PR c++/79548 - missing -Wunused-variable on a typedef'd variable
+ // in a function template
+ // { dg-do compile }
+ // { dg-options "-Wunused" }
+ 
+ 
+ #define UNUSED __attribute__ ((unused))
+ 
+ template <class T>
+ void f_int ()
+ {
+   T t;                        // { dg-warning "unused variable" }
+ 
+   typedef T U;
+   U u;                        // { dg-warning "unused variable" }
+ }
+ 
+ template void f_int<int>();
+ 
+ 
+ template <class T>
+ void f_intptr ()
+ {
+   T *t = 0;                   // { dg-warning "unused variable" }
+ 
+   typedef T U;
+   U *u = 0;                   // { dg-warning "unused variable" }
+ }
+ 
+ template void f_intptr<int>();
+ 
+ 
+ template <class T>
+ void f_var_unused ()
+ {
+   // The variable is marked unused.
+   T t UNUSED;
+ 
+   typedef T U;
+   U u UNUSED;
+ }
+ 
+ template void f_var_unused<int>();
+ 
+ 
+ template <class T>
+ void f_var_type_unused ()
+ {
+   // The variable's type is marked unused.
+   T* UNUSED t = new T;   // { dg-bogus "unused variable" "bug 79585" { xfail *-*-* } }
+ 
+   typedef T U;
+   U* UNUSED u = new U;   // { dg-bogus "unused variable" "bug 79585" { xfail *-*-* } }
+ 
+   typedef T UNUSED U;
+   U v = U ();   // { dg-bogus "unused variable" "bug 79585" }
+ }
+ 
+ template void f_var_type_unused<int>();
+ 
+ 
+ struct A { int i; };
+ 
+ template <class T>
+ void f_A ()
+ {
+   T t;                        // { dg-warning "unused variable" }
+ 
+   typedef T U;
+   U u;                        // { dg-warning "unused variable" }
+ }
+ 
+ template void f_A<A>();
+ 
+ 
+ template <class T>
+ void f_A_unused ()
+ {
+   T t UNUSED;
+ 
+   typedef T U;
+   U u UNUSED;
+ }
+ 
+ template void f_A_unused<A>();
+ 
+ 
+ struct B { B (); };
+ 
+ template <class T>
+ void f_B ()
+ {
+   T t;
+ 
+   typedef T U;
+   U u;
+ }
+ 
+ template void f_B<B>();
+ 
+ 
+ struct NonTrivialDtor { ~NonTrivialDtor (); };
+ 
+ template <class T>
+ void f_with_NonTrivialDtor ()
+ {
+   // Expect no warnings when instantiated on a type with a non-trivial
+   // destructor.
+   T t;
+ 
+   typedef T U;
+   U u;
+ }
+ 
+ template void f_with_NonTrivialDtor<NonTrivialDtor>();
+ 
+ 
+ struct D { NonTrivialDtor b; };
+ 
+ template <class T>
+ void f_D ()
+ {
+   // Same as f_with_NonTrivialDtor but with a class that has a member
+   // with a non-trivial dtor.
+   T t;
+ 
+   typedef T U;
+   U u;
+ }
+ 
+ template void f_D<D>();
+ 
+ 
+ struct UNUSED DeclaredUnused { };
+ 
+ template <class T>
+ void f_with_unused ()
+ {
+   // Expect no warnings when instantiatiated on a type declared
+   // with attribute unused.
+   T t;
+ 
+   typedef T U;
+   U u;
+ }
+ 
+ template void f_with_unused<DeclaredUnused>();
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr37433-1.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr37433-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr37433-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr37433-1.c	Fri Aug 26 09:37:20 2016
***************
*** 0 ****
--- 1,13 ----
+ void
+ regex_subst (void)
+ {
+   const void *subst = "";
+   (*(void (*)(int))subst) (0);
+ }
+ 
+ void
+ foobar (void)
+ {
+   int x;
+   (*(void (*)(void))&x) ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr70633.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr70633.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr70633.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr70633.c	Thu Jul  7 12:40:43 2016
***************
*** 0 ****
--- 1,12 ----
+ /* PR middle-end/70633 */
+ 
+ typedef long V __attribute__((vector_size (4 * sizeof (long))));
+ 
+ void foo (V *);
+ 
+ void
+ bar (void)
+ { 
+   V b = { (long) bar, 0, 0, 0 };
+   foo (&b);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr71693.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr71693.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr71693.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr71693.c	Thu Jun 30 09:08:32 2016
***************
*** 0 ****
--- 1,10 ----
+ /* PR middle-end/71693 */
+ 
+ unsigned short v;
+ 
+ void
+ foo (int x)
+ {
+   v = ((((unsigned short) (0x0001 | (x & 0x0070) | 0x0100) & 0x00ffU) << 8)
+        | (((unsigned short) (0x0001 | (x & 0x0070) | 0x0100) >> 8) & 0x00ffU));
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr79197.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr79197.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr79197.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr79197.c	Tue May 30 07:56:11 2017
***************
*** 0 ****
--- 1,10 ----
+ /* PR target/79197 */
+ 
+ unsigned long b;
+ 
+ unsigned long
+ foo (float *a, float *x)
+ {
+   __builtin_memcpy (a, x, sizeof (float));
+   return *a;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr79411.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr79411.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr79411.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr79411.c	Tue May 30 07:58:01 2017
***************
*** 0 ****
--- 1,22 ----
+ /* PR tree-optimization/79411 */
+ 
+ typedef struct __jmp_buf_tag { char buf[1024]; } jmp_buf[1];
+ extern int setjmp (jmp_buf);
+ extern int bar (unsigned int *);
+ extern jmp_buf *baz (void);
+ struct C { int c1; unsigned int c2, c3, c4; };
+ 
+ void
+ foo (struct C *x, const int *y, unsigned int *z, unsigned int e, unsigned int g)
+ {
+   unsigned int d = 0;
+   unsigned long f;
+   setjmp (*baz ());
+   f = 1 + d;
+   if ((x->c1 || x->c2) && g && (!e || d >= 8))
+     d = 16;
+   else
+     d = 8;
+   if ((!x->c3 && !x->c4 || *y == 0) && !e && bar (z))
+     *z = 1 + f;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr80345.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr80345.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr80345.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr80345.c	Tue Apr 11 08:15:51 2017
***************
*** 0 ****
--- 1,17 ----
+ /* PR tree-optimization/80345 */
+ 
+ typedef long mp_limb_signed_t;
+ void fn1(mp_limb_signed_t p1) {
+   int *a = (int *)1;
+   mp_limb_signed_t i, j;
+   i = 0;
+   for (; i < p1; i++) {
+     j = 0;
+     for (; j <= i; j++)
+       *a++ = 0;
+     j = i + 1;
+     for (; j < p1; j++)
+       a++;
+   }
+ }
+ void fn2() { fn1((mp_limb_signed_t)fn2); }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr82337.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr82337.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/compile/pr82337.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/compile/pr82337.c	Mon Oct  2 18:10:40 2017
***************
*** 0 ****
--- 1,25 ----
+ /* PR82337: SLSR needs to prevent abnormal SSA names from
+    serving as a basis. */
+ char *a, *b, *c;
+ 
+ struct d {
+   short e;
+   char f[];
+ };
+ 
+ extern void j (void);
+ 
+ void
+ g() {
+   struct d *h;
+   char *i;
+   int d;
+   do {
+     i = h->f + d;
+     20 ? j() : 0;
+     i = c;
+     if (__builtin_setjmp (h))
+       b = h->f + d;
+     d = (int)(*i);
+   } while (a);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/alias-1.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/alias-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/alias-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/alias-1.c	Fri Jan 20 12:03:55 2017
***************
*** 0 ****
--- 1,19 ----
+ int val;
+ 
+ int *ptr = &val;
+ float *ptr2 = &val;
+ 
+ __attribute__((optimize ("-fno-strict-aliasing")))
+ typepun ()
+ {
+   *ptr2=0;
+ }
+ 
+ main()
+ {
+   *ptr=1;
+   typepun ();
+   if (*ptr)
+     __builtin_abort ();
+ }
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/ieee/pr72824-2.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/ieee/pr72824-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/ieee/pr72824-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/ieee/pr72824-2.c	Tue May 30 07:13:36 2017
***************
*** 0 ****
--- 1,21 ----
+ /* PR tree-optimization/72824 */
+ 
+ typedef float V __attribute__((vector_size (4 * sizeof (float))));
+ 
+ static inline void
+ foo (V *x, V value)
+ {
+   int i;
+   for (i = 0; i < 32; ++i)
+     x[i] = value;
+ }
+ 
+ int
+ main ()
+ {
+   V x[32];
+   foo (x, (V) { 0.f, -0.f, 0.f, -0.f });
+   if (__builtin_copysignf (1.0, x[3][1]) != -1.0f)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/ieee/pr72824.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/ieee/pr72824.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/ieee/pr72824.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/ieee/pr72824.c	Tue May 30 07:07:25 2017
***************
*** 0 ****
--- 1,19 ----
+ /* PR tree-optimization/72824 */
+ 
+ static inline void
+ foo (float *x, float value)
+ {
+   int i;
+   for (i = 0; i < 32; ++i)
+     x[i] = value;
+ }
+ 
+ int
+ main ()
+ {
+   float x[32];
+   foo (x, -0.f);
+   if (__builtin_copysignf (1.0, x[3]) != -1.0f)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr68390.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr68390.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr68390.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr68390.c	Fri Apr 21 09:23:59 2017
***************
*** 0 ****
--- 1,27 ----
+ /* { dg-do run }  */
+ /* { dg-options "-O2" } */
+ 
+ __attribute__ ((noinline))
+ double direct(int x, ...)
+ {
+   return x*x;
+ }
+ 
+ __attribute__ ((noinline))
+ double broken(double (*indirect)(int x, ...), int v)
+ {
+   return indirect(v);
+ }
+ 
+ int main ()
+ {
+   double d1, d2;
+   int i = 2;
+   d1 = broken (direct, i);
+   if (d1 != i*i)
+     {
+       __builtin_abort ();
+     }
+   return 0;
+ }
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71083.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71083.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71083.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71083.c	Fri Aug 12 18:56:30 2016
***************
*** 0 ****
--- 1,43 ----
+ struct lock_chain {
+   unsigned int irq_context: 2,
+     depth: 6,
+     base: 24;
+ };
+ 
+ __attribute__((noinline, noclone))
+ struct lock_chain * foo (struct lock_chain *chain)
+ {
+   int i;
+   for (i = 0; i < 100; i++)
+     {
+       chain[i+1].base = chain[i].base;
+     }
+   return chain;
+ }
+ 
+ struct lock_chain1 {
+   char x;
+   unsigned short base;
+ } __attribute__((packed));
+ 
+ __attribute__((noinline, noclone))
+ struct lock_chain1 * bar (struct lock_chain1 *chain)
+ {
+   int i;
+   for (i = 0; i < 100; i++)
+     {
+       chain[i+1].base = chain[i].base;
+     }
+   return chain;
+ }
+ 
+ struct lock_chain test [101];
+ struct lock_chain1 test1 [101];
+ 
+ int
+ main ()
+ {
+   foo (test);
+   bar (test1);
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71494.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71494.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71494.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71494.c	Thu Jul  7 12:43:50 2016
***************
*** 0 ****
--- 1,22 ----
+ /* PR middle-end/71494 */
+ 
+ int
+ main ()
+ {
+   void *label = &&out;
+   int i = 0;
+   void test (void)
+   {
+     label = &&out2;
+     goto *label;
+    out2:;
+     i++;
+   }
+   goto *label;
+  out:
+   i += 2;
+   test ();
+   if (i != 3)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71554.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71554.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71554.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71554.c	Thu Jun 16 10:38:21 2016
***************
*** 0 ****
--- 1,28 ----
+ /* PR target/71554 */
+ 
+ int v;
+ 
+ __attribute__ ((noinline, noclone)) void
+ bar (void)
+ {
+   v++;
+ }
+ 
+ __attribute__ ((noinline, noclone))
+ void
+ foo (unsigned int x)
+ {
+   signed int y = ((-__INT_MAX__ - 1) / 2);
+   signed int r;
+   if (__builtin_mul_overflow (x, y, &r))
+     bar ();
+ }
+ 
+ int
+ main ()
+ {
+   foo (2);
+   if (v)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71626-1.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71626-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71626-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71626-1.c	Thu Jul  7 12:48:16 2016
***************
*** 0 ****
--- 1,19 ----
+ /* PR middle-end/71626 */
+ 
+ typedef __INTPTR_TYPE__ V __attribute__((__vector_size__(sizeof (__INTPTR_TYPE__))));
+ 
+ __attribute__((noinline, noclone)) V
+ foo ()
+ {
+   V v = { (__INTPTR_TYPE__) foo };
+   return v;
+ }
+ 
+ int
+ main ()
+ {
+   V v = foo ();
+   if (v[0] != (__INTPTR_TYPE__) foo)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71626-2.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71626-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71626-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71626-2.c	Thu Jul  7 12:48:16 2016
***************
*** 0 ****
--- 1,4 ----
+ /* PR middle-end/71626 */
+ /* { dg-additional-options "-fpic" { target fpic } } */
+ 
+ #include "pr71626-1.c"
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71700.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71700.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr71700.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr71700.c	Thu Aug 25 09:26:15 2016
***************
*** 0 ****
--- 1,19 ----
+ struct S
+ {
+   signed f0 : 16;
+   unsigned f1 : 1;
+ };
+ 
+ int b;
+ static struct S c[] = {{-1, 0}, {-1, 0}};
+ struct S d;
+ 
+ int
+ main ()
+ {
+   struct S e = c[0];
+   d = e;
+   if (d.f1 != 0)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr77767.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr77767.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr77767.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr77767.c	Tue May 30 07:51:58 2017
***************
*** 0 ****
--- 1,16 ----
+ /* PR c/77767 */
+ 
+ void
+ foo (int a, int b[a++], int c, int d[c++])
+ {
+   if (a != 2 || c != 2)
+     __builtin_abort ();
+ }
+ 
+ int
+ main ()
+ {
+   int e[10];
+   foo (1, e, 1, e);
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr78378.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr78378.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr78378.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr78378.c	Tue May 30 07:40:21 2017
***************
*** 0 ****
--- 1,18 ----
+ /* PR rtl-optimization/78378 */
+ 
+ unsigned long long __attribute__ ((noinline, noclone))
+ foo (unsigned long long x)
+ {
+   x <<= 41;
+   x /= 232;
+   return 1 + (unsigned short) x;
+ }
+ 
+ int
+ main ()
+ {
+   unsigned long long x = foo (1);
+   if (x != 0x2c24)
+     __builtin_abort();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr78617.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr78617.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr78617.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr78617.c	Tue Jan 17 10:11:20 2017
***************
*** 0 ****
--- 1,25 ----
+ int a = 0;
+ int d = 1;
+ int f = 1;
+ 
+ int fn1() {
+   return a || 1 >> a;
+ }
+ 
+ int fn2(int p1, int p2) {
+   return p2 >= 2 ? p1 : p1 >> 1;
+ }
+ 
+ int fn3(int p1) {
+   return d ^ p1;
+ }
+ 
+ int fn4(int p1, int p2) {
+   return fn3(!d > fn2((f = fn1() - 1000) || p2, p1));
+ }
+ 
+ int main() {
+   if (fn4(0, 0) != 1)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr79043.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr79043.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr79043.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr79043.c	Fri Jan 20 12:09:22 2017
***************
*** 0 ****
--- 1,21 ----
+ /* PR ipa/78791 */
+ 
+ int val;
+ 
+ int *ptr = &val;
+ float *ptr2 = &val;
+ 
+ static
+ __attribute__((always_inline, optimize ("-fno-strict-aliasing")))
+ typepun ()
+ {
+   *ptr2=0;
+ }
+ 
+ main()
+ {
+   *ptr=1;
+   typepun ();
+   if (*ptr)
+     __builtin_abort ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr80692.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr80692.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr80692.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr80692.c	Tue Jun 27 18:24:51 2017
***************
*** 0 ****
--- 1,13 ----
+ /* { dg-require-effective-target dfp } */
+ 
+ int main () {
+ 	_Decimal64 d64 = -0.DD;
+ 
+ 	if (d64 != 0.DD)
+ 		__builtin_abort ();
+ 
+ 	if (d64 != -0.DD)
+ 		__builtin_abort ();
+ 
+ 	return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr81503.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr81503.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr81503.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr81503.c	Tue Sep  5 21:52:01 2017
***************
*** 0 ****
--- 1,15 ----
+ unsigned short a = 41461;
+ unsigned short b = 3419;
+ int c = 0;
+ 
+ void foo() {
+   if (a + b * ~(0 != 5))
+     c = -~(b * ~(0 != 5)) + 2147483647;
+ }
+ 
+ int main() {
+   foo();
+   if (c != 2147476810)
+     return -1;
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr81555.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr81555.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr81555.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr81555.c	Thu Jul 27 09:43:01 2017
***************
*** 0 ****
--- 1,24 ----
+ /* PR tree-optimization/81555 */
+ 
+ unsigned int a = 1, d = 0xfaeU, e = 0xe376U;
+ _Bool b = 0, f = 1;
+ unsigned char g = 1;
+ 
+ void
+ foo (void)
+ {
+   _Bool c = a != b;
+   if (c)
+     f = 0;
+   if (e & c & (unsigned char)d & c)
+     g = 0;
+ }
+ 
+ int
+ main ()
+ {
+   foo ();
+   if (f || g != 1)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr81556.c gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr81556.c
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/execute/pr81556.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/execute/pr81556.c	Thu Jul 27 09:43:01 2017
***************
*** 0 ****
--- 1,23 ----
+ /* PR tree-optimization/81556 */
+ 
+ unsigned long long int b = 0xb82ff73c5c020599ULL;
+ unsigned long long int c = 0xd4e8188733a29d8eULL;
+ unsigned long long int d = 2, f = 1, g = 0, h = 0;
+ unsigned long long int e = 0xf27771784749f32bULL;
+ 
+ __attribute__((noinline, noclone)) void
+ foo (void)
+ {
+   _Bool a = d > 1;
+   g = f % ((d > 1) << 9);
+   h = a & (e & (a & b & c));
+ }
+ 
+ int
+ main ()
+ {
+   foo ();
+   if (g != 1 || h != 0)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.c-torture/unsorted/dump-noaddr.x gcc-5.5.0/gcc/testsuite/gcc.c-torture/unsorted/dump-noaddr.x
*** gcc-5.4.0/gcc/testsuite/gcc.c-torture/unsorted/dump-noaddr.x	Mon Jun 22 09:27:04 2009
--- gcc-5.5.0/gcc/testsuite/gcc.c-torture/unsorted/dump-noaddr.x	Wed Sep 21 15:25:29 2016
*************** proc dump_compare { src options } {
*** 18,24 ****
  	foreach dump1 [lsort [glob -nocomplain dump1/*]] {
  	    regsub dump1/ $dump1 dump2/ dump2
  	    set dumptail "gcc.c-torture/unsorted/[file tail $dump1]"
- 	    #puts "$option $dump1"
  	    set tmp [ diff "$dump1" "$dump2" ]
  	    if { $tmp == 0 } {
  		untested "$dumptail, $option comparison"
--- 18,23 ----
*************** proc dump_compare { src options } {
*** 27,40 ****
  	    } else {
  		fail "$dumptail, $option comparison"
  	    }
- 	    #exec diff $dump1 $dump2
  	}
      }
      file delete -force dump1
      file delete -force dump2
  }
  
! catch {dump_compare $src $options} result
! puts $result
! verbose result
  return 1
--- 26,36 ----
  	    } else {
  		fail "$dumptail, $option comparison"
  	    }
  	}
      }
      file delete -force dump1
      file delete -force dump2
  }
  
! dump_compare $src $options
  return 1
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/Woverride-init-1.c gcc-5.5.0/gcc/testsuite/gcc.dg/Woverride-init-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/Woverride-init-1.c	Sat Sep 30 19:46:06 2006
--- gcc-5.5.0/gcc/testsuite/gcc.dg/Woverride-init-1.c	Sat Nov  5 23:57:13 2016
*************** union u { char a; long long b; };
*** 10,28 ****
  struct s s0 = {
    .a = 1,
    .b = 2,
!   .a = 3, /* { dg-warning "initialized field overwritten|near init" } */
!   4, /* { dg-warning "initialized field overwritten|near init" } */
    5
  };
  
  union u u0 = {
    .a = 1,
!   .b = 2, /* { dg-warning "initialized field overwritten|near init" } */
!   .a = 3 }; /* { dg-warning "initialized field overwritten|near init" } */
  
  int a[5] = {
    [0] = 1,
    [1] = 2,
!   [0] = 3, /* { dg-warning "initialized field overwritten|near init" } */
    [2] = 4
  };
--- 10,28 ----
  struct s s0 = {
    .a = 1,
    .b = 2,
!   .a = 3, /* { dg-warning "initialized field overwritten" } */
!   4, /* { dg-warning "initialized field overwritten" } */
    5
  };
  
  union u u0 = {
    .a = 1,
!   .b = 2, /* { dg-warning "initialized field overwritten" } */
!   .a = 3 }; /* { dg-warning "initialized field overwritten" } */
  
  int a[5] = {
    [0] = 1,
    [1] = 2,
!   [0] = 3, /* { dg-warning "initialized field overwritten" } */
    [2] = 4
  };
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/Woverride-init-2.c gcc-5.5.0/gcc/testsuite/gcc.dg/Woverride-init-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/Woverride-init-2.c	Sat Sep 30 19:46:06 2006
--- gcc-5.5.0/gcc/testsuite/gcc.dg/Woverride-init-2.c	Sat Nov  5 23:57:13 2016
*************** union u { char a; long long b; };
*** 10,28 ****
  struct s s0 = {
    .a = 1,
    .b = 2,
!   .a = 3, /* { dg-warning "initialized field overwritten|near init" } */
!   4, /* { dg-warning "initialized field overwritten|near init" } */
    5
  };
  
  union u u0 = {
    .a = 1,
!   .b = 2, /* { dg-warning "initialized field overwritten|near init" } */
!   .a = 3 }; /* { dg-warning "initialized field overwritten|near init" } */
  
  int a[5] = {
    [0] = 1,
    [1] = 2,
!   [0] = 3, /* { dg-warning "initialized field overwritten|near init" } */
    [2] = 4
  };
--- 10,28 ----
  struct s s0 = {
    .a = 1,
    .b = 2,
!   .a = 3, /* { dg-warning "initialized field overwritten" } */
!   4, /* { dg-warning "initialized field overwritten" } */
    5
  };
  
  union u u0 = {
    .a = 1,
!   .b = 2, /* { dg-warning "initialized field overwritten" } */
!   .a = 3 }; /* { dg-warning "initialized field overwritten" } */
  
  int a[5] = {
    [0] = 1,
    [1] = 2,
!   [0] = 3, /* { dg-warning "initialized field overwritten" } */
    [2] = 4
  };
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/align-3.c gcc-5.5.0/gcc/testsuite/gcc.dg/align-3.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/align-3.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/align-3.c	Mon Sep 18 13:14:45 2017
***************
*** 0 ****
--- 1,11 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O2 -fdump-rtl-expand" } */
+ 
+ typedef struct { char a[2]; } __attribute__((__packed__)) TU2;
+ unsigned short get16_unaligned(const void *p) {
+     unsigned short v;
+     *(TU2 *)(void *)(&v) = *(const TU2 *)p;
+     return v;
+ }
+ 
+ /* { dg-final { scan-rtl-dump "MEM\[^\n\r\]*A8\\\]" "expand" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/asan/pr80166.c gcc-5.5.0/gcc/testsuite/gcc.dg/asan/pr80166.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/asan/pr80166.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/asan/pr80166.c	Mon May 29 09:09:07 2017
***************
*** 0 ****
--- 1,24 ----
+ /* PR sanitizer/80166 */
+ /* { dg-do run } */
+ 
+ #include <sys/types.h>
+ #include <unistd.h>
+ 
+ int
+ main (int argc, char **argv)
+ {
+   gid_t groups;
+   int r = getgroups (0, &groups);
+   if (r < 0)
+     __builtin_abort ();
+ 
+   r = getgroups (-1, &groups);
+   if (r != -1)
+     __builtin_abort ();
+ 
+   r = getgroups (-1, NULL);
+   if (r != -1)
+     __builtin_abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/asan/pr80168.c gcc-5.5.0/gcc/testsuite/gcc.dg/asan/pr80168.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/asan/pr80168.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/asan/pr80168.c	Tue May 30 08:20:45 2017
***************
*** 0 ****
--- 1,12 ----
+ /* PR sanitizer/80168 */
+ /* { dg-do compile } */
+ 
+ int a;
+ 
+ int
+ foo (void)
+ {
+   struct S { int c[a]; int q : 8; int e : 4; } f;
+   f.e = 4;
+   return f.e;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/init-excess-2.c gcc-5.5.0/gcc/testsuite/gcc.dg/init-excess-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/init-excess-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/init-excess-2.c	Sat Nov  5 23:57:13 2016
***************
*** 0 ****
--- 1,48 ----
+ /* Test for diagnostics about excess initializers when using a macro
+    defined in a system header:
+    c/71115 - Missing warning: excess elements in struct initializer.  */
+ /* { dg-do compile } */
+ /* { dg-options "" } */
+ /* { dg-require-effective-target int32plus } */
+ 
+ #include <stddef.h>
+ 
+ int* a[1] = {
+   0,
+   NULL              /* { dg-warning "excess elements|near init" } */
+ };
+ 
+ const char str[1] = {
+   0,
+   NULL              /* { dg-warning "excess elements|near init" } */
+ };
+ 
+ struct S {
+   int *a;
+ } s = {
+   0,
+   NULL              /* { dg-warning "excess elements|near init" } */
+ };
+ 
+ struct __attribute__ ((designated_init)) S2 {
+   int *a;
+ } s2 = {
+   NULL              /* { dg-warning "positional initialization|near init" } */
+ };
+ 
+ union U {
+   int *a;
+ } u = {
+   0,
+   NULL              /* { dg-warning "excess elements|near init" } */
+ };
+ 
+ int __attribute__ ((vector_size (16))) ivec = {
+   0, 0, 0, 0,
+   NULL              /* { dg-warning "excess elements|near init" } */
+ };
+ 
+ int* scal = {
+   0,
+   NULL              /* { dg-warning "excess elements|near init" } */
+ };
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/ipa/pr48195.c gcc-5.5.0/gcc/testsuite/gcc.dg/ipa/pr48195.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/ipa/pr48195.c	Mon Apr 18 14:28:50 2011
--- gcc-5.5.0/gcc/testsuite/gcc.dg/ipa/pr48195.c	Thu Jun 22 11:30:42 2017
***************
*** 1,5 ****
  /* { dg-do link } */
! /* { dg-options "-O2 -flto --param partial-inlining-entry-probability=101" } */
  /* { dg-require-effective-target lto } */
  
  extern void abort(void);
--- 1,5 ----
  /* { dg-do link } */
! /* { dg-options "-O2 -flto --param partial-inlining-entry-probability=100" } */
  /* { dg-require-effective-target lto } */
  
  extern void abort(void);
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/ipa/pr80104.c gcc-5.5.0/gcc/testsuite/gcc.dg/ipa/pr80104.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/ipa/pr80104.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/ipa/pr80104.c	Mon May 29 09:08:14 2017
***************
*** 0 ****
--- 1,15 ----
+ /* PR ipa/80104 */
+ /* { dg-do compile } */
+ /* { dg-options "-fipa-icf" } */
+ 
+ float
+ a (_Complex float b)
+ {
+   return *&b;
+ }
+ 
+ float
+ c (_Complex float b)
+ {
+   return (&b)[0];
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/ipa/pr81696.c gcc-5.5.0/gcc/testsuite/gcc.dg/ipa/pr81696.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/ipa/pr81696.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/ipa/pr81696.c	Fri Sep 15 12:13:42 2017
***************
*** 0 ****
--- 1,26 ----
+ /* { dg-options "-O2 -fdump-ipa-icf-details"  } */
+ 
+ int
+ main (int argc, char **argv)
+ {
+   __label__ lab4, lab5, lab6;
+ 
+   void foo (void) { goto lab4; }
+   void foo2 (void) { goto lab4; }
+   void bar (void) { goto lab5; }
+   void baz (void) { goto lab6; }
+ 
+   if (argc)
+     foo ();
+   else
+     foo2 ();
+ 
+  lab4:;
+   bar ();
+  lab5:;
+   baz ();
+  lab6:;
+   return 0;
+ }
+ 
+ /* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf"  } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/ipa/pr82001.c gcc-5.5.0/gcc/testsuite/gcc.dg/ipa/pr82001.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/ipa/pr82001.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/ipa/pr82001.c	Fri Sep 15 12:14:19 2017
***************
*** 0 ****
--- 1,21 ----
+ /* { dg-do compile { target i?86-*-* x86_64-*-* } } */
+ /* { dg-options "-O2 -fdump-ipa-icf-details"  } */
+ 
+ int
+ mullo (int a, int b)
+ {
+   asm("mul %%edx   # %%1 was %1"
+       : "+"
+ 	"a"(a),
+ 	"+d"(b));
+   return a;
+ }
+ 
+ int
+ mulhi (int a, int b)
+ {
+   asm("mul %%edx   # %%1 was %1" : "+d"(a), "+a"(b));
+   return a;
+ }
+ 
+ /* { dg-final { scan-ipa-dump "Equal symbols: 0" "icf"  } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/lto/pr50199_0.c gcc-5.5.0/gcc/testsuite/gcc.dg/lto/pr50199_0.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/lto/pr50199_0.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/lto/pr50199_0.c	Tue May 30 07:54:21 2017
***************
*** 0 ****
--- 1,17 ----
+ /* PR middle-end/50199 */
+ /* { dg-lto-options {{-O2 -flto -fno-merge-constants --param=lto-min-partition=1}} } */
+ 
+ __attribute__ ((noinline)) const char *
+ foo (const char *x)
+ {
+   return x;
+ }
+ 
+ int
+ main ()
+ {
+   const char *a = "ab";
+   if (a != foo (a))
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/lto/pr69188_0.c gcc-5.5.0/gcc/testsuite/gcc.dg/lto/pr69188_0.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/lto/pr69188_0.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/lto/pr69188_0.c	Mon Jan 23 12:25:17 2017
***************
*** 0 ****
--- 1,8 ----
+ /* PR ipa/69188 */
+ /* { dg-lto-do link } */
+ /* { dg-lto-options { { -flto -O0 -fprofile-generate } } } */
+ /* { dg-require-profiling "-fprofile-generate" } */
+ 
+ void fn1(void)
+ {
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/lto/pr69188_1.c gcc-5.5.0/gcc/testsuite/gcc.dg/lto/pr69188_1.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/lto/pr69188_1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/lto/pr69188_1.c	Mon Jan 23 12:24:54 2017
***************
*** 0 ****
--- 1,10 ----
+ /* PR ipa/69188 */
+ /* { dg-options "-flto -O1 -fprofile-generate" } */
+ 
+ extern void fn1(void);
+ 
+ int main() {
+   fn1();
+   return 0;
+ }
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pch/pr66343-1.c gcc-5.5.0/gcc/testsuite/gcc.dg/pch/pr66343-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pch/pr66343-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pch/pr66343-1.c	Tue May 30 07:34:46 2017
***************
*** 0 ****
--- 1,15 ----
+ /* PR sanitizer/66343 */
+ /* { dg-do assemble } */
+ /* { dg-options "-fsanitize=undefined" } */
+ 
+ #include "pr66343-1.h"
+ 
+ void
+ bar (int a, int b)
+ {
+   a / b;
+ }
+ 
+ /* Hack to turn off PCH assembly comparison, as it is incompatible
+    with dg-do assemble.  The target condition will be always false.  */
+ /* { dg-error "" "" { target { lp64 && { ! lp64 } } } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pch/pr66343-1.hs gcc-5.5.0/gcc/testsuite/gcc.dg/pch/pr66343-1.hs
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pch/pr66343-1.hs	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pch/pr66343-1.hs	Tue May 30 07:34:46 2017
***************
*** 0 ****
--- 1,8 ----
+ /* PR sanitizer/66343 */
+ /* { dg-options "-fsanitize=undefined" } */
+ 
+ void
+ foo (int a, int b)
+ {
+   a / b;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pch/pr66343-2.c gcc-5.5.0/gcc/testsuite/gcc.dg/pch/pr66343-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pch/pr66343-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pch/pr66343-2.c	Tue May 30 07:34:46 2017
***************
*** 0 ****
--- 1,10 ----
+ /* PR sanitizer/66343 */
+ /* { dg-options "-fsanitize=undefined" } */
+ 
+ #include "pr66343-2.h"
+ 
+ void
+ bar (int a, int b)
+ {
+   a / b;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pch/pr66343-2.hs gcc-5.5.0/gcc/testsuite/gcc.dg/pch/pr66343-2.hs
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pch/pr66343-2.hs	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pch/pr66343-2.hs	Tue May 30 07:34:46 2017
***************
*** 0 ****
--- 1,8 ----
+ /* PR sanitizer/66343 */
+ /* { dg-options "-fsanitize=undefined" } */
+ 
+ void
+ foo (int a, int b)
+ {
+   a / b;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr67410.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr67410.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr67410.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr67410.c	Tue May 30 07:12:08 2017
***************
*** 0 ****
--- 1,15 ----
+ /* PR c/67410 */
+ /* { dg-do run } */
+ /* { dg-options "-std=gnu11" } */
+ 
+ struct {
+   __CHAR16_TYPE__ s[2];
+ } a[] = { u"ff", [0].s[0] = u'x', [1] = u"\u1234\u4567", [1].s[0] = u'\u89ab' };
+ 
+ int
+ main ()
+ {
+   if (a[0].s[0] != u'x' || a[0].s[1] != u'f' || a[1].s[0] != u'\u89ab' || a[1].s[1] != u'\u4567')
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr71558.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr71558.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr71558.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr71558.c	Thu Jul  7 12:47:20 2016
***************
*** 0 ****
--- 1,17 ----
+ /* PR tree-optimization/71588 */
+ 
+ /* strcpy must not be pure, but make sure we don't ICE even when
+    it is declared incorrectly.  */
+ char *strcpy (char *, const char *) __attribute__ ((__pure__));
+ __SIZE_TYPE__ strlen (const char *);
+ void *malloc (__SIZE_TYPE__);
+ 
+ char a[20];
+ 
+ char *
+ foo (void)
+ {
+   __SIZE_TYPE__ b = strlen (a);
+   char *c = malloc (b);
+   return strcpy (c, a);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr71581.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr71581.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr71581.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr71581.c	Thu Jul  7 12:46:33 2016
***************
*** 0 ****
--- 1,24 ----
+ /* PR middle-end/71581 */
+ /* { dg-do compile } */
+ /* { dg-options "-Wuninitialized" } */
+ 
+ _Complex float
+ f1 (void)
+ {
+   float x;
+   return x;	/* { dg-warning "is used uninitialized in this function" } */
+ }
+ 
+ _Complex double
+ f2 (void)
+ {
+   double x;
+   return x;	/* { dg-warning "is used uninitialized in this function" } */
+ }
+ 
+ _Complex int
+ f3 (void)
+ {
+   int x;
+   return x;	/* { dg-warning "is used uninitialized in this function" } */
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr72816.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr72816.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr72816.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr72816.c	Tue May 30 07:09:01 2017
***************
*** 0 ****
--- 1,9 ----
+ /* PR c/72816 */
+ /* { dg-do compile } */
+ /* { dg-options "-std=gnu11" } */
+ 
+ typedef const int A[];
+ struct S {
+   int a;
+   A b;
+ };
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr77450.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr77450.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr77450.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr77450.c	Tue Jan 24 08:06:29 2017
***************
*** 0 ****
--- 1,10 ----
+ /* { dg-do compile } */
+ /* { dg-options "-std=gnu90" } */
+ 
+ typedef int V __attribute__((vector_size(4)));
+ 
+ void
+ foo(void)
+ {
+   (V){ 0 }[0] = 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr77587.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr77587.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr77587.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr77587.c	Tue May 30 07:26:00 2017
***************
*** 0 ****
--- 1,14 ----
+ /* PR target/77587 */
+ /* { dg-do run } */
+ /* { dg-require-weak-override "" } */
+ /* { dg-additional-sources "pr77587a.c" } */
+ 
+ void
+ bar (long x, long y, long z)
+ {
+   struct __attribute__((aligned (16))) S { long a, b, c, d; } s;
+   char *p = (char *) &s;
+   __asm ("" : "+r" (p));
+   if (((__UINTPTR_TYPE__) p) & 15)
+     __builtin_abort ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr77587a.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr77587a.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr77587a.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr77587a.c	Tue May 30 07:26:00 2017
***************
*** 0 ****
--- 1,23 ----
+ /* PR target/77587 */
+ /* { dg-do compile } */
+ /* { dg-require-weak-override "" } */
+ 
+ void
+ foo (long x, long y, long z)
+ {
+ }
+ 
+ void bar (long x, long y, long z) __attribute__ ((weak, alias ("foo")));
+ 
+ void
+ baz (long x, long y, long z)
+ {
+   bar (0, 0, 0);
+ }
+ 
+ int
+ main ()
+ {
+   baz (0, 0, 0);
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr77673.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr77673.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr77673.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr77673.c	Wed Dec 14 10:07:01 2016
***************
*** 0 ****
--- 1,19 ----
+ /* { dg-do compile { target fpic } } */
+ /* { dg-require-effective-target bswap32 } */
+ /* { dg-options "-O2 -fPIC -fdump-tree-bswap" } */
+ /* { dg-additional-options "-march=z900" { target s390*-*-* } } */
+ 
+ void mach_parse_compressed(unsigned char* ptr, unsigned long int* val)
+ {
+   if (ptr[0] < 0xC0U) {
+     *val = ptr[0] + ptr[1];
+     return;
+   }
+ 
+   *val = ((unsigned long int)(ptr[0]) << 24)
+     | ((unsigned long int)(ptr[1]) << 16)
+     | ((unsigned long int)(ptr[2]) << 8)
+     | ptr[3];
+ }
+ 
+ /* { dg-final { scan-tree-dump-not "load_dst_\\d+ =.* if \\(" "bswap" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr78185.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr78185.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr78185.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr78185.c	Tue Jan 24 08:06:29 2017
***************
*** 0 ****
--- 1,28 ----
+ /* { dg-do run { target *-*-linux* *-*-gnu* } } */
+ /* { dg-options "-O" } */
+ 
+ #include <unistd.h>
+ #include <signal.h>
+ #include <stdlib.h>
+ 
+ static char var1 = 0L;
+ static char *var2 = &var1;
+ 
+ void do_exit (int i)
+ {
+   exit (0);
+ }
+ 
+ int main(void)
+ {
+   struct sigaction s;
+   sigemptyset (&s.sa_mask);
+   s.sa_handler = do_exit;
+   s.sa_flags = 0;
+   sigaction (SIGALRM, &s, NULL);
+   alarm (1);
+   /* The following loop is infinite, the division by zero should not
+      be hoisted out of it.  */
+   for (; (var1 == 0 ? 0 : (100 / var1)) == *var2; );
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr78333.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr78333.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr78333.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr78333.c	Tue Jan 24 08:06:29 2017
***************
*** 0 ****
--- 1,22 ----
+ /* { dg-do link } */
+ /* { dg-options "-finstrument-functions" } */
+ 
+ /* Add empty implementations of __cyg_profile_func_enter() and
+    __cyg_profile_func_exit() to avoid problems on non-glibc
+    systems.  */
+ void __attribute__((no_instrument_function))
+ __cyg_profile_func_enter(void *this_fn, void *call_site)
+ {
+ }
+ 
+ void __attribute__((no_instrument_function))
+ __cyg_profile_func_exit(void *this_fn, void *call_site)
+ {
+ }
+ 
+ extern inline __attribute__((gnu_inline, always_inline)) int foo () { }
+ int main()
+ {
+   foo ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr79494.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr79494.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr79494.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr79494.c	Tue May 30 08:01:31 2017
***************
*** 0 ****
--- 1,22 ----
+ /* PR target/79494 */
+ /* { dg-do compile } */
+ /* { dg-require-effective-target split_stack } */
+ /* { dg-options "-O2 -fsplit-stack -g" } */
+ 
+ void
+ foo (int a)
+ {
+   __label__ lab;
+   __attribute__((noinline, noclone)) void bar (int b)
+   {
+     switch (b)
+       {
+       case 1:
+ 	goto lab;
+       case 2:
+ 	goto lab;
+       }
+   }
+   bar (a);
+ lab:;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr79499.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr79499.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr79499.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr79499.c	Sat Sep 16 18:35:03 2017
***************
*** 0 ****
--- 1,13 ----
+ /* PR middle-end/79499 */
+ /* { dg-do compile { target split_stack } } */
+ /* { dg-options "-O2 -fsplit-stack -fno-omit-frame-pointer" } */
+ 
+ struct S { struct S *a, *b; };
+ 
+ void
+ foo (struct S *x)
+ {
+   do
+     x->b = x->a;
+   while (x = x->a);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr79570.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr79570.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr79570.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr79570.c	Tue May 30 08:03:03 2017
***************
*** 0 ****
--- 1,12 ----
+ /* PR target/79570 */
+ /* { dg-do compile { target powerpc*-*-* ia64-*-* i?86-*-* x86_64-*-* } } */
+ /* { dg-options "-O2 -fselective-scheduling2 -fvar-tracking-assignments" } */
+ /* { dg-warning "changes selective scheduling" "" { target *-*-* } 0 } */
+ 
+ void
+ fn1 (char *b, char *d, int *c, int i)
+ {
+   for (; i; i++, d++)
+     if (b[i])
+       *d = c[i];
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr79574-2.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr79574-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr79574-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr79574-2.c	Wed Mar 22 12:28:21 2017
***************
*** 0 ****
--- 1,33 ----
+ /* PR rtl-optimization/79574 */
+ /* { dg-do compile } */
+ /* { dg-options "-Os --param gcse-cost-distance-ratio=2147483647" } */
+ 
+ #include "stdarg.h"
+ 
+ int buf[100];
+ int buf1[10];
+ 
+ int rd (int *pppp, int n, ...)
+ {
+   va_list argp;
+   int *p;
+   int i;
+   int res;
+ 
+   va_start (argp, n);
+   for (; n > 0; n--)
+     va_arg (argp, double);
+   p = va_arg (argp, int *);
+   i = va_arg (argp, int);
+ 
+   res = p[i];
+   __builtin_printf ("%d\n", res);
+ 
+   return res;
+ }
+ 
+ int mpx_test (int argc, const char **argv)
+ {
+   rd (buf1, 2, 10.0d, 10.0d, buf, 100, buf1);
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr79574.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr79574.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr79574.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr79574.c	Wed Mar 22 12:28:00 2017
***************
*** 0 ****
--- 1,10 ----
+ /* PR rtl-optimization/79574 */
+ /* { dg-do compile } */
+ /* { dg-options "-Os --param gcse-cost-distance-ratio=2147483647" } */
+ 
+ void a (void)
+ {
+   volatile int b;
+   for (;; b)
+     ;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr80112.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr80112.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr80112.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr80112.c	Tue May 30 08:20:03 2017
***************
*** 0 ****
--- 1,21 ----
+ /* PR rtl-optimization/80112 */
+ /* { dg-do compile } */
+ /* { dg-options "-Os -fmodulo-sched" } */
+ 
+ void **a;
+ 
+ void
+ foo (int c)
+ {
+   void *d[] = {&&e, &&f};
+   a = d;
+   switch (c)
+     {
+     f:
+       c = 9;
+       /* FALLTHRU */
+     case 9:
+       goto *a++;
+     e:;
+     }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr80286.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr80286.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr80286.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr80286.c	Tue May 30 08:23:29 2017
***************
*** 0 ****
--- 1,23 ----
+ /* PR target/80286 */
+ /* { dg-do run } */
+ /* { dg-options "-O2 -Wno-psabi" } */
+ 
+ typedef int V __attribute__((vector_size (4 * sizeof (int))));
+ 
+ __attribute__((noinline, noclone)) V
+ foo (V x, V y)
+ {
+   return x << y[0];
+ }
+ 
+ int
+ main ()
+ {
+   V x = { 1, 2, 3, 4 };
+   V y = { 5, 6, 7, 8 };
+   V z = foo (x, y);
+   V e = { 1 << 5, 2 << 5, 3 << 5, 4 << 5 };
+   if (__builtin_memcmp (&z, &e, sizeof (V)))
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr81192.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr81192.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr81192.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr81192.c	Mon Jul  3 08:43:40 2017
***************
*** 0 ****
--- 1,22 ----
+ /* { dg-options "-Os -fdump-tree-pre-details" } */
+ 
+ unsigned a;
+ int b, c;
+ 
+ static int
+ fn1 (int p1, int p2)
+ {
+   return p1 > 2147483647 - p2 ? p1 : p1 + p2;
+ }
+ 
+ void
+ fn2 (void)
+ {
+   int j;
+   a = 30;
+   for (; a;)
+     for (; c; b = fn1 (j, 1))
+       ;
+ }
+ 
+ /* { dg-final { scan-tree-dump-times "(?n)find_duplicates: <bb .*> duplicate of <bb .*>" 1 "pre" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr81621.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr81621.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr81621.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr81621.c	Sat Sep 16 18:38:01 2017
***************
*** 0 ****
--- 1,5 ----
+ /* PR target/81621 */
+ /* { dg-do compile { target freorder } } */
+ /* { dg-options "-Og -fno-split-wide-types -freorder-blocks-and-partition" } */
+ 
+ #include "graphite/scop-10.c"
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/pr82112.c gcc-5.5.0/gcc/testsuite/gcc.dg/pr82112.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/pr82112.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/pr82112.c	Sat Sep 16 18:39:47 2017
***************
*** 0 ****
--- 1,21 ----
+ /* PR target/82112 */
+ /* { dg-do compile } */
+ /* { dg-options "-std=gnu90" } */
+ 
+ struct S { int a[10]; } bar (void);
+ int b, c;
+ 
+ void
+ foo (void)
+ {
+   __atomic_load (bar ().a, &b, __ATOMIC_ACQUIRE);	/* { dg-error "argument 1 of .__atomic_load. must be a non-void pointer type" } */
+   __atomic_load (&b, bar ().a, __ATOMIC_ACQUIRE);	/* { dg-error "argument 2 of .__atomic_load. must be a pointer type" } */
+   __atomic_store (bar ().a, &b, __ATOMIC_SEQ_CST);	/* { dg-error "argument 1 of .__atomic_store. must be a non-void pointer type" } */
+   __atomic_store (&b, bar ().a, __ATOMIC_SEQ_CST);	/* { dg-error "argument 2 of .__atomic_store. must be a pointer type" } */
+   __atomic_exchange (bar ().a, &b, &c, __ATOMIC_RELAXED);	/* { dg-error "argument 1 of .__atomic_exchange. must be a non-void pointer type" } */
+   __atomic_exchange (&b, bar ().a, &c, __ATOMIC_RELAXED);	/* { dg-error "argument 2 of .__atomic_exchange. must be a pointer type" } */
+   __atomic_exchange (&b, &c, bar ().a, __ATOMIC_RELAXED);	/* { dg-error "argument 3 of .__atomic_exchange. must be a pointer type" } */
+   __atomic_compare_exchange (bar ().a, &b, &c, 1, __ATOMIC_RELAXED, __ATOMIC_RELAXED);	/* { dg-error "argument 1 of .__atomic_compare_exchange. must be a non-void pointer type" } */
+   __atomic_compare_exchange (&b, bar ().a, &c, 1, __ATOMIC_RELAXED, __ATOMIC_RELAXED);	/* { dg-error "argument 2 of .__atomic_compare_exchange. must be a pointer type" } */
+   __atomic_compare_exchange (&b, &c, bar ().a, 1, __ATOMIC_RELAXED, __ATOMIC_RELAXED);	/* { dg-error "argument 3 of .__atomic_compare_exchange. must be a pointer type" } */
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/tls/pr78796.c gcc-5.5.0/gcc/testsuite/gcc.dg/tls/pr78796.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/tls/pr78796.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/tls/pr78796.c	Tue May 30 07:48:57 2017
***************
*** 0 ****
--- 1,32 ----
+ /* PR target/78796 */
+ /* { dg-do run } */
+ /* { dg-options "-O2" } */
+ /* { dg-additional-options "-mcmodel=large" { target aarch64-*-* } } */
+ /* { dg-require-effective-target tls } */
+ 
+ struct S { int a, b, c, d, e; };
+ struct S t;
+ __thread struct S s;
+ 
+ __attribute__((used, noinline, noclone)) void
+ foo (int *x, int *y)
+ {
+   asm volatile ("" : : "g" (x), "g" (y) : "memory");
+   if (*x != 1 || *y != 2)
+     __builtin_abort ();
+ }
+ 
+ __attribute__((used, noinline, noclone)) void
+ bar (void)
+ {
+   foo (&t.c, &s.c);
+ }
+ 
+ int
+ main ()
+ {
+   t.c = 1;
+   s.c = 2;
+   bar ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/builtin-isinf_sign-1.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/builtin-isinf_sign-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/builtin-isinf_sign-1.c	Mon May 19 06:57:43 2008
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/builtin-isinf_sign-1.c	Thu Jul  7 12:33:10 2016
*************** foo (float f, double d, long double ld)
*** 24,29 ****
--- 24,30 ----
        != (__builtin_isinf(ld) ? (__builtin_signbitl(ld) ? -1 : 1) : 0))
      link_error (__LINE__);
  
+ #ifdef __OPTIMIZE__
    /* In boolean contexts, GCC will fold the inner conditional
       expression to 1.  So isinf_sign folds to plain isinf.  */
  
*************** foo (float f, double d, long double ld)
*** 33,38 ****
--- 34,40 ----
      link_error (__LINE__);
    if ((_Bool)__builtin_isinf_sign(ld) != (__builtin_isinf(ld) != 0))
      link_error (__LINE__);
+ #endif
  
    if ((__builtin_isinf_sign(f) != 0) != (__builtin_isinf(f) != 0))
      link_error (__LINE__);
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr68528.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr68528.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr68528.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr68528.c	Mon Sep 18 13:14:45 2017
***************
*** 0 ****
--- 1,17 ----
+ /* { dg-do run } */
+ 
+ #define INT_MIN ( -__INT_MAX__ - 1 )
+ 
+ extern void abort (void);
+ 
+ int main (void)
+ {
+   int  x0 = INT_MIN;
+   long x1 = 0L;
+   int  x2 = 0;
+   int  t  = ( 0 || ( INT_MIN - (int) ( x0 - x1 ) ) );
+ 
+   if ( t != 0 ) { x2 = t; abort(); }
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr70628.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr70628.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr70628.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr70628.c	Thu Jul  7 12:39:40 2016
***************
*** 0 ****
--- 1,46 ----
+ /* PR debug/70628 */
+ /* { dg-do compile } */
+ /* { dg-options "-g -w" } */
+ 
+ struct S { char s[64]; int *t; } *a;
+ char b[64];
+ int *foo (void);
+ struct S *bar (int *);
+ int baz (void);
+ 
+ void
+ test (const char *p, long q)
+ {
+   int *c;
+   c = foo ();
+   while (a = bar (c))
+     {
+       if (__builtin_strstr (p, "ABCD")
+ 	  || __builtin_strstr (p, "EFGHI")
+ 	  || __builtin_strstr (p, "JKL")
+ 	  || __builtin_strstr (p, "MNOPQR")
+ 	  || __builtin_strstr (p, "STUV")
+ 	  || __builtin_strstr (p, "WXYZabcd")
+ 	  || __builtin_strstr (p, "efghij")
+ 	  || __builtin_strstr (p, "klmno")
+ 	  || __builtin_strstr (p, "pqrstuvw")
+ 	  || __builtin_strstr (b, "MNOPQR") != "EFGHI"
+ 	  || __builtin_strstr (b, "JKL"))
+ 	if (__builtin_strstr (a->s, "xyz12"))
+ 	  continue;
+       __builtin_printf ("%p\n", a->t);
+     }
+   bar (c);
+   while (a)
+     if (__builtin_strstr (p, "ABCD")
+ 	|| __builtin_strstr (p, "EFGHI")
+ 	|| __builtin_strstr (p, "JKL")
+ 	|| __builtin_strstr (p, "MNOPQR")
+ 	|| __builtin_strstr (p, "STUV")
+ 	|| __builtin_strstr (p, "WXYZabcd")
+ 	|| __builtin_strstr (p, "efghij")
+ 	|| __builtin_strstr (p, "klmno")
+ 	|| __builtin_strstr (p, "pqrstuvw")
+ 	|| __builtin_strstr ((const char *) q, "MNOPQR"))
+       baz ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr71423.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr71423.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr71423.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr71423.c	Thu Jul  7 10:33:01 2016
***************
*** 0 ****
--- 1,20 ----
+ /* { dg-do run } */
+ 
+ struct S1
+ {
+   int f1:1;
+ };
+ 
+ volatile struct S1 b = { 0 };
+ 
+ int
+ main ()
+ {
+   char c = b.f1;
+   b.f1 = 1; 
+ 
+   if (b.f1 > -1 || c)
+     __builtin_abort (); 
+ 
+   return 0; 
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr71452.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr71452.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr71452.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr71452.c	Thu Jul  7 10:33:01 2016
***************
*** 0 ****
--- 1,10 ----
+ /* { dg-do run } */
+ 
+ int main()
+ {
+   _Bool b;
+   *(char *)&b = 123;
+   if (*(char *)&b != 123)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr71522.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr71522.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr71522.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr71522.c	Thu Jul  7 10:33:01 2016
***************
*** 0 ****
--- 1,27 ----
+ /* { dg-do run } */
+ 
+ #if __SIZEOF_LONG_DOUBLE__ == 16
+ #define STR "AAAAAAAAAAAAAAA"
+ #elif __SIZEOF_LONG_DOUBLE__ == 12
+ #define STR "AAAAAAAAAAA"
+ #elif __SIZEOF_LONG_DOUBLE__ == 8
+ #define STR "AAAAAAA"
+ #elif __SIZEOF_LONG_DOUBLE__ == 4
+ #define STR "AAA"
+ #else
+ #define STR "A"
+ #endif
+ 
+ int main()
+ {
+   long double d;
+   char s[sizeof d];
+ 
+   __builtin_memcpy(&d, STR, sizeof d);
+   __builtin_memcpy(&s, &d, sizeof s);
+ 
+   if (__builtin_strncmp (s, STR, sizeof s) != 0)
+     __builtin_abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr71606.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr71606.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr71606.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr71606.c	Fri Jul  8 20:21:02 2016
***************
*** 0 ****
--- 1,11 ----
+ _Complex a;
+ void fn1 ();
+ 
+ int main () {
+   fn1 (a);
+   return 0;
+ }
+ 
+ void fn1 (__complex__ long double p1) {
+   __imag__ p1 = 6.0L;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr75964.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr75964.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr75964.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr75964.c	Tue Aug 22 10:07:51 2017
***************
*** 0 ****
--- 1,28 ----
+ /* { dg-do run } */
+ 
+ typedef __UINT8_TYPE__ uint8_t;
+ 
+ uint8_t __attribute__ ((noinline, noclone))
+ abs8 (uint8_t x)
+ {
+   if (x & 0x80)
+     x = -x;
+ 
+   if (x & 0x80)
+     x = 0x7f;
+ 
+   return x;
+ }
+ 
+ int
+ main (void)
+ {
+   if (abs8 (0) != 0
+       || abs8 (1) != 1
+       || abs8 (127) != 127
+       || abs8 (128) != 127
+       || abs8 (129) != 127
+       || abs8 (255) != 1)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77309.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77309.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77309.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77309.c	Mon Dec 12 13:01:28 2016
***************
*** 0 ****
--- 1,14 ----
+ /* { dg-do run } */
+ 
+ int a, b;
+ 
+ int main ()
+ {
+   long c = 1 % (2 ^ b);
+   c = -c & ~(~(b ^ ~b) || a);
+ 
+   if (c >= 0)
+     __builtin_abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77436.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77436.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77436.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77436.c	Tue Jan 24 08:06:29 2017
***************
*** 0 ****
--- 1,11 ----
+ /* { dg-do run } */
+ 
+ int main()
+ {
+   unsigned short sum = 0;
+   for (short x = -(__SHRT_MAX__ -1); x <= (__SHRT_MAX__ -1); x++)
+     sum += x;
+   if (sum != 0)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77478.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77478.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77478.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77478.c	Tue Sep 27 12:44:42 2016
***************
*** 0 ****
--- 1,22 ----
+ /* { dg-do run } */
+ /* { dg-additional-options "-ffast-math" } */
+ 
+ static const float A[10] = {1};
+ 
+ float
+ foo(float *f, int n)
+ {
+   int i, j;
+   float a = 0, b = 0;
+   for (i = n/2; i < n; i++)
+     a += f[i]*.1f;
+   for (i = n/2, j = 0; i < n; i++, j++)
+     b += f[i]*A[j]+a*A[j];
+   return b;
+ }
+ 
+ int main()
+ {
+   float a[21] = {0};
+   return foo(a+1, 20) + foo(a, 20);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77605.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77605.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77605.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77605.c	Tue Jan 24 08:06:29 2017
***************
*** 0 ****
--- 1,15 ----
+ /* { dg-do run } */
+ 
+ int a, b, c[2][8];
+ 
+ int main ()
+ {
+   for (a = 0; a < 8; a++)
+     for (b = 0; b < 2; b++)
+       c[b][a] = c[b][b + 6] ^ 1;
+ 
+   if (c[0][7] != 0) 
+     __builtin_abort ();
+ 
+   return 0; 
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77646.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77646.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77646.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77646.c	Tue Jan 24 11:30:44 2017
***************
*** 0 ****
--- 1,21 ----
+ /* { dg-do compile } */
+ 
+ struct e {
+     int (*f)();
+     void (*g)();
+ } * c;
+ int a;
+ void *h();
+ typedef struct { struct e j; } k;
+ int l() { return a; }
+ const struct e b = {l};
+ void m()
+ {
+   k *d = h();
+   d->j = b;
+   c = (struct e *)d;
+   struct e *i = c;
+   if (i->f(c))
+     while (i->f(c))
+       i->g();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77648-1.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77648-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77648-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77648-1.c	Tue Jan 24 11:30:44 2017
***************
*** 0 ****
--- 1,24 ----
+ /* { dg-do run } */
+ 
+ struct S { int *p; int *q; };
+ 
+ int **__attribute__((noinline,noclone,pure)) foo (struct S *s)
+ {
+   int tem;
+   __asm__ ("" : "=g" (tem) : "g" (s->p));
+   return &s->q;
+ }
+ 
+ int main()
+ {
+   struct S s;
+   int i = 1, j = 2;
+   int **x;
+   s.p = &i;
+   s.q = &j;
+   x = foo (&s);
+   **x = 7;
+   if (j != 7)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77648-2.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77648-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77648-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77648-2.c	Tue Jan 24 11:30:44 2017
***************
*** 0 ****
--- 1,22 ----
+ /* { dg-do run } */
+ 
+ struct S { int *p; int *q; };
+ 
+ int **__attribute__((noinline,noclone,const)) foo (struct S *s)
+ {
+   return &s->q;
+ }
+ 
+ int main()
+ {
+   struct S s;
+   int i = 1, j = 2;
+   int **x;
+   s.p = &i;
+   s.q = &j;
+   x = foo (&s);
+   **x = 7;
+   if (j != 7)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77768.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77768.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77768.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77768.c	Thu Jan 26 08:16:37 2017
***************
*** 0 ****
--- 1,13 ----
+ /* { dg-do run } */
+ 
+ static const int a;
+ int b;
+ int *c, *d;
+ int main()
+ {
+   c = (int *)&a;
+   c == d ?: __builtin_exit(0); 
+   for (; b; b++ >= (*d = a))
+     ;
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77855.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77855.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77855.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77855.c	Tue Jan 24 08:06:29 2017
***************
*** 0 ****
--- 1,48 ----
+ /* { dg-do run } */
+ 
+ int a, b = 1, c, e, f, g, k, m, n, o;
+ char d, h, i, j, l; 
+ char res[2];
+ 
+ void __attribute__ ((noinline,noclone)) fn2 ()
+ {
+   d = 2;
+ }
+ 
+ void fn3 ()
+ {
+   for (;;)
+     {
+       for (; b; b--)
+ 	{
+ 	  fn2 ();  
+ 	  if (e)
+ 	    j = 1;
+ 	  if (f)
+ 	    L1:
+ 		k = j | (a & l);
+ 	  for (;;)
+ 	    {
+ 	      __builtin_snprintf (res, 2, "%d\n", d);
+ 	      if (d)
+ 		break;
+ 	      for (; o; o--)
+ 		for (; n;)
+ 		  for (; m; m++)
+ 		    ;
+ 	      goto L1;
+ 	    }
+ 	}
+       g = h;
+       c = i;
+       break;
+     }
+ }
+ 
+ int main ()
+ {
+   fn3 ();
+   if (res[0] != '2')
+     __builtin_abort ();
+   return 0; 
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77916.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77916.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77916.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77916.c	Mon Oct 24 02:41:12 2016
***************
*** 0 ****
--- 1,20 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O3 -Wno-int-conversion" } */
+ 
+ /* PR77916: This failed with "error: invalid (pointer) operands to plus/minus"
+    after SLSR.  */
+ 
+ typedef struct
+ {
+   void *f1;
+ } S;
+ 
+ S *a;
+ int b;
+ 
+ void
+ fn1 (void)
+ {
+   for (; b; b++, a++)
+     a->f1 = b;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77937-1.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77937-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77937-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77937-1.c	Mon Oct 17 14:24:21 2016
***************
*** 0 ****
--- 1,15 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O3" } */
+ /* { dg-additional-options "-march=amdfam10" { target i?86-*-* x86_64-*-* } } */
+ 
+ int *a;
+ int b, c, d;
+ void fn1(char *p1, int p2) {
+   int x;
+   while (1) {
+     x = 0;
+     for (; x < 8; x++)
+       p1[0] = -a[0] * d + p1[0] * c + 1 >> b >> 1;
+     p1 += p2;
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77937-2.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77937-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr77937-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr77937-2.c	Mon Oct 17 14:24:21 2016
***************
*** 0 ****
--- 1,18 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O3" } */
+ /* { dg-additional-options "-march=amdfam10" { target i?86-*-* x86_64-*-* } } */
+ 
+ extern int fn2(int);
+ extern int fn3(int);
+ int a, b, c;
+ void fn1(long p1) {
+   char *d;
+   for (;; d += p1) {
+     d[0] = fn2(1 >> a);
+     fn3(0);
+     fn3(c >> a);
+     d[1] = fn3(d[1] * b + c >> a);
+     d[4] = fn3(d[4] * b + c >> a);
+     d[5] = fn3(d[5] * b + c >> a);
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr78416.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr78416.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr78416.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr78416.c	Tue May 30 07:43:37 2017
***************
*** 0 ****
--- 1,17 ----
+ /* PR middle-end/78416 */
+ /* { dg-do run { target int128 } } */
+ 
+ int
+ main ()
+ {
+   unsigned __int128 x;
+   x = 0xFFFFFFFFFFFFFFFFULL;
+   x /= ~0x7FFFFFFFFFFFFFFFLL;
+   if (x != 0)
+     __builtin_abort ();
+   x = ~0x7FFFFFFFFFFFFFFELL;
+   x /= ~0x7FFFFFFFFFFFFFFFLL;
+   if (x != 1)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr78731.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr78731.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr78731.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr78731.c	Wed Dec 14 10:31:37 2016
***************
*** 0 ****
--- 1,41 ----
+ /* { dg-do run } */
+ 
+ #include <stdio.h>
+ #include <stdlib.h>
+ 
+ #define GENERAL 1
+ #define BRACKETS 2
+ #define QUOTES 3
+ 
+ void __attribute__((noinline,noclone))
+ foo(char *qb, char* into)
+ {
+   int state = QUOTES;
+   int save_state = BRACKETS;
+ 
+   while (qb)
+     {
+       switch (state)
+ 	{
+ 	case BRACKETS:
+ 	  exit(0);
+ 	case GENERAL:
+ 	  abort ();
+ 	case QUOTES:
+ 	  state = save_state;
+ 	  save_state = GENERAL;
+ 	  break;
+ 	default: ;
+ 	}
+       printf("State %d btw GENERAL %d\n", state, GENERAL);
+     }
+   abort ();
+ }
+ 
+ int main()
+ {
+   char *b = "123";
+   char out[4];
+   foo(b, out);
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr79666.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr79666.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr79666.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr79666.c	Wed May 10 10:01:23 2017
***************
*** 0 ****
--- 1,30 ----
+ /* { dg-do run } */
+ 
+ struct
+ {
+   unsigned a:6;
+ } b;
+ 
+ int c, e, g = 7;
+ signed char d, f = 6, h = -10;
+ 
+ void fn1 ()
+ {
+   for (; c < 9; c++)
+     {
+       if (f)
+ 	g = ~(~0 / (g ^ e));
+       b.a = ~0;
+       d = ~((h ^ b.a) & 132 & (~(f && g) | (d && 1)));
+       e = ~0;
+       if (d < 127 || f < 1)
+ 	continue;
+       g = 0;
+     }
+ }
+ 
+ int main ()
+ {
+   fn1 ();
+   return 0; 
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr79732.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr79732.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr79732.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr79732.c	Wed May 10 10:01:23 2017
***************
*** 0 ****
--- 1,5 ----
+ /* { dg-do link } */
+ 
+ int bar () __attribute__ ((alias ("foo")));
+ void foo () { }
+ int main () { return bar(); }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr80025.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr80025.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr80025.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr80025.c	Tue May 30 08:22:41 2017
***************
*** 0 ****
--- 1,24 ----
+ /* PR debug/80025 */
+ /* { dg-do compile } */
+ /* { dg-options "-g -ftracer -w" } */
+ 
+ int a;
+ long int b, c;
+ 
+ long int
+ foo (void)
+ {
+ }
+ 
+ void
+ bar (int x, short int y, unsigned short int z)
+ {
+ }
+ 
+ int
+ baz (void)
+ {
+   a -= b;
+   b = !foo ();
+   bar (b ^= (c ^ 1) ? (c ^ 1) : foo (), (__INTPTR_TYPE__) &bar, a);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr80122.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr80122.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr80122.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr80122.c	Wed May 10 07:53:45 2017
***************
*** 0 ****
--- 1,52 ----
+ /* { dg-do run } */
+ 
+ #define __GNU_ALWAYS_INLINE inline __attribute__(( __always_inline__))
+ 
+ #define DEVT_ALL    0
+ 
+ #define CMD_ABI_DEVICES 100
+ 
+ static __GNU_ALWAYS_INLINE int
+ send_msg_to_gm_w_dev_t(int msg_type, unsigned int dev_msg_type,
+ 		       int devt, ...)
+ {
+   char s[256];
+   int nArgs = __builtin_va_arg_pack_len();
+   if (nArgs != 2)
+     __builtin_abort ();
+   __builtin_sprintf (s, "%d", __builtin_va_arg_pack ());
+   if (__builtin_strcmp (s, "99") != 0)
+     __builtin_abort ();
+   /* do something with nArgs and ... */ 
+   return 0;
+ }
+ 
+ static __GNU_ALWAYS_INLINE int
+ send_msg_to_gm(int msg_type, unsigned int dev_msg_type,
+ 	       ...)
+ {
+   int nArgs = __builtin_va_arg_pack_len();
+   if (nArgs != 2)
+     __builtin_abort ();
+   return send_msg_to_gm_w_dev_t(msg_type, dev_msg_type,
+ 				DEVT_ALL, __builtin_va_arg_pack()); 
+ }
+ 
+ static __GNU_ALWAYS_INLINE int
+ send_enable(unsigned int dev_msg_type, ...)
+ {
+   int nArgs = __builtin_va_arg_pack_len();
+   if (nArgs != 2)
+     __builtin_abort ();
+   return send_msg_to_gm(CMD_ABI_DEVICES, dev_msg_type,  __builtin_va_arg_pack());
+ }
+ 
+ int 
+ main(void)
+ {
+   int mode = 99;
+ 
+   send_enable(1, mode, sizeof(mode));
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr80362.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr80362.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr80362.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr80362.c	Mon Sep 18 13:14:45 2017
***************
*** 0 ****
--- 1,10 ----
+ /* { dg-do run } */
+ /* { dg-additional-options "-fstrict-overflow" } */
+ 
+ int main()
+ {
+   signed char var_0, var_1 = -128;
+   var_0 = (signed char)(-var_1) / 3;
+   if (var_0 > 0)
+     __builtin_abort();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr80539.c gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr80539.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/torture/pr80539.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/torture/pr80539.c	Wed May 10 07:53:45 2017
***************
*** 0 ****
--- 1,22 ----
+ /* { dg-do compile } */
+ 
+ signed char a, b;
+ void fn1()
+ {
+   signed char c, e;
+   short d;
+   if (0) {
+       for (; d;) {
+ l1:
+ 	  for (c = 7; a; c++)
+ 	    ;
+ 	  e = 6;
+ 	  for (; b; e++)
+ 	    ;
+       }
+       c -= e;
+   }
+   if (d == 7)
+     goto l1;
+   a = c;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/tree-prof/pr79587.c gcc-5.5.0/gcc/testsuite/gcc.dg/tree-prof/pr79587.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/tree-prof/pr79587.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/tree-prof/pr79587.c	Wed Mar 22 14:59:44 2017
***************
*** 0 ****
--- 1,26 ----
+ /* { dg-require-effective-target lto } */
+ /* { dg-options "-O2 -flto" } */
+ 
+ unsigned long global = -12345;
+ 
+ unsigned long
+ __attribute__((noinline))
+ test(unsigned long v, unsigned long v2)
+ {
+   unsigned long x = v % v2;
+ 
+   return x;
+ }
+ 
+ int main(int argc, char **argv)
+ {
+   unsigned long r = 0;
+ 
+   for (int i = 0; i < 100; i++)
+     r += test(argc, global);
+ 
+   if (r != 100)
+     __builtin_abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/tree-ssa/pr68021.c gcc-5.5.0/gcc/testsuite/gcc.dg/tree-ssa/pr68021.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/tree-ssa/pr68021.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/tree-ssa/pr68021.c	Tue Apr 11 08:15:51 2017
***************
*** 0 ****
--- 1,17 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O3" } */
+ 
+ char a;
+ void fn1 (char *p1, int p2, int p3)
+ {
+   int i, x;
+   for (i = 0; i < 10; i++)
+     {
+       for (x = 0; x < p3; x++)
+ 	{
+ 	  *p1 = a;
+ 	  p1--;
+ 	}
+       p1 += p2;
+     }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/tree-ssa/pr78428.c gcc-5.5.0/gcc/testsuite/gcc.dg/tree-ssa/pr78428.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/tree-ssa/pr78428.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/tree-ssa/pr78428.c	Tue Jan  3 10:54:40 2017
***************
*** 0 ****
--- 1,27 ----
+ /* PR tree-optimization/78428.  */
+ /* { dg-options "-O2" } */
+ /* { dg-do run } */
+ 
+ struct S0
+ {
+   int f2;
+   int f3:16;
+   int f4:18;
+ } ;
+ 
+ int a = 5;
+ struct S0 b = { 3, 0, 0 };
+ static struct S0 global[2] = { { 77, 0, 78 }, { 77, 0, 78 } };
+ 
+ int main ()
+ {
+   volatile struct S0 *j;
+   for (; a;)
+     {
+       __builtin_printf ("", b.f2);
+       j = &b;
+       *j = global[1];
+       a--;
+     }
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/tree-ssa/pr78886.c gcc-5.5.0/gcc/testsuite/gcc.dg/tree-ssa/pr78886.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/tree-ssa/pr78886.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/tree-ssa/pr78886.c	Tue Jan  3 12:08:10 2017
***************
*** 0 ****
--- 1,10 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O2" } */
+ void *malloc(unsigned long x);
+ 
+ void foo(void)
+ {
+  volatile int i;
+  malloc(1);
+  i;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/tree-ssa/pr79803.c gcc-5.5.0/gcc/testsuite/gcc.dg/tree-ssa/pr79803.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/tree-ssa/pr79803.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/tree-ssa/pr79803.c	Wed Mar 22 12:28:50 2017
***************
*** 0 ****
--- 1,60 ----
+ /* { dg-do compile { target { x86_64-*-* } } } */
+ /* { dg-options "-march=opteron-sse3 -Ofast --param l1-cache-line-size=3 -Wdisabled-optimization" } */
+ /* { dg-require-effective-target indirect_jumps } */
+ 
+ #include <setjmp.h>
+ 
+ extern void abort (void);
+ 
+ jmp_buf buf;
+ 
+ void raise0(void)
+ {
+   __builtin_longjmp (buf, 1);
+ }
+ 
+ int execute(int cmd) /* { dg-warning "'l1-cache-size' parameter is not a power of two 3" } */
+ {
+   int last = 0;
+ 
+   if (__builtin_setjmp (buf) == 0)
+     while (1)
+       {
+ 	last = 1;
+ 	raise0 ();
+       }
+ 
+   if (last == 0)
+     return 0;
+   else
+     return cmd;
+ }
+ 
+ int execute2(int cmd, int cmd2)
+ {
+   int last = 0;
+ 
+   if (__builtin_setjmp (buf) == 0)
+     while (1)
+       {
+ 	last = 1;
+ 	raise0 ();
+       }
+ 
+   if (last == 0)
+     return 0;
+   else
+     return cmd;
+ }
+ 
+ 
+ int main(void)
+ {
+   if (execute (1) == 0)
+     abort ();
+ 
+   if (execute2 (1, 2) == 0)
+     abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/ubsan/pr70878.c gcc-5.5.0/gcc/testsuite/gcc.dg/ubsan/pr70878.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/ubsan/pr70878.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/ubsan/pr70878.c	Mon May 29 09:10:11 2017
***************
*** 0 ****
--- 1,9 ----
+ /* PR sanitizer/80878 */
+ /* { dg-do compile { target { { i?86-*-* x86_64-*-* } && lp64 } } } */
+ /* { dg-options "-fsanitize=object-size" } */
+ 
+ void * sbrk ()
+ {
+  volatile register unsigned int sp_r1 __asm__ ("ebx");
+  return __builtin_strcat ((char*)sp_r1, 0); /* { dg-warning "cast to pointer from integer of different size" } */
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/ubsan/pr80097.c gcc-5.5.0/gcc/testsuite/gcc.dg/ubsan/pr80097.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/ubsan/pr80097.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/ubsan/pr80097.c	Tue May 30 08:16:31 2017
***************
*** 0 ****
--- 1,10 ----
+ /* PR c/80097 */
+ /* { dg-do compile } */
+ /* { dg-options "-std=c89 -fsanitize=float-divide-by-zero" } */
+ 
+ int
+ foo (double a)
+ {
+   int b = (1 / a >= 1);
+   return b;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/ubsan/pr81162.c gcc-5.5.0/gcc/testsuite/gcc.dg/ubsan/pr81162.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/ubsan/pr81162.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/ubsan/pr81162.c	Tue Jul 25 19:44:10 2017
***************
*** 0 ****
--- 1,17 ----
+ /* PR tree-optimization/81162 */
+ /* { dg-do run } */
+ /* { dg-options "-fsanitize=undefined -O2" } */
+ 
+ short s;
+ int i1 = 1;
+ int i2 = 1;
+ unsigned char uc = 147;
+ 
+ int main() {
+   s = (-uc + 2147483647) << 0;
+   if (9031239389974324562ULL >= (-((i1 && i2) + uc) ^ -21096) ) {
+     return 0;
+   } else {
+     return -1;
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.dg/vector-1.c gcc-5.5.0/gcc/testsuite/gcc.dg/vector-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.dg/vector-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.dg/vector-1.c	Wed May 10 10:01:23 2017
***************
*** 0 ****
--- 1,8 ----
+ /* { dg-do compile } */
+ /* { dg-options "-std=gnu90" } */
+ 
+ typedef int V __attribute__ ((vector_size(4)));
+ void fn1 ()
+ {
+   (V){(1,0)}[0] = 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/aarch64/pr78038.c gcc-5.5.0/gcc/testsuite/gcc.target/aarch64/pr78038.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/aarch64/pr78038.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/aarch64/pr78038.c	Fri Dec  2 12:22:54 2016
***************
*** 0 ****
--- 1,28 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O2" } */
+ 
+ /* PR rtl-optimization/78038.
+    Make sure ree can gracefully handle extensions of the global
+    variable register after a call.  */
+ 
+ typedef void (*test_fptr_t) (void);
+ void
+ test_f (void)
+ {
+ }
+ test_fptr_t test_fptr = test_f;
+ 
+ struct test2_s
+ {
+   int f;
+ };
+ 
+ register struct test2_s *g __asm__("x28");
+ 
+ void
+ do_something ()
+ {
+   test_fptr ();
+   struct test2_s *p1 = 0;
+   *p1 = *g;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/aarch64/pr78255.c gcc-5.5.0/gcc/testsuite/gcc.target/aarch64/pr78255.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/aarch64/pr78255.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/aarch64/pr78255.c	Wed Jan 11 15:08:25 2017
***************
*** 0 ****
--- 1,12 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O2 -mcmodel=tiny" } */
+ 
+ extern int bar (void *);
+ 
+ int
+ foo (void)
+ {
+   return bar ((void *)bar);
+ }
+ 
+ /* { dg-final { scan-assembler "b\\s+bar" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/arm/atomic_loaddi_10.c gcc-5.5.0/gcc/testsuite/gcc.target/arm/atomic_loaddi_10.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/arm/atomic_loaddi_10.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/arm/atomic_loaddi_10.c	Tue Apr 11 15:26:20 2017
***************
*** 0 ****
--- 1,15 ----
+ /* { dg-do compile } */
+ /* { dg-require-effective-target arm_arch_v7ve_ok } */
+ /* { dg-options "-O2" } */
+ /* { dg-add-options arm_arch_v7ve } */
+ 
+ #include <stdatomic.h>
+ 
+ atomic_llong x = 0;
+ 
+ atomic_llong get_x()
+ {
+   return atomic_load(&x);
+ }
+ 
+ /* { dg-final { scan-assembler "ldrd" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/arm/atomic_loaddi_11.c gcc-5.5.0/gcc/testsuite/gcc.target/arm/atomic_loaddi_11.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/arm/atomic_loaddi_11.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/arm/atomic_loaddi_11.c	Tue Apr 11 15:26:20 2017
***************
*** 0 ****
--- 1,15 ----
+ /* { dg-do compile } */
+ /* { dg-require-effective-target arm_arch_v7r_ok } */
+ /* { dg-skip-if "do not override -mcpu" { *-*-* } { "-mcpu=*" "-march=*" } { "-mcpu=cortex-r5" } } */
+ /* { dg-options "-O2 -mcpu=cortex-r5" } */
+ 
+ #include <stdatomic.h>
+ 
+ atomic_llong x = 0;
+ 
+ atomic_llong get_x()
+ {
+   return atomic_load(&x);
+ }
+ 
+ /* { dg-final { scan-assembler-not "ldrd" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/arm/empty_fiq_handler.c gcc-5.5.0/gcc/testsuite/gcc.target/arm/empty_fiq_handler.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/arm/empty_fiq_handler.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/arm/empty_fiq_handler.c	Wed Dec  7 17:51:00 2016
***************
*** 0 ****
--- 1,12 ----
+ /* { dg-do compile } */
+ /* { dg-skip-if "" { ! arm_cortex_m } { "-mthumb" } } */
+ 
+ /* Below code used to trigger an ICE due to missing constraints for
+    sp = fp + cst pattern.  */
+ 
+ void fiq_handler (void) __attribute__((interrupt ("FIQ")));
+ 
+ void
+ fiq_handler (void)
+ {
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/arm/fpscr.c gcc-5.5.0/gcc/testsuite/gcc.target/arm/fpscr.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/arm/fpscr.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/arm/fpscr.c	Mon Jul  3 09:38:23 2017
***************
*** 0 ****
--- 1,16 ----
+ /* Test the fpscr builtins.  */
+ 
+ /* { dg-do compile } */
+ /* { dg-require-effective-target arm_vfp_ok } */
+ /* { dg-skip-if "need fp instructions" { *-*-* } { "-mfloat-abi=soft" } { "" } } */
+ /* { dg-options "-mfpu=vfp -mfloat-abi=softfp" } */
+ 
+ void
+ test_fpscr ()
+ {
+   volatile unsigned int status = __builtin_arm_get_fpscr ();
+   __builtin_arm_set_fpscr (status);
+ }
+ 
+ /* { dg-final { scan-assembler "mrc\tp10, 7, r\[0-9\]+, cr1, cr0, 0" } } */
+ /* { dg-final { scan-assembler "mcr\tp10, 7, r\[0-9\]+, cr1, cr0, 0" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr77933-1.c gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr77933-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr77933-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr77933-1.c	Tue Dec 13 09:39:02 2016
***************
*** 0 ****
--- 1,46 ----
+ /* { dg-do run } */
+ /* { dg-options "-O2" } */
+ 
+ __attribute__ ((noinline, noclone)) void
+ clobber_lr_and_highregs (void)
+ {
+   __asm__ volatile ("" : : : "r8", "r9", "lr");
+ }
+ 
+ int
+ main (void)
+ {
+   int ret;
+ 
+   __asm volatile ("mov\tr4, #0xf4\n\t"
+ 		  "mov\tr5, #0xf5\n\t"
+ 		  "mov\tr6, #0xf6\n\t"
+ 		  "mov\tr7, #0xf7\n\t"
+ 		  "mov\tr0, #0xf8\n\t"
+ 		  "mov\tr8, r0\n\t"
+ 		  "mov\tr0, #0xfa\n\t"
+ 		  "mov\tr10, r0"
+ 		  : : : "r0", "r4", "r5", "r6", "r7", "r8", "r10");
+ 
+   clobber_lr_and_highregs ();
+ 
+   __asm volatile ("cmp\tr4, #0xf4\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "cmp\tr5, #0xf5\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "cmp\tr6, #0xf6\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "cmp\tr7, #0xf7\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "mov\tr0, r8\n\t"
+ 		  "cmp\tr0, #0xf8\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "mov\tr0, r10\n\t"
+ 		  "cmp\tr0, #0xfa\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "mov\t%0, #1\n"
+ 		  "fail:\n\t"
+ 		  "sub\tr0, #1"
+ 		  : "=r" (ret) : :);
+   return ret;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr77933-2.c gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr77933-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr77933-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr77933-2.c	Tue Dec 13 09:39:02 2016
***************
*** 0 ****
--- 1,47 ----
+ /* { dg-do run } */
+ /* { dg-skip-if "" { ! { arm_thumb1_ok || arm_thumb2_ok } } } */
+ /* { dg-options "-mthumb -O2 -mtpcs-leaf-frame" } */
+ 
+ __attribute__ ((noinline, noclone)) void
+ clobber_lr_and_highregs (void)
+ {
+   __asm__ volatile ("" : : : "r8", "r9", "lr");
+ }
+ 
+ int
+ main (void)
+ {
+   int ret;
+ 
+   __asm volatile ("mov\tr4, #0xf4\n\t"
+ 		  "mov\tr5, #0xf5\n\t"
+ 		  "mov\tr6, #0xf6\n\t"
+ 		  "mov\tr7, #0xf7\n\t"
+ 		  "mov\tr0, #0xf8\n\t"
+ 		  "mov\tr8, r0\n\t"
+ 		  "mov\tr0, #0xfa\n\t"
+ 		  "mov\tr10, r0"
+ 		  : : : "r0", "r4", "r5", "r6", "r7", "r8", "r10");
+ 
+   clobber_lr_and_highregs ();
+ 
+   __asm volatile ("cmp\tr4, #0xf4\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "cmp\tr5, #0xf5\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "cmp\tr6, #0xf6\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "cmp\tr7, #0xf7\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "mov\tr0, r8\n\t"
+ 		  "cmp\tr0, #0xf8\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "mov\tr0, r10\n\t"
+ 		  "cmp\tr0, #0xfa\n\t"
+ 		  "bne\tfail\n\t"
+ 		  "mov\t%0, #1\n"
+ 		  "fail:\n\t"
+ 		  "sub\tr0, #1"
+ 		  : "=r" (ret) : :);
+   return ret;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr78041.c gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr78041.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr78041.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr78041.c	Tue Jan 24 14:15:44 2017
***************
*** 0 ****
--- 1,20 ----
+ /* { dg-require-effective-target arm_thumb2_ok } */
+ /* { dg-require-effective-target arm_neon_ok } */
+ /* { dg-options "-fno-inline -mthumb -O1 -mfpu=neon -w" } */
+ 
+ extern void abort (void);
+ 
+ register long long x asm ("r1");
+ 
+ long long f (void)
+ {
+   return x << 5;
+ }
+ 
+ int main ()
+ {
+   x = 0x0100000001;
+   if (f () != 0x2000000020)
+     abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr78255-1.c gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr78255-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr78255-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr78255-1.c	Wed Jan 11 15:08:25 2017
***************
*** 0 ****
--- 1,57 ----
+ /* { dg-do run } */
+ /* { dg-options "-O2" }  */
+ 
+ #include <string.h>
+ 
+ struct table_s
+     {
+     void (*fun0)
+         ( void );
+     void (*fun1)
+         ( void );
+     void (*fun2)
+         ( void );
+     void (*fun3)
+         ( void );
+     void (*fun4)
+         ( void );
+     void (*fun5)
+         ( void );
+     void (*fun6)
+         ( void );
+     void (*fun7)
+         ( void );
+     } table;
+ 
+ void callback0(){__asm("mov r0, r0 \n\t");}
+ void callback1(){__asm("mov r0, r0 \n\t");}
+ void callback2(){__asm("mov r0, r0 \n\t");}
+ void callback3(){__asm("mov r0, r0 \n\t");}
+ void callback4(){__asm("mov r0, r0 \n\t");}
+ 
+ void test (void) {
+     memset(&table, 0, sizeof table);
+ 
+     asm volatile ("" : : : "r3");
+ 
+     table.fun0 = callback0;
+     table.fun1 = callback1;
+     table.fun2 = callback2;
+     table.fun3 = callback3;
+     table.fun4 = callback4;
+     table.fun0();
+ }
+ 
+ void foo (void)
+ {
+   __builtin_abort ();
+ }
+ 
+ int main (void)
+ {
+   unsigned long p = (unsigned long) &foo;
+   asm volatile ("mov r3, %0" : : "r" (p));
+   test ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr78255-2.c gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr78255-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/arm/pr78255-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/arm/pr78255-2.c	Wed Jan 11 15:08:25 2017
***************
*** 0 ****
--- 1,12 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O2" }  */
+ 
+ extern int bar (void *);
+ 
+ int
+ foo (void)
+ {
+   return bar ((void*)bar);
+ }
+ 
+ /* { dg-final { scan-assembler "bl?\\s+bar" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/avr/isr-test.h gcc-5.5.0/gcc/testsuite/gcc.target/avr/isr-test.h
*** gcc-5.4.0/gcc/testsuite/gcc.target/avr/isr-test.h	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/avr/isr-test.h	Tue Aug 22 10:01:38 2017
***************
*** 0 ****
--- 1,282 ----
+ #ifndef ISR_TEST_H
+ #define ISR_TEST_H
+ 
+ #include <string.h>
+ 
+ #define ISR(N,...)                                                      \
+ __attribute__ ((used, externally_visible , ## __VA_ARGS__))             \
+     void __vector_##N (void);                                           \
+     void __vector_##N (void)
+ 
+ #define SFR(ADDR) (*(unsigned char volatile*) (__AVR_SFR_OFFSET__ + (ADDR)))
+ #define CORE_SFRS SFR (0x38)
+ #define SREG      SFR (0x3F)
+ #define SPL       SFR (0x3D)
+ #define EIND      SFR (0x3C)
+ #define RAMPZ     SFR (0x3B)
+ #define RAMPY     SFR (0x3A)
+ #define RAMPX     SFR (0x39)
+ #define RAMPD     SFR (0x38)
+ 
+ #ifdef __AVR_HAVE_JMP_CALL__
+ #define VEC_SIZE 4
+ #else
+ #define VEC_SIZE 2
+ #endif
+ 
+ #ifdef __AVR_TINY__
+ #define FIRST_REG 16
+ #else
+ #define FIRST_REG 0
+ #endif
+ 
+ #define CR "\n\t"
+ 
+ typedef struct
+ {
+   unsigned char sfrs[8];
+   unsigned char gprs[32 - FIRST_REG];
+ } regs_t;
+ 
+ regs_t reginfo1, reginfo2;
+ 
+ __attribute__((noinline))
+ static void clear_reginfo (void)
+ {
+   memset (reginfo1.sfrs, 0, sizeof (reginfo1.sfrs));
+   memset (reginfo2.sfrs, 0, sizeof (reginfo2.sfrs));
+ }
+ 
+ __attribute__((noinline))
+ static void compare_reginfo (unsigned long gpr_ignore)
+ {
+   signed char regno;
+   const unsigned char *preg1 = &reginfo1.gprs[0];
+   const unsigned char *preg2 = &reginfo2.gprs[0];
+ 
+   if (memcmp (&reginfo1, &reginfo2, 8))
+     __builtin_abort();
+ 
+   gpr_ignore >>= FIRST_REG;
+ 
+     for (regno = FIRST_REG; regno < 32;
+        regno++, preg1++, preg2++, gpr_ignore >>= 1)
+     {
+       if (gpr_ignore & 1)
+         continue;
+ 
+       if (*preg1 != *preg2)
+         {
+           static signed char volatile failed_regno;
+           failed_regno = regno;
+           __builtin_abort();
+         }
+     }
+ }
+ 
+ /* STore GPR */
+ #define ST(regno,M)                                     \
+   CR "sts %[" #M "]+8-%[first]+" #regno ", r" #regno
+ 
+ /* STore SFR */
+ #define ST_SFR(sfr, n_sfr, M)                   \
+   CR "in __tmp_reg__,%i[s_" #sfr "]"            \
+   CR "sts %[" #M "]+" #n_sfr ", __tmp_reg__"
+ 
+ /* Named asm OPerand for SFR */
+ #define OP_SFR(sfr)                             \
+   , [s_ ## sfr] "n" (&(sfr))
+ 
+ /* Write funny value to SFR */
+ #define XX_SFR(sfr)                             \
+   CR "dec r31 $ out %i[s_" #sfr "], r31"
+ 
+ /* Write 0 to SFR */
+ #define OO_SFR(sfr)                             \
+   CR "out %i[s_" #sfr "], __zero_reg__"
+ 
+ /* Macros for SREG */
+ #define ST_SREG(M) ST_SFR (SREG,0,M)
+ #define OP_SREG    OP_SFR (SREG)
+ #define XX_SREG    XX_SFR (SREG)
+ 
+ /* Macros for EIND */
+ #if defined __AVR_HAVE_EIJMP_EICALL__
+ #define ST_EIND(M) ST_SFR (EIND,1,M)
+ #define OP_EIND    OP_SFR (EIND)
+ #else
+ #define ST_EIND(M) /* empty */
+ #define OP_EIND    /* empty */
+ #endif
+ 
+ /* Macros for RAMPX */
+ #if defined (__AVR_HAVE_RAMPX__)
+ #define ST_RAMPX(M) ST_SFR (RAMPX,2,M)
+ #define OP_RAMPX    OP_SFR (RAMPX)
+ #define XX_RAMPX    XX_SFR (RAMPX)
+ #define OO_RAMPX    OO_SFR (RAMPX)
+ #else
+ #define ST_RAMPX(M) /* empty */
+ #define OP_RAMPX    /* empty */
+ #define XX_RAMPX    /* empty */
+ #define OO_RAMPX    /* empty */
+ #endif
+ 
+ /* Macros for RAMPY */
+ #if defined (__AVR_HAVE_RAMPY__)
+ #define ST_RAMPY(M) ST_SFR (RAMPY,3,M)
+ #define OP_RAMPY    OP_SFR (RAMPY)
+ #define XX_RAMPY    XX_SFR (RAMPY)
+ #define OO_RAMPY    OO_SFR (RAMPY)
+ #else
+ #define ST_RAMPY(M) /* empty */
+ #define OP_RAMPY    /* empty */
+ #define XX_RAMPY    /* empty */
+ #define OO_RAMPY    /* empty */
+ #endif
+ 
+ /* Macros for RAMPZ */
+ #if defined (__AVR_HAVE_RAMPZ__)
+ #define ST_RAMPZ(M) ST_SFR (RAMPZ,4,M)
+ #define OP_RAMPZ    OP_SFR (RAMPZ)
+ #define XX_RAMPZ    XX_SFR (RAMPZ)
+ #define OO_RAMPZ    OO_SFR (RAMPZ)
+ #else
+ #define ST_RAMPZ(M) /* empty */
+ #define OP_RAMPZ    /* empty */
+ #define XX_RAMPZ    /* empty */
+ #define OO_RAMPZ    /* empty */
+ #endif
+ 
+ /* Macros for RAMPD */
+ #if defined (__AVR_HAVE_RAMPD__)
+ #define ST_RAMPD(M) ST_SFR (RAMPD,5,M)
+ #define OP_RAMPD    OP_SFR (RAMPD)
+ #else
+ #define ST_RAMPD(M) /* empty */
+ #define OP_RAMPD    /* empty */
+ #endif
+ 
+ /* Macros for all GPRs */
+ #if defined __AVR_TINY__
+ #define ST_REGS_LO(M) /* empty */
+ #else
+ #define ST_REGS_LO(M)                           \
+   ST(0,M)   ST(1,M)   ST(2,M)   ST(3,M)         \
+   ST(4,M)   ST(5,M)   ST(6,M)   ST(7,M)         \
+   ST(8,M)   ST(9,M)   ST(10,M)  ST(11,M)        \
+   ST(12,M)  ST(13,M)  ST(14,M)  ST(15,M)
+ #endif /* AVR_TINY */
+ 
+ #define ST_REGS_HI(M)                           \
+   ST(16,M)    ST(17,M)    ST(18,M)    ST(19,M)  \
+   ST(20,M)    ST(21,M)    ST(22,M)    ST(23,M)  \
+   ST(24,M)    ST(25,M)    ST(26,M)    ST(27,M)  \
+   ST(28,M)    ST(29,M)    ST(30,M)    ST(31,M)
+ 
+ __attribute__((unused,naked,noinline,noclone))
+ static void host_store1 (void)
+ {
+   __asm __volatile__
+   ("nop"
+    CR ".global do_stores_before"
+    CR ".type   do_stores_before,@function"
+    CR "do_stores_before:"
+    /* Funny values to some SFRs */
+    CR "ldi r31, 1 + 'Z'"
+    XX_RAMPZ
+    XX_RAMPY
+    XX_RAMPX
+    CR "dec __zero_reg__"
+    CR "clr r31"
+    XX_SREG
+    /* Must set I-flag due to RETI of ISR */
+    CR "sei"
+    /* Store core regs before ISR */
+    ST_RAMPX (mem1)
+    ST_RAMPY (mem1)
+    ST_RAMPZ (mem1)
+    ST_RAMPD (mem1)
+    ST_EIND  (mem1)
+    ST_SREG  (mem1)
+    CR "ldi r31, 0xaa"
+    CR "mov __tmp_reg__, r31"
+    CR "ldi r31, 31"
+    ST_REGS_LO (mem1)
+    ST_REGS_HI (mem1)
+    CR "ret"
+    : /* No outputs */
+    : [mem1] "i" (&reginfo1), [first] "n" (FIRST_REG)
+    OP_RAMPX
+    OP_RAMPY
+    OP_RAMPZ
+    OP_RAMPD
+    OP_EIND
+    OP_SREG
+    : "memory", "r31");
+ }
+ 
+ __attribute__((unused,naked,noinline,noclone))
+ static void host_store2 (void)
+ {
+   __asm __volatile__
+   ("nop"
+    CR ".global do_stores_after"
+    CR ".type   do_stores_after,@function"
+    CR "do_stores_after:"
+    /* Store core regs after ISR */
+    ST_REGS_LO (mem2)
+    ST_REGS_HI (mem2)
+    ST_RAMPX (mem2)
+    ST_RAMPY (mem2)
+    ST_RAMPZ (mem2)
+    ST_RAMPD (mem2)
+    ST_EIND  (mem2)
+    ST_SREG  (mem2)
+    /* Undo funny values */
+    CR "clr __zero_reg__"
+    OO_RAMPX
+    OO_RAMPY
+    OO_RAMPZ
+    CR "ret"
+    : /* No outputs */
+    : [mem2] "i" (&reginfo2), [first] "n" (FIRST_REG)
+    OP_RAMPX
+    OP_RAMPY
+    OP_RAMPZ
+    OP_RAMPD
+    OP_EIND
+    OP_SREG
+    : "memory");
+ }
+ 
+ #define MK_CALL_ISR(vecno)                      \
+   __asm __volatile__                            \
+   (/* Funny values to some SFRs */              \
+    /* Must set I-flag due to RETI of ISR */     \
+    /* Store core regs before ISR */             \
+    CR "%~call do_stores_before"                 \
+    /* Execute ISR */                            \
+    CR "%~call __vectors + %[vect]"              \
+    /* Store core regs after ISR */              \
+    /* Undo funny values */                      \
+    CR "%~call do_stores_after"                  \
+    : /* No outputs */                           \
+    : [vect] "i" (VEC_SIZE * (vecno))            \
+    , "i" (host_store1)                          \
+    , "i" (host_store2)                          \
+    : "memory", "r31")
+ 
+ 
+ #define MK_RUN_ISR(N, IGMSK)                    \
+                                                 \
+ __attribute__((noinline,noclone))               \
+ void run_isr_ ## N (void)                       \
+ {                                               \
+   clear_reginfo();                              \
+   MK_CALL_ISR (N);                              \
+   compare_reginfo (IGMSK);                      \
+ }
+ 
+ #endif /* ISR_TEST_H */
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/avr/pr65210.c gcc-5.5.0/gcc/testsuite/gcc.target/avr/pr65210.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/avr/pr65210.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/avr/pr65210.c	Tue Sep 27 06:39:59 2016
***************
*** 0 ****
--- 1,7 ----
+ /* { dg-do compile } */
+ 
+ /* This testcase exposes PR65210. Usage of the io_low attribute
+    causes assertion failure because code only looks for the io
+    attribute if SYMBOL_FLAG_IO is set. */
+ 
+ volatile char q __attribute__((io_low,address(0x81)));
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/avr/pr71103.c gcc-5.5.0/gcc/testsuite/gcc.target/avr/pr71103.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/avr/pr71103.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/avr/pr71103.c	Mon Jun 20 11:55:11 2016
***************
*** 0 ****
--- 1,16 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O1" } */
+ 
+ struct ResponseStruct{                                                                                            
+     unsigned char responseLength;
+     char *response;
+ };
+ 
+ static char response[5];
+ struct ResponseStruct something(){
+     struct ResponseStruct returnValue;
+     returnValue.responseLength = 5;
+     returnValue.response = response;
+     return returnValue;
+ }
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/isr-01-simple.c gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/isr-01-simple.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/isr-01-simple.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/isr-01-simple.c	Tue Aug 22 10:01:38 2017
***************
*** 0 ****
--- 1,98 ----
+ /* { dg-do run } */
+ /* { dg-options "-std=c99" } */
+ 
+ #include "../isr-test.h"
+ 
+ int volatile v;
+ 
+ /**********************************************************************/
+ 
+ ISR (1, signal)
+ {
+ }
+ 
+ MK_RUN_ISR (1, 0)
+ 
+ void test1 (void)
+ {
+   run_isr_1();
+ }
+ 
+ /**********************************************************************/
+ 
+ ISR (2, signal)
+ {
+   v++;
+ }
+ 
+ MK_RUN_ISR (2, 0)
+ 
+ void test2 (void)
+ {
+   v = 0;
+   run_isr_2();
+   if (v != 1)
+     __builtin_abort();
+ }
+ 
+ 
+ /**********************************************************************/
+ 
+ ISR (3, signal)
+ {
+   __asm __volatile__ ("$ lds  r27, v"
+                       "$ swap r27"
+                       "$ sts  v, r27"
+                       ::: "memory", "r27");
+ }
+ 
+ MK_RUN_ISR (3, 0)
+ 
+ void test3 (void)
+ {
+   run_isr_3();
+   if (v != 0x10)
+     __builtin_abort();
+ }
+ 
+ /**********************************************************************/
+ 
+ ISR (4, signal)
+ {
+   __asm __volatile__ ("sts v,__zero_reg__" ::: "memory");
+ }
+ 
+ MK_RUN_ISR (4, 0)
+ 
+ void test4 (void)
+ {
+   run_isr_4();
+   if (v != 0)
+     __builtin_abort();
+ }
+ 
+ /**********************************************************************/
+ 
+ ISR (5, signal)
+ {
+   __asm __volatile__ ("clt");
+ }
+ 
+ MK_RUN_ISR (5, 0)
+ 
+ void test5 (void)
+ {
+   run_isr_5();
+ }
+ 
+ /**********************************************************************/
+ 
+ int main (void)
+ {
+   test1();
+   test2();
+   test3();
+   test4();
+   test5();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/isr-02-call.c gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/isr-02-call.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/isr-02-call.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/isr-02-call.c	Tue Aug 22 10:01:38 2017
***************
*** 0 ****
--- 1,60 ----
+ /* { dg-do run } */
+ /* { dg-options "-std=c99" } */
+ 
+ #include "../isr-test.h"
+ 
+ int volatile v;
+ 
+ __attribute__((noinline,noclone))
+ void inc_v (void)
+ {
+   v++;
+ }
+ 
+ /**********************************************************************/
+ 
+ ISR (1, signal)
+ {
+   inc_v();
+ }
+ 
+ MK_RUN_ISR (1, 0)
+ 
+ void test1 (void)
+ {
+   run_isr_1();
+   if (v != 1)
+     __builtin_abort();
+ }
+ 
+ /**********************************************************************/
+ 
+ ISR (2, signal)
+ {
+   if (v == 1)
+     inc_v();
+   else
+     v += 2;
+ }
+ 
+ MK_RUN_ISR (2, 0)
+ 
+ void test2 (void)
+ {
+   run_isr_2();
+   if (v != 2)
+     __builtin_abort();
+   run_isr_2();
+   if (v != 4)
+     __builtin_abort();
+ }
+ 
+ 
+ /**********************************************************************/
+ 
+ int main (void)
+ {
+   test1();
+   test2();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/isr-03-fixed.c gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/isr-03-fixed.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/isr-03-fixed.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/isr-03-fixed.c	Tue Aug 22 10:01:38 2017
***************
*** 0 ****
--- 1,146 ----
+ /* { dg-do run } */
+ /* { dg-options "-std=gnu99 -fno-lto -fno-toplevel-reorder" } */
+ 
+ // No LTO for now due to PR lto/68384.
+ 
+ #ifdef __AVR_TINY__
+ unsigned char reg2;
+ #else
+ register unsigned char reg2 __asm("r2");
+ #endif
+ 
+ #include "../isr-test.h"
+ 
+ #define SET_REG(reg,val)                        \
+   do {                                          \
+     reg = (val);                                \
+     __asm __volatile__("" : "+r" (reg));        \
+   } while (0)                                   \
+ 
+ #define GET_REG(reg)                            \
+   ({                                            \
+     __asm __volatile__("" : "+r" (reg));        \
+     reg;                                        \
+   })
+ 
+ /**********************************************************************/
+ 
+ ISR (1, signal)
+ {
+   reg2++;
+ }
+ 
+ MK_RUN_ISR (1, 1ul << 2)
+ 
+ void test1 (void)
+ {
+   SET_REG (reg2, 0);
+   run_isr_1();
+   if (GET_REG (reg2) != 1)
+     __builtin_abort();
+ }
+ 
+ /**********************************************************************/
+ 
+ __attribute__((noinline,noclone))
+ void inc_r2 (void)
+ {
+   reg2++;
+ }
+ 
+ ISR (2, signal)
+ {
+   inc_r2 ();
+ }
+ 
+ MK_RUN_ISR (2, 1ul << 2)
+ 
+ void test2 (void)
+ {
+   run_isr_2();
+   if (GET_REG (reg2) != 2)
+     __builtin_abort();
+ }
+ 
+ 
+ /**********************************************************************/
+ 
+ ISR (3, signal)
+ {
+ #ifndef __AVR_TINY__
+   register char r4 __asm ("r4");
+   __asm __volatile ("inc %0" : "+r" (r4));
+   __asm __volatile ("inc r5" ::: "r5");
+ #endif
+ }
+ 
+ MK_RUN_ISR (3, 0)
+ 
+ void test3 (void)
+ {
+   run_isr_3();
+ }
+ 
+ 
+ /**********************************************************************/
+ 
+ #define CLOBB(reg)                                 \
+   do {                                             \
+     __asm __volatile__ ("inc " #reg ::: #reg);     \
+   } while (0)
+ 
+ ISR (4, signal)
+ {
+   char volatile v;
+   v = 1;
+ 
+ #ifndef __AVR_TINY__
+   CLOBB (r3);
+   CLOBB (r4);
+   CLOBB (r5);
+   CLOBB (r6);
+   CLOBB (r7);
+   CLOBB (r8);
+   CLOBB (r9);
+   CLOBB (r10);
+   CLOBB (r11);
+   CLOBB (r12);
+   CLOBB (r13);
+   CLOBB (r14);
+   CLOBB (r15);
+   CLOBB (r16);
+   CLOBB (r17);
+ #endif
+ 
+   CLOBB (r18);
+   CLOBB (r19);
+   CLOBB (r20);
+   CLOBB (r21);
+   CLOBB (r22);
+   CLOBB (r23);
+   CLOBB (r24);
+   CLOBB (r25);
+   CLOBB (r26);
+   CLOBB (r27);
+   CLOBB (r30);
+   CLOBB (r31);
+ }
+ 
+ MK_RUN_ISR (4, 0)
+ 
+ void test4 (void)
+ {
+   run_isr_4();
+ }
+ 
+ 
+ /**********************************************************************/
+ 
+ int main (void)
+ {
+   test1();
+   test2();
+   test3();
+   test4();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/pr71103-2.c gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/pr71103-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/pr71103-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/pr71103-2.c	Mon Jun 20 11:55:11 2016
***************
*** 0 ****
--- 1,118 ----
+ /* Use -g0 so that this test case doesn't just fail because
+    of PR52472.  */
+ 
+ /* { dg-do compile } */
+ /* { dg-options "-std=gnu99 -g0" } */
+ 
+ struct S12
+ {
+   char c;
+   const char *p;
+ };
+ 
+ struct S12f
+ {
+   char c;
+   struct S12f (*f)(void);
+ };
+ 
+ struct S12labl
+ {
+   char c;
+   void **labl;
+ };
+ 
+ struct S121
+ {
+   char c;
+   const char *p;
+   char d;
+ };
+ 
+ const char str[5] = "abcd";
+ 
+ struct S12 test_S12_0 (void)
+ {
+   struct S12 s;
+   s.c = 'A';
+   s.p = str;
+   return s;
+ }
+ 
+ struct S12 test_S12_4 (void)
+ {
+   struct S12 s;
+   s.c = 'A';
+   s.p = str + 4;
+   return s;
+ }
+ 
+ struct S12f test_S12f (void)
+ {
+   struct S12f s;
+   s.c = 'A';
+   s.f = test_S12f;
+   return s;
+ }
+ 
+ struct S121 test_S121 (void)
+ {
+   struct S121 s;
+   s.c = 'c';
+   s.p = str + 4;
+   s.d = 'd';
+   return s;
+ }
+ 
+ extern void use_S12lab (struct S12labl*);
+ 
+ struct S12labl test_S12lab (void)
+ {
+   struct S12labl s;
+ labl:;
+   s.c = 'A';
+   s.labl = &&labl;
+   return s;
+ }
+ 
+ #ifdef __MEMX
+ 
+ struct S13
+ {
+   char c;
+   const __memx char *p;
+ };
+ 
+ const __memx char str_x[] = "abcd";
+ 
+ struct S13 test_S13_0 (void)
+ {
+   struct S13 s;
+   s.c = 'A';
+   s.p = str_x;
+   return s;
+ }
+ 
+ struct S13 test_S13_4a (void)
+ {
+   struct S13 s;
+   s.c = 'A';
+   s.p = str_x + 4;
+   return s;
+ }
+ 
+ #ifdef __FLASH1
+ 
+ const __flash1 char str_1[] = "abcd";
+ 
+ struct S13 test_13_4b (void)
+ {
+   struct S13 s;
+   s.c = 'A';
+   s.p = str_1 + 4;
+   return s;
+ }
+ 
+ #endif /* have __flash1 */
+ #endif /* have __memx */
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/pr77326.c gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/pr77326.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/avr/torture/pr77326.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/avr/torture/pr77326.c	Wed Sep 21 14:11:59 2016
***************
*** 0 ****
--- 1,26 ----
+ /* { dg-do run } */
+ /* { dg-options "-Wl,--defsym,test1=0" } */
+ 
+ extern void test1 (void) __attribute__((weak));
+ 
+ __attribute__((noinline,noclone))
+ static void va_pseudo (int flag, ...)
+ {
+   __asm ("nop":);
+ }
+ 
+ __attribute__((noinline,noclone))
+ static void func (void)
+ {
+   va_pseudo (0, 0, 0, 0);
+ 
+   if (test1)
+     __builtin_abort ();
+ }
+ 
+ int main (void)
+ {
+   func();
+   __builtin_exit (0);
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/avx-pr80286.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/avx-pr80286.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/avx-pr80286.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/avx-pr80286.c	Tue May 30 08:23:29 2017
***************
*** 0 ****
--- 1,26 ----
+ /* PR target/80286 */
+ /* { dg-do run { target avx } } */
+ /* { dg-options "-O2 -mavx" } */
+ 
+ #include "avx-check.h"
+ #include <immintrin.h>
+ 
+ __m256i m;
+ 
+ __attribute__((noinline, noclone)) __m128i
+ foo (__m128i x)
+ {
+   int s = _mm_cvtsi128_si32 (_mm256_castsi256_si128 (m));
+   return _mm_srli_epi16 (x, s);
+ }
+ 
+ static void
+ avx_test (void)
+ {
+   __m128i a = (__m128i) (__v8hi) { 1 << 7, 2 << 8, 3 << 9, 4 << 10, 5 << 11, 6 << 12, 7 << 13, 8 << 12 };
+   m = (__m256i) (__v8si) { 7, 8, 9, 10, 11, 12, 13, 14 };
+   __m128i c = foo (a);
+   __m128i b = (__m128i) (__v8hi) { 1, 2 << 1, 3 << 2, 4 << 3, 5 << 4, 6 << 5, 7 << 6, 8 << 5 };
+   if (__builtin_memcmp (&c, &b, sizeof (__m128i)))
+     __builtin_abort ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/avx2-pr70574.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/avx2-pr70574.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/avx2-pr70574.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/avx2-pr70574.c	Thu Jul  7 12:34:07 2016
***************
*** 0 ****
--- 1,26 ----
+ /* PR rtl-optimization/70574 */
+ /* { dg-do run { target lp64 } } */
+ /* { dg-require-effective-target avx2 } */
+ /* { dg-options "-O -frerun-cse-after-loop -fno-tree-ccp -mcmodel=medium -mavx2" } */
+ /* { dg-additional-options "-fPIC" { target fpic } } */
+ 
+ #include "avx2-check.h"
+ 
+ typedef char A __attribute__((vector_size (32)));
+ typedef short B __attribute__((vector_size (32)));
+ 
+ int
+ foo (int x, __int128 y, __int128 z, A w)
+ {
+   y <<= 64;
+   w *= (A) { 0, -1, z, 0, ~y };
+   return w[0] + ((B) { x, 0, y, 0, -1 } | 1)[4];
+ }
+ 
+ static void
+ avx2_test ()
+ {
+   int x = foo (0, 0, 0, (A) {});
+   if (x != -1)
+     __builtin_abort ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr78339.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr78339.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr78339.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr78339.c	Wed Mar 22 12:31:04 2017
***************
*** 0 ****
--- 1,5 ----
+ /* { dg-do compile } */
+ /* { dg-options "-fcheck-pointer-bounds -mmpx -Wsuggest-attribute=noreturn" } */
+ 
+ extern _Noreturn void exit (int);
+ int main (void) { exit (1); }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr79631.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr79631.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr79631.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr79631.c	Wed Mar 22 12:29:56 2017
***************
*** 0 ****
--- 1,15 ----
+ /* { dg-do compile { target { ! x32 } } } */
+ /* { dg-options "-fcheck-pointer-bounds -mmpx -O2" } */
+ 
+ typedef struct { int _mp_size; } mpz_t[1];
+ int a, b;
+ void fn1()
+ {
+   mpz_t c[1][b];
+   for (;;) {
+       int d = 0 >= 0 ? 0 == 0 ? c[0][0]->_mp_size ? -1 : 0 : 0 : 0,
+ 	  e = 0 >= 0 ? 0 == 0 ? c[1][1]->_mp_size ? -1 : 0 : 0 : 0;
+       if (d != e)
+ 	a++;
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr79753.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr79753.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr79753.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr79753.c	Wed Mar 22 12:32:17 2017
***************
*** 0 ****
--- 1,14 ----
+ /* { dg-do compile } */
+ /* { dg-options "-fcheck-pointer-bounds -mmpx -O2" } */
+ 
+ int
+ foo (void)
+ {
+   return 0;
+ }
+ 
+ void
+ bar (int **p)
+ {
+   *p = (int *) (__UINTPTR_TYPE__) foo ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr79770.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr79770.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr79770.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr79770.c	Wed Mar 22 12:31:53 2017
***************
*** 0 ****
--- 1,19 ----
+ /* { dg-do compile { target lp64 } } */
+ /* { dg-options "-fcheck-pointer-bounds -mmpx -mabi=ms -Wno-psabi" } */
+ 
+ typedef unsigned U __attribute__ ((vector_size (64)));
+ typedef unsigned __int128 V __attribute__ ((vector_size (64)));
+ 
+ static inline V
+ bar (U u, U x, V v)
+ {
+   v = (V)(U) { 0, ~0 };
+   v[x[0]] <<= u[-63];
+   return v;
+ }
+ 
+ V
+ foo (U u)
+ {
+   return bar (u, (U) {}, (V) {});
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr79987.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr79987.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/mpx/pr79987.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/mpx/pr79987.c	Fri Sep 15 14:11:27 2017
***************
*** 0 ****
--- 1,5 ----
+ /* { dg-do compile } */
+ /* { dg-options "-fcheck-pointer-bounds -mmpx" } */
+ 
+ extern void foo;
+ void *bar = &foo; /* { dg-warning "taking address of expression of type .void." } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pcommit-1.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pcommit-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pcommit-1.c	Fri Nov 21 16:04:20 2014
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pcommit-1.c	Thu Jan  1 00:00:00 1970
***************
*** 1,11 ****
- /* { dg-do compile } */
- /* { dg-options "-O2 -mpcommit" } */
- /* { dg-final { scan-assembler "pcommit" } } */
- 
- #include "x86intrin.h"
- 
- void
- test_pcommit ()
- {
-   _mm_pcommit ();
- }
--- 0 ----
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr65044.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr65044.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr65044.c	Wed Jan 20 14:34:55 2016
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr65044.c	Wed Mar 22 12:32:39 2017
***************
*** 1,4 ****
! /* { dg-error "-fcheck-pointer-bounds is not supported with Address Sanitizer" } */
  /* { dg-do compile { target { ! x32 } } } */
  /* { dg-options "-fcheck-pointer-bounds -mmpx -fsanitize=address" } */
  
--- 1,4 ----
! /* { dg-error ".-fcheck-pointer-bounds. is not supported with Address Sanitizer" } */
  /* { dg-do compile { target { ! x32 } } } */
  /* { dg-options "-fcheck-pointer-bounds -mmpx -fsanitize=address" } */
  
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr71458.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr71458.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr71458.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr71458.c	Wed Mar 22 12:30:42 2017
***************
*** 0 ****
--- 1,7 ----
+ /* { dg-do compile { target { ! x32 } } } */
+ /* { dg-options "-fcheck-pointer-bounds -mmpx -fsanitize=bounds" } */
+ /* { dg-error "'-fcheck-pointer-bounds' is not supported with '-fsanitize=bounds'" "" { target *-*-* } 0 } */
+ 
+ enum {} a[0];
+ void fn1(int);
+ void fn2() { fn1(a[-1]); }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr76342.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr76342.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr76342.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr76342.c	Mon Aug 22 18:57:37 2016
***************
*** 0 ****
--- 1,11 ----
+ /* PR target/76342 */
+ /* { dg-do compile } */
+ /* { dg-options "-mavx512f" } */
+ 
+ #include <immintrin.h>
+ 
+ __m512i
+ test()
+ {
+   return _mm512_undefined_epi32 ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr77377.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr77377.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr77377.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr77377.c	Tue May 30 07:17:45 2017
***************
*** 0 ****
--- 1,6 ----
+ /* PR middle-end/77377 */
+ /* { dg-do compile } */
+ /* { dg-options "-O3 -msse" } */
+ /* { dg-additional-options "-fpic" { target fpic } } */
+ 
+ #include "../../c-c++-common/pr59037.c"
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr77403.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr77403.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr77403.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr77403.c	Mon Aug 29 20:26:13 2016
***************
*** 0 ****
--- 1,15 ----
+ /* { dg-do assemble } */
+ /* { dg-require-effective-target int128 } */
+ /* { dg-require-effective-target avx512f } */
+ /* { dg-require-effective-target masm_intel } */
+ /* { dg-options "-O -mavx512f -masm=intel" } */
+ 
+ typedef __int128 V __attribute__((vector_size(64)));
+ 
+ V v;
+ 
+ void
+ foo()
+ {
+   v ^= (V){1};
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr77594.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr77594.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr77594.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr77594.c	Tue May 30 07:23:20 2017
***************
*** 0 ****
--- 1,11 ----
+ /* PR middle-end/77594 */
+ /* { dg-do compile } */
+ /* { dg-options "-O0" } */
+ 
+ int
+ foo (int a, int *b)
+ {
+   return __builtin_sub_overflow (0, a, b);
+ }
+ 
+ /* { dg-final { scan-assembler-times "\tjn?o\t" 1 } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr77991.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr77991.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr77991.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr77991.c	Wed Oct 19 15:00:06 2016
***************
*** 0 ****
--- 1,19 ----
+ /* { dg-do compile { target { ! ia32 } } } */
+ /* { dg-require-effective-target maybe_x32 } */
+ /* { dg-options "-O2 -mx32 -maddress-mode=short" } */
+ 
+ struct rcu_reader_data
+ {
+   unsigned ctr;
+   _Bool waiting;
+ }
+ 
+ extern __thread rcu_reader;
+ 
+ void rcu_read_lock()
+ {
+   struct rcu_reader_data *x = &rcu_reader;
+   _Bool val = 0;
+ 
+   __atomic_store(&x->waiting, &val, 0);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr78227-1.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr78227-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr78227-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr78227-1.c	Tue May 30 07:39:37 2017
***************
*** 0 ****
--- 1,30 ----
+ /* PR target/78227 */
+ /* { dg-do compile } */
+ /* { dg-options "-mavx512f -O0 -Wno-psabi" } */
+ 
+ typedef int V __attribute__((vector_size (64)));
+ typedef long long int W __attribute__((vector_size (64)));
+ 
+ V
+ foo1 (V v)
+ {
+   return v > 0;
+ }
+ 
+ V
+ bar1 (V v)
+ {
+   return v != 0;
+ }
+ 
+ W
+ foo2 (W w)
+ {
+   return w > 0;
+ }
+ 
+ W
+ bar2 (W w)
+ {
+   return w != 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr78227-2.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr78227-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr78227-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr78227-2.c	Tue May 30 07:39:37 2017
***************
*** 0 ****
--- 1,30 ----
+ /* PR target/78227 */
+ /* { dg-do compile } */
+ /* { dg-options "-mavx512bw -O0 -Wno-psabi" } */
+ 
+ typedef signed char V __attribute__((vector_size (64)));
+ typedef short int W __attribute__((vector_size (64)));
+ 
+ V
+ foo1 (V v)
+ {
+   return v > 0;
+ }
+ 
+ V
+ bar1 (V v)
+ {
+   return v != 0;
+ }
+ 
+ W
+ foo2 (W w)
+ {
+   return w > 0;
+ }
+ 
+ W
+ bar2 (W w)
+ {
+   return w != 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr78262.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr78262.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr78262.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr78262.c	Wed Nov  9 20:41:17 2016
***************
*** 0 ****
--- 1,32 ----
+ /* { dg-do run } */
+ /* { dg-require-effective-target int128 } */
+ /* { dg-options "-O -fschedule-insns" } */
+ 
+ typedef unsigned char u8;
+ typedef unsigned __int128 u128;
+ 
+ static u128 u128_0;
+ static u128 *p128;
+ 
+ u128 __attribute__ ((noinline, noclone))
+ foo(u8 u8_0)
+ {
+   p128 = &u128_0;
+   u128_0 = u8_0;
+   u128_0 = u128_0 << 127 | u128_0 >> 1;
+   u128_0 >>= (u8)u128_0;
+   return 2 + u128_0;
+ }
+ 
+ int
+ main()
+ {
+   u128 x = foo(5);
+   if (p128 != &u128_0)
+     __builtin_abort();
+   if (u128_0 != ((u128)2 << 124))
+     __builtin_abort();
+   if (x != ((u128)2 << 124) + 2)
+     __builtin_abort();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr78310.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr78310.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr78310.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr78310.c	Fri Nov 11 17:04:18 2016
***************
*** 0 ****
--- 1,15 ----
+ /* { dg-do compile { target { ! ia32 } } } */
+ /* { dg-options "-O -mbmi2" } */
+ 
+ unsigned long long a;
+ int b;
+ 
+ int
+ fn1(int p1)
+ {
+   p1 &= 1;
+   p1 &= (short)~p1;
+   b = a;
+   a = a << p1 | a >> (64 - p1);
+   return p1 + 1 + a;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79514.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79514.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79514.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79514.c	Thu Mar  2 21:35:38 2017
***************
*** 0 ****
--- 1,12 ----
+ /* PR target/79514 */
+ /* { dg-do compile } */
+ /* { dg-options "-m96bit-long-double" } */
+ 
+ extern void bar (long double);
+ 
+ extern long double x;
+ 
+ void foo (void)
+ {
+   bar (x);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79559.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79559.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79559.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79559.c	Tue May 30 07:59:29 2017
***************
*** 0 ****
--- 1,11 ----
+ /* PR target/79559 */
+ /* { dg-do compile } */
+ 
+ void
+ foo (int x)
+ {
+   __asm__ volatile ("# %K0" : : "r" (x));	/* { dg-error "invalid operand code" } */
+   __asm__ volatile ("# %r0" : : "r" (x));	/* { dg-error "invalid operand code" } */
+   __asm__ volatile ("# %r0" : : "n" (129));	/* { dg-error "invalid operand code" } */
+   __asm__ volatile ("# %R0" : : "r" (x));	/* { dg-error "invalid operand code" } */
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79568-1.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79568-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79568-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79568-1.c	Tue May 30 08:00:48 2017
***************
*** 0 ****
--- 1,18 ----
+ /* PR target/79568 */
+ /* { dg-do compile } */
+ /* { dg-options "-mno-avx512vl -mavx512bw -O2" } */
+ 
+ #pragma GCC push_options
+ #pragma GCC target ("avx512vl,avx512bw")
+ void
+ foo (char __attribute__ ((__vector_size__(32))) *x, char __attribute__ ((__vector_size__(32))) *y, int z)
+ {
+   __builtin_ia32_storedquqi256_mask (x, *y, z);
+ }
+ #pragma GCC pop_options
+ 
+ void
+ bar (char __attribute__ ((__vector_size__(32))) *x, char __attribute__ ((__vector_size__(32))) *y, int z)
+ {
+   __builtin_ia32_storedquqi256_mask (x, *y, z); /* { dg-error "needs isa option" } */
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79568-2.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79568-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79568-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79568-2.c	Tue May 30 08:00:48 2017
***************
*** 0 ****
--- 1,18 ----
+ /* PR target/79568 */
+ /* { dg-do compile { target lp64 } } */
+ /* { dg-options "-mno-lwp" } */
+ 
+ #pragma GCC push_options
+ #pragma GCC target ("lwp")
+ void
+ foo (unsigned long x, unsigned int y)
+ {
+   __builtin_ia32_lwpval64 (x, y, 1);
+ }
+ #pragma GCC pop_options
+ 
+ void
+ bar (unsigned long x, unsigned int y)
+ {
+   __builtin_ia32_lwpval64 (x, y, 1);	 /* { dg-error "needs isa option" } */
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79568-3.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79568-3.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79568-3.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79568-3.c	Tue May 30 08:00:48 2017
***************
*** 0 ****
--- 1,19 ----
+ /* PR target/79568 */
+ /* { dg-do compile } */
+ /* { dg-options "-mno-sahf -mno-mmx -mno-sse" } */
+ /* { dg-additional-options "-march=i386" { target ia32 } } */
+ 
+ #pragma GCC push_options
+ #pragma GCC target ("sse")
+ void
+ foo (void)
+ {
+   __builtin_ia32_pause ();
+ }
+ #pragma GCC pop_options
+ 
+ void
+ bar (void)
+ {
+   __builtin_ia32_pause ();
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79729.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79729.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79729.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79729.c	Tue May 30 08:06:28 2017
***************
*** 0 ****
--- 1,8 ----
+ /* PR target/79729 */
+ /* { dg-do compile } */
+ 
+ void
+ foo (int x)
+ {
+   __asm__ volatile ("# %R0" : : "n" (129));	/* { dg-error "invalid operand code" } */
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79733.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79733.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79733.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79733.c	Fri Apr  7 05:15:54 2017
***************
*** 0 ****
--- 1,23 ----
+ /* PR target/79733 */
+ /* { dg-do compile } */
+ /* { dg-options "-O2 -mavx512f" } */
+ 
+ typedef unsigned short __mmask16;
+ 
+ extern __inline int
+ __attribute__ ((__gnu_inline__, __always_inline__, __artificial__))
+ _mm512_kortestc (__mmask16 __A, __mmask16 __B)
+ {
+   return (__mmask16) __builtin_ia32_kortestchi ((__mmask16) __A,
+                                                 (__mmask16) __B);
+ }
+ 
+ void
+ avx512f_test ()
+ {
+   volatile __mmask16 k1 = 0;
+   __mmask16 k2 = 0;
+   volatile short r;
+ 
+   r = _mm512_kortestc (k1, k2);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79807.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79807.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79807.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79807.c	Tue May 30 08:07:03 2017
***************
*** 0 ****
--- 1,12 ----
+ /* PR target/79807 */
+ /* { dg-do compile } */
+ /* { dg-options "-O0 -mavx -ffloat-store" } */
+ 
+ typedef double __v2df __attribute__ ((__vector_size__ (16)));
+ typedef double __v4df __attribute__ ((__vector_size__ (32)));
+ 
+ __v2df
+ foo (__v4df x)
+ {
+   return __builtin_ia32_pd_pd256 (x);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79901.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79901.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79901.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79901.c	Tue May 30 08:08:24 2017
***************
*** 0 ****
--- 1,22 ----
+ /* PR rtl-optimization/79901 */
+ /* { dg-do compile } */
+ /* { dg-options "-O3 -mavx512f -fno-ssa-phiopt" } */
+ 
+ unsigned int
+ foo (const unsigned long long x)
+ {
+   if (x < 0)
+     return 0;
+   else if ( x > ~0U)
+     return ~0U;
+   else
+     return (unsigned int) x;
+ }
+ 
+ void
+ bar (unsigned x, unsigned int *y, unsigned int z)
+ {
+   unsigned i;
+   for (i = 0; i < x; i++)
+     y[i] = foo (y[i] * (unsigned long long) z);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79932-1.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79932-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79932-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79932-1.c	Tue May 30 08:08:59 2017
***************
*** 0 ****
--- 1,19 ----
+ /* PR target/79932 */
+ /* { dg-do compile } */
+ /* { dg-options "-O0 -mavx512bw" } */
+ 
+ #include <x86intrin.h>
+ 
+ __m512i a, b, c, d, e, f, g, h, i;
+ __mmask32 m;
+ 
+ void
+ foo (void)
+ {
+   d = _mm512_packs_epi32 (a, b);
+   e = _mm512_maskz_packs_epi32 (m, a, b);
+   f = _mm512_mask_packs_epi32 (c, m, a, b);
+   g = _mm512_packus_epi32 (a, b);
+   h = _mm512_maskz_packus_epi32 (m, a, b);
+   i = _mm512_mask_packus_epi32 (c, m, a, b);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79932-2.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79932-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr79932-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr79932-2.c	Tue May 30 08:09:40 2017
***************
*** 0 ****
--- 1,78 ----
+ /* PR target/79932 */
+ /* { dg-do compile } */
+ /* { dg-options "-O0 -mavx512vl" } */
+ 
+ #include <x86intrin.h>
+ 
+ __m256i a, b;
+ __m128i c, d;
+ __mmask32 e, f[64];
+ 
+ void
+ foo (void)
+ {
+   f[0] = _mm256_cmpge_epi32_mask (a, b);
+   f[1] = _mm256_cmpge_epi64_mask (a, b);
+   f[2] = _mm256_cmpge_epu32_mask (a, b);
+   f[3] = _mm256_cmpge_epu64_mask (a, b);
+   f[4] = _mm256_cmple_epi32_mask (a, b);
+   f[5] = _mm256_cmple_epi64_mask (a, b);
+   f[6] = _mm256_cmple_epu32_mask (a, b);
+   f[7] = _mm256_cmple_epu64_mask (a, b);
+   f[8] = _mm256_cmplt_epi32_mask (a, b);
+   f[9] = _mm256_cmplt_epi64_mask (a, b);
+   f[10] = _mm256_cmplt_epu32_mask (a, b);
+   f[11] = _mm256_cmplt_epu64_mask (a, b);
+   f[12] = _mm256_cmpneq_epi32_mask (a, b);
+   f[13] = _mm256_cmpneq_epi64_mask (a, b);
+   f[14] = _mm256_cmpneq_epu32_mask (a, b);
+   f[15] = _mm256_cmpneq_epu64_mask (a, b);
+   f[16] = _mm256_mask_cmpge_epi32_mask (e, a, b);
+   f[17] = _mm256_mask_cmpge_epi64_mask (e, a, b);
+   f[18] = _mm256_mask_cmpge_epu32_mask (e, a, b);
+   f[19] = _mm256_mask_cmpge_epu64_mask (e, a, b);
+   f[20] = _mm256_mask_cmple_epi32_mask (e, a, b);
+   f[21] = _mm256_mask_cmple_epi64_mask (e, a, b);
+   f[22] = _mm256_mask_cmple_epu32_mask (e, a, b);
+   f[23] = _mm256_mask_cmple_epu64_mask (e, a, b);
+   f[24] = _mm256_mask_cmplt_epi32_mask (e, a, b);
+   f[25] = _mm256_mask_cmplt_epi64_mask (e, a, b);
+   f[26] = _mm256_mask_cmplt_epu32_mask (e, a, b);
+   f[27] = _mm256_mask_cmplt_epu64_mask (e, a, b);
+   f[28] = _mm256_mask_cmpneq_epi32_mask (e, a, b);
+   f[29] = _mm256_mask_cmpneq_epi64_mask (e, a, b);
+   f[30] = _mm256_mask_cmpneq_epu32_mask (e, a, b);
+   f[31] = _mm256_mask_cmpneq_epu64_mask (e, a, b);
+   f[32] = _mm_cmpge_epi32_mask (c, d);
+   f[33] = _mm_cmpge_epi64_mask (c, d);
+   f[34] = _mm_cmpge_epu32_mask (c, d);
+   f[35] = _mm_cmpge_epu64_mask (c, d);
+   f[36] = _mm_cmple_epi32_mask (c, d);
+   f[37] = _mm_cmple_epi64_mask (c, d);
+   f[38] = _mm_cmple_epu32_mask (c, d);
+   f[39] = _mm_cmple_epu64_mask (c, d);
+   f[40] = _mm_cmplt_epi32_mask (c, d);
+   f[41] = _mm_cmplt_epi64_mask (c, d);
+   f[42] = _mm_cmplt_epu32_mask (c, d);
+   f[43] = _mm_cmplt_epu64_mask (c, d);
+   f[44] = _mm_cmpneq_epi32_mask (c, d);
+   f[45] = _mm_cmpneq_epi64_mask (c, d);
+   f[46] = _mm_cmpneq_epu32_mask (c, d);
+   f[47] = _mm_cmpneq_epu64_mask (c, d);
+   f[48] = _mm_mask_cmpge_epi32_mask (e, c, d);
+   f[49] = _mm_mask_cmpge_epi64_mask (e, c, d);
+   f[50] = _mm_mask_cmpge_epu32_mask (e, c, d);
+   f[51] = _mm_mask_cmpge_epu64_mask (e, c, d);
+   f[52] = _mm_mask_cmple_epi32_mask (e, c, d);
+   f[53] = _mm_mask_cmple_epi64_mask (e, c, d);
+   f[54] = _mm_mask_cmple_epu32_mask (e, c, d);
+   f[55] = _mm_mask_cmple_epu64_mask (e, c, d);
+   f[56] = _mm_mask_cmplt_epi32_mask (e, c, d);
+   f[57] = _mm_mask_cmplt_epi64_mask (e, c, d);
+   f[58] = _mm_mask_cmplt_epu32_mask (e, c, d);
+   f[59] = _mm_mask_cmplt_epu64_mask (e, c, d);
+   f[60] = _mm_mask_cmpneq_epi32_mask (e, c, d);
+   f[61] = _mm_mask_cmpneq_epi64_mask (e, c, d);
+   f[62] = _mm_mask_cmpneq_epu32_mask (e, c, d);
+   f[63] = _mm_mask_cmpneq_epu64_mask (e, c, d);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr80019.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr80019.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr80019.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr80019.c	Wed Mar 15 16:15:53 2017
***************
*** 0 ****
--- 1,13 ----
+ /* PR target/80019 */
+ /* { dg-do compile } */
+ /* { dg-options "-O2 -mxop -mavx2" } */
+ 
+ typedef char v16qi __attribute__ ((vector_size (16)));
+ 
+ extern v16qi b, c;
+ 
+ void
+ foo (int e)
+ {
+   b = c << e;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr80569.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr80569.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr80569.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr80569.c	Mon Jul 24 20:29:02 2017
***************
*** 0 ****
--- 1,9 ----
+ /* PR target/80569 */
+ /* { dg-do assemble } */
+ /* { dg-options "-O2 -m16 -march=haswell" } */
+ 
+ void load_kernel(void *setup_addr)
+ {
+     unsigned int seg = (unsigned int)setup_addr >> 4;
+     asm("movl %0, %%es" : : "r"(seg));
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81128.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81128.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81128.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81128.c	Fri Sep 15 12:13:04 2017
***************
*** 0 ****
--- 1,65 ----
+ /* PR ipa/81128 */
+ /* { dg-do run } */
+ /* { dg-options "-O3" } */
+ /* { dg-require-ifunc "" } */
+ 
+ 
+ #include <stdio.h>
+ #include <stdlib.h>
+ #include <time.h>
+ 
+ int resolver_fn = 0;
+ int resolved_fn = 0;
+ 
+ static inline void
+ do_it_right_at_runtime_A ()
+ {
+   resolved_fn++;
+ }
+ 
+ static inline void
+ do_it_right_at_runtime_B ()
+ {
+   resolved_fn++;
+ }
+ 
+ static inline void do_it_right_at_runtime (void);
+ 
+ void do_it_right_at_runtime (void)
+   __attribute__ ((ifunc ("resolve_do_it_right_at_runtime")));
+ 
+ static void (*resolve_do_it_right_at_runtime (void)) (void)
+ {
+   srand (time (NULL));
+   int r = rand ();
+   resolver_fn++;
+ 
+   /* Use intermediate variable to get a warning for non-matching
+    * prototype. */
+   typeof(do_it_right_at_runtime) *func;
+   if (r & 1)
+     func = do_it_right_at_runtime_A;
+   else
+     func = do_it_right_at_runtime_B;
+ 
+   return (void *) func;
+ }
+ 
+ int
+ main (void)
+ {
+   const unsigned int ITERS = 10;
+ 
+   for (int i = ITERS; i > 0; i--)
+     {
+       do_it_right_at_runtime ();
+     }
+ 
+   if (resolver_fn != 1)
+     __builtin_abort ();
+ 
+   if (resolved_fn != 10)
+     __builtin_abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81300.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81300.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81300.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81300.c	Fri Jul 14 17:19:30 2017
***************
*** 0 ****
--- 1,30 ----
+ /* PR target/81300 */
+ /* { dg-do run { target { ! ia32 } } } */
+ /* { dg-options "-O2" } */
+ 
+ int
+ __attribute__((noinline, noclone))
+ foo (void)
+ {
+   unsigned long long _discard = 0, zero = 0, maxull = 0;
+   unsigned char zero1 = __builtin_ia32_addcarryx_u64 (0, 0, 0, &_discard);
+   unsigned char zero2 = __builtin_ia32_addcarryx_u64 (zero1, 0, 0, &zero);
+   __builtin_ia32_sbb_u64 (0x0, 2, -1, &_discard);
+   unsigned char one = __builtin_ia32_sbb_u64 (0, zero, 1, &maxull);
+   unsigned long long x = __builtin_ia32_sbb_u64 (one, zero2, 0, &_discard);
+ 
+   unsigned long long z1 = 0;
+   __asm__ ("mov{q}\t{%1, %0|%0, %1}" : "+r" (z1) : "r" (x));
+   unsigned long long z2 = 3;
+   __asm__ ("mov{q}\t{%1, %0|%0, %1}" : "+r" (z2) : "r" (x));
+ 
+   return 1 - (z1 | z2);
+ }
+ 
+ int main ()
+ {
+   if (foo ())
+     __builtin_abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81375.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81375.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81375.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81375.c	Fri Jul 14 17:19:30 2017
***************
*** 0 ****
--- 1,10 ----
+ /* PR target/81375 */
+ /* { dg-do compile { target ia32 } } */
+ /* { dg-options "-mno-80387 -mno-sse -mfpmath=sse" } */
+ 
+ /* { dg-warning "SSE instruction set disabled, using 387 arithmetics" "" { target *-*-* } 0 } */
+ 
+ float foo (float a, float b)
+ {
+   return a / b;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81471.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81471.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81471.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81471.c	Tue Jul 18 21:44:03 2017
***************
*** 0 ****
--- 1,13 ----
+ /* PR target/81471 */
+ /* { dg-do compile { target { ! ia32 } } } */
+ /* { dg-options "-O2 -mbmi2" } */
+ 
+ static inline unsigned int rotl (unsigned int x, int k)
+ {
+   return (x << k) | (x >> (32 - k));
+ }
+ 
+ unsigned long long test (unsigned int z)
+ {
+   return rotl (z, 55);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81766.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81766.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/pr81766.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/pr81766.c	Sat Sep 16 18:35:03 2017
***************
*** 0 ****
--- 1,5 ----
+ /* { dg-do compile } */
+ /* { dg-require-effective-target lp64 } */
+ /* { dg-options "-O2 -fPIE -mcmodel=large" } */
+ 
+ int main() { return 0; }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-12.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-12.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-12.c	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-12.c	Thu Oct 13 21:19:00 2016
***************
*** 3,9 ****
     popcntintrin.h and mm_malloc.h are usable
     with -O -std=c89 -pedantic-errors.  */
  /* { dg-do compile } */
! /* { dg-options "-O -std=c89 -pedantic-errors -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt -mavx512bw -mavx512dq -mavx512vl -mavx512vbmi -mavx512ifma -mclwb -mpcommit -mmwaitx" } */
  
  #include <x86intrin.h>
  
--- 3,9 ----
     popcntintrin.h and mm_malloc.h are usable
     with -O -std=c89 -pedantic-errors.  */
  /* { dg-do compile } */
! /* { dg-options "-O -std=c89 -pedantic-errors -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt -mavx512bw -mavx512dq -mavx512vl -mavx512vbmi -mavx512ifma -mclwb -mmwaitx" } */
  
  #include <x86intrin.h>
  
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-13.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-13.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-13.c	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-13.c	Thu Oct 13 21:19:00 2016
***************
*** 1,5 ****
  /* { dg-do compile } */
! /* { dg-options "-O2 -Werror-implicit-function-declaration -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt -mavx512vl -mavx512dq -mavx512bw -mavx512vbmi -mavx512ifma -mclwb -mpcommit -mmwaitx" } */
  
  #include <mm_malloc.h>
  
--- 1,5 ----
  /* { dg-do compile } */
! /* { dg-options "-O2 -Werror-implicit-function-declaration -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt -mavx512vl -mavx512dq -mavx512bw -mavx512vbmi -mavx512ifma -mclwb -mmwaitx" } */
  
  #include <mm_malloc.h>
  
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-14.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-14.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-14.c	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-14.c	Thu Oct 13 21:19:00 2016
***************
*** 1,5 ****
  /* { dg-do compile } */
! /* { dg-options "-O0 -Werror-implicit-function-declaration -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt -mavx512dq -mavx512bw -mavx512vl -mavx512ifma -mavx512vbmi -mclwb -mpcommit -mmwaitx" } */
  /* { dg-add-options bind_pic_locally } */
  
  #include <mm_malloc.h>
--- 1,5 ----
  /* { dg-do compile } */
! /* { dg-options "-O0 -Werror-implicit-function-declaration -march=k8 -msse4a -m3dnow -mavx -mavx2 -mfma4 -mxop -maes -mpclmul -mpopcnt -mabm -mlzcnt -mbmi -mbmi2 -mtbm -mlwp -mfsgsbase -mrdrnd -mf16c -mfma -mrtm -mrdseed -mprfchw -madx -mfxsr -mxsaveopt -mavx512f -mavx512er -mavx512cd -mavx512pf -msha -mprefetchwt1 -mxsavec -mxsaves -mclflushopt -mavx512dq -mavx512bw -mavx512vl -mavx512ifma -mavx512vbmi -mclwb -mmwaitx" } */
  /* { dg-add-options bind_pic_locally } */
  
  #include <mm_malloc.h>
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-22.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-22.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-22.c	Fri Jan 16 11:01:08 2015
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-22.c	Thu Oct 13 21:19:00 2016
*************** test_2 (_mm_clmulepi64_si128, __m128i, _
*** 699,705 ****
  
  /* x86intrin.h (FMA4/XOP/LWP/BMI/BMI2/TBM/LZCNT/FMA). */
  #ifdef DIFFERENT_PRAGMAS
! #pragma GCC target ("fma4,xop,lwp,bmi,bmi2,tbm,lzcnt,fma,rdseed,prfchw,adx,fxsr,xsaveopt,xsavec,xsaves,clflushopt,clwb,pcommit")
  #endif
  #include <x86intrin.h>
  /* xopintrin.h */
--- 699,705 ----
  
  /* x86intrin.h (FMA4/XOP/LWP/BMI/BMI2/TBM/LZCNT/FMA). */
  #ifdef DIFFERENT_PRAGMAS
! #pragma GCC target ("fma4,xop,lwp,bmi,bmi2,tbm,lzcnt,fma,rdseed,prfchw,adx,fxsr,xsaveopt,xsavec,xsaves,clflushopt,clwb")
  #endif
  #include <x86intrin.h>
  /* xopintrin.h */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-23.c gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-23.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/i386/sse-23.c	Thu Jun 18 10:56:43 2015
--- gcc-5.5.0/gcc/testsuite/gcc.target/i386/sse-23.c	Thu Oct 13 21:19:00 2016
***************
*** 594,599 ****
  #define __builtin_ia32_extracti64x2_256_mask(A, E, C, D) __builtin_ia32_extracti64x2_256_mask(A, 1, C, D)
  #define __builtin_ia32_extractf64x2_256_mask(A, E, C, D) __builtin_ia32_extractf64x2_256_mask(A, 1, C, D)
  
! #pragma GCC target ("sse4a,3dnow,avx,avx2,fma4,xop,aes,pclmul,popcnt,abm,lzcnt,bmi,bmi2,tbm,lwp,fsgsbase,rdrnd,f16c,fma,rtm,rdseed,prfchw,adx,fxsr,xsaveopt,avx512f,avx512er,avx512cd,avx512pf,sha,prefetchwt1,xsavec,xsaves,clflushopt,avx512bw,avx512dq,avx512vl,avx512vbmi,avx512ifma,clwb,pcommit,mwaitx")
  
  #include <x86intrin.h>
--- 594,599 ----
  #define __builtin_ia32_extracti64x2_256_mask(A, E, C, D) __builtin_ia32_extracti64x2_256_mask(A, 1, C, D)
  #define __builtin_ia32_extractf64x2_256_mask(A, E, C, D) __builtin_ia32_extractf64x2_256_mask(A, 1, C, D)
  
! #pragma GCC target ("sse4a,3dnow,avx,avx2,fma4,xop,aes,pclmul,popcnt,abm,lzcnt,bmi,bmi2,tbm,lwp,fsgsbase,rdrnd,f16c,fma,rtm,rdseed,prfchw,adx,fxsr,xsaveopt,avx512f,avx512er,avx512cd,avx512pf,sha,prefetchwt1,xsavec,xsaves,clflushopt,avx512bw,avx512dq,avx512vl,avx512vbmi,avx512ifma,clwb,mwaitx")
  
  #include <x86intrin.h>
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/builtins-3-p8.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/builtins-3-p8.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/builtins-3-p8.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/builtins-3-p8.c	Mon Feb  6 17:40:29 2017
***************
*** 0 ****
--- 1,26 ----
+ /* { dg-do compile } */
+ /* { dg-require-effective-target powerpc_p8vector_ok } */
+ /* { dg-options "-mcpu=power8" } */
+ 
+ #include <altivec.h>
+ 
+ vector signed int
+ test_vsi_packs_vsll_vsll (vector signed long long x,
+                           vector signed long long y)
+ {
+   return vec_packs (x, y);
+ }
+ 
+ vector unsigned int
+ test_vui_packs_vull_vull (vector unsigned long long x,
+                           vector unsigned long long y)
+ {
+   return vec_packs (x, y);
+ }
+ 
+ /* Expected test results:
+      test_vsi_packs_vsll_vsll                  1 vpksdss
+      test_vui_packs_vull_vull                  1 vpkudus */
+ 
+ /* { dg-final { scan-assembler-times "vpksdss"  1 } } */
+ /* { dg-final { scan-assembler-times "vpkudus"  1 } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/dfp-builtin-1.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/dfp-builtin-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/dfp-builtin-1.c	Tue Nov  4 12:09:50 2014
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/dfp-builtin-1.c	Mon Apr  3 18:06:52 2017
***************
*** 1,7 ****
  /* { dg-do compile { target { powerpc*-*-linux* } } } */
! /* { dg-skip-if "" { powerpc*-*-darwin* } { "*" } { "" } } */
! /* { dg-skip-if "" { powerpc*-*-*spe* } { "*" } { "" } } */
! /* { dg-require-effective-target powerpc_vsx_ok } */
  /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power7" } } */
  /* { dg-options "-mcpu=power7 -O2" } */
  /* { dg-final { scan-assembler-times "ddedpd " 4    } } */
--- 1,5 ----
  /* { dg-do compile { target { powerpc*-*-linux* } } } */
! /* { dg-require-effective-target hard_dfp } */
  /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power7" } } */
  /* { dg-options "-mcpu=power7 -O2" } */
  /* { dg-final { scan-assembler-times "ddedpd " 4    } } */
***************
*** 10,20 ****
  /* { dg-final { scan-assembler-times "diex "   1    } } */
  /* { dg-final { scan-assembler-times "dscli "  2    } } */
  /* { dg-final { scan-assembler-times "dscri "  2    } } */
  /* { dg-final { scan-assembler-not   "bl __builtin" } } */
  /* { dg-final { scan-assembler-not   "dctqpq"       } } */
  /* { dg-final { scan-assembler-not   "drdpq"        } } */
- /* { dg-final { scan-assembler-not   "stfd"         } } */
- /* { dg-final { scan-assembler-not   "lfd"          } } */
  
  _Decimal64
  do_dedpd_0 (_Decimal64 a)
--- 8,24 ----
  /* { dg-final { scan-assembler-times "diex "   1    } } */
  /* { dg-final { scan-assembler-times "dscli "  2    } } */
  /* { dg-final { scan-assembler-times "dscri "  2    } } */
+ /* { dg-final { scan-assembler-times "std "    1    { target lp64 } } } */
+ /* { dg-final { scan-assembler-times "ld "     1    { target lp64 } } } */
+ /* 32-bit needs a stack frame, and needs two GPR mem insns per _Decimal64.  */
+ /* { dg-final { scan-assembler-times "stwu "   2    { target ilp32 } } } */
+ /* { dg-final { scan-assembler-times "stw "    2    { target ilp32 } } } */
+ /* { dg-final { scan-assembler-times "lwz "    2    { target ilp32 } } } */
+ /* { dg-final { scan-assembler-times "stfd "   1    } } */
+ /* { dg-final { scan-assembler-times "lfd "    1    } } */
  /* { dg-final { scan-assembler-not   "bl __builtin" } } */
  /* { dg-final { scan-assembler-not   "dctqpq"       } } */
  /* { dg-final { scan-assembler-not   "drdpq"        } } */
  
  _Decimal64
  do_dedpd_0 (_Decimal64 a)
*************** do_enbcd_1 (_Decimal64 a)
*** 52,65 ****
    return __builtin_denbcd (1, a);
  }
  
! _Decimal64
  do_xex (_Decimal64 a)
  {
    return __builtin_dxex (a);
  }
  
  _Decimal64
! do_iex (_Decimal64 a, _Decimal64 b)
  {
    return __builtin_diex (a, b);
  }
--- 56,69 ----
    return __builtin_denbcd (1, a);
  }
  
! long long
  do_xex (_Decimal64 a)
  {
    return __builtin_dxex (a);
  }
  
  _Decimal64
! do_iex (long long a, _Decimal64 b)
  {
    return __builtin_diex (a, b);
  }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/dfp-builtin-2.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/dfp-builtin-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/dfp-builtin-2.c	Tue Nov  4 12:09:50 2014
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/dfp-builtin-2.c	Mon Apr  3 18:06:52 2017
***************
*** 1,7 ****
  /* { dg-do compile { target { powerpc*-*-linux* } } } */
! /* { dg-skip-if "" { powerpc*-*-darwin* } { "*" } { "" } } */
! /* { dg-skip-if "" { powerpc*-*-*spe* } { "*" } { "" } } */
! /* { dg-require-effective-target powerpc_vsx_ok } */
  /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power7" } } */
  /* { dg-options "-mcpu=power7 -O2" } */
  /* { dg-final { scan-assembler-times "ddedpdq " 4    } } */
--- 1,5 ----
  /* { dg-do compile { target { powerpc*-*-linux* } } } */
! /* { dg-require-effective-target hard_dfp } */
  /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power7" } } */
  /* { dg-options "-mcpu=power7 -O2" } */
  /* { dg-final { scan-assembler-times "ddedpdq " 4    } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr71763.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr71763.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr71763.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr71763.c	Tue Jul 12 15:13:47 2016
***************
*** 0 ****
--- 1,27 ----
+ // PR target/71763
+ // { dg-do compile }
+ // { dg-options "-O1 -mvsx" }
+ // { dg-xfail-if "PR70098" { lp64 && powerpc64_no_dm } }
+ // { dg-prune-output ".*internal compiler error.*" }
+ 
+ int a, b;
+ float c;
+ 
+ void fn2(void);
+ 
+ void fn1(void)
+ {
+         long d;
+ 
+         for (d = 3; d; d--) {
+                 for (a = 0; a <= 1; a++) {
+                         b &= 1;
+                         if (b) {
+                                 for (;;) {
+                                         fn2();
+                                         c = d;
+                                 }
+                         }
+                 }
+         }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr72863.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr72863.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr72863.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr72863.c	Thu Aug 25 16:12:23 2016
***************
*** 0 ****
--- 1,27 ----
+ /* { dg-do compile { target { powerpc64le-*-* } } } */
+ /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power8" } } */
+ /* { dg-options "-mcpu=power8 -O3" } */
+ /* { dg-final { scan-assembler "lxvd2x" } } */
+ /* { dg-final { scan-assembler "stxvd2x" } } */
+ /* { dg-final { scan-assembler-not "xxpermdi" } } */
+ 
+ #include <altivec.h>
+ 
+ extern unsigned char *src, *dst;
+ 
+ void b(void)
+ {
+   int i;
+ 
+   unsigned char *s8 = src;
+   unsigned char *d8 = dst;
+ 
+   for (i = 0; i < 100; i++) {
+     vector unsigned char vs = vec_vsx_ld(0, s8);
+     vector unsigned char vd = vec_vsx_ld(0, d8);
+     vector unsigned char vr = vec_xor(vs, vd);
+     vec_vsx_st(vr, 0, d8);
+     s8 += 16;
+     d8 += 16;
+   }
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr79197.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr79197.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr79197.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr79197.c	Tue May 30 07:56:11 2017
***************
*** 0 ****
--- 1,11 ----
+ /* PR target/79197 */
+ /* { dg-do compile } */
+ /* { dg-options "-O0 -mno-popcntd" } */
+ 
+ unsigned a;
+ 
+ void
+ foo (void)
+ {
+   a = *(double *) (__UINTPTR_TYPE__) 0x400000;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr79439.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr79439.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr79439.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr79439.c	Fri Mar 10 20:53:18 2017
***************
*** 0 ****
--- 1,29 ----
+ /* { dg-do compile { target { powerpc64*-*-linux* && lp64 } } } */
+ /* { dg-options "-O2 -fpic" } */
+ 
+ /* On the Linux 64-bit ABIs, we should not eliminate NOP in the 'rec' call if
+    -fpic is used because rec can be interposed at link time (since it is
+    external), and the recursive call should call the interposed function.  The
+    Linux 32-bit ABIs do not require NOPs after the BL instruction.  */
+ 
+ int f (void);
+ 
+ void
+ g (void)
+ {
+ }
+ 
+ int
+ rec (int a)
+ {
+   int ret = 0;
+   if (a > 10 && f ())
+     ret += rec (a - 1);
+   g ();
+   return a + ret;
+ }
+ 
+ /* { dg-final { scan-assembler-times {\mbl f\M}   1 } } */
+ /* { dg-final { scan-assembler-times {\mbl g\M}   2 } } */
+ /* { dg-final { scan-assembler-times {\mbl rec\M} 1 } } */
+ /* { dg-final { scan-assembler-times {\mnop\M}    4 } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr79544.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr79544.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr79544.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr79544.c	Wed Mar  1 21:17:46 2017
***************
*** 0 ****
--- 1,21 ----
+ /* { dg-do compile { target { powerpc*-*-* } } } */
+ /* { dg-require-effective-target powerpc_p8vector_ok } */
+ /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power8" } } */
+ /* { dg-options "-mcpu=power8 -O2" } */
+ 
+ #include <altivec.h>
+ 
+ vector unsigned long long
+ test_sra (vector unsigned long long x, vector unsigned long long y)
+ {
+   return vec_sra (x, y);
+ }
+ 
+ vector unsigned long long
+ test_vsrad (vector unsigned long long x, vector unsigned long long y)
+ {
+   return vec_vsrad (x, y);
+ }
+ 
+ /* { dg-final { scan-assembler-times {\mvsrad\M} 2 } } */
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr79951.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr79951.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr79951.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr79951.c	Tue Mar 21 16:36:39 2017
***************
*** 0 ****
--- 1,10 ----
+ /* { dg-do compile { target { powerpc*-*-* } } } */
+ /* { dg-require-effective-target powerpc_p8vector_ok } */
+ /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power8" } } */
+ /* { dg-options "-mcpu=power8 -S -mno-cmpb" } */
+ 
+ float testf (float x, float y)
+ {
+   return __builtin_copysignf (x, y);
+ }
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr80210.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr80210.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr80210.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr80210.c	Tue Aug 22 20:08:51 2017
***************
*** 0 ****
--- 1,10 ----
+ /* Test for ICE arising from GCC target pragma.  */
+ /* { dg-do compile } */
+ /* { dg-options "-O2" } */
+ 
+ double
+ foo (double a)
+ {
+   return __builtin_sqrt (a);
+ }
+ #pragma GCC target "no-powerpc-gpopt"
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr80246.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr80246.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr80246.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr80246.c	Mon Apr  3 18:06:52 2017
***************
*** 0 ****
--- 1,37 ----
+ /* { dg-do compile { target { powerpc*-*-linux* } } } */
+ /* { dg-require-effective-target hard_dfp } */
+ /* { dg-options "-O2" } */
+ /* { dg-final { scan-assembler-times "dxex "  1 } } */
+ /* { dg-final { scan-assembler-times "dxexq " 1 } } */
+ /* { dg-final { scan-assembler-times "diex "  1 } } */
+ /* { dg-final { scan-assembler-times "diexq " 1 } } */
+ /* { dg-final { scan-assembler-not "bl __builtin" } } */
+ /* Verify we don't generate any drintn., drintnq., dctfix, dctfixq, dcffix
+    or dcffixq instructions, as they imply we are getting unwanted casting.  */
+ /* { dg-final { scan-assembler-not "drintn\[q\]\." } } */
+ /* { dg-final { scan-assembler-not "dctfix\[q\]" } } */
+ /* { dg-final { scan-assembler-not "dcffix\[q\]" } } */
+ 
+ long long
+ do_xex (_Decimal64 arg)
+ {
+   return __builtin_dxex (arg);
+ }
+ 
+ long long
+ do_xexq (_Decimal128 arg)
+ {
+   return __builtin_dxexq (arg);
+ }
+ 
+ _Decimal64
+ do_iex (long long exp, _Decimal64 arg)
+ {
+   return __builtin_diex (exp, arg);
+ }
+ 
+ _Decimal128
+ do_iexq (long long exp, _Decimal128 arg)
+ {
+   return __builtin_diexq (exp, arg);
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr81833-1.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr81833-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr81833-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr81833-1.c	Tue Sep 12 21:07:30 2017
***************
*** 0 ****
--- 1,59 ----
+ /* PR81833: This used to fail due to improper implementation of vec_msum.  */
+ /* Test case relies on -mcpu=power7 or later.  Currently we don't have
+    machinery to express that, so we have two separate tests for -mcpu=power7
+    and -mcpu=power8 to catch 32-bit BE on P7 and 64-bit BE/LE on P8.  */
+ 
+ /* { dg-do run } */
+ /* { dg-require-effective-target p8vector_hw } */
+ /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power8" } } */
+ /* { dg-options "-mcpu=power8 -O2" } */
+ 
+ #include <altivec.h>
+ 
+ #define vec_u8  vector unsigned char
+ #define vec_s8  vector signed char
+ #define vec_u16 vector unsigned short
+ #define vec_s16 vector signed short
+ #define vec_u32 vector unsigned int
+ #define vec_s32 vector signed int
+ #define vec_f   vector float
+ 
+ #define LOAD_ZERO const vec_u8 zerov = vec_splat_u8 (0)
+ 
+ #define zero_u8v  (vec_u8)  zerov
+ #define zero_s8v  (vec_s8)  zerov
+ #define zero_u16v (vec_u16) zerov
+ #define zero_s16v (vec_s16) zerov
+ #define zero_u32v (vec_u32) zerov
+ #define zero_s32v (vec_s32) zerov
+ 
+ signed int __attribute__((noinline))
+ scalarproduct_int16_vsx (const signed short *v1, const signed short *v2,
+ 			 int order)
+ {
+   int i;
+   LOAD_ZERO;
+   register vec_s16 vec1;
+   register vec_s32 res = vec_splat_s32 (0), t;
+   signed int ires;
+ 
+   for (i = 0; i < order; i += 8) {
+     vec1 = vec_vsx_ld (0, v1);
+     t    = vec_msum (vec1, vec_vsx_ld (0, v2), zero_s32v);
+     res  = vec_sums (t, res);
+     v1  += 8;
+     v2  += 8;
+   }
+   res = vec_splat (res, 3);
+   vec_ste (res, 0, &ires);
+ 
+   return ires;
+ }
+ 
+ int main(void)
+ {
+   const signed short test_vec[] = { 1, 1, 1, 1, 1, 1, 1, 1 };
+   if (scalarproduct_int16_vsx (test_vec, test_vec, 8) != 8)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr81833-2.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr81833-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr81833-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr81833-2.c	Tue Sep 12 21:07:30 2017
***************
*** 0 ****
--- 1,59 ----
+ /* PR81833: This used to fail due to improper implementation of vec_msum.  */
+ /* Test case relies on -mcpu=power7 or later.  Currently we don't have
+    machinery to express that, so we have two separate tests for -mcpu=power7
+    and -mcpu=power8 to catch 32-bit BE on P7 and 64-bit BE/LE on P8.  */
+ 
+ /* { dg-do run } */
+ /* { dg-require-effective-target vsx_hw } */
+ /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power7" } } */
+ /* { dg-options "-mcpu=power7 -O2" } */
+ 
+ #include <altivec.h>
+ 
+ #define vec_u8  vector unsigned char
+ #define vec_s8  vector signed char
+ #define vec_u16 vector unsigned short
+ #define vec_s16 vector signed short
+ #define vec_u32 vector unsigned int
+ #define vec_s32 vector signed int
+ #define vec_f   vector float
+ 
+ #define LOAD_ZERO const vec_u8 zerov = vec_splat_u8 (0)
+ 
+ #define zero_u8v  (vec_u8)  zerov
+ #define zero_s8v  (vec_s8)  zerov
+ #define zero_u16v (vec_u16) zerov
+ #define zero_s16v (vec_s16) zerov
+ #define zero_u32v (vec_u32) zerov
+ #define zero_s32v (vec_s32) zerov
+ 
+ signed int __attribute__((noinline))
+ scalarproduct_int16_vsx (const signed short *v1, const signed short *v2,
+ 			 int order)
+ {
+   int i;
+   LOAD_ZERO;
+   register vec_s16 vec1;
+   register vec_s32 res = vec_splat_s32 (0), t;
+   signed int ires;
+ 
+   for (i = 0; i < order; i += 8) {
+     vec1 = vec_vsx_ld (0, v1);
+     t    = vec_msum (vec1, vec_vsx_ld (0, v2), zero_s32v);
+     res  = vec_sums (t, res);
+     v1  += 8;
+     v2  += 8;
+   }
+   res = vec_splat (res, 3);
+   vec_ste (res, 0, &ires);
+ 
+   return ires;
+ }
+ 
+ int main(void)
+ {
+   const signed short test_vec[] = { 1, 1, 1, 1, 1, 1, 1, 1 };
+   if (scalarproduct_int16_vsx (test_vec, test_vec, 8) != 8)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr82112.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr82112.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/pr82112.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/pr82112.c	Sat Sep 16 18:40:37 2017
***************
*** 0 ****
--- 1,16 ----
+ /* PR target/82112 */
+ /* { dg-do compile } */
+ /* { dg-require-effective-target powerpc_altivec_ok } */
+ /* { dg-options "-maltivec -std=gnu90" } */
+ 
+ #include <altivec.h>
+ 
+ struct __attribute__((aligned (16))) S { unsigned char c[64]; } bar (void);
+ vector unsigned char v;
+ 
+ void
+ foo (void)
+ {
+   vec_ld (0, bar ().c);	/* { dg-error "invalid parameter combination for AltiVec intrinsic" } */
+   vec_st (v, 0, bar ().c);	/* { dg-error "invalid parameter combination for AltiVec intrinsic" } */
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-20.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-20.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-20.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-20.c	Mon May  8 21:03:45 2017
***************
*** 0 ****
--- 1,29 ----
+ /* { dg-do run { target { powerpc64le-*-* } } } */
+ /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power8" } }
+ /* { dg-require-effective-target powerpc_altivec_ok } */
+ /* { dg-options "-O2 -mcpu=power8 -maltivec" } */
+ 
+ /* The expansion for vector character multiply introduces a vperm operation.
+    This tests that the swap optimization to remove swaps by changing the
+    vperm mask results in correct code.  */
+ 
+ #include <altivec.h>
+ 
+ void abort ();
+ 
+ vector unsigned char r;
+ vector unsigned char v =
+   { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 };
+ vector unsigned char i =
+   { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
+ vector unsigned char e =
+   {0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, 132, 156, 182, 210, 240};
+ 
+ int main ()
+ {
+   int j;
+   r = v * i;
+   if (!vec_all_eq (r, e))
+     abort ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-23.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-23.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-23.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-23.c	Mon May  8 21:03:45 2017
***************
*** 0 ****
--- 1,26 ----
+ /* { dg-do compile { target { powerpc64le-*-* } } } */
+ /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power8" } } */
+ /* { dg-options "-mcpu=power8 -O3 -ffast-math" } */
+ /* { dg-final { scan-assembler "lxvd2x" } } */
+ /* { dg-final { scan-assembler-not "xxpermdi" } } */
+ 
+ /* Verify that swap optimization works correctly in the presence of
+    a V2DFmode reduction.  */
+ 
+ extern double optvalue;
+ extern void obfuscate (double, unsigned int);
+ 
+ void
+ foo (double *x, double *y, unsigned int n, unsigned int m)
+ {
+   unsigned int i, j;
+   double sacc;
+   for (j = 0; j < m; ++j)
+     {
+       sacc = 0.0;
+       for (i = 0; i < n; ++i)
+ 	sacc += x[i] * y[i];
+       obfuscate (sacc, n);
+     }
+   optvalue = n * 2.0 * m;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-24.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-24.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-24.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/swaps-p8-24.c	Mon May  8 21:03:45 2017
***************
*** 0 ****
--- 1,26 ----
+ /* { dg-do compile { target { powerpc64le-*-* } } } */
+ /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power8" } } */
+ /* { dg-options "-mcpu=power8 -O3 -ffast-math" } */
+ /* { dg-final { scan-assembler "lxvd2x" } } */
+ /* { dg-final { scan-assembler-not "xxpermdi" } } */
+ 
+ /* Verify that swap optimization works correctly in the presence of
+    a V4SFmode reduction.  */
+ 
+ extern double optvalue;
+ extern void obfuscate (float, unsigned int);
+ 
+ void
+ foo (float *x, float *y, unsigned int n, unsigned int m)
+ {
+   unsigned int i, j;
+   float sacc;
+   for (j = 0; j < m; ++j)
+     {
+       sacc = 0.0f;
+       for (i = 0; i < n; ++i)
+ 	sacc += x[i] * y[i];
+       obfuscate (sacc, n);
+     }
+   optvalue = n * 2.0f * m;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/ti_math1.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/ti_math1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/ti_math1.c	Thu Apr 17 18:26:47 2014
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/ti_math1.c	Thu Jul  7 17:08:00 2016
***************
*** 1,7 ****
  /* { dg-do compile { target { powerpc*-*-* && lp64 } } } */
  /* { dg-options "-O2" } */
  /* { dg-final { scan-assembler-times "addc" 1 } } */
! /* { dg-final { scan-assembler-times "adde" 1 } } */
  /* { dg-final { scan-assembler-times "subfc" 1 } } */
  /* { dg-final { scan-assembler-times "subfe" 1 } } */
  /* { dg-final { scan-assembler-not "subf " } } */
--- 1,7 ----
  /* { dg-do compile { target { powerpc*-*-* && lp64 } } } */
  /* { dg-options "-O2" } */
  /* { dg-final { scan-assembler-times "addc" 1 } } */
! /* { dg-final { scan-assembler-times "addz?e" 1 } } */
  /* { dg-final { scan-assembler-times "subfc" 1 } } */
  /* { dg-final { scan-assembler-times "subfe" 1 } } */
  /* { dg-final { scan-assembler-not "subf " } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/vec-xxpermdi.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/vec-xxpermdi.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/vec-xxpermdi.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/vec-xxpermdi.c	Wed Feb 22 22:54:56 2017
***************
*** 0 ****
--- 1,68 ----
+ /* { dg-do run { target { powerpc64*-*-* && vsx_hw } } } */
+ /* { dg-options "-O2 -mvsx" } */
+ 
+ /* Added for PR79261 to test that vec_xxpermdi works correctly for
+    both BE and LE targets.  */
+ 
+ #include <altivec.h>
+ void abort (void);
+ 
+ vector double vdx = { 0.0, 1.0 };
+ vector double vdy = { 2.0, 3.0 };
+ vector double vdz;
+ 
+ vector signed long long vsllx = { 0, 1 };
+ vector signed long long vslly = { 2, 3 };
+ vector signed long long vsllz;
+ 
+ vector float vfx = { 0.0, 1.0, 2.0, 3.0 };
+ vector float vfy = { 4.0, 5.0, 6.0, 7.0 };
+ vector float vfz;
+ 
+ vector signed int vsix = { 0, 1, 2, 3 };
+ vector signed int vsiy = { 4, 5, 6, 7 };
+ vector signed int vsiz;
+ 
+ vector signed short vssx = { 0, 1, 2, 3, 4, 5, 6, 7 };
+ vector signed short vssy = { 8, 9, 10, 11, 12, 13, 14, 15 };
+ vector signed short vssz;
+ 
+ vector signed char vscx = { 0, 1, 2, 3, 4, 5, 6, 7,
+ 			    8, 9, 10, 11, 12, 13, 14, 15 };
+ vector signed char vscy = { 16, 17, 18, 19, 20, 21, 22, 23,
+ 			    24, 25, 26, 27, 28, 29, 30, 31 };
+ vector signed char vscz;
+ 
+ int
+ main ()
+ {
+   vdz = vec_xxpermdi (vdx, vdy, 0b01);
+   if (vdz[0] != 0.0 || vdz[1] != 3.0)
+     abort ();
+ 
+   vsllz = vec_xxpermdi (vsllx, vslly, 0b10);
+   if (vsllz[0] != 1 || vsllz[1] != 2)
+     abort ();
+ 
+   vfz = vec_xxpermdi (vfx, vfy, 0b01);
+   if (vfz[0] != 0.0 || vfz[1] != 1.0 || vfz[2] != 6.0 || vfz[3] != 7.0)
+     abort ();
+ 
+   vsiz = vec_xxpermdi (vsix, vsiy, 0b10);
+   if (vsiz[0] != 2 || vsiz[1] != 3 || vsiz[2] != 4 || vsiz[3] != 5)
+     abort ();
+ 
+   vssz = vec_xxpermdi (vssx, vssy, 0b00);
+   if (vssz[0] != 0 || vssz[1] != 1 || vssz[2] != 2 || vssz[3] != 3
+       || vssz[4] != 8 || vssz[5] != 9 || vssz[6] != 10 || vssz[7] != 11)
+     abort ();
+ 
+   vscz = vec_xxpermdi (vscx, vscy, 0b11);
+   if (vscz[0] != 8 || vscz[1] != 9 || vscz[2] != 10 || vscz[3] != 11
+       || vscz[4] != 12 || vscz[5] != 13 || vscz[6] != 14 || vscz[7] != 15
+       || vscz[8] != 24 || vscz[9] != 25 || vscz[10] != 26 || vscz[11] != 27
+       || vscz[12] != 28 || vscz[13] != 29 || vscz[14] != 30 || vscz[15] != 31)
+     abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/vsx-builtin-3.c gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/vsx-builtin-3.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/powerpc/vsx-builtin-3.c	Tue Nov  4 12:09:50 2014
--- gcc-5.5.0/gcc/testsuite/gcc.target/powerpc/vsx-builtin-3.c	Thu Feb 16 20:59:20 2017
***************
*** 35,40 ****
--- 35,42 ----
  /* { dg-final { scan-assembler "xvcmpgesp" } } */
  /* { dg-final { scan-assembler "xxsldwi" } } */
  /* { dg-final { scan-assembler-not "call" } } */
+ /* { dg-final { scan-assembler "xvcvsxdsp" } } */
+ /* { dg-final { scan-assembler "xvcvuxdsp" } } */
  
  extern __vector int si[][4];
  extern __vector short ss[][4];
*************** extern __vector __pixel p[][4];
*** 50,56 ****
--- 52,60 ----
  #ifdef __VSX__
  extern __vector double d[][4];
  extern __vector long sl[][4];
+ extern __vector long long sll[][4];
  extern __vector unsigned long ul[][4];
+ extern __vector unsigned long long ull[][4];
  extern __vector __bool long bl[][4];
  #endif
  
*************** int do_xxsldwi (void)
*** 211,213 ****
--- 215,236 ----
    d[i][0] = __builtin_vsx_xxsldwi (d[i][1], d[i][2], 3); i++;
    return i;
  }
+ 
+ int do_xvcvsxdsp (void)
+ {
+   int i = 0;
+ 
+   f[i][0] = __builtin_vsx_xvcvsxdsp (sll[i][1]); i++;
+ 
+   return i;
+ }
+ 
+ int do_xvcvuxdsp (void)
+ {
+   int i = 0;
+ 
+   f[i][0] = __builtin_vsx_xvcvuxdsp (ull[i][1]); i++;
+ 
+   return i;
+ }
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/s390/vector/vec-scalar-cmp-1.c gcc-5.5.0/gcc/testsuite/gcc.target/s390/vector/vec-scalar-cmp-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/s390/vector/vec-scalar-cmp-1.c	Thu Jul  2 15:51:41 2015
--- gcc-5.5.0/gcc/testsuite/gcc.target/s390/vector/vec-scalar-cmp-1.c	Fri Dec  2 08:51:58 2016
***************
*** 1,16 ****
  /* Check that we use the scalar variants of vector compares.  */
  
  /* { dg-do compile { target { s390*-*-* } } } */
! /* { dg-options "-O3 -mzarch -march=z13" } */
! 
! /* { dg-final { scan-assembler-times "wfcedbs\t%v\[0-9\]*,%v0,%v2" 2 } } */
! /* { dg-final { scan-assembler-times "wfchdbs\t%v\[0-9\]*,%v0,%v2" 1 } } */
! /* { dg-final { scan-assembler-times "wfchedbs\t%v\[0-9\]*,%v2,%v0" 1 } } */
! /* { dg-final { scan-assembler-times "wfchdbs\t%v\[0-9\]*,%v2,%v0" 1 } } */
! /* { dg-final { scan-assembler-times "wfchedbs\t%v\[0-9\]*,%v2,%v0" 1 } } */
! /* { dg-final { scan-assembler-times "locrne" 5 } } */
! /* { dg-final { scan-assembler-times "locrno" 1 } } */
! 
  
  int
  eq (double a, double b)
--- 1,7 ----
  /* Check that we use the scalar variants of vector compares.  */
  
  /* { dg-do compile { target { s390*-*-* } } } */
! /* { dg-options "-O3 -mzarch -march=z13 -fno-asynchronous-unwind-tables" } */
  
  int
  eq (double a, double b)
*************** eq (double a, double b)
*** 18,49 ****
--- 9,52 ----
    return a == b;
  }
  
+ /* { dg-final { scan-assembler "eq:\n\twfcedbs\t%v\[0-9\]*,%v0,%v2\n\tlhi\t%r1,0\n\tlhi\t%r2,1\n\tlocrne\t%r2,%r1" } } */
+ 
  int
  ne (double a, double b)
  {
    return a != b;
  }
  
+ /* { dg-final { scan-assembler "ne:\n\twfcedbs\t%v\[0-9\]*,%v0,%v2\n\tlhi\t%r1,0\n\tlhi\t%r2,1\n\tlocre\t%r2,%r1" } } */
+ 
  int
  gt (double a, double b)
  {
    return a > b;
  }
  
+ /* { dg-final { scan-assembler "gt:\n\twfchdbs\t%v\[0-9\]*,%v0,%v2\n\tlhi\t%r1,0\n\tlhi\t%r2,1\n\tlocrne\t%r2,%r1" } } */
+ 
  int
  ge (double a, double b)
  {
    return a >= b;
  }
  
+ /* { dg-final { scan-assembler "ge:\n\twfchedbs\t%v\[0-9\]*,%v0,%v2\n\tlhi\t%r1,0\n\tlhi\t%r2,1\n\tlocrne\t%r2,%r1" } } */
+ 
  int
  lt (double a, double b)
  {
    return a < b;
  }
  
+ /* { dg-final { scan-assembler "lt:\n\twfchdbs\t%v\[0-9\]*,%v2,%v0\n\tlhi\t%r1,0\n\tlhi\t%r2,1\n\tlocrne\t%r2,%r1" } } */
+ 
  int
  le (double a, double b)
  {
    return a <= b;
  }
+ 
+ /* { dg-final { scan-assembler "le:\n\twfchedbs\t%v\[0-9\]*,%v2,%v0\n\tlhi\t%r1,0\n\tlhi\t%r2,1\n\tlocrne\t%r2,%r1" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/s390/zvector/vec-cmp-1.c gcc-5.5.0/gcc/testsuite/gcc.target/s390/zvector/vec-cmp-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/s390/zvector/vec-cmp-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/s390/zvector/vec-cmp-1.c	Fri Dec  2 08:51:58 2016
***************
*** 0 ****
--- 1,174 ----
+ /* { dg-do compile { target { s390*-*-* } } } */
+ /* { dg-options "-O3 -mzarch -march=z13 -mzvector -fno-asynchronous-unwind-tables" } */
+ 
+ #include <vecintrin.h>
+ 
+ int __attribute__((noinline,noclone))
+ all_eq_double (vector double a, vector double b)
+ {
+ 	return vec_all_eq (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_eq_double:\n\tvfcedbs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocre\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_ne_double (vector double a, vector double b)
+ {
+ 	return vec_all_ne (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_ne_double:\n\tvfcedbs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrnle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_gt_double (vector double a, vector double b)
+ {
+ 	return vec_all_gt (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_gt_double:\n\tvfchdbs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocre\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_lt_double (vector double a, vector double b)
+ {
+ 	return vec_all_lt (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_lt_double:\n\tvfchdbs\t%v\[0-9\]*,%v26,%v24\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocre\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_ge_double (vector double a, vector double b)
+ {
+ 	return vec_all_ge (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_ge_double:\n\tvfchedbs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocre\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_le_double (vector double a, vector double b)
+ {
+ 	return vec_all_le (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_le_double:\n\tvfchedbs\t%v\[0-9\]*,%v26,%v24\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocre\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_eq_double (vector double a, vector double b)
+ {
+ 	return vec_any_eq (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_eq_double:\n\tvfcedbs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_ne_double (vector double a, vector double b)
+ {
+ 	return vec_any_ne (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_ne_double:\n\tvfcedbs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrne\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_gt_double (vector double a, vector double b)
+ {
+ 	return vec_any_gt (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_gt_double:\n\tvfchdbs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_lt_double (vector double a, vector double b)
+ {
+ 	return vec_any_lt (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_lt_double:\n\tvfchdbs\t%v\[0-9\]*,%v26,%v24\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_ge_double (vector double a, vector double b)
+ {
+ 	return vec_any_ge (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_ge_double:\n\tvfchedbs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_le_double (vector double a, vector double b)
+ {
+ 	return vec_any_le (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_le_double:\n\tvfchedbs\t%v\[0-9\]*,%v26,%v24\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_eq_int (vector int a, vector int b)
+ {
+ 	return vec_all_eq (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_eq_int:\n\tvceqfs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocre\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_ne_int (vector int a, vector int b)
+ {
+ 	return vec_all_ne (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_ne_int:\n\tvceqfs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrnle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_gt_int (vector int a, vector int b)
+ {
+ 	return vec_all_gt (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_gt_int:\n\tvchfs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocre\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_lt_int (vector int a, vector int b)
+ {
+ 	return vec_all_lt (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_lt_int:\n\tvchfs\t%v\[0-9\]*,%v26,%v24\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocre\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_ge_int (vector int a, vector int b)
+ {
+ 	return vec_all_ge (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_ge_int:\n\tvchfs\t%v\[0-9\]*,%v26,%v24\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrnle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ all_le_int (vector int a, vector int b)
+ {
+ 	return vec_all_le (a, b);
+ }
+ /* { dg-final { scan-assembler-times all_le_int:\n\tvchfs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrnle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_eq_int (vector int a, vector int b)
+ {
+ 	return vec_any_eq (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_eq_int:\n\tvceqfs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_ne_int (vector int a, vector int b)
+ {
+ 	return vec_any_ne (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_ne_int:\n\tvceqfs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrne\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_gt_int (vector int a, vector int b)
+ {
+ 	return vec_any_gt (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_gt_int:\n\tvchfs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_lt_int (vector int a, vector int b)
+ {
+ 	return vec_any_lt (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_lt_int:\n\tvchfs\t%v\[0-9\]*,%v26,%v24\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrle\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_ge_int (vector int a, vector int b)
+ {
+ 	return vec_any_ge (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_ge_int:\n\tvchfs\t%v\[0-9\]*,%v26,%v24\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrne\t%r2,%r1 1 } } */
+ 
+ int __attribute__((noinline,noclone))
+ any_le_int (vector int a, vector int b)
+ {
+ 	return vec_any_le (a, b);
+ }
+ /* { dg-final { scan-assembler-times any_le_int:\n\tvchfs\t%v\[0-9\]*,%v24,%v26\n\tlhi\t%r1,1\n\tlhi\t%r2,0\n\tlocrne\t%r2,%r1 1 } } */
+ 
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/sparc/20170228-1.c gcc-5.5.0/gcc/testsuite/gcc.target/sparc/20170228-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/sparc/20170228-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/sparc/20170228-1.c	Tue Feb 28 22:19:56 2017
***************
*** 0 ****
--- 1,20 ----
+ /* PR target/79749 */
+ /* Reported by Rainer Orth <ro@gcc.gnu.org> */
+ 
+ /* { dg-do run } */
+ /* { dg-options "-fomit-frame-pointer" } */
+ 
+ extern void abort (void);
+ 
+ int foo (int x1, int x2, int x3, int x4, int x5, int x6, int x7)
+ {
+   return x7;
+ }
+ 
+ int main (void)
+ {
+   if (foo (100, 200, 300, 400, 500, 600, 700) != 700)
+     abort ();
+ 
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf-1.c gcc-5.5.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf-1.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf-1.c	Sat Oct 15 22:43:42 2016
***************
*** 0 ****
--- 1,35 ----
+ /* { dg-do compile } */
+ /* { dg-options "-O -mvis2" } */
+ 
+ typedef long long int64_t;
+ typedef int vec32 __attribute__((vector_size(8)));
+ typedef short vec16 __attribute__((vector_size(8)));
+ typedef unsigned char vec8 __attribute__((vector_size(8)));
+ 
+ long test_bmask (long x, long y)
+ {
+   return __builtin_vis_bmask (x, y);
+ }
+ 
+ vec16 test_bshufv4hi (vec16 x, vec16 y)
+ {
+   return __builtin_vis_bshufflev4hi (x, y);
+ }
+ 
+ vec32 test_bshufv2si (vec32 x, vec32 y)
+ {
+   return __builtin_vis_bshufflev2si (x, y);
+ }
+ 
+ vec8 test_bshufv8qi (vec8 x, vec8 y)
+ {
+   return __builtin_vis_bshufflev8qi (x, y);
+ }
+ 
+ int64_t test_bshufdi (int64_t x, int64_t y)
+ {
+   return __builtin_vis_bshuffledi (x, y);
+ }
+ 
+ /* { dg-final { scan-assembler "bmask\t%" } } */
+ /* { dg-final { scan-assembler "bshuffle\t%" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf-2.c gcc-5.5.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf-2.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf-2.c	Sat Oct 15 22:43:42 2016
***************
*** 0 ****
--- 1,42 ----
+ /* { dg-do run } */
+ /* { dg-require-effective-target ultrasparc_vis2_hw } */
+ /* { dg-options "-mcpu=ultrasparc3 -O" } */
+ 
+ typedef unsigned int Vect __attribute__((vector_size(8)));
+ 
+ extern void abort (void);
+ 
+ Vect a, b, c, d;
+ 
+ __attribute__((noinline, noclone)) void test (void)
+ {
+   Vect mask = { 2, 2 };
+   int i;
+ 
+   c = __builtin_shuffle (a, mask);
+   d = __builtin_shuffle (a, b, mask);
+ 
+   __asm__ ("" : : "r" (&c), "r" (&d) : "memory");
+ 
+   for (i = 0; i < 2; ++i)
+     if (c[i] != a[mask[i] & 1])
+       abort ();
+     else if (mask[i] & 2)
+       {
+ 	if (d[i] != b[mask[i] & 1])
+ 	  abort ();
+       }
+ }
+ 
+ int main (void)
+ {
+   int i;
+   for (i = 0; i < 2; ++i)
+     {
+       a[i] = i + 2;
+       b[i] = 2 + i + 2;
+     }
+ 
+   test ();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf.c gcc-5.5.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf.c	Tue May 28 09:56:33 2013
--- gcc-5.5.0/gcc/testsuite/gcc.target/sparc/bmaskbshuf.c	Thu Jan  1 00:00:00 1970
***************
*** 1,35 ****
- /* { dg-do compile } */
- /* { dg-options "-O -mvis2" } */
- 
- typedef long long int64_t;
- typedef int vec32 __attribute__((vector_size(8)));
- typedef short vec16 __attribute__((vector_size(8)));
- typedef unsigned char vec8 __attribute__((vector_size(8)));
- 
- long test_bmask (long x, long y)
- {
-   return __builtin_vis_bmask (x, y);
- }
- 
- vec16 test_bshufv4hi (vec16 x, vec16 y)
- {
-   return __builtin_vis_bshufflev4hi (x, y);
- }
- 
- vec32 test_bshufv2si (vec32 x, vec32 y)
- {
-   return __builtin_vis_bshufflev2si (x, y);
- }
- 
- vec8 test_bshufv8qi (vec8 x, vec8 y)
- {
-   return __builtin_vis_bshufflev8qi (x, y);
- }
- 
- int64_t test_bshufdi (int64_t x, int64_t y)
- {
-   return __builtin_vis_bshuffledi (x, y);
- }
- 
- /* { dg-final { scan-assembler "bmask\t%" } } */
- /* { dg-final { scan-assembler "bshuffle\t%" } } */
--- 0 ----
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gcc.target/sparc/sparc-ret-3.c gcc-5.5.0/gcc/testsuite/gcc.target/sparc/sparc-ret-3.c
*** gcc-5.4.0/gcc/testsuite/gcc.target/sparc/sparc-ret-3.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gcc.target/sparc/sparc-ret-3.c	Tue Jun  6 18:54:55 2017
***************
*** 0 ****
--- 1,53 ----
+ /* PR target/80968 */
+ /* { dg-do compile } */
+ /* { dg-skip-if "no register windows" { *-*-* } { "-mflat" } { "" } } */
+ /* { dg-require-effective-target ilp32 } */
+ /* { dg-options "-mcpu=ultrasparc -O" } */
+ 
+ /* Make sure references to the stack frame do not slip into the delay slot
+    of a return instruction.  */
+ 
+ struct crypto_shash {
+ 	unsigned int descsize;
+ };
+ struct crypto_shash *tfm;
+ 
+ struct shash_desc {
+ 	struct crypto_shash *tfm;
+ 	unsigned int flags;
+ 
+ 	void *__ctx[] __attribute__((aligned(8)));
+ };
+ 
+ static inline unsigned int crypto_shash_descsize(struct crypto_shash *tfm)
+ {
+ 	return tfm->descsize;
+ }
+ 
+ static inline void *shash_desc_ctx(struct shash_desc *desc)
+ {
+ 	return desc->__ctx;
+ }
+ 
+ #define SHASH_DESC_ON_STACK(shash, ctx)				  \
+ 	char __##shash##_desc[sizeof(struct shash_desc) +	  \
+ 			      crypto_shash_descsize(ctx)] __attribute__((aligned(8))); \
+ 	struct shash_desc *shash = (struct shash_desc *)__##shash##_desc
+ 
+ extern int crypto_shash_update(struct shash_desc *, const void *, unsigned int);
+ 
+ unsigned int bug(unsigned int crc, const void *address, unsigned int length)
+ {
+ 	SHASH_DESC_ON_STACK(shash, tfm);
+ 	unsigned int *ctx = (unsigned int *)shash_desc_ctx(shash);
+ 	int err;
+ 
+ 	shash->tfm = tfm;
+ 	shash->flags = 0;
+ 	*ctx = crc;
+ 
+ 	err = crypto_shash_update(shash, address, length);
+ 
+ 	return *ctx;
+ }
+ /* { dg-final { scan-assembler "ld\[ \t\]*\\\[%i5\\+8\\\], %i0\n\[^\n\]*return\[ \t\]*%i7\\+8" } } */
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/allocate_with_source_20.f03 gcc-5.5.0/gcc/testsuite/gfortran.dg/allocate_with_source_20.f03
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/allocate_with_source_20.f03	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/allocate_with_source_20.f03	Thu Aug 11 07:57:58 2016
***************
*** 0 ****
--- 1,21 ----
+ ! { dg-do run }
+ 
+ ! Check that PR72698 is fixed.
+ ! Contributed by Gerhard Steinmetz
+ 
+ module m
+ contains
+    integer function f()
+       f = 4
+    end
+ end
+ program p
+    use m
+    character(3), parameter :: c = 'abc'
+    character(:), allocatable :: z
+    allocate (z, source=repeat(c(2:1), f()))
+    if (len(z) /= 0) call abort()
+    if (z /= "") call abort()
+ end
+ 
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/array_constructor_26.f03 gcc-5.5.0/gcc/testsuite/gfortran.dg/array_constructor_26.f03
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/array_constructor_26.f03	Thu Oct 29 19:37:59 2015
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/array_constructor_26.f03	Thu Sep 29 00:18:44 2016
*************** MODULE WinData
*** 10,16 ****
    INTEGER (1), PARAMETER :: MAXFLD = 25_1, MAXHED = 5_1, MAXCHR = 80_1
    integer :: i
    TYPE TWindowData
!     CHARACTER (MAX_FLD_HED, 1) :: DWFdHd(MAXFLD) = [(" ", i = 1, MAXFLD)]
!     ! { dg-error "specification expression" "" { target *-*-* } 13 }
    END TYPE TWindowData
  END MODULE WinData
--- 10,15 ----
    INTEGER (1), PARAMETER :: MAXFLD = 25_1, MAXHED = 5_1, MAXCHR = 80_1
    integer :: i
    TYPE TWindowData
!     CHARACTER (MAX_FLD_HED, 1) :: DWFdHd(MAXFLD) = [(" ", i = 1, MAXFLD)] ! { dg-error "Scalar INTEGER expression" }
    END TYPE TWindowData
  END MODULE WinData
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/array_constructor_27.f03 gcc-5.5.0/gcc/testsuite/gfortran.dg/array_constructor_27.f03
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/array_constructor_27.f03	Thu Oct 29 19:37:59 2015
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/array_constructor_27.f03	Thu Sep 29 00:18:44 2016
***************
*** 8,15 ****
  implicit none
  
  type t
!   character (a) :: arr (1) = [ "a" ]
!   ! { dg-error "specification expression" "" { target *-*-* } 11 }
  end type t
  
  end
--- 8,14 ----
  implicit none
  
  type t
!   character (a) :: arr (1) = [ "a" ] ! { dg-error "Scalar INTEGER expression" }
  end type t
  
  end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/array_constructor_49.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/array_constructor_49.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/array_constructor_49.f90	Thu Aug 14 18:52:12 2014
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/array_constructor_49.f90	Sun Jun 12 18:25:25 2016
***************
*** 6,12 ****
  program t
    integer :: ndim=2, ndfp=4, i
    character (len=8) :: line
!   write (unit=line,fmt='(4I2)'), (/ ( i, i = 1, ndfp ) /) + ndim
    if (line /= ' 3 4 5 6') call abort
  end program t
  ! { dg-final { scan-tree-dump-times "__var" 3 "original" } }
--- 6,12 ----
  program t
    integer :: ndim=2, ndfp=4, i
    character (len=8) :: line
!   write (unit=line,fmt='(4I2)') (/ ( i, i = 1, ndfp ) /) + ndim
    if (line /= ' 3 4 5 6') call abort
  end program t
  ! { dg-final { scan-tree-dump-times "__var" 3 "original" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/array_constructor_50.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/array_constructor_50.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/array_constructor_50.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/array_constructor_50.f90	Tue Aug  9 20:33:00 2016
***************
*** 0 ****
--- 1,21 ----
+ ! { dg-do run }
+ ! PR 71795 - wrong result when putting an array constructor
+ ! instide an iterator.
+      program test
+ 
+      implicit none
+      integer :: i,n
+      logical, dimension(1) :: ra
+      logical :: rs
+      integer, allocatable :: a(:)
+ 
+      allocate ( a(1) )
+ 
+      n = 1
+      a = 2
+ 
+      ra = (/ (any(a(i).eq.(/1,2,3/)) ,i=1,n) /)
+      if (.not. all(ra)) call abort
+      rs = any ( (/ (any(a(i).eq.(/1,2,3/)) ,i=1,n) /) )
+      if (.not. rs) call abort
+    end program test
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/associate_21.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/associate_21.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/associate_21.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/associate_21.f90	Tue Aug  9 06:28:57 2016
***************
*** 0 ****
--- 1,19 ----
+ ! { dg-do compile }
+ ! { dg-options "-ffrontend-optimize" }
+ ! PR 69742 - this used to ICE with front-end optimizatoin
+ ! Original test case by Marco Restelli.
+ program p
+  implicit none
+  integer, allocatable :: i(:), j
+ 
+   allocate( i(5) )
+   i = (/( j , j=1,5 )/)
+ 
+   ! The ICE appears when "size(i)" is used twice in associate
+   associate( i5 => i(size(i):size(i)) ) ! this gives ICE
+   !associate( i5 => i(size(2*i):size(i)) ) ! this works
+   i5 = 2
+   end associate
+ 
+   write(*,*) i
+ end program p
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/associate_22.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/associate_22.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/associate_22.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/associate_22.f90	Wed Oct  5 22:49:28 2016
***************
*** 0 ****
--- 1,37 ----
+ ! { dg-do run }
+ program foo
+ 
+    implicit none
+ 
+    character(len=4) :: s
+    character(len=10) :: a
+ 
+    ! This works.
+    s = 'abc'
+    associate(t => s)
+       if (trim(t) /= 'abc') call abort
+    end associate
+ 
+    ! This failed.
+    associate(u => 'abc')
+       if (trim(u) /= 'abc') call abort
+    end associate
+ 
+    ! This failed.
+    a = s // 'abc'
+    associate(v => s // 'abc')
+       if (trim(v) /= trim(a)) call abort
+    end associate
+ 
+    ! This failed.
+    a = trim(s) // 'abc'
+    associate(w => trim(s) // 'abc')
+       if (trim(w) /= trim(a)) call abort
+    end associate
+ 
+    ! This failed.
+    associate(x => trim('abc'))
+       if (trim(x) /= 'abc') call abort
+    end associate
+ 
+ end program foo
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/bounds_check_strlen_2.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/bounds_check_strlen_2.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/bounds_check_strlen_2.f90	Tue May 15 10:42:32 2012
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/bounds_check_strlen_2.f90	Thu Sep 29 00:18:44 2016
*************** CONTAINS
*** 11,18 ****
  
    SUBROUTINE test (str, n)
      IMPLICIT NONE
-     CHARACTER(len=n) :: str
      INTEGER :: n
    END SUBROUTINE test
  
    SUBROUTINE test2 (str)
--- 11,18 ----
  
    SUBROUTINE test (str, n)
      IMPLICIT NONE
      INTEGER :: n
+     CHARACTER(len=n) :: str
    END SUBROUTINE test
  
    SUBROUTINE test2 (str)
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/c_assoc_2.f03 gcc-5.5.0/gcc/testsuite/gfortran.dg/c_assoc_2.f03
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/c_assoc_2.f03	Mon Mar 25 15:40:26 2013
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/c_assoc_2.f03	Thu Sep 29 20:32:22 2016
*************** contains
*** 20,26 ****
         call abort()
      end if
  
!     if(.not. c_associated()) then ! { dg-error "Missing actual argument 'C_PTR_1' in call to 'c_associated'" }
         call abort()
      end if
  
--- 20,26 ----
         call abort()
      end if
  
!     if(.not. c_associated()) then ! { dg-error "Missing actual argument 'c_ptr_1' in call to 'c_associated'" }
         call abort()
      end if
  
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/c_assoc_4.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/c_assoc_4.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/c_assoc_4.f90	Mon Mar 25 15:40:26 2013
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/c_assoc_4.f90	Thu Sep 29 20:32:22 2016
*************** PROGRAM test
*** 9,14 ****
  
    TYPE (C_PTR) :: x, y
  
!   PRINT *, C_ASSOCIATED([x,y])  ! { dg-error "'C_PTR_1' argument of 'c_associated' intrinsic at .1. must be a scalar" }
  
  END PROGRAM test
--- 9,14 ----
  
    TYPE (C_PTR) :: x, y
  
!   PRINT *, C_ASSOCIATED([x,y])  ! { dg-error "'c_ptr_1' argument of 'c_associated' intrinsic at .1. must be a scalar" }
  
  END PROGRAM test
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/c_by_val_1.f gcc-5.5.0/gcc/testsuite/gfortran.dg/c_by_val_1.f
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/c_by_val_1.f	Wed Feb 28 18:17:34 2007
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/c_by_val_1.f	Tue Sep  6 15:25:09 2016
*************** C { dg-options "-ff2c -w -O0" }
*** 9,16 ****
        real(8)    a8, b8, c8
        integer(4) i, j, k
        integer(8) i8, j8, k8
!       complex    u, v, w, c_to_c
!       complex(8) u8, v8, w8, c_to_c8
  
        a = 42.0
        b = 0.0
--- 9,16 ----
        real(8)    a8, b8, c8
        integer(4) i, j, k
        integer(8) i8, j8, k8
!       complex    u, v, w
!       complex(8) u8, v8, w8
  
        a = 42.0
        b = 0.0
*************** C { dg-options "-ff2c -w -O0" }
*** 39,51 ****
        u = (-1.0, 2.0)
        v = (1.0, -2.0)
        w = u
!       v = c_to_c (%VAL (u), %REF (w), %LOC (w))
        if ((4.0 * u).ne.v) call abort ()
  
        u8 = (-1.0, 2.0)
        v8 = (1.0, -2.0)
        w8 = u8
!       v8 = c_to_c8 (%VAL (u8), %REF (w8), %LOC (w8))
        if ((4.0 * u8).ne.v8) call abort ()
  
        stop
--- 39,51 ----
        u = (-1.0, 2.0)
        v = (1.0, -2.0)
        w = u
!       call c_to_c (v, %VAL (u), %REF (w), %LOC (w))
        if ((4.0 * u).ne.v) call abort ()
  
        u8 = (-1.0, 2.0)
        v8 = (1.0, -2.0)
        w8 = u8
!       call c_to_c8 (v8, %VAL (u8), %REF (w8), %LOC (w8))
        if ((4.0 * u8).ne.v8) call abort ()
  
        stop
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/class_62.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/class_62.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/class_62.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/class_62.f90	Fri Apr 21 21:37:16 2017
***************
*** 0 ****
--- 1,29 ----
+ ! { dg-do run }
+ ! { dg-options "-fcheck=recursion" }
+ !
+ ! PR 80361: [5/6/7 Regression] bogus recursive call to nonrecursive procedure with -fcheck=recursion
+ !
+ ! Contributed by JÃ¼rgen Reuter <juergen.reuter@desy.de>
+ 
+ program main_ut
+ 
+   implicit none
+ 
+   type :: prt_spec_expr_t
+   end type
+ 
+   type :: prt_expr_t
+      class(prt_spec_expr_t), allocatable :: x
+   end type
+ 
+   type, extends (prt_spec_expr_t) :: prt_spec_list_t
+      type(prt_expr_t) :: e
+   end type
+ 
+   class(prt_spec_list_t), allocatable :: y
+ 
+   allocate (y)
+   allocate (prt_spec_list_t :: y%e%x)
+   deallocate(y)
+ 
+ end program
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/class_result_4.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/class_result_4.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/class_result_4.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/class_result_4.f90	Thu Nov 24 20:11:49 2016
***************
*** 0 ****
--- 1,6 ----
+ ! { dg-do compile }
+ ! PR fortran/78500
+ class(t) function f() ! { dg-error "must be dummy, allocatable or pointer" }
+    f = 1              ! { dg-error "variable must not be polymorphic" }
+ end
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/coarray_collectives_1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/coarray_collectives_1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/coarray_collectives_1.f90	Thu May  8 16:55:23 2014
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/coarray_collectives_1.f90	Fri Sep 30 21:46:14 2016
*************** program test
*** 14,20 ****
    integer(8) :: i8
    character(len=19, kind=4) :: msg4
  
!   call co_sum("abc") ! { dg-error "must be a numeric type" }
    call co_max(cmplx(1.0,0.0)) ! { dg-error "shall be of type integer, real or character" }
    call co_min(cmplx(0.0,1.0)) ! { dg-error "shall be of type integer, real or character" }
  
--- 14,20 ----
    integer(8) :: i8
    character(len=19, kind=4) :: msg4
  
!   call co_sum("abc") ! { dg-error "must have a numeric type" }
    call co_max(cmplx(1.0,0.0)) ! { dg-error "shall be of type integer, real or character" }
    call co_min(cmplx(0.0,1.0)) ! { dg-error "shall be of type integer, real or character" }
  
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/comma_IO_extension_1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/comma_IO_extension_1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/comma_IO_extension_1.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/comma_IO_extension_1.f90	Sun Jun 12 18:25:25 2016
***************
*** 0 ****
--- 1,8 ----
+ ! { dg-do compile }
+ ! PR 60751
+ ! Contributed by Walter Spector <w6ws@earthlink.net>
+ program extracomma
+   implicit none
+ 
+   write (*,*), 1, 2, 3 ! { dg-warning "Legacy Extension: Comma before i/o item list" }
+ end program
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/comma_IO_extension_2.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/comma_IO_extension_2.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/comma_IO_extension_2.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/comma_IO_extension_2.f90	Sun Jun 12 18:25:25 2016
***************
*** 0 ****
--- 1,9 ----
+ ! { dg-do compile }
+ ! { dg-options "-std=legacy" }
+ ! PR 60751
+ ! Contributed by Walter Spector <w6ws@earthlink.net>
+ program extracomma
+   implicit none
+ 
+   write (*,*), 1, 2, 3
+ end program
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/deferred_character_18.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/deferred_character_18.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/deferred_character_18.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/deferred_character_18.f90	Wed Jul 13 17:30:58 2016
***************
*** 0 ****
--- 1,13 ----
+ !{ dg-do run }
+ 
+ ! Check fix for PR fortran/71623
+ 
+ program allocatemvce
+   implicit none
+   character(len=:), allocatable :: string
+   integer, dimension(4), target :: array = [1,2,3,4]
+   integer, dimension(:), pointer :: array_ptr
+   array_ptr => array
+   ! The allocate used to segfault
+   allocate(character(len=size(array_ptr))::string)
+ end program allocatemvce
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/dependency_46.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/dependency_46.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/dependency_46.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/dependency_46.f90	Mon Jul 11 20:08:51 2016
***************
*** 0 ****
--- 1,11 ----
+ ! { dg-do compile }
+ ! PR 71783 - this used to ICE due to a missing charlen for the temporary.
+ ! Test case by Toon Moene.
+ 
+ SUBROUTINE prtdata(ilen)
+   INTEGER :: ilen
+   character(len=ilen), allocatable :: cline(:)
+   allocate(cline(2))
+   cline(1) = 'a'
+   cline(2) = cline(1)
+ END SUBROUTINE prtdata
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/dependency_47.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/dependency_47.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/dependency_47.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/dependency_47.f90	Tue Nov  1 08:12:00 2016
***************
*** 0 ****
--- 1,14 ----
+ ! { dg-do compile }
+ ! Make sure there is only one instance of a temporary variable here.
+ ! { dg-options "-fdump-tree-original" }
+ 
+ SUBROUTINE prtdata(ilen)
+   INTEGER :: ilen
+   character(len=ilen), allocatable :: cline(:)
+   allocate(cline(2))
+   cline(1) = 'a'
+   cline(1)(2:3) = cline(1)(1:2)
+   cline(2) = cline(1)
+   print *,c
+ END SUBROUTINE prtdata
+ ! { dg-final { scan-tree-dump-not "__var_" "original" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/dependency_48.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/dependency_48.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/dependency_48.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/dependency_48.f90	Mon Aug  8 08:24:22 2016
***************
*** 0 ****
--- 1,26 ----
+ ! { dg-do compile }
+ ! { dg-options "-frepack-arrays -Warray-temporaries -O" }
+ 
+ ! Same as dependency_35 but with repack-arrays
+ 
+ module foo
+   implicit none
+ contains
+   pure function bar(i,j) ! { dg-warning "Creating array temporary at \\(1\\)" }
+     integer, intent(in) :: i,j
+     integer, dimension(2,2) :: bar
+     bar = 33
+   end function bar
+ end module foo
+ 
+ program main
+   use foo
+   implicit none
+   integer a(2,2), b(2,2),c(2,2), d(2,2), e(2)
+ 
+   read (*,*) b, c, d
+   a = matmul(b,c) + d
+   a = b + bar(3,4)
+   a = bar(3,4)*5 + b
+   e = sum(b,1) + 3
+ end program main
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/dependency_49.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/dependency_49.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/dependency_49.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/dependency_49.f90	Tue Nov  1 08:12:00 2016
***************
*** 0 ****
--- 1,14 ----
+ ! { dg-do compile }
+ ! { dg-options "-fdump-tree-original" }
+ ! PR fortran/71902 - make sure that component references are followed
+ ! for dependency analysis.
+ program main
+   type foo
+      character(len=:), allocatable :: x
+   end type foo
+   type(foo) :: a
+   a%x = 'asdf'
+   a%x = a%x(2:3)
+   print *,a%x
+ end program main
+ ! { dg-final { scan-tree-dump-times "__var_1" 4 "original" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/extends_type_of_3.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/extends_type_of_3.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/extends_type_of_3.f90	Fri Jan  7 16:19:29 2011
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/extends_type_of_3.f90	Wed Nov 23 16:46:31 2016
***************
*** 3,11 ****
  !
  ! PR fortran/41580
  !
! ! Compile-time simplification of SAME_TYPE_AS
! ! and EXTENDS_TYPE_OF.
! !
  
  implicit none
  type t1
--- 3,9 ----
  !
  ! PR fortran/41580
  !
! ! Compile-time simplification of SAME_TYPE_AS and EXTENDS_TYPE_OF.
  
  implicit none
  type t1
*************** logical, parameter :: p6 = same_type_as(
*** 37,42 ****
--- 35,42 ----
  
  if (p1 .or. p2 .or. p3 .or. p4 .or. .not. p5 .or. .not. p6) call should_not_exist()
  
+ if (same_type_as(b1,b1)   .neqv. .true.) call should_not_exist()
+ 
  ! Not (trivially) compile-time simplifiable:
  if (same_type_as(b1,a1)  .neqv. .true.) call abort()
  if (same_type_as(b1,a11) .neqv. .false.) call abort()
*************** if (same_type_as(b1,a1)  .neqv. .false.)
*** 49,54 ****
--- 49,55 ----
  if (same_type_as(b1,a11) .neqv. .true.) call abort()
  deallocate(b1)
  
+ 
  ! .true. -> same type
  if (extends_type_of(a1,a1)   .neqv. .true.) call should_not_exist()
  if (extends_type_of(a11,a11) .neqv. .true.) call should_not_exist()
*************** if (extends_type_of(a2,b11) .neqv. .fals
*** 78,111 ****
  ! type extension possible, compile-time checkable
  if (extends_type_of(a1,a11) .neqv. .false.) call should_not_exist()
  if (extends_type_of(a11,a1) .neqv. .true.) call should_not_exist()
- if (extends_type_of(a1,a11) .neqv. .false.) call should_not_exist()
  
  if (extends_type_of(b1,a1)   .neqv. .true.) call should_not_exist()
  if (extends_type_of(b11,a1)  .neqv. .true.) call should_not_exist()
  if (extends_type_of(b11,a11) .neqv. .true.) call should_not_exist()
- if (extends_type_of(b1,a11)  .neqv. .false.) call should_not_exist()
  
! if (extends_type_of(a1,b11)  .neqv. .false.) call abort()
  
  ! Special case, simplified at tree folding:
  if (extends_type_of(b1,b1)   .neqv. .true.) call abort()
  
  ! All other possibilities are not compile-time checkable
  if (extends_type_of(b11,b1)  .neqv. .true.) call abort()
! !if (extends_type_of(b1,b11)  .neqv. .false.) call abort() ! FAILS due to PR 47189
  if (extends_type_of(a11,b11) .neqv. .true.) call abort()
  allocate(t11 :: b11)
  if (extends_type_of(a11,b11) .neqv. .true.) call abort()
  deallocate(b11)
  allocate(t111 :: b11)
  if (extends_type_of(a11,b11) .neqv. .false.) call abort()
  deallocate(b11)
  allocate(t11 :: b1)
  if (extends_type_of(a11,b1) .neqv. .true.) call abort()
  deallocate(b1)
  
  end
  
! ! { dg-final { scan-tree-dump-times "abort" 13 "original" } }
  ! { dg-final { scan-tree-dump-times "should_not_exist" 0 "original" } }
  ! { dg-final { cleanup-tree-dump "original" } }
--- 79,126 ----
  ! type extension possible, compile-time checkable
  if (extends_type_of(a1,a11) .neqv. .false.) call should_not_exist()
  if (extends_type_of(a11,a1) .neqv. .true.) call should_not_exist()
  
  if (extends_type_of(b1,a1)   .neqv. .true.) call should_not_exist()
  if (extends_type_of(b11,a1)  .neqv. .true.) call should_not_exist()
  if (extends_type_of(b11,a11) .neqv. .true.) call should_not_exist()
  
! if (extends_type_of(a1,b11)  .neqv. .false.) call should_not_exist()
! 
  
  ! Special case, simplified at tree folding:
  if (extends_type_of(b1,b1)   .neqv. .true.) call abort()
  
  ! All other possibilities are not compile-time checkable
  if (extends_type_of(b11,b1)  .neqv. .true.) call abort()
! if (extends_type_of(b1,b11)  .neqv. .false.) call abort()
  if (extends_type_of(a11,b11) .neqv. .true.) call abort()
+ 
  allocate(t11 :: b11)
  if (extends_type_of(a11,b11) .neqv. .true.) call abort()
  deallocate(b11)
+ 
  allocate(t111 :: b11)
  if (extends_type_of(a11,b11) .neqv. .false.) call abort()
  deallocate(b11)
+ 
  allocate(t11 :: b1)
  if (extends_type_of(a11,b1) .neqv. .true.) call abort()
  deallocate(b1)
  
+ allocate(t11::b1)
+ if (extends_type_of(b1,a11) .neqv. .true.) call abort()
+ deallocate(b1)
+ 
+ allocate(b1,source=a11)
+ if (extends_type_of(b1,a11) .neqv. .true.) call abort()
+ deallocate(b1)
+ 
+ allocate( b1,source=a1)
+ if (extends_type_of(b1,a11) .neqv. .false.) call abort()
+ deallocate(b1)
+ 
  end
  
! ! { dg-final { scan-tree-dump-times "abort" 16 "original" } }
  ! { dg-final { scan-tree-dump-times "should_not_exist" 0 "original" } }
  ! { dg-final { cleanup-tree-dump "original" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/fimplicit_none_1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/fimplicit_none_1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/fimplicit_none_1.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/fimplicit_none_1.f90	Thu Dec 22 20:27:52 2016
***************
*** 0 ****
--- 1,6 ----
+ ! { dg-do compile }
+ ! { dg-options "-fimplicit-none" }
+ subroutine s(n) ! { dg-error "has no IMPLICIT type" }
+    character(n) :: c  ! { dg-error "Scalar INTEGER expression expected" }
+    c = 'c' ! { dg-error "has no IMPLICIT type" }
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/fimplicit_none_2.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/fimplicit_none_2.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/fimplicit_none_2.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/fimplicit_none_2.f90	Thu Dec 22 20:27:52 2016
***************
*** 0 ****
--- 1,6 ----
+ ! { dg-do compile }
+ ! { dg-options "-fimplicit-none" }
+ ! PR fortran/78239 - used to ICE
+ program p
+    character(*), parameter :: z(2) = [character(n) :: 'x', 'y'] ! { dg-error "Scalar INTEGER expression expected" }
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/fmt_t_9.f gcc-5.5.0/gcc/testsuite/gfortran.dg/fmt_t_9.f
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/fmt_t_9.f	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/fmt_t_9.f	Mon Oct 31 23:40:40 2016
***************
*** 0 ****
--- 1,41 ----
+ ! { dg-options "-ffixed-line-length-none -std=gnu" }
+ ! { dg-do run }
+ ! PR78123 Short reads with T edit descriptor not padding correctly
+       PROGRAM tformat
+ C
+       INTEGER  MXFLTL
+       PARAMETER (MXFLTL = 99999)
+       INTEGER   IFLGHT, NFLCYC, IFLTSQ(MXFLTL), IDXBLK, LMAX, LMIN, I
+ C
+       OPEN(29, status='scratch')
+       WRITE(29, '(a)') "   1   1   1  TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT      72  122     4"
+       WRITE(29, '(a)') ""
+       WRITE(29, '(a)') "  451   402012011201120112011200120112011201120112011201120111971201120112011201120112011201"
+       WRITE(29, '(a)') "  451   4020 866 866 866 866 866 866 866 866 865 866 865 866 866 866 866 866 866 866 865 866"
+       REWIND(29)
+ C     The error occurs in the following loop:
+  10   CONTINUE
+          READ(29,1010   )  IDXBLK, LMAX, LMIN
+ 1010     FORMAT(8X,I4,T51,2I5) ! wrong if this format is used
+ c         write(6,fmt='("IDXBLK,LMAX,LMIN=",3I5)')IDXBLK,LMAX,LMIN
+          IF (IDXBLK .EQ. 0)  GO TO 20
+       GO TO 10
+ C
+  20   CONTINUE
+       READ(29,1040,END=100)  IFLGHT, NFLCYC,
+      &              (IFLTSQ(I), I=1,NFLCYC)
+ 1040  FORMAT(I5,I5,2X,(T13,20I4))
+ c      write(6,fmt='(2i6)') IFLGHT,NFLCYC
+ c      write(6,fmt='(20I4)') (IFLTSQ(I), I=1,NFLCYC)
+ c      write(6,*) "Program is correct"
+       close(29)
+       if (IFLGHT.ne.451) call abort
+       if (NFLCYC.ne.40) call abort
+       stop
+ C
+  100  CONTINUE
+ C      write(6,*) "End of file encountered (wrong)"
+       close (29)
+       call abort
+       STOP
+       END
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/forall_18.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/forall_18.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/forall_18.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/forall_18.f90	Sun Nov 20 20:14:18 2016
***************
*** 0 ****
--- 1,16 ----
+ ! { dg-do compile }
+ ! PR fortran/69741 - improve error message for nonscalar FORALL index variables
+ !
+ subroutine check
+   integer :: ii(2), i
+   real :: a(3,2)
+ 
+   forall (ii(1)=1:3, i=1:2) ! { dg-error "scalar variable of type integer" }
+      a(ii(1),i) = ii(1) * i
+   end forall
+ 
+   forall (j=1:3, ii(2)=1:2) ! { dg-error "scalar variable of type integer" }
+      a(j,ii(2)) = j * ii(2)
+   end forall
+ 
+ end subroutine check
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/goacc/pr71704.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/goacc/pr71704.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/goacc/pr71704.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/goacc/pr71704.f90	Fri Jul  8 21:58:57 2016
***************
*** 0 ****
--- 1,49 ----
+ ! PR fortran/71704
+ ! { dg-do compile }
+ 
+ real function f1 ()
+ !$acc routine (f1)
+   f1 = 1
+ end
+ 
+ real function f2 (a)
+   integer a
+   !$acc enter data copyin(a)
+   f2 = 1
+ end
+ 
+ real function f3 (a)
+   integer a
+ !$acc enter data copyin(a)
+   f3 = 1
+ end
+ 
+ real function f4 ()
+ !$acc wait
+   f4 = 1
+ end
+ 
+ real function f5 (a)
+   integer a
+ !$acc update device(a)
+   f5 = 1
+ end
+ 
+ real function f6 ()
+ !$acc parallel
+ !$acc end parallel
+   f6 = 1
+ end
+ 
+ real function f7 ()
+ !$acc kernels
+ !$acc end kernels
+   f7 = 1
+ end
+ 
+ real function f8 ()
+ !$acc data
+ !$acc end data
+   f8 = 1
+ end
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/map-1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/map-1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/map-1.f90	Thu Jan 15 20:11:12 2015
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/map-1.f90	Tue May 30 07:52:55 2017
*************** subroutine test(aas)
*** 70,76 ****
    ! { dg-error "Rightmost upper bound of assumed size array section not specified" "" { target *-*-* } 68 }
    ! { dg-error "'aas' in MAP clause at \\\(1\\\) is not a proper array section" "" { target *-*-* } 68 }
  
!   !$omp target map(aas) ! { dg-error "The upper bound in the last dimension must appear" "" { xfail *-*-* } }
    !$omp end target
  
    !$omp target map(aas(5:7))
--- 70,76 ----
    ! { dg-error "Rightmost upper bound of assumed size array section not specified" "" { target *-*-* } 68 }
    ! { dg-error "'aas' in MAP clause at \\\(1\\\) is not a proper array section" "" { target *-*-* } 68 }
  
!   !$omp target map(aas) ! { dg-error "Assumed size array" }
    !$omp end target
  
    !$omp target map(aas(5:7))
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr69183.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr69183.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr69183.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr69183.f90	Tue May 30 07:44:51 2017
***************
*** 0 ****
--- 1,11 ----
+ ! PR middle-end/69183
+ ! { dg-do compile }
+ 
+ program pr69183
+   integer, allocatable :: z
+   integer :: i
+   !$omp do private(z)
+   do i = 1, 2
+     z = i
+   end do
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr71704.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr71704.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr71704.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr71704.f90	Thu Jul  7 12:50:01 2016
***************
*** 0 ****
--- 1,58 ----
+ ! PR fortran/71704
+ ! { dg-do compile }
+ 
+ real function f0 ()
+ !$omp declare simd (f0)
+   f0 = 1
+ end
+ 
+ real function f1 ()
+ !$omp declare target (f1)
+   f1 = 1
+ end
+ 
+ real function f2 ()
+ !$omp declare reduction (foo : integer : omp_out = omp_out + omp_in) &
+ !$omp & initializer (omp_priv = 0)
+   f2 = 1
+ end
+ 
+ real function f3 ()
+   real, save :: t
+ !$omp threadprivate (t)
+   f3 = 1
+ end
+ 
+ real function f4 ()
+ !$omp taskwait
+   f4 = 1
+ end
+ 
+ real function f5 ()
+ !$omp barrier
+   f5 = 1
+ end
+ 
+ real function f6 ()
+ !$omp parallel
+ !$omp end parallel
+   f6 = 1
+ end
+ 
+ real function f7 ()
+ !$omp single
+ !$omp end single
+   f7 = 1
+ end
+ 
+ real function f8 ()
+ !$omp critical
+ !$omp end critical
+   f8 = 1
+ end
+ 
+ real function f9 ()
+ !$omp critical
+ !$omp end critical
+   f9 = 1
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr71705.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr71705.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr71705.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr71705.f90	Thu Jul  7 12:49:04 2016
***************
*** 0 ****
--- 1,7 ----
+ ! PR fortran/71705
+ ! { dg-do compile }
+ 
+   real :: x
+   x = 0.0
+   !$omp target update to(x)
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr71758.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr71758.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr71758.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr71758.f90	Tue Jul 19 09:02:11 2016
***************
*** 0 ****
--- 1,10 ----
+ ! PR middle-end/71758
+ 
+ subroutine pr71758 (p)
+   integer(8) :: i
+   integer :: p(20)
+   i = 0
+   !$omp target device(i)
+   !$omp end target
+   !$omp target update to(p(1:1)) device(i)
+ end subroutine
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr77500.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr77500.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr77500.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr77500.f90	Tue May 30 07:21:41 2017
***************
*** 0 ****
--- 1,9 ----
+ ! PR fortran/77500
+ ! { dg-do compile }
+ 
+ program pr77500
+    real :: x
+ !$omp atomic write
+    x = f()
+ !$omp end atomic
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr77516.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr77516.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr77516.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr77516.f90	Tue May 30 07:20:41 2017
***************
*** 0 ****
--- 1,12 ----
+ ! PR fortran/77516
+ ! { dg-do compile }
+ 
+ program pr77516
+    integer :: i, x
+    x = 0
+ !$omp simd safelen(0) reduction(+:x)
+    do i = 1, 8
+       x = x + 1
+    end do
+    print *, x
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr77665.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr77665.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr77665.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr77665.f90	Tue May 30 07:28:40 2017
***************
*** 0 ****
--- 1,18 ----
+ ! PR fortran/77665
+ ! { dg-do compile }
+ ! { dg-additional-options "-O2" }
+ 
+ program pr77665
+   type t
+     integer :: a = 0
+   end type
+   type(t) :: x
+   integer :: i
+   !$omp declare reduction (+:t: omp_out%a = omp_out%a + omp_in%a)
+   !$omp simd reduction(+:x)
+   do i = 1, 8
+     if (abs(i) < 5) call abort
+     x%a = x%a + 1
+   end do
+   print *, x%a
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr77666.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr77666.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr77666.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr77666.f90	Tue May 30 07:29:49 2017
***************
*** 0 ****
--- 1,26 ----
+ ! PR fortran/77666
+ ! { dg-do compile }
+ 
+ subroutine foo(x)
+   interface
+     subroutine baz(x, y)
+       integer, allocatable :: x(:), y
+     end subroutine
+   end interface
+   integer, allocatable :: x(:), y
+ !$omp parallel private(x, y)
+   call baz (x, y)
+ !$omp end parallel
+ end
+ subroutine bar
+   interface
+     subroutine baz(x, y)
+       integer, allocatable :: x(:), y
+     end subroutine
+   end interface
+   integer, allocatable :: x(:), y
+   call baz (x, y)
+ !$omp parallel private(x, y)
+   call baz (x, y)
+ !$omp end parallel
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr78298.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr78298.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr78298.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr78298.f90	Tue May 30 07:45:47 2017
***************
*** 0 ****
--- 1,28 ----
+ ! PR fortran/78298
+ ! { dg-do compile }
+ ! { dg-additional-options "-O2" }
+ 
+ program pr78298
+   integer :: i, j, n
+   n = 2
+   !$omp parallel
+   !$omp do
+   do i = 1, n
+     !$omp parallel
+     !$omp do
+     do j = 1, n
+       call sub(i)
+     end do
+     !$omp end parallel
+   end do
+   !$omp end parallel
+   !call unused()
+ contains
+   subroutine sub(x)
+     integer :: x
+   end
+   subroutine unused()
+     i = 0
+     j = 0
+   end
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr78866-1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr78866-1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr78866-1.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr78866-1.f90	Tue May 30 07:52:55 2017
***************
*** 0 ****
--- 1,19 ----
+ ! PR fortran/78866
+ ! { dg-do compile }
+ 
+ subroutine pr78866(x)
+   integer :: x(*)
+ !$omp target map(x)			! { dg-error "Assumed size array" }
+   x(1) = 1
+ !$omp end target
+ !$omp target data map(tofrom: x)	! { dg-error "Assumed size array" }
+ !$omp target update to(x)		! { dg-error "Assumed size array" }
+ !$omp target update from(x)		! { dg-error "Assumed size array" }
+ !$omp end target data
+ !$omp target map(x(:23))		! { dg-bogus "Assumed size array" }
+   x(1) = 1
+ !$omp end target
+ !$omp target map(x(:))			! { dg-error "upper bound of assumed size array section" }
+   x(1) = 1				! { dg-error "not a proper array section" "" { target *-*-* } 16 }
+ !$omp end target
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr78866-2.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr78866-2.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/gomp/pr78866-2.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/gomp/pr78866-2.f90	Tue May 30 07:52:55 2017
***************
*** 0 ****
--- 1,9 ----
+ ! PR fortran/78866
+ ! { dg-do compile }
+ 
+ subroutine pr78866(x)
+   integer :: x(*)
+ !$omp target		! { dg-error "implicit mapping of assumed size array" }
+   x(1) = 1
+ !$omp end target
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/graphite/pr38083.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/graphite/pr38083.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/graphite/pr38083.f90	Fri Jul 31 02:45:54 2009
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/graphite/pr38083.f90	Sun Jun 12 18:25:25 2016
*************** SUBROUTINE IVSORT (IL,IH,NSEGS,IOUNIT)
*** 8,14 ****
  10 IF (IL .GE. IH) GO TO 80
  20 NSEGS = (IH + IL) / 2
    IF (NSEGS .GT. MAXSGS) THEN
!      WRITE (IOUNIT),MAXSGS
    ENDIF
  80 NSEGS = NSEGS - 1
  90 IF (IH - IL .GE. 11) GO TO 20
--- 8,14 ----
  10 IF (IL .GE. IH) GO TO 80
  20 NSEGS = (IH + IL) / 2
    IF (NSEGS .GT. MAXSGS) THEN
!      WRITE (IOUNIT) MAXSGS
    ENDIF
  80 NSEGS = NSEGS - 1
  90 IF (IH - IL .GE. 11) GO TO 20
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/guality/pr41558.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/guality/pr41558.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/guality/pr41558.f90	Tue Feb  7 22:28:18 2012
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/guality/pr41558.f90	Sun Jun 12 18:25:25 2016
***************
*** 5,11 ****
  
  subroutine f (s)
    character(len=3) :: s
!   write (*,*), s ! { dg-final { gdb-test 7 "s" "'foo'" } }
  end
    call f ('foo')
  end
--- 5,11 ----
  
  subroutine f (s)
    character(len=3) :: s
!   write (*,*) s ! { dg-final { gdb-test 7 "s" "'foo'" } }
  end
    call f ('foo')
  end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/ieee/pr77507.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/ieee/pr77507.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/ieee/pr77507.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/ieee/pr77507.f90	Thu Sep 29 20:32:22 2016
***************
*** 0 ****
--- 1,7 ----
+ ! { dg-do compile }
+ Program p
+   Use ieee_arithmetic
+   Use iso_c_binding
+   Print *, ieee_value(x=1.0, class=ieee_negative_inf)
+   Print *, c_associated(c_ptr_1=c_null_ptr)
+ End Program
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/inquire_17.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/inquire_17.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/inquire_17.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/inquire_17.f90	Fri Sep 30 04:49:36 2016
***************
*** 0 ****
--- 1,10 ----
+ ! { dg-do run }
+ ! PR77707 formatted direct access: nextrec off by one
+ program directaccess_formatted
+   integer nextrec
+   open(10, status='scratch', form='formatted', access='direct', recl=10*4)
+   write(10,'(10i4)',rec=9) 1,2,3,4,5,6,7,8,9,10
+   inquire(unit=10,nextrec=nextrec)
+   if (nextrec.ne.10) call abort
+   close(10)
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/integer_exponentiation_6.F90 gcc-5.5.0/gcc/testsuite/gfortran.dg/integer_exponentiation_6.F90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/integer_exponentiation_6.F90	Mon Feb 23 23:02:50 2015
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/integer_exponentiation_6.F90	Sun Jun 12 18:25:25 2016
***************
*** 1,4 ****
  ! { dg-options "-fno-range-check" }
  program test
!   write (*), (2_8 ** 64009999_8) / 2
  end program test
--- 1,4 ----
  ! { dg-options "-fno-range-check" }
  program test
!   write (*,*) (2_8 ** 64009999_8) / 2
  end program test
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/intrinsic_numeric_arg.f gcc-5.5.0/gcc/testsuite/gfortran.dg/intrinsic_numeric_arg.f
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/intrinsic_numeric_arg.f	Fri Nov  5 03:19:13 2010
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/intrinsic_numeric_arg.f	Fri Sep 30 21:46:14 2016
***************
*** 4,9 ****
         LOGICAL Z
         CHARACTER A
         REAL R
!        R = ABS(Z) !  { dg-error " must be a numeric type" }
!        R = ABS(A) !  { dg-error " must be a numeric type" }
         END
--- 4,9 ----
         LOGICAL Z
         CHARACTER A
         REAL R
!        R = ABS(Z) !  { dg-error " must have a numeric type" }
!        R = ABS(A) !  { dg-error " must have a numeric type" }
         END
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/namelist_90.f gcc-5.5.0/gcc/testsuite/gfortran.dg/namelist_90.f
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/namelist_90.f	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/namelist_90.f	Thu Aug 11 17:28:51 2016
***************
*** 0 ****
--- 1,28 ----
+ ! { dg-do run }
+ ! PR71123 Namelist read failure on Windows 
+       implicit none
+       integer :: i, ierr
+       real(8), dimension(30) :: senid, res
+       character(2) :: crlf = char(13) // char(10)
+       namelist /fith/ senid
+       do i=1,30
+          res(i) = i
+       enddo
+       senid = 99.0
+       open(unit=7,file='test.out',form='formatted',
+      *         status='new',action='readwrite', access='stream')
+       write(7,'(a)') "&fith" // crlf
+       write(7,'(a)') "senid=  1.0 , 2.0 , 3.0 , 4.0  , 5.0 ," // crlf
+       write(7,'(a)') "6.0 , 7.0 ,  8.0 ,  9.0 ,  10.0 , 11.0 ," // crlf
+       write(7,'(a)') "12.0 , 13.0 , 14.0 , 15.0 , 16.0 , 17.0 ," // crlf
+       write(7,'(a)') "18.0 , 19.0 , 20.0 , 21.0 , 22.0 , 23.0 ," // crlf
+       write(7,'(a)') "24.0 , 25.0 , 26.0 , 27.0 , 28.0 , 29.0 ," // crlf
+       write(7,'(a)') "30.0 ," // crlf
+       write(7,'(a)') "/" // crlf
+       close(7)
+       open(unit=7,file='test.out',form='formatted')
+       read(7,nml=fith, iostat=ierr)
+       close(7, status="delete")
+       if (ierr.ne.0) call abort
+       if (any(senid.ne.res)) call abort
+       end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/null_9.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/null_9.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/null_9.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/null_9.f90	Fri Jul 22 15:21:10 2016
***************
*** 0 ****
--- 1,30 ----
+ ! { dg-do run }
+ 
+ MODULE fold_convert_loc_ice
+   IMPLICIT NONE
+   PRIVATE
+ 
+   TYPE, PUBLIC :: ta
+     PRIVATE
+     INTEGER :: a_comp
+   END TYPE ta
+ 
+   TYPE, PUBLIC :: tb
+     TYPE(ta), ALLOCATABLE :: b_comp
+   END TYPE tb
+ 
+   PUBLIC :: proc
+ CONTAINS
+   SUBROUTINE proc
+     TYPE(tb) :: b
+ 
+     b = tb(null())
+     if (allocated( b%b_comp )) call abort()
+   END SUBROUTINE proc
+ END MODULE fold_convert_loc_ice
+ 
+   USE fold_convert_loc_ice
+ 
+   call proc()
+ END
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr59910.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr59910.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr59910.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr59910.f90	Fri Apr 14 13:00:02 2017
***************
*** 0 ****
--- 1,11 ----
+ ! { dg-do compile }
+ ! PR fortran/59910
+ !
+ program main
+   implicit none
+   type bar
+       integer :: limit(1)
+   end type
+   type (bar) :: testsuite
+   data testsuite / bar(reshape(source=[10],shape=[1])) /
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr61318.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr61318.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr61318.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr61318.f90	Fri Sep 30 22:40:18 2016
***************
*** 0 ****
--- 1,23 ----
+ ! { dg-do compile }
+ !
+ module gbl_message
+   type :: mytype
+     integer(kind=4) :: e
+   end type mytype
+   type(mytype), parameter :: seve = mytype(1)
+ end module gbl_message
+ 
+ module gbl_interfaces
+   interface
+     subroutine gagout(message)
+       character(len=*), intent(in) :: message
+     end subroutine gagout
+   end interface
+ end module gbl_interfaces
+ 
+ program test
+   use gbl_message
+   use gbl_interfaces
+   call gagout(seve%e,'Some string') ! { dg-error "Type mismatch in argument" }
+ end program test
+ ! { dg-final { cleanup-modules "gbl_interfaces gbl_message" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr68566.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr68566.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr68566.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr68566.f90	Fri Sep 30 17:54:15 2016
***************
*** 0 ****
--- 1,13 ----
+ ! { dg-do run }
+ program p
+    character(len=20) s1, s2
+    integer, allocatable :: n(:)
+    n = [2,1]
+    s1 = '1 5 2 6 3 0 4 0'
+    write(s2,'(8(I0,1x))') reshape ([1,2,3,4,5,6], [2,4], [0,0], [2,1])
+    if (trim(s1) /= trim(s2)) call abort
+    write(s2,'(8(I0,1x))') reshape ([1,2,3,4,5,6], [2,4], [0,0], n)
+    if (trim(s1) /= trim(s2)) call abort
+    write(s2,'(8(I0,1x))') reshape ([1,2,3,4,5,6], [2,4], [0,0], [n])
+    if (trim(s1) /= trim(s2)) call abort
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr69514_1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr69514_1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr69514_1.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr69514_1.f90	Thu Sep 29 18:35:49 2016
***************
*** 0 ****
--- 1,5 ----
+ ! { dg-do run }
+ program foo
+    real, parameter :: x(3) = 2.0 * [real :: 1, 2, 3 ]
+    if (any(x /= [2., 4., 6.])) call abort
+ end program foo
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr69514_2.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr69514_2.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr69514_2.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr69514_2.f90	Thu Sep 29 18:35:49 2016
***************
*** 0 ****
--- 1,49 ----
+ ! { dg-do run }
+ program p
+  implicit none
+ 
+  real   , parameter :: arr(3) = [ real    :: 2, 2.5, (1.5, 2.5) ]
+  real   , parameter :: ari(3) = [ integer :: 2, 2.5, (1.5, 2.5) ]
+  real   , parameter :: arc(3) = [ complex :: 2, 2.5, (1.5, 2.5) ]
+  integer, parameter :: air(3) = [ real    :: 2, 2.5, (1.5, 2.5) ]
+  integer, parameter :: aii(3) = [ integer :: 2, 2.5, (1.5, 2.5) ]
+  integer, parameter :: aic(3) = [ complex :: 2, 2.5, (1.5, 2.5) ]
+  complex, parameter :: acr(3) = [ real    :: 2, 2.5, (1.5, 2.5) ]
+  complex, parameter :: aci(3) = [ integer :: 2, 2.5, (1.5, 2.5) ]
+  complex, parameter :: acc(3) = [ complex :: 2, 2.5, (1.5, 2.5) ]
+ 
+  real   , parameter :: mrr(3) =  4.5       * [ real    :: 2, 2.5, (3.5, 4.0) ]
+  real   , parameter :: mri(3) =  4.5       * [ integer :: 2, 2.5, (3.5, 4.0) ]
+  real   , parameter :: mrc(3) =  4.5       * [ complex :: 2, 2.5, (3.5, 4.0) ]
+  integer, parameter :: mir(3) =  4         * [ real    :: 2, 2.5, (3.5, 4.0) ]
+  integer, parameter :: mii(3) =  4         * [ integer :: 2, 2.5, (3.5, 4.0) ]
+  integer, parameter :: mic(3) =  4         * [ complex :: 2, 2.5, (3.5, 4.0) ]
+  complex, parameter :: mcr(3) = (4.5, 5.5) * [ real    :: 2, 2.5, (3.5, 4.0) ]
+  complex, parameter :: mci(3) = (4.5, 5.5) * [ integer :: 2, 2.5, (3.5, 4.0) ]
+  complex, parameter :: mcc(3) = (4.5, 5.5) * [ complex :: 2, 2.5, (3.5, 4.0) ]
+ 
+  if (any(arr /= [2.00, 2.50, 1.50])) call abort
+  if (any(ari /= [2.00, 2.00, 1.00])) call abort
+  if (any(arc /= [2.00, 2.50, 1.50])) call abort
+ 
+  if (any(air /= [2, 2, 1])) call abort
+  if (any(aii /= [2, 2, 1])) call abort
+  if (any(aic /= [2, 2, 1])) call abort
+ 
+  if (any(acr /= [(2.00, 0.00), (2.50, 0.00), (1.50, 0.00)])) call abort
+  if (any(aci /= [(2.00, 0.00), (2.00, 0.00), (1.00, 0.00)])) call abort
+  if (any(acc /= [(2.00, 0.00), (2.50, 0.00), (1.50, 2.50)])) call abort
+ 
+  if (any(mrr /= [9.00, 11.25, 15.75])) call abort
+  if (any(mri /= [9.00,  9.00, 13.50])) call abort
+  if (any(mrc /= [9.00, 11.25, 15.75])) call abort
+ 
+  if (any(mir /= [8, 10, 14])) call abort
+  if (any(mii /= [8,  8, 12])) call abort
+  if (any(mic /= [8, 10, 14])) call abort
+ 
+  if (any(mcr /= [(9.00, 11.00), (11.25, 13.75), (15.75, 19.25)])) call abort
+  if (any(mci /= [(9.00, 11.00), ( 9.00, 11.00), (13.50, 16.50)])) call abort
+  if (any(mcc /= [(9.00, 11.00), (11.25, 13.75), (-6.25, 37.25)])) call abort
+ 
+ end program p
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr69867.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr69867.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr69867.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr69867.f90	Fri Sep 30 21:02:56 2016
***************
*** 0 ****
--- 1,6 ----
+ ! { dg-do compile }
+ program p
+  type t
+   character(1) :: c(1)=[1] ! { dg-error "convert INTEGER.4. to CHARACTER.1." }
+  end type
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr69962.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr69962.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr69962.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr69962.f90	Fri Sep 30 21:02:56 2016
***************
*** 0 ****
--- 1,6 ----
+ ! { dg-do compile }
+ program p
+    integer :: n = 1
+    character(3), parameter :: x(2) = ['abc', 'xyz']
+    character(2), parameter :: y(2) = [x(2)(2:3), x(n)(1:2)] ! { dg-error "CHARACTER length must be a constant" }
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr70006.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr70006.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr70006.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr70006.f90	Fri Sep 30 15:50:31 2016
***************
*** 0 ****
--- 1,9 ----
+ ! { dg-do compile}
+ program test
+    print 1, 'string 1' ! { dg-error "FORMAT label 1" " " { target *-*-* } 3 }
+    print 1, 'string 2' ! { dg-error "FORMAT label 1" " " { target *-*-* } 4 }
+ !1 format(a)
+    goto 2 ! { dg-error "Label 2 referenced" " " { target *-*-* } 6 }
+    goto 2 ! { dg-error "Label 2 referenced" " " { target *-*-* } 7 }
+ !2 continue
+ end program
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr70040.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr70040.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr70040.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr70040.f90	Mon Aug  8 06:29:16 2016
***************
*** 0 ****
--- 1,19 ----
+ ! { dg-do compile }
+ ! PR 70040 - used to cause an ICE.
+ ! Test case by Martin Reinecke
+ program bugrep
+   implicit none
+   type :: string
+     character (len=:), allocatable :: s
+   end type
+ 
+   integer l
+   type(string), allocatable, dimension(:) :: foo
+   character(len=:),allocatable ::tmp
+   allocate(foo(20))
+   do l= 1, 20
+     tmp = foo(5)%s
+     foo(5)%s = foo(l)%s
+     foo(l)%s = tmp
+   enddo
+ end program
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr70673.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr70673.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr70673.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr70673.f90	Mon Jun 27 20:54:56 2016
***************
*** 0 ****
--- 1,25 ----
+ ! { dg-do run }
+ !
+ ! Test the fix for PR70673
+ !
+ ! Contributed by David Kinniburgh  <davidgkinniburgh@yahoo.co.uk>
+ !
+ module m
+ contains
+   subroutine s(inp)
+     character(*), intent(in) :: inp
+     character(:), allocatable :: a
+     a = a           ! This used to ICE.
+     a = inp
+     a = a           ! This used to ICE too
+     if ((len (a) .ne. 5) .or. (a .ne. "hello")) call abort
+     a = a(2:3)      ! Make sure that temporary creation is not broken.
+     if ((len (a) .ne. 2) .or. (a .ne. "el")) call abort
+     deallocate (a)
+     a = a           ! This would ICE too.
+   end subroutine s
+ end module m
+ 
+   use m
+   call s("hello")
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71067_1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71067_1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71067_1.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71067_1.f90	Thu Sep 29 19:34:59 2016
***************
*** 0 ****
--- 1,5 ----
+ program p
+    integer :: i = 0
+    integer :: z(2)
+    data z /2*i/ ! { dg-error "must be a PARAMETER in DATA" }
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71067_2.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71067_2.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71067_2.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71067_2.f90	Thu Sep 29 19:34:59 2016
***************
*** 0 ****
--- 1,7 ----
+ ! { dg-do compile }
+ program p
+    integer :: a(2), b(2), c(2)
+    data a /2*b1'/ ! { dg-error "must be a PARAMETER in DATA" }
+    data b /2*o1'  ! { dg-error "must be a PARAMETER in DATA" }
+    data c /2*z1   ! { dg-error "must be a PARAMETER in DATA" }
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71688.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71688.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71688.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71688.f90	Wed Jul 20 13:31:19 2016
***************
*** 0 ****
--- 1,13 ----
+ ! { dg-do compile }
+ ! { dg-options "-fcoarray=lib" }
+ 
+ program p
+    call s
+ contains
+    subroutine s
+       real :: x[*] = 1
+       block
+       end block
+       x = 2
+    end
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71730.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71730.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71730.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71730.f90	Thu Sep 29 00:18:44 2016
***************
*** 0 ****
--- 1,5 ----
+ ! { dg-do compile }
+ subroutine foo
+   implicit none
+   character(len=bar) :: a ! { dg-error "Scalar INTEGER expression" }
+ end subroutine foo
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71764.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71764.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71764.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71764.f90	Sat Jul 16 05:10:10 2016
***************
*** 0 ****
--- 1,34 ----
+ ! { dg-do run }
+ ! PR71764 
+ program p
+    use iso_c_binding, only: c_ptr, c_null_ptr, c_ptr, c_associated, c_loc
+    logical, target :: rls
+    real, target :: t = 3.14
+    type(c_ptr) :: nullptr,c
+    real, pointer :: k
+    nullptr = c_null_ptr
+    c = nullptr
+    rls = c_associated(c)
+    if (rls) call abort
+    if (c_associated(c)) call abort
+    c = c_loc(rls)
+    if (.not. c_associated(c)) call abort
+    c = nullptr
+    if (c_associated(c)) call abort
+    c = c_loc(t)
+    k => t
+    call association_test(k, c)
+ contains
+   subroutine association_test(a,b)
+     use iso_c_binding, only: c_associated, c_loc, c_ptr
+     implicit none
+     real, pointer :: a
+     type(c_ptr) :: b
+     if(c_associated(b, c_loc(a))) then
+        return
+     else
+        call abort
+     end if
+   end subroutine association_test
+ end
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71799.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71799.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71799.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71799.f90	Fri Sep 30 16:58:31 2016
***************
*** 0 ****
--- 1,10 ----
+ ! { dg-do compile }
+ subroutine test2(s)
+ integer(1) :: i
+ integer (8) :: s
+ 
+ do i = 10, HUGE(i) - 10, 222 ! { dg-error "overflow converting" }
+   s = s + 1
+ end do
+ 
+ end subroutine test2
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71859.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71859.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71859.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71859.f90	Fri Sep 30 21:46:14 2016
***************
*** 0 ****
--- 1,8 ----
+ ! { dg-do compile }
+ program p
+    call s(1)
+    x = abs(s)  ! { dg-error "must have a numeric type" }
+ end
+ subroutine s(n)
+    print *, n
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71883.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71883.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71883.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71883.f90	Fri Jul 29 05:16:05 2016
***************
*** 0 ****
--- 1,38 ----
+ ! { dg-do compile }
+ !
+ ! Test the fix for pr71883, in which an ICE would follow the error.
+ !
+ ! Contributed by Gerhard Steinmetz  <gerhard.steinmetz.fortran@t-online.de>
+ !
+ program p
+    character(3), allocatable :: z(:,:)
+    z(1:2,1:2) = 'abc'
+    z(2,1) = z(12) ! { dg-error "Rank mismatch in array reference" }
+    z(21) = z(1,2) ! { dg-error "Rank mismatch in array reference" }
+ contains
+    subroutine a
+       character(3), allocatable :: z(:,:)
+       z(1:2,1:2) = 'abc'
+       z(2,1) = z(-1) ! { dg-error "Rank mismatch in array reference" }
+       z(2,1) = z(99) ! { dg-error "Rank mismatch in array reference" }
+       z(2,1) = z(huge(0)) ! { dg-error "Rank mismatch in array reference" }
+       z(2,1) = z(-huge(0)) ! { dg-error "Rank mismatch in array reference" }
+       z(-1) = z(2,1) ! { dg-error "Rank mismatch in array reference" }
+       z(99) = z(2,1) ! { dg-error "Rank mismatch in array reference" }
+       z(huge(0)) = z(2,1) ! { dg-error "Rank mismatch in array reference" }
+       z(-huge(0)) = z(2,1) ! { dg-error "Rank mismatch in array reference" }
+   end subroutine
+ 
+    subroutine b
+       character(:), allocatable :: z(:,:)
+       z(1:2,1:2) = 'abc'
+       z(2,1) = z(-1) ! { dg-error "Rank mismatch in array reference" }
+       z(2,1) = z(99) ! { dg-error "Rank mismatch in array reference" }
+       z(2,1) = z(huge(0)) ! { dg-error "Rank mismatch in array reference" }
+       z(2,1) = z(-huge(0)) ! { dg-error "Rank mismatch in array reference" }
+       z(-1) = z(2,1) ! { dg-error "Rank mismatch in array reference" }
+       z(99) = z(2,1) ! { dg-error "Rank mismatch in array reference" }
+      z(huge(0)) = z(2,1) ! { dg-error "Rank mismatch in array reference" }
+       z(-huge(0)) = z(2,1) ! { dg-error "Rank mismatch in array reference" }
+    end subroutine
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71895.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71895.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr71895.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr71895.f90	Mon Oct 24 21:36:49 2016
***************
*** 0 ****
--- 1,10 ----
+ ! { dg-do compile }
+ program p
+    type t
+       integer :: n
+    end type
+    type(t) :: x
+    class(t) :: y        ! { dg-error "must be dummy, allocatable or pointer" }
+    print *, extends_type_of(x, y)
+    print *, extends_type_of(y, x)
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77260_1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77260_1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77260_1.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77260_1.f90	Thu Sep 29 19:34:59 2016
***************
*** 0 ****
--- 1,25 ----
+ ! { dg-do compile }
+ ! { dg-options "-Wall" }
+ module foo
+ 
+    implicit none
+ 
+    private
+    public f1,f2
+ 
+    contains
+ 
+       integer function f1()
+          integer f2
+          f1=5
+       entry f2
+          f2=8
+       end function
+ end module
+ 
+ program test
+    use foo
+    implicit none
+    print *,f2()
+ end program
+ ! { dg-final { cleanup-modules "foo" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77260_2.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77260_2.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77260_2.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77260_2.f90	Thu Sep 29 19:34:59 2016
***************
*** 0 ****
--- 1,26 ----
+ ! { dg-do compile }
+ ! { dg-options "-Wall" }
+ module foo
+ 
+    implicit none
+ 
+    private
+    public f1,f2
+ 
+    contains
+ 
+       integer function f1()
+          integer f2
+          integer f3           ! { dg-warning "Unused variable" }
+          f1=5
+       entry f2
+          f2=8
+       end function
+ end module
+ 
+ program test
+    use foo
+    implicit none
+    print *,f2()
+ end program
+ ! { dg-final { cleanup-modules "foo" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77351.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77351.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77351.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77351.f90	Fri Sep 30 19:21:12 2016
***************
*** 0 ****
--- 1,6 ----
+ ! { dg-do compile }
+ program p
+    integer :: z(4) = [1, 2, 3, 4]
+    print *, any(shape(z) /= [4,1])  ! { dg-error "shape for elemental binary" }
+ end
+ ! { dg-excess-errors "operands are incommensurate" }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77380.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77380.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77380.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77380.f90	Sat Oct  1 00:46:28 2016
***************
*** 0 ****
--- 1,6 ----
+ ! { dg-do compile }
+ ! { dg-options "-fcoarray=lib -O2" }
+ program p
+    integer :: z(2)[*] = 1
+    z(:)[1] = z(:)[*]       ! { dg-error "must be a scalar at" }
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77391.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77391.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77391.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77391.f90	Sat Oct  1 04:58:02 2016
***************
*** 0 ****
--- 1,7 ----
+ ! { dg-do compile }
+ program picky
+ character(len=:), parameter :: a="whoops" ! { dg-error "POINTER or ALLOCATABLE" }
+ character(len=:) :: b="whoops" ! { dg-error "POINTER or ALLOCATABLE" }
+ character(len=:) :: good
+ pointer good
+ end program picky
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77420_1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77420_1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77420_1.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77420_1.f90	Thu Sep 29 22:09:42 2016
***************
*** 0 ****
--- 1,15 ----
+ ! { dg-do compile }
+ module test_equivalence
+   real, private :: array1(100)
+   real, private :: array2(100)
+   equivalence(array1(3),array2(3))
+ end module test_equivalence
+ 
+ module mymodule
+   use test_equivalence
+   real, dimension(:), allocatable :: array1
+ end module mymodule
+ 
+ program test
+   use mymodule
+ end program test
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77420_2.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77420_2.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77420_2.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77420_2.f90	Thu Sep 29 22:09:42 2016
***************
*** 0 ****
--- 1,15 ----
+ ! { dg-do compile }
+ module test_equivalence
+   real, private :: array1(100)
+   real, private :: array2(100)
+   equivalence(array1,array2)
+ end module test_equivalence
+ 
+ module mymodule
+   use test_equivalence
+   real, dimension(:), allocatable :: array1
+ end module mymodule
+ 
+ program test
+   use mymodule
+ end program test
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77420_3.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77420_3.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77420_3.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77420_3.f90	Thu Sep 29 22:09:42 2016
***************
*** 0 ****
--- 1,9 ----
+ ! { dg-do link }
+ ! { dg-additional-sources pr77420_4.f90 }
+ !
+ module h5global
+   implicit none
+   integer :: h5p_default_f, h5p_flags
+   equivalence(h5p_flags, h5p_default_f)
+ end module h5global
+ ! { dg-final { cleanup-modules "h5global" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77420_4.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77420_4.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77420_4.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77420_4.f90	Thu Sep 29 22:09:42 2016
***************
*** 0 ****
--- 1,10 ----
+ ! { dg-do compile { target { ! *-*-* } } }
+ !
+ program bug
+   use H5GLOBAL
+   implicit none
+   integer :: i
+   i=H5P_DEFAULT_F
+ end program bug
+ 
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77460.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77460.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77460.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77460.f90	Thu Sep 29 22:09:42 2016
***************
*** 0 ****
--- 1,7 ----
+ ! { dg-do compile }
+   double precision, parameter :: x = huge(1d0)
+   print*, sum((/x,-x/))
+   print*, sum((/x,x,-x,-x/))  ! { dg-error "overflow" }
+   print*, sum((/x,-x,1d0/))
+   print*, sum((/1d0,x,-x/))
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77506.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77506.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77506.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77506.f90	Thu Sep 29 20:32:22 2016
***************
*** 0 ****
--- 1,4 ----
+ ! { dg-do compile }
+ program foo
+    print *, [character(len=*)::'ab','cd'] ! { dg-error "contain an asterisk" }
+ end program foo
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77612.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77612.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77612.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77612.f90	Thu Sep 29 00:18:44 2016
***************
*** 0 ****
--- 1,13 ----
+ ! { dg-do compile }
+ 
+ program bad_len
+ 
+   implicit none
+ 
+ contains
+ 
+   subroutine sub
+     character(len = ICE) :: line ! { dg-error "INTEGER expression expected" }
+   end subroutine
+ 
+ end program
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77694.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77694.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77694.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77694.f90	Wed Sep 28 23:38:13 2016
***************
*** 0 ****
--- 1,7 ----
+ ! { dg-do compile }
+ ! { dg-options -O }
+ program p
+    logical x(2), y(2)
+    x = .true.
+    y = .nt. x   ! { dg-error "Unknown operator" }
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77978_1.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77978_1.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77978_1.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77978_1.f90	Mon Oct 17 23:22:54 2016
***************
*** 0 ****
--- 1,23 ----
+ ! { dg-do compile }
+ ! { dg-options "-std=f95" }
+ subroutine a1
+   integer, parameter :: i = -666
+   stop i ! { dg-error "cannot be negative" }
+ end subroutine a1
+ 
+ subroutine a2
+   stop -666 ! { dg-error "cannot be negative" }
+ end subroutine a2
+ 
+ subroutine a3
+   integer, parameter :: i = 123456
+   stop i ! { dg-error "too many digits" }
+ end subroutine a3
+ 
+ subroutine a4
+   stop 123456 ! { dg-error "too many digits" }
+ end subroutine a4
+ 
+ !subroutine a5
+ !  stop merge(667,668,.true.) 
+ !end subroutine a5
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77978_2.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77978_2.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77978_2.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77978_2.f90	Mon Oct 17 23:22:54 2016
***************
*** 0 ****
--- 1,5 ----
+ ! { dg-do compile }
+ ! { dg-options "-std=f2008" }
+ subroutine a1
+   stop666 ! { dg-error "Blank required in STOP" }
+ end subroutine a1
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77978_3.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77978_3.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr77978_3.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr77978_3.f90	Mon Oct 17 23:22:54 2016
***************
*** 0 ****
--- 1,23 ----
+ ! { dg-do compile }
+ ! { dg-options "-std=f2008" }
+ subroutine a1
+   integer, parameter :: i = -666
+   stop i
+ end subroutine a1
+ 
+ subroutine a2
+   stop -666
+ end subroutine a2
+ 
+ subroutine a3
+   integer, parameter :: i = 123456
+   stop i
+ end subroutine a3
+ 
+ subroutine a4
+   stop 123456
+ end subroutine a4
+ 
+ subroutine a5
+   stop merge(667,668,.true.) 
+ end subroutine a5
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr78279.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr78279.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr78279.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr78279.f90	Thu Dec  1 21:28:41 2016
***************
*** 0 ****
--- 1,10 ----
+ ! { dg-do compile }
+ ! { dg-options "-Ofast" }
+ program p
+    integer :: i
+    real :: z(2,4)
+    z = 0.0
+    do i = 1, 3
+       if ( z(i) > z(1,i+1) ) print *, i   ! { dg-error "mismatch in array reference" }
+    end do
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/pr78297.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/pr78297.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/pr78297.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/pr78297.f90	Wed Nov 23 22:48:54 2016
***************
*** 0 ****
--- 1,11 ----
+ ! { dg-do compile }
+ module m
+    real :: a(2), b(2)
+    real :: c(2), d(2)
+    equivalence (a, b)
+    equivalence (c, d)
+    common /xcom/ a
+ end
+ block data
+    use m
+ end block data
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/proc_ptr_49.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/proc_ptr_49.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/proc_ptr_49.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/proc_ptr_49.f90	Mon Oct 24 12:14:52 2016
***************
*** 0 ****
--- 1,50 ----
+ ! { dg-do compile }
+ !
+ ! Tests the fix for PRs 78013 and 61420, both of which gave a
+ ! no IMPLICIT type message for the procedure pointer at assignment.
+ !
+ module m
+ 
+   implicit none
+ 
+   abstract interface
+     function I_f() result( r )
+       real :: r
+     end function I_f
+   end interface
+ 
+   type, abstract :: a_t
+     private
+     procedure(I_f), nopass, pointer :: m_f => null()
+   contains
+     private
+     procedure, pass(this), public :: f => get_f
+   end type a_t
+ 
+ contains
+ 
+   function get_f( this ) result( f_ptr )  ! Error message here.
+     class(a_t), intent(in)  :: this
+     procedure(I_f), pointer :: f_ptr
+     f_ptr => this%m_f                     ! Error here :-)
+   end function get_f
+ 
+ end module m
+ 
+ module test
+   implicit none
+ 
+   type functions
+   contains
+     procedure, nopass :: get_pf => get_it ! Error here
+   end type
+ 
+   class(functions), allocatable :: f
+ 
+ contains
+ 
+   function get_it()                      ! Error message here.
+     procedure (real), pointer :: get_it
+   end function
+ 
+ end module
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/proc_ptr_comp_49.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/proc_ptr_comp_49.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/proc_ptr_comp_49.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/proc_ptr_comp_49.f90	Mon May  1 10:51:22 2017
***************
*** 0 ****
--- 1,21 ----
+ ! { dg-do compile }
+ !
+ ! PR 80392: [5/6/7 Regression] [OOP] ICE with allocatable polymorphic function result in a procedure pointer component
+ !
+ ! Contributed by <zed.three@gmail.com>
+ 
+ module mwe
+ 
+   implicit none
+ 
+   type :: MyType
+      procedure(my_op), nopass, pointer :: op
+   end type
+ 
+ contains
+ 
+   function my_op() result(foo)
+     class(MyType), allocatable :: foo
+   end function
+ 
+ end module
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/proc_ptr_comp_50.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/proc_ptr_comp_50.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/proc_ptr_comp_50.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/proc_ptr_comp_50.f90	Fri Jun  9 19:23:48 2017
***************
*** 0 ****
--- 1,26 ----
+ ! { dg-do compile }
+ !
+ ! PR 70601: [5/6/7 Regression] [OOP] ICE on procedure pointer component call
+ !
+ ! Contributed by zmi <zmi007@gmail.com>
+ 
+ program test
+   implicit none
+ 
+   type :: concrete_type
+     procedure (run_concrete_type), pointer :: run
+   end type
+ 
+   type(concrete_type), allocatable :: concrete
+ 
+   allocate(concrete)
+   concrete % run => run_concrete_type
+   call concrete % run()
+ 
+ contains
+ 
+    subroutine run_concrete_type(this)
+       class(concrete_type) :: this
+    end subroutine
+ 
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/realloc_on_assign_26.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/realloc_on_assign_26.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/realloc_on_assign_26.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/realloc_on_assign_26.f90	Sat Aug 13 15:04:04 2016
***************
*** 0 ****
--- 1,12 ----
+ ! { dg-do run }
+ ! PR 68147 - no temprorary within the IF statement.
+ ! Original test case by Martin Reinecke.
+ program test
+   implicit none
+   character(len=:),allocatable ::name
+   name="./a.out"
+   if (index(name,"/")  /=  0) THEN
+     name=name(3:)
+     if (name .ne. "a.out") call abort
+   endif
+ end program
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/select_type_35.f03 gcc-5.5.0/gcc/testsuite/gfortran.dg/select_type_35.f03
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/select_type_35.f03	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/select_type_35.f03	Fri Jul 22 14:12:59 2016
***************
*** 0 ****
--- 1,41 ----
+ ! { dg-do run }
+ !
+ ! Contributed by Nathanael Huebbe
+ ! Check fix for PR/70842
+ 
+ program foo
+ 
+   TYPE, ABSTRACT :: t_Intermediate
+   END TYPE t_Intermediate
+ 
+   type, extends(t_Intermediate) :: t_Foo
+     character(:), allocatable :: string
+   end type t_Foo
+ 
+   class(t_Foo), allocatable :: obj
+ 
+   allocate(obj)
+   obj%string = "blabarfoo"
+ 
+   call bar(obj)
+ 
+   deallocate(obj)
+ contains
+   subroutine bar(me)
+     class(t_Intermediate), target :: me
+ 
+     class(*), pointer :: alias
+ 
+     select type(me)
+       type is(t_Foo)
+       if (len(me%string) /= 9) call abort()
+     end select
+ 
+     alias => me
+     select type(alias)
+       type is(t_Foo)
+         if (len(alias%string) /= 9) call abort()
+     end select
+   end subroutine bar
+ end program foo
+ 
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/string_length_3.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/string_length_3.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/string_length_3.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/string_length_3.f90	Mon Oct 24 22:12:06 2016
***************
*** 0 ****
--- 1,19 ----
+ ! { dg-do run }
+ ! { dg-options "-ffrontend-optimize -fdump-tree-original" }
+ ! PR 78021 - calls to mylen were folded after shortening the
+ ! argument list.
+ 
+ PROGRAM test_o_char
+   implicit none
+   integer :: n
+   n = mylen('c') + mylen('c   ')
+   if (n /= 5) call abort
+ CONTAINS
+ 
+   FUNCTION mylen(c)
+     CHARACTER(len=*),INTENT(in) :: c
+     INTEGER :: mylen
+     mylen=LEN(c)
+   END FUNCTION mylen
+ END PROGRAM test_o_char
+ ! { dg-final { scan-tree-dump-times "__var" 0 "original" } }
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/type_decl_4.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/type_decl_4.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/type_decl_4.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/type_decl_4.f90	Mon Aug  8 22:00:37 2016
***************
*** 0 ****
--- 1,7 ----
+ ! { dg-do compile }
+ program main
+   type Xx 
+   end type Xx
+   real :: Xx ! { dg-error "Symbol 'xx' at .* also declared as a type" }
+   
+ end program main
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/typebound_proc_35.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/typebound_proc_35.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/typebound_proc_35.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/typebound_proc_35.f90	Sun Dec  4 16:34:13 2016
***************
*** 0 ****
--- 1,88 ----
+ ! { dg-do run }
+ !
+ ! PR 78443: [OOP] Incorrect behavior with non_overridable keyword
+ !
+ ! Contributed by federico <perini@wisc.edu>
+ 
+ module types
+     implicit none
+ 
+ 
+     ! Abstract parent class and its child type
+     type, abstract :: P1
+     contains
+         procedure :: test => test1
+         procedure (square_interface), deferred :: square
+     endtype
+ 
+     ! Deferred procedure interface
+     abstract interface
+         function square_interface( this, x ) result( y )
+            import P1
+            class(P1) :: this
+            real :: x, y
+         end function square_interface
+     end interface
+ 
+     type, extends(P1) :: C1
+     contains
+        procedure, non_overridable :: square => C1_square
+     endtype
+ 
+     ! Non-abstract parent class and its child type
+     type :: P2
+     contains
+         procedure :: test => test2
+         procedure :: square => P2_square
+     endtype
+ 
+     type, extends(P2) :: C2
+     contains
+        procedure, non_overridable :: square => C2_square
+     endtype
+ 
+ contains
+ 
+     real function test1( this, x )
+         class(P1) :: this
+         real :: x
+         test1 = this % square( x )
+     end function
+ 
+     real function test2( this, x )
+         class(P2) :: this
+         real :: x
+         test2 = this % square( x )
+     end function
+ 
+     function P2_square( this, x ) result( y )
+        class(P2) :: this
+        real :: x, y
+        y = -100.      ! dummy
+     end function
+ 
+     function C1_square( this, x ) result( y )
+        class(C1) :: this
+        real :: x, y
+        y = x**2
+     end function
+ 
+     function C2_square( this, x ) result( y )
+        class(C2) :: this
+        real :: x, y
+        y = x**2
+     end function
+ 
+ end module
+ 
+ program main
+     use types
+     implicit none
+     type(P2) :: t1
+     type(C2) :: t2
+     type(C1) :: t3
+ 
+     if ( t1 % test( 2. ) /= -100.) call abort()
+     if ( t2 % test( 2. ) /= 4.) call abort()
+     if ( t3 % test( 2. ) /= 4.) call abort()
+ end program
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/warn_target_lifetime_3.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/warn_target_lifetime_3.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/warn_target_lifetime_3.f90	Tue Nov 27 22:20:44 2012
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/warn_target_lifetime_3.f90	Sat Sep  2 20:13:49 2017
***************
*** 3,9 ****
  !
  ! PR fortran/55476
  !
! ! Contribued by  Janus Weil
  !
  subroutine test
    integer, pointer :: p
--- 3,9 ----
  !
  ! PR fortran/55476
  !
! ! Contributed by Janus Weil
  !
  subroutine test
    integer, pointer :: p
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/warn_target_lifetime_4.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/warn_target_lifetime_4.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/warn_target_lifetime_4.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/warn_target_lifetime_4.f90	Sat Sep  2 20:13:49 2017
***************
*** 0 ****
--- 1,28 ----
+ ! { dg-do compile }
+ ! { dg-options "-Wtarget-lifetime" }
+ !
+ ! PR fortran/81770: [5/6/7 Regression] Bogus warning: Pointer in pointer assignment might outlive the pointer target
+ !
+ ! Contributed by Janus Weil <janus@gcc.gnu.org>
+ 
+ module m
+ 
+    type t
+       integer, allocatable :: l
+    end type
+ 
+ contains
+ 
+    subroutine sub(c_in, list)
+       type(t), target, intent(in)  :: c_in
+       integer, pointer, intent(out) :: list
+ 
+       type(t), pointer :: container
+ 
+       container => c_in
+ 
+       list => container%l
+ 
+    end subroutine
+ 
+ end
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/where_5.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/where_5.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/where_5.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/where_5.f90	Sun Nov  6 20:30:31 2016
***************
*** 0 ****
--- 1,15 ----
+ ! { dg-do compile }
+ ! { dg-options "-Wcharacter-truncation" }
+ subroutine where_ice (i,j)
+      
+   implicit none
+ 
+   character(8)  :: y(10,10,2)
+ 
+   integer       :: i
+   integer       :: j
+ 
+   character(12) :: txt(5)
+   where (txt(1:3) /= ''   )  y(1:3,i,j) = txt(1:3) ! { dg-warning "CHARACTER expression will be truncated" }
+ 
+ end subroutine where_ice
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gfortran.dg/where_6.f90 gcc-5.5.0/gcc/testsuite/gfortran.dg/where_6.f90
*** gcc-5.4.0/gcc/testsuite/gfortran.dg/where_6.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gfortran.dg/where_6.f90	Sun Nov  6 20:30:31 2016
***************
*** 0 ****
--- 1,15 ----
+ ! { dg-do compile }
+ ! { dg-options "-Wcharacter-truncation" }
+ subroutine where_ice (i,j)
+      
+   implicit none
+ 
+   character(8)  :: y(10,10,2)
+ 
+   integer       :: i
+   integer       :: j
+ 
+   character(12) :: txt(5)
+   if (.true.) where (txt(1:3) /= ''   )  y(1:3,i,j) = txt(1:3) ! { dg-warning "CHARACTER expression will be truncated" }
+ 
+ end subroutine where_ice
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gnat.dg/biased_subtype.adb gcc-5.5.0/gcc/testsuite/gnat.dg/biased_subtype.adb
*** gcc-5.4.0/gcc/testsuite/gnat.dg/biased_subtype.adb	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gnat.dg/biased_subtype.adb	Mon Oct 10 08:53:06 2016
***************
*** 0 ****
--- 1,20 ----
+ -- { dg-do run }
+ -- { dg-options "-gnatws" }
+ 
+ procedure Biased_Subtype is
+ 
+    CIM_Max_AA : constant := 9_999_999;
+    CIM_Min_AA : constant := -999_999;
+ 
+    type TIM_AA is range CIM_Min_AA..CIM_Max_AA + 1;
+    for TIM_AA'Size use 24;
+ 
+    subtype STIM_AA is TIM_AA range TIM_AA(CIM_Min_AA)..TIM_AA(CIM_Max_AA);
+ 
+    SAA : STIM_AA := 1;
+ 
+ begin
+    if Integer(SAA) /= 1 then
+      raise Program_Error;
+    end if;
+ end;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gnat.dg/loop_optimization23.adb gcc-5.5.0/gcc/testsuite/gnat.dg/loop_optimization23.adb
*** gcc-5.4.0/gcc/testsuite/gnat.dg/loop_optimization23.adb	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gnat.dg/loop_optimization23.adb	Fri Aug 12 18:56:30 2016
***************
*** 0 ****
--- 1,14 ----
+ -- { dg-do run }
+ -- { dg-options "-O3" }
+ -- PR tree-optimization/71083
+ with Loop_Optimization23_Pkg;
+ use Loop_Optimization23_Pkg;
+ procedure Loop_Optimization23 is
+   Test : ArrayOfStructB;
+ begin
+   Test (0).b.b := 9999;
+   Foo (Test);
+   if Test (100).b.b /= 9999 then
+     raise Program_Error;
+   end if;
+ end;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gnat.dg/loop_optimization23_pkg.adb gcc-5.5.0/gcc/testsuite/gnat.dg/loop_optimization23_pkg.adb
*** gcc-5.4.0/gcc/testsuite/gnat.dg/loop_optimization23_pkg.adb	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gnat.dg/loop_optimization23_pkg.adb	Fri Aug 12 18:56:30 2016
***************
*** 0 ****
--- 1,11 ----
+ -- { dg-do compile }
+ -- { dg-options "-O3" }
+ -- PR tree-optimization/71083
+ package body Loop_Optimization23_Pkg is
+   procedure Foo (X : in out ArrayOfStructB) is
+   begin
+     for K in 0..99 loop
+       X (K+1).b.b := X (K).b.b;
+     end loop;
+   end Foo;
+ end Loop_Optimization23_Pkg;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gnat.dg/loop_optimization23_pkg.ads gcc-5.5.0/gcc/testsuite/gnat.dg/loop_optimization23_pkg.ads
*** gcc-5.4.0/gcc/testsuite/gnat.dg/loop_optimization23_pkg.ads	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gnat.dg/loop_optimization23_pkg.ads	Fri Aug 12 18:56:30 2016
***************
*** 0 ****
--- 1,17 ----
+ -- PR tree-optimization/71083
+ package Loop_Optimization23_Pkg is
+   type Nibble is mod 2**4;
+   type Int24  is mod 2**24;
+   type StructA is record
+     a : Nibble;
+     b : Int24;
+   end record;
+   pragma Pack(StructA);
+   type StructB is record
+     a : Nibble;
+     b : StructA;
+   end record;
+   pragma Pack(StructB);
+   type ArrayOfStructB is array(0..100) of StructB;
+   procedure Foo (X : in out ArrayOfStructB);
+ end Loop_Optimization23_Pkg;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/gnat.dg/opt63.adb gcc-5.5.0/gcc/testsuite/gnat.dg/opt63.adb
*** gcc-5.4.0/gcc/testsuite/gnat.dg/opt63.adb	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/gcc/testsuite/gnat.dg/opt63.adb	Fri Feb 24 10:40:56 2017
***************
*** 0 ****
--- 1,19 ----
+ -- { dg-do compile }
+ -- { dg-options "-O -gnatws" }
+ 
+ procedure Opt63 is
+ 
+    type T_MOD is mod 2**32;
+    subtype T_INDEX is T_MOD range 3_000_000_000 .. 4_000_000_000;
+    type T_ARRAY is array(T_INDEX range <>) of INTEGER;
+ 
+    function Build_Crash(First : T_INDEX; Length : NATURAL) return T_ARRAY is
+       R : T_ARRAY(First .. T_Index'Val (T_Index'Pos (First) + Length))
+              := (others => -1); -- Crash here
+    begin
+       return R;
+    end;
+ 
+ begin
+    null;
+ end;
diff -Nrcpad gcc-5.4.0/gcc/testsuite/lib/gcov.exp gcc-5.5.0/gcc/testsuite/lib/gcov.exp
*** gcc-5.4.0/gcc/testsuite/lib/gcov.exp	Thu Feb 26 18:24:44 2015
--- gcc-5.5.0/gcc/testsuite/lib/gcov.exp	Thu Nov  3 13:43:12 2016
***************
*** 20,34 ****
  global GCOV
  
  #
  # clean-gcov -- delete the working files the compiler creates for gcov
  #
  # TESTCASE is the name of the test.
  #
  proc clean-gcov { testcase } {
!     set basename [file tail $testcase]
!     set base [file rootname $basename]
!     remote_file host delete $base.gcno $base.gcda \
! 	$basename.gcov $base.h.gcov
  }
  
  #
--- 20,46 ----
  global GCOV
  
  #
+ # clean-gcov-file -- delete a working file the compiler creates for gcov
+ #
+ # TESTCASE is the name of the test.
+ # SUFFIX is file suffix
+ 
+ proc clean-gcov-file { testcase suffix } {
+     set basename [file tail $testcase]
+     set base [file rootname $basename]
+     remote_file host delete $base.$suffix
+ }
+ 
+ #
  # clean-gcov -- delete the working files the compiler creates for gcov
  #
  # TESTCASE is the name of the test.
  #
  proc clean-gcov { testcase } {
!     clean-gcov-file $testcase "gcno"
!     clean-gcov-file $testcase "gcda"
!     clean-gcov-file $testcase "gcov"
!     clean-gcov-file $testcase "h.gcov"
  }
  
  #
*************** proc run-gcov { args } {
*** 305,310 ****
--- 317,323 ----
      set gcov_verify_branches 0
      set gcov_verify_lines 1
      set gcov_verify_intermediate 0
+     set gcov_remove_gcda 0
      set xfailed 0
  
      foreach a $args {
*************** proc run-gcov { args } {
*** 317,322 ****
--- 330,337 ----
  	  set gcov_verify_calls 0
  	  set gcov_verify_branches 0
  	  set gcov_verify_lines 0
+ 	} elseif { $a == "remove-gcda" } {
+ 	  set gcov_remove_gcda 1
  	} elseif { $gcov_args == "" } {
  	    set gcov_args $a
  	} else {
*************** proc run-gcov { args } {
*** 332,337 ****
--- 347,357 ----
      # Extract the test file name from the arguments.
      set testcase [lindex $gcov_args end]
  
+     if { $gcov_remove_gcda } {
+ 	verbose "Removing $testcase.gcda"
+ 	clean-gcov-file $testcase "gcda"
+     }
+ 
      verbose "Running $GCOV $testcase" 2
      set testcase [remote_download host $testcase]
      set result [remote_exec host $GCOV $gcov_args]
diff -Nrcpad gcc-5.4.0/gcc/testsuite/lib/target-supports.exp gcc-5.5.0/gcc/testsuite/lib/target-supports.exp
*** gcc-5.4.0/gcc/testsuite/lib/target-supports.exp	Sat May 21 08:35:25 2016
--- gcc-5.5.0/gcc/testsuite/lib/target-supports.exp	Wed Nov  2 10:35:57 2016
*************** proc check_gc_sections_available { } {
*** 427,435 ****
  	}
  
  	# Check if the ld used by gcc supports --gc-sections.
! 	set gcc_spec [${tool}_target_compile "-dumpspecs" "" "none" ""]
! 	regsub ".*\n\\*linker:\[ \t\]*\n(\[^ \t\n\]*).*" "$gcc_spec" {\1} linker
! 	set gcc_ld [lindex [${tool}_target_compile "-print-prog-name=$linker" "" "none" ""] 0]
  	set ld_output [remote_exec host "$gcc_ld" "--help"]
  	if { [ string first "--gc-sections" $ld_output ] >= 0 } {
  	    set gc_sections_available_saved 1
--- 427,433 ----
  	}
  
  	# Check if the ld used by gcc supports --gc-sections.
! 	set gcc_ld [lindex [${tool}_target_compile "-print-prog-name=ld" "" "none" ""] 0]
  	set ld_output [remote_exec host "$gcc_ld" "--help"]
  	if { [ string first "--gc-sections" $ld_output ] >= 0 } {
  	    set gc_sections_available_saved 1
diff -Nrcpad gcc-5.4.0/gcc/toplev.c gcc-5.5.0/gcc/toplev.c
*** gcc-5.4.0/gcc/toplev.c	Fri Jul 10 12:33:28 2015
--- gcc-5.5.0/gcc/toplev.c	Mon Sep 25 23:49:58 2017
*************** along with GCC; see the file COPYING3.
*** 135,142 ****
  #define HAVE_prologue 0
  #endif
  
- #include <new>
- 
  static void general_init (const char *, bool);
  static void do_compile ();
  static void process_options (void);
--- 135,140 ----
*************** process_options (void)
*** 1367,1382 ****
      {
        if (targetm.chkp_bound_mode () == VOIDmode)
  	{
! 	  error ("-fcheck-pointer-bounds is not supported for this target");
  	  flag_check_pointer_bounds = 0;
  	}
  
        if (flag_sanitize & SANITIZE_ADDRESS)
  	{
! 	  error ("-fcheck-pointer-bounds is not supported with "
  		 "Address Sanitizer");
  	  flag_check_pointer_bounds = 0;
  	}
      }
  
    /* One region RA really helps to decrease the code size.  */
--- 1365,1397 ----
      {
        if (targetm.chkp_bound_mode () == VOIDmode)
  	{
! 	  error ("%<-fcheck-pointer-bounds%> is not supported for this "
! 		 "target");
  	  flag_check_pointer_bounds = 0;
  	}
  
+       if (flag_sanitize & SANITIZE_BOUNDS)
+ 	{
+ 	  error ("%<-fcheck-pointer-bounds%> is not supported with "
+ 		 "%<-fsanitize=bounds%>");
+  	  flag_check_pointer_bounds = 0;
+  	}
+ 
        if (flag_sanitize & SANITIZE_ADDRESS)
  	{
! 	  error ("%<-fcheck-pointer-bounds%> is not supported with "
  		 "Address Sanitizer");
  	  flag_check_pointer_bounds = 0;
  	}
+ 
+       if (flag_sanitize & SANITIZE_THREAD)
+ 	{
+ 	  error (UNKNOWN_LOCATION,
+ 		 "%<-fcheck-pointer-bounds%> is not supported with "
+ 		 "Thread Sanitizer");
+ 
+ 	  flag_check_pointer_bounds = 0;
+ 	}
      }
  
    /* One region RA really helps to decrease the code size.  */
*************** finalize (bool no_backend)
*** 1982,1987 ****
--- 1997,2005 ----
    if (stack_usage_file)
      fclose (stack_usage_file);
  
+   if (seen_error ())
+     coverage_remove_note_file ();
+ 
    if (!no_backend)
      {
        statistics_fini ();
diff -Nrcpad gcc-5.4.0/gcc/tree-call-cdce.c gcc-5.5.0/gcc/tree-call-cdce.c
*** gcc-5.4.0/gcc/tree-call-cdce.c	Fri Jan  9 20:18:42 2015
--- gcc-5.5.0/gcc/tree-call-cdce.c	Thu Jan 26 13:08:43 2017
*************** along with GCC; see the file COPYING3.
*** 56,61 ****
--- 56,62 ----
  #include "tree-into-ssa.h"
  #include "tree-pass.h"
  #include "flags.h"
+ #include "tree-phinodes.h"
  
  
  /* Conditional dead call elimination
*************** shrink_wrap_one_built_in_call (gcall *bi
*** 766,779 ****
        join_tgt_in_edge_from_call = find_fallthru_edge (bi_call_bb->succs);
        if (join_tgt_in_edge_from_call == NULL)
          return false;
      }
    else
!     join_tgt_in_edge_from_call = split_block (bi_call_bb, bi_call);
  
    bi_call_bsi = gsi_for_stmt (bi_call);
  
-   join_tgt_bb = join_tgt_in_edge_from_call->dest;
- 
    /* Now it is time to insert the first conditional expression
       into bi_call_bb and split this bb so that bi_call is
       shrink-wrapped.  */
--- 767,797 ----
        join_tgt_in_edge_from_call = find_fallthru_edge (bi_call_bb->succs);
        if (join_tgt_in_edge_from_call == NULL)
          return false;
+       /* We don't want to handle PHIs.  */
+       if (EDGE_COUNT (join_tgt_in_edge_from_call->dest->preds) > 1)
+ 	join_tgt_bb = split_edge (join_tgt_in_edge_from_call);
+       else
+ 	{
+ 	  join_tgt_bb = join_tgt_in_edge_from_call->dest;
+ 	  /* We may have degenerate PHIs in the destination.  Propagate
+ 	     those out.  */
+ 	  for (gphi_iterator i = gsi_start_phis (join_tgt_bb); !gsi_end_p (i);)
+ 	    {
+ 	      gphi *phi = i.phi ();
+ 	      replace_uses_by (gimple_phi_result (phi),
+ 			       gimple_phi_arg_def (phi, 0));
+ 	      remove_phi_node (&i, true);
+ 	    }
+ 	}
      }
    else
!     {
!       join_tgt_in_edge_from_call = split_block (bi_call_bb, bi_call);
!       join_tgt_bb = join_tgt_in_edge_from_call->dest;
!     }
  
    bi_call_bsi = gsi_for_stmt (bi_call);
  
    /* Now it is time to insert the first conditional expression
       into bi_call_bb and split this bb so that bi_call is
       shrink-wrapped.  */
diff -Nrcpad gcc-5.4.0/gcc/tree-cfg.c gcc-5.5.0/gcc/tree-cfg.c
*** gcc-5.4.0/gcc/tree-cfg.c	Fri May 20 13:24:29 2016
--- gcc-5.5.0/gcc/tree-cfg.c	Sat Sep 16 18:38:53 2017
*************** move_stmt_op (tree *tp, int *walk_subtre
*** 6467,6473 ****
  		*tp = t = out->to;
  	    }
  
! 	  DECL_CONTEXT (t) = p->to_context;
  	}
        else if (p->remap_decls_p)
  	{
--- 6467,6481 ----
  		*tp = t = out->to;
  	    }
  
! 	  /* For FORCED_LABELs we can end up with references from other
! 	     functions if some SESE regions are outlined.  It is UB to
! 	     jump in between them, but they could be used just for printing
! 	     addresses etc.  In that case, DECL_CONTEXT on the label should
! 	     be the function containing the glabel stmt with that LABEL_DECL,
! 	     rather than whatever function a reference to the label was seen
! 	     last time.  */
! 	  if (!FORCED_LABEL (t) && !DECL_NONLOCAL (t))
! 	    DECL_CONTEXT (t) = p->to_context;
  	}
        else if (p->remap_decls_p)
  	{
*************** move_stmt_r (gimple_stmt_iterator *gsi_p
*** 6586,6591 ****
--- 6594,6614 ----
      case GIMPLE_OMP_RETURN:
      case GIMPLE_OMP_CONTINUE:
        break;
+ 
+     case GIMPLE_LABEL:
+       {
+ 	/* For FORCED_LABEL, move_stmt_op doesn't adjust DECL_CONTEXT,
+ 	   so that such labels can be referenced from other regions.
+ 	   Make sure to update it when seeing a GIMPLE_LABEL though,
+ 	   that is the owner of the label.  */
+ 	walk_gimple_op (stmt, move_stmt_op, wi);
+ 	*handled_ops_p = true;
+ 	tree label = gimple_label_label (as_a <glabel *> (stmt));
+ 	if (FORCED_LABEL (label) || DECL_NONLOCAL (label))
+ 	  DECL_CONTEXT (label) = p->to_context;
+       }
+       break;
+ 
      default:
        if (is_gimple_omp (stmt))
  	{
*************** execute_fixup_cfg (void)
*** 8619,8634 ****
    gcov_type count_scale;
    edge e;
    edge_iterator ei;
  
    count_scale
!       = GCOV_COMPUTE_SCALE (cgraph_node::get (current_function_decl)->count,
! 			    ENTRY_BLOCK_PTR_FOR_FN (cfun)->count);
  
!   ENTRY_BLOCK_PTR_FOR_FN (cfun)->count =
! 			    cgraph_node::get (current_function_decl)->count;
!   EXIT_BLOCK_PTR_FOR_FN (cfun)->count =
! 			    apply_scale (EXIT_BLOCK_PTR_FOR_FN (cfun)->count,
!                                        count_scale);
  
    FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)
      e->count = apply_scale (e->count, count_scale);
--- 8642,8655 ----
    gcov_type count_scale;
    edge e;
    edge_iterator ei;
+   cgraph_node *node = cgraph_node::get (current_function_decl);
  
    count_scale
!     = GCOV_COMPUTE_SCALE (node->count, ENTRY_BLOCK_PTR_FOR_FN (cfun)->count);
  
!   ENTRY_BLOCK_PTR_FOR_FN (cfun)->count = node->count;
!   EXIT_BLOCK_PTR_FOR_FN (cfun)->count
!     = apply_scale (EXIT_BLOCK_PTR_FOR_FN (cfun)->count, count_scale);
  
    FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)
      e->count = apply_scale (e->count, count_scale);
*************** execute_fixup_cfg (void)
*** 8721,8730 ****
  	    {
  	      if (stmt && is_gimple_call (stmt))
  		gimple_call_set_ctrl_altering (stmt, false);
! 	      stmt = gimple_build_call
! 		  (builtin_decl_implicit (BUILT_IN_UNREACHABLE), 0);
  	      gimple_stmt_iterator gsi = gsi_last_bb (bb);
  	      gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
  	    }
  	}
      }
--- 8742,8760 ----
  	    {
  	      if (stmt && is_gimple_call (stmt))
  		gimple_call_set_ctrl_altering (stmt, false);
! 	      tree fndecl = builtin_decl_implicit (BUILT_IN_UNREACHABLE);
! 	      stmt = gimple_build_call (fndecl, 0);
  	      gimple_stmt_iterator gsi = gsi_last_bb (bb);
  	      gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
+ 	      if (!cfun->after_inlining)
+ 		{
+ 		  gcall *call_stmt = dyn_cast <gcall *> (stmt);
+ 		  int freq
+ 		    = compute_call_stmt_bb_frequency (current_function_decl,
+ 						      bb);
+ 		  node->create_edge (cgraph_node::get_create (fndecl),
+ 				     call_stmt, bb->count, freq);
+ 		}
  	    }
  	}
      }
diff -Nrcpad gcc-5.4.0/gcc/tree-chkp-opt.c gcc-5.5.0/gcc/tree-chkp-opt.c
*** gcc-5.4.0/gcc/tree-chkp-opt.c	Thu Jan 15 13:28:42 2015
--- gcc-5.5.0/gcc/tree-chkp-opt.c	Wed Mar 22 12:29:56 2017
*************** chkp_is_constant_addr (const address_t &
*** 282,290 ****
      return false;
    else if (addr.pol[0].var)
      return false;
    else if (integer_zerop (addr.pol[0].cst))
      *sign = 0;
!   else if  (tree_int_cst_sign_bit (addr.pol[0].cst))
      *sign = -1;
    else
      *sign = 1;
--- 282,292 ----
      return false;
    else if (addr.pol[0].var)
      return false;
+   else if (TREE_CODE (addr.pol[0].cst) != INTEGER_CST)
+     return false;
    else if (integer_zerop (addr.pol[0].cst))
      *sign = 0;
!   else if (tree_int_cst_sign_bit (addr.pol[0].cst))
      *sign = -1;
    else
      *sign = 1;
diff -Nrcpad gcc-5.4.0/gcc/tree-chkp.c gcc-5.5.0/gcc/tree-chkp.c
*** gcc-5.4.0/gcc/tree-chkp.c	Thu Jul 23 13:21:39 2015
--- gcc-5.5.0/gcc/tree-chkp.c	Fri Sep 15 14:11:27 2017
*************** chkp_build_returned_bound (gcall *call)
*** 2236,2241 ****
--- 2236,2242 ----
    tree bounds;
    gimple stmt;
    tree fndecl = gimple_call_fndecl (call);
+   tree lhs = gimple_call_lhs (call);
    unsigned int retflags;
  
    /* To avoid fixing alloca expands in targets we handle
*************** chkp_build_returned_bound (gcall *call)
*** 2246,2254 ****
  	  || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_ALLOCA_WITH_ALIGN))
      {
        tree size = gimple_call_arg (call, 0);
-       tree lb = gimple_call_lhs (call);
        gimple_stmt_iterator iter = gsi_for_stmt (call);
!       bounds = chkp_make_bounds (lb, size, &iter, true);
      }
    /* We know bounds returned by set_bounds builtin call.  */
    else if (fndecl
--- 2247,2254 ----
  	  || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_ALLOCA_WITH_ALIGN))
      {
        tree size = gimple_call_arg (call, 0);
        gimple_stmt_iterator iter = gsi_for_stmt (call);
!       bounds = chkp_make_bounds (lhs, size, &iter, true);
      }
    /* We know bounds returned by set_bounds builtin call.  */
    else if (fndecl
*************** chkp_build_returned_bound (gcall *call)
*** 2301,2309 ****
  
        bounds = chkp_find_bounds (gimple_call_arg (call, argno), &iter);
      }
!   else if (chkp_call_returns_bounds_p (call))
      {
!       gcc_assert (TREE_CODE (gimple_call_lhs (call)) == SSA_NAME);
  
        /* In general case build checker builtin call to
  	 obtain returned bounds.  */
--- 2301,2310 ----
  
        bounds = chkp_find_bounds (gimple_call_arg (call, argno), &iter);
      }
!   else if (chkp_call_returns_bounds_p (call)
! 	   && BOUNDED_P (lhs))
      {
!       gcc_assert (TREE_CODE (lhs) == SSA_NAME);
  
        /* In general case build checker builtin call to
  	 obtain returned bounds.  */
*************** chkp_build_returned_bound (gcall *call)
*** 2330,2336 ****
        print_gimple_stmt (dump_file, call, 0, TDF_VOPS|TDF_MEMSYMS);
      }
  
!   bounds = chkp_maybe_copy_and_register_bounds (gimple_call_lhs (call), bounds);
  
    return bounds;
  }
--- 2331,2337 ----
        print_gimple_stmt (dump_file, call, 0, TDF_VOPS|TDF_MEMSYMS);
      }
  
!   bounds = chkp_maybe_copy_and_register_bounds (lhs, bounds);
  
    return bounds;
  }
*************** chkp_get_bounds_for_decl_addr (tree decl
*** 3100,3105 ****
--- 3101,3109 ----
        && !flag_chkp_incomplete_type)
        return chkp_get_zero_bounds ();
  
+   if (VOID_TYPE_P (TREE_TYPE (decl)))
+     return chkp_get_zero_bounds ();
+ 
    if (flag_chkp_use_static_bounds
        && TREE_CODE (decl) == VAR_DECL
        && (TREE_STATIC (decl)
*************** chkp_find_bounds_1 (tree ptr, tree ptr_s
*** 3556,3563 ****
        break;
  
      case PARM_DECL:
!       gcc_unreachable ();
!       bounds = chkp_get_bound_for_parm (ptr_src);
        break;
  
      case TARGET_MEM_REF:
--- 3560,3567 ----
        break;
  
      case PARM_DECL:
!       /* Handled above but failed.  */
!       bounds = chkp_get_invalid_op_bounds ();
        break;
  
      case TARGET_MEM_REF:
*************** chkp_find_bounds_1 (tree ptr, tree ptr_s
*** 3618,3623 ****
--- 3622,3629 ----
        break;
  
      case INTEGER_CST:
+     case COMPLEX_CST:
+     case VECTOR_CST:
        if (integer_zerop (ptr_src))
  	bounds = chkp_get_none_bounds ();
        else
*************** chkp_walk_pointer_assignments (tree lhs,
*** 3690,3696 ****
  
  	  FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs), cnt, field, val)
  	    {
! 	      if (chkp_type_has_pointer (TREE_TYPE (field)))
  		{
  		  tree lhs_field = chkp_build_component_ref (lhs, field);
  		  chkp_walk_pointer_assignments (lhs_field, val, arg, handler);
--- 3696,3702 ----
  
  	  FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs), cnt, field, val)
  	    {
! 	      if (field && chkp_type_has_pointer (TREE_TYPE (field)))
  		{
  		  tree lhs_field = chkp_build_component_ref (lhs, field);
  		  chkp_walk_pointer_assignments (lhs_field, val, arg, handler);
diff -Nrcpad gcc-5.4.0/gcc/tree-chrec.c gcc-5.5.0/gcc/tree-chrec.c
*** gcc-5.4.0/gcc/tree-chrec.c	Wed Apr  6 08:09:40 2016
--- gcc-5.5.0/gcc/tree-chrec.c	Wed May 10 07:53:45 2017
*************** chrec_fold_plus_poly_poly (enum tree_cod
*** 167,173 ****
  
    /* This function should never be called for chrecs of loops that
       do not belong to the same loop nest.  */
!   gcc_assert (loop0 == loop1);
  
    if (code == PLUS_EXPR || code == POINTER_PLUS_EXPR)
      {
--- 167,178 ----
  
    /* This function should never be called for chrecs of loops that
       do not belong to the same loop nest.  */
!   if (loop0 != loop1)
!     {
!       /* It still can happen if we are not in loop-closed SSA form.  */
!       gcc_assert (! loops_state_satisfies_p (LOOP_CLOSED_SSA));
!       return chrec_dont_know;
!     }
  
    if (code == PLUS_EXPR || code == POINTER_PLUS_EXPR)
      {
*************** chrec_fold_multiply_poly_poly (tree type
*** 229,235 ****
         chrec_fold_multiply (type, CHREC_LEFT (poly0), poly1),
         CHREC_RIGHT (poly0));
  
!   gcc_assert (loop0 == loop1);
  
    /* poly0 and poly1 are two polynomials in the same variable,
       {a, +, b}_x * {c, +, d}_x  ->  {a*c, +, a*d + b*c + b*d, +, 2*b*d}_x.  */
--- 234,245 ----
         chrec_fold_multiply (type, CHREC_LEFT (poly0), poly1),
         CHREC_RIGHT (poly0));
  
!   if (loop0 != loop1)
!     {
!       /* It still can happen if we are not in loop-closed SSA form.  */
!       gcc_assert (! loops_state_satisfies_p (LOOP_CLOSED_SSA));
!       return chrec_dont_know;
!     }
  
    /* poly0 and poly1 are two polynomials in the same variable,
       {a, +, b}_x * {c, +, d}_x  ->  {a*c, +, a*d + b*c + b*d, +, 2*b*d}_x.  */
*************** tree_fold_binomial (tree type, tree n, u
*** 502,508 ****
  {
    bool overflow;
    unsigned int i;
-   tree res;
  
    /* Handle the most frequent cases.  */
    if (k == 0)
--- 512,517 ----
*************** tree_fold_binomial (tree type, tree n, u
*** 510,527 ****
    if (k == 1)
      return fold_convert (type, n);
  
    /* Check that k <= n.  */
!   if (wi::ltu_p (n, k))
      return NULL_TREE;
  
    /* Denominator = 2.  */
!   wide_int denom = wi::two (TYPE_PRECISION (TREE_TYPE (n)));
  
    /* Index = Numerator-1.  */
!   wide_int idx = wi::sub (n, 1);
  
    /* Numerator = Numerator*Index = n*(n-1).  */
!   wide_int num = wi::smul (n, idx, &overflow);
    if (overflow)
      return NULL_TREE;
  
--- 519,538 ----
    if (k == 1)
      return fold_convert (type, n);
  
+   widest_int num = wi::to_widest (n);
+ 
    /* Check that k <= n.  */
!   if (wi::ltu_p (num, k))
      return NULL_TREE;
  
    /* Denominator = 2.  */
!   widest_int denom = 2;
  
    /* Index = Numerator-1.  */
!   widest_int idx = num - 1;
  
    /* Numerator = Numerator*Index = n*(n-1).  */
!   num = wi::smul (num, idx, &overflow);
    if (overflow)
      return NULL_TREE;
  
*************** tree_fold_binomial (tree type, tree n, u
*** 540,548 ****
      }
  
    /* Result = Numerator / Denominator.  */
!   wide_int di_res = wi::udiv_trunc (num, denom);
!   res = wide_int_to_tree (type, di_res);
!   return int_fits_type_p (res, type) ? res : NULL_TREE;
  }
  
  /* Helper function.  Use the Newton's interpolating formula for
--- 551,560 ----
      }
  
    /* Result = Numerator / Denominator.  */
!   num = wi::udiv_trunc (num, denom);
!   if (! wi::fits_to_tree_p (num, type))
!     return NULL_TREE;
!   return wide_int_to_tree (type, num);
  }
  
  /* Helper function.  Use the Newton's interpolating formula for
diff -Nrcpad gcc-5.4.0/gcc/tree-data-ref.c gcc-5.5.0/gcc/tree-data-ref.c
*** gcc-5.4.0/gcc/tree-data-ref.c	Tue Jan 26 22:14:53 2016
--- gcc-5.5.0/gcc/tree-data-ref.c	Tue Jan 24 08:06:29 2017
*************** analyze_subscript_affine_affine (tree ch
*** 2717,2729 ****
  
  	      if (niter > 0)
  		{
! 		  HOST_WIDE_INT tau2 = MIN (FLOOR_DIV (niter - i0, i1),
! 					    FLOOR_DIV (niter - j0, j1));
  		  HOST_WIDE_INT last_conflict = tau2 - (x1 - i0)/i1;
  
  		  /* If the overlap occurs outside of the bounds of the
  		     loop, there is no dependence.  */
! 		  if (x1 >= niter || y1 >= niter)
  		    {
  		      *overlaps_a = conflict_fn_no_dependence ();
  		      *overlaps_b = conflict_fn_no_dependence ();
--- 2717,2729 ----
  
  	      if (niter > 0)
  		{
! 		  HOST_WIDE_INT tau2 = MIN (FLOOR_DIV (niter_a - i0, i1),
! 					    FLOOR_DIV (niter_b - j0, j1));
  		  HOST_WIDE_INT last_conflict = tau2 - (x1 - i0)/i1;
  
  		  /* If the overlap occurs outside of the bounds of the
  		     loop, there is no dependence.  */
! 		  if (x1 >= niter_a || y1 >= niter_b)
  		    {
  		      *overlaps_a = conflict_fn_no_dependence ();
  		      *overlaps_b = conflict_fn_no_dependence ();
diff -Nrcpad gcc-5.4.0/gcc/tree-eh.c gcc-5.5.0/gcc/tree-eh.c
*** gcc-5.4.0/gcc/tree-eh.c	Wed Feb 18 22:02:43 2015
--- gcc-5.5.0/gcc/tree-eh.c	Tue May 30 08:05:47 2017
*************** operation_could_trap_p (enum tree_code o
*** 2543,2549 ****
  
    if (TREE_CODE_CLASS (op) != tcc_comparison
        && TREE_CODE_CLASS (op) != tcc_unary
!       && TREE_CODE_CLASS (op) != tcc_binary)
      return false;
  
    return operation_could_trap_helper_p (op, fp_operation, honor_trapv,
--- 2543,2550 ----
  
    if (TREE_CODE_CLASS (op) != tcc_comparison
        && TREE_CODE_CLASS (op) != tcc_unary
!       && TREE_CODE_CLASS (op) != tcc_binary
!       && op != FMA_EXPR)
      return false;
  
    return operation_could_trap_helper_p (op, fp_operation, honor_trapv,
*************** stmt_could_throw_1_p (gimple stmt)
*** 2768,2774 ****
  
    if (TREE_CODE_CLASS (code) == tcc_comparison
        || TREE_CODE_CLASS (code) == tcc_unary
!       || TREE_CODE_CLASS (code) == tcc_binary)
      {
        if (is_gimple_assign (stmt)
  	  && TREE_CODE_CLASS (code) == tcc_comparison)
--- 2769,2776 ----
  
    if (TREE_CODE_CLASS (code) == tcc_comparison
        || TREE_CODE_CLASS (code) == tcc_unary
!       || TREE_CODE_CLASS (code) == tcc_binary
!       || code == FMA_EXPR)
      {
        if (is_gimple_assign (stmt)
  	  && TREE_CODE_CLASS (code) == tcc_comparison)
diff -Nrcpad gcc-5.4.0/gcc/tree-inline.c gcc-5.5.0/gcc/tree-inline.c
*** gcc-5.4.0/gcc/tree-inline.c	Wed May 18 15:59:00 2016
--- gcc-5.5.0/gcc/tree-inline.c	Tue May 30 07:28:40 2017
*************** remap_gimple_stmt (gimple stmt, copy_bod
*** 1644,1649 ****
--- 1644,1660 ----
  	    gimple_call_set_tail (call_stmt, false);
  	  if (gimple_call_from_thunk_p (call_stmt))
  	    gimple_call_set_from_thunk (call_stmt, false);
+ 	  if (gimple_call_internal_p (call_stmt))
+ 	    switch (gimple_call_internal_fn (call_stmt))
+ 	      {
+ 	      case IFN_GOMP_SIMD_LANE:
+ 	      case IFN_GOMP_SIMD_VF:
+ 	      case IFN_GOMP_SIMD_LAST_LANE:
+ 		DECL_STRUCT_FUNCTION (id->dst_fn)->has_simduid_loops = true;
+ 	        break;
+ 	      default:
+ 		break;
+ 	      }
  	}
  
        /* Remap the region numbers for __builtin_eh_{pointer,filter},
*************** copy_bb (copy_body_data *id, basic_block
*** 1852,1858 ****
  	  call_stmt = dyn_cast <gcall *> (stmt);
  	  if (call_stmt
  	      && gimple_call_va_arg_pack_p (call_stmt)
! 	      && id->call_stmt)
  	    {
  	      /* __builtin_va_arg_pack () should be replaced by
  		 all arguments corresponding to ... in the caller.  */
--- 1863,1870 ----
  	  call_stmt = dyn_cast <gcall *> (stmt);
  	  if (call_stmt
  	      && gimple_call_va_arg_pack_p (call_stmt)
! 	      && id->call_stmt
! 	      && ! gimple_call_va_arg_pack_p (id->call_stmt))
  	    {
  	      /* __builtin_va_arg_pack () should be replaced by
  		 all arguments corresponding to ... in the caller.  */
*************** copy_bb (copy_body_data *id, basic_block
*** 1932,1938 ****
  		   && id->call_stmt
  		   && (decl = gimple_call_fndecl (stmt))
  		   && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
! 		   && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
  	    {
  	      /* __builtin_va_arg_pack_len () should be replaced by
  		 the number of anonymous arguments.  */
--- 1944,1951 ----
  		   && id->call_stmt
  		   && (decl = gimple_call_fndecl (stmt))
  		   && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
! 		   && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN
! 		   && ! gimple_call_va_arg_pack_p (id->call_stmt))
  	    {
  	      /* __builtin_va_arg_pack_len () should be replaced by
  		 the number of anonymous arguments.  */
*************** copy_phis_for_bb (basic_block bb, copy_b
*** 2345,2397 ****
  	{
  	  walk_tree (&new_res, copy_tree_body_r, id, NULL);
  	  new_phi = create_phi_node (new_res, new_bb);
! 	  FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
  	    {
! 	      edge old_edge = find_edge ((basic_block) new_edge->src->aux, bb);
! 	      tree arg;
! 	      tree new_arg;
! 	      edge_iterator ei2;
! 	      location_t locus;
  
! 	      /* When doing partial cloning, we allow PHIs on the entry block
! 		 as long as all the arguments are the same.  Find any input
! 		 edge to see argument to copy.  */
! 	      if (!old_edge)
! 		FOR_EACH_EDGE (old_edge, ei2, bb->preds)
! 		  if (!old_edge->src->aux)
! 		    break;
  
! 	      arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
! 	      new_arg = arg;
! 	      walk_tree (&new_arg, copy_tree_body_r, id, NULL);
! 	      gcc_assert (new_arg);
! 	      /* With return slot optimization we can end up with
! 	         non-gimple (foo *)&this->m, fix that here.  */
! 	      if (TREE_CODE (new_arg) != SSA_NAME
! 		  && TREE_CODE (new_arg) != FUNCTION_DECL
! 		  && !is_gimple_val (new_arg))
! 		{
! 		  gimple_seq stmts = NULL;
! 		  new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
! 		  gsi_insert_seq_on_edge (new_edge, stmts);
! 		  inserted = true;
! 		}
! 	      locus = gimple_phi_arg_location_from_edge (phi, old_edge);
! 	      if (LOCATION_BLOCK (locus))
! 		{
! 		  tree *n;
! 		  n = id->decl_map->get (LOCATION_BLOCK (locus));
! 		  gcc_assert (n);
! 		  if (*n)
! 		    locus = COMBINE_LOCATION_DATA (line_table, locus, *n);
! 		  else
! 		    locus = LOCATION_LOCUS (locus);
! 		}
! 	      else
! 		locus = LOCATION_LOCUS (locus);
  
! 	      add_phi_arg (new_phi, new_arg, new_edge, locus);
! 	    }
  	}
      }
  
--- 2358,2416 ----
  	{
  	  walk_tree (&new_res, copy_tree_body_r, id, NULL);
  	  new_phi = create_phi_node (new_res, new_bb);
! 	  if (EDGE_COUNT (new_bb->preds) == 0)
  	    {
! 	      /* Technically we'd want a SSA_DEFAULT_DEF here... */
! 	      SSA_NAME_DEF_STMT (new_res) = gimple_build_nop ();
! 	    }
! 	  else
! 	    FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
! 	      {
! 		edge old_edge = find_edge ((basic_block) new_edge->src->aux, bb);
! 		tree arg;
! 		tree new_arg;
! 		edge_iterator ei2;
! 		location_t locus;
  
! 		/* When doing partial cloning, we allow PHIs on the entry block
! 		   as long as all the arguments are the same.  Find any input
! 		   edge to see argument to copy.  */
! 		if (!old_edge)
! 		  FOR_EACH_EDGE (old_edge, ei2, bb->preds)
! 		    if (!old_edge->src->aux)
! 		      break;
  
! 		arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
! 		new_arg = arg;
! 		walk_tree (&new_arg, copy_tree_body_r, id, NULL);
! 		gcc_assert (new_arg);
! 		/* With return slot optimization we can end up with
! 		   non-gimple (foo *)&this->m, fix that here.  */
! 		if (TREE_CODE (new_arg) != SSA_NAME
! 		    && TREE_CODE (new_arg) != FUNCTION_DECL
! 		    && !is_gimple_val (new_arg))
! 		  {
! 		    gimple_seq stmts = NULL;
! 		    new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
! 		    gsi_insert_seq_on_edge (new_edge, stmts);
! 		    inserted = true;
! 		  }
! 		locus = gimple_phi_arg_location_from_edge (phi, old_edge);
! 		if (LOCATION_BLOCK (locus))
! 		  {
! 		    tree *n;
! 		    n = id->decl_map->get (LOCATION_BLOCK (locus));
! 		    gcc_assert (n);
! 		    if (*n)
! 		      locus = COMBINE_LOCATION_DATA (line_table, locus, *n);
! 		    else
! 		      locus = LOCATION_LOCUS (locus);
! 		  }
! 		 else
! 		   locus = LOCATION_LOCUS (locus);
  
! 		add_phi_arg (new_phi, new_arg, new_edge, locus);
! 	      }
  	}
      }
  
*************** expand_call_inline (basic_block bb, gimp
*** 4580,4586 ****
    id->src_fn = fn;
    id->src_node = cg_edge->callee;
    id->src_cfun = DECL_STRUCT_FUNCTION (fn);
!   id->call_stmt = stmt;
  
    gcc_assert (!id->src_cfun->after_inlining);
  
--- 4599,4605 ----
    id->src_fn = fn;
    id->src_node = cg_edge->callee;
    id->src_cfun = DECL_STRUCT_FUNCTION (fn);
!   id->call_stmt = call_stmt;
  
    gcc_assert (!id->src_cfun->after_inlining);
  
*************** expand_call_inline (basic_block bb, gimp
*** 4755,4761 ****
  	{
  	  tree name = gimple_call_lhs (stmt);
  	  tree var = SSA_NAME_VAR (name);
! 	  tree def = ssa_default_def (cfun, var);
  
  	  if (def)
  	    {
--- 4774,4780 ----
  	{
  	  tree name = gimple_call_lhs (stmt);
  	  tree var = SSA_NAME_VAR (name);
! 	  tree def = var ? ssa_default_def (cfun, var) : NULL;
  
  	  if (def)
  	    {
*************** expand_call_inline (basic_block bb, gimp
*** 4766,4771 ****
--- 4785,4795 ----
  	    }
  	  else
  	    {
+ 	      if (!var)
+ 		{
+ 		  var = create_tmp_reg_fn (cfun, TREE_TYPE (name), NULL);
+ 		  SET_SSA_NAME_VAR_OR_IDENTIFIER (name, var);
+ 		}
  	      /* Otherwise make this variable undefined.  */
  	      gsi_remove (&stmt_gsi, true);
  	      set_ssa_default_def (cfun, var, name);
diff -Nrcpad gcc-5.4.0/gcc/tree-inline.h gcc-5.5.0/gcc/tree-inline.h
*** gcc-5.4.0/gcc/tree-inline.h	Fri Jan 16 13:08:24 2015
--- gcc-5.5.0/gcc/tree-inline.h	Wed May 10 07:53:45 2017
*************** struct copy_body_data
*** 101,107 ****
  
    /* GIMPLE_CALL if va arg parameter packs should be expanded or NULL
       is not.  */
!   gimple call_stmt;
  
    /* Exception landing pad the inlined call lies in.  */
    int eh_lp_nr;
--- 101,107 ----
  
    /* GIMPLE_CALL if va arg parameter packs should be expanded or NULL
       is not.  */
!   gcall *call_stmt;
  
    /* Exception landing pad the inlined call lies in.  */
    int eh_lp_nr;
diff -Nrcpad gcc-5.4.0/gcc/tree-loop-distribution.c gcc-5.5.0/gcc/tree-loop-distribution.c
*** gcc-5.4.0/gcc/tree-loop-distribution.c	Tue Jan 13 13:41:46 2015
--- gcc-5.5.0/gcc/tree-loop-distribution.c	Tue May 30 07:13:36 2017
*************** along with GCC; see the file COPYING3.
*** 90,95 ****
--- 90,96 ----
  #include "tree-pass.h"
  #include "gimple-pretty-print.h"
  #include "tree-vectorizer.h"
+ #include "real.h"
  
  
  /* A Reduced Dependence Graph (RDG) vertex representing a statement.  */
*************** const_with_all_bytes_same (tree val)
*** 775,786 ****
    int i, len;
  
    if (integer_zerop (val)
-       || real_zerop (val)
        || (TREE_CODE (val) == CONSTRUCTOR
            && !TREE_CLOBBER_P (val)
            && CONSTRUCTOR_NELTS (val) == 0))
      return 0;
  
    if (CHAR_BIT != 8 || BITS_PER_UNIT != 8)
      return -1;
  
--- 776,815 ----
    int i, len;
  
    if (integer_zerop (val)
        || (TREE_CODE (val) == CONSTRUCTOR
            && !TREE_CLOBBER_P (val)
            && CONSTRUCTOR_NELTS (val) == 0))
      return 0;
  
+   if (real_zerop (val))
+     {
+       /* Only return 0 for +0.0, not for -0.0, which doesn't have
+ 	 an all bytes same memory representation.  Don't transform
+ 	 -0.0 stores into +0.0 even for !HONOR_SIGNED_ZEROS.  */
+       switch (TREE_CODE (val))
+ 	{
+ 	case REAL_CST:
+ 	  if (!real_isneg (TREE_REAL_CST_PTR (val)))
+ 	    return 0;
+ 	  break;
+ 	case COMPLEX_CST:
+ 	  if (!const_with_all_bytes_same (TREE_REALPART (val))
+ 	      && !const_with_all_bytes_same (TREE_IMAGPART (val)))
+ 	    return 0;
+ 	  break;
+ 	case VECTOR_CST:
+ 	  unsigned int j;
+ 	  for (j = 0; j < VECTOR_CST_NELTS (val); ++j)
+ 	    if (const_with_all_bytes_same (VECTOR_CST_ELT (val, j)))
+ 	      break;
+ 	  if (j == VECTOR_CST_NELTS (val))
+ 	    return 0;
+ 	  break;
+ 	default:
+ 	  break;
+ 	}
+     }
+ 
    if (CHAR_BIT != 8 || BITS_PER_UNIT != 8)
      return -1;
  
diff -Nrcpad gcc-5.4.0/gcc/tree-nested.c gcc-5.5.0/gcc/tree-nested.c
*** gcc-5.4.0/gcc/tree-nested.c	Fri Jul 10 14:13:19 2015
--- gcc-5.5.0/gcc/tree-nested.c	Tue May 30 07:45:47 2017
*************** convert_nonlocal_reference_stmt (gimple_
*** 1344,1350 ****
  	{
  	  wi->val_only = true;
  	  wi->is_lhs = false;
! 	  *handled_ops_p = true;
  	  return NULL_TREE;
  	}
        break;
--- 1344,1350 ----
  	{
  	  wi->val_only = true;
  	  wi->is_lhs = false;
! 	  *handled_ops_p = false;
  	  return NULL_TREE;
  	}
        break;
*************** convert_local_reference_stmt (gimple_stm
*** 1915,1920 ****
--- 1915,1922 ----
    struct nesting_info *info = (struct nesting_info *) wi->info;
    tree save_local_var_chain;
    bitmap save_suppress;
+   char save_static_chain_added;
+   bool frame_decl_added;
    gimple stmt = gsi_stmt (*gsi);
  
    switch (gimple_code (stmt))
*************** convert_local_reference_stmt (gimple_stm
*** 1922,1950 ****
      case GIMPLE_OMP_PARALLEL:
      case GIMPLE_OMP_TASK:
        save_suppress = info->suppress_expansion;
        if (convert_local_omp_clauses (gimple_omp_taskreg_clauses_ptr (stmt),
  	                             wi))
  	{
! 	  tree c;
  	  (void) get_frame_type (info);
- 	  c = build_omp_clause (gimple_location (stmt),
- 				OMP_CLAUSE_SHARED);
  	  OMP_CLAUSE_DECL (c) = info->frame_decl;
  	  OMP_CLAUSE_CHAIN (c) = gimple_omp_taskreg_clauses (stmt);
  	  gimple_omp_taskreg_set_clauses (stmt, c);
  	}
  
        save_local_var_chain = info->new_local_var_chain;
        info->new_local_var_chain = NULL;
  
        walk_body (convert_local_reference_stmt, convert_local_reference_op, info,
  	         gimple_omp_body_ptr (stmt));
  
        if (info->new_local_var_chain)
  	declare_vars (info->new_local_var_chain,
  		      gimple_seq_first_stmt (gimple_omp_body (stmt)), false);
        info->new_local_var_chain = save_local_var_chain;
        info->suppress_expansion = save_suppress;
        break;
  
      case GIMPLE_OMP_FOR:
--- 1924,1967 ----
      case GIMPLE_OMP_PARALLEL:
      case GIMPLE_OMP_TASK:
        save_suppress = info->suppress_expansion;
+       frame_decl_added = false;
        if (convert_local_omp_clauses (gimple_omp_taskreg_clauses_ptr (stmt),
  	                             wi))
  	{
! 	  tree c = build_omp_clause (gimple_location (stmt),
! 				     OMP_CLAUSE_SHARED);
  	  (void) get_frame_type (info);
  	  OMP_CLAUSE_DECL (c) = info->frame_decl;
  	  OMP_CLAUSE_CHAIN (c) = gimple_omp_taskreg_clauses (stmt);
  	  gimple_omp_taskreg_set_clauses (stmt, c);
+ 	  info->static_chain_added |= 4;
+ 	  frame_decl_added = true;
  	}
  
        save_local_var_chain = info->new_local_var_chain;
+       save_static_chain_added = info->static_chain_added;
        info->new_local_var_chain = NULL;
+       info->static_chain_added = 0;
  
        walk_body (convert_local_reference_stmt, convert_local_reference_op, info,
  	         gimple_omp_body_ptr (stmt));
  
+       if ((info->static_chain_added & 4) != 0 && !frame_decl_added)
+ 	{
+ 	  tree c = build_omp_clause (gimple_location (stmt),
+ 				     OMP_CLAUSE_SHARED);
+ 	  (void) get_frame_type (info);
+ 	  OMP_CLAUSE_DECL (c) = info->frame_decl;
+ 	  OMP_CLAUSE_CHAIN (c) = gimple_omp_taskreg_clauses (stmt);
+ 	  info->static_chain_added |= 4;
+ 	  gimple_omp_taskreg_set_clauses (stmt, c);
+ 	}
        if (info->new_local_var_chain)
  	declare_vars (info->new_local_var_chain,
  		      gimple_seq_first_stmt (gimple_omp_body (stmt)), false);
        info->new_local_var_chain = save_local_var_chain;
        info->suppress_expansion = save_suppress;
+       info->static_chain_added |= save_static_chain_added;
        break;
  
      case GIMPLE_OMP_FOR:
*************** convert_local_reference_stmt (gimple_stm
*** 1985,2013 ****
  	  break;
  	}
        save_suppress = info->suppress_expansion;
        if (convert_local_omp_clauses (gimple_omp_target_clauses_ptr (stmt), wi))
  	{
! 	  tree c;
  	  (void) get_frame_type (info);
- 	  c = build_omp_clause (gimple_location (stmt), OMP_CLAUSE_MAP);
  	  OMP_CLAUSE_DECL (c) = info->frame_decl;
  	  OMP_CLAUSE_SET_MAP_KIND (c, GOMP_MAP_TOFROM);
  	  OMP_CLAUSE_SIZE (c) = DECL_SIZE_UNIT (info->frame_decl);
  	  OMP_CLAUSE_CHAIN (c) = gimple_omp_target_clauses (stmt);
  	  gimple_omp_target_set_clauses (as_a <gomp_target *> (stmt), c);
  	}
  
        save_local_var_chain = info->new_local_var_chain;
        info->new_local_var_chain = NULL;
  
        walk_body (convert_local_reference_stmt, convert_local_reference_op, info,
  		 gimple_omp_body_ptr (stmt));
  
        if (info->new_local_var_chain)
  	declare_vars (info->new_local_var_chain,
  		      gimple_seq_first_stmt (gimple_omp_body (stmt)), false);
        info->new_local_var_chain = save_local_var_chain;
        info->suppress_expansion = save_suppress;
        break;
  
      case GIMPLE_OMP_TEAMS:
--- 2002,2047 ----
  	  break;
  	}
        save_suppress = info->suppress_expansion;
+       frame_decl_added = false;
        if (convert_local_omp_clauses (gimple_omp_target_clauses_ptr (stmt), wi))
  	{
! 	  tree c = build_omp_clause (gimple_location (stmt), OMP_CLAUSE_MAP);
  	  (void) get_frame_type (info);
  	  OMP_CLAUSE_DECL (c) = info->frame_decl;
  	  OMP_CLAUSE_SET_MAP_KIND (c, GOMP_MAP_TOFROM);
  	  OMP_CLAUSE_SIZE (c) = DECL_SIZE_UNIT (info->frame_decl);
  	  OMP_CLAUSE_CHAIN (c) = gimple_omp_target_clauses (stmt);
  	  gimple_omp_target_set_clauses (as_a <gomp_target *> (stmt), c);
+ 	  info->static_chain_added |= 4;
+ 	  frame_decl_added = true;
  	}
  
        save_local_var_chain = info->new_local_var_chain;
+       save_static_chain_added = info->static_chain_added;
        info->new_local_var_chain = NULL;
+       info->static_chain_added = 0;
  
        walk_body (convert_local_reference_stmt, convert_local_reference_op, info,
  		 gimple_omp_body_ptr (stmt));
  
+       if ((info->static_chain_added & 4) != 0 && !frame_decl_added)
+ 	{
+ 	  tree c = build_omp_clause (gimple_location (stmt), OMP_CLAUSE_MAP);
+ 	  (void) get_frame_type (info);
+ 	  OMP_CLAUSE_DECL (c) = info->frame_decl;
+ 	  OMP_CLAUSE_SET_MAP_KIND (c, GOMP_MAP_TOFROM);
+ 	  OMP_CLAUSE_SIZE (c) = DECL_SIZE_UNIT (info->frame_decl);
+ 	  OMP_CLAUSE_CHAIN (c) = gimple_omp_target_clauses (stmt);
+ 	  gimple_omp_target_set_clauses (as_a <gomp_target *> (stmt), c);
+ 	  info->static_chain_added |= 4;
+ 	}
+ 
        if (info->new_local_var_chain)
  	declare_vars (info->new_local_var_chain,
  		      gimple_seq_first_stmt (gimple_omp_body (stmt)), false);
        info->new_local_var_chain = save_local_var_chain;
        info->suppress_expansion = save_suppress;
+       info->static_chain_added |= save_static_chain_added;
        break;
  
      case GIMPLE_OMP_TEAMS:
diff -Nrcpad gcc-5.4.0/gcc/tree-predcom.c gcc-5.5.0/gcc/tree-predcom.c
*** gcc-5.4.0/gcc/tree-predcom.c	Wed Feb 18 13:08:58 2015
--- gcc-5.5.0/gcc/tree-predcom.c	Fri Aug 12 18:56:30 2016
*************** along with GCC; see the file COPYING3.
*** 252,257 ****
--- 252,258 ----
  #include "tree-affine.h"
  #include "tree-inline.h"
  #include "wide-int-print.h"
+ #include "builtins.h"
  
  /* The maximum number of iterations between the considered memory
     references.  */
*************** ref_at_iteration (data_reference_p dr, i
*** 1424,1429 ****
--- 1425,1432 ----
    addr = force_gimple_operand_1 (unshare_expr (addr), stmts,
  				 is_gimple_mem_ref_addr, NULL_TREE);
    tree alias_ptr = fold_convert (reference_alias_ptr_type (DR_REF (dr)), coff);
+   tree type = build_aligned_type (TREE_TYPE (DR_REF (dr)),
+ 				  get_object_alignment (DR_REF (dr)));
    /* While data-ref analysis punts on bit offsets it still handles
       bitfield accesses at byte boundaries.  Cope with that.  Note that
       we cannot simply re-apply the outer COMPONENT_REF because the
*************** ref_at_iteration (data_reference_p dr, i
*** 1435,1446 ****
      {
        tree field = TREE_OPERAND (DR_REF (dr), 1);
        return build3 (BIT_FIELD_REF, TREE_TYPE (DR_REF (dr)),
! 		     build2 (MEM_REF, DECL_BIT_FIELD_TYPE (field),
! 			     addr, alias_ptr),
  		     DECL_SIZE (field), bitsize_zero_node);
      }
    else
!     return fold_build2 (MEM_REF, TREE_TYPE (DR_REF (dr)), addr, alias_ptr);
  }
  
  /* Get the initialization expression for the INDEX-th temporary variable
--- 1438,1448 ----
      {
        tree field = TREE_OPERAND (DR_REF (dr), 1);
        return build3 (BIT_FIELD_REF, TREE_TYPE (DR_REF (dr)),
! 		     build2 (MEM_REF, type, addr, alias_ptr),
  		     DECL_SIZE (field), bitsize_zero_node);
      }
    else
!     return fold_build2 (MEM_REF, type, addr, alias_ptr);
  }
  
  /* Get the initialization expression for the INDEX-th temporary variable
diff -Nrcpad gcc-5.4.0/gcc/tree-profile.c gcc-5.5.0/gcc/tree-profile.c
*** gcc-5.4.0/gcc/tree-profile.c	Wed Jan 14 05:28:50 2015
--- gcc-5.5.0/gcc/tree-profile.c	Mon Jan 23 12:24:54 2017
*************** init_ic_make_global_vars (void)
*** 120,127 ****
    if (targetm.have_tls)
      set_decl_tls_model (ic_void_ptr_var, decl_default_tls_model (ic_void_ptr_var));
  
-   varpool_node::finalize_decl (ic_void_ptr_var);
- 
    gcov_type_ptr = build_pointer_type (get_gcov_type ());
  
    ic_gcov_type_ptr_var
--- 120,125 ----
*************** init_ic_make_global_vars (void)
*** 138,145 ****
    DECL_INITIAL (ic_gcov_type_ptr_var) = NULL;
    if (targetm.have_tls)
      set_decl_tls_model (ic_gcov_type_ptr_var, decl_default_tls_model (ic_gcov_type_ptr_var));
- 
-   varpool_node::finalize_decl (ic_gcov_type_ptr_var);
  }
  
  /* Create the type and function decls for the interface with gcov.  */
--- 136,141 ----
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-loop-im.c gcc-5.5.0/gcc/tree-ssa-loop-im.c
*** gcc-5.4.0/gcc/tree-ssa-loop-im.c	Mon Sep 21 09:55:57 2015
--- gcc-5.5.0/gcc/tree-ssa-loop-im.c	Tue Jan 24 08:06:29 2017
*************** along with GCC; see the file COPYING3.
*** 70,75 ****
--- 70,76 ----
  #include "tree-ssa-propagate.h"
  #include "trans-mem.h"
  #include "gimple-fold.h"
+ #include "tree-ssa-loop-niter.h"
  
  /* TODO:  Support for predicated code motion.  I.e.
  
*************** fill_always_executed_in_1 (struct loop *
*** 2406,2413 ****
  	    break;
  
  	  FOR_EACH_EDGE (e, ei, bb->succs)
! 	    if (!flow_bb_inside_loop_p (loop, e->dest))
! 	      break;
  	  if (e)
  	    break;
  
--- 2407,2422 ----
  	    break;
  
  	  FOR_EACH_EDGE (e, ei, bb->succs)
! 	    {
! 	      /* If there is an exit from this BB.  */
! 	      if (!flow_bb_inside_loop_p (loop, e->dest))
! 		break;
! 	      /* Or we enter a possibly non-finite loop.  */
! 	      if (flow_loop_nested_p (bb->loop_father,
! 				      e->dest->loop_father)
! 		  && ! finite_loop_p (e->dest->loop_father))
! 		break;
! 	    }
  	  if (e)
  	    break;
  
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-loop-ivopts.c gcc-5.5.0/gcc/tree-ssa-loop-ivopts.c
*** gcc-5.4.0/gcc/tree-ssa-loop-ivopts.c	Fri Feb 13 05:44:46 2015
--- gcc-5.5.0/gcc/tree-ssa-loop-ivopts.c	Wed May 10 07:53:45 2017
*************** get_computation_aff (struct loop *loop,
*** 3118,3124 ****
        var = fold_convert (uutype, var);
      }
  
!   if (!constant_multiple_of (ustep, cstep, &rat))
      return false;
  
    /* In case both UBASE and CBASE are shortened to UUTYPE from some common
--- 3118,3135 ----
        var = fold_convert (uutype, var);
      }
  
!   /* Ratio is 1 when computing the value of biv cand by itself.
!      We can't rely on constant_multiple_of in this case because the
!      use is created after the original biv is selected.  The call
!      could fail because of inconsistent fold behavior.  See PR68021
!      for more information.  */
!   if (cand->pos == IP_ORIGINAL && cand->incremented_at == use->stmt)
!     {
!       gcc_assert (is_gimple_assign (use->stmt));
!       gcc_assert (gimple_assign_lhs (use->stmt) == cand->var_after);
!       rat = 1;
!     }
!   else if (!constant_multiple_of (ustep, cstep, &rat))
      return false;
  
    /* In case both UBASE and CBASE are shortened to UUTYPE from some common
*************** rewrite_use_address (struct ivopts_data
*** 6617,6623 ****
      base_hint = var_at_stmt (data->current_loop, cand, use->stmt);
  
    iv = var_at_stmt (data->current_loop, cand, use->stmt);
!   ref = create_mem_ref (&bsi, TREE_TYPE (*use->op_p), &aff,
  			reference_alias_ptr_type (*use->op_p),
  			iv, base_hint, data->speed);
    copy_ref_info (ref, *use->op_p);
--- 6628,6638 ----
      base_hint = var_at_stmt (data->current_loop, cand, use->stmt);
  
    iv = var_at_stmt (data->current_loop, cand, use->stmt);
!   tree type = TREE_TYPE (*use->op_p);
!   unsigned int align = get_object_alignment (*use->op_p);
!   if (align != TYPE_ALIGN (type))
!     type = build_aligned_type (type, align);
!   ref = create_mem_ref (&bsi, type, &aff,
  			reference_alias_ptr_type (*use->op_p),
  			iv, base_hint, data->speed);
    copy_ref_info (ref, *use->op_p);
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-loop-prefetch.c gcc-5.5.0/gcc/tree-ssa-loop-prefetch.c
*** gcc-5.4.0/gcc/tree-ssa-loop-prefetch.c	Thu Jan 15 13:28:42 2015
--- gcc-5.5.0/gcc/tree-ssa-loop-prefetch.c	Wed Mar 22 12:28:50 2017
*************** along with GCC; see the file COPYING3.
*** 65,70 ****
--- 65,71 ----
  #include "langhooks.h"
  #include "tree-inline.h"
  #include "tree-data-ref.h"
+ #include "diagnostic-core.h"
  
  
  /* FIXME: Needed for optabs, but this should all be moved to a TBD interface
*************** tree_ssa_prefetch_arrays (void)
*** 2005,2014 ****
        set_builtin_decl (BUILT_IN_PREFETCH, decl, false);
      }
  
-   /* We assume that size of cache line is a power of two, so verify this
-      here.  */
-   gcc_assert ((PREFETCH_BLOCK & (PREFETCH_BLOCK - 1)) == 0);
- 
    FOR_EACH_LOOP (loop, LI_FROM_INNERMOST)
      {
        if (dump_file && (dump_flags & TDF_DETAILS))
--- 2006,2011 ----
*************** pass_loop_prefetch::execute (function *f
*** 2066,2071 ****
--- 2063,2082 ----
    if (number_of_loops (fun) <= 1)
      return 0;
  
+   if ((PREFETCH_BLOCK & (PREFETCH_BLOCK - 1)) != 0)
+     {
+       static bool warned = false;
+ 
+       if (!warned)
+ 	{
+ 	  warning (OPT_Wdisabled_optimization,
+ 		   "%<l1-cache-size%> parameter is not a power of two %d",
+ 		   PREFETCH_BLOCK);
+ 	  warned = true;
+ 	}
+       return 0;
+     }
+ 
    return tree_ssa_prefetch_arrays ();
  }
  
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-math-opts.c gcc-5.5.0/gcc/tree-ssa-math-opts.c
*** gcc-5.4.0/gcc/tree-ssa-math-opts.c	Mon Apr  4 15:45:59 2016
--- gcc-5.5.0/gcc/tree-ssa-math-opts.c	Wed Dec 14 10:07:10 2016
*************** make_pass_cse_sincos (gcc::context *ctxt
*** 1619,1643 ****
    return new pass_cse_sincos (ctxt);
  }
  
! /* A symbolic number is used to detect byte permutation and selection
!    patterns.  Therefore the field N contains an artificial number
!    consisting of octet sized markers:
  
!    0    - target byte has the value 0
!    FF   - target byte has an unknown value (eg. due to sign extension)
!    1..size - marker value is the target byte index minus one.
  
     To detect permutations on memory sources (arrays and structures), a symbolic
!    number is also associated a base address (the array or structure the load is
!    made from), an offset from the base address and a range which gives the
!    difference between the highest and lowest accessed memory location to make
!    such a symbolic number. The range is thus different from size which reflects
!    the size of the type of current expression. Note that for non memory source,
!    range holds the same value as size.
  
!    For instance, for an array char a[], (short) a[0] | (short) a[3] would have
!    a size of 2 but a range of 4 while (short) a[0] | ((short) a[0] << 1) would
!    still have a size of 2 but this time a range of 1.  */
  
  struct symbolic_number {
    uint64_t n;
--- 1619,1650 ----
    return new pass_cse_sincos (ctxt);
  }
  
! /* A symbolic number structure is used to detect byte permutation and selection
!    patterns of a source.  To achieve that, its field N contains an artificial
!    number consisting of BITS_PER_MARKER sized markers tracking where does each
!    byte come from in the source:
  
!    0	   - target byte has the value 0
!    FF	   - target byte has an unknown value (eg. due to sign extension)
!    1..size - marker value is the byte index in the source (0 for lsb).
  
     To detect permutations on memory sources (arrays and structures), a symbolic
!    number is also associated:
!    - a base address BASE_ADDR and an OFFSET giving the address of the source;
!    - a range which gives the difference between the highest and lowest accessed
!      memory location to make such a symbolic number;
!    - the address SRC of the source element of lowest address as a convenience
!      to easily get BASE_ADDR + offset + lowest bytepos.
  
!    Note 1: the range is different from size as size reflects the size of the
!    type of the current expression.  For instance, for an array char a[],
!    (short) a[0] | (short) a[3] would have a size of 2 but a range of 4 while
!    (short) a[0] | ((short) a[0] << 1) would still have a size of 2 but this
!    time a range of 1.
! 
!    Note 2: for non-memory sources, range holds the same value as size.
! 
!    Note 3: SRC points to the SSA_NAME in case of non-memory source.  */
  
  struct symbolic_number {
    uint64_t n;
*************** struct symbolic_number {
*** 1645,1650 ****
--- 1652,1658 ----
    tree base_addr;
    tree offset;
    HOST_WIDE_INT bytepos;
+   tree src;
    tree alias_set;
    tree vuse;
    unsigned HOST_WIDE_INT range;
*************** init_symbolic_number (struct symbolic_nu
*** 1746,1751 ****
--- 1754,1760 ----
    int size;
  
    n->base_addr = n->offset = n->alias_set = n->vuse = NULL_TREE;
+   n->src = src;
  
    /* Set up the symbolic number N by setting each byte to a value between 1 and
       the byte size of rhs1.  The highest order byte is set to n->size and the
*************** perform_symbolic_merge (gimple source_st
*** 1859,1864 ****
--- 1868,1874 ----
        uint64_t inc;
        HOST_WIDE_INT start_sub, end_sub, end1, end2, end;
        struct symbolic_number *toinc_n_ptr, *n_end;
+       basic_block bb1, bb2;
  
        if (!n1->base_addr || !n2->base_addr
  	  || !operand_equal_p (n1->base_addr, n2->base_addr, 0))
*************** perform_symbolic_merge (gimple source_st
*** 1872,1886 ****
  	{
  	  n_start = n1;
  	  start_sub = n2->bytepos - n1->bytepos;
- 	  source_stmt = source_stmt1;
  	}
        else
  	{
  	  n_start = n2;
  	  start_sub = n1->bytepos - n2->bytepos;
- 	  source_stmt = source_stmt2;
  	}
  
        /* Find the highest address at which a load is performed and
  	 compute related info.  */
        end1 = n1->bytepos + (n1->range - 1);
--- 1882,1901 ----
  	{
  	  n_start = n1;
  	  start_sub = n2->bytepos - n1->bytepos;
  	}
        else
  	{
  	  n_start = n2;
  	  start_sub = n1->bytepos - n2->bytepos;
  	}
  
+       bb1 = gimple_bb (source_stmt1);
+       bb2 = gimple_bb (source_stmt2);
+       if (dominated_by_p (CDI_DOMINATORS, bb1, bb2))
+ 	source_stmt = source_stmt1;
+       else
+ 	source_stmt = source_stmt2;
+ 
        /* Find the highest address at which a load is performed and
  	 compute related info.  */
        end1 = n1->bytepos + (n1->range - 1);
*************** perform_symbolic_merge (gimple source_st
*** 1937,1942 ****
--- 1952,1958 ----
    n->vuse = n_start->vuse;
    n->base_addr = n_start->base_addr;
    n->offset = n_start->offset;
+   n->src = n_start->src;
    n->bytepos = n_start->bytepos;
    n->type = n_start->type;
    size = TYPE_PRECISION (n->type) / BITS_PER_UNIT;
*************** find_bswap_or_nop (gimple stmt, struct s
*** 2147,2153 ****
    uint64_t cmpxchg = CMPXCHG;
    uint64_t cmpnop = CMPNOP;
  
!   gimple source_stmt;
    int limit;
  
    /* The last parameter determines the depth search limit.  It usually
--- 2163,2169 ----
    uint64_t cmpxchg = CMPXCHG;
    uint64_t cmpnop = CMPNOP;
  
!   gimple ins_stmt;
    int limit;
  
    /* The last parameter determines the depth search limit.  It usually
*************** find_bswap_or_nop (gimple stmt, struct s
*** 2157,2165 ****
       in libgcc, and for initial shift/and operation of the src operand.  */
    limit = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (gimple_expr_type (stmt)));
    limit += 1 + (int) ceil_log2 ((unsigned HOST_WIDE_INT) limit);
!   source_stmt = find_bswap_or_nop_1 (stmt, n, limit);
  
!   if (!source_stmt)
      return NULL;
  
    /* Find real size of result (highest non-zero byte).  */
--- 2173,2181 ----
       in libgcc, and for initial shift/and operation of the src operand.  */
    limit = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (gimple_expr_type (stmt)));
    limit += 1 + (int) ceil_log2 ((unsigned HOST_WIDE_INT) limit);
!   ins_stmt = find_bswap_or_nop_1 (stmt, n, limit);
  
!   if (!ins_stmt)
      return NULL;
  
    /* Find real size of result (highest non-zero byte).  */
*************** find_bswap_or_nop (gimple stmt, struct s
*** 2201,2207 ****
      return NULL;
  
    n->range *= BITS_PER_UNIT;
!   return source_stmt;
  }
  
  namespace {
--- 2217,2223 ----
      return NULL;
  
    n->range *= BITS_PER_UNIT;
!   return ins_stmt;
  }
  
  namespace {
*************** public:
*** 2250,2256 ****
     changing of basic block.  */
  
  static bool
! bswap_replace (gimple cur_stmt, gimple src_stmt, tree fndecl, tree bswap_type,
  	       tree load_type, struct symbolic_number *n, bool bswap)
  {
    gimple_stmt_iterator gsi;
--- 2266,2272 ----
     changing of basic block.  */
  
  static bool
! bswap_replace (gimple cur_stmt, gimple ins_stmt, tree fndecl, tree bswap_type,
  	       tree load_type, struct symbolic_number *n, bool bswap)
  {
    gimple_stmt_iterator gsi;
*************** bswap_replace (gimple cur_stmt, gimple s
*** 2258,2275 ****
    gimple bswap_stmt;
  
    gsi = gsi_for_stmt (cur_stmt);
!   src = gimple_assign_rhs1 (src_stmt);
    tgt = gimple_assign_lhs (cur_stmt);
  
    /* Need to load the value from memory first.  */
    if (n->base_addr)
      {
!       gimple_stmt_iterator gsi_ins = gsi_for_stmt (src_stmt);
        tree addr_expr, addr_tmp, val_expr, val_tmp;
        tree load_offset_ptr, aligned_load_type;
        gimple addr_stmt, load_stmt;
        unsigned align;
        HOST_WIDE_INT load_offset = 0;
  
        align = get_object_alignment (src);
        /* If the new access is smaller than the original one, we need
--- 2274,2297 ----
    gimple bswap_stmt;
  
    gsi = gsi_for_stmt (cur_stmt);
!   src = n->src;
    tgt = gimple_assign_lhs (cur_stmt);
  
    /* Need to load the value from memory first.  */
    if (n->base_addr)
      {
!       gimple_stmt_iterator gsi_ins = gsi_for_stmt (ins_stmt);
        tree addr_expr, addr_tmp, val_expr, val_tmp;
        tree load_offset_ptr, aligned_load_type;
        gimple addr_stmt, load_stmt;
        unsigned align;
        HOST_WIDE_INT load_offset = 0;
+       basic_block ins_bb, cur_bb;
+ 
+       ins_bb = gimple_bb (ins_stmt);
+       cur_bb = gimple_bb (cur_stmt);
+       if (!dominated_by_p (CDI_DOMINATORS, cur_bb, ins_bb))
+ 	return false;
  
        align = get_object_alignment (src);
        /* If the new access is smaller than the original one, we need
*************** bswap_replace (gimple cur_stmt, gimple s
*** 2301,2307 ****
        /* Move cur_stmt just before  one of the load of the original
  	 to ensure it has the same VUSE.  See PR61517 for what could
  	 go wrong.  */
!       if (gimple_bb (cur_stmt) != gimple_bb (src_stmt))
  	reset_flow_sensitive_info (gimple_assign_lhs (cur_stmt));
        gsi_move_before (&gsi, &gsi_ins);
        gsi = gsi_for_stmt (cur_stmt);
--- 2323,2329 ----
        /* Move cur_stmt just before  one of the load of the original
  	 to ensure it has the same VUSE.  See PR61517 for what could
  	 go wrong.  */
!       if (gimple_bb (cur_stmt) != gimple_bb (ins_stmt))
  	reset_flow_sensitive_info (gimple_assign_lhs (cur_stmt));
        gsi_move_before (&gsi, &gsi_ins);
        gsi = gsi_for_stmt (cur_stmt);
*************** pass_optimize_bswap::execute (function *
*** 2474,2479 ****
--- 2496,2502 ----
  
    memset (&nop_stats, 0, sizeof (nop_stats));
    memset (&bswap_stats, 0, sizeof (bswap_stats));
+   calculate_dominance_info (CDI_DOMINATORS);
  
    FOR_EACH_BB_FN (bb, fun)
      {
*************** pass_optimize_bswap::execute (function *
*** 2485,2491 ****
  	 variant wouldn't be detected.  */
        for (gsi = gsi_last_bb (bb); !gsi_end_p (gsi);)
          {
! 	  gimple src_stmt, cur_stmt = gsi_stmt (gsi);
  	  tree fndecl = NULL_TREE, bswap_type = NULL_TREE, load_type;
  	  enum tree_code code;
  	  struct symbolic_number n;
--- 2508,2514 ----
  	 variant wouldn't be detected.  */
        for (gsi = gsi_last_bb (bb); !gsi_end_p (gsi);)
          {
! 	  gimple ins_stmt, cur_stmt = gsi_stmt (gsi);
  	  tree fndecl = NULL_TREE, bswap_type = NULL_TREE, load_type;
  	  enum tree_code code;
  	  struct symbolic_number n;
*************** pass_optimize_bswap::execute (function *
*** 2518,2526 ****
  	      continue;
  	    }
  
! 	  src_stmt = find_bswap_or_nop (cur_stmt, &n, &bswap);
  
! 	  if (!src_stmt)
  	    continue;
  
  	  switch (n.range)
--- 2541,2549 ----
  	      continue;
  	    }
  
! 	  ins_stmt = find_bswap_or_nop (cur_stmt, &n, &bswap);
  
! 	  if (!ins_stmt)
  	    continue;
  
  	  switch (n.range)
*************** pass_optimize_bswap::execute (function *
*** 2554,2560 ****
  	  if (bswap && !fndecl && n.range != 16)
  	    continue;
  
! 	  if (bswap_replace (cur_stmt, src_stmt, fndecl, bswap_type, load_type,
  			     &n, bswap))
  	    changed = true;
  	}
--- 2577,2583 ----
  	  if (bswap && !fndecl && n.range != 16)
  	    continue;
  
! 	  if (bswap_replace (cur_stmt, ins_stmt, fndecl, bswap_type, load_type,
  			     &n, bswap))
  	    changed = true;
  	}
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-pre.c gcc-5.5.0/gcc/tree-ssa-pre.c
*** gcc-5.4.0/gcc/tree-ssa-pre.c	Fri May 20 08:51:06 2016
--- gcc-5.5.0/gcc/tree-ssa-pre.c	Thu Jan 26 08:16:37 2017
*************** prune_clobbered_mems (bitmap_set_t set,
*** 2077,2085 ****
--- 2077,2093 ----
  {
    bitmap_iterator bi;
    unsigned i;
+   pre_expr to_remove = NULL;
  
    FOR_EACH_EXPR_ID_IN_SET (set, i, bi)
      {
+       /* Remove queued expr.  */
+       if (to_remove)
+ 	{
+ 	  bitmap_remove_from_set (set, to_remove);
+ 	  to_remove = NULL;
+ 	}
+ 
        pre_expr expr = expression_for_id (i);
        if (expr->kind == REFERENCE)
  	{
*************** prune_clobbered_mems (bitmap_set_t set,
*** 2093,2099 ****
  					   block, gimple_bb (def_stmt)))
  		      || (gimple_bb (def_stmt) == block
  			  && value_dies_in_block_x (expr, block))))
! 		bitmap_remove_from_set (set, expr);
  	    }
  	}
        else if (expr->kind == NARY)
--- 2101,2107 ----
  					   block, gimple_bb (def_stmt)))
  		      || (gimple_bb (def_stmt) == block
  			  && value_dies_in_block_x (expr, block))))
! 		to_remove = expr;
  	    }
  	}
        else if (expr->kind == NARY)
*************** prune_clobbered_mems (bitmap_set_t set,
*** 2105,2113 ****
  	     as the available expression might be after the exit point.  */
  	  if (BB_MAY_NOTRETURN (block)
  	      && vn_nary_may_trap (nary))
! 	    bitmap_remove_from_set (set, expr);
  	}
      }
  }
  
  static sbitmap has_abnormal_preds;
--- 2113,2125 ----
  	     as the available expression might be after the exit point.  */
  	  if (BB_MAY_NOTRETURN (block)
  	      && vn_nary_may_trap (nary))
! 	    to_remove = expr;
  	}
      }
+ 
+   /* Remove queued expr.  */
+   if (to_remove)
+     bitmap_remove_from_set (set, to_remove);
  }
  
  static sbitmap has_abnormal_preds;
*************** eliminate_dom_walker::before_dom_childre
*** 4308,4333 ****
  	  && !is_gimple_reg (gimple_assign_lhs (stmt))
  	  && (TREE_CODE (gimple_assign_rhs1 (stmt)) == SSA_NAME
  	      || is_gimple_min_invariant (gimple_assign_rhs1 (stmt))))
!         {
!           tree val;
  	  tree rhs = gimple_assign_rhs1 (stmt);
!           val = vn_reference_lookup (gimple_assign_lhs (stmt),
!                                      gimple_vuse (stmt), VN_WALK, NULL, false);
!           if (TREE_CODE (rhs) == SSA_NAME)
!             rhs = VN_INFO (rhs)->valnum;
!           if (val
!               && operand_equal_p (val, rhs, 0))
!             {
!               if (dump_file && (dump_flags & TDF_DETAILS))
!                 {
!                   fprintf (dump_file, "Deleted redundant store ");
!                   print_gimple_stmt (dump_file, stmt, 0, 0);
!                 }
  
!               /* Queue stmt for removal.  */
!               el_to_remove.safe_push (stmt);
! 	      continue;
!             }
          }
  
        bool can_make_abnormal_goto = stmt_can_make_abnormal_goto (stmt);
--- 4320,4355 ----
  	  && !is_gimple_reg (gimple_assign_lhs (stmt))
  	  && (TREE_CODE (gimple_assign_rhs1 (stmt)) == SSA_NAME
  	      || is_gimple_min_invariant (gimple_assign_rhs1 (stmt))))
! 	{
! 	  tree val;
  	  tree rhs = gimple_assign_rhs1 (stmt);
! 	  vn_reference_t vnresult;
! 	  val = vn_reference_lookup (lhs, gimple_vuse (stmt), VN_WALK,
! 				     &vnresult, false);
! 	  if (TREE_CODE (rhs) == SSA_NAME)
! 	    rhs = VN_INFO (rhs)->valnum;
! 	  if (val
! 	      && operand_equal_p (val, rhs, 0))
! 	    {
! 	      /* We can only remove the later store if the former aliases
! 		 at least all accesses the later one does or if the store
! 		 was to readonly memory storing the same value.  */
! 	      alias_set_type set = get_alias_set (lhs);
! 	      if (! vnresult
! 		  || vnresult->set == set
! 		  || alias_set_subset_of (set, vnresult->set))
! 		{
! 		  if (dump_file && (dump_flags & TDF_DETAILS))
! 		    {
! 		      fprintf (dump_file, "Deleted redundant store ");
! 		      print_gimple_stmt (dump_file, stmt, 0, 0);
! 		    }
  
! 		  /* Queue stmt for removal.  */
! 		  el_to_remove.safe_push (stmt);
! 		  continue;
! 		}
! 	    }
          }
  
        bool can_make_abnormal_goto = stmt_can_make_abnormal_goto (stmt);
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-reassoc.c gcc-5.5.0/gcc/tree-ssa-reassoc.c
*** gcc-5.4.0/gcc/tree-ssa-reassoc.c	Wed Mar 30 12:30:40 2016
--- gcc-5.5.0/gcc/tree-ssa-reassoc.c	Thu Jul 27 09:43:01 2017
*************** is_reassociable_op (gimple stmt, enum tr
*** 663,669 ****
    if (is_gimple_assign (stmt)
        && gimple_assign_rhs_code (stmt) == code
        && has_single_use (gimple_assign_lhs (stmt)))
!     return true;
  
    return false;
  }
--- 663,680 ----
    if (is_gimple_assign (stmt)
        && gimple_assign_rhs_code (stmt) == code
        && has_single_use (gimple_assign_lhs (stmt)))
!     {
!       tree rhs1 = gimple_assign_rhs1 (stmt);
!       tree rhs2 = gimple_assign_rhs1 (stmt);
!       if (TREE_CODE (rhs1) == SSA_NAME
! 	  && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (rhs1))
! 	return false;
!       if (rhs2
! 	  && TREE_CODE (rhs2) == SSA_NAME
! 	  && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (rhs2))
! 	return false;
!       return true;
!     }
  
    return false;
  }
*************** find_insert_point (gimple stmt, tree rhs
*** 3566,3576 ****
  
  /* Recursively rewrite our linearized statements so that the operators
     match those in OPS[OPINDEX], putting the computation in rank
!    order.  Return new lhs.  */
  
  static tree
  rewrite_expr_tree (gimple stmt, unsigned int opindex,
! 		   vec<operand_entry_t> ops, bool changed)
  {
    tree rhs1 = gimple_assign_rhs1 (stmt);
    tree rhs2 = gimple_assign_rhs2 (stmt);
--- 3577,3591 ----
  
  /* Recursively rewrite our linearized statements so that the operators
     match those in OPS[OPINDEX], putting the computation in rank
!    order.  Return new lhs.
!    CHANGED is true if we shouldn't reuse the lhs SSA_NAME both in
!    the current stmt and during recursive invocations.
!    NEXT_CHANGED is true if we shouldn't reuse the lhs SSA_NAME in
!    recursive invocations.  */
  
  static tree
  rewrite_expr_tree (gimple stmt, unsigned int opindex,
! 		   vec<operand_entry_t> ops, bool changed, bool next_changed)
  {
    tree rhs1 = gimple_assign_rhs1 (stmt);
    tree rhs2 = gimple_assign_rhs2 (stmt);
*************** rewrite_expr_tree (gimple stmt, unsigned
*** 3649,3655 ****
       be the non-leaf side.  */
    tree new_rhs1
      = rewrite_expr_tree (SSA_NAME_DEF_STMT (rhs1), opindex + 1, ops,
! 			 changed || oe->op != rhs2);
  
    if (oe->op != rhs2 || new_rhs1 != rhs1)
      {
--- 3664,3671 ----
       be the non-leaf side.  */
    tree new_rhs1
      = rewrite_expr_tree (SSA_NAME_DEF_STMT (rhs1), opindex + 1, ops,
! 			 changed || oe->op != rhs2 || next_changed,
! 			 false);
  
    if (oe->op != rhs2 || new_rhs1 != rhs1)
      {
*************** static bool
*** 4342,4347 ****
--- 4358,4365 ----
  can_reassociate_p (tree op)
  {
    tree type = TREE_TYPE (op);
+   if (TREE_CODE (op) == SSA_NAME && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (op))
+     return false;
    if ((INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type))
        || NON_SAT_FIXED_POINT_TYPE_P (type)
        || (flag_associative_math && FLOAT_TYPE_P (type)))
*************** reassociate_bb (basic_block bb)
*** 4882,4887 ****
--- 4900,4906 ----
  	      gimple_set_visited (stmt, true);
  	      linearize_expr_tree (&ops, stmt, true, true);
  	      ops.qsort (sort_by_operand_rank);
+ 	      int orig_len = ops.length ();
  	      optimize_ops_list (rhs_code, &ops);
  	      if (undistribute_ops_list (rhs_code, &ops,
  					 loop_containing_stmt (stmt)))
*************** reassociate_bb (basic_block bb)
*** 4937,4943 ****
                          swap_ops_for_binary_stmt (ops, len - 3, stmt);
  
  		      new_lhs = rewrite_expr_tree (stmt, 0, ops,
! 						   powi_result != NULL);
                      }
  
  		  /* If we combined some repeated factors into a 
--- 4956,4963 ----
                          swap_ops_for_binary_stmt (ops, len - 3, stmt);
  
  		      new_lhs = rewrite_expr_tree (stmt, 0, ops,
! 						   powi_result != NULL,
! 						   len != orig_len);
                      }
  
  		  /* If we combined some repeated factors into a 
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-sccvn.c gcc-5.5.0/gcc/tree-ssa-sccvn.c
*** gcc-5.4.0/gcc/tree-ssa-sccvn.c	Thu Feb 25 09:07:08 2016
--- gcc-5.5.0/gcc/tree-ssa-sccvn.c	Thu Jan 26 08:16:37 2017
*************** visit_reference_op_call (tree lhs, gcall
*** 2980,2985 ****
--- 2980,2989 ----
      {
        if (vnresult->result_vdef && vdef)
  	changed |= set_ssa_val_to (vdef, vnresult->result_vdef);
+       else if (vdef)
+ 	/* If the call was discovered to be pure or const reflect
+ 	   that as far as possible.  */
+ 	changed |= set_ssa_val_to (vdef, vuse_ssa_val (gimple_vuse (stmt)));
  
        if (!vnresult->result && lhs)
  	vnresult->result = lhs;
*************** visit_reference_op_store (tree lhs, tree
*** 3128,3134 ****
  {
    bool changed = false;
    vn_reference_t vnresult = NULL;
!   tree result, assign;
    bool resultsame = false;
    tree vuse = gimple_vuse (stmt);
    tree vdef = gimple_vdef (stmt);
--- 3132,3138 ----
  {
    bool changed = false;
    vn_reference_t vnresult = NULL;
!   tree assign;
    bool resultsame = false;
    tree vuse = gimple_vuse (stmt);
    tree vdef = gimple_vdef (stmt);
*************** visit_reference_op_store (tree lhs, tree
*** 3152,3182 ****
       Otherwise, the vdefs for the store are used when inserting into
       the table, since the store generates a new memory state.  */
  
!   result = vn_reference_lookup (lhs, vuse, VN_NOWALK, NULL, false);
! 
!   if (result)
      {
        if (TREE_CODE (result) == SSA_NAME)
  	result = SSA_VAL (result);
        resultsame = expressions_equal_p (result, op);
      }
  
!   if ((!result || !resultsame)
        /* Only perform the following when being called from PRE
  	 which embeds tail merging.  */
!       && default_vn_walk_kind == VN_WALK)
!     {
!       assign = build2 (MODIFY_EXPR, TREE_TYPE (lhs), lhs, op);
!       vn_reference_lookup (assign, vuse, VN_NOWALK, &vnresult, false);
!       if (vnresult)
  	{
! 	  VN_INFO (vdef)->use_processed = true;
! 	  return set_ssa_val_to (vdef, vnresult->result_vdef);
  	}
-     }
  
-   if (!result || !resultsame)
-     {
        if (dump_file && (dump_flags & TDF_DETAILS))
  	{
  	  fprintf (dump_file, "No store match\n");
--- 3156,3195 ----
       Otherwise, the vdefs for the store are used when inserting into
       the table, since the store generates a new memory state.  */
  
!   vn_reference_lookup (lhs, vuse, VN_NOWALK, &vnresult, false);
!   if (vnresult
!       && vnresult->result)
      {
+       tree result = vnresult->result;
        if (TREE_CODE (result) == SSA_NAME)
  	result = SSA_VAL (result);
        resultsame = expressions_equal_p (result, op);
+       if (resultsame)
+ 	{
+ 	  /* If the TBAA state isn't compatible for downstream reads
+ 	     we cannot value-number the VDEFs the same.  */
+ 	  alias_set_type set = get_alias_set (lhs);
+ 	  if (vnresult->set != set
+ 	      && ! alias_set_subset_of (set, vnresult->set))
+ 	    resultsame = false;
+ 	}
      }
  
!   if (!resultsame)
!     {
        /* Only perform the following when being called from PRE
  	 which embeds tail merging.  */
!       if (default_vn_walk_kind == VN_WALK)
  	{
! 	  assign = build2 (MODIFY_EXPR, TREE_TYPE (lhs), lhs, op);
! 	  vn_reference_lookup (assign, vuse, VN_NOWALK, &vnresult, false);
! 	  if (vnresult)
! 	    {
! 	      VN_INFO (vdef)->use_processed = true;
! 	      return set_ssa_val_to (vdef, vnresult->result_vdef);
! 	    }
  	}
  
        if (dump_file && (dump_flags & TDF_DETAILS))
  	{
  	  fprintf (dump_file, "No store match\n");
*************** visit_reference_op_store (tree lhs, tree
*** 3189,3197 ****
        /* Have to set value numbers before insert, since insert is
  	 going to valueize the references in-place.  */
        if (vdef)
! 	{
! 	  changed |= set_ssa_val_to (vdef, vdef);
! 	}
  
        /* Do not insert structure copies into the tables.  */
        if (is_gimple_min_invariant (op)
--- 3202,3208 ----
        /* Have to set value numbers before insert, since insert is
  	 going to valueize the references in-place.  */
        if (vdef)
! 	changed |= set_ssa_val_to (vdef, vdef);
  
        /* Do not insert structure copies into the tables.  */
        if (is_gimple_min_invariant (op)
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-strlen.c gcc-5.5.0/gcc/tree-ssa-strlen.c
*** gcc-5.4.0/gcc/tree-ssa-strlen.c	Thu Jan 15 13:28:42 2015
--- gcc-5.5.0/gcc/tree-ssa-strlen.c	Tue Jan  3 12:08:10 2017
*************** find_equal_ptrs (tree ptr, int idx)
*** 916,921 ****
--- 916,980 ----
      }
  }
  
+ /* Return true if STMT is a call to a builtin function with the right
+    arguments and attributes that should be considered for optimization
+    by this pass.  */
+ 
+ static bool
+ valid_builtin_call (gimple stmt)
+ {
+   if (!gimple_call_builtin_p (stmt, BUILT_IN_NORMAL))
+     return false;
+ 
+   tree callee = gimple_call_fndecl (stmt);
+   switch (DECL_FUNCTION_CODE (callee))
+     {
+     case BUILT_IN_MEMCMP:
+     case BUILT_IN_STRCHR:
+     case BUILT_IN_STRCHR_CHKP:
+     case BUILT_IN_STRLEN:
+     case BUILT_IN_STRLEN_CHKP:
+       /* The above functions should be pure.  Punt if they aren't.  */
+       if (gimple_vdef (stmt) || gimple_vuse (stmt) == NULL_TREE)
+ 	return false;
+       break;
+ 
+     case BUILT_IN_CALLOC:
+     case BUILT_IN_MALLOC:
+     case BUILT_IN_MEMCPY:
+     case BUILT_IN_MEMCPY_CHK:
+     case BUILT_IN_MEMCPY_CHKP:
+     case BUILT_IN_MEMCPY_CHK_CHKP:
+     case BUILT_IN_MEMPCPY:
+     case BUILT_IN_MEMPCPY_CHK:
+     case BUILT_IN_MEMPCPY_CHKP:
+     case BUILT_IN_MEMPCPY_CHK_CHKP:
+     case BUILT_IN_MEMSET:
+     case BUILT_IN_STPCPY:
+     case BUILT_IN_STPCPY_CHK:
+     case BUILT_IN_STPCPY_CHKP:
+     case BUILT_IN_STPCPY_CHK_CHKP:
+     case BUILT_IN_STRCAT:
+     case BUILT_IN_STRCAT_CHK:
+     case BUILT_IN_STRCAT_CHKP:
+     case BUILT_IN_STRCAT_CHK_CHKP:
+     case BUILT_IN_STRCPY:
+     case BUILT_IN_STRCPY_CHK:
+     case BUILT_IN_STRCPY_CHKP:
+     case BUILT_IN_STRCPY_CHK_CHKP:
+       /* The above functions should be neither const nor pure.  Punt if they
+ 	 aren't.  */
+       if (gimple_vdef (stmt) == NULL_TREE || gimple_vuse (stmt) == NULL_TREE)
+ 	return false;
+       break;
+ 
+     default:
+       break;
+     }
+ 
+   return true;
+ }
+ 
  /* If the last .MEM setter statement before STMT is
     memcpy (x, y, strlen (y) + 1), the only .MEM use of it is STMT
     and STMT is known to overwrite x[strlen (x)], adjust the last memcpy to
*************** adjust_last_stmt (strinfo si, gimple stm
*** 991,997 ****
        return;
      }
  
!   if (!gimple_call_builtin_p (last.stmt, BUILT_IN_NORMAL))
      return;
  
    callee = gimple_call_fndecl (last.stmt);
--- 1050,1056 ----
        return;
      }
  
!   if (!valid_builtin_call (last.stmt))
      return;
  
    callee = gimple_call_fndecl (last.stmt);
*************** handle_builtin_malloc (enum built_in_fun
*** 1832,1837 ****
--- 1891,1899 ----
  {
    gimple stmt = gsi_stmt (*gsi);
    tree lhs = gimple_call_lhs (stmt);
+   if (lhs == NULL_TREE)
+     return;
+ 
    gcc_assert (get_stridx (lhs) == 0);
    int idx = new_stridx (lhs);
    tree length = NULL_TREE;
*************** handle_builtin_memset (gimple_stmt_itera
*** 1867,1873 ****
    if (!stmt1 || !is_gimple_call (stmt1))
      return true;
    tree callee1 = gimple_call_fndecl (stmt1);
!   if (!gimple_call_builtin_p (stmt1, BUILT_IN_NORMAL))
      return true;
    enum built_in_function code1 = DECL_FUNCTION_CODE (callee1);
    tree size = gimple_call_arg (stmt2, 2);
--- 1929,1935 ----
    if (!stmt1 || !is_gimple_call (stmt1))
      return true;
    tree callee1 = gimple_call_fndecl (stmt1);
!   if (!valid_builtin_call (stmt1))
      return true;
    enum built_in_function code1 = DECL_FUNCTION_CODE (callee1);
    tree size = gimple_call_arg (stmt2, 2);
*************** strlen_optimize_stmt (gimple_stmt_iterat
*** 2112,2118 ****
    if (is_gimple_call (stmt))
      {
        tree callee = gimple_call_fndecl (stmt);
!       if (gimple_call_builtin_p (stmt, BUILT_IN_NORMAL))
  	switch (DECL_FUNCTION_CODE (callee))
  	  {
  	  case BUILT_IN_STRLEN:
--- 2174,2180 ----
    if (is_gimple_call (stmt))
      {
        tree callee = gimple_call_fndecl (stmt);
!       if (valid_builtin_call (stmt))
  	switch (DECL_FUNCTION_CODE (callee))
  	  {
  	  case BUILT_IN_STRLEN:
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-structalias.c gcc-5.5.0/gcc/tree-ssa-structalias.c
*** gcc-5.4.0/gcc/tree-ssa-structalias.c	Thu Sep  3 09:25:35 2015
--- gcc-5.5.0/gcc/tree-ssa-structalias.c	Tue Aug 22 10:32:36 2017
*************** alias_get_name (tree decl)
*** 2864,2870 ****
  {
    const char *res = NULL;
    char *temp;
-   int num_printed = 0;
  
    if (!dump_file)
      return "NULL";
--- 2864,2869 ----
*************** alias_get_name (tree decl)
*** 2873,2886 ****
      {
        res = get_name (decl);
        if (res)
! 	num_printed = asprintf (&temp, "%s_%u", res, SSA_NAME_VERSION (decl));
        else
! 	num_printed = asprintf (&temp, "_%u", SSA_NAME_VERSION (decl));
!       if (num_printed > 0)
! 	{
! 	  res = ggc_strdup (temp);
! 	  free (temp);
! 	}
      }
    else if (DECL_P (decl))
      {
--- 2872,2882 ----
      {
        res = get_name (decl);
        if (res)
! 	temp = xasprintf ("%s_%u", res, SSA_NAME_VERSION (decl));
        else
! 	temp = xasprintf ("_%u", SSA_NAME_VERSION (decl));
!       res = ggc_strdup (temp);
!       free (temp);
      }
    else if (DECL_P (decl))
      {
*************** alias_get_name (tree decl)
*** 2891,2902 ****
  	  res = get_name (decl);
  	  if (!res)
  	    {
! 	      num_printed = asprintf (&temp, "D.%u", DECL_UID (decl));
! 	      if (num_printed > 0)
! 		{
! 		  res = ggc_strdup (temp);
! 		  free (temp);
! 		}
  	    }
  	}
      }
--- 2887,2895 ----
  	  res = get_name (decl);
  	  if (!res)
  	    {
! 	      temp = xasprintf ("D.%u", DECL_UID (decl));
! 	      res = ggc_strdup (temp);
! 	      free (temp);
  	    }
  	}
      }
*************** process_constraint (constraint_t t)
*** 3037,3043 ****
        process_constraint (new_constraint (tmplhs, rhs));
        process_constraint (new_constraint (lhs, tmplhs));
      }
!   else if (rhs.type == ADDRESSOF && lhs.type == DEREF)
      {
        /* Split into tmp = &rhs, *lhs = tmp */
        struct constraint_expr tmplhs;
--- 3030,3036 ----
        process_constraint (new_constraint (tmplhs, rhs));
        process_constraint (new_constraint (lhs, tmplhs));
      }
!   else if ((rhs.type != SCALAR || rhs.offset != 0) && lhs.type == DEREF)
      {
        /* Split into tmp = &rhs, *lhs = tmp */
        struct constraint_expr tmplhs;
*************** make_transitive_closure_constraints (var
*** 3756,3762 ****
  {
    struct constraint_expr lhs, rhs;
  
!   /* VAR = *VAR;  */
    lhs.type = SCALAR;
    lhs.var = vi->id;
    lhs.offset = 0;
--- 3749,3755 ----
  {
    struct constraint_expr lhs, rhs;
  
!   /* VAR = *(VAR + UNKNOWN);  */
    lhs.type = SCALAR;
    lhs.var = vi->id;
    lhs.offset = 0;
*************** make_transitive_closure_constraints (var
*** 3766,3771 ****
--- 3759,3781 ----
    process_constraint (new_constraint (lhs, rhs));
  }
  
+ /* Add constraints to that the solution of VI has all subvariables added.  */
+ 
+ static void
+ make_any_offset_constraints (varinfo_t vi)
+ {
+   struct constraint_expr lhs, rhs;
+ 
+   /* VAR = VAR + UNKNOWN;  */
+   lhs.type = SCALAR;
+   lhs.var = vi->id;
+   lhs.offset = 0;
+   rhs.type = SCALAR;
+   rhs.var = vi->id;
+   rhs.offset = UNKNOWN_OFFSET;
+   process_constraint (new_constraint (lhs, rhs));
+ }
+ 
  /* Temporary storage for fake var decls.  */
  struct obstack fake_var_decl_obstack;
  
*************** handle_rhs_call (gcall *stmt, vec<ce_s>
*** 3910,3924 ****
  	   && (flags & EAF_NOESCAPE))
  	{
  	  varinfo_t uses = get_call_use_vi (stmt);
  	  if (!(flags & EAF_DIRECT))
! 	    {
! 	      varinfo_t tem = new_var_info (NULL_TREE, "callarg");
! 	      make_constraint_to (tem->id, arg);
! 	      make_transitive_closure_constraints (tem);
! 	      make_copy_constraint (uses, tem->id);
! 	    }
! 	  else
! 	    make_constraint_to (uses->id, arg);
  	  returns_uses = true;
  	}
        else if (flags & EAF_NOESCAPE)
--- 3920,3931 ----
  	   && (flags & EAF_NOESCAPE))
  	{
  	  varinfo_t uses = get_call_use_vi (stmt);
+ 	  varinfo_t tem = new_var_info (NULL_TREE, "callarg");
+ 	  make_constraint_to (tem->id, arg);
+ 	  make_any_offset_constraints (tem);
  	  if (!(flags & EAF_DIRECT))
! 	    make_transitive_closure_constraints (tem);
! 	  make_copy_constraint (uses, tem->id);
  	  returns_uses = true;
  	}
        else if (flags & EAF_NOESCAPE)
*************** handle_rhs_call (gcall *stmt, vec<ce_s>
*** 3928,3933 ****
--- 3935,3941 ----
  	  varinfo_t clobbers = get_call_clobber_vi (stmt);
  	  varinfo_t tem = new_var_info (NULL_TREE, "callarg");
  	  make_constraint_to (tem->id, arg);
+ 	  make_any_offset_constraints (tem);
  	  if (!(flags & EAF_DIRECT))
  	    make_transitive_closure_constraints (tem);
  	  make_copy_constraint (uses, tem->id);
*************** handle_rhs_call (gcall *stmt, vec<ce_s>
*** 3953,3959 ****
    if (returns_uses)
      {
        rhsc.var = get_call_use_vi (stmt)->id;
!       rhsc.offset = 0;
        rhsc.type = SCALAR;
        results->safe_push (rhsc);
      }
--- 3961,3967 ----
    if (returns_uses)
      {
        rhsc.var = get_call_use_vi (stmt)->id;
!       rhsc.offset = UNKNOWN_OFFSET;
        rhsc.type = SCALAR;
        results->safe_push (rhsc);
      }
*************** handle_const_call (gcall *stmt, vec<ce_s
*** 4056,4085 ****
  {
    struct constraint_expr rhsc;
    unsigned int k;
  
    /* Treat nested const functions the same as pure functions as far
       as the static chain is concerned.  */
    if (gimple_call_chain (stmt))
      {
        varinfo_t uses = get_call_use_vi (stmt);
-       make_transitive_closure_constraints (uses);
        make_constraint_to (uses->id, gimple_call_chain (stmt));
        rhsc.var = uses->id;
        rhsc.offset = 0;
        rhsc.type = SCALAR;
        results->safe_push (rhsc);
      }
  
!   /* May return arguments.  */
    for (k = 0; k < gimple_call_num_args (stmt); ++k)
      {
        tree arg = gimple_call_arg (stmt, k);
        auto_vec<ce_s> argc;
-       unsigned i;
-       struct constraint_expr *argp;
        get_constraint_for_rhs (arg, &argc);
!       FOR_EACH_VEC_ELT (argc, i, argp)
! 	results->safe_push (*argp);
      }
  
    /* May return addresses of globals.  */
--- 4064,4121 ----
  {
    struct constraint_expr rhsc;
    unsigned int k;
+   bool need_uses = false;
  
    /* Treat nested const functions the same as pure functions as far
       as the static chain is concerned.  */
    if (gimple_call_chain (stmt))
      {
        varinfo_t uses = get_call_use_vi (stmt);
        make_constraint_to (uses->id, gimple_call_chain (stmt));
+       need_uses = true;
+     }
+ 
+   /* And if we applied NRV the address of the return slot escapes as well.  */
+   if (gimple_call_return_slot_opt_p (stmt)
+       && gimple_call_lhs (stmt) != NULL_TREE
+       && TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt))))
+     {
+       varinfo_t uses = get_call_use_vi (stmt);
+       auto_vec<ce_s> tmpc;
+       get_constraint_for_address_of (gimple_call_lhs (stmt), &tmpc);
+       make_constraints_to (uses->id, tmpc);
+       need_uses = true;
+     }
+ 
+   if (need_uses)
+     {
+       varinfo_t uses = get_call_use_vi (stmt);
+       make_any_offset_constraints (uses);
+       make_transitive_closure_constraints (uses);
        rhsc.var = uses->id;
        rhsc.offset = 0;
        rhsc.type = SCALAR;
        results->safe_push (rhsc);
      }
  
!   /* May return offsetted arguments.  */
!   varinfo_t tem = NULL;
!   if (gimple_call_num_args (stmt) != 0)
!     tem = new_var_info (NULL_TREE, "callarg");
    for (k = 0; k < gimple_call_num_args (stmt); ++k)
      {
        tree arg = gimple_call_arg (stmt, k);
        auto_vec<ce_s> argc;
        get_constraint_for_rhs (arg, &argc);
!       make_constraints_to (tem->id, argc);
!     }
!   if (tem)
!     {
!       ce_s ce;
!       ce.type = SCALAR;
!       ce.var = tem->id;
!       ce.offset = UNKNOWN_OFFSET;
!       results->safe_push (ce);
      }
  
    /* May return addresses of globals.  */
*************** handle_pure_call (gcall *stmt, vec<ce_s>
*** 4106,4111 ****
--- 4142,4148 ----
        if (!uses)
  	{
  	  uses = get_call_use_vi (stmt);
+ 	  make_any_offset_constraints (uses);
  	  make_transitive_closure_constraints (uses);
  	}
        make_constraint_to (uses->id, arg);
*************** handle_pure_call (gcall *stmt, vec<ce_s>
*** 4117,4127 ****
--- 4154,4181 ----
        if (!uses)
  	{
  	  uses = get_call_use_vi (stmt);
+ 	  make_any_offset_constraints (uses);
  	  make_transitive_closure_constraints (uses);
  	}
        make_constraint_to (uses->id, gimple_call_chain (stmt));
      }
  
+   /* And if we applied NRV the address of the return slot.  */
+   if (gimple_call_return_slot_opt_p (stmt)
+       && gimple_call_lhs (stmt) != NULL_TREE
+       && TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt))))
+     {
+       if (!uses)
+ 	{
+ 	  uses = get_call_use_vi (stmt);
+ 	  make_any_offset_constraints (uses);
+ 	  make_transitive_closure_constraints (uses);
+ 	}
+       auto_vec<ce_s> tmpc;
+       get_constraint_for_address_of (gimple_call_lhs (stmt), &tmpc);
+       make_constraints_to (uses->id, tmpc);
+     }
+ 
    /* Pure functions may return call-used and nonlocal memory.  */
    if (uses)
      {
*************** push_fields_onto_fieldstack (tree type,
*** 5371,5377 ****
  	    if (!pair
  		&& offset + foff != 0)
  	      {
! 		fieldoff_s e = {0, offset + foff, false, false, false, false};
  		pair = fieldstack->safe_push (e);
  	      }
  
--- 5425,5431 ----
  	    if (!pair
  		&& offset + foff != 0)
  	      {
! 		fieldoff_s e = {0, offset + foff, false, false, true, false};
  		pair = fieldstack->safe_push (e);
  	      }
  
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-tail-merge.c gcc-5.5.0/gcc/tree-ssa-tail-merge.c
*** gcc-5.4.0/gcc/tree-ssa-tail-merge.c	Wed Sep 30 11:45:40 2015
--- gcc-5.5.0/gcc/tree-ssa-tail-merge.c	Mon Jul  3 08:43:40 2017
*************** along with GCC; see the file COPYING3.
*** 237,242 ****
--- 237,243 ----
  #include "trans-mem.h"
  #include "stringpool.h"
  #include "tree-ssanames.h"
+ #include "tree-eh.h"
  
  /* Describes a group of bbs with the same successors.  The successor bbs are
     cached in succs, and the successor edge flags are cached in succ_flags.
*************** static void
*** 843,848 ****
--- 844,852 ----
  same_succ_flush_bb (basic_block bb)
  {
    same_succ same = BB_SAME_SUCC (bb);
+   if (! same)
+     return;
+ 
    BB_SAME_SUCC (bb) = NULL;
    if (bitmap_single_bit_set_p (same->bbs))
      same_succ_htab->remove_elt_with_hash (same, same->hashval);
*************** find_duplicate (same_succ same_succ, bas
*** 1273,1278 ****
--- 1277,1287 ----
  	  || is_tm_ending (stmt2))
  	return;
  
+       /* Verify EH landing pads.  */
+       if (lookup_stmt_eh_lp_fn (cfun, stmt1)
+ 	  != lookup_stmt_eh_lp_fn (cfun, stmt2))
+ 	return;
+ 
        if (!gimple_equal_p (same_succ, stmt1, stmt2))
  	return;
  
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-threadedge.c gcc-5.5.0/gcc/tree-ssa-threadedge.c
*** gcc-5.4.0/gcc/tree-ssa-threadedge.c	Sat Apr 11 17:32:54 2015
--- gcc-5.5.0/gcc/tree-ssa-threadedge.c	Wed Dec 14 10:31:37 2016
*************** simplify_control_stmt_condition (edge e,
*** 574,580 ****
  				 gimple stmt,
  				 gcond *dummy_cond,
  				 tree (*simplify) (gimple, gimple),
! 				 bool handle_dominating_asserts)
  {
    tree cond, cached_lhs;
    enum gimple_code code = gimple_code (stmt);
--- 574,581 ----
  				 gimple stmt,
  				 gcond *dummy_cond,
  				 tree (*simplify) (gimple, gimple),
! 				 bool handle_dominating_asserts,
! 				 bool backedge_seen)
  {
    tree cond, cached_lhs;
    enum gimple_code code = gimple_code (stmt);
*************** simplify_control_stmt_condition (edge e,
*** 593,599 ****
        /* Get the current value of both operands.  */
        if (TREE_CODE (op0) == SSA_NAME)
  	{
! 	  for (int i = 0; i < 2; i++)
  	    {
  	      if (TREE_CODE (op0) == SSA_NAME
  		  && SSA_NAME_VALUE (op0))
--- 594,600 ----
        /* Get the current value of both operands.  */
        if (TREE_CODE (op0) == SSA_NAME)
  	{
! 	  for (int i = 0; i < (backedge_seen ? 1 : 2); i++)
  	    {
  	      if (TREE_CODE (op0) == SSA_NAME
  		  && SSA_NAME_VALUE (op0))
*************** simplify_control_stmt_condition (edge e,
*** 605,611 ****
  
        if (TREE_CODE (op1) == SSA_NAME)
  	{
! 	  for (int i = 0; i < 2; i++)
  	    {
  	      if (TREE_CODE (op1) == SSA_NAME
  		  && SSA_NAME_VALUE (op1))
--- 606,612 ----
  
        if (TREE_CODE (op1) == SSA_NAME)
  	{
! 	  for (int i = 0; i < (backedge_seen ? 1 : 2); i++)
  	    {
  	      if (TREE_CODE (op1) == SSA_NAME
  		  && SSA_NAME_VALUE (op1))
*************** simplify_control_stmt_condition (edge e,
*** 689,695 ****
  	 a loop invariant SSA_NAME used in the condition.  */
        if (cached_lhs)
  	{
! 	  for (int i = 0; i < 2; i++)
  	    {
  	      if (TREE_CODE (cached_lhs) == SSA_NAME
  		  && SSA_NAME_VALUE (cached_lhs))
--- 690,696 ----
  	 a loop invariant SSA_NAME used in the condition.  */
        if (cached_lhs)
  	{
! 	  for (int i = 0; i < (backedge_seen ? 1 : 2); i++)
  	    {
  	      if (TREE_CODE (cached_lhs) == SSA_NAME
  		  && SSA_NAME_VALUE (cached_lhs))
*************** thread_around_empty_blocks (edge taken_e
*** 940,946 ****
  
    /* Extract and simplify the condition.  */
    cond = simplify_control_stmt_condition (taken_edge, stmt, dummy_cond,
! 					  simplify, handle_dominating_asserts);
  
    /* If the condition can be statically computed and we have not already
       visited the destination edge, then add the taken edge to our thread
--- 941,948 ----
  
    /* Extract and simplify the condition.  */
    cond = simplify_control_stmt_condition (taken_edge, stmt, dummy_cond,
! 					  simplify, handle_dominating_asserts,
! 					  *backedge_seen_p);
  
    /* If the condition can be statically computed and we have not already
       visited the destination edge, then add the taken edge to our thread
*************** thread_through_normal_block (edge e,
*** 1326,1332 ****
  
        /* Extract and simplify the condition.  */
        cond = simplify_control_stmt_condition (e, stmt, dummy_cond, simplify,
! 					      handle_dominating_asserts);
  
        if (!cond)
  	return 0;
--- 1328,1335 ----
  
        /* Extract and simplify the condition.  */
        cond = simplify_control_stmt_condition (e, stmt, dummy_cond, simplify,
! 					      handle_dominating_asserts,
! 					      *backedge_seen_p);
  
        if (!cond)
  	return 0;
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa-uninit.c gcc-5.5.0/gcc/tree-ssa-uninit.c
*** gcc-5.4.0/gcc/tree-ssa-uninit.c	Wed Jan 13 12:18:02 2016
--- gcc-5.5.0/gcc/tree-ssa-uninit.c	Thu Jul  7 12:46:33 2016
*************** warn_uninit (enum opt_code wc, tree t, t
*** 159,164 ****
--- 159,189 ----
    if (!has_undefined_value_p (t))
      return;
  
+   /* Anonymous SSA_NAMEs shouldn't be uninitialized, but ssa_undefined_value_p
+      can return true if the def stmt of anonymous SSA_NAME is COMPLEX_EXPR
+      created for conversion from scalar to complex.  Use the underlying var of
+      the COMPLEX_EXPRs real part in that case.  See PR71581.  */
+   if (expr == NULL_TREE
+       && var == NULL_TREE
+       && SSA_NAME_VAR (t) == NULL_TREE
+       && is_gimple_assign (SSA_NAME_DEF_STMT (t))
+       && gimple_assign_rhs_code (SSA_NAME_DEF_STMT (t)) == COMPLEX_EXPR)
+     {
+       tree v = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (t));
+       if (TREE_CODE (v) == SSA_NAME
+ 	  && has_undefined_value_p (v)
+ 	  && (integer_zerop (gimple_assign_rhs2 (SSA_NAME_DEF_STMT (t)))
+ 	      || real_zerop (gimple_assign_rhs2 (SSA_NAME_DEF_STMT (t)))
+ 	      || fixed_zerop (gimple_assign_rhs2 (SSA_NAME_DEF_STMT (t)))))
+ 	{
+ 	  expr = SSA_NAME_VAR (v);
+ 	  var = expr;
+ 	}
+     }
+ 
+   if (expr == NULL_TREE)
+     return;
+ 
    /* TREE_NO_WARNING either means we already warned, or the front end
       wishes to suppress the warning.  */
    if ((context
diff -Nrcpad gcc-5.4.0/gcc/tree-ssa.c gcc-5.5.0/gcc/tree-ssa.c
*** gcc-5.4.0/gcc/tree-ssa.c	Thu Feb 11 13:27:14 2016
--- gcc-5.5.0/gcc/tree-ssa.c	Thu Jul  7 10:33:01 2016
*************** non_rewritable_lvalue_p (tree lhs)
*** 1354,1359 ****
--- 1354,1371 ----
        tree decl = TREE_OPERAND (TREE_OPERAND (lhs, 0), 0);
        if (DECL_P (decl)
  	  && DECL_SIZE (decl) == TYPE_SIZE (TREE_TYPE (lhs))
+ 	  /* If the dynamic type of the decl has larger precision than
+ 	     the decl itself we can't use the decls type for SSA rewriting.  */
+ 	  && ((! INTEGRAL_TYPE_P (TREE_TYPE (decl))
+ 	       || compare_tree_int (DECL_SIZE (decl),
+ 				    TYPE_PRECISION (TREE_TYPE (decl))) == 0)
+ 	      || (INTEGRAL_TYPE_P (TREE_TYPE (lhs))
+ 		  && (TYPE_PRECISION (TREE_TYPE (decl))
+ 		      >= TYPE_PRECISION (TREE_TYPE (lhs)))))
+ 	  /* Make sure we are not re-writing non-float copying into float
+ 	     copying as that can incur normalization.  */
+ 	  && (! FLOAT_TYPE_P (TREE_TYPE (decl))
+ 	      || types_compatible_p (TREE_TYPE (lhs), TREE_TYPE (decl)))
  	  && (TREE_THIS_VOLATILE (decl) == TREE_THIS_VOLATILE (lhs)))
  	return false;
      }
diff -Nrcpad gcc-5.4.0/gcc/tree-vect-data-refs.c gcc-5.5.0/gcc/tree-vect-data-refs.c
*** gcc-5.4.0/gcc/tree-vect-data-refs.c	Wed Feb 24 12:55:31 2016
--- gcc-5.5.0/gcc/tree-vect-data-refs.c	Thu Sep 21 21:56:16 2017
*************** compare_tree (tree t1, tree t2)
*** 2393,2398 ****
--- 2393,2400 ----
    if (t2 == NULL)
      return 1;
  
+   STRIP_NOPS (t1);
+   STRIP_NOPS (t2);
  
    if (TREE_CODE (t1) != TREE_CODE (t2))
      return TREE_CODE (t1) < TREE_CODE (t2) ? -1 : 1;
*************** vect_analyze_data_ref_accesses (loop_vec
*** 2593,2599 ****
  	  /* Sorting has ensured that DR_INIT (dra) <= DR_INIT (drb).  */
  	  HOST_WIDE_INT init_a = TREE_INT_CST_LOW (DR_INIT (dra));
  	  HOST_WIDE_INT init_b = TREE_INT_CST_LOW (DR_INIT (drb));
! 	  gcc_assert (init_a < init_b);
  
  	  /* If init_b == init_a + the size of the type * k, we have an
  	     interleaving, and DRA is accessed before DRB.  */
--- 2595,2601 ----
  	  /* Sorting has ensured that DR_INIT (dra) <= DR_INIT (drb).  */
  	  HOST_WIDE_INT init_a = TREE_INT_CST_LOW (DR_INIT (dra));
  	  HOST_WIDE_INT init_b = TREE_INT_CST_LOW (DR_INIT (drb));
! 	  gcc_assert (init_a <= init_b);
  
  	  /* If init_b == init_a + the size of the type * k, we have an
  	     interleaving, and DRA is accessed before DRB.  */
diff -Nrcpad gcc-5.4.0/gcc/tree-vect-loop-manip.c gcc-5.5.0/gcc/tree-vect-loop-manip.c
*** gcc-5.4.0/gcc/tree-vect-loop-manip.c	Fri Jan  9 20:18:42 2015
--- gcc-5.5.0/gcc/tree-vect-loop-manip.c	Tue Sep 27 12:44:42 2016
*************** vect_gen_niters_for_prolog_loop (loop_ve
*** 1886,1892 ****
        gimple_seq new_stmts = NULL;
        bool negative = tree_int_cst_compare (DR_STEP (dr), size_zero_node) < 0;
        tree offset = negative
! 	  ? size_int (-TYPE_VECTOR_SUBPARTS (vectype) + 1) : NULL_TREE;
        tree start_addr = vect_create_addr_base_for_vector_ref (dr_stmt,
  						&new_stmts, offset, loop);
        tree type = unsigned_type_for (TREE_TYPE (start_addr));
--- 1886,1892 ----
        gimple_seq new_stmts = NULL;
        bool negative = tree_int_cst_compare (DR_STEP (dr), size_zero_node) < 0;
        tree offset = negative
! 	  ? size_int (-TYPE_VECTOR_SUBPARTS (vectype) + 1) : size_zero_node;
        tree start_addr = vect_create_addr_base_for_vector_ref (dr_stmt,
  						&new_stmts, offset, loop);
        tree type = unsigned_type_for (TREE_TYPE (start_addr));
diff -Nrcpad gcc-5.4.0/gcc/tree-vrp.c gcc-5.5.0/gcc/tree-vrp.c
*** gcc-5.4.0/gcc/tree-vrp.c	Wed Feb 10 18:31:06 2016
--- gcc-5.5.0/gcc/tree-vrp.c	Wed May 10 10:01:23 2017
*************** get_value_range (const_tree var)
*** 807,812 ****
--- 807,829 ----
    return vr;
  }
  
+ /* Set value-ranges of all SSA names defined by STMT to varying.  */
+ 
+ static void
+ set_defs_to_varying (gimple stmt)
+ {
+   ssa_op_iter i;
+   tree def;
+   FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
+     {
+       value_range_t *vr = get_value_range (def);
+       /* Avoid writing to vr_const_varying get_value_range may return.  */
+       if (vr->type != VR_VARYING)
+ 	set_value_range_to_varying (vr);
+     }
+ }
+ 
+ 
  /* Return true, if VAL1 and VAL2 are equal values for VRP purposes.  */
  
  static inline bool
*************** extract_range_from_binary_expr_1 (value_
*** 2780,2787 ****
  	    min = build_symbolic_expr (expr_type, sym_min_op0,
  				       neg_min_op0, min);
  	  else if (sym_min_op1)
! 	    min = build_symbolic_expr (expr_type, sym_min_op1,
! 				       neg_min_op1 ^ minus_p, min);
  
  	  /* Likewise for the upper bound.  */
  	  if (sym_max_op0 == sym_max_op1)
--- 2797,2813 ----
  	    min = build_symbolic_expr (expr_type, sym_min_op0,
  				       neg_min_op0, min);
  	  else if (sym_min_op1)
! 	    {
! 	      /* We may not negate if that might introduce
! 		 undefined overflow.  */
! 	      if (! minus_p
! 		  || neg_min_op1
! 		  || TYPE_OVERFLOW_WRAPS (expr_type))
! 		min = build_symbolic_expr (expr_type, sym_min_op1,
! 					   neg_min_op1 ^ minus_p, min);
! 	      else
! 		min = NULL_TREE;
! 	    }
  
  	  /* Likewise for the upper bound.  */
  	  if (sym_max_op0 == sym_max_op1)
*************** extract_range_from_binary_expr_1 (value_
*** 2790,2797 ****
  	    max = build_symbolic_expr (expr_type, sym_max_op0,
  				       neg_max_op0, max);
  	  else if (sym_max_op1)
! 	    max = build_symbolic_expr (expr_type, sym_max_op1,
! 				       neg_max_op1 ^ minus_p, max);
  	}
        else
  	{
--- 2816,2832 ----
  	    max = build_symbolic_expr (expr_type, sym_max_op0,
  				       neg_max_op0, max);
  	  else if (sym_max_op1)
! 	    {
! 	      /* We may not negate if that might introduce
! 		 undefined overflow.  */
! 	      if (! minus_p
! 		  || neg_max_op1
! 		  || TYPE_OVERFLOW_WRAPS (expr_type))
! 		max = build_symbolic_expr (expr_type, sym_max_op1,
! 					   neg_max_op1 ^ minus_p, max);
! 	      else
! 		max = NULL_TREE;
! 	    }
  	}
        else
  	{
*************** vrp_initialize (void)
*** 7061,7070 ****
  	    prop_set_simulate_again (stmt, true);
  	  else if (!stmt_interesting_for_vrp (stmt))
  	    {
! 	      ssa_op_iter i;
! 	      tree def;
! 	      FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
! 		set_value_range_to_varying (get_value_range (def));
  	      prop_set_simulate_again (stmt, false);
  	    }
  	  else
--- 7096,7102 ----
  	    prop_set_simulate_again (stmt, true);
  	  else if (!stmt_interesting_for_vrp (stmt))
  	    {
! 	      set_defs_to_varying (stmt);
  	      prop_set_simulate_again (stmt, false);
  	    }
  	  else
*************** vrp_valueize_1 (tree name)
*** 7117,7124 ****
  static enum ssa_prop_result
  vrp_visit_assignment_or_call (gimple stmt, tree *output_p)
  {
!   tree def, lhs;
!   ssa_op_iter iter;
    enum gimple_code code = gimple_code (stmt);
    lhs = gimple_get_lhs (stmt);
  
--- 7149,7155 ----
  static enum ssa_prop_result
  vrp_visit_assignment_or_call (gimple stmt, tree *output_p)
  {
!   tree lhs;
    enum gimple_code code = gimple_code (stmt);
    lhs = gimple_get_lhs (stmt);
  
*************** vrp_visit_assignment_or_call (gimple stm
*** 7235,7242 ****
        }
  
    /* Every other statement produces no useful ranges.  */
!   FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter, SSA_OP_DEF)
!     set_value_range_to_varying (get_value_range (def));
  
    return SSA_PROP_VARYING;
  }
--- 7266,7272 ----
        }
  
    /* Every other statement produces no useful ranges.  */
!   set_defs_to_varying (stmt);
  
    return SSA_PROP_VARYING;
  }
*************** vrp_visit_switch_stmt (gswitch *stmt, ed
*** 8009,8017 ****
  static enum ssa_prop_result
  vrp_visit_stmt (gimple stmt, edge *taken_edge_p, tree *output_p)
  {
-   tree def;
-   ssa_op_iter iter;
- 
    if (dump_file && (dump_flags & TDF_DETAILS))
      {
        fprintf (dump_file, "\nVisiting statement:\n");
--- 8039,8044 ----
*************** vrp_visit_stmt (gimple stmt, edge *taken
*** 8029,8036 ****
  
    /* All other statements produce nothing of interest for VRP, so mark
       their outputs varying and prevent further simulation.  */
!   FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter, SSA_OP_DEF)
!     set_value_range_to_varying (get_value_range (def));
  
    return SSA_PROP_VARYING;
  }
--- 8056,8062 ----
  
    /* All other statements produce nothing of interest for VRP, so mark
       their outputs varying and prevent further simulation.  */
!   set_defs_to_varying (stmt);
  
    return SSA_PROP_VARYING;
  }
*************** vrp_intersect_ranges_1 (value_range_t *v
*** 8634,8640 ****
    if (vr0->equiv && vr1->equiv && vr0->equiv != vr1->equiv)
      bitmap_ior_into (vr0->equiv, vr1->equiv);
    else if (vr1->equiv && !vr0->equiv)
!     bitmap_copy (vr0->equiv, vr1->equiv);
  }
  
  static void
--- 8660,8669 ----
    if (vr0->equiv && vr1->equiv && vr0->equiv != vr1->equiv)
      bitmap_ior_into (vr0->equiv, vr1->equiv);
    else if (vr1->equiv && !vr0->equiv)
!     {
!       vr0->equiv = BITMAP_ALLOC (NULL);
!       bitmap_copy (vr0->equiv, vr1->equiv);
!     }
  }
  
  static void
diff -Nrcpad gcc-5.4.0/gcc/tsan.c gcc-5.5.0/gcc/tsan.c
*** gcc-5.4.0/gcc/tsan.c	Wed Aug  5 11:20:59 2015
--- gcc-5.5.0/gcc/tsan.c	Tue May 30 07:22:25 2017
*************** along with GCC; see the file COPYING3.
*** 84,89 ****
--- 84,90 ----
  #include "tsan.h"
  #include "asan.h"
  #include "builtins.h"
+ #include "target.h"
  
  /* Number of instrumented memory accesses in the current function.  */
  
*************** instrument_expr (gimple_stmt_iterator gs
*** 284,290 ****
  enum tsan_atomic_action
  {
    check_last, add_seq_cst, add_acquire, weak_cas, strong_cas,
!   bool_cas, val_cas, lock_release, fetch_op, fetch_op_seq_cst
  };
  
  /* Table how to map sync/atomic builtins to their corresponding
--- 285,292 ----
  enum tsan_atomic_action
  {
    check_last, add_seq_cst, add_acquire, weak_cas, strong_cas,
!   bool_cas, val_cas, lock_release, fetch_op, fetch_op_seq_cst,
!   bool_clear, bool_test_and_set
  };
  
  /* Table how to map sync/atomic builtins to their corresponding
*************** static const struct tsan_map_atomic
*** 318,323 ****
--- 320,329 ----
    TRANSFORM (fcode, tsan_fcode, fetch_op, code)
  #define FETCH_OPS(fcode, tsan_fcode, code) \
    TRANSFORM (fcode, tsan_fcode, fetch_op_seq_cst, code)
+ #define BOOL_CLEAR(fcode, tsan_fcode) \
+   TRANSFORM (fcode, tsan_fcode, bool_clear, ERROR_MARK)
+ #define BOOL_TEST_AND_SET(fcode, tsan_fcode) \
+   TRANSFORM (fcode, tsan_fcode, bool_test_and_set, ERROR_MARK)
  
    CHECK_LAST (ATOMIC_LOAD_1, TSAN_ATOMIC8_LOAD),
    CHECK_LAST (ATOMIC_LOAD_2, TSAN_ATOMIC16_LOAD),
*************** static const struct tsan_map_atomic
*** 507,513 ****
    LOCK_RELEASE (SYNC_LOCK_RELEASE_2, TSAN_ATOMIC16_STORE),
    LOCK_RELEASE (SYNC_LOCK_RELEASE_4, TSAN_ATOMIC32_STORE),
    LOCK_RELEASE (SYNC_LOCK_RELEASE_8, TSAN_ATOMIC64_STORE),
!   LOCK_RELEASE (SYNC_LOCK_RELEASE_16, TSAN_ATOMIC128_STORE)
  };
  
  /* Instrument an atomic builtin.  */
--- 513,523 ----
    LOCK_RELEASE (SYNC_LOCK_RELEASE_2, TSAN_ATOMIC16_STORE),
    LOCK_RELEASE (SYNC_LOCK_RELEASE_4, TSAN_ATOMIC32_STORE),
    LOCK_RELEASE (SYNC_LOCK_RELEASE_8, TSAN_ATOMIC64_STORE),
!   LOCK_RELEASE (SYNC_LOCK_RELEASE_16, TSAN_ATOMIC128_STORE),
! 
!   BOOL_CLEAR (ATOMIC_CLEAR, TSAN_ATOMIC8_STORE),
! 
!   BOOL_TEST_AND_SET (ATOMIC_TEST_AND_SET, TSAN_ATOMIC8_EXCHANGE)
  };
  
  /* Instrument an atomic builtin.  */
*************** instrument_builtin_call (gimple_stmt_ite
*** 659,664 ****
--- 669,725 ----
  				build_int_cst (NULL_TREE,
  					       MEMMODEL_RELEASE));
  	    return;
+ 	  case bool_clear:
+ 	  case bool_test_and_set:
+ 	    if (BOOL_TYPE_SIZE != 8)
+ 	      {
+ 		decl = NULL_TREE;
+ 		for (j = 1; j < 5; j++)
+ 		  if (BOOL_TYPE_SIZE == (8 << j))
+ 		    {
+ 		      enum built_in_function tsan_fcode
+ 			= (enum built_in_function)
+ 			  (tsan_atomic_table[i].tsan_fcode + j);
+ 		      decl = builtin_decl_implicit (tsan_fcode);
+ 		      break;
+ 		    }
+ 		if (decl == NULL_TREE)
+ 		  return;
+ 	      }
+ 	    last_arg = gimple_call_arg (stmt, num - 1);
+ 	    if (!tree_fits_uhwi_p (last_arg)
+ 		|| memmodel_base (tree_to_uhwi (last_arg)) >= MEMMODEL_LAST)
+ 	      return;
+ 	    t = TYPE_ARG_TYPES (TREE_TYPE (decl));
+ 	    t = TREE_VALUE (TREE_CHAIN (t));
+ 	    if (tsan_atomic_table[i].action == bool_clear)
+ 	      {
+ 		update_gimple_call (gsi, decl, 3, gimple_call_arg (stmt, 0),
+ 				    build_int_cst (t, 0), last_arg);
+ 		return;
+ 	      }
+ 	    t = build_int_cst (t, targetm.atomic_test_and_set_trueval);
+ 	    update_gimple_call (gsi, decl, 3, gimple_call_arg (stmt, 0),
+ 				t, last_arg);
+ 	    stmt = gsi_stmt (*gsi);
+ 	    lhs = gimple_call_lhs (stmt);
+ 	    if (lhs == NULL_TREE)
+ 	      return;
+ 	    if (targetm.atomic_test_and_set_trueval != 1
+ 		|| !useless_type_conversion_p (TREE_TYPE (lhs),
+ 					       TREE_TYPE (t)))
+ 	      {
+ 		tree new_lhs = make_ssa_name (TREE_TYPE (t));
+ 		gimple_call_set_lhs (stmt, new_lhs);
+ 		if (targetm.atomic_test_and_set_trueval != 1)
+ 		  g = gimple_build_assign (lhs, NE_EXPR, new_lhs,
+ 					   build_int_cst (TREE_TYPE (t), 0));
+ 		else
+ 		  g = gimple_build_assign (lhs, NOP_EXPR, new_lhs);
+ 		gsi_insert_after (gsi, g, GSI_NEW_STMT);
+ 		update_stmt (stmt);
+ 	      }
+ 	    return;
  	  default:
  	    continue;
  	  }
diff -Nrcpad gcc-5.4.0/gcc/ubsan.c gcc-5.5.0/gcc/ubsan.c
*** gcc-5.4.0/gcc/ubsan.c	Wed Feb 10 18:27:20 2016
--- gcc-5.5.0/gcc/ubsan.c	Mon Jul 31 09:29:58 2017
*************** get_ubsan_type_info_for_type (tree type)
*** 365,370 ****
--- 365,374 ----
      return 0;
  }
  
+ /* Counters for internal labels.  ubsan_ids[0] for Lubsan_type,
+    ubsan_ids[1] for Lubsan_data labels.  */
+ static GTY(()) unsigned int ubsan_ids[2];
+ 
  /* Helper routine that returns ADDR_EXPR of a VAR_DECL of a type
     descriptor.  It first looks into the hash table; if not found,
     create the VAR_DECL, put it into the hash table and return the
*************** ubsan_type_descriptor (tree type, enum u
*** 427,432 ****
--- 431,437 ----
      /* We weren't able to determine the type name.  */
      tname = "<unknown>";
  
+   tree eltype = type;
    if (pstyle == UBSAN_PRINT_POINTER)
      {
        pp_printf (&pretty_name, "'%s%s%s%s%s%s%s",
*************** ubsan_type_descriptor (tree type, enum u
*** 475,486 ****
        pp_quote (&pretty_name);
  
        /* Save the tree with stripped types.  */
!       type = t;
      }
    else
      pp_printf (&pretty_name, "'%s'", tname);
  
!   switch (TREE_CODE (type))
      {
      case BOOLEAN_TYPE:
      case ENUMERAL_TYPE:
--- 480,491 ----
        pp_quote (&pretty_name);
  
        /* Save the tree with stripped types.  */
!       eltype = t;
      }
    else
      pp_printf (&pretty_name, "'%s'", tname);
  
!   switch (TREE_CODE (eltype))
      {
      case BOOLEAN_TYPE:
      case ENUMERAL_TYPE:
*************** ubsan_type_descriptor (tree type, enum u
*** 490,498 ****
      case REAL_TYPE:
        /* FIXME: libubsan right now only supports float, double and
  	 long double type formats.  */
!       if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
! 	  || TYPE_MODE (type) == TYPE_MODE (double_type_node)
! 	  || TYPE_MODE (type) == TYPE_MODE (long_double_type_node))
  	tkind = 0x0001;
        else
  	tkind = 0xffff;
--- 495,503 ----
      case REAL_TYPE:
        /* FIXME: libubsan right now only supports float, double and
  	 long double type formats.  */
!       if (TYPE_MODE (eltype) == TYPE_MODE (float_type_node)
! 	  || TYPE_MODE (eltype) == TYPE_MODE (double_type_node)
! 	  || TYPE_MODE (eltype) == TYPE_MODE (long_double_type_node))
  	tkind = 0x0001;
        else
  	tkind = 0xffff;
*************** ubsan_type_descriptor (tree type, enum u
*** 501,507 ****
        tkind = 0xffff;
        break;
      }
!   tinfo = get_ubsan_type_info_for_type (type);
  
    /* Create a new VAR_DECL of type descriptor.  */
    const char *tmp = pp_formatted_text (&pretty_name);
--- 506,512 ----
        tkind = 0xffff;
        break;
      }
!   tinfo = get_ubsan_type_info_for_type (eltype);
  
    /* Create a new VAR_DECL of type descriptor.  */
    const char *tmp = pp_formatted_text (&pretty_name);
*************** ubsan_type_descriptor (tree type, enum u
*** 512,521 ****
    TREE_STATIC (str) = 1;
  
    char tmp_name[32];
!   static unsigned int type_var_id_num;
!   ASM_GENERATE_INTERNAL_LABEL (tmp_name, "Lubsan_type", type_var_id_num++);
    decl = build_decl (UNKNOWN_LOCATION, VAR_DECL, get_identifier (tmp_name),
! 			  dtype);
    TREE_STATIC (decl) = 1;
    TREE_PUBLIC (decl) = 0;
    DECL_ARTIFICIAL (decl) = 1;
--- 517,525 ----
    TREE_STATIC (str) = 1;
  
    char tmp_name[32];
!   ASM_GENERATE_INTERNAL_LABEL (tmp_name, "Lubsan_type", ubsan_ids[0]++);
    decl = build_decl (UNKNOWN_LOCATION, VAR_DECL, get_identifier (tmp_name),
! 		     dtype);
    TREE_STATIC (decl) = 1;
    TREE_PUBLIC (decl) = 0;
    DECL_ARTIFICIAL (decl) = 1;
*************** ubsan_create_data (const char *name, int
*** 615,622 ****
  
    /* Now, fill in the type.  */
    char tmp_name[32];
!   static unsigned int ubsan_var_id_num;
!   ASM_GENERATE_INTERNAL_LABEL (tmp_name, "Lubsan_data", ubsan_var_id_num++);
    tree var = build_decl (UNKNOWN_LOCATION, VAR_DECL, get_identifier (tmp_name),
  			 ret);
    TREE_STATIC (var) = 1;
--- 619,625 ----
  
    /* Now, fill in the type.  */
    char tmp_name[32];
!   ASM_GENERATE_INTERNAL_LABEL (tmp_name, "Lubsan_data", ubsan_ids[1]++);
    tree var = build_decl (UNKNOWN_LOCATION, VAR_DECL, get_identifier (tmp_name),
  			 ret);
    TREE_STATIC (var) = 1;
*************** instrument_object_size (gimple_stmt_iter
*** 1772,1778 ****
  	{
  	  tree repr = DECL_BIT_FIELD_REPRESENTATIVE (TREE_OPERAND (t, 1));
  	  t = build3 (COMPONENT_REF, TREE_TYPE (repr), TREE_OPERAND (t, 0),
! 		      repr, NULL_TREE);
  	}
        break;
      case ARRAY_REF:
--- 1775,1781 ----
  	{
  	  tree repr = DECL_BIT_FIELD_REPRESENTATIVE (TREE_OPERAND (t, 1));
  	  t = build3 (COMPONENT_REF, TREE_TYPE (repr), TREE_OPERAND (t, 0),
! 		      repr, TREE_OPERAND (t, 2));
  	}
        break;
      case ARRAY_REF:
*************** instrument_object_size (gimple_stmt_iter
*** 1806,1812 ****
    bool decl_p = DECL_P (inner);
    tree base;
    if (decl_p)
!     base = inner;
    else if (TREE_CODE (inner) == MEM_REF)
      base = TREE_OPERAND (inner, 0);
    else
--- 1809,1819 ----
    bool decl_p = DECL_P (inner);
    tree base;
    if (decl_p)
!     {
!       if (DECL_REGISTER (inner))
! 	return;
!       base = inner;
!     }
    else if (TREE_CODE (inner) == MEM_REF)
      base = TREE_OPERAND (inner, 0);
    else
diff -Nrcpad gcc-5.4.0/gcc/value-prof.c gcc-5.5.0/gcc/value-prof.c
*** gcc-5.4.0/gcc/value-prof.c	Fri Mar  6 16:12:43 2015
--- gcc-5.5.0/gcc/value-prof.c	Wed Mar 22 14:59:44 2017
*************** stream_out_histogram_value (struct outpu
*** 431,437 ****
        break;
      }
    for (i = 0; i < hist->n_counters; i++)
!     streamer_write_gcov_count (ob, hist->hvalue.counters[i]);
    if (hist->hvalue.next)
      stream_out_histogram_value (ob, hist->hvalue.next);
  }
--- 431,447 ----
        break;
      }
    for (i = 0; i < hist->n_counters; i++)
!     {
!       /* When user uses an unsigned type with a big value, constant converted
! 	 to gcov_type (a signed type) can be negative.  */
!       gcov_type value = hist->hvalue.counters[i];
!       if (hist->type == HIST_TYPE_SINGLE_VALUE && i == 0)
! 	;
!       else
! 	gcc_assert (value >= 0);
! 
!       streamer_write_gcov_count (ob, value);
!     }
    if (hist->hvalue.next)
      stream_out_histogram_value (ob, hist->hvalue.next);
  }
diff -Nrcpad gcc-5.4.0/gnattools/ChangeLog gcc-5.5.0/gnattools/ChangeLog
*** gcc-5.4.0/gnattools/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gnattools/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/gotools/ChangeLog gcc-5.5.0/gotools/ChangeLog
*** gcc-5.4.0/gotools/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/gotools/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/include/ChangeLog gcc-5.5.0/include/ChangeLog
*** gcc-5.4.0/include/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/include/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/intl/ChangeLog gcc-5.5.0/intl/ChangeLog
*** gcc-5.4.0/intl/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/intl/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libada/ChangeLog gcc-5.5.0/libada/ChangeLog
*** gcc-5.4.0/libada/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libada/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libatomic/ChangeLog gcc-5.5.0/libatomic/ChangeLog
*** gcc-5.4.0/libatomic/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libatomic/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,15 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-02-07  Szabolcs Nagy  <szabolcs.nagy@arm.com>
+ 
+ 	Backport from mainline:
+ 	2017-01-30  Szabolcs Nagy  <szabolcs.nagy@arm.com>
+ 
+ 	PR target/78945
+ 	* config/arm/exch_n.c (libat_exchange): Check __ARM_FEATURE_SIMD32.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libatomic/config/arm/exch_n.c gcc-5.5.0/libatomic/config/arm/exch_n.c
*** gcc-5.4.0/libatomic/config/arm/exch_n.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libatomic/config/arm/exch_n.c	Tue Feb  7 12:51:00 2017
***************
*** 29,35 ****
  /* When using STREX to implement sub-word exchange, we can do much better
     than the compiler by using the APSR.GE and APSR.C flags.  */
  
! #if !DONE && HAVE_STREX && !HAVE_STREXBH && N == 2
  UTYPE
  SIZE(libat_exchange) (UTYPE *mptr, UTYPE newval, int smodel)
  {
--- 29,35 ----
  /* When using STREX to implement sub-word exchange, we can do much better
     than the compiler by using the APSR.GE and APSR.C flags.  */
  
! #if !DONE && __ARM_FEATURE_SIMD32 && HAVE_STREX && !HAVE_STREXBH && N == 2
  UTYPE
  SIZE(libat_exchange) (UTYPE *mptr, UTYPE newval, int smodel)
  {
*************** SIZE(libat_exchange) (UTYPE *mptr, UTYPE
*** 79,85 ****
  #endif /* !HAVE_STREXBH && N == 2 */
  
  
! #if !DONE && HAVE_STREX && !HAVE_STREXBH && N == 1
  UTYPE
  SIZE(libat_exchange) (UTYPE *mptr, UTYPE newval, int smodel)
  {
--- 79,85 ----
  #endif /* !HAVE_STREXBH && N == 2 */
  
  
! #if !DONE && __ARM_FEATURE_SIMD32 && HAVE_STREX && !HAVE_STREXBH && N == 1
  UTYPE
  SIZE(libat_exchange) (UTYPE *mptr, UTYPE newval, int smodel)
  {
diff -Nrcpad gcc-5.4.0/libbacktrace/ChangeLog gcc-5.5.0/libbacktrace/ChangeLog
*** gcc-5.4.0/libbacktrace/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libbacktrace/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libcc1/ChangeLog gcc-5.5.0/libcc1/ChangeLog
*** gcc-5.4.0/libcc1/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libcc1/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libcilkrts/ChangeLog gcc-5.5.0/libcilkrts/ChangeLog
*** gcc-5.4.0/libcilkrts/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libcilkrts/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libcpp/ChangeLog gcc-5.5.0/libcpp/ChangeLog
*** gcc-5.4.0/libcpp/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libcpp/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libcpp/line-map.c gcc-5.5.0/libcpp/line-map.c
*** gcc-5.4.0/libcpp/line-map.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libcpp/line-map.c	Tue Jul 19 13:35:43 2016
*************** new_linemap (struct line_maps *set,
*** 218,224 ****
    if (LINEMAPS_USED (set, macro_map_p) == LINEMAPS_ALLOCATED (set, macro_map_p))
      {
        /* We ran out of allocated line maps. Let's allocate more.  */
!       unsigned alloc_size;
  
        /* Cast away extern "C" from the type of xrealloc.  */
        line_map_realloc reallocator = (set->reallocator
--- 218,224 ----
    if (LINEMAPS_USED (set, macro_map_p) == LINEMAPS_ALLOCATED (set, macro_map_p))
      {
        /* We ran out of allocated line maps. Let's allocate more.  */
!       size_t alloc_size;
  
        /* Cast away extern "C" from the type of xrealloc.  */
        line_map_realloc reallocator = (set->reallocator
diff -Nrcpad gcc-5.4.0/libcpp/po/ChangeLog gcc-5.5.0/libcpp/po/ChangeLog
*** gcc-5.4.0/libcpp/po/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libcpp/po/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libdecnumber/ChangeLog gcc-5.5.0/libdecnumber/ChangeLog
*** gcc-5.4.0/libdecnumber/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libdecnumber/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libffi/ChangeLog gcc-5.5.0/libffi/ChangeLog
*** gcc-5.4.0/libffi/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libffi/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libffi/doc/libffi.info gcc-5.5.0/libffi/doc/libffi.info
*** gcc-5.4.0/libffi/doc/libffi.info	Fri Jun  3 10:41:50 2016
--- gcc-5.5.0/libffi/doc/libffi.info	Tue Oct 10 09:51:12 2017
***************
*** 1,5 ****
! This is doc/libffi.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/libffi/doc/libffi.texi.
  
  This manual is for Libffi, a portable foreign-function interface
  library.
--- 1,4 ----
! This is libffi.info, produced by makeinfo version 6.1 from libffi.texi.
  
  This manual is for Libffi, a portable foreign-function interface
  library.
*************** library.
*** 8,17 ****
  
       Permission is granted to copy, distribute and/or modify this
       document under the terms of the GNU General Public License as
!      published by the Free Software Foundation; either version 2, or
!      (at your option) any later version.  A copy of the license is
!      included in the section entitled "GNU General Public License".
! 
  
  INFO-DIR-SECTION Development
  START-INFO-DIR-ENTRY
--- 7,15 ----
  
       Permission is granted to copy, distribute and/or modify this
       document under the terms of the GNU General Public License as
!      published by the Free Software Foundation; either version 2, or (at
!      your option) any later version.  A copy of the license is included
!      in the section entitled "GNU General Public License".
  
  INFO-DIR-SECTION Development
  START-INFO-DIR-ENTRY
*************** library.
*** 31,40 ****
  
       Permission is granted to copy, distribute and/or modify this
       document under the terms of the GNU General Public License as
!      published by the Free Software Foundation; either version 2, or
!      (at your option) any later version.  A copy of the license is
!      included in the section entitled "GNU General Public License".
! 
  
  * Menu:
  
--- 29,37 ----
  
       Permission is granted to copy, distribute and/or modify this
       document under the terms of the GNU General Public License as
!      published by the Free Software Foundation; either version 2, or (at
!      your option) any later version.  A copy of the license is included
!      in the section entitled "GNU General Public License".
  
  * Menu:
  
*************** The calling convention is a set of assum
*** 56,80 ****
  about where function arguments will be found on entry to a function.  A
  calling convention also specifies where the return value for a function
  is found.  The calling convention is also sometimes called the "ABI" or
! "Application Binary Interface".  
  
     Some programs may not know at the time of compilation what arguments
  are to be passed to a function.  For instance, an interpreter may be
  told at run-time about the number and types of arguments used to call a
! given function.  `Libffi' can be used in such programs to provide a
  bridge from the interpreter program to compiled code.
  
!    The `libffi' library provides a portable, high level programming
  interface to various calling conventions.  This allows a programmer to
  call any function specified by a call interface description at run time.
  
     FFI stands for Foreign Function Interface.  A foreign function
! interface is the popular name for the interface that allows code
! written in one language to call code written in another language.  The
! `libffi' library really only provides the lowest, machine dependent
! layer of a fully featured foreign function interface.  A layer must
! exist above `libffi' that handles type conversions for values passed
! between the two languages.  
  
  
  File: libffi.info,  Node: Using libffi,  Next: Missing Features,  Prev: Introduction,  Up: Top
--- 53,77 ----
  about where function arguments will be found on entry to a function.  A
  calling convention also specifies where the return value for a function
  is found.  The calling convention is also sometimes called the "ABI" or
! "Application Binary Interface".
  
     Some programs may not know at the time of compilation what arguments
  are to be passed to a function.  For instance, an interpreter may be
  told at run-time about the number and types of arguments used to call a
! given function.  'Libffi' can be used in such programs to provide a
  bridge from the interpreter program to compiled code.
  
!    The 'libffi' library provides a portable, high level programming
  interface to various calling conventions.  This allows a programmer to
  call any function specified by a call interface description at run time.
  
     FFI stands for Foreign Function Interface.  A foreign function
! interface is the popular name for the interface that allows code written
! in one language to call code written in another language.  The 'libffi'
! library really only provides the lowest, machine dependent layer of a
! fully featured foreign function interface.  A layer must exist above
! 'libffi' that handles type conversions for values passed between the two
! languages.
  
  
  File: libffi.info,  Node: Using libffi,  Next: Missing Features,  Prev: Introduction,  Up: Top
*************** File: libffi.info,  Node: The Basics,  N
*** 97,141 ****
  2.1 The Basics
  ==============
  
! `Libffi' assumes that you have a pointer to the function you wish to
  call and that you know the number and types of arguments to pass it, as
  well as the return type of the function.
  
!    The first thing you must do is create an `ffi_cif' object that
  matches the signature of the function you wish to call.  This is a
! separate step because it is common to make multiple calls using a
! single `ffi_cif'.  The "cif" in `ffi_cif' stands for Call InterFace.
! To prepare a call interface object, use the function `ffi_prep_cif'.  
  
   -- Function: ffi_status ffi_prep_cif (ffi_cif *CIF, ffi_abi ABI,
            unsigned int NARGS, ffi_type *RTYPE, ffi_type **ARGTYPES)
       This initializes CIF according to the given parameters.
  
!      ABI is the ABI to use; normally `FFI_DEFAULT_ABI' is what you
!      want.  *note Multiple ABIs:: for more information.
  
       NARGS is the number of arguments that this function accepts.
  
!      RTYPE is a pointer to an `ffi_type' structure that describes the
       return type of the function.  *Note Types::.
  
!      ARGTYPES is a vector of `ffi_type' pointers.  ARGTYPES must have
       NARGS elements.  If NARGS is 0, this argument is ignored.
  
!      `ffi_prep_cif' returns a `libffi' status code, of type
!      `ffi_status'.  This will be either `FFI_OK' if everything worked
!      properly; `FFI_BAD_TYPEDEF' if one of the `ffi_type' objects is
!      incorrect; or `FFI_BAD_ABI' if the ABI parameter is invalid.
  
     If the function being called is variadic (varargs) then
! `ffi_prep_cif_var' must be used instead of `ffi_prep_cif'.
  
!  -- Function: ffi_status ffi_prep_cif_var (ffi_cif *CIF, ffi_abi
!           varabi, unsigned int NFIXEDARGS, unsigned int varntotalargs,
!           ffi_type *RTYPE, ffi_type **ARGTYPES)
       This initializes CIF according to the given parameters for a call
       to a variadic function.  In general it's operation is the same as
!      for `ffi_prep_cif' except that:
  
       NFIXEDARGS is the number of fixed arguments, prior to any variadic
       arguments.  It must be greater than zero.
--- 94,138 ----
  2.1 The Basics
  ==============
  
! 'Libffi' assumes that you have a pointer to the function you wish to
  call and that you know the number and types of arguments to pass it, as
  well as the return type of the function.
  
!    The first thing you must do is create an 'ffi_cif' object that
  matches the signature of the function you wish to call.  This is a
! separate step because it is common to make multiple calls using a single
! 'ffi_cif'.  The "cif" in 'ffi_cif' stands for Call InterFace.  To
! prepare a call interface object, use the function 'ffi_prep_cif'.
  
   -- Function: ffi_status ffi_prep_cif (ffi_cif *CIF, ffi_abi ABI,
            unsigned int NARGS, ffi_type *RTYPE, ffi_type **ARGTYPES)
       This initializes CIF according to the given parameters.
  
!      ABI is the ABI to use; normally 'FFI_DEFAULT_ABI' is what you want.
!      *note Multiple ABIs:: for more information.
  
       NARGS is the number of arguments that this function accepts.
  
!      RTYPE is a pointer to an 'ffi_type' structure that describes the
       return type of the function.  *Note Types::.
  
!      ARGTYPES is a vector of 'ffi_type' pointers.  ARGTYPES must have
       NARGS elements.  If NARGS is 0, this argument is ignored.
  
!      'ffi_prep_cif' returns a 'libffi' status code, of type
!      'ffi_status'.  This will be either 'FFI_OK' if everything worked
!      properly; 'FFI_BAD_TYPEDEF' if one of the 'ffi_type' objects is
!      incorrect; or 'FFI_BAD_ABI' if the ABI parameter is invalid.
  
     If the function being called is variadic (varargs) then
! 'ffi_prep_cif_var' must be used instead of 'ffi_prep_cif'.
  
!  -- Function: ffi_status ffi_prep_cif_var (ffi_cif *CIF, ffi_abi varabi,
!           unsigned int NFIXEDARGS, unsigned int varntotalargs, ffi_type
!           *RTYPE, ffi_type **ARGTYPES)
       This initializes CIF according to the given parameters for a call
       to a variadic function.  In general it's operation is the same as
!      for 'ffi_prep_cif' except that:
  
       NFIXEDARGS is the number of fixed arguments, prior to any variadic
       arguments.  It must be greater than zero.
*************** To prepare a call interface object, use
*** 146,172 ****
       Note that, different cif's must be prepped for calls to the same
       function when different numbers of arguments are passed.
  
!      Also note that a call to `ffi_prep_cif_var' with
       NFIXEDARGS=NOTOTALARGS is NOT equivalent to a call to
!      `ffi_prep_cif'.
! 
  
!    To call a function using an initialized `ffi_cif', use the
! `ffi_call' function:
  
   -- Function: void ffi_call (ffi_cif *CIF, void *FN, void *RVALUE, void
            **AVALUES)
       This calls the function FN according to the description given in
!      CIF.  CIF must have already been prepared using `ffi_prep_cif'.
  
       RVALUE is a pointer to a chunk of memory that will hold the result
       of the function call.  This must be large enough to hold the
       result, no smaller than the system register size (generally 32 or
       64 bits), and must be suitably aligned; it is the caller's
       responsibility to ensure this.  If CIF declares that the function
!      returns `void' (using `ffi_type_void'), then RVALUE is ignored.
  
!      AVALUES is a vector of `void *' pointers that point to the memory
       locations holding the argument values for a call.  If CIF declares
       that the function has no arguments (i.e., NARGS was 0), then
       AVALUES is ignored.  Note that argument values may be modified by
--- 143,168 ----
       Note that, different cif's must be prepped for calls to the same
       function when different numbers of arguments are passed.
  
!      Also note that a call to 'ffi_prep_cif_var' with
       NFIXEDARGS=NOTOTALARGS is NOT equivalent to a call to
!      'ffi_prep_cif'.
  
!    To call a function using an initialized 'ffi_cif', use the 'ffi_call'
! function:
  
   -- Function: void ffi_call (ffi_cif *CIF, void *FN, void *RVALUE, void
            **AVALUES)
       This calls the function FN according to the description given in
!      CIF.  CIF must have already been prepared using 'ffi_prep_cif'.
  
       RVALUE is a pointer to a chunk of memory that will hold the result
       of the function call.  This must be large enough to hold the
       result, no smaller than the system register size (generally 32 or
       64 bits), and must be suitably aligned; it is the caller's
       responsibility to ensure this.  If CIF declares that the function
!      returns 'void' (using 'ffi_type_void'), then RVALUE is ignored.
  
!      AVALUES is a vector of 'void *' pointers that point to the memory
       locations holding the argument values for a call.  If CIF declares
       that the function has no arguments (i.e., NARGS was 0), then
       AVALUES is ignored.  Note that argument values may be modified by
*************** File: libffi.info,  Node: Simple Example
*** 179,185 ****
  2.2 Simple Example
  ==================
  
! Here is a trivial example that calls `puts' a few times.
  
       #include <stdio.h>
       #include <ffi.h>
--- 175,181 ----
  2.2 Simple Example
  ==================
  
! Here is a trivial example that calls 'puts' a few times.
  
       #include <stdio.h>
       #include <ffi.h>
*************** File: libffi.info,  Node: Primitive Type
*** 234,324 ****
  2.3.1 Primitive Types
  ---------------------
  
! `Libffi' provides a number of built-in type descriptors that can be
! used to describe argument and return types:
  
! `ffi_type_void'
!      The type `void'.  This cannot be used for argument types, only for
       return values.
  
! `ffi_type_uint8'
       An unsigned, 8-bit integer type.
  
! `ffi_type_sint8'
       A signed, 8-bit integer type.
  
! `ffi_type_uint16'
       An unsigned, 16-bit integer type.
  
! `ffi_type_sint16'
       A signed, 16-bit integer type.
  
! `ffi_type_uint32'
       An unsigned, 32-bit integer type.
  
! `ffi_type_sint32'
       A signed, 32-bit integer type.
  
! `ffi_type_uint64'
       An unsigned, 64-bit integer type.
  
! `ffi_type_sint64'
       A signed, 64-bit integer type.
  
! `ffi_type_float'
!      The C `float' type.
  
! `ffi_type_double'
!      The C `double' type.
  
! `ffi_type_uchar'
!      The C `unsigned char' type.
  
! `ffi_type_schar'
!      The C `signed char' type.  (Note that there is not an exact
!      equivalent to the C `char' type in `libffi'; ordinarily you should
!      either use `ffi_type_schar' or `ffi_type_uchar' depending on
!      whether `char' is signed.)
  
! `ffi_type_ushort'
!      The C `unsigned short' type.
  
! `ffi_type_sshort'
!      The C `short' type.
  
! `ffi_type_uint'
!      The C `unsigned int' type.
  
! `ffi_type_sint'
!      The C `int' type.
  
! `ffi_type_ulong'
!      The C `unsigned long' type.
  
! `ffi_type_slong'
!      The C `long' type.
  
! `ffi_type_longdouble'
!      On platforms that have a C `long double' type, this is defined.
!      On other platforms, it is not.
  
! `ffi_type_pointer'
!      A generic `void *' pointer.  You should use this for all pointers,
       regardless of their real type.
  
! `ffi_type_complex_float'
!      The C `_Complex float' type.
  
! `ffi_type_complex_double'
!      The C `_Complex double' type.
  
! `ffi_type_complex_longdouble'
!      The C `_Complex long double' type.  On platforms that have a C
!      `long double' type, this is defined.  On other platforms, it is
       not.
  
!    Each of these is of type `ffi_type', so you must take the address
! when passing to `ffi_prep_cif'.
  
  
  File: libffi.info,  Node: Structures,  Next: Type Example,  Prev: Primitive Types,  Up: Types
--- 230,320 ----
  2.3.1 Primitive Types
  ---------------------
  
! 'Libffi' provides a number of built-in type descriptors that can be used
! to describe argument and return types:
  
! 'ffi_type_void'
!      The type 'void'.  This cannot be used for argument types, only for
       return values.
  
! 'ffi_type_uint8'
       An unsigned, 8-bit integer type.
  
! 'ffi_type_sint8'
       A signed, 8-bit integer type.
  
! 'ffi_type_uint16'
       An unsigned, 16-bit integer type.
  
! 'ffi_type_sint16'
       A signed, 16-bit integer type.
  
! 'ffi_type_uint32'
       An unsigned, 32-bit integer type.
  
! 'ffi_type_sint32'
       A signed, 32-bit integer type.
  
! 'ffi_type_uint64'
       An unsigned, 64-bit integer type.
  
! 'ffi_type_sint64'
       A signed, 64-bit integer type.
  
! 'ffi_type_float'
!      The C 'float' type.
  
! 'ffi_type_double'
!      The C 'double' type.
  
! 'ffi_type_uchar'
!      The C 'unsigned char' type.
  
! 'ffi_type_schar'
!      The C 'signed char' type.  (Note that there is not an exact
!      equivalent to the C 'char' type in 'libffi'; ordinarily you should
!      either use 'ffi_type_schar' or 'ffi_type_uchar' depending on
!      whether 'char' is signed.)
  
! 'ffi_type_ushort'
!      The C 'unsigned short' type.
  
! 'ffi_type_sshort'
!      The C 'short' type.
  
! 'ffi_type_uint'
!      The C 'unsigned int' type.
  
! 'ffi_type_sint'
!      The C 'int' type.
  
! 'ffi_type_ulong'
!      The C 'unsigned long' type.
  
! 'ffi_type_slong'
!      The C 'long' type.
  
! 'ffi_type_longdouble'
!      On platforms that have a C 'long double' type, this is defined.  On
!      other platforms, it is not.
  
! 'ffi_type_pointer'
!      A generic 'void *' pointer.  You should use this for all pointers,
       regardless of their real type.
  
! 'ffi_type_complex_float'
!      The C '_Complex float' type.
  
! 'ffi_type_complex_double'
!      The C '_Complex double' type.
  
! 'ffi_type_complex_longdouble'
!      The C '_Complex long double' type.  On platforms that have a C
!      'long double' type, this is defined.  On other platforms, it is
       not.
  
!    Each of these is of type 'ffi_type', so you must take the address
! when passing to 'ffi_prep_cif'.
  
  
  File: libffi.info,  Node: Structures,  Next: Type Example,  Prev: Primitive Types,  Up: Types
*************** File: libffi.info,  Node: Structures,  N
*** 326,349 ****
  2.3.2 Structures
  ----------------
  
! Although `libffi' has no special support for unions or bit-fields, it
! is perfectly happy passing structures back and forth.  You must first
! describe the structure to `libffi' by creating a new `ffi_type' object
  for it.
  
   -- Data type: ffi_type
!      The `ffi_type' has the following members:
!     `size_t size'
!           This is set by `libffi'; you should initialize it to zero.
  
!     `unsigned short alignment'
!           This is set by `libffi'; you should initialize it to zero.
  
!     `unsigned short type'
!           For a structure, this should be set to `FFI_TYPE_STRUCT'.
  
!     `ffi_type **elements'
!           This is a `NULL'-terminated array of pointers to `ffi_type'
            objects.  There is one element per field of the struct.
  
  
--- 322,345 ----
  2.3.2 Structures
  ----------------
  
! Although 'libffi' has no special support for unions or bit-fields, it is
! perfectly happy passing structures back and forth.  You must first
! describe the structure to 'libffi' by creating a new 'ffi_type' object
  for it.
  
   -- Data type: ffi_type
!      The 'ffi_type' has the following members:
!      'size_t size'
!           This is set by 'libffi'; you should initialize it to zero.
  
!      'unsigned short alignment'
!           This is set by 'libffi'; you should initialize it to zero.
  
!      'unsigned short type'
!           For a structure, this should be set to 'FFI_TYPE_STRUCT'.
  
!      'ffi_type **elements'
!           This is a 'NULL'-terminated array of pointers to 'ffi_type'
            objects.  There is one element per field of the struct.
  
  
*************** File: libffi.info,  Node: Type Example,
*** 352,359 ****
  2.3.3 Type Example
  ------------------
  
! The following example initializes a `ffi_type' object representing the
! `tm' struct from Linux's `time.h'.
  
     Here is how the struct is defined:
  
--- 348,355 ----
  2.3.3 Type Example
  ------------------
  
! The following example initializes a 'ffi_type' object representing the
! 'tm' struct from Linux's 'time.h'.
  
     Here is how the struct is defined:
  
*************** The following example initializes a `ffi
*** 372,378 ****
           __const char *__tm_zone__;
       };
  
!    Here is the corresponding code to describe this struct to `libffi':
  
           {
             ffi_type tm_type;
--- 368,374 ----
           __const char *__tm_zone__;
       };
  
!    Here is the corresponding code to describe this struct to 'libffi':
  
           {
             ffi_type tm_type;
*************** File: libffi.info,  Node: Complex,  Next
*** 400,436 ****
  2.3.4 Complex Types
  -------------------
  
! `libffi' supports the complex types defined by the C99 standard
! (`_Complex float', `_Complex double' and `_Complex long double' with
! the built-in type descriptors `ffi_type_complex_float',
! `ffi_type_complex_double' and `ffi_type_complex_longdouble'.
  
!    Custom complex types like `_Complex int' can also be used.  An
! `ffi_type' object has to be defined to describe the complex type to
! `libffi'.
  
   -- Data type: ffi_type
!     `size_t size'
            This must be manually set to the size of the complex type.
  
!     `unsigned short alignment'
            This must be manually set to the alignment of the complex
            type.
  
!     `unsigned short type'
!           For a complex type, this must be set to `FFI_TYPE_COMPLEX'.
  
!     `ffi_type **elements'
!           This is a `NULL'-terminated array of pointers to `ffi_type'
!           objects.  The first element is set to the `ffi_type' of the
            complex's base type.  The second element must be set to
!           `NULL'.
  
!    The section *note Complex Type Example:: shows a way to determine
! the `size' and `alignment' members in a platform independent way.
  
!    For platforms that have no complex support in `libffi' yet, the
! functions `ffi_prep_cif' and `ffi_prep_args' abort the program if they
  encounter a complex type.
  
  
--- 396,433 ----
  2.3.4 Complex Types
  -------------------
  
! 'libffi' supports the complex types defined by the C99 standard
! ('_Complex float', '_Complex double' and '_Complex long double' with the
! built-in type descriptors 'ffi_type_complex_float',
! 'ffi_type_complex_double' and 'ffi_type_complex_longdouble'.
  
!    Custom complex types like '_Complex int' can also be used.  An
! 'ffi_type' object has to be defined to describe the complex type to
! 'libffi'.
  
   -- Data type: ffi_type
!      'size_t size'
            This must be manually set to the size of the complex type.
  
!      'unsigned short alignment'
            This must be manually set to the alignment of the complex
            type.
  
!      'unsigned short type'
!           For a complex type, this must be set to 'FFI_TYPE_COMPLEX'.
  
!      'ffi_type **elements'
! 
!           This is a 'NULL'-terminated array of pointers to 'ffi_type'
!           objects.  The first element is set to the 'ffi_type' of the
            complex's base type.  The second element must be set to
!           'NULL'.
  
!    The section *note Complex Type Example:: shows a way to determine the
! 'size' and 'alignment' members in a platform independent way.
  
!    For platforms that have no complex support in 'libffi' yet, the
! functions 'ffi_prep_cif' and 'ffi_prep_args' abort the program if they
  encounter a complex type.
  
  
*************** File: libffi.info,  Node: Multiple ABIs,
*** 527,535 ****
  =================
  
  A given platform may provide multiple different ABIs at once.  For
! instance, the x86 platform has both `stdcall' and `fastcall' functions.
  
!    `libffi' provides some support for this.  However, this is
  necessarily platform-specific.
  
  
--- 524,532 ----
  =================
  
  A given platform may provide multiple different ABIs at once.  For
! instance, the x86 platform has both 'stdcall' and 'fastcall' functions.
  
!    'libffi' provides some support for this.  However, this is
  necessarily platform-specific.
  
  
*************** File: libffi.info,  Node: The Closure AP
*** 538,569 ****
  2.5 The Closure API
  ===================
  
! `libffi' also provides a way to write a generic function - a function
  that can accept and decode any combination of arguments.  This can be
! useful when writing an interpreter, or to provide wrappers for
! arbitrary functions.
  
!    This facility is called the "closure API".  Closures are not
! supported on all platforms; you can check the `FFI_CLOSURES' define to
! determine whether they are supported on the current platform.  
  
     Because closures work by assembling a tiny function at runtime, they
! require special allocation on platforms that have a non-executable
! heap.  Memory management for closures is handled by a pair of functions:
  
   -- Function: void *ffi_closure_alloc (size_t SIZE, void **CODE)
       Allocate a chunk of memory holding SIZE bytes.  This returns a
       pointer to the writable address, and sets *CODE to the
       corresponding executable address.
  
!      SIZE should be sufficient to hold a `ffi_closure' object.
  
   -- Function: void ffi_closure_free (void *WRITABLE)
!      Free memory allocated using `ffi_closure_alloc'.  The argument is
       the writable address that was returned.
  
     Once you have allocated the memory for a closure, you must construct
! a `ffi_cif' describing the function call.  Finally you can prepare the
  closure function:
  
   -- Function: ffi_status ffi_prep_closure_loc (ffi_closure *CLOSURE,
--- 535,566 ----
  2.5 The Closure API
  ===================
  
! 'libffi' also provides a way to write a generic function - a function
  that can accept and decode any combination of arguments.  This can be
! useful when writing an interpreter, or to provide wrappers for arbitrary
! functions.
  
!    This facility is called the "closure API". Closures are not supported
! on all platforms; you can check the 'FFI_CLOSURES' define to determine
! whether they are supported on the current platform.
  
     Because closures work by assembling a tiny function at runtime, they
! require special allocation on platforms that have a non-executable heap.
! Memory management for closures is handled by a pair of functions:
  
   -- Function: void *ffi_closure_alloc (size_t SIZE, void **CODE)
       Allocate a chunk of memory holding SIZE bytes.  This returns a
       pointer to the writable address, and sets *CODE to the
       corresponding executable address.
  
!      SIZE should be sufficient to hold a 'ffi_closure' object.
  
   -- Function: void ffi_closure_free (void *WRITABLE)
!      Free memory allocated using 'ffi_closure_alloc'.  The argument is
       the writable address that was returned.
  
     Once you have allocated the memory for a closure, you must construct
! a 'ffi_cif' describing the function call.  Finally you can prepare the
  closure function:
  
   -- Function: ffi_status ffi_prep_closure_loc (ffi_closure *CLOSURE,
*************** closure function:
*** 571,610 ****
            **ARGS, void *USER_DATA), void *USER_DATA, void *CODELOC)
       Prepare a closure function.
  
!      CLOSURE is the address of a `ffi_closure' object; this is the
!      writable address returned by `ffi_closure_alloc'.
  
!      CIF is the `ffi_cif' describing the function parameters.
  
       USER_DATA is an arbitrary datum that is passed, uninterpreted, to
       your closure function.
  
!      CODELOC is the executable address returned by `ffi_closure_alloc'.
  
       FUN is the function which will be called when the closure is
       invoked.  It is called with the arguments:
!     CIF
!           The `ffi_cif' passed to `ffi_prep_closure_loc'.
  
!     RET
            A pointer to the memory used for the function's return value.
            FUN must fill this, unless the function is declared as
!           returning `void'.
  
!     ARGS
            A vector of pointers to memory holding the arguments to the
            function.
  
!     USER_DATA
!           The same USER_DATA that was passed to `ffi_prep_closure_loc'.
  
!      `ffi_prep_closure_loc' will return `FFI_OK' if everything went ok,
       and something else on error.
  
!      After calling `ffi_prep_closure_loc', you can cast CODELOC to the
       appropriate pointer-to-function type.
  
!    You may see old code referring to `ffi_prep_closure'.  This function
  is deprecated, as it cannot handle the need for separate writable and
  executable addresses.
  
--- 568,607 ----
            **ARGS, void *USER_DATA), void *USER_DATA, void *CODELOC)
       Prepare a closure function.
  
!      CLOSURE is the address of a 'ffi_closure' object; this is the
!      writable address returned by 'ffi_closure_alloc'.
  
!      CIF is the 'ffi_cif' describing the function parameters.
  
       USER_DATA is an arbitrary datum that is passed, uninterpreted, to
       your closure function.
  
!      CODELOC is the executable address returned by 'ffi_closure_alloc'.
  
       FUN is the function which will be called when the closure is
       invoked.  It is called with the arguments:
!      CIF
!           The 'ffi_cif' passed to 'ffi_prep_closure_loc'.
  
!      RET
            A pointer to the memory used for the function's return value.
            FUN must fill this, unless the function is declared as
!           returning 'void'.
  
!      ARGS
            A vector of pointers to memory holding the arguments to the
            function.
  
!      USER_DATA
!           The same USER_DATA that was passed to 'ffi_prep_closure_loc'.
  
!      'ffi_prep_closure_loc' will return 'FFI_OK' if everything went ok,
       and something else on error.
  
!      After calling 'ffi_prep_closure_loc', you can cast CODELOC to the
       appropriate pointer-to-function type.
  
!    You may see old code referring to 'ffi_prep_closure'.  This function
  is deprecated, as it cannot handle the need for separate writable and
  executable addresses.
  
*************** File: libffi.info,  Node: Closure Exampl
*** 614,621 ****
  2.6 Closure Example
  ===================
  
! A trivial example that creates a new `puts' by binding `fputs' with
! `stdout'.
  
       #include <stdio.h>
       #include <ffi.h>
--- 611,618 ----
  2.6 Closure Example
  ===================
  
! A trivial example that creates a new 'puts' by binding 'fputs' with
! 'stdout'.
  
       #include <stdio.h>
       #include <ffi.h>
*************** A trivial example that creates a new `pu
*** 666,678 ****
         return 0;
       }
  
  
  File: libffi.info,  Node: Missing Features,  Next: Index,  Prev: Using libffi,  Up: Top
  
  3 Missing Features
  ******************
  
! `libffi' is missing a few features.  We welcome patches to add support
  for these.
  
     * Variadic closures.
--- 663,676 ----
         return 0;
       }
  
+ 
  
  File: libffi.info,  Node: Missing Features,  Next: Index,  Prev: Using libffi,  Up: Top
  
  3 Missing Features
  ******************
  
! 'libffi' is missing a few features.  We welcome patches to add support
  for these.
  
     * Variadic closures.
*************** Index
*** 700,716 ****
  * closure API:                           The Closure API.      (line 13)
  * closures:                              The Closure API.      (line 13)
  * FFI:                                   Introduction.         (line 31)
! * ffi_call:                              The Basics.           (line 63)
  * ffi_closure_alloc:                     The Closure API.      (line 19)
  * ffi_closure_free:                      The Closure API.      (line 26)
- * FFI_CLOSURES:                          The Closure API.      (line 13)
  * ffi_prep_cif:                          The Basics.           (line 16)
  * ffi_prep_cif_var:                      The Basics.           (line 39)
  * ffi_prep_closure_loc:                  The Closure API.      (line 34)
! * ffi_status <1>:                        The Closure API.      (line 37)
! * ffi_status:                            The Basics.           (line 18)
! * ffi_type <1>:                          Complex.              (line 15)
  * ffi_type:                              Structures.           (line 11)
  * ffi_type_complex_double:               Primitive Types.      (line 82)
  * ffi_type_complex_float:                Primitive Types.      (line 79)
  * ffi_type_complex_longdouble:           Primitive Types.      (line 85)
--- 698,717 ----
  * closure API:                           The Closure API.      (line 13)
  * closures:                              The Closure API.      (line 13)
  * FFI:                                   Introduction.         (line 31)
! * ffi_call:                              The Basics.           (line 62)
! * FFI_CLOSURES:                          The Closure API.      (line 13)
  * ffi_closure_alloc:                     The Closure API.      (line 19)
  * ffi_closure_free:                      The Closure API.      (line 26)
  * ffi_prep_cif:                          The Basics.           (line 16)
  * ffi_prep_cif_var:                      The Basics.           (line 39)
  * ffi_prep_closure_loc:                  The Closure API.      (line 34)
! * ffi_status:                            The Basics.           (line 16)
! * ffi_status <1>:                        The Basics.           (line 39)
! * ffi_status <2>:                        The Closure API.      (line 34)
  * ffi_type:                              Structures.           (line 11)
+ * ffi_type <1>:                          Structures.           (line 11)
+ * ffi_type <2>:                          Complex.              (line 15)
+ * ffi_type <3>:                          Complex.              (line 15)
  * ffi_type_complex_double:               Primitive Types.      (line 82)
  * ffi_type_complex_float:                Primitive Types.      (line 79)
  * ffi_type_complex_longdouble:           Primitive Types.      (line 85)
*************** Index
*** 736,762 ****
  * ffi_type_ushort:                       Primitive Types.      (line 53)
  * ffi_type_void:                         Primitive Types.      (line 10)
  * Foreign Function Interface:            Introduction.         (line 31)
! * void <1>:                              The Closure API.      (line 20)
! * void:                                  The Basics.           (line 65)
  
  
  
  Tag Table:
! Node: Top736
! Node: Introduction1484
! Node: Using libffi3120
! Node: The Basics3606
! Node: Simple Example7260
! Node: Types8291
! Node: Primitive Types8675
! Node: Structures10795
! Node: Type Example11665
! Node: Complex12947
! Node: Complex Type Example14360
! Node: Multiple ABIs17412
! Node: The Closure API17783
! Node: Closure Example20727
! Node: Missing Features22336
! Node: Index22764
  
  End Tag Table
--- 737,764 ----
  * ffi_type_ushort:                       Primitive Types.      (line 53)
  * ffi_type_void:                         Primitive Types.      (line 10)
  * Foreign Function Interface:            Introduction.         (line 31)
! * void:                                  The Basics.           (line 62)
! * void <1>:                              The Closure API.      (line 19)
! * void <2>:                              The Closure API.      (line 26)
  
  
  
  Tag Table:
! Node: Top682
! Node: Introduction1429
! Node: Using libffi3061
! Node: The Basics3547
! Node: Simple Example7198
! Node: Types8229
! Node: Primitive Types8613
! Node: Structures10734
! Node: Type Example11608
! Node: Complex12890
! Node: Complex Type Example14308
! Node: Multiple ABIs17360
! Node: The Closure API17731
! Node: Closure Example20675
! Node: Missing Features22285
! Node: Index22713
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/libgcc/ChangeLog gcc-5.5.0/libgcc/ChangeLog
*** gcc-5.4.0/libgcc/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libgcc/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,130 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-07-04  Joseph Myers  <joseph@codesourcery.com>
+ 
+ 	* config/aarch64/linux-unwind.h (aarch64_fallback_frame_state),
+ 	config/alpha/linux-unwind.h (alpha_fallback_frame_state),
+ 	config/bfin/linux-unwind.h (bfin_fallback_frame_state),
+ 	config/i386/linux-unwind.h (x86_64_fallback_frame_state,
+ 	x86_fallback_frame_state), config/m68k/linux-unwind.h (struct
+ 	uw_ucontext), config/nios2/linux-unwind.h (struct nios2_ucontext),
+ 	config/pa/linux-unwind.h (pa32_fallback_frame_state),
+ 	config/sh/linux-unwind.h (sh_fallback_frame_state),
+ 	config/tilepro/linux-unwind.h (tile_fallback_frame_state),
+ 	config/xtensa/linux-unwind.h (xtensa_fallback_frame_state): Use
+ 	ucontext_t instead of struct ucontext.
+ 
+ 2017-05-30  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-10-18  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	* config/xtensa/t-elf (LIB2ADDEH_XTENSA_UNWIND_DW2_FDE): New
+ 	definition.
+ 	* config/xtensa/t-linux (LIB2ADDEH_XTENSA_UNWIND_DW2_FDE): New
+ 	definition.
+ 	* config/xtensa/t-windowed (LIB2ADDEH): Use
+ 	LIB2ADDEH_XTENSA_UNWIND_DW2_FDE defined by either xtensa/t-elf
+ 	or xtensa/t-linux.
+ 
+ 2017-05-30  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-02-17  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	* config/xtensa/ieee754-df.S (__muldf3_aux, __divdf3_aux): Add
+ 	.literal_position before the function.
+ 	* config/xtensa/ieee754-sf.S (__mulsf3_aux, __divsf3_aux):
+ 	Likewise.
+ 
+ 2017-05-30  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2015-09-15  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	* config/xtensa/linux-unwind.h (xtensa_fallback_frame_state):
+ 	Add support for call0 ABI.
+ 
+ 2017-05-30  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2015-08-18  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	* config/xtensa/unwind-dw2-xtensa.c (_Unwind_GetCFA): Return
+ 	context->sp instead of context->cfa.
+ 
+ 2017-05-30  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	Backport from mainline
+ 	2015-08-18  Max Filippov  <jcmvbkbc@gmail.com>
+ 
+ 	* config/xtensa/t-windowed (LIB2ADDEH): Replace unwind-dw2-fde
+ 	with unwind-dw2-fde-dip.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-18  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR gcov-profile/78783
+ 	* libgcov-driver.c (gcov_get_filename): New function.
+ 
+ 2017-05-19  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backport from mainline
+ 	2017-05-17  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	* config/arm/unwind-arm.h: Make _Unwind_GetIP, _Unwind_GetIPInfo and
+ 	_Unwind_SetIP available as functions for arm*-*-freebsd*.
+ 	* config/arm/unwind-arm.c: Implement the above.
+ 
+ 2017-05-15  Adhemerval Zanella  <adhemerval.zanella@linaro.org>
+ 
+ 	* config/sparc/lb1spc.S [__ELF__ && __linux__]: Emit .note.GNU-stack
+ 	section for a non-executable stack.
+ 
+ 2017-05-09  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backport from mainline
+         2017-05-09  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	* config.host: Use the generic FreeBSD t-slibgcc-elf-ver for
+ 	arm*-*-freebsd* instead of the t-slibgcc-libgcc.
+ 
+ 2017-04-07  Alan Modra  <amodra@gmail.com>
+ 
+ 	PR target/45053
+ 	* config/rs6000/t-crtstuff (CRTSTUFF_T_CFLAGS): Add -O2.
+ 
+ 2017-01-09  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backport from mainline
+ 	2016-10-10  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	* config.host: Add support for aarch64-*-freebsd*.
+ 
+ 2016-11-07  Florian Weimer  <fweimer@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-10-24  Florian Weimer  <fweimer@redhat.com>
+ 
+ 	PR libgcc/78064
+ 	* unwind-c.c: Include auto-target.h.
+ 
+ 2016-09-28  Joseph Myers  <joseph@codesourcery.com>
+ 
+ 	Backport from mainline
+ 	2016-09-07  Joseph Myers  <joseph@codesourcery.com>
+ 
+ 	PR libgcc/77519
+ 	* libgcc2.c (NOTRUNC): Invert settings.
+ 
+ 2016-08-31  Jakub Sejdak  <jakub.sejdak@phoesys.com>
+ 
+ 	* config.host: Add support for arm*-*-phoenix* targets.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libgcc/config/aarch64/linux-unwind.h gcc-5.5.0/libgcc/config/aarch64/linux-unwind.h
*** gcc-5.4.0/libgcc/config/aarch64/linux-unwind.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/aarch64/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** aarch64_fallback_frame_state (struct _Un
*** 52,58 ****
    struct rt_sigframe
    {
      siginfo_t info;
!     struct ucontext uc;
    };
  
    struct rt_sigframe *rt_;
--- 52,58 ----
    struct rt_sigframe
    {
      siginfo_t info;
!     ucontext_t uc;
    };
  
    struct rt_sigframe *rt_;
diff -Nrcpad gcc-5.4.0/libgcc/config/alpha/linux-unwind.h gcc-5.5.0/libgcc/config/alpha/linux-unwind.h
*** gcc-5.4.0/libgcc/config/alpha/linux-unwind.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/alpha/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** alpha_fallback_frame_state (struct _Unwi
*** 51,57 ****
      {
        struct rt_sigframe {
  	siginfo_t info;
! 	struct ucontext uc;
        } *rt_ = context->cfa;
        sc = &rt_->uc.uc_mcontext;
      }
--- 51,57 ----
      {
        struct rt_sigframe {
  	siginfo_t info;
! 	ucontext_t uc;
        } *rt_ = context->cfa;
        sc = &rt_->uc.uc_mcontext;
      }
diff -Nrcpad gcc-5.4.0/libgcc/config/arm/unwind-arm.c gcc-5.5.0/libgcc/config/arm/unwind-arm.c
*** gcc-5.4.0/libgcc/config/arm/unwind-arm.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/arm/unwind-arm.c	Fri May 19 18:39:54 2017
*************** __aeabi_unwind_cpp_pr2 (_Unwind_State st
*** 509,511 ****
--- 509,533 ----
  {
    return __gnu_unwind_pr_common (state, ucbp, context, 2);
  }
+ 
+ #ifdef __FreeBSD__
+ /* FreeBSD expects these to be functions */
+ inline _Unwind_Ptr
+ _Unwind_GetIP (struct _Unwind_Context *context)
+ {
+   return _Unwind_GetGR (context, 15) & ~(_Unwind_Word)1;
+ }
+ 
+ inline _Unwind_Ptr
+ _Unwind_GetIPInfo (struct _Unwind_Context *context, int *ip_before_insn)
+ {
+   *ip_before_insn = 0;
+   return _Unwind_GetIP (context);
+ }
+ 
+ inline void
+ _Unwind_SetIP (struct _Unwind_Context *context, _Unwind_Ptr val)
+ {
+   _Unwind_SetGR (context, 15, val | (_Unwind_GetGR (context, 15) & 1));
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libgcc/config/arm/unwind-arm.h gcc-5.5.0/libgcc/config/arm/unwind-arm.h
*** gcc-5.4.0/libgcc/config/arm/unwind-arm.h	Fri Jan  9 14:06:02 2015
--- gcc-5.5.0/libgcc/config/arm/unwind-arm.h	Fri May 19 18:39:54 2017
*************** extern "C" {
*** 72,83 ****
--- 72,90 ----
      {
        return _URC_FAILURE;
      }
+ #ifndef __FreeBSD__
    /* Return the address of the instruction, not the actual IP value.  */
  #define _Unwind_GetIP(context) \
    (_Unwind_GetGR (context, 15) & ~(_Unwind_Word)1)
  
  #define _Unwind_SetIP(context, val) \
    _Unwind_SetGR (context, 15, val | (_Unwind_GetGR (context, 15) & 1))
+ #else
+   #undef _Unwind_GetIPInfo
+   _Unwind_Ptr _Unwind_GetIP (struct _Unwind_Context *);
+   _Unwind_Ptr _Unwind_GetIPInfo (struct _Unwind_Context *, int *);
+   void _Unwind_SetIP (struct _Unwind_Context *, _Unwind_Ptr);
+ #endif
  
  #ifdef __cplusplus
  }   /* extern "C" */
diff -Nrcpad gcc-5.4.0/libgcc/config/bfin/linux-unwind.h gcc-5.5.0/libgcc/config/bfin/linux-unwind.h
*** gcc-5.4.0/libgcc/config/bfin/linux-unwind.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/bfin/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** bfin_fallback_frame_state (struct _Unwin
*** 52,58 ****
  	void *puc;
  	char retcode[8];
  	siginfo_t info;
! 	struct ucontext uc;
        } *rt_ = context->cfa;
  
        /* The void * cast is necessary to avoid an aliasing warning.
--- 52,58 ----
  	void *puc;
  	char retcode[8];
  	siginfo_t info;
! 	ucontext_t uc;
        } *rt_ = context->cfa;
  
        /* The void * cast is necessary to avoid an aliasing warning.
diff -Nrcpad gcc-5.4.0/libgcc/config/i386/linux-unwind.h gcc-5.5.0/libgcc/config/i386/linux-unwind.h
*** gcc-5.4.0/libgcc/config/i386/linux-unwind.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/i386/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** x86_64_fallback_frame_state (struct _Unw
*** 58,64 ****
    if (*(unsigned char *)(pc+0) == 0x48
        && *(unsigned long long *)(pc+1) == RT_SIGRETURN_SYSCALL)
      {
!       struct ucontext *uc_ = context->cfa;
        /* The void * cast is necessary to avoid an aliasing warning.
           The aliasing warning is correct, but should not be a problem
           because it does not alias anything.  */
--- 58,64 ----
    if (*(unsigned char *)(pc+0) == 0x48
        && *(unsigned long long *)(pc+1) == RT_SIGRETURN_SYSCALL)
      {
!       ucontext_t *uc_ = context->cfa;
        /* The void * cast is necessary to avoid an aliasing warning.
           The aliasing warning is correct, but should not be a problem
           because it does not alias anything.  */
*************** x86_fallback_frame_state (struct _Unwind
*** 138,144 ****
  	siginfo_t *pinfo;
  	void *puc;
  	siginfo_t info;
! 	struct ucontext uc;
        } *rt_ = context->cfa;
        /* The void * cast is necessary to avoid an aliasing warning.
           The aliasing warning is correct, but should not be a problem
--- 138,144 ----
  	siginfo_t *pinfo;
  	void *puc;
  	siginfo_t info;
! 	ucontext_t uc;
        } *rt_ = context->cfa;
        /* The void * cast is necessary to avoid an aliasing warning.
           The aliasing warning is correct, but should not be a problem
diff -Nrcpad gcc-5.4.0/libgcc/config/libbid/ChangeLog gcc-5.5.0/libgcc/config/libbid/ChangeLog
*** gcc-5.4.0/libgcc/config/libbid/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libgcc/config/libbid/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libgcc/config/m68k/linux-unwind.h gcc-5.5.0/libgcc/config/m68k/linux-unwind.h
*** gcc-5.4.0/libgcc/config/m68k/linux-unwind.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/m68k/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** see the files COPYING3 and COPYING.RUNTI
*** 33,39 ****
  /* <sys/ucontext.h> is unfortunately broken right now.  */
  struct uw_ucontext {
  	unsigned long	  uc_flags;
! 	struct ucontext  *uc_link;
  	stack_t		  uc_stack;
  	mcontext_t	  uc_mcontext;
  	unsigned long	  uc_filler[80];
--- 33,39 ----
  /* <sys/ucontext.h> is unfortunately broken right now.  */
  struct uw_ucontext {
  	unsigned long	  uc_flags;
! 	ucontext_t	 *uc_link;
  	stack_t		  uc_stack;
  	mcontext_t	  uc_mcontext;
  	unsigned long	  uc_filler[80];
diff -Nrcpad gcc-5.4.0/libgcc/config/nios2/linux-unwind.h gcc-5.5.0/libgcc/config/nios2/linux-unwind.h
*** gcc-5.4.0/libgcc/config/nios2/linux-unwind.h	Tue Jan 20 14:49:51 2015
--- gcc-5.5.0/libgcc/config/nios2/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** struct nios2_mcontext {
*** 38,44 ****
  
  struct nios2_ucontext {
    unsigned long uc_flags;
!   struct ucontext *uc_link;
    stack_t uc_stack;
    struct nios2_mcontext uc_mcontext;
    sigset_t uc_sigmask;	/* mask last for extensibility */
--- 38,44 ----
  
  struct nios2_ucontext {
    unsigned long uc_flags;
!   ucontext_t *uc_link;
    stack_t uc_stack;
    struct nios2_mcontext uc_mcontext;
    sigset_t uc_sigmask;	/* mask last for extensibility */
diff -Nrcpad gcc-5.4.0/libgcc/config/pa/linux-unwind.h gcc-5.5.0/libgcc/config/pa/linux-unwind.h
*** gcc-5.4.0/libgcc/config/pa/linux-unwind.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/pa/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** pa32_fallback_frame_state (struct _Unwin
*** 80,86 ****
    struct sigcontext *sc;
    struct rt_sigframe {
      siginfo_t info;
!     struct ucontext uc;
    } *frame;
  
    /* rt_sigreturn trampoline:
--- 80,86 ----
    struct sigcontext *sc;
    struct rt_sigframe {
      siginfo_t info;
!     ucontext_t uc;
    } *frame;
  
    /* rt_sigreturn trampoline:
diff -Nrcpad gcc-5.4.0/libgcc/config/rs6000/t-crtstuff gcc-5.5.0/libgcc/config/rs6000/t-crtstuff
*** gcc-5.4.0/libgcc/config/rs6000/t-crtstuff	Wed Nov  2 14:33:56 2011
--- gcc-5.5.0/libgcc/config/rs6000/t-crtstuff	Fri Apr  7 02:19:19 2017
***************
*** 1,3 ****
  # If .sdata is enabled __CTOR_{LIST,END}__ go into .sdata instead of
  # .ctors.
! CRTSTUFF_T_CFLAGS = -msdata=none
--- 1,6 ----
  # If .sdata is enabled __CTOR_{LIST,END}__ go into .sdata instead of
  # .ctors.
! # Do not build crtend.o with -Os as that can result in references to
! # out-of-line register save/restore functions, which may be unresolved
! # as crtend.o is linked after libgcc.a.  See PR45053.
! CRTSTUFF_T_CFLAGS = -msdata=none -O2
diff -Nrcpad gcc-5.4.0/libgcc/config/sh/linux-unwind.h gcc-5.5.0/libgcc/config/sh/linux-unwind.h
*** gcc-5.4.0/libgcc/config/sh/linux-unwind.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/sh/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** sh_fallback_frame_state (struct _Unwind_
*** 180,186 ****
      {
        struct rt_sigframe {
  	siginfo_t info;
! 	struct ucontext uc;
        } *rt_ = context->cfa;
        /* The void * cast is necessary to avoid an aliasing warning.
           The aliasing warning is correct, but should not be a problem
--- 180,186 ----
      {
        struct rt_sigframe {
  	siginfo_t info;
! 	ucontext_t uc;
        } *rt_ = context->cfa;
        /* The void * cast is necessary to avoid an aliasing warning.
           The aliasing warning is correct, but should not be a problem
diff -Nrcpad gcc-5.4.0/libgcc/config/sparc/lb1spc.S gcc-5.5.0/libgcc/config/sparc/lb1spc.S
*** gcc-5.4.0/libgcc/config/sparc/lb1spc.S	Wed Nov  2 15:03:19 2011
--- gcc-5.5.0/libgcc/config/sparc/lb1spc.S	Mon May 15 07:36:56 2017
***************
*** 5,10 ****
--- 5,16 ----
     slightly edited to match the desired calling convention, and also to
     optimize them for our purposes.  */
  
+ /* An executable stack is *not* required for these functions.  */
+ #if defined(__ELF__) && defined(__linux__)
+ .section .note.GNU-stack,"",%progbits
+ .previous
+ #endif
+ 
  #ifdef L_mulsi3
  .text
  	.align 4
diff -Nrcpad gcc-5.4.0/libgcc/config/tilepro/linux-unwind.h gcc-5.5.0/libgcc/config/tilepro/linux-unwind.h
*** gcc-5.4.0/libgcc/config/tilepro/linux-unwind.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/tilepro/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** tile_fallback_frame_state (struct _Unwin
*** 61,67 ****
    struct rt_sigframe {
      unsigned char save_area[C_ABI_SAVE_AREA_SIZE];
      siginfo_t info;
!     struct ucontext uc;
    } *rt_;
  
    /* Return if this is not a signal handler.  */
--- 61,67 ----
    struct rt_sigframe {
      unsigned char save_area[C_ABI_SAVE_AREA_SIZE];
      siginfo_t info;
!     ucontext_t uc;
    } *rt_;
  
    /* Return if this is not a signal handler.  */
diff -Nrcpad gcc-5.4.0/libgcc/config/xtensa/ieee754-df.S gcc-5.5.0/libgcc/config/xtensa/ieee754-df.S
*** gcc-5.4.0/libgcc/config/xtensa/ieee754-df.S	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/xtensa/ieee754-df.S	Tue May 30 23:39:41 2017
*************** __subdf3:
*** 606,611 ****
--- 606,612 ----
  #define XCHAL_NO_MUL 1
  #endif
  
+ 	.literal_position
  __muldf3_aux:
  
  	/* Handle unusual cases (zeros, subnormals, NaNs and Infinities).
*************** __muldf3:
*** 1216,1221 ****
--- 1217,1223 ----
  
  #ifdef L_divdf3
  
+ 	.literal_position
  	/* Division */
  __divdf3_aux:
  
diff -Nrcpad gcc-5.4.0/libgcc/config/xtensa/ieee754-sf.S gcc-5.5.0/libgcc/config/xtensa/ieee754-sf.S
*** gcc-5.4.0/libgcc/config/xtensa/ieee754-sf.S	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/xtensa/ieee754-sf.S	Tue May 30 23:39:41 2017
*************** __subsf3:
*** 487,492 ****
--- 487,493 ----
  #define XCHAL_NO_MUL 1
  #endif
  
+ 	.literal_position
  __mulsf3_aux:
  
  	/* Handle unusual cases (zeros, subnormals, NaNs and Infinities).
*************** __mulsf3:
*** 884,889 ****
--- 885,891 ----
  
  #ifdef L_divsf3
  
+ 	.literal_position
  	/* Division */
  __divsf3_aux:
  
diff -Nrcpad gcc-5.4.0/libgcc/config/xtensa/linux-unwind.h gcc-5.5.0/libgcc/config/xtensa/linux-unwind.h
*** gcc-5.4.0/libgcc/config/xtensa/linux-unwind.h	Tue Mar  3 17:44:01 2015
--- gcc-5.5.0/libgcc/config/xtensa/linux-unwind.h	Tue Jul  4 10:25:10 2017
*************** see the files COPYING3 and COPYING.RUNTI
*** 52,58 ****
  #define ENTRY_BYTE 0x36
  #endif
  
- #ifdef __XTENSA_WINDOWED_ABI__
  #define MD_FALLBACK_FRAME_STATE_FOR xtensa_fallback_frame_state
  
  static _Unwind_Reason_Code
--- 52,57 ----
*************** xtensa_fallback_frame_state (struct _Unw
*** 61,70 ****
  {
    unsigned char *pc = context->ra;
    struct sigcontext *sc;
  
    struct rt_sigframe {
      siginfo_t info;
!     struct ucontext uc;
    } *rt_;
  
    /* movi a2, __NR_rt_sigreturn; syscall */
--- 60,73 ----
  {
    unsigned char *pc = context->ra;
    struct sigcontext *sc;
+ #if defined(__XTENSA_CALL0_ABI__)
+   _Unwind_Ptr new_cfa;
+   int i;
+ #endif
  
    struct rt_sigframe {
      siginfo_t info;
!     ucontext_t uc;
    } *rt_;
  
    /* movi a2, __NR_rt_sigreturn; syscall */
*************** xtensa_fallback_frame_state (struct _Unw
*** 76,81 ****
--- 79,85 ----
        || pc[5] != SYSC_BYTE2)
      return _URC_END_OF_STACK;
  
+ #if defined(__XTENSA_WINDOWED_ABI__)
    rt_ = context->sp;
    sc = &rt_->uc.uc_mcontext;
    fs->signal_regs = (_Unwind_Word *) sc->sc_a;
*************** xtensa_fallback_frame_state (struct _Unw
*** 90,100 ****
     }
    else
      fs->signal_ra = sc->sc_pc;
  
    fs->signal_frame = 1;
    return _URC_NO_REASON;
  }
  
- #endif /* __XTENSA_WINDOWED_ABI__ */
  
  #endif /* ifdef inhibit_libc  */
--- 94,126 ----
     }
    else
      fs->signal_ra = sc->sc_pc;
+ #elif defined(__XTENSA_CALL0_ABI__)
+   rt_ = context->cfa;
+   sc = &rt_->uc.uc_mcontext;
+ 
+   new_cfa = (_Unwind_Ptr) sc;
+   fs->regs.cfa_how = CFA_REG_OFFSET;
+   fs->regs.cfa_reg = __LIBGCC_STACK_POINTER_REGNUM__;
+   fs->regs.cfa_offset = new_cfa - (_Unwind_Ptr) context->cfa;
+ 
+   for (i = 0; i < 16; i++)
+     {
+       fs->regs.reg[i].how = REG_SAVED_OFFSET;
+       fs->regs.reg[i].loc.offset = (_Unwind_Ptr) &(sc->sc_a[i]) - new_cfa;
+     }
+ 
+   fs->regs.reg[__LIBGCC_DWARF_ALT_FRAME_RETURN_COLUMN__].how =
+     REG_SAVED_VAL_OFFSET;
+   fs->regs.reg[__LIBGCC_DWARF_ALT_FRAME_RETURN_COLUMN__].loc.offset =
+     (_Unwind_Ptr) (sc->sc_pc) - new_cfa;
+   fs->retaddr_column = __LIBGCC_DWARF_ALT_FRAME_RETURN_COLUMN__;
+ #else
+ #error Unsupported Xtensa ABI
+ #endif
  
    fs->signal_frame = 1;
    return _URC_NO_REASON;
  }
  
  
  #endif /* ifdef inhibit_libc  */
diff -Nrcpad gcc-5.4.0/libgcc/config/xtensa/t-elf gcc-5.5.0/libgcc/config/xtensa/t-elf
*** gcc-5.4.0/libgcc/config/xtensa/t-elf	Wed Nov  2 15:23:48 2011
--- gcc-5.5.0/libgcc/config/xtensa/t-elf	Tue May 30 23:40:34 2017
*************** CRTSTUFF_T_CFLAGS += -mlongcalls
*** 3,5 ****
--- 3,7 ----
  CRTSTUFF_T_CFLAGS_S += -mlongcalls
  
  HOST_LIBGCC2_CFLAGS += -mlongcalls
+ 
+ LIB2ADDEH_XTENSA_UNWIND_DW2_FDE = $(srcdir)/unwind-dw2-fde.c
diff -Nrcpad gcc-5.4.0/libgcc/config/xtensa/t-linux gcc-5.5.0/libgcc/config/xtensa/t-linux
*** gcc-5.4.0/libgcc/config/xtensa/t-linux	Wed Nov  2 10:49:46 2011
--- gcc-5.5.0/libgcc/config/xtensa/t-linux	Tue May 30 23:40:34 2017
***************
*** 1 ****
--- 1,3 ----
  SHLIB_MAPFILES += $(srcdir)/config/xtensa/libgcc-glibc.ver
+ 
+ LIB2ADDEH_XTENSA_UNWIND_DW2_FDE = $(srcdir)/unwind-dw2-fde-dip.c
diff -Nrcpad gcc-5.4.0/libgcc/config/xtensa/t-windowed gcc-5.5.0/libgcc/config/xtensa/t-windowed
*** gcc-5.4.0/libgcc/config/xtensa/t-windowed	Tue Mar  3 17:44:01 2015
--- gcc-5.5.0/libgcc/config/xtensa/t-windowed	Tue May 30 23:40:34 2017
***************
*** 1,2 ****
  LIB2ADDEH = $(srcdir)/config/xtensa/unwind-dw2-xtensa.c \
!    $(srcdir)/unwind-dw2-fde.c $(srcdir)/unwind-sjlj.c $(srcdir)/unwind-c.c
--- 1,2 ----
  LIB2ADDEH = $(srcdir)/config/xtensa/unwind-dw2-xtensa.c \
!    $(LIB2ADDEH_XTENSA_UNWIND_DW2_FDE) $(srcdir)/unwind-sjlj.c $(srcdir)/unwind-c.c
diff -Nrcpad gcc-5.4.0/libgcc/config/xtensa/unwind-dw2-xtensa.c gcc-5.5.0/libgcc/config/xtensa/unwind-dw2-xtensa.c
*** gcc-5.4.0/libgcc/config/xtensa/unwind-dw2-xtensa.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/config/xtensa/unwind-dw2-xtensa.c	Tue May 30 23:32:21 2017
*************** _Unwind_GetGR (struct _Unwind_Context *c
*** 130,136 ****
  _Unwind_Word
  _Unwind_GetCFA (struct _Unwind_Context *context)
  {
!   return (_Unwind_Ptr) context->cfa;
  }
  
  /* Overwrite the saved value for register INDEX in CONTEXT with VAL.  */
--- 130,136 ----
  _Unwind_Word
  _Unwind_GetCFA (struct _Unwind_Context *context)
  {
!   return (_Unwind_Ptr) context->sp;
  }
  
  /* Overwrite the saved value for register INDEX in CONTEXT with VAL.  */
diff -Nrcpad gcc-5.4.0/libgcc/config.host gcc-5.5.0/libgcc/config.host
*** gcc-5.4.0/libgcc/config.host	Tue May 17 06:17:53 2016
--- gcc-5.5.0/libgcc/config.host	Wed May 10 20:45:35 2017
*************** aarch64*-*-elf)
*** 328,333 ****
--- 328,338 ----
  	tmake_file="${tmake_file} ${cpu_type}/t-aarch64"
  	tmake_file="${tmake_file} ${cpu_type}/t-softfp t-softfp t-crtfm"
  	;;
+ aarch64*-*-freebsd*)
+ 	extra_parts="$extra_parts crtfastmath.o"
+ 	tmake_file="${tmake_file} ${cpu_type}/t-aarch64"
+ 	tmake_file="${tmake_file} ${cpu_type}/t-softfp t-softfp t-crtfm"
+ 	;;
  aarch64*-*-linux*)
  	extra_parts="$extra_parts crtfastmath.o"
  	md_unwind_header=aarch64/linux-unwind.h
*************** arm-wrs-vxworks)
*** 373,379 ****
  	;;
  arm*-*-freebsd*)                # ARM FreeBSD EABI
  	tmake_file="${tmake_file} arm/t-arm t-fixedpoint-gnu-prefix arm/t-elf"
! 	tmake_file="${tmake_file} arm/t-bpabi arm/t-freebsd t-slibgcc-libgcc"
  	tm_file="${tm_file} arm/bpabi-lib.h"
  	unwind_header=config/arm/unwind-arm.h
  	tmake_file="${tmake_file} t-softfp-sfdf t-softfp-excl arm/t-softfp t-softfp"
--- 378,384 ----
  	;;
  arm*-*-freebsd*)                # ARM FreeBSD EABI
  	tmake_file="${tmake_file} arm/t-arm t-fixedpoint-gnu-prefix arm/t-elf"
! 	tmake_file="${tmake_file} arm/t-bpabi arm/t-freebsd"
  	tm_file="${tm_file} arm/bpabi-lib.h"
  	unwind_header=config/arm/unwind-arm.h
  	tmake_file="${tmake_file} t-softfp-sfdf t-softfp-excl arm/t-softfp t-softfp"
*************** arm*-*-uclinux*)		# ARM ucLinux
*** 396,401 ****
--- 401,413 ----
  	unwind_header=config/arm/unwind-arm.h
  	extra_parts="$extra_parts crti.o crtn.o"
  	;;
+ arm*-*-phoenix*)
+ 	tmake_file="t-hardfp t-softfp arm/t-arm arm/t-elf arm/t-softfp arm/t-phoenix"
+ 	tmake_file="${tmake_file} arm/t-bpabi"
+ 	tm_file="$tm_file arm/bpabi-lib.h"
+ 	extra_parts="crtbegin.o crtend.o crti.o crtn.o"
+ 	unwind_header=config/arm/unwind-arm.h
+ 	;;
  arm*-*-eabi* | arm*-*-symbianelf* | arm*-*-rtems*)
  	tmake_file="${tmake_file} arm/t-arm arm/t-elf t-fixedpoint-gnu-prefix"
  	tm_file="$tm_file arm/bpabi-lib.h"
diff -Nrcpad gcc-5.4.0/libgcc/libgcc2.c gcc-5.5.0/libgcc/libgcc2.c
*** gcc-5.4.0/libgcc/libgcc2.c	Mon Apr  4 22:29:45 2016
--- gcc-5.5.0/libgcc/libgcc2.c	Wed Sep 28 17:37:45 2016
*************** NAME (TYPE x, int m)
*** 1866,1890 ****
  # define CTYPE	SCtype
  # define MODE	sc
  # define CEXT	__LIBGCC_SF_FUNC_EXT__
! # define NOTRUNC __LIBGCC_SF_EXCESS_PRECISION__
  #elif defined(L_muldc3) || defined(L_divdc3)
  # define MTYPE	DFtype
  # define CTYPE	DCtype
  # define MODE	dc
  # define CEXT	__LIBGCC_DF_FUNC_EXT__
! # define NOTRUNC __LIBGCC_DF_EXCESS_PRECISION__
  #elif defined(L_mulxc3) || defined(L_divxc3)
  # define MTYPE	XFtype
  # define CTYPE	XCtype
  # define MODE	xc
  # define CEXT	__LIBGCC_XF_FUNC_EXT__
! # define NOTRUNC __LIBGCC_XF_EXCESS_PRECISION__
  #elif defined(L_multc3) || defined(L_divtc3)
  # define MTYPE	TFtype
  # define CTYPE	TCtype
  # define MODE	tc
  # define CEXT	__LIBGCC_TF_FUNC_EXT__
! # define NOTRUNC __LIBGCC_TF_EXCESS_PRECISION__
  #else
  # error
  #endif
--- 1866,1890 ----
  # define CTYPE	SCtype
  # define MODE	sc
  # define CEXT	__LIBGCC_SF_FUNC_EXT__
! # define NOTRUNC (!__LIBGCC_SF_EXCESS_PRECISION__)
  #elif defined(L_muldc3) || defined(L_divdc3)
  # define MTYPE	DFtype
  # define CTYPE	DCtype
  # define MODE	dc
  # define CEXT	__LIBGCC_DF_FUNC_EXT__
! # define NOTRUNC (!__LIBGCC_DF_EXCESS_PRECISION__)
  #elif defined(L_mulxc3) || defined(L_divxc3)
  # define MTYPE	XFtype
  # define CTYPE	XCtype
  # define MODE	xc
  # define CEXT	__LIBGCC_XF_FUNC_EXT__
! # define NOTRUNC (!__LIBGCC_XF_EXCESS_PRECISION__)
  #elif defined(L_multc3) || defined(L_divtc3)
  # define MTYPE	TFtype
  # define CTYPE	TCtype
  # define MODE	tc
  # define CEXT	__LIBGCC_TF_FUNC_EXT__
! # define NOTRUNC (!__LIBGCC_TF_EXCESS_PRECISION__)
  #else
  # error
  #endif
diff -Nrcpad gcc-5.4.0/libgcc/libgcov-driver.c gcc-5.5.0/libgcc/libgcov-driver.c
*** gcc-5.4.0/libgcc/libgcov-driver.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/libgcov-driver.c	Mon May 29 09:12:33 2017
*************** gcov_do_dump (struct gcov_info *list, in
*** 848,853 ****
--- 848,862 ----
    free (gf.filename);
  }
  
+ #if IN_GCOV_TOOL
+ const char *
+ __attribute__ ((unused))
+ gcov_get_filename (struct gcov_info *list)
+ {
+   return list->filename;
+ }
+ #endif
+ 
  #if !IN_GCOV_TOOL
  void
  __gcov_dump_one (struct gcov_root *root)
diff -Nrcpad gcc-5.4.0/libgcc/unwind-c.c gcc-5.5.0/libgcc/unwind-c.c
*** gcc-5.4.0/libgcc/unwind-c.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgcc/unwind-c.c	Mon Nov  7 19:54:05 2016
*************** see the files COPYING3 and COPYING.RUNTI
*** 26,31 ****
--- 26,32 ----
  
  #include "tconfig.h"
  #include "tsystem.h"
+ #include "auto-target.h"
  #include "unwind.h"
  #define NO_SIZE_OF_ENCODED_VALUE
  #include "unwind-pe.h"
diff -Nrcpad gcc-5.4.0/libgfortran/ChangeLog gcc-5.5.0/libgfortran/ChangeLog
*** gcc-5.4.0/libgfortran/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libgfortran/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,49 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-05-19  Janne Blomqvist  <jb@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	* libgfortran.h: HAVE_SECURE_GETENV: Don't check
+ 	HAVE___SECURE_GETENV.
+ 	* environ/runtime.c (secure_getenv): Use __secure_getenv via a
+         weak reference.
+ 
+ 2017-01-31  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	PR fortran/79305
+ 	* c99_protos.h: Spell HAVE_EXPL correctly.
+ 	* intrinsics/c99_functions.c: Ditto.
+ 
+ 2016-10-31  Jerry DeLisle  <jvdelisle@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR libgfortran/78123
+ 	* io/transfer.c (formatted_transfer_scalar_read): Clear seen_eor
+ 	only if we have tabbed to left of current position.
+ 
+ 2016-09-29  Jerry DeLisle  <jvdelisle@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR libgfortran/77707
+ 	io/transfer.c (next_record): Flush before calculating next_record.
+ 	Correctly calculate.
+ 
+ 2016-09-29  Steven G. Kargl  <kargl@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR fortran/77507
+  	* ieee/ieee_arithmetic.F90 (IEEE_VALUE_4,IEEE_VALUE_8,IEEE_VALULE_10,
+ 	IEEE_VALUE_16):  Use correct keyword.
+ 
+ 2016-08-11  Jerry DeLisle  <jvdelisle@gcc.gnu.org>
+ 
+ 	Backport from trunk
+ 	PR libgfortran/71123
+ 	PR libgfortran/73142
+ 	* io/list_read (eat_spaces): Eat '\r' as part of spaces.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libgfortran/c99_protos.h gcc-5.5.0/libgfortran/c99_protos.h
*** gcc-5.4.0/libgfortran/c99_protos.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgfortran/c99_protos.h	Tue Jan 31 21:42:01 2017
*************** extern float complex cexpf (float comple
*** 332,338 ****
  extern double complex cexp (double complex);
  #endif
  
! #if !defined(HAVE_CEXPL) && defined(HAVE_COSL) && defined(HAVE_SINL) && defined(EXPL)
  #define HAVE_CEXPL 1
  extern long double complex cexpl (long double complex);
  #endif
--- 332,338 ----
  extern double complex cexp (double complex);
  #endif
  
! #if !defined(HAVE_CEXPL) && defined(HAVE_COSL) && defined(HAVE_SINL) && defined(HAVE_EXPL)
  #define HAVE_CEXPL 1
  extern long double complex cexpl (long double complex);
  #endif
diff -Nrcpad gcc-5.4.0/libgfortran/ieee/ieee_arithmetic.F90 gcc-5.5.0/libgfortran/ieee/ieee_arithmetic.F90
*** gcc-5.4.0/libgfortran/ieee/ieee_arithmetic.F90	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgfortran/ieee/ieee_arithmetic.F90	Thu Sep 29 20:32:22 2016
*************** contains
*** 500,511 ****
  
    ! IEEE_VALUE
  
!   elemental real(kind=4) function IEEE_VALUE_4(X, C) result(res)
!     implicit none
      real(kind=4), intent(in) :: X
!     type(IEEE_CLASS_TYPE), intent(in) :: C
  
!     select case (C%hidden)
        case (1)     ! IEEE_SIGNALING_NAN
          res = -1
          res = sqrt(res)
--- 500,511 ----
  
    ! IEEE_VALUE
  
!   elemental real(kind=4) function IEEE_VALUE_4(X, CLASS) result(res)
! 
      real(kind=4), intent(in) :: X
!     type(IEEE_CLASS_TYPE), intent(in) :: CLASS
  
!     select case (CLASS%hidden)
        case (1)     ! IEEE_SIGNALING_NAN
          res = -1
          res = sqrt(res)
*************** contains
*** 538,549 ****
       end select
    end function
  
!   elemental real(kind=8) function IEEE_VALUE_8(X, C) result(res)
!     implicit none
      real(kind=8), intent(in) :: X
!     type(IEEE_CLASS_TYPE), intent(in) :: C
  
!     select case (C%hidden)
        case (1)     ! IEEE_SIGNALING_NAN
          res = -1
          res = sqrt(res)
--- 538,549 ----
       end select
    end function
  
!   elemental real(kind=8) function IEEE_VALUE_8(X, CLASS) result(res)
! 
      real(kind=8), intent(in) :: X
!     type(IEEE_CLASS_TYPE), intent(in) :: CLASS
  
!     select case (CLASS%hidden)
        case (1)     ! IEEE_SIGNALING_NAN
          res = -1
          res = sqrt(res)
diff -Nrcpad gcc-5.4.0/libgfortran/intrinsics/c99_functions.c gcc-5.5.0/libgfortran/intrinsics/c99_functions.c
*** gcc-5.4.0/libgfortran/intrinsics/c99_functions.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgfortran/intrinsics/c99_functions.c	Tue Jan 31 21:42:01 2017
*************** cexp (double complex z)
*** 913,919 ****
  }
  #endif
  
! #if !defined(HAVE_CEXPL) && defined(HAVE_COSL) && defined(HAVE_SINL) && defined(EXPL)
  #define HAVE_CEXPL 1
  long double complex cexpl (long double complex z);
  
--- 913,919 ----
  }
  #endif
  
! #if !defined(HAVE_CEXPL) && defined(HAVE_COSL) && defined(HAVE_SINL) && defined(HAVE_EXPL)
  #define HAVE_CEXPL 1
  long double complex cexpl (long double complex z);
  
diff -Nrcpad gcc-5.4.0/libgfortran/io/list_read.c gcc-5.5.0/libgfortran/io/list_read.c
*** gcc-5.4.0/libgfortran/io/list_read.c	Tue May  3 00:51:30 2016
--- gcc-5.5.0/libgfortran/io/list_read.c	Thu Aug 11 17:28:51 2016
*************** eat_spaces (st_parameter_dt *dtp)
*** 418,424 ****
    /* Now skip spaces, EOF and EOL are handled in next_char.  */
    do
      c = next_char (dtp);
!   while (c != EOF && (c == ' ' || c == '\t'));
  
    unget_char (dtp, c);
    return c;
--- 418,424 ----
    /* Now skip spaces, EOF and EOL are handled in next_char.  */
    do
      c = next_char (dtp);
!   while (c != EOF && (c == ' ' || c == '\r' || c == '\t'));
  
    unget_char (dtp, c);
    return c;
diff -Nrcpad gcc-5.4.0/libgfortran/io/transfer.c gcc-5.5.0/libgfortran/io/transfer.c
*** gcc-5.4.0/libgfortran/io/transfer.c	Sat Nov  7 18:13:17 2015
--- gcc-5.5.0/libgfortran/io/transfer.c	Mon Oct 31 23:40:40 2016
*************** formatted_transfer_scalar_read (st_param
*** 1434,1440 ****
                dtp->u.p.current_unit->bytes_left -= dtp->u.p.sf_seen_eor;
                dtp->u.p.skips -= dtp->u.p.sf_seen_eor;
  	      bytes_used = pos;
! 	      dtp->u.p.sf_seen_eor = 0;
  	    }
  	  if (dtp->u.p.skips < 0)
  	    {
--- 1434,1441 ----
                dtp->u.p.current_unit->bytes_left -= dtp->u.p.sf_seen_eor;
                dtp->u.p.skips -= dtp->u.p.sf_seen_eor;
  	      bytes_used = pos;
! 	      if (dtp->u.p.pending_spaces == 0)
! 	        dtp->u.p.sf_seen_eor = 0;
  	    }
  	  if (dtp->u.p.skips < 0)
  	    {
*************** next_record (st_parameter_dt *dtp, int d
*** 3502,3507 ****
--- 3503,3510 ----
    else
      next_record_w (dtp, done);
  
+   fbuf_flush (dtp->u.p.current_unit, dtp->u.p.mode);
+ 
    if (!is_stream_io (dtp))
      {
        /* Since we have changed the position, set it to unspecified so
*************** next_record (st_parameter_dt *dtp, int d
*** 3515,3522 ****
  	  fp = stell (dtp->u.p.current_unit->s);
  	  /* Calculate next record, rounding up partial records.  */
  	  dtp->u.p.current_unit->last_record =
! 	    (fp + dtp->u.p.current_unit->recl - 1) /
! 	      dtp->u.p.current_unit->recl;
  	}
        else
  	dtp->u.p.current_unit->last_record++;
--- 3518,3525 ----
  	  fp = stell (dtp->u.p.current_unit->s);
  	  /* Calculate next record, rounding up partial records.  */
  	  dtp->u.p.current_unit->last_record =
! 	    (fp + dtp->u.p.current_unit->recl) /
! 	      dtp->u.p.current_unit->recl - 1;
  	}
        else
  	dtp->u.p.current_unit->last_record++;
*************** next_record (st_parameter_dt *dtp, int d
*** 3525,3531 ****
    if (!done)
      pre_position (dtp);
  
-   fbuf_flush (dtp->u.p.current_unit, dtp->u.p.mode);
    smarkeor (dtp->u.p.current_unit->s);
  }
  
--- 3528,3533 ----
diff -Nrcpad gcc-5.4.0/libgfortran/libgfortran.h gcc-5.5.0/libgfortran/libgfortran.h
*** gcc-5.4.0/libgfortran/libgfortran.h	Wed Jul 29 17:12:28 2015
--- gcc-5.5.0/libgfortran/libgfortran.h	Fri May 19 13:30:45 2017
*************** internal_proto(get_unformatted_convert);
*** 809,817 ****
  
  /* Secure getenv() which returns NULL if running as SUID/SGID.  */
  #ifndef HAVE_SECURE_GETENV
! #ifdef HAVE___SECURE_GETENV
! #define secure_getenv __secure_getenv
! #elif defined(HAVE_GETUID) && defined(HAVE_GETEUID) \
    && defined(HAVE_GETGID) && defined(HAVE_GETEGID)
  #define FALLBACK_SECURE_GETENV
  extern char *secure_getenv (const char *);
--- 809,815 ----
  
  /* Secure getenv() which returns NULL if running as SUID/SGID.  */
  #ifndef HAVE_SECURE_GETENV
! #if defined(HAVE_GETUID) && defined(HAVE_GETEUID) \
    && defined(HAVE_GETGID) && defined(HAVE_GETEGID)
  #define FALLBACK_SECURE_GETENV
  extern char *secure_getenv (const char *);
diff -Nrcpad gcc-5.4.0/libgfortran/runtime/environ.c gcc-5.5.0/libgfortran/runtime/environ.c
*** gcc-5.4.0/libgfortran/runtime/environ.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgfortran/runtime/environ.c	Fri May 19 13:30:45 2017
*************** static void init_unformatted (variable *
*** 61,69 ****
--- 61,80 ----
  
  
  #ifdef FALLBACK_SECURE_GETENV
+ 
+ #if SUPPORTS_WEAKREF && defined(HAVE___SECURE_GETENV)
+ static char* weak_secure_getenv (const char*)
+   __attribute__((__weakref__("__secure_getenv")));
+ #endif
+ 
  char *
  secure_getenv (const char *name)
  {
+ #if SUPPORTS_WEAKREF && defined(HAVE___SECURE_GETENV)
+   if (weak_secure_getenv)
+     return weak_secure_getenv (name);
+ #endif
+ 
    if ((getuid () == geteuid ()) && (getgid () == getegid ()))
      return getenv (name);
    else
diff -Nrcpad gcc-5.4.0/libgo/go/syscall/syscall_linux_s390.go gcc-5.5.0/libgo/go/syscall/syscall_linux_s390.go
*** gcc-5.4.0/libgo/go/syscall/syscall_linux_s390.go	Tue Nov  4 22:39:30 2014
--- gcc-5.5.0/libgo/go/syscall/syscall_linux_s390.go	Thu Jul 20 22:04:02 2017
*************** func (r *PtraceRegs) PC() uint64 { retur
*** 12,21 ****
  
  func (r *PtraceRegs) SetPC(pc uint64) { r.Psw.Addr = uint32(pc) }
  
! func PtraceGetRegs(pid int, regsout *PtraceRegs) (err error) {
! 	return ptrace(PTRACE_GETREGS, pid, 0, uintptr(unsafe.Pointer(regsout)))
  }
  
  func PtraceSetRegs(pid int, regs *PtraceRegs) (err error) {
! 	return ptrace(PTRACE_SETREGS, pid, 0, uintptr(unsafe.Pointer(regs)))
  }
--- 12,40 ----
  
  func (r *PtraceRegs) SetPC(pc uint64) { r.Psw.Addr = uint32(pc) }
  
! const syscall_PTRACE_PEEKUSR_AREA = 0x5000
! const syscall_PTRACE_POKEUSR_AREA = 0x5001
! 
! type syscall_ptrace_area struct {
! 	len          uint32
! 	kernel_addr  uint32
! 	process_addr uint32
! }
! 
! func PtraceGetRegs(pid int, regs *PtraceRegs) (err error) {
! 	parea := syscall_ptrace_area{
! 		12,
! 		0,
! 		uint32(uintptr(unsafe.Pointer(regs))),
! 	}
! 	return ptrace(syscall_PTRACE_PEEKUSR_AREA, pid, uintptr(unsafe.Pointer(&parea)), 0)
  }
  
  func PtraceSetRegs(pid int, regs *PtraceRegs) (err error) {
! 	parea := syscall_ptrace_area{
! 		12,
! 		0,
! 		uint32(uintptr(unsafe.Pointer(regs))),
! 	}
! 	return ptrace(syscall_PTRACE_POKEUSR_AREA, pid, uintptr(unsafe.Pointer(&parea)), 0)
  }
diff -Nrcpad gcc-5.4.0/libgo/go/syscall/syscall_linux_s390x.go gcc-5.5.0/libgo/go/syscall/syscall_linux_s390x.go
*** gcc-5.4.0/libgo/go/syscall/syscall_linux_s390x.go	Tue Nov  4 22:39:30 2014
--- gcc-5.5.0/libgo/go/syscall/syscall_linux_s390x.go	Thu Jul 20 22:04:02 2017
*************** func (r *PtraceRegs) PC() uint64 { retur
*** 12,21 ****
  
  func (r *PtraceRegs) SetPC(pc uint64) { r.Psw.Addr = pc }
  
! func PtraceGetRegs(pid int, regsout *PtraceRegs) (err error) {
! 	return ptrace(PTRACE_GETREGS, pid, 0, uintptr(unsafe.Pointer(regsout)))
  }
  
  func PtraceSetRegs(pid int, regs *PtraceRegs) (err error) {
! 	return ptrace(PTRACE_SETREGS, pid, 0, uintptr(unsafe.Pointer(regs)))
  }
--- 12,40 ----
  
  func (r *PtraceRegs) SetPC(pc uint64) { r.Psw.Addr = pc }
  
! const syscall_PTRACE_PEEKUSR_AREA = 0x5000
! const syscall_PTRACE_POKEUSR_AREA = 0x5001
! 
! type syscall_ptrace_area struct {
! 	len          uint32
! 	kernel_addr  uint64
! 	process_addr uint64
! }
! 
! func PtraceGetRegs(pid int, regs *PtraceRegs) (err error) {
! 	parea := syscall_ptrace_area{
! 		24,
! 		0,
! 		uint64(uintptr(unsafe.Pointer(regs))),
! 	}
! 	return ptrace(syscall_PTRACE_PEEKUSR_AREA, pid, uintptr(unsafe.Pointer(&parea)), 0)
  }
  
  func PtraceSetRegs(pid int, regs *PtraceRegs) (err error) {
! 	parea := syscall_ptrace_area{
! 		24,
! 		0,
! 		uint64(uintptr(unsafe.Pointer(regs))),
! 	}
! 	return ptrace(syscall_PTRACE_POKEUSR_AREA, pid, uintptr(unsafe.Pointer(&parea)), 0)
  }
diff -Nrcpad gcc-5.4.0/libgomp/ChangeLog gcc-5.5.0/libgomp/ChangeLog
*** gcc-5.4.0/libgomp/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libgomp/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,47 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-08-09  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/81687
+ 	* testsuite/libgomp.c/pr81687-1.c: New test.
+ 	* testsuite/libgomp.c/pr81687-2.c: New test.
+ 
+ 	2017-07-27  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/45784
+ 	* testsuite/libgomp.c/pr45784.c: New test.
+ 	* testsuite/libgomp.c++/pr45784.C: New test.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2017-04-11  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR libgomp/80394
+ 	* testsuite/libgomp.c/pr80394.c: New test.
+ 
+ 	2017-03-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	* env.c (initialize_env): Initialize stacksize to 0.
+ 
+ 	2016-11-01  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	* hashtab.h: Use standard GPLv3 with runtime exception
+ 	boilerplate.
+ 
+ 2016-07-07  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-07-01  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR fortran/71717
+ 	* testsuite/libgomp.fortran/associate3.f90: New test.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libgomp/env.c gcc-5.5.0/libgomp/env.c
*** gcc-5.4.0/libgomp/env.c	Thu Jan 15 20:11:12 2015
--- gcc-5.5.0/libgomp/env.c	Tue May 30 08:21:17 2017
*************** handle_omp_display_env (unsigned long st
*** 1178,1184 ****
  static void __attribute__((constructor))
  initialize_env (void)
  {
!   unsigned long thread_limit_var, stacksize;
    int wait_policy;
  
    /* Do a compile time check that mkomp_h.pl did good job.  */
--- 1178,1184 ----
  static void __attribute__((constructor))
  initialize_env (void)
  {
!   unsigned long thread_limit_var, stacksize = 0;
    int wait_policy;
  
    /* Do a compile time check that mkomp_h.pl did good job.  */
diff -Nrcpad gcc-5.4.0/libgomp/hashtab.h gcc-5.5.0/libgomp/hashtab.h
*** gcc-5.4.0/libgomp/hashtab.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libgomp/hashtab.h	Tue May 30 07:38:19 2017
***************
*** 2,20 ****
     Copyright (C) 1999-2015 Free Software Foundation, Inc.
     Contributed by Vladimir Makarov <vmakarov@cygnus.com>.
  
! This program is free software; you can redistribute it and/or modify
! it under the terms of the GNU General Public License as published by
! the Free Software Foundation; either version 2 of the License, or
! (at your option) any later version.
  
! This program is distributed in the hope that it will be useful,
! but WITHOUT ANY WARRANTY; without even the implied warranty of
! MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
! GNU General Public License for more details.
  
! You should have received a copy of the GNU General Public License
! along with this program; if not, write to the Free Software
! Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA.  */
  
  /* The hash table code copied from include/hashtab.[hc] and adjusted,
     so that the hash table entries are in the flexible array at the end
--- 2,28 ----
     Copyright (C) 1999-2015 Free Software Foundation, Inc.
     Contributed by Vladimir Makarov <vmakarov@cygnus.com>.
  
!    This file is part of the GNU Offloading and Multi Processing Library
!    (libgomp).
  
!    Libgomp is free software; you can redistribute it and/or modify it
!    under the terms of the GNU General Public License as published by
!    the Free Software Foundation; either version 3, or (at your option)
!    any later version.
  
!    Libgomp is distributed in the hope that it will be useful, but WITHOUT ANY
!    WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
!    FOR A PARTICULAR PURPOSE.  See the GNU General Public License for
!    more details.
! 
!    Under Section 7 of GPL version 3, you are granted additional
!    permissions described in the GCC Runtime Library Exception, version
!    3.1, as published by the Free Software Foundation.
! 
!    You should have received a copy of the GNU General Public License and
!    a copy of the GCC Runtime Library Exception along with this program;
!    see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
!    <http://www.gnu.org/licenses/>.  */
  
  /* The hash table code copied from include/hashtab.[hc] and adjusted,
     so that the hash table entries are in the flexible array at the end
diff -Nrcpad gcc-5.4.0/libgomp/libgomp.info gcc-5.5.0/libgomp/libgomp.info
*** gcc-5.4.0/libgomp/libgomp.info	Fri Jun  3 10:35:05 2016
--- gcc-5.5.0/libgomp/libgomp.info	Tue Oct 10 09:43:12 2017
***************
*** 1,5 ****
! This is libgomp.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/libgomp/libgomp.texi.
  
  Copyright (C) 2006-2015 Free Software Foundation, Inc.
  
--- 1,5 ----
! This is libgomp.info, produced by makeinfo version 6.1 from
! libgomp.texi.
  
  Copyright (C) 2006-2015 Free Software Foundation, Inc.
  
*************** Free Documentation License".
*** 18,26 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
! 
  INFO-DIR-SECTION GNU Libraries
  START-INFO-DIR-ENTRY
  * libgomp: (libgomp).          GNU Offloading and Multi Processing Runtime Library.
--- 18,25 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
  INFO-DIR-SECTION GNU Libraries
  START-INFO-DIR-ENTRY
  * libgomp: (libgomp).          GNU Offloading and Multi Processing Runtime Library.
*************** Free Documentation License".
*** 51,58 ****
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise
! funds for GNU development.
  
  
  File: libgomp.info,  Node: Top,  Next: Enabling OpenMP,  Up: (dir)
--- 50,57 ----
     (b) The FSF's Back-Cover Text is:
  
     You have freedom to copy and modify this GNU Manual, like GNU
! software.  Copies published by the Free Software Foundation raise funds
! for GNU development.
  
  
  File: libgomp.info,  Node: Top,  Next: Enabling OpenMP,  Up: (dir)
*************** File: libgomp.info,  Node: Top,  Next: E
*** 60,70 ****
  Introduction
  ************
  
! This manual documents the usage of libgomp, the GNU Offloading and
! Multi Processing Runtime Library.  This includes the GNU implementation
! of the OpenMP (http://www.openmp.org) Application Programming Interface
! (API) for multi-platform shared-memory parallel programming in C/C++
! and Fortran, and the GNU implementation of the OpenACC
  (http://www.openacc.org/) Application Programming Interface (API) for
  offloading of code to accelerator devices in C/C++ and Fortran.
  
--- 59,69 ----
  Introduction
  ************
  
! This manual documents the usage of libgomp, the GNU Offloading and Multi
! Processing Runtime Library.  This includes the GNU implementation of the
! OpenMP (http://www.openmp.org) Application Programming Interface (API)
! for multi-platform shared-memory parallel programming in C/C++ and
! Fortran, and the GNU implementation of the OpenACC
  (http://www.openacc.org/) Application Programming Interface (API) for
  offloading of code to accelerator devices in C/C++ and Fortran.
  
*************** File: libgomp.info,  Node: Enabling Open
*** 98,114 ****
  *****************
  
  To activate the OpenMP extensions for C/C++ and Fortran, the
! compile-time flag `-fopenmp' must be specified.  This enables the
! OpenMP directive `#pragma omp' in C/C++ and `!$omp' directives in free
! form, `c$omp', `*$omp' and `!$omp' directives in fixed form, `!$'
! conditional compilation sentinels in free form and `c$', `*$' and `!$'
! sentinels in fixed form, for Fortran.  The flag also arranges for
! automatic linking of the OpenMP runtime library (*note Runtime Library
! Routines::).
  
!    A complete description of all OpenMP directives accepted may be
! found in the OpenMP Application Program Interface
! (http://www.openmp.org) manual, version 4.0.
  
  
  File: libgomp.info,  Node: Runtime Library Routines,  Next: Environment Variables,  Prev: Enabling OpenMP,  Up: Top
--- 97,112 ----
  *****************
  
  To activate the OpenMP extensions for C/C++ and Fortran, the
! compile-time flag '-fopenmp' must be specified.  This enables the OpenMP
! directive '#pragma omp' in C/C++ and '!$omp' directives in free form,
! 'c$omp', '*$omp' and '!$omp' directives in fixed form, '!$' conditional
! compilation sentinels in free form and 'c$', '*$' and '!$' sentinels in
! fixed form, for Fortran.  The flag also arranges for automatic linking
! of the OpenMP runtime library (*note Runtime Library Routines::).
  
!    A complete description of all OpenMP directives accepted may be found
! in the OpenMP Application Program Interface (http://www.openmp.org)
! manual, version 4.0.
  
  
  File: libgomp.info,  Node: Runtime Library Routines,  Next: Environment Variables,  Prev: Enabling OpenMP,  Up: Top
*************** Portable, thread-based, wall clock timer
*** 175,181 ****
  
  File: libgomp.info,  Node: omp_get_active_level,  Next: omp_get_ancestor_thread_num,  Up: Runtime Library Routines
  
! 2.1 `omp_get_active_level' - Number of parallel regions
  =======================================================
  
  _Description_:
--- 173,179 ----
  
  File: libgomp.info,  Node: omp_get_active_level,  Next: omp_get_ancestor_thread_num,  Up: Runtime Library Routines
  
! 2.1 'omp_get_active_level' - Number of parallel regions
  =======================================================
  
  _Description_:
*************** _Description_:
*** 183,192 ****
       blocks, which enclose the calling call.
  
  _C/C++_
!      _Prototype_:  `int omp_get_active_level(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_active_level()'
  
  _See also_:
       *note omp_get_level::, *note omp_get_max_active_levels::, *note
--- 181,190 ----
       blocks, which enclose the calling call.
  
  _C/C++_
!      _Prototype_:   'int omp_get_active_level(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_active_level()'
  
  _See also_:
       *note omp_get_level::, *note omp_get_max_active_levels::, *note
*************** _Reference_:
*** 198,218 ****
  
  File: libgomp.info,  Node: omp_get_ancestor_thread_num,  Next: omp_get_cancellation,  Prev: omp_get_active_level,  Up: Runtime Library Routines
  
! 2.2 `omp_get_ancestor_thread_num' - Ancestor thread ID
  ======================================================
  
  _Description_:
       This function returns the thread identification number for the
       given nesting level of the current thread.  For values of LEVEL
!      outside zero to `omp_get_level' -1 is returned; if LEVEL is
!      `omp_get_level' the result is identical to `omp_get_thread_num'.
  
  _C/C++_
!      _Prototype_:  `int omp_get_ancestor_thread_num(int level);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_ancestor_thread_num(level)'
!                    `integer level'
  
  _See also_:
       *note omp_get_level::, *note omp_get_thread_num::, *note
--- 196,216 ----
  
  File: libgomp.info,  Node: omp_get_ancestor_thread_num,  Next: omp_get_cancellation,  Prev: omp_get_active_level,  Up: Runtime Library Routines
  
! 2.2 'omp_get_ancestor_thread_num' - Ancestor thread ID
  ======================================================
  
  _Description_:
       This function returns the thread identification number for the
       given nesting level of the current thread.  For values of LEVEL
!      outside zero to 'omp_get_level' -1 is returned; if LEVEL is
!      'omp_get_level' the result is identical to 'omp_get_thread_num'.
  
  _C/C++_
!      _Prototype_:   'int omp_get_ancestor_thread_num(int level);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_ancestor_thread_num(level)'
!                     'integer level'
  
  _See also_:
       *note omp_get_level::, *note omp_get_thread_num::, *note
*************** _Reference_:
*** 224,243 ****
  
  File: libgomp.info,  Node: omp_get_cancellation,  Next: omp_get_default_device,  Prev: omp_get_ancestor_thread_num,  Up: Runtime Library Routines
  
! 2.3 `omp_get_cancellation' - Whether cancellation support is enabled
  ====================================================================
  
  _Description_:
!      This function returns `true' if cancellation is activated, `false'
!      otherwise.  Here, `true' and `false' represent their
!      language-specific counterparts.  Unless `OMP_CANCELLATION' is set
       true, cancellations are deactivated.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_cancellation(void);'
  
  _Fortran_:
!      _Interface_:  `logical function omp_get_cancellation()'
  
  _See also_:
       *note OMP_CANCELLATION::
--- 222,241 ----
  
  File: libgomp.info,  Node: omp_get_cancellation,  Next: omp_get_default_device,  Prev: omp_get_ancestor_thread_num,  Up: Runtime Library Routines
  
! 2.3 'omp_get_cancellation' - Whether cancellation support is enabled
  ====================================================================
  
  _Description_:
!      This function returns 'true' if cancellation is activated, 'false'
!      otherwise.  Here, 'true' and 'false' represent their
!      language-specific counterparts.  Unless 'OMP_CANCELLATION' is set
       true, cancellations are deactivated.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_cancellation(void);'
  
  _Fortran_:
!      _Interface_:   'logical function omp_get_cancellation()'
  
  _See also_:
       *note OMP_CANCELLATION::
*************** _Reference_:
*** 248,264 ****
  
  File: libgomp.info,  Node: omp_get_default_device,  Next: omp_get_dynamic,  Prev: omp_get_cancellation,  Up: Runtime Library Routines
  
! 2.4 `omp_get_default_device' - Get the default device for target regions
  ========================================================================
  
  _Description_:
       Get the default device for target regions without device clause.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_default_device(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_default_device()'
  
  _See also_:
       *note OMP_DEFAULT_DEVICE::, *note omp_set_default_device::
--- 246,262 ----
  
  File: libgomp.info,  Node: omp_get_default_device,  Next: omp_get_dynamic,  Prev: omp_get_cancellation,  Up: Runtime Library Routines
  
! 2.4 'omp_get_default_device' - Get the default device for target regions
  ========================================================================
  
  _Description_:
       Get the default device for target regions without device clause.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_default_device(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_default_device()'
  
  _See also_:
       *note OMP_DEFAULT_DEVICE::, *note omp_set_default_device::
*************** _Reference_:
*** 269,291 ****
  
  File: libgomp.info,  Node: omp_get_dynamic,  Next: omp_get_level,  Prev: omp_get_default_device,  Up: Runtime Library Routines
  
! 2.5 `omp_get_dynamic' - Dynamic teams setting
  =============================================
  
  _Description_:
!      This function returns `true' if enabled, `false' otherwise.  Here,
!      `true' and `false' represent their language-specific counterparts.
  
       The dynamic team setting may be initialized at startup by the
!      `OMP_DYNAMIC' environment variable or at runtime using
!      `omp_set_dynamic'.  If undefined, dynamic adjustment is disabled
!      by default.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_dynamic(void);'
  
  _Fortran_:
!      _Interface_:  `logical function omp_get_dynamic()'
  
  _See also_:
       *note omp_set_dynamic::, *note OMP_DYNAMIC::
--- 267,289 ----
  
  File: libgomp.info,  Node: omp_get_dynamic,  Next: omp_get_level,  Prev: omp_get_default_device,  Up: Runtime Library Routines
  
! 2.5 'omp_get_dynamic' - Dynamic teams setting
  =============================================
  
  _Description_:
!      This function returns 'true' if enabled, 'false' otherwise.  Here,
!      'true' and 'false' represent their language-specific counterparts.
  
       The dynamic team setting may be initialized at startup by the
!      'OMP_DYNAMIC' environment variable or at runtime using
!      'omp_set_dynamic'.  If undefined, dynamic adjustment is disabled by
!      default.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_dynamic(void);'
  
  _Fortran_:
!      _Interface_:   'logical function omp_get_dynamic()'
  
  _See also_:
       *note omp_set_dynamic::, *note OMP_DYNAMIC::
*************** _Reference_:
*** 296,302 ****
  
  File: libgomp.info,  Node: omp_get_level,  Next: omp_get_max_active_levels,  Prev: omp_get_dynamic,  Up: Runtime Library Routines
  
! 2.6 `omp_get_level' - Obtain the current nesting level
  ======================================================
  
  _Description_:
--- 294,300 ----
  
  File: libgomp.info,  Node: omp_get_level,  Next: omp_get_max_active_levels,  Prev: omp_get_dynamic,  Up: Runtime Library Routines
  
! 2.6 'omp_get_level' - Obtain the current nesting level
  ======================================================
  
  _Description_:
*************** _Description_:
*** 304,313 ****
       which enclose the calling call.
  
  _C/C++_
!      _Prototype_:  `int omp_get_level(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_level()'
  
  _See also_:
       *note omp_get_active_level::
--- 302,311 ----
       which enclose the calling call.
  
  _C/C++_
!      _Prototype_:   'int omp_get_level(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_level()'
  
  _See also_:
       *note omp_get_active_level::
*************** _Reference_:
*** 318,324 ****
  
  File: libgomp.info,  Node: omp_get_max_active_levels,  Next: omp_get_max_threads,  Prev: omp_get_level,  Up: Runtime Library Routines
  
! 2.7 `omp_get_max_active_levels' - Maximum number of active regions
  ==================================================================
  
  _Description_:
--- 316,322 ----
  
  File: libgomp.info,  Node: omp_get_max_active_levels,  Next: omp_get_max_threads,  Prev: omp_get_level,  Up: Runtime Library Routines
  
! 2.7 'omp_get_max_active_levels' - Maximum number of active regions
  ==================================================================
  
  _Description_:
*************** _Description_:
*** 326,335 ****
       parallel regions.
  
  _C/C++_
!      _Prototype_:  `int omp_get_max_active_levels(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_max_active_levels()'
  
  _See also_:
       *note omp_set_max_active_levels::, *note omp_get_active_level::
--- 324,333 ----
       parallel regions.
  
  _C/C++_
!      _Prototype_:   'int omp_get_max_active_levels(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_max_active_levels()'
  
  _See also_:
       *note omp_set_max_active_levels::, *note omp_get_active_level::
*************** _Reference_:
*** 340,357 ****
  
  File: libgomp.info,  Node: omp_get_max_threads,  Next: omp_get_nested,  Prev: omp_get_max_active_levels,  Up: Runtime Library Routines
  
! 2.8 `omp_get_max_threads' - Maximum number of threads of parallel region
  ========================================================================
  
  _Description_:
       Return the maximum number of threads used for the current parallel
!      region that does not use the clause `num_threads'.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_max_threads(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_max_threads()'
  
  _See also_:
       *note omp_set_num_threads::, *note omp_set_dynamic::, *note
--- 338,355 ----
  
  File: libgomp.info,  Node: omp_get_max_threads,  Next: omp_get_nested,  Prev: omp_get_max_active_levels,  Up: Runtime Library Routines
  
! 2.8 'omp_get_max_threads' - Maximum number of threads of parallel region
  ========================================================================
  
  _Description_:
       Return the maximum number of threads used for the current parallel
!      region that does not use the clause 'num_threads'.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_max_threads(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_max_threads()'
  
  _See also_:
       *note omp_set_num_threads::, *note omp_set_dynamic::, *note
*************** _Reference_:
*** 363,386 ****
  
  File: libgomp.info,  Node: omp_get_nested,  Next: omp_get_num_devices,  Prev: omp_get_max_threads,  Up: Runtime Library Routines
  
! 2.9 `omp_get_nested' - Nested parallel regions
  ==============================================
  
  _Description_:
!      This function returns `true' if nested parallel regions are
!      enabled, `false' otherwise.  Here, `true' and `false' represent
       their language-specific counterparts.
  
       Nested parallel regions may be initialized at startup by the
!      `OMP_NESTED' environment variable or at runtime using
!      `omp_set_nested'.  If undefined, nested parallel regions are
       disabled by default.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_nested(void);'
  
  _Fortran_:
!      _Interface_:  `logical function omp_get_nested()'
  
  _See also_:
       *note omp_set_nested::, *note OMP_NESTED::
--- 361,384 ----
  
  File: libgomp.info,  Node: omp_get_nested,  Next: omp_get_num_devices,  Prev: omp_get_max_threads,  Up: Runtime Library Routines
  
! 2.9 'omp_get_nested' - Nested parallel regions
  ==============================================
  
  _Description_:
!      This function returns 'true' if nested parallel regions are
!      enabled, 'false' otherwise.  Here, 'true' and 'false' represent
       their language-specific counterparts.
  
       Nested parallel regions may be initialized at startup by the
!      'OMP_NESTED' environment variable or at runtime using
!      'omp_set_nested'.  If undefined, nested parallel regions are
       disabled by default.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_nested(void);'
  
  _Fortran_:
!      _Interface_:   'logical function omp_get_nested()'
  
  _See also_:
       *note omp_set_nested::, *note OMP_NESTED::
*************** _Reference_:
*** 391,407 ****
  
  File: libgomp.info,  Node: omp_get_num_devices,  Next: omp_get_num_procs,  Prev: omp_get_nested,  Up: Runtime Library Routines
  
! 2.10 `omp_get_num_devices' - Number of target devices
  =====================================================
  
  _Description_:
       Returns the number of target devices.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_num_devices(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_num_devices()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.25.
--- 389,405 ----
  
  File: libgomp.info,  Node: omp_get_num_devices,  Next: omp_get_num_procs,  Prev: omp_get_nested,  Up: Runtime Library Routines
  
! 2.10 'omp_get_num_devices' - Number of target devices
  =====================================================
  
  _Description_:
       Returns the number of target devices.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_num_devices(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_num_devices()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.25.
*************** _Reference_:
*** 409,425 ****
  
  File: libgomp.info,  Node: omp_get_num_procs,  Next: omp_get_num_teams,  Prev: omp_get_num_devices,  Up: Runtime Library Routines
  
! 2.11 `omp_get_num_procs' - Number of processors online
  ======================================================
  
  _Description_:
       Returns the number of processors online on that device.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_num_procs(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_num_procs()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.5.
--- 407,423 ----
  
  File: libgomp.info,  Node: omp_get_num_procs,  Next: omp_get_num_teams,  Prev: omp_get_num_devices,  Up: Runtime Library Routines
  
! 2.11 'omp_get_num_procs' - Number of processors online
  ======================================================
  
  _Description_:
       Returns the number of processors online on that device.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_num_procs(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_num_procs()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.5.
*************** _Reference_:
*** 427,443 ****
  
  File: libgomp.info,  Node: omp_get_num_teams,  Next: omp_get_num_threads,  Prev: omp_get_num_procs,  Up: Runtime Library Routines
  
! 2.12 `omp_get_num_teams' - Number of teams
  ==========================================
  
  _Description_:
       Returns the number of teams in the current team region.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_num_teams(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_num_teams()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.26.
--- 425,441 ----
  
  File: libgomp.info,  Node: omp_get_num_teams,  Next: omp_get_num_threads,  Prev: omp_get_num_procs,  Up: Runtime Library Routines
  
! 2.12 'omp_get_num_teams' - Number of teams
  ==========================================
  
  _Description_:
       Returns the number of teams in the current team region.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_num_teams(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_num_teams()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.26.
*************** _Reference_:
*** 445,469 ****
  
  File: libgomp.info,  Node: omp_get_num_threads,  Next: omp_get_proc_bind,  Prev: omp_get_num_teams,  Up: Runtime Library Routines
  
! 2.13 `omp_get_num_threads' - Size of the active team
  ====================================================
  
  _Description_:
!      Returns the number of threads in the current team.  In a
!      sequential section of the program `omp_get_num_threads' returns 1.
  
       The default team size may be initialized at startup by the
!      `OMP_NUM_THREADS' environment variable.  At runtime, the size of
!      the current team may be set either by the `NUM_THREADS' clause or
!      by `omp_set_num_threads'.  If none of the above were used to
!      define a specific value and `OMP_DYNAMIC' is disabled, one thread
!      per CPU online is used.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_num_threads(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_num_threads()'
  
  _See also_:
       *note omp_get_max_threads::, *note omp_set_num_threads::, *note
--- 443,467 ----
  
  File: libgomp.info,  Node: omp_get_num_threads,  Next: omp_get_proc_bind,  Prev: omp_get_num_teams,  Up: Runtime Library Routines
  
! 2.13 'omp_get_num_threads' - Size of the active team
  ====================================================
  
  _Description_:
!      Returns the number of threads in the current team.  In a sequential
!      section of the program 'omp_get_num_threads' returns 1.
  
       The default team size may be initialized at startup by the
!      'OMP_NUM_THREADS' environment variable.  At runtime, the size of
!      the current team may be set either by the 'NUM_THREADS' clause or
!      by 'omp_set_num_threads'.  If none of the above were used to define
!      a specific value and 'OMP_DYNAMIC' is disabled, one thread per CPU
!      online is used.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_num_threads(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_num_threads()'
  
  _See also_:
       *note omp_get_max_threads::, *note omp_set_num_threads::, *note
*************** _Reference_:
*** 475,496 ****
  
  File: libgomp.info,  Node: omp_get_proc_bind,  Next: omp_get_schedule,  Prev: omp_get_num_threads,  Up: Runtime Library Routines
  
! 2.14 `omp_get_proc_bind' - Whether theads may be moved between CPUs
  ===================================================================
  
  _Description_:
!      This functions returns the currently active thread affinity
!      policy, which is set via `OMP_PROC_BIND'.  Possible values are
!      `omp_proc_bind_false', `omp_proc_bind_true',
!      `omp_proc_bind_master', `omp_proc_bind_close' and
!      `omp_proc_bind_spread'.
  
  _C/C++_:
!      _Prototype_:  `omp_proc_bind_t omp_get_proc_bind(void);'
  
  _Fortran_:
!      _Interface_:  `integer(kind=omp_proc_bind_kind) function
!                    omp_get_proc_bind()'
  
  _See also_:
       *note OMP_PROC_BIND::, *note OMP_PLACES::, *note
--- 473,494 ----
  
  File: libgomp.info,  Node: omp_get_proc_bind,  Next: omp_get_schedule,  Prev: omp_get_num_threads,  Up: Runtime Library Routines
  
! 2.14 'omp_get_proc_bind' - Whether theads may be moved between CPUs
  ===================================================================
  
  _Description_:
!      This functions returns the currently active thread affinity policy,
!      which is set via 'OMP_PROC_BIND'.  Possible values are
!      'omp_proc_bind_false', 'omp_proc_bind_true',
!      'omp_proc_bind_master', 'omp_proc_bind_close' and
!      'omp_proc_bind_spread'.
  
  _C/C++_:
!      _Prototype_:   'omp_proc_bind_t omp_get_proc_bind(void);'
  
  _Fortran_:
!      _Interface_:   'integer(kind=omp_proc_bind_kind) function
!                     omp_get_proc_bind()'
  
  _See also_:
       *note OMP_PROC_BIND::, *note OMP_PLACES::, *note
*************** _Reference_:
*** 502,524 ****
  
  File: libgomp.info,  Node: omp_get_schedule,  Next: omp_get_team_num,  Prev: omp_get_proc_bind,  Up: Runtime Library Routines
  
! 2.15 `omp_get_schedule' - Obtain the runtime scheduling method
  ==============================================================
  
  _Description_:
       Obtain the runtime scheduling method.  The KIND argument will be
!      set to the value `omp_sched_static', `omp_sched_dynamic',
!      `omp_sched_guided' or `omp_sched_auto'.  The second argument,
       MODIFIER, is set to the chunk size.
  
  _C/C++_
!      _Prototype_:  `void omp_get_schedule(omp_sched_t *kind, int
!                    *modifier);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_get_schedule(kind, modifier)'
!                    `integer(kind=omp_sched_kind) kind'
!                    `integer modifier'
  
  _See also_:
       *note omp_set_schedule::, *note OMP_SCHEDULE::
--- 500,522 ----
  
  File: libgomp.info,  Node: omp_get_schedule,  Next: omp_get_team_num,  Prev: omp_get_proc_bind,  Up: Runtime Library Routines
  
! 2.15 'omp_get_schedule' - Obtain the runtime scheduling method
  ==============================================================
  
  _Description_:
       Obtain the runtime scheduling method.  The KIND argument will be
!      set to the value 'omp_sched_static', 'omp_sched_dynamic',
!      'omp_sched_guided' or 'omp_sched_auto'.  The second argument,
       MODIFIER, is set to the chunk size.
  
  _C/C++_
!      _Prototype_:   'void omp_get_schedule(omp_sched_t *kind, int
!                     *modifier);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_get_schedule(kind, modifier)'
!                     'integer(kind=omp_sched_kind) kind'
!                     'integer modifier'
  
  _See also_:
       *note omp_set_schedule::, *note OMP_SCHEDULE::
*************** _Reference_:
*** 529,545 ****
  
  File: libgomp.info,  Node: omp_get_team_num,  Next: omp_get_team_size,  Prev: omp_get_schedule,  Up: Runtime Library Routines
  
! 2.16 `omp_get_team_num' - Get team number
  =========================================
  
  _Description_:
       Returns the team number of the calling thread.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_team_num(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_team_num()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.27.
--- 527,543 ----
  
  File: libgomp.info,  Node: omp_get_team_num,  Next: omp_get_team_size,  Prev: omp_get_schedule,  Up: Runtime Library Routines
  
! 2.16 'omp_get_team_num' - Get team number
  =========================================
  
  _Description_:
       Returns the team number of the calling thread.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_team_num(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_team_num()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.27.
*************** _Reference_:
*** 547,568 ****
  
  File: libgomp.info,  Node: omp_get_team_size,  Next: omp_get_thread_limit,  Prev: omp_get_team_num,  Up: Runtime Library Routines
  
! 2.17 `omp_get_team_size' - Number of threads in a team
  ======================================================
  
  _Description_:
       This function returns the number of threads in a thread team to
       which either the current thread or its ancestor belongs.  For
!      values of LEVEL outside zero to `omp_get_level', -1 is returned;
!      if LEVEL is zero, 1 is returned, and for `omp_get_level', the
!      result is identical to `omp_get_num_threads'.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_team_size(int level);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_team_size(level)'
!                    `integer level'
  
  _See also_:
       *note omp_get_num_threads::, *note omp_get_level::, *note
--- 545,566 ----
  
  File: libgomp.info,  Node: omp_get_team_size,  Next: omp_get_thread_limit,  Prev: omp_get_team_num,  Up: Runtime Library Routines
  
! 2.17 'omp_get_team_size' - Number of threads in a team
  ======================================================
  
  _Description_:
       This function returns the number of threads in a thread team to
       which either the current thread or its ancestor belongs.  For
!      values of LEVEL outside zero to 'omp_get_level', -1 is returned; if
!      LEVEL is zero, 1 is returned, and for 'omp_get_level', the result
!      is identical to 'omp_get_num_threads'.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_team_size(int level);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_team_size(level)'
!                     'integer level'
  
  _See also_:
       *note omp_get_num_threads::, *note omp_get_level::, *note
*************** _Reference_:
*** 574,590 ****
  
  File: libgomp.info,  Node: omp_get_thread_limit,  Next: omp_get_thread_num,  Prev: omp_get_team_size,  Up: Runtime Library Routines
  
! 2.18 `omp_get_thread_limit' - Maximum number of threads
  =======================================================
  
  _Description_:
       Return the maximum number of threads of the program.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_thread_limit(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_thread_limit()'
  
  _See also_:
       *note omp_get_max_threads::, *note OMP_THREAD_LIMIT::
--- 572,588 ----
  
  File: libgomp.info,  Node: omp_get_thread_limit,  Next: omp_get_thread_num,  Prev: omp_get_team_size,  Up: Runtime Library Routines
  
! 2.18 'omp_get_thread_limit' - Maximum number of threads
  =======================================================
  
  _Description_:
       Return the maximum number of threads of the program.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_thread_limit(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_thread_limit()'
  
  _See also_:
       *note omp_get_max_threads::, *note OMP_THREAD_LIMIT::
*************** _Reference_:
*** 595,615 ****
  
  File: libgomp.info,  Node: omp_get_thread_num,  Next: omp_in_parallel,  Prev: omp_get_thread_limit,  Up: Runtime Library Routines
  
! 2.19 `omp_get_thread_num' - Current thread ID
  =============================================
  
  _Description_:
       Returns a unique thread identification number within the current
!      team.  In a sequential parts of the program, `omp_get_thread_num'
!      always returns 0.  In parallel regions the return value varies
!      from 0 to `omp_get_num_threads'-1 inclusive.  The return value of
!      the master thread of a team is always 0.
  
  _C/C++_:
!      _Prototype_:  `int omp_get_thread_num(void);'
  
  _Fortran_:
!      _Interface_:  `integer function omp_get_thread_num()'
  
  _See also_:
       *note omp_get_num_threads::, *note omp_get_ancestor_thread_num::
--- 593,613 ----
  
  File: libgomp.info,  Node: omp_get_thread_num,  Next: omp_in_parallel,  Prev: omp_get_thread_limit,  Up: Runtime Library Routines
  
! 2.19 'omp_get_thread_num' - Current thread ID
  =============================================
  
  _Description_:
       Returns a unique thread identification number within the current
!      team.  In a sequential parts of the program, 'omp_get_thread_num'
!      always returns 0.  In parallel regions the return value varies from
!      0 to 'omp_get_num_threads'-1 inclusive.  The return value of the
!      master thread of a team is always 0.
  
  _C/C++_:
!      _Prototype_:   'int omp_get_thread_num(void);'
  
  _Fortran_:
!      _Interface_:   'integer function omp_get_thread_num()'
  
  _See also_:
       *note omp_get_num_threads::, *note omp_get_ancestor_thread_num::
*************** _Reference_:
*** 620,638 ****
  
  File: libgomp.info,  Node: omp_in_parallel,  Next: omp_in_final,  Prev: omp_get_thread_num,  Up: Runtime Library Routines
  
! 2.20 `omp_in_parallel' - Whether a parallel region is active
  ============================================================
  
  _Description_:
!      This function returns `true' if currently running in parallel,
!      `false' otherwise.  Here, `true' and `false' represent their
       language-specific counterparts.
  
  _C/C++_:
!      _Prototype_:  `int omp_in_parallel(void);'
  
  _Fortran_:
!      _Interface_:  `logical function omp_in_parallel()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.6.
--- 618,636 ----
  
  File: libgomp.info,  Node: omp_in_parallel,  Next: omp_in_final,  Prev: omp_get_thread_num,  Up: Runtime Library Routines
  
! 2.20 'omp_in_parallel' - Whether a parallel region is active
  ============================================================
  
  _Description_:
!      This function returns 'true' if currently running in parallel,
!      'false' otherwise.  Here, 'true' and 'false' represent their
       language-specific counterparts.
  
  _C/C++_:
!      _Prototype_:   'int omp_in_parallel(void);'
  
  _Fortran_:
!      _Interface_:   'logical function omp_in_parallel()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.6.
*************** _Reference_:
*** 640,658 ****
  
  File: libgomp.info,  Node: omp_in_final,  Next: omp_is_initial_device,  Prev: omp_in_parallel,  Up: Runtime Library Routines
  
! 2.21 `omp_in_final' - Whether in final or included task region
  ==============================================================
  
  _Description_:
!      This function returns `true' if currently running in a final or
!      included task region, `false' otherwise.  Here, `true' and `false'
       represent their language-specific counterparts.
  
  _C/C++_:
!      _Prototype_:  `int omp_in_final(void);'
  
  _Fortran_:
!      _Interface_:  `logical function omp_in_final()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.21.
--- 638,656 ----
  
  File: libgomp.info,  Node: omp_in_final,  Next: omp_is_initial_device,  Prev: omp_in_parallel,  Up: Runtime Library Routines
  
! 2.21 'omp_in_final' - Whether in final or included task region
  ==============================================================
  
  _Description_:
!      This function returns 'true' if currently running in a final or
!      included task region, 'false' otherwise.  Here, 'true' and 'false'
       represent their language-specific counterparts.
  
  _C/C++_:
!      _Prototype_:   'int omp_in_final(void);'
  
  _Fortran_:
!      _Interface_:   'logical function omp_in_final()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.21.
*************** _Reference_:
*** 660,678 ****
  
  File: libgomp.info,  Node: omp_is_initial_device,  Next: omp_set_default_device,  Prev: omp_in_final,  Up: Runtime Library Routines
  
! 2.22 `omp_is_initial_device' - Whether executing on the host device
  ===================================================================
  
  _Description_:
!      This function returns `true' if currently running on the host
!      device, `false' otherwise.  Here, `true' and `false' represent
       their language-specific counterparts.
  
  _C/C++_:
!      _Prototype_:  `int omp_is_initial_device(void);'
  
  _Fortran_:
!      _Interface_:  `logical function omp_is_initial_device()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.28.
--- 658,676 ----
  
  File: libgomp.info,  Node: omp_is_initial_device,  Next: omp_set_default_device,  Prev: omp_in_final,  Up: Runtime Library Routines
  
! 2.22 'omp_is_initial_device' - Whether executing on the host device
  ===================================================================
  
  _Description_:
!      This function returns 'true' if currently running on the host
!      device, 'false' otherwise.  Here, 'true' and 'false' represent
       their language-specific counterparts.
  
  _C/C++_:
!      _Prototype_:   'int omp_is_initial_device(void);'
  
  _Fortran_:
!      _Interface_:   'logical function omp_is_initial_device()'
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 3.2.28.
*************** _Reference_:
*** 680,686 ****
  
  File: libgomp.info,  Node: omp_set_default_device,  Next: omp_set_dynamic,  Prev: omp_is_initial_device,  Up: Runtime Library Routines
  
! 2.23 `omp_set_default_device' - Set the default device for target regions
  =========================================================================
  
  _Description_:
--- 678,684 ----
  
  File: libgomp.info,  Node: omp_set_default_device,  Next: omp_set_dynamic,  Prev: omp_is_initial_device,  Up: Runtime Library Routines
  
! 2.23 'omp_set_default_device' - Set the default device for target regions
  =========================================================================
  
  _Description_:
*************** _Description_:
*** 688,698 ****
       The argument shall be a nonnegative device number.
  
  _C/C++_:
!      _Prototype_:  `void omp_set_default_device(int device_num);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_set_default_device(device_num)'
!                    `integer device_num'
  
  _See also_:
       *note OMP_DEFAULT_DEVICE::, *note omp_get_default_device::
--- 686,696 ----
       The argument shall be a nonnegative device number.
  
  _C/C++_:
!      _Prototype_:   'void omp_set_default_device(int device_num);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_set_default_device(device_num)'
!                     'integer device_num'
  
  _See also_:
       *note OMP_DEFAULT_DEVICE::, *note omp_get_default_device::
*************** _Reference_:
*** 703,723 ****
  
  File: libgomp.info,  Node: omp_set_dynamic,  Next: omp_set_max_active_levels,  Prev: omp_set_default_device,  Up: Runtime Library Routines
  
! 2.24 `omp_set_dynamic' - Enable/disable dynamic teams
  =====================================================
  
  _Description_:
       Enable or disable the dynamic adjustment of the number of threads
       within a team.  The function takes the language-specific equivalent
!      of `true' and `false', where `true' enables dynamic adjustment of
!      team sizes and `false' disables it.
  
  _C/C++_:
!      _Prototype_:  `void omp_set_dynamic(int dynamic_threads);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_set_dynamic(dynamic_threads)'
!                    `logical, intent(in) :: dynamic_threads'
  
  _See also_:
       *note OMP_DYNAMIC::, *note omp_get_dynamic::
--- 701,721 ----
  
  File: libgomp.info,  Node: omp_set_dynamic,  Next: omp_set_max_active_levels,  Prev: omp_set_default_device,  Up: Runtime Library Routines
  
! 2.24 'omp_set_dynamic' - Enable/disable dynamic teams
  =====================================================
  
  _Description_:
       Enable or disable the dynamic adjustment of the number of threads
       within a team.  The function takes the language-specific equivalent
!      of 'true' and 'false', where 'true' enables dynamic adjustment of
!      team sizes and 'false' disables it.
  
  _C/C++_:
!      _Prototype_:   'void omp_set_dynamic(int dynamic_threads);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_set_dynamic(dynamic_threads)'
!                     'logical, intent(in) :: dynamic_threads'
  
  _See also_:
       *note OMP_DYNAMIC::, *note omp_get_dynamic::
*************** _Reference_:
*** 728,734 ****
  
  File: libgomp.info,  Node: omp_set_max_active_levels,  Next: omp_set_nested,  Prev: omp_set_dynamic,  Up: Runtime Library Routines
  
! 2.25 `omp_set_max_active_levels' - Limits the number of active parallel regions
  ===============================================================================
  
  _Description_:
--- 726,732 ----
  
  File: libgomp.info,  Node: omp_set_max_active_levels,  Next: omp_set_nested,  Prev: omp_set_dynamic,  Up: Runtime Library Routines
  
! 2.25 'omp_set_max_active_levels' - Limits the number of active parallel regions
  ===============================================================================
  
  _Description_:
*************** _Description_:
*** 736,746 ****
       parallel regions.
  
  _C/C++_
!      _Prototype_:  `void omp_set_max_active_levels(int max_levels);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_set_max_active_levels(max_levels)'
!                    `integer max_levels'
  
  _See also_:
       *note omp_get_max_active_levels::, *note omp_get_active_level::
--- 734,744 ----
       parallel regions.
  
  _C/C++_
!      _Prototype_:   'void omp_set_max_active_levels(int max_levels);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_set_max_active_levels(max_levels)'
!                     'integer max_levels'
  
  _See also_:
       *note omp_get_max_active_levels::, *note omp_get_active_level::
*************** _Reference_:
*** 751,771 ****
  
  File: libgomp.info,  Node: omp_set_nested,  Next: omp_set_num_threads,  Prev: omp_set_max_active_levels,  Up: Runtime Library Routines
  
! 2.26 `omp_set_nested' - Enable/disable nested parallel regions
  ==============================================================
  
  _Description_:
       Enable or disable nested parallel regions, i.e., whether team
       members are allowed to create new teams.  The function takes the
!      language-specific equivalent of `true' and `false', where `true'
!      enables dynamic adjustment of team sizes and `false' disables it.
  
  _C/C++_:
!      _Prototype_:  `void omp_set_nested(int nested);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_set_nested(nested)'
!                    `logical, intent(in) :: nested'
  
  _See also_:
       *note OMP_NESTED::, *note omp_get_nested::
--- 749,769 ----
  
  File: libgomp.info,  Node: omp_set_nested,  Next: omp_set_num_threads,  Prev: omp_set_max_active_levels,  Up: Runtime Library Routines
  
! 2.26 'omp_set_nested' - Enable/disable nested parallel regions
  ==============================================================
  
  _Description_:
       Enable or disable nested parallel regions, i.e., whether team
       members are allowed to create new teams.  The function takes the
!      language-specific equivalent of 'true' and 'false', where 'true'
!      enables dynamic adjustment of team sizes and 'false' disables it.
  
  _C/C++_:
!      _Prototype_:   'void omp_set_nested(int nested);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_set_nested(nested)'
!                     'logical, intent(in) :: nested'
  
  _See also_:
       *note OMP_NESTED::, *note omp_get_nested::
*************** _Reference_:
*** 776,795 ****
  
  File: libgomp.info,  Node: omp_set_num_threads,  Next: omp_set_schedule,  Prev: omp_set_nested,  Up: Runtime Library Routines
  
! 2.27 `omp_set_num_threads' - Set upper team size limit
  ======================================================
  
  _Description_:
       Specifies the number of threads used by default in subsequent
!      parallel sections, if those do not specify a `num_threads' clause.
!      The argument of `omp_set_num_threads' shall be a positive integer.
  
  _C/C++_:
!      _Prototype_:  `void omp_set_num_threads(int num_threads);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_set_num_threads(num_threads)'
!                    `integer, intent(in) :: num_threads'
  
  _See also_:
       *note OMP_NUM_THREADS::, *note omp_get_num_threads::, *note
--- 774,793 ----
  
  File: libgomp.info,  Node: omp_set_num_threads,  Next: omp_set_schedule,  Prev: omp_set_nested,  Up: Runtime Library Routines
  
! 2.27 'omp_set_num_threads' - Set upper team size limit
  ======================================================
  
  _Description_:
       Specifies the number of threads used by default in subsequent
!      parallel sections, if those do not specify a 'num_threads' clause.
!      The argument of 'omp_set_num_threads' shall be a positive integer.
  
  _C/C++_:
!      _Prototype_:   'void omp_set_num_threads(int num_threads);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_set_num_threads(num_threads)'
!                     'integer, intent(in) :: num_threads'
  
  _See also_:
       *note OMP_NUM_THREADS::, *note omp_get_num_threads::, *note
*************** _Reference_:
*** 801,825 ****
  
  File: libgomp.info,  Node: omp_set_schedule,  Next: omp_init_lock,  Prev: omp_set_num_threads,  Up: Runtime Library Routines
  
! 2.28 `omp_set_schedule' - Set the runtime scheduling method
  ===========================================================
  
  _Description_:
       Sets the runtime scheduling method.  The KIND argument can have the
!      value `omp_sched_static', `omp_sched_dynamic', `omp_sched_guided'
!      or `omp_sched_auto'.  Except for `omp_sched_auto', the chunk size
       is set to the value of MODIFIER if positive, or to the default
!      value if zero or negative.  For `omp_sched_auto' the MODIFIER
       argument is ignored.
  
  _C/C++_
!      _Prototype_:  `void omp_set_schedule(omp_sched_t kind, int
!                    modifier);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_set_schedule(kind, modifier)'
!                    `integer(kind=omp_sched_kind) kind'
!                    `integer modifier'
  
  _See also_:
       *note omp_get_schedule:: *note OMP_SCHEDULE::
--- 799,822 ----
  
  File: libgomp.info,  Node: omp_set_schedule,  Next: omp_init_lock,  Prev: omp_set_num_threads,  Up: Runtime Library Routines
  
! 2.28 'omp_set_schedule' - Set the runtime scheduling method
  ===========================================================
  
  _Description_:
       Sets the runtime scheduling method.  The KIND argument can have the
!      value 'omp_sched_static', 'omp_sched_dynamic', 'omp_sched_guided'
!      or 'omp_sched_auto'.  Except for 'omp_sched_auto', the chunk size
       is set to the value of MODIFIER if positive, or to the default
!      value if zero or negative.  For 'omp_sched_auto' the MODIFIER
       argument is ignored.
  
  _C/C++_
!      _Prototype_:   'void omp_set_schedule(omp_sched_t kind, int modifier);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_set_schedule(kind, modifier)'
!                     'integer(kind=omp_sched_kind) kind'
!                     'integer modifier'
  
  _See also_:
       *note omp_get_schedule:: *note OMP_SCHEDULE::
*************** _Reference_:
*** 830,836 ****
  
  File: libgomp.info,  Node: omp_init_lock,  Next: omp_set_lock,  Prev: omp_set_schedule,  Up: Runtime Library Routines
  
! 2.29 `omp_init_lock' - Initialize simple lock
  =============================================
  
  _Description_:
--- 827,833 ----
  
  File: libgomp.info,  Node: omp_init_lock,  Next: omp_set_lock,  Prev: omp_set_schedule,  Up: Runtime Library Routines
  
! 2.29 'omp_init_lock' - Initialize simple lock
  =============================================
  
  _Description_:
*************** _Description_:
*** 838,848 ****
       unlocked state.
  
  _C/C++_:
!      _Prototype_:  `void omp_init_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_init_lock(svar)'
!                    `integer(omp_lock_kind), intent(out) :: svar'
  
  _See also_:
       *note omp_destroy_lock::
--- 835,845 ----
       unlocked state.
  
  _C/C++_:
!      _Prototype_:   'void omp_init_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_init_lock(svar)'
!                     'integer(omp_lock_kind), intent(out) :: svar'
  
  _See also_:
       *note omp_destroy_lock::
*************** _Reference_:
*** 853,873 ****
  
  File: libgomp.info,  Node: omp_set_lock,  Next: omp_test_lock,  Prev: omp_init_lock,  Up: Runtime Library Routines
  
! 2.30 `omp_set_lock' - Wait for and set simple lock
  ==================================================
  
  _Description_:
!      Before setting a simple lock, the lock variable must be
!      initialized by `omp_init_lock'.  The calling thread is blocked
!      until the lock is available.  If the lock is already held by the
!      current thread, a deadlock occurs.
  
  _C/C++_:
!      _Prototype_:  `void omp_set_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_set_lock(svar)'
!                    `integer(omp_lock_kind), intent(inout) :: svar'
  
  _See also_:
       *note omp_init_lock::, *note omp_test_lock::, *note
--- 850,870 ----
  
  File: libgomp.info,  Node: omp_set_lock,  Next: omp_test_lock,  Prev: omp_init_lock,  Up: Runtime Library Routines
  
! 2.30 'omp_set_lock' - Wait for and set simple lock
  ==================================================
  
  _Description_:
!      Before setting a simple lock, the lock variable must be initialized
!      by 'omp_init_lock'.  The calling thread is blocked until the lock
!      is available.  If the lock is already held by the current thread, a
!      deadlock occurs.
  
  _C/C++_:
!      _Prototype_:   'void omp_set_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_set_lock(svar)'
!                     'integer(omp_lock_kind), intent(inout) :: svar'
  
  _See also_:
       *note omp_init_lock::, *note omp_test_lock::, *note
*************** _Reference_:
*** 879,900 ****
  
  File: libgomp.info,  Node: omp_test_lock,  Next: omp_unset_lock,  Prev: omp_set_lock,  Up: Runtime Library Routines
  
! 2.31 `omp_test_lock' - Test and set simple lock if available
  ============================================================
  
  _Description_:
!      Before setting a simple lock, the lock variable must be
!      initialized by `omp_init_lock'.  Contrary to `omp_set_lock',
!      `omp_test_lock' does not block if the lock is not available.  This
!      function returns `true' upon success, `false' otherwise.  Here,
!      `true' and `false' represent their language-specific counterparts.
  
  _C/C++_:
!      _Prototype_:  `int omp_test_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:  `logical function omp_test_lock(svar)'
!                    `integer(omp_lock_kind), intent(inout) :: svar'
  
  _See also_:
       *note omp_init_lock::, *note omp_set_lock::, *note omp_set_lock::
--- 876,897 ----
  
  File: libgomp.info,  Node: omp_test_lock,  Next: omp_unset_lock,  Prev: omp_set_lock,  Up: Runtime Library Routines
  
! 2.31 'omp_test_lock' - Test and set simple lock if available
  ============================================================
  
  _Description_:
!      Before setting a simple lock, the lock variable must be initialized
!      by 'omp_init_lock'.  Contrary to 'omp_set_lock', 'omp_test_lock'
!      does not block if the lock is not available.  This function returns
!      'true' upon success, 'false' otherwise.  Here, 'true' and 'false'
!      represent their language-specific counterparts.
  
  _C/C++_:
!      _Prototype_:   'int omp_test_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:   'logical function omp_test_lock(svar)'
!                     'integer(omp_lock_kind), intent(inout) :: svar'
  
  _See also_:
       *note omp_init_lock::, *note omp_set_lock::, *note omp_set_lock::
*************** _Reference_:
*** 905,927 ****
  
  File: libgomp.info,  Node: omp_unset_lock,  Next: omp_destroy_lock,  Prev: omp_test_lock,  Up: Runtime Library Routines
  
! 2.32 `omp_unset_lock' - Unset simple lock
  =========================================
  
  _Description_:
       A simple lock about to be unset must have been locked by
!      `omp_set_lock' or `omp_test_lock' before.  In addition, the lock
!      must be held by the thread calling `omp_unset_lock'.  Then, the
!      lock becomes unlocked.  If one or more threads attempted to set
!      the lock before, one of them is chosen to, again, set the lock to
       itself.
  
  _C/C++_:
!      _Prototype_:  `void omp_unset_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_unset_lock(svar)'
!                    `integer(omp_lock_kind), intent(inout) :: svar'
  
  _See also_:
       *note omp_set_lock::, *note omp_test_lock::
--- 902,924 ----
  
  File: libgomp.info,  Node: omp_unset_lock,  Next: omp_destroy_lock,  Prev: omp_test_lock,  Up: Runtime Library Routines
  
! 2.32 'omp_unset_lock' - Unset simple lock
  =========================================
  
  _Description_:
       A simple lock about to be unset must have been locked by
!      'omp_set_lock' or 'omp_test_lock' before.  In addition, the lock
!      must be held by the thread calling 'omp_unset_lock'.  Then, the
!      lock becomes unlocked.  If one or more threads attempted to set the
!      lock before, one of them is chosen to, again, set the lock to
       itself.
  
  _C/C++_:
!      _Prototype_:   'void omp_unset_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_unset_lock(svar)'
!                     'integer(omp_lock_kind), intent(inout) :: svar'
  
  _See also_:
       *note omp_set_lock::, *note omp_test_lock::
*************** _Reference_:
*** 932,938 ****
  
  File: libgomp.info,  Node: omp_destroy_lock,  Next: omp_init_nest_lock,  Prev: omp_unset_lock,  Up: Runtime Library Routines
  
! 2.33 `omp_destroy_lock' - Destroy simple lock
  =============================================
  
  _Description_:
--- 929,935 ----
  
  File: libgomp.info,  Node: omp_destroy_lock,  Next: omp_init_nest_lock,  Prev: omp_unset_lock,  Up: Runtime Library Routines
  
! 2.33 'omp_destroy_lock' - Destroy simple lock
  =============================================
  
  _Description_:
*************** _Description_:
*** 940,950 ****
       must be in the unlocked state.
  
  _C/C++_:
!      _Prototype_:  `void omp_destroy_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_destroy_lock(svar)'
!                    `integer(omp_lock_kind), intent(inout) :: svar'
  
  _See also_:
       *note omp_init_lock::
--- 937,947 ----
       must be in the unlocked state.
  
  _C/C++_:
!      _Prototype_:   'void omp_destroy_lock(omp_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_destroy_lock(svar)'
!                     'integer(omp_lock_kind), intent(inout) :: svar'
  
  _See also_:
       *note omp_init_lock::
*************** _Reference_:
*** 955,961 ****
  
  File: libgomp.info,  Node: omp_init_nest_lock,  Next: omp_set_nest_lock,  Prev: omp_destroy_lock,  Up: Runtime Library Routines
  
! 2.34 `omp_init_nest_lock' - Initialize nested lock
  ==================================================
  
  _Description_:
--- 952,958 ----
  
  File: libgomp.info,  Node: omp_init_nest_lock,  Next: omp_set_nest_lock,  Prev: omp_destroy_lock,  Up: Runtime Library Routines
  
! 2.34 'omp_init_nest_lock' - Initialize nested lock
  ==================================================
  
  _Description_:
*************** _Description_:
*** 963,973 ****
       unlocked state and the nesting count is set to zero.
  
  _C/C++_:
!      _Prototype_:  `void omp_init_nest_lock(omp_nest_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_init_nest_lock(nvar)'
!                    `integer(omp_nest_lock_kind), intent(out) :: nvar'
  
  _See also_:
       *note omp_destroy_nest_lock::
--- 960,970 ----
       unlocked state and the nesting count is set to zero.
  
  _C/C++_:
!      _Prototype_:   'void omp_init_nest_lock(omp_nest_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_init_nest_lock(nvar)'
!                     'integer(omp_nest_lock_kind), intent(out) :: nvar'
  
  _See also_:
       *note omp_destroy_nest_lock::
*************** _Reference_:
*** 978,999 ****
  
  File: libgomp.info,  Node: omp_set_nest_lock,  Next: omp_test_nest_lock,  Prev: omp_init_nest_lock,  Up: Runtime Library Routines
  
! 2.35 `omp_set_nest_lock' - Wait for and set nested lock
  =======================================================
  
  _Description_:
!      Before setting a nested lock, the lock variable must be
!      initialized by `omp_init_nest_lock'.  The calling thread is
!      blocked until the lock is available.  If the lock is already held
!      by the current thread, the nesting count for the lock is
!      incremented.
  
  _C/C++_:
!      _Prototype_:  `void omp_set_nest_lock(omp_nest_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_set_nest_lock(nvar)'
!                    `integer(omp_nest_lock_kind), intent(inout) :: nvar'
  
  _See also_:
       *note omp_init_nest_lock::, *note omp_unset_nest_lock::
--- 975,995 ----
  
  File: libgomp.info,  Node: omp_set_nest_lock,  Next: omp_test_nest_lock,  Prev: omp_init_nest_lock,  Up: Runtime Library Routines
  
! 2.35 'omp_set_nest_lock' - Wait for and set nested lock
  =======================================================
  
  _Description_:
!      Before setting a nested lock, the lock variable must be initialized
!      by 'omp_init_nest_lock'.  The calling thread is blocked until the
!      lock is available.  If the lock is already held by the current
!      thread, the nesting count for the lock is incremented.
  
  _C/C++_:
!      _Prototype_:   'void omp_set_nest_lock(omp_nest_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_set_nest_lock(nvar)'
!                     'integer(omp_nest_lock_kind), intent(inout) :: nvar'
  
  _See also_:
       *note omp_init_nest_lock::, *note omp_unset_nest_lock::
*************** _Reference_:
*** 1004,1026 ****
  
  File: libgomp.info,  Node: omp_test_nest_lock,  Next: omp_unset_nest_lock,  Prev: omp_set_nest_lock,  Up: Runtime Library Routines
  
! 2.36 `omp_test_nest_lock' - Test and set nested lock if available
  =================================================================
  
  _Description_:
!      Before setting a nested lock, the lock variable must be
!      initialized by `omp_init_nest_lock'.  Contrary to
!      `omp_set_nest_lock', `omp_test_nest_lock' does not block if the
!      lock is not available.  If the lock is already held by the current
!      thread, the new nesting count is returned.  Otherwise, the return
!      value equals zero.
  
  _C/C++_:
!      _Prototype_:  `int omp_test_nest_lock(omp_nest_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:  `logical function omp_test_nest_lock(nvar)'
!                    `integer(omp_nest_lock_kind), intent(inout) :: nvar'
  
  _See also_:
       *note omp_init_lock::, *note omp_set_lock::, *note omp_set_lock::
--- 1000,1021 ----
  
  File: libgomp.info,  Node: omp_test_nest_lock,  Next: omp_unset_nest_lock,  Prev: omp_set_nest_lock,  Up: Runtime Library Routines
  
! 2.36 'omp_test_nest_lock' - Test and set nested lock if available
  =================================================================
  
  _Description_:
!      Before setting a nested lock, the lock variable must be initialized
!      by 'omp_init_nest_lock'.  Contrary to 'omp_set_nest_lock',
!      'omp_test_nest_lock' does not block if the lock is not available.
!      If the lock is already held by the current thread, the new nesting
!      count is returned.  Otherwise, the return value equals zero.
  
  _C/C++_:
!      _Prototype_:   'int omp_test_nest_lock(omp_nest_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:   'logical function omp_test_nest_lock(nvar)'
!                     'integer(omp_nest_lock_kind), intent(inout) :: nvar'
  
  _See also_:
       *note omp_init_lock::, *note omp_set_lock::, *note omp_set_lock::
*************** _Reference_:
*** 1031,1054 ****
  
  File: libgomp.info,  Node: omp_unset_nest_lock,  Next: omp_destroy_nest_lock,  Prev: omp_test_nest_lock,  Up: Runtime Library Routines
  
! 2.37 `omp_unset_nest_lock' - Unset nested lock
  ==============================================
  
  _Description_:
       A nested lock about to be unset must have been locked by
!      `omp_set_nested_lock' or `omp_test_nested_lock' before.  In
       addition, the lock must be held by the thread calling
!      `omp_unset_nested_lock'.  If the nesting count drops to zero, the
       lock becomes unlocked.  If one ore more threads attempted to set
       the lock before, one of them is chosen to, again, set the lock to
       itself.
  
  _C/C++_:
!      _Prototype_:  `void omp_unset_nest_lock(omp_nest_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_unset_nest_lock(nvar)'
!                    `integer(omp_nest_lock_kind), intent(inout) :: nvar'
  
  _See also_:
       *note omp_set_nest_lock::
--- 1026,1049 ----
  
  File: libgomp.info,  Node: omp_unset_nest_lock,  Next: omp_destroy_nest_lock,  Prev: omp_test_nest_lock,  Up: Runtime Library Routines
  
! 2.37 'omp_unset_nest_lock' - Unset nested lock
  ==============================================
  
  _Description_:
       A nested lock about to be unset must have been locked by
!      'omp_set_nested_lock' or 'omp_test_nested_lock' before.  In
       addition, the lock must be held by the thread calling
!      'omp_unset_nested_lock'.  If the nesting count drops to zero, the
       lock becomes unlocked.  If one ore more threads attempted to set
       the lock before, one of them is chosen to, again, set the lock to
       itself.
  
  _C/C++_:
!      _Prototype_:   'void omp_unset_nest_lock(omp_nest_lock_t *lock);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_unset_nest_lock(nvar)'
!                     'integer(omp_nest_lock_kind), intent(inout) :: nvar'
  
  _See also_:
       *note omp_set_nest_lock::
*************** _Reference_:
*** 1059,1065 ****
  
  File: libgomp.info,  Node: omp_destroy_nest_lock,  Next: omp_get_wtick,  Prev: omp_unset_nest_lock,  Up: Runtime Library Routines
  
! 2.38 `omp_destroy_nest_lock' - Destroy nested lock
  ==================================================
  
  _Description_:
--- 1054,1060 ----
  
  File: libgomp.info,  Node: omp_destroy_nest_lock,  Next: omp_get_wtick,  Prev: omp_unset_nest_lock,  Up: Runtime Library Routines
  
! 2.38 'omp_destroy_nest_lock' - Destroy nested lock
  ==================================================
  
  _Description_:
*************** _Description_:
*** 1068,1078 ****
       zero.
  
  _C/C++_:
!      _Prototype_:  `void omp_destroy_nest_lock(omp_nest_lock_t *);'
  
  _Fortran_:
!      _Interface_:  `subroutine omp_destroy_nest_lock(nvar)'
!                    `integer(omp_nest_lock_kind), intent(inout) :: nvar'
  
  _See also_:
       *note omp_init_lock::
--- 1063,1073 ----
       zero.
  
  _C/C++_:
!      _Prototype_:   'void omp_destroy_nest_lock(omp_nest_lock_t *);'
  
  _Fortran_:
!      _Interface_:   'subroutine omp_destroy_nest_lock(nvar)'
!                     'integer(omp_nest_lock_kind), intent(inout) :: nvar'
  
  _See also_:
       *note omp_init_lock::
*************** _Reference_:
*** 1083,1089 ****
  
  File: libgomp.info,  Node: omp_get_wtick,  Next: omp_get_wtime,  Prev: omp_destroy_nest_lock,  Up: Runtime Library Routines
  
! 2.39 `omp_get_wtick' - Get timer precision
  ==========================================
  
  _Description_:
--- 1078,1084 ----
  
  File: libgomp.info,  Node: omp_get_wtick,  Next: omp_get_wtime,  Prev: omp_destroy_nest_lock,  Up: Runtime Library Routines
  
! 2.39 'omp_get_wtick' - Get timer precision
  ==========================================
  
  _Description_:
*************** _Description_:
*** 1091,1100 ****
       successive clock ticks.
  
  _C/C++_:
!      _Prototype_:  `double omp_get_wtick(void);'
  
  _Fortran_:
!      _Interface_:  `double precision function omp_get_wtick()'
  
  _See also_:
       *note omp_get_wtime::
--- 1086,1095 ----
       successive clock ticks.
  
  _C/C++_:
!      _Prototype_:   'double omp_get_wtick(void);'
  
  _Fortran_:
!      _Interface_:   'double precision function omp_get_wtick()'
  
  _See also_:
       *note omp_get_wtime::
*************** _Reference_:
*** 1105,1111 ****
  
  File: libgomp.info,  Node: omp_get_wtime,  Prev: omp_get_wtick,  Up: Runtime Library Routines
  
! 2.40 `omp_get_wtime' - Elapsed wall clock time
  ==============================================
  
  _Description_:
--- 1100,1106 ----
  
  File: libgomp.info,  Node: omp_get_wtime,  Prev: omp_get_wtick,  Up: Runtime Library Routines
  
! 2.40 'omp_get_wtime' - Elapsed wall clock time
  ==============================================
  
  _Description_:
*************** _Description_:
*** 1116,1125 ****
       execution of the program.
  
  _C/C++_:
!      _Prototype_:  `double omp_get_wtime(void);'
  
  _Fortran_:
!      _Interface_:  `double precision function omp_get_wtime()'
  
  _See also_:
       *note omp_get_wtick::
--- 1111,1120 ----
       execution of the program.
  
  _C/C++_:
!      _Prototype_:   'double omp_get_wtime(void);'
  
  _Fortran_:
!      _Interface_:   'double precision function omp_get_wtime()'
  
  _See also_:
       *note omp_get_wtick::
*************** File: libgomp.info,  Node: Environment V
*** 1133,1141 ****
  3 Environment Variables
  ***********************
  
! The environment variables which beginning with `OMP_' are defined by
  section 4 of the OpenMP specification in version 4.0, while those
! beginning with `GOMP_' are GNU extensions.
  
  * Menu:
  
--- 1128,1136 ----
  3 Environment Variables
  ***********************
  
! The environment variables which beginning with 'OMP_' are defined by
  section 4 of the OpenMP specification in version 4.0, while those
! beginning with 'GOMP_' are GNU extensions.
  
  * Menu:
  
*************** beginning with `GOMP_' are GNU extension
*** 1160,1172 ****
  
  File: libgomp.info,  Node: OMP_CANCELLATION,  Next: OMP_DISPLAY_ENV,  Up: Environment Variables
  
! 3.1 `OMP_CANCELLATION' - Set whether cancellation is activated
  ==============================================================
  
  _Description_:
!      If set to `TRUE', the cancellation is activated.  If set to
!      `FALSE' or if unset, cancellation is disabled and the `cancel'
!      construct is ignored.
  
  _See also_:
       *note omp_get_cancellation::
--- 1155,1167 ----
  
  File: libgomp.info,  Node: OMP_CANCELLATION,  Next: OMP_DISPLAY_ENV,  Up: Environment Variables
  
! 3.1 'OMP_CANCELLATION' - Set whether cancellation is activated
  ==============================================================
  
  _Description_:
!      If set to 'TRUE', the cancellation is activated.  If set to 'FALSE'
!      or if unset, cancellation is disabled and the 'cancel' construct is
!      ignored.
  
  _See also_:
       *note omp_get_cancellation::
*************** _Reference_:
*** 1177,1191 ****
  
  File: libgomp.info,  Node: OMP_DISPLAY_ENV,  Next: OMP_DEFAULT_DEVICE,  Prev: OMP_CANCELLATION,  Up: Environment Variables
  
! 3.2 `OMP_DISPLAY_ENV' - Show OpenMP version and environment variables
  =====================================================================
  
  _Description_:
!      If set to `TRUE', the OpenMP version number and the values
       associated with the OpenMP environment variables are printed to
!      `stderr'.  If set to `VERBOSE', it additionally shows the value of
       the environment variables which are GNU extensions.  If undefined
!      or set to `FALSE', this information will not be shown.
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 4.12
--- 1172,1186 ----
  
  File: libgomp.info,  Node: OMP_DISPLAY_ENV,  Next: OMP_DEFAULT_DEVICE,  Prev: OMP_CANCELLATION,  Up: Environment Variables
  
! 3.2 'OMP_DISPLAY_ENV' - Show OpenMP version and environment variables
  =====================================================================
  
  _Description_:
!      If set to 'TRUE', the OpenMP version number and the values
       associated with the OpenMP environment variables are printed to
!      'stderr'.  If set to 'VERBOSE', it additionally shows the value of
       the environment variables which are GNU extensions.  If undefined
!      or set to 'FALSE', this information will not be shown.
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 4.12
*************** _Reference_:
*** 1193,1207 ****
  
  File: libgomp.info,  Node: OMP_DEFAULT_DEVICE,  Next: OMP_DYNAMIC,  Prev: OMP_DISPLAY_ENV,  Up: Environment Variables
  
! 3.3 `OMP_DEFAULT_DEVICE' - Set the device used in target regions
  ================================================================
  
  _Description_:
!      Set to choose the device which is used in a `target' region,
!      unless the value is overridden by `omp_set_default_device' or by a
!      `device' clause.  The value shall be the nonnegative device
!      number. If no device with the given device number exists, the code
!      is executed on the host.  If unset, device number 0 will be used.
  
  _See also_:
       *note omp_get_default_device::, *note omp_set_default_device::,
--- 1188,1202 ----
  
  File: libgomp.info,  Node: OMP_DEFAULT_DEVICE,  Next: OMP_DYNAMIC,  Prev: OMP_DISPLAY_ENV,  Up: Environment Variables
  
! 3.3 'OMP_DEFAULT_DEVICE' - Set the device used in target regions
  ================================================================
  
  _Description_:
!      Set to choose the device which is used in a 'target' region, unless
!      the value is overridden by 'omp_set_default_device' or by a
!      'device' clause.  The value shall be the nonnegative device number.
!      If no device with the given device number exists, the code is
!      executed on the host.  If unset, device number 0 will be used.
  
  _See also_:
       *note omp_get_default_device::, *note omp_set_default_device::,
*************** _Reference_:
*** 1212,1225 ****
  
  File: libgomp.info,  Node: OMP_DYNAMIC,  Next: OMP_MAX_ACTIVE_LEVELS,  Prev: OMP_DEFAULT_DEVICE,  Up: Environment Variables
  
! 3.4 `OMP_DYNAMIC' - Dynamic adjustment of threads
  =================================================
  
  _Description_:
       Enable or disable the dynamic adjustment of the number of threads
       within a team.  The value of this environment variable shall be
!      `TRUE' or `FALSE'.  If undefined, dynamic adjustment is disabled
!      by default.
  
  _See also_:
       *note omp_set_dynamic::
--- 1207,1220 ----
  
  File: libgomp.info,  Node: OMP_DYNAMIC,  Next: OMP_MAX_ACTIVE_LEVELS,  Prev: OMP_DEFAULT_DEVICE,  Up: Environment Variables
  
! 3.4 'OMP_DYNAMIC' - Dynamic adjustment of threads
  =================================================
  
  _Description_:
       Enable or disable the dynamic adjustment of the number of threads
       within a team.  The value of this environment variable shall be
!      'TRUE' or 'FALSE'.  If undefined, dynamic adjustment is disabled by
!      default.
  
  _See also_:
       *note omp_set_dynamic::
*************** _Reference_:
*** 1230,1236 ****
  
  File: libgomp.info,  Node: OMP_MAX_ACTIVE_LEVELS,  Next: OMP_NESTED,  Prev: OMP_DYNAMIC,  Up: Environment Variables
  
! 3.5 `OMP_MAX_ACTIVE_LEVELS' - Set the maximum number of nested parallel regions
  ===============================================================================
  
  _Description_:
--- 1225,1231 ----
  
  File: libgomp.info,  Node: OMP_MAX_ACTIVE_LEVELS,  Next: OMP_NESTED,  Prev: OMP_DYNAMIC,  Up: Environment Variables
  
! 3.5 'OMP_MAX_ACTIVE_LEVELS' - Set the maximum number of nested parallel regions
  ===============================================================================
  
  _Description_:
*************** _Reference_:
*** 1247,1259 ****
  
  File: libgomp.info,  Node: OMP_NESTED,  Next: OMP_NUM_THREADS,  Prev: OMP_MAX_ACTIVE_LEVELS,  Up: Environment Variables
  
! 3.6 `OMP_NESTED' - Nested parallel regions
  ==========================================
  
  _Description_:
       Enable or disable nested parallel regions, i.e., whether team
       members are allowed to create new teams.  The value of this
!      environment variable shall be `TRUE' or `FALSE'.  If undefined,
       nested parallel regions are disabled by default.
  
  _See also_:
--- 1242,1254 ----
  
  File: libgomp.info,  Node: OMP_NESTED,  Next: OMP_NUM_THREADS,  Prev: OMP_MAX_ACTIVE_LEVELS,  Up: Environment Variables
  
! 3.6 'OMP_NESTED' - Nested parallel regions
  ==========================================
  
  _Description_:
       Enable or disable nested parallel regions, i.e., whether team
       members are allowed to create new teams.  The value of this
!      environment variable shall be 'TRUE' or 'FALSE'.  If undefined,
       nested parallel regions are disabled by default.
  
  _See also_:
*************** _Reference_:
*** 1265,1279 ****
  
  File: libgomp.info,  Node: OMP_NUM_THREADS,  Next: OMP_PROC_BIND,  Prev: OMP_NESTED,  Up: Environment Variables
  
! 3.7 `OMP_NUM_THREADS' - Specifies the number of threads to use
  ==============================================================
  
  _Description_:
!      Specifies the default number of threads to use in parallel
!      regions.  The value of this variable shall be a comma-separated
!      list of positive integers; the value specified the number of
!      threads to use for the corresponding nested level.  If undefined
!      one thread per CPU is used.
  
  _See also_:
       *note omp_set_num_threads::
--- 1260,1274 ----
  
  File: libgomp.info,  Node: OMP_NUM_THREADS,  Next: OMP_PROC_BIND,  Prev: OMP_NESTED,  Up: Environment Variables
  
! 3.7 'OMP_NUM_THREADS' - Specifies the number of threads to use
  ==============================================================
  
  _Description_:
!      Specifies the default number of threads to use in parallel regions.
!      The value of this variable shall be a comma-separated list of
!      positive integers; the value specified the number of threads to use
!      for the corresponding nested level.  If undefined one thread per
!      CPU is used.
  
  _See also_:
       *note omp_set_num_threads::
*************** _Reference_:
*** 1284,1305 ****
  
  File: libgomp.info,  Node: OMP_PROC_BIND,  Next: OMP_PLACES,  Prev: OMP_NUM_THREADS,  Up: Environment Variables
  
! 3.8 `OMP_PROC_BIND' - Whether theads may be moved between CPUs
  ==============================================================
  
  _Description_:
       Specifies whether threads may be moved between processors.  If set
!      to `TRUE', OpenMP theads should not be moved; if set to `FALSE'
       they may be moved.  Alternatively, a comma separated list with the
!      values `MASTER', `CLOSE' and `SPREAD' can be used to specify the
       thread affinity policy for the corresponding nesting level.  With
!      `MASTER' the worker threads are in the same place partition as the
!      master thread.  With `CLOSE' those are kept close to the master
!      thread in contiguous place partitions.  And with `SPREAD' a sparse
       distribution across the place partitions is used.
  
!      When undefined, `OMP_PROC_BIND' defaults to `TRUE' when
!      `OMP_PLACES' or `GOMP_CPU_AFFINITY' is set and `FALSE' otherwise.
  
  _See also_:
       *note OMP_PLACES::, *note GOMP_CPU_AFFINITY::, *note
--- 1279,1300 ----
  
  File: libgomp.info,  Node: OMP_PROC_BIND,  Next: OMP_PLACES,  Prev: OMP_NUM_THREADS,  Up: Environment Variables
  
! 3.8 'OMP_PROC_BIND' - Whether theads may be moved between CPUs
  ==============================================================
  
  _Description_:
       Specifies whether threads may be moved between processors.  If set
!      to 'TRUE', OpenMP theads should not be moved; if set to 'FALSE'
       they may be moved.  Alternatively, a comma separated list with the
!      values 'MASTER', 'CLOSE' and 'SPREAD' can be used to specify the
       thread affinity policy for the corresponding nesting level.  With
!      'MASTER' the worker threads are in the same place partition as the
!      master thread.  With 'CLOSE' those are kept close to the master
!      thread in contiguous place partitions.  And with 'SPREAD' a sparse
       distribution across the place partitions is used.
  
!      When undefined, 'OMP_PROC_BIND' defaults to 'TRUE' when
!      'OMP_PLACES' or 'GOMP_CPU_AFFINITY' is set and 'FALSE' otherwise.
  
  _See also_:
       *note OMP_PLACES::, *note GOMP_CPU_AFFINITY::, *note
*************** _Reference_:
*** 1311,1329 ****
  
  File: libgomp.info,  Node: OMP_PLACES,  Next: OMP_STACKSIZE,  Prev: OMP_PROC_BIND,  Up: Environment Variables
  
! 3.9 `OMP_PLACES' - Specifies on which CPUs the theads should be placed
  ======================================================================
  
  _Description_:
!      The thread placement can be either specified using an abstract
!      name or by an explicit list of the places.  The abstract names
!      `threads', `cores' and `sockets' can be optionally followed by a
       positive number in parentheses, which denotes the how many places
!      shall be created.  With `threads' each place corresponds to a
!      single hardware thread; `cores' to a single core with the
!      corresponding number of hardware threads; and with `sockets' the
       place corresponds to a single socket.  The resulting placement can
!      be shown by setting the `OMP_DISPLAY_ENV' environment variable.
  
       Alternatively, the placement can be specified explicitly as
       comma-separated list of places.  A place is specified by set of
--- 1306,1324 ----
  
  File: libgomp.info,  Node: OMP_PLACES,  Next: OMP_STACKSIZE,  Prev: OMP_PROC_BIND,  Up: Environment Variables
  
! 3.9 'OMP_PLACES' - Specifies on which CPUs the theads should be placed
  ======================================================================
  
  _Description_:
!      The thread placement can be either specified using an abstract name
!      or by an explicit list of the places.  The abstract names
!      'threads', 'cores' and 'sockets' can be optionally followed by a
       positive number in parentheses, which denotes the how many places
!      shall be created.  With 'threads' each place corresponds to a
!      single hardware thread; 'cores' to a single core with the
!      corresponding number of hardware threads; and with 'sockets' the
       place corresponds to a single socket.  The resulting placement can
!      be shown by setting the 'OMP_DISPLAY_ENV' environment variable.
  
       Alternatively, the placement can be specified explicitly as
       comma-separated list of places.  A place is specified by set of
*************** _Description_:
*** 1336,1346 ****
       after after the hardware thread number or the place.  Optionally,
       the length can be followed by a colon and the stride number -
       otherwise a unit stride is assumed.  For instance, the following
!      specifies the same places list: `"{0,1,2}, {3,4,6}, {7,8,9},
!      {10,11,12}"'; `"{0:3}, {3:3}, {7:3}, {10:3}"'; and `"{0:2}:4:3"'.
  
!      If `OMP_PLACES' and `GOMP_CPU_AFFINITY' are unset and
!      `OMP_PROC_BIND' is either unset or `false', threads may be moved
       between CPUs following no placement policy.
  
  _See also_:
--- 1331,1341 ----
       after after the hardware thread number or the place.  Optionally,
       the length can be followed by a colon and the stride number -
       otherwise a unit stride is assumed.  For instance, the following
!      specifies the same places list: '"{0,1,2}, {3,4,6}, {7,8,9},
!      {10,11,12}"'; '"{0:3}, {3:3}, {7:3}, {10:3}"'; and '"{0:2}:4:3"'.
  
!      If 'OMP_PLACES' and 'GOMP_CPU_AFFINITY' are unset and
!      'OMP_PROC_BIND' is either unset or 'false', threads may be moved
       between CPUs following no placement policy.
  
  _See also_:
*************** _Reference_:
*** 1353,1370 ****
  
  File: libgomp.info,  Node: OMP_STACKSIZE,  Next: OMP_SCHEDULE,  Prev: OMP_PLACES,  Up: Environment Variables
  
! 3.10 `OMP_STACKSIZE' - Set default thread stack size
  ====================================================
  
  _Description_:
       Set the default thread stack size in kilobytes, unless the number
!      is suffixed by `B', `K', `M' or `G', in which case the size is,
!      respectively, in bytes, kilobytes, megabytes or gigabytes.  This
!      is different from `pthread_attr_setstacksize' which gets the
!      number of bytes as an argument.  If the stack size cannot be set
!      due to system constraints, an error is reported and the initial
!      stack size is left unchanged.  If undefined, the stack size is
!      system dependent.
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 4.7
--- 1348,1365 ----
  
  File: libgomp.info,  Node: OMP_STACKSIZE,  Next: OMP_SCHEDULE,  Prev: OMP_PLACES,  Up: Environment Variables
  
! 3.10 'OMP_STACKSIZE' - Set default thread stack size
  ====================================================
  
  _Description_:
       Set the default thread stack size in kilobytes, unless the number
!      is suffixed by 'B', 'K', 'M' or 'G', in which case the size is,
!      respectively, in bytes, kilobytes, megabytes or gigabytes.  This is
!      different from 'pthread_attr_setstacksize' which gets the number of
!      bytes as an argument.  If the stack size cannot be set due to
!      system constraints, an error is reported and the initial stack size
!      is left unchanged.  If undefined, the stack size is system
!      dependent.
  
  _Reference_:
       OpenMP specification v4.0 (http://www.openmp.org/), Section 4.7
*************** _Reference_:
*** 1372,1386 ****
  
  File: libgomp.info,  Node: OMP_SCHEDULE,  Next: OMP_THREAD_LIMIT,  Prev: OMP_STACKSIZE,  Up: Environment Variables
  
! 3.11 `OMP_SCHEDULE' - How threads are scheduled
  ===============================================
  
  _Description_:
!      Allows to specify `schedule type' and `chunk size'.  The value of
!      the variable shall have the form: `type[,chunk]' where `type' is
!      one of `static', `dynamic', `guided' or `auto' The optional
!      `chunk' size shall be a positive integer.  If undefined, dynamic
!      scheduling and a chunk size of 1 is used.
  
  _See also_:
       *note omp_set_schedule::
--- 1367,1381 ----
  
  File: libgomp.info,  Node: OMP_SCHEDULE,  Next: OMP_THREAD_LIMIT,  Prev: OMP_STACKSIZE,  Up: Environment Variables
  
! 3.11 'OMP_SCHEDULE' - How threads are scheduled
  ===============================================
  
  _Description_:
!      Allows to specify 'schedule type' and 'chunk size'.  The value of
!      the variable shall have the form: 'type[,chunk]' where 'type' is
!      one of 'static', 'dynamic', 'guided' or 'auto' The optional 'chunk'
!      size shall be a positive integer.  If undefined, dynamic scheduling
!      and a chunk size of 1 is used.
  
  _See also_:
       *note omp_set_schedule::
*************** _Reference_:
*** 1392,1398 ****
  
  File: libgomp.info,  Node: OMP_THREAD_LIMIT,  Next: OMP_WAIT_POLICY,  Prev: OMP_SCHEDULE,  Up: Environment Variables
  
! 3.12 `OMP_THREAD_LIMIT' - Set the maximum number of threads
  ===========================================================
  
  _Description_:
--- 1387,1393 ----
  
  File: libgomp.info,  Node: OMP_THREAD_LIMIT,  Next: OMP_WAIT_POLICY,  Prev: OMP_SCHEDULE,  Up: Environment Variables
  
! 3.12 'OMP_THREAD_LIMIT' - Set the maximum number of threads
  ===========================================================
  
  _Description_:
*************** _Reference_:
*** 1409,1421 ****
  
  File: libgomp.info,  Node: OMP_WAIT_POLICY,  Next: GOMP_CPU_AFFINITY,  Prev: OMP_THREAD_LIMIT,  Up: Environment Variables
  
! 3.13 `OMP_WAIT_POLICY' - How waiting threads are handled
  ========================================================
  
  _Description_:
       Specifies whether waiting threads should be active or passive.  If
!      the value is `PASSIVE', waiting threads should not consume CPU
!      power while waiting; while the value is `ACTIVE' specifies that
       they should.  If undefined, threads wait actively for a short time
       before waiting passively.
  
--- 1404,1416 ----
  
  File: libgomp.info,  Node: OMP_WAIT_POLICY,  Next: GOMP_CPU_AFFINITY,  Prev: OMP_THREAD_LIMIT,  Up: Environment Variables
  
! 3.13 'OMP_WAIT_POLICY' - How waiting threads are handled
  ========================================================
  
  _Description_:
       Specifies whether waiting threads should be active or passive.  If
!      the value is 'PASSIVE', waiting threads should not consume CPU
!      power while waiting; while the value is 'ACTIVE' specifies that
       they should.  If undefined, threads wait actively for a short time
       before waiting passively.
  
*************** _Reference_:
*** 1428,1434 ****
  
  File: libgomp.info,  Node: GOMP_CPU_AFFINITY,  Next: GOMP_DEBUG,  Prev: OMP_WAIT_POLICY,  Up: Environment Variables
  
! 3.14 `GOMP_CPU_AFFINITY' - Bind threads to specific CPUs
  ========================================================
  
  _Description_:
--- 1423,1429 ----
  
  File: libgomp.info,  Node: GOMP_CPU_AFFINITY,  Next: GOMP_DEBUG,  Prev: OMP_WAIT_POLICY,  Up: Environment Variables
  
! 3.14 'GOMP_CPU_AFFINITY' - Bind threads to specific CPUs
  ========================================================
  
  _Description_:
*************** _Description_:
*** 1436,1461 ****
       space-separated or comma-separated list of CPUs.  This list may
       contain different kinds of entries: either single CPU numbers in
       any order, a range of CPUs (M-N) or a range with some stride
!      (M-N:S).  CPU numbers are zero based.  For example,
!      `GOMP_CPU_AFFINITY="0 3 1-2 4-15:2"' will bind the initial thread
       to CPU 0, the second to CPU 3, the third to CPU 1, the fourth to
       CPU 2, the fifth to CPU 4, the sixth through tenth to CPUs 6, 8,
       10, 12, and 14 respectively and then start assigning back from the
!      beginning of the list.  `GOMP_CPU_AFFINITY=0' binds all threads to
       CPU 0.
  
       There is no libgomp library routine to determine whether a CPU
       affinity specification is in effect.  As a workaround,
!      language-specific library functions, e.g., `getenv' in C or
!      `GET_ENVIRONMENT_VARIABLE' in Fortran, may be used to query the
!      setting of the `GOMP_CPU_AFFINITY' environment variable.  A
!      defined CPU affinity on startup cannot be changed or disabled
!      during the runtime of the application.
  
!      If both `GOMP_CPU_AFFINITY' and `OMP_PROC_BIND' are set,
!      `OMP_PROC_BIND' has a higher precedence.  If neither has been set
!      and `OMP_PROC_BIND' is unset, or when `OMP_PROC_BIND' is set to
!      `FALSE', the host system will handle the assignment of threads to
       CPUs.
  
  _See also_:
--- 1431,1456 ----
       space-separated or comma-separated list of CPUs.  This list may
       contain different kinds of entries: either single CPU numbers in
       any order, a range of CPUs (M-N) or a range with some stride
!      (M-N:S). CPU numbers are zero based.  For example,
!      'GOMP_CPU_AFFINITY="0 3 1-2 4-15:2"' will bind the initial thread
       to CPU 0, the second to CPU 3, the third to CPU 1, the fourth to
       CPU 2, the fifth to CPU 4, the sixth through tenth to CPUs 6, 8,
       10, 12, and 14 respectively and then start assigning back from the
!      beginning of the list.  'GOMP_CPU_AFFINITY=0' binds all threads to
       CPU 0.
  
       There is no libgomp library routine to determine whether a CPU
       affinity specification is in effect.  As a workaround,
!      language-specific library functions, e.g., 'getenv' in C or
!      'GET_ENVIRONMENT_VARIABLE' in Fortran, may be used to query the
!      setting of the 'GOMP_CPU_AFFINITY' environment variable.  A defined
!      CPU affinity on startup cannot be changed or disabled during the
!      runtime of the application.
  
!      If both 'GOMP_CPU_AFFINITY' and 'OMP_PROC_BIND' are set,
!      'OMP_PROC_BIND' has a higher precedence.  If neither has been set
!      and 'OMP_PROC_BIND' is unset, or when 'OMP_PROC_BIND' is set to
!      'FALSE', the host system will handle the assignment of threads to
       CPUs.
  
  _See also_:
*************** _See also_:
*** 1464,1475 ****
  
  File: libgomp.info,  Node: GOMP_DEBUG,  Next: GOMP_STACKSIZE,  Prev: GOMP_CPU_AFFINITY,  Up: Environment Variables
  
! 3.15 `GOMP_DEBUG' - Enable debugging output
  ===========================================
  
  _Description_:
!      Enable debugging output.  The variable should be set to `0'
!      (disabled, also the default if not set), or `1' (enabled).
  
       If enabled, some debugging output will be printed during execution.
       This is currently not specified in more detail, and subject to
--- 1459,1470 ----
  
  File: libgomp.info,  Node: GOMP_DEBUG,  Next: GOMP_STACKSIZE,  Prev: GOMP_CPU_AFFINITY,  Up: Environment Variables
  
! 3.15 'GOMP_DEBUG' - Enable debugging output
  ===========================================
  
  _Description_:
!      Enable debugging output.  The variable should be set to '0'
!      (disabled, also the default if not set), or '1' (enabled).
  
       If enabled, some debugging output will be printed during execution.
       This is currently not specified in more detail, and subject to
*************** _Description_:
*** 1478,1489 ****
  
  File: libgomp.info,  Node: GOMP_STACKSIZE,  Next: GOMP_SPINCOUNT,  Prev: GOMP_DEBUG,  Up: Environment Variables
  
! 3.16 `GOMP_STACKSIZE' - Set default thread stack size
  =====================================================
  
  _Description_:
       Set the default thread stack size in kilobytes.  This is different
!      from `pthread_attr_setstacksize' which gets the number of bytes as
       an argument.  If the stack size cannot be set due to system
       constraints, an error is reported and the initial stack size is
       left unchanged.  If undefined, the stack size is system dependent.
--- 1473,1484 ----
  
  File: libgomp.info,  Node: GOMP_STACKSIZE,  Next: GOMP_SPINCOUNT,  Prev: GOMP_DEBUG,  Up: Environment Variables
  
! 3.16 'GOMP_STACKSIZE' - Set default thread stack size
  =====================================================
  
  _Description_:
       Set the default thread stack size in kilobytes.  This is different
!      from 'pthread_attr_setstacksize' which gets the number of bytes as
       an argument.  If the stack size cannot be set due to system
       constraints, an error is reported and the initial stack size is
       left unchanged.  If undefined, the stack size is system dependent.
*************** _Reference_:
*** 1500,1523 ****
  
  File: libgomp.info,  Node: GOMP_SPINCOUNT,  Prev: GOMP_STACKSIZE,  Up: Environment Variables
  
! 3.17 `GOMP_SPINCOUNT' - Set the busy-wait spin count
  ====================================================
  
  _Description_:
       Determines how long a threads waits actively with consuming CPU
       power before waiting passively without consuming CPU power.  The
!      value may be either `INFINITE', `INFINITY' to always wait actively
       or an integer which gives the number of spins of the busy-wait
       loop.  The integer may optionally be followed by the following
!      suffixes acting as multiplication factors: `k' (kilo, thousand),
!      `M' (mega, million), `G' (giga, billion), or `T' (tera, trillion).
!      If undefined, 0 is used when `OMP_WAIT_POLICY' is `PASSIVE',
!      300,000 is used when `OMP_WAIT_POLICY' is undefined and 30 billion
!      is used when `OMP_WAIT_POLICY' is `ACTIVE'.  If there are more
!      OpenMP threads than available CPUs, 1000 and 100 spins are used
!      for `OMP_WAIT_POLICY' being `ACTIVE' or undefined, respectively;
!      unless the `GOMP_SPINCOUNT' is lower or `OMP_WAIT_POLICY' is
!      `PASSIVE'.
  
  _See also_:
       *note OMP_WAIT_POLICY::
--- 1495,1517 ----
  
  File: libgomp.info,  Node: GOMP_SPINCOUNT,  Prev: GOMP_STACKSIZE,  Up: Environment Variables
  
! 3.17 'GOMP_SPINCOUNT' - Set the busy-wait spin count
  ====================================================
  
  _Description_:
       Determines how long a threads waits actively with consuming CPU
       power before waiting passively without consuming CPU power.  The
!      value may be either 'INFINITE', 'INFINITY' to always wait actively
       or an integer which gives the number of spins of the busy-wait
       loop.  The integer may optionally be followed by the following
!      suffixes acting as multiplication factors: 'k' (kilo, thousand),
!      'M' (mega, million), 'G' (giga, billion), or 'T' (tera, trillion).
!      If undefined, 0 is used when 'OMP_WAIT_POLICY' is 'PASSIVE',
!      300,000 is used when 'OMP_WAIT_POLICY' is undefined and 30 billion
!      is used when 'OMP_WAIT_POLICY' is 'ACTIVE'.  If there are more
!      OpenMP threads than available CPUs, 1000 and 100 spins are used for
!      'OMP_WAIT_POLICY' being 'ACTIVE' or undefined, respectively; unless
!      the 'GOMP_SPINCOUNT' is lower or 'OMP_WAIT_POLICY' is 'PASSIVE'.
  
  _See also_:
       *note OMP_WAIT_POLICY::
*************** File: libgomp.info,  Node: The libgomp A
*** 1528,1535 ****
  4 The libgomp ABI
  *****************
  
! The following sections present notes on the external ABI as presented
! by libgomp.  Only maintainers should need them.
  
  * Menu:
  
--- 1522,1529 ----
  4 The libgomp ABI
  *****************
  
! The following sections present notes on the external ABI as presented by
! libgomp.  Only maintainers should need them.
  
  * Menu:
  
*************** File: libgomp.info,  Node: Implementing
*** 1589,1595 ****
  4.3 Implementing ATOMIC construct
  =================================
  
! The target should implement the `__sync' builtins.
  
     Failing that we could add
  
--- 1583,1589 ----
  4.3 Implementing ATOMIC construct
  =================================
  
! The target should implement the '__sync' builtins.
  
     Failing that we could add
  
*************** File: libgomp.info,  Node: Implementing
*** 1605,1611 ****
  4.4 Implementing FLUSH construct
  ================================
  
! Expands to the `__sync_synchronize' builtin.
  
  
  File: libgomp.info,  Node: Implementing BARRIER construct,  Next: Implementing THREADPRIVATE construct,  Prev: Implementing FLUSH construct,  Up: The libgomp ABI
--- 1599,1605 ----
  4.4 Implementing FLUSH construct
  ================================
  
! Expands to the '__sync_synchronize' builtin.
  
  
  File: libgomp.info,  Node: Implementing BARRIER construct,  Next: Implementing THREADPRIVATE construct,  Prev: Implementing FLUSH construct,  Up: The libgomp ABI
*************** File: libgomp.info,  Node: Implementing
*** 1621,1630 ****
  4.6 Implementing THREADPRIVATE construct
  ========================================
  
! In _most_ cases we can map this directly to `__thread'.  Except that
! OMP allows constructors for C++ objects.  We can either refuse to
! support this (how often is it used?) or we can implement something akin
! to .ctors.
  
     Even more ideally, this ctor feature is handled by extensions to the
  main pthreads library.  Failing that, we can have a set of entry points
--- 1615,1624 ----
  4.6 Implementing THREADPRIVATE construct
  ========================================
  
! In _most_ cases we can map this directly to '__thread'.  Except that OMP
! allows constructors for C++ objects.  We can either refuse to support
! this (how often is it used?)  or we can implement something akin to
! .ctors.
  
     Even more ideally, this ctor feature is handled by extensions to the
  main pthreads library.  Failing that, we can have a set of entry points
*************** copy in values for scalar and "small" st
*** 1656,1663 ****
  others TREE_ADDRESSABLE types.  In the subfunction, copy the value into
  the local variable.
  
!    It is not clear what to do with bare FOR or SECTION blocks.  The
! only thing I can figure is that we do something like:
  
       #pragma omp for firstprivate(x) lastprivate(y)
       for (int i = 0; i < n; ++i)
--- 1650,1657 ----
  others TREE_ADDRESSABLE types.  In the subfunction, copy the value into
  the local variable.
  
!    It is not clear what to do with bare FOR or SECTION blocks.  The only
! thing I can figure is that we do something like:
  
       #pragma omp for firstprivate(x) lastprivate(y)
       for (int i = 0; i < n; ++i)
*************** only thing I can figure is that we do so
*** 1675,1682 ****
       }
  
     where the "x=x" and "y=y" assignments actually have different uids
! for the two variables, i.e. not something you could write directly in
! C.  Presumably this only makes sense if the "outer" x and y are global
  variables.
  
     COPYPRIVATE would work the same way, except the structure broadcast
--- 1669,1676 ----
       }
  
     where the "x=x" and "y=y" assignments actually have different uids
! for the two variables, i.e.  not something you could write directly in
! C. Presumably this only makes sense if the "outer" x and y are global
  variables.
  
     COPYPRIVATE would work the same way, except the structure broadcast
*************** File: libgomp.info,  Node: Implementing
*** 1689,1698 ****
  =================================
  
  The private struct mentioned in the previous section should have a
! pointer to an array of the type of the variable, indexed by the
! thread's TEAM_ID.  The thread stores its final value into the array,
! and after the barrier, the master thread iterates over the array to
! collect the values.
  
  
  File: libgomp.info,  Node: Implementing PARALLEL construct,  Next: Implementing FOR construct,  Prev: Implementing REDUCTION clause,  Up: The libgomp ABI
--- 1683,1692 ----
  =================================
  
  The private struct mentioned in the previous section should have a
! pointer to an array of the type of the variable, indexed by the thread's
! TEAM_ID.  The thread stores its final value into the array, and after
! the barrier, the master thread iterates over the array to collect the
! values.
  
  
  File: libgomp.info,  Node: Implementing PARALLEL construct,  Next: Implementing FOR construct,  Prev: Implementing REDUCTION clause,  Up: The libgomp ABI
*************** FIRSTPRIVATE et al.
*** 1729,1742 ****
     The NUM_THREADS argument is 1 if an IF clause is present and false,
  or the value of the NUM_THREADS clause, if present, or 0.
  
!    The function needs to create the appropriate number of threads
! and/or launch them from the dock.  It needs to create the team
! structure and assign team ids.
  
         void GOMP_parallel_end (void)
  
     Tears down the team and returns us to the previous
! `omp_in_parallel()' state.
  
  
  File: libgomp.info,  Node: Implementing FOR construct,  Next: Implementing ORDERED construct,  Prev: Implementing PARALLEL construct,  Up: The libgomp ABI
--- 1723,1736 ----
     The NUM_THREADS argument is 1 if an IF clause is present and false,
  or the value of the NUM_THREADS clause, if present, or 0.
  
!    The function needs to create the appropriate number of threads and/or
! launch them from the dock.  It needs to create the team structure and
! assign team ids.
  
         void GOMP_parallel_end (void)
  
     Tears down the team and returns us to the previous
! 'omp_in_parallel()' state.
  
  
  File: libgomp.info,  Node: Implementing FOR construct,  Next: Implementing ORDERED construct,  Prev: Implementing PARALLEL construct,  Up: The libgomp ABI
*************** non-constant STEP, there isn't really.
*** 1788,1801 ****
  evaluate it as many times as we want, and any variables involved should
  automatically be handled as PRIVATE or SHARED like any other variables.
  So the expression should remain evaluable in the subfunction.  We can
! also pull it into a local variable if we like, but since its supposed
! to remain unchanged, we can also not if we like.
  
!    If we have SCHEDULE(STATIC), and no ORDERED, then we ought to be
! able to get away with no work-sharing context at all, since we can
! simply perform the arithmetic directly in each thread to divide up the
! iterations.  Which would mean that we wouldn't need to call any of
! these routines.
  
     There are separate routines for handling loops with an ORDERED
  clause.  Bookkeeping for that is non-trivial...
--- 1782,1795 ----
  evaluate it as many times as we want, and any variables involved should
  automatically be handled as PRIVATE or SHARED like any other variables.
  So the expression should remain evaluable in the subfunction.  We can
! also pull it into a local variable if we like, but since its supposed to
! remain unchanged, we can also not if we like.
  
!    If we have SCHEDULE(STATIC), and no ORDERED, then we ought to be able
! to get away with no work-sharing context at all, since we can simply
! perform the arithmetic directly in each thread to divide up the
! iterations.  Which would mean that we wouldn't need to call any of these
! routines.
  
     There are separate routines for handling loops with an ORDERED
  clause.  Bookkeeping for that is non-trivial...
*************** File: libgomp.info,  Node: Reporting Bug
*** 1889,1896 ****
  
  Bugs in the GNU Offloading and Multi Processing Runtime Library should
  be reported via Bugzilla (http://gcc.gnu.org/bugzilla/).  Please add
! "openacc", or "openmp", or both to the keywords field in the bug
! report, as appropriate.
  
  
  File: libgomp.info,  Node: Copying,  Next: GNU Free Documentation License,  Prev: Reporting Bugs,  Up: Top
--- 1883,1890 ----
  
  Bugs in the GNU Offloading and Multi Processing Runtime Library should
  be reported via Bugzilla (http://gcc.gnu.org/bugzilla/).  Please add
! "openacc", or "openmp", or both to the keywords field in the bug report,
! as appropriate.
  
  
  File: libgomp.info,  Node: Copying,  Next: GNU Free Documentation License,  Prev: Reporting Bugs,  Up: Top
*************** GNU General Public License
*** 1900,1906 ****
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
--- 1894,1900 ----
  
                          Version 3, 29 June 2007
  
!      Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies of this
       license document, but changing it is not allowed.
*************** want it, that you can change the softwar
*** 1928,1936 ****
  free programs, and that you know you can do these things.
  
     To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you
! have certain responsibilities if you distribute copies of the software,
! or if you modify it: responsibilities to respect the freedom of others.
  
     For example, if you distribute copies of such a program, whether
  gratis or for a fee, you must pass on to the recipients the same
--- 1922,1930 ----
  free programs, and that you know you can do these things.
  
     To protect your rights, we need to prevent others from denying you
! these rights or asking you to surrender the rights.  Therefore, you have
! certain responsibilities if you distribute copies of the software, or if
! you modify it: responsibilities to respect the freedom of others.
  
     For example, if you distribute copies of such a program, whether
  gratis or for a fee, you must pass on to the recipients the same
*************** changed, so that their problems will not
*** 1949,1964 ****
  authors of previous versions.
  
     Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the
! manufacturer can do so.  This is fundamentally incompatible with the
! aim of protecting users' freedom to change the software.  The
! systematic pattern of such abuse occurs in the area of products for
! individuals to use, which is precisely where it is most unacceptable.
! Therefore, we have designed this version of the GPL to prohibit the
! practice for those products.  If such problems arise substantially in
! other domains, we stand ready to extend this provision to those domains
! in future versions of the GPL, as needed to protect the freedom of
! users.
  
     Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
--- 1943,1957 ----
  authors of previous versions.
  
     Some devices are designed to deny users access to install or run
! modified versions of the software inside them, although the manufacturer
! can do so.  This is fundamentally incompatible with the aim of
! protecting users' freedom to change the software.  The systematic
! pattern of such abuse occurs in the area of products for individuals to
! use, which is precisely where it is most unacceptable.  Therefore, we
! have designed this version of the GPL to prohibit the practice for those
! products.  If such problems arise substantially in other domains, we
! stand ready to extend this provision to those domains in future versions
! of the GPL, as needed to protect the freedom of users.
  
     Finally, every program is threatened constantly by software patents.
  States should not allow patents to restrict development and use of
*************** TERMS AND CONDITIONS
*** 1995,2002 ****
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it
!      on a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
--- 1988,1995 ----
  
       To "propagate" a work means to do anything with it that, without
       permission, would make you directly or secondarily liable for
!      infringement under applicable copyright law, except executing it on
!      a computer or modifying a private copy.  Propagation includes
       copying, distribution (with or without modification), making
       available to the public, and in some countries other activities as
       well.
*************** TERMS AND CONDITIONS
*** 2010,2017 ****
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may
!      convey the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
--- 2003,2010 ----
       to the extent that it includes a convenient and prominently visible
       feature that (1) displays an appropriate copyright notice, and (2)
       tells the user that there is no warranty for the work (except to
!      the extent that warranties are provided), that licensees may convey
!      the work under this License, and how to view a copy of this
       License.  If the interface presents a list of user commands or
       options, such as a menu, a prominent item in the list meets this
       criterion.
*************** TERMS AND CONDITIONS
*** 2019,2026 ****
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any
!      non-source form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
--- 2012,2019 ----
    1. Source Code.
  
       The "source code" for a work means the preferred form of the work
!      for making modifications to it.  "Object code" means any non-source
!      form of a work.
  
       A "Standard Interface" means an interface that either is an
       official standard defined by a recognized standards body, or, in
*************** TERMS AND CONDITIONS
*** 2031,2040 ****
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work
!      with that Major Component, or to implement a Standard Interface
!      for which an implementation is available to the public in source
!      code form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
--- 2024,2033 ----
       The "System Libraries" of an executable work include anything,
       other than the work as a whole, that (a) is included in the normal
       form of packaging a Major Component, but which is not part of that
!      Major Component, and (b) serves only to enable use of the work with
!      that Major Component, or to implement a Standard Interface for
!      which an implementation is available to the public in source code
!      form.  A "Major Component", in this context, means a major
       essential component (kernel, window system, and so on) of the
       specific operating system (if any) on which the executable work
       runs, or a compiler used to produce the work, or an object code
*************** TERMS AND CONDITIONS
*** 2042,2056 ****
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including
!      scripts to control those activities.  However, it does not include
!      the work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files
!      associated with source files for the work, and the source code for
!      shared libraries and dynamically linked subprograms that the work
!      is specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
--- 2035,2049 ----
  
       The "Corresponding Source" for a work in object code form means all
       the source code needed to generate, install, and (for an executable
!      work) run the object code and to modify the work, including scripts
!      to control those activities.  However, it does not include the
!      work's System Libraries, or general-purpose tools or generally
       available free programs which are used unmodified in performing
       those activities but which are not part of the work.  For example,
!      Corresponding Source includes interface definition files associated
!      with source files for the work, and the source code for shared
!      libraries and dynamically linked subprograms that the work is
!      specifically designed to require, such as by intimate data
       communication or control flow between those subprograms and other
       parts of the work.
  
*************** TERMS AND CONDITIONS
*** 2067,2088 ****
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output,
!      given its content, constitutes a covered work.  This License
!      acknowledges your rights of fair use or other equivalent, as
!      provided by copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for
!      you, or provide you with facilities for running those works,
!      provided that you comply with the terms of this License in
!      conveying all material for which you do not control copyright.
!      Those thus making or running the covered works for you must do so
!      exclusively on your behalf, under your direction and control, on
!      terms that prohibit them from making any copies of your
!      copyrighted material outside their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
--- 2060,2081 ----
       copyright on the Program, and are irrevocable provided the stated
       conditions are met.  This License explicitly affirms your unlimited
       permission to run the unmodified Program.  The output from running
!      a covered work is covered by this License only if the output, given
!      its content, constitutes a covered work.  This License acknowledges
!      your rights of fair use or other equivalent, as provided by
!      copyright law.
  
       You may make, run and propagate covered works that you do not
       convey, without conditions so long as your license otherwise
       remains in force.  You may convey covered works to others for the
!      sole purpose of having them make modifications exclusively for you,
!      or provide you with facilities for running those works, provided
!      that you comply with the terms of this License in conveying all
!      material for which you do not control copyright.  Those thus making
!      or running the covered works for you must do so exclusively on your
!      behalf, under your direction and control, on terms that prohibit
!      them from making any copies of your copyrighted material outside
!      their relationship with you.
  
       Conveying under any other circumstances is permitted solely under
       the conditions stated below.  Sublicensing is not allowed; section
*************** TERMS AND CONDITIONS
*** 2099,2106 ****
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention
!      to limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
--- 2092,2099 ----
       When you convey a covered work, you waive any legal power to forbid
       circumvention of technological measures to the extent such
       circumvention is effected by exercising rights under this License
!      with respect to the covered work, and you disclaim any intention to
!      limit operation or modification of the work as a means of
       enforcing, against the work's users, your or third parties' legal
       rights to forbid circumvention of technological measures.
  
*************** TERMS AND CONDITIONS
*** 2170,2177 ****
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for
!           as long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
--- 2163,2170 ----
  
         b. Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
!           written offer, valid for at least three years and valid for as
!           long as you offer spare parts or customer support for that
            product model, to give anyone who possesses the object code
            either (1) a copy of the Corresponding Source for all the
            software in the product that is covered by this License, on a
*************** TERMS AND CONDITIONS
*** 2181,2212 ****
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of
!           the written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access
!           to the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated
!           by you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to
!           the object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long
!           as needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
- 
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
--- 2174,2204 ----
            to copy the Corresponding Source from a network server at no
            charge.
  
!        c. Convey individual copies of the object code with a copy of the
!           written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially,
            and only if you received the object code with such an offer,
            in accord with subsection 6b.
  
         d. Convey the object code by offering access from a designated
!           place (gratis or for a charge), and offer equivalent access to
!           the Corresponding Source in the same way through the same
            place at no further charge.  You need not require recipients
            to copy the Corresponding Source along with the object code.
            If the place to copy the object code is a network server, the
!           Corresponding Source may be on a different server (operated by
!           you or a third party) that supports equivalent copying
!           facilities, provided you maintain clear directions next to the
!           object code saying where to find the Corresponding Source.
            Regardless of what server hosts the Corresponding Source, you
!           remain obligated to ensure that it is available for as long as
!           needed to satisfy these requirements.
  
         e. Convey the object code using peer-to-peer transmission,
            provided you inform other peers where the object code and
            Corresponding Source of the work are being offered to the
            general public at no charge under subsection 6d.
  
       A separable portion of the object code, whose source code is
       excluded from the Corresponding Source as a System Library, need
       not be included in conveying the object code work.
*************** TERMS AND CONDITIONS
*** 2214,2221 ****
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product
!      is a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
--- 2206,2213 ----
       A "User Product" is either (1) a "consumer product", which means
       any tangible personal property which is normally used for personal,
       family, or household purposes, or (2) anything designed or sold for
!      incorporation into a dwelling.  In determining whether a product is
!      a consumer product, doubtful cases shall be resolved in favor of
       coverage.  For a particular product received by a particular user,
       "normally used" refers to a typical or common use of that class of
       product, regardless of the status of the particular user or of the
*************** TERMS AND CONDITIONS
*** 2246,2256 ****
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or
!      installed by the recipient, or for the User Product in which it
!      has been modified or installed.  Access to a network may be denied
!      when the modification itself materially and adversely affects the
!      operation of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
--- 2238,2248 ----
  
       The requirement to provide Installation Information does not
       include a requirement to continue to provide support service,
!      warranty, or updates for a work that has been modified or installed
!      by the recipient, or for the User Product in which it has been
!      modified or installed.  Access to a network may be denied when the
!      modification itself materially and adversely affects the operation
!      of the network or violates the rules and protocols for
       communication across the network.
  
       Corresponding Source conveyed, and Installation Information
*************** TERMS AND CONDITIONS
*** 2280,2287 ****
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License
!      with terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
--- 2272,2279 ----
  
       Notwithstanding any other provision of this License, for material
       you add to a covered work, you may (if authorized by the copyright
!      holders of that material) supplement the terms of this License with
!      terms:
  
         a. Disclaiming warranty or limiting liability differently from
            the terms of sections 15 and 16 of this License; or
*************** TERMS AND CONDITIONS
*** 2291,2299 ****
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be
!           marked in reasonable ways as different from the original
!           version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
--- 2283,2290 ----
            Legal Notices displayed by works containing it; or
  
         c. Prohibiting misrepresentation of the origin of that material,
!           or requiring that modified versions of such material be marked
!           in reasonable ways as different from the original version; or
  
         d. Limiting the use for publicity purposes of names of licensors
            or authors of the material; or
*************** TERMS AND CONDITIONS
*** 2312,2322 ****
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or
!      conveying under this License, you may add to a covered work
!      material governed by the terms of that license document, provided
!      that the further restriction does not survive such relicensing or
!      conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
--- 2303,2312 ----
       you received it, or any part of it, contains a notice stating that
       it is governed by this License along with a term that is a further
       restriction, you may remove that term.  If a license document
!      contains a further restriction but permits relicensing or conveying
!      under this License, you may add to a covered work material governed
!      by the terms of that license document, provided that the further
!      restriction does not survive such relicensing or conveying.
  
       If you add terms to a covered work in accord with this section, you
       must place, in the relevant source files, a statement of the
*************** TERMS AND CONDITIONS
*** 2332,2344 ****
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under
!      the third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 2322,2334 ----
       You may not propagate or modify a covered work except as expressly
       provided under this License.  Any attempt otherwise to propagate or
       modify it is void, and will automatically terminate your rights
!      under this License (including any patent licenses granted under the
!      third paragraph of section 11).
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** TERMS AND CONDITIONS
*** 2350,2359 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, you do not qualify to receive new
!      licenses for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
--- 2340,2349 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, you do not qualify to receive new licenses
!      for the same material under section 10.
  
    9. Acceptance Not Required for Having Copies.
  
*************** TERMS AND CONDITIONS
*** 2367,2373 ****
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!  10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
--- 2357,2363 ----
       by modifying or propagating a covered work, you indicate your
       acceptance of this License to do so.
  
!   10. Automatic Licensing of Downstream Recipients.
  
       Each time you convey a covered work, the recipient automatically
       receives a license from the original licensors, to run, modify and
*************** TERMS AND CONDITIONS
*** 2381,2401 ****
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to
!      possession of the Corresponding Source of the work from the
!      predecessor in interest, if the predecessor has it or can get it
!      with reasonable efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for
!      exercise of rights granted under this License, and you may not
!      initiate litigation (including a cross-claim or counterclaim in a
!      lawsuit) alleging that any patent claim is infringed by making,
!      using, selling, offering for sale, or importing the Program or any
!      portion of it.
  
!  11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
--- 2371,2391 ----
       covered work results from an entity transaction, each party to that
       transaction who receives a copy of the work also receives whatever
       licenses to the work the party's predecessor in interest had or
!      could give under the previous paragraph, plus a right to possession
!      of the Corresponding Source of the work from the predecessor in
!      interest, if the predecessor has it or can get it with reasonable
!      efforts.
  
       You may not impose any further restrictions on the exercise of the
       rights granted or affirmed under this License.  For example, you
!      may not impose a license fee, royalty, or other charge for exercise
!      of rights granted under this License, and you may not initiate
!      litigation (including a cross-claim or counterclaim in a lawsuit)
!      alleging that any patent claim is infringed by making, using,
!      selling, offering for sale, or importing the Program or any portion
!      of it.
  
!   11. Patents.
  
       A "contributor" is a copyright holder who authorizes use under this
       License of the Program or a work on which the Program is based.
*************** TERMS AND CONDITIONS
*** 2415,2429 ****
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its
!      contributor version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To
!      "grant" such a patent license to a party means to make such an
!      agreement or commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
--- 2405,2419 ----
       Each contributor grants you a non-exclusive, worldwide,
       royalty-free patent license under the contributor's essential
       patent claims, to make, use, sell, offer for sale, import and
!      otherwise run, modify and propagate the contents of its contributor
!      version.
  
       In the following three paragraphs, a "patent license" is any
       express agreement or commitment, however denominated, not to
       enforce a patent (such as an express permission to practice a
!      patent or covenant not to sue for patent infringement).  To "grant"
!      such a patent license to a party means to make such an agreement or
!      commitment not to enforce a patent against the party.
  
       If you convey a covered work, knowingly relying on a patent
       license, and the Corresponding Source of the work is not available
*************** TERMS AND CONDITIONS
*** 2453,2488 ****
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under
!      which you make payment to the third party based on the extent of
!      your activity of conveying the work, and under which the third
!      party grants, to any of the parties who would receive the covered
!      work from you, a discriminatory patent license (a) in connection
!      with copies of the covered work conveyed by you (or copies made
!      from those copies), or (b) primarily for and in connection with
!      specific products or compilations that contain the covered work,
!      unless you entered into that arrangement, or that patent license
!      was granted, prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!  12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order,
!      agreement or otherwise) that contradict the conditions of this
!      License, they do not excuse you from the conditions of this
!      License.  If you cannot convey a covered work so as to satisfy
!      simultaneously your obligations under this License and any other
!      pertinent obligations, then as a consequence you may not convey it
!      at all.  For example, if you agree to terms that obligate you to
!      collect a royalty for further conveying from those to whom you
!      convey the Program, the only way you could satisfy both those
!      terms and this License would be to refrain entirely from conveying
!      the Program.
  
!  13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
--- 2443,2477 ----
       conditioned on the non-exercise of one or more of the rights that
       are specifically granted under this License.  You may not convey a
       covered work if you are a party to an arrangement with a third
!      party that is in the business of distributing software, under which
!      you make payment to the third party based on the extent of your
!      activity of conveying the work, and under which the third party
!      grants, to any of the parties who would receive the covered work
!      from you, a discriminatory patent license (a) in connection with
!      copies of the covered work conveyed by you (or copies made from
!      those copies), or (b) primarily for and in connection with specific
!      products or compilations that contain the covered work, unless you
!      entered into that arrangement, or that patent license was granted,
!      prior to 28 March 2007.
  
       Nothing in this License shall be construed as excluding or limiting
       any implied license or other defenses to infringement that may
       otherwise be available to you under applicable patent law.
  
!   12. No Surrender of Others' Freedom.
  
!      If conditions are imposed on you (whether by court order, agreement
!      or otherwise) that contradict the conditions of this License, they
!      do not excuse you from the conditions of this License.  If you
!      cannot convey a covered work so as to satisfy simultaneously your
!      obligations under this License and any other pertinent obligations,
!      then as a consequence you may not convey it at all.  For example,
!      if you agree to terms that obligate you to collect a royalty for
!      further conveying from those to whom you convey the Program, the
!      only way you could satisfy both those terms and this License would
!      be to refrain entirely from conveying the Program.
  
!   13. Use with the GNU Affero General Public License.
  
       Notwithstanding any other provision of this License, you have
       permission to link or combine any covered work with a work licensed
*************** TERMS AND CONDITIONS
*** 2493,2514 ****
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!  14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.
!      Such new versions will be similar in spirit to the present
!      version, but may differ in detail to address new problems or
!      concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the
!      Free Software Foundation.  If the Program does not specify a
!      version number of the GNU General Public License, you may choose
!      any version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
--- 2482,2502 ----
       General Public License, section 13, concerning interaction through
       a network will apply to the combination as such.
  
!   14. Revised Versions of this License.
  
       The Free Software Foundation may publish revised and/or new
!      versions of the GNU General Public License from time to time.  Such
!      new versions will be similar in spirit to the present version, but
!      may differ in detail to address new problems or concerns.
  
       Each version is given a distinguishing version number.  If the
       Program specifies that a certain numbered version of the GNU
       General Public License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
!      that numbered version or of any later version published by the Free
!      Software Foundation.  If the Program does not specify a version
!      number of the GNU General Public License, you may choose any
!      version ever published by the Free Software Foundation.
  
       If the Program specifies that a proxy can decide which future
       versions of the GNU General Public License can be used, that
*************** TERMS AND CONDITIONS
*** 2520,2543 ****
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!  15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!  16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU
!      FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
--- 2508,2531 ----
       author or copyright holder as a result of your choosing to follow a
       later version.
  
!   15. Disclaimer of Warranty.
  
       THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
!      APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE
       COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
       WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
       INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
!      MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE
       RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
       SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
       NECESSARY SERVICING, REPAIR OR CORRECTION.
  
!   16. Limitation of Liability.
  
       IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
       WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
!      AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR
!      DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
       CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
       THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
       BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
*************** TERMS AND CONDITIONS
*** 2545,2551 ****
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!  17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
--- 2533,2539 ----
       PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
       THE POSSIBILITY OF SUCH DAMAGES.
  
!   17. Interpretation of Sections 15 and 16.
  
       If the disclaimer of warranty and limitation of liability provided
       above cannot be given local legal effect according to their terms,
*************** TERMS AND CONDITIONS
*** 2554,2560 ****
       connection with the Program, unless a warranty or assumption of
       liability accompanies a copy of the Program in return for a fee.
  
- 
  END OF TERMS AND CONDITIONS
  ===========================
  
--- 2542,2547 ----
*************** state the exclusion of warranty; and eac
*** 2585,2591 ****
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see `http://www.gnu.org/licenses/'.
  
     Also add information on how to contact you by electronic and paper
  mail.
--- 2572,2578 ----
       General Public License for more details.
  
       You should have received a copy of the GNU General Public License
!      along with this program.  If not, see <http://www.gnu.org/licenses/>.
  
     Also add information on how to contact you by electronic and paper
  mail.
*************** mail.
*** 2594,2604 ****
  notice like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type `show c' for details.
  
!    The hypothetical commands `show w' and `show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
--- 2581,2591 ----
  notice like this when it starts in an interactive mode:
  
       PROGRAM Copyright (C) YEAR NAME OF AUTHOR
!      This program comes with ABSOLUTELY NO WARRANTY; for details type 'show w'.
       This is free software, and you are welcome to redistribute it
!      under certain conditions; type 'show c' for details.
  
!    The hypothetical commands 'show w' and 'show c' should show the
  appropriate parts of the General Public License.  Of course, your
  program's commands might be different; for a GUI interface, you would
  use an "about box".
*************** use an "about box".
*** 2606,2619 ****
     You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see `http://www.gnu.org/licenses/'.
  
     The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read `http://www.gnu.org/philosophy/why-not-lgpl.html'.
  
  
  File: libgomp.info,  Node: GNU Free Documentation License,  Next: Funding,  Prev: Copying,  Up: Top
--- 2593,2606 ----
     You should also get your employer (if you work as a programmer) or
  school, if any, to sign a "copyright disclaimer" for the program, if
  necessary.  For more information on this, and how to apply and follow
! the GNU GPL, see <http://www.gnu.org/licenses/>.
  
     The GNU General Public License does not permit incorporating your
  program into proprietary programs.  If your program is a subroutine
  library, you may consider it more useful to permit linking proprietary
  applications with the library.  If this is what you want to do, use the
  GNU Lesser General Public License instead of this License.  But first,
! please read <http://www.gnu.org/philosophy/why-not-lgpl.html>.
  
  
  File: libgomp.info,  Node: GNU Free Documentation License,  Next: Funding,  Prev: Copying,  Up: Top
*************** GNU Free Documentation License
*** 2624,2630 ****
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
--- 2611,2617 ----
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
*************** GNU Free Documentation License
*** 2649,2669 ****
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.
!      We recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it
!      can be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You
!      accept the license if you copy, modify or distribute the work in a
!      way requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
--- 2636,2656 ----
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.  We
!      recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it can
!      be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You accept
!      the license if you copy, modify or distribute the work in a way
!      requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
*************** GNU Free Documentation License
*** 2681,2692 ****
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in
!      the notice that says that the Document is released under this
!      License.  If a section does not fit the above definition of
!      Secondary then it is not allowed to be designated as Invariant.
!      The Document may contain zero Invariant Sections.  If the Document
!      does not identify any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
--- 2668,2679 ----
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in the
!      notice that says that the Document is released under this License.
!      If a section does not fit the above definition of Secondary then it
!      is not allowed to be designated as Invariant.  The Document may
!      contain zero Invariant Sections.  If the Document does not identify
!      any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
*************** GNU Free Documentation License
*** 2697,2723 ****
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images
!      composed of pixels) generic paint programs or (for drawings) some
!      widely available drawing editor, and that is suitable for input to
!      text formatters or for automatic translation to a variety of
!      formats suitable for input to text formatters.  A copy made in an
!      otherwise Transparent file format whose markup, or absence of
!      markup, has been arranged to thwart or discourage subsequent
!      modification by readers is not Transparent.  An image format is
!      not Transparent if used for any substantial amount of text.  A
!      copy that is not "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and
!      standard-conforming simple HTML, PostScript or PDF designed for
!      human modification.  Examples of transparent image formats include
!      PNG, XCF and JPG.  Opaque formats include proprietary formats that
!      can be read and edited only by proprietary word processors, SGML or
!      XML for which the DTD and/or processing tools are not generally
!      available, and the machine-generated HTML, PostScript or PDF
!      produced by some word processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
--- 2684,2710 ----
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images composed
!      of pixels) generic paint programs or (for drawings) some widely
!      available drawing editor, and that is suitable for input to text
!      formatters or for automatic translation to a variety of formats
!      suitable for input to text formatters.  A copy made in an otherwise
!      Transparent file format whose markup, or absence of markup, has
!      been arranged to thwart or discourage subsequent modification by
!      readers is not Transparent.  An image format is not Transparent if
!      used for any substantial amount of text.  A copy that is not
!      "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and standard-conforming
!      simple HTML, PostScript or PDF designed for human modification.
!      Examples of transparent image formats include PNG, XCF and JPG.
!      Opaque formats include proprietary formats that can be read and
!      edited only by proprietary word processors, SGML or XML for which
!      the DTD and/or processing tools are not generally available, and
!      the machine-generated HTML, PostScript or PDF produced by some word
!      processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
*************** GNU Free Documentation License
*** 2755,2762 ****
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow
!      the conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
--- 2742,2749 ----
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow the
!      conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
*************** GNU Free Documentation License
*** 2770,2781 ****
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the
!      title equally prominent and visible.  You may add other material
!      on the covers in addition.  Copying with changes limited to the
!      covers, as long as they preserve the title of the Document and
!      satisfy these conditions, can be treated as verbatim copying in
!      other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
--- 2757,2767 ----
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the title
!      equally prominent and visible.  You may add other material on the
!      covers in addition.  Copying with changes limited to the covers, as
!      long as they preserve the title of the Document and satisfy these
!      conditions, can be treated as verbatim copying in other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
*************** GNU Free Documentation License
*** 2783,2822 ****
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a
!      machine-readable Transparent copy along with each Opaque copy, or
!      state in or with each Opaque copy a computer-network location from
!      which the general network-using public has access to download
!      using public-standard network protocols a complete Transparent
!      copy of the Document, free of added material.  If you use the
!      latter option, you must take reasonably prudent steps, when you
!      begin distribution of Opaque copies in quantity, to ensure that
!      this Transparent copy will remain thus accessible at the stated
!      location until at least one year after the last time you
!      distribute an Opaque copy (directly or through your agents or
!      retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of
!      copies, to give them a chance to provide you with an updated
!      version of the Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with
!      the Modified Version filling the role of the Document, thus
!      licensing distribution and modification of the Modified Version to
!      whoever possesses a copy of it.  In addition, you must do these
!      things in the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of
!           previous versions (which should, if there were any, be listed
!           in the History section of the Document).  You may use the
!           same title as a previous version if the original publisher of
!           that version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
--- 2769,2807 ----
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a machine-readable
!      Transparent copy along with each Opaque copy, or state in or with
!      each Opaque copy a computer-network location from which the general
!      network-using public has access to download using public-standard
!      network protocols a complete Transparent copy of the Document, free
!      of added material.  If you use the latter option, you must take
!      reasonably prudent steps, when you begin distribution of Opaque
!      copies in quantity, to ensure that this Transparent copy will
!      remain thus accessible at the stated location until at least one
!      year after the last time you distribute an Opaque copy (directly or
!      through your agents or retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of copies,
!      to give them a chance to provide you with an updated version of the
!      Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with the
!      Modified Version filling the role of the Document, thus licensing
!      distribution and modification of the Modified Version to whoever
!      possesses a copy of it.  In addition, you must do these things in
!      the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of previous
!           versions (which should, if there were any, be listed in the
!           History section of the Document).  You may use the same title
!           as a previous version if the original publisher of that
!           version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
*************** GNU Free Documentation License
*** 2846,2876 ****
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on
!           the Title Page.  If there is no section Entitled "History" in
!           the Document, create one stating the title, year, authors,
!           and publisher of the Document as given on its Title Page,
!           then add an item describing the Modified Version as stated in
!           the previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in
!           the "History" section.  You may omit a network location for a
!           work that was published at least four years before the
!           Document itself, or if the original publisher of the version
!           it refers to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the
!           section all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document,
!           unaltered in their text and in their titles.  Section numbers
!           or the equivalent are not considered part of the section
!           titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
--- 2831,2860 ----
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on the
!           Title Page.  If there is no section Entitled "History" in the
!           Document, create one stating the title, year, authors, and
!           publisher of the Document as given on its Title Page, then add
!           an item describing the Modified Version as stated in the
!           previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in the
!           "History" section.  You may omit a network location for a work
!           that was published at least four years before the Document
!           itself, or if the original publisher of the version it refers
!           to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the section
!           all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document, unaltered
!           in their text and in their titles.  Section numbers or the
!           equivalent are not considered part of the section titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
*************** GNU Free Documentation License
*** 2883,2893 ****
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option
!      designate some or all of these sections as invariant.  To do this,
!      add their titles to the list of Invariant Sections in the Modified
!      Version's license notice.  These titles must be distinct from any
!      other section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
--- 2867,2877 ----
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option designate
!      some or all of these sections as invariant.  To do this, add their
!      titles to the list of Invariant Sections in the Modified Version's
!      license notice.  These titles must be distinct from any other
!      section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
*************** GNU Free Documentation License
*** 2896,2910 ****
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end
!      of the list of Cover Texts in the Modified Version.  Only one
!      passage of Front-Cover Text and one of Back-Cover Text may be
!      added by (or through arrangements made by) any one entity.  If the
!      Document already includes a cover text for the same cover,
!      previously added by you or by arrangement made by the same entity
!      you are acting on behalf of, you may not add another; but you may
!      replace the old one, on explicit permission from the previous
!      publisher that added the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
--- 2880,2894 ----
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end of
!      the list of Cover Texts in the Modified Version.  Only one passage
!      of Front-Cover Text and one of Back-Cover Text may be added by (or
!      through arrangements made by) any one entity.  If the Document
!      already includes a cover text for the same cover, previously added
!      by you or by arrangement made by the same entity you are acting on
!      behalf of, you may not add another; but you may replace the old
!      one, on explicit permission from the previous publisher that added
!      the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
*************** GNU Free Documentation License
*** 2914,2921 ****
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination
!      all of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
--- 2898,2905 ----
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination all
!      of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
*************** GNU Free Documentation License
*** 2942,2961 ****
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the
!      documents in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow
!      this License in all other respects regarding verbatim copying of
!      that document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of
!      a storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
--- 2926,2945 ----
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the documents
!      in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow this
!      License in all other respects regarding verbatim copying of that
!      document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of a
!      storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
*************** GNU Free Documentation License
*** 3000,3007 ****
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 2984,2991 ----
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** GNU Free Documentation License
*** 3013,3045 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, receipt of a copy of some or all of
!      the same material does not give you any rights to use it.
  
!  10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      `http://www.gnu.org/copyleft/'.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If
!      the Document does not specify a version number of this License,
!      you may choose any version ever published (not as a draft) by the
!      Free Software Foundation.  If the Document specifies that a proxy
!      can decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!  11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
--- 2997,3029 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, receipt of a copy of some or all of the
!      same material does not give you any rights to use it.
  
!   10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      <http://www.gnu.org/copyleft/>.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If the
!      Document does not specify a version number of this License, you may
!      choose any version ever published (not as a draft) by the Free
!      Software Foundation.  If the Document specifies that a proxy can
!      decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!   11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
*************** GNU Free Documentation License
*** 3069,3075 ****
       site under CC-BY-SA on the same site at any time before August 1,
       2009, provided the MMC is eligible for relicensing.
  
- 
  ADDENDUM: How to use this License for your documents
  ====================================================
  
--- 3053,3058 ----
*************** notices just after the title page:
*** 3086,3092 ****
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts." line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
--- 3069,3075 ----
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts."  line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
*************** combination of the three, merge those tw
*** 3097,3105 ****
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of
! free software license, such as the GNU General Public License, to
! permit their use in free software.
  
  
  File: libgomp.info,  Node: Funding,  Next: Library Index,  Prev: GNU Free Documentation License,  Up: Top
--- 3080,3088 ----
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of free
! software license, such as the GNU General Public License, to permit
! their use in free software.
  
  
  File: libgomp.info,  Node: Funding,  Next: Library Index,  Prev: GNU Free Documentation License,  Up: Top
*************** for comparison.
*** 3129,3136 ****
  
     Even a precise fraction "of the profits from this disk" is not very
  meaningful, since creative accounting and unrelated business decisions
! can greatly alter what fraction of the sales price counts as profit.
! If the price you pay is $50, ten percent of the profit is probably less
  than a dollar; it might be a few cents, or nothing at all.
  
     Some redistributors do development work themselves.  This is useful
--- 3112,3119 ----
  
     Even a precise fraction "of the profits from this disk" is not very
  meaningful, since creative accounting and unrelated business decisions
! can greatly alter what fraction of the sales price counts as profit.  If
! the price you pay is $50, ten percent of the profit is probably less
  than a dollar; it might be a few cents, or nothing at all.
  
     Some redistributors do development work themselves.  This is useful
*************** difference than others.  For example, ma
*** 3140,3147 ****
  a program contributes very little; maintaining the standard version of a
  program for the whole community contributes much.  Easy new ports
  contribute little, since someone else would surely do them; difficult
! ports such as adding a new CPU to the GNU Compiler Collection
! contribute more; major new features or packages contribute the most.
  
     By establishing the idea that supporting further development is "the
  proper thing to do" when distributing free software for a fee, we can
--- 3123,3130 ----
  a program contributes very little; maintaining the standard version of a
  program for the whole community contributes much.  Easy new ports
  contribute little, since someone else would surely do them; difficult
! ports such as adding a new CPU to the GNU Compiler Collection contribute
! more; major new features or packages contribute the most.
  
     By establishing the idea that supporting further development is "the
  proper thing to do" when distributing free software for a fee, we can
*************** Library Index
*** 3160,3274 ****
  [index]
  * Menu:
  
- * Environment Variable <1>:              GOMP_SPINCOUNT.        (line 6)
- * Environment Variable <2>:              GOMP_STACKSIZE.        (line 6)
- * Environment Variable <3>:              GOMP_DEBUG.            (line 6)
- * Environment Variable <4>:              GOMP_CPU_AFFINITY.     (line 6)
- * Environment Variable <5>:              OMP_WAIT_POLICY.       (line 6)
- * Environment Variable <6>:              OMP_THREAD_LIMIT.      (line 6)
- * Environment Variable <7>:              OMP_SCHEDULE.          (line 6)
- * Environment Variable <8>:              OMP_STACKSIZE.         (line 6)
- * Environment Variable <9>:              OMP_PLACES.            (line 6)
- * Environment Variable <10>:             OMP_PROC_BIND.         (line 6)
- * Environment Variable <11>:             OMP_NUM_THREADS.       (line 6)
- * Environment Variable <12>:             OMP_NESTED.            (line 6)
- * Environment Variable <13>:             OMP_MAX_ACTIVE_LEVELS. (line 6)
- * Environment Variable <14>:             OMP_DYNAMIC.           (line 6)
- * Environment Variable <15>:             OMP_DEFAULT_DEVICE.    (line 6)
- * Environment Variable <16>:             OMP_DISPLAY_ENV.       (line 6)
  * Environment Variable:                  OMP_CANCELLATION.      (line 6)
  * FDL, GNU Free Documentation License:   GNU Free Documentation License.
                                                                  (line 6)
- * Implementation specific setting <1>:   GOMP_SPINCOUNT.        (line 6)
- * Implementation specific setting <2>:   GOMP_STACKSIZE.        (line 6)
- * Implementation specific setting <3>:   OMP_SCHEDULE.          (line 6)
- * Implementation specific setting <4>:   OMP_NUM_THREADS.       (line 6)
  * Implementation specific setting:       OMP_NESTED.            (line 6)
  * Introduction:                          Top.                   (line 6)
  
  
  
  Tag Table:
! Node: Top2130
! Node: Enabling OpenMP3925
! Node: Runtime Library Routines4712
! Node: omp_get_active_level7699
! Node: omp_get_ancestor_thread_num8397
! Node: omp_get_cancellation9324
! Node: omp_get_default_device10136
! Node: omp_get_dynamic10810
! Node: omp_get_level11683
! Node: omp_get_max_active_levels12301
! Node: omp_get_max_threads12998
! Node: omp_get_nested13753
! Node: omp_get_num_devices14663
! Node: omp_get_num_procs15182
! Node: omp_get_num_teams15719
! Node: omp_get_num_threads16233
! Node: omp_get_proc_bind17320
! Node: omp_get_schedule18238
! Node: omp_get_team_num19179
! Node: omp_get_team_size19676
! Node: omp_get_thread_limit20633
! Node: omp_get_thread_num21250
! Node: omp_in_parallel22119
! Node: omp_in_final22766
! Node: omp_is_initial_device23438
! Node: omp_set_default_device24129
! Node: omp_set_dynamic24917
! Node: omp_set_max_active_levels25800
! Node: omp_set_nested26574
! Node: omp_set_num_threads27463
! Node: omp_set_schedule28328
! Node: omp_init_lock29394
! Node: omp_set_lock30044
! Node: omp_test_lock30896
! Node: omp_unset_lock31869
! Node: omp_destroy_lock32797
! Node: omp_init_nest_lock33471
! Node: omp_set_nest_lock34203
! Node: omp_test_nest_lock35120
! Node: omp_unset_nest_lock36150
! Node: omp_destroy_nest_lock37162
! Node: omp_get_wtick37910
! Node: omp_get_wtime38500
! Node: Environment Variables39274
! Node: OMP_CANCELLATION40666
! Node: OMP_DISPLAY_ENV41199
! Node: OMP_DEFAULT_DEVICE41902
! Node: OMP_DYNAMIC42682
! Node: OMP_MAX_ACTIVE_LEVELS43278
! Node: OMP_NESTED43917
! Node: OMP_NUM_THREADS44522
! Node: OMP_PROC_BIND45211
! Node: OMP_PLACES46403
! Node: OMP_STACKSIZE48578
! Node: OMP_SCHEDULE49402
! Node: OMP_THREAD_LIMIT50098
! Node: OMP_WAIT_POLICY50698
! Node: GOMP_CPU_AFFINITY51390
! Node: GOMP_DEBUG53121
! Node: GOMP_STACKSIZE53628
! Node: GOMP_SPINCOUNT54457
! Node: The libgomp ABI55634
! Node: Implementing MASTER construct56433
! Node: Implementing CRITICAL construct56847
! Node: Implementing ATOMIC construct57586
! Node: Implementing FLUSH construct58067
! Node: Implementing BARRIER construct58338
! Node: Implementing THREADPRIVATE construct58607
! Node: Implementing PRIVATE clause59259
! Node: Implementing FIRSTPRIVATE LASTPRIVATE COPYIN and COPYPRIVATE clauses59840
! Node: Implementing REDUCTION clause61164
! Node: Implementing PARALLEL construct61721
! Node: Implementing FOR construct62978
! Node: Implementing ORDERED construct64976
! Node: Implementing SECTIONS construct65282
! Node: Implementing SINGLE construct66048
! Node: Reporting Bugs66710
! Node: Copying67070
! Node: GNU Free Documentation License104635
! Node: Funding129777
! Node: Library Index132302
  
  End Tag Table
--- 3143,3257 ----
  [index]
  * Menu:
  
  * Environment Variable:                  OMP_CANCELLATION.      (line 6)
+ * Environment Variable <1>:              OMP_DISPLAY_ENV.       (line 6)
+ * Environment Variable <2>:              OMP_DEFAULT_DEVICE.    (line 6)
+ * Environment Variable <3>:              OMP_DYNAMIC.           (line 6)
+ * Environment Variable <4>:              OMP_MAX_ACTIVE_LEVELS. (line 6)
+ * Environment Variable <5>:              OMP_NESTED.            (line 6)
+ * Environment Variable <6>:              OMP_NUM_THREADS.       (line 6)
+ * Environment Variable <7>:              OMP_PROC_BIND.         (line 6)
+ * Environment Variable <8>:              OMP_PLACES.            (line 6)
+ * Environment Variable <9>:              OMP_STACKSIZE.         (line 6)
+ * Environment Variable <10>:             OMP_SCHEDULE.          (line 6)
+ * Environment Variable <11>:             OMP_THREAD_LIMIT.      (line 6)
+ * Environment Variable <12>:             OMP_WAIT_POLICY.       (line 6)
+ * Environment Variable <13>:             GOMP_CPU_AFFINITY.     (line 6)
+ * Environment Variable <14>:             GOMP_DEBUG.            (line 6)
+ * Environment Variable <15>:             GOMP_STACKSIZE.        (line 6)
+ * Environment Variable <16>:             GOMP_SPINCOUNT.        (line 6)
  * FDL, GNU Free Documentation License:   GNU Free Documentation License.
                                                                  (line 6)
  * Implementation specific setting:       OMP_NESTED.            (line 6)
+ * Implementation specific setting <1>:   OMP_NUM_THREADS.       (line 6)
+ * Implementation specific setting <2>:   OMP_SCHEDULE.          (line 6)
+ * Implementation specific setting <3>:   GOMP_STACKSIZE.        (line 6)
+ * Implementation specific setting <4>:   GOMP_SPINCOUNT.        (line 6)
  * Introduction:                          Top.                   (line 6)
  
  
  
  Tag Table:
! Node: Top2083
! Node: Enabling OpenMP3878
! Node: Runtime Library Routines4665
! Node: omp_get_active_level7652
! Node: omp_get_ancestor_thread_num8352
! Node: omp_get_cancellation9282
! Node: omp_get_default_device10096
! Node: omp_get_dynamic10772
! Node: omp_get_level11647
! Node: omp_get_max_active_levels12267
! Node: omp_get_max_threads12966
! Node: omp_get_nested13723
! Node: omp_get_num_devices14635
! Node: omp_get_num_procs15156
! Node: omp_get_num_teams15695
! Node: omp_get_num_threads16211
! Node: omp_get_proc_bind17300
! Node: omp_get_schedule18221
! Node: omp_get_team_num19167
! Node: omp_get_team_size19666
! Node: omp_get_thread_limit20626
! Node: omp_get_thread_num21245
! Node: omp_in_parallel22116
! Node: omp_in_final22765
! Node: omp_is_initial_device23439
! Node: omp_set_default_device24132
! Node: omp_set_dynamic24923
! Node: omp_set_max_active_levels25809
! Node: omp_set_nested26586
! Node: omp_set_num_threads27478
! Node: omp_set_schedule28346
! Node: omp_init_lock29397
! Node: omp_set_lock30050
! Node: omp_test_lock30905
! Node: omp_unset_lock31881
! Node: omp_destroy_lock32812
! Node: omp_init_nest_lock33489
! Node: omp_set_nest_lock34224
! Node: omp_test_nest_lock35139
! Node: omp_unset_nest_lock36166
! Node: omp_destroy_nest_lock37181
! Node: omp_get_wtick37932
! Node: omp_get_wtime38524
! Node: Environment Variables39300
! Node: OMP_CANCELLATION40692
! Node: OMP_DISPLAY_ENV41225
! Node: OMP_DEFAULT_DEVICE41928
! Node: OMP_DYNAMIC42708
! Node: OMP_MAX_ACTIVE_LEVELS43304
! Node: OMP_NESTED43943
! Node: OMP_NUM_THREADS44548
! Node: OMP_PROC_BIND45236
! Node: OMP_PLACES46428
! Node: OMP_STACKSIZE48603
! Node: OMP_SCHEDULE49427
! Node: OMP_THREAD_LIMIT50123
! Node: OMP_WAIT_POLICY50723
! Node: GOMP_CPU_AFFINITY51415
! Node: GOMP_DEBUG53145
! Node: GOMP_STACKSIZE53652
! Node: GOMP_SPINCOUNT54481
! Node: The libgomp ABI55653
! Node: Implementing MASTER construct56452
! Node: Implementing CRITICAL construct56866
! Node: Implementing ATOMIC construct57605
! Node: Implementing FLUSH construct58086
! Node: Implementing BARRIER construct58357
! Node: Implementing THREADPRIVATE construct58626
! Node: Implementing PRIVATE clause59279
! Node: Implementing FIRSTPRIVATE LASTPRIVATE COPYIN and COPYPRIVATE clauses59860
! Node: Implementing REDUCTION clause61184
! Node: Implementing PARALLEL construct61741
! Node: Implementing FOR construct62998
! Node: Implementing ORDERED construct64996
! Node: Implementing SECTIONS construct65302
! Node: Implementing SINGLE construct66068
! Node: Reporting Bugs66730
! Node: Copying67090
! Node: GNU Free Documentation License104637
! Node: Funding129760
! Node: Library Index132286
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/libgomp/testsuite/libgomp.c/pr45784.c gcc-5.5.0/libgomp/testsuite/libgomp.c/pr45784.c
*** gcc-5.4.0/libgomp/testsuite/libgomp.c/pr45784.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libgomp/testsuite/libgomp.c/pr45784.c	Sat Sep 16 18:36:03 2017
***************
*** 0 ****
--- 1,41 ----
+ /* PR c/45784 */
+ /* { dg-do run } */
+ 
+ void
+ foo (int n)
+ {
+   char *p, vla[2 * n];
+   int i;
+   #pragma omp parallel for
+   for (p = vla; p < vla + (sizeof (vla) / sizeof (vla[0])); p++)
+     *p = ' ';
+   #pragma omp parallel for
+   for (i = 0; i < 2 * n; i++)
+     if (vla[i] != ' ')
+       __builtin_abort ();
+ }
+ 
+ void
+ bar (int n)
+ {
+   char *p, vla1[n], vla2[n * 2], vla3[n * 3], vla4[n * 4];
+   int i;
+   __builtin_memset (vla4, ' ', n * 4);
+   #pragma omp parallel for
+   for (p = vla4 + sizeof (vla1); p < vla4 + sizeof (vla3) - sizeof (vla2) + sizeof (vla1); p += sizeof (vla4) / sizeof (vla4))
+     p[0] = '!';
+   #pragma omp parallel for
+   for (i = 0; i < n * 4; i++)
+     if (vla4[i] != ((i >= n && i < 2 * n) ? '!' : ' '))
+       __builtin_abort ();
+ }
+ 
+ int
+ main ()
+ {
+   volatile int n;
+   n = 128;
+   foo (n);
+   bar (n);
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/libgomp/testsuite/libgomp.c/pr80394.c gcc-5.5.0/libgomp/testsuite/libgomp.c/pr80394.c
*** gcc-5.4.0/libgomp/testsuite/libgomp.c/pr80394.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libgomp/testsuite/libgomp.c/pr80394.c	Tue May 30 08:25:50 2017
***************
*** 0 ****
--- 1,22 ----
+ /* PR libgomp/80394 */
+ 
+ int
+ main ()
+ {
+   int x = 0;
+   #pragma omp parallel shared(x)
+   #pragma omp single
+   {
+     #pragma omp task depend(inout: x)
+     {
+       for (int i = 0; i < 100000; i++)
+         asm volatile ("" : : : "memory");
+       x += 5;
+     }
+     #pragma omp task if (0) depend(inout: x)
+     ;
+     if (x != 5)
+       __builtin_abort ();
+   }
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/libgomp/testsuite/libgomp.c/pr81687-1.c gcc-5.5.0/libgomp/testsuite/libgomp.c/pr81687-1.c
*** gcc-5.4.0/libgomp/testsuite/libgomp.c/pr81687-1.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libgomp/testsuite/libgomp.c/pr81687-1.c	Sat Sep 16 18:38:53 2017
***************
*** 0 ****
--- 1,23 ----
+ /* PR c/81687 */
+ /* { dg-do link } */
+ /* { dg-additional-options "-O2" } */
+ 
+ extern int printf (const char *, ...);
+ 
+ int
+ main ()
+ {
+   #pragma omp parallel
+   {
+    lab1:
+     printf ("lab1=%p\n", (void *)(&&lab1));
+   }
+  lab2:
+   #pragma omp parallel
+   {
+    lab3:
+     printf ("lab2=%p\n", (void *)(&&lab2));
+   }
+   printf ("lab3=%p\n", (void *)(&&lab3));
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/libgomp/testsuite/libgomp.c/pr81687-2.c gcc-5.5.0/libgomp/testsuite/libgomp.c/pr81687-2.c
*** gcc-5.4.0/libgomp/testsuite/libgomp.c/pr81687-2.c	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libgomp/testsuite/libgomp.c/pr81687-2.c	Sat Sep 16 18:38:53 2017
***************
*** 0 ****
--- 1,27 ----
+ /* PR c/81687 */
+ /* { dg-do link } */
+ /* { dg-additional-options "-O2" } */
+ 
+ int
+ main ()
+ {
+   __label__ lab4, lab5, lab6;
+   volatile int l = 0;
+   int m = l;
+   void foo (int x) { if (x == 1) goto lab4; }
+   void bar (int x) { if (x == 2) goto lab5; }
+   void baz (int x) { if (x == 3) goto lab6; }
+   #pragma omp parallel
+   {
+     foo (m + 1);
+    lab4:;
+   }
+   #pragma omp task
+   {
+     bar (m + 2);
+    lab5:;
+   }
+   baz (m + 3);
+  lab6:;
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/libgomp/testsuite/libgomp.c++/pr45784.C gcc-5.5.0/libgomp/testsuite/libgomp.c++/pr45784.C
*** gcc-5.4.0/libgomp/testsuite/libgomp.c++/pr45784.C	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libgomp/testsuite/libgomp.c++/pr45784.C	Sat Sep 16 18:36:03 2017
***************
*** 0 ****
--- 1,5 ----
+ // PR c/45784
+ // { dg-do run }
+ 
+ #include "../libgomp.c/pr45784.c"
+ 
diff -Nrcpad gcc-5.4.0/libgomp/testsuite/libgomp.fortran/associate3.f90 gcc-5.5.0/libgomp/testsuite/libgomp.fortran/associate3.f90
*** gcc-5.4.0/libgomp/testsuite/libgomp.fortran/associate3.f90	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libgomp/testsuite/libgomp.fortran/associate3.f90	Thu Jul  7 12:51:01 2016
***************
*** 0 ****
--- 1,20 ----
+ ! PR fortran/71717
+ ! { dg-do run }
+ 
+   type t
+     real, allocatable :: f(:)
+   end type
+   type (t) :: v
+   integer :: i, j
+   allocate (v%f(4))
+   v%f = 19.
+   i = 5
+   associate (u => v, k => i)
+   !$omp parallel do
+   do j = 1, 4
+     u%f(j) = 21.
+     if (j.eq.1) k = 7
+   end do
+   end associate
+   if (any (v%f(:).ne.21.) .or. i.ne.7) call abort
+ end
diff -Nrcpad gcc-5.4.0/libiberty/ChangeLog gcc-5.5.0/libiberty/ChangeLog
*** gcc-5.4.0/libiberty/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libiberty/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,16 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-12-13  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/78761
+ 	* cp-demangle.c (cplus_demangle_type): Demangle Dc as decltype(auto).
+ 	* testsuite/demangle-expected: Add test for decltype(auto).
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libiberty/cp-demangle.c gcc-5.5.0/libiberty/cp-demangle.c
*** gcc-5.4.0/libiberty/cp-demangle.c	Thu May 19 10:44:31 2016
--- gcc-5.5.0/libiberty/cp-demangle.c	Tue May 30 07:47:05 2017
*************** cplus_demangle_type (struct d_info *di)
*** 2519,2525 ****
  	  /* auto */
  	  ret = d_make_name (di, "auto", 4);
  	  break;
! 	  
  	case 'f':
  	  /* 32-bit decimal floating point */
  	  ret = d_make_builtin_type (di, &cplus_demangle_builtin_types[26]);
--- 2519,2529 ----
  	  /* auto */
  	  ret = d_make_name (di, "auto", 4);
  	  break;
! 	case 'c':
! 	  /* decltype(auto) */
! 	  ret = d_make_name (di, "decltype(auto)", 14);
! 	  break;
! 
  	case 'f':
  	  /* 32-bit decimal floating point */
  	  ret = d_make_builtin_type (di, &cplus_demangle_builtin_types[26]);
diff -Nrcpad gcc-5.4.0/libiberty/testsuite/demangle-expected gcc-5.5.0/libiberty/testsuite/demangle-expected
*** gcc-5.4.0/libiberty/testsuite/demangle-expected	Thu May 19 10:44:31 2016
--- gcc-5.5.0/libiberty/testsuite/demangle-expected	Tue May 30 07:47:05 2017
*************** decltype (new auto({parm#1})) f<int>(int
*** 4085,4090 ****
--- 4085,4093 ----
  _Z1fIiERDaRKT_S1_
  auto& f<int>(int const&, int)
  --format=gnu-v3
+ _Z1gIiEDcRKT_S0_
+ decltype(auto) g<int>(int const&, int)
+ --format=gnu-v3
  _Z1gILi1EEvR1AIXT_EER1BIXscbT_EE
  void g<1>(A<1>&, B<static_cast<bool>(1)>&)
  --format=gnu-v3
diff -Nrcpad gcc-5.4.0/libitm/ChangeLog gcc-5.5.0/libitm/ChangeLog
*** gcc-5.4.0/libitm/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libitm/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libitm/libitm.info gcc-5.5.0/libitm/libitm.info
*** gcc-5.4.0/libitm/libitm.info	Fri Jun  3 10:50:16 2016
--- gcc-5.5.0/libitm/libitm.info	Tue Oct 10 10:00:27 2017
***************
*** 1,5 ****
! This is libitm.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/libitm/libitm.texi.
  
  Copyright (C) 2011-2015 Free Software Foundation, Inc.
  
--- 1,4 ----
! This is libitm.info, produced by makeinfo version 6.1 from libitm.texi.
  
  Copyright (C) 2011-2015 Free Software Foundation, Inc.
  
*************** any later version published by the Free
*** 9,15 ****
  Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.  A
  copy of the license is included in the section entitled "GNU Free
  Documentation License".
- 
  INFO-DIR-SECTION GNU Libraries
  START-INFO-DIR-ENTRY
  * libitm: (libitm).                    GNU Transactional Memory Library
--- 8,13 ----
*************** Introduction
*** 33,39 ****
  ************
  
  This manual documents the usage and internals of libitm, the GNU
! Transactional Memory Library. It provides transaction support for
  accesses to a process' memory, enabling easy-to-use synchronization of
  accesses to shared memory by several threads.
  
--- 31,37 ----
  ************
  
  This manual documents the usage and internals of libitm, the GNU
! Transactional Memory Library.  It provides transaction support for
  accesses to a process' memory, enabling easy-to-use synchronization of
  accesses to shared memory by several threads.
  
*************** File: libitm.info,  Node: Enabling libit
*** 55,63 ****
  1 Enabling libitm
  *****************
  
! To activate support for TM in C/C++, the compile-time flag `-fgnu-tm'
! must be specified. This enables TM language-level constructs such as
! transaction statements (e.g., `__transaction_atomic', *note C/C++
  Language Constructs for TM:: for details).
  
  
--- 53,61 ----
  1 Enabling libitm
  *****************
  
! To activate support for TM in C/C++, the compile-time flag '-fgnu-tm'
! must be specified.  This enables TM language-level constructs such as
! transaction statements (e.g., '__transaction_atomic', *note C/C++
  Language Constructs for TM:: for details).
  
  
*************** File: libitm.info,  Node: C/C++ Language
*** 67,81 ****
  **********************************
  
  Transactions are supported in C++ and C in the form of transaction
! statements, transaction expressions, and function transactions. In the
! following example, both `a' and `b' will be read and the difference
! will be written to `c', all atomically and isolated from other
! transactions:
  
       __transaction_atomic { c = a - b; }
  
     Therefore, another thread can use the following code to concurrently
! update `b' without ever causing `c' to hold a negative value (and
  without having to use other synchronization constructs such as locks or
  C++11 atomics):
  
--- 65,78 ----
  **********************************
  
  Transactions are supported in C++ and C in the form of transaction
! statements, transaction expressions, and function transactions.  In the
! following example, both 'a' and 'b' will be read and the difference will
! be written to 'c', all atomically and isolated from other transactions:
  
       __transaction_atomic { c = a - b; }
  
     Therefore, another thread can use the following code to concurrently
! update 'b' without ever causing 'c' to hold a negative value (and
  without having to use other synchronization constructs such as locks or
  C++11 atomics):
  
*************** C++11 atomics):
*** 83,96 ****
  
     GCC follows the Draft Specification of Transactional Language
  Constructs for C++ (v1.1)
! (https://sites.google.com/site/tmforcplusplus/) in its implementation
! of transactions.
  
     The precise semantics of transactions are defined in terms of the
! C++11/C11 memory model (see the specification). Roughly, transactions
  provide synchronization guarantees that are similar to what would be
  guaranteed when using a single global lock as a guard for all
! transactions. Note that like other synchronization constructs in C/C++,
  transactions rely on a data-race-free program (e.g., a nontransactional
  write that is concurrent with a transactional read to the same memory
  location is a data race).
--- 80,93 ----
  
     GCC follows the Draft Specification of Transactional Language
  Constructs for C++ (v1.1)
! (https://sites.google.com/site/tmforcplusplus/) in its implementation of
! transactions.
  
     The precise semantics of transactions are defined in terms of the
! C++11/C11 memory model (see the specification).  Roughly, transactions
  provide synchronization guarantees that are similar to what would be
  guaranteed when using a single global lock as a guard for all
! transactions.  Note that like other synchronization constructs in C/C++,
  transactions rely on a data-race-free program (e.g., a nontransactional
  write that is concurrent with a transactional read to the same memory
  location is a data race).
*************** File: libitm.info,  Node: The libitm ABI
*** 102,112 ****
  ****************
  
  The ABI provided by libitm is basically equal to the Linux variant of
! Intel's current TM ABI specification document (Revision 1.1, May 6
! 2009) but with the differences listed in this chapter. It would be good
! if these changes would eventually be merged into a future version of
! this specification. To ease look-up, the following subsections mirror
! the structure of this specification.
  
  3.1 [No changes] Objectives
  ===========================
--- 99,109 ----
  ****************
  
  The ABI provided by libitm is basically equal to the Linux variant of
! Intel's current TM ABI specification document (Revision 1.1, May 6 2009)
! but with the differences listed in this chapter.  It would be good if
! these changes would eventually be merged into a future version of this
! specification.  To ease look-up, the following subsections mirror the
! structure of this specification.
  
  3.1 [No changes] Objectives
  ===========================
*************** the structure of this specification.
*** 133,146 ****
  ----------------------------
  
  The memory locations accessed with transactional loads and stores and
! the memory locations whose values are logged must not overlap. This
  required separation only extends to the scope of the execution of one
  transaction including all the executions of all nested transactions.
  
     The compiler must be consistent (within the scope of a single
  transaction) about which memory locations are shared and which are not
  shared with other threads (i.e., data must be accessed either
! transactionally or nontransactionally). Otherwise, non-write-through TM
  algorithms would not work.
  
     For memory locations on the stack, this requirement extends to only
--- 130,143 ----
  ----------------------------
  
  The memory locations accessed with transactional loads and stores and
! the memory locations whose values are logged must not overlap.  This
  required separation only extends to the scope of the execution of one
  transaction including all the executions of all nested transactions.
  
     The compiler must be consistent (within the scope of a single
  transaction) about which memory locations are shared and which are not
  shared with other threads (i.e., data must be accessed either
! transactionally or nontransactionally).  Otherwise, non-write-through TM
  algorithms would not work.
  
     For memory locations on the stack, this requirement extends to only
*************** these stack frames' lifetimes will end b
*** 162,168 ****
  3.3.9 Store allocation
  ----------------------
  
! There is no `getTransaction' function.
  
  3.3.10 [No changes] Naming conventions
  --------------------------------------
--- 159,165 ----
  3.3.9 Store allocation
  ----------------------
  
! There is no 'getTransaction' function.
  
  3.3.10 [No changes] Naming conventions
  --------------------------------------
*************** Currently, this is not implemented.
*** 175,182 ****
  3.4 Types and macros list
  =========================
  
! `_ITM_codeProperties' has changed, *note Starting a transaction:
! txn-code-properties.  `_ITM_srcLocation' is not used.
  
  3.5 Function list
  =================
--- 172,179 ----
  3.4 Types and macros list
  =========================
  
! '_ITM_codeProperties' has changed, *note Starting a transaction:
! txn-code-properties.  '_ITM_srcLocation' is not used.
  
  3.5 Function list
  =================
*************** These functions are not part of the ABI.
*** 198,204 ****
  3.5.5 State manipulation functions
  ----------------------------------
  
! There is no `getTransaction' function. Transaction identifiers for
  nested transactions will be ordered but not necessarily sequential
  (i.e., for a nested transaction's identifier IN and its enclosing
  transaction's identifier IE, it is guaranteed that IN >= IE).
--- 195,201 ----
  3.5.5 State manipulation functions
  ----------------------------------
  
! There is no 'getTransaction' function.  Transaction identifiers for
  nested transactions will be ordered but not necessarily sequential
  (i.e., for a nested transaction's identifier IN and its enclosing
  transaction's identifier IE, it is guaranteed that IN >= IE).
*************** transaction's identifier IE, it is guara
*** 212,246 ****
  3.5.7.1 Transaction code properties
  ...................................
  
! The bit `hasNoXMMUpdate' is instead called `hasNoVectorUpdate'.  Iff it
  is set, vector register save/restore is not necessary for any target
  machine.
  
!    The `hasNoFloatUpdate' bit (`0x0010') is new. Iff it is set, floating
! point register save/restore is not necessary for any target machine.
  
!    `undoLogCode' is not supported and a fatal runtime error will be
! raised if this bit is set. It is not properly defined in the ABI why
! barriers other than undo logging are not present; Are they not
! necessary (e.g., a transaction operating purely on thread-local data)
! or have they been omitted by the compiler because it thinks that some
! kind of global synchronization (e.g., serial mode) might perform
! better? The specification suggests that the latter might be the case,
! but the former seems to be more useful.
  
!    The `readOnly' bit (`0x4000') is new. *TODO* Lexical or dynamic
  scope?
  
!    `hasNoRetry' is not supported. If this bit is not set, but
! `hasNoAbort' is set, the library can assume that transaction rollback
  will not be requested.
  
     It would be useful if the absence of externally-triggered rollbacks
  would be reported for the dynamic scope as well, not just for the
! lexical scope (`hasNoAbort'). Without this, a library cannot exploit
  this together with flat nesting.
  
!    `exceptionBlock' is not supported because exception blocks are not
  used.
  
  3.5.7.2 [No changes] Windows exception state
--- 209,244 ----
  3.5.7.1 Transaction code properties
  ...................................
  
! The bit 'hasNoXMMUpdate' is instead called 'hasNoVectorUpdate'.  Iff it
  is set, vector register save/restore is not necessary for any target
  machine.
  
!    The 'hasNoFloatUpdate' bit ('0x0010') is new.  Iff it is set,
! floating point register save/restore is not necessary for any target
! machine.
  
!    'undoLogCode' is not supported and a fatal runtime error will be
! raised if this bit is set.  It is not properly defined in the ABI why
! barriers other than undo logging are not present; Are they not necessary
! (e.g., a transaction operating purely on thread-local data) or have they
! been omitted by the compiler because it thinks that some kind of global
! synchronization (e.g., serial mode) might perform better?  The
! specification suggests that the latter might be the case, but the former
! seems to be more useful.
  
!    The 'readOnly' bit ('0x4000') is new.  *TODO* Lexical or dynamic
  scope?
  
!    'hasNoRetry' is not supported.  If this bit is not set, but
! 'hasNoAbort' is set, the library can assume that transaction rollback
  will not be requested.
  
     It would be useful if the absence of externally-triggered rollbacks
  would be reported for the dynamic scope as well, not just for the
! lexical scope ('hasNoAbort').  Without this, a library cannot exploit
  this together with flat nesting.
  
!    'exceptionBlock' is not supported because exception blocks are not
  used.
  
  3.5.7.2 [No changes] Windows exception state
*************** used.
*** 255,281 ****
  3.5.8 Aborting a transaction
  ----------------------------
  
! `_ITM_rollbackTransaction' is not supported. `_ITM_abortTransaction' is
! supported but the abort reasons `exceptionBlockAbort', `TMConflict',
! and `userRetry' are not supported. There are no exception blocks in
! general, so the related cases also do not have to be considered. To
! encode `__transaction_cancel [[outer]]', compilers must set the new
! `outerAbort' bit (`0x10') additionally to the `userAbort' bit in the
  abort reason.
  
  3.5.9 Committing a transaction
  ------------------------------
  
! The exception handling (EH) scheme is different. The Intel ABI requires
! the `_ITM_tryCommitTransaction' function that will return even when the
  commit failed and will have to be matched with calls to either
! `_ITM_abortTransaction' or `_ITM_commitTransaction'. In contrast, gcc
  relies on transactional wrappers for the functions of the Exception
! Handling ABI and on one additional commit function (shown below). This
  allows the TM to keep track of EH internally and thus it does not have
  to embed the cleanup of EH state into the existing EH code in the
! program.  `_ITM_tryCommitTransaction' is not supported.
! `_ITM_commitTransactionToId' is also not supported because the
  propagation of thrown exceptions will not bypass commits of nested
  transactions.
  
--- 253,279 ----
  3.5.8 Aborting a transaction
  ----------------------------
  
! '_ITM_rollbackTransaction' is not supported.  '_ITM_abortTransaction' is
! supported but the abort reasons 'exceptionBlockAbort', 'TMConflict', and
! 'userRetry' are not supported.  There are no exception blocks in
! general, so the related cases also do not have to be considered.  To
! encode '__transaction_cancel [[outer]]', compilers must set the new
! 'outerAbort' bit ('0x10') additionally to the 'userAbort' bit in the
  abort reason.
  
  3.5.9 Committing a transaction
  ------------------------------
  
! The exception handling (EH) scheme is different.  The Intel ABI requires
! the '_ITM_tryCommitTransaction' function that will return even when the
  commit failed and will have to be matched with calls to either
! '_ITM_abortTransaction' or '_ITM_commitTransaction'.  In contrast, gcc
  relies on transactional wrappers for the functions of the Exception
! Handling ABI and on one additional commit function (shown below).  This
  allows the TM to keep track of EH internally and thus it does not have
  to embed the cleanup of EH state into the existing EH code in the
! program.  '_ITM_tryCommitTransaction' is not supported.
! '_ITM_commitTransactionToId' is also not supported because the
  propagation of thrown exceptions will not bypass commits of nested
  transactions.
  
*************** transactions.
*** 285,322 ****
       void *_ITM_cxa_begin_catch (void *exc_ptr);
       void _ITM_cxa_end_catch (void);
  
!    `_ITM_commitTransactionEH' must be called to commit a transaction if
! an exception could be in flight at this position in the code. `exc_ptr'
  is the current exception or zero if there is no current exception.  The
! `_ITM_cxa...' functions are transactional wrappers for the respective
! `__cxa...' functions and must be called instead of these in
  transactional code.
  
     To support this EH scheme, libstdc++ needs to provide one additional
! function (`_cxa_tm_cleanup'), which is used by the TM to clean up the
  exception handling state while rolling back a transaction:
  
       void __cxa_tm_cleanup (void *unthrown_obj, void *cleanup_exc,
                              unsigned int caught_count);
  
!    `unthrown_obj' is non-null if the program called
! `__cxa_allocate_exception' for this exception but did not yet called
! `__cxa_throw' for it. `cleanup_exc' is non-null if the program is
  currently processing a cleanup along an exception path but has not
! caught this exception yet. `caught_count' is the nesting depth of
! `__cxa_begin_catch' within the transaction (which can be counted by the
! TM using `_ITM_cxa_begin_catch' and `_ITM_cxa_end_catch');
! `__cxa_tm_cleanup' then performs rollback by essentially performing
! `__cxa_end_catch' that many times.
  
  3.5.10 Exception handling support
  ---------------------------------
  
  Currently, there is no support for functionality like
! `__transaction_cancel throw' as described in the C++ TM specification.
  Supporting this should be possible with the EH scheme explained
! previously because via the transactional wrappers for the EH ABI, the
! TM is able to observe and intercept EH.
  
  3.5.11 [No changes] Transition to serial-irrevocable mode
  ---------------------------------------------------------
--- 283,320 ----
       void *_ITM_cxa_begin_catch (void *exc_ptr);
       void _ITM_cxa_end_catch (void);
  
!    '_ITM_commitTransactionEH' must be called to commit a transaction if
! an exception could be in flight at this position in the code.  'exc_ptr'
  is the current exception or zero if there is no current exception.  The
! '_ITM_cxa...' functions are transactional wrappers for the respective
! '__cxa...' functions and must be called instead of these in
  transactional code.
  
     To support this EH scheme, libstdc++ needs to provide one additional
! function ('_cxa_tm_cleanup'), which is used by the TM to clean up the
  exception handling state while rolling back a transaction:
  
       void __cxa_tm_cleanup (void *unthrown_obj, void *cleanup_exc,
                              unsigned int caught_count);
  
!    'unthrown_obj' is non-null if the program called
! '__cxa_allocate_exception' for this exception but did not yet called
! '__cxa_throw' for it.  'cleanup_exc' is non-null if the program is
  currently processing a cleanup along an exception path but has not
! caught this exception yet.  'caught_count' is the nesting depth of
! '__cxa_begin_catch' within the transaction (which can be counted by the
! TM using '_ITM_cxa_begin_catch' and '_ITM_cxa_end_catch');
! '__cxa_tm_cleanup' then performs rollback by essentially performing
! '__cxa_end_catch' that many times.
  
  3.5.10 Exception handling support
  ---------------------------------
  
  Currently, there is no support for functionality like
! '__transaction_cancel throw' as described in the C++ TM specification.
  Supporting this should be possible with the EH scheme explained
! previously because via the transactional wrappers for the EH ABI, the TM
! is able to observe and intercept EH.
  
  3.5.11 [No changes] Transition to serial-irrevocable mode
  ---------------------------------------------------------
*************** TM is able to observe and intercept EH.
*** 332,338 ****
  
  If either the source or destination memory region is to be accessed
  nontransactionally, then source and destination regions must not be
! overlapping. The respective `_ITM_memmove' functions are still
  available but a fatal runtime error will be raised if such regions do
  overlap.  To support this functionality, the ABI would have to specify
  how the intersection of the regions has to be accessed (i.e.,
--- 330,336 ----
  
  If either the source or destination memory region is to be accessed
  nontransactionally, then source and destination regions must not be
! overlapping.  The respective '_ITM_memmove' functions are still
  available but a fatal runtime error will be raised if such regions do
  overlap.  To support this functionality, the ABI would have to specify
  how the intersection of the regions has to be accessed (i.e.,
*************** transactionally or nontransactionally).
*** 348,383 ****
  ----------------------------------------------
  
  Commit actions will get executed in the same order in which the
! respective calls to `_ITM_addUserCommitAction' happened. Only
! `_ITM_noTransactionId' is allowed as value for the
! `resumingTransactionId' argument. Commit actions get executed after
  privatization safety has been ensured.
  
!    Undo actions will get executed in reverse order compared to the
! order in which the respective calls to `_ITM_addUserUndoAction'
! happened. The ordering of undo actions w.r.t. the roll-back of other
! actions (e.g., data transfers or memory allocations) is undefined.
  
!    `_ITM_getThreadnum' is not supported currently because its only
  purpose is to provide a thread ID that matches some assumed performance
  tuning output, but this output is not part of the ABI nor further
  defined by it.
  
!    `_ITM_dropReferences' is not supported currently because its
! semantics and the intention behind it is not entirely clear. The
  specification suggests that this function is necessary because of
  certain orderings of data transfer undos and the releasing of memory
! regions (i.e., privatization). However, this ordering is never defined,
! nor is the ordering of dropping references w.r.t. other events.
  
  3.5.18 [New] Transactional indirect calls
  -----------------------------------------
  
  Indirect calls (i.e., calls through a function pointer) within
  transactions should execute the transactional clone of the original
! function (i.e., a clone of the original that has been fully
! instrumented to use the TM runtime), if such a clone is available. The
! runtime provides two functions to register/deregister clone tables:
  
       struct clone_entry
       {
--- 346,381 ----
  ----------------------------------------------
  
  Commit actions will get executed in the same order in which the
! respective calls to '_ITM_addUserCommitAction' happened.  Only
! '_ITM_noTransactionId' is allowed as value for the
! 'resumingTransactionId' argument.  Commit actions get executed after
  privatization safety has been ensured.
  
!    Undo actions will get executed in reverse order compared to the order
! in which the respective calls to '_ITM_addUserUndoAction' happened.  The
! ordering of undo actions w.r.t.  the roll-back of other actions (e.g.,
! data transfers or memory allocations) is undefined.
  
!    '_ITM_getThreadnum' is not supported currently because its only
  purpose is to provide a thread ID that matches some assumed performance
  tuning output, but this output is not part of the ABI nor further
  defined by it.
  
!    '_ITM_dropReferences' is not supported currently because its
! semantics and the intention behind it is not entirely clear.  The
  specification suggests that this function is necessary because of
  certain orderings of data transfer undos and the releasing of memory
! regions (i.e., privatization).  However, this ordering is never defined,
! nor is the ordering of dropping references w.r.t.  other events.
  
  3.5.18 [New] Transactional indirect calls
  -----------------------------------------
  
  Indirect calls (i.e., calls through a function pointer) within
  transactions should execute the transactional clone of the original
! function (i.e., a clone of the original that has been fully instrumented
! to use the TM runtime), if such a clone is available.  The runtime
! provides two functions to register/deregister clone tables:
  
       struct clone_entry
       {
*************** live throughout the life-time of the TM
*** 392,402 ****
  
     *TODO* The intention was always to drop the registration functions
  entirely, and create a new ELF Phdr describing the linker-sorted table.
! Much like what currently happens for `PT_GNU_EH_FRAME'.  This work kept
  getting bogged down in how to represent the N different code generation
  variants.  We clearly needed at least two--SW and HW transactional
! clones--but there was always a suggestion of more variants for
! different TM assumptions/invariants.
  
     The compiler can then use two TM runtime functions to perform
  indirect calls in transactions:
--- 390,400 ----
  
     *TODO* The intention was always to drop the registration functions
  entirely, and create a new ELF Phdr describing the linker-sorted table.
! Much like what currently happens for 'PT_GNU_EH_FRAME'.  This work kept
  getting bogged down in how to represent the N different code generation
  variants.  We clearly needed at least two--SW and HW transactional
! clones--but there was always a suggestion of more variants for different
! TM assumptions/invariants.
  
     The compiler can then use two TM runtime functions to perform
  indirect calls in transactions:
*************** indirect calls in transactions:
*** 404,410 ****
       void *_ITM_getTMCloneSafe (void *function) ITM_REGPARM;
  
     If there is a registered clone for supplied function, both will
! return a pointer to the clone. If not, the first runtime function will
  attempt to switch to serial-irrevocable mode and return the original
  pointer, whereas the second will raise a fatal runtime error.
  
--- 402,408 ----
       void *_ITM_getTMCloneSafe (void *function) ITM_REGPARM;
  
     If there is a registered clone for supplied function, both will
! return a pointer to the clone.  If not, the first runtime function will
  attempt to switch to serial-irrevocable mode and return the original
  pointer, whereas the second will raise a fatal runtime error.
  
*************** pointer, whereas the second will raise a
*** 417,424 ****
              __attribute__((__malloc__)) ITM_PURE;
       void _ITM_free (void *) ITM_PURE;
  
!    These functions are essentially transactional wrappers for `malloc',
! `calloc', and `free'. Within transactions, the compiler should replace
  calls to the original functions with calls to the wrapper functions.
  
  3.6 [No changes] Future Enhancements to the ABI
--- 415,422 ----
              __attribute__((__malloc__)) ITM_PURE;
       void _ITM_free (void *) ITM_PURE;
  
!    These functions are essentially transactional wrappers for 'malloc',
! 'calloc', and 'free'.  Within transactions, the compiler should replace
  calls to the original functions with calls to the wrapper functions.
  
  3.6 [No changes] Future Enhancements to the ABI
*************** calls to the original functions with cal
*** 427,448 ****
  3.7 Sample code
  ===============
  
! The code examples might not be correct w.r.t. the current version of
  the ABI, especially everything related to exception handling.
  
  3.8 [New] Memory model
  ======================
  
! The ABI should define a memory model and the ordering that is
! guaranteed for data transfers and commit/undo actions, or at least
! refer to another memory model that needs to be preserved. Without that,
! the compiler cannot ensure the memory model specified on the level of
! the programming language (e.g., by the C++ TM specification).
  
     For example, if a transactional load is ordered before another
  load/store, then the TM runtime must also ensure this ordering when
! accessing shared state. If not, this might break the kind of
! publication safety used in the C++ TM specification. Likewise, the TM
  runtime must ensure privatization safety.
  
  
--- 425,446 ----
  3.7 Sample code
  ===============
  
! The code examples might not be correct w.r.t.  the current version of
  the ABI, especially everything related to exception handling.
  
  3.8 [New] Memory model
  ======================
  
! The ABI should define a memory model and the ordering that is guaranteed
! for data transfers and commit/undo actions, or at least refer to another
! memory model that needs to be preserved.  Without that, the compiler
! cannot ensure the memory model specified on the level of the programming
! language (e.g., by the C++ TM specification).
  
     For example, if a transactional load is ordered before another
  load/store, then the TM runtime must also ensure this ordering when
! accessing shared state.  If not, this might break the kind of
! publication safety used in the C++ TM specification.  Likewise, the TM
  runtime must ensure privatization safety.
  
  
*************** File: libitm.info,  Node: Internals,  Ne
*** 456,496 ****
  
  libitm supports several ways of synchronizing transactions with each
  other.  These TM methods (or TM algorithms) are implemented in the form
! of subclasses of `abi_dispatch', which provide methods for
! transactional loads and stores as well as callbacks for rollback and
! commit.  All methods that are compatible with each other (i.e., that
! let concurrently running transactions still synchronize correctly even
! if different methods are used) belong to the same TM method group.
! Pointers to TM methods can be obtained using the factory methods
! prefixed with `dispatch_' in `libitm_i.h'. There are two special
! methods, `dispatch_serial' and `dispatch_serialirr', that are
! compatible with all methods because they run transactions completely in
! serial mode.
  
  4.1.1 TM method life cycle
  --------------------------
  
  The state of TM methods does not change after construction, but they do
! alter the state of transactions that use this method. However, because
! per-transaction data gets used by several methods, `gtm_thread' is
  responsible for setting an initial state that is useful for all methods.
! After that, methods are responsible for resetting/clearing this state
! on each rollback or commit (of outermost transactions), so that the
  transaction executed next is not affected by the previous transaction.
  
     There is also global state associated with each method group, which
! is initialized and shut down (`method_group::init()' and `fini()') when
! switching between method groups (see `retry.cc').
  
  4.1.2 Selecting the default method
  ----------------------------------
  
  The default method that libitm uses for freshly started transactions
  (but not necessarily for restarted transactions) can be set via an
! environment variable (`ITM_DEFAULT_METHOD'), whose value should be
! equal to the name of one of the factory methods returning abi_dispatch
! subclasses but without the "dispatch_" prefix (e.g., "serialirr"
! instead of `GTM::dispatch_serialirr()').
  
     Note that this environment variable is only a hint for libitm and
  might not be supported in the future.
--- 454,493 ----
  
  libitm supports several ways of synchronizing transactions with each
  other.  These TM methods (or TM algorithms) are implemented in the form
! of subclasses of 'abi_dispatch', which provide methods for transactional
! loads and stores as well as callbacks for rollback and commit.  All
! methods that are compatible with each other (i.e., that let concurrently
! running transactions still synchronize correctly even if different
! methods are used) belong to the same TM method group.  Pointers to TM
! methods can be obtained using the factory methods prefixed with
! 'dispatch_' in 'libitm_i.h'.  There are two special methods,
! 'dispatch_serial' and 'dispatch_serialirr', that are compatible with all
! methods because they run transactions completely in serial mode.
  
  4.1.1 TM method life cycle
  --------------------------
  
  The state of TM methods does not change after construction, but they do
! alter the state of transactions that use this method.  However, because
! per-transaction data gets used by several methods, 'gtm_thread' is
  responsible for setting an initial state that is useful for all methods.
! After that, methods are responsible for resetting/clearing this state on
! each rollback or commit (of outermost transactions), so that the
  transaction executed next is not affected by the previous transaction.
  
     There is also global state associated with each method group, which
! is initialized and shut down ('method_group::init()' and 'fini()') when
! switching between method groups (see 'retry.cc').
  
  4.1.2 Selecting the default method
  ----------------------------------
  
  The default method that libitm uses for freshly started transactions
  (but not necessarily for restarted transactions) can be set via an
! environment variable ('ITM_DEFAULT_METHOD'), whose value should be equal
! to the name of one of the factory methods returning abi_dispatch
! subclasses but without the "dispatch_" prefix (e.g., "serialirr" instead
! of 'GTM::dispatch_serialirr()').
  
     Note that this environment variable is only a hint for libitm and
  might not be supported in the future.
*************** might not be supported in the future.
*** 498,506 ****
  4.2 Nesting: flat vs. closed
  ============================
  
! We support two different kinds of nesting of transactions. In the case
  of _flat nesting_, the nesting structure is flattened and all nested
! transactions are subsumed by the enclosing transaction. In contrast,
  with _closed nesting_, nested transactions that have not yet committed
  can be rolled back separately from the enclosing transactions; when they
  commit, they are subsumed by the enclosing transaction, and their
--- 495,503 ----
  4.2 Nesting: flat vs. closed
  ============================
  
! We support two different kinds of nesting of transactions.  In the case
  of _flat nesting_, the nesting structure is flattened and all nested
! transactions are subsumed by the enclosing transaction.  In contrast,
  with _closed nesting_, nested transactions that have not yet committed
  can be rolled back separately from the enclosing transactions; when they
  commit, they are subsumed by the enclosing transaction, and their
*************** independently of the enclosing transacti
*** 510,550 ****
  
     Flat nesting is the default nesting mode, but closed nesting is
  supported and used when transactions contain user-controlled aborts
! (`__transaction_cancel' statements). We assume that user-controlled
  aborts are rare in typical code and used mostly in exceptional
! situations.  Thus, it makes more sense to use flat nesting by default
! to avoid the performance overhead of the additional checkpoints
! required for closed nesting. User-controlled aborts will correctly
! abort the innermost enclosing transaction, whereas the whole (i.e.,
! outermost) transaction will be restarted otherwise (e.g., when a
! transaction encounters data conflicts during optimistic execution).
  
  4.3 Locking conventions
  =======================
  
  This section documents the locking scheme and rules for all uses of
! locking in libitm. We have to support serial(-irrevocable) mode, which
! is implemented using a global lock as explained next (called the
! _serial lock_). To simplify the overall design, we use the same lock as
  catch-all locking mechanism for other infrequent tasks such as
! (de)registering clone tables or threads. Besides the serial lock, there
  are _per-method-group locks_ that are managed by specific method groups
  (i.e., groups of similar TM concurrency control algorithms), and
  lock-like constructs for quiescence-based operations such as ensuring
  privatization safety.
  
!    Thus, the actions that participate in the libitm-internal locking
! are either _active transactions_ that do not run in serial mode, _serial
  transactions_ (which (are about to) run in serial mode), and management
  tasks that do not execute within a transaction but have acquired the
  serial mode like a serial transaction would do (e.g., to be able to
! register threads with libitm). Transactions become active as soon as
  they have successfully used the serial lock to announce this globally
! (*note Serial lock implementation: serial-lock-impl.). Likewise,
  transactions become serial transactions as soon as they have acquired
  the exclusive rights provided by the serial lock (i.e., serial mode,
  which also means that there are no other concurrent active or serial
! transactions). Note that active transactions can become serial
  transactions when they enter serial mode during the runtime of the
  transaction.
  
--- 507,547 ----
  
     Flat nesting is the default nesting mode, but closed nesting is
  supported and used when transactions contain user-controlled aborts
! ('__transaction_cancel' statements).  We assume that user-controlled
  aborts are rare in typical code and used mostly in exceptional
! situations.  Thus, it makes more sense to use flat nesting by default to
! avoid the performance overhead of the additional checkpoints required
! for closed nesting.  User-controlled aborts will correctly abort the
! innermost enclosing transaction, whereas the whole (i.e., outermost)
! transaction will be restarted otherwise (e.g., when a transaction
! encounters data conflicts during optimistic execution).
  
  4.3 Locking conventions
  =======================
  
  This section documents the locking scheme and rules for all uses of
! locking in libitm.  We have to support serial(-irrevocable) mode, which
! is implemented using a global lock as explained next (called the _serial
! lock_).  To simplify the overall design, we use the same lock as
  catch-all locking mechanism for other infrequent tasks such as
! (de)registering clone tables or threads.  Besides the serial lock, there
  are _per-method-group locks_ that are managed by specific method groups
  (i.e., groups of similar TM concurrency control algorithms), and
  lock-like constructs for quiescence-based operations such as ensuring
  privatization safety.
  
!    Thus, the actions that participate in the libitm-internal locking are
! either _active transactions_ that do not run in serial mode, _serial
  transactions_ (which (are about to) run in serial mode), and management
  tasks that do not execute within a transaction but have acquired the
  serial mode like a serial transaction would do (e.g., to be able to
! register threads with libitm).  Transactions become active as soon as
  they have successfully used the serial lock to announce this globally
! (*note Serial lock implementation: serial-lock-impl.).  Likewise,
  transactions become serial transactions as soon as they have acquired
  the exclusive rights provided by the serial lock (i.e., serial mode,
  which also means that there are no other concurrent active or serial
! transactions).  Note that active transactions can become serial
  transactions when they enter serial mode during the runtime of the
  transaction.
  
*************** Application data is protected by the ser
*** 555,583 ****
  transaction and no concurrently running active transaction (i.e.,
  non-serial).  Otherwise, application data is protected by the currently
  selected method group, which might use per-method-group locks or other
! mechanisms. Also note that application data that is about to be
  privatized might not be allowed to be accessed by nontransactional code
  until privatization safety has been ensured; the details of this are
  handled by the current method group.
  
     libitm-internal state is either protected by the serial lock or
! accessed through custom concurrent code. The latter applies to the
  public/shared part of a transaction object and most typical
  method-group-specific state.
  
     The former category (protected by the serial lock) includes:
     * The list of active threads that have used transactions.
- 
     * The tables that map functions to their transactional clones.
- 
     * The current selection of which method group to use.
! 
!    * Some method-group-specific data, or invariants of this data. For
       example, resetting a method group to its initial state is handled
       by switching to the same method group, so the serial lock protects
       such resetting as well.
     In general, such state is immutable whenever there exists an active
! (non-serial) transaction. If there is no active transaction, a serial
  transaction (or a thread that is not currently executing a transaction
  but has acquired the serial lock) is allowed to modify this state (but
  must of course be careful to not surprise the current method group's
--- 552,577 ----
  transaction and no concurrently running active transaction (i.e.,
  non-serial).  Otherwise, application data is protected by the currently
  selected method group, which might use per-method-group locks or other
! mechanisms.  Also note that application data that is about to be
  privatized might not be allowed to be accessed by nontransactional code
  until privatization safety has been ensured; the details of this are
  handled by the current method group.
  
     libitm-internal state is either protected by the serial lock or
! accessed through custom concurrent code.  The latter applies to the
  public/shared part of a transaction object and most typical
  method-group-specific state.
  
     The former category (protected by the serial lock) includes:
     * The list of active threads that have used transactions.
     * The tables that map functions to their transactional clones.
     * The current selection of which method group to use.
!    * Some method-group-specific data, or invariants of this data.  For
       example, resetting a method group to its initial state is handled
       by switching to the same method group, so the serial lock protects
       such resetting as well.
     In general, such state is immutable whenever there exists an active
! (non-serial) transaction.  If there is no active transaction, a serial
  transaction (or a thread that is not currently executing a transaction
  but has acquired the serial lock) is allowed to modify this state (but
  must of course be careful to not surprise the current method group's
*************** implementation with such modifications).
*** 587,625 ****
  ----------------------------
  
  To prevent deadlocks, locks acquisition must happen in a globally
! agreed-upon order. Note that this applies to other forms of blocking
  too, but does not necessarily apply to lock acquisitions that do not
! block (e.g., trylock() calls that do not get retried forever). Note
  that serial transactions are never return back to active transactions
! until the transaction has committed.  Likewise, active transactions
! stay active until they have committed.  Per-method-group locks are
! typically also not released before commit.
  
     Lock acquisition / blocking rules:
     * Transactions must become active or serial before they are allowed
       to use method-group-specific locks or blocking (i.e., the serial
!      lock must be acquired before those other locks, either in serial
!      or nonserial mode).
  
!    * Any number of threads that do not currently run active
!      transactions can block while trying to get the serial lock in
!      exclusive mode. Note that active transactions must not block when
!      trying to upgrade to serial mode unless there is no other
!      transaction that is trying that (the latter is ensured by the
!      serial lock implementation.
  
!    * Method groups must prevent deadlocks on their locks. In
       particular, they must also be prepared for another active
       transaction that has acquired method-group-specific locks but is
!      blocked during an attempt to upgrade to being a serial
!      transaction. See below for details.
! 
!    * Serial transactions can acquire method-group-specific locks
!      because there will be no other active nor serial transaction.
  
  
     There is no single rule for per-method-group blocking because this
! depends on when a TM method might acquire locks. If no active
  transaction can upgrade to being a serial transaction after it has
  acquired per-method-group locks (e.g., when those locks are only
  acquired during an attempt to commit), then the TM method does not need
--- 581,618 ----
  ----------------------------
  
  To prevent deadlocks, locks acquisition must happen in a globally
! agreed-upon order.  Note that this applies to other forms of blocking
  too, but does not necessarily apply to lock acquisitions that do not
! block (e.g., trylock() calls that do not get retried forever).  Note
  that serial transactions are never return back to active transactions
! until the transaction has committed.  Likewise, active transactions stay
! active until they have committed.  Per-method-group locks are typically
! also not released before commit.
  
     Lock acquisition / blocking rules:
+ 
     * Transactions must become active or serial before they are allowed
       to use method-group-specific locks or blocking (i.e., the serial
!      lock must be acquired before those other locks, either in serial or
!      nonserial mode).
  
!    * Any number of threads that do not currently run active transactions
!      can block while trying to get the serial lock in exclusive mode.
!      Note that active transactions must not block when trying to upgrade
!      to serial mode unless there is no other transaction that is trying
!      that (the latter is ensured by the serial lock implementation.
  
!    * Method groups must prevent deadlocks on their locks.  In
       particular, they must also be prepared for another active
       transaction that has acquired method-group-specific locks but is
!      blocked during an attempt to upgrade to being a serial transaction.
!      See below for details.
  
+    * Serial transactions can acquire method-group-specific locks because
+      there will be no other active nor serial transaction.
  
     There is no single rule for per-method-group blocking because this
! depends on when a TM method might acquire locks.  If no active
  transaction can upgrade to being a serial transaction after it has
  acquired per-method-group locks (e.g., when those locks are only
  acquired during an attempt to commit), then the TM method does not need
*************** per-method-group locks, then TM methods
*** 632,676 ****
       transactions to finish (*note Serial lock implementation:
       serial-lock-impl. for details), we have to wake up all active
       transactions waiting on the upgrader's per-method-group locks.
- 
     * Active transactions blocking on per-method-group locks need to
       check the serial lock and abort if there is a pending serial
       transaction.
- 
     * Lost wake-ups have to be prevented (e.g., by changing a bit in each
       per-method-group lock before doing the wake-up, and only blocking
       on this lock using a futex if this bit is not group).
  
!    *TODO*: Can reuse serial lock for gl-*? And if we can, does it make
! sense to introduce further complexity in the serial lock? For gl-*, we
  can really only avoid an abort if we do -wb and -vbv.
  
  4.3.3 Serial lock implementation
  --------------------------------
  
  The serial lock implementation is optimized towards assuming that serial
! transactions are infrequent and not the common case. However, the
  performance of entering serial mode can matter because when only few
  transactions are run concurrently or if there are few threads, then it
  can be efficient to run transactions serially.
  
     The serial lock is similar to a multi-reader-single-writer lock in
  that there can be several active transactions but only one serial
! transaction. However, we do want to avoid contention (in the lock
  implementation) between active transactions, so we split up the reader
  side of the lock into per-transaction flags that are true iff the
! transaction is active. The exclusive writer side remains a shared
  single flag, which is acquired using a CAS, for example.  On the
  fast-path, the serial lock then works similar to Dekker's algorithm but
  with several reader flags that a serial transaction would have to check.
  A serial transaction thus requires a list of all threads with
  potentially active transactions; we can use the serial lock itself to
! protect this list (i.e., only threads that have acquired the serial
! lock can modify this list).
  
     We want starvation-freedom for the serial lock to allow for using it
  to ensure progress for potentially starved transactions (*note Progress
! Guarantees: progress-guarantees. for details). However, this is
  currently not enforced by the implementation of the serial lock.
  
     Here is pseudo-code for the read/write fast paths of acquiring the
--- 625,667 ----
       transactions to finish (*note Serial lock implementation:
       serial-lock-impl. for details), we have to wake up all active
       transactions waiting on the upgrader's per-method-group locks.
     * Active transactions blocking on per-method-group locks need to
       check the serial lock and abort if there is a pending serial
       transaction.
     * Lost wake-ups have to be prevented (e.g., by changing a bit in each
       per-method-group lock before doing the wake-up, and only blocking
       on this lock using a futex if this bit is not group).
  
!    *TODO*: Can reuse serial lock for gl-*?  And if we can, does it make
! sense to introduce further complexity in the serial lock?  For gl-*, we
  can really only avoid an abort if we do -wb and -vbv.
  
  4.3.3 Serial lock implementation
  --------------------------------
  
  The serial lock implementation is optimized towards assuming that serial
! transactions are infrequent and not the common case.  However, the
  performance of entering serial mode can matter because when only few
  transactions are run concurrently or if there are few threads, then it
  can be efficient to run transactions serially.
  
     The serial lock is similar to a multi-reader-single-writer lock in
  that there can be several active transactions but only one serial
! transaction.  However, we do want to avoid contention (in the lock
  implementation) between active transactions, so we split up the reader
  side of the lock into per-transaction flags that are true iff the
! transaction is active.  The exclusive writer side remains a shared
  single flag, which is acquired using a CAS, for example.  On the
  fast-path, the serial lock then works similar to Dekker's algorithm but
  with several reader flags that a serial transaction would have to check.
  A serial transaction thus requires a list of all threads with
  potentially active transactions; we can use the serial lock itself to
! protect this list (i.e., only threads that have acquired the serial lock
! can modify this list).
  
     We want starvation-freedom for the serial lock to allow for using it
  to ensure progress for potentially starved transactions (*note Progress
! Guarantees: progress-guarantees. for details).  However, this is
  currently not enforced by the implementation of the serial lock.
  
     Here is pseudo-code for the read/write fast paths of acquiring the
*************** serial lock (read-to-write upgrade is si
*** 694,750 ****
       if (need_blocking) goto slowpath;
  
     Releasing a lock in this spin-lock version then just consists of
! resetting `tx->shared_state' to inactive or clearing
! `serial_lock.exclusive'.
  
     However, we can't rely on a pure spinlock because we need to get the
! OS involved at some time (e.g., when there are more threads than CPUs
! to run on).  Therefore, the real implementation falls back to a
! blocking slow path, either based on pthread mutexes or Linux futexes.
  
  4.3.4 Reentrancy
  ----------------
  
  libitm has to consider the following cases of reentrancy:
     * Transaction calls unsafe code that starts a new transaction: The
!      outer transaction will become a serial transaction before
!      executing unsafe code.  Therefore, nesting within serial
!      transactions must work, even if the nested transaction is called
!      from within uninstrumented code.
  
     * Transaction calls either a transactional wrapper or safe code,
       which in turn starts a new transaction: It is not yet defined in
!      the specification whether this is allowed. Thus, it is undefined
       whether libitm supports this.
  
     * Code that starts new transactions might be called from within any
       part of libitm: This kind of reentrancy would likely be rather
!      complex and can probably be avoided. Therefore, it is not
       supported.
  
- 
  4.3.5 Privatization safety
  --------------------------
  
  Privatization safety is ensured by libitm using a quiescence-based
  approach.  Basically, a privatizing transaction waits until all
! concurrent active transactions will either have finished (are not
! active anymore) or operate on a sufficiently recent snapshot to not
! access the privatized data anymore. This happens after the privatizing
! transaction has stopped being an active transaction, so waiting for
! quiescence does not contribute to deadlocks.
  
     In method groups that need to ensure publication safety explicitly,
  active transactions maintain a flag or timestamp in the public/shared
! part of the transaction descriptor. Before blocking, privatizers need
  to let the other transactions know that they should wake up the
  privatizer.
  
!    *TODO* Ho to implement the waiters? Should those flags be
! per-transaction or at a central place? We want to avoid one wake/wait
  call per active transactions, so we might want to use either a tree or
  combining to reduce the syscall overhead, or rather spin for a long
! amount of time instead of doing blocking. Also, it would be good if
  only the last transaction that the privatizer waits for would do the
  wake-up.
  
--- 685,741 ----
       if (need_blocking) goto slowpath;
  
     Releasing a lock in this spin-lock version then just consists of
! resetting 'tx->shared_state' to inactive or clearing
! 'serial_lock.exclusive'.
  
     However, we can't rely on a pure spinlock because we need to get the
! OS involved at some time (e.g., when there are more threads than CPUs to
! run on).  Therefore, the real implementation falls back to a blocking
! slow path, either based on pthread mutexes or Linux futexes.
  
  4.3.4 Reentrancy
  ----------------
  
  libitm has to consider the following cases of reentrancy:
+ 
     * Transaction calls unsafe code that starts a new transaction: The
!      outer transaction will become a serial transaction before executing
!      unsafe code.  Therefore, nesting within serial transactions must
!      work, even if the nested transaction is called from within
!      uninstrumented code.
  
     * Transaction calls either a transactional wrapper or safe code,
       which in turn starts a new transaction: It is not yet defined in
!      the specification whether this is allowed.  Thus, it is undefined
       whether libitm supports this.
  
     * Code that starts new transactions might be called from within any
       part of libitm: This kind of reentrancy would likely be rather
!      complex and can probably be avoided.  Therefore, it is not
       supported.
  
  4.3.5 Privatization safety
  --------------------------
  
  Privatization safety is ensured by libitm using a quiescence-based
  approach.  Basically, a privatizing transaction waits until all
! concurrent active transactions will either have finished (are not active
! anymore) or operate on a sufficiently recent snapshot to not access the
! privatized data anymore.  This happens after the privatizing transaction
! has stopped being an active transaction, so waiting for quiescence does
! not contribute to deadlocks.
  
     In method groups that need to ensure publication safety explicitly,
  active transactions maintain a flag or timestamp in the public/shared
! part of the transaction descriptor.  Before blocking, privatizers need
  to let the other transactions know that they should wake up the
  privatizer.
  
!    *TODO* Ho to implement the waiters?  Should those flags be
! per-transaction or at a central place?  We want to avoid one wake/wait
  call per active transactions, so we might want to use either a tree or
  combining to reduce the syscall overhead, or rather spin for a long
! amount of time instead of doing blocking.  Also, it would be good if
  only the last transaction that the privatizer waits for would do the
  wake-up.
  
*************** wake-up.
*** 752,787 ****
  -------------------------
  
  Transactions that do not make progress when using the current TM method
! will eventually try to execute in serial mode. Thus, the serial lock's
  progress guarantees determine the progress guarantees of the whole TM.
! Obviously, we at least need deadlock-freedom for the serial lock, but
! it would also be good to provide starvation-freedom (informally, all
  threads will finish executing a transaction eventually iff they get
  enough cycles).
  
     However, the scheduling of transactions (e.g., thread scheduling by
  the OS) also affects the handling of progress guarantees by the TM.
  First, the TM can only guarantee deadlock-freedom if threads do not get
! stopped. Likewise, low-priority threads can starve if they do not get
  scheduled when other high-priority threads get those cycles instead.
  
!    If all threads get scheduled eventually, correct lock
! implementations will provide deadlock-freedom, but might not provide
! starvation-freedom. We can either enforce the latter in the TM's lock
! implementation, or assume that the scheduling is sufficiently random to
! yield a probabilistic guarantee that no thread will starve (because
! eventually, a transaction will encounter a scheduling that will allow
! it to run). This can indeed work well in practice but is not
! necessarily guaranteed to work (e.g., simple spin locks can be pretty
! efficient).
  
!    Because enforcing stronger progress guarantees in the TM has a
! higher runtime overhead, we focus on deadlock-freedom right now and
! assume that the threads will get scheduled eventually by the OS (but
! don't consider threads with different priorities). We should support
! starvation-freedom for serial transactions in the future. Everything
! beyond that is highly related to proper contention management across
! all of the TM (including with TM method to choose), and is future work.
  
     *TODO* Handling thread priorities: We want to avoid priority
  inversion but it's unclear how often that actually matters in practice.
--- 743,777 ----
  -------------------------
  
  Transactions that do not make progress when using the current TM method
! will eventually try to execute in serial mode.  Thus, the serial lock's
  progress guarantees determine the progress guarantees of the whole TM.
! Obviously, we at least need deadlock-freedom for the serial lock, but it
! would also be good to provide starvation-freedom (informally, all
  threads will finish executing a transaction eventually iff they get
  enough cycles).
  
     However, the scheduling of transactions (e.g., thread scheduling by
  the OS) also affects the handling of progress guarantees by the TM.
  First, the TM can only guarantee deadlock-freedom if threads do not get
! stopped.  Likewise, low-priority threads can starve if they do not get
  scheduled when other high-priority threads get those cycles instead.
  
!    If all threads get scheduled eventually, correct lock implementations
! will provide deadlock-freedom, but might not provide starvation-freedom.
! We can either enforce the latter in the TM's lock implementation, or
! assume that the scheduling is sufficiently random to yield a
! probabilistic guarantee that no thread will starve (because eventually,
! a transaction will encounter a scheduling that will allow it to run).
! This can indeed work well in practice but is not necessarily guaranteed
! to work (e.g., simple spin locks can be pretty efficient).
  
!    Because enforcing stronger progress guarantees in the TM has a higher
! runtime overhead, we focus on deadlock-freedom right now and assume that
! the threads will get scheduled eventually by the OS (but don't consider
! threads with different priorities).  We should support
! starvation-freedom for serial transactions in the future.  Everything
! beyond that is highly related to proper contention management across all
! of the TM (including with TM method to choose), and is future work.
  
     *TODO* Handling thread priorities: We want to avoid priority
  inversion but it's unclear how often that actually matters in practice.
*************** GNU Free Documentation License
*** 800,806 ****
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
--- 790,796 ----
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
*************** GNU Free Documentation License
*** 825,845 ****
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.
!      We recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it
!      can be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You
!      accept the license if you copy, modify or distribute the work in a
!      way requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
--- 815,835 ----
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.  We
!      recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it can
!      be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You accept
!      the license if you copy, modify or distribute the work in a way
!      requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
*************** GNU Free Documentation License
*** 857,868 ****
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in
!      the notice that says that the Document is released under this
!      License.  If a section does not fit the above definition of
!      Secondary then it is not allowed to be designated as Invariant.
!      The Document may contain zero Invariant Sections.  If the Document
!      does not identify any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
--- 847,858 ----
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in the
!      notice that says that the Document is released under this License.
!      If a section does not fit the above definition of Secondary then it
!      is not allowed to be designated as Invariant.  The Document may
!      contain zero Invariant Sections.  If the Document does not identify
!      any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
*************** GNU Free Documentation License
*** 873,899 ****
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images
!      composed of pixels) generic paint programs or (for drawings) some
!      widely available drawing editor, and that is suitable for input to
!      text formatters or for automatic translation to a variety of
!      formats suitable for input to text formatters.  A copy made in an
!      otherwise Transparent file format whose markup, or absence of
!      markup, has been arranged to thwart or discourage subsequent
!      modification by readers is not Transparent.  An image format is
!      not Transparent if used for any substantial amount of text.  A
!      copy that is not "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and
!      standard-conforming simple HTML, PostScript or PDF designed for
!      human modification.  Examples of transparent image formats include
!      PNG, XCF and JPG.  Opaque formats include proprietary formats that
!      can be read and edited only by proprietary word processors, SGML or
!      XML for which the DTD and/or processing tools are not generally
!      available, and the machine-generated HTML, PostScript or PDF
!      produced by some word processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
--- 863,889 ----
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images composed
!      of pixels) generic paint programs or (for drawings) some widely
!      available drawing editor, and that is suitable for input to text
!      formatters or for automatic translation to a variety of formats
!      suitable for input to text formatters.  A copy made in an otherwise
!      Transparent file format whose markup, or absence of markup, has
!      been arranged to thwart or discourage subsequent modification by
!      readers is not Transparent.  An image format is not Transparent if
!      used for any substantial amount of text.  A copy that is not
!      "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and standard-conforming
!      simple HTML, PostScript or PDF designed for human modification.
!      Examples of transparent image formats include PNG, XCF and JPG.
!      Opaque formats include proprietary formats that can be read and
!      edited only by proprietary word processors, SGML or XML for which
!      the DTD and/or processing tools are not generally available, and
!      the machine-generated HTML, PostScript or PDF produced by some word
!      processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
*************** GNU Free Documentation License
*** 931,938 ****
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow
!      the conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
--- 921,928 ----
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow the
!      conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
*************** GNU Free Documentation License
*** 946,957 ****
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the
!      title equally prominent and visible.  You may add other material
!      on the covers in addition.  Copying with changes limited to the
!      covers, as long as they preserve the title of the Document and
!      satisfy these conditions, can be treated as verbatim copying in
!      other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
--- 936,946 ----
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the title
!      equally prominent and visible.  You may add other material on the
!      covers in addition.  Copying with changes limited to the covers, as
!      long as they preserve the title of the Document and satisfy these
!      conditions, can be treated as verbatim copying in other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
*************** GNU Free Documentation License
*** 959,998 ****
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a
!      machine-readable Transparent copy along with each Opaque copy, or
!      state in or with each Opaque copy a computer-network location from
!      which the general network-using public has access to download
!      using public-standard network protocols a complete Transparent
!      copy of the Document, free of added material.  If you use the
!      latter option, you must take reasonably prudent steps, when you
!      begin distribution of Opaque copies in quantity, to ensure that
!      this Transparent copy will remain thus accessible at the stated
!      location until at least one year after the last time you
!      distribute an Opaque copy (directly or through your agents or
!      retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of
!      copies, to give them a chance to provide you with an updated
!      version of the Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with
!      the Modified Version filling the role of the Document, thus
!      licensing distribution and modification of the Modified Version to
!      whoever possesses a copy of it.  In addition, you must do these
!      things in the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of
!           previous versions (which should, if there were any, be listed
!           in the History section of the Document).  You may use the
!           same title as a previous version if the original publisher of
!           that version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
--- 948,986 ----
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a machine-readable
!      Transparent copy along with each Opaque copy, or state in or with
!      each Opaque copy a computer-network location from which the general
!      network-using public has access to download using public-standard
!      network protocols a complete Transparent copy of the Document, free
!      of added material.  If you use the latter option, you must take
!      reasonably prudent steps, when you begin distribution of Opaque
!      copies in quantity, to ensure that this Transparent copy will
!      remain thus accessible at the stated location until at least one
!      year after the last time you distribute an Opaque copy (directly or
!      through your agents or retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of copies,
!      to give them a chance to provide you with an updated version of the
!      Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with the
!      Modified Version filling the role of the Document, thus licensing
!      distribution and modification of the Modified Version to whoever
!      possesses a copy of it.  In addition, you must do these things in
!      the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of previous
!           versions (which should, if there were any, be listed in the
!           History section of the Document).  You may use the same title
!           as a previous version if the original publisher of that
!           version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
*************** GNU Free Documentation License
*** 1022,1052 ****
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on
!           the Title Page.  If there is no section Entitled "History" in
!           the Document, create one stating the title, year, authors,
!           and publisher of the Document as given on its Title Page,
!           then add an item describing the Modified Version as stated in
!           the previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in
!           the "History" section.  You may omit a network location for a
!           work that was published at least four years before the
!           Document itself, or if the original publisher of the version
!           it refers to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the
!           section all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document,
!           unaltered in their text and in their titles.  Section numbers
!           or the equivalent are not considered part of the section
!           titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
--- 1010,1039 ----
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on the
!           Title Page.  If there is no section Entitled "History" in the
!           Document, create one stating the title, year, authors, and
!           publisher of the Document as given on its Title Page, then add
!           an item describing the Modified Version as stated in the
!           previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in the
!           "History" section.  You may omit a network location for a work
!           that was published at least four years before the Document
!           itself, or if the original publisher of the version it refers
!           to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the section
!           all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document, unaltered
!           in their text and in their titles.  Section numbers or the
!           equivalent are not considered part of the section titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
*************** GNU Free Documentation License
*** 1059,1069 ****
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option
!      designate some or all of these sections as invariant.  To do this,
!      add their titles to the list of Invariant Sections in the Modified
!      Version's license notice.  These titles must be distinct from any
!      other section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
--- 1046,1056 ----
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option designate
!      some or all of these sections as invariant.  To do this, add their
!      titles to the list of Invariant Sections in the Modified Version's
!      license notice.  These titles must be distinct from any other
!      section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
*************** GNU Free Documentation License
*** 1072,1086 ****
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end
!      of the list of Cover Texts in the Modified Version.  Only one
!      passage of Front-Cover Text and one of Back-Cover Text may be
!      added by (or through arrangements made by) any one entity.  If the
!      Document already includes a cover text for the same cover,
!      previously added by you or by arrangement made by the same entity
!      you are acting on behalf of, you may not add another; but you may
!      replace the old one, on explicit permission from the previous
!      publisher that added the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
--- 1059,1073 ----
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end of
!      the list of Cover Texts in the Modified Version.  Only one passage
!      of Front-Cover Text and one of Back-Cover Text may be added by (or
!      through arrangements made by) any one entity.  If the Document
!      already includes a cover text for the same cover, previously added
!      by you or by arrangement made by the same entity you are acting on
!      behalf of, you may not add another; but you may replace the old
!      one, on explicit permission from the previous publisher that added
!      the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
*************** GNU Free Documentation License
*** 1090,1097 ****
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination
!      all of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
--- 1077,1084 ----
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination all
!      of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
*************** GNU Free Documentation License
*** 1118,1137 ****
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the
!      documents in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow
!      this License in all other respects regarding verbatim copying of
!      that document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of
!      a storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
--- 1105,1124 ----
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the documents
!      in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow this
!      License in all other respects regarding verbatim copying of that
!      document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of a
!      storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
*************** GNU Free Documentation License
*** 1176,1183 ****
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 1163,1170 ----
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** GNU Free Documentation License
*** 1189,1221 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, receipt of a copy of some or all of
!      the same material does not give you any rights to use it.
  
!  10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      `http://www.gnu.org/copyleft/'.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If
!      the Document does not specify a version number of this License,
!      you may choose any version ever published (not as a draft) by the
!      Free Software Foundation.  If the Document specifies that a proxy
!      can decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!  11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
--- 1176,1208 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, receipt of a copy of some or all of the
!      same material does not give you any rights to use it.
  
!   10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      <http://www.gnu.org/copyleft/>.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If the
!      Document does not specify a version number of this License, you may
!      choose any version ever published (not as a draft) by the Free
!      Software Foundation.  If the Document specifies that a proxy can
!      decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!   11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
*************** GNU Free Documentation License
*** 1245,1251 ****
       site under CC-BY-SA on the same site at any time before August 1,
       2009, provided the MMC is eligible for relicensing.
  
- 
  ADDENDUM: How to use this License for your documents
  ====================================================
  
--- 1232,1237 ----
*************** notices just after the title page:
*** 1262,1268 ****
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts." line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
--- 1248,1254 ----
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts."  line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
*************** combination of the three, merge those tw
*** 1273,1281 ****
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of
! free software license, such as the GNU General Public License, to
! permit their use in free software.
  
  
  File: libitm.info,  Node: Library Index,  Prev: GNU Free Documentation License,  Up: Top
--- 1259,1267 ----
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of free
! software license, such as the GNU General Public License, to permit
! their use in free software.
  
  
  File: libitm.info,  Node: Library Index,  Prev: GNU Free Documentation License,  Up: Top
*************** Library Index
*** 1293,1307 ****
  
  
  Tag Table:
! Node: Top1187
! Node: Enabling libitm2090
! Node: C/C++ Language Constructs for TM2484
! Node: The libitm ABI3964
! Ref: txn-code-properties7757
! Node: Internals18032
! Ref: serial-lock-impl28057
! Ref: progress-guarantees32807
! Node: GNU Free Documentation License35081
! Node: Library Index60230
  
  End Tag Table
--- 1279,1293 ----
  
  
  Tag Table:
! Node: Top1141
! Node: Enabling libitm2045
! Node: C/C++ Language Constructs for TM2440
! Node: The libitm ABI3923
! Ref: txn-code-properties7721
! Node: Internals18026
! Ref: serial-lock-impl28064
! Ref: progress-guarantees32825
! Node: GNU Free Documentation License35103
! Node: Library Index60233
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/libjava/ChangeLog gcc-5.5.0/libjava/ChangeLog
*** gcc-5.4.0/libjava/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libjava/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,14 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-09-07  Matthias Klose  <doko@ubuntu.com>
+ 
+ 	* include/x86_64-signal.h (HANDLE_DIVIDE_OVERFLOW): Replace
+ 	'struct ucontext' with ucontext_t.
+ 	* include/i386-signal.h (HANDLE_DIVIDE_OVERFLOW): Likewise.
+ 	* include/s390-signal.h (HANDLE_DIVIDE_OVERFLOW): Likewise.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libjava/classpath/ChangeLog gcc-5.5.0/libjava/classpath/ChangeLog
*** gcc-5.4.0/libjava/classpath/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libjava/classpath/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/cp-tools.info gcc-5.5.0/libjava/classpath/doc/cp-tools.info
*** gcc-5.4.0/libjava/classpath/doc/cp-tools.info	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/cp-tools.info	Tue Oct 10 09:52:09 2017
***************
*** 1,8 ****
! This is cp-tools.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/libjava/classpath/doc/cp-tools.texinfo.
  
! This file documents the Tools included in a standard distribution of
! the GNU Classpath project deliverables.
  
     Copyright (C) 2006, 2007 Free Software Foundation, Inc.
  
--- 1,8 ----
! This is cp-tools.info, produced by makeinfo version 6.1 from
! cp-tools.texinfo.
  
! This file documents the Tools included in a standard distribution of the
! GNU Classpath project deliverables.
  
     Copyright (C) 2006, 2007 Free Software Foundation, Inc.
  
*************** the GNU Classpath project deliverables.
*** 17,25 ****
  
       Permission is granted to copy and distribute translations of this
       manual into another language, under the above conditions for
!      modified versions, except that this permission notice may be
!      stated in a translation approved by the Free Software Foundation.
! 
  INFO-DIR-SECTION GNU Libraries
  START-INFO-DIR-ENTRY
  * Classpath Tools: (cp-tools).  GNU Classpath Tools Guide
--- 17,24 ----
  
       Permission is granted to copy and distribute translations of this
       manual into another language, under the above conditions for
!      modified versions, except that this permission notice may be stated
!      in a translation approved by the Free Software Foundation.
  INFO-DIR-SECTION GNU Libraries
  START-INFO-DIR-ENTRY
  * Classpath Tools: (cp-tools).  GNU Classpath Tools Guide
*************** behavior, to their counter-parts found i
*** 45,51 ****
  * Other Tools::                Other tools in classpath
  * I18N Issues::                How to add support for non-English languages
  
!  --- The Detailed Node Listing ---
  
  Applet Tools
  
--- 44,50 ----
  * Other Tools::                Other tools in classpath
  * I18N Issues::                How to add support for non-English languages
  
!  -- The Detailed Node Listing --
  
  Applet Tools
  
*************** I18N Issues
*** 168,173 ****
--- 167,173 ----
  * Language Resources::         Where resources are located
  * Message Formats::            How messages are internationalized
  
+ 
  
  File: cp-tools.info,  Node: Applet Tools,  Next: Security Tools,  Prev: Top,  Up: Top
  
*************** report it at classpath-bugs
*** 192,303 ****
  
  File: cp-tools.info,  Node: appletviewer Tool,  Next: gcjwebplugin,  Prev: Applet Tools,  Up: Applet Tools
  
! 1.1 The `appletviewer' Tool
  ===========================
  
  SYNOPSIS
  
     appletviewer [OPTION]... URL...
- appletviewer [OPTION]... `-code' CODE
- appletviewer [OPTION]... `-plugin' INPUT,OUTPUT
  
!    DESCRIPTION The `appletviewer' tool loads and runs an applet.
  
     Use the first form to test applets specified by tag.  The URL should
! resolve to an HTML document from which the `appletviewer' will extract
  applet tags.  The APPLET, EMBED and OBJECT tags are supported.  If a
  given document contains multiple applet tags, all the applets will be
  loaded, with each applet appearing in its own window.  Likewise, when
  multiple URLs are specified, each applet tag instance is given its own
  window.  If a given document contains no recognized tags the
! `appletviewer' does nothing.
  
       appletviewer http://www.gnu.org/software/classpath/
  
     Use the second form to test an applet in development.  This form
  allows applet tag attributes to be supplied on the command line.  Only
! one applet may be specified using the `-code' option.  The `-code'
  option overrides the URL form - any URLs specified will be ignored.
  
       appletviewer -code Test.class -param datafile,data.txt
  
!    `gcjwebplugin' uses the third form to communicate with the
! `appletviewer' through named pipes.
  
     URL OPTIONS
! `-debug'
       This option is not yet implemented but is provided for
       compatibility.
  
! `-encoding CHARSET'
       Use this option to specify an alternate character encoding for the
       specified HTML page.
  
- 
     APPLET TAG OPTIONS
! `-code CODE'
!      Use the `-code' option to specify the value of the applet tag CODE
       attribute.
  
! `-codebase CODEBASE'
!      Use the `-codebase' option to specify the value of the applet tag
       CODEBASE attribute.
  
! `-archive ARCHIVE'
!      Use the `-archive' option to specify the value of the applet tag
       ARCHIVE attribute.
  
! `-width WIDTH'
!      Use the `-width' option to specify the value of the applet tag
       WIDTH attribute.
  
! `-height HEIGHT'
!      Use the `-height' option to specify the value of the applet tag
       HEIGHT attribute.
  
! `-param NAME,VALUE'
!      Use the `-param' option to specify values for the NAME and VALUE
       attributes of an applet PARAM tag.
  
- 
     PLUGIN OPTION
! `-plugin INPUT,OUTPUT'
!      `gcjwebplugin' uses the `-plugin' option to specify the named pipe
!      the `appletviewer' should use for receiving commands (INPUT) and
!      the one it should use for sending commands to `gcjwebplugin'
       (OUTPUT).
  
- 
     DEBUGGING OPTION
! `-verbose'
!      Use the `-verbose' option to have the `appletviewer' print
       debugging messages.
  
- 
     STANDARD OPTIONS
  
! `-help'
!      Use the `-help' option to have the `appletviewer' print a usage
       message, then exit.
  
! `-version'
!      Use the `-version' option to have the `appletviewer' print its
       version, then exit.
  
! `-JOPTION'
!      Use the `-J' option to pass OPTION to the virtual machine that
!      will run the `appletviewer'.  Unlike other options, there must not
!      be a space between the `-J' and OPTION.
! 
  
  
  File: cp-tools.info,  Node: gcjwebplugin,  Prev: appletviewer Tool,  Up: Applet Tools
  
! 1.2 The `gcjwebplugin' Tool
  ===========================
  
! `gcjwebplugin' is a plugin that adds applet support to web browsers.
! Currently `gcjwebplugin' only supports Mozilla-based browsers (e.g.,
  Firefox, Galeon, Mozilla).
  
  
--- 192,300 ----
  
  File: cp-tools.info,  Node: appletviewer Tool,  Next: gcjwebplugin,  Prev: Applet Tools,  Up: Applet Tools
  
! 1.1 The 'appletviewer' Tool
  ===========================
  
  SYNOPSIS
  
     appletviewer [OPTION]... URL...
  
!    appletviewer [OPTION]... '-code' CODE
! 
!    appletviewer [OPTION]... '-plugin' INPUT,OUTPUT
! 
!    DESCRIPTION The 'appletviewer' tool loads and runs an applet.
  
     Use the first form to test applets specified by tag.  The URL should
! resolve to an HTML document from which the 'appletviewer' will extract
  applet tags.  The APPLET, EMBED and OBJECT tags are supported.  If a
  given document contains multiple applet tags, all the applets will be
  loaded, with each applet appearing in its own window.  Likewise, when
  multiple URLs are specified, each applet tag instance is given its own
  window.  If a given document contains no recognized tags the
! 'appletviewer' does nothing.
  
       appletviewer http://www.gnu.org/software/classpath/
  
     Use the second form to test an applet in development.  This form
  allows applet tag attributes to be supplied on the command line.  Only
! one applet may be specified using the '-code' option.  The '-code'
  option overrides the URL form - any URLs specified will be ignored.
  
       appletviewer -code Test.class -param datafile,data.txt
  
!    'gcjwebplugin' uses the third form to communicate with the
! 'appletviewer' through named pipes.
  
     URL OPTIONS
! '-debug'
       This option is not yet implemented but is provided for
       compatibility.
  
! '-encoding CHARSET'
       Use this option to specify an alternate character encoding for the
       specified HTML page.
  
     APPLET TAG OPTIONS
! '-code CODE'
!      Use the '-code' option to specify the value of the applet tag CODE
       attribute.
  
! '-codebase CODEBASE'
!      Use the '-codebase' option to specify the value of the applet tag
       CODEBASE attribute.
  
! '-archive ARCHIVE'
!      Use the '-archive' option to specify the value of the applet tag
       ARCHIVE attribute.
  
! '-width WIDTH'
!      Use the '-width' option to specify the value of the applet tag
       WIDTH attribute.
  
! '-height HEIGHT'
!      Use the '-height' option to specify the value of the applet tag
       HEIGHT attribute.
  
! '-param NAME,VALUE'
!      Use the '-param' option to specify values for the NAME and VALUE
       attributes of an applet PARAM tag.
  
     PLUGIN OPTION
! '-plugin INPUT,OUTPUT'
!      'gcjwebplugin' uses the '-plugin' option to specify the named pipe
!      the 'appletviewer' should use for receiving commands (INPUT) and
!      the one it should use for sending commands to 'gcjwebplugin'
       (OUTPUT).
  
     DEBUGGING OPTION
! '-verbose'
!      Use the '-verbose' option to have the 'appletviewer' print
       debugging messages.
  
     STANDARD OPTIONS
  
! '-help'
!      Use the '-help' option to have the 'appletviewer' print a usage
       message, then exit.
  
! '-version'
!      Use the '-version' option to have the 'appletviewer' print its
       version, then exit.
  
! '-JOPTION'
!      Use the '-J' option to pass OPTION to the virtual machine that will
!      run the 'appletviewer'.  Unlike other options, there must not be a
!      space between the '-J' and OPTION.
  
  
  File: cp-tools.info,  Node: gcjwebplugin,  Prev: appletviewer Tool,  Up: Applet Tools
  
! 1.2 The 'gcjwebplugin' Tool
  ===========================
  
! 'gcjwebplugin' is a plugin that adds applet support to web browsers.
! Currently 'gcjwebplugin' only supports Mozilla-based browsers (e.g.,
  Firefox, Galeon, Mozilla).
  
  
*************** File: cp-tools.info,  Node: Security Too
*** 306,317 ****
  2 Security Tools
  ****************
  
! Two Security Tools are available with GNU Classpath: `jarsigner' and
! `keytool'.
  
     To avoid conflicts with other implementations, the jarsigner
! executable is called `gjarsigner' and the keytool executable is called
! `gkeytool'.
  
  * Menu:
  
--- 303,314 ----
  2 Security Tools
  ****************
  
! Two Security Tools are available with GNU Classpath: 'jarsigner' and
! 'keytool'.
  
     To avoid conflicts with other implementations, the jarsigner
! executable is called 'gjarsigner' and the keytool executable is called
! 'gkeytool'.
  
  * Menu:
  
*************** report it at classpath-bugs
*** 325,339 ****
  
  File: cp-tools.info,  Node: jarsigner Tool,  Next: keytool Tool,  Prev: Security Tools,  Up: Security Tools
  
! 2.1 The `jarsigner' Tool
  ========================
  
! The `jarsigner' tool is invoked from the command line, in one of two
  forms, as follows:
  
       jarsigner [OPTION]... FILE ALIAS
  
!      jarsigner `-verify' [OPTION]... FILE
  
     When the first form is used, the tool signs the designated JAR file.
  The second form, on the other hand, is used to verify a previously
--- 322,336 ----
  
  File: cp-tools.info,  Node: jarsigner Tool,  Next: keytool Tool,  Prev: Security Tools,  Up: Security Tools
  
! 2.1 The 'jarsigner' Tool
  ========================
  
! The 'jarsigner' tool is invoked from the command line, in one of two
  forms, as follows:
  
       jarsigner [OPTION]... FILE ALIAS
  
!      jarsigner -verify [OPTION]... FILE
  
     When the first form is used, the tool signs the designated JAR file.
  The second form, on the other hand, is used to verify a previously
*************** signed JAR file.
*** 343,349 ****
  form is used, or to verify if the second syntax form is used instead.
  
     ALIAS must be a known Alias of a Key Entry in the designated Key
! Store. The private key material associated with this Alias is then used
  for signing the designated .JAR file.
  
  * Menu:
--- 340,346 ----
  form is used, or to verify if the second syntax form is used instead.
  
     ALIAS must be a known Alias of a Key Entry in the designated Key
! Store.  The private key material associated with this Alias is then used
  for signing the designated .JAR file.
  
  * Menu:
*************** File: cp-tools.info,  Node: Common jarsi
*** 361,393 ****
  The following options may be used when the tool is used for either
  signing, or verifying, a .JAR file.
  
! `-verbose'
       Use this option to force the tool to generate more verbose
       messages, during its processing.
  
! `-internalsf'
       When present, the tool will include -which otherwise it does not-
!      the `.SF' file in the `.DSA' generated file.
  
! `-sectionsonly'
!      When present, the tool will include in the `.SF' generated file
       -which otherwise it does not- a header containing a hash of the
       whole manifest file.  When that header is included, the tool can
       quickly check, during verification, if the hash (in the header)
       matches or not the manifest file.
  
! `-provider PROVIDER_CLASS_NAME'
       A fully qualified class name of a Security Provider to add to the
       current list of Security Providers already installed in the JVM
!      in-use. If a provider class is specified with this option, and was
       successfully added to the runtime -i.e. it was not already
       installed- then the tool will attempt to remove this Security
       Provider before exiting.
  
! `-help'
       Prints a help text similar to this one.
  
- 
  
  File: cp-tools.info,  Node: Signing Options,  Next: Verification Options,  Prev: Common jarsigner Options,  Up: jarsigner Tool
  
--- 358,389 ----
  The following options may be used when the tool is used for either
  signing, or verifying, a .JAR file.
  
! '-verbose'
       Use this option to force the tool to generate more verbose
       messages, during its processing.
  
! '-internalsf'
       When present, the tool will include -which otherwise it does not-
!      the '.SF' file in the '.DSA' generated file.
  
! '-sectionsonly'
!      When present, the tool will include in the '.SF' generated file
       -which otherwise it does not- a header containing a hash of the
       whole manifest file.  When that header is included, the tool can
       quickly check, during verification, if the hash (in the header)
       matches or not the manifest file.
  
! '-provider PROVIDER_CLASS_NAME'
       A fully qualified class name of a Security Provider to add to the
       current list of Security Providers already installed in the JVM
!      in-use.  If a provider class is specified with this option, and was
       successfully added to the runtime -i.e. it was not already
       installed- then the tool will attempt to remove this Security
       Provider before exiting.
  
! '-help'
       Prints a help text similar to this one.
  
  
  File: cp-tools.info,  Node: Signing Options,  Next: Verification Options,  Prev: Common jarsigner Options,  Up: jarsigner Tool
  
*************** File: cp-tools.info,  Node: Signing Opti
*** 397,454 ****
  The following options may be specified when using the tool for signing
  purposes.
  
! `-keystore URL'
       Use this option to specify the location of the key store to use.
       The default value is a file URL referencing the file named
!      `.keystore' located in the path returned by the call to
!      `java.lang.System#getProperty(String)' using `user.home' as
       argument.
  
!      If a URL was specified, but was found to be malformed -e.g.
!      missing protocol element- the tool will attempt to use the URL
!      value as a file-name (with absolute or relative path-name) of a
!      key store -as if the protocol was `file:'.
  
! `-storetype STORE_TYPE'
!      Use this option to specify the type of the key store to use. The
       default value, if this option is omitted, is that of the property
!      `keystore.type' in the security properties file, which is obtained
!      by invoking the static method call `getDefaultType()' in
!      `java.security.KeyStore'.
  
! `-storepass PASSWORD'
       Use this option to specify the password which will be used to
!      unlock the key store. If this option is missing, the User will be
       prompted to provide a password.
  
! `-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store. If
       this fails, you will then be prompted to provide a password.
  
! `-sigfile NAME'
       Use this option to designate a literal that will be used to
!      construct file names for both the `.SF' and `.DSA' signature
!      files. These files  will be generated, by the tool, and placed in
!      the `META-INF' directory of the signed JAR.  Permissible
!      characters for NAME must be in the range "a-zA-Z0-9_-".  All
!      characters will be converted to upper-case ones.
  
       If this option is missing, the first eight characters of the ALIAS
!      argument will be used. When this is the case, any character in
       ALIAS that is outside the permissible range of characters will be
       replaced by an underscore.
  
! `-signedjar FILE'
!      Use this option to specify the file name of the signed JAR. If
       this option is omitted, then the signed JAR will be named the same
       as FILE; i.e., the input JAR file will be replaced with the signed
       copy.
  
- 
  
  File: cp-tools.info,  Node: Verification Options,  Prev: Signing Options,  Up: jarsigner Tool
  
--- 393,449 ----
  The following options may be specified when using the tool for signing
  purposes.
  
! '-keystore URL'
       Use this option to specify the location of the key store to use.
       The default value is a file URL referencing the file named
!      '.keystore' located in the path returned by the call to
!      'java.lang.System#getProperty(String)' using 'user.home' as
       argument.
  
!      If a URL was specified, but was found to be malformed -e.g. missing
!      protocol element- the tool will attempt to use the URL value as a
!      file-name (with absolute or relative path-name) of a key store -as
!      if the protocol was 'file:'.
  
! '-storetype STORE_TYPE'
!      Use this option to specify the type of the key store to use.  The
       default value, if this option is omitted, is that of the property
!      'keystore.type' in the security properties file, which is obtained
!      by invoking the static method call 'getDefaultType()' in
!      'java.security.KeyStore'.
  
! '-storepass PASSWORD'
       Use this option to specify the password which will be used to
!      unlock the key store.  If this option is missing, the User will be
       prompted to provide a password.
  
! '-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store.  If
       this fails, you will then be prompted to provide a password.
  
! '-sigfile NAME'
       Use this option to designate a literal that will be used to
!      construct file names for both the '.SF' and '.DSA' signature files.
!      These files will be generated, by the tool, and placed in the
!      'META-INF' directory of the signed JAR.  Permissible characters for
!      NAME must be in the range "a-zA-Z0-9_-".  All characters will be
!      converted to upper-case ones.
  
       If this option is missing, the first eight characters of the ALIAS
!      argument will be used.  When this is the case, any character in
       ALIAS that is outside the permissible range of characters will be
       replaced by an underscore.
  
! '-signedjar FILE'
!      Use this option to specify the file name of the signed JAR.  If
       this option is omitted, then the signed JAR will be named the same
       as FILE; i.e., the input JAR file will be replaced with the signed
       copy.
  
  
  File: cp-tools.info,  Node: Verification Options,  Prev: Signing Options,  Up: jarsigner Tool
  
*************** File: cp-tools.info,  Node: Verification
*** 458,572 ****
  The following options may be specified when using the tool for
  verification purposes.
  
! `-verify'
       Use this option to indicate that the tool is to be used for
       verification purposes.
  
! `-certs'
!      This option is used in conjunction with the `-verbose' option.
!      When present, along with the `-verbose' option, the tool will
!      print more detailed information about the certificates of the
!      signer(s) being processed.
! 
  
  
  File: cp-tools.info,  Node: keytool Tool,  Prev: jarsigner Tool,  Up: Security Tools
  
! 2.2 The `keytool' Tool
  ======================
  
  Cryptographic credentials, in a Java environment, are usually stored in
! a Key Store. The Java SDK specifies a Key Store as a persistent
! container of two types of objects: Key Entries and Trusted
! Certificates. The security tool `keytool' is a Java-based application
! for managing those types of objects.
  
     A Key Entry represents the private key part of a key-pair used in
  Public-Key Cryptography, and a signed X.509 certificate which
  authenticates the public key part for a known entity; i.e. the owner of
! the key-pair. The X.509 certificate itself contains the public key part
  of the key-pair.
  
     A Trusted Certificate is a signed X.509 certificate issued by a
! trusted entity. The Trust in this context is relative to the User of
! the `keytool'. In other words, the existence of a Trusted Certificate
! in the Key Store processed by a `keytool' command implies that the User
  trusts the Issuer of that Trusted Certificate to also sign, and hence
  authenticates, other Subjects the tool may process.
  
     Trusted Certificates are important because they allow the tool to
  mechanically construct Chains of Trust starting from one of the Trusted
  Certificates in a Key Store and ending with a certificate whose Issuer
! is potentially unknown. A valid chain is an ordered list, starting with
  a Trusted Certificate (also called the anchor), ending with the target
  certificate, and satisfying the condition that the Subject of
! certificate `#i' is the Issuer of certificate `#i + 1'.
  
!    The `keytool' is invoked from the command line as follows:
  
       keytool [COMMAND] ...
  
     Multiple COMMANDs may be specified at once, each complete with its
! own options. `keytool' will parse all the arguments, before processing,
! and executing, each `COMMAND'. If an exception occurs while executing
! one COMMAND `keytool' will abort. Note however that because the
  implementation of the tool uses code to parse command line options that
! also supports GNU-style options, you have to separate each command
! group with a double-hyphen; e.g
  
       keytool -list -- -printcert -alias mykey
  
     Here is a summary of the commands supported by the tool:
  
    1. Add/Update commands
!     `-genkey [OPTION]...'
            Generate a new Key Entry, eventually creating a new key store.
  
!     `-import [OPTION]...'
!           Add, to a key store, Key Entries (private keys and
!           certificate chains authenticating the public keys) and
!           Trusted Certificates (3rd party certificates which can be
!           used as Trust Anchors when building chains-of-trust).
  
!     `-selfcert [OPTION]...'
            Generate a new self-signed Trusted Certificate.
  
!     `-cacert [OPTION]...'
            Import a CA Trusted Certificate.
  
!     `-identitydb [OPTION]...'
            NOT IMPLEMENTED YET.
            Import a JDK 1.1 style Identity Database.
  
    2. Export commands
!     `-certreq [OPTION]...'
            Issue a Certificate Signing Request (CSR) which can be then
            sent to a Certification Authority (CA) to issue a certificate
            signed (by the CA) and authenticating the Subject of the
            request.
  
!     `-export [OPTION]...'
            Export a certificate from a key store.
  
    3. Display commands
!     `-list [OPTION]...'
!           Print one or all certificates in a key store to `STDOUT'.
  
!     `-printcert [OPTION]...'
            Print a human-readable form of a certificate, in a designated
!           file, to `STDOUT'.
  
    4. Management commands
!     `-keyclone [OPTION]...'
            Clone a Key Entry in a key store.
  
!     `-storepasswd [OPTION]...'
            Change the password protecting a key store.
  
!     `-keypasswd [OPTION]...'
            Change the password protecting a Key Entry in a key store.
  
!     `-delete [OPTION]...'
            Delete a Key Entry or a Trusted Certificate from a key store.
  
  * Menu:
--- 453,566 ----
  The following options may be specified when using the tool for
  verification purposes.
  
! '-verify'
       Use this option to indicate that the tool is to be used for
       verification purposes.
  
! '-certs'
!      This option is used in conjunction with the '-verbose' option.
!      When present, along with the '-verbose' option, the tool will print
!      more detailed information about the certificates of the signer(s)
!      being processed.
  
  
  File: cp-tools.info,  Node: keytool Tool,  Prev: jarsigner Tool,  Up: Security Tools
  
! 2.2 The 'keytool' Tool
  ======================
  
  Cryptographic credentials, in a Java environment, are usually stored in
! a Key Store.  The Java SDK specifies a Key Store as a persistent
! container of two types of objects: Key Entries and Trusted Certificates.
! The security tool 'keytool' is a Java-based application for managing
! those types of objects.
  
     A Key Entry represents the private key part of a key-pair used in
  Public-Key Cryptography, and a signed X.509 certificate which
  authenticates the public key part for a known entity; i.e. the owner of
! the key-pair.  The X.509 certificate itself contains the public key part
  of the key-pair.
  
     A Trusted Certificate is a signed X.509 certificate issued by a
! trusted entity.  The Trust in this context is relative to the User of
! the 'keytool'.  In other words, the existence of a Trusted Certificate
! in the Key Store processed by a 'keytool' command implies that the User
  trusts the Issuer of that Trusted Certificate to also sign, and hence
  authenticates, other Subjects the tool may process.
  
     Trusted Certificates are important because they allow the tool to
  mechanically construct Chains of Trust starting from one of the Trusted
  Certificates in a Key Store and ending with a certificate whose Issuer
! is potentially unknown.  A valid chain is an ordered list, starting with
  a Trusted Certificate (also called the anchor), ending with the target
  certificate, and satisfying the condition that the Subject of
! certificate '#i' is the Issuer of certificate '#i + 1'.
  
!    The 'keytool' is invoked from the command line as follows:
  
       keytool [COMMAND] ...
  
     Multiple COMMANDs may be specified at once, each complete with its
! own options.  'keytool' will parse all the arguments, before processing,
! and executing, each 'COMMAND'.  If an exception occurs while executing
! one COMMAND 'keytool' will abort.  Note however that because the
  implementation of the tool uses code to parse command line options that
! also supports GNU-style options, you have to separate each command group
! with a double-hyphen; e.g
  
       keytool -list -- -printcert -alias mykey
  
     Here is a summary of the commands supported by the tool:
  
    1. Add/Update commands
!      '-genkey [OPTION]...'
            Generate a new Key Entry, eventually creating a new key store.
  
!      '-import [OPTION]...'
!           Add, to a key store, Key Entries (private keys and certificate
!           chains authenticating the public keys) and Trusted
!           Certificates (3rd party certificates which can be used as
!           Trust Anchors when building chains-of-trust).
  
!      '-selfcert [OPTION]...'
            Generate a new self-signed Trusted Certificate.
  
!      '-cacert [OPTION]...'
            Import a CA Trusted Certificate.
  
!      '-identitydb [OPTION]...'
            NOT IMPLEMENTED YET.
            Import a JDK 1.1 style Identity Database.
  
    2. Export commands
!      '-certreq [OPTION]...'
            Issue a Certificate Signing Request (CSR) which can be then
            sent to a Certification Authority (CA) to issue a certificate
            signed (by the CA) and authenticating the Subject of the
            request.
  
!      '-export [OPTION]...'
            Export a certificate from a key store.
  
    3. Display commands
!      '-list [OPTION]...'
!           Print one or all certificates in a key store to 'STDOUT'.
  
!      '-printcert [OPTION]...'
            Print a human-readable form of a certificate, in a designated
!           file, to 'STDOUT'.
  
    4. Management commands
!      '-keyclone [OPTION]...'
            Clone a Key Entry in a key store.
  
!      '-storepasswd [OPTION]...'
            Change the password protecting a key store.
  
!      '-keypasswd [OPTION]...'
            Change the password protecting a Key Entry in a key store.
  
!      '-delete [OPTION]...'
            Delete a Key Entry or a Trusted Certificate from a key store.
  
  * Menu:
*************** File: cp-tools.info,  Node: Getting Help
*** 585,604 ****
  2.2.1 Getting help
  ------------------
  
! To get a general help text about the tool, use the `-help' option; e.g.
  
!      `keytool -help'
  
     To get more specific help text about one of the tool's command use
! the `-help' option for that command; e.g.
  
!      `keytool -genkey -help'
  
!    In both instances, the tool will print a help text and then will
! exit the running JVM.
  
     It is worth noting here that the help messages printed by the tool
! are I18N-ready. This means that if/when the contents of the tool's
  Message Bundle properties file are available in languages other than
  English, you may see those messages in that language.
  
--- 579,598 ----
  2.2.1 Getting help
  ------------------
  
! To get a general help text about the tool, use the '-help' option; e.g.
  
!      keytool -help
  
     To get more specific help text about one of the tool's command use
! the '-help' option for that command; e.g.
  
!      keytool -genkey -help
  
!    In both instances, the tool will print a help text and then will exit
! the running JVM.
  
     It is worth noting here that the help messages printed by the tool
! are I18N-ready.  This means that if/when the contents of the tool's
  Message Bundle properties file are available in languages other than
  English, you may see those messages in that language.
  
*************** File: cp-tools.info,  Node: Common keyto
*** 608,686 ****
  2.2.2 Common options
  --------------------
  
! The following `OPTION's are used in more than one `COMMAND'. They are
  described here to reduce redundancy.
  
! `-alias ALIAS'
       Every entry, be it a Key Entry or a Trusted Certificate, in a key
!      store is uniquely identified by a user-defined ALIAS string. Use
       this option to specify the ALIAS to use when referring to an entry
!      in the key store. Unless specified otherwise, a default value of
!      `mykey' shall be used when this option is omitted from the command
       line.
  
! `-keyalg ALGORITHM'
       Use this option to specify the canonical name of the key-pair
!      generation algorithm. The default value for this option is `DSS'
       (a synonym for the Digital Signature Algorithm also known as DSA).
  
! `-keysize SIZE'
!      Use this option to specify the number of bits of the shared
!      modulus (for both the public and private keys) to use when
!      generating new keys. A default value of `1024' will be used if
!      this option is omitted from the command line.
  
! `-validity DAY_COUNT'
       Use this option to specify the number of days a newly generated
!      certificate will be valid for. The default value is `90' (days) if
       this option is omitted from the command line.
  
! `-storetype STORE_TYPE'
!      Use this option to specify the type of the key store to use. The
       default value, if this option is omitted, is that of the property
!      `keystore.type' in the security properties file, which is obtained
!      by invoking the static method call `getDefaultType()' in
!      `java.security.KeyStore'.
  
! `-storepass PASSWORD'
       Use this option to specify the password protecting the key store.
       If this option is omitted from the command line, you will be
       prompted to provide a password.
  
! `-keystore URL'
       Use this option to specify the location of the key store to use.
       The default value is a file URL referencing the file named
!      `.keystore' located in the path returned by the call to
!      `java.lang.System#getProperty(String)' using `user.home' as
       argument.
  
!      If a URL was specified, but was found to be malformed -e.g.
!      missing protocol element- the tool will attempt to use the URL
!      value as a file-name (with absolute or relative path-name) of a
!      key store -as if the protocol was `file:'.
  
! `-provider PROVIDER_CLASS_NAME'
       A fully qualified class name of a Security Provider to add to the
       current list of Security Providers already installed in the JVM
!      in-use. If a provider class is specified with this option, and was
       successfully added to the runtime -i.e. it was not already
       installed- then the tool will attempt to removed this Security
       Provider before exiting.
  
! `-file FILE'
!      Use this option to designate a file to use with a command. When
       specified with this option, the value is expected to be the fully
!      qualified path of a file accessible by the File System. Depending
!      on the command, the file may be used as input or as output. When
!      this option is omitted from the command line, `STDIN' will be used
!      instead, as the source of input, and `STDOUT' will be used instead
       as the output destination.
  
! `-v'
       Unless specified otherwise, use this option to enable more verbose
       output.
  
- 
  
  File: cp-tools.info,  Node: Distinguished Names,  Next: Add/Update Commands,  Prev: Common keytool Options,  Up: keytool Tool
  
--- 602,679 ----
  2.2.2 Common options
  --------------------
  
! The following 'OPTION's are used in more than one 'COMMAND'.  They are
  described here to reduce redundancy.
  
! '-alias ALIAS'
       Every entry, be it a Key Entry or a Trusted Certificate, in a key
!      store is uniquely identified by a user-defined ALIAS string.  Use
       this option to specify the ALIAS to use when referring to an entry
!      in the key store.  Unless specified otherwise, a default value of
!      'mykey' shall be used when this option is omitted from the command
       line.
  
! '-keyalg ALGORITHM'
       Use this option to specify the canonical name of the key-pair
!      generation algorithm.  The default value for this option is 'DSS'
       (a synonym for the Digital Signature Algorithm also known as DSA).
  
! '-keysize SIZE'
!      Use this option to specify the number of bits of the shared modulus
!      (for both the public and private keys) to use when generating new
!      keys.  A default value of '1024' will be used if this option is
!      omitted from the command line.
  
! '-validity DAY_COUNT'
       Use this option to specify the number of days a newly generated
!      certificate will be valid for.  The default value is '90' (days) if
       this option is omitted from the command line.
  
! '-storetype STORE_TYPE'
!      Use this option to specify the type of the key store to use.  The
       default value, if this option is omitted, is that of the property
!      'keystore.type' in the security properties file, which is obtained
!      by invoking the static method call 'getDefaultType()' in
!      'java.security.KeyStore'.
  
! '-storepass PASSWORD'
       Use this option to specify the password protecting the key store.
       If this option is omitted from the command line, you will be
       prompted to provide a password.
  
! '-keystore URL'
       Use this option to specify the location of the key store to use.
       The default value is a file URL referencing the file named
!      '.keystore' located in the path returned by the call to
!      'java.lang.System#getProperty(String)' using 'user.home' as
       argument.
  
!      If a URL was specified, but was found to be malformed -e.g. missing
!      protocol element- the tool will attempt to use the URL value as a
!      file-name (with absolute or relative path-name) of a key store -as
!      if the protocol was 'file:'.
  
! '-provider PROVIDER_CLASS_NAME'
       A fully qualified class name of a Security Provider to add to the
       current list of Security Providers already installed in the JVM
!      in-use.  If a provider class is specified with this option, and was
       successfully added to the runtime -i.e. it was not already
       installed- then the tool will attempt to removed this Security
       Provider before exiting.
  
! '-file FILE'
!      Use this option to designate a file to use with a command.  When
       specified with this option, the value is expected to be the fully
!      qualified path of a file accessible by the File System.  Depending
!      on the command, the file may be used as input or as output.  When
!      this option is omitted from the command line, 'STDIN' will be used
!      instead, as the source of input, and 'STDOUT' will be used instead
       as the output destination.
  
! '-v'
       Unless specified otherwise, use this option to enable more verbose
       output.
  
  
  File: cp-tools.info,  Node: Distinguished Names,  Next: Add/Update Commands,  Prev: Common keytool Options,  Up: keytool Tool
  
*************** File: cp-tools.info,  Node: Distinguishe
*** 688,723 ****
  -------------------------------
  
  A Distinguished Name (or DN) MUST be supplied with some of the
! `COMMAND's using a `-dname' option. The syntax of a valid value for
! this option MUST follow RFC-2253 specifications. Namely the following
! components (with their accepted meaning) will be recognized. Note that
  the component name is case-insensitive:
  
  CN
!      The Common Name; e.g. `host.domain.com'
! 
  OU
!      The Organizational Unit; e.g. `IT Department'
! 
  O
!      The Organization Name; e.g. `The Sample Company'
! 
  L
!      The Locality Name; e.g. `Sydney'
! 
  ST
!      The State Name; e.g. `New South Wales'
! 
  C
!      The 2-letter Country identifier; e.g. `AU'
  
!    When specified with a `-dname' option, each pair of component/value
! will be separated from the other with a comma. Each component and value
! pair MUST be separated by an equal sign. For example, the following is
  a valid DN value:
  CN=host.domain.com, O=The Sample Company, L=Sydney, ST=NSW, C=AU
  
! If the Distinguished Name is required, and no valid default value can
  be used, the tool will prompt you to enter the information through the
  console.
  
--- 681,712 ----
  -------------------------------
  
  A Distinguished Name (or DN) MUST be supplied with some of the
! 'COMMAND's using a '-dname' option.  The syntax of a valid value for
! this option MUST follow RFC-2253 specifications.  Namely the following
! components (with their accepted meaning) will be recognized.  Note that
  the component name is case-insensitive:
  
  CN
!      The Common Name; e.g. 'host.domain.com'
  OU
!      The Organizational Unit; e.g. 'IT Department'
  O
!      The Organization Name; e.g. 'The Sample Company'
  L
!      The Locality Name; e.g. 'Sydney'
  ST
!      The State Name; e.g. 'New South Wales'
  C
!      The 2-letter Country identifier; e.g. 'AU'
  
!    When specified with a '-dname' option, each pair of component/value
! will be separated from the other with a comma.  Each component and value
! pair MUST be separated by an equal sign.  For example, the following is
  a valid DN value:
+ 
  CN=host.domain.com, O=The Sample Company, L=Sydney, ST=NSW, C=AU
  
!    If the Distinguished Name is required, and no valid default value can
  be used, the tool will prompt you to enter the information through the
  console.
  
*************** File: cp-tools.info,  Node: Add/Update C
*** 738,1011 ****
  
  File: cp-tools.info,  Node: Command -genkey,  Next: Command -import,  Prev: Add/Update Commands,  Up: Add/Update Commands
  
! 2.2.4.1 The `-genkey' command
  .............................
  
  Use this command to generate a new key-pair (both private and public
  keys), and save these credentials in the key store as a Key Entry,
! associated with the designated (if was specified with the `-alias'
! option) or default (if the `-alias' option is omitted) Alias.
  
     The private key material will be protected with a user-defined
! password (see `-keypass' option). The public key on the other hand will
  be part of a self-signed X.509 certificate, which will form a 1-element
  chain and will be saved in the key store.
  
! `-alias ALIAS'
       For more details *note ALIAS: alias.
  
! `-keyalg ALGORITHM'
       For more details *note ALGORITHM: keyalg.
  
! `-keysize KEY_SIZE'
       For more details *note KEY_SIZE: keysize.
  
! `-sigalg ALGORITHM'
       The canonical name of the digital signature algorithm to use for
!      signing certificates. If this option is omitted, a default value
       will be chosen based on the type of the key-pair; i.e., the
!      algorithm that ends up being used by the -keyalg option. If the
!      key-pair generation algorithm is `DSA', the value for the
!      signature algorithm will be `SHA1withDSA'. If on the other hand
!      the key-pair generation algorithm is `RSA', then the tool will use
!      `MD5withRSA' as the signature algorithm.
  
! `-dname NAME'
!      This a mandatory value for the command. If no value is specified
!      -i.e. the `-dname' option is omitted- the tool will prompt you to
       enter a Distinguished Name to use as both the Owner and Issuer of
       the generated self-signed certificate.
  
       For more details *note X.500 DISTINGUISHED NAME: dn.
  
! `-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       protect the newly created Key Entry.
  
       If this option is omitted, you will be prompted to provide a
       password.
  
! `-validity DAY_COUNT'
       For more details *note DAY_COUNT: validity.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Command -import,  Next: Command -selfcert,  Prev: Command -genkey,  Up: Add/Update Commands
  
! 2.2.4.2 The `-import' command
  .............................
  
  Use this command to read an X.509 certificate, or a PKCS#7 Certificate
  Reply from a designated input source and incorporate the certificates
  into the key store.
  
!    If the Alias does not already exist in the key store, the tool
! treats the certificate read from the input source as a new Trusted
! Certificate. It then attempts to discover a chain-of-trust, starting
! from that certificate and ending at another Trusted Certificate,
! already stored in the key store. If the `-trustcacerts' option is
! present, an additional key store, of type `JKS' named `cacerts', and
! assumed to be present in `${JAVA_HOME}/lib/security' will also be
! consulted if found -`${JAVA_HOME}' refers to the location of an
! installed Java Runtime Environment (JRE). If no chain-of-trust can be
! established, and unless the `-noprompt' option has been specified, the
! certificate is printed to `STDOUT' and the user is prompted for a
! confirmation.
  
     If Alias exists in the key store, the tool will treat the
  certificate(s) read from the input source as a Certificate Reply, which
  can be a chain of certificates, that eventually would replace the chain
! of certificates associated with the Key Entry of that Alias. The
  substitution of the certificates only occurs if a chain-of-trust can be
  established between the bottom certificate of the chain read from the
  input file and the Trusted Certificates already present in the key
! store. Again, if the `-trustcacerts' option is specified, additional
! Trusted Certificates in the same `cacerts' key store will be
! considered. If no chain-of-trust can be established, the operation will
! abort.
  
! `-alias ALIAS'
       For more details *note ALIAS: alias.
  
! `-file FILE'
       For more details *note FILE: file.
  
! `-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       protect the Key Entry associated with the designated Alias, when
       replacing this Alias' chain of certificates with that found in the
       certificate reply.
  
       If this option is omitted, and the chain-of-trust for the
!      certificate reply has been established, the tool will first
!      attempt to unlock the Key Entry using the same password protecting
!      the key store. If this fails, you will then be prompted to provide
!      a password.
  
! `-noprompt'
       Use this option to prevent the tool from prompting the user.
  
! `-trustcacerts'
       Use this option to indicate to the tool that a key store, of type
!      `JKS', named `cacerts', and usually located in `lib/security' in
!      an installed Java Runtime Environment should be considered when
!      trying to establish chain-of-trusts.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Command -selfcert,  Next: Command -cacert,  Prev: Command -import,  Up: Add/Update Commands
  
! 2.2.4.3 The `-selfcert' command
  ...............................
  
  Use this command to generate a self-signed X.509 version 1 certificate.
  The newly generated certificate will form a chain of one element which
! will replace the previous chain associated with the designated Alias
! (if `-alias' option was specified), or the default Alias (if `-alias'
! option was omitted).
  
! `-alias ALIAS'
       For more details *note ALIAS: alias.
  
! `-sigalg ALGORITHM'
       The canonical name of the digital signature algorithm to use for
!      signing the certificate. If this option is omitted, a default
       value will be chosen based on the type of the private key
!      associated with the designated Alias. If the private key is a
!      `DSA' one, the value for the signature algorithm will be
!      `SHA1withDSA'. If on the other hand the private key is an `RSA'
!      one, then the tool will use `MD5withRSA' as the signature
       algorithm.
  
! `-dname NAME'
       Use this option to specify the Distinguished Name of the newly
!      generated self-signed certificate. If this option is omitted, the
       existing Distinguished Name of the base certificate in the chain
       associated with the designated Alias will be used instead.
  
       For more details *note X.500 DISTINGUISHED NAME: dn.
  
! `-validity DAY_COUNT'
       For more details *note DAY_COUNT: validity.
  
! `-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store. If
       this fails, you will then be prompted to provide a password.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Command -cacert,  Next: Command -identitydb,  Prev: Command -selfcert,  Up: Add/Update Commands
  
! 2.2.4.4 The `-cacert' command
  .............................
  
! Use this command to import, a CA certificate and add it to the key
! store as a Trusted Certificate. The Alias for this new entry will be
  constructed from the FILE's base-name after replacing hyphens and dots
  with underscores.
  
     This command is useful when used in a script that recursively visits
! a directory of CA certificates to populate a `cacerts.gkr' Key Store of
  trusted certificates which can then be used commands that specify the
! `-trustcacerts' option.
  
! `-file FILE'
       For more details *note FILE: file.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Command -identitydb,  Prev: Command -cacert,  Up: Add/Update Commands
  
! 2.2.4.5 The `-identitydb' command
  .................................
  
  NOT IMPLEMENTED YET.
  
     Use this command to import a JDK 1.1 style Identity Database.
  
! `-file FILE'
       For more details *note FILE: file.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Export Commands,  Next: Display Commands,  Prev: Add/Update Commands,  Up: keytool Tool
  
--- 727,993 ----
  
  File: cp-tools.info,  Node: Command -genkey,  Next: Command -import,  Prev: Add/Update Commands,  Up: Add/Update Commands
  
! 2.2.4.1 The '-genkey' command
  .............................
  
  Use this command to generate a new key-pair (both private and public
  keys), and save these credentials in the key store as a Key Entry,
! associated with the designated (if was specified with the '-alias'
! option) or default (if the '-alias' option is omitted) Alias.
  
     The private key material will be protected with a user-defined
! password (see '-keypass' option).  The public key on the other hand will
  be part of a self-signed X.509 certificate, which will form a 1-element
  chain and will be saved in the key store.
  
! '-alias ALIAS'
       For more details *note ALIAS: alias.
  
! '-keyalg ALGORITHM'
       For more details *note ALGORITHM: keyalg.
  
! '-keysize KEY_SIZE'
       For more details *note KEY_SIZE: keysize.
  
! '-sigalg ALGORITHM'
       The canonical name of the digital signature algorithm to use for
!      signing certificates.  If this option is omitted, a default value
       will be chosen based on the type of the key-pair; i.e., the
!      algorithm that ends up being used by the -keyalg option.  If the
!      key-pair generation algorithm is 'DSA', the value for the signature
!      algorithm will be 'SHA1withDSA'.  If on the other hand the key-pair
!      generation algorithm is 'RSA', then the tool will use 'MD5withRSA'
!      as the signature algorithm.
  
! '-dname NAME'
!      This a mandatory value for the command.  If no value is specified
!      -i.e. the '-dname' option is omitted- the tool will prompt you to
       enter a Distinguished Name to use as both the Owner and Issuer of
       the generated self-signed certificate.
  
       For more details *note X.500 DISTINGUISHED NAME: dn.
  
! '-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       protect the newly created Key Entry.
  
       If this option is omitted, you will be prompted to provide a
       password.
  
! '-validity DAY_COUNT'
       For more details *note DAY_COUNT: validity.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Command -import,  Next: Command -selfcert,  Prev: Command -genkey,  Up: Add/Update Commands
  
! 2.2.4.2 The '-import' command
  .............................
  
  Use this command to read an X.509 certificate, or a PKCS#7 Certificate
  Reply from a designated input source and incorporate the certificates
  into the key store.
  
!    If the Alias does not already exist in the key store, the tool treats
! the certificate read from the input source as a new Trusted Certificate.
! It then attempts to discover a chain-of-trust, starting from that
! certificate and ending at another Trusted Certificate, already stored in
! the key store.  If the '-trustcacerts' option is present, an additional
! key store, of type 'JKS' named 'cacerts', and assumed to be present in
! '${JAVA_HOME}/lib/security' will also be consulted if found
! -'${JAVA_HOME}' refers to the location of an installed Java Runtime
! Environment (JRE). If no chain-of-trust can be established, and unless
! the '-noprompt' option has been specified, the certificate is printed to
! 'STDOUT' and the user is prompted for a confirmation.
  
     If Alias exists in the key store, the tool will treat the
  certificate(s) read from the input source as a Certificate Reply, which
  can be a chain of certificates, that eventually would replace the chain
! of certificates associated with the Key Entry of that Alias.  The
  substitution of the certificates only occurs if a chain-of-trust can be
  established between the bottom certificate of the chain read from the
  input file and the Trusted Certificates already present in the key
! store.  Again, if the '-trustcacerts' option is specified, additional
! Trusted Certificates in the same 'cacerts' key store will be considered.
! If no chain-of-trust can be established, the operation will abort.
  
! '-alias ALIAS'
       For more details *note ALIAS: alias.
  
! '-file FILE'
       For more details *note FILE: file.
  
! '-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       protect the Key Entry associated with the designated Alias, when
       replacing this Alias' chain of certificates with that found in the
       certificate reply.
  
       If this option is omitted, and the chain-of-trust for the
!      certificate reply has been established, the tool will first attempt
!      to unlock the Key Entry using the same password protecting the key
!      store.  If this fails, you will then be prompted to provide a
!      password.
  
! '-noprompt'
       Use this option to prevent the tool from prompting the user.
  
! '-trustcacerts'
       Use this option to indicate to the tool that a key store, of type
!      'JKS', named 'cacerts', and usually located in 'lib/security' in an
!      installed Java Runtime Environment should be considered when trying
!      to establish chain-of-trusts.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Command -selfcert,  Next: Command -cacert,  Prev: Command -import,  Up: Add/Update Commands
  
! 2.2.4.3 The '-selfcert' command
  ...............................
  
  Use this command to generate a self-signed X.509 version 1 certificate.
  The newly generated certificate will form a chain of one element which
! will replace the previous chain associated with the designated Alias (if
! '-alias' option was specified), or the default Alias (if '-alias' option
! was omitted).
  
! '-alias ALIAS'
       For more details *note ALIAS: alias.
  
! '-sigalg ALGORITHM'
       The canonical name of the digital signature algorithm to use for
!      signing the certificate.  If this option is omitted, a default
       value will be chosen based on the type of the private key
!      associated with the designated Alias.  If the private key is a
!      'DSA' one, the value for the signature algorithm will be
!      'SHA1withDSA'.  If on the other hand the private key is an 'RSA'
!      one, then the tool will use 'MD5withRSA' as the signature
       algorithm.
  
! '-dname NAME'
       Use this option to specify the Distinguished Name of the newly
!      generated self-signed certificate.  If this option is omitted, the
       existing Distinguished Name of the base certificate in the chain
       associated with the designated Alias will be used instead.
  
       For more details *note X.500 DISTINGUISHED NAME: dn.
  
! '-validity DAY_COUNT'
       For more details *note DAY_COUNT: validity.
  
! '-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store.  If
       this fails, you will then be prompted to provide a password.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Command -cacert,  Next: Command -identitydb,  Prev: Command -selfcert,  Up: Add/Update Commands
  
! 2.2.4.4 The '-cacert' command
  .............................
  
! Use this command to import, a CA certificate and add it to the key store
! as a Trusted Certificate.  The Alias for this new entry will be
  constructed from the FILE's base-name after replacing hyphens and dots
  with underscores.
  
     This command is useful when used in a script that recursively visits
! a directory of CA certificates to populate a 'cacerts.gkr' Key Store of
  trusted certificates which can then be used commands that specify the
! '-trustcacerts' option.
  
! '-file FILE'
       For more details *note FILE: file.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Command -identitydb,  Prev: Command -cacert,  Up: Add/Update Commands
  
! 2.2.4.5 The '-identitydb' command
  .................................
  
  NOT IMPLEMENTED YET.
  
     Use this command to import a JDK 1.1 style Identity Database.
  
! '-file FILE'
       For more details *note FILE: file.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Export Commands,  Next: Display Commands,  Prev: Add/Update Commands,  Up: keytool Tool
  
*************** File: cp-tools.info,  Node: Export Comma
*** 1020,1031 ****
  
  File: cp-tools.info,  Node: Command -certreq,  Next: Command -export,  Prev: Export Commands,  Up: Export Commands
  
! 2.2.5.1 The `-certreq' command
  ..............................
  
! Use this command to generate a PKCS#10 Certificate Signing Request
! (CSR) and write it to a designated output destination. The contents of
! the destination should look something like the following:
  
       -----BEGIN NEW CERTIFICATE REQUEST-----
       MI...QAwXzEUMBIGA1UEAwwLcnNuQGdudS5vcmcxGzAZBgNVBAoMElUg
--- 1002,1013 ----
  
  File: cp-tools.info,  Node: Command -certreq,  Next: Command -export,  Prev: Export Commands,  Up: Export Commands
  
! 2.2.5.1 The '-certreq' command
  ..............................
  
! Use this command to generate a PKCS#10 Certificate Signing Request (CSR)
! and write it to a designated output destination.  The contents of the
! destination should look something like the following:
  
       -----BEGIN NEW CERTIFICATE REQUEST-----
       MI...QAwXzEUMBIGA1UEAwwLcnNuQGdudS5vcmcxGzAZBgNVBAoMElUg
*************** the destination should look something li
*** 1035,1129 ****
       -----END NEW CERTIFICATE REQUEST-----
  
     IMPORTANT: Some documentation (e.g. RSA examples) claims that the
! `Attributes' field, in the CSR is `OPTIONAL' while RFC-2986 implies the
! opposite. This implementation considers this field, by default, as
! `OPTIONAL', unless the option `-attributes' is specified on the command
  line.
  
! `-alias ALIAS'
       For more details *note ALIAS: alias.
  
! `-sigalg ALGORITHM'
       The canonical name of the digital signature algorithm to use for
!      signing the certificate. If this option is omitted, a default
       value will be chosen based on the type of the private key
!      associated with the designated Alias. If the private key is a
!      `DSA' one, the value for the signature algorithm will be
!      `SHA1withDSA'. If on the other hand the private key is an `RSA'
!      one, then the tool will use `MD5withRSA' as the signature
       algorithm.
  
! `-file FILE'
       For more details *note FILE: file.
  
! `-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store. If
       this fails, you will then be prompted to provide a password.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
! `-attributes'
!      Use this option to force the tool to encode a `NULL' DER value in
!      the CSR as the value of the `Attributes' field.
! 
  
  
  File: cp-tools.info,  Node: Command -export,  Prev: Command -certreq,  Up: Export Commands
  
! 2.2.5.2 The `-export' command
  .............................
  
  Use this command to export a certificate stored in a key store to a
! designated output destination, either in binary format (if the `-v'
! option is specified), or in RFC-1421 compliant encoding (if the `-rfc'
  option is specified instead).
  
! `-alias ALIAS'
       For more details *note ALIAS: alias.
  
! `-file FILE'
       For more details *note FILE: file.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-rfc'
       Use RFC-1421 specifications when encoding the output.
  
! `-v'
!      Output the certificate in binary DER encoding. This is the default
!      output format of the command if neither `-rfc' nor `-v' options
!      were detected on the command line. If both this option and the
!      `-rfc' option are detected on the command line, the tool will opt
       for the RFC-1421 style encoding.
  
- 
  
  File: cp-tools.info,  Node: Display Commands,  Next: Management Commands,  Prev: Export Commands,  Up: keytool Tool
  
--- 1017,1109 ----
       -----END NEW CERTIFICATE REQUEST-----
  
     IMPORTANT: Some documentation (e.g. RSA examples) claims that the
! 'Attributes' field, in the CSR is 'OPTIONAL' while RFC-2986 implies the
! opposite.  This implementation considers this field, by default, as
! 'OPTIONAL', unless the option '-attributes' is specified on the command
  line.
  
! '-alias ALIAS'
       For more details *note ALIAS: alias.
  
! '-sigalg ALGORITHM'
       The canonical name of the digital signature algorithm to use for
!      signing the certificate.  If this option is omitted, a default
       value will be chosen based on the type of the private key
!      associated with the designated Alias.  If the private key is a
!      'DSA' one, the value for the signature algorithm will be
!      'SHA1withDSA'.  If on the other hand the private key is an 'RSA'
!      one, then the tool will use 'MD5withRSA' as the signature
       algorithm.
  
! '-file FILE'
       For more details *note FILE: file.
  
! '-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store.  If
       this fails, you will then be prompted to provide a password.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
! '-attributes'
!      Use this option to force the tool to encode a 'NULL' DER value in
!      the CSR as the value of the 'Attributes' field.
  
  
  File: cp-tools.info,  Node: Command -export,  Prev: Command -certreq,  Up: Export Commands
  
! 2.2.5.2 The '-export' command
  .............................
  
  Use this command to export a certificate stored in a key store to a
! designated output destination, either in binary format (if the '-v'
! option is specified), or in RFC-1421 compliant encoding (if the '-rfc'
  option is specified instead).
  
! '-alias ALIAS'
       For more details *note ALIAS: alias.
  
! '-file FILE'
       For more details *note FILE: file.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-rfc'
       Use RFC-1421 specifications when encoding the output.
  
! '-v'
!      Output the certificate in binary DER encoding.  This is the default
!      output format of the command if neither '-rfc' nor '-v' options
!      were detected on the command line.  If both this option and the
!      '-rfc' option are detected on the command line, the tool will opt
       for the RFC-1421 style encoding.
  
  
  File: cp-tools.info,  Node: Display Commands,  Next: Management Commands,  Prev: Export Commands,  Up: keytool Tool
  
*************** File: cp-tools.info,  Node: Display Comm
*** 1138,1194 ****
  
  File: cp-tools.info,  Node: Command -list,  Next: Command -printcert,  Prev: Display Commands,  Up: Display Commands
  
! 2.2.6.1 The `-list' command
  ...........................
  
! Use this command to print one or all of a key store entries to
! `STDOUT'. Usually this command will only print a fingerprint of the
! certificate, unless either the `-rfc' or the `-v' option is specified.
  
! `-alias ALIAS'
       If this option is omitted, the tool will print ALL the entries
       found in the key store.
  
       For more details *note ALIAS: alias.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-rfc'
       Use RFC-1421 specifications when encoding the output.
  
! `-v'
!      Output the certificate in human-readable format. If both this
!      option and the `-rfc' option are detected on the command line, the
       tool will opt for the human-readable form and will not abort the
       command.
  
- 
  
  File: cp-tools.info,  Node: Command -printcert,  Prev: Command -list,  Up: Display Commands
  
! 2.2.6.2 The `-printcert' command
  ................................
  
  Use this command to read a certificate from a designated input source
! and print it to `STDOUT' in a human-readable form.
  
! `-file FILE'
       For more details *note FILE: file.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Management Commands,  Prev: Display Commands,  Up: keytool Tool
  
--- 1118,1172 ----
  
  File: cp-tools.info,  Node: Command -list,  Next: Command -printcert,  Prev: Display Commands,  Up: Display Commands
  
! 2.2.6.1 The '-list' command
  ...........................
  
! Use this command to print one or all of a key store entries to 'STDOUT'.
! Usually this command will only print a fingerprint of the certificate,
! unless either the '-rfc' or the '-v' option is specified.
  
! '-alias ALIAS'
       If this option is omitted, the tool will print ALL the entries
       found in the key store.
  
       For more details *note ALIAS: alias.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-rfc'
       Use RFC-1421 specifications when encoding the output.
  
! '-v'
!      Output the certificate in human-readable format.  If both this
!      option and the '-rfc' option are detected on the command line, the
       tool will opt for the human-readable form and will not abort the
       command.
  
  
  File: cp-tools.info,  Node: Command -printcert,  Prev: Command -list,  Up: Display Commands
  
! 2.2.6.2 The '-printcert' command
  ................................
  
  Use this command to read a certificate from a designated input source
! and print it to 'STDOUT' in a human-readable form.
  
! '-file FILE'
       For more details *note FILE: file.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Management Commands,  Prev: Display Commands,  Up: keytool Tool
  
*************** File: cp-tools.info,  Node: Management C
*** 1205,1346 ****
  
  File: cp-tools.info,  Node: Command -keyclone,  Next: Command -storepasswd,  Prev: Management Commands,  Up: Management Commands
  
! 2.2.7.1 The `-keyclone' command
  ...............................
  
! Use this command to clone an existing Key Entry and store it under a
! new (different) Alias protecting, its private key material with
! possibly a new password.
  
! `-alias ALIAS'
       For more details *note ALIAS: alias.
  
! `-dest ALIAS'
       Use this option to specify the new Alias which will be used to
       identify the cloned copy of the Key Entry.
  
! `-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store. If
       this fails, you will then be prompted to provide a password.
  
! `-new PASSWORD'
       Use this option to specify the password protecting the private key
       material of the newly cloned copy of the Key Entry.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Command -storepasswd,  Next: Command -keypasswd,  Prev: Command -keyclone,  Up: Management Commands
  
! 2.2.7.2 The `-storepasswd' command
  ..................................
  
  Use this command to change the password protecting a key store.
  
! `-new PASSWORD'
       The new, and different, password which will be used to protect the
       designated key store.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Command -keypasswd,  Next: Command -delete,  Prev: Command -storepasswd,  Up: Management Commands
  
! 2.2.7.3 The `-keypasswd' command
  ................................
  
  Use this command to change the password protecting the private key
  material of a designated Key Entry.
  
! `-alias ALIAS'
       For more details *note ALIAS: alias.
  
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store. If
       this fails, you will then be prompted to provide a password.
  
! `-new PASSWORD'
       The new, and different, password which will be used to protect the
       private key material of the designated Key Entry.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Command -delete,  Prev: Command -keypasswd,  Up: Management Commands
  
! 2.2.7.4 The `-delete' command
  .............................
  
  Use this command to delete a designated key store entry.
  
! `-alias ALIAS'
       For more details *note ALIAS: alias.
  
! `-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! `-keystore URL'
       For more details *note URL: keystore.
  
! `-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! `-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! `-v'
       For more details *note verbose::.
  
- 
  
  File: cp-tools.info,  Node: Other Tools,  Next: I18N Issues,  Prev: Security Tools,  Up: Top
  
--- 1183,1320 ----
  
  File: cp-tools.info,  Node: Command -keyclone,  Next: Command -storepasswd,  Prev: Management Commands,  Up: Management Commands
  
! 2.2.7.1 The '-keyclone' command
  ...............................
  
! Use this command to clone an existing Key Entry and store it under a new
! (different) Alias protecting, its private key material with possibly a
! new password.
  
! '-alias ALIAS'
       For more details *note ALIAS: alias.
  
! '-dest ALIAS'
       Use this option to specify the new Alias which will be used to
       identify the cloned copy of the Key Entry.
  
! '-keypass PASSWORD'
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store.  If
       this fails, you will then be prompted to provide a password.
  
! '-new PASSWORD'
       Use this option to specify the password protecting the private key
       material of the newly cloned copy of the Key Entry.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Command -storepasswd,  Next: Command -keypasswd,  Prev: Command -keyclone,  Up: Management Commands
  
! 2.2.7.2 The '-storepasswd' command
  ..................................
  
  Use this command to change the password protecting a key store.
  
! '-new PASSWORD'
       The new, and different, password which will be used to protect the
       designated key store.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Command -keypasswd,  Next: Command -delete,  Prev: Command -storepasswd,  Up: Management Commands
  
! 2.2.7.3 The '-keypasswd' command
  ................................
  
  Use this command to change the password protecting the private key
  material of a designated Key Entry.
  
! '-alias ALIAS'
       For more details *note ALIAS: alias.
  
       Use this option to specify the password which the tool will use to
       unlock the Key Entry associated with the designated Alias.
  
       If this option is omitted, the tool will first attempt to unlock
!      the Key Entry using the same password protecting the key store.  If
       this fails, you will then be prompted to provide a password.
  
! '-new PASSWORD'
       The new, and different, password which will be used to protect the
       private key material of the designated Key Entry.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Command -delete,  Prev: Command -keypasswd,  Up: Management Commands
  
! 2.2.7.4 The '-delete' command
  .............................
  
  Use this command to delete a designated key store entry.
  
! '-alias ALIAS'
       For more details *note ALIAS: alias.
  
! '-storetype STORE_TYPE'
       For more details *note STORE_TYPE: storetype.
  
! '-keystore URL'
       For more details *note URL: keystore.
  
! '-storepass PASSWORD'
       For more details *note PASSWORD: storepass.
  
! '-provider PROVIDER_CLASS_NAME'
       For more details *note PROVIDER_CLASS_NAME: provider.
  
! '-v'
       For more details *note verbose::.
  
  
  File: cp-tools.info,  Node: Other Tools,  Next: I18N Issues,  Prev: Security Tools,  Up: Top
  
*************** gcjh, native2ascii, orbd, serialver, rmi
*** 1366,1434 ****
  
  File: cp-tools.info,  Node: jar Tool,  Next: javah Tool,  Up: Other Tools
  
! 3.1 The `jar' Tool
  ==================
  
! `gjar' is an implementation of Sun's jar utility that comes with the
  JDK.
  
     If any file is a directory then it is processed recursively.  The
  manifest file name and the archive file name needs to be specified in
! the same order the `-m' and `-f' flags are specified.
  
     Operation mode:
  
! `-c'
       Create new archive.
  
! `-t'
       List table of contents for archive.
  
! `-x'
       Extract named (or all) files from archive.
  
! `-u'
       Update existing archive.
  
! `-i FILE'
       Compute archive index.
  
     Operation modifiers:
  
! `-f FILE'
       Specify archive file name.
  
! `-0'
       Store only; use no ZIP compression.
  
! `-v'
       Generate verbose output on standard output.
  
! `-M'
       Do not create a manifest file for the entries.
  
! `-m MANIFEST'
       Include manifest information from specified MANIFEST file.
  
     File name selection:
  
! `-C DIR FILE'
       Change to the DIR and include the following FILE.
  
! `-@'
       Read the names of the files to add to the archive from stdin.  This
!      option is supported only in combination with `-c' or `-u'.  Non
       standard option added in the GCC version.
  
     Standard options:
  
! `-help'
       Print help text, then exit.
! 
! `-version'
       Print version number, then exit.
! 
! `-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
--- 1340,1406 ----
  
  File: cp-tools.info,  Node: jar Tool,  Next: javah Tool,  Up: Other Tools
  
! 3.1 The 'jar' Tool
  ==================
  
! 'gjar' is an implementation of Sun's jar utility that comes with the
  JDK.
  
     If any file is a directory then it is processed recursively.  The
  manifest file name and the archive file name needs to be specified in
! the same order the '-m' and '-f' flags are specified.
  
     Operation mode:
  
! '-c'
       Create new archive.
  
! '-t'
       List table of contents for archive.
  
! '-x'
       Extract named (or all) files from archive.
  
! '-u'
       Update existing archive.
  
! '-i FILE'
       Compute archive index.
  
     Operation modifiers:
  
! '-f FILE'
       Specify archive file name.
  
! '-0'
       Store only; use no ZIP compression.
  
! '-v'
       Generate verbose output on standard output.
  
! '-M'
       Do not create a manifest file for the entries.
  
! '-m MANIFEST'
       Include manifest information from specified MANIFEST file.
  
     File name selection:
  
! '-C DIR FILE'
       Change to the DIR and include the following FILE.
  
! '-@'
       Read the names of the files to add to the archive from stdin.  This
!      option is supported only in combination with '-c' or '-u'.  Non
       standard option added in the GCC version.
  
     Standard options:
  
! '-help'
       Print help text, then exit.
! '-version'
       Print version number, then exit.
! '-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
*************** the same order the `-m' and `-f' flags a
*** 1436,1497 ****
  
  File: cp-tools.info,  Node: javah Tool,  Next: gcjh Tool,  Prev: jar Tool,  Up: Other Tools
  
! 3.2 The `javah' Tool
  ====================
  
! The `gjavah' program is used to generate header files from class files.
  It can generate both CNI and JNI header files, as well as stub
  implementation files which can be used as a basis for implementing the
  required native methods.
  
! `-d DIR'
       Set output directory.
  
! `-o FILE'
!      Set output file (only one of `-d' or `-o' may be used).
  
! `-cmdfile FILE'
       Read command file.
  
! `-all DIR'
       Operate on all class files under directory DIR.
  
! `-stubs'
       Emit stub implementation.
  
! `-jni'
       Emit JNI stubs or header (default).
  
! `-cni'
       Emit CNI stubs or header (default JNI).
  
! `-verbose'
       Set verbose mode.
  
! `-force'
       Output files should always be written.
  
     Class path options:
! `-classpath PATH'
       Set the class path.
  
! `-IDIR'
       Add directory to class path.
  
! `-bootclasspath PATH'
       Set the boot class path.
  
! `-extdirs PATH'
       Set the extension directory path.
  
     Standard options:
! `-help'
       Print help text, then exit.
! 
! `-version'
       Print version number, then exit.
! 
! `-JOPTION'
       Pass argument to the Java runtime.
  
     javac(1), ...
--- 1408,1467 ----
  
  File: cp-tools.info,  Node: javah Tool,  Next: gcjh Tool,  Prev: jar Tool,  Up: Other Tools
  
! 3.2 The 'javah' Tool
  ====================
  
! The 'gjavah' program is used to generate header files from class files.
  It can generate both CNI and JNI header files, as well as stub
  implementation files which can be used as a basis for implementing the
  required native methods.
  
! '-d DIR'
       Set output directory.
  
! '-o FILE'
!      Set output file (only one of '-d' or '-o' may be used).
  
! '-cmdfile FILE'
       Read command file.
  
! '-all DIR'
       Operate on all class files under directory DIR.
  
! '-stubs'
       Emit stub implementation.
  
! '-jni'
       Emit JNI stubs or header (default).
  
! '-cni'
       Emit CNI stubs or header (default JNI).
  
! '-verbose'
       Set verbose mode.
  
! '-force'
       Output files should always be written.
  
     Class path options:
! '-classpath PATH'
       Set the class path.
  
! '-IDIR'
       Add directory to class path.
  
! '-bootclasspath PATH'
       Set the boot class path.
  
! '-extdirs PATH'
       Set the extension directory path.
  
     Standard options:
! '-help'
       Print help text, then exit.
! '-version'
       Print version number, then exit.
! '-JOPTION'
       Pass argument to the Java runtime.
  
     javac(1), ...
*************** required native methods.
*** 1499,1545 ****
  
  File: cp-tools.info,  Node: gcjh Tool,  Next: native2ascii Tool,  Prev: javah Tool,  Up: Other Tools
  
! 3.3 The `gcjh' Tool
  ===================
  
! The `gcjh' program is used to generate header files from class files.
  It can generate both CNI and JNI header files, as well as stub
  implementation files which can be used as a basis for implementing the
! required native methods.  It is similar to `javah' but has slightly
  different command line options, and defaults to CNI.
  
!    See `javah' for a full description; this page only lists the
! additional options provided by `gcjh'.
  
     CNI text options
! `-add TEXT'
       Insert TEXT into class body.
! 
! `-append TEXT'
       Append TEXT after class declaration.
! 
! `-friend TEXT'
!      Insert TEXT as a `friend' declaration.
! 
! `-prepend TEXT'
       Insert TEXT before start of class.
  
     Compatibility options (unused)
! `-td DIR'
! `-M'
! `-MM'
! `-MD'
! `-MMD'
       Unused compatibility option.
  
     Standard options:
! `-help'
       Print help text, then exit.
! 
! `-version'
       Print version number, then exit.
! 
! `-JOPTION'
       Pass argument to the Java runtime.
  
     javac(1), javah(1), ...
--- 1469,1510 ----
  
  File: cp-tools.info,  Node: gcjh Tool,  Next: native2ascii Tool,  Prev: javah Tool,  Up: Other Tools
  
! 3.3 The 'gcjh' Tool
  ===================
  
! The 'gcjh' program is used to generate header files from class files.
  It can generate both CNI and JNI header files, as well as stub
  implementation files which can be used as a basis for implementing the
! required native methods.  It is similar to 'javah' but has slightly
  different command line options, and defaults to CNI.
  
!    See 'javah' for a full description; this page only lists the
! additional options provided by 'gcjh'.
  
     CNI text options
! '-add TEXT'
       Insert TEXT into class body.
! '-append TEXT'
       Append TEXT after class declaration.
! '-friend TEXT'
!      Insert TEXT as a 'friend' declaration.
! '-prepend TEXT'
       Insert TEXT before start of class.
  
     Compatibility options (unused)
! '-td DIR'
! '-M'
! '-MM'
! '-MD'
! '-MMD'
       Unused compatibility option.
  
     Standard options:
! '-help'
       Print help text, then exit.
! '-version'
       Print version number, then exit.
! '-JOPTION'
       Pass argument to the Java runtime.
  
     javac(1), javah(1), ...
*************** additional options provided by `gcjh'.
*** 1547,1571 ****
  
  File: cp-tools.info,  Node: native2ascii Tool,  Next: orbd Tool,  Prev: gcjh Tool,  Up: Other Tools
  
! 3.4 The `native2ascii' Tool
  ===========================
  
  To be written ...
  
! `-encoding NAME'
       Set the encoding to use.
  
! `-reversed'
       Convert from encoding to native.
  
     Standard options:
! `-help'
       Print help text, then exit.
! 
! `-version'
       Print version number, then exit.
! 
! `-JOPTION'
       Pass argument to the Java runtime.
  
     javac(1), ...
--- 1512,1534 ----
  
  File: cp-tools.info,  Node: native2ascii Tool,  Next: orbd Tool,  Prev: gcjh Tool,  Up: Other Tools
  
! 3.4 The 'native2ascii' Tool
  ===========================
  
  To be written ...
  
! '-encoding NAME'
       Set the encoding to use.
  
! '-reversed'
       Convert from encoding to native.
  
     Standard options:
! '-help'
       Print help text, then exit.
! '-version'
       Print version number, then exit.
! '-JOPTION'
       Pass argument to the Java runtime.
  
     javac(1), ...
*************** To be written ...
*** 1573,1604 ****
  
  File: cp-tools.info,  Node: orbd Tool,  Next: serialver Tool,  Prev: native2ascii Tool,  Up: Other Tools
  
! 3.5 The `orbd' object request broker daemon
  ===========================================
  
  To be written ...
  
! `-ORBInitialPort PORT'
       Port on which persistent naming service is to be started.
  
! `-ior FILE'
       File in which to store persistent naming service's IOR reference
  
! `-directory DIR'
       Directory in which to store persistent data.
  
! `-restart'
       Restart persistent naming service, clearing persistent naming
       database.
  
     Standard options:
! `-help'
       Print help text, then exit.
! 
! `-version'
       Print version number, then exit.
! 
! `-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
--- 1536,1565 ----
  
  File: cp-tools.info,  Node: orbd Tool,  Next: serialver Tool,  Prev: native2ascii Tool,  Up: Other Tools
  
! 3.5 The 'orbd' object request broker daemon
  ===========================================
  
  To be written ...
  
! '-ORBInitialPort PORT'
       Port on which persistent naming service is to be started.
  
! '-ior FILE'
       File in which to store persistent naming service's IOR reference
  
! '-directory DIR'
       Directory in which to store persistent data.
  
! '-restart'
       Restart persistent naming service, clearing persistent naming
       database.
  
     Standard options:
! '-help'
       Print help text, then exit.
! '-version'
       Print version number, then exit.
! '-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
*************** To be written ...
*** 1606,1627 ****
  
  File: cp-tools.info,  Node: serialver Tool,  Next: rmid Tool,  Prev: orbd Tool,  Up: Other Tools
  
! 3.6 The `serialver' version command
  ===================================
  
  Print the serialVersionUID of the specified classes.
  
! `-classpath PATH'
       Class path to use to find classes.
  
     Standard options:
! `-help'
       Print help text, then exit.
! 
! `-version'
       Print version number, then exit.
! 
! `-JOPTION'
       Pass argument to the Java runtime.
  
     javac(1), ...
--- 1567,1586 ----
  
  File: cp-tools.info,  Node: serialver Tool,  Next: rmid Tool,  Prev: orbd Tool,  Up: Other Tools
  
! 3.6 The 'serialver' version command
  ===================================
  
  Print the serialVersionUID of the specified classes.
  
! '-classpath PATH'
       Class path to use to find classes.
  
     Standard options:
! '-help'
       Print help text, then exit.
! '-version'
       Print version number, then exit.
! '-JOPTION'
       Pass argument to the Java runtime.
  
     javac(1), ...
*************** Print the serialVersionUID of the specif
*** 1629,1670 ****
  
  File: cp-tools.info,  Node: rmid Tool,  Next: rmiregistry Tool,  Prev: serialver Tool,  Up: Other Tools
  
! 3.7 The `rmid' RMI activation system daemon
  ===========================================
  
! `rmiregistry' starts a remote object registry on the current host.  If
  no port number is specified, then port 1099 is used.
  
     Activation process control:
! `-port PORT'
       Port on which activation system is to be started.
  
! `-restart'
       Restart activation system, clearing persistent naming database, if
       any.
  
! `-stop'
       Stop activation system.
  
     Persistence:
! `-persistent'
       Make activation system persistent.
  
! `-directory DIR'
       Directory in which to store persistent data.
  
     Debugging:
! `-verbose'
       Log binding events to standard out.
  
     Standard options:
! `-help'
       Print help text, then exit.
! 
! `-version'
       Print version number, then exit.
! 
! `-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
--- 1588,1627 ----
  
  File: cp-tools.info,  Node: rmid Tool,  Next: rmiregistry Tool,  Prev: serialver Tool,  Up: Other Tools
  
! 3.7 The 'rmid' RMI activation system daemon
  ===========================================
  
! 'rmiregistry' starts a remote object registry on the current host.  If
  no port number is specified, then port 1099 is used.
  
     Activation process control:
! '-port PORT'
       Port on which activation system is to be started.
  
! '-restart'
       Restart activation system, clearing persistent naming database, if
       any.
  
! '-stop'
       Stop activation system.
  
     Persistence:
! '-persistent'
       Make activation system persistent.
  
! '-directory DIR'
       Directory in which to store persistent data.
  
     Debugging:
! '-verbose'
       Log binding events to standard out.
  
     Standard options:
! '-help'
       Print help text, then exit.
! '-version'
       Print version number, then exit.
! '-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
*************** no port number is specified, then port 1
*** 1672,1710 ****
  
  File: cp-tools.info,  Node: rmiregistry Tool,  Next: tnameserv Tool,  Prev: rmid Tool,  Up: Other Tools
  
! 3.8 The `rmiregistry' Tool
  ==========================
  
! `grmiregistry' starts a remote object registry on the current host.  If
  no port number is specified, then port 1099 is used.
  
     Registry process control:
! `-restart'
       Restart RMI naming service, clearing persistent naming database, if
       any.
  
! `-stop'
       Stop RMI naming service.
  
     Persistence:
! `-persistent'
       Make RMI naming service persistent.
  
! `-directory DIR'
       Directory in which to store persistent data.
  
     Debugging:
! `-verbose'
       Log binding events to standard out.
  
     Standard options:
! `-help'
       Print help text, then exit.
! 
! `-version'
       Print version number, then exit.
! 
! `-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
--- 1629,1665 ----
  
  File: cp-tools.info,  Node: rmiregistry Tool,  Next: tnameserv Tool,  Prev: rmid Tool,  Up: Other Tools
  
! 3.8 The 'rmiregistry' Tool
  ==========================
  
! 'grmiregistry' starts a remote object registry on the current host.  If
  no port number is specified, then port 1099 is used.
  
     Registry process control:
! '-restart'
       Restart RMI naming service, clearing persistent naming database, if
       any.
  
! '-stop'
       Stop RMI naming service.
  
     Persistence:
! '-persistent'
       Make RMI naming service persistent.
  
! '-directory DIR'
       Directory in which to store persistent data.
  
     Debugging:
! '-verbose'
       Log binding events to standard out.
  
     Standard options:
! '-help'
       Print help text, then exit.
! '-version'
       Print version number, then exit.
! '-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
*************** no port number is specified, then port 1
*** 1712,1742 ****
  
  File: cp-tools.info,  Node: tnameserv Tool,  Next: gjdoc Tool,  Prev: rmiregistry Tool,  Up: Other Tools
  
! 3.9 The `tnameserv' Tool
  ========================
  
  To be written ...
  
! `-ORBInitialPort PORT'
       Port on which naming service is to be started.
  
! `-ior FILE'
       File in which to store naming service's IOR reference.
  
     Standard options:
! `-help'
       Print help text, then exit.
! 
! `-version'
       Print version number, then exit.
! 
! `-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
  
!    Info entry for `gjdoc'.  Please report bugs to
! `http://savannah.gnu.org/bugs/?group=classpath'.  Julian Scheid
  
  
  File: cp-tools.info,  Node: gjdoc Tool,  Prev: tnameserv Tool,  Up: Other Tools
--- 1667,1695 ----
  
  File: cp-tools.info,  Node: tnameserv Tool,  Next: gjdoc Tool,  Prev: rmiregistry Tool,  Up: Other Tools
  
! 3.9 The 'tnameserv' Tool
  ========================
  
  To be written ...
  
! '-ORBInitialPort PORT'
       Port on which naming service is to be started.
  
! '-ior FILE'
       File in which to store naming service's IOR reference.
  
     Standard options:
! '-help'
       Print help text, then exit.
! '-version'
       Print version number, then exit.
! '-JOPTION'
       Pass argument to the Java runtime.
  
     java(1), ...
  
!    Info entry for 'gjdoc'.  Please report bugs to
! <http://savannah.gnu.org/bugs/?group=classpath>.  Julian Scheid
  
  
  File: cp-tools.info,  Node: gjdoc Tool,  Prev: tnameserv Tool,  Up: Other Tools
*************** File: cp-tools.info,  Node: gjdoc Tool,
*** 1745,1760 ****
  *******************************
  
  Gjdoc can be used in two ways: as a stand-alone documentation tool, or
! as a driver for a user-specified Doclet. *Note Other Doclets::.
  
!    In the default mode, Gjdoc will use the Standard Doclet `HtmlDoclet'
  to generate a set of HTML pages.  The canonical usage is:
  
       gjdoc -s src/java/ -all -d api-docs/
  
!    Here, `src/java/' is the root of your source code class hierarchy,
! `-all' means that all valid Java files found under this root directory
! should be processed, and `api-docs/' is the directory where the
  generated documentation should be placed.
  
     To learn more about running Doclets other than the Standard Doclet,
--- 1698,1713 ----
  *******************************
  
  Gjdoc can be used in two ways: as a stand-alone documentation tool, or
! as a driver for a user-specified Doclet.  *Note Other Doclets::.
  
!    In the default mode, Gjdoc will use the Standard Doclet 'HtmlDoclet'
  to generate a set of HTML pages.  The canonical usage is:
  
       gjdoc -s src/java/ -all -d api-docs/
  
!    Here, 'src/java/' is the root of your source code class hierarchy,
! '-all' means that all valid Java files found under this root directory
! should be processed, and 'api-docs/' is the directory where the
  generated documentation should be placed.
  
     To learn more about running Doclets other than the Standard Doclet,
*************** File: cp-tools.info,  Node: Invoking the
*** 1792,1798 ****
  4.1 Invoking the Standard Doclet
  ================================
  
! Running the Gjdoc Standard Doclet `HtmlDoclet' is the default mode of
  operation for Gjdoc.  This section lists the command line options you
  can specify in this mode.  It doesn't distinguish between general Gjdoc
  options and options specific to the Standard Doclet.
--- 1745,1751 ----
  4.1 Invoking the Standard Doclet
  ================================
  
! Running the Gjdoc Standard Doclet 'HtmlDoclet' is the default mode of
  operation for Gjdoc.  This section lists the command line options you
  can specify in this mode.  It doesn't distinguish between general Gjdoc
  options and options specific to the Standard Doclet.
*************** Here is a summary of all the options of
*** 1824,1831 ****
  Doclet, grouped by type.  Explanations are in the following sections.
  
  _Source Set Options_
!      *Note Options For Specifying the Source Files To Operate on:
!      Source Set Options.
            -sourcepath PATHLIST  -subpackages PKGLIST  -exclude PKGLIST
  
  _Source Format Options_
--- 1777,1784 ----
  Doclet, grouped by type.  Explanations are in the following sections.
  
  _Source Set Options_
!      *Note Options For Specifying the Source Files To Operate on: Source
!      Set Options.
            -sourcepath PATHLIST  -subpackages PKGLIST  -exclude PKGLIST
  
  _Source Format Options_
*************** _Virtual Machine Options_
*** 1874,1880 ****
       *Note Options Controlling Gjdoc Behavior: Virtual Machine Options.
            -classpath  -bootclasspath  -J VMOPT
  
- 
  * Menu:
  
  * Virtual Machine Options::     Controlling the kind of output:
--- 1827,1832 ----
*************** File: cp-tools.info,  Node: Source Set O
*** 1887,1934 ****
  4.3 Selecting which Source Files to Process
  ===========================================
  
! `-s PATHLIST'
! 
! `-sourcepath PATHLIST'
       Look for source files in the specified directory or directories.
  
       PATHLIST should be one or more directory paths separated by your
!      platform's path separator (usually `:' or `;').
  
!      If this option is not given, `gjdoc' will look for source files in
       the current directory.
  
       The directories specified should be root directories in terms of
       the Java package system.  For example, if you want to generate
!      documentation for classes in package `foo.bar', you must specify
!      the directory containing the top-level ``foo'' sub-directory, not
!      the directory ``foo/bar/'' in which the Java source files reside.
  
!      The short-hand alias `-s' is specific to `gjdoc' and not
!      compatible to Sun `javadoc'.
  
! `-all'
       _[EXPERIMENTAL]_ Process all valid Java source files found in the
       directories listed in the source path and their sub-directories.
  
!      This is an option specific to `gjdoc' and not compatible to Sun
!      `javadoc'.
  
! `-subpackages PKG:PKG:...'
       Process the classes in the given Java packages and all
       sub-packages, recursively.  Note that multiple package names must
       be separated with colons instead of whitespace.
  
! `-exclude PKG:PKG:...'
       Do not process classes in the given Java packages and all
       sub-packages, recursively.  This option can be used in conjunction
!      with `-all' or `-subpackages' in order to exclude individual
       packages or package sub-trees from the output.
  
! `PACKAGES...'
       Process all classes in the given Java packages.
  
! `SOURCEFILES...'
       Process the classes in the given Java source files.
  
  
--- 1839,1885 ----
  4.3 Selecting which Source Files to Process
  ===========================================
  
! '-s PATHLIST'
! '-sourcepath PATHLIST'
       Look for source files in the specified directory or directories.
  
       PATHLIST should be one or more directory paths separated by your
!      platform's path separator (usually ':' or ';').
  
!      If this option is not given, 'gjdoc' will look for source files in
       the current directory.
  
       The directories specified should be root directories in terms of
       the Java package system.  For example, if you want to generate
!      documentation for classes in package 'foo.bar', you must specify
!      the directory containing the top-level ''foo'' sub-directory, not
!      the directory ''foo/bar/'' in which the Java source files reside.
  
!      The short-hand alias '-s' is specific to 'gjdoc' and not compatible
!      to Sun 'javadoc'.
  
! '-all'
       _[EXPERIMENTAL]_ Process all valid Java source files found in the
       directories listed in the source path and their sub-directories.
  
!      This is an option specific to 'gjdoc' and not compatible to Sun
!      'javadoc'.
  
! '-subpackages PKG:PKG:...'
       Process the classes in the given Java packages and all
       sub-packages, recursively.  Note that multiple package names must
       be separated with colons instead of whitespace.
  
! '-exclude PKG:PKG:...'
       Do not process classes in the given Java packages and all
       sub-packages, recursively.  This option can be used in conjunction
!      with '-all' or '-subpackages' in order to exclude individual
       packages or package sub-trees from the output.
  
! 'PACKAGES...'
       Process all classes in the given Java packages.
  
! 'SOURCEFILES...'
       Process the classes in the given Java source files.
  
  
*************** File: cp-tools.info,  Node: Source Forma
*** 1937,1972 ****
  4.4 Specifying the Format of Input Files
  ========================================
  
! `-source RELEASE'
       Assume that the source files are targeted at the given release of
       the Java platform.
  
       RELEASE should be the version number of a Java platform release in
!      the format MAJOR.MINOR, for example `1.4'.
  
       This option is currently ignored except that an error is raised if
!      a release number other than `1.2', `1.3' or `1.4' is specified.
  
! `-encoding CHARSET'
       Assume that the source files are encoded using CHARSET.
  
!      Examples for CHARSET are `US-ASCII', `ISO-8859-1' or `UTF-8'.
  
       The semantics of CHARSET are identical to those of
!      `java.nio.charset.Charset.forName(String)'.
  
! `-breakiterator'
       Use the locale's java.text.BreakIterator instead of the internal
       first sentence detector.
  
!      By default, `gjdoc' uses an internal algorithm to determine where
!      a sentence ends. When this option is given, it will instead use
!      the `java.text.BreakIterator' instance for the locale given with
!      `-locale' (or the default locale).
  
!      This option should be specified when applying `gjdoc' to source
       code commented in a non-latin language for which the default first
!      sentence detector does not work. For all other cases, the default
       (do not use BreakIterator) produces better results at the time of
       this writing.
  
--- 1888,1923 ----
  4.4 Specifying the Format of Input Files
  ========================================
  
! '-source RELEASE'
       Assume that the source files are targeted at the given release of
       the Java platform.
  
       RELEASE should be the version number of a Java platform release in
!      the format MAJOR.MINOR, for example '1.4'.
  
       This option is currently ignored except that an error is raised if
!      a release number other than '1.2', '1.3' or '1.4' is specified.
  
! '-encoding CHARSET'
       Assume that the source files are encoded using CHARSET.
  
!      Examples for CHARSET are 'US-ASCII', 'ISO-8859-1' or 'UTF-8'.
  
       The semantics of CHARSET are identical to those of
!      'java.nio.charset.Charset.forName(String)'.
  
! '-breakiterator'
       Use the locale's java.text.BreakIterator instead of the internal
       first sentence detector.
  
!      By default, 'gjdoc' uses an internal algorithm to determine where a
!      sentence ends.  When this option is given, it will instead use the
!      'java.text.BreakIterator' instance for the locale given with
!      '-locale' (or the default locale).
  
!      This option should be specified when applying 'gjdoc' to source
       code commented in a non-latin language for which the default first
!      sentence detector does not work.  For all other cases, the default
       (do not use BreakIterator) produces better results at the time of
       this writing.
  
*************** File: cp-tools.info,  Node: Interlinking
*** 1976,2065 ****
  4.5 Interlinking with other Documentation Sets
  ==============================================
  
! `-link URL'
       Create hyperlinks to another documentation set.
  
!      By default, `gjdoc' will only create hyperlinks to classes in the
       source set.  Use this option to additionally create hyperlinks to
       classes covered by the specified documentation set.
  
!      URL should be the root URL of the other documentation set. For
       example, to add hyperlinks to GNU Classpath, specify the following:
  
            -link http://developer.classpath.org/doc/
  
!      The `-link' option can be specified multiple times.
  
!      Note that specifying the `-link' option will cause an HTTP access
!      every time gjdoc is invoked. You can use `-linkoffline' instead to
       avoid this access.
  
! `-linkoffline URL FILE'
       Create hyperlinks to another documentation set which is also
       present on the local file system.
  
!      This option works exactly like `-link', except that it accesses
!      the local file system instead of the network for determining which
       classes are covered by the linked documentation set.
  
!      When using `-linkoffline' the remote documentation set is not
       accessed at all, which can significantly speed up generation time
       depending on your network connection.  The generated hyperlinks to
       the documentation set however refer to the remote set, not to the
!      local one, so that you can distribute the documentation without
!      any further dependencies.
  
!      The `-linkoffline' option can be specified multiple times.
  
- `-noqualifier PKG:PKG:...'
       Do not qualify names of classes in the given packages with their
       package name.
  
!      By default, a class name is displayed unqualified only if the
!      class is part of the source set or a linked documentation set, and
       qualified with the name of its containing package if it is not.
!      You can use this option to force unqualified names for classes
!      even if they are not part of the documentation set.
  
       For example, usually a reference to the String class is represented
!      fully-qualified as `java.lang.String' (unless you link to the
!      appropriate documentation set using `-link') because it isn't part
!      of the documentation set.  You can specify `-noqualifier
!      java.lang' to render the same references just as `String'.
  
       Note that for all unqualified class names, a tooltip is provided
       when you place your mouse pointer over it in the HTML
       documentation.
  
! `-noqualifier `all''
       Omit package name qualifier from all class names.
  
       Specify this option to omit package name qualifiers altogether,
  
- 
  
  File: cp-tools.info,  Node: Generation Options,  Next: Decoration Options,  Prev: Output Control Options,  Up: gjdoc Tool
  
  4.6 Selecting which Information to Generate
  ===========================================
  
! `-public'
       Only include public members of public classes in the output.  By
       default, protected class members are included as well.
  
! `-protected'
       Include public or protected members of public classes in the
       output.  This is the default.
  
! `-package'
       Include public, protected and package-private members of public and
       package-private classes.
  
! `-private'
       Include all classes and class members regardless of their access
       level.
  
! `-splitindex'
       Generate one index page per letter instead of a single, monolithic
       index page.
  
--- 1927,2021 ----
  4.5 Interlinking with other Documentation Sets
  ==============================================
  
! '-link URL'
! 
       Create hyperlinks to another documentation set.
  
!      By default, 'gjdoc' will only create hyperlinks to classes in the
       source set.  Use this option to additionally create hyperlinks to
       classes covered by the specified documentation set.
  
!      URL should be the root URL of the other documentation set.  For
       example, to add hyperlinks to GNU Classpath, specify the following:
  
            -link http://developer.classpath.org/doc/
  
!      The '-link' option can be specified multiple times.
  
!      Note that specifying the '-link' option will cause an HTTP access
!      every time gjdoc is invoked.  You can use '-linkoffline' instead to
       avoid this access.
  
! '-linkoffline URL FILE'
! 
       Create hyperlinks to another documentation set which is also
       present on the local file system.
  
!      This option works exactly like '-link', except that it accesses the
!      local file system instead of the network for determining which
       classes are covered by the linked documentation set.
  
!      When using '-linkoffline' the remote documentation set is not
       accessed at all, which can significantly speed up generation time
       depending on your network connection.  The generated hyperlinks to
       the documentation set however refer to the remote set, not to the
!      local one, so that you can distribute the documentation without any
!      further dependencies.
  
!      The '-linkoffline' option can be specified multiple times.
! 
! '-noqualifier PKG:PKG:...'
  
       Do not qualify names of classes in the given packages with their
       package name.
  
!      By default, a class name is displayed unqualified only if the class
!      is part of the source set or a linked documentation set, and
       qualified with the name of its containing package if it is not.
!      You can use this option to force unqualified names for classes even
!      if they are not part of the documentation set.
  
       For example, usually a reference to the String class is represented
!      fully-qualified as 'java.lang.String' (unless you link to the
!      appropriate documentation set using '-link') because it isn't part
!      of the documentation set.  You can specify '-noqualifier java.lang'
!      to render the same references just as 'String'.
  
       Note that for all unqualified class names, a tooltip is provided
       when you place your mouse pointer over it in the HTML
       documentation.
  
! '-noqualifier 'all''
       Omit package name qualifier from all class names.
  
       Specify this option to omit package name qualifiers altogether,
  
  
  File: cp-tools.info,  Node: Generation Options,  Next: Decoration Options,  Prev: Output Control Options,  Up: gjdoc Tool
  
  4.6 Selecting which Information to Generate
  ===========================================
  
! '-public'
       Only include public members of public classes in the output.  By
       default, protected class members are included as well.
  
! '-protected'
! 
       Include public or protected members of public classes in the
       output.  This is the default.
  
! '-package'
! 
       Include public, protected and package-private members of public and
       package-private classes.
  
! '-private'
! 
       Include all classes and class members regardless of their access
       level.
  
! '-splitindex'
       Generate one index page per letter instead of a single, monolithic
       index page.
  
*************** File: cp-tools.info,  Node: Generation O
*** 2067,2081 ****
       entries on a single page.  This is fine for small documentation
       sets, but for large sets you should specify this option.
  
! `-nosince'
!      Ignore `@since' tags in javadoc comments.
  
       By default, the generated output contains sections listing the
       version of your API since which the package, class or class member
       in question exists when this tag is encountered.  Specify this
       option to omit this information.
  
! `-notree'
       Do not generate any tree pages.
  
       By default, the generated output includes one inheritance tree per
--- 2023,2037 ----
       entries on a single page.  This is fine for small documentation
       sets, but for large sets you should specify this option.
  
! '-nosince'
!      Ignore '@since' tags in javadoc comments.
  
       By default, the generated output contains sections listing the
       version of your API since which the package, class or class member
       in question exists when this tag is encountered.  Specify this
       option to omit this information.
  
! '-notree'
       Do not generate any tree pages.
  
       By default, the generated output includes one inheritance tree per
*************** File: cp-tools.info,  Node: Generation O
*** 2083,2089 ****
       packages - a page with the full inheritance tree.  Specify this
       option to omit generation of these pages.
  
! `-noindex'
       Do not output the alphabetical index.
  
       By default, gjdoc generates an alphabetical index of all program
--- 2039,2045 ----
       packages - a page with the full inheritance tree.  Specify this
       option to omit generation of these pages.
  
! '-noindex'
       Do not output the alphabetical index.
  
       By default, gjdoc generates an alphabetical index of all program
*************** File: cp-tools.info,  Node: Generation O
*** 2091,2111 ****
       classes, constructors, methods, and fields).  Specify this option
       to omit this information.
  
! `-nohelp'
       Do not generate the help page.
  
       This option is currently ignored as the Standard Doclet doesn't
       provide a help page.
  
! `-nodeprecated'
!      Do not output inline information about deprecated packages,
!      classes or class members.
  
       By default, the Standard Doclet adds a highlighted paragraph with
       deprecation information to the description of each deprecated
       program element.  Specify this option to omit this information.
  
! `-nodeprecatedlist'
       Do not output the summary page for deprecated API elements.
  
       By default, the Standard Doclet generates a page listing all
--- 2047,2067 ----
       classes, constructors, methods, and fields).  Specify this option
       to omit this information.
  
! '-nohelp'
       Do not generate the help page.
  
       This option is currently ignored as the Standard Doclet doesn't
       provide a help page.
  
! '-nodeprecated'
!      Do not output inline information about deprecated packages, classes
!      or class members.
  
       By default, the Standard Doclet adds a highlighted paragraph with
       deprecation information to the description of each deprecated
       program element.  Specify this option to omit this information.
  
! '-nodeprecatedlist'
       Do not output the summary page for deprecated API elements.
  
       By default, the Standard Doclet generates a page listing all
*************** File: cp-tools.info,  Node: Generation O
*** 2113,2119 ****
       usually includes the reason for deprecation and possible
       alternatives.  Specify this option to omit this information.
  
! `-nonavbar'
       Do not output the navigation bar, header, and footer.
  
       By default, each output page is equipped with a top navigation bar
--- 2069,2075 ----
       usually includes the reason for deprecation and possible
       alternatives.  Specify this option to omit this information.
  
! '-nonavbar'
       Do not output the navigation bar, header, and footer.
  
       By default, each output page is equipped with a top navigation bar
*************** File: cp-tools.info,  Node: Generation O
*** 2121,2205 ****
       bar (which may include a user-specified footer).  Specify this
       option to omit this decoration.
  
! `-nocomment'
       Omit all documentation text from the generated files and output
       only declarations and program element relationships.
  
!      This option is here for compatibility with `javadoc'.  If you plan
!      on extracting information about your project via `gjdoc', you
!      should consider using a different Doclet for your purposes
!      instead, for example XmlDoclet.  You could also use the Doclet API
!      directly by implementing a new Doclet.
  
- `-linksource'
       Generate a page with syntax-highlighted source code for each class.
       By default, this page is not generated.
  
       The source code can be accessed by clicking on the button labelled
       "Source" in the navigation bar, or by clicking on the name of a
!      constructor, field, method, or inner class in the detail section
!      of a class documentation page.
  
! `-use'
!      Generate a page with cross-reference information. By default, this
       page is not generated.
  
       The cross-reference information can be accessed by clicking on the
!      button labelled `Use' in the navigation bar.
  
!      The `Use' page lists all classes/interfaces in the documentation
       set that extend/implement the class (type) in question; fields of
       the type; methods or constructors accepting a parameter of the
       type; methods returning the type; and methods or constructors
       throwing the type.
  
! `-author'
       Include author information in the output.
  
!      When specified, author information as specified using the
!      `@author' tag in javadoc comments is incorporated into the output.
!      By default, `@author' tags are ignored.
  
! `-version'
       Include version information in the output.
  
       When specified, version information as specified using the
!      `@version' tag in javadoc comments is incorporated into the
!      output. By default, `@version' tags are ignored.
  
- `-licensetext'
       Assume that the first comment in each source file contains the
       license text, and add license information to the footer of each
       generated class page.
  
!      This is an option specific to `gjdoc' and not compatible to Sun
!      `javadoc'.
  
       This option is intended for use with free and open source projects
       where source code is typically prefixed with a boilerplate license
       comment, when there are legal reasons for including the license in
       the documentation.
  
! `-docfilessubdirs'
!      Recursively copy all files in the `doc-files' sub-directory of each
       package directory.
  
!      Usually, only the files in the `doc-files' sub-directory are copied
       without descending recursively.
  
       *Note Adding Custom Resources::.
  
! `-excludedocfilessubdir NAME:NAME:...'
!      Do not copy some directories directly under the `doc-files'
       sub-directories when descending recursively.
  
       The argument to this option should be a colon-separated list of
       directory names.
  
!      This option only makes sense if `-docfilessubdirs' is also
       specified.  In this case, any sub-directory located directly
!      beneath a `doc-files' directory is omitted if listed.
! 
  
  
  File: cp-tools.info,  Node: Taglet Options,  Next: Virtual Machine Options,  Prev: Decoration Options,  Up: gjdoc Tool
--- 2077,2166 ----
       bar (which may include a user-specified footer).  Specify this
       option to omit this decoration.
  
! '-nocomment'
! 
       Omit all documentation text from the generated files and output
       only declarations and program element relationships.
  
!      This option is here for compatibility with 'javadoc'.  If you plan
!      on extracting information about your project via 'gjdoc', you
!      should consider using a different Doclet for your purposes instead,
!      for example XmlDoclet.  You could also use the Doclet API directly
!      by implementing a new Doclet.
! 
! '-linksource'
  
       Generate a page with syntax-highlighted source code for each class.
       By default, this page is not generated.
  
       The source code can be accessed by clicking on the button labelled
       "Source" in the navigation bar, or by clicking on the name of a
!      constructor, field, method, or inner class in the detail section of
!      a class documentation page.
  
! '-use'
! 
!      Generate a page with cross-reference information.  By default, this
       page is not generated.
  
       The cross-reference information can be accessed by clicking on the
!      button labelled 'Use' in the navigation bar.
  
!      The 'Use' page lists all classes/interfaces in the documentation
       set that extend/implement the class (type) in question; fields of
       the type; methods or constructors accepting a parameter of the
       type; methods returning the type; and methods or constructors
       throwing the type.
  
! '-author'
       Include author information in the output.
  
!      When specified, author information as specified using the '@author'
!      tag in javadoc comments is incorporated into the output.  By
!      default, '@author' tags are ignored.
  
! '-version'
       Include version information in the output.
  
       When specified, version information as specified using the
!      '@version' tag in javadoc comments is incorporated into the output.
!      By default, '@version' tags are ignored.
! 
! '-licensetext'
  
       Assume that the first comment in each source file contains the
       license text, and add license information to the footer of each
       generated class page.
  
!      This is an option specific to 'gjdoc' and not compatible to Sun
!      'javadoc'.
  
       This option is intended for use with free and open source projects
       where source code is typically prefixed with a boilerplate license
       comment, when there are legal reasons for including the license in
       the documentation.
  
! '-docfilessubdirs'
! 
!      Recursively copy all files in the 'doc-files' sub-directory of each
       package directory.
  
!      Usually, only the files in the 'doc-files' sub-directory are copied
       without descending recursively.
  
       *Note Adding Custom Resources::.
  
! '-excludedocfilessubdir NAME:NAME:...'
! 
!      Do not copy some directories directly under the 'doc-files'
       sub-directories when descending recursively.
  
       The argument to this option should be a colon-separated list of
       directory names.
  
!      This option only makes sense if '-docfilessubdirs' is also
       specified.  In this case, any sub-directory located directly
!      beneath a 'doc-files' directory is omitted if listed.
  
  
  File: cp-tools.info,  Node: Taglet Options,  Next: Virtual Machine Options,  Prev: Decoration Options,  Up: gjdoc Tool
*************** File: cp-tools.info,  Node: Taglet Optio
*** 2207,2238 ****
  4.7 Custom Documentation Tags
  =============================
  
! `-tagletpath PATHLIST'
       Search PATHLIST when loading subsequent Taglet classes specified
!      using `-taglet'.
  
       PATHLIST should be one or more paths to a directory or jar file,
!      separated by your platform's path separator (usually `:' or `;').
  
! `-taglet CLASSNAME'
       Register a Taglet.
  
       CLASSNAME should be the fully-qualified name of a Java class
!      implementing `com.sun.tools.doclets.Taglet'.
  
       The Taglet classes will be loaded from the classpath specified
!      using `-tagletpath', from the classpath specified using
!      `-classpath' and from the default classpath.
  
!      See the documentation of `com.sun.tools.doclets.Taglet' for
!      further information.
  
!      Note that for simple tags, there is also `-tag'.
  
! `-tag TAGSPEC'
       Register a generic Taglet.
  
!      The format of TAGSPEC must be `<tagname>:<flags>:"<taghead>"'.
  
       TAGNAME is the tag name to match, without the leading @ sign.
  
--- 2168,2199 ----
  4.7 Custom Documentation Tags
  =============================
  
! '-tagletpath PATHLIST'
       Search PATHLIST when loading subsequent Taglet classes specified
!      using '-taglet'.
  
       PATHLIST should be one or more paths to a directory or jar file,
!      separated by your platform's path separator (usually ':' or ';').
  
! '-taglet CLASSNAME'
       Register a Taglet.
  
       CLASSNAME should be the fully-qualified name of a Java class
!      implementing 'com.sun.tools.doclets.Taglet'.
  
       The Taglet classes will be loaded from the classpath specified
!      using '-tagletpath', from the classpath specified using
!      '-classpath' and from the default classpath.
  
!      See the documentation of 'com.sun.tools.doclets.Taglet' for further
!      information.
  
!      Note that for simple tags, there is also '-tag'.
  
! '-tag TAGSPEC'
       Register a generic Taglet.
  
!      The format of TAGSPEC must be '<tagname>:<flags>:"<taghead>"'.
  
       TAGNAME is the tag name to match, without the leading @ sign.
  
*************** File: cp-tools.info,  Node: Taglet Optio
*** 2240,2276 ****
       character specifies a source code context in which the tag is to be
       recognized.
  
!     `a'
            all contexts
! 
!     `c'
            constructors
! 
!     `f'
            fields
! 
!     `m'
            methods
! 
!     `o'
            overview
! 
!     `p'
            packages
! 
!     `t'
            types (classes, interfaces, exceptions, errors)
! 
!     `X'
            special character which temporarily disables the Taglet
            altogether.
  
       TAGHEAD is the string to display in the header of the section
       devoted to the tag in question.
  
!      For example, to define a tag matching `@cvsid' which is to be
       accepted in overview, package and type pages and which is labelled
!      with the header `CVS ID', you would specify:
  
            -tag cvsid:tpo:"CVS ID"
  
--- 2201,2230 ----
       character specifies a source code context in which the tag is to be
       recognized.
  
!      'a'
            all contexts
!      'c'
            constructors
!      'f'
            fields
!      'm'
            methods
!      'o'
            overview
!      'p'
            packages
!      't'
            types (classes, interfaces, exceptions, errors)
!      'X'
            special character which temporarily disables the Taglet
            altogether.
  
       TAGHEAD is the string to display in the header of the section
       devoted to the tag in question.
  
!      For example, to define a tag matching '@cvsid' which is to be
       accepted in overview, package and type pages and which is labelled
!      with the header 'CVS ID', you would specify:
  
            -tag cvsid:tpo:"CVS ID"
  
*************** File: cp-tools.info,  Node: Doclet Optio
*** 2289,2329 ****
  4.8 Running Other Doclets
  =========================
  
! `-docletpath PATHLIST'
!      Search PATHLIST when loading classes for the Doclet specified
!      using `-doclet'.
  
       PATHLIST should be one or more paths to a directory or jar file,
!      separated by your platform's path separator (usually `:' or `;').
  
! `-doclet CLASSNAME'
       Run the specified doclet instead of the standard HtmlDoclet.
  
!      CLASSNAME should be the fully-qualified name of a class which has
!      a public default constructor and contain a method with the
!      following signature:
  
               import com.sun.javadoc.RootDoc;
               public static boolean start(RootDoc rootDoc)
  
       The Doclet classes will be loaded from the classpath specified
!      using `-docletpath', from the classpath specified using
!      `-classpath' and from the default classpath.
  
!      The `start' method should process the information exposed by the
!      Doclet API via `rootDoc' and return `true' on success, `false' on
       failure.
  
       If you are using a third-party doclet, refer to its documentation
       for further instructions.  Note that support for third-party
!      doclets is experimental.  Please report any problems you
!      encounter, or provide feedback when successfully running
!      third-party applets.
  
       This option can be specified multiple times, in which case all
!      doclets are executed with the same information tree exposed via
!      the Doclet API for each Doclet run.
! 
  
  
  File: cp-tools.info,  Node: Decoration Options,  Next: Taglet Options,  Prev: Generation Options,  Up: gjdoc Tool
--- 2243,2281 ----
  4.8 Running Other Doclets
  =========================
  
! '-docletpath PATHLIST'
!      Search PATHLIST when loading classes for the Doclet specified using
!      '-doclet'.
  
       PATHLIST should be one or more paths to a directory or jar file,
!      separated by your platform's path separator (usually ':' or ';').
  
! '-doclet CLASSNAME'
       Run the specified doclet instead of the standard HtmlDoclet.
  
!      CLASSNAME should be the fully-qualified name of a class which has a
!      public default constructor and contain a method with the following
!      signature:
  
               import com.sun.javadoc.RootDoc;
               public static boolean start(RootDoc rootDoc)
  
       The Doclet classes will be loaded from the classpath specified
!      using '-docletpath', from the classpath specified using
!      '-classpath' and from the default classpath.
  
!      The 'start' method should process the information exposed by the
!      Doclet API via 'rootDoc' and return 'true' on success, 'false' on
       failure.
  
       If you are using a third-party doclet, refer to its documentation
       for further instructions.  Note that support for third-party
!      doclets is experimental.  Please report any problems you encounter,
!      or provide feedback when successfully running third-party applets.
  
       This option can be specified multiple times, in which case all
!      doclets are executed with the same information tree exposed via the
!      Doclet API for each Doclet run.
  
  
  File: cp-tools.info,  Node: Decoration Options,  Next: Taglet Options,  Prev: Generation Options,  Up: gjdoc Tool
*************** File: cp-tools.info,  Node: Decoration O
*** 2331,2346 ****
  4.9 Adding Information to the Output
  ====================================
  
! `-windowtitle TEXT'
       Use TEXT as the browser window title prefix.
  
       When specified, the browser window title for each page will be
!      prefixed with TEXT instead of the default string `Generated API
       Documentation'.
  
       TEXT should be plain text (it should not contain HTML tags).
  
! `-doctitle TEXT'
       Set the header text of the overview page to TEXT.
  
       TEXT should be a short plain text string.
--- 2283,2298 ----
  4.9 Adding Information to the Output
  ====================================
  
! '-windowtitle TEXT'
       Use TEXT as the browser window title prefix.
  
       When specified, the browser window title for each page will be
!      prefixed with TEXT instead of the default string 'Generated API
       Documentation'.
  
       TEXT should be plain text (it should not contain HTML tags).
  
! '-doctitle TEXT'
       Set the header text of the overview page to TEXT.
  
       TEXT should be a short plain text string.
*************** File: cp-tools.info,  Node: Decoration O
*** 2348,2382 ****
       When generating documentation for a single package, specifying this
       option forces generation of the overview page.
  
! `-header HTMLTEXT'
       Add HTMLTEXT to the right upper corner of every generated page.
       HTMLTEXT is usually set to the name of the project being
       documented.
  
! `-footer HTMLTEXT'
       Add HTMLTEXT to the right bottom corner of every generated page.
!      HTMLTEXT is often set to the same value as for `-header'.
  
- `-bottom HTMLTEXT'
       Add HTMLTEXT to the very bottom of every generated page, spanning
       the whole width of the page.  When specified, HTMLTEXT usually
       consists of a copyright notice and/or links to other project pages.
  
! `-addstylesheet FILE'
       Augment the default CSS style sheets with the user-specified
       stylesheet FILE.
  
!      The given stylesheet is simply loaded by each HTML page in
!      addition to the default ones, as the last stylesheet.
  
       Note that the CSS cascading rules apply.  That is, your style
       properties will only be assigned if they have a higher cascading
!      order than `gjdoc''s default style.  One simple way to make sure
!      that this is the case is to declare your overrides `!important'.
  
!      See `http://www.w3.org/TR/REC-CSS2/cascade.html#cascading-order'.
  
- `-group HEADING PKGWILDCARD:PKGWILDCARD:...'
       Arrange the given packages in a separate group on the overview
       page.
  
--- 2300,2339 ----
       When generating documentation for a single package, specifying this
       option forces generation of the overview page.
  
! '-header HTMLTEXT'
! 
       Add HTMLTEXT to the right upper corner of every generated page.
       HTMLTEXT is usually set to the name of the project being
       documented.
  
! '-footer HTMLTEXT'
! 
       Add HTMLTEXT to the right bottom corner of every generated page.
!      HTMLTEXT is often set to the same value as for '-header'.
! 
! '-bottom HTMLTEXT'
  
       Add HTMLTEXT to the very bottom of every generated page, spanning
       the whole width of the page.  When specified, HTMLTEXT usually
       consists of a copyright notice and/or links to other project pages.
  
! '-addstylesheet FILE'
! 
       Augment the default CSS style sheets with the user-specified
       stylesheet FILE.
  
!      The given stylesheet is simply loaded by each HTML page in addition
!      to the default ones, as the last stylesheet.
  
       Note that the CSS cascading rules apply.  That is, your style
       properties will only be assigned if they have a higher cascading
!      order than 'gjdoc''s default style.  One simple way to make sure
!      that this is the case is to declare your overrides '!important'.
  
!      See <http://www.w3.org/TR/REC-CSS2/cascade.html#cascading-order>.
! 
! '-group HEADING PKGWILDCARD:PKGWILDCARD:...'
  
       Arrange the given packages in a separate group on the overview
       page.
  
*************** File: cp-tools.info,  Node: Decoration O
*** 2386,2396 ****
       of all packages in the documentation set whose name matches any of
       the given wildcards.
  
!      There is only one wildcard character, `*', which matches both
!      letters in package name components and the `.' separating package
!      name components.  For example, `j*regex' would match package
!      `java.util.regex'.  A more useful example would be `javax.swing*'
!      to match `javax.swing' and all of its sub-packages.
  
       This option can be given multiple times.
  
--- 2343,2353 ----
       of all packages in the documentation set whose name matches any of
       the given wildcards.
  
!      There is only one wildcard character, '*', which matches both
!      letters in package name components and the '.' separating package
!      name components.  For example, 'j*regex' would match package
!      'java.util.regex'.  A more useful example would be 'javax.swing*'
!      to match 'javax.swing' and all of its sub-packages.
  
       This option can be given multiple times.
  
*************** File: cp-tools.info,  Node: Decoration O
*** 2402,2499 ****
                  -group "Other Extensions" javax* \
                  ...
  
! `-overview FILE'
       Add the XHTML body fragment from FILE to the overview page.
  
!      FILE should contain an XHTML fragment with the HTML `body' tag as
       the root node.  *Note XHTML Fragments::.
  
       This option can be used to supply a description of the
       documentation set as a whole.
  
       When specified, the first sentence of the fragment will be put
!      above the tables listing the documented packages, along with a
!      link to the full copy of the fragment which is put below the
!      tables.  *Note First Sentence Detector::.
  
       When generating documentation for a single package, specifying this
       option forces generation of the overview page.
  
! `-stylesheetfile FILE'
       Use the CSS stylesheet in FILE instead of the default CSS
       stylesheets.
  
       If you only want to override parts of the default stylesheets, use
!      `-addstylesheet' instead.
  
! `-title TEXT'
!      _Deprecated._ Use `-doctitle' TEXT instead.
  
- `-helpfile FILE'
       This option is currently ignored.
  
       When implemented, it will use the XHTML fragment in FILE for the
       help page contents instead of the default help text.
  
- 
  
  File: cp-tools.info,  Node: Output Control Options,  Next: Generation Options,  Prev: Interlinking Options,  Up: gjdoc Tool
  
  4.10 Controlling the Output.
  ============================
  
! `-d DIRECTORY'
       Place all output files into DIRECTORY (and sub-directories).
       DIRECTORY will be created if it does not exist, including all
       non-existing parent directories and all required sub-directories.
  
       If not specified, output will be placed into the current directory.
  
! `-locale NAME'
       Use locale NAME instead of the default locale for all purposes.
  
!      NAME should be a locale specifier in the form `ll_CC[_VAR]' where
!      `ll' is a lowercase two-letter ISO-639 language code, `CC' is an
!      optional uppercase two-letter ISO-3166 country code, and `VAR' is
!      an optional variant code.  For example, `en' specifies English,
!      `en_US' specifies US English, and `en_US_WIN' specifies a deviant
       variant of the US English locale.
  
       Note that the semantics of this option correspond exactly to those
!      of the constructors of class `java.util.Locale'.
  
       This option currently only determines which Collator is being used
       for sorting output elements.  This means that the locale will only
       have an effect when you are using non-ASCII characters in
       identifiers.
  
! `-charset CHARSET'
!      _Deprecated._ Override the specified encoding in output XHTML
!      files with the one given by `charset'.
  
       If this option is not given, the encoding specification in output
       XHTML is chosen to match the encoding used when writing the file
!      (the encoding given with `-docencoding', or your platform's default
       encoding).
  
       The semantics for CHARSET are specified here:
!      `http://www.w3.org/TR/2000/REC-xml-20001006#NT-EncName'.  For all
       practical purposes, they are identical to those of the other
       options accepting charset parameters.
  
!      This option is here for compatibility with `javadoc' and should be
       avoided.
  
! `-docencoding CHARSET'
       Use the given charset encoding when writing output files instead of
       your platform's default encoding.
  
!      Examples for CHARSET are `US-ASCII', `ISO-8859-1' or `UTF-8'.
  
       The semantics of this option correspond exactly to those of the
!      constructors of class `java.util.Locale'.
  
- `-validhtml'
       Force generation of valid XHTML code.  This breaks compatibility to
       the traditional Javadoc tool to some extent.
  
--- 2359,2463 ----
                  -group "Other Extensions" javax* \
                  ...
  
! '-overview FILE'
! 
       Add the XHTML body fragment from FILE to the overview page.
  
!      FILE should contain an XHTML fragment with the HTML 'body' tag as
       the root node.  *Note XHTML Fragments::.
  
       This option can be used to supply a description of the
       documentation set as a whole.
  
       When specified, the first sentence of the fragment will be put
!      above the tables listing the documented packages, along with a link
!      to the full copy of the fragment which is put below the tables.
!      *Note First Sentence Detector::.
  
       When generating documentation for a single package, specifying this
       option forces generation of the overview page.
  
! '-stylesheetfile FILE'
! 
       Use the CSS stylesheet in FILE instead of the default CSS
       stylesheets.
  
       If you only want to override parts of the default stylesheets, use
!      '-addstylesheet' instead.
  
! '-title TEXT'
! 
!      _Deprecated._  Use '-doctitle' TEXT instead.
! 
! '-helpfile FILE'
  
       This option is currently ignored.
  
       When implemented, it will use the XHTML fragment in FILE for the
       help page contents instead of the default help text.
  
  
  File: cp-tools.info,  Node: Output Control Options,  Next: Generation Options,  Prev: Interlinking Options,  Up: gjdoc Tool
  
  4.10 Controlling the Output.
  ============================
  
! '-d DIRECTORY'
       Place all output files into DIRECTORY (and sub-directories).
       DIRECTORY will be created if it does not exist, including all
       non-existing parent directories and all required sub-directories.
  
       If not specified, output will be placed into the current directory.
  
! '-locale NAME'
! 
       Use locale NAME instead of the default locale for all purposes.
  
!      NAME should be a locale specifier in the form 'll_CC[_VAR]' where
!      'll' is a lowercase two-letter ISO-639 language code, 'CC' is an
!      optional uppercase two-letter ISO-3166 country code, and 'VAR' is
!      an optional variant code.  For example, 'en' specifies English,
!      'en_US' specifies US English, and 'en_US_WIN' specifies a deviant
       variant of the US English locale.
  
       Note that the semantics of this option correspond exactly to those
!      of the constructors of class 'java.util.Locale'.
  
       This option currently only determines which Collator is being used
       for sorting output elements.  This means that the locale will only
       have an effect when you are using non-ASCII characters in
       identifiers.
  
! '-charset CHARSET'
! 
!      _Deprecated._  Override the specified encoding in output XHTML
!      files with the one given by 'charset'.
  
       If this option is not given, the encoding specification in output
       XHTML is chosen to match the encoding used when writing the file
!      (the encoding given with '-docencoding', or your platform's default
       encoding).
  
       The semantics for CHARSET are specified here:
!      <http://www.w3.org/TR/2000/REC-xml-20001006#NT-EncName>.  For all
       practical purposes, they are identical to those of the other
       options accepting charset parameters.
  
!      This option is here for compatibility with 'javadoc' and should be
       avoided.
  
! '-docencoding CHARSET'
! 
       Use the given charset encoding when writing output files instead of
       your platform's default encoding.
  
!      Examples for CHARSET are 'US-ASCII', 'ISO-8859-1' or 'UTF-8'.
  
       The semantics of this option correspond exactly to those of the
!      constructors of class 'java.util.Locale'.
! 
! '-validhtml'
  
       Force generation of valid XHTML code.  This breaks compatibility to
       the traditional Javadoc tool to some extent.
  
*************** File: cp-tools.info,  Node: Output Contr
*** 2507,2516 ****
       the traditional format, for example: "foo(String,int[])".  This is
       compatible to the traditional Javadoc tool, but according to both
       the HTML 4.0 and XHTML 1.0 and 1.1 specifications, this format
!      includes illegal characters.  Parentheses, square brackets, and
!      the comma are not allowed in anchor names.
  
- `-baseurl URL'
       Hardwire a page URL relative to URL into each generated page.
  
       If you are generating documentation which will exclusively be
--- 2471,2481 ----
       the traditional format, for example: "foo(String,int[])".  This is
       compatible to the traditional Javadoc tool, but according to both
       the HTML 4.0 and XHTML 1.0 and 1.1 specifications, this format
!      includes illegal characters.  Parentheses, square brackets, and the
!      comma are not allowed in anchor names.
! 
! '-baseurl URL'
  
       Hardwire a page URL relative to URL into each generated page.
  
       If you are generating documentation which will exclusively be
*************** File: cp-tools.info,  Node: Output Contr
*** 2520,2583 ****
       This can help avoid certain redirect attacks used by spammers, and
       it can be helpful for certain web clients.
  
- 
  
  File: cp-tools.info,  Node: Verbosity Options,  Next: Doclet Options,  Prev: Virtual Machine Options,  Up: gjdoc Tool
  
  4.11 Verbosity Options
  ======================
  
! `-quiet'
       Suppress all output except for warnings and error messages.
  
! `-verbose'
!      Be very verbose about what `gjdoc' is doing.
  
       This option is currently ignored.
  
- 
  
  File: cp-tools.info,  Node: Virtual Machine Options,  Next: Verbosity Options,  Prev: Taglet Options,  Up: gjdoc Tool
  
  4.12 Virtual Machine Options
  ============================
  
! Sun's `javadoc' tool seems to be based on `javac' and as such it seems
! to operate on the VM level.  `gjdoc', in contrast, is a pure Java
  application.
  
!    Therefore, `gjdoc' can only fake, or simulate, the following
! VM-level options.
  
! `-classpath PATHLIST'
!      Set the Virtual Machine `classpath' to PATHLIST.
  
!      In most cases you should use `-docletpath' or `-tagletpath'
!      instead of this option.
  
       PATHLIST should be one or more paths to a directory or jar file,
!      separated by your platform's path separator (usually `:' or `;').
  
!      If this option is not intercepted at the wrapper level, `gjdoc'
       currently fakes it by calling
!      `System.setProperty("java.class.path", PATHLIST);' and outputs a
       warning.
  
! `-bootclasspath PATHLIST'
!      Set the Virtual Machine `bootclasspath' to PATHLIST.
  
!      If this option is not intercepted at the wrapper level, `gjdoc'
       outputs a warning.
  
! `-JVMOPT'
!      Pass an arbitrary parameter to the Virtual Machine `gjdoc' runs on.
  
!      If this option is not intercepted at the wrapper level, `gjdoc'
!      tries to emulate the option and outputs a warning.
  
!      Currently, only the VM option `-D' for setting system properties
!      is emulated.
  
  
  
  File: cp-tools.info,  Node: Invoking a Custom Doclet,  Next: Option Summary by Type,  Prev: Invoking the Standard Doclet,  Up: gjdoc Tool
--- 2485,2546 ----
       This can help avoid certain redirect attacks used by spammers, and
       it can be helpful for certain web clients.
  
  
  File: cp-tools.info,  Node: Verbosity Options,  Next: Doclet Options,  Prev: Virtual Machine Options,  Up: gjdoc Tool
  
  4.11 Verbosity Options
  ======================
  
! '-quiet'
       Suppress all output except for warnings and error messages.
  
! '-verbose'
!      Be very verbose about what 'gjdoc' is doing.
  
       This option is currently ignored.
  
  
  File: cp-tools.info,  Node: Virtual Machine Options,  Next: Verbosity Options,  Prev: Taglet Options,  Up: gjdoc Tool
  
  4.12 Virtual Machine Options
  ============================
  
! Sun's 'javadoc' tool seems to be based on 'javac' and as such it seems
! to operate on the VM level.  'gjdoc', in contrast, is a pure Java
  application.
  
!    Therefore, 'gjdoc' can only fake, or simulate, the following VM-level
! options.
  
! '-classpath PATHLIST'
!      Set the Virtual Machine 'classpath' to PATHLIST.
  
!      In most cases you should use '-docletpath' or '-tagletpath' instead
!      of this option.
  
       PATHLIST should be one or more paths to a directory or jar file,
!      separated by your platform's path separator (usually ':' or ';').
  
!      If this option is not intercepted at the wrapper level, 'gjdoc'
       currently fakes it by calling
!      'System.setProperty("java.class.path", PATHLIST);' and outputs a
       warning.
  
! '-bootclasspath PATHLIST'
!      Set the Virtual Machine 'bootclasspath' to PATHLIST.
  
!      If this option is not intercepted at the wrapper level, 'gjdoc'
       outputs a warning.
  
! '-JVMOPT'
  
!      Pass an arbitrary parameter to the Virtual Machine 'gjdoc' runs on.
  
!      If this option is not intercepted at the wrapper level, 'gjdoc'
!      tries to emulate the option and outputs a warning.
  
+      Currently, only the VM option '-D' for setting system properties is
+      emulated.
  
  
  File: cp-tools.info,  Node: Invoking a Custom Doclet,  Next: Option Summary by Type,  Prev: Invoking the Standard Doclet,  Up: gjdoc Tool
*************** File: cp-tools.info,  Node: Invoking a C
*** 2585,2600 ****
  4.13 Invoking a Custom Doclet
  =============================
  
! For invoking one of the other doclets shipping with `gjdoc' or a
  third-party doclet, the canonical usage is:
  
       gjdoc -s src/java/ -all \
         -docletpath /path/to/doclet.jar -doclet foo.BarDoclet \
         (more Gjdoc core options and Doclet-specific options here)
  
!    `/path/to/doclet.jar' is a placeholder for a class path specifying
  where the Doclet classes and dependencies can be found and
! `foo.BarDoclet' is the fully-qualified name of the Doclet's main class.
  
  
  File: cp-tools.info,  Node: Gjdoc Option Summary,  Next: Source Set Options,  Prev: Option Summary by Type,  Up: gjdoc Tool
--- 2548,2563 ----
  4.13 Invoking a Custom Doclet
  =============================
  
! For invoking one of the other doclets shipping with 'gjdoc' or a
  third-party doclet, the canonical usage is:
  
       gjdoc -s src/java/ -all \
         -docletpath /path/to/doclet.jar -doclet foo.BarDoclet \
         (more Gjdoc core options and Doclet-specific options here)
  
!    '/path/to/doclet.jar' is a placeholder for a class path specifying
  where the Doclet classes and dependencies can be found and
! 'foo.BarDoclet' is the fully-qualified name of the Doclet's main class.
  
  
  File: cp-tools.info,  Node: Gjdoc Option Summary,  Next: Source Set Options,  Prev: Option Summary by Type,  Up: gjdoc Tool
*************** A Doclet is a class that contains a meth
*** 2741,2756 ****
  
       public static boolean start(RootDoc rootDoc);
  
!    ROOTDOC is the root of an object hierarchy containing the
! information `gjdoc' extracted from the source files.  See the Doclet
! API for more details.
  
!    `start' should process all the information and return `true' on
! success, `false' on failure.
  
     For printing status information, the Doclet should use methods
! `printNotice', `printWarning' and `printError' instead of `System.err'.
! The Doclet can opt to use `System.out' for redirectable output.
  
  
  File: cp-tools.info,  Node: Using AbstractDoclet,  Next: GNU Doclet SPI,  Prev: Doclet Invocation Interface,  Up: Writing Doclets
--- 2704,2719 ----
  
       public static boolean start(RootDoc rootDoc);
  
!    ROOTDOC is the root of an object hierarchy containing the information
! 'gjdoc' extracted from the source files.  See the Doclet API for more
! details.
  
!    'start' should process all the information and return 'true' on
! success, 'false' on failure.
  
     For printing status information, the Doclet should use methods
! 'printNotice', 'printWarning' and 'printError' instead of 'System.err'.
! The Doclet can opt to use 'System.out' for redirectable output.
  
  
  File: cp-tools.info,  Node: Using AbstractDoclet,  Next: GNU Doclet SPI,  Prev: Doclet Invocation Interface,  Up: Writing Doclets
*************** File: cp-tools.info,  Node: Using Abstra
*** 2758,2789 ****
  6.2.2 Deriving Your Doclet from AbstractDoclet
  ----------------------------------------------
  
! You may want your Doclet to provide functionality similar to
! HtmlDoclet.  For example, you may want it to support Taglets, generate
! Index, Tree, and Uses pages, or show other cross-reference information
! like `Overrides' and `All Implementing Classes'.
  
     This information is not directly provided by the Doclet API, so your
! Doclet would normally have to assemble it itself.  For example, it
! would have to add the names of all program elements to a list and sort
! this list in order to create the Index page.
  
     If you want to provide this information or part of it, you should
  consider deriving your class from
! `gnu.classpath.tools.doclets.AbstractDoclet'.  This class provides the
  following benefits:
  
!    * Handles options `-tag', `-taglet', `-tagletpath' (Taglets)
  
     * Provides standard taglets for @version, @author, @since, @serial,
       @deprecated, @see, @param, @return and handles all related options
!      (`-version', `-author', `-nosince', `-nodeprecated')
  
!    * Handles option `-d' (destination directory)
  
!    * Handles option `-noqualifier' (classes to omit qualifier for)
  
!    * Handles options `-docfilessubdirs' and `-excludedocfilessubdir'
       (resource copying)
  
     * Can generate a full index or an index split by first letter
--- 2721,2752 ----
  6.2.2 Deriving Your Doclet from AbstractDoclet
  ----------------------------------------------
  
! You may want your Doclet to provide functionality similar to HtmlDoclet.
! For example, you may want it to support Taglets, generate Index, Tree,
! and Uses pages, or show other cross-reference information like
! 'Overrides' and 'All Implementing Classes'.
  
     This information is not directly provided by the Doclet API, so your
! Doclet would normally have to assemble it itself.  For example, it would
! have to add the names of all program elements to a list and sort this
! list in order to create the Index page.
  
     If you want to provide this information or part of it, you should
  consider deriving your class from
! 'gnu.classpath.tools.doclets.AbstractDoclet'.  This class provides the
  following benefits:
  
!    * Handles options '-tag', '-taglet', '-tagletpath' (Taglets)
  
     * Provides standard taglets for @version, @author, @since, @serial,
       @deprecated, @see, @param, @return and handles all related options
!      ('-version', '-author', '-nosince', '-nodeprecated')
  
!    * Handles option '-d' (destination directory)
  
!    * Handles option '-noqualifier' (classes to omit qualifier for)
  
!    * Handles options '-docfilessubdirs' and '-excludedocfilessubdir'
       (resource copying)
  
     * Can generate a full index or an index split by first letter
*************** following benefits:
*** 2801,2832 ****
  
     * Provides various other convenience methods
  
  
!    If you derive from `AbstractDoclet', there are a number of things
! you need to take care of:
! 
!    *
!    you should not implement the `start(RootDoc)' method as it is
! already defined by `AbstractDoclet' so that it can care about parsing
! the options.
  
!    Instead, you implement method `run()', `getOptions()' and the other
  abstract methods to define your Doclet's behavior.
  
!    Note that all information provided by `AbstractDoclet' is evaluated
  lazily.  That is, if your Doclet doesn't need to create an Index page,
! then `AbstractDoclet' will not spend resources on creating the
  corresponding information.
  
     See the API documentation for
! `gnu.classpath.tools.doclets.AbstractDoclet' for more details.
  
!    You should be aware that if you base your Doclet on `AbstractDoclet'
  then you have to bundle this and all related classes with your Doclet,
  with all implications such as possible licensing issues.  Otherwise,
! your Doclet will only be runnable on `gjdoc' and not on other
! documentation systems.  Also note that `AbstractDoclet' has not been
! extensively tested in environments other than `gjdoc'.
  
  
  File: cp-tools.info,  Node: GNU Doclet SPI,  Prev: Using AbstractDoclet,  Up: Writing Doclets
--- 2764,2794 ----
  
     * Provides various other convenience methods
  
+    If you derive from 'AbstractDoclet', there are a number of things you
+ need to take care of:
  
!    * 
!    you should not implement the 'start(RootDoc)' method as it is already
! defined by 'AbstractDoclet' so that it can care about parsing the
! options.
  
!    Instead, you implement method 'run()', 'getOptions()' and the other
  abstract methods to define your Doclet's behavior.
  
!    Note that all information provided by 'AbstractDoclet' is evaluated
  lazily.  That is, if your Doclet doesn't need to create an Index page,
! then 'AbstractDoclet' will not spend resources on creating the
  corresponding information.
  
     See the API documentation for
! 'gnu.classpath.tools.doclets.AbstractDoclet' for more details.
  
!    You should be aware that if you base your Doclet on 'AbstractDoclet'
  then you have to bundle this and all related classes with your Doclet,
  with all implications such as possible licensing issues.  Otherwise,
! your Doclet will only be runnable on 'gjdoc' and not on other
! documentation systems.  Also note that 'AbstractDoclet' has not been
! extensively tested in environments other than 'gjdoc'.
  
  
  File: cp-tools.info,  Node: GNU Doclet SPI,  Prev: Using AbstractDoclet,  Up: Writing Doclets
*************** File: cp-tools.info,  Node: GNU Doclet S
*** 2834,2854 ****
  6.2.3 Preparing for the GNU Doclet Service Provider Interface
  -------------------------------------------------------------
  
! In addition to the standard Doclet invocation interface described
! above, `gjdoc' also offers a Service Provider Interface conforming to
! the Java standard.  Adding support for this interface to your Doclet
! simplifies usage for `gjdoc' users because it makes your Doclet
! "discoverable".
  
     In order to provide the alternate interface, you have to add a class
! implementing `gnu.classpath.tools.gjdoc.spi.DocletSpi' to your Doclet
  classes, and bundle all Doclet classes in a Jar file along with a file
! named `META_INF/services/gnu.classpath.tools.gjdoc.spi.DocletSpi' which
  contains the name of your class implementing DocletSpi on a single line.
  
     Note that if your Doclet depends on third-party classes bundled in
  separate Jar files, you can link in these classes using the
! `Class-path:' Manifest attribute of your Doclet Jar.
  
     Your Doclet can then be invoked in one of the following ways:
       gjdoc -docletjar /path/to/doclet.jar
--- 2796,2815 ----
  6.2.3 Preparing for the GNU Doclet Service Provider Interface
  -------------------------------------------------------------
  
! In addition to the standard Doclet invocation interface described above,
! 'gjdoc' also offers a Service Provider Interface conforming to the Java
! standard.  Adding support for this interface to your Doclet simplifies
! usage for 'gjdoc' users because it makes your Doclet "discoverable".
  
     In order to provide the alternate interface, you have to add a class
! implementing 'gnu.classpath.tools.gjdoc.spi.DocletSpi' to your Doclet
  classes, and bundle all Doclet classes in a Jar file along with a file
! named 'META_INF/services/gnu.classpath.tools.gjdoc.spi.DocletSpi' which
  contains the name of your class implementing DocletSpi on a single line.
  
     Note that if your Doclet depends on third-party classes bundled in
  separate Jar files, you can link in these classes using the
! 'Class-path:' Manifest attribute of your Doclet Jar.
  
     Your Doclet can then be invoked in one of the following ways:
       gjdoc -docletjar /path/to/doclet.jar
*************** separate Jar files, you can link in thes
*** 2856,2865 ****
       gjdoc -docletname DOCLETNAME
  
     Here, DOCLETNAME is the name of your doclet as returned by
! `DocletSpi.getDocletName()'.
  
!    The last example will only work if your Doclet Jar is in `gjdoc''s
! `doclets' directory or if it is on the classpath.
  
  
  File: cp-tools.info,  Node: XHTML Fragments,  Next: First Sentence Detector,  Prev: Writing Doclets,  Up: Gjdoc Concepts
--- 2817,2826 ----
       gjdoc -docletname DOCLETNAME
  
     Here, DOCLETNAME is the name of your doclet as returned by
! 'DocletSpi.getDocletName()'.
  
!    The last example will only work if your Doclet Jar is in 'gjdoc''s
! 'doclets' directory or if it is on the classpath.
  
  
  File: cp-tools.info,  Node: XHTML Fragments,  Next: First Sentence Detector,  Prev: Writing Doclets,  Up: Gjdoc Concepts
*************** results in invalid files if the user-spe
*** 2876,2882 ****
  HTML code, which means that every Doclet must deal with non-wellformed
  code as well.
  
!    The `gjdoc' built-in Doclets deal with this problem by "fixing" the
  HTML code - making sure that all tags are closed, attribute values are
  provided and quoted, tags are properly nested, etc.
  
--- 2837,2843 ----
  HTML code, which means that every Doclet must deal with non-wellformed
  code as well.
  
!    The 'gjdoc' built-in Doclets deal with this problem by "fixing" the
  HTML code - making sure that all tags are closed, attribute values are
  provided and quoted, tags are properly nested, etc.
  
*************** File: cp-tools.info,  Node: First Senten
*** 2898,2939 ****
  6.4 How Gjdoc Determines where the First Sentence Ends
  ======================================================
  
! For a package, class or member summary, `gjdoc' only shows the first
! sentence of the documentation comment in question.  Because `gjdoc' is
! not human, it is not always obvious to `gjdoc' where the first sentence
  ends.
  
     You might be tempted to say that the first sentence ends at the first
! occurrence of a punctuation character like `.' or `!'. However,
  consider examples like this:
       This work, by Thomas J. Shahan et al., is about the middle ages.
  
     As you can see, it is not trivial to determine the end of the
  sentence.
  
!    `gjdoc' gives you the choice between two approaches.  By default it
! uses built-in heuristics which should be compatible to Sun's `javadoc'
  tool.  This approach works quiet well in most cases, at least for
  english comments.
  
!    Alternatively, you can specify option `-breakiterator' in which case
! `gjdoc' will use
! `java.text.BreakIterator.getSentenceInstance(LOCALE).next()' to find
! the end of sentence, where LOCALE is the locale specified by option
! `-locale' or the default locale if none specified.
  
     _NOT YET IMPLEMENTED:_
  
!    `gjdoc' also allows you to explicitly delineate the first sentence
! by putting it in a `<span>' tag with the CSS class `first-sentence'.
! For example:
       /**
        *  <span class="first-sentence">This. is. the. first.
        *  sentence.</span> This is the second sentence.
        */
  
!    Note that this will only work with `gjdoc', but shouldn't hurt when
! using another documentation system since the `<span>' tag usually
  doesn't show up in the output.
  
  
--- 2859,2900 ----
  6.4 How Gjdoc Determines where the First Sentence Ends
  ======================================================
  
! For a package, class or member summary, 'gjdoc' only shows the first
! sentence of the documentation comment in question.  Because 'gjdoc' is
! not human, it is not always obvious to 'gjdoc' where the first sentence
  ends.
  
     You might be tempted to say that the first sentence ends at the first
! occurrence of a punctuation character like '.' or '!'.  However,
  consider examples like this:
       This work, by Thomas J. Shahan et al., is about the middle ages.
  
     As you can see, it is not trivial to determine the end of the
  sentence.
  
!    'gjdoc' gives you the choice between two approaches.  By default it
! uses built-in heuristics which should be compatible to Sun's 'javadoc'
  tool.  This approach works quiet well in most cases, at least for
  english comments.
  
!    Alternatively, you can specify option '-breakiterator' in which case
! 'gjdoc' will use
! 'java.text.BreakIterator.getSentenceInstance(LOCALE).next()' to find the
! end of sentence, where LOCALE is the locale specified by option
! '-locale' or the default locale if none specified.
  
     _NOT YET IMPLEMENTED:_
  
!    'gjdoc' also allows you to explicitly delineate the first sentence by
! putting it in a '<span>' tag with the CSS class 'first-sentence'.  For
! example:
       /**
        *  <span class="first-sentence">This. is. the. first.
        *  sentence.</span> This is the second sentence.
        */
  
!    Note that this will only work with 'gjdoc', but shouldn't hurt when
! using another documentation system since the '<span>' tag usually
  doesn't show up in the output.
  
  
*************** Sometimes you want to decorate your docu
*** 2946,2976 ****
  resources such as images, SVG graphics, applets, and so on.  To do so,
  simply put the required files in a subdirectory 'doc-files' in the
  package directory corresponding to the documentation entry you want to
! decorate, and refer to it with the URL `doc-files/FILENAME'.
  
     For example, if you want to add an image to the description of class
! `baz.FooBar', create a directory `doc-files' in the directory `baz'
! containing `FooBar.java' and put your file, say `diagram.png', into
! that directory.  Then, add the HTML code like this to a comment in
! `FooBar.java':
       <img src="doc-files/diagram.png" width="200" height="150"
         alt="Foo Diagram"/>
  
!    This works because the `doc-files' subdirectories will be copied to
  the target documentation directory every time you generate the
  documentation.
  
!    Note however that by default, the `doc-files' directory will not be
  copied deeply.  In other words, if you create subdirectories under
! `doc-files' they will not be copied and any resources located in these
  subdirectories will not be accessible in your generated documentation.
! You can specify option `-docfilessubdirs' to remove this limitation.
  
!    Sometimes you want to use option `-docfilessubdirs', but there are
  certain directories which you don't want to be copied, for example
! because they contain source files for the resources in `doc-files'.
! For cases like this, use `-excludedocfilessubdir' to specify
! directories to be omitted.
  
  
  File: cp-tools.info,  Node: I18N Issues,  Prev: Other Tools,  Up: Top
--- 2907,2937 ----
  resources such as images, SVG graphics, applets, and so on.  To do so,
  simply put the required files in a subdirectory 'doc-files' in the
  package directory corresponding to the documentation entry you want to
! decorate, and refer to it with the URL 'doc-files/FILENAME'.
  
     For example, if you want to add an image to the description of class
! 'baz.FooBar', create a directory 'doc-files' in the directory 'baz'
! containing 'FooBar.java' and put your file, say 'diagram.png', into that
! directory.  Then, add the HTML code like this to a comment in
! 'FooBar.java':
       <img src="doc-files/diagram.png" width="200" height="150"
         alt="Foo Diagram"/>
  
!    This works because the 'doc-files' subdirectories will be copied to
  the target documentation directory every time you generate the
  documentation.
  
!    Note however that by default, the 'doc-files' directory will not be
  copied deeply.  In other words, if you create subdirectories under
! 'doc-files' they will not be copied and any resources located in these
  subdirectories will not be accessible in your generated documentation.
! You can specify option '-docfilessubdirs' to remove this limitation.
  
!    Sometimes you want to use option '-docfilessubdirs', but there are
  certain directories which you don't want to be copied, for example
! because they contain source files for the resources in 'doc-files'.  For
! cases like this, use '-excludedocfilessubdir' to specify directories to
! be omitted.
  
  
  File: cp-tools.info,  Node: I18N Issues,  Prev: Other Tools,  Up: Top
*************** File: cp-tools.info,  Node: Language Res
*** 2994,3079 ****
  7.1 Language-specific resources
  ===============================
  
! The Tools use Java `ResourceBundle's to store messages, and message
  templates they use at runtime to generate the message text itself,
  depending on the locale in use at the time.
  
     The Resource Bundles these tools use are essentially Java Properties
! files consisting of a set of Name/Value pairs. The Name is the Property
  Name and the Value is a substitution string that is used when the code
! references the associated Name. For example the following is a line in
! a Resource Bundle used by the `keytool' Tool:
  
       Command.23=A correct key password MUST be provided
  
     When the tool needs to signal a mandatory but missing key password,
! it would reference the property named `Command.23' and the message "`A
! correct key password MUST be provided'" will be used instead. This
  indirect referencing of "resources" permits replacing, as late as
  possible, the English strings with strings in other languages, provided
  of course Resource Bundles in those languages are provided.
  
     For the GNU Classpath Tools described in this Guide, the Resource
! Bundles are files named `messages[_ll[_CC[_VV]]].properties' where:
  
  LL
       Is the 2-letter code for the Language,
- 
  CC
       Is the 2-letter code for the Region, and
- 
  VV
       Is the 2-letter code for the Variant of the language.
  
     The complete list of language codes can be found at Code for the
  representation of names of languages
! (http://ftp.ics.uci.edu/pub/ietf/http/related/iso639.txt). A similar
  list for the region codes can be found at ISO 3166 Codes (Countries)
  (http://userpage.chemie.fu-berlin.de/diverse/doc/ISO_3166.html).
  
     The location of the Resource Bundles for the GNU Classpath Tools is
! specific to each tool. The next table shows where these files are found
  in a standard GNU Classpath distribution:
  
! `jarsigner'
!      `gnu/classpath/tools/jarsigner'
! 
! `keytool'
!      `gnu/classpath/tools/keytool'
  
     The collection of Resource Bundles in a location act as an inverted
! tree with a parent-child relationship. For example suppose in the
! `gnu/classpath/tools/keytool' there are 3 message bundles named:
! 
!   1. `messages.properties'
! 
!   2. `messages_fr.properties'
  
!   3. `messages_fr_FR.properties'
  
     In the above example, bundle #1 will act as the parent of bundle #2,
! which in turn will act as the parent for bundle #3. This ordering is
  used by the Java runtime to choose which file to load based on the set
! Locale. For example if the Locale is `fr_CH', `messages_fr.properties'
! will be used because (a) `messages_fr_CH.properties' does not exist,
! but (b) `messages_fr.properties' is the parent for the required bundle,
! and it exists. As another example, suppose the Locale was set to
! `en_AU'; then the tool will end up using `messages.properties' because
! (a) `messages_en_AU.properties' does not exist, (b)
! `messages_en.properties' which is the parent for the required bundle
! does not exist, but (c) `messages.properties' exists and is the root of
! the hierarchy.
  
!    You can see from the examples above that `messages.properties' is
! the safety net that the Java runtime falls back to when failing to find
! a specific bundle and its parent(s). This file is always provided with
! the Tool. In time, more localized versions will be included to cater
  for other languages.
  
     In the meantime, if you are willing to contribute localized versions
! of these resources, grab the `messages.properties' for a specific tool;
  translate it; save it with the appropriate language and region suffix
! and mail it to `classpath@gnu.org'.
  
  
  File: cp-tools.info,  Node: Message Formats,  Prev: Language Resources,  Up: I18N Issues
--- 2955,3034 ----
  7.1 Language-specific resources
  ===============================
  
! The Tools use Java 'ResourceBundle's to store messages, and message
  templates they use at runtime to generate the message text itself,
  depending on the locale in use at the time.
  
     The Resource Bundles these tools use are essentially Java Properties
! files consisting of a set of Name/Value pairs.  The Name is the Property
  Name and the Value is a substitution string that is used when the code
! references the associated Name.  For example the following is a line in
! a Resource Bundle used by the 'keytool' Tool:
  
       Command.23=A correct key password MUST be provided
  
     When the tool needs to signal a mandatory but missing key password,
! it would reference the property named 'Command.23' and the message "'A
! correct key password MUST be provided'" will be used instead.  This
  indirect referencing of "resources" permits replacing, as late as
  possible, the English strings with strings in other languages, provided
  of course Resource Bundles in those languages are provided.
  
     For the GNU Classpath Tools described in this Guide, the Resource
! Bundles are files named 'messages[_ll[_CC[_VV]]].properties' where:
  
  LL
       Is the 2-letter code for the Language,
  CC
       Is the 2-letter code for the Region, and
  VV
       Is the 2-letter code for the Variant of the language.
  
     The complete list of language codes can be found at Code for the
  representation of names of languages
! (http://ftp.ics.uci.edu/pub/ietf/http/related/iso639.txt).  A similar
  list for the region codes can be found at ISO 3166 Codes (Countries)
  (http://userpage.chemie.fu-berlin.de/diverse/doc/ISO_3166.html).
  
     The location of the Resource Bundles for the GNU Classpath Tools is
! specific to each tool.  The next table shows where these files are found
  in a standard GNU Classpath distribution:
  
! 'jarsigner'
!      'gnu/classpath/tools/jarsigner'
! 'keytool'
!      'gnu/classpath/tools/keytool'
  
     The collection of Resource Bundles in a location act as an inverted
! tree with a parent-child relationship.  For example suppose in the
! 'gnu/classpath/tools/keytool' there are 3 message bundles named:
  
!   1. 'messages.properties'
!   2. 'messages_fr.properties'
!   3. 'messages_fr_FR.properties'
  
     In the above example, bundle #1 will act as the parent of bundle #2,
! which in turn will act as the parent for bundle #3.  This ordering is
  used by the Java runtime to choose which file to load based on the set
! Locale.  For example if the Locale is 'fr_CH', 'messages_fr.properties'
! will be used because (a) 'messages_fr_CH.properties' does not exist, but
! (b) 'messages_fr.properties' is the parent for the required bundle, and
! it exists.  As another example, suppose the Locale was set to 'en_AU';
! then the tool will end up using 'messages.properties' because (a)
! 'messages_en_AU.properties' does not exist, (b) 'messages_en.properties'
! which is the parent for the required bundle does not exist, but (c)
! 'messages.properties' exists and is the root of the hierarchy.
  
!    You can see from the examples above that 'messages.properties' is the
! safety net that the Java runtime falls back to when failing to find a
! specific bundle and its parent(s).  This file is always provided with
! the Tool.  In time, more localized versions will be included to cater
  for other languages.
  
     In the meantime, if you are willing to contribute localized versions
! of these resources, grab the 'messages.properties' for a specific tool;
  translate it; save it with the appropriate language and region suffix
! and mail it to 'classpath@gnu.org'.
  
  
  File: cp-tools.info,  Node: Message Formats,  Prev: Language Resources,  Up: I18N Issues
*************** File: cp-tools.info,  Node: Message Form
*** 3081,3087 ****
  7.2 Message formats
  ===================
  
! If you open any of the `messages.properties' described in the previous
  section, you may see properties that look like so:
  
       Command.67=Issuer: {0}
--- 3036,3042 ----
  7.2 Message formats
  ===================
  
! If you open any of the 'messages.properties' described in the previous
  section, you may see properties that look like so:
  
       Command.67=Issuer: {0}
*************** section, you may see properties that loo
*** 3093,3191 ****
  string that will then be used either as a prompt for User input or as
  output.
  
!    If you are translating a `messages.properties' be careful not to
  alter text between curly braces.
  
  
  
  Tag Table:
! Node: Top1164
! Node: Applet Tools6884
! Node: appletviewer Tool7457
! Node: gcjwebplugin10572
! Node: Security Tools10884
! Node: jarsigner Tool11537
! Node: Common jarsigner Options12585
! Node: Signing Options13900
! Node: Verification Options16483
! Node: keytool Tool17071
! Node: Getting Help21499
! Node: Common keytool Options22243
! Ref: alias22516
! Ref: keyalg22898
! Ref: keysize23128
! Ref: validity23393
! Ref: storetype23608
! Ref: storepass23939
! Ref: keystore24136
! Ref: provider24679
! Ref: file25086
! Ref: verbose25557
! Node: Distinguished Names25649
! Ref: dn25843
! Node: Add/Update Commands26906
! Node: Command -genkey27434
! Node: Command -import29843
! Node: Command -selfcert32987
! Node: Command -cacert35166
! Node: Command -identitydb36219
! Node: Export Commands36877
! Node: Command -certreq37193
! Node: Command -export39599
! Node: Display Commands40796
! Node: Command -list41128
! Node: Command -printcert42261
! Node: Management Commands42645
! Node: Command -keyclone43077
! Node: Command -storepasswd44480
! Node: Command -keypasswd45209
! Node: Command -delete46403
! Node: Other Tools47026
! Node: jar Tool47868
! Node: javah Tool49260
! Node: gcjh Tool50479
! Node: native2ascii Tool51592
! Node: orbd Tool52053
! Node: serialver Tool52783
! Node: rmid Tool53252
! Node: rmiregistry Tool54193
! Node: tnameserv Tool55033
! Node: gjdoc Tool55657
! Node: Invoking the Standard Doclet57645
! Node: Option Summary by Type58800
! Node: Source Set Options61230
! Node: Source Format Options63094
! Node: Interlinking Options64608
! Node: Generation Options67385
! Node: Taglet Options73482
! Node: Doclet Options75709
! Node: Decoration Options77285
! Node: Output Control Options81376
! Node: Verbosity Options84908
! Node: Virtual Machine Options85254
! Node: Invoking a Custom Doclet86650
! Node: Gjdoc Option Summary87325
! Node: Other Doclets87505
! Node: Built-in Doclets87733
! Node: Using TexiDoclet87988
! Node: Using XmlDoclet88210
! Node: Using IspellDoclet88435
! Node: Using DebugDoclet88663
! Node: Third-party Doclets88863
! Node: DocBook Doclet89079
! Node: PDFDoclet89222
! Node: JUnitDoclet89375
! Node: Gjdoc Concepts89509
! Node: Taglets89753
! Node: Writing Doclets89936
! Node: Doclet Invocation Interface90276
! Node: Using AbstractDoclet91068
! Node: GNU Doclet SPI94062
! Node: XHTML Fragments95534
! Node: First Sentence Detector96967
! Node: Adding Custom Resources98729
! Node: I18N Issues100425
! Node: Language Resources100927
! Node: Message Formats104591
  
  End Tag Table
--- 3048,3146 ----
  string that will then be used either as a prompt for User input or as
  output.
  
!    If you are translating a 'messages.properties' be careful not to
  alter text between curly braces.
  
  
  
  Tag Table:
! Node: Top1103
! Node: Applet Tools6822
! Node: appletviewer Tool7395
! Node: gcjwebplugin10513
! Node: Security Tools10825
! Node: jarsigner Tool11478
! Node: Common jarsigner Options12525
! Node: Signing Options13840
! Node: Verification Options16426
! Node: keytool Tool17013
! Node: Getting Help21462
! Node: Common keytool Options22203
! Ref: alias22477
! Ref: keyalg22861
! Ref: keysize23092
! Ref: validity23358
! Ref: storetype23574
! Ref: storepass23906
! Ref: keystore24103
! Ref: provider24646
! Ref: file25054
! Ref: verbose25528
! Node: Distinguished Names25619
! Ref: dn25813
! Node: Add/Update Commands26880
! Node: Command -genkey27408
! Node: Command -import29821
! Node: Command -selfcert32968
! Node: Command -cacert35151
! Node: Command -identitydb36204
! Node: Export Commands36861
! Node: Command -certreq37177
! Node: Command -export39588
! Node: Display Commands40786
! Node: Command -list41118
! Node: Command -printcert42251
! Node: Management Commands42634
! Node: Command -keyclone43066
! Node: Command -storepasswd44469
! Node: Command -keypasswd45197
! Node: Command -delete46391
! Node: Other Tools47013
! Node: jar Tool47855
! Node: javah Tool49245
! Node: gcjh Tool50462
! Node: native2ascii Tool51570
! Node: orbd Tool52029
! Node: serialver Tool52757
! Node: rmid Tool53224
! Node: rmiregistry Tool54163
! Node: tnameserv Tool55001
! Node: gjdoc Tool55623
! Node: Invoking the Standard Doclet57612
! Node: Option Summary by Type58767
! Node: Source Set Options61196
! Node: Source Format Options63059
! Node: Interlinking Options64575
! Node: Generation Options67356
! Node: Taglet Options73463
! Node: Doclet Options75691
! Node: Decoration Options77261
! Node: Output Control Options81360
! Node: Verbosity Options84897
! Node: Virtual Machine Options85242
! Node: Invoking a Custom Doclet86638
! Node: Gjdoc Option Summary87313
! Node: Other Doclets87493
! Node: Built-in Doclets87721
! Node: Using TexiDoclet87976
! Node: Using XmlDoclet88198
! Node: Using IspellDoclet88423
! Node: Using DebugDoclet88651
! Node: Third-party Doclets88851
! Node: DocBook Doclet89067
! Node: PDFDoclet89210
! Node: JUnitDoclet89363
! Node: Gjdoc Concepts89497
! Node: Taglets89741
! Node: Writing Doclets89924
! Node: Doclet Invocation Interface90264
! Node: Using AbstractDoclet91056
! Node: GNU Doclet SPI94049
! Node: XHTML Fragments95521
! Node: First Sentence Detector96954
! Node: Adding Custom Resources98718
! Node: I18N Issues100415
! Node: Language Resources100917
! Node: Message Formats104587
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gappletviewer.1 gcc-5.5.0/libjava/classpath/doc/gappletviewer.1
*** gcc-5.4.0/libjava/classpath/doc/gappletviewer.1	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/gappletviewer.1	Tue Oct 10 09:52:09 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GAPPLETVIEWER 1"
! .TH GAPPLETVIEWER 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GAPPLETVIEWER 1"
! .TH GAPPLETVIEWER 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** The \fBappletviewer\fR tool loads and ru
*** 152,158 ****
  .PP
  Use the first form to test applets specified by tag.  The \s-1URL\s0 should
  resolve to an \s-1HTML\s0 document from which the \fBappletviewer\fR will
! extract applet tags.  The \s-1APPLET\s0, \s-1EMBED\s0 and \s-1OBJECT\s0 tags are supported.
  If a given document contains multiple applet tags, all the applets
  will be loaded, with each applet appearing in its own window.
  Likewise, when multiple URLs are specified, each applet tag instance
--- 149,155 ----
  .PP
  Use the first form to test applets specified by tag.  The \s-1URL\s0 should
  resolve to an \s-1HTML\s0 document from which the \fBappletviewer\fR will
! extract applet tags.  The \s-1APPLET, EMBED\s0 and \s-1OBJECT\s0 tags are supported.
  If a given document contains multiple applet tags, all the applets
  will be loaded, with each applet appearing in its own window.
  Likewise, when multiple URLs are specified, each applet tag instance
*************** be ignored.
*** 177,183 ****
  \&\fBappletviewer\fR through named pipes.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! \&\s-1URL\s0 \s-1OPTIONS\s0
  .IP "\fB\-debug\fR" 4
  .IX Item "-debug"
  This option is not yet implemented but is provided for compatibility.
--- 174,180 ----
  \&\fBappletviewer\fR through named pipes.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! \&\s-1URL OPTIONS\s0
  .IP "\fB\-debug\fR" 4
  .IX Item "-debug"
  This option is not yet implemented but is provided for compatibility.
*************** This option is not yet implemented but i
*** 186,192 ****
  Use this option to specify an alternate character encoding for the
  specified \s-1HTML\s0 page.
  .PP
! \&\s-1APPLET\s0 \s-1TAG\s0 \s-1OPTIONS\s0
  .IP "\fB\-code\fR \fI\s-1CODE\s0\fR" 4
  .IX Item "-code CODE"
  Use the \fB\-code\fR option to specify the value of the applet tag
--- 183,189 ----
  Use this option to specify an alternate character encoding for the
  specified \s-1HTML\s0 page.
  .PP
! \&\s-1APPLET TAG OPTIONS\s0
  .IP "\fB\-code\fR \fI\s-1CODE\s0\fR" 4
  .IX Item "-code CODE"
  Use the \fB\-code\fR option to specify the value of the applet tag
*************** Use the \fB\-height\fR option to specify
*** 212,218 ****
  Use the \fB\-param\fR option to specify values for the \fI\s-1NAME\s0\fR
  and \fI\s-1VALUE\s0\fR attributes of an applet \s-1PARAM\s0 tag.
  .PP
! \&\s-1PLUGIN\s0 \s-1OPTION\s0
  .IP "\fB\-plugin\fR \fI\s-1INPUT\s0\fR\fB,\fR\fI\s-1OUTPUT\s0\fR" 4
  .IX Item "-plugin INPUT,OUTPUT"
  \&\fBgcjwebplugin\fR uses the \fB\-plugin\fR option to specify the
--- 209,215 ----
  Use the \fB\-param\fR option to specify values for the \fI\s-1NAME\s0\fR
  and \fI\s-1VALUE\s0\fR attributes of an applet \s-1PARAM\s0 tag.
  .PP
! \&\s-1PLUGIN OPTION\s0
  .IP "\fB\-plugin\fR \fI\s-1INPUT\s0\fR\fB,\fR\fI\s-1OUTPUT\s0\fR" 4
  .IX Item "-plugin INPUT,OUTPUT"
  \&\fBgcjwebplugin\fR uses the \fB\-plugin\fR option to specify the
*************** named pipe the \fBappletviewer\fR should
*** 220,232 ****
  (\fI\s-1INPUT\s0\fR) and the one it should use for sending commands to
  \&\fBgcjwebplugin\fR (\fI\s-1OUTPUT\s0\fR).
  .PP
! \&\s-1DEBUGGING\s0 \s-1OPTION\s0
  .IP "\fB\-verbose\fR" 4
  .IX Item "-verbose"
  Use the \fB\-verbose\fR option to have the \fBappletviewer\fR print
  debugging messages.
  .PP
! \&\s-1STANDARD\s0 \s-1OPTIONS\s0
  .IP "\fB\-help\fR" 4
  .IX Item "-help"
  Use the \fB\-help\fR option to have the \fBappletviewer\fR print a
--- 217,229 ----
  (\fI\s-1INPUT\s0\fR) and the one it should use for sending commands to
  \&\fBgcjwebplugin\fR (\fI\s-1OUTPUT\s0\fR).
  .PP
! \&\s-1DEBUGGING OPTION\s0
  .IP "\fB\-verbose\fR" 4
  .IX Item "-verbose"
  Use the \fB\-verbose\fR option to have the \fBappletviewer\fR print
  debugging messages.
  .PP
! \&\s-1STANDARD OPTIONS\s0
  .IP "\fB\-help\fR" 4
  .IX Item "-help"
  Use the \fB\-help\fR option to have the \fBappletviewer\fR print a
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gjar.1 gcc-5.5.0/libjava/classpath/doc/gjar.1
*** gcc-5.4.0/libjava/classpath/doc/gjar.1	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/gjar.1	Tue Oct 10 09:52:09 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GJAR 1"
! .TH GJAR 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GJAR 1"
! .TH GJAR 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** gjar \fB\-ctxui\fR [\fI\s-1OPTIONS\s0\fR
*** 145,151 ****
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
  \&\fBgjar\fR is an implementation of Sun's jar utility that comes with
! the \s-1JDK\s0.
  .PP
  If any file is a directory then it is processed recursively.  The
  manifest file name and the archive file name needs to be specified in
--- 142,148 ----
  .SH "DESCRIPTION"
  .IX Header "DESCRIPTION"
  \&\fBgjar\fR is an implementation of Sun's jar utility that comes with
! the \s-1JDK.\s0
  .PP
  If any file is a directory then it is processed recursively.  The
  manifest file name and the archive file name needs to be specified in
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gjarsigner.1 gcc-5.5.0/libjava/classpath/doc/gjarsigner.1
*** gcc-5.4.0/libjava/classpath/doc/gjarsigner.1	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/gjarsigner.1	Tue Oct 10 09:52:09 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GJARSIGNER 1"
! .TH GJARSIGNER 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GJARSIGNER 1"
! .TH GJARSIGNER 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** Use this option to specify the password
*** 195,206 ****
  If this option is omitted, the tool will first attempt to unlock the \fIKey Entry\fR using the same password protecting the key store. If this fails, you will then be prompted to provide a password.
  .IP "\fB\-sigfile\fR \fI\s-1NAME\s0\fR" 4
  .IX Item "-sigfile NAME"
! Use this option to designate a literal that will be used to construct file names for both the \f(CW\*(C`.SF\*(C'\fR and \f(CW\*(C`.DSA\*(C'\fR signature files. These files  will be generated, by the tool, and placed in the \fIMETA-INF\fR directory of the signed \s-1JAR\s0.  Permissible characters for \fI\s-1NAME\s0\fR must be in the range \*(L"a\-zA\-Z0\-9_\-\*(R".  All characters will be converted to upper-case ones.
  .Sp
  If this option is missing, the first eight characters of the \fI\s-1ALIAS\s0\fR argument will be used. When this is the case, any character in \fI\s-1ALIAS\s0\fR that is outside the permissible range of characters will be replaced by an underscore.
  .IP "\fB\-signedjar\fR \fI\s-1FILE\s0\fR" 4
  .IX Item "-signedjar FILE"
! Use this option to specify the file name of the signed \s-1JAR\s0. If this option is omitted, then the signed \s-1JAR\s0 will be named the same as \fI\s-1FILE\s0\fR; i.e., the input \s-1JAR\s0 file will be replaced with the signed copy.
  .PP
  \fIVerification options\fR
  .IX Subsection "Verification options"
--- 192,203 ----
  If this option is omitted, the tool will first attempt to unlock the \fIKey Entry\fR using the same password protecting the key store. If this fails, you will then be prompted to provide a password.
  .IP "\fB\-sigfile\fR \fI\s-1NAME\s0\fR" 4
  .IX Item "-sigfile NAME"
! Use this option to designate a literal that will be used to construct file names for both the \f(CW\*(C`.SF\*(C'\fR and \f(CW\*(C`.DSA\*(C'\fR signature files. These files  will be generated, by the tool, and placed in the \fIMETA-INF\fR directory of the signed \s-1JAR.\s0  Permissible characters for \fI\s-1NAME\s0\fR must be in the range \*(L"a\-zA\-Z0\-9_\-\*(R".  All characters will be converted to upper-case ones.
  .Sp
  If this option is missing, the first eight characters of the \fI\s-1ALIAS\s0\fR argument will be used. When this is the case, any character in \fI\s-1ALIAS\s0\fR that is outside the permissible range of characters will be replaced by an underscore.
  .IP "\fB\-signedjar\fR \fI\s-1FILE\s0\fR" 4
  .IX Item "-signedjar FILE"
! Use this option to specify the file name of the signed \s-1JAR.\s0 If this option is omitted, then the signed \s-1JAR\s0 will be named the same as \fI\s-1FILE\s0\fR; i.e., the input \s-1JAR\s0 file will be replaced with the signed copy.
  .PP
  \fIVerification options\fR
  .IX Subsection "Verification options"
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gjavah.1 gcc-5.5.0/libjava/classpath/doc/gjavah.1
*** gcc-5.4.0/libjava/classpath/doc/gjavah.1	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/gjavah.1	Tue Oct 10 09:52:09 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GJAVAH 1"
! .TH GJAVAH 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GJAVAH 1"
! .TH GJAVAH 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gjdoc.1 gcc-5.5.0/libjava/classpath/doc/gjdoc.1
*** gcc-5.4.0/libjava/classpath/doc/gjdoc.1	Fri Jun  3 10:42:39 2016
--- gcc-5.5.0/libjava/classpath/doc/gjdoc.1	Tue Oct 10 09:52:10 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GJDOC 1"
! .TH GJDOC 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GJDOC 1"
! .TH GJDOC 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** To learn more about running Doclets othe
*** 189,195 ****
  refer to the manual.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! .Sh "Option Summary by Type"
  .IX Subsection "Option Summary by Type"
  Here is a summary of all the options of both Gjdoc and the Standard
  Doclet, grouped by type.  Explanations are in the following sections.
--- 186,192 ----
  refer to the manual.
  .SH "OPTIONS"
  .IX Header "OPTIONS"
! .SS "Option Summary by Type"
  .IX Subsection "Option Summary by Type"
  Here is a summary of all the options of both Gjdoc and the Standard
  Doclet, grouped by type.  Explanations are in the following sections.
*************** Doclet, grouped by type.  Explanations a
*** 231,237 ****
  .IP "\fIVirtual Machine Options\fR" 4
  .IX Item "Virtual Machine Options"
  \&\fB\-classpath  \-bootclasspath  \-J\fR \fIvmopt\fR
! .Sh "Selecting which Source Files to Process"
  .IX Subsection "Selecting which Source Files to Process"
  .IP "\fB\-s\fR \fIpathlist\fR" 4
  .IX Item "-s pathlist"
--- 228,234 ----
  .IP "\fIVirtual Machine Options\fR" 4
  .IX Item "Virtual Machine Options"
  \&\fB\-classpath  \-bootclasspath  \-J\fR \fIvmopt\fR
! .SS "Selecting which Source Files to Process"
  .IX Subsection "Selecting which Source Files to Process"
  .IP "\fB\-s\fR \fIpathlist\fR" 4
  .IX Item "-s pathlist"
*************** Process all classes in the given Java pa
*** 281,287 ****
  .IP "\fIsourcefiles\fR\fB...\fR" 4
  .IX Item "sourcefiles..."
  Process the classes in the given Java source files.
! .Sh "Specifying the Format of Input Files"
  .IX Subsection "Specifying the Format of Input Files"
  .IP "\fB\-source\fR \fIrelease\fR" 4
  .IX Item "-source release"
--- 278,284 ----
  .IP "\fIsourcefiles\fR\fB...\fR" 4
  .IX Item "sourcefiles..."
  Process the classes in the given Java source files.
! .SS "Specifying the Format of Input Files"
  .IX Subsection "Specifying the Format of Input Files"
  .IP "\fB\-source\fR \fIrelease\fR" 4
  .IX Item "-source release"
*************** Assume that the source files are targete
*** 289,295 ****
  Java platform.
  .Sp
  \&\fIrelease\fR should be the version number of a Java platform release
! in the format \s-1MAJOR\s0.MINOR, for example \fB1.4\fR.
  .Sp
  This option is currently ignored except that an error is raised if a
  release number other than \fB1.2\fR, \fB1.3\fR or \fB1.4\fR is
--- 286,292 ----
  Java platform.
  .Sp
  \&\fIrelease\fR should be the version number of a Java platform release
! in the format \s-1MAJOR.MINOR,\s0 for example \fB1.4\fR.
  .Sp
  This option is currently ignored except that an error is raised if a
  release number other than \fB1.2\fR, \fB1.3\fR or \fB1.4\fR is
*************** source code commented in a non-latin lan
*** 317,323 ****
  first sentence detector does not work. For all other cases, the
  default (do not use BreakIterator) produces better results at the time
  of this writing.
! .Sh "Interlinking with other Documentation Sets"
  .IX Subsection "Interlinking with other Documentation Sets"
  .IP "\fB\-link\fR \fIurl\fR" 4
  .IX Item "-link url"
--- 314,320 ----
  first sentence detector does not work. For all other cases, the
  default (do not use BreakIterator) produces better results at the time
  of this writing.
! .SS "Interlinking with other Documentation Sets"
  .IX Subsection "Interlinking with other Documentation Sets"
  .IP "\fB\-link\fR \fIurl\fR" 4
  .IX Item "-link url"
*************** you place your mouse pointer over it in
*** 380,386 ****
  Omit package name qualifier from all class names.
  .Sp
  Specify this option to omit package name qualifiers altogether,
! .Sh "Selecting which Information to Generate"
  .IX Subsection "Selecting which Information to Generate"
  .IP "\fB\-public\fR" 4
  .IX Item "-public"
--- 377,383 ----
  Omit package name qualifier from all class names.
  .Sp
  Specify this option to omit package name qualifiers altogether,
! .SS "Selecting which Information to Generate"
  .IX Subsection "Selecting which Information to Generate"
  .IP "\fB\-public\fR" 4
  .IX Item "-public"
*************** directory names.
*** 537,543 ****
  This option only makes sense if \fB\-docfilessubdirs\fR is also
  specified.  In this case, any sub-directory located directly beneath a
  \&\fIdoc-files\fR directory is omitted if listed.
! .Sh "Custom Documentation Tags"
  .IX Subsection "Custom Documentation Tags"
  .IP "\fB\-tagletpath\fR \fIpathlist\fR" 4
  .IX Item "-tagletpath pathlist"
--- 534,540 ----
  This option only makes sense if \fB\-docfilessubdirs\fR is also
  specified.  In this case, any sub-directory located directly beneath a
  \&\fIdoc-files\fR directory is omitted if listed.
! .SS "Custom Documentation Tags"
  .IX Subsection "Custom Documentation Tags"
  .IP "\fB\-tagletpath\fR \fIpathlist\fR" 4
  .IX Item "-tagletpath pathlist"
*************** devoted to the tag in question.
*** 607,613 ****
  .Sp
  For example, to define a tag matching \fB\f(CB@cvsid\fB\fR which is to be
  accepted in overview, package and type pages and which is labelled
! with the header \fB\s-1CVS\s0 \s-1ID\s0\fR, you would specify:
  .Sp
  .Vb 1
  \&        \-tag cvsid:tpo:"CVS ID"
--- 604,610 ----
  .Sp
  For example, to define a tag matching \fB\f(CB@cvsid\fB\fR which is to be
  accepted in overview, package and type pages and which is labelled
! with the header \fB\s-1CVS ID\s0\fR, you would specify:
  .Sp
  .Vb 1
  \&        \-tag cvsid:tpo:"CVS ID"
*************** Then the \s-1HTML\s0 output will contain
*** 626,632 ****
  \&          $Id: cp\-tools.texinfo,v 1.9 2012\-03\-07 15:27:27 gnu_andrew Exp $
  .Ve
  .RE
! .Sh "Running Other Doclets"
  .IX Subsection "Running Other Doclets"
  .IP "\fB\-docletpath\fR \fIpathlist\fR" 4
  .IX Item "-docletpath pathlist"
--- 623,629 ----
  \&          $Id: cp\-tools.texinfo,v 1.9 2012\-03\-07 15:27:27 gnu_andrew Exp $
  .Ve
  .RE
! .SS "Running Other Doclets"
  .IX Subsection "Running Other Doclets"
  .IP "\fB\-docletpath\fR \fIpathlist\fR" 4
  .IX Item "-docletpath pathlist"
*************** feedback when successfully running third
*** 665,671 ****
  This option can be specified multiple times, in which case all doclets
  are executed with the same information tree exposed via the Doclet \s-1API\s0
  for each Doclet run.
! .Sh "Adding Information to the Output"
  .IX Subsection "Adding Information to the Output"
  .IP "\fB\-windowtitle\fR \fItext\fR" 4
  .IX Item "-windowtitle text"
--- 662,668 ----
  This option can be specified multiple times, in which case all doclets
  are executed with the same information tree exposed via the Doclet \s-1API\s0
  for each Doclet run.
! .SS "Adding Information to the Output"
  .IX Subsection "Adding Information to the Output"
  .IP "\fB\-windowtitle\fR \fItext\fR" 4
  .IX Item "-windowtitle text"
*************** This option is currently ignored.
*** 773,779 ****
  .Sp
  When implemented, it will use the \s-1XHTML\s0 fragment in \fIfile\fR for the
  help page contents instead of the default help text.
! .Sh "Controlling the Output."
  .IX Subsection "Controlling the Output."
  .IP "\fB\-d\fR \fIdirectory\fR" 4
  .IX Item "-d directory"
--- 770,776 ----
  .Sp
  When implemented, it will use the \s-1XHTML\s0 fragment in \fIfile\fR for the
  help page contents instead of the default help text.
! .SS "Controlling the Output."
  .IX Subsection "Controlling the Output."
  .IP "\fB\-d\fR \fIdirectory\fR" 4
  .IX Item "-d directory"
*************** Force generation of valid \s-1XHTML\s0 c
*** 833,839 ****
  the traditional Javadoc tool to some extent.
  .Sp
  If this option is specified, anchor names will be mangled so that they
! are valid according to the \s-1XHTML\s0 1.1 specification.  However, a
  documentation set generated with this option cannot be linked to
  properly using the traditional Javadoc tool.  It can be linked to just
  fine using Gjdoc, though.
--- 830,836 ----
  the traditional Javadoc tool to some extent.
  .Sp
  If this option is specified, anchor names will be mangled so that they
! are valid according to the \s-1XHTML 1.1\s0 specification.  However, a
  documentation set generated with this option cannot be linked to
  properly using the traditional Javadoc tool.  It can be linked to just
  fine using Gjdoc, though.
*************** fine using Gjdoc, though.
*** 841,847 ****
  Without this option, anchor names for executable class members use the
  traditional format, for example: \*(L"foo(String,int[])\*(R".  This is
  compatible to the traditional Javadoc tool, but according to both the
! \&\s-1HTML\s0 4.0 and \s-1XHTML\s0 1.0 and 1.1 specifications, this format includes
  illegal characters.  Parentheses, square brackets, and the comma are
  not allowed in anchor names.
  .IP "\fB\-baseurl\fR \fIurl\fR" 4
--- 838,844 ----
  Without this option, anchor names for executable class members use the
  traditional format, for example: \*(L"foo(String,int[])\*(R".  This is
  compatible to the traditional Javadoc tool, but according to both the
! \&\s-1HTML 4.0\s0 and \s-1XHTML 1.0\s0 and 1.1 specifications, this format includes
  illegal characters.  Parentheses, square brackets, and the comma are
  not allowed in anchor names.
  .IP "\fB\-baseurl\fR \fIurl\fR" 4
*************** not allowed in anchor names.
*** 849,860 ****
  Hardwire a page \s-1URL\s0 relative to \fIurl\fR into each generated page.
  .Sp
  If you are generating documentation which will exclusively be
! available at a certain \s-1URL\s0, you should use this option to specify this
! \&\s-1URL\s0.
  .Sp
  This can help avoid certain redirect attacks used by spammers, and it
  can be helpful for certain web clients.
! .Sh "Verbosity Options"
  .IX Subsection "Verbosity Options"
  .IP "\fB\-quiet\fR" 4
  .IX Item "-quiet"
--- 846,857 ----
  Hardwire a page \s-1URL\s0 relative to \fIurl\fR into each generated page.
  .Sp
  If you are generating documentation which will exclusively be
! available at a certain \s-1URL,\s0 you should use this option to specify this
! \&\s-1URL.\s0
  .Sp
  This can help avoid certain redirect attacks used by spammers, and it
  can be helpful for certain web clients.
! .SS "Verbosity Options"
  .IX Subsection "Verbosity Options"
  .IP "\fB\-quiet\fR" 4
  .IX Item "-quiet"
*************** Suppress all output except for warnings
*** 864,870 ****
  Be very verbose about what \fBgjdoc\fR is doing.
  .Sp
  This option is currently ignored.
! .Sh "Virtual Machine Options"
  .IX Subsection "Virtual Machine Options"
  Sun's \fBjavadoc\fR tool seems to be based on \fBjavac\fR and
  as such it seems to operate on the \s-1VM\s0 level.  \fBgjdoc\fR, in
--- 861,867 ----
  Be very verbose about what \fBgjdoc\fR is doing.
  .Sp
  This option is currently ignored.
! .SS "Virtual Machine Options"
  .IX Subsection "Virtual Machine Options"
  Sun's \fBjavadoc\fR tool seems to be based on \fBjavac\fR and
  as such it seems to operate on the \s-1VM\s0 level.  \fBgjdoc\fR, in
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gkeytool.1 gcc-5.5.0/libjava/classpath/doc/gkeytool.1
*** gcc-5.4.0/libjava/classpath/doc/gkeytool.1	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/gkeytool.1	Tue Oct 10 09:52:09 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GKEYTOOL 1"
! .TH GKEYTOOL 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GKEYTOOL 1"
! .TH GKEYTOOL 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
*************** Generate a new self-signed \fITrusted Ce
*** 184,190 ****
  Import a \s-1CA\s0 \fITrusted Certificate\fR.
  .IP "\fB\-identitydb [\fR\fI\s-1OPTION\s0\fR\fB]...\fR" 4
  .IX Item "-identitydb [OPTION]..."
! \&\fB\s-1NOT\s0 \s-1IMPLEMENTED\s0 \s-1YET\s0\fR.Import a \s-1JDK\s0 1.1 style Identity Database.
  .RE
  .RS 4
  .RE
--- 181,187 ----
  Import a \s-1CA\s0 \fITrusted Certificate\fR.
  .IP "\fB\-identitydb [\fR\fI\s-1OPTION\s0\fR\fB]...\fR" 4
  .IX Item "-identitydb [OPTION]..."
! \&\fB\s-1NOT IMPLEMENTED YET\s0\fR.Import a \s-1JDK 1.1\s0 style Identity Database.
  .RE
  .RS 4
  .RE
*************** See \fICommon Options\fR for more detail
*** 432,440 ****
  The \fB\-identitydb\fR command
  .IX Subsection "The -identitydb command"
  .PP
! \&\fB\s-1NOT\s0 \s-1IMPLEMENTED\s0 \s-1YET\s0\fR.
  .PP
! Use this command to import a \s-1JDK\s0 1.1 style Identity Database.
  .IP "\fB\-file\fR \fI\s-1FILE\s0\fR" 4
  .IX Item "-file FILE"
  See \fICommon Options\fR for more details.
--- 429,437 ----
  The \fB\-identitydb\fR command
  .IX Subsection "The -identitydb command"
  .PP
! \&\fB\s-1NOT IMPLEMENTED YET\s0\fR.
  .PP
! Use this command to import a \s-1JDK 1.1\s0 style Identity Database.
  .IP "\fB\-file\fR \fI\s-1FILE\s0\fR" 4
  .IX Item "-file FILE"
  See \fICommon Options\fR for more details.
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gnative2ascii.1 gcc-5.5.0/libjava/classpath/doc/gnative2ascii.1
*** gcc-5.4.0/libjava/classpath/doc/gnative2ascii.1	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/gnative2ascii.1	Tue Oct 10 09:52:10 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GNATIVE2ASCII 1"
! .TH GNATIVE2ASCII 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GNATIVE2ASCII 1"
! .TH GNATIVE2ASCII 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gorbd.1 gcc-5.5.0/libjava/classpath/doc/gorbd.1
*** gcc-5.4.0/libjava/classpath/doc/gorbd.1	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/gorbd.1	Tue Oct 10 09:52:10 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GORBD 1"
! .TH GORBD 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GORBD 1"
! .TH GORBD 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/grmid.1 gcc-5.5.0/libjava/classpath/doc/grmid.1
*** gcc-5.4.0/libjava/classpath/doc/grmid.1	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/grmid.1	Tue Oct 10 09:52:10 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GRMID 1"
! .TH GRMID 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GRMID 1"
! .TH GRMID 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/grmiregistry.1 gcc-5.5.0/libjava/classpath/doc/grmiregistry.1
*** gcc-5.4.0/libjava/classpath/doc/grmiregistry.1	Fri Jun  3 10:42:38 2016
--- gcc-5.5.0/libjava/classpath/doc/grmiregistry.1	Tue Oct 10 09:52:10 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GRMIREGISTRY 1"
! .TH GRMIREGISTRY 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GRMIREGISTRY 1"
! .TH GRMIREGISTRY 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gserialver.1 gcc-5.5.0/libjava/classpath/doc/gserialver.1
*** gcc-5.4.0/libjava/classpath/doc/gserialver.1	Fri Jun  3 10:42:39 2016
--- gcc-5.5.0/libjava/classpath/doc/gserialver.1	Tue Oct 10 09:52:10 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GSERIALVER 1"
! .TH GSERIALVER 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GSERIALVER 1"
! .TH GSERIALVER 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/libjava/classpath/doc/gtnameserv.1 gcc-5.5.0/libjava/classpath/doc/gtnameserv.1
*** gcc-5.4.0/libjava/classpath/doc/gtnameserv.1	Fri Jun  3 10:42:39 2016
--- gcc-5.5.0/libjava/classpath/doc/gtnameserv.1	Tue Oct 10 09:52:10 2017
***************
*** 1,15 ****
! .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
- .de Sh \" Subsection heading
- .br
- .if t .Sp
- .ne 5
- .PP
- \fB\\$1\fR
- .PP
- ..
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
--- 1,7 ----
! .\" Automatically generated by Pod::Man 4.09 (Pod::Simple 3.35)
  .\"
  .\" Standard preamble:
  .\" ========================================================================
  .de Sp \" Vertical space (when we can't use .PP)
  .if t .sp .5v
  .if n .sp
***************
*** 46,71 ****
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is turned on, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .ie \nF \{\
! .    de IX
! .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
! .    nr % 0
! .    rr F
! .\}
! .el \{\
  .    de IX
  ..
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
--- 38,68 ----
  .    ds PI \(*p
  .    ds L" ``
  .    ds R" ''
+ .    ds C`
+ .    ds C'
  'br\}
  .\"
  .\" Escape single quotes in literal strings from groff's Unicode transform.
  .ie \n(.g .ds Aq \(aq
  .el       .ds Aq '
  .\"
! .\" If the F register is >0, we'll generate index entries on stderr for
! .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
  .\" entries marked with X<> in POD.  Of course, you'll have to process the
  .\" output yourself in some meaningful fashion.
! .\"
! .\" Avoid warning from groff about undefined register 'F'.
! .de IX
  ..
! .if !\nF .nr F 0
! .if \nF>0 \{\
  .    de IX
+ .    tm Index:\\$1\t\\n%\t"\\$2"
  ..
+ .    if !\nF==2 \{\
+ .        nr % 0
+ .        nr F 2
+ .    \}
  .\}
  .\"
  .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
***************
*** 132,138 ****
  .\" ========================================================================
  .\"
  .IX Title "GTNAMESERV 1"
! .TH GTNAMESERV 1 "2016-06-03" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
--- 129,135 ----
  .\" ========================================================================
  .\"
  .IX Title "GTNAMESERV 1"
! .TH GTNAMESERV 1 "2017-10-10" "0.99.1-pre" "GNU"
  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
  .\" way too many mistakes in technical documents.
  .if n .ad l
diff -Nrcpad gcc-5.4.0/libjava/include/i386-signal.h gcc-5.5.0/libjava/include/i386-signal.h
*** gcc-5.4.0/libjava/include/i386-signal.h	Tue Dec 20 12:18:26 2011
--- gcc-5.5.0/libjava/include/i386-signal.h	Thu Sep  7 07:22:07 2017
*************** static void _Jv_##_name (int, siginfo_t
*** 29,35 ****
  #define HANDLE_DIVIDE_OVERFLOW						\
  do									\
  {									\
!   struct ucontext *_uc = (struct ucontext *)_p;				\
    gregset_t &_gregs = _uc->uc_mcontext.gregs;				\
    unsigned char *_eip = (unsigned char *)_gregs[REG_EIP];		\
  									\
--- 29,35 ----
  #define HANDLE_DIVIDE_OVERFLOW						\
  do									\
  {									\
!   ucontext_t *_uc = (ucontext_t *)_p;					\
    gregset_t &_gregs = _uc->uc_mcontext.gregs;				\
    unsigned char *_eip = (unsigned char *)_gregs[REG_EIP];		\
  									\
diff -Nrcpad gcc-5.4.0/libjava/include/s390-signal.h gcc-5.5.0/libjava/include/s390-signal.h
*** gcc-5.4.0/libjava/include/s390-signal.h	Mon Jan  3 20:52:22 2011
--- gcc-5.5.0/libjava/include/s390-signal.h	Thu Sep  7 07:22:07 2017
*************** do									\
*** 51,57 ****
    struct                                                                \
    {                                                                     \
      unsigned long int uc_flags;                                         \
!     struct ucontext *uc_link;                                           \
      stack_t uc_stack;                                                   \
      mcontext_t uc_mcontext;                                             \
      unsigned long sigmask[2];                                           \
--- 51,57 ----
    struct                                                                \
    {                                                                     \
      unsigned long int uc_flags;                                         \
!     ucontext_t *uc_link;                                                \
      stack_t uc_stack;                                                   \
      mcontext_t uc_mcontext;                                             \
      unsigned long sigmask[2];                                           \
diff -Nrcpad gcc-5.4.0/libjava/include/x86_64-signal.h gcc-5.5.0/libjava/include/x86_64-signal.h
*** gcc-5.4.0/libjava/include/x86_64-signal.h	Fri Jan  4 12:49:55 2013
--- gcc-5.5.0/libjava/include/x86_64-signal.h	Thu Sep  7 07:22:07 2017
*************** static void _Jv_##_name (int, siginfo_t
*** 28,34 ****
  #define HANDLE_DIVIDE_OVERFLOW						\
  do									\
  {									\
!   struct ucontext *_uc = (struct ucontext *)_p;				\
    gregset_t &_gregs = _uc->uc_mcontext.gregs;				\
    unsigned char *_rip = (unsigned char *)_gregs[REG_RIP];		\
  									\
--- 28,34 ----
  #define HANDLE_DIVIDE_OVERFLOW						\
  do									\
  {									\
!   ucontext_t *_uc = (ucontext_t *)_p;					\
    gregset_t &_gregs = _uc->uc_mcontext.gregs;				\
    unsigned char *_rip = (unsigned char *)_gregs[REG_RIP];		\
  									\
diff -Nrcpad gcc-5.4.0/libjava/libltdl/ChangeLog gcc-5.5.0/libjava/libltdl/ChangeLog
*** gcc-5.4.0/libjava/libltdl/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libjava/libltdl/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libmpx/ChangeLog gcc-5.5.0/libmpx/ChangeLog
*** gcc-5.4.0/libmpx/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libmpx/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libobjc/ChangeLog gcc-5.5.0/libobjc/ChangeLog
*** gcc-5.4.0/libobjc/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libobjc/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/liboffloadmic/ChangeLog gcc-5.5.0/liboffloadmic/ChangeLog
*** gcc-5.4.0/liboffloadmic/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/liboffloadmic/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libquadmath/ChangeLog gcc-5.5.0/libquadmath/ChangeLog
*** gcc-5.4.0/libquadmath/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libquadmath/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,12 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-09-16  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR libquadmath/65757
+ 	* math/roundq.c: Cherry-pick upstream glibc 2015-04-28 change.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libquadmath/libquadmath.info gcc-5.5.0/libquadmath/libquadmath.info
*** gcc-5.4.0/libquadmath/libquadmath.info	Fri Jun  3 10:38:03 2016
--- gcc-5.5.0/libquadmath/libquadmath.info	Tue Oct 10 09:46:25 2017
***************
*** 1,5 ****
! This is libquadmath.info, produced by makeinfo version 4.12 from
! /space/rguenther/gcc-5.4.0/gcc-5.4.0/libquadmath/libquadmath.texi.
  
  Copyright (C) 2010-2015 Free Software Foundation, Inc.
  
--- 1,5 ----
! This is libquadmath.info, produced by makeinfo version 6.1 from
! libquadmath.texi.
  
  Copyright (C) 2010-2015 Free Software Foundation, Inc.
  
*************** Copyright (C) 2010-2015 Free Software Fo
*** 11,19 ****
       below.  A copy of the license is included in the section entitled
       "GNU Free Documentation License."
  
!      (a) The FSF's Back-Cover Text is: "You have the freedom to copy
!      and modify this GNU manual.
! 
  INFO-DIR-SECTION GNU Libraries
  START-INFO-DIR-ENTRY
  * libquadmath: (libquadmath).                  GCC Quad-Precision Math Library
--- 11,18 ----
       below.  A copy of the license is included in the section entitled
       "GNU Free Documentation License."
  
!      (a) The FSF's Back-Cover Text is: "You have the freedom to copy and
!      modify this GNU manual.
  INFO-DIR-SECTION GNU Libraries
  START-INFO-DIR-ENTRY
  * libquadmath: (libquadmath).                  GCC Quad-Precision Math Library
*************** Floor Boston, MA 02110-1301 USA
*** 34,41 ****
       below.  A copy of the license is included in the section entitled
       "GNU Free Documentation License."
  
!      (a) The FSF's Back-Cover Text is: "You have the freedom to copy
!      and modify this GNU manual.
  
  
  File: libquadmath.info,  Node: Top,  Next: Typedef and constants,  Up: (dir)
--- 33,40 ----
       below.  A copy of the license is included in the section entitled
       "GNU Free Documentation License."
  
!      (a) The FSF's Back-Cover Text is: "You have the freedom to copy and
!      modify this GNU manual.
  
  
  File: libquadmath.info,  Node: Top,  Next: Typedef and constants,  Up: (dir)
*************** File: libquadmath.info,  Node: Typedef a
*** 63,124 ****
  1 Typedef and constants
  ***********************
  
! The following data type has been defined via `typedef'.
  
! `__complex128': `__float128'-based complex number
  
     The following macros are defined, which give the numeric limits of
! the `__float128' data type.
! 
! `FLT128_MAX': largest finite number
! 
! `FLT128_MIN': smallest positive number with full precision
  
! `FLT128_EPSILON': difference between 1 and the next larger
       representable number
  
! `FLT128_DENORM_MIN': smallest positive denormalized number
! 
! `FLT128_MANT_DIG': number of digits in the mantissa (bit precision)
! 
! `FLT128_MIN_EXP': maximal negative exponent
! 
! `FLT128_MAX_EXP': maximal positive exponent
! 
! `FLT128_DIG': number of decimal digits in the mantissa
! 
! `FLT128_MIN_10_EXP': maximal negative decimal exponent
! 
! `FLT128_MAX_10_EXP': maximal positive decimal exponent
! 
!    The following mathematical constants of type `__float128' are
  defined.
  
! `M_Eq': the constant e (Euler's number)
! 
! `M_LOG2Eq': binary logarithm of 2
! 
! `M_LOG10Eq': common, decimal logarithm of 2
! 
! `M_LN2q': natural logarithm of 2
! 
! `M_LN10q': natural logarithm of 10
! 
! `M_PIq': pi
! 
! `M_PI_2q': pi divided by two
! 
! `M_PI_4q': pi divided by four
! 
! `M_1_PIq': one over pi
! 
! `M_2_PIq': one over two pi
! 
! `M_2_SQRTPIq': two over square root of pi
! 
! `M_SQRT2q': square root of 2
! 
! `M_SQRT1_2q': one over square root of 2
  
  
  File: libquadmath.info,  Node: Math Library Routines,  Next: I/O Library Routines,  Prev: Typedef and constants,  Up: Top
--- 62,102 ----
  1 Typedef and constants
  ***********************
  
! The following data type has been defined via 'typedef'.
  
! '__complex128': '__float128'-based complex number
  
     The following macros are defined, which give the numeric limits of
! the '__float128' data type.
  
! 'FLT128_MAX': largest finite number
! 'FLT128_MIN': smallest positive number with full precision
! 'FLT128_EPSILON': difference between 1 and the next larger
       representable number
+ 'FLT128_DENORM_MIN': smallest positive denormalized number
+ 'FLT128_MANT_DIG': number of digits in the mantissa (bit precision)
+ 'FLT128_MIN_EXP': maximal negative exponent
+ 'FLT128_MAX_EXP': maximal positive exponent
+ 'FLT128_DIG': number of decimal digits in the mantissa
+ 'FLT128_MIN_10_EXP': maximal negative decimal exponent
+ 'FLT128_MAX_10_EXP': maximal positive decimal exponent
  
!    The following mathematical constants of type '__float128' are
  defined.
  
! 'M_Eq': the constant e (Euler's number)
! 'M_LOG2Eq': binary logarithm of 2
! 'M_LOG10Eq': common, decimal logarithm of 2
! 'M_LN2q': natural logarithm of 2
! 'M_LN10q': natural logarithm of 10
! 'M_PIq': pi
! 'M_PI_2q': pi divided by two
! 'M_PI_4q': pi divided by four
! 'M_1_PIq': one over pi
! 'M_2_PIq': one over two pi
! 'M_2_SQRTPIq': two over square root of pi
! 'M_SQRT2q': square root of 2
! 'M_SQRT1_2q': one over square root of 2
  
  
  File: libquadmath.info,  Node: Math Library Routines,  Next: I/O Library Routines,  Prev: Typedef and constants,  Up: Top
*************** File: libquadmath.info,  Node: Math Libr
*** 128,311 ****
  
  The following mathematical functions are available:
  
! `acosq': arc cosine function
! 
! `acoshq': inverse hyperbolic cosine function
! 
! `asinq': arc sine function
! 
! `asinhq': inverse hyperbolic sine function
! 
! `atanq': arc tangent function
! 
! `atanhq': inverse hyperbolic tangent function
! 
! `atan2q': arc tangent function
! 
! `cbrtq': cube root function
! 
! `ceilq': ceiling value function
! 
! `copysignq': copy sign of a number
! 
! `coshq': hyperbolic cosine function
! 
! `cosq': cosine function
! 
! `erfq': error function
! 
! `erfcq': complementary error function
! 
! `expq': exponential function
! 
! `expm1q': exponential minus 1 function
! 
! `fabsq': absolute value function
! 
! `fdimq': positive difference function
! 
! `finiteq': check finiteness of value
! 
! `floorq': floor value function
! 
! `fmaq': fused multiply and add
! 
! `fmaxq': determine maximum of two values
! 
! `fminq': determine minimum of two values
! 
! `fmodq': remainder value function
! 
! `frexpq': extract mantissa and exponent
! 
! `hypotq': Eucledian distance function
! 
! `ilogbq': get exponent of the value
! 
! `isinfq': check for infinity
! 
! `isnanq': check for not a number
! 
! `j0q': Bessel function of the first kind, first order
! 
! `j1q': Bessel function of the first kind, second order
! 
! `jnq': Bessel function of the first kind, N-th order
! 
! `ldexpq': load exponent of the value
! 
! `lgammaq': logarithmic gamma function
! 
! `llrintq': round to nearest integer value
! 
! `llroundq': round to nearest integer value away from zero
! 
! `logq': natural logarithm function
! 
! `log10q': base 10 logarithm function
! 
! `log1pq': compute natural logarithm of the value plus one
! 
! `log2q': base 2 logarithm function
! 
! `lrintq': round to nearest integer value
! 
! `lroundq': round to nearest integer value away from zero
! 
! `modfq': decompose the floating-point number
! 
! `nanq': return quiet NaN
! 
! `nearbyintq': round to nearest integer
! 
! `nextafterq': next representable floating-point number
! 
! `powq': power function
! 
! `remainderq': remainder function
! 
! `remquoq': remainder and part of quotient
! 
! `rintq': round-to-nearest integral value
! 
! `roundq': round-to-nearest integral value, return `__float128'
! 
! `scalblnq': compute exponent using `FLT_RADIX'
! 
! `scalbnq': compute exponent using `FLT_RADIX'
! 
! `signbitq': return sign bit
! 
! `sincosq': calculate sine and cosine simultaneously
! 
! `sinhq': hyperbolic sine function
! 
! `sinq': sine function
! 
! `sqrtq': square root function
! 
! `tanq': tangent function
! 
! `tanhq': hyperbolic tangent function
! 
! `tgammaq': true gamma function
! 
! `truncq': round to integer, towards zero
! 
! `y0q': Bessel function of the second kind, first order
! 
! `y1q': Bessel function of the second kind, second order
! 
! `ynq': Bessel function of the second kind, N-th order
! 
! `cabsq' complex absolute value function
! 
! `cargq': calculate the argument
! 
! `cimagq' imaginary part of complex number
! 
! `crealq': real part of complex number
! 
! `cacoshq': complex arc hyperbolic cosine function
! 
! `cacosq': complex arc cosine function
! 
! `casinhq': complex arc hyperbolic sine function
! 
! `casinq': complex arc sine function
! 
! `catanhq': complex arc hyperbolic tangent function
! 
! `catanq': complex arc tangent function
! 
! `ccosq' complex cosine function:
! 
! `ccoshq': complex hyperbolic cosine function
! 
! `cexpq': complex exponential function
! 
! `cexpiq': computes the exponential function of "i" times a
       real value
! 
! `clogq': complex natural logarithm
! 
! `clog10q': complex base 10 logarithm
! 
! `conjq': complex conjugate function
! 
! `cpowq': complex power function
! 
! `cprojq': project into Riemann Sphere
! 
! `csinq': complex sine function
! 
! `csinhq': complex hyperbolic sine function
! 
! `csqrtq': complex square root
! 
! `ctanq': complex tangent function
! 
! `ctanhq': complex hyperbolic tangent function
  
  
  File: libquadmath.info,  Node: I/O Library Routines,  Next: GNU Free Documentation License,  Prev: Math Library Routines,  Up: Top
--- 106,201 ----
  
  The following mathematical functions are available:
  
! 'acosq': arc cosine function
! 'acoshq': inverse hyperbolic cosine function
! 'asinq': arc sine function
! 'asinhq': inverse hyperbolic sine function
! 'atanq': arc tangent function
! 'atanhq': inverse hyperbolic tangent function
! 'atan2q': arc tangent function
! 'cbrtq': cube root function
! 'ceilq': ceiling value function
! 'copysignq': copy sign of a number
! 'coshq': hyperbolic cosine function
! 'cosq': cosine function
! 'erfq': error function
! 'erfcq': complementary error function
! 'expq': exponential function
! 'expm1q': exponential minus 1 function
! 'fabsq': absolute value function
! 'fdimq': positive difference function
! 'finiteq': check finiteness of value
! 'floorq': floor value function
! 'fmaq': fused multiply and add
! 'fmaxq': determine maximum of two values
! 'fminq': determine minimum of two values
! 'fmodq': remainder value function
! 'frexpq': extract mantissa and exponent
! 'hypotq': Eucledian distance function
! 'ilogbq': get exponent of the value
! 'isinfq': check for infinity
! 'isnanq': check for not a number
! 'j0q': Bessel function of the first kind, first order
! 'j1q': Bessel function of the first kind, second order
! 'jnq': Bessel function of the first kind, N-th order
! 'ldexpq': load exponent of the value
! 'lgammaq': logarithmic gamma function
! 'llrintq': round to nearest integer value
! 'llroundq': round to nearest integer value away from zero
! 'logq': natural logarithm function
! 'log10q': base 10 logarithm function
! 'log1pq': compute natural logarithm of the value plus one
! 'log2q': base 2 logarithm function
! 'lrintq': round to nearest integer value
! 'lroundq': round to nearest integer value away from zero
! 'modfq': decompose the floating-point number
! 'nanq': return quiet NaN
! 'nearbyintq': round to nearest integer
! 'nextafterq': next representable floating-point number
! 'powq': power function
! 'remainderq': remainder function
! 'remquoq': remainder and part of quotient
! 'rintq': round-to-nearest integral value
! 'roundq': round-to-nearest integral value, return '__float128'
! 'scalblnq': compute exponent using 'FLT_RADIX'
! 'scalbnq': compute exponent using 'FLT_RADIX'
! 'signbitq': return sign bit
! 'sincosq': calculate sine and cosine simultaneously
! 'sinhq': hyperbolic sine function
! 'sinq': sine function
! 'sqrtq': square root function
! 'tanq': tangent function
! 'tanhq': hyperbolic tangent function
! 'tgammaq': true gamma function
! 'truncq': round to integer, towards zero
! 'y0q': Bessel function of the second kind, first order
! 'y1q': Bessel function of the second kind, second order
! 'ynq': Bessel function of the second kind, N-th order
! 'cabsq' complex absolute value function
! 'cargq': calculate the argument
! 'cimagq' imaginary part of complex number
! 'crealq': real part of complex number
! 'cacoshq': complex arc hyperbolic cosine function
! 'cacosq': complex arc cosine function
! 'casinhq': complex arc hyperbolic sine function
! 'casinq': complex arc sine function
! 'catanhq': complex arc hyperbolic tangent function
! 'catanq': complex arc tangent function
! 'ccosq' complex cosine function:
! 'ccoshq': complex hyperbolic cosine function
! 'cexpq': complex exponential function
! 'cexpiq': computes the exponential function of "i" times a
       real value
! 'clogq': complex natural logarithm
! 'clog10q': complex base 10 logarithm
! 'conjq': complex conjugate function
! 'cpowq': complex power function
! 'cprojq': project into Riemann Sphere
! 'csinq': complex sine function
! 'csinhq': complex hyperbolic sine function
! 'csqrtq': complex square root
! 'ctanq': complex tangent function
! 'ctanhq': complex hyperbolic tangent function
  
  
  File: libquadmath.info,  Node: I/O Library Routines,  Next: GNU Free Documentation License,  Prev: Math Library Routines,  Up: Top
*************** File: libquadmath.info,  Node: I/O Libra
*** 315,339 ****
  
  * Menu:
  
! * `strtoflt128':          strtoflt128,          Convert from string
! * `quadmath_snprintf':    quadmath_snprintf,    Convert to string
  
  
  File: libquadmath.info,  Node: strtoflt128,  Next: quadmath_snprintf,  Up: I/O Library Routines
  
! 3.1 `strtoflt128' -- Convert from string
  ========================================
  
! The function `strtoflt128' converts a string into a `__float128' number.
  
  Syntax
!      `__float128 strtoflt128 (const char *s, char **sp)'
  
  _Arguments_:
!      S          input string
!      SP         the address of the next character in the string
  
!      The argument SP contains, if not `NULL', the address of the next
       character following the parts of the string, which have been read.
  
  Example
--- 205,229 ----
  
  * Menu:
  
! * 'strtoflt128':          strtoflt128,          Convert from string
! * 'quadmath_snprintf':    quadmath_snprintf,    Convert to string
  
  
  File: libquadmath.info,  Node: strtoflt128,  Next: quadmath_snprintf,  Up: I/O Library Routines
  
! 3.1 'strtoflt128' -- Convert from string
  ========================================
  
! The function 'strtoflt128' converts a string into a '__float128' number.
  
  Syntax
!      '__float128 strtoflt128 (const char *s, char **sp)'
  
  _Arguments_:
!      S           input string
!      SP          the address of the next character in the string
  
!      The argument SP contains, if not 'NULL', the address of the next
       character following the parts of the string, which have been read.
  
  Example
*************** Example
*** 351,379 ****
  
  File: libquadmath.info,  Node: quadmath_snprintf,  Prev: strtoflt128,  Up: I/O Library Routines
  
! 3.2 `quadmath_snprintf' -- Convert to string
  ============================================
  
! The function `quadmath_snprintf' converts a `__float128' floating-point
! number into a string.  It is a specialized alternative to `snprintf',
  where the format string is restricted to a single conversion specifier
! with `Q' modifier and conversion specifier `e', `E', `f', `F', `g',
! `G', `a' or `A', with no extra characters before or after the
! conversion specifier.  The `%m$' or `*m$' style must not be used in the
! format.
  
  Syntax
!      `int quadmath_snprintf (char *s, size_t size, const char *format,
       ...)'
  
  _Arguments_:
!      S          output string
!      SIZE       byte size of the string, including tailing NUL
!      FORMAT     conversion specifier string
  
  Note
       On some targets when supported by the C library hooks are installed
!      for `printf' family of functions, so that `printf ("%Qe", 1.2Q);'
       etc. works too.
  
  Example
--- 241,268 ----
  
  File: libquadmath.info,  Node: quadmath_snprintf,  Prev: strtoflt128,  Up: I/O Library Routines
  
! 3.2 'quadmath_snprintf' -- Convert to string
  ============================================
  
! The function 'quadmath_snprintf' converts a '__float128' floating-point
! number into a string.  It is a specialized alternative to 'snprintf',
  where the format string is restricted to a single conversion specifier
! with 'Q' modifier and conversion specifier 'e', 'E', 'f', 'F', 'g', 'G',
! 'a' or 'A', with no extra characters before or after the conversion
! specifier.  The '%m$' or '*m$' style must not be used in the format.
  
  Syntax
!      'int quadmath_snprintf (char *s, size_t size, const char *format,
       ...)'
  
  _Arguments_:
!      S           output string
!      SIZE        byte size of the string, including tailing NUL
!      FORMAT      conversion specifier string
  
  Note
       On some targets when supported by the C library hooks are installed
!      for 'printf' family of functions, so that 'printf ("%Qe", 1.2Q);'
       etc. works too.
  
  Example
*************** Example
*** 413,419 ****
              return 0;
            }
  
- 
  
  File: libquadmath.info,  Node: GNU Free Documentation License,  Next: Reporting Bugs,  Prev: I/O Library Routines,  Up: Top
  
--- 302,307 ----
*************** GNU Free Documentation License
*** 423,429 ****
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      `http://fsf.org/'
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
--- 311,317 ----
                       Version 1.3, 3 November 2008
  
       Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
!      <http://fsf.org/>
  
       Everyone is permitted to copy and distribute verbatim copies
       of this license document, but changing it is not allowed.
*************** GNU Free Documentation License
*** 448,468 ****
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.
!      We recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it
!      can be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You
!      accept the license if you copy, modify or distribute the work in a
!      way requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
--- 336,356 ----
       free program should come with manuals providing the same freedoms
       that the software does.  But this License is not limited to
       software manuals; it can be used for any textual work, regardless
!      of subject matter or whether it is published as a printed book.  We
!      recommend this License principally for works whose purpose is
       instruction or reference.
  
    1. APPLICABILITY AND DEFINITIONS
  
       This License applies to any manual or other work, in any medium,
!      that contains a notice placed by the copyright holder saying it can
!      be distributed under the terms of this License.  Such a notice
       grants a world-wide, royalty-free license, unlimited in duration,
       to use that work under the conditions stated herein.  The
       "Document", below, refers to any such manual or work.  Any member
!      of the public is a licensee, and is addressed as "you".  You accept
!      the license if you copy, modify or distribute the work in a way
!      requiring permission under copyright law.
  
       A "Modified Version" of the Document means any work containing the
       Document or a portion of it, either copied verbatim, or with
*************** GNU Free Documentation License
*** 480,491 ****
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in
!      the notice that says that the Document is released under this
!      License.  If a section does not fit the above definition of
!      Secondary then it is not allowed to be designated as Invariant.
!      The Document may contain zero Invariant Sections.  If the Document
!      does not identify any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
--- 368,379 ----
       regarding them.
  
       The "Invariant Sections" are certain Secondary Sections whose
!      titles are designated, as being those of Invariant Sections, in the
!      notice that says that the Document is released under this License.
!      If a section does not fit the above definition of Secondary then it
!      is not allowed to be designated as Invariant.  The Document may
!      contain zero Invariant Sections.  If the Document does not identify
!      any Invariant Sections then there are none.
  
       The "Cover Texts" are certain short passages of text that are
       listed, as Front-Cover Texts or Back-Cover Texts, in the notice
*************** GNU Free Documentation License
*** 496,522 ****
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images
!      composed of pixels) generic paint programs or (for drawings) some
!      widely available drawing editor, and that is suitable for input to
!      text formatters or for automatic translation to a variety of
!      formats suitable for input to text formatters.  A copy made in an
!      otherwise Transparent file format whose markup, or absence of
!      markup, has been arranged to thwart or discourage subsequent
!      modification by readers is not Transparent.  An image format is
!      not Transparent if used for any substantial amount of text.  A
!      copy that is not "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and
!      standard-conforming simple HTML, PostScript or PDF designed for
!      human modification.  Examples of transparent image formats include
!      PNG, XCF and JPG.  Opaque formats include proprietary formats that
!      can be read and edited only by proprietary word processors, SGML or
!      XML for which the DTD and/or processing tools are not generally
!      available, and the machine-generated HTML, PostScript or PDF
!      produced by some word processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
--- 384,410 ----
       A "Transparent" copy of the Document means a machine-readable copy,
       represented in a format whose specification is available to the
       general public, that is suitable for revising the document
!      straightforwardly with generic text editors or (for images composed
!      of pixels) generic paint programs or (for drawings) some widely
!      available drawing editor, and that is suitable for input to text
!      formatters or for automatic translation to a variety of formats
!      suitable for input to text formatters.  A copy made in an otherwise
!      Transparent file format whose markup, or absence of markup, has
!      been arranged to thwart or discourage subsequent modification by
!      readers is not Transparent.  An image format is not Transparent if
!      used for any substantial amount of text.  A copy that is not
!      "Transparent" is called "Opaque".
  
       Examples of suitable formats for Transparent copies include plain
       ASCII without markup, Texinfo input format, LaTeX input format,
!      SGML or XML using a publicly available DTD, and standard-conforming
!      simple HTML, PostScript or PDF designed for human modification.
!      Examples of transparent image formats include PNG, XCF and JPG.
!      Opaque formats include proprietary formats that can be read and
!      edited only by proprietary word processors, SGML or XML for which
!      the DTD and/or processing tools are not generally available, and
!      the machine-generated HTML, PostScript or PDF produced by some word
!      processors for output purposes only.
  
       The "Title Page" means, for a printed book, the title page itself,
       plus such following pages as are needed to hold, legibly, the
*************** GNU Free Documentation License
*** 554,561 ****
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow
!      the conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
--- 442,449 ----
       may not use technical measures to obstruct or control the reading
       or further copying of the copies you make or distribute.  However,
       you may accept compensation in exchange for copies.  If you
!      distribute a large enough number of copies you must also follow the
!      conditions in section 3.
  
       You may also lend copies, under the same conditions stated above,
       and you may publicly display copies.
*************** GNU Free Documentation License
*** 569,580 ****
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the
!      title equally prominent and visible.  You may add other material
!      on the covers in addition.  Copying with changes limited to the
!      covers, as long as they preserve the title of the Document and
!      satisfy these conditions, can be treated as verbatim copying in
!      other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
--- 457,467 ----
       these Cover Texts: Front-Cover Texts on the front cover, and
       Back-Cover Texts on the back cover.  Both covers must also clearly
       and legibly identify you as the publisher of these copies.  The
!      front cover must present the full title with all words of the title
!      equally prominent and visible.  You may add other material on the
!      covers in addition.  Copying with changes limited to the covers, as
!      long as they preserve the title of the Document and satisfy these
!      conditions, can be treated as verbatim copying in other respects.
  
       If the required texts for either cover are too voluminous to fit
       legibly, you should put the first ones listed (as many as fit
*************** GNU Free Documentation License
*** 582,621 ****
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a
!      machine-readable Transparent copy along with each Opaque copy, or
!      state in or with each Opaque copy a computer-network location from
!      which the general network-using public has access to download
!      using public-standard network protocols a complete Transparent
!      copy of the Document, free of added material.  If you use the
!      latter option, you must take reasonably prudent steps, when you
!      begin distribution of Opaque copies in quantity, to ensure that
!      this Transparent copy will remain thus accessible at the stated
!      location until at least one year after the last time you
!      distribute an Opaque copy (directly or through your agents or
!      retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of
!      copies, to give them a chance to provide you with an updated
!      version of the Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with
!      the Modified Version filling the role of the Document, thus
!      licensing distribution and modification of the Modified Version to
!      whoever possesses a copy of it.  In addition, you must do these
!      things in the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of
!           previous versions (which should, if there were any, be listed
!           in the History section of the Document).  You may use the
!           same title as a previous version if the original publisher of
!           that version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
--- 469,507 ----
       adjacent pages.
  
       If you publish or distribute Opaque copies of the Document
!      numbering more than 100, you must either include a machine-readable
!      Transparent copy along with each Opaque copy, or state in or with
!      each Opaque copy a computer-network location from which the general
!      network-using public has access to download using public-standard
!      network protocols a complete Transparent copy of the Document, free
!      of added material.  If you use the latter option, you must take
!      reasonably prudent steps, when you begin distribution of Opaque
!      copies in quantity, to ensure that this Transparent copy will
!      remain thus accessible at the stated location until at least one
!      year after the last time you distribute an Opaque copy (directly or
!      through your agents or retailers) of that edition to the public.
  
       It is requested, but not required, that you contact the authors of
!      the Document well before redistributing any large number of copies,
!      to give them a chance to provide you with an updated version of the
!      Document.
  
    4. MODIFICATIONS
  
       You may copy and distribute a Modified Version of the Document
       under the conditions of sections 2 and 3 above, provided that you
!      release the Modified Version under precisely this License, with the
!      Modified Version filling the role of the Document, thus licensing
!      distribution and modification of the Modified Version to whoever
!      possesses a copy of it.  In addition, you must do these things in
!      the Modified Version:
  
         A. Use in the Title Page (and on the covers, if any) a title
!           distinct from that of the Document, and from those of previous
!           versions (which should, if there were any, be listed in the
!           History section of the Document).  You may use the same title
!           as a previous version if the original publisher of that
!           version gives permission.
  
         B. List on the Title Page, as authors, one or more persons or
            entities responsible for authorship of the modifications in
*************** GNU Free Documentation License
*** 645,675 ****
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on
!           the Title Page.  If there is no section Entitled "History" in
!           the Document, create one stating the title, year, authors,
!           and publisher of the Document as given on its Title Page,
!           then add an item describing the Modified Version as stated in
!           the previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in
!           the "History" section.  You may omit a network location for a
!           work that was published at least four years before the
!           Document itself, or if the original publisher of the version
!           it refers to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the
!           section all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document,
!           unaltered in their text and in their titles.  Section numbers
!           or the equivalent are not considered part of the section
!           titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
--- 531,560 ----
  
         I. Preserve the section Entitled "History", Preserve its Title,
            and add to it an item stating at least the title, year, new
!           authors, and publisher of the Modified Version as given on the
!           Title Page.  If there is no section Entitled "History" in the
!           Document, create one stating the title, year, authors, and
!           publisher of the Document as given on its Title Page, then add
!           an item describing the Modified Version as stated in the
!           previous sentence.
  
         J. Preserve the network location, if any, given in the Document
            for public access to a Transparent copy of the Document, and
            likewise the network locations given in the Document for
!           previous versions it was based on.  These may be placed in the
!           "History" section.  You may omit a network location for a work
!           that was published at least four years before the Document
!           itself, or if the original publisher of the version it refers
!           to gives permission.
  
         K. For any section Entitled "Acknowledgements" or "Dedications",
!           Preserve the Title of the section, and preserve in the section
!           all the substance and tone of each of the contributor
            acknowledgements and/or dedications given therein.
  
!        L. Preserve all the Invariant Sections of the Document, unaltered
!           in their text and in their titles.  Section numbers or the
!           equivalent are not considered part of the section titles.
  
         M. Delete any section Entitled "Endorsements".  Such a section
            may not be included in the Modified Version.
*************** GNU Free Documentation License
*** 682,692 ****
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option
!      designate some or all of these sections as invariant.  To do this,
!      add their titles to the list of Invariant Sections in the Modified
!      Version's license notice.  These titles must be distinct from any
!      other section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
--- 567,577 ----
  
       If the Modified Version includes new front-matter sections or
       appendices that qualify as Secondary Sections and contain no
!      material copied from the Document, you may at your option designate
!      some or all of these sections as invariant.  To do this, add their
!      titles to the list of Invariant Sections in the Modified Version's
!      license notice.  These titles must be distinct from any other
!      section titles.
  
       You may add a section Entitled "Endorsements", provided it contains
       nothing but endorsements of your Modified Version by various
*************** GNU Free Documentation License
*** 695,709 ****
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end
!      of the list of Cover Texts in the Modified Version.  Only one
!      passage of Front-Cover Text and one of Back-Cover Text may be
!      added by (or through arrangements made by) any one entity.  If the
!      Document already includes a cover text for the same cover,
!      previously added by you or by arrangement made by the same entity
!      you are acting on behalf of, you may not add another; but you may
!      replace the old one, on explicit permission from the previous
!      publisher that added the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
--- 580,594 ----
       definition of a standard.
  
       You may add a passage of up to five words as a Front-Cover Text,
!      and a passage of up to 25 words as a Back-Cover Text, to the end of
!      the list of Cover Texts in the Modified Version.  Only one passage
!      of Front-Cover Text and one of Back-Cover Text may be added by (or
!      through arrangements made by) any one entity.  If the Document
!      already includes a cover text for the same cover, previously added
!      by you or by arrangement made by the same entity you are acting on
!      behalf of, you may not add another; but you may replace the old
!      one, on explicit permission from the previous publisher that added
!      the old one.
  
       The author(s) and publisher(s) of the Document do not by this
       License give permission to use their names for publicity for or to
*************** GNU Free Documentation License
*** 713,720 ****
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination
!      all of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
--- 598,605 ----
  
       You may combine the Document with other documents released under
       this License, under the terms defined in section 4 above for
!      modified versions, provided that you include in the combination all
!      of the Invariant Sections of all of the original documents,
       unmodified, and list them all as Invariant Sections of your
       combined work in its license notice, and that you preserve all
       their Warranty Disclaimers.
*************** GNU Free Documentation License
*** 741,760 ****
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the
!      documents in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow
!      this License in all other respects regarding verbatim copying of
!      that document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of
!      a storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
--- 626,645 ----
       documents released under this License, and replace the individual
       copies of this License in the various documents with a single copy
       that is included in the collection, provided that you follow the
!      rules of this License for verbatim copying of each of the documents
!      in all other respects.
  
       You may extract a single document from such a collection, and
       distribute it individually under this License, provided you insert
!      a copy of this License into the extracted document, and follow this
!      License in all other respects regarding verbatim copying of that
!      document.
  
    7. AGGREGATION WITH INDEPENDENT WORKS
  
       A compilation of the Document or its derivatives with other
!      separate and independent documents or works, in or on a volume of a
!      storage or distribution medium, is called an "aggregate" if the
       copyright resulting from the compilation is not used to limit the
       legal rights of the compilation's users beyond what the individual
       works permit.  When the Document is included in an aggregate, this
*************** GNU Free Documentation License
*** 799,806 ****
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly
!      and finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
--- 684,691 ----
  
       However, if you cease all violation of this License, then your
       license from a particular copyright holder is reinstated (a)
!      provisionally, unless and until the copyright holder explicitly and
!      finally terminates your license, and (b) permanently, if the
       copyright holder fails to notify you of the violation by some
       reasonable means prior to 60 days after the cessation.
  
*************** GNU Free Documentation License
*** 812,844 ****
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from
!      you under this License.  If your rights have been terminated and
!      not permanently reinstated, receipt of a copy of some or all of
!      the same material does not give you any rights to use it.
  
!  10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      `http://www.gnu.org/copyleft/'.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If
!      the Document does not specify a version number of this License,
!      you may choose any version ever published (not as a draft) by the
!      Free Software Foundation.  If the Document specifies that a proxy
!      can decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!  11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
--- 697,729 ----
       after your receipt of the notice.
  
       Termination of your rights under this section does not terminate
!      the licenses of parties who have received copies or rights from you
!      under this License.  If your rights have been terminated and not
!      permanently reinstated, receipt of a copy of some or all of the
!      same material does not give you any rights to use it.
  
!   10. FUTURE REVISIONS OF THIS LICENSE
  
       The Free Software Foundation may publish new, revised versions of
       the GNU Free Documentation License from time to time.  Such new
       versions will be similar in spirit to the present version, but may
       differ in detail to address new problems or concerns.  See
!      <http://www.gnu.org/copyleft/>.
  
       Each version of the License is given a distinguishing version
       number.  If the Document specifies that a particular numbered
       version of this License "or any later version" applies to it, you
       have the option of following the terms and conditions either of
       that specified version or of any later version that has been
!      published (not as a draft) by the Free Software Foundation.  If the
!      Document does not specify a version number of this License, you may
!      choose any version ever published (not as a draft) by the Free
!      Software Foundation.  If the Document specifies that a proxy can
!      decide which future versions of this License can be used, that
       proxy's public statement of acceptance of a version permanently
       authorizes you to choose that version for the Document.
  
!   11. RELICENSING
  
       "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
       World Wide Web server that publishes copyrightable works and also
*************** GNU Free Documentation License
*** 868,874 ****
       site under CC-BY-SA on the same site at any time before August 1,
       2009, provided the MMC is eligible for relicensing.
  
- 
  ADDENDUM: How to use this License for your documents
  ====================================================
  
--- 753,758 ----
*************** notices just after the title page:
*** 885,891 ****
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts." line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
--- 769,775 ----
         Free Documentation License''.
  
     If you have Invariant Sections, Front-Cover Texts and Back-Cover
! Texts, replace the "with...Texts."  line with this:
  
           with the Invariant Sections being LIST THEIR TITLES, with
           the Front-Cover Texts being LIST, and with the Back-Cover Texts
*************** combination of the three, merge those tw
*** 896,904 ****
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of
! free software license, such as the GNU General Public License, to
! permit their use in free software.
  
  
  File: libquadmath.info,  Node: Reporting Bugs,  Prev: GNU Free Documentation License,  Up: Top
--- 780,788 ----
  situation.
  
     If your document contains nontrivial examples of program code, we
! recommend releasing these examples in parallel under your choice of free
! software license, such as the GNU General Public License, to permit
! their use in free software.
  
  
  File: libquadmath.info,  Node: Reporting Bugs,  Prev: GNU Free Documentation License,  Up: Top
*************** File: libquadmath.info,  Node: Reporting
*** 907,924 ****
  ****************
  
  Bugs in the GCC Quad-Precision Math Library implementation should be
! reported via `http://gcc.gnu.org/bugs.html'.
  
  
  
  Tag Table:
! Node: Top1684
! Node: Typedef and constants2418
! Node: Math Library Routines3858
! Node: I/O Library Routines7662
! Node: strtoflt1287987
! Node: quadmath_snprintf8745
! Node: GNU Free Documentation License10953
! Node: Reporting Bugs36119
  
  End Tag Table
--- 791,808 ----
  ****************
  
  Bugs in the GCC Quad-Precision Math Library implementation should be
! reported via <http://gcc.gnu.org/bugs.html>.
  
  
  
  Tag Table:
! Node: Top1633
! Node: Typedef and constants2367
! Node: Math Library Routines3786
! Node: I/O Library Routines7502
! Node: strtoflt1287827
! Node: quadmath_snprintf8587
! Node: GNU Free Documentation License10797
! Node: Reporting Bugs35944
  
  End Tag Table
diff -Nrcpad gcc-5.4.0/libquadmath/math/roundq.c gcc-5.5.0/libquadmath/math/roundq.c
*** gcc-5.4.0/libquadmath/math/roundq.c	Wed Feb  6 22:03:54 2013
--- gcc-5.5.0/libquadmath/math/roundq.c	Sat Sep 16 18:33:53 2017
***************
*** 1,5 ****
  /* Round __float128 to integer away from zero.
!    Copyright (C) 1997, 1999 Free Software Foundation, Inc.
     This file is part of the GNU C Library.
     Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997 and
  		  Jakub Jelinek <jj@ultra.linux.cz>, 1999.
--- 1,5 ----
  /* Round __float128 to integer away from zero.
!    Copyright (C) 1997-2017 Free Software Foundation, Inc.
     This file is part of the GNU C Library.
     Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997 and
  		  Jakub Jelinek <jj@ultra.linux.cz>, 1999.
*************** roundq (__float128 x)
*** 32,38 ****
  
    GET_FLT128_WORDS64 (i0, i1, x);
    j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
!   if (j0 < 31)
      {
        if (j0 < 0)
  	{
--- 32,38 ----
  
    GET_FLT128_WORDS64 (i0, i1, x);
    j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
!   if (j0 < 48)
      {
        if (j0 < 0)
  	{
diff -Nrcpad gcc-5.4.0/libsanitizer/ChangeLog gcc-5.5.0/libsanitizer/ChangeLog
*** gcc-5.4.0/libsanitizer/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libsanitizer/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,69 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-09-07  Matthias Klose  <doko@ubuntu.com>
+ 
+ 	* asan/asan_linux.cc: Include <signal.h>
+ 
+ 2017-09-07  Matthias Klose  <doko@ubuntu.com>
+ 
+ 	Backported from mainline
+ 	2017-07-14  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/81066
+ 	* sanitizer_common/sanitizer_linux.h: Cherry-pick upstream r307969.
+ 	* sanitizer_common/sanitizer_linux.cc: Likewise.
+ 	* sanitizer_common/sanitizer_stoptheworld_linux_libcdep.cc: Likewise.
+ 	* tsan/tsan_platform_linux.cc: Likewise.
+ 
+ 2017-06-29  Eric Botcazou  <ebotcazou@adacore.com>
+ 
+ 	Backport from mainline
+ 	2017-01-10  James Clarke  <jrtc27@jrtc27.com>
+ 
+ 	PR sanitizer/78992
+ 	* sanitizer_common/sanitizer_platform_limits_posix.h
+ 	(struct __sanitizer_sigaction): Cherry-pick upstream r291561.
+ 
+ 	2016-11-30  Maxim Ostapenko  <m.ostapenko@samsung.com>
+ 
+ 	PR sanitizer/78532
+ 	* sanitizer_common/sanitizer_platform_limits_posix.h
+ 	(__sanitizer_sigaction): Adjust for sparc targets and various Glibc
+ 	versions.
+ 
+ 2017-05-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	Backported from mainline
+ 	2016-09-05  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR sanitizer/77396
+ 	* asan/asan_globals.cc: Cherry-pick upstream r280657.
+ 
+ 2017-05-29  Martin Liska  <mliska@suse.cz>
+ 
+ 	Backport from mainline
+ 	2017-04-06  Martin Liska  <mliska@suse.cz>
+ 
+ 	PR sanitizer/80166
+ 	* sanitizer_common/sanitizer_common_interceptors.inc (INTERCEPTOR):
+ 	Cherry-pick upstream r299036.
+ 
+ 2017-02-17  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	Backported from mainline
+ 	2017-02-16  Andreas Tobler  <andreast@gcc.gnu.org>
+ 
+ 	PR sanitizer/79562
+ 	* sanitizer_common/sanitizer_platform_limits_posix.cc: Cherry-pick
+ 	upstream r294806.
+ 
+ 2016-11-16  Markus Trippelsdorf  <markus@trippelsdorf.de>
+ 
+ 	PR sanitizer/78294
+ 	* tsan/tsan_rtl.cc: Add missing attribute.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libsanitizer/asan/asan_globals.cc gcc-5.5.0/libsanitizer/asan/asan_globals.cc
*** gcc-5.4.0/libsanitizer/asan/asan_globals.cc	Mon Feb 23 21:01:57 2015
--- gcc-5.5.0/libsanitizer/asan/asan_globals.cc	Tue May 30 07:19:49 2017
*************** void __asan_unregister_globals(__asan_gl
*** 249,258 ****
  // initializer can only touch global variables in the same TU.
  void __asan_before_dynamic_init(const char *module_name) {
    if (!flags()->check_initialization_order ||
!       !flags()->poison_heap)
      return;
    bool strict_init_order = flags()->strict_init_order;
-   CHECK(dynamic_init_globals);
    CHECK(module_name);
    CHECK(asan_inited);
    BlockingMutexLock lock(&mu_for_globals);
--- 249,258 ----
  // initializer can only touch global variables in the same TU.
  void __asan_before_dynamic_init(const char *module_name) {
    if (!flags()->check_initialization_order ||
!       !flags()->poison_heap ||
!       !dynamic_init_globals)
      return;
    bool strict_init_order = flags()->strict_init_order;
    CHECK(module_name);
    CHECK(asan_inited);
    BlockingMutexLock lock(&mu_for_globals);
*************** void __asan_before_dynamic_init(const ch
*** 275,281 ****
  // TU are poisoned.  It simply unpoisons all dynamically initialized globals.
  void __asan_after_dynamic_init() {
    if (!flags()->check_initialization_order ||
!       !flags()->poison_heap)
      return;
    CHECK(asan_inited);
    BlockingMutexLock lock(&mu_for_globals);
--- 275,282 ----
  // TU are poisoned.  It simply unpoisons all dynamically initialized globals.
  void __asan_after_dynamic_init() {
    if (!flags()->check_initialization_order ||
!       !flags()->poison_heap ||
!       !dynamic_init_globals)
      return;
    CHECK(asan_inited);
    BlockingMutexLock lock(&mu_for_globals);
diff -Nrcpad gcc-5.4.0/libsanitizer/asan/asan_linux.cc gcc-5.5.0/libsanitizer/asan/asan_linux.cc
*** gcc-5.4.0/libsanitizer/asan/asan_linux.cc	Tue Sep 23 17:59:53 2014
--- gcc-5.5.0/libsanitizer/asan/asan_linux.cc	Thu Sep  7 07:18:57 2017
***************
*** 29,34 ****
--- 29,35 ----
  #include <dlfcn.h>
  #include <fcntl.h>
  #include <pthread.h>
+ #include <signal.h>
  #include <stdio.h>
  #include <unistd.h>
  #include <unwind.h>
diff -Nrcpad gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_common_interceptors.inc gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_common_interceptors.inc
*** gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_common_interceptors.inc	Thu Nov 13 20:41:38 2014
--- gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_common_interceptors.inc	Mon May 29 09:09:07 2017
*************** INTERCEPTOR(int, getgroups, int size, u3
*** 2733,2739 ****
    // its metadata. See
    // https://code.google.com/p/address-sanitizer/issues/detail?id=321.
    int res = REAL(getgroups)(size, lst);
!   if (res && lst) COMMON_INTERCEPTOR_WRITE_RANGE(ctx, lst, res * sizeof(*lst));
    return res;
  }
  #define INIT_GETGROUPS COMMON_INTERCEPT_FUNCTION(getgroups);
--- 2733,2740 ----
    // its metadata. See
    // https://code.google.com/p/address-sanitizer/issues/detail?id=321.
    int res = REAL(getgroups)(size, lst);
!   if (res >= 0 && lst && size > 0)
!     COMMON_INTERCEPTOR_WRITE_RANGE(ctx, lst, res * sizeof(*lst));
    return res;
  }
  #define INIT_GETGROUPS COMMON_INTERCEPT_FUNCTION(getgroups);
diff -Nrcpad gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_linux.cc gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_linux.cc
*** gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_linux.cc	Fri Nov 21 14:03:37 2014
--- gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_linux.cc	Thu Sep  7 07:17:17 2017
*************** uptr internal_prctl(int option, uptr arg
*** 514,521 ****
  }
  #endif
  
! uptr internal_sigaltstack(const struct sigaltstack *ss,
!                          struct sigaltstack *oss) {
    return internal_syscall(SYSCALL(sigaltstack), (uptr)ss, (uptr)oss);
  }
  
--- 514,520 ----
  }
  #endif
  
! uptr internal_sigaltstack(const void *ss, void *oss) {
    return internal_syscall(SYSCALL(sigaltstack), (uptr)ss, (uptr)oss);
  }
  
diff -Nrcpad gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_linux.h gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_linux.h
*** gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_linux.h	Thu May 22 07:09:21 2014
--- gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_linux.h	Thu Sep  7 07:17:17 2017
***************
*** 18,24 ****
  #include "sanitizer_platform_limits_posix.h"
  
  struct link_map;  // Opaque type returned by dlopen().
- struct sigaltstack;
  
  namespace __sanitizer {
  // Dirent structure for getdents(). Note that this structure is different from
--- 18,23 ----
*************** struct linux_dirent;
*** 27,34 ****
  
  // Syscall wrappers.
  uptr internal_getdents(fd_t fd, struct linux_dirent *dirp, unsigned int count);
! uptr internal_sigaltstack(const struct sigaltstack* ss,
!                           struct sigaltstack* oss);
  uptr internal_sigprocmask(int how, __sanitizer_sigset_t *set,
      __sanitizer_sigset_t *oldset);
  void internal_sigfillset(__sanitizer_sigset_t *set);
--- 26,32 ----
  
  // Syscall wrappers.
  uptr internal_getdents(fd_t fd, struct linux_dirent *dirp, unsigned int count);
! uptr internal_sigaltstack(const void* ss, void* oss);
  uptr internal_sigprocmask(int how, __sanitizer_sigset_t *set,
      __sanitizer_sigset_t *oldset);
  void internal_sigfillset(__sanitizer_sigset_t *set);
diff -Nrcpad gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.cc gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.cc
*** gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.cc	Tue May 12 07:02:09 2015
--- gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.cc	Fri Feb 17 19:23:28 2017
***************
*** 21,31 ****
  #ifdef _FILE_OFFSET_BITS
  #undef _FILE_OFFSET_BITS
  #endif
- #if SANITIZER_FREEBSD
- #define _WANT_RTENTRY
- #include <sys/param.h>
- #include <sys/socketvar.h>
- #endif
  #include <arpa/inet.h>
  #include <dirent.h>
  #include <errno.h>
--- 21,26 ----
*************** namespace __sanitizer {
*** 353,358 ****
--- 348,354 ----
    unsigned struct_input_absinfo_sz = sizeof(struct input_absinfo);
    unsigned struct_input_id_sz = sizeof(struct input_id);
    unsigned struct_mtpos_sz = sizeof(struct mtpos);
+   unsigned struct_rtentry_sz = sizeof(struct rtentry);
    unsigned struct_termio_sz = sizeof(struct termio);
    unsigned struct_vt_consize_sz = sizeof(struct vt_consize);
    unsigned struct_vt_sizes_sz = sizeof(struct vt_sizes);
*************** namespace __sanitizer {
*** 372,378 ****
    unsigned struct_midi_info_sz = sizeof(struct midi_info);
    unsigned struct_mtget_sz = sizeof(struct mtget);
    unsigned struct_mtop_sz = sizeof(struct mtop);
-   unsigned struct_rtentry_sz = sizeof(struct rtentry);
    unsigned struct_sbi_instrument_sz = sizeof(struct sbi_instrument);
    unsigned struct_seq_event_rec_sz = sizeof(struct seq_event_rec);
    unsigned struct_synth_info_sz = sizeof(struct synth_info);
--- 368,373 ----
diff -Nrcpad gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.h gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.h
*** gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.h	Mon Mar  9 18:25:28 2015
--- gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_platform_limits_posix.h	Thu Jun 29 18:57:47 2017
***************
*** 16,21 ****
--- 16,25 ----
  #include "sanitizer_internal_defs.h"
  #include "sanitizer_platform.h"
  
+ #ifndef __GLIBC_PREREQ
+ #define __GLIBC_PREREQ(x, y) 0
+ #endif
+ 
  namespace __sanitizer {
    extern unsigned struct_utsname_sz;
    extern unsigned struct_stat_sz;
*************** namespace __sanitizer {
*** 565,571 ****
--- 569,585 ----
      __sanitizer_sigset_t sa_mask;
  #ifndef __mips__
  #if defined(__sparc__)
+ #if __GLIBC_PREREQ (2, 20)
+     // On sparc glibc 2.19 and earlier sa_flags was unsigned long.
+ #if defined(__arch64__)
+     // To maintain ABI compatibility on sparc64 when switching to an int,
+     // __glibc_reserved0 was added.
+     int __glibc_reserved0;
+ #endif
+     int sa_flags;
+ #else
      unsigned long sa_flags;
+ #endif
  #else
      int sa_flags;
  #endif
diff -Nrcpad gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_stoptheworld_linux_libcdep.cc gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_stoptheworld_linux_libcdep.cc
*** gcc-5.4.0/libsanitizer/sanitizer_common/sanitizer_stoptheworld_linux_libcdep.cc	Thu May 22 07:09:21 2014
--- gcc-5.5.0/libsanitizer/sanitizer_common/sanitizer_stoptheworld_linux_libcdep.cc	Thu Sep  7 07:17:17 2017
*************** static int TracerThread(void* argument)
*** 234,240 ****
  
    // Alternate stack for signal handling.
    InternalScopedBuffer<char> handler_stack_memory(kHandlerStackSize);
!   struct sigaltstack handler_stack;
    internal_memset(&handler_stack, 0, sizeof(handler_stack));
    handler_stack.ss_sp = handler_stack_memory.data();
    handler_stack.ss_size = kHandlerStackSize;
--- 234,240 ----
  
    // Alternate stack for signal handling.
    InternalScopedBuffer<char> handler_stack_memory(kHandlerStackSize);
!   stack_t handler_stack;
    internal_memset(&handler_stack, 0, sizeof(handler_stack));
    handler_stack.ss_sp = handler_stack_memory.data();
    handler_stack.ss_size = kHandlerStackSize;
diff -Nrcpad gcc-5.4.0/libsanitizer/tsan/tsan_platform_linux.cc gcc-5.5.0/libsanitizer/tsan/tsan_platform_linux.cc
*** gcc-5.4.0/libsanitizer/tsan/tsan_platform_linux.cc	Thu Nov 13 20:41:38 2014
--- gcc-5.5.0/libsanitizer/tsan/tsan_platform_linux.cc	Thu Sep  7 07:17:17 2017
*************** bool IsGlobalVar(uptr addr) {
*** 377,383 ****
  int ExtractResolvFDs(void *state, int *fds, int nfd) {
  #if SANITIZER_LINUX
    int cnt = 0;
!   __res_state *statp = (__res_state*)state;
    for (int i = 0; i < MAXNS && cnt < nfd; i++) {
      if (statp->_u._ext.nsaddrs[i] && statp->_u._ext.nssocks[i] != -1)
        fds[cnt++] = statp->_u._ext.nssocks[i];
--- 377,383 ----
  int ExtractResolvFDs(void *state, int *fds, int nfd) {
  #if SANITIZER_LINUX
    int cnt = 0;
!   struct __res_state *statp = (struct __res_state*)state;
    for (int i = 0; i < MAXNS && cnt < nfd; i++) {
      if (statp->_u._ext.nsaddrs[i] && statp->_u._ext.nssocks[i] != -1)
        fds[cnt++] = statp->_u._ext.nssocks[i];
diff -Nrcpad gcc-5.4.0/libsanitizer/tsan/tsan_rtl.cc gcc-5.5.0/libsanitizer/tsan/tsan_rtl.cc
*** gcc-5.4.0/libsanitizer/tsan/tsan_rtl.cc	Thu Nov 13 20:41:38 2014
--- gcc-5.5.0/libsanitizer/tsan/tsan_rtl.cc	Wed Nov 16 11:31:18 2016
*************** extern "C" void __tsan_resume() {
*** 42,47 ****
--- 42,48 ----
  namespace __tsan {
  
  #ifndef TSAN_GO
+ __attribute__((tls_model("initial-exec")))
  THREADLOCAL char cur_thread_placeholder[sizeof(ThreadState)] ALIGNED(64);
  #endif
  static char ctx_placeholder[sizeof(Context)] ALIGNED(64);
diff -Nrcpad gcc-5.4.0/libssp/ChangeLog gcc-5.5.0/libssp/ChangeLog
*** gcc-5.4.0/libssp/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libssp/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libstdc++-v3/ChangeLog gcc-5.5.0/libstdc++-v3/ChangeLog
*** gcc-5.4.0/libstdc++-v3/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libstdc++-v3/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,1150 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-09-13  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/20_util/reference_wrapper/80504.cc: Do not use invalid
+ 	effective-target.
+ 	* testsuite/22_locale/conversions/buffer/2.cc: Likewise.
+ 	* testsuite/28_regex/basic_regex/ctors/basic/iter.cc: Likewise. Fix
+ 	use of test_container.
+ 
+ 	PR libstdc++/81468
+ 	* include/std/chrono (time_point(const time_point<_Dur2>&)): Add
+ 	missing constraint from LWG DR 1177.
+ 	* testsuite/20_util/duration/cons/dr1177.cc: New.
+ 	* testsuite/20_util/time_point/cons/81468.cc: New.
+ 	* testsuite/20_util/duration/literals/range.cc: Update dg-error line.
+ 
+ 	* doc/doxygen/mainpage.html: Fix broken URLs.
+ 
+ 	PR libstdc++/81835
+ 	* doc/xml/manual/extensions.xml: Replace unstable URL.
+ 	* doc/html/manual/ext_demangling.html: Regenerate.
+ 	* libsupc++/cxxabi.h (__cxa_demangle): Fix broken URL.
+ 
+ 2017-09-04  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2017-08-09  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/79820
+ 	PR libstdc++/81751
+ 	* config/io/basic_file_stdio.cc (sys_open(FILE*, ios_base::openmode)):
+ 	Call fflush on the stream instead of calling sync() while _M_cfile is
+ 	null. Restore original value of errno.
+ 	* testsuite/ext/stdio_filebuf/char/79820.cc: New.
+ 	* testsuite/ext/stdio_filebuf/char/81751.cc: New.
+ 
+ 	Backport from mainline
+ 	2017-07-25  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/53984
+ 	* include/bits/basic_ios.h (basic_ios::_M_setstate): Adjust comment.
+ 	* include/bits/istream.tcc (basic_istream::sentry): Handle exceptions
+ 	during construction.
+ 	* include/std/istream: Adjust comments for formatted input functions
+ 	and unformatted input functions.
+ 	* testsuite/27_io/basic_fstream/53984.cc: New.
+ 	* testsuite/27_io/basic_istream/sentry/char/53984.cc: New.
+ 
+ 	Backport from mainline
+ 	2017-06-08  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/81017
+ 	* include/std/functional (function::function(function&&))
+ 	(function::operator=(function&&)): Add noexcept.
+ 	* testsuite/20_util/function/assign/move.cc: Check for noexcept.
+ 	* testsuite/20_util/function/cons/move.cc: Likewise.
+ 
+ 	Backport from mainline
+ 	2017-06-05  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* include/bits/shared_ptr_base.h (__shared_ptr::owner_before)
+ 	(__weak_ptr::owner_before, _Sp_owner_less::operator()): Add noexcept
+ 	specifiers as per LWG 2873 and LWG 2942.
+ 	* testsuite/20_util/owner_less/noexcept.cc: New.
+ 	* testsuite/20_util/shared_ptr/observers/owner_before.cc: Test
+ 	noexcept guarantees.
+ 	* testsuite/20_util/weak_ptr/observers/owner_before.cc: Likewise.
+ 
+ 	Backport from mainline
+ 	2017-08-31  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR c++/82039
+ 	* include/ext/new_allocator.h (__gnu_cxx::new_allocator::allocate):
+ 	Adjust null pointer constant to avoid warning.
+ 
+ 	Backport from mainline
+ 	2017-08-18  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/81891
+ 	* include/bits/hashtable.h (_Hashtable(_InputIterator, _InputIterator,
+ 	size_type, const _H1&, const _H2&, const _Hash&, const _Equal&,
+ 	const _ExtractKey&, const allocator_type&)): Let destructor do clean
+ 	up if an exception is thrown.
+ 	* testsuite/23_containers/unordered_map/cons/81891.cc: New.
+ 
+ 	Backport from mainline
+ 	2017-07-31  Marek Polacek  <polacek@redhat.com>
+ 
+ 	PR libstdc++/81599
+ 	* include/bits/stl_stack.h: Fix typo.
+ 
+ 	Backport from mainline
+ 	2017-07-10  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/81338
+ 	* include/bits/basic_string.h [_GLIBCXX_USE_CXX11_ABI] (basic_string):
+ 	Declare basic_stringbuf to be a friend.
+ 	* include/bits/sstream.tcc (basic_stringbuf::overflow)
+ 	[_GLIBCXX_USE_CXX11_ABI]: Use unused capacity before reallocating.
+ 	* include/std/sstream (basic_stringbuf::__xfer_bufptrs): Update string
+ 	length to buffer length.
+ 	* testsuite/27_io/basic_stringstream/assign/81338.cc: New.
+ 
+ 2017-09-01  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-10-06  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* doc/xml/manual/status_cxx2011.xml: Update status.
+ 	* doc/html/manual/status.html: Regenerate.
+ 	* include/std/scoped_allocator (__outer_allocator_t, __outermost_type):
+ 	New helpers for recursive OUTERMOST.
+ 	(__outermost): Use __outermost_type::_S_outermost.
+ 	(__do_outermost, scoped_allocator_adaptor::__outermost_type): Remove.
+ 	(scoped_allocator_adaptor::__outermost_alloc_traits): Use new
+ 	__outermost_type helper.
+ 	(scoped_allocator_adaptor::_Constructible): New alias template.
+ 	(scoped_allocator_adaptor::scoped_allocator_adaptor<_Outer2>):
+ 	Constrain template constructors.
+ 	* testsuite/20_util/scoped_allocator/3.cc: New test.
+ 	* testsuite/20_util/scoped_allocator/outermost.cc: New test.
+ 
+ 2017-06-16  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* include/bits/locale_conv.h (wbuffer_convert::sync): Fix condition.
+ 	* testsuite/22_locale/conversions/buffer/2.cc: New.
+ 
+ 	* doc/xml/manual/appendix_contributing.xml: Link to the list of bad
+ 	names, and link to the test docs and note higher DejaGnu version
+ 	requirement.
+ 	* doc/xml/manual/allocator.xml: Fix ViewCVS URLs.
+ 	* doc/xml/manual/mt_allocator.xml: Likewise.
+ 	* doc/html/*: Regenerate.
+ 
+ 	* include/bits/locale_conv.h (wbuffer_convert::_M_put): Add missing
+ 	return statement.
+ 
+ 2017-06-07  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/81002
+ 	* include/bits/regex_compiler.h (__compile_nfa): Add template argument
+ 	list to specify traits type.
+ 	* testsuite/28_regex/basic_regex/ctors/basic/iter.cc: New.
+ 
+ 2017-05-18  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/22_locale/codecvt/codecvt_utf16/79980.cc: Replace
+ 	effective-target with dg-options directive.
+ 	* testsuite/22_locale/codecvt/codecvt_utf16/80041.cc: Likewise.
+ 	* testsuite/22_locale/codecvt/codecvt_utf16/members.cc: Likewise.
+ 	* testsuite/22_locale/codecvt/codecvt_utf16/misaligned.cc: Likewise.
+ 	* testsuite/22_locale/codecvt/codecvt_utf8/79980.cc: Likewise.
+ 	* testsuite/22_locale/codecvt/codecvt_utf8/members.cc: Likewise.
+ 	* testsuite/22_locale/codecvt/codecvt_utf8_utf16/79511.cc: Likewise.
+ 	* testsuite/22_locale/codecvt/codecvt_utf8_utf16/members.cc: Likewise.
+ 
+ 	Backport from mainline
+ 	2016-08-02  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/18_support/bad_exception/23591_thread-1.c: Skip test if
+ 	options are present that aren't valid for C.
+ 	* testsuite/abi/header_cxxabi.c: Likewise.
+ 
+ 	Backport from mainline
+ 	2017-04-24  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/80504
+ 	* include/std/functional (ref, cref): Qualify calls.
+ 	* testsuite/20_util/reference_wrapper/80504.cc: New test.
+ 
+ 	Backport from mainline
+ 	2017-04-19  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/80448
+ 	* include/experimental/bits/fs_dir.h (directory_iterator)
+ 	(recursive_directory_iterator): Remove noexcept from defaulted
+ 	constructors.
+ 
+ 	Backport from mainline
+ 	2017-04-03  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/20_util/reference_wrapper/invoke.cc: Uncomment tests
+ 	that no longer fail.
+ 
+ 	Backport from mainline
+ 	2017-04-03  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* include/bits/ios_base.h: Correct comment.
+ 	* testsuite/util/testsuite_hooks.h: Likewise.
+ 
+ 	Backport from mainline
+ 	2017-03-16  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/67440
+ 	* python/libstdcxx/v6/printers.py (find_type): Avoid gdb.Type.name
+ 	for GDB 7.6 compatibility, use gdb.Type.unqualified instead.
+ 
+ 	Backport from mainline
+ 	2017-01-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/69699
+ 	* doc/xml/manual/abi.xml (abi.versioning.history): Explain why the
+ 	_GLIBCXX__ macro is not useful. Remove redundant date information
+ 	and link to the GCC release timeline.
+ 	(abi.versioning.active): Move partial sentence into the previous
+ 	paragraph.
+ 	* doc/html/*: Regenerate.
+ 
+ 	Backport from mainline
+ 	2016-12-21  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/71444
+ 	* config/os/mingw32-w64/error_constants.h
+ 	(address_family_not_supported, address_in_use, address_not_available)
+ 	(already_connected, connection_aborted, connection_already_in_progress)
+ 	connection_refused, connection_reset, cross_device_link)
+ 	(destination_address_required, host_unreachable, message_size)
+ 	(network_down, network_reset, network_unreachable, no_buffer_space)
+ 	(no_protocol_option, not_a_socket, not_connected, operation_canceled)
+ 	(operation_in_progress, operation_not_supported, protocol_error)
+ 	(protocol_not_supported, too_many_links, too_many_symbolic_link_levels)
+ 	(value_too_large, wrong_protocol_type): Define.
+ 	(bad_message, identifier_removed, no_link, no_message_available)
+ 	(no_message, no_stream_resources, not_a_stream, owner_dead)
+ 	(state_not_recoverable, stream_timeout, text_file_busy): Define
+ 	conditionally.
+ 	* testsuite/19_diagnostics/headers/system_error/errc_std_c++0x.cc:
+ 	Guard test for no_message with _GLIBCXX_HAVE_ENOMSG.
+ 
+ 	Backport from mainline
+ 	2016-11-09  Tim Shen  <timshen@google.com>
+ 
+ 	PR libstdc++/78236
+ 	* libstdc++-v3/include/bits/regex.h (regex_iterator::regex_iterator()):
+ 	Define end() as _M_pregex == nullptr.
+ 	* libstdc++-v3/include/bits/regex.tcc (regex_iterator::operator==(),
+ 	regex_iterator::operator++()): Fix operator==() and operator++() to
+ 	look at null-ness of _M_pregex on both sides.
+ 	* testsuite/28_regex/regression.cc: New testcase.
+ 
+ 	Backport from mainline
+ 	2016-12-15  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/59170
+ 	* python/libstdcxx/v6/printers.py (StdListIteratorPrinter.to_string)
+ 	(StdSlistIteratorPrinter.to_string, StdVectorIteratorPrinter.to_string)
+ 	(StdRbtreeIteratorPrinter.to_string)
+ 	(StdDequeIteratorPrinter.to_string): Add check for value-initialized
+ 	iterators.
+ 	* testsuite/libstdc++-prettyprinters/simple.cc: Test them.
+ 	* testsuite/libstdc++-prettyprinters/simple11.cc: Likewise.
+ 
+ 	Backport from mainline
+ 	2016-12-15  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/59161
+ 	* python/libstdcxx/v6/printers.py (StdListIteratorPrinter.to_string)
+ 	(StdSlistIteratorPrinter.to_string, StdVectorIteratorPrinter.to_string)
+ 	(StdRbtreeIteratorPrinter.to_string, StdDequeIteratorPrinter.to_string)
+ 	(StdDebugIteratorPrinter.to_string): Return string instead of
+ 	gdb.Value.
+ 	* testsuite/libstdc++-prettyprinters/59161.cc: New test.
+ 
+ 	Backport from mainline
+ 	2016-10-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* python/libstdcxx/v6/printers.py (build_libstdcxx_dictionary):
+ 	Register printer for std::__cxx11::list.
+ 	* python/libstdcxx/v6/xmethods.py (ListMethodsMatcher.match): Match
+ 	std::__cxx11::list as well as std::list.
+ 
+ 2017-05-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2017-03-15Â Â Xi RuoyaoÂ Â <ryxi@stu.xidian.edu.cn>
+ 
+ 	PR libstdc++/62045
+ 	* include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp
+ 	(is_heap): Remove.
+ 	(push_heap): Remove the wrong checking using is_heap.
+ 	(make_heap): Remove the assertion using is_heap.
+ 	* include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp
+ 	(modify): Ditto.
+ 	(resize_for_insert_if_needed): Add PB_DS_ASSERT_VALID after
+ 	calling make_heap.
+ 
+ 	Backport from mainline
+ 	2017-03-15  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/62045
+ 	* testsuite/ext/pb_ds/regression/priority_queue_binary_heap-62045.cc:
+ 	New test.
+ 	* testsuite/ext/pb_ds/regression/priority_queues.cc: Fix copy&paste
+ 	error in comment.
+ 
+ 	Backport from mainline
+ 	2015-11-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/66059
+ 	* include/std/utility (_Build_index_tuple): Optimise.
+ 
+ 2017-03-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2017-03-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* src/c++11/codecvt.cc (range): Add non-type template parameter and
+ 	define oerloaded operators for reading and writing code units.
+ 	(range<Elem, false>): Define partial specialization for accessing
+ 	wide characters in potentially unaligned byte ranges.
+ 	(ucs2_span(const char16_t*, const char16_t*, ...))
+ 	(ucs4_span(const char16_t*, const char16_t*, ...)): Change parameters
+ 	to range<const char16_t, false> in order to avoid unaligned reads.
+ 	(__codecvt_utf16_base<char16_t>::do_out)
+ 	(__codecvt_utf16_base<char32_t>::do_out)
+ 	(__codecvt_utf16_base<wchar_t>::do_out): Use range specialization for
+ 	unaligned data to avoid unaligned writes.
+ 	(__codecvt_utf16_base<char16_t>::do_in)
+ 	(__codecvt_utf16_base<char32_t>::do_in)
+ 	(__codecvt_utf16_base<wchar_t>::do_in): Likewise for writes. Return
+ 	error if there are unprocessable trailing bytes.
+ 	(__codecvt_utf16_base<char16_t>::do_length)
+ 	(__codecvt_utf16_base<char32_t>::do_length)
+ 	(__codecvt_utf16_base<wchar_t>::do_length): Pass arguments of type
+ 	range<const char16_t, false> to span functions.
+ 	* testsuite/22_locale/codecvt/codecvt_utf16/misaligned.cc: New test.
+ 
+ 	Backport from mainline
+ 	2017-03-16  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/79980
+ 	* src/c++11/codecvt.cc (to_integer(codecvt_mode)): Fix target type.
+ 
+ 	PR libstdc++/80041
+ 	* src/c++11/codecvt.cc (__codecvt_utf16_base<wchar_t>::do_out)
+ 	(__codecvt_utf16_base<wchar_t>::do_in): Convert char arguments to
+ 	char16_t to work with UTF-16 instead of UTF-8.
+ 	* testsuite/22_locale/codecvt/codecvt_utf16/80041.cc: New test.
+ 
+ 	* src/c++11/codecvt.cc (codecvt<char16_t, char, mbstate_t>)
+ 	(codecvt<char32_t, char, mbstate_t>, __codecvt_utf8_base<char16_t>)
+ 	(__codecvt_utf8_base<char32_t>, __codecvt_utf8_base<wchar_t>)
+ 	(__codecvt_utf16_base<char16_t>, __codecvt_utf16_base<char32_t>)
+ 	(__codecvt_utf16_base<wchar_t>, __codecvt_utf8_utf16_base<char16_t>)
+ 	(__codecvt_utf8_utf16_base<char32_t>)
+ 	(__codecvt_utf8_utf16_base<wchar_t>): Fix do_encoding() and
+ 	do_max_length() return values.
+ 	* testsuite/22_locale/codecvt/codecvt_utf16/members.cc: New test.
+ 	* testsuite/22_locale/codecvt/codecvt_utf8/members.cc: New test.
+ 	* testsuite/22_locale/codecvt/codecvt_utf8_utf16/members.cc: New test.
+ 
+ 	PR libstdc++/79980
+ 	* include/bits/locale_conv.h (__do_str_codecvt): Set __count on
+ 	error path.
+ 	* src/c++11/codecvt.cc (operator&=, operator|=, operator~): Overloads
+ 	for manipulating codecvt_mode values.
+ 	(read_utf16_bom): Compare input to BOM constants instead of integral
+ 	constants that depend on endianness.  Take mode parameter by
+ 	reference and adjust it, to distinguish between no BOM present and
+ 	UTF-16BE BOM present.
+ 	(ucs4_in, ucs2_span, ucs4_span): Adjust calls to read_utf16_bom.
+ 	(surrogates): New enumeration type.
+ 	(utf16_in, utf16_out): Add surrogates parameter to choose between
+ 	UTF-16 and UCS2 behaviour.
+ 	(utf16_span, ucs2_span): Use std::min not std::max.
+ 	(ucs2_out): Use std::min not std::max.  Disallow surrogate pairs.
+ 	(ucs2_in): Likewise. Adjust calls to read_utf16_bom.
+ 	* testsuite/22_locale/codecvt/codecvt_utf16/79980.cc: New test.
+ 	* testsuite/22_locale/codecvt/codecvt_utf8/79980.cc: New test.
+ 
+ 	PR libstdc++/79511
+ 	* src/c++11/codecvt.cc (write_utf16_code_point): Don't write 0xffff
+ 	as a surrogate pair.
+ 	(__codecvt_utf8_utf16_base<char32_t>::do_in): Use native endianness
+ 	for internal representation.
+ 	(__codecvt_utf8_utf16_base<wchar_t>::do_in): Likewise.
+ 	* testsuite/22_locale/codecvt/codecvt_utf8_utf16/79511.cc: New test.
+ 
+ 2017-03-14  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/17_intro/names.cc: Undefine macros that clash with
+ 	identifiers in AIX system headers.
+ 
+ 2017-03-13  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	PR libstdc++/80034
+ 	* include/bits/list.tcc (merge(list&&)): Use const for the size_t
+ 	in the function and in the catch-block, qualify uses of std::distance.
+ 	(merge(list&&, _StrictWeakOrdering)): Likewise.
+ 	* testsuite/23_containers/list/operations/80034.cc: New.
+ 
+ 2017-03-02  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/79789
+ 	* include/bits/ios_base.h (make_error_code, make_error_condition):
+ 	Likewise.
+ 	* include/bits/mask_array.h (mask_array): Likewise.
+ 	* include/bits/regex.h (regex_token_iterator): Likewise.
+ 	* include/bits/slice_array.h (slice_array): Likewise.
+ 	* include/std/memory (undeclare_no_pointers): Likewise.
+ 	* testsuite/17_intro/names.cc: New test.
+ 
+ 2017-02-14  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2017-01-20  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/69321
+ 	* include/experimental/any (__any_caster): Avoid instantiating
+ 	manager function for types that can't be stored in any.
+ 	* testsuite/experimental/any/misc/any_cast.cc: Test non-copyable type.
+ 	* testsuite/experimental/any/misc/any_cast_neg.cc: Adjust dg-error.
+ 
+ 	Backport from mainline
+ 	2017-01-18  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/69301
+ 	* include/std/atomic (atomic<T>::load, atomic<T>::exchange): Use
+ 	aligned buffer instead of default-initialized variable.
+ 	* testsuite/29_atomics/atomic/69301.cc: New test.
+ 	* include/ext/pointer.h (_Pointer_adapter::operator++(int))
+ 	(_Pointer_adapter::operator--(int)): Likewise.
+ 
+ 	Backport from mainline
+ 	2017-01-16  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/78702
+ 	* include/bits/locale_classes.h (locale::facet::__shim): Change from
+ 	private to protected.
+ 	* src/c++11/cxx11-shim_facets.cc (__shim_accessor): Define helper to
+ 	make locale::facet::__shim accessible.
+ 
+ 	Backport from mainline
+ 	2017-01-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/78134
+ 	* include/bits/stl_map.h (map::lower_bound, map::upper_bound)
+ 	(map::equal_range): Fix return type of heterogeneous overloads.
+ 	* include/bits/stl_multimap.h (multimap::lower_bound)
+ 	(multimap::upper_bound, multimap::equal_range): Likewise.
+ 	* include/bits/stl_multiset.h (multiset::lower_bound)
+ 	(multiset::upper_bound, multiset::equal_range): Likewise.
+ 	* include/bits/stl_set.h (set::lower_bound, set::upper_bound)
+ 	(set::equal_range): Likewise.
+ 	* testsuite/23_containers/map/operations/2.cc: Check return types.
+ 	* testsuite/23_containers/multimap/operations/2.cc: Likewise.
+ 	* testsuite/23_containers/multiset/operations/2.cc: Likewise.
+ 	* testsuite/23_containers/set/operations/2.cc: Likewise.
+ 
+ 	Backport from mainline
+ 	2017-01-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/78273
+ 	* include/bits/stl_map.h (map::count<_Kt>(const _Kt&)): Don't assume
+ 	the heterogeneous comparison can only find one match.
+ 	* include/bits/stl_set.h (set::count<_Kt>(const _Kt&)): Likewise.
+ 	* testsuite/23_containers/map/operations/2.cc: Test count works with
+ 	comparison function that just partitions rather than sorting.
+ 	* testsuite/23_containers/set/operations/2.cc: Likewise.
+ 
+ 2017-02-01  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/78346
+ 	* include/bits/predefined_ops.h (_Iter_equals_iter): Store iterator
+ 	not its referent.
+ 	(_Iter_comp_to_iter): Likewise.
+ 	* testsuite/25_algorithms/search/78346.cc: New test.
+ 
+ 	PR libstdc++/79254
+ 	* include/bits/basic_string.h [_GLIBCXX_USE_CXX11_ABI]
+ 	(basic_string::operator=(const basic_string&)): If source object is
+ 	small just deallocate, otherwise perform new allocation before
+ 	making any changes.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/copy_assign.cc:
+ 	Test exception-safety of copy assignment when allocator propagates.
+ 	* testsuite/21_strings/basic_string/allocator/char/copy_assign.cc:
+ 	Likewise.
+ 	* testsuite/util/testsuite_allocator.h (uneq_allocator::swap): Make
+ 	std::swap visible.
+ 
+ 2017-01-22  Gerald Pfeifer  <gerald@pfeifer.com>
+ 
+ 	Merge from mainline
+ 	2017-01-01  Gerald Pfeifer  <gerald@pfeifer.com>
+ 
+ 	* doc/xml/faq.xml: Update address of C++ ABI link.
+ 	* doc/xml/manual/abi.xml: Ditto.
+ 	
+ 2017-01-16  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	Backport from mainline
+ 	2017-01-16  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	PR libstdc++/78389
+ 	* include/bits/list.tcc (merge(list&&)): Fix backwards size adjustments.
+ 	(merge(list&&, _StrictWeakOrdering)): Likewise.
+ 	* testsuite/23_containers/list/operations/78389.cc: Add
+ 	better test for the sizes.
+ 
+ 2017-01-15  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	Backport from mainline
+         2017-01-13  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	PR libstdc++/78389
+ 	* include/bits/list.tcc (merge(list&&)):
+ 	Adjust list sizes if the comparator throws.
+ 	(merge(list&&, _StrictWeakOrdering)): Likewise.
+ 	* testsuite/23_containers/list/operations/78389.cc: New.
+ 
+ 2017-01-09  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/30_threads/thread/cons/lwg2097.cc: Compile with
+ 	-std=gnu++11.
+ 
+ 	* testsuite/25_algorithms/sort/78991.cc: Compile with -std=gnu++14.
+ 
+ 2017-01-06  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2017-01-03  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/78956
+ 	* include/std/thread (thread(const thread&&)): Add deleted
+ 	constructor.
+ 	* testsuite/30_threads/thread/cons/lwg2097.cc: New test.
+ 
+ 2017-01-06  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/78991
+ 	* include/bits/predefined_ops.h (_Iter_comp_iter, _Iter_comp_val)
+ 	(_Val_comp_iter, _Iter_equals_val, _Iter_pred, _Iter_comp_to_val)
+ 	(_Iter_comp_to_iter, _Iter_negate): Make constructors explicit.
+ 	* testsuite/25_algorithms/sort/78991.cc: New test.
+ 
+ 2016-12-19  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-12-19  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	Make the perfect-forwarding constructor of a two-element tuple
+ 	sfinae away when the first argument is an allocator_arg.
+ 	* include/std/tuple (tuple(_U1&&, _U2&&)): Constrain.
+ 	* testsuite/20_util/tuple/cons/allocator_with_any.cc: New.
+ 
+ 2016-12-13  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-10-26  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* acinclude.m4 (GLIBCXX_CHECK_FILESYSTEM_DEPS): Include <limits.h>
+ 	for PATH_MAX in realpath test.
+ 	* configure: Regenerate.
+ 
+ 	Backport from mainline
+ 	2016-05-25  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* acinclude.m4 (GLIBCXX_CHECK_FILESYSTEM_DEPS): Fix test for sendfile.
+ 	* configure: Regenerate.
+ 	* config.h.in: Regenerate.
+ 
+ 2016-12-12  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-12-07  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/18_support/headers/new/synopsis.cc: Add C++14 declarations.
+ 	* testsuite/18_support/headers/new/synopsis_cxx98.cc: New test.
+ 
+ 2016-12-12  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-11-22  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/78465
+ 	* testsuite/29_atomics/headers/atomic/macros.cc: Replace runtime tests
+ 	with preprocessor conditions.
+ 
+ 2016-12-12  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	PR libstdc++/70975
+ 	PR libstdc++/71337
+ 	PR libstdc++/78111
+ 	* include/experimental/bits/fs_dir.h (recursive_directory_iterator):
+ 	Overload pop (LWG 2706).
+ 	* include/experimental/bits/fs_fwd.h (perms::resolve_symlinks):
+ 	Replace with symlink_nofollow (LWG 2720).
+ 	* include/experimental/bits/fs_ops.h
+ 	(exists(const path&, error_code&)): Clear error if status is known
+ 	(LWG 2725).
+ 	* include/experimental/bits/fs_path.h (__is_path_src)
+ 	(_S_range_begin, _S_range_end): Overload to treat string_view as a
+ 	Source object.
+ 	(path::operator+=, path::compare): Overload for basic_string_view.
+ 	(path::path(string_type&&))
+ 	(path::operator=(string&&), path::assign(string_type&&)): Define
+ 	construction and assignment from string_type rvalues (LWG 2707).
+ 	(path::_S_convert<_Iter>(_Iter, _Iter)): Remove cv-qualifiers from
+ 	iterator's value_type.
+ 	(path::_S_convert<_Iter>(_Iter __first, __null_terminated)): Likewise.
+ 	Do not use operation not supported by input iterators.
+ 	(path::__is_path_iter_src): Add partial specialization for const
+ 	encoded character types.
+ 	* src/filesystem/dir.cc (open_dir): Return same value for errors
+ 	whether ignored or not.
+ 	(_Dir::advance(error_code*, directory_options)): Return false on
+ 	error.
+ 	(directory_iterator(const path&, directory_options, error_code*)):
+ 	Create end iterator on error (LWG 2723).
+ 	(recursive_directory_iterator(const path&, directory_options,
+ 	error_code*)): Likewise.
+ 	(recursive_directory_iterator::increment): Reset state on error.
+ 	(recursive_directory_iterator::pop): Define new overload.
+ 	* src/filesystem/ops.cc (canonical): Set error for non-existent path.
+ 	(file_time): Take error_code parameter and check for overflow.
+ 	(close_fd): Remove.
+ 	(do_copy_file): Report an error if source or destination is not a
+ 	regular file (LWG 2712). Pass error_code in file_time calls.  Just
+ 	use close(3) instead of close_fd, to prevent retrying on error.
+ 	Check if _GLIBCXX_USE_FCHMODAT is defined.
+ 	[_GLIBCXX_USE_SENDFILE]: Fallback to read/write operations in case
+ 	sendfile fails with ENOSYS or EINVAL. Pass non-null pointer to
+ 	sendfile for offset argument.
+ 	(copy): Update comment to refer to LWG 2681. Implement 2682 and 2683
+ 	resolutions.
+ 	(equivalent): Fix error handling and result when only one file exists.
+ 	(is_empty): Fix error handling.
+ 	(last_write_time(const path&, error_code&)): Pass error_code in
+ 	file_time calls.
+ 	(last_write_time(const path&, file_time_type, error_code&)): Handle
+ 	negative times correctly.
+ 	(permissions(const path&, perms, error_code&)): Handle
+ 	symlink_nofollow.
+ 	(read_symlink): Add missing ec.clear().
+ 	(status(const path&, error_code&)): Handle EOVERFLOW.
+ 	(temp_directory_path): Pass error_code argument to other filesystem
+ 	operations.
+ 	* testsuite/experimental/filesystem/iterators/directory_iterator.cc:
+ 	Update expected behaviour on error.
+ 	* testsuite/experimental/filesystem/iterators/pop.cc: New.
+ 	* testsuite/experimental/filesystem/iterators/
+ 	recursive_directory_iterator.cc: Update expected behaviour on error.
+ 	* testsuite/experimental/filesystem/operations/copy.cc: Update
+ 	expected behaviour for copying directories with create_symlinks.
+ 	Verify that error_code arguments are cleared if there's no error.
+ 	Remove files created by tests. Test copying directories.
+ 	* testsuite/experimental/filesystem/operations/copy_file.cc: Remove
+ 	files created by tests.
+ 	* testsuite/experimental/filesystem/operations/create_symlink.cc: New.
+ 	* testsuite/experimental/filesystem/operations/equivalent.cc: New.
+ 	* testsuite/experimental/filesystem/operations/exists.cc: Test
+ 	overload taking an error_code.
+ 	* testsuite/experimental/filesystem/operations/is_empty.cc: New.
+ 	* testsuite/experimental/filesystem/operations/last_write_time.cc:
+ 	New.
+ 	* testsuite/experimental/filesystem/operations/permissions.cc: Test
+ 	overload taking error_code. Test symlink_nofollow on non-symlinks.
+ 	* testsuite/experimental/filesystem/operations/read_symlink.cc: New.
+ 	* testsuite/experimental/filesystem/operations/remove_all.cc: New.
+ 	* testsuite/experimental/filesystem/operations/temp_directory_path.cc:
+ 	Add testcase for inaccessible directory.
+ 	* testsuite/experimental/filesystem/path/construct/range.cc: Test
+ 	construction from input iterators with const value types.
+ 	* testsuite/experimental/filesystem/path/construct/string_view.cc:
+ 	New.
+ 	* testsuite/util/testsuite_fs.h (scoped_file): Define RAII helper.
+ 
+ 2016-12-07  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-12-06  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	Constrain optional's __constexpr_addressof in its return type
+ 	and use a constexpr addressof for optional, if available.
+ 	* include/experimental/optional (__constexpr_addressof):
+ 	Constrain in the return type instead of in a template parameter.
+ 	(_Has_addressof_mem)
+ 	(_Has_addressof_free, _Has_addressof, __constexpr_addressof):
+ 	Guard with #ifndef __cpp_lib_addressof_constexpr.
+ 	(operator->()): Use std::__addressof if it's constexpr.
+ 
+ 2016-12-06  Aditya Kumar  <hiraditya@msn.com>
+ 
+ 	* src/c++11/shared_ptr.cc (_Sp_locker::_Sp_locker(const void* p)): Add
+ 	noexcept on constructor.
+ 	(_Sp_locker::_Sp_locker(const void* p1, const void* p2)): Same.
+ 
+ 2016-12-01  Rainer Orth  <ro@CeBiTec.Uni-Bielefeld.DE>
+ 
+ 	Backport from mainline
+ 	2016-11-21  Rainer Orth  <ro@CeBiTec.Uni-Bielefeld.DE>
+ 
+ 	* acinclude.m4 (GLIBCXX_CHECK_MATH11_PROTO): Update comments.
+ 	(__CORRECT_ISO_CPP11_MATH_H_PROTO): Rename to ...
+ 	(__CORRECT_ISO_CPP11_MATH_H_PROTO_FP): ... this.
+ 	Add test for C++11 <math.h> integral overloads.
+ 	* configure: Regenerate.
+ 	* config.h.in: Regenerate.
+ 
+ 	* include/c_global/cmath [__cplusplus >= 201103L]: Reflect
+ 	__CORRECT_ISO_CPP11_MATH_H_PROTO to
+ 	__CORRECT_ISO_CPP11_MATH_H_PROTO_FP rename.
+ 	* include/c_global/cmath [_GLIBCXX_USE_C99_MATH &&
+ 	!_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC && __cplusplus >= 201103L]
+ 	(std::fpclassify): Wrap in !__CORRECT_ISO_CPP11_MATH_H_PROTO_INT.
+ 	(std::isfinite): Likewise.
+ 	(std::isinf): Likewise.
+ 	(std::isnan): Likewise.
+ 	(std::isnormal): Likewise.
+ 	(std::signbit): Likewise.
+ 	(std::isgreater): Likewise.
+ 	(std::isgreaterequal): Likewise.
+ 	(std::isless): Likewise.
+ 	(std::islessequal): Likewise.
+ 	(std::islessgreater): Likewise.
+ 	(std::isunordered): Likewise.
+ 	[__cplusplus >= 201103L && _GLIBCXX_USE_C99_MATH_TR1]
+ 	(std::acosh): Likewise.
+ 	(std::asinh): Likewise.
+ 	(std::atanh): Likewise.
+ 	(std::cbrt): Likewise.
+ 	(std::copysign): Likewise.
+ 	(std::erf): Likewise.
+ 	(std::erfc): Likewise.
+ 	(std::exp2): Likewise.
+ 	(std::expm1): Likewise.
+ 	(std::fdim): Likewise.
+ 	(std::fma): Likewise.
+ 	(std::fmax): Likewise.
+ 	(std::fmin): Likewise.
+ 	(std::hypot): Likewise.
+ 	(std::ilogb): Likewise.
+ 	(std::lgamma): Likewise.
+ 	(std::llrint): Likewise.
+ 	(std::llround): Likewise.
+ 	(std::log1p): Likewise.
+ 	(std::log2): Likewise.
+ 	(std::logb): Likewise.
+ 	(std::lrint): Likewise.
+ 	(std::lround): Likewise.
+ 	(std::nearbyint): Likewise.
+ 	(std::nextafter): Likewise.
+ 	(std::nexttoward): Likewise.
+ 	(std::remainder): Likewise.
+ 	(std::remquo): Likewise.
+ 	(std::rint): Likewise.
+ 	(std::round): Likewise.
+ 	(std::scalbln): Likewise.
+ 	(std::scalbn): Likewise.
+ 	(std::tgamma): Likewise.
+ 	(std::trunc): Likewise.
+ 	* include/tr1/cmath [_GLIBCXX_USE_C99_MATH_TR1 && __cplusplus >=
+ 	201103L]: Reflect __CORRECT_ISO_CPP11_MATH_H_PROTO to
+ 	__CORRECT_ISO_CPP11_MATH_H_PROTO_FP rename.
+ 
+ 2016-11-23  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/24_iterators/reverse_iterator/71771.cc: Replace calls to
+ 	C++14 std::rbegin and std::rend.  Use dg-options instead of
+ 	effective-target.
+ 
+ 2016-11-22  Uros Bizjak  <ubizjak@gmail.com>
+ 
+ 	* testsuite/Makefile.am
+ 	(check-DEJAGNU $(check_DEJAGNU_normal_targets)): Fix detection
+ 	of -j argument.
+ 	* testsuite/Makefile.in: Regenereate.
+ 
+ 2016-11-15  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/experimental/any/typedefs.cc: Fix license text.
+ 	* testsuite/experimental/chrono/value.cc: Likewise.
+ 	* testsuite/experimental/optional/assignment/1.cc: Likewise.
+ 	* testsuite/experimental/optional/assignment/2.cc: Likewise.
+ 	* testsuite/experimental/optional/assignment/3.cc: Likewise.
+ 	* testsuite/experimental/optional/assignment/4.cc: Likewise.
+ 	* testsuite/experimental/optional/assignment/5.cc: Likewise.
+ 	* testsuite/experimental/optional/assignment/6.cc: Likewise.
+ 	* testsuite/experimental/optional/cons/move.cc: Likewise.
+ 	* testsuite/experimental/optional/cons/value.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/cons/value.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/make_optional.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/observers/1.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/observers/2.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/observers/3.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/observers/4.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/observers/5.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/relops/1.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/relops/2.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/relops/3.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/relops/4.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/relops/5.cc: Likewise.
+ 	* testsuite/experimental/optional/constexpr/relops/6.cc: Likewise.
+ 	* testsuite/experimental/optional/make_optional.cc: Likewise.
+ 	* testsuite/experimental/optional/observers/1.cc: Likewise.
+ 	* testsuite/experimental/optional/observers/2.cc: Likewise.
+ 	* testsuite/experimental/optional/observers/3.cc: Likewise.
+ 	* testsuite/experimental/optional/observers/4.cc: Likewise.
+ 	* testsuite/experimental/optional/observers/5.cc: Likewise.
+ 	* testsuite/experimental/optional/relops/1.cc: Likewise.
+ 	* testsuite/experimental/optional/relops/2.cc: Likewise.
+ 	* testsuite/experimental/optional/relops/3.cc: Likewise.
+ 	* testsuite/experimental/optional/relops/4.cc: Likewise.
+ 	* testsuite/experimental/optional/relops/5.cc: Likewise.
+ 	* testsuite/experimental/optional/relops/6.cc: Likewise.
+ 	* testsuite/experimental/optional/requirements.cc: Likewise.
+ 	* testsuite/experimental/optional/swap/1.cc: Likewise.
+ 	* testsuite/experimental/optional/typedefs.cc: Likewise.
+ 	* testsuite/experimental/ratio/value.cc: Likewise.
+ 	* testsuite/experimental/string_view/typedefs.cc: Likewise.
+ 	* testsuite/experimental/system_error/value.cc: Likewise.
+ 	* testsuite/experimental/tuple/tuple_size.cc: Likewise.
+ 	* testsuite/experimental/type_traits/value.cc: Likewise.
+ 
+ 2016-10-20  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/78052
+ 	* include/bits/allocator.h (allocator<void>::construct)
+ 	(allocator<void>::destroy): Define.
+ 	* testsuite/20_util/allocator/void.cc: New test.
+ 
+ 2016-10-19  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/77990
+ 	* include/bits/unique_ptr.h (unique_ptr::unique_ptr(pointer)): Set
+ 	pointer member after value-initialization of tuple.
+ 	* testsuite/20_util/unique_ptr/assign/48635_neg.cc: Adjust dg-errors.
+ 	* testsuite/20_util/unique_ptr/cons/77990.cc: New test.
+ 
+ 2016-10-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline:
+ 	2016-10-10  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* doc/xml/manual/appendix_contributing.xml (contrib.organization):
+ 	Replace <literallayout> with nested <variablelist> elements. Update
+ 	some more outdated text.
+ 	* doc/html/*: Regenerate.
+ 
+ 	Backport from mainline:
+ 	2016-10-10  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* doc/xml/manual/appendix_contributing.xml (contrib.organization):
+ 	Describe other subdirectories and add markup. Remove outdated
+ 	reference to check-script target.
+ 
+ 2016-10-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline:
+ 	2016-10-13  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/26_numerics/random/default_random_engine.cc: Use VERIFY
+ 	instead of assert.
+ 
+ 2016-10-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline:
+ 	2016-10-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* include/experimental/string_view (basic_string_view::_S_compare):
+ 	Remove redundant const from return type.
+ 
+ 2016-10-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline:
+ 	2016-10-13  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* include/experimental/functional (boyer_moore_searcher)
+ 	(__boyer_moore_map_base, __boyer_moore_array_base): Qualify containers
+ 	with _GLIBCXX_STD_C.
+ 
+ 2016-10-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline:
+ 	2016-08-22  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/77322
+ 	* doc/xml/manual/intro.xml: Document DR 2062 change.
+ 	* include/std/functional (function::swap): Add noexcept.
+ 	(swap(function<Res(Args...)&, function<Res(Args...)&)): Likewise.
+ 	* testsuite/20_util/function/77322.cc: New test.
+ 
+ 2016-10-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline:
+ 	2016-08-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/20_util/reference_wrapper/invoke-2.cc: Fix invalid dg-do
+ 	directive and use effective target instead of dg-options.
+ 
+ 2016-10-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline:
+ 	2016-08-06  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/72820
+ 	* include/std/functional (_Function_base::_Base_manager::_M_clone):
+ 	Qualify new operator.
+ 	* testsuite/20_util/function/cons/72820.cc: New test.
+ 
+ 2016-10-17  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/77994
+ 	* include/experimental/algorithm (experimental::sample): Convert size
+ 	argument to iterator difference type. Fix invalid use of input
+ 	iterator. Defend against overloaded comma operator.
+ 
+ 2016-10-05  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/70564
+ 	* include/experimental/functional (_Not_fn): Add second parameter to
+ 	disambiguate copying from initialization by not_fn.
+ 	(not_fn): Add second argument to initialization.
+ 	* testsuite/experimental/functional/not_fn.cc: Copy call wrapper using
+ 	direct-initialization. Test abstract class.
+ 
+ 	PR libstdc++/77864
+ 	* include/bits/stl_map.h (map::map()): Use nothrow constructibility
+ 	of comparison function in conditional noexcept.
+ 	* include/bits/stl_multimap.h (multimap::multimap()): Likewise.
+ 	* include/bits/stl_multiset.h (multiset::multiset()): Likewise.
+ 	* include/bits/stl_set.h (set::set()): Likewise.
+ 	* testsuite/23_containers/map/cons/noexcept_default_construct.cc:
+ 	New test.
+ 	* testsuite/23_containers/multimap/cons/noexcept_default_construct.cc:
+ 	Likewise.
+ 	* testsuite/23_containers/multiset/cons/noexcept_default_construct.cc:
+ 	Likewise.
+ 	* testsuite/23_containers/set/cons/noexcept_default_construct.cc:
+ 	Likewise.
+ 
+ 2016-10-03  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/68323
+ 	PR libstdc++/77794
+ 	* config/abi/pre/gnu-versioned-namespace.ver: Add export for
+ 	__cxa_thread_atexit.
+ 	* include/Makefile.am: Add <experimental/lfts_config.h>
+ 	* include/Makefile.in: Regenerate.
+ 	* src/filesystem/Makefile.in: Likewise.
+ 	* include.bits/basic_string.h: Fix nesting of versioned namespaces.
+ 	* include/bits/c++config: Declare versioned namespaces for literals.
+ 	* include/bits/regex.h (basic_regex, match_results): Add workarounds
+ 	for PR c++/59256.
+ 	* include/bits/uniform_int_dist.h: Fix nesting of versioned namespace.
+ 	* include/std/chrono: Likewise.
+ 	* include/std/complex: Likewise.
+ 	* include/experimental/fs_fwd.h: Declare versioned namespace.
+ 	* include/experimental/lfts_config.h: Declare versioned namespaces.
+ 	* include/experimental/algorithm: Include
+ 	<experimental/lfts_config.h>.
+ 	* include/experimental/any: Likewise.
+ 	* include/experimental/chrono: Likewise.
+ 	* include/experimental/functional: Likewise.
+ 	* include/experimental/optional: Likewise.
+ 	* include/experimental/ratio: Likewise.
+ 	* include/experimental/system_error: Likewise.
+ 	* include/experimental/tuple: Likewise.
+ 	* include/experimental/type_traits: Likewise.
+ 	* include/experimental/string_view: Likewise. Fix nesting of
+ 	versioned namespaces.
+ 	* include/experimental/string_view.tcc: Reopen inline namespace for
+ 	non-inline function definitions.
+ 	* testsuite/17_intro/using_namespace_std_exp_neg.cc: New test.
+ 	* testsuite/20_util/duration/literals/range.cc: Adjust dg-error line.
+ 	* testsuite/experimental/any/misc/any_cast_neg.cc: Likewise.
+ 	* testsuite/ext/profile/mutex_extensions_neg.cc: Likewise.
+ 
+ 2016-09-28  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/77686
+ 	* include/std/functional (_Any_data): Add may_alias attribute.
+ 
+ 2016-09-27  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* include/debug/safe_iterator.h (_Safe_iterator::operator++()): Fix
+ 	lifetime of lock.
+ 
+ 2016-09-20  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* python/libstdcxx/v6/xmethods.py (DequeWorkerBase.__init__)
+ 	(DequeWorkerBase.index, VectorWorkerBase.get): Use // for division.
+ 
+ 2016-09-19  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/77645
+ 	* python/libstdcxx/v6/xmethods.py (DequeWorkerBase.__init__)
+ 	(DequeWorkerBase.index, VectorWorkerBase.get): Cast results of
+ 	division to int to work with Python 3.
+ 
+ 2016-08-23  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/23_containers/map/77334.cc: Use dg-options for C++11.
+ 
+ 	PR libstdc++/77334
+ 	* include/bits/stl_tree.h (_Rb_tree::_M_move_assign): New functions.
+ 	(_Rb_tree::operator=(_Rb_tree&&)): Dispatch to _M_move_assign.
+ 	Include _Compare in noexcept.
+ 	* testsuite/23_containers/map/77334.cc: New test.
+ 
+ 2016-08-23  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* doc/xml/api.xml: Replace hardcoded links for specific versions with
+ 	link to docs for all releases.
+ 	* doc/html/*: Regenerate.
+ 
+ 	* include/bits/stl_iterator.h
+ 	(operator-(reverse_iterator<Iter>, reverse_iterator<Iter>): Constrain
+ 	for C++11 and later.
+ 	* testsuite/24_iterators/reverse_iterator/71771.cc: New test.
+ 
+ 2016-08-06  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-08-05  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* include/std/functional (function::_Callable): Use lvalue in
+ 	result_of expression.
+ 	* testsuite/20_util/function/cons/refqual.cc: New test.
+ 
+ 	Backport from mainline
+ 	2016-07-22  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/71964
+ 	* include/bits/stl_tree.h (_Rb_tree(_Rb_tree&&)): Move allocator.
+ 	* testsuite/23_containers/set/allocator/71964.cc: New test.
+ 
+ 	Backport from mainline
+ 	2016-08-02  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/copy.cc:
+ 	Remove reundant check for _GLIBCXX_USE_WCHAR_T and fix char type.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/copy_assign.cc:
+ 	Likewise.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/minimal.cc:
+ 	Likewise.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/move.cc:
+ 	Likewise.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/move_assign.cc:
+ 	Likewise.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/noexcept.cc:
+ 	Likewise.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/swap.cc:
+ 	Likewise.
+ 
+ 	Backport from mainline
+ 	2016-01-18  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/69243
+ 	* include/std/functional (_Function_base::_M_not_empty_function):
+ 	Change overloads for pointers to take arguments by value.
+ 	* testsuite/20_util/function/cons/57465.cc: Add tests for
+ 	pointer-to-member cases.
+ 
+ 	* doc/xml/manual/status_cxx2011.xml: Change "mainline GCC SVN" to
+ 	refer to the release series.
+ 	* doc/xml/manual/status_cxx2014.xml: Likewise.
+ 	* doc/html/manual/status.xml: Regenerate.
+ 
+ 	* testsuite/lib/libstdc++.exp (check_v3_target_filesystem_ts): Improve
+ 	comments.
+ 
+ 2016-08-02  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/lib/libstdc++.exp (v3-build_support): Add
+ 	-fno-lto to additional flags for compiling libtestc++.a objects.
+ 
+ 2016-07-19  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2016-06-06  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/71320
+ 	* src/filesystem/ops.cc (permissions(const path&, perms, error_code&)):
+ 	Add or remove permissions according to perms argument.
+ 	* testsuite/experimental/filesystem/operations/permissions.cc: New
+ 	test.
+ 
+ 2016-07-12  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2015-10-02  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* testsuite/21_strings/basic_string/allocator/char/minimal.cc: Guard
+ 	explicit instantiation with check for new ABI.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/minimal.cc:
+ 	Likewise. Use wchar_t as char_type.
+ 
+ 	Backport from mainline
+ 	2015-09-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/58265
+ 	* doc/xml/manual/intro.xml: Document LWG 2063 and 2064 resolutions.
+ 	* doc/html/manual/bugs.html: Regenerate.
+ 	* include/bits/basic_string.h (basic_string): Implement N4258. Add
+ 	correct exception-specifications and propagate allocators correctly.
+ 	* include/bits/basic_string.tcc (basic_string::swap): Propagate
+ 	allocators correctly.
+ 	* include/debug/string (__gnu_debug::basic_string): Add correct
+ 	exceptions-specifications and allcoator-extended constructors.
+ 	* testsuite/21_strings/basic_string/allocator/char/copy.cc: New.
+ 	* testsuite/21_strings/basic_string/allocator/char/copy_assign.cc:
+ 	New.
+ 	* testsuite/21_strings/basic_string/allocator/char/minimal.cc: New.
+ 	* testsuite/21_strings/basic_string/allocator/char/move.cc: New.
+ 	* testsuite/21_strings/basic_string/allocator/char/move_assign.cc:
+ 	New.
+ 	* testsuite/21_strings/basic_string/allocator/char/noexcept.cc: New.
+ 	* testsuite/21_strings/basic_string/allocator/char/swap.cc: New.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/copy.cc: New.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/copy_assign.cc:
+ 	New.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/minimal.cc: New.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/move.cc: New.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/move_assign.cc:
+ 	New.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/noexcept.cc: New.
+ 	* testsuite/21_strings/basic_string/allocator/wchar_t/swap.cc: New.
+ 	* testsuite/util/testsuite_allocator.h (tracker_allocator): Define
+ 	defaulted assignment operators.
+ 
+ 2016-07-08  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backport from mainline
+ 	2015-06-02  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* doc/html/ext/lwg-active.html: Update to R93.
+ 	* doc/html/ext/lwg-closed.html: Likewise.
+ 	* doc/html/ext/lwg-defects.html: Likewise.
+ 	* doc/html/manual/*: Regenerate.
+ 	* doc/xml/manual/intro.xml: Document status of several DRs.
+ 
+ 2016-07-04  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	Backport from mainline
+ 	2016-07-04  Ville Voutilainen  <ville.voutilainen@gmail.com>
+ 
+ 	PR libstdc++/71313
+ 	* src/filesystem/ops.cc (remove_all(const path&, error_code&)):
+ 	Call remove_all for children of a directory.
+ 	* testsuite/experimental/filesystem/operations/create_directories.cc:
+ 	Adjust.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/libstdc++-v3/acinclude.m4 gcc-5.5.0/libstdc++-v3/acinclude.m4
*** gcc-5.4.0/libstdc++-v3/acinclude.m4	Tue Nov 24 13:25:07 2015
--- gcc-5.5.0/libstdc++-v3/acinclude.m4	Tue Dec 13 11:53:03 2016
*************** AC_DEFUN([GLIBCXX_CHECK_STDIO_PROTO], [
*** 1897,1903 ****
  ])
  
  dnl
! dnl Check whether required C++11 overloads are present in <math.h>.
  dnl
  AC_DEFUN([GLIBCXX_CHECK_MATH11_PROTO], [
  
--- 1897,1904 ----
  ])
  
  dnl
! dnl Check whether required C++11 overloads for floating point and integral
! dnl types are present in <math.h>.
  dnl
  AC_DEFUN([GLIBCXX_CHECK_MATH11_PROTO], [
  
*************** AC_DEFUN([GLIBCXX_CHECK_MATH11_PROTO], [
*** 1908,1917 ****
  
    case "$host" in
      *-*-solaris2.*)
!       # Solaris 12 introduced the C++11 <math.h> overloads.  A backport to
!       # a Solaris 11.3 SRU is likely, maybe even a Solaris 10 patch.
!       AC_MSG_CHECKING([for C++11 <math.h> overloads])
!       AC_CACHE_VAL(glibcxx_cv_math11_overload, [
  	AC_COMPILE_IFELSE([AC_LANG_SOURCE(
  	  [#include <math.h>
  	   #undef isfinite
--- 1909,1918 ----
  
    case "$host" in
      *-*-solaris2.*)
!       # Solaris 12 Build 86, Solaris 11.3 SRU 3.6, and Solaris 10 Patch
!       # 11996[67]-02 introduced the C++11 <math.h> floating point overloads.
!       AC_MSG_CHECKING([for C++11 <math.h> floating point overloads])
!       AC_CACHE_VAL(glibcxx_cv_math11_fp_overload, [
  	AC_COMPILE_IFELSE([AC_LANG_SOURCE(
  	  [#include <math.h>
  	   #undef isfinite
*************** AC_DEFUN([GLIBCXX_CHECK_MATH11_PROTO], [
*** 1920,1940 ****
  	     { return __builtin_isfinite(__x); }
  	   }
  	])],
! 	[glibcxx_cv_math11_overload=no],
! 	[glibcxx_cv_math11_overload=yes]
        )])
  
        # autoheader cannot handle indented templates.
!       AH_VERBATIM([__CORRECT_ISO_CPP11_MATH_H_PROTO],
!         [/* Define if all C++11 overloads are available in <math.h>.  */
  #if __cplusplus >= 201103L
! #undef __CORRECT_ISO_CPP11_MATH_H_PROTO
  #endif])
  
!       if test $glibcxx_cv_math11_overload = yes; then
!         AC_DEFINE(__CORRECT_ISO_CPP11_MATH_H_PROTO)
        fi
!       AC_MSG_RESULT([$glibcxx_cv_math11_overload])
        ;;
    esac
  
--- 1921,1993 ----
  	     { return __builtin_isfinite(__x); }
  	   }
  	])],
! 	[glibcxx_cv_math11_fp_overload=no],
! 	[glibcxx_cv_math11_fp_overload=yes]
        )])
  
        # autoheader cannot handle indented templates.
!       AH_VERBATIM([__CORRECT_ISO_CPP11_MATH_H_PROTO_FP],
!         [/* Define if all C++11 floating point overloads are available in <math.h>.  */
  #if __cplusplus >= 201103L
! #undef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
  #endif])
  
!       if test $glibcxx_cv_math11_fp_overload = yes; then
!         AC_DEFINE(__CORRECT_ISO_CPP11_MATH_H_PROTO_FP)
        fi
!       AC_MSG_RESULT([$glibcxx_cv_math11_fp_overload])
! 
!       # Solaris 12 Build 90, Solaris 11.3 SRU 5.6, and Solaris 10 Patch
!       # 11996[67]-02 introduced the C++11 <math.h> integral type overloads.
!       AC_MSG_CHECKING([for C++11 <math.h> integral type overloads])
!       AC_CACHE_VAL(glibcxx_cv_math11_int_overload, [
! 	AC_COMPILE_IFELSE([AC_LANG_SOURCE(
! 	  [#include <math.h>
! 	   namespace std {
! 	     template<typename _Tp>
! 	       struct __is_integer;
! 	     template<>
! 	       struct __is_integer<int>
! 	       {
! 	         enum { __value = 1 };
! 	       };
! 	   }
! 	   namespace __gnu_cxx {
! 	     template<bool, typename>
! 	       struct __enable_if;
! 	     template<typename _Tp>
! 	       struct __enable_if<true, _Tp>
! 	       { typedef _Tp __type; };
! 	   }
! 	   namespace std {
! 	     template<typename _Tp>
! 	       constexpr typename __gnu_cxx::__enable_if
! 	       		 <__is_integer<_Tp>::__value, double>::__type
! 	       log2(_Tp __x)
! 	       { return __builtin_log2(__x); }
! 	   }
! 	   int
! 	   main (void)
! 	   {
! 	     int i = 1000;
! 	     return std::log2(i);
! 	   }
! 	])],
! 	[glibcxx_cv_math11_int_overload=no],
! 	[glibcxx_cv_math11_int_overload=yes]
!       )])
! 
!       # autoheader cannot handle indented templates.
!       AH_VERBATIM([__CORRECT_ISO_CPP11_MATH_H_PROTO_INT],
!         [/* Define if all C++11 integral type overloads are available in <math.h>.  */
! #if __cplusplus >= 201103L
! #undef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
! #endif])
! 
!       if test $glibcxx_cv_math11_int_overload = yes; then
!         AC_DEFINE(__CORRECT_ISO_CPP11_MATH_H_PROTO_INT)
!       fi
!       AC_MSG_RESULT([$glibcxx_cv_math11_int_overload])
        ;;
    esac
  
*************** dnl
*** 4016,4021 ****
--- 4069,4075 ----
    AC_CACHE_VAL(glibcxx_cv_realpath, [dnl
      GCC_TRY_COMPILE_OR_LINK(
        [
+        #include <limits.h>
         #include <stdlib.h>
         #include <unistd.h>
        ],
*************** dnl
*** 4106,4112 ****
        gnu* | linux* | solaris*)
          GCC_TRY_COMPILE_OR_LINK(
            [#include <sys/sendfile.h>],
!           [sendfile(1, 2, (off_t*)NULL, sizeof 1);],
            [glibcxx_cv_sendfile=yes],
            [glibcxx_cv_sendfile=no])
          ;;
--- 4160,4166 ----
        gnu* | linux* | solaris*)
          GCC_TRY_COMPILE_OR_LINK(
            [#include <sys/sendfile.h>],
!           [sendfile(1, 2, (off_t*)0, sizeof 1);],
            [glibcxx_cv_sendfile=yes],
            [glibcxx_cv_sendfile=no])
          ;;
*************** dnl
*** 4116,4122 ****
      esac
    ])
    if test $glibcxx_cv_sendfile = yes; then
!     AC_DEFINE(_GLIBCXX_USE_SENDFILE, 1, [Define if sendfile is available in <sys/stat.h>.])
    fi
    AC_MSG_RESULT($glibcxx_cv_sendfile)
  dnl
--- 4170,4176 ----
      esac
    ])
    if test $glibcxx_cv_sendfile = yes; then
!     AC_DEFINE(_GLIBCXX_USE_SENDFILE, 1, [Define if sendfile is available in <sys/sendfile.h>.])
    fi
    AC_MSG_RESULT($glibcxx_cv_sendfile)
  dnl
diff -Nrcpad gcc-5.4.0/libstdc++-v3/config/abi/pre/gnu-versioned-namespace.ver gcc-5.5.0/libstdc++-v3/config/abi/pre/gnu-versioned-namespace.ver
*** gcc-5.4.0/libstdc++-v3/config/abi/pre/gnu-versioned-namespace.ver	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/config/abi/pre/gnu-versioned-namespace.ver	Mon Oct  3 14:42:06 2016
*************** CXXABI_2.0 {
*** 186,191 ****
--- 186,192 ----
      __cxa_guard_release;
      __cxa_pure_virtual;
      __cxa_rethrow;
+     __cxa_thread_atexit;
      __cxa_throw;
      __cxa_type_match;
      __cxa_vec_cctor;
diff -Nrcpad gcc-5.4.0/libstdc++-v3/config/io/basic_file_stdio.cc gcc-5.5.0/libstdc++-v3/config/io/basic_file_stdio.cc
*** gcc-5.4.0/libstdc++-v3/config/io/basic_file_stdio.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/config/io/basic_file_stdio.cc	Mon Sep  4 17:09:05 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 195,205 ****
      __basic_file* __ret = NULL;
      if (!this->is_open() && __file)
        {
! 	int __err;
! 	errno = 0;	
  	do
! 	  __err = this->sync();
  	while (__err && errno == EINTR);
  	if (!__err)
  	  {
  	    _M_cfile = __file;
--- 195,207 ----
      __basic_file* __ret = NULL;
      if (!this->is_open() && __file)
        {
! 	int __err, __save_errno = errno;
! 	// POSIX guarantees that fflush sets errno on error, but C doesn't.
! 	errno = 0;
  	do
! 	  __err = fflush(__file);
  	while (__err && errno == EINTR);
+ 	errno = __save_errno;
  	if (!__err)
  	  {
  	    _M_cfile = __file;
diff -Nrcpad gcc-5.4.0/libstdc++-v3/config/os/mingw32-w64/error_constants.h gcc-5.5.0/libstdc++-v3/config/os/mingw32-w64/error_constants.h
*** gcc-5.4.0/libstdc++-v3/config/os/mingw32-w64/error_constants.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/config/os/mingw32-w64/error_constants.h	Thu May 18 15:30:57 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 41,62 ****
  // replaced by Winsock WSA-prefixed equivalents.
    enum class errc
      {
! //    address_family_not_supported = 		EAFNOSUPPORT,
! //    address_in_use = 				EADDRINUSE,
! //    address_not_available = 			EADDRNOTAVAIL,
! //    already_connected = 			EISCONN,
        argument_list_too_long = 			E2BIG,
        argument_out_of_domain = 			EDOM,
        bad_address = 				EFAULT,
        bad_file_descriptor = 			EBADF,
! //    bad_message = 				EBADMSG,
        broken_pipe = 				EPIPE,
! //    connection_aborted = 			ECONNABORTED,
! //    connection_already_in_progress = 		EALREADY,
! //    connection_refused = 			ECONNREFUSED,
! //    connection_reset = 			ECONNRESET,
! //    cross_device_link = 			EXDEV,
! //    destination_address_required = 		EDESTADDRREQ,
        device_or_resource_busy = 		EBUSY,
        directory_not_empty = 			ENOTEMPTY,
        executable_format_error = 		ENOEXEC,
--- 41,64 ----
  // replaced by Winsock WSA-prefixed equivalents.
    enum class errc
      {
!       address_family_not_supported = 		EAFNOSUPPORT,
!       address_in_use = 				EADDRINUSE,
!       address_not_available = 			EADDRNOTAVAIL,
!       already_connected = 			EISCONN,
        argument_list_too_long = 			E2BIG,
        argument_out_of_domain = 			EDOM,
        bad_address = 				EFAULT,
        bad_file_descriptor = 			EBADF,
! #ifdef _GLIBCXX_HAVE_EBADMSG
!       bad_message = 				EBADMSG,
! #endif
        broken_pipe = 				EPIPE,
!       connection_aborted = 			ECONNABORTED,
!       connection_already_in_progress = 		EALREADY,
!       connection_refused = 			ECONNREFUSED,
!       connection_reset = 			ECONNRESET,
!       cross_device_link = 			EXDEV,
!       destination_address_required = 		EDESTADDRREQ,
        device_or_resource_busy = 		EBUSY,
        directory_not_empty = 			ENOTEMPTY,
        executable_format_error = 		ENOEXEC,
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 64,71 ****
        file_too_large = 				EFBIG,
        filename_too_long = 			ENAMETOOLONG,
        function_not_supported = 			ENOSYS,
! //    host_unreachable = 			EHOSTUNREACH,
! //    identifier_removed = 			EIDRM,
        illegal_byte_sequence = 			EILSEQ,
        inappropriate_io_control_operation = 	ENOTTY,
        interrupted = 				EINTR,
--- 66,75 ----
        file_too_large = 				EFBIG,
        filename_too_long = 			ENAMETOOLONG,
        function_not_supported = 			ENOSYS,
!       host_unreachable = 			EHOSTUNREACH,
! #ifdef _GLIBCXX_HAVE_EIDRM
!       identifier_removed = 			EIDRM,
! #endif
        illegal_byte_sequence = 			EILSEQ,
        inappropriate_io_control_operation = 	ENOTTY,
        interrupted = 				EINTR,
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 73,139 ****
        invalid_seek = 				ESPIPE,
        io_error = 				EIO,
        is_a_directory = 				EISDIR,
! //    message_size = 				EMSGSIZE,
! //    network_down = 				ENETDOWN,
! //    network_reset = 				ENETRESET,
! //    network_unreachable = 			ENETUNREACH,
! //    no_buffer_space = 			ENOBUFS,
  #ifdef _GLIBCXX_HAVE_ECHILD
        no_child_process = 			ECHILD,
  #endif
! //    no_link = 				ENOLINK,
        no_lock_available = 			ENOLCK,
! //    no_message_available = 			ENODATA,
! //    no_message = 				ENOMSG,
! //    no_protocol_option = 			ENOPROTOOPT,
  #ifdef _GLIBCXX_HAVE_ENOSPC
        no_space_on_device = 			ENOSPC,
  #endif
! //    no_stream_resources = 			ENOSR,
        no_such_device_or_address = 		ENXIO,
        no_such_device = 				ENODEV,
        no_such_file_or_directory = 		ENOENT,
        no_such_process = 			ESRCH,
        not_a_directory = 			ENOTDIR,
! //    not_a_socket = 				ENOTSOCK,
! //    not_a_stream = 				ENOSTR,
! //    not_connected = 				ENOTCONN,
        not_enough_memory = 			ENOMEM,
  #ifdef _GLIBCXX_HAVE_ENOTSUP
        not_supported = 				ENOTSUP,
  #endif
! //    operation_canceled = 			ECANCELED,
! //    operation_in_progress = 			EINPROGRESS,
  #ifdef _GLIBCXX_HAVE_EPERM
        operation_not_permitted = 		EPERM,
  #endif
! //    operation_not_supported = 		EOPNOTSUPP,
  #ifdef _GLIBCXX_HAVE_EWOULDBLOCK
        operation_would_block = 			EWOULDBLOCK,
  #endif
! //    owner_dead = 				EOWNERDEAD,
        permission_denied = 			EACCES,
! //    protocol_error = 				EPROTO,
! //    protocol_not_supported = 			EPROTONOSUPPORT,
        read_only_file_system = 			EROFS,
        resource_deadlock_would_occur = 		EDEADLK,
        resource_unavailable_try_again = 		EAGAIN,
        result_out_of_range = 			ERANGE,
! //    state_not_recoverable = 			ENOTRECOVERABLE,
! //    stream_timeout = 				ETIME,
! //    text_file_busy = 				ETXTBSY,
  #ifdef _GLIBCXX_HAVE_ETIMEDOUT
        timed_out = 				ETIMEDOUT,
  #endif
        too_many_files_open_in_system = 		ENFILE,
        too_many_files_open = 			EMFILE,
!       too_many_links = 				EMLINK
! //    too_many_symbolic_link_levels = 		ELOOP,
  #ifdef _GLIBCXX_HAVE_EOVERFLOW
! 	,
!       value_too_large = 			EOVERFLOW
  #endif
! //    wrong_protocol_type = 			EPROTOTYPE
     };
  
  _GLIBCXX_END_NAMESPACE_VERSION
--- 77,160 ----
        invalid_seek = 				ESPIPE,
        io_error = 				EIO,
        is_a_directory = 				EISDIR,
!       message_size = 				EMSGSIZE,
!       network_down = 				ENETDOWN,
!       network_reset = 				ENETRESET,
!       network_unreachable = 			ENETUNREACH,
!       no_buffer_space = 			ENOBUFS,
  #ifdef _GLIBCXX_HAVE_ECHILD
        no_child_process = 			ECHILD,
  #endif
! #ifdef _GLIBCXX_HAVE_ENOLINK
!       no_link = 				ENOLINK,
! #endif
        no_lock_available = 			ENOLCK,
! #ifdef _GLIBCXX_HAVE_ENODATA
!       no_message_available = 			ENODATA,
! #endif
! #ifdef _GLIBCXX_HAVE_ENOMSG
!       no_message = 				ENOMSG,
! #endif
!       no_protocol_option = 			ENOPROTOOPT,
  #ifdef _GLIBCXX_HAVE_ENOSPC
        no_space_on_device = 			ENOSPC,
  #endif
! #ifdef _GLIBCXX_HAVE_ENOSR
!       no_stream_resources = 			ENOSR,
! #endif
        no_such_device_or_address = 		ENXIO,
        no_such_device = 				ENODEV,
        no_such_file_or_directory = 		ENOENT,
        no_such_process = 			ESRCH,
        not_a_directory = 			ENOTDIR,
!       not_a_socket = 				ENOTSOCK,
! #ifdef _GLIBCXX_HAVE_ENOSTR
!       not_a_stream = 				ENOSTR,
! #endif
!       not_connected = 				ENOTCONN,
        not_enough_memory = 			ENOMEM,
  #ifdef _GLIBCXX_HAVE_ENOTSUP
        not_supported = 				ENOTSUP,
  #endif
!       operation_canceled = 			ECANCELED,
!       operation_in_progress = 			EINPROGRESS,
  #ifdef _GLIBCXX_HAVE_EPERM
        operation_not_permitted = 		EPERM,
  #endif
!       operation_not_supported = 		EOPNOTSUPP,
  #ifdef _GLIBCXX_HAVE_EWOULDBLOCK
        operation_would_block = 			EWOULDBLOCK,
  #endif
! #ifdef _GLIBCXX_HAVE_EOWNERDEAD
!       owner_dead = 				EOWNERDEAD,
! #endif
        permission_denied = 			EACCES,
!       protocol_error = 				EPROTO,
!       protocol_not_supported = 			EPROTONOSUPPORT,
        read_only_file_system = 			EROFS,
        resource_deadlock_would_occur = 		EDEADLK,
        resource_unavailable_try_again = 		EAGAIN,
        result_out_of_range = 			ERANGE,
! #ifdef _GLIBCXX_HAVE_ENOTRECOVERABLE
!       state_not_recoverable = 			ENOTRECOVERABLE,
! #endif
! #ifdef _GLIBCXX_HAVE_ETIME
!       stream_timeout = 				ETIME,
! #endif
! #ifdef _GLIBCXX_HAVE_ETXTBSY
!       text_file_busy = 				ETXTBSY,
! #endif
  #ifdef _GLIBCXX_HAVE_ETIMEDOUT
        timed_out = 				ETIMEDOUT,
  #endif
        too_many_files_open_in_system = 		ENFILE,
        too_many_files_open = 			EMFILE,
!       too_many_links = 				EMLINK,
!       too_many_symbolic_link_levels = 		ELOOP,
  #ifdef _GLIBCXX_HAVE_EOVERFLOW
!       value_too_large = 			EOVERFLOW,
  #endif
!       wrong_protocol_type = 			EPROTOTYPE
     };
  
  _GLIBCXX_END_NAMESPACE_VERSION
diff -Nrcpad gcc-5.4.0/libstdc++-v3/config.h.in gcc-5.5.0/libstdc++-v3/config.h.in
*** gcc-5.4.0/libstdc++-v3/config.h.in	Tue Nov 24 13:25:07 2015
--- gcc-5.5.0/libstdc++-v3/config.h.in	Tue Dec 13 11:52:59 2016
***************
*** 891,897 ****
  /* Define if _SC_NPROC_ONLN is available in <unistd.h>. */
  #undef _GLIBCXX_USE_SC_NPROC_ONLN
  
! /* Define if sendfile is available in <sys/stat.h>. */
  #undef _GLIBCXX_USE_SENDFILE
  
  /* Define if struct stat has timespec members. */
--- 891,897 ----
  /* Define if _SC_NPROC_ONLN is available in <unistd.h>. */
  #undef _GLIBCXX_USE_SC_NPROC_ONLN
  
! /* Define if sendfile is available in <sys/sendfile.h>. */
  #undef _GLIBCXX_USE_SENDFILE
  
  /* Define if struct stat has timespec members. */
***************
*** 919,927 ****
  /* Define to 1 if mutex_timedlock is available. */
  #undef _GTHREAD_USE_MUTEX_TIMEDLOCK
  
! /* Define if all C++11 overloads are available in <math.h>.  */
  #if __cplusplus >= 201103L
! #undef __CORRECT_ISO_CPP11_MATH_H_PROTO
  #endif
  
  #if defined (HAVE__ACOSF) && ! defined (HAVE_ACOSF)
--- 919,932 ----
  /* Define to 1 if mutex_timedlock is available. */
  #undef _GTHREAD_USE_MUTEX_TIMEDLOCK
  
! /* Define if all C++11 floating point overloads are available in <math.h>.  */
  #if __cplusplus >= 201103L
! #undef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
! #endif
! 
! /* Define if all C++11 integral type overloads are available in <math.h>.  */
! #if __cplusplus >= 201103L
! #undef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
  #endif
  
  #if defined (HAVE__ACOSF) && ! defined (HAVE_ACOSF)
diff -Nrcpad gcc-5.4.0/libstdc++-v3/configure gcc-5.5.0/libstdc++-v3/configure
*** gcc-5.4.0/libstdc++-v3/configure	Thu Nov 26 13:51:04 2015
--- gcc-5.5.0/libstdc++-v3/configure	Tue Dec 13 11:53:03 2016
*************** ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
*** 17616,17626 ****
  
    case "$host" in
      *-*-solaris2.*)
!       # Solaris 12 introduced the C++11 <math.h> overloads.  A backport to
!       # a Solaris 11.3 SRU is likely, maybe even a Solaris 10 patch.
!       { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++11 <math.h> overloads" >&5
! $as_echo_n "checking for C++11 <math.h> overloads... " >&6; }
!       if test "${glibcxx_cv_math11_overload+set}" = set; then :
    $as_echo_n "(cached) " >&6
  else
  
--- 17616,17626 ----
  
    case "$host" in
      *-*-solaris2.*)
!       # Solaris 12 Build 86, Solaris 11.3 SRU 3.6, and Solaris 10 Patch
!       # 11996[67]-02 introduced the C++11 <math.h> floating point overloads.
!       { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++11 <math.h> floating point overloads" >&5
! $as_echo_n "checking for C++11 <math.h> floating point overloads... " >&6; }
!       if test "${glibcxx_cv_math11_fp_overload+set}" = set; then :
    $as_echo_n "(cached) " >&6
  else
  
*************** else
*** 17635,17643 ****
  
  _ACEOF
  if ac_fn_cxx_try_compile "$LINENO"; then :
!   glibcxx_cv_math11_overload=no
  else
!   glibcxx_cv_math11_overload=yes
  
  fi
  rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
--- 17635,17643 ----
  
  _ACEOF
  if ac_fn_cxx_try_compile "$LINENO"; then :
!   glibcxx_cv_math11_fp_overload=no
  else
!   glibcxx_cv_math11_fp_overload=yes
  
  fi
  rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
*************** fi
*** 17647,17658 ****
        # autoheader cannot handle indented templates.
  
  
!       if test $glibcxx_cv_math11_overload = yes; then
!         $as_echo "#define __CORRECT_ISO_CPP11_MATH_H_PROTO 1" >>confdefs.h
  
        fi
!       { $as_echo "$as_me:${as_lineno-$LINENO}: result: $glibcxx_cv_math11_overload" >&5
! $as_echo "$glibcxx_cv_math11_overload" >&6; }
        ;;
    esac
  
--- 17647,17720 ----
        # autoheader cannot handle indented templates.
  
  
!       if test $glibcxx_cv_math11_fp_overload = yes; then
!         $as_echo "#define __CORRECT_ISO_CPP11_MATH_H_PROTO_FP 1" >>confdefs.h
  
        fi
!       { $as_echo "$as_me:${as_lineno-$LINENO}: result: $glibcxx_cv_math11_fp_overload" >&5
! $as_echo "$glibcxx_cv_math11_fp_overload" >&6; }
! 
!       # Solaris 12 Build 90, Solaris 11.3 SRU 5.6, and Solaris 10 Patch
!       # 11996[67]-02 introduced the C++11 <math.h> integral type overloads.
!       { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++11 <math.h> integral type overloads" >&5
! $as_echo_n "checking for C++11 <math.h> integral type overloads... " >&6; }
!       if test "${glibcxx_cv_math11_int_overload+set}" = set; then :
!   $as_echo_n "(cached) " >&6
! else
! 
! 	cat confdefs.h - <<_ACEOF >conftest.$ac_ext
! /* end confdefs.h.  */
! #include <math.h>
! 	   namespace std {
! 	     template<typename _Tp>
! 	       struct __is_integer;
! 	     template<>
! 	       struct __is_integer<int>
! 	       {
! 	         enum { __value = 1 };
! 	       };
! 	   }
! 	   namespace __gnu_cxx {
! 	     template<bool, typename>
! 	       struct __enable_if;
! 	     template<typename _Tp>
! 	       struct __enable_if<true, _Tp>
! 	       { typedef _Tp __type; };
! 	   }
! 	   namespace std {
! 	     template<typename _Tp>
! 	       constexpr typename __gnu_cxx::__enable_if
! 	       		 <__is_integer<_Tp>::__value, double>::__type
! 	       log2(_Tp __x)
! 	       { return __builtin_log2(__x); }
! 	   }
! 	   int
! 	   main (void)
! 	   {
! 	     int i = 1000;
! 	     return std::log2(i);
! 	   }
! 
! _ACEOF
! if ac_fn_cxx_try_compile "$LINENO"; then :
!   glibcxx_cv_math11_int_overload=no
! else
!   glibcxx_cv_math11_int_overload=yes
! 
! fi
! rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
! fi
! 
! 
!       # autoheader cannot handle indented templates.
! 
! 
!       if test $glibcxx_cv_math11_int_overload = yes; then
!         $as_echo "#define __CORRECT_ISO_CPP11_MATH_H_PROTO_INT 1" >>confdefs.h
! 
!       fi
!       { $as_echo "$as_me:${as_lineno-$LINENO}: result: $glibcxx_cv_math11_int_overload" >&5
! $as_echo "$glibcxx_cv_math11_int_overload" >&6; }
        ;;
    esac
  
*************** else
*** 79069,79074 ****
--- 79131,79137 ----
    cat confdefs.h - <<_ACEOF >conftest.$ac_ext
  /* end confdefs.h.  */
  
+        #include <limits.h>
         #include <stdlib.h>
         #include <unistd.h>
  
*************** fi
*** 79101,79106 ****
--- 79164,79170 ----
  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
  /* end confdefs.h.  */
  
+        #include <limits.h>
         #include <stdlib.h>
         #include <unistd.h>
  
*************** else
*** 79400,79406 ****
  int
  main ()
  {
! sendfile(1, 2, (off_t*)NULL, sizeof 1);
    ;
    return 0;
  }
--- 79464,79470 ----
  int
  main ()
  {
! sendfile(1, 2, (off_t*)0, sizeof 1);
    ;
    return 0;
  }
*************** cat confdefs.h - <<_ACEOF >conftest.$ac_
*** 79421,79427 ****
  int
  main ()
  {
! sendfile(1, 2, (off_t*)NULL, sizeof 1);
    ;
    return 0;
  }
--- 79485,79491 ----
  int
  main ()
  {
! sendfile(1, 2, (off_t*)0, sizeof 1);
    ;
    return 0;
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/doxygen/mainpage.html gcc-5.5.0/libstdc++-v3/doc/doxygen/mainpage.html
*** gcc-5.4.0/libstdc++-v3/doc/doxygen/mainpage.html	Wed Mar 26 06:27:35 2008
--- gcc-5.5.0/libstdc++-v3/doc/doxygen/mainpage.html	Wed Sep 13 10:22:50 2017
***************
*** 28,34 ****
  
  <p>There are two types of documentation for libstdc++.  One is the
     distribution documentation, which can be read online
!    <a href="http://gcc.gnu.org/onlinedocs/libstdc++/index.html">here</a>
     or offline from the file doc/html/index.html in the library source
     directory.
  </p>
--- 28,34 ----
  
  <p>There are two types of documentation for libstdc++.  One is the
     distribution documentation, which can be read online
!    <a href="https://gcc.gnu.org/onlinedocs/libstdc++/index.html">here</a>
     or offline from the file doc/html/index.html in the library source
     directory.
  </p>
***************
*** 78,88 ****
     pages.  See the section "Documentation Style"
     in <code>doc/xml/manual/appendix_contributing.xml</code> in the
     source tree for how to create (and write) the doxygen markup.
!   This style guide can also be viewed on the <a href="http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01apas04.html">web</a>.
  
  <h2>License, Copyright, and Other Lawyerly Verbosity</h2>
  <p>The libstdc++ documentation is released under
!    <a href="http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt01ch01s02.html">
     these terms</a>.
  </p>
  <p>Part of the generated documentation involved comments and notes from
--- 78,88 ----
     pages.  See the section "Documentation Style"
     in <code>doc/xml/manual/appendix_contributing.xml</code> in the
     source tree for how to create (and write) the doxygen markup.
!   This style guide can also be viewed on the <a href="https://gcc.gnu.org/onlinedocs/libstdc++/manual/documentation_hacking.html">web</a>.
  
  <h2>License, Copyright, and Other Lawyerly Verbosity</h2>
  <p>The libstdc++ documentation is released under
!    <a href="https://gcc.gnu.org/onlinedocs/libstdc++/manual/appendix_gpl.html">
     these terms</a>.
  </p>
  <p>Part of the generated documentation involved comments and notes from
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/api.html gcc-5.5.0/libstdc++-v3/doc/html/api.html
*** gcc-5.4.0/libstdc++-v3/doc/html/api.html	Sat Jun 14 20:22:10 2014
--- gcc-5.5.0/libstdc++-v3/doc/html/api.html	Tue Aug 23 12:23:16 2016
***************
*** 20,61 ****
    member functions for the library classes, finding out what is in a
    particular include file, looking at inheritance diagrams, etc.
  </p><p>
!   The API documentation, rendered into HTML, can be viewed online:
! </p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-3.4/index.html" target="_top">for the 3.4 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-4.1/index.html" target="_top">for the 4.1 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-4.2/index.html" target="_top">for the 4.2 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-4.3/index.html" target="_top">for the 4.3 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-4.4/index.html" target="_top">for the 4.4 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-api-4.5/index.html" target="_top">for the 4.5 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-api-4.6/index.html" target="_top">for the 4.6 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/gcc-4.7.4/libstdc++/api/" target="_top">for the 4.7.4 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/gcc-4.8.3/libstdc++/api/" target="_top">for the 4.8.3 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/gcc-4.9.0/libstdc++/api/" target="_top">for the 4.9.0 release
!       </a>
!     </p></li><li class="listitem"><p>
!       <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/index.html" target="_top">"the latest collection"
!       </a>
!       (For the main development tree; see the date on the first page.)
!     </p></li></ul></div><p>
    The rendered HTML, as above, is also available for download on the
    gcc.gnu.org site in a directory located at
     <code class="literal">&lt;URL:ftp://gcc.gnu.org/pub/gcc/libstdc++/doxygen/&gt;</code>.
--- 20,33 ----
    member functions for the library classes, finding out what is in a
    particular include file, looking at inheritance diagrams, etc.
  </p><p>
!   The API documentation, rendered into HTML, can be viewed online
!   <a class="link" href="http://gcc.gnu.org/onlinedocs/" target="_top">for each GCC release</a>
!   and
!   <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/index.html" target="_top">
!   for the main development tree
!   </a>
!   (see the date on the first page).
! </p><p>
    The rendered HTML, as above, is also available for download on the
    gcc.gnu.org site in a directory located at
     <code class="literal">&lt;URL:ftp://gcc.gnu.org/pub/gcc/libstdc++/doxygen/&gt;</code>.
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/ext/lwg-active.html gcc-5.5.0/libstdc++-v3/doc/html/ext/lwg-active.html
*** gcc-5.4.0/libstdc++-v3/doc/html/ext/lwg-active.html	Mon Jan 31 00:19:58 2011
--- gcc-5.5.0/libstdc++-v3/doc/html/ext/lwg-active.html	Fri Jul  8 13:29:06 2016
***************
*** 1,6 ****
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
! <!-- saved from url=(0059)http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html -->
! <html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
  <title>C++ Standard Library Active Issues List</title>
  <style type="text/css">
    p {text-align:justify}
--- 1,7 ----
! <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
!     "http://www.w3.org/TR/html4/strict.dtd">
! <html>
! <head>
  <title>C++ Standard Library Active Issues List</title>
  <style type="text/css">
    p {text-align:justify}
***************
*** 19,31 ****
  </head>
  <body>
  <table>
! <tbody><tr>
    <td align="left">Doc. no.</td>
!   <td align="left">D3181=10-0171</td>
  </tr>
  <tr>
    <td align="left">Date:</td>
!   <td align="left">2010-11-29</td>
  </tr>
  <tr>
    <td align="left">Project:</td>
--- 20,32 ----
  </head>
  <body>
  <table>
! <tr>
    <td align="left">Doc. no.</td>
!   <td align="left">N4484</td>
  </tr>
  <tr>
    <td align="left">Date:</td>
!   <td align="left">2015-05-23</td>
  </tr>
  <tr>
    <td align="left">Project:</td>
***************
*** 33,70 ****
  </tr>
  <tr>
    <td align="left">Reply to:</td>
!   <td align="left">Alisdair Meredith &lt;<a href="mailto:lwgchair@gmail.com">lwgchair@gmail.com</a>&gt;</td>
  </tr>
! </tbody></table>
! <h1>C++ Standard Library Active Issues List (Revision D73)</h1>
! <p>Revised 2010-11-29 at 10:11:56 UTC</p>
! 
!   <p>Reference ISO/IEC IS 14882:2003(E)</p>
    <p>Also see:</p>
    <ul>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-toc.html">Table of Contents</a> for all library issues.</li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html">Index by Section</a> for all library issues.</li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html">Index by Status</a> for all library issues.</li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html">Library Defect Reports List</a></li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html">Library Closed Issues List</a></li>
    </ul>
    <p>The purpose of this document is to record the status of issues
    which have come before the Library Working Group (LWG) of the INCITS PL22.16
    and ISO WG21 C++ Standards Committee. Issues represent
!   potential defects in the ISO/IEC IS 14882:2003(E) document.  
    </p>
  
    <p>This document contains only library issues which are actively being
    considered by the Library Working Group, i.e., issues which have a
!   status of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>, 
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>, or <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Review">Review</a>. See
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html">Library Defect Reports List</a> for issues considered defects and 
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html">Library Closed Issues List</a> for issues considered closed.</p>
  
    <p>The issues in these lists are not necessarily formal ISO Defect
    Reports (DR's). While some issues will eventually be elevated to
    official Defect Report status, other issues will be disposed of in
!   other ways. See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Status">Issue Status</a>.</p>
  
    <p>Prior to Revision 14, library issues lists existed in two slightly
    different versions; a Committee Version and a Public
--- 34,71 ----
  </tr>
  <tr>
    <td align="left">Reply to:</td>
!   <td align="left">Marshall Clow &lt;<a href="mailto:lwgchair@gmail.com">lwgchair@gmail.com</a>&gt;</td>
  </tr>
! </table>
! <h1>C++ Standard Library Active Issues List (Revision R93)</h1>
! <p><p>Revised 2015-05-23 at 15:05:40 UTC</p>
! </p>
!   <p>Reference ISO/IEC IS 14882:2014(E)</p>
    <p>Also see:</p>
    <ul>
!       <li><a href="lwg-toc.html">Table of Contents</a> for all library issues.</li>
!       <li><a href="lwg-index.html">Index by Section</a> for all library issues.</li>
!       <li><a href="lwg-status.html">Index by Status</a> for all library issues.</li>
!       <li><a href="lwg-defects.html">Library Defect Reports List</a></li>
!       <li><a href="lwg-closed.html">Library Closed Issues List</a></li>
    </ul>
    <p>The purpose of this document is to record the status of issues
    which have come before the Library Working Group (LWG) of the INCITS PL22.16
    and ISO WG21 C++ Standards Committee. Issues represent
!   potential defects in the ISO/IEC IS 14882:2014(E) document.  
    </p>
  
    <p>This document contains only library issues which are actively being
    considered by the Library Working Group, i.e., issues which have a
!   status of <a href="lwg-active.html#New">New</a>, <a href="lwg-active.html#Open">Open</a>, 
!   <a href="lwg-active.html#Ready">Ready</a>, or <a href="lwg-active.html#Review">Review</a>.
!   See <a href="lwg-defects.html">Library Defect Reports List</a> for issues considered defects
!   and <a href="lwg-closed.html">Library Closed Issues List</a> for issues considered closed.</p>
  
    <p>The issues in these lists are not necessarily formal ISO Defect
    Reports (DR's). While some issues will eventually be elevated to
    official Defect Report status, other issues will be disposed of in
!   other ways. See <a href="#Status">Issue Status</a>.</p>
  
    <p>Prior to Revision 14, library issues lists existed in two slightly
    different versions; a Committee Version and a Public
***************
*** 81,87 ****
    <p>For the most current official version of this document see 
    <a href="http://www.open-std.org/jtc1/sc22/wg21/">http://www.open-std.org/jtc1/sc22/wg21/</a>.
    Requests for further information about this document should include
!   the document number above, reference ISO/IEC 14882:2003(E), and be
    submitted to Information Technology Industry Council (ITI), 1250 Eye
    Street NW, Washington, DC 20005.</p>
  
--- 82,88 ----
    <p>For the most current official version of this document see 
    <a href="http://www.open-std.org/jtc1/sc22/wg21/">http://www.open-std.org/jtc1/sc22/wg21/</a>.
    Requests for further information about this document should include
!   the document number above, reference ISO/IEC 14882:2014(E), and be
    submitted to Information Technology Industry Council (ITI), 1250 Eye
    Street NW, Washington, DC 20005.</p>
  
***************
*** 92,144 ****
  
  <p><a name="submit_issue"></a><b>How to submit an issue</b></p>
  
! <ol type="A">
! <a name="submit_issue_A"></a><li>
  Mail your issue to the author of this list.
  </li>
! <a name="submit_issue_B"></a><li>
  Specify a short descriptive title.  If you fail to do so, the subject line of your
  mail will be used as the issue title.
  </li>
! <a name="submit_issue_C"></a><li>
  If the "From" on your email is not the name you wish to appear as issue submitter,
  then specify issue submitter.
  </li>
! <a name="submit_issue_D"></a><li>
  Provide a brief discussion of the problem you wish to correct.  Refer to the latest
  working draft or standard using [section.tag] and paragraph numbers where appropriate.
  </li>
! <a name="submit_issue_E"></a><li>
  Provide proposed wording.  This should indicate exactly how you want the standard
  to be changed.  General solution statements belong in the discussion area.  This
  area contains very clear and specific directions on how to modify the current
  draft.  If you are not sure how to word a solution, you may omit this part.
  But your chances of a successful issue greatly increase if you attempt wording.
  </li>
! <a name="submit_issue_F"></a><li>
  It is not necessary for you to use html markup.  However, if you want to, you can
  &lt;ins&gt;<ins>insert text like this</ins>&lt;/ins&gt; and &lt;del&gt;<del>delete text like
  this</del>&lt;/del&gt;.  The only strict requirement is to communicate clearly to
  the list maintainer exactly how you want your issue to look.
  </li>
! <a name="submit_issue_G"></a><li>
  It is not necessary for you to specify other html font/formatting
  mark-up, but if you do the list maintainer will attempt to respect your
  formatting wishes (as described by html markup, or other common idioms).
  </li>
! <a name="submit_issue_H"></a><li>
  It is not necessary for you to specify open date or last modified date (the date
  of your mail will be used).
  </li>
! <a name="submit_issue_I"></a><li>
  It is not necessary for you to cross reference other issues, but you can if you
  like.  You do not need to form the hyperlinks when you do, the list maintainer will
  take care of that.
  </li>
! <a name="submit_issue_J"></a><li>
  One issue per email is best.
  </li>
! <a name="submit_issue_K"></a><li>
  Between the time you submit the issue, and the next mailing deadline
  (date at the top of the Revision History), you <em>own</em> this issue. 
  You control the content, the stuff that is right, the stuff that is
--- 93,145 ----
  
  <p><a name="submit_issue"></a><b>How to submit an issue</b></p>
  
! <ol style="list-style-type:upper-alpha">
! <li><a name="submit_issue_A"></a>
  Mail your issue to the author of this list.
  </li>
! <li><a name="submit_issue_B"></a>
  Specify a short descriptive title.  If you fail to do so, the subject line of your
  mail will be used as the issue title.
  </li>
! <li><a name="submit_issue_C"></a>
  If the "From" on your email is not the name you wish to appear as issue submitter,
  then specify issue submitter.
  </li>
! <li><a name="submit_issue_D"></a>
  Provide a brief discussion of the problem you wish to correct.  Refer to the latest
  working draft or standard using [section.tag] and paragraph numbers where appropriate.
  </li>
! <li><a name="submit_issue_E"></a>
  Provide proposed wording.  This should indicate exactly how you want the standard
  to be changed.  General solution statements belong in the discussion area.  This
  area contains very clear and specific directions on how to modify the current
  draft.  If you are not sure how to word a solution, you may omit this part.
  But your chances of a successful issue greatly increase if you attempt wording.
  </li>
! <li><a name="submit_issue_F"></a>
  It is not necessary for you to use html markup.  However, if you want to, you can
  &lt;ins&gt;<ins>insert text like this</ins>&lt;/ins&gt; and &lt;del&gt;<del>delete text like
  this</del>&lt;/del&gt;.  The only strict requirement is to communicate clearly to
  the list maintainer exactly how you want your issue to look.
  </li>
! <li><a name="submit_issue_G"></a>
  It is not necessary for you to specify other html font/formatting
  mark-up, but if you do the list maintainer will attempt to respect your
  formatting wishes (as described by html markup, or other common idioms).
  </li>
! <li><a name="submit_issue_H"></a>
  It is not necessary for you to specify open date or last modified date (the date
  of your mail will be used).
  </li>
! <li><a name="submit_issue_I"></a>
  It is not necessary for you to cross reference other issues, but you can if you
  like.  You do not need to form the hyperlinks when you do, the list maintainer will
  take care of that.
  </li>
! <li><a name="submit_issue_J"></a>
  One issue per email is best.
  </li>
! <li><a name="submit_issue_K"></a>
  Between the time you submit the issue, and the next mailing deadline
  (date at the top of the Revision History), you <em>own</em> this issue. 
  You control the content, the stuff that is right, the stuff that is
*************** ownership of it.
*** 153,1200 ****
  
  <h2>Revision History</h2>
  <ul>
! <li>D73: Batavia meeting preview<ul>
! <li><b>Summary:</b><ul>
! <li>80 open issues, down by 126.</li>
! <li>1459 closed issues, up by 145.</li>
! <li>1539 issues total, up by 19.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following 11 New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1521">1521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1523">1523</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2008">2008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2012">2012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2013">2013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2014">2014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2015">2015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2016">2016</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2017">2017</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2018">2018</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2019">2019</a>.</li>
! <li>Added the following 5 Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2001">2001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2003">2003</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2005">2005</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2010">2010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2011">2011</a>.</li>
! <li>Added the following Resolved issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#2002">2002</a>.</li>
! <li>Added the following Review issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2009">2009</a>.</li>
! <li>Added the following Tentatively NAD issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2006">2006</a>.</li>
! <li>Added the following 3 Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2000">2000</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2004">2004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2007">2007</a>.</li>
! <li>Added the following WP issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1522">1522</a>.</li>
! <li>Changed the following 3 issues from New to Deferred: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1213">1213</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1214">1214</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1330">1330</a>.</li>
! <li>Changed the following issue from Open to Deferred: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1450">1450</a>.</li>
! <li>Changed the following 14 issues from Open to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1350">1350</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1351">1351</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1352">1352</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1375">1375</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1411">1411</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1443">1443</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1451">1451</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1454">1454</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1458">1458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1463">1463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1470">1470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1475">1475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1476">1476</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1477">1477</a>.</li>
! <li>Changed the following issue from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1331">1331</a>.</li>
! <li>Changed the following 8 issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1359">1359</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1361">1361</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1373">1373</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1376">1376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1398">1398</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1446">1446</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1473">1473</a>.</li>
! <li>Changed the following 2 issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1190">1190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1200">1200</a>.</li>
! <li>Changed the following issue from WP to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>.</li>
! <li>Changed the following 11 issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1395">1395</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1442">1442</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1471">1471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1472">1472</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1489">1489</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1495">1495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1496">1496</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1509">1509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1510">1510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1511">1511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1512">1512</a>.</li>
! <li>Changed the following issue from Review to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1281">1281</a>.</li>
! <li>Changed the following issue from New to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1289">1289</a>.</li>
! <li>Changed the following 6 issues from Open to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1406">1406</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1422">1422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1484">1484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1488">1488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1493">1493</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1499">1499</a>.</li>
! <li>Changed the following 2 issues from Tentatively NAD Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a>.</li>
! <li>Changed the following 2 issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1252">1252</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1297">1297</a>.</li>
! <li>Changed the following 3 issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1279">1279</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1318">1318</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1332">1332</a>.</li>
! <li>Changed the following 6 issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1385">1385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1401">1401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1408">1408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1418">1418</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1420">1420</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1438">1438</a>.</li>
! <li>Changed the following 42 issues from NAD Editorial to Resolved: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#353">353</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#482">482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#525">525</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#658">658</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#697">697</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#786">786</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1055">1055</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1075">1075</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1122">1122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1174">1174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1260">1260</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1293">1293</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1307">1307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1321">1321</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1394">1394</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1405">1405</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1407">1407</a>.</li>
! <li>Changed the following 5 issues from New to Resolved: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1290">1290</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1322">1322</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1324">1324</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1326">1326</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1328">1328</a>.</li>
! <li>Changed the following 46 issues from Open to Resolved: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#801">801</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1327">1327</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1344">1344</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1346">1346</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1347">1347</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1355">1355</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1356">1356</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1357">1357</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1365">1365</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1366">1366</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1377">1377</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1378">1378</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1379">1379</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1380">1380</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1382">1382</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1383">1383</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1389">1389</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1390">1390</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1391">1391</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1392">1392</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1393">1393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1397">1397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1409">1409</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1410">1410</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1412">1412</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1445">1445</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1447">1447</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1453">1453</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1455">1455</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1462">1462</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1464">1464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1465">1465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1466">1466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1467">1467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1468">1468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1469">1469</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1481">1481</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1482">1482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1490">1490</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1491">1491</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1492">1492</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1498">1498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1501">1501</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1508">1508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1513">1513</a>.</li>
! <li>Changed the following issue from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1480">1480</a>.</li>
! <li>Changed the following 2 issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1371">1371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1413">1413</a>.</li>
! <li>Changed the following issue from New to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1320">1320</a>.</li>
! <li>Changed the following 3 issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1215">1215</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1253">1253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1310">1310</a>.</li>
! <li>Changed the following issue from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1497">1497</a>.</li>
! <li>Changed the following 24 issues from NAD Editorial to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1360">1360</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1363">1363</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1367">1367</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1372">1372</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1381">1381</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1384">1384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1386">1386</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1387">1387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1388">1388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1399">1399</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1400">1400</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1402">1402</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1403">1403</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1416">1416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1417">1417</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1423">1423</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1424">1424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1425">1425</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1426">1426</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1427">1427</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1429">1429</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1430">1430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1431">1431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1441">1441</a>.</li>
! <li>Changed the following issue from New to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1294">1294</a>.</li>
! <li>Changed the following 10 issues from Open to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1354">1354</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1362">1362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1368">1368</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1370">1370</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1428">1428</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1435">1435</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1436">1436</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1437">1437</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1439">1439</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1440">1440</a>.</li>
! <li>Changed the following 2 issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>.</li>
! <li>Changed the following 33 issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1181">1181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1240">1240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1249">1249</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1292">1292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1295">1295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1316">1316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1319">1319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1323">1323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1325">1325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1333">1333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1334">1334</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1335">1335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1337">1337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1338">1338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1339">1339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1340">1340</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1404">1404</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1414">1414</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1432">1432</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1449">1449</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1516">1516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1517">1517</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1518">1518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1519">1519</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1520">1520</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R72: 
! 2010-10-18 pre-Batavia mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>206 open issues, up by 141.</li>
! <li>1314 closed issues, up by 36.</li>
! <li>1520 issues total, up by 177.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following Dup issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1433">1433</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1444">1444</a>.</li>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1360">1360</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1363">1363</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1367">1367</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1372">1372</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1381">1381</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1384">1384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1386">1386</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1387">1387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1388">1388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1394">1394</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1399">1399</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1400">1400</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1402">1402</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1403">1403</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1405">1405</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1407">1407</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1415">1415</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1416">1416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1417">1417</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1419">1419</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1423">1423</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1424">1424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1425">1425</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1426">1426</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1427">1427</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1429">1429</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1430">1430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1431">1431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1434">1434</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1441">1441</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1483">1483</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1500">1500</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1506">1506</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1344">1344</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1345">1345</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1346">1346</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1347">1347</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1348">1348</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1349">1349</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1350">1350</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1351">1351</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1352">1352</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1353">1353</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1354">1354</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1355">1355</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1356">1356</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1357">1357</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1358">1358</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1359">1359</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1361">1361</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1362">1362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1364">1364</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1365">1365</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1366">1366</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1368">1368</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1369">1369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1370">1370</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1371">1371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1373">1373</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1374">1374</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1375">1375</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1376">1376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1377">1377</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1378">1378</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1379">1379</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1380">1380</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1382">1382</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1383">1383</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1385">1385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1389">1389</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1390">1390</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1391">1391</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1392">1392</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1393">1393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1395">1395</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1396">1396</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1397">1397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1398">1398</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1401">1401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1406">1406</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1408">1408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1409">1409</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1410">1410</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1411">1411</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1412">1412</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1413">1413</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1418">1418</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1420">1420</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1421">1421</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1422">1422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1428">1428</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1435">1435</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1436">1436</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1437">1437</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1438">1438</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1439">1439</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1440">1440</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1442">1442</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1443">1443</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1445">1445</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1446">1446</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1447">1447</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1448">1448</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1450">1450</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1451">1451</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1452">1452</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1453">1453</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1454">1454</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1455">1455</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1456">1456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1457">1457</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1458">1458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1459">1459</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1460">1460</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1461">1461</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1462">1462</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1463">1463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1464">1464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1465">1465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1466">1466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1467">1467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1468">1468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1469">1469</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1470">1470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1471">1471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1472">1472</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1473">1473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1474">1474</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1475">1475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1476">1476</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1477">1477</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1478">1478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1479">1479</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1480">1480</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1481">1481</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1482">1482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1484">1484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1485">1485</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1486">1486</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1487">1487</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1488">1488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1489">1489</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1490">1490</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1491">1491</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1492">1492</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1493">1493</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1494">1494</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1495">1495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1496">1496</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1497">1497</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1498">1498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1499">1499</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1501">1501</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1502">1502</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1503">1503</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1504">1504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1505">1505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1507">1507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1508">1508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1509">1509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1510">1510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1511">1511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1512">1512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1513">1513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1514">1514</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1515">1515</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1404">1404</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1414">1414</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1432">1432</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1449">1449</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1516">1516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1517">1517</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1518">1518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1519">1519</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1520">1520</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1260">1260</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1181">1181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1240">1240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1249">1249</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1292">1292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1295">1295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1316">1316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1319">1319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1323">1323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1325">1325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1333">1333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1334">1334</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1335">1335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1337">1337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1338">1338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1339">1339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1340">1340</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R71: 
! 2010-08-25 post-Rapperswil mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>65 open issues, up by 2.</li>
! <li>1278 closed issues, up by 7.</li>
! <li>1343 issues total, up by 9.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1335">1335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2008">2008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1337">1337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1338">1338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1339">1339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1340">1340</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2009">2009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2010">2010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2011">2011</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#996">996</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1119">1119</a>.</li>
! <li>Changed the following issues from Open to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1076">1076</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1169">1169</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1175">1175</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1190">1190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1200">1200</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1187">1187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1206">1206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1278">1278</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R70: 
! 2010-03-26 post-Pittsburgh mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>63 open issues, down by 203.</li>
! <li>1271 closed issues, up by 219.</li>
! <li>1334 issues total, up by 16.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1321">1321</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1329">1329</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1319">1319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1320">1320</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1322">1322</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1323">1323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1324">1324</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1325">1325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1326">1326</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1328">1328</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1330">1330</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1331">1331</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1332">1332</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1333">1333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1334">1334</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1327">1327</a>.</li>
! <li>Changed the following issues from Tentatively Dup to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1302">1302</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1308">1308</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1313">1313</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1314">1314</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#887">887</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1008">1008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1069">1069</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1153">1153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1156">1156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1228">1228</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1125">1125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1202">1202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1223">1223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1224">1224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1246">1246</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1251">1251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1259">1259</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1263">1263</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1265">1265</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1296">1296</a>.</li>
! <li>Changed the following issues from Tentatively NAD Concepts to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1186">1186</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1185">1185</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1210">1210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1212">1212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1225">1225</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1244">1244</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1266">1266</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1269">1269</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1272">1272</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1275">1275</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1291">1291</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1305">1305</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1307">1307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1311">1311</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#446">446</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1211">1211</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1248">1248</a>.</li>
! <li>Changed the following issues from Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#485">485</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>.</li>
! <li>Changed the following issues from Tentatively NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1115">1115</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1233">1233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1239">1239</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1301">1301</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1226">1226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1273">1273</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1274">1274</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1293">1293</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1300">1300</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1304">1304</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1315">1315</a>.</li>
! <li>Changed the following issues from New to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1154">1154</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1317">1317</a>.</li>
! <li>Changed the following issues from Ready to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1112">1112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1201">1201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1238">1238</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1282">1282</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1187">1187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1206">1206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1278">1278</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1281">1281</a>.</li>
! <li>Changed the following issues from Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>.</li>
! <li>Changed the following issues from New to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1159">1159</a>.</li>
! <li>Changed the following issues from Open to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#427">427</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#430">430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#819">819</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#861">861</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#885">885</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#896">896</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#473">473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1030">1030</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1123">1123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1134">1134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1136">1136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1144">1144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1157">1157</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1216">1216</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1227">1227</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1237">1237</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1089">1089</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1126">1126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1131">1131</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1138">1138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1152">1152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1158">1158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1170">1170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1180">1180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1189">1189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1192">1192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1193">1193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1197">1197</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1208">1208</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1209">1209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1218">1218</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1220">1220</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1221">1221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1222">1222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1231">1231</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1241">1241</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1250">1250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1254">1254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1256">1256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1257">1257</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1261">1261</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1262">1262</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1264">1264</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1267">1267</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1270">1270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1271">1271</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1276">1276</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1277">1277</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1280">1280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1284">1284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1285">1285</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1286">1286</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1287">1287</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1288">1288</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1298">1298</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1299">1299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1303">1303</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1306">1306</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1309">1309</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1312">1312</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R69: 
! 2010-02-12 pre-Pittsburgh mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>266 open issues, up by 61.</li>
! <li>1052 closed issues, down by 3.</li>
! <li>1318 issues total, up by 58.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1266">1266</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1269">1269</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1272">1272</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1275">1275</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1278">1278</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1279">1279</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1281">1281</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1289">1289</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1290">1290</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1291">1291</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1292">1292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1294">1294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1295">1295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1297">1297</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1302">1302</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1305">1305</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1307">1307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1308">1308</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1310">1310</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1311">1311</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1313">1313</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1314">1314</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1316">1316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1317">1317</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1318">1318</a>.</li>
! <li>Added the following Tentatively NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1263">1263</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1265">1265</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1296">1296</a>.</li>
! <li>Added the following Tentatively NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1301">1301</a>.</li>
! <li>Added the following Tentatively NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1282">1282</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1261">1261</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1262">1262</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1264">1264</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1267">1267</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1270">1270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1271">1271</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1273">1273</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1274">1274</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1276">1276</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1277">1277</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1280">1280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1284">1284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1285">1285</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1286">1286</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1287">1287</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1288">1288</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1293">1293</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1298">1298</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1299">1299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1300">1300</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1303">1303</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1304">1304</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1306">1306</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1309">1309</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1312">1312</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1315">1315</a>.</li>
! <li>Changed the following issues from NAD to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#101">101</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1248">1248</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>.</li>
! <li>Changed the following issues from New to Tentatively Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1125">1125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1202">1202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1223">1223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1224">1224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1246">1246</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1251">1251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1259">1259</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>.</li>
! <li>Changed the following issues from Review to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>.</li>
! <li>Changed the following issues from Ready to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>.</li>
! <li>Changed the following issues from NAD to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>.</li>
! <li>Changed the following issues from NAD Editorial to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1131">1131</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1170">1170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1180">1180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1193">1193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1197">1197</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1209">1209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1218">1218</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1221">1221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1222">1222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1250">1250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1254">1254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1256">1256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1257">1257</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1089">1089</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>.</li>
! <li>Changed the following issues from Ready to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>.</li>
! <li>Changed the following issues from Pending WP to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R68: 
! 2009-11-06 post-Santa Cruz mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>205 open issues, down by 77.</li>
! <li>1055 closed issues, up by 120.</li>
! <li>1260 issues total, up by 43.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following Dup issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1230">1230</a>.</li>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1229">1229</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1236">1236</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1243">1243</a>.</li>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1232">1232</a>.</li>
! <li>Added the following NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1235">1235</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1242">1242</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1248">1248</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1218">1218</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1221">1221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1222">1222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1223">1223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1224">1224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1225">1225</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1240">1240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1244">1244</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1246">1246</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1249">1249</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1250">1250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1251">1251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1252">1252</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1253">1253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1254">1254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1256">1256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1257">1257</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1259">1259</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1260">1260</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1228">1228</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1227">1227</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1237">1237</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>.</li>
! <li>Added the following Tentatively NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1233">1233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1239">1239</a>.</li>
! <li>Added the following Tentatively NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1238">1238</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1220">1220</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1226">1226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1231">1231</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1241">1241</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1132">1132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1148">1148</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#458">458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#955">955</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#977">977</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1020">1020</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1035">1035</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1042">1042</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1051">1051</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1064">1064</a>.</li>
! <li>Changed the following issues from Review to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1091">1091</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>.</li>
! <li>Changed the following issues from NAD Concepts to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1143">1143</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1122">1122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1129">1129</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1145">1145</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1146">1146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1147">1147</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1155">1155</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1166">1166</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1172">1172</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1174">1174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1179">1179</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1196">1196</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#908">908</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#926">926</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#944">944</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1046">1046</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1048">1048</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1055">1055</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1075">1075</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1088">1088</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1160">1160</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1161">1161</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1162">1162</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1163">1163</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1165">1165</a>.</li>
! <li>Changed the following issues from Review to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1043">1043</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1047">1047</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1049">1049</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1050">1050</a>.</li>
! <li>Changed the following issues from New to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1120">1120</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1150">1150</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1184">1184</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1203">1203</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1217">1217</a>.</li>
! <li>Changed the following issues from Open to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#484">484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#851">851</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#933">933</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#935">935</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1041">1041</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1053">1053</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1031">1031</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1119">1119</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1153">1153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1156">1156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1211">1211</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#430">430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1123">1123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1134">1134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1136">1136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1144">1144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1216">1216</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#485">485</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1030">1030</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#473">473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1157">1157</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1186">1186</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1115">1115</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1201">1201</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1112">1112</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1126">1126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1138">1138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1152">1152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1158">1158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1189">1189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1192">1192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1208">1208</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#419">419</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#881">881</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1178">1178</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R67: 
! 2009-09-25 pre-Santa Cruz mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>282 open issues, up by 32.</li>
! <li>935 closed issues, down by 1.</li>
! <li>1217 issues total, up by 31.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1187">1187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1189">1189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1190">1190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1192">1192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1193">1193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1196">1196</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1197">1197</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1200">1200</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1201">1201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1202">1202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1203">1203</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1206">1206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1208">1208</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1209">1209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1210">1210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1211">1211</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1212">1212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1213">1213</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1214">1214</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1215">1215</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1216">1216</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1217">1217</a>.</li>
! <li>Changed the following issues from NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>.</li>
! <li>Changed the following issues from WP to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>.</li>
! <li>Changed the following issues from Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R66: 
! 2009-07-31 post-Frankfurt mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>250 open issues, down by 128.</li>
! <li>936 closed issues, up by 171.</li>
! <li>1186 issues total, up by 43.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1164">1164</a>.</li>
! <li>Added the following NAD Concepts issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1149">1149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1167">1167</a>.</li>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1168">1168</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1144">1144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1145">1145</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1146">1146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1147">1147</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1148">1148</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1150">1150</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1152">1152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1153">1153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1154">1154</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1155">1155</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1156">1156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1158">1158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1159">1159</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1166">1166</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1169">1169</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1170">1170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1172">1172</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1174">1174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1175">1175</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1179">1179</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1180">1180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1181">1181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1184">1184</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1185">1185</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1186">1186</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1160">1160</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1161">1161</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1162">1162</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1163">1163</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1165">1165</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1178">1178</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1157">1157</a>.</li>
! <li>Changed the following issues from Open to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#895">895</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#219">219</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#290">290</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#309">309</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#343">343</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#382">382</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#394">394</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#398">398</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#417">417</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#418">418</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#421">421</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#459">459</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#492">492</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#502">502</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#503">503</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#546">546</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#573">573</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#585">585</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#597">597</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#606">606</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#614">614</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#632">632</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#747">747</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#751">751</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#941">941</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#992">992</a>.</li>
! <li>Changed the following issues from Review to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1003">1003</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#568">568</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#701">701</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#702">702</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#785">785</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#863">863</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#903">903</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#988">988</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#995">995</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1002">1002</a>.</li>
! <li>Changed the following issues from New to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1124">1124</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1127">1127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1128">1128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1139">1139</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1140">1140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1141">1141</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1142">1142</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1143">1143</a>.</li>
! <li>Changed the following issues from Open to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#989">989</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1000">1000</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1007">1007</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1010">1010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1015">1015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1016">1016</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1017">1017</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1018">1018</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1026">1026</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1027">1027</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1028">1028</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1029">1029</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1032">1032</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1036">1036</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1057">1057</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1059">1059</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1072">1072</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1078">1078</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1081">1081</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1082">1082</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1083">1083</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1084">1084</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1085">1085</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1086">1086</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1092">1092</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1096">1096</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1105">1105</a>.</li>
! <li>Changed the following issues from Review to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1005">1005</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1080">1080</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1087">1087</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1111">1111</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#912">912</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#918">918</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1074">1074</a>.</li>
! <li>Changed the following issues from Tentatively NAD Editorial to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#927">927</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1109">1109</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#906">906</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#913">913</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#914">914</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#928">928</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1067">1067</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#873">873</a>.</li>
! <li>Changed the following issues from Tentatively NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#837">837</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#862">862</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#945">945</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#969">969</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#972">972</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#979">979</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1058">1058</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1060">1060</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1061">1061</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1101">1101</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1013">1013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1107">1107</a>.</li>
! <li>Changed the following issues from Open to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#255">255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#423">423</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#708">708</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#839">839</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>.</li>
! <li>Changed the following issues from CD1 to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>.</li>
! <li>Changed the following issues from NAD Editorial to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#484">484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#458">458</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#419">419</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#430">430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#881">881</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>.</li>
! <li>Changed the following issues from NAD to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#473">473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1031">1031</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#810">810</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#888">888</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#898">898</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#904">904</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#922">922</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#925">925</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#931">931</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#949">949</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#981">981</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#982">982</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#984">984</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#986">986</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#990">990</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#991">991</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#993">993</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#994">994</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1006">1006</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1014">1014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1037">1037</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1038">1038</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1039">1039</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1040">1040</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1044">1044</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1045">1045</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1065">1065</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1073">1073</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1103">1103</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R65: 
! 2009-06-19 pre-Frankfurt mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>378 open issues, up by 32.</li>
! <li>765 closed issues, up by 0.</li>
! <li>1143 issues total, up by 32.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1115">1115</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1119">1119</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1120">1120</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1122">1122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1123">1123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1124">1124</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1125">1125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1126">1126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1127">1127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1128">1128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1129">1129</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1131">1131</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1132">1132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1134">1134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1136">1136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1138">1138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1139">1139</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1140">1140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1141">1141</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1142">1142</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1143">1143</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1112">1112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#937">937</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#933">933</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#935">935</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#941">941</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#955">955</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#977">977</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#985">985</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#989">989</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#996">996</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1057">1057</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1059">1059</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1069">1069</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1072">1072</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1076">1076</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1092">1092</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1096">1096</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1105">1105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#992">992</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1010">1010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1015">1015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1080">1080</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1091">1091</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1111">1111</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1087">1087</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#568">568</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#701">701</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#702">702</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#785">785</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#863">863</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#903">903</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#912">912</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#918">918</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#995">995</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1074">1074</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#458">458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>.</li>
! <li>Changed the following issues from Review to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#988">988</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#837">837</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#862">862</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#927">927</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#945">945</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#969">969</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#972">972</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#979">979</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1058">1058</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1060">1060</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1061">1061</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1101">1101</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1109">1109</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>.</li>
! <li>Changed the following issues from Review to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#810">810</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#898">898</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#906">906</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#913">913</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#914">914</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#925">925</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#981">981</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#982">982</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#984">984</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#990">990</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1067">1067</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1073">1073</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1103">1103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1107">1107</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#986">986</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#991">991</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#993">993</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#994">994</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1002">1002</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1006">1006</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1013">1013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1014">1014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1037">1037</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1038">1038</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1039">1039</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1040">1040</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1044">1044</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1045">1045</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1065">1065</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R64: 
! 2009-05-01 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>346 open issues, up by 19.</li>
! <li>765 closed issues, up by 0.</li>
! <li>1111 issues total, up by 19.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1096">1096</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1101">1101</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1103">1103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1105">1105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1107">1107</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1109">1109</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1111">1111</a>.</li>
! <li>Changed the following issues from DR to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#130">130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#386">386</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#406">406</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#409">409</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#413">413</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#434">434</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#438">438</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#444">444</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#445">445</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#455">455</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#457">457</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#460">460</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#469">469</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#533">533</a>.</li>
! <li>Changed the following issues from Review to New: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R63: 
! 2009-03-20 post-Summit mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>327 open issues, up by 96.</li>
! <li>765 closed issues, up by 14.</li>
! <li>1092 issues total, up by 110.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1022">1022</a>.</li>
! <li>Added the following NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1025">1025</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#984">984</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#985">985</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#989">989</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#990">990</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#995">995</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#996">996</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1057">1057</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1058">1058</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1059">1059</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1060">1060</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1061">1061</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1067">1067</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1069">1069</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1072">1072</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1073">1073</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1074">1074</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1076">1076</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1080">1080</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1091">1091</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1092">1092</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1000">1000</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1007">1007</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1008">1008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1016">1016</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1017">1017</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1018">1018</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1020">1020</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1026">1026</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1027">1027</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1028">1028</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1029">1029</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1030">1030</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1031">1031</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1032">1032</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1035">1035</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1036">1036</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1041">1041</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1042">1042</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1046">1046</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1048">1048</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1051">1051</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1053">1053</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1055">1055</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1064">1064</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1075">1075</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1078">1078</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1081">1081</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1082">1082</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1083">1083</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1084">1084</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1085">1085</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1086">1086</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1087">1087</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1088">1088</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1089">1089</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#986">986</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#991">991</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#992">992</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#993">993</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#994">994</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1002">1002</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1003">1003</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1005">1005</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1006">1006</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1010">1010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1013">1013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1014">1014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1015">1015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1037">1037</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1038">1038</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1039">1039</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1040">1040</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1043">1043</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1044">1044</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1045">1045</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1047">1047</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1049">1049</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1050">1050</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1065">1065</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#988">988</a>.</li>
! <li>Changed the following issues from New to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#905">905</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#942">942</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#980">980</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#874">874</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#875">875</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#800">800</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#683">683</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#892">892</a>.</li>
! <li>Changed the following issues from Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Changed the following issues from NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#219">219</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#908">908</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#926">926</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#944">944</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#964">964</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#966">966</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#937">937</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#904">904</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#922">922</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#928">928</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#931">931</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#949">949</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#888">888</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#866">866</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#894">894</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R62: 
! 2009-02-06 pre-Summit mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>231 open issues, up by 44.</li>
! <li>751 closed issues, up by 0.</li>
! <li>982 issues total, up by 44.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#941">941</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#942">942</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#944">944</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#945">945</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#949">949</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#955">955</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#964">964</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#966">966</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#969">969</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#972">972</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#977">977</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#979">979</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#980">980</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#981">981</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#982">982</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R61: 
! 2008-12-05 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>187 open issues, up by 20.</li>
! <li>751 closed issues, up by 0.</li>
! <li>938 issues total, up by 20.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#922">922</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#925">925</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#926">926</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#927">927</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#928">928</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#931">931</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#933">933</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#935">935</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#937">937</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R60: 
! 2008-10-03 post-San Francisco mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>167 open issues, down by 25.</li>
! <li>751 closed issues, up by 65.</li>
! <li>918 issues total, up by 40.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following CD1 issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#882">882</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#898">898</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#903">903</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#904">904</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#905">905</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#906">906</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#908">908</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#912">912</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#913">913</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#914">914</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#918">918</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#881">881</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#885">885</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#887">887</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#895">895</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#896">896</a>.</li>
! <li>Added the following Pending NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#892">892</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#894">894</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#888">888</a>.</li>
! <li>Changed the following issues from New to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#818">818</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#820">820</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#843">843</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#845">845</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#846">846</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#856">856</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#858">858</a>.</li>
! <li>Changed the following issues from Ready to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#396">396</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#713">713</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#714">714</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#769">769</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#772">772</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#779">779</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787">787</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#807">807</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#808">808</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#813">813</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#824">824</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#829">829</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#842">842</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#844">844</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#848">848</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#850">850</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#852">852</a>.</li>
! <li>Changed the following issues from Review to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#23">23</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#692">692</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#698">698</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>.</li>
! <li>Changed the following issues from WP to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#44">44</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#49">49</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#76">76</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#91">91</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#92">92</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#98">98</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#117">117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#118">118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#120">120</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#123">123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#136">136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#153">153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#165">165</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#167">167</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#171">171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#179">179</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#182">182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#183">183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#184">184</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#185">185</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#186">186</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#187">187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#198">198</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#200">200</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#201">201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#202">202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#206">206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#214">214</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#221">221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#229">229</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#230">230</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#231">231</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#232">232</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#234">234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#237">237</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#238">238</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#239">239</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#240">240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#241">241</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#242">242</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#243">243</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#247">247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#248">248</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#251">251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#252">252</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#253">253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#256">256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#259">259</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#260">260</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#261">261</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#262">262</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#263">263</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#265">265</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#266">266</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#268">268</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#270">270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#271">271</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#272">272</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#273">273</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#274">274</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#275">275</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#276">276</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#278">278</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#280">280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#281">281</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#282">282</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#283">283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#284">284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#285">285</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#286">286</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#288">288</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#291">291</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#292">292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#294">294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#295">295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#297">297</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#298">298</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#300">300</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#301">301</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#303">303</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#305">305</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#306">306</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#307">307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#308">308</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#310">310</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#311">311</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#312">312</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#315">315</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#316">316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#317">317</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#318">318</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#319">319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#320">320</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#321">321</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#322">322</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#324">324</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#325">325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#327">327</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#328">328</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#329">329</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#331">331</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#333">333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#334">334</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#335">335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#336">336</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#337">337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#338">338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#339">339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#340">340</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#341">341</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#345">345</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#346">346</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#347">347</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#349">349</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#352">352</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#354">354</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#355">355</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#358">358</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#359">359</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#360">360</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#363">363</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#364">364</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#365">365</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#369">369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#370">370</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#373">373</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#375">375</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#376">376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#379">379</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#380">380</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#381">381</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#383">383</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#389">389</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#391">391</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#395">395</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#400">400</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#401">401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#402">402</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#403">403</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#404">404</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#405">405</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#407">407</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#410">410</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#411">411</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#412">412</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#414">414</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#415">415</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#416">416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#420">420</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#422">422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#425">425</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#426">426</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#428">428</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#432">432</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#435">435</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#436">436</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#441">441</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#442">442</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#443">443</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#448">448</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#449">449</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#453">453</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#456">456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#461">461</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#464">464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#465">465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#467">467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#468">468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#474">474</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#495">495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#496">496</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#497">497</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#505">505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#507">507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#508">508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#519">519</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#520">520</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#521">521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#524">524</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#552">552</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#650">650</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#651">651</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#652">652</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#678">678</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#681">681</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#699">699</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#712">712</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#792">792</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#798">798</a>.</li>
! <li>Changed the following issues from Open to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#849">849</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#855">855</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#454">454</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#812">812</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#841">841</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#864">864</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#484">484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#717">717</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#725">725</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#738">738</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#751">751</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#819">819</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#861">861</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#873">873</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#851">851</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#866">866</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>.</li>
! <li>Changed the following issues from TC to TC1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1">1</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#3">3</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#5">5</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#7">7</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#8">8</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#9">9</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#11">11</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#13">13</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#14">14</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#15">15</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#16">16</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#17">17</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#18">18</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#19">19</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#20">20</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#21">21</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#22">22</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#24">24</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#25">25</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#26">26</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#27">27</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#28">28</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#29">29</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#30">30</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#31">31</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#32">32</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#33">33</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#34">34</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#35">35</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#36">36</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#37">37</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#38">38</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#39">39</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#40">40</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#41">41</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#42">42</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#46">46</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#47">47</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#48">48</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#50">50</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#51">51</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#52">52</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#53">53</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#54">54</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#55">55</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#56">56</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#57">57</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#59">59</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#61">61</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#62">62</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#63">63</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#64">64</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#66">66</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#68">68</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#69">69</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#70">70</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#71">71</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#74">74</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#75">75</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#78">78</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#79">79</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#80">80</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#83">83</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#86">86</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#90">90</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#106">106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#108">108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#110">110</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#115">115</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#119">119</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#122">122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#124">124</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#125">125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#126">126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#127">127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#129">129</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#132">132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#133">133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#134">134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#137">137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#139">139</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#141">141</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#142">142</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#144">144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#146">146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#147">147</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#148">148</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#150">150</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#151">151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#152">152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#154">154</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#155">155</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#156">156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#158">158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#159">159</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#160">160</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#161">161</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#164">164</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#168">168</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#169">169</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#170">170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#172">172</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#173">173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#174">174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#175">175</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#176">176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#181">181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#189">189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#193">193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#195">195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199">199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#208">208</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#209">209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#210">210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#211">211</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#212">212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#217">217</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#220">220</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#222">222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#223">223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#224">224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R59: 
! 2008-08-22 pre-San Francisco mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>192 open issues, up by 9.</li>
! <li>686 closed issues, up by 0.</li>
! <li>878 issues total, up by 9.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#873">873</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#874">874</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#875">875</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R58: 
! 2008-07-28 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>183 open issues, up by 12.</li>
! <li>686 closed issues, down by 4.</li>
! <li>869 issues total, up by 8.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#862">862</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#863">863</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#864">864</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#866">866</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#393">393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#592">592</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#754">754</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#757">757</a>.</li>
! <li>Changed the following issues from Pending WP to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>.</li>
! <li>Changed the following issues from WP to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R57: 
! 2008-06-27 post-Sophia Antipolis mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>171 open issues, down by 20.</li>
! <li>690 closed issues, up by 43.</li>
! <li>861 issues total, up by 23.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#840">840</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#841">841</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#843">843</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#845">845</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#846">846</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#849">849</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#855">855</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#856">856</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#858">858</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#861">861</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#839">839</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#842">842</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#844">844</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#848">848</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#850">850</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#852">852</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#851">851</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#826">826</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#570">570</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#786">786</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#831">831</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#713">713</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#714">714</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#769">769</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#772">772</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#779">779</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787">787</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#807">807</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#808">808</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#813">813</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#824">824</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#829">829</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#396">396</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#692">692</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#698">698</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#23">23</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Changed the following issues from Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#792">792</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#798">798</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R56: 
! 2008-05-16 pre-Sophia Antipolis mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>191 open issues, up by 24.</li>
! <li>647 closed issues, up by 1.</li>
! <li>838 issues total, up by 25.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#818">818</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#819">819</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#820">820</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#824">824</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#826">826</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#829">829</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#831">831</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#837">837</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#802">802</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R55: 
! 2008-03-14 post-Bellevue mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>167 open issues, down by 39.</li>
! <li>646 closed issues, up by 65.</li>
! <li>813 issues total, up by 26.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following Dup issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#795">795</a>.</li>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#790">790</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#791">791</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#796">796</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#797">797</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#799">799</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#802">802</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#807">807</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#808">808</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#810">810</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#812">812</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#813">813</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#800">800</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#801">801</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#792">792</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#798">798</a>.</li>
! <li>Changed the following issues from NAD Future to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#116">116</a>.</li>
! <li>Changed the following issues from NAD Future to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#188">188</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#729">729</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#730">730</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#731">731</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#733">733</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#735">735</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#736">736</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#737">737</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#739">739</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#741">741</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#745">745</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#748">748</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#763">763</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#764">764</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#773">773</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#784">784</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#388">388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#462">462</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#627">627</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#653">653</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#686">686</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#707">707</a>.</li>
! <li>Changed the following issues from NAD Future to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#390">390</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#529">529</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#626">626</a>.</li>
! <li>Changed the following issues from Review to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#645">645</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#684">684</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#747">747</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#717">717</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#725">725</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#738">738</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#754">754</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#757">757</a>.</li>
! <li>Changed the following issues from Open to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R54: 
! 2008-02-01 pre-Bellevue mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>206 open issues, up by 23.</li>
! <li>581 closed issues, up by 0.</li>
! <li>787 issues total, up by 23.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#769">769</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#772">772</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#773">773</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#779">779</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#784">784</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#785">785</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#786">786</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787">787</a>.</li>
! <li>Changed the following issues from NAD Future to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#105">105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#348">348</a>.</li>
! <li>Changed the following issues from NAD Future to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#353">353</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#697">697</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#388">388</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R53: 
! 2007-12-09 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>183 open issues, up by 11.</li>
! <li>581 closed issues, down by 1.</li>
! <li>764 issues total, up by 10.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#757">757</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#763">763</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#764">764</a>.</li>
! <li>Changed the following issues from NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>.</li>
! <li>Changed the following issues from Pending WP to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R52: 
! 2007-10-19 post-Kona mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>172 open issues, up by 4.</li>
! <li>582 closed issues, up by 27.</li>
! <li>754 issues total, up by 31.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#725">725</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#729">729</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#730">730</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#731">731</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#733">733</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#735">735</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#736">736</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#737">737</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#738">738</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#739">739</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#741">741</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#745">745</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#747">747</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#748">748</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#751">751</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#754">754</a>.</li>
! <li>Changed the following issues from NAD Future to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#77">77</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#639">639</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#657">657</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#663">663</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#548">548</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#546">546</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#573">573</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#585">585</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#627">627</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#632">632</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#653">653</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#686">686</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#707">707</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#708">708</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#393">393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#592">592</a>.</li>
! <li>Changed the following issues from New to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#645">645</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#684">684</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>.</li>
! <li>Changed the following issues from New to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#552">552</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#650">650</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#651">651</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#652">652</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#678">678</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#681">681</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#699">699</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#712">712</a>.</li>
! <li>Changed the following issues from Open to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#401">401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#524">524</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R51: 
! 2007-09-09 pre-Kona mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>168 open issues, up by 15.</li>
! <li>555 closed issues, up by 0.</li>
! <li>723 issues total, up by 15.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#712">712</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#713">713</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#714">714</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#717">717</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R50: 
! 2007-08-05 post-Toronto mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>153 open issues, down by 5.</li>
! <li>555 closed issues, up by 17.</li>
! <li>708 issues total, up by 12.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#697">697</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#698">698</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#699">699</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#701">701</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#702">702</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#707">707</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#708">708</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#583">583</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#584">584</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#662">662</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#528">528</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#637">637</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#647">647</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#658">658</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#690">690</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#525">525</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#633">633</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#636">636</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#641">641</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#642">642</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#648">648</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#649">649</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#656">656</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>.</li>
! <li>Changed the following issues from Pending WP to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>.</li>
! <li>Changed the following issues from Ready to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>.</li>
! <li>Changed the following issues from Ready to TRDec: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a>.</li>
! <li>Changed the following issues from DR to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#453">453</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R49: 
! 2007-06-23 pre-Toronto mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>158 open issues, up by 13.</li>
! <li>538 closed issues, up by 7.</li>
! <li>696 issues total, up by 20.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#678">678</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#681">681</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#684">684</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#686">686</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#690">690</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#692">692</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>.</li>
! <li>Added the following Pending NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#683">683</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#587">587</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#590">590</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#636">636</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#642">642</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#648">648</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#649">649</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R48: 
! 2007-05-06 post-Oxford mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>145 open issues, down by 33.</li>
! <li>531 closed issues, up by 53.</li>
! <li>676 issues total, up by 20.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#657">657</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#658">658</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#662">662</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#663">663</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#385">385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#470">470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#515">515</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#547">547</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#560">560</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#572">572</a>.</li>
! <li>Changed the following issues from NAD to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#351">351</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#357">357</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#368">368</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#499">499</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#513">513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#514">514</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#516">516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#555">555</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#558">558</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#482">482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#615">615</a>.</li>
! <li>Changed the following issues from NAD_Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#77">77</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#105">105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#116">116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#188">188</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#219">219</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#348">348</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#353">353</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#388">388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#390">390</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#633">633</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#641">641</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#656">656</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a>.</li>
! <li>Changed the following issues from Ready to TRDec: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#598">598</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#599">599</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#600">600</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#601">601</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#602">602</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#603">603</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#605">605</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#201">201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#206">206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#416">416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#422">422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#456">456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R47: 
! 2007-03-09 pre-Oxford mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>178 open issues, up by 37.</li>
! <li>478 closed issues, up by 0.</li>
! <li>656 issues total, up by 37.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#627">627</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#632">632</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#633">633</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#636">636</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#637">637</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#639">639</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#641">641</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#642">642</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#645">645</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#647">647</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#648">648</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#649">649</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#650">650</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#651">651</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#652">652</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#653">653</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#656">656</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#626">626</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#570">570</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#590">590</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#614">614</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#547">547</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#560">560</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#572">572</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#615">615</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#201">201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#206">206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#385">385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#416">416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#422">422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#456">456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#470">470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#482">482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#515">515</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R46: 
! 2007-01-12 mid-term mailing.
! <ul>
  <li><b>Summary:</b><ul>
! <li>141 open issues, up by 11.</li>
! <li>478 closed issues, down by 1.</li>
! <li>619 issues total, up by 10.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#614">614</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#615">615</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R45: 
! 2006-11-03 post-Portland mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>130 open issues, up by 0.</li>
! <li>479 closed issues, up by 17.</li>
! <li>609 issues total, up by 17.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#520">520</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#521">521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a> to WP.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#516">516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#554">554</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#555">555</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#558">558</a> to NAD.</li>
! <li>Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a> to Dup.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#524">524</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#597">597</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#606">606</a> to Open.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#598">598</a> - <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#603">603</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#605">605</a> to Ready.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a> to Review.</li>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#597">597</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#598">598</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#599">599</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#600">600</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#601">601</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#602">602</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#603">603</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#605">605</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#606">606</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R44: 
! 2006-09-08 pre-Portland mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>130 open issues, up by 6.</li>
! <li>462 closed issues, down by 1.</li>
! <li>592 issues total, up by 5.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#583">583</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#584">584</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#585">585</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#587">587</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#590">590</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#592">592</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R43: 
! 2006-06-23 mid-term mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>124 open issues, up by 14.</li>
! <li>463 closed issues, down by 1.</li>
! <li>587 issues total, up by 13.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a>.</li>
! <li>Reopened <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#255">255</a>.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#520">520</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a> to Tentatively Ready.</li>
  </ul></li>
  </ul>
  </li>
! <li>R42: 
! 2006-04-21 post-Berlin mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>110 open issues, down by 16.</li>
! <li>464 closed issues, up by 24.</li>
! <li>574 issues total, up by 8.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#568">568</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#570">570</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#572">572</a>.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#499">499</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#501">501</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#506">506</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#509">509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#510">510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#511">511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#513">513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#514">514</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#517">517</a> to NAD.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#502">502</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#503">503</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#515">515</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#516">516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#525">525</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#528">528</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#529">529</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#548">548</a> to Open.</li>
! <li>Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#521">521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a> to Ready.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#247">247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#294">294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#369">369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#376">376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#495">495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#497">497</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#505">505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#507">507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#508">508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#519">519</a> to WP.</li>
! <li>Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a> to Review.</li>
  </ul></li>
  </ul>
  </li>
! <li>R41: 
! 2006-02-24 pre-Berlin mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>126 open issues, up by 31.</li>
! <li>440 closed issues, up by 0.</li>
! <li>566 issues total, up by 31.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#546">546</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#547">547</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#548">548</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a> ,<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#552">552</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#554">554</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#555">555</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#558">558</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#560">560</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>.</li>
! <li>Moved <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a> from Ready to Open.</li>
! <li>Reopened <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#309">309</a>.</li>
  </ul></li>
  </ul>
  </li>
- <li>R40: 
- 2005-12-16 mid-term mailing.
- <ul>
- <li><b>Summary:</b><ul>
- <li>95 open issues.</li>
- <li>440 closed issues.</li>
- <li>535 issues total.</li>
- </ul></li>
- <li><b>Details:</b><ul>
- <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#529">529</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#533">533</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>.</li>
- </ul></li>
- </ul>
- </li>
- <li>R39: 
- 2005-10-14 post-Mont Tremblant mailing.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#528">528</a>.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#280">280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#461">461</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#464">464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#465">465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#467">467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#468">468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#474">474</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#496">496</a> from Ready to WP as per the vote from Mont Tremblant.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#247">247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#294">294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#369">369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#376">376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#495">495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#497">497</a> from Review to Ready.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#506">506</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#509">509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#510">510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#511">511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#513">513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#514">514</a> from New to Open.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#505">505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#507">507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#508">508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#519">519</a> from New to Ready.
- Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#500">500</a> from New to NAD.
- Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a> from New to Review.
- </li>
- <li>R38: 
- 2005-07-03 pre-Mont Tremblant mailing.
- Merged open TR1 issues in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>
- </li>
- <li>R37: 
- 2005-06 mid-term mailing.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#503">503</a>.
- </li>
- <li>R36: 
- 2005-04 post-Lillehammer mailing. All issues in "ready" status except
- for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#454">454</a> were moved to "DR" status, and all issues
- previously in "DR" status were moved to "WP".
- </li>
- <li>R35: 
- 2005-03 pre-Lillehammer mailing.
- </li>
- <li>R34: 
- 2005-01 mid-term mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#494">494</a>.
- </li>
- <li>R33: 
- 2004-11 post-Redmond mailing. Reflects actions taken in Redmond.
- </li>
- <li>R32: 
- 2004-09 pre-Redmond mailing: reflects new proposed resolutions and
- new issues received after the 2004-07 mailing.  Added
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#481">481</a>.
- </li>
- <li>R31: 
- 2004-07 mid-term mailing: reflects new proposed resolutions and
- new issues received after the post-Sydney mailing.  Added
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>.
- </li>
- <li>R30: 
- Post-Sydney mailing: reflects decisions made at the Sydney meeting.
- Voted all "Ready" issues from R29 into the working paper.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#460">460</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#462">462</a>.
- </li>
- <li>R29: 
- Pre-Sydney mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#441">441</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#457">457</a>.
- </li>
- <li>R28: 
- Post-Kona mailing: reflects decisions made at the Kona meeting.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#432">432</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#440">440</a>.
- </li>
- <li>R27: 
- Pre-Kona mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#404">404</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>.
- </li>
- <li>R26: 
- Post-Oxford mailing: reflects decisions made at the Oxford meeting.
- All issues in Ready status were voted into DR status.  All issues in
- DR status were voted into WP status.
- </li>
- <li>R25: 
- Pre-Oxford mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#390">390</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#402">402</a>.
- </li>
- <li>R24: 
- Post-Santa Cruz mailing: reflects decisions made at the Santa Cruz
- meeting.  All Ready issues from R23 with the exception of <iref ref="253">, which has been given a new proposed resolution, were
- moved to DR status.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#383">383</a>-<iref ref="389">.  (Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#389">389</a> were discussed
- at the meeting.)  Made progress on issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a>, <iref ref="226">, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#229">229</a>: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a> and <iref ref="229"> have been moved to Ready status, and the only remaining
- concerns with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a> involve wording.
- </iref></iref></iref></iref></li>
- <li>R23: 
- Pre-Santa Cruz mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#367">367</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#382">382</a>.
- Moved issues in the TC to TC status.
- </li>
- <li>R22: 
- Post-Curaçao mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>-<iref ref="366">.
- </iref></li>
- <li>R21: 
- Pre-Curaçao mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#351">351</a>-<iref ref="361">.
- </iref></li>
- <li>R20: 
- Post-Redmond mailing; reflects actions taken in Redmond.  Added
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#336">336</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>, of which issues 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#347">347</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a> were added since Redmond, hence
- not discussed at the meeting.  
- 
- All Ready issues were moved to DR status, with the exception of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#284">284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#241">241</a>, and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#267">267</a>.
- 
- Noteworthy issues discussed at Redmond include 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#120">120</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#202">202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#270">270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#253">253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>.
- </li>
- <li>R19: 
- Pre-Redmond mailing.  Added new issues 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#335">335</a>.
- </li>
- <li>R18: 
- Post-Copenhagen mailing; reflects actions taken in Copenhagen.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#312">312</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#317">317</a>, and discussed
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#271">271</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#314">314</a>.
- 
- Changed status of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#118">118</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#136">136</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#153">153</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#165">165</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#171">171</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#183">183</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#184">184</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#185">185</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#186">186</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#214">214</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#221">221</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#234">234</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#237">237</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#243">243</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#248">248</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#251">251</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#252">252</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#256">256</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#260">260</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#261">261</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#262">262</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#263">263</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#265">265</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#268">268</a>
- to DR.
- 
- Changed status of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#49">49</a>  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#117">117</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#182">182</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#230">230</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#232">232</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#238">238</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#241">241</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#242">242</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#259">259</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#266">266</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#267">267</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#271">271</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#272">272</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#273">273</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#275">275</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#281">281</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#284">284</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#285">285</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#286">286</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#288">288</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#292">292</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#295">295</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#297">297</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#298">298</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#301">301</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#303">303</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#306">306</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#307">307</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#308">308</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#312">312</a>
- to Ready.
- 
- Closed issues 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#277">277</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#279">279</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#287">287</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#289">289</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#293">293</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#302">302</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#313">313</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#314">314</a>
- as NAD.
- 
- </li>
- <li>R17: 
- Pre-Copenhagen mailing.  Converted issues list to XML.  Added proposed
- resolutions for issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#49">49</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#76">76</a>, <iref ref="91">, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#267">267</a>.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#278">278</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#311">311</a>.
- </iref></li>
- <li>R16:  
- post-Toronto mailing; reflects actions taken in Toronto. Added new
- issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#265">265</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#277">277</a>.  Changed status of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#3">3</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#8">8</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#9">9</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#19">19</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#26">26</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#31">31</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#61">61</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#63">63</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#86">86</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#108">108</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#115">115</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#122">122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#127">127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#129">129</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#134">134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#137">137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#142">142</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#144">144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#146">146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#147">147</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#159">159</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#164">164</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#170">170</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#181">181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199">199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#208">208</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#209">209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#210">210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#211">211</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#212">212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#217">217</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#220">220</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#222">222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#223">223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#224">224</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a> to "DR".  Reopened issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#23">23</a>. Reopened
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#187">187</a>. Changed issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#2">2</a> and
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#4">4</a> to NAD. Fixed a typo in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#17">17</a>. Fixed
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#70">70</a>: signature should be changed both places it
- appears. Fixed issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#160">160</a>: previous version didn't fix
- the bug in enough places.
- </li>
- <li>R15: 
- pre-Toronto mailing. Added issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a>. Some small HTML formatting
- changes so that we pass Weblint tests.
- </li>
- <li>R14: 
- post-Tokyo II mailing; reflects committee actions taken in
- Tokyo. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#232">232</a>. (00-0019R1/N1242)
- </li>
- <li>R13: 
- pre-Tokyo II updated: Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#212">212</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a>.
- </li>
- <li>R12: 
- pre-Tokyo II mailing: Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199">199</a> to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#211">211</a>. Added "and paragraph 5" to the proposed resolution
- of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#29">29</a>.  Add further rationale to issue
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#178">178</a>.
- </li>
- <li>R11: 
- post-Kona mailing: Updated to reflect LWG and full committee actions
- in Kona (99-0048/N1224). Note changed resolution of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#4">4</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#38">38</a>. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#196">196</a>
- to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#198">198</a>. Closed issues list split into "defects" and
- "closed" documents.  Changed the proposed resolution of issue
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#4">4</a> to NAD, and changed the wording of proposed resolution
- of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#38">38</a>.
- </li>
- <li>R10: 
- pre-Kona updated.  Added proposed resolutions <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#83">83</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#86">86</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#91">91</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#92">92</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a>. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a> to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#195">195</a>. (99-0033/D1209, 14 Oct 99)
- </li>
- <li>R9: 
- pre-Kona mailing.  Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a> to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#189">189</a>. Issues list split into separate "active" and
- "closed" documents. (99-0030/N1206, 25 Aug 99)
- </li>
- <li>R8: 
- post-Dublin mailing. Updated to reflect LWG and full committee actions
- in Dublin. (99-0016/N1193, 21 Apr 99)
- </li>
- <li>R7: 
- pre-Dublin updated: Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#130">130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#131">131</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#132">132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#133">133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#134">134</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#135">135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#136">136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#137">137</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#139">139</a> (31 Mar 99)
- </li>
- <li>R6: 
- pre-Dublin mailing. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#127">127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>,
- and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#129">129</a>.  (99-0007/N1194, 22 Feb 99)
- </li>
- <li>R5: 
- update issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>; added issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#126">126</a>. Format revisions to prepare
- for making list public. (30 Dec 98)
- </li>
- <li>R4: 
- post-Santa Cruz II updated: Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#110">110</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#113">113</a> added, several
- issues corrected. (22 Oct 98)
- </li>
- <li>R3: 
- post-Santa Cruz II: Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#94">94</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a>
- added, many issues updated to reflect LWG consensus (12 Oct 98)
- </li>
- <li>R2: 
- pre-Santa Cruz II: Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#73">73</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#93">93</a> added,
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#17">17</a> updated. (29 Sep 98)
- </li>
- <li>R1: 
- Correction to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#55">55</a> resolution, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a> code
- format, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#64">64</a> title. (17 Sep 98)
- </li>
  </ul>
  
  <h2><a name="Status"></a>Issue Status</h2>
  
    <p><b><a name="New">New</a></b> - The issue has not yet been
    reviewed by the LWG. Any <b>Proposed Resolution</b> is purely a
    suggestion from the issue submitter, and should not be construed as
--- 154,312 ----
  
  <h2>Revision History</h2>
  <ul>
! <li>R93: 2014-05-22 2015 post-Lenexa mailing<ul>
  <li><b>Summary:</b><ul>
! <li>256 open issues, down by 36.</li>
! <li>1770 closed issues, up by 48.</li>
! <li>2026 issues total, up by 12.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 2 Ready issues: <a href="lwg-active.html#2492">2492</a>, <a href="lwg-active.html#2494">2494</a>.</li>
! <li>Added the following 10 New issues: <a href="lwg-active.html#2493">2493</a>, <a href="lwg-active.html#2495">2495</a>, <a href="lwg-active.html#2496">2496</a>, <a href="lwg-active.html#2497">2497</a>, <a href="lwg-active.html#2498">2498</a>, <a href="lwg-active.html#2499">2499</a>, <a href="lwg-active.html#2500">2500</a>, <a href="lwg-active.html#2501">2501</a>, <a href="lwg-active.html#2502">2502</a>, <a href="lwg-active.html#2503">2503</a>.</li>
! <li>Changed the following 2 issues to Ready (from Review): <a href="lwg-active.html#2111">2111</a>, <a href="lwg-active.html#2380">2380</a>.</li>
! <li>Changed the following 20 issues to Ready (from New): <a href="lwg-active.html#2244">2244</a>, <a href="lwg-active.html#2250">2250</a>, <a href="lwg-active.html#2259">2259</a>, <a href="lwg-active.html#2336">2336</a>, <a href="lwg-active.html#2353">2353</a>, <a href="lwg-active.html#2367">2367</a>, <a href="lwg-active.html#2384">2384</a>, <a href="lwg-active.html#2385">2385</a>, <a href="lwg-active.html#2435">2435</a>, <a href="lwg-active.html#2462">2462</a>, <a href="lwg-active.html#2466">2466</a>, <a href="lwg-active.html#2473">2473</a>, <a href="lwg-active.html#2476">2476</a>, <a href="lwg-active.html#2477">2477</a>, <a href="lwg-active.html#2483">2483</a>, <a href="lwg-active.html#2484">2484</a>, <a href="lwg-active.html#2485">2485</a>, <a href="lwg-active.html#2486">2486</a>, <a href="lwg-active.html#2487">2487</a>, <a href="lwg-active.html#2489">2489</a>.</li>
! <li>Changed the following 12 issues to Ready (from Open): <a href="lwg-active.html#1169">1169</a>, <a href="lwg-active.html#2072">2072</a>, <a href="lwg-active.html#2101">2101</a>, <a href="lwg-active.html#2119">2119</a>, <a href="lwg-active.html#2127">2127</a>, <a href="lwg-active.html#2133">2133</a>, <a href="lwg-active.html#2156">2156</a>, <a href="lwg-active.html#2181">2181</a>, <a href="lwg-active.html#2218">2218</a>, <a href="lwg-active.html#2219">2219</a>, <a href="lwg-active.html#2447">2447</a>, <a href="lwg-active.html#2469">2469</a>.</li>
! <li>Changed the following issue to Tentatively Ready (from Open): <a href="lwg-active.html#2224">2224</a>.</li>
! <li>Changed the following issue to Review (from New): <a href="lwg-active.html#2296">2296</a>.</li>
! <li>Changed the following issue to Review (from Open): <a href="lwg-active.html#2328">2328</a>.</li>
! <li>Changed the following 11 issues to Open (from New): <a href="lwg-active.html#2262">2262</a>, <a href="lwg-active.html#2289">2289</a>, <a href="lwg-active.html#2338">2338</a>, <a href="lwg-active.html#2348">2348</a>, <a href="lwg-active.html#2349">2349</a>, <a href="lwg-active.html#2370">2370</a>, <a href="lwg-active.html#2398">2398</a>, <a href="lwg-active.html#2402">2402</a>, <a href="lwg-active.html#2422">2422</a>, <a href="lwg-active.html#2450">2450</a>, <a href="lwg-active.html#2456">2456</a>.</li>
! <li>Changed the following 8 issues to Open (from SG1): <a href="lwg-active.html#2245">2245</a>, <a href="lwg-active.html#2265">2265</a>, <a href="lwg-active.html#2276">2276</a>, <a href="lwg-active.html#2309">2309</a>, <a href="lwg-active.html#2363">2363</a>, <a href="lwg-active.html#2379">2379</a>, <a href="lwg-active.html#2426">2426</a>, <a href="lwg-active.html#2441">2441</a>.</li>
! <li>Changed the following issue to LEWG (from New): <a href="lwg-active.html#2372">2372</a>.</li>
! <li>Changed the following issue to EWG (from New): <a href="lwg-active.html#2432">2432</a>.</li>
! <li>Changed the following issue to Deferred (from Open): <a href="lwg-active.html#2202">2202</a>.</li>
! <li>Changed the following 14 issues to WP (from Ready): <a href="lwg-defects.html#2160">2160</a>, <a href="lwg-defects.html#2168">2168</a>, <a href="lwg-defects.html#2364">2364</a>, <a href="lwg-defects.html#2403">2403</a>, <a href="lwg-defects.html#2406">2406</a>, <a href="lwg-defects.html#2411">2411</a>, <a href="lwg-defects.html#2425">2425</a>, <a href="lwg-defects.html#2427">2427</a>, <a href="lwg-defects.html#2428">2428</a>, <a href="lwg-defects.html#2433">2433</a>, <a href="lwg-defects.html#2434">2434</a>, <a href="lwg-defects.html#2438">2438</a>, <a href="lwg-defects.html#2439">2439</a>, <a href="lwg-defects.html#2440">2440</a>.</li>
! <li>Changed the following 18 issues to WP (from Tentatively Ready): <a href="lwg-defects.html#2059">2059</a>, <a href="lwg-defects.html#2076">2076</a>, <a href="lwg-defects.html#2239">2239</a>, <a href="lwg-defects.html#2369">2369</a>, <a href="lwg-defects.html#2378">2378</a>, <a href="lwg-defects.html#2410">2410</a>, <a href="lwg-defects.html#2415">2415</a>, <a href="lwg-defects.html#2418">2418</a>, <a href="lwg-defects.html#2437">2437</a>, <a href="lwg-defects.html#2448">2448</a>, <a href="lwg-defects.html#2454">2454</a>, <a href="lwg-defects.html#2455">2455</a>, <a href="lwg-defects.html#2458">2458</a>, <a href="lwg-defects.html#2459">2459</a>, <a href="lwg-defects.html#2463">2463</a>, <a href="lwg-defects.html#2467">2467</a>, <a href="lwg-defects.html#2470">2470</a>, <a href="lwg-defects.html#2482">2482</a>.</li>
! <li>Changed the following 3 issues to WP (from New): <a href="lwg-defects.html#2420">2420</a>, <a href="lwg-defects.html#2464">2464</a>, <a href="lwg-defects.html#2488">2488</a>.</li>
! <li>Changed the following issue to WP (from Open): <a href="lwg-defects.html#2063">2063</a>.</li>
! <li>Changed the following 2 issues to WP (from SG1): <a href="lwg-defects.html#2407">2407</a>, <a href="lwg-defects.html#2442">2442</a>.</li>
! <li>Changed the following issue to Resolved (from Review): <a href="lwg-defects.html#2228">2228</a>.</li>
! <li>Changed the following 3 issues to Resolved (from Open): <a href="lwg-defects.html#1526">1526</a>, <a href="lwg-defects.html#2274">2274</a>, <a href="lwg-defects.html#2397">2397</a>.</li>
! <li>Changed the following 5 issues to NAD (from New): <a href="lwg-closed.html#2079">2079</a>, <a href="lwg-closed.html#2251">2251</a>, <a href="lwg-closed.html#2351">2351</a>, <a href="lwg-closed.html#2373">2373</a>, <a href="lwg-closed.html#2386">2386</a>.</li>
! <li>Changed the following issue to NAD (from Open): <a href="lwg-closed.html#2388">2388</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R92: 
! 2015-04-09 pre-Lenexa mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>292 open issues, up by 33.</li>
! <li>1722 closed issues, up by 0.</li>
! <li>2014 issues total, up by 33.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 5 Tentatively Ready issues: <a href="lwg-active.html#2459">2459</a>, <a href="lwg-active.html#2463">2463</a>, <a href="lwg-active.html#2467">2467</a>, <a href="lwg-active.html#2470">2470</a>, <a href="lwg-active.html#2482">2482</a>.</li>
! <li>Added the following 27 New issues: <a href="lwg-active.html#2460">2460</a>, <a href="lwg-active.html#2461">2461</a>, <a href="lwg-active.html#2462">2462</a>, <a href="lwg-active.html#2464">2464</a>, <a href="lwg-active.html#2465">2465</a>, <a href="lwg-active.html#2466">2466</a>, <a href="lwg-active.html#2468">2468</a>, <a href="lwg-active.html#2471">2471</a>, <a href="lwg-active.html#2472">2472</a>, <a href="lwg-active.html#2473">2473</a>, <a href="lwg-active.html#2474">2474</a>, <a href="lwg-active.html#2475">2475</a>, <a href="lwg-active.html#2476">2476</a>, <a href="lwg-active.html#2477">2477</a>, <a href="lwg-active.html#2478">2478</a>, <a href="lwg-active.html#2479">2479</a>, <a href="lwg-active.html#2480">2480</a>, <a href="lwg-active.html#2481">2481</a>, <a href="lwg-active.html#2483">2483</a>, <a href="lwg-active.html#2484">2484</a>, <a href="lwg-active.html#2485">2485</a>, <a href="lwg-active.html#2486">2486</a>, <a href="lwg-active.html#2487">2487</a>, <a href="lwg-active.html#2488">2488</a>, <a href="lwg-active.html#2489">2489</a>, <a href="lwg-active.html#2490">2490</a>, <a href="lwg-active.html#2491">2491</a>.</li>
! <li>Added the following Open issue: <a href="lwg-active.html#2469">2469</a>.</li>
! <li>Changed the following issue to Tentatively Ready (from Review): <a href="lwg-active.html#2378">2378</a>.</li>
! <li>Changed the following 11 issues to Tentatively Ready (from New): <a href="lwg-active.html#2076">2076</a>, <a href="lwg-active.html#2239">2239</a>, <a href="lwg-active.html#2369">2369</a>, <a href="lwg-active.html#2410">2410</a>, <a href="lwg-active.html#2415">2415</a>, <a href="lwg-active.html#2418">2418</a>, <a href="lwg-active.html#2437">2437</a>, <a href="lwg-active.html#2448">2448</a>, <a href="lwg-active.html#2454">2454</a>, <a href="lwg-active.html#2455">2455</a>, <a href="lwg-active.html#2458">2458</a>.</li>
! <li>Changed the following issue to Tentatively Ready (from Open): <a href="lwg-active.html#2059">2059</a>.</li>
! <li>Changed the following issue to Tentatively NAD (from New): <a href="lwg-active.html#2337">2337</a>.</li>
! <li>Changed the following issue to Tentatively NAD (from Open): <a href="lwg-active.html#760">760</a>.</li>
! <li>Changed the following 5 issues to Open (from New): <a href="lwg-active.html#2312">2312</a>, <a href="lwg-active.html#2388">2388</a>, <a href="lwg-active.html#2393">2393</a>, <a href="lwg-active.html#2444">2444</a>, <a href="lwg-active.html#2447">2447</a>.</li>
! <li>Changed the following 4 issues to LEWG (from New): <a href="lwg-active.html#2391">2391</a>, <a href="lwg-active.html#2417">2417</a>, <a href="lwg-active.html#2436">2436</a>, <a href="lwg-active.html#2451">2451</a>.</li>
! <li>Changed the following issue to EWG (from Open): <a href="lwg-active.html#2089">2089</a>.</li>
! <li>Changed the following issue to Core (from New): <a href="lwg-active.html#2452">2452</a>.</li>
! <li>Changed the following 13 issues to SG1 (from New): <a href="lwg-active.html#2236">2236</a>, <a href="lwg-active.html#2245">2245</a>, <a href="lwg-active.html#2265">2265</a>, <a href="lwg-active.html#2276">2276</a>, <a href="lwg-active.html#2309">2309</a>, <a href="lwg-active.html#2334">2334</a>, <a href="lwg-active.html#2363">2363</a>, <a href="lwg-active.html#2379">2379</a>, <a href="lwg-active.html#2407">2407</a>, <a href="lwg-active.html#2412">2412</a>, <a href="lwg-active.html#2426">2426</a>, <a href="lwg-active.html#2442">2442</a>, <a href="lwg-active.html#2445">2445</a>.</li>
! <li>Changed the following issue to SG1 (from Open): <a href="lwg-active.html#2441">2441</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R91: 
! 2014-11-23 post-Urbana mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>259 open issues, up by 32.</li>
! <li>1722 closed issues, down by 20.</li>
! <li>1981 issues total, up by 12.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 12 New issues: <a href="lwg-active.html#2447">2447</a>, <a href="lwg-defects.html#2448">2448</a>, <a href="lwg-active.html#2449">2449</a>, <a href="lwg-active.html#2450">2450</a>, <a href="lwg-active.html#2451">2451</a>, <a href="lwg-active.html#2452">2452</a>, <a href="lwg-active.html#2453">2453</a>, <a href="lwg-defects.html#2454">2454</a>, <a href="lwg-defects.html#2455">2455</a>, <a href="lwg-active.html#2456">2456</a>, <a href="lwg-active.html#2457">2457</a>, <a href="lwg-defects.html#2458">2458</a>.</li>
! <li>Changed the following 2 issues to Ready (from Review): <a href="lwg-defects.html#2160">2160</a>, <a href="lwg-defects.html#2364">2364</a>.</li>
! <li>Changed the following 11 issues to Ready (from New): <a href="lwg-defects.html#2403">2403</a>, <a href="lwg-defects.html#2406">2406</a>, <a href="lwg-defects.html#2411">2411</a>, <a href="lwg-defects.html#2425">2425</a>, <a href="lwg-defects.html#2427">2427</a>, <a href="lwg-defects.html#2428">2428</a>, <a href="lwg-defects.html#2433">2433</a>, <a href="lwg-defects.html#2434">2434</a>, <a href="lwg-defects.html#2438">2438</a>, <a href="lwg-defects.html#2439">2439</a>, <a href="lwg-defects.html#2440">2440</a>.</li>
! <li>Changed the following issue to Ready (from Open): <a href="lwg-defects.html#2168">2168</a>.</li>
! <li>Changed the following issue to Review (from New): <a href="lwg-active.html#2424">2424</a>.</li>
! <li>Changed the following 5 issues to Open (from New): <a href="lwg-active.html#2307">2307</a>, <a href="lwg-active.html#2310">2310</a>, <a href="lwg-active.html#2383">2383</a>, <a href="lwg-active.html#2414">2414</a>, <a href="lwg-active.html#2441">2441</a>.</li>
! <li>Changed the following 2 issues to Open (from NAD Future): <a href="lwg-active.html#760">760</a>, <a href="lwg-active.html#1173">1173</a>.</li>
! <li>Changed the following 4 issues to LEWG (from New): <a href="lwg-active.html#2419">2419</a>, <a href="lwg-active.html#2430">2430</a>, <a href="lwg-active.html#2443">2443</a>, <a href="lwg-active.html#2446">2446</a>.</li>
! <li>Changed the following 48 issues to LEWG (from NAD Future): <a href="lwg-active.html#255">255</a>, <a href="lwg-active.html#423">423</a>, <a href="lwg-active.html#484">484</a>, <a href="lwg-active.html#523">523</a>, <a href="lwg-active.html#532">532</a>, <a href="lwg-active.html#708">708</a>, <a href="lwg-active.html#839">839</a>, <a href="lwg-active.html#851">851</a>, <a href="lwg-active.html#877">877</a>, <a href="lwg-active.html#933">933</a>, <a href="lwg-active.html#935">935</a>, <a href="lwg-active.html#936">936</a>, <a href="lwg-active.html#961">961</a>, <a href="lwg-active.html#1025">1025</a>, <a href="lwg-active.html#1031">1031</a>, <a href="lwg-active.html#1041">1041</a>, <a href="lwg-active.html#1052">1052</a>, <a href="lwg-active.html#1053">1053</a>, <a href="lwg-active.html#1112">1112</a>, <a href="lwg-active.html#1120">1120</a>, <a href="lwg-active.html#1121">1121</a>, <a href="lwg-active.html#1150">1150</a>, <a href="lwg-active.html#1154">1154</a>, <a href="lwg-active.html#1184">1184</a>, <a href="lwg-active.html#1188">1188</a>, <a href="lwg-active.html#1201">1201</a>, <a href="lwg-active.html#1203">1203</a>, <a href="lwg-active.html#1217">1217</a>, <a href="lwg-active.html#1235">1235</a>, <a href="lwg-active.html#1238">1238</a>, <a href="lwg-active.html#1242">1242</a>, <a href="lwg-active.html#1282">1282</a>, <a href="lwg-active.html#1289">1289</a>, <a href="lwg-active.html#1317">1317</a>, <a href="lwg-active.html#1320">1320</a>, <a href="lwg-active.html#1396">1396</a>, <a href="lwg-active.html#1406">1406</a>, <a href="lwg-active.html#1422">1422</a>, <a href="lwg-active.html#1459">1459</a>, <a href="lwg-active.html#1484">1484</a>, <a href="lwg-active.html#1488">1488</a>, <a href="lwg-active.html#1493">1493</a>, <a href="lwg-active.html#1499">1499</a>, <a href="lwg-active.html#1521">1521</a>, <a href="lwg-active.html#2040">2040</a>, <a href="lwg-active.html#2055">2055</a>, <a href="lwg-active.html#2226">2226</a>, <a href="lwg-active.html#2232">2232</a>.</li>
! <li>Changed the following 2 issues to Pending NAD (from Tentatively NAD): <a href="lwg-closed.html#2302">2302</a>, <a href="lwg-closed.html#2382">2382</a>.</li>
! <li>Changed the following 11 issues to WP (from Ready): <a href="lwg-defects.html#2016">2016</a>, <a href="lwg-defects.html#2170">2170</a>, <a href="lwg-defects.html#2340">2340</a>, <a href="lwg-defects.html#2354">2354</a>, <a href="lwg-defects.html#2377">2377</a>, <a href="lwg-defects.html#2396">2396</a>, <a href="lwg-defects.html#2399">2399</a>, <a href="lwg-defects.html#2400">2400</a>, <a href="lwg-defects.html#2401">2401</a>, <a href="lwg-defects.html#2404">2404</a>, <a href="lwg-defects.html#2408">2408</a>.</li>
! <li>Changed the following 12 issues to WP (from Tentatively Ready): <a href="lwg-defects.html#2106">2106</a>, <a href="lwg-defects.html#2129">2129</a>, <a href="lwg-defects.html#2212">2212</a>, <a href="lwg-defects.html#2217">2217</a>, <a href="lwg-defects.html#2230">2230</a>, <a href="lwg-defects.html#2233">2233</a>, <a href="lwg-defects.html#2266">2266</a>, <a href="lwg-defects.html#2325">2325</a>, <a href="lwg-defects.html#2361">2361</a>, <a href="lwg-defects.html#2365">2365</a>, <a href="lwg-defects.html#2376">2376</a>, <a href="lwg-defects.html#2387">2387</a>.</li>
! <li>Changed the following issue to Resolved (from Ready): <a href="lwg-defects.html#2319">2319</a>.</li>
! <li>Changed the following issue to Resolved (from Review): <a href="lwg-defects.html#2118">2118</a>.</li>
! <li>Changed the following issue to Resolved (from New): <a href="lwg-defects.html#2416">2416</a>.</li>
! <li>Changed the following issue to Resolved (from Open): <a href="lwg-defects.html#2108">2108</a>.</li>
! <li>Changed the following issue to NAD (from New): <a href="lwg-closed.html#2429">2429</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R90: 
! 2014-10-13 pre-Urbana mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>227 open issues, up by 31.</li>
! <li>1742 closed issues, up by 0.</li>
! <li>1969 issues total, up by 31.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 31 New issues: <a href="lwg-defects.html#2416">2416</a>, <a href="lwg-active.html#2417">2417</a>, <a href="lwg-defects.html#2418">2418</a>, <a href="lwg-active.html#2419">2419</a>, <a href="lwg-defects.html#2420">2420</a>, <a href="lwg-active.html#2421">2421</a>, <a href="lwg-active.html#2422">2422</a>, <a href="lwg-active.html#2423">2423</a>, <a href="lwg-active.html#2424">2424</a>, <a href="lwg-defects.html#2425">2425</a>, <a href="lwg-active.html#2426">2426</a>, <a href="lwg-defects.html#2427">2427</a>, <a href="lwg-defects.html#2428">2428</a>, <a href="lwg-closed.html#2429">2429</a>, <a href="lwg-active.html#2430">2430</a>, <a href="lwg-active.html#2431">2431</a>, <a href="lwg-active.html#2432">2432</a>, <a href="lwg-defects.html#2433">2433</a>, <a href="lwg-defects.html#2434">2434</a>, <a href="lwg-active.html#2435">2435</a>, <a href="lwg-active.html#2436">2436</a>, <a href="lwg-defects.html#2437">2437</a>, <a href="lwg-defects.html#2438">2438</a>, <a href="lwg-defects.html#2439">2439</a>, <a href="lwg-defects.html#2440">2440</a>, <a href="lwg-active.html#2441">2441</a>, <a href="lwg-defects.html#2442">2442</a>, <a href="lwg-active.html#2443">2443</a>, <a href="lwg-active.html#2444">2444</a>, <a href="lwg-active.html#2445">2445</a>, <a href="lwg-active.html#2446">2446</a>.</li>
! <li>No issues changed.</li>
  </ul></li>
  </ul>
  </li>
! <li>R89: 
! 2014-07-08 post-Rapperswil mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>196 open issues, up by 14.</li>
! <li>1742 closed issues, up by 12.</li>
! <li>1938 issues total, up by 26.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 6 Ready issues: <a href="lwg-defects.html#2396">2396</a>, <a href="lwg-defects.html#2399">2399</a>, <a href="lwg-defects.html#2400">2400</a>, <a href="lwg-defects.html#2401">2401</a>, <a href="lwg-defects.html#2404">2404</a>, <a href="lwg-defects.html#2408">2408</a>.</li>
! <li>Added the following 15 New issues: <a href="lwg-active.html#2391">2391</a>, <a href="lwg-active.html#2392">2392</a>, <a href="lwg-active.html#2393">2393</a>, <a href="lwg-active.html#2394">2394</a>, <a href="lwg-active.html#2398">2398</a>, <a href="lwg-active.html#2402">2402</a>, <a href="lwg-defects.html#2403">2403</a>, <a href="lwg-defects.html#2406">2406</a>, <a href="lwg-defects.html#2407">2407</a>, <a href="lwg-defects.html#2410">2410</a>, <a href="lwg-defects.html#2411">2411</a>, <a href="lwg-active.html#2412">2412</a>, <a href="lwg-active.html#2413">2413</a>, <a href="lwg-active.html#2414">2414</a>, <a href="lwg-defects.html#2415">2415</a>.</li>
! <li>Added the following Open issue: <a href="lwg-defects.html#2397">2397</a>.</li>
! <li>Added the following 3 WP issues: <a href="lwg-defects.html#2390">2390</a>, <a href="lwg-defects.html#2395">2395</a>, <a href="lwg-defects.html#2409">2409</a>.</li>
! <li>Added the following NAD issue: <a href="lwg-closed.html#2405">2405</a>.</li>
! <li>Changed the following issue to Ready (from New): <a href="lwg-defects.html#2377">2377</a>.</li>
! <li>Changed the following 2 issues to Ready (from Deferred): <a href="lwg-active.html#2253">2253</a>, <a href="lwg-active.html#2255">2255</a>.</li>
! <li>Changed the following 2 issues to Tentatively Ready (from New): <a href="lwg-defects.html#2325">2325</a>, <a href="lwg-defects.html#2387">2387</a>.</li>
! <li>Changed the following issue to Tentatively NAD (from New): <a href="lwg-closed.html#2382">2382</a>.</li>
! <li>Changed the following 3 issues to Review (from New): <a href="lwg-defects.html#2364">2364</a>, <a href="lwg-defects.html#2378">2378</a>, <a href="lwg-active.html#2380">2380</a>.</li>
! <li>Changed the following 2 issues to Review (from Open): <a href="lwg-defects.html#2118">2118</a>, <a href="lwg-defects.html#2160">2160</a>.</li>
! <li>Changed the following 3 issues to Open (from New): <a href="lwg-defects.html#2168">2168</a>, <a href="lwg-active.html#2238">2238</a>, <a href="lwg-active.html#2273">2273</a>.</li>
! <li>Changed the following 3 issues to Open (from Deferred): <a href="lwg-active.html#2254">2254</a>, <a href="lwg-active.html#2264">2264</a>, <a href="lwg-active.html#2277">2277</a>.</li>
! <li>Changed the following 3 issues to WP (from New): <a href="lwg-defects.html#2371">2371</a>, <a href="lwg-defects.html#2374">2374</a>, <a href="lwg-defects.html#2389">2389</a>.</li>
! <li>Changed the following 4 issues to Resolved (from Deferred): <a href="lwg-defects.html#2282">2282</a>, <a href="lwg-defects.html#2283">2283</a>, <a href="lwg-defects.html#2287">2287</a>, <a href="lwg-defects.html#2333">2333</a>.</li>
! <li>Changed the following issue to NAD (from Deferred): <a href="lwg-closed.html#2305">2305</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R88: 
! 2014-05-24 pre-Rapperswil mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>182 open issues, up by 29.</li>
! <li>1730 closed issues, up by 0.</li>
! <li>1912 issues total, up by 29.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 3 Tentatively Ready issues: <a href="lwg-defects.html#2361">2361</a>, <a href="lwg-defects.html#2365">2365</a>, <a href="lwg-defects.html#2376">2376</a>.</li>
! <li>Added the following 26 New issues: <a href="lwg-active.html#2362">2362</a>, <a href="lwg-active.html#2363">2363</a>, <a href="lwg-defects.html#2364">2364</a>, <a href="lwg-active.html#2366">2366</a>, <a href="lwg-active.html#2367">2367</a>, <a href="lwg-active.html#2368">2368</a>, <a href="lwg-defects.html#2369">2369</a>, <a href="lwg-active.html#2370">2370</a>, <a href="lwg-defects.html#2371">2371</a>, <a href="lwg-active.html#2372">2372</a>, <a href="lwg-closed.html#2373">2373</a>, <a href="lwg-defects.html#2374">2374</a>, <a href="lwg-active.html#2375">2375</a>, <a href="lwg-defects.html#2377">2377</a>, <a href="lwg-defects.html#2378">2378</a>, <a href="lwg-active.html#2379">2379</a>, <a href="lwg-active.html#2380">2380</a>, <a href="lwg-active.html#2381">2381</a>, <a href="lwg-closed.html#2382">2382</a>, <a href="lwg-active.html#2383">2383</a>, <a href="lwg-active.html#2384">2384</a>, <a href="lwg-active.html#2385">2385</a>, <a href="lwg-closed.html#2386">2386</a>, <a href="lwg-defects.html#2387">2387</a>, <a href="lwg-closed.html#2388">2388</a>, <a href="lwg-defects.html#2389">2389</a>.</li>
! <li>Changed the following 5 issues to Tentatively Ready (from Open): <a href="lwg-defects.html#2106">2106</a>, <a href="lwg-defects.html#2129">2129</a>, <a href="lwg-defects.html#2212">2212</a>, <a href="lwg-defects.html#2230">2230</a>, <a href="lwg-defects.html#2233">2233</a>.</li>
  </ul></li>
  </ul>
  </li>
  </ul>
  
  <h2><a name="Status"></a>Issue Status</h2>
  
+   <p>Issues reported to the LWG transition through a variety of statuses,
+   indicating their progress towards a resolution.  Typically, most issues
+   will flow through the following stages.
+   </p>
+ 
    <p><b><a name="New">New</a></b> - The issue has not yet been
    reviewed by the LWG. Any <b>Proposed Resolution</b> is purely a
    suggestion from the issue submitter, and should not be construed as
*************** format, <a href="http://www.open-std.org
*** 1219,1224 ****
--- 331,376 ----
    font. Such comments are for information only and should not be given
    undue importance.</p>
  
+   <p><b><a name="Review">Review</a></b> - Exact wording of a
+   <b>Proposed Resolution</b> is now available for review on an issue
+   for which the LWG previously reached informal consensus.</p>
+ 
+   <p><b><a name="Ready">Ready</a></b> - The LWG has reached consensus
+   that the issue is a defect in the Standard, the <b>Proposed
+   Resolution</b> is correct, and the issue is ready to forward to the
+   full committee for further action as a Defect Report (DR).</p>
+ 
+   <p>Typically, an issue must have a proposed resolution in the currently
+   published issues list, whose wording does not change during LWG review, to
+   move to the Ready status.</p>
+ 
+   <p><b><a name="Voting">Voting</a></b> - This status should not be seen
+   in a published issues list, but is a marker for use during meetings to
+   indicate an issues was Ready in the pre-meeting mailing, the <b>Proposed
+   Resolution</b> is correct, and the issue will be offered to the working
+   group at the end of the current meeting to apply to the current working
+   paper (WP) or to close in some other appropriate manner.  This easily
+   distinguishes such issues from those moving to Ready status during the
+   meeting itself, that should not be forwarded until the next meeting.  If
+   the issue does not move forward, it should fall back to one of the other
+   open states before the next list is published.</p>
+ 
+   <p><b><a name="Immediate">Immediate</a></b> - This status should not be
+   seen in a published issues list, but is a marker for use during meetings
+   to indicate an issues was not Ready in the pre-meeting mailing, but the
+   <b>Proposed Resolution</b> is correct, and the issue will be offered to
+   the working group at the end of the current meeting to apply to the
+   current working paper (WP) or to close in some other appropriate manner.
+   This status is used only rarely, typically for fixes that are both small
+   and obvious, and usually within a meeting of the expected publication of
+   a revised standard.  If the issue does not move forward, it should fall
+   back to one of the other open states before the next list is published.</p>
+ 
+   <p>In addition, there are a few ways to categorise and issue that remains
+   open to a resolution within the library, but is not actively being worked
+   on.
+   </p>
+ 
    <p><b><a name="Deferred">Deferred</a></b> - The LWG has discussed the issue,
    is not yet ready to move the issue forward, but neither does it deem the
    issue significant enough to delay publishing a standard or Technical Report.
*************** format, <a href="http://www.open-std.org
*** 1231,1270 ****
    font. Such comments are for information only and should not be given
    undue importance.</p>
  
!   <p><b><a name="Dup">Dup</a></b> - The LWG has reached consensus that
!   the issue is a duplicate of another issue, and will not be further
!   dealt with. A <b>Rationale</b> identifies the duplicated issue's
!   issue number.  </p>
! 
!   <p><b><a name="NAD">NAD</a></b> - The LWG has reached consensus that
!   the issue is not a defect in the Standard.</p>
! 
!   <p><b><a name="NAD Editorial">NAD Editorial</a></b> - The LWG has reached consensus that
!   the issue can either be handled editorially, or is handled by a paper (usually
!   linked to in the rationale).</p>
! 
!   <p><b><a name="NAD Concepts">NAD Concepts</a></b> - The LWG has reached consensus that
!   the issue is NAD for now, but represents a real issue when the library is
!   done with language-supported concepts.</p>
! 
!   <p><b><a name="NAD Future">NAD Future</a></b> - In addition to the regular
!   status, the LWG believes that this issue should be revisited at the
!   next revision of the standard.</p>
  
!   <p><b><a name="Review">Review</a></b> - Exact wording of a
!   <b>Proposed Resolution</b> is now available for review on an issue
!   for which the LWG previously reached informal consensus.</p>
  
!   <p><b><a name="Ready">Ready</a></b> - The LWG has reached consensus
!   that the issue is a defect in the Standard, the <b>Proposed
!   Resolution</b> is correct, and the issue is ready to forward to the
!   full committee for further action as a Defect Report (DR).</p>
  
!   <p><b><a name="Resolved">Resolved</a></b> - The LWG has reached consensus
!   that the issue is a defect in the Standard, but the resolution adopted to
!   resolve the issue came via some other mechanism than this issue in the
!   list - typically by applying a formal paper, occasionally as a side effect
!   of consolidating several interacting issue resolutions into a single issue.</p>
  
    <p><b><a name="DR">DR</a></b> - (Defect Report) - The full WG21/PL22.16
    committee has voted to forward the issue to the Project Editor to be
--- 383,414 ----
    font. Such comments are for information only and should not be given
    undue importance.</p>
  
!   <p><b><a name="Core">Core</a></b> - The LWG has discussed the issue, and feels
!   that some key part of resolving the issue is better handled by a cleanup of
!   the language in the Core part of the standard.  The issue is passed to the Core
!   Working Group, which should ideally open a corresponding issue that can be
!   linked from the library issue.  Such issues will be revisitted after Core have
!   made (or declined to make) any changes.
!   </p>
  
!   <p><b><a name="EWG">EWG</a></b> - The LWG has discussed the issue, and wonder
!   that some key part of resolving the issue is better handled by some (hopefully
!   small) extension to the language.  The issue is passed to the Evolution Working
!   Group, which should ideally open a corresponding issue that can be linked from
!   the library issue.  Such issues will be revisitted after Evoltion have made (or
!   declined to make) any recommendations.  Positive recommendations from EWG will
!   often mean the issue transition to <i>Core</i> status while we wait for some
!   proposed new feature to land in the working paper.
!   </p>
  
!   <p><b><a name="LEWG">LEWG</a></b> - The LWG has discussed the issue, and deemd
!   the issue is either an extension, however small, or changes the library design
!   in some fundamental way, and so has delegated the initial work to the Library
!   Evolution Working Group.
!   </p>
  
!   <p>Ultimately, all issues should reach closure with one of the following statuses.
!   </p>
  
    <p><b><a name="DR">DR</a></b> - (Defect Report) - The full WG21/PL22.16
    committee has voted to forward the issue to the Project Editor to be
*************** format, <a href="http://www.open-std.org
*** 1274,1905 ****
    accords the status of DR to all these Defect Reports regardless of
    where they are in that process.</p>
  
    <p><b><a name="TC1">TC1</a></b> - (Technical Corrigenda 1) - The full
    WG21/PL22.16 committee has voted to accept the Defect Report's Proposed
    Resolution as a Technical Corrigenda.  Action on this issue is thus
    complete and no further action is possible under ISO rules.</p>
  
!   <p><b><a name="CD1">CD1</a></b> - (Committee Draft 2008) - The full
!   WG21/PL22.16 committee has voted to accept the Defect Report's Proposed
!   Resolution into the Fall 2008 Committee Draft.</p>
  
!   <p><b><a name="TRDec">TRDec</a></b> - (Decimal TR defect) - The 
!   LWG has voted to accept the Defect Report's Proposed
!   Resolution into the Decimal TR.  Action on this issue is thus
!   complete and no further action is expected.</p>
  
!   <p><b><a name="WP">WP</a></b> - (Working Paper) - The proposed
!   resolution has not been accepted as a Technical Corrigendum, but
!   the full WG21/PL22.16 committee has voted to apply the Defect Report's Proposed
!   Resolution to the working paper.</p>
  
    <p><b>Tentatively</b> - This is a <i>status qualifier</i>.  The issue has
!   been reviewed online, or at an unofficial meeting, but not in an official meeting, and some support has been formed
!   for the qualified status.  Tentatively qualified issues may be moved to the unqualified status
!   and forwarded to full committee (if Ready) within the same meeting.  Unlike Ready issues, Tentatively Ready issues
!   will be reviewed in subcommittee prior to forwarding to full committee.  When a status is
!   qualified with Tentatively, the issue is still considered active.</p>
  
!   <p><b>Pending</b> - This is a <i>status qualifier</i>.  When prepended to
!   a status this indicates the issue has been
!   processed by the committee, and a decision has been made to move the issue to
!   the associated unqualified status.  However for logistical reasons the indicated
!   outcome of the issue has not yet appeared in the latest working paper.
  
!   </p><p>Issues are always given the status of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a> when
    they first appear on the issues list. They may progress to
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a> or <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Review">Review</a> while the LWG
!   is actively working on them. When the LWG has reached consensus on
    the disposition of an issue, the status will then change to
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>, or
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a> as appropriate.  Once the full J16 committee votes to
!   forward Ready issues to the Project Editor, they are given the
!   status of Defect Report ( <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#DR">DR</a>). These in turn may
!   become the basis for Technical Corrigenda (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC">TC</a>),
    or are closed without action other than a Record of Response
!   (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#RR">RR</a> ). The intent of this LWG process is that
!   only issues which are truly defects in the Standard move to the
!   formal ISO DR status.
    </p>
  
  
  <h2>Active Issues</h2>
  <hr>
! <h3><a name="964"></a>964. Various threading bugs #14</h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The requirements for the constructor for <tt>condition_variable</tt> has several
! error conditions, but the requirements for the constructor for
! <tt>condition_variable_any</tt> has none. Is this difference intentional?
  </p>
  
  <p><i>[
! Summit:
  ]</i></p>
  
  
  <blockquote>
! Move to open, pass to Howard. If this is intentional, a note may be
! helpful. If the error conditions are to be copied from
! <tt>condition_variable</tt>, this depends on LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>.
  </blockquote>
  
  <p><i>[
! Post Summit Howard adds:
  ]</i></p>
  
  
  <blockquote>
! The original intention 
! (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2447.htm#ConditionVariablesWording">N2447</a>)
! was to let the OS return whatever errors it was going to return, and for
! those to be translated into exceptions, for both
! <tt>condition_variable</tt> and <tt>condition_variable_any</tt>.  I have not
! received any complaints about specific error conditions from vendors on
! non-POSIX platforms, but such complaints would not surprise me if they surfaced.
  </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
  <blockquote>
! Leave open. Benjamin to provide wording.
  </blockquote>
  
  <p><i>[
! 2010 Pittsburgh:
  ]</i></p>
  
  
  <blockquote>
  <p>
! We don't have throw clauses for condition variables.
  </p>
  <p>
! This issue may be dependent on LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>.
  </p>
  <p>
! Leave open. Detlef will coordinate with Benjamin.
  </p>
  <p>
! Consider merging LWG 964, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#966">966</a>, and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a> into a
! single paper.
  </p>
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="966"></a>966. Various threading bugs #16</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 30.5.1 [thread.condition.condvar]:
! <tt>condition_variable::wait</tt> and
! <tt>condition_variable::wait_until</tt> both have a postcondition that
! <tt>lock</tt> is locked by the calling thread, and a throws clause that
! requires throwing an exception if this postcondition cannot be achieved.
! How can the implementation detect that this <tt>lock</tt> can never be
! obtained?
  </p>
  
  <p><i>[
! Summit:
  ]</i></p>
  
  
  <blockquote>
! Move to open. Requires wording. Agreed this is an issue, and the
! specification should not require detecting deadlocks.
  </blockquote>
  
  <p><i>[
! 2009-08-01 Howard provides wording.
  ]</i></p>
  
  
  <blockquote>
  <p>
! The proposed wording is inspired by the POSIX spec which says:
  </p>
  
  <blockquote>
! <dl>
! <dt>[EINVAL]</dt>
! <dd>The value specified by cond or mutex is invalid.</dd>
! <dt>[EPERM]</dt>
! <dd>The mutex was not owned by the current thread at the time of the call.</dd>
! </dl>
  </blockquote>
  
  <p>
! I do not believe [EINVAL] is possible without memory corruption (which we don't
! specify).  [EPERM] is possible if this thread doesn't own the mutex, which is
! listed as a precondition.  "May" is used instead of "Shall" because not all
! OS's are POSIX.
  </p>
  </blockquote>
  
  <p><i>[
! 2009-10 Santa Cruz:
  ]</i></p>
  
  
  <blockquote>
! Leave open, Detlef to provide improved wording.
  </blockquote>
  
  <p><i>[
! 2009-10-23 Detlef Provided wording.
  ]</i></p>
  
  
  <blockquote>
  <p>
! Detlef's wording put in Proposed resolution.  Original wording here:
  </p>
  <blockquote>
  <p>
! Change 30.5.1 [thread.condition.condvar] p12, p19 and
! 30.5.2 [thread.condition.condvarany] p10, p16:
  </p>
  
  <blockquote>
! <i>Throws:</i> <ins>May throw</ins> <tt>std::system_error</tt> 
  <ins>
! if a precondition is not met.
  </ins>
! <del>when the effects or postcondition
! cannot be achieved.</del>
  </blockquote>
  </blockquote>
  </blockquote>
  
  <p><i>[
! 2009-10 Santa Cruz:
  ]</i></p>
  
  
  <blockquote>
! Leave open, Detlef to provide improved wording.
  </blockquote>
  
  <p><i>[
! 2009-11-18 Anthony adds:
  ]</i></p>
  
  
! <blockquote>
  <p>
! <tt>condition_variable::wait</tt> takes a <tt>unique_lock&lt;mutex&gt;</tt>. We
! know whether or not a <tt>unique_lock</tt> owns a lock, through use of its
! <tt>owns_lock()</tt> member.
  </p>
  
  <p>
! I would like to propose the following resolution:
  </p>
  
  <blockquote>
  <p>
! Modify the first sentence of 30.5.1 [thread.condition.condvar] p9:
  </p>
  
! <blockquote><pre>void wait(unique_lock&lt;mutex&gt;&amp; lock);
  </pre>
  <blockquote>
! 9 <i>Precondition:</i> <del><tt>lock</tt> is locked by the calling thread</del>
! <ins><tt>lock.owns_lock()</tt> is <tt>true</tt></ins>, and either
! <p>...</p>
  </blockquote>
  </blockquote>
  
  <p>
- Replace 30.5.1 [thread.condition.condvar] p11-13 with:
  </p>
  
! <blockquote><pre>void wait(unique_lock&lt;mutex&gt;&amp; lock);
! </pre>
  <blockquote>
- <p>...</p>
  <p>
! 11 <i>Postcondition:</i> <del><tt>lock</tt> is locked by the calling
! thread</del> <ins><tt>lock.owns_lock()</tt> is <tt>true</tt></ins>.
  </p>
  
  <p>
! 12 <i>Throws:</i> <tt>std::system_error</tt> <del>when the effects or
! postcondition cannot be achieved</del> <ins>if the implementation detects that
! the preconditions are not met or the effects cannot be achieved. Any exception
! thrown by <tt>lock.lock()</tt> or <tt>lock.unlock()</tt></ins>.
  </p>
  
  <p>
! 13 <i>Error Conditions:</i> <ins>The error conditions are implementation
! defined.</ins>
  </p>
  
  <ul>
! <li><del>
! equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
! </del></li>
  </ul>
  
  </blockquote>
  </blockquote>
  </blockquote>
  </blockquote>
  
  <p><i>[
! 2010 Pittsburgh:
  ]</i></p>
  
  
  <blockquote>
  <p>
! There are heavy conflicts with adopted papers.
  </p>
  <p>
! This issue is dependent on LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>.
  </p>
  <p>
! Leave open pending outstanding edits to the working draft. Detlef will provide
! wording.
  </p>
  <p>
! Possibly related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#964">964</a>.
  </p>
  
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Replace 30.5.1 [thread.condition.condvar] p12, p19 and
! 30.5.2 [thread.condition.condvarany] p10, p16:
  </p>
  
! <blockquote>
! <p><del>
! <i>Throws:</i> <tt>std::system_error</tt> when the effects or
! postcondition cannot be achieved.
! </del></p>
! <p><del>
! Error conditions:
! </del></p>
! <ul>
! <li><del>
! equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
! </del></li>
! </ul>
  
! <p><ins>
! <i>Throws:</i> It is implementation-defined whether a <tt>std::system_error</tt>
! with implementation-defined error condition is thrown if the
! precondition is not met.
! </ins></p>
  </blockquote>
  
  
  
  
  
  
  <hr>
! <h3><a name="985"></a>985. Allowing throwing move</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Rani Sharoni <b>Opened:</b> 2009-02-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! <b>Introduction</b>
  </p>
  
! <p>This proposal is meant to resolve potential regression of the
! <a href="" ref="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2800.pdf">N2800</a>
! draft, see
! next section, and to relax the requirements for containers of types with
! throwing move constructors.</p>
  
- <p>The basic problem is that some containers operations, like <tt>push_back</tt>,
- have a strong exception safety
- guarantee (i.e. no side effects upon exception) that are not achievable when
- throwing move constructors are used since there is no way to guarantee revert
- after partial move. For such operations the implementation can at most provide
- the basic guarantee (i.e. valid but unpredictable) as it does with multi
- copying operations (e.g. range insert).</p>
  
! <p>For example, <tt>vector&lt;T&gt;::push_back()</tt> (where <tt>T</tt> has a move
! constructor) might resize the <tt>vector</tt> and move the objects to the new underlying
! buffer. If move constructor throws it might
! not be possible to recover the throwing object or to move the old objects back to
! the original buffer.</p>
  
! <p>The current draft is explicit by disallowing throwing move
! for some operations (e.g. <tt>vector&lt;&gt;::reserve</tt>) and not clear about other
! operations mentioned in 23.2.1 [container.requirements.general]/10
! (e.g. single element <tt>insert</tt>): it guarantees strong exception
! safety without explicitly disallowing a throwing move constructor.
  </p>
  
  <p>
! <b>Regression</b>
  </p>
  
! <p>This section only refers to cases in which the contained object
! is by itself a standard container.</p>
  
! <p>Move constructors of standard containers are allowed to throw and therefore
! existing operations are broken, compared with C++03, due to move optimization.
! (In fact existing implementations like Dinkumware are actually throwing).</p>
  
! <p>For example, <tt>vector&lt; list&lt;int&gt; &gt;::reserve</tt> yields
! undefined behavior since <tt>list&lt;int&gt;</tt>'s move constructor is allowed to throw.
! On the other hand, the same operation has strong exception safety guarantee in
! C++03.</p>
  
- <p>There are few options to solve this regression:</p>
  
  <ol>
  <li>
! Disallow throwing move and throwing default constructor
  </li>
  
  <li>
! Disallow throwing move but disallowing usage after move
  </li>
  
  <li>
! Special casing
  </li>
  
  <li>
! Disallow throwing move and making it optional
  </li>
  
  </ol>
  
! <p>Option 1 is suggested by proposal
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2815.html">N2815</a>
! but it might not be applicable for existing implementations for which
! containers default constructors are throwing.</p>
  
! <p>Option 2 limits the usage significantly and it's error prone
! by allowing zombie objects that are nothing but destructible (e.g. no <tt>clear()</tt>
! is allowed after move). It also potentially complicates the implementation by
! introducing special state.</p>
  
- <p>Option 3 is possible, for example, using default
- construction and <tt>swap</tt> instead of move for standard containers case. The
- implementation is also free to provide special hidden operation for non
- throwing move without forcing the user the cope with the limitation of option-2
- when using the public move.</p>
  
! <p>Option 4 impact the efficiency in all use cases due to rare throwing move.</p>
  
! <p>The proposed wording will imply option 1 or 3 though option 2 is also
! achievable using more wording. I personally oppose to option 2 that has impact
! on usability.</p>
  
  <p>
! <b>Relaxation for user types</b>
  </p>
  
! <p>Disallowing throwing move constructors in general seems very restrictive
! since, for example, common implementation of move will be default construction
! + <tt>swap</tt> so move will throw if the
! default constructor will throw. This is currently the case with the Dinkumware
! implementation of node based containers (e.g. <tt>std::list</tt>)
! though this section doesn't refer to standard types.</p>
  
! <p>For throwing move constructors it seem that the implementation should have
! no problems to provide the basic guarantee instead of the strong one. It's
! better to allow throwing move constructors with basic guarantee than to
! disallow it silently (compile and run), via undefined behavior.</p>
  
! <p>There might still be cases in which the relaxation will break existing generic
! code that assumes the strong guarantee but it's broken either way given a
! throwing move constructor since this is not a preserving optimization. </p>
  
  <p><i>[
! Batavia (2009-05):
  ]</i></p>
  
  <blockquote>
  <p>
! Bjarne comments (referring to his draft paper):
! "I believe that my suggestion simply solves that.
! Thus, we don't need a throwing move."
  </p>
  <p>
! Move to Open and recommend it be deferred until after the next
! Committee Draft is issued.
  </p>
  </blockquote>
  
  <p><i>[
! 2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! Should wait to get direction from Dave/Rani
! (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2983.html">N2983</a>).
  </blockquote>
  
  <p><i>[
! 2010-03-28 Daniel updated wording to sync with N3092.
  ]</i></p>
  
  
  <blockquote>
  <p>
! The suggested change of 23.3.2.3 [deque.modifiers]/2 should be removed,
! because the current wording does say more general things:
  </p>
  
  <blockquote>
! 2 <i>Remarks:</i> If an exception is thrown other than by the copy constructor,
! move constructor, assignment operator, or move assignment operator of <tt>T</tt>
! there are no effects. If an exception is thrown by the move constructor of a
! non-CopyConstructible <tt>T</tt>, the effects are unspecified.
  </blockquote>
  
  <p>
! The suggested change of 23.4.1.2 [vector.capacity]/2 should be removed,
! because the current wording does say more general things:
  </p>
  
  <blockquote>
! 2 <i>Effects:</i> A directive that informs a <tt>vector</tt> of a planned change
! in size, so that it can manage the storage allocation accordingly. After
! <tt>reserve()</tt>, <tt>capacity()</tt> is greater or equal to the argument of
! <tt>reserve</tt> if reallocation happens; and equal to the previous value of
! <tt>capacity()</tt> otherwise. Reallocation happens at this point if and only if
! the current capacity is less than the argument of <tt>reserve()</tt>. If an
! exception is thrown other than by the move constructor of a
! non-<tt>CopyConstructible</tt> type, there are no effects.
! </blockquote>
  
  </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  
  <p>
! 23.2.1 [container.requirements.general]  paragraph 11 add footnote:
  </p>
  
  <blockquote>
  <p>
! -11- Unless otherwise specified (see 23.1.4.1, 23.1.5.1, 23.2.2.3, and
! 23.2.6.4) all container types defined in this Clause meet the following
! additional requirements:
  </p>
! <ul>
! <li>...</li>
! </ul>
  
  <p>
! <ins>[<i>Note</i>: for compatibility with C++
! 2003, when "no effect" is required, standard containers should not use the
! value_type's throwing move constructor when the contained object is by itself a
! standard container. -- <i>end note</i>]</ins>
  </p>
  
! </blockquote>
  
- <p>23.2.5.1 [unord.req.except] change paragraph 2 to say: </p>
  
  <blockquote>
  <p>
! -2- For unordered associative containers, if an exception is
! thrown by any operation other than the container's hash function from within an
! <tt>insert()</tt> function inserting a single element, the <tt>insert()</tt>
! function has no effect<ins> unless the exception is thrown by the contained
! object move constructor</ins>.
  </p>
  
  <p>
! -4- For unordered associative containers, if an exception is
! thrown from within a <tt>rehash()</tt> function other than by the container's hash
! function or comparison function, the <tt>rehash()</tt> function has no effect
! <ins>unless the exception is thrown by the contained
! object move constructor</ins>.</p>
  
  </blockquote>
  
  <p>
! 23.3.2.3 [deque.modifiers] change paragraph 2 to say:
  </p>
  
! <blockquote>
! -2- <i>Remarks:</i> If an exception is thrown other than by
! the copy constructor<ins>, move constructor</ins>
! or assignment operator of <tt>T</tt>
! there are no effects.
! <ins>If an exception is thrown by <tt>push_back()</tt> or <tt>emplace_back()</tt>
! function, that function has no effects unless the exception is thrown by
! the move constructor of <tt>T</tt>.</ins>
! </blockquote>
  
  <p>
! 23.4.1.2 [vector.capacity] paragraph 2 change to say:
  </p>
  
! <blockquote>
! -2- <i>Effects:</i> A directive that informs a <tt>vector</tt>
! of a planned change in size, so
! that it can manage the storage allocation accordingly. After <tt>reserve()</tt>,
! <tt>capacity()</tt> is greater or equal to the argument of <tt>reserve</tt>
! if reallocation happens; and equal
! to the previous value of <tt>capacity()</tt>
! otherwise. Reallocation happens at this point if and only if the current
! capacity is less than the argument of <tt>reserve()</tt>.
! If an exception is thrown, there are no effects<ins>
! unless the exception is thrown by the contained object move constructor</ins>.
! </blockquote>
  
  <p>
! 23.4.1.2 [vector.capacity] paragraph 12 change to say:
  </p>
  
! <blockquote>
! -12- <i>Requires:</i> <del>If <tt>value_type</tt> has a move constructor,
! that constructor shall not throw any exceptions.</del>
! <ins>If an exception is thrown, there are no effects unless the exception is thrown by
! the contained object move constructor.</ins>
  </blockquote>
  
  <p>
! 23.4.1.4 [vector.modifiers] change paragraph 1 to say:
  </p>
  
! <blockquote>
! -1- <del><i>Requires:</i> If <tt>value_type</tt> has a move constructor,
! that constructor shall not throw any exceptions.</del>
! <ins><i>Remarks:</i> If an exception is thrown by <tt>push_back()</tt>
! or <tt>emplace_back()</tt> function, that function has no effect unless the
! exception is thrown by the move constructor of <tt>T</tt>.</ins>
  </blockquote>
  
  
--- 418,3738 ----
    accords the status of DR to all these Defect Reports regardless of
    where they are in that process.</p>
  
+   <p><b><a name="WP">WP</a></b> - (Working Paper) - The proposed resolution has not been
+   accepted as a Technical Corrigendum, but the full WG21/PL22.16 committee has voted to
+   apply the Defect Report's Proposed Resolution to the working paper.</p>
+ 
+   <p><b><a name="C++11">C++14</a></b> - (C++ Standard, as revised for 2014) - The full
+   WG21/PL22.16 committee has voted to accept the Defect Report's Proposed Resolution into
+   the published 2011 revision to the C++ standard, ISO/IEC IS 14882:2014(E).</p>
+ 
+    <p><b><a name="C++11">C++11</a></b> - (C++ Standard, as revised for 2011) - The full
+   WG21/PL22.16 committee has voted to accept the Defect Report's Proposed Resolution into
+   the published 2011 revision to the C++ standard, ISO/IEC IS 14882:2011(E).</p>
+ 
+    <p><b><a name="CD1">CD1</a></b> - (Committee Draft 2008) - The full
+   WG21/PL22.16 committee has voted to accept the Defect Report's Proposed
+   Resolution into the Fall 2008 Committee Draft.</p>
+ 
    <p><b><a name="TC1">TC1</a></b> - (Technical Corrigenda 1) - The full
    WG21/PL22.16 committee has voted to accept the Defect Report's Proposed
    Resolution as a Technical Corrigenda.  Action on this issue is thus
    complete and no further action is possible under ISO rules.</p>
  
!   <p><b><a name="TRDec">TRDec</a></b> - (Decimal TR defect) - The LWG has voted to
!   accept the Defect Report's Proposed Resolution into the Decimal TR.  Action on this
!   issue is thus complete and no further action is expected.</p>
  
!   <p><b><a name="Resolved">Resolved</a></b> - The LWG has reached consensus
!   that the issue is a defect in the Standard, but the resolution adopted to
!   resolve the issue came via some other mechanism than this issue in the
!   list - typically by applying a formal paper, occasionally as a side effect
!   of consolidating several interacting issue resolutions into a single issue.</p>
  
!   <p><b><a name="Dup">Dup</a></b> - The LWG has reached consensus that
!   the issue is a duplicate of another issue, and will not be further
!   dealt with. A <b>Rationale</b> identifies the duplicated issue's
!   issue number.</p>
! 
!   <p><b><a name="NAD">NAD</a></b> - The LWG has reached consensus that
!   the issue is not a defect in the Standard.</p>
! 
!   <p><b><a name="NAD Editorial">NAD Editorial</a></b> - The LWG has reached consensus that
!   the issue can either be handled editorially, or is handled by a paper (usually
!   linked to in the rationale).</p>
  
    <p><b>Tentatively</b> - This is a <i>status qualifier</i>.  The issue has
!   been reviewed online, or at an unofficial meeting, but not in an official meeting, and
!   some support has been formed for the qualified status.  Tentatively qualified issues may
!   be moved to the unqualified status and forwarded to full committee (if Ready) within the
!   same meeting.  Unlike Ready issues, Tentatively Ready issues will be reviewed in
!   subcommittee prior to forwarding to full committee.  When a status is qualified with
!   Tentatively, the issue is still considered active.</p>
  
!   <p><b>Pending</b> - This is a <i>status qualifier</i>.  When prepended to a status this
!   indicates the issue has been processed by the committee, and a decision has been made to
!   move the issue to the associated unqualified status.  However for logistical reasons the
!   indicated outcome of the issue has not yet appeared in the latest working paper.</p>
  
!   <p>The following statuses have been retired, but may show up on older issues lists.</p>
! 
!   <p><b><a name="NAD Future">NAD Future</a></b> - In addition to the regular status, the
!   LWG believes that this issue should be revisited at the next revision of the standard.
!   That is now an ongoing task managed by the Library Evolution Working Group, and most
!   issues in this status were reopended with the status <a href="#NAD Editorial">LEWG</a>.
!   </p>
! 
!   <p><b><a name="NAD Concepts">NAD Concepts</a></b> - This status reflects an evolution
!   of the language during the development of C++11, where a new feature entered the
!   language, called <i>concepts</i>, that fundamentally changed the way templates would
!   be specified and written.  While this language feature was removed towards the end of
!   the C++11 project, there is a clear intent to revisit this part of the language design.
!   During that development, a number of issues were opened against the updated library
!   related to use of that feature, or requesting fixes that would require exlicit use of
!   the concepts feature.  All such issues have been closed with this status, and may be
!   revisitted should this or a similar language feature return for a future standard.</p>
! 
!   <p>Issues are always given the status of <a href="lwg-active.html#New">New</a> when
    they first appear on the issues list. They may progress to
!   <a href="lwg-active.html#Open">Open</a> or <a href="lwg-active.html#Review">Review</a>
!   while the LWG is actively working on them. When the LWG has reached consensus on
    the disposition of an issue, the status will then change to
!   <a href="lwg-active.html#Dup">Dup</a>, <a href="lwg-active.html#NAD">NAD</a>, or
!   <a href="lwg-active.html#Ready">Ready</a> as appropriate.  Once the full PL22.16 committee
!   votes to forward Ready issues to the Project Editor, they are given the status of Defect
!   Report (<a href="lwg-active.html#DR">DR</a>). These in turn may become the basis for
!   Technical Corrigenda (<a href="lwg-active.html#TC1">TC1</a>), an updated standard
!   (<a href="lwg-defects.html#C++11">C++11</a>, <a href="lwg-defects.html#C++14">C++14</a>),
    or are closed without action other than a Record of Response
!   (<a href="lwg-active.html#Resolved">Resolved</a>) where the desired effect has already
!   been achieved by some other process.  The intent of this LWG process is that only issues
!   which are truly defects in the Standard move to the formal ISO DR status.
    </p>
  
  
  <h2>Active Issues</h2>
  <hr>
! <h3><a name="255"></a>255. Why do <tt>basic_streambuf&lt;&gt;::pbump()</tt> and <tt>gbump()</tt> take an int?</h3>
! <p><b>Section:</b> 27.6.3 [streambuf] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-08-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#streambuf">issues</a> in [streambuf].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The basic_streambuf members gbump() and pbump() are specified to take an
! int argument. This requirement prevents the functions from effectively
! manipulating buffers larger than std::numeric_limits&lt;int&gt;::max()
! characters. It also makes the common use case for these functions
! somewhat difficult as many compilers will issue a warning when an
! argument of type larger than int (such as ptrdiff_t on LLP64
! architectures) is passed to either of the function. Since it's often the
! result of the subtraction of two pointers that is passed to the
! functions, a cast is necessary to silence such warnings. Finally, the
! usage of a native type in the functions signatures is inconsistent with
! other member functions (such as sgetn() and sputn()) that manipulate the
! underlying character buffer. Those functions take a streamsize argument.
  </p>
  
  <p><i>[
! 2009-07 Frankfurt
  ]</i></p>
  
  
  <blockquote>
! <p>
! This is part of a bigger problem. If anyone cares enough, they should
! write a paper solving the bigger problem of offset types in iostreams.
! </p>
! <p>
! This is related to the paper about large file sizes. Beman has already
! agreed to drop the section of that paper that deals with this.
! </p>
! <p>
! int is big enough for reasonable buffers.
! </p>
! <p>
! Move to NAD Future.
! </p>
! <p>
! This is related to LWG <a href="lwg-active.html#423">423</a>.
! </p>
  </blockquote>
  
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change the signatures of these functions in the synopsis of template
+ class basic_streambuf (27.5.2) and in their descriptions (27.5.2.3.1, p4
+ and 27.5.2.3.2, p4) to take a streamsize argument.
+ </p>
+ 
+ <p>
+ Although this change has the potential of changing the ABI of the
+ library, the change will affect only platforms where int is different
+ than the definition of streamsize. However, since both functions are
+ typically inline (they are on all known implementations), even on such
+ platforms the change will not affect any user code unless it explicitly
+ relies on the existing type of the functions (e.g., by taking their
+ address). Such a possibility is IMO quite remote.
+ </p>
+ 
+ <p>
+ Alternate Suggestion from Howard Hinnant, c++std-lib-7780:
+ </p>
+ 
+ <p>
+ This is something of a nit, but I'm wondering if streamoff wouldn't be a 
+ better choice than streamsize.  The argument to pbump and gbump MUST be 
+ signed.  But the standard has this to say about streamsize 
+ (27.4.1/2/Footnote):
+ </p>
+ 
+ <blockquote><p>
+      [Footnote: streamsize is used in most places where ISO C would use
+      size_t.  Most of the uses of streamsize could use size_t, except for
+      the strstreambuf constructors, which require negative values. It
+      should probably be the signed type corresponding to size_t (which is
+      what Posix.2 calls ssize_t). --- end footnote]
+ </p></blockquote>
+ 
+ <p>
+ This seems a little weak for the argument to pbump and gbump.  Should we 
+ ever really get rid of strstream, this footnote might go with it, along 
+ with the reason to make streamsize signed.
+ </p>
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>The LWG believes this change is too big for now.  We may wish to
+ reconsider this for a future revision of the standard.  One
+ possibility is overloading pbump, rather than changing the
+ signature.</p>
  <p><i>[
! [2006-05-04: Reopened at the request of Chris (Krzysztof ?elechowski)]
! ]</i></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="423"></a>423. effects of negative streamsize in iostreams</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! A third party test suite tries to exercise istream::ignore(N) with
! a negative value of N and expects that the implementation will treat
! N as if it were 0. Our implementation asserts that (N >= 0) holds and
! aborts the test.
! </p>
! 
! <p>
! I can't find anything in section 27 that prohibits such values but I don't
! see what the effects of such calls should be, either (this applies to
! a number of unformatted input functions as well as some member functions
! of the basic_streambuf template).
! </p>
! 
! <p><i>[
! 2009-07 Frankfurt
  ]</i></p>
  
  
  <blockquote>
! <p>
! This is related to LWG <a href="lwg-active.html#255">255</a>.
! </p>
! <p>
! Move to NAD Future.
! </p>
  </blockquote>
  
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ I propose that we add to each function in clause 27 that takes an argument,
+ say N, of type streamsize a Requires clause saying that "N >= 0." The intent
+ is to allow negative streamsize values in calls to precision() and width()
+ but disallow it in calls to streambuf::sgetn(), istream::ignore(), or
+ ostream::write().
+ </p>
+ 
+ <p><i>[Kona: The LWG agreed that this is probably what we want.  However, we
+   need a review to find all places where functions in clause 27 take
+   arguments of type streamsize that shouldn't be allowed to go
+   negative.  Martin will do that review.]</i></p>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="484"></a>484. Convertible to <tt>T</tt></h3>
+ <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2004-09-16 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>From comp.std.c++:</p>
+ 
+ <p>
+ I note that given an input iterator a for type <tt>T</tt>, 
+ then <tt>*a</tt> only has to be "convertable to <tt>T</tt>", 
+ not actually of type <tt>T</tt>.
+ </p>
+ 
+ <p>Firstly, I can't seem to find an exact definition of "convertable to <tt>T</tt>". 
+ While I assume it is the obvious definition (an implicit conversion), I 
+ can't find an exact definition. Is there one?</p>
+ 
+ <p>Slightly more worryingly, there doesn't seem to be any restriction on 
+ the this type, other than it is "convertable to <tt>T</tt>". Consider two input 
+ iterators <tt>a</tt> and <tt>b</tt>. I would personally assume that most people would 
+ expect <tt>*a==*b</tt> would perform <tt>T(*a)==T(*b)</tt>, however it doesn't seem that 
+ the standard requires that, and that whatever type <tt>*a</tt> is (call it <tt>U</tt>) 
+ could have == defined on it with totally different symantics and still 
+ be a valid inputer iterator.</p>
+ 
+ <p>Is this a correct reading? When using input iterators should I write 
+ <tt>T(*a)</tt> all over the place to be sure that the object I'm using is the 
+ class I expect?</p>
+ 
+ <p>This is especially a nuisance for operations that are defined to be
+   "convertible to <tt>bool</tt>".  (This is probably allowed so that
+   implementations could return say an <tt>int</tt> and avoid an unnessary
+   conversion. However all implementations I have seen simply return a
+   <tt>bool</tt> anyway.  Typical implemtations of STL algorithms just write
+   things like <tt>while(a!=b &amp;&amp; *a!=0)</tt>.  But strictly
+   speaking, there are lots of types that are convertible to <tt>T</tt> but
+   that also overload the appropriate operators so this doesn't behave
+   as expected.</p>
+ 
+ <p>If we want to make code like this legal (which most people seem to
+   expect), then we'll need to tighten up what we mean by "convertible
+   to <tt>T</tt>".</p>
+ 
+ <p><i>[Lillehammer: The first part is NAD, since "convertible" is
+  well-defined in core. The second part is basically about pathological
+  overloads. It's a minor problem but a real one. So leave open for
+  now, hope we solve it as part of iterator redesign.]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-07-28 Reopened by Alisdair. No longer solved by concepts.
+ ]</i></p>
+ 
+ 
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
+ <blockquote><p>
+ Mark as NAD Future. We agree there's an issue, but there is no
+ proposed solution at this time and this will be solved by concepts in
+ the future.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p><i>[
+ San Francisco:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2758.pdf">N2758</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="523"></a>523. regex case-insensitive character ranges are unimplementable as specified</h3>
+ <p><b>Section:</b> 28 [re] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2005-07-01 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#re">active issues</a> in [re].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#re">issues</a> in [re].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ A problem with TR1 regex is currently being discussed on the Boost 
+ developers list. It involves the handling of case-insensitive matching 
+ of character ranges such as [Z-a]. The proper behavior (according to the 
+ ECMAScript standard) is unimplementable given the current specification 
+ of the TR1 regex_traits&lt;&gt; class template. John Maddock, the author of 
+ the TR1 regex proposal, agrees there is a problem. The full discussion 
+ can be found at http://lists.boost.org/boost/2005/06/28850.php (first 
+ message copied below). We don't have any recommendations as yet.
+ </p>
+ <p>
+ -- Begin original message --
+ </p>
+ <p>
+ The situation of interest is described in the ECMAScript specification
+ (ECMA-262), section 15.10.2.15:
+ </p>
+ <p>
+ "Even if the pattern ignores case, the case of the two ends of a range
+ is significant in determining which characters belong to the range.
+ Thus, for example, the pattern /[E-F]/i matches only the letters E, F,
+ e, and f, while the pattern /[E-f]/i matches all upper and lower-case
+ ASCII letters as well as the symbols [, \, ], ^, _, and `."
+ </p>
+ <p>
+ A more interesting case is what should happen when doing a
+ case-insentitive match on a range such as [Z-a]. It should match z, Z,
+ a, A and the symbols [, \, ], ^, _, and `. This is not what happens with
+ Boost.Regex (it throws an exception from the regex constructor).
+ </p>
+ <p>
+ The tough pill to swallow is that, given the specification in TR1, I
+ don't think there is any effective way to handle this situation.
+ According to the spec, case-insensitivity is handled with
+ regex_traits&lt;&gt;::translate_nocase(CharT) -- two characters are equivalent
+ if they compare equal after both are sent through the translate_nocase
+ function. But I don't see any way of using this translation function to
+ make character ranges case-insensitive. Consider the difficulty of
+ detecting whether "z" is in the range [Z-a]. Applying the transformation
+ to "z" has no effect (it is essentially std::tolower). And we're not
+ allowed to apply the transformation to the ends of the range, because as
+ ECMA-262 says, "the case of the two ends of a range is significant."
+ </p>
+ <p>
+ So AFAICT, TR1 regex is just broken, as is Boost.Regex. One possible fix
+ is to redefine translate_nocase to return a string_type containing all
+ the characters that should compare equal to the specified character. But
+ this function is hard to implement for Unicode, and it doesn't play nice
+ with the existing ctype facet. What a mess!
+ </p>
+ <p>
+ -- End original message --
+ </p>
+ 
+ <p><i>[
+ John Maddock adds:
+ ]</i></p>
+ 
+ 
+ <p>
+ One small correction, I have since found that ICU's regex package does 
+ implement this correctly, using a similar mechanism to the current 
+ TR1.Regex.
+ </p>
+ <p>
+ Given an expression [c1-c2] that is compiled as case insensitive it:
+ </p>
+ <p>
+ Enumerates every character in the range c1 to c2 and converts it to it's 
+ case folded equivalent.  That case folded character is then used a key to a 
+ table of equivalence classes, and each member of the class is added to the 
+ list of possible matches supported by the character-class.  This second step 
+ isn't possible with our current traits class design, but isn't necessary if 
+ the input text is also converted to a case-folded equivalent on the fly.
+ </p>
+ <p>
+ ICU applies similar brute force mechanisms to character classes such as 
+ [[:lower:]] and [[:word:]], however these are at least cached, so the impact 
+ is less noticeable in this case.
+ </p>
+ <p>
+ Quick and dirty performance comparisons show that expressions such as 
+ "[X-\\x{fff0}]+" are indeed very slow to compile with ICU (about 200 times 
+ slower than a "normal" expression).  For an application that uses a lot of 
+ regexes this could have a noticeable performance impact.  ICU also has an 
+ advantage in that it knows the range of valid characters codes: code points 
+ outside that range are assumed not to require enumeration, as they can not 
+ be part of any equivalence class.  I presume that if we want the TR1.Regex 
+ to work with arbitrarily large character sets enumeration really does become 
+ impractical.
+ </p>
+ <p>
+ Finally note that Unicode has:
+ </p>
+ <p>
+ Three cases (upper, lower and title).
+ One to many, and many to one case transformations.
+ Character that have context sensitive case translations - for example an 
+ uppercase sigma has two different lowercase forms  - the form chosen depends 
+ on context(is it end of a word or not), a caseless match for an upper case 
+ sigma should match either of the lower case forms, which is why case folding 
+ is often approximated by tolower(toupper(c)).
+ </p>
+ <p>
+ Probably we need some way to enumerate character equivalence classes, 
+ including digraphs (either as a result or an input), and some way to tell 
+ whether the next character pair is a valid digraph in the current locale.
+ </p>
+ <p>
+ Hoping this doesn't make this even more complex that it was already,
+ </p>
+ 
+ <p><i>[
+ Portland:  Alisdair: Detect as invalid, throw an exception.
+ Pete: Possible general problem with case insensitive ranges.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
  <blockquote>
! <p>
! We agree that this is a problem, but we do not know the answer.
! </p>
! <p>
! We are going to declare this NAD until existing practice leads us in some direction.
! </p>
! <p>
! No objection to NAD Future.
! </p>
! <p>
! Move to NAD Future.
! </p>
  </blockquote>
  
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="532"></a>532. Tuple comparison</h3>
+ <p><b>Section:</b> 20.4.2.7 [tuple.rel], TR1 6.1.3.5 [tr.tuple.rel] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2005-11-29 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#tuple.rel">active issues</a> in [tuple.rel].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#tuple.rel">issues</a> in [tuple.rel].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Duplicate of:</b> <a href="lwg-closed.html#348">348</a></p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Where possible, <tt>tuple</tt> comparison operators &lt;,&lt;=,=&gt;, and &gt; ought to be
+ defined in terms of <tt>std::less</tt> rather than <tt>operator&lt;</tt>, in order to
+ support comparison of tuples of pointers.  
+ </p>
+ 
  <p><i>[
! 2009-07-28 Reopened by Alisdair.  No longer solved by concepts.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
  ]</i></p>
  
  
  <blockquote>
  <p>
! If we solve this for <tt>tuple</tt> we would have to solve it for <tt>pair</tt>
! algorithms, etc.  It is too late to do that at this time.  Move to NAD Future.
  </p>
+ </blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
  <p>
! change 6.1.3.5/5 from:
  </p>
+ 
+ <blockquote><p>
+   Returns: The result of a lexicographical comparison between t and
+   u. The result is defined as: (bool)(get&lt;0&gt;(t) &lt; get&lt;0&gt;(u)) ||
+   (!(bool)(get&lt;0&gt;(u) &lt; get&lt;0&gt;(t)) &amp;&amp; ttail &lt; utail), where rtail for
+   some tuple r is a tuple containing all but the first element of
+   r. For any two zero-length tuples e and f, e &lt; f returns false.
+ </p></blockquote>
+ 
  <p>
! to:
  </p>
+ 
+ <blockquote>
  <p>
!   Returns: The result of a lexicographical comparison between t and
!   u. For any two zero-length tuples e and f, e &lt; f returns false.
!   Otherwise, the result is defined as: cmp( get&lt;0&gt;(t), get&lt;0&gt;(u)) ||
!   (!cmp(get&lt;0&gt;(u), get&lt;0&gt;(t)) &amp;&amp; ttail &lt; utail), where rtail for some
!   tuple r is a tuple containing all but the first element of r, and
!   cmp(x,y) is an unspecified function template defined as follows.
! </p>
! <p>
!   Where T is the type of x and U is the type of y:
! </p>
! 
! <p>
!      if T and U are pointer types and T is convertible to U, returns
!      less&lt;U&gt;()(x,y)
! </p>
! 
! <p>
!      otherwise, if T and U are pointer types, returns less&lt;T&gt;()(x,y)
! </p>
! 
! <p>
!      otherwise, returns (bool)(x &lt; y)
! </p>
! </blockquote>
! 
! <p><i>[
! Berlin: This issue is much bigger than just tuple (pair, containers,
! algorithms). Dietmar will survey and work up proposed wording.
! ]</i></p>
! 
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Recommend NAD.  This will be fixed with the next revision of concepts.
! </p>
! 
! <p><i>[
! San Francisco:
! ]</i></p>
! 
! 
! <blockquote><p>
! Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2770.pdf">N2770</a>.
! </p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="708"></a>708. Locales need to be per thread and updated for POSIX changes</h3>
! <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-07-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#localization">issues</a> in [localization].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The POSIX "Extended API Set Part 4,"
! </p>
! <blockquote><p>
! <a href="http://www.opengroup.org/sib/details.tpl?id=C065">http://www.opengroup.org/sib/details.tpl?id=C065</a>
! </p></blockquote>
! <p>
! introduces extensions to the C locale mechanism that
! allow multiple concurrent locales to be used in the same application
! by introducing a type <tt>locale_t</tt> that is very similar to
! <tt>std::locale</tt>, and a number of <tt>_l</tt> functions that make use of it.
! </p>
! <p>
! The global locale (set by setlocale) is now specified to be per-
! process. If a thread does not call <tt>uselocale</tt>, the global locale is
! in effect for that thread. It can install a per-thread locale by
! using <tt>uselocale</tt>.
! </p>
! <p>
! There is also a nice <tt>querylocale</tt> mechanism by which one can obtain
! the name (such as "de_DE") for a specific <tt>facet</tt>, even for combined
! locales, with no <tt>std::locale</tt> equivalent.
! </p>
! <p>
! <tt>std::locale</tt> should be harmonized with the new POSIX <tt>locale_t</tt>
! mechanism and provide equivalents for <tt>uselocale</tt> and <tt>querylocale</tt>.
! </p>
! 
! <p><i>[
! Kona (2007): Bill and Nick to provide wording.
! ]</i></p>
! 
! 
! <p><i>[
! San Francisco: Bill and Nick still intend to provide wording, but this
! is a part of the task to be addressed by the group that will look into
! issue <a href="lwg-defects.html#860">860</a>.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-07 Frankfurt:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! It's our intention to stay in sync with WG14. If WG14 makes a decision
! that requires a change in WG21 the issue will be reopened.
! </p>
! <p>
! Move to NAD Future.
  </p>
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="760"></a>760. The emplace issue</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">Tentatively NAD</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2007-11-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Tentatively NAD">Tentatively NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In an <tt>emplace</tt> member function the function parameter pack may be bound
! to a priori unlimited number of objects: some or all of them can be
! elements of the container itself. Apparently, in order to conform to the
! blanket statement 23.2 [container.requirements]/11, the
! implementation must check all of them for that possibility. A possible
! solution can involve extending the exception in 23.2 [container.requirements]/12 also to the emplace member. As a
! side note, the <tt>push_back</tt> and <tt>push_front</tt> member
! functions are luckily not affected by this problem, can be efficiently
! implemented anyway.
  </p>
  
  <p><i>[
! Related to <a href="lwg-defects.html#767">767</a> and to <a href="lwg-active.html#2164">2164</a>
! ]</i></p>
! 
! 
! <p><i>[
! Bellevue:
  ]</i></p>
  
  
  <blockquote>
! <p>
! The proposed addition (13) is partially redundant with the existing
! paragraph 12. Why was the qualifier "rvalues" added to paragraph 12? Why
! does it not cover subelements and pointers?
! </p>
! <p>
! Resolution: Alan Talbot to rework language, then set state to Review.
! </p>
  </blockquote>
  
  <p><i>[
! 2009-07 Frankfurt
  ]</i></p>
  
  
  <blockquote>
  <p>
! The problem is broader than <tt>emplace</tt>. The LWG doesn't
! feel that it knows how to write wording that prohibits all of the
! problematic use cases at this time.
! </p>
! <p>
! NAD Future.
! </p>
! </blockquote>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! LWG believes that <a href="lwg-active.html#2164">2164</a> addresses this issue and therefore considers <a href="lwg-active.html#760">760</a> as NAD. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Add after 23.2 [container.requirements]/12:
  </p>
  
  <blockquote>
! <p>
! -12- Objects passed to member functions of a container as rvalue
! references shall not be elements of that container. No diagnostic
! required.
! </p>
! <p>
! <ins>
! -13- Objects bound to the function parameter pack of the
! <tt>emplace</tt> member function shall not be elements or sub-objects of
! elements of the container. No diagnostic required.
! </ins>
! </p>
! 
  </blockquote>
  
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="839"></a>839. Maps and sets missing splice operation</h3>
+ <p><b>Section:</b> 23.4 [associative], 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Alan Talbot <b>Opened:</b> 2008-05-18 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#associative">active issues</a> in [associative].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#associative">issues</a> in [associative].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! Splice is a very useful feature of <tt>list</tt>. This functionality is also very
! useful for any other node based container, and I frequently wish it were
! available for maps and sets. It seems like an omission that these
! containers lack this capability. Although the complexity for a splice is
! the same as for an insert, the actual time can be much less since the
! objects need not be reallocated and copied. When the element objects are
! heavy and the compare operations are fast (say a <tt>map&lt;int, huge_thingy&gt;</tt>)
! this can be a big win.
! </p>
! 
! <p>
! <b>Suggested resolution:</b>
! </p>
! 
! <p>
! Add the following signatures to map, set, multimap, multiset, and the unordered associative containers:
! </p>
! <blockquote><pre> 
! void splice(list&lt;T,Allocator&gt;&amp;&amp; x);
! void splice(list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator i);
! void splice(list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator first, const_iterator last);
! </pre></blockquote>
! 
! <p>
! Hint versions of these are also useful to the extent hint is useful.
! (I'm looking for guidance about whether hints are in fact useful.)
! </p>
!  
! <blockquote><pre> 
! void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x);
! void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator i);
! void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator first, const_iterator last);
! </pre></blockquote>
! 
! <p><i>[
! Sophia Antipolis:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Don't try to <tt>splice "list"</tt> into the other containers, it should be container-type.
! </p>
! <p>
! <tt>forward_list</tt> already has <tt>splice_after</tt>.
! </p>
! <p>
! Would "<tt>splice</tt>" make sense for an <tt>unordered_map</tt>?
! </p>
! <p>
! Jens, Robert: "<tt>splice</tt>" is not the right term, it implies maintaining ordering in <tt>list</tt>s.
! </p>
! <p>
! Howard: <tt>adopt</tt>?
! </p>
! <p>
! Jens: <tt>absorb</tt>?
! </p>
! <p>
! Alan: <tt>subsume</tt>?
! </p>
! <p>
! Robert: <tt>recycle</tt>?
! </p>
! <p>
! Howard: <tt>transfer</tt>? (but no direction)
! </p>
! <p>
! Jens: <tt>transfer_from</tt>. No.
! </p>
! <p>
! Alisdair: Can we give a nothrow guarantee? If your <tt>compare()</tt> and <tt>hash()</tt> doesn't throw, yes.
! </p>
! <p>
! Daniel: For <tt>unordered_map</tt>, we can't guarantee nothrow.
  </p>
  </blockquote>
  
  <p><i>[
! San Francisco:
  ]</i></p>
  
  
  <blockquote>
! <p>
! Martin: this would possibly outlaw an implementation technique that is
! currently in use; caching nodes in containers.
! </p>
! <p>
! Alan: if you cache in the allocator, rather than the individual
! container, this proposal doesn't interfere with that.
! </p>
! <p>
! Martin: I'm not opposed to this, but I'd like to see an implementation
! that demonstrates that it works.
! </p>
  </blockquote>
  
  <p><i>[
! 2009-07 Frankfurt:
! ]</i></p>
! 
! 
! <blockquote><p>
! NAD Future.
! </p></blockquote>
! 
! <p><i>[
! 2009-09-19 Howard adds:
  ]</i></p>
  
  
  <blockquote>
  <p>
! I'm not disagreeing with the NAD Future resolution.  But when the future gets
! here, here is a possibility worth exploring:
  </p>
+ 
  <blockquote>
  <p>
! Add to the "unique" associative containers:
! </p>
! 
! <blockquote><pre>
! typedef <i>details</i>      node_ptr;
! 
! node_ptr             remove(const_iterator p);
! pair&lt;iterator, bool&gt; insert(node_ptr&amp;&amp; nd);
! iterator             insert(const_iterator p, node_ptr&amp;&amp; nd);
! </pre></blockquote>
! 
! <p>
! And add to the "multi" associative containers:
! </p>
! 
! <blockquote><pre>
! typedef <i>details</i> node_ptr;
! 
! node_ptr remove(const_iterator p);
! iterator insert(node_ptr&amp;&amp; nd);
! iterator insert(const_iterator p, node_ptr&amp;&amp; nd);
! </pre></blockquote>
! 
! <p>
! <tt>Container::node_ptr</tt> is a smart pointer much like <tt>unique_ptr</tt>.
! It owns a node obtained from the container it was removed from.  It maintains a
! reference to the allocator in the container so that it can properly deallocate
! the node if asked to, even if the allocator is stateful.  This being said, the
! <tt>node_ptr</tt> can not outlive the container for this reason.
! </p>
! 
! <p>
! The <tt>node_ptr</tt> offers "<tt>const</tt>-free" access to the node's
! <tt>value_type</tt>.
! </p>
! 
! <p>
! With this interface, clients have a great deal of flexibility:
! </p>
! 
! <ul>
! <li>
! A client can remove a node from one container, and insert it into another
! (without any heap allocation).  This is the splice functionality this issue
! asks for.
! </li>
! <li>
! A client can remove a node from a container, change its key or value, and insert
! it back into the same container, or another container, all without the cost of
! allocating a node.
! </li>
! <li>
! If the Compare function is nothrow (which is very common), then this functionality
! is nothrow unless modifying the value throws.  And if this does throw, it does
! so outside of the containers involved.
! </li>
! <li>
! If the Compare function does throw, the <tt>insert</tt> function will have the
! argument <tt>nd</tt> retain ownership of the node.
! </li>
! <li>
! The <tt>node_ptr</tt> should be independent of the <tt>Compare</tt> parameter
! so that a node can be transferred from <tt>set&lt;T, C1, A&gt;</tt>
! to <tt>set&lt;T, C2, A&gt;</tt> (for example).
! </li>
! </ul>
! 
! <p>
! Here is how the customer might use this functionality:
! </p>
! 
! <ul>
! <li>
! <p>
! Splice a node from one container to another:
! </p>
! <blockquote><pre>
! m2.insert(m1.remove(i));
! </pre></blockquote>
! </li>
! 
! <li>
! <p>
! Change the "key" in a <tt>std::map</tt> without the cost of node reallocation:
! </p>
! <blockquote><pre>
! auto p = m.remove(i);
! p->first = new_key;
! m.insert(std::move(p));
! </pre></blockquote>
! </li>
! 
! <li>
! <p>
! Change the "value" in a <tt>std::set</tt> without the cost of node reallocation:
! </p>
! <blockquote><pre>
! auto p = s.remove(i);
! *p = new_value;
! s.insert(std::move(p));
! </pre></blockquote>
! </li>
! 
! <li>
! <p>
! Move a move-only or heavy object out of an associative container (as opposed to
! the proposal in <a href="lwg-active.html#1041">1041</a>):
! </p>
! <blockquote><pre>
! MoveOnly x = std::move(*s.remove(i));
! </pre></blockquote>
! <ol>
! <li>
! <tt>remove(i)</tt> transfers ownership of the node from the set to a temporary
! <tt>node_ptr</tt>.
! </li>
! <li>
! The <tt>node_ptr</tt> is dereferenced, and that non-const reference is sent to
! <tt>move</tt> to cast it to an rvalue.
! </li>
! <li>
! The rvalue <tt>MoveOnly</tt> is move constructed into <tt>x</tt> from
! the <tt>node_ptr</tt>.
! </li>
! <li>
! <tt>~node_ptr()</tt> destructs the moved-from <tt>MoveOnly</tt> and deallocates
! the node.
! </li>
! </ol>
! 
! <p>
! Contrast this with the <a href="lwg-active.html#1041">1041</a> solution:
! </p>
! <blockquote><pre>
! MoveOnly x = std::move(s.extract(i).first);
! </pre></blockquote>
! 
! <p>
! The former requires one move construction for <tt>x</tt> while the latter
! requires two (one into the <tt>pair</tt> and then one into <tt>x</tt>).  Either
! of these constructions can throw (say if there is only a copy constructor for
! <tt>x</tt>).  With the former, the point of throw is outside of the container
! <tt>s</tt>, after the element has been removed from the container.  With the latter,
! one throwing construction takes place prior to the removal of the element, and
! the second takes place after the element is removed.
! </p>
! 
! </li>
! </ul>
! 
! <p>
! The "node insertion" API maintains the API associated with inserting <tt>value_type</tt>s
! so the customer can use familiar techniques for getting an iterator to the 
! inserted node, or finding out whether it was inserted or not for the "unique"
! containers.
! </p>
! 
! <p>
! Lightly prototyped.  No implementation problems.  Appears to work great
! for the client.
! </p>
! 
! </blockquote>
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="851"></a>851. simplified array construction</h3>
! <p><b>Section:</b> 23.3.2 [array] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Benjamin Kosnik <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! This is an issue that came up on the libstdc++ list, where a
! discrepancy between "C" arrays and C++0x's <tt>std::array</tt> was pointed
! out.
! </p>
! 
! <p>
! In "C," this array usage is possible:
! </p>
! 
! <blockquote><pre>
! int ar[] = {1, 4, 6};
! </pre></blockquote>
! 
! <p>
! But for C++, 
! </p>
! 
! <blockquote><pre>
! std::array&lt;int&gt; a = { 1, 4, 6 }; // error
! </pre></blockquote>
! 
! <p>
! Instead, the second parameter of the <tt>array</tt> template must be
! explicit, like so:
  </p>
  
+ <blockquote><pre>
+ std::array&lt;int, 3&gt; a = { 1, 4, 6 };
+ </pre></blockquote>
+ 
+ <p>
+ Doug Gregor proposes the following solution, that assumes
+ generalized initializer lists.
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;typename T, typename... Args&gt;
+ inline array&lt;T, sizeof...(Args)&gt; 
+ make_array(Args&amp;&amp;... args) 
+ { return { std::forward&lt;Args&gt;(args)... };  }
+ </pre></blockquote>
+ 
+ <p>
+ Then, the way to build an <tt>array</tt> from a list of unknown size is:
+ </p>
+ 
+ <blockquote><pre>
+ auto a = make_array&lt;T&gt;(1, 4, 6);
+ </pre></blockquote>
+ 
+ <p><i>[
+ San Francisco:
+ ]</i></p>
+ 
+ 
  <blockquote>
! <p>
! Benjamin: Move to Ready?
! </p>
! <p>
! Bjarne: I'm not convinced this is useful enough to add, so I'd like us
! to have time to reflect on it.
! </p>
! <p>
! Alisdair: the constraints are wrong, they should be
! </p>
! <blockquote><pre>
! template&lt;ValueType T, ValueType... Args&gt;
! requires Convertible&lt;Args, T&gt;...
! array&lt;T, sizeof...(Args)&gt; make_array(Args&amp;&amp;... args);
! </pre></blockquote>
! <p>
! Alidair: this would be useful if we had a constexpr version.
! </p>
! <p>
! Bjarne: this is probably useful for arrays with a small number of
! elements, but it's not clearly useful otherwise.
! </p>
! <p>
! Consensus is to move to Open.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-06-07 Daniel adds:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! I suggest a fix and a simplification of the current proposal: Recent
! prototyping by
! Howard showed, that a fix is required because narrowing conversion
! 8.5.4 [dcl.init.list]/6 b.3
! would severely limit the possible distribution of argument types, e.g.
! the expression
! <tt>make_array&lt;double&gt;(1, 2.0)</tt> is ill-formed, because the narrowing
! happens <em>inside</em> the
! function body where no constant expressions exist anymore. Furthermore
! given e.g.
! </p>
! <blockquote><pre>
! int f();
! double g();
! </pre></blockquote>
! <p>
! we probably want to support
! </p>
! <blockquote><pre>
! make_array&lt;double&gt;(f(), g());
! </pre></blockquote>
! 
! <p>
! as well. To make this feasible, the currently suggested expansion
! </p>
! 
! <blockquote><pre>
! { std::forward&lt;Args&gt;(args)... }
! </pre></blockquote>
! 
! <p>
! needs to be replaced by
! </p>
! 
! <blockquote><pre>
! { static_cast&lt;T&gt;(std::forward&lt;Args&gt;(args))... }
! </pre></blockquote>
! 
! <p>
! which is safe, because we already ensure convertibility via the
! element-wise <tt>Convertible&lt;Args, T&gt;</tt> requirement. Some other fixes are
! necessary: The <tt>ValueType</tt> requirement for the function <em>parameters</em>
! is invalid, because all lvalue arguments will deduce to an lvalue-reference,
! thereby no longer satisfying this requirement.
! </p>
! 
! <p>
! The suggested simplification is to provide a default-computed effective
! type for the result array based on common_type and decay, in
! unconstrained form:
! </p>
! 
! <blockquote><pre>
! template&lt;typename... Args&gt;
! array&lt;typename decay&lt;typename common_type&lt;Args...&gt;::type&gt;::type,
! sizeof...(Args)&gt;
! make_array(Args&amp;&amp;... args);
! </pre></blockquote>
! 
! <p>
! The approach used below is similar to that of <tt>make_pair</tt> and <tt>make_tuple</tt>
! using a symbol <tt>C</tt> to represent the decayed common type [Note: Special
! handling of <tt>reference_wrapper</tt> types is intentionally <em>not</em> provided, because
! our target has so satisfy <tt>ValueType</tt>, thus under the revised proposal only
! an all-<tt>reference_wrapper</tt>-arguments would be well-formed and an array of
! <tt>reference_wrapper</tt> will be constructed]. I do currently not suggest to
! add new concepts reflecting <tt>decay</tt> and <tt>common_type</tt>, but an implementor will
! need something like this to succeed. Note that we use a similar fuzziness for
! <tt>make_pair</tt> and <tt>make_tuple</tt> currently. This fuzziness is not related to
! the currently
! missing <tt>Constructible&lt;Vi, Ti&amp;&amp;&gt;</tt> requirement for those functions. The following
! proposal fixes that miss for <tt>make_array</tt>. If the corresponding <tt>C</tt> type
! deduction is
! explicitly wanted for standardization, here the implementation
! </p>
! 
! <blockquote><pre>
! auto concept DC&lt;typename... T&gt; {
!   typename type = typename decay&lt;typename common_type&lt;T...&gt;::type&gt;::type;
! }
! </pre></blockquote>
! 
! <p>
! where <tt>C</tt> is identical to <tt>DC&lt;Args...&gt;::type</tt> in the proposed resolution below.
! </p>
! <p>
! I intentionally added no further type relation between type and the concept
! template parameters, but instead added this requirement below to make
! the specification as transparent as possible. As written this concept is
! satisfied, if the corresponding associated type exists.
! </p>
! 
! <p><b>Suggested Resolution:</b></p>
! 
! <ol>
! <li>
! <p>
! Add to the array synopsis in 23.3 [sequences]:
! </p>
! <blockquote><pre>
  <ins>
! template&lt;ReferentType... Args&gt;
! requires ValueType&lt;C&gt; &amp;&amp; IdentityOf&lt;Args&gt; &amp;&amp; Constructible&lt;C, Args&amp;&amp;&gt;...
! array&lt;C, sizeof...(Args)&gt;
! make_array(Args&amp;&amp;... args);
  </ins>
! </pre></blockquote>
! </li>
! 
! <li>
! <p>
! Append after 23.3.2.9 [array.tuple] Tuple interface to class template array
! the following new section:
! </p>
! <blockquote>
! <p>
! 23.4.1.7 Array creation functions [array.creation]
! </p>
! 
! <pre>
! <ins>
! template&lt;ReferentType... Args&gt;
! requires ValueType&lt;C&gt; &amp;&amp; IdentityOf&lt;Args&gt; &amp;&amp; Constructible&lt;C, Args&amp;&amp;&gt;...
! array&lt;C, sizeof...(Args)&gt;
! make_array(Args&amp;&amp;... args);</ins>
! </pre>
! 
! <blockquote>
! <p><ins>
! Let <tt>C</tt> be <tt>decay&lt;common_type&lt;Args...&gt;::type&gt;::type</tt>.
! </ins></p>
! <p>
! <ins><i>Returns:</i> an <tt>array&lt;C, sizeof...(Args)&gt;</tt> initialized with
! <tt>{ static_cast&lt;C&gt;(std::forward&lt;Args&gt;(args))... }</tt>.
! </ins></p>
  </blockquote>
  </blockquote>
+ 
+ </li>
+ 
+ </ol>
+ 
  </blockquote>
  
  <p><i>[
! 2009-07 Frankfurt:
  ]</i></p>
  
  
  <blockquote>
! <p>
! The proposed resolution uses concepts.
! </p>
! <p>
! Daniel to rewrite the proposed resolution.
! </p>
! <p>
! Leave Open.
! </p>
  </blockquote>
  
  <p><i>[
! 2009-07-25 Daniel provides rewritten proposed resolution.
  ]</i></p>
  
  
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! Argument for NAD future: everything about this could be added on. This
! does not require changes to the existing text.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li>
  <p>
! Add to the array synopsis in 23.3 [sequences]:
  </p>
  
+ <blockquote><pre>
+ <ins>template&lt;class... Args&gt;
+   array&lt;<i>CT</i>, sizeof...(Args)&gt;
+   make_array(Args&amp;&amp;... args);</ins>
+ </pre></blockquote>
+ </li>
+ 
+ <li>
  <p>
! Append after 23.3.2.9 [array.tuple] "Tuple interface to class template array" the
! following new section:
  </p>
  
  <blockquote>
  <p>
! <ins>XX.X.X.X Array creation functions [array.creation]</ins>
  </p>
  
! <pre><ins>
! template&lt;class... Args&gt;
! array&lt;<i>CT</i>, sizeof...(Args)&gt;
! make_array(Args&amp;&amp;... args)
! </ins></pre>
! 
! <blockquote>
! <p>
! <ins>Let <i>CT</i> be <tt>decay&lt;common_type&lt;Args...&gt;::type&gt;::type</tt>.</ins>
! </p>
! <p>
! <ins><i>Returns:</i> An <tt>array&lt;<i>CT</i>, sizeof...(Args)&gt;</tt> initialized with <tt>{
! static_cast&lt;<i>CT</i>&gt;(std::forward&lt;Args&gt;(args))... }</tt>.</ins>
! </p>
! 
! <p><ins>
! [<i>Example:</i>
! </ins></p>
! <blockquote><pre><ins>
! int i = 0; int&amp; ri = i;
! make_array(42u, i, 2.78, ri);
! </ins></pre></blockquote>
! <p><ins>
! returns an array of type
! </ins></p>
! <blockquote><pre><ins>
! array&lt;double, 4&gt;
! </ins></pre></blockquote>
! 
! <p><ins>
! &mdash;<i>end example</i>]</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="877"></a>877. to <tt>throw()</tt> or to <i>Throw:</i> Nothing.</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-08-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
!        <p>
! 
! Recent changes to
! the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf">working
! draft</a> have introduced a gratuitous inconsistency with the C++ 2003
! version of the specification with respect to exception guarantees
! provided by standard functions. While the C++ 2003 standard
! consistenly uses the empty exception specification, <tt>throw()</tt>,
! to declare functions that are guaranteed not to throw exceptions, the
! current working draft contains a number of "<i>Throws:</i> Nothing."
! clause to specify essentially the same requirement. The difference
! between the two approaches is that the former specifies the behavior
! of programs that violate the requirement (<tt>std::unexpected()</tt>
! is called) while the latter leaves the behavior undefined.
! 
!        </p>
!        <p>
! 
! A survey of the working draft reveals that there are a total of 209
! occurrences of <tt>throw()</tt> in the library portion of the spec,
! the majority in clause 18, a couple (literally) in 19, a handful in
! 20, a bunch in 22, four in 24, one in 27, and about a dozen in D.9.
! 
!        </p>
!        <p>
! 
! There are also 203 occurrences of "<i>Throws:</i> Nothing." scattered
! throughout the spec.
! 
!        </p>
!        <p>
! 
! While sometimes there are good reasons to use the "<i>Throws:</i>
! Nothing."  approach rather than making use of <tt>throw()</tt>, these
! reasons do not apply in most of the cases where this new clause has
! been introduced and the empty exception specification would be a
! better approach.
! 
!        </p>
!        <p>
! 
! First, functions declared with the empty exception specification
! permit compilers to generate better code for calls to such
! functions. In some cases, the compiler might even be able to eliminate
! whole chunks of user-written code when instantiating a generic
! template on a type whose operations invoked from the template
! specialization are known not to throw. The prototypical example are
! the <tt>std::uninitialized_copy()</tt>
! and <tt>std::uninitialized_fill()</tt> algorithms where the
! entire <tt>catch(...)</tt> block can be optimized away.
! 
!        </p>
!        <p>
! 
! For example, given the following definition of
! the <tt>std::uninitialized_copy</tt> function template and a
! user-defined type <tt>SomeType</tt>:
! 
!        </p>
!        <blockquote>
!            <pre>
! template &lt;class InputIterator, class ForwardIterator&gt;
! ForwardIterator
! uninitialized_copy (InputIterator first, InputIterator last, ForwardIterator res)
! {
!    typedef iterator_traits&lt;ForwardIterator&gt;::value_type ValueType;
! 
!    ForwardIterator start = res;
! 
!    try {
!        for (; first != last; ++first, ++res)
!            ::new (&amp;*res) ValueType (*first);
!    }
!    catch (...) {
!        for (; start != res; --start)
!            (&amp;*start)->~ValueType ();
!        throw;
!    }
!    return res;
! }
! 
! struct SomeType {
!    SomeType (const SomeType&amp;) <ins>throw ()</ins>;
! }</pre>
!        </blockquote>
!        <p>
! 
! compilers are able to emit the following efficient specialization
! of <tt>std::uninitialized_copy&lt;const SomeType*, SomeType*&gt;</tt>
! (note that the <tt>catch</tt> block has been optimized away):
! 
!        </p>
!        <blockquote>
!            <pre>
! template &lt;&gt; SomeType*
! uninitialized_copy (const SomeType *first, const SomeType *last, SomeType *res)
! {
!    for (; first != last; ++first, ++res)
!        ::new (res) SomeType (*first);
! 
!    return res;
! }</pre>
!        </blockquote>
!        <p>
! 
! Another general example is default constructors which, when decorated
! with <tt>throw()</tt>, allow the compiler to eliminate the
! implicit <tt>try</tt> and <tt>catch</tt> blocks that it otherwise must
! emit around each the invocation of the constructor
! in <i>new-expressions</i>.
! 
!        </p>
!        <p>
! 
! For example, given the following definitions of
! class <tt>MayThrow</tt> and <tt>WontThrow</tt> and the two
! statements below:
! 
!        </p>
!        <blockquote>
!            <pre>
! struct MayThrow {
!    MayThrow ();
! };
! 
! struct WontThrow {
!    WontThrow () <ins>throw ()</ins>;
! };
! 
! MayThrow  *a = new MayThrow [N];
! WontThrow *b = new WontThrow [N];</pre>
! 
!        </blockquote>
!        <p>
! 
! the compiler generates the following code for the first statement:
! 
!        </p>
!        <blockquote>
!            <pre>
! MayThrow *a;
! {
!    MayThrow *first = operator new[] (N * sizeof (*a));
!    MayThrow *last  = first + N;
!    MayThrow *next  = first;
!    try {
!        for ( ; next != last; ++next)
!            new (next) MayThrow;
!    }
!    catch (...) {
!        for ( ; first != first; --next)
!            next->~MayThrow ();
!        operator delete[] (first);
!        throw;
!    }
!    a = first;
! }</pre>
!        </blockquote>
!        <p>
! 
! but it is can generate much more compact code for the second statement:
! 
!        </p>
!        <blockquote>
!            <pre>
! WontThrow *b    = operator new[] (N * sizeof (*b));
! WontThrow *last = b + N;
! for (WontThrow *next = b; next != last; ++next)
!    new (next) WontThrow;
  </pre>
+        </blockquote>
+        <p>
+ 
+ Second, in order for users to get the maximum benefit out of the new
+ <tt>std::has_nothrow_xxx</tt> traits when using standard library types
+ it will be important for implementations to decorate all non throwing
+ copy constructors and assignment operators with <tt>throw()</tt>. Note
+ that while an optimizer may be able to tell whether a function without
+ an explicit exception specification can throw or not based on its
+ definition, it can only do so when it can see the source code of the
+ definition. When it can't it must assume that the function may
+ throw. To prevent violating the One Definition Rule,
+ the <tt>std::has_nothrow_xxx</tt> trait must return the most
+ pessimistic guess across all translation units in the program, meaning
+ that <tt>std::has_nothrow_xxx&lt;T&gt;::value</tt> must evaluate to
+ <tt>false</tt> for any <tt>T</tt> whose <tt>xxx</tt>
+ (where <tt>xxx</tt> is default or copy ctor, or assignment operator)
+ is defined out-of-line.
+ 
+        </p>
+        <p>
+ 
+ <b>Counterarguments:</b>
+ 
+        </p>
+        <p>
+ 
+ During the discussion of this issue
+ on <a href="mailto:c++std-lib@accu.org">c++std-lib@accu.org</a>
+ (starting with post <tt>c++std-lib-21950</tt>) the following arguments
+ in favor of the "<i>Throws:</i> Nothing." style have been made.
+ 
+        </p>
+          <ol>
+            <li>
+ 
+ Decorating functions that cannot throw with the empty exception
+ specification can cause the compiler to generate suboptimal code for
+ the implementation of the function when it calls other functions that
+ aren't known to the compiler not to throw (i.e., that aren't decorated
+ with <tt>throw()</tt> even if they don't actually throw). This is a
+ common situation when the called function is a C or POSIX function.
+ 
+            </li>
+            <li>
+ 
+ Alternate, proprietary mechanisms exist (such as
+ GCC <a href="http://gcc.gnu.org/onlinedocs/gcc-4.3.0/gcc/Function-Attributes.html#index-g_t_0040code_007bnothrow_007d-function-attribute-2160"><tt>__attribute__((nothrow))</tt></a>
+ or Visual
+ C++ <a href="http://msdn.microsoft.com/en-us/library/49147z04(VS.80).aspx"><tt>__declspec(nothrow)</tt></a>)
+ that let implementers mark up non-throwing functions, often without
+ the penalty mentioned in (1) above. The C++ standard shouldn't
+ preclude the use of these potentially more efficient mechanisms.
+ 
+            </li>
+            <li>
+ 
+ There are functions, especially function templates, that invoke
+ user-defined functions that may or may not be
+ declared <tt>throw()</tt>. Declaring such functions with the empty
+ exception specification will cause compilers to generate suboptimal
+ code when the user-defined function isn't also declared not to throw.
+ 
+            </li>
+         </ol>
+        <p>
+ 
+ The answer to point (1) above is that implementers can (and some have)
+ declare functions with <tt>throw()</tt> to indicate to the compiler
+ that calls to the function can safely be assumed not to throw in order
+ to allow it to generate efficient code at the call site without also
+ having to define the functions the same way and causing the compiler
+ to generate suboptimal code for the function definition. That is, the
+ function is declared with <tt>throw()</tt> in a header but it's
+ defined without it in the source file. The <tt>throw()</tt>
+ declaration is suppressed when compiling the definition to avoid
+ compiler errors. This technique, while strictly speaking no permitted
+ by the language, is safe and has been employed in practice. For
+ example, the GNU C library takes this approach. Microsoft Visual C++
+ takes a similar approach by simply assuming that no function with C
+ language linkage can throw an exception unless it's explicitly
+ declared to do so using the language extension <tt>throw(...)</tt>.
+ 
+        </p>
+        <p>
+ 
+ Our answer to point (2) above is that there is no existing practice
+ where C++ Standard Library implementers have opted to make use of the
+ proprietary mechanisms to declare functions that don't throw. The
+ language provides a mechanism specifically designed for this
+ purpose. Avoiding its use in the specification itself in favor of
+ proprietary mechanisms defeats the purpose of the feature. In
+ addition, making use of the empty exception specification
+ inconsistently, in some areas of the standard, while conspicuously
+ avoiding it and making use of the "<i>Throws:</i> Nothing." form in
+ others is confusing to users.
+ 
+        </p>
+        <p>
+ 
+ The answer to point (3) is simply to exercise caution when declaring
+ functions and especially function templates with the empty exception
+ specification. Functions that required not to throw but that may call
+ back into user code are poor candidates for the empty exception
+ specification and should instead be specified using "<i>Throws:</i>
+ Nothing." clause.
+ 
+       </p>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
  <blockquote>
! <p>
! We need someone to do an extensive review.
! </p>
! <p>
! NAD Future.
! </p>
  </blockquote>
+ 
+    
+    <p><b>Proposed resolution:</b></p>
+        <p>
+ 
+ We propose two possible solutions. Our recommendation is to adopt
+ Option 1 below.
+ 
+        </p>
+        <p>
+ 
+ <b>Option 1:</b>
+ 
+        </p>
+        <p>
+ 
+ Except for functions or function templates that make calls back to
+ user-defined functions that may not be declared <tt>throw()</tt>
+ replace all occurrences of the "<i>Throws:</i> Nothing." clause with
+ the empty exception specification. Functions that are required not to
+ throw but that make calls back to user code should be specified to
+ "<i>Throw:</i> Nothing."
+ 
+        </p>
+        <p>
+ 
+ <b>Option 2:</b>
+ 
+        </p>
+        <p>
+ 
+ For consistency, replace all occurrences of the empty exception
+ specification with a "<i>Throws:</i> Nothing." clause.
+ 
+        </p>
+    
+ 
+ 
+ 
+ <hr>
+ <h3><a name="933"></a>933. Unique_ptr defect</h3>
+ <p><b>Section:</b> 20.8.1.2.5 [unique.ptr.single.modifiers] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-11-27 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.modifiers">issues</a> in [unique.ptr.single.modifiers].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ If we are supporting stateful deleters, we need an overload for
+ <tt>reset</tt> that
+ takes a deleter as well.
+ </p>
+ 
+ <blockquote><pre>
+ void reset( pointer p, deleter_type d);
+ </pre></blockquote>
+ 
+ <p>
+ We probably need two overloads to support move-only deleters, and
+ this
+ sounds uncomfortably like the two constructors I have been ignoring
+ for
+ now...
+ </p>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote>
+ <p>
+ Howard comments that we have the functionality via move-assigment.
+ </p>
+ <p>
+ Move to Open.
+ </p>
  </blockquote>
  
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Mark as NAD Future.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
  <p>
  </p>
  
! 
! 
! 
! 
! <hr>
! <h3><a name="935"></a>935. clock error handling needs to be specified</h3>
! <p><b>Section:</b> 20.12.7 [time.clock] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-11-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Each of the three clocks specified in Clocks 20.12.7 [time.clock]
! provides the member function:
! </p>
! 
! <blockquote><pre>
! static time_point now();
! </pre></blockquote>
! 
! <p>
! The semantics specified by Clock requirements 20.12.3 [time.clock.req]
! make no mention of error handling. Thus the function may throw <tt>bad_alloc</tt>
! or an implementation-defined exception (17.6.5.12 [res.on.exception.handling]
! paragraph 4).
! </p>
! 
! <p>
! Some implementations of these functions on POSIX, Windows, and
! presumably on other operating systems, may fail in ways only detectable
! at runtime. Some failures on Windows are due to supporting chipset
! errata and can even occur after successful calls to a clock's <tt>now()</tt>
! function.
! </p>
! 
! <p>
! These functions are used in cases where exceptions are not appropriate
! or where the specifics of the exception or cause of error need to be
! available to the user. See
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2828.html">N2828</a>,
! <i>Library Support for hybrid error
! handling (Rev 1)</i>, for more specific discussion of use cases. Thus some change in
! the interface of now is required.
! </p>
! 
! <p>
! The proposed resolution has been implemented in the Boost version of the
! chrono library. No problems were encountered.
! </p>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
  <blockquote>
  <p>
! We recommend this issue be deferred until the next Committee Draft
! has been issued and the prerequisite paper has been accepted.
! </p>
! <p>
! Move to Open.
  </p>
+ </blockquote>
  
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Mark as NAD future. Too late to make this change without having already
+ accepted the hybrid error handling proposal.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
  <p>
! Accept the proposed wording of
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2828.html">N2828</a>,
! <i>Library Support for hybrid error handling (Rev 1)</i>.
  </p>
  
  <p>
! Change <tt>Clock</tt> requirements 20.12.3 [time.clock.req] as indicated:
! </p>
! 
! <blockquote>
! <p>
! -2- In Table 55 <tt>C1</tt> and <tt>C2</tt> denote clock types. <tt>t1</tt> and
! <tt>t2</tt> are values returned by <tt>C1::now()</tt> where the call 
! returning <tt>t1</tt> happens before (1.10) the call returning <tt>t2</tt> and
! both of these calls happen before <tt>C1::time_point::max()</tt>.
! <ins><tt>ec</tt> denotes an object of type <tt>error_code</tt> 
! (19.5.2.1 [syserr.errcode.overview]).</ins>
! </p>
! 
! <table border="1">
! <caption>Table 55 &mdash; Clock requirements</caption>
! <tr>
! <th>Expression</th><th>Return type</th><th>Operational semantics</th>
! </tr>
! 
! <tr>
! <td>...</td>
! <td>...</td>
! <td>...</td>
! </tr>
! 
! <tr>
! <td><tt>C1::now()</tt></td>
! <td><tt>C1::time_point</tt></td>
! <td>Returns a <tt>time_point</tt> object representing the current point in time.
! </td>
! </tr>
! 
! <tr>
! <td><tt><ins>C1::now(ec)</ins></tt></td>
! <td><tt><ins>C1::time_point</ins></tt></td>
! <td><ins>Returns a <tt>time_point</tt> object representing the current point in time.</ins>
! </td>
! </tr>
! </table>
! </blockquote>
! 
! <p>
! Change class <tt>system_clock</tt> 20.12.7.1 [time.clock.system] as indicated:
! </p>
! 
! <blockquote><pre>
! static time_point now(<ins>error_code&amp; ec=throws()</ins>);
! </pre></blockquote>
! 
! <p>
! Change class <tt>monotonic_clock</tt> X [time.clock.monotonic] as indicated:
! </p>
! 
! <blockquote><pre>
! static time_point now(<ins>error_code&amp; ec=throws()</ins>);
! </pre></blockquote>
! 
! <p>
! Change class <tt>high_resolution_clock</tt> 20.12.7.3 [time.clock.hires] as indicated:
! </p>
! 
! <blockquote><pre>
! static time_point now(<ins>error_code&amp; ec=throws()</ins>);
! </pre></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="936"></a>936. Mutex type overspecified</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-12-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-active.html#961">961</a></p>
! <p><b>Discussion:</b></p>
! 
! 
! 
! <p>
! 30.4.1 [thread.mutex.requirements] describes the requirements for a type to be
! a "Mutex type". A Mutex type can be used as the template argument for
! the <tt>Lock</tt> type that's passed to <tt>condition_variable_any::wait</tt> (although
! <tt>Lock</tt> seems like the wrong name here, since <tt>Lock</tt> is given a different
! formal meaning in 30.4.2 [thread.lock]) and, although the WD doesn't quite say
! so, as the template argument for <tt>lock_guard</tt> and <tt>unique_lock</tt>.
! </p>
! 
! <p>
! The requirements for a Mutex type include:
  </p>
  
  <ul>
! <li>
! <tt>m.lock()</tt> shall be well-formed and have [described] semantics, including a return type of <tt>void</tt>.
! </li>
! <li>
! <tt>m.try_lock()</tt> shall be well-formed and have [described] semantics, including a return type of <tt>bool</tt>.
! </li>
! <li>
! <tt>m.unlock()</tt> shall be well-formed and have [described] semantics, including a return type of <tt>void</tt>.
! </li>
  </ul>
  
+ <p>
+ Also, a Mutex type "shall not be copyable nor movable".
+ </p>
+ 
+ <p>
+ The latter requirement seems completely irrelevant, and the three
+ requirements on return types are tighter than they need to be. For
+ example, there's no reason that <tt>lock_guard</tt> can't be instantiated with a
+ type that's copyable. The rule is, in fact, that <tt>lock_guard</tt>, etc. won't
+ try to copy objects of that type. That's a constraint on locks, not on
+ mutexes. Similarly, the requirements for <tt>void</tt> return types are
+ unnecessary; the rule is, in fact, that <tt>lock_guard</tt>, etc. won't use any
+ returned value. And with the return type of <tt>bool</tt>, the requirement should
+ be that the return type is convertible to <tt>bool</tt>.
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Move to open. Related to conceptualization and should probably be tackled as part of that.
+ </p>
+ <ul>
+ <li>
+ The intention is not only to place a constraint on what types such as
+ <tt>lock_guard</tt> may do with mutex types, but on what any code, including user
+ code, may do with mutex types. Thus the constraints as they are apply to
+ the mutex types themselves, not the current users of mutex types in the
+ standard.
+ </li>
+ <li>
+ This is a low priority issue; the wording as it is may be overly
+ restrictive but this may not be a real issue.
+ </li>
+ </ul>
  </blockquote>
+ 
+ <p><i>[
+ Post Summit Anthony adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Section 30.4.1 [thread.mutex.requirements] conflates the
+ requirements on a generic Mutex type (including user-supplied mutexes)
+ with the requirements placed on the standard-supplied mutex types in an
+ attempt to group everything together and save space.
+ </p>
+ <p>
+ When applying concepts to chapter 30, I suggest that the concepts
+ <tt>Lockable</tt> and <tt>TimedLockable</tt> embody the requirements for
+ *use* of a mutex type as required by
+ <tt>unique_lock/lock_guard/condition_variable_any</tt>. These should be
+ relaxed as Pete describes in the issue. The existing words in 30.4.1 [thread.mutex.requirements] are requirements on all of
+ <tt>std::mutex</tt>, <tt>std::timed_mutex</tt>,
+ <tt>std::recursive_mutex</tt> and <tt>std::recursive_timed_mutex</tt>,
+ and should be rephrased as such.
+ </p>
  </blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="961"></a>961. Various threading bugs #11</h3>
+ <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Duplicate of:</b> <a href="lwg-active.html#936">936</a></p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 30.4.1 [thread.mutex.requirements] describes required member
+ functions of mutex types, and requires that they throw exceptions under
+ certain circumstances. This is overspecified. User-defined types can
+ abort on such errors without affecting the operation of templates
+ supplied by standard-library.
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ <blockquote><p>
+ Move to open. Related to conceptualization and should probably be
+ tackled as part of that.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Would be OK to leave it as is for time constraints, could loosen later.
+ </p>
+ 
+ <p>
+ Mark as NAD Future.
+ </p>
  </blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1025"></a>1025. The library should provide more specializations for <tt>std::hash</tt></h3>
+ <p><b>Section:</b> 20.9.13 [unord.hash] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#unord.hash">active issues</a> in [unord.hash].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 208 [CD1]</b></p>
+ 
+ <p>
+ <tt>std::hash</tt> should be implemented for much more of the standard
+ library. In particular for <tt>pair</tt>, <tt>tuple</tt> and all the
+ standard containers.
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1031"></a>1031. Need <tt>shared_ptr</tt> conversion to a <tt>unique_ptr</tt></h3>
+ <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses US 78 [CD1]</b></p>
+ 
+ <p>
+ There is presently no way to convert directly from a <tt>shared_ptr</tt> to a
+ <tt>unique_ptr</tt>. Add an interface that performs the conversion. 
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ We look forward to a paper on this topic. We recommend no action until a
+ paper is available. We believe that the shared pointer must use the default
+ deleter for the conversion to succeed.
+ </p></blockquote>
+ 
+ <p><i>[
+ Peter Dimov adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ This is basically a request for <tt>shared_ptr&lt;&gt;::release</tt> in
+ disguise, with all the associated problems. Not a good idea.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-07 post-Frankfurt:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ The rationale for the omission of a release() member function from shared_ptr is given in:
+ <a href="http://www.boost.org/doc/libs/1_39_0/libs/smart_ptr/shared_ptr.htm">http://www.boost.org/doc/libs/1_39_0/libs/smart_ptr/shared_ptr.htm</a>
+ </p>
+ <p>
+ The implementation of such a member is non-trivial (and maybe
+ impossible), because it would need to account for the deleter.
+ </p>
  </blockquote>
  
  <p><i>[
! 2009-07-26 Howard sets to Tentatively NAD Future.
  ]</i></p>
  
  
  <blockquote>
  <p>
! I took an online poll and got 3 votes for NAD and 3 for NAD Future.  Personally
! I prefer NAD Future as this does refer to an extension that could conceivably be
! considered beyond C++0X.
  </p>
+ 
  <p>
! However such an extension would need to solve a couple of problems:
  </p>
+ 
+ <ol>
+ <li>What is the interface for such a conversion when the <tt>shared_ptr</tt> does
+ not have unique ownership?  Throw an exception?  Create a null <tt>unique_ptr</tt>?
+ Undefined behavior?
+ </li>
+ 
+ <li>
  <p>
! How does one handle custom deleters given to the <tt>shared_ptr</tt> constructor?
  </p>
  <p>
! I do not believe it is possible to implement a general answer to this question.
! The <tt>shared_ptr</tt> deleter is a run time (or construction time) characteristic.
! The <tt>unique_ptr</tt> deleter is a compile time characteristic.  In general one
! can not know to what type of <tt>unqiue_ptr</tt> you are converting to.
! </p>
! <p>
! One answer is for the user of the conversion to specify the deleter type and perhaps
! throw an exception if the specification turns out to be incorrect.
! </p>
! <p>
! Another answer is for the conversion to only be valid when the underlying deleter
! is <tt>default_delete</tt>.  We would probalby need to specify that this is indeed the
! underlying deleter of a <tt>shared_ptr</tt> when a custom deleter is not given in
! the constructor.
  </p>
+ </li>
+ </ol>
  
+ <p>
+ At any rate, there are non-trivial design issues which would need to be implemented
+ and tested in the field for usability prior to standardization.
+ </p>
  </blockquote>
  
+ <p><i>[
+ 2009 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to NAD Future.
+ </p></blockquote>
+ 
  
  
  <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1041"></a>1041. Add associative/unordered container functions that allow to extract elements</h3>
+ <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 239 [CD1]</b></p>
+ 
  <p>
! It is not possible to take a move-only key out of an unordered
! container, such as (<tt>multi</tt>)<tt>set</tt> or
! (<tt>multi</tt>)<tt>map</tt>, or the new unordered containers.
  </p>
  
! <p>
! Add below <tt>a.erase(q)</tt>, <tt>a.extract(q)</tt>, with the following notation:
! </p>
! <p>
! <tt>a.extract(q)></tt>, Return type <tt>pair&lt;key, iterator&gt;</tt>
! Extracts the element pointed to by <tt>q</tt> and erases it from the
! <tt>set</tt>. Returns a <tt>pair</tt> containing the value pointed to by
! <tt>q</tt> and an <tt>iterator</tt> pointing to the element immediately
! following <tt>q</tt> prior to the element being erased. If no such
! element exists,returns <tt>a.end()</tt>.
! </p>
  
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote><p>
! We look forward to a paper on this topic. We recommend no action until a
! paper is available. The paper would need to address exception safety.
! </p></blockquote>
! 
! <p><i>[
! Post Summit Alisdair adds:
! ]</i></p>
! 
! 
! <blockquote><p>
! Would <tt>value_type</tt> be a better return type than <tt>key_type</tt>?
! </p></blockquote>
! 
! <p><i>[
! 2009-07 post-Frankfurt:
! ]</i></p>
! 
! 
! <blockquote><p>
! Leave Open. Alisdair to contact Chris Jefferson about this.
! </p></blockquote>
! 
! <p><i>[
! 2009-09-20 Howard adds:
! ]</i></p>
! 
! 
! <blockquote><p>
! See the 2009-09-19 comment of <a href="lwg-active.html#839">839</a> for an API which
! accomplishes this functionality and also addresses several other use
! cases which this proposal does not.
! </p></blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! Mark as NAD Future. No consensus to make the change at this time.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! In 23.2.4 [associative.reqmts] Table 85, add:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 85 --  Associative container requirements (in addition to container)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
! <th>Complexity</th>
! </tr>
! <tr>
! <td><tt>a.erase(q)</tt></td>
! <td>...</td>
! <td>...</td>
! <td>...</td>
! </tr>
! <tr>
! <td><ins><tt>a.extract(q)</tt></ins></td>
! <td><ins><tt>pair&lt;key_type, iterator&gt;</tt></ins></td>
! <td><ins>Extracts the element pointed to by <tt>q</tt> and erases it from the <tt>set</tt>. 
! Returns a <tt>pair</tt> containing the value pointed to by <tt>q</tt> and an <tt>iterator</tt>
! pointing to the element immediately following <tt>q</tt> prior to the element being
! erased. If no such element 
! exists, returns <tt>a.end()</tt>.</ins></td>
! <td><ins>amortized constant</ins></td>
! </tr>
! </table>
  </blockquote>
  
+ <p>
+ In 23.2.5 [unord.req] Table 87, add:
+ </p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 87 -- Unordered associative container requirements (in addition to container)</caption>
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Assertion/note<br/>pre-/post-condition</th>
+ <th>Complexity</th>
+ </tr>
+ <tr>
+ <td><tt>a.erase(q)</tt></td>
+ <td>...</td>
+ <td>...</td>
+ <td>...</td>
+ </tr>
+ <tr>
+ <td><ins><tt>a.extract(q)</tt></ins></td>
+ <td><ins><tt>pair&lt;key_type, iterator&gt;</tt></ins></td>
+ <td><ins>Extracts the element pointed to by <tt>q</tt> and erases it from the <tt>set</tt>. 
+ Returns a <tt>pair</tt> containing the value pointed to by <tt>q</tt> and an <tt>iterator</tt>
+ pointing to the element immediately following <tt>q</tt> prior to the element being
+ erased. If no such element 
+ exists, returns <tt>a.end()</tt>.</ins></td>
+ <td><ins>amortized constant</ins></td>
+ </tr>
+ </table>
+ </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1052"></a>1052. <tt>reverse_iterator::operator-&gt;</tt> should also support smart pointers</h3>
! <p><b>Section:</b> 24.5.1.3.5 [reverse.iter.opref] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reverse.iter.opref">issues</a> in [reverse.iter.opref].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
  <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 281 [CD1]</b></p>
+ 
  <p>
! The current specification for return value for <tt>reverse_iterator::operator-&gt;</tt>
! will always be a true pointer type, but <tt>reverse_iterator</tt> supports proxy
! iterators where the pointer type may be some kind of 'smart pointer'.
  </p>
  
! <p><i>[
! Summit:
! ]</i></p>
  
  
! <blockquote>
! <p>
! <tt>move_iterator</tt> avoids this problem by returning a value of the wrapped
! Iterator type.
! study group formed to come up with a suggested resolution.
! </p>
! <p>
! <tt>move_iterator</tt> solution shown in proposed wording.
! </p>
! </blockquote>
  
! <p><i>[
! 2009-07 post-Frankfurt:
! ]</i></p>
! 
! 
! <blockquote><p>
! Howard to deconceptize. Move to Review after that happens.
! </p></blockquote>
! 
! <p><i>[
! 2009-08-01 Howard deconceptized:
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! We can't think of any reason we can't just define reverse
! iterator's pointer types to be the same as the underlying iterator's
! pointer type, and get it by calling the right arrow directly.
! </p>
! <p>
! Here is the proposed wording that was replaced:
  </p>
+ <blockquote><pre>
+ template &lt;class Iterator&gt; 
+ class reverse_iterator { 
+   ...
+   typedef <del>typename iterator_traits&lt;</del>Iterator<del>&gt;::pointer</del> pointer;
+ </pre></blockquote>
  
  <p>
! Change 24.5.1.3.5 [reverse.iter.opref]:
  </p>
  
! <blockquote><pre>
! pointer operator-&gt;() const;
! </pre>
! <blockquote><p>
! <i>Returns:</i>
! </p><blockquote><pre>
! <del>&amp;(operator*());</del>
! <ins>this-&gt;tmp = current;</ins>
! <ins>--this-&gt;tmp;</ins>
! <ins>return this-&gt;tmp;</ins>
! </pre></blockquote>
! </blockquote>
! </blockquote>
  
! </blockquote>
  
! <p><i>[
! 2010-03-03 Daniel opens:
! ]</i></p>
  
  
+ <blockquote>
  <ol>
+ 
  <li>
! There is a minor problem with the exposition-only declaration of the private
! member <tt>deref_tmp</tt> which is modified in a const member function (and the
! same problem occurs in the specification of <tt>operator*</tt>). The fix is to
! make it a mutable member.
  </li>
  
  <li>
! <p>
! The more severe problem is that the resolution for some reasons
! does not explain in the rationale why it was decided to differ from
! the suggested fix (using <tt>deref_tmp</tt> instead of <tt>tmp</tt>) in the
! [ 2009-10 Santa Cruz] comment:
! </p>
! 
! <blockquote><pre>
! this-&gt;deref_tmp = current;
! --this-&gt;deref_tmp;
! return this-&gt;deref_tmp;
! </pre></blockquote>
! 
! <p>
! combined with the change of
! </p>
! 
! <blockquote><pre>
! typedef typename iterator_traits&lt;Iterator&gt;::pointer pointer;
! </pre></blockquote>
! 
! <p>
! to
! </p>
! 
! <blockquote><pre>
! typedef Iterator pointer;
! </pre></blockquote>
! 
! <p>
! The problem of the agreed on wording is that the following rather
! typical example, that compiled with the wording before 1052 had
! been applied, won't compile anymore:
! </p>
! 
! <blockquote><pre>
! #include &lt;iterator&gt;
! #include &lt;utility&gt;
! 
! int main() {
!   typedef std::pair&lt;int, double&gt; P;
!   P op;
!   std::reverse_iterator&lt;P*&gt; ri(&amp;op + 1);
!   ri-&gt;first; // Error
! }
! </pre></blockquote>
! 
! <p>
! Comeau online returns (if a correspondingly changed
! <tt>reverse_iterator</tt> is used):
! </p>
! 
! <blockquote><pre>
! "error: expression must have class type
!      return deref_tmp.operator-&gt;();
!             ^
!          detected during instantiation of "Iterator
!                    reverse_iterator&lt;Iterator&gt;::operator-&gt;() const [with
!                    Iterator=std::pair&lt;int, double&gt; *]""
! </pre></blockquote>
! 
! <p>
! Thus the change will break valid, existing code based
! on <tt>std::reverse_iterator</tt>.
! </p>
! 
  </li>
  
+ </ol>
+ 
+ <p>
+ IMO the suggestion proposed in the comment is a necessary fix, which harmonizes
+ with the similar specification of <tt>std::move_iterator</tt> and properly
+ reflects the recursive nature of the evaluation of <tt>operator-&gt;</tt>
+ overloads.
+ </p>
+ 
+ <p>
+ Suggested resolution:
+ </p>
+ 
+ <ol>
+ 
  <li>
! <p>
! In the class template <tt>reverse_iterator</tt> synopsis of 24.5.1.1 [reverse.iterator] 
! change as indicated:
! </p>
! 
! <blockquote><pre>
! namespace std {
! template &lt;class Iterator&gt;
! class reverse_iterator : public
!              iterator&lt;typename iterator_traits&lt;Iterator&gt;::iterator_category,
!              typename iterator_traits&lt;Iterator&gt;::value_type,
!              typename iterator_traits&lt;Iterator&gt;::difference_type,
!              <del>typename iterator_traits&lt;</del>Iterator<del>&gt;::pointer</del>,
!              typename iterator_traits&lt;Iterator&gt;::reference&gt; {
! public:
!   [..]
!   typedef <del>typename iterator_traits&lt;</del>Iterator<del>&gt;::pointer</del> pointer;
!   [..]
! protected:
!   Iterator current;
! private:
!   <ins>mutable</ins> Iterator deref_tmp; // exposition only
! };
! </pre></blockquote>
  </li>
  
  <li>
! Change 24.5.1.3.5 [reverse.iter.opref]/1 as indicated:
! 
! <blockquote><pre>
! pointer operator-&gt;() const;
! </pre>
! 
! <blockquote><p>
! 1 <i><del>Returns</del> <ins>Effects</ins>:</i> <del><tt>&amp;(operator*())</tt>.</del>
! </p><blockquote><pre>
! <ins>deref_tmp = current;</ins>
! <ins>--deref_tmp;</ins>
! <ins>return deref_tmp;</ins>
! </pre></blockquote>
! </blockquote>
! </blockquote>
! 
  </li>
  
  </ol>
  
! </blockquote>
  
! <p><i>[
! 2010 Pittsburgh:
! ]</i></p>
  
  
! <blockquote>
! <p>
! We prefer to make to use a local variable instead of <tt>deref_tmp</tt> within
! <tt>operator-&gt;()</tt>.  And although this means that the <tt>mutable</tt>
! change is no longer needed, we prefer to keep it because it is needed for
! <tt>operator*()</tt> anyway.
! </p>
  
! <p>
! Here is the proposed wording that was replaced:
! </p>
  
+ <blockquote class="note">
  <p>
! Change 24.5.1.3.5 [reverse.iter.opref]:
  </p>
  
! <blockquote><pre>
! pointer operator-&gt;() const;
! </pre>
  
! <blockquote><p>
! <i>Returns:</i>
! </p><blockquote><pre>
! <del>&amp;(operator*());</del>
! <ins>deref_tmp = current;
! --deref_tmp;
! return deref_tmp::operator-&gt;();</ins>
! </pre></blockquote>
  
! </blockquote>
! </blockquote>
! 
! 
! </blockquote>
! </blockquote>
  
  <p><i>[
! 2010-03-10 Howard adds:
  ]</i></p>
  
+ 
  <blockquote>
  <p>
! Here are three tests that the current proposed wording passes, and no
! other solution I've seen passes all three:
  </p>
+ 
+ <ol>
+ <li>
  <p>
! Proxy pointer support:
! </p>
! <blockquote><pre>
! #include &lt;iterator&gt;
! #include &lt;cassert&gt;
! 
! struct X { int m; };
! 
! X x;
! 
! struct IterX {
!     typedef std::bidirectional_iterator_tag iterator_category;
!     typedef X&amp; reference;
!     struct pointer
!     {
!         pointer(X&amp; v) : value(v) {}
!         X&amp; value;
!         X* operator-&gt;() const {return &amp;value;}
!     };
!     typedef std::ptrdiff_t difference_type;
!     typedef X value_type;
!     // additional iterator requirements not important for this issue
!     
!     reference operator*() const { return x; }
!     pointer operator-&gt;() const { return pointer(x); }
!     IterX&amp; operator--() {return *this;}
! 
! };
! 
! int main()
! {
!     std::reverse_iterator&lt;IterX&gt; ix;
!     assert(&amp;ix-&gt;m == &amp;(*ix).m);
! }
! </pre></blockquote>
! </li>
! <li>
! <p>
! Raw pointer support:
  </p>
+ <blockquote><pre>
+ #include &lt;iterator&gt;
+ #include &lt;utility&gt;
+ 
+ int main() {
+   typedef std::pair&lt;int, double&gt; P;
+   P op;
+   std::reverse_iterator&lt;P*&gt; ri(&amp;op + 1);
+   ri-&gt;first; // Error
+ }
+ </pre></blockquote>
+ </li>
+ <li>
+ <p>
+ Caching iterator support:
+ </p>
+ <blockquote><pre>
+ #include &lt;iterator&gt;
+ #include &lt;cassert&gt;
+ 
+ struct X { int m; };
+ 
+ struct IterX {
+     typedef std::bidirectional_iterator_tag iterator_category;
+     typedef X&amp; reference;
+     typedef X* pointer;
+     typedef std::ptrdiff_t difference_type;
+     typedef X value_type;
+     // additional iterator requirements not important for this issue
+     
+     reference operator*() const { return value; }
+     pointer operator-&gt;() const { return &amp;value; }
+     IterX&amp; operator--() {return *this;}
+ 
+ private:
+     mutable X value;
+ };
+ 
+ int main()
+ {
+     std::reverse_iterator&lt;IterX&gt; ix;
+     assert(&amp;ix-&gt;m == &amp;(*ix).m);
+ }
+ </pre></blockquote>
+ </li>
+ </ol>
  </blockquote>
  
  <p><i>[
! 2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
! Moved to NAD Future, rationale added.
! </p></blockquote>
! 
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! The LWG did not reach a consensus for a change to the WP.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! 
! <li>
! <p>
! In the class template <tt>reverse_iterator</tt> synopsis of 24.5.1.1 [reverse.iterator] change as indicated:
! </p>
! 
! <blockquote><pre>
! namespace std {
! template &lt;class Iterator&gt;
! class reverse_iterator : public
!              iterator&lt;typename iterator_traits&lt;Iterator&gt;::iterator_category,
!              typename iterator_traits&lt;Iterator&gt;::value_type,
!              typename iterator_traits&lt;Iterator&gt;::difference_type,
!              <del>typename iterator_traits&lt;</del>Iterator<ins>&amp;</ins><del>&gt;::pointer</del>,
!              typename iterator_traits&lt;Iterator&gt;::reference&gt; {
! public:
!   [..]
!   typedef <del>typename iterator_traits&lt;</del>Iterator<ins>&amp;</ins><del>&gt;::pointer</del> pointer;
!   [..]
! protected:
!   Iterator current;
! private:
!   <ins>mutable</ins> Iterator deref_tmp; // exposition only
! };
! </pre></blockquote>
! </li>
! 
! <li>
! Change 24.5.1.3.5 [reverse.iter.opref]/1 as indicated:
! 
! <blockquote><pre>
! pointer operator-&gt;() const;
! </pre>
! 
! <blockquote><p>
! 1 <i><del>Returns</del> <ins>Effects</ins>:</i> <del><tt>&amp;(operator*())</tt>.</del>
! </p><blockquote><pre>
! <ins>deref_tmp = current;</ins>
! <ins>--deref_tmp;</ins>
! <ins>return deref_tmp;</ins>
! </pre></blockquote>
  </blockquote>
+ </blockquote>
+ 
+ </li>
+ 
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1053"></a>1053. Unify algorithms with operator and function object variants</h3>
+ <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#algorithms">active issues</a> in [algorithms].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#algorithms">issues</a> in [algorithms].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 295 [CD1]</b></p>
+ 
+ <p>
+ There is a level of redundancy in the library specification for many
+ algorithms that can be eliminated with the combination of concepts and
+ default parameters for function templates. Eliminating redundancy simplified
+ specification and reduces the risk of introducing accidental
+ inconsistencies.
+ </p>
+ <p>
+ Proposed resolution: Adopt
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2743.pdf">N2743</a>.
+ </p>
  
  <p><i>[
! Summit:
  ]</i></p>
  
  
  <blockquote>
  <p>
! NAD, this change would break code that takes the address of an algorithm.
  </p>
+ </blockquote>
+ 
+ <p><i>[
+ Post Summit Alisdair adds:
+ ]</i></p>
+ 
  
  <blockquote>
! <p>
! Request 'Open'.  The issues in the paper go beyond just reducing
! the number of signatures, but cover unifying the idea of the ordering
! operation used by algorithms, containers and other library components.  At
! least, it takes a first pass at the problem.
! </p>
! 
! <p>
! For me (personally) that was the more important part of the paper, and not
! clearly addressed by the Summit resolution.
! </p>
  </blockquote>
  
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Too inventive, too late, would really need a paper. Moved to NAD Future.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1112"></a>1112. bitsets and new style for loop</h3>
+ <p><b>Section:</b> 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-06 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! <tt>std::bitset</tt> is a homogeneous container-like sequence of bits, yet it does
! not model the Range concept so cannot be used with the new for-loop syntax.
! It is the only such type in the library that does NOT support the new for
! loop.
! </p>
! <p>
! The obvious reason is that bitset does not support iterators.
! </p>
! <p>
! At least two reasonable solutions are available:
! </p>
! <ol style="list-style-type:lower-roman">
! <li>
! Add an iterator interface to <tt>bitset</tt>, bringing its interface close to that
! of <tt>std::array</tt>
! </li>
! <li>
! Provide an unspecified concept_map for <tt>Range&lt;bitset&gt;</tt>.
! </li>
! </ol>
! <p>
! The latter will still need some kind of iterator-like adapter for <tt>bitset</tt>,
! but gives implementers greater freedom on the details. E.g. begin/end return
! some type that simply invokes <tt>operator[]</tt> on the object it wraps, and
! increments its index on <tt>operator++</tt>.  A vendor can settle for <tt>InputIterator</tt>
! support, rather than wrapping up a full <tt>RandomAccessIterator</tt>.
! </p>
! <p>
! I have a mild preference for option (ii) as I think it is less work to
! specify at this stage of the process, although (i) is probably more useful
! in the long run.
  </p>
+ <p>
+ Hmm, my wording looks a little woolly, as it does not say what the element
+ type of the range is.  Do I get a range of <tt>bool</tt>, <tt>bitset&lt;N&gt;::reference</tt>, or
+ something else entirely?
+ </p>
+ <p>
+ I guess most users will assume the behaviour of reference, but expect to
+ work with <tt>bool</tt>.  <tt>Bool</tt> is OK for read-only traversal, but you really need to
+ take a reference to a <tt>bitset::reference</tt> if you want to write back.
+ </p>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote><p>
+ Move to Open.
+ We further recommend this be deferred until after the next Committee Draft.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-05-25 Alisdair adds:
+ ]</i></p>
+ 
  
  <blockquote>
! <p>
! I just stumbled over the <tt>Range concept_map</tt> for <tt>valarray</tt> and this should
! probably set the precedent on how to write the wording.
! </p>
! 
! <p><i>[
! Howard: I've replaced the proposed wording with Alisdair's suggestion.
! ]</i></p>
! 
  
  </blockquote>
  
+ <p><i>[
+ 2009-07-24 Daniel modifies the proposed wording for non-concepts.
+ ]</i></p>
  
  
! <p><i>[
! 2009-10 post-Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! Mark as Tentatively NAD Future due to the loss of concepts.
! </p></blockquote>
! 
  
+ 
+ <p><b>Rationale:</b></p>
  <p>
! All concepts-related text has been removed from the draft.
  </p>
  
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li>
+ <p>
+ Modify the section 20.6 [template.bitset] <tt>&lt;bitset&gt;</tt> synopsis by adding
+ the following at the end of the synopsis:
+ </p>
+ <blockquote><pre>
+ <ins>
+ // XX.X.X bitset range access [bitset.range]
+ template&lt;size_t N&gt; <i>unspecified-1</i> begin(bitset&lt;N&gt;&amp;);
+ template&lt;size_t N&gt; <i>unspecified-2</i> begin(const bitset&lt;N&gt;&amp;);
+ template&lt;size_t N&gt; <i>unspecified-1</i> end(bitset&lt;N&gt;&amp;);
+ template&lt;size_t N&gt; <i>unspecified-2</i> end(const bitset&lt;N&gt;&amp;);
+ </ins>
+ </pre></blockquote>
+ </li>
+ <li>
+ <p>
+ Add a new section <ins>"bitset range access" [bitset.range]</ins>
+ after the current section 20.6.4 [bitset.operators] with the following series of
+ paragraphs:
+ </p>
  <blockquote>
  <p>
! <ins>
! 1.  In the <tt>begin</tt> and <tt>end</tt> function templates that follow, <i>unspecified-1</i>
! is a type that meets the requirements of a mutable random access
! iterator (24.2.7 [random.access.iterators]) whose <tt>value_type</tt> is <tt>bool</tt> and
! whose reference type is <tt>bitset&lt;N&gt;::reference</tt>.
! <i>unspecified-2</i> is a type that meets the requirements of a constant
! random access iterator (24.2.7 [random.access.iterators]) whose <tt>value_type</tt>
! is <tt>bool</tt> and whose reference type is <tt>bool</tt>.
! </ins>
  </p>
! <pre>
! <ins>
! template&lt;size_t N&gt; <i>unspecified-1</i> begin(bitset&lt;N&gt;&amp;);
! template&lt;size_t N&gt; <i>unspecified-2</i> begin(const bitset&lt;N&gt;&amp;);
! </ins>
! </pre>
! <blockquote><p>
! <ins>2.  Returns: an iterator referencing the first bit in the bitset.</ins>
! </p></blockquote>
! 
! <pre><ins>
! template&lt;size_t N&gt; <i>unspecified-1</i> end(bitset&lt;N&gt;&amp;);
! template&lt;size_t N&gt; <i>unspecified-2</i> end(const bitset&lt;N&gt;&amp;);
! </ins></pre>
! 
! <blockquote><p>
! <ins>3.  Returns: an iterator referencing one past the last bit in the
! bitset.</ins>
! </p></blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
  
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1120"></a>1120. New type trait - remove_all</h3>
+ <p><b>Section:</b> 20.10 [meta] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! Sometimes it is necessary to remove all qualifiers from a type before
! passing on to a further API.  A good example would be calling the
! <tt>tuple</tt> query APIs <tt>tuple_size</tt> or <tt>tuple_element</tt>
! with a deduced type inside a function template.  If the deduced type is
! cv-qualified or a reference then the call will fail.  The solution is to
! chain calls to
! <tt>remove_cv&lt;remove_reference&lt;T&gt;::type&gt;::type</tt>, and
! note that the order matters.
! </p>
! <p>
! Suggest it would be helpful to add a new type trait,
! <tt>remove_all</tt>, that removes all top-level qualifiers from a type
! i.e. cv-qualification and any references.  Define the term in such a way
! that if additional qualifiers are added to the language, then
! <tt>remove_all</tt> is defined as stripping those as well.
  </p>
  
! <p><i>[
! 2009-10-14 Daniel adds:
! ]</i></p>
! 
! 
! <blockquote><p>
! <tt>remove_all</tt> seems too generic, a possible alternative matching
! the current naming style could be <tt>remove_cv_reference</tt> or
! <tt>remove_reference_cv</tt>. It should also be considered whether this
! trait should also remove 'extents', or pointer 'decorations'. Especially
! if the latter situations are considered as well, it might be easier to
! chose the name not in terms of what it <em>removes</em> (which might be
! a lot), but in terms of it <em>creates</em>. In this case I could think
! of e.g. <tt>extract_value_type</tt>.
! </p></blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! NAD Future.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1121"></a>1121. Support for multiple arguments</h3>
! <p><b>Section:</b> 20.11.4 [ratio.arithmetic] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ratio.arithmetic">issues</a> in [ratio.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Both add and multiply could sensibly be called with more than two arguments.
! The variadic template facility makes such declarations simple, and is likely
! to be frequently wrapped by end users if we do not supply the variant
! ourselves.
! </p>
! <p>
! We deliberately ignore divide at this point as it is not transitive.
! Likewise, subtract places special meaning on the first argument so I do not
! suggest extending that immediately.  Both could be supported with analogous
! wording to that for add/multiply below.
! </p>
! <p>
! Note that the proposed resolution is potentially incompatible with that
! proposed for <a href="lwg-defects.html#921">921</a>, although the addition of the typedef to ratio would be
! equally useful.
! </p>
! 
! <p><i>[
! 2009-10-30 Alisdair adds:
! ]</i></p>
  
  
  <blockquote>
  <p>
! The consensus of the group when we reviewed this in Santa Cruz was that
! <a href="lwg-defects.html#921">921</a> would proceed to Ready as planned, and the
! multi-paramater add/multiply templates should be renamed as
! <tt>ratio_sum</tt> and <tt>ratio_product</tt> to avoid the problem
! mixing template aliases with partial specializations.
  </p>
  
  <p>
! It was also suggested to close this issue as NAD Future as it does not
! correspond directly to any NB comment.  NBs are free to submit a
! specific comment (and re-open) in CD2 though.
! </p>
! 
! <p>
! Walter Brown also had concerns on better directing the order of
! evaluation to avoid overflows if we do proceed for 0x rather than TR1,
! so wording may not be complete yet.
! </p>
! 
! <p><i>[
! Alisdair updates wording.
! ]</i></p>
! 
  
  </blockquote>
  
+ <p><i>[
+ 2009-10-30 Howard:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to Tentatively NAD Future after 5 positive votes on c++std-lib.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
  <p>
! Does not have sufficient support at this time. May wish to reconsider for a
! future standard.
  </p>
  
! 
! <p><b>Proposed resolution:</b></p>
  
  <p>
! Add the following type traits to p3 20.11 [ratio]
  </p>
  
! <blockquote><pre>
! // ratio arithmetic
! template &lt;class R1, class R2&gt; struct ratio_add;
! template &lt;class R1, class R2&gt; struct ratio_subtract;
! template &lt;class R1, class R2&gt; struct ratio_multiply;
! template &lt;class R1, class R2&gt; struct ratio_divide;
! <ins>template &lt;class R1, class ... RList&gt; struct ratio_sum;</ins>
! <ins>template &lt;class R1, class ... RList&gt; struct ratio_product;</ins>
! </pre></blockquote>
  
  <p>
! after 20.11.4 [ratio.arithmetic] p1: add
  </p>
  
! <blockquote><pre>
! template &lt;class R1, class ... RList&gt; struct ratio_sum; // declared, never defined
! 
! template &lt;class R1&gt; struct ratio_sum&lt;R1&gt; : R1 {};
! </pre>
! 
! <blockquote><p>
! <i>Requires:</i> <tt>R1</tt> is a specialization of class template <tt>ratio</tt>
! </p></blockquote>
! 
! <pre>
! template &lt;class R1, class R2, class ... RList&gt; 
!  struct ratio_sum&lt;R1, R2, RList...&gt;
!    : ratio_add&lt; R1, ratio_sum&lt;R2, RList...&gt;&gt; {
! };
! </pre>
! 
! <blockquote><p>
! <i>Requires:</i> <tt>R1</tt> and each element in parmater pack
! <tt>RList</tt> is a specialization of class template <tt>ratio</tt>
! </p></blockquote>
  </blockquote>
  
  <p>
! after 20.11.4 [ratio.arithmetic] p3: add
  </p>
  
! <blockquote><pre>
! template &lt;class R1, class ... RList&gt; struct ratio_product; // declared, never defined
! 
! template &lt;class R1&gt; struct ratio_product&lt;R1&gt; : R1 {};
! </pre>
! 
! <blockquote><p>
! <i>Requires:</i> <tt>R1</tt> is a specialization of class template <tt>ratio</tt>
! </p></blockquote>
! 
! <pre>
! template &lt;class R1, class R2, class ... RList&gt; 
!  struct ratio_sum&lt;R1, R2, RList...&gt;
!    : ratio_add&lt; R1, ratio_product&lt;R2, RList...&gt;&gt; {
! };
! </pre>
! 
! <blockquote><p>
! <i>Requires:</i> <tt>R1</tt> and each element in parmater pack
! <tt>RList</tt> is a specialization of class template <tt>ratio</tt>
! </p></blockquote>
  </blockquote>
  
  
*************** exception is thrown by the move construc
*** 1907,1922 ****
  
  
  
  <hr>
  <h3><a name="1169"></a>1169. <tt>num_get</tt> not fully compatible with <tt>strto*</tt></h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Cosmin Truta <b>Opened:</b> 2009-07-04 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As specified in the latest draft,
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>,
  <code>num_get</code> is still not fully compatible with the following C
  functions: <code>strtoul</code>, <code>strtoull</code>, 
  <code>strtof</code> and
--- 3740,3859 ----
  
  
  
+ 
+ 
+ <hr>
+ <h3><a name="1150"></a>1150. wchar_t, char16_t and char32_t filenames</h3>
+ <p><b>Section:</b> 27.9.1.14 [fstream] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses JP 73</b></p>
+ 
+    <p><b>Description</b></p>
+         <p>It is a problem
+         from C++98, <tt>fstream</tt> cannot appoint a filename of wide
+         character string(<tt>const wchar_t</tt> and <tt>const wstring&amp;</tt>).</p>
+ <p><b>Suggestion</b></p>
+         <p>Add
+         interface corresponding to <tt>wchar_t</tt>, <tt>char16_t</tt> and <tt>char32_t</tt>.</p>
+ 
+ <p><i>[
+ 2009-07-01 Alisdair notes that this is a duplicate of <a href="lwg-closed.html#454">454</a> which has more
+ in-depth rationale.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-09-21 Daniel adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ I suggest to mark this issue as NAD Future with the intend to
+ solve the issue with a single file path c'tor template assuming
+ a provision of a TR2 filesystem library.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ NAD Future.  This is a duplicate of <a href="lwg-closed.html#454">454</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1154"></a>1154. <tt>complex</tt> should accept integral types</h3>
+ <p><b>Section:</b> 26.4 [complex.numbers] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#complex.numbers">active issues</a> in [complex.numbers].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#complex.numbers">issues</a> in [complex.numbers].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses FR 35</b></p>
+ 
+ <p><b>Description</b></p>
+         <p>Instantiations of the class
+         template <tt>complex&lt;&gt;</tt> have to be allowed for integral
+         types, to reflect existing practice and ISO standards
+         (LIA-III).</p>
+         
+ <p><b>Suggestion</b></p>
+ 
+ <p><i>[
+ 2009-10-26 Proposed wording in
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3002.pdf">N3002</a>.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to NAD Future.  Rationale added.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ There is no consensus for making this change at this time.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p><p>
+ Adopt
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3002.pdf">N3002</a>.
+ </p>
+ 
+ 
+ 
+ 
  <hr>
  <h3><a name="1169"></a>1169. <tt>num_get</tt> not fully compatible with <tt>strto*</tt></h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Cosmin Truta <b>Opened:</b> 2009-07-04 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As specified in the latest draft,
! <a 
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>,
  <code>num_get</code> is still not fully compatible with the following C
  functions: <code>strtoul</code>, <code>strtoull</code>, 
  <code>strtof</code> and
*************** issue.
*** 1938,1952 ****
  Moreover, in C, when conversion of a string to a floating-point type falls
  outside the representable range, <code>strtof</code>, <code>strtod</code> 
  and
! <code>strtold</code> return <code>±HUGE_VALF</code>,
! <code>±HUGE_VAL</code> and <code>±HUGE_VALL</code>, respectively.
  On the other hand, the result of <code>num_get</code> conversion of such
  out-of-range floating-point values results in the most positive/negative
  representable value.
  Although many C library implementations do implement <code>HUGE_VAL</code>
  (etc.) as the highest representable (which is, usually, the infinity), 
! this
! isn't required by the C standard. The C library specification makes no
  statement regarding the value of <code>HUGE_VAL</code> and friends, which
  potentially raises the same compatibility issue as in the above case of
  unsigned integers.
--- 3875,3888 ----
  Moreover, in C, when conversion of a string to a floating-point type falls
  outside the representable range, <code>strtof</code>, <code>strtod</code> 
  and
! <code>strtold</code> return <code>&plusmn;HUGE_VALF</code>,
! <code>&plusmn;HUGE_VAL</code> and <code>&plusmn;HUGE_VALL</code>, respectively.
  On the other hand, the result of <code>num_get</code> conversion of such
  out-of-range floating-point values results in the most positive/negative
  representable value.
  Although many C library implementations do implement <code>HUGE_VAL</code>
  (etc.) as the highest representable (which is, usually, the infinity), 
! this isn't required by the C standard. The C library specification makes no
  statement regarding the value of <code>HUGE_VAL</code> and friends, which
  potentially raises the same compatibility issue as in the above case of
  unsigned integers.
*************** closely follow the behavior of all of it
*** 1969,2004 ****
  ]</i></p>
  
  
! <blockquote>
! Some concern that this is changing the specification for an existing C++03 function, but it was pointed out that this was underspecified as resolved by issue 23.  This is clean-up for that issue in turn.
! 
! Some concern that we are trying to solve the same problem in both clause 22 and 27.
! 
  Bill: There's a change here as to whether val is stored to in an error case.
! 
  Pablo: Don't think this changes whether val is stored to or not, but changes the value that is stored.
! 
  Bill: Remembers having skirmishes with customers and testers as to whether val is stored to, and the resolution was not to store in error cases.
! 
  Howard: Believes since C++03 we made a change to always store in overflow.
! 
  Everyone took some time to review the issue.
! 
  Pablo: C++98 definitely did not store any value during an error condition.
! 
  Dietmar: Depends on the question of what is considered an error, and whether overflow is an error or not, which was the crux of LWG 23.
! 
  Pablo: Yes, but given the "zero, if the conversion function fails to convert the entire field", we are requiring every error condition to store.
! 
  Bill: When did this happen?
! 
  Alisdair: One of the last two or three meetings.
! 
  Dietmar: To store a value in case of failure is a very bad idea.
! 
  Move to Open, needs more study.
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
--- 3905,3990 ----
  ]</i></p>
  
  
! <blockquote><p>
! Some concern that this is changing the specification for an existing C++03 function, but it was 
! pointed out that this was underspecified as resolved by issue 23.  This is clean-up for that 
! issue in turn. Some concern that we are trying to solve the same problem in both clause 22 and 27.
! </p>
! <p>
  Bill: There's a change here as to whether val is stored to in an error case.
! </p>
! <p>
  Pablo: Don't think this changes whether val is stored to or not, but changes the value that is stored.
! </p>
! <p>
  Bill: Remembers having skirmishes with customers and testers as to whether val is stored to, and the resolution was not to store in error cases.
! </p>
! <p>
  Howard: Believes since C++03 we made a change to always store in overflow.
! </p>
! <p>
  Everyone took some time to review the issue.
! </p>
! <p>
  Pablo: C++98 definitely did not store any value during an error condition.
! </p>
! <p>
  Dietmar: Depends on the question of what is considered an error, and whether overflow is an error or not, which was the crux of LWG 23.
! </p>
! <p>
  Pablo: Yes, but given the "zero, if the conversion function fails to convert the entire field", we are requiring every error condition to store.
! </p>
! <p>
  Bill: When did this happen?
! </p>
! <p>
  Alisdair: One of the last two or three meetings.
! </p>
! <p>
  Dietmar: To store a value in case of failure is a very bad idea.
! </p>
! <p>
  Move to Open, needs more study.
+ </p>
  </blockquote>
  
+ <p><i>[2011-03-24 Madrid meeting]</i></p>
+ 
+ 
+ <p>Move to deferred</p>
+ 
+ <p><i>[
+ 2011 Bloomington
+ ]</i></p>
+ 
+ 
+ <p>
+ The proposed wording looks good, no-one sure why this was held back before.  Move to Review.
+ </p>
+ 
+ 
+ <p><i>[2012,Kona]</i></p>
+ 
+ <p>
+ Move to Open.
+ </p>
+ <p>
+ THe issues is what to do with <tt>-1</tt>.  Should it match 'C' or do the "sane" thing.
+ A fix here changes behavior, but is probably what we want.
+ </p>
+ <p>
+ Pablo to provide wording, with help from Howard.
+ </p>
+ 
+ <p><i>[2015-05-06 Lenexa: Move to Ready]</i></p>
+ 
+ <p>STL: I like that this uses strtof, which I think is new in C99. that avoids truncation from using atof. I have another issue ...</p>
+ <p>MC: yes LWG 2403 (stof should call strtof)</p>
+ <p>PJP: the last line is horrible, you don't assign to err, you call setstate(ios_base::failbit). Ah, no, this is inside num_get so the caller does the setstate.</p>
+ <p>MC: we need all these words. are they the right words?</p>
+ <p>JW: I'd like to take a minute to check my impl. Technically this implies a change in behaviour (from always using strtold and checking the extracted floating point value, to using the right function). Oh, we already do exactly this.</p>
+ <p>MC: Move to Ready</p>
+ <p>6 in favor, none opposed, 1 abstention</p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** field represents a value outside the ran
*** 2057,2068 ****
  
  
  <hr>
  <h3><a name="1175"></a>1175. <tt>unordered</tt> complexity</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-07-17 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  When I look at the <tt>unordered_*</tt> constructors, I think the complexity is poorly
--- 4043,4123 ----
  
  
  <hr>
+ <h3><a name="1173"></a>1173. "Equivalence" wishy-washiness</h3>
+ <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-07-14 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Issue: The <tt>CopyConstructible</tt> requirements are wishy-washy.  It requires
+ that the copy is "equivalent" to the original, but "equivalent" is never
+ defined.
+ </p>
+ <p>
+ I believe this to be an example of a more general lack of rigor around
+ copy and assignment, although I haven't done the research to dig up all
+ the instances.
+ </p>
+ <p>
+ It's a problem because if you don't know what <tt>CopyConstructible</tt> means,
+ you also don't know what it means to copy a pair of <tt>CopyConstructible</tt>
+ types.  It doesn't prevent us from writing code, but it is a hole in our
+ ability to understand the meaning of copy.
+ </p>
+ <p>
+ Furthermore, I'm pretty sure that vector's copy constructor doesn't
+ require the elements to be <tt>EqualityComparable</tt>, so that table is actually
+ referring to some ill-defined notion of equivalence when it uses ==.
+ </p>
+ 
+ <p><i>[
+ 2009 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to "Open". Dave is right that this is a big issue. Paper D2987
+ ("Defining Move Special Member Functions", Bjarne Stroustrup and
+ Lawrence Crowl) touches on this but does not solve it. This issue is
+ discussed in Elements of Programming.
+ </p></blockquote>
+ 
+ 
+ <p><i>[
+ 2010 Rapperswil:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ This issue is quite vague, so it is difficult to know if and when it has been resolved.
+ John Lakos wrote a paper covering this area a while back, and there is a real interest 
+ in providing some sort of clean-up in the future. We need a more clearly draughted 
+ issues with an addressable set of concerns, ideally with a paper proposing a resolution, 
+ but for a future revision of the standard. Move to Tentatively NAD Future.
+ </p></blockquote>
+ 
+ <p><i>[
+ Moved to NAD Future at 2010-11 Batavia
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1175"></a>1175. <tt>unordered</tt> complexity</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-07-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  When I look at the <tt>unordered_*</tt> constructors, I think the complexity is poorly
*************** described and does not follow the style
*** 2071,2077 ****
  
  <p>
  The complexity for the default constructor is specified as constant.
!  Actually, it is proportional to <tt>n</tt>, but there are no invocations of
  <tt>value_type</tt> constructors or other <tt>value_type</tt> operations.
  </p>
  
--- 4126,4132 ----
  
  <p>
  The complexity for the default constructor is specified as constant.
! Actually, it is proportional to <tt>n</tt>, but there are no invocations of
  <tt>value_type</tt> constructors or other <tt>value_type</tt> operations.
  </p>
  
*************** The complexity for the default construct
*** 2079,2091 ****
  For the iterator-based constructor the complexity should be:
  </p>
  
! <blockquote>
  <i>Complexity:</i> exactly <tt>n</tt> calls to construct <tt>value_type</tt>
  from <tt>InputIterator::value_type</tt> (where <tt>n = distance(f,l)</tt>).
  The number of calls to <tt>key_equal::operator()</tt> is proportional to
  <tt>n</tt> in the average case and <tt>n*n</tt> in the worst case.
  </blockquote>
  
  
  
  <p><i>[
--- 4134,4626 ----
  For the iterator-based constructor the complexity should be:
  </p>
  
! <blockquote><p>
  <i>Complexity:</i> exactly <tt>n</tt> calls to construct <tt>value_type</tt>
  from <tt>InputIterator::value_type</tt> (where <tt>n = distance(f,l)</tt>).
  The number of calls to <tt>key_equal::operator()</tt> is proportional to
  <tt>n</tt> in the average case and <tt>n*n</tt> in the worst case.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Rapperswil:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Concern that the current wording may require O(1) where that cannot be delivered.  We need to look at 
+ both the clause 23 requirements tables and the constructor description of each unordered container to be sure.
+ </p>
+ <p>
+ Howard suggests NAD Editorial as we updated the container requirement tables since this issue was written.
+ </p>
+ <p>
+ Daniel offers to look deeper, and hopefully produce wording addressing any outstanding concerns at the next meeting.
+ </p>
+ <p>
+ Move to Open.
+ </p>
  </blockquote>
  
+ <p><i>[2011-02-26: Daniel provides wording]</i></p>
+ 
+ 
+ <p>I strongly suggest to clean-up the differences between requirement tables and individual
+ specifications. In the usual way, the most specific specifications wins, which is in this
+ case the wrong one. In regard to the concern expressed about missing <tt>DefaultConstructible</tt>
+ requirements of the value type I disagree: The function argument <tt>n</tt> is no size-control
+ parameter, but only some effective capacity parameter: No elements will be value-initialized
+ by these constructors. The necessary requirement for the value type, <tt>EmplaceConstructible</tt>
+ into <tt>*this</tt>, is already listed in Table 103 &mdash; Unordered associative container requirements.
+ Another part of the proposed resolution is the fact that there is an inconsistency of the
+ complexity counting when both a range <strong>and</strong> a bucket count is involved compared
+ to constructions where only bucket counts are provided: E.g. the construction <tt>X a(n);</tt>
+ has a complexity of <tt>n</tt> bucket allocations, but this part of the work is omitted for
+ <tt>X a(i, j, n);</tt>, even though it is considerable larger (in the average case) for 
+ <tt>n &#8811; distance(i, j)</tt>.
+ </p>
+ 
+ <p><i>[2011-03-24 Madrid meeting]</i></p>
+ 
+ 
+ <p>Move to deferred</p>
+ 
+ <p><i>[
+ 2011 Bloomington
+ ]</i></p>
+ 
+ 
+ <p>
+ The proposed wording looks good.  Move to Review.
+ </p>
+ 
+ <p><i>[2012, Kona]</i></p>
+ 
+ <p>
+ Fix up some presentation issues with the wording, combining the big-O expressions into single
+ expressions rather than the sum of two separate big-Os.
+ </p>
+ <p>
+ Strike "constant or linear", prefer "linear in the number of buckets".
+ This allows for number of buckets being larger than requested <tt>n</tt> as well.
+ </p>
+ <p>
+ Default <tt>n</tt> to "unspecified" rather than "implementation-defined".  It seems an un-necessary
+ burden asking vendors to document a quantity that is easily determined through the public API of
+ these classes.
+ </p>
+ <p>
+ Replace <tt>distance(f,l)</tt> with "number of elements in the range <tt>[f,l)</tt>"
+ </p>
+ <p>
+ Retain in Review with the updated wording
+ </p>
+ 
+ <p><i>[2012, Portland: Move to Open]</i></p>
+ 
+ <p>
+ The wording still does not call out Pablo's original concern, that the element constructor is called
+ no more than <tt>N</tt> times, and that the <tt>N</tt> squared term applies to moves during rehash.
+ </p>
+ 
+ <p>
+ Inconsistent use of O(n)+O(N) vs. O(n+N), with a preference for the former.
+ </p>
+ 
+ <p>
+ AJM to update wording with a reference to "no more than <tt>N</tt> element constructor calls".
+ </p>
+ 
+ <p>
+ Matt concerned that calling out the O(n) requirements is noise, and dangerous noise in suggesting a precision
+ we do not mean.  The cost of constructing a bucket is very different to constructing an element of user-supplied
+ type.
+ </p>
+ 
+ <p>
+ AJM notes that if there are multiple rehashes, the 'n' complexity is probably not linear.
+ </p>
+ 
+ <p>
+ Matt suggests back to Open, Pablo suggests potentially NAD if we keep revisitting without achieving a resolution.
+ </p>
+ 
+ <p>
+ Matt suggests complexity we are concerned with is the number of operations, such as constructing elements, moving
+ nodes, and comparing/hashing keys.  We are less concerned with constructing buckets, which are generally noise in
+ this bigger picture.
+ </p>
+ 
+ <p><i>[2015-01-29 Telecon]</i></p>
+ 
+ <p>
+ AM: essentially correct, but do we want to complicate the spec?
+ <p/>
+ HH: Pablo has given us permission to NAD it
+ <p/>
+ JM: when I look at the first change in the P/R I find it mildly disturbing that the existing wording says you have a 
+ constant time constructor with a single element even if your <tt>n</tt> is 10^6, so I think adding this change makes people 
+ aware there might be a large cost in initializing the hash table, even though it doesn't show up in user-visible constructions.
+ <p/>
+ HH: one way to avoid that problem is make the default ctor <tt>noexcept</tt>. Then the container isn't allowed to create 
+ an arbitrarily large hash table
+ <p/>
+ AM: but this is the constructor where the user provides <tt>n</tt>
+ <p/>
+ MC: happy with the changes, except I agree with the editorial recommendation to keep the two &#x1d4aa;s separate.
+ <p/>
+ JW: yes, the constant '<tt>k</tt>' is different in &#x1d4aa;(n) and &#x1d4aa;(N)
+ <p/>
+ GR: do we want to talk about buckets at all
+ <p/>
+ JM: yes, good to highlight that bucket construction might be a significant cost
+ <p/>
+ HH: suggest we take the suggestion to split &#x1d4aa;(n+N) to &#x1d4aa;(n)+&#x1d4aa;(N) and move to Tentatively Ready
+ <p/>
+ GR: 23.2.1p2 says all complexity requirements are stated solely in terms of the number of operations on the contained 
+ object, so we shouldn't be stating complexity in terms of the hash table initialization
+ <p/>
+ HH: channeling Pete, there's an implicit "unless otherwise specified" everywhere.
+ <p/>
+ VV: seem to be requesting modifications that render this not Tentatively Ready
+ <p/>
+ GR: I think it can't be T/R
+ <p/>
+ AM: make the editorial recommendation, consider fixing 23.2.1/3 to give us permission to state complexity in terms 
+ of bucket initialization
+ <p/>
+ HH: only set it to Review after we get new wording to review 
+ </p>
+ 
+ <p><i>[2015-02 Cologne]</i></p>
+ 
+ <p>
+ Update wording, revisit later.
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li><p>Modify the following rows in Table 103 &mdash; Unordered associative container requirements to
+ add the explicit bucket allocation overhead of some constructions. As editorial recommendation it is 
+ suggested <em>not</em> to shorten the sum <tt>&#x1d4aa;(n) + &#x1d4aa;(<em>N</em>)</tt> to
+ <tt>&#x1d4aa;(n + <em>N</em>)</tt>, because two different work units are involved.</p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 103 &mdash; Unordered associative container requirements (in addition to container)</caption>
+ 
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Assertion&#47;note pre-&#47;post-condition</th>
+ <th>Complexity</th>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" style="text-align:center;">&hellip;</td>
+ </tr>
+ 
+ <tr>
+ <td><tt>X(i, j, n, hf, eq)</tt><br/>
+ <tt>X a(i, j, n, hf, eq)</tt>
+ </td>
+ <td><tt>X</tt></td>
+ <td>&hellip;<br/>
+ <i>Effects</i>: Constructs an empty container with at least <tt>n</tt><br/>
+ buckets, using <tt>hf</tt> as the hash function and <tt>eq</tt> as the key<br/>
+ equality predicate, and inserts elements from <tt>[i, j)</tt> into it.
+ </td>
+ <td>Average case &#x1d4aa;(<tt><i><ins>n + </ins>N</i></tt>) (<tt><i>N</i></tt> is <tt>distance(i, j)</tt>),<br/>
+ worst case <ins>&#x1d4aa;(<tt>n</tt>) +</ins> &#x1d4aa;(<tt><i>N</i><sup>2</sup></tt>)</td>
+ </tr>
+ 
+ <tr>
+ <td><tt>X(i, j, n, hf)</tt><br/>
+ <tt>X a(i, j, n, hf)</tt>
+ </td>
+ <td><tt>X</tt></td>
+ <td>&hellip;<br/>
+ <i>Effects</i>: Constructs an empty container with at least <tt>n</tt><br/>
+ buckets, using <tt>hf</tt> as the hash function and <tt>key_equal()</tt> as the key<br/>
+ equality predicate, and inserts elements from <tt>[i, j)</tt> into it.
+ </td>
+ <td>Average case &#x1d4aa;(<tt><i><ins>n + </ins>N</i></tt>) (<tt><i>N</i></tt> is <tt>distance(i, j)</tt>),<br/>
+ worst case &#x1d4aa;(<tt><i><ins>n + </ins>N</i><sup>2</sup></tt>)</td>
+ </tr>
+ 
+ <tr>
+ <td><tt>X(i, j, n)</tt><br/>
+ <tt>X a(i, j, n)</tt>
+ </td>
+ <td><tt>X</tt></td>
+ <td>&hellip;<br/>
+ <i>Effects</i>: Constructs an empty container with at least <tt>n</tt><br/>
+ buckets, using <tt>hasher()</tt> as the hash function and <tt>key_equal()</tt> as the key<br/>
+ equality predicate, and inserts elements from <tt>[i, j)</tt> into it.
+ </td>
+ <td>Average case &#x1d4aa;(<tt><i><ins>n + </ins>N</i></tt>) (<tt><i>N</i></tt> is <tt>distance(i, j)</tt>),<br/>
+ worst case &#x1d4aa;(<tt><i><ins>n + </ins>N</i><sup>2</sup></tt>)</td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" style="text-align:center;">&hellip;</td>
+ </tr>
+ 
+ </table>
+ </blockquote>
+ 
+ </li>
+ 
+ <li><p>Modify 23.5.4.2 [unord.map.cnstr] p. 1-4 as indicated (The edits of p. 1 and p. 3 attempt to fix some
+ editorial oversight.):</p>
+ 
+ <blockquote><pre>
+ explicit unordered_map(size_type n = <i>see below</i>,
+                        const hasher&amp; hf = hasher(),
+                        const key_equal&amp; eql = key_equal(),
+                        const allocator_type&amp; a = allocator_type());
+ </pre><blockquote><p>
+ 1 <i>Effects</i>: Constructs an empty <tt>unordered_map</tt> using the specified hash function, key equality function,
+ and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is 
+ <ins>unspecified</ins><del>impldefdefault number of buckets in <tt>unordered_map</tt></del>. 
+ <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
+ </p></blockquote>
+ <blockquote><p>
+ 2 <i>Complexity</i>: <del>Constant</del><ins>Linear in the number of buckets</ins>.
+ </p></blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ template &lt;class InputIterator&gt;
+ unordered_map(InputIterator f, InputIterator l,
+               size_type n = <i>see below</i>,
+               const hasher&amp; hf = hasher(),
+               const key_equal&amp; eql = key_equal(),
+               const allocator_type&amp; a = allocator_type());
+ </pre><blockquote><p>
+ 3 <i>Effects</i>: Constructs an empty <tt>unordered_map</tt> using the specified hash function, key equality function,
+ and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is 
+ <ins>unspecified</ins><del>impldefdefault number of buckets in <tt>unordered_map</tt></del>.
+ Then inserts elements from the range <tt>[f, l)</tt>. <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
+ </p></blockquote>
+ <blockquote><p>
+ 4 <i>Complexity</i>: <del>Average case linear, worst case quadratic</del><ins>Linear in the number of buckets.
+ In the average case linear in <tt><i>N</i></tt> and in the worst case quadratic in <tt><i>N</i></tt> to insert
+ the elements, where <tt><i>N</i></tt> is equal to number of elements in the range <tt>[f,l)</tt></ins>.
+ </p></blockquote>
+ </blockquote>
+ </li>
+ 
+ <li><p>Modify 23.5.5.2 [unord.multimap.cnstr] p. 1-4 as indicated (The edits of p. 1 and p. 3 attempt to fix some
+ editorial oversight.):</p>
+ 
+ <blockquote><pre>
+ explicit unordered_multimap(size_type n = <i>see below</i>,
+                             const hasher&amp; hf = hasher(),
+                             const key_equal&amp; eql = key_equal(),
+                             const allocator_type&amp; a = allocator_type());
+ </pre><blockquote><p>
+ 1 <i>Effects</i>: Constructs an empty <tt>unordered_multimap</tt> using the specified hash function, key equality function,
+ and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is 
+ <ins>unspecified</ins><del>impldefdefault number of buckets in <tt>unordered_multimap</tt></del>. 
+ <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
+ </p></blockquote>
+ <blockquote><p>
+ 2 <i>Complexity</i>: <del>Constant</del><ins>Linear in the number of buckets</ins>.
+ </p></blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ template &lt;class InputIterator&gt;
+ unordered_multimap(InputIterator f, InputIterator l,
+                    size_type n = <i>see below</i>,
+                    const hasher&amp; hf = hasher(),
+                    const key_equal&amp; eql = key_equal(),
+                    const allocator_type&amp; a = allocator_type());
+ </pre><blockquote><p>
+ 3 <i>Effects</i>: Constructs an empty <tt>unordered_multimap</tt> using the specified hash function, key equality function,
+ and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is 
+ <ins>unspecified</ins><del>impldefdefault number of buckets in <tt>unordered_multimap</tt></del>.
+ Then inserts elements from the range <tt>[f, l)</tt>. <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
+ </p></blockquote>
+ <blockquote><p>
+ 4 <i>Complexity</i>: <del>Average case linear, worst case quadratic</del><ins>Linear in the number of buckets.
+ In the average case linear in <tt><i>N</i></tt> and in the worst case quadratic in <tt><i>N</i></tt> to insert
+ the elements, where <tt><i>N</i></tt> is equal to number of elements in the range <tt>[f,l)</tt></ins>.
+ </p></blockquote>
+ </blockquote>
+ </li>
+ 
+ <li><p>Modify 23.5.6.2 [unord.set.cnstr] p. 1-4 as indicated (The edits of p. 1 and p. 3 attempt to fix some
+ editorial oversight.):</p>
+ 
+ <blockquote><pre>
+ explicit unordered_set(size_type n = <i>see below</i>,
+                        const hasher&amp; hf = hasher(),
+                        const key_equal&amp; eql = key_equal(),
+                        const allocator_type&amp; a = allocator_type());
+ </pre><blockquote><p>
+ 1 <i>Effects</i>: Constructs an empty <tt>unordered_set</tt> using the specified hash function, key equality function,
+ and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is 
+ <ins>unspecified</ins><del>impldefdefault number of buckets in <tt>unordered_set</tt></del>. 
+ <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
+ </p></blockquote>
+ <blockquote><p>
+ 2 <i>Complexity</i>: <del>Constant</del><ins>Linear in the number of buckets</ins>.
+ </p></blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ template &lt;class InputIterator&gt;
+ unordered_set(InputIterator f, InputIterator l,
+               size_type n = <i>see below</i>,
+               const hasher&amp; hf = hasher(),
+               const key_equal&amp; eql = key_equal(),
+               const allocator_type&amp; a = allocator_type());
+ </pre><blockquote><p>
+ 3 <i>Effects</i>: Constructs an empty <tt>unordered_set</tt> using the specified hash function, key equality function,
+ and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is 
+ <ins>unspecified</ins><del>impldefdefault number of buckets in <tt>unordered_set</tt></del>.
+ Then inserts elements from the range <tt>[f, l)</tt>. <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
+ </p></blockquote>
+ <blockquote><p>
+ 4 <i>Complexity</i>: <del>Average case linear, worst case quadratic</del><ins>Linear in the number of buckets.
+ In the average case linear in <tt><i>N</i></tt> and in the worst case quadratic in <tt><i>N</i></tt> to insert
+ the elements, where <tt><i>N</i></tt> is equal to number of elements in the range <tt>[f,l)</tt></ins>.
+ </p></blockquote>
+ </blockquote>
+ </li>
+ 
+ <li><p>Modify 23.5.7.2 [unord.multiset.cnstr] p. 1-4 as indicated (The edits of p. 1 and p. 3 attempt to fix some
+ editorial oversight.):</p>
+ 
+ <blockquote><pre>
+ explicit unordered_multiset(size_type n = <i>see below</i>,
+                             const hasher&amp; hf = hasher(),
+                             const key_equal&amp; eql = key_equal(),
+                             const allocator_type&amp; a = allocator_type());
+ </pre><blockquote><p>
+ 1 <i>Effects</i>: Constructs an empty <tt>unordered_multiset</tt> using the specified hash function, key equality function,
+ and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is 
+ <ins>unspecified</ins><del>impldefdefault number of buckets in <tt>unordered_multiset</tt></del>. 
+ <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
+ </p></blockquote>
+ <blockquote><p>
+ 2 <i>Complexity</i>: <del>Constant</del><ins>Linear in the number of buckets</ins>.
+ </p></blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ template &lt;class InputIterator&gt;
+ unordered_multiset(InputIterator f, InputIterator l,
+                    size_type n = <i>see below</i>,
+                    const hasher&amp; hf = hasher(),
+                    const key_equal&amp; eql = key_equal(),
+                    const allocator_type&amp; a = allocator_type());
+ </pre><blockquote><p>
+ 3 <i>Effects</i>: Constructs an empty <tt>unordered_multiset</tt> using the specified hash function, key equality function,
+ and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is 
+ <ins>unspecified</ins><del>impldefdefault number of buckets in <tt>unordered_multiset</tt></del>.
+ Then inserts elements from the range <tt>[f, l)</tt>. <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
+ </p></blockquote>
+ <blockquote><p>
+ 4 <i>Complexity</i>: <del>Average case linear, worst case quadratic</del><ins>Linear in the number of buckets.
+ In the average case linear in <tt><i>N</i></tt> and in the worst case quadratic in <tt><i>N</i></tt> to insert
+ the elements, where <tt><i>N</i></tt> is equal to number of elements in the range <tt>[f,l)</tt></ins>.
+ </p></blockquote>
+ </blockquote>
+ </li>
+ 
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1184"></a>1184. Feature request: dynamic bitset</h3>
+ <p><b>Section:</b> 23.3.6 [vector] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-29 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#vector">issues</a> in [vector].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Opened at Alisdair's request, steming from <a href="lwg-closed.html#96">96</a>.
+ Alisdair recommends NAD Future.
+ </p>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ NAD Future.  We want a heap allocated bitset, but we don't have one today and
+ don't have time to add one.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1188"></a>1188. Unordered containers should have a minimum load factor as well as a maximum</h3>
+ <p><b>Section:</b> 23.2.5 [unord.req], 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2009-08-10 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Unordered associative containers have a notion of a maximum load factor:
+ when the number of elements grows large enough, the containers
+ automatically perform a rehash so that the number of elements per bucket
+ stays below a user-specified bound. This ensures that the hash table's
+ performance characteristics don't change dramatically as the size
+ increases.
+ </p>
+ 
+ <p>
+ For similar reasons, Google has found it useful to specify a minimum
+ load factor: when the number of elements shrinks by a large enough, the
+ containers automatically perform a rehash so that the number of elements
+ per bucket stays above a user-specified bound. This is useful for two
+ reasons. First, it prevents wasting a lot of memory when an unordered
+ associative container grows temporarily. Second, it prevents amortized
+ iteration time from being arbitrarily large; consider the case of a hash
+ table with a billion buckets and only one element. (This was discussed
+ even before TR1 was published; it was TR issue 6.13, which the LWG
+ closed as NAD on the grounds that it was a known design feature.
+ However, the LWG did not consider the approach of a minimum load
+ factor.)
+ </p>
+ 
+ <p>
+ The only interesting question is when shrinking is allowed. In principle
+ the cleanest solution would be shrinking on erase, just as we grow on
+ insert. However, that would be a usability problem; it would break a
+ number of common idioms involving erase. Instead, Google's hash tables
+ only shrink on insert and rehash.
+ </p>
+ 
+ <p>
+ The proposed resolution allows, but does not require, shrinking in
+ rehash, mostly because a postcondition for rehash that involves the
+ minimum load factor would be fairly complicated. (It would probably have
+ to involve a number of special cases and it would probably have to
+ mention yet another parameter, a minimum bucket count.)
+ </p>
+ 
+ <p>
+ The current behavior is equivalent to a minimum load factor of 0. If we
+ specify that 0 is the default, this change will have no impact on
+ backward compatibility.
+ </p>
  
  
  <p><i>[
*************** The number of calls to <tt>key_equal::op
*** 2093,2129 ****
  ]</i></p>
  
  
  <blockquote>
! Concern that the current wording may require O(1) where that cannot be delivered.  We need to look at both the clause 23 requirements tables and the constructor description of each unodered container to be sure.
  
! Howard suggests NAD Editorial as we updated the container requirement tables since this issue was written.
  
! Daniel offers to look deeper, and hopefully produce wording addressing any outstanding concerns at the next meeting.
  
! Move to Open.
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  </p>
  
  
  
  
  
  <hr>
  <h3><a name="1213"></a>1213. Meaning of valid and singular iterator underspecified</h3>
! <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Deferred">Deferred</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-09-19 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Deferred">Deferred</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The terms <em>valid</em> iterator and <em>singular</em> aren't
  properly defined. The fuzziness of those terms became even worse
! after the resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#208">208</a> (including further updates by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#278">278</a>). In
  24.2 [iterator.requirements] as of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
  the standard says now:
--- 4628,5106 ----
  ]</i></p>
  
  
+ <blockquote><p>
+ This seems to a useful extension, but is too late for 0x.
+ 
+ Move to Tentatively NAD Future.
+ </p></blockquote>
+ 
+ <p><i>[
+ Moved to NAD Future at 2010-11 Batavia
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add two new rows, and change rehash's postcondition in the unordered
+ associative container requirements table in 23.2.5 [unord.req]:
+ </p>
+ 
  <blockquote>
! <table border="1">
! <caption>Table 87 &mdash; Unordered associative container requirements
! (in addition to container)</caption>
  
! <tr>
! <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
! <th>Complexity</th>
! </tr>
! <tr>
! <td><ins>
! <tt>a.min_load_factor()</tt>
! </ins></td>
! <td><ins>
! <tt>float</tt>
! </ins></td>
! <td><ins>
! Returns a non-negative number that the container attempts to keep the
! load factor greater than or equal to. The container automatically
! decreases the number of buckets as necessary to keep the load factor
! above this number.
! </ins></td>
! <td><ins>
! constant
! </ins></td>
! </tr>
  
! <tr>
! <td><ins><tt>a.min_load_factor(z)</tt></ins></td>
! <td><ins><tt>void</tt></ins></td>
! <td><ins>Pre: <tt>z</tt> shall be non-negative. Changes the container's minimum
! load factor, using <tt>z</tt> as a hint. [<i>Footnote:</i> the minimum
! load factor should be significantly smaller than the maximum. 
! If <tt>z</tt> is too large, the implementation may reduce it to a more sensible value.]
! </ins></td>
! <td><ins>
! constant
! </ins></td>
! </tr>
! <tr>
! <td><tt>a.rehash(n)</tt></td>
! <td><tt>void</tt></td>
! <td>
! Post: <ins><tt>a.bucket_count() &gt;= n</tt>, and <tt>a.size() &lt;= a.bucket_count()
! * a.max_load_factor()</tt>. [<i>Footnote:</i> It is intentional that the
! postcondition does not mention the minimum load factor.
! This member function is primarily intended for cases where the user knows
! that the container's size will increase soon, in which case the container's
! load factor will temporarily fall below <tt>a.min_load_factor()</tt>.]</ins>
! <del>
! <tt>a.bucket_cout &gt; a.size() / a.max_load_factor()</tt> and <tt>a.bucket_count()
! &gt;= n</tt>.
! </del>
! </td>
! <td>
! Average case linear in <tt>a.size()</tt>, worst case quadratic.
! </td>
! </tr>
! </table>
! </blockquote>
  
! <p>
! Add a footnote to 23.2.5 [unord.req] p12:
! </p>
! 
! <blockquote>
! <p>
! The insert members shall not affect the validity of references to
! container elements, but may invalidate all iterators to the container.
! The erase members shall invalidate only iterators and references to the
! erased elements.
! </p>
! 
! <blockquote><p>
! [A consequence of these requirements is that while insert may change the
! number of buckets, erase may not. The number of buckets may be reduced
! on calls to insert or rehash.]
! </p></blockquote>
! </blockquote>
! 
! <p>
! Change paragraph 13:
! </p>
! 
! <blockquote><p>
! The insert members shall not affect the validity of iterators if
! <del><tt>(N+n) &lt; z * B</tt></del> <ins><tt>zmin * B &lt;= (N+n) &lt;= zmax * B</tt></ins>,
! where <tt>N</tt> is the number of elements in
! the container prior to the insert operation, <tt>n</tt> is the number of
! elements inserted, <tt>B</tt> is the container's bucket count,
! <ins><tt>zmin</tt> is the container's minimum load factor,</ins>
! and <tt>z<ins>max</ins></tt> is the container's maximum load factor.
! </p></blockquote>
! 
! <p>
! Add to the <tt>unordered_map</tt> class synopsis in section 23.5.4 [unord.map],
! the <tt>unordered_multimap</tt> class synopsis
! in 23.5.5 [unord.multimap], the <tt>unordered_set</tt> class synopsis in
! 23.5.6 [unord.set], and the <tt>unordered_multiset</tt> class synopsis
! in 23.5.7 [unord.multiset]:
! </p>
! 
! <blockquote><pre><ins>
! float min_load_factor() const;
! void min_load_factor(float z);
! </ins></pre></blockquote>
! 
! <p>
! In 23.5.4.2 [unord.map.cnstr], 23.5.5.2 [unord.multimap.cnstr], 23.5.6.2 [unord.set.cnstr], and
! 23.5.7.2 [unord.multiset.cnstr], change:
! </p>
! 
! <blockquote><p>
! ... <tt>max_load_factor()</tt> returns 1.0 <ins>and
! <tt>min_load_factor()</tt> returns 0</ins>.
! </p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1201"></a>1201. Do we always want to unwrap <tt>ref</tt>-wrappers in <tt>make_tuple</tt></h3>
! <p><b>Section:</b> 20.4.2.4 [tuple.creation], 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Spotting a recent thread on the boost lists regarding collapsing
! optional representations in <tt>optional&lt;optional&lt;T&gt;&gt;</tt> instances, I wonder if
! we have some of the same issues with <tt>make_tuple</tt>, and now <tt>make_pair</tt>?
! </p>
! 
! <p>
! Essentially, if my generic code in my own library is handed a
! <tt>reference_wrapper</tt> by a user, and my library in turn delegates some logic
! to <tt>make_pair</tt> or <tt>make_tuple</tt>, then I am going to end up with a <tt>pair</tt>/<tt>tuple</tt>
! holding a real reference rather than the intended reference wrapper.
! </p>
! 
! <p>
! There are two things as a library author I can do at this point:
! </p>
! 
! <ol style="list-style-type:lower-roman">
! <li>
! document my library also has the same reference-wrapper behaviour as
! <tt>std::make_tuple</tt>
! </li>
! <li>
! roll my own <tt>make_tuple</tt> that does not unwrap rereferences, a lost
! opportunity to re-use the standard library.
! </li>
! </ol>
! 
! <p>
! (There may be some metaprogramming approaches my library can use to wrap
! the <tt>make_tuple</tt> call, but all will be significantly more complex than
! simply implementing a simplified <tt>make_tuple</tt>.)
! </p>
! 
! <p>
! Now I don't propose we lose this library facility, I think unwrapping
! references will be the common behaviour.  However, we might want to
! consider adding another overload that does nothing special with
! <tt>ref</tt>-wrappers.  Note that we already have a second overload of 
! <tt>make_tuple</tt> in the library, called <tt>tie</tt>.
! </p>
! 
! <p><i>[
! 2009-09-30 Daniel adds:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! I suggest to change the currently proposed paragraph for
! <tt>make_simple_pair</tt>
! </p>
! 
! <blockquote><pre>
! template&lt;typename... Types&gt;
!   pair&lt;typename decay&lt;Types&gt;::type...&gt; make_simple_pair(Types&amp;&amp;... t);
! </pre>
! <blockquote>
! <p>
! <del><i>Type requirements:</i> <tt>sizeof...(Types) == 2</tt>.</del>
! <ins><i>Remarks:</i> The program shall be ill-formed, if
! <tt>sizeof...(Types) != 2</tt>.</ins>
! </p>
! <p>
! ...
! </p>
! </blockquote>
! </blockquote>
! 
! <p>
! or alternatively (but with a slightly different semantic):
! </p>
! 
! <blockquote>
! <blockquote><p>
! <i>Remarks:</i> If <tt>sizeof...(Types) != 2</tt>, this function shall not
! participate in overload resolution.
! </p></blockquote>
  </blockquote>
  
+ <p>
+ to follow a currently introduced style and because the library does
+ not have yet a specific "<i>Type requirements</i>" element. If such thing
+ would be considered as useful this should be done as a separate
+ issue. Given the increasing complexity of either of these wordings
+ it might be preferable to use the normal two-argument-declaration
+ style again in either of the following ways:
+ </p>
+ 
+ <ol style="list-style-type:upper-alpha">
+ <li>
+ <pre>template&lt;class T1, class T2&gt;
+ pair&lt;typename decay&lt;T1&gt;::type, typename decay&lt;T2&gt;::type&gt;
+ make_simple_pair(T1&amp;&amp; t1, T2&amp;&amp; t2);
+ </pre>
+ </li>
+ <li>
+ <pre>template&lt;class T1, class T2&gt;
+ pair&lt;V1, V2&gt; make_simple_pair(T1&amp;&amp; t1, T2&amp;&amp; t2);
+ </pre>
+ <blockquote><p>
+ Let <tt>V1</tt> be <tt>typename decay&lt;T1&gt;::type</tt> and <tt>V2</tt> be
+ <tt>typename decay&lt;T2&gt;::type</tt>.
+ </p></blockquote>
+ </li>
+ </ol>
+ 
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 post-Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Mark as Tentatively NAD Future.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Does not have sufficient support at this time. May wish to reconsider for a
+ future standard.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
+ Add the following function to 20.3 [pairs] and signature in
+ appropriate synopses:
  </p>
  
+ <blockquote><pre>
+ template&lt;typename... Types&gt;
+   pair&lt;typename decay&lt;Types&gt;::type...&gt; make_simple_pair(Types&amp;&amp;... t);
+ </pre>
+ <blockquote>
+ <p>
+ <i>Type requirements:</i> <tt>sizeof...(Types) == 2</tt>.
+ </p>
+ <p>
+ <i>Returns:</i> <tt>pair&lt;typename decay&lt;Types&gt;::type...&gt;(std::forward&lt;Types&gt;(t)...)</tt>.
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ <p><i>[
+ Draughting note: I chose a variadic representation similar to <tt>make_tuple</tt>
+ rather than naming both types as it is easier to read through the
+ clutter of metaprogramming this way.  Given there are exactly two
+ elements, the committee may prefer to draught with two explicit template
+ type parameters instead
+ ]</i></p>
+ 
+ 
+ <p>
+ Add the following function to 20.4.2.4 [tuple.creation] and
+ signature in appropriate synopses:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;typename... Types&gt;
+   tuple&lt;typename decay&lt;Types&gt;::type...&gt; make_simple_tuple(Types&amp;&amp;... t);
+ </pre>
+ <blockquote>
+ <p>
+ <i>Returns:</i> <tt>tuple&lt;typename decay&lt;Types&gt;::type...&gt;(std::forward&lt;Types&gt;(t)...)</tt>.
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1203"></a>1203. More useful rvalue stream insertion</h3>
+ <p><b>Section:</b> 27.7.3.9 [ostream.rvalue], 27.7.2.6 [istream.rvalue] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-09-06 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 27.7.3.9 [ostream.rvalue] was created to preserve the ability to insert
+ into (and extract from 27.7.2.6 [istream.rvalue]) rvalue streams:
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class charT, class traits, class T&gt;
+   basic_ostream&lt;charT, traits&gt;&amp;
+   operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp;&amp; os, const T&amp; x);
+ </pre>
+ <blockquote>
+ <p>
+ 1 <i>Effects:</i> <tt>os &lt;&lt; x</tt>
+ </p>
+ <p>
+ 2 <i>Returns:</i> <tt>os</tt>
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ <p>
+ This is good as it allows code that wants to (for example) open, write to, and
+ close an <tt>ofstream</tt> all in one statement:
+ </p>
+ 
+ <blockquote><pre>
+ std::ofstream("log file") &lt;&lt; "Some message\n";
+ </pre></blockquote>
+ 
+ <p>
+ However, I think we can easily make this "rvalue stream helper" even easier to
+ use.  Consider trying to quickly create a formatted string.  With the current
+ spec you have to write:
+ </p>
+ 
+ <blockquote><pre>
+ std::string s = static_cast&lt;std::ostringstream&amp;&gt;(std::ostringstream() &lt;&lt; "i = " &lt;&lt; i).str();
+ </pre></blockquote>
+ 
+ <p>
+ This will store "<tt>i = 10</tt>" (for example) in the string <tt>s</tt>.  Note
+ the need to cast the stream back to <tt>ostringstream&amp;</tt> prior to using
+ the member <tt>.str()</tt>.  This is necessary because the inserter has cast
+ the <tt>ostringstream</tt> down to a more generic <tt>ostream</tt> during the
+ insertion process.
+ </p>
+ 
+ <p>
+ I believe we can re-specify the rvalue-inserter so that this cast is unnecessary.
+ Thus our customer now has to only type:
+ </p>
+ 
+ <blockquote><pre>
+ std::string s = (std::ostringstream() &lt;&lt; "i = " &lt;&lt; i).str();
+ </pre></blockquote>
+ 
+ <p>
+ This is accomplished by having the rvalue stream inserter return an rvalue of
+ the same type, instead of casting it down to the base class.  This is done by
+ making the stream generic, and constraining it to be an rvalue of a type derived
+ from <tt>ios_base</tt>.
+ </p>
+ 
+ <p>
+ The same argument and solution also applies to the inserter.  This code has been
+ implemented and tested.
+ </p>
+ 
+ <p><i>[
+ 2009 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ NAD Future.  No concensus for change.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change 27.7.2.6 [istream.rvalue]:
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class <del>charT, class traits</del> <ins>Istream</ins>, class T&gt;
+   <del>basic_istream&lt;charT, traits&gt;&amp;</del> <ins>Istream&amp;&amp;</ins>
+   operator&gt;&gt;(<del>basic_istream&lt;charT, traits&gt;</del> <ins>Istream</ins>&amp;&amp; is, T&amp; x);
+ </pre>
+ <blockquote>
+ <p>
+ 1 <i>Effects:</i> <tt>is &gt;&gt; x</tt>
+ </p>
+ <p>
+ 2 <i>Returns:</i> <tt><ins>std::move(</ins>is<ins>)</ins></tt>
+ </p>
+ <p><ins>
+ 3 <i>Remarks:</i> This signature shall participate in overload resolution if
+ and only if <tt>Istream</tt> is not an lvalue reference type and is derived from
+ <tt>ios_base</tt>.
+ </ins></p>
+ </blockquote>
+ </blockquote>
+ 
+ <p>
+ Change 27.7.3.9 [ostream.rvalue]:
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class <del>charT, class traits</del> <ins>Ostream</ins>, class T&gt;
+   <del>basic_ostream&lt;charT, traits&gt;&amp;</del> <ins>Ostream&amp;&amp;</ins>
+   operator&lt;&lt;(<del>basic_ostream&lt;charT, traits&gt;</del> <ins>Ostream</ins>&amp;&amp; os, const T&amp; x);
+ </pre>
+ <blockquote>
+ <p>
+ 1 <i>Effects:</i> <tt>os &lt;&lt; x</tt>
+ </p>
+ <p>
+ 2 <i>Returns:</i> <tt><ins>std::move(</ins>os<ins>)</ins></tt>
+ </p>
+ <p><ins>
+ 3 <i>Remarks:</i> This signature shall participate in overload resolution if
+ and only if <tt>Ostream</tt> is not an lvalue reference type and is derived from
+ <tt>ios_base</tt>.
+ </ins></p>
+ </blockquote>
+ </blockquote>
+ 
+ 
  
  
  
  
  <hr>
  <h3><a name="1213"></a>1213. Meaning of valid and singular iterator underspecified</h3>
! <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-09-19 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The terms <em>valid</em> iterator and <em>singular</em> aren't
  properly defined. The fuzziness of those terms became even worse
! after the resolution of <a href="lwg-defects.html#208">208</a> (including further updates by <a href="lwg-defects.html#278">278</a>). In
  24.2 [iterator.requirements] as of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
  the standard says now:
*************** non-singular.
*** 2148,2154 ****
  </blockquote>
  
  <p>
! First, issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#208">208</a> intentionally removed the earlier constraint that past-the-end
  values are always non-singular. The reason for this was to support null
  pointers as past-the-end iterators of e.g. empty sequences. But there
  seem to exist different views on what a singular (iterator) value is. E.g.
--- 5125,5131 ----
  </blockquote>
  
  <p>
! First, issue <a href="lwg-defects.html#208">208</a> intentionally removed the earlier constraint that past-the-end
  values are always non-singular. The reason for this was to support null
  pointers as past-the-end iterators of e.g. empty sequences. But there
  seem to exist different views on what a singular (iterator) value is. E.g.
*************** according to the <a href="http://www.sgi
*** 2156,2199 ****
  a null pointer is <em>not</em> a singular value:
  </p>
  
! <blockquote>
  Dereferenceable iterators are always nonsingular, but the converse is
  not true.
  For example, a null pointer is nonsingular (there are well defined operations
  involving null pointers) even thought it is not dereferenceable.
! </blockquote>
  
  <p>
  and <a href="http://www.sgi.com/tech/stl/InputIterator.html">proceeds</a>:
  </p>
  
! <blockquote>
  An iterator is valid if it is dereferenceable or past-the-end.
! </blockquote>
  
  <p>
  Even if the standard prefers a different meaning of singular here, the
! change was
! incomplete, because by restricting feasible expressions of singular
! iterators to
! destruction and assignment isn't sufficient for a past-the-end
! iterator: Of-course
! it must still be equality-comparable and in general be a readable value.
  </p>
  
  <p>
  Second, the standard doesn't clearly say whether a past-the-end value is
! a valid iterator or not. E.g. 20.9.8 [specialized.algorithms]/1 says:
  </p>
  
! <blockquote>
! In all of the following algorithms, the formal template parameter
! <tt>ForwardIterator</tt>
  is required to satisfy the requirements of a forward iterator (24.1.3)
! [..], and is
! required to have the property that no exceptions are thrown from [..], or
  dereference of valid iterators.
! </blockquote>
  
  <p>
  The standard should make better clear what "singular pointer" and "valid
--- 5133,5171 ----
  a null pointer is <em>not</em> a singular value:
  </p>
  
! <blockquote><p>
  Dereferenceable iterators are always nonsingular, but the converse is
  not true.
  For example, a null pointer is nonsingular (there are well defined operations
  involving null pointers) even thought it is not dereferenceable.
! </p></blockquote>
  
  <p>
  and <a href="http://www.sgi.com/tech/stl/InputIterator.html">proceeds</a>:
  </p>
  
! <blockquote><p>
  An iterator is valid if it is dereferenceable or past-the-end.
! </p></blockquote>
  
  <p>
  Even if the standard prefers a different meaning of singular here, the
! change was incomplete, because by restricting feasible expressions of singular
! iterators to destruction and assignment isn't sufficient for a past-the-end
! iterator: Of-course it must still be equality-comparable and in general be a readable value.
  </p>
  
  <p>
  Second, the standard doesn't clearly say whether a past-the-end value is
! a valid iterator or not. E.g. 20.7.12 [specialized.algorithms]/1 says:
  </p>
  
! <blockquote><p>
! In all of the following algorithms, the formal template parameter <tt>ForwardIterator</tt> 
  is required to satisfy the requirements of a forward iterator (24.1.3)
! [..], and is required to have the property that no exceptions are thrown from [..], or
  dereference of valid iterators.
! </p></blockquote>
  
  <p>
  The standard should make better clear what "singular pointer" and "valid
*************** Let me add a final example: In X [alloca
*** 2208,2232 ****
  we find:
  </p>
  
! <blockquote><pre>pointer X::allocate(size_type n);
  </pre>
  
! <blockquote>
  11 <i>Returns:</i> a pointer to the allocated memory. [<i>Note:</i> if <tt>n == 0</tt>, the return
! value is unspecified. —<i>end note</i>]
! </blockquote>
  
  <p>
  [..]
  </p>
  
! <pre>void X::deallocate(pointer p, size_type n);
  </pre>
  
! <blockquote>
  <i>Preconditions:</i> <tt>p</tt> shall be a non-singular pointer value obtained from a call
  to <tt>allocate()</tt> on this allocator or one that compares equal to it.
! </blockquote>
  </blockquote>
  
  <p>
--- 5180,5206 ----
  we find:
  </p>
  
! <blockquote><pre>
! pointer X::allocate(size_type n);
  </pre>
  
! <blockquote><p>
  11 <i>Returns:</i> a pointer to the allocated memory. [<i>Note:</i> if <tt>n == 0</tt>, the return
! value is unspecified. &mdash;<i>end note</i>]
! </p></blockquote>
  
  <p>
  [..]
  </p>
  
! <pre>
! void X::deallocate(pointer p, size_type n);
  </pre>
  
! <blockquote><p>
  <i>Preconditions:</i> <tt>p</tt> shall be a non-singular pointer value obtained from a call
  to <tt>allocate()</tt> on this allocator or one that compares equal to it.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** Doesn't need to be resolved for Ox
*** 2256,2534 ****
  </p>
  
  
! <p><b>Proposed resolution:</b></p>
  Consider to await the paper.
  
  
  
  
  
  <hr>
! <h3><a name="1214"></a>1214. Insufficient/inconsistent key immutability requirements for  associative containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Deferred">Deferred</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-09-20 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Deferred">Deferred</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Scott Meyers' mentions on a recent posting on <a href="http://groups.google.de/group/comp.std.c++/msg/6f9160fc428bcbea">c.s.c++</a>
! some arguments that point to an incomplete resolution
! of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> and to an inconsistency of requirements on keys in ordered and
! unordered associative
! containers:
  </p>
  
! <blockquote>
  <p>
! 1) <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> introduced the term immutable without defining it in a unique manner in
! 23.2.4 [associative.reqmts]/5:
  </p>
  
! <blockquote>
! [..] Keys in an associative container are immutable.
! </blockquote>
  
  <p>
! According to conventional dictionaries immutable is an unconditional way of
! saying that something cannot be changed. So without any further explicit
! allowance a user <em>always</em> runs into undefined behavior if (s)he attempts
! to modify such a key. IMO this was not the intend of the committee to resolve
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> in that way because the comments suggest an interpretation that
! should give any user the freedom to modify the key in an <em>explicit</em> way
! <em>provided</em> it would not affect the sort order in that container.
  </p>
  
  <p>
! 2) Another observation was that surprisingly no similar 'safety guards'
! exists against unintentional key changes for the unordered associative
! containers, specifically there is no such requirement as in
! 23.2.4 [associative.reqmts]/6 that "both <tt>iterator</tt> and <tt>const_iterator</tt> are constant
! iterators". But the need for such protection against unintentional
! changes as well as the constraints in which manner any explicit
! changes may be performed are both missing and necessary, because
! such changes could potentially change the <em>equivalence</em> of keys that
! is measured by the <tt>hasher</tt> and <tt>key_equal</tt>.
  </p>
  
  <p>
! I suggest to fix the unconditional wording involved with "immutable keys"
! by at least adding a hint for the reader that users <em>may</em> perform such
! changes in an explicit manner <em>and</em> to perform similar wording changes
! as <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> did for the ordered associative containers also for the unordered
! containers.
  </p>
- </blockquote>
  
  <p><i>[
! 2010-03-27 Daniel provides wording.
  ]</i></p>
  
  
! <blockquote>
! This update attempts to provide normative wording that harmonizes the key and
! function object constraints of associative and unordered containers.
! </blockquote>
  
  <p><i>[
! 2010 Batavia:
  ]</i></p>
  
  
  <p>
! We're uncomfortable with the first agenda item, and we can live with the second agenda 
! item being applied before or after Madrid. 
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
  <p>
! Change 23.2.4 [associative.reqmts]/2 as indicated: <i>[This ensures that
! associative containers make better clear what this "arbitrary" type is, as the
! unordered containers do in 23.2.5 [unord.req]/3]</i>
  </p>
  
! <blockquote>
! 2 Each associative container is parameterized on <tt>Key</tt> and an ordering
! relation <tt>Compare</tt> that induces a strict weak ordering (25.4) on elements
! of <tt>Key</tt>. In addition, <tt>map</tt> and <tt>multimap</tt> associate an
! arbitrary <ins><em>mapped type</em></ins><del>type</del> <tt>T</tt> with the
! <tt>Key</tt>. The object of type <tt>Compare</tt> is called the <em>comparison
! object</em> of a container.
! </blockquote>
! </li>
  
  <li>
  <p>
! Change 23.2.4 [associative.reqmts]/5 as indicated: <i>[This removes the
! too strong requirement that keys must not be changed at all and brings this line
! in sync with 23.2.5 [unord.req]/7. We take care about the real
! constraints by the remaining suggested changes. The rationale provided by LWG
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> didn't really argue why that addition is necessary, and I
! believe the remaining additions make it clear that any user changes have strong
! restrictions]</i>:
  </p>
  
! <blockquote>
! 5 For <tt>set</tt> and <tt>multiset</tt> the value type is the same as the key
! type. For <tt>map</tt> and <tt>multimap</tt> it is equal to <tt>pair&lt;const
! Key, T&gt;</tt>. <del>Keys in an associative container are immutable.</del>
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.2.5 [unord.req]/3+4 as indicated: <i>[The current sentence of
! p.4 has doesn't say something really new and this whole subclause misses to
! define the concepts of the container-specific hasher <i>object</i> and predicate
! <i>object</i>. We introduce the term <em>key equality predicate</em> which is
! already used in the requirements table. This change does not really correct part
! of this issue, but is recommended to better clarify the nomenclature and the
! difference between the function objects and the function object <em>types</em>,
! which is important, because both can potentially be stateful.]</i>
  </p>
- 
- <blockquote>
  <p>
! 3 Each unordered associative container is parameterized by <tt>Key</tt>, by a
! function object type <tt>Hash</tt> that meets the <tt>Hash</tt> requirements
! (20.2.4) and acts as a hash function for argument values of type <tt>Key</tt>,
! and by a binary predicate <tt>Pred</tt> that induces an equivalence relation on
! values of type <tt>Key</tt>. Additionally, <tt>unordered_map</tt> and
! <tt>unordered_multimap</tt> associate an arbitrary <em>mapped type</em>
! <tt>T</tt> with the <tt>Key</tt>.
  </p>
  
  <p>
! 4 <ins>The container's object of type <tt>Hash</tt> - denoted by
! <tt>hash</tt> - is called the <em>hash function</em> of the container.
! The container's object of type <tt>Pred</tt> - denoted by
! <tt>pred</tt> - is called the <em>key equality predicate</em> of the
! container.</ins><del>A hash function is a function object that takes a single
! argument of type <tt>Key</tt> and returns a value of type
! <tt>std::size_t</tt></del>.
  </p>
- </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.2.5 [unord.req]/5 as indicated: <i>[This adds a similar
! safe-guard as the last sentence of 23.2.4 [associative.reqmts]/3]</i>
  </p>
  
! <blockquote>
! 5 Two values <tt>k1</tt> and <tt>k2</tt> of type <tt>Key</tt> are considered
! equivalent if the container's <ins>key equality
! predicate</ins><del><tt>key_equal</tt> function object</del> returns
! <tt>true</tt> when passed those values. If <tt>k1</tt> and <tt>k2</tt> are
! equivalent, the <ins>container's</ins> hash function shall return the same value
! for both. [<i>Note:</i> thus, when an unordered associative container is
! instantiated with a non-default <tt>Pred</tt> parameter it usually needs a
! non-default <tt>Hash</tt> parameter as well. — <i>end note</i>] <ins>For
! any two keys <tt>k1</tt> and <tt>k2</tt> in the same container, calling
! <tt>pred(k1, k2)</tt> shall always return the same value. For any key <tt>k</tt>
! in a container, calling <tt>hash(k)</tt> shall always return the same
! value.</ins>
! </blockquote>
  </li>
  
  <li>
  <p>
! After 23.2.5 [unord.req]/7 add the following new paragraph: <i>[This
! ensures the same level of compile-time protection that we already require for
! associative containers. It is necessary for similar reasons, because any change
! in the stored key which would change it's equality relation to others or would
! change it's hash value such that it would no longer fall in the same bucket,
! would break the container invariants]</i>
  </p>
  
! <blockquote>
! <p>
! 7 For <tt>unordered_set</tt> and <tt>unordered_multiset</tt> the value type is
! the same as the key type. For <tt>unordered_map</tt> and
! <tt>unordered_multimap</tt> it is <tt>std::pair&lt;const Key, T&gt;</tt>.
! </p>
! <p>
! <ins>For unordered containers where the value type is the same as the key type,
! both <tt>iterator</tt> and <tt>const_iterator</tt> are constant iterators. It is
! unspecified whether or not <tt>iterator</tt> and <tt>const_iterator</tt> are the
! same type. [<i>Note:</i> <tt>iterator</tt> and <tt>const_iterator</tt> have
! identical semantics in this case, and <tt>iterator</tt> is convertible to
! <tt>const_iterator</tt>. Users can avoid violating the One Definition Rule by
! always using <tt>const_iterator</tt> in their function parameter lists. —
! <i>end note</i>]</ins>
! </p>
! </blockquote>
  </li>
  
  </ol>
  
  
  
  
  
  
! <hr>
! <h3><a name="1215"></a>1215. <tt>list::merge</tt> with unequal allocators</h3>
! <p><b>Section:</b> 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Tentatively Ready</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-09-24 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively Ready">Tentatively Ready</a> status.</p>
! <p><b>Discussion:</b></p>
  <p>
! In Bellevue (I think), we passed
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2525.pdf">N2525</a>,
! which, among other things, specifies that the behavior of
! <tt>list::splice</tt> is undefined if the allocators of the two lists
! being spliced do not compare equal. The same rationale should apply to
! <tt>list::merge</tt>. The intent of <tt>list::merge</tt> (AFAIK) is to
! move nodes from one sorted <tt>list</tt> into another sorted
! <tt>list</tt> without copying the elements. This is possible only if the
! allocators compare equal.
  </p>
  
  
- <p><b>Proposed resolution:</b></p>
  <p>
! Relative to the August 2009 WP,
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2857.pdf">N2857</a>,
! change 23.3.4.4 [list.ops],
! paragraphs 22-25 as follows:
  </p>
  
! <blockquote>
! <pre>void merge(list&amp;&amp; x);
! template &lt;class Compare&gt; void merge(list&amp;&amp; x, Compare comp);
  </pre>
  <blockquote>
  <p>
! <i>Requires</i>: both the list and the argument list shall be sorted
! according to operator&lt; or comp.
  </p>
  <p>
! <i>Effects</i>: If <tt>(&amp;x == this)</tt> does nothing; otherwise, merges the
! two sorted ranges <tt>[begin(), end())</tt> and <tt>[x.begin(),
! x.end())</tt>. The result is a range in which the elements will be
! sorted in non-decreasing order according to the ordering defined by
! <tt>comp</tt>; that is, for every iterator <tt>i</tt>, in the range other than the
! <tt>first</tt>, the condition <tt>comp(*i, *(i - 1)<ins>)</ins></tt> will be
! <tt>false</tt>.
  </p>
  <p>
! <i>Remarks</i>: Stable. If <tt>(&amp;x != this)</tt> the range <tt>[x.begin(), x.end())</tt> is
! empty after the merge. <ins>No elements are copied by this operation.
! The behavior is undefined if <tt>this-&gt;get_allocator() !=
! x.get_allocator()</tt>.</ins>
  </p>
  <p>
! <i>Complexity</i>: At most <tt>size() + x.size() - 1</tt> applications of <tt>comp</tt>
! if <tt>(&amp;x != this)</tt>; otherwise, no applications of <tt>comp</tt> are performed. If an
! exception is thrown other than by a comparison there are no effects.
  </p>
  </blockquote>
  </blockquote>
  
  
--- 5230,5837 ----
  </p>
  
  
! <p><i>[2014-02-20 Re-open Deferred issues as Priority 4]</i></p>
! 
! 
! <p>
  Consider to await the paper.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1217"></a>1217. Quaternion support</h3>
! <p><b>Section:</b> 26.4 [complex.numbers] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Ted Shaneyfelt <b>Opened:</b> 2009-09-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#complex.numbers">active issues</a> in [complex.numbers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.numbers">issues</a> in [complex.numbers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Concerning mathematically proper operation of the type:
  </p>
  
! <blockquote><pre>
! complex&lt;complex&lt;T&gt; &gt;
! </pre></blockquote>
! 
  <p>
! Generally accepted mathematical semantics of such a construct correspond
! to quaternions through Cayly-Dickson construct
  </p>
  
! <blockquote><pre>
! (w+xi) + (y+zi) j
! </pre></blockquote>
  
  <p>
! The proper implementation seems straightforward by adding a few
! declarations like those below. I have included operator definition for
! combining real scalars and complex types, as well, which seems
! appropriate, as algebra of complex numbers allows mixing complex and
! real numbers with operators. It also allows for constructs such as
! <tt>complex&lt;double&gt; i=(0,1),  x = 12.34 + 5*i;</tt>
  </p>
  
  <p>
! Quaternions are often used in areas such as computer graphics, where,
! for example, they avoid the problem of Gimbal lock when rotating objects
! in 3D space, and can be more efficient than matrix multiplications,
! although I am applying them to a different field.
  </p>
  
+ <pre>
+ /////////////////////////ALLOW OPERATORS TO COMBINE REAL SCALARS AND COMPLEX VALUES /////////////////////////
+ template&lt;typename T,typename S&gt; complex&lt;T&gt; operator+(const complex&lt;T&gt; x,const S a) {
+     complex&lt;T&gt; result(x.real()+a, x.imag());
+     return result;
+ }
+ template&lt;typename T,typename S&gt; complex&lt;T&gt; operator+(const S a,const complex&lt;T&gt; x) {
+     complex&lt;T&gt; result(a+x.real(), x.imag());
+     return result;
+ }
+ template&lt;typename T,typename S&gt; complex&lt;T&gt; operator-(const complex&lt;T&gt; x,const S a) {
+     complex&lt;T&gt; result(x.real()-a, x.imag());
+     return result;
+ }
+ template&lt;typename T,typename S&gt; complex&lt;T&gt; operator-(const S a,const complex&lt;T&gt; x) {
+     complex&lt;T&gt; result(a-x.real(), x.imag());
+     return result;
+ }
+ template&lt;typename T,typename S&gt; complex&lt;T&gt; operator*(const complex&lt;T&gt; x,const S a) {
+     complex&lt;T&gt; result(x.real()*a, x.imag()*a);
+     return result;
+ }
+ template&lt;typename T,typename S&gt; complex&lt;T&gt; operator*(const S a,const complex&lt;T&gt; x) {
+     complex&lt;T&gt; result(a*x.real(), a*x.imag());
+     return result;
+ }
+ 
+ /////////////////////////PROPERLY IMPLEMENT QUATERNION SEMANTICS/////////////////////////
+ template&lt;typename T&gt; double normSq(const complex&lt;complex&lt;T&gt; &gt;q) {
+     return q.real().real()*q.real().real()
+          + q.real().imag()*q.real().imag()
+          + q.imag().real()*q.imag().real()
+          + q.imag().imag()*q.imag().imag();
+ }
+ template&lt;typename T&gt; double norm(const complex&lt;complex&lt;T&gt; &gt;q) {
+     return sqrt(normSq(q));
+ }
+ /////// Cayley-Dickson Construction
+ template&lt;typename T&gt; complex&lt;complex&lt;T&gt; &gt; conj(const complex&lt;complex&lt;T&gt; &gt; x) {
+     complex&lt;complex&lt;T&gt; &gt; result(conj(x.real()),-x.imag());
+     return result;
+ }
+ template&lt;typename T&gt; complex&lt;complex&lt;T&gt; &gt; operator*(const complex&lt;complex&lt;T&gt; &gt; ab,const complex&lt;complex&lt;T&gt; &gt; cd) {
+     complex&lt;T&gt; re(ab.real()*cd.real()-conj(cd.imag())*ab.imag());
+     complex&lt;T&gt; im(cd.imag()*ab.real()+ab.imag()*conj(cd.real()));
+     complex&lt;complex&lt;double&gt; &gt; q(re,im);
+     return q;
+ }
+ //// Quaternion division
+ template&lt;typename S,typename T&gt; complex&lt;complex&lt;T&gt; &gt; operator/(const complex&lt;complex&lt;T&gt; &gt; q,const S a) {
+     return q * (1/a);
+ }
+ template&lt;typename S,typename T&gt; complex&lt;complex&lt;T&gt; &gt; operator/(const S a,const complex&lt;complex&lt;T&gt; &gt; q) {
+     return a*conj(q)/normSq(q);
+ }
+ template&lt;typename T&gt; complex&lt;complex&lt;T&gt; &gt; operator/(const complex&lt;complex&lt;T&gt; &gt; n, const complex&lt;complex&lt;T&gt; &gt; d) {
+     return n * (conj(d)/normSq(d));
+ }
+ </pre>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ NAD Future.  There is no consensus or time to move this into C++0X.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1235"></a>1235. Issue with C++0x random number proposal</h3>
+ <p><b>Section:</b> X [rand.concept.dist] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Matthias Troyer <b>Opened:</b> 2009-10-12 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! There exist optimized, vectorized vendor libraries for the creation of
! random number generators, such as Intel's MKL [1] and AMD's ACML [2]. In
! timing tests we have seen a performance gain of a factor of up to 80
! (eighty) compared to a pure C++ implementation (in Boost.Random) when
! using these generator to generate a sequence of normally distributed
! random numbers. In codes dominated by the generation of random numbers
! (we have application codes where random number generation is more than
! 50% of the CPU time) this factor 80 is very significant.
! </p>
! 
! <p>
! To make use of these vectorized generators, we use a C++ class modeling
! the <tt>RandomNumberEngine</tt> concept and forwarding the generation of random
! numbers to those optimized generators. For example:
! </p>
! 
! <blockquote><pre>
! namespace mkl {
!  class mt19937 {.... };
! }
! </pre></blockquote>
! 
! <p>
! For the generation of random variates we also want to dispatch to
! optimized vectorized functions in the MKL or ACML libraries. See this
! example:
! </p>
! 
! <blockquote><pre>
! mkl::mt19937 eng;
! std::normal_distribution&lt;double&gt; dist;
! 
! double n = dist(eng);
! </pre></blockquote>
! 
! <p>
! Since the variate generation is done through the <tt>operator()</tt> of the
! distribution there is no customization point to dispatch to Intel's or
! AMD's optimized functions to generate normally distributed numbers based
! on the <tt>mt19937</tt> generator. Hence, the performance gain of 80 cannot be
! achieved.
! </p>
! 
! <p>
! Contrast this with TR1:
! </p>
! 
! <blockquote><pre>
! mkl::mt19937 eng;
! std::tr1::normal_distribution&lt;double&gt; dist;
! std::tr1::variate_generator&lt;mkl::mt19937,std::tr1::normal_distribution&lt;double&gt; &gt; rng(eng,dist);
! double n = rng();
! </pre></blockquote>
! 
! <p>
! This - admittedly much uglier from an aestethic point of view - design
! allowed optimization by specializing the <tt>variate_generator</tt> template for
! <tt>mkl::mt19937</tt>:
! </p>
! 
! <blockquote><pre>
! namespace std { namespace tr1 {
! 
! template&lt;&gt;
! class variate_generator&lt;mkl::mt19937,std::tr1::normal_distribution&lt;double&gt; &gt; { .... };
! 
! } }
! </pre></blockquote>
! 
! <p>
! A similar customization point is missing in the C++0x design and
! prevents the optimized vectorized version to be used.
! </p>
! 
! <p>
! Suggested resolution:
! </p>
! 
! <p>
! Add a customization point to the distribution concept. Instead of the
! <tt>variate_generator</tt> template this can be done through a call to a
! free function <tt>generate_variate</tt> found by ADL instead of
! <tt>operator()</tt> of the distribution:
! </p>
! 
! <blockquote><pre>
! template &lt;RandomNumberDistribution, class RandomNumberEngine&gt;
! typename RandomNumberDistribution ::result_type
! generate_variate(RandomNumberDistribution const&amp; dist, RandomNumberEngine&amp; eng);
! </pre></blockquote>
! 
! <p>
! This function can be overloaded for optimized enginges like
! <tt>mkl::mt19937</tt>.
  </p>
  
  <p><i>[
! 2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! NAD Future.  No time to add this feature for C++0X.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1238"></a>1238. defining algorithms taking iterator for range</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-10-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#algorithms">active issues</a> in [algorithms].</p>
! <p><b>View all other</b> <a href="lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The library has many algorithms that take a source range represented by
! a pair of iterators, and the start of some second sequence given by a
! single iterator.  Internally, these algorithms will produce undefined
! behaviour if the second 'range' is not as large as the input range, but
! none of the algorithms spell this out in Requires clauses, and there is
! no catch-all wording to cover this in clause 17 or the front matter of
! 25.
! </p>
! 
! <p>
! There was an attempt to provide such wording in paper
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2944.pdf">n2944</a>
! but this
! seems incidental to the focus of the paper, and getting the wording of
! this issue right seems substantially more difficult than the simple
! approach taken in that paper.  Such wording will be removed from an
! updated paper, and hopefully tracked via the LWG issues list instead.
! </p>
! 
! <p>
! It seems there are several classes of problems here and finding wording
! to solve all in one paragraph could be too much.  I suspect we need
! several overlapping requirements that should cover the desired range of
! behaviours.
! </p>
! 
! <p>
! Motivating examples:
! </p>
! 
! <p>
! A good initial example is the <tt>swap_ranges</tt> algorithm.  Here there is a
! clear requirement that <tt>first2</tt> refers to the start of a valid range at
! least as long as the range <tt>[first1, last1)</tt>.  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2944.pdf">n2944</a> tries to solve this
! by positing a hypothetical <tt>last2</tt> iterator that is implied by the
! signature, and requires <tt>distance(first2,last2) &lt; distance(first1,last1)</tt>.
!  This mostly works, although I am uncomfortable assuming that <tt>last2</tt> is
! clearly defined and well known without any description of how to obtain
! it (and I have no idea how to write that).
! </p>
! 
! <p>
! A second motivating example might be the <tt>copy</tt> algorithm.  Specifically,
! let us image a call like:
! </p>
! 
! <blockquote><pre>
! copy(istream_iterator&lt;int&gt;(is),istream_iterator(),ostream_iterator&lt;int&gt;(os));
! </pre></blockquote>
! 
! <p>
! In this case, our input iterators are literally simple <tt>InputIterators</tt>,
! and the destination is a simple <tt>OutputIterator</tt>.  In neither case am I
! happy referring to <tt>std::distance</tt>, in fact it is not possible for the
! <tt>ostream_iterator</tt> at all as it does not meet the requirements.  However,
! any wording we provide must cover both cases.  Perhaps we might deduce
! <tt>last2 == ostream_iterator&lt;int&gt;{}</tt>, but that might not always be valid for
! user-defined iterator types.  I can well imagine an 'infinite range'
! that writes to <tt>/dev/null</tt> and has no meaningful <tt>last2</tt>.
! </p>
! 
! <p>
! The motivating example in <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2944.pdf"
! >n2944</a> is <tt>std::equal</tt>, and that seems to fall somewhere between the
! two.
! </p>
! 
! <p>
! Outlying examples might be <tt>partition_copy</tt> that takes two output
! iterators, and the <tt>_n</tt> algorithms where a range is specified by a
! specific number of iterations, rather than traditional iterator pair. 
! We should also <em>not</em> accidentally apply inappropriate constraints to
! <tt>std::rotate</tt> which takes a third iterator that is not intended to be a
! separate range at all.
! </p>
! 
! <p>
! I suspect we want some wording similar to:
! </p>
! 
! <blockquote><p>
! For algorithms that operate on ranges where the end iterator of the
! second range is not specified, the second range shall contain at least
! as many elements as the first.
! </p></blockquote>
! 
! <p>
! I don't think this quite captures the intent yet though.  I am not sure
! if 'range' is the right term here rather than sequence.  More awkwardly,
! I am not convinced we can describe an Output sequence such as produce by
! an <tt>ostream_iterator</tt> as "containing elements", at least not as a
! precondition to the call before they have been written.
! </p>
! 
! <p>
! Another idea was to describe require that the trailing iterator support
! at least distance(input range) applications of <tt>operator++</tt> and may be
! written through the same number of times if a mutable/output iterator.
! </p>
! 
! <p>
! We might also consider handling the case of an output range vs. an input
! range in separate paragraphs, if that simplifies how we describe some of
! these constraints.
! </p>
  
  <p><i>[
! 2009-11-03 Howard adds:
  ]</i></p>
  
  
+ <blockquote><p>
+ Moved to Tentatively NAD Future after 5 positive votes on c++std-lib.
+ </p></blockquote>
+ 
+ 
+ <p><b>Rationale:</b></p>
  <p>
! Does not have sufficient support at this time. May wish to reconsider for a
! future standard.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1242"></a>1242. Enable SCARY iterators</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2009-10-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#containers">active issues</a> in [containers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
  <p>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2980.pdf">N2980</a>.
  </p>
  
! <p><i>[
! 2009-10 Santa Cruz
! ]</i></p>
! 
! 
! <blockquote><p>
! The paper was lengthy discussed but considerable concern remained to add this feature to C++0x. 
! Strong consensus was found to consider it for C++1x, though.
! </p></blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! The LWG does not wish to make a change at this time. 
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="1282"></a>1282. A proposal to add <tt>std::split</tt> algorithm</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Igor Semenov <b>Opened:</b> 2009-12-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#algorithms">active issues</a> in [algorithms].</p>
! <p><b>View all other</b> <a href="lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <ol style="list-style-type:upper-roman">
  
  <li>
  <p>
! Motivation and Scope
! </p>
! <p>
! Splitting strings into parts by some set of delimiters is an often task, but
! there is no simple and generalized solution in C++ Standard. Usually C++
! developers use <tt>std::basic_stringstream&lt;&gt;</tt> to split string into
! parts, but there are several inconvenient restrictions:
  </p>
  
! <ul>
! <li>
! we cannot explicitly assign the set of delimiters;
! </li>
! <li>
! this approach is suitable only for strings, but not for other types of
! containers;
! </li>
! <li>
! we have (possible) performance leak due to string instantiation.
! </li>
! </ul>
  </li>
  
  <li>
  <p>
! Impact on the Standard
  </p>
  <p>
! This algorithm doesn't interfere with any of current standard algorithms.
  </p>
+ </li>
  
+ <li>
  <p>
! Design Decisions
! </p>
! <p>
! This algorithm is implemented in terms of input/output iterators. Also, there is
! one additional wrapper for <tt>const CharType *</tt> specified delimiters.
  </p>
  </li>
  
  <li>
  <p>
! Example implementation
  </p>
+ <pre>
+ template&lt; class It, class DelimIt, class OutIt &gt;
+ void split( It begin, It end, DelimIt d_begin, DelimIt d_end, OutIt out )
+ {
+    while ( begin != end )
+    {
+        It it = std::find_first_of( begin, end, d_begin, d_end );
+        *out++ = std::make_pair( begin, it );
+        begin = std::find_first_of( it, end, d_begin, d_end,
+            std::not2( std::equal_to&lt; typename It::value_type &gt;() ) );
+    }
+ }
  
! template&lt; class It, class CharType, class OutIt &gt;
! void split( It begin, It end, const CharType * delim, OutIt out )
! {
!    split( begin, end, delim, delim + std::strlen( delim ), out );
! }
! </pre>
  </li>
  
  <li>
  <p>
! Usage
  </p>
+ <pre>
+ std::string ss( "word1 word2 word3" );
+ std::vector&lt; std::pair&lt; std::string::const_iterator, std::string::const_iterator &gt; &gt; v;
+ split( ss.begin(), ss.end(), " ", std::back_inserter( v ) );
  
! for ( int i = 0; i &lt; v.size(); ++i )
! {
!    std::cout &lt;&lt; std::string( v[ i ].first, v[ i ].second ) &lt;&lt; std::endl;
! }
! // word1
! // word2
! // word3
! </pre>
  </li>
  
  </ol>
  
+ <p><i>[
+ 2010-01-22 Moved to Tentatively NAD Future after 5 positive votes on c++std-lib.
+ Rationale added below.
+ ]</i></p>
  
  
  
+ <p><b>Rationale:</b></p>
+ <p>
+ The LWG is not considering completely new features for standardization at this
+ time.  We would like to revisit this good suggestion for a future TR and/or
+ standard.
+ </p>
  
  
! <p><b>Proposed resolution:</b></p>
  <p>
! Add to the synopsis in 25.1 [algorithms.general]:
  </p>
  
+ <blockquote><pre>
+ template&lt; class ForwardIterator1, class ForwardIterator2, class OutputIterator &gt;
+   void split( ForwardIterator1 first, ForwardIterator1 last,
+               ForwardIterator2 delimiter_first, ForwardIterator2 delimiter_last,
+               OutputIterator result );
+ 
+ template&lt; class ForwardIterator1, class CharType, class OutputIterator &gt;
+   void split( ForwardIterator1 first, ForwardIterator1 last,
+               const CharType * delimiters, OutputIterator result );
+ </pre></blockquote>
  
  <p>
! Add a new section [alg.split]:
  </p>
  
! <blockquote><pre>
! template&lt; class ForwardIterator1, class ForwardIterator2, class OutputIterator &gt;
!   void split( ForwardIterator1 first, ForwardIterator1 last,
!               ForwardIterator2 delimiter_first, ForwardIterator2 delimiter_last,
!               OutputIterator result );
  </pre>
+ 
  <blockquote>
  <p>
! 1. <i>Effects:</i> splits the range <tt>[first, last)</tt> into parts, using any
! element of <tt>[delimiter_first, delimiter_last)</tt> as a delimiter. Results
! are pushed to output iterator in the form of <tt>std::pair&lt;ForwardIterator1,
! ForwardIterator1&gt;</tt>. Each of these pairs specifies a maximal subrange of
! <tt>[first, last)</tt> which does not contain a delimiter.
  </p>
  <p>
! 2. <i>Returns:</i> nothing.
  </p>
  <p>
! 3. <i>Complexity:</i> Exactly <tt>last - first</tt> assignments.
  </p>
+ </blockquote>
+ 
+ <pre>
+ template&lt; class ForwardIterator1, class CharType, class OutputIterator &gt;
+   void split( ForwardIterator1 first, ForwardIterator1 last,
+               const CharType * delimiters, OutputIterator result );
+ </pre>
+ 
+ <blockquote>
  <p>
! 1. <i>Effects:</i> split the range <tt>[first, last)</tt> into parts, using any
! element of <tt>delimiters</tt> (interpreted as zero-terminated string) as a
! delimiter. Results are pushed to output iterator in the form of
! <tt>std::pair&lt;ForwardIterator1, ForwardIterator1&gt;</tt>. Each of these
! pairs specifies a maximal subrange of <tt>[first, last)</tt> which does not
! contain a delimiter.
! </p>
! <p>
! 2. <i>Returns:</i> nothing.
! </p>
! <p>
! 3. <i>Complexity:</i> Exactly <tt>last - first</tt> assignments.
  </p>
  </blockquote>
+ 
  </blockquote>
  
  
*************** exception is thrown other than by a comp
*** 2536,3085 ****
  
  
  <hr>
! <h3><a name="1252"></a>1252. <tt>wbuffer_convert::state_type</tt> inconsistency</h3>
! <p><b>Section:</b> 22.3.3.2.3 [conversions.buffer] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Bo Persson  <b>Opened:</b> 2009-10-21 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The synopisis for <tt>wbuffer_convert</tt> 22.3.3.2.3 [conversions.buffer]/2 contains
  </p>
  
! <blockquote><pre>typedef typename Tr::state_type   state_type; 
! </pre></blockquote>
  
  <p>
! making <tt>state_type</tt> a synonym for (possibly) some
! <tt>char_traits&lt;x&gt;::state_type</tt>. 
  </p>
  
  <p>
! However, in paragraph 9 of the same section, we have 
  </p>
  
! <blockquote><pre>typedef typename Codecvt::state_type state_type;
! </pre>
  
! <blockquote>
! The type shall be a synonym for <tt>Codecvt::state_type</tt>.
! </blockquote>
! </blockquote>
  
  <p>
! From what I can see, it might be hard to implement
! <tt>wbuffer_convert</tt> if the types were not both
! <tt>std::mbstate_t</tt>, but I cannot find a requirement that they must
! be the same type.
  </p>
  
! <p><i>[
! Batavia 2010:
! ]</i></p>
  
  
  <p>
! Howard to draft wording, move to Review. Run it by Bill. Need to move this in Madrid.
  </p>
  
  
! <p><b>Proposed resolution:</b></p>
  
  
  
  
  
- <hr>
- <h3><a name="1253"></a>1253. invalidation of iterators and <tt>emplace</tt> vs. <tt>insert</tt> inconsistence in assoc. containers</h3>
- <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Tentatively Ready</a>
-  <b>Submitter:</b> Boris Dušek <b>Opened:</b> 2009-10-24 <b>Last modified:</b> 2010-11-13</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively Ready">Tentatively Ready</a> status.</p>
- <p><b>Discussion:</b></p>
  <p>
! In the latest published draft
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>,
! section 23.2.4 [associative.reqmts], paragraph 8, it is specifies
! that that <tt>insert</tt> does not invalidate any iterators. As per
! 23.2.1 [container.requirements.general], paragraph 12, this holds
! true not only for <tt>insert</tt>, but <tt>emplace</tt> as well. This
! gives the <tt>insert</tt> member a special treatment w.r.t.
! <tt>emplace</tt> member in 23.2.4 [associative.reqmts], par. 8,
! since both modify the container. For the sake of consistency, in 23.2.4 [associative.reqmts], par. 8: either reference to
! <tt>insert</tt> should be removed (i.e. count on 23.2.1 [container.requirements.general], par. 12), or reference to
! <tt>emplace</tt> be added (i.e. mention all members of assoc. containers
! that modify it).
  </p>
  
  <p><i>[
! 2009-11-18 Chris provided wording.
  ]</i></p>
  
  
- <blockquote>
- This suggested wording covers both the issue discussed, and a number of other
- identical issues (namely insert being discussed without emplace). I'm happy to
- go back and split and introduce a new issue if appropriate, but I think the
- changes are fairly mechanical and obvious.
- </blockquote>
- 
  <p><i>[
! 2010-01-23 Daniel Krügler and J. Daniel García updated wording to
! make the use of <tt>hint</tt> consistent with <tt>insert</tt>.
  ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Modify bullet 1 of 23.2.1 [container.requirements.general], p10:
  </p>
  
  <p>
! 10 Unless otherwise specified (see 23.2.4.1, 23.2.5.1, 23.3.2.3, and 23.3.6.4)
! all container types defined in this Clause meet the following additional
! requirements:
  </p>
  
! <ul>
! <li>
! if an exception is thrown by an <tt>insert()</tt> <ins>or
! <tt>emplace()</tt></ins> function while inserting a single element, that
! function has no effects.
! </li>
! <li>...</li>
! </ul>
  
  <p>
! Modify 23.2.4 [associative.reqmts], p4:
  </p>
  
- <blockquote>
- 4 An associative container supports <i>unique keys</i> if it may contain at most
- one element for each key. Otherwise, it supports <i>equivalent keys</i>. The
- <tt>set</tt> and <tt>map</tt> classes support unique keys; the <tt>multiset</tt>
- and <tt>multimap</tt> classes support equivalent keys. For <tt>multiset</tt> and
- <tt>multimap</tt>, <tt>insert</tt><ins>, <tt>emplace</tt>,</ins> and
- <tt>erase</tt> preserve the relative ordering of equivalent elements.
  </blockquote>
  
  <p>
! Modify Table 96 — Associative container requirements in 23.2.4 [associative.reqmts]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 96 — Associative container requirements (in addition to container)</caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
! <th>Complexity</th>
  </tr>
  
  <tr>
! <td colspan="4"><center>...</center></td>
  </tr>
  
  <tr>
! <td><tt>a_eq.emplace(args)</tt></td>
! <td><tt>iterator</tt></td>
! <td>inserts a <tt>T</tt> object <tt>t</tt> constructed with
! <tt>std::forward&lt;Args&gt;(args)...</tt> and returns the iterator pointing to
! the newly inserted element. <ins>If a range containing elements equivalent to
! <tt>t</tt> exists in <tt>a_eq</tt>, <tt>t</tt> is inserted at the end of that
! range.</ins></td>
! <td>logarithmic</td>
  </tr>
  
! <tr>
! <td><tt>a.emplace_hint(p, args)</tt></td>
! <td><tt>iterator</tt></td>
! <td>equivalent to <tt>a.emplace(std::forward&lt;Args&gt;(args)...)</tt>. Return
! value is an iterator pointing to the element with the key equivalent to the
! newly inserted element. <del>The <tt>const_iterator p</tt> is a hint pointing to
! where the search should start.</del> <ins>The element is inserted as close as
! possible to the position just prior to <tt>p</tt>.</ins> <del>Implementations
! are permitted to ignore the hint.</del></td>
! <td>logarithmic in general, but amortized constant if the element is inserted
! right <del>after</del> <ins>before</ins> <tt>p</tt></td>
! </tr>
  
- <tr>
- <td colspan="4"><center>...</center></td>
- </tr>
  
- </tbody></table>
- </blockquote>
  
  <p>
! Modify 23.2.4 [associative.reqmts], p8:
  </p>
  
! <blockquote>
! 8 The <tt>insert</tt> <ins>and <tt>emplace</tt></ins> members shall not affect
! the validity of iterators and references to the container, and the
! <tt>erase</tt> members shall invalidate only iterators and references to the
! erased elements.
! </blockquote>
  
  <p>
! Modify 23.2.4.1 [associative.reqmts.except], p2:
  </p>
  
! <blockquote>
! 2 For associative containers, if an exception is thrown by any operation from
! within an <tt>insert()</tt> <ins> or <tt>emplace()</tt></ins> function inserting
! a single element, the <del><tt>insert()</tt> function</del> <ins>insertion</ins>
! has no effect.
! </blockquote>
  
  <p>
! Modify 23.2.5 [unord.req], p6, p12 and p13:
  </p>
  
- <blockquote>
  <p>
! 6 An unordered associative container supports <i>unique keys</i> if it may
! contain at most one element for each key. Otherwise, it supports <i>equivalent
! keys</i>. <tt>unordered_set</tt> and <tt>unordered_map</tt> support unique keys.
! <tt>unordered_multiset</tt> and <tt>unordered_multimap</tt> support equivalent
! keys. In containers that support equivalent keys, elements with equivalent keys
! are adjacent to each other. For <tt>unordered_multiset</tt> and
! <tt>unordered_multimap</tt>, <tt>insert</tt><ins>, <tt>emplace</tt>,</ins> and
! <tt>erase</tt> preserve the relative ordering of equivalent elements.
  </p>
  
  <p>
! 12 The <tt>insert</tt> <ins>and <tt>emplace</tt></ins> members shall not affect
! the validity of references to container elements, but may invalidate all
! iterators to the container. The erase members shall invalidate only iterators
! and references to the erased elements.
  </p>
  
  <p>
! 13 The <tt>insert</tt> <ins>and <tt>emplace</tt></ins> members shall not affect
! the validity of iterators if <tt>(N+n) &lt; z * B</tt>, where <tt>N</tt> is the
! number of elements in the container prior to the insert operation, <tt>n</tt> is
! the number of elements inserted, <tt>B</tt> is the container's bucket count, and
! <tt>z</tt> is the container's maximum load factor.
  </p>
- </blockquote>
  
  <p>
! Modify 23.2.5.1 [unord.req.except], p2:
  </p>
  
  <blockquote>
! 2 For unordered associative containers, if an exception is thrown by any
! operation other than the container's hash function from within an
! <tt>insert()</tt> <ins>or <tt>emplace()</tt></ins> function inserting a single
! element, the <del><tt>insert()</tt></del> <ins>insertion</ins>
! <del>function</del> has no effect.
  </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1279"></a>1279. forbid <tt>[u|bi]nary_function</tt> specialization</h3>
! <p><b>Section:</b> X [base] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2009-11-30 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#base">issues</a> in [base].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! A program should not be allowed to add specialization of class templates
! <tt>unary_function</tt> and <tt>binary_function</tt>, in force of 17.6.3.2.1 [namespace.std]/1.
! If a program were allowed to specialize these templates, the library could no
! longer rely on them to provide the intended typedefs or there might be other
! undesired interactions.
  </p>
  
  <p><i>[
- 2010-03-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
! Accepting issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1290">1290</a> would resolve this issue as NAD editorial.
! </blockquote>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
  <blockquote>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3145.html">n3145</a> would resolve this issue as NAD editorial.
  </blockquote>
  
  <p><i>[
! 2010 Batavia: Solved by N3198
  ]</i></p>
  
  
  <p>
! Previous proposed resolution:
! </p><p>
! Change paragraph X [base]/1 as follows:
  </p>
  
  <blockquote>
! 1 The following <del>classes</del> <ins>class templates</ins> are provided to
! simplify the typedefs of the argument and result types<del>:</del><ins>. A
! program shall not declare specializations of these templates.</ins>
  </blockquote>
  
! <p></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! Addressed by paper <a href="http://wiki.dinkumware.com/twiki/pub/Wg21batavia/LibraryWorkingGroup/D3198.html">D3198</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1297"></a>1297. <tt>unique_ptr</tt>'s relational operator functions should induce a total order</h3>
! <p><b>Section:</b> 20.9.9.4 [unique.ptr.special] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-12-23 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The comparison functions of <tt>unique_ptr</tt> currently directly delegate to
! the underlying comparison functions of <tt>unique_ptr&lt;T, D&gt;::pointer</tt>.
! This is disadvantageous, because this would not guarantee to induce a total
! ordering for native pointers and it is hard to define a total order for mixed
! types anyway.
  </p>
  <p>
! The currently suggested resolution for <tt>shared_ptr</tt> comparison as of
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1262">1262</a> uses a normalization strategy: They perform the comparison on
! the <em>composite pointer type</em> (5.9 [expr.rel]). This is not
! exactly possible for <tt>unique_ptr</tt> in the presence of user-defined
! pointer-like types but the existing definition of <tt>std::duration</tt>
! comparison as of 20.11.3.6 [time.duration.comparisons] via
! <tt>common_type</tt> of both argument types demonstrates a solution of this
! problem. The approach can be seen as the general way to define a <em>composite
! pointer type</em> and this is the approach which is used for here suggested
! wording change.
  </p>
  <p>
! For consistency reasons I would have preferred the same normalization strategy
! for <tt>==</tt> and <tt>!=</tt>, but Howard convinced me not to do so (now).
  </p>
  
  <p><i>[
! 2010-11-03 Daniel comments and adjustes the currently proposed wording changes:
  ]</i></p>
  
  
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1401">1401</a> is remotely related. <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1401_extra_bullet">Bullet A</a> of its proposed resolution 
! provides an alternative solution for issue discussed here and addresses NB comment GB-99.
! Additionally I updated the below suggested wording in regard to the following:
! It is an unncessary requirement that the below defined effective composite pointer-like
! type <tt>CT</tt> satisfies the <tt>LessThanComparable</tt> requirements. All what is 
! needed is, that the function object type <tt>less&lt;CT&gt;</tt> induces a strict
! weak ordering on the pointer values.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 20.9.9.4 [unique.ptr.special]/4-7 as indicated: <i>[The implicit
! requirements and remarks imposed on the last three operators are the same as for
! the first one due to the normative "equivalent to" usage within a Requires
! element, see 17.5.1.4 [structure.specifications]/4. The effects of this
! change are that all real pointers wrapped in a <tt>unique_ptr</tt> will order
! like <tt>shared_ptr</tt> does.]</i>
  </p>
  
! <blockquote><pre>template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
! </pre>
  
- <blockquote>
  <p>
! <ins>? <i>Requires:</i> Let <tt>CT</tt> be <tt>common_type&lt;unique_ptr&lt;T1,
! D1&gt;::pointer, unique_ptr&lt;T2, D2&gt;::pointer&gt;::type</tt>. Then
! the specialization <tt>less&lt;CT&gt;</tt> shall be a function object type ([function.objects]) 
! that induces a strict weak ordering ([alg.sorting]) on the pointer values.</ins>
  </p>
  
  <p>
! 4 <i>Returns:</i> <tt><ins>less&lt;CT&gt;()(x.get(), y.get())</ins><del>x.get()
! &lt; y.get()</del></tt>.
  </p>
  
  <p>
! <ins>? <i>Remarks:</i> If <tt>unique_ptr&lt;T1, D1&gt;::pointer</tt> is not
! implicitly convertible to <tt>CT</tt> or <tt>unique_ptr&lt;T2,
! D2&gt;::pointer</tt> is not implicitly convertible to <tt>CT</tt>, the program
! is ill-formed.</ins>
  </p>
- </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
  <blockquote>
! 5 <ins><i>Effects:</i> Equivalent to <tt>return !(y &lt; x)</tt></ins>
! <del><i>Returns:</i> <tt>x.get() &lt;= y.get()</tt></del>.
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
! </pre>
  
  <blockquote>
! 6 <ins><i>Effects:</i> Equivalent to <tt>return (y &lt; x)</tt></ins>
! <del><i>Returns:</i> <tt>x.get() &gt; y.get()</tt></del>.
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
! </pre>
  
  <blockquote>
! 7 <ins><i>Effects:</i> Equivalent to <tt>return !(x &lt; y)</tt></ins>
! <del><i>Returns:</i> <tt>x.get() &gt;= y.get()</tt></del>.
  </blockquote>
  </blockquote>
  
  
  
  
  
  
  <hr>
! <h3><a name="1310"></a>1310. <tt>forward_list splice_after</tt> from lvalues</h3>
! <p><b>Section:</b> 23.3.3.5 [forwardlist.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Tentatively Ready</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-02-05 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively Ready">Tentatively Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! We've moved <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a> to Tentatively Ready and I'm fine with that.
  </p>
  
  <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a> adds lvalue-references to the <tt>splice</tt> signatures for <tt>list</tt>.  So now
! <tt>list</tt> can <tt>splice</tt> from lvalue and rvalue lists (which was the intent of the
! original move papers btw).  During the discussion of this issue it was mentioned
! that if we want to give the same treatment to <tt>forward_list</tt>, that should be a
! separate issue.
  </p>
  
  <p>
! This is that separate issue.
  </p>
  
  <p>
! Consider the following case where you want to splice elements from one place in
! a <tt>forward_list</tt> to another.  Currently this must be coded like so:
  </p>
  
! <blockquote><pre>fl.splice_after(to_here, std::move(fl), from1, from2);
  </pre></blockquote>
  
  <p>
! This looks pretty shocking to me.  I would expect to be able to code instead:
  </p>
  
! <blockquote><pre>fl.splice_after(to_here, fl, from1, from2);
  </pre></blockquote>
  
  <p>
! but we currently don't allow it.
  </p>
  
  <p>
! When I say <tt>move(fl)</tt>, I consider that as saying that I don't care about
! the value of <tt>fl</tt> any more (until I assign it a new value).  But in the
! above example, this simply isn't true.  I do care about the value of <tt>fl</tt>
! after the move, and I'm not assigning it a new value.  I'm merely permuting its
! current value.
  </p>
  
  <p>
! I propose adding <tt>forward_list&amp;</tt> overloads to the 3
! <tt>splice_after</tt> members.  For consistency's sake (principal of least
! surprise) I'm also proposing to overload <tt>merge</tt> this way as well.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to the synopsis of 23.3.3 [forwardlist]:
  </p>
  
! <blockquote><pre>template &lt;class T, class Allocator = allocator&lt;T&gt; &gt;
! class forward_list {
! public:
!   ...
!   <ins>void splice_after(const_iterator p, forward_list&amp; x);</ins>
!   void splice_after(const_iterator p, forward_list&amp;&amp; x);
!   <ins>void splice_after(const_iterator p, forward_list&amp; x, const_iterator i);</ins>
!   void splice_after(const_iterator p, forward_list&amp;&amp; x, const_iterator i);
!   <ins>void splice_after(const_iterator p, forward_list&amp; x,
!                     const_iterator first, const_iterator last);</ins>
!   void splice_after(const_iterator p, forward_list&amp;&amp; x,
!                     const_iterator first, const_iterator last);
!   ...
!   <ins>void merge(forward_list&amp; x);</ins>
!   void merge(forward_list&amp;&amp; x);
!   <ins>template &lt;class Compare&gt; void merge(forward_list&amp; x, Compare comp);</ins>
!   template &lt;class Compare&gt; void merge(forward_list&amp;&amp; x, Compare comp);
!   ...
! };
  </pre></blockquote>
  
  <p>
! Add to the signatures of 23.3.3.5 [forwardlist.ops]:
  </p>
  
  <blockquote>
! <pre><ins>void splice_after(const_iterator p, forward_list&amp; x);</ins>
! void splice_after(const_iterator p, forward_list&amp;&amp; x);
! </pre>
! <blockquote>
! <p>1 ...</p>
  </blockquote>
  
- <pre><ins>void splice_after(const_iterator p, forward_list&amp; x, const_iterator i);</ins>
- void splice_after(const_iterator p, forward_list&amp;&amp; x, const_iterator i);
- </pre>
  <blockquote>
! <p>5 ...</p>
  </blockquote>
  
! <pre><ins>void splice_after(const_iterator p, forward_list&amp; x,
!                 const_iterator first, const_iterator last);</ins>
! void splice_after(const_iterator p, forward_list&amp;&amp; x,
!                 const_iterator first, const_iterator last);
  </pre>
  <blockquote>
! <p>9 ...</p>
  </blockquote>
  
! <pre><ins>void merge(forward_list&amp; x);</ins>
! void merge(forward_list&amp;&amp; x);
! <ins>template &lt;class Compare&gt; void merge(forward_list&amp; x, Compare comp);</ins>
! template &lt;class Compare&gt; void merge(forward_list&amp;&amp; x, Compare comp);
  </pre>
  <blockquote>
! <p>18 ...</p>
  </blockquote>
  
  </blockquote>
  
  
  
--- 5839,8690 ----
  
  
  <hr>
! <h3><a name="1289"></a>1289. Generic casting requirements for smart pointers</h3>
! <p><b>Section:</b> 20.2 [utility] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Ion Gazta&ntilde;aga <b>Opened:</b> 2009-12-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#utility">active issues</a> in [utility].</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility">issues</a> in [utility].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In section 17.6.3.5 [allocator.requirements], Table 40 &mdash; Allocator requirements,
! the following expression is required for allocator pointers:
  </p>
  
! <blockquote>
! <table border="1">
! <caption>Table 40 &mdash; Allocator requirements</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
! <th>Default</th>
! </tr>
! <tr>
! <td><tt>static_cast&lt;X::pointer&gt;(w)</tt></td>
! <td><tt>X::pointer</tt></td>
! <td><tt>static_cast&lt;X::pointer&gt;(w) == p</tt></td>
! <td>&nbsp;</td>
! </tr>
! </table>
! </blockquote>
  
  <p>
! To achieve this expression, a smart pointer writer must introduce an explicit
! conversion operator from <tt>smart_ptr&lt;void&gt;</tt> to
! <tt>smart_ptr&lt;T&gt;</tt> so that
! <tt>static_cast&lt;pointer&gt;(void_ptr)</tt> is a valid expression.
! Unfortunately this explicit conversion weakens the safety of a smart pointer
! since the following expression (invalid for raw pointers) would become valid:
  </p>
  
+ <blockquote><pre>
+ smart_ptr&lt;void&gt; smart_v = ...;
+ smart_ptr&lt;T&gt; smart_t(smart_v);
+ </pre></blockquote>
+ 
  <p>
! On the other hand, <tt>shared_ptr</tt> also defines its own casting functions in
! 20.8.2.2.9 [util.smartptr.shared.cast], and although it's unlikely that a
! programmer will use <tt>shared_ptr</tt> as <tt>allocator::pointer</tt>, having
! two different ways to do the same cast operation does not seem reasonable. A
! possible solution would be to replace <tt>static_cast&lt;X::pointer&gt;(w)</tt>
! expression with a user customizable (via ADL)
! <tt>static_pointer_cast&lt;value_type&gt;(w)</tt>, and establish the
! <tt>xxx_pointer_cast</tt> functions introduced by <tt>shared_ptr</tt> as the
! recommended generic casting utilities of the standard.
  </p>
  
! <p>
! Unfortunately, we've experienced problems in Boost when trying to establish
! <tt>xxx_pointer_cast</tt> as customization points for generic libraries (<a
! href="http://objectmix.com/c/40424-adl-lookup-explicit-template-parameters.html"
! >http://objectmix.com/c/40424-adl-lookup-explicit-template-parameters.html</a>)
! because these casting functions are called with explicit template parameters and
! the standard says in 14.8.1 [temp.arg.explicit] p.8 "Explicit template
! argument specification":
! </p>
  
! <blockquote><p>
! 8 ...But when a function template with explicit template arguments is used, the
! call does not have the correct syntactic form unless there is a function
! template with that name visible at the point of the call. If no such name is
! visible, the call is not syntactically well-formed and argument-dependent lookup
! does not apply.
! </p></blockquote>
  
  <p>
! So we can do this:
  </p>
  
! <blockquote><pre>
! template&lt;class BasePtr&gt;
! void generic_ptr_swap(BasePtr p)
! {
!   //ADL customization point
!   swap(p, p);
!   //...
! }
! </pre></blockquote>
  
+ <p>
+ but not the following:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;class BasePtr&gt;
+ void generic_ptr_algo(BasePtr p)
+ {
+   typedef std::pointer_traits&lt;BasePtr&gt;::template
+      rebind&lt;Derived&gt; DerivedPtr;
+   DerivedPtr dp = static_pointer_cast&lt;Derived&gt;(p);
+ }
+ </pre></blockquote>
  
  <p>
! The solution to make <tt>static_pointer_cast</tt> a customization point is to
! add a generic declaration (no definition) of <tt>static_pointer_cast</tt> in a
! namespace (like <tt>std</tt>) and apply "<tt>using
! std::static_pointer_cast</tt>" declaration to activate ADL:
  </p>
  
+ <blockquote><pre>
+ namespace std{
  
! template&lt;typename U, typename T&gt;
! <i>unspecified</i>
! static_pointer_cast(T&amp;&amp;) = delete;
  
+ }
  
+ template&lt;class BasePtr&gt;
+ void generic_ptr_algo(BasePtr p)
+ {
+   typedef std::pointer_traits&lt;BasePtr&gt;::template
+      rebind&lt;Derived&gt; DerivedPtr;
  
+   //ADL applies because static_pointer_cast is made
+   //  visible according to [temp.arg.explicit]/8
+   using std::static_pointer_cast;
  
+   DerivedPtr dp = static_pointer_cast&lt;Derived&gt;(p);
+ 
+   //...
+ }
+ </pre></blockquote>
  
  <p>
! A complete solution will need also the definition of
! <tt>static_pointer_cast</tt> for raw pointers, and this definition has been
! present in Boost (<a
! href="http://www.boost.org/boost/pointer_cast.hpp">http://www.boost.org/boost/
! pointer_cast.hpp</a>) for years.
  </p>
  
  <p><i>[
! 2010-03-26 Daniel made editorial adjustments to the proposed wording.
  ]</i></p>
  
  
  <p><i>[
! Moved to NAD Future at 2010-11 Batavia
  ]</i></p>
  
+ <blockquote><p>
+ This is a new feature rather than a defect. 
+ It can be added later: "this is such a hairy area that people will put up with changes"
+ </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to section 20.2 [utility] Utility components, Header
! <tt>&lt;utility&gt;</tt> synopsis:
  </p>
  
+ <blockquote><pre>
+ // 20.3.X, generic pointer cast functions
+ 
+ template&lt;typename U, typename T&gt;
+ <i>unspecified</i>
+ static_pointer_cast(T&amp;&amp;) = delete;
+ 
+ template&lt;typename U, typename T&gt;
+ <i>unspecified</i>
+ dynamic_pointer_cast(T&amp;&amp;) = delete;
+ 
+ template&lt;typename U, typename T&gt;
+ <i>unspecified</i>
+ const_pointer_cast(T&amp;&amp;) = delete;
+ 
+ //Overloads for raw pointers
+ template&lt;typename U, typename T&gt;
+ auto static_pointer_cast(T* t) -&gt; decltype(static_cast&lt;U*&gt;(t));
+ 
+ template&lt;typename U, typename T&gt;
+ auto dynamic_pointer_cast(T* t) -&gt; decltype(dynamic_cast&lt;U*&gt;(t));
+ 
+ template&lt;typename U, typename T&gt;
+ auto const_pointer_cast(T* t) -&gt; decltype(const_cast&lt;U*&gt;(t));
+ </pre></blockquote>
+ 
  <p>
! Add to section 20.2 [utility] Utility components, a new subclause
! 20.3.X Pointer cast utilities [pointer.cast]:
  </p>
  
! <blockquote>
! <p>
! 20.3.X Pointer cast utilities [pointer.cast]
! </p>
  
  <p>
! 1 The library defines generic pointer casting function templates so that template code
! can explicitly make these names visible and activate argument-dependent lookup
! for pointer cast calls.
! </p>
! 
! <pre>
! //Generic declarations
! template&lt;typename U, typename T&gt;
! <i>unspecified</i>
! static_pointer_cast(T&amp;&amp;) = delete;
! 
! template&lt;typename U, typename T&gt;
! <i>unspecified</i>
! dynamic_pointer_cast(T&amp;&amp;) = delete;
! 
! template&lt;typename U, typename T&gt;
! <i>unspecified</i>
! const_pointer_cast(T&amp;&amp;) = delete;
! </pre>
! 
! <p>
! 2 The library also defines overloads of these functions for raw pointers.
! </p>
! 
! <pre>
! //Overloads for raw pointers
! template&lt;typename U, typename T&gt;
! auto static_pointer_cast(T* t) -&gt; decltype(static_cast&lt;U*&gt;(t));
! </pre>
! 
! <blockquote><p>
! <i>Returns:</i> <tt>static_cast&lt;U*&gt;(t)</tt>
! </p></blockquote>
! 
! <pre>
! template&lt;typename U, typename T&gt;
! auto dynamic_pointer_cast(T* t) -&gt; decltype(dynamic_cast&lt;U*&gt;(t));
! </pre>
! 
! <blockquote><p>
! <i>Returns:</i> <tt>dynamic_cast&lt;U*&gt;(t)</tt>
! </p></blockquote>
! 
! <pre>
! template&lt;typename U, typename T&gt;
! auto const_pointer_cast(T* t) -&gt; decltype(const_cast&lt;U*&gt;(t));
! </pre>
! 
! <blockquote><p>
! <i>Returns:</i> <tt>const_cast&lt;U*&gt;(t)</tt>
! </p></blockquote>
! 
! <p>
! [<i>Example:</i>
! </p>
! 
! <blockquote><pre>
! #include &lt;utility&gt; //static_pointer_cast
! #include &lt;memory&gt;  //pointer_traits
! 
! class Base{};
! class Derived : public Base{};
! 
! template&lt;class BasePtr&gt;
! void generic_pointer_code(BasePtr b)
! {
!    typedef std::pointer_traits&lt;BasePtr&gt;::template
!       rebind&lt;Derived&gt; DerivedPtr;
! 
!    using std::static_pointer_cast;
!    //ADL applies now that static_pointer_cast is visible
!    DerivedPtr d = static_pointer_cast&lt;Derived&gt;(b);
! }
! </pre></blockquote>
! 
! <p>
! &mdash; <i>end example</i>]
  </p>
  
  </blockquote>
  
  <p>
! Replace in section 17.6.3.5 [allocator.requirements] Table 40 &mdash; Allocator
! requirements, the following table entries for allocator pointers:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 40 &mdash; Allocator requirements</caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
! <th>Default</th>
  </tr>
  
  <tr>
! <td><tt>static<ins>_pointer</ins>_cast&lt;<del>X::pointer</del><ins>T</ins>&gt;(w)</tt></td>
! <td><tt>X::pointer</tt></td>
! <td><tt>static<ins>_pointer</ins>_cast&lt;<del>X::pointer</del><ins>T</ins>&gt;(w) == p</tt></td>
! <td>&nbsp;</td>
  </tr>
  
  <tr>
! <td><tt>static<ins>_pointer</ins>_cast&lt;<del>X::const_pointer</del><ins>const T</ins>&gt;(w)</tt></td>
! <td><tt>X::const_pointer</tt></td>
! <td><tt>static<ins>_pointer</ins>_cast&lt;<del>X::const_pointer</del><ins>const T</ins>&gt;(z) == q</tt></td>
! <td>&nbsp;</td>
  </tr>
  
! </table>
! </blockquote>
  
  
  
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1317"></a>1317. make_hash</h3>
+ <p><b>Section:</b> 20.9.13 [unord.hash] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Nicolai M. Josuttis <b>Opened:</b> 2010-02-10 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#unord.hash">active issues</a> in [unord.hash].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! Currently, the library lacks a convenient way to provide a hash function that
! can be used with the provided unordered containers to allow the usage of non
! trivial element types.
  </p>
  
! <p>
! While we can easily declare an
! </p>
! 
! <blockquote><pre>
! std::unordered_set&lt;int&gt;
! </pre></blockquote>
  
  <p>
! or
  </p>
  
! <blockquote><pre>
! std::unordered_set&lt;std::string&gt;
! </pre></blockquote>
  
  <p>
! we have no easy way to declare an <tt>unordered_set</tt> for a user defined
! type. IMO, this is a big obstacle to use unordered containers in practice. Note
! that in Java, the wide usage of <tt>HashMap</tt> is based on the fact that there
! is always a default hash function provided.
  </p>
  
  <p>
! Of course, a default hash function implies the risk to provide poor hash
! functions. But often even poor hash functions are good enough.
  </p>
  
  <p>
! While I really would like to see a default hash function, I don't propose it
! here because this would probably introduce a discussion that's too big for this
! state of C++0x.
  </p>
  
  <p>
! However, I strongly suggest at least to provide a convenience variadic template
! function <tt>make_hash&lt;&gt;()</tt> to allow an easy definition of a (possibly
! poor) hash function.
  </p>
  
  <p>
! As a consequence for a user-defined type such as
! </p>
! 
! <blockquote><pre>
! class Customer {
!    friend class CustomerHash;
!    private:
!      string firstname;
!      string lastname;
!      long   no;
!    ...
!  };
! </pre></blockquote>
! 
! <p>
! would allow to specify:
! </p>
! 
! <blockquote><pre>
! class CustomerHash : public std::unary_function&lt;Customer, std::size_t&gt;
! {
!   public:
!     std::size_t operator() (const Customer&amp; c) const  {
!        return make_hash(c.firstname,c.lastname,c.no);
!     }
! };
! </pre></blockquote>
! 
! <p>
! instead of:
! </p>
! 
! <blockquote><pre>
! class CustomerHash : public std::unary_function&lt;Customer, std::size_t&gt;
! {
!   public:
!     std::size_t operator() (const Customer&amp; c) const  {
!        return std::hash&lt;std::string&gt;()(c.firstname) +
!               std::hash&lt;std::string&gt;()(c.lastname) +
!               std::hash&lt;long&gt;()(c.no);
!     }
! };
! </pre></blockquote>
! 
! <p>
! Note that, in principle, we can either specify that
! </p>
! 
! <blockquote><p>
! <tt>make_hash</tt> returns the sum of a call of
! <tt>std::hash&lt;T&gt;()(x)</tt> for each argument <tt>x</tt> of type
! <tt>T</tt>
! </p></blockquote>
! 
! <p>
! or we can specify that
! </p>
! 
! <blockquote><p>
! <tt>make_hash</tt> provides a hash value for each argument, for which a
! <tt>std::hash()</tt> function is provided
! </p></blockquote>
! 
! <p>
! with the possible note that the hash value may be poor or only a good hash value
! if the ranges of all passed arguments is equally distributed.
! </p>
! 
! <p>
! For my convenience, I propose wording that describes
! the concrete implementation.
! </p>
! 
! <p><i>[
! 2010 Pittsburgh:  Moved to NAD Editorial, rationale added below.
! ]</i></p>
! 
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! There is no consensus to make this change at this time.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! In Function objects 20.9 [function.objects]
! in paragraph 2 at the end of the Header <tt>&lt;functional&gt;</tt> synopsis
! insert:
! </p>
! 
! <blockquote><pre>
! // convenience functions
! template &lt;class T&gt;
!   size_t make_hash (const T&amp;);
! template &lt;class T, class... Types&gt;
!   size_t make_hash (const T&amp;, const Types&amp;...);
! </pre></blockquote>
! 
! <p>
! In Class template hash 20.9.13 [unord.hash]
! add:
  </p>
  
  <blockquote>
! <p>
! <b>20.7.16.1 Hash creation functions [hash.creation]</b>
! </p>
! 
! <pre>
! template &lt;class T&gt;
!   size_t make_hash (const T&amp; val);
! </pre>
! 
! <blockquote><p>
! <i>Returns:</i> <tt>hash&lt;T&gt;()(val);</tt>
! </p></blockquote>
! 
! <pre>
! template &lt;class T, class... Types&gt;
!   size_t make_hash (const T&amp; val, const Types&amp;... args);
! </pre>
! 
! <blockquote><p>
! <i>Returns:</i> <tt>hash&lt;T&gt;()(val) + std::make_hash(args...)</tt>
! </p></blockquote>
! 
  </blockquote>
  
  
  
  
  
+ 
  <hr>
! <h3><a name="1320"></a>1320. Header for <tt>iter_swap</tt></h3>
! <p><b>Section:</b> 24.3 [iterator.synopsis] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-02-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.synopsis">issues</a> in [iterator.synopsis].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The <tt>iter_swap</tt> function template appears in the
! <tt>&lt;algorithm&gt;</tt> header, yet its main use is in building further
! algorithms, not calling existing ones. The main clients are implementers of data
! structures and their iterators, so it seems most appropriate to place the
! template in the <tt>&lt;iterator&gt;</tt> header instead.
! </p>
! 
! <p>
! Note that this is not an issue for implementers of the standard library, as they
! rarely use the standard headers directly, designing a more fine-grained set of
! headers for their own internal use.  This option is not available to customers
! of the standard library.
! </p>
! 
! <p>
! Note that we cannot remove <tt>iter_swap</tt> from <tt>&lt;algorithm&gt;</tt>
! without breaking code, but there is no reason we cannot offer the same
! declaration via two standard headers.  Alternatively, require
! <tt>&lt;algorithm&gt;</tt> to <tt>#include &lt;iterator&gt;</tt>, but
! introducing the dependency on the iterator adaptors seems un-necessary.
  </p>
  
  <p><i>[
  ]</i></p>
  
  
! <p>
! Discussed possibly moving to <tt>&lt;utility&gt;</tt> but don't like that. Some not seeing this 
! as a defect, and want to keep it in <tt>&lt;algorithm&gt;</tt>. No one seems to feel strongly 
! about moving to <tt>&lt;iterator&gt;</tt>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>
! Add the declaration of <tt>iter_swap</tt> to the <tt>&lt;iterator&gt;</tt>
! header synopsis (24.3 [iterator.synopsis]), with a note that it is
! documented in clause 25 [algorithms].
! </p>
! 
! <blockquote><pre>
! ...
! template &lt;class T, size_t N&gt; T* end(T (&amp;array)[N]);
! 
! <ins><i>// documented in 25 [algorithms]</i>
! template&lt;class ForwardIterator1, class ForwardIterator2&gt;
!   void iter_swap(ForwardIterator1 a, ForwardIterator2 b);</ins>
! </pre></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1396"></a>1396. <tt>regex</tt> should support allocators</h3>
! <p><b>Section:</b> 28.8 [re.regex] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.regex">issues</a> in [re.regex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1451">1451</a></p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-104, US-141</b></p>
! <p>
! <tt>std::basic_regex</tt> should have an allocator for all the
! reasons that a <tt>std::string</tt> does. For example, I can use
! <tt>boost::interprocess</tt> to put a <tt>string</tt> or <tt>vector</tt>
! in shared memory, but not a <tt>regex</tt>.
! </p>
! 
! <p><i>[
! Resolution proposed by ballot comment
! ]</i></p>
! 
! <p>
! Add allocators to regexes
! </p>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
+ <blockquote><p>
+ Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3171.pdf">n3171</a> 
+ would solve this issue.
+ </p></blockquote>
+ 
+ <p><i>[2011-03-22 Madrid]</i></p>
+ 
+ 
+ <p>Close 1396 as NAD Future.</p>
+ 
+ 
+ <p><b>Rationale:</b></p><p>No consensus for a change at this time</p>
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1406"></a>1406. Support hashing smart-pointers based on <i>owner</i></h3>
+ <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses JP-5</b></p>
+ <p>
+ Hash support based on ownership sharing should be
+ supplied for <tt>shared_ptr</tt> and <tt>weak_ptr</tt>.
+ For two <tt>shared_ptr</tt> objects <tt>p</tt> and <tt>q</tt>, two distinct
+ equivalence relations can be defined. One is based on
+ equivalence of pointer values, which is derived from the
+ expression <tt>p.get() == q.get()</tt> (hereafter called <i>address based
+ equivalence relation</i>), the other is based on
+ equivalence of ownership sharing, which is derived from
+ the expression <tt>!p.owner_before(q) &amp;&amp; !q.owner_before(p)</tt>
+ (hereafter called <i>ownership-based equivalence relation</i>).
+ These two equivalence relations are independent in
+ general. For example, a <tt>shared_ptr</tt> object created by the
+ constructor of the signature <tt>shared_ptr(shared_ptr&lt;U>
+ const &amp;, T *)</tt> could reveal a difference between these two
+ relations. Therefore, hash support based on each
+ equivalence relation should be supplied for <tt>shared_ptr</tt>.
+ However, while the standard library provides the hash
+ support for address-based one (20.9.11.6 paragraph 2), it
+ lacks the hash support for ownership-based one. In
+ addition, associative containers work well in combination
+ with the <tt>shared_ptr</tt>'s ownership-based comparison but
+ unordered associative containers don't. This is
+ inconsistent.
+ </p>
+ <p>
+ For the case of <tt>weak_ptr</tt>, hash support for the ownership based
+ equivalence relation can be safely defined on
+ <tt>weak_ptr</tt>s, and even on expired ones. The absence of
+ hash support for the ownership-based equivalence
+ relation is fatal, especially for expired <tt>weak_ptr</tt>s. And the
+ absence of such hash support precludes some quite
+ effective use-cases, e.g. erasing the <tt>unordered_map</tt> entry
+ of an expired <tt>weak_ptr</tt> key from a customized deleter
+ supplied to <tt>shared_ptr</tt>s.
+ </p>
+ <p>
+ Hash support for the ownership-based equivalence
+ relation cannot be provided by any user-defined manner
+ because information about ownership sharing is not
+ available to users at all. Therefore, the only way to provide
+ ownership-based hash support is to offer it intrusively by
+ the standard library.
+ </p>
+ <p>
+ As far as we know, such hash support is implementable.
+ Typical implementation of such hash function could return
+ the hash value of the pointer of the counter object that is
+ internally managed by <tt>shared_ptr</tt> and <tt>weak_ptr</tt>.
+ </p>
+ 
+ <p><i>[2010 Rapperswil:]</i></p>
+ 
  <blockquote>
! <p>No consensus to make this change at this time.</p>
  </blockquote>
  
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add the following non-static member functions to
+ <tt>shared_ptr</tt> and <tt>weak_ptr</tt> class template;
+ </p>
+ <p>
+ Update [util.smartptr.shared], 20.9.11.2 paragraph 1
+ </p>
+ <pre>
+ namespace std{
+ template&lt;class T&gt; class shared_ptr {
+ public:
+ ...
+   <ins>size_t owner_hash() const;</ins>
+ ...
+ };
+ }
+ </pre>
+ <p>
+ Update [util.smartptr.weak], 20.9.11.3 paragraph 1
+ </p>
+ <pre>
+ namespace std{
+ template&lt;class T&gt; class weak_ptr {
+ public:
+ ...
+   <ins>size_t owner_hash() const;</ins>
+ ...
+ };
+ }
+ </pre>
+ <p>
+ These functions satisfy the following
+ requirements. Let <tt>p</tt> and <tt>q</tt> be objects of either
+ <tt>shared_ptr</tt> or <tt>weak_ptr</tt>, <tt>H</tt> be a hypothetical
+ function object type that satisfies the hash
+ requirements ([hash.requirements], 20.2.4) and <tt>h</tt> be an object of the
+ type <tt>H</tt>. The expression <tt>p.owner_hash()</tt> behaves
+ as if it were equivalent to the expression <tt>h(p)</tt>. In
+ addition, <tt>h(p) == h(q)</tt> must become <tt>true</tt> if <tt>p</tt> and
+ <tt>q</tt> share ownership.
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1422"></a>1422. <tt>vector&lt;bool&gt;</tt> iterators are not random access</h3>
+ <p><b>Section:</b> 23.3.7 [vector.bool] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-118</b></p>
+ <p>
+ <tt>vector&lt;bool&gt;</tt> iterators are not random access iterators
+ because their reference type is a special class, and not
+ <tt>bool &amp;</tt>. All standard libary operations taking iterators
+ should treat this iterator as if it was a random access iterator, rather
+ than a simple input iterator.
+ </p>
+ 
  <p><i>[
! Resolution proposed in ballot comment
  ]</i></p>
  
+ <p>
+ Either revise the iterator requirements to support proxy iterators
+ (restoring functionality that was lost when the Concept facility was
+ removed) or add an extra paragraph to the <tt>vector&lt;bool&gt;</tt>
+ specification requiring the library to treat <tt>vector&lt;bool&gt;</tt>
+ iterators as-if they were random access iterators, despite having the wrong
+ reference type.
+ </p>
+ 
+ <p><i>[
+ Rapperswil Review
+ ]</i></p>
  
  <p>
! The consensus at Rapperswil is that it is too late for full support for
! proxy iterators, but requiring the library to respect <tt>vector&lt;bool&gt;</tt>
! iterators as-if they were random access would be preferable to flagging
! this container as deliberately incompatible with standard library algorithms.
! </p>
! <p>
! Alisdair to write the note, which may become normative <i>Remark</i> depending
! on the preferences of the project editor.
! </p>
! 
! <p><i>[
! Post-Rapperswil Alisdair provides wording
! ]</i></p>
! 
! <p>
! Initial wording is supplied, deliberately using <i>Note</i> in preference to
! <i>Remark</i> although the author notes his preference for <i>Remark</i>.  The
! issue of whether <tt>iterator_traits&lt;vector&lt;bool&gt;&gt;::iterator_category</tt>
! is permitted to report <tt>random_access_iterator_tag</tt> or must report 
! <tt>input_iterator_tag</tt> is not addressed.
  </p>
  
+ <p><i>[
+ Old Proposed Resolution:
+ ]</i></p>
+ 
  <blockquote>
! <p>
! Insert a new paragraph into 23.3.7 [vector.bool] between p4 and p5:
! </p>
! <blockquote><p>
! [<i>Note</i> All functions in the library that take a pair of iterators to
! denote a range shall treat <tt>vector&lt;bool&gt;</tt> iterators as-if they were
! random access iterators, even though the <tt>reference</tt> type is not a
! true reference.<i>-- end note</i>]
! </p></blockquote>
  </blockquote>
  
! <p><i>[
! 2010-11 Batavia:
! ]</i></p>
! 
! <blockquote><p>
! Closed as NAD Future, because the current iterator categories cannot correctly describe
! <tt>vector&lt;bool&gt;::iterator</tt>. But saying that they are Random Access Iterators
! is also incorrect, because it is not too hard to create a corresponding test that fails.
! We should deal with the more general proxy iterator problem in the future, and see no
! benefit to take a partial workaround specific to <tt>vector&lt;bool&gt;</tt> now.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! No consensus to make this change at this time.
! </p>
  
  
  
  
  
  <hr>
! <h3><a name="1459"></a>1459. Overlapping evaluations are allowed</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Canada <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.order">active issues</a> in [atomics.order].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1458">1458</a></p>
  <p><b>Discussion:</b></p>
+ <p><b>Addresses CA-21, GB-131</b></p>
  <p>
! 29.4 [atomics.lockfree] p.8 states:
  </p>
+ <blockquote><p>
+ An atomic store shall only store a value that has
+ been computed from constants and program input values
+ by a finite sequence of program evaluations, such
+ that each evaluation observes the values of variables
+ as computed by the last prior assignment in the
+ sequence.
+ </p></blockquote>
  <p>
! ... but 1.9 [intro.execution] p.13 states:
  </p>
+ <blockquote><p>
+ If A is not sequenced before B and B is not
+ sequenced before A, then A and B are unsequenced.
+ [ <em>Note</em>: The execution of unsequenced
+ evaluations can overlap. &mdash; <em>end note</em> ]
+ </p></blockquote>
  <p>
! Overlapping executions can make it impossible to
! construct the sequence described in 29.4 [atomics.lockfree] p.8. We are not
! sure of the intention here and do not offer a suggestion for
! change, but note that 29.4 [atomics.lockfree] p.8 is the condition that prevents
! out-of-thin-air reads.
! </p>
! <p>
! For an example, suppose we have a function invocation
! f(e1,e2). The evaluations of e1 and e2 can overlap.
! Suppose that the evaluation of e1 writes y and reads x
! whereas the evaluation of e2 reads y and writes x, with
! reads-from edges as below (all this is within a single
! thread).
! </p>
! <pre>
!  e1           e2
! Wrlx y--   --Wrlx x
!       rf\ /rf
!          X
!         / \
! Rrlx x&lt;-   -&gt;Rrlx y
! </pre>
! <p>
! This seems like it should be allowed, but there seems to
! be no way to produce a sequence of evaluations with the
! property above.
! </p>
! <p>
! In more detail, here the two evaluations, e1 and e2, are
! being executed as the arguments of a function and are
! consequently not sequenced-before each other. In
! practice we'd expect that they could overlap (as allowed
! by 1.9 [intro.execution] p.13), with the two writes taking effect before the two
! reads. However, if we have to construct a linear order of
! evaluations, as in 29.4 [atomics.lockfree] p.8, then the execution above is not
! permited. Is that really intended?
  </p>
  
  <p><i>[
! Resolution proposed by ballot comment
! ]</i></p>
! 
! <p>
! Please clarify.
! </p>
! 
! <p><i>[2011-03-09 Hans comments:]</i></p>
! 
! 
! <p>I'm not proud of 29.3 [atomics.order] p9 (formerly p8), and I agree with the comments that this
! isn't entirely satisfactory. 29.3 [atomics.order] p9 was designed to preclude
! out-of-thin-air results for races among <tt>memory_order_relaxed</tt> atomics, in spite of 
! the fact that Java experience has shown we don't really know how to do that adequately. In 
! the long run, we probably want to revisit this.
! <p/>
! However, in the short term, I'm still inclined to declare this NAD, for two separate reasons:
! </p>
! 
! <ol>
! <li><p>1.9 [intro.execution] p15 states: "If a side effect on a scalar
! object is unsequenced relative to either another side
! effect on the same scalar object or a value computation
! using the value of the same scalar object, the behavior is undefined."
! I think the examples presented here have undefined behavior as a result.
! It's not completely clear to me whether examples can be constructed
! that exhibit this problem, and don't have undefined behavior.</p></li>
! 
! <li><p>This comment seems to be using a different meaning of "evaluation"
! from what is used elsewhere in the standard. The sequence of evaluations
! here doesn't have to consist of full expression evaluations.  They
! can be evaluations of operations like lvalue to rvalue conversion,
! or individual assignments. In particular, the reads and writes
! executed by <tt>e1</tt> and <tt>e2</tt> in the example could be treated as separate
! evaluations for purposes of producing the sequence.
! The definition of "sequenced before" in 1.9 [intro.execution] makes
! little sense if the term "evaluation" is restricted to any notion
! of complete expression. Perhaps we should add yet another note
! to clarify this?  29.3 [atomics.order] p10 probably leads to 
! the wrong impression here.
! <p/>
! An alternative resolution would be to simply delete our flakey
! attempt at preventing out-of-thin-air reads, by removing 29.3 [atomics.order] p9-11,
! possibly adding a note that explains that we technically allow,
! but strongly discourage them. If we were starting this from scratch
! now, that would probably be my preference.  But it seems like too drastic
! a resolution at this stage.
! </p></li>
! </ol>
! 
! <p><i>[2011-03-24 Madrid]</i></p>
! 
! <p>
! Moved to NAD Future
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1484"></a>1484. Need a way to join a thread with a timeout</h3>
! <p><b>Section:</b> 30.3.1 [thread.thread.class] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-183</b></p>
! 
! <p>
! There is no way to join a thread with a timeout.
! </p>
! 
! <p><i>[
! Resolution proposed by ballot comment:
  ]</i></p>
  
+ <blockquote><p>
+ Add <tt>join_for</tt> and <tt>join_until</tt>. Or decide one should
+ never join a thread with a timeout since <tt>pthread_join</tt> doesn't have a 
+ timeout version.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Batavia
+ ]</i></p>
  
  <p>
! The concurrency working group deemed this an extension beyond the scope of C++0x.
  </p>
+ <p><b>Rationale:</b></p><p>The LWG does not wish to make a change at this time.</p>
+ 
  
  
  <p><b>Proposed resolution:</b></p>
  
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1488"></a>1488. Improve interoperability between the C++0x and C1x threads APIs</h3>
+ <p><b>Section:</b> 30.4 [thread.mutex] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.mutex">issues</a> in [thread.mutex].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses US-185</b></p>
+ 
  <p>
! Cooperate with WG14 to improve interoperability between
! the <tt>C++0x</tt> and <tt>C1x</tt> threads APIs. In particular, <tt>C1x</tt>
! mutexes should be conveniently usable with a <tt>C++0x</tt>
! <tt>lock_guard</tt>. Performance overheads for this combination
! should be considered.
  </p>
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <blockquote><p>
! Remove <tt>C++0x</tt> <tt>timed_mutex</tt> and
! <tt>timed_recursive_mutex</tt> if that facilitates
! development of more compatible APIs.
! </p></blockquote>
! 
! <p><i>[
! 2010 Batavia
! ]</i></p>
  
  <p>
! The concurrency sub-group reviewed the options, and decided that closer harmony should wait until both standards are published.
  </p>
  
+ <p><b>Rationale:</b></p>
  <p>
! The LWG does not wish to make any change at this time.
  </p>
  
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1493"></a>1493. Add <tt>mutex</tt>, <tt>recursive_mutex</tt>, <tt>is_locked</tt> function</h3>
+ <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses US-189</b></p>
+ 
  <p>
! <tt>mutex</tt> and <tt>recursive_mutex</tt> should have an <tt>is_locked()</tt>
! member function. <tt>is_locked</tt> allows a user to test a lock
! without acquiring it and can be used to implement a lightweight
! <tt>try_try_lock</tt>.
  </p>
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <blockquote><p>
! Add a member function:
! </p>
! <pre>
! bool is_locked() const;
  </pre>
+ <p>
+ to <tt>std::mutex</tt> and <tt>std::recursive_mutex</tt>. These
+ functions return true if the current thread would
+ not be able to obtain a mutex. These functions do
+ not synchronize with anything (and, thus, can
+ avoid a memory fence).
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Batavia
+ ]</i></p>
+ 
+ <p>
+ The Concurrency subgroup reviewed this issue and deemed it to be an extension to be handled after publishing C++0x.
+ </p>
+ 
+ <p><b>Rationale:</b></p><p>The LWG does not wish to make a change at this time.</p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1499"></a>1499. Condition variables preclude wakeup optimization</h3>
+ <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses US-193</b></p>
+ 
+ <p>
+ Condition variables preclude a wakeup optimization.
+ </p>
+ 
+ <p><i>[
+ Resolution proposed by ballot comment:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Change condition_variable to allow such
+ optimization. See Appendix 1 - Additional Details
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Batavia
+ ]</i></p>
+ 
+ <p>
+ The Concurrency subgroup reviewed the issue, and deemed it an extension to be handled after C++0x.
+ </p>
+ 
+ <p><b>Rationale:</b></p><p>The LWG does not wish to make the change at this time.</p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1521"></a>1521. Requirements on internal pointer representations in containers</h3>
+ <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Mike Spertus <b>Opened:</b> 2010-10-16 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses US-104, US-141</b></p>
+ 
+ <p>
+ The standard doesn't say that containers should use abstract pointer 
+ types internally. Both Howard and Pablo agree that this is the intent. 
+ Further, it is necessary for containers to be stored, for example, in 
+ shared memory with an interprocess allocator (the type of scenario that 
+ allocators are intended to support).
+ </p>
+ <p>
+ In spite of the (possible) agreement on intent, it is necessary to make 
+ this explicit:
+ </p>
+ <p>
+ An implementations may like to store the result of dereferencing the 
+ pointer (which is a raw reference) as an optimization, but that prevents 
+ the data structure from being put in shared memory, etc. In fact, a 
+ container could store raw references to the allocator, which would be a 
+ little weird but conforming as long as it has one by-value copy. 
+ Furthermore, pointers to locales, ctypes, etc. may be there, which also 
+ prevents the data structure from being put in shared memory, so we 
+ should make explicit that a container does not store raw pointers or 
+ references at all.
+ </p>
+ 
+ <p><i>[
+ Pre-batavia
+ ]</i></p>
+ 
+ <p>
+ This issue is being opened as part of the response to NB comments US-104/141. 
+ See paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3171.pdf">N3171</a>
+ in the pre-Batavia mailing. 
+ </p>
+ 
+ <p><i>[2011-03-23 Madrid meeting]</i></p>
+ 
+ 
+ <p>Deferred</p>
+ 
+ <p><i>[
+ 2011 Batavia
+ ]</i></p>
+ 
+ 
+ <p>
+ This may be an issue, but it is not clear.  We want to gain a few years experience
+ with the C++11 allocator model to see if this is already implied by the existing
+ specification.
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add to the end of 23.2.1 [container.requirements.general] p. 8:
+ </p>
+ <blockquote><p>
+ [..] In all container types defined in this Clause, the member <tt>get_allocator()</tt> returns 
+ a copy of the allocator used to construct the container or, if that allocator has been replaced, 
+ a copy of the most recent replacement. <ins>The container may not store internal objects whose 
+ types are of the form  <tt>T *</tt> or <tt>T &amp;</tt> except insofar as they are part of the 
+ item type or members.</ins>
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2035"></a>2035. Output iterator requirements are broken</h3>
+ <p><b>Section:</b> 24.2.4 [output.iterators] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-02-27 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#output.iterators">active issues</a> in [output.iterators].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#output.iterators">issues</a> in [output.iterators].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>During the Pittsburgh meeting the proposal <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>
+ became accepted because it fixed several severe issues related to the iterator specification. But the current working draft (N3225)
+ does not reflect all these changes. Since I'm unaware whether every correction can be done editorial, this issue is submitted to take
+ care of that. To give one example: All expressions of Table 108 &mdash; &quot;Output iterator requirements&quot; have a post-condition
+ that the iterator is incrementable. This is impossible, because it would exclude any finite sequence that is accessed by an output 
+ iterator, such as a pointer to a C array. The N3066 wording changes did not have these effects.
+ </p>
+ 
+ <p><i>[2011-03-01: Daniel comments:]</i></p>
+ 
+ 
+ <p>This issue has some overlap with the issue <a href="lwg-active.html#2038">2038</a> and I would prefer if we
+ could solve both at one location. I suggest the following approach:
+ </p>
+ <ol>
+ <li><p>The terms <tt><i>dereferencable</i></tt> and <tt><i>incrementable</i></tt> could be defined in a more
+ general way not restricted to iterators (similar to the concepts <tt>HasDereference</tt> and 
+ <tt>HasPreincrement</tt> from working draft N2914). But on the other hand, all current usages of 
+ <tt><i>dereferencable</i></tt> and <tt><i>incrementable</i></tt> are involved with types that satisfy 
+ iterator requirements. Thus, I believe that it is sufficient for C++0x to add corresponding definitions to 
+ 24.2.1 [iterator.requirements.general] and to let all previous usages of these terms refer to this 
+ sub-clause. Since the same problem occurs with the past-the-end iterator, this proposal suggest providing 
+ similar references to usages that precede its definition as well.
+ </p></li>
+ <li><p>We also need to ensure that all iterator expressions get either an operational semantics in
+ terms of others or we need to add missing pre- and post-conditions. E.g. we have the following
+ ones without semantics:
+ </p><blockquote><pre>
+ *r++ = o // output iterator
+ *r--     // bidirectional iterator
+ </pre></blockquote><p>
+ According to the <a href="http://www.sgi.com/tech/stl/OutputIterator.html">SGI specification</a>
+ these correspond to
+ </p><blockquote><pre>
+ { *r = o; ++r; }                         // output iterator
+ { reference tmp = *r; --r; return tmp; } // bidirectional iterator
+ </pre></blockquote><p>
+ respectively. Please note especially the latter expression for bidirectional iterator. It fixes a problem
+ that we have for forward iterator as well: Both these iterator categories provide stronger guarantees
+ than input iterator, because the result of the dereference operation is <tt>reference</tt>, and <strong>not</strong>
+ only convertible to the value type (The exact form from the SGI documentation does not correctly refer to
+ <tt>reference</tt>).
+ </p></li>
+ </ol>
+ 
+ <p><i>[2011-03-14: Daniel comments and updates the suggested wording]</i></p>
+ 
+ 
+ <p>In addition to the before mentioned necessary changes there is another one need, which
+ became obvious due to issue <a href="lwg-defects.html#2042">2042</a>: <tt>forward_list&lt;&gt;::before_begin()</tt> returns
+ an iterator value which is not dereferencable, but obviously the intention is that it should
+ be incrementable. This leads to the conclusion that imposing dereferencable as a requirement
+ for the expressions <tt>++r</tt> is wrong: We only need the iterator to be incrementable. A
+ similar conclusion applies to the expression <tt>--r</tt> of bidirectional iterators.</p>
+ 
+ <p><i>[
+ 2011 Bloomington
+ ]</i></p>
+ 
+ 
+ <p>
+ Consensus this is the correct direction, but there are (potentially) missing <i>incrementable</i>
+ preconditions on some table rows, and the Remarks on when an output iterator becomes dereferencable
+ are probably better handled outside the table, in a manner similar to the way we word for input
+ iterators.
+ </p>
+ 
+ <p>
+ There was some concern about redundant pre-conditions when the operational semantic is defined in
+ terms of operations that have preconditions, and a similar level of concern over dropping such
+ redundancies vs. applying a consistent level of redundant specification in all the iterator tables.
+ Wording clean-up in either direction would be welcome.
+ </p>
+ 
+ <p><i>[2011-08-18: Daniel adapts the proposed resolution to honor the Bloomington request]</i></p>
+ 
+ 
+ <p>
+ There is only a small number of further changes suggested to get rid of superfluous 
+ requirements and essentially non-normative assertions. Operations should not have extra 
+ pre-conditions, if defined by "in-terms-of" semantics, see e.g. <tt>a != b</tt> or <tt>a-&gt;m</tt> 
+ for Table 107. Further, some remarks, that do not impose anything or say nothing new have been removed, 
+ because I could not find anything helpful they provide.
+ E.g. consider the remarks for Table 108 for the operations dereference-assignment and
+ preincrement: They don't provide additional information say nothing surprising. With the
+ new pre-conditions <em>and</em> post-conditions it is implied what the remarks intend to say.
+ </p>
+ 
+ <p><i>[
+ 2011-11-03: Some observations from Alexander Stepanov via c++std-lib-31405
+ ]</i></p>
+ 
+ 
+ <p>
+ The following sentence is dropped from the standard section on OutputIterators:
+ <p/>
+ "In particular, the following two conditions should hold: first, any
+ iterator value should be assigned through before it is incremented
+ (this is, for an output iterator <tt>i, i++; i++;</tt> is not a valid code
+ sequence); second, any value of an output iterator may have at most
+ one active copy at any given time (for example, <tt>i = j; *++i = a; *j = b;</tt> 
+ is not a valid code sequence)."
+ </p>
+ 
+ <p><i>[
+ 2011-11-04: Daniel comments and improves the wording
+ ]</i></p>
+ 
+ 
+ <p>
+ In regard to the first part of the comment, the intention of the newly proposed wording 
+ was to make clear that for the expression
+ </p>
+ <blockquote><pre>
+ *r = o
+ </pre></blockquote>
+ <p>
+ we have the precondition dereferenceable and the post-condition
+ incrementable. And for the expression
+ </p>
+ <blockquote><pre>
+ ++r
+ </pre></blockquote>
+ <p>
+ we have the precondition incrementable and the post-condition dereferenceable 
+ or past-the-end. This <em>should not</em>  allow for a sequence like <tt>i++; i++;</tt> 
+ but I agree that it doesn't exactly say that.
+ <p/>
+ In regard to the second point: To make this point clearer, I suggest to
+ add a similar additional wording as we already have for input iterator to the 
+ "Assertion&#47;note" column of the expression <tt>++r</tt>:
+ <p/>
+ "Post: any copies of the previous value of <tt>r</tt> are no longer 
+ required to be dereferenceable or incrementable."
+ <p/>
+ The proposed has been updated to honor the observations of Alexander Stepanov.
+ </p>
+ 
+ <p><i>[2015-02 Cologne]</i></p>
+ 
+ <p>
+ The matter is complicated, Daniel volunteers to write a paper.
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li><p>Add a reference to 24.2.1 [iterator.requirements.general] to the following parts of the
+ library preceding Clause 24 Iterators library: (I stopped from 23.2.5 [unord.req] on, because
+ the remaining references are the concrete containers)</p>
+ <ol>
+ <li><p>17.6.3.2 [swappable.requirements] p5:</p>
+ 
+ <blockquote><p>
+ -5- A type <tt>X</tt> satisfying any of the iterator requirements (24.2) is <tt><i>ValueSwappable</i></tt> if, 
+ for any dereferenceable <ins>(24.2.1 [iterator.requirements.general])</ins> object <tt>x</tt> of type 
+ <tt>X</tt>, <tt>*x</tt> is swappable.
+ </p></blockquote>
+ </li>
+ 
+ <li><p>17.6.3.5 [allocator.requirements], Table 27 &mdash; &quot;Descriptive variable definitions&quot;, 
+ row with the expression <tt>c</tt>:</p>
+ 
+ <blockquote><p>
+ a dereferenceable <ins>(24.2.1 [iterator.requirements.general])</ins> pointer of type <tt>C*</tt>
+ </p></blockquote>
+ 
+ </li>
+ 
+ <li><p>20.7.3.2 [pointer.traits.functions]:</p>
+ <blockquote><p>
+ <i>Returns</i>: The first template function returns a dereferenceable <ins>(24.2.1 [iterator.requirements.general])</ins> 
+ pointer to <tt>r</tt> obtained by calling <tt>Ptr::pointer_to(r)</tt>;  [&hellip;]
+ </p></blockquote>
+ </li>
+ 
+ <li><p>21.4.3 [string.iterators] p. 2:</p>
+ <blockquote><p>
+ <i>Returns</i>: An iterator which is the past-the-end value <ins>(24.2.1 [iterator.requirements.general])</ins>.
+ </p></blockquote>
+ </li>
+ 
+ <li><p>22.4.5.1.2 [locale.time.get.virtuals] p. 11:</p>
+ <blockquote><pre>
+ iter_type do_get(iter_type s, iter_type end, ios_base&amp; f,
+   ios_base::iostate&amp; err, tm *t, char format, char modifier) const;
+ </pre><blockquote><p>
+ <i>Requires</i>: <tt>t</tt> shall be dereferenceable <ins>(24.2.1 [iterator.requirements.general])</ins>.
+ </p></blockquote></blockquote>
+ </li>
+ 
+ <li><p>23.2.1 [container.requirements.general] p. 6:</p>
+ 
+ <blockquote><p>
+ [&hellip;]  <tt>end()</tt> returns an iterator which is the past-the-end <ins>(24.2.1 [iterator.requirements.general])</ins> 
+ value for the container.  [&hellip;]
+ </p></blockquote>
+ </li>
+ 
+ <li><p>23.2.3 [sequence.reqmts] p. 3:</p>
+ 
+ <blockquote><p>
+ [&hellip;]  <tt>q</tt> denotes a valid dereferenceable <ins>(24.2.1 [iterator.requirements.general])</ins> 
+ const iterator to <tt>a</tt>,  [&hellip;]
+ </p></blockquote>
+ </li>
+ 
+ <li><p>23.2.4 [associative.reqmts] p. 8 (I omit intentionally one further reference in the same sub-clause):</p>
+ 
+ <blockquote><p>
+ [&hellip;]  <tt>q</tt> denotes a valid dereferenceable <ins>(24.2.1 [iterator.requirements.general])</ins> 
+ const iterator to <tt>a</tt>,  [&hellip;]
+ </p></blockquote>
+ </li>
+ 
+ <li><p>23.2.5 [unord.req] p. 10 (I omit intentionally one further reference in the same sub-clause):</p>
+ 
+ <blockquote><p>
+ [&hellip;]  <tt>q</tt> and <tt>q1</tt> are valid dereferenceable <ins>(24.2.1 [iterator.requirements.general])</ins> 
+ const iterators to <tt>a</tt>,  [&hellip;]
+ </p></blockquote>
+ </li>
+ </ol>
+ 
+ </li>
+ <li><p>Edit 24.2.1 [iterator.requirements.general] p. 5 as indicated (The intent is to properly define
+ <i>incrementable</i> and to ensure some further library guarantee related to past-the-end iterator values):</p>
+ 
+ <blockquote><p>
+ -5- Just as a regular pointer to an array guarantees that there is a pointer value pointing past the last element
+ of the array, so for any iterator type there is an iterator value that points past the last element of a
+ corresponding sequence. These values are called <i>past-the-end values</i>. Values of an iterator <tt>i</tt> for which the
+ expression <tt>*i</tt> is defined are called <i>dereferenceable</i>. <ins>Values of an iterator <tt>i</tt> for which the
+ expression <tt>++i</tt> is defined are called <i>incrementable</i>. </ins> The library never assumes that 
+ past-the-end values are dereferenceable <ins>or incrementable</ins>. Iterators can also have singular values 
+ that are not associated with any sequence. [&hellip;]
+ </p></blockquote>
+ </li>
+ 
+ <li><p>Modify the column contents of Table 106 &mdash; &quot;Iterator requirements&quot;, 
+ 24.2.2 [iterator.iterators], as indicated:</p>
  
  <blockquote>
! <table border="1">
! <caption>Table 106 &mdash; Iterator requirements</caption>
! 
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational semantics</th>
! <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
! </tr>
! 
! <tr>
! <td><tt>*r</tt></td>
! <td><tt>reference</tt></td>
! <td><tt>&nbsp;</tt></td>
! <td>pre: <tt>r</tt> is dereferenceable.</td>
! </tr>
! 
! <tr>
! <td><tt>++r</tt></td>
! <td><tt>X&amp;</tt></td>
! <td><tt>&nbsp;</tt></td>
! <td><ins>pre: <tt>r</tt> is incrementable.</ins></td>
! </tr>
! 
! </table>
  </blockquote>
+ </li>
  
! <li><p>Modify the column contents of Table 107 &mdash; &quot;Input iterator requirements&quot;, 
! 24.2.3 [input.iterators], as indicated [<i>Rationale</i>: The wording changes attempt
! to define a minimal "independent" set of operations, namely <tt>*a</tt> and <tt>++r</tt>, and 
! to specify the semantics of the remaining ones. This approach seems to be in agreement with the 
! original <a href="http://www.sgi.com/tech/stl/InputIterator.html">SGI specification</a> 
! &mdash; <i>end rationale</i>]:</p>
  
  <blockquote>
! <table border="1">
! <caption>Table 107 &mdash; Input iterator requirements (in addition to Iterator)</caption>
! 
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational semantics</th>
! <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
! </tr>
! 
! <tr>
! <td><tt>a != b</tt></td>
! <td>contextually<br/>
! convertible to <tt>bool</tt></td>
! <td><tt>!(a == b)</tt></td>
! <td><del>pre: <tt>(a, b)</tt> is in the domain<br/>
! of <tt>==</tt>.</del>
! </td>
! </tr>
! 
! <tr>
! <td><tt>*a</tt></td>
! <td>convertible to <tt>T</tt></td>
! <td><tt>&nbsp;</tt></td>
! <td>pre: <tt>a</tt> is dereferenceable.<br/>
! The expression<br/>
! <tt>(void)*a, *a</tt> is equivalent<br/>
! to <tt>*a</tt>.<br/>
! If <tt>a == b</tt> and <tt>(a,b)</tt> is in<br/>
! the domain of <tt>==</tt> then <tt>*a</tt> is<br/>
! equivalent to <tt>*b</tt>.
! </td>
! </tr>
! 
! <tr>
! <td><tt>a-&gt;m</tt></td>
! <td><tt>&nbsp;</tt></td>
! <td><tt>(*a).m</tt></td>
! <td><del>pre: <tt>a</tt> is dereferenceable.</del></td>
! </tr>
! 
! <tr>
! <td><tt>++r</tt></td>
! <td><tt>X&amp;</tt></td>
! <td><tt>&nbsp;</tt></td>
! <td>pre: <tt>r</tt> is <del>dereferenceable</del><ins>incrementable</ins>.<br/>
! post: <tt>r</tt> is dereferenceable or<br/>
! <tt>r</tt> is past-the-end.<br/>
! post: any copies of the<br/>
! previous value of <tt>r</tt> are no<br/>
! longer required either to be<br/>
! dereferenceable<ins>, incrementable,</ins><br/>
! or to be in the domain of <tt>==</tt>.
! </td>
! </tr>
! 
! <tr>
! <td><tt>(void)r++</tt></td>
! <td><tt>&nbsp;</tt></td>
! <td><ins><tt>(void)++r</tt></ins></td>
! <td><del>equivalent to <tt>(void)++r</tt></del></td>
! </tr>
! 
! <tr>
! <td><tt>*r++</tt></td>
! <td>convertible to <tt>T</tt></td>
! <td><tt>{ T tmp = *r;<br/>
! ++r;<br/>
! return tmp; }
! </tt></td>
! <td><tt>&nbsp;</tt></td>
! </tr>
! 
! </table>
  </blockquote>
+ </li>
  
! <li>
! <p>Modify the column contents of Table 108 &mdash; &quot;Output iterator requirements&quot;, 
! 24.2.4 [output.iterators], as indicated [<i>Rationale</i>: The wording changes attempt
! to define a minimal "independent" set of operations, namely <tt>*r = o</tt> and <tt>++r</tt>,
! and to specify the semantics of the remaining ones. This approach seems to be in agreement with
! the original <a href="http://www.sgi.com/tech/stl/OutputIterator.html">SGI specification</a> 
! &mdash; <i>end rationale</i>]:</p>
  
  <blockquote>
! <table border="1">
! <caption>Table 108 &mdash; Output iterator requirements (in addition to Iterator)</caption>
! 
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational semantics</th>
! <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
! </tr>
! 
! <tr>
! <td><tt>*r = o</tt></td>
! <td>result is not used</td>
! <td><tt>&nbsp;</tt></td>
! <td><ins>pre: <tt>r</tt> is dereferenceable.</ins><br/>
! <i>Remark</i>: After this operation<br/>
! <tt>r</tt> is not required to be<br/>
! dereferenceable <ins>and any copies of<br/>
! the previous value of <tt>r</tt> are no<br/>
! longer required to be dereferenceable<br/>
! or incrementable.</ins><br/>
! post: <tt>r</tt> is incrementable.
! </td>
! </tr>
! 
! <tr>
! <td><tt>++r</tt></td>
! <td><tt>X&amp;</tt></td>
! <td><tt>&nbsp;</tt></td>
! <td><ins>pre: <tt>r</tt> is incrementable.</ins><br/>
! <tt>&amp;r == &amp;++r</tt>.<br/>
! <del><i>Remark</i>: After this operation<br/>
! <tt>r</tt> is not required to be<br/>
! dereferenceable.<br/></del>
! <ins><i>Remark</i>: After this operation<br/>
! <tt>r</tt> is not required to be<br/>
! incrementable and any copies of<br/>
! the previous value of <tt>r</tt> are no<br/>
! longer required to be dereferenceable<br/>
! or incrementable.</ins><br/>
! post: <tt>r</tt> is <ins>dereferenceable<br/>
! or <tt>r</tt> is past-the-end</ins><del>incrementable</del>.<br/>
! </td>
! </tr>
! 
! <tr>
! <td><tt>r++</tt></td>
! <td>convertible to <tt>const X&amp;</tt></td>
! <td><tt>{ X tmp = r;<br/>
!   ++r;<br/>
!   return tmp; }</tt>
! </td>
! <td><del><i>Remark</i>: After this operation<br/>
! <tt>r</tt> is not required to be<br/>
! dereferenceable.<br/>
! post: <tt>r</tt> is incrementable.</del>
! </td>
! </tr>
! 
! <tr>
! <td><tt>*r++ = o</tt></td>
! <td>result is not used</td>
! <td><ins><tt>{ *r = o; ++r; }</tt></ins></td>
! <td><del><i>Remark</i>: After this operation<br/>
! <tt>r</tt> is not required to be<br/>
! dereferenceable.<br/>
! post: <tt>r</tt> is incrementable.</del>
! </td>
! </tr>
! </table>
  </blockquote>
+ </li>
+ 
+ <li><p>Modify the column contents of Table 109 &mdash; &quot;Forward iterator requirements&quot;, 
+ 24.2.5 [forward.iterators], as indicated [<i>Rationale</i>: Since the return type of the
+ expression <tt>*r++</tt> is now guaranteed to be type <tt>reference</tt>, the implied operational
+ semantics from input iterator based on value copies is wrong &mdash; <i>end rationale</i>]</p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 109 &mdash; Forward iterator requirements (in addition to input iterator)</caption>
+ 
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Operational semantics</th>
+ <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
+ </tr>
+ 
+ <tr>
+ <td><tt>r++</tt></td>
+ <td>convertible to <tt>const X&amp;</tt></td>
+ <td><tt>{ X tmp = r;<br/>
+   ++r;<br/>
+   return tmp; }</tt>
+ </td>
+ <td><tt>&nbsp;</tt></td>
+ </tr>
+ 
+ <tr>
+ <td><tt>*r++</tt></td>
+ <td>reference</td>
+ <td><ins><tt>{ reference tmp = *r;<br/>
+  ++r;<br/> 
+  return tmp; }</tt></ins></td>
+ <td><tt>&nbsp;</tt></td>
+ </tr>
+ </table>
  </blockquote>
  
+ </li>
+ 
+ <li><p>Modify the column contents of Table 110 &mdash; &quot;Bidirectional iterator requirements&quot;, 
+ 24.2.6 [bidirectional.iterators], as indicated:</p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 110 &mdash; Bidirectional iterator requirements (in addition to forward iterator)</caption>
+ 
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Operational semantics</th>
+ <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
+ </tr>
+ 
+ <tr>
+ <td><tt>--r</tt></td>
+ <td><tt>X&amp;</tt></td>
+ <td><tt>&nbsp;</tt></td>
+ <td>pre: there exists <tt>s</tt> such that<br/>
+ <tt>r == ++s</tt>.<br/>
+ post: <tt>r</tt> is <del>dereferenceable</del><ins>incrementable</ins>.<br/>
+ <tt>--(++r) == r</tt>.<br/>
+ <tt>--r == --s</tt> implies <tt>r == s</tt>.<br/>
+ <tt>&amp;r == &amp;--r</tt>.
+ </td>
+ </tr>
+ 
+ <tr>
+ <td><tt>r--</tt></td>
+ <td>convertible to <tt>const X&amp;</tt></td>
+ <td><tt>{ X tmp = r;<br/>
+   --r;<br/>
+   return tmp; }</tt>
+ </td>
+ <td><tt>&nbsp;</tt></td>
+ </tr>
+ 
+ <tr>
+ <td><tt>*r--</tt></td>
+ <td>reference</td>
+ <td><ins><tt>{ reference tmp = *r;<br/>
+  --r;<br/> 
+  return tmp; }</tt></ins></td>
+ <td><tt>&nbsp;</tt></td>
+ </tr>
+ </table>
+ </blockquote>
+ </li>
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2038"></a>2038. Missing definition for <tt>incrementable</tt> iterator</h3>
! <p><b>Section:</b> 24.2.4 [output.iterators] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2011-02-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#output.iterators">active issues</a> in [output.iterators].</p>
! <p><b>View all other</b> <a href="lwg-index.html#output.iterators">issues</a> in [output.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! 
! <p>In comp.lang.c++, Vicente Botet raises the following questions:</p>
! 
! <blockquote><p>
! &quot;In "24.2.4 Output iterators" there are 3 uses of incrementable. I've
! not found the definition. Could some one point me where it is defined?
! <p/>
! Something similar occurs with dereferenceable. While the definition is
! given in "24.2.1 In general" it is used several times before.
! <p/>
! Shouldn't these definitions be moved to some previous section?&quot;
! </p></blockquote>
! 
! <p>He's right: both terms are used without being properly defined.
! <p/>
! There is no definition of "incrementable".
! <p/>
! While there is a definition of "dereferenceable", it is, in fact, a definition of 
! "dereferenceable iterator". "dereferenceable" is used throughout Clause 23 (Containers) 
! before its definition in Clause 24. In almost all cases it's referring to iterators, 
! but in 17.6.3.2 [swappable.requirements] there is a mention of "dereferenceable object"; in 
! 17.6.3.5 [allocator.requirements] the table of Descriptive variable definitions refers to a 
! "dereferenceable pointer"; 20.7.3.2 [pointer.traits.functions] refers to a 
! "dereferenceable pointer"; in 22.4.5.1.2 [locale.time.get.virtuals]&#47;11 (<tt>do_get</tt>) 
! there is a requirement that a pointer "shall be dereferenceable". In those specific cases 
! it is not defined.
  </p>
  
+ <p><i>[2011-03-02: Daniel comments:]</i></p>
+ 
+ 
+ <p>I believe that the currently proposed resolution of issue <a href="lwg-active.html#2035">2035</a> solves this
+ issue as well.</p>
+ 
+ <p><i>[
+ 2011 Bloomington
+ ]</i></p>
+ 
+ 
  <p>
! Agree with Daniel, this will be handled by the resolution of <a href="lwg-active.html#2035">2035</a>.
  </p>
  
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2040"></a>2040. Missing type traits related to <tt>is_convertible</tt></h3>
+ <p><b>Section:</b> 20.10 [meta] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-03-03 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>When <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>
+ was suggested, it concentrated on constructions, assignments, and destructions, but overlooked 
+ to complement the single remaining compiler-support trait</p>
+ 
+ <blockquote><pre>
+ template &lt;class From, class To&gt; struct is_convertible;
+ </pre></blockquote>
+ 
+ <p>with the no-throw and triviality related aspects as it had been done with the other
+ expression-based traits. Specifically, the current specification misses to add the
+ following traits:
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class From, class To&gt; struct is_nothrow_convertible;
+ template &lt;class From, class To&gt; struct is_trivially_convertible;
+ </pre></blockquote>
+ 
+ <p>In particular the lack of <tt>is_nothrow_convertible</tt> is severly restricting. This
+ was recently recognized when the proposal for <tt>decay_copy</tt> was prepared by 
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3255.html">n3255</a>.
+ There does not exist a portable means to define the correct conditional <tt>noexcept</tt>
+ specification for the <tt>decay_copy</tt> function template, which is declared as:</p>
+ 
+ <blockquote><pre>
+ template &lt;class T&gt; 
+ typename decay&lt;T&gt;::type decay_copy(T&amp;&amp; v) noexcept(<i>???</i>);
+ </pre></blockquote>
+ 
+ <p>The semantics of <tt>decay_copy</tt> bases on an implicit conversion which again
+ influences the overload set of functions that are viable here. In most circumstances
+ this will have the same effect as comparing against the trait 
+ <tt>std::is_nothrow_move_constructible</tt>, but there is no guarantee for that being
+ the right answer. It is possible to construct examples, where this would lead
+ to the false result, e.g.</p>
+ 
+ <blockquote><pre>
+ struct S {
+   S(const S&amp;) noexcept(false);
+  
+   template&lt;class T&gt;
+   explicit S(T&amp;&amp;) noexcept(true);
+ };
+ </pre></blockquote>
+ 
+ <p><tt>std::is_nothrow_move_constructible</tt> will properly honor the explicit template
+ constructor because of the direct-initialization context which is part of the
+ <tt>std::is_constructible</tt> definition and will in this case select it, such that
+ <tt>std::is_nothrow_move_constructible&lt;S&gt;::value == true</tt>, but if we had
+ the traits <tt>is_nothrow_convertible</tt>, <tt>is_nothrow_convertible&lt;S, S&gt;::value</tt>
+ would evaluate to <tt>false</tt>, because it would use the copy-initialization context
+ that is part of the <tt>is_convertible</tt> definition, excluding any explicit
+ constructors and giving the opposite result.</p>
+ 
+ <p>The <tt>decay_copy</tt> example is surely not one of the most convincing examples, but
+ <tt>is_nothrow_convertible</tt> has several use-cases, and can e.g. be used to express
+ whether calling the following implicit conversion function could throw an exception or not:</p>
+ 
+ <blockquote><pre>
+ template&lt;class T, class U&gt;
+ T implicit_cast(U&amp;&amp; u) noexcept(is_nothrow_convertible&lt;U, T&gt;::value) 
+ {
+   return std::forward&lt;U&gt;(u);
+ }
+ </pre></blockquote>
+ 
+ <p>Therefore I suggest to add the missing trait <tt>is_nothrow_convertible</tt> and for
+ completeness also the missing trait <tt>is_trivially_convertible</tt> to 20.10 [meta].</p>
+ 
+ <p><i>[2011-03-24 Madrid meeting]</i></p>
+ 
+ 
  <p>
! Daniel K: This is a new feature so out of scope.
! <p/>
! Pablo: Any objections to moving 2040 to Open?
! <p/>
! No objections. 
  </p>
  
+ <p><i>[Bloomington, 2011]</i></p>
+ 
  <p>
! Move to NAD Future, this would be an extension to existing functionality.
  </p>
  
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>Ammend the following declarations to the header <tt>&lt;type_traits&gt;</tt> synopsis
! in 20.10.2 [meta.type.synop]:</p>
! 
! <blockquote><pre>
! namespace std {
!   &hellip;
!   // 20.9.6, type relations:
!   template &lt;class T, class U&gt; struct is_same;
!   template &lt;class Base, class Derived&gt; struct is_base_of;
!   template &lt;class From, class To&gt; struct is_convertible;
!   <ins>template &lt;class From, class To&gt; struct is_trivially_convertible;</ins>
!   <ins>template &lt;class From, class To&gt; struct is_nothrow_convertible;</ins>
! 
!   &hellip;
! }
  </pre></blockquote>
+ </li>
+ 
+ <li><p>Modify Table 51 &mdash; &quot;Type relationship predicates&quot; as indicated. The removal of the
+ remaining traces of the trait <tt>is_explicitly_convertible</tt> is an editorial
+ step, it was removed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3047.html">n3047</a>:
+ </p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 51 &mdash; Type relationship predicates</caption>
+ 
+ <tr>
+ <th>Template</th>
+ <th>Condition</th>
+ <th>Comments</th>
+ </tr>
+ 
+ <tr>
+ <td colspan="3" style="text-align:center;">&hellip;</td> 
+ </tr>
+ 
+ <tr>
+ <td><tt>template &lt;class From, class To&gt;<br/>
+ struct is_convertible;</tt></td>
+ <td><i>see below</i></td>
+ <td><tt>From</tt> and <tt>To</tt> shall be complete<br/>
+ types, arrays of unknown bound, or<br/>
+ (possibly cv-qualified) <tt>void</tt><br/>
+ types.</td>
+ </tr>
+ 
+ <tr>
+ <td><del><tt>template &lt;class From, class To&gt;<br/>
+ struct is_explicitly_convertible;</tt></del></td>
+ <td><del><tt>is_constructible&lt;To, From&gt;::value</tt></del></td>
+ <td><del>a synonym for a two-argument<br/>
+ version of <tt>is_constructible</tt>.<br/>
+ An implementation may define it<br/>
+ as an alias template.</del></td>
+ </tr>
+ 
+ <tr>
+ <td><ins><tt>template &lt;class From, class To&gt;<br/>
+ struct is_trivially_convertible;</tt></ins></td>
+ <td><ins><tt>is_convertible&lt;From,<br/>
+  To&gt;::value</tt> is <tt>true</tt> and the<br/>
+ conversion, as defined by<br/>
+ <tt>is_convertible</tt>, is known<br/>
+ to call no operation that is<br/>
+ not trivial ([basic.types], [special]).</ins></td>
+ <td><ins><tt>From</tt> and <tt>To</tt> shall be complete<br/>
+ types, arrays of unknown bound,<br/>
+ or (possibly cv-qualified) <tt>void</tt><br/>
+ types.</ins></td>
+ </tr>
+ 
+ <tr>
+ <td><ins><tt>template &lt;class From, class To&gt;<br/>
+ struct is_nothrow_convertible;</tt></ins></td>
+ <td><ins><tt>is_convertible&lt;From,<br/>
+  To&gt;::value</tt> is <tt>true</tt> and the<br/>
+ conversion, as defined by<br/>
+ <tt>is_convertible</tt>, is known<br/>
+ not to throw any<br/>
+ exceptions ([expr.unary.noexcept]).</ins></td>
+ <td><ins><tt>From</tt> and <tt>To</tt> shall be complete<br/>
+ types, arrays of unknown bound,<br/>
+ or (possibly cv-qualified) <tt>void</tt><br/>
+ types.</ins></td>
+ </tr>
+ 
+ <tr>
+ <td colspan="3" style="text-align:center;">&hellip;</td> 
+ </tr>
+ 
+ </table>
+ </blockquote>
+ 
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
  
+ <hr>
+ <h3><a name="2051"></a>2051. Explicit <tt>tuple</tt> constructors for more than one parameter</h3>
+ <p><b>Section:</b> 20.4.2 [tuple.tuple], 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Ville Voutilainen <b>Opened:</b> 2011-05-01 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#tuple.tuple">issues</a> in [tuple.tuple].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! One of my constituents wrote the following:
! <p/>
! -------snip------------
! <p/>
! So far the only use I've found for <tt>std::tuple</tt> is as an ad-hoc type to emulate
! multiple return values. If the tuple ctor was made non-explicit one could
! almost think C++ supported multiple return values especially when combined
! with <tt>std::tie()</tt>.
  </p>
+ <blockquote><pre>
+ // assume types line_segment and point
+ // assume function double distance(point const&amp;, point const&amp;)
  
! std::tuple&lt;point, point&gt;
! closest_points(line_segment const&amp; a, line_segment const&amp; b) {
!  point ax;
!  point bx;
!  /* some math */
! 
!  return {ax, bx};
! }
! 
! 
! double
! distance(line_segment const&amp; a, line_segment const&amp; b) {
!  point ax;
!  point bx;
!  std::tie(ax, bx) = closest_points(a, b);
! 
!  return distance(ax, bx);
! }
  </pre></blockquote>
+ <p>
+ -------snap----------
+ <p/>
+ See also the messages starting from lib-29330.
+ <p/>
+ Some notes:
+ </p>
+ <ol>
+ <li><tt>pair</tt> allows such a return</li>
+ <li>a lambda with a deduced return type doesn't allow it for any type</li>
+ <li><tt>decltype</tt> refuses <tt>{1, 2}</tt></li>
+ </ol>
+ <p>
+ I would recommend making non-unary <tt>tuple</tt> constructors non-explicit.
+ </p>
+ 
+ <p><i>[Bloomington, 2011]</i></p>
  
  <p>
! Move to NAD Future, this would be an extension to existing functionality.
  </p>
  
+ <p><i>[Portland, 2012]</i></p>
+ 
  <p>
! Move to Open at the request of the Evolution Working Group.
  </p>
  
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2055"></a>2055. <tt>std::move</tt> in <tt>std::accumulate</tt> and other algorithms</h3>
+ <p><b>Section:</b> 26.7 [numeric.ops] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2011-01-01 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#numeric.ops">issues</a> in [numeric.ops].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! The C++0x draft says <tt>std::accumulate</tt> uses: <tt>acc = binary_op(acc, *i)</tt>.
! <p/>
! Eelis van der Weegen has pointed out, on the libstdc++ mailing list, that using 
! <tt>acc = binary_op(std::move(acc), *i)</tt> can lead to massive improvements (particularly, 
! it means accumulating strings is linear rather than quadratic).
! <p/>
! Consider the simple case, accumulating a bunch of strings of length 1 (the same argument holds for other length buffers).
! For strings <tt>s</tt> and <tt>t</tt>, <tt>s+t</tt> takes time <tt>length(s)+length(t)</tt>, as you have to copy 
! both <tt>s</tt> and <tt>t</tt> into a new buffer.
! <p/>
! So in accumulating <tt>n</tt> strings, step <tt>i</tt> adds a string of length <tt>i-1</tt> to a string of length 
! 1, so takes time <tt>i</tt>.
! <p/>
! Therefore the total time taken is: <tt>1+2+3+...+n</tt> = O(<tt>n<sup>2</sup></tt>)
! <p/>
! <tt>std::move(s)+t</tt>, for a "good" implementation, is amortized time <tt>length(t)</tt>, like <tt>vector</tt>, 
! just copy <tt>t</tt> onto the end of the buffer. So the total time taken is:
! <p/>
! <tt>1+1+1+...+1</tt> (<tt>n</tt> times) = O(<tt>n</tt>). This is the same as <tt>push_back</tt> on a <tt>vector</tt>.
! <p/>
! I'm trying to decide if this implementation might already be allowed. I suspect it might not 
! be (although I can't imagine any sensible code it would break). There are other algorithms 
! which could benefit similarly (<tt>inner_product</tt>, <tt>partial_sum</tt> and 
! <tt>adjacent_difference</tt> are the most obvious).
! <p/>
! Is there any general wording for "you can use rvalues of temporaries"?
! <p/>
! The reflector discussion starting with message c++std-lib-29763 came to the conclusion
! that above example is not covered by the "as-if" rules and that enabling this behaviour
! would seem quite useful.
  </p>
  
+ <p><i>[
+ 2011 Bloomington
+ ]</i></p>
+ 
+ 
+ <p>
+ Moved to NAD Future.  This would be a larger change than we would consider for a simple TC.
+ </p>
+ 
+ 
  
  <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2062"></a>2062. Effect contradictions w&#47;o no-throw guarantee of <tt>std::function</tt> swaps</h3>
+ <p><b>Section:</b> 20.9.12.2 [func.wrap.func], 20.9.12.2.2 [func.wrap.func.mod] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-05-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! Howard Hinnant observed in reflector message c++std-lib-30841 that 20.9.12.2 [func.wrap.func] 
! makes the member swap <tt>noexcept</tt>, even though the non-member swap is not <tt>noexcept</tt>. 
! <p/>
! The latter was an outcome of the discussions during the Batavia meeting and the Madrid meeting 
! involving LWG <a href="lwg-defects.html#1349">1349</a>, which seems to indicate that the remaining <tt>noexcept</tt> 
! specifier at the member swap is incorrect and should be removed.
! <p/>
! But if we allow for a potentially throwing member swap of <tt>std::function</tt>, this causes 
! another conflict with the exception specification for the following member function:
! </p>
! <blockquote><pre>
! template&lt;class F&gt; function&amp; operator=(reference_wrapper&lt;F&gt; f) <span style="color:#C80000;font-weight:bolder">noexcept</span>;
! </pre><blockquote><p>
! <i>Effects</i>: <tt>function(f).<span style="color:#C80000;font-weight:bolder">swap</span>(*this);</tt>
! </p>
! </blockquote></blockquote>
! <p>
! Note that in this example the sub-expression <tt>function(f)</tt> does not cause any problems,
! because of the nothrow-guarantee given in 20.9.12.2.1 [func.wrap.func.con] p. 10. The problem
! is located in the usage of the swap which could potentially throw given the general latitude. 
! <p/>
! So, either the Madrid meeting decision need to be revised (and both member and free swap of 
! <tt>std::function</tt> should be noexcept), or this function needs to be adapted as well,
! e.g. by taking the exception-specification away or by changing the semantics.
! <p/>
! One argument for "swap-may-throw" would be to allow for small-object optimization techniques
! where the copy of the target may throw. But given the fact that the swap function has been guaranteed 
! to be "Throws: Nothing" from TR1 on, it seems to me that that there would still be opportunities to 
! perform small-object optimizations just restricted to the set of target copies that cannot throw. 
! <p/>
! In my opinion member swap of <tt>std::function</tt> has always been intended to be no-throw, because
! otherwise there would be no good technical reason to specify the effects of several member 
! functions in terms of the "construct-swap" idiom (There are three functions that are defined
! this way), which provides the strong exception safety in this case. I suggest to enforce that both 
! member swap and non-member swap of <tt>std::function</tt> are nothrow functions as it had been guaranteed 
! since TR1 on.
  </p>
  
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! <p>
! Dietmar: May not be swappable in the first place.
! </p>
! <p>
! Alisdair: This is wide contact. Then we should be taking noexcept off instead of putting it on. This is preferred resolution.
! </p>
! <p>
! Pablo: This is bigger issue. Specification of assignment in terms of swap is suspect to begin with. It is over specification.
! How this was applied to string is a better example to work from.
! </p>
! <p>
! Pablo: Two problems: inconsistency that should be fixed (neither should have noexcept), the other issues is that assignment
! should not be specified in terms of swap. There are cases where assignment should succeed where swap would fail. This is easier
! with string as it should follow container rules.
! </p>
! <p>
! <b>Action Item</b> (Alisdair): There are a few more issues found to file.
! </p>
! <p>
! Dave: This is because of allocators? The allocator makes this not work.
! </p>
! <p>
! Howard: There is a type erased allocator in shared_ptr. There is a noexcept allocator in shared_ptr.
! </p>
! <p>
! Pablo: shared_ptr is a different case. There are shared semantics and the allocator does move around.
! A function does not have shared semantics.
! </p>
! <p>
! Alisdair: Function objects think they have unique ownership.
! </p>
! <p>
! Howard: In function we specify semantics with copy construction and swap.
! </p>
! <p>
! <b>Action Item</b> (Pablo): Write this up better (why assignment should not be defined in terms of swap)
! </p>
! <p>
! Howard: Not having trouble making function constructor no throw.
! </p>
! <p>
! Dietmar: Function must allocate memory.
! </p>
! <p>
! Howard: Does not put stuff that will throw on copy or swap in small object optimization. Put those on heap.
! Storing allocator, but has to be no throw copy constructable.
! </p>
! <p>
! Pablo: Are you allowed to or required to swap or move allocators in case or swap or move.
! </p>
! <p>
! Dave: An allocator that is type erased should be different...
! </p>
! <p>
! Pablo: it is
! </p>
! <p>
! Dave: Do you need to know something about allocator types? But only at construction time.
! </p>
! <p>
! Pablo: You could have allocators that are different types.
! </p>
! <p>
! Dave: Swap is two ended operation.
! </p>
! <p>
! Pablo: Opinion is that both have to say propagate on swap for them to swap.
! </p>
! <p>
! John: It is not arbitrary. If one person says no. No is no.
! </p>
! <p>
! Howard: Find noexcept swap to be very useful. Would like to move in that direction and bring container design along.
! </p>
! <p>
! Dave: If you have something were allocator must not propagate you can detect that at construction time.
! </p>
! <p>
! ...
! </p>
! <p>
! Pablo: Need to leave this open and discuss in smaller group.
! </p>
! <p>
! Alisdair: Tried to add boost::any as TR2 proposal and ran into this issue. Only the first place where we run into
! issues with type erased allocators. Suggest we move it to open.
! </p>
! <p>
! <b>Action Item</b>: Move to open.
! </p>
! <p>
! <b>Action Item</b> (Pablo works with Howard and Daniel): Address the more fundamental issue
! (which may be multiple issues) and write up findings.
! </p>
! 
! <p><i>[
! <b>Original resolution</b>:
! ]</i></p>
! 
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Modify the header <tt>&lt;functional&gt;</tt> synopsis in 20.9 [function.objects] as indicated:</p>
! <blockquote><pre>
! namespace std {
!   [&hellip;]
! 
!   template&lt;class R, class... ArgTypes&gt;
!   void swap(function&lt;R(ArgTypes...)&gt;&amp;, function&lt;R(ArgTypes...)&gt;&amp;) <ins>noexcept</ins>;
! 
!   [&hellip;]
! }
  </pre></blockquote>
+ </li>
+ 
+ <li><p>Modify the class template <tt>function</tt> synopsis in 20.9.12.2 [func.wrap.func] as indicated:</p>
+ <blockquote><pre>
+ namespace std {
+   [&hellip;]
+ 
+   <i>// [func.wrap.func.alg], specialized algorithms:</i>
+   template&lt;class R, class... ArgTypes&gt;
+   void swap(function&lt;R(ArgTypes...)&gt;&amp;, function&lt;R(ArgTypes...)&gt;&amp;) <ins>noexcept</ins>;
+ 
+   [&hellip;]
+ }
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>Modify 20.9.12.2.7 [func.wrap.func.alg] as indicated:</p>
+ <blockquote><pre>
+ template&lt;class R, class... ArgTypes&gt;
+ void swap(function&lt;R(ArgTypes...)&gt;&amp; f1, function&lt;R(ArgTypes...)&gt;&amp; f2) <ins>noexcept</ins>;
+ </pre><blockquote><p>
+ -1- <i>Effects</i>: <tt>f1.swap(f2);</tt>
+ </p></blockquote></blockquote>
+ </li>
+ 
+ </ol>
+ 
+ <p><i>[2014-02-28 (Post Issaquah), Pablo provides more information]</i></p>
+ 
  
  <p>
! For cross-referencing purposes: The resolution of this issue should be
! harmonized with any resolution to LWG <a href="lwg-active.html#2370">2370</a>, which addresses
! inappropriate <tt>noexcept</tt>s in some function constructors.
  </p>
  
+ <p>We have the following choices:</p>
+ 
+ <ol>
+ <li>
+ <p><tt>swap()</tt> does not throw</p>
+ 
+ <blockquote><p>
+ <i>Discussion</i>: This definition is desirable, and allows assignment
+    to be implemented with the strong exception guarantee, but it does have
+    consequences: The implementation cannot use the small-object optimization
+    for a function-object <tt>F</tt> unless <tt>F</tt> is <tt>NothrowMovable</tt> 
+    (nothrow-swappable is unimportant because <tt>F</tt> is not swapped with another <tt>F</tt>). 
+    Note that many functors written before C++11 will not have move constructors decorated
+    with <tt>noexcept</tt>, so this limitation could affect a lot of code.
+ </p>
+ <p>
+ It is not clear what other implementation restrictions might be
+    needed. Allocators are required not to throw on move or copy. Is that
+    sufficient?
+ </p>
+ </blockquote>
+ </li>
+ 
+ <li>
+ <p><tt>swap()</tt> can throw</p>
+ 
  <blockquote>
! <p>
! <i>Discussion</i>: This definition gives maximum latitude to implementation to
!    use small-object optimization. However, the strong guarantee on assignment
!    is difficult to achieve.  Should we consider giving up on the strong
!    guarantee? How much are we willing to pessimize code for exceptions?
! </p>
  </blockquote>
+ </li>
+ <li>
+ <p><tt>swap()</tt> will not throw if both functions have <tt>NoThrowMoveable</tt> functors</p>
  
  <blockquote>
! <p>
! <i>Discussion</i>: This definition is similar to option 2, but gives slightly
!   stronger guarantees.  Here, <tt>swap()</tt> can throw, but the programmer can
!   theoretically prevent that from happening. This should be straight-forward
!   to implement and gives the implementation a lot of latitude for
!   optimization. However, because this is a dynamic decision, the program is
!   not as easy to reason about. Also, the strong guarantee for assignment is
!   compromized as in option 2.
! </p>
  </blockquote>
+ </li>
+ </ol>
  
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2070"></a>2070. <tt>allocate_shared</tt> should use <tt>allocator_traits&lt;A&gt;::construct</tt></h3>
! <p><b>Section:</b> 20.8.2.2.6 [util.smartptr.shared.create] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-07-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 20.8.2.2.6 [util.smartptr.shared.create] says:
! </p>
! <blockquote><p>
! -2- <i>Effects</i>: Allocates memory suitable for an object of type <tt>T</tt> and constructs an object in that memory
! via the placement new expression <tt>::new (pv) T(std::forward&lt;Args&gt;(args)...)</tt>. The template
! <tt>allocate_shared</tt> uses a copy of a to allocate memory. If an exception is thrown, the functions have
! no effect.
! </p></blockquote>
! <p>
! This explicitly requires placement new rather than using
! <tt>allocator_traits&lt;A&gt;::construct(a, (T*)pv, std::forward&lt;Args&gt;(args)...)</tt>
! In most cases that would result in the same placement new expression,
! but would allow more control over how the object is constructed e.g.
! using <tt>scoped_allocator_adaptor</tt> to do uses-allocator construction, or
! using an allocator declared as a friend to construct objects with no
! public constructors.
! </p>
! 
! <p><i>[
! 2011-08-16 Bloomington:
! ]</i></p>
! 
! <p>
! Agreed to fix in principle, but believe that <tt>make_shared</tt> and
! <tt>allocate_shared</tt> have now diverged enough that their descriptions
! should be separated.  Pablo and Stefanus to provide revised wording.
! </p>
! 
! <p><strong>Daniel's (old) proposed resolution:</strong></p>
! <blockquote class="note">
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Change the following paragraphs of 20.8.2.2.6 [util.smartptr.shared.create] as indicated (The suggested
! removal of the last sentence of p1 is not strictly required to resolve this issue, but is still recommended,
! because it does not say anything new but may give the impression that it says something new):
! </p><blockquote><pre>
! template&lt;class T, class... Args&gt; shared_ptr&lt;T&gt; make_shared(Args&amp;&amp;... args);
! template&lt;class T, class A, class... Args&gt;
!   shared_ptr&lt;T&gt; allocate_shared(const A&amp; a, Args&amp;&amp;... args);
! </pre><blockquote>
! <p>
! -1- <i>Requires</i>: <ins>For the template <tt>make_shared</tt>, t</ins><del>T</del>he expression 
! <tt>::new (pv) T(std::forward&lt;Args&gt;(args)...)</tt>, where <tt>pv</tt> 
! has type <tt>void*</tt> and points to storage suitable to hold an object of type <tt>T</tt>, shall be well 
! formed. <ins>For the template <tt>allocate_shared</tt>, the expression 
! <tt>allocator_traits&lt;A&gt;::construct(a, pt, std::forward&lt;Args&gt;(args)...)</tt>,
! where <tt>pt</tt> has type <tt>T*</tt> and points to storage suitable to hold an object
! of type <tt>T</tt>, shall be well formed.</ins> <tt>A</tt> shall be an allocator ([allocator.requirements]). 
! <del>The copy constructor and destructor of  <tt>A</tt> shall not throw exceptions.</del>
! <p/>
! -2- <i>Effects</i>: Allocates memory suitable for an object of type <tt>T</tt> and constructs an object in 
! that memory<ins>. The template <tt>make_shared</tt> constructs the object</ins> via the placement new expression 
! <tt>::new (pv) T(std::forward&lt;Args&gt;(args)...)</tt>. The template <tt>allocate_shared</tt> uses a copy 
! of <tt>a</tt> to allocate memory<ins> and constructs the object by calling <tt>allocator_traits&lt;A&gt;::construct(a, pt,
! std::forward&lt;Args&gt;(args)...)</tt></ins>. If an exception is thrown, the functions have no effect.
! <p/>
! -3- <i>Returns</i>: A <tt>shared_ptr</tt> instance that stores and owns the address of the newly constructed 
! object of type <tt>T</tt>.
! <p/>
! -4- <i>Postconditions</i>: <tt>get() != 0 &amp;&amp; use_count() == 1</tt>
! <p/>
! -5- <i>Throws</i>: <tt>bad_alloc</tt>, or<ins>, for the template <tt>make_shared</tt>, an exception thrown from
! the constructor of <tt>T</tt>, or, for the template <tt>allocate_shared</tt>,</ins> an exception thrown from 
! <tt>A::allocate</tt> or <ins>from <tt>allocator_traits&lt;A&gt;::construct</tt></ins><del>from the constructor of 
! <tt>T</tt></del>.
! <p/>
! -6- <i>Remarks</i>: Implementations are encouraged, but not required, to perform no more than one memory
! allocation. [ <i>Note</i>: This provides efficiency equivalent to an intrusive smart pointer. &mdash; <i>end note</i> ]
! <p/>
! -7- [ <i>Note</i>: These functions will typically allocate more memory than <tt>sizeof(T)</tt> to allow for internal
! bookkeeping structures such as the reference counts. &mdash; <i>end note</i> ]
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2011-12-04: Jonathan and Daniel improve wording]</i></p>
! 
! 
! <p>See also c++std-lib-31796</p>
! 
! 
! 
! 
! <p><i>[2013-10-13, Ville]</i></p>
! 
! <p>
! This issue is related to <a href="lwg-active.html#2089">2089</a>.
! </p>
! 
! 
! <p><i>[2014-02-15 post-Issaquah session : move to Tentatively NAD]</i></p>
! 
! <p>
! STL: This takes an allocator, but then ignores its construct. That's squirrely.
! </p>
! <p>
! Alisdair: The convention is when you take an allocator, you use its construct.
! </p>
! <p>
! STL: 23.2.1 [container.requirements.general]/3, argh! This fills me with despair, but I understand it now.
! </p>
! <p>
! STL: Ok, this is some cleanup.
! </p>
! <p>
! STL: You're requiring <tt>b</tt> to be of type <tt>A</tt> and not being rebound, is that an overspecification?
! </p>
! <p>
! Pablo: Good point. Hmm, that's only a requirement on what must be well-formed.
! </p>
! <p>
! STL: If it's just a well-formed requirement, then why not just use a directly?
! </p>
! <p>
! Pablo: Yeah, the well-formed requirement is overly complex. It's not a real call, we could just use a directly. It makes it harder to read.
! </p>
! <p>
! Alisdair: <tt>b</tt> should be an allocator in the same family as <tt>a</tt>.
! </p>
! <p>
! Pablo: This is a well-formed requirement, I wonder if it's the capital A that's the problem here. It doesn't matter here, this is way too much wording.
! </p>
! <p>
! Alisdair: It's trying to tie the constructor arguments into the allocator requirements.
! </p>
! <p>
! Pablo: <tt>b</tt> could be struck, that's a runtime quality. The construct will work with anything that's in the family of <tt>A</tt>.
! </p>
! <p>
! Alisdair: The important part is the <tt>forward</tt> of <tt>Args</tt>.
! </p>
! <p>
! Pablo: <tt>A</tt> must be an allocator, and <tt>forward</tt> <tt>Args</tt> must work with that.
! </p>
! <p>
! Alisdair: First let's nail down <tt>A</tt>.
! </p>
! <p>
! Pablo: Then replace <tt>b</tt> with <tt>a</tt>, and strike the rest.
! </p>
! <p>
! STL: You need <tt>pt</tt>'s type, at least.
! </p>
! <p>
! Pablo: There's nothing to be said about runtime constraints here, this function doesn't even take a <tt>pt</tt>.
! </p>
! <p>
! STL: Looking at the Effects, I believe <tt>b</tt> is similarly messed up, we can use <tt>a2</tt> to construct an object.
! </p>
! <p>
! Alisdair: Or any allocator in the family of <tt>a</tt>.
! </p>
! <p>
! STL: We say this stuff for the deallocate too, it should be lifted up.
! </p>
! <p>
! STL: "owns the address" is weird.
! </p>
! <p>
! Alisdair: shared_ptr owns pointers, although it does sound funky.
! </p>
! <p>
! Walter: "to destruct" is ungrammatical.
! </p>
! <p>
! STL: "When ownership is given up" is not what we usually say.
! </p>
! <p>
! Alisdair: I think the Returns clause is the right place to say this.
! </p>
! <p>
! STL: The right place to say this is <tt>shared_ptr</tt>'s dtor, we don't want to use Core's "come from" convention.
! </p>
! <p>
! Alisdair: I'm on the hook to draft cleaner wording.
! </p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Change the following paragraphs of 20.8.2.2.6 [util.smartptr.shared.create] as indicated:
! </p>
! <blockquote><pre>
! template&lt;class T, class... Args&gt; shared_ptr&lt;T&gt; make_shared(Args&amp;&amp;... args);
! <del>template&lt;class T, class A, class... Args&gt;
!   shared_ptr&lt;T&gt; allocate_shared(const A&amp; a, Args&amp;&amp;... args);</del>
! </pre></blockquote>
! <p>
! <del>-1- <i>Requires</i>: The expression <tt>::new (pv) T(std::forward&lt;Args&gt;(args)...)</tt>, where <tt>pv</tt> 
! has type <tt>void*</tt> and points to storage suitable to hold an object of type <tt>T</tt>, shall be well 
! formed. <tt>A</tt> shall be an allocator (17.6.3.5 [allocator.requirements]). The copy constructor 
! and destructor of <tt>A</tt> shall not throw exceptions.</del>
! <p/>
! -2- <i>Effects</i>: <ins>Equivalent to</ins>
! </p>
! <blockquote><pre> 
! <ins>return allocate_shared&lt;T&gt;(allocator&lt;T&gt;(), std::forward&lt;Args&gt;(args)...);</ins>
! </pre></blockquote>
! <p>
! <del>Allocates memory suitable for an object of type <tt>T</tt> 
! and constructs an object in that memory via the placement new expression 
! <tt>::new (pv) T(std::forward&lt;Args&gt;(args)...)</tt>. The template <tt>allocate_shared</tt> uses a copy 
! of <tt>a</tt> to allocate memory. If an exception is thrown, the functions have no effect.</del>
! <p/>
! <ins>-?- <i>Remarks</i>: An implementation may meet the effects (and the implied guarantees) without 
! creating the allocator object [<i>Note</i>: That is, user-provided specializations of <tt>std::allocator</tt>
! may not be instantiated, the expressions <tt>::new (pv) T(std::forward&lt;Args&gt;(args)...)</tt> and 
! <tt>pv-&gt;~T()</tt> may be evaluated directly &mdash; <i>end note</i>].</ins>
! <p/>
! <del>-3- <i>Returns</i>: A <tt>shared_ptr</tt> instance that stores and owns the address of the newly constructed 
! object of type <tt>T</tt>.</del>
! <p/>
! <del>-4- <i>Postconditions</i>: <tt>get() != 0 &amp;&amp; use_count() == 1</tt></del>
! <p/>
! <del>-5- <i>Throws</i>: <tt>bad_alloc</tt>, or an exception thrown from <tt>A::allocate</tt> or from the 
! constructor of <tt>T</tt>.</del>
! <p/>
! <del>-6- <i>Remarks</i>: Implementations are encouraged, but not required, to perform no more than one memory
! allocation. [<i>Note</i>: This provides efficiency equivalent to an intrusive smart pointer. &mdash; <i>end note</i>]</del>
! <p/>
! <del>-7- [<i>Note</i>: These functions will typically allocate more memory than <tt>sizeof(T)</tt> to allow 
! for internal bookkeeping structures such as the reference counts. &mdash; <i>end note</i>]</del>
! </p>
! </li>
! <li><p>
! Add the following set of <ins>new paragraphs</ins> immediately following the previous paragraph 7 of
! 20.8.2.2.6 [util.smartptr.shared.create]:
! </p>
! <blockquote><pre>
! template&lt;class T, class A, class... Args&gt;
!   shared_ptr&lt;T&gt; allocate_shared(const A&amp; a, Args&amp;&amp;... args);
! </pre></blockquote>
! <p>
! -?- <i>Requires</i>: The expressions 
! <tt>allocator_traits&lt;A&gt;::construct(b, pt, std::forward&lt;Args&gt;(args)...)</tt> and
! <tt>allocator_traits&lt;A&gt;::destroy(b, pt)</tt> shall be well-formed and well-defined, 
! where <tt>b</tt> has type <tt>A</tt> and is a copy of <tt>a</tt> and where <tt>pt</tt> 
! has type <tt>T*</tt> and points to storage suitable to hold an object of type <tt>T</tt>. 
! <tt>A</tt> shall meet the allocator requirements (17.6.3.5 [allocator.requirements]). 
! <p/>
! -?- <i>Effects</i>: Uses an object <tt>a2</tt> 
! of type <tt>allocator_traits&lt;A&gt;::rebind_alloc&lt;<i>unspecified</i>&gt;</tt> that compares equal to 
! <tt>a</tt> to allocate memory suitable for an object of type <tt>T</tt>. 
! Uses a copy <tt>b</tt> of type <tt>A</tt> from <tt>a</tt> to construct an object of type <tt>T</tt> in 
! that memory by calling <tt>allocator_traits&lt;A&gt;::construct(b, pt, std::forward&lt;Args&gt;(args)...)</tt>. 
! If an exception is thrown, the function has no effect.
! <p/>
! -?- <i>Returns</i>: A <tt>shared_ptr</tt> instance that stores and owns the address of the newly constructed 
! object of type <tt>T</tt>. When ownership is given up, the effects are as follows: Uses a copy <tt>b2</tt> 
! of type <tt>A</tt> from <tt>a</tt> to destruct an object of type <tt>T</tt> by calling 
! <tt>allocator_traits&lt;A&gt;::destroy(b2, pt2)</tt> where <tt>pt2</tt> has type <tt>T*</tt> 
! and refers to the newly constructed object. Then uses an object of type
! <tt>allocator_traits&lt;A&gt;::rebind_alloc&lt;<i>unspecified</i>&gt;</tt> that compares equal to 
! <tt>a</tt> to deallocate the allocated memory.
! <p/>
! -?- <i>Postconditions</i>: <tt>get() != 0 &amp;&amp; use_count() == 1</tt>
! <p/>
! -?- <i>Throws</i>: Nothing unless memory allocation or <tt>allocator_traits&lt;A&gt;::construct</tt> 
! throws an exception.
! <p/>
! -?- <i>Remarks</i>: Implementations are encouraged, but not required, to perform no more than one memory 
! allocation. [<i>Note</i>: Such an implementation provides efficiency equivalent to an intrusive smart 
! pointer. &mdash; <i>end note</i>]
! <p/>
! -?- [<i>Note</i>: This function will typically allocate more memory than <tt>sizeof(T)</tt> to allow for internal
! bookkeeping structures such as the reference counts. &mdash; <i>end note</i>]
! </p>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2072"></a>2072. Unclear wording about capacity of temporary buffers</h3>
! <p><b>Section:</b> 20.7.11 [temporary.buffer] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Kazutoshi Satoda <b>Opened:</b> 2011-08-10 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#temporary.buffer">issues</a> in [temporary.buffer].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! According to 20.7.11 [temporary.buffer] p1+2:
! 
! </p><blockquote><pre>
! template &lt;class T&gt;
! pair&lt;T*, ptrdiff_t&gt; get_temporary_buffer(ptrdiff_t n) noexcept;
! </pre><blockquote><p>
! -1- <i>Effects</i>: Obtains a pointer to storage sufficient to store up to <tt>n</tt> adjacent <tt>T</tt> 
! objects. It is implementation-defined whether over-aligned types are supported (3.11).
! <p/>
! -2- <i>Returns</i>: A pair containing the buffer's address and capacity (in the units of <tt>sizeof(T)</tt>), 
! or a pair of 0 values if no storage can be obtained or if <tt>n &lt;= 0</tt>.
! </p></blockquote></blockquote>
! <p>
! I read this as prohibiting to return a buffer of which capacity is less than <tt>n</tt>, because 
! such a buffer is not sufficient to store <tt>n</tt> objects.
! <p/>
! The corresponding description in <a href="http://www.sgi.com/tech/stl/get_temporary_buffer.html">SGI STL</a> 
! is clear on this point, but I think it is a bit too verbose:
! </p>
! 
! <blockquote class="note"><p>
! (for the return value, a pair <tt>P</tt>) [...] the buffer pointed to by <tt>P.first</tt> is large enough 
! to hold <tt>P.second</tt> objects of type <tt>T</tt>. <tt>P.second</tt> is greater than or equal to 0, 
! and less than or equal to <tt>len</tt>.
! </p></blockquote>
! 
! <p>
! There seems to be two different targets of the "up to n" modification:
! The capacity of obtained buffer, and the actual number that the caller
! will store into the buffer.
! <p/>
! First I read as the latter, and got surprised seeing that libstdc++
! implementation can return a smaller buffer. I started searching about
! <tt>get_temporary_buffer()</tt>. After reading a quote from TC++PL at
! <a href="http://stackoverflow.com/questions/3264299/why-do-i-need-stdget-temporary-buffer">stackoverflow</a>, 
! I realized that the former is intended.
! <p/>
! Such misinterpretation seems common:
! </p>
! <ul>
! <li>The above question is likely started from same misinterpretation.</li>
! <li><p>JIS standard (Japanese translation of ISO&#47;IEC standard) says nothing
!     like "up to". I think the editor misinterpreted the original wording,
!     and omitted words for "up to" as it is redundant. (If a buffer is
!     sufficient to store <tt>n</tt> objects, it is also sufficient to store
!     up to <tt>n</tt> objects.)</p></li>
! <li><p>Rogue Wave implementation doesn't return smaller buffer, instead, it
!     can return larger buffer on some circumstances. Apache 
! 	<a href="http://stdcxx.apache.org/">STDCXX</a> is a derived version of that
!     implementation, and <a href="https://stdcxx.apache.org/doc/stdlibref/get-temporary-buffer.html">publicly accessible</a>:
! </p>
! <blockquote class="note"><p>
! Specializations of the <tt>get_temporary_buffer()</tt> function template
! attempt to allocate a region of storage sufficiently large to store at
! least <tt>n</tt> adjacent objects of type <tt>T</tt>.
! </p></blockquote>
! <p>
! I know one commercial compiler package based on Rogue Wave implementation, 
! and its implementation is essentially same as the above.
! </p>
! </li>
! </ul>
! 
! <p><i>[2014-05-18, Daniel comments and suggests concrete wording]</i></p>
! 
! 
! <p>
! The provided wording attempts to clarify the discussed capacity freedom, but it also makes it clearer that the returned
! memory is just "raw memory", which is currently not really clear. In addition the wording clarifies that the deallocating
! <tt>return_temporary_buffer</tt> function does not throw exceptions, which I believe is the intention when the preconditions
! of the functions are satisfied. Then, my understanding is that we can provide to <tt>return_temporary_buffer</tt> a
! null pointer value if that was the value, <tt>get_temporary_buffer()</tt> had returned. Furthermore, as STL noticed, the current 
! wording seemingly allows multiple invocations of <tt>return_temporary_buffer</tt> with the same value returned by 
! <tt>get_temporary_buffer</tt>; this should be constrained similar to the wording we have for <tt>operator delete</tt> (unfortunately
! we miss such wording for allocators).
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! MC: move to ready? in favor: 14, opposed: 0, abstain: 0 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol><li><p>Change 20.7.11 [temporary.buffer] as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class T&gt;
!   pair&lt;T*, ptrdiff_t&gt; get_temporary_buffer(ptrdiff_t n) noexcept;
  </pre>
  <blockquote>
! <p>
! -1- <i>Effects</i>: <ins>Obtains a pointer to uninitialized, contiguous storage for <tt><i>N</i></tt> adjacent objects of type 
! <tt>T</tt>, for some non-negative number <tt><i>N</i></tt>.</ins><del>Obtains a pointer to storage sufficient 
! to store up to <tt>n</tt> adjacent <tt>T</tt> objects.</del> It is implementation-defined whether over-aligned types are supported (3.11).
! <p/>
! <ins>-?- <i>Remarks</i>: Calling <tt>get_temporary_buffer</tt> with a positive number <tt>n</tt> is a non-binding request to return 
! storage for <tt>n</tt> objects of type <tt>T</tt>. In this case, an implementation is permitted to return instead storage for a 
! non-negative number <tt><i>N</i></tt> of such objects, where <tt><i>N</i> != n</tt> (including <tt><i>N</i> == 0</tt>). [<i>Note</i>: The 
! request is non-binding to allow latitude for implementation-specific optimizations of its memory management. &mdash; <i>end note</i>].</ins>
! <p/>
! -2- <i>Returns</i>: <ins>If <tt>n &lt;= 0</tt> or if no storage could be obtained, returns a pair <tt>P</tt> such that <tt>P.first</tt>
! is a null pointer value and <tt>P.second == 0</tt>; otherwise returns a pair <tt>P</tt> such that <tt>P.first</tt> refers to the 
! address of the uninitialized storage and <tt>P.second</tt> refers to its capacity <tt><i>N</i></tt> (in the units of 
! <tt>sizeof(T)</tt>).</ins><del>A <tt>pair</tt> containing the buffer's address and capacity (in the units of <tt>sizeof(T)</tt>), or a 
! pair of 0 values if no storage can be obtained or if <tt>n &lt;= 0</tt>.</del>
! </p>
  </blockquote>
  
! <pre>
! template &lt;class T&gt; void return_temporary_buffer(T* p);
  </pre>
  <blockquote>
! <p>
! -3- <i>Effects</i>: Deallocates the <del>buffer to which <tt>p</tt> points</del><ins>storage referenced by <tt>p</tt></ins>.
! <p/>
! -4- <i>Requires</i>: <del>The buffer shall have been previously allocated by</del><ins><tt>p</tt> shall be a pointer value 
! returned by an earlier call to</ins> <tt>get_temporary_buffer</tt> <ins>which has not been invalidated by an intervening call to
! <tt>return_temporary_buffer(T*)</tt></ins>.
! <p/>
! <ins>-?- <i>Throws</i>: Nothing.</ins>
! </p>
  </blockquote>
  
  </blockquote>
+ </li>
+ </ol>
  
  
  
*************** template &lt;class Compare&gt; void merg
*** 3087,3854 ****
  
  
  <hr>
! <h3><a name="1318"></a>1318. N2982 removes previous allocator capabilities</h3>
! <p><b>Section:</b> 20.9.4.1 [allocator.traits.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2010-02-11 <b>Last modified:</b> 2010-11-12</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1375">1375</a></p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-87</b></p>
  <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>
! says that containers should have a nested typedef that defines their
! <tt>reference_type</tt> as <tt>value_type&amp;</tt>; the previous
! standard deferred to the allocator to define its
! <tt>reference_type</tt>, and containers simply passed the allocator's
! typedef on. This change is a mistake. Allocators should define both a
! <tt>pointer</tt> type and a <tt>reference</tt> type. That's essential
! for their original purpose, which was to make different memory models
! transparent. If an allocator defines a <tt>pointer</tt> type that isn't
! compatible with a normal pointer it also has to define a corresponding
! <tt>reference</tt> type. For example (and please forgive a Windows-ism),
! if an allocator's pointer is <tt>T __far*</tt>, then it's
! <tt>reference</tt> has to be <tt>T __far&amp;</tt>. Otherwise everything
! crashes (under the hood, references are pointers and have to have the
! same memory access mechanics). Extensions such as this for more general
! memory models were explicitly encouraged by C++03, and the allocator's
! <tt>pointer</tt> and <tt>reference</tt> typedefs were the hooks for such
! extensions. Removing the allocator's <tt>reference</tt> and
! <tt>const_reference</tt> typedefs makes those extensions unimplementable
! and breaks existing implementations that rely on those hooks.
  </p>
  
! <p><i>[
! 2010-02-25 Alisdair adds:
! ]</i></p>
  
  
  <blockquote>
  <p>
! <tt>vector&lt;bool&gt;::reference</tt> is a nested class, and not a typedef.  It
! should be removed from the list of containers when this change is made.
  </p>
  
  <p>
! In general, I am unfcomfortable placing this reference requirement on each
! container, as I would prefer to require:
  </p>
  
! <blockquote><pre>is_same&lt;Container::reference, Container::iterator::reference&gt;
  </pre></blockquote>
  
  <p>
! This distinction is important, if we intend to support proxy iterators.  The
! iterator paper in the pre-Pittsburgh mailing
! (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3046.html">N3046</a>)
! does <em>not</em> make this proposal, but organises clause 24 in such a way this
! will be much easier to specify.
  </p>
  
  <p>
! The changes to clause 20 remain important for all the reasons Pete highlights.
  </p>
  </blockquote>
  
  <p><i>[
! 2010 Batavia
  ]</i></p>
  
  
  <p>
! Removed <tt>vector</tt> from list of templates that should be adjusted.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>
  <p>
! Add the following two rows to Table 40, Allocator requirements:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 40 — Allocator requirements</caption>
! <tbody><tr>
! <th>
! Expression
! </th>
  
! <th>
! Return type
! </th>
  
! <th>
! Assertion/note<br>pre-/post-condition
! </th>
  
! <th>
! Default
! </th>
  
  </tr>
  
  <tr>
! <td><ins><tt>X::reference</tt></ins></td>
  
! <td><tt></tt></td>
  
! <td><tt></tt></td>
  
! <td><ins><tt>T&amp;</tt></ins></td>
  </tr>
  
  <tr>
! <td><ins><tt>X::const_reference</tt></ins></td>
  
! <td><tt></tt></td>
  
! <td><tt></tt></td>
  
! <td><ins><tt>const T&amp;</tt></ins></td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  </li>
  
! <li>
  <p>
! 2. Change the following two rows in Table 40:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 40 — Allocator requirements</caption>
! <tbody><tr>
! <th>
! Expression
! </th>
  
! <th>
! Return type
! </th>
  
! <th>
! Assertion/note<br>pre-/post-condition
! </th>
  
! <th>
! Default
! </th>
  
  </tr>
  
  <tr>
! <td><ins><tt>*p</tt></ins></td>
  
! <td><tt><del>T&amp;</del> <ins>X::reference</ins></tt></td>
  
! <td><tt></tt></td>
  
! <td></td>
  </tr>
  
  <tr>
! <td><ins><tt>*q</tt></ins></td>
  
! <td><tt><del>const T&amp;</del> <ins>X::const_reference</ins></tt></td>
  
! <td><tt></tt></td>
  
! <td></td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  </li>
  
! <li>
  <p>
! Add the following typedef declarations to allocator_traits 20.9.4 [allocator.traits]:
  </p>
  
! <blockquote><pre>template &lt;class Alloc&gt; struct allocator_traits {
!   ...
!   <ins>typedef <i>see below</i> reference;</ins>
!   <ins>typedef <i>see below</i> const_reference;</ins>
!   ...
! </pre></blockquote>
! </li>
  
! <li>
  <p>
! Add the following descriptions to 20.9.4.1 [allocator.traits.types]:
  </p>
  
  <blockquote>
! <pre>typedef see below reference;</pre>
  <blockquote>
! <i>Type:</i> <tt>Alloc::reference</tt> if such a type exists; otherwise,
! <tt>value_type&amp;</tt>.
  </blockquote>
  
- <pre>typedef see below const reference;</pre>
  <blockquote>
! <i>Type:</i> <tt>Alloc::const_reference</tt> if such a type exists; otherwise,
! <tt>const value_type&amp;</tt>.
  </blockquote>
  </blockquote>
  </li>
  
! <li>
  <p>
! Add the following typdef declarations to scoped_allocator_adaptor 20.10 [allocator.adaptor]:
  </p>
  
! <blockquote><pre>template &lt;class OuterAlloc, class... InnerAllocs&gt;
! class scoped_allocator_adaptor : public OuterAlloc {
!   ...
!   <ins>typedef typename OuterTraits::reference reference;</ins>
!   <ins>typedef typename OuterTraits::const_reference const_reference;</ins>
!   ...
! </pre></blockquote>
  </li>
  
! <li>
  <p>
! Change the nested typedefs reference and
! const_reference to:
  </p>
  
! <blockquote><pre>typedef typename allocator_traits&lt;Allocator&gt;::reference reference;
! typedef typename allocator_traits&lt;Allocator&gt;::const_reference const_reference;
  </pre></blockquote>
  
  <p>
! for each of the following class templates:
  </p>
  
! <blockquote>
! <tt>deque</tt> 23.3.2 [deque]<br>
! <tt>forward_list</tt> 23.3.3 [forwardlist]<br>
! <tt>list</tt> 23.3.4 [list]<br>
! <tt>queue</tt> 23.5.1.1 [queue.defn]<br>
! <tt>priority_queue</tt> 23.5.2 [priority.queue]<br>
! <tt>stack</tt> 23.5.3.1 [stack.defn]<br>
! <tt>vector&lt;bool&gt;</tt> 23.4.2 [vector.bool]<br>
! <tt>map</tt> 23.6.1 [map]<br>
! <tt>multimap</tt> 23.6.2 [multimap]<br>
! <tt>set</tt> 23.6.3 [set]<br>
! <tt>multiset</tt> 23.6.4 [multiset]<br>
! <tt>unordered_map</tt> 23.7.1 [unord.map]<br>
! <tt>unordered_multimap</tt> 23.7.2 [unord.multimap]<br>
! <tt>unordered_set</tt> 23.7.3 [unord.set]<br>
! <tt>unordered_multiset</tt> 23.7.4 [unord.multiset]<br>
! <tt>basic_string</tt> 21.4 [basic.string]<br>
! <tt>match_results</tt> 28.10 [re.results]
  </blockquote>
  </li>
  
  </ol>
  
  
  
  
  
  <hr>
! <h3><a name="1320"></a>1320. Header for <tt>iter_swap</tt></h3>
! <p><b>Section:</b> 24.3 [iterator.synopsis] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">Tentatively NAD Future</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-02-16 <b>Last modified:</b> 2010-11-13</p>
  <p><b>Discussion:</b></p>
  <p>
! The <tt>iter_swap</tt> function template appears in the
! <tt>&lt;algorithm&gt;</tt> header, yet its main use is in building further
! algorithms, not calling existing ones. The main clients are implementers of data
! structures and their iterators, so it seems most appropriate to place the
! template in the <tt>&lt;iterator&gt;</tt> header instead.
  </p>
  
  <p>
! Note that this is not an issue for implementers of the standard library, as they
! rarely use the standard headers directly, designing a more fine-grained set of
! headers for their own internal use.  This option is not available to customers
! of the standard library.
  </p>
  
  <p>
! Note that we cannot remove <tt>iter_swap</tt> from <tt>&lt;algorithm&gt;</tt>
! without breaking code, but there is no reason we cannot offer the same
! declaration via two standard headers.  Alternatively, require
! <tt>&lt;algorithm&gt;</tt> to <tt>#include &lt;iterator&gt;</tt>, but
! introducing the dependency on the iterator adaptors seems un-necessary.
  </p>
  
! <p><i>[
! ]</i></p>
  
  
  <p>
! Discussed possibly moving to <tt>&lt;utility&gt;</tt> but don't like that. Some not seeing this 
! as a defect, and want to keep it in <tt>&lt;algorithm&gt;</tt>. No one seems to feel strongly 
! about moving to <tt>&lt;iterator&gt;</tt>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Add the declaration of <tt>iter_swap</tt> to the <tt>&lt;iterator&gt;</tt>
! header synopsis (24.3 [iterator.synopsis]), with a note that it is
! documented in clause 25 [algorithms].
  </p>
  
- <blockquote><pre>...
- template &lt;class T, size_t N&gt; T* end(T (&amp;array)[N]);
  
- <ins><i>// documented in 25 [algorithms]</i>
- template&lt;class ForwardIterator1, class ForwardIterator2&gt;
-   void iter_swap(ForwardIterator1 a, ForwardIterator2 b);</ins>
- </pre></blockquote>
  
  
  
  
  
  
  <hr>
! <h3><a name="1330"></a>1330. Move container requirements into requirements tables</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Deferred">Deferred</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-03-10 <b>Last modified:</b> 2010-11-15</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Deferred">Deferred</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Abstract:
  </p>
  <p>
! In general, it seems that in a couple of places container behavior is
! not described in requirement tables although it is a general behavior.
  </p>
  
  <p>
! History:
  </p>
  
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a> added move semantics to unordered containers.
! For the added insert functions the Editor requested to put their
! semantic description into a requirements table rather than describing
! them for each container individually. The text however was taken from
! the associative containers, where we also have the semantics for each
! container described. Also, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a> is to some extend
! requesting a clarification of the requirement tables and it turned out
! that in other places we have the same problem (e.g. we have no general
! requirement for type pointer and const_pointer although each container
! has them with issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1306">1306</a>).
  </p>
  
  <p>
! From my personal list of functions in requirement tables
! and containers, the following types/functions are missing in
! requirement tables:
  </p>
  
! <ul>
! <li>
! <tt>pointer</tt>, <tt>const_pointer</tt> in Table 91 (container requirements)
  </li>
! <li>
  <p>
! all copy constructors, copy constructors with allocator,
!  assignment operators, and insert operators
!  with move semantics for associative and unordered containers
  </p>
! <blockquote><pre>ContType c1(c2&amp;&amp;)
! ContType c1(c2&amp;&amp;,alloc)
! c1 = c2&amp;&amp;
! c.insert(val&amp;&amp;)
! c.insert(pos,val&amp;&amp;)
! </pre></blockquote>
  </li>
- </ul>
  
  <p>
! As a special case, we lack the following requirements for all sequence
! containers BUT array (so special wording or a new container category is
! required):
  </p>
  
! <ul>
  <li>
  <p>
! constructor with only a size argument
  </p>
! <blockquote><pre>ContType c(num)
! </pre></blockquote>
  </li>
! <li>
  <p>
! copy constructor with allocator and move semantics
  </p>
! <blockquote><pre>ContType c1(c2&amp;&amp;,alloc)
! </pre></blockquote>
  </li>
  <li>
  <p>
! all constructors that insert multiple elements with additional allocator
  </p>
! <blockquote><pre>ContType c(num, val,alloc)
! ContType c(beg, end,alloc)
! ContType c(initlist,alloc)
! </pre></blockquote>
  </li>
! <li>
  <p>
! all resize functiuons:
  </p>
! <blockquote><pre>c.resize(num)
! c.resize(num,val)
! </pre></blockquote>
  </li>
! </ul>
  
  <p>
! Note that we also might have to add additional requirements on other
! places for sequence containers because having an allocator requires
! additional statements for the treatment of the allocators. E.g. swap for
! containers with allocators is not specified in any requirement table.
  </p>
  
  <p>
! And finally, if we have the requirements in the requirements tables, we
! can remove the corresponding descriptions for the individual container.
! However, note that sequence container requirements have NO complexity
! column, so that we still need container specific descriptions for the
! functions listed there.
  </p>
  
  <p><i>[
! 2010 Batavia
  ]</i></p>
  
  <p>
! While there is consensus that further cleaning up the container requirement
! tables would be a good thing, there is no feeling that this <em>must</em>
! be done in time for 0x.  The issue remains open, but Deferred.
  </p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1332"></a>1332. Let Hash objects throw!</h3>
! <p><b>Section:</b> 20.2.4 [hash.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-03-26 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The currently added Hash requirements demand in Table 40 — Hash
! requirements [hash]:
  </p>
  
  <blockquote>
  <table border="1">
  
! <caption>Table 40 — Hash requirements [hash]</caption>
  
! <tbody><tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Requirement</th>
  </tr>
  
  <tr>
! <td><tt>h(k)</tt></td>
! <td><tt>size_t</tt></td>
! <td>Shall not throw exceptions. [..]</td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  <p>
! While it surely is a generally accepted idea that hash function objects
! <i>should</i> not throw exceptions, this basic constraint for such a fundamental
! requirement set does neither match the current library policy nor real world
! cases:
  </p>
- 
- <ol>
- <li>
- There are little known situations where a swap or move operation may throw an
- exception and in some popular domains such functions are <em>required</em> not
- to throw. But the library invested already efforts for good reasons to require
- "working" container implementations in the presence of throwing move or swap
- operations, see e.g. 23.2.4.1 [associative.reqmts.except], 23.2.5.1 [unord.req.except].
  </li>
  
! <li>
! The container library is already specified to cope with potentially throwing
! comparers, predicates, <i>and</i> hash function objects, see above.
! </li>
  
- <li>
  <p>
! The new definition goes beyond the original hash requirements as specified
! by SGI library in regard to the exception requirement:
  </p>
- <blockquote>
- <a href="http://www.sgi.com/tech/stl/HashFunction.html">http://www.sgi.com/tech/stl/HashFunction.html</a>
- </blockquote>
  </li>
  
  <li>
! There are indeed real-world examples of potentially throwing hash functions,
! typically when the proxy pattern is used and when the to-be hashed proxied
! instance is some <i>volatile</i> object, e.g. a file or internet resource, that
! might suddenly be unavailable at the time of hashing.
! </li>
  
  <li>
! With the new <tt>noexcept</tt> language facility libraries can still take
! advantage of no-throw guarantees of hasher functions with stricter guarantees.
  </li>
  </ol>
  
  <p>
! Even though the majority of all known move, swap, and hash functions won't throw
! and in some cases <em>must</em> not throw, it seems like unnecessary
! over-constraining the definition of a Hash functor not to propagate exceptions
! in any case and it contradicts the general principle of C++ to impose such a
! requirement for this kind of fundamental requirement.
  </p>
  
  <p><i>[
! 2010-11-11 Daniel asks the working group whether they would prefer a replacement
! for the second bullet of the proposed resolution (a result of discussing this
! with Alberto) of the form:
  ]</i></p>
  
  
  <p>
! Add to 20.8.15 [unord.hash]/1 a new bullet:
  </p>
  
- <blockquote>
  <p>
! 1 The unordered associative containers defined in Clause 23.5 use
! specializations of the class template <tt>hash</tt>
! as the default hash function. For all object types <tt>Key</tt> for which there
! exists a specialization <tt>hash&lt;Key&gt;</tt>, the
! instantiation <tt>hash&lt;Key&gt;</tt> shall:
  </p>
! <ul>
  <li>
! satisfy the <tt>Hash</tt> requirements (20.2.4), with <tt>Key</tt> as the
! function call argument type, the <tt>DefaultConstructible</tt> requirements
! (33), the <tt>CopyAssignable</tt> requirements (37),
  </li>
  <li>
! be swappable (20.2.2) for lvalues,
  </li>
  <li>
! provide two nested types <tt>result_type</tt> and <tt>argument_type</tt> which
! shall be synonyms for <tt>size_t</tt> and <tt>Key</tt>, respectively,
  </li>
  <li>
! satisfy the requirement that if <tt>k1 == k2</tt> is true, <tt>h(k1) ==
! h(k2)</tt> is also true, where <tt>h</tt> is an object of type
! <tt>hash&lt;Key&gt;</tt> and <tt>k1</tt> and <tt>k2</tt> are objects of type
! <tt>Key</tt><ins>,</ins><del>.</del>
  </li>
  <li>
! <ins>satisfy the requirement <tt>noexcept(h(k)) == true</tt>, where <tt>h</tt> is an object
! of type <tt>hash&lt;Key&gt;</tt> and <tt>k</tt> is an object of type <tt>Key</tt>, unless 
! <tt>hash&lt;Key&gt;</tt> is a user-defined specialization that depends on at least one user-defined type.</ins>
  </li>
  </ul>
! </blockquote>
  
  
  
! <p><i>[Batavia: Closed as NAD Future, then reopened. See the wiki for Tuesday.]</i></p>
  
  
  <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
  <p>
! Change Table 40 — Hash requirements [hash] as indicated:
  </p>
  
! <blockquote>
! <table border="1">
  
! <caption>Table 40 — Hash requirements [hash]</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Requirement</th>
  </tr>
  
  <tr>
! <td><tt>h(k)</tt></td>
! <td><tt>size_t</tt></td>
! <td><del>Shall not throw exceptions.</del> [..]</td>
  </tr>
  
! </tbody></table>
  </blockquote>
- </li>
  
- <li>
  <p>
! Add to 20.8.15 [unord.hash]/1 a new bullet:
  </p>
  
- <blockquote>
  <p>
! 1 The unordered associative containers defined in Clause 23.5 use
! specializations of the class template <tt>hash</tt>
! as the default hash function. For all object types <tt>Key</tt> for which there
! exists a specialization <tt>hash&lt;Key&gt;</tt>, the
! instantiation <tt>hash&lt;Key&gt;</tt> shall:
  </p>
! <ul>
  <li>
! satisfy the <tt>Hash</tt> requirements (20.2.4), with <tt>Key</tt> as the
! function call argument type, the <tt>DefaultConstructible</tt> requirements
! (33), the <tt>CopyAssignable</tt> requirements (37),
  </li>
  <li>
! be swappable (20.2.2) for lvalues,
  </li>
  <li>
! provide two nested types <tt>result_type</tt> and <tt>argument_type</tt> which
! shall be synonyms for <tt>size_t</tt> and <tt>Key</tt>, respectively,
  </li>
  <li>
! satisfy the requirement that if <tt>k1 == k2</tt> is true, <tt>h(k1) ==
! h(k2)</tt> is also true, where <tt>h</tt> is an object of type
! <tt>hash&lt;Key&gt;</tt> and <tt>k1</tt> and <tt>k2</tt> are objects of type
! <tt>Key</tt><ins>,</ins><del>.</del>
  </li>
  <li>
! <ins>satisfy the requirement that the expression <tt>h(k)</tt>, where <tt>h</tt>
! is an object of type <tt>hash&lt;Key&gt;</tt> and <tt>k</tt> is an object of
! type <tt>Key</tt>, shall not throw an exception, unless
! <tt>hash&lt;Key&gt;</tt> is a user-defined specialization that depends on at
! least one user-defined type.</ins>
  </li>
! </ul>
! </blockquote>
  </li>
  </ol>
  
  
  
  
  
  
  <hr>
! <h3><a name="1345"></a>1345. [FCD] Library classes should have <tt>noexcept</tt> move operations</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-31</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-61</b></p>
  <p>
! All library types should have non-throwing move
! constructors and move-assignment operators unless
! wrapping a type with a potentially throwing move operation.
! When such a type is a class-template, these
! operations should have a conditional <tt>noexcept</tt>
! specification.
  </p>
  <p>
! There are many other places where a <tt>noexcept</tt>
! specification may be considered, but the move operations
! are a special case that must be called out, to effectively
! support the <tt>move_if_noexcept</tt> function template.
  </p>
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  <p>
! Review every class and class template in the
! library. If noexcept move constructor/assignment
! operators can be implicitly declared, then they
! should be implicitly declared, or explicitly
! defaulted. Otherwise, a move constructor/moveassingment
! operator with a <tt>noexcept</tt> exception
! specification should be provided.
  </p>
  
- <p><i>[
- 2010-10-31 Daniel comments:
- ]</i></p>
  
  
  <blockquote>
! The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3157.html">n3157</a>
! would satisfy this request.
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
- See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3157.html">n3157</a>
  
  
  
  
  
  <hr>
! <h3><a name="1348"></a>1348. [FCD] Exception safety of unspecified types</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-25</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-64</b></p>
  <p>
! There are a number of unspecified types used throughout
! the library, such as the container iterators. Many of these
! unspecified types have restrictions or expectations on
! their behaviour in terms of exceptions. Are they permitted
! or required to use exception specifications, more
! specifically the new <tt>noexcept</tt> specification? For example,
! if <tt>vector&lt;T&gt;::iterator</tt> is implemented as a native pointer,
! all its operations will have an (effective) <tt>noexcept</tt>
! specification. If the implementation uses a class type to
! implement this iterator, is it permitted or required to
! support that same guarantee?
  </p>
  
! <p><i>[
! Resolution proposed by ballot comment
! ]</i></p>
  
  <p>
! Clearly state the requirements for exception
! specifications on all unspecified library types. For
! example, all container iterator operations should
! be conditionally <tt>noexcept</tt>, with the condition
! matching the same operation applied to the
! allocator's <tt>pointer_type</tt>, a certain subset of which
! are already required not to throw.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
  
--- 8692,13796 ----
  
  
  <hr>
! <h3><a name="2077"></a>2077. Further incomplete constraints for type traits</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-08-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! The currently agreed on proposed wording for <a href="lwg-defects.html#2015">2015</a> using 
! <tt>remove_all_extents&lt;T&gt;::type</tt> instead of the "an array of 
! unknown bound" terminology in the precondition should be extended to 
! some further entries especially in Table 49, notably the 
! <tt>is_*constructible</tt>, <tt>is_*assignable</tt>, and 
! <tt>is_*destructible</tt> entries. To prevent ODR violations, incomplete
! element types of arrays must be excluded for value-initialization and
! destruction for example. Construction and assignment has to be honored, 
! when we have array-to-pointer conversions or pointer conversions of
! incomplete pointees in effect.
  </p>
  
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! The issue is that in three type traits, we are accidentally saying that in certain
! circumstances the type must give a specified answer when given an incomplete type.
! (Specifically: an array of unknown bound of incomplete type.)  The issue asserts
! that there's an ODR violation, since the trait returns false in that case but might
! return a different version when the trait is completed.
! </p>
! <p>
! Howard argues: no, there is no risk of an ODR violation.
! <tt>is_constructible&lt;A[]></tt> must return <tt>false</tt> regardless of whether
! <tt>A</tt> is complete, so there's no reason to forbid an array of unknown bound of
! incomplete types. Same argument applies to <tt>is_assignable</tt>. General agreement
! with Howard's reasoning.
! </p>
! <p>
! There may be a real issue for <tt>is_destructible</tt>. None of us are sure what
! <tt>is_destructible</tt> is supposed to mean for an array of unknown bound
! (regardless of whether its type is complete), and the standard doesn't make it clear.
! The middle column doesn't say what it's supposed to do for incomplete types.
! </p>
! <p>
! In at least one implementation, <tt>is_destructible&lt;A[]></tt> does return <tt>true</tt>
! if <tt>A</tt> is complete, which would result in ODR violation unless we forbid it for
! incomplete types.
! </p>
! <p>
! Move to open. We believe there is no issue for <tt>is_constructible</tt> or
! <tt>is_assignable</tt>, but that there is a real issue for <tt>is_destructible</tt>.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
  
  
+ 
+ 
+ <hr>
+ <h3><a name="2088"></a>2088. <tt>std::terminate</tt> problem</h3>
+ <p><b>Section:</b> 18.8.3 [exception.terminate] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-09-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ Andrzej Krzemienski reported the following on comp.std.c++:
+ </p>
  <blockquote>
  <p>
! In N3290, which is to become the official standard, in 18.8.3.4 [terminate],
! paragraph 1 reads
! </p>
! <blockquote><p>
! <i>Remarks</i>: Called by the implementation when exception handling must
! be abandoned for any of several reasons (15.5.1), in effect immediately after 
! evaluating the <em>throw-expression</em> (18.8.3.1). May also be called directly by the 
! program.
! </p></blockquote>
! <p>It is not clear what is "in effect". It was clear in previous drafts where paragraphs 
! 1 and 2 read:
! </p>
! <blockquote><p>
! Called by the implementation when exception handling must be
! abandoned for any of several reasons (15.5.1). May also be called directly
! by the program.
! <p/>
! <i>Effects</i>: Calls the <tt>terminate_handler</tt> function in effect
! immediately after evaluating the <em>throw-expression</em> (18.8.3.1), if called by the
! implementation, or calls the current <tt>terminate_handler</tt> function,
! if called by the program.
! </p>
! </blockquote>
! <p>
! It was changed by N3189. The same applies to function unexpected (D. 11.4, paragraph 1).
! <p/>
! Assuming the previous wording is still intended, the wording can be read
! "unless <tt>std::terminate</tt> is called by the program, we will use the handler
! that was in effect immediately after evaluating the throw-expression".
! <p/>
!   This assumes that there is some throw-expression connected to every
!   situation that triggers the call to <tt>std::terminate</tt>. But this is not
!   the case:
! </p>
! <ul>
! <li>
!   In case <tt>std::thread</tt> is assigned to or destroyed while being joinable
!   there is no throw-expression involved.
! </li>
! <li>
!   In case <tt>std::unexpected</tt> is called by the program, <tt>std::terminate</tt> is
!   triggered by the implementation - no throw-expression involved.
! </li>
! <li>
!   In case a destructor throws during stack unwinding we have two throw-expressions 
!   involved.
!  </li>
!  </ul>
! <p>
! Which one is referred to?
! <p/>
! In case <tt>std::nested_exception::rethrow_nested</tt> is called for an object that has 
! captured no exception, there is no throw-expression involved directly (and may no throw 
! be involved even indirectly).
! <p/>
! Next, 18.8.3.1 [terminate.handler], paragraph 2 says 
! </p>
! <blockquote><p>
! <i>Required behavior</i>: A <tt>terminate_handler</tt> shall terminate execution
! of the program without returning to the caller.
! </p></blockquote>
! <p>
! This seems to allow that the function may exit by throwing an
! exception (because word "return" implies a normal return).
! <p/>
! One could argue that words "terminate execution of the program" are sufficient,
! but then why "without returning to the caller" would be mentioned. In
! case such handler throws, noexcept specification in function <tt>std::terminate</tt> 
! is violated, and <tt>std::terminate</tt> would be called recursively - should 
! <tt>std::abort</tt> not be called in case of recursive <tt>std::terminate</tt> 
! call? On the other hand some controlled recursion could be useful, like in the 
! <a href="http://cplusplus.co.il/2010/03/21/catching-uncaught-exceptions-within-terminate/">following technique</a>.
  </p>
+ </blockquote>
  
  <p>
! The here mentioned wording changes by N3189 in regard to 18.8.3.4 [terminate] p1 
! were done for a better separation of effects (Effects element) and additional normative 
! wording explanations (Remarks element), there was no meaning change intended. Further,
! there was already a defect existing in the previous wording, which was not updated when 
! further situations where defined, when <tt>std::terminate</tt> where supposed to be 
! called by the implementation. 
! <p/>
! The part
! <p/>
! "in effect immediately after evaluating the throw-expression"
! <p/>
! should be removed and the quoted reference to 18.8.3.1 [terminate.handler] 
! need to be part of the effects element where it refers to the current <tt>terminate_handler</tt> 
! function, so should be moved just after
! <p/>
! "Effects: Calls the current <tt>terminate_handler</tt> function."
! <p/>
! It seems ok to allow a termination handler to exit via an exception, but the 
! suggested idiom should better be replaced by a more simpler one based on
! evaluating the current exception pointer in the terminate handler, e.g.
  </p>
+ <blockquote><pre>
+ void our_terminate (void) {
+   std::exception_ptr p = std::current_exception();
+   if (p) {
+     ... // OK to rethrow and to determine it's nature
+   } else {
+     ... // Do something else
+   }
+ }
+ </pre></blockquote>
  
! <p><i>[2011-12-09: Daniel comments]</i></p>
! 
! 
! <p>
! A related issue is <a href="lwg-active.html#2111">2111</a>.
! </p>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Open.
! </p>
! <p>
! There is an interaction with Core issues in this area that Jens is already supplying wording
! for.  Review this issue again once Jens wording is available.
! </p>
! <p>
! Alisdair to review clause 15.5 (per Jens suggestion) and recommend any changes, then integrate
! Jens wording into this issue.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2089"></a>2089. <tt>std::allocator::construct</tt> should use uniform initialization</h3>
! <p><b>Section:</b> 20.7.9.1 [allocator.members] <b>Status:</b> <a href="lwg-active.html#EWG">EWG</a>
!  <b>Submitter:</b> David Krauss <b>Opened:</b> 2011-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#EWG">EWG</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! When the <tt>EmplaceConstructible</tt> (23.2.1 [container.requirements.general]&#47;13) requirement is used 
! to initialize an object, direct-initialization occurs. Initializing an aggregate or using a <tt>std::initializer_list</tt> 
! constructor with emplace requires naming the initialized type and moving a temporary. This is a result of 
! <tt>std::allocator::construct</tt> using direct-initialization, not list-initialization (sometimes called "uniform 
! initialization") syntax.
! <p/>
! Altering <tt>std::allocator&lt;T&gt;::construct</tt> to use list-initialization would, among other things, give 
! preference to <tt>std::initializer_list</tt> constructor overloads, breaking valid code in an unintuitive and 
! unfixable way &mdash; there would be no way for <tt>emplace_back</tt> to access a constructor preempted by 
! <tt>std::initializer_list</tt> without essentially reimplementing <tt>push_back</tt>.
! </p>
! <blockquote><pre>
! std::vector&lt;std::vector&lt;int&gt;&gt; v;
! v.emplace_back(3, 4); // v[0] == {4, 4, 4}, not {3, 4} as in list-initialization
  </pre></blockquote>
+ <p>
+ The proposed compromise is to use SFINAE with <tt>std::is_constructible</tt>, which tests whether direct-initialization 
+ is well formed. If <tt>is_constructible</tt> is false, then an alternative <tt>std::allocator::construct</tt> overload 
+ is chosen which uses list-initialization. Since list-initialization always falls back on direct-initialization, the 
+ user will see diagnostic messages as if list-initialization (uniform-initialization) were always being used, because 
+ the direct-initialization overload cannot fail.
+ <p/>
+ I can see two corner cases that expose gaps in this scheme. One occurs when arguments intended for 
+ <tt>std::initializer_list</tt> satisfy a constructor, such as trying to emplace-insert a value of <tt>{3, 4}</tt> in 
+ the above example. The workaround is to explicitly specify the <tt>std::initializer_list</tt> type, as in 
+ <tt>v.emplace_back(std::initializer_list&lt;int&gt;(3, 4))</tt>. Since this matches the semantics as if 
+ <tt>std::initializer_list</tt> were deduced, there seems to be no real problem here.
+ <p/>
+ The other case is when arguments intended for aggregate initialization satisfy a constructor. Since aggregates cannot 
+ have user-defined constructors, this requires that the first nonstatic data member of the aggregate be implicitly 
+ convertible from the aggregate type, and that the initializer list have one element. The workaround is to supply an 
+ initializer for the second member. It remains impossible to in-place construct an aggregate with only one nonstatic 
+ data member by conversion from a type convertible to the aggregate's own type. This seems like an acceptably small 
+ hole.
+ <p/>
+ The change is quite small because <tt>EmplaceConstructible</tt> is defined in terms of whatever allocator is specified, 
+ and there is no need to explicitly mention SFINAE in the normative text.
+ </p>
+ 
+ <p><i>[2012, Kona]</i></p>
  
  <p>
! Move to Open.
! </p>
! <p>
! There appears to be a real concern with initializing aggregates, that can be performed only
! using brace-initialization.  There is little interest in the rest of the issue, given the existence
! of 'emplace' methods in C++11.
! </p>
! <p>
! Move to Open, to find an acceptable solution for intializing aggregates.  There is the potential
! that EWG may have an interest in this area of language consistency as well.
  </p>
  
+ <p><i>[2013-10-13, Ville]</i></p>
+ 
  <p>
! This issue is related to <a href="lwg-active.html#2070">2070</a>.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Move to EWG, Ville to write a paper. 
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change 20.7.9.1 [allocator.members] p12 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class U, class... Args&gt;
!   void construct(U* p, Args&amp;&amp;... args);
! </pre><blockquote>
! <p>
! 12 <i>Effects</i>: <tt>::new((void *)p) U(std::forward&lt;Args&gt;(args)...)</tt> <ins>if <tt>is_constructible&lt;U, Args...&gt;::value</tt> 
! is <tt>true</tt>, else <tt>::new((void *)p) U{std::forward&lt;Args&gt;(args)...}</tt></ins>
! </p>
! </blockquote></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2095"></a>2095. <tt>promise</tt> and <tt>packaged_task</tt> missing constructors needed for uses-allocator construction</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise], 30.6.9 [futures.task] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-11-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! This example is ill-formed according to C++11 because <tt>uses_allocator&lt;promise&lt;R&gt;, A&gt;::value</tt> is true, but
! <tt>is_constructible&lt;promise&lt;R&gt;, A, promise&lt;R&gt;&amp;&amp;&gt;::value</tt> is false. Similarly for <tt>packaged_task</tt>.
! </p>
! <blockquote><pre>
! #include &lt;future&gt;
! #include &lt;memory&gt;
! #include &lt;tuple&gt;
! 
! using namespace std;
! 
! typedef packaged_task&lt;void()&gt; task;
! typedef promise&lt;void&gt; prom;
! allocator&lt;task&gt; a;
! 
! tuple&lt;task, prom&gt; t1{ allocator_arg, a };
! tuple&lt;task, prom&gt; t2{ allocator_arg, a, task{}, prom{} };
! </pre></blockquote>
! 
! <p><i>[2012, Portland]</i></p>
! 
! <p>
! This is an allocator issue, and should be dealt with directly by LWG.
! </p>
! 
! <p><i>[2013-03-06]</i></p>
! 
! 
! <p>
! Jonathan suggests to make the new constructors non-explicit and makes some representational improvements.
! </p>
! 
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Move to deferred.
! </p>
! <p>
! This issue has much in common with similar problems with <tt>std::function</tt> that are being addressed
! by the polymorphic allocators proposal currently under evaluation in LEWG.  Defer further discussion on
! this topic until the final outcome of that paper and its proposed resolution is known.
! </p>
! 
! <p><i>[2014-02-20 Re-open Deferred issues as Priority 4]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p><i>[This wording is relative to the FDIS.]</i></p>
! 
! 
! <ol>
! <li><p>Add to 30.6.5 [futures.promise], class template <tt>promise</tt> synopsis, 
! as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class R&gt;
!   class promise {
!   public:
!     promise();
!     template &lt;class Allocator&gt;
!     promise(allocator_arg_t, const Allocator&amp; a);
!     <ins>template &lt;class Allocator&gt;
!     promise(allocator_arg_t, const Allocator&amp; a, promise&amp;&amp; rhs) noexcept;</ins>
!     promise(promise&amp;&amp; rhs) noexcept;
!     promise(const promise&amp; rhs) = delete;
!     ~promise();	
!     [&hellip;]
!   };
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 30.6.5 [futures.promise] as indicated:</p>
! 
! <blockquote><pre>
! promise(promise&amp;&amp; rhs) noexcept;
! <ins>template &lt;class Allocator&gt;
! promise(allocator_arg_t, const Allocator&amp; a, promise&amp;&amp; rhs) noexcept;</ins>
! </pre><blockquote>
! <p>
! -5- <i>Effects</i>: constructs a new <tt>promise</tt> object and transfers ownership of 
! the shared state of <tt>rhs</tt> (if any) to the newly-constructed object.
! <p/>
! -6- <i>Postcondition</i>: <tt>rhs</tt> has no shared state.
! <p/>
! <ins>-?- [<i>Note</i>: <tt>a</tt> is not used &mdash; <i>end note</i>]</ins>
! </p>
! </blockquote></blockquote>
! 
! </li>
! 
! <li><p>Add to 30.6.9 [futures.task], class template <tt>packaged_task</tt> synopsis, 
! as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template&lt;class&gt; class packaged_task; // <i>undefined</i>
! 
!   template&lt;class R, class... ArgTypes&gt;
!   class packaged_task&lt;R(ArgTypes...)&gt; {
!   public:
!     // construction and destruction
!     packaged_task() noexcept;
!     <ins>template &lt;class Allocator&gt;
!       packaged_task(allocator_arg_t, const Allocator&amp; a) noexcept;</ins>
!     template &lt;class F&gt;
!       explicit packaged_task(F&amp;&amp; f);
!     template &lt;class F, class Allocator&gt;
!       explicit packaged_task(allocator_arg_t, const Allocator&amp; a, F&amp;&amp; f);
!     ~packaged_task();
! 	
!     // no copy
!     packaged_task(const packaged_task&amp;) = delete;
!     <ins>template&lt;class Allocator&gt;
!       packaged_task(allocator_arg_t, const Allocator&amp; a, const packaged_task&amp;) = delete;</ins>
!     packaged_task&amp; operator=(const packaged_task&amp;) = delete;
!     
!     // move support
!     packaged_task(packaged_task&amp;&amp; rhs) noexcept;
!     <ins>template &lt;class Allocator&gt;
!       packaged_task(allocator_arg_t, const Allocator&amp; a, packaged_task&amp;&amp; rhs) noexcept;</ins>
!     packaged_task&amp; operator=(packaged_task&amp;&amp; rhs) noexcept;
!     void swap(packaged_task&amp; other) noexcept;
!     [&hellip;]
!   };
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 30.6.9.1 [futures.task.members] as indicated:</p>
! 
! <blockquote><pre>
! packaged_task() noexcept;
! <ins>template &lt;class Allocator&gt;
!   packaged_task(allocator_arg_t, const Allocator&amp; a) noexcept;</ins>
! </pre><blockquote>
! <p>
! -1- <i>Effects</i>: constructs a <tt>packaged_task</tt> object with no shared state and no stored task.
! <p/>
! <ins>-?- [<i>Note</i>: <tt>a</tt> is not used &mdash; <i>end note</i>]</ins>
! </p>
! </blockquote></blockquote>
! <p>[&hellip;]</p>
! <blockquote><pre>
! packaged_task(packaged_task&amp;&amp; rhs) noexcept;
! <ins>template &lt;class Allocator&gt;
!   packaged_task(allocator_arg_t, const Allocator&amp; a, packaged_task&amp;&amp; rhs) noexcept;</ins>
! </pre><blockquote>
! <p>
! -5- <i>Effects</i>: constructs a new <tt>packaged_task</tt> object and transfers ownership of <tt>rhs</tt>'s 
! shared state to <tt>*this</tt>, leaving <tt>rhs</tt> with no shared state. Moves the stored task from <tt>rhs</tt> 
! to <tt>*this</tt>.
! <p/>
! -6- <i>Postcondition</i>: <tt>rhs</tt> has no shared state.
! <p/>
! <ins>-?- [<i>Note</i>: <tt>a</tt> is not used &mdash; <i>end note</i>]</ins>
! </p>
! </blockquote></blockquote>
! 
! </li>
! </ol>
! 
! <blockquote><pre>
! </pre><blockquote>
! <p>
! </p></blockquote></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2101"></a>2101. Some transformation types can produce impossible types</h3>
! <p><b>Section:</b> 20.10.7 [meta.trans] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-11-18 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Table 53 &mdash; "Reference modifications" says in regard to the type trait 
! <tt>add_lvalue_reference</tt> (emphasize mine)
! </p>
! 
! <blockquote>
! <p>
! If <tt>T</tt> names an object or <strong>function</strong> type then the member typedef type
! shall name <tt>T&amp;</tt>;
! </p>
! </blockquote>
! 
! <p>
! The problem with this specification is that function types with <i>cv</i>-qualifier or <i>ref</i>-qualifier, 
! like
! </p>
! <blockquote><pre>
! void() const
! void() &amp;
! </pre></blockquote>
! <p>
! are also affected by the first part of the rule, but this would essentially mean, that
! instantiating <tt>add_lvalue_reference</tt> with such a type would attempt to form
! a type that is not defined in the C++ type system, namely
! </p>
! <blockquote><pre>
! void(&amp;)() const
! void(&amp;)() &amp;
! </pre></blockquote>
! <p>
! The general policy for <i>TransformationTrait</i>s is to define always some meaningful 
! mapping type, but this does not hold for <tt>add_lvalue_reference</tt>, <tt>add_rvalue_reference</tt>,
! and in addition to these two for <tt>add_pointer</tt> as well. The latter one would 
! attempt to form the invalid types
! </p>
! <blockquote><pre>
! void(*)() const
! void(*)() &amp;
! </pre></blockquote>
! <p>
! A possible reason why those traits were specified in this way is that in C++03 (and that means
! for TR1), <i>cv</i>-qualifier were underspecified in the core language and several compilers
! just ignored them during template instantiations. This situation became fixed by adopting
! CWG issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#295">295</a> and 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#547">547</a>.
! <p/>
! While there is possibly some core language clarification needed (see reflector messages
! starting from c++std-core-20740), it seems also clear that the library should fix the
! specification. The suggested resolution follows the style of the specification of the
! support concepts <tt>PointeeType</tt> and <tt>ReferentType</tt> defined in 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>.
! </p>
! 
! 
! <p><i>[2012-02-10, Kona]</i></p>
! 
! <p>
! Move to NAD.
! </p>
! <p>
! These cv- and ref-qualified function types are aberrations in the type system, and do
! not represent any actual entity defined by the language.  The notion of cv- and ref-
! qualification applies only to the implicit <tt>*this</tt> reference in a member function.
! </p>
! <p>
! However, these types can be produced by quirks of template metaprogramming, the question
! remains what the library should do about it.  For example, <tt>add_reference</tt> returns
! the original type if passed a reference type, or a <tt>void</tt> type.  Conversely,
! <tt>add_pointer</tt> will return a pointer to the referenced type when passed a reference.
! </p>
! <p>
! It is most likely that the 'right' answer in any case will depend on the context that the
! question is being asked, in terms of forming these obscure types.  The best the LWG can
! do is allow an error to propagate back to the user, so they can provide their own meaningful
! answer in their context - with additional metaprogramming on their part.  The consensus is
! that if anyone is dangerous enough with templates to get themselves into this problem, they
! will also have the skills to resolve the problem themselves.  This is not going to trip up
! the non-expert developer.
! </p>
! <p>
! Lastly, it was noted that this problem arises only because the language is inconsistent in
! providing us these nonsense types that do no really represent anything in the language.
! There may be some way Core or Evolution could give us a more consistent type system so that
! the LWG does not need to invent an answer at all, should this question need resolving.  This
! is another reason to not specify anything at the LWG trait level at this time, leaving the
! other working groups free to produce the 'right' answer that we can then follow without
! changing the meaning of existing, well-defined programs.
! </p>
! 
! <p><i>[2012-02-10, post-Kona]</i></p>
! 
! <p>
! Move back to Open. Daniel is concerned that this is not an issue we can simply ignore,
! further details to follow.
! </p>
! 
! <p><i>[2012-10-06, Daniel comments]</i></p>
! 
! <p>
! This issue really should be resolved as a defect: First, the argument that "forming these obscure types"
! should "allow an error to propagate" is inconsistent with the exact same "obscure type" that would be formed
! when <tt>std::add_lvalue_reference&lt;void&gt;</tt> wouldn't have an extra rules for <tt>void</tt> types, which
! also cannot form references. The originally proposed resolution attempts to apply the same solution for the same 
! common property of <tt>void</tt> types and function types with <em>cv</em>-qualifiers or <em>ref</em>-qualifier.
! These functions had the property of <tt>ReferentType</tt> during concept time (see 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#749">CWG 749</a> bullet three for the final 
! wording).
! <p/>
! Core issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#1417">CWG 1417</a> has clarified
! that any attempt to form a reference of a pointer to a function type with <em>cv</em>-qualifiers or 
! <em>ref</em>-qualifier is ill-formed. Unfortunately, many compilers don't implement this yet.
! <p/>
! I also would like to warn about so-called "obscure" types: The problem is that these can occur as the side effect
! of finding a best match overload of function templates, where this type is exactly correct for one of these
! overloads, but causes a deep (not-sfinae-friendly) error for others where one of these traits are part of the 
! signature.
! <p/>
! Existing experience with <tt>void</tt> types shows, that this extra rule is not so unexpected. Further, any usage 
! of the result types of these traits as argument types or return types of functions would make these ill-formed 
! (and in a template context would be sfinaed away), so the expected effects are rarely unnoticed. Checking
! all existing explicit usages of the traits <tt>add_rvalue_reference</tt>, <tt>add_lvalue_reference</tt>, and
! <tt>add_pointer</tt> didn't show any example where the error would be silent: <tt>add_rvalue_reference</tt>
! is used to specify the return value of <tt>declval()</tt> and the instantiation of <tt>declval&lt;void() const&gt;()</tt>
! would be invalid, because of the attempt to return a function type. Similarly, <tt>add_lvalue_reference</tt>
! is used to specify the return type of <tt>unique_ptr&lt;T&gt;::operator*()</tt>. Again, any instantiation with 
! <tt>void() const</tt> wouldn't remain unnoticed. The trait <tt>add_pointer</tt> is used to specify the trait
! <tt>std::decay</tt> and this is an interesting example, because it is well-formed when instantiated with <tt>void</tt> 
! types, too, and is heavily used throughout the library specification. All use-cases would not be negatively affected 
! by the suggested acceptance of function types with <em>cv</em>-qualifiers or <em>ref</em>-qualifier, because they involve 
! types that are either function arguments, function parameters or types were references are formed from.
! <p/>
! The alternative would be to add an additional extra rule that doesn't define a type member 'type' when
! we have a function type with <em>cv</em>-qualifiers or <em>ref</em>-qualifier. This is better than the
! current state but it is not superior than the proposal to specify the result as the original type, because
! both variants are sfinae-friendly. A further disadvantage of the "non-type" approach here would be that any
! usage of <tt>std::decay</tt> would require special protection against these function types, because 
! instantiating <tt>std::decay&lt;void() const&gt;</tt> again would lead to a deep, sfinae-unfriendly error.
! <p/>
! The following example demonstrates the problem: Even though the second <tt>f</tt> template is the best final
! match here, the first one will be instantiated. During that process <tt>std::decay&lt;T&gt;::type</tt>
! becomes instantiated as well and will raise a deep error, because as part of the implementation the trait
! <tt>std::add_pointer&lt;void() const&gt;</tt> becomes instantiated:
  </p>
+ <blockquote><pre>
+ #include &lt;type_traits&gt;
+ 
+ template&lt;class T&gt;
+ typename std::decay&lt;T&gt;::type f(T&amp;&amp; t);
+ 
+ template&lt;class T, class U&gt;
+ U f(U u);
+ 
+ int main() {
+   f&lt;void() const&gt;(0);
+ }
+ </pre></blockquote>
+ <p>
+ When the here proposed resolution would be applied this program would be well-formed and selects the expected function.
+ </p>
+ 
+ <p>
+ <strong>Previous resolution from Daniel [SUPERSEDED]:</strong>
+ </p>
+ <blockquote class="note">
+ <ol>
+ <li><p>Change Table 53 &mdash; "Reference modifications" in 20.10.7.2 [meta.trans.ref] as indicated:</p>
+ 
+ <table border="1">
+ <caption>Table 53 &mdash; Reference modifications</caption>
+ <tr>
+ <th>Template</th>
+ <th>Comments</th>
+ </tr> 
+ 
+ <tr>
+ <td colspan="2" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>template &lt;class T&gt;<br/>
+ struct<br/>
+ add_lvalue_reference;</tt>
+ </td>
+ <td>
+ If <tt>T</tt> names an object <tt>type</tt> or <ins>if <tt>T</tt> names a</ins> function type <ins>that does not have<br/>
+ <i>cv</i>-qualifiers or a <i>ref</i>-qualifier</ins> then the member typedef <tt>type</tt><br/>
+ shall name <tt>T&amp;</tt>; otherwise, if <tt>T</tt> names a type "rvalue reference to <tt>T1</tt>" then<br/>
+ the member typedef <tt>type</tt> shall name <tt>T1&amp;</tt>; otherwise, <tt>type</tt> shall name <tt>T</tt>.
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>template &lt;class T&gt;<br/>
+ struct<br/>
+ add_rvalue_reference;</tt>
+ </td>
+ <td>
+ If <tt>T</tt> names an object <tt>type</tt> or <ins>if <tt>T</tt> names a</ins> function type <ins>that does not have<br/>
+ <i>cv</i>-qualifiers or a <i>ref</i>-qualifier</ins> then the member typedef <tt>type</tt><br/>
+ shall name <tt>T&amp;&amp;</tt>; otherwise, <tt>type</tt> shall name <tt>T</tt>. [<i>Note</i>: This rule reflects<br/>
+ the semantics of reference collapsing (8.3.2 [dcl.ref]). For example, when a type <tt>T</tt><br/>
+ names a type <tt>T1&amp;</tt>, the type <tt>add_rvalue_reference&lt;T&gt;::type</tt> is not an<br/>
+ rvalue reference. &mdash; <i>end note</i>]
+ </td>
+ </tr>
+ </table>
+ 
+ </li>
+ 
+ <li><p>Change Table 56 &mdash; "Pointer modifications" in 20.10.7.5 [meta.trans.ptr] as indicated:</p>
+ 
+ <table border="1">
+ <caption>Table 56 &mdash; Pointer modifications</caption>
+ <tr>
+ <th>Template</th>
+ <th>Comments</th>
+ </tr> 
+ 
+ <tr>
+ <td colspan="2" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>template &lt;class T&gt;<br/>
+ struct add_pointer;</tt>
+ </td>
+ <td>
+ <del>The member typedef <tt>type</tt> shall name the same type as</del><br/>
+ <ins>If <tt>T</tt> names a function type that has <i>cv</i>-qualifiers or a <i>ref</i>-qualifier<br/>
+ then the member typedef <tt>type</tt> shall name <tt>T</tt>; otherwise, it<br/> 
+ shall name the same type as</ins> <tt>remove_reference&lt;T&gt;::type*</tt>.
+ </td>
+ </tr>
+ 
+ </table>
+ 
+ </li>
+ </ol>
  </blockquote>
  
+ <p>
+ The following revised proposed resolution defines - in the absence of a proper core language definition - a new
+ term <em>referenceable type</em> as also suggested by the resolution for LWG <a href="lwg-defects.html#2196">2196</a> as an
+ umbrella of the negation of <tt>void</tt> types and function types with <em>cv</em>-qualifiers or <em>ref</em>-qualifier. 
+ This simplifies and minimizes the requires wording changes.
+ </p>
+ 
  <p><i>[
! 2013-09-26, Daniel synchronizes wording with recent draft
! ]</i></p>
! 
! 
! <p><i>[
! 2014-05-18, Daniel synchronizes wording with recent draft and comments
  ]</i></p>
  
  
  <p>
! My impression is that this urgency of action this issue attempts to point out is partly caused by the fact that even for
! the most recent C++14 compilers the implementations have just recently changed to adopt the core wording. Examples for these
! are bug reports to <a href="https://gcc.gnu.org/bugzilla/show_bug.cgi?id=61182">gcc</a> or 
! <a href="http://llvm.org/bugs/show_bug.cgi?id=19742">clang</a>.
! <p/>
! Occasionally the argument has been presented to me that the suggested changes to the traits affected by this issue would
! lead to irregularities compared to other traits, especially the lack of guarantee that <tt>add_pointer</tt> might not return
! a pointer or that <tt>add_(l/r)value_reference</tt> might not return a reference type. I would like to point out that this
! kind of divergence is actually already present in most <tt>add/remove</tt> traits: For example, we have no guarantee that
! <tt>add_const</tt> returns a const type (Reference types or function types get special treatments), or that <tt>add_rvalue_reference</tt>
! returns an rvalue-reference (e.g. when applied to an lvalue-reference type).
! <p/>
! Zhihao Yuan brought to my attention, that the originally proposing paper 
! <a href="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2002/n1345.html">N1345</a> carefully discussed these design choices.
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! MC: move to Ready: in favor: 16, opposed: 0, abstain: 1<br/>
! STL: have libstdc++, libc++ implemented this? we would need to change your implementation<br/>
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
  <ol>
! <li><p>Change Table 53 &mdash; "Reference modifications" in 20.10.7.2 [meta.trans.ref] as indicated:</p>
! 
! <table border="1">
! <caption>Table 53 &mdash; Reference modifications</caption>
! <tr>
! <th>Template</th>
! <th>Comments</th>
! </tr> 
! 
! <tr>
! <td colspan="2" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;<br/>
! struct<br/>
! add_lvalue_reference;</tt>
! </td>
! <td>
! If <tt>T</tt> names <del>an object or function type</del><ins>a referenceable type</ins><br/>
! then the member typedef <tt>type</tt><br/>
! shall name <tt>T&amp;</tt>; otherwise, <del>if <tt>T</tt> names a type "rvalue reference to <tt>T1</tt>" then<br/>
! the member typedef <tt>type</tt> shall name <tt>T1&amp;</tt>; otherwise,</del> <tt>type</tt> shall name <tt>T</tt>.<br/>
! <ins>[<i>Note</i>: This rule reflects the semantics of reference collapsing (8.3.2 [dcl.ref]). &mdash; <i>end note</i>]</ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;<br/>
! struct<br/>
! add_rvalue_reference;</tt>
! </td>
! <td>
! If <tt>T</tt> names <del>an object or function type</del><ins>a referenceable type</ins><br/>
! then the member typedef <tt>type</tt><br/>
! shall name <tt>T&amp;&amp;</tt>; otherwise, <tt>type</tt> shall name <tt>T</tt>. [<i>Note</i>: This rule reflects<br/>
! the semantics of reference collapsing (8.3.2 [dcl.ref]). For example, when a type <tt>T</tt><br/>
! names a type <tt>T1&amp;</tt>, the type <tt>add_rvalue_reference_t&lt;T&gt;</tt> is not an<br/>
! rvalue reference. &mdash; <i>end note</i>]
! </td>
! </tr>
! </table>
! 
! </li>
! 
! <li><p>Change Table 56 &mdash; "Pointer modifications" in 20.10.7.5 [meta.trans.ptr] as indicated:</p>
! 
! <table border="1">
! <caption>Table 56 &mdash; Pointer modifications</caption>
! <tr>
! <th>Template</th>
! <th>Comments</th>
! </tr> 
! 
! <tr>
! <td colspan="2" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;<br/>
! struct add_pointer;</tt>
! </td>
! <td>
! <ins>If <tt>T</tt> names a referenceable type or a (possibly <i>cv</i>-qualified) <tt>void</tt> type then<br/></ins>
! <del>T</del><ins>t</ins>he member typedef <tt>type</tt> shall name the same type as<br/>
! <tt>remove_reference_t&lt;T&gt;*</tt><ins>; otherwise, <tt>type</tt> shall name <tt>T</tt></ins>.
! </td>
! </tr>
! 
! </table>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2111"></a>2111. Which <tt>unexpected</tt>&#47;<tt>terminate</tt> handler is called from the exception handling runtime?</h3>
! <p><b>Section:</b> 18.8.3.4 [terminate], D.8.4 [unexpected] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2011-12-06 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#terminate">issues</a> in [terminate].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! 
  <p>
! Prior to N3242, modified by N3189, we said this about <tt>unexpected()</tt>:
! </p>
! 
! <blockquote><p>
! <i>Effects</i>: Calls the <tt>unexpected_handler</tt> function in effect immediately after evaluating the throw-expression 
! (D.13.1), if called by the implementation, or calls the current <tt>unexpected_handler</tt>, if called by the program.
! </p></blockquote>
! 
! <p>
! and this about <tt>terminate()</tt>:
! </p>
! 
! <blockquote><p>
! <i>Effects</i>: Calls the <tt>terminate_handler</tt> function in effect immediately after evaluating the throw-expression (18.8.3.1), 
! if called by the implementation, or calls the current <tt>terminate_handler</tt> function, if called by the program.
! </p></blockquote>
! 
! <p>
! But now in both places we say:
  </p>
  
+ <blockquote><p>
+ Calls the current <tt>unexpected_handler</tt> function.
+ </p></blockquote>
+ 
+ <p>
+ and:
+ </p>
+ 
+ <blockquote><p>
+ Calls the current <tt>terminate</tt> function.
+ </p></blockquote>
+ 
+ <p>
+ The difference is that in C++98&#47;03 if a destructor reset a handler during stack unwinding, that new handler was 
+ not called if the unwinding later led to <tt>unexpected()</tt> or <tt>terminate()</tt> being called.  But these new 
+ words say that this new handler <em>is</em> called. This is an ABI-breaking change in the way exceptions are handled.  
+ Was this change intentional?
+ <p/>
+ N3189 was mainly about introducing exception safety and getters for the handlers. I don't recall the issue of 
+ <em>which</em> handler gets called being part of the discussion.
+ <p/>
+ I propose that we revert to the C++98&#47;03 behavior in this regard, lest ABI's such as the Itanium ABI are invalidated.  
+ A mechanical way to do this is to revert bullets 9 and 12 of N3189.
+ </p>
+ 
+ <p><i>[2011-12-09: Daniel comments]</i></p>
+ 
+ 
+ <p>
+ There was no such semantic change intended. It was an unfortunate side effect when trying to better separate different
+ responsibilities in the previous wording.
+ <p/>
+ A related issue is <a href="lwg-active.html#2088">2088</a>.
+ </p>
+ 
+ <p><i>[2012-01-30: Howard comments]</i></p>
+ 
+ 
+ <p>
+ The C++98&#47;03 wording is somewhat ambiguous:
+ </p>
+ <blockquote><p>
+ Calls the terminate_handler function in effect immediately after evaluating the throw-expression...
+ </p></blockquote>
+ <p>
+ There are potentially two throw-expressions being referred to here, and it is not clear if this sentence is referring to just the first or both:
+ </p>
+ <ol>
+ <li><tt>throw <i>assignment-expression</i>;</tt></li>
+ <li><tt>throw;</tt></li>
+ </ol>
+ <p>
+ There is ample evidence in current implementations that it is understood that <i>only</i> 
+ 1. was meant. But clearly both 1 and 2 could have been meant. We need a clarification. Does an execution 
+ of a rethrow (throw;) update which handlers can potentially be called?
+ </p>
+ <ol>
+ <li value="2"><tt>throw;</tt> // update handlers to get_xxx()?</li>
+ </ol>
+ <p>
+ My opinion: Go with existing practice, and clarify what that practice is, if surveys find that everyone 
+ does the same thing. Gcc 4.2 and Apple do 1. only, and do not reset the handlers to the current handlers 
+ on throw;.
+ <p/>
+ If current practice is not unanimously one way or the other, I have no strong opinion. I have not found 
+ a motivating use case for the use of any particular handler. Most applications set the handlers once at 
+ the beginning of the program and then do not change them, and so will not be impacted by whatever decision 
+ is made here.
+ </p>
+ 
+ <p><i>[2014-02-15 Issaquah: Move to Review]</i></p>
+ 
+ 
+ <p>
+ STL: Original change in N3242 came from trying to make set/get exception handler thread safe.
+ The issue requests we revert to 98/03, which Howard notes was already ambiguous.
+ </p>
+ 
+ <p>
+ Alisdair: Issue author thinks we made this change in C++11 without taking into account Itanium ABI,
+ which cannot implement the new semantic (without breaking compatibility).
+ </p>
+ 
+ <p>
+ Alisdair: original change in N3242 was trying to solve the problem of which handler is called when
+ the handler is changing in another thread, but this turns out to be an issue in even the
+ single-threaded case.
+ </p>
+ 
+ <p>
+ Pablo: despite wanting to make it thread safe, you are still changing a global
+ </p>
+ 
+ <p>
+ STL and Marshall confirm that there is real implementation divergance on the question, so
+ we cannot pick just one behavior if we want to avoid breaking exisitng practice.
+ </p>
+ 
+ <p>
+ Alisdair: not sure who to talk to across all library vendors to fix, need more information
+ for progress (IBM and Sun)
+ </p>
+ 
+ <p>
+ STL: Howard did identify a problem with the wording as well: <tt>throw;</tt> is a throw expression,
+ but we typically want to re-activate the in-flight exception, not throw a new copy.
+ </p>
+ 
+ <p>
+ Pablo: wondering why all of this wording is here (N3189)? It looks like we were trying to handle another thread
+ changing handler between a <tt>throw</tt> and <tt>terminate</tt> in current thread.
+ </p>
+ 
+ <p>
+ Alisdair: Anything working with exception handling should have used only thread-local resources, but that ship has sailed.
+ We must account for the same exception object being re-thrown in multiple threads simultaneously, with no happens-before
+ relationships.
+ </p>
+ 
+ <p>
+ Room: Why on earth would we care about exactly which way the program dies when the terminate calls are racing?!
+ </p>
+ 
+ <p>
+ Pablo: Reasonable to set the handler once (in <tt>main</tt>) and never change it.
+ </p>
+ 
+ <p>
+ Pablo: If willing to put lots of work into this, you could say at point of a <tt>throw</tt> these handlers become
+ thread local but that is overkill.  We want destructors to be able to change these handlers (if only for backwards
+ compatibility).
+ </p>
+ 
+ <p>
+ Alisdair: the <i>&quot;do it right&quot;</i> is to do something per thread, but that is more work than vendors will want to do.
+ Want to say setting handler while running multiple threads is unspecified.
+ </p>
+ 
+ <p>
+ Pablo: possible all we need to do is say it is always the current handler
+ </p>
+ 
+ <p>
+ STL: That prevents an implementation or single threaded program from calling a new handler after a <tt>throw</tt>,
+ probably should say if <tt>terminate</tt> is called <i>by the implementation</i> (during EH), any handler that was
+ current can be called.  Leaves it up in the air as to when the handler is captured, supporting the diverging
+ existing practices.
+ </p>
+ 
+ <p>
+ Jeffrey: use <i>happens before</i> terminology to avoid introducing races
+ </p>
+ 
+ <p>
+ STL: Give this to concurrency?
+ </p>
+ 
+ <p>
+ Jeffrey: It is in clause 18, generally LWG and not SG1 territory.
+ </p>
+ 
+ <p>
+ Alisdair: Concerned about introducing <i>happens before</i> into fundamental exception handling since it would affect
+ single threaded performance as well.  Want to give to concurrency or LEWG/EWG, we are into language design here.
+ </p>
+ 
+ <p>
+ Jeffrey: suspect LEWG won't have a strong opinion.  I don't want it to be ours!!!
+ </p>
+ 
+ <p>
+ Pablo: Might be a case for core>
+ </p>
+ 
+ <p>
+ Alisdair: Would be happier if at least one core person were in the discussion.
+ </p>
+ 
+ <p>
+ STL: No sympathy for code that tries to guard the terminate handler.
+ </p>
+ 
+ <p>
+ Alisdair: We are back to set it once, globally.  Want to be clear that if <tt>set_terminate</tt> is called just once,
+ when EH is not active, and never changed again, then the user should get the handler from that specific call.
+ </p>
+ 
+ <p>
+ AlisdairM: "unspecified which handler is called if an exception is active when <tt>set_terminate</tt> is called."
+ This supports existing behaviors, and guarantees which handler is called in non-conentious situations.  Implicit
+ assumption that a funtion becomes a handler only after a successful call to <tt>set_handler</tt>, so we are not
+ leaving a door open to the implementation inventing entirely new handlers of its own.
+ </p>
+ 
+ <p>
+ <i>Consensus.</i>
+ </p>
+ 
+ <p>
+ Poll to confirm status as P1: new consensus is P3
+ </p>
+ 
+ <p>
+ <i>Action:</i> Alisdair provides new wording.  Drop from P1 to P3, and move to Review.
+ </p>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
+ <p>
+ HH: we accidentally changed semantics of which handler gets called during exception unwinding. This was attempt to put it back. 
+ Discovered implementations don't really do anything. [&hellip;] Fine with unspecified behavior to move this week.<br/>
+ STL/MC: observed different behavior<br/>
+ STL: legitimizes all implementations and tells users to not do this<br/>
+ Move to ready? 9/0/1 
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <p>
+ Amend 18.8.3.4 [terminate] as indicated:
+ </p>
+ 
+ <tt>[[noreturn]] void terminate() noexcept;</tt>
+ <blockquote><p>
+ <i>Remarks:</i> Called by the implementation when exception handling must be abandoned for any of several reasons (15.5.1)
+ <del>, in effect immediately after throwing the exception</del>. May also be called directly by the program.
+ </p></blockquote>
+ 
+ <blockquote><p>
+ <i>Effects:</i> <ins>Calls a <tt>terminate_handler</tt> function. It is unspecified which <tt>terminate_handler</tt> function will
+ be called if an exception is active during a call to <tt>set_terminate</tt>. Otherwise c</ins><del>C</del>alls the current
+ <tt>terminate_handler</tt> function. [<i>Note:</i> A default <tt>terminate_handler</tt> is always considered a callable handler in
+ this context. &mdash; <i>end note</i>]
+ </p></blockquote>
+ 
+ <p>
+ Amend D.8.4 [unexpected] as indicated:
+ </p>
+ 
+ <tt>[[noreturn]] void unexpected();</tt>
+ <blockquote><p>
+ Remarks: Called by the implementation when a function exits via an exception not allowed by its <i>exception-specification</i>
+ (15.5.2)<del>, in effect after evaluating the throw-expression (D.11.1)</del>. May also be called directly by the program.
+ </p></blockquote>
+ 
+ <blockquote><p>
+ <i>Effects:</i> <ins>Calls an <tt>unexpected_handler</tt> function. It is unspecified which <tt>unexpected_handler</tt>
+ function will be called if an exception is active during a call to <tt>set_unexpected</tt>. Otherwise c</ins><del>C</del>alls the current 
+ <tt>unexpected_handler</tt> function. [<i>Note:</i> A default <tt>unexpected_handler</tt> is always considered a callable handler in 
+ this context. &mdash; <i>end note</i>] 
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2114"></a>2114. Incorrect "<em>contextually</em> convertible to <tt>bool</tt>" requirements</h3>
+ <p><b>Section:</b> 17.6.3.3 [nullablepointer.requirements], 24.2.3 [input.iterators], 24.2.7 [random.access.iterators], 25.1 [algorithms.general], 25.4 [alg.sorting], 30.2.1 [thread.req.paramname] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-12-09 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ As of 17.6.3.1 [utility.arg.requirements] Table 17&#47;18, the return types of the expressions
+ </p>
+ <blockquote><pre>
+ a == b
+ </pre></blockquote>
+ <p>
+ or
+ </p>
+ <blockquote><pre>
+ a &lt; b
+ </pre></blockquote>
+ <p>
+ for types satisfying the <tt>EqualityComparable</tt> or <tt>LessThanComparable</tt>
+ types, respectively, are required to be "convertible to <tt>bool</tt>" which corresponds to
+ a copy-initialization context. But several newer parts of the library that refer to 
+ such contexts have lowered the requirements taking  advantage of the new terminology of 
+ "<em>contextually</em> convertible to <tt>bool</tt>" instead, which corresponds to a 
+ direct-initialization context (In addition to "normal" direct-initialization constructions, 
+ operands of logical operations as well as <tt>if</tt> or <tt>switch</tt> conditions also 
+ belong to this special context).
+ <p/>
+ One example for these new requirements are input iterators which satisfy <tt>EqualityComparable</tt> 
+ but also specify that the expression
+ </p>
+ <blockquote><pre>
+ a != b
+ </pre></blockquote>
+ <p>
+ shall be just "<strong>contextually</strong> convertible to <tt>bool</tt>". The same discrepancy 
+ exists for requirement set <tt>NullablePointer</tt> in regard to several equality-related expressions.
+ <p/>
+ For random access iterators we have
+ </p>
+ <blockquote><p>
+ <tt>a &lt; b</tt>      contextually convertible to <tt>bool</tt>
+ </p></blockquote>
+ <p>
+ as well as for all derived comparison functions, so strictly speaking we could have a random access 
+ iterator that does not satisfy the <tt>LessThanComparable</tt> requirements, which looks like an
+ artifact to me.
+ <p/>
+ Even if we keep with the existing requirements based on <tt>LessThanComparable</tt> or
+ <tt>EqualityComparable</tt> we still would have the problem that some current specifications 
+ are actually  based on the assumption of implicit convertibility instead of "explicit convertibility", e.g. 
+ 20.8.1.5 [unique.ptr.special] p3:
+ </p>
+ <blockquote><pre>
+ template &lt;class T1, class D1, class T2, class D2&gt;
+ bool operator!=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ </pre>
  <blockquote>
+ <p>
+ -3- <i>Returns</i>: <tt>x.get() != y.get()</tt>.
+ </p>
+ </blockquote></blockquote>
+ <p>
+ Similar examples exist in 20.8.1.2.2 [unique.ptr.single.dtor] p2, 20.8.1.2.3 [unique.ptr.single.asgn] p9,
+ 20.8.1.2.4 [unique.ptr.single.observers] p1+3+8, etc.
+ <p/>
+ In all these places the expressions involving comparison functions (but <em>not</em> those of the conversion 
+ of a <tt>NullablePointer</tt> to <tt>bool</tt>!) assume to be "convertible to <tt>bool</tt>". I think this
+ is a very natural assumption and all delegations of the comparison functions of some type <tt>X</tt> to some
+ other API type <tt>Y</tt> in third-party code does so assuming that copy-initialization semantics will
+ just work.
+ <p/>
+ The actual reason for using the newer terminology can be rooted back to LWG <a href="lwg-defects.html#556">556</a>. My hypotheses 
+ is that the resolution of that issue also needs a slight correction. Why so?
+ <p/>
+ The reason for opening that issue were worries based on the previous "convertible to <tt>bool</tt>"
+ wording. An expressions like "<tt>!pred(a, b)</tt>" might not be well-formed in those situations, because
+ <tt>operator!</tt> might not be accessible or might have an unusual semantics (and similarly for other logical
+ operations). This can indeed happen with unusual proxy return types, so the idea was that the evaluation of 
+ <tt>Predicate</tt>, <tt>BinaryPredicate</tt> (25.1 [algorithms.general] p8+9), and <tt>Compare</tt> 
+ (25.4 [alg.sorting] p2) should be defined based on contextual conversion to <tt>bool</tt>. 
+ Unfortunately this <em>alone</em> is not sufficient: In addition, I think, we <em>also</em> want the predicates 
+ to be (implicitly) convertible to <tt>bool</tt>! Without this wording, several conditions are plain wrong, 
+ e.g. 25.2.5 [alg.find] p2, which talks about "<tt>pred(*i) != false</tt>" (<tt>find_if</tt>) and 
+ "<tt>pred(*i) == false</tt>" (<tt>find_if_not</tt>). These expressions are not within a boolean context! 
+ <p/>
+ While we could simply fix all these places by proper wording to be considered in a "contextual conversion to
+ <tt>bool</tt>", I think that this is not the correct solution: Many third-party libraries already refer to
+ the previous C++03 <tt>Predicate</tt> definition &mdash; it actually predates C++98 and is as old as the 
+ <a href="http://www.sgi.com/tech/stl/Predicate.html">SGI specification</a>. It seems to be a high price to
+ pay to switch to direct initialization here instead of fixing a completely different specification problem.
+ <p/>
+ A final observation is that we have another definition for a <tt>Predicate</tt> in 30.2.1 [thread.req.paramname] p2:
+ </p>
+ <blockquote><p>
+ If a parameter is <tt>Predicate</tt>, <tt>operator()</tt> applied to the actual template argument shall return a value that
+ is convertible to <tt>bool</tt>.
+ </p></blockquote>
+ <p>
+ The problem here is not that we have two different definitions of <tt>Predicate</tt> in the standard &mdash; this 
+ is confusing, but this fact alone is not a defect. The first (minor) problem is that this definition does not properly 
+ apply to function objects that are function pointers, because <tt>operator()</tt> is not defined in a strict sense. 
+ But the actually worse second problem is that this wording has the very <tt>same</tt> problem that has originally lead to
+ LWG <a href="lwg-defects.html#556">556</a>! We only need to look at 30.5.1 [thread.condition.condvar] p15 to recognice this:
+ </p>
+ <blockquote><pre>
+ while (!pred())
+   wait(lock);
+ </pre></blockquote>
+ <p>
+ The negation expression here looks very familiar to the example provided in LWG <a href="lwg-defects.html#556">556</a> and is sensitive
+ to the same "unusual proxy" problem. Changing the 30.2.1 [thread.req.paramname] wording to a corresponding
+ "contextual conversion to <tt>bool</tt>" wouldn't work either, because existing specifications rely on "convertible
+ to <tt>bool</tt>", e.g. 30.5.1 [thread.condition.condvar] p32+33+42 or 30.5.2 [thread.condition.condvarany] 
+ p25+26+32+33.
+ <p/>
+ To summarize: I believe that LWG <a href="lwg-defects.html#556">556</a> was not completely resolved. A pessimistic interpretation is,
+ that even with the current wording based on "contextually convertible to <tt>bool</tt>" the actual problem of that 
+ issue has <em>not</em> been fixed. What actually needs to be required here is some normative wording that basically
+ expresses something along the lines of:
+ </p>
+ <blockquote><p>
+ The semantics of <em>any</em> contextual conversion to <tt>bool</tt> shall be equivalent to the semantics of 
+ any implicit conversion to <tt>bool</tt>.
+ </p></blockquote>
+ <p>
+ This is still not complete without having concepts, but it seems to be a better approximation. Another way of solving
+ this issue would be to define a minimum requirements table with equivalent semantics. The proposed wording is a bit
+ simpler but attempts to express the same thing.
+ </p>
+ 
+ <p><i>[2012, Kona]</i></p>
+ 
+ <p>
+ Agree with Daniel that we potentially broke some C++03 user code, accept the changes striking
+ "contextually" from tables.  Stefan to provide revised wording for section 25, and figure out
+ changes to section 30.
+ </p>
+ <p>
+ Move to open, and then to Review when updated wording from Stefan is available.
+ </p>
+ 
+ <p><i>[2012-10-12, STL comments]</i></p>
+ 
+ 
+ <ol>
+ <li>
+ <p>
+ The current proposed resolution still isn't completely satisfying. It would certainly be possible for the Standard to 
+ require these various expressions to be implicitly and contextually convertible to <tt>bool</tt>, but that would have 
+ a subtle consequence (which, I will argue, is undesirable - regardless of the fact that it dates all the way back to 
+ C++98/03). It would allow users to provide really wacky types to the Standard Library, with one of two effects:
+ </p>
+ <ol style="list-style-type:upper-alpha">
+ <li>
+ <p>Standard Library implementations would have to go to great lengths to respect such wacky types, essentially using 
+ <tt>static_cast&lt;bool&gt;</tt> when invoking any predicates or comparators.
+ </p>
+ </li>
+ 
+ <li>
+ <p>
+ Otherwise, such wacky types would be de facto nonportable, because they would make Standard Library implementations 
+ explode.
+ </p>
+ </li>
+ </ol>
+ 
+ <p>
+ Effect B is the status quo we're living with today. What Standard Library implementations want to do with <tt>pred(args)</tt> 
+ goes beyond "<tt>if (pred(args))</tt>" (C++03), contextually converting <tt>pred(args)</tt> to <tt>bool</tt> (C++11), or 
+ implicitly and contextually converting <tt>pred(args)</tt> to <tt>bool</tt> (the current proposed resolution). 
+ Implementations want to say things like:
+ </p>
+ 
+ <blockquote><pre>
+ if (pred(args))
+ if (!pred(args))
+ if (cond &amp;&amp; pred(args))
+ if (cond &amp;&amp; !pred(args))
+ </pre></blockquote>
+ 
+ <p>
+ These are real examples taken from Dinkumware's implementation. There are others that would be realistic 
+ ("<tt>pred(args) &amp;&amp; cond</tt>", "<tt>cond || pred(args)</tt>", etc.)
+ <p/>
+ Although negation was mentioned in this issue's Discussion section, and in LWG <a href="lwg-defects.html#556">556</a>'s, the current proposed 
+ resolution doesn't fix this problem. Requiring <tt>pred(args)</tt> to be implicitly and contextually convertible to <tt>bool</tt> 
+ doesn't prevent <tt>operator!()</tt> from being overloaded and returning <tt>std::string</tt> (as a wacky example). More 
+ ominously, it doesn't prevent <tt>operator&amp;&amp;()</tt> and <tt>operator||()</tt> from being overloaded and destroying 
+ short-circuiting.
+ </p>
+ 
+ </li>
+ 
+ <li>
+ <p>
+ I would like LWG input before working on Standardese for a new proposed resolution. Here's an outline of what I'd like to 
+ do:
+ </p>
+ <ol style="list-style-type:upper-alpha">
+ <li>
+ <p>
+ Introduce a new "concept" in 17.6.3 [utility.requirements], which I would call <tt>BooleanTestable</tt> in the 
+ absence of better ideas.
+ </p>
+ </li>
+ 
+ <li>
+ <p>
+ Centralize things and reduce verbosity by having everything simply refer to <tt>BooleanTestable</tt> when necessary. 
+ I believe that the tables could say "Return type: <tt>BooleanTestable</tt>", while Predicate/BinaryPredicate/Compare 
+ would need the incantation "shall satisfy the requirements of BooleanTestable".
+ </p>
+ </li>
+ 
+ <li>
+ <p>
+ Resolve the tug-of-war between users (who occasionally want to do weird things) and implementers (who don't want to have 
+ to contort their code) by requiring that:
+ </p>
+ <ol style="list-style-type:upper-roman">
+ <li>
+ <p>
+ Given a <tt>BooleanTestable x</tt>, <tt>x</tt> is both implicitly and contextually convertible to <tt>bool</tt>.
+ </p>
+ </li>
+ 
+ <li>
+ <p>
+ Given a <tt>BooleanTestable x</tt>, <tt>!x</tt> is <tt>BooleanTestable</tt>. (This is intentionally "recursive".)
+ </p>
+ </li>
+ 
+ <li>
+ <p>
+ Given a <tt>BooleanTestable x</tt>, <tt>bool t = x, t2(x), f = !x;</tt> has the postcondition <tt>t == t2 &amp;&amp; t != f</tt>.
+ </p>
+ </li>
+ 
+ <li>
+ <p>
+ Given a <tt>BooleanTestable x</tt> and a <tt>BooleanTestable y</tt> of possibly different types, "<tt>x &amp;&amp; y</tt>" 
+ and "<tt>x || y</tt>" invoke the built-in <tt>operator&amp;&amp;()</tt> and <tt>operator||()</tt>, triggering short-circuiting.
+ </p>
+ </li>
+ 
+ <li>
+ <p>
+ <tt>bool</tt> is <tt>BooleanTestable</tt>.
+ </p>
+ </li>
+ </ol>
+ 
+ </li>
+ 
+ </ol>
+ 
+ <p>
+  I believe that this simultaneously gives users great latitude to use types other than <tt>bool</tt>, while allowing 
+  implementers to write reasonable code in order to get their jobs done. (If I'm forgetting anything that implementers 
+  would want to say, please let me know.)
+ </p>
+ 
+ </li>
+ 
+ <li>
+ <p>
+ About requirement (I): As Daniel patiently explained to me, we need to talk about both implicit conversions and 
+ contextual conversions, because it's possible for a devious type to have both "<tt>explicit operator bool()</tt>" 
+ and "<tt>operator int()</tt>", which might behave differently (or be deleted, etc.).
+ </p>
+ </li>
+ 
+ <li>
+ <p>
+ About requirement (IV): This is kind of tricky. What we'd like to say is, "<tt>BooleanTestable</tt> can't ever trigger 
+ an overloaded logical operator". However, given a perfectly reasonable type <tt>Nice</tt> - perhaps even <tt>bool</tt> itself! - 
+ other code (perhaps a third-party library) could overload <tt>operator&amp;&amp;(Nice, Evil)</tt>. Therefore, I believe 
+ that the requirement should be "no first use" - the Standard Library will ask for various <tt>BooleanTestable</tt> types 
+ from users (for example, the result of "<tt>first != last</tt>" and the result of "<tt>pred(args)</tt>"), and as long 
+ as they don't trigger overloaded logical operators with each other, everything is awesome.
+ </p>
+ </li>
+ 
+ 
+ <li>
+ <p>
+ About requirement (V): This is possibly redundant, but it's trivial to specify, makes it easier for users to understand 
+ what they need to do ("oh, I can always achieve this with <tt>bool</tt>"), and provides a "base case" for requirement 
+ (IV) that may or may not be necessary.  Since <tt>bool</tt> is <tt>BooleanTestable</tt>, overloading 
+ <tt>operator&amp;&amp;(bool, Other)</tt> (etc.) clearly makes the <tt>Other</tt> type non-<tt>BooleanTestable</tt>.
+ </p>
+ </li>
+ </ol>
+ 
+ <strong>Previous resolution from Daniel [SUPERSEDED]:</strong>
+ <p/>
+ <blockquote class="note">
+ <p>This wording is relative to the FDIS.</p>
+ 
+ <ol>
+ <li><p>Change Table 25 &mdash; "<tt>NullablePointer</tt> requirements" in 17.6.3.3 [nullablepointer.requirements]
+ as indicated:</p>
+ 
  <table border="1">
! <caption>Table 25 &mdash; <tt>NullablePointer</tt> requirements</caption>
! <tr align="center">
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational semantics</th>
! </tr> 
  
! <tr>
! <td colspan="3" align="center">
! <tt>[&hellip;]</tt>
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>a != b</tt>
! </td>
! <td>
! <del>contextually</del> convertible to <tt>bool</tt>
! </td>
! <td>
! <tt>!(a == b)</tt>
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>a == np<br/>
! np == a</tt>
! </td>
! <td>
! <del>contextually</del> convertible to <tt>bool</tt>
! </td>
! <td>
! <tt>a == P()</tt>
! </td>
! </tr>
  
+ <tr>
+ <td>
+ <tt>a != np<br/>
+ np != a</tt>
+ </td>
+ <td>
+ <del>contextually</del> convertible to <tt>bool</tt>
+ </td>
+ <td>
+ <tt>!(a == np)</tt>
+ </td>
  </tr>
  
+ </table>
+  
+ </li>
+ 
+ <li><p>Change Table 107 &mdash; "Input iterator requirements" in 24.2.3 [input.iterators]
+ as indicated:</p>
+ 
+ <table border="1">
+ <caption>Table 107 &mdash; Input iterator requirements (in addition to Iterator)</caption>
+ <tr align="center">
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Operational semantics</th>
+ <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
+ </tr> 
+ 
  <tr>
! <td>
! <tt>a != b</tt>
! </td>
! <td>
! <del>contextually</del> convertible to <tt>bool</tt>
! </td>
! <td>
! <tt>!(a == b)</tt>
! </td>
! <td>
! pre: <tt>(a, b)</tt> is in the domain of <tt>==</tt>.
! </td>
! </tr>
  
! <tr>
! <td colspan="4" align="center">
! <tt>[&hellip;]</tt>
! </td>
! </tr>
  
! </table>
!  
! </li>
  
! <li><p>Change Table 111 &mdash; "Random access iterator requirements" in 24.2.7 [random.access.iterators]
! as indicated:</p>
! 
! <table border="1">
! <caption>Table 111 &mdash; Random access iterator requirements (in addition to bidirectional iterator)</caption>
! <tr align="center">
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational semantics</th>
! <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
! </tr> 
! 
! <tr>
! <td colspan="4" align="center">
! <tt>[&hellip;]</tt>
! </td>
  </tr>
  
  <tr>
! <td>
! <tt>a &lt; b</tt>
! </td>
! <td>
! <del>contextually</del> convertible to <tt>bool</tt>
! </td>
! <td>
! <tt>b - a &gt; 0</tt>
! </td>
! <td>
! <tt>&lt;</tt> is a total ordering relation
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>a &gt; b</tt>
! </td>
! <td>
! <del>contextually</del> convertible to <tt>bool</tt>
! </td>
! <td>
! <tt>b &lt; a</tt>
! </td>
! <td>
! <tt>&gt;</tt> is a total ordering relation opposite to <tt>&lt;</tt>.
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>a &gt;= b</tt>
! </td>
! <td>
! <del>contextually</del> convertible to <tt>bool</tt>
! </td>
! <td>
! <tt>!(a &lt; b)</tt>
! </td>
! <td>
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>a &lt;= b</tt>
! </td>
! <td>
! <del>contextually</del> convertible to <tt>bool</tt>
! </td>
! <td>
! <tt>!(a &gt; b)</tt>
! </td>
! <td>
! </td>
  </tr>
  
! </table>
!  
! </li>
! 
! <li><p>Change 25.1 [algorithms.general] p8+9 as indicated:</p>
! 
! <blockquote>
! <p>
! -8- The <tt>Predicate</tt> parameter is used whenever an algorithm expects a function object 
! (20.9 [function.objects]) that, when applied to the result of dereferencing the corresponding iterator, 
! returns a value testable as <tt>true</tt>. In other words, if an algorithm takes <tt>Predicate pred</tt> 
! as its argument and first as its iterator argument, it should work correctly in the construct 
! <tt>pred(*first)</tt> <ins>implicitly or</ins> contextually converted to <tt>bool</tt> (Clause 4 [conv]). 
! The function object <tt>pred</tt> shall not apply any non-constant function through the dereferenced iterator.
! <p/>
! -9- The <tt>BinaryPredicate</tt> parameter is used whenever an algorithm expects a function object that when applied
! to the result of dereferencing two corresponding iterators or to dereferencing an iterator and type
! <tt>T</tt> when <tt>T</tt> is part of the signature returns a value testable as <tt>true</tt>. In other words, if an algorithm takes
! <tt>BinaryPredicate binary_pred</tt> as its argument and <tt>first1</tt> and <tt>first2</tt> as its iterator arguments, it should
! work correctly in the construct <tt>binary_pred(*first1, *first2)</tt> <ins>implicitly or</ins> contextually converted to 
! <tt>bool</tt> (Clause 4 [conv]).
! <tt>BinaryPredicate</tt> always takes the first iterator's <tt>value_type</tt> as its first argument, that is, in those cases
! when <tt>T</tt> value is part of the signature, it should work correctly in the construct <tt>binary_pred(*first1, value)</tt> 
! <ins>implicitly or</ins> contextually converted to <tt>bool</tt> (Clause 4 [conv]). <tt>binary_pred</tt> shall 
! not apply any non-constant function through the dereferenced iterators.
! </p>
  </blockquote>
+ </li>
+ 
+ <li><p>Change 25.4 [alg.sorting] p2 as indicated:</p>
  
+ <blockquote>
+ <p>
+ -2- <tt>Compare</tt> is a function object type (20.9 [function.objects]). The return value of the function 
+ call operation applied to an object of type <tt>Compare</tt>, when <ins>implicitly or</ins> contextually converted 
+ to <tt>bool</tt> (4 [conv]), yields <tt>true</tt> if the first argument of the call is less than the second, and 
+ <tt>false</tt> otherwise. <tt>Compare comp</tt> is used throughout for algorithms assuming an ordering relation. It is assumed 
+ that <tt>comp</tt> will not apply any non-constant function through the dereferenced iterator.
+ </p>
+ </blockquote>
  </li>
  
! <li><p>Change 30.2.1 [thread.req.paramname] p2 as indicated:</p>
! 
! <blockquote>
  <p>
! -2- <del>If a parameter is <tt>Predicate</tt>, operator() applied to the actual template argument shall return a value that
! is convertible to <tt>bool</tt></del><ins><tt>Predicate</tt> is a function object type (20.9 [function.objects]).
! The return value of the function call operation applied to an object of type <tt>Predicate</tt>, when implicitly or 
! contextually converted to <tt>bool</tt> (4 [conv]), yields <tt>true</tt> if the corresponding test condition is
! satisfied, and <tt>false</tt> otherwise</ins>.
  </p>
+ </blockquote>
+ </li>
+ 
+ </ol>
+ </blockquote>
+ 
+ <p><i>[2014-05-20, Daniel suggests concrete wording based on STL's proposal]</i></p>
+ 
+ <p>
+ The presented wording follows relatively closely STL's outline with the following notable exceptions:
+ </p>
+ <ol style="list-style-type:upper-alpha">
+ <li><p>
+ A reference to <tt>BooleanTestable</tt> in table "Return Type" specifications seemed very unusual to me and
+ I found no "prior art" for this in the Standard. Instead I decided to follow the usual style to add a symbol
+ with a specific meaning to a specific paragraph that specifies symbols and their meanings.
+ </p></li>
+ <li><p>
+ STL's requirement IV suggested to directly refer to built-in operators <tt>&amp;&amp;</tt> and <tt>||</tt>. In my
+ opinion this concrete requirement isn't needed if we simply require that two <tt>BooleanTestable</tt> operands behave 
+ equivalently to two those operands after conversion to <tt>bool</tt> (each of them).
+ </p></li>
+ <li><p>
+ I couldn't find a good reason to require normatively that type <tt>bool</tt> meets the requirements of <tt>BooleanTestable</tt>: My
+ assertion is that after having defined them, the result simply falls out of this. But to make this a bit clearer, I added
+ also a non-normative note to these effects.
+ </p></li>
+ </ol>
+ 
+ <p><i>[2014-06-10, STL comments]</i></p>
+ 
+ <p>
+ In the current wording I would like to see changed the suggested changes described by bullet #6:
+ </p>
+ <ol style="list-style-type:upper-alpha">
+ <li><p>In 23.2.1 [container.requirements.general] p4 undo the suggested change</p></li>
+ <li><p>Then change the 7 occurrences of "convertible to <tt>bool</tt>" in the denoted tables to "<tt>bool</tt>".</p></li>
+ </ol>
+ 
+ <p><i>[2015-05-05 Lenexa]</i></p>
+ 
+ <p>STL: Alisdair wanted to do something here, but Daniel gave us updated wording.</p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Change 17.6.3.1 [utility.arg.requirements] p1, Table 17 &mdash; "EqualityComparable requirements", and
+ Table 18 &mdash; "LessThanComparable requirements" as indicated:</p>
  
  <blockquote>
+ <p>
+ -1- [&hellip;] In these tables, <tt>T</tt> is an object or reference type to be supplied by a C++ program
+ instantiating a template; <tt>a</tt>, <tt>b</tt>, and <tt>c</tt> are values of type (possibly <tt>const</tt>) <tt>T</tt>; 
+ <tt>s</tt> and <tt>t</tt> are modifiable lvalues of type <tt>T</tt>; <tt>u</tt> denotes an identifier; <tt>rv</tt> 
+ is an rvalue of type <tt>T</tt>; <del>and</del> <tt>v</tt> is an lvalue of type (possibly <tt>const</tt>) <tt>T</tt> or an
+ rvalue of type <tt>const T</tt><ins>; and <tt>BT</tt> denotes a type that meets the <tt>BooleanTestable</tt> 
+ requirements ([booleantestable.requirements])</ins>.
+ <p/>
+ [&hellip;]
+ </p>
+ <blockquote>
  <table border="1">
! <caption>Table 17 &mdash; <tt>EqualityComparable</tt> requirements [equalitycomparable]</caption>
! <tr>
! <th align="center">Expression</th>
! <th align="center">Return type</th>
! <th align="center">Requirement</th>
! </tr>
  
! <tr>
! <td>
! <tt>a == b</tt>
! </td>
! <td>
! <del>convertible to<br/>
! <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! <tt>==</tt> is an equivalence relation, that is, it has the
! following properties: [&hellip;]
! </td>
! </tr>
  
! </table>
! </blockquote>
! <p>
! [&hellip;]
! </p>
! <blockquote>
! <table border="1">
! <caption>Table 18 &mdash; <tt>LessThanComparable</tt> requirements [lessthancomparable]</caption>
! <tr>
! <th align="center">Expression</th>
! <th align="center">Return type</th>
! <th align="center">Requirement</th>
! </tr>
  
! <tr>
! <td>
! <tt>a &lt; b</tt>
! </td>
! <td>
! <del>convertible to<br/>
! <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! <tt>&lt;</tt> is a strict weak ordering relation (25.4 [alg.sorting])
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </blockquote>
! 
! </li>
  
+ <li><p>Between 17.6.3.2 [swappable.requirements] and 17.6.3.3 [nullablepointer.requirements] insert a new sub-clause 
+ as indicated:</p>
+ 
+ <blockquote>
+ ?.?.?.? <b><tt>BooleanTestable</tt> requirements [booleantestable.requirements]</b>  
+ <blockquote>
+ <p>
+ -?- A <tt>BooleanTestable</tt> type is a boolean-like type that also supports conversions to <tt>bool</tt>.
+ A type <tt>B</tt> meets the <tt>BooleanTestable</tt> requirements if the expressions described in Table ?? are valid 
+ and have the indicated semantics, and if <tt>B</tt> also satisfies all the other requirements of this sub-clause 
+ [booleantestable.requirements].
+ <p/>
+ An object <tt>b</tt> of type <tt>B</tt> can be implicitly converted to <tt>bool</tt> and can be contextually converted 
+ to <tt>bool</tt> (Clause 4). The result values of both kinds of conversions shall be equivalent. 
+ <p/>
+ [<i>Example</i>: The types <tt>bool</tt>, <tt>std::true_type</tt>, and <tt>std::bitset&lt;&gt;::reference</tt> are 
+ <tt>BooleanTestable</tt> types. &mdash; <i>end example</i>]
+ <p/>
+ In Table ??, <tt>B2</tt> and <tt>Bn</tt> denote types (possibly equal to <tt>B</tt> or to each other) that meet the 
+ <tt>BooleanTestable</tt> requirements, <tt>b1</tt> denotes a (possibly <tt>const</tt>) value of <tt>B</tt>, <tt>b2</tt> 
+ denotes a (possibly <tt>const</tt>) value of <tt>B2</tt>, and <tt>t1</tt> denotes a value of type <tt>bool</tt>.
+ </p>
+ </blockquote>
+ </blockquote>
+ </li>
+ 
+ <li><p>Somewhere within the new sub-clause [booleantestable.requirements] insert the following new Table (?? denotes
+ the assigned table number):</p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table ?? &mdash; <tt>BooleanTestable</tt> requirements [booleantestable]</caption>
+ <tr>
+ <th align="center">Expression</th>
+ <th align="center">Return type</th>
+ <th align="center">Operational semantics</th>
  </tr>
  
  <tr>
! <td>
! <tt>bool(b1)</tt>
! </td>
! <td>
! <tt>bool</tt>
! </td>
! <td>
! <i>Remarks</i>: <tt>bool(b1) == t1</tt> for every value<br/>
! <tt>b1</tt> implicitly converted to <tt>t1</tt>.
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>!b1</tt>
! </td>
! <td>
! <tt>Bn</tt>
! </td>
! <td>
! <i>Remarks</i>: <tt>bool(b1) == !bool(!b1)</tt> for<br/>
! every value <tt>b1</tt>.
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>b1 &amp;&amp; b2</tt>
! </td>
! <td>
! <tt>bool</tt>
! </td>
! <td>
! <tt>bool(b1) &amp;&amp; bool(b2)</tt>
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>b1 || b2</tt>
! </td>
! <td>
! <tt>bool</tt>
! </td>
! <td>
! <tt>bool(b1) || bool(b2)</tt>
! </td>
  </tr>
  
+ </table>
+ </blockquote>
+ 
+ </li>
+ 
+ <li><p>Change 17.6.3.3 [nullablepointer.requirements] p5 and Table 25 &mdash; "NullablePointer requirements" as indicated:</p>
+ 
+ <blockquote>
+ <p>
+ [&hellip;]
+ <p/>
+ -5- In Table 25, <tt>u</tt> denotes an identifier, <tt>t</tt> denotes a non-<tt>const</tt> lvalue of type <tt>P</tt>, <tt>a</tt> 
+ and <tt>b</tt> denote values of type (possibly <tt>const</tt>) <tt>P</tt>, <del>and</del> <tt>np</tt> denotes a value of type 
+ (possibly <tt>const</tt>) <tt>std::nullptr_t</tt><ins>, and <tt>BT</tt> denotes a type that meets the <tt>BooleanTestable</tt> 
+ requirements ([booleantestable.requirements])</ins>.
+ <p/>
+ [&hellip;]
+ </p>
+ <blockquote>
+ <table border="1">
+ <caption>Table 25 &mdash; <tt>NullablePointer</tt> requirements [nullablepointer]</caption>
  <tr>
! <th align="center">Expression</th>
! <th align="center">Return type</th>
! <th align="center">Operational semantics</th>
! </tr>
  
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>a != b</tt>
! </td>
! <td>
! <del>contextually convertible to <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>a == np</tt><br/>
! <tt>np == a</tt>
! </td>
! <td>
! <del>contextually convertible to <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! [&hellip;]
! </td>
  </tr>
  
! <tr>
! <td>
! <tt>a != np</tt><br/>
! <tt>np != a</tt>
! </td>
! <td>
! <del>contextually convertible to <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
! 
! </table>
  </blockquote>
+ </blockquote>
+ </li>
  
+ <li><p>Change 20.4.2.7 [tuple.rel] as indicated;</p>
+ 
+ <blockquote>
+ <pre>
+ template&lt;class... TTypes, class... UTypes&gt;
+ constexpr bool operator==(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
+ </pre>
+ <blockquote>
+ <p>
+ -1- <i>Requires</i>: For all <tt>i</tt>, where <tt>0 &lt;= i</tt> and <tt>i &lt; sizeof...(TTypes)</tt>, 
+ <tt>get&lt;i&gt;(t) == get&lt;i&gt;(u)</tt> is a valid expression returning a type that <del>is convertible to 
+ <tt>bool</tt></del><ins>meets the <tt>BooleanTestable</tt> requirements ([booleantestable.requirements])</ins>. 
+ <tt>sizeof...(TTypes) == sizeof...(UTypes)</tt>.
+ <p/>
+ [&hellip;]
+ </p>
+ </blockquote>
+ <pre>
+ template&lt;class... TTypes, class... UTypes&gt;
+ constexpr bool operator&lt;(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
+ </pre>
+ <blockquote>
+ <p>
+ -4- <i>Requires</i>: For all <tt>i</tt>, where <tt>0 &lt;= i</tt> and <tt>i &lt; sizeof...(TTypes)</tt>, 
+ <tt>get&lt;i&gt;(t) &lt; get&lt;i&gt;(u)</tt> and <tt>get&lt;i&gt;(u) &lt; get&lt;i&gt;(t)</tt> are valid 
+ expressions returning types that <del>are convertible to 
+ <tt>bool</tt></del><ins>meet the <tt>BooleanTestable</tt> requirements ([booleantestable.requirements])</ins>. 
+ <tt>sizeof...(TTypes) == sizeof...(UTypes)</tt>.
+ <p/>
+ [&hellip;]
+ </p>
+ </blockquote>
+ </blockquote>
  </li>
  
! <li><p>Change 23.2.1 [container.requirements.general], Table 96 &mdash; "Container requirements", and
! Table 98 &mdash; "Optional container operations" as indicated:</p>
! 
! <blockquote>
  <p>
! -4- In Tables 96, 97, and 98 <tt>X</tt> denotes a container class containing objects of type <tt>T</tt>, <tt>a</tt> and 
! <tt>b</tt> denote values of type <tt>X</tt>, <tt>u</tt> denotes an identifier, <tt>r</tt> denotes a non-<tt>const</tt> value 
! of type <tt>X</tt>, <del>and</del> <tt>rv</tt> denotes a non-<tt>const</tt> rvalue of type <tt>X</tt><ins>, and <tt>BT</tt> 
! denotes a type that meets the <tt>BooleanTestable</tt> requirements ([booleantestable.requirements])</ins>.
  </p>
+ <blockquote>
+ <table border="1">
+ <caption>Table 96 &mdash; Container requirements</caption>
+ <tr>
+ <th align="center">Expression</th>
+ <th align="center">Return type</th>
+ <th align="center">[&hellip;]</th>
+ </tr>
  
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>a == b</tt>
! </td>
! <td>
! <del>convertible to<br/>
! <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a != b</tt>
! </td>
! <td>
! <del>convertible to<br/>
! <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.empty()</tt>
! </td>
! <td>
! <del>convertible to<br/>
! <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
! 
! </table>
! </blockquote>
  <p>
! [&hellip;]
  </p>
+ <blockquote>
+ <table border="1">
+ <caption>Table 98 &mdash; Optional container requirements</caption>
+ <tr>
+ <th align="center">Expression</th>
+ <th align="center">Return type</th>
+ <th align="center">[&hellip;]</th>
+ </tr>
+ 
+ <tr>
+ <td colspan="3" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a &lt; b</tt>
+ </td>
+ <td>
+ <del>convertible to<br/>
+ <tt>bool</tt></del><ins><tt>BT</tt></ins>
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a &gt; b</tt>
+ </td>
+ <td>
+ <del>convertible to<br/>
+ <tt>bool</tt></del><ins><tt>BT</tt></ins>
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a &lt;= b</tt>
+ </td>
+ <td>
+ <del>convertible to<br/>
+ <tt>bool</tt></del><ins><tt>BT</tt></ins>
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a &gt;= b</tt>
+ </td>
+ <td>
+ <del>convertible to<br/>
+ <tt>bool</tt></del><ins><tt>BT</tt></ins>
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ </table>
+ </blockquote>
+ </blockquote>
+ </li>
+ 
+ <li><p>Change 24.2.1 [iterator.requirements.general], Table 107 &mdash; "Input iterator requirements", and
+ Table 111 &mdash; "Random access iterator requirements" as indicated:</p>
  
  <blockquote>
! <p>
! -11- In the following sections, <tt>a</tt> and <tt>b</tt> denote values of type <tt>X</tt> or <tt>const X</tt>, 
! <tt>difference_type</tt> and <tt>reference</tt> refer to the types <tt>iterator_traits&lt;X&gt;::difference_type</tt> and 
! <tt>iterator_traits&lt;X&gt;::reference</tt>, respectively, <tt>n</tt> denotes a value of <tt>difference_type</tt>, <tt>u</tt>, 
! <tt>tmp</tt>, and <tt>m</tt> denote identifiers, <tt>r</tt> denotes a value of <tt>X&amp;</tt>, <tt>t</tt> denotes
! a value of value type <tt>T</tt>, <tt>o</tt> denotes a value of some type that is writable to the output iterator<ins>, and <tt>BT</tt> 
! denotes a type that meets the <tt>BooleanTestable</tt> requirements ([booleantestable.requirements])</ins>.
! </p>
  <blockquote>
! <table border="1">
! <caption>Table 107 &mdash; Input iterator requirements</caption>
! <tr>
! <th align="center">Expression</th>
! <th align="center">Return type</th>
! <th align="center">[&hellip;]</th>
! </tr>
! 
! <tr>
! <td>
! <tt>a != b</tt>
! </td>
! <td>
! <del>contextually convertible to<br/>
! <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
! </table>
  </blockquote>
+ <p>
+ [&hellip;]
+ </p>
+ <blockquote>
+ <table border="1">
+ <caption>Table 111 &mdash; Random access iterator requirements</caption>
+ <tr>
+ <th align="center">Expression</th>
+ <th align="center">Return type</th>
+ <th align="center">[&hellip;]</th>
+ </tr>
+ 
+ <tr>
+ <td colspan="3" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a &lt; b</tt>
+ </td>
+ <td>
+ <del>contextually convertible to<br/>
+ <tt>bool</tt></del><ins><tt>BT</tt></ins>
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a &gt; b</tt>
+ </td>
+ <td>
+ <del>contextually convertible to<br/>
+ <tt>bool</tt></del><ins><tt>BT</tt></ins>
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a &gt;= b</tt>
+ </td>
+ <td>
+ <del>contextually convertible to<br/>
+ <tt>bool</tt></del><ins><tt>BT</tt></ins>
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a &lt;= b</tt>
+ </td>
+ <td>
+ <del>contextually convertible to<br/>
+ <tt>bool</tt></del><ins><tt>BT</tt></ins>
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ </table>
+ </blockquote>
+ </blockquote>
+ </li>
+ 
+ <li><p>Change 25.1 [algorithms.general] p8+p9 as indicated: [<i>Drafting note</i>: The wording change also fixes
+ (a) unusual wording forms used ("should work") which are unclear in which sense they are imposing normative requirements and
+ (b) the problem, that the current wording seems to allow that the predicate may mutate a call argument, if that is not a 
+ dereferenced iterator.
+ Upon applying the new wording it became obvious that the wording has the effect that currently algorithms such as
+ <tt>adjacent_find</tt>, <tt>search_n</tt>, <tt>unique</tt>, and <tt>unique_copy</tt> are not correctly described 
+ (because they have no iterator argument named <tt>first1</tt>), which could give raise to a new library issue. 
+ &mdash; <i>end drafting note</i>]</p>
  
  <blockquote>
! <p>
! -8- The <tt>Predicate</tt> parameter is used whenever an algorithm expects a function object (20.9) that, when applied
! to the result of dereferencing the corresponding iterator, returns a value testable as <tt>true</tt>. <del>In other words,
! i</del><ins>I</ins>f an algorithm takes <tt>Predicate pred</tt> as its argument and <tt>first</tt> as its iterator argument, 
! <del>it should work correctly in the construct <tt>pred(*first)</tt> contextually converted to 
! <tt>bool</tt> (Clause 4)</del><ins>the expression <tt>pred(*first)</tt> shall have a type that meets the <tt>BooleanTestable</tt> 
! requirements ( [booleantestable.requirements])</ins>. 
! The function object <tt>pred</tt> shall not apply any non-constant function through <del>the dereferenced 
! iterator</del><ins>its argument</ins>.
! <p/>
! -9- The <tt>BinaryPredicate</tt> parameter is used whenever an algorithm expects a function object that when applied
! to the result of dereferencing two corresponding iterators or to dereferencing an iterator and type
! <tt>T</tt> when <tt>T</tt> is part of the signature returns a value testable as <tt>true</tt>. <del>In other words, 
! i</del><ins>I</ins>f an algorithm takes <tt>BinaryPredicate binary_pred</tt> as its argument and <tt>first1</tt> and 
! <tt>first2</tt> as its iterator arguments, <del>it should work correctly in the construct <tt>binary_pred(*first1, *first2)</tt> 
! contextually converted to <tt>bool</tt> (Clause 4)</del><ins>the expression <tt>binary_pred(*first1, *first2)</tt> shall 
! have a type that meets the <tt>BooleanTestable</tt> requirements ( [booleantestable.requirements])</ins>. 
! <tt>BinaryPredicate</tt> always takes the first iterator's <tt>value_type</tt> as its first argument, that is, in those cases 
! when <tt>T</tt> value is part of the signature, <del>it should work correctly in the construct <tt>binary_pred(*first1, value)</tt> 
! contextually converted to <tt>bool</tt> (Clause 4)</del><ins>the expression <tt>binary_pred(*first1, value)</tt> shall have a 
! type that meets the <tt>BooleanTestable</tt> requirements ( [booleantestable.requirements])</ins>. <tt>binary_pred</tt> 
! shall not apply any non-constant function through <del>the dereferenced iterators</del><ins>any of its arguments</ins>.
! </p>
  </blockquote>
+ </li>
+ 
+ <li><p>Change 25.4 [alg.sorting] p2 as indicated:</p>
+ 
+ <blockquote>
+ <p>
+ [&hellip;]
+ <p/>
+ -2- <tt>Compare</tt> is a function object type (20.9). <del>The return value of the function call 
+ operation applied to an object of type <tt>Compare</tt>, when contextually converted 
+ to <tt>bool</tt>(Clause 4), yields <tt>true</tt> if the first argument of the call is less than the second, 
+ and <tt>false</tt> otherwise.</del> <tt>Compare comp</tt> is used throughout for algorithms assuming an ordering relation. 
+ <ins>Let <tt>a</tt> and <tt>b</tt> denote two argument values whose types depend on the corresponding algorithm. Then the expression 
+ <tt>comp(a, b)</tt> shall have a type that meets the <tt>BooleanTestable</tt> requirements ( [booleantestable.requirements]).
+ The return value of <tt>comp(a, b)</tt>, converted to <tt>bool</tt>, yields <tt>true</tt> if the 
+ first argument <tt>a</tt> is less than the second argument <tt>b</tt>, and <tt>false</tt> otherwise.</ins> It is assumed that 
+ <tt>comp</tt> will not apply any non-constant function through <del>the dereferenced iterator</del><ins>any of its arguments</ins>.
+ <p/>
+ [&hellip;]
+ </p>
  </blockquote>
  </li>
  
! <li><p>Change 27.5.4.2 [fpos.operations] and Table 127 &mdash; "Position type requirements" as indicated:</p>
! 
! <blockquote>
  <p>
! -1- Operations specified in Table 127 are permitted. In that table,
  </p>
+ <ul>
+ <li><p><tt>P</tt> refers to an instance of <tt>fpos</tt>,</p></li>
+ <li><p>[&hellip;]</p></li>
+ <li><p><tt>o</tt> refers to a value of type <tt>streamoff</tt>,</p></li>
+ <li><p><ins><tt>BT</tt> refers to a type that meets the <tt>BooleanTestable</tt> requirements ([booleantestable.requirements]),</ins></p></li>
+ <li><p>[&hellip;]</p></li>
+ </ul>
+ <blockquote>
+ <table border="1">
+ <caption>Table 127 &mdash; Position type requirements</caption>
+ <tr>
+ <th align="center">Expression</th>
+ <th align="center">Return type</th>
+ <th align="center">[&hellip;]</th>
+ </tr>
  
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>p == q</tt>
! </td>
! <td>
! <del>convertible to <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>p != q</tt>
! </td>
! <td>
! <del>convertible to <tt>bool</tt></del><ins><tt>BT</tt></ins>
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
! 
! </table>
! </blockquote>
! </blockquote>
! <blockquote>
! </blockquote>
  </li>
  
! <li><p>Change 30.2.1 [thread.req.paramname] p2 as indicated:</p>
! 
! <blockquote>
  <p>
! -2- <del>If a parameter is <tt>Predicate</tt>, <tt>operator()</tt> applied to the actual template argument shall return a value that
! is convertible to <tt>bool</tt></del><ins><tt>Predicate</tt> is a function object type (20.9 [function.objects]).
! Let <tt>pred</tt> denote an lvalue of type <tt>Predicate</tt>. Then the expression <tt>pred()</tt> shall have a type that meets the 
! <tt>BooleanTestable</tt> requirements ( [booleantestable.requirements]). The return value of <tt>pred()</tt>, 
! converted to <tt>bool</tt>, yields <tt>true</tt> if the corresponding test condition is satisfied, and <tt>false</tt> otherwise</ins>.
  </p>
+ </blockquote>
+ </li>
+ </ol>
  
! 
! 
! 
! 
! <hr>
! <h3><a name="2115"></a>2115. Undefined behaviour for <tt>valarray</tt> assignments with <tt>mask_array</tt> index?</h3>
! <p><b>Section:</b> 26.6.8 [template.mask.array] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2011-12-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Recently I received a Service Request (SR) alleging that one of our testcases causes an 
! undefined behavior. The complaint is that 26.6.8 [template.mask.array] in C++11 
! (and the corresponding subclause in C++03) are interpreted by some people to require that 
! in an assignment "<tt>a[mask] = b</tt>", the subscript <tt>mask</tt> and the rhs <tt>b</tt> 
! must have the same number of elements.
! <p/>
! IMHO, if that is the intended requirement, it should be stated explicitly.
! <p/>
! In any event, there is a tiny editorial cleanup that could be made:
! <p/>
! In C++11, 26.6.8.1 [template.mask.array.overview] para 2 mentions
! </p>
! <blockquote><p>
! "the expression <tt>a[mask] = b;</tt>"
! </p></blockquote>
! <p>
! but the semicolon cannot be part of an expression. The correction could omit the 
! semicolon, or change the word "expression" to "assignment" or "statement".
! <p/>
! Here is the text of the SR, slightly modified for publication:
! </p>
! <blockquote>
! <p>
! Subject:  SR01174 LVS _26322Y31 has undefined behavior [open]
! <p/>
! [Client:]<br/>
! The test case t263.dir&#47;_26322Y31.cpp seems to be illegal as it has an undefined 
! behaviour. I searched into the SRs but found SRs were not related to the topic 
! explained in this mail (SR00324, SR00595, SR00838).
! </p>
! <blockquote><pre>
! const char vl[] = {"abcdefghijklmnopqrstuvwxyz"};
! const char vu[] = {"ABCDEFGHIJKLMNOPQRSTUVWXYZ"};
! const std::valarray&lt;char&gt; v0(vl, 27), vm5(vu, 5), vm6(vu, 6);
! std::valarray&lt;char&gt; x = v0;
! [&hellip;]
! const bool vb[] = {false, false, true, true, false, true};
! const std::valarray&lt;bool&gt; vmask(vb, 6);
! x = v0;
! x[vmask] = vm5;      // ***** HERE....
! steq(&amp;x[0], "abABeCghijklmnopqrstuvwxyz");
! x2 = x[vmask];       // ***** ....AND HERE
! [&hellip;]
  </pre></blockquote>
+ <p>
+ This problem has already been discussed between [experts]:
+ See thread <a href="http://gcc.gnu.org/ml/libstdc++/2009-11/threads.html#00051">http:&#47;&#47;gcc.gnu.org&#47;ml&#47;libstdc++&#47;2009-11&#47;threads.html#00051</a> 
+ Conclusion <a href="http://gcc.gnu.org/ml/libstdc++/2009-11/msg00099.html">http:&#47;&#47;gcc.gnu.org&#47;ml&#47;libstdc++&#47;2009-11&#47;msg00099.html</a>
+ <p/>
+ [Plum Hall:]<br/>
+ Before I log this as an SR, I need to check one detail with you.
+ <p/>
+ I did read the email thread you mentioned, and I did find a citation (see INCITS ISO&#47;IEC 14882-2003 
+ Section 26.3.2.6 on valarray computed assignments):
+ <p/>
+ Quote: "If the array and the argument array do not have the same length, the behavior is undefined",
+ <p/>
+ But this applies to computed assignment (<tt>*=</tt>, <tt>+=</tt>, etc), not to simple assignment. Here is the C++03 citation 
+ re simple assignment:
+ <p/>
+ 26.3.2.2 valarray assignment [lib.valarray.assign]
+ </p>
+ <blockquote><pre>
+ valarray&lt;T&gt;&amp; operator=(const valarray&lt;T&gt;&amp;);
+ </pre><blockquote>
+ <p>
+ 1 Each element of the <tt>*this</tt> array is assigned the value of the corresponding element of the argument array.
+ The resulting behavior is undefined if the length of the argument array is not equal to the length of the
+ <tt>*this</tt> array.
+ </p>
+ </blockquote></blockquote>
+ <p>
+ In the new C++11 (N3291), we find ...
+ <p/>
+ 26.6.2.3 valarray assignment [valarray.assign]
+ </p>
+ <blockquote><pre>
+ valarray&lt;T&gt;&amp; operator=(const valarray&lt;T&gt;&amp; v);
+ </pre><blockquote>
+ <p>
+ 1 Each element of the <tt>*this</tt> array is assigned the value of the corresponding element of the argument
+ array. If the length of <tt>v</tt> is not equal to the length of <tt>*this</tt>, resizes <tt>*this</tt> to make 
+ the two arrays the same length, as if by calling <tt>resize(v.size())</tt>, before performing the assignment.
+ </p>
+ </blockquote></blockquote>
+ <p>
+ So it looks like the testcase might be valid for C++11 but not for C++03; what do you think?
+ <p/>
+ [Client:]<br/>
+ I quite agree with you but the two problems I mentioned:
+ </p>
+ <blockquote><pre>
+ x[vmask] = vm5;      // ***** HERE....
+ [&hellip;]
+ x2 = x[vmask];       // ***** ....AND HERE
+ </pre></blockquote>
+ <p>
+ refer to <tt>mask_array</tt> assignment hence target the C++03 26.3.8 paragraph. Correct?
+ <p/>
+ [Plum Hall:]<br/>
+ I mentioned the contrast between C++03 26.3.2.2 para 1 versus C++11 26.6.2.3 para 1.
+ <p/>
+ But in C++03 26.3.8, I don't find any corresponding restriction. Could you quote the specific 
+ requirement you're writing about?
+ <p/>
+ [Client:]<br/>
+ I do notice the difference between c++03 26.3.2.2 and c++11 26.6.2.3 about assignments between 
+ different sized <tt>valarray</tt> and I perfectly agree with you.
+ <p/>
+ But, as already stated, this is not a simple <tt>valarray</tt> assignment but a
+ <tt>mask_array</tt> assignment (c++03 26.3.8 &#47; c++11 26.6.8). See c++11 quote below:
+ <p/>
+ 26.6.8 Class template mask_array<br/>
+ 26.6.8.1 Class template mask_array overview<br/>
+ [....]
+ </p>
+ <ol>
+ <li><p>This template is a helper template used by the mask subscript operator:
+ <tt>mask_array&lt;T&gt; valarray&lt;T&gt;::operator[](const valarray&lt;bool&gt;&amp;)</tt>.
+ </p></li>
+ <li><p>It has reference semantics to a subset of an array specified by a boolean mask. Thus, 
+ the expression <tt>a[mask] = b;</tt> has the effect of assigning <em>the elements of <tt>b</tt></em> 
+ to the masked elements in <tt>a</tt> (those for which the corresponding element in <tt>mask</tt> is true.)
+ </p></li>
+ </ol>
+ <p>
+ 26.6.8.2 mask_array assignment
+ </p>
+ <blockquote><pre>
+ void operator=(const valarray&lt;T&gt;&amp;) const;
+ const mask_array&amp; operator=(const mask_array&amp;) const;
+ </pre><blockquote>
+ <p>
+ 1 These assignment operators have reference semantics, assigning the values of the argument array 
+ elements to selected elements of the <tt>valarray&lt;T&gt;</tt> object to which it refers.
+ </p>
+ </blockquote></blockquote>
+ <p>
+ In particular, [one of the WG21 experts] insisted on the piece "the elements of <tt>b</tt>".
+ <p/>
+ That is why I reported the test t263.dir&#47;_26322Y31.cpp having an undefined behaviour.
+ <p/>
+ [Plum Hall:]<br/>
+ OK, I can see that I will have to ask WG21; I will file an appropriate issue 
+ with the Library subgroup. In the meantime, I will mark this testcase as "DISPUTED" 
+ so that it is not required for conformance testing, until we get a definitive opinion.
+ </p>
+ </blockquote>
+ 
+ <p><i>[2012, Kona]</i></p>
  
  <p>
! Moved to Open.
! </p>
! <p>
! There appears to be a real need for clarification in the standard, and
! implementations differ in their current interpretation.  This will need
! some research by implementers and a proposed resolution before further
! discussion is likely to be fruitful.
  </p>
  
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2116"></a>2116. <tt>std::swap noexcept(what?)</tt></h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2011-12-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! IMO if we specified <tt>is_[nothrow_]constructible</tt> in terms of a variable
! declaration whose validity requires destructibility, it is clearly a bug
! in our specification and a failure to realize the actual original
! intent. The specification should have been in terms of placement-new.
! <p/>
! Daniel:<br/>
! At the time of the specification this was intended and the solution is
! <em>not</em> done by removing the destruction semantics of <tt>is_constructible</tt>.
! <p/>
! The design of <tt>is_constructible</tt> was also impacted by the previous
! <tt>Constructible</tt> concept that <em>explicitly</em> contained destruction semantics,
! because during conceptification of the library it turned out to simplify
! the constraints  in the library because you did not need to add
! <tt>Destructible</tt> all the time. It often was implied but never spoken out
! in C++03.
! <p/>
! Pure construction semantics was considered as useful as well, so <tt>HasConstructor</tt> 
! did also exist and would surely be useful as trait as well.
! <p/>
! Another example that is often overlooked: This also affects wrapper types like <tt>pair</tt>, 
! <tt>tuple</tt>, <tt>array</tt> that contain potentially more than one type:
! This is easy to understand if you think of <tt>T1</tt> having a deleted destructor
! and <tt>T2</tt> having a constructor that may throw: Obviously the compiler has
! potentially need to use the <tt>destructor</tt> of <tt>T1</tt> in the <em>constructor</em>
! of <tt>std::pair&lt;T1, T2&gt;</tt> to ensure that the core language requirements
! are satisfied (All previous fully constructed sub-objects must be destructed).
! <p/>
! The core language also honors this fact in 12.8 [class.copy] p11:
! </p>
! <blockquote><p>
! A defaulted copy&#47;move constructor for a class <tt>X</tt> is defined as deleted (8.4.3 [dcl.fct.def.delete]) 
! if <tt>X</tt> has:<br/>
! [&hellip;]<br/>
! &mdash; any direct or virtual base class or non-static data member of a type with a destructor that is deleted
! or inaccessible from the defaulted constructor,<br/>
! [&hellip;]
! </p></blockquote>
! <p>
! Dave:<br/>
! This is about <tt>is_nothrow_constructible</tt> in particular. The fact that it is 
! foiled by not having a <tt>noexcept</tt> dtor is a defect.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Open.
! </p>
! <p>
! <tt>is_nothrow_constructible</tt> is defined in terms of <tt>is_constructible</tt>, which is defined
! by looking at a hypothetical variable and asking whether the variable definition is known not to
! throw exceptions. The issue claims that this also examines the type's destructor, given the context,
! and thus will return <tt>false</tt> if the destructor can potentially throw. At least one
! implementation (Howard's) does return <tt>false</tt> if the constructor is <tt>noexcept(true)</tt>
! and the destructor is <tt>noexcept(false)</tt>. So that's not a strained interpretation.
! The issue is asking for this to be defined in terms of placement <tt>new</tt>, instead of in terms
! of a temporary object, to make it clearer that <tt>is_nothrow_constructible</tt> looks at the
! <tt>noexcept</tt> status of only the constructor, and not the destructor.
! </p>
! <p>
! Sketch of what the wording would look like:
! </p>
! <p>
! require <tt>is_constructible</tt>, and then also require that a placement <tt>new</tt> operation
! does not throw. (Remembering the title of this issue... What does this imply for <tt>swap</tt>?
! </p>
! <p>
! If we accept this resolution, do we need any changes to <tt>swap</tt>?
! </p>
! <p> STL argues: no, because you are already forbidden from passing anything with a throwing
! desturctor to <tt>swap</tt>.
! </p>
! <p>
! Dietmar argues: no, not true. Maybe statically the destructor can conceivably throw for some
! values, but maybe there are some values known not to throw. In that case, it's correct to
! pass those values to <tt>swap</tt>.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2117"></a>2117. <tt>ios_base</tt> manipulators should have <tt>showgrouping&#47;noshowgrouping</tt></h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals], 27.5.3.1.2 [ios::fmtflags], 27.5.6.1 [fmtflags.manip] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Benjamin Kosnik <b>Opened:</b> 2011-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Iostreams should include a manipulator to toggle grouping on&#47;off for
! locales that support grouped digits. This has come up repeatedly and
! been deferred. See LWG <a href="lwg-closed.html#826">826</a> for the previous attempt.
! <p/>
! If one is using a locale that supports grouped digits, then output
! will always include the generated grouping characters. However, very
! plausible scenarios exist where one might want to output the number,
! un-grouped. This is similar to existing manipulators that toggle
! on&#47;off the decimal point, numeric base, or positive sign.
! <p/>
! See some user commentary <a href="http://www.tablix.org/~avian/blog/archives/2008/01/c_streams_suck/">here</a>.
! </p>
! 
! 
! <p><i>[21012, Kona]</i></p>
! 
! <p>
! Move to Open.
! </p>
! <p>
! This is a feature request.
! </p>
! <p>
! Walter is slightly uncomfortable with processing feature requests through the issues lists.
! </p>
! <p>
! Alisdair says this is far from the first feature request that has come in from the issues list.
! </p>
! <p>
! STL: The fact that you can turn off grouping on hex output is compelling.
! </p>
! <p>
! Marshall: if we add this flag, we'll need to update tables 87-91 as well.
! </p>
! <p>
! STL: If it has been implemented somewhere, and it works, we'd be glad to add it.
! </p>
! <p>
! Howard: We need to say what the default is.
! </p>
! <p>
! Alisdair sumarizes:
! </p>
! <p>
! (1) We want clear wording that says what the effect is of turning the flag off;
! </p>
! <p>
! (2) what the default values are, and
! </p>
! <p>
! (3) how this fits into tables 87-90. (and 128)
! </p>
! 
! <p><i>[Issaquah 2014-02-10-12: Move to LEWG]</i></p>
! 
! <p>
! Since this issue was filed, we have grown a new working group that is better placed to handle feature requests.
! </p>
! <p>
! We will track such issues with an LEWG status until we get feedback from the Library Evolution Working Group.
! </p>
! 
! <p><i>[Issaquah 2014-02-12: LEWG discussion]</i></p>
! 
! 
! <table>
!   <caption>Do we think this feature should exist?</caption>
!   <tr><td>SF</td><td>F</td><td>N</td><td>A</td><td>SA</td></tr>
!   <tr><td>2</td> <td>4</td><td>1</td><td>0</td><td>0</td></tr>
! </table>
! 
! <p>Think about the ABI break for adding a flag. But this could be
! mitigated by putting the data into an iword instead of a flag.</p>
! 
! <p>This needs to change Stage 2 in [facet.num.put.virtuals].</p>
! 
! <p>Previous resolution, which needs the above corrections:</p>
! <blockquote class="note">
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li>
! <p>Insert in 22.4.2.2.2 [facet.num.put.virtuals] paragraph 5:</p>
! 
! <blockquote><p>
! <strong>Stage 1</strong>: The first action of stage 1 is to determine a conversion specifier. The tables that describe
! this determination use the following local variables
! </p>
! <pre>
! fmtflags flags = str.flags() ;
! fmtflags basefield = (flags &amp; (ios_base::basefield));
! fmtflags uppercase = (flags &amp; (ios_base::uppercase));
! fmtflags floatfield = (flags &amp; (ios_base::floatfield));
! fmtflags showpos = (flags &amp; (ios_base::showpos));
! fmtflags showbase = (flags &amp; (ios_base::showbase));
! <ins>fmtflags showgrouping = (flags &amp; (ios_base::showgrouping));</ins>
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Change header <tt>&lt;ios&gt;</tt> synopsis, 27.5.1 [iostreams.base.overview] as indicated:</p>
! 
! <blockquote><pre>
! #include &lt;iosfwd&gt;
! 
! namespace std {
!   [&hellip;]
!   <i>// 27.5.6, manipulators:</i>
!   [&hellip;]
!   ios_base&amp; showpoint     (ios_base&amp; str);
!   ios_base&amp; noshowpoint   (ios_base&amp; str);
!   <ins>ios_base&amp; showgrouping  (ios_base&amp; str);</ins>
!   <ins>ios_base&amp; noshowgrouping(ios_base&amp; str);</ins>
!   ios_base&amp; showpos       (ios_base&amp; str);
!   ios_base&amp; noshowpos     (ios_base&amp; str);
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change class <tt>ios_base</tt> synopsis, 27.5.3 [ios.base] as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   class ios_base {
!   public:
!   class failure;
!     <i>// 27.5.3.1.2 fmtflags</i>
!     typedef <i>T1</i> fmtflags;
!     [&hellip;]
!     static constexpr fmtflags showpoint = <i>unspecified</i> ;
!     <ins>static constexpr fmtflags showgrouping = <i>unspecified</i> ;</ins>
!     static constexpr fmtflags showpos = <i>unspecified</i> ;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Add a new entry to Table 122 &mdash; "<tt>fmtflags</tt> effects" as indicated:</p>
! 
! <table border="1">
! <caption>Table 122 &mdash; <tt>fmtflags</tt> effects</caption>
! <tr align="center">
! <th>Element</th>
! <th>Effect(s) if set</th>
! </tr> 
! 
! <tr>
! <td colspan="2" align="center">
! <tt>[&hellip;]</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>showpoint</tt>
! </td>
! <td>
! generates a decimal-point character unconditionally in generated floatingpoint output
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>showgrouping</tt></ins>
! </td>
! <td>
! <ins>generates grouping characters unconditionally in generated output</ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="2" align="center">
! <tt>[&hellip;]</tt>
! </td>
! </tr>
! 
! </table>
!  
! </li>
! 
! <li><p>After 27.5.3.1.2 [ios::fmtflags] p12 insert the following:</p>
! <blockquote><pre>
! <ins>ios_base&amp; showgrouping(ios_base&amp; str);</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Effects</i>: Calls <tt>str.setf(ios_base::showgrouping)</tt>.</ins>
! <p/>
! <ins>-?- <i>Returns</i>: <tt>str</tt>.</ins>
! </p>
! </blockquote>
! <pre>
! <ins>ios_base&amp; noshowgrouping(ios_base&amp; str);</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Effects</i>: Calls <tt>str.unsetf(ios_base::showgrouping)</tt>.</ins>
! <p/>
! <ins>-?- <i>Returns</i>: <tt>str</tt>.</ins>
! </p>
! </blockquote>
  </blockquote>
  </li>
  
  </ol>
  
+ </blockquote>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
  
  
  
  
  <hr>
! <h3><a name="2119"></a>2119. Missing <tt>hash</tt> specializations for extended integer types</h3>
! <p><b>Section:</b> 20.9.13 [unord.hash] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-12-16 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.hash">active issues</a> in [unord.hash].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
+ 
  <p>
! According to the header <tt>&lt;functional&gt;</tt> synopsis 20.9 [function.objects] 
! and to the explicit description in 20.9.13 [unord.hash] class template 
! <tt>hash</tt> specializations shall be provided for all arithmetic types that are 
! not extended integer types. This is not explicitly mentioned, but neither the list 
! nor any normative wording does include them, so it follows by implication.
! <p/>
! What are the reasons that extended integer types are excluded? E.g. for 
! <tt>numeric_limits</tt> corresponding specializations are required. I would 
! expect that an <tt>unordered_map</tt> with key type <tt>std::uintmax_t</tt> would 
! just work, but that depends now on whether this type is an extended integer type 
! or not.
! <p/>
! This issue is <em>not</em> asking for also providing specializations for the
! <i>cv</i>-qualified arithmetic types. While this is surely a nice-to-have feature,
! I consider that restriction as a more secondary problem in practice.
! <p/>
! The proposed resolution also fixes a problem mentioned in <a href="lwg-defects.html#2109">2109</a> in regard
! to confusing requirements on user-defined types and those on implementations.
  </p>
  
+ <p><i>[2012, Kona]</i></p>
+ 
  <p>
! Move to Open.
! </p>
! <p>
! Agreed that it's a real issue and that the proposed wording fixes it. However, the wording
! change is not minimal and isn't consistent with the way we fixed hash wording elsewhere.
! </p>
! <p>Alisdair will provide updated wording.
  </p>
  
+ <p><i>[2014-05-06 Geoffrey Romer suggests alternative wording]</i></p>
+ 
+ 
  <p>
! <strong>Previous resolution from Daniel [SUPERSEDED]:</strong>
  </p>
+ <blockquote class="note">
+ <p>This wording is relative to the FDIS.</p>
  
! <p>Change 20.9.13 [unord.hash] p2 as indicated:</p>
  
+ <blockquote><pre>
+ template &lt;&gt; struct hash&lt;bool&gt;;
+ template &lt;&gt; struct hash&lt;char&gt;;
+ [&hellip;]
+ template &lt;&gt; struct hash&lt;long double&gt;;
+ template &lt;class T&gt; struct hash&lt;T*&gt;;
+ </pre><blockquote>
+ <p>
+ -2- <del><i>Requires</i>: the template specializations shall meet the requirements 
+ of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
+ <tt>&lt;functional&gt;</tt> provides definitions for specializations of the 
+ <tt>hash</tt> class template for each <i>cv</i>-unqualified arithmetic type. This 
+ header also provides a definition for a partial specialization of the <tt>hash</tt> 
+ class template for any pointer type. The requirements for the members of these 
+ specializations are given in sub-clause 20.9.13 [unord.hash]</ins>.
+ </p>
+ </blockquote></blockquote>
+ </blockquote>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
  
  <p>
! STL: the new PR is very simple and could resolve that nicely<br/>
! MC: the older PR is rather longish
! </p>
! <ul>
! <li><p>anybody have any objections to this approach?</p></li>
! <li><p>what people want to have as a status?</p></li>
! </ul>
! <p>
! STL: I want to have Ready<br/>
! MC: move to ready: in favor: 13, opposed: 0, abstain: 4 
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
+ <p>Change 20.9.13 [unord.hash] p1 as indicated:</p>
+ 
+ <blockquote><p>
+ The unordered associative containers defined in 23.5 use specializations of the class template <tt>hash</tt> as the
+ default hash function. For all object types <tt>Key</tt> for which there exists a specialization <tt>hash&lt;Key&gt;</tt>, 
+ and for all <ins>integral and</ins> enumeration types (7.2) <tt>Key</tt>, the instantiation <tt>hash&lt;Key&gt;</tt> shall: [&hellip;]
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2121"></a>2121. <tt>app</tt> for string streams</h3>
+ <p><b>Section:</b> 27.8.5.1 [stringstream.cons] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2012-01-15 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
  
  <p>
! This issue was raised while discussing issue <a href="lwg-defects.html#1448">1448</a>.
! <p/>
! Note the following program:
! </p>
! <blockquote><pre>
! string s("s1: 123456789");
! ostringstream s1(s, ios_base::out|ios_base::app);
! s1 &lt;&lt; "hello";
! cout &lt;&lt; s1.str() &lt;&lt; endl;
! </pre></blockquote>
! <p>
! With g++4.x it prints:
! </p>
! <blockquote><pre>
! s1: 123456789hello
! </pre></blockquote>
! <p>
! With VisualC++10 it prints:
! </p>
! <blockquote><pre>
! hello23456789
! </pre></blockquote>
! <p>
! From my intuitive understanding the flag "app" should result in the output of g++4.x.
! I also would read that from 27.5.3.1.4 [ios::openmode] claiming:
! </p>
! <blockquote><p>
! <tt>app</tt>&nbsp;&nbsp;&nbsp;seek to end before each write
! </p></blockquote>
! <p>
! However in issue <a href="lwg-defects.html#1448">1448</a> P.J.Plauger comments:
! </p>
! <blockquote><p>
! I think we should say nothing special about <tt>app</tt> at construction time (thus leaving the write pointer at the beginning of the buffer).
! Leave implementers wiggle room to ensure subsequent append writes as they see fit, but don't change existing rules for initial seek
! position.
! </p></blockquote>
! <p>
! Note that the flag <tt>ate</tt> on both platforms appends "hello" to <tt>s</tt>.
  </p>
  
  
  
+ <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="2127"></a>2127. Move-construction with <tt>raw_storage_iterator</tt></h3>
! <p><b>Section:</b> 20.7.10 [storage.iterator] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-01-23 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#storage.iterator">issues</a> in [storage.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
+ 
  <p>
! Aliaksandr Valialkin pointed out that <tt>raw_storage_iterator</tt> only supports constructing 
! a new object from lvalues so cannot be used to construct move-only types:
  </p>
+ <blockquote><pre>
+ template &lt;typename InputIterator, typename T&gt;
+ void move_to_raw_buffer(InputIterator first, InputIterator last, T *raw_buffer)
+ {
+   std::move(first, last, std::raw_storage_iterator&lt;T *, T&gt;(raw_buffer));
+ }
+ </pre></blockquote>
  <p>
! This could easily be solved by overloading <tt>operator=</tt> for rvalues.
! <p/>
! Dave Abrahams:
! <p/>
! <tt>raw_storage_iterator</tt> causes exception-safety problems when used with any
! generic algorithm. I suggest leaving it alone and not encouraging its use.
  </p>
  
+ <p><i>[2014-11-11, Jonathan provides improved wording]</i></p>
+ 
  <p>
! In Urbana LWG decided to explicitly say the value is constructed from an rvalue.
  </p>
  
+ <strong>Previous resolution from Jonathan [SUPERSEDED]:</strong>
+ <p/>
+ <blockquote class="note">
+ <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3337.pdf">N3337</a>.</p>
+ 
+ <ol>
+ <li><p>Add a new signature to the synopsis in 20.7.10 [storage.iterator] p1:</p>
+ 
+ <blockquote><pre>
+ namespace std {
+   template &lt;class OutputIterator, class T&gt;
+   class raw_storage_iterator
+     : public iterator&lt;output_iterator_tag,void,void,void,void&gt; {
+   public:
+     explicit raw_storage_iterator(OutputIterator x);
+ 
+     raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator*();
+     raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator=(const T&amp; element);
+     <ins>raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator=(T&amp;&amp; element);</ins>
+     raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator++();
+     raw_storage_iterator&lt;OutputIterator,T&gt; operator++(int);
+ };
+ }
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>Insert the new signature and a new paragraph before p4:</p>
+ 
+ <blockquote><pre>
+ raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator=(const T&amp; element);
+ <ins>raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator=(T&amp;&amp; element);</ins>
+ </pre><blockquote>
  <p>
! <ins>-?- <i>Requires</i>: For the first signature <tt>T</tt> shall be <tt>CopyConstructible</tt>. For
! the second signature <tt>T</tt> shall be <tt>MoveConstructible</tt>.</ins>
! <p/>
! -4- <i>Effects</i>: Constructs a value from <tt>element</tt> at the location to which the iterator points.
! <p/>
! -5- <i>Returns</i>: A reference to the iterator.
  </p>
+ </blockquote></blockquote>
+ </li>
+ </ol>
+ </blockquote>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
  
  <p>
! MC: Suggestion to move it to Ready for incorporation on Friday<br/>
! MC: move to ready: in favor: 12, opposed: 0, abstain: 3 
  </p>
  
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/prot/14882fdis/n4140.pdf">N4140</a>.</p>
! 
! <ol>
! <li><p>Add a new signature to the synopsis in 20.7.10 [storage.iterator] p1:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class OutputIterator, class T&gt;
!   class raw_storage_iterator
!     : public iterator&lt;output_iterator_tag,void,void,void,void&gt; {
!   public:
!     explicit raw_storage_iterator(OutputIterator x);
! 
!     raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator*();
!     raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator=(const T&amp; element);
!     <ins>raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator=(T&amp;&amp; element);</ins>
!     raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator++();
!     raw_storage_iterator&lt;OutputIterator,T&gt; operator++(int);
! };
! }
! </pre></blockquote>
  </li>
! 
! <li><p>Insert a new paragraph before p4:</p>
! 
! <blockquote><pre>
! raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator=(const T&amp; element);
! </pre><blockquote>
  <p>
! <ins>-?- <i>Requires</i>: <tt>T</tt> shall be <tt>CopyConstructible</tt>.</ins>
! <p/>
! -4- <i>Effects</i>: Constructs a value from <tt>element</tt> at the location to which the iterator points.
! <p/>
! -5- <i>Returns</i>: A reference to the iterator.
  </p>
! </blockquote></blockquote>
  </li>
  
+ <li><p>Insert the new signature and a new paragraph after p5:</p>
+ 
+ <blockquote><pre>
+ <ins>raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator=(T&amp;&amp; element);</ins>
+ </pre><blockquote>
  <p>
! <ins>-?- <i>Requires</i>: <tt>T</tt> shall be <tt>MoveConstructible</tt>.</ins>
! <p/>
! <ins>-?- <i>Effects</i>: Constructs a value from <tt>std::move(element)</tt> at the
! location to which the iterator points.</ins>
! <p/>
! <ins>-?- <i>Returns</i>: A reference to the iterator.</ins>
  </p>
+ </blockquote></blockquote>
+ </li>
+ </ol>
  
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2133"></a>2133. Attitude to overloaded comma for iterators</h3>
! <p><b>Section:</b> 17.6.5.4 [global.functions] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Yakov Galka <b>Opened:</b> 2012-01-25 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#global.functions">issues</a> in [global.functions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 17.6.5.4 [global.functions] says
! </p>
! <blockquote><p>
! Unless otherwise specified, global and non-member functions in the standard library 
! shall not use functions from another namespace which are found through argument-dependent 
! name lookup (3.4.2).
! </p></blockquote>
! <p>
! This sounds clear enough. There are just two problems:
! </p>
! <ol>
! <li><p>
! Both implementations I tested (VS2005 and GCC 3.4.3) do unqualified
! calls to the comma operator in some parts of the library with operands
! of user-defined types.
! </p></li>
  <li>
  <p>
! The standard itself does this in the description of some algorithms. E.g. <tt>uninitialized_copy</tt> 
! is defined as:
  </p>
! <blockquote><p>
! <i>Effects</i>:
! </p><blockquote>
! <pre>
! for (; first != last; <span style="color:#C80000;font-weight:bold">++result, ++first</span>)
!   ::new (static_cast&lt;void*&gt;(&amp;*result))
!     typename iterator_traits&lt;ForwardIterator&gt;::value_type(*first);
! </pre>
! </blockquote>
! </blockquote>
  </li>
! </ol>
  <p>
! If understood literally, it is required to call <tt>operator,(ForwardIterator, InputIterator)</tt>.
! <p/>
! For detailed discussion with code samples see 
! <a href="http://stackoverflow.com/questions/8719829/should-the-implementation-guard-itself-against-comma-overloading">here</a>.
! <p/>
! Proposal:
  </p>
! <ol>
! <li>
! Add an exception to the rule in 17.6.5.4 [global.functions] by permitting
! the implementation to call the comma operator as much as it wants to. I doubt we want this. or
  </li>
  <li>
+ Fix the description of the said algorithms and perhaps add a note to 17.6.5.4 [global.functions] 
+ that brings attention of the implementers to avoid this pitfall.
+ </li>
+ </ol>
+ 
+ <p><i>[2013-03-15 Issues Teleconference]</i></p>
+ 
  <p>
! Moved to Open.
  </p>
! <p>
! There are real questions here, that may require a paper to explore and answer properly.
! </p>
! 
! <p><i>[2014-05-18, Daniel comments and suggests concrete wording]</i></p>
! 
! 
! <p>
! Other issues, such as <a href="lwg-active.html#2114">2114</a> already follow a similar spirit as the one suggested by bullet 2 of the
! issue submitter. I assert that consideration of possible user-provided overloads of the comma-operator were not intended
! by the original wording and doing so afterwards would unnecessarily complicate a future conceptualization of the library
! and would needlessly restrict implementations.
! <p/>
! I don't think that a paper is needed to solve this issue, there is a simply way to ensure that the code-semantics
! excludes consideration of user-provided comma operators. The provided wording below clarifies this by explicitly
! casting the first argument of the operator to <tt>void</tt>. 
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! DK: is putting it in the middle the right place for it?<br/>
! STL: either works, but visually putting it in the middle is clearer, and for "++it1, ++i2, ++it3" it needs to be 
! done after the second comma, so "++it1, (void) ++i2, (void) ++it3" is better than "(void) ++it1, ++i2, (void) ++it3"<br/>
! ZY: for <tt><i>INVOKE</i></tt> yesterday we used <tt>static_cast&lt;void&gt;</tt> but here we're using C-style cast, why?<br/>
! STL: for <tt><i>INVOKE</i></tt> I want to draw attention that there's an intentional coercion to <tt>void</tt> because that's 
! the desired type. Here we only do it because that's the best way to prevent the problem, not because we specifically want a 
! <tt>void</tt> type.<br/>
! Move to Ready: 9 in favor, none opposed, 1 abstention 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.7.12.2 [uninitialized.copy] as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class InputIterator, class ForwardIterator&gt;
!   ForwardIterator uninitialized_copy(InputIterator first, InputIterator last,
!                                      ForwardIterator result);
! </pre>
! <blockquote>
! <p>
! -1- <i>Effects</i>:
! </p>
! <blockquote>
! <pre>
! for (; first != last; ++result, <ins>(void)</ins> ++first)
!   ::new (static_cast&lt;void*&gt;(&amp;*result))
!     typename iterator_traits&lt;ForwardIterator&gt;::value_type(*first);
! </pre>
! </blockquote>
! <p>
! [&hellip;]
! </p>
! </blockquote>
! 
! <pre>
! template &lt;class InputIterator, class Size,class ForwardIterator&gt;
!   ForwardIterator uninitialized_copy_n(InputIterator first, Size n,
!                                        ForwardIterator result);
! </pre>
! <blockquote>
! <p>
! -3- <i>Effects</i>:
! </p>
! <blockquote>
! <pre>
! for (; n &gt; 0; ++result, <ins>(void)</ins> ++first, --n)
!   ::new (static_cast&lt;void*&gt;(&amp;*result))
!     typename iterator_traits&lt;ForwardIterator&gt;::value_type(*first);
! </pre>
! </blockquote>
! </blockquote>
! 
! </blockquote>
  </li>
! 
! <li><p>Change 25.4.8 [alg.lex.comparison] p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! template&lt;class InputIterator1, class InputIterator2&gt;
!   bool
!     lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
!                             InputIterator2 first2, InputIterator2 last2);
! template&lt;class InputIterator1, class InputIterator2, class Compare&gt;
!   bool
!     lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
!                             InputIterator2 first2, InputIterator2 last2,
!                             Compare comp);
! </pre>
! <blockquote>
  <p>
! -3- <i>Remarks</i>: [&hellip;]
  </p>
! <blockquote>
! <pre>
! for ( ; first1 != last1 &amp;&amp; first2 != last2 ; ++first1, <ins>(void)</ins> ++first2) {
!   if (*first1 &lt; *first2) return true;
!   if (*first2 &lt; *first1) return false;
! }
! return first1 == last1 &amp;&amp; first2 != last2;
! </pre>
! </blockquote>
! </blockquote>
! </blockquote>
! 
  </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2136"></a>2136. Postconditions vs. exceptions</h3>
! <p><b>Section:</b> 17.5.1 [structure] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2012-03-08 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
  
  <p>
! The front matter in clause 17 should clarify that postconditions will not hold if a 
! standard library function exits via an exception. Postconditions or guarantees that 
! apply when an exception is thrown (beyond the basic guarantee) are described in an 
! "Exception safety" section.
  </p>
  
+ <p><i>[
+ 2012-10 Portland: Move to Open
+ ]</i></p>
+ 
+ 
  <p>
! Consensus that we do not clearly say this, and that we probably should.  A likely
! location to describe the guarantees of <i>postconditions</i> could well be a new
! sub-clause following 17.6.4.11 [res.on.required] which serves the same purpose
! for <i>requires</i> clauses.  However, we need such wording before we can make
! progress.
! </p>
! 
! <p>
! Also, see <a href="lwg-active.html#2137">2137</a> for a suggestion that we want to see a paper resolving
! both issues together.
! </p>
! 
! <p><i>[2015-05-06 Lenexa: EirkWF to write paper addressing 2136 and 2137]</i></p>
! 
! <p>MC: Idea is to replace all such "If no exception" postconditions with "Exception safety" sections.</p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2137"></a>2137. Misleadingly constrained post-condition in the presence of exceptions</h3>
! <p><b>Section:</b> 28.8.3 [re.regex.assign] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-03-08 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.regex.assign">issues</a> in [re.regex.assign].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The post-conditions of <tt>basic_regex&lt;&gt;::assign</tt> 28.8.3 [re.regex.assign] p16 say:
! </p>
! <blockquote><p>
! <span style="color:#C80000;font-weight:bold">If no exception is thrown,</span> <tt>flags()</tt> returns 
! <tt>f</tt> and <tt>mark_count()</tt> returns the number of marked sub-expressions within the expression.
! </p></blockquote>
! <p>
! The default expectation in the library is that post-conditions only hold, if there is no failure 
! (see also <a href="lwg-active.html#2136">2136</a>), therefore the initial condition should be removed to prevent any
! misunderstanding.
  </p>
  
  <p><i>[
! 2012-10 Portland: Move to Open
  ]</i></p>
  
+ 
  <p>
! A favorable resolution clearly depends on a favorable resolution to <a href="lwg-active.html#2136">2136</a>.
! There is also a concern that this is just one example of where we would want to apply
! such a wording clean-up, and which is really needed to resolve both this issue and
! <a href="lwg-active.html#2136">2136</a> is a paper providing the clause 17 wording that gives the guarantee
! for <i>postcondition</i> paragaraphs, and then reviews clauses 18-30 to apply that
! guarantee consistently.  We do not want to pick up these issues piecemeal, as we risk
! openning many issues in an ongoing process.
  </p>
  
+ <p><i>[2015-05-06 Lenexa: EirkWF to write paper addressing 2136 and 2137]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3376.</p>
+ 
+ <blockquote><pre>
+ template &lt;class string_traits, class A&gt;
+   basic_regex&amp; assign(const basic_string&lt;charT, string_traits, A&gt;&amp; s,
+     flag_type f = regex_constants::ECMAScript);
+ </pre><blockquote>
+ <p>
+ [&hellip;]
+ <p/>
+ -15- <i>Effects</i>: Assigns the regular expression contained in the string <tt>s</tt>, interpreted according 
+ the flags specified in <tt>f</tt>. If an exception is thrown, <tt>*this</tt> is unchanged.
+ <p/>
+ -16- <i>Postconditions</i>: <del>If no exception is thrown,</del> <tt>flags()</tt> returns <tt>f</tt> and 
+ <tt>mark_count()</tt> returns the number of marked sub-expressions within the expression.
+ </p>
+ </blockquote>
+ </blockquote>
+ 
  
  
  
  
  
  <hr>
! <h3><a name="2139"></a>2139. What is a <em>user-defined</em> type?</h3>
! <p><b>Section:</b> 17.6.4.2.1 [namespace.std], 19.5 [syserr], 20.7.7.1 [allocator.uses.trait], 20.9.10.1 [func.bind.isbind], 20.9.10.2 [func.bind.isplace], 20.9.13 [unord.hash], 20.10.7.6 [meta.trans.other], 22.3.1 [locale], 22.4.1.4 [locale.codecvt], 28.12.1.4 [re.regiter.incr] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Lo&iuml;c Joly <b>Opened:</b> 2012-03-08 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#namespace.std">issues</a> in [namespace.std].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
+ 
  <p>
! The expression "user-defined type" is used in several places in the standard, but I'm not sure what 
! it means. More specifically, is a type defined in the standard library a user-defined type?
! <p/>
! From my understanding of English, it is not. From most of the uses of this term in the standard, it 
! seem to be considered as user defined. In some places, I'm hesitant, e.g. 17.6.4.2.1 [namespace.std] p1:
! </p>
! <blockquote><p>
! A program may add a template specialization for any standard library template to namespace <tt>std</tt> 
! only if the declaration depends on a user-defined type and the specialization meets the standard library 
! requirements for the original template and is not explicitly prohibited.
! </p></blockquote>
! <p>
! Does it mean we are allowed to add in the namespace <tt>std</tt> a specialization for 
! <tt>std::vector&lt;std::pair&lt;T, U&gt;&gt;</tt>, for instance?
! <p/>
! Additional remarks from the reflector discussion: The traditional meaning of user-defined types refers
! to class types and enum types, but the library actually means here user-defined types that are not
! (purely) library-provided. Presumably a new term - like <em>user-provided type</em> - should be introduced
! and properly defined.
! </p>
! 
! <p><i>[
! 2012-10 Portland: Move to Deferred 
! ]</i></p>
! 
! 
! <p>
! The issue is real, in that we never define this term and rely on a "know it when I see it"
! intuition.  However, there is a fear that any attempt to pin down a definition is more
! likely to introduce bugs than solve them - getting the wording for this precisely correct
! is likely far more work than we are able to give it.
! </p>
! 
! <p>
! There is unease at simple closing as NAD, but not real enthusiasm to provide wording either.
! Move to Deferred as we are not opposed to some motivated individual coming back with full
! wording to review, but do not want to go out of our way to encourage someone to work on this
! in preference to other issues.
  </p>
  
+ <p><i>[2014-02-20 Re-open Deferred issues as Priority 4]</i></p>
+ 
+ 
+ <p><i>[2015-03-05 Jonathan suggests wording]</i></p>
+ 
+ <p>
+ I dislike the suggestion to change to "user-provided" type because I already find the 
+ difference between user-declared / user-provided confusing for special member functions, 
+ so I think it would be better to use a completely different term. The core language
+ uses "user-defined conversion sequence" and "user-defined literal" and
+ similar terms for things which the library provides, so I think we
+ should not refer to "user" at all to distinguish entities defined
+ outside the implementation from things provided by the implementation.
+ <p/>
+ I propose "program-defined type" (and "program-defined specialization"), defined below. 
+ The P/R below demonstrates the scope of the changes required, even if this name isn't adopted. 
+ I haven't proposed a change for "User-defined facets" in [locale].
+ </p>
+ 
+ <p><i>[Lenexa 2015-05-06]</i></p>
+ 
+ <p>RS, HT: The core language uses "user-defined" in a specific way, including library things but excluding core language things, let's use a different term.</p>
+ <p>MC: Agree.</p>
+ <p>RS: "which" should be "that", x2</p>
+ <p>RS: Is std::vector&lt;MyType&gt; a "program-defined type"?</p>
+ <p>MC: I think it should be.</p>
+ <p>TK: std::vector&lt;int&gt; seems to take the same path.</p>
+ <p>JW: std::vector&lt;MyType&gt; isn't program-defined, we don't need it to be, anything that depends on that also depends on =MyType.</p>
+ <p>TK: The type defined by an "explicit template specialization" should be a program-defined type.</p>
+ <p>RS: An implicit instantiation of a "program-defined partial specialization" should also be a program-defined type.</p>
+ <p>JY: This definition formatting is horrible and ugly, can we do better?</p>
+ <p>RS: Checking ISO directives.</p>
+ <p>RS: Define "program-defined type" and "program-defined specialization" instead, to get rid of the angle brackets.</p>
+ <p>JW redrafting.</p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li><p>Add a new sub-clause to 17.3 [definitions]:</p>
+ 
+ <p><ins><b>17.3.? [defns.program.defined]</b></ins></p>
+ <p>
+ <ins><b>program-defined</b></ins>
+ <p/>
+ <ins>&lt;type&gt; a class type or enumeration type which is not part of the C++
+ standard library and not defined by the implementation. [<i>Note</i>: Types
+ defined by the implementation include extensions (1.4 [intro.compliance])
+ and internal types used by the library. &mdash; <i>end note</i>]</ins>
+ </p>
+ <p>
+ <ins><b>program-defined</b></ins>
+ <p/>
+ <ins>&lt;specialization&gt; an explicit template specialization or partial
+ specialization which is not part of the C++ standard library and not
+ defined by the implementation.</ins>
+ </p>
+ </li>
+ 
+ <li><p>Change 17.6.4.2.1 [namespace.std] paragraph 1+2:</p>
+ 
+ <p>
+ -1- The behavior of a C++ program is undefined if it adds declarations or definitions to namespace <tt>std</tt> or to a
+ namespace within namespace <tt>std</tt> unless otherwise specified. A program may add a template specialization
+ for any standard library template to namespace <tt>std</tt> only if the declaration depends on a 
+ <del>user</del><ins>program</ins>-defined type and the specialization meets the standard library requirements for the 
+ original template and is not explicitly prohibited.
+ <p/>
+ -2- The behavior of a C++ program is undefined if it declares
+ <p/>
+ [&hellip;]
+ <p/>
+ A program may explicitly instantiate a template defined in the standard library only if the declaration
+ depends on the name of a <del>user</del><ins>program</ins>-defined type and the instantiation meets the standard 
+ library requirements for the original template.
+ </p>
+ </li>
+ 
+ <li><p>Change 19.5 [syserr] paragraph 4:</p>
+ 
+ <p>
+ -4- The <tt>is_error_code_enum</tt> and <tt>is_error_condition_enum</tt> may be specialized for 
+ <del>user</del><ins>program</ins>-defined types to indicate that such types are eligible for class <tt>error_code</tt> 
+ and class <tt>error_condition</tt> automatic conversions, respectively.
+ </p>
+ </li>
+ 
+ <li><p>Change 20.7.7.1 [allocator.uses.trait] paragraph 1:</p>
+ 
+ <p>
+ -1- <i>Remarks</i>: automatically detects [&hellip;]. A program may specialize this template to derive from 
+ <tt>true_type</tt> for a <del>user</del><ins>program</ins>-defined type <tt>T</tt> that does not have a nested 
+ <tt>allocator_type</tt> but nonetheless can be constructed with an allocator where either: [&hellip;]
+ </p>
+ </li>
+ 
+ <li><p>Change 20.9.10.1 [func.bind.isbind] paragraph 2:</p>
+ 
+ <p>
+ -2- Instantiations of the <tt>is_bind_expression</tt> template [&hellip;]. A program may specialize
+ this template for a <del>user</del><ins>program</ins>-defined type <tt>T</tt> to have a <tt>BaseCharacteristic</tt> 
+ of <tt>true_type</tt> to indicate that <tt>T</tt> should be treated as a subexpression in a <tt>bind</tt> call.
+ </p>
+ </li>
+ 
+ <li><p>Change 20.9.10.2 [func.bind.isplace] paragraph 2:</p>
+ 
+ <p>
+ -2- Instantiations of the <tt>is_placeholder</tt> template [&hellip;]. A program may specialize this template for a 
+ <del>user</del><ins>program</ins>-defined type <tt>T</tt> to have a <tt>BaseCharacteristic</tt> of 
+ <tt>integral_constant&lt;int, <i>N</i>&gt;</tt> with <tt><i>N</i> &gt; 0</tt> to indicate that <tt>T</tt> should be 
+ treated as a placeholder type.
+ </p>
+ </li>
+ 
+ <li><p>Change 20.9.13 [unord.hash] paragraph 1:</p>
+ 
+ <p>
+ The unordered associative containers defined in 23.5 use specializations of the class template <tt>hash</tt> [&hellip;], 
+ the instantiation <tt>hash&lt;Key&gt;</tt> shall:
+ </p>
+ <ul>
+ <li><p>[&hellip;]</p></li>
+ <li><p>[&hellip;]</p></li>
+ <li><p>[&hellip;]</p></li>
+ <li><p>[&hellip;]</p></li>
+ <li><p>satisfy the requirement that the expression <tt>h(k)</tt>, where <tt>h</tt> is an object of type 
+ <tt>hash&lt;Key&gt;</tt> and <tt>k</tt> is an object of type <tt>Key</tt>, shall not throw an exception unless 
+ <tt>hash&lt;Key&gt;</tt> is a <del>user</del><ins>program</ins>-defined specialization that depends on at least one 
+ <del>user</del><ins>program</ins>-defined type.</p></li>
+ </ul>
+ </li>
+ 
+ <li><p>Change 20.10.7.5 [meta.trans.ptr] Table 57 (<tt>common_type</tt> row):</p>
+ 
  <blockquote>
  <table border="1">
+ <caption>Table 57 &mdash; Other transformations</caption>
+ <tr>
+ <th align="center">Template</th>
+ <th align="center">Condition</th>
+ <th align="center">Comments</th>
+ </tr>
  
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
  
! <tr>
! <td>
! <tt>template &lt;class... T&gt;<br/>
! struct common_type;</tt>
! </td>
! 
! <td align="center">
! &nbsp;
! </td>
! 
! <td>
! The member typedef <tt>type</tt> shall be<br/>
! defined or omitted as specified below.<br/>
! [&hellip;]. A program may<br/>
! specialize this trait if at least one<br/>
! template parameter in the<br/>
! specialization is a <del>user</del><ins>program</ins>-defined type.<br/>
! [&hellip;]
! </td>
  </tr>
  
  <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
  </tr>
  
! </table>
  </blockquote>
  
+ </li>
+ 
+ <li><p>Change 22.4.1.4 [locale.codecvt] paragraph 3:</p>
+ 
  <p>
! -3- The specializations required in Table 81 (22.3.1.1.1) [&hellip;]. Other encodings can be converted 
! by specializing on a <del>user</del><ins>program</ins>-defined <tt>stateT</tt> type.[&hellip;]
  </p>
  </li>
  
! <li><p>Change 28.12.1.4 [re.regiter.incr] paragraph 8:</p>
  
  <p>
! -8- [<i>Note</i>: This means that a compiler may call an implementation-specific search function, in which case
! a <del>user</del><ins>program</ins>-defined specialization of <tt>regex_search</tt> will not be called. &mdash; 
! <i>end note</i>]
  </p>
  </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2146"></a>2146. Are reference types <tt>Copy</tt>&#47;<tt>Move-Constructible</tt>&#47;<tt>Assignable</tt> or <tt>Destructible</tt>?</h3>
+ <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Nikolay Ivchenkov <b>Opened:</b> 2012-03-23 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
  
+ <p>
+ According to 17.6.3.1 [utility.arg.requirements] p1
+ </p>
+ <blockquote><p>
+ The template definitions in the C++ standard library refer to various named requirements whose details are set out in 
+ tables 17-24. In these tables, <tt>T</tt> is an object or reference type to be supplied by a C++ program instantiating 
+ a template; <tt>a</tt>, <tt>b</tt>, and <tt>c</tt> are values of type (possibly <tt>const</tt>) <tt>T</tt>; <tt>s</tt> 
+ and <tt>t</tt> are modifiable lvalues of type <tt>T</tt>; <tt>u</tt> denotes an identifier; <tt>rv</tt> is an rvalue of 
+ type <tt>T</tt>; and <tt>v</tt> is an lvalue of type (possibly <tt>const</tt>) <tt>T</tt> or an rvalue of type <tt>const T</tt>.
+ </p></blockquote>
+ <p>
+ Is it really intended that <tt>T</tt> may be a reference type? If so, what should <tt>a</tt>, <tt>b</tt>, <tt>c</tt>, 
+ <tt>s</tt>, <tt>t</tt>, <tt>u</tt>, <tt>rv</tt>, and <tt>v</tt> mean? For example, are "<tt>int &amp;</tt>" and 
+ "<tt>int &amp;&amp;</tt>" <tt>MoveConstructible</tt>?
+ <p/>
+ As far as I understand, we can explicitly specify template arguments for <tt>std::swap</tt> and <tt>std::for_each</tt>. 
+ Can we use reference types there?
+ </p>
+ <ol>
  <li>
! <blockquote><pre>
! #include &lt;iostream&gt;
! #include &lt;utility&gt;
  
+ int main()
+ {
+   int x = 1;
+   int y = 2;
+   std::swap&lt;<span style="color:#C80000;font-weight:bold">int &amp;&amp;</span>&gt;(x, y); // <em>undefined?</em>
+   std::cout &lt;&lt; x &lt;&lt; " " &lt;&lt; y &lt;&lt; std::endl;
+ }
+ </pre></blockquote>
+ </li>
  <li>
! <blockquote><pre>
! #include &lt;algorithm&gt;
! #include &lt;iostream&gt;
! #include &lt;iterator&gt;
! #include &lt;utility&gt;
! 
! struct F
! {
!   void operator()(int n)
!   {
!     std::cout &lt;&lt; n &lt;&lt; std::endl;
!     ++count;
!   }
!   int count;
! } f;
! 
! int main()
! {
!   int arr[] = { 1, 2, 3 };
!   auto&amp;&amp; result = std::for_each&lt;int *, <span style="color:#C80000;font-weight:bold">F &amp;&amp;</span>&gt;( // <em>undefined?</em>
!     std::begin(arr),
!     std::end(arr),
!     std::move(f));
!   std::cout &lt;&lt; "count: " &lt;&lt; result.count &lt;&lt; std::endl;
! }
! </pre></blockquote>
  </li>
  </ol>
+ <p>
+ Are these forms of usage well-defined?
+ <p/>
+ Let's also consider the following constructor of <tt>std::thread</tt>:
+ </p>
+ <blockquote><pre>
+ template &lt;class F, class ...Args&gt;
+ explicit thread(F&amp;&amp; f, Args&amp;&amp;... args);
+ </pre><blockquote>
+ <p>
+ <i>Requires</i>: <tt>F</tt> and each <tt>Ti</tt> in <tt>Args</tt> shall satisfy the <tt>MoveConstructible</tt> requirements.
+ </p>
+ </blockquote></blockquote>
+ <p>
+ When the first argument of this constructor is an lvalue (e.g. a name of a global function), template argument for <tt>F</tt> 
+ is deduced to be lvalue reference type. What should "<tt>MoveConstructible</tt>" mean with regard to an lvalue reference 
+ type? Maybe the wording should say that <tt>std::decay&lt;F&gt;::type</tt> and each <tt>std::decay&lt;Ti&gt;::type</tt> (where 
+ <tt>Ti</tt> is an arbitrary item in <tt>Args</tt>) shall satisfy the <tt>MoveConstructible</tt> requirements?
+ </p>
+ 
+ <p><i>[2013-03-15 Issues Teleconference]</i></p>
  
  <p>
! Moved to Open.
! </p>
! <p>
! The questions raised by the issue are real, and should have a clear answer.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2151"></a>2151. <tt>basic_string&lt;&gt;::swap</tt> semantics ignore allocators</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Robert Shearer <b>Opened:</b> 2012-04-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! In C++11, <tt>basic_string</tt> is not described as a "container", and is not governed by the allocator-aware 
! container semantics described in sub-clause 23.2 [container.requirements]; as a result, and 
! requirements or contracts for the <tt>basic_string</tt> interface must be documented in Clause 
! 21 [strings].
! <p/>
! Sub-clause 21.4.6.8 [string::swap] defines the <tt>swap</tt> member function with no requirements, and
! with guarantees to execute in constant time without throwing. Fulfilling such a contract is not reasonable 
! in the presence of unequal non-propagating allocators.
! <p/>
! In contrast, 23.2.1 [container.requirements.general] p7 declares the behavior of member <tt>swap</tt> 
! for containers with unequal non-propagating allocators to be undefined.
! <p/>
! Resolution proposal:
! <p/>
! Additional language from Clause 23 [containers] should probably be copied to Clause 
! 21 [strings]. I will refrain from an exactly recommendation, however, as I am raising further
! issues related to the language in Clause 23 [containers].
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
! </p>
! <p>
! Alisdair has offered to provide wording.
! </p>
! <p>
! Telecon notes that 23.2.1 [container.requirements.general]p13 says that <tt>string</tt> is an
! allocator-aware container.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2152"></a>2152. Instances of standard container types are not swappable</h3>
! <p><b>Section:</b> 17.6.3.2 [swappable.requirements], 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Robert Shearer <b>Opened:</b> 2012-04-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#swappable.requirements">issues</a> in [swappable.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Sub-clause 17.6.3.2 [swappable.requirements] defines two notions of swappability: a binary version defining
! when two objects are <em>swappable with</em> one another, and a unary notion defining whether an object is 
! <em>swappable</em> (without qualification), with the latter definition requiring that the object satisfy the 
! former with respect to all values of the same type.
! <p/>
! Let <tt>T</tt> be a container type based on a non-propagating allocator whose instances do not necessarily 
! compare equal. Then sub-clause 23.2.1 [container.requirements.general] p7 implies that no object <tt>t</tt> 
! of type <tt>T</tt> is swappable (by the unary definition).
! <p/>
! Throughout the standard it is the unary definition of "swappable" that is listed as a requirement (with the 
! exceptions of 20.2.2 [utility.swap] p4, 20.3.2 [pairs.pair] p31, 20.4.2.3 [tuple.swap] p2, 
! 25.3.3 [alg.swap] p2, and 25.3.3 [alg.swap] p6, which use the binary definition). This renders 
! many of the mutating sequence algorithms of sub-clause 25.3 [alg.modifying.operations], for example, 
! inapplicable to sequences of standard container types, even where every element of the sequence is swappable 
! with every other.
! <p/>
! Note that this concern extends beyond standard containers to all future allocator-based types.
! <p/>
! Resolution proposal:
! <p/>
! I see two distinct straightforward solutions:
! </p>
! <ol style="list-style-type:lower-roman">
! <li>Modify the requirements of algorithms from sub-clause 25.3 [alg.modifying.operations], and all other
! places that reference the unary "swappable" definition, to instead use the binary "swappable with" definition 
! (over a domain appropriate to the context). The unary definition of "swappable" could then be removed from the 
! standard.
! </li>
! <li>Modify sub-clause 23.2.1 [container.requirements.general] such that objects of standard container types 
! are "swappable" by the unary definition.
! </li>
! </ol>
! <p>
! I favor the latter solution, for reasons detailed in the following issue.
  </p>
  
  <p><i>[
! 2012-10 Portland: Move to Open 
  ]</i></p>
  
  
  <p>
! The issue is broader than containers with stateful allocotors, although they are the most obvious
! example contained within the standard itself.  The basic problem is that once you have a stateful
! allocator, that does not <tt>propagate_on_swap</tt>, then whether two objects of this type can be
! swapped with well defined behavior is a run-time property (the allocators compare equal) rather
! than a simple compile-time property that can be deduced from the type.  Strictly speaking, any
! type where the nature of swap is a runtime property does not meet the <tt>swappable</tt>
! requirements of C++11, although typical sequences of such types are going to have elements that
! are all <tt>swappable with</tt> any other element in the sequence (using our other term of art
! for specifying requirements) as the common case is a container of elements who all share the
! same allocator.
  </p>
  
  <p>
! The heart of the problem is that the <tt>swappable</tt> requirments demand that any two objects
! of the same type be <tt>swappable with</tt> each other, so if any two such objects would not
! be <tt>swappable with</tt> each other, then the whole type is never <tt>swappable</tt>.  Many
! algorithms in clause 25 are specified in terms of <tt>swappable</tt> which is essentially an
! overspecification as all they actually need is that any element in the sequence is <tt>swappable
! with</tt> any other element in the sequence.
  </p>
! 
! <p>
! At this point Howard joins the discussion and points out that the intent of introducing the
! two swap-related terms was to support <tt>vector&lt;bool&gt;::reference</tt> types, and we are
! reading something into the wording that was never intended.  Consuses is that regardless of
! the intent, that is what the words today say.
! </p>
! 
! <p>
! There is some support to see a paper reviewing the whole of clause 25 for this issue, and
! other select clauses as may be necessary.
! </p>
! 
! <p>
! There was some consideration to introducing a note into the front of clause 25 to indicate
! <tt>swappable</tt> requirements in the clause should be interpreted to allow such awkward
! types, but ultimately no real enthusiasm for introducing a <tt>swappable for clause 25</tt>
! requirement term, especially if it confusingly had the same name as a term used with a
! subtly different meaning through the rest of the standard.
! </p>
! 
! <p>
! There was no enthusiasm for the alternate resolution of requiring containers with unequal
! allocators that do not propagate provide a well-defined swap behavior, as it is not
! believed to be possible without giving <tt>swap</tt> linear complexity for such values,
! and even then would require adding the constraint that the container element types are
! CopyConstructible.
! </p>
! 
! <p>
! Final conclusion: move to open pending a paper from a party with a strong interest in
! stateful allocators.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2153"></a>2153. Narrowing of the non-member <tt>swap</tt> contract</h3>
! <p><b>Section:</b> 20.2.2 [utility.swap], 17.6.3.2 [swappable.requirements], 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Robert Shearer <b>Opened:</b> 2012-04-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Sub-clause 20.2.2 [utility.swap] defines a non-member 'swap' function with defined behavior for
! all <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt> types. It does not guarantee
! constant-time complexity or <tt>noexcept</tt> in general, however this definition does
! render all objects of <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt> type swappable
! (by the unary definition of sub-clause 17.6.3.2 [swappable.requirements]) in the absence of 
! specializations or overloads.
! <p/>
! The overload of the non-member <tt>swap</tt> function defined in Table 96, however,
! defines semantics incompatible with the generic non-member <tt>swap</tt> function,
! since it is defined to call a member <tt>swap</tt> function whose semantics are
! undefined for some values of <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt> types.
! <p/>
! The obvious (perhaps naive) interpretation of sub-clause 17.6.3.2 [swappable.requirements] is as a guide to
! the "right" semantics to provide for a non-member <tt>swap</tt> function (called in
! the context defined by 17.6.3.2 [swappable.requirements] p3) in order to provide interoperable
! user-defined types for generic programming. The standard container types don't follow these guidelines.
! <p/>
! More generally, the design in the standard represents a classic example of "contract narrowing". It 
! is entirely reasonable for the contract of a particular <tt>swap</tt> overload to provide <em>more</em> 
! guarantees, such as constant-time execution and <tt>noexcept</tt>, than are provided by the <tt>swap</tt> 
! that is provided for any <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt> types, but it is <em>not</em> 
! reasonable for such an overload to fail to live up to the guarantees it provides for general types when 
! it is applied to more specific types. Such an overload or specialization in generic programming is akin 
! to an override of an inherited virtual function in OO programming: violating a superclass contract in a
! subclass may be legal from the point of view of the language, but it is poor design and can easily lead 
! to errors. While we cannot prevent user code from providing overloads that violate the more general 
! <tt>swap</tt> contract, we can avoid doing so within the library itself.
! <p/>
! My proposed resolution is to draw a sharp distinction between member <tt>swap</tt> functions, which provide 
! optimal performance but idiosyncratic contracts, and non-member <tt>swap</tt> functions, which should always 
! fulfill at least the contract of 20.2.2 [utility.swap] and thus render objects swappable. The member 
! <tt>swap</tt> for containers with non-propagating allocators, for example, would offer constant-time
! guarantees and <tt>noexcept</tt> but would only offer defined behavior for values with allocators that compare 
! equal; non-member <tt>swap</tt> would test allocator equality and then dispatch to either member <tt>swap</tt> or 
! <tt>std::swap</tt> depending on the result, providing defined behavior for all values (and rendering the type
! "swappable"), but offering neither the constant-time nor the <tt>noexcept</tt> guarantees.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
! </p>
! <p>
! This topic deserves more attention than can be given in the telocon, and there is no proposed resolution.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2154"></a>2154. What exactly does compile-time complexity imply?</h3>
! <p><b>Section:</b> 26.5.1.3 [rand.req.urng] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> John Salmon <b>Opened:</b> 2012-04-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req.urng">issues</a> in [rand.req.urng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The expressions <tt>G::min()</tt> and <tt>G::max()</tt> in Table 116 in 26.5.1.3 [rand.req.urng] are specified 
! as having "compile-time" complexity.
! <p/>
! It is not clear what, exactly, this requirement implies.  If a URNG has a method:
! </p>
! <blockquote><pre>
! static int min();
! </pre></blockquote>
! <p>
! then is the method required to have a <tt>constexpr</tt> qualifier?  I believe the standard would benefit from 
! clarification of this point.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2155"></a>2155. Macro <tt>__bool_true_false_are_defined</tt> should be removed</h3>
! <p><b>Section:</b> 18.10 [support.runtime] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2012-04-30 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#support.runtime">active issues</a> in [support.runtime].</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.runtime">issues</a> in [support.runtime].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Since C99, the C standard describes a macro named  <tt>__bool_true_false_are_defined</tt>.
! <p/>
! In the process of harmonizing C++11 with C99, this name became part of the C++ standard.
! <p/>
! I propose that all mention of this name should be removed from the C and C++ standards.
! <p/>
! Here's the problem: The name was originally proposed as a transition tool, so that the headers for a 
! project could contain lines like the following.
! </p>
! <blockquote><pre>
! #if !defined(__bool_true_false_are_defined)
! #define bool int /* or whatever */
! #define true 1
! #define false 0
! #endif
! </pre></blockquote>
! <p>
! Then when the project was compiled by a "new" compiler that implemented <tt>bool</tt> as defined by the 
! evolving C++98 or C99 standards, those lines would be skipped; but when compiled by an "old" compiler that 
! didn't yet provide <tt>bool</tt>, <tt>true</tt>, and <tt>false</tt>, then the <tt>#define</tt>'s would provide a
! simulation that worked for most purposes.
! <p/>
! It turns out that there is an unfortunate ambiguity in the name.  One interpretation is as shown above, but 
! a different reading says "bool, true, and false are #define'd", i.e. that the meaning of the macro is to
! assert that these names are macros (not built-in) ... which is true in C, but not in C++.
! <p/>
! In C++11, the name appears in parentheses followed by a stray period, so
! some editorial change is needed in any event:
! <p/>
! 18.10 [support.runtime] para 1:
! </p>
! <blockquote><p>
! Headers <tt>&lt;csetjmp&gt;</tt> (nonlocal jumps), <tt>&lt;csignal&gt;</tt> (signal handling), <tt>&lt;cstdalign&gt;</tt> 
! (alignment), <tt>&lt;cstdarg&gt;</tt> (variable arguments), <tt>&lt;cstdbool&gt;</tt> (<tt>__bool_true_false_are_defined</tt>). 
! <tt>&lt;cstdlib&gt;</tt> (runtime environment <tt>getenv()</tt>, <tt>system()</tt>), and <tt>&lt;ctime&gt;</tt> 
! (system clock <tt>clock()</tt>, <tt>time()</tt>) provide further compatibility with C code.
! </p></blockquote>
! <p>
! However, para 2 says
! </p>
! <blockquote><p>
! "The contents of these headers are the same as the Standard C library headers <tt>&lt;setjmp.h&gt;</tt>, 
! <tt>&lt;signal.h&gt;</tt>, <tt>&lt;stdalign.h&gt;</tt>, <tt>&lt;stdarg.h&gt;</tt>, <tt>&lt;stdbool.h&gt;</tt>, 
! <tt>&lt;stdlib.h&gt;</tt>, and <tt>&lt;time.h&gt;</tt>, respectively, with the following 
! changes:",
! </p></blockquote>
! <p>
! and para 8 says 
! </p>
! <blockquote><p>
! "The header <tt>&lt;cstdbool&gt;</tt> and the header <tt>&lt;stdbool.h&gt;</tt> shall 
! not define macros named <tt>bool</tt>, <tt>true</tt>, or <tt>false</tt>."
! </p></blockquote>
! <p>
! Thus para 8 doesn't exempt the C++ implementation from the arguably clear requirement of the C standard, to 
! provide a macro named <tt>__bool_true_false_are_defined</tt> defined to be 1.
! <p/>
! Real implementations of the C++ library differ, so the user cannot count upon any consistency; furthermore, the 
! usefulness of the transition tool has faded long ago.
! <p/>
! That's why my suggestion is that both C and C++ standards should eliminate any mention of 
! <tt>__bool_true_false_are_defined</tt>.  In that case, the name belongs to implementers to provide, or not, as 
! they choose.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
! </p>
! <p>
! While not strictly necessary, the clean-up look good.
! </p>
! <p>
! We would like to hear from our C liaison before moving on this issue though.
! </p>
! 
! <p><i>[2015-05 Lenexa]</i></p>
! 
! <p>
! LWG agrees. Jonathan provides wording.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
  <li>
! <p>Edit the footnote on 17.6.1.2 [headers] p7:</p>
! <blockquote>
! <p>
! 176) In particular, including <ins>any of</ins> the standard header<ins>s <tt>&lt;stdbool.h&gt;</tt>, <tt>&lt;cstdbool&gt;</tt>,</ins> <tt>&lt;iso646.h&gt;</tt> or <tt>&lt;ciso646&gt;</tt> has no effect.
! </p>
! </blockquote>
  </li>
+ 
  <li>
! <p>Edit 18.10 [support.runtime] p1 as indicated (and remove the index entry for <tt>__bool_true_false_are_defined</tt>):</p>
! 
! <blockquote>
! <p>
! -1- Headers <tt>&lt;csetjmp&gt;</tt> (nonlocal jumps), <tt>&lt;csignal&gt;</tt> (signal handling), <tt>&lt;cstdalign&gt;</tt> (alignment), <tt>&lt;cstdarg&gt;</tt> (variable arguments), <tt>&lt;cstdbool&gt;</tt><ins>,</ins><del> (<tt>__bool_true_false_are_defined</tt>).</del> <tt>&lt;cstdlib&gt;</tt> (runtime environment <tt>getenv()</tt>, <tt>system()</tt>), and <tt>&lt;ctime&gt;</tt> (system clock <tt>clock()</tt>, <tt>time()</tt>) provide further compatibility with C code.
! </p>
! </blockquote>
  </li>
+ 
  <li>
! <p>Remove Table 38 &mdash; Header <tt>&lt;cstdbool&gt;</tt> synopsis [tab:support.hdr.cstdbool] from 18.10 [support.runtime] </p>
! <blockquote>
! <table border="1">
! <caption> Table 38 &mdash; Header <tt>&lt;cstdbool&gt;</tt> synopsis </caption>
! <tr><td><b>Type</b></td><td><b>Name(s)</b></td></tr>
! <tr><td><b>Macro:</b></td><td><tt>__bool_true_false_are_defined</tt></td></tr>
! </table>
! </blockquote>
  </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2156"></a>2156. Unordered containers' <tt>reserve(n)</tt> reserves for <tt>n-1</tt> elements</h3>
+ <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Daniel James <b>Opened:</b> 2012-05-07 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ I think that unordered containers' <tt>reserve</tt> doesn't quite do what it should. I'd expect after calling 
+ <tt>x.reserve(n)</tt> to be able to insert <tt>n</tt> elements without invalidating iterators. But as 
+ the standard is written (I'm looking at n3376), I think the guarantee only holds for <tt>n-1</tt> elements.
+ <p/>
+ For a container with <tt>max_load_factor</tt> of <tt>1</tt>, <tt>reserve(n)</tt> is equivalent to
+ <tt>rehash(ceil(n/1))</tt>, ie. <tt>rehash(n)</tt>. <tt>rehash(n)</tt> requires that the bucket
+ count is <tt>&gt;= n</tt>, so it can be <tt>n</tt> (Table 103). The rule is that <tt>insert</tt>
+ shall not affect the validity of iterators if <tt>(N + n) &lt; z * B</tt> (23.2.5 [unord.req] p15). 
+ But for this case the two sides of the equation are equal, so <tt>insert</tt> can affect the validity of iterators.
+ </p>
+ 
+ <p><i>[2013-03-16 Howard comments and provides wording]</i></p>
+ 
+ 
+ <p>
+ Given the following:
+ </p>
+ 
+ <blockquote><pre>
+ LF := load_factor()
+ MLF := max_load_factor()
+ S := size()
+ B := bucket_count()
+ 
+ LF == S/B
+ </pre></blockquote>
+ 
+ <p>
+ The container has an invariant:
+ </p>
+ 
+ <blockquote><pre>
+ LF &lt;= MLF
+ </pre></blockquote>
+ 
+ <p>
+ Therefore:
+ </p>
+ 
+ <blockquote><pre>
+ MLF &gt;= S/B
+ S &lt;= MLF * B
+ B &gt;= S/MLF
+ </pre></blockquote>
+ 
+ <p><i>[2013-03-15 Issues Teleconference]</i></p>
+ 
+ <p>
+ Moved to Open.
+ </p>
+ <p>
+ Howard to provide rationale and potentally revised wording.
+ </p>
+ 
+ 
+ <p><i>[2012-02-12 Issaquah : recategorize as P3]</i></p>
+ 
+ <p>
+ Jonathon Wakely: submitter is Boost.Hash maintainer. Think it's right.
+ </p>
+ 
+ <p>
+ Marshall Clow: even if wrong it's more right than what we have now
+ </p>
+ 
+ <p>
+ Geoffrey Romer: issue is saying rehash should not leave container in such a state that a notional insertion of zero elements should not trigger a rehash
+ </p>
+ 
+ <p>
+ AJM: e.g. if you do a range insert from an empty range
+ </p>
+ 
+ <p>
+ AJM: we don't have enough brainpower to do this now, so not priority zero
+ </p>
+ 
+ <p>
+ Recategorised as P3
+ </p>
+ 
+ <p><i>[Lenexa 2015-05-06: Move to Ready]</i></p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3485.</p>
+ 
+ <ol>
  <li>
! <p>
! In 23.2.5 [unord.req] Table 103 &mdash; Unordered associative container requirements, change the post-condition 
! in the row for <code>a.rehash(n)</code> to:
! </p>
! <blockquote>
! Post: <code>a.bucket_count() &gt;<ins>=</ins> a.size() / a.max_load_factor()</code> and <code>a.bucket_count() &gt;= n</code>.
! </blockquote>
  </li>
+ 
  <li>
! <p>
! In 23.2.5 [unord.req]/p15 change
! </p>
! <blockquote>
! The <code>insert</code> and <code>emplace</code> members shall not affect the validity of iterators if 
! <code>(N+n) &lt;<ins>=</ins> z * B</code>, where <code>N</code> is the number of elements in the container 
! prior to the insert operation, <code>n</code> is the number of elements inserted, <code>B</code> is the container's 
! bucket count, and <code>z</code> is the container's maximum load factor.
! </blockquote>
  </li>
+ 
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2157"></a>2157. How does <tt>std::array&lt;T,0&gt;</tt> initialization work when <tt>T</tt> is not default-constructible?</h3>
+ <p><b>Section:</b> 23.3.2.8 [array.zero] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Daryle Walker <b>Opened:</b> 2012-05-08 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#array.zero">issues</a> in [array.zero].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ Objects of <tt>std::array&lt;T,N&gt;</tt> are supposed to be initialized with aggregate initialization (when 
+ not the destination of a copy or move). This clearly works when <tt>N</tt> is positive. What happens when <tt>N</tt> 
+ is zero?  To continue using an (inner) set of braces for initialization, a <tt>std::array&lt;T,0&gt;</tt> implementation 
+ must have an array member of at least one element, and let default initialization take care of those secret elements.  
+ This cannot work when <tt>T</tt> has a set of constructors and the default constructor is deleted from that set.
+ Solution: Add a new paragraph in 23.3.2.8 [array.zero]:
+ </p>
+ <blockquote><p>
+ The unspecified internal structure of array for this case shall allow initializations like:
+ </p>
+ <blockquote><pre>
+ array&lt;T, 0&gt; a = { };
+ </pre></blockquote>
+ <p>
+ and said initializations must be valid even when <tt>T</tt> is not default-constructible.
+ </p></blockquote>
+ 
+ <p><i>[2012, Portland: Move to Open]</i></p>
+ 
+ <p>
+ Some discussion to understand the issue, which is that implementations currently have freedom to implement
+ an empty <tt>array</tt> by holding a dummy element, and so might not support value initialization, which is
+ surprising when trying to construct an empty container.  However, this is not mandated, it is an unspecified
+ implementation detail.
+ </p>
+ 
+ <p>
+ Jeffrey points out that the implication of 23.3.2.1 [array.overview] is that this initialization syntax
+ must be supported by empty <tt>array</tt> objects already.  This is a surprising inference that was not
+ obvious to the room, but consensus is that the reading is accurate, so the proposed resolution is not necessary,
+ although the increased clarity may be useful.
+ </p>
+ 
+ <p>
+ Further observation is that the same clause effectively implies that <tt>T</tt> must always be DefaultConstructible,
+ regardless of <tt>N</tt> for the same reasons - as an <i>initializer-list</i> may not supply enough values, and the
+ remaining elements must all be value initialized.
+ </p>
+ 
+ <p>
+ Concern that we are dancing angels on the head of pin, and that relying on such subtle implications in wording is
+ not helpful. We need a clarification of the text in this area, and await wording.
+ </p>
+ 
+ <p><i>[2015-02 Cologne]</i></p>
+ 
+ <p>
+ DK: What was the outcome of Portland? AM: Initially we thought we already had the intended behaviour. 
+ We concluded that <tt>T</tt> must always be <tt>DefaultConstructible</tt>, but I'm not sure why. GR: It's p2 in 
+ <tt>std::array</tt>, "up to <tt>N</tt>". AM: That wording already implies that "<tt>{}</tt>" has to work when <tt>N</tt> 
+ is zero. But the wording of p2 needs to be fixed to make clear that it does <em>not</em> imply that <tt>T</tt> must be 
+ <tt>DefaultConstructible</tt>.
+ <p/>
+ Conclusion: Update wording, revisit later. 
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3376.</p>
+ 
+ <p>Add the following new paragraph between the current 23.3.2.8 [array.zero] p1 and p2:</p>
+ 
+ <blockquote><p>
+ -1- <tt>array</tt> shall provide support for the special case <tt>N == 0</tt>.
+ <p/>
+ <ins>-?- The unspecified internal structure of <tt>array</tt> for this case shall allow initializations like:</ins>
+ </p>
+ <blockquote><pre>
+ <ins>array&lt;T, 0&gt; a = { };</ins>
+ </pre></blockquote>
+ <p>
+ <ins>and said initializations must be valid even when <tt>T</tt> is not default-constructible.</ins>
+ <p/>
+ -2- In the case that <tt>N == 0</tt>, <tt>begin() == end() ==</tt> unique value. The return value of 
+ <tt>data()</tt> is unspecified.
+ <p/>
+ -3- The effect of calling <tt>front()</tt> or <tt>back()</tt> for a zero-sized array is undefined.
+ <p/>
+ -4- Member function <tt>swap()</tt> shall have a <em>noexcept-specification</em> which is equivalent to 
+ <tt>noexcept(true)</tt>.
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2158"></a>2158. Conditional copy&#47;move in <tt>std::vector</tt></h3>
+ <p><b>Section:</b> 23.3.6.3 [vector.capacity] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Nikolay Ivchenkov <b>Opened:</b> 2012-05-08 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ There are various operations on <tt>std::vector</tt> that can cause elements of the vector to be 
+ moved from one location to another. A move operation can use either rvalue or const lvalue as 
+ argument; the choice depends on the value of <tt>!is_nothrow_move_constructible&lt;T&gt;::value &amp;&amp;
+ is_copy_constructible&lt;T&gt;::value</tt>, where <tt>T</tt> is the element type. Thus, some operations 
+ on <tt>std::vector</tt> (e.g. 'resize' with single parameter, 'reserve', 'emplace_back') should have 
+ conditional requirements. For example, let's consider the requirement for 'reserve' in N3376 &ndash; 
+ 23.3.6.3 [vector.capacity]&#47;2:
+ </p>
+ <blockquote><p>
+ <i>Requires</i>: <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt>.
+ </p></blockquote>
+ <p>
+ This requirement is not sufficient if an implementation is free to select copy constructor when 
+ <tt>!is_nothrow_move_constructible&lt;T&gt;::value &amp;&amp; is_copy_constructible&lt;T&gt;::value</tt> 
+ evaluates to true. Unfortunately, <tt>is_copy_constructible</tt> cannot reliably determine whether 
+ <tt>T</tt> is really copy-constructible. A class may contain public non-deleted copy constructor whose 
+ definition does not exist or cannot be instantiated successfully (e.g., 
+ <tt>std::vector&lt;std::unique_ptr&lt;int&gt;&gt;</tt> has copy constructor, but this type is not 
+ copy-constructible). Thus, the actual requirements should be:
+ </p>
+ <ul>
+ <li><p>
+ if <tt>!is_nothrow_move_constructible&lt;T&gt;::value &amp;&amp; is_copy_constructible&lt;T&gt;::value</tt> 
+ then <tt>T</tt> shall be <tt>CopyInsertable</tt> into <tt>*this</tt>;
+ </p></li>
+ <li><p>
+ otherwise <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt>.
+ </p></li>
  </ul>
! <p>
! Maybe it would be useful to introduce a new name for such conditional requirement (in addition to 
! "<tt>CopyInsertable</tt>" and "<tt>MoveInsertable</tt>").
! </p>
  
  
  
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2161"></a>2161. <tt>const</tt> equivalence of <tt>std::map</tt></h3>
! <p><b>Section:</b> 23.4 [associative], 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Bjarne Stroustrup <b>Opened:</b> 2012-06-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative">active issues</a> in [associative].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative">issues</a> in [associative].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! As described in the reflector discussion c++std-core-21860 consider the following example:
! </p>
! <blockquote><pre>
! map&lt;const int, int&gt; mci{};
! map&lt;int, int&gt; mi = mci; // ??
! mci[1] = 2;
! mi[1] = 2;
! </pre></blockquote>
! <p>
! Should it be required that the marked initialization is well-formed? As a possible solution
! this could be realized by an alias template:
! </p>
! <blockquote><pre>
! template &lt;class K, class T&gt;
! struct OriginalMap { [&hellip;] };
! 
! template &lt;class K, class T&gt;
! using ImprovedMap = OriginalMap&lt;const K, T&gt;;
! </pre></blockquote>
! 
  
  
  <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2164"></a>2164. What are the semantics of <tt>vector.emplace(vector.begin(), vector.back())</tt>?</h3>
! <p><b>Section:</b> 23.3.6.5 [vector.modifiers], 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2012-07-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.modifiers">active issues</a> in [vector.modifiers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! 
  <p>
! Nikolay Ivchenkov recently brought the following example on the
! <a href="https://groups.google.com/a/isocpp.org/d/topic/std-discussion/dhy23mDFXj4/discussion">std-discussion</a> 
! newsgroup, asking whether the following program well-defined:
  </p>
+ <blockquote><pre>
+ #include &lt;iostream&gt;
+ #include &lt;vector&gt;
  
! int main()
! {
!   std::vector&lt;int&gt; v;
!   v.reserve(4);
!   v = { 1, 2, 3 };
!   v.emplace(v.begin(), v.back());
!   for (int x : v)
!     std::cout &lt;&lt; x &lt;&lt; std::endl;
! }
! </pre></blockquote>
! <p>
! Nikolay Ivchenkov:
! <p/>
! I think that an implementation of <tt>vector</tt>'s 'emplace' should initialize an intermediate object with 
! <tt>v.back()</tt> before any shifts take place, then perform all necessary shifts and finally replace the 
! value pointed to by <tt>v.begin()</tt> with the value of the intermediate object. So, I would expect the 
! following output:
! </p>
! <blockquote><pre>
! 3
! 1
! 2
! 3
! </pre></blockquote>
! <p>
! GNU C++ 4.7.1 and GNU C++ 4.8.0 produce other results:
! </p>
! <blockquote><pre>
! 2
! 1
! 2
! 3
! </pre></blockquote>
! <p>
! Howard Hinnant:
! <p/>
! I believe Nikolay is correct that vector should initialize an intermediate object with <tt>v.back()</tt> 
! before any shifts take place. As Nikolay pointed out in another email, this appears to be the only way to 
! satisfy the strong exception guarantee when an exception is not thrown by <tt>T</tt>'s copy constructor, 
! move constructor, copy assignment operator, or move assignment operator as specified by 
! 23.3.6.5 [vector.modifiers]/p1. I.e. if the emplace construction throws, the vector must remain unaltered.
! <p/>
! That leads to an implementation that tolerates objects bound to the function parameter pack of the <tt>emplace</tt> 
! member function may be elements or sub-objects of elements of the container.
! <p/>
! My position is that the standard is correct as written, but needs a clarification in this area. Self-referencing 
! <tt>emplace</tt> should be legal and give the result Nikolay expects. The proposed resolution of LWG <a href="lwg-active.html#760">760</a> 
! is not correct.
! </p>
  
! <p><i>[2015-02 Cologne]</i></p>
  
! <p>
! LWG agrees with the analysis including the assessment of LWG <a href="lwg-active.html#760">760</a> and would appreciate a concrete wording proposal.
! </p>
! 
! <p><i>[2015-04-07 dyp comments]</i></p>
! 
! <p>
! The Standard currently does not require that creation of such
! intermediate objects is legal. 23.2.3 [sequence.reqmts] Table 100
! &mdash; "Sequence container requirements" currently specifies:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 100 &mdash; Sequence container requirements</caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
  </tr>
  
  <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
  </tr>
  
! <tr>
! <td>
! <tt>a.emplace(p, args);</tt>
! </td>
! <td>
! <tt>iterator</tt>
! </td>
! <td>
! <i>Requires</i>: <tt>T</tt> is <tt>EmplaceConstructible</tt> into
! <tt>X</tt> from <tt>args</tt>. For <tt>vector</tt> and <tt>deque</tt>,
! <tt>T</tt> is also <tt>MoveInsertable</tt> into <tt>X</tt> and
! <tt>MoveAssignable</tt>. [&hellip;]
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
  </blockquote>
  
  <p>
! The <tt>EmplaceConstructible</tt> concept is defined via
! <tt>allocator_traits&lt;A&gt;::construct</tt> in 23.2.1 [container.requirements.general] p15.5 That's surprising to me
! since the related concepts use the suffix <tt>Insertable</tt> if they
! refer to the allocator. An additional requirement such as
! <tt>std::is_constructible&lt;T, Args...&gt;</tt> is necessary to allow
! creation of intermediate objects.
  </p>
  
  <p>
! The creation of intermediate objects also affects other functions, such
! as <tt>vector.insert</tt>. Since aliasing the vector is only allowed for
! the single-element forms of <tt>insert</tt> and <tt>emplace</tt> (see
! <a href="lwg-closed.html#526">526</a>), the range-forms are not affected. Similarly,
! aliasing is not allowed for the rvalue-reference overload. See also LWG
! <a href="lwg-defects.html#2266">2266</a>.
  </p>
! 
! <p>
! There might be a problem with a requirement of
! <tt>std::is_constructible&lt;T, Args...&gt;</tt> related to the issues
! described in LWG <a href="lwg-active.html#2461">2461</a>. For example, a scoped allocator
! adapter passes additional arguments to the constructor of the value
! type. This is currently not done in recent implementations of libstdc++
! and libc++ when creating the intermediate objects, they simply create
! the intermediate object by perfectly forwarding the arguments. If such
! an intermediate object is then moved to its final destination in the
! vector, a change of the allocator instance might be required &mdash;
! potentially leading to an expensive copy. One can also imagine worse
! problems, such as run-time errors (allocators not comparing equal at
! run-time) or compile-time errors (if the value type cannot be created
! without the additional arguments). I have not looked in detail into this
! issue, but I'd be reluctant adding a requirement such as
! <tt>std::is_constructible&lt;T, Args...&gt;</tt> without further
! investigation.
! </p>
! 
! <p>
! It should be noted that the creation of intermediate objects currently
! is inconsistent in libstdc++ vs libc++. For example, libstdc++ creates
! an intermediate object for <tt>vector.insert</tt>, but not
! <tt>vector.emplace</tt>, whereas libc++ does the exact opposite in this
! respect.
! </p>
! 
! <p>
! A live demo of the inconsistent creation of intermediate objects can be
! found <a href="http://coliru.stacked-crooked.com/a/449253d3d329ef4c">here</a>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2165"></a>2165. <tt>std::atomic&lt;X&gt;</tt> requires <tt>X</tt> to be nothrow default constructible</h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic], 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#Core">Core</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-07-19 <b>Last modified:</b> 2015-04-09</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.generic">active issues</a> in [atomics.types.generic].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Core">Core</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! As raised in c++std-lib-32781, this fails to compile even though the default constructor is not used:
! </p>
! <blockquote><pre>
! #include &lt;atomic&gt;
! 
! struct X {
!   X() noexcept(false) {}
!   X(int) { }
! };
! 
! std::atomic&lt;X&gt; x(3);
! </pre></blockquote>
! <p>This is because <tt>atomic&lt;T&gt;</tt>'s default constructor is declared to be non-throwing and 
! is explicitly-defaulted on its first declaration:
! </p>
! <blockquote><pre>
! atomic() noexcept = default;
! </pre></blockquote>
! <p>
! This is ill-formed if the implicitly-declared default constructor would not be non-throwing.
! <p/>
! Possible solutions:
! </p>
! <ol>
  <li>
! Add nothrow default constructible to requirements for template argument of the generic <tt>atomic&lt;T&gt;</tt>
  </li>
  <li>
! Remove <tt>atomic&lt;T&gt;::atomic()</tt> from the overload set if <tt>T</tt> is not nothrow default constructible.
  </li>
  <li>
! Remove <tt>noexcept</tt> from <tt>atomic&lt;T&gt;::atomic()</tt>, allowing it to be
! deduced (but the default constructor is intended to be always noexcept)
  </li>
  <li>
! Do not default <tt>atomic&lt;T&gt;::atomic()</tt> on its first declaration (but makes the default constructor 
! user-provided and so prevents <tt>atomic&lt;T&gt;</tt> being trivial)
  </li>
  <li>
! A core change to allow the mismatched exception specification if the default constructor isn't used 
! (see c++std-core-21990)
  </li>
! </ol>
! 
! <p><i>[2012, Portland: move to Core]</i></p>
! 
! <p>
! Recommend referring to core to see if the constructor <tt>noexcept</tt> mismatch
! can be resolved there. The issue is not specific to concurrency.
! </p>
! 
! <p><i>[2015-04-09 Daniel comments]</i></p>
! 
! <p>
! CWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#1778">1778</a>, which had
! been created in behalf of this LWG issue, has been resolved as a defect.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2166"></a>2166. Heap property underspecified?</h3>
! <p><b>Section:</b> 25.4.6 [alg.heap.operations] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Peter Sommerlad <b>Opened:</b> 2012-07-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.heap.operations">issues</a> in [alg.heap.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Another similar issue to the <tt>operator&lt;</tt> vs greater in <tt>nth_element</tt> but not as direct occurs 
! in 25.4.6 [alg.heap.operations]:
! </p>
! <blockquote><p>
! -1- A <em>heap</em> is a particular organization of elements in a range between two random access iterators 
! <tt>[a,b)</tt>. Its two key properties are:
! </p>
! <ol>
! <li>There is no element greater than <tt>*a</tt> in the range and
! </li>
! <li><tt>*a</tt> may be removed by <tt>pop_heap()</tt>, or a new element added by <tt>push_heap()</tt>, in 
! O(log(<tt>N</tt>)) time.
  </li>
  </ol>
+ </blockquote>
+ <p>
+ As noted by Richard Smith, it seems that the first bullet should read:
+ </p>
+ <blockquote><p>
+ <tt>*a</tt> is not less than any element in the range
+ </p></blockquote>
+ <p>
+ Even better the heap condition could be stated here directly, instead of leaving it unspecified, i.e.,
+ </p>
+ <blockquote><p>
+ Each element at <tt>(a+2*i+1)</tt> and <tt>(a+2*i+2)</tt> is less than the element at <tt>(a+i)</tt>, 
+ if those elements exist, for <tt>i&gt;=0</tt>.
+ </p></blockquote>
+ <p>
+ But may be that was may be intentional to allow other heap organizations?
+ <p/>
+ See also follow-up discussion of c++std-lib-32780.
+ <p/>
  
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="2173"></a>2173. The meaning of operator + in the description of the algorithms</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Nikolay Ivchenkov <b>Opened:</b> 2012-08-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#algorithms">active issues</a> in [algorithms].</p>
! <p><b>View all other</b> <a href="lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! According to 25.1 [algorithms.general]/12,
! </p>
! <blockquote><p>
! In the description of the algorithms operators <tt>+</tt> and <tt>-</tt> are used for some of the iterator categories 
! for which they do not have to be defined. In these cases the semantics of <tt>a+n</tt> is the same as that of
  </p>
+ <blockquote><pre>
+ X tmp = a;
+ advance(tmp, n);
+ return tmp;
+ </pre></blockquote>
+ </blockquote>
  <p>
! There are several places where such operator <tt>+</tt> is applied to an output iterator &mdash; for example, see the 
! description of <tt>std::copy</tt>:
! </p>
! <blockquote><pre>
! template&lt;class InputIterator, class OutputIterator&gt;
! OutputIterator copy(InputIterator first, InputIterator last,
!                     OutputIterator result);
! </pre>
! <blockquote><p>
! -1- <i>Effects</i>: Copies elements in the range <tt>[first,last)</tt> into the range <tt>[result,result + (last -
! first))</tt> starting from <tt>first</tt> and proceeding to <tt>last</tt>. For each non-negative integer 
! <tt>n &lt; (last - first)</tt>, performs <tt>*(result + n) = *(first + n)</tt>.
! </p></blockquote></blockquote>
! <p>
! <tt>std::advance</tt> is not supposed to be applicable to output iterators, so we need a different method of description.
! <p/>
! See also message <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=32908">c++std-lib-32908</a>.
  </p>
  
! <p><i>[2014-06-07 Daniel comments and provides wording]</i></p>
  
  <p>
! The specification for output iterators is somewhat tricky, because here a sequence of increments is required to
! be combined with intervening <em>assignments</em> to the dereferenced iterator. I tried to respect this
! fact by using a conceptual assignment operation as part of the specification.
! <p/>
! Another problem in the provided as-if-code is the question which requirements are imposed on <tt>n</tt>. Unfortunately,
! the corresponding function <tt>advance</tt> is completely underspecified in this regard, so I couldn't borrow wording
! from it. We cannot even assume here that <tt>n</tt> is the difference type of the iterator, because for output iterators there is
! no requirements for this associated type to be defined. The presented wording attempts to minimize assumptions, but still
! can be considered as controversial. 
  </p>
  
  
  
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Change 25.1 [algorithms.general] around p12 as indicated:</p>
+ 
  <blockquote>
! <p>
! -12- In the description of the algorithms operators <tt>+</tt> and <tt>-</tt> are used for some of the iterator categories for which
! they do not have to be defined. In these cases the semantics of <tt>a+n</tt> is the same as that of
! </p>
! <blockquote>
! <pre>
! X tmp = a;
! advance(tmp, n);
! return tmp;
! </pre>
! </blockquote>
! <p>
! <ins>when <tt>X</tt> meets the input iterator requirements (24.2.3 [input.iterators]), otherwise it is the same as that of</ins>
! </p>
! <blockquote>
! <pre>
! <ins>X tmp = a;
! for (auto i = n; i; ++tmp, (void) --i) 
!   *tmp = <i>Expr</i>(i); 
! return tmp;</ins>
! </pre>
  </blockquote>
+ <p>
+ <ins>where <tt><i>Expr</i>(i)</tt> denotes the <tt>n-i</tt>-th expression that is assigned to for the corresponding algorithm;</ins> 
+ and that of <tt>b-a</tt> is the same as of
+ </p>
+ <blockquote>
+ <pre>
+ return distance(a, b);
+ </pre>
+ </blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2178"></a>2178. <tt>Allocator</tt> requirement changes not mentioned Annex C</h3>
+ <p><b>Section:</b> 17.6.3.5 [allocator.requirements], C.5 [diff.library] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Nevin Liber <b>Opened:</b> 2012-08-14 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ Given that a number of things were removed from the allocator requirements (<tt>reference</tt>, <tt>const_reference</tt>, 
+ <tt>address()</tt> in 17.6.3.5 [allocator.requirements]), it seems that these incompatible changes should be 
+ mentioned in Annex C.5 [diff.library], more specifically in [diff.cpp03].
+ </p>
+ 
+ <p><i>[
+ 2012-10 Portland: Move to Open 
+ ]</i></p>
+ 
+ 
+ <p>
+ It was clearly pointed out by Bill during the C++11 process that our change to allocator requirements
+ potentially broke 3rd party user containers written to expect C++03 allocators, or rather, an
+ allocator written to the minimal requirements of C++11 might not be guaranteed to work with a container
+ written to the previous rules.  This was a trade-off in making allocaters easier to write by use of
+ the <tt>allocator_traits</tt> framework.
+ </p>
+ 
+ <p>
+ This probably does merit a write-up in Annex C, and we look forward to seeing wording.  Until then,
+ the best we can do is move the issue to Open.
+ </p>
+ 
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="2179"></a>2179. <tt>enable_shared_from_this</tt> and construction from raw pointers</h3>
! <p><b>Section:</b> 20.8.2.5 [util.smartptr.enab], 20.8.2.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-08-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! On reflector message <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=32927">c++std-lib-32927</a>, 
! Matt Austern asked whether the following example should be well-defined or not
! </p>
! <blockquote><pre>
! struct X : public enable_shared_from_this&lt;X&gt; { };
! auto xraw = new X;
! shared_ptr&lt;X&gt; xp1(xraw);
! shared_ptr&lt;X&gt; xp2(xraw);
! </pre></blockquote>
! <p>
! pointing out that 20.8.2.2.1 [util.smartptr.shared.const] does not seem to allow it, since
! <tt>xp1</tt> and <tt>xp2</tt> aren't allowed to share ownership, because each of them is required to have 
! <tt>use_count() == 1</tt>. Despite this wording it might be reasonable (and technical possible)
! to implement that request.
! <p/>
! On the other hand, there is the non-normative note in 20.8.2.5 [util.smartptr.enab] p11 (already part of TR1):
! </p>
! <blockquote><p>
! The <tt>shared_ptr</tt> constructors that <span style="color:#C80000;font-weight:bold">create unique pointers</span> 
! can detect the presence of an <tt>enable_shared_from_this</tt> base and assign the newly created <tt>shared_ptr</tt> 
! to its <tt>__weak_this member</tt>.
! </p></blockquote>
! <p>
! Now according to the specification in 20.8.2.2.1 [util.smartptr.shared.const] p3-7:
! </p>
! <blockquote><pre>
! template&lt;class Y&gt; explicit shared_ptr(Y* p);
! </pre></blockquote>
! <p>
! the notion of <em>creating unique pointers</em> can be read to be included by this note, because the post-condition
! of this constructor is <tt>unique() == true</tt>. Evidence for this interpretation seems to be weak, though.
! <p/>
! Howard Hinnant presented the counter argument, that actually the following is an "anti-idiom" and it seems questionable 
! to teach it to be well-defined in any case:
! </p>
! <blockquote><pre>
! auto xraw = new X;
! shared_ptr&lt;X&gt; xp1(xraw);
! shared_ptr&lt;X&gt; xp2(xraw);
! </pre></blockquote>
! <p>
! He also pointed out that the current post-conditions of the affected <tt>shared_ptr</tt> constructor
! would need to be reworded.
! <p/>
! It needs to be decided, which direction to follow. If this idiom seems too much broken to be supported,
! the note could be improved. If it should be supported, the constructors in
! 20.8.2.2.1 [util.smartptr.shared.const] need a careful analysis to ensure that post-conditions
! are correct.
! <p/>
! Several library implementations currently do not support this example, instead they typically
! cause a crash. Matt points out that there are currently no explicit requirements imposed on
! <tt>shared_ptr</tt> objects to prevent them from owning the same underlying object without sharing the 
! ownership. It might be useful to add such a requirement.
  </p>
  
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
  
  <p>
! Moved to Open.
! </p>
! <p>
! More discussion is needed to pick a direction to guide a proposed resolution.
! </p>
! 
! <p><i>[2013-05-09 Jonathan comments]</i></p>
! 
! <p>
! The note says the newly created <tt>shared_ptr</tt> is assigned to the <tt>weak_ptr</tt> member. It doesn't 
! say before doing that the <tt>shared_ptr</tt> should check if the <tt>weak_ptr</tt> is non-empty and possibly 
! share ownership with some other pre-existing <tt>shared_ptr</tt>.
  </p>
  
  
+ 
  <p><b>Proposed resolution:</b></p>
  
  
*************** are already required not to throw.
*** 3856,3970 ****
  
  
  <hr>
! <h3><a name="1349"></a>1349. [FCD] <tt>swap</tt> should not throw</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-25</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-65</b></p>
  <p>
! Nothrowing <tt>swap</tt> operations are key to many C++ idioms,
! notably the common copy/swap idiom to provide the
! strong exception safety guarantee.
  </p>
  
! <p><i>[
! Resolution proposed by ballot comment
! ]</i></p>
  
  <p>
! Where possible, all library types should provide a
! <tt>swap</tt> operation with an exception specification
! guaranteeing no exception shall propagate.
! Where <tt>noexcept(true)</tt> cannot be guaranteed to
! not terminate the program, and the <tt>swap</tt> in
! questions is a template, an exception specification
! with the appropriate conditional expression could
! be specified.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1353"></a>1353. [FCD] Clarify the state of a <i>moved-from</i> object</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses CH-18</b></p>
  <p>
! The general approach on moving is that a library object
! after moving out is in a "valid but unspecified state". But
! this is stated at the single object specifications, which is
! error prone (especially if the move operations are implicit)
! and unnecessary duplication.
  </p>
  
! <p><i>[
! Resolution propsed by ballot comment
! ]</i></p>
  
  <p>
! Consider putting a general statement to the same
! effect into clause 17.
  </p>
  
- <p><i>[2010-11-05 Beman provides exact wording.
- The wording was inspired by Dave Abrahams'
- message c++std-lib-28958, and refined with help from Alisdair, Daniel, and Howard.
- ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
-     <p><i>Add a new definition to 17.3 Definitions [definitions]:</i></p>
-     
-     <blockquote>
-     <p>17.3.24 [defns.valid.unspecified]<br>
-     <b>valid but unspecified state</b><br>
-     an object state that is not specified except that the object's invariants are met, and operations 
-     on the object perform as specified, 
-     subject only to the operation's normal preconditions.</p>
-     <p>
-     [<i>Example:</i> If an object <tt>x</tt> of type <tt>std::vector&lt;int&gt;</tt> is in a valid but 
-     unspecified state, <tt>x.empty()</tt> can be called unconditionally, and
-     <tt>x.front()</tt> can be called provided <tt>x.empty()</tt> returns
-     <tt>false</tt>. <i>--end example</i>]</p>
-     </blockquote>
-     
-     <p><i>Change Table 34 - MoveConstructible requirements [moveconstructible] as 
-     indicated:</i></p>
-     <blockquote>
-     <p><del>[ <i>Note:</i> <tt>rv</tt> remains a valid object. Its state is 
-     unspecified&nbsp; <i>--end note</i> ]</del><br>
-     <ins><i>Postcondition:</i><tt> rv</tt> is in a valid but 
-     unspecified state ([defns.valid.unspecified]).</ins></p>
-     </blockquote>
-     
-     <p><i>Change Table 36 - MoveAssignable requirements [moveassignable] as 
-     indicated:</i></p>
-     <blockquote>
-     <p><del>[ <i>Note:</i> <tt>rv</tt> remains a valid object. Its state is 
-     unspecified&nbsp; <i>--end note</i> ]</del><br>
-     <ins><i>Postcondition:</i><tt> rv</tt> is in a valid but 
-     unspecified state ([defns.valid.unspecified]).</ins></p>
-     </blockquote>
-     
-     <p><i>No change in the half-dozen or so places in the standard library that 
-     use "valid but unspecified state" directly, and no change in the many places 
-     that require <tt>MoveCostructible</tt> or <tt>MoveAssignable</tt>, 
-     since <tt>MoveCostructible</tt> and <tt>MoveAssignable</tt> will now 
-     normatively require "valid but unspecified state".</i></p>
  
  
  
--- 13798,14346 ----
  
  
  <hr>
! <h3><a name="2181"></a>2181. Exceptions from <em>seed sequence</em> operations</h3>
! <p><b>Section:</b> 26.5.1.2 [rand.req.seedseq], 26.5.3 [rand.eng], 26.5.4 [rand.adapt] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-08-18 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req.seedseq">issues</a> in [rand.req.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! LWG issue <a href="lwg-defects.html#2180">2180</a> points out some deficiences in regard to the specification of the library-provided
! type <tt>std::seed_seq</tt> regarding exceptions, but there is another specification problem 
! in regard to general types satisfying the <em>seed sequence</em> constraints (named <tt>SSeq</tt>) as described in 
! 26.5.1.2 [rand.req.seedseq].
! <p/>
! 26.5.3 [rand.eng] p3 and 26.5.4.1 [rand.adapt.general] p3 say upfront:
  </p>
+ <blockquote><p>
+ Except where specified otherwise, no function described in this section 
+ 26.5.3 [rand.eng]/26.5.4 [rand.adapt] throws an exception.
+ </p></blockquote>
+ <p>
+ This constraint causes problems, because the described templates in these sub-clauses depend on operations of 
+ <tt>SSeq::generate()</tt> which is a function template, that depends both on operations provided by the 
+ implementor of <tt>SSeq</tt> (e.g. of <tt>std::seed_seq</tt>), and those of the random access iterator type 
+ provided by the caller. With class template <tt>linear_congruential_engine</tt> we have just one example for a user 
+ of <tt>SSeq::generate()</tt> via:
+ </p>
+ <blockquote><pre>
+ template&lt;class Sseq&gt; 
+ linear_congruential_engine&lt;&gt;::linear_congruential_engine(Sseq&amp; q);
  
! template&lt;class Sseq&gt; 
! void linear_congruential_engine&lt;&gt;::seed(Sseq&amp; q);
! </pre></blockquote>
! <p>
! None of these operations has an exclusion rule for exceptions.
! <p/>
! As described in <a href="lwg-defects.html#2180">2180</a> the wording for <tt>std::seed_seq</tt> should and can be fixed to ensure that 
! operations of <tt>seed_seq::generate()</tt> won't throw except from operations of the provided iterator range, 
! but there is no corresponding "safety belt" for user-provided <tt>SSeq</tt> types, since 26.5.1.2 [rand.req.seedseq]
! does not impose no-throw requirements onto operations of <em>seed sequences</em>.
! </p>
! 
! <ol style="list-style-type:upper-roman">
! 
! <li><p>
! A quite radical step to fix this problem would be to impose general no-throw requirements on the expression
! <tt>q.generate(rb,re)</tt> from Table 115, but this is not as simple as it looks initially, because this
! function again depends on general types that are mutable random access iterators. Typically, we do not
! impose no-throw requirements on iterator operations and this would restrict general seed sequences where
! exceptions are not a problem. Furthermore, we do not impose comparable constraints for other expressions,
! like that of the expression <tt>g()</tt> in Table 116 for good reasons, e.g. <tt>random_device::operator()</tt>
! explicitly states when it throws exceptions.
! </p></li>
! 
! <li><p>
! A less radical variant of the previous suggestion would be to add a normative requirement on the expression
! <tt>q.generate(rb,re)</tt> from Table 115 that says: "Throws nothing if operations of <tt>rb</tt> and <tt>re</tt> 
! do not throw exceptions". Nevertheless we typically do not describe <em>conditional</em> Throws elements in proper
! requirement sets elsewhere (Container requirements excluded, they just describe the containers from Clause 23)
! and this may exclude resonable implementations of seed sequences that could throw exceptions under rare
! situations. 
! </p></li>
! 
! <li><p>
! The iterator arguments provided to <tt>SSeq::generate()</tt> for operations in templates of 26.5.3 [rand.eng] and 
! 26.5.4 [rand.adapt] are under control of implementations, so we could impose stricter exceptions requirements
! on <tt>SSeq::generate()</tt> for <tt>SSeq</tt> types that are used to instantiate member templates in 26.5.3 [rand.eng] 
! and 26.5.4 [rand.adapt] solely.
! </p></li>
! 
! <li><p>
! We simply add extra wording to the introductive parts of 26.5.3 [rand.eng] and 26.5.4 [rand.adapt]
! that specify that operations of the engine (adaptor) templates that depend on a template parameter <tt>SSeq</tt>
! throw no exception unless <tt>SSeq::generate()</tt> throws an exception.
! </p></li>
! </ol>
  
  <p>
! Given these options I would suggest to apply the variant described in the fourth bullet.
! <p/>
! The proposed resolution attempts to reduce a lot of the redundancies of requirements in the introductory paragraphs of 
! 26.5.3 [rand.eng] and 26.5.4 [rand.adapt] by introducing a new intermediate sub-clause 
! "Engine and engine adaptor class templates" following sub-clause 26.5.2 [rand.synopsis]. This approach also
! solves the problem that currently 26.5.3 [rand.eng] also describes requirements that apply for
! 26.5.4 [rand.adapt] (Constrained templates involving the <tt>Sseq</tt> parameters).
  </p>
  
+ <p><i>[2013-04-20, Bristol]</i></p>
+ 
+ 
+ <p>
+ Remove the first bullet point:
+ </p>
+ <blockquote><p>
+ ?- Throughout this sub-clause general requirements and conventions are described that apply to every class 
+ template specified in sub-clause 26.5.3 [rand.eng] and 26.5.4 [rand.adapt]. Phrases of the form "in those 
+ sub-clauses" shall be interpreted as equivalent to "in sub-clauses 26.5.3 [rand.eng] and 26.5.4 [rand.adapt]". 
+ </p></blockquote>
+ <p>
+ Replace "in those sub-clauses" with "in sub-clauses 26.5.3 [rand.eng] and 26.5.4 [rand.adapt]".
+ <p/>
+ Find another place for the wording. 
+ <p/>
+ Daniel: These are requirements on the implementation not on the types. I'm not comfortable in moving it to another place 
+ without double checking. 
+ <p/>
+ Improve the text (there are 4 "for"s): <em>for</em> copy constructors, <em>for</em> copy assignment operators, 
+ <em>for</em> streaming operators, and <em>for</em> equality and inequality operators are not shown in the synopses. 
+ <p/>
+ Move the information of this paragraph to the paragraphs it refers to: 
+ </p>
+ <blockquote><p>
+ "-?- Descriptions are provided in those sub-clauses only for engine operations that are not described in 
+ 26.5.1.4 [rand.req.eng], for adaptor operations that are not described in 26.5.1.5 [rand.req.adapt], or for 
+ operations where there is additional semantic information. In particular, declarations for copy constructors, for 
+ copy assignment operators, for streaming operators, and for equality and inequality operators are not shown in the synopses." 
+ </p></blockquote>
+ <p>
+ Alisdair: I prefer duplication here than consolidation/reference to these paragraphs. 
+ <p/>
+ The room showed weakly favjust or for duplication. 
+ </p>
+ 
+ <p>
+ <strong>Previous resolution from Daniel [SUPERSEDED]:</strong>
+ </p>
+ <blockquote class="note">
+ <ol>
+ <li><p>Add a new sub-clause titled "Engine and engine adaptor class templates" following sub-clause 
+ 26.5.2 [rand.synopsis] (but at the same level) and add one further sub-clause "General" as
+ child of the new sub-clause as follows:
+ <p/>
+ <ins>Engine and engine adaptor class templates [rand.engadapt]</ins>
+ <p/>
+ <ins>General [rand.engadapt.general]</ins>
+ </p>
+ <blockquote><p>
+ <ins>-?- Throughout this sub-clause general requirements and conventions are described that apply to every class 
+ template specified in sub-clause 26.5.3 [rand.eng] and 26.5.4 [rand.adapt]. Phrases of the 
+ form "in those sub-clauses" shall be interpreted as equivalent to "in sub-clauses 26.5.3 [rand.eng] and 
+ 26.5.4 [rand.adapt]".
+ </ins>
+ <p/>
+ <ins>-?- Except where specified otherwise, the complexity of each function specified in those sub-clauses is constant.</ins>
+ <p/>
+ <ins>-?- Except where specified otherwise, no function described in those sub-clauses throws an exception.</ins>
+ <p/>
+ <ins>-?- Every function described in those sub-clauses that has a function parameter <tt>q</tt> of type
+ <tt>SSeq&amp;</tt> for a template type parameter named <tt>SSeq</tt> that is different from type <tt>std::seed_seq</tt> 
+ throws what and when the invocation of <tt>q.generate</tt> throws.</ins>
+ <p/>
+ <ins>-?- Descriptions are provided in those sub-clauses only for engine operations that are not described in 
+ 26.5.1.4 [rand.req.eng], for adaptor operations that are not described in 26.5.1.5 [rand.req.adapt],
+ or for operations where there is additional semantic information. In particular, declarations for copy constructors,
+ for copy assignment operators, for streaming operators, and for equality and inequality operators
+ are not shown in the synopses.</ins>
+ <p/>
+ <ins>-?- Each template specified in those sub-clauses requires one or more relationships, involving the value(s) of
+ its non-type template parameter(s), to hold. A program instantiating any of these templates is ill-formed if
+ any such required relationship fails to hold.</ins>
+ <p/>
+ <ins>-?- For every random number engine and for every random number engine adaptor <tt>X</tt> defined in those 
+ sub-clauses:</ins>
+ </p>
+ <ul>
+ <li><p>
+ <ins>if the constructor</ins>
+ </p>
+ <blockquote><pre>
+ <ins>template &lt;class Sseq&gt; explicit X(Sseq&amp; q);</ins>
+ </pre></blockquote>
+ <p>
+ <ins>is called with a type <tt>Sseq</tt> that does not qualify as a seed sequence, then this constructor shall not
+ participate in overload resolution;</ins>
+ </p>
+ </li>
+ 
+ <li><p>
+ <ins>if the member function</ins>
+ </p>
+ <blockquote><pre>
+ <ins>template &lt;class Sseq&gt; void seed(Sseq&amp; q);</ins>
+ </pre></blockquote>
+ <p>
+ <ins>is called with a type <tt>Sseq</tt> that does not qualify as a seed sequence, then this function shall not
+ participate in overload resolution;</ins>
+ </p>
+ </li>
+ </ul>
+ <p>
+ <ins>The extent to which an implementation determines that a type cannot be a seed sequence is unspecified,
+ except that as a minimum a type shall not qualify as a seed sequence if it is implicitly convertible to
+ <tt>X::result_type</tt>.</ins>
+ </p>
+ </blockquote>
+ 
+ </li>
+ 
+ <li><p>Edit the contents of sub-clause 26.5.3 [rand.eng] as indicated:</p>
+ 
+ <blockquote><p>
+ -1- Each type instantiated from a class template specified in this section 26.5.3 [rand.eng] satisfies the 
+ requirements of a random number engine (26.5.1.4 [rand.req.eng]) type <ins>and the general implementation 
+ requirements specified in sub-clause [rand.engadapt.general]</ins>.
+ <p/>
+ <del>-2- Except where specified otherwise, the complexity of each function specified in this section 26.5.3 [rand.eng] 
+ is constant.</del>
+ <p/>
+ <del>-3- Except where specified otherwise, no function described in this section 26.5.3 [rand.eng] throws an exception.</del>
+ <p/>
+ <del>-4- Descriptions are provided in this section 26.5.3 [rand.eng] only for engine operations that are not 
+ described in 26.5.1.4 [rand.req.eng] [&hellip;]</del>
+ <p/>
+ <del>-5- Each template specified in this section 26.5.3 [rand.eng] requires one or more relationships, 
+ involving the value(s) of its non-type template parameter(s), to hold. [&hellip;]</del>
+ <p/>
+ <del>-6- For every random number engine and for every random number engine adaptor <tt>X</tt> defined in this subclause
+ (26.5.3 [rand.eng]) and in sub-clause 26.5.3 [rand.eng]: [&hellip;]</del>
+ </p></blockquote>
+ 
+ </li>
+ 
+ <li><p>Edit the contents of sub-clause 26.5.4.1 [rand.adapt.general] as indicated:</p>
+ 
+ <blockquote><p>
+ -1- Each type instantiated from a class template specified in this section <del>26.5.3 [rand.eng]</del><ins>26.5.4 [rand.adapt]</ins> satisfies the 
+ requirements of a random number engine adaptor (26.5.1.5 [rand.req.adapt]) type <ins>and the general 
+ implementation requirements specified in sub-clause [rand.engadapt.general]</ins>.
+ <p/>
+ <del>-2- Except where specified otherwise, the complexity of each function specified in this section 26.5.4 [rand.adapt] 
+ is constant.</del>
+ <p/>
+ <del>-3- Except where specified otherwise, no function described in this section 26.5.4 [rand.adapt] throws an exception.</del>
+ <p/>
+ <del>-4- Descriptions are provided in this section 26.5.4 [rand.adapt] only for engine operations that are not 
+ described in 26.5.1.5 [rand.req.adapt] [&hellip;]</del>
+ <p/>
+ <del>-5- Each template specified in this section 26.5.4 [rand.adapt] requires one or more relationships, involving 
+ the value(s) of its non-type template parameter(s), to hold. [&hellip;]</del>
+ </p></blockquote>
+ 
+ </li>
+ 
+ </ol>
+ </blockquote>
+ 
+ <p><i>[2014-02-09, Daniel provides alternative resolution]</i></p>
+ 
+ 
+ <p><i>[Lenexa 2015-05-07: Move to Ready]</i></p>
+ 
+ <p>LWG 2181 exceptions from seed sequence operations</p>
+ <p>STL: Daniel explained that I was confused. I said, oh, seed_seq says it can throw if the RanIt throws. Daniel says the RanIts are provided by the engine. Therefore if you give a seed_seq to an engine, it cannot throw, as implied by the current normative text. So what Daniel has in the PR is correct, if slightly unnecessary. It's okay to have explicitly non-overlapping Standardese even if overlapping would be okay.</p>
+ <p>Marshall: And this is a case where the std:: on seed_seq is a good thing.</p>
+ <p>STL: Meh.</p>
+ <p>STL: And that was my only concern with this PR. I like the latest PR much better than the previous.</p>
+ <p>Marshall: Yes. There's a drive-by fix for referencing the wrong section. Other than that, the two are the same.</p>
+ <p>STL: Alisdair wanted the repetition instead of centralization, and I agree.</p>
+ <p>Marshall: Any other opinions?</p>
+ <p>Jonathan: I'll buy it.</p>
+ <p>STL: For a dollar?</p>
+ <p>Hwrd: I'll buy that for a nickel.</p>
+ <p>Marshall: Any objections to Ready? I don't see a point in Immediate.</p>
+ <p>Jonathan: Absolutely agree.</p>
+ <p>Marshall: 7 for ready, 0 opposed, 0 abstain.</p>
+ 
+ <p><i>[2014-05-22, Daniel syncs with recent WP]</i></p>
+ 
+ 
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Edit the contents of sub-clause 26.5.3 [rand.eng] as indicated:</p>
+ 
+ <blockquote><p>
+ -1- Each type instantiated from a class template specified in this section 26.5.3 [rand.eng] satisfies the 
+ requirements of a random number engine (26.5.1.4 [rand.req.eng]) type.
+ <p/>
+ -2- Except where specified otherwise, the complexity of each function specified in this section 26.5.3 [rand.eng] 
+ is constant.
+ <p/>
+ -3- Except where specified otherwise, no function described in this section 26.5.3 [rand.eng] throws an exception.
+ <p/>
+ <ins>-?- Every function described in this section 26.5.3 [rand.eng] that has a function parameter <tt>q</tt> of 
+ type <tt>Sseq&amp;</tt> for a template type parameter named <tt>Sseq</tt> that is different from type <tt>std::seed_seq</tt> 
+ throws what and when the invocation of <tt>q.generate</tt> throws.</ins>
+ <p/>
+ -4- Descriptions are provided in this section 26.5.3 [rand.eng] only for engine operations that are not 
+ described in 26.5.1.4 [rand.req.eng] or for operations where there is additional semantic information. In particular, 
+ declarations for copy constructors, <del>for</del> copy assignment operators, <del>for</del> streaming operators, <del>and 
+ for</del> equality <ins>operators,</ins> and inequality operators are not shown in the synopses.
+ <p/>
+ -5- Each template specified in this section 26.5.3 [rand.eng] requires one or more relationships, 
+ involving the value(s) of its non-type template parameter(s), to hold. A program instantiating any of these templates is 
+ ill-formed if any such required relationship fails to hold.
+ <p/>
+ -6- For every random number engine and for every random number engine adaptor <tt>X</tt> defined in this subclause
+ (26.5.3 [rand.eng]) and in sub-clause 26.5.4 [rand.adapt]: 
+ </p>
+ <ul>
+ <li><p>
+ if the constructor
+ </p>
+ <blockquote><pre>
+ template &lt;class Sseq&gt; explicit X(Sseq&amp; q);
+ </pre></blockquote>
+ <p>
+ is called with a type <tt>Sseq</tt> that does not qualify as a seed sequence, then this constructor shall not
+ participate in overload resolution;
+ </p>
+ </li>
+ <li><p>
+ if the member function
+ </p>
+ <blockquote><pre>
+ template &lt;class Sseq&gt; void seed(Sseq&amp; q);
+ </pre></blockquote>
+ <p>
+ is called with a type <tt>Sseq</tt> that does not qualify as a seed sequence, then this function shall not
+ participate in overload resolution;
+ </p>
+ </li>
+ </ul>
+ <p>
+ The extent to which an implementation determines that a type cannot be a seed sequence is unspecified,
+ except that as a minimum a type shall not qualify as a seed sequence if it is implicitly convertible to
+ <tt>X::result_type</tt>.
+ </p>
+ </blockquote>
+ </li>
+ 
+ <li><p>Edit the contents of sub-clause 26.5.4.1 [rand.adapt.general] as indicated:</p>
+ 
+ <blockquote><p>
+ -1- Each type instantiated from a class template specified in this section 
+ <del>26.5.3 [rand.eng]</del><ins>26.5.4 [rand.adapt]</ins> satisfies the requirements of a 
+ random number engine adaptor (26.5.1.5 [rand.req.adapt]) type.
+ <p/>
+ -2- Except where specified otherwise, the complexity of each function specified in this section 26.5.4 [rand.adapt] 
+ is constant.
+ <p/>
+ -3- Except where specified otherwise, no function described in this section 26.5.4 [rand.adapt] throws an exception.
+ <p/>
+ <ins>-?- Every function described in this section 26.5.4 [rand.adapt] that has a function parameter <tt>q</tt> of 
+ type <tt>Sseq&amp;</tt> for a template type parameter named <tt>Sseq</tt> that is different from type <tt>std::seed_seq</tt> 
+ throws what and when the invocation of <tt>q.generate</tt> throws.</ins>
+ <p/>
+ -4- Descriptions are provided in this section 26.5.4 [rand.adapt] only for adaptor operations that are not 
+ described in section 26.5.1.5 [rand.req.adapt] or for operations where there is additional semantic information. In particular, 
+ declarations for copy constructors, <del>for</del> copy assignment operators, <del>for</del> streaming operators, <del>and for</del> 
+ equality <ins>operators,</ins> and inequality operators are not shown in the synopses.
+ <p/>
+ -5- Each template specified in this section 26.5.4 [rand.adapt] requires one or more relationships, involving 
+ the value(s) of its non-type template parameter(s), to hold. A program instantiating any of these templates is ill-formed if
+ any such required relationship fails to hold.
+ </p></blockquote>
+ </li>
+ 
+ <li><p>Edit the contents of sub-clause 26.5.8.1 [rand.dist.general] p2 as indicated: [<i>Drafting note</i>: These
+ editorial changes are just for consistency with those applied to 26.5.3 [rand.eng] and 
+ 26.5.4.1 [rand.adapt.general] &mdash; <i>end drafting note</i>]</p>
+ 
+ <blockquote><p>
+ -2- Descriptions are provided in this section 26.5.8 [rand.dist] only for distribution operations that are not 
+ described in 26.5.1.6 [rand.req.dist] or for operations where there is additional semantic information. In particular, 
+ declarations for copy constructors, <del>for</del> copy assignment operators, <del>for</del> streaming operators, <del>and for</del> 
+ equality <ins>operators,</ins> and inequality operators are not shown in the synopses.
+ </p></blockquote>
+ </li>
+ 
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2183"></a>2183. Muddled allocator requirements for <tt>match_results</tt> constructors</h3>
! <p><b>Section:</b> 28.10.1 [re.results.const], 28.10.6 [re.results.all] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-08-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re.results.const">active issues</a> in [re.results.const].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results.const">issues</a> in [re.results.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! 28.10.1 [re.results.const] p1 says:
! </p>
! <blockquote><p>
! In all <tt>match_results</tt> constructors, a copy of the <tt>Allocator</tt> argument shall be used for any memory 
! allocation performed by the constructor or member functions during the lifetime of the object.
! </p></blockquote>
! <p>
! There are three constructors:
! </p>
! <blockquote><pre>
! match_results(const Allocator&amp; = Allocator());
! match_results(const match_results&amp; m);
! match_results(match_results&amp;&amp; m) noexcept;
! </pre></blockquote>
! <p>
! The second and third constructors do no have an <tt>Allocator</tt> argument, so despite the "all <tt>match_results</tt> 
! constructors", it is not possible to use "the <tt>Allocator</tt> argument" for the second and third constructors.
! <p/>
! The requirements for those two constructors also does not give any guidance. The second constructor has no language 
! about allocators, and the third states that the stored <tt>Allocator</tt> value is move constructed from 
! <tt>m.get_allocator()</tt>, but doesn't require using that allocator to allocate memory.
! <p/>
! The same basic problem recurs in 28.10.6 [re.results.all], which gives the required return value for 
! <tt>get_allocator()</tt>:
! </p>
! <blockquote><p>
! <i>Returns</i>: A copy of the <tt>Allocator</tt> that was passed to the object's constructor or, if that allocator 
! has been replaced, a copy of the most recent replacement.
! </p></blockquote>
! <p>
! Again, the second and third constructors do not take an <tt>Allocator</tt>, so there is nothing that meets this 
! requirement when those constructors are used.
  </p>
  
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2184"></a>2184. Muddled allocator requirements for <tt>match_results</tt> assignments</h3>
! <p><b>Section:</b> 28.10.1 [re.results.const], 28.10.6 [re.results.all] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-08-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re.results.const">active issues</a> in [re.results.const].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results.const">issues</a> in [re.results.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
  
  <p>
! The effects of the two assignment operators are specified in Table 141. Table 141 makes no mention of allocators, 
! so, presumably, they don't touch the target object's allocator. That's okay, but it leaves the question: 
! <tt>match_results::get_allocator()</tt> is supposed to return "A copy of the Allocator that was passed to the 
! object's constructor or, if that allocator has been replaced, a copy of the most recent replacement"; if assignment 
! doesn't replace the allocator, how can the allocator be replaced?
  </p>
  
  
  
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2189"></a>2189. Throwing <tt>swap</tt> breaks unordered containers' state</h3>
+ <p><b>Section:</b> 23.2.5.1 [unord.req.except] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2012-09-23 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ The hash functor and key-comparison functor of unordered containers are allowed to throw on <tt>swap</tt>.
+ </p>
+ <p>
+ 23.2.5.1 [unord.req.except]p3 "For unordered associative containers, no <tt>swap</tt> function throws
+ an exception unless that exception is thrown by the swap of the container's Hash or Pred object (if any)."
+ </p>
+ <p>
+ In such a case we must offer the basic exception safety guarantee, where both objects are left in valid
+ but unspecified states, and no resources are leaked.  This yields a corrupt, un-usable container if the
+ first <tt>swap</tt> succeeds, but the second fails by throwing, as the functors form a matched pair.
+ </p>
+ <p>
+ So our basic scenario is first, swap the allocators if the allocators propagate on swap, according to
+ <tt>allocator_traits</tt>.  Next we swap the pointers to our internal hash table data structures, so that
+ they match the allocators that allocated them.  (Typically, this operation cannot throw).  Now our containers
+ are back in a safely destructible state if an exception follows.
+ </p>
+ <p>
+ Next, let's say we swap the hash functor, and that throws.  We have a corrupt data structure, in that the
+ buckets are not correctly indexed by the correct functors, lookups will give unpredicatable results etc.
+ We can safely restore a usable state by forcibly clearing each container - which does not leak resources
+ and leaves us with two (empty but) usable containers.
+ </p>
+ <p>
+ Now let us assume that the hasher swap succeeds.  Next we swap the equality comparator functor, and this
+ too could throw. The important point to bear in mind is that these two functors form an important pairing
+ - two objects that compare equal by the equality functor must also hash to the same value.  If we swap
+ one without the other, we most likely leave the container in an unusable state, even if we clear out all
+ elements.
+ </p>
+ <p>
+ 1. A colleague pointed out that the solution for this is to dynamically allocate the two functors, and then
+ we need only swap pointers, which is not a throwing operation.  And if we don't want to allocate on default
+ construction (a common QoI request), we might consider moving to a dynamically allocated functors whenever
+ <tt>swap</tt> is called, or on first insertion.  Of course, allocating memory in <tt>swap</tt> is a whole
+ new can of worms, but this does not really sound like the design we had intended.
+ </p>
+ 
+ <p>
+ 2. The simplest option is to say that we do not support hasher or equality functors that throw on ADL
+ <tt>swap</tt>.  Note that the requirement is simply to not throw, rather than to be explicitly
+ marked as <tt>noexcept</tt>.  Throwing functors are allowed, so long as we never use values that
+ would actually manifest a throw when used in an unordered container.
+ </p>
+ 
+ <p>
+ Pablo went on to give me several more options, to be sure we have a full set to consider:
+ </p>
+ <p>
+ 3. Disallow one or the other functor from throwing.  In that case, the 
+ possibly-throwing functor must be swapped first, then the other functor, 
+ the allocator, and the data pointer(s) afterwards (in any order -- there 
+ was a TC that allocator assignment and swap may not throw if the 
+ corresponding propagation trait is true.). Of course, the question 
+ becomes: which functor is allowed to throw and which one is not?
+ </p>
+ <p>
+ 4. Require that any successful functor <tt>swap</tt> be reliably reversible.  
+ This is very inventive.  I know of no other place in the standard where 
+ such a requirement is stated, though I have occasionally wanted such a 
+ guarantee.
+ </p>
+ <p>
+ 5. Allow a failed swap to leave the containers in a state where future 
+ insertions may fail for reasons other than is currently allowed.  
+ Specifically, if the hash and equality functors are out of sync, all 
+ insertions will fail.  Presumably some "incompletely swapped" exception 
+ would be thrown.  This is "slightly" inventive, although people have been 
+ discussing "radioactive" states for a while.
+ </p>
+ 
+ <p><i>[2013-03-15 Issues Teleconference]</i></p>
+ 
+ <p>
+ Moved to Open.
+ </p>
+ 
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
*************** message c++std-lib-28958, and refined wi
*** 3972,4098 ****
  
  
  <hr>
! <h3><a name="1358"></a>1358. [FCD] Add <tt>&lt;chrono&gt;</tt> and <tt>&lt;ratio&gt;</tt> to
! freestanding implementations</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-55</b></p>
  <p>
! The <tt>&lt;thread&gt;</tt> header uses <tt>duration</tt> types, found in the
! <tt>&lt;chrono&gt;</tt> header, and which rely on the <tt>ratio</tt> types
! declared in the <tt>&lt;ratio&gt;</tt> header.
  </p>
  
! <p><i>[
! Extracts from lengthy Rapperswil discussion:
! ]</i></p>
  
  <p>
! There is a concern that this issue is a misunderstanding of the actual
! requirements of a free-standing implementation to support the <tt>&lt;thread&gt;</tt>
! header.  In general, a free-standanding implementation will provide an <em>empty</em>
! header, specifically so that a user can test for the absence of the 
! <tt>_ _ STDCPP_THREADS _ _</tt> macro.  This idiom as used as there is no portable way to test for the lack of a header.
  </p>
  <p>
! At this point, it was suggested the NB comment is trying to solve the wrong problem, and that <tt>_ _ STDCPP_THREADS _ _</tt> should be a pre-defined macro in clause 16 that can be tested before including <tt>&lt;thread&gt;</tt>.  That would remove the need to add additional headers to the free-standanding requirements.
  </p>
  <p>
! It is worth noting that Japan requested <tt>&lt;ratio&gt;</tt> as a free-standing header in their CD1 comments.  No-one seemed keen to require clocks of a free-standing implementation though.
  </p>
  
! <p>Detlef volunteers to look at a way to redraft 17.6.1.3 p3.</p> 
  
! <p><i>[
! Original resolution proposed by NB comment:
! ]</i></p>
  
  
- <blockquote>
  <p>
! Add the <tt>&lt;chrono&gt;</tt> and <tt>&lt;ratio&gt;</tt> headers to the
! freestanding requirements.
  </p>
  <p>
! It might be necessary to address scaled-down
! expectations of clock support in a freestanding
! environment, much like <tt>&lt;thread&gt;</tt>.
  </p>
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1364"></a>1364. [FCD] It is not clear how <tt>exception_ptr</tt> is synchronized</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses CH-19</b></p>
  <p>
! It is not clear how <tt>exception_ptr</tt> is synchronized.
  </p>
  
! <p><i>[
! Resolution proposed by ballot comment
! ]</i></p>
  
  <p>
! Make clear that accessing in different threads
! multiple <tt>exception_ptr</tt> objects that all refer to the
! same exception introduce a race.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1369"></a>1369. [FCD] <tt>rethrow_exception</tt> may introduce data races</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-74</b></p>
  <p>
! One idea for the <tt>exception_ptr</tt> type was that a reference-counted
! implementation could simply 'reactivate' the same
! exception object in the context of a call to
! <tt>rethrow_exception</tt>. Such an implementation would allow
! the same exception object to be active in multiple threads
! (such as when multiple threads join on a <tt>shared_future</tt>)
! and introduce potential data races in any exception
! handler that catches exceptions by reference - notably
! existing library code written before this capability was
! added. <tt>rethrow_exception</tt> should <em>always</em> make a copy
! of the target exception object.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following to 18.8.5, [propogation]
  </p>
! <blockquote><ins>
! <i>Throws</i>: a copy of the exception object to which <tt>p</tt> refers.
! </ins></blockquote>
  
  
  
--- 14348,14891 ----
  
  
  <hr>
! <h3><a name="2191"></a>2191. Incorrect specification of <tt>match_results(match_results&amp;&amp;)</tt></h3>
! <p><b>Section:</b> 28.10.1 [re.results.const] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-10-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re.results.const">active issues</a> in [re.results.const].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results.const">issues</a> in [re.results.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! 28.10.1 [re.results.const]/3: "Move-constructs an object of class <tt>match_results</tt> satisfying the same 
! postconditions as Table 141."
! </p>
! <p>
! Table 141 lists various member functions and says that their results should be the results of the corresponding member 
! function calls on <tt>m</tt>. But <tt>m</tt> has been moved from, so the actual requirement ought to be based on the 
! value that <tt>m</tt> had <em>before</em> the move construction, not on <tt>m</tt> itself.
! </p>
! <p>
! In addition to that, the requirements for the copy constructor should refer to Table 141.
! <p/>
! <u>Ganesh</u>:
! <p/>
! Also, the requirements for move-assignment should refer to Table 141. Further it seems as if in Table 141 all phrases of
! "for all integers <tt>n &lt; m.size()</tt>" should be replaced by "for all <em>unsigned</em> integers 
! <tt>n &lt; m.size()</tt>".
  </p>
  
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2192"></a>2192. Validity and return type of <tt>std::abs(0u)</tt> is unclear</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-10-02 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
  
  <p>
! In C++03 the following two programs are invalid:
  </p>
+ <ol style="list-style-type:upper-alpha"><li>
+ <blockquote><pre>
+ #include &lt;cmath&gt;
+ 
+ int main() {
+   std::abs(0u);
+ }
+ </pre></blockquote>
+ </li>
+ <li>
+ <blockquote><pre>
+ #include &lt;cstdlib&gt;
+ 
+ int main() {
+   std::abs(0u);
+ }
+ </pre></blockquote>
+ </li>
+ </ol>
  <p>
! because none of the <tt>std::abs()</tt> overloads is a best match.
  </p>
  <p>
! In C++11 the additional "sufficient overload" rule from 26.8 [c.math] p11 (see also LWG
! <a href="lwg-defects.html#2086">2086</a>) can be read to be applicable to the <tt>std::abs()</tt> overloads as well, which
! can lead to the following possible conclusions:
! <p/>
! <ol>
! <li><p>The program</p>
! <blockquote><pre>
! #include &lt;type_traits&gt;
! #include &lt;cmath&gt;
! 
! static_assert(std::is_same&lt;decltype(std::abs(0u)), double&gt;(), "Oops");
! 
! int main() {
!   std::abs(0u); // Calls std::abs(double)
! }
! </pre></blockquote>
! <p>
! is required to be well-formed, because of sub-bullet 2 ("[..] or an integer type [..]") of 
! 26.8 [c.math] p11 (Note that the current resolution of LWG <a href="lwg-defects.html#2086">2086</a> doesn't
! fix this problem).
! </p>
! </li>
! <li><p>Any translation unit including both <tt>&lt;cmath&gt;</tt> and <tt>&lt;cstdlib&gt;</tt>
! might be ill-formed because of two conflicting requirements for the return type of the overload
! <tt>std::abs(int)</tt>.
! </p>
! </li>
! </ol>
  </p>
  
! <p>
! It seems to me that at least the second outcome is not intended, personally I think that both
! are unfortunate: In contrast to all other floating-point functions explicitly listed in sub-clause 
! 26.8 [c.math], the <tt>abs</tt> overloads have a special and well-defined meaning for 
! signed integers and thus have explicit overloads returning a signed integral type. I also believe that 
! there is no problem accepting that <tt>std::fabs(0u)</tt> is well-defined with return type <tt>double</tt>, 
! because the leading 'f' clearly signals that we have a floating point function here. But the expected 
! return type of <tt>std::abs(0u)</tt> seems less than clear to me. A very reasonable answer could be that 
! this has the same type as its argument type, alternatively it could be a reasonably chosen signed 
! integer type, or a floating point type. It should also be noted, that the corresponding
! "generic type function" rule set from C99/C1x in 7.25 p2+3 is restricted to the floating-point functions
! from <tt>&lt;math.h&gt;</tt> and <tt>&lt;complex.h&gt;</tt>, so cannot be applied to the <tt>abs</tt>
! functions (but to the <tt>fabs</tt> functions!).
! <p/>
! Selecting a signed integer return type for unsigned input values can also problematic: The directly
! corresponding signed integer type would give half of the possible argument values an implementation-defined
! result value. Choosing the first signed integer value that can represent all positive values would solve this
! problem for <tt>unsigned int</tt>, but there would be no clear answer for the input type <tt>std::uintmax_t</tt>.
! </p>
! <p>
! Based on this it seems to me that the C++03 state in regard to unsigned integer values was the better
! situation, alerting the user that this code is ambigious at the moment (This might be change with different core-language
! rules as described in N3387).
! </p>
  
! <p><i>[2013-04-20, Bristol]</i></p>
  
  
  <p>
! Resolution: leave as new and bring it back in Chicago. 
  </p>
+ 
+ <p><i>[2013-09 Chicago]</i></p>
+ 
  <p>
! This issue also relates to LWG <a href="lwg-active.html#2294">2294</a>
! <p/> 
! STL: these two issues should be bundled 
! <p/>
! Stefanus: do what Pete says, and add overloads for unsigned to return directly 
! <p/>
! STL: agree Consensus that this is an issue 
! <p/>
! Walter: motion to move to Open 
! <p/>
! STL: no wording for <a href="lwg-active.html#2294">2294</a> 
! <p/>
! Stefanus: move to open and note the 2 issues are related and should be moved together 
! <p/>
! Stefanus: add and define unsigned versions of <tt>abs()</tt>
! </p>
! 
! <p><i>[2014-02-03 Howard comments]</i></p>
! 
! <p>
! Defining <tt>abs()</tt> for unsigned integers is a bad idea. Doing so would turn compile time errors into run time errors, 
! especially in C++ where we have templates, and the types involved are not always apparent to the programmer at design time.  
! For example, consider:
! </p>
! <blockquote><pre>
! template &lt;class Int&gt;
! Int
! analyze(Int x, Int y)
! {
!   // ...
!   if (std::abs(<span style="color:#C80000;font-weight:bolder">x - y</span>) &lt; threshold)
!   {
!     // ...
!   }
!   // ...
! }
! </pre></blockquote>
! <p>
! <tt>std::abs(<i>expr</i>)</tt> is often used to ask: Are these two numbers sufficiently close?  When the assumption is that 
! the two numbers are signed (either signed integral, or floating point), the logic is sound. But when the same logic is 
! accidentally used with an arithmetic type not capable of representing negative numbers, and especially if unsigned overflow 
! will silently happen, then the logic is no longer correct:
! </p>
! <blockquote><pre>
! auto i = analyze(20u, 21u);  // Today a compile time error
!     // But with <tt>abs(unsigned)</tt> becomes a run time error
! </pre></blockquote>
! <p>
! This is not idle speculation. Search the net for "<tt>abs unsigned</tt>" 
! <a href="http://www.avrfreaks.net/index.php?name=PNphpBB2&amp;file=printview&amp;t=35514&amp;start=0">here</a> or 
! <a href="http://fischerlaender.de/mysql/surprising-mysql-behaviour-using-unsigned-int">here</a>.
! <p/>
! In C++11, <tt>chrono</tt> <tt>duration</tt>s and <tt>time_point</tt>s are allowed to be based on unsigned integers. Taking the 
! absolute value of the difference of two such <tt>time_point</tt>s would be easy to accidentally do (say in code templated on 
! <tt>time_point</tt>s), and would certainly be a logic bug, caught at compile time unless we provide the error prone <tt>abs(unsigned)</tt>.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! GR: Do we want to make the changes to both <tt>&lt;cmath&gt;</tt> and <tt>&lt;cstdlib&gt;</tt>?<br/> 
! AM: I think so; we should provide consistent overloads.<br/> 
! GR: Then we're imposing restrictions on what users put in the global namespace.<br/> 
! AM: I'm not so worried about that. Users already know not to use C library names.<br/>
! VV: So what are we going to do about unsigned integers? AM: We will say that they are ill-formed.<br/>
! AM: Does anyone volunteer to send updated wording to Daniel? GR, can you do it? GR: Sure.<br/>
! GR: To clarify: we want to make unsigned types ill-formed?<br/> 
! AM: With promotion rank at least <tt>unsigned int</tt>.<br/>
! GR: And NL suggests to just list those types.
! <p/>
! Conclusion: Merge the resolution into a single issue. 
  </p>
+ 
+ <strong>Previous resolution from Daniel [SUPERSEDED]:</strong>
+ <blockquote class = "note">
+ <p>This wording is relative to N3376.</p>
+ 
+ <ol>
+ <li><p>Change 26.8 [c.math] p11 as indicated:</p>
+ <blockquote><p>
+ -11- Moreover<ins>, except for the <tt>abs</tt> functions</ins>, there shall be additional overloads sufficient to ensure:
+ <p/>
+ [&hellip;]
+ </p></blockquote>
+ </li>
+ </ol>
  </blockquote>
  
+ <p><i>[2015-03-03, Geoffrey Romer provides improved wording]</i></p>
+ 
+ <p>
+ In the following I've drafted combined wording to resolve LWG <a href="lwg-active.html#2192">2192</a> and <a href="lwg-active.html#2294">2294</a>. Note that the first 
+ two paragraphs are taken verbatim from the P/R of LWG <a href="lwg-active.html#2294">2294</a>, but the third is newly drafted:
+ </p>
+ 
+ <p><i>[2015-05-05 Lenexa: Howard to draft updated wording]</i></p>
+ 
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li><p>Insert the following new paragraphs after 26.8 [c.math] p7:</p>
+ <blockquote>
+ <p>
+ -6- In addition to the <tt>int</tt> versions of certain math functions in <tt>&lt;cstdlib&gt;</tt>, C++ adds <tt>long</tt> 
+ and <tt>long long</tt> overloaded versions of these functions, with the same semantics.
+ <p/>
+ -7- The added signatures are:
+ </p>
+ <blockquote>
+ <pre>
+ long abs(long); <i>// labs()</i>
+ long long abs(long long); <i>// llabs()</i>
+ ldiv_t div(long, long); <i>// ldiv()</i>
+ lldiv_t div(long long, long long); <i>// lldiv()</i>
+ </pre>
+ </blockquote>
+ <p>
+ <ins>-?- To avoid ambiguities, C++ also adds the following overloads of <tt>abs()</tt> to <tt>&lt;cstdlib&gt;</tt>, 
+ with the semantics defined in <tt>&lt;cmath&gt;</tt>:</ins>
+ </p>
+ <blockquote>
+ <pre>
+ <ins>float abs(float);
+ double abs(double);
+ long double abs(long double);</ins>
+ </pre>
+ </blockquote>
+ <p>
+ <ins>-?- To avoid ambiguities, C++ also adds the following overloads of <tt>abs()</tt> to <tt>&lt;cmath&gt;</tt>, 
+ with the semantics defined in <tt>&lt;cstdlib&gt;</tt>:</ins>
+ </p>
+ <blockquote>
+ <pre>
+ <ins>int abs(int);
+ long abs(long);
+ long long abs(long long);</ins>
+ </pre>
+ </blockquote>
+ <p>
+ <ins>-?- If <tt>abs()</tt> is called with an argument of unsigned integral type that cannot be converted to <tt>int</tt> 
+ by integral promotion (4.5 [conv.prom]), the program is ill-formed. [<i>Note</i>: arguments that can be promoted 
+ to <tt>int</tt> are permitted for compatibility with C. &mdash; <i>end note</i>]</ins>
+ </p>
+ </blockquote>
+ </li>
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2195"></a>2195. Missing constructors for <tt>match_results</tt></h3>
! <p><b>Section:</b> 28.10 [re.results] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-10-06 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results">issues</a> in [re.results].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! The requirement expressed in 28.10 [re.results] p2
! </p>
! <blockquote><p>
! The class template <tt>match_results</tt> shall satisfy the requirements of an allocator-aware container and of a
! sequence container, as specified in 23.2.3 [sequence.reqmts], except that only operations defined for 
! const-qualified sequence containers are supported.
! </p></blockquote>
! <p>
! can be read to require the existence of the described constructors from as well, but they do not exist in the
! synopsis. 
! <p/>
! The missing sequence constructors are: 
! </p>
! <blockquote><pre>
! match_results(initializer_list&lt;value_type&gt;);
! match_results(size_type, const value_type&amp;);
! template&lt;class InputIterator&gt; match_results(InputIterator, InputIterator);
! </pre></blockquote>
! <p>
! The missing allocator-aware container constructors are:
! </p>
! <blockquote><pre>
! match_results(const match_results&amp;, const Allocator&amp;);
! match_results(match_results&amp;&amp;, const Allocator&amp;);
! </pre></blockquote>
! <p>
! It should be clarified, whether (a) constructors are an exception of above mentioned operations or (b) whether
! at least some of them (like those accepting a <tt>match_results</tt> value and an allocator) should be added.
! <p/>
! As visible in several places of the standard (including the core language), constructors seem usually to be considered 
! as "operations" and they certainly can be invoked for const-qualified objects.
! <p/>
! The below given proposed resolution applies only the minimum necessary fix, i.e. it excludes constructors from
! above requirement. 
  </p>
  
! <p><i>[2013-04-20, Bristol]</i></p>
! 
  
  <p>
! Check current implementations to see what they do and, possibly, write a paper.   
  </p>
  
+ <p><i>[2013-09 Chicago]</i></p>
+ 
+ <p>
+ Ask Daniel to update the proposed wording to include the allocator copy and move constructors.
+ </p>
+ 
+ <p><i>[2014-01-18 Daniel changes proposed resolution]</i></p>
+ 
+ <p>
+ <strong>Previous resolution from Daniel [SUPERSEDED]:</strong>
+ </p>
+ 
+ <blockquote class="note">
+ <ol>
+ <li><p>Change 28.10 [re.results] p2 as indicated:</p>
+ <blockquote><p>
+ The class template <tt>match_results</tt> shall satisfy the requirements of an allocator-aware container and of a
+ sequence container, as specified in 23.2.3 [sequence.reqmts], except that only operations defined for 
+ const-qualified sequence containers <ins>that are not constructors</ins> are supported.
+ </p></blockquote>
+ </li>
+ </ol>
+ </blockquote>
+ 
+ <p><i>[2015-05-06 Lenexa]</i></p>
+ 
+ <p>MC passes important knowledge to EF.</p>
+ <p>VV, RP: Looks good.</p>
+ <p>TK: Second form should be conditionally noexcept</p>
+ <p>JY: Sequence constructors are not here, but mentioned in the issue writeup. Why?</p>
+ <p>TK: That would have been fixed by the superseded wording.</p>
+ <p>JW: How does this interact with Mike Spertus' allocator-aware regexes? [...] Perhaps it doesn't.</p>
+ <p>JW: Can't create match_results, want both old and new resolution.</p>
+ <p>JY: It's problematic that users can't create these, but not this issue.</p>
+ <p>VV: Why conditional noexcept?</p>
+ <p>MC: Allocator move might throw.</p>
+ <p>JW: Update superseded wording to "only non-constructor operations that are"?</p>
+ <p>MC: Only keep superseded, but append "and the means of constructing match_results are limited to [...]"?</p>
+ <p>JY: Bullet 4 paragraph 2 needs to address the allocator constructor.</p>
+ <p>Assigned to JW for drafting.</p>
+ 
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Change 28.10 [re.results] p4, class template <tt>match_results</tt> synopsis, as indicated:</p>
+ <blockquote><pre>
+ [&hellip;]
+ // 28.10.1, construct/copy/destroy:
+ explicit match_results(const Allocator&amp; a = Allocator());
+ match_results(const match_results&amp; m);
+ <ins>match_results(const match_results&amp; m, const Allocator&amp; a);</ins>
+ match_results(match_results&amp;&amp; m) noexcept;
+ <ins>match_results(match_results&amp;&amp; m, const Allocator&amp; a) noexcept;</ins>
+ [&hellip;]
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>Change 28.10.1 [re.results.const]  as indicated: [<i>Drafting note:</i> Paragraph 6 as currently written,
+ makes not much sense, because the <tt>noexcept</tt> does not allow any exception to propagate. Further-on, the allocator requirements
+ do not allow for throwing move constructors. Deleting it seems to be near to editorial &mdash; <i>end drafting note</i>]</p>
+ <blockquote>
+ 
+ <pre>
+ match_results(const match_results&amp; m);
+ <ins>match_results(const match_results&amp; m, const Allocator&amp; a);</ins>
+ </pre>
+ <blockquote>
+ <p>
+ -4- <i>Effects:</i> Constructs an object of class <tt>match_results</tt>, as a copy of <tt>m</tt>.
+ </p>
+ </blockquote>
+ 
+ <pre>
+ match_results(match_results&amp;&amp; m) noexcept;
+ <ins>match_results(match_results&amp;&amp; m, const Allocator&amp; a) noexcept;</ins>
+ </pre>
+ <blockquote>
+ <p>
+ -5- <i>Effects:</i> Move-constructs an object of class <tt>match_results</tt> from <tt>m</tt> satisfying the same postconditions
+ as Table 142. <del>Additionally</del><ins>For the first form</ins>, the stored <tt>Allocator</tt> value is move constructed 
+ from <tt>m.get_allocator()</tt>.
+ <p/>
+ <del>-6- <i>Throws:</i> Nothing if the allocator's move constructor throws nothing.</del>
+ </p>
+ </blockquote>
+ 
+ </blockquote>
+ </li>
+ </ol>
+ 
  
  
  
  
  
  <hr>
! <h3><a name="2198"></a>2198. <tt>max_load_factor(z)</tt> makes no strong guarantees, but bans useful behavior</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2012-10-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! The user cannot specify a <tt>max_load_factor</tt> for their unordered container
! at construction, it must be supplied after the event, when the container is
! potentially not empty.  The contract for this method is deliberately vague, not
! guaranteeing to use the value supplied by the user, and any value actually used
! will be used as a ceiling that the container will <i>attempt</i> to respect.
! </p>
! <p>
! The only guarantee we have is that, if user requests a <tt>max_load_factor</tt>
! that is less than the current <tt>load_factor</tt>, then the operation will take
! constant time, thus outlawing an implementation that chooses to rehash and so
! preserve as a class invariant that <tt>load_factor &lt; max_load_factor</tt>.
! </p>
! <p>
! Reasonable options conforming to the standard include ignoring the user's request
! if the requested value is too low, or deferring the rehash to the next <tt>insert</tt>
! operation and allowing the container to have a strange state (wrt <tt>max_load_factor</tt>)
! until then - and there is still the question of rehashing if the next <tt>insert</tt>
! is for a duplicate key in a unique container.
! </p>
! <p>
! Given the deliberate vagueness of the current wording, to support a range of reasonable
! (but not <i>perfect</i>) behaviors, it is not clear why the equally reasonable rehash
! to restore the constraint should be outlawed.  It is not thought that this is a performance
! critical operation, where users will be repeatedly setting low load factors on populated
! containers, in a tight or (less unlikely) an instant response scenario.
  </p>
  
+ <p><i>[2013-03-15 Issues Teleconference]</i></p>
+ 
+ <p>
+ Moved to Open.
+ </p>
+ <p>
+ Alisdair to provide wording.
+ </p>
+ 
+ 
  
  <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2199"></a>2199. unordered containers are required to have an initial max load factor of 1.0</h3>
+ <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2012-10-09 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
  <p>
! The default constructor, allocator-aware constructor, and range-based constructors
! for the unordered containers do not offer a means to control the initial
! <tt>max_load_factor</tt>, so the standard mandates the value 1.0.  This seems overly
! restrictive, as there is plenty of research suggesting a value between 0.5 and 1.0
! is more often optimal for unique-key containers, and perhaps a slightly higher
! value might be appropriate for multi-containers.
  </p>
! <p>
! Rather than guess at the appropriate <tt>max_load_factor</tt>, it seems reasonable
! that the standard should allow vendors to pick a value at their discretion, with
! perhaps a note of advice.  It is less clear whether the default value should be
! implementation-defined or unspecified, given the ease of a user determining this
! by querying this attribute immediately after construction.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
! </p>
! <p>
! Alisdair to provide wording.
! </p>
! <p>
! Marshall: It seems to me that what you really want is to be able to pass a max load factor in the
! constructor, but that's a different issue.
! </p>
! <p>
! Alisdair agrees in principle, but concerned with adding yet more constructors to these classes.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
  
  
  
*************** Add the following to 18.8.5, [propogatio
*** 4100,4150 ****
  
  
  <hr>
! <h3><a name="1371"></a>1371. [FCD] standard exceptions require stronger no-throw guarantees</h3>
! <p><b>Section:</b> 19 [diagnostics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">Tentatively NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively NAD">Tentatively NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-75</b></p>
  <p>
! None of the exception types defined in clause 19 are
! allowed to throw an exception on copy or move
! operations, but there is no clear specification that the
! operations have an exception specification to prove it.
! Note that the implicitly declared constructors, taking the
! exception specification from their base class (ultimately
! <tt>std::exception</tt>) will implicitly generate a <tt>noexcept</tt>
! exception specification if all of their data members
! similarly declare <tt>noexcept</tt> operations. As the
! representation is unspecified, we cannot assume nonthrowing
! operations unless we explicitly state this as a
! constraint on the implementation.
  </p>
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  <p>
! Add a global guarantee that all exception types
! defined in clause 19 that rely on implicitly declared
! operations have a non-throwing exception
! specification on those operations.
  </p>
  
! <p><i>[
! 2010 Batavia:
! ]</i></p>
  
  <p>
! This is addressed by the current words in 18.8.1 [exception], p2
  </p>
- <blockquote>
- Each standard library class <tt>T</tt> that derives from class <tt>exception</tt> 
- shall have a publicly accessible copy constructor and a publicly accessible copy
- assignment operator that do not exit with an exception.
- </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
--- 14893,14978 ----
  
  
  <hr>
! <h3><a name="2201"></a>2201. Missing macro entries from C standard library</h3>
! <p><b>Section:</b> C.5 [diff.library] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Kevin McCarty <b>Opened:</b> 2012-02-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#diff.library">issues</a> in [diff.library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! It seems that in C.5 [diff.library], Table 150 the following macros from 18.3.3 [c.limits], Table 31 
! are missing:
! </p>
! <blockquote><pre>
! LLONG_MIN 
! LLONG_MAX
! ULLONG_MAX
! </pre></blockquote>
! <p>
! In addition in C.5 [diff.library], Table 150 the following macros from 18.3.3 [c.limits], Table 32 
! are missing:
! </p>
! <blockquote><pre>
! DECIMAL_DIG 
! FLT_EVAL_METHOD
! </pre></blockquote>
! <p>
! Furtheron it seems that in C.5 [diff.library], Table 149/150 further macros are missing as well, e.g. 
! <tt>HUGE_VALF</tt>, <tt>INFINITY</tt>, etc.
  </p>
  
! <p><i>[2014-02 Issaquah:]</i></p>
  
  <p>
! This is an issue, all of C has not been updated for C99, C99 functions are missing, whole section needs to be overhauled.
! <p/>
! The issue needs to be updated for functions and other missing items and when that happens the issue title is wrong and
! needs to be adapted.
  </p>
  
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2202"></a>2202. Missing allocator support by <tt>async</tt></h3>
! <p><b>Section:</b> 30.6.8 [futures.async] <b>Status:</b> <a href="lwg-active.html#Deferred">Deferred</a>
!  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2012-10-19 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>Discussion:</b></p>
  
  <p>
! <tt>promise</tt>, <tt>packaged_task</tt>, and <tt>async</tt> are the only
! places where a shared state is actually supposed to be allocated. Accordingly,
! <tt>promise</tt> and <tt>packaged_task</tt> are "allocator-aware". But
! function template <tt>async</tt> provides no way to provide an allocator.
  </p>
  
+ <p><i>[2013-09 Chicago]</i></p>
+ 
+ <p>
+ Matt: deprecate async 
+ <p/>
+ Nico: read my paper 
+ <p/>
+ Alisdair: defer issues to wait for polymorphic allocators 
+ <p/>
+ Alisdair: defer, active topic of research Deferred 
+ </p>
+ 
+ <p><i>[2014-02-20 Re-open Deferred issues as Priority 4]</i></p>
+ 
+ 
+ <p><i>[2015-05 Lenexa, SG1 response]</i></p>
+ 
+ <p>
+ We want whatever status approximates: "will not fix; we're working on a replacement facility and don't want to add features to a broken one"
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** assignment operator that do not exit wit
*** 4154,4211 ****
  
  
  <hr>
! <h3><a name="1374"></a>1374. [FCD] Clarify moved-from objects are "toxic"</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-85</b></p>
  <p>
! 20.2.1 Table 34 "MoveConstructible requirements" says
! "Note: rv remains a valid object. Its state is unspecified".
! Some components give stronger guarantees. For
! example, moved-from <tt>shared_ptr</tt>s are guaranteed <tt>empty</tt>
! (20.9.11.2.1/25).
! In general, what the standard really should say (preferably
! as a global blanket statement) is that moved-from objects
! can be destroyed and can be the destination of an
! assignment. Anything else is radioactive. For example,
! containers can be "emptier than empty". This needs to be
! explicit and required generally.
  </p>
  <p>
! Note: The last time that one of us mentioned "emptier
! than empty" (i.e. containers missing sentinel nodes, etc.)
! the objection was that containers can store sentinel nodes
! inside themselves in order to avoid dynamically allocating
! them. This is unacceptable because
  </p>
  <p>
! (a) it forces existing implementations (i.e. Dinkumware's, Microsoft's,
! IBM's,  etc.) to change for no good reason (i.e. permitting more
! operations on moved-from objects), and 
  </p>
  <p>
! (b) it invalidates end-iterators when swapping containers. (The Working
! Paper currently permits end-iterator invalidation, which we
! consider to be wrong, but that's a separate argument. In
! any event, <em>mandating</em> end-iterator invalidation is very
! different from permitting it.)
  </p>
  
! <p><i>[
! Resolution proposed in ballot comment
! ]</i></p>
  
  <p>
! State as a general requirement that moved-from
! objects can be destroyed and can be the
! destination of an assignment. Any other use is
! undefined behavior.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
  
--- 14982,15057 ----
  
  
  <hr>
! <h3><a name="2206"></a>2206. Inaccuracy in <tt>initializer_list</tt> constructor requirements</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts], 23.2.4 [associative.reqmts], 23.2.5 [unord.req], 26.5.1.2 [rand.req.seedseq] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2012-10-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! In 23.2.3 [sequence.reqmts] p3, we have "<tt>il</tt> designates an object of type
! <tt>initializer_list&lt;value_type&gt;</tt>", and then several functions that take
! '<tt>il</tt>' as an argument. However, an expression like <tt>{1, 2, 'a'}</tt> is <em>not</em>
! an object of type <tt>initializer_list&lt;int&gt;</tt> unless it's used to initialize
! an explicitly-typed variable of that type. I believe we want:
  </p>
+ <blockquote><pre>
+ std::vector&lt;int&gt; v;
+ v = {1, 2, 'a'};
+ </pre></blockquote>
  <p>
! to compile portably, so we should say something different when defining '<tt>il</tt>'. The 
! same phrasing happens in 23.2.4 [associative.reqmts], 23.2.5 [unord.req], and 
! 26.5.1.2 [rand.req.seedseq].
! <p/>
! This may just be an editorial issue because the actual class synopses declare the functions 
! to take <tt>initializer_list&lt;exact_type&gt;</tt>.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
  </p>
  <p>
! This is definitely not NAD
  </p>
  <p>
! Should copy the suggested wording as the proposed resolution.
  </p>
  
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2208"></a>2208. <tt>std::reverse_iterator</tt> should be a literal type</h3>
! <p><b>Section:</b> 24.5.1 [reverse.iterators] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2012-10-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reverse.iterators">issues</a> in [reverse.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
  
  <p>
! <tt>std::reverse_iterator::reverse_iterator(Iterator)</tt> should be constexpr
! so that other constexpr functions can return <tt>reverse_iterator</tt>s. Of the
! other methods, the other constructors, <tt>base()</tt>, <tt>operator+</tt>, <tt>operator-</tt>,
! <tt>operator[]</tt>, and the non-member operators can probably also be
! <tt>constexpr</tt>.
! <p/>
! <tt>operator*</tt> cannot be constexpr because it involves an assignment to a
! member variable. Discussion starting with c++std-lib-33282 indicated
! that it would be useful to make reverse_iterator a literal type
! despite this restriction on its use at compile time.
  </p>
  
  
+ 
  <p><b>Proposed resolution:</b></p>
  
  
*************** undefined behavior.
*** 4213,4391 ****
  
  
  <hr>
! <h3><a name="1385"></a>1385. [FCD] <tt>tuple_cat</tt> should be a single variadic signature</h3>
! <p><b>Section:</b> 20.4.2.4 [tuple.creation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
- <p><b>Addresses GB-88</b></p>
  <p>
! The <tt>tuple_cat</tt> template consists of four overloads and that
! can concatenate only two <tt>tuple</tt>s. A single variadic
! signature that can concatenate an arbitrary number of
! <tt>tuple</tt>s would be preferred.
  </p>
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  
  <blockquote>
! Adopt a simplified form of the proposal in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2975.pdf">n2975</a>,
! restricted to <tt>tuple</tt>s and neither requiring nor outlawing support for other <tt>tuple</tt>-like types.
  </blockquote>
  
- <p><i>[
- 2010 Rapperswil: Alisdair to provide wording.
- ]</i></p>
  
  
- <p><i>[
- 2010-11-06: Daniel comments and proposes some alternative wording:
- ]</i></p>
  
  
  <p>
! There are some problems in the wording: First, even though the result type <tt>tuple&lt;<i>see below</i>&gt;</tt>
! implies it, the specification of the contained tuple element types is missing. Second, the term "<tt>tuple</tt> 
! protocol" is not defined anywhere and I see no reason why this normative wording should not be a non-normative
! note. We could at least give a better approximation, maybe "tuple-like protocol" as indicated from header
! <tt>&lt;utility&gt;</tt> synopsis. Further, it seems to me that the effects need to contain a combination of <tt>std::forward</tt>
! with the call of <tt>get</tt>. Finally I suggest to replace the requirements <tt>Move/CopyConstructible</tt>
! by proper usage of <tt>is_constructible</tt>, as indicated by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
  </p>
  
! <p><i>[
! 2010 Batavia
! ]</i></p>
  
  <p>
! Moved to Ready with Daniel's improved wording.
  </p>
  
  
! <p><b>Proposed resolution:</b></p>
! <p>Note: This alternate proposed resolution works only if <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a> has been accepted.</p>
  
  <p>
! </p><ol>
! <li>Change 20.4.1 [tuple.general] p. 2, header <tt>&lt;tuple&gt;</tt> synopsis, as indicated:
! <blockquote><pre>namespace std {
  
! ...
  
! // <i>20.4.2.4, tuple creation functions:</i>
! const unspecified ignore;
  
! template &lt;class... Types&gt;
!   tuple&lt;<i>VTypes</i>...&gt; make_tuple(Types&amp;&amp;...);
!   template &lt;class... Types&gt;
!   tuple&lt;<i>ATypes</i>...&gt; forward_as_tuple(Types&amp;&amp;...);
!   
! template&lt;class... Types&gt;
!   tuple&lt;Types&amp;...&gt; tie(Types&amp;...);
!   
! <del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp;, const tuple&lt;UTypes...&gt;&amp;);
! template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp;, const tuple&lt;UTypes...&gt;&amp;);
! template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp;, tuple&lt;UTypes...&gt;&amp;&amp;);
! template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp;, tuple&lt;UTypes...&gt;&amp;&amp;);</del>
! <ins>template &lt;class... Tuples&gt;
!   tuple&lt;<i>CTypes</i>...&gt; tuple_cat(Tuples&amp;&amp;...);</ins>
  
! ...
  
  </pre></blockquote>
  </li>
! <li>Change 20.4.2.4 [tuple.creation] as indicated:
! <blockquote>
! <pre><del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);</del></pre>
! <p></p><blockquote><del>
! 8 <i>Requires</i>: All the types in <tt>TTypes</tt> shall be <tt>CopyConstructible</tt> (Table 35). All the types in 
! <tt>UTypes</tt> shall be <tt>CopyConstructible</tt> (Table 35).
! </del></blockquote><p></p>
! <p></p><blockquote><del>
! 9 <i>Returns</i>: A <tt>tuple</tt> object constructed by copy constructing its first <tt>sizeof...(TTypes)</tt> elements 
! from the corresponding elements of <tt>t</tt> and copy constructing its last <tt>sizeof...(UTypes)</tt> elements from the 
! corresponding elements of <tt>u</tt>.
! </del></blockquote><p></p>
! <pre><del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);</del></pre>
! <p></p><blockquote><del>
! 10 <i>Requires</i>: All the types in <tt>TTypes</tt> shall be <tt>MoveConstructible</tt> (Table 34). All the types in 
! <tt>UTypes</tt> shall be <tt>CopyConstructible</tt> (Table 35).
! </del></blockquote><p></p>
! <p></p><blockquote><del>
! 11 <i>Returns</i>: A <tt>tuple</tt> object constructed by move constructing its first <tt>sizeof...(TTypes)</tt> elements 
! from the corresponding elements of <tt>t</tt> and copy constructing its last <tt>sizeof...(UTypes)</tt> elements from the 
! corresponding elements of <tt>u</tt>.
! </del></blockquote><p></p>
! <pre><del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp; t, tuple&lt;UTypes...&gt;&amp;&amp; u);</del></pre>
! <p></p><blockquote><del>
! 12 <i>Requires</i>: All the types in <tt>TTypes</tt> shall be <tt>CopyConstructible</tt> (Table 35). All the types in 
! <tt>UTypes</tt> shall be <tt>MoveConstructible</tt> (Table 34).
! </del></blockquote><p></p>
! <p></p><blockquote><del>
! 13 <i>Returns</i>: A <tt>tuple</tt> object constructed by copy constructing its first <tt>sizeof...(TTypes)</tt> elements 
! from the corresponding elements of <tt>t</tt> and move constructing its last <tt>sizeof...(UTypes)</tt> elements from the 
! corresponding elements of <tt>u</tt>.
! </del></blockquote><p></p>
! <pre><del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp; t, tuple&lt;UTypes...&gt;&amp;&amp; u);</del></pre>
! <p></p><blockquote><del>
! 14 <i>Requires</i>: All the types in <tt>TTypes</tt> shall be <tt>MoveConstructible</tt> (Table 34). All the types in 
! <tt>UTypes</tt> shall be <tt>MoveConstructible</tt> (Table 34).
! </del></blockquote><p></p>
! <p></p><blockquote><del>
! 15 <i>Returns</i>: A <tt>tuple</tt> object constructed by move constructing its first <tt>sizeof...(TTypes)</tt> elements 
! from the corresponding elements of <tt>t</tt> and move constructing its last <tt>sizeof...(UTypes)</tt> elements from the 
! corresponding elements of <tt>u</tt>.
! </del></blockquote><p></p>
! <pre><ins>template &lt;class... Tuples&gt;
!   tuple&lt;<i>CTypes</i>...&gt; tuple_cat(Tuples&amp;&amp;... tpls);
! </ins></pre>
! <p></p><blockquote><ins>
! 8 Let <tt>Ti</tt> be the <tt><i>i</i></tt><sup>th</sup> type in <tt>Tuples</tt>, <tt>Ui</tt> be <tt>remove_reference&lt;Ti&gt;::type</tt>,
! and <tt>tp<sub><i>i</i></sub></tt> be the <tt><i>i</i></tt><sup>th</sup> parameter in the function parameter pack <tt>tpls</tt>, where all 
! indexing is zero-based in the following paragraphs of this sub-clause [tuple.creation].
! </ins></blockquote><p></p>
! <p></p><blockquote><ins>
! 9 <i>Requires</i>: For all <tt><i>i</i></tt>, <tt>Ui</tt> shall be the type <i>cv<sub><tt>i</tt></sub>&nbsp;</i><tt>tuple&lt;Args<sub><i>i</i></sub>...&gt;</tt>, 
! where <i>cv<sub><tt>i</tt></sub></i> is the (possibly empty) <tt><i>i</i></tt><sup>th</sup> <i>cv</i>-qualifier-seq, and 
! <tt>Args<sub><i>i</i></sub></tt> is the parameter pack representing the element types in <tt>Ui</tt>. Let <tt>Aik</tt> be the 
! <tt><i>k<sub>i</sub></i></tt><sup>th</sup> type in <tt>Args<sub><i>i</i></sub></tt>, then for all <tt>Aik</tt> the following 
! requirements shall be satisfied: If <tt>Ti</tt> is deduced as an lvalue reference type, then 
! <tt>is_constructible&lt;Aik, <i>cv<sub>i</sub>&nbsp;</i>Aik&amp;&gt;::value == true</tt>, otherwise 
! <tt>is_constructible&lt;Aik, <i>cv<sub>i</sub>&nbsp;</i>Aik&amp;&amp;&gt;::value == true</tt>.
! </ins></blockquote><p></p>
! <p></p><blockquote><ins>
! 10 <i>Remarks</i>: The types in <tt><i>CTypes</i></tt> shall be equal to the ordered sequence of the expanded types
! <tt>Args<sub>0</sub>..., Args<sub>1</sub>..., Args<sub><i>n</i>-1</sub>...</tt>, where <tt><i>n</i></tt> equals 
! <tt>sizeof...(Tuples)</tt>. Let <tt><i>e<sub>i</sub></i>...</tt> be the <tt><i>i</i></tt><sup>th</sup> ordered 
! sequence of tuple elements of the result <tt>tuple</tt> object corresponding to the type sequence 
! <tt>Args<sub><i>i</i></sub></tt>.
! </ins></blockquote><p></p>
! <p></p><blockquote><ins>
! 11 <i>Returns</i>: A <tt>tuple</tt> object constructed by initializing
! the <tt><i>k<sub>i</sub></i></tt><sup>th</sup> type element <tt>eik</tt> in <tt><i>e<sub>i</sub></i>...</tt>
! with <tt>get&lt;<i>k<sub>i</sub></i>&gt;(std::forward&lt;Ti&gt;(tp<sub>i</sub>))</tt>
! for each valid <tt><i>k<sub>i</sub></i></tt> and each element group <tt><i>e<sub>i</sub></i></tt> in order. 
! </ins></blockquote><p></p>
! <p></p><blockquote><ins>
! 12 [<i>Note</i>: An implementation may support additional types in the parameter pack <tt>Tuples</tt>, such as
! <tt>pair</tt> and <tt>array</tt> that support the <tt>tuple</tt>-like protocol. -- <i>end note</i>]
! </ins></blockquote><p></p>
! </blockquote>
  </li>
  </ol>
- <p></p>
  
  
  
--- 15059,15515 ----
  
  
  <hr>
! <h3><a name="2214"></a>2214. Clarify <tt>basic_ios::init</tt> call restrictions</h3>
! <p><b>Section:</b> 27.5.5.2 [basic.ios.cons] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Andrey Semashev <b>Opened:</b> 2012-11-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.cons">issues</a> in [basic.ios.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! There is an ambiguity in how <tt>std::basic_ios::init</tt> method (27.5.5.2 [basic.ios.cons]) 
! can be used in the derived class. The Standard only specify the state of the <tt>basic_ios</tt> 
! object after the call completes. However, in <tt>basic_ios</tt> default constructor description 
! (27.5.5.2 [basic.ios.cons]) there is this sentence:
! </p>
! <blockquote><p>
! <i>Effects</i>: Constructs an object of class <tt>basic_ios</tt> (27.5.3.7 [ios.base.cons]) 
! leaving its member objects uninitialized. The object shall be initialized by calling <tt>basic_ios::init</tt> 
! before its first use or before it is destroyed, whichever comes first; otherwise the behavior is undefined.
! </p></blockquote>
! <p>
! This restriction hints that <tt>basic_ios::init</tt> should be called exactly
! once before the object can be used or destroyed, because <tt>basic_ios::init</tt> 
! may not know whether it was called before or not (i.e. whether its members are actually 
! uninitialized or are initialized by the previous call to <tt>basic_ios::init</tt>). There 
! is no such restriction in the <tt>basic_ios::init</tt> preconditions so it is not clear whether it is
! allowed to call <tt>basic_ios::init</tt> multiple times or not.
! <p/>
! This problem has already affected publicly available implementations.
! For example, Microsoft Visual C++ STL introduces a memory leak if
! <tt>basic_ios::init</tt> is called multiple times, while GCC 4.7 and STLPort
! reinitialize the <tt>basic_ios</tt> object correctly without memory leak or any
! other undesired effects. There was a discussion of this issue on Boost
! <a href="http://article.gmane.org/gmane.comp.lib.boost.devel/235659">developers mailing list</a>, 
! and there is a <a href="https://sourceforge.net/apps/trac/boost-log/ticket/2#comment:4">test case 
! that reproduces the problem</a>. The test case is actually a bug report for my Boost.Log library, 
! which attempts to cache <tt>basic_ostream</tt>-derived objects internally to avoid expensive construction 
! and destruction. My stream objects allowed resetting the stream buffer pointers the stream
! is attached to, without requiring to destroy and construct the stream.
! <p/>
! My personal view of the problem and proposed resolution follows.
! <p/>
! While apparently the intent of <tt>basic_ios::init</tt> is to provide a way to
! initialize <tt>basic_ios</tt> after default construction, I see no reason to
! forbid it from being called multiple times to reinitialize the stream.
! Furthermore, it is possible to implement a conforming <tt>basic_ios</tt> that
! does not have this restriction.
! <p/>
! The quoted above section of the Standard that describes the effects of
! the default constructor is misleading. The Standard does not mandate
! any data members of <tt>basic_ios</tt> or <tt>ios_base</tt> (27.5.3 [ios.base]), which
! it derives from. This means that the implementation is allowed to use
! non-POD data members with default constructors that initialize the
! members with particular default values. For example, in the case of
! Microsoft Visual C++ STL the leaked memory is an <tt>std::locale</tt> instance
! that is dynamically allocated during <tt>basic_ios::init</tt>, a raw pointer to
! which is stored within ios_base. It is possible to store e.g. an
! <tt>unique_ptr</tt> instead of a raw pointer as a member of <tt>ios_base</tt>, the smart
! pointer will default initialize the underlying raw pointer on default
! construction and automatically destroy the allocated object upon being
! reset or destroyed, which would eliminate the leak and allow
! <tt>basic_ios::init</tt> to be called multiple times. This leads to conclusion
! that the default constructor of <tt>basic_ios</tt> cannot leave "its member
! objects uninitialized" but instead performs default initialization of
! the member objects, which would mean the same thing in case of POD types.
! <p/>
! However, I feel that restricting <tt>ios_base</tt> and <tt>basic_ios</tt> members to
! non-POD types is not acceptable. Since multiple calls to <tt>basic_ios::init</tt> are 
! not forbidden by the Standard, I propose to correct the <tt>basic_ios</tt> default 
! constructor description so that it is allowed to destroy <tt>basic_ios</tt> object 
! without calling <tt>basic_ios::init</tt>. This would imply that any raw members of 
! <tt>basic_ios</tt> and <tt>ios_base</tt> should be initialized to values suitable for 
! destruction (essentially, this means only initializing raw pointers to NULL). The new 
! wording could look like this:
! </p>
! <blockquote><p>
! <i>Effects</i>: Constructs an object of class <tt>basic_ios</tt> (27.5.3.7 [ios.base.cons])
! initializing its member objects to unspecified state, only suitable for <tt>basic_ios</tt> destruction.
! The object shall be initialized by calling <tt>basic_ios::init</tt> before its first use; otherwise 
! the behavior is undefined.
! </p></blockquote>
! <p>
! This would remove the hint that <tt>basic_ios::init</tt> must be called exactly
! once. Also, this would remove the requirement for <tt>basic_ios::init</tt> to
! be called at all before the destruction. This is also an important issue because 
! the derived stream constructor may throw an exception before it manages to call 
! <tt>basic_ios::init</tt> (for example, if the streambuf constructor throws), and 
! in this case the <tt>basic_ios</tt> destructor has undefined behavior.
! <p/>
! To my mind, the described modification is sufficient to resolve the issue. But to 
! emphasize the possibility to call <tt>basic_ios::init</tt> multiple times, a remark 
! or a footnote for <tt>basic_ios::init</tt> postconditions could be added to explicitly 
! state the semantics of calling it multiple times. The note could read as follows:
  </p>
+ <blockquote><p>
+ The function can be called multiple times during the object lifetime. Each subsequent 
+ call reinitializes the object to the described in postconditions initial state.
+ </p></blockquote>
  
! <p><i>[2013-04-20, Bristol]</i></p>
  
  
+ <p>
+ Alisdair: The current wording is unclear but the proposed resolution is wrong
+ <p/>
+ Solution: Clarify that <tt>init</tt> must be called once and only once. Move then to review. 
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3485.</p>
+ 
+ <ol>
+ <li><p>Edit 27.5.5.2 [basic.ios.cons] as indicated:</p>
+ <blockquote><pre>
+ basic_ios();
+ </pre>
  <blockquote>
! <p>
! -2- <i>Effects</i>: Constructs an object of class <tt>basic_ios</tt> (27.5.3.7 [ios.base.cons]) 
! <del>leaving its member objects uninitialized</del><ins>initializing its member objects to unspecified state, 
! only suitable for <tt>basic_ios</tt> destruction</ins>. The object shall be initialized by calling 
! <tt>basic_ios::init</tt> before its first use <del>or before it is destroyed, whichever comes first</del>; 
! otherwise the behavior is undefined.
! </p>
! </blockquote>
! <pre>
! void init(basic_streambuf&lt;charT,traits&gt;* sb);
! </pre><blockquote>
! <p>
! <i>Postconditions</i>: The postconditions of this function are indicated in Table 128.
! <p/>
! <ins>-?- <i>Remarks</i>: The function can be called multiple times during the object lifetime. Each subsequent 
! call reinitializes the object to the described in postconditions initial state.</ins>
! </p>
! </blockquote>
  </blockquote>
+ </li>
+ </ol>
  
  
  
  
  
+ 
+ <hr>
+ <h3><a name="2215"></a>2215. (unordered) associative container functors should be <tt>CopyConstructible</tt></h3>
+ <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2012-11-14 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! The requirements on the functors used to arrange elements in the various associative and
! unordered containers are given by a set of expressions in tables 102 &mdash; Associative container
! requirements, and 103 &mdash; Unordered associative container requirements.  In keeping with Library
! convention these expressions make the minimal requirements necessary on their types.  For
! example, we have the following 3 row extracts for the unordered containers:
  </p>
+ <table>
+ <tr>
+   <td>
+     <b>Expression</b>
+   </td>
+   <td>
+     <b>Assertion/note pre-/post-condition</b>
+   </td>
+ </tr>
  
! <tr>
!   <td>
! <pre>
! <tt>X(n, hf, eq)</tt>
! <tt>X a(n, hf, eq)</tt>
! </pre>
!   </td>
!   <td>
!     <i>Requires:</i> <tt>hasher</tt> and <tt>key_equal</tt> are <tt>CopyConstructible</tt>.
!  </td>
! </tr>
! 
! <tr>
!   <td>
! <pre>
! <tt>X(n, hf)</tt>
! <tt>X a(n, hf)</tt>
! </pre>
!   </td>
!   <td>
!     <i>Requires:</i> <tt>hasher</tt> is <tt>CopyConstructible</tt> and 
!                   <tt>key_equal</tt> is <tt>DefaultConstructible</tt>.
!  </td>
! </tr>
! 
! <tr>
!   <td>
! <pre>
! <tt>X(n)</tt>
! <tt>X a(n)</tt>
! </pre>
!   </td>
!   <td>
!     <i>Requires:</i> <tt>hasher</tt> and <tt>key_equal</tt> are <tt>DefaultConstructible</tt>.
!  </td>
! </tr>
! </table>
  
  <p>
! However, the signature for each class template requires that the functors must effectively be
! <tt>CopyConstructible</tt> for each of these expressions:
  </p>
  
+ <blockquote><pre>
+ template &lt;class Key,
+           class T,
+           class Hash  = hash&lt;Key>,
+           class Pred  = std::equal_to&lt;Key>,
+           class Allocator = std::allocator&lt;std::pair&lt;const Key, T> > >
+ class unordered_map
+ {
+   <i>...</i>
  
!   <i>// construct/destroy/copy</i>
!   explicit unordered_map(size_type n = <i>see below</i>,
!                          const hasher&amp; hf = hasher(),
!                          const key_equal&amp; eql = key_equal(),
!                          const allocator_type&amp; a = allocator_type());
! 
!   <i>...</i>
! }
! </pre></blockquote>
  
  <p>
! The letter of the standard can be honored as long as implementors recognize
! their freedom to split this one signature into multiple overloads, so that
! the documented default arguments (requiring a <tt>CopyConstructible</tt> functor)
! are not actually passed as default arguments.
! </p>
! <p>
! As we look into the requirements for the copy constructor and copy-assignment
! operator, the requirements are even more vague, as the explicit requirements on
! the functors are not called out, other than saying that the functors are copied.
! </p>
! <p>
! Must the functors be <tt>CopyAssignable</tt>? Or is <tt>CopyConstructible</tt>
! sufficient in this case?  Do we require that the functors be <tt>Swappable</tt>
! so that the copy-swap idiom can be deployed here?  Note that a type that is both
! <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt> is still not guaranteed to
! be <tt>Swappable</tt> as the user may delete the <tt>swap</tt> function for their
! type in their own namespace, which would be found via ADL.
! </p>
! <p>
! Some clean-up of the requirements table looks necessary, to at least document the
! assignment behavior.  In addition, we should have clear guidance on whether these
! functors should always be <tt>CopyConstructible</tt>, as suggested by the class
! template definitions, or if the requirement tables are correct and we should
! explicitly split up the constructors in the (unordered) associative containers
! to no longer use default (function) arguments to obtain their defaulted functors.
! </p>
! <p>
! I recommend the simplest solution would be to always require that the functors
! for (unordered) associative containers be <tt>CopyConstructible</tt>, above the
! requirements tables themselves, so that the issue need not be addressed within
! the tables.  I suggest that the assignment operators for these containers add
! the requirement that the functors be <tt>Swappable</tt>, rather than forwarding
! the corresponding <tt>Assignable</tt> requirement.
! </p>
  
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
  
! <p>
! Moved to Open.
! </p>
! <p>
! Alisdair to propose wording.
! </p>
  
! <p><i>[2014-06-08, Daniel comments]</i></p>
  
! <p>
! The area of this issue partially overlaps what LWG <a href="lwg-active.html#2227">2227</a> addresses.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2216"></a>2216. <tt>regex_replace(basic_string)</tt> allocator handling</h3>
! <p><b>Section:</b> 28.11.4 [re.alg.replace] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2012-11-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.alg.replace">issues</a> in [re.alg.replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
  
+ <blockquote><pre>
+ template &lt;class traits, class charT, class ST, class SA&gt;
+   basic_string&lt;charT, ST, SA&gt;
+   regex_replace(const basic_string&lt;charT, ST, SA&gt;&amp; s,
+       const basic_regex&lt;charT, traits&gt;&amp; e,
+       const charT* fmt,
+       regex_constants::match_flag_type flags = 
+ 	    regex_constants::match_default);
  </pre></blockquote>
+ <p>
+ and friends are documented as
+ </p>
+ <blockquote><p>
+ Constructs an empty string result of type <tt>basic_string&lt;charT, ST, SA&gt;</tt>
+ and calls <tt>regex_replace(back_inserter(result), s.begin(), s.end(), e, fmt, flags)</tt>.
+ </p></blockquote>
+ <p>
+ This appears to require the result to have a default-constructed
+ allocator, which isn't even possible for all allocator types. I
+ suspect the allocator should be copied from 's' instead. Possibly
+ there should be an additional defaulted argument to override the
+ allocator of the result.
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2218"></a>2218. Unclear how containers use <tt>allocator_traits::construct()</tt></h3>
+ <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-11-27 <b>Last modified:</b> 2015-05-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ Firstly, 23.2.1 [container.requirements.general]/7 says a container's
+ allocator is used to obtain memory, but it isn't stated explicitly that the same 
+ allocator is used to construct and destroy elements, as opposed to a value-initialized 
+ allocator of the same type.
+ </p>
+ <p>
+ Secondly, 23.2.1 [container.requirements.general]/3 says elements "shall be
+ constructed using the <tt>allocator_traits&lt;allocator_type&gt;::construct</tt>
+ function and destroyed using the <tt>allocator_traits&lt;allocator_type&gt;::destroy</tt> function" and
+ 23.2.1 [container.requirements.general]/13 defines <tt>CopyInsertable</tt> etc. in
+ terms of an allocator <tt>A</tt> which is identical to the container's <tt>allocator_type</tt>.
+ </p>
+ <p>
+ The intent of making <tt>construct()</tt> and <tt>destroy()</tt> function templates was
+ that containers would be permitted to use <tt>allocator_traits&lt;A&gt;::construct()</tt> instead of
+ <tt>allocator_traits&lt;allocator_type&gt;::construct()</tt>, where <tt>A</tt> is
+ <tt>allocator_traits&lt;allocator_type&gt;::rebind_alloc&lt;U&gt;</tt> for some other type
+ <tt>U</tt>.  This allows node-based containers to store an allocator of the right type for 
+ allocating nodes and to use the same object to construct elements in aligned storage within 
+ those nodes, avoiding rebinding and copying the stored allocator every time an element needs
+ to be constructed.
+ <p/>
+ It should be made clear that a possibly-rebound copy of the container's allocator is used for object 
+ construction.
+ </p>
+ 
+ <p><i>[2013-03-15 Issues Teleconference]</i></p>
+ 
+ <p>
+ Moved to Open.
+ </p>
+ <p>
+ Jonathan: point 2 in the proposed resolution is definitely needed.
+ </p>
+ 
+ <p><i>[2014-11-28, Jonathan improves wording]</i></p>
+ 
+ <p>
+ In the first set of edits to paragraph 3 both pieces inserting "<tt>rebind_alloc&lt;U&gt;::</tt>"
+ should be replaced by "<tt>rebind_traits&lt;U&gt;::</tt>"
+ <p/>
+ Otherwise it implies using the allocator's functions directly, but they might not exist and 
+ it should be through the rebound traits type.
+ </p>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
+ <p>
+ STL: You want to permit but not require rebinding?<br/>
+ Wakely: The current wording forces me to use the original allocator, not the rebound one.<br/>
+ STL: Oh, I see. Yeah, we immediately rebind.<br/>
+ Wakely: The edits clarify that we don't use some other allocator. The third diff is because the definitions of 
+ EmplaceConstructible/etc. happen with the same types. The diff to the note is because it doesn't require the value 
+ of the allocator was the one passed in.<br/>
+ STL: After looking at this, I think I'm comfortable with the edits. The previous Standardese was nonsense so it's 
+ pretty easy to improve upon.<br/>
+ Marshall: Any other opinions?<br/>
+ Marshall: Any objections to moving it to Ready? Review? Ready in Kona?<br/>
+ Wakely: My preference would be Ready. We all know this is what we're doing anyways.<br/>
+ Nevin: The intent won't change.<br/>
+ STL: I think this is the right fix.<br/>
+ Hwrd: I third Ready. Even if Jonathan retracts his.<br/>
+ Marshall: Ready! 
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3485.</p>
+ 
+ <ol>
+ <li><p>Edit 23.2.1 [container.requirements.general] paragraph 3:</p>
+ <blockquote><p>
+ For the components affected by this subclause that declare an <tt>allocator_type</tt>, objects stored in these
+ components shall be constructed using the <tt>allocator_traits&lt;allocator_type&gt;::<ins>rebind_traits&lt;U&gt;::</ins>construct</tt> 
+ function and destroyed using the <tt>allocator_traits&lt;allocator_type&gt;::<ins>rebind_traits&lt;U&gt;::</ins>destroy</tt> 
+ function (20.7.8.2 [allocator.traits.members])<ins>, where <tt>U</tt> is either <tt>allocator_type::value_type</tt> 
+ or an internal type used by the container</ins>. These functions are called only for the container's element type, 
+ not for internal types used by the container. [ <i>Note</i>: This means, for example, that a node-based container 
+ might need to construct nodes containing aligned buffers and call construct to place the element into the buffer. 
+ &mdash; <i>end note</i> ]
+ </p></blockquote>
  </li>
! 
! <li><p>Edit 23.2.1 [container.requirements.general] paragraph 7:</p>
! <blockquote><p>
! [&hellip;] A copy of this allocator is used for any memory allocation <ins>and element construction</ins> performed, 
! by these constructors and by all member functions, during the lifetime of each container object or until the allocator 
! is replaced. [&hellip;]
! </p></blockquote>
! </li>
! 
! <li><p>Edit 23.2.1 [container.requirements.general] paragraph 13:</p>
! <blockquote><p>
! [&hellip;] Given <ins>an allocator type <tt>A</tt> and given</ins> a container type <tt>X</tt> having <del>an 
! <tt>allocator_type</tt> identical to <tt>A</tt> and</del> a <tt>value_type</tt> identical to <tt>T</tt> 
! <ins>and an <tt>allocator_type</tt> identical to <tt>allocator_traits&lt;A&gt;::rebind_alloc&lt;T&gt;</tt></ins> 
! and given an lvalue <tt>m</tt> of type <tt>A</tt>, a pointer <tt>p</tt> 
! of type <tt>T*</tt>, an expression <tt>v</tt> of type (possibly <tt>const</tt>) <tt>T</tt>, and an rvalue <tt>rv</tt> 
! of type <tt>T</tt>, the following terms are defined.
! <p/>
! [&hellip;]
! <p/>
! [ <i>Note</i>: A container calls <tt>allocator_traits&lt;A&gt;::construct(m, p, args)</tt> to construct an element 
! at <tt>p</tt> using <tt>args</tt><ins>, with <tt>m == get_allocator()</tt></ins>. The default <tt>construct</tt> in 
! <tt>std::allocator</tt> will call <tt>::new((void*)p) T(args)</tt>, but specialized allocators may choose a 
! different definition. &mdash; <i>end note</i> ]
! </p></blockquote>
  </li>
+ 
  </ol>
  
  
  
*************** for each valid <tt><i>k<sub>i</sub></i><
*** 4393,4975 ****
  
  
  <hr>
! <h3><a name="1396"></a>1396. [FCD] <tt>regex</tt> should support allocators</h3>
! <p><b>Section:</b> 28.8 [re.regex] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-07</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.regex">issues</a> in [re.regex].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1451">1451</a></p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-104, US-141</b></p>
  <p>
! <tt>std::basic_regex</tt> should have an allocator for all the
! reasons that a <tt>std::string</tt> does. For example, I can use
! <tt>boost::interprocess</tt> to put a <tt>string</tt> or <tt>vector</tt>
! in shared memory, but not a <tt>regex</tt>.
  </p>
  
! <p><i>[
! Resolution proposed by ballot comment
! ]</i></p>
  
  <p>
! Add allocators to regexes
  </p>
  
! <p><i>[
! 2010-10-24 Daniel adds:
! ]</i></p>
  
  
! <blockquote>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3171.pdf">n3171</a> would solve this issue.
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3171.pdf">n3171</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1401"></a>1401. [FCD] <tt>unique_ptr&lt;T&gt; == nullptr</tt></h3>
! <p><b>Section:</b> 20.9 [memory] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#memory">issues</a> in [memory].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-99</b></p>
  <p>
! One reason that the <tt>unique_ptr</tt> constructor taking a
! <tt>nullptr_t</tt> argument is not <tt>explicit</tt> is to allow conversion
! of <tt>nullptr</tt> to <tt>unique_ptr</tt> in contexts like equality
! comparison. Unfortunately <tt>operator==</tt> for <tt>unique_ptr</tt> is a
! little more clever than that, deducing template parameters for both
! arguments. This means that <tt>nullptr</tt> does not get deduced
! as <tt>unique_ptr</tt> type, and there are no other comparison
! functions to match.
  </p>
  
- <p><i>[
- Resolution proposed by ballot comment:
- ]</i></p>
  
! <blockquote>
! Add the following signatures to 20.9 [memory] p.1, <tt>&lt;memory&gt;</tt>
! header synopsis:
! <blockquote><pre>template&lt;typename T, typename D&gt;
! bool operator==(const unique_ptr&lt;T, D&gt; &amp; lhs, nullptr_t);
! template&lt;typename T, typename D&gt;
! bool operator==(nullptr_t, const unique_ptr&lt;T, D&gt; &amp; rhs);
! template&lt;typename T, typename D&gt;
! bool operator!=(const unique_ptr&lt;T, D&gt; &amp; lhs, nullptr_t);
! template&lt;typename T, typename D&gt;
! bool operator!=(nullptr_t, const unique_ptr&lt;T, D&gt; &amp; rhs);
  </pre></blockquote>
  </blockquote>
  
! <p><i>[
! 2010-11-02 Daniel comments and provides a proposed resolution:
! ]</i></p>
  
  
  <blockquote>
! The same problem applies to <tt>shared_ptr</tt> as well: In both cases there are no
! conversions considered because the comparison functions are templates. I agree with
! the direction of the proposed resolution, but I believe it would be very surprising
! and inconsistent, if given a smart pointer object <tt>p</tt>, the expression
! <tt>p == nullptr</tt> would be provided, but not <tt>p &lt; nullptr</tt> and the
! other relational operators. According to 5.9 [expr.rel] they are defined
! if null pointer values meet other pointer values, even though the result is unspecified
! for all except some trivial ones. But null pointer values are nothing special here: 
! The Library already defines the relational operators for both <tt>unique_ptr</tt> and 
! <tt>shared_ptr</tt> and the outcome of comparing non-null pointer values will be equally 
! unspecified. If the idea of supporting <tt>nullptr_t</tt> arguments for relational
! operators is not what the committee prefers, I suggest at least to consider to remove 
! the existing relational operators for both <tt>unique_ptr</tt> and <tt>shared_ptr</tt>
! for consistency. But that would not be my preferred resolution of this issue.
  <p>
! The number of overloads triple the current number, but I think it is much clearer to 
! provide them explicitly instead of adding wording that attempts to say that "sufficient overloads" are
! provided. The following proposal makes the declarations explicit.
! </p><p>
! Additionally, the proposal adds the missing declarations for some <tt>shared_ptr</tt>
! comparison functions for consistency.
! </p></blockquote>
  
! <p><i>[
! 2010-11-03 Daniel adds:
! ]</i></p>
  
  
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1297">1297</a> is remotely related. The following proposed resolution splits
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1401_extra_bullet">this bullet</a> into sub-bullets A and B. Sub-bullet A would 
! also solve <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1297">1297</a>, but sub-bullet B would not.
! </p><p>
! A further remark in regard to the proposed semantics of the ordering of <tt>nullptr</tt>
! against other pointer(-like) values: One might think that the following definition might
! be superior because of simplicity:
  
- </p><blockquote><pre>template&lt;class T&gt;
- bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t);
- template&lt;class T&gt;
- bool operator&gt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a);
- </pre><blockquote>
- <i>Returns</i>: <tt>false</tt>.
- </blockquote></blockquote>
  
! The underlying idea behind this approach is the assumption that nullptr corresponds
! to the least ordinal pointer value. But this assertion does not hold for all supported
! architectures, therefore this approach was not followed because it would lead to
! the inconsistency, that the following assertion could fire: 
! <p></p>
! <blockquote><pre>shared_ptr&lt;int&gt; p(new int);
! shared_ptr&lt;int&gt; null;
! bool v1 = p &lt; nullptr;
! bool v2 = p &lt; null;
! assert(v1 == v2);
  </pre></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! Wording changes are against N3126.
  <p>
! </p><ol>
! <li>Change 20.9 [memory] p. 1, header <tt>&lt;memory&gt;</tt> synopsis as indicated.
! <tt>noexcept</tt> specifications are only added, where the guarantee exists, that the function
! shall no throw an exception (as replacement of "<i>Throws</i>: Nothing". This needs 
! to be harmonized with the result of the <tt>noexcept</tt> proposals:
! <blockquote><pre>namespace std {
!   [..]
!   // <i>20.9.10 Class unique_ptr:</i>
!   template &lt;class T&gt; class default_delete;
!   template &lt;class T&gt; class default_delete&lt;T[]&gt;;
!   template &lt;class T, class D = default_delete&lt;T&gt;&gt; class unique_ptr;
!   template &lt;class T, class D&gt; class unique_ptr&lt;T[], D&gt;;
  
!   template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator==(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
!   template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator!=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
!   template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
!   template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
!   template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
!   template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator==(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator==(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator!=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator!=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator&lt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator&lt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator&lt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator&lt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator&gt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator&gt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator&gt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
-   <ins>template &lt;class T, class D&gt;</ins>
-   <ins>bool operator&gt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
-   
-   // <i>20.9.11.1, Class bad_weak_ptr:</i>
-   class bad_weak_ptr;
  
!   // <i>20.9.11.2, Class template shared_ptr:</i>
!   template&lt;class T&gt; class shared_ptr;
  
!   // <i>20.9.11.2.7, shared_ptr comparisons:</i>
!   template&lt;class T, class U&gt;
!   bool operator==(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b);
!   template&lt;class T, class U&gt;
!   bool operator!=(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b);
!   template&lt;class T, class U&gt;
!   bool operator&lt;(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b);
!   template&lt;class T, class U&gt;
!   bool operator&gt;(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b);
!   template&lt;class T, class U&gt;
!   bool operator&lt;=(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b);
!   template&lt;class T, class U&gt;
!   bool operator&gt;=(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b);
  
-   <ins>template&lt;class T&gt;</ins>
-   <ins>bool operator==(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
-   <ins>template&lt;class T&gt;</ins>
-   <ins>bool operator==(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
-   <ins>template&lt;class T&gt;</ins>
-   <ins>bool operator!=(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
-   <ins>template&lt;class T&gt;</ins>
-   <ins>bool operator!=(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
-   <ins>template&lt;class T&gt;</ins>
-   <ins>bool operator&lt;(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
-   <ins>template&lt;class T&gt;</ins>
-   <ins>bool operator&lt;(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
-   <ins>template&gt;class T&gt;</ins>
-   <ins>bool operator&gt;(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
-   <ins>template&gt;class T&gt;</ins>
-   <ins>bool operator&gt;(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
-   <ins>template&lt;class T&gt;</ins>
-   <ins>bool operator&lt;=(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
-   <ins>template&lt;class T&gt;</ins>
-   <ins>bool operator&lt;=(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
-   <ins>template&gt;class T&gt;</ins>
-   <ins>bool operator&gt;=(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
-   <ins>template&gt;class T&gt;</ins>
-   <ins>bool operator&gt;=(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
  
!   [..]
! }
  </pre></blockquote>
  </li>
- <li>Change the synopsis just after 20.9.9 [unique.ptr] p. 6 as indicated:
- <blockquote><pre>namespace std {
-   [..]
-   
-   template &lt;class T1, class D1, class T2, class D2&gt;
-   bool operator==(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
-   template &lt;class T1, class D1, class T2, class D2&gt;
-   bool operator!=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
-   template &lt;class T1, class D1, class T2, class D2&gt;
-   bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
-   template &lt;class T1, class D1, class T2, class D2&gt;
-   bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
-   template &lt;class T1, class D1, class T2, class D2&gt;
-   bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
-   template &lt;class T1, class D1, class T2, class D2&gt;
-   bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator==(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator==(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator!=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator!=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator&lt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator&lt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator&lt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator&lt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator&gt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator&gt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator&gt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
!   <ins>template &lt;class T, class D&gt;</ins>
!   <ins>bool operator&gt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
  
! }
  </pre></blockquote>
  </li>
- <li><a name="1401_extra_bullet">This bullet splits into two sub-bullets A and B as mentioned in the discussion comment:</a>
- <ol style="list-style-type:upper-alpha">
- <li>Change 20.9.9.4 [unique.ptr.special]/4-7 as indicated and add a series of prototype
- descriptions:
- <blockquote><pre>template &lt;class T1, class D1, class T2, class D2&gt;
-   bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
- </pre>
  
! <blockquote>
  <p>
! <ins>? <i>Requires:</i> Let <tt>CT</tt> be <tt>common_type&lt;unique_ptr&lt;T1,
! D1&gt;::pointer, unique_ptr&lt;T2, D2&gt;::pointer&gt;::type</tt>. Then
! the specialization <tt>less&lt;CT&gt;</tt> shall be a function object type ([function.objects]) 
! that induces a strict weak ordering ([alg.sorting]) on the pointer values.</ins>
  </p>
  
  <p>
! 4 <i>Returns:</i> <tt><ins>less&lt;CT&gt;()(x.get(), y.get())</ins><del>x.get()
! &lt; y.get()</del></tt>.
  </p>
  
  <p>
! <ins>? <i>Remarks:</i> If <tt>unique_ptr&lt;T1, D1&gt;::pointer</tt> is not
! implicitly convertible to <tt>CT</tt> or <tt>unique_ptr&lt;T2,
! D2&gt;::pointer</tt> is not implicitly convertible to <tt>CT</tt>, the program
! is ill-formed.</ins>
  </p>
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
! </pre>
  
  <blockquote>
! 5 <i>Returns:</i> <tt><ins>!(y &lt; x)</ins><del>x.get() &lt;= y.get()</del></tt>.
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
! </pre>
  
  <blockquote>
! 6 <i>Returns:</i> <tt><ins>(y &lt; x)</ins><del>x.get() &gt; y.get()</del></tt>.
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
!   bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
! </pre>
  
  <blockquote>
! 7 <i>Returns:</i> <tt><ins>!(x &lt; y)</ins><del>x.get() &gt;= y.get()</del></tt>.
  </blockquote>
  </blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator==(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
! <ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator==(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>!x</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator!=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
! <ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator!=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>(bool) x</tt>.</ins>
  </blockquote></blockquote>
  
- <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
- <ins>bool operator&lt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
- <ins>template &lt;class T, class D&gt;</ins>
- <ins>bool operator&gt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
- </pre>
- <blockquote>
- <ins>? <i>Requires:</i> The specialization <tt>less&lt;unique_ptr&lt;T, D&gt;::pointer&gt;</tt> 
- shall be a function object type ([function.objects]) that induces a strict weak ordering ([alg.sorting])
- on the pointer values.</ins>
- </blockquote>
- <blockquote>
- <ins>? <i>Returns</i>: <tt>less&lt;unique_ptr&lt;T, D&gt;::pointer&gt;()(x.get(), nullptr)</tt>.</ins>
- </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&lt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
! <ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&gt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
! </pre>
! <blockquote>
! <ins>? <i>Requires:</i> The specialization <tt>less&lt;unique_ptr&lt;T, D&gt;::pointer&gt;</tt> 
! shall be a function object type ([function.objects]) that induces a strict weak ordering ([alg.sorting])
! on the pointer values.</ins>
! </blockquote>
! <blockquote>
! <ins>? <i>Returns</i>: <tt>less&lt;unique_ptr&lt;T, D&gt;::pointer&gt;()(nullptr, x.get())</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&lt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
! <ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&gt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>!(nullptr &lt; x)</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&lt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
! <ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&gt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>!(x &lt; nullptr)</tt>.</ins>
  </blockquote></blockquote>
  
! </li>
! <li>
! Add the following series of prototype specifications at the very end of 20.9.9.4 [unique.ptr.special].
! Intentionally, the relational operators are defined individually, because there is no guarantee that
! from <tt>x.get() &lt; nullptr</tt> follows the relation <tt>nullptr &gt; x.get()</tt>:
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator==(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
! <ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator==(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>!x</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator!=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
! <ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator!=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>(bool) x</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&lt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>x.get() &lt; nullptr</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&lt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>nullptr &lt; x.get()</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&lt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>x.get() &lt;= nullptr</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&lt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>nullptr &lt;= x.get()</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&gt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>x.get() &gt; nullptr</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&gt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>nullptr &gt; x.get()</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&gt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>x.get() &gt;= nullptr</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;class T, class D&gt;</ins>
! <ins>bool operator&gt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>nullptr &gt;= x.get()</tt>.</ins>
  </blockquote></blockquote>
  </li>
- </ol>
- </li>
- <li>Change 20.9.10.2 [util.smartptr.shared] p. 1, class template shared_ptr 
- synopsis as indicated. For consistency reasons the remaining normal relation
- operators are added as well:
- <blockquote><pre>namespace std {
-   [..]
-   // <i>20.9.11.2.7, shared_ptr comparisons:</i>
-   template&lt;class T, class U&gt;
-   bool operator==(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b);
-   template&lt;class T, class U&gt;
-   bool operator!=(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b);
-   template&lt;class T, class U&gt;
-   bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b);
-   <ins>template&lt;class T, class U&gt;</ins>
-   <ins>bool operator&gt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b) noexcept;</ins>
-   <ins>template&lt;class T, class U&gt;</ins>
-   <ins>bool operator&lt;=(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b) noexcept;</ins>
-   <ins>template&lt;class T, class U&gt;</ins>
-   <ins>bool operator&gt;=(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b) noexcept;</ins>
  
!   <ins>template&lt;class T&gt;</ins>
!   <ins>bool operator==(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
!   <ins>template&lt;class T&gt;</ins>
!   <ins>bool operator==(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
!   <ins>template&lt;class T&gt;</ins>
!   <ins>bool operator!=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
!   <ins>template&lt;class T&gt;</ins>
!   <ins>bool operator!=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
!   <ins>template&lt;class T&gt;</ins>
!   <ins>bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
!   <ins>template&lt;class T&gt;</ins>
!   <ins>bool operator&lt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
!   <ins>template&gt;class T&gt;</ins>
!   <ins>bool operator&gt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
!   <ins>template&gt;class T&gt;</ins>
!   <ins>bool operator&gt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
!   <ins>template&lt;class T&gt;</ins>
!   <ins>bool operator&lt;=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
!   <ins>template&lt;class T&gt;</ins>
!   <ins>bool operator&lt;=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
!   <ins>template&gt;class T&gt;</ins>
!   <ins>bool operator&gt;=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
!   <ins>template&gt;class T&gt;</ins>
!   <ins>bool operator&gt;=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
  
!   [..]
! }
! </pre></blockquote>
  </li>
! <li>Add the following series of prototype specifications at the very end of 20.9.10.2.7 [util.smartptr.shared.cmp].
! For mixed comparison the general "generation" rule of 20.3.1 [operators] p. 10 does not apply, 
! therefore all of them are defined. Below wording takes advantage of the simplified definition of the
! <em>composite pointer type</em> if one partner is a null pointer constant:
! <blockquote><pre><ins>template&lt;class T&gt;</ins>
! <ins>bool operator==(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
! <ins>template&lt;class T&gt;</ins>
! <ins>bool operator==(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>!a</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template&lt;class T&gt;</ins>
! <ins>bool operator!=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
! <ins>template&lt;class T&gt;</ins>
! <ins>bool operator!=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>(bool) a</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template&lt;class T&gt;</ins>
! <ins>bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
! <ins>template&lt;class T&gt;</ins>
! <ins>bool operator&gt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>less&lt;T*&gt;()(a.get(), nullptr)</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template&lt;class T&gt;</ins>
! <ins>bool operator&lt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
! <ins>template&lt;class T&gt;</ins>
! <ins>bool operator&gt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>less&lt;T*&gt;()(nullptr, a.get())</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template&lt;class T&gt;</ins>
! <ins>bool operator&lt;=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
! <ins>template&lt;class T&gt;</ins>
! <ins>bool operator&gt;=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>!(nullptr &lt; a)</tt>.</ins>
  </blockquote></blockquote>
  
! <blockquote><pre><ins>template&lt;class T&gt;</ins>
! <ins>bool operator&lt;=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
! <ins>template&lt;class T&gt;</ins>
! <ins>bool operator&gt;=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
  </pre><blockquote>
! <ins>? <i>Returns</i>: <tt>!(a &lt; nullptr)</tt>.</ins>
  </blockquote></blockquote>
  
  </li>
  </ol>
  
  
--- 15517,17882 ----
  
  
  <hr>
! <h3><a name="2219"></a>2219. <tt><i>INVOKE</i></tt>-ing a pointer to member with a <tt>reference_wrapper</tt> as the object expression</h3>
! <p><b>Section:</b> 20.9.2 [func.require] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-11-28 <b>Last modified:</b> 2015-05-06</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.require">active issues</a> in [func.require].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.require">issues</a> in [func.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! The standard currently requires this to be invalid:
  </p>
+ <blockquote><pre>
+ #include &lt;functional&gt;
  
! struct X { int i; } x;
! auto f = &amp;X::i;
! auto t1 = std::ref(x);
! int i = std::mem_fn(f)(t1);
! </pre></blockquote>
! <p>
! The call expression on the last line is equivalent to <tt><i>INVOKE</i>(f, std::ref(x))</tt> 
! which according to 20.9.2 [func.require]p1 results in the invalid expression <tt>(*t1).*f</tt> 
! because <tt>reference_wrapper&lt;X&gt;</tt> is neither an object of type <tt>X</tt> nor a reference 
! to an object of type <tt>X</tt> nor a reference to an object of a type derived from <tt>X</tt>.
! </p>
! <p>
! The same argument applies to pointers to member functions, and if they don't work with <tt>INVOKE</tt> 
! it becomes harder to do all sorts of things such as:
! </p>
! <blockquote><p>
! <tt>call_once(o, &amp;std::thread::join, std::ref(thr))</tt>
! </p></blockquote>
! <p>
! or
! </p>
! <blockquote><p>
! <tt>async(&amp;std::list&lt;int&gt;::sort, std::ref(list));</tt>
! </p></blockquote>
! <p>
! The definition of <tt><i>INVOKE</i></tt> should be extended to handle reference wrappers.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
  
  <p>
! Moved to Review.
! </p>
! <p>
! The wording seems accurate, but verbose.  If possible, we would like to define the kind of thing being
! specified so carefully as one of a number of potential language constructs in a single place.  It is
! also possible that this clause <i>is</i> that single place.
  </p>
  
! <p><i>[2013-04-18, Bristol]</i></p>
  
  
! <p>Jonathan comments:</p>
! 
! <p>In the proposed resolution in the first bullet <tt>(t1.*f)</tt> is not valid if <tt>t1</tt> is a
! <tt>reference_wrapper</tt>, so we probably need a separate bullet to handle the
! <tt>reference_wrapper</tt> case.</p>
! 
! <p><i>[2014-02-14, Issaquah, Mike Spertus supplies wording]</i></p>
! 
! 
! <p><strong>Previous resolution from Jonathan [SUPERSEDED]:</strong></p>
! 
! <blockquote class="note">
! 
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Edit 20.9.2 [func.require]:</p>
! <blockquote><p>
! Define <tt><i>INVOKE</i>(f, t1, t2, ..., tN)</tt> as follows:
! </p>
! <ul>
! <li><p>
! <tt>(t1.*f)(t2, ..., tN)</tt> when <tt>f</tt> is a pointer to a member function of a class <tt>T</tt> and 
! <tt>t1</tt> is an object of type <tt>T</tt> or a reference to an object of type <del><tt>T</tt> or a reference 
! to an object of a type derived from <tt>T</tt></del> <ins><tt>U</tt> or an object of type <tt>reference_wrapper&lt;U&gt;</tt> 
! or a reference to an object of type <tt>reference_wrapper&lt;U&gt;</tt> where <tt>U</tt> is either the type 
! <tt>T</tt> or a type derived from <tt>T</tt></ins>;
! </p>
! </li>
! 
! <li><p>
! <tt>((*t1).*f)(t2, ..., tN)</tt> when <tt>f</tt> is a pointer to a member function of a class <tt>T</tt> and 
! <tt>t1</tt> is not one of the types described in the previous item;
! </p></li>
! 
! <li><p> 
! <tt>t1.*f</tt> when <tt>N == 1</tt> and <tt>f</tt> is a pointer to member data of a class <tt>T</tt> and <tt>t1</tt> 
! is an object of type <tt>T</tt> or a reference to an object of type <del><tt>T</tt> or a reference to an object of a 
! type derived from <tt>T</tt></del> <ins><tt>U</tt> or an object of type <tt>reference_wrapper&lt;U&gt;</tt> 
! or a reference to an object of type <tt>reference_wrapper&lt;U&gt;</tt> where <tt>U</tt> is either the type 
! <tt>T</tt> or a type derived from <tt>T</tt></ins>;
! </p></li>
! 
! <li><p>
! <tt>(*t1).*f</tt> when <tt>N == 1</tt> and <tt>f</tt> is a pointer to member data of a class <tt>T</tt> and <tt>t1</tt> 
! is not one of the types described in the previous item;
! </p></li>
! 
! <li><p>
! <tt>f(t1, t2, ..., tN)</tt> in all other cases.
! </p></li>
! </ul>
! 
  </blockquote>
  
+ </li>
+ </ol>
+ 
+ </blockquote>
+  
+ <p><i>[2014-10-01, STL adds discussion and provides an improved resolution]</i></p>
+ 
+ <p>
+ Because neither <tt>t1.*f</tt> nor <tt>(*t1).*f</tt> will compile when <tt>t1</tt> is <tt>reference_wrapper&lt;U&gt;</tt> 
+ for any <tt>U</tt>, we don't need to inspect <tt>U</tt> carefully. We can bluntly detect all <tt>reference_wrapper</tt>s 
+ and use <tt>get()</tt> for them.
+ <p/>
+ We would have to be more careful if we had to deal with pointers to members of <tt>reference_wrapper</tt> itself.  
+ Fortunately, we don't. First, it doesn't have user-visible data members. Second, users technically can't take the 
+ addresses of its member functions (this is a consequence of 17.6.5.5 [member.functions], the Implementer's Best Friend).
+ <p/>
+ While we're in the neighborhood, I recommend simplifying and clarifying the wording used to detect base/derived objects.
+ </p>
+ 
+ <p><strong>Previous resolution from Mike Spertus [SUPERSEDED]:</strong></p>
+ 
+ <blockquote class="note">
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Edit 20.9.2 [func.require]:</p>
+ <blockquote><p>
+ Define <tt><i>INVOKE</i>(f, t1, t2, ..., tN)</tt> as follows:
+ </p>
+ <ul>
+ <li><p>
+ <tt>(t1.*f)(t2, ..., tN)</tt> when <tt>f</tt> is a pointer to a member function of a class <tt>T</tt> and 
+ <tt>t1</tt> is an object of type <tt>T</tt> or a reference to an object of type <tt>T</tt> or a reference 
+ to an object of a type derived from <tt>T</tt>;
+ </p>
+ </li>
+ 
+ <li><p>
+ <ins>
+ <tt>(t1.get().*f)(t2, ..., tN)</tt> when <tt>f</tt> is a pointer to a member function
+ of class <tt>T</tt>
+ and <tt>t1</tt> is an object of type <tt>reference_wrapper&lt;U&gt;</tt> where <tt>U</tt>
+ is either the type <tt>T</tt> or a type derived from <tt>T</tt>.
+ </ins>
+ </p>
+ </li>
+ 
+ <li><p>
+ <tt>((*t1).*f)(t2, ..., tN)</tt> when <tt>f</tt> is a pointer to a member function of a class <tt>T</tt> and 
+ <tt>t1</tt> is not one of the types described in the previous item;
+ </p></li>
+ 
+ 
+ 
+ <li><p> 
+ <tt>t1.*f</tt> when <tt>N == 1</tt> and <tt>f</tt> is a pointer to member data of a class <tt>T</tt> and <tt>t1</tt> 
+ is an object of type <tt>T</tt> or a reference to an object of type <tt>T</tt> or a reference to an object of a 
+ type derived from <tt>T</tt>;
+ </p></li>
+ 
+ <li><p>
+ <ins>
+ <tt>t1.get().*f</tt> when <tt>N == 1</tt> and <tt>f</tt> is a pointer to member data of a
+ class <tt>T</tt> and <tt>t1</tt> is an object of type <tt>reference_wrapper&lt;U&gt;</tt>
+ where <tt>U</tt> is either the type <tt>T</tt> or a type derived from <tt>T</tt>.
+ </ins>
+ </p></li>
+ 
+ <li><p>
+ <tt>(*t1).*f</tt> when <tt>N == 1</tt> and <tt>f</tt> is a pointer to member data of a class <tt>T</tt> and <tt>t1</tt> 
+ is not one of the types described in the previous item;
+ </p></li>
+ 
+ <li><p>
+ <tt>f(t1, t2, ..., tN)</tt> in all other cases.
+ </p></li>
+ </ul>
+ 
+ </blockquote>
+ 
+ </li>
+ </ol>
+ </blockquote>
+ 
+ <p><i>[2015-02, Cologne]</i></p>
+ 
+ <p>
+ Waiting for implementation experience. 
+ </p>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
+ <p>
+ STL: latest note from Cologne, waiting for implementation experience<br/>
+ STL: don't think this is harder than anything else we do<br/>
+ MC: it does involve <tt>mem_fn</tt> and invoke<br/>
+ STL: my simplication was not to attempt fine-grained<br/>
+ STL: can ignore pmf<br/>
+ STL: can't invoke pmf to reference wrapper<br/>
+ STL: wording dated back to TR1 when there was no <tt>decltype</tt><br/>
+ MC: should <tt>decay_t&lt;decltype(t1)&gt;</tt> be pulled out since it is in multiple places<br/>
+ STL: it could be handled editorially<br/>
+ STL: we fix function, bind, invoke<br/>
+ STL: have not implemented this but believe it is fine<br/>
+ MC: Eric F, you have worked in invoke<br/>
+ EF: yes, looks ok<br/>
+ MC: consensus move to ready 
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.9.2 [func.require] p1 as depicted:</p>
! <blockquote><p>
! Define <tt><i>INVOKE</i>(f, t1, t2, ..., tN)</tt> as follows:
! </p>
! <ul>
! <li><p>
! <tt>(t1.*f)(t2, ..., tN)</tt> when <tt>f</tt> is a pointer to a member function of a class <tt>T</tt> and 
! <del><tt>t1</tt> is an object of type <tt>T</tt> or a reference to an object of type <tt>T</tt> or a reference 
! to an object of a type derived from <tt>T</tt></del><ins><tt>is_base_of&lt;T, decay_t&lt;decltype(t1)&gt;&gt;::value</tt> 
! is true</ins>;
! </p>
! </li>
! 
! <li><p>
! <ins><tt>(t1.get().*f)(t2, ..., tN)</tt> when <tt>f</tt> is a pointer to a member function of a class <tt>T</tt> and 
! <tt>decay_t&lt;decltype(t1)&gt;</tt> is a specialization of <tt>reference_wrapper</tt>;</ins>
! </p></li>
! 
! <li><p>
! <tt>((*t1).*f)(t2, ..., tN)</tt> when <tt>f</tt> is a pointer to a member function of a class <tt>T</tt> and 
! <tt>t1</tt> <del>is not one of the types described in the previous item</del><ins>does not satisfy the previous two 
! items</ins>;
! </p></li>
! 
! <li><p> 
! <tt>t1.*f</tt> when <tt>N == 1</tt> and <tt>f</tt> is a pointer to member data of a class <tt>T</tt> and <del><tt>t1</tt> 
! is an object of type <tt>T</tt> or a reference to an object of type <tt>T</tt> or a reference to an object of a 
! type derived from <tt>T</tt></del><ins><tt>is_base_of&lt;T, decay_t&lt;decltype(t1)&gt;&gt;::value</tt> 
! is true</ins>;
! </p></li>
! 
! <li><p>
! <ins><tt>t1.get().*f</tt> when <tt>N == 1</tt> and <tt>f</tt> is a pointer to member data of a class <tt>T</tt> and 
! <tt>decay_t&lt;decltype(t1)&gt;</tt> is a specialization of <tt>reference_wrapper</tt>;</ins>
! </p></li>
! 
! <li><p>
! <tt>(*t1).*f</tt> when <tt>N == 1</tt> and <tt>f</tt> is a pointer to member data of a class <tt>T</tt> and <tt>t1</tt> 
! <del>is not one of the types described in the previous item</del><ins>does not satisfy the previous two items</ins>;
! </p></li>
! 
! <li><p>
! <tt>f(t1, t2, ..., tN)</tt> in all other cases.
! </p></li>
! </ul>
! 
! </blockquote>
! 
! </li>
! </ol>
! 
  
  
  
  
  
  <hr>
! <h3><a name="2220"></a>2220. Under-specification of <tt>operator==</tt> for <tt>regex_token_iterator</tt></h3>
! <p><b>Section:</b> 28.12.2.2 [re.tokiter.comp] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-11-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! 
  <p>
! Consider the following example:
! </p>
! <blockquote><pre>
! std::string str0("x");
! std::regex rg0("a");
! std::regex_token_iterator it0(str0.begin(), str0.end(), rg0, -1); // points at "x" in str0
! std::string str1("x");
! std::regex rg1("b");
! std::regex_token_iterator it1(str1.begin(), str1.end(), rg1, -1); // points at "x" in str1
! </pre></blockquote>
! <p>
! 28.12.2.2 [re.tokiter.comp] p1 says that <tt>it0.operator==(it1)</tt> returns true "if 
! <tt>*this</tt> and <tt>right</tt> are both suffix iterators and <tt>suffix == right.suffix</tt>"; both 
! conditions are satisfied in this example. It does not say that they must both be iterators 
! into the same sequence, nor does it say (as general iterator requirements do) that they must 
! both be in the domain of <tt>==</tt> in order for the comparison to be meaningful. It's a 
! simple statement: they're equal if the strings they point at compare equal. Given this being
! a valid comparison, the obtained result of "true" looks odd.
! <p/>
! The problem is that for iterator values prior to the suffix iterator, equality means the same 
! regular expression and the same matched sequence (both uses of "same" refer to identity, not equality); 
! for the suffix iterator, equality means that the matched sequences compare equal.
  </p>
  
  
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2221"></a>2221. No formatted output operator for <tt>nullptr</tt></h3>
! <p><b>Section:</b> 27.7.3 [output.streams] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2012-12-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! When I write 
! </p>
! <blockquote><pre>
! std::cout &lt;&lt; nullptr &lt;&lt; std::endl;
! </pre></blockquote>
! <p>
! I get a compilation error, "ambiguous overload for '<tt>operator&lt;&lt;</tt>' in '<tt>std::cout &lt;&lt; nullptr</tt>'". 
! As far as I can tell, the compiler is right to issue that error. There are inserters for <tt>const void*</tt>, 
! <tt>const char*</tt>, <tt>const signed char*</tt>, and <tt>const unsigned char*</tt>, and none for 
! <tt>nullptr_t</tt>, so the expression really is ambiguous.
! <p/>
! <em>Proposed wording</em>:
! <p/>
! The obvious library solution is to add a <tt>nullptr_t</tt> overload, which would be defined something like
! </p>
! <blockquote><pre>
! template&lt;class C, class T&gt;
! basic_ostream&lt;C, T&gt;&amp; operator&lt;&lt;(basic_ostream&lt;C, T&gt;&amp; os, nullptr_t) 
! { 
!   return os &lt;&lt; (void*) nullptr; 
! }
  </pre></blockquote>
+ <p>
+ We might also consider addressing this at a core level: add a special-case language rule that addresses all 
+ cases where you write <tt>f(nullptr)</tt> and <tt>f</tt> is overloaded on multiple pointer types. (Perhaps 
+ a tiebreaker saying that <tt>void*</tt> is preferred in such cases.)
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2223"></a>2223. <tt>shrink_to_fit</tt> effect on iterator validity</h3>
+ <p><b>Section:</b> 23.3.6.3 [vector.capacity] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Juan Soulie <b>Opened:</b> 2012-12-17 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ After the additions by <a href="lwg-defects.html#2033">2033</a>, it appears clear that the intended effect includes a reallocation and 
+ thus the potential effect on iterators should be explicitly added to the text in order to not contradict 
+ 23.2.1 [container.requirements.general]/11, or at the very least, explicitly state that a reallocation may 
+ happen.
+ <p/>
+ Taking consistency with "reserve" into consideration, I propose:
+ </p>
+ <ul>
+ <li><p>
+ that the current "Remarks" are made its "Effect" instead, inserting "Reallocation happens at this point if and only 
+ if the function effectively reduces the capacity." after the note on non-bindingness.
+ </p>
+ </li>
+ <li><p>
+ adding a "Remarks" paragraph, similar to that of reserve: "Reallocation invalidates all the references, pointers, 
+ and iterators referring to the elements in the sequence."
+ </p></li>
+ </ul>
+ <p>
+ BTW, while we are at it, I believe the effect on iterators should also be explicitly stated in the other instance 
+ a reallocation may happen: 23.3.6.5 [vector.modifiers]/1 &mdash; even if obvious, it only contradicts 
+ 23.2.1 [container.requirements.general]/11 implicitly. 
+ <p/>
+ I propose to also insert "Reallocation invalidates all the references, pointers, and iterators referring to the 
+ elements in the sequence." at the appropriate location in its "Remarks".
+ </p>
+ 
+ <p><i>[2012-12-19: Jonathan Wakely comments]</i></p>
+ 
+ 
+ <p>
+ The described problem also affects <tt>std::basic_string</tt> and <tt>std::deque</tt>.
+ </p>
+ 
+ <p><i>[2013-03-15 Issues Teleconference]</i></p>
+ 
+ <p>
+ Moved to Review.
+ </p>
+ 
+ <p><i>[2013-04-18, Bristol]</i></p>
+  
+ 
+ <p>Daniel extends the P/R.</p>
+ 
+ <p>Rationale:</p>
+ 
+ <p>The wording in 21.4.4 [string.capacity] combined with 21.4.1 [string.require]
+ seems to say the necessary things. We cannot impose all requirements as we do for <tt>vector</tt>, because
+ we want to allow the short-string-optimization.</p>
+ 
+ 
+ <p><i>[2014-02-15 post-Issaquah session]</i></p>
+ 
+ <p>
+ STL: I think that <tt>shrink_to_fit</tt> should be a no-op when called twice.
+ </p>
+ <p>
+ STL: Do we ever define reallocation for <tt>deque</tt>? Nope, all mentions of "reallocation" are in <tt>vector</tt>.
+      We define what it means in <tt>vector::reserve()</tt>, but not for <tt>deque</tt>.
+ </p>
+ <p>
+ STL: Oh duh, they define reallocate in the PR. But I think we can do better here.
+ </p>
+ <p>
+ STL: Optimally, deque shrinking just allocates a new map of pointers, and drops empty blocks, but preserves pointers/references to elements.
+ </p>
+ <p>
+ Alisdair: That's like unordered containers, invalidating only iterators.
+ </p>
+ <p>
+ Pablo: It doesn't make sense to reduce <tt>capacity()</tt> to <tt>size()</tt>, because <tt>deque</tt> doesn't have capacity!
+ </p>
+ <p>
+ STL: For <tt>vector</tt>, "effectively reduces the capacity" is unnecessary, the capacity there is observable.
+ </p>
+ <p>
+ STL: There is a strong reason to provide an optimal shrink to fit for <tt>deque</tt>, since only the library implementer can do this.
+ </p>
+ <p>
+ STL: The other thing I don't like the repeated definition of reallocation for <tt>vector</tt>, we define it once and use it in a bunch of places.
+      At most we can lift it up to the <tt>vector</tt> synopsis.
+ </p>
+ <p>
+ STL: I'll write new wording.
+ </p>
+ 
+ <p><i>[2014-10-01, STL adds discussion and provides new wording]</i></p>
+ 
+ <p>
+ Compared to the previous proposed resolution:
+ </p>
+ <ul>
+ <li><p>
+ I'm changing <tt>basic_string</tt>'s wording because (1) we should guarantee that capacity won't increase, (2) we should mention 
+ that it's linear complexity, and (3) we can provide a better invalidation guarantee than 21.4.1 [string.require]/5.  
+ (As previously noted, we already have the strong exception guarantee.) This introduces the term "reallocation" into 
+ <tt>basic_string</tt>, but immediately explains what it means for iterator validity. As far as I can tell, the Small String 
+ Optimization doesn't complicate the wording here; it's a reason why an implementation might not honor the request, but if 
+ the capacity is reduced, we are definitely reallocating buffers and will invalidate everything (including when the destination 
+ is the small buffer).
+ </p></li>
+ <li><p>
+ Between N3485 and N3936, <tt>deque</tt>'s wording was updated to avoid talking about <tt>capacity()</tt> which it doesn't have.  
+ Since the container's capacity is unobservable, I'm saying that invalidation is unconditional.
+ </p></li>
+ <li><p>
+ In <tt>vector</tt>'s wording, I'm also guaranteeing that capacity won't increase, and that iterators/etc. remain valid if the 
+ capacity is unchanged.
+ </p></li>
+ </ul>
+ <p>
+ My wording doesn't directly say that <tt>shrink_to_fit()</tt> should be a no-op when called twice in a row. (Indirectly, 
+ if the first call reduces <tt>capacity()</tt> to <tt>size()</tt>, the second call must preserve iterators/etc.) I considered 
+ rewording the complexity to say "linear if reallocation happens", but that's potentially problematic (what if we copy almost 
+ all <tt>N</tt> elements, then one throws and we have to unwind? There are no effects, so reallocation didn't happen, yet we 
+ took longer than constant time). Implementers can always do better than the stated complexity bounds.
+ <p/>
+ I chose not to modify <tt>deque</tt>'s requirements, so implementations remain free to reallocate the elements themselves.
+ <p/>
+ I didn't attempt to centralize vector's reallocation wording. That can be done editorially, if someone is sufficiently motivated.
+ </p>
+ 
+ <p><strong>Previous resolution from Juan Soulie/Daniel [SUPERSEDED]:</strong></p>
+ 
+ <blockquote class="note">
+ <p>This wording is relative to N3485.</p>
+ 
+ <ol>
+ <li><p>Keep 21.4.4 [string.capacity] around p14 <em>unchanged</em>, because we don't speak about
+ reallocations and we give the strong exception guarantee in 21.4.1 [string.require] (Invalidation
+ specification also at that place):</p>
+ <blockquote><pre>
+ void shrink_to_fit();
+ </pre>
+ <p>
+ -14- <i>Remarks</i>: <tt>shrink_to_fit</tt> is a non-binding request to reduce <tt>capacity()</tt> to 
+ <tt>size()</tt>. [<i>Note</i>: The request is non-binding to allow latitude for implementation-specific 
+ optimizations. &mdash; <i>end note</i> ].
+ </p>
  </blockquote>
+ </li>
  
! <li><p>Edit 23.3.3.3 [deque.capacity] around p7 as indicated:</p>
! <blockquote><pre>
! void shrink_to_fit();
! </pre>
! <p>
! -5- <i>Requires</i>: <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt>.
! <p/>
! <ins>-?- <i>Effects</i>: <tt>shrink_to_fit</tt> is a non-binding request to reduce <tt>capacity()</tt> to 
! <tt>size()</tt>. [<i>Note</i>: The request is non-binding to allow latitude for implementation-specific 
! optimizations. &mdash; <i>end note</i> ] Reallocation happens at this point if and only 
! if the function effectively reduces the capacity. If an exception is thrown other than by the move constructor 
! of a non-<tt>CopyInsertable</tt> <tt>T</tt> there are no effects.</ins> 
! <p/>
! -6- <i>Complexity</i>: Linear in the size of the sequence.
! <p/>
! -7- <i>Remarks</i>: <del><tt>shrink_to_fit</tt> is a non-binding request to reduce <tt>capacity()</tt> to 
! <tt>size()</tt>. [<i>Note</i>: The request is non-binding to allow latitude for implementation-specific 
! optimizations. &mdash; <i>end note</i> ] If an exception is thrown other than by the move constructor 
! of a non-<tt>CopyInsertable</tt> <tt>T</tt> there are no effects.</del><ins>Reallocation invalidates all 
! the references, pointers, and iterators referring to the elements in the sequence.</ins>
! </p>
! </blockquote>
! </li>
! 
! <li><p>Edit 23.3.6.3 [vector.capacity] around p7 as indicated:</p>
! <blockquote><pre>
! void shrink_to_fit();
! </pre>
! <p>
! -7- <i>Requires</i>: <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt>.
! <p/>
! <ins>-?- <i>Effects</i>: <tt>shrink_to_fit</tt> is a non-binding request to reduce <tt>capacity()</tt> to 
! <tt>size()</tt>. [<i>Note</i>: The request is non-binding to allow latitude for implementation-specific 
! optimizations. &mdash; <i>end note</i> ] Reallocation happens at this point if and only 
! if the function effectively reduces the capacity. If an exception is thrown other than by the move constructor 
! of a non-<tt>CopyInsertable</tt> <tt>T</tt> there are no effects.</ins> 
! <p/>
! -8- <i>Complexity</i>: Linear in the size of the sequence.
! <p/>
! -9- <i>Remarks</i>: <del><tt>shrink_to_fit</tt> is a non-binding request to reduce <tt>capacity()</tt> to 
! <tt>size()</tt>. [<i>Note</i>: The request is non-binding to allow latitude for implementation-specific 
! optimizations. &mdash; <i>end note</i> ] If an exception is thrown other than by the move constructor 
! of a non-<tt>CopyInsertable</tt> <tt>T</tt> there are no effects.</del><ins>Reallocation invalidates all 
! the references, pointers, and iterators referring to the elements in the sequence.</ins>
! </p>
! </blockquote>
! </li>
! 
! <li><p>Edit 23.3.6.5 [vector.modifiers] p1 as indicated:</p>
! <blockquote><pre>
! iterator insert(const_iterator position, const T&amp; x);
! iterator insert(const_iterator position, T&amp;&amp; x);
! iterator insert(const_iterator position, size_type n, const T&amp; x);
! template &lt;class InputIterator&gt;
! iterator insert(const_iterator position, InputIterator first, InputIterator last);
! iterator insert(const_iterator position, initializer_list&lt;T&gt;);
! template &lt;class... Args&gt; void emplace_back(Args&amp;&amp;... args);
! template &lt;class... Args&gt; iterator emplace(const_iterator position, Args&amp;&amp;... args);
! void push_back(const T&amp; x);
! void push_back(T&amp;&amp; x);
! </pre>
! <p>
! -1- <i>Remarks</i>: Causes reallocation if the new size is greater than the old capacity. <ins>Reallocation 
! invalidates all the references, pointers, and iterators referring to the elements in the sequence.</ins> If 
! no reallocation happens, all the iterators and references before the insertion point remain valid. If an 
! exception is thrown other than by the copy constructor, move constructor, assignment operator, or move 
! assignment operator of <tt>T</tt> or by any <tt>InputIterator</tt> operation there are no effects. If an 
! exception is thrown by the move constructor of a non-<tt>CopyInsertable</tt> <tt>T</tt>, the effects are unspecified.
! </p>
! </blockquote>
! </li>
! </ol>
! 
! </blockquote>
  
+ <p><i>[2015-02, Cologne]</i></p>
+ 
+ <p>
+ GR: I'm concerned that <tt>shrink_to_fit</tt> may cause reallocation without changing the capacity. [&hellip;] 
+ It's about correctness. The statement about invalidation is useless if I cannot detect whether reallocation has happened?
+ <p/>
+ AM: It seems like the logic goes the other way round: It's the capacity change that causes reallocation, so if 
+ there's no capacity change, there's no reallocation. But that's not quite how I'd like to say it... maybe this, : 
+ "If capacity does not change, no reallocation occurs."
+ <p/>
+ GR: Where does it actually say that <tt>reserve()</tt> invalidates? AM: It should say that in the container requirements. 
+ VV: vector specifies in <tt>reserve</tt> that there's reallocation if and only if the capacity changes. GR: I can't find
+ anything in the container requirements about <tt>reserve</tt>. DK: No, it's specified for every container separately. 
+ GR: It isn't specified for string.
+ <p/>
+ GR: I'm noticing that the issue touches on <tt>shrink_to_fit</tt> for a bunch of containers. Anyway, I think the 
+ reserve issue [re string] is in scope for this issue. This change is touching on a lot of members.
+ <p/>
+ AM: Landing this change will provide clarity for what we should do with <tt>basic_string</tt>. GR: We're already asking 
+ for changes; we should fix string as well. AM: If one of the changes is ready before the other, I'd like to land the 
+ finished part first, but if both are ready for Lenexa, I'm equally happy to fix them in one go.
+ <p/>
+ DK will reword this. 
+ <p/>
+ <b>Conclusion</b>: Update wording, revisit in Lenexa. 
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ This wording is relative to N3936.
+ </p>
+ 
+ <ol>
+ <li><p>Change 21.4.4 [string.capacity] p14 as depicted:</p>
  
  <blockquote>
! <pre>
! void shrink_to_fit();
! </pre>
! <blockquote>
  <p>
! -14- <i><del>Remarks</del><ins>Effects</ins></i>: <tt>shrink_to_fit</tt> is a non-binding request to reduce 
! <tt>capacity()</tt> to <tt>size()</tt>. [<i>Note</i>: The request is non-binding to allow latitude for 
! implementation-specific optimizations. &mdash; <i>end note</i>] <ins>It does not increase <tt>capacity()</tt>, 
! but may reduce <tt>capacity()</tt> by causing reallocation.</ins>
! <p/>
! <ins>-?- <i>Complexity</i>: Linear in the size of the sequence.</ins>
! <p/>
! <ins>-?- <i>Remarks</i>: Reallocation invalidates all the references, pointers, and iterators referring to the 
! elements in the sequence. If no reallocation happens, they remain valid.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
  
! <li><p>Change 23.3.3.3 [deque.capacity] p5-p7 as depicted:</p>
! <blockquote>
! <pre>
! void shrink_to_fit();
! </pre>
! <blockquote>
! <p>
! -5- <i>Requires</i>: <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt>.
! <p/>
! <ins>-?- <i>Effects</i>: <tt>shrink_to_fit</tt> is a non-binding request to reduce memory use but does not change 
! the size of the sequence. [<i>Note</i>: The request is non-binding to allow latitude for implementation-specific 
! optimizations. &mdash; <i>end note</i>] If an exception is thrown other than by the move constructor of a 
! non-<tt>CopyInsertable</tt> <tt>T</tt> there are no effects.</ins>
! <p/>
! -6- <i>Complexity</i>: Linear in the size of the sequence.
! <p/>
! -7- <i>Remarks</i>: <del><tt>shrink_to_fit</tt> is a non-binding request to reduce memory use but does not change the
! size of the sequence. [<i>Note</i>: The request is non-binding to allow latitude for implementation-specific
! optimizations. &mdash; <i>end note</i>]</del><ins><tt>shrink_to_fit</tt> invalidates all the references, pointers, 
! and iterators referring to the elements in the sequence.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 23.3.6.3 [vector.capacity] p7-p9 as depicted:</p>
! <blockquote>
! <pre>
! void shrink_to_fit();
! </pre>
! <blockquote>
! <p>
! -7- <i>Requires</i>: <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt>.
! <p/>
! <ins>-?- <i>Effects</i>: <tt>shrink_to_fit</tt> is a non-binding request to reduce <tt>capacity()</tt> to <tt>size()</tt>. 
! [<i>Note</i>: The request is non-binding to allow latitude for implementation-specific optimizations. &mdash; <i>end note</i>] 
! It does not increase <tt>capacity()</tt>, but may reduce <tt>capacity()</tt> by causing reallocation. If an exception is 
! thrown other than by the move constructor of a non-<tt>CopyInsertable</tt> <tt>T</tt> there are no effects.</ins>
! <p/>
! -8- <i>Complexity</i>: Linear in the size of the sequence.
! <p/>
! -9- <i>Remarks</i>: <del><tt>shrink_to_fit</tt> is a non-binding request to reduce <tt>capacity()</tt> to <tt>size()</tt>. 
! [<i>Note</i>: The request is non-binding to allow latitude for implementation-specific optimizations. &mdash; <i>end 
! note</i>] If an exception is thrown other than by the move constructor of a non-<tt>CopyInsertable</tt> <tt>T</tt> there 
! are no effects.</del><ins>Reallocation invalidates all the references, pointers, and iterators referring to the elements 
! in the sequence. If no reallocation happens, they remain valid.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
  
+ <li><p>Change 23.3.6.5 [vector.modifiers] p1 as depicted:</p>
  
+ <blockquote>
  <p>
! -1- <i>Remarks</i>: Causes reallocation if the new size is greater than the old capacity. <ins>Reallocation invalidates all 
! the references, pointers, and iterators referring to the elements in the sequence.</ins> If no reallocation happens,
! all the iterators and references before the insertion point remain valid. [&hellip;]
! </p>
! </blockquote>
! </li>
! </ol>
  
  
! 
! 
! 
! <hr>
! <h3><a name="2224"></a>2224. Ambiguous status of access to non-live objects</h3>
! <p><b>Section:</b> 17.6.4.10 [res.on.objects] <b>Status:</b> <a href="lwg-active.html#Ready">Tentatively Ready</a>
!  <b>Submitter:</b> Geoffrey Romer <b>Opened:</b> 2012-12-17 <b>Last modified:</b> 2015-05-05</p>
! <p><b>View all other</b> <a href="lwg-index.html#res.on.objects">issues</a> in [res.on.objects].</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The standard currently does not discuss when library objects may be accessed, except in a non-normative 
! note pertaining to synchronization in [res.on.objects], leaving it ambiguous whether single-threaded 
! code can access a library object during its construction or destruction. For example, there is a 
! reasonable question as to what happens if the deleter supplied to a <tt>unique_ptr</tt> transitively 
! accesses the <tt>unique_ptr</tt> itself during <tt>unique_ptr</tt>'s destruction; a straightforward 
! reading suggests that this is permitted, and that the deleter will see the <tt>unique_ptr</tt> still 
! holding the originally stored pointer, but consensus on the LWG reflector indicates this was not the 
! intent (see discussion beginning with 
! <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=33362">c++std-lib-33362</a>).
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
! </p>
! <p>
! Geoffrey will provide an example that clearly highlights the issue.
! </p>
! 
! <p><i>[2013-03-19 Geoffrey provides revised resolution and an example]</i></p>
! 
! 
! <p>
! I contend that the most straightforward reading of the current standard requires the following example code to print 
! "good" (because <tt>~unique_ptr</tt> is not specified to modify the state of the internal pointer), but the consensus 
! on the reflector was that its behavior should be undefined.
! <p/>
! This example also shows that, contrary to a comment in the telecon, the PR is not tautological. 12.7 [class.cdtor]/p4 
! explicitly permits member function calls during destruction, so the behavior of this code is well-defined as far as 
! the core language is concerned, despite the fact that it accesses a library object after the end of the object's 
! lifetime. If we want this code to have undefined behavior, we need to specify that at the library level.
! </p>
! 
! <blockquote><pre>
! #include &lt;memory&gt;
! #include &lt;iostream&gt;
! 
! class A;
! 
! struct B {
!  std::unique_ptr&lt;A&gt; a;
! };
! 
! struct A {
!  B* b;
!  ~A() {
!    if (b-&gt;a.get() == this) {
!      std::cout &lt;&lt; "good" &lt;&lt; std::endl;
!    }
!  }
! };
! 
! int main() {
!  B b;
!  b.a.reset(new A);
!  b.a-&gt;b = &amp;b;
! }
  </pre></blockquote>
  
+ <p>
+ Previous resolution:
+ </p>
+ <blockquote class="note">
+ <ol>
+ <li><p>Change the title of sub-clause 17.6.4.10 [res.on.objects] as indicated:</p>
+ <p><del>Shared objects and the library</del><ins>Library object access</ins> [res.on.objects]</p>
+ </li>
+ 
+ <li><p>Edit 17.6.4.10 [res.on.objects] p2 as indicated:</p>
+ <p>-2- <del>[<i>Note</i>: In particular, the program is required to ensure that completion of the constructor 
+ of any object of a class type defined in the standard library happens before any other member function 
+ invocation on that object and, unless otherwise specified, to ensure that completion of any member function 
+ invocation other than destruction on such an object happens before destruction of that object. This applies 
+ even to objects such as mutexes intended for thread synchronization. &mdash; <i>end note</i>]</del>
+ <ins>If an object of a standard library type is accessed outside of the object's lifetime (3.8 [basic.life]), 
+ the behavior is undefined unless otherwise specified.</ins></p>
+ </li>
+ </ol>
+ </blockquote>
+ 
+ <p><i>[2014 Urbana]</i></p>
+ 
+ <p>
+ STL: is this resolved by our change to the reeentrancy rules? [LWG <a href="lwg-active.html#2414">2414</a>]<br/>
+ GR: don't think that solves the multi-threaded case<br/>
+ MC: I like changing the note to normative text<br/>
+ GR: uses the magic "happens before" words, and "access" is magic too<br/>
+ JW: I like this. strict improvement, uses the right wording we have to say this properly<br/>
+ STL: I like the last sentence of the note, could we add that as a new note at the end?<br/>
+ So add "[Note: This applies even to objects such as mutexes intended for thread synchronization.]" to the end and move to Ready 
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Change the title of sub-clause 17.6.4.10 [res.on.objects] as indicated:</p>
! <p><del>Shared objects and the library</del><ins>Library object access</ins> [res.on.objects]</p>
! </li>
! 
! <li><p>Edit 17.6.4.10 [res.on.objects] p2 as indicated: <em>[<i>Editorial remark:</i> The motivation, is to 
! be more precise about the meaning of "outside the object's lifetime" in the presence of threads &mdash; <i>end editorial 
! remark</i>]</em></p>
! <p>-2- <del>[<i>Note</i>: In particular, the program is required to ensure that completion of the constructor 
! of any object of a class type defined in the standard library happens before any other member function 
! invocation on that object and, unless otherwise specified, to ensure that completion of any member function 
! invocation other than destruction on such an object happens before destruction of that object. This applies 
! even to objects such as mutexes intended for thread synchronization. &mdash; <i>end note</i>]</del>
! <ins>If an object of a standard library type is accessed, and the beginning of the object's lifetime 
! (3.8 [basic.life]) does not happen before the access, or the access does not happen before the end 
! of the object's lifetime, the behavior is undefined unless otherwise specified. [<i>Note</i>: This applies even to 
! objects such as mutexes intended for thread synchronization. &mdash; <i>end note</i>]</ins></p>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2226"></a>2226. <tt>wstring_convert</tt> methods do not take allocator instance</h3>
! <p><b>Section:</b> 22.3.3.2.2 [conversions.string] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Glen Fernandes <b>Opened:</b> 2012-12-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#conversions.string">active issues</a> in [conversions.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! 
  <p>
! The <tt>wstring_convert</tt> class template, described in 22.3.3.2.2 [conversions.string], does not 
! support custom stateful allocators. It only supports custom stateless allocators.
! <p/>
! The <tt>to_bytes</tt> member function returns <tt>basic_string&lt;char, char_traits&lt;char&gt;, Byte_alloc&gt;</tt>  
! but it does not take an instance of <tt>Byte_alloc</tt> to pass to the constructor of the <tt>basic_string</tt>.
! <p/>
! Similarly the <tt>from_bytes</tt> member function returns <tt>basic_string&lt;Elem, char_traits&lt;Elem&gt;, Wide_alloc&gt;</tt>  
! but it does not take an instance of <tt>Wide_alloc</tt> to pass to the constructor of the <tt>basic_string</tt>.
! <p/>
! This makes these two member functions and the <tt>wstring_convert</tt> class template not usable when <tt>Wide_alloc</tt> 
! or <tt>Byte_alloc</tt> are stateful allocators.
! </p>
  
! <p><i>[2013-01-22, Glen provides wording]</i></p>
  
  
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
  
! <p>
! Moved to NAD Future.
! </p>
! <p>
! This is clearly an extension that the LEWG may want to take a look at, once we have more experience
! with appropriate use of allocators with the C++11 model.
! </p>
  
  
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>In 22.3.3.2.2 [conversions.string]/2 and /6 "Class template <tt>wstring_convert</tt> synopsis" change the overloads 
! of the member function <tt>from_bytes()</tt> so that all four overloads take an additional parameter
! which is an instance of <tt>Wide_alloc</tt>:</p>
! 
! <blockquote><pre>
! wide_string from_bytes(char byte<ins>, const Wide_alloc&amp; alloc = Wide_alloc()</ins>);
! wide_string from_bytes(const char *ptr<ins>, const Wide_alloc&amp; alloc = Wide_alloc()</ins>);
! wide_string from_bytes(const byte_string&amp; str<ins>, const Wide_alloc&amp; alloc = Wide_alloc()</ins>);
! wide_string from_bytes(const char *first, const char *last<ins>, const Wide_alloc&amp; alloc = Wide_alloc()</ins>);
  </pre></blockquote>
  </li>
  
! <li><p>In 22.3.3.2.2 [conversions.string] /8 specify that this <tt>Wide_alloc</tt> allocator parameter is used to
! construct the <tt>wide_string</tt> object returned from the function:</p>
  
! <p>
! -7- <i>Effects</i>: The first member function shall convert the single-element sequence <tt>byte</tt> to a wide string.
! The second member function shall convert the null-terminated sequence beginning at <tt>ptr</tt> to a wide
! string. The third member function shall convert the sequence stored in <tt>str</tt> to a wide string. The fourth
! member function shall convert the sequence defined by the range <tt>[first, last)</tt> to a wide string.
! <p/>
! -8- In all cases:
! </p>
! <ul>
! <li><p>If the <tt>cvtstate</tt> object was not constructed with an explicit value, it shall be set to its default value
! (the initial conversion state) before the conversion begins. Otherwise it shall be left unchanged.</p></li>
! 
! <li><p>The number of input elements successfully converted shall be stored in <tt>cvtcount</tt>.</p></li>
! 
! <li><p><ins>The <tt>Wide_alloc</tt> allocator parameter is used to construct the <tt>wide_string</tt> object returned 
! from the function.</ins></p></li>
! </ul>
! </li>
! 
! <li><p>In 22.3.3.2.2 [conversions.string]/2 and /12 "Class template <tt>wstring_convert</tt> synopsis" change the overloads 
! of the member function <tt>to_bytes()</tt> so that all four overloads take an additional parameter
! which is an instance of <tt>Byte_alloc</tt>:</p>
! 
! <blockquote><pre>
! byte_string to_bytes(Elem wchar<ins>, const Byte_alloc&amp; alloc = Byte_alloc()</ins>);
! byte_string to_bytes(const Elem *wptr<ins>, const Byte_alloc&amp; alloc = Byte_alloc()</ins>);
! byte_string to_bytes(const wide_string&amp; wstr<ins>, const Byte_alloc&amp; alloc = Byte_alloc()</ins>);
! byte_string to_bytes(const Elem *first, const Elem *last<ins>, const Byte_alloc&amp; alloc = Byte_alloc()</ins>);
  </pre></blockquote>
  </li>
  
! <li><p>In 22.3.3.2.2 [conversions.string] /13 specify that this <tt>Byte_alloc</tt> allocator parameter is used to
! construct the <tt>byte_string</tt> object returned from the function:</p>
! 
  <p>
! -12- <i>Effects</i>: The first member function shall convert the single-element sequence <tt>wchar</tt> to a byte string.
! The second member function shall convert the null-terminated sequence beginning at <tt>wptr</tt> to a byte
! string. The third member function shall convert the sequence stored in <tt>wstr</tt> to a byte string. The
! fourth member function shall convert the sequence defined by the range <tt>[first, last)</tt> to a byte string.
! <p/>
! -13- In all cases:
  </p>
+ <ul>
+ <li><p>If the <tt>cvtstate</tt> object was not constructed with an explicit value, it shall be set to its default value
+ (the initial conversion state) before the conversion begins. Otherwise it shall be left unchanged.</p></li>
+ 
+ <li><p>The number of input elements successfully converted shall be stored in <tt>cvtcount</tt>.</p></li>
+ 
+ <li><p><ins>The <tt>Byte_alloc</tt> allocator parameter is used to construct the <tt>byte_string</tt> object returned 
+ from the function.</ins></p></li>
+ </ul>
+ </li>
+ 
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2227"></a>2227. Stateful comparison objects in associative containers</h3>
+ <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Juan Soulie <b>Opened:</b> 2012-12-19 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
  
  <p>
! Table 102 in 23.2.4 [associative.reqmts]/8 states on expression <tt>a.key_comp()</tt> that it 
! "returns the comparison object out of which a was constructed". At the same time, 
! 23.2.1 [container.requirements.general]/8 states (starting in the third line) that 
! "...Any <tt>Compare</tt>, <tt>Pred</tt>, or <tt>Hash</tt> objects belonging to <tt>a</tt> and <tt>b</tt> 
! shall be swappable and <em>shall be exchanged</em> by unqualified calls to non-member swap...". This is 
! problematic for any compliant implementation, since once swapped the container cannot return the comparison 
! object out of which it was constructed unless incurring in storing an otherwise needless object.
! <p/>
! The simple solution is to correct that statement in Table 102, but I believe this is part of a larger problem 
! of underspecified behavior: The new standard has made an effort in regards to allocators and now fully 
! specifies what happens to stateful allocator objects. It has even specified what happens to stateful <tt>hasher</tt> 
! and <tt>key_equal</tt> members of unordered containers (they propagate), but it says nothing about stateful 
! comparison objects of (ordered) associative containers, except for the statement in 
! 23.2.1 [container.requirements.general]/8 referred above and only related to <tt>swap</tt>.
! <p/>
! For example, it is unclear to me what is specified to happen on an assignment: should the comparison object 
! be copied/moved along with the elements, or should the left-hand side object keep its own?
! Maybe this has been intentionally left unspecified with the purpose of compatibility with C++98, which I 
! understand it specified that comparison objects were kept for the entire life of the container (like allocators) 
! &mdash; an unfortunate choice. But anyway, the segment of 23.2.1 [container.requirements.general] quoted 
! above seems to break any possible backwards compatibility with C++98 in this regard.
! <p/>
! Therefore, taking into consideration consistency with how this is dealed with for unordered associative 
! containers, I propose that Table 102 is modified as follows:
! </p>
! <ul>
! <li>
! <p>
! The row for expression <tt>a.key_comp()</tt> is changed so that its "assertion/note pre-/post-condition" reads 
! "Returns <tt>a</tt>'s comparison object."
  </p>
+ </li>
  
+ <li>
  <p>
! A new row is added at the appropriate location (which I believe would be after "X(il)" row), with:
  </p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 102 &mdash; Associative container requirements (in addition to container)</caption>
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Assertion&#47;note pre-&#47;post-condition</th>
+ <th>Complexity</th>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X(b)<br/>
+ X a(b)</tt>
+ </td>
+ <td>
+ <tt>X</tt>
+ </td>
+ <td>
+ Copy constructor. In addition to<br/>
+ the requirements of Table 96, copies<br/>
+ the comparison object.
+ </td>
+ <td>
+ Linear in <tt>b.size()</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a = b</tt>
+ </td>
+ <td>
+ <tt>X&amp;</tt>
+ </td>
+ <td>
+ Copy assignment operator. In addition to<br/>
+ the requirements of Table 96, copies the<br/>
+ comparison object.
+ </td>
+ <td>
+ Linear in <tt>a.size()</tt> and <tt>b.size()</tt>
+ </td>
+ </tr>
+ 
+ </table>
  </blockquote>
  
! </li>
! </ul>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
!  
! <p>
! STL: can't believe we don't specify this already. this is totally necessary
! <p/>
! Alisdair: how does it do this? copy construction? assignment?
! <p/>
! Also need it for move.
! <p/>
! STL: we already specify this for constructing from a comparator, not during copy construction though.
! <p/>
! Jonathan: don't like wording, should say "<tt>key_compare</tt> is <tt>CopyConstructible</tt>. Uses <tt>b.key_comp()</tt> 
! as a comparison object."
! <p/>
! STL: we get it right for unordered!
! <p/>
! Jonathan: can't wordsmith this now, but I think implementations do the right thing.
! <p/>
! Alisdair: not sure what right thing is for moves. Also we say nothing about propagating allocators to functors.
! </p>
! <p>
! Moved to Open.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! TK: There's no need for fine-grained propagate/not-propagate control. If you don't want to propagate the predicate, you can 
! simply construct or insert from an iterator range.
! <p/>
! VV: libstdc++ already implements the resolution of this issue.
! <p/>
! GR: There are a couple of other problems. We don't specify move constructor and move assignment for maps. Those are just general.
! <p/>
! TK: General container requirements already describe the semantics for {copy,move}-{construction,assignment}, so it doesn't 
! seem that there's room for choice in <tt>std::map</tt> assignments. <tt>unordered_map</tt> is different, though.
! <p/>
! [Note: Check what general container requirements say about container equality.]
! <p/>
! DK will draft wording. The decision is to unambiguously make all {copy,move}-{construction,assignment} operations endow the 
! LHS with the exact state of the RHS, including all predicates and hash function states.
! <p/>
! Conclusion: Update wording, revisit later. 
! </p>
! 
! <p><i>[2015-05-06 Lenexa: Waiting for updated wording]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Change Table 102 as indicated:</p>
  
  <blockquote>
! <table border="1">
! <caption>Table 102 &mdash; Associative container requirements (in addition to container)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Complexity</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X(il)</tt>
! </td>
! <td>
! <tt></tt>
! </td>
! <td>
! Same as <tt>X(il.begin(), il.end())</tt>.
! </td>
! <td>
! same as <tt>X(il.begin(), il.end())</tt>.
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>X(b)<br/>
! X a(b)</tt></ins>
! </td>
! <td>
! <tt></tt>
! </td>
! <td>
! <ins>Copy constructor. In addition to<br/>
! the requirements of Table 96, copies<br/>
! the comparison object.</ins>
! </td>
! <td>
! <ins>Linear in <tt>b.size()</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>a = b</tt></ins>
! </td>
! <td>
! <ins><tt>X&amp;</tt></ins>
! </td>
! <td>
! <ins>Copy assignment operator. In addition to<br/>
! the requirements of Table 96, copies the<br/>
! comparison object.</ins>
! </td>
! <td>
! <ins>Linear in <tt>a.size()</tt> and <tt>b.size()</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.key_comp()</tt>
! </td>
! <td>
! <tt>X::key_compare</tt>
! </td>
! <td>
! <del>r</del><ins>R</ins>eturns <del>the</del><ins><tt>a</tt>'s</ins> comparison object<br/>
! <del>out of which a was constructed.</del>
! </td>
! <td>
! constant
! </td>
! </tr>
! 
! 
! </table>
  </blockquote>
  
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2232"></a>2232. [CD] The <tt>char_traits</tt> specializations should declare their <tt>length()</tt>, <tt>compare()</tt>, and 
! <tt>find()</tt> members constexpr</h3>
! <p><b>Section:</b> 21.2.3 [char.traits.specializations] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2012-12-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#char.traits.specializations">issues</a> in [char.traits.specializations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses ES 14, US 19</b></p>
! 
! <p>
! These functions have easy recursive constexpr implementations that, unfortunately, aren't efficient at runtime. 
! EWG is still figuring out how to solve this problem in general (e.g., 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3444.html">N3444</a> isn't sufficient to avoid 
! stack overflows in debug builds or to get the optimal assembly-based implementations at runtime), so users can't 
! portably solve this problem for themselves, but implementations can use compiler-specific techniques to choose 
! the right implementation inside their standard libraries.
! </p>
! 
! <p>
! The LWG is still undecided about whether individual implementations can add constexpr to these functions, so we 
! need to add <tt>constexpr</tt> to the standard here for implementations to be able to improve this.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
! </p>
! <p>
! There are a number of people who have a strong interest in this issue not available for the telecon.
! </p>
! <p>
! It also plays at the heart of a discussion about library freedoms for <tt>constexpr</tt> and specifying
! a library that may depend on unspecified compiler intrinsics to be implementable.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Moved to NAD Future.
! </p>
! <p>
! While it is clear that this feature can be implemented using only C++14 <tt>constexpr</tt> features,
! there is real concern that we cannot call the efficient, highly optimized, C implementations of these
! functions under a C++14 <tt>constexpr</tt> implementation, nor implement similar ourselves as this
! typically involves use of inline <tt>asm</tt> instructions.
! </p>
! <p>
! Clang and libc++ have some experience of using intrinsics to try to address the performance issue, but
! the current intrinsics are not general enough to support <tt>char_traits</tt>.  The intrinsics support
! only operations on character string literals, and the string literal is no longer visible <i>as</i> a
! literal after passing as a <tt>const char *</tt> to the <tt>char_traits</tt> functions.
! </p>
! <p>
! Additional concern was raised that these operations are unlikely to be useful anyway, as the only client
! is <tt>basic_string</tt> which relies on dynamic memory allocation, and so cannot effectively be made a
! literal type.  Jeffrey then pointed out the pending <tt>string_view</tt> library that will also use
! <tt>char_traits</tt> and would most certainly benefit from being a literal type.
! </p>
! 
! <p>
! Given the choice of giving up performance on a critical library component, or requiring a compiler
! intrinsic with only unsuccessful implementation experience, the consensus is to not reject this, unless
! compelling implementation experience is demonstrated.  NAD Future seems the appropriate resolution.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>In 21.2.3.1 [char.traits.specializations.char], 21.2.3.2 [char.traits.specializations.char16_t], 
! 21.2.3.3 [char.traits.specializations.char32_t], and 21.2.3.4 [char.traits.specializations.wchar.t]:</p>
! <blockquote><pre>
! static <ins>constexpr</ins> int compare(const char_type* s1, const char_type* s2, size_t n);
! static <ins>constexpr</ins> size_t length(const char_type* s);
! static <ins>constexpr</ins> const char_type* find(const char_type* s, size_t n, const char_type&amp; a);
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2234"></a>2234. <tt>assert()</tt> should allow usage in constant expressions</h3>
! <p><b>Section:</b> 19.3 [assertions] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-01-12 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#assertions">active issues</a> in [assertions].</p>
! <p><b>View all other</b> <a href="lwg-index.html#assertions">issues</a> in [assertions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! It is unclear from the current specification whether <tt>assert()</tt> expressions can be used in 
! (potential) constant expressions. As an example consider the implementation of a <tt>constexpr</tt>
! function:
! </p>
! 
! <blockquote><pre>
! #include &lt;cassert&gt;
! 
! template&lt;class T, unsigned N&gt;
! struct array {
!   T data[N];
!   constexpr const T&amp; operator[](unsigned i) const {
!     return assert(i &lt; N), data[i];
!   }
! };
  
+ int main() {
+   constexpr array&lt;int, 3&gt; ai = {1, 2, 3};
+   constexpr int i = ai[0];
+   int j = ai[0];
+   // constexpr int k = ai[5];
+ }
+ </pre></blockquote>
+ 
+ <p>
+ The first question is whether this program is guaranteed well-formed? A second question is whether is would guaranteed to be
+ ill-formed, if we uncomment the last code line in <tt>main()</tt>?
+ </p>
+ 
+ <p>
+ The wording in 19.3 [assertions] doesn't add anything significant to the C99 wording. From the C99 specification 
+ (7.2 p1 and 7.2.1.1 p2) we get already some valuable guarantees:
+ </p>
+ 
+ <ul>
+ <li><p>
+ The expression <tt>assert(e)</tt> is a <tt>void</tt> expression for all expressions <tt>e</tt> independent of 
+ the definition of <tt>NDEBUG</tt>.
+ </p></li>
+ <li><p>
+ If <tt>NDEBUG</tt> is defined, <tt>assert(e)</tt> is equivalent to the expression <tt>void()</tt>
+ (or anything that cannot be distinguished from that).
+ </p></li>
+ </ul>
+ 
+ <p>
+ The current wording does not yet <em>guarantee</em> that <tt>assert</tt> expressions can be used in constant expressions,
+ but all tested implementations (gcc, MSVC) would already support this use-case. It seems to me that this should be possible
+ without giving <tt>assert</tt> a special meaning for the core language.
+ <p/>
+ As a related comment it should be added, that there is a core language 
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3444.html">proposal</a> 
+ that intents to relax some current constraints for <tt>constexpr</tt> functions and <tt>literal</tt> types. The most 
+ interesting one (making <tt>void</tt> a literal types and allowing for expression-statements) would simplify the motivating 
+ example implementation of <tt>operator[]</tt> to:
+ </p>
+ <blockquote><pre>
+ constexpr const T&amp; operator[](unsigned i) const {
+   assert(i &lt; N);
+   return data[i];
+ };
+ </pre></blockquote>
+ 
+ <p><i>[2013-03-15 Issues Teleconference]</i></p>
+ 
+ <p>
+ Moved to Open.
+ </p>
+ <p>
+ We are still gaining experience with <tt>constexpr</tt> as a language feature, and there may
+ be work in Evolution that would help address some of these concerns.  Defer discussion until
+ we have a group familiar with any evolutionary direction.
+ </p>
+ 
+ <p><i>[2014-06-08, Daniel comments and suggests wording]</i></p>
+ 
+ <p>
+ After approval of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3652.html"/>N3652<a/>,
+ <tt>void</tt> is now a literal type and <tt>constexpr</tt> functions can contain multiple statements, so
+ this makes the guarantee that <tt>assert</tt> expressions are per-se <tt>constexpr</tt>-friendly even more
+ relevant. A possible wording form could be along the lines of:
+ </p>
  <blockquote>
! <p>
! For every core constant expression <em>e</em> of scalar type that evaluates to <tt>true</tt> after being contextually 
! converted to <tt>bool</tt>, the expression <tt>assert(<em>e</em>)</tt> shall be a prvalue core constant expression of type 
! <tt>void</tt>.
! </p>
  </blockquote>
+ <p>
+ Richard Smith pointed out some weaknesses of this wording form, for example it would not guarantee to require
+ the following example to work:
+ </p>
+ <blockquote><pre>
+ constexpr void check(bool b) { assert(b); }
+ </pre></blockquote>
+ <p>
+ because <tt>b</tt> is not a core constant expression in this context.
+ <p/>
+ He suggested improvements that lead to the wording form presented below (any defects mine). 
+ </p>
  
! <p><i>[Lenexa 2015-05-05]</i></p>
! 
! <p>MC : ran into this</p>
! <p>Z : Is it guaranteed to be an expression?</p>
! <p>MC : clarifies that assert runs at runtime, not sure what it does at compile time</p>
! <p>STL : c standard guarantees its an expression and not a whole statement, so comma chaining it is ok</p>
! <p>HH : Some implementations work as author wants it to</p>
! <p>STL : also doing this as constexpr</p>
! <p>DK/STL : discussing how this can actually work</p>
! <p>HH : GCC 5 also implements it. We have implementor convergence</p>
! <p>MC : Wants to do this without giving assert a special meaning</p>
! <p>STL : NDEBUG being defined where assert appears is not how assert works. This is bug in wording. Should be "when assert is defined" or something like that. ... is a constant subexpression if NDEBUG is defined at the point where assert is last defined or redefined."</p>
! <p>Would like to strike the "either" because ok if both debug or assertion is true. We want inclusive-or here</p>
! <p>MC : is redefined needed?</p>
! <p>STL : my mental model is its defined once and then redefined</p>
! <p>HH : wants to up to P2</p>
! <p>Z/STL : discussing how wording takes care of how/when assert is defined/redefefined</p>
! <p>STL/WB : discussing whether to move to ready or review. -> Want to move it to ready.</p>
! <p>ask for updated wording</p>
! <p>p3 -> p2</p>
! <p>plan to go to ready after checking wording</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Introduce the following new definition to the existing list in 17.3 [definitions]: [<i>Drafting note</i>:
! If LWG <a href="lwg-active.html#2296">2296</a> is accepted before this issue, the accepted wording for the new definition should be used instead 
! &mdash; <i>end drafting note</i>]</p>
  
  <blockquote>
! <p>
! <strong>constant subexpression</strong> [defns.const.subexpr]
! <p/>
! an expression whose evaluation as subexpression of a <em>conditional-expression</em> <em>CE</em> (5.16 [expr.cond]) 
! would not prevent <em>CE</em> from being a core constant expression (5.20 [expr.const]).
! </p>
  </blockquote>
+ </li>
+ 
+ <li><p>Insert a new paragraph following 19.3 [assertions] p1 as indicated:</p>
+ 
+ <blockquote>
+ <p>
+ <ins>-?- An expression <tt>assert(<em>E</em>)</tt> is a constant subexpression ( [defns.const.subexpr]), if either</ins>
+ </p>
+ <ul>
+ <li><p><ins><tt>NDEBUG</tt> is defined at the point where <tt>assert(<em>E</em>)</tt> appears, or</ins></p></li>
+ <li><p><ins><tt><em>E</em></tt> contextually converted to <tt>bool</tt> (4 [conv]), is a constant subexpression 
+ that evaluates to the value <tt>true</tt>.</ins></p></li>
+ </ul>
  </blockquote>
+ </li>
  
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2236"></a>2236. <tt>kill_dependency</tt> unconditionally noexcept</h3>
! <p><b>Section:</b> 29.2 [atomics.syn], 29.3 [atomics.order] <b>Status:</b> <a href="lwg-active.html#SG1">SG1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-01-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.syn">issues</a> in [atomics.syn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#SG1">SG1</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The "magic" <tt>kill_dependency</tt> function is a function without any constraints on the template parameter <tt>T</tt> 
! and is specified as
! </p>
! 
! <blockquote><pre>
! template &lt;class T&gt;
! T kill_dependency(T y) noexcept;
  </pre><blockquote>
! <p>
! -14- <i>Effects</i>: The argument does not carry a dependency to the return value (1.10).
! <p/>
! -15- <i>Returns</i>: <tt>y</tt>.
! </p>
  </blockquote></blockquote>
  
! <p>
! I wonder whether the unconditional <tt>noexcept</tt> is really intended here:
! Assume we have some type <tt>U</tt> that has a potentially throwing move
! constructor (or it has a potentially throwing copy constructor and no
! move constructor), for any "normal" function template with the same
! signature and the same effects (modulo the dependency magic) this
! would mean that it cannot safely be declared <tt>noexcept</tt> because of the
! return statement being part of the complete function call affected by
! <tt>noexcept</tt> (The by-value function argument is irrelevant in this
! context). In other words it seems that a function call such as
! </p>
! 
! <blockquote><pre>
! struct S {
!   ...
!   S(const S&amp; r) { if(<em>some condition</em>) throw Something(); }
!   ...
! };
! 
! int main() {
!   S s1 = ...;
!   S s2 = std::kill_dependency(s1);
! }
! </pre></blockquote>
! 
! <p>
! would be required to call <tt>std::terminate</tt> if the copy constructor of <tt>S</tt> throws during the return 
! of <tt>std::kill_dependency</tt>.
! <p/>
! To require copy elision for this already magic function would look like a low-hanging fruit to solve this problem, 
! but this case is not covered by current copy elision rules see 12.8 p31 b1:
! <p/>
! "&mdash; in a return statement in a function with a class return type, when the expression is the name of a non-volatile 
! automatic object (other than a function or catch-clause parameter) with the same <em>cv</em>-unqualified type as the 
! function return type, the copy/move operation can be omitted by constructing the automatic object directly into the
! function's return value".
! <p/>
! Some options come into my mind:
! </p>
! <ol>
! <li><p>
! Make the exception-specification a constrained one in regard via <tt>std::is_nothrow_move_constructible</tt>:
! </p>
! 
! <blockquote><pre>
! template &lt;class T&gt;
! T kill_dependency(T y) noexcept(<em>see below</em>);
! </pre></blockquote>
! 
! <p>
! This is similar to the approach taken for function templates such as <tt>std::swap</tt>.
! </p>
! </li>
! 
! <li><p>
! Use perfect forwarding (This needs further wording to correct the effects):
! </p>
! 
! <blockquote><pre>
! template &lt;class T&gt;
! T&amp;&amp; kill_dependency(T&amp;&amp; y) noexcept;
! </pre></blockquote>
! </li>
! 
! <li><p>
! Impose constraints on the template arguments in regard to throwing exceptions while copying/moving.
! </p></li>
! 
! <li><p>
! Keep the state as it is but possibly add a note about a call of <tt>std::terminate</tt> in above scenario.
! </p></li>
! </ol>
! 
! <p>
! A second problem is that the current wording is not clear whether it is well-defined to call the function with
! types that are reference types, such as in the following example:
! </p>
! 
! <blockquote><pre>
! #include &lt;atomic&gt;
! 
! int main()
! {
!   int a = 12;
!   int&amp; b = std::kill_dependency&lt;int&amp;&gt;(a);
! }
! </pre></blockquote>
! 
! <p>
! It is unclear what kind of dependency is killed here. This is presumably a core language problem, but could
! affect the possible resolutions of the problem.
! </p>
! 
! <p><i>[2014-11 Urbana]</i></p>
! 
! <p>
! Recommend using a revised example:
! </p>
! <blockquote><pre>
! int lookup(class D* p) 
! {
!   class E* q = p-&gt;a.load(memory_order_consume);
!   int y = std::kill_dependency(q-&gt;y);
! }
! </pre></blockquote>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2237"></a>2237. <tt>&lt;cuchar&gt;</tt> macros</h3>
! <p><b>Section:</b> 21.8 [c.strings] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jason Merrill <b>Opened:</b> 2013-01-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.strings">active issues</a> in [c.strings].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.strings">issues</a> in [c.strings].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Apparently C1X changes <tt>__STDC_UTF_16__</tt> and <tt>__STDC_UTF_32__</tt> from macros
! defined in <tt>uchar.h</tt> (and reflected in C++ by Table 79) to be predefined by the compiler. 
! Do we want to do the same?
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2238"></a>2238. Problematic iterator-pair constructor of containers</h3>
! <p><b>Section:</b> 21.8 [c.strings] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Johannes Schaub <b>Opened:</b> 2013-02-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.strings">active issues</a> in [c.strings].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.strings">issues</a> in [c.strings].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The non-explicit nature of the iterator-pair constructor of containers, such a
! </p>
! 
! <blockquote><pre>
! template &lt;class InputIterator&gt;
! vector(InputIterator first, InputIterator last, const Allocator&amp; = Allocator());
! </pre></blockquote>
! 
! <p>
! can be selected in unexpected situations, leading to a hard runtime error, as demonstrated by the following example:
! </p>
! 
! <blockquote><pre>
! #include &lt;vector&gt;
! 
! void f(std::vector&lt;char&gt; v){ /* ... */}
! 
! int main() {
!   f({"A", "B"});
! }
! </pre></blockquote>
! 
! <p>
! The actually intended initializer-list constructor isn't feasible here, so the best match is the constructor template
! </p>
! 
! <blockquote><pre>
! template &lt;class InputIterator&gt;
! vector(InputIterator first, InputIterator last, const Allocator&amp; = Allocator());
! </pre></blockquote>
! 
! <p>
! This compiles, but will result in code running amok. The potential trap (that cannot be easily detected by the
! library implementation) could be reduced by making this constructor explicit. It would still have the effect to 
! be selected here, but the code would be ill-formed, so the programmer gets a clear meassage here.
! </p>
! 
! <p><i>[2014-06 Rapperswil]</i></p>
! 
! <p>
! JW: can't fix this, don't want to touch this, Do The Right Thing clause has been a source of tricky issues. 
! only really happens with string literals, that's the only way to create an array that isn't obviously an array
! <p/>
! GR: want to see paper
! <p/>
! AM: is it only string literals, or also UDLs?
! <p/>
! STL: maybe, but we don't need to deal with that. This is only a problem in a very specific case 
! <p/>
! Leave as Open. 
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2241"></a>2241. <tt>&lt;cstdalign&gt;</tt> and <tt>#define</tt> of <tt>alignof</tt></h3>
! <p><b>Section:</b> 18.10 [support.runtime] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2013-02-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#support.runtime">active issues</a> in [support.runtime].</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.runtime">issues</a> in [support.runtime].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! According to 18.10 [support.runtime] p2:
! </p>
! 
! <blockquote><p>
! The contents of these headers are the same as the Standard C library headers [..], <tt>&lt;stdalign.h&gt;</tt>, [..]
! </p></blockquote>
! 
! <p>
! Since our base C standard is C99, which doesn't have a <tt>&lt;stdalign.h&gt;</tt>, the reference to a non-existing 
! C header is irritating (In this context <tt>&lt;stdalign.h&gt;</tt> doesn't refer to the deprecated C++ header
! <tt>&lt;stdalign.h&gt;</tt> described in D.5 [depr.c.headers]).
! <p/>
! Furthermore, it would be also important that it doesn not define a macro named <tt>alignof</tt>, which C11 also defines 
! in this header. 
! <p/>
! Currently we only have the following guarantee as part of 18.10 [support.runtime] p7:
! </p>
! 
! <blockquote><p>
! The header <tt>&lt;cstdalign&gt;</tt> and the header <tt>&lt;stdalign.h&gt;</tt> shall not define a macro named 
! <tt>alignas</tt>.
! </p></blockquote>
! 
! <p>
! It is unclear what the better strategy is: Striking the reference to <tt>&lt;stdalign.h&gt;</tt> in
! 18.10 [support.runtime] p2 or upgrading to C11 as new base C standard.
! </p>
! 
! <p><i>[2014-02-15 Issaquah]</i></p>
! 
! <p>
! STL: related to earlier issue on C4, <a href="lwg-active.html#2201">2201</a>, and now we get a C11 header
! </p>
! <p>
! JY: find _Alignof as keyword C11 FDIS has four defines in stdalign.h
! </p>
! <p>
! AM: need paper for C11 as base library we should really do that
! </p>
! <p>
! STL: really need vendor input
! </p>
! <p>
! STL: don't think we need to do anything right now not P1
! </p>
! <p>
! AM: any objections to downscale to P2  (no objections)
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2242"></a>2242. <tt>[uninitialized_]copy_n()</tt> defect</h3>
! <p><b>Section:</b> 25.3.1 [alg.copy], 20.7.12.2 [uninitialized.copy] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Sean Parent <b>Opened:</b> 2013-02-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#alg.copy">active issues</a> in [alg.copy].</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.copy">issues</a> in [alg.copy].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>copy_n()</tt> and <tt>uninitialized_copy_n()</tt> only return the output iterator, and not the input iterator. 
! Likely the interface was simply copied from the original STL. Unfortunately the interface in the original STL contains a bug.
! <p/>
! <tt>copy_n()</tt> and <tt>uninitialized_copy_n()</tt> must return the resulting input iterator as well as the output 
! iterator (I would suggest returning a pair). Without this, there is no way to continue reading from an actual input 
! iterator &mdash; and if it is really a forward iterator, it will cost <tt>n</tt> increments to get back to where you were.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2243"></a>2243. <tt>istream::putback</tt> problem</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Juan Soulie <b>Opened:</b> 2013-03-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 27.7.2.3 [istream.unformatted] / 34, when describing <tt>putback</tt>, it says that "<tt>rdbuf-&gt;sputbackc()</tt>" 
! is called. The problem are not the obvious typos in the expression, but the fact that it may lead to different 
! interpretations, since nowhere is specified what the required argument to <tt>sputbackc</tt> is.
! <p/>
! It can be guessed to be "<tt>rdbuf()-&gt;sputbackc(c)</tt>", but "<tt>rdbuf()-&gt;sputbackc(char_type())</tt>" or 
! just anything would be as conforming (or non-confoming) as the first guess.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2244"></a>2244. Issue on <tt>basic_istream::seekg</tt></h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Juan Soulie <b>Opened:</b> 2013-03-04 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! When issue <a href="lwg-defects.html#1445">1445</a> was resolved by adopting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">N3168</a>, it exposed the need to 
! modify both overloads of <tt>basic_istream::seekg</tt> (by inserting "the function clears eofbit," after "except that"), 
! but the fix applied to the text apparently forgets the second overload at 27.7.2.3 [istream.unformatted] p43.
! </p>
! 
! <p><i>[2013-10-17: Daniel provides concrete wording]</i></p>
! 
! 
! <p>
! It seems that the tiny sentence "SIMILARLY for 27.7.1.3/43 (<tt>seekg</tt>)." had been overlooked. I agree that the wording needs to be
! applied here as well.
! </p>
! 
! <p><i>[2015-05-06 Lenexa: Move to Ready]</i></p>
! 
! <p>MC: This was just missed when we added "the function first clears eofbit" to the other overload, Daniel agrees. Editing mistake.</p>
! <p>Move to Ready, consensus.</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 27.7.2.3 [istream.unformatted] p43 as indicated:</p>
! 
! <blockquote><pre>
! basic_istream&lt;charT,traits&gt;&amp; seekg(off_type off, ios_base::seekdir dir);
  </pre><blockquote>
! <p>
! -43- <i>Effects:</i> Behaves as an unformatted input function (as described in 27.7.2.3, paragraph 1), except
! that <ins>the function first clears <tt>eofbit</tt>,</ins> it does not count the number of characters extracted<ins>,</ins> 
! and does not affect the value returned by subsequent calls to <tt>gcount()</tt>. [&hellip;]
! </p>
  </blockquote></blockquote>
+ </li>
+ </ol>
  
  
! 
! 
! 
! <hr>
! <h3><a name="2245"></a>2245. <tt>packaged_task::reset()</tt> memory allocation</h3>
! <p><b>Section:</b> 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-03-05 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The effects of <tt>packaged_task::reset()</tt> result in memory allocation, but
! don't allow a user to provide an allocator.
! <p/>
! <tt>packaged_task::reset()</tt> needs to be overloaded like so:
! </p>
! 
! <blockquote><pre>
! template&lt;class Alloc&gt;  
! void reset(const Alloc&amp;);
! </pre></blockquote>
! 
! <p>
! Alternatively, the effects of <tt>reset()</tt> need to require the same allocator is used 
! as at construction, which would require the constructor to store the allocator for later use.
! <p/>
! I like to remark that GCC at the moment uses the second option, i.e. the allocator passed to the constructor 
! (if any) is used to create the new shared state, because this didn't require any change to the
! interface.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! No strong opinions in SG1, and this is really an LWG issue.  Back to you.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2248"></a>2248. <tt>numeric_limits::is_iec559</tt> misnamed</h3>
! <p><b>Section:</b> 18.3.2 [limits] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2013-03-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#limits">issues</a> in [limits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! This member should probably be named "is_ieee754". Or at least the standard should explain that IEC-559 no longer exists, 
! and that it's been superseded by IEEE-754.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2250"></a>2250. Follow-up On Library Issue 2207</h3>
! <p><b>Section:</b> 20.6.1 [bitset.cons], 20.6.2 [bitset.members], 21.4.2 [string.cons], 21.4.6 [string.modifiers], 21.4.7 [string.ops] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Frank Birbacher <b>Opened:</b> 2013-04-18 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitset.cons">issues</a> in [bitset.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Similar to LWG <a href="lwg-defects.html#2207">2207</a> there are several other places where the "Requires" clause precludes the "Throws" condition. 
! Searching for the <tt>out_of_range</tt> exception to be thrown, the following have been found (based on the working draft
! N3485):
! </p>
! 
! <ol>
! <li><p>20.6.1 [bitset.cons] p3+4</p></li>
! <li><p>20.6.2 [bitset.members] p13+14 (<tt>set</tt>)</p></li>
! <li><p>20.6.2 [bitset.members] p19+20 (<tt>reset</tt>)</p></li>
! <li><p>20.6.2 [bitset.members] p27+28 (<tt>flip</tt>)</p></li>
! <li><p>20.6.2 [bitset.members] p41+42 (<tt>test</tt>)</p></li>
! <li><p>21.4.2 [string.cons] p3+4</p></li>
! <li><p>21.4.6.2 [string::append] p3+4</p></li>
! <li><p>21.4.6.3 [string::assign] p4+5</p></li>
! <li><p>21.4.6.4 [string::insert] p1+2, p5+6, p9+10 (partially)</p></li>
! <li><p>21.4.6.5 [string::erase] p1+2</p></li>
! <li><p>21.4.6.6 [string::replace] p1+2, p5+6, p9+10 (partially)</p></li>
! <li><p>21.4.6.7 [string::copy] p1+2</p></li>
! <li><p>21.4.7.8 [string::substr] p1+2</p></li>
! </ol>
! 
! <p><i>[2013-10-15: Daniel provides wording]</i></p>
! 
! 
! <p>
! In addition to the examples mentioned in the discussion, a similar defect exists for <tt>thread</tt>'s <tt>join()</tt> 
! and <tt>detach</tt> functions (see 30.3.1.5 [thread.thread.member]). The suggested wording applies a similar fix for these
! as well.
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! STL : likes it<br/>
! DK : does it change behavior?<br/>
! Multiple : no<br/>
! Move to ready? Unanimous 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Modify 20.6.1 [bitset.cons] as indicated: <em>[Editorial comment: The wording form used to ammend the 
! <i>Throws</i> element is borrowed from a similar style used in 21.4.6.6 [string::replace] p10]</em></p>
! 
! <blockquote><pre>
! template &lt;class charT, class traits, class Allocator&gt;
! explicit
! bitset(const basic_string&lt;charT, traits, Allocator&gt;&amp; str,
!        typename basic_string&lt;charT, traits, Allocator&gt;::size_type pos = 0,
!        typename basic_string&lt;charT, traits, Allocator&gt;::size_type n =
!          basic_string&lt;charT, traits, Allocator&gt;::npos,
!          charT zero = charT('0'), charT one = charT('1'));
! </pre><blockquote>
! <p>
! <del>-3- <i>Requires:</i> <tt>pos &lt;= str.size()</tt>.</del>
! <p/>
! -4- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos &gt; str.size()</tt> <ins>or <tt>invalid_argument</tt> if an
! invalid character is found (see below)</ins>.
! <p/>
! -5- <i>Effects:</i> Determines the effective length <tt>rlen</tt> of the initializing string as the smaller of <tt>n</tt> and 
! <tt>str.size() - pos</tt>.
! <p/>
! The function then throws <tt>invalid_argument</tt> if any of the <tt>rlen</tt> characters in <tt>str</tt> beginning at position
! <tt>pos</tt> is other than <tt>zero</tt> or <tt>one</tt>. The function uses <tt>traits::eq()</tt> to compare the character values.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
+ </li>
  
! <li><p>Modify 20.6.2 [bitset.members] as indicated:</p>
! 
! <blockquote><pre>
! bitset&lt;N&gt;&amp; set(size_t pos, bool val = true);
  </pre><blockquote>
! <p>
! <del>-13- <i>Requires:</i> <tt>pos</tt> is valid</del>
! <p/>
! -14- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos</tt> does not correspond to a valid bit position.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
  
! <blockquote><pre>
! bitset&lt;N&gt;&amp; reset(size_t pos);
  </pre><blockquote>
! <p>
! <del>-19- <i>Requires:</i> <tt>pos</tt> is valid</del>
! <p/>
! -20- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos</tt> does not correspond to a valid bit position.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
  
! <blockquote><pre>
! bitset&lt;N&gt;&amp; flip(size_t pos);
  </pre><blockquote>
! <p>
! <del>-27- <i>Requires:</i> <tt>pos</tt> is valid</del>
! <p/>
! -28- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos</tt> does not correspond to a valid bit position.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
  
! <blockquote><pre>
! bool test(size_t pos) const;
  </pre><blockquote>
! <p>
! <del>-41- <i>Requires:</i> <tt>pos</tt> is valid</del>
! <p/>
! -42- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos</tt> does not correspond to a valid bit position.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
  
! </li>
! 
! <li><p>Modify 21.4.2 [string.cons] as indicated:</p>
! 
! <blockquote><pre>
! basic_string(const basic_string&amp; str,
!              size_type pos, size_type n = npos,
!              const Allocator&amp; a = Allocator());
  </pre><blockquote>
! <p>
! <del>-3- <i>Requires:</i> <tt>pos &lt;= str.size()</tt></del>
! <p/>
! -4- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos &gt; str.size()</tt>.
! </p>
  </blockquote></blockquote>
+ </li>
  
! <li><p>Modify 21.4.4 [string.capacity] as indicated:</p>
! 
! <blockquote><pre>
! void resize(size_type n, charT c);
  </pre><blockquote>
! <p>
! <del>-6- <i>Requires:</i> <tt>n &lt;= max_size()</tt></del>
! <p/>
! -7- <i>Throws:</i> <tt>length_error</tt> if <tt>n &gt; max_size()</tt>.
! </p>
  </blockquote></blockquote>
+ </li>
  
! <li><p>Modify 21.4.6.2 [string::append] as indicated:</p>
! 
! <blockquote><pre>
! basic_string&amp;
!   append(const basic_string&amp; str, size_type pos, size_type n = npos);
  </pre><blockquote>
! <p>
! <del>-3- <i>Requires:</i> <tt>pos &lt;= str.size()</tt></del>
! <p/>
! -4- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos &gt; str.size()</tt>.
! </p>
  </blockquote></blockquote>
+ </li>
  
! <li><p>Modify 21.4.6.3 [string::assign] as indicated:</p>
! 
! <blockquote><pre>
! basic_string&amp;
!   assign(const basic_string&amp; str, size_type pos, 
!          size_type n = npos);
  </pre><blockquote>
! <p>
! <del>-5- <i>Requires:</i> <tt>pos &lt;= str.size()</tt></del>
! <p/>
! -6- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos &gt; str.size()</tt>.
! </p>
  </blockquote></blockquote>
+ </li>
  
! <li><p>Modify 21.4.6.4 [string::insert] as indicated: <em>[Editorial note: The first change suggestion is also a bug fix
! of the current wording, because (a) the function has parameter <tt>pos1</tt> but the semantics refers to <tt>pos</tt> and (b) 
! it is possible that this function can throw <tt>length_error</tt>, see p10]</em></p>
! 
! <blockquote><pre>
! basic_string&amp;
!   insert(size_type pos<del>1</del>, const basic_string&amp; str);
  </pre><blockquote>
! <p>
! <del>-1- <i>Requires:</i> <tt>pos &lt;= size()</tt>.</del>
! <p/>
! <del>-2- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos &gt; size()</tt>.</del>
! <p/>
! -3- <i>Effects:</i> <del>Calls</del><ins>Equivalent to:</ins> <tt><ins>return</ins> insert(pos, str.data(), str.size())<ins>;</ins></tt><del>.</del>
! <p/>
! <del>-4- <i>Returns:</i> <tt>*this</tt>.</del>
! </p>
  </blockquote></blockquote>
  
! <blockquote><pre>
! basic_string&amp;
!   insert(size_type pos1, const basic_string&amp; str,
!          size_type pos2, size_type n = npos);
  </pre><blockquote>
! <p>
! <del>-5- <i>Requires:</i> <tt>pos1 &lt;= size()</tt> and <tt>pos2 &lt;= str.size()</tt>.</del>
! <p/>
! -6- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos1 &gt; size()</tt> or <tt>pos2 &gt; str.size()</tt>.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
  
! <blockquote><pre>
! basic_string&amp;
!   insert(size_type pos, const charT* s, size_type n);
  </pre><blockquote>
! <p>
! -9- <i>Requires:</i> <tt>s</tt> points to an array of at least <tt>n</tt> elements of <tt>charT</tt> <del>and 
! <tt>pos &lt;= size()</tt></del>.
! <p/>
! -10- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos &gt; size()</tt> or <tt>length_error</tt> if <tt>size() + n &gt; max_size()</tt>.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
  
! <blockquote><pre>
! basic_string&amp;
!   insert(size_type pos, const charT* s);
  </pre><blockquote>
! <p>
! -13- <i>Requires:</i> <del><tt>pos &lt;= size()</tt> and</del> <tt>s</tt> points to an array of at least 
! <tt>traits::length(s) + 1</tt> elements of <tt>charT</tt>.
! <p/>
! -14- <i>Effects:</i> Equivalent to <tt><ins>return</ins> insert(pos, s, traits::length(s))<ins>;</ins></tt><del>.</del>
! <p/>
! <del>-15- <i>Returns:</i> <tt>*this</tt>.</del>
! </p>
  </blockquote></blockquote>
  </li>
  
! <li><p>Modify 21.4.6.5 [string::erase] as indicated:</p>
  
! <blockquote><pre>
! basic_string&amp; erase(size_type pos = 0, size_type n = npos);
! </pre><blockquote>
! <p>
! <del>-1- <i>Requires:</i> <tt>pos &lt;= size()</tt></del>
! <p/>
! -2- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos &gt; size()</tt>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
  </li>
! 
! <li><p>Modify 21.4.6.6 [string::replace] as indicated: <em>[Editorial note: The first change suggestion is also a bug fix
! of the current wording, because it is possible that this function can throw <tt>length_error</tt>, see p10]</em></p>
! 
! <blockquote><pre>
! basic_string&amp;
!   replace(size_type pos1, size_type n1,
!           const basic_string&amp; str);
  </pre><blockquote>
! <p>
! <del>-1- <i>Requires:</i> <tt>pos1 &lt;= size()</tt>.</del>
! <p/>
! <del>-2- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos1 &gt; size()</tt>.</del>
! <p/>
! -3- <i>Effects:</i> <del>Calls</del><ins>Equivalent to</ins> <tt><ins>return</ins> replace(pos1, n1, str.data(), str.size())<ins>;</ins></tt><del>.</del>
! <p/>
! <del>-4- <i>Returns:</i> <tt>*this</tt>.</del>
! </p>
  </blockquote></blockquote>
  
! <blockquote><pre>
! basic_string&amp;
!   replace(size_type pos1, size_type n1,
!           const basic_string&amp; str,
!           size_type pos2, size_type n = npos);
  </pre><blockquote>
! <p>
! <del>-5- <i>Requires:</i> <tt>pos1 &lt;= size()</tt> and <tt>pos2 &lt;= str.size()</tt>.</del>
! <p/>
! -6- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos1 &gt; size()</tt> or <tt>pos2 &gt; str.size()</tt>.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
  
! <blockquote><pre>
! basic_string&amp;
!   replace(size_type pos1, size_type n1, const charT* s, size_type n2);
  </pre><blockquote>
! <p>
! -9- <i>Requires:</i> <del><tt>pos1 &lt;= size()</tt> and</del> <tt>s</tt> points to an array of at least <tt>n2</tt> elements 
! of <tt>charT</tt>.
! <p/>
! -10- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos1 &gt; size()</tt> or <tt>length_error</tt> if the length of the resulting 
! string would exceed <tt>max_size()</tt> (see below).
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
  
! <blockquote><pre>
! basic_string&amp;
!   replace(size_type pos, size_type n, const charT* s);
  </pre><blockquote>
! <p>
! -13- <i>Requires:</i> <del><tt>pos &lt;= size()</tt> and</del> <tt>s</tt> points to an array of at least 
! <tt>traits::length(s) + 1</tt> elements of <tt>charT</tt>.
! <p/>
! -14- <i>Effects:</i> Equivalent to <tt><ins>return</ins> replace(pos, n, s, traits::length(s))<ins>;</ins></tt><del>.</del>
! <p/>
! <del>-15- <i>Returns:</i> <tt>*this</tt>.</del>
! </p>
  </blockquote></blockquote>
  
! </li>
! 
! <li><p>Modify 21.4.6.7 [string::copy] as indicated:</p>
! 
! <blockquote><pre>
! size_type copy(charT* s, size_type n, size_type pos = 0) const;
  </pre><blockquote>
! <p>
! <del>-1- <i>Requires:</i> <tt>pos &lt;= size()</tt></del>
! <p/>
! -2- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos &gt; size()</tt>.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
+ </li>
  
! <li><p>Modify 21.4.7.8 [string::substr] as indicated:</p>
! 
! <blockquote><pre>
! basic_string substr(size_type pos = 0, size_type n = npos) const;
  </pre><blockquote>
! <p>
! <del>-1- <i>Requires:</i> <tt>pos &lt;= size()</tt></del>
! <p/>
! -2- <i>Throws:</i> <tt>out_of_range</tt> if <tt>pos &gt; size()</tt>.
! <p/>
! [&hellip;]
! </p>
  </blockquote></blockquote>
+ </li>
+ 
+ <li><p>Modify 30.3.1.5 [thread.thread.member] as indicated:</p>
  
+ <blockquote><pre>
+ void join();
+ </pre><blockquote>
+ <p>
+ <del>-3- <i>Requires:</i> <tt>joinable()</tt> is true.</del>
+ <p/>
+ [&hellip;]
+ <p/>
+ -7- <i>Throws:</i> <tt>system_error</tt> when an exception is required (30.2.2).
+ <p/>
+ -8- <i>Error conditions:</i>
+ </p>
+ <ul>
+ <li><p>[&hellip;]</p></li>
+ <li><p><tt>invalid_argument</tt> &mdash; if the thread is not joinable.</p></li>
+ </ul>
+ </blockquote></blockquote>
+ 
+ <blockquote><pre>
+ void detach();
+ </pre><blockquote>
+ <p>
+ <del>-9- <i>Requires:</i> <tt>joinable()</tt> is true.</del>
+ <p/>
+ [&hellip;]
+ <p/>
+ -12- <i>Throws:</i> <tt>system_error</tt> when an exception is required (30.2.2).
+ <p/>
+ -13- <i>Error conditions:</i>
+ </p>
+ <ul>
+ <li><p>[&hellip;]</p></li>
+ <li><p><tt>invalid_argument</tt> &mdash; if the thread is not joinable.</p></li>
+ </ul>
+ </blockquote></blockquote>
  </li>
+ 
  </ol>
  
  
*************** therefore all of them are defined. Below
*** 4977,5286 ****
  
  
  <hr>
! <h3><a name="1408"></a>1408. [FCD] Allow recycling of pointers after <tt>undeclare_no_pointers</tt></h3>
! <p><b>Section:</b> 20.9.11 [util.dynamic.safety] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.dynamic.safety">issues</a> in [util.dynamic.safety].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-103</b></p>
  <p>
! The precondition to calling <tt>declare_no_pointers</tt> is that no
! bytes in the range "have been previously registered" with
! this call. As written, this precondition includes bytes in
! ranges, even after they have been explicitly unregistered
! with a later call to <tt>undeclare_no_pointers</tt>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Update 20.9.11 [util.dynamic.safety] p.9:
  </p>
! <blockquote><pre>void declare_no_pointers(char *p, size_t n);
! </pre><blockquote>
! <tt>9</tt> <em>Requires</em>: No bytes in the specified range <del>have been
! previously registered</del><ins>are currently registered</ins> with <tt>declare_no_pointers()</tt>.
! If the specified range is in an allocated object, then it must be entirely within a single allocated object.
! The object must be live until the corresponding <tt>undeclare_no_pointers()</tt> call. [..]
! </blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1413"></a>1413. [FCD] Specify whether <tt>high_resolution_clock</tt> is a distinct type or a typedef</h3>
! <p><b>Section:</b> 20.11.5.3 [time.clock.hires] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">Tentatively NAD</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively NAD">Tentatively NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-112</b></p>
  <p>
! What it means for <tt>high_resolution_clock</tt> to be a synonym
! is undefined. If it may or may not be a typedef, then
! certain classes of programs become unportable.
  </p>
! 
! <p><i>[
! Resolution proposed in ballot comment
! ]</i></p>
! 
  <p>
! Require that it be a distinct class type.
  </p>
  
! <p><i>[
! 2010 Batavia
! ]</i></p>
  
  <p>
! This is not a defect.  Threre are a number of places in the standard where
! we allow implentations to choose their preferred technique, the most obvious
! example being the <tt>iterator</tt>/<tt>const_iterator</tt> types of <tt>set</tt>.
  </p>
  <p>
! Typically, this means it is not portable to declare function overloads that differ
! only in their use of these types.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1418"></a>1418. [FCD] Effects of <tt>resize(size())</tt> on a <tt>deque</tt></h3>
! <p><b>Section:</b> 23.3.2.2 [deque.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#deque.capacity">issues</a> in [deque.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-113</b></p>
  <p>
! There is no mention of what happens if <tt>sz==size()</tt>. While
! it obviously does nothing I feel a standard needs to say
! this explicitely.
  </p>
  
  
! <p><i>[
! 2010 Batavia
! ]</i></p>
  
  <p>
! Accepted with a simplified resolution turning one of the <tt>&lt;</tt>
! comparisons into <tt>&lt;=.</tt>
  </p>
  
  <p><b>Proposed resolution:</b></p>
! <p>Ammend [deque.capacity]</p>
  <blockquote>
- </blockquote>
- <p><tt>void resize(size_type sz);</tt></p>
  <p>
! <i>Effects</i>: If <tt>sz &lt;<ins>=</ins> size()</tt>, equivalent to <tt>erase(begin() +
! sz, end());</tt>. If <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> <del>default 
! constructed</del><ins>value initialized</ins> elements to the sequence.
  </p>
  
  
  
  
  
  <hr>
! <h3><a name="1420"></a>1420. [FCD] Effects of <tt>resize(size())</tt> on a <tt>list</tt></h3>
! <p><b>Section:</b> 23.3.4.2 [list.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.capacity">issues</a> in [list.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
- <p><b>Addresses GB-115</b></p>
  <p>
! There is no mention of what happens if <tt>sz==size()</tt>. While
! it obviously does nothing I feel a standard needs to say
! this explicitely.
  </p>
  
! <p><i>[
! Resolution proposed in ballot comment
! ]</i></p>
  
  <p>
! Express the semantics as pseudo-code similarly
! to the way it is done for the copying overload that
! follows (in p3). Include an else clause that does
! nothing and covers the <tt>sz==size()</tt> case.
  </p>
  
! <p><i>[
! 2010 Batavia
! ]</i></p>
  
  <p>
- Accepted with a simplified resolution turning one of the <tt>&lt;</tt>
- comparisons into <tt>&lt;=.</tt>
  </p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Ammend [list.capacity] p1:
  </p>
! <blockquote>
! <p><tt>void resize(size_type sz);</tt></p>
! <blockquote>
! <i>Effects</i>: If <tt>sz &lt;<ins>=</ins> size()</tt>, equivalent to <tt>list&lt;T&gt;::iterator
! it = begin(); advance(it, sz); erase(it, end());</tt>. If
! <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> <del>default constructed</del>
! <ins>value initialized</ins> elements to the sequence<del></del>.
! </blockquote>
  </blockquote>
  
  
  
  
  
  
  <hr>
! <h3><a name="1421"></a>1421. [FCD] Accidental move-only library types due to new core language rules</h3>
! <p><b>Section:</b> 23.5 [container.adaptors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1350">1350</a></p>
  <p><b>Discussion:</b></p>
  
- <p><b>Addresses DE-22, CH-15</b></p>
  <p>
! With the final acceptance of move operations as special
! members and introduction of corresponding suppression
! rules of implicitly generated copy operations the some
! library types that were copyable in C++03 are no longer
! copyable (only movable) in C++03, among them <tt>queue</tt>,
! <tt>priority_queue</tt>, and <tt>stack</tt>.
  </p>
  
! <p><i>[
! 2010-10-26: Daniel comments:
! ]</i></p>
  
  
  <p>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3112.pdf">n3112</a> should fix this.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3112.pdf">n3112</a>
  
  
  
  
  
  <hr>
! <h3><a name="1438"></a>1438. [FCD] No definition for <tt>base()</tt></h3>
! <p><b>Section:</b> 26.5.4.1 [rand.adapt.disc] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.adapt.disc">issues</a> in [rand.adapt.disc].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-126</b></p>
  
! Each adaptor has a member function called <tt>base()</tt> which has no definition.
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
! <blockquote>
! Give it the obvious definition.
! </blockquote>
  
- <p><i>[
- 2010-11-03 Daniel comments and provides a proposed resolution:
- ]</i></p>
  
  
! <p>The following proposal adds <tt>noexcept</tt> specifiers to the declarations of
! the <tt>base()</tt> functions as replacement for a "<i>Throws</i>: Nothing" element.
  </p>
  
! <p><i>[
! 2010 Batavia: The working group reviewed this issue, and recommended to add the following to the Proposed Resolution.
! </i></p><ul><li><i>
! Append to paragraph 1 of [rand.req.adapt] (or at the Editor's discretion insert as a new paragraph following that paragraph): 
! The expression <tt>a.base()</tt> shall be valid and shall return a const reference to <tt>a</tt>'s base engine. 
! </i></li><i>
! </i></ul><i>
! After further review, the working group concurred with the Proposed Resolution.
! ]</i><p></p>
  
  
! <p><i>[Batavia: waiting for WEB to review wording]</i></p>
  
  
  
  
! <p><b>Proposed resolution:</b></p>
  <ol>
  <li>
! Add the following sentence to the end of 26.5.1.5 [rand.req.adapt]/1:
! <blockquote>
! A <i>random number engine adaptor</i> (commonly shortened to <i>adaptor</i>) <tt>a</tt> of type <tt>A</tt> is a
! random number engine that takes values produced by some other random number engine, and applies an algorithm to
! those values in order to deliver a sequence of values with different randomness properties. An engine <tt>b</tt>
! of type <tt>B</tt> adapted in this way is termed a <i>base engine</i> in this context.<ins> The expression
! <tt>a.base()</tt> shall be valid and shall return a const reference to <tt>a</tt>'s base engine.</ins>
! </blockquote>
  </li>
! <li>Change in [rand.adapt.disc]/3, class template <tt>discard_block_engine</tt> synopsis, the following declaration:
! <blockquote><pre>// <em>property functions</em>
! const Engine&amp; base() const <ins>noexcept</ins>;
! </pre></blockquote>
  </li>
! <li>Add the following new prototype description at the end of sub-clause 26.5.4.1 [rand.adapt.disc]:
! <blockquote>
! <pre><ins>const Engine&amp; base() const noexcept;</ins>
! </pre>
! <blockquote>
! <ins>? <i>Returns</i>: <tt>e</tt>.</ins>
! </blockquote>
  </blockquote>
  </li>
! <li>Change in [rand.adapt.ibits]/4, class template <tt>independent_bits_engine</tt> synopsis, the following declaration:
! <blockquote><pre>// <em>property functions</em>
! const Engine&amp; base() const <ins>noexcept</ins>;
! </pre></blockquote>
! </li>
! <li>Add the following new prototype description at the end of sub-clause 26.5.4.2 [rand.adapt.ibits]:
! <blockquote>
! <pre><ins>const Engine&amp; base() const noexcept;</ins>
! </pre>
! <blockquote>
! <ins>? <i>Returns</i>: <tt>e</tt>.</ins>
! </blockquote>
  </blockquote>
! </li>
! <li>Change in 26.5.4.3 [rand.adapt.shuf]/3, class template <tt>shuffle_order_engine</tt> synopsis, the following declaration:
! <blockquote><pre>// <em>property functions</em>
! const Engine&amp; base() const <ins>noexcept</ins>;
  </pre></blockquote>
! </li>
! <li>Add the following new prototype description at the end of sub-clause 26.5.4.3 [rand.adapt.shuf]:
  <blockquote>
! <pre><ins>const Engine&amp; base() const noexcept;</ins>
  </pre>
- <blockquote>
- <ins>? <i>Returns</i>: <tt>e</tt>.</ins>
  </blockquote>
  </blockquote>
  </li>
  </ol>
  
--- 17884,18784 ----
  
  
  <hr>
! <h3><a name="2253"></a>2253. [arrays.ts] <tt>dynarray</tt> should state which container requirements aren't met</h3>
! <p><b>Section:</b> X [dynarray.overview] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-04-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses: arrays.ts</b></p>
! 
  <p>
! X [dynarray.overview] p2 says:
! </p>
! <blockquote>
! <p>
! "Unless otherwise specified, all <tt>dynarray</tt> operations have the same requirements and semantics as specified in
! 23.2 [container.requirements]."
! </p>
! </blockquote>
! <p>
! Some differences from 23.2 [container.requirements] are not explicitly specified, including at
! least the lack of a default constructor, copy assignment and <tt>swap</tt> member.
! <p/>
! The wording could be similar to 23.3.2.1 [array.overview] which says "An array satisfies all of the requirements 
! of a container and of a reversible container (23.2 [container.requirements]), except that a default constructed 
! array object is not empty and that <tt>swap</tt> does not have constant complexity."
! </p>
! 
! <p><i>[2013-09 Chicago:]</i></p>
! 
! <p>
! Move to Deferred. This feature will ship after C++14 and should be revisited then.
  </p>
  
+ <p><i>[2014-06-06 pre-Rapperswil]</i></p>
+ 
+ <p>
+ This issue has been reopened as arrays-ts.
+ </p>
+ 
+ <p><i>[2014-06-16 Rapperswil]</i></p>
+ 
+ <p>
+ Move to Ready
+ </p>
+ 
+ <p><i>[2014/11 Urbana]</i></p>
+ 
+ <p>
+ Held at Ready status, pending clarification of Arrays TS
+ </p>
+ 
+ 
  
  <p><b>Proposed resolution:</b></p>
+ 
+ <ol>
+ <li><p>Add to X [dynarray.overview] p2:</p>
  <p>
! -2- <ins>A <tt>dynarray</tt> satisfies all of the requirements of a container and of a reversible container 
! (23.2 [container.requirements]), except for default construction, assignment and <tt>swap</tt>.</ins> Unless 
! otherwise specified, all <tt>dynarray</tt> operations have the same requirements and semantics as specified in 
! 23.2 [container.requirements].
  </p>
! </li>
! </ol>
! 
  
  
  
  
  
  <hr>
! <h3><a name="2254"></a>2254. [arrays.ts] Is <tt>dynarray</tt> an allocator-aware container?</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-04-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses: arrays.ts</b></p>
! 
  <p>
! 23.2.1 [container.requirements.general] p3 says:
  </p>
! <blockquote>
  <p>
! "All of the containers defined in this Clause and in (21.4) except <tt>array</tt> meet the additional requirements 
! of an allocator-aware container, as described in Table 99."
! </p>
! </blockquote>
! <p>
! Is this true of <tt>dynarray</tt>?  I believe the answer must be no because <tt>dynarray</tt> has no <tt>allocator_type</tt>, 
! and morally should be no, so that operations are defined in terms of <tt>std::allocator&lt;T&gt;</tt>, which p13 says
! doesn't actually need to be used (which allows the elements to be default-initialized as is intended, rather than 
! "default-inserted into the container" using an allocator.)
! <p/>
! The requirement that "each element is constructed with uses-allocator construction" provides roughly equivalent behaviour 
! to the "<em>CopyInsertable into <tt>X</tt></em>" requirements for allocator-aware containers, allowing an allocator to 
! control construction of the <tt>dynarray</tt> elements.
  </p>
  
! <p><i>[2013-09 Chicago]</i></p>
  
  <p>
! Move to Deferred. This feature will ship after C++14 and should be revisited then.
  </p>
+ 
+ <p><i>[2014-06-06 pre-Rapperswill]</i></p>
+ 
  <p>
! This issue has been reopened as arrays-ts.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
+ <ol>
+ <li><p>Change to 23.2.1 [container.requirements.general] p13:</p>
+ <p>
+ -13- All of the containers defined in this Clause and in (21.4) except <tt>array</tt> <ins>and <tt>dynarray</tt></ins> 
+ meet the additional requirements of an allocator-aware container, as described in Table 99.
+ </p>
+ </li>
+ </ol>
+ 
+ 
  
  
  
  
  <hr>
! <h3><a name="2255"></a>2255. [arrays.ts] <tt>dynarray</tt> constructor ambiguity</h3>
! <p><b>Section:</b> X [dynarray.cons] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-04-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses: arrays.ts</b></p>
! 
  <p>
! These constructors can interact badly::
! </p>
! <blockquote><pre>
! template&lt;class Alloc&gt;
!   dynarray(size_type c, const Alloc&amp; alloc);
! dynarray(size_type c, const T&amp; v);
! </pre></blockquote>
! <p>
! Unless the second argument is a value of exactly the type <tt>T</tt> you will get the first constructor, i.e. 
! all of these will fail to compile:
! </p>
! <blockquote><pre>
! dynarray&lt;long&gt; dlong(1, 1);   // 1 is not long
! dynarray&lt;float&gt; dflt(1, 1.0);  // 1.0 is not float
! dynarray&lt;int*&gt; dptr(1, nullptr);  // nullptr is not int*
! dynarray&lt;void*&gt; doh(1, 0);  // 0 is not void*
! </pre></blockquote>
! <p>
! The <tt>nullptr</tt> case is particularly annoying, a user trying to do the right thing by saying <tt>nullptr</tt> 
! instead of <tt>NULL</tt> still gets the wrong result.
! <p/>
! The constructor taking an allocator requires that "<tt>Alloc</tt> shall meet the requirements for an Allocator" 
! but doesn't actually say "shall not participate in overload resolution unless ..."
! <p/>
! I believe we have no precedent for using SFINAE to check "the requirements for an Allocator" because it's 
! a pretty complicated set of requirements. We could say it shall not participate in overload resolution if <tt>Alloc</tt> 
! is implicitly convertible to <tt>value_type</tt>.
! <p/>
! Alternatively, we could follow the same approach used by other types that can be constructed with an unconstrained 
! allocator type and use <tt>std::allocator_arg_t</tt> as the first argument instead of adding an allocator after the 
! other arguments.
  </p>
  
+ <p><i>[2013-09 Chicago:]</i></p>
  
! <p>
! Move to Deferred. This feature will ship after C++14 and should be revisited then.
! </p>
! 
! <p><i>[2014-06-06 pre-Rapperswil]</i></p>
  
  <p>
! This issue has been reopened as arrays-ts.
  </p>
  
+ <p><i>[2014-06-16 Rapperswil]</i></p>
+ 
+ <p>
+ Move to Ready for alternative A
+ </p>
+ 
+ <strong>Previous resolution [SUPERSEDED]:</strong>
+ <p/>
+ <blockquote class="note"> 
+ <ol style="list-style-type:upper-alpha">
+ <li>
+ <p>
+ <em>Either</em> use the correct way to unambiguously call a constructor taking any type of allocator, i.e. change the 
+ constructors to take <tt>dynarray(std::allocator_arg_t, const Alloc&amp;, ...)</tt> by modifying both the synopsis
+ X [dynarray.overview] p2 and X [dynarray.cons] before p9 like so:</p>
+ 
+ <blockquote><pre>
+ template &lt;class Alloc&gt;
+   dynarray(<ins>allocator_arg_t, const Alloc&amp; a, </ins>size_type c<del>, const Alloc&amp; alloc</del>);
+ template &lt;class Alloc&gt;
+   dynarray(<ins>allocator_arg_t, const Alloc&amp; a, </ins>size_type c, const T&amp; v<del>, const Alloc&amp; alloc</del>);
+ template &lt;class Alloc&gt;
+   dynarray(<ins>allocator_arg_t, const Alloc&amp; a, </ins>const dynarray&amp; d<del>, const Alloc&amp; alloc</del>);
+ template &lt;class Alloc&gt;
+   dynarray(<ins>allocator_arg_t, const Alloc&amp; a, </ins>initializer_list&lt;T&gt;<del>, const Alloc&amp; alloc</del>);
+ </pre></blockquote>
+ 
+ </li>
+ 
+ <li><p><em>or</em> constrain the problematic constructor by adding a new paragraph to X [dynarray.cons]:</p>
+ <blockquote><pre>
+ template &lt;class Alloc&gt;
+   dynarray(size_type c, const Alloc&amp; alloc);
+ template &lt;class Alloc&gt;
+   dynarray(size_type c, const T&amp; v, const Alloc&amp; alloc);
+ template &lt;class Alloc&gt;
+   dynarray(const dynarray&amp; d, const Alloc&amp; alloc);
+ template &lt;class Alloc&gt;
+   dynarray(initializer_list&lt;T&gt;, const Alloc&amp; alloc);
+ </pre><blockquote>
+ <p>
+ -9- <i>Requires</i>: <tt>Alloc</tt> shall meet the requirements for an Allocator (17.6.3.5 [allocator.requirements]).
+ <p/>
+ -10- <i>Effects</i>: Equivalent to the preceding constructors except that each element is constructed with uses-allocator
+ construction (20.7.7.2 [allocator.uses.construction]).
+ <p/>
+ <ins>-?- <i>Remarks</i>: The first constructor shall not participate in overload resolution unless <tt>Alloc</tt> is not 
+ implicitly convertible to <tt>T</tt>.</ins>
+ </p>
+ </blockquote></blockquote>
+ </li>
+ </ol>
+ </blockquote>
+ 
+ <p><i>[2014/11 Urbana]</i></p>
+ 
+ <p>
+ Held at Ready status, pending clarification of Arrays TS
+ </p>
+ 
+ 
+ 
  <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li>
! <p>
! Use the correct way to unambiguously call a constructor taking any type of allocator, i.e. change the 
! constructors to take <tt>dynarray(std::allocator_arg_t, const Alloc&amp;, ...)</tt> by modifying both the synopsis
! X [dynarray.overview] p2 and X [dynarray.cons] before p9 like so:</p>
! 
! <blockquote><pre>
! template &lt;class Alloc&gt;
!   dynarray(<ins>allocator_arg_t, const Alloc&amp; a, </ins>size_type c<del>, const Alloc&amp; alloc</del>);
! template &lt;class Alloc&gt;
!   dynarray(<ins>allocator_arg_t, const Alloc&amp; a, </ins>size_type c, const T&amp; v<del>, const Alloc&amp; alloc</del>);
! template &lt;class Alloc&gt;
!   dynarray(<ins>allocator_arg_t, const Alloc&amp; a, </ins>const dynarray&amp; d<del>, const Alloc&amp; alloc</del>);
! template &lt;class Alloc&gt;
!   dynarray(<ins>allocator_arg_t, const Alloc&amp; a, </ins>initializer_list&lt;T&gt;<del>, const Alloc&amp; alloc</del>);
! </pre></blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2256"></a>2256. On <tt>vector</tt> iterator invalidation</h3>
! <p><b>Section:</b> 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2013-04-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.modifiers">active issues</a> in [vector.modifiers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 23.3.6.5 [vector.modifiers]/p3 says:
! </p>
! <blockquote><pre>
! iterator erase(const_iterator position);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
  <blockquote>
  <p>
! <i>Effects</i>: Invalidates iterators and references at or after the point of the erase.
  </p>
+ </blockquote></blockquote>
+ <p>
+ Consider this example:
+ </p>
+ <blockquote><pre>
+ #include &lt;vector&gt;
+ #include &lt;cassert&gt;
+ 
+ int main()
+ {
+   typedef std::vector&lt;int&gt; C;
+   C c = {1, 2, 3, 4};
+   C::iterator i = c.begin() + 1;
+   C::iterator j = c.end() - 1;
+   assert(*i == 2);
+   assert(*j == 4);
+   c.erase(c.begin());
+   <span style="color:#C80000;font-weight:bold">assert(*i == 3); // Why is this not perfectly fine?!</span>
+ }
+ </pre></blockquote>
+ <p>
+ Why has the iterator <tt>i</tt> been invalidated? It still refers to a perfectly reasonable, fully constructed object. 
+ If <tt>vector::iterator</tt> were to be implemented as a pointer (which is legal), it is not possible for that last 
+ line to do anything but run fine.
+ <p/>
+ The iterator <tt>j</tt> on the other hand now points at end, and any iterators that may now point beyond <tt>end()</tt>, 
+ into uninitialized memory, are clearly invalid.
+ <p/>
+ But why do we say that an iterator that <em>must</em> point to a valid object is invalid? This looks to me like we 
+ simply got sloppy in our specification.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
  
  
  
  
  
  <hr>
! <h3><a name="2259"></a>2259. Issues in 17.6.5.5 rules for member functions</h3>
! <p><b>Section:</b> 17.6.5.5 [member.functions] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2013-05-12 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#member.functions">issues</a> in [member.functions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 17.6.5.5 [member.functions] p2 says:
  </p>
  
! <blockquote><p>
! &quot;An implementation may declare additional non-virtual member function signatures within a class:
! </p>
! <ul>
! <p>by adding arguments with default values to a member function signature; [Footnote: Hence, the address of a member 
! function of a class in the C++ standard library has an unspecified type.] [<i>Note</i>: An implementation
! may not add arguments with default values to virtual, global, or non-member functions. &mdash; <i>end note</i>]</p>
! <p>by replacing a member function signature with default values by two or more member function signatures
! with equivalent behavior; and</p>
! <p>by adding a member function signature for a member function name.&quot;</p>
! </ul>
! </blockquote>
  
+ <ol>
+ <li>
  <p>
! This wording is not using the correct terminology. "by adding arguments with default values" presumably means 
! "by adding parameters with default arguments", and likewise throughout.
! </p>
! </li>
! <li>
! <p>
! This paragraph only allows an implementation to declare "additional" signatures, but the first bullet is talking 
! about replacing a standard signature with one with additional parameters.
! </p>
! </li>
! <li>
! <p>
! None of these bullets allows a member function with no <i>ref</i>-qualifier to be replaced by signatures with <i>ref</i>-qualifiers 
! (a situation which was just discussed on std-proposals), and likewise for <i>cv</i>-qualifiers. Presumably that is 
! not intentional, and such changes should be permissible.
! </p>
! </li>
! </ol>
! 
! <p>
! I think the first two items are probably editorial, since the intent is clear.
  </p>
  
! <p><i>[2013-12-11 Richard provides concrete wording]</i></p>
  
  <p>
  </p>
  
+ <p><i>[2015-05, Lenexa]</i></p>
  
+ <p>
+ JW: I don't like that this loses the footnote about the address of member functions having an unspecified type, 
+ the footnote is good to be able to point to as an explicit clarification of one consequence of the normative wording.<br/>
+ MC: so we want to keep the footnote<br/>
+ STL: doesn't need to be a footnote, can be an inline Note<br/>
+ JW: does this have any impact on our ability to add totally different functions with unrelated names, not described in 
+ the standard?<br/>
+ MC: no, the old wording didn't refer to such functions anyway<br/>
+ Move to Ready and include in motion on Friday?<br/>
+ 9 in favor, 0 opposed, 2 abstention 
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3797.</p>
+ 
+ <ol>
+ <li><p>Merge 17.6.5.5 [member.functions]p2+3 as indicated:</p>
+ 
+ <blockquote>
  <p>
! -2- <del>An implementation may declare additional non-virtual member function signatures within a class:</del>
  </p>
! <ul>
! <li><p>
! <del>by adding arguments with default values to a member function signature;188 [<i>Note:</i> An implementation
! may not add arguments with default values to virtual, global, or non-member functions. &mdash; <i>end note</i>]</del>
! </p></li>
! <li><p>
! <del>by replacing a member function signature with default values by two or more member function signatures
! with equivalent behavior; and</del>
! </p></li>
! <li><p>
! <del>by adding a member function signature for a member function name.</del>
! </p></li>
! </ul>
! <p>
! <del>-3- A call to a member function signature described in the C++ standard library behaves as if the implementation
! declares no additional member function signatures.[Footnote: A valid C++ program always calls the expected library 
! member function, or one with equivalent behavior. An implementation may also define additional member functions 
! that would otherwise not be called by a valid C++ program.]</del> <ins>For a non-virtual member function described 
! in the C++ standard library, an implementation may declare a different set of member function signatures, provided 
! that any call to the member function that would select an overload from the set of declarations described in this 
! standard behaves as if that overload were selected. [<i>Note:</i> For instance, an implementation may add parameters 
! with default values, or replace a member function with default arguments with two or more member functions with 
! equivalent behavior, or add additional signatures for a member function name. &mdash; <i>end note</i>]</ins>
! </p>
! 
  </blockquote>
+ </li>
  
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2260"></a>2260. Missing requirement for <tt>Allocator::pointer</tt></h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-05-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
+ <p>
+ For an allocator <tt>A&lt;T&gt;</tt> which defines <tt>A&lt;T&gt;::pointer</tt> to a class type,
+ i.e. not <tt>T*</tt>, I see no requirement that <tt>A&lt;T&gt;::pointer</tt> is convertible to
+ <tt>A&lt;U&gt;::pointer</tt>, even if <tt>T*</tt> is convertible to <tt>U*</tt>.  Such conversions are
+ needed in containers to convert from e.g. <tt>ListNodeBase*</tt> to <tt>ListNode&lt;T&gt;*</tt>.
+ </p>
+ 
+ <p>The obvious way to do such conversions appears to be
+ <tt>pointer_traits::pointer_to()</tt>, but that's ill-formed if the static
+ member function <tt>A&lt;T&gt;::pointer::pointer_to()</tt> doesn't exist and the
+ allocator requirements don't mention that function, so you need to
+ cast <tt>A&lt;T&gt;::pointer</tt> to <tt>A&lt;T&gt;::void_pointer</tt> then cast that to
+ <tt>A&lt;U&gt;::pointer</tt>.
+ </p>
  
  <p>
! Is converting via <tt>void_pointer</tt> really intended, or are we missing a requirement that 
! <tt>pointer_traits&lt;A&lt;T&gt;::pointer&gt;::pointer_to()</tt> be well-formed?
  </p>
  
! <p>Proposed resolution:</p>
  
+ <p>Add to the Allocator requirements table the following requirement:</p>
  
+ <blockquote>
  <p>
! The expression <tt>pointer_traits&lt;XX::pointer&gt;::pointer_to(r)</tt> is well-defined.
  </p>
+ </blockquote>
  
+ <p><i>[2013-09 Chicago]</i></p>
+ 
+ <p>
+ Pablo to come back with Proposed Wording
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>
! Edit Table 28 as indicated:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 28 &mdash; Allocator requirements (continued)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Default</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>static_cast&lt;X::const_pointer&gt;(z)</tt>
! </td>
! <td>
! <tt>X::const_pointer</tt>
! </td>
! <td>
! <tt>static_cast&lt;X::const_pointer&gt;(z) == q</tt>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>pointer_traits&lt;X::pointer&gt;::pointer_to(r)</tt></ins>
! </td>
! <td>
! <ins><tt>X::pointer</tt></ins>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! 
! </li>
! </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2261"></a>2261. Are containers required to use their '<tt>pointer</tt>' type internally?</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-05-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! Is a container <tt>C</tt> only supposed to refer to allocated memory (blocks of
! contiguous storage, nodes, etc.) through objects of type <tt>C::pointer</tt>
! rather than <tt>C::value_type*</tt>?
! </p>
  
! <p>
! I don't see anything explicitly requiring this, so a container could
! immediately convert the result of <tt>get_allocator().allocate(1)</tt> to a
! built-in pointer of type <tt>value_type*</tt> and only deal with the built-in
! pointer until it needs to deallocate it again, but that removes most
! of the benefit of allowing allocators to use custom pointer types.
! </p>
  
! <p><i>[2014-06-12, Jonathan comments]</i></p>
  
! <p>
! This issue is basically the same issue as LWG <a href="lwg-active.html#1521">1521</a>, which agrees it's an issue, 
! to be dealt with in the future, so I request that <a href="lwg-active.html#2261">2261</a> not be closed as a dup 
! unless we reopen <a href="lwg-active.html#1521">1521</a>.
! </p>
  
  
  
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2262"></a>2262. Requirement for <tt>unique_ptr&lt;T&gt;::get_deleter()(p)</tt> to be able to destroy the <tt>unique_ptr</tt></h3>
! <p><b>Section:</b> 20.8.1.2 [unique.ptr.single] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Rob Desbois <b>Opened:</b> 2013-05-15 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single">issues</a> in [unique.ptr.single].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! N3337 20.8.1.2.5 [unique.ptr.single.modifiers] contains 2 non-normative notes stating:
  </p>
  
! <blockquote>
! <p>
! [para 4]: &quot;The order of these operations is significant because the call to <tt>get_deleter()</tt> 
! may destroy <tt>*this</tt>.&quot;
! </p>
! <p>
! [para 5]: &quot;The postcondition does not hold if the call to <tt>get_deleter()</tt> destroys <tt>*this</tt> since 
! <tt>this->get()</tt> is no longer a valid expression.&quot;
! </p>
! </blockquote>
  
+ <p>
+ It seems this wording was created to resolve <a href="lwg-defects.html#998">998</a> due to the possibility that a <tt>unique_ptr</tt> may be 
+ destroyed through deletion of its stored pointer where that directly or indirectly refers to the same <tt>unique_ptr</tt>. 
+ If <tt>unique_ptr</tt> is required to support circular references then it seems this must be normative text: an implementation 
+ is currently allowed to operate on <tt>*this</tt> after the assignment and deletion specified in para 4, since this is only 
+ 'disallowed' by the non-normative note.
+ </p>
  
! <p>I propose the following draft rewording:</p>
  
+ <p>
+ [para 4]: <i>Effects</i>: assigns <tt>p</tt> to the stored pointer, and then if the old value of the stored pointer, <tt>old_p</tt>, was not
+ equal to <tt>nullptr</tt>, calls <tt>get_deleter()(old_p)</tt>. <ins>No operation shall be performed after the call to 
+ <tt>get_deleter()(old_p)</tt> that requires <tt>*this</tt> to be valid, because the deletion may destroy <tt>*this</tt> if it is 
+ referred to directly or indirectly by the stored pointer.</ins> <del>[<i>Note:</i> The order of these operations is significant
+ because the call to <tt>get_deleter()</tt> may destroy <tt>*this</tt>. &mdash; <i>end note</i>]</del>
+ <p/>
+ [para 5]: <i>Postconditions</i>: <ins>If the call <tt>get_deleter()(old_p)</tt> destroyed <tt>*this</tt>, none. Otherwise,</ins> 
+ <tt>get() == p</tt>. <del>[<i>Note:</i> The postcondition does not hold if the call to <tt>get_deleter()</tt>
+ destroys <tt>*this</tt> since <tt>this->get()</tt> is no longer a valid expression. &mdash; <i>end note</i>]</del>
+ </p>
  
+ <p>
+ I expect it will also be necessary to amend the requirements for a deleter, so in addition:
+ </p>
+ 
+ <p>
+ 20.8.1.2 [unique.ptr.single] [para 1]: The default type for the template parameter <tt>D</tt> is <tt>default_delete</tt>. 
+ A client-supplied template argument <tt>D</tt> shall be a function object type (20.10), lvalue-reference to function, or 
+ lvalue-reference to function object type for which, given a value <tt>d</tt> of type <tt>D</tt> and a value <tt>ptr</tt> of type 
+ <tt>unique_ptr&lt;T, D&gt;::pointer</tt>, the expression <tt>d(ptr)</tt> is valid and has the effect of disposing of the pointer 
+ as appropriate for that deleter. <ins>Where <tt>D</tt> is not an lvalue reference type, <tt>d(ptr)</tt> shall be valid if <tt>ptr</tt> 
+ refers directly or indirectly to the invoking <tt>unique_ptr</tt> object.</ins>
+ </p>
  
+ <p><i>[2013-10-05, Stephan T. Lavavej comments and provides alternative wording]</i></p>
  
! <p>
! In Chicago, we determined that the original proposed change to 20.8.1.2 [unique.ptr.single]/1 was insufficient, because 
! <tt>d</tt> might be a reference to a deleter functor that's destroyed during self-destruction.
! <p/>
! We believed that 20.8.1.2.5 [unique.ptr.single.modifiers]/4 was already sufficiently clear. The Standard occasionally prevents 
! implementations of <tt>X</tt> from doing various things, through the principle of "nothing allows <tt>X</tt> to fail in that situation".  
! For example, <tt>v.push_back(v[0])</tt> is required to work for non-empty vectors because nothing allows that to fail. In this case, 
! the intent to allow self-destruction is already clear.
! <p/>
! Additionally, we did not believe that 20.8.1.2.5 [unique.ptr.single.modifiers]/5 had to be changed. The current note is slightly 
! squirrely but it does not lead to confusion for implementers or users.
! </p>
! 
! <p>
! Previous resolution from Rob Desbois:
! </p>
! <blockquote class="note">
  <ol>
  <li>
! <p>
! Edit 20.8.1.2 [unique.ptr.single] p1 as indicated:
! </p>
! <blockquote><p>
! The default type for the template parameter <tt>D</tt> is <tt>default_delete</tt>. 
! A client-supplied template argument <tt>D</tt> shall be a function object type (20.10), lvalue-reference to function, or 
! lvalue-reference to function object type for which, given a value <tt>d</tt> of type <tt>D</tt> and a value <tt>ptr</tt> of type 
! <tt>unique_ptr&lt;T, D&gt;::pointer</tt>, the expression <tt>d(ptr)</tt> is valid and has the effect of disposing of the pointer 
! as appropriate for that deleter. <ins>Where <tt>D</tt> is not an lvalue reference type, <tt>d(ptr)</tt> shall be valid if <tt>ptr</tt> 
! refers directly or indirectly to the invoking <tt>unique_ptr</tt> object.</ins>
! </p></blockquote>
  </li>
! 
! <li>
! <p>
! Edit 20.8.1.2.5 [unique.ptr.single.modifiers] p4+5 as indicated:
! </p>
! <blockquote><pre>
! void reset(pointer p = pointer()) noexcept;
! </pre><blockquote>
! <p>
! -3- <i>Requires:</i> The expression <tt>get_deleter()(get())</tt> shall be well formed, shall have well-defined behavior,
! and shall not throw exceptions.
! <p/>
! -4- <i>Effects:</i> assigns <tt>p</tt> to the stored pointer, and then if the old value of the stored pointer, <tt>old_p</tt>, was not
! equal to <tt>nullptr</tt>, calls <tt>get_deleter()(old_p)</tt>. <ins>No operation shall be performed after the call to 
! <tt>get_deleter()(old_p)</tt> that requires <tt>*this</tt> to be valid, because the deletion may destroy <tt>*this</tt> if it is 
! referred to directly or indirectly by the stored pointer.</ins> <del>[<i>Note:</i> The order of these operations is significant
! because the call to <tt>get_deleter()</tt> may destroy <tt>*this</tt>. &mdash; <i>end note</i>]</del>
! <p/>
! -5- <i>Postconditions:</i> <ins>If the call <tt>get_deleter()(old_p)</tt> destroyed <tt>*this</tt>, none. Otherwise,</ins> 
! <tt>get() == p</tt>. <del>[<i>Note:</i> The postcondition does not hold if the call to <tt>get_deleter()</tt>
! destroys <tt>*this</tt> since <tt>this->get()</tt> is no longer a valid expression. &mdash; <i>end note</i>]</del>
! </p>
! </blockquote></blockquote>
  </li>
! </ol>
! 
  </blockquote>
+ 
+ <p>
+ <strong>Previous resolution [SUPERSEDED]:</strong>
+ </p>
+ <blockquote class="note">
+ <p>This wording is relative to N3691.</p>
+ 
+ <ol>
+ <li>
+ <p>
+ Edit 20.8.1.2 [unique.ptr.single] p1 as indicated:
+ </p>
+ <blockquote><p>
+ The default type for the template parameter <tt>D</tt> is <tt>default_delete</tt>. 
+ A client-supplied template argument <tt>D</tt> shall be a function object type (20.10), lvalue-reference to function, or 
+ lvalue-reference to function object type for which, given a value <tt>d</tt> of type <tt>D</tt> and a value <tt>ptr</tt> of type 
+ <tt>unique_ptr&lt;T, D&gt;::pointer</tt>, the expression <tt>d(ptr)</tt> is valid and has the effect of disposing of the pointer 
+ as appropriate for that deleter. <ins><tt>d(ptr)</tt> shall be valid even if it triggers the destruction of <tt>d</tt> or (if 
+ <tt>D</tt> is an lvalue reference to function object type) the function object that <tt>d</tt> refers to.</ins>
+ </p></blockquote>
  </li>
! </ol>
  </blockquote>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! After some discussion in Lenexa there was some wavering on if the added sentence is necessary. Here is example code that 
! demonstrates why the extra sentence is necessary. In this example the call to <tt>d(ptr)</tt> is valid, however the deleter 
! references <tt>*this</tt> after destructing its element:
! </p>
! <blockquote><pre>
! #include &lt;cassert&gt;
! #include &lt;memory&gt;
! #include &lt;iostream&gt;
! 
! class Deleter
! {
!     int state_ = 0;
! 
!     enum
!     {
!         destructed            = -4,
!         self_move_assigned    = -3,
!         move_assigned_from    = -2,
!         move_constructed_from = -1
!     };
! public:
!     ~Deleter() {state_ = destructed;}
! 
!     Deleter() = default;
!     Deleter(Deleter const&amp;) = default;
!     Deleter&amp; operator=(Deleter const&amp;) = default;
! 
!     Deleter(Deleter&amp;&amp; a) noexcept
!         : state_(a.state_)
!     {a.state_ = move_constructed_from;}
! 
!     Deleter&amp; operator=(Deleter&amp;&amp; a) noexcept
!     {
!         if (this == &amp;a)
!             state_ = self_move_assigned;
!         else
!         {
!             state_ = a.state_;
!             a.state_ = move_assigned_from;
!         }
!         return *this;
!     }
! 
!     Deleter(int state)
!         : state_(state)
!     {
!         assert(state &gt;= 0);
!     }
! 
!     template &lt;class T&gt;
!     void
!     operator()(T* t) const
!     {
!         std::cout &lt;&lt; "Deleter beginning operator()(T*)\n";
!         std::cout &lt;&lt; "The deleter = " &lt;&lt; *this &lt;&lt; '\n';
!         std::cout &lt;&lt; "Deleter about to destruct the X.\n";
!         delete t;
!         std::cout &lt;&lt; "Deleter has destructed the X.\n";
!         std::cout &lt;&lt; "The deleter = " &lt;&lt; *this &lt;&lt; '\n';
!         std::cout &lt;&lt; "Deleter ending operator()(T*)\n";
!     }
! 
!     friend
!     std::ostream&amp;
!     operator&lt;&lt;(std::ostream&amp; os, const Deleter&amp; a)
!     {
!         switch (a.state_)
!         {
!         case destructed:
!             os &lt;&lt; "**destructed**";
!             break;
!         case self_move_assigned:
!             os &lt;&lt; "self_move_assigned";
!             break;
!         case move_assigned_from:
!             os &lt;&lt; "move_assigned_from";
!             break;
!         case move_constructed_from:
!             os &lt;&lt; "move_constructed_from";
!             break;
!         default:
!             os &lt;&lt; a.state_;
!             break;
!         }
!         return os;
!     }
! };
! 
! struct X
! {
!     Deleter deleter_{1};
! };
! 
! int main()
! {
!     auto xp = new X;
!     {
!         std::unique_ptr&lt;X, Deleter&amp;&gt; p(xp, xp-&gt;deleter_);
!         std::cout &lt;&lt; "unique_ptr is constructed.\n";
!         std::cout &lt;&lt; "The deleter = " &lt;&lt; p.get_deleter() &lt;&lt; '\n';
!         std::cout &lt;&lt; "Destructing unique_ptr...\n";
!     }
!     std::cout &lt;&lt; "unique_ptr is destructed.\n";
! }
  </pre></blockquote>
! <p>
! Which outputs:
! </p>
  <blockquote>
! <pre>
! unique_ptr is constructed.
! The deleter = 1
! Destructing unique_ptr...
! Deleter beginning operator()(T*)
! The deleter = 1
! Deleter about to destruct the X.
! Deleter has destructed the X.
! The deleter = **destructed**
! Deleter ending operator()(T*)
! unique_ptr is destructed.
  </pre>
  </blockquote>
+ <p>
+ The line "<tt>The deleter = **destructed**</tt>" represents the deleter referencing itself after it has been destructed by the 
+ <tt>d(ptr)</tt> expression, but prior to that call returning.
+ <p/>
+ Suggested alternative to the current proposed wording:
+ </p>
+ <blockquote>
+ <p>
+ The expression <tt>d(ptr)</tt> shall not refer to the object <tt>d</tt> after it executes <tt>ptr-&gt;~T()</tt>.
+ </p>
  </blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4431.</p>
+ 
+ <ol>
+ <li>
+ <p>
+ Edit 20.8.1.2 [unique.ptr.single] p1 as indicated:
+ </p>
+ <blockquote><p>
+ The default type for the template parameter <tt>D</tt> is <tt>default_delete</tt>. 
+ A client-supplied template argument <tt>D</tt> shall be a function object type (20.9), lvalue-reference to function, or 
+ lvalue-reference to function object type for which, given a value <tt>d</tt> of type <tt>D</tt> and a value <tt>ptr</tt> of type 
+ <tt>unique_ptr&lt;T, D&gt;::pointer</tt>, the expression <tt>d(ptr)</tt> is valid and has the effect of disposing of the pointer 
+ as appropriate for that deleter. <ins>The expression <tt>d(ptr)</tt> shall not refer to the object <tt>d</tt> after it executes 
+ <tt>ptr-&gt;~T()</tt>.</ins>
+ </p></blockquote>
  </li>
  </ol>
  
*************** const Engine&amp; base() const <ins>noex
*** 5288,5360 ****
  
  
  
  <hr>
! <h3><a name="1448"></a>1448. [FCD] Concerns about <tt>basic_stringbuf::str(basic_string)</tt> postconditions</h3>
! <p><b>Section:</b> 27.8.1.3 [stringbuf.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-124</b></p>
  
  <p>
! N3092 27.8.1.3 [stringbuf.members] contains this textcspecifying the postconditions of
! <tt>basic_stringbuf::str(basic_string)</tt>:
  </p>
! <blockquote>
! Postconditions: If <tt>mode &amp; ios_base::out</tt> is <tt>true</tt>,
! <tt>pbase()</tt> points to the first underlying character and <tt>epptr() &gt;=
! pbase() + s.size()</tt> holds; in addition, if <tt>mode &amp; ios_base::in</tt>
! is <tt>true</tt>, <tt>pptr() == pbase() + s.data()</tt> holds, otherwise
! <tt>pptr() == pbase()</tt> is <tt>true</tt>. [...]
! </blockquote>
  <p>
! Firstly, there's a simple mistake: It should be <tt>pbase() + s.length()</tt>,
! not <tt>pbase() + s.data()</tt>.
  </p>
  <p>
! Secondly, it doesn't match existing implementations. As far as I can tell,
! GCC 4.5 does not test for <tt>mode &amp; ios_base::in</tt> in the second part
! of that sentence, but for <tt>mode &amp; (ios_base::app | ios_base_ate)</tt>,
! and Visual C++ 9 for <tt>mode &amp; ios_base::app</tt>. Besides, the wording of
! the C++0x draft doesn't make any sense to me. I suggest changing the second part
! of the sentence to one of the following:
  </p>
  <p>
! Replace <tt>ios_base::in</tt> with <tt>(ios_base::ate | ios_base::app)</tt>,
! but this would require Visual C++ to change (replacing only with
! <tt>ios_base::ate</tt> would require GCC to change, and would make
! <tt>ios_base::app</tt> completely useless with <tt>stringstreams</tt>):
  </p>
  <p>
! in addition, if <tt>mode &amp; (ios_base::ate | ios_base::app)</tt> is <tt>true</tt>,
! <tt>pptr() == pbase() + s.length()</tt> holds, otherwise <tt>pptr() == pbase()</tt>
! is <tt>true</tt>.
  </p>
  <p>
! Leave <tt>pptr()</tt> unspecified if <tt>mode &amp; ios_base::app</tt>, but not
! <tt>mode &amp; ios_base::ate</tt> (implementations already differ in this case, and it
! is always possible to use <tt>ios_base::ate</tt> to get the effect of appending, so it
! is not necessary to require any implementation to change):
  </p>
  <p>
! in addition, if <tt>mode &amp; ios_base::ate</tt> is <tt>true</tt>,
! <tt>pptr() == pbase() + s.length()</tt> holds, if neither <tt>mode &amp; ios_base::ate</tt>
! nor <tt>mode &amp; ios_base::app</tt> is <tt>true</tt>, <tt>pptr() == pbase()</tt> holds,
! otherwise <tt>pptr() &gt;= pbase() &amp;&amp; pptr() &lt;= pbase() + s.length()</tt>
! (which of the values in this range is unspecified).
  </p>
  <p>
! Slightly stricter:
  </p>
  <p>
! in addition, if <tt>mode &amp; ios_base::ate</tt> is <tt>true</tt>,
! <tt>pptr() == pbase() + s.length()</tt> holds, if neither
! <tt>mode &amp; ios_base::ate</tt> nor <tt>mode &amp; ios_base::app</tt> is <tt>true</tt>,
! <tt>pptr() == pbase()</tt> holds, otherwise <tt>pptr() == pbase() || pptr() == pbase() + s.length()</tt>
! (which of these two values is unspecified). A small table might help to better explain the three cases.
! BTW, at the end of the postconditions is this text: "<tt>egptr() == eback() + s.size()</tt> hold".
! Is there a perference for <tt>basic_string::length</tt> or <tt>basic_string::size</tt>? It doesn't really
! matter, but it looks a bit inconsistent.
  </p>
  
  
--- 18786,19045 ----
  
  
  
+ 
  <hr>
! <h3><a name="2264"></a>2264. [arrays.ts] <tt>std::dynarray</tt> defines its initializer-list constructor in terms of a non-existent constructor</h3>
! <p><b>Section:</b> X [dynarray], 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Povilas Kanapickas <b>Opened:</b> 2013-05-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses: arrays.ts</b></p>
  
  <p>
! <tt>std::dynarray</tt> member listing at X [dynarray.overview] includes this constructor:
  </p>
! 
! <blockquote><pre>
! dynarray(initializer_list&lt;T&gt;);
! </pre></blockquote>
! 
  <p>
! Also, X [dynarray.overview] p. 2 says:
  </p>
+ 
+ <blockquote><p>
+ Unless otherwise specified, all <tt>dynarray</tt> operations have the same requirements and semantics as specified in 23.2.
+ </p></blockquote>
+ 
  <p>
! The constructor in question isn't mentioned in X [dynarray.cons] or anywhere else. This means requirements from 
! 23.2 [container.requirements] apply. However, Table 100 in 23.2.3 [sequence.reqmts] says:
  </p>
+ 
+ <blockquote><p>
+ <tt>X(il)</tt> &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Equivalent to <tt>X(il.begin(), il.end())</tt>      
+ </p></blockquote>
+ 
  <p>
! <tt>std::dynarray</tt> does not provide this constructor.
  </p>
+ 
  <p>
! The proposed resolution below adds the missing constructor and a complementary constructor with an allocator parameter. 
! The new constructors, differently from the rest of containers, accept iterators that have forward iterator category. This 
! is needed because the size requirements must be known in order to allocate appropriately-sized storage.
! <p/>
! An alternative resolution could be to properly specify the initializer-list constructor.
  </p>
+ 
+ <p><i>[2013-09 Chicago:]</i></p>
+ 
  <p>
! Move to Deferred. This feature will ship after C++14 and should be revisited then.
  </p>
+ 
+ <p><i>[2014-06-06 pre-Rapperswill]</i></p>
+ 
  <p>
! This issue has been reopened as arrays-ts.
  </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <ol>
+ <li><p>Add the following to the <tt>std::dynarray</tt> synopsis at X [dynarray.overview]:</p>
+ 
+ <blockquote><pre>
+ namespace std {
+   template &lt;class T&gt;
+   class dynarray {
+     [&hellip;]
+     <i>// 23.3.4.2 construct/copy/destroy:</i>
+     [&hellip;]
+     <ins>template &lt;class ForwardIterator&gt;</ins>
+     <ins>dynarray(ForwardIterator first, ForwardIterator last);</ins>
+     <ins>template &lt;class ForwardIterator, class Alloc&gt;</ins>
+     <ins>dynarray(ForwardIterator first, ForwardIterator last, const Alloc&amp; alloc);</ins>
+     [&hellip;]
+   };
+ }
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>Add the following to X [dynarray.cons] after p. 8:</p>
+ 
+ <blockquote><pre>
+ <ins>template &lt;class ForwardIterator&gt;
+ dynarray(ForwardIterator first, ForwardIterator last);</ins>
+ </pre><blockquote>
  <p>
! <ins>-?-  <i>Requires:</i> <tt>T</tt> shall meet the <tt>CopyConstructible</tt> requirements.</ins>
! <p/>
! <ins>-?-  <i>Effects:</i> Allocates storage for <tt>distance(first, last)</tt> elements.
! The <tt>distance(first, last)</tt> elements of the dynarray are direct-initialized (8.5 [dcl.init]) with the 
! corresponding elements from the range <tt>[first,last)</tt>. May or may not invoke the global <tt>operator new</tt>.</ins>
! <p/>
! <ins>-?-  <i>Complexity:</i> <tt>distance(first, last)</tt>.</ins>
! <p/>
! <ins>-?-  <i>Throws:</i> <tt>std::bad_array_length</tt> when the size requested is larger than implementable, <tt>std::bad_alloc</tt> 
! when there is insufficient memory.</ins>
  </p>
+ </blockquote></blockquote>
+ </li>
+ 
+ <li><p>Add the following to the list of constructors at X [dynarray.cons] before p. 9:</p>
+ </li>
+ 
+ <blockquote><pre>
+ template &lt;class Alloc&gt;
+ dynarray(size_type c, const Alloc&amp; alloc);
+ template &lt;class Alloc&gt;
+ dynarray(size_type c, const T&amp; v, const Alloc&amp; alloc);
+ template &lt;class Alloc&gt;
+ dynarray(const dynarray&amp; d, const Alloc&amp; alloc);
+ template &lt;class Alloc&gt;
+ dynarray(initializer_list&lt;T&gt;, const Alloc&amp; alloc);
+ <ins>template &lt;class ForwardIterator, class Alloc&gt;
+ dynarray(ForwardIterator first, ForwardIterator last, const Alloc&amp; alloc);</ins>
+ </pre></blockquote>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2265"></a>2265. 29.3p9 appears to rule out some acceptable executions</h3>
+ <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Brian Demsky <b>Opened:</b> 2013-06-17 <b>Last modified:</b> 2015-05-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#atomics.order">active issues</a> in [atomics.order].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! I believe that the following variation on IRIW should admit executions in
! which <tt>c1 = d1 = 5</tt> and <tt>c2 = d2 = 0</tt>.  If this is allowed, then what is sequence of
! program evaluations for 29.3 [atomics.order] p9 that justifies the store to <tt>z</tt>?  It seems that
! 29.3 [atomics.order] p9 should not allow this execution because one of the stores to <tt>x</tt> or <tt>y</tt> has
! to appear earlier in the sequence, each of the <tt>fetch_adds</tt> reads the previous load in the thread (and thus must 
! appear later in the sequence), and 29.3 [atomics.order] p9 states that each load must read from the last prior 
! assignment in the sequence.
! </p>
! 
! <blockquote><pre>
! atomic_int x;
! atomic_int y;
! atomic_int z;
! int c1, c2, d1, d2;
! 
! static void a(void* obj)
! {
!   atomic_store_explicit(&amp;x, 5, memory_order_relaxed); 
! }
! 
! static void b(void* obj)
! {
!   atomic_store_explicit(&amp;y, 5, memory_order_relaxed); 
! }
! 
! static void c(void* obj)
! {
!   c1 = atomic_load_explicit(&amp;x, memory_order_relaxed);
!   // this could also be an atomic load if the address depends on c1:
!   c2 = atomic_fetch_add_explicit(&amp;y, c1, memory_order_relaxed);  
! }
! 
! static void d(void* obj)
! {
!   d1 = atomic_load_explicit(&amp;y, memory_order_relaxed);
!   d2 = atomic_fetch_add_explicit(&amp;x, d1, memory_order_relaxed); 
! }
! 
! int user_main(int argc, char** argv)
! {
!   thrd_t t1, t2, t3, t4;
! 
!   atomic_init(&amp;x, 0);
!   atomic_init(&amp;y, 0);
! 
!   printf("Main thread: creating 4 threads\n");
!   thrd_create(&amp;t1, (thrd_start_t)&amp;a, NULL);
!   thrd_create(&amp;t2, (thrd_start_t)&amp;b, NULL);
!   thrd_create(&amp;t3, (thrd_start_t)&amp;c, NULL);
!   thrd_create(&amp;t4, (thrd_start_t)&amp;d, NULL);
! 
!   thrd_join(t1);
!   thrd_join(t2);
!   thrd_join(t3);
!   thrd_join(t4);
!   printf("c1=%d c2=%d\n",c1,c2);
!   printf("d1=%d d2=%d\n",d1,d2);
! 
!   // Can this store write 1000 (i.e., c1=d1=5, c2=d2=0)?
!   atomic_store(&amp;z, (c1+d1)*100+c2+d2);
! 
!   printf("Main thread is finished\n");
! 
!   return 0;
! }
! </pre></blockquote>
! 
! <p>
! It seems that the easiest fix is to allow a load in 29.3 [atomics.order] p9 to read from any prior
! store in the evaluation order.
! <p/>
! That said, I would personally advocate the following:
! It seems to me that C/C++ atomics are in a bit of different situation than Java
! because:
! </p>
! <ol>
! <li><p>People are expected to use relaxed C++ atomics in potentially racy
! situations, so it isn't clear that semantics as complicated as the JMM's
! causality would be sane.
! </p></li>
! <li><p>People who use C/C++ atomics are likely to be experts and use them in a
! very controlled fashion. I would be really surprised if compilers would find
! any real wins by optimizing the use of atomics.
! </p></li>
! </ol>
! <p>
! Why not do something like:
! <p/>
! There is satisfaction DAG of all program evaluations. Each evaluation
! observes the values of variables as computed by some prior assignment in
! the DAG.
! <p/>
! There is an edge <tt>x-&gt;y</tt> between two evaluations <tt>x</tt> and <tt>y</tt> if:
! </p>
! <ol>
! <li><p>the evaluation <tt>y</tt> observes a value computed by the evaluation <tt>x</tt> or
! </p></li>
! <li><p>the evaluation <tt>y</tt> is an atomic store, the evaluation <tt>x</tt> is an atomic load, and
! there is a condition branch c that may depend (intrathread dependence) on <tt>x</tt>
! and <tt>x-sb-&gt;c</tt> and <tt>c-sb-&gt;y</tt>.
! </p></li>
! </ol>
! <p>
! This seems to allow reordering of relaxed atomics that processors do without
! extra fence instructions, allows most reorderings by the compiler, and gets
! rid of satisfaction cycles.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! This was partially addressed (weasel-worded) in C++14 (See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3786.htm">N3786</a>).
! The remainder is an open research problem.  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3710.html">N3710</a> outlines a "solution" that doesn't have a consensus behind it because it costs performance.  We have no better solution at the moment.
  </p>
  
  
*************** matter, but it looks a bit inconsistent.
*** 5365,5728 ****
  
  
  <hr>
! <h3><a name="1450"></a>1450. [FCD] Contradiction in regex_constants</h3>
! <p><b>Section:</b> 28.5.2 [re.matchflag] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Deferred">Deferred</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Deferred">Deferred</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-127</b></p>
  
! The Bitmask Type requirements in 17.5.2.1.3 [bitmask.types] p.3 say that
! all elements on a bitmask type have distinct values, but
! 28.5.2 [re.matchflag] defines <tt>regex_constants::match_default</tt> and
! <tt>regex_constants::format_default</tt> as elements of the
! bitmask type <tt>regex_constants::match_flag_type</tt>, both with
! value 0. This is a contradiction.
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  <blockquote>
! One of the bitmask elements should be removed
! from the declaration and should be defined
! separately, in the same manner as
! <tt>ios_base::adjustfield</tt>, <tt>ios_base::basefield</tt> and
! <tt>ios_base::floatfield</tt> are defined by 27.5.2.1.2 [ios::fmtflags] p.2
! and Table 120. These are constants of a bitmask
! type, but are not distinct elements, they have
! more than one value set in the bitmask.
! <tt>regex_constants::format_default</tt> should be
! specified as a constant with the same value as
! <tt>regex_constants::match_default</tt>.
  </blockquote>
  
! <p><i>[
! 2010-10-31 Daniel comments:
! ]</i></p>
  
  <p>
! Strictly speaking, a bitmask type cannot have any element of value 0 at all, because
! any such value would contradict the requirement expressed in 17.5.2.1.3 [bitmask.types] p. 3:
! </p><blockquote>
! for any pair <em>Ci</em> and <em>Cj</em>, <em>Ci</em> &amp; <em>Ci</em> is nonzero
! </blockquote>
! So, actually <em>both</em> <tt>regex_constants::match_default</tt> and
! <tt>regex_constants::format_default</tt> are only constants of the type
! <tt>regex_constants::match_flag_type</tt>, and no bitmask elements.
! <p></p>
  
! <p><i>[
! 2010-11-03 Daniel comments and provides a proposed resolution:
! ]</i></p>
  
  
! <p>The proposed resolution is written against N3126 and considered as a further improvement
! of the fixes suggested by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3110.html">n3110</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! Add the following sentence to 28.5.2 [re.matchflag]  paragraph 1:
  <blockquote>
! 1 The type <tt>regex_constants::match_flag_type</tt> is an implementation-defined bitmask type (17.5.2.1.3).
! Matching a regular expression against a sequence of characters [first,last) proceeds according to the
! rules of the grammar specified for the regular expression object, modified according to the effects listed in
! Table 136 for any bitmask elements set. <ins>Type <tt>regex_constants::match_flag_type</tt> also defines the 
! constants <tt>regex_constants::match_default</tt> and <tt>regex_constants::format_default</tt>.</ins>
  </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1452"></a>1452. [FCD] "target sequence" is not defined</h3>
! <p><b>Section:</b> 28.10.4 [re.results.acc] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-01</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.results.acc">issues</a> in [re.results.acc].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-125</b></p>
  
! The term "target sequence" is not defined (28.10.4 [re.results.acc] p. 2).
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  <p>
! Replace "target sequence" with "string being searched/matched"
  </p>
  
! <p><i>[
! 2010-11-01 Daniel comments:
! ]</i></p>
  
  <p>
! The proposed resolution looks incomplete to me, there are more normative
! usages of the term <em>target sequence</em> in clause 28, e.g.
! 28.12.2 [re.tokiter] p. 7.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! Wording changes are against N3126. They are intended not to conflict with the wording changes
! suggested by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3158.html">n3158</a>.
  <p>
! Change 28.10.4 [re.results.acc] p. 2 as indicated:
! </p><blockquote><pre>difference_type position(size_type sub = 0) const;
  </pre><blockquote>
! 2 <em>Returns</em>: The distance from the start of the <del>target sequence</del><ins>string being matched</ins> to <tt>(*this)[sub].first</tt>.
  </blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1456"></a>1456. [FCD] Missing fixed-size atomic_ typedefs</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-129</b></p>
  
! Table 143 lists the typedefs for various atomic types
! corresponding to the various standard integer typedefs,
! such as atomic_int_least8_t for int_least8_t, and
! atomic_uint_fast64_t for uint_fast64_t. However, there are
! no atomic typedefs corresponding to the fixed-size
! standard typedefs int8_t, int16_t, and so forth.
  
! <p><i>[
! 2010-10-24 Daniel adds:
! ]</i></p>
  
  
  <blockquote>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue.
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! Add the following entries to table 143:
  
  <blockquote>
  <table border="1">
! <caption>Table 143 — Atomics for standard typedef types</caption>
! <tbody><tr>
! <th>atomic typedef name</th>
! <th><tt>&lt;cstdint&gt;</tt> typedef name</th>
! </tr>
! <tr>
! <td><tt>...</tt></td>
! <td><tt>...</tt></td>
! </tr>
! <tr>
! <td><tt>atomic_uintmax_t</tt></td>
! <td><tt>uintmax_t</tt></td>
! </tr>
  <tr>
! <td><ins><tt>atomic_int8_t</tt></ins></td>
! <td><ins><tt>int8_t</tt> (optional)</ins></td>
  </tr>
  <tr>
! <td><ins><tt>atomic_int16_t</tt></ins></td>
! <td><ins><tt>int16_t</tt> (optional)</ins></td>
  </tr>
  <tr>
! <td><ins><tt>atomic_int32_t</tt></ins></td>
! <td><ins><tt>int32_t</tt> (optional)</ins></td>
  </tr>
  <tr>
! <td><ins><tt>atomic_int64_t</tt></ins></td>
! <td><ins><tt>int64_t</tt> (optional)</ins></td>
  </tr>
  <tr>
! <td><ins><tt>atomic_uint8_t</tt></ins></td>
! <td><ins><tt>uint8_t</tt> (optional)</ins></td>
  </tr>
  <tr>
! <td><ins><tt>atomic_uint16_t</tt></ins></td>
! <td><ins><tt>uint16_t</tt> (optional)</ins></td>
  </tr>
  <tr>
! <td><ins><tt>atomic_uint32_t</tt></ins></td>
! <td><ins><tt>uint32_t</tt> (optional)</ins></td>
  </tr>
  <tr>
! <td><ins><tt>atomic_uint64_t</tt></ins></td>
! <td><ins><tt>uint64_t</tt> (optional)</ins></td>
  </tr>
! </tbody></table>
! </blockquote> 
  
  
  
  
  
  <hr>
! <h3><a name="1457"></a>1457. [FCD] Splitting lock-free properties</h3>
! <p><b>Section:</b> 29.2 [atomics.syn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-26</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
- <p><b>Addresses GB-130</b></p>
- 
- The synopsis for the <tt>&lt;atomic&gt;</tt> header lists the macros
- <tt>ATOMIC_INTEGRAL_LOCK_FREE</tt> and <tt>ATOMIC_ADDRESS_LOCK_FREE</tt>.
  <p>
! The <tt>ATOMIC_INTEGRAL_LOCK_FREE</tt> macro has been replaced with a set of macros 
! for each integral type, as listed in 29.4 [atomics.lockfree].
  </p>
  
  
! <p><i>[
! 2010-10-26: Daniel adds:
! ]</i></p>
  
  
  <p>
! The proposed resolution below is against the FCD working draft. After application
! of the editorial issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3162.html#US144">US-144</a>
! and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3162.html#US146">US-146</a> the remaining difference
! against the working draft is the usage of <em>implementation-defined</em> instead of <em>unspecified</em>, effectively
! resulting in this delta:
  
! </p><blockquote><pre>// 29.4, lock-free property
! #define ATOMIC_CHAR_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
! #define ATOMIC_CHAR16_T_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
! #define ATOMIC_CHAR32_T_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
! #define ATOMIC_WCHAR_T_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
! #define ATOMIC_SHORT_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
! #define ATOMIC_INT_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
! #define ATOMIC_LONG_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
! #define ATOMIC_LLONG_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
! #define ATOMIC_ADDRESS_LOCK_FREE <em>unspecified</em>
  </pre></blockquote>
! <p></p>
  
  <p>
! It is my understanding that the intended wording should be <em>unspecified</em> as for <tt>ATOMIC_ADDRESS_LOCK_FREE</tt>
! but if this is right, we need to use the same wording in 29.4 [atomics.lockfree], which consequently uses
! the term <em>implementation-defined</em>. I recommend to keep 29.2 [atomics.syn] as it currently is and to
! fix 29.4 [atomics.lockfree] instead as indicated (against N3126):
  </p>
  <p>
! New proposed resolution:
  </p>
  <p>
! Change 29.4 [atomics.lockfree] as indicated:
! </p><blockquote><pre>#define ATOMIC_CHAR_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
! #define ATOMIC_CHAR16_T_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
! #define ATOMIC_CHAR32_T_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
! #define ATOMIC_WCHAR_T_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
! #define ATOMIC_SHORT_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
! #define ATOMIC_INT_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
! #define ATOMIC_LONG_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
! #define ATOMIC_LLONG_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
! #define ATOMIC_ADDRESS_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
  </pre></blockquote>
- <p></p>
- <p><b>Proposed resolution:</b></p>
- Against FCD, N3092:
  <p>
! In [atomics.syn], header <tt>&lt;atomic&gt;</tt> synopsis replace as indicated:
  </p>
! <blockquote><pre>// 29.4, lock-free property
! <del>#define ATOMIC_INTEGRAL_LOCK_FREE <em>unspecified</em></del>
! <ins>#define ATOMIC_CHAR_LOCK_FREE <em>implementation-defined</em></ins>
! <ins>#define ATOMIC_CHAR16_T_LOCK_FREE <em>implementation-defined</em></ins>
! <ins>#define ATOMIC_CHAR32_T_LOCK_FREE <em>implementation-defined</em></ins>
! <ins>#define ATOMIC_WCHAR_T_LOCK_FREE <em>implementation-defined</em></ins>
! <ins>#define ATOMIC_SHORT_LOCK_FREE <em>implementation-defined</em></ins>
! <ins>#define ATOMIC_INT_LOCK_FREE <em>implementation-defined</em></ins>
! <ins>#define ATOMIC_LONG_LOCK_FREE <em>implementation-defined</em></ins>
! <ins>#define ATOMIC_LLONG_LOCK_FREE <em>implementation-defined</em></ins>
! #define ATOMIC_ADDRESS_LOCK_FREE <em>unspecified</em>
  </pre></blockquote>
  
  
  
  
  
  
  <hr>
! <h3><a name="1459"></a>1459. [FCD] Overlapping evaluations are allowed</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Canada <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1458">1458</a></p>
  <p><b>Discussion:</b></p>
- <p><b>Addresses CA-21, GB-131</b></p>
- 
- 29.4 [atomics.lockfree] p.8 states:
- <p></p><blockquote>
- An atomic store shall only store a value that has
- been computed from constants and program input values
- by a finite sequence of program evaluations, such
- that each evaluation observes the values of variables
- as computed by the last prior assignment in the
- sequence.
- </blockquote><p></p>
  <p>
! ... but 1.9 [intro.execution] p.13 states:
  </p>
! <p></p><blockquote>
! If A is not sequenced before B and B is not
! sequenced before A, then A and B are unsequenced.
! [ <em>Note</em>: The execution of unsequenced
! evaluations can overlap. — <em>end note</em> ]
! </blockquote><p></p>
  <p>
! Overlapping executions can make it impossible to
! construct the sequence described in 29.4 [atomics.lockfree] p.8. We are not
! sure of the intention here and do not offer a suggestion for
! change, but note that 29.4 [atomics.lockfree] p.8 is the condition that prevents
! out-of-thin-air reads.
  </p>
  <p>
! For an example, suppose we have a function invocation
! f(e1,e2). The evaluations of e1 and e2 can overlap.
! Suppose that the evaluation of e1 writes y and reads x
! whereas the evaluation of e2 reads y and writes x, with
! reads-from edges as below (all this is within a single
! thread).
! </p><pre> e1           e2
! Wrlx y--   --Wrlx x
!       rf\ /rf
!          X
!         / \
! Rrlx x&lt;-   -&gt;Rrlx y
! </pre>
! This seems like it should be allowed, but there seems to
! be no way to produce a sequence of evaluations with the
! property above.
! <p></p>
! In more detail, here the two evaluations, e1 and e2, are
! being executed as the arguments of a function and are
! consequently not sequenced-before each other. In
! practice we'd expect that they could overlap (as allowed
! by 1.9 [intro.execution] p.13), with the two writes taking effect before the two
! reads. However, if we have to construct a linear order of
! evaluations, as in 29.4 [atomics.lockfree] p.8, then the execution above is not
! permited. Is that really intended?
! 
! <p><i>[
! Resolution proposed by ballot comment
! ]</i></p>
! 
  <p>
! Please clarify.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
  
--- 19050,20019 ----
  
  
  <hr>
! <h3><a name="2267"></a>2267. <tt>partial_sort_copy</tt> underspecified for ranges of two different types</h3>
! <p><b>Section:</b> 25.4.1.4 [partial.sort.copy] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Matt Austern  <b>Opened:</b> 2013-06-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! The signature of this function is:
! </p>
  
! <blockquote><pre>
! template&lt;class InputIterator, class RandomAccessIterator&gt;
! RandomAccessIterator
! partial_sort_copy(InputIterator first, InputIterator last,
!                   RandomAccessIterator result_first,
!                   RandomAccessIterator result_last);
  
! </pre></blockquote>
  
+ <p>
+ (and the usual overload for an explicitly provided comparison function). The standard says nothing about requirements 
+ in the case where the input type (<tt>iterator_traits&lt;InputIterator&gt;::value_type</tt>) and the output type 
+ (<tt>iterator_traits&lt;RandomAccessIterator&gt;::value_type</tt>) are different.
+ <p/>
+ Presumably the input type must be convertible to the output type. What's less clear is what the requirements are on 
+ the comparison operator. Does the algorithm only perform comparisons on two values of the output type, or does it also 
+ perform comparisons on values of the input type, or might it even perform heterogeneous comparisons?
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2269"></a>2269. Container iterators and argument-dependent lookup</h3>
+ <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2013-06-26 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Consider the following code snippet:
+ </p>
+ 
+ <blockquote><pre>
+ #include &lt;vector&gt;
+ #include &lt;algorithm&gt;
+ 
+ int main() {
+   std::vector&lt;int&gt; v1(100, 3);
+   std::vector&lt;int&gt; v2(100);
+   copy(v1.begin(), v1.end(), v2.begin());
+ }
+ </pre></blockquote>
+ 
+ <p>
+ It compiles without error on my desktop. Is it required to? I can't find evidence from the standard that it is. 
+ In my test <tt>std::copy</tt> was found by argument-dependent lookup because the implementation I used made 
+ <tt>std::vector&lt;int&gt;::iterator</tt> a user-defined type defined in namespace <tt>std</tt>. But the standard 
+ only requires <tt>std::vector&lt;int&gt;::iterator</tt> to be an implementation specified random access iterator 
+ type. I can't find anything requiring it to be a user-defined type at all (and in fact there are reasonable implementation 
+ where it isn't), let alone a user defined type defined in a specific namespace.
+ </p>
+ 
+ <p>
+ Since the defining namespace of container iterators is visible to users, should the standard say anything about what 
+ that namespace is?
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2273"></a>2273. <tt>regex_match</tt> ambiguity</h3>
+ <p><b>Section:</b> 28.11.2 [re.alg.match] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2013-07-14 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#re.alg.match">issues</a> in [re.alg.match].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 28.11.2 [re.alg.match] p2 in describing regex_match says:
+ </p>
  <blockquote>
! <p>
! -2-  <i>Effects:</i> Determines whether there is a match between the regular expression <tt>e</tt>, and all of 
! the character sequence <tt>[first,last)</tt>. The parameter <tt>flags</tt> is used to control how the expression 
! is matched against the character sequence. Returns true if such a match exists, false otherwise.
! </p>
  </blockquote>
  
! <p>
! It has come to my attention that different people are interpreting the first sentence of p2 in different ways:
! </p>
! 
! <ol>
! <li><p>
! If a search of the input string using the regular expression <tt>e</tt> matches the entire input string, 
! <tt>regex_match</tt> should return true.
! </p></li>
! <li><p>
! Search the input string using the regular expression <tt>e</tt>. Reject all matches that do not match the 
! entire input string. If a such a match is found, return true.
! </p></li>
! </ol>
  
  <p>
! The difference between these two subtly different interpretations is found using the following ECMAScript example:
! </p>
  
! <blockquote><pre>
! std::regex re("Get|GetValue");
! </pre></blockquote>
  
+ <p>
+ Using <tt>regex_search</tt>, this <tt>re</tt> can never match the input string <tt>"GetValue"</tt>, because ECMA 
+ specifies that alternations are ordered, not greedy. As soon as <tt>"Get"</tt> is matched in the left alternation, 
+ the matching algorithm stops.
+ <p/>
+ Using definition 1, <tt>regex_match</tt> would return false for an input string of <tt>"GetValue"</tt>.
+ <p/>
+ However definition 2 alters the grammar and appears equivalent to augmenting the regex with a trailing <tt>'$'</tt>, 
+ which is an anchor that specifies, reject any matches which do not come at the end of the input sequence.
+ So, using definition 2, <tt>regex_match</tt> would return true for an input string of <tt>"GetValue"</tt>.
+ <p/>
+ My opinion is that it would be strange to have <tt>regex_match</tt> return true for a <tt>string/regex</tt> 
+ pair that <tt>regex_search</tt> could never find. I.e. I favor definition 1.
+ <p/>
+ John Maddock writes:
+ <p/>
+ The intention was always that <tt>regex_match</tt> would reject any match candidate which didn't match the entire 
+ input string. So it would find <tt>GetValue</tt> in this case because the <tt>"Get"</tt> alternative had already 
+ been rejected as not matching. Note that the comparison with ECMA script is somewhat moot, as ECMAScript defines 
+ the regex grammar (the bit we've imported), it does not define anything like <tt>regex_match</tt>, nor do we import 
+ from ECMAScript the behaviour of that function. So IMO the function should behave consistently regardless of the 
+ regex dialect chosen. Saying "use awk regexes" doesn't cut it, because that changes the grammar in other ways.
+ <p/>
+ (John favors definition 2).
+ <p/>
+ We need to clarify 28.11.2 [re.alg.match]/p2 in one of these two directions.
+ </p>
  
! <p><i>[2014-06-21, Rapperswil]</i></p>
! 
! <p>
! AM: I think there's a clear direction and consensus we agree with John Maddock's position, and if noone else 
! thinks we need the other function I won't ask for it.
! <p/>
! Marshall Clow and STL to draft.
  </p>
  
  
+ 
  <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2276"></a>2276. Missing requirement on <tt>std::promise::set_exception</tt></h3>
! <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-07-30 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures">issues</a> in [futures].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The standard does not specify the behaviour of this program:
! </p>
! 
! <blockquote><pre>
! #include &lt;future&gt;
! #include &lt;cassert&gt;
! 
! struct NonTrivial
! {
!   NonTrivial() : init(true) { }
!   ~NonTrivial() { assert(init); }
!   bool init;
! };
! 
! int main()
! {
!   std::promise&lt;NonTrivial&gt; p;
!   auto f = p.get_future();
!   p.set_exception(std::exception_ptr());
!   f.get();
! }
! </pre></blockquote>
! 
! <p>
! The standard doesn't forbid making the state ready with a null
! <tt>exception_ptr</tt>, so what should <tt>get()</tt> return?  There's no stored
! exception to throw, but it can't return a value because none was initialized.
! <p/>
! A careful reading of the standard shows 30.6.4 [futures.state] p8 says
! "A shared state is <em>ready</em> only if it holds a value or an exception
! ready for retrieval." One can infer from the fact that <tt>set_exception()</tt>
! makes the state ready that it must store a value or exception, so
! cannot store "nothing", but that isn't explicit.
! <p/>
! The <tt>promise::set_exception()</tt> and <tt>promise::set_exception_at_thread_exit()</tt> 
! members should require <tt>p != nullptr</tt> or should state the type of exception thrown 
! if <tt>p</tt> is null.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! SG1 provides P/R and requests move to SG1-OK status: Add Requires clauses for promise (30.6.5 [futures.promise]) set_exception (before p18) and set_exception_at_thread_exit (before p24): Requires: p is not null.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N4431.
! </p>
! Add Requires clauses for promise (30.6.5 [futures.promise]) <tt>set_exception</tt> (before p18) and 
! <tt>set_exception_at_thread_exit</tt> (before p24): <i>Requires</i>: <tt>p</tt> is not null.
! 
! <ol>
! <li><p>Change 30.6.5 [futures.promise] as depicted:</p>
! 
  <blockquote>
! <pre>
! void set_exception(exception_ptr p);
! </pre>
! <blockquote>
! <p>
! <ins>-??- <i>Requires:</i> <tt>p</tt> is not null. </ins>
! </p>
! <p>
! -18- <i>Effects:</i> atomically stores the exception pointer <tt>p</tt> in the shared state and makes that state ready (30.6.4).
! </p>
! </blockquote>
  </blockquote>
  
+ <blockquote>
+ <pre>
+ void set_exception_at_thread_exit(exception_ptr p);
+ </pre>
+ <blockquote>
+ <p>
+ <ins>-??- <i>Requires:</i> <tt>p</tt> is not null. </ins>
+ </p>
+ <p>
+ -24- <i>Effects:</i> Stores the exception pointer <tt>p</tt> in the shared state without making that state ready immediately. [&hellip;]
+ </p>
+ </blockquote>
+ </blockquote>
+ </li></ol>
+ 
+ 
  
  
  
  
  <hr>
! <h3><a name="2277"></a>2277. [arrays.ts] <tt>&lt;dynarray&gt;</tt> is missing in 24.7/1</h3>
! <p><b>Section:</b> 24.7 [iterator.range] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Cassio Neri <b>Opened:</b> 2013-07-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#iterator.range">active issues</a> in [iterator.range].</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.range">issues</a> in [iterator.range].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses: arrays.ts</b></p>
  
! <p>
! Section 24.7 [iterator.range] p1 specifies header files that, in addition to
! <tt>&lt;iterator&gt;</tt>, make available the function templates in 24.7
! (<tt>begin</tt>, <tt>end</tt>, etc.) but it fails to mention
! <tt>&lt;dynarray&gt;</tt>. This seems to be just an oversight.
! </p>
  
! <p><i>[2013-09 Chicago:]</i></p>
  
  <p>
! Move to Deferred. This feature will ship after C++14 and should be revisited then. 
  </p>
  
! <p><i>[2014-06-06 pre-Rapperswill]</i></p>
  
  <p>
! This issue has been reopened as arrays-ts.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Modify 24.7 [iterator.range] p1 as indicated:</p>
! 
! <blockquote><p>
! -1- In addition to being available via inclusion of the <tt>&lt;iterator&gt;</tt> header, the function templates in 24.7 are
! available when any of the following headers are included: <tt>&lt;array&gt;</tt>, <tt>&lt;deque&gt;</tt>, 
! <ins><tt>&lt;dynarray&gt;</tt>,</ins>
! <tt>&lt;forward_list&gt;</tt>, <tt>&lt;list&gt;</tt>, <tt>&lt;map&gt;</tt>, <tt>&lt;regex&gt;</tt>, 
! <tt>&lt;set&gt;</tt>, <tt>&lt;string&gt;</tt>, <tt>&lt;unordered_map&gt;</tt>, <tt>&lt;unordered_set&gt;</tt>, 
! and <tt>&lt;vector&gt;</tt>.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2286"></a>2286. <tt>stringbuf::underflow()</tt> underspecified</h3>
! <p><b>Section:</b> 27.8.2.4 [stringbuf.virtuals] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Sergey Zubkov <b>Opened:</b> 2013-08-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
  <p>
! In 27.8.2.4 [stringbuf.virtuals]/1, <tt>basic_stringbuf::underflow()</tt> is specified to unconditionally 
! return <tt>traits::eof()</tt> when a read position is not available.
! <p/>
! The semantics of <tt>basic_stringbuf</tt> require, and existing libraries implement it so that this function makes 
! a read position available if possible to do so, e.g. if some characters were inserted into the stream since the 
! last call to <tt>overflow()</tt>, resulting in <tt>pptr() &gt; egptr()</tt>. Compare to the conceptually similar 
! D.7.1.3 [depr.strstreambuf.virtuals]/15.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! 
! <li><p>Change 27.8.2.4 [stringbuf.virtuals] as indicated:</p>
! 
! <blockquote>
! <pre>
! int_type underflow();
  </pre><blockquote>
! <p>
! -1- <i>Returns:</i> If the input sequence has a read position available <ins>or the function makes a read position available 
! (as described below)</ins>, returns <tt>traits::to_int_type(*gptr())</tt>. Otherwise, returns <tt>traits::eof()</tt>. Any 
! character in the underlying buffer which has been initialized is considered to be part of the input sequence.
! <p/>
! <ins>-?- The function can make a read position available only if <tt>(mode &amp; ios_base::in) != 0</tt> and if the write 
! next pointer <tt>pptr()</tt> is not null and is greater than the current read end pointer <tt>egptr()</tt>. To make a read 
! position available, the function alters the read end pointer <tt>egptr()</tt> to equal <tt>pptr()</tt>.</ins>
! </p>
  </blockquote></blockquote>
+ </li>
+ 
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2289"></a>2289. <tt>constexpr</tt> guarantees of defaulted functions still insufficient</h3>
! <p><b>Section:</b> 20.3.2 [pairs.pair], 20.4.2.1 [tuple.cnstr], 20.12.5 [time.duration] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-09-09 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs.pair">issues</a> in [pairs.pair].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! During the acceptance of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3471.html">N3471</a> and
! some similar <tt>constexpr</tt> papers, specific wording was added to <tt>pair</tt>, <tt>tuple</tt>, and other templates
! that were intended to impose implementation constraints that ensure that the observable <tt>constexpr</tt> "character"
! of a defaulted function template is solely determined by the required expressions of the user-provided types when instantiated,
! for example:
! </p>
  
! <blockquote><p>
! The defaulted move and copy constructor, respectively, of pair shall be a <tt>constexpr</tt> function if and only if
! all required element-wise initializations for copy and move, respectively, would satisfy the requirements for
! a <tt>constexpr</tt> function.
! </p></blockquote>
  
! <p>
! This wording doesn't require enough, especially since the core language via CWG 1358 does now support <tt>constexpr</tt>
! function template instantiations, even if such function cannot appear in a constant expression (as specified in 5.20 [expr.const]) 
! or as a constant initializer of that object (as specified in 3.6.2 [basic.start.init]). The wording should be 
! improved and should require valid uses in constant expressions and as constant initializers instead.
! </p>
! 
! <p><i>[Lenexa 2015-05-05]</i></p>
! 
! <p>STL : notice order of move/copy and copy/move with "respectively".</p>
! <p>General word-smithing; ask for updated wording</p>
! <p>Are we happy with this with changes we are suggesting?</p>
! <p>unanimous</p>
  
  
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3691.</p>
+ 
+ <ol>
+ <li><p>Change 20.3.2 [pairs.pair] p2 as indicated:</p>
+ 
  <blockquote>
! <p>
! -2- <del>The defaulted move and copy constructor, respectively, of pair shall be a <tt>constexpr</tt> function if and only if
! all required element-wise initializations for copy and move, respectively, would satisfy the requirements for
! a <tt>constexpr</tt> function</del><ins>An invocation of the move or copy constructor of <tt>pair</tt> shall be a constant expression 
! (5.20 [expr.const]) if all required element-wise initializations would be constant expressions. An invocation of the 
! move or copy constructor of <tt>pair</tt> shall be a constant initializer for that <tt>pair</tt> object (3.6.2 [basic.start.init])
! if all required element-wise initializations would be constant initializers for the respective subobjects</ins>.
! </p>
  </blockquote>
+ </li>
+ 
+ <li><p>Change 20.4.2.1 [tuple.cnstr] p2 as indicated:</p>
+ 
+ <blockquote>
+ <p>
+ -2- <del>The defaulted move and copy constructor, respectively, of <tt>tuple</tt> shall be a <tt>constexpr</tt> function if 
+ and only if all required element-wise initializations for copy and move, respectively, would satisfy the requirements for
+ a <tt>constexpr</tt> function. The defaulted move and copy constructor of <tt>tuple&lt;&gt;</tt> shall be <tt>constexpr</tt> 
+ functions</del><ins>An invocation of the move or copy constructor of <tt>tuple</tt> shall be a constant expression (5.20 [expr.const])
+ if all required element-wise initializations would be constant expressions. An invocation of the move or copy constructor of 
+ <tt>tuple</tt> shall be a constant initializer for that <tt>tuple</tt> object (3.6.2 [basic.start.init]) if all 
+ required element-wise initializations would be constant initializers for the respective subobjects. An invocation of the 
+ move or copy constructor of <tt>tuple&lt;&gt;</tt> shall be a constant expression, or a constant initializer for that 
+ <tt>tuple&lt;&gt;</tt> object, respectively, if the function argument would be constant expression</ins>.
+ </p>
+ </blockquote>
+ </li>
+ 
+ <li><p>Change 20.12.5 [time.duration] p7 as indicated:</p>
+ 
+ <blockquote>
+ <p>
+ -7- <i>Remarks:</i> <del>The defaulted copy constructor of duration shall be a <tt>constexpr</tt> function if and only if
+ the required initialization of the member <tt>rep_</tt> for copy and move, respectively, would satisfy the
+ requirements for a <tt>constexpr</tt> function.</del><ins>An invocation of the copy constructor of <tt>duration</tt> shall 
+ be a constant expression (5.20 [expr.const]) if the required initialization of the member <tt>rep_</tt> would be a constant expression.
+ An invocation of the copy constructor of <tt>duration</tt> shall be a constant initializer for that <tt>duration</tt> object 
+ (3.6.2 [basic.start.init]) if the required initialization of the member <tt>rep_</tt> would be constant initializers 
+ for this subobject</ins>.
+ </p>
+ </blockquote>
+ </li>
+ 
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2290"></a>2290. Top-level "SFINAE"-based constraints should get a separate definition in Clause 17</h3>
+ <p><b>Section:</b> 20.10 [meta] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-09-02 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The current library specification uses at several places wording that is intended to refer to
+ core language template deduction failure at the top-level of expressions (aka "SFINAE"), for example:
+ </p>
+ 
+ <blockquote><p>
+ The expression <tt>declval&lt;T&gt;() = declval&lt;U&gt;()</tt> is well-formed when treated as an unevaluated operand (Clause 5). 
+ Access checking is performed as if in a context unrelated to <tt>T</tt> and <tt>U</tt>. Only the validity of the immediate context 
+ of the assignment expression is considered. [<i>Note:</i> The compilation of the expression can result in side effects 
+ such as the instantiation of class template specializations and function template specializations, the generation of
+ implicitly-defined functions, and so on. Such side effects are not in the "immediate context" and can result in the program
+ being ill-formed. &mdash; <i>end note</i>]
+ </p></blockquote>
+ 
+ <p>
+ Similar wording can be found in the specification of <tt>result_of</tt>, <tt>is_constructible</tt>, and <tt>is_convertible</tt>,
+ being added to resolve an NB comment by LWG <a href="lwg-defects.html#1390">1390</a> and <a href="lwg-defects.html#1391">1391</a> through 
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">N3142</a>.
+ <p/>
+ This wording is necessary to limit speculative compilations needed to implement these traits, but it is also lengthy and repetitive.
+ </p>
+ 
+ <p><i>[2014-05-19, Daniel suggests a descriptive term]</i></p>
+ 
+ <p>
+ <b>constrictedly well-formed expression</b>:
+ <p/>
+ An expression <em>e</em> depending on a set of types <tt>A1</tt>, ..., <tt>An</tt> which is well-formed when treated as 
+ an unevaluated operand (Clause 5). Access checking is performed as if in a context unrelated to <tt>A1</tt>, ..., 
+ <tt>An</tt>. Only the validity of the immediate context of <em>e</em> is considered. [<i>Note:</i> The compilation of 
+ the expression can result in side effects such as the instantiation of class template specializations and function 
+ template specializations, the generation of implicitly-defined functions, and so on. Such side effects are not in the 
+ "immediate context" and can result in the program being ill-formed. &mdash; <i>end note</i>]
+ </p>
+ 
+ <p><i>[2014-05-20, Richard and Jonathan suggest better terms]</i></p>
+ 
+ <p>
+ Richard suggested "locally well-formed"
+ <p/>
+ Jonathan suggested "contextually well-formed" and then "The expression ... is valid in a contrived argument
+ deduction context"
+ </p>
+ 
+ <p><i>[2014-06-07, Daniel comments and improves wording]</i></p>
  
+ <p>
+ The 2014-05-19 suggestion did only apply to expressions, but there are two important examples that are not expressions, but instead
+ are involving an <em>object definition</em> (<tt>std::is_constructible</tt>) and a <em>function definition</em> 
+ (<tt>std::is_convertible</tt>), respectively, instead. Therefore I suggest to rephrase the usage of "expression" into "program 
+ construct" in the definition of Jonathan's suggestion of "valid in a contrived argument deduction context".
+ <p/>
+ I would like to point out that given the new definition of "valid in a contrived argument deduction context", there are several other 
+ places of the Library specification that could take advantage of this wording to improve the existing specification, such as 
+ 20.9.12.2 [func.wrap.func] p2, most functions in 20.7.8.2 [allocator.traits.members], and the <tt>**Insertable</tt>, 
+ <tt>EmplaceConstructible</tt>, and <tt>Erasable</tt> definitions in 23.2.1 [container.requirements.general], but given that
+ these are not fully described in terms of the aforementioned wording <em>yet</em>, I would recommend to fix them by a separate issue 
+ once the committee has agreed on following the suggestion presented by this issue.
+ </p>
+ 
+ <p><i>[2015-05-05 Lenexa: Move to Open]</i></p>
+ 
+ <p>...</p>
+ <p>MC: I think we like the direction but it isn't quite right: it needs some work</p>
+ <p>JW: I'm prepared to volunteer to move that further, hopefully with the help of Daniel</p>
+ <p>Roger Orr: should this be Core wording because it doesn't really have anything to do with libraries - the term could then just be used here</p>
+ <p>AM: Core has nothing to deal with that, though</p>
+ <p>HT: it seems there is nothing to imply that allows dropping out with an error - maybe that's a separate issue</p>
+ <p>MC: I'm not getting what you are getting at: could you write an issue? - any objection to move to Open?</p>
+ <p>...</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Add the following new definition to 17.3 [definitions] as indicated:</p>
! 
! <p>
! <ins><b>valid in a contrived argument deduction context</b> [defns.valid.contr.context]</ins>
! <p/>
! <ins>A program construct <em>c</em> depending on a set of types <tt>A1</tt>, ..., <tt>An</tt>, and treated as 
! an unevaluated operand (Clause 5) when <em>c</em> is an expression, which is well-formed. 
! Access checking is performed as if in a context unrelated to <tt>A1</tt>, ..., <tt>An</tt>. 
! Only the validity of the immediate context (14.8.2 [temp.deduct]) of <em>c</em> is considered. 
! [<i>Note:</i> The compilation of <em>c</em> can result in side effects such as the instantiation of class template 
! specializations and function template specializations, the generation of implicitly-defined functions, and so on. 
! Such side effects are not in the "immediate context" and can result in the program being ill-formed. &mdash; 
! <i>end note</i>].</ins>
! </p>
! </li>
! 
! <li><p>Change Table 49 ("Type property predicates") as indicated:</p>
  
  <blockquote>
  <table border="1">
! <caption>Table 49 &mdash; Type property predicates</caption>
  <tr>
! <th align="center">Template</th>
! <th align="center">Condition</th>
! <th align="center">Preconditions</th>
  </tr>
+ 
  <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
  </tr>
+ 
  <tr>
! <td>
! <tt>template &lt;class T, class U&gt;<br/>
! struct is_assignable;</tt>
! </td>
! 
! <td>
! The expression
! <tt>declval&lt;T&gt;() =<br/>
! declval&lt;U&gt;()</tt> is <ins>valid in a<br/>
! contrived argument deduction context<br/>
! ([defns.valid.contr.context]) for types<br/>
! <tt>T</tt> and <tt>U</tt>.</ins>
! <del>well-formed when treated<br/>
! as an unevaluated operand<br/>
! (Clause 5). Access<br/>
! checking is performed as if<br/>
! in a context unrelated to <tt>T</tt><br/>
! and <tt>U</tt>. Only the validity of<br/>
! the immediate context of<br/>
! the assignment expression<br/>
! is considered. [<i>Note</i>: The<br/>
! compilation of the<br/>
! expression can result in<br/>
! side effects such as the<br/>
! instantiation of class<br/>
! template specializations<br/>
! and function template<br/>
! specializations, the<br/>
! generation of<br/>
! implicitly-defined<br/>
! functions, and so on. Such<br/>
! side effects are not in the<br/>
! "immediate context" and<br/>
! can result in the program<br/>
! being ill-formed. &mdash; end<br/>
! note]</del>
! </td>
! 
! <td align="center">
! [&hellip;]
! </td>
  </tr>
+ 
  <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
  </tr>
+ 
+ </table>
+ </blockquote>
+ 
+ </li>
+ 
+ <li><p>Change 20.10.4.3 [meta.unary.prop] p7 as indicated:</p>
+ 
+ <blockquote><p>
+ -7- Given the following function prototype:
+ </p>
+ <blockquote><pre>
+ template &lt;class T&gt;
+   add_rvalue_reference_t&lt;T&gt; create() noexcept;
+ </pre></blockquote>
+ <p>
+ the predicate condition for a template specialization <tt>is_constructible&lt;T, Args...&gt;</tt> shall be satisfied
+ if and only if the following variable definition <del>would be well-formed</del> for some invented 
+ variable <tt>t</tt> <ins>would be valid in a contrived argument deduction context ([defns.valid.contr.context]) for 
+ types <tt>T</tt> and <tt>Args...</tt></ins>:
+ </p>
+ <blockquote><pre>
+ T t(create&lt;Args&gt;()...);
+ </pre></blockquote>
+ <p>
+ [<i>Note</i>: These tokens are never interpreted as a function declaration. &mdash; <i>end note</i>] <del>Access checking is
+ performed as if in a context unrelated to <tt>T</tt> and any of the <tt>Args</tt>. Only the validity of the immediate context
+ of the variable initialization is considered. [<i>Note</i>: The evaluation of the initialization can result in side
+ effects such as the instantiation of class template specializations and function template specializations, the
+ generation of implicitly-defined functions, and so on. Such side effects are not in the "immediate context"
+ and can result in the program being ill-formed. &mdash; <i>end note</i>]</del>
+ </p>
+ </blockquote>
+ </li>
+ 
+ <li><p>Change Table 57 ("Other transformations") as indicated:</p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 57 &mdash; Other transformations</caption>
  <tr>
! <th align="center">Template</th>
! <th align="center">Condition</th>
! <th align="center">Comments</th>
  </tr>
+ 
  <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
  </tr>
+ 
  <tr>
! <td>
! <tt>template &lt;class Fn, class... ArgTypes&gt;<br/>
! struct result_of&lt;Fn(ArgTypes...)&gt;;</tt>
! </td>
! 
! <td align="center">
! [&hellip;]
! </td>
! 
! <td>
! If the expression<br/>
! <tt><i>INVOKE</i>(declval&lt;Fn&gt;(),<br/>
! declval&lt;ArgTypes&gt;()...)</tt> is<br/>
! <ins>valid in a contrived argument deduction<br/>
! context ([defns.valid.contr.context]) for types<br/>
! <tt>Fn</tt> and <tt>ArgTypes...</tt></ins>
! <del>well<br/>
! formed when treated as an<br/>
! unevaluated operand (Clause 5)</del>, the<br/>
! member typedef type shall name the<br/>
! type<br/>
! <tt>decltype(<i>INVOKE</i>(declval&lt;Fn&gt;(),<br/>
! declval&lt;ArgTypes&gt;()...))</tt>;<br/>
! otherwise, there shall be no member<br/>
! type. <del>Access checking is performed as<br/>
! if in a context unrelated to <tt>Fn</tt> and<br/>
! <tt>ArgTypes</tt>. Only the validity of the<br/>
! immediate context of the expression is<br/>
! considered. [<i>Note</i>: The compilation of<br/>
! the expression can result in side<br/>
! effects such as the instantiation of<br/>
! class template specializations and<br/>
! function template specializations, the<br/>
! generation of implicitly-defined<br/>
! functions, and so on. Such side effects<br/>
! are not in the "immediate context"<br/>
! and can result in the program being<br/>
! ill-formed. &mdash; <i>end note</i>]</del>
! </td>
  </tr>
+ 
  <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
  </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! 
! <li><p>Change 20.10.6 [meta.rel] p4 as indicated:</p>
! 
! <blockquote><p>
! -4- Given the following function prototype:
! </p>
! <blockquote><pre>
! template &lt;class T&gt;
!   add_rvalue_reference_t&lt;T&gt; create() noexcept;
! </pre></blockquote>
! <p>
! the predicate condition for a template specialization <tt>is_convertible&lt;From, To&gt;</tt> shall be satisfied if and
! only if the return expression in the following code would be <del>well-formed</del><ins>valid in a contrived argument 
! deduction context ([defns.valid.contr.context]) for types <tt>To</tt> and <tt>From</tt></ins>, including any implicit conversions
! to the return type of the function:
! </p>
! <blockquote><pre>
! To test() {
!   return create&lt;From&gt;();
! }
! </pre></blockquote>
! <p>
! [<i>Note</i>: This requirement gives well defined results for reference types, <tt>void</tt> types, array types, and
! function types. &mdash; <i>end note</i>] <del>Access checking is performed as if in a context unrelated to <tt>To</tt> 
! and <tt>From</tt>. Only the validity of the immediate context of the expression of the return-statement (including conversions to
! the return type) is considered. [<i>Note</i>: The evaluation of the conversion can result in side effects such as
! the instantiation of class template specializations and function template specializations, the generation of
! implicitly-defined functions, and so on. Such side effects are not in the "immediate context" and can result
! in the program being ill-formed. &mdash; <i>end note</i>]</del>
! </p>
! </blockquote>
! </li>
! 
! </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2292"></a>2292. Find a better phrasing for "shall not participate in overload resolution"</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2013-09-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The C++14 CD has 25 sections including the phrase "X shall not
! participate in overload resolution ...". Most of these uses are double
! negatives, which are hard to interpret. "shall not ... unless" tends
! to be the easiest to read, since the condition is true when the
! function is available, but we also have a lot of "if X is not Y, then
! Z shall not participate", which actually means "You can call Z if X is
! Y." The current wording is also clumsy and long-winded. We should find
! a better and more concise phrasing.
! <p/>
! As an initial proposal, I'd suggest using "X is enabled if and only if Y" in prose
! and adding an "<i>Enabled If:</i> ..." element to 17.5.1.4 [structure.specifications].
! <p/>
! Daniel:
! <p/>
! I suggest to name this new specification element for 17.5.1.4 [structure.specifications]
! as "<i>Template Constraints:</i>" instead, because the mentioned wording form was intentionally provided 
! starting with LWG <a href="lwg-defects.html#1237">1237</a> to give implementations more freedom to realize the 
! concrete constraints. Instead of the original <tt>std::enable_if</tt>-based specifications
! we can use better forms of "SFINAE" constraints today and it eases the path to possible language-based
! constraints in the future.
  </p>
  
  
! 
! <p><b>Proposed resolution:</b></p>
! 
  
  
+ 
+ 
+ <hr>
+ <h3><a name="2294"></a>2294. <tt>&lt;cstdlib&gt;</tt> should declare <tt>abs(double)</tt></h3>
+ <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2013-09-04 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! &hellip; and <tt>abs(float)</tt> and <tt>abs(long double)</tt>. And <tt>&lt;cmath&gt;</tt> should declare 
! <tt>abs(int)</tt>, <tt>abs(long)</tt>, and <tt>abs(long long)</tt>.
! <p/>
! As things currently stand, this program is illegal:
! </p>
! <blockquote><pre>
! #include &lt;cstdlib&gt;
  
! int main() {
!   double d = -1.23;
!   double dd = std::abs(d);
!   return 0;
! }
  </pre></blockquote>
! <p>
! The call is ambiguous because of the various integer overloads, that's because <tt>&lt;cstdlib&gt;</tt> provides 
! <tt>abs(int)</tt> but not <tt>abs(double)</tt>.
! <p/>
! This lead one commenter on Stackoverflow to state that <tt>abs</tt> is dangerous, and to recommend using <tt>fabs</tt> instead.
! <p/>
! In general, it makes sense to declare overloaded functions that take user-defined types in the same header as the 
! definition of the user-defined types; it isn't necessary to declare all of the overloads in the same place. But 
! here we're not dealing with any user-defined types; we're dealing with builtin types, which are always defined; 
! all of the overloads should be defined in the same place, to avoid mysterious problems like the one in the code above.
! <p/>
! The standard library has six overloads for <tt>abs</tt>:
! </p>
! <blockquote><pre>
! int abs(int);  // &lt;cstdlib&gt;
! long abs(long); // &lt;cstdlib&gt;
! long long abs(long long); // &lt;cstdlib&gt;
  
+ float abs(float); // &lt;cmath&gt;
+ double abs(double); // &lt;cmath&gt;
+ long double abs(long double); // &lt;cmath&gt;
+ </pre></blockquote>
  <p>
! These should all be declared in both headers.
! <p/>
! I have no opinion on <tt>&lt;stdlib.h&gt;</tt> and <tt>&lt;math.h&gt;</tt>.
  </p>
+ 
+ <p><i>[2013-09 Chicago]</i></p>
+ 
  <p>
! This issue is related to LWG <a href="lwg-active.html#2192">2192</a>
! <p/>
! Move to open
  </p>
+ 
+ <p><i>[2014-02-13 Issaquah &mdash; Nicolai Josuttis suggest wording]</i></p>
+ 
+ 
+ <p><i>[2015-03-03, Geoffrey Romer provides improved wording]</i></p>
+ 
  <p>
! See proposed resolution of LWG <a href="lwg-active.html#2192">2192</a>.
! </p>
! 
! <strong>Previous resolution from Nicolai [SUPERSEDED]:</strong>
! <blockquote class = "note">
! <ol>
! <li><p>Edit 26.8 [c.math] after p7 as indicated:</p>
! 
! <blockquote><p>
! -6- In addition to the <tt>int</tt> versions of certain math functions in <tt>&lt;cstdlib&gt;</tt>, C++ adds <tt>long</tt> and <tt>long long</tt>
! overloaded versions of these functions, with the same semantics.
! <p/>
! -7- The added signatures are:
! </p>
! <blockquote><pre>
! long abs(long);                    <i>// labs()</i>
! long long abs(long long);          <i>// llabs()</i>
! ldiv_t div(long, long);            <i>// ldiv()</i>
! lldiv_t div(long long, long long); <i>// lldiv()</i>
  </pre></blockquote>
  <p>
! <ins>-?- To avoid ambiguities, C++ also adds the following overloads of <tt>abs()</tt> to <tt>&lt;cstdlib&gt;</tt>,
! with the semantics defined in <tt>&lt;cmath&gt;</tt>:</ins>
  </p>
! <blockquote><pre>
! <ins>float abs(float);
! double abs(double);
! long double abs(long double);</ins>
! </pre></blockquote>
! <p>
! <ins>-?- To avoid ambiguities, C++ also adds the following overloads of <tt>abs()</tt> to <tt>&lt;cmath&gt;</tt>,
! with the semantics defined in <tt>&lt;cstdlib&gt;</tt>:</ins>
! </p>
! <blockquote><pre>
! <ins>int abs(int);
! long abs(long);
! long long abs(long long);</ins>
  </pre></blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ </blockquote>
+ 
  
  
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ See proposed resolution of LWG <a href="lwg-active.html#2192">2192</a>.
+ </p>
+ 
  
  
  
  
  <hr>
! <h3><a name="2295"></a>2295. Locale name when the provided <tt>Facet</tt> is a <tt>nullptr</tt></h3>
! <p><b>Section:</b> 22.3.1.2 [locale.cons] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Juan Soulie <b>Opened:</b> 2013-09-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 22.3.1.2 [locale.cons] p14 ends with:
  </p>
! <blockquote><p>
! "[&hellip;] If <tt>f</tt> is null, the resulting object is a copy of <tt>other</tt>."
! </p></blockquote>
  <p>
! but the next line p15 says: 
  </p>
+ <blockquote><p>
+ "<i>Remarks:</i> The resulting locale has no name."
+ </p></blockquote>
  <p>
! But both can't be true when <tt>other</tt> has a name and <tt>f</tt> is null.
! <p/>
! I've tried it on two implementations (MSVC,GCC) and they are inconsistent with each other on this.
! </p>
  <p>
! Daniel Kr&uuml;gler:
! <p/>
! As currently written, the <i>Remarks</i> element applies unconditionally for all cases and thus should
! "win". The question arises whether the introduction of this element by LWG <a href="lwg-closed.html#424">424</a> had actually intended
! to change the previous <i>Note</i> to a <i>Remarks</i> element. In either case the wording should be improved
! to clarify this special case.
  </p>
  
  
+ 
  <p><b>Proposed resolution:</b></p>
  
  
*************** Please clarify.
*** 5730,5945 ****
  
  
  <hr>
! <h3><a name="1460"></a>1460. [FCD] Missing lock-free property for type <tt>bool</tt> should be added</h3>
! <p><b>Section:</b> 29.4 [atomics.lockfree] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.lockfree">issues</a> in [atomics.lockfree].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-154</b></p>
  
! There is no <tt>ATOMIC_BOOL_LOCK_FREE</tt> macro.
  
  
- <p><b>Proposed resolution:</b></p>
- Add <tt>ATOMIC_BOOL_LOCK_FREE</tt> to 29.4 [atomics.lockfree] and to 29.2 [atomics.syn]:
  <p>
! </p><blockquote><pre>[..]
! <ins>#define ATOMIC_BOOL_LOCK_FREE <em>unspecified</em></ins>
! #define ATOMIC_CHAR_LOCK_FREE <em>unspecified</em>
! #define ATOMIC_CHAR16_T_LOCK_FREE <em>unspecified</em>
! #define ATOMIC_CHAR32_T_LOCK_FREE <em>unspecified</em>
! [..]
  </pre></blockquote>
! <p></p>
  
  
  
  
  
! <hr>
! <h3><a name="1461"></a>1461. [FCD] Rename all <tt>ATOMIC_*</tt> macros as <tt>STD_ATOMIC_*</tt></h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Canada <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-26</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses CA-1</b></p>
  
! All <tt>ATOMIC_</tt>... macros should be prefixed with <tt>STD_</tt> as
! in <tt>STD_ATOMIC_</tt>... to indicate they are <tt>STD</tt> macros as
! other standard macros. The rationale that they all seem too long seems weak.
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change sub-clause 29.2 [atomics.syn] as indicated:
  <p>
! </p><blockquote><pre>[..]
! // <em>29.4, lock-free property</em>
! #define <ins>STD_</ins>ATOMIC_CHAR_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_CHAR16_T_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_CHAR32_T_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_WCHAR_T_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_SHORT_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_INT_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_LONG_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_LLONG_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_ADDRESS_LOCK_FREE <em>unspecified</em>
  
! // <em>29.6, operations on atomic types</em>
! #define <ins>STD_</ins>ATOMIC_VAR_INIT(value) <em>see below</em>
! [..]
  </pre></blockquote>
- <p></p>
  </li>
! <li>
! Change 29.4 [atomics.lockfree] p. 1 as indicated:
! <blockquote><pre>#define <ins>STD_</ins>ATOMIC_CHAR_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_CHAR16_T_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_CHAR32_T_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_WCHAR_T_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_SHORT_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_INT_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_LONG_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_LLONG_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_ADDRESS_LOCK_FREE <em>implementation-defined</em>
  </pre><blockquote>
! 1 The <tt><ins>STD_</ins>ATOMIC_..._LOCK_FREE</tt> macros indicate the lock-free property of the corresponding atomic types, [..]
! </blockquote></blockquote>
  </li>
! <li>
! Change 29.6 [atomics.types.operations] p. 5 as indicated:
! <blockquote><pre>#define <ins>STD_</ins>ATOMIC_VAR_INIT(value) <em>see below</em>
! </pre><blockquote>
! 5 <em>Remarks</em>: A macro that expands to a token sequence suitable for initializing an atomic variable of
! a type that is initializion-compatible with value. Concurrent access to the variable being initialized,
! even via an atomic operation, constitutes a data race. [ <em>Example:</em>
! <blockquote><pre>atomic_int v = <ins>STD_</ins>ATOMIC_VAR_INIT(5);
  </pre></blockquote>
! — <em>end example</em> ]
! </blockquote></blockquote>
  </li>
  <li>
! Change 29.7 [atomics.flag] p. 1+4 as indicated:
! <blockquote><pre>namespace std {
!   [..]
!   #define <ins>STD_</ins>ATOMIC_FLAG_INIT <em>see below</em>
! }
! </pre><blockquote>
! [..]
! 4 The macro <tt><ins>STD_</ins>ATOMIC_FLAG_INIT</tt> shall be defined in such a way that it can be used to initialize an object of
! type <tt>atomic_flag</tt> to the clear state. For a static-duration object, that initialization shall be static. It is
! unspecified whether an unitialized <tt>atomic_flag</tt> object has an initial state of set or clear. [ <em>Example:</em>
! <blockquote><pre>atomic_flag guard = <ins>STD_</ins>ATOMIC_FLAG_INIT;
! </pre></blockquote>
! — <em>end example</em> ]
! </blockquote></blockquote>
  </li>
  </ol>
  
  
  
  
  
  <hr>
! <h3><a name="1474"></a>1474. [FCD] weak compare-and-exchange confusion</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1470">1470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1475">1475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1476">1476</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1477">1477</a></p>
  <p><b>Discussion:</b></p>
  
  
  
- <p><b>Addresses US-175, US-165, CH-23, GB-135</b></p>
  
- 29.6 [atomics.types.operations] p. 23: The first sentence is grammatically incorrect.
  
! <p><i>[
! 2010-10-28 Daniel adds:
! ]</i></p>
  
  <p>
! Proposed resolution of duplicate issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1475">1475</a>:
  </p>
! Change 29.6 [atomics.types.operations] p. 23 as indicated:
! <blockquote>
! 23 <em>Remark</em>: <del>The weak compare-and-exchange operations may fail spuriously, that is, return false while
! leaving the contents of memory pointed to by <tt>expected</tt> before the operation is the same that same
! as that of the <tt>object</tt> and the same as that of <tt>expected</tt> after the operation</del><ins>The weak 
! compare-and-exchange operations may fail spuriously, that is, return false while leaving the contents of memory 
! pointed to by <tt>expected</tt> unchanged.</ins>. [ <em>Note</em>: This spurious failure enables implementation of 
! compare-and-exchange on a broader class of machines, e.g., loadlocked store-conditional machines. A consequence of 
! spurious failure is that nearly all uses of weak compare-and-exchange will be in a loop.
  <p>
! When a compare-and-exchange is in a loop, the weak version will yield better performance on some
! platforms. When a weak compare-and-exchange would require a loop and a strong one would not, the
! strong one is preferable. — <em>end note</em> ]
! </p></blockquote>
  
  
- <p><b>Proposed resolution:</b></p>
- Change 29.6 [atomics.types.operations] p. 23 as indicated:
- <blockquote>
- 23 <em>Remark</em>: <del>The weak compare-and-exchange operations may fail spuriously, that is, return false while
- leaving the contents of memory pointed to by <tt>expected</tt> before the operation is the same that same
- as that of the <tt>object</tt> and the same as that of <tt>expected</tt> after the operation</del><ins>The weak
- compare-and-exchange operations may fail spuriously. That is, it may return false while leaving the contents of 
- memory pointed to by <tt>expected</tt> the same as it was before the operation</ins>. [ <em>Note</em>: This spurious
- failure enables implementation of compare-and-exchange on a broader class of machines, e.g., loadlocked
- store-conditional machines. A consequence of spurious failure is that nearly all uses of weak
- compare-and-exchange will be in a loop.
  <p>
! When a compare-and-exchange is in a loop, the weak version will yield better performance on some
! platforms. When a weak compare-and-exchange would require a loop and a strong one would not, the
! strong one is preferable. — <em>end note</em> ]
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1478"></a>1478. [FCD] Clarify race conditions in atomics initialization</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-136</b></p>
  
! GB requests normative clarification in 29.6 [atomics.types.operations] p.4 that
! concurrent access constitutes a race, as already done on p.6 and p.7.
  
- <p><i>[
- Resolution proposed in ballot comment:
- ]</i></p>
  
  
! <blockquote>
! Initialisation of atomics:
  <p>
! We believe the intent is that for any atomics there is a distinguished
! initialisation write, but that this need not happens-before all the
! other operations on that atomic - specifically so that the
! initialisation write might be non-atomic and hence give rise to a data
! race, and hence undefined behaviour, in examples such as this (from
! Hans):
! </p><blockquote><pre>atomic&lt;atomic&lt;int&gt; *&gt; p
! f()                      |
! { atomic&lt;int&gt;x;          | W_na x
!   p.store(&amp;x,mo_rlx); | W_rlx p=&amp;x
! }                        |
  </pre></blockquote>
! (where na is nonatomic and rlx is relaxed). We suspect also that no
! other mixed atomic/nonatomic access to the same location is intended
! to be permitted. Either way, a note would probably help.
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 20021,20675 ----
  
  
  <hr>
! <h3><a name="2296"></a>2296. <tt>std::addressof</tt> should be <tt>constexpr</tt></h3>
! <p><b>Section:</b> 20.7.12.1 [specialized.addressof] <b>Status:</b> <a href="lwg-active.html#Review">Review</a>
!  <b>Submitter:</b> Daryle Walker <b>Opened:</b> 2013-09-08 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#specialized.addressof">issues</a> in [specialized.addressof].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Review">Review</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! I'm writing a function that needs to be <tt>constexpr</tt> and I wanted to take the address of its input. I was 
! thinking of using <tt>std::addressof</tt> to be safe, but it isn't currently <tt>constexpr</tt>. A 
! <a href="http://en.cppreference.com/w/cpp/memory/addressof">sample implementation</a> 
! couldn't be <tt>constexpr</tt> under the C++11 rules, though.
! <p/>
! Daniel Kr&uuml;gler:
! <p/>
! Indeed the core language clarified by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#1312">CWG 1312</a> 
! and by <a href="www.open-std.org/jtc1/sc22/wg21/docs/cwg_closed.html#1384">CWG 1384</a>, that such emulations of <tt>std::addressof</tt>
! implementations are not valid in constant expressions, therefore it seems more like a defect than a feature request to ask for 
! the guarantee that <tt>std::addressof</tt> is a <tt>constexpr</tt> function. It should be added that a similar requirement
! already exists for <tt>offsetof</tt> indirectly via the C99 standard as of 7.17 p3:
! </p>
! <blockquote>
! <p>
! The macros are [&hellip;]
! </p>
! <blockquote><pre>
! offsetof(type, member-designator)
! </pre></blockquote>
! <p>
! which expands to an integer constant expression that has type <tt>size_t</tt> [&hellip;]
! </p>
! </blockquote>
  
! <p>
! combined with the noted property in C++11 that:
! </p>
  
+ <blockquote><p>
+ "<tt>offsetof</tt> is required to work as specified even if unary <tt>operator&amp;</tt> 
+ is overloaded for any of the types involved"
+ </p></blockquote>
  
  <p>
! Therefore implementations should already be able without heroic efforts to realize this functionality by
! some intrinsic. The wording needs at least to ensure that for any lvalue core constant expression <tt><em>e</em></tt>
! the expression <tt>std::addressof(<em>e</em>)</tt> is a core constant expression.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! </p>
! 
! <p><i>[2014-06-08, Daniel improves wording]</i></p>
! 
! <p>
! It has been ensured that the wording is in sync with the recent working paper and the usage of "any" has been
! improved to say "every" instead (the fix is similar to that applied by LWG <a href="lwg-defects.html#2150">2150</a>).
! </p>
! 
! <p>
! <strong>Previous resolution from Daniel [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <ol>
! <li><p>Change header <tt>&lt;memory&gt;</tt> synopsis, 20.7.2 [memory.syn] as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   <i>// 20.7.12 [specialized.algorithms], specialized algorithms:</i>
!   template &lt;class T&gt; <ins>constexpr</ins> T* addressof(T&amp; r) noexcept;
!   [&hellip;]
! }
  </pre></blockquote>
! </li>
  
+ <li><p>Change 20.7.12.1 [specialized.addressof] as indicated:</p>
  
+ <blockquote><pre>
+ template &lt;class T&gt; <ins>constexpr</ins> T* addressof(T&amp; r) noexcept;
+ </pre><blockquote>
+ <p>
+ -1- <i>Returns:</i> The actual address of the object or function referenced by <tt>r</tt>, even in the presence of an
+ overloaded <tt>operator&amp;</tt>.
+ <p/>
+ <ins>-?- <i>Remarks:</i> For every lvalue core constant expression <tt><em>e</em></tt> (5.20 [expr.const]), the expression 
+ <tt>std::addressof(<em>e</em>)</tt> is a core constant expression.</ins>
+ </p>
+ </blockquote>
+ </blockquote>
  
+ </li>
+ </ol>
+ </blockquote>
  
+ <p><i>[2014-06-09, further improvements]</i></p>
  
! <p>
! A new wording form is now used similar to the approach used by LWG <a href="lwg-active.html#2234">2234</a>, which
! is a stricter way to impose the necessary implementation requirements.
! </p>
  
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
!  STL: the intent of this change is good; I think the wording is good<br/>
! - I'm a bit worried about asking for a compiler hook<br/>
! - if every implementer says: yes they can do it we should be good<br/>
! EB: there is missing the word "a" before "subexpression" (in multiple places)<br/>
! MC: the editor should do - we rely on our editors<br/>
! MC: move to Review with a note stating that we wait for implementation experience first<br/>
! - in favor: 13, opposed: 0, abstain: 2
! HB: N4430 will bring something which is addressing this issue<br/>
! MC: good we didn't go to ready then 
! </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
  <ol>
! <li><p>Introduce the following new definition to the existing list in 17.3 [definitions]: [<i>Drafting note</i>:
! If LWG <a href="lwg-active.html#2234">2234</a> is accepted before this issue, the accepted wording for the new definition should be used instead
! &mdash; <i>end drafting note</i>]</p>
! 
! <blockquote>
  <p>
! <strong>constant subexpression</strong> [defns.const.subexpr]
! <p/>
! an expression whose evaluation as subexpression of a <em>conditional-expression</em> <em>CE</em> (5.16 [expr.cond]) 
! would not prevent <em>CE</em> from being a core constant expression (5.20 [expr.const]).
! </p>
! </blockquote>
! </li>
  
! <li><p>Change header <tt>&lt;memory&gt;</tt> synopsis, 20.7.2 [memory.syn] as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   <i>// 20.7.12 [specialized.algorithms], specialized algorithms:</i>
!   template &lt;class T&gt; <ins>constexpr</ins> T* addressof(T&amp; r) noexcept;
!   [&hellip;]
! }
  </pre></blockquote>
  </li>
! 
! <li><p>Change 20.7.12.1 [specialized.addressof] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class T&gt; <ins>constexpr</ins> T* addressof(T&amp; r) noexcept;
  </pre><blockquote>
! <p>
! -1- <i>Returns:</i> The actual address of the object or function referenced by <tt>r</tt>, even in the presence of an
! overloaded <tt>operator&amp;</tt>.
! <p/>
! <ins>-?- <i>Remarks:</i> An expression <tt>std::addressof(<em>E</em>)</tt> is a constant subexpression ( [defns.const.subexpr]), 
! if <tt><em>E</em></tt> is an lvalue constant subexpression.</ins>
! </p>
! </blockquote>
! </blockquote>
! 
  </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2303"></a>2303. Explicit instantiation of <tt>std::vector&lt;UserType&gt;</tt> broken?</h3>
! <p><b>Section:</b> 18.6.1.3 [new.delete.placement] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete.placement">issues</a> in [new.delete.placement].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The library gives explicit permission in 17.6.4.2.1 [namespace.std] p2 that user code may explicitly instantiate
! a library template provided that the instantiations depend on at least one user-defined type:
! </p>
! 
! <blockquote><p>
! A program may explicitly instantiate a template defined in the standard library only if the declaration
! depends on the name of a user-defined type and the instantiation meets the standard library requirements
! for the original template.
! </p></blockquote>
! 
! <p>
! But it seems that the C++11 library is not specified in a way that guarantees such an instantiation to be well-formed
! if the minimum requirements of the library is not satisfied. 
! <p/>
! For example, in general, the first template parameter of <tt>std::vector</tt> is not required to be 
! <tt>DefaultConstructible</tt> in general, but due to the split of the single C++03 member function
! with default argument
! </p>
! <blockquote><pre>
! void resize(size_type sz, T c = T());
  </pre></blockquote>
! <p>
! into
! </p>
! <blockquote><pre>
! void resize(size_type sz);
! void resize(size_type sz, const T&amp; c);
! </pre></blockquote>
! <p>
! the effect is now that for a type <tt>ND</tt> that is not <tt>DefaultConstructible</tt>, such as
! </p>
! <blockquote><pre>
! struct NP { 
!   NP(int); 
! };
! </pre></blockquote>
! <p>
! the explicit instantiation of <tt>std::vector&lt;ND&gt;</tt> is no longer well-formed, because the attempt to
! instantiate the single-argument overload of <tt>resize</tt> cannot not succeed, because this function imposes
! the <tt>DefaultInsertable</tt> requirements and given the default allocator this effectively requires
! <tt>DefaultConstructible</tt>.
! </p>
! <p>
! But <tt>DefaultConstructible</tt> is not the only point, what about <tt>CopyConstructible</tt> versus
! <tt>MoveConstructible</tt> alone? It turns out that currently the second <tt>resize</tt> overload
! would fail during an explicit instantiation for a type like
! </p>
! <blockquote><pre>
! struct MO { 
!   MO() = default; 
!   MO(MO&amp;&amp;) = default; 
! };
! </pre></blockquote>
! <p>
! because it imposes <tt>CopyInsertable</tt> requirements that end up being equivalent to the <tt>CopyConstructible</tt>
! requirements for the default allocator.
! <p/>
! Technically a library can solve these issues: For special member functions by defining them in some base class, for others
! by transforming them effectively into a function template due to the great feature of default template arguments for
! function templates (At the very moment the validity of the latter approach depends on a resolution of core language issue
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#1635">CWG 1635</a>, though). E.g. the here mentioned 
! <tt>resize</tt> functions of <tt>std::vector</tt> could be prevented from instantiation by defining them like this 
! with an implementation:
! </p>
! <blockquote><pre>
! template&lt;class = void&gt;
! void resize(size_type sz) { [&hellip;] }
! template&lt;class = void&gt;
! void resize(size_type sz, const T&amp; c) { [&hellip;] }
! </pre></blockquote>
! <p>
! In this case, these functions could also be defined in a base class, but the latter approach won't work in all cases.
! <p/>
! Basically such an implementation is required to constrain all member functions that are not covered by the general
! requirements imposed on the actual library template parameters. I tested three different C++11 library implementations
! and but none could instantiate for example <tt>std::list</tt>, <tt>std::vector</tt>, or <tt>std::deque</tt> with
! value types that are not <tt>DefaultConstructible</tt> or only <tt>MoveConstructible</tt>. 
! <p/>
! 
! <p/>
! This issue is raised to clarify the current situation in regard to the actual requirements imposed on user-provided
! types that are used to explicitly instantiate Library-provided templates. For example, the current Container requirements
! impose very little requirements on the actual value type and it is unclear to which extend library implementations have
! to respect that. 
! <p/>
! The minimum solution of this issue should be to at least realize that there is no fundamental requirement on 
! <tt>DefaultConstructible</tt> for value types of library containers, because we have since C++03 the general
! statement of 17.6.3.1 [utility.arg.requirements] ("In general, a default constructor is not required.").
! It is unclear whether <tt>CopyConstructible</tt> should be required for an explicit instantiation request, but
! given the careful introduction of move operations in the library it would seem astonishing that a
! <tt>MoveConstructible</tt> type wouldn't suffice for value types of the container types.
! <p/>
! In any case I can envision at least two approaches to solve this issue:
! </p>
! <ol>
! <li>
! <p>
! As indicated in LWG <a href="lwg-active.html#2292">2292</a>, those function could get an explicit "<i>Template Constraints:</i>"
! element, albeit this promises more than needed to solve this issue.
! </p>
  </li>
  <li>
! <p>
! The library could introduce a completely new element form, such as "<i>Instantiation Constraints:</i>" that
! would handle this situation for explicit instantiation situations. This would allow for simpler techniques
! to solve the issue when explicit instantiation is required compared to the first bullet, because it would not 
! (necessarily) guarantee SFINAE-friendly expression-wellformedness, such as inspecting the expression 
! <tt>std::declval&lt;std::vector&lt;ND&gt;&amp;&gt;.resize(0)</tt> in an unevaluated context.
! </p>
  </li>
  </ol>
  
+ <p>
+ It should be noted that the 2013-08-27 comment to LWG <a href="lwg-defects.html#2193">2193</a> could be resolved by a similar solution
+ as indicated in this issue here.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
  
  
  
  
  <hr>
! <h3><a name="2307"></a>2307. Should the Standard Library use <tt>explicit</tt> only when necessary?</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Zhihao Yuan <b>Opened:</b> 2013-09-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#containers">active issues</a> in [containers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
+ <p>
+ LWG <a href="lwg-defects.html#2193">2193</a> yields <tt>explicit</tt> for default ctors to allow <tt>{}</tt>, but not for
+ all cases of uniform initialization. For example:
+ </p>
+ <blockquote><pre>
+ explicit vector(size_type count, const Allocator&amp; alloc = Allocator());
+ </pre></blockquote>
+ <p>
+ This prevents <tt>{n, alloc()}</tt>. Although this use is relatively rare,
+ but the behavior is inconsistent with that of
+ </p>
+ <blockquote><pre>
+ vector(size_type count, const T&amp; value, const Allocator&amp; alloc = Allocator());
+ </pre></blockquote>
  
+ <p><i>[Urbana 2014-11-07: Move to Open]</i></p>
  
  
  
  
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
  
+ 
+ <hr>
+ <h3><a name="2309"></a>2309. <tt>mutex::lock()</tt> should not throw <tt>device_or_resource_busy</tt></h3>
+ <p><b>Section:</b> 30.4.1.2 [thread.mutex.requirements.mutex] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2013-09-27 <b>Last modified:</b> 2015-05-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements.mutex">issues</a> in [thread.mutex.requirements.mutex].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! As discussed during the Chicago meeting in 
! <a href="http://wiki.edg.com/twiki/bin/view/Wg21chicago2013/ThursdayMorningMinutes#LWG_2135_revisited">SG1</a>
! the only reasonable reasons for throwing <tt>device_or_resource_busy</tt> seem to be:
  </p>
! <ul>
! <li><p>
! The thread currently already holds the mutex, the mutex is not recursive, and the implementation detects this.
! In this case <tt>resource_deadlock_would_occur</tt> should be thrown.
! </p></li>
! <li><p>
! Priority reasons. At least <tt>std::mutex</tt> (and possibly all standard mutex types)
! should not be setup this way, otherwise we have real problems with <tt>condition_variable::wait()</tt>.
! </p></li>
! </ul>
! 
! <p><i>[2014-06-17 Rapperswil]</i></p>
! 
  <p>
! Detlef provides wording
! </p>
  
+ <p><i>[2015-02 Cologne]</i></p>
  
  <p>
! Handed over to SG1.
! </p>
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! We believe we were already done with it. Should be in SG1-OK status.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 30.4.1.2 [thread.mutex.requirements.mutex] as indicated:</p>
! 
! <blockquote><p>
! -13- <i>Error conditions</i>:
! </p>
! <ul>
! <li><p><tt>operation_not_permitted</tt> &mdash; if the thread does not have the privilege to perform the operation.</p></li>
! <li><p><tt>resource_deadlock_would_occur</tt> &mdash; if the implementation detects that a deadlock would occur.</p></li>
! <li><p><del><tt>device_or_resource_busy</tt> &mdash; if the mutex is already locked and blocking is not possible.</del></p></li>
! </ul>
! </blockquote>
! </li>
! </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2310"></a>2310. Public <em>exposition only</em> member in <tt>std::array</tt></h3>
! <p><b>Section:</b> 23.3.2.1 [array.overview] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-09-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! 23.3.2.1 [array.overview] shows <tt>std::array</tt> with an "exposition only" data member, <tt>elems</tt>.
! <p/>
! The wording in 17.5.2.3 [objects.within.classes] that defines how
! "exposition only" is used says it applies to private members, but
! <tt>std::array::elems</tt> (or its equivalent) must be public in order for
! <tt>std::array</tt> to be an aggregate.
! <p/>
! If the intention is that <tt>std::array::elems</tt> places requirements on the
! implementation to provide "equivalent external behavior" to a public
! array member, then 17.5.2.3 [objects.within.classes] needs to cover public
! members too, or some other form should be used in 23.3.2.1 [array.overview].
! </p>
  
! <p><i>[Urbana 2014-11-07: Move to Open]</i></p>
  
  
  
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2312"></a>2312. <tt>tuple</tt>'s constructor constraints need to be phrased more precisely</h3>
! <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-05-06</p>
! <p><b>View other</b> <a href="lwg-index-open.html#tuple.cnstr">active issues</a> in [tuple.cnstr].</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
  <p>
! Consider the following code:
! </p>
! <blockquote><pre>
! void meow(tuple&lt;long, long&gt;) { puts("Two"); }
! 
! void meow(tuple&lt;long, long, long&gt;) { puts("Three"); }
! 
! tuple&lt;int, int, int&gt; t(0, 0, 0);
! 
! meow(t);
  </pre></blockquote>
! <p>
! This should compile and print "Three" because <tt>tuple&lt;long, long&gt;</tt>'s constructor from 
! <tt>const tuple&lt;int, int, int&gt;&amp;</tt> should remove itself from overload resolution.  
! Implementations sensibly do this, but the Standard doesn't actually say it!
! <p/>
! In this case, <tt>Types</tt> is "<tt>long, long</tt>" and <tt>UTypes</tt> is "<tt>int, int, int</tt>". 20.4.2.1 [tuple.cnstr]/3 
! says "let <tt>i</tt> be in the range <tt>[0,sizeof...(Types))</tt> in order", which is <tt>[0, 2)</tt>.  Then /17 says 
! "<i>Remark:</i> This constructor shall not participate in overload resolution unless <tt>const Ui&amp;</tt> is implicitly 
! convertible to <tt>Ti</tt> for all <tt>i</tt>." Interpreted literally, this is true!  /15 says 
! "<i>Requires:</i> <tt>sizeof...(Types) == sizeof...(UTypes)</tt>." but requiring the sizes to be identical doesn't help.  
! Only the special phrase "shall not participate in overload resolution unless" mandates SFINAE/<tt>enable_if</tt> machinery.
! <p/>
! The wording that we need is almost available in the <i>Requires</i> paragraphs, except that the <i>Requires</i> paragraphs say 
! "<tt>is_constructible</tt>" while the Remark paragraphs say "is implicitly convertible", which is the correct thing for the SFINAE 
! constraints to check. My proposed resolution is to unify the <i>Requires</i> and <i>Remark</i> paragraphs, after which there 
! will be no need for <i>Requires</i> (when a constructor participates in overload resolution if and only if <tt>X</tt> is true, 
! then there's no need for it to <i>Require</i> that <tt>X</tt> is true).
! <p/>
! Note: 20.10.4.3 [meta.unary.prop]/6 specifies <tt>is_constructible&lt;To, From&gt;</tt> and 20.10.6 [meta.rel]/4 specifies 
! <tt>is_convertible&lt;From, To&gt;</tt>. Both are specified in terms of 
! "<tt>template &lt;class T&gt; typename add_rvalue_reference&lt;T&gt;::type create();</tt>".  
! Therefore, passing <tt>From</tt> and <tt>From&amp;&amp;</tt> is equivalent, regardless of whether <tt>From</tt> is an object type, 
! an lvalue reference, or an rvalue reference.
! <p/>
! Also note that 20.4.2.1 [tuple.cnstr]/3 defines <tt>T0</tt> and <tt>T1</tt> so we don't need to repeat their definitions.
! </p>
! 
! <p><i>[2014-10-05, Daniel comments]</i></p>
! 
! <p>
! This issue is closely related to LWG <a href="lwg-active.html#2419">2419</a>.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! AM: Howard wants to do something in this space and I want to wait for him to get a paper in.
! <p/>
! Postponed.
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! MC: handled by Daniel's tuple paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4387.html">N4387</a><br/>
! STL: look at status after N4387 applied.
! </p>
! <p><i>[2015-05-05, Daniel comments]</i></p>
! 
! <p>
! N4387 doesn't touch these area intentionally. I agree with Howard that a different option exists that would introduce
! a TupleLike concept. Some implementations currently take advantage of this choice and this P/R would forbid them, which seems
! unfortunate to me.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 20.4.2.1 [tuple.cnstr] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class... UTypes&gt;
!   explicit constexpr tuple(UTypes&amp;&amp;... u);
! </pre><blockquote>
! <p>
! <del>-8- <i>Requires:</i> <tt>sizeof...(Types) == sizeof...(UTypes)</tt>. <tt>is_constructible&lt;Ti, Ui&amp;&amp;&gt;::value</tt> is true
! for all <i>i</i>.</del>
! <p/>
! [&hellip;]
! <p/>
! -10- <i>Remark:</i> This constructor shall not participate in overload resolution unless <del>each type in <tt>UTypes</tt> is
! implicitly convertible to its corresponding type in <tt>Types</tt></del><ins><tt>sizeof...(Types) == sizeof...(UTypes)</tt> and 
! both <tt>is_constructible&lt;Ti, Ui&gt;::value</tt> and <tt>is_convertible&lt;Ui, Ti&gt;::value</tt> are true for all <i>i</i></ins>.
! </p>
! </blockquote>
! <p>
! [&hellip;]
! </p>
! </blockquote>
! <blockquote><pre>
! template &lt;class... UTypes&gt;
!   constexpr tuple(const tuple&lt;UTypes...&gt;&amp; u);
! </pre><blockquote>
! <p>
! <del>-15- <i>Requires:</i> <tt>sizeof...(Types) == sizeof...(UTypes)</tt>. <tt>is_constructible&lt;Ti, const Ui&amp;&gt;::value</tt> is true
! for all <i>i</i>.</del>
! <p/>
! [&hellip;]
! <p/>
! -17- <i>Remark:</i> This constructor shall not participate in overload resolution unless <del><tt>const Ui&amp;</tt> is implicitly
! convertible to <tt>Ti</tt></del><ins><tt>sizeof...(Types) == sizeof...(UTypes)</tt> and 
! both <tt>is_constructible&lt;Ti, const Ui&amp;&gt;::value</tt> and <tt>is_convertible&lt;const Ui&amp;, Ti&gt;::value</tt> are 
! true</ins> for all <i>i</i>.
! </p>
! </blockquote>
! </blockquote>
! <blockquote><pre>
! template &lt;class... UTypes&gt;
!   constexpr tuple(tuple&lt;UTypes...&gt;&amp;&amp; u);
! </pre><blockquote>
! <p>
! <del>-18- <i>Requires:</i> <tt>sizeof...(Types) == sizeof...(UTypes)</tt>. <tt>is_constructible&lt;Ti, Ui&amp;&amp;&gt;::value</tt> is true
! for all <i>i</i>.</del>
! <p/>
! [&hellip;]
! <p/>
! -20- <i>Remark:</i> This constructor shall not participate in overload resolution unless <del>each type in <tt>UTypes</tt> is
! implicitly convertible to its corresponding type in <tt>Types</tt></del><ins><tt>sizeof...(Types) == sizeof...(UTypes)</tt> and 
! both <tt>is_constructible&lt;Ti, Ui&gt;::value</tt> and <tt>is_convertible&lt;Ui, Ti&gt;::value</tt> are true for all <i>i</i></ins>.
! </p>
! </blockquote>
! </blockquote>
! <blockquote><pre>
! template &lt;class U1, class U2&gt; constexpr tuple(const pair&lt;U1, U2&gt;&amp; u);
! </pre><blockquote>
! <p>
! <del>-21- <i>Requires:</i> <tt>sizeof...(Types) == 2</tt>. <tt>is_constructible&lt;T0, const U1&amp;&gt;::value</tt> is true for the first
! type <tt>T0</tt> in Types and <tt>is_constructible&lt;T1, const U2&amp;&gt;::value</tt> is true for the second type <tt>T1</tt> in
! <tt>Types</tt>.</del>
! <p/>
! [&hellip;]
! <p/>
! -23- <i>Remark:</i> This constructor shall not participate in overload resolution unless <del><tt>const U1&amp;</tt> is implicitly
! convertible to <tt>T0</tt> and <tt>const U2&amp;</tt> is implicitly convertible to <tt>T1</tt></del><ins><tt>sizeof...(Types) == 2 
! &amp;&amp; is_constructible&lt;T0, const U1&amp;&gt;::value &amp;&amp; is_constructible&lt;T1, const U2&amp;&gt;::value &amp;&amp; 
! is_convertible&lt;const U1&amp;, T0&gt;::value &amp;&amp; is_convertible&lt;const U2&amp;, T1&gt;::value</tt> is true</ins>.
! </p>
! </blockquote>
  </blockquote>
+ <blockquote><pre>
+ template &lt;class U1, class U2&gt; constexpr tuple(pair&lt;U1, U2&gt;&amp;&amp; u);
+ </pre><blockquote>
+ <p>
+ <del>-24- <i>Requires:</i> <tt>sizeof...(Types) == 2</tt>. <tt>is_constructible&lt;T0, U1&amp;&amp;&gt;::value</tt> is true for the first
+ type <tt>T0</tt> in Types and <tt>is_constructible&lt;T1, U2&amp;&amp;&gt;::value</tt> is true for the second type <tt>T1</tt> in
+ <tt>Types</tt>.</del>
+ <p/>
+ [&hellip;]
+ <p/>
+ -26- <i>Remark:</i> This constructor shall not participate in overload resolution unless <del><tt>U1</tt> is implicitly convertible
+ to <tt>T0</tt> and <tt>U2</tt> is implicitly convertible to <tt>T1</tt></del><ins><tt>sizeof...(Types) == 2
+ &amp;&amp; is_constructible&lt;T0, U1&gt;::value &amp;&amp; is_constructible&lt;T1, U2&gt;::value &amp;&amp; 
+ is_convertible&lt;U1, T0&gt;::value &amp;&amp; is_convertible&lt;U2, T1&gt;::value</tt> is true</ins>.
+ </p>
+ </blockquote>
+ </blockquote>
+ </li>
+ 
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2318"></a>2318. <tt>basic_string</tt>'s wording has confusing relics from the copy-on-write era</h3>
+ <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 21.4.4 [string.capacity]/8 specifies <tt>basic_string::resize(n, c)</tt> with:
+ </p>
+ <blockquote><p>
+ <i>Effects:</i> Alters the length of the string designated by <tt>*this</tt> as follows:
+ </p>
+ <ul>
+ <li><p>
+ If <tt>n &lt;= size()</tt>, the function replaces the string designated by <tt>*this</tt> with a string of length <tt>n</tt> whose 
+ elements are a copy of the initial elements of the original string designated by <tt>*this</tt>.
+ </p>
+ </li>
+ <li><p>
+ If <tt>n &gt; size()</tt>, the function replaces the string designated by <tt>*this</tt> with a string of length <tt>n</tt> whose 
+ first <tt>size()</tt> elements are a copy of the original string designated by <tt>*this</tt>, and whose remaining elements are all 
+ initialized to <tt>c</tt>.
+ </p>
+ </li>
+ </ul>
+ </blockquote>
+ <p>
+ This wording is a relic of the copy-on-write era. In addition to being extremely confusing, it has undesirable implications.  
+ Saying "replaces the string designated by <tt>*this</tt> with a string of length <tt>n</tt> whose elements are a copy" suggests 
+ that the trimming case can reallocate. Reallocation during trimming should be forbidden, like <tt>vector</tt>.
+ <p/>
+ At least 7 paragraphs are affected: 21.4.4 [string.capacity]/8, 21.4.6.2 [string::append]/9, 
+ 21.4.6.3 [string::assign]/3 and /10, 21.4.6.4 [string::insert]/11, 21.4.6.5 [string::erase]/4, and 
+ 21.4.6.6 [string::replace]/11 say "replaces the string [designated/controlled] by <tt>*this</tt>". (21.4.6.7 [string::copy]/3 
+ is different &mdash; it "replaces the string designated by <tt>s</tt>".)
+ <p/>
+ Of the affected paragraphs, <tt>resize()</tt> and <tt>erase()</tt> are the most important to fix because they should forbid 
+ reallocation during trimming.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** to be permitted. Either way, a note woul
*** 5949,5987 ****
  
  
  <hr>
! <h3><a name="1479"></a>1479. [FCD] Fence functions should be <tt>extern "C"</tt></h3>
! <p><b>Section:</b> 29.8 [atomics.fences] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.fences">active issues</a> in [atomics.fences].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.fences">issues</a> in [atomics.fences].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-179</b></p>
  
- The fence functions (29.8 [atomics.fences] p.5 + p.6) should be <tt>extern "C"</tt>, for <tt>C</tt> compatibility.
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change 29.2 [atomics.syn], header <tt>&lt;atomic&gt;</tt> synopsis as indicated:
! <blockquote><pre>namespace std {
!   [..]
!   // <em>29.8, fences</em>
!   <ins>extern "C"</ins> void atomic_thread_fence(memory_order);
!   <ins>extern "C"</ins> void atomic_signal_fence(memory_order);  
! }
! </pre></blockquote>
  </li>
! <li>Change 29.8 [atomics.fences], p. 5 and p. 6 as indicated:
! <blockquote><pre><ins>extern "C"</ins> void atomic_thread_fence(memory_order);
! </pre><blockquote>
! 5 <em>Effects</em>: depending on the value of <tt>order</tt>, this operation: [..]
! </blockquote></blockquote>
! <blockquote><pre><ins>extern "C"</ins> void atomic_signal_fence(memory_order);  
! </pre><blockquote>
! 6 <em>Effects</em>: equivalent to <tt>atomic_thread_fence(order)</tt>, except that synchronizes with relationships are
! established only between a thread and a signal handler executed in the same thread.
! </blockquote></blockquote>
  </li>
  </ol>
  
--- 20679,20847 ----
  
  
  <hr>
! <h3><a name="2321"></a>2321. Moving containers should (usually) be required to preserve iterators</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! 23.2.1 [container.requirements.general]/10 says that unless otherwise specified, "no <tt>swap()</tt> function invalidates 
! any references, pointers, or iterators referring to the elements of the containers being swapped. [<i>Note:</i> The <tt>end()</tt> 
! iterator does not refer to any element, so it may be invalidated. &mdash; <i>end note</i>]". However, move constructors and move 
! assignment operators aren't given similar invalidation guarantees. The guarantees need several exceptions, so I do not believe 
! that blanket language like /11 "Unless otherwise specified (either explicitly or by defining a function in terms of other functions), 
! invoking a container member function or passing a container as an argument to a library function shall not invalidate iterators to, 
! or change the values of, objects within that container." is applicable.
! </p>
! 
! <p><i>[2014-02-13 Issaquah]</i></p>
! 
! <p>
! General agreeement on intent, several wording nits and additional paragraphs to hit.
! </p>
! <p>
! STL to provide updated wording.  Move to Open.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! AM: in the proposed wording, I'd like to mention that the iterators now refer to elements of a different container. 
! I think we're saying something like this somewhere. JY: There's some wording like that for swap I think. TK: It's also in 
! <tt>list::splice()</tt>. DK to JY: 23.2.1p9.
! <p/>
! VV: The issue says that STL was going to propose new wording. Has he done that? AM: I believe we're looking at that. 
! GR: The request touches on multiple paragraphs, and this PR has only one new paragraph, so this looks like it's not up-to-date. 
! MC: This was last updated a year ago in Issaquah.
! <p/>
! <b>Conclusion</b>: Skip, not up to date. 
! </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3691.</p>
+ 
  <ol>
! <li><p>In 23.2.1 [container.requirements.general]/10 change as indicated:</p>
! 
! <blockquote><p>
! -10- Unless otherwise specified (see 23.2.4.1, 23.2.5.1, 23.3.3.4, and 23.3.7.5) all container types defined in this
! Clause meet the following additional requirements:
! </p>
! <ul>
! <li><p>
! [&hellip;]
! </p></li>
! <li><p>
! no copy constructor or assignment operator of a returned iterator throws an exception.
! </p></li>
! <li><p>
! <ins>no move constructor (or move assignment operator when 
! <tt>allocator_traits&lt;allocator_type&gt;::propagate_on_container_move_assignment::value</tt> is true) of a container 
! (except for <tt>array</tt>) invalidates any references, pointers, or iterators referring to the elements of the source container. 
! [<i>Note:</i> The <tt>end()</tt> iterator does not refer to any element, so it may be invalidated. &mdash; <i>end note</i>]</ins>
! </p></li>
! <li><p>
! no <tt>swap()</tt> function throws an exception.
! </p></li>
! <li><p>
! no <tt>swap()</tt> function invalidates any references, pointers, or iterators referring to the elements of the
! containers being swapped. [<i>Note:</i> The <tt>end()</tt> iterator does not refer to any element, so it may be
! invalidated. &mdash; <i>end note</i>]
! </p></li>
! </ul>
! </blockquote>
  </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2326"></a>2326. <tt>uniform_int_distribution&lt;unsigned char&gt;</tt> should be permitted</h3>
! <p><b>Section:</b> 26.5.1.1 [rand.req.genl] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 26.5.1.1 [rand.req.genl]/1 says: "Throughout this subclause 26.5, the effect of instantiating a template [...] that has a 
! template type parameter named <tt>IntType</tt> is undefined unless the corresponding template argument is <i>cv</i>-unqualified 
! and is one of <tt>short</tt>, <tt>int</tt>, <tt>long</tt>, <tt>long long</tt>, <tt>unsigned short</tt>, <tt>unsigned int</tt>, 
! <tt>unsigned long</tt>, or <tt>unsigned long long</tt>."  26.5.8.2.1 [rand.dist.uni.int] specifies 
! <tt>template&lt;class IntType = int> class uniform_int_distribution</tt>, so this forbids 
! <tt>uniform_int_distribution&lt;char/signed char/unsigned char&gt;</tt>.
! <p/>
! I am not aware of anything in <tt>&lt;random&gt;</tt> that works with 16-bit integers but fails with 8-bit integers, so I suspect 
! that <tt>IntType</tt> and <tt>UIntType</tt> could simply be extended to permit the <tt>char</tt> family. Alternatively, this 
! change could be limited to <tt>uniform_int_distribution</tt> alone, where it is definitely safe. A <tt>&lt;random&gt;</tt> expert 
! should decide which change is best.
! </p>
! 
! <p><i>[2015-04-04 Geoffrey provides wording]</i></p>
! 
! <p>
!  I think it's time to call the question; it's just silly that we have a random number library with no natural way to generate 
!  random bytes. However, I don't think it's sufficient to fix only <tt>uniform_int_distribution</tt>, or even all of <tt>IntType</tt>. 
!  At a bare minimum we need to also fix <tt>independent_bits_engine</tt> (arguably the cleanest way of generating a random byte) 
!  and that's specified in terms of <tt>UIntType</tt>.
!  <p/>
!  The wording provided below is equivalent to adding <tt>unsigned char</tt> to item "f" and adding <tt>signed char</tt> and 
!  <tt>unsigned char</tt> to item "e". That means it still excludes <tt>char</tt>, but I'm OK with that. If you want to generate 
!  a 1-byte number, you should probably pick a signedess, and if you want to generate a raw byte, the "true" raw byte type is 
!  <tt>unsigned char</tt>. This also excludes extended integral types and wide char types, which seem like nice-to-haves at best. 
!  I have no objection to supporting any of those types; I just picked this to simplify the wording and hopefully maximize consensus. 
!  Note that if we want to broaden <tt>IntType</tt> to permit any integral type, we'll need to decide if we want to exclude <tt>bool</tt>.
! <p/>
! For reference, <tt>IntType</tt> is used as a parameter of the following templates:
! </p>
! <blockquote>
! <pre>
! uniform_int_distribution
! binomial_distribution
! geometric_distribution
! negative_binomial_distribution
! poisson_distribution
! discrete_distribution
! </pre>
! </blockquote>
! <p>
! and <tt>UIntType</tt> is used as a parameter of the following templates:
! </p>
! <blockquote>
! <pre>
! linear_congruential_engine
! mersenne_twister_engine
! subtract_with_carry_engine
! independent_bits_engine
! </pre>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Change in 26.5.1.1 [rand.req.genl] p1 as indicated:</p>
! 
! <p>
! -1- Throughout this subclause 26.5, the effect of instantiating a template:
! </p>
! <ol style="list-style-type:lower-alpha;" start="4">
! <li><p>[&hellip;]</p></li>
! <li><p>that has a template type parameter named <tt>IntType</tt> is undefined unless the corresponding template
! argument is cv-unqualified and is <ins>a standard integer type (3.9.1 [basic.fundamental])</ins><del>one of 
! <tt>short</tt>, <tt>int</tt>, <tt>long</tt>, <tt>long long</tt>, <tt>unsigned short</tt>, <tt>unsigned int</tt>, 
! <tt>unsigned long</tt>, or <tt>unsigned long long</tt></del>.</p></li>
! <li><p>that has a template type parameter named <tt>UIntType</tt> is undefined unless the corresponding template
! argument is cv-unqualified and is <ins>a standard unsigned integer type (3.9.1 [basic.fundamental])</ins><del>one 
! of <tt>unsigned short</tt>, <tt>unsigned int</tt>, <tt>unsigned long</tt>, or <tt>unsigned long long</tt></del>.</p></li>
! </ol>
  </li>
  </ol>
  
*************** established only between a thread and a
*** 5990,6170 ****
  
  
  <hr>
! <h3><a name="1480"></a>1480. [FCD] Atomic fences don't have <em>synchronizes with</em> relation</h3>
! <p><b>Section:</b> 29.8 [atomics.fences] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Review">Review</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.fences">active issues</a> in [atomics.fences].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.fences">issues</a> in [atomics.fences].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Review">Review</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-137</b></p>
  
! Thread fence not only establish synchronizes with relationships,
! there are semantics of fences that are expressed not in
! terms of <em>synchronizes with</em> relationships (for example see 29.3 [atomics.order] p.5).
! These semantics also need to apply to the use of
! <tt>atomic_signal_fence</tt> in a restricted way.
  
- <p><i>[Batavia: Concurrency group discussed issue, and is OK with the proposed resolution.]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! Change 29.8 [atomics.fences] p. 6 as indicated:
! <blockquote><pre>void atomic_signal_fence(memory_order);  
  </pre><blockquote>
! 6 <em>Effects</em>: equivalent to <tt>atomic_thread_fence(order)</tt>, except that <del>synchronizes 
! with relationships</del><ins>the resulting ordering constraints</ins> are established only between a 
! thread and a signal handler executed in the same thread.
  </blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1485"></a>1485. [FCD] Unclear <tt>thread::id</tt> specification</h3>
! <p><b>Section:</b> 30.3.1.1 [thread.thread.id] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.id">issues</a> in [thread.thread.id].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-184</b></p>
  
! It is unclear when a <tt>thread::id</tt> ceases to be meaningful.
! The sentence "The library may reuse the value of a
! <tt>thread::id</tt> of a terminated thread that can no longer be
! joined." implies that some terminated threads can be
! joined. It says nothing about detached threads.
  
- <p><i>[
- Resolution proposed by ballot comment:
- ]</i></p>
  
! <blockquote>
! Require a unique <tt>thread::id</tt> for every thread that is
! (1) detached and not terminated or (2) has an associated <tt>std::thread</tt> 
! object.
! </blockquote>
  
! <p><i>[
! 2010-11-22 Howard Hinnant observes
! ]</i></p>
  
  
  
  <p>
! A thread can either be running or terminated.  Additionally a thread can be joined, detached, or neither.  These combine into the five possible states shown in this table:
  </p>
  
  <table border="1">
! <tbody><tr>
! <th></th><th>Running</th><th>Terminated</th>
  </tr>
  <tr>
! <th>Neither joined nor detached</th><td>shall not reuse id</td><td>shall not reuse id</td>
  </tr>
  <tr>
! <th>detached</th><td>shall not reuse id</td><td>may reuse id</td>
  </tr>
  <tr>
! <th>joined</th><td>impossible state</td><td>may reuse id</td>
  </tr>
! </tbody></table>
! <p>
! Only if a thread is neither joined nor detached can it be joined.  Or said differently, if a thread has already been joined or detached, then it can not be joined.  The sentence:
! </p><blockquote>
! The library may reuse the value of a <tt>thread::id</tt> of a terminated thread that can no longer be joined.
  </blockquote>
! precisely defines the two states shown in the above table where a thread::id may be reused.
! <p></p>
  <p>
! The following program illustrates all of the possibilities:
  </p>
! <blockquote><pre>#include &lt;mutex&gt;
! #include &lt;thread&gt;
  #include &lt;iostream&gt;
- #include &lt;chrono&gt;
  
! std::mutex mut;
  
! void f()
! {
!    std::lock_guard&lt;std::mutex&gt; _(mut);
!    std::cout &lt;&lt; "f id = " &lt;&lt; std::this_thread::get_id() &lt;&lt; " terminating\n";
  }
  
! void g()
! {
!    std::lock_guard&lt;std::mutex&gt; _(mut);
!    std::cout &lt;&lt; "g id = " &lt;&lt; std::this_thread::get_id() &lt;&lt; " terminating\n";
! }
  
- int main()
- {
-    std::cout &lt;&lt; "main id = " &lt;&lt; std::this_thread::get_id() &lt;&lt; "\n";
-    std::thread t1(f);
-    std::thread(g).detach();
-    std::this_thread::sleep_for(std::chrono::seconds(1));
-    std::cout &lt;&lt; "g's thread::id can be reused here because g has terminated and is detached.\n";
-    std::cout &lt;&lt; "f's thread::id can't be reused here because f has terminated but is still joinable.\n";
-    std::cout &lt;&lt; "f id = " &lt;&lt; t1.get_id() &lt;&lt; "\n";
-    t1.join();
-    std::cout &lt;&lt; "f's thread::id can be reused here because f has terminated and is joined.\n";
-    std::cout &lt;&lt; "f id = " &lt;&lt; t1.get_id() &lt;&lt; "\n";
- }
  
- main id = 0x7fff71197ca0
- f id = 0x100381000 terminating
- g id = 0x100581000 terminating
- g's thread::id can be reused here because g has terminated and is detached.
- f's thread::id can't be reused here because f has terminated but is still joinable.
- f id = 0x100381000
- f's thread::id can be reused here because f has terminated and is joined.
- f id = 0x0
- </pre></blockquote>
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
! <hr>
! <h3><a name="1486"></a>1486. [FCD] Value of <tt>this_thread::get_id()</tt> underspecified for detached thread</h3>
! <p><b>Section:</b> 30.3.2 [thread.thread.this] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#thread.thread.this">active issues</a> in [thread.thread.this].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.this">issues</a> in [thread.thread.this].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses CH-24</b></p>
  
! What would be the value <tt>this_thread::get_id()</tt> when called from a detached thread?
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  <p>
! Add some text to clarify that get_id() still returns
! the same value even after detaching.
  </p>
  
! <p><i>[
! 2010-11-22 Howard Hinnant observes
! ]</i></p>
  
  
  <p>
! 30.3.2 [thread.thread.this]/1 contains the following sentence describing <tt>this_thread::get_id()</tt>:
  </p>
  
  <blockquote>
! ... No other thread of execution shall have this id and this thread of execution shall always have this id.
  </blockquote>
  
! I don't object to adding "even if detached" to this sentence, but it seems unnecessary to me.  "Always" means always.
  
  
  <p><b>Proposed resolution:</b></p>
--- 20850,21371 ----
  
  
  <hr>
! <h3><a name="2328"></a>2328. Rvalue stream extraction should use perfect forwarding</h3>
! <p><b>Section:</b> 27.7.2.6 [istream.rvalue] <b>Status:</b> <a href="lwg-active.html#Review">Review</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.rvalue">active issues</a> in [istream.rvalue].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.rvalue">issues</a> in [istream.rvalue].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Review">Review</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! 27.7.2.6 [istream.rvalue] declares <tt>operator&gt;&gt;(basic_istream&lt;charT, traits&gt;&amp;&amp; is, T&amp; x)</tt>.  
! However, 27.7.2.2.3 [istream::extractors]/7 declares <tt>operator&gt;&gt;(basic_istream&lt;charT,traits&gt;&amp; in, charT* s)</tt>, 
! plus additional overloads for <tt>unsigned char*</tt> and <tt>signed char*</tt>. This means that 
! "<tt>return_rvalue_istream() &gt;&gt; &amp;arr[0]</tt>" won't compile, because <tt>T&amp;</tt> won't bind to the rvalue <tt>&amp;arr[0]</tt>.
! </p>
  
! <p><i>[2014-02-12 Issaquah : recategorize as P3]</i></p>
! 
! 
! <p>
! Jonathan Wakely: Bill was certain the change is right, I think so with less certainty
! </p>
! 
! <p>
! Jeffrey Yaskin: I think he's right, hate that we need this
! </p>
! 
! <p>
! Jonathan Wakely: is this the security issue Jeffrey raised on lib reflector?
! </p>
! 
! <p>
! Move to P3
! </p>
! 
! <p><i>[2015-05-06 Lenexa: Move to Review]</i></p>
  
  
+ <p>WEB, MC: Proposed wording changes one signature (in two places) to take a forwarding reference.</p>
+ <p>TK: Should be consistent with an istream rvalue?</p>
+ <p>MC: This is the case where you pass the stream by rvalue reference.</p>
+ <p>RP: I would try it before standardizing.</p>
+ <p>TK: Does it break anything?</p>
+ <p>RP, TK: It will take all arguments, will be an exact match for everything.</p>
+ <p>RS, TK: This adapts streaming into an rvalue stream to make it act like streaming into an lvalue stream.</p>
+ <p>RS: Should this really return the stream by lvalue reference instead of by rvalue reference? => new LWG issue.</p>
+ <p>RP: Security issue?</p>
+ <p>MC: No. That's istream >> char*, C++ version of gets(). Remove it, as we did for gets()? => new LWG issue.</p>
+ <p>RS: Proposed resolution looks correct to me.</p>
+ <p>MC: Makes me (and Jonathan Wakely) feel uneasy.</p>
+ <p>Move to Review, consensus.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 27.7.1 [iostream.format.overview], header <tt>&lt;istream&gt;</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   template &lt;class charT, class traits, class T&gt;
!     basic_istream&lt;charT, traits&gt;&amp;
!     operator&gt;&gt;(basic_istream&lt;charT, traits&gt;&amp;&amp; is, T&amp;<ins>&amp;</ins> x);
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Edit 27.7.2.6 [istream.rvalue] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class charT, class traits, class T&gt;
!   basic_istream&lt;charT, traits&gt;&amp;
!   operator&gt;&gt;(basic_istream&lt;charT, traits&gt;&amp;&amp; is, T&amp;<ins>&amp;</ins> x);
  </pre><blockquote>
! <p>
! -1- <i>Effects:</i> <tt>is &gt;&gt;<del>x</del> <ins>std::forward&lt;T&gt;(x)</ins></tt>
! <p/>
! -2- <i>Returns:</i> <tt>is</tt>
! </p>
  </blockquote></blockquote>
+ </li>
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2331"></a>2331. <tt>regex_constants::collate</tt>'s effects are inaccurately summarized</h3>
! <p><b>Section:</b> 28.5.1 [re.synopt] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re.synopt">active issues</a> in [re.synopt].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.synopt">issues</a> in [re.synopt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! The table in 28.5.1 [re.synopt]/1 says that <tt>regex_constants::collate</tt> "Specifies that character ranges of the form 
! "<tt>[a-b]</tt>" shall be locale sensitive.", but 28.13 [re.grammar]/14 says that it affects individual character comparisons 
! too.
! </p>
  
! <p><i>[2012-02-12 Issaquah : recategorize as P3]</i></p>
  
  
! <p>
! Marshall Clow: 28.13/14 only applies to ECMAScript
! </p>
  
! <p>
! All: we're unsure
! </p>
  
+ <p>
+ Jonathan Wakely: we should ask John Maddock
+ </p>
+ 
+ <p>
+ Move to P3
+ </p>
  
+ <p><i>[2014-5-14, John Maddock response]</i></p>
  
  <p>
! The original intention was the original wording: namely that <tt>collate</tt> only made character ranges locale sensitive.  
! To be frank it's a feature that's probably hardly ever used (though I have no real hard data on that), and is a leftover 
! from early POSIX standards which <em>required</em> locale sensitive collation for character ranges, and then later changed 
! to implementation defined if I remember correctly (basically nobody implemented locale-dependent collation).
! <p/>
! So I guess the question is do we gain anything by requiring all character-comparisons to go through the locale when this bit 
! is set? Certainly it adds a great deal to the implementation effort (it's not what Boost.Regex has ever done). I guess the 
! question is are differing code-points that collate identically an important use case? I guess there might be a few Unicode 
! code points that do that, but I don't know how to go about verifying that.
! <p/>
! STL:
! <p/>
! If this was unintentional, then 28.5.1 [re.synopt]/1's table should be left alone, while 28.13 [re.grammar]/14 
! should be changed instead.
! <p/>
! Jeffrey Yasskin:
! <p/>
! <a href="http://www.unicode.org/reports/tr18/tr18-13.html#Tailored_Loose_Matches">This page</a>
! mentions that [V] in Swedish should match "W" in a perfect world.
! <p/>
! However, the most recent version of <a href="http://www.unicode.org/reports/tr18/#Tailored_Loose_Matches">TR18</a> retracts
! both language-specific loose matches <em>and</em> language-specific ranges
! because "for most full-featured regular expression engines, it is
! quite difficult to match under code point equivalences that are not
! 1:1" and "tailored ranges can be quite difficult to implement
! properly, and can have very unexpected results in practice. For
! example, languages may also vary whether they consider lowercase below
! uppercase or the reverse. This can have some surprising results: [a-Z]
! may not match anything if <tt>Z &lt; a</tt> in that locale."
! <p/>
! <a href="http://www.ecma-international.org/ecma-262/5.1/#sec-15.10.2.15">ECMAScript</a> doesn't include collation at all.
! <p/>
! IMO, +1 to changing 28.13 instead of 28.5.1. It seems like we'd be on
! fairly solid ground if we wanted to remove <tt>regex_constants::collate</tt>
! entirely, in favor of named character classes, but of course that's
! not for this issue.
  </p>
  
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3691.</p>
+ 
+ <ol>
+ <li><p>In 28.5.1 [re.synopt]/1, Table 138 &mdash; "<tt>syntax_option_type</tt> effects", change as indicated:</p>
+ 
+ <blockquote>
  <table border="1">
! <caption>Table 138 &mdash; <tt>syntax_option_type</tt> effects</caption>
! <tr>
! <th align="center">Element</th>
! <th align="center">Effect(s) if set</th>
  </tr>
+ 
  <tr>
! <td colspan="2" align="center">
! <tt>&hellip;</tt>
! </td>
  </tr>
+ 
  <tr>
! <td>
! <tt>collate</tt>
! </td>
! <td>
! Specifies that character <del>ranges of the form "<tt>[a-b]</tt>"</del><ins>comparisons and character range comparisons</ins> 
! shall be locale sensitive.
! </td>
  </tr>
+ 
  <tr>
! <td colspan="2" align="center">
! <tt>&hellip;</tt>
! </td>
  </tr>
! 
! </table>
  </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2334"></a>2334. <tt>atomic</tt>'s default constructor requires "uninitialized" state even for types with non-trivial default-constructor</h3>
! <p><b>Section:</b> 29.6.5 [atomics.types.operations.req] <b>Status:</b> <a href="lwg-active.html#SG1">SG1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-10-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.operations.req">active issues</a> in [atomics.types.operations.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations.req">issues</a> in [atomics.types.operations.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#SG1">SG1</a> status.</p>
! <p><b>Discussion:</b></p>
  <p>
! According to 29.6.5 [atomics.types.operations.req] p4,
  </p>
! <blockquote><pre>
! A ::A () noexcept = default;
! </pre><blockquote>
! <p>
! <i>Effects:</i> leaves the atomic object in an uninitialized state. [<i>Note:</i> These semantics ensure compatibility
! with <tt>C</tt>. &mdash; <i>end note</i>]
! </p>
! </blockquote></blockquote>
! <p>
! This implementation requirement is OK for POD types, like <tt>int</tt>, but 29.5 [atomics.types.generic] p1
! intentionally allows template arguments of <tt>atomic</tt> with a non-trivial default constructor ("The type of the template argument 
! <tt>T</tt> shall be trivially copyable (3.9)"), so this wording can be read in a way that makes the behaviour of the following code
! undefined:
! </p>
! <blockquote><pre>
! #include &lt;atomic&gt;
  #include &lt;iostream&gt;
  
! struct S {
!   S() noexcept : v(42) {}
!   int v;
! };
  
! int main() {
!   std::atomic&lt;S&gt; as; // Default-initialization
!   std::cout &lt;&lt; as.load().v &lt;&lt; std::endl; // ?
  }
+ </pre></blockquote>
+ <p>
+ For a user-defined emulation of <tt>atomic</tt> the expected outcome would be defined and the program would output "42",
+ but existing implementations differ and the result value is a "random number" for at least one implementation. This seems
+ very surprising to me.
+ <p/>
+ To realize that seemingly existing requirement, an implementation is either required to violate normal language rules internally
+ or to perform specific bit-randomization-techniques after the normal default-initialization that called the default constructor
+ of <tt>S</tt>.
+ <p/>
+ According to my understanding, the non-normative note in 29.6.5 [atomics.types.operations.req] p4 is intended to
+ refer to types that are valid <tt>C</tt>-types, but the example type <tt>S</tt> is not such a type.
+ <p/>
+ To make the mental model of <tt>atomic</tt>'s default constructor more intuitive for user-code, I suggest to clarify the wording
+ to have the effects of default-initialization instead. The current state seems more like an unintended effect of imprecise
+ language used here and has some similarities to wording that was incorrectly used to specify <tt>atomic_flag</tt> initialization 
+ as described by LWG <a href="lwg-defects.html#2159">2159</a>.
+ </p>
  
! <p><i>[2014-05-17, Daniel comments and provides alternative wording]</i></p>
! 
! 
! <p>
! The current wording was considered controversial as expressed by reflector discussions. To me, the actual problem is not newly
! introduced by that wording, but instead is already present in basically all paragraphs specifying semantics of atomic types,
! since the wording never clearly distinguishes the value of the actual atomic type <i>A</i> and the value of the "underlying",
! corresponding non-atomic type <i>C</i>. The revised proposed wording attempts to improve the current ambiguity of these two
! kinds of values.
! </p>
! 
! <strong>Previous resolution from Daniel [SUPERSEDED]:</strong>
! <p/>
! <blockquote class="note">
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Modify 29.6.5 [atomics.types.operations.req] p4 as indicated: <em>[Editorial note: There is no exposition-only
! member in <tt>atomic</tt>, which makes it a bit hard to specify what actually is initialized, but the usage of the term "value" 
! seems consistent with similar wording used to specify the effects of the atomic <tt>load</tt> functions]</em></p>
! 
! <blockquote><pre>
! A ::A () noexcept = default;
! </pre><blockquote>
! <p>
! -4- <i>Effects:</i> <del>leaves the atomic object in an uninitialized state</del><ins>The value of the atomic object
! is default-initialized (8.5 [dcl.init])</ins>. [<i>Note:</i> These semantics ensure compatibility
! with <tt>C</tt>. &mdash; <i>end note</i>]
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! </blockquote>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
  
+ <ol>
+ <li><p>Modify 29.6.5 [atomics.types.operations.req] p2 as indicated: <em>[Editorial note: This is a near-to editorial
+ change not directly affecting this issue, but <tt>atomic_address</tt> does no longer exist and the pointed to definition is
+ relevant in the context of this issue resolution.]</em>
+ </p>
+ <blockquote>
+ <p>
+ -2- In the following operation definitions:
+ </p>
+ <ul>
+ <li><p>an <i>A</i> refers to one of the atomic types.</p></li>
+ <li><p>a <i>C</i> refers to its corresponding non-atomic type. <del>The <tt>atomic_address</tt> atomic type corresponds to the
+ <tt>void*</tt> non-atomic type.</del></p></li>
+ <li><p>[&hellip;]</p></li>
+ </ul>
+ </blockquote>
+ </li>
  
+ <li><p>Modify 29.6.5 [atomics.types.operations.req] p4 and the following as indicated: <em>[Editorial note: There 
+ is no exposition-only member in <tt>atomic</tt>, which makes it a bit hard to specify what actually is initialized, but 
+ the introductory wording of 29.6.5 [atomics.types.operations.req] p2 b2 defines: "a <i>C</i> refers to its 
+ corresponding non-atomic type." which helps to specify the semantics in terms of "the <i>C</i> value referred to by the 
+ atomic object"]</em></p>
  
+ <blockquote>
+ <pre>
+ <i>A</i>::<i>A</i>() noexcept = default;
+ </pre>
+ <blockquote>
+ <p>
+ -4- <i>Effects:</i> <del>leaves the atomic object in an uninitialized state</del><ins>Default-initializes (8.5 [dcl.init]) 
+ the <i>C</i> value referred to by the atomic object</ins>. [<i>Note:</i> These semantics ensure compatibility with <tt>C</tt>. 
+ &mdash; <i>end note</i>]
+ </p>
+ </blockquote>
  
+ <pre>
+ constexpr <i>A</i>::<i>A</i>(<i>C</i> desired) noexcept;
+ </pre>
+ <blockquote>
+ <p>
+ -5- <i>Effects:</i> <ins>Direct-i</ins><del>I</del>nitializes the <ins><i>C</i> value referred to by the atomic</ins> object 
+ with the value <tt>desired</tt>. Initialization is not an atomic operation (1.10). [&hellip;]
+ <p/>
+ [&hellip;]
+ </p>
+ </blockquote>
  
! <pre>
! void atomic_init(volatile <i>A</i>* object, <i>C</i> desired) noexcept;
! void atomic_init(<i>A</i>* object, <i>C</i> desired) noexcept;
! </pre>
! <blockquote>
! <p>
! -8- <i>Effects:</i> Non-atomically initializes <ins>the <i>C</i> value referred to by</ins> <tt>*object</tt> with value 
! <tt>desired</tt>. [&hellip;]
! </p>
! </blockquote>
  
! <pre>
! void atomic_store(volatile <i>A</i>* object, <i>C</i> desired) noexcept;
! [&hellip;]
! void <i>A</i>::store(<i>C</i> desired, memory_order order = memory_order_seq_cst) noexcept;
! </pre>
! <blockquote>
! <p>
! -9- [&hellip;]
! <p/>
! -10- <i>Effects:</i> Atomically replaces the <ins><i>C</i></ins> value pointed to by 
! <tt>object</tt> or by <tt>this</tt> with the value of <tt>desired</tt>. [&hellip;]
! <p/>
! [&hellip;]
! </p>
! </blockquote>
  
! <pre>
! <i>C</i> atomic_load(const volatile <i>A</i>* object) noexcept;
! [&hellip;]
! <i>C</i> <i>A</i>::load(memory_order order = memory_order_seq_cst) const noexcept;
! </pre>
! <blockquote>
! <p>
! -13- [&hellip;]
! <p/>
! -14- [&hellip;]
! <p/>
! -15- <i>Returns:</i> Atomically returns the <ins><i>C</i></ins> value pointed to by <tt>object</tt> or by <tt>this</tt>.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
  
+ <pre>
+ <i>C</i> atomic_exchange(volatile <i>A</i>* object, C desired) noexcept;
+ [&hellip;]
+ <i>C</i> <i>A</i>::exchange(C desired, memory_order order = memory_order_seq_cst) noexcept;
+ </pre>
+ <blockquote>
  <p>
! -18- <i>Effects</i>: Atomically replaces the <ins><i>C</i></ins> value pointed to by <tt>object</tt> or by <tt>this</tt> with <tt>desired</tt>. [&hellip;]
! <p/>
! -19- <i>Returns:</i> Atomically returns the <ins><i>C</i></ins> value pointed to by <tt>object</tt> or by <tt>this</tt> 
! immediately before the effects.
! <p/>
! [&hellip;]
  </p>
+ </blockquote>
  
! <pre>
! <i>C</i> atomic_fetch_key(volatile <i>A</i>* object, <i>M</i> operand) noexcept;
! [&hellip;]
! <i>C</i> <i>A</i>::fetch_key(<i>M</i> operand, memory_order order = memory_order_seq_cst) noexcept;
! </pre>
! <blockquote>
! <p>
! -28- <i>Effects</i>: Atomically replaces the <ins><i>C</i></ins> value pointed to by <tt>object</tt> or by <tt>this</tt> with 
! the result of the computation applied to the <ins><i>C</i></ins> value pointed to by <tt>object</tt> or by <tt>this</tt> and 
! the given <tt>operand</tt>. [&hellip;]
! <p/>
! -29- <i>Returns:</i> Atomically<del>,</del> <ins>returns</ins> the <ins><i>C</i></ins> value pointed to by <tt>object</tt>
! or by <tt>this</tt> immediately before the effects.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! 
! </blockquote>
! </li>
  
+ <li><p>Modify 29.7 [atomics.flag] p5 and the following as indicated:</p>
  
+ <blockquote>
+ <pre>
+ bool atomic_flag_test_and_set(volatile atomic_flag* object) noexcept;
+ [&hellip;]
+ bool atomic_flag::test_and_set(memory_order order = memory_order_seq_cst) noexcept;
+ </pre>
+ <blockquote>
  <p>
! -5- <i>Effects</i>: Atomically sets the <ins>bool</ins> value pointed to by <tt>object</tt> or by <tt>this</tt> to <tt>true</tt>. 
! [&hellip;]
! <p/>
! -6- <i>Returns</i>: Atomically<del>,</del> <ins>returns</ins> the <ins>bool</ins> value <del>of the</del><ins>pointed 
! to by</ins> <tt>object</tt> <ins>or by <tt>this</tt></ins> immediately before the effects.
  </p>
+ </blockquote>
  
+ <pre>
+ void atomic_flag_clear(volatile atomic_flag* object) noexcept;
+ [&hellip;]
+ void atomic_flag::clear(memory_order order = memory_order_seq_cst) noexcept;
+ </pre>
  <blockquote>
! <p>
! -7- [&hellip;]
! <p/>
! -8- <i>Effects</i>: Atomically sets the <ins>bool</ins> value pointed to by <tt>object</tt> or by <tt>this</tt> to <tt>false</tt>. 
! [&hellip;]
! </p>
  </blockquote>
  
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2335"></a>2335. <tt>array&lt;array&lt;int, 3&gt;, 4&gt;</tt> should be layout-compatible with <tt>int[4][3]</tt></h3>
! <p><b>Section:</b> 23.3.2 [array] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2013-10-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In order to replace some uses of C arrays with <tt>std::array</tt>, we need it
! to be possible to cast from a <tt>std::array&lt;&gt;</tt> to an equivalent C array.
! Core wording doesn't appear to be in quite the right state to allow
! casting, but if we specify that appropriate types are
! layout-compatible, we can at least write:
! </p>
! <blockquote><pre>
! union {
!   array&lt;array&lt;array&lt;int, 2&gt;, 3&gt;, 4&gt; arr;
!   int carr[4][3][2];
! };
! </pre></blockquote>
! <p>
! to view memory as the other type: C++14 CD [class.mem]p18.
! </p>
! I believe it's sufficient to add "<tt>array&lt;T, N&gt;</tt> shall be
! layout-compatible (3.9 [basic.types]) with <tt>T[N]</tt>." to 
! 23.3.2.1 [array.overview], but we might also need some extension to 
! 9.2 [class.mem] to address the possibility of layout-compatibility 
! between struct and array types.
! <p>
! I checked that libc++ on MacOS already implements this, although it
! would be good for someone else to double-check; I haven't checked any
! other standard libraries.
! </p>
! 
  
  
  <p><b>Proposed resolution:</b></p>
*************** I don't object to adding "even if detach
*** 6174,6533 ****
  
  
  <hr>
! <h3><a name="1487"></a>1487. [FCD] Clock related operations exception specifications conflict</h3>
! <p><b>Section:</b> 30.3.2 [thread.thread.this] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-01</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#thread.thread.this">active issues</a> in [thread.thread.this].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.this">issues</a> in [thread.thread.this].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses CH-25</b></p>
  
! Clock related operations are currently not required not to
! throw. So "Throws: Nothing." is not always true.
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  <blockquote>
! Either require clock related operations not to throw
! (in 20.10) or change the Throws clauses in 30.3.2.
! Also possibly add a note that <tt>abs_time</tt> in the past
! or negative <tt>rel_time</tt> is allowed.
  </blockquote>
  
  
  
- <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1494"></a>1494. [FCD] Term "are serialized" not defined</h3>
! <p><b>Section:</b> 30.4.4.2 [thread.once.callonce] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-190</b></p>
  
! The term "are serialized" is never defined (30.4.4.2 [thread.once.callonce] p. 2).
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  <p>
! Remove the sentence with "are serialized" from
! paragraph 2. Add "Calls to <tt>call_once</tt> on the same
! <tt>once_flag</tt> object shall not introduce data races
! (17.6.4.8)." to paragraph 3.
  </p>
  
! <p><i>[
! 2010-11-01 Daniel translates NB comment into wording
! ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
! Change 30.4.4.2 [thread.once.callonce] p.2+3 as indicated:
! <blockquote><pre>template&lt;class Callable, class ...Args&gt;
! void call_once(once_flag&amp; flag, Callable&amp;&amp; func, Args&amp;&amp;... args);
  </pre><blockquote>
- [..]
  <p>
! 2 <em>Effects</em>: <del>Calls to <tt>call_once</tt> on the same <tt>once_flag</tt> object are serialized.</del>
! If there has been a prior effective call to <tt>call_once</tt> on the same <tt>once_flag object</tt>, 
! the call to <tt>call_once</tt> returns without invoking <tt>func</tt>. If there has been no prior 
! effective call to <tt>call_once</tt> on the same <tt>once_flag</tt> object,
! <tt>INVOKE(decay_copy( std::forward&lt;Callable&gt;(func)), decay_copy(std::forward&lt;Args&gt;(args))...)</tt>
! is executed. The call to <tt>call_once</tt> is effective if and only if 
! <tt>INVOKE(decay_copy( std::forward&lt;Callable&gt;(func)), decay_copy(std::forward&lt;Args&gt;(args))...)</tt> 
! returns without throwing an exception. If an exception is thrown it is propagated to the caller.
! </p><p>
! 3 <em>Synchronization</em>: The completion of an effective call to <tt>call_once</tt> on a <tt>once_flag</tt> 
! object synchronizes with (1.10) all subsequent calls to <tt>call_once</tt> on the same <tt>once_flag</tt> object.
! <ins>Calls to <tt>call_once</tt> on the same <tt>once_flag</tt> object shall not introduce data races ([res.on.data.races]).</ins>
! </p></blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1497"></a>1497. [FCD] <tt>lock()</tt> postcondition can not be generally achieved</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Tentatively Ready</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-08</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively Ready">Tentatively Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses CH-30</b></p>
  
! If <tt>lock.lock()</tt> throws an exception, the postcondition can not be generally achieved.
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
! <blockquote>
! Either state that the postcondition might not be achieved, depending on the error condition, or
! state that <tt>terminate()</tt> is called in this case.
  </blockquote>
  
! <p><i>[
! 2010-08-13 Peter Sommerlad comments and provides wording
! ]</i></p>
  
  
  <blockquote>
- 30.5.1 [thread.condition.condvar], 30.5.2 [thread.condition.condvarany]
  <p>
! p. 13, last bullet, and corresponding paragraphs in all wait functions
! </p><p>
! Problem:<br>
! Condition variable wait might fail, because the lock cannot be acquired when notified.
! CH-30 says: "If lock.lock() throws an exception, the postcondition can not be generally achieved."
! CH-30 proposes: "Either state that the postcondition might not be achieved, depending on the error 
! condition, or state that terminate() is called in this case."
! </p><p>
! The discussion in Rapperswil concluded that calling <tt>terminate()</tt> might be too drastic in 
! this case and a corresponding exception should be thrown/passed on and one should use a lock type 
! that allows querying its status, which <tt>unique_lock</tt> allows for <tt>std::condition_variable</tt>
! </p><p>
! We also had some additional observations while discussing in Rapperswil:
! </p><ul>
! <li>in 30.5.1 [thread.condition.condvar] <tt>wait</tt> with predicate and <tt>wait_until</tt> with 
! predicate lack the precondition, postcondition and Error conditions sections. the lack of the precondition 
! would allow to call <tt>pred()</tt> without holding the lock.
  </li>
! <li>in 30.5.1 [thread.condition.condvar] <tt>wait_until</tt> and <tt>wait_for</tt> and 
! 30.5.2 [thread.condition.condvarany] <tt>wait_for</tt> still specify an 
! error condition for a violated precondition. This should be removed.
  </li>
  </ul>
! and add the following proposed solution:
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change 30.5.1 [thread.condition.condvar] as indicated:
! <blockquote><pre>void wait(unique_lock&lt;mutex&gt;&amp; lock);
  </pre></blockquote>
- <blockquote>
- 12 <i>Requires</i>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread, and either
- <ul>
- <li>no other thread is waiting on this <tt>condition_variable</tt> object or
  </li>
! <li><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt> or <tt>timed_wait</tt>) threads.
  </li>
! </ul>
! </blockquote>
! [..]
  <blockquote>
! 14 <em>Postcondition</em>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread.
  </blockquote>
! [..]
! <blockquote><pre>template &lt;class Predicate&gt;
! void wait(unique_lock&lt;mutex&gt;&amp; lock, Predicate pred);
  </pre></blockquote>
  <blockquote>
! <ins>?? <i>Requires</i>: <tt>lock.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt> is locked by the calling thread, and either</ins>
! <ul>
! <li><ins>no other thread is waiting on this <tt>condition_variable</tt> object or</ins>
  </li>
! <li><ins><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt> or <tt>timed_wait</tt>) threads.</ins>
  </li>
! </ul>
  </blockquote>
  <blockquote>
! 17 <i>Effects</i>:
! <blockquote><pre>while (!pred())
!   wait(lock);
! </pre></blockquote>
  </blockquote>
  
  <blockquote>
! <ins>?? <i>Postcondition</i>: <tt>lock.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt> is locked by the calling thread.</ins>
  </blockquote>
- <blockquote>
- <ins>?? <i>Throws</i>: <tt>std::system_error</tt> when an exception is required (30.2.2).</ins>
  </blockquote>
- <blockquote>
- <ins>?? <em>Error conditions</em>:</ins>
- <ul>
- <li><ins>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</ins>
  </li>
! </ul>
! </blockquote>
  
! <blockquote><pre>template &lt;class Clock, class Duration&gt;
! cv_status wait_until(unique_lock&lt;mutex&gt;&amp; lock,
!   const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
  </pre></blockquote>
! <blockquote>
! 18 <i>Requires</i>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread, and either
! <ul>
! <li>no other thread is waiting on this <tt>condition_variable</tt> object or
  </li>
! <li><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt>, <tt>wait_for</tt>, or <tt>wait_until</tt>) threads.
  </li>
! </ul>
! </blockquote>
! [..]
  <blockquote>
! 20 <em>Postcondition</em>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread.
  </blockquote>
! [..]
  <blockquote>
! 23 <em>Error conditions</em>:
  <ul>
! <li><del><tt>operation_not_permitted</tt> — if the thread does not own the lock.</del>
! </li>
! <li>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
! </li>
  </ul>
  </blockquote>
! <blockquote><pre>template &lt;class Rep, class Period&gt;
! cv_status wait_for(unique_lock&lt;mutex&gt;&amp; lock,
!   const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre></blockquote>
- <blockquote>
- 24 <i>Requires</i>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread, and either
- <ul>
- <li>no other thread is waiting on this <tt>condition_variable</tt> object or
  </li>
! <li><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt>, <tt>wait_for</tt>, or <tt>wait_until</tt>) threads.
  </li>
! </ul>
  </blockquote>
! [..]
  <blockquote>
! 27 <em>Postcondition</em>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread.
  </blockquote>
! [..]
  <blockquote>
! 29 <em>Error conditions</em>:
! <ul>
! <li><del><tt>operation_not_permitted</tt> — if the thread does not own the lock.</del>
  </li>
! <li>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
  </li>
  </ul>
  </blockquote>
! <blockquote><pre>template &lt;class Clock, class Duration, class Predicate&gt;
! bool wait_until(unique_lock&lt;mutex&gt;&amp; lock,
!   const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time,
!     Predicate pred);
  </pre></blockquote>
! <blockquote>
! <ins>?? <i>Requires</i>: <tt>lock.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt> is locked by the calling thread, and either</ins>
! <ul>
! <li><ins>no other thread is waiting on this <tt>condition_variable</tt> object or</ins>
  </li>
! <li><ins><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt> or <tt>timed_wait</tt>) threads.</ins>
  </li>
! </ul>
! </blockquote>
  <blockquote>
! 30 <i>Effects</i>:
! <blockquote><pre>while (!pred())
!   if (wait_until(lock, abs_time) == cv_status::timeout)
!     return pred();
! return true;
! </pre></blockquote>
  </blockquote>
  <blockquote>
! 31 <i>Returns</i>: <tt>pred()</tt>
  </blockquote>
  
  <blockquote>
! <ins>?? <i>Postcondition</i>: <tt>lock.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt> is locked by the calling thread.</ins>
  </blockquote>
  
  <blockquote>
! 32 [ <i>Note</i>: The returned value indicates whether the predicate evaluates to true regardless of whether the
! timeout was triggered. — <i>end note</i> ]
  </blockquote>
  
  <blockquote>
! <ins>?? <i>Throws</i>: <tt>std::system_error</tt> when an exception is required (30.2.2).</ins>
  </blockquote>
  <blockquote>
! <ins>?? <em>Error conditions</em>:</ins>
! <ul>
! <li><ins>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</ins>
  </li>
! </ul>
  </blockquote>
  
! <blockquote><pre>template &lt;class Rep, class Period, class Predicate&gt;
! bool wait_for(unique_lock&lt;mutex&gt;&amp; lock,
!   const chrono::duration&lt;Rep, Period&gt;&amp; rel_time,
!     Predicate pred);
! </pre></blockquote>
  <blockquote>
! 33 <i>Requires</i>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread, and either
! <ul>
! <li>no other thread is waiting on this <tt>condition_variable</tt> object or
! </li>
! <li><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt>, <tt>wait_for</tt>, or <tt>wait_until</tt>) threads.
  </li>
! </ul>
  </blockquote>
! [..]
  <blockquote>
! 36 <em>Postcondition</em>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread.
  </blockquote>
! [..]
  <blockquote>
! 40 <em>Error conditions</em>:
! <ul>
! <li><del><tt>operation_not_permitted</tt> — if the thread does not own the lock.</del>
  </li>
! <li>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
  </li>
! </ul>
  </blockquote>
  
  </li>
  
! <li>Change 30.5.2 [thread.condition.condvarany] as indicated:
  <p>
! [..]
! </p><blockquote><pre>template &lt;class Lock, class Predicate&gt;
! void wait(Lock&amp; lock, Predicate pred);
  </pre></blockquote>
  <blockquote>
! <ins>[<i>Note</i>: if any of the wait functions exits with an exception it is indeterminate if the <tt>Lock</tt> is held. 
! One can use a <tt>Lock</tt> type that allows to query that, such as the <tt>unique_lock</tt> wrapper. — <i>end note</i>]</ins>
  </blockquote>
  <blockquote>
! 14 <i>Effects</i>:
! <blockquote><pre>while (!pred())
!   wait(lock);
! </pre></blockquote>
  </blockquote>
  
! [..]
  <blockquote>
! 34 <em>Error conditions</em>:
! <ul>
! <li><del><tt>operation_not_permitted</tt> — if the thread does not own the lock.</del>
  </li>
! <li>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
  </li>
! </ul>
  </blockquote>
  </li>
  
--- 21375,24599 ----
  
  
  <hr>
! <h3><a name="2336"></a>2336. <tt>is_trivially_constructible/is_trivially_assignable</tt> traits are always false</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-10-01 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! In 20.10.4.3 [meta.unary.prop] we have traits to allow testing for triviality of specific operations, such as
! <tt>is_trivially_constructible</tt> and <tt>is_trivially_assignable</tt> (and their derived forms), which are specified
! in terms of the following initialization and assignment, respectively:
! </p>
! <blockquote><pre>
! T t(create&lt;Args&gt;()...);
  
! declval&lt;T&gt;() = declval&lt;U&gt;()
! </pre></blockquote>
! <p>
! The wording that describes the way how triviality is deduced, is in both cases of the same form:
! </p>
! <blockquote><p>
! [&hellip; ] and the variable definition/assignment, as defined by <tt>is_constructible/is_assignable</tt>, is known
! to call no operation that is not trivial (3.9, 12).
! </p></blockquote>
! <p>
! The problematic part of this wording is that both definitions are specified in terms of an "object construction" function
! <tt>create</tt> or <tt>declval</tt>, respectively, (The former being a conceptual function, the latter being a library function), 
! but for none of these functions we can assume that they could be considered as trivial &mdash; only special member functions can 
! have this property and none of these is one. This problem became obvious, when the similar issue LWG <a href="lwg-defects.html#2298">2298</a> 
! in regard to <tt>is_nothrow_constructible</tt> was opened.
! <p/>
! A possible approach to solve this specification problem is to make a blanket statement for sub-clause 20.10.4.3 [meta.unary.prop]
! that these helper functions are considered trivial for the purpose of defining these traits.
! <p/>
! Using this kind of wording technique can also be used to get rid of the additional helper function template <tt>create</tt>, which
! is currently needed for the <tt>is_convertible</tt> and the <tt>is_constructible</tt> traits, because both traits are specified in
! terms of contexts where technically the corresponding "object construction" function would be considered as odr-used. This is problematic,
! because these traits are defined in terms of well-formed code and odr-using <tt>declval</tt> would make the program ill-formed (see
! 20.2.5 [declval]). So extending above blanket statement to consider <tt>std::declval&lt;T&gt;()</tt> as not odr-used
! in the context of the corresponding trait definition would allow for replacing <tt>create</tt> by <tt>declval</tt>.
! </p>
  
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! STL: would you consider moving the change to 20.10 as editorial or are you uncomfortable with it?<br/>
! JW: this sounds a viable editorial change<br/>
! VV: I guarantee you that moving it doesn't change anything<br/>
! MC: how about this: we move it to Ready as is and if we conclude moving it is editorial we can do it and if not open an issue<br/>
! STL: I would like to guarantee that the lifting happens<br/>
! JW: I do that! If it goes in I move it up<br/>
! MC: move to Ready: in favor: 15, opposed: 0, abstain: 1 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Add a new paragraph after 20.10.4.3 [meta.unary.prop] p3 as indicated: <em>[Editorial note: The first change in
! 20.10.4.3 [meta.unary.prop] p3 is recommended, because technically a Clause is always a "main chapter" &mdash; such as
! Clause 20 &mdash; but every child of a Clause or sub-clause is a sub-clause]</em></p>
  
  <blockquote>
! <p>
! [&hellip;]
! <p/>
! -3- For all of the class templates <tt>X</tt> declared in this <del>Clause</del><ins>sub-clause</ins>, instantiating that 
! template with a template-argument that is a class template specialization may result in the implicit instantiation of the 
! template argument if and only if the semantics of <tt>X</tt> require that the argument must be a complete type.
! <p/>
! <ins>-?- For the purpose of defining the templates in this sub-clause, a function call expression 
! <tt>declval&lt;T&gt;()</tt> for any type <tt>T</tt> is considered to be a trivial (3.9 [basic.types], 12 [special]) 
! function call that is not an odr-use (3.2 [basic.def.odr]) of <tt>declval</tt> in the context of the corresponding definition 
! notwithstanding the restrictions of 20.2.5 [declval].</ins>
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! </li>
! 
! <li><p>Modify 20.10.4.3 [meta.unary.prop] p7 as indicated:</p>
! 
! <blockquote>
! <p>
! -7- <del>Given the following function prototype:</del>
! </p>
! <blockquote><pre>
! <del>template &lt;class T&gt;
!   typename add_rvalue_reference&lt;T&gt;::type create();</del>
! </pre></blockquote>
! <p>
! <del>t</del><ins>T</ins>he predicate condition for a template specialization <tt>is_constructible&lt;T, Args...&gt;</tt> 
! shall be satisfied if and only if the following variable definition would be well-formed for some invented variable <tt>t</tt>:
! </p>
! <blockquote><pre>
! T t(<del>create</del><ins>declval</ins>&lt;Args&gt;()...);
! </pre></blockquote>
! <p>
! [&hellip;]
! </p>
  </blockquote>
+ </li>
  
+ <li><p>Add a new paragraph after 20.10.6 [meta.rel] p2 as indicated: <em>[Editorial note: Technically we don't need
+ the guarantee of "a trivial function call" for the type relationship predicates at the very moment, but it seems more robust and
+ consistent to have the exact same guarantee here as well]</em>
+ </p>
+ <blockquote>
+ <p>
+ [&hellip;]
+ <p/>
+ -2- [&hellip;]
+ <p/>
+ <ins>-?- For the purpose of defining the templates in this sub-clause, a function call expression 
+ <tt>declval&lt;T&gt;()</tt> for any type <tt>T</tt> is considered to be a trivial (3.9 [basic.types], 12 [special]) 
+ function call that is not an odr-use (3.2 [basic.def.odr]) of <tt>declval</tt> in the context of the corresponding definition 
+ notwithstanding the restrictions of 20.2.5 [declval].</ins>
+ <p/>
+ [&hellip;]
+ </p>
+ </blockquote>
+ </li>
  
+ <li><p>Modify 20.10.6 [meta.rel] p4 as indicated:</p>
+ 
+ <blockquote>
+ <p>
+ -4- <del>Given the following function prototype:</del>
+ </p>
+ <blockquote><pre>
+ <del>template &lt;class T&gt;
+   typename add_rvalue_reference&lt;T&gt;::type create();</del>
+ </pre></blockquote>
+ <p>
+ <del>t</del><ins>T</ins>he predicate condition for a template specialization <tt>is_convertible&lt;From, To&gt;</tt> 
+ shall be satisfied if and only if the return expression in the following code would be well-formed, including any implicit 
+ conversions to the return type of the function:
+ </p>
+ <blockquote><pre>
+ To test() {
+   return <del>create</del><ins>declval</ins>&lt;From&gt;();
+ }
+ </pre></blockquote>
+ <p>
+ [&hellip;]
+ </p>
+ </blockquote>
+ </li>
+ 
+ </ol>
  
  
  
  
  
  
  <hr>
! <h3><a name="2337"></a>2337. <tt>shared_ptr operator*()</tt> should not be <tt>noexcept</tt></h3>
! <p><b>Section:</b> 20.8.2.2.5 [util.smartptr.shared.obs] <b>Status:</b> <a href="lwg-active.html#NAD">Tentatively NAD</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-10-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.obs">issues</a> in [util.smartptr.shared.obs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Tentatively NAD">Tentatively NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! 20.8.1.2.4 [unique.ptr.single.observers]/3: "<tt>pointer operator-&gt;() const noexcept;</tt> <i>Requires:</i> <tt>get() != nullptr</tt>."
! <p/>
! 20.8.2.2.5 [util.smartptr.shared.obs]/2: "<tt>T&amp; operator*() const noexcept;</tt> <i>Requires:</i> <tt>get() != 0</tt>."
! <p/>
! 20.8.2.2.5 [util.smartptr.shared.obs]/5: "<tt>T* operator-&gt;() const noexcept;</tt> <i>Requires:</i> <tt>get() != 0</tt>."
! <p/>
! Narrow-contract functions should not be <tt>noexcept</tt>.
! </p>
  
! <p><i>[2014-02-15 Issaquah]</i></p>
  
! <p>
! Issue is contentious, raise to P2.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
  
  <p>
! AM: This ship has sailed. JM: What's the issue? AM: <tt>operator-&gt;</tt> has narrow contract and should never have had 
! <tt>noexcept</tt>. DK: Not quite. We explicitly called out that for <tt>shared_ptr</tt> this is fine. You said so in your 
! "narrow contract" paper. GR: This would be a fairly major regression in the design of {<tt>unique</tt>,<tt>shared</tt>}<tt>_ptr</tt> 
! over raw pointers; raw pointer dereferencing is <tt>noexcept</tt>. It's not a performance regression but a usability regression. 
! AM: Do we expect users to query <tt>noexpect</tt> on dereference expressions? Room: Yes. VV: We don't just expect it, we have 
! seen it. JM: Yes, users may be querying something like <tt>noexcept(x-&gt;y)</tt> and expect to be checking <tt>y</tt>, but 
! silently end up checking <tt>x-&gt;</tt>. 
! <p/>
! Close as NAD, with explanation from GR.
  </p>
  
! <strong>Previous resolution [SUPERSEDED]:</strong>
! <blockquote class="note">
! <p>This wording is relative to N3691.</p>
  
+ <ol>
+ <li><p>In 20.8.1.2 [unique.ptr.single]/1, class template <tt>unique_ptr</tt> synopsis for single objects, change as indicated:</p>
+ 
+ <blockquote><pre>
+ pointer operator-&gt;() const <del>noexcept</del>;
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>In 20.8.1.2.4 [unique.ptr.single.observers] change as indicated:</p>
+ 
+ <blockquote><pre>
+ pointer operator-&gt;() const <del>noexcept</del>;
+ </pre><blockquote>
+ <p>
+ -3- <i>Requires:</i> <tt>get() != nullptr</tt>.
+ <p/>
+ -4- <i>Returns:</i> <tt>get()</tt>.
+ <p/>
+ <ins>-?- <i>Throws:</i> Nothing.</ins>
+ <p/>
+ -5- <i>Note:</i> use typically requires that <tt>T</tt> be a complete type.
+ </p>
+ </blockquote></blockquote>
+ </li>
+ 
+ <li><p>In 20.8.2.2 [util.smartptr.shared]/1, class template <tt>shared_ptr</tt> synopsis, change as indicated:</p>
+ 
+ <blockquote><pre>
+ T&amp; operator*() const <del>noexcept</del>;
+ T* operator-&gt;() const <del>noexcept</del>;
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>In 20.8.2.2.5 [util.smartptr.shared.obs] change as indicated:</p>
+ 
+ <blockquote><pre>
+ T&amp; operator*() const <del>noexcept</del>;
+ </pre><blockquote>
+ <p>
+ -2- <i>Requires:</i> <tt>get() != 0</tt>.
+ <p/>
+ -3- <i>Returns:</i> <tt>*get()</tt>.
+ <p/>
+ <ins>-?- <i>Throws:</i> Nothing.</ins>
+ <p/>
+ -4- <i>Remarks:</i> When <tt>T</tt> is <tt>void</tt>, it is unspecified whether this member function is declared. 
+ If it is declared, it is unspecified what its return type is, except that the declaration (although not necessarily the
+ definition) of the function shall be well formed.
+ </p>
+ </blockquote></blockquote>
+ 
+ <blockquote><pre>
+ T* operator-&gt;() const <del>noexcept</del>;
+ </pre><blockquote>
+ <p>
+ -5- <i>Requires:</i> <tt>get() != 0</tt>.
+ <p/>
+ -6- <i>Returns:</i> <tt>get()</tt>.
+ <p/>
+ <ins>-?- <i>Throws:</i> Nothing.</ins>
+ </p>
+ </blockquote></blockquote>
+ </li>
+ 
+ </ol>
+ </blockquote>
+ 
+ <p><i>[2015-03-03, Geoffrey provides rationale]</i></p>
+ 
+ <p>
+ <b>Rationale</b>:
+ </p>
+ <blockquote>
+ <p>
+ It is by design that these members are <tt>noexcept</tt>, and changing that now would be a substantial regression in functionality. 
+ These classes were designed to substitute for plain pointers as transparently as possible, so since those operations are effectively 
+ <tt>noexcept</tt> on plain pointers, they should be <tt>noexcept</tt> on <tt>unique_ptr</tt> and <tt>shared_ptr</tt> as well. 
+ This matters in practice because we expect these members to be used fairly often inside the <tt>noexcept</tt> operator, and such 
+ code could be broken by this change. These design considerations override our general policy against <tt>noexcept</tt> for 
+ narrow-contract functions.
+ <p/>
+ It is notable that N3279, which proposed this policy, did not propose striking <tt>noexcept</tt> from these operations. It's not 
+ clear if the omission of <tt>operator*</tt> and <tt>operator-&gt;</tt> was an oversight, or an intentional reflection of the above 
+ considerations. N3279 was based on N3248 by the same authors, which states that:
+ </p>
+ <blockquote>
+ <p>
+ "Most applications of <tt>noexcept</tt> for <tt>unique_ptr</tt> and <tt>shared_ptr</tt> are on functions with wide contracts. 
+ However, there are preconditions on the atomic access functions, so these should lose the specification."
+ </p>
+ </blockquote>
+ </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2338"></a>2338. [re.traits]/7 expects of locale facets something not guaranteed by [locale.facet]/4</h3>
! <p><b>Section:</b> 28.7 [re.traits], 22.3.1.1.2 [locale.facet] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Sergey Zubkov <b>Opened:</b> 2013-10-15 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.traits">issues</a> in [re.traits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 28.7 [re.traits]/7, begins with "if <tt>typeid(use_facet&lt;collate&lt;charT&gt; &gt;) == typeid(collate_byname&lt;charT&gt;)</tt>", 
! which appears to be pseudocode with the intention to convey that the collate facet has not been replaced by the user. Cf. the wording in 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1429.htm">N1429</a> "there is no portable way to implement 
! <tt>transform_primary</tt> in terms of <tt>std::locale</tt>, since even if the sort key format returned by 
! <tt>std::collate_byname&lt;&gt;::transform</tt> is known and can be converted into a primary sort key, the user can still 
! install their own custom <tt>std::collate</tt> implementation into the locale object used, and that can use any sort key 
! format they see fit.".
! <p/>
! Taken literally, 28.7 [re.traits]/7 appears to imply that named locales are required to hold their collate facets with 
! dynamic type <tt>std::collate_byname&lt;charT&gt;</tt>, which is in fact true in some implementations (e.g libc++), but not others 
! (e.g. libstdc++). This does not follow from the description of <tt>_byname</tt> in 22.3.1.1.2 [locale.facet]/4, which is only 
! required to provide equivalent semantics, to the named locale's facet, not to actually be one.
! </p>
! 
! 
! <p><i>[2015-05-06 Lenexa: Move to Open]</i></p>
! 
! 
! <p>MC, RP: Consequence of failing to follow the rule is UB.</p>
! <p>MC: Tightening of requirements.</p>
! <p>RP: It should be this way, we just didn't impose it before.</p>
! <p>MC: Second change is a bug fix, original code didn't work.</p>
! <p>TK: Doesn't seem to make things worse.</p>
! <p>Bring up in larger group tomorrow.</p>
! <p>JW arrives.</p>
! <p>JW: libstdc++ violates this due to two std::string ABIs.</p>
! <p>JW: This prevents installing a type derived from Facet_byname, constrains the implementor from using a smarter derived class version.</p>
! <p>JW: Can't look at facet id to detect replacement, because replacements have the same id.</p>
! <p>RP: Can you give it multiple ids through multiple inheritance?</p>
! <p>JW: No, the facet mechanism wouldn't like that.</p>
! <p>JW: We should also ask Martin Sebor, he's implemented this stuff recently.</p>
! <p>MC: Sounds like this resolution doesn't work, need a better solution.</p>
! <p>JW: Write in words "if the facet has not been replaced by the user", the implementation knows how to detect that, but not like this.</p>
! <p>RP: User RE traits need to detect this too.</p>
! <p>JW: =(</p>
! <p>Move to Open, JW will invite Martin Sebor to join LWG for discussion.</p>
! <p>Later ... </p>
! <p>JW: This is not needed for user specializations after all.</p>
! <p>MC: Agree, [re.traits]/7 only applies to the stdlib traits.</p>
! <p>NM: Effects: doesn't make sense.</p>
! <p>JW, NM, Martin Sebor to come up with new wording.</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Modify 22.3.1.1.2 [locale.facet]/4 as indicated:</p>
! 
! <blockquote><p>
! For some standard facets a standard "...<tt>_byname</tt>" class, derived from it, implements the virtual function
! semantics <del>equivalent to</del><ins>provided by</ins> that facet of the locale constructed by <tt>locale(const char*)</tt> 
! with the same name.
! Each such facet provides a constructor that takes a <tt>const char*</tt> argument, which names the locale, and a
! <tt>refs</tt> argument, which is passed to the base class constructor. Each such facet also provides a constructor
! that takes a string argument <tt>str</tt> and a <tt>refs</tt> argument, which has the same effect as calling the first
! constructor with the two arguments <tt>str.c_str()</tt> and <tt>refs</tt>. If there is no "...<tt>_byname</tt>" 
! version of a facet, the base class implements named locale semantics itself by reference to other facets. <ins>For any 
! locale <tt>loc</tt> constructed by <tt>locale(const char*)</tt> and facet <tt>Facet</tt> that has a corresponding standard 
! <tt>Facet_byname</tt> class, <tt>typeid(use_facet&lt;Facet&gt;(loc)) == typeid(Facet_byname)</tt>.</ins>
! </p></blockquote>
! </li>
! 
! <li><p>Modify 28.7 [re.traits]/7 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class ForwardIterator&gt;
!   string_type transform_primary(ForwardIterator first, ForwardIterator last) const;
  </pre><blockquote>
  <p>
! -7- <i>Effects:</i> if <tt>typeid(use_facet&lt;collate&lt;charT&gt; &gt;<ins>(getloc())</ins>) == typeid(collate_byname&lt;charT&gt;)</tt> 
! and the form of the sort key returned by <tt>collate_byname&lt;charT&gt;::transform(first, last)</tt> is known and
! can be converted into a primary sort key then returns that key, otherwise returns an empty string.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2342"></a>2342. User conversion to <tt>wchar_t const*</tt> or to <tt>wchar_t</tt> not invoked for <tt>operator&lt;&lt;</tt></h3>
! <p><b>Section:</b> 27.7.3.1 [ostream] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Alf P. Steinbach <b>Opened:</b> 2013-10-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream">issues</a> in [ostream].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! For wide streams argument types <tt>wchar_t const*</tt> and <tt>wchar_t</tt> are supported only as template parameters. 
! User defined conversions are not considered for template parameter matching. Hence inappropriate overloads of 
! <tt>operator&lt;&lt;</tt> are selected when an implicit conversion is required for the argument, which is inconsistent 
! with the behavior for <tt>char const*</tt> and <tt>char</tt>, is unexpected, and is a useless result.
! <p/>
! Demonstration:
! </p>
! <blockquote><pre>
! #include &lt;iostream&gt;
  
! struct Byte_string
! { 
!   operator char const*() const { return "Hurray, it works!"; } 
! };
  
! struct Wide_string
! { 
!   operator wchar_t const*() const { return L"Hurray, it works!"; } 
! };
  
! struct Byte_ch
! { 
!   operator char() const { return 'X'; } 
! };
! 
! struct Wide_ch
! { 
!   operator wchar_t() const { return L'X'; } 
! };
! 
! auto main() -> int
! {
!   using namespace std;
!   wcout &lt;&lt; "'X' as char value   : " &lt;&lt; Byte_ch() &lt;&lt; endl;
!   wcout &lt;&lt; "'X' as wchar_t value: " &lt;&lt; Wide_ch() &lt;&lt; endl;
!   wcout &lt;&lt; "Byte string pointer : " &lt;&lt; Byte_string() &lt;&lt; endl;
!   wcout &lt;&lt; "Wide string pointer : " &lt;&lt; Wide_string() &lt;&lt; endl;
! }
! </pre></blockquote>
! <p>
! Example output:
! </p>
! <blockquote><pre>
! 'X' as char value   : X
! 'X' as wchar_t value: 88
! Byte string pointer : Hurray, it works!
! Wide string pointer : 000803C8
! </pre></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Modify 27.7.3.1 [ostream], class template <tt>basic_ostream</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
! [&hellip;]
! 
! <i>// 27.7.3.6.4 character inserters</i>
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp;,
!                                           charT);
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp;,
!                                           char);
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp;,
!                                          char);
! <ins>template&lt;class traits&gt;
!   basic_ostream&lt;wchar_t,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;wchar_t,traits&gt;&amp;,
!                                             wchar_t);</ins>
! [&hellip;]
! 
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp;,
!                                           const charT*);
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp;,
!                                           const char*);
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp;,
!                                          const char*);
! <ins>template&lt;class traits&gt;
!   basic_ostream&lt;wchar_t,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;wchar_t,traits&gt;&amp;,
!                                             const wchar_t*);</ins>
! [&hellip;]
! }
! 
! </pre></blockquote>
! </li>
! 
! <li><p>Modify 27.7.3.6.4 [ostream.inserters.character] as indicated: <em>[Drafting note: 
! The replacement of <tt>os</tt> by <tt>out</tt> in p1 and the insertion of "<tt>out.</tt>" in p4 
! just fix two obvious typos &mdash; end drafting note]</em></p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp; out,
!                                           charT c);
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp; out,
!                                           char c);
! <i>// specialization</i>
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
!                                          char c);
! <ins>template&lt;class traits&gt;
!   basic_ostream&lt;wchar_t,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;wchar_t,traits&gt;&amp; out,
!                                             wchar_t c);</ins>
! 
! <i>// signed and unsigned</i>
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
!                                           signed char c);
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
!                                           unsigned char c);
! </pre><blockquote>
! <p>
! -1- <i>Effects:</i> Behaves as a formatted output function (27.7.3.6.1 [ostream.formatted.reqmts]) of <tt>out</tt>. 
! Constructs a character sequence <tt>seq</tt>. If <tt>c</tt> has type <tt>char</tt> and the character type of the stream 
! is not <tt>char</tt>, then <tt>seq</tt> consists of <tt>out.widen(c)</tt>; otherwise <tt>seq</tt> consists of <tt>c</tt>. 
! Determines padding for <tt>seq</tt> as described in 27.7.3.6.1 [ostream.formatted.reqmts]. Inserts <tt>seq</tt> into 
! <tt>out</tt>. Calls <tt><del>os</del><ins>out</ins>.width(0)</tt>.
! <p/>
! -2- <i>Returns:</i> <tt>out</tt>.
! </p>
  </blockquote>
+ <pre>
+ template&lt;class charT, class traits&gt;
+   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp; out,
+                                           const charT* s);
+ template&lt;class charT, class traits&gt;
+   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp; out,
+                                           const char* s);
+ template&lt;class traits&gt;
+   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
+                                          const char* s);
+ <ins>template&lt;class traits&gt;
+   basic_ostream&lt;wchar_t,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;wchar_t,traits&gt;&amp; out,
+                                             const wchar_t* s);</ins>
+ 											
+ template&lt;class traits&gt;
+   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
+                                          const signed char* s);
+ template&lt;class traits&gt;
+   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
+                                          const unsigned char* s);
+ </pre><blockquote>
+ <p>
+ -3- <i>Requires:</i> <tt>s</tt> shall not be a null pointer.
+ <p/>
+ -4- <i>Effects:</i> Behaves like a formatted inserter (as described in 27.7.3.6.1 [ostream.formatted.reqmts]) of <tt>out</tt>. 
+ Creates a character sequence <tt>seq</tt> of <tt>n</tt> characters starting at <tt>s</tt>, each widened using <tt>out.widen()</tt> 
+ (27.5.5.3), where <tt>n</tt> is the number that would be computed as if by:
+ </p>
+ <ul>
+ <li><p>
+ <tt>traits::length(s)</tt> for the <ins>following</ins> overload<ins>s:</ins>
+ <ul>
+ <li><p>
+ where the first argument is of type <tt>basic_ostream&lt;charT, traits&gt;&amp;</tt> 
+ and the second is of type <tt>const charT*</tt>,
+ </p></li>
+ <li><p>
+ <del>and also for the overload</del> where the first argument is of type 
+ <tt>basic_ostream&lt;char, traits&gt;&amp;</tt> and the second is of type <tt>const char*</tt>,
+ </p></li>
+ <li><p>
+ <ins>where the first argument is of type 
+ <tt>basic_ostream&lt;wchar_t, traits&gt;&amp;</tt> and the second is of type <tt>const wchar_t*</tt>,</ins>
+ </p></li>
+ </ul> 
+ </p></li>
+ <li><p>
+ <tt>std::char_traits&lt;char&gt;::length(s)</tt> for the overload where the first argument is of type
+ <tt>basic_ostream&lt;charT, traits&gt;&amp;</tt> and the second is of type <tt>const char*</tt>,
+ </p></li>
+ <li><p>
+ <tt>traits::length(reinterpret_cast&lt;const char*&gt;(s))</tt> for the other two overloads.
+ </p></li>
+ </ul>
+ <p>
+ Determines padding for <tt>seq</tt> as described in 27.7.3.6.1 [ostream.formatted.reqmts]. Inserts <tt>seq</tt> into 
+ <tt>out</tt>. Calls <tt><ins>out.</ins>width(0)</tt>.
+ <p/>
+ -5- <i>Returns:</i> <tt>out</tt>.
+ </p>
+ </blockquote></blockquote>
+ </li>
  
! </ol>
  
  
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2343"></a>2343. Is the value of the ECMA-262 RegExp object's multiline property really false?</h3>
+ <p><b>Section:</b> 28.13 [re.grammar] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Nayuta Taga <b>Opened:</b> 2013-10-30 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View all other</b> <a href="lwg-index.html#re.grammar">issues</a> in [re.grammar].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ In the following "Multiline" is the value of the ECMA-262 RegExp object's multiline property.
+ <p/>
+ In <a href="http://www.ecma-international.org/publications/files/ECMA-ST-ARCH/ECMA-262,%203rd%20edition,%20December%201999.pdf">ECMA-262</a>, 
+ there are some definitions that relate to Multiline:
+ </p>
+ <ul>
+ <li><p>
+ ECMA-262 15.10.2.6:
+ </p>
  <blockquote>
  <p>
! If Multiline is true, ^ matches just after LineTerminator.
! <p/>
! If Multiline is false, ^ does not match just after LineTerminator.
! <p/>
! If Multiline is true, $ matches just before LineTerminator.
! <p/>
! If Multiline is false, $ does not match just before LineTerminator.
! </p>
! </blockquote>
  </li>
! <li>
! <p>
! ECMA-262 15.10.4.1, 15.10.7.4:
! </p>
! <blockquote><p>
! By default, Multiline is false.
! </p></blockquote>
  </li>
  </ul>
! <p>
! So, the C++11 standard says that Multiline is false. As it is false,
! ^ matches only the beginning of the string, and $ matches only the end
! of the string.
! <p/>
! However, two flags are defined in 28.5.2 [re.matchflag] Table 139:
! </p>
! <blockquote>
! <p>
! <tt>match_not_bol</tt>: the character ^ in the regular expression shall not match <tt>[first,first)</tt>.
! <p/>
! <tt>match_not_eol</tt>: the character "$" in the regular expression shall not match <tt>[last,last)</tt>.
! </p>
  </blockquote>
+ <p>
+ As Multiline is false, the <tt>match_not_bol</tt> and the <tt>match_not_eol</tt> are
+ meaningless because they only make ^ and $ match none.
+ <p/>
+ In my opinion, Multiline should be true.
+ <p/>
+ FYI, Multiline of the existing implementations are as follows:
+ <p/>
+ <em>Multiline=false:</em>
+ </p>
+ <ul>
+ <li><p>
+ libstdc++ r206594
+ </p></li>
+ <li><p>
+ libc++ r199174
+ </p></li>
+ </ul>
+ <p>
+ <em>Multiline=true:</em>
+ </p>
+ <ul>
+ <li><p>
+ Visual Studio Express 2013
+ </p></li>
+ <li><p>
+ boost 1.55
+ </p></li>
+ </ul>
+ 
+ <p><i>[2015-05-22, Daniel comments]</i></p>
+ 
+ <p>
+ This issue interacts with LWG <a href="lwg-active.html#2503">2503</a>.
+ </p>
+ 
  
  
  <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2348"></a>2348. <tt>charT('1')</tt> is not the wide equivalent of <tt>'1'</tt></h3>
+ <p><b>Section:</b> 20.6 [template.bitset], 27.7.6 [quoted.manip] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Zhihao Yuan <b>Opened:</b> 2013-12-02 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Example: <tt>char16_t('1') != u'1'</tt> is possible.
+ <p/>
+ The numeric value of <tt>char16_t</tt> is defined to be Unicode
+ code point, which is same to the ASCII value and UTF-8 for
+ 7-bit chars.  However, <tt>char</tt> is not guaranteed to have an
+ encoding which is compatible with ASCII. For example, <tt>'1'</tt> in EBCDIC is 241.
+ <p/>
+ I found three places in the standard casting narrow char
+ literals: <tt>bitset::bitset</tt>, <tt>bitset::to_string</tt> and <tt>quoted</tt>.
+ <p/>
+ PJ confirmed this issue and says he has a solution used
+ in their <tt>&lt;filesystem&gt;</tt> implementation, and he may want to
+ propose it to the standard.
+ <p/>
+ The solution in my mind, for now, is to make those default
+ arguments magical, where the "magic" can be implemented
+ with a C11 <tt>_Generic</tt> selection (works in clang):
+ </p>
+ <blockquote><pre>
+ #define _G(T, literal) _Generic(T{}, \
+       char: literal, \
+       wchar_t: L ## literal, \
+       char16_t: u ## literal, \
+       char32_t: U ## literal)
+ 
+   _G(char16_t, '1') == u'1'
+ </pre></blockquote>
+ 
+ <p><i>[Lenexa 2015-05-05: Move to Open]</i></p>
+ 
+ <p>Ask for complete PR (need quoted, to string, et al.)</p>
+ <p>Will then take it up again</p>
+ <p>Expectation is that this is correct way to fix this</p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3797.</p>
+ 
+ [<i>Drafting note:</i> This is a sample wording fixing only one case;
+  I'm just too lazy to copy-paste it before we discussed whether
+  the solution is worth and sufficient (for example, should the
+  other `charT`s like `unsigned char` just don't compile without
+  supplying those arguments?  I hope so). &mdash; <i>end drafting note</i>]
+ 
  <ol>
! <li><p>Modify 20.6 [template.bitset] p1, class template <tt>bitset</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;size_t N&gt; class bitset {
!   public:
!     [&hellip;]
!     template&lt;class charT, class traits, class Allocator&gt;
!       explicit bitset(
!         const basic_string&lt;charT,traits,Allocator&gt;&amp; str,
!         typename basic_string&lt;charT,traits,Allocator&gt;::size_type pos = 0,
!         typename basic_string&lt;charT,traits,Allocator&gt;::size_type n =
!           basic_string&lt;charT,traits,Allocator&gt;::npos,
!           charT zero = <del>charT('0')</del><ins><em>see below</em></ins>, charT one = <del>charT('1')</del><ins><em>see below</em></ins>);
!      [&hellip;]
!   };
!   [&hellip;]
! }
  </pre></blockquote>
  </li>
! 
! <li><p>Modify 20.6.1 [bitset.cons] as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
! explicit 
! bitset(const basic_string&lt;charT, traits, Allocator&gt;&amp; str,
!        typename basic_string&lt;charT, traits, Allocator&gt;::size_type pos = 0,
!        typename basic_string&lt;charT, traits, Allocator&gt;::size_type n =
!          basic_string&lt;charT, traits, Allocator&gt;::npos,
!          charT zero = <del>charT('0')</del><ins><em>see below</em></ins>, charT one = <del>charT('1')</del><ins><em>see below</em></ins>);
! </pre><blockquote>
! <p>
! <ins>-?- The default values of <tt>zero</tt> and <tt>one</tt> compare equal to the
! character literals <tt>0</tt> and <tt>1</tt> of type <tt>charT</tt>, respectively.</ins>
! <p/>
! -3- <i>Requires::</i> <tt>pos &lt;= str.size()</tt>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
  </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2349"></a>2349. Clarify input/output function rethrow behavior</h3>
! <p><b>Section:</b> 27.7.2.2.1 [istream.formatted.reqmts] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Zhihao Yuan <b>Opened:</b> 2013-12-06 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.formatted.reqmts">issues</a> in [istream.formatted.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The formatted input function requirement says in 27.7.2.2.1 [istream.formatted.reqmts]:
! </p>
! <blockquote><p>
! "If an exception is thrown during input then <tt>ios::badbit</tt> is turned on
! in <tt>*this</tt>'s error state.  If <tt>(exceptions()&amp;badbit) != 0</tt> then the exception
! is rethrown."
! </p></blockquote>
! <p>
! while some formatted function may throw an exception from <tt>basic_ios::clear</tt>, for example
! in 20.6.4 [bitset.operators] p6:
! </p>
! <blockquote><p>
! "If no characters are stored in <tt>str</tt>, calls <tt>is.setstate(ios_base::failbit)</tt> (which may 
! throw <tt>ios_base::failure</tt>)"
! </p></blockquote>
! <p>
! So should this exception be considered as "an exception [...] thrown
! during input"?  And here is an implementation divergence (or you
! can read the following as "a bug libc++ only has" :)
! </p>
! <blockquote><pre>
! cin.exceptions(ios_base::failbit);
! bitset&lt;N&gt; b;
! try {
!   cin &gt;&gt; b;  // type 'a' and return
! } catch (...)
! {}
! </pre></blockquote>
! <p>
! Now <tt>cin.rdstate()</tt> is just <tt>failbit</tt> in libstdc++ (and Dinkumware, by
! PJ), but <tt>failbit &amp; badbit</tt> libc++. Similar difference found in other
! places, like <tt>eofbit &amp; badbid</tt> after <tt>std::getline</tt>.
! <p/>
! PJ and Matt both agree that the intention (of <tt>badbit</tt> + rethrow) is
! "to signify an exception arising in user code, not the iostreams package".
! <p/>
! In addition, I found the following words in unformatted input
! function's requirements (27.7.2.3 [istream.unformatted]):
! </p>
! <blockquote><p>
! If an exception is thrown during input then <tt>ios::badbit</tt> is turned on
! in <tt>*this</tt>'s error state. (Exceptions thrown from <tt>basic_ios&lt;&gt;::clear()</tt>
! are not caught or rethrown.)  If <tt>(exceptions()&amp;badbit) != 0</tt> then the
! exception is rethrown.
! </p></blockquote>
! <p>
! The content within the parenthesis is added by LWG defect <a href="lwg-defects.html#61">61</a>,
! and does fix the ambiguity. However, it only fixed the 1 of 4
! requirements, and it lost some context (the word "rethrown" is not
! seen before this sentence within this section).
! </p>
! 
! <p><i>[Lenexa 2015-05-07: Marshall to research and report]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! [<i>Drafting note:</i> The editor is kindly asked to introduce additional spaces at the following marked occurrences of
! <tt>operator&amp;</tt> &mdash; <i>end drafting note</i>]
! 
! <ol>
! <li><p>Modify 27.7.2.2.1 [istream.formatted.reqmts] p1 as indicated:</p>
! 
! <blockquote><p>
! -1- Each formatted input function begins execution by constructing an object of class <tt>sentry</tt> with the <tt>noskipws</tt>
! (second) argument false. If the <tt>sentry</tt> object returns true, when converted to a value of type <tt>bool</tt>, the
! function endeavors to obtain the requested input. If an exception<ins>, other than the ones thrown from <tt>clear()</tt>, if any,</ins> 
! is thrown during input then <tt>ios::badbit</tt>
! is turned on[Footnote 314] in <tt>*this</tt>'s error state. If <tt>(exceptions()<ins> </ins>&amp;<ins> </ins>badbit) != 0</tt> 
! then the exception is rethrown.
! In any case, the formatted input function destroys the <tt>sentry</tt> object. If no exception has been thrown, it returns <tt>*this</tt>.
! </p></blockquote>
! </li>
! 
! <li><p>Modify 27.7.3.6.1 [ostream.formatted.reqmts] p1 as indicated:</p>
! 
! <blockquote><p>
! -1- Each formatted output function begins execution by constructing an object of class <tt>sentry</tt>. If this object
! returns true when converted to a value of type <tt>bool</tt>, the function endeavors to generate the requested
! output. If the generation fails, then the formatted output function does <tt>setstate(ios_base::failbit)</tt>,
! which might throw an exception. If an exception<ins>, other than the ones thrown from <tt>clear()</tt>, if any,</ins> is thrown 
! during output, then <tt>ios::badbit</tt> is turned on[Footnote 327]
! in <tt>*this</tt>'s error state. If <tt>(exceptions()<ins> </ins>&amp;<ins> </ins>badbit) != 0</tt> then the exception is rethrown. 
! Whether or not
! an exception is thrown, the <tt>sentry</tt> object is destroyed before leaving the formatted output function. If no
! exception is thrown, the result of the formatted output function is <tt>*this</tt>.
! </p></blockquote>
! </li>
! 
! <li><p>Modify 27.7.3.7 [ostream.unformatted] p1 as indicated:</p>
! 
! <blockquote><p>
! -1- Each unformatted output function begins execution by constructing an object of class <tt>sentry</tt>. If this object
! returns true, while converting to a value of type <tt>bool</tt>, the function endeavors to generate the requested
! output. If an exception<ins>, other than the ones thrown from <tt>clear()</tt>, if any,</ins> is thrown during output, 
! then ios::badbit is turned on[Footnote 330] in <tt>*this</tt>'s error state.
! If <tt>(exceptions() &amp; badbit) != 0</tt> then the exception is rethrown. In any case, the unformatted output
! function ends by destroying the <tt>sentry</tt> object, then, if no exception was thrown, returning the value specified
! for the unformatted output function.
! </p></blockquote>
! </li>
! 
! <li><p>Modify 27.7.2.3 [istream.unformatted] p1 as indicated:</p>
! 
! <blockquote><p>
! -1- Each unformatted input function begins execution by constructing an object of class <tt>sentry</tt> with the default
! argument <tt>noskipws</tt> (second) argument true. If the <tt>sentry</tt> object returns true, when converted to a value
! of type <tt>bool</tt>, the function endeavors to obtain the requested input. Otherwise, if the <tt>sentry</tt> constructor exits
! by throwing an exception or if the sentry object returns false, when converted to a value of type <tt>bool</tt>, the
! function returns without attempting to obtain any input. In either case the number of extracted characters
! is set to <tt>0</tt>; unformatted input functions taking a character array of non-zero size as an argument shall also
! store a null character (using <tt>charT()</tt>) in the first location of the array. If an exception<ins>, other than the 
! ones thrown from <tt>clear()</tt>, if any,</ins> is thrown during input
! then <tt>ios::badbit</tt> is turned on[Footnote 317] in <tt>*this</tt>'s error state. <del>(Exceptions thrown from 
! <tt>basic_ios&lt;&gt;::clear()</tt> are not caught or rethrown.)</del> If <tt>(exceptions()<ins> </ins>&amp;<ins> </ins>badbit) != 0</tt> 
! then the exception is rethrown. It also counts the number of characters extracted. If no exception has been thrown it ends 
! by storing the count in a member object and returning the value specified. In any event the <tt>sentry</tt> object is destroyed 
! before leaving the unformatted input function.
! </p></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2352"></a>2352. Is a default-constructed <tt>std::seed_seq</tt> intended to produce a predictable <tt>.generate()</tt>?</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2013-12-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! With respect to class <tt>seed_seq</tt> 26.5.7.1 [rand.util.seedseq], is a default-constructed 
! <tt>std::seed_seq</tt> intended to produce a predictable <tt>.generate()</tt> sequence?
! <p/>
! Implementations differ.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2353"></a>2353. <tt>std::next</tt> is over-constrained</h3>
! <p><b>Section:</b> 24.4.4 [iterator.operations] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2013-12-24 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.operations">issues</a> in [iterator.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In LWG <a href="lwg-defects.html#1011">1011</a>, <tt>std::next</tt> and <tt>std::prev</tt> were changed 
! from accepting <tt>InputIterator</tt> to accepting
! <tt>ForwardIterator</tt>. This needlessly excludes perfectly legitimate use
! cases. Consider the following hypothetical range-based implementation of
! drop, which creates a view of a range without the first <tt>n</tt> elements:
! </p>
! <blockquote><pre>
! template&lt;typename Distance, typename InputRange&gt;
! iterator_range&lt;range_iterator_t&lt;InputRange&gt;&gt;
! drop(Distance n, InputRange&amp; rng)
! {
!   return make_iterator_range(
!     std::next(std::begin(rng), n),
!     std::end(rng)
!   );
! }
! </pre></blockquote>
! <p>
! I believe this to be a legitimate use case that is currently outlawed by
! the standard without cause. See the discussion beginning at
! <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=35313">c++std-lib-35313</a> 
! for an in-depth discussion of the issue, in which
! Howard Hinnant agreed that it was a defect.
! <p/>
! (Some discussion then ensued about whether an overload should be added
! that only accepts rvalue <tt>InputIterators</tt> to avoid the surprise that issue
! <a href="lwg-defects.html#1011">1011</a> sought to address. I make no such attempt, nor do I believe it to
! be necessary.)
! <p/>
! Suggested resolution:
! <p/>
! Back out the resolution of <a href="lwg-defects.html#1011">1011</a>.
! </p>
! 
! <p><i>[Lenexa 2015-05-07: Move to Ready]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Change 24.3 [iterator.synopsis], header <tt>&lt;iterator&gt;</tt> synopsis, and 24.4.4 [iterator.operations]
! before p.6 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class <del>Forward</del><ins>Input</ins>Iterator&gt;
!   <del>Forward</del><ins>Input</ins>Iterator next(<del>Forward</del><ins>Input</ins>Iterator x,
!     typename std::iterator_traits&lt;<del>Forward</del><ins>Input</ins>Iterator&gt;::difference_type n = 1);
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2358"></a>2358. Apparently-bogus definition of <tt>is_empty</tt> type trait</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-02-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The 'Condition' for <tt>std::is_empty</tt> is listed as:
! </p>
! <blockquote><p>
! "<tt>T</tt> is a class type, but not a union type, with no non-static data members other than bit-fields of length 0, 
! no virtual member functions, no virtual base classes, and no base class <tt>B</tt> for which <tt>is_empty&lt;B&gt;::value</tt> 
! is false."
! </p></blockquote>
! <p>
! This is incorrect: there is no such thing as a non-static data member that is a bit-field of length 0, since bit-fields of 
! length 0 must be unnamed, and unnamed bit-fields are not members (see 9.6 [class.bit] p2).
! <p/>
! It also means that classes such as:
! </p>
! <blockquote><pre>
! struct S {
!  int : 3;
! };
! </pre></blockquote>
! <p>
! are empty (because they have no non-static data members). There's implementation divergence on the value of 
! <tt>is_empty&lt;S&gt;::value</tt>.
! <p/>
! I'm not sure what the purpose of <tt>is_empty</tt> is (or how it could be useful), but if it's desirable for the above type to 
! not be treated as empty, something like this could work:
! </p>
! <blockquote><p>
! "<tt>T</tt> is a class type, but not a union type, with no non-static data members <del>other than</del><ins>, no unnamed</ins> 
! bit-fields of <ins>non-zero</ins> length <del>0</del>, no virtual member functions, no virtual base classes, and no base class 
! <tt>B</tt> for which <tt>is_empty&lt;B&gt;::value</tt> is false."
! </p></blockquote>
! <p>
! and if the above type <em>should</em> be treated as empty, then this might be appropriate:
! </p>
! <blockquote><p>
! "<tt>T</tt> is a class type, but not a union type, with no <ins>(named)</ins> non-static data members <del>other than bit-fields of 
! length 0</del>, no virtual member functions, no virtual base classes, and no base class <tt>B</tt> for which 
! <tt>is_empty&lt;B&gt;::value</tt> is false."
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2362"></a>2362. unique, associative <tt>emplace()</tt> should not move/copy the <tt>mapped_type</tt> constructor arguments when no insertion happens</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2014-02-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>a_uniq.emplace(args)</tt> is specified as:
! </p>
! 
! <blockquote><p>
! <i>Effects</i>: Inserts a value_type object <tt>t</tt> constructed with<br/>
! <tt>std::forward&lt;Args&gt;(args)...</tt> if and only if there is no element in the<br/>
! container with key equivalent to the key of <tt>t</tt>. The <tt>bool</tt> component of<br/>
! the returned pair is true if and only if the insertion takes place,<br/>
! and the iterator component of the pair points to the element with key<br/>
! equivalent to the key of <tt>t</tt>. 
! </p></blockquote>
! 
! <p>
! However, we occasionally find code of the form:
! </p>
! 
! <blockquote><pre>
! std::unique_ptr&lt;Foo&gt; p(new Foo);
! auto res = m.emplace("foo", std::move(p));
! </pre></blockquote>
! 
! <p>
! where we'd like to avoid destroying the <tt>Foo</tt> if the insertion doesn't
! take place (if the container already had an element with the specified key).
! <p/>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3873">N3873</a> includes
! a partial solution to this in the form of a new <tt>emplace_stable</tt> member function, but LEWG's 
! discussion strongly agreed that we'd rather have <tt>emplace()</tt> Just Work:
! <p/>
! Should <tt>map::emplace()</tt> be guaranteed not to move/copy its arguments if the insertion doesn't happen?
! <p/>
! SF: 8 F: 3 N: 0 A: 0 SA: 0
! <p/>
! This poll was marred by the fact that we didn't notice or call out
! that <tt>emplace()</tt> must construct the key before doing the lookup, and it
! must not then move the key after it determines whether an insert is
! going to happen, and the <tt>mapped_type</tt> instance must live next to the key.
! <p/>
! The very similar issue <a href="lwg-closed.html#2006">2006</a> was previously marked NAD, with
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3178.htm">N3178</a> as
! discussion. However, given LEWG's interest in the alternate behavior,
! we should reopen the question in this issue.
! <p/>
! We will need a paper that describes how to implement this before we can make more progress.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2363"></a>2363. Defect in 30.4.1.4.1 [thread.sharedtimedmutex.class]</h3>
! <p><b>Section:</b> 30.4.1.5.1 [thread.sharedtimedmutex.class] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-02-16 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 30.4.1.5.1 [thread.sharedtimedmutex.class] paragraph 2: 
! </p>
! <blockquote><p> The class <tt>shared_timed_mutex</tt> shall satisfy all of the 
! <tt>SharedTimedMutex</tt> requirements (30.4.1.4). It shall be a standard layout class (Clause 9).
! </p></blockquote> 
! <p>
! There's no <tt>SharedTimedMutex</tt> requirements; this name doesn't appear anywhere else in the standard. (Prior to N3891, 
! this was <tt>SharedMutex</tt>, which was equally undefined.)
! <p/>
! I assume this concept should be defined somewhere?
! <p/>
! Also, n3891 changes 30.4.1.5 [thread.sharedtimedmutex.requirements] from defining "shared mutex type" to defining 
! "shared timed mutex type", but its paragraph 2 still talks about "shared mutex type". Is that OK? I think you could argue 
! that it's clear enough what it means, but presumably it should use the term that paragraph 1 defined.
! <p/>
! 30.4.2.3 [thread.lock.shared] paragraph 1 talks about the "shared mutex requirements", which again is a term that isn't 
! defined, and presumably means "the requirements on a shared timed mutex type" or similar (maybe if <tt>SharedMutex</tt> or 
! <tt>SharedTimedMutex</tt> were defined it could be reused here).
! </p>
! 
! <p><i>[2014-05-22, Daniel comments]</i></p>
! 
! <p>
! As for <tt>SharedTimedMutex</tt>, there exists a similar problem in regard to <tt>TimedMutex</tt> referred to in
! 30.4.1.3.1 [thread.timedmutex.class] p2 and in 30.4.1.3.2 [thread.timedmutex.recursive] p2, but nowhere defined.
! <p/>
! Another problem is, that according to 30.4.1.2.1 [thread.mutex.class] p3, "The class <tt>mutex</tt> shall satisfy all the 
! <tt>Mutex</tt> requirements (30.4.1 [thread.mutex.requirements]).", but there are no concrete <tt>Mutex</tt> requirements,
! 30.4.1 [thread.mutex.requirements] &mdash; titled as "Mutex requirements" &mdash; describes <em>mutex types</em>,
! <em>timed mutex types</em>, and <em>shared timed mutex types</em>.
! </p>
! 
! <p><i>[2014-06-08, Daniel comments and provides wording]</i></p>
! 
! <p>
! The presented wording adds to the existing <em>mutex types</em>, <em>timed mutex types</em>, and <em>shared timed mutex types</em> 
! terms a new set of corresponding <tt>MutexType</tt>, <tt>TimedMutexType</tt>, and <tt>SharedTimedMutexType</tt> requirements. 
! <p/>
! The reason for the change of requirement names is two-fold: First, the new name better matches the intention to have a concrete 
! name for the requirements imposed on the corresponding <em>mutex types</em> (This kind of requirement deviate from the more general
! <tt>Lockable</tt> requirements, which are not restricted to a explicitly enumerated set of library types). Second, using 
! <tt>**MutexType</tt> over <tt>**Mutex</tt> provides the additional advantage that it reduces the chances of confusing named 
! requirements from template parameters named <tt>Mutex</tt> (such as for <tt>unique_lock</tt> or <tt>shared_lock</tt>).
! <p/>
! Nonetheless the here presented wording has one unfortunate side-effect: Once applied it would have the effect that types
! used to instantiate <tt>std::shared_lock</tt> cannot be user-defined shared mutex types due to 30.4.2.3 [thread.lock.shared]. 
! The reason is based on the currently lack of an existing <tt>SharedLockable</tt> requirement set, which would complete the 
! existing <tt>BasicLockable</tt> and <tt>Lockable</tt> requirements (which are "real" requirements). This restriction is not
! actually a problem introduced by the provided resolution but instead one that existed before but becomes more obvious now.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! Thanks to Daniel, and please put it in SG1-OK status.  Perhaps open another issue for the remaining problem Daniel points out?
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 30.4.1.2 [thread.mutex.requirements.mutex] as indicated:</p>
! 
! <blockquote><p>
! -1- The <em>mutex types</em> are the standard library types <tt>std::mutex</tt>, <tt>std::recursive_mutex</tt>, <tt>std::timed_mutex</tt>,
! <tt>std::recursive_timed_mutex</tt>, and <tt>std::shared_timed_mutex</tt>. They shall meet the <ins><tt><em>MutexType</em></tt></ins> 
! requirements set out in this section. In this description, <tt>m</tt> denotes an object of a mutex type.
! </p></blockquote>
! </li>
! 
! <li><p>Change 30.4.1.2.1 [thread.mutex.class] as indicated:</p>
! 
! <blockquote><p>
! -3- The class <tt>mutex</tt> shall satisfy all the <tt>Mutex<ins>Type</ins></tt> requirements 
! (<ins>30.4.1.2 [thread.mutex.requirements.mutex]</ins><del>30.4.1 [thread.mutex.requirements]</del>). 
! It shall be a standard-layout class (Clause 9).
! </p></blockquote>
! </li>
! 
! <li><p>Change 30.4.1.2.2 [thread.mutex.recursive] as indicated:</p>
! 
! <blockquote><p>
! -2- The class <tt>recursive_mutex</tt> shall satisfy all the <del>Mutex</del><ins><tt>MutexType</tt></ins> requirements 
! (<ins>30.4.1.2 [thread.mutex.requirements.mutex]</ins><del>30.4.1 [thread.mutex.requirements]</del>). 
! It shall be a standard-layout class (Clause 9).
! </p></blockquote>
! </li>
! 
! <li><p>Change 30.4.1.3 [thread.timedmutex.requirements] as indicated:</p>
! 
! <blockquote><p>
! -1- The <em>timed mutex types</em> are the standard library types <tt>std::timed_mutex</tt>, <tt>std::recursive_timed_mutex</tt>,
! and <tt>std::shared_timed_mutex</tt>. They shall meet the <ins><tt><em>TimedMutexType</em></tt></ins> requirements set out below. 
! In this description, <tt>m</tt> denotes an object of a mutex type, <tt>rel_time</tt> denotes an object of an instantiation of 
! <tt>duration</tt> (20.12.5), and <tt>abs_time</tt> denotes an object of an instantiation of <tt>time_point</tt> (20.12.6).
! </p></blockquote>
! </li>
! 
! <li><p>Change 30.4.1.3.1 [thread.timedmutex.class] as indicated:</p>
! 
! <blockquote><p>
! -2- The class <tt>timed_mutex</tt> shall satisfy all of the <tt>TimedMutex<ins>Type</ins></tt> requirements 
! (30.4.1.3 [thread.timedmutex.requirements]). It shall be a standard-layout class (Clause 9).
! </p></blockquote>
! </li>
! 
! <li><p>Change 30.4.1.3.2 [thread.timedmutex.recursive] as indicated:</p>
! 
! <blockquote><p>
! -2- The class <tt>recursive_timed_mutex</tt> shall satisfy all of the <tt>TimedMutex<ins>Type</ins></tt> requirements 
! (30.4.1.3 [thread.timedmutex.requirements]). It shall be a standard-layout class (Clause 9).
! </p></blockquote>
! </li>
! 
! <li><p>Change 30.4.1.5 [thread.sharedtimedmutex.requirements] as indicated: [<i>Drafting note</i>: The reference to the
! timed mutex types requirements has been moved <em>after</em> introducing the new requirement set to ensure that 
! <tt>SharedTimedMutexType</tt> <em>refine</em> <tt>TimedMutexType</tt>.]</p>
! 
  <blockquote>
! <p>
! -1- The standard library type <tt>std::shared_timed_mutex</tt> is a <em>shared timed mutex type</em>. Shared timed mutex
! types shall meet the <ins><tt><em>SharedTimedMutexType</em></tt></ins> requirements <del>of timed mutex types 
! (30.4.1.3 [thread.timedmutex.requirements]), and additionally shall meet the requirements</del> set out below. In this 
! description, <tt>m</tt> denotes an object of a mutex type, <tt>rel_type</tt> denotes
! an object of an instantiation of <tt>duration</tt> (20.12.5), and <tt>abs_time</tt> denotes an object of an instantiation of
! <tt>time_point</tt> (20.12.6).
! <p/>
! <ins>-?- The shared timed mutex types shall meet the <tt>TimedMutexType</tt> requirements (30.4.1.3 [thread.timedmutex.requirements]).</ins>
! </p>
  </blockquote>
! </li>
! 
! <li><p>Change 30.4.1.5.1 [thread.sharedtimedmutex.class] as indicated:</p>
! 
! <blockquote><p>
! -2- The class <tt>shared_timed_mutex</tt> shall satisfy all of the <tt>SharedTimedMutex<ins>Type</ins></tt> requirements 
! (30.4.1.5 [thread.sharedtimedmutex.requirements]). It shall be a standard-layout class (Clause 9).
! </p></blockquote>
! </li>
! 
! <li><p>Change 30.4.2.3 [thread.lock.shared] as indicated: [<i>Drafting note</i>: Once 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3995.htm">N3995</a> has been applied, the following 
! reference should be changed to the new <tt>SharedMutexType</tt> requirements ([thread.sharedmutex.requirements]) or 
! even better to some new <tt>SharedLockable</tt> requirements (to be defined) &mdash; <i>end drafting note</i>]</p>
! 
! <blockquote><p>
! -1- [&hellip;] The supplied <tt>Mutex</tt> type shall meet the <del>shared mutex</del><ins><tt>SharedTimedMutexType</tt></ins> requirements 
! (30.4.1.5 [thread.sharedtimedmutex.requirements]).
! <p/>
! -2- [<i>Note</i>: <tt>shared_lock&lt;Mutex&gt;</tt> meets the <tt>TimedLockable</tt> requirements 
! (30.2.5.4). &mdash; <i>end note</i>]
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2366"></a>2366. <tt>istreambuf_iterator</tt> end-of-stream equality</h3>
! <p><b>Section:</b> 24.6.3 [istreambuf.iterator] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Hyman Rosen <b>Opened:</b> 2014-02-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istreambuf.iterator">issues</a> in [istreambuf.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Given the following code,
! </p>
! <blockquote><pre>
! #include &lt;sstream&gt;
! 
! std::stringbuf buf;
! std::istreambuf_iterator&lt;char&gt; begin(&amp;buf);
! std::istreambuf_iterator&lt;char&gt; end;
! </pre></blockquote>
! <p>
! it is not clear from the wording of the Standard whether <tt>begin.equal(end)</tt>
! must be true. In at least one implementation it is not (CC: Sun C++ 5.10 SunOS_sparc Patch 128228-25 2013/02/20) and in at least
! one implementation it is (gcc version 4.3.2 x86_64-unknown-linux-gnu).
! <p/>
! 24.6.3 [istreambuf.iterator] says that <tt>end</tt> is an end-of-stream iterator since it was default
! constructed. It also says that an iterator becomes equal to an end-of-stream
! iterator when end of stream is reached by <tt>sgetc()</tt> having returned <tt>eof()</tt>.
! 24.6.3.5 [istreambuf.iterator::equal] says that <tt>equal()</tt> returns true iff both iterators are end of stream
! or not end of stream. But there seems to be no requirement that <tt>equal</tt> check for end-of-stream by calling <tt>sgetc()</tt>. 
! <p/>
! Jiahan Zi at BloombergLP discovered this issue through his code failing to
! work correctly. Dietmar K&uuml;hl has opined in a private communication that
! the iterators should compare equal.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2367"></a>2367. <tt>pair</tt> and <tt>tuple</tt> are not correctly implemented for <tt>is_constructible</tt> with no args</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2014-02-19 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Consider:
! </p>
! <blockquote><pre>
! struct X
! {
!   X() = delete;
! };
! 
! int main()
! {
!   typedef std::pair&lt;int, X&gt; P;
!   static_assert(!std::is_constructible&lt;P&gt;::value, "");
!   static_assert(!std::is_default_constructible&lt;P&gt;::value, "");
!   typedef std::tuple&lt;int, X&gt; T;
!   static_assert(!std::is_constructible&lt;T&gt;::value, "");
!   static_assert(!std::is_default_constructible&lt;T&gt;::value, "");
! }
! </pre></blockquote>
! <p>
! For me these <tt>static_asserts</tt> fail. And worse than that, even asking the question fails (as opposed to gets the wrong answer):
! </p>
! <blockquote><pre>
! assert(!std::is_constructible&lt;P&gt;::value);
! </pre></blockquote>
! <p>
! In file included from test.cpp:2:
! </p>
! <blockquote><pre>
! error:
!       call to deleted constructor of 'X'
!    pair() : first(), second() {}
!                      ^
! note: function has been explicitly marked deleted here
!     X() = delete;
!     ^
! 1 error generated.
  </pre></blockquote>
+ <p>
+ This can be solved by specializing <tt>is_constructible</tt> on <tt>pair</tt> and <tt>tuple</tt> for zero Args:
+ </p>
+ <blockquote><pre>
+ template &lt;class T, class U&gt;
+ struct is_constructible&lt;pair&lt;T, U&gt;&gt;
+   : integral_constant&lt;bool, is_default_constructible&lt;T&gt;::value &amp;&amp;
+                             is_default_constructible&lt;U&gt;::value&gt;
+ {};
+ 
+ template &lt;class ...T&gt;
+ struct is_constructible&lt;tuple&lt;T...&gt;&gt;
+   : integral_constant&lt;bool,
+                       __all&lt;is_default_constructible&lt;T&gt;::value...&gt;::value&gt;
+ {};
+ </pre></blockquote>
+ <p>
+ Now everything just works.
+ </p>
+ 
+ <p><i>[2014-05-14, Daniel comments]</i></p>
+ 
+ 
+ <p>
+ The proposed resolution is incomplete, because it wouldn't work for <i>cv</i>-qualified objects of
+ <tt>pair</tt> or for references of them during reference-initialization.
+ <p/>
+ I would like to point out that the approach suggested in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3739.html">N3739</a>
+ can be easily extended to solve the problem without need to muddle with specializing <tt>is_constructible</tt>:
+ </p>
+ <blockquote><pre>
+ template&lt;class U1 = T1, class U2 = T2,
+   typename enable_if&lt;
+     is_default_constructible&lt;U1&gt;::value &amp;&amp; is_default_constructible&lt;U2&gt;::value
+   , bool&gt;::type = false
+ &gt;
+ constexpr pair();
+ </pre></blockquote>
+ <p>
+ The new wording proposal represents an alternative wording change that I would strongly prefer.
+ </p>
+ 
+ <strong>Previous resolution from Howard [SUPERSEDED]:</strong>
+ <p/>
+ <blockquote class="note">
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Add to 20.3.3 [pairs.spec]:</p>
+ 
  <blockquote>
! <pre>
! <ins>template &lt;class T, class U&gt;
! struct is_constructible&lt;pair&lt;T, U&gt;&gt;
!   : integral_constant&lt;bool, is_default_constructible&lt;T&gt;::value &amp;&amp;
!                             is_default_constructible&lt;U&gt;::value&gt;
! {};</ins>
! </pre>
! </blockquote>
  </li>
! 
! <li><p>Add to 20.4.2.9 [tuple.special]:</p>
! 
! <blockquote>
! <pre>
! <ins>template &lt;class ...T&gt;
! struct is_constructible&lt;tuple&lt;T...&gt;&gt;
!   : integral_constant&lt;bool, <i>see below</i>&gt;
! {};</ins>
! </pre>
! <blockquote><p>
! <ins>-?- The second argument to <tt>integral_constant</tt> shall be true if for each <tt>T</tt>, 
! <tt>is_default_constructible&lt;T&gt;::value</tt> is true.</ins>
! </p>
! </blockquote>
! </blockquote>
  </li>
! </ol>
  </blockquote>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
+ <p>
+ STL: I object to this resolution due to British spelling of behavior<br/>
+ JW: we already have other places of this spelling<br/>
+ VV: the easy resolution is to remove the notes<br/>
+ MC: if that's all we want to change: put it in and make the editorial change of removing the note<br/>
+ VV: the other paper doesn't make any of these changes so it would be consistent<br/>
+ JW: this make me want even more the features of having constructors doing the Right Thing
+ - I haven't written up the request to do something like that<br/>
+ VV: so it would be an aggregate reflecting the properties of the constituting types<br/>
+ JW: I should write that up<br/>
+ MC: any objection to move to ready? in favor: 16, opposed: 0, abstain: 1 
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Change 20.3.2 [pairs.pair] around p3 as indicated:</p>
+ 
+ <blockquote><pre>
+ constexpr pair();
+ </pre>
  <blockquote>
! <p>
! <del>-3- <i>Requires</i>: <tt>is_default_constructible&lt;first_type&gt;::value</tt> is true and 
! <tt>is_default_constructible&lt;second_type&gt;::value</tt> is true.</del>
! <p/>
! -4- <i>Effects</i>: Value-initializes first and second.
! <p/>
! <ins>-?- <i>Remarks</i>: This constructor shall not participate in overload resolution unless 
! <tt>is_default_constructible&lt;first_type&gt;::value</tt> is true and 
! <tt>is_default_constructible&lt;second_type&gt;::value</tt> is true. [<i>Note</i>: This behaviour can be implemented
! by a constructor template with default template arguments &mdash; <i>end note</i>].</ins>
! </p>
  </blockquote>
+ </blockquote>
+ </li>
+ 
+ <li><p>Change 20.4.2.1 [tuple.cnstr] around p4 as indicated:</p>
  
+ <blockquote><pre>
+ constexpr tuple();
+ </pre>
  <blockquote>
! <p>
! <del>-4- <i>Requires</i>: <tt>is_default_constructible&lt;<i>T<sub>i</sub></i>&gt;::value</tt> is true for all <i>i</i>.</del>
! <p/>
! -5- <i>Effects</i>: Value initializes each element.
! <p/>
! <ins>-?- <i>Remarks</i>: This constructor shall not participate in overload resolution unless 
! <tt>is_default_constructible&lt;<i>T<sub>i</sub></i>&gt;::value</tt> is true for all <i>i</i>. [<i>Note</i>: This behaviour can 
! be implemented by a constructor template with default template arguments &mdash; <i>end note</i>].</ins>
! </p>
  </blockquote>
  </blockquote>
  </li>
! </ol>
  
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2368"></a>2368. Replacing global <tt>operator new</tt></h3>
! <p><b>Section:</b> 18.6.1 [new.delete] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Stephen Clamage <b>Opened:</b> 2014-02-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete">issues</a> in [new.delete].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Section 18.6.1 [new.delete] and subsections shows:
! </p>
! <blockquote><pre>
! void* operator new(std::size_t size);
! void* operator new[](std::size_t size);
  </pre></blockquote>
! <p>
! That is, without exception-specifications. (Recall that C++03 specified these functions with <tt>throw(std::bad_alloc)</tt>.)
! <p/>
! Section 17.6.5.12 [res.on.exception.handling] the end of paragraph 4 says:
! </p>
! <blockquote><p>
! Any other functions defined in the C++ standard library that do not have an exception-specification may throw implementation-defined 
! exceptions unless otherwise specified. An implementation may strengthen this implicit exception-specification by adding an explicit one.
! </p></blockquote>
! <p>
! For example, an implementation could provide C++03-compatible declarations of <tt>operator new</tt>.
! <p/>
! Programmers are allowed to replace these <tt>operator new</tt> functions. But how can you write the definition of these functions when 
! the exception specification can vary among implementations? For example, the declarations
! </p>
! <blockquote><pre>
! void* operator new(std::size_t size) throw(std::bad_alloc);
! void* operator new(std::size_t size);
! </pre></blockquote>
! <p>
! are not compatible.
! <p/>
! From what I have been able to determine, gcc has a hack for the special case of <tt>operator new</tt> to ignore the differences in 
! (at least) the two cases I show above. But can users expect all compilers to quietly ignore the incompatibility?
! <p/>
! The blanket permission to add any explicit exception specification could cause a problem for any user-overridable function. 
! Different implementations could provide incompatible specifications, making portable code impossible to write.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2370"></a>2370. Operations involving type-erased allocators should not be <tt>noexcept</tt> in <tt>std::function</tt></h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2014-02-27 <b>Last modified:</b> 2015-05-05</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The following constructors in 20.9.12.2 [func.wrap.func] are declared <tt>noexcept</tt>, even
! though it is not possible for an implementation to guarantee that they will not throw:
! </p>
! 
! <blockquote><pre>
! template &lt;class A&gt; function(allocator_arg_t, const A&amp;) noexcept;
! template &lt;class A&gt; function(allocator_arg_t, const A&amp;, nullptr_t) noexcept;
! </pre></blockquote>
! 
! <p>
! In addition, the following functions are guaranteed not to throw if the target
! is a function pointer or a <tt>reference_wrapper</tt>:
! </p>
! 
! <blockquote><pre>
! template &lt;class A&gt; function(allocator_arg_t, const A&amp; a, const function&amp; f);
! template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
! </pre></blockquote>
! 
! <p>
! In all of the above cases, the function object might need to allocate memory
! (an operation that can throw) in order to hold a copy of the type-erased
! allocator itself. The first two constructors produce an empty function
! object, but the allocator is still needed in case the object is later assigned
! to. In this case, we note that the propagation of allocators on assignment is
! underspecified for <tt>std::function</tt>. There are three possibilities:
! </p>
! 
! <ol>
! <li><p>The allocator is never copied on copy-assignment, moved on move-assignment, or swapped on swap.</p>
  </li>
! 
! <li><p>The allocator is always copied on copy-assignment, moved on move-assignment, and swapped on swap.</p>
  </li>
! 
! <li><p>Whether or not the allocator is copied, moved, or swapped is determined at
!    run-time based on the <tt>propagate_on_container_copy_assignment</tt> and
!    <tt>propagate_on_container_move_assignment</tt> traits of the allocators at
!    construction of the source function, the target function, or both.</p>
! </li>
! </ol>
! 
! <p>
! Although the third option seems to be the most consistent with existing
! wording in the containers section of the standard, it is problematic in a
! number of respects. To begin with, the propagation behavior is determined at
! run time based on a pair of type-erased allocators, instead of at compile
! time. Such run-time logic is <em>not</em> consistent with the rest of the standard
! and is hard to reason about. Additionally, there are two allocator types
! involved, rather than one. Any set of rules that attempts to rationally
! interpret the propagation traits of both allocators is likely to be arcane
! at best, and subtly wrong for some set of codes at worst.
! </p>
! 
! <p>
! The second option is a non-starter. Historically, and in the vast majority of
! existing code, an allocator does not change after an object is constructed.
! The second option, if adopted, would undermine the programmer's ability to
! construct, e.g., an array of function objects, all using the same allocator.
! </p>
! 
! <p>
! The first option is (in Pablo's opinion) the simplest and best. It is
! consistent with historical use of allocators, is easy to understand, and
! requires minimal wording. It is also consistent with the wording in N3916,
! which formalizes type-erased allocators.
! </p>
! 
! <p>
! For cross-referencing purposes: The resolution of this issue should be
! harmonized with any resolution to LWG <a href="lwg-active.html#2062">2062</a>, which questions the <tt>noexcept</tt>
! specification on the following member functions of std::function:
! </p>
! 
! <blockquote><pre>
! template &lt;class F&gt; function&amp; operator=(reference_wrapper&lt;F&gt;) noexcept;
! void swap(function&amp;) noexcept;
! </pre></blockquote>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! MC: change to P3 and status to open.
! <p/>
! STL: note that <tt>noexcept</tt> is an issue and large chunks of allocator should be destroyed.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.9.12.2 [func.wrap.func], class template <tt>function</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class A&gt; function(allocator_arg_t, const A&amp;) <del>noexcept</del>;
! template &lt;class A&gt; function(allocator_arg_t, const A&amp;, nullptr_t) <del>noexcept</del>;
! </pre></blockquote>
! </li>
! 
! <li><p>Change 20.9.12.2.1 [func.wrap.func.con] as indicated:</p>
! 
  <blockquote>
! <p>
! -1- When any function constructor that takes a first argument of type <tt>allocator_arg_t</tt> is invoked, the second
! argument shall have a type that conforms to the requirements for <tt>Allocator</tt> (Table 17.6.3.5). A copy of the
! allocator argument is used to allocate memory, if necessary, for the internal data structures of the constructed
! function object. <ins> For the remaining constructors, an instance of <tt>allocator&lt;T&gt;</tt>, for some suitable type
! <tt>T</tt>, is used to allocate memory, if necessary, for the internal data structures of the constructed function object.</ins>
! </p>
! 
! <pre>
! function() noexcept;
! template &lt;class A&gt; function(allocator_arg_t, const A&amp;) <del>noexcept</del>;
! </pre>
! 
! <blockquote>
! <p>
! -2- <i>Postconditions</i>: <tt>!*this</tt>.
! </p>
  </blockquote>
! 
! <pre>
! function(nullptr_t) noexcept;
! template &lt;class A&gt; function(allocator_arg_t, const A&amp;, nullptr_t) <del>noexcept</del>;
! </pre>
! 
! <blockquote><p>
! -3- <i>Postconditions</i>: <tt>!*this</tt>.
! </p></blockquote>
! 
! <pre>
! function(const function&amp; f);
! <del>template &lt;class A&gt; function(allocator_arg_t, const A&amp; a, const function&amp; f);</del>
! </pre>
! 
! <blockquote><p>
! -4- <i>Postconditions</i>: <tt>!*this</tt> if <tt>!f</tt>; otherwise, <tt>*this</tt> targets a copy of <tt>f.target()</tt>.
! </p>
! 
! <p>
! -5- <i>Throws</i>: shall not throw exceptions if <tt>f</tt>'s target is a callable object passed
! via <tt>reference_wrapper</tt> or a function pointer. Otherwise, may throw <tt>bad_alloc</tt>
! or any exception thrown by the copy constructor of the stored callable
! object. [<i>Note</i>: Implementations are encouraged to avoid the use of
! dynamically allocated memory for small callable objects, for example, where
! <tt>f</tt>'s target is an object holding only a pointer or reference to an object and
! a member function pointer. &mdash; <i>end note</i>]
! </p></blockquote>
! 
! <pre>
! <ins>template &lt;class A&gt; function(allocator_arg_t, const A&amp; a, const function&amp; f);</ins>
! </pre>
! 
! <blockquote><p>
! <ins>-?- <i>Postconditions</i>: <tt>!*this</tt> if <tt>!f</tt>; otherwise, <tt>*this</tt> targets a copy of <tt>f.target()</tt>.</ins>
! </p></blockquote>
! 
! <pre>
! function(function&amp;&amp; f);
! template &lt;class A&gt; function(allocator_arg_t, const A&amp; a, function&amp;&amp; f);
! </pre>
! 
! <blockquote><p>
! -6- <i>Effects</i>: If <tt>!f</tt>, <tt>*this</tt> has no target; otherwise, move-constructs the target
! of <tt>f</tt> into the target of <tt>*this</tt>, leaving <tt>f</tt> in a valid state with an
! unspecified value. <ins>If an allocator is not specified, the constructed function will use the same allocator as <tt>f</tt>.</ins>
! </p></blockquote>
! 
! <pre>
! template&lt;class F&gt; function(F f);
! template &lt;class F, class A> function(allocator_arg_t, const A&amp; a, F f);
! </pre>
! 
  <blockquote>
! <p>
! -7- <i>Requires</i>: <tt>F</tt> shall be <tt>CopyConstructible</tt>. 
! <p/>
! -8- <i>Remarks</i>: These constructors shall not participate in overload resolution unless <tt>f</tt> is Callable (20.9.11.2)
! for argument types <tt>ArgTypes...</tt> and return type <tt>R</tt>.
! </p>
! 
! <p>
! -9- <i>Postconditions</i>: <tt>!*this</tt> if any of the following hold:
! </p>
  <ul>
! <li><p><tt>f</tt> is a null function pointer value.</p></li>
! <li><p><tt>f</tt> is a null member pointer value.</p></li>
! <li><p><tt>F</tt> is an instance of the function class template, and <tt>!f</tt></p></li>
  </ul>
+ 
+ <p>
+ -10- Otherwise, <tt>*this</tt> targets a copy of <tt>f</tt> initialized with <tt>std::move(f)</tt>.
+ [<i>Note</i>: Implementations are encouraged to avoid the use of dynamically
+ allocated memory for small callable objects, for example, where <tt>f</tt>'s target
+ is an object holding only a pointer or reference to an object and a member
+ function pointer. &mdash; <i>end note</i>]
+ </p>
+ 
+ <p>
+ -11- <i>Throws</i>: shall not throw exceptions when <ins>an allocator is not specified
+ and</ins> <tt>f</tt> is a function pointer or a <tt>reference_wrapper&lt;T&gt;</tt> for some
+ <tt>T</tt>. Otherwise, may throw <tt>bad_alloc</tt> or any exception thrown by <tt>F</tt>'s copy or
+ move constructor<ins> or by <tt>A</tt>'s allocate function</ins>.
+ </p>
  </blockquote>
! 
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2372"></a>2372. Assignment from int to <tt>std::string</tt></h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Andrzej Krzemie&#324;ski <b>Opened:</b> 2014-03-13 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The following code works in C++:
! </p>
! <blockquote><pre>
! int i = 300;
! std::string threeHundred;
! threeHundred = i;
! </pre></blockquote>
! <p>
! "Works" == "Compiles and doesn't have an undefined behavior". But it may not be obvious and in fact misleading what it does. 
! This assignment converts an <tt>int</tt> to <tt>char</tt> and then uses <tt>string</tt>'s assignment from <tt>char</tt>. While 
! the assignment from <tt>char</tt> can be considered a feature, being able to assign from an int looks like a safety gap. Someone 
! may believe C++ works like "dynamically typed" languages and expect a lexical conversion to take place.
! <p/>
! Ideally the assignment from <tt>char</tt> could be deprecated and later removed, but as a less intrusive alternative one could 
! consider adding a SFINAEd deleted function template:
! </p>
! <blockquote><pre>
! template &lt;typename IntT&gt; // enable if is_integral&lt;IntT&gt;::value
! basic_string&amp; operator=(IntT) = delete;
! </pre></blockquote>
! 
! <p><i>[Lenexa 2015-06-06: Move to LEWG]</i></p>
! 
! <p>RS: std::string x('0' + n); broken by this.</p>
! <p>MC: This is an extension, move to LEWG.</p>
! <p>Move to LEWG, consensus.</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>To 21.4 [basic.string], class template <tt>basic_string</tt> synopsis, add as indicated:</p>
! 
! <blockquote><pre>
! basic_string&amp; operator=(const basic_string&amp; str);
! basic_string&amp; operator=(basic_string&amp;&amp; str) noexcept;
! basic_string&amp; operator=(const charT* s);
! basic_string&amp; operator=(charT c);
! <ins>template &lt;class IntT&gt; basic_string&amp; operator=(IntT i) = delete;</ins>
! basic_string&amp; operator=(initializer_list&lt;charT&gt;);
  </pre></blockquote>
  </li>
! 
! <li><p>Add after 21.4.2 [string.cons] p26 as indicated:</p>
! 
! <blockquote>
! <pre>
! basic_string&amp; operator=(charT c);
! </pre>
! <blockquote>
! <p>
! -26- <i>Returns</i>: <tt>*this = basic_string(1,c)</tt>.
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class IntT&gt; basic_string&amp; operator=(IntT i) = delete;</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Remarks</i>: This signature shall not participate in overload resolution unless <tt>is_integral&lt;T&gt;::value</tt> is 
! <tt>true</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! 
  </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2375"></a>2375. Is [iterator.requirements.general]/9 too broadly applied?</h3>
! <p><b>Section:</b> 24.2.1 [iterator.requirements.general] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Marshall Clow <b>Opened:</b> 2014-03-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 24.2.1 [iterator.requirements.general] p9 says:
! </p>
! <blockquote><p>
! Destruction of an iterator may invalidate pointers and references previously obtained from that iterator.
! </p></blockquote>
! <p>
! But the resolution of LWG issue <a href="lwg-defects.html#2360">2360</a> specifically advocates returning <tt>*--temp;</tt> where <tt>temp</tt> is a 
! local variable.
! <p/>
! And 24.2.5 [forward.iterators] p6 says:
! </p>
! <blockquote><p>
! If <tt>a</tt> and <tt>b</tt> are both dereferenceable, then <tt>a == b</tt> if and only if <tt>*a</tt> and <tt>*b</tt> are bound 
! to the same object.
! </p></blockquote>
! <p>
! which disallows "stashing" iterators (i.e, iterators that refer to data inside themselves).
! <p/>
! So, I suspect that the restriction in p9 should only apply to input iterators, and can probably be moved into 
! 24.2.3 [input.iterators] instead of 24.2.1 [iterator.requirements.general].
! </p>
! 
! <p><i>[2014-05-22, Daniel comments]</i></p>
! 
! 
! <p>
! Given that forward iterators (and beyond) are refinements of input iterator, moving this constraint to input iterators won't help
! much because it would still hold for all refined forms. 
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2379"></a>2379. Obtaining native handle of the current thread</h3>
! <p><b>Section:</b> 30.2.3 [thread.req.native], 30.3.2 [thread.thread.this] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2014-03-31 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Class <tt>thread</tt> contains an implementation-defined type <tt>thread::native_handle_type</tt>, and an implementation-defined 
! function <tt>thread::native_handle()</tt> that returns a value of that type. The presence and semantics of those members is 
! implementation-defined; the intention is that they can be used for interoperability with libraries that rely on operating system 
! specific features. (Posix libraries that accept arguments of type <tt>pthread_t</tt>, for example.)
! <p/>
! Unfortunately, there appears to be no native handle support for the equivalent of <tt>pthread_self()</tt>. We can use 
! <tt>this_thread::get_id()</tt> to obtain the <tt>thread::id</tt> of the current thread, but there is no mechanism for converting 
! a <tt>thread::id</tt> to a <tt>thread::native_handle</tt>.
! <p/>
! <em>Proposed wording:</em>
! <p/>
! In 30.3.2 [thread.thread.this] add:
! </p>
! <blockquote><pre>
! thread::native_handle_type native_handle(); <i>// See 30.2.3</i>
! </pre></blockquote>
! <p>
!  to the <tt>this_thread</tt> namespace synopsis.
! <p/>
! <em>Rationale:</em>
! <p/>
! Informally, we could address this issue either by adding a new function in <tt>this_thread</tt> or by providing a mechanism for converting 
! between <tt>thread::id</tt> and <tt>thread::native_handle</tt>. I propose the former because it seems more localized, and doesn't involve 
! saying anything more about implementation defined native functionality than we currently do.
! <p/>
! It's intentional that the proposed resolution adds a declaration of <tt>native_handle()</tt> without adding a paragraph explaining what 
! it does. This is because everything about <tt>native_handle()</tt> is implementation-defined. The standard does the same thing in 
! 30.3.1.5 [thread.thread.member]. 
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! Strong "don't care" reaction from SG1, after pointing out that this only matters in non-portable code, which can call pthread_self() or the like anyway, but the change also doesn't add any non-trivial implementation requirements.  This defused initial strong opinions on both sides.  Since this is essentially a feature request, we did not have sufficient consensus to proceed at this point.  There was a feeling we should reconsider after making more sense out of the much more general TLS issues we have been discussing.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 30.2.3 [thread.req.native] p1 as indicated:</p>
! 
! <blockquote>
! <p>
! -1- <del>Several classes described in this Clause have members</del><ins>This Clause includes several members named</ins> 
! <tt>native_handle_type</tt> and <tt>native_handle</tt>. The presence of these members and their semantics is 
! implementation-defined. [&hellip;]
! </p>
  </blockquote>
! </li>
! 
! <li><p>In 30.3 [thread.threads], header <tt>&lt;thread&gt;</tt> synopsis, add:</p>
! 
  <blockquote>
! <pre>
! namespace std {
!   [&hellip;]
!   namespace this_thread {
!     thread::id get_id() noexcept;
!     <ins>thread::native_handle_type native_handle();</ins>
!     [&hellip;]
!   }
! }
! </pre>
  </blockquote>
! </li>
! 
! <li><p>In 30.3.2 [thread.thread.this] add:</p>
  <blockquote>
! <pre>
! namespace std {
!   namespace this_thread {
!     thread::id get_id() noexcept;
!     <ins>thread::native_handle_type native_handle(); <i>// See 30.2.3 [thread.req.native]</i></ins>
!     [&hellip;]
!   }
! }
! </pre>
! </blockquote>
  </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2380"></a>2380. May <tt>&lt;cstdlib&gt;</tt> provide <tt>long ::abs(long)</tt> and <tt>long long ::abs(long long)</tt>?</h3>
! <p><b>Section:</b> 17.6.1.2 [headers] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-03-31 <b>Last modified:</b> 2015-05-05</p>
! <p><b>View all other</b> <a href="lwg-index.html#headers">issues</a> in [headers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! D.5 [depr.c.headers] p3 says:
! </p>
! <blockquote><p>
! [<i>Example</i>: The header <tt>&lt;cstdlib&gt;</tt> assuredly provides its declarations and definitions within the namespace
! <tt>std</tt>. It may also provide these names within the global namespace. The header <tt>&lt;stdlib.h&gt;</tt> assuredly
! provides the same declarations and definitions within the global namespace, much as in the C Standard. It
! may also provide these names within the namespace <tt>std</tt>. &mdash; <i>end example</i>]
! </p></blockquote>
! <p>
! This suggests that <tt>&lt;cstdlib&gt;</tt> may provide <tt>::abs(long)</tt> and <tt>::abs(long long)</tt>. But this seems like 
! it might contradict the normative wording of 17.6.1.2 [headers] p4:
! </p>
! <blockquote><p>
! Except as noted in Clauses 18 through 30 and Annex D, the contents of each header <tt>c<em>name</em></tt> shall be the same
! as that of the corresponding header <tt><em>name</em>.h</tt>, as specified in the C standard library (1.2) or the C Unicode
! TR, as appropriate, as if by inclusion. In the C++ standard library, however, the declarations (except for
! names which are defined as macros in C) are within namespace scope (3.3.6) of the namespace <tt>std</tt>. It is
! unspecified whether these names are first declared within the global namespace scope and are then injected
! into namespace <tt>std</tt> by explicit using-declarations (7.3.3).
! </p></blockquote>
! <p>
! Note that this allows <tt>&lt;cstdlib&gt;</tt> to provide <tt>::abs(int)</tt>, but does not obviously allow <tt>::abs(long)</tt> 
! nor <tt>::abs(long long)</tt>, since they are not part of the header <tt>stdlib.h</tt> as specified in the C standard library.
! <p/>
! 26.8 [c.math] p7 adds signatures <tt>std::abs(long)</tt> and <tt>std::abs(long long)</tt>, but not in a way that seems 
! to allow <tt>::abs(long)</tt> and <tt>::abs(long long)</tt> to be provided.
! <p/>
! I think the right approach here would be to allow <tt>&lt;cstdlib&gt;</tt> to either provide no <tt>::abs</tt> declaration, or 
! to provide all three declarations from namespace <tt>std</tt>, but it should not be permitted to provide only <tt>int abs(int)</tt>. 
! Suggestion:
! <p/>
! Change in 17.6.1.2 [headers] p4:
! </p>
! <blockquote><p>
! [&hellip;]. It is unspecified whether these names <ins>(including any overloads added in Clauses 18 through 30 and Annex D)</ins> 
! are first declared within the global namespace scope and are then injected into namespace <tt>std</tt> by explicit using-declarations 
! (7.3.3).
! </p></blockquote>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! MC: do we need to defer this?<br/>
! PJP: just need to get my mind around it, already playing dirty games here, my reaction is just do it as it will help C++<br/>
! STL: this is safe<br/>
! TP: would be surprising if using abs didn't bring in all of the overloads<br/>
! MC: that's Richard's argument<br/>
! MC: move to ready 
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Modify 17.6.1.2 [headers] p4 as indicated:</p>
! 
! <blockquote><p>
! Except as noted in Clauses 18 through 30 and Annex D, the contents of each header <tt>c<em>name</em></tt> shall be the same
! as that of the corresponding header <tt><em>name</em>.h</tt>, as specified in the C standard library (1.2) or the C Unicode
! TR, as appropriate, as if by inclusion. In the C++ standard library, however, the declarations (except for
! names which are defined as macros in C) are within namespace scope (3.3.6) of the namespace <tt>std</tt>. It is
! unspecified whether these names <ins>(including any overloads added in Clauses 18 through 30 and Annex D)</ins> are first 
! declared within the global namespace scope and are then injected into namespace <tt>std</tt> by explicit using-declarations (7.3.3).
! </p></blockquote>
  </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2381"></a>2381. Inconsistency in parsing floating point numbers</h3>
+ <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Marshall Clow <b>Opened:</b> 2014-04-30 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ In 22.4.2.1.2 [facet.num.get.virtuals] we have:
+ </p>
+ <blockquote><p>
+ Stage 3: The sequence of chars accumulated in stage 2 (the field) is converted to a numeric value by the
+ rules of one of the functions declared in the header <tt>&lt;cstdlib&gt;</tt>:
+ </p>
+ <ul>
+ <li><p>For a signed integer value, the function <tt>strtoll</tt>.</p></li>
+ <li><p>For an unsigned integer value, the function <tt>strtoull</tt>.</p></li>
+ <li><p>For a floating-point value, the function <tt>strtold</tt>.</p></li>
  </ul>
  </blockquote>
! <p>
! This implies that for many cases, this routine should return true:
! </p>
! <blockquote><pre>
! bool is_same(const char* p) 
! {
!   std::string str{p};
!   double val1 = std::strtod(str.c_str(), nullptr);
!   std::stringstream ss(str);
!   double val2;
!   ss &gt;&gt; val2;
!   return std::isinf(val1) == std::isinf(val2) &amp;&amp;                 // either they're both infinity
!          std::isnan(val1) == std::isnan(val2) &amp;&amp;                 // or they're both NaN
!          (std::isinf(val1) || std::isnan(val1) || val1 == val2); // or they're equal
! }
  </pre></blockquote>
! <p>
! and this is indeed true, for many strings:
! </p>
! <blockquote><pre>
! assert(is_same("0"));
! assert(is_same("1.0"));
! assert(is_same("-1.0"));
! assert(is_same("100.123"));
! assert(is_same("1234.456e89"));
! </pre></blockquote>
! <p>
! but not for others
! </p>
! <blockquote><pre>
! assert(is_same("0xABp-4")); // hex float
! assert(is_same("inf"));
! assert(is_same("+inf"));
! assert(is_same("-inf"));
! assert(is_same("nan"));
! assert(is_same("+nan"));
! assert(is_same("-nan"));
! 
! assert(is_same("infinity"));
! assert(is_same("+infinity"));
! assert(is_same("-infinity"));
! </pre></blockquote>
! <p>
! These are all strings that are correctly parsed by <tt>std::strtod</tt>, but not by the stream extraction operators.
! They contain characters that are deemed invalid in stage 2 of parsing.
! <p/>
! If we're going to say that we're converting by the rules of <tt>strtold</tt>, then we should accept all the things that 
! <tt>strtold</tt> accepts.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2383"></a>2383. Overflow cannot be ill-formed for chrono::duration integer literals</h3>
! <p><b>Section:</b> 20.12.5.8 [time.duration.literals] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-05-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 20.12.5.8 [time.duration.literals] p3 says:
! </p>
! <blockquote><p>
! If any of these suffixes are applied to an integer literal and the
! resulting <tt>chrono::duration</tt> value cannot be represented in the result
! type because of overflow, the program is ill-formed.
! </p></blockquote>
! <p>
! Ill-formed requires a diagnostic at compile-time, but there is no way
! to  detect the overflow from <tt>unsigned long long</tt> to the <tt>signed
! duration&lt;&gt;::rep</tt> type.
! <p/>
! Overflow could be detected if the duration integer literals were
! literal operator templates, otherwise overflow can either be undefined
! or a run-time error, not ill-formed.
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Open]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2384"></a>2384. Allocator's <tt>deallocate</tt> function needs better specification</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2014-05-19 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! According to Table 28, 17.6.3.5 [allocator.requirements], an <tt>Allocator</tt>'s <tt>deallocate</tt>
! function is specified as follows:
! </p>
! <blockquote><p>
! All <tt>n</tt> <tt>T</tt> objects in the area
! pointed to by <tt>p</tt> shall be
! destroyed prior to this call. <tt>n</tt>
! shall match the value passed to
! allocate to obtain this
! memory. Does not throw
! exceptions. [<i>Note</i>: <tt>p</tt> shall not be
! singular. &mdash; <i>end note</i>]
! </p></blockquote>
! <p>
! This wording is confusing in regard to the following points:
! </p>
! <ol>
! <li><p>This specification does not make clear that the result of an <tt>allocate</tt>
! call can only be returned once to the <tt>deallocate</tt> function. This is much
! clearer expressed for <tt>operator delete</tt> (18.6.1.1 [new.delete.single] p12, emphasis mine):</p>
! <blockquote><p>
! <i>Requires</i>: <tt>ptr</tt> shall be a null pointer or <span style="color:#C80000;font-weight:bold">its value shall be a value returned 
! by an earlier call to</span> the (possibly replaced) <span style="color:#C80000;font-weight:bold"><tt>operator new(std::size_t)</tt> or 
! <tt>operator new(std::size_t,const std::nothrow_t&amp;)</tt> which has not been invalidated 
! by an intervening call to <tt>operator delete(void*)</tt></span>.
! </p></blockquote>
  </li>
! <li><p>The intended meaning of that wording was to say that <tt>deallocate</tt> shall accept <em>every</em> result value
! that had been returned by a corresponding call to <tt>allocate</tt>, this includes also a possible result of a
! null pointer value, which is possible ("[<i>Note</i>: If <tt>n == 0</tt>, the return value is unspecified.
! &mdash; <i>end note</i>]"). Unfortunately the <tt>deallocate</tt> function uses a non-normative note ("<tt>p</tt> shall not be
! singular.") which refers to the fuzzy term <tt>singular</tt>, that is one of the most unclear and misunderstood terms
! of the library, as pointed out in <a href="lwg-active.html#1213">1213</a>. The occurrence of this term has lead to the possible understanding,
! that this function would never allow null pointer values. Albeit for allocators the intention had not been to require the support
! <em>in general</em> that a null pointer value can be provided to <tt>deallocate</tt> (as it is allowed for <tt>std::free</tt>
! and <tt>operator delete</tt>), the mental model was that <em>every</em> returned value of <tt>allocate</tt> shall be an
! acceptable argument type of the corresponding <tt>deallocate</tt> function.
! </p>
  </li>
! </ol>
! 
! <p>
! This issue is not intending to enforce a specific meaning of <em>singular</em> iterator values, but the assertion is
! that this note does more harm than good. In addition to wording from <tt>operator delete</tt> there is no longer any need
! to obfuscate the normative wording. 
! </p>
! 
! <p><i>[2014-05-24 Alisdair comments]</i></p>
! 
! 
! <p>
! Now that I am reading it very precisely, there is another mis-stated assumption
! as a precondition for <tt>deallocate</tt>:
! </p>
! <blockquote><p>
! All <tt>n T</tt> objects in the area pointed to by <tt>p</tt> shall be destroyed prior to this call.
! </p></blockquote>
! <p>
! This makes a poor assumption that every possible object in the allocated buffer
! was indeed constructed, but this is often not the case, e.g., a <tt>vector</tt> that is not
! filled to capacity. We should require calling the destructor for only those objects
! actually constructed in the buffer, which may be fewer than <tt>n</tt>, or even 0.
! <p/>
! I wonder if we really require all objects to be destroyed before calling <tt>deallocate</tt>
! though. Are we really so concerned about leaking objects that might not manage
! resources? Should this not be the proper concern of the library managing the
! objects and memory?
! </p>
! 
! <p><i>[2014-06-05 Daniel responds and improves wording]</i></p>
! 
! 
! <p>
! I fully agree with the last comment and I think that this requirement should be removed. We have no such
! requirements for comparable functions such as <tt>operator delete</tt> or <tt>return_temporary_buffer()</tt>,
! and this wording seems to be a wording rudiment that exists since C++98.
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! Marshall: What do people think about this?<br/>
! PJP: Sure.<br/>
! Wakely: Love it.<br/>
! Marshall: Ready?<br/>
! Everyone agrees.<br/>
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change Table 28 ("<tt>Allocator</tt> requirements") as indicated:</p>
! 
  <blockquote>
! <table border="1">
! <caption>Table 28 &mdash; <tt>Allocator</tt> requirements</caption>
! <tr>
! <th align="center">Expression</th>
! <th align="center">Return type</th>
! <th align="center">Assertion/note<br/>pre-/post-condition</th>
! <th align="center">Default</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.deallocate(p,n)</tt>
! </td>
! <td>
! (not used)
! </td>
! <td>
! <ins><i>Pre</i>: <tt>p</tt> shall be a value returned by an earlier<br/> 
! call to <tt>allocate</tt> which has not been invalidated by<br/> 
! an intervening call to <tt>deallocate</tt>. <tt>n</tt> shall<br/> 
! match the value passed to <tt>allocate</tt> to obtain this<br/> 
! memory.</ins> <del>All <tt>n T</tt> objects in the area pointed to by<br/> 
! <tt>p</tt> shall be destroyed prior to this call.</del><br/>
! <ins><i>Throws</i>: Nothing.</ins><del><tt>n</tt><br/>
! shall match the value passed to<br/>
! allocate to obtain this<br/>
! memory. Does not throw<br/>
! exceptions. [<i>Note</i>: <tt>p</tt> shall not<br/>
! be singular. &mdash; <i>end note</i>]</del>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
  </blockquote>
+ 
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2385"></a>2385. <tt>function::assign</tt> allocator argument doesn't make sense</h3>
+ <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2014-05-23 <b>Last modified:</b> 2015-05-07</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The definition of <tt>function::assign</tt> in N3936 is:
+ </p>
+ <blockquote><pre>
+ template&lt;class F, class A&gt;
+   void assign(F&amp;&amp; f, const A&amp; a);
+ </pre>
  <blockquote>
! <p>
! <i>Effects</i>: <tt>function(allocator_arg, a, std::forward&lt;F&gt;(f)).swap(*this)</tt>
! </p>
  </blockquote>
+ </blockquote>
+ <p>
+ This definition is flawed in several respects:
+ </p>
+ <ol>
+ <li><p>The interface implies that the intent is to replace the allocator in <tt>*this</tt>
+ with the specified allocator, <tt>a</tt>.  Such functionality is unique in the
+ standard and is problematic when creating, e.g. a container of function
+ objects, all using the same allocator.</p>
+ </li>
+ <li><p>The current definition of <tt>swap()</tt> makes it unclear whether the objects being
+ swapped can have different allocators.  The general practice is that
+ allocators must be equal in order to support swap, and this practice is
+ reinforced by the proposed library TS. Thus, the definition of <tt>assign</tt> would
+ have undefined behavior unless the allocator matched the allocator already
+ within function.
+ </p>
+ </li>
+ <li><p>
+ The general rule for members of function is to supply the allocator before
+ the functor, using the <tt>allocator_arg</tt> prefix. Supplying the allocator as a
+ second argument, without the <tt>allocator_arg</tt> prefix is error prone and
+ confusing.
+ </p></li>
+ </ol>
+ 
+ <p>
+ I believe that this ill-conceived interface was introduced in the effort to
+ add allocators to parts of the standard where it had been missing, when we
+ were unpracticed in the right way to accomplish that. Allocators were added
+ to function at a time when the allocator model was in flux and it was the
+ first class in the standard after <tt>shared_ptr</tt> to use type-erased allocators, so
+ it is not surprising to see some errors in specification here. (<tt>shared_ptr</tt> is
+ a special case because of its shared semantics, and so is not a good model.)
+ <p/>
+ The main question is whether this member should be specified with better
+ precision or whether it should be deprecated/removed. The only way I can see to
+ give a "reasonable" meaning to the existing interface is to describe it in
+ terms of destroying and re-constructing <tt>*this</tt>:
+ </p>
+ <blockquote><pre>
+ function temp(allocator_arg, a, std::forward&lt;F&gt;(f));
+ this-&gt;~function();
+ ::new(this) function(std::move(temp));
+ </pre></blockquote>
+ <p>
+ (The temp variable is needed for exception safety). The ugliness of this
+ specification underscores the ugliness of the concept. What is the purpose of
+ this member other than to reconstruct the object from scratch, a facility that
+ library classes do not generally provide? Programmers are always free to
+ destroy and re-construct objects &mdash; there is no reason why function should
+ make that especially easy.
+ <p/>
+ I propose, therefore, that we make no attempt at giving the current interface
+ a meaningful definition of questionable utility, but simply get rid of it
+ all together. This leaves us with only two questions:
+ </p>
+ <ol>
+ <li><p>Should we deprecate the interface or just remove it?</p></li>
+ <li><p>Should we replace it with an <tt>assign(f)</tt> member that doesn't take an
+ allocator?</p></li>
+ </ol>
+ <p>
+ Of these four combinations of binary answers to the above questions, I think
+ the ones that make the most sense are (remove, no) and (deprecate, yes). The
+ proposed new interface provides nothing that <tt>operator=</tt> does not already
+ provide. However, if the old (deprecated) interface remains, then having the
+ new interface will guide the programmer away from it.
+ <p/>
+ The proposed wording below assumes deprecation. If we choose removal, then
+ there is no wording needed; simply remove the offending declaration and
+ definition.
+ </p>
+ 
+ <p>
+ <strong>Previous resolution [SUPERSEDED]:</strong>
+ </p>
+ <blockquote class="note">
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Change class template <tt>function</tt> synopsis, 20.9.12.2 [func.wrap.func], as indicated:</p>
  
  <blockquote>
! <pre>
! template&lt;class R, class... ArgTypes&gt;
! class function&lt;R(ArgTypes...)&gt; {
!   [&hellip;]
!   <i>// 20.9.11.2.2, function modifiers:</i>
!   void swap(function&amp;) noexcept;
!   template&lt;class F<del>, class A</del>&gt; void assign(F&amp;&amp;<del>, const A&amp;</del>);
!   [&hellip;]
! };
! </pre>
  </blockquote>
+ </li>
+ 
+ <li><p>Change 20.9.12.2.2 [func.wrap.func.mod] as indicated:</p>
  
  <blockquote>
! <pre>
! template&lt;class F<del>, class A</del>&gt; void assign(F&amp;&amp; f<del>, const A&amp; a</del>);
! </pre>
! <blockquote>
! <p>
! <i>Effects</i>: <tt><ins>*this = forward&lt;F&gt;(f);</ins><del>function(allocator_arg, a, std::forward&lt;F&gt;(f)).swap(*this)</del></tt>
! </p>
  </blockquote>
+ </blockquote>
+ </li>
+ 
+ <li><p>To deprecation section  [depr.function.objects], add the following new sub-clause:</p>
  
  <blockquote>
! <p>
! <b>Old <tt>assign</tt> member of polymorphic function wrappers [depr.function.objects.assign]</b>
! </p>
! <blockquote>
! <pre>
! namespace std{
!   template&lt;class R, class... ArgTypes&gt;
!   class function&lt;R(ArgTypes...)&gt; {
!     <i>// remainder unchanged</i>
!     template&lt;class F, class A&gt; void assign(F&amp;&amp; f, const A&amp; a);
!     [&hellip;]
!   };
! }
! </pre>
  </blockquote>
+ <p>
+ The two-argument form of <tt>assign</tt> is defined as follows:
+ </p>
+ <pre>
+ template&lt;class F, class A&gt; void assign(F&amp;&amp; f, const A&amp; a);
+ </pre>
  <blockquote>
! <p>
! <i>Requires</i>: <tt>a</tt> shall be equivalent to the allocator used to construct <tt>*this</tt>.
! <p/>
! <i>Effects</i>: <tt>this-&gt;assign(forward&lt;F&gt;(f));</tt>
! </p>
! </blockquote>
! 
! </blockquote>
  </li>
! </ol>
  </blockquote>
  
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! STL: I would ask, does anybody oppose removing this outright?<br/>
! Wakely: I don't even have this signature.<br/>
! Hwrd: And I think this doesn't go far enough, even more should be removed. This is a step in the right direction.<br/>
! PJP: I'm in favor of removal.<br/>
! Wakely: We've already got TS1 that has a new function that does it right. We could wait for feedback on that. 
! I think this issue should be taken now.<br/>
! Marshall: Then the goal will be to move to ready. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4431.</p>
! 
! <ol>
! <li><p>Change class template <tt>function</tt> synopsis, 20.9.12.2 [func.wrap.func], as indicated:</p>
! 
  <blockquote>
! <pre>
! template&lt;class R, class... ArgTypes&gt;
! class function&lt;R(ArgTypes...)&gt; {
!   [&hellip;]
!   <i>// 20.9.12.2.2, function modifiers:</i>
!   void swap(function&amp;) noexcept;
!   <del>template&lt;class F, class A&gt; void assign(F&amp;&amp;, const A&amp;);</del>
!   [&hellip;]
! };
! </pre>
! </blockquote>
  </li>
! 
! <li><p>Change 20.9.12.2.2 [func.wrap.func.mod] as indicated:</p>
! 
! <blockquote>
! <pre>
! <del>template&lt;class F, class A&gt; 
!   void assign(F&amp;&amp; f, const A&amp; a);</del>
! </pre>
! <blockquote>
! <p>
! <del>-2- <i>Effects</i>: <tt>function(allocator_arg, a, std::forward&lt;F&gt;(f)).swap(*this)</tt></del>
! </p>
  </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2391"></a>2391. <tt>basic_string</tt> is missing non-<tt>const</tt> <tt>data()</tt></h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Michael Bradshaw <b>Opened:</b> 2014-05-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Regarding 21.4 [basic.string], <tt>std::basic_string&lt;charT&gt;::data()</tt> returns a <tt>const charT*</tt> 
! 21.4.7.1 [string.accessors]. While this method is convenient, it doesn't quite match <tt>std::array&lt;T&gt;::data()</tt> 
! 23.3.2.5 [array.data] or <tt>std::vector&lt;T&gt;::data()</tt> 23.3.6.4 [vector.data], both of which provide two 
! versions (that return <tt>T*</tt> or <tt>const T*</tt>). An additional <tt>data()</tt> method can be added to 
! <tt>std::basic_string</tt> that returns a <tt>charT*</tt> so it can be used in similar situations that <tt>std::array</tt> and 
! <tt>std::vector</tt> can be used. Without a non-<tt>const</tt> <tt>data()</tt> method, <tt>std::basic_string</tt> has to be treated 
! specially in code that is otherwise oblivious to the container type being used.
! <p/>
! Adding a <tt>charT*</tt> return type to <tt>data()</tt> would be equivalent to doing <tt>&amp;str[0]</tt> or <tt>&amp;str.front()</tt>.
! <p/>
! Small discussion on the issue can be found <a href="http://stackoverflow.com/questions/7518732/why-are-stdvectordata-and-stdstringdata-different">here</a>
! and in the <a href="https://groups.google.com/a/isocpp.org/forum/#!topic/std-discussion/ll9HuEML6zo/discussion">std-discussion thread</a>  
! (which didn't get too much attention).
! <p/>
! This requires a small change to <tt>std::basic_string</tt>'s definition in 21.4 [basic.string] to add the method to 
! <tt>std::basic_string</tt>, and another small change in 21.4.7.1 [string.accessors] to define the new method.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Back to LEWG.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change class template <tt>basic_string</tt> synopsis, 21.4 [basic.string], as indicated:</p>
  <blockquote>
! <pre>
! namespace std {
!   template&lt;class charT, class traits = char_traits&lt;charT&gt;,
!   class Allocator = allocator&lt;charT&gt; &gt;
!   class basic_string {
!   public:
!     [&hellip;]
!     <i>// 21.4.7, string operations:</i>
!     const charT* c_str() const noexcept;
!     const charT* data() const noexcept;
!     <ins>charT* data() noexcept;</ins>
!     allocator_type get_allocator() const noexcept;
!     [&hellip;]
!   };
! }
! </pre>
  </blockquote>
! 
! </li>
! 
! <li><p>Add the following sequence of paragraphs following 21.4.7.1 [string.accessors] p3, as indicated:</p>
  <blockquote>
! <pre>
! <ins>charT* data() noexcept;</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: A pointer <tt>p</tt> such that <tt>p + i == &amp;operator[](i)</tt> for each <tt>i</tt> in <tt>[0,size()]</tt>.</ins>
! <p/>
! <ins>-?- <i>Complexity</i>: Constant time.</ins>
! <p/>
! <ins>-?- <i>Requires</i>: The program shall not alter the value stored at <tt>p + size()</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
  </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2392"></a>2392. "character type" is used but not defined</h3>
! <p><b>Section:</b> 17.3 [defns.ntcts], 22.3.1.1.1 [locale.category], 27.2.2 [iostreams.limits.pos], 27.7.3.6.1 [ostream.formatted.reqmts], 27.7.3.6.4 [ostream.inserters.character] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2014-06-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The term "character type" is used in 17.3 [defns.ntcts], 22.3.1.1.1 [locale.category],
! 27.2.2 [iostreams.limits.pos], 27.7.3.6.1 [ostream.formatted.reqmts], and
! 27.7.3.6.4 [ostream.inserters.character], but the core language only defines
! "narrow character types" (3.9.1 [basic.fundamental]).
! <p/>
! "wide-character type" is used in 22.5 [locale.stdcvt], but the core
! language only defines a "wide-character set" and "wide-character literal".
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2393"></a>2393. <tt>std::function</tt>'s <em>Callable</em> definition is broken</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2014-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The existing definition of <tt>std::function</tt>'s <em>Callable</em> requirements provided in 20.9.12.2 [func.wrap.func]
! p2,
! </p>
! <blockquote><p>
! A callable object <tt>f</tt> of type <tt>F</tt> is <em>Callable</em> for argument types <tt>ArgTypes</tt> and return type 
! <tt>R</tt> if the expression <tt><i>INVOKE</i>(f, declval&lt;ArgTypes&gt;()..., R)</tt>, considered as an unevaluated operand 
! (Clause 5), is well formed (20.9.2).
! </p></blockquote>
! <p>
! is defective in several aspects:
! </p>
! <ol style="list-style-type:upper-roman">
! <li><p>The wording can be read to be defined in terms of callable objects, not of callable types.</p>
  </li>
! <li><p>Contrary to that, 20.9.12.2.5 [func.wrap.func.targ] p2 speaks of "<tt>T</tt> shall be a type that is <em>Callable</em> 
! (20.9.11.2) for parameter types <tt>ArgTypes</tt> and return type <tt>R</tt>."</p>
! </li>
! <li><p>
! The required value category of the callable object during the call expression (lvalue or rvalue) strongly depends on
! an interpretation of the expression <tt>f</tt> and therefore needs to be specified unambiguously.
! </p></li>
! </ol>
! <p>
! The intention of original <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1402.html">proposal</a> 
! (see IIIa. Relaxation of target requirements) was to refer to both types and values ("we say that the function object <tt>f</tt> 
! (and its type <tt>F</tt>) is <em>Callable</em> [&hellip;]"), but that mental model is not really deducible from the
! existing wording. An improved type-dependence wording would also make the sfinae-conditions specified in 20.9.12.2.1 [func.wrap.func.con] 
! p8 and p21 ("[&hellip;] shall not participate in overload resolution unless <tt>f</tt> is Callable (20.9.11.2)
! for argument types <tt>ArgTypes...</tt> and return type <tt>R</tt>.") easier to interpret.
! <p/>
! My understanding always had been (see e.g. Howard's code example in the 2009-05-01 comment in LWG <a href="lwg-defects.html#815">815</a>), that 
! <tt>std::function</tt> invokes the call operator of its target via an <b>lvalue</b>. The required value-category is relevant, 
! because it allows to reflect upon whether an callable object such as
! </p>
! <blockquote><pre>
! struct RVF 
! {
!   void operator()() const &amp;&amp; {}
! };
! </pre></blockquote>
! <p>
! would be a feasible target object for <tt>std::function&lt;void()&gt;</tt> or not.
! <p/>
! Clarifying the current <em>Callable</em> definition seems also wise to make a future transition to language-based concepts
! easier. A local fix of the current wording is simple to achieve, e.g. by rewriting it as follows:
! </p>
! <blockquote><p>
! A callable <del>object <tt>f</tt> of</del> type <ins>(20.9.1 [func.def])</ins> <tt>F</tt> is <em>Callable</em> 
! for argument types <tt>ArgTypes</tt> and return type <tt>R</tt> if the expression <tt><i>INVOKE</i>(<del>f</del><ins>declval&lt;F&amp;&gt;()</ins>, 
! declval&lt;ArgTypes&gt;()..., R)</tt>, considered as an unevaluated operand (Clause 5), is well formed (20.9.2).
! </p></blockquote>
! <p>
! It seems appealing to move such a general <em>Callable</em> definition to a more "fundamental" place (e.g. as another
! paragraph of 20.9.1 [func.def]), but the question arises, whether such a more general concept should impose
! the requirement that the call expression is invoked on an <b>lvalue</b> of the callable object &mdash; such a
! special condition would also conflict with the more general definition of the <tt>result_of</tt> trait, which
! is defined for either lvalues or rvalues of the callable type <tt>Fn</tt>. In this context I would like to point out that
! "<em>Lvalue-Callable</em>" is not the one and only <em>Callable</em> requirement in the library. Counter examples are
! <tt>std::thread</tt>, <tt>call_once</tt>, or <tt>async</tt>, which depend on "<em>Rvalue-Callable</em>", because they 
! all act on functor rvalues, see e.g. 30.3.1.2 [thread.thread.constr]:
! </p>
! <blockquote><p>
! [&hellip;] The new thread of execution executes <tt><i>INVOKE</i>(<i>DECAY_COPY</i>(std::forward&lt;F&gt;(f)), 
! <i>DECAY_COPY</i>(std::forward&lt;Args&gt;(args))...)</tt> [&hellip;]
! </p></blockquote>
! <p>
! For every callable object <tt>F</tt>, the result of <tt><i>DECAY_COPY</i></tt> is an rvalue. These implied rvalue function calls are 
! no artifacts, but had been deliberately voted for by a Committee decision (see LWG <a href="lwg-defects.html#2021">2021</a>, 2011-06-13 comment) 
! and existing implementations respect these constraints correctly. Just to give an example,
! </p>
! <blockquote><pre>
! #include &lt;thread&gt;
! 
! struct LVF 
! {
!   void operator()() &amp; {}
! };
! 
! int main()
! {
!   LVF lf;
!   std::thread t(lf);
!   t.join();
! }
! </pre></blockquote>
! <p>
! is supposed to be rejected.
! <p/>
! The below presented wording changes are suggested to be minimal (still local to <tt>std::function</tt>), but the used approach
! would simplify a future (second) conceptualization or any further generalization of <em>Callable</em> requirements of the Library.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4348.html">N4348</a>. Don't touch with a barge pole. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.9.12.2 [func.wrap.func] p2 as indicated:</p>
! 
! <blockquote><p>
! -2- A callable <del>object <tt>f</tt> of</del> type <ins>(20.9.1 [func.def])</ins> <tt>F</tt> is <em><ins>Lvalue-</ins>Callable</em> 
! for argument types <tt>ArgTypes</tt> and return type <tt>R</tt> if the expression <tt><i>INVOKE</i>(<del>f</del><ins>declval&lt;F&amp;&gt;()</ins>, 
! declval&lt;ArgTypes&gt;()..., R)</tt>, considered as an unevaluated operand (Clause 5), is well formed (20.9.2).
! </p></blockquote>
! </li>
! 
! <li><p>Change 20.9.12.2.1 [func.wrap.func.con] p8+p21 as indicated:</p>
! 
! <blockquote>
! <pre>
! template&lt;class F&gt; function(F f);
! template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -8- <i>Remarks</i>: These constructors shall not participate in overload resolution unless <tt><del>f</del><ins>F</ins></tt> is 
! <tt><ins>Lvalue-</ins>Callable</tt> (20.9.11.2) for argument types <tt>ArgTypes...</tt> and return type <tt>R</tt>.
! </p>
! </blockquote>
! <p>
! [&hellip;]
! </p>
! <pre>
! template&lt;class F&gt; function&amp; operator=(F&amp;&amp; f);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -21- <i>Remarks</i>: This assignment operator shall not participate in overload resolution unless 
! <tt><del>declval&lt;typename decay&lt;F&gt;::type&amp;&gt;()</del><ins>decay_t&lt;F&gt;</ins></tt> is 
! <tt><ins>Lvalue-</ins>Callable</tt> (20.9.11.2) for argument types <tt>ArgTypes...</tt> and return type <tt>R</tt>.
! </p>
! </blockquote>
! 
  </blockquote>
+ </li>
+ 
+ <li><p>Change 20.9.12.2.5 [func.wrap.func.targ] p2 as indicated: [<i>Editorial comment</i>: Instead of adapting the preconditions
+ for the naming change I recommend to strike it completely, because the <tt>target()</tt> functions do not depend on it; the
+ corresponding wording exists since its <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1667.pdf">initial proposal</a>
+ and it seems without any advantage to me. Assume that some template argument <tt>T</tt> is provided, which does <em>not</em>
+ satisfy the requirements: The effect will be that the result is a null pointer value, but that case can happen in other (valid) situations
+ as well. &mdash; <i>end comment</i>]</p>
  
+ <blockquote><pre>
+ template&lt;class T&gt; T* target() noexcept;
+ template&lt;class T&gt; const T* target() const noexcept;
+ </pre>
+ <blockquote>
+ <p>
+ <del>-2- <i>Requires</i>: <tt>T</tt> shall be a type that is <tt>Callable</tt> (20.9.11.2) for parameter types 
+ <tt>ArgTypes</tt> and return type <tt>R</tt>.</del>
+ <p/>
+ -3- <i>Returns</i>: If <tt>target_type() == typeid(T)</tt> a pointer to the stored function target; otherwise a null
+ pointer.
+ </p>
+ </blockquote>
+ </blockquote>
  </li>
+ </ol>
  
! 
! 
! 
! 
! <hr>
! <h3><a name="2394"></a>2394. <tt>locale::name</tt> specification unclear &mdash; what is implementation-defined?</h3>
! <p><b>Section:</b> 22.3.1.3 [locale.members] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-06-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.members">issues</a> in [locale.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
  <p>
! 22.3.1.3 [locale.members] p5 says:
! </p>
! <blockquote><p>
! <i>Returns</i>: The name of <tt>*this</tt>, if it has one; otherwise, the string <tt>"*"</tt>. If <tt>*this</tt> has a name, then
! <tt>locale(name().c_str())</tt> is equivalent to <tt>*this</tt>. Details of the contents of the resulting string are
! otherwise implementation-defined.
! </p></blockquote>
! <p>
! So&hellip; what is implementation-defined here, exactly? The first sentence <em>completely</em> defines the behavior of this function 
! in all cases.
! <p/>
! Also, the second sentence says (effectively) that all locales with the same name are equivalent: given <tt>L1</tt> and <tt>L2</tt> 
! that have the same name <tt>N</tt>, they are both equivalent to <tt>locale(N)</tt>, and since there is no definition of 
! "equivalent" specific to <tt>locale</tt>, I assume it's the normal transitive equivalence property, which would imply that 
! <tt>L1</tt> is equivalent to <tt>L2</tt>. I'm not sure why this central fact is in the description of <tt>locale::name</tt>, nor 
! why it's written in this roundabout way.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2398"></a>2398. <tt>type_info</tt>'s destructor shouldn't be required to be virtual</h3>
! <p><b>Section:</b> 18.7.1 [type.info] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#type.info">issues</a> in [type.info].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>type_info</tt>'s destructor is depicted as being <tt>virtual</tt>, which is nearly unobservable to users (since they can't construct 
! or copy this class, they can't usefully derive from it). However, it's technically observable (via <tt>is_polymorphic</tt> and 
! <tt>has_virtual_destructor</tt>). It also imposes real costs on implementations, requiring them to store one vptr per 
! <tt>type_info</tt> object, when RTTI space consumption is a significant concern.
! <p/>
! Making this implementation-defined wouldn't affect users (who can observe this only if they're specifically looking for it) and 
! wouldn't affect implementations who need <tt>virtual</tt> here, but it would allow other implementations to drop <tt>virtual</tt> 
! and improve their RTTI space consumption.
! <p/>
! Richard Smith:
! <p/>
! It's observable in a few other ways.
! </p>
! <blockquote><pre>
! std::map&lt;void*, something&gt; m;
! m[dynamic_cast&lt;void*&gt;(&amp;typeid(blah))] = stuff;
! </pre></blockquote>
! <p>
! ... is broken by this change, because you can't <tt>dynamic_cast</tt> a non-polymorphic class type to <tt>void*</tt>.
! </p>
! <blockquote><pre>
! type_info&amp; f();
! typeid(f());
  </pre></blockquote>
+ <p>
+ ... evaluates <tt>f()</tt> at runtime without this change, and might not do so with this change.
+ <p/>
+ These are probably rare things, but I can imagine at least some forms of the latter being used in SFINAE tricks.
+ </p>
+ 
+ <p><i>[Lenexa 2015-05-05: Move to Open]</i></p>
+ 
+ <p>Marshall to poll LEWG for their opinion</p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Change 18.7.1 [type.info] as indicated:</p>
+ 
  <blockquote>
! <pre>
! namespace std {
!   class type_info {
!   public:
!     <del>virtual</del><ins><i>see below</i></ins> ~type_info();
!     [&hellip;]
!   };
! }
! </pre>
! <p>
! -1- The class <tt>type_info</tt> describes type information generated by the implementation. Objects of this class
! effectively store a pointer to a name for the type, and an encoded value suitable for comparing two types for
! equality or collating order. The names, encoding rule, and collating sequence for types are all unspecified
! and may differ between programs. <ins>Whether <tt>~type_info()</tt> is <tt>virtual</tt> is implementation-defined.</ins>
! </p>
  </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2402"></a>2402. <tt>basic_string(const basic_string&amp; str, size_type pos, size_type n = npos)</tt> shouldn't use <tt>Allocator()</tt></h3>
+ <p><b>Section:</b> 21.4.2 [string.cons] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View all other</b> <a href="lwg-index.html#string.cons">issues</a> in [string.cons].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 21.4.2 [string.cons] p3 specifies:
+ </p>
  <blockquote>
! <pre>
! basic_string(const basic_string&amp; str, size_type pos, size_type n = npos, const Allocator&amp; a = Allocator());
! </pre>
! <p>
! But this implies that <tt>basic_string(str, pos)</tt> and <tt>basic_string(str, pos, n)</tt> use <tt>Allocator()</tt> 
! instead of getting an allocator from <tt>str</tt>.
! <p/>
! 21.4.1 [string.require] p3 says "The <tt>Allocator</tt> object used shall be obtained as described in 23.2.1."  
! 23.2.1 [container.requirements.general] p8 says "Copy constructors for these container types obtain an allocator 
! by calling <tt>allocator_traits&lt;allocator_type&gt;::select_on_container_copy_construction</tt> on the allocator 
! belonging to the container being copied.", but this isn't exactly a copy constructor. Then it talks about move constructors 
! (which this definitely isn't), and finally says that "All other constructors for these container types take a 
! <tt>const allocator_type&amp;</tt> argument. [&hellip;] A copy of this allocator is used for any memory allocation performed".
! </p>
  </blockquote>
  
! <p><i>[2015-05-06 Lenexa: move to Open]</i></p>
! 
! <p>STL: there an allocator right there in str, why default-construct one</p>
! <p>STL: my fix, which may not be right, splits out functions with and without allocators</p>
! <p>JW: there are other ways to propagate the allocator from str to the new object</p>
! <p>PJP: hard to get motivated about this one</p>
! <p>JW: I think this is not a copy operation, this is init'ing a string from a range of characters which happens to originate in a string. It makes it inconsistent with the similar ctor taking a const char pointer, and if we had a std::string_view we wouldn't even have this ctor, and it wouldn't be possible to propagate the allocator.</p>
! <p>STL: but people with stateful allocators want it to propagate</p>
! <p>JW: I think the people using stateful allocators will alter the default behaviour of select_on_container_copy_construction so that it doesn't propagate, but will return a default-constructed one (to ensure a stateful allocator referring to a stack buffer doesn't leak to a region where the stack buffer has gone). So for those people, your proposed change does nothing, it changes one default-constructed allocator to a call to select_on_container_copy_construction which returns a default-constructed allocator. For other people who have different stateful allocators they can still provide the right allocator (whatever that may be) by passing it in.</p>
! <p>STL: OK, that's convincing.</p>
! <p>PJP: I agree with Jonathan</p>
! <p>JW: would like to run both our arguments by Pablo in case I'm totally misrepresenting the expected users of allocator-traits stuff</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 21.4 [basic.string] p5, class template <tt>basic_string</tt> synopsis, as indicated:</p>
! 
  <blockquote>
! <pre>
! [&hellip;]
! <i>// 21.4.2, construct/copy/destroy:</i>
! [&hellip;]
! basic_string(basic_string&amp;&amp; str) noexcept;
! <ins>basic_string(const basic_string&amp; str, size_type pos, size_type n = npos);</ins>
! basic_string(const basic_string&amp; str, size_type pos, size_type n<del> = npos</del>,
!             const Allocator&amp; a<del> = Allocator()</del>);
! [&hellip;]
! </pre>
! </blockquote>
  </li>
! 
! <li><p>Change 21.4.2 [string.cons] around p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! <ins>basic_string(const basic_string&amp; str, 
!              size_type pos, size_type n = npos);</ins>
! basic_string(const basic_string&amp; str, 
!              size_type pos, size_type n<del> = npos</del>,
!              const Allocator&amp; a<del> = Allocator()</del>);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -5- <i>Effects</i>: Constructs an object of class <tt>basic_string</tt> and determines the effective length <tt>rlen</tt> of the
! initial string value as the smaller of <tt>n</tt> and <tt>str.size() - pos</tt>, as indicated in Table 65. <ins>The first constructor 
! obtains an allocator by calling <tt>allocator_traits&lt;allocator_type&gt;::select_on_container_copy_construction</tt> on the 
! allocator belonging to <tt>str</tt>.</ins>
! <p/>
! Table 65 &mdash; <ins><tt>basic_string(const basic_string&amp;, size_type, size_type)</tt> and</ins>
! <tt>basic_string(const basic_string&amp;, size_type, size_type, const Allocator&amp;)</tt> effects
! </p>
! </blockquote>
! </blockquote>
  </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2412"></a>2412. <tt>promise::set_value()</tt> and <tt>promise::get_future()</tt> should not race</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise], 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#SG1">SG1</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-06-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#SG1">SG1</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The following code has a data race according to the standard:
! </p>
! <blockquote>
! <pre>
! std::promise&lt;void&gt; p;
! std::thread t{ []{
!   p.get_future().wait();
! }};
! p.set_value();
! t.join();
! </pre>
! </blockquote>
! <p>
! The problem is that both <tt>promise::set_value()</tt> and
! <tt>promise::get_future()</tt> are non-const member functions which modify the
! same object, and we only have wording saying that the <tt>set_value()</tt> and
! <tt>wait()</tt> calls (i.e. calls setting and reading the shared state) are
! synchronized.
! <p/>
! The calls don't actually access the same memory locations, so the
! standard should allow it. My suggestion is to state that calling
! <tt>get_future()</tt> does not conflict with calling the various functions that
! make the shared state ready, but clarify with a note that this does
! not imply any synchronization or "happens before", only being free
! from data races.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 30.6.5 [futures.promise] around p12 as indicated:</p>
! 
! <blockquote>
! <pre>
! future&lt;R&gt; get_future();
! </pre>
! <blockquote>
! <p>
! -12- <i>Returns</i>: A <tt>future&lt;R&gt;</tt> object with the same shared state as <tt>*this</tt>.
! <p/>
! <ins>-?- <i>Synchronization</i>: Calls to this function do not conflict (1.10 [intro.multithread]) 
! with calls to <tt>set_value</tt>, <tt>set_exception</tt>, <tt>set_value_at_thread_exit</tt>, or
! <tt>set_exception_at_thread_exit</tt>. [<i>Note</i>: Such calls need not be synchronized, but implementations 
! must ensure they do not introduce data races. &mdash; <i>end note</i>]</ins>
! <p/>
! -13- <i>Throws</i>: <tt>future_error</tt> if <tt>*this</tt> has no shared state or if <tt>get_future</tt> has already been called on a
! <tt>promise</tt> with the same shared state as <tt>*this</tt>.
! <p/>
! -14- <i>Error conditions</i>: [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 30.6.9.1 [futures.task.members] around p13 as indicated:</p>
! 
! <blockquote>
! <pre>
! future&lt;R&gt; get_future();
! </pre>
! <blockquote>
! <p>
! -13- <i>Returns</i>: A <tt>future&lt;R&gt;</tt> object that shares the same shared state as <tt>*this</tt>.
! <p/>
! <ins>-?- <i>Synchronization</i>: Calls to this function do not conflict (1.10 [intro.multithread]) 
! with calls to <tt>operator()</tt> or <tt>make_ready_at_thread_exit</tt>. [<i>Note</i>: Such calls need not be 
! synchronized, but implementations must ensure they do not introduce data races. &mdash; <i>end note</i>]</ins>
! <p/>
! -14- <i>Throws</i>: a <tt>future_error</tt> object if an error occurs.
! <p/>
! -15- <i>Error conditions</i>: [&hellip;]
! </p>
! </blockquote>
  </blockquote>
  </li>
  
*************** One can use a <tt>Lock</tt> type that al
*** 6538,6587 ****
  
  
  <hr>
! <h3><a name="1502"></a>1502. [FCD] Specification of [futures.state]</h3>
! <p><b>Section:</b> 30.6.4 [futures.state] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.state">active issues</a> in [futures.state].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.state">issues</a> in [futures.state].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-195</b></p>
  
- The intent and meaning of the paragraph is not apparent.
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1503"></a>1503. [FCD] "associated asynchronous state" must go</h3>
! <p><b>Section:</b> 30.6.4 [futures.state] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-01</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.state">active issues</a> in [futures.state].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.state">issues</a> in [futures.state].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses CH-35</b></p>
  
- The term "associated asynchronous state" is long, ugly
- and misleading terminology. When introduced we agreed
- upon that we should come up with a better name. Here it
- is: "liaison state". Since the state is hidden and provides
- synchronization of a future with its corresponding promise,
- we believe "liaison state" is a much better and shorter
- name (liaison ~ (typically hidden) relationship)
  
- <p><i>[
- Resolution proposed by ballot comment:
- ]</i></p>
  
  <blockquote>
! Change all occurrences of "associated
! asynchronous state" to "liaison state".
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 24604,24851 ----
  
  
  <hr>
! <h3><a name="2413"></a>2413. <tt>assert</tt> macro is overconstrained</h3>
! <p><b>Section:</b> 19.3 [assertions] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> David Krauss <b>Opened:</b> 2014-06-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#assertions">active issues</a> in [assertions].</p>
! <p><b>View all other</b> <a href="lwg-index.html#assertions">issues</a> in [assertions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! When <tt>NDEBUG</tt> is defined, <tt>assert</tt> must expand exactly to the token sequence <tt>((void)0)</tt>, with no 
! whitespace (C99 &sect;7.2/1 and also C11 &sect;7.2/1). This is a lost opportunity to pass the condition along to the optimizer.
! <p/>
! The user may observe the token sequence using the stringize operator or discriminate it by making a matching <tt>#define</tt> 
! directive. There is little chance of practical code doing such things. It's reasonable to allow any expansion that is a <tt>void</tt> 
! expression with no side effects or semantic requirements, for example, an extension keyword or an attribute-specifier finagled 
! into the context.
! <p/>
! Conforming optimizations would still be limited to treating the condition as hint, not a requirement. Nonconformance on this 
! point is quite reasonable though, given user preferences. Anyway, it shouldn't depend on preprocessor quirks.
! <p/>
! As for current practice, Darwin OS <tt>&lt;assert.h&gt;</tt> provides a GCC-style compiler hint <tt>__builtin_expect</tt> but only in 
! debug mode. Shouldn't release mode preserve hints?
! <p/>
! Daniel:
! <p/>
! The corresponding resolution should take care not to conflict with the intention behind LWG <a href="lwg-active.html#2234">2234</a>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2414"></a>2414. Member function reentrancy should be implementation-defined</h3>
! <p><b>Section:</b> 17.6.5.8 [reentrancy] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-07-01 <b>Last modified:</b> 2015-05-05</p>
! <p><b>View all other</b> <a href="lwg-index.html#reentrancy">issues</a> in [reentrancy].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! N3936 17.6.5.8 [reentrancy]/1 talks about "functions", but that doesn't address the scenario of calling different member 
! functions of a single object. Member functions often have to violate and then re-establish invariants. For example, vectors 
! often have "holes" during insertion, and element constructors/destructors/etc. shouldn't be allowed to observe the vector 
! while it's in this invariant-violating state. The [reentrancy] Standardese should be extended to cover member functions, 
! so that implementers can either say that member function reentrancy is universally prohibited, or selectively allowed for 
! very specific scenarios.
! <p/>
! (For clarity, this issue has been split off from LWG <a href="lwg-closed.html#2382">2382</a>.)
! </p>
! 
! <p><i>[2014-11-03 Urbana]</i></p>
! 
! <p>
! AJM confirmed with SG1 that they had no special concerns with this issue, and LWG should retain ownership.
! <p/>
! AM: this is too overly broad as it also covers calling the exact same member function on a different object<br/>
! STL: so you insert into a map, and copying the value triggers another insertion into a different map of the same type<br/>
! GR: reentrancy seems to imply the single-threaded case, but needs to consider the multi-threaded case
! <p/>
! Needs more wording.
! </p>
! <p>
! Move to Open
! </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3936.</p>
+ 
+ <ol>
+ <li><p>Change 17.6.5.8 [reentrancy] p1 as indicated:</p>
+ <blockquote>
+ <p>
+ -1- Except where explicitly specified in this standard, it is implementation-defined which functions <ins>(including different 
+ member functions called on a single object)</ins> in the Standard C++ library may be recursively reentered.
+ </p>
+ </blockquote>
+ </li>
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2417"></a>2417. [fund.ts] <tt>std::experimental::optional::operator&lt;</tt> and <tt>LessThanComparable</tt> requirement</h3>
! <p><b>Section:</b> X [optional.relops], X [optional.comp_with_t] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2014-06-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! <p>
! Currently, <tt>std::experimental::optional::operator==</tt> imposes the <tt>EqualityComparable</tt> requirement which provides
! two guarantees: It ensures that <tt>operator!=</tt> can rely on the equivalence-relation property and more importantly, that
! the <tt>BooleanTestable</tt> requirements suggested by issue <a href="lwg-active.html#2114">2114</a> are automatically implied.
! <p/>
! <tt>std::experimental::optional::operator&lt;</tt> doesn't provide a <tt>LessThanComparable</tt> requirement, but there was quite
! an historic set of changes involved with that family of types: As of 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3527.html">N3527</a>
! this operator was defined in terms of <tt>operator&lt;</tt> of the contained type <tt>T</tt> and imposed the <tt>LessThanComparable</tt> 
! requirement. In the final acceptance step of <tt>optional</tt> by the committee, the definition was expressed in terms of <tt>std::less</tt>
! and the <tt>LessThanComparable</tt> requirement had been removed.
! <p/>
! The inconsistency between <tt>operator==</tt> and <tt>operator&lt;</tt> should be removed. One possible course of action would be 
! to add the <tt>LessThanComparable</tt> to <tt>std::experimental::optional::operator&lt;</tt>. The <tt>EqualityComparable</tt> requirement
! of <tt>operator==</tt> could also be removed, but in that case both operators would at least need to require the <tt>BooleanTestable</tt> 
! requirements (see <a href="lwg-active.html#2114">2114</a>) for the result type of <tt>T</tt>'s <tt>operator==</tt> and <tt>operator&lt;</tt>. 
! <p/>
! Arguably, corresponding operators for <tt>pair</tt> and <tt>tuple</tt> do not impose <tt>LessThanComparable</tt> (nor
! <tt>EqualityComparable</tt>), albeit the definition of the "derived" relation functions depend on properties ensured by
! <tt>LessThanComparable</tt>. According to the <a href="https://www.sgi.com/tech/stl/pair.html">SGI definition</a>, the intention was
! to imposed both <tt>EqualityComparable</tt> and <tt>LessThanComparable</tt>. If this is not intended, the standard should clarify
! this position.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! VV, DK, JY discuss why and when <tt>LessThanComparable</tt> was removed. AM: Move to LEWG. Please tell LWG when you look at it. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
  
  
  
+ 
+ <hr>
+ <h3><a name="2419"></a>2419. Clang's libc++ extension to <tt>std::tuple</tt></h3>
+ <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
+  <b>Submitter:</b> Akim Demaille <b>Opened:</b> 2014-07-11 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#tuple.cnstr">active issues</a> in [tuple.cnstr].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The issue has been submitted after exchanges with the clang++ team
+ as a consequence of two PR I sent:
+ <p/>
+ <a href="http://llvm.org/bugs/show_bug.cgi?id=20174">Issue 20174</a>
+ <p/>
+ <a href="http://llvm.org/bugs/show_bug.cgi?id=20175">Issue 20175</a>
+ <p/>
+ The short version is shown in the program below:
+ </p>
  <blockquote>
! <pre>
! #include &lt;iostream&gt;
! #include &lt;tuple&gt;
! 
! struct base
! {
!   void out(const std::tuple&lt;char, char&gt;&amp; w) const
!   {
!     std::cerr &lt;&lt; "Tuple: " &lt;&lt; std::get&lt;0&gt;(w) &lt;&lt; std::get&lt;1&gt;(w) &lt;&lt; '\n';
!   }
! };
! 
! struct decorator
! {
!   base b_;
! 
!   template &lt;typename... Args&gt;
!   auto
!   out(Args&amp;&amp;... args)
!     -> decltype(b_.out(args...))
!   {
!     return b_.out(args...);
!   }
! 
!   void out(const char&amp; w)
!   {
!     std::cerr &lt;&lt; "char: " &lt;&lt; w &lt;&lt; '\n';
!   }
! };
! 
! int main()
! {
!   decorator d{base{}};
!   char l = 'a';
!   d.out(l);
! }
! </pre>
  </blockquote>
+ <p>
+ This is a stripped down version of a real world case where I
+ wrap objects in decorators.  These decorators contributes some
+ functions, and forward all the rest of the API to the wrapped
+ object using perfect forwarding.  There can be overloaded names.
+ <p/>
+ Here the inner object provides an
+ </p>
+ <blockquote><pre>
+ out(const std::tuple&lt;char, char&gt;&amp;) -&gt; void
+ </pre></blockquote>
+ <p>
+ function, and the wrappers, in addition to perfect forwarding,
+ provides
+ </p>
+ <blockquote><pre>
+ out(const char&amp;) -&gt; void
+ </pre></blockquote>
+ <p>
+ The main function then call <tt>out(l)</tt> where <tt>l</tt> is a <tt>char</tt> lvalue.
+ <p/>
+ With (GCC's) libstdc++ I get the expected result: the <tt>char</tt>
+ overload is run.  With (clang++'s) libc++ it is the tuple
+ version which is run.
+ </p>
+ <blockquote><pre>
+ $ g++-mp-4.9 -std=c++11 bar.cc &amp;&amp; ./a.out
+ char: a
+ $ clang++-mp-3.5 -std=c++11 bar.cc -Wall &amp;&amp; ./a.out
+ Tuple: a
+ </pre></blockquote>
+ <p>
+ It turns out that this is the result of an extension of <tt>std::tuple</tt>
+ in libc++ where they accept constructors with fewer values that
+ tuple elements.
+ <p/>
+ The purpose of this issue is to ask the standard to forbid
+ that this extension be allowed to participate in overload resolution.
+ </p>
+ 
+ <p><i>[2014-10-05, Daniel comments]</i></p>
+ 
+ <p>
+ This issue is closely related to LWG <a href="lwg-active.html#2312">2312</a>.
+ </p>
+ 
+ <p><i>[2014-11 Urbana]</i></p>
+ 
+ <p>
+ Moved to LEWG.
+ </p>
+ <p>
+ Extensions to <tt>tuple</tt>'s design are initially a question for LEWG.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** asynchronous state" to "liaison state".
*** 6591,6637 ****
  
  
  <hr>
! <h3><a name="1504"></a>1504. [FCD] Term "are serialized" is not defined</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-196</b></p>
  
! The term "are serialized" is not defined (30.6.5 [futures.promise] p. 21, 25).
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  <blockquote>
! Replace "are serialized" with "shall not introduce a data race (17.6.4.8)".
  </blockquote>
  
! <p><i>[
! 2010-11-02 Daniel translates proposal into proper wording changes
! ]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change 30.6.5 [futures.promise] p. 21 as indicated:
  <blockquote>
! 21 <em>Synchronization</em>: calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object <del>are serialized</del><ins>shall not introduce a data race ([res.on.data.races])</ins>.
! [ <em>Note</em>: and they synchronize and serialize with other functions through the referred associated asynchronous
! state. — <em>end note</em> ]
  </blockquote>
  </li>
! <li>Change 30.6.5 [futures.promise] p. 25 as indicated:
  <blockquote>
! 25 <em>Synchronization</em>: calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object <del>are serialized</del><ins>shall not introduce a data race ([res.on.data.races])</ins>.
! [ <em>Note</em>: and they synchronize and serialize with other functions through the referred associated asynchronous
! state. — <em>end note</em> ]
  </blockquote>
  </li>
  </ol>
--- 24855,25088 ----
  
  
  <hr>
! <h3><a name="2421"></a>2421. Non-specification of handling zero size in <tt>std::align</tt> [ptr.align]</h3>
! <p><b>Section:</b> 20.7.5 [ptr.align] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Melissa Mears <b>Opened:</b> 2014-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ptr.align">issues</a> in [ptr.align].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! The specification of <tt>std::align</tt> does not appear to specify what happens when the value of the <tt>size</tt> 
! parameter is 0. (The question of what happens when <tt>alignment</tt> is 0 is mentioned in another Defect Report, <a href="lwg-defects.html#2377">2377</a>; 
! it would change the behavior to be undefined rather than potentially implementation-defined.)
! <p/>
! The case of <tt>size</tt> being 0 is interesting because the result is ambiguous. Consider the following code's output:
! </p>
! <blockquote>
! <pre>
! #include &lt;cstdio&gt;
! #include &lt;memory&gt;
  
! int main()
! {
!   alignas(8) char buffer[8];
!   void *ptr = &amp;buffer[1];
!   std::size_t space = sizeof(buffer) - sizeof(char[1]);
  
!   void *result = std::align(8, 0, ptr, space);
  
+   std::printf("%d %td\n", !!result, result ? (static_cast&lt;char*&gt;(result) - buffer) : std::ptrdiff_t(-1));
+ }
+ </pre>
+ </blockquote>
+ <p>
+ There are four straightforward answers as to what the behavior of <tt>std::align</tt> with size 0 should be:
+ </p>
+ <ol>
+ <li><p>The behavior is undefined because the size is invalid.</p></li>
+ <li><p>The behavior is implementation-defined. This seems to be the status quo, with current implementations using #3.</p></li>
+ <li><p>Act the same as <tt>size == 1</tt>, except that if <tt>size == 1</tt> would fail but would be defined and succeed 
+ if space were exactly 1 larger, the result is a pointer to the byte past the end of the <tt>ptr</tt> buffer. That is, the 
+ "aligned" version of a 0-byte object can be one past the end of an allocation. Such pointers are, of course, valid when not 
+ dereferenced (and a "0-byte object" shouldn't be), but whether that is desired is not specified in the Standard's definition 
+ of <tt>std::align</tt>, it appears. The output of the code sample is "<tt>1 8</tt>" in this case.</p></li>
+ <li><p>Act the same as <tt>size == 1</tt>; this means that returning "one past the end" is not a possible result. In this case, 
+ the code sample's output is "<tt>0 -1</tt>".</p></li>
+ </ol>
+ <p>
+ The two compilers I could get working with <tt>std::align</tt>, Visual Studio 2013 and Clang 3.4, implement #3. (Change <tt>%td</tt> to 
+ <tt>%Id</tt> on Visual Studio 2013 and earlier. 2014 and later will have <tt>%td</tt>.)
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2422"></a>2422. <tt>std::numeric_limits&lt;T&gt;::is_modulo</tt> description: "most machines" errata</h3>
+ <p><b>Section:</b> 18.3.2.4 [numeric.limits.members] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Melissa Mears <b>Opened:</b> 2014-08-06 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View all other</b> <a href="lwg-index.html#numeric.limits.members">issues</a> in [numeric.limits.members].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The seemingly non-normative (?) paragraph 61 (referring to N3936) describing how "most machines" define 
+ <tt>std::numeric_limits&lt;T&gt;::is_modulo</tt> in [numeric.limits.members] appears to have some issues, in my opinion.
+ </p>
  <blockquote>
! <p>
! -61- On most machines, this is <tt>false</tt> for floating types, <tt>true</tt> for unsigned integers, and <tt>true</tt> 
! for signed integers.
! </p>
  </blockquote>
+ <p>
+ Issues I see:
+ </p>
+ <ol>
+ <li><p>Very minor: change clause 2 to "this is <tt>false</tt> for floating <ins>point</ins> types". Other uses of the term 
+ say "floating point types" rather than just "floating types" &mdash; see nearby <tt>is_iec559</tt>, <tt>tinyness_before</tt>, 
+ etc.</p></li>
+ <li><p><tt>is_modulo</tt> <em>must</em> be <tt>true</tt> for unsigned integers in order to be compliant with the Standard; 
+ this is not just for "most machines". For reference, this requirement is from [basic.fundamental] paragraph 4 with its 
+ footnote 48.</p></li>
+ <li><p>Depending on the definition of "most machines", <tt>is_modulo</tt> could be <tt>false</tt> for most machines' signed 
+ integer types. GCC, Clang and Visual Studio, the 3 most popular C++ compilers by far, by default treat signed integer overflow 
+ as undefined.</p></li>
+ </ol>
+ <p>
+ As an additional note regarding the definition of <tt>is_modulo</tt>, it seems like it should be explicitly mentioned that 
+ on an implementation for which signed integer overflow is undefined, <tt>is_modulo</tt> shall be <tt>false</tt> for signed 
+ integer types. It took bugs filed for all three of these compilers before they finally changed (or planned to change) 
+ <tt>is_modulo</tt> to <tt>false</tt> for signed types.
+ </p>
  
! <p><i>[2014-12 telecon]</i></p>
! 
! <p>
! HH: agree with the proposal, don't like the phrasing<br/>
! AM: second note feels a bit wooly<br/>
! WB: not even happy with the first note, notes shouldn't say "shall"<br/>
! JW: the original isn't very prescriptive because "on most machines" is not something the standard controls.<br/>
! AM: "On most machines" should become a note too?<br/>
! AM: first note is repeating something defined in core, shouldn't say it normatively here. Change "shall" to "is"?<br/>
! MC: don't like "signed integer overflow is left undefined" ... it's just plain undefined.<br/>
! AM: implementations can define what they do in that case and provide guarantees.<br/>
! WB: in paragraph 61, would like to see "this" replaced by "is_modulo"<br/>
! AM: Move to Open 
! </p>
! 
! <p><i>[2015-05-05 Lenexa]</i></p>
  
+ <p>Marshall: I will contact the submitter to see if she can re-draft the Proposed Resolution</p>
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li><p>Edit 18.3.2.4 [numeric.limits.members] around p60 as indicated:</p>
! 
  <blockquote>
! <pre>
! static constexpr bool is_modulo;
! </pre>
! <p>
! -60- True if the type is modulo.(footnote) A type is modulo if, for any operation involving <tt>+</tt>, <tt>-</tt>, or <tt>*</tt> 
! on values of that type whose result would fall outside the range <tt>[min(),max()]</tt>, the value returned differs from
! the true value by an integer multiple of <tt>max() - min() + 1</tt>.
! <p/>
! <ins>-??- [<i>Note</i>: <tt>is_modulo</tt> shall be <tt>true</tt> for unsigned integer types (3.9.1 [basic.fundamental]). &mdash; 
! <i>end note</i>]</ins>
! <p/>
! <ins>-??- [<i>Note</i>: <tt>is_modulo</tt> shall be <tt>false</tt> for types for which overflow is undefined on the implementation, 
! because such types cannot meet the modulo requirement. Often, signed integer overflow is left undefined on implementations. &mdash; 
! <i>end note</i>]</ins>
! <p/>
! -61- On most machines, this is <tt>false</tt> for floating <ins>point</ins> types<del>, <tt>true</tt> for unsigned integers, 
! and <tt>true</tt> for signed integers</del>.
! <p/>
! -62- Meaningful for all specializations.
! </p>
  </blockquote>
  </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2423"></a>2423. Missing specification <tt>slice_array</tt>, <tt>gslice_array</tt>, <tt>mask_array</tt>, <tt>indirect_array</tt> copy constructor</h3>
! <p><b>Section:</b> 26.6.5 [template.slice.array], 26.6.7 [template.gslice.array], 26.6.8 [template.mask.array], 26.6.9 [template.indirect.array] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Akira Takahashi <b>Opened:</b> 2014-08-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.slice.array">issues</a> in [template.slice.array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I found a missing specification of the copy constructor of the following class templates:
! </p>
! <ul>
! <li><p><tt>slice_array</tt> (26.6.5 [template.slice.array])</p></li>
! <li><p><tt>gslice_array</tt> (26.6.7 [template.gslice.array])</p></li>
! <li><p><tt>mask_array</tt> (26.6.8 [template.mask.array])</p></li>
! <li><p><tt>indirect_array</tt> (26.6.9 [template.indirect.array])</p></li>
! </ul>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>Before 26.6.5.2 [slice.arr.assign] insert a new sub-clause as indicated:</p>
! 
! <p>
! <ins><b>-?- <tt>slice_array</tt> constructors [slice.arr.cons]</b></ins>
! </p>
  <blockquote>
! <pre>
! <ins>slice_array(const slice_array&amp;);</ins>
! </pre>
! <p>
! <ins>-?- <i>Effects</i>: The constructed slice refers to the same <tt>valarray&lt;T&gt;</tt> object to which
! the argument slice refers.</ins>
! </p>
! </blockquote>
! </li>
! 
! <li><p>Before 26.6.7.2 [gslice.array.assign] insert a new sub-clause as indicated:</p>
! 
! <p>
! <ins><b>-?- <tt>gslice_array</tt> constructors [gslice.array.cons]</b></ins>
! </p>
! <blockquote>
! <pre>
! <ins>gslice_array(const gslice_array&amp;);</ins>
! </pre>
! <p>
! <ins>-?- <i>Effects</i>: The constructed slice refers to the same <tt>valarray&lt;T&gt;</tt> object to which
! the argument slice refers.</ins>
! </p>
! </blockquote>
! </li>
! 
! <li><p>Before 26.6.8.2 [mask.array.assign] insert a new sub-clause as indicated:</p>
! 
! <p>
! <ins><b>-?- <tt>mask_array</tt> constructors [mask.array.cons]</b></ins>
! </p>
! <blockquote>
! <pre>
! <ins>mask_array(const mask_array&amp;);</ins>
! </pre>
! <p>
! <ins>-?- <i>Effects</i>: The constructed slice refers to the same <tt>valarray&lt;T&gt;</tt> object to which
! the argument slice refers.</ins>
! </p>
! </blockquote>
! </li>
! 
! <li><p>Before 26.6.9.2 [indirect.array.assign] insert a new sub-clause as indicated:</p>
! 
! <p>
! <ins><b>-?- <tt>indirect_array</tt> constructors [indirect.array.cons]</b></ins>
! </p>
! <blockquote>
! <pre>
! <ins>indirect_array(const indirect_array&amp;);</ins>
! </pre>
! <p>
! <ins>-?- <i>Effects</i>: The constructed slice refers to the same <tt>valarray&lt;T&gt;</tt> object to which
! the argument slice refers.</ins>
! </p>
  </blockquote>
  </li>
  </ol>
*************** state. — <em>end note</em> ]
*** 6641,6696 ****
  
  
  <hr>
! <h3><a name="1505"></a>1505. [FCD] Synchronization between
! <tt>promise::set_value</tt> and <tt>future::get</tt></h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-197</b></p>
  
! There is no defined synchronization between
! <tt>promise::set_value</tt> and <tt>future::get</tt> (30.6.5 [futures.promise] p. 21, 25).
  
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
  
  <blockquote>
! Replace "[Note: and they synchronize and
! serialize with other functions through the referred
! associated asynchronous state. --end note]" with
! the normative "They synchronize with (1.10) any
! operation on a future object with the same
! associated asynchronous state marked ready."
  </blockquote>
  
! <p><i>[
! 2010-11-02 Daniel translates proposal into proper wording changes
! ]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change 30.6.5 [futures.promise] p. 21 as indicated:
  <blockquote>
! 21 <em>Synchronization</em>: calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object are serialized.
! <del>[ <em>Note</em>: and they synchronize and serialize with other functions through the referred associated asynchronous
! state. — <em>end note</em> ]</del><ins>They <em>synchronize with</em> ([intro.multithread]) any
! operation on a future object with the same associated asynchronous state marked ready.</ins>
  </blockquote>
  </li>
! <li>Change 30.6.5 [futures.promise] p. 25 as indicated:
  <blockquote>
! 25 <em>Synchronization</em>: calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object are serialized.
! <del>[ <em>Note</em>: and they synchronize and serialize with other functions through the referred associated asynchronous
! state. — <em>end note</em> ]</del><ins>They <em>synchronize with</em> ([intro.multithread]) any
! operation on a future object with the same associated asynchronous state marked ready.</ins>
  </blockquote>
  </li>
  </ol>
--- 25092,25451 ----
  
  
  <hr>
! <h3><a name="2424"></a>2424. 29.5 should state that atomic types are not trivially copyable</h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="lwg-active.html#Review">Review</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2014-08-14 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.generic">active issues</a> in [atomics.types.generic].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Review">Review</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! Otherwise, one could use <tt>memcpy</tt> to save and restore the value according to 3.9p2.
! <p/>
! It seems the core language rules in 9 [class]p6 with 12.8 [class.copy]p12 
! (trivial copy constructor) etc. and 8.4.2 [dcl.fct.def.default]p5 (user-provided) say 
! that the atomic types are trivially copyable, which is bad. We shouldn't rely on future core 
! changes in that area and simply say in the library section 29.5 [atomics.types.generic] 
! that these very special types are not trivially copyable.
! </p>
  
! <p><i>[2014-11 Urbana]</i></p>
  
! <p>
! Lawrence:Definition of "trivially copyable" has been changing.
! </p>
! <p>
! Doesn't hurt to add proposed change, even if the sentence is redundant
! </p>
! <p>
! Move to Review.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! GR has a minor problem with the style of the wording. VV has major issues with implementability.
! </p>
! 
! <p><i>[2015-03-22, Jens Maurer responses to Cologne discussion]</i></p>
! 
! <p>
! A library implementation could provide a partial specialization for <tt>is_trivially_copyable&lt;atomic&lt;T&gt;&gt;</tt>, 
! to ensure that any such type query would return <tt>false</tt>.
! <p/>
! Assuming such a specialization would be provided, how could a conforming program observe that per 
! language rules an <tt>atomic</tt> specialization would actually be trivially copyable if there 
! is no way to call the (deleted) copy constructor or copy assignment operator?
! <p/>
! The sole effect of the suggested addition of the constraining sentence is that it would make a user program
! non-conforming that attempts to invoke <tt>memcpy</tt> (and the like) on <tt>atomic</tt> types, since that
! would invoke undefined behaviour.
! </p>
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! SG1 is fine with P/R (and agrees it's needed), but LWG may want to
! check the details; it's not entirely an SG1 issue.
! </p>
! 
! <p><i>[2015-05-05 Lenexa]</i></p>
! 
! <p>Marshall: This was discussed on the telecon. Alisdair was going to write something to Mike and send it to Core.</p>
! <p>Hwrd: Core says that deleted copies are trivially copyable, which makes no sense to Library people.</p>
! <p>STL: There doesn't appear to be a Core issue about it.</p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>Change 29.5 [atomics.types.generic]p3 as indicated:</p>
  
  <blockquote>
! <p>
! Specializations and instantiations of the <tt>atomic</tt> template shall have a deleted copy constructor, a deleted
! copy assignment operator, and a constexpr value constructor. <ins>They are not trivially copyable 
! types (3.9 [basic.types]).</ins>
! </p>
  </blockquote>
+ </li>
+ </ol>
  
! 
! 
! 
! 
! <hr>
! <h3><a name="2426"></a>2426. Issue about <tt>compare_exchange</tt></h3>
! <p><b>Section:</b> 29.6.5 [atomics.types.operations.req] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2014-08-25 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.operations.req">active issues</a> in [atomics.types.operations.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations.req">issues</a> in [atomics.types.operations.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The standard is either ambiguous or misleading about the nature of accesses through the <tt>expected</tt> argument 
! to the <tt>compare_exchange_*</tt> functions in 29.6.5 [atomics.types.operations.req]p21.
! <p/>
! It is unclear whether the access to <tt>expected</tt> is itself atomic (intent clearly no) and exactly when the implementation 
! is allowed to read or write it. These affect the correctness of reasonable code.
! <p/>
! Herb Sutter, summarizing a complaint from Duncan Forster wrote:
! </p>
! <blockquote class="note">
! <p>
! Thanks Duncan,
! <p/>
! I think we have a bug in the standardese wording and the implementations are
! legal, but let's check with the designers of the feature.
! <p/>
! Let me try to summarize the issue as I understand it:
! </p>
! <ol>
! <li><p>
! What I think was intended: Lawrence, I believe you championed having
! <tt>compare_exchange_*</tt> take the <tt>expected</tt> value by reference, and update
! <tt>expected</tt> on failure to expose the old value, but this was only for convenience
! to simplify the calling loops which would otherwise always have to write an
! extra "reload" line of code. Lawrence, did I summarize your intent correctly?
! </p></li>
! <li><p>
! What I think Duncan is trying to do: However, it turns out that, now that
! <tt>expected</tt> is an lvalue, it has misled(?) Duncan into trying to use the success of
! <tt>compare_exchange_*</tt> to hand off ownership <em>of <tt>expected</tt> itself</em> to another
! thread. For that to be safe, if the <tt>compare_exchange_*</tt> succeeds then the
! thread that performed it must no longer read or write from <tt>expected</tt> else his
! technique contains a race. Duncan, did I summarize your usage correctly? Is
! that the only use that is broken?
! </p></li>
! <li><p>
! What the standard says: I can see why Duncan thinks the standard supports
! his use, but I don't think this was intended (I don't remember this being
! discussed but I may have been away for that part) and unless you tell me this
! was intended I think it's a defect in the standard. From 29.6.5 [atomics.types.operations.req]/21:
! </p>
! <blockquote><p>
! -21- <i>Effects</i>: Atomically, compares the contents of the memory pointed to by
! <tt>object</tt> or by <tt>this</tt> for equality with that in <tt>expected</tt>, and if true, replaces the
! contents of the memory pointed to by <tt>object</tt> or by <tt>this</tt> with that in <tt>desired</tt>, and
! if false, updates the contents of the memory in <tt>expected</tt> with the contents of
! the memory pointed to by <tt>object</tt> or by <tt>this</tt>. [&hellip;]
! </p></blockquote>
! <p>
! I think we have a wording defect here in any case, because the "atomically"
! should not apply to the entire sentence &mdash; I'm pretty sure we never intended the
! atomicity to cover the write to <tt>expected</tt>.
! <p/>
! As a case in point, borrowing from Duncan's mail below, I think the following
! implementation is intended to be legal:
! </p>
! <blockquote><pre>
! inline int _Compare_exchange_seq_cst_4(volatile _Uint4_t *_Tgt, _Uint4_t *_Exp, _Uint4_t _Value)
! { /* compare and exchange values atomically with
!      sequentially consistent memory order */
!   int _Res;
!   _Uint4_t _Prev = _InterlockedCompareExchange((volatile long *)_Tgt, _Value, *_Exp);
!   <span style="color:#C80000">if (_Prev == *_Exp) //!!!!! Note the unconditional read from *_Exp here</span>
!     _Res = 1;
!   else
!   { /* copy old value */
!     _Res = 0;
!     *_Exp = _Prev;
!   }
!   return (_Res);
! }
! </pre></blockquote>
! <p>
! I think this implementation is intended to be valid &mdash; I think the only code that
! could be broken with the "!!!!!" read of <tt>*_Exp</tt> is Duncan's use of treating
! <tt>a.compare_exchange_*(expected, desired) == true</tt> as implying <tt>expected</tt> got
! handed off, because then another thread could validly be using <tt>*_Exp</tt> &mdash; but we
! never intended this use, right?
! </p>
! </li>
! </ol>
! </blockquote>
! <p>
! In a different thread Richard Smith wrote about the same problem:
! </p>
! <blockquote class="note">
! <p>
! The <tt>atomic_compare_exchange</tt> functions are described as follows:
! </p>
! <blockquote><p>
! "Atomically, compares the contents of the memory pointed to by <tt>object</tt> or by <tt>this</tt> 
! for equality with that in <tt>expected</tt>, and if true, replaces the contents of the memory pointed to 
! by <tt>object</tt> or by <tt>this</tt> with that in <tt>desired</tt>, and if false, updates the contents 
! of the memory in <tt>expected</tt> with the contents of the memory pointed to by <tt>object</tt> or by 
! <tt>this</tt>. Further, if the comparison is true, memory is affected according to the value of <tt>success</tt>, 
! and if the comparison is false, memory is affected according to the value of <tt>failure</tt>."
! </p></blockquote>
! <p>
! I think this is less clear than it could be about the effects of these operations on <tt>*expected</tt> in the failure case:
! </p>
! <ol>
! <li><p>We have "Atomically, compares [&hellip;] and updates the contents of the memory in <tt>expected</tt> [&hellip;]". 
! The update to the memory in <tt>expected</tt> is clearly not atomic, and yet this wording parallels the success case, 
! in which the memory update is atomic.
! </p></li>
! <li><p>The wording suggests that memory (including <tt>*expected</tt>) is affected according to the value of <tt>failure</tt>. 
! In particular, the failure order could be <tt>memory_order_seq_cst</tt>, which might lead someone to incorrectly think they'd 
! published the value of <tt>*expected</tt>.</p></li>
! </ol>
! <p>
! I think this can be clarified with no change in meaning by reordering the wording a little:
! </p>
! <blockquote><p>
! "Atomically, compares the contents of the memory pointed to by <tt>object</tt> or by <tt>this</tt> for equality with that in 
! <tt>expected</tt>, and if true, replaces the contents of the memory pointed to by <tt>object</tt> or by <tt>this</tt> with 
! that in <tt>desired</tt><del>, and if</del><ins>. If the comparison is true, memory is affected according to the value of 
! <tt>success</tt>, and if the comparison is false, memory is affected according to the value of <tt>failure</tt>. Further, 
! if the comparison is</ins> false, <del>updates</del><ins>replaces</ins> the contents of the memory in <tt>expected</tt> with 
! the <del>contents of</del><ins>value that was atomically read from</ins> the memory pointed to by <tt>object</tt> or by 
! <tt>this</tt>. <del>Further, if the comparison is true, memory is affected according to the value of <tt>success</tt>, and 
! if the comparison is false, memory is affected according to the value of <tt>failure</tt>.</del>"
! </p></blockquote>
! </blockquote>
! <p>
! Jens Maurer add:
! </p>
! <blockquote class="note">
! <p>
! I believe this is an improvement.
! <p/>
! I like to see the following additional improvements:
! </p>
! <ul>
! <li><p>
! "contents of the memory" is strange phrasing, which doesn't say how large the
! memory block is. Do we compare the values or the value representation of the lvalue
! <tt>*object</tt> (or <tt>*this</tt>)?
! </p></li>
! <li><p>
! 29.3 [atomics.order] defines memory order based on the "affected memory location". It would be
! better to say something like "If the comparison is true, the memory synchronization order for the 
! affected memory location <tt>*object</tt> is [&hellip;]"
! </p></li>
! </ul>
! </blockquote>
! <p>
! There was also a discussion thread involving Herb Sutter, Hans Boehm, and Lawrence Crowl, resulting in proposed 
! wording along the lines of:
! </p>
! <blockquote class="note">
! <blockquote>
! <p>
! -21- <i>Effects</i>: Atomically with respect to <tt>expected</tt> and the memory pointed
! to by <tt>object</tt> or by <tt>this</tt>, compares the contents of the memory pointed
! to by <tt>object</tt> or by <tt>this</tt> for equality with that in <tt>expected</tt>, and if and
! only if true, replaces the contents of the memory pointed to by <tt>object</tt>
! or by <tt>this</tt> with that in desired, and if and only if false, updates the
! contents of the memory in expected with the contents of the memory pointed to by 
! <tt>object</tt> or by <tt>this</tt>.
! </p>
! </blockquote>
! <p>
! At the end of paragraph 23, perhaps add
! </p>
! <blockquote>
! <p>
! [<i>Example</i>: Because the <tt>expected</tt> value is updated only on failure,
! code releasing the memory containing the <tt>expected</tt> value on success
! will work. E.g. list head insertion will act atomically and not
! have a data race in the following code.
! </p>
! <blockquote><pre>
! do {
!   p->next = head; // make new list node point to the current head
! } while(!head.compare_exchange_weak(p->next, p)); // try to insert
! </pre></blockquote>
! <p>
! &mdash; <i>end example</i>]
! </p>
! </blockquote>
! </blockquote>
! <p>
! Hans objected that this still gives the misimpression that the update to <tt>expected</tt> is atomic.
! </p>
! 
! <p><i>[2014-11 Urbana]</i></p>
! 
! <p>
! Proposed resolution was added after Redmond.
! </p>
! <p>
! Recommendations from SG1:
! </p>
! <ol>
! <li>Change wording to <del>if true</del><ins>if and only if true</ins>, and change <del>if false</del><ins>if and only if false</ins>.</li>
! <li>If they want to add "respect to" clause, say "respect to object or this".</li>
! <li>In example, load from head should be "head.load(memory_order_relaxed)", because people are going to use example as example of good code.</li>
! </ol>
! 
! <p>
! <i>(wording edits not yet applied)</i>
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! We believed we were done with it, but it was kicked back to us, with the wording we suggested not yet applied.  It may have been that our suggestions were unclear.  Was that the concern?
! </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
+ 
  <ol>
! <li><p>Edit 29.6.5 [atomics.types.operations.req] p21 as indicated:</p>
! 
  <blockquote>
! <p>
! -21- <i>Effects</i>: <ins>Retrieves the value in <tt>expected</tt>. It then a</ins><del>A</del>tomically<del>,</del> 
! compares the contents of the memory pointed to by <tt>object</tt> or by <tt>this</tt> for equality with that 
! <del>in</del><ins>previously retrieved from</ins> <tt>expected</tt>, and if true, replaces the contents of the 
! memory pointed to by <tt>object</tt> or by <tt>this</tt> with that in <tt>desired</tt><del>, and if false, 
! updates the contents of the memory in expected with the contents of the memory pointed to by <tt>object</tt> 
! or by <tt>this</tt>. Further, if</del><ins>. If and only if</ins> the comparison is true, memory is affected according to the value of 
! <tt>success</tt>, and if the comparison is false, memory is affected according to the value of <tt>failure</tt>. 
! When only one <tt>memory_order</tt> argument is supplied, the value of <tt>success</tt> is <tt>order</tt>, 
! and the value of <tt>failure</tt> is <tt>order</tt> except that a value of <tt>memory_order_acq_rel</tt>
! shall be replaced by the value <tt>memory_order_acquire</tt> and a value of <tt>memory_order_release</tt> shall
! be replaced by the value <tt>memory_order_relaxed</tt>. <ins>If the comparison is false then, after the atomic
! operation, the contents of the memory in <tt>expected</tt> are replaced by the value read from <tt>object</tt> or
! by <tt>this</tt> during the atomic comparison.</ins> If the operation returns true, these operations are
! atomic read-modify-write operations (1.10) <ins>on the memory pointed to by <tt>this</tt> or 
! <tt>object</tt></ins>. Otherwise, these operations are atomic load operations <ins>on that memory</ins>.
! </p>
  </blockquote>
  </li>
! 
! <li><p>Add the following example to the end of 29.6.5 [atomics.types.operations.req] p23:</p>
! 
  <blockquote>
! <p>
! -23- [<i>Note</i>: [&hellip;] &mdash; <i>end note</i>] [<i>Example</i>: [&hellip;] &mdash; <i>end example</i>]
! <p/>
! <ins>[<i>Example</i>: Because the expected value is updated only on failure,
! code releasing the memory containing the <tt>expected</tt> value
! on success will work. E.g. list head insertion will act atomically
! and would not introduce a data race in the following code:</ins>
! </p>
! <blockquote>
! <pre><ins>
! do {
!   p-i&gt;next = head; // make new list node point to the current head
! } while(!head.compare_exchange_weak(p-&gt;next, p)); // try to insert
! </ins></pre>
! </blockquote>
! <p>
! <ins>&mdash; <i>end example</i>]</ins>
! </p>
  </blockquote>
  </li>
  </ol>
*************** operation on a future object with the sa
*** 6699,6733 ****
  
  
  
  <hr>
! <h3><a name="1507"></a>1507. [FCD] <tt>promise::<i>XXX</i>_at_thread_exit</tt> functions have no
! synchronization requirements</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-199</b></p>
  
- <tt>promise::<i>XXX</i>_at_thread_exit</tt> functions have no
- synchronization requirements. Specifying synchronization
- for these member functions requires coordinating with the
- words in 30.6.5/21 and 25, which give synchronization
- requirements for <tt>promise::set_value</tt> and
- <tt>promise::set_exception</tt> (30.6.5 [futures.promise] p. 26 ff., p. 29 ff.).
  
- <p><i>[
- Resolution proposed by ballot comment:
- ]</i></p>
  
! <blockquote>
! Change 30.6.5/21 to mention
! set_value_at_thread_exit and
! set_exception_at_thread_exit; with this text,
! replace 30.6.5/25 and add two new paragraphs,
! after 30.6.5/28 and 30.6.5/31.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 25454,25530 ----
  
  
  
+ 
  <hr>
! <h3><a name="2430"></a>2430. Heterogeneous container lookup should be enabled using meta-function instead of nested type</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Tomasz Kami&nacute;ski <b>Opened:</b> 2014-07-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! Currently the heterogeneous lookup in associative container are
! enabled by presence of <tt>is_transparent</tt> nested type in the comparator
! type (23.2.4 [associative.reqmts]). This complicates the definition
! of call wrapper types that want to define <tt>is_transparent</tt> if they wrap
! a callable type that defines <tt>is_transparent</tt>, and requires the target
! to be a complete type in cases where an incomplete type would otherwise be ok.
! <p/>
! Another problem is that users cannot add the <tt>is_transparent</tt> member to
! a third-party comparison type that they do not control, even if they
! know it supports heterogeneous comparisons.
! <p/>
! If the associative containers used a trait instead of checking for an
! <tt>is_transparent</tt> member type then it would avoid the requirement for
! complete types, and would allow customization of the trait without
! modifying the comparator type. This would also be consistent with the
! traits <tt>is_placeholder</tt> and <tt>is_bind_expression</tt>.
! <p/>
! For backward compatibility with the existing design, the default
! implementation of the <tt>is_transparent</tt> trait could depend on the
! presence of the <tt>is_transparent</tt> nested type.
! </p>
! 
! <p><i>[2014-11 Urbana]</i></p>
! 
! <p>Move to LEWG</p>
! <p>
! Request for a new metafunction should first be responded to by LEWG.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
  
  
  
! 
! 
! <hr>
! <h3><a name="2431"></a>2431. Missing regular expression traits requirements</h3>
! <p><b>Section:</b> 28.3 [re.req] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-09-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The requirements on the traits class in 28.3 [re.req] do not say whether a
! regular expression traits class is required to be <tt>DefaultConstructible</tt>, 
! <tt>CopyConstructible</tt>, <tt>CopyAssignable</tt> etc.
! <p/>
! The <tt>std::regex_traits</tt> class appears to be all of the above, but can
! <tt>basic_regex</tt> assume that for user-defined traits classes?
! <p/>
! Should the following statements all leave <tt>u</tt> in equivalent states?
! </p>
! <blockquote><pre>
! X u{v};
! X u; u = v;
! X u; u.imbue(v.getloc();
! </pre></blockquote>
! <p>
! Whether they are equivalent has implications for <tt>basic_regex</tt> copy construction and 
! assignment.
! </p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** after 30.6.5/28 and 30.6.5/31.
*** 6737,7284 ****
  
  
  <hr>
! <h3><a name="1514"></a>1514. [FCD] <tt>packaged_task</tt> constructors need review</h3>
! <p><b>Section:</b> 30.6.10.1 [futures.task.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.task.members">active issues</a> in [futures.task.members].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-207</b></p>
  
- The constructor that takes R(*)(ArgTypes...) is not
- needed; the constructor that takes a callable type works
- for this argument type. More generally, the constructors
- for packaged_task should parallel those for function.
  
- <p><i>[
- US-207 Suggested Resolution:
- ]</i></p>
  
  
  <blockquote>
! Review the constructors for packaged_task and
! provide the same ones as function, except where
! inappropriate.
  </blockquote>
  
! <p><i>[
! 2010-10-22 Howard provides wording, as requested by the LWG in Rapperswil.
! ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
! Alter the list of constructors in both [futures.task] and in [futures.task.members] as indicated:
  
  <blockquote>
! <pre><del>template &lt;class F&gt;
! explicit packaged_task(F f);
! template &lt;class F, class Allocator&gt;
! explicit packaged_task(allocator_arg_t, const Allocator&amp; a, F f);
! explicit packaged_task(R(*f)(ArgTypes...));</del>
! template &lt;class F&gt;
! explicit packaged_task(F&amp;&amp; f);
! template &lt;class F, class Allocator&gt;
! explicit packaged_task(allocator_arg_t, const Allocator&amp; a, F&amp;&amp; f);
  </pre>
  </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1515"></a>1515. [FCD] <tt>packaged_task::make_ready_at_thread_exit</tt> has no
! synchronization requirements</h3>
! <p><b>Section:</b> 30.6.10.1 [futures.task.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.task.members">active issues</a> in [futures.task.members].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-208</b></p>
  
  <p>
! <tt>packaged_task::make_ready_at_thread_exit</tt> has no
! synchronization requirements.
  </p>
  
- <p><i>[
- Resolution proposed by ballot comment:
- ]</i></p>
  
  <p>
! Figure out what the synchronization requirements
! should be and write them.
  </p>
  
  
  
- <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1521"></a>1521. Requirements on internal pointer representations in containers</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Mike Spertus <b>Opened:</b> 2010-10-16 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
- <p><b>Addresses US-104, US-141</b></p>
- 
  <p>
! The standard doesn't say that containers should use abstract pointer 
! types internally. Both Howard and Pablo agree that this is the intent. 
! Further, it is necessary for containers to be stored, for example, in 
! shared memory with an interprocess allocator (the type of scenario that 
! allocators are intended to support).
  </p>
  <p>
! In spite of the (possible) agreement on intent, it is necessary to make 
! this explicit:
  </p>
  <p>
! An implementations may like to store the result of dereferencing the 
! pointer (which is a raw reference) as an optimization, but that prevents 
! the data structure from being put in shared memory, etc. In fact, a 
! container could store raw references to the allocator, which would be a 
! little weird but conforming as long as it has one by-value copy. 
! Furthermore, pointers to locales, ctypes, etc. may be there, which also 
! prevents the data structure from being put in shared memory, so we 
! should make explicit that a container does not store raw pointers or 
! references at all.
  </p>
  
! <p><i>[
! Pre-batavia
! ]</i></p>
  
  <p>
! This issue is being opened as part of the response to NB comments US-104/141. 
! See paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3171.pdf">N3171</a>
! in the pre-Batavia mailing. 
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to the end of 23.2.1 [container.requirements.general] p. 8:
  </p>
  <blockquote>
! [..] In all container types defined in this Clause, the member <tt>get_allocator()</tt> returns 
! a copy of the allocator used to construct the container or, if that allocator has been replaced, 
! a copy of the most recent replacement. <ins>The container may not store internal objects whose 
! types are of the form  <tt>T *</tt> or <tt>T &amp;</tt> except insofar as they are part of the 
! item type or members.</ins>
  </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1523"></a>1523. [FCD] <tt>noexcept</tt> for Clause 29</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2010-11-13 <b>Last modified:</b> 2010-11-14</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-63 for Clause 29</b></p>
  
! <p>Clause 29 does not specify noexcept for any of the atomic operations.
! It probably should, though that's not completely clear.
! In particular, atomics may want to throw in implementations that support transactional memory.
  </p>
  
  
! <p><b>Proposed resolution:</b></p>
  <p>
  </p>
  
  
  
  
  
  <hr>
! <h3><a name="2000"></a>2000. Missing definition of <tt>packaged_task</tt> specialization of <tt>uses_allocator</tt></h3>
! <p><b>Section:</b> 30.6.10.2 [futures.task.nonmembers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Tentatively Ready</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-08-29 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively Ready">Tentatively Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! [futures.task.nonmembers]/3 says:
! </p><blockquote><pre>   template &lt;class R, class Alloc&gt;
!      struct uses_allocator&lt;packaged_task&lt;R&gt;, Alloc&gt;;
! </pre></blockquote>
  
! This is a declaration, but should be a definition.
! <p></p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change [futures.task.nonmembers]/3:
  </p>
  
! <blockquote><pre>   template &lt;class R, class Alloc&gt;
!      struct uses_allocator&lt;packaged_task&lt;R&gt;, Alloc&gt;<del>;</del>
!         <ins>: true_type {};</ins>
! </pre></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="2001"></a>2001. Class template <tt>basic_regex</tt> uses non existent <tt>string_type</tt></h3>
! <p><b>Section:</b> 28.8.3 [re.regex.assign] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Volker Lukas <b>Opened:</b> 2010-10-21 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In working draft N3126, subclause 28.8.3 [re.regex.assign], paragraphs 12, 13 and 19, 
! the name <tt>string_type</tt> is used. This is presumably a typedef for <tt>basic_string&lt;value_type&gt;</tt>, where 
! <tt>value_type</tt> is the character type used by <tt>basic_regex</tt>. The <tt>basic_regex</tt> 
! template however defines no such typedef, and neither does the <tt>&lt;regex&gt;</tt> 
! header or the <tt>&lt;initializer_list&gt;</tt> header included by <tt>&lt;regex&gt;</tt>.
  </p>
  
! <p><i>[
! 2010-11-03 Daniel comments and suggests alternative wording:
! ]</i></p>
  
! <blockquote>
! The proposed resolution needs to use <tt>basic_string&lt;<strong>charT</strong>&gt;</tt> instead of <tt>basic_string&lt;char&gt;</tt>
! </blockquote>
  
- <p>Proposed Resolution:</p>
  
! Make the following changes to [re.regex.assign]:<p>
  
! </p><blockquote>
! <pre>basic_regex&amp; assign(const charT* ptr, flag_type f = regex_constants::ECMAScript);
! </pre>
  <blockquote>
! 12 <i>Returns</i>: <tt>assign(<del>string_type</del><ins>basic_string&lt;charT&gt;</ins>(ptr), f)</tt>. 
  </blockquote>
  
! <pre>basic_regex&amp; assign(const charT* ptr, size_t len,
!   flag_type f = regex_constants::ECMAScript);
! </pre>
  <blockquote>
! 13 <i>Returns</i>: <tt>assign(<del>string_type</del><ins>basic_string&lt;charT&gt;</ins>(ptr, len), f)</tt>.
  </blockquote>
  
- <pre>[..]
  
- template &lt;class InputIterator&gt; 
-   basic_regex&amp; assign(InputIterator first, InputIterator last, 
-                           flag_type f = regex_constants::ECMAScript);
- </pre>
  
  <blockquote>
! 18 <i>Requires</i>: The type <tt>InputIterator</tt> shall satisfy the requirements for an Input Iterator (24.2.3).
  </blockquote>
  
  <blockquote>
! 19 <i>Returns</i>: <tt>assign(<del>string_type</del><ins>basic_string&lt;charT&gt;</ins>(first, last), f)</tt>.
  </blockquote>
  
  </blockquote>
  
! <p><i>[
! 2010 Batavia 
! ]</i></p>
  
  
  <p>
! Unsure if we should just give <tt>basic_regex</tt> a <tt>string_type</tt> typedef. Looking for when <tt>string_type</tt> was 
! introduced into <tt>regex</tt>. Howard to draft wording for <tt>typedef typename traits::string_type string_type</tt>, then move to Review. 
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Make the following changes to [re.regex.assign]:</p>
  
  <blockquote>
  
! <pre>basic_regex&amp; assign(const charT* ptr, flag_type f = regex_constants::ECMAScript);
  </pre>
  <blockquote>
! 12 <i>Returns</i>: <tt>assign(<del>string_type</del><ins>basic_string&lt;char&gt;</ins>(ptr), f)</tt>. 
  </blockquote>
! 
! <pre>basic_regex&amp; assign(const charT* ptr, size_t len,
!   flag_type f = regex_constants::ECMAScript);
! </pre>
  <blockquote>
! 13 <i>Returns</i>: <tt>assign(<del>string_type</del><ins>basic_string&lt;char&gt;</ins>(ptr, len), f)</tt>.
  </blockquote>
  
! <pre>[..]
  
! template &lt;class InputIterator&gt; 
!   basic_regex&amp; assign(InputIterator first, InputIterator last, 
!                           flag_type f = regex_constants::ECMAScript);
  </pre>
  
  <blockquote>
! 18 <i>Requires</i>: The type <tt>InputIterator</tt> shall satisfy the requirements for an Input Iterator (24.2.3).
  </blockquote>
  
  <blockquote>
! 19 <i>Returns</i>: <tt>assign(<del>string_type</del><ins>basic_string&lt;char&gt;</ins>(first, last), f)</tt>.
  </blockquote>
  
  </blockquote>
  
  
  
  
  
  
  <hr>
! <h3><a name="2003"></a>2003. String exception inconsistency in erase.</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> JoseÌ� Daniel GarciÌ�a SaÌ�nchez <b>Opened:</b> 2010-10-21 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Clause 21.4.1 [string.require]p3 states:
  </p>
! <blockquote>
! No <tt>erase()</tt> or <tt>pop_back()</tt> member function shall throw
! any exceptions.
! </blockquote>
  <p>
! However in 21.4.6.5 [string::erase] p2 the first version of <tt>erase</tt> has
  </p>
  <blockquote>
! <i>Throws</i>: <tt>out_of_range</tt> if <tt>pos &gt; size()</tt>.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  <p>
! Update [string.require]p/3:
  </p>
  <blockquote>
! 3 No <del><tt>erase()</tt> or</del> <tt>pop_back()</tt> member function
! shall throw any exceptions.
  </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="2004"></a>2004. <tt>duration::operator*</tt> has template parameters in funny order</h3>
! <p><b>Section:</b> 20.11.3.5 [time.duration.nonmember] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Tentatively Ready</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2010-10-14 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.duration.nonmember">issues</a> in [time.duration.nonmember].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively Ready">Tentatively Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In [time] and [time.duration.nonmember] we have:
  </p>
! <blockquote><pre>template &lt;class Rep1, class Period, class Rep2&gt;
!     duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
!         operator*(const Rep1&amp; s, const duration&lt;Rep2, Period&gt;&amp; d);
! </pre></blockquote>
  <p>
! Everywhere else, we always have <tt>&lt;rep, period&gt;</tt> in that order for a given
! type. But here, we have <tt>Period</tt> and <tt>Rep2</tt> in reverse order for
! <tt>&lt;Rep2, Period&gt;</tt>. This is probably of little importance, since the
! template parameters are seldom spelled out for a function like this. But changing it
! now will eliminate a potential source of future errors and confusion.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the signature in [time] and [time.duration.nonmember] to:
  </p>
! <blockquote><pre>template &lt;class Rep1, class <del>Period</del><ins>Rep2</ins>, class <del>Rep2</del><ins>Period</ins>&gt;
!     duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
!         operator*(const Rep1&amp; s, const duration&lt;Rep2, Period&gt;&amp; d);
! </pre></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="2005"></a>2005. <tt>unordered_map::insert(T&amp;&amp;)</tt> protection should apply to <tt>map</tt> too</h3>
! <p><b>Section:</b> 23.6.1.3 [map.modifiers], 23.6.2.2 [multimap.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2010-10-14 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In [unord.map.modifiers], the signature:
! </p><blockquote><pre>template &lt;class P&gt;
!     pair&lt;iterator, bool&gt; insert(P&amp;&amp; obj);
! </pre></blockquote>
! now has an added Remarks paragraph:
! <p></p>
  <blockquote>
! <i>Remarks</i>: This signature shall not participate in overload resolution unless <tt>P</tt>
! is implicitly convertible to <tt>value_type</tt>.
  </blockquote>
  <p>
! The same is true for <tt>unordered_multimap</tt>.
  </p>
  <p>
! But neither <tt>map</tt> nor <tt>multimap</tt> have this constraint, even though it is a
! Good Thing(TM) in those cases as well.
  </p>
  
- <p><i>[
- The submitter suggests: Add the same Remarks clause to [map.modifiers] and [multimap.modifiers].
- ]</i></p>
  
  
- <p><i>[
- 2010-10-29 Daniel comments:
- ]</i></p>
  
  
  <p>
! I believe both paragraphs need more cleanup: First, the current Requires element conflict with the Remark; 
! second, it seems to me that the whole single Requires element is intended to be split into a Requires
! and an Effects element; third, the reference to <tt>tuple</tt> is incorrect (noticed by Paolo Carlini);
! fourth, it refers to some non-existing <tt>InputIterator</tt> parameter relevant for a completely different
! overload; sixth, the return type of the overload with hint is wrong.
! The following proposed resolution tries to solve these issues as well and uses similar wording as for
! the corresponding unordered containers. Unfortunately it has some redundancy over Table&nbsp;99, but I did
! not remove the specification because of the more general template parameter <tt>P</tt> - the Table&nbsp;99 
! requirements apply only for an argument <em>identical</em> to <tt>value_type</tt>.
  </p>
  
  <p>
! Proposed resolution:
  </p>
  
  <p>
! </p><ol>
! <li>Change 23.6.1.3 [map.modifiers] around p. 1 as indicated:
! <blockquote><pre>template &lt;class P&gt; pair&lt;iterator, bool&gt; insert(P&amp;&amp; x);
! template &lt;class P&gt; <del>pair&lt;</del>iterator<del>, bool&gt;</del> insert(const_iterator position, P&amp;&amp; x);
! </pre><blockquote>
! 1 <em>Requires</em>: <del><tt>P</tt> shall be convertible to </del><tt>value_type</tt><ins> is constructible 
! from <tt>std::forward&lt;P&gt;(x)</tt>.</ins>.
  <p>
! <del>If <tt>P</tt> is instantiated as a reference type, then the argument <tt>x</tt> is copied from. Otherwise <tt>x</tt> is considered
! to be an rvalue as it is converted to <tt>value_type</tt> and inserted into the map. Specifically, in
! such cases <tt>CopyConstructible</tt> is not required of <tt>key_type</tt> or <tt>mapped_type</tt> unless the conversion
! from <tt>P</tt> specifically requires it (e.g., if <tt>P</tt> is a <tt>tuple&lt;const key_type, mapped_type&gt;</tt>, then <tt>key_type</tt>
! must be <tt>CopyConstructible</tt>). The signature taking <tt>InputIterator</tt> parameters does not require
! <tt>CopyConstructible</tt> of either <tt>key_type</tt> or <tt>mapped_type</tt> if the dereferenced <tt>InputIterator</tt> returns a
! non-const rvalue <tt>pair&lt;key_type,mapped_type&gt;</tt>. Otherwise <tt>CopyConstructible</tt> is required for both
! <tt>key_type</tt> and <tt>mapped_type</tt>.</del><br>
! <ins>? <em>Effects</em>: Inserts <tt>x</tt> converted to <tt>value_type</tt> if and only if there is no element in the container with
! key equivalent to the key of <tt>value_type(x)</tt>. For the second form, the iterator <tt>position</tt> is a hint pointing to where the
! search should start.</ins>
! </p><p>
! <ins>? <em>Returns</em>: For the first form, the <tt>bool</tt> component of the returned <tt>pair</tt> object indicates whether the 
! insertion took place and the iterator component - or for the second form the returned iterator - points to the element with key equivalent 
! to the key of <tt>value_type(x)</tt>.</ins>
! </p><p>
! <ins>? <em>Complexity</em>: Logarithmic in general, but amortized constant if <tt>x</tt> is inserted right before <tt>position</tt>.</ins>
! </p><p>
! <ins>? <em>Remarks</em>: These signatures shall not participate in overload resolution unless <tt>P</tt> 
! is implicitly convertible to <tt>value_type</tt>.</ins>
! </p></blockquote></blockquote>
  </li>
! <li>Change 23.6.2.2 [multimap.modifiers] around p. 1 as indicated:
! <blockquote><pre>template &lt;class P&gt; iterator insert(P&amp;&amp; x);
! template &lt;class P&gt; iterator insert(const_iterator position, P&amp;&amp; x);
! </pre><blockquote>
! 1 <em>Requires</em>: <del><tt>P</tt> shall be convertible to </del><tt>value_type</tt> <ins>is constructible from 
! <tt>std::forward&lt;P&gt;(x)</tt></ins>.
  <p>
! <del>If <tt>P</tt> is instantiated as a reference type, then the argument <tt>x</tt> is copied from. Otherwise 
! <tt>x</tt> is considered to be an rvalue as it is converted to <tt>value_type</tt> and inserted into the map. 
! Specifically, in such cases <tt>CopyConstructible</tt> is not required of <tt>key_type</tt> or <tt>mapped_type</tt> 
! unless the conversion from <tt>P</tt> specifically requires it (e.g., if <tt>P</tt> is a <tt>tuple&lt;const key_type, mapped_type&gt;</tt>, 
! then <tt>key_type</tt> must be <tt>CopyConstructible</tt>). The signature taking <tt>InputIterator</tt> parameters 
! does not require <tt>CopyConstructible</tt> of either <tt>key_type</tt> or <tt>mapped_type</tt> if the dereferenced 
! <tt>InputIterator</tt> returns a non-const rvalue <tt>pair&lt;key_type, mapped_type&gt;</tt>. Otherwise <tt>CopyConstructible</tt> 
! is required for both <tt>key_type</tt> and <tt>mapped_type</tt>.</del><br>
! <ins>? <em>Effects</em>: Inserts <tt>x</tt> converted to <tt>value_type</tt>. For the second form, the iterator <tt>position</tt> 
! is a hint pointing to where the search should start.</ins>
! </p><p>
! <ins>? <em>Returns</em>: An iterator that points to the element with key equivalent to the key of <tt>value_type(x)</tt>.</ins>
! </p><p>
! <ins>? <em>Complexity</em>: Logarithmic in general, but amortized constant if <tt>x</tt> is inserted right before <tt>position</tt>.</ins>
! </p><p>
! <ins>? <em>Remarks</em>: These signatures shall not participate in overload resolution unless <tt>P</tt> 
! is implicitly convertible to <tt>value_type</tt>.</ins>
! </p></blockquote></blockquote>
  </li>
  </ol>
! <p></p>
  
! <p><i>[
! 2010 Batavia:
! ]</i></p>
  
  
  <p>
! We need <tt>is_convertible</tt>, not <tt>is_constructible</tt>, both in ordered and unordered containers. 
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Add a new Remarks element after 23.6.1.3 [map.modifiers] p. 1:
! <blockquote><pre>template &lt;class P&gt; pair&lt;iterator, bool&gt; insert(P&amp;&amp; x);
! template &lt;class P&gt; pair&lt;iterator, bool&gt; insert(const_iterator position, P&amp;&amp; x);
! </pre><blockquote>
! 1 <em>Requires</em>: <tt>P</tt> shall be convertible to <tt>value_type</tt>.
  <p>
! If <tt>P</tt> is instantiated as a reference type, then the argument <tt>x</tt> is copied from. Otherwise <tt>x</tt> is considered
! to be an rvalue as it is converted to <tt>value_type</tt> and inserted into the map. Specifically, in
! such cases <tt>CopyConstructible</tt> is not required of <tt>key_type</tt> or <tt>mapped_type</tt> unless the conversion
! from <tt>P</tt> specifically requires it (e.g., if <tt>P</tt> is a <tt>tuple&lt;const key_type, mapped_type&gt;</tt>, then <tt>key_type</tt>
! must be <tt>CopyConstructible</tt>). The signature taking <tt>InputIterator</tt> parameters does not require
! <tt>CopyConstructible</tt> of either <tt>key_type</tt> or <tt>mapped_type</tt> if the dereferenced <tt>InputIterator</tt> returns a
! non-const rvalue <tt>pair&lt;key_type,mapped_type&gt;</tt>. Otherwise <tt>CopyConstructible</tt> is required for both
! <tt>key_type</tt> and <tt>mapped_type</tt>.
! </p><p>
! <ins>? <em>Remarks</em>: These signatures shall not participate in overload resolution unless <tt>P</tt> 
! is implicitly convertible to <tt>value_type</tt>.</ins>
! </p></blockquote></blockquote>
  </li>
! <li>Change 23.6.2.2 [multimap.modifiers] around p. 1 as indicated:
! <blockquote><pre>template &lt;class P&gt; iterator insert(P&amp;&amp; x);
! template &lt;class P&gt; iterator insert(const_iterator position, P&amp;&amp; x);
! </pre><blockquote>
! 1 <em>Requires</em>: <tt>P</tt> shall be convertible to <tt>value_type</tt>.
  <p>
! If <tt>P</tt> is instantiated as a reference type, then the argument <tt>x</tt> is copied from. Otherwise 
! <tt>x</tt> is considered to be an rvalue as it is converted to <tt>value_type</tt> and inserted into the map. 
! Specifically, in such cases <tt>CopyConstructible</tt> is not required of <tt>key_type</tt> or <tt>mapped_type</tt> 
! unless the conversion from <tt>P</tt> specifically requires it (e.g., if <tt>P</tt> is a <tt>tuple&lt;const key_type, mapped_type&gt;</tt>, 
! then <tt>key_type</tt> must be <tt>CopyConstructible</tt>). The signature taking <tt>InputIterator</tt> parameters 
! does not require <tt>CopyConstructible</tt> of either <tt>key_type</tt> or <tt>mapped_type</tt> if the dereferenced 
! <tt>InputIterator</tt> returns a non-const rvalue <tt>pair&lt;key_type, mapped_type&gt;</tt>. Otherwise <tt>CopyConstructible</tt> 
! is required for both <tt>key_type</tt> and <tt>mapped_type</tt>.
! </p><p>
! <ins>? <em>Remarks</em>: These signatures shall not participate in overload resolution unless <tt>P</tt> 
! is implicitly convertible to <tt>value_type</tt>.</ins>
! </p></blockquote></blockquote>
  </li>
  </ol>
  
--- 25534,28104 ----
  
  
  <hr>
! <h3><a name="2432"></a>2432. <tt>initializer_list</tt> assignability</h3>
! <p><b>Section:</b> 18.9 [support.initlist] <b>Status:</b> <a href="lwg-active.html#EWG">EWG</a>
!  <b>Submitter:</b> David Krauss <b>Opened:</b> 2014-09-30 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#support.initlist">active issues</a> in [support.initlist].</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.initlist">issues</a> in [support.initlist].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#EWG">EWG</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! <tt>std::initializer_list::operator=</tt> 18.9 [support.initlist] is horribly broken and it needs deprecation:
! </p>
! <blockquote><pre>
! std::initializer_list&lt;foo&gt; a = {{1}, {2}, {3}};
! a = {{4}, {5}, {6}};
! // New sequence is already destroyed.
! </pre></blockquote>
! <p>
! Assignability of <tt>initializer_list</tt> isn't explicitly specified, but most implementations supply a default assignment 
! operator. I'm not sure what 17.5 [description] says, but it probably doesn't matter.
! </p>
! 
! <p><i>[Lenexa 2015-05-05: Send to EWG as discussed in Telecon]</i></p>
  
  
  
+ <p><b>Proposed resolution:</b></p>
+ 
+ <ol>
+ <li><p>Edit 18.9 [support.initlist] p1, class template <tt>initializer_list</tt> synopsis, as indicated:</p>
  
  <blockquote>
! <pre>
! namespace std {
!   template&lt;class E&gt; class initializer_list {
!   public:
!     [&hellip;]
!     constexpr initializer_list() noexcept;
!   
!     <ins>initializer_list(const initializer_list&amp;) = default;</ins>
!     <ins>initializer_list(initializer_list&amp;&amp;) = default;</ins>
!     <ins>initializer_list&amp; operator=(const initializer_list&amp;) = delete;</ins>
!     <ins>initializer_list&amp; operator=(initializer_list&amp;&amp;) = delete;</ins>
!     
!     constexpr size_t size() const noexcept;
!     [&hellip;]
!   };
!   [&hellip;]
! }
! </pre>
  </blockquote>
  
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2435"></a>2435. <tt>reference_wrapper::operator()</tt>'s Remark should be deleted</h3>
! <p><b>Section:</b> 20.9.4.4 [refwrap.invoke] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 20.9.4.4 [refwrap.invoke]/2 is no longer useful. (It was originally TR1 2.1.2.4 [tr.util.refwrp.invoke]/2.)  
! First, we already have the As If Rule (1.9 [intro.execution]/1) and the STL Implementers Can Be Sneaky Rule 
! (17.6.5.5 [member.functions]). Second, with variadic templates and other C++11/14 tech, this can be implemented 
! exactly as depicted.
! </p>
  
+ <p><i>[2015-05, Lenexa]</i></p>
  
+ <p>
+ DK: I don't see a defect here<br/>
+ STL: the issue is that the standard is overly verbose, we don't need this sentence. It's redundant.<br/>
+ MC: does anyone think this paragraph has value?<br/>
+ JW: it has negative value. reading it makes me wonder if there's some reason I would want to provide a set of overloaded 
+ functions, maybe there's some problem with doing it the obvious way that I'm not clever enough to see.<br/>
+ Move to Ready status: 8 in favor, none against. 
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! 
! <ol>
! <li><p>Change 20.9.4.4 [refwrap.invoke] p2 as depicted:</p>
  
  <blockquote>
! <pre>
! template &lt;class... ArgTypes&gt;
!   result_of_t&lt;T&amp;(ArgTypes&amp;&amp;...)>
!     operator()(ArgTypes&amp;&amp;... args) const;
  </pre>
+ <blockquote>
+ <p>
+ -1- <i>Returns</i>: <tt>INVOKE(get(), std::forward&lt;ArgTypes&gt;(args)...)</tt>. (20.9.2)
+ <p/>
+ <del>-2- <i>Remark</i>: <tt>operator()</tt> is described for exposition only. Implementations are not required to provide an
+ actual <tt>reference_wrapper::operator()</tt>. Implementations are permitted to support <tt>reference_wrapper</tt> function 
+ invocation through multiple overloaded operators or through other means.</del>
+ </p>
  </blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ 
  
  
  
  
  
  <hr>
! <h3><a name="2436"></a>2436. Comparators for associative containers should always be <tt>CopyConstructible</tt></h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! The associative container requirements attempt to permit comparators that are <tt>DefaultConstructible</tt> 
! but non-<tt>CopyConstructible</tt>. However, the Standard contradicts itself. 23.4.4.1 [map.overview] depicts 
! <tt>map() : map(Compare()) { }</tt> which requires both <tt>DefaultConstructible</tt> and <tt>CopyConstructible</tt>.
! <p/>
! Unlike fine-grained element requirements (which are burdensome for implementers, but valuable for users), such 
! fine-grained comparator requirements are both burdensome for implementers (as the Standard's self-contradiction 
! demonstrates) and worthless for users. We should unconditionally require <tt>CopyConstructible</tt> comparators.  
! (Note that <tt>DefaultConstructible</tt> should remain optional; this is not problematic for implementers, and 
! allows users to use lambdas.)
! <p/>
! Key equality predicates for unordered associative containers are also affected. However, 17.6.3.4 [hash.requirements]/1 
! already requires hashers to be <tt>CopyConstructible</tt>, so 23.2.5 [unord.req]'s redundant wording should 
! be removed.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
  
  <p>
! GR: I prefer to say "<tt>Compare</tt>" rather than "<tt>X::key_compare</tt>", since the former is what the user supplies. 
! JY: It makes sense to use "<tt>Compare</tt>" when we talk about requirements but "<tt>key_compare</tt>" when we use it. 
! <p/>
! AM: We're adding requirements here, which is a breaking change, even though nobody will ever have had a non-<tt>CopyConstructible</tt> 
! comparator. But the simplification is probably worth it.
! <p/>
! GR: I don't care about unmovable containers. But I do worry that people might want to move they comparators. MC: How do 
! you reconcile that with the function that says "give me the comparator"? GR: That one returns by value? JY: Yes. [To MC] 
! You make it a requirement of that function. [To GR] And it [the <tt>key_comp()</tt> function] is missing its requirements. 
! We need to add them everywhere. GR: map already has the right requirements.
! <p/>
! JM: I dispute this. If in C++98 a type wasn't copyable, it had some interesting internal state, but in C++98 you wouldn't 
! have been able to pass it into the container since you would have had to make a copy. JY: No, you could have 
! default-constructed it and never moved it, e.g. a mutex. AM: So, it's a design change, but one that we should make. 
! That's probably an LEWG issue. AM: There's a contradiction in the Standard here, and we need to fix it one way or another.
! <p/>
! <b>Conclusion</b>: Move to LEWG 
  </p>
  
  
+ <p><b>Proposed resolution:</b></p>
  <p>
! This wording is relative to N3936.
  </p>
  
+ <ol>
+ <li><p>Change 23.2.4 [associative.reqmts] Table 102 as indicated (Editorial note: For "expression" <tt>X::key_compare</tt> 
+ "defaults to" is redundant with the class definitions for map/etc.):</p>
  
+ <blockquote>
+ <table border="1">
+ <caption>Table 102 &mdash; Associative container requirements</caption>
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Assertion&#47;note pre-&#47;post-condition</th>
+ <th>Complexity</th>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X::key_compare</tt>
+ </td>
+ <td>
+ <tt>Compare</tt>
+ </td>
+ <td>
+ <del>defaults to <tt>less&lt;key_type&gt;</tt></del><br/>
+ <ins><i>Requires</i>: <tt>key_compare</tt> is <tt>CopyConstructible</tt>.</ins>
+ </td>
+ <td>
+ compile time
+ </td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X(c)<br/>
+ X a(c);</tt>
+ </td>
+ <td>
+ </td>
+ <td>
+ <del><i>Requires</i>: <tt>key_compare</tt> is <tt>CopyConstructible</tt>.</del><br/>
+ <i>Effects</i>: Constructs an empty
+ container. Uses a copy of <tt>c</tt> as
+ a comparison object.
+ </td>
+ <td>
+ constant
+ </td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X(i,j,c)<br/>
+ X a(i,j,c);</tt>
+ </td>
+ <td>
+ </td>
+ <td>
+ <i>Requires</i>: <del><tt>key_compare</tt> is <tt>CopyConstructible</tt>.</del><br/>
+ <tt>value_type</tt> is <tt>EmplaceConstructible</tt> into <tt>X</tt> from <tt>*i</tt>.<br/>
+ <i>Effects</i>: Constructs [&hellip;]
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ </table>
+ </blockquote></li>
+ 
+ <li><p>Change 23.2.5 [unord.req] Table 103 as indicated:</p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 103 &mdash; Unordered associative container requirements (in addition to container)</caption>
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Assertion&#47;note pre-&#47;post-condition</th>
+ <th>Complexity</th>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X::key_equal</tt>
+ </td>
+ <td>
+ <tt>Pred</tt>
+ </td>
+ <td>
+ <ins><i>Requires</i>: <tt>Pred</tt> is <tt>CopyConstructible</tt>.</ins><br/>
+ <tt>Pred</tt> shall be a binary predicate that takes two arguments of type <tt>Key</tt>.<br/> 
+ <tt>Pred</tt> is an equivalence relation.
+ </td>
+ <td>
+ compile time
+ </td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X(n, hf, eq)<br/>
+ X a(n, hf, eq);</tt>
+ </td>
+ <td>
+ <tt>X</tt>
+ </td>
+ <td>
+ <del><i>Requires</i>: <tt>hasher</tt> and <tt>key_equal</tt> are <tt>CopyConstructible</tt>.</del><br/>
+ <i>Effects</i>: Constructs [&hellip;]
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X(n, hf)<br/>
+ X a(n, hf);</tt>
+ </td>
+ <td>
+ <tt>X</tt>
+ </td>
+ <td>
+ <i>Requires</i>: <del><tt>hasher</tt> is <tt>CopyConstructible</tt> and</del><br/>
+ <tt>key_equal</tt> is <tt>DefaultConstructible</tt><br/>
+ <i>Effects</i>: Constructs [&hellip;]
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X(i, j, n, hf, eq)<br/>
+ X a(i, j, n, hf, eq);</tt>
+ </td>
+ <td>
+ <tt>X</tt>
+ </td>
+ <td>
+ <i>Requires</i>: <del><tt>hasher</tt> and <tt>key_equal</tt> are <tt>CopyConstructible</tt>.</del><br/>
+ <tt>value_type</tt> is <tt>EmplaceConstructible</tt> into <tt>X</tt> from <tt>*i</tt>.<br/>
+ <i>Effects</i>: Constructs [&hellip;]
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X(i, j, n, hf)<br/>
+ X a(i, j, n, hf);</tt>
+ </td>
+ <td>
+ <tt>X</tt>
+ </td>
+ <td>
+ <i>Requires</i>: <del><tt>hasher</tt> is <tt>CopyConstructible</tt> and</del><br/>
+ <tt>key_equal</tt> is <tt>DefaultConstructible</tt><br/>
+ <tt>value_type</tt> is <tt>EmplaceConstructible</tt> into <tt>X</tt> from <tt>*i</tt>.<br/>
+ <i>Effects</i>: Constructs [&hellip;]
+ </td>
+ <td>
+ [&hellip;]
+ </td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ </table>
+ </blockquote></li>
+ </ol>
  
  
  
  
  
  
  <hr>
! <h3><a name="2441"></a>2441. Exact-width atomic typedefs should be provided</h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.generic">active issues</a> in [atomics.types.generic].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! <tt>&lt;atomic&gt;</tt> doesn't provide counterparts for <tt>&lt;inttypes.h&gt;</tt>'s most useful typedefs, possibly 
! because they're quasi-optional. We can easily fix this.
  </p>
+ 
+ <p><i>[2014-11, Urbana]</i></p>
+ 
  <p>
! Typedefs were transitional compatibility hack. Should use <tt>_Atomic</tt> macro or template.
! E.g. <tt>_Atomic(int8_t)</tt>. BUT <tt>_Atomic</tt> disappeared!</p>
! 
! <p>
! Detlef will look for <tt>_Atomic</tt> macro. If missing, will open issue.
  </p>
+ 
+ <p><i>[2014-11-25, Hans comments]</i></p>
+ 
  <p>
! There is no <tt>_Atomic</tt> in C++. This is related to the much more general unanswered question of whether C++17 
! should reference C11, C99, or neither.
  </p>
  
! <p><i>[2015-02 Cologne]</i></p>
  
  <p>
! AM: I think this is still an SG1 issue; they need to deal with it before we do.
  </p>
  
+ <p><i>[2015-05 Lenexa, SG1 response]</i></p>
+ 
+ <p>
+ Move to SG1-OK status.  This seems like an easy short-term fix.  We probably need a paper on C/C++ atomics compatibility to deal with _Atomic, but that's a separable issue.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! This wording is relative to N3936.
  </p>
+ 
+ <ol>
+ <li><p>Change 29.5 [atomics.types.generic] p8 as depicted:</p>
+ 
  <blockquote>
! <p>
! -8- There shall be atomic typedefs corresponding to the typedefs in the header <tt>&lt;inttypes.h&gt;</tt> as specified in
! Table 147. <ins><tt>atomic_int<i>N</i>_t</tt>, <tt>atomic_uint<i>N</i>_t</tt>, <tt>atomic_intptr_t</tt>, and 
! <tt>atomic_uintptr_t</tt> shall be defined if and only if <tt>int<i>N</i>_t</tt>, <tt>uint<i>N</i>_t</tt>, <tt>intptr_t</tt>, 
! and <tt>uintptr_t</tt> are defined, respectively.</ins>
! </p>
! </blockquote></li>
! 
! <li><p>Change 29.6.5 [atomics.types.operations.req], Table 147 ("<tt>atomic</tt> <tt>&lt;inttypes.h&gt;</tt> 
! typedefs"), as depicted:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 147 &mdash; <tt>atomic</tt> <tt>&lt;inttypes.h&gt;</tt> typedefs</caption>
! <tr>
! <th>Atomic typedef</th>
! <th><tt>&lt;inttypes.h&gt;</tt> type</th>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>atomic_int8_t</tt></ins>
! </td>
! <td>
! <ins><tt>int8_t</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>atomic_uint8_t</tt></ins>
! </td>
! <td>
! <ins><tt>uint8_t</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>atomic_int16_t</tt></ins>
! </td>
! <td>
! <ins><tt>int16_t</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>atomic_uint16_t</tt></ins>
! </td>
! <td>
! <ins><tt>uint16_t</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>atomic_int32_t</tt></ins>
! </td>
! <td>
! <ins><tt>int32_t</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>atomic_uint32_t</tt></ins>
! </td>
! <td>
! <ins><tt>uint32_t</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>atomic_int64_t</tt></ins>
! </td>
! <td>
! <ins><tt>int64_t</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>atomic_uint64_t</tt></ins>
! </td>
! <td>
! <ins><tt>uint64_t</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="2" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
  </blockquote>
+ </li>
+ </ol>
+ 
  
  
  
  
  
  <hr>
! <h3><a name="2443"></a>2443. <tt>std::array</tt> member functions should be <tt>constexpr</tt></h3>
! <p><b>Section:</b> 23.3.2 [array] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Peter Sommerlad <b>Opened:</b> 2014-10-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! When experimenting with C++14 relaxed <tt>constexpr</tt> functions I made the observation that I couldn't 
! use <tt>std::array</tt> to create a table of data at compile time directly using loops in a function. 
! However, a simple substitute I could use instead:
! </p>
! <blockquote>
! <pre>
! template &lt;typename T, size_t n&gt;
! struct ar {
!   T a[n];
!   constexpr ar() : a{{}}{}
!   constexpr auto data() const { return &amp;a[0];}
!   constexpr T const &amp; operator[](size_t i) const { return a[i]; }
!   constexpr T &amp; operator[](size_t i) { return a[i]; }
! };
  
! template &lt;size_t n&gt;
! using arr = ar&lt;size_t, n&gt;; // std::array&lt;size_t, n&gt;;
! 
! template &lt;size_t n&gt;
! constexpr auto make_tab(){
!   arr&lt;n&gt; result;
!   for(size_t i=0; i &lt; n; ++i)
!     result[i] = (i+1)*(i+1); // cannot define operator[] for mutable array...
!   return result;
! }
! 
! template &lt;size_t n&gt;
! constexpr auto squares=make_tab&lt; n&gt;();
! 
! int main() {
!   int dummy[squares&lt;5&gt;[3]];
! }
! </pre>
! </blockquote>
! <p>
! Therefore, I suggest that all member functions of <tt>std::array</tt> should be made <tt>constexpr</tt> 
! to make the type usable in <tt>constexpr</tt> functions.
! <p/>
! Wording should be straight forward, may be with the exception of <tt>fill</tt>, which would require 
! <tt>fill_n</tt> to be <tt>constexpr</tt> as well.
  </p>
  
+ <p><i>[2014-11 Urbana]</i></p>
  
! <p>Move to LEWG</p>
  <p>
+ The extent to which <tt>constexpr</tt> becomes a part of the Library design is a policy
+ matter best handled initially by LEWG.
  </p>
  
  
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
  
  
  
  <hr>
! <h3><a name="2444"></a>2444. Inconsistent complexity for <tt>std::sort_heap</tt></h3>
! <p><b>Section:</b> 25.4.6.4 [sort.heap] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Fran&ccedil;ois Dumont <b>Opened:</b> 2014-10-07 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! While creating complexity tests for the GNU libstdc++ implementation <a href="https://gcc.gnu.org/ml/libstdc++/2014-10/msg00048.html">I 
! stumbled</a> across a surprising requirement for the <tt>std::sort_heap</tt> algorithm.
! <p/>
! In 25.4.6.4 [sort.heap] p3 the Standard states:
! </p>
! <blockquote><p>
! <i>Complexity</i>: At most <tt><i>N</i> log(<i>N</i>)</tt> comparisons (where <tt><i>N</i> == last - first</tt>).
! </p></blockquote>
! <p>
! As stated on the libstdc++ mailing list by Marc Glisse <tt>sort_heap</tt> can be implemented by <tt><i>N</i></tt> calls to 
! <tt>pop_heap</tt>. As max number of comparisons of <tt>pop_heap</tt> is <tt>2 * log(<i>N</i>)</tt> then <tt>sort_heap</tt> 
! max limit should be <tt>2 * log(1) + 2 * log(2) + .... + 2 * log(<i>N</i>)</tt> that is to say <tt>2 * log(<i>N</i>!)</tt>. 
! In terms of <tt>log(<i>N</i>)</tt> we can also consider that this limit is also cap by <tt>2 * <i>N</i> * log(<i>N</i>)</tt> 
! which is surely what the Standard wanted to set as a limit.
! <p/>
! This is why I would like to propose to replace paragraph 3 by:
! </p>
! <blockquote><p>
! <i>Complexity</i>: At most <tt><ins>2</ins><i>N</i> log(<i>N</i>)</tt> comparisons (where <tt><i>N</i> == last - first</tt>).
! </p></blockquote>
  
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Marshall will research the maths and report back in Lenexa.
! </p>
! 
! <p><i>[2015-05-06 Lenexa]</i></p>
! 
! <p>STL: I dislike exact complexity requirements, they prevent one or two extra checks in debug mode. Would it be better to say O(N log(N)) not at most?</p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! This wording is relative to N3936.
  </p>
  
! <ol><li>
! <p>
! In 25.4.6.4 [sort.heap] p3 the Standard states:
! </p>
! <blockquote>
! <pre>
! template&lt;class RandomAccessIterator&gt;
!   void sort_heap(RandomAccessIterator first, RandomAccessIterator last);
! template&lt;class RandomAccessIterator, class Compare&gt;
!   void sort_heap(RandomAccessIterator first, RandomAccessIterator last,
!                  Compare comp);
! </pre>
! <blockquote><p>
! [&hellip;]
! <p/>
! -3- <i>Complexity</i>: At most <tt><ins>2</ins><i>N</i> log(<i>N</i>)</tt> comparisons (where <tt><i>N</i> == last - first</tt>).
! </p></blockquote>
! </blockquote>
! </li>
! </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2445"></a>2445. "Stronger" memory ordering</h3>
! <p><b>Section:</b> 20.8.2.6 [util.smartptr.shared.atomic], 29.6.5 [atomics.types.operations.req] <b>Status:</b> <a href="lwg-active.html#SG1">SG1</a>
!  <b>Submitter:</b> JF Bastien <b>Opened:</b> 2014-10-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.atomic">issues</a> in [util.smartptr.shared.atomic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#SG1">SG1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The definitions of compare and exchange in 20.8.2.6 [util.smartptr.shared.atomic] p32 and 
! 29.6.5 [atomics.types.operations.req] p20 state:
! </p>
! <blockquote><p>
! <i>Requires</i>: The failure argument shall not be <tt>memory_order_release</tt> nor <tt>memory_order_acq_rel</tt>. 
! The <tt>failure</tt> argument shall be no stronger than the <tt>success</tt> argument.
! </p></blockquote>
! <p>
! The term "stronger" isn't defined by the standard.
! <p/>
! It is hinted at by 29.6.5 [atomics.types.operations.req] p21:
! </p>
! <blockquote><p>
! When only one <tt>memory_order</tt> argument is supplied, the value of <tt>success</tt> is <tt>order</tt>, and the 
! value of <tt>failure</tt> is <tt>order</tt> except that a value of <tt>memory_order_acq_rel</tt> shall be replaced 
! by the value <tt>memory_order_acquire</tt> and a value of <tt>memory_order_release</tt> shall be replaced by the 
! value <tt>memory_order_relaxed</tt>.
! </p></blockquote>
! <p>
! Should the standard define a partial ordering for memory orders, where consume and acquire are incomparable with release?
  </p>
  
! <p><i>[2014-11 Urbana]</i></p>
  
! <p>
! Move to SG1.
! </p>
  
  
! <p><b>Proposed resolution:</b></p>
  
! 
! 
! 
! 
! <hr>
! <h3><a name="2446"></a>2446. Unspecialized <tt>std::tuple_size</tt> should be defined</h3>
! <p><b>Section:</b> 20.4.1 [tuple.general] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Nevin Liber <b>Opened:</b> 2014-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 20.4.1 [tuple.general] paragraph 2, the unspecialized <tt>std::tuple_size</tt> is undefined. It would 
! be a lot more useful with SFINAE if it were defined as an empty struct; that way, it can be used with <tt>enable_if</tt> 
! for determining whether or not it is valid to use <tt>tuple_size</tt>, <tt>tuple_element</tt> and get on the 
! corresponding data structure.
! </p>
! 
! <p><i>[2014-11 Urbana]</i></p>
! 
! <p>Moved to LEWG 42.</p>
! <p>
! This request goes beyond simply making an API respond well to SFINAE, but coupling that with an
! implication for other tuple APIs.  The proper place for such design discussions is LEWG.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! 
! <ol>
! <li><p>Change 20.4.1 [tuple.general] p2, header <tt>&lt;tuple&gt;</tt> synopsis, as indicated</p>
  <blockquote>
! <pre>
! [&hellip;]
! // <i>20.4.2.5, tuple helper classes</i>:
! template &lt;class T&gt; class tuple_size; <del>// undefined</del>
! [&hellip;]
! </pre>
  </blockquote>
+ </li>
  
! <li><p>Change 20.4.2.5 [tuple.helper] as indicated</p>
  <blockquote>
! <pre>
! [&hellip;]
! template &lt;class T&gt; struct tuple_size <ins>{ }</ins>;
! [&hellip;]
! </pre>
  </blockquote>
+ </li>
+ </ol>
+ 
+ 
  
  
  
+ <hr>
+ <h3><a name="2447"></a>2447. Allocators and <tt>volatile</tt>-qualified value types</h3>
+ <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2014-10-16 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ According to Table 27 &mdash; "Descriptive variable definitions" which is used to define the symbols used in the
+ allocator requirements table within 17.6.3.5 [allocator.requirements] we have the following constraints for
+ the types <tt>T, U, C</tt>:
+ </p>
+ <blockquote><p>
+ any non-const object type (3.9)
+ </p></blockquote>
+ <p>
+ This wording can be read to allow instead a <tt>volatile</tt>-qualified value type such as <tt>volatile int</tt>.
+ <p/>
+ The nearest-by way of fixing this would be to add "non-<tt>volatile</tt>" as additional constraint to this table
+ row.
+ <p/>
+ Another choice would be to think of requiring that allocators must be capable to handle any <tt><i>cv</i></tt>-qualified
+ value types. This would make all currently existing allocators non-conforming that can't handle <tt><i>cv</i></tt>-qualified 
+ value types, so I'm not suggesting to follow that route.
+ <p/>
+ A less radical step would be to allow <tt><ii>cv</ii></tt>-qualified types just for <tt>C</tt> (which is used to specify the
+ functions <tt>construct</tt> and <tt>destroy</tt> and where does not even exist any requirement that <tt>C</tt> actually 
+ is related to the value type of the allocator at all). This seemingly extension would be harmless because as of p8 of the
+ same sub-clause "An allocator may constrain the types on which it can be instantiated and the arguments for which its
+ <tt>construct</tt> member may be called."
+ <p/>
+ This differs from the requirements imposed on the types <tt>T</tt> and <tt>U</tt> which both refer to value types of allocators.
+ <p/>
+ The proposed wording attempts to separate the two classes of requirements.
+ </p>
+ 
+ <p>
+ <strong>Previous resolution [SUPERSEDED]:</strong>
+ </p>
+ <blockquote class="note">
+ <p>
+ This wording is relative to N4140.
+ </p>
+ 
+ <ol>
+ <li><p>Change 17.6.3.5 [allocator.requirements], Table 27 &mdash; "Descriptive variable definitions", as indicated:</p>
  <blockquote>
! <table border="1">
! <caption>Table 27 &mdash; Descriptive variable definitions</caption>
! <tr>
! <th>Variable</th>
! <th>Definition</th>
! </tr>
! 
! <tr>
! <td>
! <tt>T, U<del>, C</del></tt>
! </td>
! <td>
! any non-<del>const</del><ins><tt>const</tt> and non-<tt>volatile</tt></ins> object type (3.9)
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>C</tt></ins>
! </td>
! <td>
! <ins>any object type</ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="2" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! 
! <li><p>Change 17.6.3.5 [allocator.requirements] p8 as indicated: (This wording change is intended to
! fix an obvious asymmetry between <tt>construct</tt> and <tt>destroy</tt> which I believe is not intended)</p>
! 
! <blockquote><p>
! -8- An allocator may constrain the types on which it can be instantiated and the arguments for which its
! <tt>construct</tt> <ins>or <tt>destroy</tt></ins> member<ins>s</ins> may be called. If a type cannot be 
! used with a particular allocator, the allocator class or the call to <tt>construct</tt> <ins>or <tt>destroy</tt></ins> 
! may fail to instantiate.
! </p></blockquote>
! </li>
! </ol>
! 
  </blockquote>
  
+ <p><i>[2014-11, Urbana]</i></p>
+ 
+ <p>
+ JW: say "cv-unqualified" instead?<br/>
+ JW: very nervous about allowing construct on const-types, because of the cast to (non-const) <tt>void*</tt><br/>
+ MA: should we just make the minimal fix?<br/>
+ STL: don't break <tt>C</tt> out for special treatment<br/>
+ New proposed resolution: just change "non-const" to "cv-unqualified". Keep addition of <tt>destroy</tt> later. 
+ </p>
+ 
+ <p><i>[2015-02 Cologne]</i></p>
+ 
+ <p>
+ GR: It makes me nervous that someone at some point decided to not add "non-<tt>volatile</tt>".<br/> 
+ AM: That was over ten years ago. It was a deliberate, minuted choice to support <tt>volatile</tt>. We are now reversing that decision. 
+ It would be good to poll our vendors, none of which are in the room. This is a bit more work than we expect of a P0 issue.<br/> 
+ VV: libstdc++ and libc++ seem to support <tt>volatile</tt> template parameters for the standard allocator.<br/> 
+ AM: To clarify, the proposed resolution here would remove the requirement to support <tt>volatile</tt>. Implementations could still 
+ choose to support <tt>volatile</tt>.<br/>
+ DK: I'm happy to drop this and open a new issue in regard to the <tt>destroy</tt> member specification.<br/>
+ AM: I just think this is harder than a P0. Let's reprioritize.
+ </p>
+ 
+ <p><i>[2015-04-01 Daniel comments]</i></p>
+ 
+ <p>
+ The less controversial part of the issue related to constraints imposed on <tt>destroy</tt> has be handed over to the new 
+ issue <a href="lwg-defects.html#2470">2470</a>.
+ </p>
+ 
+ <p><i>[2015-05-06 Lenexa: Move to Ready]</i></p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ This wording is relative to N4431.
+ </p>
+ 
+ <ol>
+ <li><p>Change 17.6.3.5 [allocator.requirements], Table 27 &mdash; "Descriptive variable definitions", as indicated:</p>
  <blockquote>
! <table border="1">
! <caption>Table 27 &mdash; Descriptive variable definitions</caption>
! <tr>
! <th>Variable</th>
! <th>Definition</th>
! </tr>
! 
! <tr>
! <td>
! <tt>T, U, C</tt>
! </td>
! <td>
! any <del>non-const</del><ins><i>cv</i>-unqualified</ins> object type (3.9)
! </td>
! </tr>
! 
! <tr>
! <td colspan="2" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
  </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
  
+ 
+ <hr>
+ <h3><a name="2449"></a>2449. <tt>vector::insert</tt> invalidates <tt>end()</tt>?</h3>
+ <p><b>Section:</b> 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Marc Glisse <b>Opened:</b> 2014-10-21 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#vector.modifiers">active issues</a> in [vector.modifiers].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ this issue is based on the discussion <a href="https://groups.google.com/a/isocpp.org/d/topic/std-discussion/oYvKscnl280/discussion">here</a>.
+ <p/>
+ 23.3.6.5 [vector.modifiers] says about <tt>vector::insert</tt>: "If no reallocation happens, all the iterators and references 
+ before the insertion point remain valid." This doesn't seem to guarantee anything about the iterator <em>at</em> the point of insertion.
+ <p/>
+ The question comes from people asking if the following is valid, assuming a sufficient call to <tt>reserve()</tt> was done first:
+ </p>
+ <blockquote><pre>
+ v.insert(v.end(), v.begin(), v.end());
+ </pre></blockquote>
+ <p>
+ It could fail for an implementation using a sentinel for the end of the vector, but I don't know of any (it would be quite 
+ inconvenient). And for any implementation using a simple position as iterator (pointer (possibly in a wrapper), or base+offset), 
+ this is needlessly restrictive. The fact that this alternative:
+ </p>
+ <blockquote><pre>
+ v.insert(v.end(), &amp;v[0], &amp;v[0]+v.size())
+ </pre></blockquote>
+ <p>
+ is arguably valid (again assuming a large enough <tt>reserve()</tt>) makes it a bit confusing that the first version isn't 
+ (23.2.3 [sequence.reqmts] has a precondition that iterator arguments to <tt>insert()</tt> do not point into the sequence, 
+ but <tt>vector::insert</tt> is more refined and seems to give enough guarantees that it cannot fail).
+ <p/>
+ Then we might as well say that <tt>vector</tt> iterators act as positions, and that after a reallocation-free operation an 
+ iterator points to the same position, whatever may be there now&hellip;
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2450"></a>2450. <tt>(greater|less|greater_equal|less_equal)&lt;void&gt;</tt> do not yield a total order for pointers</h3>
+ <p><b>Section:</b> 20.9.6 [comparisons] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz <b>Opened:</b> 2014-10-30 <b>Last modified:</b> 2015-05-06</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#comparisons">active issues</a> in [comparisons].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#comparisons">issues</a> in [comparisons].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ <tt>less&lt;void&gt;::operator(t, u)</tt> (and the same applies to the rest of <tt>void</tt> specializations for standard 
+ comparison function objects) returns <tt>t &lt; u</tt> even if <tt>t</tt> and <tt>u</tt> are pointers, which by 
+ 5.9 [expr.rel]/3 is undefined except if both pointers point to the same array or object. This might be 
+ regarded as a specification defect since the intention of N3421 is that <tt>less&lt;&gt;</tt> can substitute for 
+ <tt>less&lt;T&gt;</tt> in any case where the latter is applicable. <tt>less&lt;void&gt;</tt> can be rewritten in 
+ the following manner to cope with pointers:
+ </p>
+ <blockquote><pre>
+ template&lt;&gt; struct less&lt;void&gt;
+ {
+ 
+   typedef <i>unspecified</i> is_transparent;
+ 
+   template &lt;class T, class U&gt;
+   struct pointer_overload : std::is_pointer&lt;std::common_type_t&lt;T, U&gt;&gt;
+   {};
+ 
+   template &lt;
+     class T, class U,
+     typename std::enable_if&lt;!pointer_overload&lt;T, U&gt;::value&gt;::type* = nullptr
+   &gt;
+   auto operator()(T&amp;&amp; t, U&amp;&amp; u) const
+     -&gt; decltype(std::forward&lt;T&gt;(t) &lt; std::forward&lt;U&gt;(u))
+   {
+     return std::forward&lt;T&gt;(t) &lt; std::forward&lt;U&gt;(u);
+   } 
+ 
+   template &lt;
+     class T, class U,
+     typename std::enable_if&lt;pointer_overload&lt;T, U>::value>::type* = nullptr
+   &gt;
+   auto operator()(T&amp;&amp; t, U&amp;&amp; u) const
+     -&gt; decltype(std::declval&lt;std::less&lt;std::common_type_t&lt;T, U&gt;&gt;&gt;()(std::forward&lt;T&gt;(t), std::forward&lt;U&gt;(u)))
+   {
+     std::less&lt;std::common_type_t&lt;T, U&gt;&gt; l;
+     return l(std::forward&lt;T&gt;(t), std::forward&lt;U&gt;(u));
+   }
+ 
+ };
+ </pre></blockquote>
+ 
+ <blockquote class="note">
+ <p>
+ This wording is relative to N4140.
+ </p>
+ 
+ <ol>
+ <li><p>Change 20.9.6 [comparisons] p14 as indicated:</p>
+ <blockquote><p>
+ -14- For templates <tt>greater</tt>, <tt>less</tt>, <tt>greater_equal</tt>, and <tt>less_equal</tt>, the specializations 
+ for any pointer type yield a total order, even if the built-in operators <tt>&lt;</tt>, <tt>&gt;</tt>, <tt>&lt;=</tt>, 
+ <tt>&gt;=</tt> do not. <ins>For template specializations <tt>greater&lt;void&gt;</tt>, <tt>less&lt;void&gt;</tt>, 
+ <tt>greater_equal&lt;void&gt;</tt>, and <tt>less_equal&lt;void&gt;</tt>, the call operator with arguments whose common 
+ type <tt><i>CT</i></tt> is a pointer yields the same value as the corresponding comparison function object class 
+ specialization for <tt><i>CT</i></tt>.</ins>
+ </p></blockquote>
+ </li>
+ </ol>
  </blockquote>
  
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! AM: Is there any way this will be resolved elsewhere? VV: No. AM: Then we should bite the bullet and deal with it here.
! <p/>
! MC: These diamond operators are already ugly. Making them more ugly isn't a big problem.
! <p/>
! JY found some issue with types that are convertible, and will reword. 
! <p/>
! Jeffrey suggests improved wording.
! </p>
  
+ <p><i>[2015-05, Lenexa]</i></p>
  
  <p>
! STL: when diamond functions designed, this was on purpose<br/>
! STL: this does go against the original design<br/>
! STL: library is smarter and can give a total order<br/>
! MC: given that the original design rejected this, give back to LEWG<br/>
! STL: original proposal did not talk about total order<br/>
! STL: don't feel strongly about changing the design<br/>
! STL: no objections to taking this issue with some wording changes if people want it<br/>
! MC: not happy with wording, comparing pointers &mdash; what does that mean?<br/>
! STL: needs careful attention to wording<br/>
! STL: want to guarantee that <tt>nullptr</tt> participates in total ordering<br/>
! STL: all hooks into composite pointer type<br/>
! MC: move from new to open with better wording<br/>
! STL: to check updates to issue after Lenexa 
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! This wording is relative to N4296.
! </p>
! 
! <ol>
! <li><p>Change 20.9.6 [comparisons] p14 as indicated:</p>
! <blockquote><p>
! -14- For templates <tt>greater</tt>, <tt>less</tt>, <tt>greater_equal</tt>, and <tt>less_equal</tt>, the specializations 
! for any pointer type yield a total order, even if the built-in operators <tt>&lt;</tt>, <tt>&gt;</tt>, <tt>&lt;=</tt>, 
! <tt>&gt;=</tt> do not. <ins>For template specializations <tt>greater&lt;void&gt;</tt>, <tt>less&lt;void&gt;</tt>, 
! <tt>greater_equal&lt;void&gt;</tt>, and <tt>less_equal&lt;void&gt;</tt>, if the call operator calls a built-in operator 
! comparing pointers, the call operator yields a total order.</ins>
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2451"></a>2451. [fund.ts] <tt>optional&lt;T&gt;</tt> should 'forward' <tt>T</tt>'s implicit conversions</h3>
! <p><b>Section:</b> X [optional.object] <b>Status:</b> <a href="lwg-active.html#LEWG">LEWG</a>
!  <b>Submitter:</b> Geoffrey Romer <b>Opened:</b> 2014-10-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#LEWG">LEWG</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! <p>
! Code such as the following is currently ill-formed (thanks to STL for the compelling example):
! </p>
! <blockquote><pre>
! optional&lt;string&gt; opt_str = "meow";
! </pre></blockquote>
! <p>
! This is because it would require two user-defined conversions (from <tt>const char*</tt> to <tt>string</tt>, 
! and from <tt>string</tt> to <tt>optional&lt;string&gt;</tt>) where the language permits only one. This is 
! likely to be a surprise and an inconvenience for users.
! <p/>
! <tt>optional&lt;T&gt;</tt> should be implicitly convertible from any <tt>U</tt> that is implicitly convertible 
! to <tt>T</tt>. This can be implemented as a non-explicit constructor template <tt>optional(U&amp;&amp;)</tt>, 
! which is enabled via SFINAE only if <tt>is_convertible_v&lt;U, T&gt;</tt> and <tt>is_constructible_v&lt;T, U&gt;</tt>, 
! plus any additional conditions needed to avoid ambiguity with other constructors (see 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4064.html">N4064</a>, particularly the 
! "Odd" example, for why <tt>is_convertible</tt> and <tt>is_constructible</tt> are both needed; thanks to Howard 
! Hinnant for spotting this). 
! <p/>
! In addition, we may want to support explicit construction from <tt>U</tt>, which would mean providing a corresponding 
! explicit constructor with a complementary SFINAE condition (this is the single-argument case of the "perfect 
! initialization" pattern described in N4064).
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
  
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2452"></a>2452. <tt>is_constructible</tt>, etc. and default arguments</h3>
+ <p><b>Section:</b> 20.10 [meta] <b>Status:</b> <a href="lwg-active.html#Core">Core</a>
+  <b>Submitter:</b> Hubert Tong <b>Opened:</b> 2014-11-04 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Core">Core</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The <tt>BaseCharacteristic</tt> for <tt>is_constructible</tt> is defined in terms of the well-formedness 
+ of a declaration for an invented variable. The well-formedness of the described declaration itself may 
+ change for the same set of arguments because of the introduction of default arguments.
+ <p/>
+ In the following program, there appears to be conflicting definitions of a specialization of 
+ <tt>std::is_constructible</tt>; however, it seems that this situation is caused without a user violation 
+ of the library requirements or the ODR. There is a similar issue with <tt>is_convertible</tt>, <tt>result_of</tt>
+ and others.
+ <p/>
+ a.cc:
+ </p>
+ <blockquote><pre>
+ #include &lt;type_traits&gt;
+ struct A { A(int, int); };
+ const std::false_type&amp; x1 = std::is_constructible&lt;A, int&gt;();
+ 
+ int main() { }
+ </pre></blockquote>
+ <p>
+ b.cc:
+ </p>
+ <blockquote><pre>
+ #include &lt;type_traits&gt;
+ struct A { A(int, int); };
+ 
+ inline A::A(int, int = 0) { }
+ 
+ const std::true_type&amp; x2 = std::is_constructible&lt;A, int&gt;();
+ </pre></blockquote>
+ <p>
+ Presumably this program should invoke undefined behaviour, but the Library specification doesn't
+ say that.
+ </p>
+ 
+ <p><i>[2015-02 Cologne]</i></p>
+ 
+ <p>
+ Core wording should say "this kind of thing is ill-formed, no diagnostic required"
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2453"></a>2453. [iterator.range] and now [iterator.container] aren't available via <tt>&lt;initializer_list&gt;</tt></h3>
+ <p><b>Section:</b> 18.9 [support.initlist], 24.7 [iterator.range], 24.8 [iterator.container] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-11-11 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#support.initlist">active issues</a> in [support.initlist].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#support.initlist">issues</a> in [support.initlist].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ These sections define helper functions, some of which apply to <tt>initializer_list&lt;T&gt;</tt>. And they're 
+ available if you include one of a long list of header files, many of which include <tt>&lt;initializer_list&gt;</tt>. 
+ But they are not available if you include <tt>&lt;initializer_list&gt;</tt>. This seems very odd.
+ </p>
+ <blockquote><pre>
+ #include &lt;initializer_list&gt;
+ auto x = {1, 2, 3};
+ const int *p = data(x); // error, undeclared
+ #include &lt;vector&gt;
+ const int *q = data(x); // ok
+ </pre></blockquote>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2456"></a>2456. Incorrect exception specifications for '<tt>swap</tt>' throughout library</h3>
+ <p><b>Section:</b> 20.2 [utility], 20.3.2 [pairs.pair], 20.4 [tuple], 23.3.2 [array], 23.6.3 [queue], 23.6.4 [priority.queue], 23.6.5 [stack] <b>Status:</b> <a href="lwg-active.html#Open">Open</a>
+  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-11-14 <b>Last modified:</b> 2015-05-05</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#utility">active issues</a> in [utility].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#utility">issues</a> in [utility].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Open">Open</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ We have this antipattern in various library classes:
+ </p>
+ <blockquote><pre>
+ void swap(priority_queue&amp; q) noexcept(
+     noexcept(swap(c, q.c)) &amp;&amp; noexcept(swap(comp, q.comp)))
+ </pre></blockquote>
+ <p>
+ This doesn't work. The unqualified lookup for 'swap' finds the member named 'swap', and that suppresses ADL, 
+ so the exception specification is always ill-formed because you can't call the member 'swap' with two arguments.
+ <p/>
+ Relevant history on the core language side:
+ <p/>
+ This used to be ill-formed due to 3.3.7 [basic.scope.class] p1 rule 2: "A name <tt>N</tt> used in a class 
+ <tt>S</tt> shall refer to the same declaration in its context and when re-evaluated in the completed scope of <tt>S</tt>. 
+ No diagnostic is required for a violation of this rule."
+ <p/>
+ Core issue 1330 introduced delay-parsing for exception specifications. Due to the 3.3.7 [basic.scope.class] rules, 
+ this shouldn't have changed the behavior of any conforming programs. But it changes the behavior in the non-conforming 
+ case from "no diagnostic required" to "diagnostic required", so implementations that implement core issue 1330 are now 
+ required to diagnose the ill-formed declarations in the standard library.
+ <p/>
+ Suggested resolution:
+ <p/>
+ Add an <tt>is_nothrow_swappable</tt> trait, and use it throughout the library in place of these <tt>noexcept</tt> expressions.
+ </p>
+ 
+ <p><i>[2015-02, Cologne]</i></p>
+ 
+ <p>
+ No action for now; we intend to have papers for Lenexa.
+ </p>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
+ <p>
+ Move to Open.
+ <p/>
+ Daniel: A first paper (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4426.html">N4426</a>) exists 
+ to suggest some ways of solving this issue.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2457"></a>2457. <tt>std::begin()</tt> and <tt>std::end()</tt> do not support multi-dimensional arrays correctly</h3>
+ <p><b>Section:</b> 24.7 [iterator.range] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Janez &#x17d;emva <b>Opened:</b> 2014-11-16 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#iterator.range">active issues</a> in [iterator.range].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#iterator.range">issues</a> in [iterator.range].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The following code:
+ </p>
+ <blockquote><pre>
+ #include &lt;algorithm&gt;
+ #include &lt;iterator&gt;
+ #include &lt;iostream&gt;
+ #include &lt;cassert&gt;
+ 
+ int main() 
+ {
+   int a[2][3][4] = { { { 1,  2,  3,  4}, { 5,  6,  7,  8}, { 9, 10, 11, 12} },
+                      { {13, 14, 15, 16}, {17, 18, 19, 20}, {21, 22, 23, 24} } };
+   int b[2][3][4];
+ 
+   assert(std::distance(std::begin(a), std::end(a)) == 2 * 3 * 4);
+   std::copy(std::begin(a), std::end(a), std::begin(b));
+   std::copy(std::begin(b), std::end(b), std::ostream_iterator&lt;int&gt;(std::cout, ","));
+ }
+ </pre></blockquote>
+ <p>
+ does not compile. 
+ <p/>
+ A possible way to remedy this would be to add the following overloads of
+ <tt>begin</tt>, <tt>end</tt>, <tt>rbegin</tt>, and <tt>rend</tt> to 24.7 [iterator.range], 
+ relying on recursive evaluation:
+ </p>
+ <blockquote><pre>
+ namespace std {
+ 
+   template &lt;typename T, size_t M, size_t N&gt;
+   constexpr remove_all_extents_t&lt;T&gt;*
+   begin(T (&amp;array)[M][N])
+   {
+     return begin(*array);
+   }
+   
+   template &lt;typename T, size_t M, size_t N&gt;
+   constexpr remove_all_extents_t&lt;T&gt;*
+   end(T (&amp;array)[M][N])
+   {
+     return end(array[M - 1]);
+   }
+ 
+   template &lt;typename T, size_t M, size_t N&gt;
+   reverse_iterator&lt;remove_all_extents_t&lt;T&gt;*&gt;
+   rbegin(T (&amp;array)[M][N])
+   {
+     return decltype(rbegin(array))(end(array[M - 1]));
+   }
+   
+   template &lt;typename T, size_t M, size_t N&gt;
+   reverse_iterator&lt;remove_all_extents_t&lt;T&gt;*&gt;
+   rend(T (&amp;array)[M][N])
+   {
+     return decltype(rend(array))(begin(*array));
+   }
+ 
+ }
+ </pre></blockquote>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2460"></a>2460. LWG issue 2408 and value categories</h3>
+ <p><b>Section:</b> 20.10.7.6 [meta.trans.other], 24.4.1 [iterator.traits] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-11-19 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ LWG issue <a href="lwg-defects.html#2408">2408</a> changes the meat of the specification of <tt>common_type</tt> to compute:
+ </p>
+ <blockquote><p>
+ [..] the type, if any, of an unevaluated conditional expression (5.16) whose first operand is an 
+ arbitrary value of type <tt>bool</tt>, whose second operand is an <tt>xvalue</tt> of type <tt>T1</tt>, 
+ and whose third operand is an xvalue of type <tt>T2</tt>.
+ </p></blockquote>
+ <p>
+ This has an effect on the specification that I think was unintended. It used to be the case that 
+ <tt>common_type&lt;T&amp;, U&amp;&amp;&gt;</tt> would consider the type of a conditional between an 
+ lvalue of type <tt>T</tt> and an xvalue of type <tt>U</tt>. It's now either invalid (because there is 
+ no such thing as an xvalue of reference type) or considers the type of a conditional between an xvalue 
+ of type <tt>T</tt> and an xvalue of type <tt>U</tt>, depending on how you choose to read it.
+ <p/>
+ Put another way, this has the effect of changing the usual definition from:
+ </p>
+ <blockquote><pre>
+ typedef decay_t&lt;decltype(true ? declval&lt;T&gt;() : declval&lt;U&gt;())&gt; type;
+ </pre></blockquote>
+ <p>
+ to:
+ </p>
+ <blockquote><pre>
+ typedef decay_t&lt;decltype(true ? declval&lt;remove_reference_t&lt;T&gt;&gt;() : declval&lt;remove_reference_t&lt;U&gt;&gt;())&gt; type;
+ </pre></blockquote>
+ <p>
+ It also makes <tt>common_type</tt> underspecified in the case where one of the operands is of type <tt>void</tt>; 
+ in that case, the resulting type depends on whether the expression is a throw-expression, which is not 
+ specified (but used to be).
+ <p/>
+ Also on the subject of this wording: the changes to 24.4.1 [iterator.traits] say that 
+ <tt>iterator_traits&lt;T&gt;</tt> "shall have no members" in some cases. That's wrong. It's a class type; 
+ it always has at least a copy constructor, a copy assignment operator, and a destructor. Plus this 
+ removes the usual library liberty to add additional members with names that don't collide with normal 
+ usage (for instance, if a later version of the standard adds members, they can't be present here as a 
+ conforming extension). Perhaps this should instead require that the class doesn't have members with any 
+ of those five names? That's what <a href="lwg-defects.html#2408">2408</a> does for <tt>common_type</tt>'s type member.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2461"></a>2461. Interaction between allocators and container exception safety guarantees</h3>
+ <p><b>Section:</b> 17.6.3.5 [allocator.requirements], 23.3.6.3 [vector.capacity], 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> dyp <b>Opened:</b> 2014-12-06 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ When resizing a <tt>vector</tt>, the accessibility and exception specification of the value type's 
+ constructors determines whether the elements are copied or moved to the new buffer.
+ However, the copy/move is performed via the allocator's <tt>construct</tt> member function, which is 
+ assumed, but not required, to call the copy/move constructor and propagate only exceptions 
+ from the value type's copy/move constructor. The issue might also affect other classes. 
+ <p/>
+ The current wording in N4296 relevant here is from Table 28 &mdash; "Allocator requirements" in 
+ 17.6.3.5 [allocator.requirements]: 
+ </p>
  <blockquote>
+ <table border="1">
+ <caption>Table 28 &mdash; Allocator requirements</caption>
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
+ <th>Default</th>
+ </tr>
  
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.construct(c, args)</tt>
! </td>
! <td>
! (not used)
! </td>
! <td>
! <i>Effect</i>: Constructs an object of type <tt>C</tt> at <tt>c</tt>
! </td>
! <td>
! <tt>::new ((void*)c) C(forward&lt;Args&gt;(args)...)</tt>
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! <p>
! and from 17.6.3.5 [allocator.requirements] p9:
! </p>
! <blockquote><p>
! An allocator may constrain the types on which it can be instantiated and the arguments for which its
! <tt>construct</tt> member may be called. If a type cannot be used with a particular allocator, the allocator class
! or the call to <tt>construct</tt> may fail to instantiate.
! </p></blockquote>
! <p>
! I conclude the following from the wording:
! </p>
! <ol>
! <li><p>The allocator is not required to call the copy constructor if the
! arguments (args) is a single (potentially const) lvalue of the value
! type. Similarly for a non-const rvalue + move constructor. See also
! 23.2.1 [container.requirements.general] p15 which seems to try to require
! this, but is not sufficient:
! That paragraph specifies the semantics of the allocator's operations,
! but not which constructors of the value type are used, if any.
! </p></li>
! <li>
! <p>The allocator may throw exceptions in addition to the exceptions propagated by
! the constructors of the value type; it can also propagate exceptions from constructors
! other than a copy/move constructor.
! </p>
! </li>
! </ol>
! <p>
! This leads to an issue with the wording of the exception safety guarantees for vector modifiers in
! 23.3.6.5 [vector.modifiers] p1:
! </p>
! <blockquote>
! <p>
! [&hellip;]
! </p>
! <pre>
! void push_back(const T&amp; x);
! void push_back(T&amp;&amp; x);
  </pre>
  <blockquote>
! <p>
! <i>Remarks</i>: Causes reallocation if the new size is greater than the old capacity. If no 
! reallocation happens, all the iterators and references before the insertion point remain valid. 
! If an exception is thrown other than by the copy constructor, move constructor, assignment 
! operator, or move assignment operator of <tt>T</tt> or by any InputIterator operation there are 
! no effects.
! <span  style="color:#C80000;font-weight:bold">
! If an exception is thrown while inserting a single element at the end and <tt>T</tt> 
! is <tt>CopyInsertable</tt> or <tt>is_nothrow_move_constructible&lt;T&gt;::value</tt>
! is true, there are no effects. Otherwise, if an exception is thrown by the move constructor of a
! non-<tt>CopyInsertable</tt> <tt>T</tt>, the effects are unspecified.
! </span>
! </p>
  </blockquote>
! </blockquote>
! <p>
! The wording leads to the following problem:
! Copy and move assignment are invoked directly from <tt>vector</tt>.
! For intermediary objects (see <a href="lwg-active.html#2164">2164</a>),
! <tt>vector</tt> also directly invokes the copy and move constructor of the value type.
! However, construction of the actual element within the buffer is invoked via the allocator abstraction.
! As discussed above, the allocator currently is not required to call a copy/move constructor.
! If <tt>is_nothrow_move_constructible&lt;T&gt;::value</tt> is <tt>true</tt> for some value type <tt>T</tt>,
! but the allocator uses modifying operations for <tt>MoveInsertion</tt> that do throw,
! the implementation is required to ensure that "there are no effects",
! even if the source buffer has been modified.
! <p/>
! Similarly, the <tt>vector</tt> capacity functions specify exception safety guarantees
! referring to the move constructor of the value type. For example, <tt>vector::resize</tt> in 23.3.6.3 [vector.capacity] p14:
! </p>
  <blockquote>
! <i>Remarks</i>: If an exception is thrown other than by the move constructor of a
! non-<tt>CopyInsertable</tt> <tt>T</tt> there are no effects.
  </blockquote>
+ <p>
+ The wording leads to the same issue as described above.
+ <p/>
+ Code example:
+ </p>
+ <blockquote>
+ <pre>
+ template&lt;class T&gt;
+ class allocator;
  
! class pot_reg_type // a type which creates
!                    // potentially registered instances
! {
! private:
!   friend class allocator&lt;pot_reg_type&gt;;
!   struct register_t {};
  
!   static std::set&lt;pot_reg_type*&gt;&amp; get_registry()
!   {
!     static std::set&lt;pot_reg_type*&gt; registry;
!     return registry;
!   }
!   void enregister() noexcept(false)
!   {
!     get_registry().insert(this);
!   }
!   void deregister()
!   {
!     get_registry().erase(this);
!   }
! 
! public:
!   pot_reg_type(void               ) noexcept(true) {}
!   pot_reg_type(pot_reg_type const&amp;) noexcept(true) {}
!   pot_reg_type(pot_reg_type&amp;&amp;     ) noexcept(true) {}
! 
! private:
!   pot_reg_type(register_t                     ) noexcept(false)
!   { enregister(); }
!   pot_reg_type(register_t, pot_reg_type const&amp;) noexcept(false)
!   { enregister(); }
!   pot_reg_type(register_t, pot_reg_type&amp;&amp;     ) noexcept(false)
!   { enregister(); }
! };
! 
! template&lt;class T&gt;
! class allocator
! {
! public:
!   using value_type = T;
! 
!   value_type* allocate(std::size_t p)
!   { return (value_type*) ::operator new(p); }
! 
!   void deallocate(value_type* p, std::size_t)
!   { ::operator delete(p); }
! 
!   void construct(pot_reg_type* pos)
!   {
!     new((void*)pos) pot_reg_type((pot_reg_type::register_t()));
!   }
!   void construct(pot_reg_type* pos, pot_reg_type const&amp; source)
!   {
!     new((void*)pos) pot_reg_type(pot_reg_type::register_t(), source);
!   }
! 
!   template&lt;class... Args&gt;
!   void construct(T* p, Args&amp;&amp;... args)
!   {
!     new((void*)p) T(std::forward&lt;Args&gt;(args)...);
!   }
! }; 
  </pre>
+ </blockquote>
+ <p>
+ The <tt>construct</tt> member function template is only required for rebinding,
+ which can be required e.g. to store additional debug information in
+ the allocated memory (e.g. VS2013).
+ <p/>
+ Even though the value type has an accessible and <tt>noexcept(true)</tt> move
+ constructor, this allocator won't call that constructor for rvalue arguments.
+ In any case, it does not call a constructor for which vector has formulated its 
+ requirements. An exception thrown by a constructor called by this allocator is not
+ covered by the specification in 23.3.6.5 [vector.modifiers] and therefore is
+ guaranteed not to have any effect on the vector object when resizing.
+ <p/>
+ For an example how this might invalidate the exception safety
+ guarantees, see <a href="https://groups.google.com/a/isocpp.org/d/topic/std-discussion/BcM7ya8JeqY/discussion">this post on the std-discussion mailing list</a>.
+ <p/>
+ Another problem arises for value types whose constructors are private,
+ but may be called by the allocator e.g. via friendship.
+ Those value types are not <tt>MoveConstructible</tt> 
+ (<tt>is_move_constructible</tt> is false), yet they can be <tt>MoveInsertable</tt>.
+ It is not possible for <tt>vector</tt> to create intermediary objects (see <a href="lwg-active.html#2164">2164</a>) of such a type
+ by directly using the move constructor.
+ Current implementations of the single-element forms of <tt>vector::insert</tt> and <tt>vector::emplace</tt>
+ do create intermediary objects by directly calling one of the value type's constructors,
+ probably to allow inserting objects from references that alias other elements of the container.
+ As far as I can see, Table 100 &mdash; "Sequence container requirements" in 23.2.3 [sequence.reqmts]
+ does not require that the creation of such intermediare objects can be performed
+ by containers using the value type's constructor directly.
+ It is unclear to me if the allocator's construct function could be used to create those
+ intermediary objects, given that they have not been allocated by the allocator.
+ <p/>
+ Two possible solutions:
+ </p>
+ <ol>
+ <li><p>
+ Add the following requirement to the <tt>allocator_traits::construct</tt> function:
+ If the parameter pack <tt>args</tt> consists of a single parameter of the type
+ <tt>value_type&amp;&amp;</tt>,
+ the function may only propagate exceptions if <tt>is_nothrow_move_constructible&lt;value_type&gt;::value</tt>
+ is <tt>false</tt>.
+ <p/>
+ Requiring <tt>alloctor_traits::construct</tt> to call a true copy/move constructor
+ of the value type breaks <tt>std::scoped_allocator_adapter</tt>,
+ as pointed out by <a href="https://groups.google.com/a/isocpp.org/d/msg/std-discussion/0yxikZInp-E/Lxj-msFT22cJ">Casey Carter in a post on the std-discussion mailing list</a>.
+ </p></li>
+ <li>
+ <p>
+ Change vector's criterion whether to move or copy when resizing:
+ <p/>
+ Instead of testing the value type's constructors via
+ <tt>is_move_constructible</tt>, check the value of
+ <tt>noexcept( allocator_traits&lt;Allocator&gt;::construct(alloc, ptr, rval) )</tt>
+ where
+ <tt>alloc</tt> is an lvalue of type <tt>Allocator</tt>,
+ <tt>ptr</tt> is an expression of type <tt>allocator_traits&lt;Allocator&gt;::pointer</tt>
+ and
+ <tt>rval</tt> is a non-const rvalue of type <tt>value_type</tt>.
+ </p>
+ </li>
+ </ol>
+ <p>
+ A short discussion of the two solutions:
+ <p/>
+ Solution 1 allows keeping <tt>is_nothrow_move_constructible&lt;value_type&gt;</tt>
+ as the criterion for <tt>vector</tt> to decide between copying and moving when resizing.
+ It restricts what can be done inside the <tt>construct</tt> member function of allocators,
+ and requires implementers of allocators to pay attention to the value types used.
+ One could conceive allocators checking the following with a <tt>static_assert</tt>:
+ If the value type <tt>is_nothrow_move_constructible</tt>,
+ then the constructor actually called for <tt>MoveInsertion</tt> within the <tt>construct</tt>
+ member function is also declared as noexcept.
+ <p/>
+ Solution 2 requires changing both the implementation of the default
+ allocator (add a conditional <tt>noexcept</tt>) and <tt>vector</tt> (replace
+ <tt>is_move_constructible</tt> with an allocator-targeted check).
+ It does not impose additional restrictions on the allocator (other than
+ 23.2.1 [container.requirements.general] p15),
+ and works nicely even if the move constructor of a <tt>MoveInsertable</tt> type is private or deleted
+ (the allocator might be a friend of the value type).
+ <p/>
+ In both cases, an addition might be required to provide the basic exception safety guarantee.
+ A short discussion on this topic can be found
+ <a href="https://groups.google.com/a/isocpp.org/d/topic/std-discussion/yZLnYy_y2z0/discussion">
+ in the std-discussion mailing list</a>.
+ Essentially, if <tt>allocator_traits&lt;Allocator&gt;::construct</tt> throws an exception,
+ the object may or may not have been constructed.
+ Two solutions are mentioned in that discussion:
+ </p>
+ <ol>
+ <li><p>
+ <tt>allocator_traits&lt;Allocator&gt;::construct</tt> needs to tell its caller
+ whether or not the construction was successful, in case of an exception.
+ </p></li>
+ <li><p>
+ If <tt>allocator_traits&lt;Allocator&gt;::construct</tt> propagates an exception,
+ it shall either not have constructed an object at the specified location,
+ or that object shall have been destroyed
+ (or it shall ensure otherwise that no resources are leaked).
+ </p></li>
+ </ol>
  
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2462"></a>2462. <tt>std::ios_base::failure</tt> is overspecified</h3>
+ <p><b>Section:</b> 27.5.3 [ios.base], 27.5.3.1.1 [ios::failure] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-12-15 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View all other</b> <a href="lwg-index.html#ios.base">issues</a> in [ios.base].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 27.5.3 [ios.base] defines <tt>ios_base::failure</tt> as a nested class:
+ </p>
  <blockquote>
! <pre>
! namespace std {
!   class ios_base {
!   public:
!     class failure;
!     [&hellip;]
!   };
!   [&hellip;]
! }
! </pre>
  </blockquote>
+ <p>
+ This means it is valid to use an elaborated-type-specifier to
+ refer to <tt>ios_base::failure</tt>:
+ </p>
+ <blockquote>
+ <pre>
+ using F = class std::ios_base::failure;
+ throw F();
+ </pre>
+ </blockquote>
+ <p>
+ Therefore implementations are not permitted to define
+ <tt>ios_base::failure</tt> as a typedef e.g.
+ </p>
+ <blockquote>
+ <pre>
+  class ios_base {
+  public:
+ #if __cplusplus &lt; 201103L
+    class failure_cxx03 : public exception {...};
+    typedef failure_cxx03 failure;
+ #else
+    class failure_cxx11 : public system_error {...};
+    typedef failure_cxx11 failure;
+ #endif
+    [&hellip;]
+  };
+ </pre>
+ </blockquote>
+ <p>
+ This constrains implementations, making it harder to manage the ABI
+ change to <tt>ios_base::failure</tt> between C++03 and C++11.
+ </p>
+ 
+ <p><i>[2015-05-06 Lenexa: Move to Ready]</i></p>
+ 
+ <p>JW: the issue is that users are currently allowed to write "class failure" with an elaborated-type-specifier and it must be well-formed, I want the freedom to make that type a typedef, so they can't necessarily use an elaborated-type-specifier (which there is no good reason to use anyway)</p>
+ <p>JW: ideally I'd like this everywhere for all nested classes, but that's a paper not an issue, I only need this type fixed right now.</p>
+ <p>RD: is a synonym the same as an alias?</p>
+ <p>JW: dcl.typedef says a typedef introduces a synonym for another type, so I think this is the right way to say this</p>
+ <p>JW: I already shipped this last month</p>
+ <p>PJP: we're going to have to break ABIs again some time, we need all the wiggle room we can get to make that easier. This helps.</p>
+ <p>MC: do we want this at all? Ready?</p>
+ <p>9 in favor, none opose or abstaining</p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li><p>Change the synopsis in 27.5.3 [ios.base] as indicated:</p>
  
  <blockquote>
! <pre>
! namespace std {
!   class ios_base {
!   public:
!     class failure; <ins><i>// see below</i></ins>
!     [&hellip;]
!   };
!   [&hellip;]
! };
! </pre>
  </blockquote>
+ </li>
  
+ <li><p>Change 27.5.3 [ios.base] paragraph 1:</p>
+ 
+ <blockquote>
+ <p>
+ <tt>ios_base</tt> defines several member types:
+ </p>
+ <ul>
+ <li><p>a <del>class <tt>failure</tt></del><ins>type <tt>failure</tt>, defined as either
+ a class derived from <tt>system_error</tt> or a synonym for a class</ins> derived from 
+ <tt>system_error</tt>;</p></li>
+ </ul>
  </blockquote>
+ </li>
  
+ <li><p>Change 27.5.3.1.1 [ios::failure] paragraph 1:</p>
+ <blockquote>
+ <p>
+ -1- <ins>An implementation is permitted to define <tt>ios_base::failure</tt> as
+ a synonym for a class with equivalent functionality to class <tt>ios_base::failure</tt> shown 
+ in this subclause. [<i>Note</i>: When <tt>ios_base::failure</tt> is a synonym for another type 
+ it shall provide a nested type <tt>failure</tt>, to emulate the injected class name. &mdash; 
+ <i>end note</i>]</ins> The class <tt>failure</tt> defines the base class for the types of all 
+ objects thrown as exceptions, by functions in the iostreams library, to report errors detected 
+ during stream buffer operations.
+ </p>
+ </blockquote>
+ </li>
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2465"></a>2465. SFINAE-friendly <tt>common_type</tt> is nearly impossible to specialize
! correctly and regresses key functionality</h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2015-01-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! I think there's a defect regarding <tt>common_type</tt> and its specializations.
! Unless I've missed it, there is nothing preventing folks from
! instantiating <tt>common_type</tt> with <i>cv</i>-qualified types or reference types. In
! fact, the wording in N3797 explicitly mentions <i>cv</i> <tt>void</tt>, so presumably at
! least <i>cv</i> qualifications are allowed.
! <p/>
! Users are given license to specialize <tt>common_type</tt> when at least of of
! the types is user-defined. (A separate issue is the meaning of
! user-defined. In core, I believe this is any class/struct/union/enum,
! but in lib, I think it means any type not defined in std, right?) There
! is at least one place in the standard that specializes <tt>common_type</tt>
! (time.traits.specializations) on time_point and duration. But the
! specializations are only for non-<i>cv</i>-qualified and non-reference
! specializations of <tt>time_point</tt> and <tt>duration</tt>.
! <p/>
! If the user uses, say, <tt>common_type&lt;duration&lt;X,Y&gt; const, duration&lt;A,B&gt;
! const&gt;</tt>, they're not going to get the behavior they expect.
! <p/>
! Suggest we clarify the requirements of <tt>common_type</tt>'s template
! parameters. Also, perhaps we can add blanket wording that <tt>common_type&lt;A
! [<i>cv</i>][&amp;], B [<i>cv</i>][&amp;]&gt;</tt> is required to be equivalent to 
! <tt>common_type&lt;A,B&gt;</tt> (if that is in fact the way we intent this to work).
! <p/>
! Also, the change to make <tt>common_type</tt> SFINAE-friendly regressed key
! functionality, as noted by Agust&iacute;n K-ballo Berg&eacute; in 
! <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=37178">c++std-lib-37178</a>.
! Since <tt>decay_t</tt> is not applied until the very end of the type computation,
! user specializations are very likely to to be found.
! <p/>
! Agust&iacute;n says:
  </p>
! <blockquote class="note">
  <p>
! Consider the following snippet:
  </p>
  <blockquote>
! <pre>
! struct X {};
! struct Y { explicit Y(X){} };
  
+ namespace std {
+   template&lt;> struct common_type&lt;X, Y> { typedef Y type; };
+   template&lt;> struct common_type&lt;Y, X> { typedef Y type; };
+ }
  
+ static_assert(is_same&lt;common_type_t&lt;X, Y>, Y>()); // (A)
+ static_assert(is_same&lt;common_type_t&lt;X, Y, Y>, Y>()); // (B)
+ static_assert(is_same&lt;common_type_t&lt;X, X, Y>, Y>()); // (C)
+ </pre>
+ </blockquote>
+ <p>
+ Under the original wording, all three assertion holds. Under the current wording,
+ </p>
+ <ul>
+ <li><p>(A) picks the user-defined specialization, so the assertion holds.</p></li>
  
! <li><p>(B) goes to the third bullet and, ignoring the user-defined specialization, looks for 
! <tt>decltype(true ? declval&lt;X&gt;() : declval&lt;Y&gt;())</tt>; since it is ill-formed 
! there is no common type.</p></li>
! 
! <li><p>(C) goes to the third bullet and yields <tt>common_type_t&lt;X&amp;&amp;, Y&gt;</tt>, which again misses 
! the user-defined specialization.</p></li>
! </ul>
! </blockquote>
  <p>
! The discussion following <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=35636">c++std-lib-35636</a> 
! seemed to cohere around the idea that the primary <tt>common_type</tt> specialization should have the effect
! of stripping top-level ref and <i>cv</i> qualifiers by applying <tt>std::decay_t</tt> to its arguments and, 
! if any of them change as a result of that transformation, re-dispatching to <tt>common_type</tt> on those transformed
! arguments, thereby picking up any user-defined specializations. This change to <tt>common_type</tt> would make 
! the specializations in time.traits.specializations sufficient.
! <p/>
! <b>Suggested wording</b>:
! <p/>
! I'm afraid I don't know enough to suggest wording. But for exposition,
! the following is my best shot at implementing the suggested resolution.
! I believe it also fixes the regression noted by Agust&iacute;n K-ballo Berg&eacute; in
! <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=37178">c++std-lib-37178</a>.
  </p>
  <blockquote>
! <pre>
! namespace detail
! {
!     template&lt;typename T, typename U&gt;
!     using default_common_t =
!         decltype(true? std::declval&lt;T&gt;() : std::declval&lt;U&gt;());
! 
!     template&lt;typename T, typename U, typename Enable = void&gt;
!     struct common_type_if
!     {};
! 
!     template&lt;typename T, typename U&gt;
!     struct common_type_if&lt;T, U,
!       void_t&lt;default_common_t&lt;T, U&gt;&gt;&gt;
!     {
!       using type = decay_t&lt;default_common_t&lt;T, U&gt;&gt;;
!     };
! 
!     template&lt;typename T, typename U,
!        typename TT = decay_t&lt;T&gt;, typename UU = decay_t&lt;U&gt;&gt;
!     struct common_type2
!       : common_type&lt;TT, UU&gt; // Recurse to catch user specializations
!     {};
! 
!     template&lt;typename T, typename U&gt;
!     struct common_type2&lt;T, U, T, U&gt;
!       : common_type_if&lt;T, U&gt;
!     {};
! 
!     template&lt;typename Meta, typename Enable = void&gt;
!     struct has_type
!       : std::false_type
!     {};
! 
!     template&lt;typename Meta&gt;
!     struct has_type&lt;Meta, void_t&lt;typename Meta::type&gt;&gt;
!       : std::true_type
!     {};
! 
!     template&lt;typename Meta, typename...Ts&gt;
!     struct common_type_recurse
!       : common_type&lt;typename Meta::type, Ts...&gt;
!     {};
! 
!     template&lt;typename Meta, typename...Ts&gt;
!     struct common_type_recurse_if
!       : std::conditional&lt;
!           has_type&lt;Meta>::value,
!           common_type_recurse&lt;Meta, Ts...&gt;,
!           empty
!         >::type
!     {};
! }
! 
! template&lt;typename ...Ts&gt;
! struct common_type
! {};
! 
! template&lt;typename T>
! struct common_type&lt;T>
! {
!   using type = std::decay_t&lt;T&gt;;
! };
! 
! template&lt;typename T, typename U&gt;
! struct common_type&lt;T, U&gt;
!   : detail::common_type2&lt;T, U&gt;
! {};
! 
! template&lt;typename T, typename U, typename... Vs&gt;
! struct common_type&lt;T, U, Vs...&gt;
!   : detail::common_type_recurse_if&lt;common_type&lt;T, U&gt;, Vs...&gt;
! {};
! </pre>
  </blockquote>
  
  
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
  
  
  
  <hr>
! <h3><a name="2466"></a>2466. <tt>allocator_traits::max_size()</tt> default behavior is incorrect</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements], 20.7.8.2 [allocator.traits.members] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2015-01-17 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Table 28 &mdash; "Allocator requirements" says that default behavior for <tt>a.max_size()</tt> is 
! <tt>numeric_limits&lt;size_type&gt;::max()</tt>. And this is consistent with the matching statement 
! for <tt>allocator_traits</tt> in 20.7.8.2 [allocator.traits.members]/p7:
  </p>
! <blockquote>
! <pre>
! static size_type max_size(const Alloc&amp; a) noexcept;
! </pre>
! <blockquote>
  <p>
! <i>Returns</i>: <tt>a.max_size()</tt> if that expression is well-formed; otherwise, 
! <tt>numeric_limits&lt;size_type&gt;::max()</tt>.
! </p>
! </blockquote>
! </blockquote>
! <p>
! However, when allocating memory, an allocator must allocate <tt>n*sizeof(value_type)</tt> bytes, for example:
! </p>
! <blockquote>
! <pre>
! value_type*
! allocate(std::size_t n)
! {
!   return static_cast&lt;value_type*&gt;(::operator new (n * sizeof(value_type)));
! }
! </pre>
! </blockquote>
! <p>
! When <tt>n == numeric_limits&lt;size_type&gt;::max(), n * sizeof(value_type)</tt> is <em>guaranteed</em> 
! to overflow except when <tt>sizeof(value_type) == 1</tt>.
! <p/>
! A more useful default would be <tt>numeric_limits&lt;size_type&gt;::max() / sizeof(value_type)</tt>.
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! Marshall: Is this the right solution?<br/>
! PJP: I think it's gilding the lily.<br/>
! STL: I think this is right, and it doesn't interact with the incomplete container stuff because it's in a member function.<br/>
! Marshall: Objections to this?<br/>
! STL: Spaces around binary operators.<br/>
! Hwrd: It's completely wrong without spaces.<br/>
! Marshall: All in favor of Ready?<br/>
! Lots. 
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li><p>Change 17.6.3.5 [allocator.requirements], Table 28 &mdash; "Allocator requirements", as indicated:</p>
+ <blockquote>
+ <table border="1">
+ <caption>Table 28 &mdash; Allocator requirements</caption>
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
+ <th>Default</th>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a.max_size()</tt>
+ </td>
+ <td>
+ <tt>X::size_type</tt>
+ </td>
+ <td>
+ the largest value that can<br/>
+ meaningfully be passed to<br/>
+ <tt>X::allocate()</tt>
+ </td>
+ <td>
+ <tt>numeric_limits&lt;size_type&gt;::max()<ins>/sizeof(value_type)</ins></tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
+ 
+ </table>
+ </blockquote>
+ 
+ </li>
+ 
+ <li><p>Change 20.7.8.2 [allocator.traits.members]/p7 as indicated:</p>
+ 
+ <blockquote>
+ <pre>
+ static size_type max_size(const Alloc&amp; a) noexcept;
+ </pre>
+ <blockquote>
  <p>
! <i>Returns</i>: <tt>a.max_size()</tt> if that expression is well-formed; otherwise, 
! <tt>numeric_limits&lt;size_type&gt;::max()<ins>/sizeof(value_type)</ins></tt>.
  </p>
! </blockquote>
! </blockquote>
! 
! </li>
! </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2468"></a>2468. Self-move-assignment of library types</h3>
! <p><b>Section:</b> 17.6.4.9 [res.on.arguments], 17.6.3.1 [utility.arg.requirements], 17.6.5.15 [lib.types.movedfrom], 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2015-01-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#res.on.arguments">issues</a> in [res.on.arguments].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Suppose we write
! </p>
  <blockquote>
! <pre>
! vector&lt;string&gt; v{"a", "b", "c", "d"};
! v = move(v);
! </pre>
  </blockquote>
  <p>
! What should be the state of <tt>v</tt> be? The standard doesn't say anything specific about self-move-assignment. 
! There's relevant text in several parts of the standard, and it's not clear how to reconcile them.
! <p/>
! 17.6.4.9 [res.on.arguments] writes that, for all functions in the standard library, unless explicitly stated 
! otherwise, "If a function argument binds to an rvalue reference parameter, the implementation may assume that this 
! parameter is a unique reference to this argument." The <tt>MoveAssignable</tt> requirements table in 
! 17.6.3.1 [utility.arg.requirements] writes that, given <tt>t = rv</tt>, <tt>t</tt>'s state is equivalent to 
! <tt>rv</tt>'s from before the assignment and <tt>rv</tt>'s state is unspecified (but valid). For containers 
! specifically, the requirements table in 23.2.1 [container.requirements.general] says that, given <tt>a = rv</tt>, 
! <tt>a</tt> becomes equal to what <tt>rv</tt> was before the assignment (and doesn't say anything about <tt>rv</tt>'s 
! state post-assignment).
! <p/>
! Taking each of these pieces in isolation, without reference to the other two:
  </p>
+ <ul>
+ <li><p>17.6.4.9 [res.on.arguments] would clearly imply that the effect of <tt>v = move(v)</tt> is undefined.</p></li>
+ <li><p>17.6.3.1 [utility.arg.requirements] would clearly imply that <tt>v = move(v)</tt> has defined behavior. 
+ It might be read to imply that this is a no-op, or might be read to imply that it leaves <tt>v</tt> in a valid but 
+ unspecified state; I'm not sure which reading is more natural.</p></li>
+ <li><p>23.2.1 [container.requirements.general] would clearly imply that <tt>v = move(v)</tt> is a no-op.</p></li>
+ </ul>
  <p>
! It's not clear from the text how to put these pieces together, because it's not clear which one takes precedence.  
! Maybe 17.6.4.9 [res.on.arguments] wins (it imposes an implicit precondition that isn't mentioned in the 
! <tt>MoveAssignable</tt> requirements, so <tt>v = move(v)</tt> is undefined), or maybe 
! 23.2.1 [container.requirements.general] wins (it explicitly gives additional guarantees for 
! <tt>Container::operator=</tt> beyond what's guaranteed for library functions in general, so <tt>v = move(v)</tt> 
! is a no-op), or maybe something else.
! <p/>
! On the existing implementations that I checked, for what it's worth, <tt>v = move(v)</tt> appeared to clear the vector; 
! it didn't leave the vector unchanged and it didn't cause a crash.
! <p/>
! <em>Proposed wording</em>:
! <p/>
! Informally: change the <tt>MoveAssignable</tt> and Container requirements tables (and any other requirements tables 
! that mention move assignment, if any) to make it explicit that <tt>x = move(x)</tt> is defined behavior and it leaves 
! <tt>x</tt> in a valid but unspecified state. That's probably not what the standard says today, but it's probably what 
! we intended and it's consistent with what we've told users and with what implementations actually do.
  </p>
  
  
+ <p><b>Proposed resolution:</b></p>
  
  
  
+ 
+ 
+ <hr>
+ <h3><a name="2469"></a>2469. Wrong specification of Requires clause of <tt>operator[]</tt> for <tt>map</tt> and <tt>unordered_map</tt></h3>
+ <p><b>Section:</b> 23.4.4.3 [map.access], 23.5.4.3 [unord.map.elem] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Tomasz Kami&nacute;ski <b>Opened:</b> 2015-01-21 <b>Last modified:</b> 2015-05-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#map.access">issues</a> in [map.access].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! The "Requires:" clause for the <tt>operator[]</tt> for the <tt>unordered_map</tt> and <tt>map</tt>, are defining 
! separate requirements for insertability into container of <tt>mapped_type</tt> and <tt>key_type</tt>.
! <p/>
! 23.4.4.3 [map.access] p2: // <tt>T&amp; operator[](const key_type&amp; x);</tt>
! <p/>
! <i>Requires</i>: <tt>key_type</tt> shall be <tt>CopyInsertable</tt> and <tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> 
! into <tt>*this</tt>.
! <p/>
! 23.4.4.3 [map.access] p6: // <tt>T&amp; operator[](key_type&amp;&amp; x)</tt>
! <p/>
! <i>Requires</i>: <tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> into <tt>*this</tt>.
! <p/>
! 23.5.4.3 [unord.map.elem] p1: // <tt>mapped_type&amp; operator[](const key_type&amp; k); 
! mapped_type&amp; operator[](key_type&amp;&amp; k);</tt>
! <p/>
! <i>Requires</i>: <tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> into <tt>*this</tt>. For the first operator, 
! <tt>key_type</tt> shall be <tt>CopyInsertable</tt> into <tt>*this</tt>. For the second operator, <tt>key_type</tt> shall 
! be <tt>MoveConstructible</tt>.
! <p/>
! Definition of the appropriate requirements: 23.2.1 [container.requirements.general] p15.
! <p/>
! <tt>T</tt> is <tt>DefaultInsertable</tt> into <tt>X</tt> means that the following expression is well-formed: //p15.1
! <p/>
! <tt>allocator_traits&lt;A&gt;::construct(m, p)</tt>
! <p/>
! <tt>T</tt> is <tt>MoveInsertable</tt> into <tt>X</tt> means that the following expression is well-formed:   //p15.3
! <p/>
! <tt>allocator_traits&lt;A&gt;::construct(m, p, rv)</tt>
! <p/>
! <tt>T</tt> is <tt>CopyInsertable</tt> into <tt>X</tt> means that, in addition to <tt>T</tt> being <tt>MoveInsertable</tt> 
! into <tt>X</tt>, the following expression is well-formed: //p15.4
! <p/>
! <tt>allocator_traits&lt;A&gt;::construct(m, p, v)</tt>
! <p/>
! In the context of above definition the requirement "<tt>key_type</tt> shall be <tt>CopyInsertable</tt> into <tt>*this</tt>" 
! would mean that the key element of the <tt>pair&lt;const key_type, mapped_type&gt;</tt> (<tt>value_type</tt> of the map) 
! should be constructed using separate call to the <tt>construct</tt> method, the same applies for the <tt>mapped_type</tt>. 
! Such behavior is explicitly prohibited by 23.2.1 [container.requirements.general] p3.
! </p>
! <blockquote><p>
! For the components affected by this sub-clause that declare an allocator_type, objects stored in these 
! components shall be constructed using the <tt>allocator_traits&lt;allocator_type&gt;::construct</tt> function and
! destroyed using the <tt>allocator_traits&lt;allocator_type&gt;::destroy</tt> function (20.7.8.2). These functions
! are called only for the container's element type, not for internal types used by the container.
! </p></blockquote>
! <p>
! It clearly states that <tt>element_type</tt> of the map, must be constructed using allocator for value type, which 
! disallows using of separate construction of first and second element, regardless of the fact if it can be actually 
! performed without causing undefined behavior.
! <p/>
! That means that the <tt>MoveInsertable</tt> and similar requirements may only be expressed in terms of <tt>value_type</tt>, 
! not its members types.
  </p>
  
+ <p><i>[2015-02 Cologne]</i></p>
+ 
  <p>
! This issue is related to <a href="lwg-defects.html#2464">2464</a>.
! <p/>
! GR: Effects should say "returns ...". DK: Or just have a Returns clause? MC: A Returns clause is a directive to implementers.
! <p/>
! TK/DK: This PR fails to address the requirements about which it complained in the first place. DK: I can reword this. TK can help. 
! </p> 
! 
! <p><i>[2015-03-29, Daniel provides improved wording]</i></p>
! 
! <p>
! The revised wording fixes the proper usage of the magic "Equivalent to" wording, which automatically induces <i>Requires:</i>, 
! <i>Returns:</i>, and <i>Complexity:</i> elements (and possibly more). This allows us to strike all the remaining
! elements, because they fall out from the semantics of the wording defined by <a href="lwg-defects.html#2464">2464</a>. In particular it is important
! to realize that the wording form
! </p>
! <blockquote>
! <p>
! <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>map</tt> from <tt>piecewise_construct</tt>, 
! <tt>forward_as_tuple(k)</tt>, <tt>forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>
! </p>
! </blockquote>
! <p>
! degenerates for the empty pack expansion <tt>args</tt> to:
! </p>
! <blockquote>
! <p>
! <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>map</tt> from <tt>piecewise_construct</tt>, 
! <tt>forward_as_tuple(k)</tt>, <tt>forward_as_tuple()</tt>
! </p>
! </blockquote>
! <p>
! which again means that such a <tt>pair</tt> construction (assuming <tt>std::allocator</tt>) would copy <tt>k</tt>
! into member <tt>first</tt> and would value-initialize member <tt>second</tt>.
  </p>
  
  <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to N4296.</p>
! 
! <p>Accept resolution of the issue issue <a href="lwg-defects.html#2464">2464</a> and define <tt>operator[]</tt> as follows 
! (This would also address issue <a href="lwg-defects.html#2274">2274</a>):</p>
! 
! <ol>
! <li><p>Change 23.4.4.3 [map.access] as indicated:</p>
! 
! <blockquote>
! <pre>
! T&amp; operator[](const key_type&amp; x);
! </pre>
! <blockquote><p>
! -1- <i>Effects</i>: <del>If there is no key equivalent to <tt>x</tt> in the map, inserts <tt>value_type(x, T())</tt> 
! into the map</del><ins>Equivalent to: <tt>try_emplace(x).first-&gt;second</tt></ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! T&amp; operator[](key_type&amp;&amp; x);
! </pre>
! <blockquote>
  <p>
! -5- <i>Effects</i>: <del>If there is no key equivalent to <tt>x</tt> in the map, inserts <tt>value_type(std::move(x), T())</tt> 
! into the map</del><ins>Equivalent to: <tt>try_emplace(move(x)).first-&gt;second</tt></ins>.
! </p>
! </blockquote>
! </blockquote>
  </li>
! 
! <li><p>Change 23.5.4.3 [unord.map.elem] as indicated:</p>
! 
! <blockquote>
! <pre>
! mapped_type&amp; operator[](const key_type&amp; k);
! mapped_type&amp; operator[](key_type&amp;&amp; k);
! </pre>
! <blockquote>
  <p>
! [&hellip;]
! <p/>
! -2- <i>Effects</i>: <del>If the <tt>unordered_map</tt> does not already contain an element whose key is equivalent to <tt>k</tt>, 
! the first operator inserts the value <tt>value_type(k, mapped_type())</tt> and the second operator inserts the
! value <tt>value_type(std::move(k), mapped_type())</tt></del><ins>For the first operator, equivalent to: 
! <tt>try_emplace(k).first-&gt;second</tt>; for the second operator, equivalent to: 
! <tt>try_emplace(move(k)).first-&gt;second</tt></ins>.
! </p>
! </blockquote>
! </blockquote>
  </li>
  </ol>
! </blockquote>
  
! <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to N4296.</p>
! 
! <p>Accept resolution of the issue issue <a href="lwg-defects.html#2464">2464</a> and define <tt>operator[]</tt> as follows 
! (This would also address issue <a href="lwg-defects.html#2274">2274</a>):</p>
  
+ <ol>
+ <li><p>Change 23.4.4.3 [map.access] as indicated:</p>
  
+ <blockquote>
+ <pre>
+ T&amp; operator[](const key_type&amp; x);
+ </pre>
+ <blockquote><p>
+ -1- <i>Effects</i>: <del>If there is no key equivalent to <tt>x</tt> in the map, inserts <tt>value_type(x, T())</tt> 
+ into the map.</del><ins>Equivalent to: <tt>return try_emplace(x).first-&gt;second;</tt></ins>
+ <p/>
+ <del>-2- <i>Requires</i>: <tt>key_type</tt> shall be <tt>CopyInsertable</tt> and <tt>mapped_type</tt> shall be 
+ <tt>DefaultInsertable</tt> into <tt>*this</tt>.</del>
+ <p/>
+ <del>-3- <i>Returns</i>: A reference to the <tt>mapped_type</tt> corresponding to <tt>x</tt> in <tt>*this</tt>.</del>
+ <p/>
+ <del>-4- <i>Complexity</i>: Logarithmic.</del>
+ </p>
+ </blockquote>
+ <pre>
+ T&amp; operator[](key_type&amp;&amp; x);
+ </pre>
+ <blockquote>
  <p>
! -5- <i>Effects</i>: <del>If there is no key equivalent to <tt>x</tt> in the map, inserts <tt>value_type(std::move(x), T())</tt> 
! into the map.</del><ins>Equivalent to: <tt>return try_emplace(move(x)).first-&gt;second;</tt></ins>
! <p/>
! <del>-6- <i>Requires</i>: <tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> into <tt>*this</tt>.</del>
! <p/>
! <del>-7- <i>Returns</i>: A reference to the <tt>mapped_type</tt> corresponding to <tt>x</tt> in <tt>*this</tt>.</del>
! <p/>
! <del>-8- <i>Complexity</i>: Logarithmic.</del>
  </p>
+ </blockquote>
+ </blockquote>
+ </li>
  
+ <li><p>Change 23.5.4.3 [unord.map.elem] as indicated:</p>
+ 
+ <blockquote>
+ <pre>
+ mapped_type&amp; operator[](const key_type&amp; k);
+ mapped_type&amp; operator[](key_type&amp;&amp; k);
+ </pre>
+ <blockquote>
+ <p>
+ <del>-1- <i>Requires</i>: <tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> into <tt>*this</tt>. For the first operator, 
+ <tt>key_type</tt> shall be <tt>CopyInsertable</tt> into <tt>*this</tt>. For the second operator, <tt>key_type</tt> shall 
+ be <tt>MoveConstructible</tt>.</del>
+ <p/>
+ -2- <i>Effects</i>: <del>If the <tt>unordered_map</tt> does not already contain an element whose key is equivalent to <tt>k</tt>, 
+ the first operator inserts the value <tt>value_type(k, mapped_type())</tt> and the second operator inserts the
+ value <tt>value_type(std::move(k), mapped_type())</tt></del><ins>For the first operator, equivalent to:</ins>
+ </p>
+ <blockquote>
+ <pre> 
+ <ins>return try_emplace(k).first-&gt;second;</ins>
+ </pre>
+ </blockquote>
+ <p>
+ <ins>for the second operator, equivalent to:</ins>
+ </p>
+ <blockquote>
+ <pre>
+ <ins>return try_emplace(move(k)).first-&gt;second;</ins>
+ </pre>
+ </blockquote>
+ <p>
+ <del>-3- <i>Returns</i>: A reference to <tt>x.second</tt>, where <tt>x</tt> is the (unique) element whose key is equivalent to 
+ <tt>k</tt>.</del>
+ <p/>
+ <del>-4- <i>Complexity</i>: Average case &#x1d4aa;(<tt>1</tt>), worst case &#x1d4aa;(<tt>size()</tt>).</del>
+ </p>
+ </blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4431.</p>
+ 
+ <p>Accept resolution of the issue issue <a href="lwg-defects.html#2464">2464</a> and define <tt>operator[]</tt> as follows 
+ (This would also address issue <a href="lwg-defects.html#2274">2274</a>):</p>
+ 
  <ol>
! <li><p>Change 23.4.4.3 [map.access] as indicated:</p>
! 
! <blockquote>
! <pre>
! T&amp; operator[](const key_type&amp; x);
! </pre>
! <blockquote><p>
! -1- <i>Effects</i>: <del>If there is no key equivalent to <tt>x</tt> in the map, inserts <tt>value_type(x, T())</tt> 
! into the map.</del><ins>Equivalent to: <tt>return try_emplace(x).first-&gt;second;</tt></ins>
! <p/>
! <del>-2- <i>Requires</i>: <tt>key_type</tt> shall be <tt>CopyInsertable</tt> and <tt>mapped_type</tt> shall be 
! <tt>DefaultInsertable</tt> into <tt>*this</tt>.</del>
! <p/>
! <del>-3- <i>Returns</i>: A reference to the <tt>mapped_type</tt> corresponding to <tt>x</tt> in <tt>*this</tt>.</del>
! <p/>
! <del>-4- <i>Complexity</i>: Logarithmic.</del>
! </p>
! </blockquote>
! <pre>
! T&amp; operator[](key_type&amp;&amp; x);
! </pre>
! <blockquote>
  <p>
! -5- <i>Effects</i>: <del>If there is no key equivalent to <tt>x</tt> in the map, inserts <tt>value_type(std::move(x), T())</tt> 
! into the map.</del><ins>Equivalent to: <tt>return try_emplace(move(x)).first-&gt;second;</tt></ins>
! <p/>
! <del>-6- <i>Requires</i>: <tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> into <tt>*this</tt>.</del>
! <p/>
! <del>-7- <i>Returns</i>: A reference to the <tt>mapped_type</tt> corresponding to <tt>x</tt> in <tt>*this</tt>.</del>
! <p/>
! <del>-8- <i>Complexity</i>: Logarithmic.</del>
! </p>
! </blockquote>
! </blockquote>
  </li>
! 
! <li><p>Change 23.5.4.3 [unord.map.elem] as indicated:</p>
! 
! <blockquote>
! <pre>
! mapped_type&amp; operator[](const key_type&amp; k);
! <del>mapped_type&amp; operator[](key_type&amp;&amp; k);</del>
! </pre>
! <blockquote>
  <p>
! <del>-1- <i>Requires</i>: <tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> into <tt>*this</tt>. For the first operator, 
! <tt>key_type</tt> shall be <tt>CopyInsertable</tt> into <tt>*this</tt>. For the second operator, <tt>key_type</tt> shall 
! be <tt>MoveConstructible</tt>.</del>
! <p/>
! -2- <i>Effects</i>: <ins>Equivalent to <tt>return try_emplace(k).first-&gt;second;</tt></ins><del>If the <tt>unordered_map</tt> 
! does not already contain an element whose key is equivalent to <tt>k</tt>, 
! the first operator inserts the value <tt>value_type(k, mapped_type())</tt> and the second operator inserts the
! value <tt>value_type(std::move(k), mapped_type())</tt></del>
! </p>
! <p>
! <del>-3- <i>Returns</i>: A reference to <tt>x.second</tt>, where <tt>x</tt> is the (unique) element whose key is equivalent to 
! <tt>k</tt>.</del>
! <p/>
! <del>-4- <i>Complexity</i>: Average case &#x1d4aa;(<tt>1</tt>), worst case &#x1d4aa;(<tt>size()</tt>).</del>
! </p>
! </blockquote>
! 
! <pre>
! <ins>mapped_type&amp; operator[](key_type&amp;&amp; k);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Effects</i>: Equivalent to <tt>return try_emplace(move(k)).first-&gt;second;</tt></ins>
! </p>
! </blockquote>
! 
! </blockquote>
  </li>
  </ol>
  
*************** is implicitly convertible to <tt>value_t
*** 7287,7526 ****
  
  
  <hr>
! <h3><a name="2006"></a>2006. <tt>emplace</tt> broken for associative containers</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">Tentatively NAD</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2010-10-18 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively NAD">Tentatively NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The current definition of <tt>emplace(args)</tt> for associative containers as
! described in Table 99 is:
! </p><blockquote>
  <p>
! <i>Requires</i>: <tt>T</tt> shall be constructible from <tt>args</tt>.
  </p>
  <p>
! <i>Effects</i>: Inserts a <tt>T</tt> object <tt>t</tt> constructed with
! <tt>std::forward&lt;Args&gt;(args)...</tt> if and only if there is no element
! in the container with key equivalent to the key of <tt>t</tt>.  The <tt>bool</tt>
! component of the returned <tt>pair</tt> is <tt>true</tt> if and only if the
! insertion takes place, and the iterator component of the <tt>pair</tt>
! points to the element with key equivalent to the key of <tt>t</tt>.
  </p>
  </blockquote>
- <p></p>
  <p>
! There is similar language in Table 100 for unordered associative containers.
  </p>
  <p>
! The first issue is editorial: <tt>T</tt> should be <tt>value_type</tt> throughout
! both tables.
  </p>
  <p>
! The major issue is that, if the container is <tt>map</tt>, <tt>multimap</tt>,
! <tt>unordered_map</tt>, or <tt>unordered_multimap</tt>, then the only way to
! construct an object of <tt>value_type</tt> is to supply exactly two arguments
! for <tt>Key</tt> and <tt>Value</tt>, a <tt>pair&lt;Key,Value&gt;</tt>, or a
! <tt>piecewise_construct_t</tt> followed by two <tt>tuple</tt>s.  The original
! <tt>emplace()</tt> proposal would have allowed you to specify a <tt>Key</tt>
! value followed by any number of constructor arguments for <tt>Value</tt>.
! When we removed the variadic constructor to <tt>pair</tt>, this ability went
! away.  I don't think that was deliberate.
  </p>
  <p>
! Fixing this is non-trivial, I think. I think that <tt>emplace()</tt> for <tt>map</tt>
! and <tt>multimap</tt> need several overloads: one for each overloaded constructor in
! <tt>pair&lt;Key,Value&gt;</tt>, and one for the <tt>emplace(Key, valueargs...)</tt> case.
! And it probably needs some SFINAE meta-programming to ensure that the last case
! doesn't override any of the other ones.  Alternatively, one could say that
! there are exactly two cases: <tt>emplace(args)</tt> where <tt>pair&lt;Key,Value&gt;</tt>
! is constructible from <tt>args</tt>, and <tt>emplace(args)</tt> where <tt>Key</tt> is
! constructible form the first <tt>arg</tt> and <tt>Value</tt> is constructible from the
! rest.
  </p>
  <p>
! Alternatively, the status quo is to use <tt>piecewise_construct_t</tt> if you want to
! construct an object.
  </p>
  
! <p><i>[
! 2010 Batavia:
! ]</i></p>
  
  
  <p>
! N3178 was looked at in session and moved to NAD.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="2007"></a>2007. Incorrect specification of return value for <tt>map&lt;&gt;::at()</tt></h3>
! <p><b>Section:</b> 23.6.1.2 [map.access] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Ready">Tentatively Ready</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2010-11-01 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#map.access">issues</a> in [map.access].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Tentatively Ready">Tentatively Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In [map.access]/9, the <i>Returns</i> clause for <tt>map&lt;Key, T&gt;::at(x)</tt> says 
! that it returns "a reference to the element whose key is equivalent to <tt>x</tt>." That can't be right. 
! The signature for <tt>at()</tt> says that its return type is <tt>T</tt>, but the elements 
! of <tt>map&lt;Key, T&gt;</tt> have type <tt>pair&lt;const K, T&gt;</tt>.  (I checked [unord.map.elem] 
! and found that its specification of <tt>at()</tt> is correct. This is a problem for <tt>map</tt> only.)
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the wording in [map.access]/9 so it's identical to what we already say for <tt>operator[]</tt>, 
! which is unambiguous and correct.
  </p>
! <blockquote>
! <i>Returns</i>: A reference to the <del>element whose key is equivalent</del><ins><tt>mapped_type</tt> 
! corresponding</ins> to <tt>x</tt><ins> in <tt>*this</tt></ins>.
  </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="2008"></a>2008. Conflicting Error Conditions for <tt>packaged_task::operator()</tt></h3>
! <p><b>Section:</b> 30.6.10.1 [futures.task.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2010-06-21 <b>Last modified:</b> 2010-11-07</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.task.members">active issues</a> in [futures.task.members].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The Throws clause for <tt>packaged_task::operator()</tt> says that it throws "a
! <tt>future_error</tt> exception object if there is no associated asynchronous
! state or the stored task has already been invoked." However, the Error
! Conditions clause does not define an error condition when the stored task has
! already been invoked, only when the associated state is already ready (i.e. the
! invocation has completed).
  </p>
  
  
! <p><b>Proposed resolution:</b></p>
  <p>
! Change the first bullet item in 30.6.10.1 [futures.task.members] /22:
  </p>
  
! <blockquote><pre>void operator()(ArgTypes... args);
  </pre>
  <blockquote>
  <p>
! 20 ...
  </p>
  <p>
! 21 ...
  </p>
  <p>
! 22 <i>Error conditions:</i>
  </p>
! <ul>
  <li>
! <tt>promise_already_satisfied</tt> if <del>the associated asynchronous state is
! already ready</del> <ins><tt>operator()</tt> has already been called</ins>.
  </li>
  <li>
! <tt>no_state</tt> if <tt>*this</tt> has no associated asynchronous state.
  </li>
! </ul>
  </blockquote>
  </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="2009"></a>2009. Reporting out-of-bound values on numeric string conversions</h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Review">Review</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-07-19 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Review">Review</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The functions (<tt>w</tt>)<tt>stoi</tt> and (<tt>w</tt>)<tt>stof</tt>
! are specified in terms of calling C library APIs for potentially wider
! types.  The integer and floating-point versions have subtly different
! behaviour when reading values that are too large to convert.  The
! floating point case will throw <tt>out_of_bound</tt> if the read value
! is too large to convert to the wider type used in the implementation,
! but behaviour is undefined if the converted value cannot narrow to a
! float.  The integer case will throw <tt>out_of_bounds</tt> if the
! converted value cannot be represented in the narrower type, but throws
! <tt>invalid_argument</tt>, rather than <tt>out_of_bounds</tt>, if the
! conversion to the wider type fails due to overflow.
  </p>
  
  <p>
! Suggest that the Throws clause for both specifications should be
! consistent, supporting the same set of fail-modes with the matching set
! of exceptions.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 21.5p3 [string.conversions]
  </p>
  
- <blockquote><pre>int stoi(const string&amp; str, size_t *idx = 0, int base = 10);
- long stol(const string&amp; str, size_t *idx = 0, int base = 10);
- unsigned long stoul(const string&amp; str, size_t *idx = 0, int base = 10);
- long long stoll(const string&amp; str, size_t *idx = 0, int base = 10);
- unsigned long long stoull(const string&amp; str, size_t *idx = 0, int base = 10);
- </pre>
  
! <blockquote>
  <p>
! ...
  </p>
  <p>
! 3 <i>Throws:</i> <tt>invalid_argument</tt> if <tt>strtol</tt>,
! <tt>strtoul</tt>, <tt>strtoll</tt>, or <tt>strtoull</tt> reports that no
! conversion could be performed. Throws <tt>out_of_range</tt> if
! <ins><tt>strtol</tt>, <tt>strtoul</tt>, <tt>strtoll</tt> or
! <tt>strtoull</tt> sets <tt>errno</tt> to <tt>ERANGE</tt>, or if</ins>
! the converted value is outside the range of representable values for the
! return type.
  </p>
  </blockquote>
  </blockquote>
  
  <p>
! 21.5p6 [string.conversions]
  </p>
! 
! <blockquote><pre>float stof(const string&amp; str, size_t *idx = 0);
! double stod(const string&amp; str, size_t *idx = 0);
! long double stold(const string&amp; str, size_t *idx = 0);
  </pre>
! 
  <blockquote>
  <p>
! ...
  </p>
  <p>
! 6 <i>Throws:</i> <tt>invalid_argument</tt> if <tt>strtod</tt> or
! <tt>strtold</tt> reports that no conversion could be performed. Throws
! <tt>out_of_range</tt> if <tt>strtod</tt> or <tt>strtold</tt> sets
! <tt>errno</tt> to <tt>ERANGE</tt> <ins> or if the converted value is
! outside the range of representable values for the return type</ins>.
  </p>
  </blockquote>
  </blockquote>
  
  
  
--- 28107,28937 ----
  
  
  <hr>
! <h3><a name="2471"></a>2471. <tt>copy_n</tt>'s number of <tt>InputIterator</tt> increments unspecified</h3>
! <p><b>Section:</b> 25.3.1 [alg.copy] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2015-01-28 <b>Last modified:</b> 2015-05-04</p>
! <p><b>View other</b> <a href="lwg-index-open.html#alg.copy">active issues</a> in [alg.copy].</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.copy">issues</a> in [alg.copy].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! It's unspecified how many times <tt>copy_n</tt> increments the <tt>InputIterator</tt>.
! <tt>uninitialized_copy_n</tt> is specified to increment it exactly <tt>n</tt> times,
! which means if an <tt>istream_iterator</tt> is used then the next character
! after those copied is read from the stream and then discarded, losing data.
! <p/>
! I believe all three of Dinkumware, libc++ and libstdc++ implement
! <tt>copy_n</tt> with <tt>n - 1</tt> increments of the <tt>InputIterator</tt>, which avoids reading
! and discarding a character when used with <tt>istream_iterator</tt>, but is
! inconsistent with <tt>uninitialized_copy_n</tt> and causes surprising behaviour
! with <tt>istreambuf_iterator</tt> instead, because <tt>copy_n(in, 2, copy_n(in, 2,
! out))</tt> is not equivalent to <tt>copy_n(in, 4, out)</tt>
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2472"></a>2472. Heterogeneous comparisons in the standard library can result in ambiguities</h3>
! <p><b>Section:</b> 20.4.2.7 [tuple.rel], 20.7.9.2 [allocator.globals], 20.8.1.5 [unique.ptr.special], 20.8.2.2.7 [util.smartptr.shared.cmp], 20.12.5.6 [time.duration.comparisons], 20.12.6.6 [time.point.comparisons], 20.13.5 [scoped.adaptor.operators], 24.5.1.3.13 [reverse.iter.op==], 24.5.3.3.13 [move.iter.op.comp] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2015-02-07 <b>Last modified:</b> 2015-05-04</p>
! <p><b>View other</b> <a href="lwg-index-open.html#tuple.rel">active issues</a> in [tuple.rel].</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.rel">issues</a> in [tuple.rel].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
  <p>
! The standard library specifies a lot of heterogeneous comparison operators. For instance:
  </p>
+ <blockquote>
+ <pre>
+ template&lt;class... TTypes, class... UTypes&gt;
+ constexpr bool operator!=(const tuple&lt;TTypes...&gt;&amp;, const tuple&lt;UTypes...&gt;&amp;);
+ </pre>
+ </blockquote>
  <p>
! This has an unfortunate consequence:
  </p>
+ <blockquote>
+ <pre>
+ #include &lt;tuple&gt;
+ #include &lt;utility&gt;
+ 
+ using namespace std::rel_ops;
+ std::tuple&lt;int&gt; a(0);
+ bool b = a != a;
+ </pre>
  </blockquote>
  <p>
! The last line here is ill-formed due to ambiguity: it might be <tt>rel_ops::operator!=</tt>, and it might be the 
! heterogeneous tuple <tt>operator!=</tt>. These are not partially ordered, because they have different constraints: 
! <tt>rel_ops</tt> requires the types to match, whereas the tuple comparison requires both types to be tuples (but not 
! to match). The same thing happens for user code that defines its own unconstrained 
! '<tt>template&lt;typename T&gt; operator!=(const T&amp;, const T&amp;)</tt>' rather than using <tt>rel_ops</tt>.
! <p/>
! One straightforward fix would be to add a homogeneous overload for each heterogeneous comparison:
! </p>
! <blockquote>
! <pre>
! template&lt;class... TTypes&gt;
! constexpr bool operator!=(const tuple&lt;TTypes...&gt;&amp;, const tuple&lt;TTypes...&gt;&amp;);
! </pre>
! <p>
! This is then unambiguously chosen over the other options in the preceding case. FWIW, libstdc++ already does this 
! <a href="https://gcc.gnu.org/onlinedocs/gcc-4.6.4/libstdc++/api/a01065_source.html#l00788">in some cases</a>.
  </p>
+ </blockquote>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2473"></a>2473. <tt>basic_filebuf</tt>'s relation to C <tt>FILE</tt> semantics</h3>
+ <p><b>Section:</b> 27.9.1.5 [filebuf.virtuals] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Aaron Ballman <b>Opened:</b> 2015-02-09 <b>Last modified:</b> 2015-05-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#filebuf.virtuals">issues</a> in [filebuf.virtuals].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! The restrictions on reading and writing a sequence controlled by an object of class 
! <tt>basic_filebuf&lt;charT, traits&gt;</tt> are the same as for reading and writing with 
! the Standard C library <tt>FILE</tt>s. One of the restrictions placed by C is on the behavior of 
! a stream that is opened for input and output. See the C99 standard, 7.19.5.3p6 for more 
! details, but the gist is that when opened in update mode, reads and writes must have an 
! intervening file positioning or flushing call to not trigger UB.
  </p>
+ 
  <p>
! 27.9.1.5 [filebuf.virtuals] p13 specifies that <tt>basic_filebuf::seekoff()</tt> calls 
! <tt>std::fseek()</tt>. However, there is no mention of <tt>std::fseek()</tt> in 
! <tt>basic_filebuf::seekpos()</tt>, and no mention of <tt>std::fflush()</tt> in
! <tt>basic_filebuf::sync()</tt>, which seem like an oversight.
  </p>
+ 
  <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
  </p>
+ <blockquote class="note">
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li>
+ <p>Change 27.9.1.5 [filebuf.virtuals] p16 as follows [Editorial note: A footnote referring to <tt>fseek</tt> is not needed,
+ because this is already covered by the existing footnote 334]:</p>
+ <blockquote>
  <p>
! -16- Alters the file position, if possible, to correspond to the position stored in <tt>sp</tt> (as described below).
! Altering the file position performs as follows:
! </p>
! <ol>
! <li><p>if <tt>(om &amp; ios_base::out) != 0</tt>, then update the output sequence and write any unshift sequence;</p></li>
! <li><p>set the file position to <tt>sp</tt> <ins>as if by calling <tt>std::fseek(file, sp, SEEK_SET)</tt></ins>;</p></li>
! <li><p>if <tt>(om &amp; ios_base::in) != 0</tt>, then update the input sequence;</p></li>
! </ol>
! <p>
! where <tt>om</tt> is the open mode passed to the last call to <tt>open()</tt>. The operation fails if 
! <tt>is_open()</tt> returns false.
  </p>
+ </blockquote>
+ </li>
  
! <li>
! <p>Change 27.9.1.5 [filebuf.virtuals] p19 as follows and add a new footnote that mimics comparable footnotes in
! 27.9.1.4 [filebuf.members] and 27.9.1.5 [filebuf.virtuals]:</p>
! <blockquote>
! <p>
! -19- <i>Effects</i>: If a put area exists, calls <tt>filebuf::overflow</tt> to write the characters to the file<ins>, then
! flushes the file as if by calling <tt>std::fflush(file)</tt> [Footnote: The function signature <tt>fflush(FILE*)</tt> 
! is declared in <tt>&lt;cstdio&gt;</tt> (27.9.2).]</ins>. If a get area exists, the effect is implementation-defined.
! </p>
! </blockquote>
! </li>
! </ol>
! </blockquote>
  
+ <p><i>[2015-05, Lenexa]</i></p>
  
  <p>
! Aaron provides improved wording by removing the params from <tt>std::fseek()</tt> due to the concerns
! regarding the parameters on systems where <tt>fseek</tt> uses 32-bit parameters.
! <p/>
! Second wording improvement, replacing the new one see below. It
  </p>
+ <ol>
+ <li><p>drops the <tt>std::</tt></p></li>
+ <li><p>drops the footnote for <tt>fflush</tt></p></li>
+ <li><p>replaces <tt>fseek</tt> with <tt>fsetpos</tt></p></li>
+ </ol>
+ 
+ <p>
+ <strong>Previous resolution [SUPERSEDED]:</strong>
+ </p>
+ <blockquote class="note">
+ <p>This wording is relative to N4431.</p>
+ 
+ <ol>
+ <li>
+ <p>Change 27.9.1.5 [filebuf.virtuals] p16 as follows [Editorial note: A footnote referring to <tt>fseek</tt> is not needed,
+ because this is already covered by the existing footnote 334]:</p>
+ <blockquote>
+ <p>
+ -16- Alters the file position, if possible, to correspond to the position stored in <tt>sp</tt> (as described below).
+ Altering the file position performs as follows:
+ </p>
+ <ol>
+ <li><p>if <tt>(om &amp; ios_base::out) != 0</tt>, then update the output sequence and write any unshift sequence;</p></li>
+ <li><p>set the file position to <tt>sp</tt> <ins>as if by a call to <tt>std::fseek</tt></ins>;</p></li>
+ <li><p>if <tt>(om &amp; ios_base::in) != 0</tt>, then update the input sequence;</p></li>
+ </ol>
+ <p>
+ where <tt>om</tt> is the open mode passed to the last call to <tt>open()</tt>. The operation fails if 
+ <tt>is_open()</tt> returns false.
+ </p>
+ </blockquote>
+ </li>
+ 
+ <li>
+ <p>Change 27.9.1.5 [filebuf.virtuals] p19 as follows and add a new footnote that mimics comparable footnotes in
+ 27.9.1.4 [filebuf.members] and 27.9.1.5 [filebuf.virtuals]:</p>
+ <blockquote>
+ <p>
+ -19- <i>Effects</i>: If a put area exists, calls <tt>filebuf::overflow</tt> to write the characters to the file<ins>, then
+ flushes the file as if by calling <tt>std::fflush(file)</tt> [Footnote: The function signature <tt>fflush(FILE*)</tt> 
+ is declared in <tt>&lt;cstdio&gt;</tt> (27.9.2).]</ins>. If a get area exists, the effect is implementation-defined.
+ </p>
+ </blockquote>
+ </li>
+ </ol>
+ </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4431.</p>
+ 
+ <ol>
+ <li>
+ <p>Change 27.9.1.5 [filebuf.virtuals] p16 as follows [Editorial note: A footnote referring to <tt>fseek</tt> is not needed,
+ because this is already covered by the existing footnote 334]:</p>
+ <blockquote>
+ <p>
+ -16- Alters the file position, if possible, to correspond to the position stored in <tt>sp</tt> (as described below).
+ Altering the file position performs as follows:
+ </p>
+ <ol>
+ <li><p>if <tt>(om &amp; ios_base::out) != 0</tt>, then update the output sequence and write any unshift sequence;</p></li>
+ <li><p>set the file position to <tt>sp</tt> <ins>as if by a call to <tt>fsetpos</tt></ins>;</p></li>
+ <li><p>if <tt>(om &amp; ios_base::in) != 0</tt>, then update the input sequence;</p></li>
+ </ol>
+ <p>
+ where <tt>om</tt> is the open mode passed to the last call to <tt>open()</tt>. The operation fails if 
+ <tt>is_open()</tt> returns false.
+ </p>
+ </blockquote>
+ </li>
+ 
+ <li>
+ <p>Change 27.9.1.5 [filebuf.virtuals] p19 as follows and add a new footnote that mimics comparable footnotes in
+ 27.9.1.4 [filebuf.members] and 27.9.1.5 [filebuf.virtuals]:</p>
+ <blockquote>
+ <p>
+ -19- <i>Effects</i>: If a put area exists, calls <tt>filebuf::overflow</tt> to write the characters to the file<ins>, then
+ flushes the file as if by calling <tt>fflush(file)</tt></ins>. If a get area exists, the effect is implementation-defined.
+ </p>
+ </blockquote>
+ </li>
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2474"></a>2474. <tt>&lt;cmath&gt;</tt> functions unfriendly to <tt>integral_constant</tt> arguments</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Matheus Izvekov <b>Opened:</b> 2015-02-13 <b>Last modified:</b> 2015-05-04</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Using numeric wrappers with <tt>&lt;cmath&gt;</tt> functions is currently troublesome.
! Code such as: "<tt>std::exp2(std::integral_constant&lt;int, 5&gt;{})</tt>" will fail to 
! compile because of ambiguity.
! <p/>
! Arguments which are implicitly convertible to an arithmetic type should be accepted whenever
! the latter would be accepted.
! <p/>
! David Krauss pointed out that some issue may present itself with numeric libraries which provide <tt>&lt;cmath&gt;</tt> 
! equivalents in their own namespace which are not more specialized than the ones provided in <tt>&lt;cmath&gt;</tt>. 
! If the changes proposed are implemented, then cases where the user brings those into scope through ADL might become ambiguous.
! <p/>
! It's hard to assess how much breakage this would cause in the wild, and how much work it would take to fix. 
! Should this be determined to be a problem, it's possible to make the new behaviour optional, and disabled by 
! default for all user-defined types.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li>
+ <p>Change 26.8 [c.math] p11 b2 as indicated:</p>
+ <blockquote>
  <p>
! -11- Moreover, there shall be additional overloads sufficient to ensure:
  </p>
! <ol>
! <li><p>[&hellip;]</p></li>
! <li><p>Otherwise, if any arithmetic argument corresponding to a <tt>double</tt> parameter has type <tt>double</tt> or 
! <del>an integer type</del><ins>a type which is not floating-point, but which is implicitly convertible to <tt>double</tt></ins>, 
! then all arithmetic arguments corresponding to <tt>double</tt> parameters are effectively cast to <tt>double</tt>.</p></li>
! <li><p>[&hellip;]</p></li>
! </ol>
  </blockquote>
+ </li>
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2475"></a>2475. Allow overwriting of <tt>std::basic_string</tt> terminator with <tt>charT()</tt> to allow 
! cleaner interoperation with legacy APIs</h3>
! <p><b>Section:</b> 21.4.5 [string.access] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Matt Weber <b>Opened:</b> 2015-02-21 <b>Last modified:</b> 2015-05-04</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.access">issues</a> in [string.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! It is often desirable to use a <tt>std::basic_string</tt> object as a buffer when interoperating with libraries 
! that mutate null-terminated arrays of characters. In many cases, these legacy APIs write a null terminator at 
! the specified end of the provided buffer. Providing such a function with an appropriately-sized 
! <tt>std::basic_string</tt> results in undefined behavior when the <tt>charT</tt> object at the <tt>size()</tt> 
! position is overwritten, even if the value remains unchanged.
! <p/>
! Absent the ability to allow for this, applications are forced into pessimizations such as: providing 
! appropriately-sized <tt>std::vectors</tt> of <tt>charT</tt> for interoperating with the legacy API, and then 
! copying the <tt>std::vector</tt> to a <tt>std::basic_string</tt>; providing an oversized <tt>std::basic_string</tt> 
! object and then calling <tt>resize()</tt> later.
! <p/>
! A trivial example:
  </p>
+ <blockquote>
+ <pre>
+ #include &lt;string&gt;
+ #include &lt;vector&gt;
  
+ void legacy_function(char *out, size_t count) {
+   for (size_t i = 0; i &lt; count; ++i) {
+     *out++ = '0' + (i % 10);
+   }
+   *out = '\0'; // <span style="color:#C80000;font-weight:bold">if size() == count, this results in undefined behavior</span>
+ }
  
! int main() {
!   std::string s(10, '\0');
!   legacy_function(&amp;s[0], s.size()); // <span style="color:#C80000;font-weight:bold">undefined behavior</span>
! 
!   std::vector&lt;char&gt; buffer(11);
!   legacy_function(&amp;buffer[0], buffer.size() - 1);
!   std::string t(&amp;buffer[0], buffer.size() - 1); // potentially expensive copy
! 
!   std::string u(11, '\0');
!   legacy_function(&amp;u[0], u.size() - 1);
!   u.resize(u.size() - 1); // needlessly complicates the program's logic
! }
! </pre>
! </blockquote>
  <p>
! A slight relaxation of the requirement on the returned object from the element access operator would 
! allow for this interaction with no semantic change to existing programs.
  </p>
  
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li>
! <p>Edit 21.4.5 [string.access] as indicated:</p>
! <blockquote>
! <pre>
! const_reference operator[](size_type pos) const;
! reference operator[](size_type pos);
  </pre>
  <blockquote>
  <p>
! -1- <i>Requires</i>: [&hellip;]
! <p/>
! -2- <i>Returns</i>: <tt>*(begin() + pos) if pos &lt; size()</tt>. Otherwise, returns a reference to an object of type
! <tt>charT</tt> with value <tt>charT()</tt>, where modifying the object <ins>to any value other than <tt>charT()</tt></ins> 
! leads to undefined behavior.
! <p/>
! [&hellip;]
  </p>
+ </blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2476"></a>2476. <tt>scoped_allocator_adaptor</tt> is not assignable</h3>
+ <p><b>Section:</b> 20.13.1 [allocator.adaptor.syn] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2015-03-02 <b>Last modified:</b> 2015-05-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! The class definition in 20.13.1 [allocator.adaptor.syn] declares a move
! constructor, which means that the copy assignment operator is defined
! as deleted, and no move assignment operator is declared.
! <p/>
! This means a <tt>scoped_allocator_adaptor</tt> is not assignable, and a
! container using <tt>scoped_allocator_adaptor&lt;A...&gt;</tt> may not be
! <tt>CopyAssignable</tt> or <tt>MoveAssignable</tt> (depending on the
! <tt>propagate_on_container_xxxx_assignment</tt> traits of the outer and inner
! allocator types).
  </p>
+ 
+ <p><i>[2015-04-03 Howard comments]</i></p>
+ 
  <p>
! If the contained allocators are not assignable, I think we need the ability of <tt>= default</tt> to automagically become 
! <tt>= delete</tt>. My concern is that <tt>is_copy_assignable&lt;scoped_allocator_adaptor&lt;CustomAllocator&gt;&gt;::value</tt> 
! get the right answer for both cases:
  </p>
! <ol>
! <li><p><tt>is_copy_assignable&lt;CustomAllocator&gt;::value</tt> is <tt>true</tt>.</p></li>
! <li><p><tt>is_copy_assignable&lt;CustomAllocator&gt;::value</tt> is <tt>false</tt>.</p></li>
! </ol>
! <p>
! If we allow the vendor to declare and provide the copy assignment operator, the chance of getting #2 correct goes to zero.
! </p>
! 
! <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to N4296.</p>
! 
! <ol>
  <li>
! <p>Add to the synopsis in 20.13.1 [allocator.adaptor.syn]/1 [<i>Editorial remark</i>: The proposed wording
! does not explicitly specify the semantics of the added copy/move assignment operators, based on 
! 17.5.2.2 [functions.within.classes] p1, which says:
! <p/>
! "For the sake of exposition, Clauses 18 through 30 and Annex D do not describe copy/move constructors,
! assignment operators, or (non-virtual) destructors with the same apparent semantics as those that can be
! generated by default (12.1, 12.4, 12.8)."
! <p/>
! &mdash; <i>end remark</i>]:
! </p>
! <blockquote>
! <pre>
! [&hellip;]
! template &lt;class OuterA2&gt;
!   scoped_allocator_adaptor(
!     scoped_allocator_adaptor&lt;OuterA2, InnerAllocs...&gt;&amp;&amp; other) noexcept;
! <ins>
! scoped_allocator_adaptor&amp; operator=(const scoped_allocator_adaptor&amp;);
! scoped_allocator_adaptor&amp; operator=(scoped_allocator_adaptor&amp;&amp;);
! </ins>
! ~scoped_allocator_adaptor();
! [&hellip;]
! </pre>
! </blockquote>
  </li>
+ </ol>
+ </blockquote>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
+ <p>
+ Move to Immediate.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
  <li>
! <p>Add to the synopsis in 20.13.1 [allocator.adaptor.syn]/1:
! </p>
! <blockquote>
! <pre>
! [&hellip;]
! template &lt;class OuterA2&gt;
!   scoped_allocator_adaptor(
!     scoped_allocator_adaptor&lt;OuterA2, InnerAllocs...&gt;&amp;&amp; other) noexcept;
! <ins>
! scoped_allocator_adaptor&amp; operator=(const scoped_allocator_adaptor&amp;) = default;
! scoped_allocator_adaptor&amp; operator=(scoped_allocator_adaptor&amp;&amp;) = default;
! </ins>
! ~scoped_allocator_adaptor();
! [&hellip;]
! </pre>
! </blockquote>
  </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2477"></a>2477. Inconsistency of wordings in <tt>std::vector::erase()</tt> and <tt>std::deque::erase()</tt></h3>
! <p><b>Section:</b> 23.3.3.4 [deque.modifiers], 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Anton Savin <b>Opened:</b> 2015-03-03 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#deque.modifiers">issues</a> in [deque.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In the latest draft N4296, and in all drafts up to at least N3337:
! <p/>
! 23.3.3.4 [deque.modifiers]/5 (regarding <tt>deque::erase()</tt>):
! </p>
! <blockquote>
! <p>
! <i>Complexity</i>: The number of calls to the destructor is the same as the number of elements erased, but
! the number of calls to the <span style="color:#C80000;font-weight:bold">assignment operator</span> is no more 
! than the lesser of the number of elements before the erased elements and the number of elements after the erased elements.
! </p>
  </blockquote>
+ <p>
+ 23.3.6.5 [vector.modifiers]/4 (regarding <tt>vector::erase()</tt>):
+ </p>
+ <blockquote>
+ <p>
+ <i>Complexity</i>: The destructor of <tt>T</tt> is called the number of times equal to the number of the elements
+ erased, but the <span style="color:#C80000;font-weight:bold">move assignment operator</span> of <tt>T</tt> is called 
+ the number of times equal to the number of elements in the vector after the erased elements.
+ </p>
  </blockquote>
+ <p>
+ Is there any reason for explicit mentioning of move assignment for <tt>std::vector::erase()</tt>? 
+ Shouldn't these two wordings be the same with this regard?
+ <p/>
+ Also, for <tt>std::deque</tt>, it's not clear from the text which destructors and assignment operators are called.
+ </p>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
+ <p>
+ Move to Immediate.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li><p>Change 23.3.3.4 [deque.modifiers]/5 to:</p>
+ 
+ <p>
+ -5- <i>Complexity</i>: The number of calls to the destructor <ins>of <tt>T</tt></ins> is the same as the number of 
+ elements erased, but the number of calls to the assignment operator <ins>of <tt>T</tt></ins> is no more than the 
+ lesser of the number of elements before the erased elements and the number of elements after the erased elements.
+ </p>
+ </li>
+ 
+ <li><p>Change 23.3.6.5 [vector.modifiers]/4 to:</p>
+ 
+ <p>
+ -4- <i>Complexity</i>: The destructor of <tt>T</tt> is called the number of times equal to the number of the elements
+ erased, but the <del>move</del> assignment operator of <tt>T</tt> is called the number of times equal to the number of
+ elements in the vector after the erased elements.
+ </p>
+ </li>
+ </ol>
+ 
  
  
  
  
  
  <hr>
! <h3><a name="2478"></a>2478. Unclear how <tt>wstring_convert</tt> uses <tt>cvtstate</tt></h3>
! <p><b>Section:</b> 22.3.3.2.2 [conversions.string] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2015-03-04 <b>Last modified:</b> 2015-05-04</p>
! <p><b>View other</b> <a href="lwg-index-open.html#conversions.string">active issues</a> in [conversions.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! How do <tt>wstring_convert::from_bytes</tt> and <tt>wstring_convert::to_bytes</tt> use
! the <tt>cvtstate</tt> member?
! <p/>
! Is it passed to the <tt>codecvt</tt> member functions? Is a copy of it passed
! to the member functions? "Otherwise it shall be left unchanged"
! implies a copy is used, but if that's really what's intended there are
! simpler ways to say so.
  </p>
  
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2479"></a>2479. Unclear how <tt>wbuffer_convert</tt> uses <tt>cvtstate</tt></h3>
+ <p><b>Section:</b> 22.3.3.2.3 [conversions.buffer] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2015-03-04 <b>Last modified:</b> 2015-05-04</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#conversions.buffer">active issues</a> in [conversions.buffer].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#conversions.buffer">issues</a> in [conversions.buffer].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! How does <tt>wbuffer_convert</tt> use the <tt>cvtstate</tt> member?
! <p/>
! Is the same conversion state object used for converting both the get
! and put areas? That means a read which runs out of bytes halfway 
! through a multibyte character will leave some shift state in cvtstate, 
! which would then be used by a following write, even though the shift 
! state of the get area is unrelated to the put area.
  </p>
  
  
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2480"></a>2480. Error handling of <tt>wbuffer_convert</tt> unclear</h3>
+ <p><b>Section:</b> 22.3.3.2.3 [conversions.buffer] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2015-03-04 <b>Last modified:</b> 2015-05-04</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#conversions.buffer">active issues</a> in [conversions.buffer].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#conversions.buffer">issues</a> in [conversions.buffer].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ If a <tt>codecvt</tt> conversion returns <tt>codecvt_base::error</tt> should that be
+ treated as <tt>EOF</tt>? An exception? Should all the successfully converted
+ characters before a conversion error be available to the users of the
+ <tt>wbuffer_convert</tt> and/or the internal <tt>streambuf</tt>, or does a conversion
+ error lose information?
+ </p>
+ 
  
  <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2481"></a>2481. <tt>wstring_convert</tt> should be more precise regarding "byte-error string" etc.</h3>
+ <p><b>Section:</b> 22.3.3.2.2 [conversions.string] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2015-03-04 <b>Last modified:</b> 2015-05-04</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#conversions.string">active issues</a> in [conversions.string].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! Paragraph 4 of 22.3.3.2.2 [conversions.string] introduces <tt>byte_err_string</tt> 
! as "a byte string to display on errors". What does display mean? The string is returned 
! on error, it's not displayed anywhere.
! <p/>
! Paragraph 14 says "Otherwise, if the object was constructed with a
! byte-error string, the member function shall return the byte-error
! string." The term byte-error string is not used anywhere else.
! <p/>
! Paragraph 17 talks about storing "default values in <tt>byte_err_string</tt>".
! What default value? Is "Hello, world!" allowed? If it means
! default-construction it should say so. If paragraph 14 says it won't
! be used what does it matter how it's initialized? The end of the
! paragraph refers to storing "<tt>byte_err</tt> in <tt>byte_err_string</tt>". This should
! be more clearly related to the wording in paragraph 14.
! <p/>
! It might help if the constructor (and destructor) was specified before
! the other member functions, so it can more formally define the
! difference between being "constructed with a byte-error string" and
! not.
! <p/>
! All the same issues apply to the <tt>wide_err_string</tt> member.
  </p>
  
  
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2483"></a>2483. <tt>throw_with_nested()</tt> should use <tt>is_final</tt></h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2015-03-27 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#except.nested">active issues</a> in [except.nested].</p>
! <p><b>View all other</b> <a href="lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
! <p><b>Discussion:</b></p>
  <p>
! When <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2559.htm">N2559</a> was voted into the Working Paper, 
! it said "This function template must take special case to handle non-class types, unions and <tt>[[final]]</tt> classes that cannot 
! be derived from, and [...]".  However, its Standardese didn't handle <tt>final</tt> classes, and this was never revisited. Now that 
! we have <tt>is_final</tt>, we can achieve this proposal's original intention.
! <p/>
! Additionally, we need to handle the case where <tt>U</tt> is <tt>nested_exception</tt> itself. <tt>is_base_of</tt>'s wording 
! handles this and ignores <i>cv</i>-qualifiers. (Note that <tt>is_class</tt> detects "non-union class type".)
  </p>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
  <p>
! STL, MC and JW already do this<br/>
! MC: move to Ready, bring to motion on Friday<br/>
! 7 in favor, none opposed 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Change 18.8.6 [except.nested] as depicted:</p>
! 
! <blockquote>
! <pre>
! template &lt;class T&gt; [[noreturn]] void throw_with_nested(T&amp;&amp; t);
! </pre>
! <blockquote>
! <p>
! -6- Let <tt>U</tt> be <tt>remove_reference_t&lt;T&gt;</tt>.
! <p/>
! -7- Requires: <tt>U</tt> shall be <tt>CopyConstructible</tt>.
! <p/>
! -8- Throws: if <del><tt>U</tt> is a non-union class type not derived from 
! <tt>nested_exception</tt></del><ins><tt>is_class&lt;U&gt;::value &amp;&amp; !is_final&lt;U&gt;::value &amp;&amp; 
! !is_base_of&lt;nested_exception, U&gt;::value</tt> is <tt>true</tt></ins>, an exception of unspecified type that 
! is publicly derived from both <tt>U</tt> and <tt>nested_exception</tt> and constructed from 
! <tt>std::forward&lt;T&gt;(t)</tt>, otherwise <tt>std::forward&lt;T&gt;(t)</tt>.
  </p>
  </blockquote>
  </blockquote>
+ </li>
+ </ol>
  
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2484"></a>2484. <tt>rethrow_if_nested()</tt> is doubly unimplementable</h3>
+ <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2015-03-27 <b>Last modified:</b> 2015-05-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#except.nested">active issues</a> in [except.nested].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#except.nested">issues</a> in [except.nested].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! <tt>rethrow_if_nested()</tt> wants to determine "If the dynamic type of <tt>e</tt> is publicly and unambiguously derived 
! from <tt>nested_exception</tt>", but 5.2.7 [expr.dynamic.cast] specifies that <tt>dynamic_cast</tt> has a couple 
! of limitations.
! <p/>
! First, nonpolymorphic inputs. These could be non-classes, or nonpolymorphic classes. The Standardese handles non-classes, 
! although implementers need special logic. (If <tt>E</tt> is <tt>int</tt>, the dynamic type can't possibly derive from 
! <tt>nested_exception</tt>. Implementers need to detect this and avoid <tt>dynamic_cast</tt>, which would be ill-formed 
! due to 5.2.7 [expr.dynamic.cast]/2.) The Standardese is defective when <tt>E</tt> is a nonpolymorphic class.  
! Consider the following example:
  </p>
! <blockquote>
! <pre>
! struct Nonpolymorphic { };
! struct MostDerived : Nonpolymorphic, nested_exception { };
! MostDerived md;
! const Nonpolymorphic&amp; np = md;
! rethrow_if_nested(np);
  </pre>
! </blockquote>
! <p>
! According to 1.3 [defns.dynamic.type], the dynamic type of <tt>np</tt> is <tt>MostDerived</tt>. However, it's 
! physically impossible to discover this, and attempting to do so will lead to an ill-formed <tt>dynamic_cast</tt> 
! (5.2.7 [expr.dynamic.cast]/6). The Standardese must be changed to say that if <tt>E</tt> is nonpolymorphic, nothing happens.
! <p/>
! Second, statically good but dynamically bad inputs. Consider the following example:
! </p>
  <blockquote>
+ <pre>
+ struct Nested1 : nested_exception { };
+ struct Nested2 : nested_exception { };
+ struct Ambiguous : Nested1, Nested2 { };
+ Ambiguous amb;
+ const Nested1&amp; n1 = amb;
+ rethrow_if_nested(n1);
+ </pre>
+ </blockquote>
  <p>
! Here, the static type <tt>Nested1</tt> is good (i.e. publicly and unambiguously derived from <tt>nested_exception</tt>), but 
! the dynamic type <tt>Ambiguous</tt> is bad. The Standardese currently says that we have to detect the dynamic badness, but 
! <tt>dynamic_cast</tt> won't let us. 5.2.7 [expr.dynamic.cast]/3 and /5 are special cases (identity-casting and upcasting, 
! respectively) that activate before the "run-time check" behavior that we want (/6 and below). Statically good inputs succeed 
! (regardless of the dynamic type) and statically bad inputs are ill-formed (implementers must use type traits to avoid this).
! <p/>
! It might be possible to implement this with clever trickery involving virtual base classes, but implementers shouldn't be asked 
! to do that.  It would definitely be possible to implement this with a compiler hook (a special version of <tt>dynamic_cast</tt>), 
! but implementers shouldn't be asked to do so much work for such an unimportant case. (This case is pathological because the 
! usual way of adding <tt>nested_exception</tt> inheritance is <tt>throw_with_nested()</tt>, which avoids creating bad inheritance.)  
! The Standardese should be changed to say that statically good inputs are considered good.
! <p/>
! Finally, we want <tt>is_base_of</tt>'s "base class or same class" semantics. If the static type is <tt>nested_exception</tt>, 
! we have to consider it good due to <tt>dynamic_cast</tt>'s identity-casting behavior. And if the dynamic type is 
! <tt>nested_exception</tt>, it is definitely good.
  </p>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
  <p>
! WB: so the <tt>is_polymorphic</tt> trait must be used?<br/>
! STL and JW: yes, that must be used to decide whether to try using <tt>dynamic_cast</tt> or not.<br/>
! JW: I'd already made this fix in our implementation<br/>
! STL: the harder case also involves <tt>dynamic_cast</tt>. should not try using <tt>dynamic_cast</tt> if we can 
! statically detect it is OK, doing the <tt>dynamic_cast</tt> might fail.<br/>
! STL: finally, want "is the same or derived from" behaviour of <tt>is_base_of</tt><br/>
! WB: should there be an "else no effect" at the end? We have "Otherwise, if ..." and nothing saying what if the condition is false.<br/>
! TP I agree.<br/>
! MC: move to Ready and bring to motion on Friday<br/>
! 7 in favor, none opposed 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Change 18.8.6 [except.nested] as depicted:</p>
! 
! <blockquote>
! <pre>
! template &lt;class E&gt; void rethrow_if_nested(const E&amp; e);
! </pre>
! <blockquote>
! <p>
! -9- <i>Effects</i>: If <ins><tt>E</tt> is not a polymorphic class type, there is no effect. Otherwise, if the static 
! type or</ins> the dynamic type of <tt>e</tt> <ins>is <tt>nested_exception</tt> or</ins> is publicly and unambiguously 
! derived from <tt>nested_exception</tt>, calls <tt>dynamic_cast&lt;const nested_exception&amp;&gt;(e).rethrow_nested()</tt>.
  </p>
  </blockquote>
  </blockquote>
+ </li>
+ </ol>
  
  
  
*************** outside the range of representable value
*** 7528,7718 ****
  
  
  <hr>
! <h3><a name="2010"></a>2010. <tt>is_* traits</tt> for binding operations can't be meaningfully specialized</h3>
! <p><b>Section:</b> 20.8.10.1.1 [func.bind.isbind] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2010-07-19 <b>Last modified:</b> 2010-11-16</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.bind.isbind">issues</a> in [func.bind.isbind].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.8.10.1.1 [func.bind.isbind] says for <tt>is_bind_expression</tt>:
  </p>
- 
  <blockquote>
! Users may specialize this template to indicate that a type should be
! treated as a subexpression in a <tt>bind</tt> call.
  </blockquote>
  
  <p>
! But it also says:
  </p>
  
  <blockquote>
! If <tt>T</tt> is a type returned from <tt>bind</tt>,
! <tt>is_bind_expression&lt;T&gt;</tt> shall be publicly derived from
! <tt>integral_constant&lt;bool, true&gt;</tt>, otherwise from
! <tt>integral_constant&lt;bool, false&gt;</tt>.
  </blockquote>
  
  <p>
! This means that while the user is free to specialize, any specialization
! would have to be <tt>false</tt> to avoid violating the second
! requirement. A similar problem exists for <tt>is_placeholder</tt>.
  </p>
  
  
! <p><i>[
! 2010 Batavia (post meeting session)
! ]</i></p>
  
  <p>
! Alisdair recognises this is clearly a bug introduced by some wording he
! wrote, the sole purpose of this metafunction is as a customization point
! for users to write their own <tt>bind</tt>-expression types that participate
! in the standard library <tt>bind</tt> protocol.  The consensus was that this
! should be fixed in Madrid, moved to Open.
  </p>
  
- <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="2011"></a>2011. unexpected output required of strings</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Open">Open</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2010-07-23 <b>Last modified:</b> 2010-11-16</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Open">Open</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! What should the following code output? 
  </p>
  
! <blockquote><pre>#include &lt;string&gt;
! #include &lt;iostream&gt;
! #include &lt;iomanip&gt;
  
! int 
! main() 
! { 
!    std::string test("0X1Y2Z"); 
!    std::cout.fill('*'); 
!    std::cout.setf(std::ios::internal, std::ios::adjustfield); 
!    std::cout &lt;&lt; std::setw(8) &lt;&lt; test &lt;&lt; std::endl; 
! } 
! </pre></blockquote>
  
  <p>
! I would expect "<tt>**0X1Y2Z</tt>", and this is what the compilers I have access
! to (VC++, g++ and Sun CC) do.  But according to the standard, it should be
! "<tt>0X**1Y2Z</tt>":
  </p>
  
  <p>
! 21.4.8.9 [string.io]/5: 
  </p>
  
! <blockquote><pre>template&lt;class charT, class traits, class Allocator&gt;
!   basic_ostream&lt;charT, traits&gt;&amp;
!     operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp; os, const basic_string&lt;charT,traits,Allocator&gt;&amp; str);
! </pre><blockquote>
! <i>Effects:</i> Behaves as a formatted output function (27.7.2.6.1 [ostream.formatted.reqmts]). After constructing a <tt>sentry</tt>
! object, if this object returns <tt>true</tt> when converted to a value of type
! <tt>bool</tt>, determines padding as described in 22.4.2.2.2 [facet.num.put.virtuals], then inserts the resulting sequence of
! characters seq as if by calling <tt>os.rdbuf()-&gt;sputn(seq, n)</tt>, where
! <tt>n</tt> is the larger of <tt>os.width()</tt> and <tt>str.size()</tt>; then
! calls <tt>os.width(0)</tt>.
! </blockquote>
! </blockquote>
  
  <p>
! 22.4.2.2.2 [facet.num.put.virtuals]/5: 
  </p>
  
  <blockquote>
  <p>
! [...] 
  </p>
! 
  <p>
! <b>Stage 3:</b> A local variable is initialized as
  </p>
  
- <blockquote><pre>fmtflags adjustfield= (flags &amp; (ios_base::adjustfield));
- </pre></blockquote>
  
  <p>
! The location of any padding is determined according to Table 88. 
  </p>
  
  <p>
! If <tt>str.width()</tt> is nonzero and the number of <tt>charT</tt>'s in the
! sequence after stage 2 is less than <tt>str.width()</tt>, then enough fill
! characters are added to the sequence at the position indicated for padding to
! bring the length of the sequence to <tt>str.width()</tt>. <tt>str.width(0)</tt>
! is called.
  </p>
  
- <table border="1">
- <caption>Table 88 — Fill padding</caption>
- <tbody><tr>
- <th>State</th>
- <th>Location</th>
- </tr>
  
- <tr>
- <td><tt>adjustfield == ios_base::left</tt></td>
- <td>pad after</td>
- </tr>
  
! <tr>
! <td><tt>adjustfield == ios_base::right</tt></td>
! <td>pad before</td>
! </tr>
  
! <tr>
! <td><tt>adjustfield == internal</tt> and a sign occurs in the representation</td>
! <td>pad after the sign</td>
! </tr>
  
! <tr>
! <td><tt>adjustfield == internal</tt> and representation after stage 1 began with 0x or 0X</td>
! <td>pad after x or X</td>
! </tr>
  
! <tr>
! <td><i>otherwise</i></td>
! <td>pad before</td>
! </tr>
! </tbody></table>
  
  </blockquote>
  
  <p>
! Although it's not 100% clear what "the sequence after stage 2" should mean here,
! when there is no stage 2, the only reasonable assumption is that it is the
! contents of the string being output.  In the above code, the string being output
! is "<tt>0X1Y2Z</tt>", which starts with "<tt>0X</tt>", so the padding should be
! inserted "after x or X", and not before the string. I believe that this is a
! defect in the standard, and not in the three compilers I tried.
  </p>
  
  
  
  
- <p><i>[
- 2010 Batavia (post meeting session)
- ]</i></p>
  
  <p>
! Consensus that all known implementations are consistent, and disagree with the
! standard.  Preference is to fix the standard before implementations start trying
! to conform to the current spec, as the current implementations have the preferred
! form.  Howard volunteered to drught for Madrid, move to Open.
  </p>
  
  <p><b>Proposed resolution:</b></p>
  
  
--- 28939,29541 ----
  
  
  <hr>
! <h3><a name="2485"></a>2485. <tt>get()</tt> should be overloaded for <tt>const tuple&amp;&amp;</tt></h3>
! <p><b>Section:</b> 20.4.2.6 [tuple.elem] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2015-03-27 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.elem">issues</a> in [tuple.elem].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! <tt>const</tt> rvalues are weird, but they're part of the type system. Consider the following code:
  </p>
  <blockquote>
! <pre>
! #include &lt;functional&gt;
! #include &lt;string&gt;
! #include &lt;tuple&gt;
! 
! using namespace std; 
! 
! string str1() { return "one"; }
! const string str2() { return "two"; }
! tuple&lt;string&gt; tup3() { return make_tuple("three"); }
! const tuple&lt;string&gt; tup4() { return make_tuple("four"); }
! 
! int main() {
!   // cref(str1()); // BAD, properly rejected
!   // cref(str2()); // BAD, properly rejected
!   // cref(get&lt;0&gt;(tup3())); // BAD, properly rejected
!   cref(get&lt;0&gt;(tup4())); // BAD, but improperly accepted!
! }
! </pre>
  </blockquote>
+ <p>
+ As <tt>tuple</tt> is a fundamental building block (and the only convenient way to have variadic data members), it should 
+ not open a hole in the type system. <tt>get()</tt> should imitate 5.2.5 [expr.ref]'s rules for accessing data members.  
+ (This is especially true for <tt>pair</tt>, where both <tt>get&lt;0&gt;()</tt> and <tt>.first</tt> are available.)
+ <p/>
+ While we're in the neighborhood, we can dramatically simplify the wording here. All we need to do is follow 
+ 20.4.2.6 [tuple.elem]/9's example of saying "Returns: A reference to STUFF", and allow implementers to figure out how 
+ to achieve that with the given return types.
+ </p>
+ 
+ <p><i>[2015-05, Lenexa]</i></p>
  
  <p>
! TP: for the existing overloads there's no change to the code, just descriptions?<br/>
! STL: right.<br/>
! JW: I love it<br/>
! MC: in favor of moving to Ready and bringing up for vote on Friday<br/>
! 7 in favor, none opposed 
  </p>
  
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li><p>Change 20.2 [utility]/2 "Header <tt>&lt;utility&gt;</tt> synopsis" as depicted:</p>
+ 
  <blockquote>
! <pre>
! [&hellip;]
! template&lt;size_t I, class T1, class T2&gt;
!   constexpr tuple_element_t&lt;I, pair&lt;T1, T2&gt;&gt;&amp;
!     get(pair&lt;T1, T2&gt;&amp;) noexcept;
! template&lt;size_t I, class T1, class T2&gt;
!   constexpr tuple_element_t&lt;I, pair&lt;T1, T2&gt;&gt;&amp;&amp;
!     get(pair&lt;T1, T2&gt;&amp;&amp;) noexcept;
! template&lt;size_t I, class T1, class T2&gt;
!   constexpr const tuple_element_t&lt;I, pair&lt;T1, T2&gt;&gt;&amp;
!     get(const pair&lt;T1, T2&gt;&amp;) noexcept;
! <ins>template&lt;size_t I, class T1, class T2&gt;
!   constexpr const tuple_element_t&lt;I, pair&lt;T1, T2&gt;&gt;&amp;&amp;
!     get(const pair&lt;T1, T2&gt;&amp;&amp;) noexcept;</ins>
! template &lt;class T, class U&gt;
!   constexpr T&amp; get(pair&lt;T, U&gt;&amp; p) noexcept;
! template &lt;class T, class U&gt;
!   constexpr const T&amp; get(const pair&lt;T, U&gt;&amp; p) noexcept;
! template &lt;class T, class U&gt;
!   constexpr T&amp;&amp; get(pair&lt;T, U&gt;&amp;&amp; p) noexcept;
! <ins>template &lt;class T, class U&gt;
!   constexpr const T&amp;&amp; get(const pair&lt;T, U&gt;&amp;&amp; p) noexcept;</ins>
! template &lt;class T, class U&gt;
!   constexpr T&amp; get(pair&lt;U, T&gt;&amp; p) noexcept;
! template &lt;class T, class U&gt;
!   constexpr const T&amp; get(const pair&lt;U, T&gt;&amp; p) noexcept;
! template &lt;class T, class U&gt;
!   constexpr T&amp;&amp; get(pair&lt;U, T&gt;&amp;&amp; p) noexcept;
! <ins>template &lt;class T, class U&gt;
!   constexpr const T&amp;&amp; get(const pair&lt;U, T&gt;&amp;&amp; p) noexcept;</ins>
! [&hellip;]
! </pre>
  </blockquote>
+ </li>
+ 
+ <li><p>Change 20.4.1 [tuple.general]/2 "Header <tt>&lt;tuple&gt;</tt> synopsis" as depicted:</p>
  
+ <blockquote>
+ <pre>
+ [&hellip;]
+ <i>// 20.4.2.6, element access:</i>
+ template &lt;size_t I, class... Types&gt;
+ constexpr tuple_element_t&lt;I, tuple&lt;Types...&gt;&gt;&amp;
+ get(tuple&lt;Types...&gt;&amp;) noexcept;
+ template &lt;size_t I, class... Types&gt;
+ constexpr tuple_element_t&lt;I, tuple&lt;Types...&gt;&gt;&amp;&amp;
+ get(tuple&lt;Types...&gt;&amp;&amp;) noexcept;
+ template &lt;size_t I, class... Types&gt;
+ constexpr const tuple_element_t&lt;I, tuple&lt;Types...&gt;&gt;&amp;
+ get(const tuple&lt;Types...&gt;&amp;) noexcept;
+ <ins>template &lt;size_t I, class... Types&gt;
+ constexpr const tuple_element_t&lt;I, tuple&lt;Types...&gt;&gt;&amp;&amp;
+ get(const tuple&lt;Types...&gt;&amp;&amp;) noexcept;</ins>
+ template &lt;class T, class... Types&gt;
+ constexpr T&amp; get(tuple&lt;Types...&gt;&amp; t) noexcept;
+ template &lt;class T, class... Types&gt;
+ constexpr T&amp;&amp; get(tuple&lt;Types...>&amp;&amp; t) noexcept;
+ template &lt;class T, class... Types&gt;
+ constexpr const T&amp; get(const tuple&lt;Types...&gt;&amp; t) noexcept;
+ <ins>template &lt;class T, class... Types&gt;
+ constexpr const T&amp;&amp; get(const tuple&lt;Types...&gt;&amp;&amp; t) noexcept;</ins>
+ [&hellip;]
+ </pre>
+ </blockquote>
+ </li>
+ 
+ <li><p>Change 23.3.1 [sequences.general]/2 "Header <tt>&lt;array&gt;</tt> synopsis" as depicted:</p>
+ 
+ <blockquote>
+ <pre>
+ [&hellip;]
+ template &lt;size_t I, class T, size_t N&gt;
+ constexpr T&amp; get(array&lt;T, N&gt;&amp;) noexcept;
+ template &lt;size_t I, class T, size_t N&gt;
+ constexpr T&amp;&amp; get(array&lt;T, N&gt;&amp;&amp;) noexcept;
+ template &lt;size_t I, class T, size_t N&gt;
+ constexpr const T&amp; get(const array&lt;T, N&gt;&amp;) noexcept;
+ <ins>template &lt;size_t I, class T, size_t N&gt;
+ constexpr const T&amp;&amp; get(const array&lt;T, N&gt;&amp;&amp;) noexcept;</ins>
+ [&hellip;]
+ </pre>
+ </blockquote>
+ </li>
+ 
+ <li><p>Change 20.3.4 [pair.astuple] as depicted:</p>
+ 
+ <blockquote>
+ <pre>
+ template&lt;size_t I, class T1, class T2&gt;
+ constexpr tuple_element_t&lt;I, pair&lt;T1, T2&gt;&gt;&amp;
+ get(pair&lt;T1, T2&gt;&amp; p) noexcept;
+ template&lt;size_t I, class T1, class T2&gt;
+ constexpr const tuple_element_t&lt;I, pair&lt;T1, T2&gt;&gt;&amp;
+ get(const pair&lt;T1, T2&gt;&amp; p) noexcept;
+ </pre>
+ <blockquote>
  <p>
! <del>-3- <i>Returns</i>: If <tt>I == 0</tt> returns <tt>p.first</tt>; if <tt>I == 1</tt> returns <tt>p.second</tt>; 
! otherwise the program is ill-formed.</del>
  </p>
+ </blockquote>
+ <pre>
+ template&lt;size_t I, class T1, class T2&gt;
+ constexpr tuple_element_t&lt;I, pair&lt;T1, T2&gt;&gt;&amp;&amp;
+ get(pair&lt;T1, T2&gt;&amp;&amp; p) noexcept;
+ <ins>template&lt;size_t I, class T1, class T2&gt;
+ constexpr const tuple_element_t&lt;I, pair&lt;T1, T2&gt;&gt;&amp;&amp;
+ get(const pair&lt;T1, T2&gt;&amp;&amp; p) noexcept;</ins>
+ </pre>
+ <blockquote>
+ <p>
+ -4- <i>Returns</i>: If <tt>I == 0</tt> returns <ins>a reference to</ins> 
+ <tt><del>std::forward&lt;T1&amp;&amp;&gt;(</del>p.first<del>)</del></tt>; if <tt>I == 1</tt> 
+ returns <ins>a reference to</ins> <tt><del>std::forward&lt;T2&amp;&amp;&gt;(</del>p.second<del>)</del></tt>; 
+ otherwise the program is ill-formed.
+ </p>
+ </blockquote>
+ <pre>
+ template &lt;class T, class U&gt;
+ constexpr T&amp; get(pair&lt;T, U&gt;&amp; p) noexcept;
+ template &lt;class T, class U&gt;
+ constexpr const T&amp; get(const pair&lt;T, U&gt;&amp; p) noexcept;
+ </pre>
+ <blockquote>
+ <p>
+ <del>-5- Requires: <tt>T</tt> and <tt>U</tt> are distinct types. Otherwise, the program is ill-formed.</del>
+ <p/>
+ <del>-6- Returns: <tt>get&lt;0&gt;(p)</tt>;</del>
+ </p>
+ </blockquote>
+ <pre>
+ template &lt;class T, class U&gt;
+ constexpr T&amp;&amp; get(pair&lt;T, U&gt;&amp;&amp; p) noexcept;
+ <ins>template &lt;class T, class U&gt;
+ constexpr const T&amp;&amp; get(const pair&lt;T, U&gt;&amp;&amp; p) noexcept;</ins>
+ </pre>
+ <blockquote>
+ <p>
+ -7- Requires: <tt>T</tt> and <tt>U</tt> are distinct types. Otherwise, the program is ill-formed.
+ <p/>
+ -8- Returns: <ins>A reference to <tt>p.first</tt>.</ins><del><tt>get&lt;0&gt;(std::move(p))</tt>;</del>
+ </p>
+ </blockquote>
+ <pre>
+ template &lt;class T, class U&gt;
+ constexpr T&amp; get(pair&lt;U, T&gt;&amp; p) noexcept;
+ template &lt;class T, class U&gt;
+ constexpr const T&amp; get(const pair&lt;U, T&gt;&amp; p) noexcept;
+ </pre>
+ <blockquote>
+ <p>
+ <del>-9- Requires: <tt>T</tt> and <tt>U</tt> are distinct types. Otherwise, the program is ill-formed.</del>
+ <p/>
+ <del>-10- Returns: <tt>get&lt;1&gt;(p)</tt>;</del>
+ </p>
+ </blockquote>
+ <pre>
+ template &lt;class T, class U&gt;
+ constexpr T&amp;&amp; get(pair&lt;U, T&gt;&amp;&amp; p) noexcept;
+ <ins>template &lt;class T, class U&gt;
+ constexpr const T&amp;&amp; get(const pair&lt;U, T&gt;&amp;&amp; p) noexcept;</ins>
+ </pre>
+ <blockquote>
+ <p>
+ -11- Requires: <tt>T</tt> and <tt>U</tt> are distinct types. Otherwise, the program is ill-formed.
+ <p/>
+ -12- Returns: <ins>A reference to <tt>p.second</tt>.</ins><del><tt>get&lt;1&gt;(std::move(p))</tt>;</del>
+ </p>
+ </blockquote>
+ </blockquote>
+ </li>
  
+ <li><p>Change 20.4.2.6 [tuple.elem] as depicted:</p>
  
! <blockquote>
! <pre>
! template &lt;size_t I, class... Types&gt;
!   constexpr tuple_element_t&lt;I, tuple&lt;Types...&gt; &gt;&amp; get(tuple&lt;Types...&gt;&amp; t) noexcept;
! </pre>
! <blockquote>
! <p>
! <del>-1- <i>Requires</i>: <tt>I &lt; sizeof...(Types)</tt>. The program is ill-formed if <tt>I</tt> is out of bounds.</del>
! <p/>
! <del>-2- <i>Returns</i>: A reference to the <tt>I</tt>th element of <tt>t</tt>, where indexing is zero-based.</del>
! </p>
! </blockquote>
! <pre>
! template &lt;size_t I, class... Types&gt;
!   constexpr tuple_element_t&lt;I, tuple&lt;Types...&gt; &gt;&amp;&amp; get(tuple&lt;Types...&gt;&amp;&amp; t) noexcept; <ins><i>// Note A</i></ins>
! </pre>
! <blockquote>
! <p>
! <del>-3- <i>Effects</i>: Equivalent to return std::forward&lt;typename tuple_element&lt;I, tuple&lt;Types...&gt; &gt;::type&amp;&amp;&gt;(get&lt;I&gt;(t));</del>
! <p/>
! <del>-4- <i>Note</i>: if a <tt>T</tt> in <tt>Types</tt> is some reference type <tt>X&amp;</tt>, the return type is <tt>X&amp;</tt>, not 
! <tt>X&amp;&amp;</tt>. However, if the element type is a non-reference type <tt>T</tt>, the return type is <tt>T&amp;&amp;</tt>.</del>
! </p>
! </blockquote>
! <pre>
! template &lt;size_t I, class... Types&gt;
!   constexpr tuple_element_t&lt;I, tuple&lt;Types...&gt; &gt; const&amp; get(const tuple&lt;Types...&gt;&amp; t) noexcept; <ins><i>// Note B</i></ins>
! <ins>template &lt;size_t I, class... Types&gt;
!   constexpr const tuple_element_t&lt;I, tuple&lt;Types...&gt; &gt;&amp;&amp; get(const tuple&lt;Types...&gt;&amp;&amp; t) noexcept;</ins>  
! </pre>
! <blockquote>
! <p>
! -5- <i>Requires</i>: <tt>I &lt; sizeof...(Types)</tt>. The program is ill-formed if <tt>I</tt> is out of bounds.
! <p/>
! -6- <i>Returns</i>: A <del>const</del> reference to the <tt>I</tt>th element of <tt>t</tt>, where indexing is zero-based.
! <p/>
! <ins>-?- [<i>Note A</i>: if a <tt>T</tt> in <tt>Types</tt> is some reference type <tt>X&amp;</tt>, the return type is <tt>X&amp;</tt>, 
! not <tt>X&amp;&amp;</tt>. However, if the element type is a non-reference type <tt>T</tt>, the return type is <tt>T&amp;&amp;</tt>. 
! &mdash; <i>end note</i>]</ins>
! <p/>
! -7- [<i>Note <ins>B</ins></i>: Constness is shallow. If a <tt>T</tt> in <tt>Types</tt> is some reference type <tt>X&amp;</tt>, 
! the return type is <tt>X&amp;</tt>, not <tt>const X&amp;</tt>. However, if the element type is non-reference type <tt>T</tt>, 
! the return type is <tt>const T&amp;</tt>. This is consistent with how constness is defined to work for member variables of 
! reference type. &mdash; <i>end note</i>]
! </p>
! </blockquote>
! <pre>
! template &lt;class T, class... Types&gt;
!   constexpr T&amp; get(tuple&lt;Types...&gt;&amp; t) noexcept;
! template &lt;class T, class... Types&gt;
!   constexpr T&amp;&amp; get(tuple&lt;Types...&gt;&amp;&amp; t) noexcept;
! template &lt;class T, class... Types&gt;
!   constexpr const T&amp; get(const tuple&lt;Types...&gt;&amp; t) noexcept;
! <ins>template &lt;class T, class... Types&gt;
!   constexpr const T&amp;&amp; get(const tuple&lt;Types...&gt;&amp;&amp; t) noexcept;</ins>
! </pre>
! <blockquote>
! <p>
! -8- <i>Requires</i>: The type <tt>T</tt> occurs exactly once in <tt>Types...</tt>. Otherwise, the program is ill-formed.
! <p/>
! -9- <i>Returns</i>: A reference to the element of <tt>t</tt> corresponding to the type <tt>T</tt> in <tt>Types...</tt>.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 23.3.2.9 [array.tuple] as depicted:</p>
  
+ <blockquote>
+ <pre>
+ template &lt;size_t I, class T, size_t N&gt;
+ <ins>  </ins>constexpr T&amp; get(array&lt;T, N&gt;&amp; a) noexcept;
+ </pre>
+ <blockquote>
  <p>
! <del>-3- <i>Requires</i>: <tt>I &lt; N</tt>. The program is ill-formed if <tt>I</tt> is out of bounds.</del>
! <p/>
! <del>-4- <i>Returns</i>: A reference to the <tt>I</tt>th element of <tt>a</tt>, where indexing is zero-based.</del>
! </p>
! </blockquote>
! <pre>
! template &lt;size_t I, class T, size_t N&gt;
! <ins>  </ins>constexpr T&amp;&amp; get(array&lt;T, N&gt;&amp;&amp; a) noexcept;
! </pre>
! <blockquote>
! <p>
! <del>-5- <i>Effects</i>: Equivalent to <tt>return std::move(get&lt;I&gt;(a));</tt></del>
  </p>
+ </blockquote>
+ <pre>
+ template &lt;size_t I, class T, size_t N&gt;
+ <ins>  </ins>constexpr const T&amp; get(const array&lt;T, N&gt;&amp; a) noexcept;
+ <ins>template &lt;size_t I, class T, size_t N&gt;
+   constexpr const T&amp;&amp; get(const array&lt;T, N&gt;&amp;&amp; a) noexcept;</ins>
+ </pre>
+ <blockquote>
+ <p>
+ -6- <i>Requires</i>: <tt>I &lt; N</tt>. The program is ill-formed if <tt>I</tt> is out of bounds.
+ <p/>
+ -7- <i>Returns</i>: A <del>const</del> reference to the <tt>I</tt>th element of <tt>a</tt>, where indexing is zero-based.
+ </p>
+ </blockquote>
+ </blockquote>
+ </li>
+ 
+ 
+ </ol>
  
  
  
  
  
  
  <hr>
! <h3><a name="2486"></a>2486. <tt>mem_fn()</tt> should be required to use perfect forwarding</h3>
! <p><b>Section:</b> 20.9.2 [func.require] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2015-03-27 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.require">active issues</a> in [func.require].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.require">issues</a> in [func.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.9.2 [func.require]/4 defines "simple call wrapper" and "forwarding call wrapper". Only <tt>mem_fn()</tt> is 
! specified to be a "simple call wrapper", by 20.9.11 [func.memfn]/1: "A simple call wrapper (20.9.1) <tt>fn</tt> 
! such that the expression <tt>fn(t, a2, ..., aN)</tt> is equivalent to <tt>INVOKE(pm, t, a2, ..., aN)</tt> (20.9.2)."
! <p/>
! This suggests, but doesn't outright state, that perfect forwarding is involved. It matters for PMFs like 
! <tt>R (T::*)(Arg)</tt> where <tt>Arg</tt> is passed by value &mdash; if the <tt>mem_fn()</tt> wrapper's function call 
! operator takes <tt>Arg</tt> by value, an extra copy/move will be observable. We should require perfect forwarding here.
  </p>
  
! <p><i>[2015-05, Lenexa]</i></p>
  
! <p>
! Move to Immediate.
! </p>
  
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li><p>Change 20.9.2 [func.require] as depicted [<i>Editorial remark</i>: This simply adds "A simple call wrapper 
+ is a <ins>forwarding</ins> call wrapper", then moves the sentence. &mdash; <i>end of remark</i>]:</p>
+ 
+ <blockquote>
  <p>
! -4- Every call wrapper (20.9.1) shall be <tt>MoveConstructible</tt>. <del>A <i>simple call wrapper</i> is a call wrapper that is
! <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt> and whose copy constructor, move constructor, and assignment
! operator do not throw exceptions.</del> A <i>forwarding call wrapper</i> is a call wrapper that can be called with
! an arbitrary argument list and delivers the arguments to the wrapped callable object as references. This
! forwarding step shall ensure that rvalue arguments are delivered as rvalue-references and lvalue arguments
! are delivered as lvalue-references. <ins>A <i>simple call wrapper</i> is a forwarding call wrapper that is <tt>CopyConstructible</tt> 
! and <tt>CopyAssignable</tt> and whose copy constructor, move constructor, and assignment operator do not throw exceptions.</ins> 
! [<i>Note</i>: In a typical implementation [&hellip;] &mdash; <i>end note</i>]
  </p>
+ </blockquote>
+ </li>
+ 
+ </ol>
+ 
+ 
+ 
  
+ 
+ 
+ <hr>
+ <h3><a name="2487"></a>2487. <tt>bind()</tt> should be <tt>const</tt>-overloaded, not <i>cv</i>-overloaded</h3>
+ <p><b>Section:</b> 20.9.10.3 [func.bind.bind] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2015-03-27 <b>Last modified:</b> 2015-05-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#func.bind.bind">issues</a> in [func.bind.bind].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! The Standard currently requires <tt>bind()</tt> to return something with a <i>cv</i>-overloaded function call operator.  
! <tt>const</tt> is great, but <tt>volatile</tt> is not. First, the Library almost always ignores <tt>volatile</tt>'s 
! existence (with <tt>&lt;type_traits&gt;</tt> and <tt>&lt;atomic&gt;</tt> being rare exceptions). Second, implementations 
! typically store bound arguments in a <tt>tuple</tt>, but <tt>get()</tt> isn't overloaded for <tt>volatile tuple</tt>. Third, 
! when a bound argument is a <tt>reference_wrapper</tt>, we have to call <tt>tid.get()</tt>, but that won't compile for a 
! <tt>volatile reference_wrapper</tt>. Finally, <tt>const</tt> and <tt>volatile</tt> don't always have to be handled symmetrically 
! &mdash; for example, lambda function call operators are <tt>const</tt> by default, but they can't ever be <tt>volatile</tt>.
! <p/>
! Implementers shouldn't be required to provide <i>cv</i>-overloading here. (They can provide it as a conforming extension if 
! they want.)
  </p>
  
! <p><i>[2015-05, Lenexa]</i></p>
  
  <p>
! JW: why would a <tt>reference_wrapper</tt> be volatile?<br/>
! STL: if a bound argument is a <tt>reference_wrapper</tt> then in a volatile-qualified operator() that 
! member will be volatile so you can't call get() on it<br/>
! STL: worded like this it's a conforming extension to kep overloading on volatile<br/>
! HH: libc++ doesn't overload on volatile<br/>
! JW: libstdc++ does overload for volatile<br/>
! MC: move to Ready and bring motion on Friday<br/>
! 10 in favor, none opposed 
  </p>
  
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4296.</p>
+ 
+ <ol>
+ <li><p>Change 20.9.10.3 [func.bind.bind] as depicted:</p>
+ 
+ <blockquote>
+ <pre>
+ template&lt;class F, class... BoundArgs&gt;
+   <i>unspecified</i> bind(F&amp;&amp; f, BoundArgs&amp;&amp;... bound_args);
+ </pre>
  <blockquote>
  <p>
! -2- <i>Requires</i>: <tt>is_constructible&lt;FD, F&gt;::value</tt> shall be <tt>true</tt>. For each <tt>Ti</tt> 
! in <tt>BoundArgs</tt>, <tt>is_constructible&lt;TiD, Ti&gt;::value</tt> shall be <tt>true</tt>. 
! <tt><i>INVOKE</i>(fd, w1, w2, ..., wN)</tt> (20.9.2) shall be a valid expression for some values <tt>w1</tt>, <tt>w2</tt>, 
! ..., <tt>wN</tt>, where <tt>N == sizeof...(bound_args)</tt>. <ins>The <i>cv</i>-qualifiers <i>cv</i> of the call 
! wrapper <tt>g</tt>, as specified below, shall be neither <tt>volatile</tt> nor <tt>const volatile</tt>.</ins>
! <p/>
! [&hellip;]
  </p>
! </blockquote>
! <pre>
! template&lt;class R, class F, class... BoundArgs&gt;
!   <i>unspecified</i> bind(F&amp;&amp; f, BoundArgs&amp;&amp;... bound_args);
! </pre>
! <blockquote>
  <p>
! -6- <i>Requires</i>: <tt>is_constructible&lt;FD, F&gt;::value</tt> shall be <tt>true</tt>. For each <tt>Ti</tt> 
! in <tt>BoundArgs</tt>, <tt>is_constructible&lt;TiD, Ti&gt;::value</tt> shall be <tt>true</tt>. 
! <tt><i>INVOKE</i>(fd, w1, w2, ..., wN)</tt> shall be a valid expression for some values <tt>w1</tt>, <tt>w2</tt>, 
! ..., <tt>wN</tt>, where <tt>N == sizeof...(bound_args)</tt>. <ins>The <i>cv</i>-qualifiers <i>cv</i> of the call 
! wrapper <tt>g</tt>, as specified below, shall be neither <tt>volatile</tt> nor <tt>const volatile</tt>.</ins>
! <p/>
! [&hellip;]
  </p>
+ </blockquote>
+ </blockquote>
+ </li>
+ 
+ </ol>
+ 
+ 
  
  
+ 
+ 
+ <hr>
+ <h3><a name="2489"></a>2489. <tt>mem_fn()</tt> should be <tt>noexcept</tt></h3>
+ <p><b>Section:</b> 20.9.11 [func.memfn] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
+  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2015-03-27 <b>Last modified:</b> 2015-05-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#func.memfn">issues</a> in [func.memfn].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! <tt>mem_fn()</tt> is wide contract and doesn't do anything that could throw exceptions, so it should be marked <tt>noexcept</tt>.
! <p/>
! Note that <tt>mem_fn()</tt> is perfectly happy to wrap a null PMF/PMD, it just can't be invoked later. This is exactly like 
! <tt>std::function</tt>, which can be constructed from null PMFs/PMDs. Therefore, <tt>mem_fn()</tt> will remain wide contract forever.
  </p>
  
+ <p><i>[2015-05, Lenexa]</i></p>
+ 
  <p>
! Move to Immediate.
  </p>
  
  
  
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
  
! <ol>
! <li><p>Change 20.9 [function.objects] p2 "Header <tt>&lt;functional&gt;</tt> synopsis" as depicted:</p>
  
! <blockquote>
! <pre>
! [&hellip;]
! <i>// 20.9.11, member function adaptors:</i>
! template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::*) <ins>noexcept</ins>;
! [&hellip;]
! </pre>
! </blockquote>
! </li>
  
! <li><p>Change 20.9.11 [func.memfn] as depicted:</p>
  
+ <blockquote>
+ <pre>
+ template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::* pm) <ins>noexcept</ins>;
+ </pre>
+ <blockquote>
+ <p>
+ [&hellip;]
+ <p/>
+ <del>-4- <i>Throws</i>: Nothing.</del>
+ </p>
  </blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ 
  
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2490"></a>2490. <tt>&lt;regex&gt;</tt> needs lots of <tt>noexcept</tt></h3>
+ <p><b>Section:</b> 28 [re] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2015-03-27 <b>Last modified:</b> 2015-05-04</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#re">active issues</a> in [re].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#re">issues</a> in [re].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! Only 4 functions are marked <tt>noexcept</tt> in all of Clause 28. Many more need to be marked &mdash; for example, 
! <tt>regex_error::code()</tt>, <tt>basic_regex::swap()</tt>, and <tt>sub_match::length()</tt>.
  </p>
  
  
  
+ <p><b>Proposed resolution:</b></p>
+ 
  
  
+ 
+ 
+ <hr>
+ <h3><a name="2491"></a>2491. <tt>std::less&lt;T*&gt;</tt> in constant expression</h3>
+ <p><b>Section:</b> 20.9.6 [comparisons] <b>Status:</b> <a href="lwg-active.html#New">New</a>
+  <b>Submitter:</b> Agust&iacute;n K-ballo Berg&eacute; <b>Opened:</b> 2015-04-01 <b>Last modified:</b> 2015-05-04</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#comparisons">active issues</a> in [comparisons].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#comparisons">issues</a> in [comparisons].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
+ <p><b>Discussion:</b></p>
  <p>
! It is not entirely clear if and when the specializations of <tt>std::less</tt> (and friends) for pointer types 
! can be used in a constant expression. Consider the following code:
! </p>
! <blockquote><pre>
! #include &lt;functional&gt;
! 
! struct foo {};
! foo x, y;
! constexpr bool b = std::less&lt;foo*&gt;{}(&amp;x, &amp;y); // [1]
! 
! foo z[] = {{}, {}};
! constexpr bool ba = std::less&lt;foo*&gt;{}(&amp;z[0], &amp;z[1]); // [2]
! </pre></blockquote>
! <p>
! Comparing the address of unrelated objects is not a constant expression since the result is unspecified, so 
! it could be expected for [1] to fail and [2] to succeed. However, <tt>std::less</tt> specialization for pointer 
! types is well-defined and yields a total order, so it could just as well be expected for [1] to succeed. Finally, 
! since the implementation of such specializations is not mandated, [2] could fail as well (This could happen, if
! an implementation would provide such a specialization and if that would use built-in functions that would not be
! allowed in constant expressions, for example). In any case, the standard should be clear so as to avoid 
! implementation-defined <tt>constexpr</tt>-ness.
  </p>
  
+ 
+ 
  <p><b>Proposed resolution:</b></p>
  
  
*************** form.  Howard volunteered to drught for
*** 7720,7858 ****
  
  
  <hr>
! <h3><a name="2012"></a>2012. Associative maps should insert <tt>pair</tt>, not <tt>tuple</tt></h3>
! <p><b>Section:</b> 23.6 [associative] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2010-10-29 <b>Last modified:</b> 2010-11-07</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative">issues</a> in [associative].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! I'm seeing something strange in the paragraphs 23.6.1.3 [map.modifiers] and 23.6.2.2 [multimap.modifiers]:
! they both talk about <tt>tuple&lt;const key_type, mapped_type&gt;</tt> but I think they
! should be talking about <tt>pair&lt;const key_type, mapped_type&gt;</tt> because, among
! other reasons, a <tt>tuple</tt> is not convertible to a <tt>pair</tt>. If I replace <tt>tuple</tt>
! with <tt>pair</tt> everything makes sense to me.
  
! The proposed resolution is obvious. 
  </p>
  
- <p><i>[
- 2010-11-07 Daniel comments
- ]</i></p>
  
  
  <p>
! This is by far not the only necessary fix within both sub-clauses. For details see the 2010-10-29 comment in 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2005">2005</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
- Apply the resolution proposed by the 2010-10-29 comment in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2005">2005</a>.
  
  
  
  
  
  <hr>
! <h3><a name="2013"></a>2013. Do library implementers have the freedom to add <tt>constexpr</tt>?</h3>
! <p><b>Section:</b> 17.6.4.6 [constexpr.functions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2010-11-12 <b>Last modified:</b> 2010-11-13</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Suppose that a particular function is not tagged as constexpr in the standard,
! but that, in some particular implementation, it is possible to write it within
! the constexpr constraints. If an implementer tags such a function as constexpr,
! is that a violation of the standard or is it a conforming extension?</p>
! 
! <p>There are two questions to consider. First, is this allowed under the
! as-if rule? Second, if it does not fall under as-if, is there
! (and should there be) any special license granted to implementers
! to do this anyway, sort of the way we allow elision of copy constructors
! even though it is detectable by users?</p>
  
! <p>I believe that this does not fall under "as-if", so implementers
! probably don't have that freedom today. I suggest changing the WP
! to grant it. Even if we decide otherwise, however, I suggest that
! we make it explicit.</p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p><i>In 17.6.4.6 [constexpr.functions], change paragraph 1 to:</i></p>
  
  <blockquote>
! <ins>This standard explicitly requires that certain standard library functions
! are <tt>constexpr</tt> [dcl.constexpr].
! Additionally, an implementation may declare any function to be <tt>constexpr</tt>
! if that function's definition satisfies the necessary constraints.</ins>
! Within any header that provides any non-defining declarations of <tt>constexpr</tt>
! functions or constructors an implementation shall provide corresponding definitions. 
  </blockquote>
  
  
  
  
  
  
  <hr>
! <h3><a name="2014"></a>2014. More restrictions on macro names</h3>
! <p><b>Section:</b> 17.6.3.3.1 [macro.names] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2010-11-16 <b>Last modified:</b> 2010-11-17</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#macro.names">issues</a> in [macro.names].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! A program is currently forbidden to use keywords as macro names. This restriction should be strengthened to include all identifiers 
! that could be used by the library as attribute-tokens (for example <tt>noreturn</tt>, which is used by header <tt>&lt;cstdlib&gt;</tt>) 
! and the special identifiers introduced recently for override control (these are not currently used in the library public interface,
! but could potentially be used by the implementation or in future revisions of the library).
! 
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Modify 17.6.3.3.1 [macro.names] paragraph 2 as follows:</p>
  
  <blockquote>
! A translation unit shall not <tt>#define</tt> or <tt>#undef</tt> names lexically identical to keywords<ins>, to the identifiers 
! listed in Table X [Identifiers with special meaning] or to the <i>attribute-tokens</i> described in clause 7.6 [dcl.attr]</ins>.
  </blockquote>
  
  
  
  
  
  
  <hr>
! <h3><a name="2015"></a>2015. Incorrect pre-conditions for some type traits</h3>
! <p><b>Section:</b> 20.7.4 [meta.unary] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Nikolay Ivchenkov <b>Opened:</b> 2010-11-08 <b>Last modified:</b> 2010-11-17</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary">issues</a> in [meta.unary].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! According to N3126&nbsp;&#8209;&nbsp;3.9/9,
  
! <p>"Scalar types, trivial class types (Clause 9), arrays of such types
! and <i>cv</i>&#8209;qualified versions of these types (3.9.3) are collectively
! called <i>trivial types</i>."</p>
  
! <p>Thus, an array (possibly of unknown bound) can be trivial type, non&#8209;trivial type, 
! or an array type whose triviality cannot be determined because its element type is incomplete.</p>
  
- <p>According to N3126&nbsp;&#8209;&nbsp;Table 45, preconditions for <tt>std::is_trivial</tt> are
- defined as follows:</p>
  
! <p>"<tt>T</tt> shall be a complete type, (possibly <i>cv</i>-qualified) <tt>void</tt>, 
! or an array of unknown bound"</p>
  
- <p>It seems that "an array of unknown bound" should be changed to "an
- array of unknown bound of a complete element type". Preconditions for
- some other templates (e.g., <tt>std::is_trivially_copyable</tt>,
- <tt>std::is_standard_layout</tt>, <tt>std::is_pod</tt>, and <tt>std::is_literal_type</tt>) should
- be changed similarly.</p>
  
! <p>On the other hand, some preconditions look too restrictive. For
! example, <tt>std::is_empty</tt> and <tt>std::is_polymorphic</tt> might accept any
! incomplete non-class type.</p>
  
  
  <p><b>Proposed resolution:</b></p>
--- 29543,29845 ----
  
  
  <hr>
! <h3><a name="2492"></a>2492. Clarify requirements for <tt>comp</tt></h3>
! <p><b>Section:</b> 25.4 [alg.sorting] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Anton Savin <b>Opened:</b> 2015-04-14 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.sorting">issues</a> in [alg.sorting].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! N4296 25.4 [alg.sorting]/3 reads:
! </p>
! <blockquote><p>
! For all algorithms that take <tt>Compare</tt>, there is a version that uses <tt>operator&lt;</tt> instead. That is, 
! <tt>comp(*i,*j) != false</tt> defaults to <tt>*i &lt; *j != false</tt>. For algorithms other than those described in 
! 25.4.3  to work correctly, <tt>comp</tt>  has to induce a strict weak ordering on the values.
! </p></blockquote>
! <p>
! So it's not specified clearly what happens if <tt>comp</tt> or <tt>operator&lt;</tt> don't induce a strict weak ordering. 
! Is it undefined or implementation-defined behavior? It seems that it should be stated more clearly that the behavior is 
! undefined.
! </p>
  
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! Move to Immediate.
  </p>
  
  
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N4431.</p>
  
+ <ol>
+ <li><p>Change 25.4 [alg.sorting]/3 to the following:</p>
+ <blockquote>
  <p>
! For all algorithms that take <tt>Compare</tt>, there is a version that uses <tt>operator&lt;</tt> instead. That is, <tt>comp(*i,
! *j) != false</tt> defaults to <tt>*i &lt; *j != false</tt>. For algorithms other than those described in 25.4.3 <del>to work
! correctly</del>, <tt>comp</tt> <ins>shall</ins><del>has to</del> induce a strict weak ordering on the values.
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2493"></a>2493. <tt>initializer_list</tt> supports incomplete classes</h3>
! <p><b>Section:</b> 18.9 [support.initlist] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> David Krauss <b>Opened:</b> 2015-04-27 <b>Last modified:</b> 2015-05-04</p>
! <p><b>View other</b> <a href="lwg-index-open.html#support.initlist">active issues</a> in [support.initlist].</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.initlist">issues</a> in [support.initlist].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The typical use-case of <tt>std::initializer_list&lt;T&gt;</tt> is for a pass-by-value parameter of <tt>T</tt>'s constructor. 
! However, this contravenes 17.6.4.8 [res.on.functions]/2.5 because <tt>initializer_list</tt> doesn't specifically allow 
! incomplete types (as do for example <tt>std::unique_ptr</tt> (20.8.1 [unique.ptr]/5) and 
! <tt>std::enable_shared_from_this</tt> (20.8.2.5 [util.smartptr.enab]/2)).
! <p/>
! A resolution would be to copy-paste the relevant text from such a paragraph.
  </p>
  
  
+ 
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="2494"></a>2494. [fund.ts.v2] <tt>ostream_joiner</tt> needs <tt>noexcept</tt></h3>
! <p><b>Section:</b> X [iterator.ostream.joiner] <b>Status:</b> <a href="lwg-active.html#Ready">Ready</a>
!  <b>Submitter:</b> Nate Wilson <b>Opened:</b> 2015-05-03 <b>Last modified:</b> 2015-05-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Ready">Ready</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts.v2</b></p>
! <p>
! In Library Fundamentals 2 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4481.html#iterator.ostream.joiner.ops">N4481</a>, 
! [iterator.ostream.joiner], all operations are no-ops other than the assignment operator.
! <p/>
! So, they should be marked as <tt>noexcept</tt>.
! </p>
  
! <p><i>[2015-05, Lenexa]</i></p>
  
+ <p>
+ Move to Immediate.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4481 in regard to fundamental-ts-2 changes.</p>
! 
! <ol>
! <li><p>Change class template <tt>ostream_joiner</tt> synopsis, [iterator.ostream.joiner] p2, as indicated:</p>
  
  <blockquote>
! <pre>
! namespace std {
! namespace experimental {
! inline namespace fundamentals_v2 {
! 
! template &lt;class DelimT, class charT = char, class traits = char_traits&lt;charT&gt; &gt;
!   class ostream_joiner {
!   public:
!     [&hellip;]
!     ostream_joiner&lt;DelimT, charT,traits&gt;&amp; operator*() <ins>noexcept</ins>;
!     ostream_joiner&lt;DelimT, charT,traits&gt;&amp; operator++() <ins>noexcept</ins>;
!     ostream_joiner&lt;DelimT, charT,traits&gt;&amp; operator++(int) <ins>noexcept</ins>;
!     [&hellip;]
!   };
! 
! } // inline namespace fundamentals_v2
! } // namespace experimental
! } // namespace std
! </pre>
  </blockquote>
+ </li>
  
+ <li><p>Change [iterator.ostream.joiner.ops] p3+5, as indicated:</p>
+ 
+ <blockquote>
+ <pre>
+ ostream_joiner&lt;DelimT, charT, traits&gt;&amp; operator*() <ins>noexcept</ins>;
+ </pre>
+ <p>
+ [&hellip;]
+ </p>
+ <pre>
+ ostream_joiner&lt;DelimT, charT, traits&gt;&amp; operator++() <ins>noexcept</ins>;
+ ostream_joiner&lt;DelimT, charT, traits&gt;&amp; operator++(int) <ins>noexcept</ins>;
+ </pre>
+ </blockquote>
+ 
+ </li>
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2495"></a>2495. There is no such thing as an <i>Exception Safety</i> element</h3>
! <p><b>Section:</b> 20.8.2.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2015-05-05 <b>Last modified:</b> 2015-05-20</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! 20.8.2.2.1 [util.smartptr.shared.const] includes several "Exception safety"
! elements, but that is not one of the elements defined in 17.5.1.4
! 17.5.1.4 [structure.specifications]. We should either define what it means, or
! just move those sentences into the <i>Effects:</i> clause.
! </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4431.</p>
! 
! <ol>
! <li><p>Change 20.8.2.2.1 [util.smartptr.shared.const] as follows:</p>
  
  <blockquote>
! <pre>
! template&lt;class Y&gt; explicit shared_ptr(Y* p);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -4- <i>Effects</i>: Constructs a <tt>shared_ptr</tt> object that <i>owns</i> the pointer <tt>p</tt>. <ins>If an exception 
! is thrown, <tt>delete p</tt> is called.</ins>
! <p/>
! [&hellip;]
! <p/>
! <del>-7- <i>Exception safety</i>: If an exception is thrown, <tt>delete p</tt> is called.</del>
! </p>
! </blockquote>
! <pre>
! template &lt;class Y, class D&gt; shared_ptr(Y* p, D d);
! template &lt;class Y, class D, class A&gt; shared_ptr(Y* p, D d, A a);
! template &lt;class D&gt; shared_ptr(nullptr_t p, D d);
! template &lt;class D, class A&gt; shared_ptr(nullptr_t p, D d, A a);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -9- <i>Effects</i>: Constructs a <tt>shared_ptr</tt> object that owns the object <tt>p</tt> and the deleter <tt>d</tt>. 
! The second and fourth constructors shall use a copy of <tt>a</tt> to allocate memory for internal use. <ins>If an exception 
! is thrown, <tt>d(p)</tt> is called.</ins>
! <p/>
! [&hellip;]
! <p/>
! <del>-12- <i>Exception safety</i>: If an exception is thrown, <tt>d(p)</tt> is called.</del>
! </p>
! </blockquote>
! [&hellip;]
! <pre>
! template &lt;class Y&gt; explicit shared_ptr(const weak_ptr&lt;Y&gt;&amp; r);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -24- <i>Effects</i>: Constructs a <tt>shared_ptr</tt> object that shares ownership with <tt>r</tt> and stores a copy of the pointer
! stored in <tt>r</tt>. <ins>If an exception is thrown, the constructor has no effect.</ins>
! <p/>
! [&hellip;]
! <p/>
! <del>-27- <i>Exception safety</i>: If an exception is thrown, the constructor has no effect.</del>
! </p>
! </blockquote>
! <pre>
! template &lt;class Y, class D&gt; shared_ptr(unique_ptr&lt;Y, D&gt;&amp;&amp; r);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -29- <i>Effects</i>: Equivalent to <tt>shared_ptr(r.release(), r.get_deleter())</tt> when <tt>D</tt> is not a reference type,
! otherwise <tt>shared_ptr(r.release(), ref(r.get_deleter()))</tt>. <ins>If an exception is thrown, the constructor has no effect.</ins>
! <p/>
! <del>-30- <i>Exception safety</i>: If an exception is thrown, the constructor has no effect.</del>
! </p>
! </blockquote>
  </blockquote>
+ </li>
  
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="2496"></a>2496. Certain hard-to-avoid errors not in the immediate context are not allowed to be triggered by 
! the evaluation of type traits</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Hubert Tong <b>Opened:</b> 2015-05-07 <b>Last modified:</b> 2015-05-20</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! I do not believe that the wording in 20.10.4.3 [meta.unary.prop] paragraph 3 allows for the following program to be ill-formed:
! </p>
! <blockquote>
! <pre>
! #include &lt;type_traits&gt;
  
! template &lt;typename T&gt; struct B : T { };
! template &lt;typename T&gt; struct A { A&amp; operator=(const B&lt;T&gt;&amp;); };
  
! std::is_assignable&lt;A&lt;int&gt;, int&gt; q;
! </pre>
! </blockquote>
! <p>
! In particular, I do not see where the wording allows for the "compilation of the expression" 
! <tt>declval&lt;T&gt;() = declval&lt;U&gt;()</tt> to occur as a consequence of instantiating <tt>std::is_assignable&lt;T, U&gt;</tt> 
! (where <tt>T</tt> and <tt>U</tt> are, respectively, <tt>A&lt;int&gt;</tt> and <tt>int</tt> in the example code).
! <p/>
! Instantiating <tt>A&lt;int&gt;</tt> as a result of requiring it to be a complete type does not trigger the instantiation of 
! <tt>B&lt;int&gt;</tt>; however, the "compilation of the expression" in question does.
! </p>
  
  
! <p><b>Proposed resolution:</b></p>
! 
  
  
! 
! 
! <hr>
! <h3><a name="2497"></a>2497. Use of <tt>uncaught_exception()</tt></h3>
! <p><b>Section:</b> 27.7.3.4 [ostream::sentry] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Roger Orr <b>Opened:</b> 2015-05-08 <b>Last modified:</b> 2015-05-20</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream::sentry">issues</a> in [ostream::sentry].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In the current 27.7.3.4 [ostream::sentry], p4 refers to the now deprecated <tt>std::uncaught_exception()</tt>: 
! D.9 [depr.uncaught].
! </p>
! <blockquote>
! <p>
! If <tt>((os.flags() &amp; ios_base::unitbuf) &amp;&amp; !uncaught_exception() &amp;&amp; os.good())</tt> is true, calls
! <tt>os.rdbuf()->pubsync()</tt>.
! </p>
! </blockquote>
! <p>
! This needs to be changed, for example to use <tt>std::uncaught_exceptions()</tt> and to capture the value on entry and 
! compare with the saved value on exit.
! </p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** incomplete non-class type.</p>
*** 7862,7887 ****
  
  
  <hr>
! <h3><a name="2016"></a>2016. <tt>Allocators</tt> must be no-throw <i>swappable</i></h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-11-17 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! During the Batavia meeting it turned out that there is a definition
! hole for types satisfying the <tt>Allocators</tt> requirements: The problem
! became obvious when it was discussed whether all <tt>swap</tt> functions 
! of <tt>Containers</tt> with internal data handles can be safely tagged
! with <tt>noexcept</tt> or not. While it is correct that the implicit
! <tt>swap</tt> function of an allocator is required to be a no-throw
! operation (because move/copy-constructors and assignment operators are
! required to be no-throw functions), there are no such requirements
! for specialized <tt>swap</tt> overloads for a particular allocator.
  
! But this requirement is essential because the <tt>Containers</tt> are
! required to support <i>swappable</i> <tt>Allocators</tt>, when the value
! <tt>allocator_traits&lt;&gt;::propagate_on_container_swap</tt> evaluates
! to <tt>true</tt>.
  
  
  <p><b>Proposed resolution:</b></p>
--- 29849,29908 ----
  
  
  <hr>
! <h3><a name="2498"></a>2498. <tt>operator&gt;&gt;(basic_istream&amp;&amp;, T&amp;&amp;)</tt> returns <tt>basic_istream&amp;</tt>, but should probably return 
! <tt>basic_istream&amp;&amp;</tt></h3>
! <p><b>Section:</b> 27.7.2.6 [istream.rvalue] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2015-05-08 <b>Last modified:</b> 2015-05-20</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.rvalue">active issues</a> in [istream.rvalue].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.rvalue">issues</a> in [istream.rvalue].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! Consider:
! </p>
! <blockquote>
! <pre>
! auto&amp; is = make_istream() &gt;&gt; x; // oops, istream object is already gone
! </pre>
! </blockquote>
! <p>
! With a <tt>basic_istream&amp;&amp;</tt> return type, the above would be ill-formed, and generally we'd 
! preserve the value category properly.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
  
! 
! 
! <hr>
! <h3><a name="2499"></a>2499. <tt>operator&gt;&gt;(basic_istream&amp;, CharT*)</tt> makes it hard to avoid buffer overflows</h3>
! <p><b>Section:</b> 27.7.2.2.3 [istream::extractors] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2015-05-08 <b>Last modified:</b> 2015-05-21</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! We removed <tt>gets()</tt> (due to an NB comment and C11 &mdash; bastion of backwards compatibility &mdash; doing the same). 
! Should we remove this too?
! <p/>
! Unlike <tt>gets()</tt>, there are legitimate uses:
! </p>
! <blockquote>
! <pre>
! char buffer[32];
! char text[32] = // ...
! ostream_for_buffer(text) &gt;&gt; buffer; // ok, can't overrun buffer
! </pre>
! </blockquote>
! <p>
! &hellip; but the risk from constructs like "<tt>std::cin &gt;&gt; buffer</tt>" seems to outweigh the benefit.
! <p/>
! The issue had been discussed on the library reflector starting around 
! <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=35541">c++std-lib-35541</a>.
! </p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** to <tt>true</tt>.
*** 7891,8000 ****
  
  
  <hr>
! <h3><a name="2017"></a>2017. <tt>std::reference_wrapper</tt> makes incorrect usage of <tt>std::result_of</tt></h3>
! <p><b>Section:</b> 20.8.4 [refwrap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Nikolay Ivchenkov <b>Opened:</b> 2010-11-15 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#refwrap">issues</a> in [refwrap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <tt>std::reference_wrapper</tt>'s function call operator uses <em>wrong</em>
! type encoding for rvalue-arguments. An rvalue-argument of type <tt>T</tt> must
! be encoded as <tt>T&amp;&amp;</tt>, not as just <tt>T</tt>.
  
- <blockquote><pre>#include &lt;functional&gt;
- #include &lt;iostream&gt;
- #include &lt;string&gt;
- #include &lt;type_traits&gt;
- #include &lt;utility&gt;
  
! template &lt;class F, class... Types&gt;
!      typename std::result_of&lt;F (Types...)&gt;::type
!          f1(F f, Types&amp;&amp;... params)
! {
!      return f(std::forward&lt;Types...&gt;(params...));
! }
  
- template &lt;class F, class... Types&gt;
-      typename std::result_of&lt;F (Types<b>&amp;&amp;</b>...)
-          f2(F f, Types&amp;&amp;... params)
- {
-      return f(std::forward&lt;Types...&gt;(params...));
- }
  
- struct Functor
- {
-      template &lt;class T&gt;
-          T&amp;&amp; operator()(T&amp;&amp; t) const
-      {
-          return static_cast&lt;T&amp;&amp;&gt;(t);
-      }
- };
  
- int main()
- {
-      typedef std::string const Str;
-      std::cout &lt;&lt; f1(Functor(), Str("1")) &lt;&lt; std::endl; // (1)
-      std::cout &lt;&lt; f2(Functor(), Str("2")) &lt;&lt; std::endl; // (2)
- }
- </pre></blockquote>
  
- Lets consider the function template <tt>f1</tt> (which is similar to
- <tt>std::reference_wrapper</tt>'s function call operator). In the invocation
- (1) <tt>F</tt> is deduced as '<tt>Functor</tt>' and <tt>Types</tt> is deduced as type sequence
- which consists of one type '<tt>std::string const</tt>'. After the substitution
- we have the following equivalent:
  
! <blockquote><pre>template &lt;&gt;
!     std::result_of&lt;F (std::string const)&gt;::type
!         f1&lt;Functor, std::string const&gt;(Functor f, std::string const &amp;&amp; params)
  {
!     return f(std::forward&lt;const std::string&gt;(params));
! }
! </pre></blockquote>
  
! The top-level <i>cv</i>-qualifier in the parameter type of '<tt>F (std::string const)</tt>' is removed, so we have
  
! <blockquote><pre>template &lt;&gt;
!     std::result_of&lt;F (std::string)&gt;::type
!         f1&lt;Functor, std::string const&gt;(Functor f, std::string const &amp;&amp; params)
! {
!     return f(std::forward&lt;const std::string&gt;(params));
! }
! </pre></blockquote>
  
! Let <tt>r</tt> be an rvalue of type '<tt>std::string</tt>' and <tt>cr</tt> be an rvalue of type
! '<tt>std::string const</tt>'. The expression <tt>Str("1")</tt> is <tt>cr</tt>. The corresponding
! return type for the invocation
  
! <blockquote><pre>Functor().operator()(r)
! </pre></blockquote>
  
! is '<tt>std::string &amp;&amp;</tt>'. The corresponding return type for the invocation
  
  
! <blockquote><pre>Functor().operator()(cr)
! </pre></blockquote>
  
! is '<tt>std::string const &amp;&amp;</tt>'.
! <p>
! <tt>std::result_of&lt;Functor (std::string)&gt;::type</tt> is the same type as the
! corresponding return type for the invocation <tt>Functor().operator()(r)</tt>,
! i.e. it is '<tt>std::string &amp;&amp;</tt>'. As a consequence, we have wrong reference
! binding in the return statement in <tt>f1</tt>.
! </p><p>
! Now lets consider the invocation (2) of the function template <tt>f2</tt>. When
! the template arguments are substituted we have the following equivalent:
  
! </p><blockquote><pre>template &lt;&gt;
!     std::result_of&lt;F (std::string const &amp;&amp;)&gt;::type
!         f2&lt;Functor, std::string const&gt;(Functor f, std::string const &amp;&amp; params)
! {
!     return f(std::forward&lt;const std::string&gt;(params));
  }
  </pre></blockquote>
  
! <tt>std::result_of&lt;F (std::string const &amp;&amp;)&gt;::type</tt> is the same type as
! '<tt>std::string const &amp;&amp;</tt>'. This is correct result.
  <p><b>Proposed resolution:</b></p>
  
  
--- 29912,30057 ----
  
  
  <hr>
! <h3><a name="2500"></a>2500. [fund.ts.v2] fundts.memory.smartptr.shared.obs/6 should apply to <i>cv</i>-unqualified <tt>void</tt></h3>
! <p><b>Section:</b> X [memory.smartptr.shared.obs] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2015-05-11 <b>Last modified:</b> 2015-05-20</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts.v2</b></p>
! <p>
! S. B. Tam reported this <a href="https://github.com/cplusplus/fundamentals-ts/issues/51">here</a>.
! <p/>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3920.html">N3920</a> changed <tt>operator*()</tt> in 
! [util.smartptr.shared.obs] as:
! </p>
! <blockquote>
! <p>
! <i>Remarks</i>: When <tt>T</tt> is <ins>an array type or <i>cv</i>-qualified</ins> <tt>void</tt>, it
! is unspecified whether this member function is declared. &hellip;
! </p>
! </blockquote>
! <p>
! This excludes <i>cv</i>-unqualified <tt>void</tt>, which is probably unintended.
! </p>
  
  
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>In the <a href="https://rawgit.com/cplusplus/fundamentals-ts/v2/fundamentals-ts.html#memory.smartptr.shared.obs.6">library 
! fundamentals v2</a>, [memory.smartptr.shared.obs] p2, change as indicated:</p>
! <blockquote>
! <p>
! <i>Remarks</i>: When <tt>T</tt> is an array type or <ins>(possibly</ins> <i>cv</i>-qualified<ins>)</ins> 
! <tt>void</tt>, it is unspecified whether this
! member function is declared. If it is declared, it is unspecified what
! its return type is, except that the declaration (although not
! necessarily the definition) of the function shall be well formed.
! </p>
! </blockquote>
! </li>
! </ol>
  
  
  
  
  
! <hr>
! <h3><a name="2501"></a>2501. <tt>std::function</tt> requires POCMA/POCCA</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> David Krauss <b>Opened:</b> 2015-05-20 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The idea behind <tt>propagate_on_container_move_assignment</tt> is that you can keep an allocator attached to a container. 
! But it's not really designed to work with polymorphism, which introduces the condition where the current allocator is non-POCMA 
! and the RHS of assignment, being POCMA, wants to replace it. If function were to respect the literal meaning, any would-be 
! attached allocator is at the mercy of every assignment operation. So, <tt>std::function</tt> is inherently POCMA, and passing 
! a non-POCMA allocator should be ill-formed.
! <p/>
! The other alternative, and the status quo, is to ignore POCMA and assume it is true. This seems just dangerous enough to outlaw. 
! It is, in theory, possible to properly support POCMA as far as I can see, albeit with difficulty and brittle results. It would 
! require function to keep a throwing move constructor, which otherwise can be <tt>noexcept</tt>.
! <p/>
! The same applies to <tt>propagate_on_container_copy_assignment</tt>. This presents more difficulty because <tt>std::allocator</tt> 
! does not set this to true. Perhaps it should. For function to respect this would require inspecting the POCCA of the source allocator, 
! slicing the target from the erasure of the source, slicing the allocation from the erasure of the destination, and performing a 
! copy with the destination's allocator with the source's target. This comes out of the blue for the destination allocator, which 
! might not support the new type anyway. Theoretically possible, but brittle and not very practical. Again, current implementations 
! quietly ignore the issue but this isn't very clean.
! <p/>
! The following code example is intended to demonstrate the issue here:
! </p>
! <blockquote><pre>
! #include &lt;functional&gt;
! #include &lt;iostream&gt;
! #include &lt;vector&gt;
! 
! template &lt;typename T&gt;
! struct diag_alloc 
  {
!   std::string name;
  
!   T* allocate(std::size_t n) const 
!   {
!     std::cout &lt;&lt; '+' &lt;&lt; name &lt;&lt; '\n';
!     return static_cast&lt;T*&gt;(::operator new(n * sizeof(T)));
!   }
!   
!   void deallocate(T* p, std::size_t) const 
!   {
!     std::cout &lt;&lt; '-' &lt;&lt; name &lt;&lt; '\n';
!     return ::operator delete(p);
!   }
  
!   template &lt;typename U&gt;
!   operator diag_alloc&lt;U&gt;() const { return {name}; }
  
!   friend bool operator==(const diag_alloc&amp; a, const diag_alloc&amp; b)
!   { return a.name == b.name; }
!   
!   friend bool operator!=(const diag_alloc&amp; a, const diag_alloc&amp; b)
!   { return a.name != b.name; }
  
!   typedef T value_type;
!   
!   template &lt;typename U&gt;
!   struct rebind { typedef diag_alloc&lt;U&gt; other; };
! };
  
! int main() {
!   std::cout &lt;&lt; "VECTOR\n";
!   std::vector&lt;int, diag_alloc&lt;int&gt;&gt; foo({1, 2}, {"foo"}); // +foo
!   std::vector&lt;int, diag_alloc&lt;int&gt;&gt; bar({3, 4}, {"bar"}); // +bar
  
+   std::cout &lt;&lt; "move\n";
+   foo = std::move(bar); // no message
  
!   std::cout &lt;&lt; "more foo\n";
!   foo.reserve(40); // +foo -foo
!   std::cout &lt;&lt; "more bar\n";
!   bar.reserve(40); // +bar -bar
  
!   std::cout &lt;&lt; "\nFUNCTION\n";
!   int bigdata[100];
!   auto bigfun = [bigdata]{};
!   typedef decltype(bigfun) ft;
!   std::cout &lt;&lt; "make fizz\n";
!   std::function&lt;void()&gt; fizz(std::allocator_arg, diag_alloc&lt;ft&gt;{"fizz"}, bigfun); // +fizz
!   std::cout &lt;&lt; "another fizz\n";
!   std::function&lt;void()&gt; fizz2;
!   fizz2 = fizz; // +fizz as if POCCA
!   std::cout &lt;&lt; "make buzz\n";
!   std::function&lt;void()&gt; buzz(std::allocator_arg, diag_alloc&lt;ft&gt;{"buzz"}, bigfun); // +buzz
!   std::cout &lt;&lt; "move\n";
!   buzz = std::move(fizz); // -buzz as if POCMA
  
!   std::cout &lt;&lt; "\nCLEANUP\n";
  }
  </pre></blockquote>
  
! 
  <p><b>Proposed resolution:</b></p>
  
  
*************** the template arguments are substituted w
*** 8002,8074 ****
  
  
  <hr>
! <h3><a name="2018"></a>2018. <tt>regex_traits::isctype</tt> Returns clause is wrong</h3>
! <p><b>Section:</b> 28.7 [re.traits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2010-11-16 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.traits">issues</a> in [re.traits].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>28.7 [re.traits] p12 says:</p>
! <blockquote>
! <p>returns true if f bitwise or’ed with the result of calling
! lookup_classname with an iterator pair that designates the character
! sequence "w" is not equal to 0 and c == ’_’</p>
! </blockquote>
! 
! <p>If the bitmask value corresponding to "w" has a non-zero value (which
! it must do) then the bitwise or with any value is also non-zero, and
! so isctype('_', f) returns true for any f.  Obviously this is wrong,
! since '_' is not in every ctype category.</p>
! 
! <p>There's a similar problem with the following phrases discussing the
! "blank" char class.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
- <p>Replace the Returns clause with a description in terms of ctype
- categories, rather than pseudocode in terms of bitwise operations.
- (full replacement wording to follow)
- 
- </p>
  
  
  
  
  
  <hr>
! <h3><a name="2019"></a>2019. <tt>isblank</tt> not supported by <tt>std::locale</tt></h3>
! <p><b>Section:</b> 22.3.3.1 [classification] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#New">New</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2010-11-16 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>C99 added <tt>isblank</tt> and <tt>iswblank</tt> to <tt>&lt;locale.h&gt;</tt> but <tt>&lt;locale&gt;</tt> does not
! provide any equivalent.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add to 22.3.3.1 [classification] synopsis:</p>
! <blockquote>
! <pre>template &lt;class charT&gt; bool isgraph (charT c, const locale&amp; loc);
! <ins>template &lt;class charT&gt; bool isblank (charT c, const locale&amp; loc);</ins>
! </pre>
! </blockquote>
  
! <p>Add to 22.4.1 [category.ctype] synopsis:</p>
  
  <blockquote>
! <pre>static const mask xdigit = 1 &lt;&lt; 8;
! <ins>static const mask blank = 1 &lt;&lt; 9;</ins>
! static const mask alnum = alpha | digit;
! static const mask graph = alnum | punct;
! </pre>
! </blockquote>
  
  
  
  
  
  
  
  
! </body></html>
\ No newline at end of file
--- 30059,30172 ----
  
  
  <hr>
! <h3><a name="2502"></a>2502. <tt>std::function</tt> does not use <tt>allocator::construct</tt></h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> David Krauss <b>Opened:</b> 2015-05-20 <b>Last modified:</b> 2015-05-21</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! It is impossible for <tt>std::function</tt> to construct its target object using the <tt>construct</tt> method of a type-erased 
! allocator. More confusingly, it is possible when the allocator and the target are created at the same time. The means 
! of target construction should be specified.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="2503"></a>2503. multiline option should be added to <tt>syntax_option_type</tt></h3>
! <p><b>Section:</b> 28.5.1 [re.synopt] <b>Status:</b> <a href="lwg-active.html#New">New</a>
!  <b>Submitter:</b> Nozomu Kat&#x14d; <b>Opened:</b> 2015-05-22 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re.synopt">active issues</a> in [re.synopt].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.synopt">issues</a> in [re.synopt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#New">New</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! The specification of ECMAScript defines the Multiline property for its
! RegExp and the regular expressions ^ and $ behave differently according
! to the value of this property. Thus, this property should be available
! also in the ECMAScript compatible engine in <tt>std::regex</tt>.
! </p>
! 
! <p><i>[2015-05-22, Daniel comments]</i></p>
! 
! <p>
! This issue interacts somewhat with LWG <a href="lwg-active.html#2343">2343</a>.
! </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4431.</p>
  
! <ol>
! <li><p>Change 28.5.1 [re.synopt] as indicated:</p>
! 
! <blockquote><pre>
! namespace std::regex_constants {
!   typedef T1 syntax_option_type;
!   constexpr syntax_option_type icase = <i>unspecified</i> ;
!   constexpr syntax_option_type nosubs = <i>unspecified</i> ;
!   constexpr syntax_option_type optimize = <i>unspecified</i> ;
!   constexpr syntax_option_type collate = <i>unspecified</i> ;
!   constexpr syntax_option_type ECMAScript = <i>unspecified</i> ;
!   constexpr syntax_option_type basic = <i>unspecified</i> ;
!   constexpr syntax_option_type extended = <i>unspecified</i> ;
!   constexpr syntax_option_type awk = <i>unspecified</i> ;
!   constexpr syntax_option_type grep = <i>unspecified</i> ;
!   constexpr syntax_option_type egrep = <i>unspecified</i> ;
!   <ins>constexpr syntax_option_type multiline = <i>unspecified</i> ;</ins>
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 28.5.2 [re.matchflag], Table 138 &mdash; "<tt>syntax_option_type</tt> effects" as indicated:</p>
  
  <blockquote>
! <table border="1">
! <caption>Table 138 &mdash; <tt>syntax_option_type</tt> effects</caption>
! <tr>
! <th align="center">Element</th>
! <th align="center">Effect(s) if set</th>
! </tr>
  
+ <tr>
+ <td colspan="2" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
  
+ <tr>
+ <td>
+ <ins><tt>multiline</tt></ins>
+ </td>
+ <td>
+ <ins>Specifies that <tt>^</tt> shall match the beginning of a line
+ and <tt>$</tt> shall match the end of a line, if the ECMAScript engine is
+ selected.</ins>
+ </td>
+ </tr>
  
+ <tr>
+ <td colspan="2" align="center">
+ <tt>&hellip;</tt>
+ </td>
+ </tr>
  
+ </table>
+ </blockquote>
  
+ </li>
+ </ol>
  
  
  
! 
! 
! </body>
! </html>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/ext/lwg-closed.html gcc-5.5.0/libstdc++-v3/doc/html/ext/lwg-closed.html
*** gcc-5.4.0/libstdc++-v3/doc/html/ext/lwg-closed.html	Mon Jan 31 00:19:58 2011
--- gcc-5.5.0/libstdc++-v3/doc/html/ext/lwg-closed.html	Fri Jul  8 13:29:06 2016
***************
*** 1,6 ****
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
! <!-- saved from url=(0059)http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html -->
! <html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
  <title>C++ Standard Library Closed Issues List</title>
  <style type="text/css">
    p {text-align:justify}
--- 1,7 ----
! <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
!     "http://www.w3.org/TR/html4/strict.dtd">
! <html>
! <head>
  <title>C++ Standard Library Closed Issues List</title>
  <style type="text/css">
    p {text-align:justify}
***************
*** 19,31 ****
  </head>
  <body>
  <table>
! <tbody><tr>
    <td align="left">Doc. no.</td>
!   <td align="left">D3183=10-0173</td>
  </tr>
  <tr>
    <td align="left">Date:</td>
!   <td align="left">2010-11-29</td>
  </tr>
  <tr>
    <td align="left">Project:</td>
--- 20,32 ----
  </head>
  <body>
  <table>
! <tr>
    <td align="left">Doc. no.</td>
!   <td align="left">N4486</td>
  </tr>
  <tr>
    <td align="left">Date:</td>
!   <td align="left">2015-05-23</td>
  </tr>
  <tr>
    <td align="left">Project:</td>
***************
*** 33,1121 ****
  </tr>
  <tr>
    <td align="left">Reply to:</td>
!   <td align="left">Alisdair Meredith &lt;<a href="mailto:lwgchair@gmail.com">lwgchair@gmail.com</a>&gt;</td>
  </tr>
! </tbody></table>
! <h1>C++ Standard Library Closed Issues List (Revision D73)</h1>
! <p>Revised 2010-11-29 at 10:11:56 UTC</p>
! 
!   <p>Reference ISO/IEC IS 14882:2003(E)</p>
    <p>Also see:</p>
      <ul>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-toc.html">Table of Contents</a> for all library issues.</li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html">Index by Section</a> for all library issues.</li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html">Index by Status</a> for all library issues.</li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html">Library Active Issues List</a></li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html">Library Defect Reports List</a></li>
      </ul>
  
    <p>This document contains only library issues which have been closed
    by the Library Working Group as duplicates or not defects. That is,
!   issues which have a status of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a> or
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>. See the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html">Library Active Issues List</a> active issues and more
!   information. See the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html">Library Defect Reports List</a> for issues considered
    defects.  The introductory material in that document also applies to
    this document.</p>
  
  <h2>Revision History</h2>
  <ul>
! <li>D73: Batavia meeting preview<ul>
! <li><b>Summary:</b><ul>
! <li>80 open issues, down by 126.</li>
! <li>1459 closed issues, up by 145.</li>
! <li>1539 issues total, up by 19.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following 11 New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1521">1521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1523">1523</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2008">2008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2012">2012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2013">2013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2014">2014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2015">2015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2016">2016</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2017">2017</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2018">2018</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2019">2019</a>.</li>
! <li>Added the following 5 Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2001">2001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2003">2003</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2005">2005</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2010">2010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2011">2011</a>.</li>
! <li>Added the following Resolved issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#2002">2002</a>.</li>
! <li>Added the following Review issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2009">2009</a>.</li>
! <li>Added the following Tentatively NAD issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2006">2006</a>.</li>
! <li>Added the following 3 Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2000">2000</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2004">2004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2007">2007</a>.</li>
! <li>Added the following WP issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1522">1522</a>.</li>
! <li>Changed the following 3 issues from New to Deferred: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1213">1213</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1214">1214</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1330">1330</a>.</li>
! <li>Changed the following issue from Open to Deferred: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1450">1450</a>.</li>
! <li>Changed the following 14 issues from Open to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1350">1350</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1351">1351</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1352">1352</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1375">1375</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1411">1411</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1443">1443</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1451">1451</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1454">1454</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1458">1458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1463">1463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1470">1470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1475">1475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1476">1476</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1477">1477</a>.</li>
! <li>Changed the following issue from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1331">1331</a>.</li>
! <li>Changed the following 8 issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1359">1359</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1361">1361</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1373">1373</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1376">1376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1398">1398</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1446">1446</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1473">1473</a>.</li>
! <li>Changed the following 2 issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1190">1190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1200">1200</a>.</li>
! <li>Changed the following issue from WP to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>.</li>
! <li>Changed the following 11 issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1395">1395</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1442">1442</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1471">1471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1472">1472</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1489">1489</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1495">1495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1496">1496</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1509">1509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1510">1510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1511">1511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1512">1512</a>.</li>
! <li>Changed the following issue from Review to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1281">1281</a>.</li>
! <li>Changed the following issue from New to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1289">1289</a>.</li>
! <li>Changed the following 6 issues from Open to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1406">1406</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1422">1422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1484">1484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1488">1488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1493">1493</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1499">1499</a>.</li>
! <li>Changed the following 2 issues from Tentatively NAD Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a>.</li>
! <li>Changed the following 2 issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1252">1252</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1297">1297</a>.</li>
! <li>Changed the following 3 issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1279">1279</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1318">1318</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1332">1332</a>.</li>
! <li>Changed the following 6 issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1385">1385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1401">1401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1408">1408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1418">1418</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1420">1420</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1438">1438</a>.</li>
! <li>Changed the following 42 issues from NAD Editorial to Resolved: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#353">353</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#482">482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#525">525</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#658">658</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#697">697</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#786">786</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1055">1055</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1075">1075</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1122">1122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1174">1174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1260">1260</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1293">1293</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1307">1307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1321">1321</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1394">1394</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1405">1405</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1407">1407</a>.</li>
! <li>Changed the following 5 issues from New to Resolved: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1290">1290</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1322">1322</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1324">1324</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1326">1326</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1328">1328</a>.</li>
! <li>Changed the following 46 issues from Open to Resolved: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#801">801</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1327">1327</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1344">1344</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1346">1346</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1347">1347</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1355">1355</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1356">1356</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1357">1357</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1365">1365</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1366">1366</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1377">1377</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1378">1378</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1379">1379</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1380">1380</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1382">1382</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1383">1383</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1389">1389</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1390">1390</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1391">1391</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1392">1392</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1393">1393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1397">1397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1409">1409</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1410">1410</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1412">1412</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1445">1445</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1447">1447</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1453">1453</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1455">1455</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1462">1462</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1464">1464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1465">1465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1466">1466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1467">1467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1468">1468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1469">1469</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1481">1481</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1482">1482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1490">1490</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1491">1491</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1492">1492</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1498">1498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1501">1501</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1508">1508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1513">1513</a>.</li>
! <li>Changed the following issue from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1480">1480</a>.</li>
! <li>Changed the following 2 issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1371">1371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1413">1413</a>.</li>
! <li>Changed the following issue from New to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1320">1320</a>.</li>
! <li>Changed the following 3 issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1215">1215</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1253">1253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1310">1310</a>.</li>
! <li>Changed the following issue from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1497">1497</a>.</li>
! <li>Changed the following 24 issues from NAD Editorial to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1360">1360</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1363">1363</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1367">1367</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1372">1372</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1381">1381</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1384">1384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1386">1386</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1387">1387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1388">1388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1399">1399</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1400">1400</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1402">1402</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1403">1403</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1416">1416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1417">1417</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1423">1423</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1424">1424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1425">1425</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1426">1426</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1427">1427</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1429">1429</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1430">1430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1431">1431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1441">1441</a>.</li>
! <li>Changed the following issue from New to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1294">1294</a>.</li>
! <li>Changed the following 10 issues from Open to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1354">1354</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1362">1362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1368">1368</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1370">1370</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1428">1428</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1435">1435</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1436">1436</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1437">1437</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1439">1439</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1440">1440</a>.</li>
! <li>Changed the following 2 issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>.</li>
! <li>Changed the following 33 issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1181">1181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1240">1240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1249">1249</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1292">1292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1295">1295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1316">1316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1319">1319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1323">1323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1325">1325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1333">1333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1334">1334</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1335">1335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1337">1337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1338">1338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1339">1339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1340">1340</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1404">1404</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1414">1414</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1432">1432</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1449">1449</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1516">1516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1517">1517</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1518">1518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1519">1519</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1520">1520</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R72: 
! 2010-10-18 pre-Batavia mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>206 open issues, up by 141.</li>
! <li>1314 closed issues, up by 36.</li>
! <li>1520 issues total, up by 177.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following Dup issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1433">1433</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1444">1444</a>.</li>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1360">1360</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1363">1363</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1367">1367</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1372">1372</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1381">1381</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1384">1384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1386">1386</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1387">1387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1388">1388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1394">1394</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1399">1399</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1400">1400</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1402">1402</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1403">1403</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1405">1405</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1407">1407</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1415">1415</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1416">1416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1417">1417</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1419">1419</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1423">1423</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1424">1424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1425">1425</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1426">1426</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1427">1427</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1429">1429</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1430">1430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1431">1431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1434">1434</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1441">1441</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1483">1483</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1500">1500</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1506">1506</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1344">1344</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1345">1345</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1346">1346</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1347">1347</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1348">1348</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1349">1349</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1350">1350</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1351">1351</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1352">1352</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1353">1353</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1354">1354</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1355">1355</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1356">1356</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1357">1357</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1358">1358</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1359">1359</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1361">1361</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1362">1362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1364">1364</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1365">1365</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1366">1366</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1368">1368</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1369">1369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1370">1370</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1371">1371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1373">1373</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1374">1374</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1375">1375</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1376">1376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1377">1377</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1378">1378</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1379">1379</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1380">1380</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1382">1382</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1383">1383</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1385">1385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1389">1389</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1390">1390</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1391">1391</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1392">1392</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1393">1393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1395">1395</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1396">1396</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1397">1397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1398">1398</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1401">1401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1406">1406</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1408">1408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1409">1409</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1410">1410</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1411">1411</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1412">1412</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1413">1413</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1418">1418</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1420">1420</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1421">1421</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1422">1422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1428">1428</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1435">1435</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1436">1436</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1437">1437</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1438">1438</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1439">1439</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1440">1440</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1442">1442</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1443">1443</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1445">1445</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1446">1446</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1447">1447</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1448">1448</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1450">1450</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1451">1451</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1452">1452</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1453">1453</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1454">1454</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1455">1455</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1456">1456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1457">1457</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1458">1458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1459">1459</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1460">1460</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1461">1461</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1462">1462</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1463">1463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1464">1464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1465">1465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1466">1466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1467">1467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1468">1468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1469">1469</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1470">1470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1471">1471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1472">1472</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1473">1473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1474">1474</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1475">1475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1476">1476</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1477">1477</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1478">1478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1479">1479</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1480">1480</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1481">1481</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1482">1482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1484">1484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1485">1485</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1486">1486</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1487">1487</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1488">1488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1489">1489</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1490">1490</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1491">1491</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1492">1492</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1493">1493</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1494">1494</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1495">1495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1496">1496</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1497">1497</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1498">1498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1499">1499</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1501">1501</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1502">1502</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1503">1503</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1504">1504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1505">1505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1507">1507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1508">1508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1509">1509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1510">1510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1511">1511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1512">1512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1513">1513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1514">1514</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1515">1515</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1404">1404</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1414">1414</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1432">1432</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1449">1449</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1516">1516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1517">1517</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1518">1518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1519">1519</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1520">1520</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1260">1260</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1181">1181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1240">1240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1249">1249</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1292">1292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1295">1295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1316">1316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1319">1319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1323">1323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1325">1325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1333">1333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1334">1334</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1335">1335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1337">1337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1338">1338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1339">1339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1340">1340</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R71: 
! 2010-08-25 post-Rapperswil mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>65 open issues, up by 2.</li>
! <li>1278 closed issues, up by 7.</li>
! <li>1343 issues total, up by 9.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1335">1335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2008">2008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1337">1337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1338">1338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1339">1339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1340">1340</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2009">2009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2010">2010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2011">2011</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#996">996</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1119">1119</a>.</li>
! <li>Changed the following issues from Open to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1076">1076</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1169">1169</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1175">1175</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1190">1190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1200">1200</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1187">1187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1206">1206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1278">1278</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R70: 
! 2010-03-26 post-Pittsburgh mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>63 open issues, down by 203.</li>
! <li>1271 closed issues, up by 219.</li>
! <li>1334 issues total, up by 16.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1321">1321</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1329">1329</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1319">1319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1320">1320</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1322">1322</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1323">1323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1324">1324</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1325">1325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1326">1326</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1328">1328</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1330">1330</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1331">1331</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1332">1332</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1333">1333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1334">1334</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1327">1327</a>.</li>
! <li>Changed the following issues from Tentatively Dup to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1302">1302</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1308">1308</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1313">1313</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1314">1314</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#887">887</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1008">1008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1069">1069</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1153">1153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1156">1156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1228">1228</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1125">1125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1202">1202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1223">1223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1224">1224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1246">1246</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1251">1251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1259">1259</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1263">1263</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1265">1265</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1296">1296</a>.</li>
! <li>Changed the following issues from Tentatively NAD Concepts to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1186">1186</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1185">1185</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1210">1210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1212">1212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1225">1225</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1244">1244</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1266">1266</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1269">1269</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1272">1272</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1275">1275</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1291">1291</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1305">1305</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1307">1307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1311">1311</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#446">446</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1211">1211</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1248">1248</a>.</li>
! <li>Changed the following issues from Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#485">485</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>.</li>
! <li>Changed the following issues from Tentatively NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1115">1115</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1233">1233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1239">1239</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1301">1301</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1226">1226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1273">1273</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1274">1274</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1293">1293</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1300">1300</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1304">1304</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1315">1315</a>.</li>
! <li>Changed the following issues from New to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1154">1154</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1317">1317</a>.</li>
! <li>Changed the following issues from Ready to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1112">1112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1201">1201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1238">1238</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1282">1282</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1187">1187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1206">1206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1278">1278</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1281">1281</a>.</li>
! <li>Changed the following issues from Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>.</li>
! <li>Changed the following issues from New to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1159">1159</a>.</li>
! <li>Changed the following issues from Open to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#427">427</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#430">430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#819">819</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#861">861</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#885">885</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#896">896</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#473">473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1030">1030</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1123">1123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1134">1134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1136">1136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1144">1144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1157">1157</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1216">1216</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1227">1227</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1237">1237</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1089">1089</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1126">1126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1131">1131</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1138">1138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1152">1152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1158">1158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1170">1170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1180">1180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1189">1189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1192">1192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1193">1193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1197">1197</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1208">1208</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1209">1209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1218">1218</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1220">1220</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1221">1221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1222">1222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1231">1231</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1241">1241</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1250">1250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1254">1254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1256">1256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1257">1257</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1261">1261</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1262">1262</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1264">1264</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1267">1267</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1270">1270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1271">1271</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1276">1276</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1277">1277</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1280">1280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1284">1284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1285">1285</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1286">1286</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1287">1287</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1288">1288</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1298">1298</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1299">1299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1303">1303</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1306">1306</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1309">1309</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1312">1312</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R69: 
! 2010-02-12 pre-Pittsburgh mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>266 open issues, up by 61.</li>
! <li>1052 closed issues, down by 3.</li>
! <li>1318 issues total, up by 58.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1266">1266</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1269">1269</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1272">1272</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1275">1275</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1278">1278</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1279">1279</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1281">1281</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1289">1289</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1290">1290</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1291">1291</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1292">1292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1294">1294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1295">1295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1297">1297</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1302">1302</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1305">1305</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1307">1307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1308">1308</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1310">1310</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1311">1311</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1313">1313</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1314">1314</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1316">1316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1317">1317</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1318">1318</a>.</li>
! <li>Added the following Tentatively NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1263">1263</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1265">1265</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1296">1296</a>.</li>
! <li>Added the following Tentatively NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1301">1301</a>.</li>
! <li>Added the following Tentatively NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1282">1282</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1261">1261</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1262">1262</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1264">1264</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1267">1267</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1270">1270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1271">1271</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1273">1273</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1274">1274</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1276">1276</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1277">1277</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1280">1280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1284">1284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1285">1285</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1286">1286</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1287">1287</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1288">1288</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1293">1293</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1298">1298</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1299">1299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1300">1300</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1303">1303</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1304">1304</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1306">1306</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1309">1309</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1312">1312</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1315">1315</a>.</li>
! <li>Changed the following issues from NAD to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#101">101</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1248">1248</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>.</li>
! <li>Changed the following issues from New to Tentatively Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1125">1125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1202">1202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1223">1223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1224">1224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1246">1246</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1251">1251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1259">1259</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>.</li>
! <li>Changed the following issues from Review to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>.</li>
! <li>Changed the following issues from Ready to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>.</li>
! <li>Changed the following issues from NAD to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>.</li>
! <li>Changed the following issues from NAD Editorial to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1131">1131</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1170">1170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1180">1180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1193">1193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1197">1197</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1209">1209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1218">1218</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1221">1221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1222">1222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1250">1250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1254">1254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1256">1256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1257">1257</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1089">1089</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>.</li>
! <li>Changed the following issues from Ready to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>.</li>
! <li>Changed the following issues from Pending WP to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R68: 
! 2009-11-06 post-Santa Cruz mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>205 open issues, down by 77.</li>
! <li>1055 closed issues, up by 120.</li>
! <li>1260 issues total, up by 43.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following Dup issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1230">1230</a>.</li>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1229">1229</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1236">1236</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1243">1243</a>.</li>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1232">1232</a>.</li>
! <li>Added the following NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1235">1235</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1242">1242</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1248">1248</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1218">1218</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1221">1221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1222">1222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1223">1223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1224">1224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1225">1225</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1240">1240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1244">1244</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1246">1246</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1249">1249</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1250">1250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1251">1251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1252">1252</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1253">1253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1254">1254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1256">1256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1257">1257</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1259">1259</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1260">1260</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1228">1228</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1227">1227</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1237">1237</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>.</li>
! <li>Added the following Tentatively NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1233">1233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1239">1239</a>.</li>
! <li>Added the following Tentatively NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1238">1238</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1220">1220</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1226">1226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1231">1231</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1241">1241</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1132">1132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1148">1148</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#458">458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#955">955</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#977">977</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1020">1020</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1035">1035</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1042">1042</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1051">1051</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1064">1064</a>.</li>
! <li>Changed the following issues from Review to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1091">1091</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>.</li>
! <li>Changed the following issues from NAD Concepts to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1143">1143</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1122">1122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1129">1129</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1145">1145</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1146">1146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1147">1147</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1155">1155</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1166">1166</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1172">1172</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1174">1174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1179">1179</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1196">1196</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#908">908</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#926">926</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#944">944</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1046">1046</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1048">1048</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1055">1055</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1075">1075</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1088">1088</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1160">1160</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1161">1161</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1162">1162</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1163">1163</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1165">1165</a>.</li>
! <li>Changed the following issues from Review to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1043">1043</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1047">1047</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1049">1049</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1050">1050</a>.</li>
! <li>Changed the following issues from New to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1120">1120</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1150">1150</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1184">1184</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1203">1203</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1217">1217</a>.</li>
! <li>Changed the following issues from Open to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#484">484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#851">851</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#933">933</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#935">935</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1041">1041</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1053">1053</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1031">1031</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1119">1119</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1153">1153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1156">1156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1211">1211</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#430">430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1123">1123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1134">1134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1136">1136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1144">1144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1216">1216</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#485">485</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1030">1030</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#473">473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1157">1157</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1186">1186</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1115">1115</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1201">1201</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1112">1112</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1126">1126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1138">1138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1152">1152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1158">1158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1189">1189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1192">1192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1208">1208</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#419">419</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#881">881</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1178">1178</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R67: 
! 2009-09-25 pre-Santa Cruz mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>282 open issues, up by 32.</li>
! <li>935 closed issues, down by 1.</li>
! <li>1217 issues total, up by 31.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1187">1187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1189">1189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1190">1190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1192">1192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1193">1193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1196">1196</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1197">1197</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1200">1200</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1201">1201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1202">1202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1203">1203</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1206">1206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1208">1208</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1209">1209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1210">1210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1211">1211</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1212">1212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1213">1213</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1214">1214</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1215">1215</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1216">1216</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1217">1217</a>.</li>
! <li>Changed the following issues from NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>.</li>
! <li>Changed the following issues from WP to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>.</li>
! <li>Changed the following issues from Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R66: 
! 2009-07-31 post-Frankfurt mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>250 open issues, down by 128.</li>
! <li>936 closed issues, up by 171.</li>
! <li>1186 issues total, up by 43.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1164">1164</a>.</li>
! <li>Added the following NAD Concepts issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1149">1149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1167">1167</a>.</li>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1168">1168</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1144">1144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1145">1145</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1146">1146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1147">1147</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1148">1148</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1150">1150</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1152">1152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1153">1153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1154">1154</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1155">1155</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1156">1156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1158">1158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1159">1159</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1166">1166</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1169">1169</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1170">1170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1172">1172</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1174">1174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1175">1175</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1179">1179</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1180">1180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1181">1181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1184">1184</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1185">1185</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1186">1186</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1160">1160</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1161">1161</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1162">1162</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1163">1163</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1165">1165</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1178">1178</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1157">1157</a>.</li>
! <li>Changed the following issues from Open to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#895">895</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#219">219</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#290">290</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#309">309</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#343">343</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#382">382</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#394">394</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#398">398</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#417">417</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#418">418</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#421">421</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#459">459</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#492">492</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#502">502</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#503">503</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#546">546</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#573">573</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#585">585</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#597">597</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#606">606</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#614">614</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#632">632</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#747">747</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#751">751</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#941">941</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#992">992</a>.</li>
! <li>Changed the following issues from Review to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1003">1003</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#568">568</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#701">701</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#702">702</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#785">785</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#863">863</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#903">903</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#988">988</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#995">995</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1002">1002</a>.</li>
! <li>Changed the following issues from New to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1124">1124</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1127">1127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1128">1128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1139">1139</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1140">1140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1141">1141</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1142">1142</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1143">1143</a>.</li>
! <li>Changed the following issues from Open to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#989">989</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1000">1000</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1007">1007</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1010">1010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1015">1015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1016">1016</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1017">1017</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1018">1018</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1026">1026</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1027">1027</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1028">1028</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1029">1029</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1032">1032</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1036">1036</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1057">1057</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1059">1059</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1072">1072</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1078">1078</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1081">1081</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1082">1082</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1083">1083</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1084">1084</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1085">1085</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1086">1086</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1092">1092</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1096">1096</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1105">1105</a>.</li>
! <li>Changed the following issues from Review to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1005">1005</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1080">1080</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1087">1087</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1111">1111</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#912">912</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#918">918</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1074">1074</a>.</li>
! <li>Changed the following issues from Tentatively NAD Editorial to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#927">927</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1109">1109</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#906">906</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#913">913</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#914">914</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#928">928</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1067">1067</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#873">873</a>.</li>
! <li>Changed the following issues from Tentatively NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#837">837</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#862">862</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#945">945</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#969">969</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#972">972</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#979">979</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1058">1058</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1060">1060</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1061">1061</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1101">1101</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1013">1013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1107">1107</a>.</li>
! <li>Changed the following issues from Open to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#255">255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#423">423</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#708">708</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#839">839</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>.</li>
! <li>Changed the following issues from CD1 to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>.</li>
! <li>Changed the following issues from NAD Editorial to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#484">484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#458">458</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#419">419</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#430">430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#881">881</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>.</li>
! <li>Changed the following issues from NAD to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#473">473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1031">1031</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#810">810</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#888">888</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#898">898</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#904">904</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#922">922</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#925">925</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#931">931</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#949">949</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#981">981</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#982">982</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#984">984</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#986">986</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#990">990</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#991">991</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#993">993</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#994">994</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1006">1006</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1014">1014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1037">1037</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1038">1038</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1039">1039</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1040">1040</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1044">1044</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1045">1045</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1065">1065</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1073">1073</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1103">1103</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R65: 
! 2009-06-19 pre-Frankfurt mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>378 open issues, up by 32.</li>
! <li>765 closed issues, up by 0.</li>
! <li>1143 issues total, up by 32.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1115">1115</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1119">1119</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1120">1120</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1122">1122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1123">1123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1124">1124</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1125">1125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1126">1126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1127">1127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1128">1128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1129">1129</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1131">1131</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1132">1132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1134">1134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1136">1136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1138">1138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1139">1139</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1140">1140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1141">1141</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1142">1142</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1143">1143</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1112">1112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#937">937</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#933">933</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#935">935</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#941">941</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#955">955</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#977">977</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#985">985</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#989">989</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#996">996</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1057">1057</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1059">1059</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1069">1069</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1072">1072</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1076">1076</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1092">1092</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1096">1096</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1105">1105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#992">992</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1010">1010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1015">1015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1080">1080</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1091">1091</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1111">1111</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1087">1087</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#568">568</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#701">701</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#702">702</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#785">785</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#863">863</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#903">903</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#912">912</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#918">918</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#995">995</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1074">1074</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#458">458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>.</li>
! <li>Changed the following issues from Review to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#988">988</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#837">837</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#862">862</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#927">927</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#945">945</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#969">969</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#972">972</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#979">979</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1058">1058</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1060">1060</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1061">1061</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1101">1101</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1109">1109</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>.</li>
! <li>Changed the following issues from Review to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#810">810</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#898">898</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#906">906</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#913">913</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#914">914</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#925">925</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#981">981</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#982">982</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#984">984</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#990">990</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1067">1067</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1073">1073</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1103">1103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1107">1107</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#986">986</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#991">991</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#993">993</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#994">994</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1002">1002</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1006">1006</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1013">1013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1014">1014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1037">1037</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1038">1038</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1039">1039</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1040">1040</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1044">1044</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1045">1045</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1065">1065</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R64: 
! 2009-05-01 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>346 open issues, up by 19.</li>
! <li>765 closed issues, up by 0.</li>
! <li>1111 issues total, up by 19.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1096">1096</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1101">1101</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1103">1103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1105">1105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1107">1107</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1109">1109</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1111">1111</a>.</li>
! <li>Changed the following issues from DR to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#130">130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#386">386</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#406">406</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#409">409</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#413">413</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#434">434</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#438">438</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#444">444</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#445">445</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#455">455</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#457">457</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#460">460</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#469">469</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#533">533</a>.</li>
! <li>Changed the following issues from Review to New: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R63: 
! 2009-03-20 post-Summit mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>327 open issues, up by 96.</li>
! <li>765 closed issues, up by 14.</li>
! <li>1092 issues total, up by 110.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1022">1022</a>.</li>
! <li>Added the following NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1025">1025</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#984">984</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#985">985</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#989">989</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#990">990</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#995">995</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#996">996</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1057">1057</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1058">1058</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1059">1059</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1060">1060</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1061">1061</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1067">1067</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1069">1069</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1072">1072</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1073">1073</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1074">1074</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1076">1076</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1080">1080</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1091">1091</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1092">1092</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1000">1000</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1007">1007</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1008">1008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1016">1016</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1017">1017</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1018">1018</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1020">1020</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1026">1026</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1027">1027</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1028">1028</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1029">1029</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1030">1030</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1031">1031</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1032">1032</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1035">1035</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1036">1036</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1041">1041</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1042">1042</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1046">1046</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1048">1048</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1051">1051</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1053">1053</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1055">1055</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1064">1064</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1075">1075</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1078">1078</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1081">1081</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1082">1082</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1083">1083</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1084">1084</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1085">1085</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1086">1086</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1087">1087</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1088">1088</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1089">1089</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#986">986</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#991">991</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#992">992</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#993">993</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#994">994</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1002">1002</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1003">1003</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1005">1005</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1006">1006</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1010">1010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1013">1013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1014">1014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1015">1015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1037">1037</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1038">1038</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1039">1039</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1040">1040</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1043">1043</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1044">1044</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1045">1045</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1047">1047</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1049">1049</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1050">1050</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1065">1065</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#988">988</a>.</li>
! <li>Changed the following issues from New to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#905">905</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#942">942</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#980">980</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#874">874</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#875">875</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#800">800</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#683">683</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#892">892</a>.</li>
! <li>Changed the following issues from Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Changed the following issues from NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#219">219</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#908">908</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#926">926</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#944">944</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#964">964</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#966">966</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#937">937</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#904">904</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#922">922</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#928">928</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#931">931</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#949">949</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#888">888</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#866">866</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#894">894</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R62: 
! 2009-02-06 pre-Summit mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>231 open issues, up by 44.</li>
! <li>751 closed issues, up by 0.</li>
! <li>982 issues total, up by 44.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#941">941</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#942">942</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#944">944</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#945">945</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#949">949</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#955">955</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#964">964</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#966">966</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#969">969</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#972">972</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#977">977</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#979">979</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#980">980</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#981">981</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#982">982</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R61: 
! 2008-12-05 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>187 open issues, up by 20.</li>
! <li>751 closed issues, up by 0.</li>
! <li>938 issues total, up by 20.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#922">922</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#925">925</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#926">926</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#927">927</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#928">928</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#931">931</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#933">933</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#935">935</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#937">937</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R60: 
! 2008-10-03 post-San Francisco mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>167 open issues, down by 25.</li>
! <li>751 closed issues, up by 65.</li>
! <li>918 issues total, up by 40.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following CD1 issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#882">882</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#898">898</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#903">903</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#904">904</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#905">905</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#906">906</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#908">908</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#912">912</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#913">913</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#914">914</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#918">918</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#881">881</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#885">885</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#887">887</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#895">895</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#896">896</a>.</li>
! <li>Added the following Pending NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#892">892</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#894">894</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#888">888</a>.</li>
! <li>Changed the following issues from New to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#818">818</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#820">820</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#843">843</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#845">845</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#846">846</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#856">856</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#858">858</a>.</li>
! <li>Changed the following issues from Ready to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#396">396</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#713">713</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#714">714</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#769">769</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#772">772</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#779">779</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787">787</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#807">807</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#808">808</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#813">813</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#824">824</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#829">829</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#842">842</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#844">844</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#848">848</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#850">850</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#852">852</a>.</li>
! <li>Changed the following issues from Review to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#23">23</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#692">692</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#698">698</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>.</li>
! <li>Changed the following issues from WP to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#44">44</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#49">49</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#76">76</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#91">91</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#92">92</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#98">98</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#117">117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#118">118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#120">120</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#123">123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#136">136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#153">153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#165">165</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#167">167</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#171">171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#179">179</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#182">182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#183">183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#184">184</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#185">185</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#186">186</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#187">187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#198">198</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#200">200</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#201">201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#202">202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#206">206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#214">214</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#221">221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#229">229</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#230">230</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#231">231</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#232">232</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#234">234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#237">237</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#238">238</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#239">239</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#240">240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#241">241</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#242">242</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#243">243</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#247">247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#248">248</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#251">251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#252">252</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#253">253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#256">256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#259">259</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#260">260</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#261">261</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#262">262</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#263">263</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#265">265</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#266">266</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#268">268</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#270">270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#271">271</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#272">272</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#273">273</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#274">274</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#275">275</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#276">276</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#278">278</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#280">280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#281">281</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#282">282</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#283">283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#284">284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#285">285</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#286">286</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#288">288</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#291">291</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#292">292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#294">294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#295">295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#297">297</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#298">298</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#300">300</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#301">301</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#303">303</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#305">305</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#306">306</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#307">307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#308">308</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#310">310</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#311">311</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#312">312</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#315">315</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#316">316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#317">317</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#318">318</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#319">319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#320">320</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#321">321</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#322">322</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#324">324</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#325">325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#327">327</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#328">328</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#329">329</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#331">331</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#333">333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#334">334</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#335">335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#336">336</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#337">337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#338">338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#339">339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#340">340</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#341">341</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#345">345</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#346">346</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#347">347</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#349">349</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#352">352</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#354">354</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#355">355</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#358">358</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#359">359</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#360">360</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#363">363</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#364">364</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#365">365</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#369">369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#370">370</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#373">373</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#375">375</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#376">376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#379">379</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#380">380</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#381">381</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#383">383</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#389">389</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#391">391</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#395">395</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#400">400</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#401">401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#402">402</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#403">403</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#404">404</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#405">405</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#407">407</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#410">410</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#411">411</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#412">412</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#414">414</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#415">415</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#416">416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#420">420</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#422">422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#425">425</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#426">426</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#428">428</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#432">432</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#435">435</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#436">436</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#441">441</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#442">442</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#443">443</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#448">448</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#449">449</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#453">453</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#456">456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#461">461</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#464">464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#465">465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#467">467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#468">468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#474">474</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#495">495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#496">496</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#497">497</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#505">505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#507">507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#508">508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#519">519</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#520">520</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#521">521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#524">524</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#552">552</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#650">650</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#651">651</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#652">652</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#678">678</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#681">681</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#699">699</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#712">712</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#792">792</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#798">798</a>.</li>
! <li>Changed the following issues from Open to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#849">849</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#855">855</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#454">454</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#812">812</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#841">841</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#864">864</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#484">484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#717">717</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#725">725</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#738">738</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#751">751</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#819">819</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#861">861</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#873">873</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#851">851</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#866">866</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>.</li>
! <li>Changed the following issues from TC to TC1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1">1</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#3">3</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#5">5</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#7">7</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#8">8</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#9">9</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#11">11</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#13">13</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#14">14</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#15">15</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#16">16</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#17">17</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#18">18</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#19">19</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#20">20</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#21">21</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#22">22</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#24">24</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#25">25</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#26">26</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#27">27</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#28">28</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#29">29</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#30">30</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#31">31</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#32">32</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#33">33</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#34">34</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#35">35</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#36">36</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#37">37</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#38">38</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#39">39</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#40">40</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#41">41</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#42">42</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#46">46</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#47">47</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#48">48</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#50">50</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#51">51</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#52">52</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#53">53</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#54">54</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#55">55</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#56">56</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#57">57</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#59">59</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#61">61</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#62">62</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#63">63</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#64">64</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#66">66</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#68">68</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#69">69</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#70">70</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#71">71</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#74">74</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#75">75</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#78">78</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#79">79</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#80">80</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#83">83</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#86">86</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#90">90</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#106">106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#108">108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#110">110</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#115">115</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#119">119</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#122">122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#124">124</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#125">125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#126">126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#127">127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#129">129</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#132">132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#133">133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#134">134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#137">137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#139">139</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#141">141</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#142">142</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#144">144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#146">146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#147">147</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#148">148</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#150">150</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#151">151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#152">152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#154">154</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#155">155</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#156">156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#158">158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#159">159</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#160">160</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#161">161</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#164">164</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#168">168</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#169">169</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#170">170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#172">172</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#173">173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#174">174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#175">175</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#176">176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#181">181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#189">189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#193">193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#195">195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199">199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#208">208</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#209">209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#210">210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#211">211</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#212">212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#217">217</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#220">220</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#222">222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#223">223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#224">224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R59: 
! 2008-08-22 pre-San Francisco mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>192 open issues, up by 9.</li>
! <li>686 closed issues, up by 0.</li>
! <li>878 issues total, up by 9.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#873">873</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#874">874</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#875">875</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R58: 
! 2008-07-28 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>183 open issues, up by 12.</li>
! <li>686 closed issues, down by 4.</li>
! <li>869 issues total, up by 8.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#862">862</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#863">863</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#864">864</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#866">866</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#393">393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#592">592</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#754">754</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#757">757</a>.</li>
! <li>Changed the following issues from Pending WP to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>.</li>
! <li>Changed the following issues from WP to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R57: 
! 2008-06-27 post-Sophia Antipolis mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>171 open issues, down by 20.</li>
! <li>690 closed issues, up by 43.</li>
! <li>861 issues total, up by 23.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#840">840</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#841">841</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#843">843</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#845">845</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#846">846</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#849">849</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#855">855</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#856">856</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#858">858</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#861">861</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#839">839</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#842">842</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#844">844</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#848">848</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#850">850</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#852">852</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#851">851</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#826">826</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#570">570</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#786">786</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#831">831</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#713">713</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#714">714</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#769">769</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#772">772</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#779">779</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787">787</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#807">807</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#808">808</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#813">813</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#824">824</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#829">829</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#396">396</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#692">692</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#698">698</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#23">23</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Changed the following issues from Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#792">792</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#798">798</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R56: 
! 2008-05-16 pre-Sophia Antipolis mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>191 open issues, up by 24.</li>
! <li>647 closed issues, up by 1.</li>
! <li>838 issues total, up by 25.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#818">818</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#819">819</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#820">820</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#824">824</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#826">826</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#829">829</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#831">831</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#837">837</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#802">802</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R55: 
! 2008-03-14 post-Bellevue mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>167 open issues, down by 39.</li>
! <li>646 closed issues, up by 65.</li>
! <li>813 issues total, up by 26.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following Dup issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#795">795</a>.</li>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#790">790</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#791">791</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#796">796</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#797">797</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#799">799</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#802">802</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#807">807</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#808">808</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#810">810</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#812">812</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#813">813</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#800">800</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#801">801</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#792">792</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#798">798</a>.</li>
! <li>Changed the following issues from NAD Future to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#116">116</a>.</li>
! <li>Changed the following issues from NAD Future to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#188">188</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#729">729</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#730">730</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#731">731</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#733">733</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#735">735</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#736">736</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#737">737</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#739">739</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#741">741</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#745">745</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#748">748</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#763">763</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#764">764</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#773">773</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#784">784</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#388">388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#462">462</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#627">627</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#653">653</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#686">686</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#707">707</a>.</li>
! <li>Changed the following issues from NAD Future to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#390">390</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#529">529</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#626">626</a>.</li>
! <li>Changed the following issues from Review to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#645">645</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#684">684</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#747">747</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#717">717</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#725">725</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#738">738</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#754">754</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#757">757</a>.</li>
! <li>Changed the following issues from Open to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R54: 
! 2008-02-01 pre-Bellevue mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>206 open issues, up by 23.</li>
! <li>581 closed issues, up by 0.</li>
! <li>787 issues total, up by 23.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#769">769</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#772">772</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#773">773</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#779">779</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#784">784</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#785">785</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#786">786</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787">787</a>.</li>
! <li>Changed the following issues from NAD Future to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#105">105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#348">348</a>.</li>
! <li>Changed the following issues from NAD Future to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#353">353</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#697">697</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#388">388</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R53: 
! 2007-12-09 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>183 open issues, up by 11.</li>
! <li>581 closed issues, down by 1.</li>
! <li>764 issues total, up by 10.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#757">757</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#763">763</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#764">764</a>.</li>
! <li>Changed the following issues from NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>.</li>
! <li>Changed the following issues from Pending WP to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R52: 
! 2007-10-19 post-Kona mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>172 open issues, up by 4.</li>
! <li>582 closed issues, up by 27.</li>
! <li>754 issues total, up by 31.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#725">725</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#729">729</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#730">730</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#731">731</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#733">733</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#735">735</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#736">736</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#737">737</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#738">738</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#739">739</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#741">741</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#745">745</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#747">747</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#748">748</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#751">751</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#754">754</a>.</li>
! <li>Changed the following issues from NAD Future to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#77">77</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#639">639</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#657">657</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#663">663</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#548">548</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#546">546</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#573">573</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#585">585</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#627">627</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#632">632</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#653">653</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#686">686</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#707">707</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#708">708</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#393">393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#592">592</a>.</li>
! <li>Changed the following issues from New to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#645">645</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#684">684</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>.</li>
! <li>Changed the following issues from New to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#552">552</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#650">650</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#651">651</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#652">652</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#678">678</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#681">681</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#699">699</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#712">712</a>.</li>
! <li>Changed the following issues from Open to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#401">401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#524">524</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R51: 
! 2007-09-09 pre-Kona mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>168 open issues, up by 15.</li>
! <li>555 closed issues, up by 0.</li>
! <li>723 issues total, up by 15.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#712">712</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#713">713</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#714">714</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#717">717</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R50: 
! 2007-08-05 post-Toronto mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>153 open issues, down by 5.</li>
! <li>555 closed issues, up by 17.</li>
! <li>708 issues total, up by 12.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#697">697</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#698">698</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#699">699</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#701">701</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#702">702</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#707">707</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#708">708</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#583">583</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#584">584</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#662">662</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#528">528</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#637">637</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#647">647</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#658">658</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#690">690</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#525">525</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#633">633</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#636">636</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#641">641</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#642">642</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#648">648</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#649">649</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#656">656</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>.</li>
! <li>Changed the following issues from Pending WP to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>.</li>
! <li>Changed the following issues from Ready to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>.</li>
! <li>Changed the following issues from Ready to TRDec: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a>.</li>
! <li>Changed the following issues from DR to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#453">453</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R49: 
! 2007-06-23 pre-Toronto mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>158 open issues, up by 13.</li>
! <li>538 closed issues, up by 7.</li>
! <li>696 issues total, up by 20.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#678">678</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#681">681</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#684">684</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#686">686</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#690">690</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#692">692</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>.</li>
! <li>Added the following Pending NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#683">683</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#587">587</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#590">590</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#636">636</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#642">642</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#648">648</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#649">649</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R48: 
! 2007-05-06 post-Oxford mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>145 open issues, down by 33.</li>
! <li>531 closed issues, up by 53.</li>
! <li>676 issues total, up by 20.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#657">657</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#658">658</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#662">662</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#663">663</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#385">385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#470">470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#515">515</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#547">547</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#560">560</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#572">572</a>.</li>
! <li>Changed the following issues from NAD to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#351">351</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#357">357</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#368">368</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#499">499</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#513">513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#514">514</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#516">516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#555">555</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#558">558</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#482">482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#615">615</a>.</li>
! <li>Changed the following issues from NAD_Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#77">77</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#105">105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#116">116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#188">188</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#219">219</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#348">348</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#353">353</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#388">388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#390">390</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#633">633</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#641">641</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#656">656</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a>.</li>
! <li>Changed the following issues from Ready to TRDec: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#598">598</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#599">599</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#600">600</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#601">601</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#602">602</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#603">603</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#605">605</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#201">201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#206">206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#416">416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#422">422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#456">456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R47: 
! 2007-03-09 pre-Oxford mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>178 open issues, up by 37.</li>
! <li>478 closed issues, up by 0.</li>
! <li>656 issues total, up by 37.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#627">627</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#632">632</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#633">633</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#636">636</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#637">637</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#639">639</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#641">641</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#642">642</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#645">645</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#647">647</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#648">648</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#649">649</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#650">650</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#651">651</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#652">652</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#653">653</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#656">656</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#626">626</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#570">570</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#590">590</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#614">614</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#547">547</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#560">560</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#572">572</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#615">615</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#201">201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#206">206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#385">385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#416">416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#422">422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#456">456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#470">470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#482">482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#515">515</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R46: 
! 2007-01-12 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>141 open issues, up by 11.</li>
! <li>478 closed issues, down by 1.</li>
! <li>619 issues total, up by 10.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#614">614</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#615">615</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R45: 
! 2006-11-03 post-Portland mailing.
! <ul>
  <li><b>Summary:</b><ul>
! <li>130 open issues, up by 0.</li>
! <li>479 closed issues, up by 17.</li>
! <li>609 issues total, up by 17.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#520">520</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#521">521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a> to WP.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#516">516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#554">554</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#555">555</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#558">558</a> to NAD.</li>
! <li>Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a> to Dup.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#524">524</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#597">597</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#606">606</a> to Open.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#598">598</a> - <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#603">603</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#605">605</a> to Ready.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a> to Review.</li>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#597">597</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#598">598</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#599">599</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#600">600</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#601">601</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#602">602</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#603">603</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#605">605</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#606">606</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R44: 
! 2006-09-08 pre-Portland mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>130 open issues, up by 6.</li>
! <li>462 closed issues, down by 1.</li>
! <li>592 issues total, up by 5.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#583">583</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#584">584</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#585">585</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#587">587</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#590">590</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#592">592</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R43: 
! 2006-06-23 mid-term mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>124 open issues, up by 14.</li>
! <li>463 closed issues, down by 1.</li>
! <li>587 issues total, up by 13.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a>.</li>
! <li>Reopened <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#255">255</a>.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#520">520</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a> to Tentatively Ready.</li>
  </ul></li>
  </ul>
  </li>
! <li>R42: 
! 2006-04-21 post-Berlin mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>110 open issues, down by 16.</li>
! <li>464 closed issues, up by 24.</li>
! <li>574 issues total, up by 8.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#568">568</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#570">570</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#572">572</a>.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#499">499</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#501">501</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#506">506</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#509">509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#510">510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#511">511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#513">513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#514">514</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#517">517</a> to NAD.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#502">502</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#503">503</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#515">515</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#516">516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#525">525</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#528">528</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#529">529</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#548">548</a> to Open.</li>
! <li>Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#521">521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a> to Ready.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#247">247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#294">294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#369">369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#376">376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#495">495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#497">497</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#505">505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#507">507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#508">508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#519">519</a> to WP.</li>
! <li>Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a> to Review.</li>
  </ul></li>
  </ul>
  </li>
! <li>R41: 
! 2006-02-24 pre-Berlin mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>126 open issues, up by 31.</li>
! <li>440 closed issues, up by 0.</li>
! <li>566 issues total, up by 31.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#546">546</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#547">547</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#548">548</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a> ,<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#552">552</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#554">554</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#555">555</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#558">558</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#560">560</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>.</li>
! <li>Moved <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a> from Ready to Open.</li>
! <li>Reopened <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#309">309</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R40: 
! 2005-12-16 mid-term mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>95 open issues.</li>
! <li>440 closed issues.</li>
! <li>535 issues total.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#529">529</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#533">533</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>.</li>
  </ul></li>
  </ul>
  </li>
- <li>R39: 
- 2005-10-14 post-Mont Tremblant mailing.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#528">528</a>.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#280">280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#461">461</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#464">464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#465">465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#467">467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#468">468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#474">474</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#496">496</a> from Ready to WP as per the vote from Mont Tremblant.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#247">247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#294">294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#369">369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#376">376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#495">495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#497">497</a> from Review to Ready.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#506">506</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#509">509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#510">510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#511">511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#513">513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#514">514</a> from New to Open.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#505">505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#507">507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#508">508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#519">519</a> from New to Ready.
- Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#500">500</a> from New to NAD.
- Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a> from New to Review.
- </li>
- <li>R38: 
- 2005-07-03 pre-Mont Tremblant mailing.
- Merged open TR1 issues in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>
- </li>
- <li>R37: 
- 2005-06 mid-term mailing.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#503">503</a>.
- </li>
- <li>R36: 
- 2005-04 post-Lillehammer mailing. All issues in "ready" status except
- for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#454">454</a> were moved to "DR" status, and all issues
- previously in "DR" status were moved to "WP".
- </li>
- <li>R35: 
- 2005-03 pre-Lillehammer mailing.
- </li>
- <li>R34: 
- 2005-01 mid-term mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#494">494</a>.
- </li>
- <li>R33: 
- 2004-11 post-Redmond mailing. Reflects actions taken in Redmond.
- </li>
- <li>R32: 
- 2004-09 pre-Redmond mailing: reflects new proposed resolutions and
- new issues received after the 2004-07 mailing.  Added
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#481">481</a>.
- </li>
- <li>R31: 
- 2004-07 mid-term mailing: reflects new proposed resolutions and
- new issues received after the post-Sydney mailing.  Added
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>.
- </li>
- <li>R30: 
- Post-Sydney mailing: reflects decisions made at the Sydney meeting.
- Voted all "Ready" issues from R29 into the working paper.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#460">460</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#462">462</a>.
- </li>
- <li>R29: 
- Pre-Sydney mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#441">441</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#457">457</a>.
- </li>
- <li>R28: 
- Post-Kona mailing: reflects decisions made at the Kona meeting.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#432">432</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#440">440</a>.
- </li>
- <li>R27: 
- Pre-Kona mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#404">404</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>.
- </li>
- <li>R26: 
- Post-Oxford mailing: reflects decisions made at the Oxford meeting.
- All issues in Ready status were voted into DR status.  All issues in
- DR status were voted into WP status.
- </li>
- <li>R25: 
- Pre-Oxford mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#390">390</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#402">402</a>.
- </li>
- <li>R24: 
- Post-Santa Cruz mailing: reflects decisions made at the Santa Cruz
- meeting.  All Ready issues from R23 with the exception of <iref ref="253">, which has been given a new proposed resolution, were
- moved to DR status.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#383">383</a>-<iref ref="389">.  (Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#389">389</a> were discussed
- at the meeting.)  Made progress on issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a>, <iref ref="226">, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#229">229</a>: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a> and <iref ref="229"> have been moved to Ready status, and the only remaining
- concerns with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a> involve wording.
- </iref></iref></iref></iref></li>
- <li>R23: 
- Pre-Santa Cruz mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#367">367</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#382">382</a>.
- Moved issues in the TC to TC status.
- </li>
- <li>R22: 
- Post-Curaçao mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>-<iref ref="366">.
- </iref></li>
- <li>R21: 
- Pre-Curaçao mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#351">351</a>-<iref ref="361">.
- </iref></li>
- <li>R20: 
- Post-Redmond mailing; reflects actions taken in Redmond.  Added
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#336">336</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>, of which issues 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#347">347</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a> were added since Redmond, hence
- not discussed at the meeting.  
- 
- All Ready issues were moved to DR status, with the exception of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#284">284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#241">241</a>, and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#267">267</a>.
- 
- Noteworthy issues discussed at Redmond include 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#120">120</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#202">202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#270">270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#253">253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>.
- </li>
- <li>R19: 
- Pre-Redmond mailing.  Added new issues 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#335">335</a>.
- </li>
- <li>R18: 
- Post-Copenhagen mailing; reflects actions taken in Copenhagen.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#312">312</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#317">317</a>, and discussed
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#271">271</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#314">314</a>.
- 
- Changed status of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#118">118</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#136">136</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#153">153</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#165">165</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#171">171</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#183">183</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#184">184</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#185">185</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#186">186</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#214">214</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#221">221</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#234">234</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#237">237</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#243">243</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#248">248</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#251">251</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#252">252</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#256">256</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#260">260</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#261">261</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#262">262</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#263">263</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#265">265</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#268">268</a>
- to DR.
- 
- Changed status of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#49">49</a>  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#117">117</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#182">182</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#230">230</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#232">232</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#238">238</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#241">241</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#242">242</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#259">259</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#266">266</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#267">267</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#271">271</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#272">272</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#273">273</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#275">275</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#281">281</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#284">284</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#285">285</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#286">286</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#288">288</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#292">292</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#295">295</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#297">297</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#298">298</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#301">301</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#303">303</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#306">306</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#307">307</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#308">308</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#312">312</a>
- to Ready.
- 
- Closed issues 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#277">277</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#279">279</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#287">287</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#289">289</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#293">293</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#302">302</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#313">313</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#314">314</a>
- as NAD.
- 
- </li>
- <li>R17: 
- Pre-Copenhagen mailing.  Converted issues list to XML.  Added proposed
- resolutions for issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#49">49</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#76">76</a>, <iref ref="91">, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#267">267</a>.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#278">278</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#311">311</a>.
- </iref></li>
- <li>R16:  
- post-Toronto mailing; reflects actions taken in Toronto. Added new
- issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#265">265</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#277">277</a>.  Changed status of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#3">3</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#8">8</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#9">9</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#19">19</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#26">26</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#31">31</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#61">61</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#63">63</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#86">86</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#108">108</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#115">115</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#122">122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#127">127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#129">129</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#134">134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#137">137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#142">142</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#144">144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#146">146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#147">147</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#159">159</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#164">164</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#170">170</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#181">181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199">199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#208">208</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#209">209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#210">210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#211">211</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#212">212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#217">217</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#220">220</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#222">222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#223">223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#224">224</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a> to "DR".  Reopened issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#23">23</a>. Reopened
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#187">187</a>. Changed issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#2">2</a> and
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#4">4</a> to NAD. Fixed a typo in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#17">17</a>. Fixed
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#70">70</a>: signature should be changed both places it
- appears. Fixed issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#160">160</a>: previous version didn't fix
- the bug in enough places.
- </li>
- <li>R15: 
- pre-Toronto mailing. Added issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a>. Some small HTML formatting
- changes so that we pass Weblint tests.
- </li>
- <li>R14: 
- post-Tokyo II mailing; reflects committee actions taken in
- Tokyo. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#232">232</a>. (00-0019R1/N1242)
- </li>
- <li>R13: 
- pre-Tokyo II updated: Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#212">212</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a>.
- </li>
- <li>R12: 
- pre-Tokyo II mailing: Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199">199</a> to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#211">211</a>. Added "and paragraph 5" to the proposed resolution
- of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#29">29</a>.  Add further rationale to issue
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#178">178</a>.
- </li>
- <li>R11: 
- post-Kona mailing: Updated to reflect LWG and full committee actions
- in Kona (99-0048/N1224). Note changed resolution of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#4">4</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#38">38</a>. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#196">196</a>
- to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#198">198</a>. Closed issues list split into "defects" and
- "closed" documents.  Changed the proposed resolution of issue
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#4">4</a> to NAD, and changed the wording of proposed resolution
- of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#38">38</a>.
- </li>
- <li>R10: 
- pre-Kona updated.  Added proposed resolutions <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#83">83</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#86">86</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#91">91</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#92">92</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a>. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a> to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#195">195</a>. (99-0033/D1209, 14 Oct 99)
- </li>
- <li>R9: 
- pre-Kona mailing.  Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a> to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#189">189</a>. Issues list split into separate "active" and
- "closed" documents. (99-0030/N1206, 25 Aug 99)
- </li>
- <li>R8: 
- post-Dublin mailing. Updated to reflect LWG and full committee actions
- in Dublin. (99-0016/N1193, 21 Apr 99)
- </li>
- <li>R7: 
- pre-Dublin updated: Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#130">130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#131">131</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#132">132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#133">133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#134">134</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#135">135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#136">136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#137">137</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#139">139</a> (31 Mar 99)
- </li>
- <li>R6: 
- pre-Dublin mailing. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#127">127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>,
- and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#129">129</a>.  (99-0007/N1194, 22 Feb 99)
- </li>
- <li>R5: 
- update issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>; added issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#126">126</a>. Format revisions to prepare
- for making list public. (30 Dec 98)
- </li>
- <li>R4: 
- post-Santa Cruz II updated: Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#110">110</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#113">113</a> added, several
- issues corrected. (22 Oct 98)
- </li>
- <li>R3: 
- post-Santa Cruz II: Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#94">94</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a>
- added, many issues updated to reflect LWG consensus (12 Oct 98)
- </li>
- <li>R2: 
- pre-Santa Cruz II: Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#73">73</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#93">93</a> added,
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#17">17</a> updated. (29 Sep 98)
- </li>
- <li>R1: 
- Correction to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#55">55</a> resolution, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a> code
- format, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#64">64</a> title. (17 Sep 98)
- </li>
  </ul>
  
  <h2>Closed Issues</h2>
  <hr>
  <h3><a name="2"></a>2. Auto_ptr conversions effects incorrect</h3>
! <p><b>Section:</b> D.12.1.3 [auto.ptr.conv] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1997-12-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 1 in "Effects", says "Calls
! p-&gt;release()" where it clearly must be "Calls
! p.release()". (As it is, it seems to require using
  auto_ptr&lt;&gt;::operator-&gt; to refer to X::release, assuming that
  exists.)</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 20.7.4.3 [meta.unary.prop] paragraph 1 Effects from 
! "Calls p-&gt;release()" to "Calls p.release()".</p>
  
  
  <p><b>Rationale:</b></p>
--- 34,228 ----
  </tr>
  <tr>
    <td align="left">Reply to:</td>
!   <td align="left">Marshall Clow &lt;<a href="mailto:lwgchair@gmail.com">lwgchair@gmail.com</a>&gt;</td>
  </tr>
! </table>
! <h1>C++ Standard Library Closed Issues List (Revision R93)</h1>
! <p><p>Revised 2015-05-23 at 15:05:40 UTC</p>
! </p>
!   <p>Reference ISO/IEC IS 14882:2014(E)</p>
    <p>Also see:</p>
      <ul>
!       <li><a href="lwg-toc.html">Table of Contents</a> for all library issues.</li>
!       <li><a href="lwg-index.html">Index by Section</a> for all library issues.</li>
!       <li><a href="lwg-status.html">Index by Status</a> for all library issues.</li>
!       <li><a href="lwg-active.html">Library Active Issues List</a></li>
!       <li><a href="lwg-defects.html">Library Defect Reports List</a></li>
      </ul>
  
    <p>This document contains only library issues which have been closed
    by the Library Working Group as duplicates or not defects. That is,
!   issues which have a status of <a href="lwg-active.html#Dup">Dup</a> or
!   <a href="lwg-active.html#NAD">NAD</a>. See the <a href="lwg-active.html">Library Active Issues List</a> active issues and more
!   information. See the <a href="lwg-defects.html">Library Defect Reports List</a> for issues considered
    defects.  The introductory material in that document also applies to
    this document.</p>
  
  <h2>Revision History</h2>
  <ul>
! <li>R93: 2014-05-22 2015 post-Lenexa mailing<ul>
  <li><b>Summary:</b><ul>
! <li>256 open issues, down by 36.</li>
! <li>1770 closed issues, up by 48.</li>
! <li>2026 issues total, up by 12.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 2 Ready issues: <a href="lwg-active.html#2492">2492</a>, <a href="lwg-active.html#2494">2494</a>.</li>
! <li>Added the following 10 New issues: <a href="lwg-active.html#2493">2493</a>, <a href="lwg-active.html#2495">2495</a>, <a href="lwg-active.html#2496">2496</a>, <a href="lwg-active.html#2497">2497</a>, <a href="lwg-active.html#2498">2498</a>, <a href="lwg-active.html#2499">2499</a>, <a href="lwg-active.html#2500">2500</a>, <a href="lwg-active.html#2501">2501</a>, <a href="lwg-active.html#2502">2502</a>, <a href="lwg-active.html#2503">2503</a>.</li>
! <li>Changed the following 2 issues to Ready (from Review): <a href="lwg-active.html#2111">2111</a>, <a href="lwg-active.html#2380">2380</a>.</li>
! <li>Changed the following 20 issues to Ready (from New): <a href="lwg-active.html#2244">2244</a>, <a href="lwg-active.html#2250">2250</a>, <a href="lwg-active.html#2259">2259</a>, <a href="lwg-active.html#2336">2336</a>, <a href="lwg-active.html#2353">2353</a>, <a href="lwg-active.html#2367">2367</a>, <a href="lwg-active.html#2384">2384</a>, <a href="lwg-active.html#2385">2385</a>, <a href="lwg-active.html#2435">2435</a>, <a href="lwg-active.html#2462">2462</a>, <a href="lwg-active.html#2466">2466</a>, <a href="lwg-active.html#2473">2473</a>, <a href="lwg-active.html#2476">2476</a>, <a href="lwg-active.html#2477">2477</a>, <a href="lwg-active.html#2483">2483</a>, <a href="lwg-active.html#2484">2484</a>, <a href="lwg-active.html#2485">2485</a>, <a href="lwg-active.html#2486">2486</a>, <a href="lwg-active.html#2487">2487</a>, <a href="lwg-active.html#2489">2489</a>.</li>
! <li>Changed the following 12 issues to Ready (from Open): <a href="lwg-active.html#1169">1169</a>, <a href="lwg-active.html#2072">2072</a>, <a href="lwg-active.html#2101">2101</a>, <a href="lwg-active.html#2119">2119</a>, <a href="lwg-active.html#2127">2127</a>, <a href="lwg-active.html#2133">2133</a>, <a href="lwg-active.html#2156">2156</a>, <a href="lwg-active.html#2181">2181</a>, <a href="lwg-active.html#2218">2218</a>, <a href="lwg-active.html#2219">2219</a>, <a href="lwg-active.html#2447">2447</a>, <a href="lwg-active.html#2469">2469</a>.</li>
! <li>Changed the following issue to Tentatively Ready (from Open): <a href="lwg-active.html#2224">2224</a>.</li>
! <li>Changed the following issue to Review (from New): <a href="lwg-active.html#2296">2296</a>.</li>
! <li>Changed the following issue to Review (from Open): <a href="lwg-active.html#2328">2328</a>.</li>
! <li>Changed the following 11 issues to Open (from New): <a href="lwg-active.html#2262">2262</a>, <a href="lwg-active.html#2289">2289</a>, <a href="lwg-active.html#2338">2338</a>, <a href="lwg-active.html#2348">2348</a>, <a href="lwg-active.html#2349">2349</a>, <a href="lwg-active.html#2370">2370</a>, <a href="lwg-active.html#2398">2398</a>, <a href="lwg-active.html#2402">2402</a>, <a href="lwg-active.html#2422">2422</a>, <a href="lwg-active.html#2450">2450</a>, <a href="lwg-active.html#2456">2456</a>.</li>
! <li>Changed the following 8 issues to Open (from SG1): <a href="lwg-active.html#2245">2245</a>, <a href="lwg-active.html#2265">2265</a>, <a href="lwg-active.html#2276">2276</a>, <a href="lwg-active.html#2309">2309</a>, <a href="lwg-active.html#2363">2363</a>, <a href="lwg-active.html#2379">2379</a>, <a href="lwg-active.html#2426">2426</a>, <a href="lwg-active.html#2441">2441</a>.</li>
! <li>Changed the following issue to LEWG (from New): <a href="lwg-active.html#2372">2372</a>.</li>
! <li>Changed the following issue to EWG (from New): <a href="lwg-active.html#2432">2432</a>.</li>
! <li>Changed the following issue to Deferred (from Open): <a href="lwg-active.html#2202">2202</a>.</li>
! <li>Changed the following 14 issues to WP (from Ready): <a href="lwg-defects.html#2160">2160</a>, <a href="lwg-defects.html#2168">2168</a>, <a href="lwg-defects.html#2364">2364</a>, <a href="lwg-defects.html#2403">2403</a>, <a href="lwg-defects.html#2406">2406</a>, <a href="lwg-defects.html#2411">2411</a>, <a href="lwg-defects.html#2425">2425</a>, <a href="lwg-defects.html#2427">2427</a>, <a href="lwg-defects.html#2428">2428</a>, <a href="lwg-defects.html#2433">2433</a>, <a href="lwg-defects.html#2434">2434</a>, <a href="lwg-defects.html#2438">2438</a>, <a href="lwg-defects.html#2439">2439</a>, <a href="lwg-defects.html#2440">2440</a>.</li>
! <li>Changed the following 18 issues to WP (from Tentatively Ready): <a href="lwg-defects.html#2059">2059</a>, <a href="lwg-defects.html#2076">2076</a>, <a href="lwg-defects.html#2239">2239</a>, <a href="lwg-defects.html#2369">2369</a>, <a href="lwg-defects.html#2378">2378</a>, <a href="lwg-defects.html#2410">2410</a>, <a href="lwg-defects.html#2415">2415</a>, <a href="lwg-defects.html#2418">2418</a>, <a href="lwg-defects.html#2437">2437</a>, <a href="lwg-defects.html#2448">2448</a>, <a href="lwg-defects.html#2454">2454</a>, <a href="lwg-defects.html#2455">2455</a>, <a href="lwg-defects.html#2458">2458</a>, <a href="lwg-defects.html#2459">2459</a>, <a href="lwg-defects.html#2463">2463</a>, <a href="lwg-defects.html#2467">2467</a>, <a href="lwg-defects.html#2470">2470</a>, <a href="lwg-defects.html#2482">2482</a>.</li>
! <li>Changed the following 3 issues to WP (from New): <a href="lwg-defects.html#2420">2420</a>, <a href="lwg-defects.html#2464">2464</a>, <a href="lwg-defects.html#2488">2488</a>.</li>
! <li>Changed the following issue to WP (from Open): <a href="lwg-defects.html#2063">2063</a>.</li>
! <li>Changed the following 2 issues to WP (from SG1): <a href="lwg-defects.html#2407">2407</a>, <a href="lwg-defects.html#2442">2442</a>.</li>
! <li>Changed the following issue to Resolved (from Review): <a href="lwg-defects.html#2228">2228</a>.</li>
! <li>Changed the following 3 issues to Resolved (from Open): <a href="lwg-defects.html#1526">1526</a>, <a href="lwg-defects.html#2274">2274</a>, <a href="lwg-defects.html#2397">2397</a>.</li>
! <li>Changed the following 5 issues to NAD (from New): <a href="lwg-closed.html#2079">2079</a>, <a href="lwg-closed.html#2251">2251</a>, <a href="lwg-closed.html#2351">2351</a>, <a href="lwg-closed.html#2373">2373</a>, <a href="lwg-closed.html#2386">2386</a>.</li>
! <li>Changed the following issue to NAD (from Open): <a href="lwg-closed.html#2388">2388</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R92: 
! 2015-04-09 pre-Lenexa mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>292 open issues, up by 33.</li>
! <li>1722 closed issues, up by 0.</li>
! <li>2014 issues total, up by 33.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 5 Tentatively Ready issues: <a href="lwg-active.html#2459">2459</a>, <a href="lwg-active.html#2463">2463</a>, <a href="lwg-active.html#2467">2467</a>, <a href="lwg-active.html#2470">2470</a>, <a href="lwg-active.html#2482">2482</a>.</li>
! <li>Added the following 27 New issues: <a href="lwg-active.html#2460">2460</a>, <a href="lwg-active.html#2461">2461</a>, <a href="lwg-active.html#2462">2462</a>, <a href="lwg-active.html#2464">2464</a>, <a href="lwg-active.html#2465">2465</a>, <a href="lwg-active.html#2466">2466</a>, <a href="lwg-active.html#2468">2468</a>, <a href="lwg-active.html#2471">2471</a>, <a href="lwg-active.html#2472">2472</a>, <a href="lwg-active.html#2473">2473</a>, <a href="lwg-active.html#2474">2474</a>, <a href="lwg-active.html#2475">2475</a>, <a href="lwg-active.html#2476">2476</a>, <a href="lwg-active.html#2477">2477</a>, <a href="lwg-active.html#2478">2478</a>, <a href="lwg-active.html#2479">2479</a>, <a href="lwg-active.html#2480">2480</a>, <a href="lwg-active.html#2481">2481</a>, <a href="lwg-active.html#2483">2483</a>, <a href="lwg-active.html#2484">2484</a>, <a href="lwg-active.html#2485">2485</a>, <a href="lwg-active.html#2486">2486</a>, <a href="lwg-active.html#2487">2487</a>, <a href="lwg-active.html#2488">2488</a>, <a href="lwg-active.html#2489">2489</a>, <a href="lwg-active.html#2490">2490</a>, <a href="lwg-active.html#2491">2491</a>.</li>
! <li>Added the following Open issue: <a href="lwg-active.html#2469">2469</a>.</li>
! <li>Changed the following issue to Tentatively Ready (from Review): <a href="lwg-active.html#2378">2378</a>.</li>
! <li>Changed the following 11 issues to Tentatively Ready (from New): <a href="lwg-active.html#2076">2076</a>, <a href="lwg-active.html#2239">2239</a>, <a href="lwg-active.html#2369">2369</a>, <a href="lwg-active.html#2410">2410</a>, <a href="lwg-active.html#2415">2415</a>, <a href="lwg-active.html#2418">2418</a>, <a href="lwg-active.html#2437">2437</a>, <a href="lwg-active.html#2448">2448</a>, <a href="lwg-active.html#2454">2454</a>, <a href="lwg-active.html#2455">2455</a>, <a href="lwg-active.html#2458">2458</a>.</li>
! <li>Changed the following issue to Tentatively Ready (from Open): <a href="lwg-active.html#2059">2059</a>.</li>
! <li>Changed the following issue to Tentatively NAD (from New): <a href="lwg-active.html#2337">2337</a>.</li>
! <li>Changed the following issue to Tentatively NAD (from Open): <a href="lwg-active.html#760">760</a>.</li>
! <li>Changed the following 5 issues to Open (from New): <a href="lwg-active.html#2312">2312</a>, <a href="lwg-active.html#2388">2388</a>, <a href="lwg-active.html#2393">2393</a>, <a href="lwg-active.html#2444">2444</a>, <a href="lwg-active.html#2447">2447</a>.</li>
! <li>Changed the following 4 issues to LEWG (from New): <a href="lwg-active.html#2391">2391</a>, <a href="lwg-active.html#2417">2417</a>, <a href="lwg-active.html#2436">2436</a>, <a href="lwg-active.html#2451">2451</a>.</li>
! <li>Changed the following issue to EWG (from Open): <a href="lwg-active.html#2089">2089</a>.</li>
! <li>Changed the following issue to Core (from New): <a href="lwg-active.html#2452">2452</a>.</li>
! <li>Changed the following 13 issues to SG1 (from New): <a href="lwg-active.html#2236">2236</a>, <a href="lwg-active.html#2245">2245</a>, <a href="lwg-active.html#2265">2265</a>, <a href="lwg-active.html#2276">2276</a>, <a href="lwg-active.html#2309">2309</a>, <a href="lwg-active.html#2334">2334</a>, <a href="lwg-active.html#2363">2363</a>, <a href="lwg-active.html#2379">2379</a>, <a href="lwg-active.html#2407">2407</a>, <a href="lwg-active.html#2412">2412</a>, <a href="lwg-active.html#2426">2426</a>, <a href="lwg-active.html#2442">2442</a>, <a href="lwg-active.html#2445">2445</a>.</li>
! <li>Changed the following issue to SG1 (from Open): <a href="lwg-active.html#2441">2441</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R91: 
! 2014-11-23 post-Urbana mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>259 open issues, up by 32.</li>
! <li>1722 closed issues, down by 20.</li>
! <li>1981 issues total, up by 12.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 12 New issues: <a href="lwg-active.html#2447">2447</a>, <a href="lwg-defects.html#2448">2448</a>, <a href="lwg-active.html#2449">2449</a>, <a href="lwg-active.html#2450">2450</a>, <a href="lwg-active.html#2451">2451</a>, <a href="lwg-active.html#2452">2452</a>, <a href="lwg-active.html#2453">2453</a>, <a href="lwg-defects.html#2454">2454</a>, <a href="lwg-defects.html#2455">2455</a>, <a href="lwg-active.html#2456">2456</a>, <a href="lwg-active.html#2457">2457</a>, <a href="lwg-defects.html#2458">2458</a>.</li>
! <li>Changed the following 2 issues to Ready (from Review): <a href="lwg-defects.html#2160">2160</a>, <a href="lwg-defects.html#2364">2364</a>.</li>
! <li>Changed the following 11 issues to Ready (from New): <a href="lwg-defects.html#2403">2403</a>, <a href="lwg-defects.html#2406">2406</a>, <a href="lwg-defects.html#2411">2411</a>, <a href="lwg-defects.html#2425">2425</a>, <a href="lwg-defects.html#2427">2427</a>, <a href="lwg-defects.html#2428">2428</a>, <a href="lwg-defects.html#2433">2433</a>, <a href="lwg-defects.html#2434">2434</a>, <a href="lwg-defects.html#2438">2438</a>, <a href="lwg-defects.html#2439">2439</a>, <a href="lwg-defects.html#2440">2440</a>.</li>
! <li>Changed the following issue to Ready (from Open): <a href="lwg-defects.html#2168">2168</a>.</li>
! <li>Changed the following issue to Review (from New): <a href="lwg-active.html#2424">2424</a>.</li>
! <li>Changed the following 5 issues to Open (from New): <a href="lwg-active.html#2307">2307</a>, <a href="lwg-active.html#2310">2310</a>, <a href="lwg-active.html#2383">2383</a>, <a href="lwg-active.html#2414">2414</a>, <a href="lwg-active.html#2441">2441</a>.</li>
! <li>Changed the following 2 issues to Open (from NAD Future): <a href="lwg-active.html#760">760</a>, <a href="lwg-active.html#1173">1173</a>.</li>
! <li>Changed the following 4 issues to LEWG (from New): <a href="lwg-active.html#2419">2419</a>, <a href="lwg-active.html#2430">2430</a>, <a href="lwg-active.html#2443">2443</a>, <a href="lwg-active.html#2446">2446</a>.</li>
! <li>Changed the following 48 issues to LEWG (from NAD Future): <a href="lwg-active.html#255">255</a>, <a href="lwg-active.html#423">423</a>, <a href="lwg-active.html#484">484</a>, <a href="lwg-active.html#523">523</a>, <a href="lwg-active.html#532">532</a>, <a href="lwg-active.html#708">708</a>, <a href="lwg-active.html#839">839</a>, <a href="lwg-active.html#851">851</a>, <a href="lwg-active.html#877">877</a>, <a href="lwg-active.html#933">933</a>, <a href="lwg-active.html#935">935</a>, <a href="lwg-active.html#936">936</a>, <a href="lwg-active.html#961">961</a>, <a href="lwg-active.html#1025">1025</a>, <a href="lwg-active.html#1031">1031</a>, <a href="lwg-active.html#1041">1041</a>, <a href="lwg-active.html#1052">1052</a>, <a href="lwg-active.html#1053">1053</a>, <a href="lwg-active.html#1112">1112</a>, <a href="lwg-active.html#1120">1120</a>, <a href="lwg-active.html#1121">1121</a>, <a href="lwg-active.html#1150">1150</a>, <a href="lwg-active.html#1154">1154</a>, <a href="lwg-active.html#1184">1184</a>, <a href="lwg-active.html#1188">1188</a>, <a href="lwg-active.html#1201">1201</a>, <a href="lwg-active.html#1203">1203</a>, <a href="lwg-active.html#1217">1217</a>, <a href="lwg-active.html#1235">1235</a>, <a href="lwg-active.html#1238">1238</a>, <a href="lwg-active.html#1242">1242</a>, <a href="lwg-active.html#1282">1282</a>, <a href="lwg-active.html#1289">1289</a>, <a href="lwg-active.html#1317">1317</a>, <a href="lwg-active.html#1320">1320</a>, <a href="lwg-active.html#1396">1396</a>, <a href="lwg-active.html#1406">1406</a>, <a href="lwg-active.html#1422">1422</a>, <a href="lwg-active.html#1459">1459</a>, <a href="lwg-active.html#1484">1484</a>, <a href="lwg-active.html#1488">1488</a>, <a href="lwg-active.html#1493">1493</a>, <a href="lwg-active.html#1499">1499</a>, <a href="lwg-active.html#1521">1521</a>, <a href="lwg-active.html#2040">2040</a>, <a href="lwg-active.html#2055">2055</a>, <a href="lwg-active.html#2226">2226</a>, <a href="lwg-active.html#2232">2232</a>.</li>
! <li>Changed the following 2 issues to Pending NAD (from Tentatively NAD): <a href="lwg-closed.html#2302">2302</a>, <a href="lwg-closed.html#2382">2382</a>.</li>
! <li>Changed the following 11 issues to WP (from Ready): <a href="lwg-defects.html#2016">2016</a>, <a href="lwg-defects.html#2170">2170</a>, <a href="lwg-defects.html#2340">2340</a>, <a href="lwg-defects.html#2354">2354</a>, <a href="lwg-defects.html#2377">2377</a>, <a href="lwg-defects.html#2396">2396</a>, <a href="lwg-defects.html#2399">2399</a>, <a href="lwg-defects.html#2400">2400</a>, <a href="lwg-defects.html#2401">2401</a>, <a href="lwg-defects.html#2404">2404</a>, <a href="lwg-defects.html#2408">2408</a>.</li>
! <li>Changed the following 12 issues to WP (from Tentatively Ready): <a href="lwg-defects.html#2106">2106</a>, <a href="lwg-defects.html#2129">2129</a>, <a href="lwg-defects.html#2212">2212</a>, <a href="lwg-defects.html#2217">2217</a>, <a href="lwg-defects.html#2230">2230</a>, <a href="lwg-defects.html#2233">2233</a>, <a href="lwg-defects.html#2266">2266</a>, <a href="lwg-defects.html#2325">2325</a>, <a href="lwg-defects.html#2361">2361</a>, <a href="lwg-defects.html#2365">2365</a>, <a href="lwg-defects.html#2376">2376</a>, <a href="lwg-defects.html#2387">2387</a>.</li>
! <li>Changed the following issue to Resolved (from Ready): <a href="lwg-defects.html#2319">2319</a>.</li>
! <li>Changed the following issue to Resolved (from Review): <a href="lwg-defects.html#2118">2118</a>.</li>
! <li>Changed the following issue to Resolved (from New): <a href="lwg-defects.html#2416">2416</a>.</li>
! <li>Changed the following issue to Resolved (from Open): <a href="lwg-defects.html#2108">2108</a>.</li>
! <li>Changed the following issue to NAD (from New): <a href="lwg-closed.html#2429">2429</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R90: 
! 2014-10-13 pre-Urbana mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>227 open issues, up by 31.</li>
! <li>1742 closed issues, up by 0.</li>
! <li>1969 issues total, up by 31.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 31 New issues: <a href="lwg-defects.html#2416">2416</a>, <a href="lwg-active.html#2417">2417</a>, <a href="lwg-defects.html#2418">2418</a>, <a href="lwg-active.html#2419">2419</a>, <a href="lwg-defects.html#2420">2420</a>, <a href="lwg-active.html#2421">2421</a>, <a href="lwg-active.html#2422">2422</a>, <a href="lwg-active.html#2423">2423</a>, <a href="lwg-active.html#2424">2424</a>, <a href="lwg-defects.html#2425">2425</a>, <a href="lwg-active.html#2426">2426</a>, <a href="lwg-defects.html#2427">2427</a>, <a href="lwg-defects.html#2428">2428</a>, <a href="lwg-closed.html#2429">2429</a>, <a href="lwg-active.html#2430">2430</a>, <a href="lwg-active.html#2431">2431</a>, <a href="lwg-active.html#2432">2432</a>, <a href="lwg-defects.html#2433">2433</a>, <a href="lwg-defects.html#2434">2434</a>, <a href="lwg-active.html#2435">2435</a>, <a href="lwg-active.html#2436">2436</a>, <a href="lwg-defects.html#2437">2437</a>, <a href="lwg-defects.html#2438">2438</a>, <a href="lwg-defects.html#2439">2439</a>, <a href="lwg-defects.html#2440">2440</a>, <a href="lwg-active.html#2441">2441</a>, <a href="lwg-defects.html#2442">2442</a>, <a href="lwg-active.html#2443">2443</a>, <a href="lwg-active.html#2444">2444</a>, <a href="lwg-active.html#2445">2445</a>, <a href="lwg-active.html#2446">2446</a>.</li>
! <li>No issues changed.</li>
  </ul></li>
  </ul>
  </li>
! <li>R89: 
! 2014-07-08 post-Rapperswil mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>196 open issues, up by 14.</li>
! <li>1742 closed issues, up by 12.</li>
! <li>1938 issues total, up by 26.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 6 Ready issues: <a href="lwg-defects.html#2396">2396</a>, <a href="lwg-defects.html#2399">2399</a>, <a href="lwg-defects.html#2400">2400</a>, <a href="lwg-defects.html#2401">2401</a>, <a href="lwg-defects.html#2404">2404</a>, <a href="lwg-defects.html#2408">2408</a>.</li>
! <li>Added the following 15 New issues: <a href="lwg-active.html#2391">2391</a>, <a href="lwg-active.html#2392">2392</a>, <a href="lwg-active.html#2393">2393</a>, <a href="lwg-active.html#2394">2394</a>, <a href="lwg-active.html#2398">2398</a>, <a href="lwg-active.html#2402">2402</a>, <a href="lwg-defects.html#2403">2403</a>, <a href="lwg-defects.html#2406">2406</a>, <a href="lwg-defects.html#2407">2407</a>, <a href="lwg-defects.html#2410">2410</a>, <a href="lwg-defects.html#2411">2411</a>, <a href="lwg-active.html#2412">2412</a>, <a href="lwg-active.html#2413">2413</a>, <a href="lwg-active.html#2414">2414</a>, <a href="lwg-defects.html#2415">2415</a>.</li>
! <li>Added the following Open issue: <a href="lwg-defects.html#2397">2397</a>.</li>
! <li>Added the following 3 WP issues: <a href="lwg-defects.html#2390">2390</a>, <a href="lwg-defects.html#2395">2395</a>, <a href="lwg-defects.html#2409">2409</a>.</li>
! <li>Added the following NAD issue: <a href="lwg-closed.html#2405">2405</a>.</li>
! <li>Changed the following issue to Ready (from New): <a href="lwg-defects.html#2377">2377</a>.</li>
! <li>Changed the following 2 issues to Ready (from Deferred): <a href="lwg-active.html#2253">2253</a>, <a href="lwg-active.html#2255">2255</a>.</li>
! <li>Changed the following 2 issues to Tentatively Ready (from New): <a href="lwg-defects.html#2325">2325</a>, <a href="lwg-defects.html#2387">2387</a>.</li>
! <li>Changed the following issue to Tentatively NAD (from New): <a href="lwg-closed.html#2382">2382</a>.</li>
! <li>Changed the following 3 issues to Review (from New): <a href="lwg-defects.html#2364">2364</a>, <a href="lwg-defects.html#2378">2378</a>, <a href="lwg-active.html#2380">2380</a>.</li>
! <li>Changed the following 2 issues to Review (from Open): <a href="lwg-defects.html#2118">2118</a>, <a href="lwg-defects.html#2160">2160</a>.</li>
! <li>Changed the following 3 issues to Open (from New): <a href="lwg-defects.html#2168">2168</a>, <a href="lwg-active.html#2238">2238</a>, <a href="lwg-active.html#2273">2273</a>.</li>
! <li>Changed the following 3 issues to Open (from Deferred): <a href="lwg-active.html#2254">2254</a>, <a href="lwg-active.html#2264">2264</a>, <a href="lwg-active.html#2277">2277</a>.</li>
! <li>Changed the following 3 issues to WP (from New): <a href="lwg-defects.html#2371">2371</a>, <a href="lwg-defects.html#2374">2374</a>, <a href="lwg-defects.html#2389">2389</a>.</li>
! <li>Changed the following 4 issues to Resolved (from Deferred): <a href="lwg-defects.html#2282">2282</a>, <a href="lwg-defects.html#2283">2283</a>, <a href="lwg-defects.html#2287">2287</a>, <a href="lwg-defects.html#2333">2333</a>.</li>
! <li>Changed the following issue to NAD (from Deferred): <a href="lwg-closed.html#2305">2305</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R88: 
! 2014-05-24 pre-Rapperswil mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>182 open issues, up by 29.</li>
! <li>1730 closed issues, up by 0.</li>
! <li>1912 issues total, up by 29.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 3 Tentatively Ready issues: <a href="lwg-defects.html#2361">2361</a>, <a href="lwg-defects.html#2365">2365</a>, <a href="lwg-defects.html#2376">2376</a>.</li>
! <li>Added the following 26 New issues: <a href="lwg-active.html#2362">2362</a>, <a href="lwg-active.html#2363">2363</a>, <a href="lwg-defects.html#2364">2364</a>, <a href="lwg-active.html#2366">2366</a>, <a href="lwg-active.html#2367">2367</a>, <a href="lwg-active.html#2368">2368</a>, <a href="lwg-defects.html#2369">2369</a>, <a href="lwg-active.html#2370">2370</a>, <a href="lwg-defects.html#2371">2371</a>, <a href="lwg-active.html#2372">2372</a>, <a href="lwg-closed.html#2373">2373</a>, <a href="lwg-defects.html#2374">2374</a>, <a href="lwg-active.html#2375">2375</a>, <a href="lwg-defects.html#2377">2377</a>, <a href="lwg-defects.html#2378">2378</a>, <a href="lwg-active.html#2379">2379</a>, <a href="lwg-active.html#2380">2380</a>, <a href="lwg-active.html#2381">2381</a>, <a href="lwg-closed.html#2382">2382</a>, <a href="lwg-active.html#2383">2383</a>, <a href="lwg-active.html#2384">2384</a>, <a href="lwg-active.html#2385">2385</a>, <a href="lwg-closed.html#2386">2386</a>, <a href="lwg-defects.html#2387">2387</a>, <a href="lwg-closed.html#2388">2388</a>, <a href="lwg-defects.html#2389">2389</a>.</li>
! <li>Changed the following 5 issues to Tentatively Ready (from Open): <a href="lwg-defects.html#2106">2106</a>, <a href="lwg-defects.html#2129">2129</a>, <a href="lwg-defects.html#2212">2212</a>, <a href="lwg-defects.html#2230">2230</a>, <a href="lwg-defects.html#2233">2233</a>.</li>
  </ul></li>
  </ul>
  </li>
  </ul>
  
  <h2>Closed Issues</h2>
  <hr>
  <h3><a name="2"></a>2. Auto_ptr conversions effects incorrect</h3>
! <p><b>Section:</b> X [auto.ptr.conv] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1997-12-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 1 in &quot;Effects&quot;, says &quot;Calls
! p-&gt;release()&quot; where it clearly must be &quot;Calls
! p.release()&quot;. (As it is, it seems to require using
  auto_ptr&lt;&gt;::operator-&gt; to refer to X::release, assuming that
  exists.)</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 20.10.4.3 [meta.unary.prop] paragraph 1 Effects from 
! &quot;Calls p-&gt;release()&quot; to &quot;Calls p.release()&quot;.</p>
  
  
  <p><b>Rationale:</b></p>
*************** exists.)</p>
*** 1128,1137 ****
  
  <hr>
  <h3><a name="4"></a>4. Basic_string size_type and difference_type should be implementation defined</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 1997-11-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Morristown we changed the size_type and difference_type typedefs
  for all the other containers to implementation defined with a
--- 235,245 ----
  
  <hr>
  <h3><a name="4"></a>4. Basic_string size_type and difference_type should be implementation defined</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 1997-11-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Morristown we changed the size_type and difference_type typedefs
  for all the other containers to implementation defined with a
*************** from implementation defined.</p>
*** 1152,1171 ****
  
  <hr>
  <h3><a name="6"></a>6. File position not an offset unimplementable</h3>
! <p><b>Section:</b> 27.5.3 [fpos] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1997-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fpos">issues</a> in [fpos].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Table 88, in I/O, is too strict; it's unimplementable on systems
  where a file position isn't just an offset. It also never says just
  what fpos&lt;&gt; is really supposed to be.  [Here's my summary, which
! Jerry agrees is more or less accurate. "I think I now know what
  the class really is, at this point: it's a magic cookie that
  encapsulates an mbstate_t and a file position (possibly represented as
  an fpos_t), it has syntactic support for pointer-like arithmetic, and
  implementors are required to have real, not just syntactic, support
! for arithmetic." This isn't standardese, of course.] </p>
  
  
  <p><b>Rationale:</b></p>
--- 260,279 ----
  
  <hr>
  <h3><a name="6"></a>6. File position not an offset unimplementable</h3>
! <p><b>Section:</b> 27.5.4 [fpos] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1997-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fpos">issues</a> in [fpos].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Table 88, in I/O, is too strict; it's unimplementable on systems
  where a file position isn't just an offset. It also never says just
  what fpos&lt;&gt; is really supposed to be.  [Here's my summary, which
! Jerry agrees is more or less accurate. &quot;I think I now know what
  the class really is, at this point: it's a magic cookie that
  encapsulates an mbstate_t and a file position (possibly represented as
  an fpos_t), it has syntactic support for pointer-like arithmetic, and
  implementors are required to have real, not just syntactic, support
! for arithmetic.&quot; This isn't standardese, of course.] </p>
  
  
  <p><b>Rationale:</b></p>
*************** and that the above summary is what the S
*** 1178,1195 ****
  
  <hr>
  <h3><a name="10"></a>10. Codecvt&lt;&gt;::do unclear</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-01-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#19">19</a></p>
  <p><b>Discussion:</b></p>
  <p>Section 22.2.1.5.2 says that codecvt&lt;&gt;::do_in and do_out
! should return the value noconv if "no conversion was
! needed". However, I don't see anything anywhere that defines what
  it means for a conversion to be needed or not needed. I can think of
  several circumstances where one might plausibly think that a
! conversion is not "needed", but I don't know which one is
  intended here. </p>
  
  
--- 286,303 ----
  
  <hr>
  <h3><a name="10"></a>10. Codecvt&lt;&gt;::do unclear</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-01-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#19">19</a></p>
  <p><b>Discussion:</b></p>
  <p>Section 22.2.1.5.2 says that codecvt&lt;&gt;::do_in and do_out
! should return the value noconv if &quot;no conversion was
! needed&quot;. However, I don't see anything anywhere that defines what
  it means for a conversion to be needed or not needed. I can think of
  several circumstances where one might plausibly think that a
! conversion is not &quot;needed&quot;, but I don't know which one is
  intended here. </p>
  
  
*************** intended here. </p>
*** 1202,1211 ****
  
  <hr>
  <h3><a name="12"></a>12. Way objects hold allocators unclear</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1998-02-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>I couldn't find a statement in the standard saying whether the allocator object held by
  a container is held as a copy of the constructor argument or whether a pointer of
--- 310,320 ----
  
  <hr>
  <h3><a name="12"></a>12. Way objects hold allocators unclear</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1998-02-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>I couldn't find a statement in the standard saying whether the allocator object held by
  a container is held as a copy of the constructor argument or whether a pointer of
*************** clear.&nbsp; See 23.2 [container.require
*** 1227,1237 ****
  
  <hr>
  <h3><a name="43"></a>43. Locale table correction</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Brendan Kehoe <b>Opened:</b> 1998-06-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#33">33</a></p>
  <p><b>Discussion:</b></p>
  
  
--- 336,346 ----
  
  <hr>
  <h3><a name="43"></a>43. Locale table correction</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Brendan Kehoe <b>Opened:</b> 1998-06-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#33">33</a></p>
  <p><b>Discussion:</b></p>
  
  
*************** clear.&nbsp; See 23.2 [container.require
*** 1244,1262 ****
  
  <hr>
  <h3><a name="45"></a>45. Stringstreams read/write pointers initial position unclear</h3>
! <p><b>Section:</b> 27.8.3 [ostringstream] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matthias Mueller <b>Opened:</b> 1998-05-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In a comp.lang.c++.moderated Matthias Mueller wrote:</p>
  
! <p>"We are not sure how to interpret the CD2 (see 27.3 [iostream.forward], 27.8.3.1 [ostringstream.cons], 27.8.1.1 [stringbuf.cons])
  with respect to the question as to what the correct initial positions
  of the write and&nbsp; read pointers of a stringstream should
! be."</p>
  
! <p>"Is it the same to output two strings or to initialize the stringstream with the
! first and to output the second?"</p>
  
  <p><i>[PJ Plauger, Bjarne Stroustrup, Randy Smithey, Sean Corfield, and
  Jerry Schwarz have all offered opinions; see reflector messages
--- 353,372 ----
  
  <hr>
  <h3><a name="45"></a>45. Stringstreams read/write pointers initial position unclear</h3>
! <p><b>Section:</b> 27.8.4 [ostringstream] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matthias Mueller <b>Opened:</b> 1998-05-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostringstream">issues</a> in [ostringstream].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In a comp.lang.c++.moderated Matthias Mueller wrote:</p>
  
! <p>&quot;We are not sure how to interpret the CD2 (see 27.3 [iostream.forward], 27.8.4.1 [ostringstream.cons], 27.8.2.1 [stringbuf.cons])
  with respect to the question as to what the correct initial positions
  of the write and&nbsp; read pointers of a stringstream should
! be.&quot;</p>
  
! <p>&quot;Is it the same to output two strings or to initialize the stringstream with the
! first and to output the second?&quot;</p>
  
  <p><i>[PJ Plauger, Bjarne Stroustrup, Randy Smithey, Sean Corfield, and
  Jerry Schwarz have all offered opinions; see reflector messages
*************** behavior is known to be different from s
*** 1277,1286 ****
  
  <hr>
  <h3><a name="58"></a>58. Extracting a char from a wide-oriented stream</h3>
! <p><b>Section:</b> 27.7.1.2.3 [istream::extractors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-07-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.6.1.2.3 has member functions for extraction of signed char and
  unsigned char, both singly and as strings. However, it doesn't say
--- 387,396 ----
  
  <hr>
  <h3><a name="58"></a>58. Extracting a char from a wide-oriented stream</h3>
! <p><b>Section:</b> 27.7.2.2.3 [istream::extractors] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.6.1.2.3 has member functions for extraction of signed char and
  unsigned char, both singly and as strings. However, it doesn't say
*************** this is the intent of the LWG.</p>
*** 1302,1311 ****
  
  <hr>
  <h3><a name="65"></a>65. Underspecification of strstreambuf::seekoff</h3>
! <p><b>Section:</b> D.9.1.3 [depr.strstreambuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#depr.strstreambuf.virtuals">issues</a> in [depr.strstreambuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard says how this member function affects the current
  stream position. (<tt>gptr</tt> or <tt>pptr</tt>) However, it does not
--- 412,421 ----
  
  <hr>
  <h3><a name="65"></a>65. Underspecification of strstreambuf::seekoff</h3>
! <p><b>Section:</b> D.7.1.3 [depr.strstreambuf.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.strstreambuf.virtuals">issues</a> in [depr.strstreambuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard says how this member function affects the current
  stream position. (<tt>gptr</tt> or <tt>pptr</tt>) However, it does not
*************** to invest effort in this deprecated feat
*** 1328,1343 ****
  
  <hr>
  <h3><a name="67"></a>67. Setw useless for strings</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-07-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#25">25</a></p>
  <p><b>Discussion:</b></p>
  <p>In a comp.std.c++ posting Michel Michaud wrote: What
  should be output by: </p>
  
! <pre>   string text("Hello");
     cout &lt;&lt; '[' &lt;&lt; setw(10) &lt;&lt; right &lt;&lt; text &lt;&lt; ']';
  </pre>
  
--- 438,453 ----
  
  <hr>
  <h3><a name="67"></a>67. Setw useless for strings</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-07-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#25">25</a></p>
  <p><b>Discussion:</b></p>
  <p>In a comp.std.c++ posting Michel Michaud wrote: What
  should be output by: </p>
  
! <pre>   string text(&quot;Hello&quot;);
     cout &lt;&lt; '[' &lt;&lt; setw(10) &lt;&lt; right &lt;&lt; text &lt;&lt; ']';
  </pre>
  
*************** parameters whatsoever.</p>
*** 1367,1381 ****
  
  <hr>
  <h3><a name="72"></a>72. Do_convert phantom member function</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#24">24</a></p>
  <p><b>Discussion:</b></p>
  <p>In 22.4.1.4 [locale.codecvt] par 3, and in 22.4.1.4.2 [locale.codecvt.virtuals] par 8, a nonexistent member function
! "do_convert" is mentioned. This member was replaced with
! "do_in" and "do_out", the proper referents in the
  contexts above.</p>
  
  
--- 477,491 ----
  
  <hr>
  <h3><a name="72"></a>72. Do_convert phantom member function</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#24">24</a></p>
  <p><b>Discussion:</b></p>
  <p>In 22.4.1.4 [locale.codecvt] par 3, and in 22.4.1.4.2 [locale.codecvt.virtuals] par 8, a nonexistent member function
! &quot;do_convert&quot; is mentioned. This member was replaced with
! &quot;do_in&quot; and &quot;do_out&quot;, the proper referents in the
  contexts above.</p>
  
  
*************** contexts above.</p>
*** 1387,1396 ****
  
  <hr>
  <h3><a name="73"></a>73. <tt>is_open</tt> should be const</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Classes <tt>basic_ifstream</tt>, <tt>basic_ofstream</tt>, and
  <tt>basic_fstream</tt> all have a member function <tt>is_open</tt>. It
--- 497,506 ----
  
  <hr>
  <h3><a name="73"></a>73. <tt>is_open</tt> should be const</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Classes <tt>basic_ifstream</tt>, <tt>basic_ofstream</tt>, and
  <tt>basic_fstream</tt> all have a member function <tt>is_open</tt>. It
*************** meaningless.</p>
*** 1407,1442 ****
  
  <hr>
  <h3><a name="77"></a>77. Valarray operator[] const returning value</h3>
! <p><b>Section:</b> 26.6.2.3 [valarray.access] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Levente Farkas <b>Opened:</b> 1998-09-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.access">issues</a> in [valarray.access].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#389">389</a></p>
  <p><b>Discussion:</b></p>
! <p>valarray:<br>
! <br>
! &nbsp;&nbsp;&nbsp; <tt>T operator[] (size_t) const;</tt><br>
! <br>
! why not <br>
! <br>
! &nbsp;&nbsp;&nbsp; <tt>const T&amp; operator[] (size_t) const;</tt><br>
! <br>
! as in vector ???<br>
! <br>
! One can't copy even from a const valarray eg:<br>
! <br>
! &nbsp;&nbsp;&nbsp; <tt>memcpy(ptr, &amp;v[0], v.size() * sizeof(double));<br>
! </tt><br>
  [I] find this bug in valarray is very difficult.</p>
  
  
  <p><b>Rationale:</b></p>
  <p>The LWG believes that the interface was deliberately designed that
  way. That is what valarray was designed to do; that's where the
! "value array" name comes from. LWG members further comment
! that "we don't want valarray to be a full STL container."
! 26.6.2.3 [valarray.access] specifies properties that indicate "an
! absence of aliasing" for non-constant arrays; this allows
  optimizations, including special hardware optimizations, that are not
  otherwise possible. </p>
  
--- 517,552 ----
  
  <hr>
  <h3><a name="77"></a>77. Valarray operator[] const returning value</h3>
! <p><b>Section:</b> 26.6.2.4 [valarray.access] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Levente Farkas <b>Opened:</b> 1998-09-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.access">issues</a> in [valarray.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#389">389</a></p>
  <p><b>Discussion:</b></p>
! <p>valarray:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp; <tt>T operator[] (size_t) const;</tt><br/>
! <br/>
! why not <br/>
! <br/>
! &nbsp;&nbsp;&nbsp; <tt>const T&amp; operator[] (size_t) const;</tt><br/>
! <br/>
! as in vector ???<br/>
! <br/>
! One can't copy even from a const valarray eg:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp; <tt>memcpy(ptr, &amp;v[0], v.size() * sizeof(double));<br/>
! </tt><br/>
  [I] find this bug in valarray is very difficult.</p>
  
  
  <p><b>Rationale:</b></p>
  <p>The LWG believes that the interface was deliberately designed that
  way. That is what valarray was designed to do; that's where the
! &quot;value array&quot; name comes from. LWG members further comment
! that &quot;we don't want valarray to be a full STL container.&quot;
! 26.6.2.4 [valarray.access] specifies properties that indicate &quot;an
! absence of aliasing&quot; for non-constant arrays; this allows
  optimizations, including special hardware optimizations, that are not
  otherwise possible. </p>
  
*************** otherwise possible. </p>
*** 1446,1455 ****
  
  <hr>
  <h3><a name="81"></a>81. Wrong declaration of slice operations</h3>
! <p><b>Section:</b> 26.6.5 [template.slice.array], 26.6.7 [template.gslice.array], 26.6.8 [template.mask.array], 26.6.9 [template.indirect.array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.slice.array">issues</a> in [template.slice.array].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Isn't the definition of copy constructor and assignment operators wrong?
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Instead of</p>
--- 556,565 ----
  
  <hr>
  <h3><a name="81"></a>81. Wrong declaration of slice operations</h3>
! <p><b>Section:</b> 26.6.5 [template.slice.array], 26.6.7 [template.gslice.array], 26.6.8 [template.mask.array], 26.6.9 [template.indirect.array] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.slice.array">issues</a> in [template.slice.array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Isn't the definition of copy constructor and assignment operators wrong?
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Instead of</p>
*************** otherwise possible. </p>
*** 1473,1483 ****
  
  <hr>
  <h3><a name="82"></a>82. Missing constant for set elements</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 5 specifies:</p>
  
--- 583,593 ----
  
  <hr>
  <h3><a name="82"></a>82. Missing constant for set elements</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 5 specifies:</p>
  
*************** the value type is the same as the <b>con
*** 1493,1499 ****
  <p><b>Rationale:</b></p>
  <p>Not a defect. The Standard is correct as written; it uses a
  different mechanism (const &amp;) for <tt>set</tt> and
! <tt>multiset</tt>. See issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> for a related
  issue.</p>
  
  
--- 603,609 ----
  <p><b>Rationale:</b></p>
  <p>Not a defect. The Standard is correct as written; it uses a
  different mechanism (const &amp;) for <tt>set</tt> and
! <tt>multiset</tt>. See issue <a href="lwg-defects.html#103">103</a> for a related
  issue.</p>
  
  
*************** issue.</p>
*** 1501,1509 ****
  
  <hr>
  <h3><a name="84"></a>84. Ambiguity with string::insert()</h3>
! <p><b>Section:</b> 21.4.5 [string.access] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>If I try</p>
  <pre>    s.insert(0,1,' ');</pre>
--- 611,620 ----
  
  <hr>
  <h3><a name="84"></a>84. Ambiguity with string::insert()</h3>
! <p><b>Section:</b> 21.4.5 [string.access] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.access">issues</a> in [string.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>If I try</p>
  <pre>    s.insert(0,1,' ');</pre>
*************** issue.</p>
*** 1518,1531 ****
  <pre>    s.insert((char*)0, (InputIterator)1, (InputIterator)' ')</pre>
  
  <p>which normally inserts characters from iterator 1 to iterator '
! '. But according to 23.1.1.9 (the "do the right thing" fix)
  it is equivalent to the second. However, it is still ambiguous,
  because of course I mean the first!</p>
  
  
  <p><b>Rationale:</b></p>
! <p>Not a defect. The LWG believes this is a "genetic
! misfortune" inherent in the design of string and thus not a
  defect in the Standard as such .</p>
  
  
--- 629,642 ----
  <pre>    s.insert((char*)0, (InputIterator)1, (InputIterator)' ')</pre>
  
  <p>which normally inserts characters from iterator 1 to iterator '
! '. But according to 23.1.1.9 (the &quot;do the right thing&quot; fix)
  it is equivalent to the second. However, it is still ambiguous,
  because of course I mean the first!</p>
  
  
  <p><b>Rationale:</b></p>
! <p>Not a defect. The LWG believes this is a &quot;genetic
! misfortune&quot; inherent in the design of string and thus not a
  defect in the Standard as such .</p>
  
  
*************** defect in the Standard as such .</p>
*** 1533,1542 ****
  
  <hr>
  <h3><a name="85"></a>85. String char types</h3>
! <p><b>Section:</b> 21 [strings] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#strings">issues</a> in [strings].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard seems not to require that charT is equivalent to
  traits::char_type. So, what happens if charT is not equivalent to
--- 644,653 ----
  
  <hr>
  <h3><a name="85"></a>85. String char types</h3>
! <p><b>Section:</b> 21 [strings] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#strings">issues</a> in [strings].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard seems not to require that charT is equivalent to
  traits::char_type. So, what happens if charT is not equivalent to
*************** requires them to be the same.</p>
*** 1552,1566 ****
  
  <hr>
  <h3><a name="87"></a>87. Error in description of string::compare()</h3>
! <p><b>Section:</b> 21.4.6.8 [string::swap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::swap">issues</a> in [string::swap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#5">5</a></p>
  <p><b>Discussion:</b></p>
  <p>The following compare() description is obviously a bug:</p>
  
! <pre>int compare(size_type pos, size_type n1, 
              charT *s, size_type n2 = npos) const;
  </pre>
  
--- 663,678 ----
  
  <hr>
  <h3><a name="87"></a>87. Error in description of string::compare()</h3>
! <p><b>Section:</b> 21.4.6.8 [string::swap] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::swap">issues</a> in [string::swap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#5">5</a></p>
  <p><b>Discussion:</b></p>
  <p>The following compare() description is obviously a bug:</p>
  
! <pre>
! int compare(size_type pos, size_type n1, 
              charT *s, size_type n2 = npos) const;
  </pre>
  
*************** exception) </p>
*** 1577,1586 ****
  
  <hr>
  <h3><a name="88"></a>88. Inconsistency between string::insert() and string::append()</h3>
! <p><b>Section:</b> 21.4.6.4 [string::insert], 21.4.6.2 [string::append] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::insert">issues</a> in [string::insert].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Why does </p>
  <pre>  template&lt;class InputIterator&gt; 
--- 689,698 ----
  
  <hr>
  <h3><a name="88"></a>88. Inconsistency between string::insert() and string::append()</h3>
! <p><b>Section:</b> 21.4.6.4 [string::insert], 21.4.6.2 [string::append] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::insert">issues</a> in [string::insert].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Why does </p>
  <pre>  template&lt;class InputIterator&gt; 
*************** serious to constitute a defect.</p>
*** 1602,1612 ****
  
  <hr>
  <h3><a name="89"></a>89. Missing throw specification for string::insert() and string::replace()</h3>
! <p><b>Section:</b> 21.4.6.4 [string::insert], 21.4.6.6 [string::replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::insert">issues</a> in [string::insert].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#83">83</a></p>
  <p><b>Discussion:</b></p>
  <p>All insert() and replace() members for strings with an iterator as
  first argument lack a throw specification. The throw
--- 714,724 ----
  
  <hr>
  <h3><a name="89"></a>89. Missing throw specification for string::insert() and string::replace()</h3>
! <p><b>Section:</b> 21.4.6.4 [string::insert], 21.4.6.6 [string::replace] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::insert">issues</a> in [string::insert].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#83">83</a></p>
  <p><b>Discussion:</b></p>
  <p>All insert() and replace() members for strings with an iterator as
  first argument lack a throw specification. The throw
*************** maximum. </p>
*** 1616,1622 ****
  
  <p><b>Rationale:</b></p>
  <p>Considered a duplicate because it will be solved by the resolution
! of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#83">83</a>.</p>
  
  
  
--- 728,734 ----
  
  <p><b>Rationale:</b></p>
  <p>Considered a duplicate because it will be solved by the resolution
! of issue <a href="lwg-defects.html#83">83</a>.</p>
  
  
  
*************** of issue <a href="http://www.open-std.or
*** 1624,1633 ****
  
  <hr>
  <h3><a name="93"></a>93. Incomplete Valarray Subset Definitions</h3>
! <p><b>Section:</b> 26.6 [numarray] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numarray">issues</a> in [numarray].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>You can easily create subsets, but you can't easily combine them
  with other subsets.  Unfortunately, you almost always needs an
--- 736,745 ----
  
  <hr>
  <h3><a name="93"></a>93. Incomplete Valarray Subset Definitions</h3>
! <p><b>Section:</b> 26.6 [numarray] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numarray">issues</a> in [numarray].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>You can easily create subsets, but you can't easily combine them
  with other subsets.  Unfortunately, you almost always needs an
*************** creates a temporary objects, which could
*** 1661,1669 ****
  
  <hr>
  <h3><a name="94"></a>94. May library implementors add template parameters to Standard Library classes?</h3>
! <p><b>Section:</b> 17.6.4 [conforming] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-01-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Is it a permitted extension for library implementors to add template parameters to
  standard library classes, provided that those extra parameters have defaults? For example,
--- 773,782 ----
  
  <hr>
  <h3><a name="94"></a>94. May library implementors add template parameters to Standard Library classes?</h3>
! <p><b>Section:</b> 17.6.5 [conforming] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-01-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#conforming">issues</a> in [conforming].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Is it a permitted extension for library implementors to add template parameters to
  standard library classes, provided that those extra parameters have defaults? For example,
*************** may be provided by a non-Standard implem
*** 1706,1712 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add a new subclause [presumably 17.4.4.9] following 17.6.4.12 [res.on.exception.handling]:</p>
  
  <blockquote>
    <p>17.4.4.9 Template Parameters</p> <p>A specialization of a
--- 819,825 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add a new subclause [presumably 17.4.4.9] following 17.6.5.12 [res.on.exception.handling]:</p>
  
  <blockquote>
    <p>17.4.4.9 Template Parameters</p> <p>A specialization of a
*************** may be provided by a non-Standard implem
*** 1716,1729 ****
    default values are thus permitted.</p>
  </blockquote>
  
! <p>Add "template parameters" to the list of subclauses at
! the end of 17.6.4 [conforming] paragraph 1.</p>
  
  <p><i>[Kona: The LWG agreed the standard needs clarification. After
  discussion with John Spicer, it seems added template parameters can be
  detected by a program using template-template parameters. A straw vote
! - "should implementors be allowed to add template
! parameters?" found no consensus ; 5 - yes, 7 - no.]</i></p>
  
  
  
--- 829,842 ----
    default values are thus permitted.</p>
  </blockquote>
  
! <p>Add &quot;template parameters&quot; to the list of subclauses at
! the end of 17.6.5 [conforming] paragraph 1.</p>
  
  <p><i>[Kona: The LWG agreed the standard needs clarification. After
  discussion with John Spicer, it seems added template parameters can be
  detected by a program using template-template parameters. A straw vote
! - &quot;should implementors be allowed to add template
! parameters?&quot; found no consensus ; 5 - yes, 7 - no.]</i></p>
  
  
  
*************** parameters?" found no consensus ; 5 - ye
*** 1732,1738 ****
  <p>
  There is no ambiguity; the standard is clear as written.  Library
  implementors are not permitted to add template parameters to standard
! library classes.  This does not fall under the "as if" rule,
  so it would be permitted only if the standard gave explicit license
  for implementors to do this.  This would require a change in the 
  standard.
--- 845,851 ----
  <p>
  There is no ambiguity; the standard is clear as written.  Library
  implementors are not permitted to add template parameters to standard
! library classes.  This does not fall under the &quot;as if&quot; rule,
  so it would be permitted only if the standard gave explicit license
  for implementors to do this.  This would require a change in the 
  standard.
*************** of standard library class templates.
*** 1750,1758 ****
  
  <hr>
  <h3><a name="95"></a>95. Members added by the implementation</h3>
! <p><b>Section:</b> 17.6.4.5 [member.functions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 17.3.4.4/2 vs 17.3.4.7/0 there is a hole; an implementation could add virtual
  members a base class and break user derived classes.</p>
--- 863,872 ----
  
  <hr>
  <h3><a name="95"></a>95. Members added by the implementation</h3>
! <p><b>Section:</b> 17.6.5.5 [member.functions] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#member.functions">issues</a> in [member.functions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 17.3.4.4/2 vs 17.3.4.7/0 there is a hole; an implementation could add virtual
  members a base class and break user derived classes.</p>
*************** class vector_checking : public vector
*** 1782,1798 ****
  
  <p><b>Rationale:</b></p>
  <p>This is not a defect in the Standard.&nbsp; The example is already
! illegal.&nbsp; See 17.6.4.5 [member.functions] paragraph 2.</p>
  
  
  
  
  <hr>
  <h3><a name="96"></a>96. Vector&lt;bool&gt; is not a container</h3>
! <p><b>Section:</b> 23.4.1 [vector] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><tt>vector&lt;bool&gt;</tt> is not a container as its reference and
  pointer types are not references and pointers. </p>
--- 896,912 ----
  
  <p><b>Rationale:</b></p>
  <p>This is not a defect in the Standard.&nbsp; The example is already
! illegal.&nbsp; See 17.6.5.5 [member.functions] paragraph 2.</p>
  
  
  
  
  <hr>
  <h3><a name="96"></a>96. Vector&lt;bool&gt; is not a container</h3>
! <p><b>Section:</b> 23.3.6 [vector] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><tt>vector&lt;bool&gt;</tt> is not a container as its reference and
  pointer types are not references and pointers. </p>
*************** or not the optimization requirements con
*** 1812,1829 ****
  
  
  <p><i>[The LWG looked at the following resolutions in some detail:
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp; * Not A Defect.<br>
  &nbsp;&nbsp;&nbsp;&nbsp; * Add a note explaining that vector&lt;bool&gt; does not meet
! Container requirements.<br>
! &nbsp;&nbsp;&nbsp;&nbsp; * Remove vector&lt;bool&gt;.<br>
  &nbsp;&nbsp;&nbsp;&nbsp; * Add a new category of container requirements which
! vector&lt;bool&gt; would meet.<br>
! &nbsp;&nbsp;&nbsp;&nbsp; * Rename vector&lt;bool&gt;.<br>
! <br>
  No alternative had strong, wide-spread, support and every alternative
! had at least one "over my dead body" response.<br>
! <br>
  There was also mention of a transition scheme something like (1) add
  vector_bool and deprecate vector&lt;bool&gt; in the next standard. (2)
  Remove vector&lt;bool&gt; in the following standard.]</i></p>
--- 926,943 ----
  
  
  <p><i>[The LWG looked at the following resolutions in some detail:
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp; * Not A Defect.<br/>
  &nbsp;&nbsp;&nbsp;&nbsp; * Add a note explaining that vector&lt;bool&gt; does not meet
! Container requirements.<br/>
! &nbsp;&nbsp;&nbsp;&nbsp; * Remove vector&lt;bool&gt;.<br/>
  &nbsp;&nbsp;&nbsp;&nbsp; * Add a new category of container requirements which
! vector&lt;bool&gt; would meet.<br/>
! &nbsp;&nbsp;&nbsp;&nbsp; * Rename vector&lt;bool&gt;.<br/>
! <br/>
  No alternative had strong, wide-spread, support and every alternative
! had at least one &quot;over my dead body&quot; response.<br/>
! <br/>
  There was also mention of a transition scheme something like (1) add
  vector_bool and deprecate vector&lt;bool&gt; in the next standard. (2)
  Remove vector&lt;bool&gt; in the following standard.]</i></p>
*************** allocator.]</i></p>
*** 1840,1846 ****
  
  
  <p><i>[Kona: Herb Sutter presented his paper J16/99-0035==WG21/N1211,
! vector&lt;bool&gt;: More Problems, Better Solutions. Much discussion
  of a two step approach: a) deprecate, b) provide replacement under a
  new name.  LWG straw vote on that: 1-favor, 11-could live with, 2-over
  my dead body.  This resolution was mentioned in the LWG report to the
--- 954,960 ----
  
  
  <p><i>[Kona: Herb Sutter presented his paper J16/99-0035==WG21/N1211,
! <tt>vector&lt;bool&gt;</tt>: More Problems, Better Solutions. Much discussion
  of a two step approach: a) deprecate, b) provide replacement under a
  new name.  LWG straw vote on that: 1-favor, 11-could live with, 2-over
  my dead body.  This resolution was mentioned in the LWG report to the
*************** over-my-dead-body positions.]</i></p>
*** 1849,1876 ****
  
  
  <p>Discussed at Lillehammer.  General agreement that we should
!   deprecate vector&lt;bool&gt; and introduce this functionality under
!   a different name, e.g. bit_vector.  This might make it possible to
!   remove the vector&lt;bool&gt; specialization in the standard that comes
    after C++0x. There was also a suggestion that
    in C++0x we could additional say that it's implementation defined
!   whether vector&lt;bool&gt; refers to the specialization or to the
    primary template, but there wasn't general agreement that this was a
    good idea.</p>
  
! <p>We need a paper for the new bit_vector class.</p>
  
  <p><i>[
  Batavia:
  ]</i></p>
  
! <blockquote>
  The LWG feels we need something closer to SGI's <tt>bitvector</tt> to ease migration
  from <tt>vector&lt;bool&gt;</tt>.  Although some of the funcitonality from
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2050.pdf">N2050</a>
  could well be used in such a template.  The concern is easing the API migration for those
  users who want to continue using a bit-packed container.  Alan and Beman to work.
! </blockquote>
  
  <p><i>[
  Post Summit Alisdair adds:
--- 963,990 ----
  
  
  <p>Discussed at Lillehammer.  General agreement that we should
!   deprecate <tt>vector&lt;bool&gt;</tt> and introduce this functionality under
!   a different name, e.g. <tt>bit_vector</tt>.  This might make it possible to
!   remove the <tt>vector&lt;bool&gt;</tt> specialization in the standard that comes
    after C++0x. There was also a suggestion that
    in C++0x we could additional say that it's implementation defined
!   whether <tt>vector&lt;bool&gt;</tt> refers to the specialization or to the
    primary template, but there wasn't general agreement that this was a
    good idea.</p>
  
! <p>We need a paper for the new <tt>bit_vector</tt> class.</p>
  
  <p><i>[
  Batavia:
  ]</i></p>
  
! <blockquote><p>
  The LWG feels we need something closer to SGI's <tt>bitvector</tt> to ease migration
  from <tt>vector&lt;bool&gt;</tt>.  Although some of the funcitonality from
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2050.pdf">N2050</a>
  could well be used in such a template.  The concern is easing the API migration for those
  users who want to continue using a bit-packed container.  Alan and Beman to work.
! </p></blockquote>
  
  <p><i>[
  Post Summit Alisdair adds:
*************** This is a clear extension request that m
*** 1910,1920 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We note that most of this issue has become moot over time,
  and agree with Alisdair's recommendations.
  Move to NAD Future for reconsideration of part (ii).
! </blockquote>
  
  <p><i>[
  2009-07-29 Alisdair reopens:
--- 1024,1034 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We note that most of this issue has become moot over time,
  and agree with Alisdair's recommendations.
  Move to NAD Future for reconsideration of part (ii).
! </p></blockquote>
  
  <p><i>[
  2009-07-29 Alisdair reopens:
*************** to allow us to close this issue as NAD.
*** 1932,1938 ****
  </p>
  
  <p>
! I recommend we spawn a separate issue (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1184">1184</a>) requesting a dynamic length bitset
  and pre-emptively file it as NAD Future.  It is difficult to resolve #96
  when it effectively contains two separate sub-issues.
  </p>
--- 1046,1052 ----
  </p>
  
  <p>
! I recommend we spawn a separate issue (<a href="lwg-active.html#1184">1184</a>) requesting a dynamic length bitset
  and pre-emptively file it as NAD Future.  It is difficult to resolve #96
  when it effectively contains two separate sub-issues.
  </p>
*************** when it effectively contains two separat
*** 1943,1951 ****
  ]</i></p>
  
  
! <blockquote>
  Mark as NAD, and give rationale.
! </blockquote>
  
  
  
--- 1057,1065 ----
  ]</i></p>
  
  
! <blockquote><p>
  Mark as NAD, and give rationale.
! </p></blockquote>
  
  
  
*************** tractable. Therefore we are closing.
*** 1979,1988 ****
  
  <hr>
  <h3><a name="97"></a>97. Insert inconsistent definition</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><tt>insert(iterator, const value_type&amp;)</tt> is defined both on
  sequences and on set, with unrelated semantics: insert here (in
--- 1093,1103 ----
  
  <hr>
  <h3><a name="97"></a>97. Insert inconsistent definition</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#containers">active issues</a> in [containers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><tt>insert(iterator, const value_type&amp;)</tt> is defined both on
  sequences and on set, with unrelated semantics: insert here (in
*************** the design, for better or for worse.</p>
*** 1999,2007 ****
  
  <hr>
  <h3><a name="99"></a>99. Reverse_iterator comparisons completely wrong</h3>
! <p><b>Section:</b> 24.5.1.3.13 [reverse.iter.op==] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The &lt;, &gt;, &lt;=, &gt;= comparison operator are wrong: they
  return the opposite of what they should.</p>
--- 1114,1122 ----
  
  <hr>
  <h3><a name="99"></a>99. Reverse_iterator comparisons completely wrong</h3>
! <p><b>Section:</b> 24.5.1.3.13 [reverse.iter.op==] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The &lt;, &gt;, &lt;=, &gt;= comparison operator are wrong: they
  return the opposite of what they should.</p>
*************** exactly what the Standard says.</p>
*** 2021,2030 ****
  
  <hr>
  <h3><a name="100"></a>100. Insert iterators/ostream_iterators overconstrained</h3>
! <p><b>Section:</b> 24.5.2 [insert.iterators], 24.6.4 [ostreambuf.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#insert.iterators">issues</a> in [insert.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Overspecified For an insert iterator it, the expression *it is
  required to return a reference to it. This is a simple possible
--- 1136,1145 ----
  
  <hr>
  <h3><a name="100"></a>100. Insert iterators/ostream_iterators overconstrained</h3>
! <p><b>Section:</b> 24.5.2 [insert.iterators], 24.6.4 [ostreambuf.iterator] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#insert.iterators">issues</a> in [insert.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Overspecified For an insert iterator it, the expression *it is
  required to return a reference to it. This is a simple possible
*************** incorrect code to work, rather than the
*** 2043,2052 ****
  
  <hr>
  <h3><a name="101"></a>101. No way to free storage for vector and deque</h3>
! <p><b>Section:</b> 23.4.1 [vector], 23.3.1 [array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Reserve can not free storage, unlike string::reserve</p>
  
--- 1158,1167 ----
  
  <hr>
  <h3><a name="101"></a>101. No way to free storage for vector and deque</h3>
! <p><b>Section:</b> 23.3.6 [vector], 23.3.2 [array] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Reserve can not free storage, unlike string::reserve</p>
  
*************** incorrect code to work, rather than the
*** 2057,2063 ****
  
  <blockquote>
  <p>
! This issue has been revisited and addressed (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#850">850</a>). This issues should be reclassified to NAD Editorial to reflect
  this action.
  </p>
  </blockquote>
--- 1172,1178 ----
  
  <blockquote>
  <p>
! This issue has been revisited and addressed (<a href="lwg-defects.html#755">755</a>, <a href="lwg-defects.html#850">850</a>). This issues should be reclassified to NAD Editorial to reflect
  this action.
  </p>
  </blockquote>
*************** expressed in a single line of code (wher
*** 2082,2093 ****
  
  <hr>
  <h3><a name="102"></a>102. Bug in insert range in associative containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a></p>
  <p><b>Discussion:</b></p>
  <p>Table 69 of Containers say that a.insert(i,j) is linear if [i, j) is ordered. It seems
  impossible to implement, as it means that if [i, j) = [x], insert in an associative
--- 1197,1208 ----
  
  <hr>
  <h3><a name="102"></a>102. Bug in insert range in associative containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#264">264</a></p>
  <p><b>Discussion:</b></p>
  <p>Table 69 of Containers say that a.insert(i,j) is linear if [i, j) is ordered. It seems
  impossible to implement, as it means that if [i, j) = [x], insert in an associative
*************** container is O(1)!</p>
*** 2099,2105 ****
  
  
  <p><b>Rationale:</b></p>
! <p>Subsumed by issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a>.</p>
  
  
  
--- 1214,1220 ----
  
  
  <p><b>Rationale:</b></p>
! <p>Subsumed by issue <a href="lwg-defects.html#264">264</a>.</p>
  
  
  
*************** container is O(1)!</p>
*** 2107,2116 ****
  
  <hr>
  <h3><a name="104"></a>104. Description of basic_string::operator[] is unclear</h3>
! <p><b>Section:</b> 21.4.4 [string.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.capacity">issues</a> in [string.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It is not clear that undefined behavior applies when pos == size ()
  for the non const version.</p>
--- 1222,1231 ----
  
  <hr>
  <h3><a name="104"></a>104. Description of basic_string::operator[] is unclear</h3>
! <p><b>Section:</b> 21.4.4 [string.capacity] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.capacity">issues</a> in [string.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It is not clear that undefined behavior applies when pos == size ()
  for the non const version.</p>
*************** the Standard.</p>
*** 2130,2143 ****
  
  <hr>
  <h3><a name="105"></a>105. fstream ctors argument types desired</h3>
! <p><b>Section:</b> 27.9 [file.streams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#454">454</a></p>
  <p><b>Discussion:</b></p>
  
  
! <p>fstream ctors take a const char* instead of string.<br>
  fstream ctors can't take wchar_t</p>
  
  <p>An extension to add a const wchar_t* to fstream would make the
--- 1245,1258 ----
  
  <hr>
  <h3><a name="105"></a>105. fstream ctors argument types desired</h3>
! <p><b>Section:</b> 27.9 [file.streams] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#454">454</a></p>
  <p><b>Discussion:</b></p>
  
  
! <p>fstream ctors take a const char* instead of string.<br/>
  fstream ctors can't take wchar_t</p>
  
  <p>An extension to add a const wchar_t* to fstream would make the
*************** interesting extension for the next Stand
*** 2153,2162 ****
  
  <hr>
  <h3><a name="107"></a>107. Valarray constructor is strange</h3>
! <p><b>Section:</b> 26.6.2 [template.valarray] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.valarray">issues</a> in [template.valarray].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The order of the arguments is (elem, size) instead of the normal
  (size, elem) in the rest of the library. Since elem often has an
--- 1268,1277 ----
  
  <hr>
  <h3><a name="107"></a>107. Valarray constructor is strange</h3>
! <p><b>Section:</b> 26.6.2 [template.valarray] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.valarray">issues</a> in [template.valarray].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The order of the arguments is (elem, size) instead of the normal
  (size, elem) in the rest of the library. Since elem often has an
*************** perhaps other cases.</p>
*** 2182,2203 ****
  
  
  <hr>
! <h3><a name="111"></a>111. istreambuf_iterator::equal overspecified, inefficient</h3>
! <p><b>Section:</b> 24.6.3.5 [istreambuf.iterator::equal] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-10-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istreambuf.iterator::equal">issues</a> in [istreambuf.iterator::equal].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The member istreambuf_iterator&lt;&gt;::equal is specified to be
  unnecessarily inefficient. While this does not affect the efficiency
  of conforming implementations of iostreams, because they can
! "reach into" the iterators and bypass this function, it does
! affect users who use istreambuf_iterators. </p>
  
  <p>The inefficiency results from a too-scrupulous definition, which
! requires a "true" result if neither iterator is at eof. In
  practice these iterators can only usefully be compared with the
! "eof" value, so the extra test implied provides no benefit,
  but slows down users' code. </p>
  
  <p>The solution is to weaken the requirement on the function to return
--- 1297,1318 ----
  
  
  <hr>
! <h3><a name="111"></a>111. <tt>istreambuf_iterator::equal</tt> overspecified, inefficient</h3>
! <p><b>Section:</b> 24.6.3.5 [istreambuf.iterator::equal] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-10-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istreambuf.iterator::equal">issues</a> in [istreambuf.iterator::equal].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The member <tt>istreambuf_iterator&lt;&gt;::equal</tt> is specified to be
  unnecessarily inefficient. While this does not affect the efficiency
  of conforming implementations of iostreams, because they can
! &quot;reach into&quot; the iterators and bypass this function, it does
! affect users who use <tt>istreambuf_iterators</tt>. </p>
  
  <p>The inefficiency results from a too-scrupulous definition, which
! requires a &quot;true&quot; result if neither iterator is at eof. In
  practice these iterators can only usefully be compared with the
! &quot;eof&quot; value, so the extra test implied provides no benefit,
  but slows down users' code. </p>
  
  <p>The solution is to weaken the requirement on the function to return
*************** Summit:
*** 2208,2216 ****
  ]</i></p>
  
  
! <blockquote>
  Reopened by Alisdair.
! </blockquote>
  
  <p><i>[
  Post Summit Daniel adds:
--- 1323,1331 ----
  ]</i></p>
  
  
! <blockquote><p>
  Reopened by Alisdair.
! </p></blockquote>
  
  <p><i>[
  Post Summit Daniel adds:
*************** and more specifically it would violate t
*** 2225,2272 ****
  24.2.3 [input.iterators]/7:
  </p>
  
! <blockquote>
  If two iterators <tt>a</tt> and <tt>b</tt> of the same type are equal, then either <tt>a</tt>
! and <tt>b</tt> are both
! dereferenceable or else neither is dereferenceable.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Agree NAD.
! </blockquote>
  
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace 24.6.3.5 [istreambuf.iterator::equal],
! paragraph 1, </p>
  
  <blockquote>
!   <p>-1- Returns: true if and only if both iterators are at end-of-stream, or neither is at
    end-of-stream, regardless of what streambuf object they use. </p>
  </blockquote>
  
  <p>with</p>
  
  <blockquote>
!   <p>-1- Returns: true if and only if both iterators are at
    end-of-stream, regardless of what streambuf object they use. </p>
  </blockquote>
  
  
  
  <p><b>Rationale:</b></p>
! <p>It is not clear that this is a genuine defect.  Additionally, the
  LWG was reluctant to make a change that would result in 
! operator== not being a equivalence relation.  One consequence of
! this change is that an algorithm that's passed the range [i, i)
  would no longer treat it as an empty range.</p>
  
  
--- 1340,1385 ----
  24.2.3 [input.iterators]/7:
  </p>
  
! <blockquote><p>
  If two iterators <tt>a</tt> and <tt>b</tt> of the same type are equal, then either <tt>a</tt>
! and <tt>b</tt> are both dereferenceable or else neither is dereferenceable.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Agree NAD.
! </p></blockquote>
  
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace 24.6.3.5 [istreambuf.iterator::equal], paragraph 1, </p>
  
  <blockquote>
!   <p>-1- <i>Returns</i>: true if and only if both iterators are at end-of-stream, or neither is at
    end-of-stream, regardless of what streambuf object they use. </p>
  </blockquote>
  
  <p>with</p>
  
  <blockquote>
!   <p>-1- <i>Returns</i>: true if and only if both iterators are at
    end-of-stream, regardless of what streambuf object they use. </p>
  </blockquote>
  
  
  
  <p><b>Rationale:</b></p>
! <p>It is not clear that this is a genuine defect. Additionally, the
  LWG was reluctant to make a change that would result in 
! <tt>operator==</tt> not being a equivalence relation. One consequence of
! this change is that an algorithm that's passed the range <tt>[i, i)</tt>
  would no longer treat it as an empty range.</p>
  
  
*************** would no longer treat it as an empty ran
*** 2275,2284 ****
  
  <hr>
  <h3><a name="113"></a>113. Missing/extra iostream sync semantics</h3>
! <p><b>Section:</b> 27.7.1.1 [istream], 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-10-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream">issues</a> in [istream].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 27.6.1.1, class basic_istream has a member function sync, described in 27.6.1.3,
  paragraph 36. </p>
--- 1388,1397 ----
  
  <hr>
  <h3><a name="113"></a>113. Missing/extra iostream sync semantics</h3>
! <p><b>Section:</b> 27.7.2.1 [istream], 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-10-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream">issues</a> in [istream].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 27.6.1.1, class basic_istream has a member function sync, described in 27.6.1.3,
  paragraph 36. </p>
*************** desired functionality.</p>
*** 2314,2324 ****
  
  <hr>
  <h3><a name="116"></a>116. bitset cannot be constructed with a const char*</h3>
! <p><b>Section:</b> 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-11-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a></p>
  <p><b>Discussion:</b></p>
  
  
--- 1427,1438 ----
  
  <hr>
  <h3><a name="116"></a>116. bitset cannot be constructed with a const char*</h3>
! <p><b>Section:</b> 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-11-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#778">778</a></p>
  <p><b>Discussion:</b></p>
  
  
*************** desired functionality.</p>
*** 2328,2340 ****
  <blockquote>
    <pre>#include &lt;bitset&gt;
  using namespace std;
! bitset&lt;32&gt; b("111111111");</pre>
  </blockquote>
  
  <p>If you cast the ctor argument to a string, i.e.:</p>
  
  <blockquote>
!   <pre>bitset&lt;32&gt; b(string("111111111"));</pre>
  </blockquote>
  
  <p>then it will compile. The reason is that bitset has the following templatized
--- 1442,1454 ----
  <blockquote>
    <pre>#include &lt;bitset&gt;
  using namespace std;
! bitset&lt;32&gt; b(&quot;111111111&quot;);</pre>
  </blockquote>
  
  <p>If you cast the ctor argument to a string, i.e.:</p>
  
  <blockquote>
!   <pre>bitset&lt;32&gt; b(string(&quot;111111111&quot;));</pre>
  </blockquote>
  
  <p>then it will compile. The reason is that bitset has the following templatized
*************** explicit bitset (const basic_string&lt;c
*** 2348,2356 ****
  <p>According to the compiler vendor, Steve Adamcyk at EDG, the user
  cannot pass this template constructor a <tt>const char*</tt> and
  expect a conversion to <tt>basic_string</tt>.  The reason is
! "When you have a template constructor, it can get used in
  contexts where type deduction can be done. Type deduction basically
! comes up with exact matches, not ones involving conversions."
  </p>
  
  <p>I don't think the intention when this constructor became
--- 1462,1470 ----
  <p>According to the compiler vendor, Steve Adamcyk at EDG, the user
  cannot pass this template constructor a <tt>const char*</tt> and
  expect a conversion to <tt>basic_string</tt>.  The reason is
! &quot;When you have a template constructor, it can get used in
  contexts where type deduction can be done. Type deduction basically
! comes up with exact matches, not ones involving conversions.&quot;
  </p>
  
  <p>I don't think the intention when this constructor became
*************** longer work.</p>
*** 2359,2375 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add to 20.5 [template.bitset] a bitset constructor declaration</p>
  
  <blockquote>
    <pre>explicit bitset(const char*);</pre>
  </blockquote>
  
! <p>and in Section 20.5.1 [bitset.cons] add:</p>
  
  <blockquote>
    <pre>explicit bitset(const char* str);</pre>
!   <p>Effects: <br>
    &nbsp;&nbsp;&nbsp; Calls <tt>bitset((string) str, 0, string::npos);</tt></p>
  </blockquote>
  
--- 1473,1489 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add to 20.6 [template.bitset] a bitset constructor declaration</p>
  
  <blockquote>
    <pre>explicit bitset(const char*);</pre>
  </blockquote>
  
! <p>and in Section 20.6.1 [bitset.cons] add:</p>
  
  <blockquote>
    <pre>explicit bitset(const char* str);</pre>
!   <p>Effects: <br/>
    &nbsp;&nbsp;&nbsp; Calls <tt>bitset((string) str, 0, string::npos);</tt></p>
  </blockquote>
  
*************** extension.</p>
*** 2386,2395 ****
  
  <hr>
  <h3><a name="121"></a>121. Detailed definition for ctype&lt;wchar_t&gt; specialization</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 22.1.1.1.1 has the following listed in Table 51: ctype&lt;char&gt; ,
  ctype&lt;wchar_t&gt;. </p>
--- 1500,1509 ----
  
  <hr>
  <h3><a name="121"></a>121. Detailed definition for ctype&lt;wchar_t&gt; specialization</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 22.1.1.1.1 has the following listed in Table 51: ctype&lt;char&gt; ,
  ctype&lt;wchar_t&gt;. </p>
*************** ctype&lt;wchar_t&gt; specialization. </p
*** 2421,2430 ****
  
  <hr>
  <h3><a name="128"></a>128. Need open_mode() function for file stream, string streams, file buffers, and string&nbsp; buffers</h3>
! <p><b>Section:</b> 27.8 [string.streams], 27.9 [file.streams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-02-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.streams">issues</a> in [string.streams].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The following question came from Thorsten Herlemann:</p>
  
--- 1535,1544 ----
  
  <hr>
  <h3><a name="128"></a>128. Need open_mode() function for file stream, string streams, file buffers, and string&nbsp; buffers</h3>
! <p><b>Section:</b> 27.8 [string.streams], 27.9 [file.streams] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-02-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.streams">issues</a> in [string.streams].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The following question came from Thorsten Herlemann:</p>
  
*************** Moved to NAD.
*** 2471,2477 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>For stream buffers, add a function to the base class as a non-virtual function
! qualified as const to 27.6.2 [streambuf]:</p>
  
  <p>&nbsp;&nbsp;&nbsp;&nbsp;<tt>openmode mode() const</tt>;</p>
  
--- 1585,1591 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>For stream buffers, add a function to the base class as a non-virtual function
! qualified as const to 27.6.3 [streambuf]:</p>
  
  <p>&nbsp;&nbsp;&nbsp;&nbsp;<tt>openmode mode() const</tt>;</p>
  
*************** retained for future reference.</p>
*** 2496,2505 ****
  
  <hr>
  <h3><a name="131"></a>131. list::splice throws nothing</h3>
! <p><b>Section:</b> 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>What happens if a splice operation causes the size() of a list to grow 
  beyond max_size()?</p>
--- 1610,1619 ----
  
  <hr>
  <h3><a name="131"></a>131. list::splice throws nothing</h3>
! <p><b>Section:</b> 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>What happens if a splice operation causes the size() of a list to grow 
  beyond max_size()?</p>
*************** beyond max_size()?</p>
*** 2514,2522 ****
  
  <hr>
  <h3><a name="135"></a>135. basic_iostream doubly initialized</h3>
! <p><b>Section:</b> 27.7.1.5.1 [iostream.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>-1- Effects Constructs an object of class basic_iostream, assigning
  initial values to the base classes by calling
--- 1628,1636 ----
  
  <hr>
  <h3><a name="135"></a>135. basic_iostream doubly initialized</h3>
! <p><b>Section:</b> 27.7.2.5.1 [iostream.cons] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>-1- Effects Constructs an object of class basic_iostream, assigning
  initial values to the base classes by calling
*************** standard.</p>
*** 2545,2558 ****
  
  
  <hr>
! <h3><a name="138"></a>138. Class ctype_byname&lt;char&gt; redundant and misleading</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-03-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 22.4.1.4 [locale.codecvt] specifies that
! ctype_byname&lt;char&gt; must be a specialization of the ctype_byname
  template.</p>
  
  <p>It is common practice in the standard that specializations of class templates are only
--- 1659,1672 ----
  
  
  <hr>
! <h3><a name="138"></a>138. Class <tt>ctype_byname&lt;char&gt;</tt> redundant and misleading</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-03-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 22.4.1.4 [locale.codecvt] specifies that
! <tt>ctype_byname&lt;char&gt;</tt> must be a specialization of the <tt>ctype_byname</tt>
  template.</p>
  
  <p>It is common practice in the standard that specializations of class templates are only
*************** instantiation is an actual instantiation
*** 2562,2575 ****
  implementation detail. </p>
  
  <p>Clause 22.2.1.4 deviates from that practice and for that reason is misleading. The
! fact, that ctype_byname&lt;char&gt; is specified as a specialization suggests that there
! must be something "special" about it, but it has the exact same interface as the
! ctype_byname template. Clause 22.2.1.4 does not have any explanatory value, is at best
  redundant, at worst misleading - unless I am missing anything. </p>
  
! <p>Naturally, an implementation will most likely implement ctype_byname&lt;char&gt; as a
! specialization, because the base class ctype&lt;char&gt; is a specialization with an
! interface different from the ctype template, but that's an implementation detail and need
  not be mentioned in the standard. </p>
  
  <p><i>[
--- 1676,1689 ----
  implementation detail. </p>
  
  <p>Clause 22.2.1.4 deviates from that practice and for that reason is misleading. The
! fact, that <tt>ctype_byname&lt;char&gt;</tt> is specified as a specialization suggests that there
! must be something &quot;special&quot; about it, but it has the exact same interface as the
! <tt>ctype_byname</tt> template. Clause 22.2.1.4 does not have any explanatory value, is at best
  redundant, at worst misleading - unless I am missing anything. </p>
  
! <p>Naturally, an implementation will most likely implement <tt>ctype_byname&lt;char&gt;</tt> as a
! specialization, because the base class <tt>ctype&lt;char&gt;</tt> is a specialization with an
! interface different from the <tt>ctype</tt> template, but that's an implementation detail and need
  not be mentioned in the standard. </p>
  
  <p><i>[
*************** Summit:
*** 2577,2627 ****
  ]</i></p>
  
  
! <blockquote>
  Reopened by Alisdair.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD.
! </blockquote>
  
  
  
  <p><b>Rationale:</b></p>
  <p> The standard as written is mildly misleading, but the correct fix
! is to deal with the underlying problem in the ctype_byname base class,
! not in the specialization. See issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a>.</p>
  
  
  
  
  <hr>
  <h3><a name="140"></a>140. map&lt;Key, T&gt;::value_type does not satisfy the assignable requirement</h3>
! <p><b>Section:</b> 23.6.1 [map] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Mark Mitchell <b>Opened:</b> 1999-04-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#map">issues</a> in [map].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <blockquote>
!   <p>23.2 [container.requirements]<br>
!   <br>
    expression&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return type
!   &nbsp;&nbsp;&nbsp;&nbsp; pre/post-condition<br>
    -------------&nbsp;&nbsp;&nbsp;&nbsp; ----------- &nbsp;&nbsp;&nbsp;&nbsp;
!   -------------------<br>
    X::value_type&nbsp;&nbsp;&nbsp; T
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
!   T is assignable<br>
!   <br>
!   23.6.1 [map]<br>
!   <br>
!   A map satisfies all the requirements of a container.<br>
!   <br>
    For a map&lt;Key, T&gt; ... the value_type is pair&lt;const Key, T&gt;.</p>
  </blockquote>
  
--- 1691,1741 ----
  ]</i></p>
  
  
! <blockquote><p>
  Reopened by Alisdair.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD.
! </p></blockquote>
  
  
  
  <p><b>Rationale:</b></p>
  <p> The standard as written is mildly misleading, but the correct fix
! is to deal with the underlying problem in the <tt>ctype_byname</tt> base class,
! not in the specialization. See issue <a href="lwg-defects.html#228">228</a>.</p>
  
  
  
  
  <hr>
  <h3><a name="140"></a>140. map&lt;Key, T&gt;::value_type does not satisfy the assignable requirement</h3>
! <p><b>Section:</b> 23.4.4 [map] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Mark Mitchell <b>Opened:</b> 1999-04-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#map">issues</a> in [map].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <blockquote>
!   <p>23.2 [container.requirements]<br/>
!   <br/>
    expression&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return type
!   &nbsp;&nbsp;&nbsp;&nbsp; pre/post-condition<br/>
    -------------&nbsp;&nbsp;&nbsp;&nbsp; ----------- &nbsp;&nbsp;&nbsp;&nbsp;
!   -------------------<br/>
    X::value_type&nbsp;&nbsp;&nbsp; T
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
!   T is assignable<br/>
!   <br/>
!   23.4.4 [map]<br/>
!   <br/>
!   A map satisfies all the requirements of a container.<br/>
!   <br/>
    For a map&lt;Key, T&gt; ... the value_type is pair&lt;const Key, T&gt;.</p>
  </blockquote>
  
*************** T&gt;' is not assignable; the `const Key
*** 2630,2636 ****
  to. So,&nbsp; map&lt;Key, T&gt;::value_type does not satisfy the
  assignable requirement imposed by a container.</p>
  
! <p><i>[See issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> for the slightly related issue of
  modification of set keys.]</i></p>
  
  
--- 1744,1750 ----
  to. So,&nbsp; map&lt;Key, T&gt;::value_type does not satisfy the
  assignable requirement imposed by a container.</p>
  
! <p><i>[See issue <a href="lwg-defects.html#103">103</a> for the slightly related issue of
  modification of set keys.]</i></p>
  
  
*************** reconsider for the next standard.</p>
*** 2645,2653 ****
  
  <hr>
  <h3><a name="143"></a>143. C .h header wording unclear</h3>
! <p><b>Section:</b> D.7 [depr.c.headers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Christophe de Dinechin <b>Opened:</b> 1999-05-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>[depr.c.headers] paragraph 2 reads:</p>
  
--- 1759,1767 ----
  
  <hr>
  <h3><a name="143"></a>143. C .h header wording unclear</h3>
! <p><b>Section:</b> D.5 [depr.c.headers] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Christophe de Dinechin <b>Opened:</b> 1999-05-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>[depr.c.headers] paragraph 2 reads:</p>
  
*************** int main() {
*** 2731,2737 ****
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Replace D.7 [depr.c.headers] paragraph 2 with:</p>
  
  <blockquote>
  
--- 1845,1851 ----
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Replace D.5 [depr.c.headers] paragraph 2 with:</p>
  
  <blockquote>
  
*************** write code that depends on Koenig lookup
*** 2757,2778 ****
  
  <hr>
  <h3><a name="145"></a>145. adjustfield lacks default value</h3>
! <p><b>Section:</b> 27.5.4.1 [basic.ios.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-05-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.ios.cons">issues</a> in [basic.ios.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There is no initial value for the adjustfield defined, although
  many people believe that the default adjustment were right. This is a
  common misunderstanding. The standard only defines that, if no
  adjustment is specified, all the predefined inserters must add fill
! characters before the actual value, which is "as if" the
  right flag were set. The flag itself need not be set.</p>
  
  <p>When you implement a user-defined inserter you cannot rely on right
  being the default setting for the adjustfield. Instead, you must be
  prepared to find none of the flags set and must keep in mind that in
! this case you should make your inserter behave "as if" the
  right flag were set. This is surprising to many people and complicates
  matters more than necessary.</p>
  
--- 1871,1892 ----
  
  <hr>
  <h3><a name="145"></a>145. adjustfield lacks default value</h3>
! <p><b>Section:</b> 27.5.5.2 [basic.ios.cons] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-05-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.cons">issues</a> in [basic.ios.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There is no initial value for the adjustfield defined, although
  many people believe that the default adjustment were right. This is a
  common misunderstanding. The standard only defines that, if no
  adjustment is specified, all the predefined inserters must add fill
! characters before the actual value, which is &quot;as if&quot; the
  right flag were set. The flag itself need not be set.</p>
  
  <p>When you implement a user-defined inserter you cannot rely on right
  being the default setting for the adjustfield. Instead, you must be
  prepared to find none of the flags set and must keep in mind that in
! this case you should make your inserter behave &quot;as if&quot; the
  right flag were set. This is surprising to many people and complicates
  matters more than necessary.</p>
  
*************** set. Consider Arabic or Hebrew, for exam
*** 2791,2805 ****
  
  <hr>
  <h3><a name="157"></a>157. Meaningless error handling for <tt>pword()</tt> and <tt>iword()</tt></h3>
! <p><b>Section:</b> 27.5.2.5 [ios.base.storage] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios.base.storage">issues</a> in [ios.base.storage].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#41">41</a></p>
  <p><b>Discussion:</b></p>
! <p>According to paragraphs 2 and 4 of 27.5.2.5 [ios.base.storage], the
! functions <tt>iword()</tt> and <tt>pword()</tt> "set the
! <tt>badbit</tt> (which might throw an exception)" on
  failure. ... but what does it mean for <tt>ios_base</tt> to set the
  <tt>badbit</tt>? The state facilities of the IOStream library are
  defined in <tt>basic_ios</tt>, a derived class! It would be possible
--- 1905,1919 ----
  
  <hr>
  <h3><a name="157"></a>157. Meaningless error handling for <tt>pword()</tt> and <tt>iword()</tt></h3>
! <p><b>Section:</b> 27.5.3.5 [ios.base.storage] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios.base.storage">issues</a> in [ios.base.storage].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#41">41</a></p>
  <p><b>Discussion:</b></p>
! <p>According to paragraphs 2 and 4 of 27.5.3.5 [ios.base.storage], the
! functions <tt>iword()</tt> and <tt>pword()</tt> &quot;set the
! <tt>badbit</tt> (which might throw an exception)&quot; on
  failure. ... but what does it mean for <tt>ios_base</tt> to set the
  <tt>badbit</tt>? The state facilities of the IOStream library are
  defined in <tt>basic_ios</tt>, a derived class! It would be possible
*************** character type used...</p>
*** 2814,2837 ****
  
  
  <hr>
! <h3><a name="162"></a>162. Really "formatted input functions"?</h3>
! <p><b>Section:</b> 27.7.1.2.3 [istream::extractors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a></p>
  <p><b>Discussion:</b></p>
  <p>It appears to be somewhat nonsensical to consider the functions
! defined in the paragraphs 1 to 5 to be "Formatted input
! function" but since these functions are defined in a section
! labeled "Formatted input functions" it is unclear to me
  whether these operators are considered formatted input functions which
! have to conform to the "common requirements" from 27.7.1.2.1 [istream.formatted.reqmts]: If this is the case, all manipulators, not just
  <tt>ws</tt>, would skip whitespace unless <tt>noskipws</tt> is set
  (... but setting <tt>noskipws</tt> using the manipulator syntax would
  also skip whitespace :-)</p>
  
! <p>See also issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#166">166</a> for the same problem in formatted
  output</p>
  
  
--- 1928,1951 ----
  
  
  <hr>
! <h3><a name="162"></a>162. Really &quot;formatted input functions&quot;?</h3>
! <p><b>Section:</b> 27.7.2.2.3 [istream::extractors] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#60">60</a></p>
  <p><b>Discussion:</b></p>
  <p>It appears to be somewhat nonsensical to consider the functions
! defined in the paragraphs 1 to 5 to be &quot;Formatted input
! function&quot; but since these functions are defined in a section
! labeled &quot;Formatted input functions&quot; it is unclear to me
  whether these operators are considered formatted input functions which
! have to conform to the &quot;common requirements&quot; from 27.7.2.2.1 [istream.formatted.reqmts]: If this is the case, all manipulators, not just
  <tt>ws</tt>, would skip whitespace unless <tt>noskipws</tt> is set
  (... but setting <tt>noskipws</tt> using the manipulator syntax would
  also skip whitespace :-)</p>
  
! <p>See also issue <a href="lwg-closed.html#166">166</a> for the same problem in formatted
  output</p>
  
  
*************** output</p>
*** 2843,2868 ****
  
  <hr>
  <h3><a name="163"></a>163. Return of <tt>gcount()</tt> after a call to <tt>gcount</tt></h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a></p>
  <p><b>Discussion:</b></p>
  <p>It is not clear which functions are to be considered unformatted
! input functions. As written, it seems that all functions in 27.7.1.3 [istream.unformatted] are unformatted input functions. However, it does not
  really make much sense to construct a sentry object for
  <tt>gcount()</tt>, <tt>sync()</tt>, ... Also it is unclear what
  happens to the <tt>gcount()</tt> if eg. <tt>gcount()</tt>,
  <tt>putback()</tt>, <tt>unget()</tt>, or <tt>sync()</tt> is called:
  These functions don't extract characters, some of them even
! "unextract" a character. Should this still be reflected in
  <tt>gcount()</tt>? Of course, it could be read as if after a call to
  <tt>gcount()</tt> <tt>gcount()</tt> return <tt>0</tt> (the last
  unformatted input function, <tt>gcount()</tt>, didn't extract any
  character) and after a call to <tt>putback()</tt> <tt>gcount()</tt>
  returns <tt>-1</tt> (the last unformatted input function
! <tt>putback()</tt> did "extract" back into the
  stream). Correspondingly for <tt>unget()</tt>. Is this what is
  intended?  If so, this should be clarified. Otherwise, a corresponding
  clarification should be used.</p>
--- 1957,1983 ----
  
  <hr>
  <h3><a name="163"></a>163. Return of <tt>gcount()</tt> after a call to <tt>gcount</tt></h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#60">60</a></p>
  <p><b>Discussion:</b></p>
  <p>It is not clear which functions are to be considered unformatted
! input functions. As written, it seems that all functions in 27.7.2.3 [istream.unformatted] are unformatted input functions. However, it does not
  really make much sense to construct a sentry object for
  <tt>gcount()</tt>, <tt>sync()</tt>, ... Also it is unclear what
  happens to the <tt>gcount()</tt> if eg. <tt>gcount()</tt>,
  <tt>putback()</tt>, <tt>unget()</tt>, or <tt>sync()</tt> is called:
  These functions don't extract characters, some of them even
! &quot;unextract&quot; a character. Should this still be reflected in
  <tt>gcount()</tt>? Of course, it could be read as if after a call to
  <tt>gcount()</tt> <tt>gcount()</tt> return <tt>0</tt> (the last
  unformatted input function, <tt>gcount()</tt>, didn't extract any
  character) and after a call to <tt>putback()</tt> <tt>gcount()</tt>
  returns <tt>-1</tt> (the last unformatted input function
! <tt>putback()</tt> did &quot;extract&quot; back into the
  stream). Correspondingly for <tt>unget()</tt>. Is this what is
  intended?  If so, this should be clarified. Otherwise, a corresponding
  clarification should be used.</p>
*************** clarification should be used.</p>
*** 2875,2891 ****
  
  
  <hr>
! <h3><a name="166"></a>166. Really "formatted output functions"?</h3>
! <p><b>Section:</b> 27.7.2.6.3 [ostream.inserters] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a></p>
  <p><b>Discussion:</b></p>
! <p>From 27.7.2.6.1 [ostream.formatted.reqmts] it appears that all the functions
! defined in 27.7.2.6.3 [ostream.inserters] have to construct a
  <tt>sentry</tt> object. Is this really intended?</p> 
  
! <p>This is basically the same problem as issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#162">162</a> but
  for output instead of input.</p>
  
  
--- 1990,2006 ----
  
  
  <hr>
! <h3><a name="166"></a>166. Really &quot;formatted output functions&quot;?</h3>
! <p><b>Section:</b> 27.7.3.6.3 [ostream.inserters] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#60">60</a></p>
  <p><b>Discussion:</b></p>
! <p>From 27.7.3.6.1 [ostream.formatted.reqmts] it appears that all the functions
! defined in 27.7.3.6.3 [ostream.inserters] have to construct a
  <tt>sentry</tt> object. Is this really intended?</p> 
  
! <p>This is basically the same problem as issue <a href="lwg-closed.html#162">162</a> but
  for output instead of input.</p>
  
  
*************** for output instead of input.</p>
*** 2897,2906 ****
  
  <hr>
  <h3><a name="177"></a>177. Complex operators cannot be explicitly instantiated</h3>
! <p><b>Section:</b> 26.4.6 [complex.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1999-07-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.ops">issues</a> in [complex.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>A user who tries to explicitly instantiate a complex non-member operator will
  get compilation errors. Below is a simplified example of the reason why. The
--- 2012,2021 ----
  
  <hr>
  <h3><a name="177"></a>177. Complex operators cannot be explicitly instantiated</h3>
! <p><b>Section:</b> 26.4.6 [complex.ops] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1999-07-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.ops">issues</a> in [complex.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>A user who tries to explicitly instantiate a complex non-member operator will
  get compilation errors. Below is a simplified example of the reason why. The
*************** template std::complex&lt;float&gt; std::
*** 2940,2947 ****
  <p>Implementors can make minor changes and the example will
  work. Users are not affected in any case.</p> <p>According to John
  Spicer, It is possible to explicitly instantiate these operators using
! different syntax: change "std::operator+&lt;float&gt;" to
! "std::operator+".</p>
  
  <p>The proposed resolution of issue 120 is that users will not be able
  to explicitly instantiate standard library templates. If that
--- 2055,2062 ----
  <p>Implementors can make minor changes and the example will
  work. Users are not affected in any case.</p> <p>According to John
  Spicer, It is possible to explicitly instantiate these operators using
! different syntax: change &quot;std::operator+&lt;float&gt;&quot; to
! &quot;std::operator+&quot;.</p>
  
  <p>The proposed resolution of issue 120 is that users will not be able
  to explicitly instantiate standard library templates. If that
*************** syntax.</p>
*** 2954,2966 ****
  
  <hr>
  <h3><a name="178"></a>178. Should clog and cerr initially be tied to cout?</h3>
! <p><b>Section:</b> 27.4.1 [narrow.stream.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1999-07-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#narrow.stream.objects">issues</a> in [narrow.stream.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 27.3.1 says "After the object cerr is initialized,
  cerr.flags() &amp; unitbuf is nonzero. Its state is otherwise the same as
  required for ios_base::init (lib.basic.ios.cons).  It doesn't say
  anything about the the state of clog.  So this means that calling
--- 2069,2081 ----
  
  <hr>
  <h3><a name="178"></a>178. Should clog and cerr initially be tied to cout?</h3>
! <p><b>Section:</b> 27.4.2 [narrow.stream.objects] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1999-07-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#narrow.stream.objects">issues</a> in [narrow.stream.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 27.3.1 says &quot;After the object cerr is initialized,
  cerr.flags() &amp; unitbuf is nonzero. Its state is otherwise the same as
  required for ios_base::init (lib.basic.ios.cons).  It doesn't say
  anything about the the state of clog.  So this means that calling
*************** to &amp;cout. I would think that would b
*** 2976,2984 ****
  
  <p><b>Rationale:</b></p>
  <p>The standard is clear as written.</p>
! <p>27.3.1/5 says that "After the object cerr is initialized, cerr.flags()
  &amp; unitbuf is nonzero. Its state is otherwise the same as required for
! ios_base::init (27.4.4.1)." Table 89 in 27.4.4.1, which gives the
  postconditions of basic_ios::init(), says that tie() is 0. (Other issues correct
  ios_base::init to basic_ios::init().)</p>
  
--- 2091,2099 ----
  
  <p><b>Rationale:</b></p>
  <p>The standard is clear as written.</p>
! <p>27.3.1/5 says that &quot;After the object cerr is initialized, cerr.flags()
  &amp; unitbuf is nonzero. Its state is otherwise the same as required for
! ios_base::init (27.4.4.1).&quot; Table 89 in 27.4.4.1, which gives the
  postconditions of basic_ios::init(), says that tie() is 0. (Other issues correct
  ios_base::init to basic_ios::init().)</p>
  
*************** ios_base::init to basic_ios::init().)</p
*** 2987,2996 ****
  
  <hr>
  <h3><a name="188"></a>188. valarray helpers missing augmented assignment operators</h3>
! <p><b>Section:</b> 26.6.2.6 [valarray.cassign] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 1999-08-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.cassign">issues</a> in [valarray.cassign].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>26.5.2.6 defines augmented assignment operators
  valarray&lt;T&gt;::op=(const T&amp;), but fails to provide
--- 2102,2111 ----
  
  <hr>
  <h3><a name="188"></a>188. valarray helpers missing augmented assignment operators</h3>
! <p><b>Section:</b> 26.6.2.7 [valarray.cassign] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 1999-08-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.cassign">issues</a> in [valarray.cassign].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>26.5.2.6 defines augmented assignment operators
  valarray&lt;T&gt;::op=(const T&amp;), but fails to provide
*************** operators.</p>
*** 3025,3040 ****
  
  <hr>
  <h3><a name="190"></a>190. min() and max() functions should be std::binary_functions</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Mark Rintoul <b>Opened:</b> 1999-08-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Both std::min and std::max are defined as template functions.  This
  is very different than the definition of std::plus (and similar
  structs) which are defined as function objects which inherit
! std::binary_function.<br>
! <br>
          This lack of inheritance leaves std::min and std::max somewhat useless in standard library algorithms which require
  a function object that inherits std::binary_function.</p>
  
--- 2140,2155 ----
  
  <hr>
  <h3><a name="190"></a>190. min() and max() functions should be std::binary_functions</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Mark Rintoul <b>Opened:</b> 1999-08-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Both std::min and std::max are defined as template functions.  This
  is very different than the definition of std::plus (and similar
  structs) which are defined as function objects which inherit
! std::binary_function.<br/>
! <br/>
          This lack of inheritance leaves std::min and std::max somewhat useless in standard library algorithms which require
  a function object that inherits std::binary_function.</p>
  
*************** function objects.</p>
*** 3069,3078 ****
  
  <hr>
  <h3><a name="191"></a>191. Unclear complexity for algorithms such as binary search</h3>
! <p><b>Section:</b> 25.4.3 [alg.binary.search] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1999-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.binary.search">issues</a> in [alg.binary.search].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The complexity of binary_search() is stated as "At most
  log(last-first) + 2 comparisons", which seems to say that the
--- 2184,2193 ----
  
  <hr>
  <h3><a name="191"></a>191. Unclear complexity for algorithms such as binary search</h3>
! <p><b>Section:</b> 25.4.3 [alg.binary.search] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1999-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.binary.search">issues</a> in [alg.binary.search].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The complexity of binary_search() is stated as "At most
  log(last-first) + 2 comparisons", which seems to say that the
*************** algorithm has logarithmic complexity. Ho
*** 3080,3087 ****
  defined for forward iterators. And for forward iterators, the need to
  step element-by-element results into linear complexity. But such a
  statement is missing in the standard. The same applies to
! lower_bound(), upper_bound(), and equal_range().&nbsp;<br>
! <br>
  However, strictly speaking the standard contains no bug here. So this
  might considered to be a clarification or improvement.
  </p>
--- 2195,2202 ----
  defined for forward iterators. And for forward iterators, the need to
  step element-by-element results into linear complexity. But such a
  statement is missing in the standard. The same applies to
! lower_bound(), upper_bound(), and equal_range().&nbsp;<br/>
! <br/>
  However, strictly speaking the standard contains no bug here. So this
  might considered to be a clarification or improvement.
  </p>
*************** iterators.</p>
*** 3098,3114 ****
  
  <hr>
  <h3><a name="192"></a>192. a.insert(p,t) is inefficient and overconstrained</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ed Brey <b>Opened:</b> 1999-06-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a></p>
  <p><b>Discussion:</b></p>
  <p>As defined in 23.1.2, paragraph 7 (table 69), a.insert(p,t) suffers from
  several problems:</p>
  <table border="1" cellpadding="5">
!   <tbody><tr>
      <td><b>expression</b></td>
      <td><b>return type</b></td>
      <td><b>pre/post-condition</b></td>
--- 2213,2229 ----
  
  <hr>
  <h3><a name="192"></a>192. a.insert(p,t) is inefficient and overconstrained</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ed Brey <b>Opened:</b> 1999-06-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#233">233</a></p>
  <p><b>Discussion:</b></p>
  <p>As defined in 23.1.2, paragraph 7 (table 69), a.insert(p,t) suffers from
  several problems:</p>
  <table border="1" cellpadding="5">
!   <tr>
      <td><b>expression</b></td>
      <td><b>return type</b></td>
      <td><b>pre/post-condition</b></td>
*************** several problems:</p>
*** 3123,3129 ****
         the key of t . iterator p is a hint pointing to where the insert should start to search.</td>
      <td>logarithmic in general, but amortized constant if t is inserted right after p .</td>
    </tr>
! </tbody></table>
  <p>1. For a container with unique keys, only logarithmic complexity is
  guaranteed if no element is inserted, even though constant complexity is always
  possible if p points to an element equivalent to t.</p>
--- 2238,2244 ----
         the key of t . iterator p is a hint pointing to where the insert should start to search.</td>
      <td>logarithmic in general, but amortized constant if t is inserted right after p .</td>
    </tr>
! </table>
  <p>1. For a container with unique keys, only logarithmic complexity is
  guaranteed if no element is inserted, even though constant complexity is always
  possible if p points to an element equivalent to t.</p>
*************** providing no disadvantage to the contain
*** 3148,3154 ****
  <p>In 23.2.4 [associative.reqmts] paragraph 7, replace the row in table 69
  for a.insert(p,t) with the following two rows:</p>
  <table border="1" cellpadding="5">
!   <tbody><tr>
      <td><b>expression</b></td>
      <td><b>return type</b></td>
      <td><b>pre/post-condition</b></td>
--- 2263,2269 ----
  <p>In 23.2.4 [associative.reqmts] paragraph 7, replace the row in table 69
  for a.insert(p,t) with the following two rows:</p>
  <table border="1" cellpadding="5">
!   <tr>
      <td><b>expression</b></td>
      <td><b>return type</b></td>
      <td><b>pre/post-condition</b></td>
*************** for a.insert(p,t) with the following two
*** 3172,3178 ****
      <td>logarithmic in general, but amortized constant if t is inserted right
        before p.</td>
    </tr>
! </tbody></table>
  
  
  
--- 2287,2293 ----
      <td>logarithmic in general, but amortized constant if t is inserted right
        before p.</td>
    </tr>
! </table>
  
  
  
*************** both before p and after p, and don't wan
*** 3186,3194 ****
  
  <hr>
  <h3><a name="194"></a>194. rdbuf() functions poorly specified</h3>
! <p><b>Section:</b> 27.5.4 [ios] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1999-09-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In classic iostreams, base class ios had an rdbuf function that returned a
  pointer to the associated streambuf. Each derived class had its own rdbuf
--- 2301,2309 ----
  
  <hr>
  <h3><a name="194"></a>194. rdbuf() functions poorly specified</h3>
! <p><b>Section:</b> 27.5.5 [ios] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1999-09-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In classic iostreams, base class ios had an rdbuf function that returned a
  pointer to the associated streambuf. Each derived class had its own rdbuf
*************** class <tt> rdbuf()</tt> always returns t
*** 3232,3259 ****
  <tt> rdbuf()</tt> will return the "current streambuf" if that has been changed by the variant you mention.</p>
  
  <p>Permission is not required to add such an extension.  See 
! 17.6.4.5 [member.functions].</p>
  
  
  
  
  <hr>
  <h3><a name="196"></a>196. Placement new example has alignment problems</h3>
! <p><b>Section:</b> 18.6.1.3 [new.delete.placement] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#new.delete.placement">issues</a> in [new.delete.placement].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a></p>
  <p><b>Discussion:</b></p>
  <p>The example in 18.6.1.3 [new.delete.placement] paragraph 4 reads: </p>
  
  <blockquote>
  
! <p>[Example: This can be useful for constructing an object at a known address:<br>
! <br>
! <tt>&nbsp;&nbsp; char place[sizeof(Something)];<br>
! &nbsp;&nbsp; Something* p = new (place) Something();<br>
! <br>
  </tt>end example] </p>
  
  </blockquote>
--- 2347,2374 ----
  <tt> rdbuf()</tt> will return the "current streambuf" if that has been changed by the variant you mention.</p>
  
  <p>Permission is not required to add such an extension.  See 
! 17.6.5.5 [member.functions].</p>
  
  
  
  
  <hr>
  <h3><a name="196"></a>196. Placement new example has alignment problems</h3>
! <p><b>Section:</b> 18.6.1.3 [new.delete.placement] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete.placement">issues</a> in [new.delete.placement].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#114">114</a></p>
  <p><b>Discussion:</b></p>
  <p>The example in 18.6.1.3 [new.delete.placement] paragraph 4 reads: </p>
  
  <blockquote>
  
! <p>[Example: This can be useful for constructing an object at a known address:<br/>
! <br/>
! <tt>&nbsp;&nbsp; char place[sizeof(Something)];<br/>
! &nbsp;&nbsp; Something* p = new (place) Something();<br/>
! <br/>
  </tt>end example] </p>
  
  </blockquote>
*************** class <tt> rdbuf()</tt> always returns t
*** 3269,3278 ****
  
  <hr>
  <h3><a name="197"></a>197. max_size() underspecified</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements], 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 1999-10-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Must the value returned by max_size() be unchanged from call to call? </p>
  
--- 2384,2394 ----
  
  <hr>
  <h3><a name="197"></a>197. max_size() underspecified</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements], 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 1999-10-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Must the value returned by max_size() be unchanged from call to call? </p>
  
*************** class <tt> rdbuf()</tt> always returns t
*** 3284,3303 ****
  case" conditions - i.e. assume the run-time platform is "configured to
  the max", and no overhead from the program itself. This may possibly
  be determined at the point the library is written, but certainly no
! later than compile time.<br>
! <br>
  2) The largest container the program could create, given "best case"
  conditions - i.e. same platform assumptions as (1), but take into
  account any overhead for executing the program itself. (or, roughly
  "storage=storage-sizeof(program)"). This does NOT include any resource
  allocated by the program. This may (or may not) be determinable at
! compile time.<br>
! <br>
  3) The largest container the current execution of the program could
  create, given knowledge of the actual run-time platform, but again,
  not taking into account any currently allocated resource. This is
! probably best determined at program start-up.<br>
! <br>
  4) The largest container the current execution program could create at
  the point max_size() is called (or more correctly at the point
  max_size() returns :-), given it's current environment (i.e. taking
--- 2400,2419 ----
  case" conditions - i.e. assume the run-time platform is "configured to
  the max", and no overhead from the program itself. This may possibly
  be determined at the point the library is written, but certainly no
! later than compile time.<br/>
! <br/>
  2) The largest container the program could create, given "best case"
  conditions - i.e. same platform assumptions as (1), but take into
  account any overhead for executing the program itself. (or, roughly
  "storage=storage-sizeof(program)"). This does NOT include any resource
  allocated by the program. This may (or may not) be determinable at
! compile time.<br/>
! <br/>
  3) The largest container the current execution of the program could
  create, given knowledge of the actual run-time platform, but again,
  not taking into account any currently allocated resource. This is
! probably best determined at program start-up.<br/>
! <br/>
  4) The largest container the current execution program could create at
  the point max_size() is called (or more correctly at the point
  max_size() returns :-), given it's current environment (i.e. taking
*************** called. </p>
*** 3325,3334 ****
  
  <hr>
  <h3><a name="203"></a>203. basic_istream::sentry::sentry() is uninstantiable with ctype&lt;user-defined type&gt;</h3>
! <p><b>Section:</b> 27.7.1.1.3 [istream::sentry] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt McClure and Dietmar Kühl <b>Opened:</b> 2000-01-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.6.1.1.2 Paragraph 4 states:</p>
  <blockquote>
--- 2441,2450 ----
  
  <hr>
  <h3><a name="203"></a>203. basic_istream::sentry::sentry() is uninstantiable with ctype&lt;user-defined type&gt;</h3>
! <p><b>Section:</b> 27.7.2.1.3 [istream::sentry] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt McClure and Dietmar K&uuml;hl <b>Opened:</b> 2000-01-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.6.1.1.2 Paragraph 4 states:</p>
  <blockquote>
*************** and is not a defect.</p>
*** 3383,3402 ****
  
  
  <hr>
! <h3><a name="204"></a>204. distance(first, last) when "last" is before "first"</h3>
! <p><b>Section:</b> 24.4.4 [iterator.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Rintala Matti <b>Opened:</b> 2000-01-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.operations">issues</a> in [iterator.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 24.3.4 describes the function distance(first, last) (where first and
! last are iterators) which calculates "the number of increments or
! decrements needed to get from 'first' to 'last'".</p>
  <p>The function should work for forward, bidirectional and random access
! iterators, and there is a requirement 24.3.4.5 which states that "'last'
! must be reachable from 'first'".</p>
! <p>With random access iterators the function is easy to implement as "last
! - first".</p>
  <p>With forward iterators it's clear that 'first' must point to a place before
  'last', because otherwise 'last' would not be reachable from 'first'.</p>
  <p>But what about bidirectional iterators? There 'last' is reachable from
--- 2499,2518 ----
  
  
  <hr>
! <h3><a name="204"></a>204. distance(first, last) when &quot;last&quot; is before &quot;first&quot;</h3>
! <p><b>Section:</b> 24.4.4 [iterator.operations] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Rintala Matti <b>Opened:</b> 2000-01-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.operations">issues</a> in [iterator.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 24.3.4 describes the function distance(first, last) (where first and
! last are iterators) which calculates &quot;the number of increments or
! decrements needed to get from 'first' to 'last'&quot;.</p>
  <p>The function should work for forward, bidirectional and random access
! iterators, and there is a requirement 24.3.4.5 which states that &quot;'last'
! must be reachable from 'first'&quot;.</p>
! <p>With random access iterators the function is easy to implement as &quot;last
! - first&quot;.</p>
  <p>With forward iterators it's clear that 'first' must point to a place before
  'last', because otherwise 'last' would not be reachable from 'first'.</p>
  <p>But what about bidirectional iterators? There 'last' is reachable from
*************** must be reachable from 'first'".</p>
*** 3404,3425 ****
  'first'. However, I cannot see how the distance() function could be implemented
  if the implementation does not know which of the iterators points to an earlier
  position (you cannot use ++ or -- on either iterator if you don't know which
! direction is the "safe way to travel").</p>
! <p>The paragraph 24.3.4.1 states that "for ... bidirectional iterators they
! use ++ to provide linear time implementations". However, the ++ operator is
  not mentioned in the reachability requirement. Furthermore 24.3.4.4 explicitly
  mentions that distance() returns the number of increments _or decrements_,
  suggesting that it could return a negative number also for bidirectional
  iterators when 'last' points to a position before 'first'.</p>
  <p>Is a further requirement is needed to state that for forward and
! bidirectional iterators "'last' must be reachable from 'first' using the ++
! operator". Maybe this requirement might also apply to random access
  iterators so that distance() would work the same way for every iterator
  category?</p>
  
  
  <p><b>Rationale:</b></p>
! <p>"Reachable" is defined in the standard in X [iterator.concepts] paragraph 6.
  The definition is only in terms of operator++(). The LWG sees no defect in
  the standard.</p>
  
--- 2520,2541 ----
  'first'. However, I cannot see how the distance() function could be implemented
  if the implementation does not know which of the iterators points to an earlier
  position (you cannot use ++ or -- on either iterator if you don't know which
! direction is the &quot;safe way to travel&quot;).</p>
! <p>The paragraph 24.3.4.1 states that &quot;for ... bidirectional iterators they
! use ++ to provide linear time implementations&quot;. However, the ++ operator is
  not mentioned in the reachability requirement. Furthermore 24.3.4.4 explicitly
  mentions that distance() returns the number of increments _or decrements_,
  suggesting that it could return a negative number also for bidirectional
  iterators when 'last' points to a position before 'first'.</p>
  <p>Is a further requirement is needed to state that for forward and
! bidirectional iterators &quot;'last' must be reachable from 'first' using the ++
! operator&quot;. Maybe this requirement might also apply to random access
  iterators so that distance() would work the same way for every iterator
  category?</p>
  
  
  <p><b>Rationale:</b></p>
! <p>&quot;Reachable&quot; is defined in the standard in X [iterator.concepts] paragraph 6.
  The definition is only in terms of operator++(). The LWG sees no defect in
  the standard.</p>
  
*************** the standard.</p>
*** 3428,3446 ****
  
  <hr>
  <h3><a name="205"></a>205.  numeric_limits unclear on how to determine floating point types</h3>
! <p><b>Section:</b> 18.3.1.2 [numeric.limits.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Cleary <b>Opened:</b> 2000-01-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numeric.limits.members">issues</a> in [numeric.limits.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In several places in 18.3.1.2 [numeric.limits.members], a member is
! described as "Meaningful for all floating point types."
  However, no clear method of determining a floating point type is
  provided.</p>
  
! <p>In 18.3.1.5 [numeric.special], paragraph 1 states ". . . (for
  example, epsilon() is only meaningful if is_integer is
! false). . ." which suggests that a type is a floating point type
  if is_specialized is true and is_integer is false; however, this is
  unclear.</p>
  
--- 2544,2562 ----
  
  <hr>
  <h3><a name="205"></a>205.  numeric_limits unclear on how to determine floating point types</h3>
! <p><b>Section:</b> 18.3.2.4 [numeric.limits.members] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Cleary <b>Opened:</b> 2000-01-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numeric.limits.members">issues</a> in [numeric.limits.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In several places in 18.3.2.4 [numeric.limits.members], a member is
! described as &quot;Meaningful for all floating point types.&quot;
  However, no clear method of determining a floating point type is
  provided.</p>
  
! <p>In 18.3.2.7 [numeric.special], paragraph 1 states &quot;. . . (for
  example, epsilon() is only meaningful if is_integer is
! false). . .&quot; which suggests that a type is a floating point type
  if is_specialized is true and is_integer is false; however, this is
  unclear.</p>
  
*************** floating point type.</p>
*** 3460,3470 ****
  
  <hr>
  <h3><a name="207"></a>207. ctype&lt;char&gt; members return clause incomplete</h3>
! <p><b>Section:</b> 22.4.1.3.2 [facet.ctype.char.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 1999-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.ctype.char.members">issues</a> in [facet.ctype.char.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#153">153</a></p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>widen</tt> and <tt>narrow</tt> member functions are described
--- 2576,2586 ----
  
  <hr>
  <h3><a name="207"></a>207. ctype&lt;char&gt; members return clause incomplete</h3>
! <p><b>Section:</b> 22.4.1.3.2 [facet.ctype.char.members] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 1999-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.ctype.char.members">issues</a> in [facet.ctype.char.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#153">153</a></p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>widen</tt> and <tt>narrow</tt> member functions are described
*************** respectively.</p>
*** 3493,3499 ****
  
  
  <p><b>Rationale:</b></p>
! <p>Subsumed by issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#153">153</a>, which addresses the same
  paragraphs.</p>
  
  
--- 2609,2615 ----
  
  
  <p><b>Rationale:</b></p>
! <p>Subsumed by issue <a href="lwg-defects.html#153">153</a>, which addresses the same
  paragraphs.</p>
  
  
*************** paragraphs.</p>
*** 3503,3512 ****
  
  <hr>
  <h3><a name="213"></a>213. Math function overloads ambiguous</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 2000-02-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Due to the additional overloaded versions of numeric functions for
  float and long double according to Section 26.5, calls such as int x;
--- 2619,2629 ----
  
  <hr>
  <h3><a name="213"></a>213. Math function overloads ambiguous</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 2000-02-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Due to the additional overloaded versions of numeric functions for
  float and long double according to Section 26.5, calls such as int x;
*************** or write floating point expressions as a
*** 3529,3539 ****
  
  <hr>
  <h3><a name="215"></a>215. Can a map's key_type be const?</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-02-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>A user noticed that this doesn't compile with the Rogue Wave library because
  the rb_tree class declares a key_allocator, and allocator&lt;const int&gt; is
--- 2646,2656 ----
  
  <hr>
  <h3><a name="215"></a>215. Can a map's key_type be const?</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-02-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>A user noticed that this doesn't compile with the Rogue Wave library because
  the rb_tree class declares a key_allocator, and allocator&lt;const int&gt; is
*************** too.</p>
*** 3554,3560 ****
  
  
  <p><b>Rationale:</b></p>
! <p>The "key is assignable" requirement from table 69 in
  23.2.4 [associative.reqmts] already implies the key cannot be const.</p>
  
  
--- 2671,2677 ----
  
  
  <p><b>Rationale:</b></p>
! <p>The &quot;key is assignable&quot; requirement from table 69 in
  23.2.4 [associative.reqmts] already implies the key cannot be const.</p>
  
  
*************** too.</p>
*** 3562,3574 ****
  
  <hr>
  <h3><a name="216"></a>216. setbase manipulator description flawed</h3>
! <p><b>Section:</b> 27.7.3 [std.manip] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Hyman Rosen <b>Opened:</b> 2000-02-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#std.manip">issues</a> in [std.manip].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#193">193</a></p>
  <p><b>Discussion:</b></p>
! <p>27.7.3 [std.manip] paragraph 5 says:</p>
  <blockquote>
  <pre>smanip setbase(int base);</pre>
  <p> Returns: An object s of unspecified type such that if out is an
--- 2679,2691 ----
  
  <hr>
  <h3><a name="216"></a>216. setbase manipulator description flawed</h3>
! <p><b>Section:</b> 27.7.4 [std.manip] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Hyman Rosen <b>Opened:</b> 2000-02-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#std.manip">issues</a> in [std.manip].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#193">193</a></p>
  <p><b>Discussion:</b></p>
! <p>27.7.4 [std.manip] paragraph 5 says:</p>
  <blockquote>
  <pre>smanip setbase(int base);</pre>
  <p> Returns: An object s of unspecified type such that if out is an
*************** description needs to say that out&lt;&lt
*** 3591,3605 ****
  had been called. Second, f is has a parameter named base, but is written as if
  the parameter was named n.</p>
  <p>Actually, there's a third problem. The paragraph has grammatical errors.
! There needs to be an "and" after the first comma, and the "Where
! f" sentence fragment needs to be merged into its preceding sentence. You
  may also want to format the function a little better. The formatting above is
  more-or-less what the Standard contains.</p>
  
  
  <p><b>Rationale:</b></p>
  <p>The resolution of this defect is subsumed by the proposed resolution for
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#193">193</a>.</p>
  
  <p><i>[Tokyo: The LWG agrees that this is a defect and notes that it
  occurs additional places in the section, all requiring fixes.]</i></p>
--- 2708,2722 ----
  had been called. Second, f is has a parameter named base, but is written as if
  the parameter was named n.</p>
  <p>Actually, there's a third problem. The paragraph has grammatical errors.
! There needs to be an &quot;and&quot; after the first comma, and the &quot;Where
! f&quot; sentence fragment needs to be merged into its preceding sentence. You
  may also want to format the function a little better. The formatting above is
  more-or-less what the Standard contains.</p>
  
  
  <p><b>Rationale:</b></p>
  <p>The resolution of this defect is subsumed by the proposed resolution for
! issue <a href="lwg-defects.html#193">193</a>.</p>
  
  <p><i>[Tokyo: The LWG agrees that this is a defect and notes that it
  occurs additional places in the section, all requiring fixes.]</i></p>
*************** occurs additional places in the section,
*** 3613,3622 ****
  
  <hr>
  <h3><a name="218"></a>218. Algorithms do not use binary predicate objects for default comparisons</h3>
! <p><b>Section:</b> 25.4 [alg.sorting] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2000-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.sorting">issues</a> in [alg.sorting].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Many of the algorithms take an argument, pred, of template parameter type
  BinaryPredicate or an argument comp of template parameter type Compare. These
--- 2730,2739 ----
  
  <hr>
  <h3><a name="218"></a>218. Algorithms do not use binary predicate objects for default comparisons</h3>
! <p><b>Section:</b> 25.4 [alg.sorting] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2000-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.sorting">issues</a> in [alg.sorting].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Many of the algorithms take an argument, pred, of template parameter type
  BinaryPredicate or an argument comp of template parameter type Compare. These
*************** operator&lt;.</p>
*** 3648,3675 ****
  
  
  <hr>
! <h3><a name="219"></a>219. find algorithm missing version that takes a binary predicate argument</h3>
! <p><b>Section:</b> 25.2.5 [alg.find] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2000-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.find">issues</a> in [alg.find].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The find function always searches for a value using operator== to compare the
  value argument to each element in the input iterator range. This is inconsistent
! with other find-related functions such as find_end and find_first_of, which
  allow the caller to specify a binary predicate object to be used for determining
! equality. The fact that this can be accomplished using a combination of find_if
! and bind_1st or bind_2nd does not negate the desirability of a consistent,
! simple, alternative interface to find.</p>
  
  <p><i>[
  Summit:
  ]</i></p>
  
  
! <blockquote>
  Reopened by Alisdair.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
--- 2765,2792 ----
  
  
  <hr>
! <h3><a name="219"></a>219. <tt>find</tt> algorithm missing version that takes a binary predicate argument</h3>
! <p><b>Section:</b> 25.2.5 [alg.find] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2000-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.find">issues</a> in [alg.find].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The find function always searches for a value using <tt>operator==</tt> to compare the
  value argument to each element in the input iterator range. This is inconsistent
! with other find-related functions such as <tt>find_end</tt> and <tt>find_first_of</tt>, which
  allow the caller to specify a binary predicate object to be used for determining
! equality. The fact that this can be accomplished using a combination of <tt>find_if</tt>
! and <tt>bind_1st</tt> or <tt>bind_2nd</tt> does not negate the desirability of a consistent,
! simple, alternative interface to <tt>find</tt>.</p>
  
  <p><i>[
  Summit:
  ]</i></p>
  
  
! <blockquote><p>
  Reopened by Alisdair.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
*************** Reopened by Alisdair.
*** 3678,3684 ****
  
  <blockquote>
  <p>
! The same thing can be achieved using find_if (as noted in the issue).
  </p>
  <p>
  Moved to NAD.
--- 2795,2801 ----
  
  <blockquote>
  <p>
! The same thing can be achieved using <tt>find_if</tt> (as noted in the issue).
  </p>
  <p>
  Moved to NAD.
*************** follows:</p>
*** 3697,3730 ****
                           const T&amp; value, BinaryPredicate bin_pred);</pre>
  <p>Change the description of the return from:</p>
  <blockquote>
!   <p>Returns: The first iterator i in the range [first, last) for which the following corresponding
!   conditions hold: *i == value, pred(*i) != false. Returns last if no such iterator is found.</p>
  </blockquote>
  <p>&nbsp;to:</p>
  <blockquote>
!   <p>Returns: The first iterator i in the range [first, last) for which the following&nbsp;
!   corresponding condition holds: *i == value, bin_pred(*i,value) != false, pred(*)
!   != false. Return last if no such iterator is found.</p>
  </blockquote>
  </blockquote>
  
  
  <p><b>Rationale:</b></p>
  <p>This is request for a pure extension, so it is not a defect in the
! current standard.&nbsp; As the submitter pointed out, "this can
! be accomplished using a combination of find_if and bind_1st or
! bind_2nd".</p>
  
  
  
  
  <hr>
  <h3><a name="236"></a>236. ctype&lt;char&gt;::is() member modifies facet</h3>
! <p><b>Section:</b> 22.4.1.3.2 [facet.ctype.char.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 2000-04-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.ctype.char.members">issues</a> in [facet.ctype.char.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#28">28</a></p>
  <p><b>Discussion:</b></p>
  <p>The description of the <tt>is()</tt> member in paragraph 4 of 22.4.1.3.2 [facet.ctype.char.members] is broken: According to this description, the
  second form of the <tt>is()</tt> method modifies the masks in the
--- 2814,2847 ----
                           const T&amp; value, BinaryPredicate bin_pred);</pre>
  <p>Change the description of the return from:</p>
  <blockquote>
!   <p>Returns: The first iterator <tt>i</tt> in the range <tt>[first, last)</tt> for which the following corresponding
!   conditions hold: <tt>*i == value</tt>, <tt>pred(*i) != false</tt>. Returns <tt>last</tt> if no such iterator is found.</p>
  </blockquote>
  <p>&nbsp;to:</p>
  <blockquote>
!   <p>Returns: The first iterator <tt>i</tt> in the range <tt>[first, last)</tt> for which the following&nbsp;
!   corresponding condition holds: <tt>*i == value</tt>, <tt>bin_pred(*i,value) != false</tt>, <tt>pred(*)
!   != false</tt>. Return <tt>last</tt> if no such iterator is found.</p>
  </blockquote>
  </blockquote>
  
  
  <p><b>Rationale:</b></p>
  <p>This is request for a pure extension, so it is not a defect in the
! current standard.&nbsp; As the submitter pointed out, &quot;this can
! be accomplished using a combination of <tt>find_if</tt> and <tt>bind_1st</tt> or
! <tt>bind_2nd</tt>&quot;.</p>
  
  
  
  
  <hr>
  <h3><a name="236"></a>236. ctype&lt;char&gt;::is() member modifies facet</h3>
! <p><b>Section:</b> 22.4.1.3.2 [facet.ctype.char.members] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 2000-04-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.ctype.char.members">issues</a> in [facet.ctype.char.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#28">28</a></p>
  <p><b>Discussion:</b></p>
  <p>The description of the <tt>is()</tt> member in paragraph 4 of 22.4.1.3.2 [facet.ctype.char.members] is broken: According to this description, the
  second form of the <tt>is()</tt> method modifies the masks in the
*************** ie. the <tt>do_is()</tt> method as descr
*** 3754,3767 ****
  
  <hr>
  <h3><a name="244"></a>244. Must <tt>find</tt>'s third argument be CopyConstructible?</h3>
! <p><b>Section:</b> 25.2.5 [alg.find] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2000-05-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.find">issues</a> in [alg.find].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Is the following implementation of <tt>find</tt> acceptable?</p>
  
! <pre>        template&lt;class Iter, class X&gt;
          Iter find(Iter begin, Iter end, const X&amp; x)
          {
              X x1 = x;           // this is the crucial statement
--- 2871,2885 ----
  
  <hr>
  <h3><a name="244"></a>244. Must <tt>find</tt>'s third argument be CopyConstructible?</h3>
! <p><b>Section:</b> 25.2.5 [alg.find] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2000-05-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.find">issues</a> in [alg.find].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Is the following implementation of <tt>find</tt> acceptable?</p>
  
! <pre>
!         template&lt;class Iter, class X&gt;
          Iter find(Iter begin, Iter end, const X&amp; x)
          {
              X x1 = x;           // this is the crucial statement
*************** ie. the <tt>do_is()</tt> method as descr
*** 3774,3782 ****
  <p>If the answer is yes, then it is implementation-dependent as to
  whether the following fragment is well formed:</p>
  
! <pre>        vector&lt;string&gt; v;
  
!         find(v.begin(), v.end(), "foo");
  </pre>
  
  <p>At issue is whether there is a requirement that the third argument
--- 2892,2901 ----
  <p>If the answer is yes, then it is implementation-dependent as to
  whether the following fragment is well formed:</p>
  
! <pre>
!         vector&lt;string&gt; v;
  
!         find(v.begin(), v.end(), &quot;foo&quot;);
  </pre>
  
  <p>At issue is whether there is a requirement that the third argument
*************** might reasonably pass an argument that i
*** 3795,3809 ****
  
  <hr>
  <h3><a name="245"></a>245. Which operations on <tt>istream_iterator</tt> trigger input operations?</h3>
! <p><b>Section:</b> 24.6.1 [istream.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2000-05-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.iterator">issues</a> in [istream.iterator].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>I do not think the standard specifies what operation(s) on istream
  iterators trigger input operations.  So, for example:</p>
  
! <pre>        istream_iterator&lt;int&gt; i(cin);
  
          int n = *i++;
  </pre>
--- 2914,2929 ----
  
  <hr>
  <h3><a name="245"></a>245. Which operations on <tt>istream_iterator</tt> trigger input operations?</h3>
! <p><b>Section:</b> 24.6.1 [istream.iterator] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2000-05-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.iterator">issues</a> in [istream.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>I do not think the standard specifies what operation(s) on istream
  iterators trigger input operations.  So, for example:</p>
  
! <pre>
!         istream_iterator&lt;int&gt; i(cin);
  
          int n = *i++;
  </pre>
*************** how many times find may invoke operator+
*** 3828,3839 ****
  
  <hr>
  <h3><a name="246"></a>246. <tt>a.insert(p,t)</tt> is incorrectly specified</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Mark Rodgers <b>Opened:</b> 2000-05-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a></p>
  <p><b>Discussion:</b></p>
  <p>Closed issue 192 raised several problems with the specification of
  this function, but was rejected as Not A Defect because it was too big
--- 2948,2959 ----
  
  <hr>
  <h3><a name="246"></a>246. <tt>a.insert(p,t)</tt> is incorrectly specified</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Mark Rodgers <b>Opened:</b> 2000-05-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#233">233</a></p>
  <p><b>Discussion:</b></p>
  <p>Closed issue 192 raised several problems with the specification of
  this function, but was rejected as Not A Defect because it was too big
*************** and with little or no consequent impact.
*** 3894,3911 ****
  the following changes in the row for a.insert(p,t):</p>
  
  <p><i>assertion/note pre/post condition:</i>
! <br>Change the last sentence from</p>
       <blockquote><p>
!      "iterator p is a hint pointing to where the insert should
!      start to search."
       </p></blockquote>
  <p>to</p>
       <blockquote><p>
!      "iterator p is a hint indicating that immediately before p
!      may be a correct location where the insertion could occur."
       </p></blockquote>
  
! <p><i>complexity:</i><br>
  Change the words "right after" to "immediately before".</p>
  
  
--- 3014,3031 ----
  the following changes in the row for a.insert(p,t):</p>
  
  <p><i>assertion/note pre/post condition:</i>
! <br/>Change the last sentence from</p>
       <blockquote><p>
!      &quot;iterator p is a hint pointing to where the insert should
!      start to search.&quot;
       </p></blockquote>
  <p>to</p>
       <blockquote><p>
!      &quot;iterator p is a hint indicating that immediately before p
!      may be a correct location where the insertion could occur.&quot;
       </p></blockquote>
  
! <p><i>complexity:</i><br/>
  Change the words "right after" to "immediately before".</p>
  
  
*************** Change the words "right after" to "immed
*** 3917,3938 ****
  
  <hr>
  <h3><a name="249"></a>249. Return Type of <tt>auto_ptr::operator=</tt></h3>
! <p><b>Section:</b> D.12.1 [auto.ptr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Joseph Gottman <b>Opened:</b> 2000-06-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>According to section 20.4.5, the function
  <tt>auto_ptr::operator=()</tt> returns a reference to an auto_ptr.
  The reason that <tt>operator=()</tt> usually returns a reference is to
  facilitate code like</p>
  
! <pre>    int x,y,z;
      x = y = z = 1;
  </pre>
  
  <p>However, given analogous code for <tt>auto_ptr</tt>s,</p>
! <pre>    auto_ptr&lt;int&gt; x, y, z;
      z.reset(new int(1));
      x = y = z;
  </pre>
--- 3037,3060 ----
  
  <hr>
  <h3><a name="249"></a>249. Return Type of <tt>auto_ptr::operator=</tt></h3>
! <p><b>Section:</b> X [auto.ptr] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Joseph Gottman <b>Opened:</b> 2000-06-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>According to section 20.4.5, the function
  <tt>auto_ptr::operator=()</tt> returns a reference to an auto_ptr.
  The reason that <tt>operator=()</tt> usually returns a reference is to
  facilitate code like</p>
  
! <pre>
!     int x,y,z;
      x = y = z = 1;
  </pre>
  
  <p>However, given analogous code for <tt>auto_ptr</tt>s,</p>
! <pre>
!     auto_ptr&lt;int&gt; x, y, z;
      z.reset(new int(1));
      x = y = z;
  </pre>
*************** code.</p>
*** 3958,4073 ****
  
  
  <hr>
- <h3><a name="255"></a>255. Why do <tt>basic_streambuf&lt;&gt;::pbump()</tt> and <tt>gbump()</tt> take an int?</h3>
- <p><b>Section:</b> 27.6.2 [streambuf] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-08-12 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#streambuf">issues</a> in [streambuf].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- The basic_streambuf members gbump() and pbump() are specified to take an
- int argument. This requirement prevents the functions from effectively
- manipulating buffers larger than std::numeric_limits&lt;int&gt;::max()
- characters. It also makes the common use case for these functions
- somewhat difficult as many compilers will issue a warning when an
- argument of type larger than int (such as ptrdiff_t on LLP64
- architectures) is passed to either of the function. Since it's often the
- result of the subtraction of two pointers that is passed to the
- functions, a cast is necessary to silence such warnings. Finally, the
- usage of a native type in the functions signatures is inconsistent with
- other member functions (such as sgetn() and sputn()) that manipulate the
- underlying character buffer. Those functions take a streamsize argument.
- </p>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- This is part of a bigger problem. If anyone cares enough, they should
- write a paper solving the bigger problem of offset types in iostreams.
- </p>
- <p>
- This is related to the paper about large file sizes. Beman has already
- agreed to drop the section of that paper that deals with this.
- </p>
- <p>
- int is big enough for reasonable buffers.
- </p>
- <p>
- Move to NAD Future.
- </p>
- <p>
- This is related to LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#423">423</a>.
- </p>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change the signatures of these functions in the synopsis of template
- class basic_streambuf (27.5.2) and in their descriptions (27.5.2.3.1, p4
- and 27.5.2.3.2, p4) to take a streamsize argument.
- </p>
- 
- <p>
- Although this change has the potential of changing the ABI of the
- library, the change will affect only platforms where int is different
- than the definition of streamsize. However, since both functions are
- typically inline (they are on all known implementations), even on such
- platforms the change will not affect any user code unless it explicitly
- relies on the existing type of the functions (e.g., by taking their
- address). Such a possibility is IMO quite remote.
- </p>
- 
- <p>
- Alternate Suggestion from Howard Hinnant, c++std-lib-7780:
- </p>
- 
- <p>
- This is something of a nit, but I'm wondering if streamoff wouldn't be a 
- better choice than streamsize.  The argument to pbump and gbump MUST be 
- signed.  But the standard has this to say about streamsize 
- (27.4.1/2/Footnote):
- </p>
- 
- <blockquote><p>
-      [Footnote: streamsize is used in most places where ISO C would use
-      size_t.  Most of the uses of streamsize could use size_t, except for
-      the strstreambuf constructors, which require negative values. It
-      should probably be the signed type corresponding to size_t (which is
-      what Posix.2 calls ssize_t). --- end footnote]
- </p></blockquote>
- 
- <p>
- This seems a little weak for the argument to pbump and gbump.  Should we 
- ever really get rid of strstream, this footnote might go with it, along 
- with the reason to make streamsize signed.
- </p>
- 
- 
- <p><b>Rationale:</b></p>
- <p>The LWG believes this change is too big for now.  We may wish to
- reconsider this for a future revision of the standard.  One
- possibility is overloading pbump, rather than changing the
- signature.</p>
- <p><i>[
- [2006-05-04: Reopened at the request of Chris (Krzysztof ?elechowski)]
- ]</i></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="257"></a>257. STL functional object and iterator inheritance.</h3>
! <p><b>Section:</b> X [base], 24.4.2 [iterator.basic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Robert Dick  <b>Opened:</b> 2000-08-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#base">issues</a> in [base].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to the November 1997 Draft Standard, the results of deleting an
--- 3080,3090 ----
  
  
  <hr>
  <h3><a name="257"></a>257. STL functional object and iterator inheritance.</h3>
! <p><b>Section:</b> X [depr.base], 24.4.2 [iterator.basic] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Robert Dick  <b>Opened:</b> 2000-08-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.base">issues</a> in [depr.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to the November 1997 Draft Standard, the results of deleting an
*************** potentially dangerous to publicly inheri
*** 4077,4090 ****
  </p>
  
  <p>Defect:
! <br>
  The STL design encourages users to publicly inherit from a number of classes
  which do nothing but specify interfaces, and which contain non-virtual
  destructors.
  </p>
  
  <p>Attribution:
! <br>
  Wil Evers and William E. Kempf suggested this modification for functional
  objects.
  </p>
--- 3094,3107 ----
  </p>
  
  <p>Defect:
! <br/>
  The STL design encourages users to publicly inherit from a number of classes
  which do nothing but specify interfaces, and which contain non-virtual
  destructors.
  </p>
  
  <p>Attribution:
! <br/>
  Wil Evers and William E. Kempf suggested this modification for functional
  objects.
  </p>
*************** or space penalties (on any implementatio
*** 4103,4109 ****
  As an example, replace...
  </p>
  
! <pre>    template &lt;class Arg, class Result&gt;
      struct unary_function {
              typedef Arg    argument_type;
              typedef Result result_type;
--- 3120,3127 ----
  As an example, replace...
  </p>
  
! <pre>
!     template &lt;class Arg, class Result&gt;
      struct unary_function {
              typedef Arg    argument_type;
              typedef Result result_type;
*************** As an example, replace...
*** 4114,4120 ****
  ... with...
  </p>
  
! <pre>    template &lt;class Arg, class Result&gt;
      struct unary_function {
              typedef Arg    argument_type;
              typedef Result result_type;
--- 3132,3139 ----
  ... with...
  </p>
  
! <pre>
!     template &lt;class Arg, class Result&gt;
      struct unary_function {
              typedef Arg    argument_type;
              typedef Result result_type;
*************** As an example, replace...
*** 4125,4133 ****
  
  <p>
  Affected definitions:
! <br>
    &nbsp;20.3.1 [lib.function.objects] -- unary_function, binary_function
!   <br>
    &nbsp;24.3.2 [lib.iterator.basic] -- iterator
  </p>
  
--- 3144,3152 ----
  
  <p>
  Affected definitions:
! <br/>
    &nbsp;20.3.1 [lib.function.objects] -- unary_function, binary_function
!   <br/>
    &nbsp;24.3.2 [lib.iterator.basic] -- iterator
  </p>
  
*************** want to pass temporaries as traits or ta
*** 4148,4157 ****
  
  <hr>
  <h3><a name="267"></a>267. interaction of strstreambuf::overflow() and seekoff()</h3>
! <p><b>Section:</b> D.9.1.3 [depr.strstreambuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-10-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#depr.strstreambuf.virtuals">issues</a> in [depr.strstreambuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It appears that the interaction of the strstreambuf members overflow()
--- 3167,3176 ----
  
  <hr>
  <h3><a name="267"></a>267. interaction of strstreambuf::overflow() and seekoff()</h3>
! <p><b>Section:</b> D.7.1.3 [depr.strstreambuf.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-10-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.strstreambuf.virtuals">issues</a> in [depr.strstreambuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It appears that the interaction of the strstreambuf members overflow()
*************** behavior could reasonably be expected. T
*** 4160,4166 ****
  demonstrates this behavior:
  </p>
  
! <pre>    #include &lt;strstream&gt;
  
      int main ()
      {
--- 3179,3186 ----
  demonstrates this behavior:
  </p>
  
! <pre>
!     #include &lt;strstream&gt;
  
      int main ()
      {
*************** behavior of the program is undefined.
*** 4212,4218 ****
  <p><b>Proposed resolution:</b></p>
  
  
!    <p>Change the last sentence of D.9.1 [depr.strstreambuf] paragraph 4 from</p>
  
        <blockquote><p>
        Otherwise, seeklow equals gbeg and seekhigh is either pend, if
--- 3232,3238 ----
  <p><b>Proposed resolution:</b></p>
  
  
!    <p>Change the last sentence of D.7.1 [depr.strstreambuf] paragraph 4 from</p>
  
        <blockquote><p>
        Otherwise, seeklow equals gbeg and seekhigh is either pend, if
*************** behavior of the program is undefined.
*** 4241,4248 ****
  
  
  <p><b>Rationale:</b></p>
! <p>This is related to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#65">65</a>: it's not clear what it
! means to seek beyond the current area.  Without resolving issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#65">65</a> we can't resolve this.  As with issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#65">65</a>, 
  the library working group does not wish to invest time nailing down
  corner cases in a deprecated feature.</p>
  
--- 3261,3268 ----
  
  
  <p><b>Rationale:</b></p>
! <p>This is related to issue <a href="lwg-closed.html#65">65</a>: it's not clear what it
! means to seek beyond the current area.  Without resolving issue <a href="lwg-closed.html#65">65</a> we can't resolve this.  As with issue <a href="lwg-closed.html#65">65</a>, 
  the library working group does not wish to invest time nailing down
  corner cases in a deprecated feature.</p>
  
*************** corner cases in a deprecated feature.</p
*** 4252,4267 ****
  
  <hr>
  <h3><a name="269"></a>269. cstdarg and unnamed parameters</h3>
! <p><b>Section:</b> 18.8 [support.exception] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> J. Stephen Adamczyk <b>Opened:</b> 2000-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.exception">issues</a> in [support.exception].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  One of our customers asks whether this is valid C++:
  </p>
  
! <pre>   #include &lt;cstdarg&gt;
  
     void bar(const char *, va_list);
  
--- 3272,3288 ----
  
  <hr>
  <h3><a name="269"></a>269. cstdarg and unnamed parameters</h3>
! <p><b>Section:</b> 18.8 [support.exception] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> J. Stephen Adamczyk <b>Opened:</b> 2000-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.exception">issues</a> in [support.exception].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  One of our customers asks whether this is valid C++:
  </p>
  
! <pre>
!    #include &lt;cstdarg&gt;
  
     void bar(const char *, va_list);
  
*************** One of our customers asks whether this i
*** 4277,4286 ****
  
  <p>
  The issue being whether it is valid to use cstdarg when the final
! parameter before the "..." is unnamed.  cstdarg is, as far
  as I can tell, inherited verbatim from the C standard. and the
! definition there (7.8.1.1 in the ISO C89 standard) refers to "the
! identifier of the rightmost parameter".  What happens when there
  is no such identifier?
  </p>
  
--- 3298,3307 ----
  
  <p>
  The issue being whether it is valid to use cstdarg when the final
! parameter before the &quot;...&quot; is unnamed.  cstdarg is, as far
  as I can tell, inherited verbatim from the C standard. and the
! definition there (7.8.1.1 in the ISO C89 standard) refers to &quot;the
! identifier of the rightmost parameter&quot;.  What happens when there
  is no such identifier?
  </p>
  
*************** might be required in the C++ standard.
*** 4293,4299 ****
  <p><b>Rationale:</b></p>
  <p>
  Not a defect, the C and C++ standards are clear.  It is impossible to
! use varargs if the parameter immediately before "..." has no
  name, because that is the parameter that must be passed to va_start.
  The example given above is broken, because va_start is being passed
  the wrong parameter.
--- 3314,3320 ----
  <p><b>Rationale:</b></p>
  <p>
  Not a defect, the C and C++ standards are clear.  It is impossible to
! use varargs if the parameter immediately before &quot;...&quot; has no
  name, because that is the parameter that must be passed to va_start.
  The example given above is broken, because va_start is being passed
  the wrong parameter.
*************** necessary.
*** 4313,4328 ****
  
  <hr>
  <h3><a name="277"></a>277. Normative encouragement in allocator requirements unclear</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-11-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.1.5, paragraph 5, the standard says that "Implementors are
  encouraged to supply libraries that can accept allocators that
  encapsulate more general memory models and that support non-equal
! instances." This is intended as normative encouragement to
  standard library implementors.  However, it is possible to interpret
  this sentence as applying to nonstandard third-party libraries.
  </p>
--- 3334,3350 ----
  
  <hr>
  <h3><a name="277"></a>277. Normative encouragement in allocator requirements unclear</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-11-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.1.5, paragraph 5, the standard says that &quot;Implementors are
  encouraged to supply libraries that can accept allocators that
  encapsulate more general memory models and that support non-equal
! instances.&quot; This is intended as normative encouragement to
  standard library implementors.  However, it is possible to interpret
  this sentence as applying to nonstandard third-party libraries.
  </p>
*************** this sentence as applying to nonstandard
*** 4330,4338 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.1.5, paragraph 5, change "Implementors" to
! "Implementors of the library described in this International
! Standard".
  </p>
  
  
--- 3352,3360 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.1.5, paragraph 5, change &quot;Implementors&quot; to
! &quot;Implementors of the library described in this International
! Standard&quot;.
  </p>
  
  
*************** even if it is misunderstood.</p>
*** 4347,4367 ****
  
  <hr>
  <h3><a name="279"></a>279. const and non-const iterators should have equivalent typedefs</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Cleary <b>Opened:</b> 2000-11-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  This came from an email from Steve Cleary to Fergus in reference to
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#179">179</a>. The library working group briefly discussed
  this in Toronto and believes it should be a separate issue.
  </p>
  
  <p>
! Steve said: "We may want to state that the const/non-const iterators must have
! the same difference type, size_type, and category."
  </p>
  
  <p>
--- 3369,3390 ----
  
  <hr>
  <h3><a name="279"></a>279. const and non-const iterators should have equivalent typedefs</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Cleary <b>Opened:</b> 2000-11-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  This came from an email from Steve Cleary to Fergus in reference to
! issue <a href="lwg-defects.html#179">179</a>. The library working group briefly discussed
  this in Toronto and believes it should be a separate issue.
  </p>
  
  <p>
! Steve said: &quot;We may want to state that the const/non-const iterators must have
! the same difference type, size_type, and category.&quot;
  </p>
  
  <p>
*************** does not see this as a defect: it's poss
*** 4406,4412 ****
  it would be useful for the categories to be different.</p>
  
  <p>It may be desirable to require X::iterator and X::const_iterator to
! have the same value type, but that is a new issue. (Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#322">322</a>.)</p>
  
  
  
--- 3429,3435 ----
  it would be useful for the categories to be different.</p>
  
  <p>It may be desirable to require X::iterator and X::const_iterator to
! have the same value type, but that is a new issue. (Issue <a href="lwg-defects.html#322">322</a>.)</p>
  
  
  
*************** have the same value type, but that is a
*** 4415,4428 ****
  
  <hr>
  <h3><a name="287"></a>287. conflicting ios_base fmtflags</h3>
! <p><b>Section:</b> 27.5.2.2 [fmtflags.state] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-12-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fmtflags.state">issues</a> in [fmtflags.state].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The Effects clause for ios_base::setf(fmtflags fmtfl) says
! "Sets fmtfl in flags()".  What happens if the user first calls
  ios_base::scientific and then calls ios_base::fixed or vice-versa?
  This is an issue for all of the conflicting flags, i.e. ios_base::left
  and ios_base::right or ios_base::dec, ios_base::hex and ios_base::oct.
--- 3438,3451 ----
  
  <hr>
  <h3><a name="287"></a>287. conflicting ios_base fmtflags</h3>
! <p><b>Section:</b> 27.5.3.2 [fmtflags.state] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-12-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fmtflags.state">issues</a> in [fmtflags.state].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The Effects clause for ios_base::setf(fmtflags fmtfl) says
! &quot;Sets fmtfl in flags()&quot;.  What happens if the user first calls
  ios_base::scientific and then calls ios_base::fixed or vice-versa?
  This is an issue for all of the conflicting flags, i.e. ios_base::left
  and ios_base::right or ios_base::dec, ios_base::hex and ios_base::oct.
*************** flag with one previously explicitly set.
*** 4438,4444 ****
  supposed to set ios_base::dec (see discussion below), then
  the user setting hex or oct format after construction will not
  set failbit. </li>
! <li>The last call to setf "wins", i.e. it clears any conflicting
  previous setting.</li>
  <li>All the flags that the user specifies are set, but when actually 
  interpreting them, fixed always override scientific, right always 
--- 3461,3467 ----
  supposed to set ios_base::dec (see discussion below), then
  the user setting hex or oct format after construction will not
  set failbit. </li>
! <li>The last call to setf &quot;wins&quot;, i.e. it clears any conflicting
  previous setting.</li>
  <li>All the flags that the user specifies are set, but when actually 
  interpreting them, fixed always override scientific, right always 
*************** version of <tt>setf</tt>, to avoid unexp
*** 4484,4493 ****
  
  <hr>
  <h3><a name="289"></a>289. &lt;cmath&gt; requirements missing C float and long double versions</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-12-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
      In ISO/IEC 9899:1990 Programming Languages C we find the following
--- 3507,3517 ----
  
  <hr>
  <h3><a name="289"></a>289. &lt;cmath&gt; requirements missing C float and long double versions</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-12-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
      In ISO/IEC 9899:1990 Programming Languages C we find the following
*************** version of <tt>setf</tt>, to avoid unexp
*** 4496,4502 ****
  
  <blockquote><p>
           7.13.4 Mathematics &lt;math.h&gt;
!          <br>
           The names of all existing functions declared in the &lt;math.h&gt;
           header, suffixed with f or l, are reserved respectively for
           corresponding functions with float and long double arguments
--- 3520,3526 ----
  
  <blockquote><p>
           7.13.4 Mathematics &lt;math.h&gt;
!          <br/>
           The names of all existing functions declared in the &lt;math.h&gt;
           header, suffixed with f or l, are reserved respectively for
           corresponding functions with float and long double arguments
*************** Add these Functions to Table 80, section
*** 4525,4531 ****
  section C.2:
  </p>
  
! <pre>    acosf asinf atanf atan2f ceilf cosf coshf 
      expf fabsf floorf fmodf frexpf ldexpf 
      logf log10f modff powf sinf sinhf sqrtf 
      tanf tanhf 
--- 3549,3556 ----
  section C.2:
  </p>
  
! <pre>
!     acosf asinf atanf atan2f ceilf cosf coshf 
      expf fabsf floorf fmodf frexpf ldexpf 
      logf log10f modff powf sinf sinhf sqrtf 
      tanf tanhf 
*************** never referred to by the C++ standard.</
*** 4555,4572 ****
  
  <hr>
  <h3><a name="290"></a>290. Requirements to for_each and its function object</h3>
! <p><b>Section:</b> 25.2.4 [alg.foreach] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2001-01-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.foreach">issues</a> in [alg.foreach].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The specification of the for_each algorithm does not have a
! "Requires" section, which means that there are no
  restrictions imposed on the function object whatsoever. In essence it
  means that I can provide any function object with arbitrary side
  effects and I can still expect a predictable result. In particular I
  can expect that the function object is applied exactly last - first
! times, which is promised in the "Complexity" section.
  </p>
  
  <p>I don't see how any implementation can give such a guarantee
--- 3580,3597 ----
  
  <hr>
  <h3><a name="290"></a>290. Requirements to for_each and its function object</h3>
! <p><b>Section:</b> 25.2.4 [alg.foreach] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2001-01-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.foreach">issues</a> in [alg.foreach].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The specification of the for_each algorithm does not have a
! &quot;Requires&quot; section, which means that there are no
  restrictions imposed on the function object whatsoever. In essence it
  means that I can provide any function object with arbitrary side
  effects and I can still expect a predictable result. In particular I
  can expect that the function object is applied exactly last - first
! times, which is promised in the &quot;Complexity&quot; section.
  </p>
  
  <p>I don't see how any implementation can give such a guarantee
*************** of the library.
*** 4618,4634 ****
  
  <hr>
  <h3><a name="293"></a>293. Order of execution in transform algorithm</h3>
! <p><b>Section:</b> 25.3.4 [alg.transform] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2001-01-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.transform">issues</a> in [alg.transform].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This issue is related to issue 242.  In case that the resolution
  proposed for issue 242 is accepted, we have have the following
  situation: The 4 numeric algorithms (accumulate and consorts) as well
  as transform would allow a certain category of side effects.  The
! numeric algorithms specify that they invoke the functor "for
! every iterator i in the range [first, last) in order". transform,
  in contrast, would not give any guarantee regarding order of
  invocation of the functor, which means that the functor can be invoked
  in any arbitrary order.
--- 3643,3659 ----
  
  <hr>
  <h3><a name="293"></a>293. Order of execution in transform algorithm</h3>
! <p><b>Section:</b> 25.3.4 [alg.transform] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2001-01-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.transform">issues</a> in [alg.transform].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This issue is related to issue 242.  In case that the resolution
  proposed for issue 242 is accepted, we have have the following
  situation: The 4 numeric algorithms (accumulate and consorts) as well
  as transform would allow a certain category of side effects.  The
! numeric algorithms specify that they invoke the functor &quot;for
! every iterator i in the range [first, last) in order&quot;. transform,
  in contrast, would not give any guarantee regarding order of
  invocation of the functor, which means that the functor can be invoked
  in any arbitrary order.
*************** in any arbitrary order.
*** 4636,4647 ****
  
  <p>Why would that be a problem?  Consider an example: say the
  transformator that is a simple enumerator ( or more generally
! speaking, "is order-sensitive" ).  Since a standard
  compliant implementation of transform is free to invoke the enumerator
  in no definite order, the result could be a garbled enumeration.
  Strictly speaking this is not a problem, but it is certainly at odds
  with the prevalent understanding of transform as an algorithms that
! assigns "a new _corresponding_ value" to the output
  elements.
  </p>
  
--- 3661,3672 ----
  
  <p>Why would that be a problem?  Consider an example: say the
  transformator that is a simple enumerator ( or more generally
! speaking, &quot;is order-sensitive&quot; ).  Since a standard
  compliant implementation of transform is free to invoke the enumerator
  in no definite order, the result could be a garbled enumeration.
  Strictly speaking this is not a problem, but it is certainly at odds
  with the prevalent understanding of transform as an algorithms that
! assigns &quot;a new _corresponding_ value&quot; to the output
  elements.
  </p>
  
*************** wrapping it in an Input Iterator adaptor
*** 4687,4722 ****
  
  <hr>
  <h3><a name="299"></a>299. Incorrect return types for iterator dereference</h3>
! <p><b>Section:</b> 24.2.6 [bidirectional.iterators], 24.2.7 [random.access.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> John Potter <b>Opened:</b> 2001-01-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bidirectional.iterators">issues</a> in [bidirectional.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In section 24.2.6 [bidirectional.iterators],
! Table 75 gives the return type of *r-- as convertible to T.  This is
! not consistent with Table 74 which gives the return type of *r++ as
! T&amp;.  *r++ = t is valid while *r-- = t is invalid.
  </p>
  
  <p>
  In section 24.2.7 [random.access.iterators],
! Table 76 gives the return type of a[n] as convertible to T.  This is
! not consistent with the semantics of *(a + n) which returns T&amp; by
! Table 74.  *(a + n) = t is valid while a[n] = t is invalid.
  </p>
  
  <p>
  Discussion from the Copenhagen meeting: the first part is
! uncontroversial.  The second part, operator[] for Random Access
  Iterators, requires more thought.  There are reasonable arguments on
! both sides.  Return by value from operator[] enables some potentially
  useful iterators, e.g. a random access "iota iterator" (a.k.a
  "counting iterator" or "int iterator").  There isn't any obvious way
  to do this with return-by-reference, since the reference would be to a
  temporary.  On the other hand, <tt>reverse_iterator</tt> takes an
  arbitrary Random Access Iterator as template argument, and its
! operator[] returns by reference.  If we decided that the return type
  in Table 76 was correct, we would have to change
  <tt>reverse_iterator</tt>.  This change would probably affect user
  code.
--- 3712,3747 ----
  
  <hr>
  <h3><a name="299"></a>299. Incorrect return types for iterator dereference</h3>
! <p><b>Section:</b> 24.2.6 [bidirectional.iterators], 24.2.7 [random.access.iterators] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> John Potter <b>Opened:</b> 2001-01-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bidirectional.iterators">issues</a> in [bidirectional.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In section 24.2.6 [bidirectional.iterators],
! Table 75 gives the return type of <tt>*r--</tt> as convertible to <tt>T</tt>.  This is
! not consistent with Table 74 which gives the return type of <tt>*r++</tt> as
! <tt>T&amp;</tt>.  <tt>*r++ = t</tt> is valid while <tt>*r-- = t</tt> is invalid.
  </p>
  
  <p>
  In section 24.2.7 [random.access.iterators],
! Table 76 gives the return type of <tt>a[n]</tt> as convertible to <tt>T</tt>.  This is
! not consistent with the semantics of <tt>*(a + n)</tt> which returns <tt>T&amp;</tt> by
! Table 74.  <tt>*(a + n) = t</tt> is valid while <tt>a[n] = t</tt> is invalid.
  </p>
  
  <p>
  Discussion from the Copenhagen meeting: the first part is
! uncontroversial.  The second part, <tt>operator[]</tt> for Random Access
  Iterators, requires more thought.  There are reasonable arguments on
! both sides.  Return by value from <tt>operator[]</tt> enables some potentially
  useful iterators, e.g. a random access "iota iterator" (a.k.a
  "counting iterator" or "int iterator").  There isn't any obvious way
  to do this with return-by-reference, since the reference would be to a
  temporary.  On the other hand, <tt>reverse_iterator</tt> takes an
  arbitrary Random Access Iterator as template argument, and its
! <tt>operator[]</tt> returns by reference.  If we decided that the return type
  in Table 76 was correct, we would have to change
  <tt>reverse_iterator</tt>.  This change would probably affect user
  code.
*************** Random Access Iterator requirements has
*** 4728,4739 ****
  stage.  In both the STL proposal adopted by the committee
  (N0527==94-0140) and the STL technical report (HPL-95-11 (R.1), by
  Stepanov and Lee), the Random Access Iterator requirements say that
! operator[]'s return value is "convertible to T".  In N0527
! reverse_iterator's operator[] returns by value, but in HPL-95-11
  (R.1), and in the STL implementation that HP released to the public,
! reverse_iterator's operator[] returns by reference.  In 1995, the
  standard was amended to reflect the contents of HPL-95-11 (R.1).  The
! original intent for operator[] is unclear.
  </p>
  
  <p>
--- 3753,3764 ----
  stage.  In both the STL proposal adopted by the committee
  (N0527==94-0140) and the STL technical report (HPL-95-11 (R.1), by
  Stepanov and Lee), the Random Access Iterator requirements say that
! <tt>operator[]</tt>'s return value is "convertible to <tt>T</tt>".  In N0527
! reverse_iterator's <tt>operator[]</tt> returns by value, but in HPL-95-11
  (R.1), and in the STL implementation that HP released to the public,
! reverse_iterator's <tt>operator[]</tt> returns by reference.  In 1995, the
  standard was amended to reflect the contents of HPL-95-11 (R.1).  The
! original intent for <tt>operator[]</tt> is unclear.
  </p>
  
  <p>
*************** Note that the compromise resolution nece
*** 4767,4773 ****
  Note also there is one kind of mutable random access iterator that
  will no longer meet the new requirements. Currently, iterators that
  return an r-value from <tt>operator[]</tt> meet the requirements for a
! mutable random access iterartor, even though the expression <tt>a[n] =
  t</tt> will only modify a temporary that goes away. With this proposed
  resolution, <tt>a[n] = t</tt> will be required to have the same
  operational semantics as <tt>*(a + n) = t</tt>.
--- 3792,3798 ----
  Note also there is one kind of mutable random access iterator that
  will no longer meet the new requirements. Currently, iterators that
  return an r-value from <tt>operator[]</tt> meet the requirements for a
! mutable random access iterator, even though the expression <tt>a[n] =
  t</tt> will only modify a temporary that goes away. With this proposed
  resolution, <tt>a[n] = t</tt> will be required to have the same
  operational semantics as <tt>*(a + n) = t</tt>.
*************** operational semantics as <tt>*(a + n) =
*** 4785,4791 ****
  
  <blockquote>
  <p>
! Why can't we write through the reference returned from operator[] on a
  random access iterator?
  </p>
  
--- 3810,3816 ----
  
  <blockquote>
  <p>
! Why can't we write through the reference returned from <tt>operator[]</tt> on a
  random access iterator?
  </p>
  
*************** Recommended solution:
*** 4794,4806 ****
  </p>
  
  <p>
! In table Table 104 -- Random access iterator requirements, replace
  </p>
  
! <blockquote>
! a[n] : convertible to <del><tt>const T &amp;</tt></del>
  <ins><tt>T&amp;</tt> if <tt>X</tt> is mutable, otherwise convertible to <tt>const T&amp;</tt></ins>
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 3819,3831 ----
  </p>
  
  <p>
! In table Table 104 &mdash; Random access iterator requirements, replace
  </p>
  
! <blockquote><p>
! <tt>a[n]</tt> : convertible to <del><tt>const T &amp;</tt></del>
  <ins><tt>T&amp;</tt> if <tt>X</tt> is mutable, otherwise convertible to <tt>const T&amp;</tt></ins>
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** a[n] : convertible to <del><tt>const T &
*** 4808,4816 ****
  ]</i></p>
  
  
! <blockquote>
  Leave Open. Alisdair to spearhead a paper on revivification.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
--- 3833,3841 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave Open. Alisdair to spearhead a paper on revivification.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
*************** Solved by
*** 4830,4844 ****
  
  <p>
  In section 24.1.4 [lib.bidirectdional.iterators], change the return
! type in table 75 from "convertible to <tt>T</tt>" to
  <tt>T&amp;</tt>.
  </p>
  
  <p>
  In section 24.1.5 [lib.random.access.iterators], change the
! operational semantics for <tt>a[n]</tt> to " the r-value of
  <tt>a[n]</tt> is equivalent to the r-value of <tt>*(a +
! n)</tt>". Add a new row in the table for the expression <tt>a[n] = t</tt>
  with a return type of convertible to <tt>T</tt> and operational semantics of
  <tt>*(a + n) = t</tt>.
  </p>
--- 3855,3869 ----
  
  <p>
  In section 24.1.4 [lib.bidirectdional.iterators], change the return
! type in table 75 from &quot;convertible to <tt>T</tt>&quot; to
  <tt>T&amp;</tt>.
  </p>
  
  <p>
  In section 24.1.5 [lib.random.access.iterators], change the
! operational semantics for <tt>a[n]</tt> to &quot; the r-value of
  <tt>a[n]</tt> is equivalent to the r-value of <tt>*(a +
! n)</tt>&quot;. Add a new row in the table for the expression <tt>a[n] = t</tt>
  with a return type of convertible to <tt>T</tt> and operational semantics of
  <tt>*(a + n) = t</tt>.
  </p>
*************** San Francisco:
*** 4855,4864 ****
  ]</i></p>
  
  
! <blockquote>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2758.pdf">N2758</a>.
! </blockquote>
  
  
  
--- 3880,3889 ----
  ]</i></p>
  
  
! <blockquote><p>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2758.pdf">N2758</a>.
! </p></blockquote>
  
  
  
*************** Solved by
*** 4868,4882 ****
  
  <hr>
  <h3><a name="302"></a>302. Need error indication from codecvt&lt;&gt;::do_length</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gregory Bumgardner <b>Opened:</b> 2001-01-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The effects of <tt>codecvt&lt;&gt;::do_length()</tt> are described in
  22.2.1.5.2, paragraph 10.  As implied by that paragraph, and clarified
! in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#75">75</a>, <tt>codecvt&lt;&gt;::do_length()</tt> must
  process the source data and update the <tt>stateT</tt> argument just
  as if the data had been processed by <tt>codecvt&lt;&gt;::in()</tt>.
  However, the standard does not specify how <tt>do_length()</tt> would
--- 3893,3907 ----
  
  <hr>
  <h3><a name="302"></a>302. Need error indication from codecvt&lt;&gt;::do_length</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gregory Bumgardner <b>Opened:</b> 2001-01-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The effects of <tt>codecvt&lt;&gt;::do_length()</tt> are described in
  22.2.1.5.2, paragraph 10.  As implied by that paragraph, and clarified
! in issue <a href="lwg-defects.html#75">75</a>, <tt>codecvt&lt;&gt;::do_length()</tt> must
  process the source data and update the <tt>stateT</tt> argument just
  as if the data had been processed by <tt>codecvt&lt;&gt;::in()</tt>.
  However, the standard does not specify how <tt>do_length()</tt> would
*************** untranslatable or illegal character sequ
*** 4885,4891 ****
  </p>
  
  <p>
! The other conversion methods return an "error" result value
  to indicate that an untranslatable character has been encountered, but
  <tt>do_length()</tt> already has a return value (the number of source
  characters that have been processed by the method).
--- 3910,3916 ----
  </p>
  
  <p>
! The other conversion methods return an &quot;error&quot; result value
  to indicate that an untranslatable character has been encountered, but
  <tt>do_length()</tt> already has a return value (the number of source
  characters that have been processed by the method).
*************** character sequence. This argument would
*** 4907,4913 ****
  allow it to be ignored:
  </p>
  
! <pre>  int length(stateT&amp; state, 
               const externT* from, 
               const externT* from_end, 
               size_t max,
--- 3932,3939 ----
  allow it to be ignored:
  </p>
  
! <pre>
!   int length(stateT&amp; state, 
               const externT* from, 
               const externT* from_end, 
               size_t max,
*************** external characters, it stops.</p>
*** 4939,4951 ****
  
  <hr>
  <h3><a name="304"></a>304. Must <tt>*a</tt> return an lvalue when <tt>a</tt> is an input iterator?</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2001-02-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! We all "know" that input iterators are allowed to produce
  values when dereferenced of which there is no other in-memory copy.
  </p>
  
--- 3965,3977 ----
  
  <hr>
  <h3><a name="304"></a>304. Must <tt>*a</tt> return an lvalue when <tt>a</tt> is an input iterator?</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2001-02-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! We all &quot;know&quot; that input iterators are allowed to produce
  values when dereferenced of which there is no other in-memory copy.
  </p>
  
*************** the case if the value_type has no member
*** 4956,4969 ****
  
  <p>The problem occurs in the following entry:</p>
  
! <pre>  a-&gt;m     pre: (*a).m is well-defined
             Equivalent to (*a).m
  </pre>
  
  <p>
  <tt>*a.m</tt> can be well-defined if <tt>*a</tt> is not a reference
! type, but since <tt>operator-&gt;()</tt> must return a pointer for
! <tt>a-&gt;m</tt> to be well-formed, it needs something to return a
  pointer <i>to</i>. This seems to indicate that <tt>*a</tt> must be
  buffered somewhere to make a legal input iterator.
  </p>
--- 3982,3996 ----
  
  <p>The problem occurs in the following entry:</p>
  
! <pre>
!   a->m     pre: (*a).m is well-defined
             Equivalent to (*a).m
  </pre>
  
  <p>
  <tt>*a.m</tt> can be well-defined if <tt>*a</tt> is not a reference
! type, but since <tt>operator->()</tt> must return a pointer for
! <tt>a->m</tt> to be well-formed, it needs something to return a
  pointer <i>to</i>. This seems to indicate that <tt>*a</tt> must be
  buffered somewhere to make a legal input iterator.
  </p>
*************** buffered somewhere to make a legal input
*** 4974,4980 ****
  <p><b>Rationale:</b></p>
  <p>The current standard is clear and consistent.  Input iterators that
    return rvalues are in fact implementable.  They may in some cases
!   require extra work, but it is still possible to define an operator-&gt;
    in such cases: it doesn't have to return a T*, but may return a
    proxy type.  No change to the standard is justified.</p>
  
--- 4001,4007 ----
  <p><b>Rationale:</b></p>
  <p>The current standard is clear and consistent.  Input iterators that
    return rvalues are in fact implementable.  They may in some cases
!   require extra work, but it is still possible to define an operator->
    in such cases: it doesn't have to return a T*, but may return a
    proxy type.  No change to the standard is justified.</p>
  
*************** buffered somewhere to make a legal input
*** 4984,4998 ****
  
  <hr>
  <h3><a name="309"></a>309. Does sentry catch exceptions?</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-03-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The descriptions of the constructors of basic_istream&lt;&gt;::sentry
! (27.7.1.1.3 [istream::sentry]) and basic_ostream&lt;&gt;::sentry
! (27.7.2.4 [ostream::sentry]) do not explain what the functions do in
  case an exception is thrown while they execute. Some current
  implementations allow all exceptions to propagate, others catch them
  and set ios_base::badbit instead, still others catch some but let
--- 4011,4025 ----
  
  <hr>
  <h3><a name="309"></a>309. Does sentry catch exceptions?</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-03-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The descriptions of the constructors of basic_istream&lt;&gt;::sentry
! (27.7.2.1.3 [istream::sentry]) and basic_ostream&lt;&gt;::sentry
! (27.7.3.4 [ostream::sentry]) do not explain what the functions do in
  case an exception is thrown while they execute. Some current
  implementations allow all exceptions to propagate, others catch them
  and set ios_base::badbit instead, still others catch some but let
*************** others propagate.
*** 5003,5018 ****
  The text also mentions that the functions may call setstate(failbit)
  (without actually saying on what object, but presumably the stream
  argument is meant).  That may have been fine for
! basic_istream&lt;&gt;::sentry prior to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#195">195</a>, since
  the function performs an input operation which may fail. However,
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#195">195</a> amends 27.7.1.1.3 [istream::sentry], p2 to
  clarify that the function should actually call setstate(failbit |
  eofbit), so the sentence in p3 is redundant or even somewhat
  contradictory.
  </p>
  
  <p>
! The same sentence that appears in 27.7.2.4 [ostream::sentry], p3
  doesn't seem to be very meaningful for basic_istream&lt;&gt;::sentry
  which performs no input. It is actually rather misleading since it
  would appear to guide library implementers to calling
--- 4030,4045 ----
  The text also mentions that the functions may call setstate(failbit)
  (without actually saying on what object, but presumably the stream
  argument is meant).  That may have been fine for
! basic_istream&lt;&gt;::sentry prior to issue <a href="lwg-defects.html#195">195</a>, since
  the function performs an input operation which may fail. However,
! issue <a href="lwg-defects.html#195">195</a> amends 27.7.2.1.3 [istream::sentry], p2 to
  clarify that the function should actually call setstate(failbit |
  eofbit), so the sentence in p3 is redundant or even somewhat
  contradictory.
  </p>
  
  <p>
! The same sentence that appears in 27.7.3.4 [ostream::sentry], p3
  doesn't seem to be very meaningful for basic_istream&lt;&gt;::sentry
  which performs no input. It is actually rather misleading since it
  would appear to guide library implementers to calling
*************** do not behave consistently, suggesting
*** 5076,5082 ****
  not quite clear on the exception handling in istream::sentry,
  despite the fact that some LWG members might feel otherwise.
  (As documented by the parenthetical comment here:
! http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1480.html#309)
  </p>
  
  <p>
--- 4103,4109 ----
  not quite clear on the exception handling in istream::sentry,
  despite the fact that some LWG members might feel otherwise.
  (As documented by the parenthetical comment here:
! http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1480.html#309)
  </p>
  
  <p>
*************** felt that "a sentry's constructor should
*** 5085,5091 ****
  because sentries should only be used within (un)formatted input
  functions and that exception handling is the responsibility of
  those functions, not of the sentries," as noted here
! http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2001/n1310.html#309
  would in effect be either arguing for the behavior described
  in [1] or for extractors implemented along the lines of [3].
  </p>
--- 4112,4118 ----
  because sentries should only be used within (un)formatted input
  functions and that exception handling is the responsibility of
  those functions, not of the sentries," as noted here
! http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2001/n1310.html#309
  would in effect be either arguing for the behavior described
  in [1] or for extractors implemented along the lines of [3].
  </p>
*************** badbit is also set in exceptions().
*** 5104,5110 ****
  <p>[1] Extractor that catches exceptions thrown from sentry:</p>
  
  <blockquote>
! <pre>struct S { long i; };
  
  istream&amp; operator&gt;&gt; (istream &amp;strm, S &amp;s)
  {
--- 4131,4138 ----
  <p>[1] Extractor that catches exceptions thrown from sentry:</p>
  
  <blockquote>
! <pre>
! struct S { long i; };
  
  istream&amp; operator&gt;&gt; (istream &amp;strm, S &amp;s)
  {
*************** istream&amp; operator&gt;&gt; (istream &
*** 5140,5146 ****
  <p>[2] Extractor that propagates exceptions thrown from sentry:</p>
  
  <blockquote>
! <pre>istream&amp; operator&gt;&gt; (istream &amp;strm, S &amp;s)
  {
      istream::sentry guard (strm, false);
      if (guard) {
--- 4168,4175 ----
  <p>[2] Extractor that propagates exceptions thrown from sentry:</p>
  
  <blockquote>
! <pre>
! istream&amp; operator&gt;&gt; (istream &amp;strm, S &amp;s)
  {
      istream::sentry guard (strm, false);
      if (guard) {
*************** result of a call to strm.clear().
*** 5178,5184 ****
  </p>
  
  <blockquote>
! <pre>istream&amp; operator&gt;&gt; (istream &amp;strm, S &amp;s)
  {
      const ios::iostate state = strm.rdstate ();
      const ios::iostate except = strm.exceptions ();
--- 4207,4214 ----
  </p>
  
  <blockquote>
! <pre>
! istream&amp; operator&gt;&gt; (istream &amp;strm, S &amp;s)
  {
      const ios::iostate state = strm.rdstate ();
      const ios::iostate except = strm.exceptions ();
*************** requested exceptions.    I refer to 27.6
*** 5251,5260 ****
  </p>
  <p>
  However, this was not the case on at least two implementations -- if
! the first thing I did with an istream was call operator&gt;&gt;( T&amp; ) for T
  among the basic arithmetic types and std::string.   Looking further I
  found that the sentry's constructor was invoking the exception when it
! pre-scanned for whitespace, and the extractor function (operator&gt;&gt;())
  was not catching exceptions in this situation.
  </p>
  <p>
--- 4281,4290 ----
  </p>
  <p>
  However, this was not the case on at least two implementations -- if
! the first thing I did with an istream was call operator>>( T&amp; ) for T
  among the basic arithmetic types and std::string.   Looking further I
  found that the sentry's constructor was invoking the exception when it
! pre-scanned for whitespace, and the extractor function (operator>>())
  was not catching exceptions in this situation.
  </p>
  <p>
*************** reopened, agreed with the rationale.
*** 5307,5316 ****
  
  <hr>
  <h3><a name="313"></a>313. set_terminate and set_unexpected question</h3>
! <p><b>Section:</b> 18.8.3.3 [terminate] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2001-04-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#terminate">issues</a> in [terminate].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to section 18.7.3.3 of the standard, std::terminate() is
--- 4337,4346 ----
  
  <hr>
  <h3><a name="313"></a>313. set_terminate and set_unexpected question</h3>
! <p><b>Section:</b> 18.8.3.4 [terminate] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2001-04-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#terminate">issues</a> in [terminate].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to section 18.7.3.3 of the standard, std::terminate() is
*************** std::terminate?
*** 5325,5331 ****
  
  <p>For example:</p>
  
! <pre>  #include &lt;exception&gt;
  
    int main () {
        std::set_terminate(std::terminate);
--- 4355,4362 ----
  
  <p>For example:</p>
  
! <pre>
!   #include &lt;exception&gt;
  
    int main () {
        std::set_terminate(std::terminate);
*************** to call itself.</p>
*** 5357,5366 ****
  
  <hr>
  <h3><a name="314"></a>314. Is the stack unwound when terminate() is called?</h3>
! <p><b>Section:</b> 18.8.3.3 [terminate] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2001-04-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#terminate">issues</a> in [terminate].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 4388,4397 ----
  
  <hr>
  <h3><a name="314"></a>314. Is the stack unwound when terminate() is called?</h3>
! <p><b>Section:</b> 18.8.3.4 [terminate] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2001-04-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#terminate">issues</a> in [terminate].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** about when terminate() is called; it mer
*** 5403,5418 ****
  
  
  <hr>
! <h3><a name="323"></a>323. abs() overloads in different headers</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2001-06-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Currently the standard mandates the following overloads of
  abs():</p>
  
! <pre>    abs(long), abs(int) in &lt;cstdlib&gt;
  
      abs(float), abs(double), abs(long double) in &lt;cmath&gt;
  
--- 4434,4451 ----
  
  
  <hr>
! <h3><a name="323"></a>323. <tt>abs()</tt> overloads in different headers</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2001-06-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Currently the standard mandates the following overloads of
  abs():</p>
  
! <pre>
!     abs(long), abs(int) in &lt;cstdlib&gt;
  
      abs(float), abs(double), abs(long double) in &lt;cmath&gt;
  
*************** the correct headers are #included.
*** 5440,5458 ****
  
  <p>The same issue may exist for other functions in the library.</p>
  
! <p>Redmond: PJP reports that C99 adds two new kinds of abs: complex,
! and int_max_abs.</p>
  
! <p>Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#343">343</a>.</p>
  
  <p><i>[
  Bellevue:
  ]</i></p>
  
  
! <blockquote>
  The situation is not sufficiently severe to warrant a change.
! </blockquote>
  
  
  
--- 4473,4491 ----
  
  <p>The same issue may exist for other functions in the library.</p>
  
! <p>Redmond: PJP reports that C99 adds two new kinds of <tt>abs</tt>: <tt>complex</tt>,
! and <tt>int_max_abs</tt>.</p>
  
! <p>Related issue: <a href="lwg-defects.html#343">343</a>.</p>
  
  <p><i>[
  Bellevue:
  ]</i></p>
  
  
! <blockquote><p>
  The situation is not sufficiently severe to warrant a change.
! </p></blockquote>
  
  
  
*************** The situation is not sufficiently severe
*** 5483,5491 ****
  
  <hr>
  <h3><a name="326"></a>326. Missing typedef in moneypunct_byname</h3>
! <p><b>Section:</b> 22.4.6.4 [locale.moneypunct.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-07-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The definition of the moneypunct facet contains the typedefs char_type
  and string_type. Only one of these names, string_type, is defined in
--- 4516,4524 ----
  
  <hr>
  <h3><a name="326"></a>326. Missing typedef in moneypunct_byname</h3>
! <p><b>Section:</b> 22.4.6.4 [locale.moneypunct.byname] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-07-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The definition of the moneypunct facet contains the typedefs char_type
  and string_type. Only one of these names, string_type, is defined in
*************** the typedef, because it is inherited fro
*** 5508,5517 ****
  
  <hr>
  <h3><a name="330"></a>330. Misleading "exposition only" value in class locale definition</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-07-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The "exposition only" value of the std::locale::none constant shown in
--- 4541,4550 ----
  
  <hr>
  <h3><a name="330"></a>330. Misleading "exposition only" value in class locale definition</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-07-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The "exposition only" value of the std::locale::none constant shown in
*************** For instance, the following code will (p
*** 5531,5537 ****
  belonging to the collate category from the German locale on AIX:
  </p>
  
! <pre>  std::locale l (std::locale ("C"), "de_DE", std::locale::none);
  </pre>
  
  
--- 4564,4571 ----
  belonging to the collate category from the German locale on AIX:
  </p>
  
! <pre>
!   std::locale l (std::locale ("C"), "de_DE", std::locale::none);
  </pre>
  
  
*************** could give library implementors proper g
*** 5550,5556 ****
  matter.  The non-normative example we're giving is no worse than
  any other choice would be.</p>
  
! <p>See issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#347">347</a>.</p>
  
  
  
--- 4584,4590 ----
  matter.  The non-normative example we're giving is no worse than
  any other choice would be.</p>
  
! <p>See issue <a href="lwg-defects.html#347">347</a>.</p>
  
  
  
*************** any other choice would be.</p>
*** 5558,5571 ****
  
  <hr>
  <h3><a name="332"></a>332. Consider adding increment and decrement operators to std::fpos&lt; T &gt; </h3>
! <p><b>Section:</b> 27.5.3 [fpos] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> PremAnand M. Rao <b>Opened:</b> 2001-08-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fpos">issues</a> in [fpos].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Increment and decrement operators are missing from 
! Table 88 -- Position type requirements in 27.5.3 [fpos].
  </p>
  
  
--- 4592,4605 ----
  
  <hr>
  <h3><a name="332"></a>332. Consider adding increment and decrement operators to std::fpos&lt; T &gt; </h3>
! <p><b>Section:</b> 27.5.4 [fpos] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> PremAnand M. Rao <b>Opened:</b> 2001-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fpos">issues</a> in [fpos].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Increment and decrement operators are missing from 
! Table 88 -- Position type requirements in 27.5.4 [fpos].
  </p>
  
  
*************** Table 88 (section 27.4.3) -- Position ty
*** 5575,5581 ****
  be updated to include increment and decrement operators.
  </p>
  
! <pre>expression        return type     operational    note
  
  ++p               fpos&amp;           p += O(1)
  p++               fpos            { P tmp = p;
--- 4609,4616 ----
  be updated to include increment and decrement operators.
  </p>
  
! <pre>
! expression        return type     operational    note
  
  ++p               fpos&amp;           p += O(1)
  p++               fpos            { P tmp = p;
*************** report.  Additionally, nobody saw a clea
*** 5600,5614 ****
  
  <hr>
  <h3><a name="342"></a>342. seek and eofbit</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-10-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>I think we have a defect.</p>
  
! <p>According to lwg issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a> which is now a dr, the
! description of seekg in 27.7.1.3 [istream.unformatted] paragraph 38 now looks
  like:</p>
  
  <blockquote><p>
--- 4635,4650 ----
  
  <hr>
  <h3><a name="342"></a>342. seek and eofbit</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-10-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>I think we have a defect.</p>
  
! <p>According to lwg issue <a href="lwg-defects.html#60">60</a> which is now a dr, the
! description of seekg in 27.7.2.3 [istream.unformatted] paragraph 38 now looks
  like:</p>
  
  <blockquote><p>
*************** Behaves as an unformatted input function
*** 5616,5625 ****
  paragraph 1), except that it does not count the number of characters 
  extracted and does not affect the value returned by subsequent calls to 
  gcount(). After constructing a sentry object, if fail() != true, 
! executes rdbuf()-&gt;pubseekpos( pos).
  </p></blockquote>
  
! <p>And according to lwg issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#243">243</a> which is also now a dr,
  27.6.1.3, paragraph 1 looks like:</p>
  
  <blockquote><p>
--- 4652,4661 ----
  paragraph 1), except that it does not count the number of characters 
  extracted and does not affect the value returned by subsequent calls to 
  gcount(). After constructing a sentry object, if fail() != true, 
! executes rdbuf()->pubseekpos( pos).
  </p></blockquote>
  
! <p>And according to lwg issue <a href="lwg-defects.html#243">243</a> which is also now a dr,
  27.6.1.3, paragraph 1 looks like:</p>
  
  <blockquote><p>
*************** Ready state:
*** 5676,5682 ****
  <li>It should apply to both overloads of seekg.</li>
  <li>tellg has similar issues, except that it should not call clear().</li>
  <li>The point about clear() seems to apply to seekp().</li>
! <li>Depending on the outcome of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#419">419</a>
  if the sentry
  sets <tt>failbit</tt> when it finds <tt>eofbit</tt> already set, then
  you can never seek away from the end of stream.</li>
--- 4712,4718 ----
  <li>It should apply to both overloads of seekg.</li>
  <li>tellg has similar issues, except that it should not call clear().</li>
  <li>The point about clear() seems to apply to seekp().</li>
! <li>Depending on the outcome of <a href="lwg-defects.html#419">419</a>
  if the sentry
  sets <tt>failbit</tt> when it finds <tt>eofbit</tt> already set, then
  you can never seek away from the end of stream.</li>
*************** Moved to NAD. Will reopen if proposed re
*** 5697,5710 ****
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Change 27.7.1.3 [istream.unformatted] to:</p>
  <blockquote><p>
  Behaves as an unformatted input function (as described in 27.6.1.3,
  paragraph 1), except that it does not count the number of characters
  extracted, does not affect the value returned by subsequent calls to
  gcount(), and does not examine the value returned by the sentry
  object. After constructing a sentry object, if <tt>fail() !=
! true</tt>, executes <tt>rdbuf()-&gt;pubseekpos(pos)</tt>.  In
  case of success, the function calls clear().
  In case of failure, the function calls <tt>setstate(failbit)</tt>
  (which may throw <tt>ios_base::failure</tt>).
--- 4733,4746 ----
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Change 27.7.2.3 [istream.unformatted] to:</p>
  <blockquote><p>
  Behaves as an unformatted input function (as described in 27.6.1.3,
  paragraph 1), except that it does not count the number of characters
  extracted, does not affect the value returned by subsequent calls to
  gcount(), and does not examine the value returned by the sentry
  object. After constructing a sentry object, if <tt>fail() !=
! true</tt>, executes <tt>rdbuf()->pubseekpos(pos)</tt>.  In
  case of success, the function calls clear().
  In case of failure, the function calls <tt>setstate(failbit)</tt>
  (which may throw <tt>ios_base::failure</tt>).
*************** In case of failure, the function calls <
*** 5728,5985 ****
  
  
  <hr>
- <h3><a name="343"></a>343. Unspecified library header dependencies</h3>
- <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
-  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-10-09 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- The synopses of the C++ library headers clearly show which names are
- required to be defined in each header. Since in order to implement the
- classes and templates defined in these headers declarations of other
- templates (but not necessarily their definitions) are typically
- necessary the standard in 17.4.4, p1 permits library implementers to
- include any headers needed to implement the definitions in each header.
- </p>
- 
- <p>
- For instance, although it is not explicitly specified in the synopsis of
- &lt;string&gt;, at the point of definition of the std::basic_string template
- the declaration of the std::allocator template must be in scope. All
- current implementations simply include &lt;memory&gt; from within &lt;string&gt;,
- either directly or indirectly, to bring the declaration of
- std::allocator into scope.
- </p>
- 
- <p>
- Additionally, however, some implementation also include &lt;istream&gt; and
- &lt;ostream&gt; at the top of &lt;string&gt; to bring the declarations of
- std::basic_istream and std::basic_ostream into scope (which are needed
- in order to implement the string inserter and extractor operators
- (21.3.7.9 [lib.string.io])). Other implementations only include
- &lt;iosfwd&gt;, since strictly speaking, only the declarations and not the
- full definitions are necessary.
- </p>
- 
- <p>
- Obviously, it is possible to implement &lt;string&gt; without actually
- providing the full definitions of all the templates std::basic_string
- uses (std::allocator, std::basic_istream, and std::basic_ostream).
- Furthermore, not only is it possible, doing so is likely to have a
- positive effect on compile-time efficiency.
- </p>
- 
- <p>
- But while it may seem perfectly reasonable to expect a program that uses
- the std::basic_string insertion and extraction operators to also
- explicitly include &lt;istream&gt; or &lt;ostream&gt;, respectively, it doesn't seem
- reasonable to also expect it to explicitly include &lt;memory&gt;. Since
- what's reasonable and what isn't is highly subjective one would expect
- the standard to specify what can and what cannot be assumed.
- Unfortunately, that isn't the case.
- </p>
- 
- <p>The examples below demonstrate the issue.</p>
- 
- <p>Example 1:</p>
- 
- <p>It is not clear whether the following program is complete:</p>
- 
- <pre>#include &lt;string&gt;
- 
- extern std::basic_ostream&lt;char&gt; &amp;strm;
- 
- int main () {
-     strm &lt;&lt; std::string ("Hello, World!\n");
- }
- </pre>    
- 
- <p>or whether one must explicitly include &lt;memory&gt; or
- &lt;ostream&gt; (or both) in addition to &lt;string&gt; in order for
- the program to compile.</p>
- 
- 
- <p>Example 2:</p>
- 
- <p>Similarly, it is unclear whether the following program is complete:</p>
- 
- <pre>#include &lt;istream&gt;
- 
- extern std::basic_iostream&lt;char&gt; &amp;strm;
- 
- int main () {
-     strm &lt;&lt; "Hello, World!\n";
- }
- </pre>
- 
- <p>
- or whether one needs to explicitly include &lt;ostream&gt;, and
- perhaps even other headers containing the definitions of other
- required templates:</p>
- 
- <pre>#include &lt;ios&gt;
- #include &lt;istream&gt;
- #include &lt;ostream&gt;
- #include &lt;streambuf&gt;
- 
- extern std::basic_iostream&lt;char&gt; &amp;strm;
- 
- int main () {
-     strm &lt;&lt; "Hello, World!\n";
- }
- </pre>
- 
- <p>Example 3:</p>
- 
- <p>Likewise, it seems unclear whether the program below is complete:</p>
- <pre>#include &lt;iterator&gt;
- 
- bool foo (std::istream_iterator&lt;int&gt; a, std::istream_iterator&lt;int&gt; b)
- {
-     return a == b;
- }
- 
- int main () { }
- </pre>
- 
- <p>or whether one should be required to include &lt;istream&gt;.</p>
- 
- <p>There are many more examples that demonstrate this lack of a
- requirement.  I believe that in a good number of cases it would be
- unreasonable to require that a program explicitly include all the
- headers necessary for a particular template to be specialized, but I
- think that there are cases such as some of those above where it would
- be desirable to allow implementations to include only as much as
- necessary and not more.</p>
- 
- <p><i>[
- post Bellevue:
- ]</i></p>
- 
- 
- <blockquote>
- Position taken in prior reviews is that the idea of a table of header
- dependencies is a good one. Our view is that a full paper is needed to
- do justice to this, and we've made that recommendation to the issue
- author.
- </blockquote>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- NAD. Handled by LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1178">1178</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- For every C++ library header, supply a minimum set of other C++ library
- headers that are required to be included by that header. The proposed
- list is below (C++ headers for C Library Facilities, table 12 in
- 17.4.1.2, p3, are omitted):
- </p>
- 
- <pre>+------------+--------------------+
- | C++ header |required to include |
- +============+====================+
- |&lt;algorithm&gt; |                    |
- +------------+--------------------+
- |&lt;bitset&gt;    |                    |
- +------------+--------------------+
- |&lt;complex&gt;   |                    |
- +------------+--------------------+
- |&lt;deque&gt;     |&lt;memory&gt;            |
- +------------+--------------------+
- |&lt;exception&gt; |                    |
- +------------+--------------------+
- |&lt;fstream&gt;   |&lt;ios&gt;               |
- +------------+--------------------+
- |&lt;functional&gt;|                    |
- +------------+--------------------+
- |&lt;iomanip&gt;   |&lt;ios&gt;               |
- +------------+--------------------+
- |&lt;ios&gt;       |&lt;streambuf&gt;         |
- +------------+--------------------+
- |&lt;iosfwd&gt;    |                    |
- +------------+--------------------+
- |&lt;iostream&gt;  |&lt;istream&gt;, &lt;ostream&gt;|
- +------------+--------------------+
- |&lt;istream&gt;   |&lt;ios&gt;               |
- +------------+--------------------+
- |&lt;iterator&gt;  |                    |
- +------------+--------------------+
- |&lt;limits&gt;    |                    |
- +------------+--------------------+
- |&lt;list&gt;      |&lt;memory&gt;            |
- +------------+--------------------+
- |&lt;locale&gt;    |                    |
- +------------+--------------------+
- |&lt;map&gt;       |&lt;memory&gt;            |
- +------------+--------------------+
- |&lt;memory&gt;    |                    |
- +------------+--------------------+
- |&lt;new&gt;       |&lt;exception&gt;         |
- +------------+--------------------+
- |&lt;numeric&gt;   |                    |
- +------------+--------------------+
- |&lt;ostream&gt;   |&lt;ios&gt;               |
- +------------+--------------------+
- |&lt;queue&gt;     |&lt;deque&gt;             |
- +------------+--------------------+
- |&lt;set&gt;       |&lt;memory&gt;            |
- +------------+--------------------+
- |&lt;sstream&gt;   |&lt;ios&gt;, &lt;string&gt;     |
- +------------+--------------------+
- |&lt;stack&gt;     |&lt;deque&gt;             |
- +------------+--------------------+
- |&lt;stdexcept&gt; |                    |
- +------------+--------------------+
- |&lt;streambuf&gt; |&lt;ios&gt;               |
- +------------+--------------------+
- |&lt;string&gt;    |&lt;memory&gt;            |
- +------------+--------------------+
- |&lt;strstream&gt; |                    |
- +------------+--------------------+
- |&lt;typeinfo&gt;  |&lt;exception&gt;         |
- +------------+--------------------+
- |&lt;utility&gt;   |                    |
- +------------+--------------------+
- |&lt;valarray&gt;  |                    |
- +------------+--------------------+
- |&lt;vector&gt;    |&lt;memory&gt;            |
- +------------+--------------------+
- </pre>
- 
- 
- <p><b>Rationale:</b></p>
- <p>The portability problem is real.  A program that works correctly on
- one implementation might fail on another, because of different header
- dependencies.  This problem was understood before the standard was
- completed, and it was a conscious design choice.</p>
- <p>One possible way to deal with this, as a library extension, would
- be an &lt;all&gt; header.</p>
- 
- <p>
- Hinnant:  It's time we dealt with this issue for C++0X.  Reopened.
- </p>
- 
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="344"></a>344. grouping + showbase</h3>
! <p><b>Section:</b> 22.4.2 [category.numeric] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-10-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  When both grouping and showbase are active and the basefield is octal, 
--- 4764,4773 ----
  
  
  <hr>
  <h3><a name="344"></a>344. grouping + showbase</h3>
! <p><b>Section:</b> 22.4.2 [category.numeric] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-10-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  When both grouping and showbase are active and the basefield is octal, 
*************** consensus in the LWG for action.
*** 6021,6031 ****
  
  <hr>
  <h3><a name="348"></a>348. Minor issue with std::pair operator&lt;</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-10-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a></p>
  <p><b>Discussion:</b></p>
  
  
--- 4809,4819 ----
  
  <hr>
  <h3><a name="348"></a>348. Minor issue with std::pair operator&lt;</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-10-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-active.html#532">532</a></p>
  <p><b>Discussion:</b></p>
  
  
*************** operator&lt; on any pair type which cont
*** 6036,6047 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.3.5 [pairs] paragraph 6, replace:</p>
! <pre>    Returns: x.first &lt; y.first || (!(y.first &lt; x.first) &amp;&amp; x.second &lt;
          y.second).
  </pre>
  <p>With:</p>
! <pre>    Returns: std::less&lt;T1&gt;()( x.first, y.first ) ||
               (!std::less&lt;T1&gt;()( y.first, x.first) &amp;&amp; 
               std::less&lt;T2&gt;()( x.second, y.second ) )
  </pre>
--- 4824,4837 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.3 [pairs] paragraph 6, replace:</p>
! <pre>
!     Returns: x.first &lt; y.first || (!(y.first &lt; x.first) &amp;&amp; x.second &lt;
          y.second).
  </pre>
  <p>With:</p>
! <pre>
!     Returns: std::less&lt;T1&gt;()( x.first, y.first ) ||
               (!std::less&lt;T1&gt;()( y.first, x.first) &amp;&amp; 
               std::less&lt;T2&gt;()( x.second, y.second ) )
  </pre>
*************** operator&lt; on any pair type which cont
*** 6069,6079 ****
  
  <hr>
  <h3><a name="350"></a>350. allocator&lt;&gt;::address</h3>
! <p><b>Section:</b> 20.9.5.1 [allocator.members], 20.2.5 [allocator.requirements], 17.6.1.1 [contents] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 2001-10-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a></p>
  <p><b>Discussion:</b></p>
  <p>See c++std-lib-9006 and c++std-lib-9007.  This issue is taken
  verbatim from -9007.</p>
--- 4859,4869 ----
  
  <hr>
  <h3><a name="350"></a>350. allocator&lt;&gt;::address</h3>
! <p><b>Section:</b> 20.7.9.1 [allocator.members], 17.6.3.5 [allocator.requirements], 17.6.1.1 [contents] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 2001-10-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#634">634</a></p>
  <p><b>Discussion:</b></p>
  <p>See c++std-lib-9006 and c++std-lib-9007.  This issue is taken
  verbatim from -9007.</p>
*************** to any non-builtin type makes that opera
*** 6084,6090 ****
  implementing libraries, including the Standard Library.  The result
  is that many library facilities fail for legal user code, such as
  the fragment</p>
! <pre>  class A { private: A* operator&amp;(); };
    std::vector&lt;A&gt; aa;
  
    class B { };
--- 4874,4881 ----
  implementing libraries, including the Standard Library.  The result
  is that many library facilities fail for legal user code, such as
  the fragment</p>
! <pre>
!   class A { private: A* operator&amp;(); };
    std::vector&lt;A&gt; aa;
  
    class B { };
*************** In 20.1.6, Table 32, add to the Notes co
*** 6119,6125 ****
  a.address(s) lines, respectively: 
  </p>
  
! <pre>  allocator&lt;T&gt;::address(r)
    allocator&lt;T&gt;::address(s)
  </pre> 
  
--- 4910,4917 ----
  a.address(s) lines, respectively: 
  </p>
  
! <pre>
!   allocator&lt;T&gt;::address(r)
    allocator&lt;T&gt;::address(s)
  </pre> 
  
*************** a.address(s) lines, respectively:
*** 6134,6140 ****
  
  <p><b>Rationale:</b></p>
  <p>The LWG believes both examples are ill-formed.  The contained type
! is required to be CopyConstructible (20.2.1 [utility.arg.requirements]), and that
  includes the requirement that &amp;t return the usual types and
  values. Since allocators are intended to be used in conjunction with
  containers, and since the CopyConstructible requirements appear to
--- 4926,4932 ----
  
  <p><b>Rationale:</b></p>
  <p>The LWG believes both examples are ill-formed.  The contained type
! is required to be CopyConstructible (17.6.3.1 [utility.arg.requirements]), and that
  includes the requirement that &amp;t return the usual types and
  values. Since allocators are intended to be used in conjunction with
  containers, and since the CopyConstructible requirements appear to
*************** exhibiting a problem.</p>
*** 6154,6168 ****
  
  <hr>
  <h3><a name="351"></a>351. unary_negate and binary_negate: struct or class?</h3>
! <p><b>Section:</b> 20.8 [function.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Dale Riley <b>Opened:</b> 2001-11-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.8 [function.objects] the header &lt;functional&gt; synopsis declares
  the unary_negate and binary_negate function objects as struct.
! However in 20.8.9 [negators] the unary_negate and binary_negate
  function objects are defined as class.  Given the context, they are
  not "basic function objects" like negate, so this is either a typo or
  an editorial oversight.
--- 4946,4960 ----
  
  <hr>
  <h3><a name="351"></a>351. unary_negate and binary_negate: struct or class?</h3>
! <p><b>Section:</b> 20.9 [function.objects] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Dale Riley <b>Opened:</b> 2001-11-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.9 [function.objects] the header &lt;functional&gt; synopsis declares
  the unary_negate and binary_negate function objects as struct.
! However in 20.9.9 [negators] the unary_negate and binary_negate
  function objects are defined as class.  Given the context, they are
  not "basic function objects" like negate, so this is either a typo or
  an editorial oversight.
*************** an editorial oversight.
*** 6173,6181 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the synopsis to reflect the useage in 20.8.9 [negators]</p>
  
! <p><i>[Curaçao: Since the language permits "struct", the LWG
  views this as NAD. They suggest, however, that the Project Editor
  might wish to make the change as editorial.]</i></p>
  
--- 4965,4973 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the synopsis to reflect the useage in 20.9.9 [negators]</p>
  
! <p><i>[Cura&ccedil;ao: Since the language permits &quot;struct&quot;, the LWG
  views this as NAD. They suggest, however, that the Project Editor
  might wish to make the change as editorial.]</i></p>
  
*************** might wish to make the change as editori
*** 6187,6201 ****
  
  <hr>
  <h3><a name="356"></a>356. Meaning of ctype_base::mask enumerators</h3>
! <p><b>Section:</b> 22.4.1 [category.ctype] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2002-01-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#category.ctype">issues</a> in [category.ctype].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>What should the following program print?</p>
  
! <pre>  #include &lt;locale&gt;
    #include &lt;iostream&gt;
  
    class my_ctype : public std::ctype&lt;char&gt;
--- 4979,4994 ----
  
  <hr>
  <h3><a name="356"></a>356. Meaning of ctype_base::mask enumerators</h3>
! <p><b>Section:</b> 22.4.1 [category.ctype] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2002-01-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#category.ctype">issues</a> in [category.ctype].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>What should the following program print?</p>
  
! <pre>
!   #include &lt;locale&gt;
    #include &lt;iostream&gt;
  
    class my_ctype : public std::ctype&lt;char&gt;
*************** lib-9224, lib-9226, lib-9229, lib-9270,
*** 6260,6267 ****
  lib-9277, lib-9279.
  </p>
  
! <p>Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#339">339</a> is related, but not identical.  The
! proposed resolution if issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#339">339</a> says that
  ctype_base::mask must be a bitmask type. It does not say that the
  ctype_base::mask elements are bitmask elements, so it doesn't
  directly affect this issue.</p>
--- 5053,5060 ----
  lib-9277, lib-9279.
  </p>
  
! <p>Issue <a href="lwg-defects.html#339">339</a> is related, but not identical.  The
! proposed resolution if issue <a href="lwg-defects.html#339">339</a> says that
  ctype_base::mask must be a bitmask type. It does not say that the
  ctype_base::mask elements are bitmask elements, so it doesn't
  directly affect this issue.</p>
*************** that C99 compatibility essentially requi
*** 6271,6277 ****
  calling option 1 below.</p>
  
  <blockquote>
! <pre>I think the C99 standard is clear, that isspace -&gt; !isalpha.
  --------
  
  #include &lt;locale&gt;
--- 5064,5071 ----
  calling option 1 below.</p>
  
  <blockquote>
! <pre>
! I think the C99 standard is clear, that isspace -&gt; !isalpha.
  --------
  
  #include &lt;locale&gt;
*************** to see which interpretation is being use
*** 6342,6351 ****
  
  <hr>
  <h3><a name="357"></a>357. &lt;cmath&gt; float functions cannot return HUGE_VAL</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-02-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The float versions of the math functions have no meaningful value to return 
--- 5136,5146 ----
  
  <hr>
  <h3><a name="357"></a>357. &lt;cmath&gt; float functions cannot return HUGE_VAL</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-02-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The float versions of the math functions have no meaningful value to return 
*************** positive double expression, not necessar
*** 6368,6374 ****
  
  <p>
  Therefore, the float versions of the math functions have no way to
! signal a range error. <i>[Curaçao: The LWG notes that this isn't
  strictly correct, since errno is set.]</i> The semantics require that they
  return HUGE_VAL, but they cannot because HUGE_VAL might not be
  representable as a float.
--- 5163,5169 ----
  
  <p>
  Therefore, the float versions of the math functions have no way to
! signal a range error. <i>[Cura&ccedil;ao: The LWG notes that this isn't
  strictly correct, since errno is set.]</i> The semantics require that they
  return HUGE_VAL, but they cannot because HUGE_VAL might not be
  representable as a float.
*************** long double function to return a double
*** 6384,6394 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Curaçao: C99 was faced with a similar problem, which they fixed by
  adding HUGE_VALF and HUGE_VALL in addition to HUGE_VAL.</p>
  
  <p>C++ must also fix, but it should be done in the context of the
! general C99 based changes to C++, not via DR. Thus the LWG in Curaçao
  felt the resolution should be NAD, FUTURE, but the issue is being held
  open for one more meeting to ensure LWG members not present during the
  discussion concur.</p>
--- 5179,5189 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Cura&ccedil;ao: C99 was faced with a similar problem, which they fixed by
  adding HUGE_VALF and HUGE_VALL in addition to HUGE_VAL.</p>
  
  <p>C++ must also fix, but it should be done in the context of the
! general C99 based changes to C++, not via DR. Thus the LWG in Cura&ccedil;ao
  felt the resolution should be NAD, FUTURE, but the issue is being held
  open for one more meeting to ensure LWG members not present during the
  discussion concur.</p>
*************** discussion concur.</p>
*** 6403,6412 ****
  
  <hr>
  <h3><a name="361"></a>361. num_get&lt;&gt;::do_get (..., void*&amp;) checks grouping</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-03-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.2.2.2.2, p12 specifies that <tt>thousands_sep</tt> is to be inserted only
--- 5198,5207 ----
  
  <hr>
  <h3><a name="361"></a>361. num_get&lt;&gt;::do_get (..., void*&amp;) checks grouping</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.2.2.2.2, p12 specifies that <tt>thousands_sep</tt> is to be inserted only
*************** Change the first sentence of 22.2.2.2.2,
*** 6457,6466 ****
  
  <hr>
  <h3><a name="366"></a>366. Excessive const-qualification</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown, Marc Paterno <b>Opened:</b> 2002-05-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The following member functions are declared const, yet return non-const
--- 5252,5261 ----
  
  <hr>
  <h3><a name="366"></a>366. Excessive const-qualification</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown, Marc Paterno <b>Opened:</b> 2002-05-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The following member functions are declared const, yet return non-const
*************** those terms, does not appear in the stan
*** 6483,6568 ****
  <p><b>Proposed resolution:</b></p>
  <p>In 27.4.4 and 27.4.4.2</p>
  <p>Replace</p>
! <pre>  basic_ostream&lt;charT,traits&gt;* tie() const;
  </pre>
  <p>with</p>
! <pre>  basic_ostream&lt;charT,traits&gt;* tie();
    const basic_ostream&lt;charT,traits&gt;* tie() const;
  </pre>
  
  <p>and replace</p>
! <pre>  basic_streambuf&lt;charT,traits&gt;* rdbuf() const;
  </pre>
  <p>with</p>
! <pre>  basic_streambuf&lt;charT,traits&gt;* rdbuf();
    const basic_streambuf&lt;charT,traits&gt;* rdbuf() const;
  </pre>
  
  <p>In 27.5.2 and 27.5.2.3.1</p>
  <p>Replace</p>
! <pre>  char_type* eback() const;
  </pre>
  <p>with</p>
! <pre>  char_type* eback();
    const char_type* eback() const;
  </pre>
  
  <p>Replace</p>
! <pre>  char_type gptr() const;
  </pre>
  <p>with</p>
! <pre>  char_type* gptr();
    const char_type* gptr() const;
  </pre>
  
  <p>Replace</p>
! <pre>  char_type* egptr() const;
  </pre>
  <p>with</p>
! <pre>  char_type* egptr();
    const char_type* egptr() const;
  </pre>
  
  <p>In 27.5.2 and 27.5.2.3.2</p>
  <p>Replace</p>
! <pre>  char_type* pbase() const;
  </pre>
  <p>with</p>
! <pre>  char_type* pbase();
    const char_type* pbase() const;
  </pre>
  
  <p>Replace</p>
! <pre>  char_type* pptr() const;
  </pre>
  <p>with</p>
! <pre>  char_type* pptr();
    const char_type* pptr() const;
  </pre>
  
  <p>Replace</p>
! <pre>  char_type* epptr() const;
  </pre>
  <p>with</p>
! <pre>  char_type* epptr();
    const char_type* epptr() const;
  </pre>
  
  <p>In 27.7.2, 27.7.2.2, 27.7.3 27.7.3.2, 27.7.4, and 27.7.6</p>
  <p>Replace</p>
! <pre>  basic_stringbuf&lt;charT,traits,Allocator&gt;* rdbuf() const;
  </pre>
  <p>with</p>
! <pre>  basic_stringbuf&lt;charT,traits,Allocator&gt;* rdbuf();
    const basic_stringbuf&lt;charT,traits,Allocator&gt;* rdbuf() const;
  </pre>
  
  <p>In  27.8.1.5, 27.8.1.7, 27.8.1.8, 27.8.1.10, 27.8.1.11, and 27.8.1.13</p>
  <p>Replace</p>
! <pre>  basic_filebuf&lt;charT,traits&gt;* rdbuf() const;
  </pre>
  <p>with</p>
! <pre>  basic_filebuf&lt;charT,traits&gt;* rdbuf();
    const basic_filebuf&lt;charT,traits&gt;* rdbuf() const;
  </pre>
  
--- 5278,5383 ----
  <p><b>Proposed resolution:</b></p>
  <p>In 27.4.4 and 27.4.4.2</p>
  <p>Replace</p>
! <pre>
!   basic_ostream&lt;charT,traits&gt;* tie() const;
  </pre>
  <p>with</p>
! <pre>
!   basic_ostream&lt;charT,traits&gt;* tie();
    const basic_ostream&lt;charT,traits&gt;* tie() const;
  </pre>
  
  <p>and replace</p>
! <pre>
!   basic_streambuf&lt;charT,traits&gt;* rdbuf() const;
  </pre>
  <p>with</p>
! <pre>
!   basic_streambuf&lt;charT,traits&gt;* rdbuf();
    const basic_streambuf&lt;charT,traits&gt;* rdbuf() const;
  </pre>
  
  <p>In 27.5.2 and 27.5.2.3.1</p>
  <p>Replace</p>
! <pre>
!   char_type* eback() const;
  </pre>
  <p>with</p>
! <pre>
!   char_type* eback();
    const char_type* eback() const;
  </pre>
  
  <p>Replace</p>
! <pre>
!   char_type gptr() const;
  </pre>
  <p>with</p>
! <pre>
!   char_type* gptr();
    const char_type* gptr() const;
  </pre>
  
  <p>Replace</p>
! <pre>
!   char_type* egptr() const;
  </pre>
  <p>with</p>
! <pre>
!   char_type* egptr();
    const char_type* egptr() const;
  </pre>
  
  <p>In 27.5.2 and 27.5.2.3.2</p>
  <p>Replace</p>
! <pre>
!   char_type* pbase() const;
  </pre>
  <p>with</p>
! <pre>
!   char_type* pbase();
    const char_type* pbase() const;
  </pre>
  
  <p>Replace</p>
! <pre>
!   char_type* pptr() const;
  </pre>
  <p>with</p>
! <pre>
!   char_type* pptr();
    const char_type* pptr() const;
  </pre>
  
  <p>Replace</p>
! <pre>
!   char_type* epptr() const;
  </pre>
  <p>with</p>
! <pre>
!   char_type* epptr();
    const char_type* epptr() const;
  </pre>
  
  <p>In 27.7.2, 27.7.2.2, 27.7.3 27.7.3.2, 27.7.4, and 27.7.6</p>
  <p>Replace</p>
! <pre>
!   basic_stringbuf&lt;charT,traits,Allocator&gt;* rdbuf() const;
  </pre>
  <p>with</p>
! <pre>
!   basic_stringbuf&lt;charT,traits,Allocator&gt;* rdbuf();
    const basic_stringbuf&lt;charT,traits,Allocator&gt;* rdbuf() const;
  </pre>
  
  <p>In  27.8.1.5, 27.8.1.7, 27.8.1.8, 27.8.1.10, 27.8.1.11, and 27.8.1.13</p>
  <p>Replace</p>
! <pre>
!   basic_filebuf&lt;charT,traits&gt;* rdbuf() const;
  </pre>
  <p>with</p>
! <pre>
!   basic_filebuf&lt;charT,traits&gt;* rdbuf();
    const basic_filebuf&lt;charT,traits&gt;* rdbuf() const;
  </pre>
  
*************** those terms, does not appear in the stan
*** 6581,6590 ****
  
  <hr>
  <h3><a name="367"></a>367. remove_copy/remove_copy_if and Input Iterators</h3>
! <p><b>Section:</b> 25.3.8 [alg.remove] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2002-05-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.remove">issues</a> in [alg.remove].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  remove_copy and remove_copy_if (25.3.8 [alg.remove]) permit their
--- 5396,5405 ----
  
  <hr>
  <h3><a name="367"></a>367. remove_copy/remove_copy_if and Input Iterators</h3>
! <p><b>Section:</b> 25.3.8 [alg.remove] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2002-05-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.remove">issues</a> in [alg.remove].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  remove_copy and remove_copy_if (25.3.8 [alg.remove]) permit their
*************** constructible. Otherwise copy constructi
*** 6618,6627 ****
  
  <hr>
  <h3><a name="368"></a>368. basic_string::replace has two "Throws" paragraphs</h3>
! <p><b>Section:</b> 21.4.6.6 [string::replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2002-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::replace">issues</a> in [string::replace].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  21.4.6.6 [string::replace] basic_string::replace, second
--- 5433,5442 ----
  
  <hr>
  <h3><a name="368"></a>368. basic_string::replace has two "Throws" paragraphs</h3>
! <p><b>Section:</b> 21.4.6.6 [string::replace] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2002-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::replace">issues</a> in [string::replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  21.4.6.6 [string::replace] basic_string::replace, second
*************** part of the "Effects" paragraph.
*** 6651,6663 ****
  
  <hr>
  <h3><a name="372"></a>372. Inconsistent description of stdlib exceptions</h3>
! <p><b>Section:</b> 17.6.4.12 [res.on.exception.handling], 18.7.1 [type.info] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Randy Maddox <b>Opened:</b> 2002-07-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#res.on.exception.handling">issues</a> in [res.on.exception.handling].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>Paragraph 3 under clause 17.6.4.12 [res.on.exception.handling], Restrictions on
  Exception Handling, states that "Any other functions defined in the
  C++ Standard Library that do not have an exception-specification may
  throw implementation-defined exceptions unless otherwise specified."
--- 5466,5478 ----
  
  <hr>
  <h3><a name="372"></a>372. Inconsistent description of stdlib exceptions</h3>
! <p><b>Section:</b> 17.6.5.12 [res.on.exception.handling], 18.7.1 [type.info] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Randy Maddox <b>Opened:</b> 2002-07-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#res.on.exception.handling">issues</a> in [res.on.exception.handling].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>Paragraph 3 under clause 17.6.5.12 [res.on.exception.handling], Restrictions on
  Exception Handling, states that "Any other functions defined in the
  C++ Standard Library that do not have an exception-specification may
  throw implementation-defined exceptions unless otherwise specified."
*************** Standard library components ...".</p>
*** 6691,6699 ****
  
  <hr>
  <h3><a name="374"></a>374. moneypunct::frac_digits returns int not unsigned</h3>
! <p><b>Section:</b> 22.4.6.3.1 [locale.moneypunct.members], 22.4.6.3.2 [locale.moneypunct.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-08-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In section 22.4.6.3.1 [locale.moneypunct.members], frac_digits() returns type
--- 5506,5514 ----
  
  <hr>
  <h3><a name="374"></a>374. moneypunct::frac_digits returns int not unsigned</h3>
! <p><b>Section:</b> 22.4.6.3.1 [locale.moneypunct.members], 22.4.6.3.2 [locale.moneypunct.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-08-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In section 22.4.6.3.1 [locale.moneypunct.members], frac_digits() returns type
*************** checks.</p>
*** 6724,6737 ****
  
  <hr>
  <h3><a name="377"></a>377. basic_string::insert and length_error</h3>
! <p><b>Section:</b> 21.4.6.4 [string::insert] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-08-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::insert">issues</a> in [string::insert].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 21.4.6.4 [string::insert], paragraph 4, contains the following,
! "Then throws length_error if size() &gt;= npos - rlen."
  </p>
  
  <p>
--- 5539,5552 ----
  
  <hr>
  <h3><a name="377"></a>377. basic_string::insert and length_error</h3>
! <p><b>Section:</b> 21.4.6.4 [string::insert] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-08-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::insert">issues</a> in [string::insert].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 21.4.6.4 [string::insert], paragraph 4, contains the following,
! "Then throws length_error if size() >= npos - rlen."
  </p>
  
  <p>
*************** needed.</p>
*** 6750,6772 ****
  
  <hr>
  <h3><a name="378"></a>378. locale immutability and locale::operator=()</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-09-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#31">31</a></p>
  <p><b>Discussion:</b></p>
  <p>
  I think there is a problem with 22.1.1, p6 which says that
  </p>
! <pre>    -6- An instance of locale is immutable; once a facet reference
          is obtained from it, that reference remains usable as long
          as the locale value itself exists.
  </pre>
  <p>
  and 22.1.1.2, p4:
  </p>
! <pre>    const locale&amp; operator=(const locale&amp; other) throw();
  
      -4- Effects: Creates a copy of other, replacing the current value.
  </pre>
--- 5565,5589 ----
  
  <hr>
  <h3><a name="378"></a>378. locale immutability and locale::operator=()</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-09-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#31">31</a></p>
  <p><b>Discussion:</b></p>
  <p>
  I think there is a problem with 22.1.1, p6 which says that
  </p>
! <pre>
!     -6- An instance of locale is immutable; once a facet reference
          is obtained from it, that reference remains usable as long
          as the locale value itself exists.
  </pre>
  <p>
  and 22.1.1.2, p4:
  </p>
! <pre>
!     const locale&amp; operator=(const locale&amp; other) throw();
  
      -4- Effects: Creates a copy of other, replacing the current value.
  </pre>
*************** How can a reference to a facet obtained
*** 6775,6784 ****
  valid after an assignment that clearly must replace all the facets
  in the locale object? Imagine a program such as this
  </p>
! <pre>    std::locale loc ("de_DE");
!     const std::ctype&lt;char&gt; &amp;r0 = std::use_facet&lt;std::ctype&lt;char&gt; &gt;(loc);
      loc = std::locale ("en_US");
!     const std::ctype&lt;char&gt; &amp;r1 = std::use_facet&lt;std::ctype&lt;char&gt; &gt;(loc);
  </pre>
  <p>
  Is r0 really supposed to be preserved and destroyed only when loc goes
--- 5592,5602 ----
  valid after an assignment that clearly must replace all the facets
  in the locale object? Imagine a program such as this
  </p>
! <pre>
!     std::locale loc ("de_DE");
!     const std::ctype&lt;char> &amp;r0 = std::use_facet&lt;std::ctype&lt;char> >(loc);
      loc = std::locale ("en_US");
!     const std::ctype&lt;char> &amp;r1 = std::use_facet&lt;std::ctype&lt;char> >(loc);
  </pre>
  <p>
  Is r0 really supposed to be preserved and destroyed only when loc goes
*************** out of scope?
*** 6788,6794 ****
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[Summer '04 mid-meeting mailing: Martin and Dietmar believe this
!   is a duplicate of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#31">31</a> and recommend that it be
    closed.
  ]</i></p>
  
--- 5606,5612 ----
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[Summer '04 mid-meeting mailing: Martin and Dietmar believe this
!   is a duplicate of issue <a href="lwg-defects.html#31">31</a> and recommend that it be
    closed.
  ]</i></p>
  
*************** out of scope?
*** 6799,6808 ****
  
  <hr>
  <h3><a name="382"></a>382. codecvt do_in/out result</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-08-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It seems that the descriptions of codecvt do_in() and do_out() leave
--- 5617,5626 ----
  
  <hr>
  <h3><a name="382"></a>382. codecvt do_in/out result</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-08-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It seems that the descriptions of codecvt do_in() and do_out() leave
*************** NAD without prejudice. Will reopen if pr
*** 6939,6949 ****
  
  <hr>
  <h3><a name="385"></a>385. Does call by value imply the CopyConstructible requirement?</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2002-10-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Many function templates have parameters that are passed by value;
--- 5757,5767 ----
  
  <hr>
  <h3><a name="385"></a>385. Does call by value imply the CopyConstructible requirement?</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2002-10-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Many function templates have parameters that are passed by value;
*************** not be allowed.
*** 6982,6988 ****
  <p><i>[
  2007-01-12, Howard: First, despite the note above, references <b>are</b>
  copy constructible. They just aren't assignable.  Second, this is very
! closely related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#92">92</a> and should be consistent with that.
  That issue already says that implementations are allowed to copy
  function objects.  If one passes in a reference, it is copyable, but
  susceptible to slicing if one passes in a reference to a base.  Third,
--- 5800,5806 ----
  <p><i>[
  2007-01-12, Howard: First, despite the note above, references <b>are</b>
  copy constructible. They just aren't assignable.  Second, this is very
! closely related to <a href="lwg-defects.html#92">92</a> and should be consistent with that.
  That issue already says that implementations are allowed to copy
  function objects.  If one passes in a reference, it is copyable, but
  susceptible to slicing if one passes in a reference to a base.  Third,
*************** CopyConstructible). Finally (and fwiw),
*** 6993,7000 ****
  code all of the std::algorithms such that they do not copy function
  objects internally.  One merely passes them by reference internally if
  desired (this has been fully implemented and shipped for several years).
!  If this were mandated, it would reverse <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#92">92</a>, allowing
! function objects to reliably maintain state.  E.g. the example in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#92">92</a> would reliably remove only the third element.
  ]</i></p>
  
  
--- 5811,5818 ----
  code all of the std::algorithms such that they do not copy function
  objects internally.  One merely passes them by reference internally if
  desired (this has been fully implemented and shipped for several years).
!  If this were mandated, it would reverse <a href="lwg-defects.html#92">92</a>, allowing
! function objects to reliably maintain state.  E.g. the example in <a href="lwg-defects.html#92">92</a> would reliably remove only the third element.
  ]</i></p>
  
  
*************** then precisely describe and enforce the
*** 7017,7051 ****
  
  
  <hr>
! <h3><a name="388"></a>388. Use of complex as a key in associative containers</h3>
! <p><b>Section:</b> 26.4 [complex.numbers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2002-11-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.numbers">issues</a> in [complex.numbers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Practice with std::complex&lt;&gt; and the associative containers
  occasionally reveals artificial and distracting issues with constructs
! resembling: std::set&lt;std::complex&lt;double&gt; &gt; s;
  </p>
  
  <p>
! The main reason for the above to fail is the absence of an approriate
! definition for std::less&lt;std::complex&lt;T&gt; &gt;. That in turn comes from
! the definition of the primary template std::less&lt;&gt; in terms of
! operator&lt;.
  </p>
  
  <p>
  The usual argument goes as follows: Since there is no ordering over
  the complex field compatible with field operations it makes little
! sense to define a function operator&lt; operating on the datatype
! std::complex&lt;T&gt;.  That is fine. However, that reasoning does not carry
! over to std::less&lt;T&gt; which is used, among other things, by associative
  containers as an ordering useful to meet complexity requirements.
  </p>
  
! <p>Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#348">348</a>.</p>
  
  <p><i>[
  Pre Bellevue: Reopened at the request of Alisdair.
--- 5835,5870 ----
  
  
  <hr>
! <h3><a name="388"></a>388. Use of <tt>complex</tt> as a key in associative containers</h3>
! <p><b>Section:</b> 26.4 [complex.numbers] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2002-11-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#complex.numbers">active issues</a> in [complex.numbers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.numbers">issues</a> in [complex.numbers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Practice with <tt>std::complex&lt;&gt;</tt> and the associative containers
  occasionally reveals artificial and distracting issues with constructs
! resembling: <tt>std::set&lt;std::complex&lt;double&gt; &gt; s;</tt>
  </p>
  
  <p>
! The main reason for the above to fail is the absence of an appropriate
! definition for <tt>std::less&lt;std::complex&lt;T&gt; &gt;</tt>. That in turn comes from
! the definition of the primary template <tt>std::less&lt;&gt;</tt> in terms of
! <tt>operator&lt;</tt>.
  </p>
  
  <p>
  The usual argument goes as follows: Since there is no ordering over
  the complex field compatible with field operations it makes little
! sense to define a function <tt>operator&lt;</tt> operating on the datatype
! <tt>std::complex&lt;T&gt;</tt>.  That is fine. However, that reasoning does not carry
! over to <tt>std::less&lt;T&gt;</tt> which is used, among other things, by associative
  containers as an ordering useful to meet complexity requirements.
  </p>
  
! <p>Related issue: <a href="lwg-closed.html#348">348</a>.</p>
  
  <p><i>[
  Pre Bellevue: Reopened at the request of Alisdair.
*************** Bellevue:
*** 7057,7063 ****
  ]</i></p>
  
  
! <blockquote>
  This is a request for a design change, and not a defect in the standard.
  It is in scope to consider, but the group feels that it is not a change
  that we need to do. Is there a total ordering for floating point values,
--- 5876,5882 ----
  ]</i></p>
  
  
! <blockquote><p>
  This is a request for a design change, and not a defect in the standard.
  It is in scope to consider, but the group feels that it is not a change
  that we need to do. Is there a total ordering for floating point values,
*************** including NaN? There is not a clear enou
*** 7065,7077 ****
  problem for us to solve. Solving this problem would require solving the
  problem for floating point, which is equally unclear. The LWG noted that
  users who want to put objects into an associative container for which
! operator&lt; isn't defined can simply provide their own comparison function
! object. NAD
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Informally: Add a specialization of std::less for std::complex.</p>
  
  
  <p><b>Rationale:</b></p>
--- 5884,5896 ----
  problem for us to solve. Solving this problem would require solving the
  problem for floating point, which is equally unclear. The LWG noted that
  users who want to put objects into an associative container for which
! <tt>operator&lt;</tt> isn't defined can simply provide their own comparison 
! function object. NAD
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Informally: Add a specialization of <tt>std::less</tt> for <tt>std::complex</tt>.</p>
  
  
  <p><b>Rationale:</b></p>
*************** object. NAD
*** 7079,7085 ****
  believes this should not be treated a DR: it's a request for a design
  change, not a defect in the existing standard.  Most people (10-3)
  believed that we probably don't want this change, period: as with
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#348">348</a>, it's hard to know where to draw the line.
  The LWG noted that users who want to put objects into an associative
  container for which <tt>operator&lt;</tt> isn't defined can simply
  provide their own comparison function object.</p>
--- 5898,5904 ----
  believes this should not be treated a DR: it's a request for a design
  change, not a defect in the existing standard.  Most people (10-3)
  believed that we probably don't want this change, period: as with
! issue <a href="lwg-closed.html#348">348</a>, it's hard to know where to draw the line.
  The LWG noted that users who want to put objects into an associative
  container for which <tt>operator&lt;</tt> isn't defined can simply
  provide their own comparison function object.</p>
*************** provide their own comparison function ob
*** 7090,7113 ****
  
  <hr>
  <h3><a name="390"></a>390. CopyConstructible requirements too strict</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2002-10-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The CopyConstructible requirements in Table 30 state that for an
  object t of type T (where T is CopyConstructible), the expression &amp;t
  returns the address of t (with type T*). This requirement is overly
  strict, in that it disallows types that overload operator&amp; to not
! return a value of type T*. This occurs, for instance, in the <a href="http://www.boost.org/libs/lambda">Boost.Lambda</a> library, where
  operator&amp; is overloaded for a Boost.Lambda function object to return
  another function object.
  </p>
  
  <p>Example:</p>
  
! <pre>  std::vector&lt;int&gt; u, v;
    int x;
    // ...
    std::transform(u.begin(), u.end(), std::back_inserter(v), _1 * x);
--- 5909,5934 ----
  
  <hr>
  <h3><a name="390"></a>390. CopyConstructible requirements too strict</h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2002-10-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The CopyConstructible requirements in Table 30 state that for an
  object t of type T (where T is CopyConstructible), the expression &amp;t
  returns the address of t (with type T*). This requirement is overly
  strict, in that it disallows types that overload operator&amp; to not
! return a value of type T*. This occurs, for instance, in the <a
! href="http://www.boost.org/libs/lambda">Boost.Lambda</a> library, where
  operator&amp; is overloaded for a Boost.Lambda function object to return
  another function object.
  </p>
  
  <p>Example:</p>
  
! <pre>
!   std::vector&lt;int&gt; u, v;
    int x;
    // ...
    std::transform(u.begin(), u.end(), std::back_inserter(v), _1 * x);
*************** For reference, the address of an object
*** 7126,7132 ****
  the address-of operator with the following function template:
  </p>
  
! <pre>  template &lt;typename T&gt; T* addressof(T&amp; v)
    {
      return reinterpret_cast&lt;T*&gt;(
           &amp;const_cast&lt;char&amp;&gt;(reinterpret_cast&lt;const volatile char &amp;&gt;(v)));
--- 5947,5954 ----
  the address-of operator with the following function template:
  </p>
  
! <pre>
!   template &lt;typename T&gt; T* addressof(T&amp; v)
    {
      return reinterpret_cast&lt;T*&gt;(
           &amp;const_cast&lt;char&amp;&gt;(reinterpret_cast&lt;const volatile char &amp;&gt;(v)));
*************** the address-of operator with the followi
*** 7134,7140 ****
  </pre>
  
  <p>
! Note: this relates directly to library issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>, which
  will need to be reexamined if the CopyConstructible requirements
  change.
  </p>
--- 5956,5962 ----
  </pre>
  
  <p>
! Note: this relates directly to library issue <a href="lwg-closed.html#350">350</a>, which
  will need to be reexamined if the CopyConstructible requirements
  change.
  </p>
*************** that &amp;t and &amp;u return the addres
*** 7157,7166 ****
  
  <hr>
  <h3><a name="392"></a>392. 'equivalence' for input iterators</h3>
! <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Corwin Joy <b>Opened:</b> 2002-12-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 5979,5988 ----
  
  <hr>
  <h3><a name="392"></a>392. 'equivalence' for input iterators</h3>
! <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Corwin Joy <b>Opened:</b> 2002-12-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** are incorrect. (Or both).
*** 7183,7189 ****
  </p>
  
  <p>Consider the following example:</p>
! <pre>   #include &lt;iostream&gt;
     #include &lt;fstream&gt;
     #include &lt;iterator&gt;
     using namespace std;
--- 6005,6012 ----
  </p>
  
  <p>Consider the following example:</p>
! <pre>
!    #include &lt;iostream&gt;
     #include &lt;fstream&gt;
     #include &lt;iterator&gt;
     using namespace std;
*************** of input iterators.</p>
*** 7222,7231 ****
  
  <hr>
  <h3><a name="393"></a>393. do_in/do_out operation on state unclear</h3>
! <p><b>Section:</b> 22.4.1.4.2 [locale.codecvt.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alberto Barbati <b>Opened:</b> 2002-12-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.virtuals">issues</a> in [locale.codecvt.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  this DR follows the discussion on the previous thread "codecvt::do_in
--- 6045,6054 ----
  
  <hr>
  <h3><a name="393"></a>393. do_in/do_out operation on state unclear</h3>
! <p><b>Section:</b> 22.4.1.4.2 [locale.codecvt.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alberto Barbati <b>Opened:</b> 2002-12-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.virtuals">issues</a> in [locale.codecvt.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  this DR follows the discussion on the previous thread "codecvt::do_in
*************** correct. Proposed Disposition: NAD, Edit
*** 7284,7292 ****
  
  <hr>
  <h3><a name="394"></a>394. behavior of formatted output on failure</h3>
! <p><b>Section:</b> 27.7.2.6.1 [ostream.formatted.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-12-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is a contradiction in Formatted output about what bit is
--- 6107,6115 ----
  
  <hr>
  <h3><a name="394"></a>394. behavior of formatted output on failure</h3>
! <p><b>Section:</b> 27.7.3.6.1 [ostream.formatted.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-12-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is a contradiction in Formatted output about what bit is
*************** badbit and another that it's failbit.
*** 7297,7303 ****
  27.6.2.5.1, p1 says in the Common Requirements on Formatted output
  functions:
  </p>
! <pre>     ... If the generation fails, then the formatted output function
       does setstate(ios::failbit), which might throw an exception.
  </pre>
  <p>
--- 6120,6127 ----
  27.6.2.5.1, p1 says in the Common Requirements on Formatted output
  functions:
  </p>
! <pre>
!      ... If the generation fails, then the formatted output function
       does setstate(ios::failbit), which might throw an exception.
  </pre>
  <p>
*************** functions:
*** 7307,7315 ****
       ... The formatting conversion occurs as if it performed the
       following code fragment:
  </p>
! <pre>     bool failed =
!          use_facet&lt;num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt;
!          &gt; &gt;
           (getloc()).put(*this, *this, fill(), val). failed();
  
       ... If failed is true then does setstate(badbit) ...
--- 6131,6140 ----
       ... The formatting conversion occurs as if it performed the
       following code fragment:
  </p>
! <pre>
!      bool failed =
!          use_facet&lt;num_put&lt;charT,ostreambuf_iterator&lt;charT,traits>
!          > >
           (getloc()).put(*this, *this, fill(), val). failed();
  
       ... If failed is true then does setstate(badbit) ...
*************** functions should be changed as proposed
*** 7380,7388 ****
  ]</i></p>
  
  
! <blockquote>
  NAD. This issue is already fixed.
! </blockquote>
  
  
  
--- 6205,6213 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD. This issue is already fixed.
! </p></blockquote>
  
  
  
*************** NAD. This issue is already fixed.
*** 7397,7407 ****
  
  
  <hr>
! <h3><a name="397"></a>397. ostream::sentry dtor throws exceptions</h3>
! <p><b>Section:</b> 27.7.2.4 [ostream::sentry] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-01-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream::sentry">issues</a> in [ostream::sentry].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
  17.4.4.8, p3 prohibits library dtors from throwing exceptions.
--- 6222,6232 ----
  
  
  <hr>
! <h3><a name="397"></a>397. <tt>ostream::sentry</tt> dtor throws exceptions</h3>
! <p><b>Section:</b> 27.7.3.4 [ostream::sentry] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-01-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream::sentry">issues</a> in [ostream::sentry].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
  17.4.4.8, p3 prohibits library dtors from throwing exceptions.
*************** NAD. This issue is already fixed.
*** 7409,7421 ****
      <p>
  27.6.2.3, p4 says this about the ostream::sentry dtor:
      </p>
!     <pre>    -4- If ((os.flags() &amp; ios_base::unitbuf) &amp;&amp; !uncaught_exception())
          is true, calls os.flush().
      </pre>
      <p>
  27.6.2.6, p7 that describes ostream::flush() says:
      </p>
!     <pre>    -7- If rdbuf() is not a null pointer, calls rdbuf()-&gt;pubsync().
          If that function returns ?-1 calls setstate(badbit) (which
          may throw ios_base::failure (27.4.4.3)).
      </pre>
--- 6234,6248 ----
      <p>
  27.6.2.3, p4 says this about the ostream::sentry dtor:
      </p>
!     <pre>
!     -4- If ((os.flags() &amp; ios_base::unitbuf) &amp;&amp; !uncaught_exception())
          is true, calls os.flush().
      </pre>
      <p>
  27.6.2.6, p7 that describes ostream::flush() says:
      </p>
!     <pre>
!     -7- If rdbuf() is not a null pointer, calls rdbuf()->pubsync().
          If that function returns ?-1 calls setstate(badbit) (which
          may throw ios_base::failure (27.4.4.3)).
      </pre>
*************** sentry::~sentry() should internally catc
*** 7435,7441 ****
  
  
  <p><i>[
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#418">418</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a> for related issues.
  ]</i></p>
  
  
--- 6262,6268 ----
  
  
  <p><i>[
! See <a href="lwg-closed.html#418">418</a> and <a href="lwg-defects.html#622">622</a> for related issues.
  ]</i></p>
  
  
*************** See <a href="http://www.open-std.org/jtc
*** 7446,7452 ****
  
  <blockquote>
  <p>
! Move to Review. Add "Throws: nothing" to the specification of ostream::sentry::~sentry().
  </p>
  </blockquote>
  
--- 6273,6279 ----
  
  <blockquote>
  <p>
! Move to Review. Add "Throws: nothing" to the specification of <tt>ostream::sentry::~sentry()</tt>.
  </p>
  </blockquote>
  
*************** Move to Review. Add "Throws: nothing" to
*** 7455,7473 ****
  ]</i></p>
  
  
! <blockquote>
! The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a> is written to match the outcome
  of this issue.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! Move to Open.  Our intent is to solve this issue with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>.
! </blockquote>
  
  <p><i>[
  2010-03-06 Martin updates wording.
--- 6282,6300 ----
  ]</i></p>
  
  
! <blockquote><p>
! The proposed resolution of <a href="lwg-defects.html#835">835</a> is written to match the outcome
  of this issue.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! Move to Open.  Our intent is to solve this issue with <a href="lwg-defects.html#835">835</a>.
! </p></blockquote>
  
  <p><i>[
  2010-03-06 Martin updates wording.
*************** Move to Open.  Our intent is to solve th
*** 7479,7503 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD Editorial.
! </blockquote>
  
  
  
  <p><b>Rationale:</b></p>
  <p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add after 27.7.2.4 [ostream::sentry] p17:
  </p>
  
  <blockquote>
! <pre>~sentry();
  </pre>
  <blockquote>
  <p>
--- 6306,6331 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD Editorial.
! </p></blockquote>
  
  
  
  <p><b>Rationale:</b></p>
  <p>
! Solved by <a href="lwg-defects.html#835">835</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add after 27.7.3.4 [ostream::sentry] p17:
  </p>
  
  <blockquote>
! <pre>
! ~sentry();
  </pre>
  <blockquote>
  <p>
*************** is <tt>true</tt>, calls <tt>os.flush()</
*** 7517,7526 ****
  
  <hr>
  <h3><a name="398"></a>398. effects of end-of-file on unformatted input functions</h3>
! <p><b>Section:</b> 27.7.2.4 [ostream::sentry] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-01-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream::sentry">issues</a> in [ostream::sentry].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
  While reviewing unformatted input member functions of istream
--- 6345,6354 ----
  
  <hr>
  <h3><a name="398"></a>398. effects of end-of-file on unformatted input functions</h3>
! <p><b>Section:</b> 27.7.3.4 [ostream::sentry] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-01-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream::sentry">issues</a> in [ostream::sentry].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
  While reviewing unformatted input member functions of istream
*************** The following unformatted input member f
*** 7535,7574 ****
  encounter an end-of-file (this is the expected behavior, and also
  the behavior of all major implementations):
      </p>
!     <pre>    basic_istream&lt;charT, traits&gt;&amp;
      get (char_type*, streamsize, char_type);
      </pre>
      <p>
      Also sets failbit if it fails to extract any characters.
      </p>
!     <pre>    basic_istream&lt;charT, traits&gt;&amp;
      get (char_type*, streamsize);
      </pre>
      <p>
      Also sets failbit if it fails to extract any characters.
      </p>
!     <pre>    basic_istream&lt;charT, traits&gt;&amp;
      getline (char_type*, streamsize, char_type);
      </pre>
      <p>
      Also sets failbit if it fails to extract any characters.
      </p>
!     <pre>    basic_istream&lt;charT, traits&gt;&amp;
      getline (char_type*, streamsize);
      </pre>
      <p>
      Also sets failbit if it fails to extract any characters.
      </p>
!     <pre>    basic_istream&lt;charT, traits&gt;&amp;
      ignore (int, int_type);
      </pre>
!     <pre>    basic_istream&lt;charT, traits&gt;&amp;
      read (char_type*, streamsize);
      </pre>
      <p>
      Also sets failbit if it encounters end-of-file.
      </p>
!     <pre>    streamsize readsome (char_type*, streamsize);
      </pre>
  
      <p>
--- 6363,6409 ----
  encounter an end-of-file (this is the expected behavior, and also
  the behavior of all major implementations):
      </p>
!     <pre>
!     basic_istream&lt;charT, traits>&amp;
      get (char_type*, streamsize, char_type);
      </pre>
      <p>
      Also sets failbit if it fails to extract any characters.
      </p>
!     <pre>
!     basic_istream&lt;charT, traits>&amp;
      get (char_type*, streamsize);
      </pre>
      <p>
      Also sets failbit if it fails to extract any characters.
      </p>
!     <pre>
!     basic_istream&lt;charT, traits>&amp;
      getline (char_type*, streamsize, char_type);
      </pre>
      <p>
      Also sets failbit if it fails to extract any characters.
      </p>
!     <pre>
!     basic_istream&lt;charT, traits>&amp;
      getline (char_type*, streamsize);
      </pre>
      <p>
      Also sets failbit if it fails to extract any characters.
      </p>
!     <pre>
!     basic_istream&lt;charT, traits>&amp;
      ignore (int, int_type);
      </pre>
!     <pre>
!     basic_istream&lt;charT, traits>&amp;
      read (char_type*, streamsize);
      </pre>
      <p>
      Also sets failbit if it encounters end-of-file.
      </p>
!     <pre>
!     streamsize readsome (char_type*, streamsize);
      </pre>
  
      <p>
*************** failure from a failure due to end-of-fil
*** 7579,7587 ****
  also in conflict with all major implementation which set both
  eofbit and failbit):
      </p>
!     <pre>    int_type get();
      </pre>
!     <pre>    basic_istream&lt;charT, traits&gt;&amp;
      get (char_type&amp;);
      </pre>
      <p>
--- 6414,6424 ----
  also in conflict with all major implementation which set both
  eofbit and failbit):
      </p>
!     <pre>
!     int_type get();
      </pre>
!     <pre>
!     basic_istream&lt;charT, traits>&amp;
      get (char_type&amp;);
      </pre>
      <p>
*************** inconsistency quite unexpected; the requ
*** 7591,7608 ****
  conflict with all major implementations which set eofbit
  whenever they encounter end-of-file):
      </p>
!     <pre>    basic_istream&lt;charT, traits&gt;&amp;
!     get (basic_streambuf&lt;charT, traits&gt;&amp;, char_type);
      </pre>
!     <pre>    basic_istream&lt;charT, traits&gt;&amp;
!     get (basic_streambuf&lt;charT, traits&gt;&amp;);
      </pre>
      <p>
  This function sets no bits (all implementations except for
  STLport and Classic Iostreams set eofbit when they encounter
  end-of-file):
      </p>
!     <pre>    int_type peek ();
      </pre>
  <p>Informally, what we want is a global statement of intent saying
    that eofbit gets set if we trip across EOF, and then we can take
--- 6428,6448 ----
  conflict with all major implementations which set eofbit
  whenever they encounter end-of-file):
      </p>
!     <pre>
!     basic_istream&lt;charT, traits>&amp;
!     get (basic_streambuf&lt;charT, traits>&amp;, char_type);
      </pre>
!     <pre>
!     basic_istream&lt;charT, traits>&amp;
!     get (basic_streambuf&lt;charT, traits>&amp;);
      </pre>
      <p>
  This function sets no bits (all implementations except for
  STLport and Classic Iostreams set eofbit when they encounter
  end-of-file):
      </p>
!     <pre>
!     int_type peek ();
      </pre>
  <p>Informally, what we want is a global statement of intent saying
    that eofbit gets set if we trip across EOF, and then we can take
*************** end-of-file):
*** 7616,7624 ****
  ]</i></p>
  
  
! <blockquote>
! Moved to NAD.  See 27.7.1.1 [istream] p3.
! </blockquote>
  
  
  
--- 6456,6464 ----
  ]</i></p>
  
  
! <blockquote><p>
! Moved to NAD.  See 27.7.2.1 [istream] p3.
! </p></blockquote>
  
  
  
*************** Moved to NAD.  See 27.7.1.1 [istream] p3
*** 7629,7638 ****
  
  <hr>
  <h3><a name="399"></a>399. volations of unformatted input function requirements</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-01-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
  The Effects clauses for the two functions below violate the
--- 6469,6479 ----
  
  <hr>
  <h3><a name="399"></a>399. volations of unformatted input function requirements</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-01-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
  The Effects clauses for the two functions below violate the
*************** Note that in light of 27.6.1.1, p3 and p
*** 7648,7656 ****
  functions allow exceptions thrown from widen() to propagate
  may not strictly speaking be a defect (but the fact that the
  functions do not start by constructing a sentry object still
! is). However, since an exception thrown from ctype&lt;charT&gt;
  ::widen() during any other input operation (say, from within
! a call to num_get&lt;charT&gt;::get()) will be caught and cause
  badbit to be set, these two functions should not be treated
  differently for the sake of consistency.
      </p>
--- 6489,6497 ----
  functions allow exceptions thrown from widen() to propagate
  may not strictly speaking be a defect (but the fact that the
  functions do not start by constructing a sentry object still
! is). However, since an exception thrown from ctype&lt;charT>
  ::widen() during any other input operation (say, from within
! a call to num_get&lt;charT>::get()) will be caught and cause
  badbit to be set, these two functions should not be treated
  differently for the sake of consistency.
      </p>
*************** can use alternative signatures that don'
*** 7675,7685 ****
  
  
  <hr>
! <h3><a name="408"></a>408. Is vector&lt;reverse_iterator&lt;char*&gt; &gt; forbidden?</h3>
! <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 2003-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I've been discussing iterator semantics with Dave Abrahams, and a 
--- 6516,6526 ----
  
  
  <hr>
! <h3><a name="408"></a>408. Is <tt>vector&lt;reverse_iterator&lt;char*&gt; &gt;</tt> forbidden?</h3>
! <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 2003-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I've been discussing iterator semantics with Dave Abrahams, and a 
*************** X [iterator.concepts] says that the only
*** 7691,7700 ****
  iterator values is to assign a non-singular value to them.  (It 
  doesn't say they can be destroyed, and that's probably a defect.)  
  Some implementations have taken this to imply that there is no need 
! to initialize the data member of a reverse_iterator&lt;&gt; in the default
  constructor.  As a result, code like
  </p>
! <blockquote><pre>  std::vector&lt;std::reverse_iterator&lt;char*&gt; &gt; v(7);
    v.reserve(1000);
  </pre></blockquote>
  <p>
--- 6532,6542 ----
  iterator values is to assign a non-singular value to them.  (It 
  doesn't say they can be destroyed, and that's probably a defect.)  
  Some implementations have taken this to imply that there is no need 
! to initialize the data member of a <tt>reverse_iterator&lt;&gt;</tt> in the default
  constructor.  As a result, code like
  </p>
! <blockquote><pre>
!   std::vector&lt;std::reverse_iterator&lt;char*&gt; &gt; v(7);
    v.reserve(1000);
  </pre></blockquote>
  <p>
*************** One question is whether the standard ite
*** 7718,7724 ****
  copy semantics.  Another is whether they have defined destructor
  semantics: is
  </p>
! <blockquote><pre>  { std::vector&lt;std::reverse_iterator&lt;char*&gt; &gt;  v(7); }
  </pre></blockquote>
  <p>
  undefined too?
--- 6560,6567 ----
  copy semantics.  Another is whether they have defined destructor
  semantics: is
  </p>
! <blockquote><pre>
!   { std::vector&lt;std::reverse_iterator&lt;char*&gt; &gt;  v(7); }
  </pre></blockquote>
  <p>
  undefined too?
*************** rely on copy semantics for arbitrary ite
*** 7730,7741 ****
  types we actually supply support those operations.  I believe the 
  resolution must be expressed in terms of the semantics of the 
  adapter's argument type.  It should make clear that, e.g., the 
! reverse_iterator&lt;T&gt; constructor is actually required to execute
! T(), and so copying is defined if the result of T() is copyable.
  </p>
  
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>, which defines reverse_iterator's default
  constructor more precisely, has some relevance to this issue.
  However, it is not the whole story.
  </p>
--- 6573,6584 ----
  types we actually supply support those operations.  I believe the 
  resolution must be expressed in terms of the semantics of the 
  adapter's argument type.  It should make clear that, e.g., the 
! <tt>reverse_iterator&lt;T&gt;</tt> constructor is actually required to execute
! <tt>T()</tt>, and so copying is defined if the result of <tt>T()</tt> is copyable.
  </p>
  
  <p>
! Issue <a href="lwg-defects.html#235">235</a>, which defines <tt>reverse_iterator</tt>'s default
  constructor more precisely, has some relevance to this issue.
  However, it is not the whole story.
  </p>
*************** However, it is not the whole story.
*** 7743,7779 ****
  <p>
  The issue was whether 
  </p>
! <blockquote><pre>  reverse_iterator() { }
  </pre></blockquote>
  <p>
  is allowed, vs. 
  </p>
! <blockquote><pre>  reverse_iterator() : current() { }
  </pre></blockquote>
  
  <p>
! The difference is when T is char*, where the first leaves the member
  uninitialized, and possibly equal to an existing pointer value, or
  (on some targets) may result in a hardware trap when copied.
  </p>
  
  <p>
  8.5 paragraph 5 seems to make clear that the second is required to
! satisfy DR <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>, at least for non-class Iterator argument
  types.
  </p>
  
  <p>
! But that only takes care of reverse_iterator, and doesn't establish
  a policy for all iterators.  (The reverse iterator adapter was just
  an example.)  In particular, does my function
  </p>
! <blockquote><pre>  template &lt;typename Iterator&gt;
      void f() { std::vector&lt;Iterator&gt;  v(7); } 
  </pre></blockquote>
  <p>
  evoke undefined behavior for some conforming iterator definitions?
! I think it does, now, because vector&lt;&gt; will destroy those singular
  iterator values, and that's explicitly disallowed.
  </p>
  
--- 6586,6625 ----
  <p>
  The issue was whether 
  </p>
! <blockquote><pre>
!   reverse_iterator() { }
  </pre></blockquote>
  <p>
  is allowed, vs. 
  </p>
! <blockquote><pre>
!   reverse_iterator() : current() { }
  </pre></blockquote>
  
  <p>
! The difference is when <tt>T</tt> is <tt>char*</tt>, where the first leaves the member
  uninitialized, and possibly equal to an existing pointer value, or
  (on some targets) may result in a hardware trap when copied.
  </p>
  
  <p>
  8.5 paragraph 5 seems to make clear that the second is required to
! satisfy DR <a href="lwg-defects.html#235">235</a>, at least for non-class Iterator argument
  types.
  </p>
  
  <p>
! But that only takes care of <tt>reverse_iterator</tt>, and doesn't establish
  a policy for all iterators.  (The reverse iterator adapter was just
  an example.)  In particular, does my function
  </p>
! <blockquote><pre>
!   template &lt;typename Iterator&gt;
      void f() { std::vector&lt;Iterator&gt;  v(7); } 
  </pre></blockquote>
  <p>
  evoke undefined behavior for some conforming iterator definitions?
! I think it does, now, because <tt>vector&lt;&gt;</tt> will destroy those singular
  iterator values, and that's explicitly disallowed.
  </p>
  
*************** are default-initialized, and it should e
*** 7785,7791 ****
  iterator value, singular or not, default-initialized or not.
  </p>
  
! <p>Related issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#407">407</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a></p>
  <p><i>[
  We don't want to require all singular iterators to be copyable,
  because that is not the case for pointers.  However, default
--- 6631,6637 ----
  iterator value, singular or not, default-initialized or not.
  </p>
  
! <p>Related issues: <a href="lwg-defects.html#407">407</a>, <a href="lwg-defects.html#1012">1012</a></p>
  <p><i>[
  We don't want to require all singular iterators to be copyable,
  because that is not the case for pointers.  However, default
*************** wrong to impose so strict a requirement
*** 7802,7811 ****
  ]</i></p>
  
  
! <blockquote>
  The comments regarding destroying singular iterators have already been
  resolved.  That just leaves copying (with moving implied).
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
--- 6648,6657 ----
  ]</i></p>
  
  
! <blockquote><p>
  The comments regarding destroying singular iterators have already been
  resolved.  That just leaves copying (with moving implied).
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
*************** resolved.  That just leaves copying (wit
*** 7814,7831 ****
  
  <blockquote>
  <p>
! This is related to LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>.
  </p>
  <p>
! Note that there is a bug in the proposed resolution to LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>. The
  change to  [reverse.iter.con] should be modified so that the word
  "default" in the second sentence of the Effects clause is replaced by
  "value."
  </p>
  <p>
! We believe that the proposed fix to LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a> (now corrected) is
  sufficient to solve the problem for reverse_iterator. However, Alisdair
! pointed out that LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a> does not solve the general problem for authors
  of iterator adaptors.
  </p>
  <p>
--- 6660,6677 ----
  
  <blockquote>
  <p>
! This is related to LWG <a href="lwg-defects.html#1012">1012</a>.
  </p>
  <p>
! Note that there is a bug in the proposed resolution to LWG <a href="lwg-defects.html#1012">1012</a>. The
  change to  [reverse.iter.con] should be modified so that the word
  "default" in the second sentence of the Effects clause is replaced by
  "value."
  </p>
  <p>
! We believe that the proposed fix to LWG <a href="lwg-defects.html#1012">1012</a> (now corrected) is
  sufficient to solve the problem for reverse_iterator. However, Alisdair
! pointed out that LWG <a href="lwg-defects.html#1012">1012</a> does not solve the general problem for authors
  of iterator adaptors.
  </p>
  <p>
*************** Move to Review after Alisdair updates th
*** 7845,7851 ****
  
  <p><i>[
  2009-08-17 Alisdair and Daniel collaborate on slightly revised wording.
! This issue depends upon <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>
  ]</i></p>
  
  
--- 6691,6697 ----
  
  <p><i>[
  2009-08-17 Alisdair and Daniel collaborate on slightly revised wording.
! This issue depends upon <a href="lwg-defects.html#724">724</a>
  ]</i></p>
  
  
*************** This issue depends upon <a href="http://
*** 7854,7873 ****
  ]</i></p>
  
  
! <blockquote>
! There is a clear dependency on <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1213">1213</a>, because the term "singular",
  which is used as part of the resolution, is not properly defined yet.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Moved to Open. Alisdair will provide improved wording to make
  this have "value semantics" and otherwise behave like a valid iterator.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
--- 6700,6719 ----
  ]</i></p>
  
  
! <blockquote><p>
! There is a clear dependency on <a href="lwg-active.html#1213">1213</a>, because the term "singular",
  which is used as part of the resolution, is not properly defined yet.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Open. Alisdair will provide improved wording to make
  this have "value semantics" and otherwise behave like a valid iterator.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
*************** Values of an iterator <tt>i</tt> for whi
*** 7899,7905 ****
  dereferenceable. Iterators can also have singular values that are not
  associated with any container. [<i>Example:</i> After the declaration of an
  uninitialized pointer <tt>x</tt> (as with <tt>int* x;</tt>), <tt>x</tt> must always be assumed to
! have a singular value of a pointer. — <i>end example</i>] Results of most
  expressions are undefined for singular values; the only exceptions are
  destroying an iterator that holds a singular value and the assignment of
  a non-singular value to an iterator that holds a singular value. In this
--- 6745,6751 ----
  dereferenceable. Iterators can also have singular values that are not
  associated with any container. [<i>Example:</i> After the declaration of an
  uninitialized pointer <tt>x</tt> (as with <tt>int* x;</tt>), <tt>x</tt> must always be assumed to
! have a singular value of a pointer. &mdash; <i>end example</i>] Results of most
  expressions are undefined for singular values; the only exceptions are
  destroying an iterator that holds a singular value and the assignment of
  a non-singular value to an iterator that holds a singular value. In this
*************** when used <ins>as</ins> the
*** 7913,7919 ****
  source of a copy or move operation, even if it would
  otherwise be singular. [<i>Note:</i> This guarantee is not offered for
  default-initialization (8.5 [dcl.init]), although the distinction only
! matters for types with trivial default constructors such as pointers. —
  <i>end note</i>]
  </ins></p>
  
--- 6759,6765 ----
  source of a copy or move operation, even if it would
  otherwise be singular. [<i>Note:</i> This guarantee is not offered for
  default-initialization (8.5 [dcl.init]), although the distinction only
! matters for types with trivial default constructors such as pointers. &mdash;
  <i>end note</i>]
  </ins></p>
  
*************** matters for types with trivial default c
*** 7926,7949 ****
  
  
  <hr>
! <h3><a name="417"></a>417. what does ctype::do_widen() return on failure</h3>
! <p><b>Section:</b> 22.4.1.1.2 [locale.ctype.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.ctype.virtuals">issues</a> in [locale.ctype.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The Effects and Returns clauses of the do_widen() member function of
! the ctype facet fail to specify the behavior of the function on failure.
  That the function may not be able to simply cast the narrow character
  argument to the type of the result since doing so may yield the wrong value
! for some wchar_t encodings. Popular implementations of ctype&lt;wchar_t&gt; that
! use mbtowc() and UTF-8 as the native encoding (e.g., GNU glibc) will fail
  when the argument's MSB is set. There is no way for the the rest of locale
  and iostream to reliably detect this failure. 
  </p>
  <p><i>[Kona: This is a real problem.  Widening can fail.  It's unclear
!   what the solution should be.  Returning WEOF works for the wchar_t
    specialization, but not in general.  One option might be to add a
    default, like <i>narrow</i>.  But that's an incompatible change.
    Using <i>traits::eof</i> might seem like a good idea, but facets
--- 6772,6795 ----
  
  
  <hr>
! <h3><a name="417"></a>417. what does <tt>ctype::do_widen()</tt> return on failure</h3>
! <p><b>Section:</b> 22.4.1.1.2 [locale.ctype.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.ctype.virtuals">issues</a> in [locale.ctype.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The Effects and Returns clauses of the <tt>do_widen()</tt> member function of
! the <tt>ctype</tt> facet fail to specify the behavior of the function on failure.
  That the function may not be able to simply cast the narrow character
  argument to the type of the result since doing so may yield the wrong value
! for some <tt>wchar_t</tt> encodings. Popular implementations of <tt>ctype&lt;wchar_t&gt;</tt> that
! use <tt>mbtowc()</tt> and UTF-8 as the native encoding (e.g., GNU glibc) will fail
  when the argument's MSB is set. There is no way for the the rest of locale
  and iostream to reliably detect this failure. 
  </p>
  <p><i>[Kona: This is a real problem.  Widening can fail.  It's unclear
!   what the solution should be.  Returning <tt>WEOF</tt> works for the <tt>wchar_t</tt>
    specialization, but not in general.  One option might be to add a
    default, like <i>narrow</i>.  But that's an incompatible change.
    Using <i>traits::eof</i> might seem like a good idea, but facets
*************** and iostream to reliably detect this fai
*** 7958,7967 ****
  ]</i></p>
  
  
! <blockquote>
  NAD. The behavior is specified for all of the facets that an
  implementation is required to provide, for the basic character set.
! </blockquote>
  
  
  
--- 6804,6813 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD. The behavior is specified for all of the facets that an
  implementation is required to provide, for the basic character set.
! </p></blockquote>
  
  
  
*************** implementation is required to provide, f
*** 7972,7985 ****
  
  <hr>
  <h3><a name="418"></a>418. exceptions thrown during iostream cleanup</h3>
! <p><b>Section:</b> 27.5.2.1.6 [ios::Init] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios::Init">issues</a> in [ios::Init].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The dtor of the ios_base::Init object is supposed to call flush() on the
! 6 standard iostream objects cout, cerr, clog, wcout, wcerr, and wclog.
  This call may cause an exception to be thrown.
  </p>
  
--- 6818,6832 ----
  
  <hr>
  <h3><a name="418"></a>418. exceptions thrown during iostream cleanup</h3>
! <p><b>Section:</b> 27.5.3.1.6 [ios::Init] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios::Init">issues</a> in [ios::Init].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The dtor of the <tt>ios_base::Init</tt> object is supposed to call <tt>flush()</tt> on the
! 6 standard iostream objects <tt>cout</tt>, <tt>cerr</tt>, <tt>clog</tt>, <tt>wcout</tt>, 
! <tt>wcerr</tt>, and <tt>wclog</tt>.
  This call may cause an exception to be thrown.
  </p>
  
*************** This call may cause an exception to be t
*** 7989,8009 ****
  
  <p>
  The question is: What should this dtor do if one or more of these calls
! to flush() ends up throwing an exception? This can happen quite easily
  if one of the facets installed in the locale imbued in the iostream
  object throws.
  </p>
  <p><i>[Kona: We probably can't do much better than what we've got, so
    the LWG is leaning toward NAD.  At the point where the standard
    stream objects are being cleaned up, the usual error reporting
!   mechanism are all unavailable.  And exception from flush at this
    point will definitely cause problems.  A quality implementation
!   might reasonably swallow the exception, or call abort, or do
    something even more drastic.]</i></p>
  
  
  <p><i>[
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a> for related issues.
  ]</i></p>
  
  
--- 6836,6856 ----
  
  <p>
  The question is: What should this dtor do if one or more of these calls
! to <tt>flush()</tt> ends up throwing an exception? This can happen quite easily
  if one of the facets installed in the locale imbued in the iostream
  object throws.
  </p>
  <p><i>[Kona: We probably can't do much better than what we've got, so
    the LWG is leaning toward NAD.  At the point where the standard
    stream objects are being cleaned up, the usual error reporting
!   mechanism are all unavailable.  And exception from <tt>flush</tt> at this
    point will definitely cause problems.  A quality implementation
!   might reasonably swallow the exception, or call <tt>abort</tt>, or do
    something even more drastic.]</i></p>
  
  
  <p><i>[
! See <a href="lwg-closed.html#397">397</a> and <a href="lwg-defects.html#622">622</a> for related issues.
  ]</i></p>
  
  
*************** See <a href="http://www.open-std.org/jtc
*** 8012,8020 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD, no consensus for change.
! </blockquote>
  
  
  
--- 6859,6867 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD, no consensus for change.
! </p></blockquote>
  
  
  
*************** Moved to NAD, no consensus for change.
*** 8024,8038 ****
  
  
  <hr>
! <h3><a name="421"></a>421. is basic_streambuf copy-constructible?</h3>
! <p><b>Section:</b> 27.6.2.1 [streambuf.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#streambuf.cons">issues</a> in [streambuf.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The reflector thread starting with c++std-lib-11346 notes that the class
! template basic_streambuf, along with basic_stringbuf and basic_filebuf,
  is copy-constructible but that the semantics of the copy constructors
  are not defined anywhere. Further, different implementations behave
  differently in this respect: some prevent copy construction of objects
--- 6871,6885 ----
  
  
  <hr>
! <h3><a name="421"></a>421. is <tt>basic_streambuf</tt> copy-constructible?</h3>
! <p><b>Section:</b> 27.6.3.1 [streambuf.cons] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#streambuf.cons">issues</a> in [streambuf.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The reflector thread starting with c++std-lib-11346 notes that the class
! template <tt>basic_streambuf</tt>, along with <tt>basic_stringbuf</tt> and <tt>basic_filebuf</tt>,
  is copy-constructible but that the semantics of the copy constructors
  are not defined anywhere. Further, different implementations behave
  differently in this respect: some prevent copy construction of objects
*************** of the standard provide a compiler-gener
*** 8048,8054 ****
  operator yet fail to specify their semantics.  It's believed that the
  only types for which this is actually a problem (i.e. types where the
  compiler-generated default may be inappropriate and may not have been
! intended) are locale facets.  See issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#439">439</a>.
  </p>
  
  <p><i>[
--- 6895,6901 ----
  operator yet fail to specify their semantics.  It's believed that the
  only types for which this is actually a problem (i.e. types where the
  compiler-generated default may be inappropriate and may not have been
! intended) are locale facets.  See issue <a href="lwg-closed.html#439">439</a>.
  </p>
  
  <p><i>[
*************** intended) are locale facets.  See issue
*** 8056,8064 ****
  ]</i></p>
  
  
! <blockquote>
  NAD. Option B is already in the Working Draft.
! </blockquote>
  
  
  
--- 6903,6911 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD. Option B is already in the Working Draft.
! </p></blockquote>
  
  
  
*************** NAD. Option B is already in the Working
*** 8068,8086 ****
  </p>
  
  <blockquote>
! <pre>basic_streambuf(const basic_streambuf&amp; sb);
  basic_streambuf&amp; operator=(const basic_streambuf&amp; sb);
  </pre>
  </blockquote>
  
  <p>Insert after 27.5.2.1, paragraph 2:</p>
  <blockquote>
! <pre>basic_streambuf(const basic_streambuf&amp; sb);
  </pre>
  
! <p>Constructs a copy of sb.</p>
  <p>Postcondtions:</p>
! <pre>                eback() == sb.eback()
                  gptr()  == sb.gptr()
                  egptr() == sb.egptr()
                  pbase() == sb.pbase()
--- 6915,6936 ----
  </p>
  
  <blockquote>
! <pre>
! basic_streambuf(const basic_streambuf&amp; sb);
  basic_streambuf&amp; operator=(const basic_streambuf&amp; sb);
  </pre>
  </blockquote>
  
  <p>Insert after 27.5.2.1, paragraph 2:</p>
  <blockquote>
! <pre>
! basic_streambuf(const basic_streambuf&amp; sb);
  </pre>
  
! <p>Constructs a copy of <tt>sb</tt>.</p>
  <p>Postcondtions:</p>
! <pre>
!                 eback() == sb.eback()
                  gptr()  == sb.gptr()
                  egptr() == sb.egptr()
                  pbase() == sb.pbase()
*************** basic_streambuf&amp; operator=(const bas
*** 8089,8101 ****
                  getloc() == sb.getloc()
  </pre>
  
! <pre>basic_streambuf&amp; operator=(const basic_streambuf&amp; sb);
  </pre>
  
! <p>Assigns the data members of sb to this.</p>
  
  <p>Postcondtions:</p>
! <pre>                eback() == sb.eback()
                  gptr()  == sb.gptr()
                  egptr() == sb.egptr()
                  pbase() == sb.pbase()
--- 6939,6953 ----
                  getloc() == sb.getloc()
  </pre>
  
! <pre>
! basic_streambuf&amp; operator=(const basic_streambuf&amp; sb);
  </pre>
  
! <p>Assigns the data members of <tt>sb</tt> to this.</p>
  
  <p>Postcondtions:</p>
! <pre>
!                 eback() == sb.eback()
                  gptr()  == sb.gptr()
                  egptr() == sb.egptr()
                  pbase() == sb.pbase()
*************** basic_streambuf&amp; operator=(const bas
*** 8112,8120 ****
  <p><b>Option A:</b></p>
  
  <blockquote>
! <p>Insert into the basic_stringbuf synopsis in the private section:</p>
  
! <pre>basic_stringbuf(const basic_stringbuf&amp;);             // not defined
  basic_stringbuf&amp; operator=(const basic_stringbuf&amp;);  // not defined
  </pre>
  </blockquote>
--- 6964,6973 ----
  <p><b>Option A:</b></p>
  
  <blockquote>
! <p>Insert into the <tt>basic_stringbuf</tt> synopsis in the private section:</p>
  
! <pre>
! basic_stringbuf(const basic_stringbuf&amp;);             // not defined
  basic_stringbuf&amp; operator=(const basic_stringbuf&amp;);  // not defined
  </pre>
  </blockquote>
*************** basic_stringbuf&amp; operator=(const bas
*** 8122,8130 ****
  <p><b>Option B:</b></p>
  
  <blockquote>
! <p>Insert into the basic_stringbuf synopsis in the public section:</p>
  
! <pre>basic_stringbuf(const basic_stringbuf&amp; sb);
  basic_stringbuf&amp; operator=(const basic_stringbuf&amp; sb);
  </pre>
  
--- 6975,6984 ----
  <p><b>Option B:</b></p>
  
  <blockquote>
! <p>Insert into the <tt>basic_stringbuf</tt> synopsis in the public section:</p>
  
! <pre>
! basic_stringbuf(const basic_stringbuf&amp; sb);
  basic_stringbuf&amp; operator=(const basic_stringbuf&amp; sb);
  </pre>
  
*************** basic_stringbuf&amp; operator=(const bas
*** 8133,8143 ****
  <pre>basic_stringbuf(const basic_stringbuf&amp; sb);</pre>
  
  <p>
! Constructs an independent copy of sb as if with sb.str(), and with the openmode that sb was constructed with.
  </p>
  
  <p>Postcondtions: </p>
! <pre>               str() == sb.str()
                 gptr()  - eback() == sb.gptr()  - sb.eback()
                 egptr() - eback() == sb.egptr() - sb.eback()
                 pptr()  - pbase() == sb.pptr()  - sb.pbase()
--- 6987,6998 ----
  <pre>basic_stringbuf(const basic_stringbuf&amp; sb);</pre>
  
  <p>
! Constructs an independent copy of <tt>sb</tt> as if with <tt>sb.str()</tt>, and with the openmode that <tt>sb</tt> was constructed with.
  </p>
  
  <p>Postcondtions: </p>
! <pre>
!                str() == sb.str()
                 gptr()  - eback() == sb.gptr()  - sb.eback()
                 egptr() - eback() == sb.egptr() - sb.eback()
                 pptr()  - pbase() == sb.pptr()  - sb.pbase()
*************** Constructs an independent copy of sb as
*** 8145,8186 ****
  </pre>
  
  <p>
! Note:  The only requirement on epptr() is that it point beyond the initialized range if an output sequence exists.  There is no requirement that epptr() - pbase() == sb.epptr() - sb.pbase().
  </p>
  
  <pre>basic_stringbuf&amp; operator=(const basic_stringbuf&amp; sb);</pre>
  <p>
! After assignment the basic_stringbuf has the same state as if it were initially copy constructed from sb, except that the basic_stringbuf is allowed to retain any excess capacity it might have, which may in turn effect the value of epptr().
  </p>
  </blockquote>
  
  <p>27.8.1.1 [lib.filebuf]</p>
  
! <p>Insert at the bottom of the basic_filebuf synopsis:</p>
  
  <blockquote>
! <pre>private:
    basic_filebuf(const basic_filebuf&amp;);             // not defined
    basic_filebuf&amp; operator=(const basic_filebuf&amp;);  // not defined
  </pre>
  </blockquote>
! <p><i>[Kona: this is an issue for basic_streambuf itself and for its
!   derived classes.  We are leaning toward allowing basic_streambuf to
    be copyable, and specifying its precise semantics.  (Probably the
    obvious: copying the buffer pointers.)  We are less sure whether
!   the streambuf derived classes should be copyable.  Howard will
    write up a proposal.]</i></p>
  
  
! <p><i>[Sydney: Dietmar presented a new argument against basic_streambuf
!   being copyable: it can lead to an encapsulation violation. Filebuf
!   inherits from streambuf. Now suppose you inhert a my_hijacking_buf
!   from streambuf. You can copy the streambuf portion of a filebuf to a
!   my_hijacking_buf, giving you access to the pointers into the
!   filebuf's internal buffer. Perhaps not a very strong argument, but
    it was strong enough to make people nervous. There was weak
!   preference for having streambuf not be copyable. There was weak
!   preference for having stringbuf not be copyable even if streambuf
    is. Move this issue to open for now.
  ]</i></p>
  
--- 7000,7045 ----
  </pre>
  
  <p>
! Note:  The only requirement on <tt>epptr()</tt> is that it point beyond the initialized range if an 
! output sequence exists.  There is no requirement that <tt>epptr() - pbase() == sb.epptr() - sb.pbase()</tt>.
  </p>
  
  <pre>basic_stringbuf&amp; operator=(const basic_stringbuf&amp; sb);</pre>
  <p>
! After assignment the <tt>basic_stringbuf</tt> has the same state as if it were initially copy constructed 
! from <tt>sb</tt>, except that the <tt>basic_stringbuf</tt> is allowed to retain any excess capacity it 
! might have, which may in turn effect the value of <tt>epptr()</tt>.
  </p>
  </blockquote>
  
  <p>27.8.1.1 [lib.filebuf]</p>
  
! <p>Insert at the bottom of the <tt>basic_filebuf</tt> synopsis:</p>
  
  <blockquote>
! <pre>
! private:
    basic_filebuf(const basic_filebuf&amp;);             // not defined
    basic_filebuf&amp; operator=(const basic_filebuf&amp;);  // not defined
  </pre>
  </blockquote>
! <p><i>[Kona: this is an issue for <tt>basic_streambuf</tt> itself and for its
!   derived classes.  We are leaning toward allowing <tt>basic_streambuf</tt> to
    be copyable, and specifying its precise semantics.  (Probably the
    obvious: copying the buffer pointers.)  We are less sure whether
!   the <tt>streambuf</tt> derived classes should be copyable.  Howard will
    write up a proposal.]</i></p>
  
  
! <p><i>[Sydney: Dietmar presented a new argument against <tt>basic_streambuf</tt>
!   being copyable: it can lead to an encapsulation violation. <tt>filebuf</tt>
!   inherits from <tt>streambuf</tt>. Now suppose you inherit a <tt>my_hijacking_buf</tt>
!   from <tt>streambuf</tt>. You can copy the <tt>streambuf</tt> portion of a <tt>filebuf</tt> to a
!   <tt>my_hijacking_buf</tt>, giving you access to the pointers into the
!   <tt>filebuf</tt>'s internal buffer. Perhaps not a very strong argument, but
    it was strong enough to make people nervous. There was weak
!   preference for having <tt>streambuf</tt> not be copyable. There was weak
!   preference for having <tt>stringbuf</tt> not be copyable even if <tt>streambuf</tt>
    is. Move this issue to open for now.
  ]</i></p>
  
*************** move semantics less tedious and error pr
*** 8202,8208 ****
  
  <p><b>Rationale:</b></p>
  <p>
! 27.5.2 [lib.streambuf]: The proposed basic_streambuf copy constructor
  and assignment operator are the same as currently implied by the lack
  of declarations: public and simply copies the data members.  This
  resolution is not a change but a clarification of the current
--- 7061,7067 ----
  
  <p><b>Rationale:</b></p>
  <p>
! 27.5.2 [lib.streambuf]: The proposed <tt>basic_streambuf</tt> copy constructor
  and assignment operator are the same as currently implied by the lack
  of declarations: public and simply copies the data members.  This
  resolution is not a change but a clarification of the current
*************** standard.
*** 8211,8220 ****
  
  <p>
  27.7.1 [lib.stringbuf]: There are two reasonable options: A) Make
! basic_stringbuf not copyable.  This is likely the status-quo of
  current implementations.  B) Reasonable copy semantics of
! basic_stringbuf can be defined and implemented.  A copyable
! basic_streambuf is arguably more useful than a non-copyable one.  This
  should be considered as new functionality and not the fixing of a
  defect.  If option B is chosen, ramifications from issue 432 are taken
  into account.
--- 7070,7079 ----
  
  <p>
  27.7.1 [lib.stringbuf]: There are two reasonable options: A) Make
! <tt>basic_stringbuf</tt> not copyable.  This is likely the status-quo of
  current implementations.  B) Reasonable copy semantics of
! <tt>basic_stringbuf</tt> can be defined and implemented.  A copyable
! <tt>basic_streambuf</tt> is arguably more useful than a non-copyable one.  This
  should be considered as new functionality and not the fixing of a
  defect.  If option B is chosen, ramifications from issue 432 are taken
  into account.
*************** into account.
*** 8222,8287 ****
  
  <p>
  27.8.1.1 [lib.filebuf]: There are no reasonable copy semantics for
! basic_filebuf.
! </p>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="423"></a>423. effects of negative streamsize in iostreams</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! A third party test suite tries to exercise istream::ignore(N) with
! a negative value of N and expects that the implementation will treat
! N as if it were 0. Our implementation asserts that (N &gt;= 0) holds and
! aborts the test.
! </p>
! 
! <p>
! I can't find anything in section 27 that prohibits such values but I don't
! see what the effects of such calls should be, either (this applies to
! a number of unformatted input functions as well as some member functions
! of the basic_streambuf template).
! </p>
! 
! <p><i>[
! 2009-07 Frankfurt
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! This is related to LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#255">255</a>.
! </p>
! <p>
! Move to NAD Future.
! </p>
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! I propose that we add to each function in clause 27 that takes an argument,
! say N, of type streamsize a Requires clause saying that "N &gt;= 0." The intent
! is to allow negative streamsize values in calls to precision() and width()
! but disallow it in calls to streambuf::sgetn(), istream::ignore(), or
! ostream::write().
  </p>
  
- <p><i>[Kona: The LWG agreed that this is probably what we want.  However, we
-   need a review to find all places where functions in clause 27 take
-   arguments of type streamsize that shouldn't be allowed to go
-   negative.  Martin will do that review.]</i></p>
- 
  
  
  
--- 7081,7089 ----
  
  <p>
  27.8.1.1 [lib.filebuf]: There are no reasonable copy semantics for
! <tt>basic_filebuf</tt>.
  </p>
  
  
  
  
*************** ostream::write().
*** 8289,8345 ****
  
  <hr>
  <h3><a name="424"></a>424. normative notes</h3>
! <p><b>Section:</b> 17.5.1.2 [structure.summary] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  The text in 17.3.1.1, p1 says:
! <br>
  
  "Paragraphs labelled "Note(s):" or "Example(s):" are informative, other
  paragraphs are normative."
! <br>
  
  The library section makes heavy use of paragraphs labeled "Notes(s),"
  some of which are clearly intended to be normative (see list 1), while
  some others are not (see list 2). There are also those where the intent
  is not so clear (see list 3).
! <br><br>
  
  List 1 -- Examples of (presumably) normative Notes:
! <br>
  
! 20.9.5.1 [allocator.members], p3,<br>
! 20.9.5.1 [allocator.members], p10,<br>
! 21.4.2 [string.cons], p11,<br>
! 22.3.1.2 [locale.cons], p11,<br>
! 23.3.2.3 [deque.modifiers], p2,<br>
! 25.4.7 [alg.min.max], p3,<br>
! 26.4.6 [complex.ops], p15,<br>
! 27.6.2.4.3 [streambuf.virt.get], p7.<br>
! <br>
  
  List 2 -- Examples of (presumably) informative Notes:
! <br>
  
! 18.6.1.3 [new.delete.placement], p3,<br>
! 21.4.6.6 [string::replace], p14,<br>
! 22.4.1.4.2 [locale.codecvt.virtuals], p3,<br>
! 25.2.4 [alg.foreach], p4,<br>
! 26.4.5 [complex.member.ops], p1,<br>
! 27.5.2.5 [ios.base.storage], p6.<br>
! <br>
  
  List 3 -- Examples of Notes that are not clearly either normative
  or informative:
! <br>
  
! 22.3.1.2 [locale.cons], p8,<br>
! 22.3.1.5 [locale.statics], p6,<br>
! 27.6.2.4.5 [streambuf.virt.put], p4.<br>
! <br>
  
  None of these lists is meant to be exhaustive.
  </p>
--- 7091,7147 ----
  
  <hr>
  <h3><a name="424"></a>424. normative notes</h3>
! <p><b>Section:</b> 17.5.1.2 [structure.summary] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  The text in 17.3.1.1, p1 says:
! <br/>
  
  "Paragraphs labelled "Note(s):" or "Example(s):" are informative, other
  paragraphs are normative."
! <br/>
  
  The library section makes heavy use of paragraphs labeled "Notes(s),"
  some of which are clearly intended to be normative (see list 1), while
  some others are not (see list 2). There are also those where the intent
  is not so clear (see list 3).
! <br/><br/>
  
  List 1 -- Examples of (presumably) normative Notes:
! <br/>
  
! 20.7.9.1 [allocator.members], p3,<br/>
! 20.7.9.1 [allocator.members], p10,<br/>
! 21.4.2 [string.cons], p11,<br/>
! 22.3.1.2 [locale.cons], p11,<br/>
! 23.3.3.4 [deque.modifiers], p2,<br/>
! 25.4.7 [alg.min.max], p3,<br/>
! 26.4.6 [complex.ops], p15,<br/>
! 27.6.3.4.3 [streambuf.virt.get], p7.<br/>
! <br/>
  
  List 2 -- Examples of (presumably) informative Notes:
! <br/>
  
! 18.6.1.3 [new.delete.placement], p3,<br/>
! 21.4.6.6 [string::replace], p14,<br/>
! 22.4.1.4.2 [locale.codecvt.virtuals], p3,<br/>
! 25.2.4 [alg.foreach], p4,<br/>
! 26.4.5 [complex.member.ops], p1,<br/>
! 27.5.3.5 [ios.base.storage], p6.<br/>
! <br/>
  
  List 3 -- Examples of Notes that are not clearly either normative
  or informative:
! <br/>
  
! 22.3.1.2 [locale.cons], p8,<br/>
! 22.3.1.5 [locale.statics], p6,<br/>
! 27.6.3.4.5 [streambuf.virt.put], p4.<br/>
! <br/>
  
  None of these lists is meant to be exhaustive.
  </p>
*************** Move to NAD Editorial.
*** 8400,8410 ****
  
  <hr>
  <h3><a name="429"></a>429. typo in basic_ios::clear(iostate)</h3>
! <p><b>Section:</b> 27.5.4.3 [iostate.flags] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#412">412</a></p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 7202,7212 ----
  
  <hr>
  <h3><a name="429"></a>429. typo in basic_ios::clear(iostate)</h3>
! <p><b>Section:</b> 27.5.5.4 [iostate.flags] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#412">412</a></p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** holds would not result in an exception b
*** 8421,8433 ****
          <p>
  
  The text ought to be changed from
! <br>
  
  "If (rdstate() &amp; exceptions()) == 0, returns. ..."
! <br>
  
  to
! <br>
  
  "If (state &amp; exceptions()) == 0, returns. ..."
          </p>
--- 7223,7235 ----
          <p>
  
  The text ought to be changed from
! <br/>
  
  "If (rdstate() &amp; exceptions()) == 0, returns. ..."
! <br/>
  
  to
! <br/>
  
  "If (state &amp; exceptions()) == 0, returns. ..."
          </p>
*************** to
*** 8442,8450 ****
  
  <hr>
  <h3><a name="433"></a>433. Contradiction in specification of unexpected()</h3>
! <p><b>Section:</b> D.13.3 [unexpected] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Vyatcheslav Sysoltsev <b>Opened:</b> 2003-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Clause 15.5.2 [except.unexpected] paragraph 1 says that "void unexpected();
--- 7244,7252 ----
  
  <hr>
  <h3><a name="433"></a>433. Contradiction in specification of unexpected()</h3>
! <p><b>Section:</b> D.8.4 [unexpected] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Vyatcheslav Sysoltsev <b>Opened:</b> 2003-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Clause 15.5.2 [except.unexpected] paragraph 1 says that "void unexpected();
*************** ambiguity in understanding.
*** 8475,8489 ****
  
  <hr>
  <h3><a name="437"></a>437. Formatted output of function pointers is confusing</h3>
! <p><b>Section:</b> 27.7.2.6.2 [ostream.inserters.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ivan Godard <b>Opened:</b> 2003-10-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream.inserters.arithmetic">issues</a> in [ostream.inserters.arithmetic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Given:
  </p>
! <pre>void f(int) {}
  void(*g)(int) = f;
  cout &lt;&lt; g;
  </pre>
--- 7277,7292 ----
  
  <hr>
  <h3><a name="437"></a>437. Formatted output of function pointers is confusing</h3>
! <p><b>Section:</b> 27.7.3.6.2 [ostream.inserters.arithmetic] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ivan Godard <b>Opened:</b> 2003-10-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream.inserters.arithmetic">issues</a> in [ostream.inserters.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Given:
  </p>
! <pre>
! void f(int) {}
  void(*g)(int) = f;
  cout &lt;&lt; g;
  </pre>
*************** conversions from C and the function poin
*** 8521,8530 ****
  
  <hr>
  <h3><a name="439"></a>439. Should facets be copyable?</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The following facets classes have no copy constructors described in
    the standard, which, according to the standard, means that they are
--- 7324,7333 ----
  
  <hr>
  <h3><a name="439"></a>439. Should facets be copyable?</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The following facets classes have no copy constructors described in
    the standard, which, according to the standard, means that they are
*************** conversions from C and the function poin
*** 8532,8544 ****
    behavior is probably inappropriate.  We should either make these
    classes uncopyable or else specify exactly what their constructors do.</p>
  
! <p>Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#421">421</a>.</p>
  
! <pre>        ctype_base
          ctype
          ctype_byname
!         ctype&lt;char&gt;
!         ctype_byname&lt;char&gt;
          codecvt_base
          codecvt
          codecvt_byname
--- 7335,7348 ----
    behavior is probably inappropriate.  We should either make these
    classes uncopyable or else specify exactly what their constructors do.</p>
  
! <p>Related issue: <a href="lwg-closed.html#421">421</a>.</p>
  
! <pre>
!         ctype_base
          ctype
          ctype_byname
!         ctype&lt;char>
!         ctype_byname&lt;char>
          codecvt_base
          codecvt
          codecvt_byname
*************** conversions from C and the function poin
*** 8577,8585 ****
  
  <hr>
  <h3><a name="440"></a>440. Should std::complex use unqualified transcendentals?</h3>
! <p><b>Section:</b> 26.4.8 [complex.transcendentals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-11-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Operations like <tt>pow</tt> and <tt>exp</tt> on
--- 7381,7389 ----
  
  <hr>
  <h3><a name="440"></a>440. Should std::complex use unqualified transcendentals?</h3>
! <p><b>Section:</b> 26.4.8 [complex.transcendentals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-11-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Operations like <tt>pow</tt> and <tt>exp</tt> on
*************** unqualified <tt>sin</tt>?
*** 8592,8598 ****
  <p>The issue, of course, is whether we want to use
  argument-dependent lookup in the case where <tt>T</tt> is a
  user-defined type.  This is similar to the issue of valarray
! transcendentals, as discussed in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a>.</p>
  
  <p>This issue differs from valarray transcendentals in two important
  ways.  First, "the effect of instantiating the template
--- 7396,7402 ----
  <p>The issue, of course, is whether we want to use
  argument-dependent lookup in the case where <tt>T</tt> is a
  user-defined type.  This is similar to the issue of valarray
! transcendentals, as discussed in issue <a href="lwg-defects.html#226">226</a>.</p>
  
  <p>This issue differs from valarray transcendentals in two important
  ways.  First, "the effect of instantiating the template
*************** are off.</p>
*** 8617,8632 ****
  
  <hr>
  <h3><a name="446"></a>446. Iterator equality between different containers</h3>
! <p><b>Section:</b> 24.2 [iterator.requirements], 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Andy Koenig <b>Opened:</b> 2003-12-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  What requirements does the standard place on equality comparisons between
  iterators that refer to elements of different containers.  For example, if
! v1 and v2 are empty vectors, is v1.end() == v2.end() allowed to yield true?
! Is it allowed to throw an exception?
  </p>
  
  <p>
--- 7421,7436 ----
  
  <hr>
  <h3><a name="446"></a>446. Iterator equality between different containers</h3>
! <p><b>Section:</b> 24.2 [iterator.requirements], 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Andy Koenig <b>Opened:</b> 2003-12-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  What requirements does the standard place on equality comparisons between
  iterators that refer to elements of different containers.  For example, if
! <tt>v1</tt> and <tt>v2</tt> are empty vectors, is <tt>v1.end() == v2.end()</tt> 
! allowed to yield true? Is it allowed to throw an exception?
  </p>
  
  <p>
*************** reachability.
*** 8648,8656 ****
  ]</i></p>
  
  
! <blockquote>
  Daniel volunteered to work on this.
! </blockquote>
  
  <p><i>[
  2009-09-20 Daniel provided wording.
--- 7452,7460 ----
  ]</i></p>
  
  
! <blockquote><p>
  Daniel volunteered to work on this.
! </p></blockquote>
  
  <p><i>[
  2009-09-20 Daniel provided wording.
*************** Daniel volunteered to work on this.
*** 8662,8670 ****
  ]</i></p>
  
  
! <blockquote>
  Leave as Open. Alisdair has volunteered to refine the wording.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
--- 7466,7474 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave as Open. Alisdair has volunteered to refine the wording.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
*************** described otherwise.</ins>
*** 8708,8726 ****
  
  <hr>
  <h3><a name="447"></a>447. Wrong template argument for time facets</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2003-12-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#327">327</a></p>
  <p><b>Discussion:</b></p>
  <p>
  22.1.1.1.1/4, table 52, "Required Instantiations", lists, among others:
  </p>
! <pre>    time_get&lt;char,InputIterator&gt;
!     time_get_byname&lt;char,InputIterator&gt;
!     time_get&lt;wchar_t,OutputIterator&gt;
!     time_get_byname&lt;wchar_t,OutputIterator&gt;
  </pre>
  
  <p>
--- 7512,7531 ----
  
  <hr>
  <h3><a name="447"></a>447. Wrong template argument for time facets</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2003-12-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#327">327</a></p>
  <p><b>Discussion:</b></p>
  <p>
  22.1.1.1.1/4, table 52, "Required Instantiations", lists, among others:
  </p>
! <pre>
!     time_get&lt;char,InputIterator>
!     time_get_byname&lt;char,InputIterator>
!     time_get&lt;wchar_t,OutputIterator>
!     time_get_byname&lt;wchar_t,OutputIterator>
  </pre>
  
  <p>
*************** Change the second template argument to I
*** 8744,8758 ****
  
  <hr>
  <h3><a name="450"></a>450. set::find is inconsistent with associative container requirements</h3>
! <p><b>Section:</b> 23.6.3 [set] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#set">issues</a> in [set].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#214">214</a></p>
  <p><b>Discussion:</b></p>
  <p>map/multimap have:</p>
  
! <pre>    iterator find(const key_type&amp; x) const;
      const_iterator find(const key_type&amp; x) const;
  </pre>
  
--- 7549,7564 ----
  
  <hr>
  <h3><a name="450"></a>450. set::find is inconsistent with associative container requirements</h3>
! <p><b>Section:</b> 23.4.6 [set] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#set">issues</a> in [set].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#214">214</a></p>
  <p><b>Discussion:</b></p>
  <p>map/multimap have:</p>
  
! <pre>
!     iterator find(const key_type&amp; x) const;
      const_iterator find(const key_type&amp; x) const;
  </pre>
  
*************** Change the second template argument to I
*** 8760,8766 ****
  which is consistent with the table of associative container requirements.
  But set/multiset have:
  </p>
! <pre>    iterator find(const key_type&amp;) const;
  </pre>
  
  <p>
--- 7566,7573 ----
  which is consistent with the table of associative container requirements.
  But set/multiset have:
  </p>
! <pre>
!     iterator find(const key_type&amp;) const;
  </pre>
  
  <p>
*************** table, in this regard.
*** 8781,8801 ****
  
  <hr>
  <h3><a name="451"></a>451. Associative erase should return an iterator</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.6 [associative] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#130">130</a></p>
  <p><b>Discussion:</b></p>
  <p>map/multimap/set/multiset have:</p>
! <pre>    void erase(iterator);
      void erase(iterator, iterator);
  </pre>
  
  <p>But there's no good reason why these can't return an iterator, as for
  vector/deque/list:</p>
! <pre>    iterator erase(iterator);
      iterator erase(iterator, iterator);
  </pre>
  
--- 7588,7610 ----
  
  <hr>
  <h3><a name="451"></a>451. Associative erase should return an iterator</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.4 [associative] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#130">130</a></p>
  <p><b>Discussion:</b></p>
  <p>map/multimap/set/multiset have:</p>
! <pre>
!     void erase(iterator);
      void erase(iterator, iterator);
  </pre>
  
  <p>But there's no good reason why these can't return an iterator, as for
  vector/deque/list:</p>
! <pre>
!     iterator erase(iterator);
      iterator erase(iterator, iterator);
  </pre>
  
*************** first element beyond the erased subrange
*** 8818,8829 ****
  
  <hr>
  <h3><a name="452"></a>452.  locale::combine should be permitted to generate a named locale</h3>
! <p><b>Section:</b> 22.3.1.3 [locale.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.members">issues</a> in [locale.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <pre>template&lt;class Facet&gt;
      locale::combine(const locale&amp;) const;
  </pre>
  <p>
--- 7627,7639 ----
  
  <hr>
  <h3><a name="452"></a>452.  locale::combine should be permitted to generate a named locale</h3>
! <p><b>Section:</b> 22.3.1.3 [locale.members] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.members">issues</a> in [locale.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <pre>
! template&lt;class Facet>
      locale::combine(const locale&amp;) const;
  </pre>
  <p>
*************** standard facets.
*** 8858,8876 ****
  
  
  <hr>
! <h3><a name="454"></a>454. basic_filebuf::open should accept wchar_t names</h3>
! <p><b>Section:</b> 27.9.1.4 [filebuf.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#filebuf.members">issues</a> in [filebuf.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#105">105</a></p>
  <p><b>Discussion:</b></p>
! <pre>    basic_filebuf *basic_filebuf::open(const char *, ios_base::open_mode);
  </pre>
  
  <p>should be supplemented with the overload:</p>
  
! <pre>    basic_filebuf *basic_filebuf::open(const wchar_t *, ios_base::open_mode);
  </pre>
  
  <p>
--- 7668,7688 ----
  
  
  <hr>
! <h3><a name="454"></a>454. <tt>basic_filebuf::open</tt> should accept <tt>wchar_t</tt> names</h3>
! <p><b>Section:</b> 27.9.1.4 [filebuf.members] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#filebuf.members">issues</a> in [filebuf.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#105">105</a></p>
  <p><b>Discussion:</b></p>
! <pre>
!     basic_filebuf *basic_filebuf::open(const char *, ios_base::open_mode);
  </pre>
  
  <p>should be supplemented with the overload:</p>
  
! <pre>
!     basic_filebuf *basic_filebuf::open(const wchar_t *, ios_base::open_mode);
  </pre>
  
  <p>
*************** the other requires an implementation-def
*** 8879,8885 ****
  actual filename.
  </p>
  
! <p><i>[Sydney: Yes, we want to allow wchar_t filenames.  Bill will
    provide wording.]</i></p>
  
  
--- 7691,7697 ----
  actual filename.
  </p>
  
! <p><i>[Sydney: Yes, we want to allow <tt>wchar_t</tt> filenames.  Bill will
    provide wording.]</i></p>
  
  
*************** Martin adds pre-Sophia Antipolis:
*** 8913,8921 ****
  ]</i></p>
  
  
! <blockquote>
  Please see <a href="http://wiki.dinkumware.com/twiki/pub/Wg21sophiaAntipolis/LibraryWorkingGroup/issue-454.html">issue 454: problems and solutions</a>.
! </blockquote>
  
  <p><i>[
  Sophia Antipolis:
--- 7725,7733 ----
  ]</i></p>
  
  
! <blockquote><p>
  Please see <a href="http://wiki.dinkumware.com/twiki/pub/Wg21sophiaAntipolis/LibraryWorkingGroup/issue-454.html">issue 454: problems and solutions</a>.
! </p></blockquote>
  
  <p><i>[
  Sophia Antipolis:
*************** problems and solutions.
*** 8946,8952 ****
  
  <p>Change from:</p>
  <blockquote>
! <pre>basic_filebuf&lt;charT,traits&gt;* open(
      const char* s,
      ios_base::openmode mode );
  </pre>
--- 7758,7765 ----
  
  <p>Change from:</p>
  <blockquote>
! <pre>
! basic_filebuf&lt;charT,traits>* open(
      const char* s,
      ios_base::openmode mode );
  </pre>
*************** by calling std::fopen(s,modstr)).</p>
*** 8961,8982 ****
  <p>to:</p>
  
  <blockquote>
! <pre>basic_filebuf&lt;charT,traits&gt;* open(
      const char* s,
      ios_base::openmode mode );
  
! basic_filebuf&lt;charT,traits&gt;* open(
      const wchar_t* ws,
      ios_base::openmode mode );
  </pre>
  
  <p>
! Effects: If is_open() != false, returns a null pointer.
! Otherwise, initializes the filebuf as required. It then
! opens a file, if possible, whose name is the NTBS s ("as if"
! by calling std::fopen(s,modstr)).
! For the second signature, the NTBS s is determined from the
! WCBS ws in an implementation-defined manner.
  </p>
  
  <p>
--- 7774,7796 ----
  <p>to:</p>
  
  <blockquote>
! <pre>
! basic_filebuf&lt;charT,traits>* open(
      const char* s,
      ios_base::openmode mode );
  
! basic_filebuf&lt;charT,traits>* open(
      const wchar_t* ws,
      ios_base::openmode mode );
  </pre>
  
  <p>
! <i>Effects</i>: If <tt>is_open() != false</tt>, returns a null pointer.
! Otherwise, initializes the <tt>filebuf</tt> as required. It then
! opens a file, if possible, whose name is the NTBS <tt>s</tt> ("as if"
! by calling <tt>std::fopen(s,modstr)</tt>).
! For the second signature, the NTBS <tt>s</tt> is determined from the
! WCBS <tt>ws</tt> in an implementation-defined manner.
  </p>
  
  <p>
*************** San Francisco:
*** 9037,9047 ****
  ]</i></p>
  
  
! <blockquote>
  Some existing implementations provide overload already. Expected
  filesystem "path" object overloads neatly, without surprises; implying
  NAD.
! </blockquote>
  
  
  
--- 7851,7861 ----
  ]</i></p>
  
  
! <blockquote><p>
  Some existing implementations provide overload already. Expected
  filesystem "path" object overloads neatly, without surprises; implying
  NAD.
! </p></blockquote>
  
  
  
*************** NAD.
*** 9050,9065 ****
  
  
  <hr>
! <h3><a name="458"></a>458. 24.1.5 contains unintended limitation for operator-</h3>
! <p><b>Section:</b> 24.2.7 [random.access.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Frey <b>Opened:</b> 2004-02-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#random.access.iterators">issues</a> in [random.access.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 24.1.5 [lib.random.access.iterators], table 76 the operational
! semantics for the expression "r -= n" are defined as "return r += -n".
! This means, that the expression -n must be valid, which is not the case
  for unsigned types.
  </p>
  
--- 7864,7879 ----
  
  
  <hr>
! <h3><a name="458"></a>458. 24.1.5 contains unintended limitation for <tt>operator-</tt></h3>
! <p><b>Section:</b> 24.2.7 [random.access.iterators] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Frey <b>Opened:</b> 2004-02-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#random.access.iterators">issues</a> in [random.access.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 24.1.5 [lib.random.access.iterators], table 76 the operational
! semantics for the expression "<tt>r -= n</tt>" are defined as "<tt>return r += -n</tt>".
! This means, that the expression <tt>-n</tt> must be valid, which is not the case
  for unsigned types.
  </p>
  
*************** Need to look at again without concepts.
*** 9110,9118 ****
  </p>
  <p>
  There was a question about this phrase in the discussion: "the
! expression -n must be valid, which is not the case for unsigned types."
! If n is an object ofthe iterator difference_type (eg ptrdiff_t), then it
! is never unsigned.
  </p>
  </blockquote>
  
--- 7924,7932 ----
  </p>
  <p>
  There was a question about this phrase in the discussion: "the
! expression <tt>-n</tt> must be valid, which is not the case for unsigned types."
! If <tt>n</tt> is an object of the iterator <tt>difference_type</tt> (eg <tt>ptrdiff_t</tt>), 
! then it is never unsigned.
  </p>
  </blockquote>
  
*************** is never unsigned.
*** 9121,9131 ****
  ]</i></p>
  
  
! <blockquote>
! The group reviewed the wording in the draft and agreed that n is of
  difference type, the difference type is signed, and the current wording
  is correct.  Moved to NAD.
! </blockquote>
  
  
  
--- 7935,7945 ----
  ]</i></p>
  
  
! <blockquote><p>
! The group reviewed the wording in the draft and agreed that <tt>n</tt> is of
  difference type, the difference type is signed, and the current wording
  is correct.  Moved to NAD.
! </p></blockquote>
  
  
  
*************** is correct.  Moved to NAD.
*** 9134,9141 ****
  To remove this limitation, I suggest to change the
  operational semantics for this column to:
  </p>
! <blockquote><pre>    { Distance m = n;
!       if (m &gt;= 0)
          while (m--) --r;
        else
          while (m++) ++r;
--- 7948,7956 ----
  To remove this limitation, I suggest to change the
  operational semantics for this column to:
  </p>
! <blockquote><pre>
!     { Distance m = n;
!       if (m >= 0)
          while (m--) --r;
        else
          while (m++) ++r;
*************** operational semantics for this column to
*** 9149,9158 ****
  
  <hr>
  <h3><a name="459"></a>459. Requirement for widening in stage 2 is overspecification</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-03-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>When parsing strings of wide-character digits, the standard
    requires the library to widen narrow-character "atoms" and compare
--- 7964,7974 ----
  
  <hr>
  <h3><a name="459"></a>459. Requirement for widening in stage 2 is overspecification</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-03-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>When parsing strings of wide-character digits, the standard
    requires the library to widen narrow-character "atoms" and compare
*************** widen() allows, i.e. without making a vi
*** 9171,9182 ****
  time, is as follows:
  </p>
  
! <pre>  inline char ctype&lt;wchar_t&gt;::narrow (wchar_t wc, char dflt) const
    {
        const unsigned wi = unsigned (wc);
  
!       if (wi &gt; UCHAR_MAX)
!           return typeid (*this) == typeid (ctype&lt;wchar_t&gt;) ?
                   dflt : do_narrow (wc, dflt);
  
        if (narrow_ [wi] &lt; 0) {
--- 7987,7999 ----
  time, is as follows:
  </p>
  
! <pre>
!   inline char ctype&lt;wchar_t>::narrow (wchar_t wc, char dflt) const
    {
        const unsigned wi = unsigned (wc);
  
!       if (wi > UCHAR_MAX)
!           return typeid (*this) == typeid (ctype&lt;wchar_t>) ?
                   dflt : do_narrow (wc, dflt);
  
        if (narrow_ [wi] &lt; 0) {
*************** drastic. Existing implementations with t
*** 9197,9210 ****
  currently already use narrow() so the impact of the change on programs
  would presumably be isolated to just a single implementation. Further,
  since narrow() is not required to translate alternate wide digit
! representations such as those mentioned in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#303">303</a> to
  their narrow equivalents (i.e., the portable source characters '0'
  through '9'), the change does not necessarily imply that these
  alternate digits would be treated as ordinary digits and accepted as
  part of numbers during parsing. In fact, the requirement in 22.4.1.1.2 [locale.ctype.virtuals], p13 forbids narrow() to translate an alternate
  digit character, wc, to an ordinary digit in the basic source
  character set unless the expression
! (ctype&lt;charT&gt;::is(ctype_base::digit, wc) == true) holds. This in
  turn is prohibited by the C standard (7.25.2.1.5, 7.25.2.1.5, and
  5.2.1, respectively) for charT of either char or wchar_t.
  </p>
--- 8014,8027 ----
  currently already use narrow() so the impact of the change on programs
  would presumably be isolated to just a single implementation. Further,
  since narrow() is not required to translate alternate wide digit
! representations such as those mentioned in issue <a href="lwg-defects.html#303">303</a> to
  their narrow equivalents (i.e., the portable source characters '0'
  through '9'), the change does not necessarily imply that these
  alternate digits would be treated as ordinary digits and accepted as
  part of numbers during parsing. In fact, the requirement in 22.4.1.1.2 [locale.ctype.virtuals], p13 forbids narrow() to translate an alternate
  digit character, wc, to an ordinary digit in the basic source
  character set unless the expression
! (ctype&lt;charT>::is(ctype_base::digit, wc) == true) holds. This in
  turn is prohibited by the C standard (7.25.2.1.5, 7.25.2.1.5, and
  5.2.1, respectively) for charT of either char or wchar_t.
  </p>
*************** codecvt instead.]</i></p>
*** 9222,9230 ****
  ]</i></p>
  
  
! <blockquote>
  NAD. The standard is clear enough as written.
! </blockquote>
  
  
  
--- 8039,8047 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD. The standard is clear enough as written.
! </p></blockquote>
  
  
  
*************** NAD. The standard is clear enough as wri
*** 9233,9239 ****
  technique to perform the comparison:</p>
  <ol>
    <li> call widen on the atoms and compare (either by using
!       operator== or char_traits&lt;charT&gt;::eq) the input with
        the widened atoms, or</li>
    <li> call narrow on the input and compare the narrow input
        with the atoms</li>
--- 8050,8056 ----
  technique to perform the comparison:</p>
  <ol>
    <li> call widen on the atoms and compare (either by using
!       operator== or char_traits&lt;charT>::eq) the input with
        the widened atoms, or</li>
    <li> call narrow on the input and compare the narrow input
        with the atoms</li>
*************** technique to perform the comparison:</p>
*** 9248,9256 ****
  
  <hr>
  <h3><a name="462"></a>462. Destroying objects with static storage duration</h3>
! <p><b>Section:</b> 3.6.3 [basic.start.term], 18.4 [cstdint] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-03-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  3.6.3 Termination spells out in detail the interleaving of static
--- 8065,8073 ----
  
  <hr>
  <h3><a name="462"></a>462. Destroying objects with static storage duration</h3>
! <p><b>Section:</b> 3.6.3 [basic.start.term], 18.4 [cstdint] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-03-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  3.6.3 Termination spells out in detail the interleaving of static
*************** destruction but not require it.
*** 9290,9296 ****
  
  <p><i>[
  Howard:  The course of action recommended in Batavia would undo LWG
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#3">3</a> and break current code implementing the "phoenix
  singleton". Search the net for "phoenix singleton atexit" to get a feel
  for the size of the adverse impact this change would have.  Below is
  sample code which implements the phoenix singleton and would break if
--- 8107,8113 ----
  
  <p><i>[
  Howard:  The course of action recommended in Batavia would undo LWG
! issue <a href="lwg-defects.html#3">3</a> and break current code implementing the "phoenix
  singleton". Search the net for "phoenix singleton atexit" to get a feel
  for the size of the adverse impact this change would have.  Below is
  sample code which implements the phoenix singleton and would break if
*************** sample code which implements the phoenix
*** 9298,9304 ****
  ]</i></p>
  
  
! <blockquote><pre>#include &lt;cstdlib&gt;
  #include &lt;iostream&gt;
  #include &lt;type_traits&gt;
  #include &lt;new&gt;
--- 8115,8122 ----
  ]</i></p>
  
  
! <blockquote><pre>
! #include &lt;cstdlib&gt;
  #include &lt;iostream&gt;
  #include &lt;type_traits&gt;
  #include &lt;new&gt;
*************** int main()
*** 9372,9378 ****
  The correct output is:
  </p>
  
! <blockquote><pre>A()
  Using A from main()
  A is alive
  ~A()
--- 8190,8197 ----
  The correct output is:
  </p>
  
! <blockquote><pre>
! A()
  Using A from main()
  A is alive
  ~A()
*************** Bill agrees issue is no longer serious,
*** 9401,9416 ****
  
  
  <hr>
! <h3><a name="463"></a>463. auto_ptr usability issues</h3>
! <p><b>Section:</b> D.12.1 [auto.ptr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Rani Sharoni <b>Opened:</b> 2003-12-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! TC1 CWG DR #84 effectively made the template&lt;class Y&gt; operator auto_ptr&lt;Y&gt;()
! member of auto_ptr (20.4.5.3/4) obsolete.
  </p>
  
  <p>
--- 8220,8235 ----
  
  
  <hr>
! <h3><a name="463"></a>463. <tt>auto_ptr</tt> usability issues</h3>
! <p><b>Section:</b> X [auto.ptr] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Rani Sharoni <b>Opened:</b> 2003-12-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! TC1 CWG DR #84 effectively made the <tt>template&lt;class Y&gt; operator auto_ptr&lt;Y&gt;()</tt>
! member of <tt>auto_ptr</tt> (20.4.5.3/4) obsolete.
  </p>
  
  <p>
*************** The sole purpose of this obsolete conver
*** 9418,9424 ****
  initialization base from r-value derived (or any convertible types like
  cv-types) case:
  </p>
! <pre>#include &lt;memory&gt;
  using std::auto_ptr;
  
  struct B {};
--- 8237,8244 ----
  initialization base from r-value derived (or any convertible types like
  cv-types) case:
  </p>
! <pre>
! #include &lt;memory&gt;
  using std::auto_ptr;
  
  struct B {};
*************** int x1 = sink( source() ); // #1 EDG - n
*** 9431,9441 ****
  
  <p>
  The excellent analysis of conversion operations that was given in the final
! auto_ptr proposal
! (http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/1997/N1128.pdf)
  explicitly specifies this case analysis (case 4). DR #84 makes the analysis
  wrong and actually comes to forbid the loophole that was exploited by the
! auto_ptr designers.
  </p>
  
  <p>
--- 8251,8261 ----
  
  <p>
  The excellent analysis of conversion operations that was given in the final
! <tt>auto_ptr</tt> proposal
! (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1997/N1128.pdf)
  explicitly specifies this case analysis (case 4). DR #84 makes the analysis
  wrong and actually comes to forbid the loophole that was exploited by the
! <tt>auto_ptr</tt> designers.
  </p>
  
  <p>
*************** conversions and in fact current compiler
*** 9448,9460 ****
  I was surprised to discover that the obsolete conversion member actually has
  negative impact of the copy initialization base from l-value derived
  case:</p>
! <pre>auto_ptr&lt;D&gt; dp;
  int x2 = sink(dp); // #2 EDG - more than one user-defined conversion applies
  </pre>
  
  <p>
  I'm sure that the original intention was allowing this initialization using
! the template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y&gt;&amp; a) constructor (20.4.5.1/4) but
  since in this copy initialization it's merely user defined conversion (UDC)
  and the obsolete conversion member is UDC with the same rank (for the early
  overloading stage) there is an ambiguity between them.
--- 8268,8281 ----
  I was surprised to discover that the obsolete conversion member actually has
  negative impact of the copy initialization base from l-value derived
  case:</p>
! <pre>
! auto_ptr&lt;D&gt; dp;
  int x2 = sink(dp); // #2 EDG - more than one user-defined conversion applies
  </pre>
  
  <p>
  I'm sure that the original intention was allowing this initialization using
! the <tt>template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y&gt;&amp; a)</tt> constructor (20.4.5.1/4) but
  since in this copy initialization it's merely user defined conversion (UDC)
  and the obsolete conversion member is UDC with the same rank (for the early
  overloading stage) there is an ambiguity between them.
*************** overloading stage) there is an ambiguity
*** 9464,9498 ****
  Removing the obsolete member will have impact on code that explicitly
  invokes it:
  </p>
! <pre>int y = sink(source().operator auto_ptr&lt;B&gt;());
  </pre>
  
  <p>
  IMHO no one ever wrote such awkward code and the reasonable workaround for
  #1 is:
  </p>
! <pre>int y = sink( auto_ptr&lt;B&gt;(source()) );
  </pre>
  
  <p>
  I was even more surprised to find out that after removing the obsolete
  conversion member the initialization was still ill-formed:
! int x3 = sink(dp); // #3 EDG - no suitable copy constructor
  </p>
  
  <p>
  This copy initialization semantically requires copy constructor which means
! that both template conversion constructor and the auto_ptr_ref conversion
  member (20.4.5.3/3) are required which is what was explicitly forbidden in
  DR #84. This is a bit amusing case in which removing ambiguity results with
  no candidates.
  </p>
  
  <p>
! I also found exception safety issue with auto_ptr related to auto_ptr_ref:
  </p>
! <pre>int f(auto_ptr&lt;B&gt;, std::string);
! auto_ptr&lt;B&gt; source2();
  
  // string constructor throws while auto_ptr_ref
  // "holds" the pointer
--- 8285,8322 ----
  Removing the obsolete member will have impact on code that explicitly
  invokes it:
  </p>
! <pre>
! int y = sink(source().operator auto_ptr&lt;B>());
  </pre>
  
  <p>
  IMHO no one ever wrote such awkward code and the reasonable workaround for
  #1 is:
  </p>
! <pre>
! int y = sink( auto_ptr&lt;B>(source()) );
  </pre>
  
  <p>
  I was even more surprised to find out that after removing the obsolete
  conversion member the initialization was still ill-formed:
! <tt>int x3 = sink(dp); // #3 EDG - no suitable copy constructor</tt>
  </p>
  
  <p>
  This copy initialization semantically requires copy constructor which means
! that both template conversion constructor and the <tt>auto_ptr_ref</tt> conversion
  member (20.4.5.3/3) are required which is what was explicitly forbidden in
  DR #84. This is a bit amusing case in which removing ambiguity results with
  no candidates.
  </p>
  
  <p>
! I also found exception safety issue with <tt>auto_ptr</tt> related to <tt>auto_ptr_ref</tt>:
  </p>
! <pre>
! int f(auto_ptr&lt;B>, std::string);
! auto_ptr&lt;B> source2();
  
  // string constructor throws while auto_ptr_ref
  // "holds" the pointer
*************** int x4 = f(source2(), "xyz"); // #4
*** 9503,9554 ****
  The theoretic execution sequence that will cause a leak:
  </p>
  <ol>
! <li>call auto_ptr&lt;B&gt;::operator auto_ptr_ref&lt;B&gt;()</li>
  <li>call string::string(char const*) and throw</li>
  </ol>
  
  <p>
! According to 20.4.5.3/3 and 20.4.5/2 the auto_ptr_ref conversion member
! returns auto_ptr_ref&lt;Y&gt; that holds *this and this is another defect since
! the type of *this is auto_ptr&lt;X&gt; where X might be different from Y. Several
! library vendors (e.g. SGI) implement auto_ptr_ref&lt;Y&gt; with Y* as member which
! is much more reasonable. Other vendor implemented auto_ptr_ref as
  defectively required and it results with awkward and catastrophic code:
! int oops = sink(auto_ptr&lt;B&gt;(source())); // warning recursive on all control
! paths
  </p>
  
  <p>
  Dave Abrahams noticed that there is no specification saying that
! auto_ptr_ref copy constructor can't throw.
  </p>
  
  <p>
  My proposal comes to solve all the above issues and significantly simplify
! auto_ptr implementation. One of the fundamental requirements from auto_ptr
! is that it can be constructed in an intuitive manner (i.e. like ordinary
! pointers) but with strict ownership semantics which yield that source
! auto_ptr in initialization must be non-const. My idea is to add additional
  constructor template with sole propose to generate ill-formed, diagnostic
  required, instance for const auto_ptr arguments during instantiation of
  declaration. This special constructor will not be instantiated for other
  types which is achievable using 14.8.2/2 (SFINAE). Having this constructor
! in hand makes the constructor template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y&gt; const&amp;)
  legitimate since the actual argument can't be const yet non const r-value
  are acceptable.
  </p>
  
  <p>
  This implementation technique makes the "private auxiliary class"
! auto_ptr_ref obsolete and I found out that modern C++ compilers (e.g. EDG,
  GCC and VC) consume the new implementation as expected and allow all
  intuitive initialization and assignment cases while rejecting illegal cases
! that involve const auto_ptr arguments.
  </p>
  
  <p>The proposed auto_ptr interface:</p>
  
! <pre>namespace std {
      template&lt;class X&gt; class auto_ptr {
      public:
          typedef X element_type;
--- 8327,8379 ----
  The theoretic execution sequence that will cause a leak:
  </p>
  <ol>
! <li>call auto_ptr&lt;B>::operator auto_ptr_ref&lt;B>()</li>
  <li>call string::string(char const*) and throw</li>
  </ol>
  
  <p>
! According to 20.4.5.3/3 and 20.4.5/2 the <tt>auto_ptr_ref</tt> conversion member
! returns <tt>auto_ptr_ref&lt;Y&gt;</tt> that holds <tt>*this</tt> and this is another defect since
! the type of <tt>*this</tt> is <tt>auto_ptr&lt;X&gt;</tt> where <tt>X</tt> might 
! be different from <tt>Y</tt>. Several library vendors (e.g. SGI) implement 
! <tt>auto_ptr_ref&lt;Y&gt;</tt> with <tt>Y*</tt> as member which
! is much more reasonable. Other vendor implemented <tt>auto_ptr_ref</tt> as
  defectively required and it results with awkward and catastrophic code:
! <tt>int oops = sink(auto_ptr&lt;B>(source())); // warning recursive on all control paths</tt>
  </p>
  
  <p>
  Dave Abrahams noticed that there is no specification saying that
! <tt>auto_ptr_ref</tt> copy constructor can't throw.
  </p>
  
  <p>
  My proposal comes to solve all the above issues and significantly simplify
! <tt>auto_ptr</tt> implementation. One of the fundamental requirements from 
! <tt>auto_ptr</tt> is that it can be constructed in an intuitive manner (i.e. 
! like ordinary pointers) but with strict ownership semantics which yield that source
! <tt>auto_ptr</tt> in initialization must be non-const. My idea is to add additional
  constructor template with sole propose to generate ill-formed, diagnostic
  required, instance for const auto_ptr arguments during instantiation of
  declaration. This special constructor will not be instantiated for other
  types which is achievable using 14.8.2/2 (SFINAE). Having this constructor
! in hand makes the constructor <tt>template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y> const&amp;)</tt>
  legitimate since the actual argument can't be const yet non const r-value
  are acceptable.
  </p>
  
  <p>
  This implementation technique makes the "private auxiliary class"
! <tt>auto_ptr_ref</tt> obsolete and I found out that modern C++ compilers (e.g. EDG,
  GCC and VC) consume the new implementation as expected and allow all
  intuitive initialization and assignment cases while rejecting illegal cases
! that involve const <tt>auto_ptr</tt> arguments.
  </p>
  
  <p>The proposed auto_ptr interface:</p>
  
! <pre>
! namespace std {
      template&lt;class X&gt; class auto_ptr {
      public:
          typedef X element_type;
*************** that involve const auto_ptr arguments.
*** 9563,9569 ****
  
          // 20.4.5.2 members:
          X&amp; operator*() const throw();
!         X* operator-&gt;() const throw();
          X* get() const throw();
          X* release() throw();
          void reset(X* p=0) throw();
--- 8388,8394 ----
  
          // 20.4.5.2 members:
          X&amp; operator*() const throw();
!         X* operator->() const throw();
          X* get() const throw();
          X* release() throw();
          void reset(X* p=0) throw();
*************** unspecified_error_on_const_auto_ptr&lt;U
*** 9577,9587 ****
  </pre>
  
  <p>
! One compliant technique to implement the unspecified_error_on_const_auto_ptr
! helper class is using additional private auto_ptr member class template like
  the following:
  </p>
! <pre>template&lt;typename T&gt; struct unspecified_error_on_const_auto_ptr;
  
  template&lt;typename T&gt;
  struct unspecified_error_on_const_auto_ptr&lt;auto_ptr&lt;T&gt; const&gt;
--- 8402,8413 ----
  </pre>
  
  <p>
! One compliant technique to implement the <tt>unspecified_error_on_const_auto_ptr</tt>
! helper class is using additional private <tt>auto_ptr</tt> member class template like
  the following:
  </p>
! <pre>
! template&lt;typename T&gt; struct unspecified_error_on_const_auto_ptr;
  
  template&lt;typename T&gt;
  struct unspecified_error_on_const_auto_ptr&lt;auto_ptr&lt;T&gt; const&gt;
*************** verifying this with core language expert
*** 9601,9658 ****
  <p>Remove section 20.4.5.3</p>
  
  <p>Change 20.4.5/2 to read something like:
! Initializing auto_ptr&lt;X&gt; from const auto_ptr&lt;Y&gt; will result with unspecified
  ill-formed declaration that will require unspecified diagnostic.</p>
  
  <p>Change 20.4.5.1/4,5,6 to read:</p>
  
  <pre>template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y&gt; const&amp; a) throw();</pre>
! <p> 4 Requires: Y* can be implicitly converted to X*.</p>
! <p> 5 Effects: Calls const_cast&lt;auto_ptr&lt;Y&gt;&amp;&gt;(a).release().</p>
! <p> 6 Postconditions: *this holds the pointer returned from a.release().</p>
  
  <p>Change 20.4.5.1/10</p>
! <pre>template&lt;class Y&gt; auto_ptr&amp; operator=(auto_ptr&lt;Y&gt; a) throw();
  </pre>
  <p>
! 10 Requires: Y* can be implicitly converted to X*. The expression delete
! get() is well formed.
  </p>
  
  <p>LWG TC DR #127 is obsolete.</p>
  
  <p>
  Notice that the copy constructor and copy assignment operator should remain
! as before and accept non-const auto_ptr&amp; since they have effect on the form
  of the implicitly declared copy constructor and copy assignment operator of
  class that contains auto_ptr as member per 12.8/5,10:
  </p>
! <pre>struct X {
      // implicit X(X&amp;)
      // implicit X&amp; operator=(X&amp;)
!     auto_ptr&lt;D&gt; aptr_;
  };
  </pre>
  
  <p>
  In most cases this indicates about sloppy programming but preserves the
! current auto_ptr behavior.
  </p>
  
  <p>
  Dave Abrahams encouraged me to suggest fallback implementation in case that
! my suggestion that involves removing of auto_ptr_ref will not be accepted.
! In this case removing the obsolete conversion member to auto_ptr&lt;Y&gt; and
  20.4.5.3/4,5 is still required in order to eliminate ambiguity in legal
  cases. The two constructors that I suggested will co exist with the current
! members but will make auto_ptr_ref obsolete in initialization contexts.
! auto_ptr_ref will be effective in assignment contexts as suggested in DR
  #127 and I can't see any serious exception safety issues in those cases
! (although it's possible to synthesize such). auto_ptr_ref&lt;X&gt; semantics will
! have to be revised to say that it strictly holds pointer of type X and not
! reference to an auto_ptr for the favor of cases in which auto_ptr_ref&lt;Y&gt; is
! constructed from auto_ptr&lt;X&gt; in which X is different from Y (i.e. assignment
! from r-value derived to base).
  </p>
  
  <p><i>[Redmond: punt for the moment. We haven't decided yet whether we
--- 8427,8486 ----
  <p>Remove section 20.4.5.3</p>
  
  <p>Change 20.4.5/2 to read something like:
! Initializing <tt>auto_ptr&lt;X&gt;</tt> from <tt>const auto_ptr&lt;Y&gt;</tt> will result with unspecified
  ill-formed declaration that will require unspecified diagnostic.</p>
  
  <p>Change 20.4.5.1/4,5,6 to read:</p>
  
  <pre>template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y&gt; const&amp; a) throw();</pre>
! <p> 4 <i>Requires</i>: <tt>Y*</tt> can be implicitly converted to <tt>X*</tt>.</p>
! <p> 5 <i>Effects</i>: Calls <tt>const_cast&lt;auto_ptr&lt;Y&gt;&amp;&gt;(a).release()</tt>.</p>
! <p> 6 <i>Postconditions</i>: <tt>*this</tt> holds the pointer returned from <tt>a.release()</tt>.</p>
  
  <p>Change 20.4.5.1/10</p>
! <pre>
! template&lt;class Y&gt; auto_ptr&amp; operator=(auto_ptr&lt;Y&gt; a) throw();
  </pre>
  <p>
! 10 <i>Requires</i>: <tt>Y*</tt> can be implicitly converted to <tt>X*</tt>. The expression <tt>delete
! get()</tt> is well formed.
  </p>
  
  <p>LWG TC DR #127 is obsolete.</p>
  
  <p>
  Notice that the copy constructor and copy assignment operator should remain
! as before and accept non-<tt>const auto_ptr&amp;</tt> since they have effect on the form
  of the implicitly declared copy constructor and copy assignment operator of
  class that contains auto_ptr as member per 12.8/5,10:
  </p>
! <pre>
! struct X {
      // implicit X(X&amp;)
      // implicit X&amp; operator=(X&amp;)
!     auto_ptr&lt;D> aptr_;
  };
  </pre>
  
  <p>
  In most cases this indicates about sloppy programming but preserves the
! current <tt>auto_ptr</tt> behavior.
  </p>
  
  <p>
  Dave Abrahams encouraged me to suggest fallback implementation in case that
! my suggestion that involves removing of <tt>auto_ptr_ref</tt> will not be accepted.
! In this case removing the obsolete conversion member to <tt>auto_ptr&lt;Y&gt;</tt> and
  20.4.5.3/4,5 is still required in order to eliminate ambiguity in legal
  cases. The two constructors that I suggested will co exist with the current
! members but will make <tt>auto_ptr_ref</tt> obsolete in initialization contexts.
! <tt>auto_ptr_ref</tt> will be effective in assignment contexts as suggested in DR
  #127 and I can't see any serious exception safety issues in those cases
! (although it's possible to synthesize such). <tt>auto_ptr_ref&lt;X&gt;</tt> semantics will
! have to be revised to say that it strictly holds pointer of type <tt>X</tt> and not
! reference to an <tt>auto_ptr</tt> for the favor of cases in which <tt>auto_ptr_ref&lt;Y&gt;</tt> is
! constructed from <tt>auto_ptr&lt;X&gt;</tt> in which <tt>X</tt> is different from 
! <tt>Y</tt> (i.e. assignment from r-value derived to base).
  </p>
  
  <p><i>[Redmond: punt for the moment. We haven't decided yet whether we
*************** tool.
*** 9677,9689 ****
  ]</i></p>
  
  
! <blockquote>
  This is a complicated issue, so we agreed to defer discussion until
  later in the week so that interested parties can read up on it.
! </blockquote>
  
  <p><i>[
! 209-10-04 Daniel adds:
  ]</i></p>
  
  
--- 8505,8517 ----
  ]</i></p>
  
  
! <blockquote><p>
  This is a complicated issue, so we agreed to defer discussion until
  later in the week so that interested parties can read up on it.
! </p></blockquote>
  
  <p><i>[
! 2009-10-04 Daniel adds:
  ]</i></p>
  
  
*************** another - but better - form of hack. Sec
*** 9696,9702 ****
  resolution or the now more natural alternative via the added member set
  </p>
  
! <blockquote><pre>template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y&gt;&amp;&amp;) throw();
  template&lt;class Y&gt; auto_ptr&amp; operator=(auto_ptr&lt;Y&gt;&amp;&amp;) throw();
  </pre></blockquote>
  
--- 8524,8531 ----
  resolution or the now more natural alternative via the added member set
  </p>
  
! <blockquote><pre>
! template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y&gt;&amp;&amp;) throw();
  template&lt;class Y&gt; auto_ptr&amp; operator=(auto_ptr&lt;Y&gt;&amp;&amp;) throw();
  </pre></blockquote>
  
*************** references <tt>auto_ptr_ref</tt>. This r
*** 9706,9712 ****
  decision which would not touch the current spec of <tt>auto_ptr</tt> at
  all (but deprecating it) and instead recommending to use
  <tt>unique_ptr</tt> for new code instead might have the best
! cost-benefit ratio. IMO the current solution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a> can
  be considered as an active user-support for this transition.
  </p>
  </blockquote>
--- 8535,8541 ----
  decision which would not touch the current spec of <tt>auto_ptr</tt> at
  all (but deprecating it) and instead recommending to use
  <tt>unique_ptr</tt> for new code instead might have the best
! cost-benefit ratio. IMO the current solution of <a href="lwg-defects.html#1100">1100</a> can
  be considered as an active user-support for this transition.
  </p>
  </blockquote>
*************** be considered as an active user-support
*** 9716,9734 ****
  ]</i></p>
  
  
! <blockquote>
! Mark as NAD. Alisdair will open a new issue (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>) with
  proposed wording to handle <tt>auto_ptr_ref</tt>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in D.12.1 [auto.ptr]:
  </p>
  
! <blockquote><pre>namespace std { 
    <del>template &lt;class Y&gt; struct auto_ptr_ref {};</del>
  
    <ins>// exposition only</ins>
--- 8545,8564 ----
  ]</i></p>
  
  
! <blockquote><p>
! Mark as NAD. Alisdair will open a new issue (<a href="lwg-defects.html#1247">1247</a>) with
  proposed wording to handle <tt>auto_ptr_ref</tt>.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in X [auto.ptr]:
  </p>
  
! <blockquote><pre>
! namespace std { 
    <del>template &lt;class Y&gt; struct auto_ptr_ref {};</del>
  
    <ins>// exposition only</ins>
*************** Change the synopsis in D.12.1 [auto.ptr]
*** 9779,9792 ****
  </pre></blockquote>
  
  <p>
! Remove D.12.1.3 [auto.ptr.conv].
  </p>
  
  <p>
! Change D.12.1 [auto.ptr], p3:
  </p>
  
! <blockquote>
  The <tt>auto_ptr</tt> provides a semantics of strict ownership. An
  <tt>auto_ptr</tt> owns the object it holds a pointer to. Copying an
  <tt>auto_ptr</tt> copies the pointer and transfers ownership to the
--- 8609,8622 ----
  </pre></blockquote>
  
  <p>
! Remove X [auto.ptr.conv].
  </p>
  
  <p>
! Change X [auto.ptr], p3:
  </p>
  
! <blockquote><p>
  The <tt>auto_ptr</tt> provides a semantics of strict ownership. An
  <tt>auto_ptr</tt> owns the object it holds a pointer to. Copying an
  <tt>auto_ptr</tt> copies the pointer and transfers ownership to the
*************** function. <tt>auto_ptr</tt> does not mee
*** 9804,9817 ****
  and <tt>Assignable</tt> requirements for Standard Library container
  elements and thus instantiating a Standard Library container with an
  <tt>auto_ptr</tt> results in undefined behavior. <i>-- end note</i>]
! </blockquote>
  
  <p>
! Change D.12.1.1 [auto.ptr.cons], p5:
  </p>
  
  <blockquote>
! <pre>template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y&gt;<ins> const</ins>&amp; a) throw();
  </pre>
  <blockquote>
  <p>
--- 8634,8648 ----
  and <tt>Assignable</tt> requirements for Standard Library container
  elements and thus instantiating a Standard Library container with an
  <tt>auto_ptr</tt> results in undefined behavior. <i>-- end note</i>]
! </p></blockquote>
  
  <p>
! Change  [auto.ptr.cons], p5:
  </p>
  
  <blockquote>
! <pre>
! template&lt;class Y&gt; auto_ptr(auto_ptr&lt;Y&gt;<ins> const</ins>&amp; a) throw();
  </pre>
  <blockquote>
  <p>
*************** Change D.12.1.1 [auto.ptr.cons], p5:
*** 9827,9837 ****
  </blockquote>
  
  <p>
! Change D.12.1.1 [auto.ptr.cons], p10:
  </p>
  
  <blockquote>
! <pre>template&lt;class Y&gt; auto_ptr&amp; operator=(auto_ptr&lt;Y&gt;<del>&amp;</del> a) throw();
  </pre>
  <blockquote>
  <p>
--- 8658,8669 ----
  </blockquote>
  
  <p>
! Change  [auto.ptr.cons], p10:
  </p>
  
  <blockquote>
! <pre>
! template&lt;class Y&gt; auto_ptr&amp; operator=(auto_ptr&lt;Y&gt;<del>&amp;</del> a) throw();
  </pre>
  <blockquote>
  <p>
*************** The expression <tt>delete get()</tt> is
*** 9853,9870 ****
  
  
  <hr>
! <h3><a name="466"></a>466. basic_string ctor should prevent null pointer error</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Frey <b>Opened:</b> 2004-06-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Today, my colleagues and me wasted a lot of time. After some time, I
  found the problem. It could be reduced to the following short example:
  </p>
  
! <pre>  #include &lt;string&gt;
    int main() { std::string( 0 ); }
  </pre>
  
--- 8685,8703 ----
  
  
  <hr>
! <h3><a name="466"></a>466. <tt>basic_string</tt> ctor should prevent null pointer error</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Frey <b>Opened:</b> 2004-06-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Today, my colleagues and me wasted a lot of time. After some time, I
  found the problem. It could be reduced to the following short example:
  </p>
  
! <pre>
!   #include &lt;string&gt;
    int main() { std::string( 0 ); }
  </pre>
  
*************** Comeau online) compile the above without
*** 9873,9880 ****
  programs (at least for the GCC) resulted in a SEGV.</p>
  
  <p>I know that the standard explicitly states that the ctor of string
! requires a char* which is not zero. STLs could easily detect the above
! case with a private ctor for basic_string which takes a single 'int'
  argument. This would catch the above code at compile time and would not
  ambiguate any other legal ctors.</p>
  
--- 8706,8713 ----
  programs (at least for the GCC) resulted in a SEGV.</p>
  
  <p>I know that the standard explicitly states that the ctor of string
! requires a <tt>char*</tt> which is not zero. STLs could easily detect the above
! case with a private ctor for <tt>basic_string</tt> which takes a single '<tt>int</tt>'
  argument. This would catch the above code at compile time and would not
  ambiguate any other legal ctors.</p>
  
*************** designed to solve exactly this kind of p
*** 9897,9909 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We are unable to achieve consensus on an approach to a resolution.
  There is some sentiment for treating this as a QOI matter.
  It is also possible
  that when <tt>string</tt> is brought into the concepts world,
  this issue might be addressed in that context.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
--- 8730,8742 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We are unable to achieve consensus on an approach to a resolution.
  There is some sentiment for treating this as a QOI matter.
  It is also possible
  that when <tt>string</tt> is brought into the concepts world,
  this issue might be addressed in that context.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
*************** The consensus was NAD.
*** 9933,9939 ****
  Add to the synopsis in 21.4 [basic.string]
  </p>
  
! <blockquote><pre><ins>basic_string( nullptr_t ) = delete;</ins>
  </pre></blockquote>
  
  
--- 8766,8773 ----
  Add to the synopsis in 21.4 [basic.string]
  </p>
  
! <blockquote><pre>
! <ins>basic_string( nullptr_t ) = delete;</ins>
  </pre></blockquote>
  
  
*************** Add to the synopsis in 21.4 [basic.strin
*** 9942,9951 ****
  
  <hr>
  <h3><a name="470"></a>470. accessing containers from their elements' special functions</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 8776,8786 ----
  
  <hr>
  <h3><a name="470"></a>470. accessing containers from their elements' special functions</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#containers">active issues</a> in [containers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** in some surprising (i.e., undefined) beh
*** 9966,9972 ****
  
  <p>Add to Container Requirements the following new paragraph:</p>
  
! <pre>    Unless otherwise specified, the behavior of a program that
      invokes a container member function f from a member function
      g of the container's value_type on a container object c that
      called g from its mutating member function h, is undefined.
--- 8801,8808 ----
  
  <p>Add to Container Requirements the following new paragraph:</p>
  
! <pre>
!     Unless otherwise specified, the behavior of a program that
      invokes a container member function f from a member function
      g of the container's value_type on a container object c that
      called g from its mutating member function h, is undefined.
*************** corner cases.
*** 9995,10005 ****
  
  <hr>
  <h3><a name="472"></a>472. Missing "Returns" clause in std::equal_range</h3>
! <p><b>Section:</b> 25.4.3.3 [equal.range] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Prateek R Karandikar <b>Opened:</b> 2004-06-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#equal.range">issues</a> in [equal.range].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#270">270</a></p>
  <p><b>Discussion:</b></p>
  <p>
  There is no "Returns:" clause for std::equal_range, which returns non-void.
--- 8831,8841 ----
  
  <hr>
  <h3><a name="472"></a>472. Missing "Returns" clause in std::equal_range</h3>
! <p><b>Section:</b> 25.4.3.3 [equal.range] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Prateek R Karandikar <b>Opened:</b> 2004-06-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#equal.range">issues</a> in [equal.range].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#270">270</a></p>
  <p><b>Discussion:</b></p>
  <p>
  There is no "Returns:" clause for std::equal_range, which returns non-void.
*************** There is no "Returns:" clause for std::e
*** 10010,10016 ****
  
  
  <p><b>Rationale:</b></p>
! <p>Fixed as part of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#270">270</a>.</p>
  
  
  
--- 8846,8852 ----
  
  
  <p><b>Rationale:</b></p>
! <p>Fixed as part of issue <a href="lwg-defects.html#270">270</a>.</p>
  
  
  
*************** There is no "Returns:" clause for std::e
*** 10019,10028 ****
  
  <hr>
  <h3><a name="476"></a>476. Forward Iterator implied mutability</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-07-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>24.1/3 says:</p>
--- 8855,8864 ----
  
  <hr>
  <h3><a name="476"></a>476. Forward Iterator implied mutability</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-07-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>24.1/3 says:</p>
*************** iterators non-conforming.  I think we ne
*** 10039,10045 ****
  relationship between forward iterator and output iterator.
  </p>
  
! <p>Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#200">200</a>.  But this is not a dup.</p>
  
  
  
--- 8875,8881 ----
  relationship between forward iterator and output iterator.
  </p>
  
! <p>Related issue: <a href="lwg-defects.html#200">200</a>.  But this is not a dup.</p>
  
  
  
*************** overhaul.)</p>
*** 10058,10080 ****
  
  
  <hr>
! <h3><a name="477"></a>477. Operator-&gt; for const forward iterators</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-07-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a></p>
  <p><b>Discussion:</b></p>
  <p>
  The Forward Iterator requirements table contains the following:
  </p>
! <pre> expression  return type         operational  precondition
                                    semantics
    ==========  ==================  ===========  ==========================
!   a-&gt;m        U&amp; if X is mutable, (*a).m       pre: (*a).m is well-defined.
                otherwise const U&amp;
  
!   r-&gt;m        U&amp;                  (*r).m       pre: (*r).m is well-defined.
  </pre>
  
  <p>
--- 8894,8917 ----
  
  
  <hr>
! <h3><a name="477"></a>477. Operator-> for const forward iterators</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-07-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#478">478</a></p>
  <p><b>Discussion:</b></p>
  <p>
  The Forward Iterator requirements table contains the following:
  </p>
! <pre>
!  expression  return type         operational  precondition
                                    semantics
    ==========  ==================  ===========  ==========================
!   a->m        U&amp; if X is mutable, (*a).m       pre: (*a).m is well-defined.
                otherwise const U&amp;
  
!   r->m        U&amp;                  (*r).m       pre: (*r).m is well-defined.
  </pre>
  
  <p>
*************** of referenced members.  But Paragraph 11
*** 10094,10100 ****
  <p>AFAICT if we need the second line at all, it should read the same
  as the first line.</p>
  
! <p>Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a></p>
  
  
  <p><b>Proposed resolution:</b></p>
--- 8931,8937 ----
  <p>AFAICT if we need the second line at all, it should read the same
  as the first line.</p>
  
! <p>Related issue: <a href="lwg-defects.html#478">478</a></p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** as the first line.</p>
*** 10103,10109 ****
  <p><b>Rationale:</b></p>
  <p>The LWG agrees that this is a real problem.  Marked as a DUP
    because the LWG chose to adopt the solution proposed in
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>.
  </p>
  
  
--- 8940,8946 ----
  <p><b>Rationale:</b></p>
  <p>The LWG agrees that this is a real problem.  Marked as a DUP
    because the LWG chose to adopt the solution proposed in
!   <a href="lwg-defects.html#478">478</a>.
  </p>
  
  
*************** as the first line.</p>
*** 10112,10132 ****
  
  <hr>
  <h3><a name="479"></a>479. Container requirements and placement new</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2004-08-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a></p>
  <p><b>Discussion:</b></p>
  <p>Nothing in the standard appears to make this program ill-formed:</p>
  
! <pre>  struct C {
      void* operator new( size_t s ) { return ::operator new( s ); }
      // NOTE: this hides in-place and nothrow new
    };
  
    int main() {
!     vector&lt;C&gt; v;
      v.push_back( C() );
    }
  </pre>
--- 8949,8971 ----
  
  <hr>
  <h3><a name="479"></a>479. Container requirements and placement new</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2004-08-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#580">580</a></p>
  <p><b>Discussion:</b></p>
  <p>Nothing in the standard appears to make this program ill-formed:</p>
  
! <pre>
!   struct C {
      void* operator new( size_t s ) { return ::operator new( s ); }
      // NOTE: this hides in-place and nothrow new
    };
  
    int main() {
!     vector&lt;C> v;
      v.push_back( C() );
    }
  </pre>
*************** support that the eventual solution shoul
*** 10160,10174 ****
  
  <hr>
  <h3><a name="480"></a>480. unary_function and binary_function should have protected nonvirtual destructors</h3>
! <p><b>Section:</b> X [base] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2004-08-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#base">issues</a> in [base].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The classes std::unary_function and std::binary_function are both
  designed to be inherited from but contain no virtual functions.  This
  makes it too easy for a novice programmer to write code like
! binary_function&lt;int, int, int&gt; *p = new plus&lt;int&gt;; delete p;</p>
  
  <p>There are two common ways to prevent this source of undefined
  behavior: give the base class a public virtual destructor, or give it
--- 8999,9013 ----
  
  <hr>
  <h3><a name="480"></a>480. unary_function and binary_function should have protected nonvirtual destructors</h3>
! <p><b>Section:</b> X [depr.base] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2004-08-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.base">issues</a> in [depr.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The classes std::unary_function and std::binary_function are both
  designed to be inherited from but contain no virtual functions.  This
  makes it too easy for a novice programmer to write code like
! binary_function&lt;int, int, int> *p = new plus&lt;int>; delete p;</p>
  
  <p>There are two common ways to prevent this source of undefined
  behavior: give the base class a public virtual destructor, or give it
*************** nonvirtual destructors.</p>
*** 10181,10193 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Change Paragraph 20.3.1 of the Standard from</p>
! <pre>    template &lt;class Arg, class Result&gt;
      struct unary_function {
          typedef Arg argument_type;
          typedef Result result_type;
      };
  
!     template &lt;class Arg1, class Arg2, class Result&gt;
      struct binary_function {
          typedef Arg1 first_argument_type;
          typedef Arg2 second_argument_type;
--- 9020,9033 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Change Paragraph 20.3.1 of the Standard from</p>
! <pre>
!     template &lt;class Arg, class Result>
      struct unary_function {
          typedef Arg argument_type;
          typedef Result result_type;
      };
  
!     template &lt;class Arg1, class Arg2, class Result>
      struct binary_function {
          typedef Arg1 first_argument_type;
          typedef Arg2 second_argument_type;
*************** nonvirtual destructors.</p>
*** 10196,10202 ****
  </pre>
  
  <p>to</p>
! <pre>    template &lt;class Arg, class Result&gt;
          struct unary_function {
          typedef Arg argument_type;
          typedef Result result_type;
--- 9036,9043 ----
  </pre>
  
  <p>to</p>
! <pre>
!     template &lt;class Arg, class Result>
          struct unary_function {
          typedef Arg argument_type;
          typedef Result result_type;
*************** nonvirtual destructors.</p>
*** 10204,10210 ****
          ~unary_function() {}
      };
  
!     template &lt;class Arg1, class Arg2, class Result&gt;
      struct binary_function {
          typedef Arg1 first_argument_type;
          typedef Arg2 second_argument_type;
--- 9045,9051 ----
          ~unary_function() {}
      };
  
!     template &lt;class Arg1, class Arg2, class Result>
      struct binary_function {
          typedef Arg1 first_argument_type;
          typedef Arg2 second_argument_type;
*************** nonvirtual destructors.</p>
*** 10225,10234 ****
  
  <hr>
  <h3><a name="481"></a>481. unique's effects on the range [result, last)</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2004-08-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard says that unique(first, last) "eliminates all but the
--- 9066,9075 ----
  
  <hr>
  <h3><a name="481"></a>481. unique's effects on the range [result, last)</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2004-08-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard says that unique(first, last) "eliminates all but the
*************** explicit, but it's hard to think that's
*** 10262,10277 ****
  
  <hr>
  <h3><a name="483"></a>483. Heterogeneous equality and EqualityComparable</h3>
! <p><b>Section:</b> 25.2 [alg.nonmodifying], 25.3 [alg.modifying.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2004-09-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#283">283</a></p>
  <p><b>Discussion:</b></p>
  <p>c++std-lib-14262</p>
  
  <p>[lib.alg.find] requires T to be EqualityComparable:</p>
  
! <pre>template &lt;class InputIterator, class T&gt;
     InputIterator find(InputIterator first, InputIterator last,
                        const T&amp; value);
  </pre>
--- 9103,9119 ----
  
  <hr>
  <h3><a name="483"></a>483. Heterogeneous equality and EqualityComparable</h3>
! <p><b>Section:</b> 25.2 [alg.nonmodifying], 25.3 [alg.modifying.operations] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2004-09-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#283">283</a></p>
  <p><b>Discussion:</b></p>
  <p>c++std-lib-14262</p>
  
  <p>[lib.alg.find] requires T to be EqualityComparable:</p>
  
! <pre>
! template &lt;class InputIterator, class T>
     InputIterator find(InputIterator first, InputIterator last,
                        const T&amp; value);
  </pre>
*************** operator that takes a T, or a T may be c
*** 10358,10660 ****
  
  
  <p><b>Rationale:</b></p>
! <p>Duplicate of (a subset of) issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#283">283</a>.</p>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="484"></a>484. Convertible to T</h3>
! <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2004-09-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>From comp.std.c++:</p>
! 
! <p>
! I note that given an input iterator a for type T, 
! then *a only has to be "convertable to T", not actually of type T.
! </p>
! 
! <p>Firstly, I can't seem to find an exact definition of "convertable to T". 
! While I assume it is the obvious definition (an implicit conversion), I 
! can't find an exact definition. Is there one?</p>
! 
! <p>Slightly more worryingly, there doesn't seem to be any restriction on 
! the this type, other than it is "convertable to T". Consider two input 
! iterators a and b. I would personally assume that most people would 
! expect *a==*b would perform T(*a)==T(*b), however it doesn't seem that 
! the standard requires that, and that whatever type *a is (call it U) 
! could have == defined on it with totally different symantics and still 
! be a valid inputer iterator.</p>
! 
! <p>Is this a correct reading? When using input iterators should I write 
! T(*a) all over the place to be sure that the object i'm using is the 
! class I expect?</p>
! 
! <p>This is especially a nuisance for operations that are defined to be
!   "convertible to bool".  (This is probably allowed so that
!   implementations could return say an int and avoid an unnessary
!   conversion. However all implementations I have seen simply return a
!   bool anyway.  Typical implemtations of STL algorithms just write
!   things like <tt>while(a!=b &amp;&amp; *a!=0)</tt>.  But strictly
!   speaking, there are lots of types that are convertible to T but
!   that also overload the appropriate operators so this doesn't behave
!   as expected.</p>
! 
! <p>If we want to make code like this legal (which most people seem to
!   expect), then we'll need to tighten up what we mean by "convertible
!   to T".</p>
! 
! <p><i>[Lillehammer: The first part is NAD, since "convertible" is
!  well-defined in core. The second part is basically about pathological
!  overloads. It's a minor problem but a real one. So leave open for
!  now, hope we solve it as part of iterator redesign.]</i></p>
! 
! 
! <p><i>[
! 2009-07-28 Reopened by Alisdair.  No longer solved by concepts.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! Mark as NAD Future. We agree there's an issue, but there is no
! proposed solution at this time and this will be solved by concepts in
! the future.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! <p><b>Rationale:</b></p>
! <p><i>[
! San Francisco:
! ]</i></p>
! 
! 
! <blockquote>
! Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2758.pdf">N2758</a>.
! </blockquote>
! 
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="485"></a>485. output iterator insufficiently constrained</h3>
! <p><b>Section:</b> 24.2.4 [output.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2004-10-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#output.iterators">issues</a> in [output.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The note on 24.1.2 Output iterators insufficiently limits what can be
! performed on output iterators. While it requires that each iterator is
! progressed through only once and that each iterator is written to only
! once, it does not require the following things:</p>
! 
! <p>Note: Here it is assumed that x is an output iterator of type X which
! has not yet been assigned to.</p>
! 
! <p>a) That each value of the output iterator is written to:
! The standard allows:
! ++x; ++x; ++x;
! </p>
! 
! <p>
! b) That assignments to the output iterator are made in order
! X a(x); ++a; *a=1; *x=2; is allowed
! </p>
! 
! <p>
! c) Chains of output iterators cannot be constructed:
! X a(x); ++a; X b(a); ++b; X c(b); ++c; is allowed, and under the current
! wording (I believe) x,a,b,c could be written to in any order.
! </p>
! 
! <p>I do not believe this was the intension of the standard?</p>
! <p><i>[Lillehammer: Real issue.  There are lots of constraints we
!   intended but didn't specify.  Should be solved as part of iterator
!   redesign.]</i></p>
! 
! 
! <p><i>[
! 2009-07 Frankfurt
! ]</i></p>
! 
! 
! <blockquote>
! Bill provided wording according to consensus.
! </blockquote>
! 
! <p><i>[
! 2009-07-21 Alisdair requests change from Review to Open.  See thread starting
! with c++std-lib-24459 for discussion.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! Modified wording.  Set to Review.
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! Move to Ready after looking at again in a larger group in Santa Cruz.
! </blockquote>
! 
! <p><i>[
! 2010 Pittsburgh:
! ]</i></p>
! 
! 
! <blockquote>
! Moved to NAD Editorial.  Rationale added below.
! </blockquote>
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Solved by N3066.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Change Table 101 — Output iterator requirements in 24.2.4 [output.iterators]:
! </p>
! <blockquote>
! <table border="1">
! <caption>Table 101 — Output iterator requirements</caption>
! <tbody><tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational semantics</th>
! <th>Assertion/note pre-/post-condition</th>
! </tr>
! 
! <tr>
! <td>
! <tt>X(a)</tt>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! <tt>a = t</tt> is equivalent to <tt>X(a) = t</tt>. note: a destructor is assumed.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X u(a);</tt><br>
! <tt>X u = a;</tt>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>*r = o</tt>
! </td>
! <td>
! result is not used
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! <ins>
! Post: <tt>r</tt> is not required to be dereferenceable.  <tt>r</tt> is incrementable.
! </ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>++r</tt>
! </td>
! <td>
! <tt>X&amp;</tt>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! <tt>&amp;r == &amp;++r</tt>
! <ins>
! Post: <tt>r</tt> is dereferenceable, unless otherwise specified.  <tt>r</tt> is not required to be incrementable.
! </ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>r++</tt>
! </td>
! <td>
! convertible to <tt>const X&amp;</tt>
! </td>
! <td>
! <tt>{X tmp = r;<br>++r;<br>return tmp;}</tt>
! </td>
! <td>
! <ins>
! Post: <tt>r</tt> is dereferenceable, unless otherwise specified. <tt>r</tt> is not required to be incrementable.
! </ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>*r++ = o;</tt>
! </td>
! <td>
! result is not used
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! 
! </td>
! </tr>
  
- </tbody></table>
- </blockquote>
  
  
  
--- 9200,9207 ----
  
  
  <p><b>Rationale:</b></p>
! <p>Duplicate of (a subset of) issue <a href="lwg-defects.html#283">283</a>.</p>
  
  
  
  
*************** result is not used
*** 10662,10672 ****
  
  <hr>
  <h3><a name="486"></a>486. min/max CopyConstructible requirement is too strict</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-10-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#281">281</a></p>
  <p><b>Discussion:</b></p>
  <p>A straightforward implementation of these algorithms does not need to
  copy T.</p>
--- 9209,9219 ----
  
  <hr>
  <h3><a name="486"></a>486. min/max CopyConstructible requirement is too strict</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-10-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#281">281</a></p>
  <p><b>Discussion:</b></p>
  <p>A straightforward implementation of these algorithms does not need to
  copy T.</p>
*************** copy T.</p>
*** 10685,10694 ****
  
  <hr>
  <h3><a name="487"></a>487. Allocator::construct is too limiting</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dhruv Matani <b>Opened:</b> 2004-10-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard's version of allocator::construct(pointer,
--- 9232,9242 ----
  
  <hr>
  <h3><a name="487"></a>487. Allocator::construct is too limiting</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dhruv Matani <b>Opened:</b> 2004-10-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard's version of allocator::construct(pointer,
*************** manually constructed. Now it may not alw
*** 10701,10709 ****
  construct a socket eh! So, I feel that the changes should go in the
  allocator::construct(), making it:
  </p>
! <pre>    template&lt;typename T&gt;
      struct allocator{
!       template&lt;typename T1&gt;
        void construct(pointer T1 const&amp; rt1);
      };
  </pre>
--- 9249,9258 ----
  construct a socket eh! So, I feel that the changes should go in the
  allocator::construct(), making it:
  </p>
! <pre>
!     template&lt;typename T>
      struct allocator{
!       template&lt;typename T1>
        void construct(pointer T1 const&amp; rt1);
      };
  </pre>
*************** be called! Doesn't that sound great?
*** 10729,10738 ****
  
  <hr>
  <h3><a name="489"></a>489. std::remove / std::remove_if wrongly specified</h3>
! <p><b>Section:</b> 25.3.8 [alg.remove] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Mang <b>Opened:</b> 2004-12-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.remove">issues</a> in [alg.remove].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 25.2.7 [lib.alg.remove], paragraphs 1 to 5 describe the
  behavior of the mutating sequence operations std::remove and
--- 9278,9287 ----
  
  <hr>
  <h3><a name="489"></a>489. std::remove / std::remove_if wrongly specified</h3>
! <p><b>Section:</b> 25.3.8 [alg.remove] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Mang <b>Opened:</b> 2004-12-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.remove">issues</a> in [alg.remove].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 25.2.7 [lib.alg.remove], paragraphs 1 to 5 describe the
  behavior of the mutating sequence operations std::remove and
*************** ISO/IEC 14882:2003.
*** 10928,10937 ****
  
  <hr>
  <h3><a name="490"></a>490. std::unique wrongly specified</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Mang <b>Opened:</b> 2004-12-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 25.2.8 [lib.alg.unique], paragraphs 1 to 3 describe the
  behavior of the mutating sequence operation std::unique. However, the
--- 9477,9486 ----
  
  <hr>
  <h3><a name="490"></a>490. std::unique wrongly specified</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Mang <b>Opened:</b> 2004-12-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 25.2.8 [lib.alg.unique], paragraphs 1 to 3 describe the
  behavior of the mutating sequence operation std::unique. However, the
*************** change, so there is no real-world harm h
*** 11178,11191 ****
  
  
  <hr>
! <h3><a name="491"></a>491. std::list&lt;&gt;::unique incorrectly specified</h3>
! <p><b>Section:</b> 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Mang <b>Opened:</b> 2004-12-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In Section 23.3.4.4 [list.ops], paragraphs 19 to 21 describe the
! behavior of the std::list&lt;T, Allocator&gt;::unique operation. However, the
  current wording is defective for various reasons.</p>
  
  
--- 9727,9740 ----
  
  
  <hr>
! <h3><a name="491"></a>491. std::list&lt;>::unique incorrectly specified</h3>
! <p><b>Section:</b> 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Mang <b>Opened:</b> 2004-12-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In Section 23.3.5.5 [list.ops], paragraphs 19 to 21 describe the
! behavior of the std::list&lt;T, Allocator>::unique operation. However, the
  current wording is defective for various reasons.</p>
  
  
*************** current wording is defective for various
*** 11194,11200 ****
  1) Analysis of current wording:
  </p>
  
! <p>23.3.4.4 [list.ops], paragraph 19:</p>
  
  <p>
  Current wording says:
--- 9743,9749 ----
  1) Analysis of current wording:
  </p>
  
! <p>23.3.5.5 [list.ops], paragraph 19:</p>
  
  <p>
  Current wording says:
*************** predicate argument) holds."</p>
*** 11208,11214 ****
  This sentences makes use of the undefined term "Eliminates". Although it
  is, to a certain degree, reasonable to consider the term "eliminate"
  synonymous with "erase", using "Erase" in the first place, as the
! wording of 23.3.4.4 [list.ops], paragraph 15 does, would be clearer.</p>
  
  <p>
  The range of the elements referred to by iterator i is "[first + 1,
--- 9757,9763 ----
  This sentences makes use of the undefined term "Eliminates". Although it
  is, to a certain degree, reasonable to consider the term "eliminate"
  synonymous with "erase", using "Erase" in the first place, as the
! wording of 23.3.5.5 [list.ops], paragraph 15 does, would be clearer.</p>
  
  <p>
  The range of the elements referred to by iterator i is "[first + 1,
*************** The same problems as pointed out in DR 2
*** 11225,11231 ****
  of arguments for pred()) apply to this paragraph.</p>
  
  <p>
! 23.3.4.4 [list.ops], paragraph 20:
  </p>
  
  <p>
--- 9774,9780 ----
  of arguments for pred()) apply to this paragraph.</p>
  
  <p>
! 23.3.5.5 [list.ops], paragraph 20:
  </p>
  
  <p>
*************** expressions ( "*i == *(i - 1)", "pred(*i
*** 11242,11248 ****
  </p>
  
  <p>
! 23.3.4.4 [list.ops], paragraph 21:</p>
  
  <p>
  Current wording says:
--- 9791,9797 ----
  </p>
  
  <p>
! 23.3.5.5 [list.ops], paragraph 21:</p>
  
  <p>
  Current wording says:
*************** of DR 202, no impact on current code is
*** 11281,11287 ****
  3) Proposed fixes:</p>
  
  <p>
! Change 23.3.4.4 [list.ops], paragraph 19 to:</p>
  
  <p>
  "Effect: Erases all but the first element from every consecutive group
--- 9830,9836 ----
  3) Proposed fixes:</p>
  
  <p>
! Change 23.3.5.5 [list.ops], paragraph 19 to:</p>
  
  <p>
  "Effect: Erases all but the first element from every consecutive group
*************** wording need also additional review.
*** 11300,11306 ****
  b) "Erases" refers in the author's opinion unambiguously to the member
  function "erase". In case there is doubt this might not be unamgibuous,
  a direct reference to the member function "erase" is suggested [Note:
! This would also imply a change of 23.3.4.4 [list.ops], paragraph
  15.].
  c) The expression "(i - 1)" was left, but is expected that DR submitted
  by Thomas Mang regarding invalid iterator arithmetic expressions will
--- 9849,9855 ----
  b) "Erases" refers in the author's opinion unambiguously to the member
  function "erase". In case there is doubt this might not be unamgibuous,
  a direct reference to the member function "erase" is suggested [Note:
! This would also imply a change of 23.3.5.5 [list.ops], paragraph
  15.].
  c) The expression "(i - 1)" was left, but is expected that DR submitted
  by Thomas Mang regarding invalid iterator arithmetic expressions will
*************** elements consists of only a single eleme
*** 11320,11326 ****
  considered the first element."</p>
  
  <p>
! Change 23.3.4.4 [list.ops], paragraph 20 to:</p>
  
  <p>
  "Throws: Nothing unless an exception is thrown by *(i-1) == *i or
--- 9869,9875 ----
  considered the first element."</p>
  
  <p>
! Change 23.3.5.5 [list.ops], paragraph 20 to:</p>
  
  <p>
  "Throws: Nothing unless an exception is thrown by *(i-1) == *i or
*************** Comments to the new wording:</p>
*** 11331,11337 ****
  
  <p>
  a) The wording regarding the conditions is identical to proposed
! 23.3.4.4 [list.ops], paragraph 19. If 23.3.4.4 [list.ops],
  paragraph 19 is resolved in another way, the proposed wording need also
  additional review.
  b) The expression "(i - 1)" was left, but is expected that DR submitted
--- 9880,9886 ----
  
  <p>
  a) The wording regarding the conditions is identical to proposed
! 23.3.5.5 [list.ops], paragraph 19. If 23.3.5.5 [list.ops],
  paragraph 19 is resolved in another way, the proposed wording need also
  additional review.
  b) The expression "(i - 1)" was left, but is expected that DR submitted
*************** take this into account.
*** 11340,11346 ****
  c) Typos fixed.</p>
  
  <p>
! Change 23.3.4.4 [list.ops], paragraph 21 to:</p>
  
  <p>
  "Complexity: If empty() == false, exactly size() - 1 applications of the
--- 9889,9895 ----
  c) Typos fixed.</p>
  
  <p>
! Change 23.3.5.5 [list.ops], paragraph 21 to:</p>
  
  <p>
  "Complexity: If empty() == false, exactly size() - 1 applications of the
*************** harm.</p>
*** 11381,11390 ****
  
  <hr>
  <h3><a name="492"></a>492. Invalid iterator arithmetic expressions</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Mang <b>Opened:</b> 2004-12-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Various clauses other than clause 25 make use of iterator arithmetic not
  supported by the iterator category in question.
--- 9930,9939 ----
  
  <hr>
  <h3><a name="492"></a>492. Invalid iterator arithmetic expressions</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Mang <b>Opened:</b> 2004-12-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Various clauses other than clause 25 make use of iterator arithmetic not
  supported by the iterator category in question.
*************** neither of these four cases:</p>
*** 11434,11440 ****
  "In the description of the algorithms operator + and - are used for some
  of the iterator categories for which they do not have to be defined. In
  these cases the semantics of a+n is the same as that of</p>
! <pre>{X tmp = a;
  advance(tmp, n);
  return tmp;
  }
--- 9983,9990 ----
  "In the description of the algorithms operator + and - are used for some
  of the iterator categories for which they do not have to be defined. In
  these cases the semantics of a+n is the same as that of</p>
! <pre>
! {X tmp = a;
  advance(tmp, n);
  return tmp;
  }
*************** of the iterator categories for which the
*** 11484,11490 ****
  this paragraph, a and b denote values of an iterator type, and n denotes
  a value of a distance type between two iterators. In these cases the
  semantics of a+n is the same as that of</p>
! <pre>{X tmp = a;
  advance(tmp, n);
  return tmp;
  }
--- 10034,10041 ----
  this paragraph, a and b denote values of an iterator type, and n denotes
  a value of a distance type between two iterators. In these cases the
  semantics of a+n is the same as that of</p>
! <pre>
! {X tmp = a;
  advance(tmp, n);
  return tmp;
  }
*************** Bellevue:
*** 11550,11567 ****
  ]</i></p>
  
  
! <blockquote>
  Keep open and ask Bill to provide wording.
! </blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
  ]</i></p>
  
  
! <blockquote>
! This issue is related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
--- 10101,10118 ----
  ]</i></p>
  
  
! <blockquote><p>
  Keep open and ask Bill to provide wording.
! </p></blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
  ]</i></p>
  
  
! <blockquote><p>
! This issue is related to <a href="lwg-defects.html#997">997</a>.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
*************** it doesn't cover. Bill will provide word
*** 11598,11607 ****
  
  <hr>
  <h3><a name="493"></a>493. Undefined Expression in Input Iterator Note Title</h3>
! <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2004-12-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>1) In 24.1.1/3, the following text is currently present.</p>
  
--- 10149,10158 ----
  
  <hr>
  <h3><a name="493"></a>493. Undefined Expression in Input Iterator Note Title</h3>
! <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2004-12-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>1) In 24.1.1/3, the following text is currently present.</p>
  
*************** not guarantee the substitution property
*** 11638,11648 ****
  
  <hr>
  <h3><a name="494"></a>494. Wrong runtime complexity for associative container's insert and delete</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Hans B os <b>Opened:</b> 2004-12-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>According to [lib.associative.reqmts] table 69, the runtime comlexity
  of insert(p, t) and erase(q) can be done in amortized constant time.</p>
--- 10189,10199 ----
  
  <hr>
  <h3><a name="494"></a>494. Wrong runtime complexity for associative container's insert and delete</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Hans B os <b>Opened:</b> 2004-12-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>According to [lib.associative.reqmts] table 69, the runtime comlexity
  of insert(p, t) and erase(q) can be done in amortized constant time.</p>
*************** last) and insert(first, last).</p>
*** 11697,11705 ****
  
  <hr>
  <h3><a name="499"></a>499. Std. doesn't seem to require stable_sort() to be stable!</h3>
! <p><b>Section:</b> 25.4.1.2 [stable.sort] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Prateek Karandikar <b>Opened:</b> 2005-04-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <blockquote><p>
  17.3.1.1 Summary</p>
--- 10248,10256 ----
  
  <hr>
  <h3><a name="499"></a>499. Std. doesn't seem to require stable_sort() to be stable!</h3>
! <p><b>Section:</b> 25.4.1.2 [stable.sort] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Prateek Karandikar <b>Opened:</b> 2005-04-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <blockquote><p>
  17.3.1.1 Summary</p>
*************** other paragraphs are normative.
*** 11720,11726 ****
  <blockquote><p>
  25.3.1.2 stable_sort
  </p>
! <pre>template&lt;class RandomAccessIterator&gt; 
  void stable_sort(RandomAccessIterat or first, RandomAccessIterator last); 
  
  template&lt;class RandomAccessIterator, class Compare&gt; 
--- 10271,10278 ----
  <blockquote><p>
  25.3.1.2 stable_sort
  </p>
! <pre>
! template&lt;class RandomAccessIterator&gt; 
  void stable_sort(RandomAccessIterat or first, RandomAccessIterator last); 
  
  template&lt;class RandomAccessIterator, class Compare&gt; 
*************** This change has already been made.
*** 11767,11776 ****
  
  <hr>
  <h3><a name="500"></a>500. do_length cannot be implemented correctly</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Krzysztof &#379;elechowski <b>Opened:</b> 2005-05-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <ol>
  <li>codecvt::do_length is of type int;</li>
--- 10319,10328 ----
  
  <hr>
  <h3><a name="500"></a>500. do_length cannot be implemented correctly</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Krzysztof &#379;elechowski <b>Opened:</b> 2005-05-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <ol>
  <li>codecvt::do_length is of type int;</li>
*************** Contradiction.
*** 11792,11801 ****
  
  <hr>
  <h3><a name="501"></a>501. Proposal: strengthen guarantees of lib.comparisons</h3>
! <p><b>Section:</b> X [base] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Me &lt;anti_spam_email2003@yahoo.com&gt; <b>Opened:</b> 2005-06-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#base">issues</a> in [base].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <blockquote><p>
  "For templates greater, less, greater_equal, and less_equal,
--- 10344,10353 ----
  
  <hr>
  <h3><a name="501"></a>501. Proposal: strengthen guarantees of lib.comparisons</h3>
! <p><b>Section:</b> X [depr.base] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Me &lt;anti_spam_email2003@yahoo.com&gt; <b>Opened:</b> 2005-06-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.base">issues</a> in [depr.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <blockquote><p>
  "For templates greater, less, greater_equal, and less_equal,
*************** to detect overlapping memory situations.
*** 11864,11873 ****
  
  <hr>
  <h3><a name="502"></a>502. Proposition: Clarification of the interaction between a facet and an iterator</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Christopher Conrade Zseleghovski <b>Opened:</b> 2005-06-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Motivation:
--- 10416,10425 ----
  
  <hr>
  <h3><a name="502"></a>502. Proposition: Clarification of the interaction between a facet and an iterator</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Christopher Conrade Zseleghovski <b>Opened:</b> 2005-06-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Motivation:
*************** Bill.
*** 11925,11934 ****
  
  <hr>
  <h3><a name="503"></a>503. more on locales</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2005-06-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  a) In 22.2.1.1 para. 2 we refer to "the instantiations required in Table
--- 10477,10486 ----
  
  <hr>
  <h3><a name="503"></a>503. more on locales</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2005-06-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  a) In 22.2.1.1 para. 2 we refer to "the instantiations required in Table
*************** Move to NAD.
*** 12052,12061 ****
  
  <hr>
  <h3><a name="504"></a>504. Integer types in pseudo-random number engine requirements</h3>
! <p><b>Section:</b> 26.5.1 [rand.req], TR1 5.1.1 [tr.rand.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.req">issues</a> in [rand.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In [tr.rand.req], Paragraph 2 states that "... s is a value of integral type,
--- 10604,10613 ----
  
  <hr>
  <h3><a name="504"></a>504. Integer types in pseudo-random number engine requirements</h3>
! <p><b>Section:</b> 26.5.1 [rand.req], TR1 5.1.1 [tr.rand.req] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req">issues</a> in [rand.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In [tr.rand.req], Paragraph 2 states that "... s is a value of integral type,
*************** Portland:  Subsumed by N2111.
*** 12121,12130 ****
  
  <hr>
  <h3><a name="506"></a>506. Requirements of Distribution parameter for variate_generator</h3>
! <p><b>Section:</b> 26.5 [rand], TR1 5.1.3 [tr.rand.var] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 3 requires that template argument U (which corresponds to template
--- 10673,10682 ----
  
  <hr>
  <h3><a name="506"></a>506. Requirements of Distribution parameter for variate_generator</h3>
! <p><b>Section:</b> 26.5 [rand], TR1 5.1.3 [tr.rand.var] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 3 requires that template argument U (which corresponds to template
*************** Marc supports having min and max to sati
*** 12162,12171 ****
  
  <hr>
  <h3><a name="509"></a>509. Uniform_int template parameters</h3>
! <p><b>Section:</b> 26.5.8.1 [rand.dist.uni], TR1 5.1.7.1 [tr.rand.dist.iunif] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.uni">issues</a> in [rand.dist.uni].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In [tr.rand.dist.iunif] the uniform_int distribution currently has a single
--- 10714,10723 ----
  
  <hr>
  <h3><a name="509"></a>509. Uniform_int template parameters</h3>
! <p><b>Section:</b> 26.5.8.2 [rand.dist.uni], TR1 5.1.7.1 [tr.rand.dist.iunif] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist.uni">issues</a> in [rand.dist.uni].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In [tr.rand.dist.iunif] the uniform_int distribution currently has a single
*************** We recommend that there be a second temp
*** 12181,12187 ****
  reflect the distribution's input_type, and that the existing first template
  parameter continue to reflect (solely) the result_type:
  </p>
! <blockquote><pre>template&lt; class IntType = int, UIntType = unsigned int &gt;
  class uniform_int
  {
  public:
--- 10733,10740 ----
  reflect the distribution's input_type, and that the existing first template
  parameter continue to reflect (solely) the result_type:
  </p>
! <blockquote><pre>
! template&lt; class IntType = int, UIntType = unsigned int &gt;
  class uniform_int
  {
  public:
*************** eliminated.
*** 12203,12216 ****
  
  <hr>
  <h3><a name="510"></a>510. Input_type for bernoulli_distribution</h3>
! <p><b>Section:</b> 26.5.8.2 [rand.dist.bern], TR1 5.1.7.2 [tr.rand.dist.bern] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In [tr.rand.dist.bern] the distribution currently requires;
  </p>
! <blockquote><pre>typedef  int  input_type;
  </pre></blockquote>
  
  
--- 10756,10770 ----
  
  <hr>
  <h3><a name="510"></a>510. Input_type for bernoulli_distribution</h3>
! <p><b>Section:</b> 26.5.8.3 [rand.dist.bern], TR1 5.1.7.2 [tr.rand.dist.bern] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In [tr.rand.dist.bern] the distribution currently requires;
  </p>
! <blockquote><pre>
! typedef  int  input_type;
  </pre></blockquote>
  
  
*************** In [tr.rand.dist.bern] the distribution
*** 12218,12224 ****
  <p>
  We believe this is an unfortunate choice, and recommend instead:
  </p>
! <blockquote><pre>typedef  unsigned int  input_type;
  </pre></blockquote>
  
  <p><i>[
--- 10772,10779 ----
  <p>
  We believe this is an unfortunate choice, and recommend instead:
  </p>
! <blockquote><pre>
! typedef  unsigned int  input_type;
  </pre></blockquote>
  
  <p><i>[
*************** eliminated.
*** 12234,12243 ****
  
  <hr>
  <h3><a name="511"></a>511. Input_type for binomial_distribution</h3>
! <p><b>Section:</b> 26.5.8 [rand.dist], TR1 5.1.7.5 [tr.rand.dist.bin] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist">issues</a> in [rand.dist].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Unlike all other distributions in TR1, this binomial_distribution has an
--- 10789,10798 ----
  
  <hr>
  <h3><a name="511"></a>511. Input_type for binomial_distribution</h3>
! <p><b>Section:</b> 26.5.8 [rand.dist], TR1 5.1.7.5 [tr.rand.dist.bin] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist">issues</a> in [rand.dist].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Unlike all other distributions in TR1, this binomial_distribution has an
*************** implementation-defined  input_type.  We
*** 12245,12251 ****
  because it hinders users from writing portable code.  It also hinders the
  writing of compliance tests.  We recommend instead:
  </p>
! <blockquote><pre>typedef  RealType  input_type;
  </pre></blockquote>
  <p>
  While this choice is somewhat arbitrary (as it was for some of the other
--- 10800,10807 ----
  because it hinders users from writing portable code.  It also hinders the
  writing of compliance tests.  We recommend instead:
  </p>
! <blockquote><pre>
! typedef  RealType  input_type;
  </pre></blockquote>
  <p>
  While this choice is somewhat arbitrary (as it was for some of the other
*************** in each case as having some real type.
*** 12309,12315 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <blockquote><pre>typedef  RealType  input_type;
  </pre></blockquote>
  
  <p><i>[
--- 10865,10872 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <blockquote><pre>
! typedef  RealType  input_type;
  </pre></blockquote>
  
  <p><i>[
*************** eliminated.
*** 12323,12336 ****
  
  
  <hr>
! <h3><a name="512"></a>512. Seeding subtract_with_carry_01 from a single unsigned long</h3>
! <p><b>Section:</b> 26.5.3 [rand.eng], TR1 5.1.4.4 [tr.rand.eng.sub1] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.eng">issues</a> in [rand.eng].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Paragraph 8 specifies the algorithm by which a subtract_with_carry_01  engine
  is to be seeded given a single unsigned long.  This algorithm is seriously
  flawed in the case where the engine parameter w (also known as word_size)
  exceeds 31 [bits].  The key part of the paragraph reads:
--- 10880,10893 ----
  
  
  <hr>
! <h3><a name="512"></a>512. Seeding <tt>subtract_with_carry_01</tt> from a single unsigned long</h3>
! <p><b>Section:</b> 26.5.3 [rand.eng], TR1 5.1.4.4 [tr.rand.eng.sub1] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.eng">issues</a> in [rand.eng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Paragraph 8 specifies the algorithm by which a <tt>subtract_with_carry_01</tt> engine
  is to be seeded given a single unsigned long.  This algorithm is seriously
  flawed in the case where the engine parameter w (also known as word_size)
  exceeds 31 [bits].  The key part of the paragraph reads:
*************** and so forth.
*** 12345,12356 ****
  Since the specified linear congruential engine, lcg, delivers numbers with
  a maximum of 2147483563 (just a shade under 31 bits), then when w is, for
  example, 48, each of the x(i) will be less than 2**-17.  The consequence
! is that roughly the first 400 numbers delivered will be  conspicuously
  close to either zero or one.
  </p>
  <p>
  Unfortunately, this is not an innocuous flaw:  One of the predefined engines
! in [tr.rand.predef],  namely ranlux64_base_01, has w = 48 and would exhibit
  this poor behavior, while the original N1378 proposal states that these
  pre-defined engines are intended to be of "known good properties."
  </p>
--- 10902,10913 ----
  Since the specified linear congruential engine, lcg, delivers numbers with
  a maximum of 2147483563 (just a shade under 31 bits), then when w is, for
  example, 48, each of the x(i) will be less than 2**-17.  The consequence
! is that roughly the first 400 numbers delivered will be conspicuously
  close to either zero or one.
  </p>
  <p>
  Unfortunately, this is not an innocuous flaw:  One of the predefined engines
! in [tr.rand.predef], namely <tt>ranlux64_base_01</tt>, has w = 48 and would exhibit
  this poor behavior, while the original N1378 proposal states that these
  pre-defined engines are intended to be of "known good properties."
  </p>
*************** void seed(unsigned long value = 19780503
*** 12367,12373 ****
  case, <del>with a linear congruential generator <tt>lcg</tt>(i) having parameters
  <tt><i>m<sub>lcg</sub></i> = 2147483563</tt>, <tt><i>a<sub>lcg</sub></i> = 40014</tt>,
  <tt><i>c<sub>lcg</sub></i> = 0</tt>, and <tt><i>lcg</i>(0) = value</tt>,</del>
! sets <ins>carry<tt>(-1)</tt> and</ins> <tt>x(-r) … x(-1)</tt>
  <ins>as if executing</ins></p>
  
  <blockquote><pre><ins>
--- 10924,10930 ----
  case, <del>with a linear congruential generator <tt>lcg</tt>(i) having parameters
  <tt><i>m<sub>lcg</sub></i> = 2147483563</tt>, <tt><i>a<sub>lcg</sub></i> = 40014</tt>,
  <tt><i>c<sub>lcg</sub></i> = 0</tt>, and <tt><i>lcg</i>(0) = value</tt>,</del>
! sets <ins>carry<tt>(-1)</tt> and</ins> <tt>x(-r) &hellip; x(-1)</tt>
  <ins>as if executing</ins></p>
  
  <blockquote><pre><ins>
*************** seed(lcg);
*** 12376,12383 ****
  </ins></pre></blockquote>
  
  <p>
! <del>to <tt>(<i>lcg</i>(1) · 2<sup>-<i>w</i></sup>) mod 1
! … (<i>lcg</i>(<i>r</i>) · 2<sup>-<i>w</i></sup>) mod 1</tt>,
  respectively. If <tt><i>x</i>(-1) == 0</tt>, sets carry<tt>(-1) = 2<sup>-<i>w</i></sup></tt>,
  else sets carry<tt>(-1) = 0</tt>.</del></p>
  </blockquote>
--- 10933,10940 ----
  </ins></pre></blockquote>
  
  <p>
! <del>to <tt>(<i>lcg</i>(1) &middot; 2<sup>-<i>w</i></sup>) mod 1
! &hellip; (<i>lcg</i>(<i>r</i>) &middot; 2<sup>-<i>w</i></sup>) mod 1</tt>,
  respectively. If <tt><i>x</i>(-1) == 0</tt>, sets carry<tt>(-1) = 2<sup>-<i>w</i></sup></tt>,
  else sets carry<tt>(-1) = 0</tt>.</del></p>
  </blockquote>
*************** intended.  Moved to Ready.
*** 12399,12410 ****
  <p><b>Rationale:</b></p>
  <p>
  Jens: I'm using an explicit type here, because fixing the
! prose would probably not qualify for the (with issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a> even
  stricter) requirements we have for seed(Gen&amp;).
  </p>
  
  <p><i>[
! Portland:  Subsumed by N2111.
  ]</i></p>
  
  
--- 10956,10967 ----
  <p><b>Rationale:</b></p>
  <p>
  Jens: I'm using an explicit type here, because fixing the
! prose would probably not qualify for the (with issue <a href="lwg-closed.html#504">504</a> even
  stricter) requirements we have for seed(Gen&amp;).
  </p>
  
  <p><i>[
! Portland: Subsumed by N2111.
  ]</i></p>
  
  
*************** Portland:  Subsumed by N2111.
*** 12414,12423 ****
  
  <hr>
  <h3><a name="513"></a>513. Size of state for subtract_with_carry_01</h3>
! <p><b>Section:</b> 26.5.3 [rand.eng], TR1 5.1.4.4 [tr.rand.eng.sub1] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.eng">issues</a> in [rand.eng].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 3 begins:
--- 10971,10980 ----
  
  <hr>
  <h3><a name="513"></a>513. Size of state for subtract_with_carry_01</h3>
! <p><b>Section:</b> 26.5.3 [rand.eng], TR1 5.1.4.4 [tr.rand.eng.sub1] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.eng">issues</a> in [rand.eng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 3 begins:
*************** Berlin: N1932 adopts the proposed NAD.
*** 12467,12475 ****
  
  <hr>
  <h3><a name="514"></a>514. Size of state for subtract_with_carry</h3>
! <p><b>Section:</b> 26.5.3.3 [rand.eng.sub], TR1 5.1.4.3 [tr.rand.eng.sub] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 2 begins:
--- 11024,11032 ----
  
  <hr>
  <h3><a name="514"></a>514. Size of state for subtract_with_carry</h3>
! <p><b>Section:</b> 26.5.3.3 [rand.eng.sub], TR1 5.1.4.3 [tr.rand.eng.sub] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 2 begins:
*************** Berlin: N1932 adopts the proposed NAD.
*** 12512,12528 ****
  
  <hr>
  <h3><a name="515"></a>515. Random number engine traits</h3>
! <p><b>Section:</b> 26.5.2 [rand.synopsis], TR1 5.1.2 [tr.rand.synopsis] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.synopsis">issues</a> in [rand.synopsis].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  To accompany the concept of a pseudo-random number engine as defined in Table 17,
  we propose and recommend an adjunct template, engine_traits, to be declared in
  [tr.rand.synopsis] as:
  </p>
! <blockquote><pre>template&lt; class PSRE &gt;
  class engine_traits;
  </pre></blockquote>
  <p>
--- 11069,11086 ----
  
  <hr>
  <h3><a name="515"></a>515. Random number engine traits</h3>
! <p><b>Section:</b> 26.5.2 [rand.synopsis], TR1 5.1.2 [tr.rand.synopsis] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.synopsis">issues</a> in [rand.synopsis].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  To accompany the concept of a pseudo-random number engine as defined in Table 17,
  we propose and recommend an adjunct template, engine_traits, to be declared in
  [tr.rand.synopsis] as:
  </p>
! <blockquote><pre>
! template&lt; class PSRE &gt;
  class engine_traits;
  </pre></blockquote>
  <p>
*************** For example, today it is not possible to
*** 12538,12544 ****
  requires any specific number of random bits.  More specifically, consider a
  cryptographic application that internally needs 256 bits of randomness per call:
  </p>
! <blockquote><pre>template&lt; class Eng, class InIter, class OutIter &gt;
  void crypto( Eng&amp; e, InIter in, OutIter out );
  </pre></blockquote>
  <p>
--- 11096,11103 ----
  requires any specific number of random bits.  More specifically, consider a
  cryptographic application that internally needs 256 bits of randomness per call:
  </p>
! <blockquote><pre>
! template&lt; class Eng, class InIter, class OutIter &gt;
  void crypto( Eng&amp; e, InIter in, OutIter out );
  </pre></blockquote>
  <p>
*************** engine, the algorithm has no means of de
*** 12549,12555 ****
  In a new section [tr.rand.eng.traits], we proposed to define the engine_traits
  template as: 
  </p>
! <blockquote><pre>template&lt; class PSRE &gt;
  class engine_traits
  {
    static  std::size_t  bits_of_randomness = 0u;
--- 11108,11115 ----
  In a new section [tr.rand.eng.traits], we proposed to define the engine_traits
  template as: 
  </p>
! <blockquote><pre>
! template&lt; class PSRE &gt;
  class engine_traits
  {
    static  std::size_t  bits_of_randomness = 0u;
*************** covers this.  Already in WP.
*** 12586,12595 ****
  
  <hr>
  <h3><a name="516"></a>516. Seeding subtract_with_carry_01 using a generator</h3>
! <p><b>Section:</b> 26.5.3 [rand.eng], TR1 5.1.4.4 [tr.rand.eng.sub1] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.eng">issues</a> in [rand.eng].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 6 says:
--- 11146,11155 ----
  
  <hr>
  <h3><a name="516"></a>516. Seeding subtract_with_carry_01 using a generator</h3>
! <p><b>Section:</b> 26.5.3 [rand.eng], TR1 5.1.4.4 [tr.rand.eng.sub1] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.eng">issues</a> in [rand.eng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 6 says:
*************** Portland:  Subsumed by N2111.
*** 12624,12633 ****
  
  <hr>
  <h3><a name="517"></a>517. Should include name in external representation</h3>
! <p><b>Section:</b> 26.5.1 [rand.req], TR1 5.1.1 [tr.rand.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.req">issues</a> in [rand.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The last two rows of Table 16 deal with the i/o requirements of an engine,
--- 11184,11193 ----
  
  <hr>
  <h3><a name="517"></a>517. Should include name in external representation</h3>
! <p><b>Section:</b> 26.5.1 [rand.req], TR1 5.1.1 [tr.rand.req] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req">issues</a> in [rand.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The last two rows of Table 16 deal with the i/o requirements of an engine,
*************** Berlin: N1932 considers this NAD. This i
*** 12661,12824 ****
  
  
  <hr>
- <h3><a name="523"></a>523. regex case-insensitive character ranges are unimplementable as specified</h3>
- <p><b>Section:</b> 28 [re] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2005-07-01 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re">issues</a> in [re].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- A problem with TR1 regex is currently being discussed on the Boost 
- developers list. It involves the handling of case-insensitive matching 
- of character ranges such as [Z-a]. The proper behavior (according to the 
- ECMAScript standard) is unimplementable given the current specification 
- of the TR1 regex_traits&lt;&gt; class template. John Maddock, the author of 
- the TR1 regex proposal, agrees there is a problem. The full discussion 
- can be found at http://lists.boost.org/boost/2005/06/28850.php (first 
- message copied below). We don't have any recommendations as yet.
- </p>
- <p>
- -- Begin original message --
- </p>
- <p>
- The situation of interest is described in the ECMAScript specification
- (ECMA-262), section 15.10.2.15:
- </p>
- <p>
- "Even if the pattern ignores case, the case of the two ends of a range
- is significant in determining which characters belong to the range.
- Thus, for example, the pattern /[E-F]/i matches only the letters E, F,
- e, and f, while the pattern /[E-f]/i matches all upper and lower-case
- ASCII letters as well as the symbols [, \, ], ^, _, and `."
- </p>
- <p>
- A more interesting case is what should happen when doing a
- case-insentitive match on a range such as [Z-a]. It should match z, Z,
- a, A and the symbols [, \, ], ^, _, and `. This is not what happens with
- Boost.Regex (it throws an exception from the regex constructor).
- </p>
- <p>
- The tough pill to swallow is that, given the specification in TR1, I
- don't think there is any effective way to handle this situation.
- According to the spec, case-insensitivity is handled with
- regex_traits&lt;&gt;::translate_nocase(CharT) -- two characters are equivalent
- if they compare equal after both are sent through the translate_nocase
- function. But I don't see any way of using this translation function to
- make character ranges case-insensitive. Consider the difficulty of
- detecting whether "z" is in the range [Z-a]. Applying the transformation
- to "z" has no effect (it is essentially std::tolower). And we're not
- allowed to apply the transformation to the ends of the range, because as
- ECMA-262 says, "the case of the two ends of a range is significant."
- </p>
- <p>
- So AFAICT, TR1 regex is just broken, as is Boost.Regex. One possible fix
- is to redefine translate_nocase to return a string_type containing all
- the characters that should compare equal to the specified character. But
- this function is hard to implement for Unicode, and it doesn't play nice
- with the existing ctype facet. What a mess!
- </p>
- <p>
- -- End original message --
- </p>
- 
- <p><i>[
- John Maddock adds:
- ]</i></p>
- 
- 
- <p>
- One small correction, I have since found that ICU's regex package does 
- implement this correctly, using a similar mechanism to the current 
- TR1.Regex.
- </p>
- <p>
- Given an expression [c1-c2] that is compiled as case insensitive it:
- </p>
- <p>
- Enumerates every character in the range c1 to c2 and converts it to it's 
- case folded equivalent.  That case folded character is then used a key to a 
- table of equivalence classes, and each member of the class is added to the 
- list of possible matches supported by the character-class.  This second step 
- isn't possible with our current traits class design, but isn't necessary if 
- the input text is also converted to a case-folded equivalent on the fly.
- </p>
- <p>
- ICU applies similar brute force mechanisms to character classes such as 
- [[:lower:]] and [[:word:]], however these are at least cached, so the impact 
- is less noticeable in this case.
- </p>
- <p>
- Quick and dirty performance comparisons show that expressions such as 
- "[X-\\x{fff0}]+" are indeed very slow to compile with ICU (about 200 times 
- slower than a "normal" expression).  For an application that uses a lot of 
- regexes this could have a noticeable performance impact.  ICU also has an 
- advantage in that it knows the range of valid characters codes: code points 
- outside that range are assumed not to require enumeration, as they can not 
- be part of any equivalence class.  I presume that if we want the TR1.Regex 
- to work with arbitrarily large character sets enumeration really does become 
- impractical.
- </p>
- <p>
- Finally note that Unicode has:
- </p>
- <p>
- Three cases (upper, lower and title).
- One to many, and many to one case transformations.
- Character that have context sensitive case translations - for example an 
- uppercase sigma has two different lowercase forms  - the form chosen depends 
- on context(is it end of a word or not), a caseless match for an upper case 
- sigma should match either of the lower case forms, which is why case folding 
- is often approximated by tolower(toupper(c)).
- </p>
- <p>
- Probably we need some way to enumerate character equivalence classes, 
- including digraphs (either as a result or an input), and some way to tell 
- whether the next character pair is a valid digraph in the current locale.
- </p>
- <p>
- Hoping this doesn't make this even more complex that it was already,
- </p>
- 
- <p><i>[
- Portland:  Alisdair: Detect as invalid, throw an exception.
- Pete: Possible general problem with case insensitive ranges.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- We agree that this is a problem, but we do not know the answer.
- </p>
- <p>
- We are going to declare this NAD until existing practice leads us in some direction.
- </p>
- <p>
- No objection to NAD Future.
- </p>
- <p>
- Move to NAD Future.
- </p>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="526"></a>526. Is it undefined if a function in the standard changes in parameters?</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2005-09-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Problem: There are a number of places in the C++ standard library where
--- 11221,11231 ----
  
  
  <hr>
  <h3><a name="526"></a>526. Is it undefined if a function in the standard changes in parameters?</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2005-09-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Problem: There are a number of places in the C++ standard library where
*************** template insert functions from self refe
*** 12965,12974 ****
  
  <hr>
  <h3><a name="528"></a>528. <tt>const_iterator</tt> <tt>iterator</tt> issue when they are the same type</h3>
! <p><b>Section:</b> 23.7 [unord], TR1 6.3.4 [tr.unord.unord] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2005-10-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  while implementing the resolution of issue 6.19 I'm noticing the
--- 11372,11381 ----
  
  <hr>
  <h3><a name="528"></a>528. <tt>const_iterator</tt> <tt>iterator</tt> issue when they are the same type</h3>
! <p><b>Section:</b> 23.5 [unord], TR1 6.3.4 [tr.unord.unord] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2005-10-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  while implementing the resolution of issue 6.19 I'm noticing the
*************** Post-Berlin: Beman supplied wording.
*** 13030,13049 ****
  
  
  
! <p><b>Rationale:</b></p>
  Toronto:  The first issue has been fixed by N2350 (the insert and erase members
  are collapsed into one signature).  Alisdair to open a separate issue on the
  chapter 17 wording.
! 
  
  
  
  
  <hr>
  <h3><a name="529"></a>529. The standard encourages redundant and confusing preconditions</h3>
! <p><b>Section:</b> 17.6.3.11 [res.on.required] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2005-10-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  17.4.3.8/1 says:
--- 11437,11456 ----
  
  
  
! <p><b>Rationale:</b></p><p>
  Toronto:  The first issue has been fixed by N2350 (the insert and erase members
  are collapsed into one signature).  Alisdair to open a separate issue on the
  chapter 17 wording.
! </p>
  
  
  
  
  <hr>
  <h3><a name="529"></a>529. The standard encourages redundant and confusing preconditions</h3>
! <p><b>Section:</b> 17.6.4.11 [res.on.required] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2005-10-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  17.4.3.8/1 says:
*************** example to set, but it encourages needle
*** 13069,13075 ****
  in the standard.  For example:
  </p>
  
! <blockquote><pre>  21 Strings library 
    21.3.3 basic_string capacity
  
    void resize(size_type n, charT c);
--- 11476,11483 ----
  in the standard.  For example:
  </p>
  
! <blockquote><pre>
!   21 Strings library 
    21.3.3 basic_string capacity
  
    void resize(size_type n, charT c);
*************** Alan provided the survey
*** 13134,13249 ****
  
  
  <hr>
- <h3><a name="532"></a>532. Tuple comparison</h3>
- <p><b>Section:</b> 20.4.2.7 [tuple.rel], TR1 6.1.3.5 [tr.tuple.rel] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2005-11-29 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.rel">issues</a> in [tuple.rel].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#348">348</a></p>
- <p><b>Discussion:</b></p>
- <p>
- Where possible, tuple comparison operators &lt;,&lt;=,=&gt;, and &gt; ought to be
- defined in terms of std::less rather than operator&lt;, in order to
- support comparison of tuples of pointers.  
- </p>
- 
- <p><i>[
- 2009-07-28 Reopened by Alisdair.  No longer solved by concepts.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- If we solve this for <tt>tuple</tt> we would have to solve it for <tt>pair</tt>
- algorithms, etc.  It is too late to do that at this time.  Move to NAD Future.
- </p>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- change 6.1.3.5/5 from:
- </p>
- 
- <blockquote><p>
-   Returns: The result of a lexicographical comparison between t and
-   u. The result is defined as: (bool)(get&lt;0&gt;(t) &lt; get&lt;0&gt;(u)) ||
-   (!(bool)(get&lt;0&gt;(u) &lt; get&lt;0&gt;(t)) &amp;&amp; ttail &lt; utail), where rtail for
-   some tuple r is a tuple containing all but the first element of
-   r. For any two zero-length tuples e and f, e &lt; f returns false.
- </p></blockquote>
- 
- <p>
- to:
- </p>
- 
- <blockquote>
- <p>
-   Returns: The result of a lexicographical comparison between t and
-   u. For any two zero-length tuples e and f, e &lt; f returns false.
-   Otherwise, the result is defined as: cmp( get&lt;0&gt;(t), get&lt;0&gt;(u)) ||
-   (!cmp(get&lt;0&gt;(u), get&lt;0&gt;(t)) &amp;&amp; ttail &lt; utail), where rtail for some
-   tuple r is a tuple containing all but the first element of r, and
-   cmp(x,y) is an unspecified function template defined as follows.
- </p>
- <p>
-   Where T is the type of x and U is the type of y:
- </p>
- 
- <p>
-      if T and U are pointer types and T is convertible to U, returns
-      less&lt;U&gt;()(x,y)
- </p>
- 
- <p>
-      otherwise, if T and U are pointer types, returns less&lt;T&gt;()(x,y)
- </p>
- 
- <p>
-      otherwise, returns (bool)(x &lt; y)
- </p>
- </blockquote>
- 
- <p><i>[
- Berlin: This issue is much bigger than just tuple (pair, containers,
- algorithms). Dietmar will survey and work up proposed wording.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Recommend NAD.  This will be fixed with the next revision of concepts.
- </p>
- 
- <p><i>[
- San Francisco:
- ]</i></p>
- 
- 
- <blockquote>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2770.pdf">N2770</a>.
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="536"></a>536. Container iterator constructor and explicit convertibility</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Joaquín M López Muñoz <b>Opened:</b> 2005-12-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a></p>
  <p><b>Discussion:</b></p>
  <p>
  The iterator constructor X(i,j) for containers as defined in 23.1.1 and
--- 11542,11554 ----
  
  
  <hr>
  <h3><a name="536"></a>536. Container iterator constructor and explicit convertibility</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz <b>Opened:</b> 2005-12-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#589">589</a></p>
  <p><b>Discussion:</b></p>
  <p>
  The iterator constructor X(i,j) for containers as defined in 23.1.1 and
*************** Dietmar.
*** 13277,13283 ****
  Valid code below?
  </p>
  
! <blockquote><pre>#include &lt;vector&gt; 
  #include &lt;iterator&gt; 
  #include &lt;iostream&gt; 
  
--- 11582,11589 ----
  Valid code below?
  </p>
  
! <blockquote><pre>
! #include &lt;vector&gt; 
  #include &lt;iterator&gt; 
  #include &lt;iostream&gt; 
  
*************** Berlin: Some support, not universal, for
*** 13310,13319 ****
  
  <hr>
  <h3><a name="544"></a>544. minor NULL problems in C.2</h3>
! <p><b>Section:</b> C.2 [diff.library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-11-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#diff.library">issues</a> in [diff.library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to C.2.2.3, p1, "the macro NULL, defined in any of &lt;clocale&gt;,
--- 11616,11625 ----
  
  <hr>
  <h3><a name="544"></a>544. minor NULL problems in C.2</h3>
! <p><b>Section:</b> C.5 [diff.library] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-11-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#diff.library">issues</a> in [diff.library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to C.2.2.3, p1, "the macro NULL, defined in any of &lt;clocale&gt;,
*************** Portland:  Resolution is considered edit
*** 13355,13363 ****
  
  <hr>
  <h3><a name="546"></a>546. _Longlong and _ULonglong are integer types</h3>
! <p><b>Section:</b> TR1 5.1.1 [tr.rand.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The TR sneaks in two new integer types, _Longlong and _Ulonglong, in [tr.c99].
--- 11661,11669 ----
  
  <hr>
  <h3><a name="546"></a>546. _Longlong and _ULonglong are integer types</h3>
! <p><b>Section:</b> TR1 5.1.1 [tr.rand.req] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The TR sneaks in two new integer types, _Longlong and _Ulonglong, in [tr.c99].
*************** Move to NAD.
*** 13401,13410 ****
  
  <hr>
  <h3><a name="547"></a>547. division should be floating-point, not integer</h3>
! <p><b>Section:</b> 26.5 [rand], TR1 5.1 [tr.rand] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 10 describes how a variate generator uses numbers produced by an
--- 11707,11716 ----
  
  <hr>
  <h3><a name="547"></a>547. division should be floating-point, not integer</h3>
! <p><b>Section:</b> 26.5 [rand], TR1 5.1 [tr.rand] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 10 describes how a variate generator uses numbers produced by an
*************** Recommend NAD as the affected section is
*** 13434,13443 ****
  
  <hr>
  <h3><a name="548"></a>548. May random_device block?</h3>
! <p><b>Section:</b> 26.5.6 [rand.device], TR1 5.1.6 [tr.rand.device] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.device">issues</a> in [rand.device].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class random_device "produces non-deterministic random numbers", using some
--- 11740,11749 ----
  
  <hr>
  <h3><a name="548"></a>548. May random_device block?</h3>
! <p><b>Section:</b> 26.5.6 [rand.device], TR1 5.1.6 [tr.rand.device] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.device">issues</a> in [rand.device].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class random_device "produces non-deterministic random numbers", using some
*************** Adopt the proposed resolution in
*** 13477,13486 ****
  
  <hr>
  <h3><a name="549"></a>549. Undefined variable in binomial_distribution</h3>
! <p><b>Section:</b> 26.5.8 [rand.dist], TR1 5.1.7.5 [tr.rand.dist.bin] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist">issues</a> in [rand.dist].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 1 says that "A binomial distributon random distribution produces
--- 11783,11792 ----
  
  <hr>
  <h3><a name="549"></a>549. Undefined variable in binomial_distribution</h3>
! <p><b>Section:</b> 26.5.8 [rand.dist], TR1 5.1.7.5 [tr.rand.dist.bin] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist">issues</a> in [rand.dist].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 1 says that "A binomial distributon random distribution produces
*************** Portland:  Subsumed by N2111.
*** 13505,13522 ****
  
  
  <hr>
! <h3><a name="553"></a>553. very minor editorial change intptr_t / uintptr_t</h3>
! <p><b>Section:</b> 18.4.1 [cstdint.syn], TR1 8.22.1 [tr.c99.cstdint.syn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-01-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#cstdint.syn">issues</a> in [cstdint.syn].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In the synopsis, some types are identified as optional: int8_t, int16_t,
  and so on, consistently with C99, indeed.
  </p>
  <p>
! On the other hand, intptr_t and uintptr_t, are not marked as such and
  probably should, consistently with C99, 7.18.1.4.
  </p>
  
--- 11811,11828 ----
  
  
  <hr>
! <h3><a name="553"></a>553. very minor editorial change <tt>intptr_t</tt> / <tt>uintptr_t</tt></h3>
! <p><b>Section:</b> 18.4.1 [cstdint.syn], TR1 8.22.1 [tr.c99.cstdint.syn] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-01-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#cstdint.syn">issues</a> in [cstdint.syn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In the synopsis, some types are identified as optional: <tt>int8_t</tt>, <tt>int16_t</tt>,
  and so on, consistently with C99, indeed.
  </p>
  <p>
! On the other hand, <tt>intptr_t</tt> and <tt>uintptr_t</tt>, are not marked as such and
  probably should, consistently with C99, 7.18.1.4.
  </p>
  
*************** probably should, consistently with C99,
*** 13526,13532 ****
  Change 18.4.1 [cstdint.syn]:
  </p>
  
! <blockquote><pre>...
  typedef <i>signed integer type</i> intptr_t;    <ins><i>// optional</i></ins>
  ...
  typedef <i>unsigned integer type</i> uintptr_t;    <ins><i>// optional</i></ins>
--- 11832,11839 ----
  Change 18.4.1 [cstdint.syn]:
  </p>
  
! <blockquote><pre>
! ...
  typedef <i>signed integer type</i> intptr_t;    <ins><i>// optional</i></ins>
  ...
  typedef <i>unsigned integer type</i> uintptr_t;    <ins><i>// optional</i></ins>
*************** typedef <i>unsigned integer type</i> uin
*** 13535,13553 ****
  
  
  
! <p><b>Rationale:</b></p>
  Recommend NAD and fix as editorial with the proposed resolution.
! 
  
  
  
  
  <hr>
  <h3><a name="554"></a>554. Problem with lwg DR 184 numeric_limits&lt;bool&gt;</h3>
! <p><b>Section:</b> 18.3.1.5 [numeric.special] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-01-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numeric.special">issues</a> in [numeric.special].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I believe we have a bug in the resolution of:
--- 11842,11860 ----
  
  
  
! <p><b>Rationale:</b></p><p>
  Recommend NAD and fix as editorial with the proposed resolution.
! </p>
  
  
  
  
  <hr>
  <h3><a name="554"></a>554. Problem with lwg DR 184 numeric_limits&lt;bool&gt;</h3>
! <p><b>Section:</b> 18.3.2.7 [numeric.special] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-01-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numeric.special">issues</a> in [numeric.special].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I believe we have a bug in the resolution of:
*************** I believe we have a bug in the resolutio
*** 13559,13572 ****
  The resolution spells out each member of <tt>numeric_limits&lt;bool&gt;</tt>.
  The part I'm having a little trouble with is:
  </p>
! <blockquote><pre>static const bool traps = false;
  </pre></blockquote>
  
  <p>
  Should this not be implementation defined?  Given:
  </p>
  
! <blockquote><pre>int main()
  {
       bool b1 = true;
       bool b2 = false;
--- 11866,11881 ----
  The resolution spells out each member of <tt>numeric_limits&lt;bool&gt;</tt>.
  The part I'm having a little trouble with is:
  </p>
! <blockquote><pre>
! static const bool traps = false;
  </pre></blockquote>
  
  <p>
  Should this not be implementation defined?  Given:
  </p>
  
! <blockquote><pre>
! int main()
  {
       bool b1 = true;
       bool b2 = false;
*************** Change 18.2.1.5p3:
*** 13587,13593 ****
  
  <blockquote><p>
  -3- The specialization for <tt>bool</tt> shall be provided as follows: </p>
! <blockquote><pre>namespace std { 
     template &lt;&gt; class numeric_limits&lt;bool&gt; {
        ...
        static const bool traps = <del>false</del> <ins><i>implementation-defined</i></ins>;
--- 11896,11903 ----
  
  <blockquote><p>
  -3- The specialization for <tt>bool</tt> shall be provided as follows: </p>
! <blockquote><pre>
! namespace std { 
     template &lt;&gt; class numeric_limits&lt;bool&gt; {
        ...
        static const bool traps = <del>false</del> <ins><i>implementation-defined</i></ins>;
*************** value that will trap.
*** 13610,13618 ****
  
  <hr>
  <h3><a name="555"></a>555. TR1, 8.21/1: typo</h3>
! <p><b>Section:</b> TR1 8.21 [tr.c99.boolh] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-02-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This one, if nobody noticed it yet, seems really editorial:
--- 11920,11928 ----
  
  <hr>
  <h3><a name="555"></a>555. TR1, 8.21/1: typo</h3>
! <p><b>Section:</b> TR1 8.21 [tr.c99.boolh] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-02-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This one, if nobody noticed it yet, seems really editorial:
*************** Redmond:  Editorial.
*** 13641,13650 ****
  
  <hr>
  <h3><a name="557"></a>557. TR1: div(_Longlong, _Longlong) vs div(intmax_t, intmax_t)</h3>
! <p><b>Section:</b> 18.4 [cstdint], TR1 8.22 [tr.c99.cstdint] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-02-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#cstdint">issues</a> in [cstdint].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I'm seeing a problem with such overloads: when, _Longlong == intmax_t ==
--- 11951,11960 ----
  
  <hr>
  <h3><a name="557"></a>557. TR1: div(_Longlong, _Longlong) vs div(intmax_t, intmax_t)</h3>
! <p><b>Section:</b> 18.4 [cstdint], TR1 8.22 [tr.c99.cstdint] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-02-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#cstdint">issues</a> in [cstdint].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I'm seeing a problem with such overloads: when, _Longlong == intmax_t ==
*************** Portland: no consensus.
*** 13680,13686 ****
  Batavia, Bill: The <tt>&lt;cstdint&gt;</tt> synopsis in TR1 8.11.1 [tr.c99.cinttypes.syn] contains:
  ]</i></p>
  
! <blockquote><pre>intmax_t imaxabs(intmax_t i);
  intmax_t abs(intmax_t i);
  
  imaxdiv_t imaxdiv(intmax_t numer, intmax_t denom);
--- 11990,11997 ----
  Batavia, Bill: The <tt>&lt;cstdint&gt;</tt> synopsis in TR1 8.11.1 [tr.c99.cinttypes.syn] contains:
  ]</i></p>
  
! <blockquote><pre>
! intmax_t imaxabs(intmax_t i);
  intmax_t abs(intmax_t i);
  
  imaxdiv_t imaxdiv(intmax_t numer, intmax_t denom);
*************** may not be unique if intmax_t==_longlong
*** 13732,13741 ****
  
  <hr>
  <h3><a name="558"></a>558. lib.input.iterators Defect</h3>
! <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2006-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <blockquote>
  <p>
--- 12043,12052 ----
  
  <hr>
  <h3><a name="558"></a>558. lib.input.iterators Defect</h3>
! <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2006-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <blockquote>
  <p>
*************** Portland: Editorial.
*** 13780,13789 ****
  
  <hr>
  <h3><a name="560"></a>560. User-defined allocators without default constructor</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sergey P. Derevyago <b>Opened:</b> 2006-02-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <h4>1. The essence of the problem.</h4>
  <p>
--- 12091,12101 ----
  
  <hr>
  <h3><a name="560"></a>560. User-defined allocators without default constructor</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sergey P. Derevyago <b>Opened:</b> 2006-02-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <h4>1. The essence of the problem.</h4>
  <p>
*************** the user-defined allocators without defa
*** 13807,13813 ****
  2) Some container operations are obviously underspecified. In particular,
  21.3.7.1p2 tells:
  </p>
! <blockquote><pre>template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt; operator+(
      const charT* lhs,
      const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs
--- 12119,12126 ----
  2) Some container operations are obviously underspecified. In particular,
  21.3.7.1p2 tells:
  </p>
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt; operator+(
      const charT* lhs,
      const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs
*************** through the get_allocator() call but def
*** 13842,13848 ****
  <p>
  Let's suppose that the following memory pool is available:
  </p>
! <blockquote><pre>class mem_pool {
        // ...
        void* allocate(size_t size);
        void deallocate(void* ptr, size_t size);
--- 12155,12162 ----
  <p>
  Let's suppose that the following memory pool is available:
  </p>
! <blockquote><pre>
! class mem_pool {
        // ...
        void* allocate(size_t size);
        void deallocate(void* ptr, size_t size);
*************** Let's suppose that the following memory
*** 13851,13857 ****
  <p>
  So the following allocator can be implemented via this pool:
  </p>
! <blockquote><pre>class stl_allocator {
        mem_pool&amp; pool;
  
   public:
--- 12165,12172 ----
  <p>
  So the following allocator can be implemented via this pool:
  </p>
! <blockquote><pre>
! class stl_allocator {
        mem_pool&amp; pool;
  
   public:
*************** So the following allocator can be implem
*** 13878,13884 ****
  Then the following code works well on some implementations and doesn't work on
  another:
  </p>
! <blockquote><pre>typedef basic_string&lt;char, char_traits&lt;char&gt;, stl_allocator&lt;char&gt; &gt; 
    tl_string;
  mem_pool mp;
  tl_string s1("abc", stl_allocator&lt;int&gt;(mp));
--- 12193,12200 ----
  Then the following code works well on some implementations and doesn't work on
  another:
  </p>
! <blockquote><pre>
! typedef basic_string&lt;char, char_traits&lt;char&gt;, stl_allocator&lt;char&gt; &gt; 
    tl_string;
  mem_pool mp;
  tl_string s1("abc", stl_allocator&lt;int&gt;(mp));
*************** default stl_allocator() constructor.
*** 13892,13898 ****
  The obvious way to solve the compile-time problems is to intentionally define
  a NULL pointer dereferencing default constructor
  </p>
! <blockquote><pre>stl_allocator() : pool(*static_cast&lt;mem_pool*&gt;(0)) {}
  </pre></blockquote>
  <p>
  in a hope that it will not be called. The problem is that it really gets
--- 12208,12215 ----
  The obvious way to solve the compile-time problems is to intentionally define
  a NULL pointer dereferencing default constructor
  </p>
! <blockquote><pre>
! stl_allocator() : pool(*static_cast&lt;mem_pool*&gt;(0)) {}
  </pre></blockquote>
  <p>
  in a hope that it will not be called. The problem is that it really gets
*************** semantics of copying the allocator from
*** 13917,13926 ****
  
  
  <hr>
! <h3><a name="568"></a>568. log2 overloads missing</h3>
! <p><b>Section:</b> TR1 8.16.4 [tr.c99.cmath.over] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-03-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>log2</tt> is missing from the list of "additional overloads" in TR1 8.16.4 [tr.c99.cmath.over] p1.
--- 12234,12243 ----
  
  
  <hr>
! <h3><a name="568"></a>568. <tt>log2</tt> overloads missing</h3>
! <p><b>Section:</b> TR1 8.16.4 [tr.c99.cmath.over] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-03-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>log2</tt> is missing from the list of "additional overloads" in TR1 8.16.4 [tr.c99.cmath.over] p1.
*************** Hinnant:  This is a TR1 issue only.  It
*** 13934,13943 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree this has been fixed in the Working Draft.
  Move to NAD.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 12251,12260 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree this has been fixed in the Working Draft.
  Move to NAD.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Add <tt>log2</tt> to the list of functio
*** 13951,13961 ****
  
  <hr>
  <h3><a name="569"></a>569. Postcondition for basic_ios::clear(iostate) incorrectly stated</h3>
! <p><b>Section:</b> 27.5.4.3 [iostate.flags] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Seungbeom Kim <b>Opened:</b> 2006-03-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#272">272</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Section: 27.4.4.3 [lib.iostate.flags]
--- 12268,12278 ----
  
  <hr>
  <h3><a name="569"></a>569. Postcondition for basic_ios::clear(iostate) incorrectly stated</h3>
! <p><b>Section:</b> 27.5.5.4 [iostate.flags] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Seungbeom Kim <b>Opened:</b> 2006-03-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#272">272</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Section: 27.4.4.3 [lib.iostate.flags]
*************** Section: 27.4.4.3 [lib.iostate.flags]
*** 13964,13970 ****
  Paragraph 4 says:
  </p>
  <blockquote>
! <blockquote><pre>void clear(iostate <i>state</i> = goodbit);
  </pre></blockquote>
  <p>
  <i>Postcondition:</i> If <tt>rdbuf()!=0</tt> then <tt><i>state</i> == rdstate();</tt>
--- 12281,12288 ----
  Paragraph 4 says:
  </p>
  <blockquote>
! <blockquote><pre>
! void clear(iostate <i>state</i> = goodbit);
  </pre></blockquote>
  <p>
  <i>Postcondition:</i> If <tt>rdbuf()!=0</tt> then <tt><i>state</i> == rdstate();</tt>
*************** committee meant.
*** 13989,14006 ****
  
  
  <hr>
! <h3><a name="570"></a>570. Request adding additional explicit specializations of char_traits</h3>
! <p><b>Section:</b> 21.2 [char.traits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jack Reeves <b>Opened:</b> 2006-04-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#char.traits">issues</a> in [char.traits].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Currently, the Standard Library specifies only a declaration for template class
! char_traits&lt;&gt; and requires the implementation provide two explicit
! specializations: char_traits&lt;char&gt; and char_traits&lt;wchar_t&gt;. I feel the Standard
! should require explicit specializations for all built-in character types, i.e.
! char, wchar_t, unsigned char, and signed char.
  </p>
  <p>
  I have put together a paper
--- 12307,12325 ----
  
  
  <hr>
! <h3><a name="570"></a>570. Request adding additional explicit specializations of <tt>char_traits</tt></h3>
! <p><b>Section:</b> 21.2 [char.traits] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jack Reeves <b>Opened:</b> 2006-04-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#char.traits">issues</a> in [char.traits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Currently, the Standard Library specifies only a declaration for template class
! <tt>char_traits&lt;&gt;</tt> and requires the implementation provide two explicit
! specializations: <tt>char_traits&lt;char&gt;</tt> and <tt>char_traits&lt;wchar_t&gt;</tt>. 
! I feel the Standard should require explicit specializations for all built-in 
! character types, i.e. <tt>char</tt>, <tt>wchar_t</tt>, <tt>unsigned char</tt>, 
! and <tt>signed char</tt>.
  </p>
  <p>
  I have put together a paper
*************** but our recommendation is NAD.
*** 14034,14041 ****
  </p>
  <p>
  Note: the issue statement should be updated, as the Toronto comment has
! already been resolved. E.g., char_traits specializations for char16_t
! and char32_t are now in the working paper.
  </p>
  </blockquote>
  
--- 12353,12360 ----
  </p>
  <p>
  Note: the issue statement should be updated, as the Toronto comment has
! already been resolved. E.g., char_traits specializations for <tt>char16_t</tt>
! and <tt>char32_t</tt> are now in the working paper.
  </p>
  </blockquote>
  
*************** Sophia Antipolis:
*** 14044,14052 ****
  ]</i></p>
  
  
! <blockquote>
  Nobody has submitted the requested paper, so we move to NAD, as suggested by the decision at the last meeting.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 12363,12371 ----
  ]</i></p>
  
  
! <blockquote><p>
  Nobody has submitted the requested paper, so we move to NAD, as suggested by the decision at the last meeting.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Nobody has submitted the requested paper
*** 14057,14066 ****
  
  <hr>
  <h3><a name="571"></a>571. Update C90 references to C99?</h3>
! <p><b>Section:</b> 1.2 [intro.refs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-04-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#intro.refs">issues</a> in [intro.refs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  1.2 Normative references [intro.refs] of the WP currently refers to ISO/IEC
--- 12376,12385 ----
  
  <hr>
  <h3><a name="571"></a>571. Update C90 references to C99?</h3>
! <p><b>Section:</b> 1.2 [intro.refs] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-04-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#intro.refs">issues</a> in [intro.refs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  1.2 Normative references [intro.refs] of the WP currently refers to ISO/IEC
*************** In 1.2/1 [intro.refs] of the WP, change:
*** 14084,14102 ****
  
  
  
! <p><b>Rationale:</b></p>
  Recommend NAD, fixed editorially.
! 
  
  
  
  
  <hr>
  <h3><a name="572"></a>572. Oops, we gave 507 WP status</h3>
! <p><b>Section:</b> 26.5 [rand], TR1 5.1 [tr.rand] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-04-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In Berlin, as a working group, we voted in favor of N1932 which makes issue 507 moot:
--- 12403,12421 ----
  
  
  
! <p><b>Rationale:</b></p><p>
  Recommend NAD, fixed editorially.
! </p>
  
  
  
  
  <hr>
  <h3><a name="572"></a>572. Oops, we gave 507 WP status</h3>
! <p><b>Section:</b> 26.5 [rand], TR1 5.1 [tr.rand] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-04-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In Berlin, as a working group, we voted in favor of N1932 which makes issue 507 moot:
*************** is adopted.
*** 14129,14138 ****
  
  <hr>
  <h3><a name="573"></a>573. C++0x file positioning should handle modern file sizes</h3>
! <p><b>Section:</b> 27.5.3 [fpos] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-04-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fpos">issues</a> in [fpos].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are two deficiencies related to file sizes:
--- 12448,12457 ----
  
  <hr>
  <h3><a name="573"></a>573. C++0x file positioning should handle modern file sizes</h3>
! <p><b>Section:</b> 27.5.4 [fpos] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-04-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fpos">issues</a> in [fpos].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are two deficiencies related to file sizes:
*************** There are two deficiencies related to fi
*** 14142,14168 ****
        a way that handles modern file sizes, which are often too
        large to be represented by an unsigned long.</li>
  
! <li>The std::fpos class does not currently have the ability to
        set/get file positions.</li>
  </ol>
  <p>
  The Dinkumware implementation of the Standard Library as shipped with the Microsoft compiler copes with these issues by:
  </p>
! <ol type="A">
! <li>Defining fpos_t be long long, which is large enough to
        represent any file position likely in the foreseeable future.</li>
  
! <li>Adding member functions to class fpos. For example,
! <blockquote><pre>fpos_t seekpos() const;
  </pre></blockquote>
  </li>
  </ol>
  <p>
! Because there are so many types relating to file positions and offsets (fpos_t,
! fpos, pos_type, off_type, streamoff, streamsize, streampos, wstreampos, and
! perhaps more), it is difficult to know if the Dinkumware extensions are
! sufficient. But they seem a useful starting place for discussions, and they do
! represent existing practice.
  </p>
  
  <p><i>[
--- 12461,12488 ----
        a way that handles modern file sizes, which are often too
        large to be represented by an unsigned long.</li>
  
! <li>The <tt>std::fpos</tt> class does not currently have the ability to
        set/get file positions.</li>
  </ol>
  <p>
  The Dinkumware implementation of the Standard Library as shipped with the Microsoft compiler copes with these issues by:
  </p>
! <ol style="list-style-type:upper-alpha">
! <li>Defining <tt>fpos_t</tt> be <tt>long long</tt>, which is large enough to
        represent any file position likely in the foreseeable future.</li>
  
! <li>Adding member functions to class <tt>fpos</tt>. For example,
! <blockquote><pre>
! fpos_t seekpos() const;
  </pre></blockquote>
  </li>
  </ol>
  <p>
! Because there are so many types relating to file positions and offsets (<tt>fpos_t</tt>,
! <tt>fpos</tt>, <tt>pos_type</tt>, <tt>off_type</tt>, <tt>streamoff</tt>, <tt>streamsize</tt>, 
! <tt>streampos</tt>, <tt>wstreampos</tt>, and perhaps more), it is difficult to know if 
! the Dinkumware extensions are sufficient. But they seem a useful starting place for 
! discussions, and they do represent existing practice.
  </p>
  
  <p><i>[
*************** Move to NAD.
*** 14200,14212 ****
  
  
  <hr>
! <h3><a name="579"></a>579. erase(iterator) for unordered containers should not return an iterator</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Joaquín M López Muñoz <b>Opened:</b> 2006-06-13 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  See
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2023.pdf">N2023</a>
--- 12520,12534 ----
  
  
  <hr>
! <h3><a name="579"></a>579. <tt>erase(iterator)</tt> for unordered containers should not return an iterator</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz <b>Opened:</b> 2006-06-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
+ <p><b>Addresses ES-2</b></p>
+ 
  <p>
  See
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2023.pdf">N2023</a>
*************** for full discussion.
*** 14218,14234 ****
  ]</i></p>
  
  
! <blockquote>
  I'm asking for DR 579 to be re-opened, basing on recent discussions on the
  library reflector, see Message c++std-lib-26040 and replies.
! </blockquote>
  
  <p><i>[
  2010-02-07 Paolo updates wording.
  ]</i></p>
  
  
! <blockquote>
  As pointed out by Chris in c++std-lib-26040, that an
  <tt>erase(unordered_container, iterator)</tt> returning an <tt>iterator</tt> can
  easily implemented in user code, if needed; that actually returning an
--- 12540,12556 ----
  ]</i></p>
  
  
! <blockquote><p>
  I'm asking for DR 579 to be re-opened, basing on recent discussions on the
  library reflector, see Message c++std-lib-26040 and replies.
! </p></blockquote>
  
  <p><i>[
  2010-02-07 Paolo updates wording.
  ]</i></p>
  
  
! <blockquote><p>
  As pointed out by Chris in c++std-lib-26040, that an
  <tt>erase(unordered_container, iterator)</tt> returning an <tt>iterator</tt> can
  easily implemented in user code, if needed; that actually returning an
*************** uniformly returns an <tt>iterator</tt>);
*** 14240,14246 ****
  message, Alberto pointed out that the proxy idea isn't a good one; that users
  both of the GNU and Boost implementations are reporting serious performance
  problems with the current version returning an <tt>iterator</tt>.
! </blockquote>
  
  <p><i>[
  2010-02-07 Original wording saved here:
--- 12562,12568 ----
  message, Alberto pointed out that the proxy idea isn't a good one; that users
  both of the GNU and Boost implementations are reporting serious performance
  problems with the current version returning an <tt>iterator</tt>.
! </p></blockquote>
  
  <p><i>[
  2010-02-07 Original wording saved here:
*************** the technique consists in returning a pr
*** 14268,14281 ****
  that
  </p>
  
! <blockquote><pre>iterator q1=a.erase(q);
  </pre></blockquote>
  
  <p>
  works as expected, while
  </p>
  
! <blockquote><pre>a.erase(q);
  </pre></blockquote>
  
  <p>
--- 12590,12605 ----
  that
  </p>
  
! <blockquote><pre>
! iterator q1=a.erase(q);
  </pre></blockquote>
  
  <p>
  works as expected, while
  </p>
  
! <blockquote><pre>
! a.erase(q);
  </pre></blockquote>
  
  <p>
*************** code.
*** 14290,14296 ****
  </blockquote>
  
  <p><i>[
! 2010-03-27 Joaquín adds:
  ]</i></p>
  
  
--- 12614,12620 ----
  </blockquote>
  
  <p><i>[
! 2010-03-27 Joaqu&iacute;n adds:
  ]</i></p>
  
  
*************** No consensus for a change.
*** 14377,14390 ****
  
  <hr>
  <h3><a name="580"></a>580. unused allocator members</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a></p>
  <p><b>Discussion:</b></p>
!         <p>
  
  C++ Standard Library  templates that take an allocator  as an argument
  are    required    to    call    the    <code>allocate()</code>    and
--- 12701,12714 ----
  
  <hr>
  <h3><a name="580"></a>580. unused allocator members</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#479">479</a></p>
  <p><b>Discussion:</b></p>
! <p>
  
  C++ Standard Library  templates that take an allocator  as an argument
  are    required    to    call    the    <code>allocate()</code>    and
*************** pre-Oxford:  Martin provided wording.
*** 14427,14433 ****
  ]</i></p>
  
  
! <blockquote>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2554.pdf">N2554</a>
  (scoped allocators),
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2768.pdf">N2768</a>
--- 12751,12757 ----
  ]</i></p>
  
  
! <blockquote><p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2554.pdf">N2554</a>
  (scoped allocators),
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2768.pdf">N2768</a>
*************** pre-Oxford:  Martin provided wording.
*** 14436,14463 ****
  (allocator defects), address all of these points EXCEPT <tt>max_size()</tt>.
  So, I would add a note to that affect and re-class the defect as belonging
  to section 23.2.1 [container.requirements.general].
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  The comment in the description of this issue that this "would be"
  rendered editorial by the adoption of N2257 is confusing. It appears
  that N2257 was never adopted.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  NAD Editorial.  Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </blockquote>
  
  
  
--- 12760,12787 ----
  (allocator defects), address all of these points EXCEPT <tt>max_size()</tt>.
  So, I would add a note to that affect and re-class the defect as belonging
  to section 23.2.1 [container.requirements.general].
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  The comment in the description of this issue that this "would be"
  rendered editorial by the adoption of N2257 is confusing. It appears
  that N2257 was never adopted.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  NAD Editorial.  Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </p></blockquote>
  
  
  
*************** destroy temporaries.
*** 14539,14545 ****
  
  
  <p><i>[
! Howard: This same paragraph will need some work to accommodate <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>.
  ]</i></p>
  
  
--- 12863,12869 ----
  
  
  <p><i>[
! Howard: This same paragraph will need some work to accommodate <a href="lwg-defects.html#431">431</a>.
  ]</i></p>
  
  
*************** post Oxford:  This would be rendered NAD
*** 14554,14566 ****
  
  <hr>
  <h3><a name="582"></a>582. specialized algorithms and volatile storage</h3>
! <p><b>Section:</b> 20.9.8.2 [uninitialized.copy] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#uninitialized.copy">issues</a> in [uninitialized.copy].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1029">1029</a></p>
          <p>
  
  The specialized  algorithms [lib.specialized.algorithms] are specified
--- 12878,12890 ----
  
  <hr>
  <h3><a name="582"></a>582. specialized algorithms and volatile storage</h3>
! <p><b>Section:</b> 20.7.12.2 [uninitialized.copy] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#uninitialized.copy">issues</a> in [uninitialized.copy].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>Related to <a href="lwg-closed.html#1029">1029</a></p>
          <p>
  
  The specialized  algorithms [lib.specialized.algorithms] are specified
*************** as having the general effect of invoking
*** 14568,14573 ****
--- 12892,12898 ----
  
          </p>
              <pre>
+ 
  new (static_cast&lt;void*&gt;(&amp;*i))
      typename iterator_traits&lt;ForwardIterator&gt;::value_type (x)
  
*************** properly expressed if iterator returns r
*** 14594,14602 ****
  
  <blockquote>
  
! <p>Propose that Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a> be closed NAD.</p>
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a> asks that <tt>uninitialized_copy</tt>,
  <tt>uninitialized_fill</tt>, and <tt>uninitialized_fill_n</tt> should be
  well-formed if the result type is volatile.  My feeling is that the
  standard does not, and should not, guarantee any useful behavior when
--- 12919,12927 ----
  
  <blockquote>
  
! <p>Propose that Issue <a href="lwg-closed.html#582">582</a> be closed NAD.</p>
  <p>
! Issue <a href="lwg-closed.html#582">582</a> asks that <tt>uninitialized_copy</tt>,
  <tt>uninitialized_fill</tt>, and <tt>uninitialized_fill_n</tt> should be
  well-formed if the result type is volatile.  My feeling is that the
  standard does not, and should not, guarantee any useful behavior when
*************** possible editorial change would be to pu
*** 14606,14615 ****
  non-normative note.
  </p>
  <p>
! Note that the three sections starting with 20.9.8.2 [uninitialized.copy] do not
  yet have concepts.  Here's a first crack at the first one:
  </p>
! <blockquote><pre>template &lt;InputIterator InIter, OutputIterator OutIter&gt;
  requires ExplicitConvertible&lt;HasDereference&lt;OutIter::reference&gt;::result,
                               OutIter::value_type&amp;&gt;
        &amp;&amp; Convertible&lt;OutIter::value_type*, void*&gt;
--- 12931,12941 ----
  non-normative note.
  </p>
  <p>
! Note that the three sections starting with 20.7.12.2 [uninitialized.copy] do not
  yet have concepts.  Here's a first crack at the first one:
  </p>
! <blockquote><pre>
! template &lt;InputIterator InIter, OutputIterator OutIter&gt;
  requires ExplicitConvertible&lt;HasDereference&lt;OutIter::reference&gt;::result,
                               OutIter::value_type&amp;&gt;
        &amp;&amp; Convertible&lt;OutIter::value_type*, void*&gt;
*************** requires ExplicitConvertible&lt;HasDeref
*** 14620,14626 ****
  <p>
  Effects:
  </p>
! <blockquote><pre>while (first != last) {
    typedef OutIter::value_type value_type;
    value_type&amp; outRef = static_cast&lt;value_type&amp;&gt;(*result++);
    ::new (static_cast&lt;void*&gt;(addressof(outRef))) value_type(*first++);
--- 12946,12953 ----
  <p>
  Effects:
  </p>
! <blockquote><pre>
! while (first != last) {
    typedef OutIter::value_type value_type;
    value_type&amp; outRef = static_cast&lt;value_type&amp;&gt;(*result++);
    ::new (static_cast&lt;void*&gt;(addressof(outRef))) value_type(*first++);
*************** changes to clauses 20 and 24. Change 20.
*** 14693,14698 ****
--- 13020,13026 ----
  
          </p>
              <pre>
+ 
  <i>Effects</i>:
  
  typedef typename iterator_traits&lt;ForwardIterator&gt;::pointer    pointer;
*************** change 20.6.4.2, p1 to read
*** 14709,14714 ****
--- 13037,13043 ----
  
          </p>
              <pre>
+ 
  <i>Effects</i>:
  
  typedef typename iterator_traits&lt;ForwardIterator&gt;::pointer    pointer;
*************** and change 20.6.4.3, p1 to read
*** 14725,14730 ****
--- 13054,13060 ----
  
          </p>
              <pre>
+ 
  <i>Effects</i>:
  
  typedef typename iterator_traits&lt;ForwardIterator&gt;::pointer    pointer;
*************** and for pointers to volatile as
*** 14749,14754 ****
--- 13079,13085 ----
  
          </p>
              <pre>
+ 
  namespace std {
  template&lt;class T&gt; struct iterator_traits&lt;volatile T*&gt; {
  typedef ptrdiff_t difference_type;
*************** effect by means of function template ove
*** 14775,14788 ****
  
  
  <hr>
! <h3><a name="583"></a>583. div() for unsigned integral types</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-06-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! There is no div() function for unsigned integer types.
  </p>
  <p>
  There are several possible resolutions.  The simplest one is noted below.  Other
--- 13106,13120 ----
  
  
  <hr>
! <h3><a name="583"></a>583. <tt>div()</tt> for unsigned integral types</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-06-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! There is no <tt>div()</tt> function for unsigned integer types.
  </p>
  <p>
  There are several possible resolutions.  The simplest one is noted below.  Other
*************** possibilities include a templated soluti
*** 14795,14826 ****
  Add to 26.7 [lib.c.math] paragraph 8:
  </p>
  
! <blockquote><pre>struct udiv_t div(unsigned, unsigned);
  struct uldiv_t div(unsigned long, unsigned long);
  struct ulldiv_t div(unsigned long long, unsigned long long);
  </pre></blockquote>
  
  
  
! <p><b>Rationale:</b></p>
  Toronto:  C99 does not have these unsigned versions because
  the signed version exist just to define the implementation-defined behavior
  of signed integer division.  Unsigned integer division has no implementation-defined
  behavior and thus does not need this treatment.
! 
  
  
  
  
  <hr>
! <h3><a name="584"></a>584. missing int pow(int,int) functionality</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-06-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! There is no pow() function for any integral type.
  </p>
  
  
--- 13127,13160 ----
  Add to 26.7 [lib.c.math] paragraph 8:
  </p>
  
! <blockquote><pre>
! struct udiv_t div(unsigned, unsigned);
  struct uldiv_t div(unsigned long, unsigned long);
  struct ulldiv_t div(unsigned long long, unsigned long long);
  </pre></blockquote>
  
  
  
! <p><b>Rationale:</b></p><p>
  Toronto:  C99 does not have these unsigned versions because
  the signed version exist just to define the implementation-defined behavior
  of signed integer division.  Unsigned integer division has no implementation-defined
  behavior and thus does not need this treatment.
! </p>
  
  
  
  
  <hr>
! <h3><a name="584"></a>584. missing int <tt>pow(int,int)</tt> functionality</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-06-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! There is no <tt>pow()</tt> function for any integral type.
  </p>
  
  
*************** There is no pow() function for any integ
*** 14829,14853 ****
  Add something like:
  </p>
  
! <blockquote><pre>template&lt; typename T&gt;
  T power( T x, int n );
  // requires: n &gt;=0
  </pre></blockquote>
  
  
! <p><b>Rationale:</b></p>
! Toronto:  We already have double pow(integral, integral) from 26.8 [c.math] p11.
! 
  
  
  
  
  <hr>
  <h3><a name="585"></a>585. facet error reporting</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor, Paolo Carlini <b>Opened:</b> 2006-06-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 13163,13188 ----
  Add something like:
  </p>
  
! <blockquote><pre>
! template&lt; typename T&gt;
  T power( T x, int n );
  // requires: n &gt;=0
  </pre></blockquote>
  
  
! <p><b>Rationale:</b></p><p>
! Toronto:  We already have <tt>double pow(<i>integral</i>, <i>integral</i>)</tt> from 26.8 [c.math] p11.
! </p>
  
  
  
  
  <hr>
  <h3><a name="585"></a>585. facet error reporting</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor, Paolo Carlini <b>Opened:</b> 2006-06-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** with<code>ios_base::eofbit | ios_base::f
*** 14907,14915 ****
  ]</i></p>
  
  
! <blockquote>
  Move to NAD.
! </blockquote>
  
      
  
--- 13242,13250 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to NAD.
! </p></blockquote>
  
      
  
*************** Proposed Disposition: Open
*** 14975,14983 ****
  
  <hr>
  <h3><a name="587"></a>587. iststream ctor missing description</h3>
! <p><b>Section:</b> D.9.2.1 [depr.istrstream.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 13310,13318 ----
  
  <hr>
  <h3><a name="587"></a>587. iststream ctor missing description</h3>
! <p><b>Section:</b> D.7.2.1 [depr.istrstream.cons] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** post Oxford: Noted that it is already fi
*** 15007,15017 ****
  
  
  <hr>
! <h3><a name="588"></a>588. requirements on zero sized tr1::arrays and other details</h3>
! <p><b>Section:</b> 23.3.1 [array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gennaro Prota <b>Opened:</b> 2006-07-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The wording used for section 23.2.1 [lib.array] seems to be subtly
--- 13342,13353 ----
  
  
  <hr>
! <h3><a name="588"></a>588. requirements on zero sized <tt>tr1::arrays</tt> and other details</h3>
! <p><b>Section:</b> 23.3.2 [array] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gennaro Prota <b>Opened:</b> 2006-07-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The wording used for section 23.2.1 [lib.array] seems to be subtly
*************** end() == unique value."
*** 15035,15041 ****
  What does "unique" mean in this context? Let's consider the following
  possible implementations, all relying on a partial specialization:
  </p>
! <blockquote><pre>a)
      template&lt; typename T &gt;
      class array&lt; T, 0 &gt; {
      
--- 13371,13378 ----
  What does "unique" mean in this context? Let's consider the following
  possible implementations, all relying on a partial specialization:
  </p>
! <blockquote><pre>
! a)
      template&lt; typename T &gt;
      class array&lt; T, 0 &gt; {
      
*************** had to be unique to the specific array o
*** 15053,15059 ****
  store any T. Note that, besides relying on a reinterpret_cast, has
  (more than potential) alignment problems.
  </p>
! <blockquote><pre>b)
      template&lt; typename T &gt;
      class array&lt; T, 0 &gt; {
      
--- 13390,13397 ----
  store any T. Note that, besides relying on a reinterpret_cast, has
  (more than potential) alignment problems.
  </p>
! <blockquote><pre>
! b)
      template&lt; typename T &gt;
      class array&lt; T, 0 &gt; {
      
*************** mistakenly provide an initializer list w
*** 15073,15079 ****
  <p>
  A slight variant could be returning *the* null pointer of type T
  </p>
! <blockquote><pre>    return static_cast&lt;T*&gt;(0);
  </pre></blockquote>
  <p>
  In this case the value would be unique to the type array&lt;T, 0&gt; but not
--- 13411,13418 ----
  <p>
  A slight variant could be returning *the* null pointer of type T
  </p>
! <blockquote><pre>
!     return static_cast&lt;T*&gt;(0);
  </pre></blockquote>
  <p>
  In this case the value would be unique to the type array&lt;T, 0&gt; but not
*************** d) to avoid storing a T *directly* while
*** 15093,15104 ****
  to use a one-element initializer list a non-aggregate nested class
  could be defined
  </p>
! <blockquote><pre>    struct holder { holder() {} T t; } h;
  </pre></blockquote>
  <p>
  and then begin be defined as
  </p>
! <blockquote><pre> iterator begin() { return &amp;h.t; }
  </pre></blockquote>
  <p>
  But then, it's arguable whether the array stores a T or not.
--- 13432,13445 ----
  to use a one-element initializer list a non-aggregate nested class
  could be defined
  </p>
! <blockquote><pre>
!     struct holder { holder() {} T t; } h;
  </pre></blockquote>
  <p>
  and then begin be defined as
  </p>
! <blockquote><pre>
!  iterator begin() { return &amp;h.t; }
  </pre></blockquote>
  <p>
  But then, it's arguable whether the array stores a T or not.
*************** which, again, doesn't seem to consider f
*** 15147,15173 ****
  
  
  <blockquote>
! <ol type="a">
  <li>
  <p>
  star bullet 1 ("what's the effect of calling <tt>assign(T&amp;)</tt> on a
  zero-sized array?[..]");
  </p>
! <blockquote>
  <tt>assign</tt> has been renamed to <tt>fill</tt> and the semantic of <tt>fill</tt> is now
  defined in terms of
  the free algorithm <tt>fill_n</tt>, which is well-defined for this situation.
! </blockquote>
  </li>
  <li>
  <p>
  star bullet 3 ("it would be desiderable to have a static const data
  member..."):
  </p>
! <blockquote>
! It seems that <tt>tuple_size&lt;array&lt;T, N&gt; &gt;::value</tt> as of 23.3.1.8 [array.tuple] does
  provide this functionality now.
! </blockquote>
  </li>
  </ol>
  </blockquote>
--- 13488,13514 ----
  
  
  <blockquote>
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
  star bullet 1 ("what's the effect of calling <tt>assign(T&amp;)</tt> on a
  zero-sized array?[..]");
  </p>
! <blockquote><p>
  <tt>assign</tt> has been renamed to <tt>fill</tt> and the semantic of <tt>fill</tt> is now
  defined in terms of
  the free algorithm <tt>fill_n</tt>, which is well-defined for this situation.
! </p></blockquote>
  </li>
  <li>
  <p>
  star bullet 3 ("it would be desiderable to have a static const data
  member..."):
  </p>
! <blockquote><p>
! It seems that <tt>tuple_size&lt;array&lt;T, N&gt; &gt;::value</tt> as of 23.3.2.9 [array.tuple] does
  provide this functionality now.
! </p></blockquote>
  </li>
  </ol>
  </blockquote>
*************** Moved to Tentatively NAD.
*** 15191,15199 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD.
! </blockquote>
  
  
  
--- 13532,13540 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD.
! </p></blockquote>
  
  
  
*************** requirements? Alisdair will prepare a pa
*** 15214,15223 ****
  
  <hr>
  <h3><a name="590"></a>590. Type traits implementation latitude should be removed for C++0x</h3>
! <p><b>Section:</b> 20.7 [meta], TR1 4.9 [tr.meta.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-08-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  20.4.9 [lib.meta.req], Implementation requirements, provides latitude for type
--- 13555,13565 ----
  
  <hr>
  <h3><a name="590"></a>590. Type traits implementation latitude should be removed for C++0x</h3>
! <p><b>Section:</b> 20.10 [meta], TR1 4.9 [tr.meta.req] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2006-08-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  20.4.9 [lib.meta.req], Implementation requirements, provides latitude for type
*************** current working draft.
*** 15255,15264 ****
  
  <hr>
  <h3><a name="591"></a>591. Misleading "built-in</h3>
! <p><b>Section:</b> 18.3.1.2 [numeric.limits.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> whyglinux <b>Opened:</b> 2006-08-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numeric.limits.members">issues</a> in [numeric.limits.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  18.2.1.2 numeric_limits members [lib.numeric.limits.members]
--- 13597,13606 ----
  
  <hr>
  <h3><a name="591"></a>591. Misleading "built-in</h3>
! <p><b>Section:</b> 18.3.2.4 [numeric.limits.members] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> whyglinux <b>Opened:</b> 2006-08-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numeric.limits.members">issues</a> in [numeric.limits.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  18.2.1.2 numeric_limits members [lib.numeric.limits.members]
*************** Recommend NAD / Editorial.  The proposed
*** 15323,15333 ****
  
  
  <hr>
! <h3><a name="592"></a>592. Incorrect treatment of rdbuf()-&gt;close() return type</h3>
! <p><b>Section:</b> 27.9.1.9 [ifstream.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Christopher Kohlhoff <b>Opened:</b> 2006-08-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ifstream.members">issues</a> in [ifstream.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I just spotted a minor problem in 27.8.1.7
--- 13665,13675 ----
  
  
  <hr>
! <h3><a name="592"></a>592. Incorrect treatment of rdbuf()->close() return type</h3>
! <p><b>Section:</b> 27.9.1.9 [ifstream.members] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Christopher Kohlhoff <b>Opened:</b> 2006-08-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ifstream.members">issues</a> in [ifstream.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I just spotted a minor problem in 27.8.1.7
*************** I just spotted a minor problem in 27.8.1
*** 15335,15341 ****
  [lib.fstream.members] para 4. In both places it says:
  </p>
  <blockquote>
! <pre>void close();
  </pre>
  <p>
  Effects: Calls rdbuf()-&gt;close() and, if that function returns false, ...
--- 13677,13684 ----
  [lib.fstream.members] para 4. In both places it says:
  </p>
  <blockquote>
! <pre>
! void close();
  </pre>
  <p>
  Effects: Calls rdbuf()-&gt;close() and, if that function returns false, ...
*************** Kona (2007): Proposed Disposition: NAD,
*** 15384,15393 ****
  
  <hr>
  <h3><a name="597"></a>597. Decimal: The notion of 'promotion' cannot be emulated by user-defined types.</h3>
! <p><b>Section:</b> TRDecimal 3.2 [trdec.types.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daveed Vandevoorde <b>Opened:</b> 2006-04-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#trdec.types.types">issues</a> in [trdec.types.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In a private email, Daveed writes:
--- 13727,13736 ----
  
  <hr>
  <h3><a name="597"></a>597. Decimal: The notion of 'promotion' cannot be emulated by user-defined types.</h3>
! <p><b>Section:</b> TRDecimal 3.2 [trdec.types.types] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daveed Vandevoorde <b>Opened:</b> 2006-04-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#trdec.types.types">issues</a> in [trdec.types.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In a private email, Daveed writes:
*************** Here is an example:
*** 15404,15409 ****
--- 13747,13753 ----
  </p>
  </blockquote>
  <pre>
+ 
           struct S {
             S(_Decimal32 const&amp;);  // Converting constructor
           };
*************** Robert comments:
*** 15435,15441 ****
  <p>
  In general, a library of arithmetic types cannot exactly emulate the behavior of the intrinsic numeric types.  There are several ways to tell whether an implementation of the decimal types uses compiler intrinisics or a library.  For example:
  </p>
! <pre>                 _Decimal32 d1;
                   d1.operator+=(5);  // If d1 is a builtin type, this won't compile.
  </pre>
  <p>
--- 13779,13786 ----
  <p>
  In general, a library of arithmetic types cannot exactly emulate the behavior of the intrinsic numeric types.  There are several ways to tell whether an implementation of the decimal types uses compiler intrinisics or a library.  For example:
  </p>
! <pre>
!                  _Decimal32 d1;
                   d1.operator+=(5);  // If d1 is a builtin type, this won't compile.
  </pre>
  <p>
*************** Move to NAD.
*** 15480,15489 ****
  
  <hr>
  <h3><a name="606"></a>606. Decimal: allow narrowing conversions</h3>
! <p><b>Section:</b> TRDecimal 3.2 [trdec.types.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#trdec.types.types">issues</a> in [trdec.types.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In c++std-lib-17205, Martin writes:
--- 13825,13834 ----
  
  <hr>
  <h3><a name="606"></a>606. Decimal: allow narrowing conversions</h3>
! <p><b>Section:</b> TRDecimal 3.2 [trdec.types.types] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#trdec.types.types">issues</a> in [trdec.types.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In c++std-lib-17205, Martin writes:
*************** In c++std-lib-17205, Martin writes:
*** 15491,15497 ****
  <blockquote><p>
  ...was it a deliberate design choice to make narrowing assignments ill-formed while permitting narrowing compound assignments?  For instance:
  </p></blockquote>
! <pre>      decimal32 d32;
        decimal64 d64;
  
        d32 = 64;     // error
--- 13836,13843 ----
  <blockquote><p>
  ...was it a deliberate design choice to make narrowing assignments ill-formed while permitting narrowing compound assignments?  For instance:
  </p></blockquote>
! <pre>
!       decimal32 d32;
        decimal64 d64;
  
        d32 = 64;     // error
*************** Move to NAD.
*** 15524,15530 ****
  <p>
  1.  In "3.2.2 Class <code>decimal32</code>" synopsis, remove the <code>explicit</code> specifier from the narrowing conversions:
  </p>
! <pre>                // <i>3.2.2.2 conversion from floating-point type:</i>
                  <del>explicit</del> decimal32(decimal64 <i>d64</i>);
                  <del>explicit</del> decimal32(decimal128 <i>d128</i>);
  </pre>
--- 13870,13877 ----
  <p>
  1.  In "3.2.2 Class <code>decimal32</code>" synopsis, remove the <code>explicit</code> specifier from the narrowing conversions:
  </p>
! <pre>
!                 // <i>3.2.2.2 conversion from floating-point type:</i>
                  <del>explicit</del> decimal32(decimal64 <i>d64</i>);
                  <del>explicit</del> decimal32(decimal128 <i>d128</i>);
  </pre>
*************** Move to NAD.
*** 15534,15540 ****
  <p>
  3.  In "3.2.3 Class <code>decimal64</code>" synopsis, remove the <code>explicit</code> specifier from the narrowing conversion:
  </p>
! <pre>                // <i>3.2.3.2 conversion from floating-point type:</i>
                  <del>explicit</del> decimal64(decimal128 <i>d128</i>);
  </pre>
  <p>
--- 13881,13888 ----
  <p>
  3.  In "3.2.3 Class <code>decimal64</code>" synopsis, remove the <code>explicit</code> specifier from the narrowing conversion:
  </p>
! <pre>
!                 // <i>3.2.3.2 conversion from floating-point type:</i>
                  <del>explicit</del> decimal64(decimal128 <i>d128</i>);
  </pre>
  <p>
*************** Redmond: We prefer explicit conversions
*** 15551,15561 ****
  
  
  <hr>
! <h3><a name="614"></a>614. std::string allocator requirements still inconsistent</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-12-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This is based on N2134, where 21.3.1/2 states:
--- 13899,13910 ----
  
  
  <hr>
! <h3><a name="614"></a>614. <tt>std::string</tt> allocator requirements still inconsistent</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-12-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This is based on N2134, where 21.3.1/2 states:
*************** object."
*** 15567,15573 ****
  <p>
  Section 21.3.2/1 lists two constructors:
  </p>
! <blockquote><pre>basic_string(const basic_string&lt;charT,traits,Allocator&gt;&amp; str );
  
  basic_string(const basic_string&lt;charT,traits,Allocator&gt;&amp; str ,
               size_type pos , size_type n = npos,
--- 13916,13923 ----
  <p>
  Section 21.3.2/1 lists two constructors:
  </p>
! <blockquote><pre>
! basic_string(const basic_string&lt;charT,traits,Allocator&gt;&amp; str );
  
  basic_string(const basic_string&lt;charT,traits,Allocator&gt;&amp; str ,
               size_type pos , size_type n = npos,
*************** rules (substr, operator+, etc.).  Howard
*** 15595,15610 ****
  <p><i>[
  Bo adds:  The new container constructor which takes only a <tt>size_type</tt> is not
  consistent with 23.2 [container.requirements], p9 which says in part:
  
! </i></p><blockquote><i>
  All other constructors for these container types take an
  <tt>Allocator&amp;</tt> argument (20.1.2), an allocator whose value type
  is the same as the container's value type. A copy of this argument is
  used for any memory allocation performed, by these constructors and by
  all member functions, during the lifetime of each container object.
! </i></blockquote><i>
! ]</i><p></p>
! 
  
  <p><i>[
  post Bellevue: We re-confirm that the issue is real. Pablo will provide wording.
--- 13945,13960 ----
  <p><i>[
  Bo adds:  The new container constructor which takes only a <tt>size_type</tt> is not
  consistent with 23.2 [container.requirements], p9 which says in part:
+ ]</i></p>
  
! 
! <blockquote><p>
  All other constructors for these container types take an
  <tt>Allocator&amp;</tt> argument (20.1.2), an allocator whose value type
  is the same as the container's value type. A copy of this argument is
  used for any memory allocation performed, by these constructors and by
  all member functions, during the lifetime of each container object.
! </p></blockquote>
  
  <p><i>[
  post Bellevue: We re-confirm that the issue is real. Pablo will provide wording.
*************** post Bellevue: We re-confirm that the is
*** 15616,15624 ****
  ]</i></p>
  
  
! <blockquote>
  Move to NAD.
! </blockquote>
  
  
  
--- 13966,13974 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to NAD.
! </p></blockquote>
  
  
  
*************** Move to NAD.
*** 15632,15641 ****
  
  <hr>
  <h3><a name="615"></a>615. Inconsistencies in Section 21.4</h3>
! <p><b>Section:</b> 21.7 [c.strings] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-12-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.strings">issues</a> in [c.strings].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the current draft N2134, 21.4/1 says
--- 13982,13992 ----
  
  <hr>
  <h3><a name="615"></a>615. Inconsistencies in Section 21.4</h3>
! <p><b>Section:</b> 21.8 [c.strings] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-12-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.strings">active issues</a> in [c.strings].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.strings">issues</a> in [c.strings].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the current draft N2134, 21.4/1 says
*************** Recommend NAD, editorial.  Send to Pete.
*** 15670,15697 ****
  
  
  <hr>
! <h3><a name="617"></a>617. std::array is a sequence that doesn't satisfy the sequence requirements?</h3>
! <p><b>Section:</b> 23.3.1 [array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-12-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>&lt;array&gt;</tt> header is given under 23.3 [sequences].
! 23.3.1 [array]/paragraph 3 says:
  </p>
  <blockquote><p>
  "Unless otherwise specified, all array operations are as described in
  23.2 [container.requirements]".
  </p></blockquote>
  <p>
! However, array isn't mentioned at all in section 23.2 [container.requirements].
  In particular, Table 82 "Sequence requirements" lists several operations (insert, erase, clear) 
! that std::array does not have in 23.3.1 [array].
  </p>
  <p>
  Also, Table 83 "Optional sequence operations" lists several operations that 
! std::array does have, but array isn't mentioned.
  </p>
  
  <p><i>[
--- 14021,14049 ----
  
  
  <hr>
! <h3><a name="617"></a>617. <tt>std::array</tt> is a sequence that doesn't satisfy the sequence requirements?</h3>
! <p><b>Section:</b> 23.3.2 [array] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-12-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>&lt;array&gt;</tt> header is given under 23.3 [sequences].
! 23.3.2 [array]/paragraph 3 says:
  </p>
  <blockquote><p>
  "Unless otherwise specified, all array operations are as described in
  23.2 [container.requirements]".
  </p></blockquote>
  <p>
! However, <tt>array</tt> isn't mentioned at all in section 23.2 [container.requirements].
  In particular, Table 82 "Sequence requirements" lists several operations (insert, erase, clear) 
! that <tt>std::array</tt> does not have in 23.3.2 [array].
  </p>
  <p>
  Also, Table 83 "Optional sequence operations" lists several operations that 
! <tt>std::array</tt> does have, but array isn't mentioned.
  </p>
  
  <p><i>[
*************** std::array does have, but array isn't me
*** 15702,15708 ****
  <blockquote>
  <p>
  The real issue seems to be different than what is described here.
! Non-normative text says that std::array is a sequence container, but
  there is disagreement about what that really means. There are two
  possible interpretations:
  </p>
--- 14054,14060 ----
  <blockquote>
  <p>
  The real issue seems to be different than what is described here.
! Non-normative text says that <tt>std::array</tt> is a sequence container, but
  there is disagreement about what that really means. There are two
  possible interpretations:
  </p>
*************** Move to Tentatively NAD.
*** 15724,15730 ****
  </blockquote>
  
  <p><i>[
! 2009-07-15 Loïc Joly adds:
  ]</i></p>
  
  
--- 14076,14082 ----
  </blockquote>
  
  <p><i>[
! 2009-07-15 Lo&iuml;c Joly adds:
  ]</i></p>
  
  
*************** Say that array is a container, that in a
*** 15746,15771 ****
  sequence requirements, as described in the array section:
  </p>
  
! <blockquote>
  The library provides <del>five</del> <ins>three</ins> basic kinds of sequence containers: <del><tt>array</tt></del>,
  <tt>vector</tt>, 
  <del><tt>forward_list</tt></del>, <tt>list</tt>, and <tt>deque</tt>. <ins>In addition, <tt>array</tt>
  and <tt>forward_list</tt> follows some of the requirements 
  of sequences, as described in their respective sections.</ins>
! </blockquote>
  
  </blockquote>
  
  <p>
  Proposed resolution 2 (most descriptive description, no full wording provided): 
  </p>
! <blockquote>
  Introduce the notion of a Fixed Size Sequence, with it requirement table
  that would be a subset of the current Sequence container. array would be
  the only Fixed Size Sequence (but dynarray is in the queue for TR2).
  Sequence requirements would now be requirements in addition to Fixed
  Size Sequence requirements (it is currently in addition to container).
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 14098,14123 ----
  sequence requirements, as described in the array section:
  </p>
  
! <blockquote><p>
  The library provides <del>five</del> <ins>three</ins> basic kinds of sequence containers: <del><tt>array</tt></del>,
  <tt>vector</tt>, 
  <del><tt>forward_list</tt></del>, <tt>list</tt>, and <tt>deque</tt>. <ins>In addition, <tt>array</tt>
  and <tt>forward_list</tt> follows some of the requirements 
  of sequences, as described in their respective sections.</ins>
! </p></blockquote>
  
  </blockquote>
  
  <p>
  Proposed resolution 2 (most descriptive description, no full wording provided): 
  </p>
! <blockquote><p>
  Introduce the notion of a Fixed Size Sequence, with it requirement table
  that would be a subset of the current Sequence container. array would be
  the only Fixed Size Sequence (but dynarray is in the queue for TR2).
  Sequence requirements would now be requirements in addition to Fixed
  Size Sequence requirements (it is currently in addition to container).
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** Size Sequence requirements (it is curren
*** 15773,15792 ****
  ]</i></p>
  
  
! <blockquote>
  Move to NAD Editorial
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  This will require a lot of reorganization. Editor doesn't think this is really
  an issue, since the description of array can be considered as overriding
  what's specified about sequences. Move to NAD.
! </blockquote>
  
  
  
--- 14125,14144 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to NAD Editorial
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  This will require a lot of reorganization. Editor doesn't think this is really
  an issue, since the description of array can be considered as overriding
  what's specified about sequences. Move to NAD.
! </p></blockquote>
  
  
  
*************** what's specified about sequences. Move t
*** 15800,15809 ****
  
  <hr>
  <h3><a name="626"></a>626. new <i>Remark</i> clauses not documented</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 14152,14161 ----
  
  <hr>
  <h3><a name="626"></a>626. new <i>Remark</i> clauses not documented</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** Bellevue: Already resolved in current wo
*** 15841,15850 ****
  
  <hr>
  <h3><a name="627"></a>627. Low memory and exceptions</h3>
! <p><b>Section:</b> 18.6.1.1 [new.delete.single] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2007-01-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#new.delete.single">issues</a> in [new.delete.single].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I recognize the need for nothrow guarantees in the exception reporting
--- 14193,14202 ----
  
  <hr>
  <h3><a name="627"></a>627. Low memory and exceptions</h3>
! <p><b>Section:</b> 18.6.1.1 [new.delete.single] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2007-01-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete.single">issues</a> in [new.delete.single].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I recognize the need for nothrow guarantees in the exception reporting
*************** its resource limits", so no further esca
*** 15875,15884 ****
  
  <hr>
  <h3><a name="631"></a>631. conflicting requirements for <tt>BinaryPredicate</tt></h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2007-01-31 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The general requirements for <tt><tt>BinaryPredicate</tt></tt> (in 25 [algorithms]/8) contradict the implied specific requirements for
--- 14227,14237 ----
  
  <hr>
  <h3><a name="631"></a>631. conflicting requirements for <tt>BinaryPredicate</tt></h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2007-01-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#algorithms">active issues</a> in [algorithms].</p>
! <p><b>View all other</b> <a href="lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The general requirements for <tt><tt>BinaryPredicate</tt></tt> (in 25 [algorithms]/8) contradict the implied specific requirements for
*************** and <tt>upper_bound</tt> to work without
*** 15945,15957 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Review. The small problem with the "iterator type"
  will be fixed. The cited functions (<tt>lower_bound</tt>, <tt>uppwer_bound</tt>,
  <tt>equal_range</tt>) don't actually use <tt>BinaryPredicate</tt> , and where it is used,
  it is consistent with  [algorithm]/8, so the main complaint of the issue
  is moot.
! </blockquote>
  
  <p><i>[
  2010-01-16 Beman clarified wording.
--- 14298,14310 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Review. The small problem with the "iterator type"
  will be fixed. The cited functions (<tt>lower_bound</tt>, <tt>uppwer_bound</tt>,
  <tt>equal_range</tt>) don't actually use <tt>BinaryPredicate</tt> , and where it is used,
  it is consistent with  [algorithm]/8, so the main complaint of the issue
  is moot.
! </p></blockquote>
  
  <p><i>[
  2010-01-16 Beman clarified wording.
*************** Solved by
*** 15981,15987 ****
  
  <p>
  2010-01-31: The draft standard is well specified as is, and this specification
! is desired.  Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a> solve the remaining
  unclearness regarding the meaning of BinaryPredicate.
  </p>
  
--- 14334,14340 ----
  
  <p>
  2010-01-31: The draft standard is well specified as is, and this specification
! is desired.  Issues <a href="lwg-defects.html#556">556</a> and <a href="lwg-defects.html#870">870</a> solve the remaining
  unclearness regarding the meaning of BinaryPredicate.
  </p>
  
*************** not apply any non-constant function thro
*** 16012,16018 ****
  <ins>[<i>Note:</i> if the two types are not identical, and neither is
  convertable to the other, this may require that the <tt>BinaryPredicate</tt> be
  a functional object with two overloaded <tt>operator()()</tt> functions.
! — <i>end note</i>]</ins>
  </p>
  
  </blockquote>
--- 14365,14371 ----
  <ins>[<i>Note:</i> if the two types are not identical, and neither is
  convertable to the other, this may require that the <tt>BinaryPredicate</tt> be
  a functional object with two overloaded <tt>operator()()</tt> functions.
! &mdash; <i>end note</i>]</ins>
  </p>
  
  </blockquote>
*************** a functional object with two overloaded
*** 16023,16033 ****
  
  
  <hr>
! <h3><a name="632"></a>632. Time complexity of size() for std::set</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Lionel B <b>Opened:</b> 2007-02-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A recent news group discussion:
--- 14376,14387 ----
  
  
  <hr>
! <h3><a name="632"></a>632. Time complexity of <tt>size()</tt> for <tt>std::set</tt></h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Lionel B <b>Opened:</b> 2007-02-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A recent news group discussion:
*************** A recent news group discussion:
*** 16035,16046 ****
  <blockquote>
  <p>
  Anyone know if the Standard has anything to say about the time complexity
! of size() for std::set?   I need to access a set's size (/not/ to know if it is empty!) heavily
! during an algorithm and was thus wondering whether I'd be better off
! tracking the size "manually" or whether that'd be pointless.
  </p>
  <p>
! That would be pointless. size() is O(1).
  </p>
  <p>
  Nit: the standard says "should" have constant time. Implementations may take
--- 14389,14400 ----
  <blockquote>
  <p>
  Anyone know if the Standard has anything to say about the time complexity
! of <tt>size()</tt> for <tt>std::set</tt>?   I need to access a set's size (<em>not</em> 
! to know if it is empty!) heavily during an algorithm and was thus wondering 
! whether I'd be better off tracking the size "manually" or whether that'd be pointless.
  </p>
  <p>
! That would be pointless. <tt>size()</tt> is O(1).
  </p>
  <p>
  Nit: the standard says "should" have constant time. Implementations may take
*************** Bellevue:
*** 16083,16113 ****
  ]</i></p>
  
  
! <blockquote>
  Mandating O(1) size will not fly, too many implementations would be
  invalidated. Alan to provide wording that toughens wording, but that
  does not absolutely mandate O(1).
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We observed that the wording "should" (in note a) has no effect.
  Howard prefers that O(1) size be mandated.
  It is not clear that this issue can be resolved to everyone's satisfaction,
  but Alan will provide wording nonetheless.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Fixed by paper N2923.
! </blockquote>
  
  
  
--- 14437,14467 ----
  ]</i></p>
  
  
! <blockquote><p>
  Mandating O(1) size will not fly, too many implementations would be
  invalidated. Alan to provide wording that toughens wording, but that
  does not absolutely mandate O(1).
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We observed that the wording "should" (in note a) has no effect.
  Howard prefers that O(1) size be mandated.
  It is not clear that this issue can be resolved to everyone's satisfaction,
  but Alan will provide wording nonetheless.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Fixed by paper N2923.
! </p></blockquote>
  
  
  
*************** Fixed by paper N2923.
*** 16121,16132 ****
  
  <hr>
  <h3><a name="633"></a>633. Return clause mentions undefined "type()"</h3>
! <p><b>Section:</b> 20.8.14.2.5 [func.wrap.func.targ] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-02-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.8.14.2.5 [func.wrap.func.targ], p4 says:
  </p>
  <blockquote><p>
  <i>Returns:</i> If <tt>type() == typeid(T)</tt>, a pointer to the stored
--- 14475,14486 ----
  
  <hr>
  <h3><a name="633"></a>633. Return clause mentions undefined "type()"</h3>
! <p><b>Section:</b> 20.9.12.2.5 [func.wrap.func.targ] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-02-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.9.12.2.5 [func.wrap.func.targ], p4 says:
  </p>
  <blockquote><p>
  <i>Returns:</i> If <tt>type() == typeid(T)</tt>, a pointer to the stored
*************** function <tt>type()</tt> in class templa
*** 16142,16148 ****
  <li>
  Assuming that <tt>type</tt> should have been <tt>target_type()</tt>,
  this description would lead to false results, if <tt>T = <i>cv</i>
! void</tt> due to returns clause 20.8.14.2.5 [func.wrap.func.targ], p1.
  </li>
  </ol>
  
--- 14496,14502 ----
  <li>
  Assuming that <tt>type</tt> should have been <tt>target_type()</tt>,
  this description would lead to false results, if <tt>T = <i>cv</i>
! void</tt> due to returns clause 20.9.12.2.5 [func.wrap.func.targ], p1.
  </li>
  </ol>
  
*************** void</tt> due to returns clause 20.8.14.
*** 16150,16156 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.14.2.5 [func.wrap.func.targ], p4:
  </p>
  
  <blockquote><p>
--- 14504,14510 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.12.2.5 [func.wrap.func.targ], p4:
  </p>
  
  <blockquote><p>
*************** Pete: Agreed. It's editorial, so I'll fi
*** 16171,16180 ****
  
  <hr>
  <h3><a name="636"></a>636. 26.5.2.3 valarray::operator[]</h3>
! <p><b>Section:</b> 26.6.2.3 [valarray.access] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-02-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.access">issues</a> in [valarray.access].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The signature of the const operator[] has been changed to return a const 
--- 14525,14534 ----
  
  <hr>
  <h3><a name="636"></a>636. 26.5.2.3 valarray::operator[]</h3>
! <p><b>Section:</b> 26.6.2.4 [valarray.access] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-02-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.access">issues</a> in [valarray.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The signature of the const operator[] has been changed to return a const 
*************** Pete recommends editorial fix.
*** 16200,16209 ****
  
  <hr>
  <h3><a name="637"></a>637. [c.math]/10 inconsistent return values</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-02-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  26.8 [c.math], paragraph 10 has long lists of added signatures for float and long double 
--- 14554,14564 ----
  
  <hr>
  <h3><a name="637"></a>637. [c.math]/10 inconsistent return values</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-02-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  26.8 [c.math], paragraph 10 has long lists of added signatures for float and long double 
*************** overload.
*** 16218,16224 ****
  Change 26.8 [c.math], paragraph 10,
  </p>
  
! <blockquote><pre><del>float</del> <ins>int</ins> ilogb(float);
  <del>float</del> <ins>long</ins> lrint(float);
  <del>float</del> <ins>long</ins> lround(float);
  <del>float</del> <ins>long long</ins> llrint(float);
--- 14573,14580 ----
  Change 26.8 [c.math], paragraph 10,
  </p>
  
! <blockquote><pre>
! <del>float</del> <ins>int</ins> ilogb(float);
  <del>float</del> <ins>long</ins> lrint(float);
  <del>float</del> <ins>long</ins> lround(float);
  <del>float</del> <ins>long long</ins> llrint(float);
*************** Change 26.8 [c.math], paragraph 10,
*** 16237,16250 ****
  
  <hr>
  <h3><a name="639"></a>639. Still problems with exceptions during streambuf IO</h3>
! <p><b>Section:</b> 27.7.1.2.3 [istream::extractors], 27.7.2.6.3 [ostream.inserters] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-02-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! There already exist two active DR's for the wording of 27.7.1.2.3 [istream::extractors]/13
! from 14882:2003(E), namely <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#64">64</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#413">413</a>.
  </p>
  
  <p>
--- 14593,14606 ----
  
  <hr>
  <h3><a name="639"></a>639. Still problems with exceptions during streambuf IO</h3>
! <p><b>Section:</b> 27.7.2.2.3 [istream::extractors], 27.7.3.6.3 [ostream.inserters] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-02-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! There already exist two active DR's for the wording of 27.7.2.2.3 [istream::extractors]/13
! from 14882:2003(E), namely <a href="lwg-defects.html#64">64</a> and <a href="lwg-defects.html#413">413</a>.
  </p>
  
  <p>
*************** Is this behaviour by design?
*** 16293,16299 ****
  </p>
  
  <p>
! I would like to add that its output counterpart in 27.7.2.6.3 [ostream.inserters]/7-9
  (also
  N2134) does not demonstrate such an exception-loss-behaviour.
  On the other side, I wonder concerning several subtle differences
--- 14649,14655 ----
  </p>
  
  <p>
! I would like to add that its output counterpart in 27.7.3.6.3 [ostream.inserters]/7-9
  (also
  N2134) does not demonstrate such an exception-loss-behaviour.
  On the other side, I wonder concerning several subtle differences
*************** compared to input::
*** 16309,16315 ****
  
  <p>
  Note that there is nothing mentioned which would imply that such
! an exception will be caught compared to 27.7.1.2.3 [istream::extractors]/14.
  </p>
  
  <p>
--- 14665,14671 ----
  
  <p>
  Note that there is nothing mentioned which would imply that such
! an exception will be caught compared to 27.7.2.2.3 [istream::extractors]/14.
  </p>
  
  <p>
*************** imply that such an exception *should* be
*** 16334,16340 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! (a) In 27.7.1.2.3 [istream::extractors]/15 (N2134) change the sentence
  </p>
  
  <blockquote><p>
--- 14690,14696 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! (a) In 27.7.2.2.3 [istream::extractors]/15 (N2134) change the sentence
  </p>
  
  <blockquote><p>
*************** caught exception is rethrown.
*** 16349,16355 ****
  </p></blockquote>
  
  <p>
! (b) In 27.7.2.6.3 [ostream.inserters]/8 (N2134) change the sentence:
  </p>
  
  <blockquote>
--- 14705,14711 ----
  </p></blockquote>
  
  <p>
! (b) In 27.7.3.6.3 [ostream.inserters]/8 (N2134) change the sentence:
  </p>
  
  <blockquote>
*************** case the exception is caught)</ins>.</li
*** 16368,16406 ****
  
  
  
! <p><b>Rationale:</b></p>
  This extractor is described as a formatted input function so the
  exception behavior is already specified. There is additional behavior
  described in this section that applies to the case in which failbit is
  set. This doesn't contradict the usual exception behavior for formatted
  input functions because that applies to the case in which badbit is set.
! 
  
  
  
  
  <hr>
  <h3><a name="641"></a>641. Editorial fix for 27.6.4 (N2134)</h3>
! <p><b>Section:</b> 27.7.4 [ext.manip] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-02-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ext.manip">issues</a> in [ext.manip].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The function <tt>f</tt> in para 4 (27.7.4 [ext.manip]) references an unknown <tt>strm</tt>
  in the following line:
  </p>
  
! <blockquote><pre>mg.get(Iter(str.rdbuf()), Iter(), intl, strm, err, mon);
  </pre></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 27.7.4 [ext.manip], p4:
  </p>
  
! <blockquote><pre>mg.get(Iter(str.rdbuf()), Iter(), intl, str<del>m</del>, err, mon);
  </pre></blockquote>
  
  <p><i>[
--- 14724,14764 ----
  
  
  
! <p><b>Rationale:</b></p><p>
  This extractor is described as a formatted input function so the
  exception behavior is already specified. There is additional behavior
  described in this section that applies to the case in which failbit is
  set. This doesn't contradict the usual exception behavior for formatted
  input functions because that applies to the case in which badbit is set.
! </p>
  
  
  
  
  <hr>
  <h3><a name="641"></a>641. Editorial fix for 27.6.4 (N2134)</h3>
! <p><b>Section:</b> 27.7.5 [ext.manip] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-02-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ext.manip">issues</a> in [ext.manip].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The function <tt>f</tt> in para 4 (27.7.5 [ext.manip]) references an unknown <tt>strm</tt>
  in the following line:
  </p>
  
! <blockquote><pre>
! mg.get(Iter(str.rdbuf()), Iter(), intl, strm, err, mon);
  </pre></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 27.7.5 [ext.manip], p4:
  </p>
  
! <blockquote><pre>
! mg.get(Iter(str.rdbuf()), Iter(), intl, str<del>m</del>, err, mon);
  </pre></blockquote>
  
  <p><i>[
*************** Oxford:  Editorial.
*** 16415,16429 ****
  
  <hr>
  <h3><a name="642"></a>642. Invalidated fstream footnotes in N2134</h3>
! <p><b>Section:</b> 27.9.1.9 [ifstream.members], 27.9.1.13 [ofstream.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-02-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ifstream.members">issues</a> in [ifstream.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard wording of N2134 has extended the 14882:2003(E)
  wording for the ifstream/ofstream/fstream open function to fix
! a long standing problem, see <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#409">409</a>.
  </p>
  
  <p>
--- 14773,14787 ----
  
  <hr>
  <h3><a name="642"></a>642. Invalidated fstream footnotes in N2134</h3>
! <p><b>Section:</b> 27.9.1.9 [ifstream.members], 27.9.1.13 [ofstream.members] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-02-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ifstream.members">issues</a> in [ifstream.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard wording of N2134 has extended the 14882:2003(E)
  wording for the ifstream/ofstream/fstream open function to fix
! a long standing problem, see <a href="lwg-defects.html#409">409</a>.
  </p>
  
  <p>
*************** In 27.9.1.13 [ofstream.members], remove
*** 16485,16501 ****
  
  <hr>
  <h3><a name="644"></a>644. Possible typos in 'function' description</h3>
! <p><b>Section:</b> 20.8.14.2 [func.wrap.func] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-02-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.8.14.2 [func.wrap.func]
  </p>
  <p>
  The note in paragraph 2 refers to 'undefined void operators', while the
! section declares a pair of operators returning bool.
  </p>
  
  <p><i>[
--- 14843,14860 ----
  
  <hr>
  <h3><a name="644"></a>644. Possible typos in 'function' description</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-02-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.9.12.2 [func.wrap.func]
  </p>
  <p>
  The note in paragraph 2 refers to 'undefined void operators', while the
! section declares a pair of operators returning <tt>bool</tt>.
  </p>
  
  <p><i>[
*************** Post-Sophia Antipolis:
*** 16503,16513 ****
  ]</i></p>
  
  
! <blockquote>
  Changed from Pending WP to Open.  This issue was voted to WP at the same time the operators were
  changed from private to deleted.  The two issues stepped on each other.  What do we want the return
  type of these deleted functions to be?
! </blockquote>
  
  <p><i>[
  2009-05-02 Daniel adds:
--- 14862,14872 ----
  ]</i></p>
  
  
! <blockquote><p>
  Changed from Pending WP to Open.  This issue was voted to WP at the same time the operators were
  changed from private to deleted.  The two issues stepped on each other.  What do we want the return
  type of these deleted functions to be?
! </p></blockquote>
  
  <p><i>[
  2009-05-02 Daniel adds:
*************** type of these deleted functions to be?
*** 16517,16525 ****
  <blockquote>
  <p>
  I suggest harmonizing this issue with similar classes. E.g. in
! 20.9.10.3 [util.smartptr.weak] <tt>bool</tt> return values for
  </p>
! <blockquote><pre>template &lt;class Y&gt; bool operator&lt;(weak_ptr&lt;Y&gt; const&amp;) const = delete;
  template &lt;class Y&gt; bool operator&lt;=(weak_ptr&lt;Y&gt; const&amp;) const = delete;
  template &lt;class Y&gt; bool operator&gt;(weak_ptr&lt;Y&gt; const&amp;) const = delete;
  template &lt;class Y&gt; bool operator&gt;=(weak_ptr&lt;Y&gt; const&amp;) const = delete;
--- 14876,14885 ----
  <blockquote>
  <p>
  I suggest harmonizing this issue with similar classes. E.g. in
! 20.8.2.3 [util.smartptr.weak] <tt>bool</tt> return values for
  </p>
! <blockquote><pre>
! template &lt;class Y&gt; bool operator&lt;(weak_ptr&lt;Y&gt; const&amp;) const = delete;
  template &lt;class Y&gt; bool operator&lt;=(weak_ptr&lt;Y&gt; const&amp;) const = delete;
  template &lt;class Y&gt; bool operator&gt;(weak_ptr&lt;Y&gt; const&amp;) const = delete;
  template &lt;class Y&gt; bool operator&gt;=(weak_ptr&lt;Y&gt; const&amp;) const = delete;
*************** are used and basically all <em>newer</em
*** 16530,16538 ****
  of type <tt>X</tt> use the canonical return type <tt>X&amp;</tt> instead of <tt>void</tt>. Since the note
  mentioned in the issue description has now already been changed to
  </p>
! <blockquote>
  deleted overloads close possible hole in the type system
! </blockquote>
  <p>
  it seems to be of even lesser need to perform the change. Therefore
  I recommend declaring the issue as NAD.
--- 14890,14898 ----
  of type <tt>X</tt> use the canonical return type <tt>X&amp;</tt> instead of <tt>void</tt>. Since the note
  mentioned in the issue description has now already been changed to
  </p>
! <blockquote><p>
  deleted overloads close possible hole in the type system
! </p></blockquote>
  <p>
  it seems to be of even lesser need to perform the change. Therefore
  I recommend declaring the issue as NAD.
*************** Move to NAD.
*** 16555,16576 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.14.2 [func.wrap.func]
  </p>
  
! <blockquote><pre>...
  private:
!    // 20.8.14.2 [func.wrap.func], undefined operators:
     template&lt;class Function2&gt; <del>bool</del> <ins>void</ins> operator==(const function&lt;Function2&gt;&amp;);
     template&lt;class Function2&gt; <del>bool</del> <ins>void</ins> operator!=(const function&lt;Function2&gt;&amp;);
  };
  </pre></blockquote>
  
  <p>
! Change 20.8.14.2 [func.wrap.func]
  </p>
  
! <blockquote><pre>template&lt;class Function2&gt; <del>bool</del> <ins>void</ins> operator==(const function&lt;Function2&gt;&amp;);
  template&lt;class Function2&gt; <del>bool</del> <ins>void</ins> operator!=(const function&lt;Function2&gt;&amp;);
  </pre></blockquote>
  
--- 14915,14938 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.12.2 [func.wrap.func]
  </p>
  
! <blockquote><pre>
! ...
  private:
!    // 20.9.12.2 [func.wrap.func], undefined operators:
     template&lt;class Function2&gt; <del>bool</del> <ins>void</ins> operator==(const function&lt;Function2&gt;&amp;);
     template&lt;class Function2&gt; <del>bool</del> <ins>void</ins> operator!=(const function&lt;Function2&gt;&amp;);
  };
  </pre></blockquote>
  
  <p>
! Change 20.9.12.2 [func.wrap.func]
  </p>
  
! <blockquote><pre>
! template&lt;class Function2&gt; <del>bool</del> <ins>void</ins> operator==(const function&lt;Function2&gt;&amp;);
  template&lt;class Function2&gt; <del>bool</del> <ins>void</ins> operator!=(const function&lt;Function2&gt;&amp;);
  </pre></blockquote>
  
*************** template&lt;class Function2&gt; <del>boo
*** 16580,16589 ****
  
  <hr>
  <h3><a name="645"></a>645. Missing members in match_results</h3>
! <p><b>Section:</b> 28.10 [re.results] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-02-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.results">issues</a> in [re.results].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to the description given in 28.10 [re.results]/2 the class template
--- 14942,14951 ----
  
  <hr>
  <h3><a name="645"></a>645. Missing members in match_results</h3>
! <p><b>Section:</b> 28.10 [re.results] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-02-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results">issues</a> in [re.results].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to the description given in 28.10 [re.results]/2 the class template
*************** missing operations:
*** 16599,16605 ****
  1) The members
  </p>
  
! <blockquote><pre>const_iterator rbegin() const;
  const_iterator rend() const;
  </pre></blockquote>
  
--- 14961,14968 ----
  1) The members
  </p>
  
! <blockquote><pre>
! const_iterator rbegin() const;
  const_iterator rend() const;
  </pre></blockquote>
  
*************** somewhat questionable.
*** 16624,16630 ****
  <p>
  2) The new "convenience" members
  </p>
! <blockquote><pre>const_iterator cbegin() const;
  const_iterator cend() const;
  const_iterator crbegin() const;
  const_iterator crend() const;
--- 14987,14994 ----
  <p>
  2) The new "convenience" members
  </p>
! <blockquote><pre>
! const_iterator cbegin() const;
  const_iterator cend() const;
  const_iterator crbegin() const;
  const_iterator crend() const;
*************** Add the following members to the <tt>mat
*** 16640,16646 ****
  para 3:
  </p>
  
! <blockquote><pre>const_iterator cbegin() const; 
  const_iterator cend() const;
  </pre></blockquote>
  
--- 15004,15011 ----
  para 3:
  </p>
  
! <blockquote><pre>
! const_iterator cbegin() const; 
  const_iterator cend() const;
  </pre></blockquote>
  
*************** In section 28.10.4 [re.results.acc] chan
*** 16649,16655 ****
  </p>
  
  <blockquote>
! <pre>const_iterator begin() const;
  <ins>const_iterator cbegin() const;</ins>
  </pre>
  <blockquote>
--- 15014,15021 ----
  </p>
  
  <blockquote>
! <pre>
! const_iterator begin() const;
  <ins>const_iterator cbegin() const;</ins>
  </pre>
  <blockquote>
*************** In section 28.10.4 [re.results.acc] chan
*** 16658,16664 ****
  </p>
  </blockquote>
  
! <pre>const_iterator end() const;
  <ins>const_iterator cend() const;</ins>
  </pre>
  <blockquote>
--- 15024,15031 ----
  </p>
  </blockquote>
  
! <pre>
! const_iterator end() const;
  <ins>const_iterator cend() const;</ins>
  </pre>
  <blockquote>
*************** Bellevue:  Proposed wording now in the W
*** 16686,16701 ****
  
  
  <hr>
! <h3><a name="647"></a>647. Inconsistent regex_search params</h3>
! <p><b>Section:</b> 28.11.3 [re.alg.search] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-02-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  28.11.3 [re.alg.search]/5 declares
  </p>
  
! <blockquote><pre>template &lt;class iterator, class charT, class traits&gt;
  bool regex_search(iterator first, iterator last,
                    const basic_regex&lt;charT, traits&gt;&amp; e,
                    regex_constants::match_flag_type flags =
--- 15053,15069 ----
  
  
  <hr>
! <h3><a name="647"></a>647. Inconsistent <tt>regex_search</tt> params</h3>
! <p><b>Section:</b> 28.11.3 [re.alg.search] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-02-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  28.11.3 [re.alg.search]/5 declares
  </p>
  
! <blockquote><pre>
! template &lt;class iterator, class charT, class traits&gt;
  bool regex_search(iterator first, iterator last,
                    const basic_regex&lt;charT, traits&gt;&amp; e,
                    regex_constants::match_flag_type flags =
*************** to the preceding declaration in the syno
*** 16709,16715 ****
  28.4 [re.syn], which says:
  </p>
  
! <blockquote><pre>template &lt;class BidirectionalIterator, class charT, class traits&gt;
  bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
                    const basic_regex&lt;charT, traits&gt;&amp; e,
                    regex_constants::match_flag_type flags =
--- 15077,15084 ----
  28.4 [re.syn], which says:
  </p>
  
! <blockquote><pre>
! template &lt;class BidirectionalIterator, class charT, class traits&gt;
  bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
                    const basic_regex&lt;charT, traits&gt;&amp; e,
                    regex_constants::match_flag_type flags =
*************** In 28.11.3 [re.alg.search]/5 replace all
*** 16723,16729 ****
  "BidirectionalIterator"
  </p>
  
! <blockquote><pre>template &lt;class <del>iterator</del> <ins>BidirectionalIterator</ins>, class charT, class traits&gt;
    bool regex_search(<del>iterator</del> <ins>BidirectionalIterator</ins> first, <del>iterator</del> <ins>BidirectionalIterator</ins> last, 
                      const basic_regex&lt;charT, traits&gt;&amp; e, 
                      regex_constants::match_flag_type flags = 
--- 15092,15099 ----
  "BidirectionalIterator"
  </p>
  
! <blockquote><pre>
! template &lt;class <del>iterator</del> <ins>BidirectionalIterator</ins>, class charT, class traits&gt;
    bool regex_search(<del>iterator</del> <ins>BidirectionalIterator</ins> first, <del>iterator</del> <ins>BidirectionalIterator</ins> last, 
                      const basic_regex&lt;charT, traits&gt;&amp; e, 
                      regex_constants::match_flag_type flags = 
*************** of <tt>regex_search(first, last, what, e
*** 16738,16755 ****
  </blockquote>
  
  
! <p><b>Rationale:</b></p>
  Applied to working paper while issue was still in New status.
! 
  
  
  
  
  <hr>
  <h3><a name="648"></a>648. regex_iterator c'tor needs clarification/editorial fix</h3>
! <p><b>Section:</b> 28.12.1.1 [re.regiter.cnstr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-03-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 28.12.1.1 [re.regiter.cnstr]/2 the effects paragraph starts with:
--- 15108,15125 ----
  </blockquote>
  
  
! <p><b>Rationale:</b></p><p>
  Applied to working paper while issue was still in New status.
! </p>
  
  
  
  
  <hr>
  <h3><a name="648"></a>648. regex_iterator c'tor needs clarification/editorial fix</h3>
! <p><b>Section:</b> 28.12.1.1 [re.regiter.cnstr] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-03-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 28.12.1.1 [re.regiter.cnstr]/2 the effects paragraph starts with:
*************** constructor sets <tt>*this</tt> to the e
*** 16801,16810 ****
  
  <hr>
  <h3><a name="649"></a>649. Several typos in regex_token_iterator constructors</h3>
! <p><b>Section:</b> 28.12.2.1 [re.tokiter.cnstr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-03-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.tokiter.cnstr">issues</a> in [re.tokiter.cnstr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 28.12.2.1 [re.tokiter.cnstr]/1+2 both the constructor declaration
--- 15171,15180 ----
  
  <hr>
  <h3><a name="649"></a>649. Several typos in regex_token_iterator constructors</h3>
! <p><b>Section:</b> 28.12.2.1 [re.tokiter.cnstr] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-03-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.tokiter.cnstr">issues</a> in [re.tokiter.cnstr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 28.12.2.1 [re.tokiter.cnstr]/1+2 both the constructor declaration
*************** and the following text shows some obviou
*** 16813,16819 ****
  <p>
  1) The third constructor form is written as
  </p>
! <blockquote><pre>template &lt;std::size_t N&gt;
    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, 
                         const regex_type&amp; re, 
                         const int (&amp;submatches)[R], 
--- 15183,15190 ----
  <p>
  1) The third constructor form is written as
  </p>
! <blockquote><pre>
! template &lt;std::size_t N&gt;
    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, 
                         const regex_type&amp; re, 
                         const int (&amp;submatches)[R], 
*************** by the parameter "m".
*** 16859,16865 ****
  <p>
  Change 28.12.2.1 [re.tokiter.cnstr]/1:
  </p>
! <blockquote><pre>template &lt;std::size_t N&gt;
    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, 
                         const regex_type&amp; re, 
                         const int (&amp;submatches)[<del>R</del> <ins>N</ins>], 
--- 15230,15237 ----
  <p>
  Change 28.12.2.1 [re.tokiter.cnstr]/1:
  </p>
! <blockquote><pre>
! template &lt;std::size_t N&gt;
    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, 
                         const regex_type&amp; re, 
                         const int (&amp;submatches)[<del>R</del> <ins>N</ins>], 
*************** constructor sets <tt>*this</tt> to an en
*** 16903,16912 ****
  
  <hr>
  <h3><a name="653"></a>653. Library reserved names</h3>
! <p><b>Section:</b> 1.2 [intro.refs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-03-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#intro.refs">issues</a> in [intro.refs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  </p>
--- 15275,15284 ----
  
  <hr>
  <h3><a name="653"></a>653. Library reserved names</h3>
! <p><b>Section:</b> 1.2 [intro.refs] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-03-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#intro.refs">issues</a> in [intro.refs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  </p>
*************** Post-Kona: Alisdair request Open. A good
*** 16965,16972 ****
  discussion of the system error proposal, where it was pointed out an all-caps
  identifier starting with a capital E conflicted with reserved macro names for
  both Posix and C.  I had absolutely no idea of this rule, and suspect I was
! not the only one in the room.<br>
! <br>
  Resolution will require someone with access to all the listed documents to
  research their respective name reservation rules, or people with access to
  specific documents add their rules to this issue until the list is complete.
--- 15337,15344 ----
  discussion of the system error proposal, where it was pointed out an all-caps
  identifier starting with a capital E conflicted with reserved macro names for
  both Posix and C.  I had absolutely no idea of this rule, and suspect I was
! not the only one in the room.<br/>
! <br/>
  Resolution will require someone with access to all the listed documents to
  research their respective name reservation rules, or people with access to
  specific documents add their rules to this issue until the list is complete.
*************** Suggest a formal paper rather than a def
*** 16989,16998 ****
  
  <hr>
  <h3><a name="656"></a>656. Typo in subtract_with_carry_engine declaration</h3>
! <p><b>Section:</b> 26.5.2 [rand.synopsis] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-03-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.synopsis">issues</a> in [rand.synopsis].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  26.5.2 [rand.synopsis] the header <tt>&lt;random&gt;</tt> synopsis
--- 15361,15370 ----
  
  <hr>
  <h3><a name="656"></a>656. Typo in subtract_with_carry_engine declaration</h3>
! <p><b>Section:</b> 26.5.2 [rand.synopsis] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-03-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.synopsis">issues</a> in [rand.synopsis].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  26.5.2 [rand.synopsis] the header <tt>&lt;random&gt;</tt> synopsis
*************** contains an unreasonable closing curly b
*** 17006,17012 ****
  Change the current declaration in 26.5.2 [rand.synopsis]
  </p>
  
! <blockquote><pre>template &lt;class UIntType, size_t w<del>}</del>, size_t s, size_t r&gt;
  class subtract_with_carry_engine;
  </pre></blockquote>
  
--- 15378,15385 ----
  Change the current declaration in 26.5.2 [rand.synopsis]
  </p>
  
! <blockquote><pre>
! template &lt;class UIntType, size_t w<del>}</del>, size_t s, size_t r&gt;
  class subtract_with_carry_engine;
  </pre></blockquote>
  
*************** Pete: Recommends editorial.
*** 17021,17029 ****
  
  <hr>
  <h3><a name="657"></a>657. unclear requirement about header inclusion</h3>
! <p><b>Section:</b> 17.6.2.2 [using.headers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gennaro Prota <b>Opened:</b> 2007-03-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  17.6.2.2 [using.headers] states:
--- 15394,15403 ----
  
  <hr>
  <h3><a name="657"></a>657. unclear requirement about header inclusion</h3>
! <p><b>Section:</b> 17.6.2.2 [using.headers] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Gennaro Prota <b>Opened:</b> 2007-03-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#using.headers">issues</a> in [using.headers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  17.6.2.2 [using.headers] states:
*************** external declaration or definition, [...
*** 17038,17044 ****
  I see three problems with this requirement:
  </p>
  
! <ol type="a">
  <li><p>The C++ standard doesn't define what an "external declaration" or
  an "external definition" are (incidentally the C99 standard does, and
  has a sentence very similar to the above regarding header inclusion).
--- 15412,15418 ----
  I see three problems with this requirement:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li><p>The C++ standard doesn't define what an "external declaration" or
  an "external definition" are (incidentally the C99 standard does, and
  has a sentence very similar to the above regarding header inclusion).
*************** declaration" as "declaration of an ident
*** 17050,17056 ****
  If this were the correct interpretation, then the two inclusions below
  would be legal:
  </p>
! <blockquote><pre>  // at global scope
    static void f()
    {
  # include &lt;cstddef&gt;
--- 15424,15431 ----
  If this were the correct interpretation, then the two inclusions below
  would be legal:
  </p>
! <blockquote><pre>
!   // at global scope
    static void f()
    {
  # include &lt;cstddef&gt;
*************** proposal (<a href="http://www.open-std.o
*** 17092,17098 ****
      Those seeking to conveniently enable argument-dependent
      lookups for all operators within an explicit namespace
      could easily create a header file that does so:
! </p><pre>    namespace mymath::
      {
          #include "using_ops.hpp"
      }
--- 15467,15474 ----
      Those seeking to conveniently enable argument-dependent
      lookups for all operators within an explicit namespace
      could easily create a header file that does so:
! </p><pre>
!     namespace mymath::
      {
          #include "using_ops.hpp"
      }
*************** proposal (<a href="http://www.open-std.o
*** 17106,17126 ****
  </p>
  
  
! <p><b>Rationale:</b></p>
  We believe that the existing language does not cause any real confusion
  and any new formulation of the rules that we could come up with are
  unlikely to be better than what's already in the standard.
! 
  
  
  
  
  <hr>
  <h3><a name="662"></a>662. Inconsistent handling of incorrectly-placed thousands separators</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Cosmin Truta <b>Opened:</b> 2007-04-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From Section 22.4.2.1.2 [facet.num.get.virtuals], paragraphs 11 and 12, it is implied
--- 15482,15503 ----
  </p>
  
  
! <p><b>Rationale:</b></p><p>
  We believe that the existing language does not cause any real confusion
  and any new formulation of the rules that we could come up with are
  unlikely to be better than what's already in the standard.
! </p>
  
  
  
  
  <hr>
  <h3><a name="662"></a>662. Inconsistent handling of incorrectly-placed thousands separators</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Cosmin Truta <b>Opened:</b> 2007-04-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From Section 22.4.2.1.2 [facet.num.get.virtuals], paragraphs 11 and 12, it is implied
*************** successful but not-quite-correct extract
*** 17193,17199 ****
  as the previous value, the programmer must resort to implementation tricks.
  Consider the following example:
  </p>
! <pre>    int i = old_i;
      cin &gt;&gt; i;
      if (cin.fail())
          // can the value of i be trusted?
--- 15570,15577 ----
  as the previous value, the programmer must resort to implementation tricks.
  Consider the following example:
  </p>
! <pre>
!     int i = old_i;
      cin &gt;&gt; i;
      if (cin.fail())
          // can the value of i be trusted?
*************** Change 22.4.2.1.2 [facet.num.get.virtual
*** 17233,17253 ****
  </blockquote>
  
  
! <p><b>Rationale:</b></p>
  post-Toronto: Changed from New to NAD at the request of the author.  The preferred solution of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2327.pdf">N2327</a>
  makes this resolution obsolete.
! 
  
  
  
  
  <hr>
  <h3><a name="663"></a>663. Complexity Requirements</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  17.5.1.4 [structure.specifications] para 5 says
--- 15611,15631 ----
  </blockquote>
  
  
! <p><b>Rationale:</b></p><p>
  post-Toronto: Changed from New to NAD at the request of the author.  The preferred solution of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2327.pdf">N2327</a>
  makes this resolution obsolete.
! </p>
  
  
  
  
  <hr>
  <h3><a name="663"></a>663. Complexity Requirements</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  17.5.1.4 [structure.specifications] para 5 says
*************** _23213Y31 etc]
*** 17284,17303 ****
  </p>
  
  
! <p><b>Rationale:</b></p>
  Kona (2007): No specific instances of underspecification have been
  identified, and big-O notation always involves constant factors.
! 
  
  
  
  
  <hr>
  <h3><a name="667"></a>667. <tt>money_get</tt>'s widened minus sign</h3>
! <p><b>Section:</b> 22.4.6.1.2 [locale.money.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.money.get.virtuals">issues</a> in [locale.money.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.1.2 [locale.money.get.virtuals], para 1 says:
--- 15662,15681 ----
  </p>
  
  
! <p><b>Rationale:</b></p><p>
  Kona (2007): No specific instances of underspecification have been
  identified, and big-O notation always involves constant factors.
! </p>
  
  
  
  
  <hr>
  <h3><a name="667"></a>667. <tt>money_get</tt>'s widened minus sign</h3>
! <p><b>Section:</b> 22.4.6.1.2 [locale.money.get.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.money.get.virtuals">issues</a> in [locale.money.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.1.2 [locale.money.get.virtuals], para 1 says:
*************** post Bellevue: Bill adds:
*** 17344,17365 ****
  ]</i></p>
  
  
! <blockquote>
  The Standard is clear that the minus sign stored in <tt>digits</tt> is <tt>ct.widen('-')</tt>.
  The subject string must contain characters <tt>c</tt> in the set <tt>[-0123456789]</tt>
  which are translated by <tt>ct.widen(c)</tt> calls before being stored in <tt>digits</tt>;
  the widened characters are not relevant to the parsing of the subject string.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with Bill's comment above,
  in line with the first of the interpretations offered in the issue.
  Move to NAD.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 15722,15743 ----
  ]</i></p>
  
  
! <blockquote><p>
  The Standard is clear that the minus sign stored in <tt>digits</tt> is <tt>ct.widen('-')</tt>.
  The subject string must contain characters <tt>c</tt> in the set <tt>[-0123456789]</tt>
  which are translated by <tt>ct.widen(c)</tt> calls before being stored in <tt>digits</tt>;
  the widened characters are not relevant to the parsing of the subject string.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with Bill's comment above,
  in line with the first of the interpretations offered in the issue.
  Move to NAD.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to NAD.
*** 17372,17381 ****
  
  <hr>
  <h3><a name="668"></a>668. <tt>money_get</tt>'s empty minus sign</h3>
! <p><b>Section:</b> 22.4.6.1.2 [locale.money.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.money.get.virtuals">issues</a> in [locale.money.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.1.2 [locale.money.get.virtuals], para 3 says:
--- 15750,15759 ----
  
  <hr>
  <h3><a name="668"></a>668. <tt>money_get</tt>'s empty minus sign</h3>
! <p><b>Section:</b> 22.4.6.1.2 [locale.money.get.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.money.get.virtuals">issues</a> in [locale.money.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.1.2 [locale.money.get.virtuals], para 3 says:
*************** Kona (2007): Bill to provide proposed wo
*** 17407,17413 ****
  
  
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>.
  </p>
  
  <p><i>[
--- 15785,15791 ----
  
  
  <p>
! Related to <a href="lwg-closed.html#669">669</a>.
  </p>
  
  <p><i>[
*************** write a negative sign".  The meaning req
*** 17422,17428 ****
  taken into account:
  </p>
  
! <blockquote>
  -3- ... If <tt>pos</tt> or <tt>neg</tt> is empty, the sign component is
  optional, and if no sign is detected, the result is given the sign that
  corresponds to the source of the empty string. Otherwise, the character
--- 15800,15806 ----
  taken into account:
  </p>
  
! <blockquote><p>
  -3- ... If <tt>pos</tt> or <tt>neg</tt> is empty, the sign component is
  optional, and if no sign is detected, the result is given the sign that
  corresponds to the source of the empty string. Otherwise, the character
*************** or <tt>neg</tt>, and the result is given
*** 17431,17437 ****
  first character of <tt>pos</tt> is equal to the first character of
  <tt>neg</tt>, or if both strings are empty, the result is given a
  positive sign.
! </blockquote>
  
  <p>
  So a <tt>negative_sign</tt> of "" means "there is no way to write a
--- 15809,15815 ----
  first character of <tt>pos</tt> is equal to the first character of
  <tt>neg</tt>, or if both strings are empty, the result is given a
  positive sign.
! </p></blockquote>
  
  <p>
  So a <tt>negative_sign</tt> of "" means "there is no way to write a
*************** when <tt>negative_sign</tt> is "" and <t
*** 17443,17449 ****
  For example:
  </p>
  
! <blockquote><pre>pattern = {symbol, sign, value, none}
  positive_sign = "+"
  negative_sign = ""
  $123   // a negative value, using optional sign
--- 15821,15828 ----
  For example:
  </p>
  
! <blockquote><pre>
! pattern = {symbol, sign, value, none}
  positive_sign = "+"
  negative_sign = ""
  $123   // a negative value, using optional sign
*************** $-123  // a parse error
*** 17455,17461 ****
  And:
  </p>
  
! <blockquote><pre>pattern = {symbol, sign, value, none}
  positive_sign = ""
  negative_sign = ""
  $123   // a positive value, no sign possible
--- 15834,15841 ----
  And:
  </p>
  
! <blockquote><pre>
! pattern = {symbol, sign, value, none}
  positive_sign = ""
  negative_sign = ""
  $123   // a positive value, no sign possible
*************** $-123  // a parse error
*** 17465,17474 ****
  
  
  <p>
! And (regarding <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>):
  </p>
  
! <blockquote><pre>pattern = {symbol, sign, value, none}
  positive_sign = "-"
  negative_sign = "-"
  $123   // a parse error, sign is mandatory
--- 15845,15855 ----
  
  
  <p>
! And (regarding <a href="lwg-closed.html#669">669</a>):
  </p>
  
! <blockquote><pre>
! pattern = {symbol, sign, value, none}
  positive_sign = "-"
  negative_sign = "-"
  $123   // a parse error, sign is mandatory
*************** $-123  // a positive value
*** 17479,17485 ****
  
  <p>
  The text seems both unambiguous and clear to me.  I recommend NAD for
! both this issue and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>.  However I would have no
  objection to adding examples such as those above.
  </p>
  </blockquote>
--- 15860,15866 ----
  
  <p>
  The text seems both unambiguous and clear to me.  I recommend NAD for
! both this issue and <a href="lwg-closed.html#669">669</a>.  However I would have no
  objection to adding examples such as those above.
  </p>
  </blockquote>
*************** Batavia (2009-05):
*** 17490,17496 ****
  
  <blockquote>
  <p>
! This discussion applies equally to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a> (q.v.).
  Howard has added examples above,
  and recommends either NAD or a resolution that adds his (or similar) examples
  to the Working Paper.
--- 15871,15877 ----
  
  <blockquote>
  <p>
! This discussion applies equally to issue <a href="lwg-closed.html#669">669</a> (q.v.).
  Howard has added examples above,
  and recommends either NAD or a resolution that adds his (or similar) examples
  to the Working Paper.
*************** Alan would like to rewrite paragraph 3.
*** 17502,17508 ****
  We recommend moving to NAD.
  Anyone who feels strongly about adding the examples
  is invited to submit corresponding wording.
! We further recommend issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a> be handled identically.
  </p>
  </blockquote>
  
--- 15883,15889 ----
  We recommend moving to NAD.
  Anyone who feels strongly about adding the examples
  is invited to submit corresponding wording.
! We further recommend issue <a href="lwg-closed.html#669">669</a> be handled identically.
  </p>
  </blockquote>
  
*************** We further recommend issue <a href="http
*** 17516,17533 ****
  ]</i></p>
  
  
! <blockquote>
  No consensus for closing as NAD.  Leave in Review.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  NAD.  Agreed that the original assessment as NAD was correct.
! </blockquote>
  
  
  
--- 15897,15914 ----
  ]</i></p>
  
  
! <blockquote><p>
  No consensus for closing as NAD.  Leave in Review.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  NAD.  Agreed that the original assessment as NAD was correct.
! </p></blockquote>
  
  
  
*************** NAD.  Agreed that the original assessmen
*** 17536,17542 ****
  Change 22.4.6.1.2 [locale.money.get.virtuals] p3:
  </p>
  
! <blockquote>
  -3- <del>If the first character (if any) in the string pos returned by
  <tt>mp.positive_sign()</tt> or the string <tt>neg</tt> returned by
  <tt>mp.negative_sign()</tt> is recognized in the position indicated by
--- 15917,15923 ----
  Change 22.4.6.1.2 [locale.money.get.virtuals] p3:
  </p>
  
! <blockquote><p>
  -3- <del>If the first character (if any) in the string pos returned by
  <tt>mp.positive_sign()</tt> or the string <tt>neg</tt> returned by
  <tt>mp.negative_sign()</tt> is recognized in the position indicated by
*************** characters are matched, <tt>s</tt> is co
*** 17569,17577 ****
  value of "<tt>()</tt>" and a currency symbol of "<tt>L</tt>", in
  "<tt>(100 L)</tt>" the entire string is consumed; but for a <tt>neg</tt>
  value of "<tt>-</tt>", in "<tt>-100 L</tt>", the string is consumed
! through the second "<tt>0</tt>" (the space and "<tt>L</tt>" are not consumed). — <i>end
  example</i>] </ins>
! </blockquote>
  
  
  
--- 15950,15958 ----
  value of "<tt>()</tt>" and a currency symbol of "<tt>L</tt>", in
  "<tt>(100 L)</tt>" the entire string is consumed; but for a <tt>neg</tt>
  value of "<tt>-</tt>", in "<tt>-100 L</tt>", the string is consumed
! through the second "<tt>0</tt>" (the space and "<tt>L</tt>" are not consumed). &mdash; <i>end
  example</i>] </ins>
! </p></blockquote>
  
  
  
*************** example</i>] </ins>
*** 17579,17588 ****
  
  <hr>
  <h3><a name="669"></a>669. Equivalent postive and negative signs in <tt>money_get</tt></h3>
! <p><b>Section:</b> 22.4.6.1.2 [locale.money.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.money.get.virtuals">issues</a> in [locale.money.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.1.2 [locale.money.get.virtuals], para 3 sentence 4 says:
--- 15960,15969 ----
  
  <hr>
  <h3><a name="669"></a>669. Equivalent postive and negative signs in <tt>money_get</tt></h3>
! <p><b>Section:</b> 22.4.6.1.2 [locale.money.get.virtuals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.money.get.virtuals">issues</a> in [locale.money.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.1.2 [locale.money.get.virtuals], para 3 sentence 4 says:
*************** Bill to provide proposed wording and int
*** 17614,17620 ****
  
  
  <p><i>[
! 2009-05-17 See Howard's comments in related issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>.
  ]</i></p>
  
  
--- 15995,16001 ----
  
  
  <p><i>[
! 2009-05-17 See Howard's comments in related issue <a href="lwg-closed.html#668">668</a>.
  ]</i></p>
  
  
*************** Batavia (2009-05):
*** 17624,17630 ****
  
  <blockquote>
  <p>
! This discussion applies equally to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a> (q.v.).
  Howard has added examples there,
  and recommends either NAD or a resolution that adds his (or similar) examples
  to the Working Paper.
--- 16005,16011 ----
  
  <blockquote>
  <p>
! This discussion applies equally to issue <a href="lwg-closed.html#668">668</a> (q.v.).
  Howard has added examples there,
  and recommends either NAD or a resolution that adds his (or similar) examples
  to the Working Paper.
*************** to the Working Paper.
*** 17633,17639 ****
  We recommend moving to NAD.
  Anyone who feels strongly about adding the examples
  is invited to submit corresponding wording.
! We further recommend issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a> be handled identically.
  </p>
  </blockquote>
  
--- 16014,16020 ----
  We recommend moving to NAD.
  Anyone who feels strongly about adding the examples
  is invited to submit corresponding wording.
! We further recommend issue <a href="lwg-closed.html#668">668</a> be handled identically.
  </p>
  </blockquote>
  
*************** We further recommend issue <a href="http
*** 17648,17657 ****
  
  <hr>
  <h3><a name="670"></a>670. <tt>money_base::pattern</tt> and <tt>space</tt></h3>
! <p><b>Section:</b> 22.4.6.3 [locale.moneypunct] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a></p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.3 [locale.moneypunct], para 2 says:
--- 16029,16038 ----
  
  <hr>
  <h3><a name="670"></a>670. <tt>money_base::pattern</tt> and <tt>space</tt></h3>
! <p><b>Section:</b> 22.4.6.3 [locale.moneypunct] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#836">836</a></p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.3 [locale.moneypunct], para 2 says:
*************** whitespace characters on input.
*** 17691,17700 ****
  
  <hr>
  <h3><a name="683"></a>683. regex_token_iterator summary error</h3>
! <p><b>Section:</b> 28.12.2 [re.tokiter] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2007-06-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.tokiter">issues</a> in [re.tokiter].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  28.12.2 [re.tokiter], p3 says:
--- 16072,16081 ----
  
  <hr>
  <h3><a name="683"></a>683. regex_token_iterator summary error</h3>
! <p><b>Section:</b> 28.12.2 [re.tokiter] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2007-06-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.tokiter">issues</a> in [re.tokiter].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  28.12.2 [re.tokiter], p3 says:
*************** Yep, looks like a typo/administrative fi
*** 17740,17755 ****
  
  <hr>
  <h3><a name="684"></a>684. Unclear which members of match_results should be used in comparison</h3>
! <p><b>Section:</b> 28.10 [re.results] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Nozomu Katoo <b>Opened:</b> 2007-05-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.results">issues</a> in [re.results].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 28.4 [re.syn] of N2284, two template functions 
  are declared here: 
  </p>
! <blockquote><pre>// 28.10, class template match_results: 
    &lt;<i>snip</i>&gt;
  // match_results comparisons 
    template &lt;class BidirectionalIterator, class Allocator&gt; 
--- 16121,16137 ----
  
  <hr>
  <h3><a name="684"></a>684. Unclear which members of match_results should be used in comparison</h3>
! <p><b>Section:</b> 28.10 [re.results] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Nozomu Katoo <b>Opened:</b> 2007-05-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results">issues</a> in [re.results].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 28.4 [re.syn] of N2284, two template functions 
  are declared here: 
  </p>
! <blockquote><pre>
! // 28.10, class template match_results: 
    &lt;<i>snip</i>&gt;
  // match_results comparisons 
    template &lt;class BidirectionalIterator, class Allocator&gt; 
*************** Add a new section after 28.10.7 [re.resu
*** 17795,17801 ****
  </p>
  
  <blockquote>
! <pre>template&lt;class BidirectionalIterator, class Allocator&gt; 
    bool operator==(const match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m1, 
                    const match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m2);
  </pre>
--- 16177,16184 ----
  </p>
  
  <blockquote>
! <pre>
! template&lt;class BidirectionalIterator, class Allocator&gt; 
    bool operator==(const match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m1, 
                    const match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m2);
  </pre>
*************** Add a new section after 28.10.7 [re.resu
*** 17807,17813 ****
  </blockquote>
  
  <blockquote>
! <pre>template&lt;class BidirectionalIterator, class Allocator&gt; 
    bool operator!=(const match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m1, 
                    const match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m2);
  </pre>
--- 16190,16197 ----
  </blockquote>
  
  <blockquote>
! <pre>
! template&lt;class BidirectionalIterator, class Allocator&gt; 
    bool operator!=(const match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m1, 
                    const match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m2);
  </pre>
*************** Add a new section after 28.10.7 [re.resu
*** 17819,17825 ****
  </blockquote>
  
  <blockquote>
! <pre>template&lt;class BidirectionalIterator, class Allocator&gt; 
    void swap(match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m1, 
              match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m2);
  </pre>
--- 16203,16210 ----
  </blockquote>
  
  <blockquote>
! <pre>
! template&lt;class BidirectionalIterator, class Allocator&gt; 
    void swap(match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m1, 
              match_results&lt;BidirectionalIterator, Allocator&gt;&amp; m2);
  </pre>
*************** Bellevue:  Proposed wording now in WP.
*** 17840,17853 ****
  
  
  <hr>
! <h3><a name="686"></a>686. Unique_ptr and shared_ptr fail to specify non-convertibility to int for unspecified-bool-type</h3>
! <p><b>Section:</b> 20.9.9.2.4 [unique.ptr.single.observers], 20.9.10.2.5 [util.smartptr.shared.obs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2007-06-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard library uses the <tt>operator <i>unspecified-bool-type</i>() const</tt> idiom in
! five places. In three of those places (20.8.14.2.3 [func.wrap.func.cap], function capacity 
  for example) the returned value is constrained to disallow
  unintended conversions to int. The standardese is
  </p>
--- 16225,16238 ----
  
  
  <hr>
! <h3><a name="686"></a>686. <tt>unique_ptr</tt> and <tt>shared_ptr</tt> fail to specify non-convertibility to int for unspecified-bool-type</h3>
! <p><b>Section:</b> 20.8.1.2.4 [unique.ptr.single.observers], 20.8.2.2.5 [util.smartptr.shared.obs] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2007-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard library uses the <tt>operator <i>unspecified-bool-type</i>() const</tt> idiom in
! five places. In three of those places (20.9.12.2.3 [func.wrap.func.cap], function capacity 
  for example) the returned value is constrained to disallow
  unintended conversions to int. The standardese is
  </p>
*************** Bellevue:
*** 17863,17880 ****
  ]</i></p>
  
  
! <blockquote>
  Close as NAD. Accepting paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2435.htm">N2435</a>
  makes it irrelevant.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  To the <i>Returns</i> paragraph for <tt>operator <i>unspecified-bool-type</i>()
! const</tt> of 20.9.9.2.4 [unique.ptr.single.observers] paragraph 11 and 20.9.10.2.5 [util.smartptr.shared.obs] paragraph 16, add the sentence:
  </p>
  <blockquote><p>
  The return type shall not be convertible to <tt>int</tt>.
--- 16248,16265 ----
  ]</i></p>
  
  
! <blockquote><p>
  Close as NAD. Accepting paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2435.htm">N2435</a>
  makes it irrelevant.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  To the <i>Returns</i> paragraph for <tt>operator <i>unspecified-bool-type</i>()
! const</tt> of 20.8.1.2.4 [unique.ptr.single.observers] paragraph 11 and 20.8.2.2.5 [util.smartptr.shared.obs] paragraph 16, add the sentence:
  </p>
  <blockquote><p>
  The return type shall not be convertible to <tt>int</tt>.
*************** Kona (2007): Uncertain if <tt>nullptr</t
*** 17891,17900 ****
  
  <hr>
  <h3><a name="690"></a>690. abs(long long) should return long long</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2007-06-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Quoting the latest draft (n2135), 26.8 [c.math]: 
--- 16276,16286 ----
  
  <hr>
  <h3><a name="690"></a>690. abs(long long) should return long long</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2007-06-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Quoting the latest draft (n2135), 26.8 [c.math]: 
*************** Quoting the latest draft (n2135), 26.8 [
*** 17904,17910 ****
  <p>
  The added signatures are:
  </p>
! <blockquote><pre>long abs(long); // labs()
  long abs(long long); // llabs()
  </pre></blockquote>
  </blockquote>
--- 16290,16297 ----
  <p>
  The added signatures are:
  </p>
! <blockquote><pre>
! long abs(long); // labs()
  long abs(long long); // llabs()
  </pre></blockquote>
  </blockquote>
*************** Shouldn't <tt>abs(long long)</tt> have <
*** 17917,17938 ****
  <p>
  Change 26.8 [c.math]: 
  </p>
! <blockquote><pre><ins>long </ins>long abs(long long); // llabs()
  </pre></blockquote>
  
  
! <p><b>Rationale:</b></p>
  Had already been fixed in the WP by the time the LWG reviewed this.
! 
  
  
  
  
  <hr>
  <h3><a name="701"></a>701. assoc laguerre poly's</h3>
! <p><b>Section:</b> TR1 5.2.1.1 [tr.num.sf.Lnm] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Christopher Crawford <b>Opened:</b> 2007-06-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I see that the definition the associated Laguerre
--- 16304,16326 ----
  <p>
  Change 26.8 [c.math]: 
  </p>
! <blockquote><pre>
! <ins>long </ins>long abs(long long); // llabs()
  </pre></blockquote>
  
  
! <p><b>Rationale:</b></p><p>
  Had already been fixed in the WP by the time the LWG reviewed this.
! </p>
  
  
  
  
  <hr>
  <h3><a name="701"></a>701. assoc laguerre poly's</h3>
! <p><b>Section:</b> TR1 5.2.1.1 [tr.num.sf.Lnm] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Christopher Crawford <b>Opened:</b> 2007-06-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I see that the definition the associated Laguerre
*************** Move to NAD.
*** 17981,17989 ****
  
  <hr>
  <h3><a name="702"></a>702. Restriction in associated Legendre functions</h3>
! <p><b>Section:</b> TR1 5.2.1.2 [tr.num.sf.Plm] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Christopher Crawford <b>Opened:</b> 2007-06-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  One other small thing, in TR1 5.2.1.2 [tr.num.sf.Plm], the restriction should  be
--- 16369,16377 ----
  
  <hr>
  <h3><a name="702"></a>702. Restriction in associated Legendre functions</h3>
! <p><b>Section:</b> TR1 5.2.1.2 [tr.num.sf.Plm] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Christopher Crawford <b>Opened:</b> 2007-06-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  One other small thing, in TR1 5.2.1.2 [tr.num.sf.Plm], the restriction should  be
*************** Move to NAD.
*** 18013,18023 ****
  
  <hr>
  <h3><a name="707"></a>707. null pointer constant for <tt>exception_ptr</tt></h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2007-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 16401,16410 ----
  
  <hr>
  <h3><a name="707"></a>707. null pointer constant for <tt>exception_ptr</tt></h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2007-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** implementation details.
*** 18072,18159 ****
  
  
  <hr>
- <h3><a name="708"></a>708. Locales need to be per thread and updated for POSIX changes</h3>
- <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-07-28 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#localization">issues</a> in [localization].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- The POSIX "Extended API Set Part 4,"
- </p>
- <blockquote><p>
- <a href="http://www.opengroup.org/sib/details.tpl?id=C065">http://www.opengroup.org/sib/details.tpl?id=C065</a>
- </p></blockquote>
- <p>
- introduces extensions to the C locale mechanism that
- allow multiple concurrent locales to be used in the same application
- by introducing a type <tt>locale_t</tt> that is very similar to
- <tt>std::locale</tt>, and a number of <tt>_l</tt> functions that make use of it.
- </p>
- <p>
- The global locale (set by setlocale) is now specified to be per-
- process. If a thread does not call <tt>uselocale</tt>, the global locale is
- in effect for that thread. It can install a per-thread locale by
- using <tt>uselocale</tt>.
- </p>
- <p>
- There is also a nice <tt>querylocale</tt> mechanism by which one can obtain
- the name (such as "de_DE") for a specific <tt>facet</tt>, even for combined
- locales, with no <tt>std::locale</tt> equivalent.
- </p>
- <p>
- <tt>std::locale</tt> should be harmonized with the new POSIX <tt>locale_t</tt>
- mechanism and provide equivalents for <tt>uselocale</tt> and <tt>querylocale</tt>.
- </p>
- 
- <p><i>[
- Kona (2007): Bill and Nick to provide wording.
- ]</i></p>
- 
- 
- <p><i>[
- San Francisco: Bill and Nick still intend to provide wording, but this
- is a part of the task to be addressed by the group that will look into
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-07 Frankfurt:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- It's our intention to stay in sync with WG14. If WG14 makes a decision
- that requires a change in WG21 the issue will be reopened.
- </p>
- <p>
- Move to NAD Future.
- </p>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- </p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="717"></a>717. Incomplete <tt>valarray::operator[]</tt> specification in [valarray.access]</h3>
! <p><b>Section:</b> 26.6.2.3 [valarray.access] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-08-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.access">issues</a> in [valarray.access].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Since the return type of <tt>valarray</tt>'s <tt>operator[] const</tt> overload has been
! changed to <tt>const T&amp;</tt> as described in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#389">389</a> several paragraphs of
! the section 26.6.2.3 [valarray.access] are now
  incompletely
  specified, because many requirements and guarantees should now also
  apply to the const overload. Most notably, the address and reference
--- 16459,16474 ----
  
  
  <hr>
  <h3><a name="717"></a>717. Incomplete <tt>valarray::operator[]</tt> specification in [valarray.access]</h3>
! <p><b>Section:</b> 26.6.2.4 [valarray.access] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.access">issues</a> in [valarray.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Since the return type of <tt>valarray</tt>'s <tt>operator[] const</tt> overload has been
! changed to <tt>const T&amp;</tt> as described in <a href="lwg-defects.html#389">389</a> several paragraphs of
! the section 26.6.2.4 [valarray.access] are now
  incompletely
  specified, because many requirements and guarantees should now also
  apply to the const overload. Most notably, the address and reference
*************** guarantees should be extended to the con
*** 18163,18169 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.6.2.3 [valarray.access]:
  </p>
  
  <blockquote>
--- 16478,16484 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.6.2.4 [valarray.access]:
  </p>
  
  <blockquote>
*************** of that array ends, whichever happens fi
*** 18205,18214 ****
  
  <hr>
  <h3><a name="718"></a>718. <tt>basic_string</tt> is not a sequence</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-08-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 21.4 [basic.string]/3 states:
--- 16520,16530 ----
  
  <hr>
  <h3><a name="718"></a>718. <tt>basic_string</tt> is not a sequence</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-08-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 21.4 [basic.string]/3 states:
*************** Bellevue:
*** 18251,18257 ****
  </ul>
  </li>
  </ul>
! General consensus is to suggest option 2.
  </blockquote>
  
  <p><i>[
--- 16567,16573 ----
  </ul>
  </li>
  </ul>
! <p>General consensus is to suggest option 2.</p>
  </blockquote>
  
  <p><i>[
*************** General consensus is to suggest option 2
*** 18259,18267 ****
  ]</i></p>
  
  
! <blockquote>
  Move to NAD Editorial
! </blockquote>
  
  
  
--- 16575,16583 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to NAD Editorial
! </p></blockquote>
  
  
  
*************** different, a string abstraction in its o
*** 18278,18287 ****
  
  <hr>
  <h3><a name="721"></a>721. <tt>wstring_convert</tt> inconsistensies</h3>
! <p><b>Section:</b> 22.3.3.2.2 [conversions.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-08-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 3 says that the <tt>Codecvt</tt> template parameter shall meet the 
--- 16594,16604 ----
  
  <hr>
  <h3><a name="721"></a>721. <tt>wstring_convert</tt> inconsistensies</h3>
! <p><b>Section:</b> 22.3.3.2.2 [conversions.string] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#conversions.string">active issues</a> in [conversions.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 3 says that the <tt>Codecvt</tt> template parameter shall meet the 
*************** be used (because of a protected destruct
*** 18293,18299 ****
  How are we going to explain this code to beginning programmers?
  </p>
  
! <blockquote><pre>template&lt;class I, class E, class S&gt;
  struct codecvt : std::codecvt&lt;I, E, S&gt;
  {
      ~codecvt()
--- 16610,16617 ----
  How are we going to explain this code to beginning programmers?
  </p>
  
! <blockquote><pre>
! template&lt;class I, class E, class S&gt;
  struct codecvt : std::codecvt&lt;I, E, S&gt;
  {
      ~codecvt()
*************** San Francisco:
*** 18313,18321 ****
  ]</i></p>
  
  
! <blockquote>
  Bill will propose a resolution.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 16631,16639 ----
  ]</i></p>
  
  
! <blockquote><p>
  Bill will propose a resolution.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** Move to NAD.
*** 18343,18359 ****
  
  <hr>
  <h3><a name="725"></a>725. Optional sequence container requirements column label</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2007-09-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 90: (Optional sequence container operations) states the
  "assertion note pre/post-condition" of <tt>operator[]</tt> to be
  </p>
  
! <blockquote><pre>*(a.begin() + n)
  </pre></blockquote>
  
  <p>
--- 16661,16678 ----
  
  <hr>
  <h3><a name="725"></a>725. Optional sequence container requirements column label</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2007-09-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 90: (Optional sequence container operations) states the
  "assertion note pre/post-condition" of <tt>operator[]</tt> to be
  </p>
  
! <blockquote><pre>
! *(a.begin() + n)
  </pre></blockquote>
  
  <p>
*************** Surely that's meant to be "operational s
*** 18366,18375 ****
  <blockquote>
  <table border="1">
  <caption>Table 90: Optional sequence container operations</caption>
! <tbody><tr>
! <th>expression</th> <th>return type</th> <th><del>assertion/note<br>pre/post-condition</del><br> <ins>operational semantics</ins></th> <th>container</th>
  </tr>
! </tbody></table>
  </blockquote>
  
  
--- 16685,16694 ----
  <blockquote>
  <table border="1">
  <caption>Table 90: Optional sequence container operations</caption>
! <tr>
! <th>expression</th> <th>return type</th> <th><del>assertion/note<br/>pre/post-condition</del><br/> <ins>operational semantics</ins></th> <th>container</th>
  </tr>
! </table>
  </blockquote>
  
  
*************** Surely that's meant to be "operational s
*** 18379,18394 ****
  
  <hr>
  <h3><a name="726"></a>726. Missing <tt>regex_replace()</tt> overloads</h3>
! <p><b>Section:</b> 28.11.4 [re.alg.replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2007-09-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.alg.replace">issues</a> in [re.alg.replace].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Two overloads of <tt>regex_replace()</tt> are currently provided:
  </p>
  
! <blockquote><pre>template &lt;class OutputIterator, class BidirectionalIterator, 
      class traits, class charT&gt; 
    OutputIterator 
    regex_replace(OutputIterator out, 
--- 16698,16714 ----
  
  <hr>
  <h3><a name="726"></a>726. Missing <tt>regex_replace()</tt> overloads</h3>
! <p><b>Section:</b> 28.11.4 [re.alg.replace] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2007-09-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.alg.replace">issues</a> in [re.alg.replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Two overloads of <tt>regex_replace()</tt> are currently provided:
  </p>
  
! <blockquote><pre>
! template &lt;class OutputIterator, class BidirectionalIterator, 
      class traits, class charT&gt; 
    OutputIterator 
    regex_replace(OutputIterator out, 
*************** template &lt;class traits, class charT&g
*** 18413,18419 ****
  <li>
  <p>The absence of <tt>const charT *</tt> overloads prevents ordinary-looking code from compiling, such as:</p>
  
! <blockquote><pre>const string s("kitten");
  const regex r("en");
  cout &lt;&lt; regex_replace(s, r, "y") &lt;&lt; endl;
  </pre></blockquote>
--- 16733,16740 ----
  <li>
  <p>The absence of <tt>const charT *</tt> overloads prevents ordinary-looking code from compiling, such as:</p>
  
! <blockquote><pre>
! const string s("kitten");
  const regex r("en");
  cout &lt;&lt; regex_replace(s, r, "y") &lt;&lt; endl;
  </pre></blockquote>
*************** Sophia Antipolis:
*** 18459,18488 ****
  ]</i></p>
  
  
! <blockquote>
  We note that Boost already has these overloads. However, the proposed
  wording is provided only for 28.11.4 [re.alg.replace]; wording is needed for the synopsis
  as well. We also note that this has impact on <tt>match_results::format</tt>,
  which may require further overloads.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Daniel to tweak for us.
! </blockquote>
  
  <p><i>[
! 2009-07-25 Daniel tweaks both this issue and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>.
  ]</i></p>
  
  
  <blockquote>
  <p>
! This is solved by the proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>.
  </p>
  </blockquote>
  
--- 16780,16809 ----
  ]</i></p>
  
  
! <blockquote><p>
  We note that Boost already has these overloads. However, the proposed
  wording is provided only for 28.11.4 [re.alg.replace]; wording is needed for the synopsis
  as well. We also note that this has impact on <tt>match_results::format</tt>,
  which may require further overloads.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Daniel to tweak for us.
! </p></blockquote>
  
  <p><i>[
! 2009-07-25 Daniel tweaks both this issue and <a href="lwg-defects.html#727">727</a>.
  ]</i></p>
  
  
  <blockquote>
  <p>
! This is solved by the proposed resolution of <a href="lwg-defects.html#727">727</a>.
  </p>
  </blockquote>
  
*************** This is solved by the proposed resolutio
*** 18491,18500 ****
  ]</i></p>
  
  
! <blockquote>
  Leave Open. Though we believe this is solved by the proposed resolution
! to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>.
! </blockquote>
  
  <p><i>[
  2010-01-27 Moved to Tentatively NAD after 5 positive votes on c++std-lib. 
--- 16812,16821 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave Open. Though we believe this is solved by the proposed resolution
! to <a href="lwg-defects.html#727">727</a>.
! </p></blockquote>
  
  <p><i>[
  2010-01-27 Moved to Tentatively NAD after 5 positive votes on c++std-lib. 
*************** Rationale added below.
*** 18505,18511 ****
  
  <p><b>Rationale:</b></p>
  <p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>.
  </p>
  
  
--- 16826,16832 ----
  
  <p><b>Rationale:</b></p>
  <p>
! Solved by <a href="lwg-defects.html#727">727</a>.
  </p>
  
  
*************** charT* str</tt> and <tt>const charT* fmt
*** 18520,18526 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class OutputIterator, class BidirectionalIterator, 
      class traits, class charT&gt; 
    OutputIterator 
    regex_replace(OutputIterator out, 
--- 16841,16848 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class OutputIterator, class BidirectionalIterator, 
      class traits, class charT&gt; 
    OutputIterator 
    regex_replace(OutputIterator out, 
*************** charT* str</tt> and <tt>const charT* fmt
*** 18541,18547 ****
                    regex_constants::match_default);</ins>
  </pre>
  <p>...</p>
! <pre>template &lt;class traits, class charT&gt; 
    basic_string&lt;charT&gt; 
    regex_replace(const basic_string&lt;charT&gt;&amp; s, 
                  const basic_regex&lt;charT, traits&gt;&amp; e, 
--- 16863,16870 ----
                    regex_constants::match_default);</ins>
  </pre>
  <p>...</p>
! <pre>
! template &lt;class traits, class charT&gt; 
    basic_string&lt;charT&gt; 
    regex_replace(const basic_string&lt;charT&gt;&amp; s, 
                  const basic_regex&lt;charT, traits&gt;&amp; e, 
*************** charT* str</tt> and <tt>const charT* fmt
*** 18582,18591 ****
  
  <hr>
  <h3><a name="729"></a>729. Problem in [rand.req.eng]/3</h3>
! <p><b>Section:</b> 26.5.1.4 [rand.req.eng] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.req.eng">issues</a> in [rand.req.eng].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The 3rd table row in 26.5.1.4 [rand.req.eng]/3 requires random number engines to accept any 
--- 16905,16914 ----
  
  <hr>
  <h3><a name="729"></a>729. Problem in [rand.req.eng]/3</h3>
! <p><b>Section:</b> 26.5.1.4 [rand.req.eng] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req.eng">issues</a> in [rand.req.eng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The 3rd table row in 26.5.1.4 [rand.req.eng]/3 requires random number engines to accept any 
*************** type of numbers returned.
*** 18601,18607 ****
  </p>
  
  <p>
! <b>Posible resolution:</b> I propose to change the wording to a version similar to "Creates an 
  engine with initial state determined by <tt>static_cast&lt;UintType&gt;(s)</tt>, where <tt>UintType</tt> is an 
  implementation specific unsigned integer type."
  </p>
--- 16924,16930 ----
  </p>
  
  <p>
! <b>Possible resolution:</b> I propose to change the wording to a version similar to "Creates an 
  engine with initial state determined by <tt>static_cast&lt;UintType&gt;(s)</tt>, where <tt>UintType</tt> is an 
  implementation specific unsigned integer type."
  </p>
*************** Bellevue:
*** 18649,18657 ****
  ]</i></p>
  
  
! <blockquote>
  Propose close NAD for the reasons given in N2424.
! </blockquote>
  
  
  
--- 16972,16980 ----
  ]</i></p>
  
  
! <blockquote><p>
  Propose close NAD for the reasons given in N2424.
! </p></blockquote>
  
  
  
*************** Stephan Tolksdorf adds pre-Bellevue:
*** 18672,18690 ****
  Change row 3 of table 105 "Random number engine requirements" in 26.5.1.4 [rand.req.eng]/3
  </p>
  
! <blockquote>
  Creates an engine with initial state determined by
  <tt><del>static_cast&lt;X::result_type&gt;(</del>s<del>)</del></tt>
! </blockquote>
  
  <p>
  Similarly, change 26.5.1.5 [rand.req.adapt]/3 e)
  </p>
  
! <blockquote>
  When <tt>X::X</tt> is invoked with <del>an <tt>X::result_type</tt></del> value <tt>s</tt>
  <ins>of arithmetic type (3.9.1)</ins>, ...
! </blockquote>
  
  </blockquote>
  
--- 16995,17013 ----
  Change row 3 of table 105 "Random number engine requirements" in 26.5.1.4 [rand.req.eng]/3
  </p>
  
! <blockquote><p>
  Creates an engine with initial state determined by
  <tt><del>static_cast&lt;X::result_type&gt;(</del>s<del>)</del></tt>
! </p></blockquote>
  
  <p>
  Similarly, change 26.5.1.5 [rand.req.adapt]/3 e)
  </p>
  
! <blockquote><p>
  When <tt>X::X</tt> is invoked with <del>an <tt>X::result_type</tt></del> value <tt>s</tt>
  <ins>of arithmetic type (3.9.1)</ins>, ...
! </p></blockquote>
  
  </blockquote>
  
*************** When <tt>X::X</tt> is invoked with <del>
*** 18695,18703 ****
  
  <hr>
  <h3><a name="730"></a>730. Comment on [rand.req.adapt]/3 e)</h3>
! <p><b>Section:</b> 26.5.1.5 [rand.req.adapt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  If an engine adaptor is invoked with an argument of type <tt>seed_seq</tt>, then all base 
--- 17018,17026 ----
  
  <hr>
  <h3><a name="730"></a>730. Comment on [rand.req.adapt]/3 e)</h3>
! <p><b>Section:</b> 26.5.1.5 [rand.req.adapt] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  If an engine adaptor is invoked with an argument of type <tt>seed_seq</tt>, then all base 
*************** Bellevue:
*** 18724,18732 ****
  ]</i></p>
  
  
! <blockquote>
  Close NAD for the reasons given in N2424.
! </blockquote>
  
  
  
--- 17047,17055 ----
  ]</i></p>
  
  
! <blockquote><p>
  Close NAD for the reasons given in N2424.
! </p></blockquote>
  
  
  
*************** for the proposed resolution.
*** 18742,18751 ****
  
  <hr>
  <h3><a name="731"></a>731. proposal for a customizable <tt>seed_seq</tt></h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The proper way to seed random number engines seems to be the most frequently 
--- 17065,17074 ----
  
  <hr>
  <h3><a name="731"></a>731. proposal for a customizable <tt>seed_seq</tt></h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The proper way to seed random number engines seems to be the most frequently 
*************** changes:
*** 18764,18770 ****
  <b>Possible resolution:</b>
  </p>
  
! <ol type="a">
  <li>
  Turn the interface specification of 26.5.7.1 [rand.util.seedseq]/2 into a "SeedSeq" requirement, where the 
  exact behaviour of the constructors and the randomize method are left unspecified and where the
--- 17087,17093 ----
  <b>Possible resolution:</b>
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  Turn the interface specification of 26.5.7.1 [rand.util.seedseq]/2 into a "SeedSeq" requirement, where the 
  exact behaviour of the constructors and the randomize method are left unspecified and where the
*************** Provide the class <tt>seed_seq</tt> as a
*** 18778,18788 ****
  <p>
  Supplement the <tt>seed_seq</tt> with a traits class
  </p>
! <blockquote><pre>template &lt;typename T&gt; 
  struct is_seed_seq { static const bool value = false; }
  </pre></blockquote>
  <p>and the specialization</p>
! <blockquote><pre>template &lt;&gt; 
  struct is_seed_seq&lt;seed_seq&gt; { static const bool value = true; }
  </pre></blockquote>
  <p>which users can supplement with further specializations.</p>
--- 17101,17113 ----
  <p>
  Supplement the <tt>seed_seq</tt> with a traits class
  </p>
! <blockquote><pre>
! template &lt;typename T&gt; 
  struct is_seed_seq { static const bool value = false; }
  </pre></blockquote>
  <p>and the specialization</p>
! <blockquote><pre>
! template &lt;&gt; 
  struct is_seed_seq&lt;seed_seq&gt; { static const bool value = true; }
  </pre></blockquote>
  <p>which users can supplement with further specializations.</p>
*************** Bellevue:
*** 18799,18808 ****
  ]</i></p>
  
  
! <blockquote>
  See N2424. Close NAD but note that "conceptizing" the library may cause
  this problem to be solved by that route.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 17124,17133 ----
  ]</i></p>
  
  
! <blockquote><p>
  See N2424. Close NAD but note that "conceptizing" the library may cause
  this problem to be solved by that route.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** for the proposed resolution.
*** 18816,18899 ****
  
  
  <hr>
- <h3><a name="732"></a>732. Defect in [rand.dist.samp.genpdf]</h3>
- <p><b>Section:</b> X [rand.dist.samp.genpdf] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.genpdf">issues</a> in [rand.dist.samp.genpdf].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#795">795</a></p>
- <p><b>Discussion:</b></p>
- <p>
- X [rand.dist.samp.genpdf] describes the interface for a distribution template that is 
- meant to simulate random numbers from any general distribution given only the density and the 
- support of the distribution. I'm not aware of any general purpose algorithm that would be capable 
- of correctly and efficiently implementing the described functionality. From what I know, this is 
- essentially an unsolved research problem. Existing algorithms either require more knowledge 
- about the distribution and the problem domain or work only under very limited circumstances. 
- Even the state of the art special purpose library UNU.RAN does not solve the problem in full 
- generality, and in any case, testing and customer support for such a library feature would be a 
- nightmare.
- </p>
- 
- <p>
- <b>Possible resolution:</b> For these reasons, I propose to delete section X [rand.dist.samp.genpdf].
- </p>
- 
- <p><i>[
- Bellevue:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Disagreement persists.
- </p>
- <p>
- Objection to this issue is that this function takes a general functor.
- The general approach would be to normalize this function, integrate it,
- and take the inverse of the integral, which is not possible in general.
- An example function is sin(1+n*x) -- for any spatial frequency that the
- implementor chooses, there is a value of n that renders that choice
- arbitrarily erroneous.
- </p>
- <p>
- Correction: The formula above should instead read 1+sin(n*x).
- </p>
- <p>
- Objector proposes the following possible compromise positions:
- </p>
- <ul>
- <li>
- rand.dist.samp.genpdf takes an number of points so that implementor need not guess.
- </li>
- <li>
- replace rand.disk.samp.genpdf with an extension to either or both of the discrete functions to take arguments that take a functor and number of points in place of the list of probabilities. Reference issues 793 and 794.
- </li>
- </ul>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2813.pdf">N2813</a>
- for the proposed resolution.
- </p>
- 
- 
- <p><b>Rationale:</b></p>
- Addressed by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="733"></a>733. Comment on [rand.req.dist]/9</h3>
! <p><b>Section:</b> 26.5.1.6 [rand.req.dist] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirement "P shall have a declaration of the form <tt>typedef X distribution_- 
--- 17141,17150 ----
  
  
  <hr>
  <h3><a name="733"></a>733. Comment on [rand.req.dist]/9</h3>
! <p><b>Section:</b> 26.5.1.6 [rand.req.dist] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirement "P shall have a declaration of the form <tt>typedef X distribution_- 
*************** Bellevue:
*** 18914,18922 ****
  ]</i></p>
  
  
! <blockquote>
  Close NAD for the reasons given in N2424. In practice it is not inconvenient to meet these requirements.
! </blockquote>
  
  
  
--- 17165,17173 ----
  ]</i></p>
  
  
! <blockquote><p>
  Close NAD for the reasons given in N2424. In practice it is not inconvenient to meet these requirements.
! </p></blockquote>
  
  
  
*************** for the proposed resolution.
*** 18932,18940 ****
  
  <hr>
  <h3><a name="735"></a>735. Unfortunate naming</h3>
! <p><b>Section:</b> 26.5.8.2.2 [rand.dist.bern.bin], 26.5.8.2.4 [rand.dist.bern.negbin] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In my opinion the choice of name for the <tt>t</tt> parameter of the <tt>binomial_distribution</tt>
--- 17183,17191 ----
  
  <hr>
  <h3><a name="735"></a>735. Unfortunate naming</h3>
! <p><b>Section:</b> 26.5.8.3.2 [rand.dist.bern.bin], 26.5.8.3.4 [rand.dist.bern.negbin] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In my opinion the choice of name for the <tt>t</tt> parameter of the <tt>binomial_distribution</tt>
*************** Bellevue:
*** 18964,18973 ****
  ]</i></p>
  
  
! <blockquote>
  In N2424. NAD It has been around for a while. It is hardly universal,
  there is prior art, and this would confuse people.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 17215,17224 ----
  ]</i></p>
  
  
! <blockquote><p>
  In N2424. NAD It has been around for a while. It is hardly universal,
  there is prior art, and this would confuse people.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** for the proposed resolution.
*** 18982,18993 ****
  
  <hr>
  <h3><a name="736"></a>736. Comment on [rand.dist.samp.discrete]</h3>
! <p><b>Section:</b> 26.5.8.5.1 [rand.dist.samp.discrete] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.discrete">issues</a> in [rand.dist.samp.discrete].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <ol type="a">
  <li>
  The specification for <tt>discrete_distribution</tt> requires the member <tt>probabilities()</tt>
  to return a vector of <i>standardized</i> probabilities, which forces the implementation every time to 
--- 17233,17244 ----
  
  <hr>
  <h3><a name="736"></a>736. Comment on [rand.dist.samp.discrete]</h3>
! <p><b>Section:</b> 26.5.8.6.1 [rand.dist.samp.discrete] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.discrete">issues</a> in [rand.dist.samp.discrete].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <ol style="list-style-type:lower-alpha">
  <li>
  The specification for <tt>discrete_distribution</tt> requires the member <tt>probabilities()</tt>
  to return a vector of <i>standardized</i> probabilities, which forces the implementation every time to 
*************** Stephan Tolksdorf adds pre-Bellevue:
*** 19079,19085 ****
  
  <blockquote>
  <p>
! In 26.5.8.5.1 [rand.dist.samp.discrete]:
  </p>
  
  <p>
--- 17330,17336 ----
  
  <blockquote>
  <p>
! In 26.5.8.6.1 [rand.dist.samp.discrete]:
  </p>
  
  <p>
*************** Proposed wording a):
*** 19088,19111 ****
  
  <blockquote>
  <p>
! Changae in para. 2
  </p>
  
! <blockquote>
  Constructs a <tt>discrete_distribution</tt> object with <tt>n=1</tt> and <tt>p<sub>0</sub> <ins>= w<sub>0</sub></ins> = 1</tt>
! </blockquote>
  
  <p>
  and change in para. 5
  </p>
  
! <blockquote>
  <i>Returns:</i> A <tt>vector&lt;double&gt;</tt> whose <tt>size</tt> member returns <tt>n</tt> and whose
  <tt>operator[]</tt> member returns <del><tt>p<sub>k</sub></tt></del>
  <ins>the weight <tt>w<sub>k</sub></tt> as a double value</ins>
  when invoked with argument <tt>k</tt> for <tt>k = 0,
  ..., n-1</tt>
! </blockquote>
  
  </blockquote>
  
--- 17339,17362 ----
  
  <blockquote>
  <p>
! Change in para. 2
  </p>
  
! <blockquote><p>
  Constructs a <tt>discrete_distribution</tt> object with <tt>n=1</tt> and <tt>p<sub>0</sub> <ins>= w<sub>0</sub></ins> = 1</tt>
! </p></blockquote>
  
  <p>
  and change in para. 5
  </p>
  
! <blockquote><p>
  <i>Returns:</i> A <tt>vector&lt;double&gt;</tt> whose <tt>size</tt> member returns <tt>n</tt> and whose
  <tt>operator[]</tt> member returns <del><tt>p<sub>k</sub></tt></del>
  <ins>the weight <tt>w<sub>k</sub></tt> as a double value</ins>
  when invoked with argument <tt>k</tt> for <tt>k = 0,
  ..., n-1</tt>
! </p></blockquote>
  
  </blockquote>
  
*************** Proposed wording b):
*** 19118,19124 ****
  Change in para. 3:
  </p>
  
! <blockquote>
  If <tt>firstW == lastW</tt>, let the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist
  of the single value <tt>w<sub>0</sub> = 1</tt>. Otherwise, <tt>[firstW,lastW)</tt> shall form a
  sequence <tt>w</tt> of length <tt>n <del>&gt; 0</del></tt> 
--- 17369,17375 ----
  Change in para. 3:
  </p>
  
! <blockquote><p>
  If <tt>firstW == lastW</tt>, let the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist
  of the single value <tt>w<sub>0</sub> = 1</tt>. Otherwise, <tt>[firstW,lastW)</tt> shall form a
  sequence <tt>w</tt> of length <tt>n <del>&gt; 0</del></tt> 
*************** sequence <tt>w</tt> of length <tt>n <del
*** 19126,19132 ****
  and <tt>*firstW</tt> shall yield a value <tt>w<sub>0</sub></tt>
  convertible to <tt>double</tt>. [<i>Note:</i> The values <tt>w<sub>k</sub></tt> are commonly known
  as the weights . <i>-- end note</i>]
! </blockquote>
  
  </blockquote>
  
--- 17377,17383 ----
  and <tt>*firstW</tt> shall yield a value <tt>w<sub>0</sub></tt>
  convertible to <tt>double</tt>. [<i>Note:</i> The values <tt>w<sub>k</sub></tt> are commonly known
  as the weights . <i>-- end note</i>]
! </p></blockquote>
  
  </blockquote>
  
*************** as the weights . <i>-- end note</i>]
*** 19138,19149 ****
  
  <hr>
  <h3><a name="737"></a>737. Comment on [rand.dist.samp.pconst]</h3>
! <p><b>Section:</b> 26.5.8.5.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <ol type="a">
  <li>
  The discussion in point T11 above regarding <tt>probabilities()</tt> similarly applies 
  to the method <tt>densities()</tt> of <tt>piecewise_constant_distribution</tt>.
--- 17389,17400 ----
  
  <hr>
  <h3><a name="737"></a>737. Comment on [rand.dist.samp.pconst]</h3>
! <p><b>Section:</b> 26.5.8.6.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <ol style="list-style-type:lower-alpha">
  <li>
  The discussion in point T11 above regarding <tt>probabilities()</tt> similarly applies 
  to the method <tt>densities()</tt> of <tt>piecewise_constant_distribution</tt>.
*************** to the method <tt>densities()</tt> of <t
*** 19152,19158 ****
  <p>
  The design of the constructor
  </p>
! <blockquote><pre>template &lt;class InputIteratorB, class InputIteratorW&gt; 
  piecewise_constant_distribution( InputIteratorB firstB, InputIteratorB lastB, 
                                   InputIteratorW firstW);
  </pre></blockquote>
--- 17403,17410 ----
  <p>
  The design of the constructor
  </p>
! <blockquote><pre>
! template &lt;class InputIteratorB, class InputIteratorW&gt; 
  piecewise_constant_distribution( InputIteratorB firstB, InputIteratorB lastB, 
                                   InputIteratorW firstW);
  </pre></blockquote>
*************** interface, in particular the risk that i
*** 19172,19191 ****
  Stephan Tolksdorf adds pre-Bellevue:
  ]</i></p>
  
! <blockquote>
  In reply to the discussion in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2424.pdf">N2424</a>
! I'd like to make the same comments as for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#736">736</a>.
! </blockquote>
  
  <p><i>[
  Bellevue:
  ]</i></p>
  
  
! <blockquote>
  In N2424. There is already precedent elsewhere in the library. Follows existing convention. NAD.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 17424,17443 ----
  Stephan Tolksdorf adds pre-Bellevue:
  ]</i></p>
  
! <blockquote><p>
  In reply to the discussion in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2424.pdf">N2424</a>
! I'd like to make the same comments as for <a href="lwg-closed.html#736">736</a>.
! </p></blockquote>
  
  <p><i>[
  Bellevue:
  ]</i></p>
  
  
! <blockquote><p>
  In N2424. There is already precedent elsewhere in the library. Follows existing convention. NAD.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Stephan Tolksdorf adds pre-Bellevue:
*** 19201,19207 ****
  
  <blockquote>
  <p>
! In 26.5.8.5.2 [rand.dist.samp.pconst]:
  </p>
  
  <p>
--- 17453,17459 ----
  
  <blockquote>
  <p>
! In 26.5.8.6.2 [rand.dist.samp.pconst]:
  </p>
  
  <p>
*************** Proposed wording a)
*** 19212,19232 ****
  <p>
  Change in para. 2
  </p>
! <blockquote>
  Constructs a <tt>piecewise_constant_distribution</tt> object with <tt>n = 1</tt>, <tt>p<sub>0</sub> <ins>= w<sub>0</sub></ins> = 1</tt>,
  <tt>b<sub>0</sub> = 0</tt>, and <tt>b<sub>1</sub> = 1</tt>
! </blockquote>
  
  <p>
  and change in para. 5
  </p>
  
! <blockquote>
  A <tt>vector&lt;result_type&gt;</tt> whose <tt>size</tt> member returns <tt>n</tt> and whose <tt>operator[]</tt>
  member returns <del><tt>p<sub>k</sub></tt></del>
  <ins>the weight <tt>w<sub>k</sub></tt> as a double value</ins>
  when invoked with argument <tt>k</tt> for <tt>k = 0, ..., n-1</tt>
! </blockquote>
  
  </blockquote>
  
--- 17464,17484 ----
  <p>
  Change in para. 2
  </p>
! <blockquote><p>
  Constructs a <tt>piecewise_constant_distribution</tt> object with <tt>n = 1</tt>, <tt>p<sub>0</sub> <ins>= w<sub>0</sub></ins> = 1</tt>,
  <tt>b<sub>0</sub> = 0</tt>, and <tt>b<sub>1</sub> = 1</tt>
! </p></blockquote>
  
  <p>
  and change in para. 5
  </p>
  
! <blockquote><p>
  A <tt>vector&lt;result_type&gt;</tt> whose <tt>size</tt> member returns <tt>n</tt> and whose <tt>operator[]</tt>
  member returns <del><tt>p<sub>k</sub></tt></del>
  <ins>the weight <tt>w<sub>k</sub></tt> as a double value</ins>
  when invoked with argument <tt>k</tt> for <tt>k = 0, ..., n-1</tt>
! </p></blockquote>
  
  </blockquote>
  
*************** Proposed wording b)
*** 19239,19260 ****
  Change both occurrences of
  </p>
  
! <blockquote>
  "piecewise_constant_distribution(InputIteratorB firstB, InputIteratorB lastB,
                                   InputIteratorW firstW<ins>, InputIteratorW lastW</ins>)
! </blockquote>
  
  <p>
  and change in para. 3
  </p>
  
! <blockquote>
  <del>the length of the sequence <tt>w</tt> starting from <tt>firstW</tt> shall be at least <tt>n</tt>,
  <tt>*firstW</tt> shall return a value <tt>w<sub>0</sub></tt> that is convertible to <tt>double</tt>, and any
  <tt>w<sub>k</sub></tt> for <tt>k &gt;= n</tt> shall be ignored by the distribution</del>
  <ins><tt>[firstW, lastW)</tt> shall form a sequence <tt>w</tt> of length <tt>n</tt> whose leading element
  <tt>w<sub>0</sub></tt> shall be convertible to <tt>double</tt></ins>
! </blockquote>
  
  </blockquote>
  
--- 17491,17512 ----
  Change both occurrences of
  </p>
  
! <blockquote><pre>
  "piecewise_constant_distribution(InputIteratorB firstB, InputIteratorB lastB,
                                   InputIteratorW firstW<ins>, InputIteratorW lastW</ins>)
! </pre></blockquote>
  
  <p>
  and change in para. 3
  </p>
  
! <blockquote><p>
  <del>the length of the sequence <tt>w</tt> starting from <tt>firstW</tt> shall be at least <tt>n</tt>,
  <tt>*firstW</tt> shall return a value <tt>w<sub>0</sub></tt> that is convertible to <tt>double</tt>, and any
  <tt>w<sub>k</sub></tt> for <tt>k &gt;= n</tt> shall be ignored by the distribution</del>
  <ins><tt>[firstW, lastW)</tt> shall form a sequence <tt>w</tt> of length <tt>n</tt> whose leading element
  <tt>w<sub>0</sub></tt> shall be convertible to <tt>double</tt></ins>
! </p></blockquote>
  
  </blockquote>
  
*************** and change in para. 3
*** 19268,19277 ****
  
  <hr>
  <h3><a name="738"></a>738. Editorial issue in [rand.adapt.disc]/3</h3>
! <p><b>Section:</b> 26.5.4.1 [rand.adapt.disc] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.adapt.disc">issues</a> in [rand.adapt.disc].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Since the template parameter <tt>p</tt> and <tt>r</tt> are of type <tt>size_t</tt>, the member <tt>n</tt> in the class 
--- 17520,17529 ----
  
  <hr>
  <h3><a name="738"></a>738. Editorial issue in [rand.adapt.disc]/3</h3>
! <p><b>Section:</b> 26.5.4.2 [rand.adapt.disc] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.adapt.disc">issues</a> in [rand.adapt.disc].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Since the template parameter <tt>p</tt> and <tt>r</tt> are of type <tt>size_t</tt>, the member <tt>n</tt> in the class 
*************** for the proposed resolution.
*** 19291,19300 ****
  
  <hr>
  <h3><a name="739"></a>739. Defect in [rand.util.canonical]/3</h3>
! <p><b>Section:</b> 26.5.7.2 [rand.util.canonical] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.canonical">issues</a> in [rand.util.canonical].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity of <tt>generate_canonical</tt> is specified to be "exactly k=max(1, ceil(b/log2 
--- 17543,17552 ----
  
  <hr>
  <h3><a name="739"></a>739. Defect in [rand.util.canonical]/3</h3>
! <p><b>Section:</b> 26.5.7.2 [rand.util.canonical] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.canonical">issues</a> in [rand.util.canonical].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity of <tt>generate_canonical</tt> is specified to be "exactly k=max(1, ceil(b/log2 
*************** Bellevue:
*** 19313,19321 ****
  ]</i></p>
  
  
! <blockquote>
  In N2424. Close NAD as described there.
! </blockquote>
  
  
  
--- 17565,17573 ----
  ]</i></p>
  
  
! <blockquote><p>
  In N2424. Close NAD as described there.
! </p></blockquote>
  
  
  
*************** for the proposed resolution.
*** 19331,19340 ****
  
  <hr>
  <h3><a name="741"></a>741. Const-incorrect <tt>get_deleter</tt> function for <tt>shared_ptr</tt></h3>
! <p><b>Section:</b> 20.9.10.2.11 [util.smartptr.getdeleter] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-09-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.getdeleter">issues</a> in [util.smartptr.getdeleter].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The following issue was raised by Alf P. Steinbach in c.l.c++.mod:
--- 17583,17592 ----
  
  <hr>
  <h3><a name="741"></a>741. Const-incorrect <tt>get_deleter</tt> function for <tt>shared_ptr</tt></h3>
! <p><b>Section:</b> 20.8.2.2.10 [util.smartptr.getdeleter] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-09-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.getdeleter">issues</a> in [util.smartptr.getdeleter].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The following issue was raised by Alf P. Steinbach in c.l.c++.mod:
*************** The following issue was raised by Alf P.
*** 19342,19351 ****
  
  <p>
  According to the recent draft N2369, both the header memory synopsis
! of 20.9 [memory] and 20.9.10.2.11 [util.smartptr.getdeleter] declare:
  </p>
  
! <blockquote><pre>template&lt;class D, class T&gt; D* get_deleter(shared_ptr&lt;T&gt; const&amp; p);
  </pre></blockquote>
  
  <p>
--- 17594,17604 ----
  
  <p>
  According to the recent draft N2369, both the header memory synopsis
! of 20.7 [memory] and 20.8.2.2.10 [util.smartptr.getdeleter] declare:
  </p>
  
! <blockquote><pre>
! template&lt;class D, class T&gt; D* get_deleter(shared_ptr&lt;T&gt; const&amp; p);
  </pre></blockquote>
  
  <p>
*************** the mutability of the owner (as seen for
*** 19357,19381 ****
  <tt>unique_ptr::get_deleter</tt>).
  Even the next similar counter-part of <tt>get_deleter</tt> - the two
  overloads of <tt>function::target</tt> in the class template function
! synopsis 20.8.14.2 [func.wrap.func] or in 20.8.14.2.5 [func.wrap.func.targ] - do
  properly mirror the const-state of the owner.
  </p>
  
! <b>Possible proposed resolutions:</b>
  
  <p>
  Replace the declarations of <tt>get_deleter</tt> in the header <tt>&lt;memory&gt;</tt>
! synopsis of 20.9 [memory] and in 20.9.10.2.11 [util.smartptr.getdeleter] by one of the
  following alternatives (A) or (B):
  </p>
  
! <ol type="A">
  <li>
  Provide <b>only</b> the immutable variant. This would reflect the
  current praxis of <tt>container::get_allocator()</tt>, <tt>map::key_comp()</tt>, or
  <tt>map::value_comp</tt>.
  
! <blockquote><pre>template&lt;class D, class T&gt; const D* get_deleter(shared_ptr&lt;T&gt; const&amp; p);
  </pre></blockquote>
  </li>
  <li>
--- 17610,17635 ----
  <tt>unique_ptr::get_deleter</tt>).
  Even the next similar counter-part of <tt>get_deleter</tt> - the two
  overloads of <tt>function::target</tt> in the class template function
! synopsis 20.9.12.2 [func.wrap.func] or in 20.9.12.2.5 [func.wrap.func.targ] - do
  properly mirror the const-state of the owner.
  </p>
  
! <p><b>Possible proposed resolutions:</b></p>
  
  <p>
  Replace the declarations of <tt>get_deleter</tt> in the header <tt>&lt;memory&gt;</tt>
! synopsis of 20.7 [memory] and in 20.8.2.2.10 [util.smartptr.getdeleter] by one of the
  following alternatives (A) or (B):
  </p>
  
! <ol style="list-style-type:upper-alpha">
  <li>
  Provide <b>only</b> the immutable variant. This would reflect the
  current praxis of <tt>container::get_allocator()</tt>, <tt>map::key_comp()</tt>, or
  <tt>map::value_comp</tt>.
  
! <blockquote><pre>
! template&lt;class D, class T&gt; const D* get_deleter(shared_ptr&lt;T&gt; const&amp; p);
  </pre></blockquote>
  </li>
  <li>
*************** Just remove the function.
*** 19387,19398 ****
  Alberto Ganesh Barbati adds:
  </p>
  
! <ol type="A" start="3">
  <li>
  <p>
  Replace it with two functions:
  </p>
! <blockquote><pre>template &lt;class D, class T&gt; D get_deleter(shared_ptr&lt;T&gt; const&amp;);
  template &lt;class D, class T&gt; bool has_deleter(shared_ptr&lt;T&gt; const&amp;);
  </pre></blockquote>
  
--- 17641,17653 ----
  Alberto Ganesh Barbati adds:
  </p>
  
! <ol style="list-style-type:upper-alpha" start="3">
  <li>
  <p>
  Replace it with two functions:
  </p>
! <blockquote><pre>
! template &lt;class D, class T&gt; D get_deleter(shared_ptr&lt;T&gt; const&amp;);
  template &lt;class D, class T&gt; bool has_deleter(shared_ptr&lt;T&gt; const&amp;);
  </pre></blockquote>
  
*************** Bellevue:
*** 19420,19428 ****
  ]</i></p>
  
  
! <blockquote>
  Concern this is similar to confusing "pointer to const" with "a constant pointer".
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 17675,17683 ----
  ]</i></p>
  
  
! <blockquote><p>
  Concern this is similar to confusing "pointer to const" with "a constant pointer".
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Concern this is similar to confusing "po
*** 19435,19445 ****
  
  <hr>
  <h3><a name="745"></a>745. copy_exception API slices.</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It could be I did not understand the design rationale, but I thought
--- 17690,17699 ----
  
  <hr>
  <h3><a name="745"></a>745. copy_exception API slices.</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It could be I did not understand the design rationale, but I thought
*************** slicing involved.
*** 19478,19487 ****
  
  <hr>
  <h3><a name="747"></a>747. We have 3 separate type traits to identify classes supporting no-throw operations</h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  We have 3 separate type traits to identify classes supporting no-throw
--- 17732,17742 ----
  
  <hr>
  <h3><a name="747"></a>747. We have 3 separate type traits to identify classes supporting no-throw operations</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  We have 3 separate type traits to identify classes supporting no-throw
*************** What level of magic do we expect to dedu
*** 19501,19507 ****
  E.g.
  </p>
  
! <blockquote><pre>struct test{
   int x;
   test() : x() {}
  };
--- 17756,17763 ----
  E.g.
  </p>
  
! <blockquote><pre>
! struct test{
   int x;
   test() : x() {}
  };
*************** Bellevue:
*** 19535,19545 ****
  ]</i></p>
  
  
! <blockquote>
  This looks like a QoI issue.
  In the case of trivial and nothrow it is known. Static analysis of the program is definitely into QoI.
  Move to OPEN. Need to talk to Core about this.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 17791,17801 ----
  ]</i></p>
  
  
! <blockquote><p>
  This looks like a QoI issue.
  In the case of trivial and nothrow it is known. Static analysis of the program is definitely into QoI.
  Move to OPEN. Need to talk to Core about this.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** Move to NAD.
*** 19566,19575 ****
  
  <hr>
  <h3><a name="748"></a>748. The is_abstract type trait is defined by reference to 10.4.</h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I am trying to decide is a pure virtual function is a <i>necessary</i> as well as
--- 17822,17832 ----
  
  <hr>
  <h3><a name="748"></a>748. The is_abstract type trait is defined by reference to 10.4.</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I am trying to decide is a pure virtual function is a <i>necessary</i> as well as
*************** sufficient requirement to be classified
*** 19578,19584 ****
  <p>
  For instance, is the following (non-polymorphic) type considered abstract?
  </p>
! <blockquote><pre>struct abstract {
  protected:
   abstract(){}
   abstract( abstract const &amp; ) {}
--- 17835,17842 ----
  <p>
  For instance, is the following (non-polymorphic) type considered abstract?
  </p>
! <blockquote><pre>
! struct abstract {
  protected:
   abstract(){}
   abstract( abstract const &amp; ) {}
*************** Core has clarified that the definition a
*** 19603,19613 ****
  <hr>
  <h3><a name="750"></a>750. The current definition for <tt>is_convertible</tt> requires that the type be
  implicitly convertible, so explicit constructors are ignored.</h3>
! <p><b>Section:</b> 20.7.6 [meta.rel] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.rel">issues</a> in [meta.rel].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a></p>
  <p><b>Discussion:</b></p>
  <p>
  With the pending arrival of explicit conversion functions though, I'm
--- 17861,17871 ----
  <hr>
  <h3><a name="750"></a>750. The current definition for <tt>is_convertible</tt> requires that the type be
  implicitly convertible, so explicit constructors are ignored.</h3>
! <p><b>Section:</b> 20.10.6 [meta.rel] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.rel">issues</a> in [meta.rel].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#719">719</a></p>
  <p><b>Discussion:</b></p>
  <p>
  With the pending arrival of explicit conversion functions though, I'm
*************** Bellevue:
*** 19619,19639 ****
  ]</i></p>
  
  
! <blockquote>
  Alisdair is considering preparing a paper listing a number of missing
  type traits, and feels that it might be useful to handle them all
  together rather than piecemeal. This would affect issue 719 and 750.
  These two issues should move to OPEN pending AM paper on type traits.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
! Duplicate of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a> (for our purposes).
! </blockquote>
  
  <p><i>[
  Addressed in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2947.html">N2947</a>.
--- 17877,17897 ----
  ]</i></p>
  
  
! <blockquote><p>
  Alisdair is considering preparing a paper listing a number of missing
  type traits, and feels that it might be useful to handle them all
  together rather than piecemeal. This would affect issue 719 and 750.
  These two issues should move to OPEN pending AM paper on type traits.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
! Duplicate of <a href="lwg-defects.html#719">719</a> (for our purposes).
! </p></blockquote>
  
  <p><i>[
  Addressed in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2947.html">N2947</a>.
*************** Addressed in <a href="http://www.open-st
*** 19651,19663 ****
  
  <hr>
  <h3><a name="751"></a>751. change pass-by-reference members of <tt>vector&lt;bool&gt;</tt> to pass-by-value?</h3>
! <p><b>Section:</b> 23.4.2 [vector.bool] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! A number of vector&lt;bool&gt; members take const bool&amp; as arguments.
  Is there any chance we could change them to pass-by-value or would I 
  be wasting everyone's time if wrote up an issue?
  </p>
--- 17909,17921 ----
  
  <hr>
  <h3><a name="751"></a>751. change pass-by-reference members of <tt>vector&lt;bool&gt;</tt> to pass-by-value?</h3>
! <p><b>Section:</b> 23.3.7 [vector.bool] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! A number of <tt>vector&lt;bool&gt;</tt> members take const bool&amp; as arguments.
  Is there any chance we could change them to pass-by-value or would I 
  be wasting everyone's time if wrote up an issue?
  </p>
*************** Many in the group feel that for vector&l
*** 19683,19689 ****
  and that at this point in the process it's not worth the bandwidth.
  </p>
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a> -- which was in ready status pre-Bellevue and is
  now in the working paper -- is related to this, though not a duplicate.
  </p>
  <p>
--- 17941,17947 ----
  and that at this point in the process it's not worth the bandwidth.
  </p>
  <p>
! Issue <a href="lwg-defects.html#679">679</a> -- which was in ready status pre-Bellevue and is
  now in the working paper -- is related to this, though not a duplicate.
  </p>
  <p>
*************** Howard:  Haven't yet opened new issue.
*** 19718,19726 ****
  ]</i></p>
  
  
! <blockquote>
  NAD.  Insufficient motivation to make any changes.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 17976,17984 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD.  Insufficient motivation to make any changes.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** NAD.  Insufficient motivation to make an
*** 19733,19749 ****
  
  <hr>
  <h3><a name="754"></a>754. Ambiguous return clause for <tt>std::uninitialized_copy</tt></h3>
! <p><b>Section:</b> 20.9.8.2 [uninitialized.copy] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-10-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#uninitialized.copy">issues</a> in [uninitialized.copy].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  14882-2003, [lib.uninitialized.copy] is currently written as follows:
  </p>
  
  <blockquote>
! <pre>template &lt;class InputIterator, class ForwardIterator&gt;
    ForwardIterator uninitialized_copy(InputIterator <i>first</i>, InputIterator <i>last</i>,
                                       ForwardIterator <i>result</i>);
  </pre>
--- 17991,18008 ----
  
  <hr>
  <h3><a name="754"></a>754. Ambiguous return clause for <tt>std::uninitialized_copy</tt></h3>
! <p><b>Section:</b> 20.7.12.2 [uninitialized.copy] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-10-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#uninitialized.copy">issues</a> in [uninitialized.copy].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  14882-2003, [lib.uninitialized.copy] is currently written as follows:
  </p>
  
  <blockquote>
! <pre>
! template &lt;class InputIterator, class ForwardIterator&gt;
    ForwardIterator uninitialized_copy(InputIterator <i>first</i>, InputIterator <i>last</i>,
                                       ForwardIterator <i>result</i>);
  </pre>
*************** NAD.  Insufficient motivation to make an
*** 19751,19757 ****
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>for (; first != last; ++result, ++first)
    new (static_cast&lt;void*&gt;(&amp;*result))
      typename iterator_traits&lt;ForwardIterator&gt;::value_type(*first);
  </pre></blockquote>
--- 18010,18017 ----
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>
! for (; first != last; ++result, ++first)
    new (static_cast&lt;void*&gt;(&amp;*result))
      typename iterator_traits&lt;ForwardIterator&gt;::value_type(*first);
  </pre></blockquote>
*************** NAD.  Insufficient motivation to make an
*** 19763,19769 ****
  
  <p>
  similarily for N2369, and its corresponding section
! 20.9.8.2 [uninitialized.copy].
  </p>
  
  <p>
--- 18023,18029 ----
  
  <p>
  similarily for N2369, and its corresponding section
! 20.7.12.2 [uninitialized.copy].
  </p>
  
  <p>
*************** two
*** 19772,19778 ****
  possible interpretations:
  </p>
  
! <ol type="a">
  <li>
  The notion of <tt><i>result</i></tt> is supposed to mean the value given by the
  function parameter <tt><i>result</i></tt> [Note to the issue editor: Please use italics for
--- 18032,18038 ----
  possible interpretations:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  The notion of <tt><i>result</i></tt> is supposed to mean the value given by the
  function parameter <tt><i>result</i></tt> [Note to the issue editor: Please use italics for
*************** for <tt>std::copy</tt>.
*** 19811,19817 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the wording of the return clause to say (20.9.8.2 [uninitialized.copy]):
  </p>
  
  <blockquote>
--- 18071,18077 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the wording of the return clause to say (20.7.12.2 [uninitialized.copy]):
  </p>
  
  <blockquote>
*************** Bellevue:
*** 19826,19970 ****
  ]</i></p>
  
  
! <blockquote>
  Resolution: NAD editorial -- project editor to decide if change is
  worthwhile. Concern is that there are many other places this might
  occur.
! </blockquote>
! 
! 
! 
! 
! <hr>
! <h3><a name="756"></a>756. Container adaptors push</h3>
! <p><b>Section:</b> 23.5 [container.adaptors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2007-10-31 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! After n2369 we have a single <tt>push_back</tt> overload in the sequence containers,
! of the "emplace" type. At variance with that, still in n2461, we have
! two separate overloads, the C++03 one + one taking an rvalue reference
! in the container adaptors. Therefore, simply from a consistency point of
! view, I was wondering whether the container adaptors should be aligned
! with the specifications of the sequence container themselves: thus have
! a single <tt>push</tt> along the lines:
! </p>
! 
! <blockquote><pre>template&lt;typename... _Args&gt;
! void
! push(_Args&amp;&amp;... __args)
!   { c.push_back(std::forward&lt;_Args&gt;(__args)...); }
! </pre></blockquote>
! 
! <p><i>[
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>
! ]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Change 23.5.1.1 [queue.defn]:
! </p>
! 
! <blockquote><pre><del>void push(const value_type&amp; x) { c.push_back(x); }</del>
! <del>void push(value_type&amp;&amp; x) { c.push_back(std::move(x)); }</del>
! <ins>template&lt;class... Args&gt; void push(Args&amp;&amp;... args) { c.push_back(std::forward&lt;Args&gt;(args)...); }</ins>
! </pre></blockquote>
! 
! <p>
! Change 23.5.2 [priority.queue]:
! </p>
! 
! <blockquote><pre><del>void push(const value_type&amp; x) { c.push_back(x); }</del>
! <del>void push(value_type&amp;&amp; x) { c.push_back(std::move(x)); }</del>
! <ins>template&lt;class... Args&gt; void push(Args&amp;&amp;... args) { c.push_back(std::forward&lt;Args&gt;(args)...); }</ins>
! </pre></blockquote>
! 
! <p>
! Change 23.5.2.3 [priqueue.members]:
! </p>
! 
! <blockquote>
! <pre><del>void push(const value_type&amp; x);</del>
! </pre>
! <blockquote>
! <p>
! <del><i>Effects:</i></del>
! </p>
! <blockquote><pre><del>c.push_back(x);</del>
! <del>push_heap(c.begin(), c.end(), comp);</del>
! </pre></blockquote>
! </blockquote>
! 
! <pre><ins>template&lt;class... Args&gt;</ins> void push(<del>value_type</del> <ins>Args</ins>&amp;&amp;<ins>...</ins> <del>x</del> <ins>args</ins>);
! </pre>
! <blockquote>
! <p>
! <i>Effects:</i>
! </p>
! <blockquote><pre>c.push_back(std::<del>move</del><ins>forward&lt;Args&gt;</ins>(<del>x</del> <ins>args</ins>)<ins>...</ins>);
! push_heap(c.begin(), c.end(), comp);
! </pre></blockquote>
! </blockquote>
! </blockquote>
! 
! <p>
! Change 23.5.3.1 [stack.defn]:
! </p>
! 
! <blockquote><pre><del>void push(const value_type&amp; x) { c.push_back(x); }</del>
! <del>void push(value_type&amp;&amp; x) { c.push_back(std::move(x)); }</del>
! <ins>template&lt;class... Args&gt; void push(Args&amp;&amp;... args) { c.push_back(std::forward&lt;Args&gt;(args)...); }</ins>
! </pre></blockquote>
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2680.pdf">N2680 Proposed Wording for Placement Insert (Revision 1)</a>.
! </p>
! 
  
  
  
  
  <hr>
  <h3><a name="757"></a>757. Typo in the synopsis of vector</h3>
! <p><b>Section:</b> 23.4.1 [vector] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2007-11-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In the synopsis 23.4.1 [vector], there is the signature:
  </p>
  
! <blockquote><pre>void insert(const_iterator position, size_type n, T&amp;&amp; x);
  </pre></blockquote>
  
  <p>
  instead of:
  </p>
  
! <blockquote><pre>iterator insert(const_iterator position, T&amp;&amp; x);
  </pre></blockquote>
  
  <p>
! 23.4.1.4 [vector.modifiers] is fine.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 23.4.1 [vector]:
  </p>
  
! <blockquote><pre>iterator insert(const_iterator position, const T&amp; x); 
  <ins>iterator insert(const_iterator position, T&amp;&amp; x);</ins>
  void     insert(const_iterator position, size_type n, const T&amp; x); 
  <del>void     insert(const_iterator position, size_type n, T&amp;&amp; x);</del>
--- 18086,18136 ----
  ]</i></p>
  
  
! <blockquote><p>
  Resolution: NAD editorial -- project editor to decide if change is
  worthwhile. Concern is that there are many other places this might
  occur.
! </p></blockquote>
  
  
  
  
  <hr>
  <h3><a name="757"></a>757. Typo in the synopsis of vector</h3>
! <p><b>Section:</b> 23.3.6 [vector] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2007-11-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In the synopsis 23.3.6 [vector], there is the signature:
  </p>
  
! <blockquote><pre>
! void insert(const_iterator position, size_type n, T&amp;&amp; x);
  </pre></blockquote>
  
  <p>
  instead of:
  </p>
  
! <blockquote><pre>
! iterator insert(const_iterator position, T&amp;&amp; x);
  </pre></blockquote>
  
  <p>
! 23.3.6.5 [vector.modifiers] is fine.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 23.3.6 [vector]:
  </p>
  
! <blockquote><pre>
! iterator insert(const_iterator position, const T&amp; x); 
  <ins>iterator insert(const_iterator position, T&amp;&amp; x);</ins>
  void     insert(const_iterator position, size_type n, const T&amp; x); 
  <del>void     insert(const_iterator position, size_type n, T&amp;&amp; x);</del>
*************** void     insert(const_iterator position,
*** 19975,20076 ****
  
  
  <hr>
- <h3><a name="760"></a>760. The emplace issue</h3>
- <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2007-11-11 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- In an emplace member function the function parameter pack may be bound
- to a priori unlimited number of objects: some or all of them can be
- elements of the container itself. Apparently, in order to conform to the
- blanket statement 23.2 [container.requirements]/11, the
- implementation must check all of them for that possibility. A possible
- solution can involve extending the exception in 23.2 [container.requirements]/12 also to the emplace member. As a
- side note, the <tt>push_back</tt> and <tt>push_front</tt> member
- functions are luckily not affected by this problem, can be efficiently
- implemented anyway
- </p>
- 
- <p><i>[
- Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>
- ]</i></p>
- 
- 
- <p><i>[
- Bellevue:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- The proposed addition (13) is partially redundant with the existing
- paragraph 12. Why was the qualifier "rvalues" added to paragraph 12? Why
- does it not cover subelements and pointers?
- </p>
- <p>
- Resolution: Alan Talbot to rework language, then set state to Review.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- The problem is broader than emplace. The LWG doesn't
- feel that it knows how to write wording that prohibits all of the
- problematic use cases at this time.
- </p>
- <p>
- NAD Future.
- </p>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Add after 23.2 [container.requirements]/12:
- </p>
- 
- <blockquote>
- <p>
- -12- Objects passed to member functions of a container as rvalue
- references shall not be elements of that container. No diagnostic
- required.
- </p>
- <p>
- <ins>
- -13- Objects bound to the function parameter pack of the
- <tt>emplace</tt> member function shall not be elements or sub-objects of
- elements of the container. No diagnostic required.
- </ins>
- </p>
- 
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="763"></a>763. Renaming <tt>emplace()</tt> overloads</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sylvain Pion <b>Opened:</b> 2007-12-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The associative containers provide 2 overloads of <tt>emplace()</tt>:
  </p>
  
! <blockquote><pre>template &lt;class... Args&gt; pair&lt;iterator, bool&gt; emplace(Args&amp;&amp;... args);
  template &lt;class... Args&gt; iterator emplace(const_iterator position, Args&amp;&amp;... args);
  </pre></blockquote>
  
--- 18141,18159 ----
  
  
  <hr>
  <h3><a name="763"></a>763. Renaming <tt>emplace()</tt> overloads</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sylvain Pion <b>Opened:</b> 2007-12-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The associative containers provide 2 overloads of <tt>emplace()</tt>:
  </p>
  
! <blockquote><pre>
! template &lt;class... Args&gt; pair&lt;iterator, bool&gt; emplace(Args&amp;&amp;... args);
  template &lt;class... Args&gt; iterator emplace(const_iterator position, Args&amp;&amp;... args);
  </pre></blockquote>
  
*************** a <tt>const_iterator</tt> as first argum
*** 20080,20086 ****
  </p>
  
  <p><i>[
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>
  ]</i></p>
  
  
--- 18163,18169 ----
  </p>
  
  <p><i>[
! Related to <a href="lwg-defects.html#767">767</a>
  ]</i></p>
  
  
*************** Bellevue:
*** 20089,20101 ****
  ]</i></p>
  
  
- <blockquote>
- </blockquote>
  <p>
  This can be disambiguated by passing "begin" as the first argument in
  the case when the non-default choice is desired. We believe that desire
  will be rare.
  </p>
  <p>
  Resolution: Change state to NAD.
  </p>
--- 18172,18191 ----
  ]</i></p>
  
  
  <p>
  This can be disambiguated by passing "begin" as the first argument in
  the case when the non-default choice is desired. We believe that desire
  will be rare.
  </p>
+ 
+ <p><i>[For related discussion see <a href="lwg-closed.html#1302">1302</a>]</i></p>
+ 
+ 
+ <p>
+ LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2680.pdf">N2680</a> 
+ renamed one of the overloads to <tt>emplace_hint</tt>.
+ </p>
+ 
  <p>
  Resolution: Change state to NAD.
  </p>
*************** For example to <tt>emplace_here</tt>, <t
*** 20113,20123 ****
  
  <hr>
  <h3><a name="764"></a>764. <tt>equal_range</tt> on unordered containers should return a <tt>pair</tt> of <tt>local_iterators</tt></h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2007-11-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
      A major attribute of the unordered containers is that iterating 
--- 18203,18213 ----
  
  <hr>
  <h3><a name="764"></a>764. <tt>equal_range</tt> on unordered containers should return a <tt>pair</tt> of <tt>local_iterators</tt></h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2007-11-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
      A major attribute of the unordered containers is that iterating 
*************** object of it's <tt>key_type</tt>, then <
*** 20133,20139 ****
  <tt>pair&lt;B::iterator, B::iterator&gt;</tt>. Consider the following code:
  </p>
  
! <blockquote><pre>B::iterator lb, ub;
  tie(lb, ub) = b.equal_range(k);
  for (B::iterator it = lb; it != ub; ++it) {
          // Do something with *it
--- 18223,18230 ----
  <tt>pair&lt;B::iterator, B::iterator&gt;</tt>. Consider the following code:
  </p>
  
! <blockquote><pre>
! B::iterator lb, ub;
  tie(lb, ub) = b.equal_range(k);
  for (B::iterator it = lb; it != ub; ++it) {
          // Do something with *it
*************** Bellevue:
*** 20163,20172 ****
  ]</i></p>
  
  
! <blockquote>
  The proposed resolution breaks consistency with other container types
  for dubious benefit, and iterators are already constant time.
! </blockquote>
  
  
  
--- 18254,18263 ----
  ]</i></p>
  
  
! <blockquote><p>
  The proposed resolution breaks consistency with other container types
  for dubious benefit, and iterators are already constant time.
! </p></blockquote>
  
  
  
*************** for dubious benefit, and iterators are a
*** 20175,20181 ****
  Change the entry for <tt>equal_range</tt> in Table 93 (23.2.5 [unord.req]) as follows:
  </p>
  <table border="1">
! <tbody><tr>
  <th>expression</th> <th>return type</th> <th>assertion/note pre/post-condition</th> <th>complexity</th>
  </tr>
  
--- 18266,18272 ----
  Change the entry for <tt>equal_range</tt> in Table 93 (23.2.5 [unord.req]) as follows:
  </p>
  <table border="1">
! <tr>
  <th>expression</th> <th>return type</th> <th>assertion/note pre/post-condition</th> <th>complexity</th>
  </tr>
  
*************** Change the entry for <tt>equal_range</tt
*** 20183,20453 ****
  <td><tt>b.equal_range(k)</tt></td>
  <td><tt>pair&lt;<ins>local_</ins>iterator,<ins>local_</ins>iterator&gt;; pair&lt;const_<ins>local_</ins>iterator,const_<ins>local_</ins>iterator&gt;</tt> for <tt>const b</tt>.</td>
  <td>Returns a range containing all elements with keys equivalent to <tt>k</tt>. Returns <tt>make_pair(b.end(<ins>b.bucket(key)</ins>),b.end(<ins>b.bucket(key)</ins>))</tt> if no such elements exist.</td>
! <td>Average case &#920;<tt>(b.count(k))</tt>. Worst case &#920;<tt>(b.size())</tt>. </td>
! </tr>
! </tbody></table>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="767"></a>767. Forwarding and backward compatibility</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Sylvain Pion <b>Opened:</b> 2007-12-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Playing with g++'s C++0X mode, I noticed that the following
! code, which used to compile:
! </p>
! 
! <blockquote><pre>#include &lt;vector&gt;
! 
! int main()
! {
!     std::vector&lt;char *&gt; v;
!     v.push_back(0);
! }
! </pre></blockquote>
! 
! <p>
! now fails with the following error message:
! </p>
! 
! <blockquote>
! .../include/c++/4.3.0/ext/new_allocator.h: In member function 'void __gnu_cxx::new_allocator&lt;_Tp&gt;::construct(_Tp*, _Args&amp;&amp; ...) [with _Args = int, _Tp = char*]':
! .../include/c++/4.3.0/bits/stl_vector.h:707:   instantiated from 'void std::vector&lt;_Tp, _Alloc&gt;::push_back(_Args&amp;&amp; ...) [with _Args = int, _Tp = char*, _Alloc = std::allocator&lt;char*&gt;]'
! test.cpp:6:   instantiated from here
! .../include/c++/4.3.0/ext/new_allocator.h:114: error: invalid conversion from 'int' to 'char*'
! </blockquote>
! 
! <p>
! As far as I know, g++ follows the current draft here.
! </p>
! <p>
! Does the committee really intend to break compatibility for such cases?
! </p>
! 
! <p><i>[
! Sylvain adds: 
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! I just noticed that <tt>std::pair</tt> has the same issue.
! The following now fails with GCC's -std=c++0x mode:
! </p>
! 
! <blockquote><pre>#include &lt;utility&gt;
! 
! int main()
! {
!    std::pair&lt;char *, char *&gt; p (0,0);
! }
! </pre></blockquote>
! 
! <p>
! I have not made any general audit for such problems elsewhere.
! </p>
! </blockquote>
! 
! <p><i>[
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>
! ]</i></p>
! 
! 
! <p><i>[
! Bellevue:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Motivation is to handle the old-style int-zero-valued NULL pointers.
! Problem: this solution requires concepts in some cases, which some users
! will be slow to adopt. Some discussion of alternatives involving
! prohibiting variadic forms and additional library-implementation
! complexity.
! </p>
! <p>
! Discussion of "perfect world" solutions, the only such solution put
! forward being to retroactively prohibit use of the integer zero for a
! NULL pointer. This approach was deemed unacceptable given the large
! bodies of pre-existing code that do use integer zero for a NULL pointer.
! </p>
! <p>
! Another approach is to change the member names. Yet another approach is
! to forbid the extension in absence of concepts.
! </p>
! <p>
! Resolution: These issues (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#763">763</a>) will be subsumed into a
! paper to be produced by Alan Talbot in time for review at the 2008
! meeting in France. Once this paper is produced, these issues will be
! moved to NAD.
! </p>
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Add the following rows to Table 90 "Optional sequence container operations", 23.2.3 [sequence.reqmts]:
! </p>
! 
! <blockquote>
! <table border="1">
! <tbody><tr>
! <th>expression</th> <th>return type</th> <th>assertion/note<br>pre-/post-condition</th> <th>container</th>
! </tr>
! 
! <tr>
! <td>
! <tt>a.push_front(t)</tt>
! </td>
! <td>
! <tt>void</tt>
! </td>
! <td>
! <tt>a.insert(a.begin(), t)</tt><br>
! <i>Requires:</i> <tt>T</tt> shall be <tt>CopyConstructible</tt>.
! </td>
! <td>
! <tt>list, deque</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.push_front(rv)</tt>
! </td>
! <td>
! <tt>void</tt>
! </td>
! <td>
! <tt>a.insert(a.begin(), rv)</tt><br>
! <i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt>.
! </td>
! <td>
! <tt>list, deque</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.push_back(t)</tt>
! </td>
! <td>
! <tt>void</tt>
! </td>
! <td>
! <tt>a.insert(a.end(), t)</tt><br>
! <i>Requires:</i> <tt>T</tt> shall be <tt>CopyConstructible</tt>.
! </td>
! <td>
! <tt>list, deque, vector, basic_string</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.push_back(rv)</tt>
! </td>
! <td>
! <tt>void</tt>
! </td>
! <td>
! <tt>a.insert(a.end(), rv)</tt><br>
! <i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt>.
! </td>
! <td>
! <tt>list, deque, vector, basic_string</tt>
! </td>
  </tr>
! 
! </tbody></table>
! </blockquote>
! 
! <p>
! Change the synopsis in 23.3.2 [deque]:
! </p>
! 
! <blockquote><pre><ins>void push_front(const T&amp; x);</ins>
! <ins>void push_front(T&amp;&amp; x);</ins>
! <ins>void push_back(const T&amp; x);</ins>
! <ins>void push_back(T&amp;&amp; x);</ins>
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_front(Args&amp;&amp;... args);
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
! </pre></blockquote>
! 
! <p>
! Change 23.3.2.3 [deque.modifiers]:
! </p>
! 
! <blockquote><pre><ins>void push_front(const T&amp; x);</ins>
! <ins>void push_front(T&amp;&amp; x);</ins>
! <ins>void push_back(const T&amp; x);</ins>
! <ins>void push_back(T&amp;&amp; x);</ins>
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_front(Args&amp;&amp;... args);
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
! </pre></blockquote>
! 
! <p>
! Change the synopsis in 23.3.4 [list]:
! </p>
! 
! <blockquote><pre><ins>void push_front(const T&amp; x);</ins>
! <ins>void push_front(T&amp;&amp; x);</ins>
! <ins>void push_back(const T&amp; x);</ins>
! <ins>void push_back(T&amp;&amp; x);</ins>
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_front(Args&amp;&amp;... args);
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
! </pre></blockquote>
! 
! <p>
! Change 23.3.4.3 [list.modifiers]:
! </p>
! 
! <blockquote><pre><ins>void push_front(const T&amp; x);</ins>
! <ins>void push_front(T&amp;&amp; x);</ins>
! <ins>void push_back(const T&amp; x);</ins>
! <ins>void push_back(T&amp;&amp; x);</ins>
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_front(Args&amp;&amp;... args);
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
! </pre></blockquote>
! 
! <p>
! Change the synopsis in 23.4.1 [vector]:
! </p>
! 
! <blockquote><pre><ins>void push_back(const T&amp; x);</ins>
! <ins>void push_back(T&amp;&amp; x);</ins>
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
! </pre></blockquote>
! 
! <p>
! Change 23.4.1.4 [vector.modifiers]:
! </p>
! 
! <blockquote><pre><ins>void push_back(const T&amp; x);</ins>
! <ins>void push_back(T&amp;&amp; x);</ins>
! template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
! </pre></blockquote>
! 
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2680.pdf">N2680 Proposed Wording for Placement Insert (Revision 1)</a>.
! </p>
! 
! <p>
! If there is still an issue with pair, Howard should submit another issue.
! </p>
  
  
  
--- 18274,18282 ----
  <td><tt>b.equal_range(k)</tt></td>
  <td><tt>pair&lt;<ins>local_</ins>iterator,<ins>local_</ins>iterator&gt;; pair&lt;const_<ins>local_</ins>iterator,const_<ins>local_</ins>iterator&gt;</tt> for <tt>const b</tt>.</td>
  <td>Returns a range containing all elements with keys equivalent to <tt>k</tt>. Returns <tt>make_pair(b.end(<ins>b.bucket(key)</ins>),b.end(<ins>b.bucket(key)</ins>))</tt> if no such elements exist.</td>
! <td>Average case &Theta;<tt>(b.count(k))</tt>. Worst case &Theta;<tt>(b.size())</tt>. </td>
  </tr>
! </table>
  
  
  
*************** If there is still an issue with pair, Ho
*** 20455,20481 ****
  
  <hr>
  <h3><a name="773"></a>773. issues with random</h3>
! <p><b>Section:</b> 26.5.8.1 [rand.dist.uni] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-01-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.uni">issues</a> in [rand.dist.uni].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <ol>
  <li>
! 26.5.8.1.1 [rand.dist.uni.int] <tt>uniform_int</tt> constructor has changed the default
  max constructor parameter from 9 (in TR1) to <tt>max()</tt>. The value
  is arbitrary at best and shouldn't be lightly changed because
  it breaks backward compatibility.
  </li>
  
  <li>
! 26.5.8.1.1 [rand.dist.uni.int] <tt>uniform_int</tt> has a parameter <tt>param</tt> that you can
  provide on construction or <tt>operator()</tt>, set, and get. But there
  is not even a hint of what this might be for.
  </li>
  
  <li>
! 26.5.8.1.2 [rand.dist.uni.real] <tt>uniform_real</tt>. Same issue as #2.
  </li>
  </ol>
  
--- 18284,18310 ----
  
  <hr>
  <h3><a name="773"></a>773. issues with random</h3>
! <p><b>Section:</b> 26.5.8.2 [rand.dist.uni] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-01-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist.uni">issues</a> in [rand.dist.uni].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <ol>
  <li>
! 26.5.8.2.1 [rand.dist.uni.int] <tt>uniform_int</tt> constructor has changed the default
  max constructor parameter from 9 (in TR1) to <tt>max()</tt>. The value
  is arbitrary at best and shouldn't be lightly changed because
  it breaks backward compatibility.
  </li>
  
  <li>
! 26.5.8.2.1 [rand.dist.uni.int] <tt>uniform_int</tt> has a parameter <tt>param</tt> that you can
  provide on construction or <tt>operator()</tt>, set, and get. But there
  is not even a hint of what this might be for.
  </li>
  
  <li>
! 26.5.8.2.2 [rand.dist.uni.real] <tt>uniform_real</tt>. Same issue as #2.
  </li>
  </ol>
  
*************** Bellevue:
*** 20484,20492 ****
  ]</i></p>
  
  
! <blockquote>
  NAD. Withdrawn.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 18313,18321 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD. Withdrawn.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** NAD. Withdrawn.
*** 20499,20507 ****
  
  <hr>
  <h3><a name="784"></a>784. unique_lock::release</h3>
! <p><b>Section:</b> 30.4.2.2.3 [thread.lock.unique.mod] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Constantine Sapuntzakis <b>Opened:</b> 2008-02-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>unique_lock::release</tt> will probably lead to many mistakes where people
--- 18328,18336 ----
  
  <hr>
  <h3><a name="784"></a>784. unique_lock::release</h3>
! <p><b>Section:</b> 30.4.2.2.3 [thread.lock.unique.mod] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Constantine Sapuntzakis <b>Opened:</b> 2008-02-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>unique_lock::release</tt> will probably lead to many mistakes where people
*************** Bellevue:
*** 20536,20547 ****
  ]</i></p>
  
  
! <blockquote>
  Change a name from release to disown. However prior art uses the release
  name. Compatibility with prior art is more important that any possible
  benefit such a change might make. We do not see the benefit for
  changing. NAD
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 18365,18376 ----
  ]</i></p>
  
  
! <blockquote><p>
  Change a name from release to disown. However prior art uses the release
  name. Compatibility with prior art is more important that any possible
  benefit such a change might make. We do not see the benefit for
  changing. NAD
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** changing. NAD
*** 20549,20555 ****
  Change the synopsis in 30.4.2.2 [thread.lock.unique]:
  </p>
  
! <blockquote><pre>template &lt;class Mutex&gt; 
  class unique_lock 
  { 
  public:
--- 18378,18385 ----
  Change the synopsis in 30.4.2.2 [thread.lock.unique]:
  </p>
  
! <blockquote><pre>
! template &lt;class Mutex&gt; 
  class unique_lock 
  { 
  public:
*************** public:
*** 20563,20569 ****
  Change 30.4.2.2.3 [thread.lock.unique.mod]:
  </p>
  
! <blockquote><pre>mutex_type *<del>release</del> <ins>disown</ins>();
  </pre></blockquote>
  
  
--- 18393,18400 ----
  Change 30.4.2.2.3 [thread.lock.unique.mod]:
  </p>
  
! <blockquote><pre>
! mutex_type *<del>release</del> <ins>disown</ins>();
  </pre></blockquote>
  
  
*************** Change 30.4.2.2.3 [thread.lock.unique.mo
*** 20572,20600 ****
  
  <hr>
  <h3><a name="785"></a>785. Random Number Requirements in TR1</h3>
! <p><b>Section:</b> TR1 5.1.4.5 [tr.rand.eng.disc], TR1 5.1.4.6 [tr.rand.eng.xor] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> John Maddock <b>Opened:</b> 2008-01-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 16 of TR1 requires that all Pseudo Random Number generators have a
  </p>
  
! <blockquote><pre>seed(integer-type s)
  </pre></blockquote>
  
  <p>
  member function that is equivalent to:
  </p>
  
! <blockquote><pre>mygen = Generator(s)
  </pre></blockquote>
  
  <p>
  But the generators <tt>xor_combine</tt> and <tt>discard_block</tt> have no such seed member, only the
  </p>
  
! <blockquote><pre>template &lt;class Gen&gt;
  seed(Gen&amp;);
  </pre></blockquote>
  
--- 18403,18434 ----
  
  <hr>
  <h3><a name="785"></a>785. Random Number Requirements in TR1</h3>
! <p><b>Section:</b> TR1 5.1.4.5 [tr.rand.eng.disc], TR1 5.1.4.6 [tr.rand.eng.xor] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> John Maddock <b>Opened:</b> 2008-01-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 16 of TR1 requires that all Pseudo Random Number generators have a
  </p>
  
! <blockquote><pre>
! seed(integer-type s)
  </pre></blockquote>
  
  <p>
  member function that is equivalent to:
  </p>
  
! <blockquote><pre>
! mygen = Generator(s)
  </pre></blockquote>
  
  <p>
  But the generators <tt>xor_combine</tt> and <tt>discard_block</tt> have no such seed member, only the
  </p>
  
! <blockquote><pre>
! template &lt;class Gen&gt;
  seed(Gen&amp;);
  </pre></blockquote>
  
*************** Jens adds:
*** 20615,20644 ****
  ]</i></p>
  
  
! <blockquote>
  Both engines do have the necessary
  constructor, therefore the omission of the <tt>seed()</tt> member
  functions appears to be an oversight.
! </blockquote>
  
  <p><i>[
  Post Summit Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Recommend NAD: <tt>xor_combine</tt> does no longer exist and <tt>discard_block[_engine]</tt>
  has now the required seed overload accepting a <tt>result_type</tt>, which shall be an
  unsigned integral type.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to NAD as recommended.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 18449,18478 ----
  ]</i></p>
  
  
! <blockquote><p>
  Both engines do have the necessary
  constructor, therefore the omission of the <tt>seed()</tt> member
  functions appears to be an oversight.
! </p></blockquote>
  
  <p><i>[
  Post Summit Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Recommend NAD: <tt>xor_combine</tt> does no longer exist and <tt>discard_block[_engine]</tt>
  has now the required seed overload accepting a <tt>result_type</tt>, which shall be an
  unsigned integral type.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to NAD as recommended.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** NAD Recommended.
*** 20652,20661 ****
  
  <hr>
  <h3><a name="790"></a>790. <tt>xor_combine::seed</tt> not specified</h3>
! <p><b>Section:</b> X [rand.adapt.xor] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.adapt.xor">issues</a> in [rand.adapt.xor].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>xor_combine::seed(result_type)</tt> and <tt>seed(seed_seq&amp;)</tt> don't say what
--- 18486,18495 ----
  
  <hr>
  <h3><a name="790"></a>790. <tt>xor_combine::seed</tt> not specified</h3>
! <p><b>Section:</b> X [rand.adapt.xor] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.adapt.xor">issues</a> in [rand.adapt.xor].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>xor_combine::seed(result_type)</tt> and <tt>seed(seed_seq&amp;)</tt> don't say what
*************** Bellevue:
*** 20668,20676 ****
  ]</i></p>
  
  
! <blockquote>
! Overcome by the previous proposal. NAD mooted by resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>.
! </blockquote>
  
  
  
--- 18502,18510 ----
  ]</i></p>
  
  
! <blockquote><p>
! Overcome by the previous proposal. NAD mooted by resolution of <a href="lwg-defects.html#789">789</a>.
! </p></blockquote>
  
  
  
*************** Overcome by the previous proposal. NAD m
*** 20682,20691 ****
  
  <hr>
  <h3><a name="791"></a>791. <tt>piecewise_constant_distribution::densities</tt> has wrong name</h3>
! <p><b>Section:</b> 26.5.8.5.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>piecewise_constant_distribution::densities()</tt> should be <tt>probabilities()</tt>,
--- 18516,18525 ----
  
  <hr>
  <h3><a name="791"></a>791. <tt>piecewise_constant_distribution::densities</tt> has wrong name</h3>
! <p><b>Section:</b> 26.5.8.6.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>piecewise_constant_distribution::densities()</tt> should be <tt>probabilities()</tt>,
*************** variates.
*** 20726,20735 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change synopsis in 26.5.8.5.2 [rand.dist.samp.pconst]:
  </p>
  
! <blockquote><pre>template &lt;class RealType = double&gt; 
  class piecewise_constant_distribution 
  { 
  public:
--- 18560,18570 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change synopsis in 26.5.8.6.2 [rand.dist.samp.pconst]:
  </p>
  
! <blockquote><pre>
! template &lt;class RealType = double&gt; 
  class piecewise_constant_distribution 
  { 
  public:
*************** public:
*** 20740,21272 ****
  </pre></blockquote>
  
  <p>
! Change 26.5.8.5.2 [rand.dist.samp.pconst]/6:
! </p>
! 
! <blockquote><pre>vector&lt;double&gt; <del>densities</del> <ins>probabilities</ins>() const;
! </pre></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="793"></a>793. <tt>discrete_distribution</tt> missing constructor</h3>
! <p><b>Section:</b> 26.5.8.5.1 [rand.dist.samp.discrete] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.discrete">issues</a> in [rand.dist.samp.discrete].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>discrete_distribution</tt> should have a constructor like:
! </p>
! 
! <blockquote><pre>template&lt;class _Fn&gt;
!   discrete_distribution(result_type _Count, double _Low, double _High,
!                         _Fn&amp; _Func);
! </pre></blockquote>
! 
! <p>
! (Makes it easier to fill a histogram with function values over a range.)
! </p>
! 
! <p><i>[
! Bellevue:
! ]</i></p>
! 
! 
! <blockquote>
! How do you specify the function so that it does not return negative
! values? If you do it is a bad construction. This requirement is already
! there. Where in each bin does one evaluate the function? In the middle.
! Need to revisit tomorrow.
! </blockquote>
! 
! <p><i>[
! Sophia Antipolis:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Bill is not requesting this.
! </p>
! <p>
! Marc Paterno: <tt>_Fn</tt> cannot return negative values at the points where the
! function is sampled. It is sampled in the middle of each bin. <tt>_Fn</tt> cannot
! return 0 everywhere it is sampled.
! </p>
! <p>
! Jens: lambda expressions are rvalues
! </p>
! <p>
! Add a library issue to provide an
! <tt>initializer_list&lt;double&gt;</tt> constructor for
! <tt>discrete_distribution</tt>.
! </p>
! <p>
! Marc Paterno: dislikes reference for <tt>_Fn</tt> parameter. Make it pass-by-value (to use lambda),
! use <tt>std::ref</tt> to wrap giant-state function objects.
! </p>
! <p>
! Daniel: See <tt>random_shuffle</tt>, pass-by-rvalue-reference.
! </p>
! <p>
! Daniel to draft wording.
! </p>
! </blockquote>
! 
! <p><i>[
! Pre San Francisco, Daniel provided wording:
! ]</i></p>
! 
! 
! <blockquote>
! The here proposed changes of the WP refer to the current state of
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf">N2691</a>.
! During the Sophia Antipolis meeting two different proposals came up
! regarding the functor argument type, either by value or by rvalue-reference.
! For consistence with existing conventions (state-free algorithms and the
! <tt>general_pdf_distribution</tt> c'tor signature) the author decided to propose a
! function argument that is provided by value. If severe concerns exists that
! stateful functions would be of dominant relevance, it should be possible to
! replace the two occurrences of <tt>Func</tt> by <tt>Func&amp;&amp;</tt> in this proposal as part
! of an editorial process.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p><b>Non-concept version of the proposed resolution</b></p>
! 
! <ol>
! <li>
! <p>
! In 26.5.8.5.1 [rand.dist.samp.discrete]/1, class <tt>discrete_distribution</tt>, just
! <em>before</em> the member declaration
! </p>
! 
! <blockquote><pre>explicit discrete_distribution(const param_type&amp; parm);
! </pre></blockquote>
! 
! <p>
! insert:
! </p>
! 
! 
! <blockquote><pre>template&lt;typename Func&gt;
! discrete_distribution(result_type nf, double xmin, double xmax, Func fw);
! </pre></blockquote>
! </li>
! 
! <li>
! <p>
! Between p.4 and p.5 insert a series of new paragraphs as part of the
! new member description::
! </p>
! <blockquote><pre>template&lt;typename Func&gt;
! discrete_distribution(result_type nf, double xmin, double xmax, Func fw);
! </pre>
! 
! <p>
! <i>Complexity:</i> Exactly nf invocations of fw.
! </p>
! <p>
! <i>Requires:</i>
! </p>
! <ol type="a">
! <li>
! fw shall be callable with one argument of type double, and shall
! return values of a type convertible to double;</li>
! 
! <li>If nf &gt; 0, the relation <tt><i>x</i><sub><i>min</i></sub></tt> &lt; <tt><i>x</i><sub><i>max</i></sub></tt> shall hold, and for all sample values
! <tt><i>x</i><sub><i>k</i></sub></tt>, fw(<tt><i>x</i><sub><i>k</i></sub></tt>) shall return a weight value <tt><i>w</i><sub><i>k</i></sub></tt> that is non-negative, non-NaN,
! and non-infinity;</li>
! 
! <li>The following relations shall hold: nf &#8805; 0, and 0 &lt; S = <tt><i>w</i><sub><i>0</i></sub></tt>+. . .+<tt><i>w<sub>n-1</sub></i></tt>.</li>
! 
! </ol>
! 
! <p>
! <i>Effects:</i>
! </p>
! <ol type="a">
! <li>If nf == 0, sets n = 1 and lets the sequence w have length n = 1 and
!    consist of the single value <tt><i>w</i><sub><i>0</i></sub></tt> = 1.</li>
! 
! <li>
! <p>Otherwise, sets n = nf, deltax = (<tt><i>x</i><sub><i>max</i></sub></tt> - <tt><i>x</i><sub><i>min</i></sub></tt>)/n and <tt><i>x</i><sub><i>cent</i></sub></tt> = <tt><i>x</i><sub><i>min</i></sub></tt> +
! 0.5 * deltax.</p>
! <blockquote><pre>For each k = 0, . . . ,n-1, calculates:
!   <tt><i>x</i><sub><i>k</i></sub></tt> = <tt><i>x</i><sub><i>cent</i></sub></tt> + k * deltax
!   <tt><i>w</i><sub><i>k</i></sub></tt> = fw(<tt><i>x</i><sub><i>k</i></sub></tt>)
! </pre></blockquote>
! </li>
! <li>
! <p>Constructs a discrete_distribution object with probabilities:</p>
! <blockquote><pre><tt><i>p</i><sub><i>k</i></sub></tt> = <tt><i>w</i><sub><i>k</i></sub></tt>/S  for k = 0, . . . , n-1.
! </pre></blockquote>
! </li>
! </ol>
! </blockquote>
! </li>
! </ol>
! 
! <p><b>Concept version of the proposed resolution</b></p>
! 
! 
! <ol>
! <li>
! <p>
! In 26.5.8.5.1 [rand.dist.samp.discrete]/1, class <tt>discrete_distribution</tt>, just
! <em>before</em> the member declaration
! </p>
! 
! <blockquote><pre>explicit discrete_distribution(const param_type&amp; parm);
! </pre></blockquote>
! 
! <p>
! insert:
! </p>
! 
! 
! <blockquote><pre>template&lt;Callable&lt;auto, double&gt; Func&gt;
!  requires Convertible&lt;Func::result_type, double&gt;
! discrete_distribution(result_type nf, double xmin, double xmax, Func fw);
! </pre></blockquote>
! </li>
! 
! <li>
! <p>
! Between p.4 and p.5 insert a series of new paragraphs as part of the
! new member description::
! </p>
! <blockquote><pre>template&lt;Callable&lt;auto, double&gt; Func&gt;
!  requires Convertible&lt;Func::result_type, double&gt;
! discrete_distribution(result_type nf, double xmin, double xmax, Func fw);
! </pre>
! 
! <p>
! <i>Complexity:</i> Exactly nf invocations of fw.
! </p>
! <p>
! <i>Requires:</i>
! </p>
! <ol type="a">
! <li>If nf &gt; 0, the relation <tt><i>x</i><sub><i>min</i></sub></tt> &lt; <tt><i>x</i><sub><i>max</i></sub></tt> shall hold, and for all sample values
! <tt><i>x</i><sub><i>k</i></sub></tt>, fw(<tt><i>x</i><sub><i>k</i></sub></tt>) shall return a weight value <tt><i>w</i><sub><i>k</i></sub></tt> that is non-negative, non-NaN,
! and non-infinity;</li>
! 
! <li>The following relations shall hold: nf &#8805; 0, and 0 &lt; S = <tt><i>w</i><sub><i>0</i></sub></tt>+. . .+<tt><i>w<sub>n-1</sub></i></tt>.</li>
! 
! </ol>
! 
! <p>
! <i>Effects:</i>
  </p>
- <ol type="a">
- <li>If nf == 0, sets n = 1 and lets the sequence w have length n = 1 and
-    consist of the single value <tt><i>w</i><sub><i>0</i></sub></tt> = 1.</li>
  
! <li>
! <p>Otherwise, sets n = nf, deltax = (<tt><i>x</i><sub><i>max</i></sub></tt> - <tt><i>x</i><sub><i>min</i></sub></tt>)/n and <tt><i>x</i><sub><i>cent</i></sub></tt> = <tt><i>x</i><sub><i>min</i></sub></tt> +
! 0.5 * deltax.</p>
! <blockquote><pre>For each k = 0, . . . ,n-1, calculates:
!   <tt><i>x</i><sub><i>k</i></sub></tt> = <tt><i>x</i><sub><i>cent</i></sub></tt> + k * deltax
!   <tt><i>w</i><sub><i>k</i></sub></tt> = fw(<tt><i>x</i><sub><i>k</i></sub></tt>)
! </pre></blockquote>
! </li>
! <li>
! <p>Constructs a discrete_distribution object with probabilities:</p>
! <blockquote><pre><tt><i>p</i><sub><i>k</i></sub></tt> = <tt><i>w</i><sub><i>k</i></sub></tt>/S  for k = 0, . . . , n-1.
  </pre></blockquote>
- </li>
- </ol>
- </blockquote>
- </li>
- </ol>
- 
- 
  
- <p><b>Rationale:</b></p>
- Addressed by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="794"></a>794. <tt>piecewise_constant_distribution</tt> missing constructor</h3>
- <p><b>Section:</b> 26.5.8.5.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- <tt>piecewise_constant_distribution</tt> should have a constructor like:
- </p>
- 
- <blockquote><pre>template&lt;class _Fn&gt;
-    piecewise_constant_distribution(size_t _Count,
-             _Ty _Low, _Ty _High, _Fn&amp; _Func);
- </pre></blockquote>
- 
- <p>
- (Makes it easier to fill a histogram with function values over a range.
- The two (reference <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a>) make a sensible replacement for
- <tt>general_pdf_distribution</tt>.)
- </p>
- 
- <p><i>[
- Sophia Antipolis:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Marc: uses variable width of bins and weight for each bin. This is not
- giving enough flexibility to control both variables.
- </p>
- <p>
- Add a library issue to provide an constructor taking an
- <tt>initializer_list&lt;double&gt;</tt> and <tt>_Fn</tt> for <tt>piecewise_constant_distribution</tt>.
- </p>
- <p>
- Daniel to draft wording.
- </p>
- </blockquote>
- 
- <p><i>[
- Pre San Francisco, Daniel provided wording.
- ]</i></p>
- 
- 
- <blockquote>
- The here proposed changes of the WP refer to the current state of
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf">N2691</a>.
- For reasons explained in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a>, the author decided to propose a function
- argument that is provided by value. The issue proposes a c'tor signature,
- that does not take advantage of the full flexibility of
- <tt>piecewise_constant_distribution</tt>,
- because it restricts on a constant bin width, but the use-case seems to
- be popular enough to justify it's introduction.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- <p><b>Non-concept version of the proposed resolution</b></p>
- 
- <ol>
- <li>
- <p>
- In 26.5.8.5.2 [rand.dist.samp.pconst]/1, class <tt>piecewise_constant_distribution</tt>,
- just <em>before</em> the member declaration
- </p>
- 
- <blockquote><pre>explicit piecewise_constant_distribution(const param_type&amp; parm);
- </pre></blockquote>
- <p>
- insert:
- </p>
- <blockquote><pre>template&lt;typename Func&gt;
- piecewise_constant_distribution(size_t nf, RealType xmin, RealType xmax, Func fw);
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Between p.4 and p.5 insert a new sequence of paragraphs nominated
- below as [p5_1], [p5_2],
- [p5_3], and [p5_4] as part of the new member description:
- </p>
- 
- <blockquote><pre>template&lt;typename Func&gt;
- piecewise_constant_distribution(size_t nf, RealType xmin, RealType xmax, Func fw);
- </pre>
- <blockquote>
- <p>
- [p5_1] <i>Complexity:</i> Exactly <tt>nf</tt> invocations of <tt>fw</tt>.
- </p>
- <p>
- [p5_2] <i>Requires:</i>
- </p>
- <ol type="a">
- <li><tt>fw</tt> shall be callable with one argument of type <tt>RealType</tt>, and shall
- return values of a type convertible to double;
- </li>
- <li>
- For all sample values <tt><i>x<sub>k</sub></i></tt> defined below, fw(<tt><i>x<sub>k</sub></i></tt>) shall return a weight
- value <tt><i>w<sub>k</sub></i></tt> that is non-negative, non-NaN, and non-infinity;
- </li>
- <li>
- The following relations shall hold: <tt><i>x<sub>min</sub></i></tt> &lt; <tt><i>x<sub>max</sub></i></tt>, and
- 0 &lt; S = <tt><i>w<sub>0</sub></i></tt>+. . .+<tt><i>w<sub>n-1</sub></i></tt>.
- </li>
- </ol>
- <p>
- [p5_3] <i>Effects:</i>
- </p>
- <ol type="a">
- <li>
- <p>If nf == 0,</p>
-  <ol type="a">
-  <li>
- sets deltax = <tt><i>x<sub>max</sub></i></tt> - <tt><i>x<sub>min</sub></i></tt>, and</li>
- <li> lets the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist of the single
-     value <tt><i>w<sub>0</sub></i></tt> = 1, and</li>
- <li> lets the sequence <tt>b</tt> have length <tt>n+1</tt> with <tt><i>b<sub>0</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> and 
-               <tt><i>b<sub>1</sub></i></tt> = <tt><i>x<sub>max</sub></i></tt>
- </li>
- </ol>
- </li>
- <li>
- <p>Otherwise,</p>
- <ol type="a">
- <li> sets <tt>n = nf</tt>, <tt>deltax = </tt>(<tt><i>x<sub>max</sub></i></tt> - <tt><i>x<sub>min</sub></i></tt>)/n,
-                  <tt><i>x<sub>cent</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> + 0.5 * deltax, and
- </li>
- <li><p>lets the sequences <tt>w</tt> and <tt>b</tt> have length <tt>n</tt> and <tt>n+1</tt>, resp. and</p>
- <blockquote><pre>for each k = 0, . . . ,n-1, calculates:
-   <tt><i>dx<sub>k</sub></i></tt> = k * deltax
-   <tt><i>b<sub>k</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> + <tt><i>dx<sub>k</sub></i></tt>
-   <tt><i>x<sub>k</sub></i></tt> = <tt><i>x<sub>cent</sub></i></tt> + <tt><i>dx<sub>k</sub></i></tt>
-   <tt><i>w<sub>k</sub></i></tt> = fw(<tt><i>x<sub>k</sub></i></tt>),
- </pre></blockquote> 
- <p> and</p>
- </li>
- <li> sets <tt><i>b<sub>n</sub></i></tt> = <tt><i>x<sub>max</sub></i></tt></li>
- </ol>
- </li>
- <li>
- <p>
- Constructs a <tt>piecewise_constant_distribution</tt> object with
- the above computed sequence <tt>b</tt> as the interval boundaries
- and with the probability densities:
- </p>
- <blockquote><pre><tt><i>&#961;<sub>k</sub></i></tt> = <tt><i>w<sub>k</sub></i></tt>/(S * deltax)  for k = 0, . . . , n-1.
- </pre></blockquote> 
- </li>
- </ol>
- <p>
- [p5_4] [<i>Note:</i> In this context, the subintervals [<tt><i>b<sub>k</sub></i></tt>, <tt><i>b<sub>k+1</sub></i></tt>) are commonly
-  known as the <i>bins</i> of a histogram. <i>-- end note</i>]
-  </p>
- </blockquote>
- </blockquote>
- </li>
- </ol>
- 
- <p><b>Concept version of the proposed resolution</b></p>
- 
- <ol>
- <li>
- <p>
- In 26.5.8.5.2 [rand.dist.samp.pconst]/1, class <tt>piecewise_constant_distribution</tt>,
- just <em>before</em> the member declaration
- </p>
- 
- <blockquote><pre>explicit piecewise_constant_distribution(const param_type&amp; parm);
- </pre></blockquote>
- <p>
- insert:
- </p>
- <blockquote><pre>template&lt;Callable&lt;auto, RealType&gt; Func&gt;
-  requires Convertible&lt;Func::result_type, double&gt;
- piecewise_constant_distribution(size_t nf, RealType xmin, RealType xmax, Func fw);
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Between p.4 and p.5 insert a new sequence of paragraphs nominated
- below as [p5_1], [p5_2],
- [p5_3], and [p5_4] as part of the new member description:
- </p>
- 
- <blockquote><pre>template&lt;Callable&lt;auto, RealType&gt; Func&gt;
-  requires Convertible&lt;Func::result_type, double&gt;
- piecewise_constant_distribution(size_t nf, RealType xmin, RealType xmax, Func fw);
- </pre>
- <blockquote>
- <p>
- [p5_1] <i>Complexity:</i> Exactly <tt>nf</tt> invocations of <tt>fw</tt>.
- </p>
- <p>
- [p5_2] <i>Requires:</i>
- </p>
- <ol type="a">
- <li>
- For all sample values <tt><i>x<sub>k</sub></i></tt> defined below, fw(<tt><i>x<sub>k</sub></i></tt>) shall return a weight
- value <tt><i>w<sub>k</sub></i></tt> that is non-negative, non-NaN, and non-infinity;
- </li>
- <li>
- The following relations shall hold: <tt><i>x<sub>min</sub></i></tt> &lt; <tt><i>x<sub>max</sub></i></tt>, and
- 0 &lt; S = <tt><i>w<sub>0</sub></i></tt>+. . .+<tt><i>w<sub>n-1</sub></i></tt>.
- </li>
- </ol>
- <p>
- [p5_3] <i>Effects:</i>
- </p>
- <ol type="a">
- <li>
- <p>If nf == 0,</p>
-  <ol type="a">
-  <li>
- sets deltax = <tt><i>x<sub>max</sub></i></tt> - <tt><i>x<sub>min</sub></i></tt>, and</li>
- <li> lets the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist of the single
-     value <tt><i>w<sub>0</sub></i></tt> = 1, and</li>
- <li> lets the sequence <tt>b</tt> have length <tt>n+1</tt> with <tt><i>b<sub>0</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> and 
-               <tt><i>b<sub>1</sub></i></tt> = <tt><i>x<sub>max</sub></i></tt>
- </li>
- </ol>
- </li>
- <li>
- <p>Otherwise,</p>
- <ol type="a">
- <li> sets <tt>n = nf</tt>, <tt>deltax = </tt>(<tt><i>x<sub>max</sub></i></tt> - <tt><i>x<sub>min</sub></i></tt>)/n,
-                  <tt><i>x<sub>cent</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> + 0.5 * deltax, and
- </li>
- <li><p>lets the sequences <tt>w</tt> and <tt>b</tt> have length <tt>n</tt> and <tt>n+1</tt>, resp. and</p>
- <blockquote><pre>for each k = 0, . . . ,n-1, calculates:
-   <tt><i>dx<sub>k</sub></i></tt> = k * deltax
-   <tt><i>b<sub>k</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> + <tt><i>dx<sub>k</sub></i></tt>
-   <tt><i>x<sub>k</sub></i></tt> = <tt><i>x<sub>cent</sub></i></tt> + <tt><i>dx<sub>k</sub></i></tt>
-   <tt><i>w<sub>k</sub></i></tt> = fw(<tt><i>x<sub>k</sub></i></tt>),
- </pre></blockquote> 
- <p> and</p>
- </li>
- <li> sets <tt><i>b<sub>n</sub></i></tt> = <tt><i>x<sub>max</sub></i></tt></li>
- </ol>
- </li>
- <li>
- <p>
- Constructs a <tt>piecewise_constant_distribution</tt> object with
- the above computed sequence <tt>b</tt> as the interval boundaries
- and with the probability densities:
- </p>
- <blockquote><pre><tt><i>&#961;<sub>k</sub></i></tt> = <tt><i>w<sub>k</sub></i></tt>/(S * deltax)  for k = 0, . . . , n-1.
- </pre></blockquote> 
- </li>
- </ol>
- <p>
- [p5_4] [<i>Note:</i> In this context, the subintervals [<tt><i>b<sub>k</sub></i></tt>, <tt><i>b<sub>k+1</sub></i></tt>) are commonly
-  known as the <i>bins</i> of a histogram. <i>-- end note</i>]
-  </p>
- </blockquote>
- </blockquote>
- </li>
- </ol>
- 
- 
- 
- <p><b>Rationale:</b></p>
- Addressed by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
  
  
  
--- 18575,18587 ----
  </pre></blockquote>
  
  <p>
! Change 26.5.8.6.2 [rand.dist.samp.pconst]/6:
  </p>
  
! <blockquote><pre>
! vector&lt;double&gt; <del>densities</del> <ins>probabilities</ins>() const;
  </pre></blockquote>
  
  
  
  
*************** Addressed by
*** 21274,21284 ****
  
  <hr>
  <h3><a name="795"></a>795. <tt>general_pdf_distribution</tt> should be dropped</h3>
! <p><b>Section:</b> X [rand.dist.samp.genpdf] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.genpdf">issues</a> in [rand.dist.samp.genpdf].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a></p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>general_pdf_distribution</tt> should be dropped. (It's a research topic in
--- 18589,18599 ----
  
  <hr>
  <h3><a name="795"></a>795. <tt>general_pdf_distribution</tt> should be dropped</h3>
! <p><b>Section:</b> X [rand.dist.samp.genpdf] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.genpdf">issues</a> in [rand.dist.samp.genpdf].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#732">732</a></p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>general_pdf_distribution</tt> should be dropped. (It's a research topic in
*************** Stephan Tolksdorf notes:
*** 21290,21298 ****
  ]</i></p>
  
  
! <blockquote>
! This appears to be a duplicate of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 18605,18613 ----
  ]</i></p>
  
  
! <blockquote><p>
! This appears to be a duplicate of <a href="lwg-defects.html#732">732</a>.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** This appears to be a duplicate of <a hre
*** 21304,21313 ****
  
  <hr>
  <h3><a name="796"></a>796. <tt>ranlux48_base</tt> returns wrong value</h3>
! <p><b>Section:</b> 26.5.5 [rand.predef] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.predef">issues</a> in [rand.predef].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The 10,000<sup>th</sup> value returned by <tt>ranlux48_base</tt> is supposed to be
--- 18619,18628 ----
  
  <hr>
  <h3><a name="796"></a>796. <tt>ranlux48_base</tt> returns wrong value</h3>
! <p><b>Section:</b> 26.5.5 [rand.predef] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.predef">issues</a> in [rand.predef].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The 10,000<sup>th</sup> value returned by <tt>ranlux48_base</tt> is supposed to be
*************** Bellevue:
*** 21320,21328 ****
  ]</i></p>
  
  
! <blockquote>
  Submitter withdraws defect.
! </blockquote>
  
  
  
--- 18635,18643 ----
  ]</i></p>
  
  
! <blockquote><p>
  Submitter withdraws defect.
! </p></blockquote>
  
  
  
*************** Change 26.5.5 [rand.predef]/p5:
*** 21332,21345 ****
  </p>
  
  <blockquote>
! <pre>typedef subtract_with_carry_engine&lt;uint_fast64_t, 48, 5, 12&gt; 
          ranlux48_base; 
  </pre>
! <blockquote>
  <i>Required behavior:</i> The 10000<sup>th</sup> consecutive invocation of a default-constructed
  object of type <tt>ranlux48_base</tt> shall produce the value
  <del>61839128582725</del> <ins>192113843633948</ins>.
! </blockquote>
  </blockquote>
  
  
--- 18647,18661 ----
  </p>
  
  <blockquote>
! <pre>
! typedef subtract_with_carry_engine&lt;uint_fast64_t, 48, 5, 12&gt; 
          ranlux48_base; 
  </pre>
! <blockquote><p>
  <i>Required behavior:</i> The 10000<sup>th</sup> consecutive invocation of a default-constructed
  object of type <tt>ranlux48_base</tt> shall produce the value
  <del>61839128582725</del> <ins>192113843633948</ins>.
! </p></blockquote>
  </blockquote>
  
  
*************** object of type <tt>ranlux48_base</tt> sh
*** 21348,21357 ****
  
  <hr>
  <h3><a name="797"></a>797. <tt>ranlux48</tt> returns wrong value</h3>
! <p><b>Section:</b> 26.5.5 [rand.predef] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.predef">issues</a> in [rand.predef].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The 10,000<sup>th</sup> value returned by <tt>ranlux48</tt> is supposed to be
--- 18664,18673 ----
  
  <hr>
  <h3><a name="797"></a>797. <tt>ranlux48</tt> returns wrong value</h3>
! <p><b>Section:</b> 26.5.5 [rand.predef] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.predef">issues</a> in [rand.predef].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The 10,000<sup>th</sup> value returned by <tt>ranlux48</tt> is supposed to be
*************** Bellevue:
*** 21363,21371 ****
  ]</i></p>
  
  
! <blockquote>
  Submitter withdraws defect.
! </blockquote>
  
  
  
--- 18679,18687 ----
  ]</i></p>
  
  
! <blockquote><p>
  Submitter withdraws defect.
! </p></blockquote>
  
  
  
*************** Change 26.5.5 [rand.predef]/p6:
*** 21375,21388 ****
  </p>
  
  <blockquote>
! <pre>typedef discard_block_engine&lt;ranlux48_base, 389, 11&gt; 
          ranlux48
  </pre>
! <blockquote>
  <i>Required behavior:</i> The 10000<sup>th</sup> consecutive invocation of a default-constructed
  object of type <tt>ranlux48</tt> shall produce the value
  <del>249142670248501</del> <ins>88229545517833</ins>.
! </blockquote>
  </blockquote>
  
  
--- 18691,18705 ----
  </p>
  
  <blockquote>
! <pre>
! typedef discard_block_engine&lt;ranlux48_base, 389, 11&gt; 
          ranlux48
  </pre>
! <blockquote><p>
  <i>Required behavior:</i> The 10000<sup>th</sup> consecutive invocation of a default-constructed
  object of type <tt>ranlux48</tt> shall produce the value
  <del>249142670248501</del> <ins>88229545517833</ins>.
! </p></blockquote>
  </blockquote>
  
  
*************** object of type <tt>ranlux48</tt> shall p
*** 21391,21400 ****
  
  <hr>
  <h3><a name="799"></a>799. [tr.rand.eng.mers] and [rand.eng.mers]</h3>
! <p><b>Section:</b> 26.5.3.2 [rand.eng.mers], TR1 5.1.4.2 [tr.rand.eng.mers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2008-02-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.eng.mers">issues</a> in [rand.eng.mers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  TR1 5.1.4.2 [tr.rand.eng.mers](10) requires that <tt>operator==</tt> for the <tt>mersenne_twister</tt>
--- 18708,18717 ----
  
  <hr>
  <h3><a name="799"></a>799. [tr.rand.eng.mers] and [rand.eng.mers]</h3>
! <p><b>Section:</b> 26.5.3.2 [rand.eng.mers], TR1 5.1.4.2 [tr.rand.eng.mers] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2008-02-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.eng.mers">issues</a> in [rand.eng.mers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  TR1 5.1.4.2 [tr.rand.eng.mers](10) requires that <tt>operator==</tt> for the <tt>mersenne_twister</tt>
*************** In 26.5.3.2 [rand.eng.mers]:
*** 21469,21586 ****
  Insert at the end of para 2.:
  </p>
  
! <blockquote>
  [<i>Note:</i> The lower <tt>r</tt> bits of <tt>X<sub>i-n</sub></tt> do not influence
  the state transition and hence should not be compared when comparing two
  <tt>mersenne_twister_engine</tt> objects. <i>-- end note</i>]
! </blockquote>
  
  <p>
  In para 5. change:
  </p>
  
! <blockquote>
  The textual representation of <tt>x<sub>i</sub></tt> consists of the values of
  <tt>X<sub>i-n</sub> <ins>bitand ((2<sup>w</sup> - 1) - (2<sup>r</sup> - 1)),  X<sub>i-(n-1)</sub></ins>,
  ..., X<sub>i-1</sub></tt>, in that order.
! </blockquote>
! </blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="800"></a>800. Issues in 26.4.7.1 [rand.util.seedseq](6)</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2008-02-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The for-loop in the algorithm specification has <tt>n</tt> iterations, where <tt>n</tt> is
! defined to be <tt>end - begin</tt>, i.e. the number of supplied w-bit quantities.
! Previous versions of this algorithm and the general logic behind it
! suggest that this is an oversight and that in the context of the
! for-loop <tt>n</tt> should be the number of full 32-bit quantities in <tt>b</tt> (rounded
! upwards). If <tt>w</tt> is 64, the current algorithm throws away half of all bits
! in <tt>b</tt>. If <tt>w</tt> is 16, the current algorithm sets half of all elements in <tt>v</tt>
! to 0.
! </p>
! 
! <p>
! There are two more minor issues:
! </p>
! 
! <ul>
! <li>
! Strictly speaking <tt>end - begin</tt> is not defined since
! <tt>InputIterator</tt> is not required to be a random access iterator.
! </li>
! <li>
! Currently all integral types are allowed as input to the <tt>seed_seq</tt>
! constructor, including <tt>bool</tt>. IMHO allowing <tt>bool</tt>s unnecessarily
! complicates the implementation without any real benefit to the user.
! I'd suggest to exclude <tt>bool</tt>s as input.
! </li>
! </ul>
! 
! <p><i>[
! Bellevue:
! ]</i></p>
! 
! 
! <blockquote>
! Move to OPEN Bill will try to propose a resolution by the next meeting.
! </blockquote>
! 
! <p><i>[
! post Bellevue:  Bill provided wording.
! ]</i></p>
! 
! 
! <p>
! This issue is made moot if <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a> is accepted.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Replace 26.5.7.1 [rand.util.seedseq] paragraph 6 with:
! </p>
! 
! <blockquote>
! <p>
! <i>Effects:</i> Constructs a <tt>seed_seq</tt> object by effectively concatenating the
! low-order <tt>u</tt> bits of each of the elements of the supplied sequence <tt>[begin,
! end)</tt>
! in ascending order of significance to make a (possibly very large) unsigned
! binary number <tt>b</tt> having a total of <tt>n</tt> bits, and then carrying out the
! following
! algorithm:
! </p>
! 
! <blockquote><pre>for( v.clear(); n &gt; 0; n -= 32 )
!    v.push_back(b mod 2<sup>32</sup>), b /= 2<sup>32</sup>;
! </pre></blockquote>
  </blockquote>
  
  
- <p><b>Rationale:</b></p>
- Addressed by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
- 
- 
  
  
  
  <hr>
  <h3><a name="802"></a>802. <tt>knuth_b</tt> returns wrong value</h3>
! <p><b>Section:</b> 26.5.5 [rand.predef] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.predef">issues</a> in [rand.predef].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The 10,000<sup>th</sup> value returned by <tt>knuth_b</tt> is supposed to be
--- 18786,18818 ----
  Insert at the end of para 2.:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> The lower <tt>r</tt> bits of <tt>X<sub>i-n</sub></tt> do not influence
  the state transition and hence should not be compared when comparing two
  <tt>mersenne_twister_engine</tt> objects. <i>-- end note</i>]
! </p></blockquote>
  
  <p>
  In para 5. change:
  </p>
  
! <blockquote><p>
  The textual representation of <tt>x<sub>i</sub></tt> consists of the values of
  <tt>X<sub>i-n</sub> <ins>bitand ((2<sup>w</sup> - 1) - (2<sup>r</sup> - 1)),  X<sub>i-(n-1)</sub></ins>,
  ..., X<sub>i-1</sub></tt>, in that order.
! </p></blockquote>
  </blockquote>
  
  
  
  
  
  <hr>
  <h3><a name="802"></a>802. <tt>knuth_b</tt> returns wrong value</h3>
! <p><b>Section:</b> 26.5.5 [rand.predef] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.predef">issues</a> in [rand.predef].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The 10,000<sup>th</sup> value returned by <tt>knuth_b</tt> is supposed to be
*************** Change 26.5.5 [rand.predef]/p8:
*** 21594,21607 ****
  </p>
  
  <blockquote>
! <pre>typedef shuffle_order_engine&lt;minstd_rand0, 256&gt; 
          knuth_b; 
  </pre>
! <blockquote>
  <i>Required behavior:</i> The 10000<sup>th</sup> consecutive invocation of a default-constructed
  object of type <tt>knuth_b</tt> shall produce the value
  <del>1112339016</del> <ins>2126698284</ins>.
! </blockquote>
  </blockquote>
  
  
--- 18826,18840 ----
  </p>
  
  <blockquote>
! <pre>
! typedef shuffle_order_engine&lt;minstd_rand0, 256&gt; 
          knuth_b; 
  </pre>
! <blockquote><p>
  <i>Required behavior:</i> The 10000<sup>th</sup> consecutive invocation of a default-constructed
  object of type <tt>knuth_b</tt> shall produce the value
  <del>1112339016</del> <ins>2126698284</ins>.
! </p></blockquote>
  </blockquote>
  
  
*************** Bellevue: Submitter withdraws defect. "W
*** 21614,21874 ****
  
  
  <hr>
- <h3><a name="803"></a>803. Simplification of <tt>seed_seq::seq_seq</tt></h3>
- <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2008-02-22 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- <tt>seed_seq(InputIterator begin, InputIterator end);</tt> constructs a <tt>seed_seq</tt>
- object repacking the bits of supplied sequence <tt>[begin, end)</tt> into a
- 32-bit vector.
- </p>
- <p>
- This repacking triggers several problems:
- </p>
- <ol>
- <li>
- Distinctness of the output of <tt>seed_seq::generate</tt> required the
- introduction of the initial "<tt>if (w &lt; 32) v.push_back(n);</tt>"  (Otherwise
- the unsigned short vectors [1, 0] and [1] generate the same sequence.)
- </li>
- <li>
- Portability demanded the introduction of the template parameter <tt>u</tt>.
- (Otherwise some sequences could not be obtained on computers where no
- integer types are exactly 32-bits wide.)
- </li>
- <li>
- The description and algorithm have become unduly complicated.
- </li>
- </ol>
- <p>
- I propose simplifying this <tt>seed_seq</tt> constructor to be "32-bit only".
- Despite it's being simpler, there is NO loss of functionality (see
- below).
- </p>
- <p>
- Here's how the description would read
- </p>
- <blockquote>
- <p>
- 26.5.7.1 [rand.util.seedseq] Class <tt>seed_seq</tt>
- </p>
- 
- <blockquote>
- <pre>template&lt;class InputIterator&gt;
-   seed_seq(InputIterator begin, InputIterator end);
- </pre>
- <blockquote>
- <p>
- 5 <i>Requires:</i> NO CHANGE
- </p>
- <p>
- 6 <i>Effects:</i> Constructs a <tt>seed_seq</tt> object by
- </p>
- <blockquote>
- <pre>for (InputIterator s = begin; s != end; ++s)
-    v.push_back((*s) mod 2^32);
- </pre>
- </blockquote>
- </blockquote>
- </blockquote>
- </blockquote>
- 
- <p>
- Discussion:
- </p>
- <p>
- The chief virtues here are simplicity, portability, and generality.
- </p>
- <ul>
- <li>
- Simplicity -- compare the above specification with the
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a> proposal.
- </li>
- <li>
- Portability -- with <tt>iterator_traits&lt;InputIterator&gt;::value_type =
- uint_least32_t</tt> the user is guaranteed to get the same behavior across
- platforms.
- </li>
- <li>
- Generality -- any behavior that the
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
- proposal can achieve can be
- obtained with this simpler proposal (albeit with a shuffling of bits
- in the input sequence).
- </li>
- </ul>
- <p>
- Arguments (and counter-arguments) against making this change (and
- retaining the
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
- behavior) are:
- </p>
- <ul>
- <li>
- <p>
- The user can pass an array of <tt>unsigned char</tt> and <tt>seed_seq</tt> will nicely
-  repack it.
- </p>
- <p>
-  Response: So what?  Consider the seed string "ABC".  The
-  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
-  proposal results in
- </p>
- <blockquote><pre>v = { 0x3, 0x434241 };
- </pre></blockquote>
- <p>
- while the simplified proposal yields
- </p>
- <blockquote><pre>v = { 0x41, 0x42, 0x43 };
- </pre></blockquote>
- <p>
- The results produced by <tt>seed_seq::generate</tt> with the two inputs are
- different but nevertheless equivalently "mixed up" and this remains
- true even if the seed string is long.
- </p>
- </li>
- <li>
- <p>
- With long strings (e.g., with bit-length comparable to the number of
-  bits in the state), <tt>v</tt> is longer (by a factor of 4) with the simplified
-  proposal and <tt>seed_seq::generate</tt> will be slower.
- </p>
- <p>
- Response: It's unlikely that the efficiency of <tt>seed_seq::generate</tt> will
-  be a big issue.  If it is, the user is free to repack the seed vector
-  before constructing <tt>seed_seq</tt>.
- </p>
- </li>
- <li>
- <p>
- A user can pass an array of 64-bit integers and all the bits will be
-  used.
- </p>
- <p>
-  Response: Indeed.  However, there are many instances in the 
-  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
-  where integers are silently coerced to a narrower width and this
-  should just be a case of the user needing to read the documentation.
-  The user can of course get equivalent behavior by repacking his seed
-  into 32-bit pieces.  Furthermore, the unportability of the 
-  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
-  proposal with
- </p>
- <blockquote><pre>unsigned long s[] = {1, 2, 3, 4};
- seed_seq q(s, s+4);
- </pre></blockquote>
- <p>
-  which typically results in <tt>v = {1, 2, 3, 4}</tt> on 32-bit machines and in
- <tt>v = {1, 0, 2, 0, 3, 0, 4, 0}</tt> on 64-bit machines is a major pitfall for
-  unsuspecting users.
- </p>
- </li>
- </ul>
- 
- <p>
- Note: this proposal renders moot issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#800">800</a>.
- </p>
- 
- <p><i>[
- Bellevue:
- ]</i></p>
- 
- 
- <blockquote>
- Walter needs to ask Fermilab for guidance. Defer till tomorrow. Bill likes the proposed resolution.
- </blockquote>
- 
- <p><i>[
- Sophia Antipolis:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Marc Paterno wants portable behavior between 32bit and 64bit machines;
- we've gone to significant trouble to support portability of engines and
- their values.
- </p>
- <p>
- Jens: the new algorithm looks perfectly portable
- </p>
- <p>
- Marc Paterno to review off-line.
- </p>
- <p>
- Modify the proposed resolution to read "Constructs a seed_seq object by the following algorithm ..."
- </p>
- <p>
- Disposition: move to review; unanimous consent.
- </p>
- <p>
- (moots <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#800">800</a>)
- </p>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change 26.5.7.1 [rand.util.seedseq]:
- </p>
- 
- <blockquote>
- <pre>template&lt;class InputIterator<del>, 
-   size_t u = numeric_limits&lt;iterator_traits&lt;InputIterator&gt;::value_type&gt;::digits</del>&gt;
-   seed_seq(InputIterator begin, InputIterator end);
- </pre>
- <blockquote>
- <p>
- -5- <i>Requires:</i> <tt>InputIterator</tt> shall satisfy the requirements of an input iterator (24.1.1)
- such that <tt>iterator_traits&lt;InputIterator&gt;::value_type</tt> shall denote an integral type.
- </p>
- <p>
- -6- Constructs a <tt>seed_seq</tt> object by <ins>the following algorithm</ins> <del>rearranging some or all of the bits of the supplied sequence
- <tt>[begin,end)</tt> of w-bit quantities into 32-bit units, as if by the following: </del>
- </p>
- <p>
- <del>First extract the rightmost <tt>u</tt> bits from each of the <tt>n = end
- - begin</tt> elements of the supplied sequence and concatenate all the
- extracted bits to initialize a single (possibly very large) unsigned
- binary number, <tt>b = &#8721;<sup>n-1</sup><sub>i=0</sub> (begin[i] 
- mod 2<sup>u</sup>) · 2<sup>w·i</sup></tt> (in which the bits of each <tt>begin[i]</tt>
- are treated as denoting an unsigned quantity). Then carry out 
- the following algorithm:</del>
- </p>
- <blockquote><pre><del>
- v.clear(); 
- if ($w$ &lt; 32) 
-   v.push_back($n$); 
- for( ; $n$ &gt; 0; --$n$) 
-   v.push_back(b mod 2<sup>32</sup>), b /= 2<sup>32</sup>;
- </del></pre></blockquote>
- <blockquote>
- <pre><ins>
- for (InputIterator s = begin; s != end; ++s)
-    v.push_back((*s) mod 2<sup>32</sup>);
- </ins></pre>
- </blockquote>
- </blockquote>
- </blockquote>
- 
- 
- <p><b>Rationale:</b></p>
- Addressed by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="812"></a>812. unsolicited multithreading considered harmful?</h3>
! <p><b>Section:</b> 25.4.1 [alg.sort] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paul McKenney <b>Opened:</b> 2008-02-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Multi-threading is a good thing, but unsolicited multi-threading can
--- 18847,18856 ----
  
  
  <hr>
  <h3><a name="812"></a>812. unsolicited multithreading considered harmful?</h3>
! <p><b>Section:</b> 25.4.1 [alg.sort] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Paul McKenney <b>Opened:</b> 2008-02-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Multi-threading is a good thing, but unsolicited multi-threading can
*************** Thread-Safety in the Standard Library (R
*** 21900,21925 ****
  </p>
  
  
! <p><b>Rationale:</b></p>
  This is already covered by 17.6.5.6/20 in N2723.
! 
  
  
  
  
  <hr>
  <h3><a name="822"></a>822. Object with explicit copy constructor no longer <tt>CopyConstructible</tt></h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2008-04-01 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I just noticed that the following program is legal in C++03, but
  is forbidden in the current draft:
  </p>
  
! <blockquote><pre>#include &lt;vector&gt;
  #include &lt;iostream&gt;
  
  class Toto
--- 18882,18908 ----
  </p>
  
  
! <p><b>Rationale:</b></p><p>
  This is already covered by 17.6.5.6/20 in N2723.
! </p>
  
  
  
  
  <hr>
  <h3><a name="822"></a>822. Object with explicit copy constructor no longer <tt>CopyConstructible</tt></h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2008-04-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I just noticed that the following program is legal in C++03, but
  is forbidden in the current draft:
  </p>
  
! <blockquote><pre>
! #include &lt;vector&gt;
  #include &lt;iostream&gt;
  
  class Toto
*************** San Francisco:
*** 21948,21957 ****
  ]</i></p>
  
  
! <blockquote>
  The subgroup that looked at this felt this was a good change, but it may
  already be handled by incoming concepts (we're not sure).
! </blockquote>
  
  <p><i>[
  Post Summit:
--- 18931,18940 ----
  ]</i></p>
  
  
! <blockquote><p>
  The subgroup that looked at this felt this was a good change, but it may
  already be handled by incoming concepts (we're not sure).
! </p></blockquote>
  
  <p><i>[
  Post Summit:
*************** Recommend close as NAD.
*** 21977,21985 ****
  ]</i></p>
  
  
! <blockquote>
  Need to look at again without concepts.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 18960,18968 ----
  ]</i></p>
  
  
! <blockquote><p>
  Need to look at again without concepts.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** and <tt>CopyConstructible</tt> requireme
*** 22008,22019 ****
  
  <blockquote>
  <p>
! In 20.2.1 [utility.arg.requirements] change Table 33: <tt>MoveConstructible</tt> requirements [moveconstructible]:
  </p>
  
  <blockquote>
  <table border="1">
! <tbody><tr>
  <th>expression</th><th>post-condition</th>
  </tr>
  <tr>
--- 18991,19002 ----
  
  <blockquote>
  <p>
! In 17.6.3.1 [utility.arg.requirements] change Table 33: <tt>MoveConstructible</tt> requirements [moveconstructible]:
  </p>
  
  <blockquote>
  <table border="1">
! <tr>
  <th>expression</th><th>post-condition</th>
  </tr>
  <tr>
*************** In 20.2.1 [utility.arg.requirements] cha
*** 22022,22037 ****
  <tr>
  <td colspan="2" align="center">...</td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
! In 20.2.1 [utility.arg.requirements] change Table 34: <tt>CopyConstructible</tt> requirements [copyconstructible]:
  </p>
  
  <blockquote>
  <table border="1">
! <tbody><tr>
  <th>expression</th><th>post-condition</th>
  </tr>
  <tr>
--- 19005,19020 ----
  <tr>
  <td colspan="2" align="center">...</td>
  </tr>
! </table>
  </blockquote>
  
  <p>
! In 17.6.3.1 [utility.arg.requirements] change Table 34: <tt>CopyConstructible</tt> requirements [copyconstructible]:
  </p>
  
  <blockquote>
  <table border="1">
! <tr>
  <th>expression</th><th>post-condition</th>
  </tr>
  <tr>
*************** In 20.2.1 [utility.arg.requirements] cha
*** 22040,22137 ****
  <tr>
  <td colspan="2" align="center">...</td>
  </tr>
! </tbody></table>
! </blockquote>
! 
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3215.html">n3215</a>.
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="825"></a>825. Missing rvalues reference stream insert/extract operators?</h3>
! <p><b>Section:</b> 19.5.2.1 [syserr.errcode.overview], 20.9.10.2.8 [util.smartptr.shared.io], 22.4.8 [facets.examples], 20.5.4 [bitset.operators], 26.4.6 [complex.ops], 27.6 [stream.buffers], 28.9 [re.submatch] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-04-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses UK 220</b></p>
! 
! <p>
! Should the following use rvalues references to stream in insert/extract
! operators?
! </p>
! 
! <ul>
! <li>19.5.2.1 [syserr.errcode.overview]</li>
! <li>20.9.10.2.8 [util.smartptr.shared.io]</li>
! <li>22.4.8 [facets.examples]</li>
! <li>20.5.4 [bitset.operators]</li>
! <li>26.4.6 [complex.ops]</li>
! <li>Doubled signatures in 27.6 [stream.buffers] for character inserters
! (ref 27.7.2.6.4 [ostream.inserters.character])
! + definition 27.7.2.6.4 [ostream.inserters.character]</li>
! <li>28.9 [re.submatch]</li>
! </ul>
! 
! <p><i>[
! Sophia Antipolis
! ]</i></p>
! 
! 
! <blockquote>
! Agree with the idea in the issue, Alisdair to provide wording.
  </blockquote>
  
- <p><i>[
- Daniel adds 2009-02-14:
- ]</i></p>
- 
- 
- <blockquote>
- The proposal given in the paper
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2831.html">N2831</a>
- apparently resolves this issue.
  </blockquote>
  
- <p><i>[
- Batavia (2009-05):
- ]</i></p>
- 
- <blockquote>
- <p>
- The cited paper is an earlier version of
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2844.html">N2844</a>,
- which changed the rvalue reference binding rules.
- That paper includes generic templates
- <tt>operator&lt;&lt;</tt> and <tt>operator&gt;&gt;</tt>
- that adapt rvalue streams.
- </p>
- <p>
- We therefore agree with Daniel's observation.
- Move to NAD Editorial.
- </p>
- </blockquote>
  
  
! <p><b>Proposed resolution:</b></p>
! <p>
  </p>
  
  
  
  
- 
  <hr>
  <h3><a name="826"></a>826. Equivalent of <tt>%'d</tt>, or rather, lack thereof?</h3>
! <p><b>Section:</b> 22.4.2.2 [locale.nm.put] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-04-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the spirit of <tt>printf vs iostream</tt>...
--- 19023,19047 ----
  <tr>
  <td colspan="2" align="center">...</td>
  </tr>
! </table>
  </blockquote>
  
  </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
! Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3215.htm">n3215</a>.
  </p>
  
  
  
  
  <hr>
  <h3><a name="826"></a>826. Equivalent of <tt>%'d</tt>, or rather, lack thereof?</h3>
! <p><b>Section:</b> 22.4.2.2 [locale.nm.put] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-04-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the spirit of <tt>printf vs iostream</tt>...
*************** Pablo Halpern:
*** 22150,22304 ****
  ]</i></p>
  
  
! <blockquote>
  I'm not sure it constitutes a defect, but I would be in favor of adding
  another flag (and corresponding manipulator).
! </blockquote>
  
  <p><i>[
  Martin Sebor:
  ]</i></p>
  
  
! <blockquote>
  I don't know if it qualifies as a defect but I agree that there
  should be an easy way to control whether the thousands separator
  should or shouldn't be inserted. A new flag would be in line with
  the current design of iostreams (like <tt>boolalpha</tt>, <tt>showpos</tt>, or
  <tt>showbase</tt>).
! </blockquote>
  
  <p><i>[
  Sophia Antipolis:
  ]</i></p>
  
  
! <blockquote>
  This is not a part of C99. LWG suggests submitting a paper may be appropriate.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="828"></a>828. Static initialization for <tt>std::mutex</tt>?</h3>
! <p><b>Section:</b> 30.4.1.2.1 [thread.mutex.class] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-04-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.class">issues</a> in [thread.mutex.class].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! [Note: I'm assuming here that 3.6.2 [basic.start.init]/1 will be fixed.]
! </p>
! <p>
! Currently <tt>std::mutex</tt> doesn't support static initialization. This is a
! regression with respect to <tt>pthread_mutex_t</tt>, which does. I believe that
! we should strive to eliminate such regressions in expressive power where
! possible, both to ease migration and to not provide incentives to (or
! force) people to forego the C++ primitives in favor of pthreads.
! </p>
! 
! <p><i>[
! Sophia Antipolis:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! We believe this is implementable on POSIX, because the initializer-list
! feature and the constexpr feature make this work. Double-check core
! language about static initialization for this case. Ask core for a core
! issue about order of destruction of statically-initialized objects wrt.
! dynamically-initialized objects (should come afterwards). Check
! non-POSIX systems for implementability.
! </p>
! <p>
! If ubiquitous implementability cannot be assured, plan B is to introduce
! another constructor, make this constexpr, which is
! conditionally-supported. To avoid ambiguities, this new constructor needs
! to have an additional parameter.
! </p>
! </blockquote>
! 
! <p><i>[
! Post Summit:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Jens: constant initialization seems to be ok core-language wise
! </p>
! <p>
! Consensus: Defer to threading experts, in particular a Microsoft platform expert.
! </p>
! <p>
! Lawrence to send e-mail to Herb Sutter, Jonathan Caves, Anthony Wiliams,
! Paul McKenney, Martin Tasker, Hans Boehm, Bill Plauger, Pete Becker,
! Peter Dimov to alert them of this issue.
! </p>
! <p>
! Lawrence: What about header file shared with C? The initialization
! syntax is different in C and C++.
! </p>
! <p>
! Recommend Keep in Review
! </p>
! </blockquote>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote>
! Keep in Review status pending feedback from members of the Concurrency subgroup.
! </blockquote>
! 
! <p><i>[
! See related comments from Alisdiar and Daniel in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.html">N2994</a>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
- Change 30.4.1.2.1 [thread.mutex.class]:
  </p>
  
- <blockquote><pre>class mutex {
- public:
-   <ins>constexpr</ins> mutex();
-   ...
- </pre></blockquote>
- 
  
  
  
  
  <hr>
  <h3><a name="830"></a>830. Incomplete list of char_traits specializations</h3>
! <p><b>Section:</b> 21.2 [char.traits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 2008-04-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#char.traits">issues</a> in [char.traits].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
    Paragraph 4 of 21.2 [char.traits] mentions that this
--- 19060,19108 ----
  ]</i></p>
  
  
! <blockquote><p>
  I'm not sure it constitutes a defect, but I would be in favor of adding
  another flag (and corresponding manipulator).
! </p></blockquote>
  
  <p><i>[
  Martin Sebor:
  ]</i></p>
  
  
! <blockquote><p>
  I don't know if it qualifies as a defect but I agree that there
  should be an easy way to control whether the thousands separator
  should or shouldn't be inserted. A new flag would be in line with
  the current design of iostreams (like <tt>boolalpha</tt>, <tt>showpos</tt>, or
  <tt>showbase</tt>).
! </p></blockquote>
  
  <p><i>[
  Sophia Antipolis:
  ]</i></p>
  
  
! <blockquote><p>
  This is not a part of C99. LWG suggests submitting a paper may be appropriate.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  </p>
  
  
  
  
  
  <hr>
  <h3><a name="830"></a>830. Incomplete list of char_traits specializations</h3>
! <p><b>Section:</b> 21.2 [char.traits] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Dietmar K&#252;hl <b>Opened:</b> 2008-04-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#char.traits">issues</a> in [char.traits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
    Paragraph 4 of 21.2 [char.traits] mentions that this
*************** public:
*** 22314,22324 ****
  Alisdair adds:
  ]</i></p>
  
! <blockquote>
  <tt>char_traits&lt; char16/32_t &gt;</tt>
  should also be added to <tt>&lt;ios_fwd&gt;</tt> in 27.3 [iostream.forward], and all the specializations
  taking a <tt>char_traits</tt> parameter in that header.
! </blockquote>
  
  <p><i>[
  Sophia Antipolis:
--- 19118,19128 ----
  Alisdair adds:
  ]</i></p>
  
! <blockquote><p>
  <tt>char_traits&lt; char16/32_t &gt;</tt>
  should also be added to <tt>&lt;ios_fwd&gt;</tt> in 27.3 [iostream.forward], and all the specializations
  taking a <tt>char_traits</tt> parameter in that header.
! </p></blockquote>
  
  <p><i>[
  Sophia Antipolis:
*************** Original proposed wording.
*** 22384,22392 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree.  Move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 19188,19196 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree.  Move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Change Forward declarations 27.3 [iostre
*** 22398,22404 ****
  <p>
  <b>Header <tt>&lt;iosfwd&gt;</tt> synopsis</b>
  </p>
! <pre>namespace std {
     template&lt;class charT&gt; class char_traits;
     template&lt;&gt; class char_traits&lt;char&gt;;
     <ins>template&lt;&gt; class char_traits&lt;char16_t&gt;;</ins>
--- 19202,19209 ----
  <p>
  <b>Header <tt>&lt;iosfwd&gt;</tt> synopsis</b>
  </p>
! <pre>
! namespace std {
     template&lt;class charT&gt; class char_traits;
     template&lt;&gt; class char_traits&lt;char&gt;;
     <ins>template&lt;&gt; class char_traits&lt;char16_t&gt;;</ins>
*************** Change Forward declarations 27.3 [iostre
*** 22415,22424 ****
  
  <hr>
  <h3><a name="831"></a>831. wrong type for not_eof()</h3>
! <p><b>Section:</b> 21.2.3 [char.traits.specializations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 2008-04-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#char.traits.specializations">issues</a> in [char.traits.specializations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
    In Table 56 (Traits requirements) the <tt>not_eof()</tt> member function
--- 19220,19229 ----
  
  <hr>
  <h3><a name="831"></a>831. wrong type for not_eof()</h3>
! <p><b>Section:</b> 21.2.3 [char.traits.specializations] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Dietmar K&#252;hl <b>Opened:</b> 2008-04-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#char.traits.specializations">issues</a> in [char.traits.specializations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
    In Table 56 (Traits requirements) the <tt>not_eof()</tt> member function
*************** Change Forward declarations 27.3 [iostre
*** 22447,22465 ****
  </p>
  
  
! <p><b>Rationale:</b></p>
  Already fixed in WP.
! 
  
  
  
  
  <hr>
  <h3><a name="832"></a>832. Applying constexpr to System error support</h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-05-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Initialization of objects of class <tt>error_code</tt>
--- 19252,19270 ----
  </p>
  
  
! <p><b>Rationale:</b></p><p>
  Already fixed in WP.
! </p>
  
  
  
  
  <hr>
  <h3><a name="832"></a>832. Applying constexpr to System error support</h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-05-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Initialization of objects of class <tt>error_code</tt>
*************** Thanks to Jens Maurer, Gabriel Dos Reis,
*** 22489,22498 ****
  </p>
  
  <p>
! LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a> is related in that it raises the question of whether the
  exposition only member <tt>cat_</tt> of class <tt>error_code</tt> (19.5.2 [syserr.errcode]) and class
  <tt>error_condition</tt> (19.5.3 [syserr.errcondition]) should be presented as a reference or pointer.
! While in the context of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a> that is arguably an editorial question,
  presenting it as a pointer becomes more or less required with this
  proposal, given <tt>constexpr</tt> does not play well with references. The
  proposed resolution thus changes the private member to a pointer, which
--- 19294,19303 ----
  </p>
  
  <p>
! LWG issue <a href="lwg-defects.html#804">804</a> is related in that it raises the question of whether the
  exposition only member <tt>cat_</tt> of class <tt>error_code</tt> (19.5.2 [syserr.errcode]) and class
  <tt>error_condition</tt> (19.5.3 [syserr.errcondition]) should be presented as a reference or pointer.
! While in the context of <a href="lwg-defects.html#804">804</a> that is arguably an editorial question,
  presenting it as a pointer becomes more or less required with this
  proposal, given <tt>constexpr</tt> does not play well with references. The
  proposed resolution thus changes the private member to a pointer, which
*************** Sophia Antipolis:
*** 22504,22512 ****
  ]</i></p>
  
  
! <blockquote>
  On going question of extern pointer vs. inline functions for interface.
! </blockquote>
  
  <p><i>[
  Pre-San Francisco:
--- 19309,19317 ----
  ]</i></p>
  
  
! <blockquote><p>
  On going question of extern pointer vs. inline functions for interface.
! </p></blockquote>
  
  <p><i>[
  Pre-San Francisco:
*************** Gabriel and Jens Maurer.
*** 22531,22539 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! The proposed wording assumes the LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a> proposed wording has been
  applied to the WP, resulting in the former <tt>posix_category</tt> being renamed
! <tt>generic_category</tt>. If <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a> has not been applied, the names in this
  proposal must be adjusted accordingly.
  </p>
  
--- 19336,19344 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! The proposed wording assumes the LWG <a href="lwg-defects.html#805">805</a> proposed wording has been
  applied to the WP, resulting in the former <tt>posix_category</tt> being renamed
! <tt>generic_category</tt>. If <a href="lwg-defects.html#805">805</a> has not been applied, the names in this
  proposal must be adjusted accordingly.
  </p>
  
*************** Change 19.5.1.1 [syserr.errcat.overview]
*** 22543,22549 ****
  indicated:
  </p>
  
! <blockquote><pre><del>const error_category&amp; get_generic_category();</del>
  <del>const error_category&amp; get_system_category();</del>
  
  <del>static</del> <ins>extern</ins> const error_category<del>&amp;</del><ins>* const</ins> generic_category<del> = get_generic_category()</del>;
--- 19348,19355 ----
  indicated:
  </p>
  
! <blockquote><pre>
! <del>const error_category&amp; get_generic_category();</del>
  <del>const error_category&amp; get_system_category();</del>
  
  <del>static</del> <ins>extern</ins> const error_category<del>&amp;</del><ins>* const</ins> generic_category<del> = get_generic_category()</del>;
*************** Change 19.5.1.5 [syserr.errcat.objects]
*** 22555,22561 ****
  </p>
  
  <blockquote>
! <pre><ins>extern</ins> const error_category<del>&amp;</del><ins>* const</ins> <del>get_</del>generic_category<del>()</del>;
  </pre>
  <p>
  <del><i>Returns:</i> A reference</del> <ins><tt>generic_category</tt> shall point</ins>
--- 19361,19368 ----
  </p>
  
  <blockquote>
! <pre>
! <ins>extern</ins> const error_category<del>&amp;</del><ins>* const</ins> <del>get_</del>generic_category<del>()</del>;
  </pre>
  <p>
  <del><i>Returns:</i> A reference</del> <ins><tt>generic_category</tt> shall point</ins>
*************** object's <tt>name</tt> virtual function
*** 22570,22576 ****
  <tt>"GENERIC"</tt>.
  </p>
  
! <pre><ins>extern</ins> const error_category<del>&amp;</del><ins>* const</ins> <del>get_</del>system_category<del>()</del>;
  </pre>
  
  <p>
--- 19377,19384 ----
  <tt>"GENERIC"</tt>.
  </p>
  
! <pre>
! <ins>extern</ins> const error_category<del>&amp;</del><ins>* const</ins> <del>get_</del>system_category<del>()</del>;
  </pre>
  
  <p>
*************** Thus implementations are given latitude
*** 22602,22608 ****
  Change 19.5.2.1 [syserr.errcode.overview] Class <tt>error_code</tt> overview as indicated:
  </p>
  
! <blockquote><pre>class error_code {
  public:
    ...;
    <ins>constexpr</ins> error_code(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
--- 19410,19417 ----
  Change 19.5.2.1 [syserr.errcode.overview] Class <tt>error_code</tt> overview as indicated:
  </p>
  
! <blockquote><pre>
! class error_code {
  public:
    ...;
    <ins>constexpr</ins> error_code(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
*************** Change 19.5.2.2 [syserr.errcode.construc
*** 22621,22627 ****
  </p>
  
  <blockquote>
! <pre><ins>constexpr</ins> error_code(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
  </pre>
  <p>
  <i>Effects:</i> Constructs an object of type <tt>error_code</tt>.
--- 19430,19437 ----
  </p>
  
  <blockquote>
! <pre>
! <ins>constexpr</ins> error_code(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
  </pre>
  <p>
  <i>Effects:</i> Constructs an object of type <tt>error_code</tt>.
*************** Change 19.5.2.3 [syserr.errcode.modifier
*** 22639,22645 ****
  </p>
  
  <blockquote>
! <pre>void assign(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
  </pre>
  <p>
  <i>Postconditions:</i> <tt>val_ == val</tt> and <tt>cat_ == cat</tt>.
--- 19449,19456 ----
  </p>
  
  <blockquote>
! <pre>
! void assign(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
  </pre>
  <p>
  <i>Postconditions:</i> <tt>val_ == val</tt> and <tt>cat_ == cat</tt>.
*************** Change 19.5.2.4 [syserr.errcode.observer
*** 22654,22660 ****
  </p>
  
  <blockquote>
! <pre>const error_category<del>&amp;</del><ins>*</ins> category() const;
  </pre>
  
  <p>
--- 19465,19472 ----
  </p>
  
  <blockquote>
! <pre>
! const error_category<del>&amp;</del><ins>*</ins> category() const;
  </pre>
  
  <p>
*************** Change 19.5.3.1 [syserr.errcondition.ove
*** 22670,22676 ****
  </p>
  
  <blockquote>
! <pre>class error_condition {
  public:
    ...;
    <ins>constexpr</ins> error_condition(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
--- 19482,19489 ----
  </p>
  
  <blockquote>
! <pre>
! class error_condition {
  public:
    ...;
    <ins>constexpr</ins> error_condition(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
*************** Change 19.5.3.2 [syserr.errcondition.con
*** 22690,22696 ****
  </p>
  
  <blockquote>
! <pre><ins>constexpr</ins> error_condition(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
  </pre>
  <p>
  <i>Effects:</i> Constructs an object of type <tt>error_condition</tt>.
--- 19503,19510 ----
  </p>
  
  <blockquote>
! <pre>
! <ins>constexpr</ins> error_condition(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
  </pre>
  <p>
  <i>Effects:</i> Constructs an object of type <tt>error_condition</tt>.
*************** Change 19.5.3.3 [syserr.errcondition.mod
*** 22708,22714 ****
  </p>
  
  <blockquote>
! <pre>void assign(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
  </pre>
  <p>
  <i>Postconditions:</i> <tt>val_ == val</tt> and <tt>cat_ == cat</tt>.
--- 19522,19529 ----
  </p>
  
  <blockquote>
! <pre>
! void assign(int val, const error_category<del>&amp;</del><ins>*</ins> cat);
  </pre>
  <p>
  <i>Postconditions:</i> <tt>val_ == val</tt> and <tt>cat_ == cat</tt>.
*************** Change 19.5.3.4 [syserr.errcondition.obs
*** 22723,22729 ****
  </p>
  
  <blockquote>
! <pre>const error_category<del>&amp;</del><ins>*</ins> category() const;
  </pre>
  <p>
  <i>Returns:</i> <tt>cat_</tt>.
--- 19538,19545 ----
  </p>
  
  <blockquote>
! <pre>
! const error_category<del>&amp;</del><ins>*</ins> category() const;
  </pre>
  <p>
  <i>Returns:</i> <tt>cat_</tt>.
*************** paragraphs 2 and 4, change "<tt>category
*** 22748,22754 ****
  Change 19.5.6.1 [syserr.syserr.overview] Class system_error overview as indicated:
  </p>
  
! <blockquote><pre>public:
    system_error(error_code ec, const string&amp; what_arg);
    system_error(error_code ec);
    system_error(int ev, const error_category<del>&amp;</del><ins>*</ins> ecat,
--- 19564,19571 ----
  Change 19.5.6.1 [syserr.syserr.overview] Class system_error overview as indicated:
  </p>
  
! <blockquote><pre>
! public:
    system_error(error_code ec, const string&amp; what_arg);
    system_error(error_code ec);
    system_error(int ev, const error_category<del>&amp;</del><ins>*</ins> ecat,
*************** Change 19.5.6.2 [syserr.syserr.members]
*** 22761,22767 ****
  </p>
  
  <blockquote>
! <pre>system_error(int ev, const error_category<del>&amp;</del><ins>*</ins> ecat, const string&amp; what_arg);
  </pre>
  <blockquote>
  <p>
--- 19578,19585 ----
  </p>
  
  <blockquote>
! <pre>
! system_error(int ev, const error_category<del>&amp;</del><ins>*</ins> ecat, const string&amp; what_arg);
  </pre>
  <blockquote>
  <p>
*************** Change 19.5.6.2 [syserr.syserr.members]
*** 22773,22779 ****
  </p>
  </blockquote>
  
! <pre>system_error(int ev, const error_category<del>&amp;</del><ins>*</ins> ecat);
  </pre>
  <blockquote>
  <p>
--- 19591,19598 ----
  </p>
  </blockquote>
  
! <pre>
! system_error(int ev, const error_category<del>&amp;</del><ins>*</ins> ecat);
  </pre>
  <blockquote>
  <p>
*************** San Francisco:
*** 22794,22802 ****
  ]</i></p>
  
  
! <blockquote>
  NAD because Beman said so.
! </blockquote>
  
  
  
--- 19613,19621 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD because Beman said so.
! </p></blockquote>
  
  
  
*************** NAD because Beman said so.
*** 22804,22813 ****
  
  <hr>
  <h3><a name="833"></a>833. Freestanding implementations header list needs review for C++0x</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-05-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Once the C++0x standard library is feature complete, the LWG needs to
--- 19623,19632 ----
  
  <hr>
  <h3><a name="833"></a>833. Freestanding implementations header list needs review for C++0x</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-05-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Once the C++0x standard library is feature complete, the LWG needs to
*************** stopped adding headers to the library.
*** 22828,22834 ****
  <p>
  Three new headers that need to be added to the list:
  </p>
! <blockquote><pre>&lt;initializer_list&gt; &lt;concept&gt; &lt;iterator_concepts&gt;
  </pre></blockquote>
  <p>
  <tt>&lt;iterator_concepts&gt;</tt>, in particular, has lots of stuff
--- 19647,19654 ----
  <p>
  Three new headers that need to be added to the list:
  </p>
! <blockquote><pre>
! &lt;initializer_list&gt; &lt;concept&gt; &lt;iterator_concepts&gt;
  </pre></blockquote>
  <p>
  <tt>&lt;iterator_concepts&gt;</tt>, in particular, has lots of stuff
*************** Move to NAD.
*** 22889,22910 ****
  <h3><a name="837"></a>837. 
     <code>basic_ios::copyfmt()</code> overly loosely specified
   </h3>
! <p><b>Section:</b> 27.5.4.2 [basic.ios.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
     <p>
  
! The <code>basic_ios::copyfmt()</code> member function is specified in 27.5.4.2 [basic.ios.members] to have the following effects:
  
     </p>
!    <blockquote>
  
  <i>Effects</i>: If <code>(this == &amp;rhs)</code> does
  nothing. Otherwise assigns to the member objects of <code>*this</code>
  the corresponding member objects of <code>rhs</code>, except that
! 
       <ul>
         <li>
  
--- 19709,19730 ----
  <h3><a name="837"></a>837. 
     <code>basic_ios::copyfmt()</code> overly loosely specified
   </h3>
! <p><b>Section:</b> 27.5.5.3 [basic.ios.members] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
     <p>
  
! The <code>basic_ios::copyfmt()</code> member function is specified in 27.5.5.3 [basic.ios.members] to have the following effects:
  
     </p>
!    <blockquote><p>
  
  <i>Effects</i>: If <code>(this == &amp;rhs)</code> does
  nothing. Otherwise assigns to the member objects of <code>*this</code>
  the corresponding member objects of <code>rhs</code>, except that
! </p>
       <ul>
         <li>
  
*************** of <code>basic_ios</code> are this seems
*** 22936,22945 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 19756,19765 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** I propose to tighten things up by adding
*** 22949,22957 ****
  to the function like so:
  
     </p>
!    <blockquote>
       <i>Postconditions:</i>
! 
       <table border="1">
         <thead>
           <tr>
--- 19769,19777 ----
  to the function like so:
  
     </p>
!    <blockquote><p>
       <i>Postconditions:</i>
!    </p>
       <table border="1">
         <thead>
           <tr>
*************** already there.
*** 23021,23325 ****
  
  
  <hr>
- <h3><a name="839"></a>839. Maps and sets missing splice operation</h3>
- <p><b>Section:</b> 23.6 [associative], 23.7 [unord] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Alan Talbot <b>Opened:</b> 2008-05-18 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative">issues</a> in [associative].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Splice is a very useful feature of <tt>list</tt>. This functionality is also very
- useful for any other node based container, and I frequently wish it were
- available for maps and sets. It seems like an omission that these
- containers lack this capability. Although the complexity for a splice is
- the same as for an insert, the actual time can be much less since the
- objects need not be reallocated and copied. When the element objects are
- heavy and the compare operations are fast (say a <tt>map&lt;int, huge_thingy&gt;</tt>)
- this can be a big win.
- </p>
- 
- <p>
- <b>Suggested resolution:</b>
- </p>
- 
- <p>
- Add the following signatures to map, set, multimap, multiset, and the unordered associative containers:
- </p>
- <blockquote><pre> 
- void splice(list&lt;T,Allocator&gt;&amp;&amp; x);
- void splice(list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator i);
- void splice(list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator first, const_iterator last);
- </pre></blockquote>
- 
- <p>
- Hint versions of these are also useful to the extent hint is useful.
- (I'm looking for guidance about whether hints are in fact useful.)
- </p>
-  
- <blockquote><pre> 
- void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x);
- void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator i);
- void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator first, const_iterator last);
- </pre></blockquote>
- 
- <p><i>[
- Sophia Antipolis:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Don't try to <tt>splice "list"</tt> into the other containers, it should be container-type.
- </p>
- <p>
- <tt>forward_list</tt> already has <tt>splice_after</tt>.
- </p>
- <p>
- Would "<tt>splice</tt>" make sense for an <tt>unordered_map</tt>?
- </p>
- <p>
- Jens, Robert: "<tt>splice</tt>" is not the right term, it implies maintaining ordering in <tt>list</tt>s.
- </p>
- <p>
- Howard: <tt>adopt</tt>?
- </p>
- <p>
- Jens: <tt>absorb</tt>?
- </p>
- <p>
- Alan: <tt>subsume</tt>?
- </p>
- <p>
- Robert: <tt>recycle</tt>?
- </p>
- <p>
- Howard: <tt>transfer</tt>? (but no direction)
- </p>
- <p>
- Jens: <tt>transfer_from</tt>. No.
- </p>
- <p>
- Alisdair: Can we give a nothrow guarantee? If your <tt>compare()</tt> and <tt>hash()</tt> doesn't throw, yes.
- </p>
- <p>
- Daniel: For <tt>unordered_map</tt>, we can't guarantee nothrow.
- </p>
- </blockquote>
- 
- <p><i>[
- San Francisco:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Martin: this would possibly outlaw an implementation technique that is
- currently in use; caching nodes in containers.
- </p>
- <p>
- Alan: if you cache in the allocator, rather than the individual
- container, this proposal doesn't interfere with that.
- </p>
- <p>
- Martin: I'm not opposed to this, but I'd like to see an implementation
- that demonstrates that it works.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-07 Frankfurt:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Future.
- </blockquote>
- 
- <p><i>[
- 2009-09-19 Howard adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- I'm not disagreeing with the NAD Future resolution.  But when the future gets
- here, here is a possibility worth exploring:
- </p>
- 
- <blockquote>
- <p>
- Add to the "unique" associative containers:
- </p>
- 
- <blockquote><pre>typedef <i>details</i>      node_ptr;
- 
- node_ptr             remove(const_iterator p);
- pair&lt;iterator, bool&gt; insert(node_ptr&amp;&amp; nd);
- iterator             insert(const_iterator p, node_ptr&amp;&amp; nd);
- </pre></blockquote>
- 
- <p>
- And add to the "multi" associative containers:
- </p>
- 
- <blockquote><pre>typedef <i>details</i> node_ptr;
- 
- node_ptr remove(const_iterator p);
- iterator insert(node_ptr&amp;&amp; nd);
- iterator insert(const_iterator p, node_ptr&amp;&amp; nd);
- </pre></blockquote>
- 
- <p>
- <tt>Container::node_ptr</tt> is a smart pointer much like <tt>unique_ptr</tt>.
- It owns a node obtained from the container it was removed from.  It maintains a
- reference to the allocator in the container so that it can properly deallocate
- the node if asked to, even if the allocator is stateful.  This being said, the
- <tt>node_ptr</tt> can not outlive the container for this reason.
- </p>
- 
- <p>
- The <tt>node_ptr</tt> offers "<tt>const</tt>-free" access to the node's
- <tt>value_type</tt>.
- </p>
- 
- <p>
- With this interface, clients have a great deal of flexibility:
- </p>
- 
- <ul>
- <li>
- A client can remove a node from one container, and insert it into another
- (without any heap allocation).  This is the splice functionality this issue
- asks for.
- </li>
- <li>
- A client can remove a node from a container, change its key or value, and insert
- it back into the same container, or another container, all without the cost of
- allocating a node.
- </li>
- <li>
- If the Compare function is nothrow (which is very common), then this functionality
- is nothrow unless modifying the value throws.  And if this does throw, it does
- so outside of the containers involved.
- </li>
- <li>
- If the Compare function does throw, the <tt>insert</tt> function will have the
- argument <tt>nd</tt> retain ownership of the node.
- </li>
- <li>
- The <tt>node_ptr</tt> should be independent of the <tt>Compare</tt> parameter
- so that a node can be transferred from <tt>set&lt;T, C1, A&gt;</tt>
- to <tt>set&lt;T, C2, A&gt;</tt> (for example).
- </li>
- </ul>
- 
- <p>
- Here is how the customer might use this functionality:
- </p>
- 
- <ul>
- <li>
- <p>
- Splice a node from one container to another:
- </p>
- <blockquote><pre>m2.insert(m1.remove(i));
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Change the "key" in a <tt>std::map</tt> without the cost of node reallocation:
- </p>
- <blockquote><pre>auto p = m.remove(i);
- p-&gt;first = new_key;
- m.insert(std::move(p));
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Change the "value" in a <tt>std::set</tt> without the cost of node reallocation:
- </p>
- <blockquote><pre>auto p = s.remove(i);
- *p = new_value;
- s.insert(std::move(p));
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Move a move-only or heavy object out of an associative container (as opposed to
- the proposal in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1041">1041</a>):
- </p>
- <blockquote><pre>MoveOnly x = std::move(*s.remove(i));
- </pre></blockquote>
- <ol>
- <li>
- <tt>remove(i)</tt> transfers ownership of the node from the set to a temporary
- <tt>node_ptr</tt>.
- </li>
- <li>
- The <tt>node_ptr</tt> is dereferenced, and that non-const reference is sent to
- <tt>move</tt> to cast it to an rvalue.
- </li>
- <li>
- The rvalue <tt>MoveOnly</tt> is move constructed into <tt>x</tt> from
- the <tt>node_ptr</tt>.
- </li>
- <li>
- <tt>~node_ptr()</tt> destructs the moved-from <tt>MoveOnly</tt> and deallocates
- the node.
- </li>
- </ol>
- 
- <p>
- Contrast this with the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1041">1041</a> solution:
- </p>
- <blockquote><pre>MoveOnly x = std::move(s.extract(i).first);
- </pre></blockquote>
- 
- <p>
- The former requires one move construction for <tt>x</tt> while the latter
- requires two (one into the <tt>pair</tt> and then one into <tt>x</tt>).  Either
- of these constructions can throw (say if there is only a copy constructor for
- <tt>x</tt>).  With the former, the point of throw is outside of the container
- <tt>s</tt>, after the element has been removed from the container.  With the latter,
- one throwing construction takes place prior to the removal of the element, and
- the second takes place after the element is removed.
- </p>
- 
- </li>
- </ul>
- 
- <p>
- The "node insertion" API maintains the API associated with inserting <tt>value_type</tt>s
- so the customer can use familiar techniques for getting an iterator to the 
- inserted node, or finding out whether it was inserted or not for the "unique"
- containers.
- </p>
- 
- <p>
- Lightly prototyped.  No implementation problems.  Appears to work great
- for the client.
- </p>
- 
- </blockquote>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="840"></a>840. <tt>pair</tt> default template argument</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2008-05-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I have one issue with <tt>std::pair</tt>. Well, it might just be a very annoying
--- 19841,19851 ----
  
  
  <hr>
  <h3><a name="840"></a>840. <tt>pair</tt> default template argument</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2008-05-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I have one issue with <tt>std::pair</tt>. Well, it might just be a very annoying
*************** help those cases where we use it as a re
*** 23332,23348 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 20.3 [utility] to read:
  </p>
  
! <blockquote><pre>template &lt;class T1, class T2 <ins>= T1</ins>&gt; struct pair;
  </pre></blockquote>
  
  <p>
! Change 20.3.5 [pairs] to read:
  </p>
  
! <blockquote><pre>namespace std {
   template &lt;class T1, class T2 <ins>= T1</ins>&gt;
   struct pair {
     typedef T1 first_type;
--- 19858,19876 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 20.2 [utility] to read:
  </p>
  
! <blockquote><pre>
! template &lt;class T1, class T2 <ins>= T1</ins>&gt; struct pair;
  </pre></blockquote>
  
  <p>
! Change 20.3 [pairs] to read:
  </p>
  
! <blockquote><pre>
! namespace std {
   template &lt;class T1, class T2 <ins>= T1</ins>&gt;
   struct pair {
     typedef T1 first_type;
*************** Change 20.3.5 [pairs] to read:
*** 23351,23369 ****
  </pre></blockquote>
  
  
! <p><b>Rationale:</b></p>
  <tt>std::pair</tt> is a heterogeneous container.
! 
  
  
  
  
  <hr>
  <h3><a name="841"></a>841. cstdint.syn inconsistent with C99</h3>
! <p><b>Section:</b> 18.4.1 [cstdint.syn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#cstdint.syn">issues</a> in [cstdint.syn].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
     <p>
  
--- 19879,19897 ----
  </pre></blockquote>
  
  
! <p><b>Rationale:</b></p><p>
  <tt>std::pair</tt> is a heterogeneous container.
! </p>
  
  
  
  
  <hr>
  <h3><a name="841"></a>841. cstdint.syn inconsistent with C99</h3>
! <p><b>Section:</b> 18.4.1 [cstdint.syn] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#cstdint.syn">issues</a> in [cstdint.syn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
     <p>
  
*************** types with these exact widths.
*** 23384,23396 ****
  
     </p>
     <p>
-    </p>
  
  In addition, paragraph 1 of the same section makes use of a rather
  informal shorthand notation to specify sets of macros. When
  interpreted strictly, the notation specifies macros such
  as <code>INT_8_MIN</code> that are not intended to be specified.
  
     <p>
  
  Finally, the section is missing the usual table of symbols defined
--- 19912,19924 ----
  
     </p>
     <p>
  
  In addition, paragraph 1 of the same section makes use of a rather
  informal shorthand notation to specify sets of macros. When
  interpreted strictly, the notation specifies macros such
  as <code>INT_8_MIN</code> that are not intended to be specified.
  
+    </p>
     <p>
  
  Finally, the section is missing the usual table of symbols defined
*************** synopsis and paragraph 1 with the follow
*** 23424,23430 ****
     </p>
     <blockquote>
       <p>
!        </p><ol>
           <li>
  
  In the names defined in the <code>&lt;cstdint&gt;</code> header, the
--- 19952,19959 ----
     </p>
     <blockquote>
       <p>
!      </p>
!        <ol>
           <li>
  
  In the names defined in the <code>&lt;cstdint&gt;</code> header, the
*************** and macros are required.
*** 23440,23447 ****
  
           </li>
         </ol>
!      <p></p>
!      <pre>namespace std {
  
     // required types
  
--- 19969,19976 ----
  
           </li>
         </ol>
!      <pre>
! namespace std {
  
     // required types
  
*************** and macros are required.
*** 23498,23505 ****
  [Note to editor: Remove all of the existing paragraph 1 from  cstdint.syn.]
  
     </p>
!    <blockquote>
       Table ??: Header <code>&lt;cstdint&gt;</code> synopsis
       <table border="1">
         <thead>
           <tr>
--- 20027,20035 ----
  [Note to editor: Remove all of the existing paragraph 1 from  cstdint.syn.]
  
     </p>
!    <blockquote><p>
       Table ??: Header <code>&lt;cstdint&gt;</code> synopsis
+ 	 </p>
       <table border="1">
         <thead>
           <tr>
*************** and macros are required.
*** 23600,23609 ****
  
  <hr>
  <h3><a name="849"></a>849. missing type traits to compute root class and derived class of types in a class hierachy</h3>
! <p><b>Section:</b> 20.7.7.6 [meta.trans.other] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The type traits library contains various traits to dealt with
--- 20130,20140 ----
  
  <hr>
  <h3><a name="849"></a>849. missing type traits to compute root class and derived class of types in a class hierachy</h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The type traits library contains various traits to dealt with
*************** identity transformation. I expect this g
*** 23635,23655 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following to the synopsis in 20.7.2 [meta.type.synop] under "other transformations":
  </p>
  
! <blockquote><pre>template&lt; class T &gt; struct direct_base_class;
  template&lt; class T &gt; struct direct_derived_class;
  template&lt; class T &gt; struct root_base_class;
  </pre></blockquote>
  
  <p>
! Add three new entries to table 51 (20.7.7.6 [meta.trans.other]) with the following content
  </p>
  
  <blockquote>
  <table border="1">
! <tbody><tr>
  <th>Template</th><th>Condition</th><th>Comments</th>
  </tr>
  <tr>
--- 20166,20187 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following to the synopsis in 20.10.2 [meta.type.synop] under "other transformations":
  </p>
  
! <blockquote><pre>
! template&lt; class T &gt; struct direct_base_class;
  template&lt; class T &gt; struct direct_derived_class;
  template&lt; class T &gt; struct root_base_class;
  </pre></blockquote>
  
  <p>
! Add three new entries to table 51 (20.10.7.6 [meta.trans.other]) with the following content
  </p>
  
  <blockquote>
  <table border="1">
! <tr>
  <th>Template</th><th>Condition</th><th>Comments</th>
  </tr>
  <tr>
*************** as an accessible unambiguous direct base
*** 23671,24026 ****
  <td>The member typedef <tt>type</tt> shall equal the accessible unambiguous most indirect base class of
  <tt>T</tt>. If no such type exists, the member typedef type shall equal <tt>T</tt>.</td>
  </tr>
! </tbody></table>
  </blockquote>
  
  
  
! <p><b>Rationale:</b></p>
  2008-9-16 San Francisco:  Issue pulled by author prior to being reviewed by the LWG.
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="851"></a>851. simplified array construction</h3>
- <p><b>Section:</b> 23.3.1 [array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Benjamin Kosnik <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#array">issues</a> in [array].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- This is an issue that came up on the libstdc++ list, where a
- discrepancy between "C" arrays and C++0x's <tt>std::array</tt> was pointed
- out.
- </p>
- 
- <p>
- In "C," this array usage is possible:
- </p>
- 
- <blockquote><pre>int ar[] = {1, 4, 6};
- </pre></blockquote>
- 
- <p>
- But for C++, 
- </p>
- 
- <blockquote><pre>std::array&lt;int&gt; a = { 1, 4, 6 }; // error
- </pre></blockquote>
- 
- <p>
- Instead, the second parameter of the <tt>array</tt> template must be
- explicit, like so:
- </p>
- 
- <blockquote><pre>std::array&lt;int, 3&gt; a = { 1, 4, 6 };
- </pre></blockquote>
- 
- <p>
- Doug Gregor proposes the following solution, that assumes
- generalized initializer lists.
- </p>
- 
- <blockquote><pre>template&lt;typename T, typename... Args&gt;
- inline array&lt;T, sizeof...(Args)&gt; 
- make_array(Args&amp;&amp;... args) 
- { return { std::forward&lt;Args&gt;(args)... };  }
- </pre></blockquote>
- 
- <p>
- Then, the way to build an <tt>array</tt> from a list of unknown size is:
- </p>
- 
- <blockquote><pre>auto a = make_array&lt;T&gt;(1, 4, 6);
- </pre></blockquote>
- 
- <p><i>[
- San Francisco:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Benjamin: Move to Ready?
- </p>
- <p>
- Bjarne: I'm not convinced this is useful enough to add, so I'd like us
- to have time to reflect on it.
- </p>
- <p>
- Alisdair: the constraints are wrong, they should be
- </p>
- <blockquote><pre>template&lt;ValueType T, ValueType... Args&gt;
- requires Convertible&lt;Args, T&gt;...
- array&lt;T, sizeof...(Args)&gt; make_array(Args&amp;&amp;... args);
- </pre></blockquote>
- <p>
- Alidair: this would be useful if we had a constexpr version.
- </p>
- <p>
- Bjarne: this is probably useful for arrays with a small number of
- elements, but it's not clearly useful otherwise.
- </p>
- <p>
- Consensus is to move to Open.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-06-07 Daniel adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- I suggest a fix and a simplification of the current proposal: Recent
- prototyping by
- Howard showed, that a fix is required because narrowing conversion
- 8.5.4 [dcl.init.list]/6 b.3
- would severely limit the possible distribution of argument types, e.g.
- the expression
- <tt>make_array&lt;double&gt;(1, 2.0)</tt> is ill-formed, because the narrowing
- happens <em>inside</em> the
- function body where no constant expressions exist anymore. Furthermore
- given e.g.
- </p>
- <blockquote><pre>int f();
- double g();
- </pre></blockquote>
- <p>
- we probably want to support
- </p>
- <blockquote><pre>make_array&lt;double&gt;(f(), g());
- </pre></blockquote>
- 
- <p>
- as well. To make this feasible, the currently suggested expansion
- </p>
- 
- <blockquote><pre>{ std::forward&lt;Args&gt;(args)... }
- </pre></blockquote>
- 
- <p>
- needs to be replaced by
- </p>
- 
- <blockquote><pre>{ static_cast&lt;T&gt;(std::forward&lt;Args&gt;(args))... }
- </pre></blockquote>
- 
- <p>
- which is safe, because we already ensure convertibility via the
- element-wise <tt>Convertible&lt;Args, T&gt;</tt> requirement. Some other fixes are
- necessary: The <tt>ValueType</tt> requirement for the function <em>parameters</em>
- is invalid, because all lvalue arguments will deduce to an lvalue-reference,
- thereby no longer satisfying this requirement.
- </p>
- 
- <p>
- The suggested simplification is to provide a default-computed effective
- type for the result array based on common_type and decay, in
- unconstrained form:
- </p>
- 
- <blockquote><pre>template&lt;typename... Args&gt;
- array&lt;typename decay&lt;typename common_type&lt;Args...&gt;::type&gt;::type,
- sizeof...(Args)&gt;
- make_array(Args&amp;&amp;... args);
- </pre></blockquote>
- 
- <p>
- The approach used below is similar to that of <tt>make_pair</tt> and <tt>make_tuple</tt>
- using a symbol <tt>C</tt> to represent the decayed common type [Note: Special
- handling of <tt>reference_wrapper</tt> types is intentionally <em>not</em> provided, because
- our target has so satisfy <tt>ValueType</tt>, thus under the revised proposal only
- an all-<tt>reference_wrapper</tt>-arguments would be well-formed and an array of
- <tt>reference_wrapper</tt> will be constructed]. I do currently not suggest to
- add new concepts reflecting <tt>decay</tt> and <tt>common_type</tt>, but an implementor will
- need something like this to succeed. Note that we use a similar fuzziness for
- <tt>make_pair</tt> and <tt>make_tuple</tt> currently. This fuzziness is not related to
- the currently
- missing <tt>Constructible&lt;Vi, Ti&amp;&amp;&gt;</tt> requirement for those functions. The following
- proposal fixes that miss for <tt>make_array</tt>. If the corresponding <tt>C</tt> type
- deduction is
- explicitly wanted for standardization, here the implementation
- </p>
- 
- <blockquote><pre>auto concept DC&lt;typename... T&gt; {
-   typename type = typename decay&lt;typename common_type&lt;T...&gt;::type&gt;::type;
- }
- </pre></blockquote>
- 
- <p>
- where <tt>C</tt> is identical to <tt>DC&lt;Args...&gt;::type</tt> in the proposed resolution below.
- </p>
- <p>
- I intentionally added no further type relation between type and the concept
- template parameters, but instead added this requirement below to make
- the specification as transparent as possible. As written this concept is
- satisfied, if the corresponding associated type exists.
- </p>
- 
- <p><b>Suggested Resolution:</b></p>
- 
- <ol>
- <li>
- <p>
- Add to the array synopsis in 23.3 [sequences]:
- </p>
- <blockquote><pre><ins>
- template&lt;ReferentType... Args&gt;
- requires ValueType&lt;C&gt; &amp;&amp; IdentityOf&lt;Args&gt; &amp;&amp; Constructible&lt;C, Args&amp;&amp;&gt;...
- array&lt;C, sizeof...(Args)&gt;
- make_array(Args&amp;&amp;... args);
- </ins>
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Append after 23.3.1.8 [array.tuple] Tuple interface to class template array
- the following new section:
- </p>
- <blockquote>
- <p>
- 23.4.1.7 Array creation functions [array.creation]
- </p>
- 
- <pre><ins>
- template&lt;ReferentType... Args&gt;
- requires ValueType&lt;C&gt; &amp;&amp; IdentityOf&lt;Args&gt; &amp;&amp; Constructible&lt;C, Args&amp;&amp;&gt;...
- array&lt;C, sizeof...(Args)&gt;
- make_array(Args&amp;&amp;... args);</ins>
- </pre>
- 
- <blockquote>
- <p><ins>
- Let <tt>C</tt> be <tt>decay&lt;common_type&lt;Args...&gt;::type&gt;::type</tt>.
- </ins></p>
- <p>
- <ins><i>Returns:</i> an <tt>array&lt;C, sizeof...(Args)&gt;</tt> initialized with
- <tt>{ static_cast&lt;C&gt;(std::forward&lt;Args&gt;(args))... }</tt>.
- </ins></p>
- </blockquote>
- </blockquote>
- 
- </li>
- 
- </ol>
- 
- </blockquote>
- 
- <p><i>[
- 2009-07 Frankfurt:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- The proposed resolution uses concepts.
- </p>
- <p>
- Daniel to rewrite the proposed resolution.
- </p>
- <p>
- Leave Open.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-07-25 Daniel provides rewritten proposed resolution.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Argument for NAD future: everything about this could be added on. This
- does not require changes to the existing text.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- <ol>
- <li>
- <p>
- Add to the array synopsis in 23.3 [sequences]:
- </p>
- 
- <blockquote><pre><ins>template&lt;class... Args&gt;
-   array&lt;<i>CT</i>, sizeof...(Args)&gt;
-   make_array(Args&amp;&amp;... args);</ins>
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Append after 23.3.1.8 [array.tuple] "Tuple interface to class template array" the
- following new section:
- </p>
- 
- <blockquote>
- <p>
- <ins>XX.X.X.X Array creation functions [array.creation]</ins>
- </p>
- 
- <pre><ins>
- template&lt;class... Args&gt;
- array&lt;<i>CT</i>, sizeof...(Args)&gt;
- make_array(Args&amp;&amp;... args)
- </ins></pre>
- 
- <blockquote>
- <p>
- <ins>Let <i>CT</i> be <tt>decay&lt;common_type&lt;Args...&gt;::type&gt;::type</tt>.</ins>
- </p>
- <p>
- <ins><i>Returns:</i> An <tt>array&lt;<i>CT</i>, sizeof...(Args)&gt;</tt> initialized with <tt>{
- static_cast&lt;<i>CT</i>&gt;(std::forward&lt;Args&gt;(args))... }</tt>.</ins>
- </p>
- 
- <p><ins>
- [<i>Example:</i>
- </ins></p>
- <blockquote><pre><ins>
- int i = 0; int&amp; ri = i;
- make_array(42u, i, 2.78, ri);
- </ins></pre></blockquote>
- <p><ins>
- returns an array of type
- </ins></p>
- <blockquote><pre><ins>
- array&lt;double, 4&gt;
- </ins></pre></blockquote>
- 
- <p><ins>
- —<i>end example</i>]</ins>
  </p>
- </blockquote>
- </blockquote>
- </li>
- 
- </ol>
- 
- 
- 
- 
  
  
  
  
  <hr>
  <h3><a name="855"></a>855. capacity() and reserve() for deque?</h3>
! <p><b>Section:</b> 23.3.2.2 [deque.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Hervé Brönnimann <b>Opened:</b> 2008-06-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#deque.capacity">issues</a> in [deque.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The main point is that <tt>capacity</tt> can be viewed as a mechanism to  
--- 20203,20226 ----
  <td>The member typedef <tt>type</tt> shall equal the accessible unambiguous most indirect base class of
  <tt>T</tt>. If no such type exists, the member typedef type shall equal <tt>T</tt>.</td>
  </tr>
! </table>
  </blockquote>
  
  
  
! <p><b>Rationale:</b></p><p>
  2008-9-16 San Francisco:  Issue pulled by author prior to being reviewed by the LWG.
  </p>
  
  
  
  
  <hr>
  <h3><a name="855"></a>855. capacity() and reserve() for deque?</h3>
! <p><b>Section:</b> 23.3.3.3 [deque.capacity] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Herv&eacute; Br&ouml;nnimann <b>Opened:</b> 2008-06-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#deque.capacity">issues</a> in [deque.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The main point is that <tt>capacity</tt> can be viewed as a mechanism to  
*************** this definition, even though the guarant
*** 24047,24053 ****
  <p>
  A simple picture of a deque:
  </p>
! <blockquote><pre>A-----|----|-----|---F+|++++|++B--|-----|-----Z
  </pre></blockquote>
  <p>
  (A,Z mark the beginning/end, | the block boundaries, F=front, B=back,  
--- 20247,20254 ----
  <p>
  A simple picture of a deque:
  </p>
! <blockquote><pre>
! A-----|----|-----|---F+|++++|++B--|-----|-----Z
  </pre></blockquote>
  <p>
  (A,Z mark the beginning/end, | the block boundaries, F=front, B=back,  
*************** implementation details.
*** 24095,24113 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Add new signatures to synopsis in 23.3.2 [deque]:
  </p>
  
! <blockquote><pre>size_type capacity() const;
  bool reserve(size_type n);
  </pre></blockquote>
  
  <p>
! Add new signatures to 23.3.2.2 [deque.capacity]:
  </p>
  
  <blockquote>
! <pre>size_type capacity() const;
  </pre>
  <blockquote>
  <p>
--- 20296,20316 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Add new signatures to synopsis in 23.3.3 [deque]:
  </p>
  
! <blockquote><pre>
! size_type capacity() const;
  bool reserve(size_type n);
  </pre></blockquote>
  
  <p>
! Add new signatures to 23.3.3.3 [deque.capacity]:
  </p>
  
  <blockquote>
! <pre>
! size_type capacity() const;
  </pre>
  <blockquote>
  <p>
*************** except to the erased elements.
*** 24127,24133 ****
  </blockquote>
  
  <blockquote>
! <pre>bool reserve(size_type n);
  </pre>
  <blockquote>
  <p>
--- 20330,20337 ----
  </blockquote>
  
  <blockquote>
! <pre>
! bool reserve(size_type n);
  </pre>
  <blockquote>
  <p>
*************** during such a sequence other than by the
*** 24167,24185 ****
  </blockquote>
  
  <p>
! And 23.3.2.3 [deque.modifiers] para 1, can be enhanced:
  </p>
  
! <blockquote>
  1 <i>Effects:</i> An insertion in the middle of the deque invalidates all the iterators and references to elements of the
  deque. An insertion at either end of the deque invalidates all the iterators to the deque,
  <ins>unless provisions have been made with reserve,</ins>
  but has no effect on the validity of references to elements of the deque.
! </blockquote>
  
  
  <p><b>Rationale:</b></p>
! Complication outweighs the benefit.
  
  
  
--- 20371,20389 ----
  </blockquote>
  
  <p>
! And 23.3.3.4 [deque.modifiers] para 1, can be enhanced:
  </p>
  
! <blockquote><p>
  1 <i>Effects:</i> An insertion in the middle of the deque invalidates all the iterators and references to elements of the
  deque. An insertion at either end of the deque invalidates all the iterators to the deque,
  <ins>unless provisions have been made with reserve,</ins>
  but has no effect on the validity of references to elements of the deque.
! </p></blockquote>
  
  
  <p><b>Rationale:</b></p>
! <p>Complication outweighs the benefit.</p>
  
  
  
*************** Complication outweighs the benefit.
*** 24187,24196 ****
  
  <hr>
  <h3><a name="862"></a>862. Impossible complexity for 'includes'</h3>
! <p><b>Section:</b> 25.4.5.1 [includes] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-07-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#includes">issues</a> in [includes].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 25.4.5.1 [includes] the complexity is "at most -1 comparisons" if passed
--- 20391,20400 ----
  
  <hr>
  <h3><a name="862"></a>862. Impossible complexity for 'includes'</h3>
! <p><b>Section:</b> 25.4.5.1 [includes] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-07-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#includes">issues</a> in [includes].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 25.4.5.1 [includes] the complexity is "at most -1 comparisons" if passed
*************** This same issue also applies to:
*** 24215,24228 ****
  ]</i></p>
  
  
! <blockquote>
  Suggest NAD. The complexity of empty ranges is -1 in other places in the
  standard. See 25.4.4 [alg.merge] <tt>merge</tt> and
  <tt>inplace_merge</tt>, and <tt>forward_list</tt> merge, for example.
  The time and effort to find and fix all places in the standard where
  empty range[s] result in negative complexity isn't worth the very
  limited benefit.
! </blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
--- 20419,20432 ----
  ]</i></p>
  
  
! <blockquote><p>
  Suggest NAD. The complexity of empty ranges is -1 in other places in the
  standard. See 25.4.4 [alg.merge] <tt>merge</tt> and
  <tt>inplace_merge</tt>, and <tt>forward_list</tt> merge, for example.
  The time and effort to find and fix all places in the standard where
  empty range[s] result in negative complexity isn't worth the very
  limited benefit.
! </p></blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
*************** further cases.
*** 24245,24254 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Pete to provide "straightforward" wording.
  Move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 20449,20458 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Pete to provide "straightforward" wording.
  Move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Recommend NAD.
*** 24262,24271 ****
  
  <hr>
  <h3><a name="863"></a>863. What is the state of a stream after close() succeeds</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2008-07-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Suppose writing to an <tt>[o]fstream</tt> fails and you later close the <tt>stream</tt>.
--- 20466,20475 ----
  
  <hr>
  <h3><a name="863"></a>863. What is the state of a stream after close() succeeds</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2008-07-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Suppose writing to an <tt>[o]fstream</tt> fails and you later close the <tt>stream</tt>.
*************** Move to NAD.
*** 24314,24331 ****
  
  <hr>
  <h3><a name="864"></a>864. Defect in atomic wording</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2008-07-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There's an error in 29.6 [atomics.types.operations]/p9:
  </p>
  
  <blockquote>
! <pre>C atomic_load(const volatile A * object);
  C atomic_load_explicit(const volatile A * object, memory_order);
  C A ::load(memory_order order = memory_order_seq_cst) const volatile;
  </pre>
--- 20518,20535 ----
  
  <hr>
  <h3><a name="864"></a>864. Defect in atomic wording</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2008-07-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There's an error in 29.6 [atomics.types.operations]/p9:
  </p>
  
  <blockquote>
! <pre>
! C atomic_load(const volatile A * object);
  C atomic_load_explicit(const volatile A * object, memory_order);
  C A ::load(memory_order order = memory_order_seq_cst) const volatile;
  </pre>
*************** C A ::load(memory_order order = memory_o
*** 24340,24366 ****
  <p>
  I believe that this should state
  </p>
! <blockquote>
  shall not be <tt>memory_order_release</tt>.
! </blockquote>
  
  <p>
  There's also an error in 29.6 [atomics.types.operations]/p17:
  </p>
  
! <blockquote>
  ... When only one <tt>memory_order</tt> argument is supplied, the value of success
  is <tt>order</tt>, and
  the value of failure is <tt>order</tt> except that a value of
  <tt>memory_order_acq_rel</tt> shall be replaced by the value
  <tt>memory_order_require</tt> ...
! </blockquote>
  <p>
  I believe this should state
  </p>
! <blockquote>
  shall be replaced by the value <tt>memory_order_acquire</tt> ...
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 20544,20570 ----
  <p>
  I believe that this should state
  </p>
! <blockquote><p>
  shall not be <tt>memory_order_release</tt>.
! </p></blockquote>
  
  <p>
  There's also an error in 29.6 [atomics.types.operations]/p17:
  </p>
  
! <blockquote><p>
  ... When only one <tt>memory_order</tt> argument is supplied, the value of success
  is <tt>order</tt>, and
  the value of failure is <tt>order</tt> except that a value of
  <tt>memory_order_acq_rel</tt> shall be replaced by the value
  <tt>memory_order_require</tt> ...
! </p></blockquote>
  <p>
  I believe this should state
  </p>
! <blockquote><p>
  shall be replaced by the value <tt>memory_order_acquire</tt> ...
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Change 29.6 [atomics.types.operations]/p
*** 24369,24375 ****
  </p>
  
  <blockquote>
! <pre>C atomic_load(const volatile A * object);
  C atomic_load_explicit(const volatile A * object, memory_order);
  C A ::load(memory_order order = memory_order_seq_cst) const volatile;
  </pre>
--- 20573,20580 ----
  </p>
  
  <blockquote>
! <pre>
! C atomic_load(const volatile A * object);
  C atomic_load_explicit(const volatile A * object, memory_order);
  C A ::load(memory_order order = memory_order_seq_cst) const volatile;
  </pre>
*************** C A ::load(memory_order order = memory_o
*** 24385,24402 ****
  Change 29.6 [atomics.types.operations]/p17:
  </p>
  
! <blockquote>
  ... When only one <tt>memory_order</tt> argument is supplied, the value of success
  is <tt>order</tt>, and
  the value of failure is <tt>order</tt> except that a value of
  <tt>memory_order_acq_rel</tt> shall be replaced by the value
  <del><tt>memory_order_require</tt></del> <ins><tt>memory_order_acquire</tt></ins> ...
! </blockquote>
  
  
  
  <p><b>Rationale:</b></p>
! Already fixed by the time the LWG processed it.
  
  
  
--- 20590,20607 ----
  Change 29.6 [atomics.types.operations]/p17:
  </p>
  
! <blockquote><p>
  ... When only one <tt>memory_order</tt> argument is supplied, the value of success
  is <tt>order</tt>, and
  the value of failure is <tt>order</tt> except that a value of
  <tt>memory_order_acq_rel</tt> shall be replaced by the value
  <del><tt>memory_order_require</tt></del> <ins><tt>memory_order_acquire</tt></ins> ...
! </p></blockquote>
  
  
  
  <p><b>Rationale:</b></p>
! <p>Already fixed by the time the LWG processed it.</p>
  
  
  
*************** Already fixed by the time the LWG proces
*** 24404,24424 ****
  
  <hr>
  <h3><a name="867"></a>867. Valarray and value-initialization</h3>
! <p><b>Section:</b> 26.6.2.1 [valarray.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! From 26.6.2.1 [valarray.cons], paragraph 2:
  </p>
  
! <blockquote><pre>explicit  valarray(size_t);
  </pre>
! <blockquote>
  The array created by this constructor has a length equal to the value of the argument. The elements
  of the array are constructed using the default constructor for the instantiating type <tt>T</tt>.
! </blockquote>
  </blockquote>
  
  <p>
--- 20609,20630 ----
  
  <hr>
  <h3><a name="867"></a>867. Valarray and value-initialization</h3>
! <p><b>Section:</b> 26.6.2.2 [valarray.cons] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! From 26.6.2.2 [valarray.cons], paragraph 2:
  </p>
  
! <blockquote><pre>
! explicit  valarray(size_t);
  </pre>
! <blockquote><p>
  The array created by this constructor has a length equal to the value of the argument. The elements
  of the array are constructed using the default constructor for the instantiating type <tt>T</tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** and <tt>double</tt>, they don't have a d
*** 24427,24441 ****
  the elements, so I suggest replacing:
  </p>
  
! <blockquote>
  The elements of the array are constructed using the default constructor for the instantiating type <tt>T</tt>.
! </blockquote>
  <p>
  with
  </p>
! <blockquote>
  The elements of the array are value-initialized.
! </blockquote>
  
  <p>
  There is another reference to the default constructor of <tt>T</tt> in the non-normative note in paragraph 9.
--- 20633,20647 ----
  the elements, so I suggest replacing:
  </p>
  
! <blockquote><p>
  The elements of the array are constructed using the default constructor for the instantiating type <tt>T</tt>.
! </p></blockquote>
  <p>
  with
  </p>
! <blockquote><p>
  The elements of the array are value-initialized.
! </p></blockquote>
  
  <p>
  There is another reference to the default constructor of <tt>T</tt> in the non-normative note in paragraph 9.
*************** and so it doesn't need changes).
*** 24447,24483 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.6.2.1 [valarray.cons], paragraph 2:
  </p>
  
  <blockquote>
! <pre>explicit  valarray(size_t);
  </pre>
! <blockquote>
  The array created by this constructor has a length equal to the value of the argument. The elements
  of the array are <del>constructed using the default constructor for the instantiating type <tt>T</tt></del>
  <ins>value-initialized (8.5 [dcl.init])</ins>.
! </blockquote>
  </blockquote>
  
  <p>
! Change 26.6.2.7 [valarray.members], paragraph 9:
  </p>
  
! <blockquote>
  [<i>Example:</i> If the argument has the value -2, the first two elements of the result will be <del>constructed using the 
  default constructor</del>
  <ins>value-initialized (8.5 [dcl.init])</ins>;
  the third element of the result will be assigned the value of the first element of the argument; etc. <i>-- end example</i>]
! </blockquote>
  
  
  
--- 20653,20690 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.6.2.2 [valarray.cons], paragraph 2:
  </p>
  
  <blockquote>
! <pre>
! explicit  valarray(size_t);
  </pre>
! <blockquote><p>
  The array created by this constructor has a length equal to the value of the argument. The elements
  of the array are <del>constructed using the default constructor for the instantiating type <tt>T</tt></del>
  <ins>value-initialized (8.5 [dcl.init])</ins>.
! </p></blockquote>
  </blockquote>
  
  <p>
! Change 26.6.2.8 [valarray.members], paragraph 9:
  </p>
  
! <blockquote><p>
  [<i>Example:</i> If the argument has the value -2, the first two elements of the result will be <del>constructed using the 
  default constructor</del>
  <ins>value-initialized (8.5 [dcl.init])</ins>;
  the third element of the result will be assigned the value of the first element of the argument; etc. <i>-- end example</i>]
! </p></blockquote>
  
  
  
*************** the third element of the result will be
*** 24486,24494 ****
  
  <hr>
  <h3><a name="873"></a>873. signed integral type and unsigned integral type are not clearly defined</h3>
! <p><b>Section:</b> 3.9.1 [basic.fundamental] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Travis Vitek <b>Opened:</b> 2008-06-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
        Neither the term "signed integral type" nor the term "unsigned
--- 20693,20701 ----
  
  <hr>
  <h3><a name="873"></a>873. signed integral type and unsigned integral type are not clearly defined</h3>
! <p><b>Section:</b> 3.9.1 [basic.fundamental] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Travis Vitek <b>Opened:</b> 2008-06-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
        Neither the term "signed integral type" nor the term "unsigned
*************** San Francisco:
*** 24525,24540 ****
  ]</i></p>
  
  
! <blockquote>
  Plum, Sebor to review.
! </blockquote>
  
  <p><i>[
  Post Summit Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  The proposed resolution needs to be "conceptualized". Currently we have
  in  [concept.support] only concept <tt>IntegralType</tt>
  for all "integral types", thus indeed the current <tt>Container</tt>
--- 20732,20747 ----
  ]</i></p>
  
  
! <blockquote><p>
  Plum, Sebor to review.
! </p></blockquote>
  
  <p><i>[
  Post Summit Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  The proposed resolution needs to be "conceptualized". Currently we have
  in  [concept.support] only concept <tt>IntegralType</tt>
  for all "integral types", thus indeed the current <tt>Container</tt>
*************** concept and Iterator concepts are suffic
*** 24542,24548 ****
  types". If the changes are applied, we might ask core for concept
  <tt>BilateralIntegerType</tt> and add proper restrictions to the library
  concepts.
! </blockquote>
  
    
  
--- 20749,20755 ----
  types". If the changes are applied, we might ask core for concept
  <tt>BilateralIntegerType</tt> and add proper restrictions to the library
  concepts.
! </p></blockquote>
  
    
  
*************** concepts.
*** 24561,24567 ****
      </p>
      <blockquote>
        <p>
!         </p><ol>
            <li>
              When two pointers to elements of the same array object are
              subtracted, the result is the difference of the subscripts of
--- 20768,20775 ----
      </p>
      <blockquote>
        <p>
!       </p>
!         <ol>
            <li>
              When two pointers to elements of the same array object are
              subtracted, the result is the difference of the subscripts of
*************** concepts.
*** 24572,24578 ****
              <code>&lt;cstdint&gt;</code> header (18.1)...
            </li>
          </ol>
-       <p></p>
      </blockquote>
  
      <p>
--- 20780,20785 ----
*************** concepts.
*** 24580,24589 ****
        <tt>X::difference_type</tt> cannot be <tt>char</tt> or
        <tt>wchar_t</tt>, but could be one of the signed or unsigned integer
        types as appropriate.
!       20.2.5 [allocator.requirements] table 40...
      </p>
!     <blockquote>
        Table 40: Allocator requirements
        <table border="1">
          <thead>
            <tr>
--- 20787,20797 ----
        <tt>X::difference_type</tt> cannot be <tt>char</tt> or
        <tt>wchar_t</tt>, but could be one of the signed or unsigned integer
        types as appropriate.
!       17.6.3.5 [allocator.requirements] table 40...
      </p>
!     <blockquote><p>
        Table 40: Allocator requirements
+ 	  </p>
        <table border="1">
          <thead>
            <tr>
*************** concepts.
*** 24619,24628 ****
        The proposed change makes it clear that <tt>make_signed&lt;T&gt;::type</tt>
        must be one of the signed integer types as defined in 3.9.1. Ditto for
        <tt>make_unsigned&lt;T&gt;type</tt> and unsigned integer types.
!       20.7.7.3 [meta.trans.sign] table 48...
      </p>
!     <blockquote>
        Table 48: Sign modifications
        <table border="1">
          <thead>
            <tr>
--- 20827,20837 ----
        The proposed change makes it clear that <tt>make_signed&lt;T&gt;::type</tt>
        must be one of the signed integer types as defined in 3.9.1. Ditto for
        <tt>make_unsigned&lt;T&gt;type</tt> and unsigned integer types.
!       20.10.7.3 [meta.trans.sign] table 48...
      </p>
!     <blockquote><p>
        Table 48: Sign modifications
+ 	  </p>
        <table border="1">
          <thead>
            <tr>
*************** concepts.
*** 24693,24700 ****
  
        22.4.2.1.2 [facet.num.get.virtuals] table 78...
      </p>
!     <blockquote>
        Table 78: Integer Conversions
        <table border="1">
          <thead>
            <tr>
--- 20902,20910 ----
  
        22.4.2.1.2 [facet.num.get.virtuals] table 78...
      </p>
!     <blockquote><p>
        Table 78: Integer Conversions
+ 	  </p>
        <table border="1">
          <thead>
            <tr>
*************** concepts.
*** 24735,24742 ****
        Rationale is same as above.
        22.4.2.2.2 [facet.num.put.virtuals] table 80...
      </p>
!     <blockquote>
        Table 80: Integer Conversions
        <table border="1">
          <thead>
            <tr>
--- 20945,20953 ----
        Rationale is same as above.
        22.4.2.2.2 [facet.num.put.virtuals] table 80...
      </p>
!     <blockquote><p>
        Table 80: Integer Conversions
+ 	  </p>
        <table border="1">
          <thead>
            <tr>
*************** concepts.
*** 24780,24787 ****
      <p>
        23.2 [container.requirements] table 80...
      </p>
!     <blockquote>
        Table 89: Container requirements
        <table border="1">
          <thead>
            <tr>
--- 20991,20999 ----
      <p>
        23.2 [container.requirements] table 80...
      </p>
!     <blockquote><p>
        Table 89: Container requirements
+ 	  </p>
        <table border="1">
          <thead>
            <tr>
*************** concepts.
*** 24816,24822 ****
      <p>
        X [iterator.concepts] paragraph 1...
      </p>
!     <blockquote>
        Iterators are a generalization of pointers that allow a C++ program to
        work with different data structures (containers) in a uniform manner.
        To be able to construct template algorithms that work correctly and
--- 21028,21034 ----
      <p>
        X [iterator.concepts] paragraph 1...
      </p>
!     <blockquote><p>
        Iterators are a generalization of pointers that allow a C++ program to
        work with different data structures (containers) in a uniform manner.
        To be able to construct template algorithms that work correctly and
*************** concepts.
*** 24830,24841 ****
        value of some type that is in the set of types that are
        <i>writable</i> to the particular iterator type of <code>i</code>. All
        iterators <code>i</code> for which the expression <code>(*i).m</code>
!       is well-defined, support the expression <code>i-&gt;m</code> with the
        same semantics as <code>(*i).m</code>. For every iterator type
        <code>X</code> for which equality is defined, there is a corresponding
        <del>signed integral type</del> <ins>signed integer type</ins> called
        the <i>difference type</i> of the iterator.
!     </blockquote>
      
      <p>
        I'm a little unsure of this change. Previously this paragraph would
--- 21042,21053 ----
        value of some type that is in the set of types that are
        <i>writable</i> to the particular iterator type of <code>i</code>. All
        iterators <code>i</code> for which the expression <code>(*i).m</code>
!       is well-defined, support the expression <code>i->m</code> with the
        same semantics as <code>(*i).m</code>. For every iterator type
        <code>X</code> for which equality is defined, there is a corresponding
        <del>signed integral type</del> <ins>signed integer type</ins> called
        the <i>difference type</i> of the iterator.
!     </p></blockquote>
      
      <p>
        I'm a little unsure of this change. Previously this paragraph would
*************** concepts.
*** 24844,24850 ****
        new wording prohibits this.
        26.5.3.1 [rand.eng.lcong] paragraph 2...
      </p>
!     <blockquote>
        The template parameter <code>UIntType</code> shall denote an
        <del>unsigned integral type</del><ins>unsigned integer type</ins>
        large enough to store values as large as <code>m - 1</code>. If the
--- 21056,21062 ----
        new wording prohibits this.
        26.5.3.1 [rand.eng.lcong] paragraph 2...
      </p>
!     <blockquote><p>
        The template parameter <code>UIntType</code> shall denote an
        <del>unsigned integral type</del><ins>unsigned integer type</ins>
        large enough to store values as large as <code>m - 1</code>. If the
*************** concepts.
*** 24855,24885 ****
        <code>result_type</code>. --end note] Otherwise, the following
        relations shall hold: <code>a &lt; m</code> and <code>c &lt;
        m</code>.
!     </blockquote>
      
      <p>
        Same rationale as the previous change.
        X [rand.adapt.xor] paragraph 6...
      </p>
!     <blockquote>
        Both <code>Engine1::result_type</code> and
        <code>Engine2::result_type</code> shall denote (possibly different)
        <del>unsigned integral types</del><ins>unsigned integer types</ins>.
        The member <i>result_type</i> shall denote either the type
        <i>Engine1::result_type</i> or the type <i>Engine2::result_type</i>,
        whichever provides the most storage according to clause 3.9.1.
!     </blockquote>
      
      <p>
        26.5.7.1 [rand.util.seedseq] paragraph 7...
      </p>
!     <blockquote>
        <i>Requires:</i><code>RandomAccessIterator</code> shall meet the
        requirements of a random access iterator (24.1.5) such that
        <code>iterator_traits&lt;RandomAccessIterator&gt;::value_type</code>
        shall denote an <del>unsigned integral type</del><ins>unsigned integer
        type</ins> capable of accomodating 32-bit quantities.  
!     </blockquote>
  
      <p>
        By making this change, integral types that happen to have a signed
--- 21067,21097 ----
        <code>result_type</code>. --end note] Otherwise, the following
        relations shall hold: <code>a &lt; m</code> and <code>c &lt;
        m</code>.
!     </p></blockquote>
      
      <p>
        Same rationale as the previous change.
        X [rand.adapt.xor] paragraph 6...
      </p>
!     <blockquote><p>
        Both <code>Engine1::result_type</code> and
        <code>Engine2::result_type</code> shall denote (possibly different)
        <del>unsigned integral types</del><ins>unsigned integer types</ins>.
        The member <i>result_type</i> shall denote either the type
        <i>Engine1::result_type</i> or the type <i>Engine2::result_type</i>,
        whichever provides the most storage according to clause 3.9.1.
!     </p></blockquote>
      
      <p>
        26.5.7.1 [rand.util.seedseq] paragraph 7...
      </p>
!     <blockquote><p>
        <i>Requires:</i><code>RandomAccessIterator</code> shall meet the
        requirements of a random access iterator (24.1.5) such that
        <code>iterator_traits&lt;RandomAccessIterator&gt;::value_type</code>
        shall denote an <del>unsigned integral type</del><ins>unsigned integer
        type</ins> capable of accomodating 32-bit quantities.  
!     </p></blockquote>
  
      <p>
        By making this change, integral types that happen to have a signed
*************** concepts.
*** 24888,24900 ****
        the original intent, and should be reviewed.
        29.6 [atomics.types.operations] paragraph 24...
      </p>
!     <blockquote>
        <i>Remark:</i> For <del>signed integral types</del><ins>signed integer
        types</ins>, arithmetic is defined using two's complement
        representation. There are no undefined results. For address types, the
        result may be an undefined address, but the operations otherwise have
        no undefined behavior.
!     </blockquote>
      
    
  
--- 21100,21112 ----
        the original intent, and should be reviewed.
        29.6 [atomics.types.operations] paragraph 24...
      </p>
!     <blockquote><p>
        <i>Remark:</i> For <del>signed integral types</del><ins>signed integer
        types</ins>, arithmetic is defined using two's complement
        representation. There are no undefined results. For address types, the
        result may be an undefined address, but the operations otherwise have
        no undefined behavior.
!     </p></blockquote>
      
    
  
*************** concepts.
*** 24902,25558 ****
  
  
  <hr>
- <h3><a name="874"></a>874. Missing <tt>initializer_list</tt> constructor for <tt>discrete_distribution</tt></h3>
- <p><b>Section:</b> 26.5.8.5.1 [rand.dist.samp.discrete] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-08-22 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.discrete">issues</a> in [rand.dist.samp.discrete].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- During the Sophia Antipolis meeting it was decided to separate from <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a> a
- subrequest that adds initializer list support to
- <tt>discrete_distribution</tt>, specifically,
- the issue proposed to add a c'tor taking a <tt>initializer_list&lt;double&gt;</tt>.
- </p>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <ol>
- <li>
- <p>
- In 26.5.8.5.1 [rand.dist.samp.discrete]/1, class <tt>discrete_distribution</tt>,
- just <em>before</em> the member declaration
- </p>
- 
- <blockquote><pre>explicit discrete_distribution(const param_type&amp; parm);
- </pre></blockquote>
- 
- <p>
- insert
- </p>
- 
- <blockquote><pre>discrete_distribution(initializer_list&lt;double&gt; wl);
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Between p.4 and p.5 of the same section insert a new
- paragraph as part of the new member description:
- </p>
- 
- <blockquote><pre>discrete_distribution(initializer_list&lt;double&gt; wl);
- </pre>
- 
- <blockquote>
- <i>Effects:</i> Same as <tt>discrete_distribution(wl.begin(), wl.end())</tt>.
- </blockquote>
- </blockquote>
- </li>
- </ol>
- 
- 
- <p><b>Rationale:</b></p>
- Addressed by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="875"></a>875. Missing <tt>initializer_list</tt> constructor for <tt>piecewise_constant_distribution</tt></h3>
- <p><b>Section:</b> 26.5.8.5.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-08-22 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- During the Sophia Antipolis meeting it was decided to separate from
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a> a subrequest that adds initializer list support to
- <tt>piecewise_constant_distribution</tt>, specifically, the issue proposed
- to add a c'tor taking a <tt>initializer_list&lt;double&gt;</tt> and a <tt>Callable</tt> to evaluate
- weight values. For consistency with the remainder of this class and
- the remainder of the <tt>initializer_list</tt>-aware library the author decided to
- change the list argument type to the template parameter <tt>RealType</tt>
- instead. For the reasoning to use <tt>Func</tt> instead of <tt>Func&amp;&amp;</tt> as c'tor
- function argument see issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p><b>Non-concept version of the proposed resolution</b></p>
- 
- <ol>
- <li>
- <p>
- In 26.5.8.5.2 [rand.dist.samp.pconst]/1, class <tt>piecewise_constant_distribution</tt>,
- just <em>before</em> the member declaration
- </p>
- 
- <blockquote><pre>explicit piecewise_constant_distribution(const param_type&amp; parm);
- </pre></blockquote>
- 
- <p>
- insert
- </p>
- 
- <blockquote><pre>template&lt;typename Func&gt;
- piecewise_constant_distribution(initializer_list&lt;RealType&gt; bl, Func fw);
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Between p.4 and p.5 of the same section insert a series of
- new paragraphs nominated below as [p5_1], [p5_2], and [p5_3]
- as part of the new member description:
- </p>
- 
- <blockquote><pre>template&lt;typename Func&gt;
- piecewise_constant_distribution(initializer_list&lt;RealType&gt; bl, Func fw);
- </pre>
- 
- <blockquote>
- 
- <p>
- [p5_1] <i>Complexity:</i> Exactly <tt>nf = max(bl.size(), 1) - 1</tt> invocations of <tt>fw</tt>.
- </p>
- 
- <p>
- [p5_2] <i>Requires:</i>
- </p>
- 
- <ol type="a">
- <li>
- <tt>fw</tt> shall be callable with one argument of type <tt>RealType</tt>, and shall
-    return values of a type convertible to <tt>double</tt>;
- </li>
- <li>
- The relation <tt>0 &lt; S = w<sub>0</sub>+. . .+w<sub>n-1</sub></tt> shall hold. 
- For all sampled values <tt><i>x<sub>k</sub></i></tt> defined below, <tt>fw(<i>x<sub>k</sub></i>)</tt> shall return a weight
-    value <tt><i>w<sub>k</sub></i></tt> that is non-negative, non-NaN, and non-infinity;
- </li>
- <li>
- If <tt>nf &gt; 0</tt> let <tt>b<sub><i>k</i></sub> = *(bl.begin() + k), k = 0, . . . , bl.size()-1</tt> and the
- following relations shall hold for <tt>k = 0, . . . , nf-1: b<sub><i>k</i></sub> &lt; b<sub><i>k+1</i></sub></tt>.
- </li>
- </ol>
- 
- <p>
- [p5_3] <i>Effects:</i>
- </p>
- 
- <ol type="a">
- <li>
- <p>If <tt>nf == 0</tt>,</p>
- <ol type="a">
- <li>
- lets the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist of the single
-      value <tt>w<sub>0</sub> = 1</tt>, and
- </li>
- <li>
- lets the sequence <tt>b</tt> have length <tt>n+1</tt> with <tt>b<sub>0</sub> = 0</tt> and <tt>b<sub>1</sub> = 1</tt>.
- </li>
- </ol>
- </li>
- 
- <li>
- <p>Otherwise,</p>
- <ol type="a">
- <li>
- sets <tt>n = nf</tt>, and <tt>[bl.begin(), bl.end())</tt> shall form the sequence <tt>b</tt> of
- length <tt>n+1</tt>, and
- </li>
- <li>
- <p>lets the sequences <tt>w</tt> have length <tt>n</tt> and for each <tt>k = 0, . . . ,n-1</tt>,
-      calculates:</p>
- <blockquote><pre>x<sub><i>k</i></sub> = 0.5*(b<sub><i>k+1</i></sub> + b<sub><i>k</i></sub>)
- w<sub><i>k</i></sub> = fw(x<sub><i>k</i></sub>)
- </pre></blockquote>
- </li>
- </ol>
- </li>
- 
- <li>
- <p>
- Constructs a <tt>piecewise_constant_distribution</tt> object with
- the above computed sequence <tt>b</tt> as the interval boundaries
- and with the probability densities:
- </p>
- <blockquote><pre>&#961;<sub><i>k</i></sub> = w<sub><i>k</i></sub>/(S * (b<sub><i>k+1</i></sub> - b<sub><i>k</i></sub>)) for k = 0, . . . , n-1.
- </pre></blockquote>
- 
- </li>
- </ol>
- 
- </blockquote>
- </blockquote>
- </li>
- </ol>
- 
- <p><b>Concept version of the proposed resolution</b></p>
- 
- <ol>
- <li>
- <p>
- In 26.5.8.5.2 [rand.dist.samp.pconst]/1, class <tt>piecewise_constant_distribution</tt>,
- just <em>before</em> the member declaration
- </p>
- 
- <blockquote><pre>explicit piecewise_constant_distribution(const param_type&amp; parm);
- </pre></blockquote>
- 
- <p>
- insert
- </p>
- 
- <blockquote><pre>template&lt;Callable&lt;auto, RealType&gt; Func&gt;
-  requires Convertible&lt;Func::result_type, double&gt;
- piecewise_constant_distribution(initializer_list&lt;RealType&gt; bl, Func fw);
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Between p.4 and p.5 of the same section insert a series of
- new paragraphs nominated below as [p5_1], [p5_2], and [p5_3]
- as part of the new member description:
- </p>
- 
- <blockquote><pre>template&lt;Callable&lt;auto, RealType&gt; Func&gt;
-  requires Convertible&lt;Func::result_type, double&gt;
- piecewise_constant_distribution(initializer_list&lt;RealType&gt; bl, Func fw);
- </pre>
- 
- <blockquote>
- 
- <p>
- [p5_1] <i>Complexity:</i> Exactly <tt>nf = max(bl.size(), 1) - 1</tt> invocations of <tt>fw</tt>.
- </p>
- 
- <p>
- [p5_2] <i>Requires:</i>
- </p>
- 
- <ol type="a">
- <li>
- The relation <tt>0 &lt; S = w<sub>0</sub>+. . .+w<sub>n-1</sub></tt> shall hold. 
- For all sampled values <tt><i>x<sub>k</sub></i></tt> defined below, <tt>fw(<i>x<sub>k</sub></i>)</tt> shall return a weight
-    value <tt><i>w<sub>k</sub></i></tt> that is non-negative, non-NaN, and non-infinity;
- </li>
- <li>
- If <tt>nf &gt; 0</tt> let <tt>b<sub><i>k</i></sub> = *(bl.begin() + k), k = 0, . . . , bl.size()-1</tt> and the
- following relations shall hold for <tt>k = 0, . . . , nf-1: b<sub><i>k</i></sub> &lt; b<sub><i>k+1</i></sub></tt>.
- </li>
- </ol>
- 
- <p>
- [p5_3] <i>Effects:</i>
- </p>
- 
- <ol type="a">
- <li>
- <p>If <tt>nf == 0</tt>,</p>
- <ol type="a">
- <li>
- lets the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist of the single
-      value <tt>w<sub>0</sub> = 1</tt>, and
- </li>
- <li>
- lets the sequence <tt>b</tt> have length <tt>n+1</tt> with <tt>b<sub>0</sub> = 0</tt> and <tt>b<sub>1</sub> = 1</tt>.
- </li>
- </ol>
- </li>
- 
- <li>
- <p>Otherwise,</p>
- <ol type="a">
- <li>
- sets <tt>n = nf</tt>, and <tt>[bl.begin(), bl.end())</tt> shall form the sequence <tt>b</tt> of
- length <tt>n+1</tt>, and
- </li>
- <li>
- <p>lets the sequences <tt>w</tt> have length <tt>n</tt> and for each <tt>k = 0, . . . ,n-1</tt>,
-      calculates:</p>
- <blockquote><pre>x<sub><i>k</i></sub> = 0.5*(b<sub><i>k+1</i></sub> + b<sub><i>k</i></sub>)
- w<sub><i>k</i></sub> = fw(x<sub><i>k</i></sub>)
- </pre></blockquote>
- </li>
- </ol>
- </li>
- 
- <li>
- <p>
- Constructs a <tt>piecewise_constant_distribution</tt> object with
- the above computed sequence <tt>b</tt> as the interval boundaries
- and with the probability densities:
- </p>
- <blockquote><pre>&#961;<sub><i>k</i></sub> = w<sub><i>k</i></sub>/(S * (b<sub><i>k+1</i></sub> - b<sub><i>k</i></sub>)) for k = 0, . . . , n-1.
- </pre></blockquote>
- 
- </li>
- </ol>
- 
- </blockquote>
- </blockquote>
- </li>
- </ol>
- 
- 
- 
- <p><b>Rationale:</b></p>
- Addressed by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="877"></a>877. to <tt>throw()</tt> or to <i>Throw:</i> Nothing.</h3>
- <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-08-23 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
-        <p>
- 
- Recent changes to
- the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf">working
- draft</a> have introduced a gratuitous inconsistency with the C++ 2003
- version of the specification with respect to exception guarantees
- provided by standard functions. While the C++ 2003 standard
- consistenly uses the empty exception specification, <tt>throw()</tt>,
- to declare functions that are guaranteed not to throw exceptions, the
- current working draft contains a number of "<i>Throws:</i> Nothing."
- clause to specify essentially the same requirement. The difference
- between the two approaches is that the former specifies the behavior
- of programs that violate the requirement (<tt>std::unexpected()</tt>
- is called) while the latter leaves the behavior undefined.
- 
-        </p>
-        <p>
- 
- A survey of the working draft reveals that there are a total of 209
- occurrences of <tt>throw()</tt> in the library portion of the spec,
- the majority in clause 18, a couple (literally) in 19, a handful in
- 20, a bunch in 22, four in 24, one in 27, and about a dozen in D.9.
- 
-        </p>
-        <p>
- 
- There are also 203 occurrences of "<i>Throws:</i> Nothing." scattered
- throughout the spec.
- 
-        </p>
-        <p>
- 
- While sometimes there are good reasons to use the "<i>Throws:</i>
- Nothing."  approach rather than making use of <tt>throw()</tt>, these
- reasons do not apply in most of the cases where this new clause has
- been introduced and the empty exception specification would be a
- better approach.
- 
-        </p>
-        <p>
- 
- First, functions declared with the empty exception specification
- permit compilers to generate better code for calls to such
- functions. In some cases, the compiler might even be able to eliminate
- whole chunks of user-written code when instantiating a generic
- template on a type whose operations invoked from the template
- specialization are known not to throw. The prototypical example are
- the <tt>std::uninitialized_copy()</tt>
- and <tt>std::uninitialized_fill()</tt> algorithms where the
- entire <tt>catch(...)</tt> block can be optimized away.
- 
-        </p>
-        <p>
- 
- For example, given the following definition of
- the <tt>std::uninitialized_copy</tt> function template and a
- user-defined type <tt>SomeType</tt>:
- 
-        </p>
-        <blockquote>
-            <pre>template &lt;class InputIterator, class ForwardIterator&gt;
- ForwardIterator
- uninitialized_copy (InputIterator first, InputIterator last, ForwardIterator res)
- {
-    typedef iterator_traits&lt;ForwardIterator&gt;::value_type ValueType;
- 
-    ForwardIterator start = res;
- 
-    try {
-        for (; first != last; ++first, ++res)
-            ::new (&amp;*res) ValueType (*first);
-    }
-    catch (...) {
-        for (; start != res; --start)
-            (&amp;*start)-&gt;~ValueType ();
-        throw;
-    }
-    return res;
- }
- 
- struct SomeType {
-    SomeType (const SomeType&amp;) <ins>throw ()</ins>;
- }</pre>
-        </blockquote>
-        <p>
- 
- compilers are able to emit the following efficient specialization
- of <tt>std::uninitialized_copy&lt;const SomeType*, SomeType*&gt;</tt>
- (note that the <tt>catch</tt> block has been optimized away):
- 
-        </p>
-        <blockquote>
-            <pre>template &lt;&gt; SomeType*
- uninitialized_copy (const SomeType *first, const SomeType *last, SomeType *res)
- {
-    for (; first != last; ++first, ++res)
-        ::new (res) SomeType (*first);
- 
-    return res;
- }</pre>
-        </blockquote>
-        <p>
- 
- Another general example is default constructors which, when decorated
- with <tt>throw()</tt>, allow the compiler to eliminate the
- implicit <tt>try</tt> and <tt>catch</tt> blocks that it otherwise must
- emit around each the invocation of the constructor
- in <i>new-expressions</i>.
- 
-        </p>
-        <p>
- 
- For example, given the following definitions of
- class <tt>MayThrow</tt> and <tt>WontThrow</tt> and the two
- statements below:
- 
-        </p>
-        <blockquote>
-            <pre>struct MayThrow {
-    MayThrow ();
- };
- 
- struct WontThrow {
-    WontThrow () <ins>throw ()</ins>;
- };
- 
- MayThrow  *a = new MayThrow [N];
- WontThrow *b = new WontThrow [N];</pre>
- 
-        </blockquote>
-        <p>
- 
- the compiler generates the following code for the first statement:
- 
-        </p>
-        <blockquote>
-            <pre>MayThrow *a;
- {
-    MayThrow *first = operator new[] (N * sizeof (*a));
-    MayThrow *last  = first + N;
-    MayThrow *next  = first;
-    try {
-        for ( ; next != last; ++next)
-            new (next) MayThrow;
-    }
-    catch (...) {
-        for ( ; first != first; --next)
-            next-&gt;~MayThrow ();
-        operator delete[] (first);
-        throw;
-    }
-    a = first;
- }</pre>
-        </blockquote>
-        <p>
- 
- but it is can generate much more compact code for the second statement:
- 
-        </p>
-        <blockquote>
-            <pre>WontThrow *b    = operator new[] (N * sizeof (*b));
- WontThrow *last = b + N;
- for (WontThrow *next = b; next != last; ++next)
-    new (next) WontThrow;
- </pre>
-        </blockquote>
-        <p>
- 
- Second, in order for users to get the maximum benefit out of the new
- <tt>std::has_nothrow_xxx</tt> traits when using standard library types
- it will be important for implementations to decorate all non throwing
- copy constructors and assignment operators with <tt>throw()</tt>. Note
- that while an optimizer may be able to tell whether a function without
- an explicit exception specification can throw or not based on its
- definition, it can only do so when it can see the source code of the
- definition. When it can't it must assume that the function may
- throw. To prevent violating the One Definition Rule,
- the <tt>std::has_nothrow_xxx</tt> trait must return the most
- pessimistic guess across all translation units in the program, meaning
- that <tt>std::has_nothrow_xxx&lt;T&gt;::value</tt> must evaluate to
- <tt>false</tt> for any <tt>T</tt> whose <tt>xxx</tt>
- (where <tt>xxx</tt> is default or copy ctor, or assignment operator)
- is defined out-of-line.
- 
-        </p>
-        <p>
- 
- <b>Counterarguments:</b>
- 
-        </p>
-        <p>
- 
- During the discussion of this issue
- on <a href="mailto:c++std-lib@accu.org">c++std-lib@accu.org</a>
- (starting with post <tt>c++std-lib-21950</tt>) the following arguments
- in favor of the "<i>Throws:</i> Nothing." style have been made.
- 
-        </p>
-        <p>
-          </p><ol>
-            <li>
- 
- Decorating functions that cannot throw with the empty exception
- specification can cause the compiler to generate suboptimal code for
- the implementation of the function when it calls other functions that
- aren't known to the compiler not to throw (i.e., that aren't decorated
- with <tt>throw()</tt> even if they don't actually throw). This is a
- common situation when the called function is a C or POSIX function.
- 
-            </li>
-            <li>
- 
- Alternate, proprietary mechanisms exist (such as
- GCC <a href="http://gcc.gnu.org/onlinedocs/gcc-4.3.0/gcc/Function-Attributes.html#index-g_t_0040code_007bnothrow_007d-function-attribute-2160"><tt>__attribute__((nothrow))</tt></a>
- or Visual
- C++ <a href="http://msdn.microsoft.com/en-us/library/49147z04(VS.80).aspx"><tt>__declspec(nothrow)</tt></a>)
- that let implementers mark up non-throwing functions, often without
- the penalty mentioned in (1) above. The C++ standard shouldn't
- preclude the use of these potentially more efficient mechanisms.
- 
-            </li>
-            <li>
- 
- There are functions, especially function templates, that invoke
- user-defined functions that may or may not be
- declared <tt>throw()</tt>. Declaring such functions with the empty
- exception specification will cause compilers to generate suboptimal
- code when the user-defined function isn't also declared not to throw.
- 
-            </li>
-         </ol>
-        <p></p>
-        <p>
- 
- The answer to point (1) above is that implementers can (and some have)
- declare functions with <tt>throw()</tt> to indicate to the compiler
- that calls to the function can safely be assumed not to throw in order
- to allow it to generate efficient code at the call site without also
- having to define the functions the same way and causing the compiler
- to generate suboptimal code for the function definition. That is, the
- function is declared with <tt>throw()</tt> in a header but it's
- defined without it in the source file. The <tt>throw()</tt>
- declaration is suppressed when compiling the definition to avoid
- compiler errors. This technique, while strictly speaking no permitted
- by the language, is safe and has been employed in practice. For
- example, the GNU C library takes this approach. Microsoft Visual C++
- takes a similar approach by simply assuming that no function with C
- language linkage can throw an exception unless it's explicitly
- declared to do so using the language extension <tt>throw(...)</tt>.
- 
-        </p>
-        <p>
- 
- Our answer to point (2) above is that there is no existing practice
- where C++ Standard Library implementers have opted to make use of the
- proprietary mechanisms to declare functions that don't throw. The
- language provides a mechanism specifically designed for this
- purpose. Avoiding its use in the specification itself in favor of
- proprietary mechanisms defeats the purpose of the feature. In
- addition, making use of the empty exception specification
- inconsistently, in some areas of the standard, while conspicuously
- avoiding it and making use of the "<i>Throws:</i> Nothing." form in
- others is confusing to users.
- 
-        </p>
-        <p>
- 
- The answer to point (3) is simply to exercise caution when declaring
- functions and especially function templates with the empty exception
- specification. Functions that required not to throw but that may call
- back into user code are poor candidates for the empty exception
- specification and should instead be specified using "<i>Throws:</i>
- Nothing." clause.
- 
-       </p>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- We need someone to do an extensive review.
- </p>
- <p>
- NAD Future.
- </p>
- </blockquote>
- 
-    
-    <p><b>Proposed resolution:</b></p>
-        <p>
- 
- We propose two possible solutions. Our recommendation is to adopt
- Option 1 below.
- 
-        </p>
-        <p>
- 
- <b>Option 1:</b>
- 
-        </p>
-        <p>
- 
- Except for functions or function templates that make calls back to
- user-defined functions that may not be declared <tt>throw()</tt>
- replace all occurrences of the "<i>Throws:</i> Nothing." clause with
- the empty exception specification. Functions that are required not to
- throw but that make calls back to user code should be specified to
- "<i>Throw:</i> Nothing."
- 
-        </p>
-        <p>
- 
- <b>Option 2:</b>
- 
-        </p>
-        <p>
- 
- For consistency, replace all occurrences of the empty exception
- specification with a "<i>Throws:</i> Nothing." clause.
- 
-        </p>
-    
- 
- 
- 
- <hr>
  <h3><a name="879"></a>879. Atomic load const qualification</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alexander Chemeris <b>Opened:</b> 2008-08-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>atomic_address</tt> type and <tt>atomic&lt;T*&gt;</tt> specialization provide atomic
--- 21114,21124 ----
  
  
  <hr>
  <h3><a name="879"></a>879. Atomic load const qualification</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alexander Chemeris <b>Opened:</b> 2008-08-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>atomic_address</tt> type and <tt>atomic&lt;T*&gt;</tt> specialization provide atomic
*************** is unnecessary and unintended.
*** 25565,25575 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  Move to review.  Lawrence will first check with Peter whether the
  current examples are sufficient, or whether they need to be expanded to
  include all cases.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
--- 21131,21141 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  Move to review.  Lawrence will first check with Peter whether the
  current examples are sufficient, or whether they need to be expanded to
  include all cases.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
*************** Move to Open.
*** 25599,25608 ****
  ]</i></p>
  
  
! <blockquote>
  NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
! </blockquote>
  
  
  
--- 21165,21174 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
! </p></blockquote>
  
  
  
*************** Add const qualification to the pointer v
*** 25612,25618 ****
  and <tt>atomic&lt;T*&gt;</tt> specializations.  E.g.
  </p>
  
! <blockquote><pre>typedef struct atomic_address {
     void store(<ins>const</ins> void*, memory_order = memory_order_seq_cst) volatile;
     void* exchange( <ins>const</ins> void*, memory_order = memory_order_seq_cst) volatile;
     bool compare_exchange( <ins>const</ins> void*&amp;, <ins>const</ins> void*,
--- 21178,21185 ----
  and <tt>atomic&lt;T*&gt;</tt> specializations.  E.g.
  </p>
  
! <blockquote><pre>
! typedef struct atomic_address {
     void store(<ins>const</ins> void*, memory_order = memory_order_seq_cst) volatile;
     void* exchange( <ins>const</ins> void*, memory_order = memory_order_seq_cst) volatile;
     bool compare_exchange( <ins>const</ins> void*&amp;, <ins>const</ins> void*,
*************** bool atomic_compare_exchange_explicit(vo
*** 25640,25729 ****
  
  
  <hr>
- <h3><a name="880"></a>880. Missing atomic exchange parameter</h3>
- <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-08-24 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#942">942</a></p>
- <p><b>Discussion:</b></p>
- <p>
- The <tt>atomic_exchange</tt> and <tt>atomic_exchange_explicit</tt> functions seem to
- be inconsistently missing parameters.
- </p>
- 
- <p><i>[
- Post Summit:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Lawrence: Need to write up a list for Pete with details.
- </p>
- <p>
- Detlef: Should not be New, we already talked about in Concurrency group.
- </p>
- <p>
- Recommend Open.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Lawrence will handle all issues relating to atomics in a single paper.
- </p>
- <p>
- LWG will defer discussion on atomics until that paper appears.
- </p>
- <p>
- Move to Open.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-08-17 Handled by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2925.html">N2925</a>.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Add the appropriate parameters.  For example,
- </p>
- 
- <blockquote><pre>bool atomic_exchange(volatile atomic_bool*<ins>, bool</ins>);
- bool atomic_exchange_explicit(volatile atomic_bool*, bool<ins>, memory_order</ins>);
- </pre></blockquote>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="887"></a>887. issue with condition::wait_...</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The Posix/C++ working group has identified an inconsistency between
--- 21207,21217 ----
  
  
  <hr>
  <h3><a name="887"></a>887. issue with condition::wait_...</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The Posix/C++ working group has identified an inconsistency between
*************** overload for unknown clocks which synchs
*** 25750,25756 ****
  For example:
  </p>
  
! <blockquote><pre>template &lt;class Duration&gt;
  bool
  condition_variable::wait_until(unique_lock&lt;mutex&gt;&amp; lock,
                                 const chrono::time_point&lt;chrono::system_clock, Duration&gt;&amp; abs_time)
--- 21238,21245 ----
  For example:
  </p>
  
! <blockquote><pre>
! template &lt;class Duration&gt;
  bool
  condition_variable::wait_until(unique_lock&lt;mutex&gt;&amp; lock,
                                 const chrono::time_point&lt;chrono::system_clock, Duration&gt;&amp; abs_time)
*************** See the minutes at: <a href="http://wiki
*** 25822,25830 ****
  ]</i></p>
  
  
! <blockquote>
  Move to NAD.
! </blockquote>
  
  <p><i>[
  2009-07-18 Detlef reopens the issue:
--- 21311,21319 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to NAD.
! </p></blockquote>
  
  <p><i>[
  2009-07-18 Detlef reopens the issue:
*************** text concerning <tt>pthread_cond_timedwa
*** 25886,25899 ****
  <a href="http://www.unix.org/single_unix_specification/">here</a>.
  </p>
  
! <blockquote>
  The <tt>pthread_cond_timedwait()</tt> function shall be equivalent to
  <tt>pthread_cond_wait()</tt>, except that an error is returned if the absolute
  time specified by <tt>abstime</tt> passes (that is, system time equals or exceeds
  <tt>abstime</tt>) before the condition <tt>cond</tt> is signaled or broadcasted, or if the
  absolute time specified by <tt>abstime</tt> has already been passed at the time
  of the call.
! </blockquote>
  
  <p>
  I.e. the POSIX specification speaks of the error code returned in case of a time
--- 21375,21388 ----
  <a href="http://www.unix.org/single_unix_specification/">here</a>.
  </p>
  
! <blockquote><p>
  The <tt>pthread_cond_timedwait()</tt> function shall be equivalent to
  <tt>pthread_cond_wait()</tt>, except that an error is returned if the absolute
  time specified by <tt>abstime</tt> passes (that is, system time equals or exceeds
  <tt>abstime</tt>) before the condition <tt>cond</tt> is signaled or broadcasted, or if the
  absolute time specified by <tt>abstime</tt> has already been passed at the time
  of the call.
! </p></blockquote>
  
  <p>
  I.e. the POSIX specification speaks of the error code returned in case of a time
*************** I do not believe so.  This same section
*** 25909,25919 ****
  text:
  </p>
  
! <blockquote>
  For cases when the system clock is advanced discontinuously by an
  operator, it is expected that implementations process any timed wait
  expiring at an intervening time as if that time had actually occurred.
! </blockquote>
  
  <p>
  Here is non-normative wording encouraging the implementation to ignore an advancing
--- 21398,21408 ----
  text:
  </p>
  
! <blockquote><p>
  For cases when the system clock is advanced discontinuously by an
  operator, it is expected that implementations process any timed wait
  expiring at an intervening time as if that time had actually occurred.
! </p></blockquote>
  
  <p>
  Here is non-normative wording encouraging the implementation to ignore an advancing
*************** advanced during the wait.  In contrast <
*** 25934,25940 ****
  always returns:
  </p>
  
! <blockquote><pre><tt>Clock::now() &lt; abs_time</tt>
  </pre></blockquote>
  
  <p>
--- 21423,21430 ----
  always returns:
  </p>
  
! <blockquote><pre>
! <tt>Clock::now() &lt; abs_time</tt>
  </pre></blockquote>
  
  <p>
*************** not have good wording for such a note, b
*** 25980,25990 ****
  ]</i></p>
  
  
! <blockquote>
  The LWG is in favor of Detlef to supply revision which adopts Option 2 from
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2969.html">N2969</a>
  but is modified by saying that <tt>system_clock</tt> must be available for <tt>wait_until</tt>.
! </blockquote>
  
  <p><i>[
  2010-02-11 Anthony provided wording.
--- 21470,21480 ----
  ]</i></p>
  
  
! <blockquote><p>
  The LWG is in favor of Detlef to supply revision which adopts Option 2 from
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2969.html">N2969</a>
  but is modified by saying that <tt>system_clock</tt> must be available for <tt>wait_until</tt>.
! </p></blockquote>
  
  <p><i>[
  2010-02-11 Anthony provided wording.
*************** If a function in this clause takes a tim
*** 26104,26110 ****
  elapsed time specified passes before the function returns, the latency between
  the timeout occurring and the function returning is unspecified [<i>Note:</i>
  Implementations should strive to keep such latency as small as possible, but
! portable code should not rely on any specific upper limits — <i>end
  note</i>]
  </ins></p>
  </blockquote>
--- 21594,21600 ----
  elapsed time specified passes before the function returns, the latency between
  the timeout occurring and the function returning is unspecified [<i>Note:</i>
  Implementations should strive to keep such latency as small as possible, but
! portable code should not rely on any specific upper limits &mdash; <i>end
  note</i>]
  </ins></p>
  </blockquote>
*************** note</i>]
*** 26114,26384 ****
  
  
  <hr>
- <h3><a name="889"></a>889. thread::id comparisons</h3>
- <p><b>Section:</b> 30.3.1.1 [thread.thread.id] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.id">issues</a> in [thread.thread.id].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses UK 324</b></p>
- 
- <p>
- The <tt>thread::id</tt> type supports the full set of comparison operators.  This
- is substantially more than is required for the associative containers that
- justified them.  Please place an issue against the threads library.
- </p>
- 
- <p><i>[
- San Francisco:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Would depend on proposed extension to POSIX, or non-standard extension.
- What about hash? POSIX discussing op. POSIX not known to be considering
- support needed for hash, op.
- </p>
- <p>
- Group expresses support for putting ids in both unordered and ordered containers.
- </p>
- </blockquote>
- 
- <p><i>[
- post San Francisco:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Howard:  It turns out the current working paper
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
- <i>already has</i> <tt>hash&lt;thread::id&gt;</tt>
- (20.8 [function.objects], 20.8.15 [unord.hash]).  We simply
- overlooked it in the meeting.  It is a good thing we voted in favor of it
- (again). :-)
- </p>
- <p>
- Recommend NAD.
- </p>
- 
- </blockquote>
- 
- <p><i>[
- Post Summit:
- ]</i></p>
- 
- 
- <blockquote>
- Recommend to close as NAD. For POSIX, see if we need to add a function to
- convert <tt>pthread_t</tt> to integer.
- </blockquote>
- 
- <p><i>[
- Post Summit, Alisdair adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- The recommendation for LWG-889/UK-324 is NAD, already specified.
- </p>
- <p>
- It is not clear to me that the specification is complete.
- </p>
- <p>
- In particular, the synopsis of <tt>&lt;functional&gt;</tt> in 20.8 [function.objects] does not mention <tt>hash&lt; thread::id
- &gt;</tt> nor <tt>hash&lt; error_code &gt;</tt>, although their
- existence is implied by 20.8.15 [unord.hash], p1.
- </p>
- <p>
- I am fairly uncomfortable putting the declaration for the
- <tt>thread_id</tt> specialization into <tt>&lt;functional&gt;</tt> as
- <tt>id</tt> is a nested class inside <tt>std::thread</tt>, so it implies
- that <tt>&lt;functional&gt;</tt> would require the definition of the
- <tt>thread</tt> class template in order to forward declared
- <tt>thread::id</tt> and form this specialization.
- </p>
- <p>
- It seems better to me that the dependency goes the other way around
- (<tt>&lt;thread&gt;</tt> will more typically make use of
- <tt>&lt;functional&gt;</tt> than vice-versa) and the
- <tt>hash&lt;thread::id&gt;</tt> specialization be declared in the
- <tt>&lt;thread&gt;</tt> header.
- </p>
- <p>
- I think <tt>hash&lt;error_code&gt;</tt> could go into either
- <tt>&lt;system_error&gt;</tt> or <tt>&lt;functional&gt;</tt> and have no
- immediate preference either way.  However, it should clearly appear in
- the synopsis of one of these two.
- </p>
- <p>
- Recommend moving 889 back to open, and tying in a reference to UK-324.
- </p>
- </blockquote>
- 
- <p><i>[
- Batavia (2009-05):
- ]</i></p>
- 
- <blockquote>
- Howard observes that <tt>thread::id</tt> need not be a nested class;
- it could be a <tt>typedef</tt> for a more visible type.
- </blockquote>
- 
- <p><i>[
- 2009-05-24 Alisdair adds:
- ]</i></p>
- 
- <blockquote>
- I do not believe this is correct.  <tt>thread::id</tt> is explicitly documents as a
- nested class, rather than as an unspecified typedef analogous to an
- iterator.  If the intent is that this is not implemented as a nested class
- (under the as-if freedoms) then this is a novel form of standardese.
- </blockquote>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- Decided we want to move hash specialization for thread_id to the thread
- header. Alisdair to provide wording.
- </blockquote>
- 
- <p><i>[
- 2009-07-28 Alisdair provided wording, moved to Review.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Add a strike for <tt>hash&lt;thread::id&gt;</tt>. Move to Ready
- </blockquote>
- 
- <p><i>[
- 2009-11-13 The proposed wording of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a> is a superset of the
- wording in this issue.
- ]</i></p>
- 
- 
- <p><i>[
- 2010-02-09 Moved from Ready to Open:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a> is not quite a superset of this issue and it is controversial
- whether or not the note:
- </p>
- 
- <blockquote>
- hash template specialization allows <tt>thread::id</tt> objects to be used as keys in
- unordered containers.
- </blockquote>
- 
- <p>
- should be added to the WP.
- </p>
- 
- 
- </blockquote>
- 
- <p><i>[
- 2010-02-09 Objections to moving this to NAD Editorial, solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a> have been removed.  Set to Tentatively NAD Editorial.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- <p>
- Remove the following prototype from the synopsis in
- 20.8 [function.objects]:
- </p>
- 
- <blockquote><pre><del>
- template &lt;&gt; struct hash&lt;std::thread::id&gt;;
- </del></pre></blockquote>
- 
- <p>
- Add to 30.3 [thread.threads], p1 Header <tt>&lt;thread&gt;</tt> synopsis:
- </p>
- 
- <blockquote><pre><ins>template &lt;class T&gt; struct hash;
- template &lt;&gt; struct hash&lt;thread::id&gt;;</ins>
- </pre></blockquote>
- 
- <p>
- Add template specialization below class definition in 30.3.1.1 [thread.thread.id]
- </p>
- 
- <blockquote><pre><ins>template &lt;&gt;
- struct hash&lt;thread::id&gt; : public unary_function&lt;thread::id, size_t&gt; {
-    size_t operator()(thread::id val) const;
- };</ins>
- </pre></blockquote>
- 
- <p>
- Extend note in p2 30.3.1.1 [thread.thread.id] with second sentence:
- </p>
- 
- <blockquote>
- [<i>Note:</i> Relational operators allow <tt>thread::id</tt> objects to be used
- as keys in associative containers.
- <ins><tt>hash</tt> template specialization allows <tt>thread::id</tt> objects to be used as keys
- in unordered containers.</ins>
- — <i>end note</i>]
- </blockquote>
- 
- <p>
- Add new paragraph to end of 30.3.1.1 [thread.thread.id]
- </p>
- 
- <blockquote><pre><ins>template &lt;&gt; struct hash&lt;thread::id&gt;;</ins>
- </pre>
- <blockquote><ins>
- An explicit specialization of the class template hash (20.8.15 [unord.hash])
- shall be provided for the type <tt>thread::id</tt>.
- </ins></blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="892"></a>892. Forward_list issues...</h3>
! <p><b>Section:</b> 23.3.3.5 [forwardlist.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Ed Smith-Rowland <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I was looking at the latest draft on <tt>forward_list</tt>.  Especially the splice methods.
  </p>
  <p>
  The first one splices a whole list after a given iterator in <tt>this</tt>.  The name is <tt>splice_after</tt>.
! I think in 23.3.3.5 [forwardlist.ops] paragraph 40
  change:
  </p>
! <blockquote>
  <i>Effect:</i> Insert the contents of <tt>x</tt> <del>before</del> <ins>after</ins> <tt>position</tt>, ...
! </blockquote>
  
  <p>
  A deeper issue involves the complexity.  <tt>forward_list</tt> has no <tt>size</tt> and we
--- 21604,21626 ----
  
  
  <hr>
  <h3><a name="892"></a>892. Forward_list issues...</h3>
! <p><b>Section:</b> 23.3.4.6 [forwardlist.ops] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Ed Smith-Rowland <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I was looking at the latest draft on <tt>forward_list</tt>.  Especially the splice methods.
  </p>
  <p>
  The first one splices a whole list after a given iterator in <tt>this</tt>.  The name is <tt>splice_after</tt>.
! I think in 23.3.4.6 [forwardlist.ops] paragraph 40
  change:
  </p>
! <blockquote><p>
  <i>Effect:</i> Insert the contents of <tt>x</tt> <del>before</del> <ins>after</ins> <tt>position</tt>, ...
! </p></blockquote>
  
  <p>
  A deeper issue involves the complexity.  <tt>forward_list</tt> has no <tt>size</tt> and we
*************** Move to NAD Editorial, Pending. Howard t
*** 26429,26447 ****
  problems with the complexity requirements.
  </p>
  <p>
! Opened <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>.
  </p>
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.3.3.5 [forwardlist.ops] paragraph 40
  change:
  </p>
! <blockquote>
  <i>Effect:</i> Insert the contents of <tt>x</tt> <del>before</del> <ins>after</ins> <tt>position</tt>, ...
! </blockquote>
  
  
  
--- 21671,21689 ----
  problems with the complexity requirements.
  </p>
  <p>
! Opened <a href="lwg-defects.html#897">897</a>.
  </p>
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.3.4.6 [forwardlist.ops] paragraph 40
  change:
  </p>
! <blockquote><p>
  <i>Effect:</i> Insert the contents of <tt>x</tt> <del>before</del> <ins>after</ins> <tt>position</tt>, ...
! </p></blockquote>
  
  
  
*************** change:
*** 26449,26459 ****
  
  <hr>
  <h3><a name="895"></a>895. "Requires:" on std::string::at et al</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> James Dennett <b>Opened:</b> 2008-09-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Per discussion, we need an issue open to cover looking at "Requires"
--- 21691,21701 ----
  
  <hr>
  <h3><a name="895"></a>895. "Requires:" on std::string::at et al</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> James Dennett <b>Opened:</b> 2008-09-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#625">625</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Per discussion, we need an issue open to cover looking at "Requires"
*************** clauses which are not constraints on use
*** 26466,26821 ****
  ]</i></p>
  
  
! <blockquote>
   Alan to address in paper.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="897"></a>897. Forward_list issues... Part 2</h3>
! <p><b>Section:</b> 23.3.3.4 [forwardlist.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-09-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist.modifiers">issues</a> in [forwardlist.modifiers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! This issue was split off from <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#892">892</a> at the request of the LWG.
! </p>
! 
! <p><i>[
! San Francisco:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! This issue is more complicated than it looks.
! </p>
! <p>
! paragraph 47: replace each <tt>(first, last) with (first, last]</tt>
! </p>
! <p>
! add a statement after paragraph 48 that complexity is O(1)
! </p>
! <p>
! remove the complexity statement from the first overload of splice_after
! </p>
! <p>
! We may have the same problems with other modifiers, like erase_after.
! Should it require that all iterators in the range (position, last] be
! dereferenceable?
! </p>
! </blockquote>
! 
! <p>
! There are actually 3 issues here:
! </p>
! 
! <ol>
! <li>
! <p>
! What value should <tt>erase_after</tt> return?  With <tt>list</tt>, code often
! looks like:
! </p>
! <blockquote><pre>for (auto i = l.begin(); i != l.end();)
! {
!     // inspect *i and decide if you want to erase it
!     // ...
!     if (I want to erase *i)
!         i = l.erase(i);
!     else
!         ++i;
! }
! </pre></blockquote>
! <p>
! I.e. the iterator returned from <tt>erase</tt> is useful for setting up the
! logic for operating on the next element.  For <tt>forward_list</tt> this might
! look something like:
! </p>
! <blockquote><pre>auto i = fl.before_begin();
! auto ip1 = i;
! for (++ip1; ip1 != fl.end(); ++ip1)
! {
!     // inspect *(i+1) and decide if you want to erase it
!     // ...
!     if (I want to erase *(i+1))
!         i = fl.erase_after(i);
!     else
!         ++i;
!     ip1 = i;
! }
! </pre></blockquote>
! <p>
! In the above example code, it is convenient if <tt>erase_after</tt> returns
! the element <i>prior</i> to the erased element (range) instead of the element
! <i>after</i> the erase element (range).
! </p>
! <p>
! Existing practice:
! </p>
! <ul>
! <li>SGI slist returns an iterator referencing the element <i>after</i> the erased range.</li>
! <li>CodeWarrior slist returns an iterator referencing the element <i>before</i> the erased range.</li>
! </ul>
! <p>
! There is not a strong technical argument for either solution over the other.
! </p>
! </li>
! 
! <li>
! <p>
! With all other containers, operations always work on the range
! <tt>[first, last)</tt> and/or <i>prior to</i> the given <tt>position</tt>.
! </p>
! <p>
! With <tt>forward_list</tt>, operations sometimes work on the range
! <tt>(first, last]</tt> and/or <i>after</i> the given <tt>position</tt>.
! </p>
! <p>
! This is simply due to the fact that in order to operate on
! <tt>*first</tt> (with <tt>forward_list</tt>) one needs access to
! <tt>*(first-1)</tt>.  And that's not practical with
! <tt>forward_list</tt>.  So the operating range needs to start with <tt>(first</tt>,
! not <tt>[first</tt> (as the current working paper says). 
! </p>
! <p>
! Additionally, if one is interested in  splicing the range <tt>(first, last)</tt>,
! then (with <tt>forward_list</tt>), one needs practical (constant time) access to
! <tt>*(last-1)</tt> so that one can set the <i>next</i> field in this node to
! the proper value.  As this is not possible with <tt>forward_list</tt>, one must
! specify the last element of interest instead of one past the last element of
! interest.  The syntax for doing this is to pass <tt>(first, last]</tt> instead
! of <tt>(first, last)</tt>.
! </p>
! <p>
! With <tt>erase_after</tt> we have a choice of either erasing the range
! <tt>(first, last]</tt> <em>or</em> <tt>(first, last)</tt>.  Choosing the latter
! enables:
! </p>
! <blockquote><pre>x.erase_after(pos, x.end());
! </pre></blockquote>
! 
! <p>
! With the former, the above statement is inconvenient or expensive due to the lack
! of constant time access to <tt>x.end()-1</tt>.  However we could introduce:
! </p>
! 
! <blockquote><pre>iterator erase_to_end(const_iterator position);
! </pre></blockquote>
! 
! <p>
! to compensate.
! </p>
! 
! <p>
! The advantage of the former (<tt>(first, last]</tt>) for <tt>erase_after</tt>
! is a consistency with <tt>splice_after</tt> which uses <tt>(first, last]</tt>
! as the specified range.  But this either requires the addition of <tt>erase_to_end</tt>
! or giving up such functionality.
! </p>
! 
! </li>
! 
! <li>
! As stated in the discussion of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#892">892</a>, and reienforced by point 2 above,
! a <tt>splice_after</tt> should work on the source range <tt>(first, last]</tt>
! if the operation is to be <i>&#927;</i>(1).  When splicing an entire list <tt>x</tt> the
! algorithm needs <tt>(x.before_begin(), x.end()-1]</tt>.  Unfortunately <tt>x.end()-1</tt>
! is not available in constant time unless we specify that it must be.  In order to
! make <tt>x.end()-1</tt> available in constant time, the implementation would have
! to dedicate a pointer to it.  I believe the design of
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2543.htm">N2543</a>
! intended a nominal overhead of <tt>foward_list</tt> of 1 pointer.  Thus splicing
! one <i>entire</i> <tt>forward_list</tt> into another can not be <i>&#927;</i>(1).
! </li>
! </ol>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote>
! <p>
! We agree with the proposed resolution.
! </p>
! <p>
! Move to Review.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-07 Frankfurt
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! We may need a new issue to correct splice_after, because it may no
! longer be correct to accept an rvalues as an argument. Merge may be
! affected, too. This might be issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>. (Howard: confirmed)
! </p>
! <p>
! Move this to Ready, but the Requires clause of the second form of
! splice_after should say "(first, last)," not "(first, last]" (there are
! three occurrences). There was considerable discussion on this. (Howard: fixed)
! </p>
! <p>
! Alan suggested removing the "foward_last&lt;T. Alloc&gt;&amp;&amp; x"
! parameter from the second form of splice_after, because it is redundant.
! PJP wanted to keep it, because it allows him to check for bad ranges
! (i.e. "Granny knots").
! </p>
! <p>
! We prefer to keep <tt>x</tt>.
! </p>
! <p>
! Beman. Whenever we deviate from the customary half-open range in the
! specification, we should add a non-normative comment to the standard
! explaining the deviation. This clarifies the intention and spares the
! committee much confusion in the future.
! </p>
! <p>
! Alan to write a non-normative comment to explain the use of fully-closed ranges.
! </p>
! <p>
! Move to Ready, with the changes described above. (Howard: awaiting note from Alan)
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial, addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2988.pdf">N2988</a>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
- Wording below assumes issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a> is accepted, but this issue is
- independent of that issue.
  </p>
  
- <p>
- Change 23.3.3.4 [forwardlist.modifiers]:
- </p>
- 
- <blockquote>
- <pre>iterator erase_after(const_iterator position);
- </pre>
- <blockquote>
- <p>
- <i>Requires:</i> The iterator following <tt>position</tt> is dereferenceable.
- </p>
- <p>
- <i>Effects:</i> Erases the element pointed to by the iterator following <tt>position</tt>.
- </p>
- <p>
- <i>Returns:</i> <del>An iterator pointing to the element following the one that was erased, or <tt>end()</tt> if no such 
- element exists</del>
- <ins>An iterator equal to <tt>position</tt></ins>.
- </p>
- </blockquote>
- 
- 
- <pre>iterator erase_after(const_iterator position, <ins>const_</ins>iterator last);
- </pre>
- <blockquote>
- <p>
- <i>Requires:</i> All iterators in the range
- <tt><del>[</del><ins>(</ins>position,last)</tt>
- are dereferenceable.
- </p>
- <p>
- <i>Effects:</i> Erases the elements in the range
- <tt><del>[</del><ins>(</ins>position,last)</tt>.
- </p>
- <p>
- <i>Returns:</i>  <ins>An iterator equal to <tt>position</tt></ins> <del><tt>last</tt></del>
- </p>
- </blockquote>
- </blockquote>
- 
- <p>
- Change 23.3.3.5 [forwardlist.ops]:
- </p>
- 
- <blockquote>
- <pre>void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp;&amp; x);
- </pre>
- <blockquote>
- <p>
- <i>Requires:</i> <tt>position</tt> is <tt>before_begin()</tt> or a
- dereferenceable iterator in the range <tt>[begin(), end))</tt>. <tt>&amp;x != this</tt>.
- </p>
- <p>
- <i>Effects:</i> Inserts the contents of <tt>x</tt> after <tt>position</tt>, and
- <tt>x</tt> becomes empty. Pointers and references to 
- the moved elements of <tt>x</tt> now refer to those same elements but as members of <tt>*this</tt>.
- Iterators referring to the moved elements will continue to refer to their elements,
- but they now behave as iterators into <tt>*this</tt>, not into <tt>x</tt>. 
- </p>
- <p>
- <i>Throws:</i> Nothing. 
- </p>
- <p>
- <i>Complexity:</i> <del><i>&#927;</i>(1)</del> <ins><i>&#927;</i>(<tt>distance(x.begin(), x.end())</tt>)</ins>
- </p>
- </blockquote>
- 
- <p>...</p>
- 
- <pre>void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp;&amp; x, 
-                   const_iterator first, const_iterator last);
- </pre>
- <blockquote>
- <p>
- <i>Requires:</i> <tt>position</tt> is <tt>before_begin()</tt> or a
- dereferenceable iterator in the range <tt>[begin(), end))</tt>.
- <tt>(first,last)</tt> is a valid range in
- <tt>x</tt>, and all iterators in the range
- <tt>(first,last)</tt> are dereferenceable.
- <tt>position</tt> is not an iterator in the range <tt>(first,last)</tt>.
- </p>
- <p>
- <i>Effects:</i> Inserts elements in the range <tt>(first,last)</tt>
- after <tt>position</tt> and removes the elements from <tt>x</tt>.
- Pointers and references to the moved elements of <tt>x</tt> now refer to
- those same elements but as members of <tt>*this</tt>. Iterators
- referring to the moved elements will continue to refer to their
- elements, but they now behave as iterators into <tt>*this</tt>, not into
- <tt>x</tt>.
- </p>
- <p>
- <ins><i>Complexity:</i> <i>&#927;</i>(1).</ins>
- </p>
- </blockquote>
- 
- </blockquote>
- 
- 
  
  
  
  
  <hr>
  <h3><a name="901"></a>901. insert iterators can move from lvalues</h3>
! <p><b>Section:</b> 24.5.2.5 [insert.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 282</b></p>
  
--- 21708,21732 ----
  ]</i></p>
  
  
! <blockquote><p>
   Alan to address in paper.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  </p>
  
  
  
  
  
  <hr>
  <h3><a name="901"></a>901. insert iterators can move from lvalues</h3>
! <p><b>Section:</b> 24.5.2.5 [insert.iterator] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 282</b></p>
  
*************** assignment operator will implicitly move
*** 26827,26833 ****
  <p>
  Suggested resolutions are:
  </p>
! <ol type="a">
  <li>
  Add another overload with a negative constraint on copy-constructible
  and flag it "= delete".
--- 21738,21744 ----
  <p>
  Suggested resolutions are:
  </p>
! <ol style="list-style-type:lower-alpha">
  <li>
  Add another overload with a negative constraint on copy-constructible
  and flag it "= delete".
*************** Suggest resolve as NAD Editorial with a
*** 26864,26873 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree that this has been resolved in the latest Working Draft.
  Move to NAD.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 21775,21784 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree that this has been resolved in the latest Working Draft.
  Move to NAD.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Recommend NAD, addressed by <a href="htt
*** 26881,26890 ****
  
  <hr>
  <h3><a name="902"></a>902. Regular is the wrong concept to constrain numeric_limits</h3>
! <p><b>Section:</b> 18.3.1 [limits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#limits">issues</a> in [limits].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses FR 32 and DE 16</b></p>
--- 21792,21801 ----
  
  <hr>
  <h3><a name="902"></a>902. Regular is the wrong concept to constrain numeric_limits</h3>
! <p><b>Section:</b> 18.3.2 [limits] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#limits">issues</a> in [limits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses FR 32 and DE 16</b></p>
*************** appopriate for this specific API and we
*** 26898,26904 ****
  
  <p>FR 32:</p>
  
! <blockquote>
  The definition of <tt>numeric_limits&lt;&gt;</tt> as requiring a regular
  type is both conceptually wrong and operationally illogical. As we
  pointed before, this mistake needs to be corrected. For example, the
--- 21809,21815 ----
  
  <p>FR 32:</p>
  
! <blockquote><p>
  The definition of <tt>numeric_limits&lt;&gt;</tt> as requiring a regular
  type is both conceptually wrong and operationally illogical. As we
  pointed before, this mistake needs to be corrected. For example, the
*************** template can be left unconstrained. In f
*** 26906,26931 ****
  general problem with concept_maps/axioms and their interpretations. It
  appears that the current text heavily leans toward experimental academic
  type theory.
! </blockquote>
  
  <p>DE 16:</p>
  
! <blockquote>
  The class template <tt>numeric_limits</tt> should not specify the Regular concept
  requirement for its template parameter, because it contains functions
  returning NaN values for floating-point types; these values violate the
  semantics of EqualityComparable.
! </blockquote>
  
  <p><i>[
  Summit:
  ]</i></p>
  
  
! <blockquote>
  Move to Open.  Alisdair and Gaby will work on a solution, along with the new
  treatment of axioms in clause 14.
! </blockquote>
  
  
  
--- 21817,21842 ----
  general problem with concept_maps/axioms and their interpretations. It
  appears that the current text heavily leans toward experimental academic
  type theory.
! </p></blockquote>
  
  <p>DE 16:</p>
  
! <blockquote><p>
  The class template <tt>numeric_limits</tt> should not specify the Regular concept
  requirement for its template parameter, because it contains functions
  returning NaN values for floating-point types; these values violate the
  semantics of EqualityComparable.
! </p></blockquote>
  
  <p><i>[
  Summit:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Open.  Alisdair and Gaby will work on a solution, along with the new
  treatment of axioms in clause 14.
! </p></blockquote>
  
  
  
*************** treatment of axioms in clause 14.
*** 26939,26947 ****
  
  <hr>
  <h3><a name="903"></a>903. <tt>back_insert_iterator</tt> issue</h3>
! <p><b>Section:</b> 24.5.2.1 [back.insert.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2008-09-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I just noticed this; don't know how far the problem(?) extends or
--- 21850,21858 ----
  
  <hr>
  <h3><a name="903"></a>903. <tt>back_insert_iterator</tt> issue</h3>
! <p><b>Section:</b> 24.5.2.1 [back.insert.iterator] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2008-09-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I just noticed this; don't know how far the problem(?) extends or
*************** Move to NAD.
*** 26983,26989 ****
  
  <ol>
  <li>
! If <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a> is accepted, <tt>OutputIterator</tt> does no longer support post increment.
  </li>
  <li>
  To support backward compatibility a second overload of <tt>operator*</tt>
--- 21894,21900 ----
  
  <ol>
  <li>
! If <a href="lwg-closed.html#1009">1009</a> is accepted, <tt>OutputIterator</tt> does no longer support post increment.
  </li>
  <li>
  To support backward compatibility a second overload of <tt>operator*</tt>
*************** to properly reflect the dual nature of b
*** 27005,27015 ****
  
  <hr>
  <h3><a name="905"></a>905. Mutex specification questions</h3>
! <p><b>Section:</b> 30.4.1.2.1 [thread.mutex.class] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2008-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.class">issues</a> in [thread.mutex.class].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a></p>
  <p><b>Discussion:</b></p>
  <p>
  A few questions on the current WP,
--- 21916,21926 ----
  
  <hr>
  <h3><a name="905"></a>905. Mutex specification questions</h3>
! <p><b>Section:</b> 30.4.1.2.1 [thread.mutex.class] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2008-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.class">issues</a> in [thread.mutex.class].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#893">893</a></p>
  <p><b>Discussion:</b></p>
  <p>
  A few questions on the current WP,
*************** A few questions on the current WP,
*** 27017,27023 ****
  </p>
  <p>
  30.4.1 [thread.mutex.requirements]/24 says an expression
! <tt>mut.unlock()</tt> "Throws: Nothing." I'm assuming that, per 17.6.3.11 [res.on.required], errors that violate the precondition "The
  calling thread shall own the mutex" opens the door for throwing an
  exception anyway, such as to report unbalanced unlock operations and
  unlocking from a thread that does not have ownership. Right?
--- 21928,21934 ----
  </p>
  <p>
  30.4.1 [thread.mutex.requirements]/24 says an expression
! <tt>mut.unlock()</tt> "Throws: Nothing." I'm assuming that, per 17.6.4.11 [res.on.required], errors that violate the precondition "The
  calling thread shall own the mutex" opens the door for throwing an
  exception anyway, such as to report unbalanced unlock operations and
  unlocking from a thread that does not have ownership. Right?
*************** fails the program has undefined behaviou
*** 27070,27076 ****
  implementation may throw an exception already.
  </li>
  <li>
! 30.4.1.2.1 [thread.mutex.class]/3 bullet 2: Already addressed by issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>.
  </li>
  <li>
  30.4.1.2.1 [thread.mutex.class]/3 proposed addition: NAD. This is
--- 21981,21987 ----
  implementation may throw an exception already.
  </li>
  <li>
! 30.4.1.2.1 [thread.mutex.class]/3 bullet 2: Already addressed by issue <a href="lwg-defects.html#893">893</a>.
  </li>
  <li>
  30.4.1.2.1 [thread.mutex.class]/3 proposed addition: NAD. This is
*************** Precondition.
*** 27090,27098 ****
  
  <hr>
  <h3><a name="906"></a>906. <tt>ObjectType</tt> is the wrong concept to constrain <tt>initializer_list</tt></h3>
! <p><b>Section:</b> 18.9 [support.initlist] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-09-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The currently proposed constraint on <tt>initializer_list</tt>'s element type
--- 22001,22011 ----
  
  <hr>
  <h3><a name="906"></a>906. <tt>ObjectType</tt> is the wrong concept to constrain <tt>initializer_list</tt></h3>
! <p><b>Section:</b> 18.9 [support.initlist] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-09-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#support.initlist">active issues</a> in [support.initlist].</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.initlist">issues</a> in [support.initlist].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The currently proposed constraint on <tt>initializer_list</tt>'s element type
*************** make clear, that it references an implic
*** 27103,27123 ****
  <p>
  8.5.4 [dcl.init.list]/4:
  </p>
! <blockquote>
  When an initializer list is implicitly converted to a
  <tt>std::initializer_list&lt;E&gt;</tt>, the object passed is constructed as if the
  implementation allocated an array of N elements of type <tt>E</tt>, where
  N is the number of elements in the initializer list.[..]
! </blockquote>
  
  <p>
  18.9 [support.initlist]/2.
  </p>
  
! <blockquote>
  An object of type <tt>initializer_list&lt;E&gt;</tt> provides access to an array of
  objects of type <tt>const E</tt>.[..]
! </blockquote>
  
  <p>
  Therefore, <tt>E</tt> needs to fulfill concept <tt>ValueType</tt> (thus excluding
--- 22016,22036 ----
  <p>
  8.5.4 [dcl.init.list]/4:
  </p>
! <blockquote><p>
  When an initializer list is implicitly converted to a
  <tt>std::initializer_list&lt;E&gt;</tt>, the object passed is constructed as if the
  implementation allocated an array of N elements of type <tt>E</tt>, where
  N is the number of elements in the initializer list.[..]
! </p></blockquote>
  
  <p>
  18.9 [support.initlist]/2.
  </p>
  
! <blockquote><p>
  An object of type <tt>initializer_list&lt;E&gt;</tt> provides access to an array of
  objects of type <tt>const E</tt>.[..]
! </p></blockquote>
  
  <p>
  Therefore, <tt>E</tt> needs to fulfill concept <tt>ValueType</tt> (thus excluding
*************** to prevent deep instantiation errors kno
*** 27126,27132 ****
  as shown in the following example:
  </p>
  
! <blockquote><pre>// Header A: (Should concept-check even in stand-alone modus)
  
  template &lt;DefaultConstructible T&gt;
  requires MoveConstructible&lt;T&gt;
--- 22039,22046 ----
  as shown in the following example:
  </p>
  
! <blockquote><pre>
! // Header A: (Should concept-check even in stand-alone modus)
  
  template &lt;DefaultConstructible T&gt;
  requires MoveConstructible&lt;T&gt;
*************** class template) provides a constructor t
*** 27180,27186 ****
  only <em>this</em> constructor would need to be restricted on <tt>ValueType</tt>:
  </p>
  
! <blockquote><pre>template&lt;ObjectType T&gt;
  class ExtContainer {
  public:
    requires ValueType&lt;T&gt;
--- 22094,22101 ----
  only <em>this</em> constructor would need to be restricted on <tt>ValueType</tt>:
  </p>
  
! <blockquote><pre>
! template&lt;ObjectType T&gt;
  class ExtContainer {
  public:
    requires ValueType&lt;T&gt;
*************** public:
*** 27193,27210 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Need to look at again without concepts.
! </blockquote>
  
  
  
--- 22108,22125 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Need to look at again without concepts.
! </p></blockquote>
  
  
  
*************** constraint "<tt>ValueType</tt>".
*** 27223,27321 ****
  
  
  <hr>
- <h3><a name="908"></a>908. Deleted assignment operators for atomic types must be volatile</h3>
- <p><b>Section:</b> X [atomics.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2008-09-26 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types">issues</a> in [atomics.types].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses US 90</b></p>
- 
- <p>
- The deleted copy-assignment operators for the atomic types are not
- marked as volatile in N2723, whereas the assignment operators from the
- associated non-atomic types are. e.g.
- </p>
- <blockquote><pre>atomic_bool&amp; operator=(atomic_bool const&amp;) = delete;
- atomic_bool&amp; operator=(bool) volatile;
- </pre></blockquote>
- 
- <p>
- This leads to ambiguity when assigning a non-atomic value to a
- non-volatile instance of an atomic type:
- </p>
- <blockquote><pre>atomic_bool b;
- b=false;
- </pre></blockquote>
- 
- <p>
- Both assignment operators require a standard conversions: the
- copy-assignment operator can use the implicit <tt>atomic_bool(bool)</tt>
- conversion constructor to convert <tt>false</tt> to an instance of
- <tt>atomic_bool</tt>, or <tt>b</tt> can undergo a qualification conversion in order to
- use the assignment from a plain <tt>bool</tt>.
- </p>
- 
- <p>
- This is only a problem once issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#845">845</a> is applied.
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- <blockquote>
- Move to open. Assign to Lawrence. Related to US 90 comment.
- </blockquote>
- 
- <p><i>[
- 2009-08-17 Handled by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2925.html">N2925</a>.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Add volatile qualification to the deleted copy-assignment operator of
- all the atomic types:
- </p>
- 
- <blockquote><pre>atomic_bool&amp; operator=(atomic_bool const&amp;) <ins>volatile</ins> = delete;
- atomic_itype&amp; operator=(atomic_itype const&amp;) <ins>volatile</ins> = delete;
- </pre></blockquote>
- 
- <p>
- etc.
- </p>
- <p>
- This will mean that the deleted copy-assignment operator will require
- <i>two</i> conversions in the above example, and thus be a worse match than
- the assignment from plain <tt>bool</tt>.
- </p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="910"></a>910. Effects of MoveAssignable</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 150</b></p>
  
--- 22138,22148 ----
  
  
  <hr>
  <h3><a name="910"></a>910. Effects of MoveAssignable</h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 150</b></p>
  
*************** The description of the effect of <tt>ope
*** 27324,27348 ****
  concept, given in paragraph 7 is:
  </p>
  
! <blockquote><pre>result_type  T::operator=(T&amp;&amp;  rv);  // inherited from HasAssign&lt;T, T&amp;&amp;&gt;
  </pre>
  
! <blockquote>
  <i>Postconditions:</i> the constructed <tt>T</tt> object is equivalent to the value of
  <tt>rv</tt> before the assignment. [<i>Note:</i> there is no
  requirement on the value of <tt>rv</tt> after the assignment.  <i>--end note</i>]
! </blockquote>
  </blockquote>
  
  <p>
  The sentence contains a typo (what is the "constructed <tt>T</tt> object"?)
  probably due to a cut&amp;paste from <tt>MoveConstructible</tt>. Moreover, the
! discussion of LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a> shows that the postcondition is too generic
  and might not reflect the user expectations. An implementation of the
  move assignment that just calls <tt>swap()</tt> would always fulfill the
  postcondition as stated, but might have surprising side-effects in case
  the source rvalue refers to an object that is not going to be
! immediately destroyed. See LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a> for another example. Due to
  the sometimes intangible nature of the "user expectation", it seems
  difficult to have precise normative wording that could cover all cases
  without introducing unnecessary restrictions. However a non-normative
--- 22151,22176 ----
  concept, given in paragraph 7 is:
  </p>
  
! <blockquote><pre>
! result_type  T::operator=(T&amp;&amp;  rv);  // inherited from HasAssign&lt;T, T&amp;&amp;&gt;
  </pre>
  
! <blockquote><p>
  <i>Postconditions:</i> the constructed <tt>T</tt> object is equivalent to the value of
  <tt>rv</tt> before the assignment. [<i>Note:</i> there is no
  requirement on the value of <tt>rv</tt> after the assignment.  <i>--end note</i>]
! </p></blockquote>
  </blockquote>
  
  <p>
  The sentence contains a typo (what is the "constructed <tt>T</tt> object"?)
  probably due to a cut&amp;paste from <tt>MoveConstructible</tt>. Moreover, the
! discussion of LWG issue <a href="lwg-defects.html#675">675</a> shows that the postcondition is too generic
  and might not reflect the user expectations. An implementation of the
  move assignment that just calls <tt>swap()</tt> would always fulfill the
  postcondition as stated, but might have surprising side-effects in case
  the source rvalue refers to an object that is not going to be
! immediately destroyed. See LWG issue <a href="lwg-defects.html#900">900</a> for another example. Due to
  the sometimes intangible nature of the "user expectation", it seems
  difficult to have precise normative wording that could cover all cases
  without introducing unnecessary restrictions. However a non-normative
*************** the values have been moved from.
*** 27394,27400 ****
  <p>
  Here is user-written code which must be allowed to be legal:
  </p>
! <blockquote><pre>#include &lt;vector&gt;
  #include &lt;cstdio&gt;
  
  template &lt;class Allocator&gt;
--- 22222,22229 ----
  <p>
  Here is user-written code which must be allowed to be legal:
  </p>
! <blockquote><pre>
! #include &lt;vector&gt;
  #include &lt;cstdio&gt;
  
  template &lt;class Allocator&gt;
*************** I believe the current proposed wording i
*** 27429,27466 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree that the proposed resolution
  is an improvement over the current wording.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Need to look at again without concepts.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Walter will consult with Dave and Doug.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! We believe this is handled by the resolution to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>,
  but there is to much going on in this area to be sure.  Defer for now.
! </blockquote>
  
  <p><i>[
  2010-01-23 Moved to Tentatively NAD Concepts after 5 positive votes on c++std-lib.
--- 22258,22295 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree that the proposed resolution
  is an improvement over the current wording.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Need to look at again without concepts.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Walter will consult with Dave and Doug.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! We believe this is handled by the resolution to issue <a href="lwg-defects.html#1204">1204</a>,
  but there is to much going on in this area to be sure.  Defer for now.
! </p></blockquote>
  
  <p><i>[
  2010-01-23 Moved to Tentatively NAD Concepts after 5 positive votes on c++std-lib.
*************** assignment.
*** 27482,27495 ****
  In  [concept.copymove], replace the postcondition in paragraph 7 with:
  </p>
  
! <blockquote>
  <i>Postconditions:</i> <tt>*this</tt> is equivalent to the value of <tt>rv</tt> before the
  assignment. [<i>Note:</i> there is no requirement on the value of <tt>rv</tt> after the
  assignment, but the
  effect should be unsurprising to the user even in case <tt>rv</tt> is not
  immediately destroyed. This may require that resources previously owned
  by <tt>*this</tt> are released instead of transferred to <tt>rv</tt>. <i>-- end note</i>]
! </blockquote>
  
  
  
--- 22311,22324 ----
  In  [concept.copymove], replace the postcondition in paragraph 7 with:
  </p>
  
! <blockquote><p>
  <i>Postconditions:</i> <tt>*this</tt> is equivalent to the value of <tt>rv</tt> before the
  assignment. [<i>Note:</i> there is no requirement on the value of <tt>rv</tt> after the
  assignment, but the
  effect should be unsurprising to the user even in case <tt>rv</tt> is not
  immediately destroyed. This may require that resources previously owned
  by <tt>*this</tt> are released instead of transferred to <tt>rv</tt>. <i>-- end note</i>]
! </p></blockquote>
  
  
  
*************** by <tt>*this</tt> are released instead o
*** 27497,27509 ****
  
  <hr>
  <h3><a name="912"></a>912. Array swap needs to be conceptualized</h3>
! <p><b>Section:</b> 25.3.3 [alg.swap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-10-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.swap">issues</a> in [alg.swap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! With the adaption of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>
  we have a new algorithm <tt>swap</tt> for C-arrays, which needs to be conceptualized.
  </p>
  
--- 22326,22338 ----
  
  <hr>
  <h3><a name="912"></a>912. Array swap needs to be conceptualized</h3>
! <p><b>Section:</b> 25.3.3 [alg.swap] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-10-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.swap">issues</a> in [alg.swap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! With the adaption of <a href="lwg-defects.html#809">809</a>
  we have a new algorithm <tt>swap</tt> for C-arrays, which needs to be conceptualized.
  </p>
  
*************** Post Summit Daniel adds:
*** 27512,27529 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend as NAD Editorial: The changes have already been applied to the WP
! <a href="" ref="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2800.pdf">N2800</a>.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to NAD; the changes have already been made.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 22341,22358 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend as NAD Editorial: The changes have already been applied to the WP
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2800.pdf">N2800</a>.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to NAD; the changes have already been made.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to NAD; the changes have already be
*** 27531,27537 ****
  Replace in 25.3.3 [alg.swap] before p. 3 until p. 4 by
  </p>
  
! <blockquote><pre>template &lt;<del>class</del> <ins>ValueType</ins> T, size_t N&gt;
  <ins>requires Swappable&lt;T&gt;</ins>
  void swap(T (&amp;a)[N], T (&amp;b)[N]);
  </pre>
--- 22360,22367 ----
  Replace in 25.3.3 [alg.swap] before p. 3 until p. 4 by
  </p>
  
! <blockquote><pre>
! template &lt;<del>class</del> <ins>ValueType</ins> T, size_t N&gt;
  <ins>requires Swappable&lt;T&gt;</ins>
  void swap(T (&amp;a)[N], T (&amp;b)[N]);
  </pre>
*************** void swap(T (&amp;a)[N], T (&amp;b)[N]);
*** 27552,27578 ****
  
  <hr>
  <h3><a name="913"></a>913. Superfluous requirements for replace algorithms</h3>
! <p><b>Section:</b> 25.3.5 [alg.replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-10-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.replace">issues</a> in [alg.replace].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  (A) 25.3.5 [alg.replace]/1:
  </p>
  
! <blockquote>
  <i>Requires:</i> The expression <tt>*first = new_value</tt> shall be valid.
! </blockquote>
  
  <p>
  (B) 25.3.5 [alg.replace]/4:
  </p>
  
! <blockquote>
  <i>Requires:</i> The results of the expressions <tt>*first</tt> and <tt>new_value</tt> shall
  be writable to the result output iterator.[..]
! </blockquote>
  
  <p>
  Since conceptualization, the quoted content of these clauses is covered
--- 22382,22408 ----
  
  <hr>
  <h3><a name="913"></a>913. Superfluous requirements for replace algorithms</h3>
! <p><b>Section:</b> 25.3.5 [alg.replace] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-10-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.replace">issues</a> in [alg.replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  (A) 25.3.5 [alg.replace]/1:
  </p>
  
! <blockquote><p>
  <i>Requires:</i> The expression <tt>*first = new_value</tt> shall be valid.
! </p></blockquote>
  
  <p>
  (B) 25.3.5 [alg.replace]/4:
  </p>
  
! <blockquote><p>
  <i>Requires:</i> The results of the expressions <tt>*first</tt> and <tt>new_value</tt> shall
  be writable to the result output iterator.[..]
! </p></blockquote>
  
  <p>
  Since conceptualization, the quoted content of these clauses is covered
*************** Move to Tentatively Ready.
*** 27610,27621 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <ol type="A">
  <li>
  <p>
  Remove 25.3.5 [alg.replace]/1.
  </p>
! <blockquote><pre>template&lt;ForwardIterator Iter, class T&gt; 
    requires OutputIterator&lt;Iter, Iter::reference&gt; 
          &amp;&amp; OutputIterator&lt;Iter, const T&amp;&gt; 
          &amp;&amp; HasEqualTo&lt;Iter::value_type, T&gt; 
--- 22440,22452 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <ol style="list-style-type:upper-alpha">
  <li>
  <p>
  Remove 25.3.5 [alg.replace]/1.
  </p>
! <blockquote><pre>
! template&lt;ForwardIterator Iter, class T&gt; 
    requires OutputIterator&lt;Iter, Iter::reference&gt; 
          &amp;&amp; OutputIterator&lt;Iter, const T&amp;&gt; 
          &amp;&amp; HasEqualTo&lt;Iter::value_type, T&gt; 
*************** template&lt;ForwardIterator Iter, Predic
*** 27629,27637 ****
    void replace_if(Iter first, Iter last, 
                    Pred pred, const T&amp; new_value);
  </pre>
! <blockquote>
  <del>1 <i>Requires:</i> The expression <tt>*first = new_value</tt> shall be valid.</del>
! </blockquote>
  </blockquote>
  </li>
  <li>
--- 22460,22468 ----
    void replace_if(Iter first, Iter last, 
                    Pred pred, const T&amp; new_value);
  </pre>
! <blockquote><p>
  <del>1 <i>Requires:</i> The expression <tt>*first = new_value</tt> shall be valid.</del>
! </p></blockquote>
  </blockquote>
  </li>
  <li>
*************** template&lt;ForwardIterator Iter, Predic
*** 27640,27646 ****
  expressions <tt>*first</tt> and
  <tt>new_value</tt> shall be writable to the result output iterator.".
  </p>
! <blockquote><pre>template&lt;InputIterator InIter, typename OutIter, class T&gt; 
    requires OutputIterator&lt;OutIter, InIter::reference&gt; 
          &amp;&amp; OutputIterator&lt;OutIter, const T&amp;&gt; 
          &amp;&amp; HasEqualTo&lt;InIter::value_type, T&gt; 
--- 22471,22478 ----
  expressions <tt>*first</tt> and
  <tt>new_value</tt> shall be writable to the result output iterator.".
  </p>
! <blockquote><pre>
! template&lt;InputIterator InIter, typename OutIter, class T&gt; 
    requires OutputIterator&lt;OutIter, InIter::reference&gt; 
          &amp;&amp; OutputIterator&lt;OutIter, const T&amp;&gt; 
          &amp;&amp; HasEqualTo&lt;InIter::value_type, T&gt; 
*************** template&lt;InputIterator InIter, typena
*** 27657,27668 ****
                            OutIter result, 
                            Pred pred, const T&amp; new_value);
  </pre>
! <blockquote>
  4 <i>Requires:</i> <del>The results of the expressions <tt>*first</tt> and
  <tt>new_value</tt> shall be writable to the <tt>result</tt> output
  iterator.</del> The ranges <tt>[first,last)</tt> and <tt>[result,result +
  (last - first))</tt> shall not overlap.
! </blockquote>
  </blockquote>
  </li>
  </ol>
--- 22489,22500 ----
                            OutIter result, 
                            Pred pred, const T&amp; new_value);
  </pre>
! <blockquote><p>
  4 <i>Requires:</i> <del>The results of the expressions <tt>*first</tt> and
  <tt>new_value</tt> shall be writable to the <tt>result</tt> output
  iterator.</del> The ranges <tt>[first,last)</tt> and <tt>[result,result +
  (last - first))</tt> shall not overlap.
! </p></blockquote>
  </blockquote>
  </li>
  </ol>
*************** iterator.</del> The ranges <tt>[first,la
*** 27673,27682 ****
  
  <hr>
  <h3><a name="914"></a>914. Superfluous requirement for unique</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-10-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  25.3.9 [alg.unique]/2: "Requires: The comparison function shall be an
--- 22505,22514 ----
  
  <hr>
  <h3><a name="914"></a>914. Superfluous requirement for unique</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-10-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  25.3.9 [alg.unique]/2: "Requires: The comparison function shall be an
*************** equivalence relation."
*** 27687,27693 ****
  The essence of this is already covered by the given requirement
  </p>
  
! <blockquote><pre>EquivalenceRelation&lt;auto, Iter::value_type&gt; Pred
  </pre></blockquote>
  
  <p>
--- 22519,22526 ----
  The essence of this is already covered by the given requirement
  </p>
  
! <blockquote><pre>
! EquivalenceRelation&lt;auto, Iter::value_type&gt; Pred
  </pre></blockquote>
  
  <p>
*************** and should thus be removed.
*** 27698,27707 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 22531,22540 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Tentatively Ready.
*** 27709,27715 ****
  Remove 25.3.9 [alg.unique]/2
  </p>
  
! <blockquote><pre>template&lt;ForwardIterator Iter&gt;
    requires OutputIterator&lt;Iter, Iter::reference&gt;
          &amp;&amp; EqualityComparable&lt;Iter::value_type&gt;
    Iter unique(Iter first, Iter last);
--- 22542,22549 ----
  Remove 25.3.9 [alg.unique]/2
  </p>
  
! <blockquote><pre>
! template&lt;ForwardIterator Iter&gt;
    requires OutputIterator&lt;Iter, Iter::reference&gt;
          &amp;&amp; EqualityComparable&lt;Iter::value_type&gt;
    Iter unique(Iter first, Iter last);
*************** template&lt;ForwardIterator Iter, Equiva
*** 27737,27746 ****
  <hr>
  <h3><a name="915"></a>915. <tt>minmax</tt> with <tt>initializer_list</tt> should return
  <tt>pair</tt> of <tt>T</tt>, not <tt>pair</tt> of <tt>const T&amp;</tt></h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-10-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It seems that the proposed changes for
--- 22571,22580 ----
  <hr>
  <h3><a name="915"></a>915. <tt>minmax</tt> with <tt>initializer_list</tt> should return
  <tt>pair</tt> of <tt>T</tt>, not <tt>pair</tt> of <tt>const T&amp;</tt></h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-10-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It seems that the proposed changes for
*************** were not clear enough in
*** 27749,27755 ****
  this point:
  </p>
  
! <blockquote>
  25.4.7 [alg.min.max], before p.23 + p.24 + before p. 27 + p. 28 say that the return
  type of the <tt>minmax</tt> overloads with an <tt>initializer_list</tt> is
  <tt>pair&lt;const T&amp;, const T&amp;&gt;</tt>,
--- 22583,22589 ----
  this point:
  </p>
  
! <blockquote><p>
  25.4.7 [alg.min.max], before p.23 + p.24 + before p. 27 + p. 28 say that the return
  type of the <tt>minmax</tt> overloads with an <tt>initializer_list</tt> is
  <tt>pair&lt;const T&amp;, const T&amp;&gt;</tt>,
*************** which is inconsistent with the decision
*** 27757,27805 ****
  a <tt>initializer_list</tt> as argument and return a <tt>T</tt>, not a <tt>const T&amp;</tt>.
  Doing otherwise for <tt>minmax</tt> would easily lead to unexpected life-time
  problems by using <tt>minmax</tt> instead of <tt>min</tt> and <tt>max</tt> separately.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Moved from Tentatively Ready to Open only because the wording needs to be
  tweaked for concepts removal.
! </blockquote>
  
  <p><i>[
  2009-08-18 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Recommend NAD since the proposed changes have already been performed
  as part of editorial work of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! Can't find initializer_list form of minmax anymore, only variadic
  version. Seems like we had an editing clash with concepts. Leave Open,
! at least until editorial issues resolved. Bring this to Editor's
! attention.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Pete to reapply
--- 22591,22638 ----
  a <tt>initializer_list</tt> as argument and return a <tt>T</tt>, not a <tt>const T&amp;</tt>.
  Doing otherwise for <tt>minmax</tt> would easily lead to unexpected life-time
  problems by using <tt>minmax</tt> instead of <tt>min</tt> and <tt>max</tt> separately.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Tentatively Ready to Open only because the wording needs to be
  tweaked for concepts removal.
! </p></blockquote>
  
  <p><i>[
  2009-08-18 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Recommend NAD since the proposed changes have already been performed
  as part of editorial work of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! Can't find <tt>initializer_list</tt> form of <tt>minmax</tt> anymore, only variadic
  version. Seems like we had an editing clash with concepts. Leave Open,
! at least until editorial issues resolved. Bring this to Editor's attention.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Pete to reapply
*************** attention.
*** 27809,27818 ****
  
  
  
! <p><b>Rationale:</b></p>
  Solved by reapplying
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2772.pdf">N2772</a>.
! 
  
  <p><b>Proposed resolution:</b></p>
  <ol>
--- 22642,22651 ----
  
  
  
! <p><b>Rationale:</b></p><p>
  Solved by reapplying
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2772.pdf">N2772</a>.
! </p>
  
  <p><b>Proposed resolution:</b></p>
  <ol>
*************** Solved by reapplying
*** 27821,27827 ****
  In 25 [algorithms]/2, header <tt>&lt;algorithm&gt;</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>template&lt;<del>class</del><ins>LessThanComparable</ins> T&gt;
  <ins>requires CopyConstructible&lt;T&gt;</ins>
  pair&lt;<del>const </del>T<del>&amp;</del>, <del>const </del>T<del>&amp;</del>&gt;
  minmax(initializer_list&lt;T&gt; t);
--- 22654,22661 ----
  In 25 [algorithms]/2, header <tt>&lt;algorithm&gt;</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;<del>class</del><ins>LessThanComparable</ins> T&gt;
  <ins>requires CopyConstructible&lt;T&gt;</ins>
  pair&lt;<del>const </del>T<del>&amp;</del>, <del>const </del>T<del>&amp;</del>&gt;
  minmax(initializer_list&lt;T&gt; t);
*************** minmax(initializer_list&lt;T&gt; t, Comp
*** 27836,27842 ****
  <p>
  In 25.4.7 [alg.min.max] change as indicated (Begin: Just before p.20):
  </p>
! <blockquote><pre>template&lt;<del>class</del><ins>LessThanComparable</ins> T&gt;
    <ins>requires CopyConstructible&lt;T&gt;</ins>
    pair&lt;<del>const </del>T<del>&amp;</del>, <del>const </del>T<del>&amp;</del>&gt;
    minmax(initializer_list&lt;T&gt; t);
--- 22670,22677 ----
  <p>
  In 25.4.7 [alg.min.max] change as indicated (Begin: Just before p.20):
  </p>
! <blockquote><pre>
! template&lt;<del>class</del><ins>LessThanComparable</ins> T&gt;
    <ins>requires CopyConstructible&lt;T&gt;</ins>
    pair&lt;<del>const </del>T<del>&amp;</del>, <del>const </del>T<del>&amp;</del>&gt;
    minmax(initializer_list&lt;T&gt; t);
*************** smallest value and <tt>y</tt> the larges
*** 27854,27860 ****
  </blockquote>
  
  <p>[..]</p>
! <pre>template&lt;class T, <del>class</del><ins>StrictWeakOrder&lt;auto, T&gt;</ins> Compare&gt;
    <ins>requires CopyConstructible&lt;T&gt;</ins>
    pair&lt;<del>const </del>T<del>&amp;</del>, <del>const </del>T<del>&amp;</del>&gt;
    minmax(initializer_list&lt;T&gt; t, Compare comp);
--- 22689,22696 ----
  </blockquote>
  
  <p>[..]</p>
! <pre>
! template&lt;class T, <del>class</del><ins>StrictWeakOrder&lt;auto, T&gt;</ins> Compare&gt;
    <ins>requires CopyConstructible&lt;T&gt;</ins>
    pair&lt;<del>const </del>T<del>&amp;</del>, <del>const </del>T<del>&amp;</del>&gt;
    minmax(initializer_list&lt;T&gt; t, Compare comp);
*************** smallest value and <tt>y</tt> largest va
*** 27881,27911 ****
  
  <hr>
  <h3><a name="916"></a>916. Redundant move-assignment operator of <tt>pair</tt> should be removed</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-10-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>see also <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>.</b></p>
  
  <p>
  The current WP provides the following assignment operators for <tt>pair</tt>
! in 20.3.5 [pairs]/1:
  </p>
  
  <ol>
  <li>
! <pre>template&lt;class U , class V&gt;
  requires HasAssign&lt;T1, const U&amp;&gt; &amp;&amp; HasAssign&lt;T2, const V&amp;&gt;
  pair&amp; operator=(const pair&lt;U , V&gt;&amp; p);
  </pre>
  </li>
  <li>
! <pre>requires MoveAssignable&lt;T1&gt; &amp;&amp; MoveAssignable&lt;T2&gt; pair&amp; operator=(pair&amp;&amp; p );
  </pre>
  </li>
  <li>
! <pre>template&lt;class U , class V&gt;
  requires HasAssign&lt;T1, RvalueOf&lt;U&gt;::type&gt; &amp;&amp; HasAssign&lt;T2, RvalueOf&lt;V&gt;::type&gt;
  pair&amp; operator=(pair&lt;U , V&gt;&amp;&amp; p);
  </pre>
--- 22717,22750 ----
  
  <hr>
  <h3><a name="916"></a>916. Redundant move-assignment operator of <tt>pair</tt> should be removed</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-10-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>see also <a href="lwg-closed.html#917">917</a>.</b></p>
  
  <p>
  The current WP provides the following assignment operators for <tt>pair</tt>
! in 20.3 [pairs]/1:
  </p>
  
  <ol>
  <li>
! <pre>
! template&lt;class U , class V&gt;
  requires HasAssign&lt;T1, const U&amp;&gt; &amp;&amp; HasAssign&lt;T2, const V&amp;&gt;
  pair&amp; operator=(const pair&lt;U , V&gt;&amp; p);
  </pre>
  </li>
  <li>
! <pre>
! requires MoveAssignable&lt;T1&gt; &amp;&amp; MoveAssignable&lt;T2&gt; pair&amp; operator=(pair&amp;&amp; p );
  </pre>
  </li>
  <li>
! <pre>
! template&lt;class U , class V&gt;
  requires HasAssign&lt;T1, RvalueOf&lt;U&gt;::type&gt; &amp;&amp; HasAssign&lt;T2, RvalueOf&lt;V&gt;::type&gt;
  pair&amp; operator=(pair&lt;U , V&gt;&amp;&amp; p);
  </pre>
*************** related to the pair templates.
*** 27938,27966 ****
  ]</i></p>
  
  
! <blockquote>
  Leave this open pending the removal of concepts from the WD.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! Mark as NAD, see issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#801">801</a>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol type="A">
  <li>
  <p>
! In 20.3.5 [pairs] p. 1, class <tt>pair</tt> and just before p. 13 remove the declaration:
  </p>
  
! <blockquote><pre>requires MoveAssignable&lt;T1&gt; &amp;&amp; MoveAssignable&lt;T2&gt; pair&amp; operator=(pair&amp;&amp; p );
  </pre></blockquote>
  </li>
  
--- 22777,22806 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave this open pending the removal of concepts from the WD.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! Mark as NAD, see issue <a href="lwg-defects.html#801">801</a>.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol style="list-style-type:upper-alpha">
  <li>
  <p>
! In 20.3 [pairs] p. 1, class <tt>pair</tt> and just before p. 13 remove the declaration:
  </p>
  
! <blockquote><pre>
! requires MoveAssignable&lt;T1&gt; &amp;&amp; MoveAssignable&lt;T2&gt; pair&amp; operator=(pair&amp;&amp; p );
  </pre></blockquote>
  </li>
  
*************** Remove p.13+p.14
*** 27976,27987 ****
  
  <hr>
  <h3><a name="917"></a>917. Redundant move-assignment operator of <tt>tuple</tt> should be removed</h3>
! <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-10-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>see also <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>.</b></p>
  <p>
  N2770 (and thus now the WP) removed the
  non-template move-assignment operator from tuple's class definition,
--- 22816,22828 ----
  
  <hr>
  <h3><a name="917"></a>917. Redundant move-assignment operator of <tt>tuple</tt> should be removed</h3>
! <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-10-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#tuple.cnstr">active issues</a> in [tuple.cnstr].</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>see also <a href="lwg-closed.html#916">916</a>.</b></p>
  <p>
  N2770 (and thus now the WP) removed the
  non-template move-assignment operator from tuple's class definition,
*************** Move to Open.
*** 28023,28040 ****
  ]</i></p>
  
  
! <blockquote>
  Leave this open pending the removal of concepts from the WD.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! Mark as NAD, see issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#801">801</a>.
! </blockquote>
  
  
  
--- 22864,22881 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave this open pending the removal of concepts from the WD.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! Mark as NAD, see issue <a href="lwg-defects.html#801">801</a>.
! </p></blockquote>
  
  
  
*************** change as indicated:
*** 28049,28055 ****
  This fixes an editorial loss between N2798 to N2800
  ]</i></p>
  
! <blockquote><pre>template &lt;class... UTypes&gt;
  requires HasAssign&lt;Types, const UTypes&amp;&gt;...
  <ins>tuple&amp; operator=(const pair&lt;UTypes...&gt;&amp;);</ins>
  
--- 22890,22897 ----
  This fixes an editorial loss between N2798 to N2800
  ]</i></p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt;
  requires HasAssign&lt;Types, const UTypes&amp;&gt;...
  <ins>tuple&amp; operator=(const pair&lt;UTypes...&gt;&amp;);</ins>
  
*************** In 20.4.2.1 [tuple.cnstr], starting just
*** 28064,28070 ****
  as indicated:
  </p>
  
! <blockquote><pre><del>requires MoveAssignable&lt;Types&gt;... tuple&amp; operator=(tuple&amp;&amp; u);</del>
  </pre>
  <blockquote>
  <p>
--- 22906,22913 ----
  as indicated:
  </p>
  
! <blockquote><pre>
! <del>requires MoveAssignable&lt;Types&gt;... tuple&amp; operator=(tuple&amp;&amp; u);</del>
  </pre>
  <blockquote>
  <p>
*************** element of <tt>*this</tt>.</del>
*** 28085,28096 ****
  
  <hr>
  <h3><a name="918"></a>918. Swap for tuple needs to be conceptualized</h3>
! <p><b>Section:</b> 20.4.2.3 [tuple.swap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-10-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a> was accepted after <tt>tuple</tt> had been conceptualized,
  therefore this step needs to be completed.
  </p>
  
--- 22928,22939 ----
  
  <hr>
  <h3><a name="918"></a>918. Swap for tuple needs to be conceptualized</h3>
! <p><b>Section:</b> 20.4.2.3 [tuple.swap] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-10-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="lwg-defects.html#522">522</a> was accepted after <tt>tuple</tt> had been conceptualized,
  therefore this step needs to be completed.
  </p>
  
*************** Post Summit Daniel adds
*** 28099,28122 ****
  ]</i></p>
  
  
! <blockquote>
  This is now NAD Editorial (addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2844.html">N2844</a>)
  except for item 3 in the proposed wording.
! </blockquote>
  
  <p><i>[
  2009-05-01 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  As of the recent WP
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2857.pdf">N2857</a>),
! this issue is now completely covered by editorial
! changes (including the third bullet), therefore I unconditionally recommend
! NAD.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
--- 22942,22964 ----
  ]</i></p>
  
  
! <blockquote><p>
  This is now NAD Editorial (addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2844.html">N2844</a>)
  except for item 3 in the proposed wording.
! </p></blockquote>
  
  <p><i>[
  2009-05-01 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  As of the recent WP
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2857.pdf">N2857</a>),
! this issue is now completely covered by editorial changes (including the third bullet), 
! therefore I unconditionally recommend NAD.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
*************** Move to NAD.
*** 28141,28147 ****
  In both 20.4.1 [tuple.general]/2 and 20.4.2.9 [tuple.special] change
  </p>
  
! <blockquote><pre>template &lt;<del>class</del> <ins>Swappable</ins>... Types&gt;
  void swap(tuple&lt;Types...&gt;&amp; x, tuple&lt;Types...&gt;&amp; y);
  </pre></blockquote>
  
--- 22983,22990 ----
  In both 20.4.1 [tuple.general]/2 and 20.4.2.9 [tuple.special] change
  </p>
  
! <blockquote><pre>
! template &lt;<del>class</del> <ins>Swappable</ins>... Types&gt;
  void swap(tuple&lt;Types...&gt;&amp; x, tuple&lt;Types...&gt;&amp; y);
  </pre></blockquote>
  
*************** In 20.4.2 [tuple.tuple], class <tt>tuple
*** 28153,28159 ****
  20.4.2.3 [tuple.swap], change
  </p>
  
! <blockquote><pre><ins>requires Swappable&lt;Types&gt;...</ins>void swap(tuple&amp;);
  </pre></blockquote>
  
  </li>
--- 22996,23003 ----
  20.4.2.3 [tuple.swap], change
  </p>
  
! <blockquote><pre>
! <ins>requires Swappable&lt;Types&gt;...</ins>void swap(tuple&amp;);
  </pre></blockquote>
  
  </li>
*************** In 20.4.2 [tuple.tuple], class <tt>tuple
*** 28163,28171 ****
  In 20.4.2.3 [tuple.swap] remove the current requires-clause, which says:
  </p>
  
! <blockquote>
  <del><i>Requires:</i> Each type in <tt>Types</tt> shall be <tt>Swappable</tt></del>
! </blockquote>
  </li>
  
  </ol>
--- 23007,23015 ----
  In 20.4.2.3 [tuple.swap] remove the current requires-clause, which says:
  </p>
  
! <blockquote><p>
  <del><i>Requires:</i> Each type in <tt>Types</tt> shall be <tt>Swappable</tt></del>
! </p></blockquote>
  </li>
  
  </ol>
*************** In 20.4.2.3 [tuple.swap] remove the curr
*** 28177,28193 ****
  
  <hr>
  <h3><a name="919"></a>919. (forward_)list specialized remove algorithms are over constrained</h3>
! <p><b>Section:</b> 23.3.3.5 [forwardlist.ops], 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-10-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The signatures of <tt>forwardlist::remove</tt> and <tt>list::remove</tt>
! defined in 23.3.3.5 [forwardlist.ops] before 11 + 23.3.4.4 [list.ops] before 15:
  </p>
  
! <blockquote><pre>requires EqualityComparable&lt;T&gt; void remove(const T&amp; value);
  </pre></blockquote>
  
  <p>
--- 23021,23038 ----
  
  <hr>
  <h3><a name="919"></a>919. (forward_)list specialized remove algorithms are over constrained</h3>
! <p><b>Section:</b> 23.3.4.6 [forwardlist.ops], 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-10-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The signatures of <tt>forwardlist::remove</tt> and <tt>list::remove</tt>
! defined in 23.3.4.6 [forwardlist.ops] before 11 + 23.3.5.5 [list.ops] before 15:
  </p>
  
! <blockquote><pre>
! requires EqualityComparable&lt;T&gt; void remove(const T&amp; value);
  </pre></blockquote>
  
  <p>
*************** Move to Review.
*** 28219,28237 ****
  ]</i></p>
  
  
! <blockquote>
  Current rationale and wording for this issue is built around concepts. I
  suggest the issue reverts to Open status. I believe there is enough of
  an issue to review after concepts are removed from the WP to re-examine
  the issue in Santa Cruz, rather than resolve as NAD Concepts.
! </blockquote>
  
  <p><i>[
  2009-10-10 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Recommend NAD: The concept-free wording as of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>
  has no longer the
--- 23064,23082 ----
  ]</i></p>
  
  
! <blockquote><p>
  Current rationale and wording for this issue is built around concepts. I
  suggest the issue reverts to Open status. I believe there is enough of
  an issue to review after concepts are removed from the WP to re-examine
  the issue in Santa Cruz, rather than resolve as NAD Concepts.
! </p></blockquote>
  
  <p><i>[
  2009-10-10 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Recommend NAD: The concept-free wording as of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>
  has no longer the
*************** over-specified requirement
*** 28240,28472 ****
  the same test conditions exists
  as for the free algorithm <tt>remove</tt> (25.3.8 [alg.remove]). The error was
  introduced in the process of conceptifying.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  NAD, solved by the removal of concepts.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol type="A">
! <li>
! <p>
! Replace in 23.3.3.5 [forwardlist.ops] before 11 and in 23.3.4.4 [list.ops] before 15
! </p>
! 
! <blockquote><pre>requires <del>EqualityComparable&lt;T&gt;</del> <ins>HasEqualTo&lt;T, T&gt;</ins> void remove(const T&amp; value);
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="923"></a>923. atomics with floating-point </h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2008-10-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Right now, C++0x doesn't have <tt>atomic&lt;float&gt;</tt>. We're thinking of adding
! the words to support it for TR2 (note: that would be slightly
! post-C++0x). If we need it, we could probably add the words.
! </p>
! <p>
! <b>Proposed resolutions:</b> Using <tt>atomic&lt;FP&gt;::compare_exchange</tt> (weak or
! strong) should be either:
! </p>
! 
! <ol>
! <li>
! ill-formed, or
! </li>
  <li>
- well-defined.
- </li>
- </ol>
- 
  <p>
! I propose Option 1 for C++0x for expediency. If someone wants to argue
! for Option 2, they need to say what exactly they want <tt>compare_exchange</tt>
! to mean in this case (IIRC, C++0x doesn't even assume IEEE 754).
! </p>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote>
! Move to open. Blocked until concepts for atomics are addressed.
! </blockquote>
! 
! <p><i>[
! Post Summit Anthony adds:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Recommend NAD. C++0x does have <tt>std::atomic&lt;float&gt;</tt>, and both
! <tt>compare_exchange_weak</tt> and <tt>compare_exchange_strong</tt> are well-defined in
! this case. Maybe change the note in 29.6 [atomics.types.operations] paragraph 20 to:
! </p>
! 
! <blockquote>
! <p>
! [<i>Note:</i> The effect of the compare-and-exchange operations is
! </p>
! <blockquote><pre>if (!memcmp(object,expected,sizeof(*object)))
!     *object = desired;
! else
!     *expected = *object;
! </pre></blockquote>
! 
! <p>
! This may result in failed comparisons for values that compare equal if
! the underlying type has padding bits or alternate representations of
! the same value. <i>-- end note</i>]
! </p>
! </blockquote>
! 
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Change the note in 29.6 [atomics.types.operations] paragraph 20 to:
  </p>
  
! <blockquote>
! <p>
! [<i>Note:</i> The effect of the compare-and-exchange operations is
! </p>
! <blockquote><pre>if (<del>*object == *expected</del> <ins>!memcmp(object,expected,sizeof(*object))</ins>)
!     *object = desired;
! else
!     *expected = *object;
  </pre></blockquote>
- 
- <p><ins>
- This may result in failed comparisons for values that compare equal if
- the underlying type has padding bits or alternate representations of
- the same value.</ins> <i>-- end note</i>]
- </p>
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="924"></a>924. structs with internal padding</h3>
- <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2008-10-17 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Right now, the <tt>compare_exchange_weak</tt> loop should rapidly converge on the
- padding contents. But <tt>compare_exchange_strong</tt> will require a bit more
- compiler work to ignore padding for comparison purposes.
- </p>
- <p>
- Note that this isn't a problem for structs with no padding, and we do
- already have one portable way to ensure that there is no padding that
- covers the key use cases: Have elements be the same type. I suspect that
- the greatest need is for a structure of two pointers, which has no
- padding problem. I suspect the second need is a structure of a pointer
- and some form of an integer. If that integer is <tt>intptr_t</tt>, there will be
- no padding.
- </p>
- <p>
- Related but separable issue: For unused bitfields, or other unused
- fields for that matter, we should probably say it's the programmer's
- responsibility to set them to zero or otherwise ensure they'll be
- ignored by <tt>memcmp</tt>.
- </p>
- 
- <p>
- <b>Proposed resolutions:</b> Using
- <tt>atomic&lt;struct-with-padding&gt;::compare_exchange_strong</tt> should be either:
- </p>
- 
- <ol>
- <li>
- ill-formed, or
- </li>
- <li>
- well-defined.
  </li>
  </ol>
  
- <p>
- I propose Option 1 for C++0x for expediency, though I'm not sure how to
- say it. I would be happy with Option 2, which I believe would mean that
- <tt>compare_exchange_strong</tt> would be implemented to avoid comparing padding
- bytes, or something equivalent such as always zeroing out padding when
- loading/storing/comparing. (Either implementation might require compiler
- support.)
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- 
- <blockquote>
- Move to open. Blocked until concepts for atomics are addressed.
- </blockquote>
- 
- <p><i>[
- Post Summit Anthony adds:
- ]</i></p>
- 
- 
- <blockquote>
- The resoultion of LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a> should resolve this issue as well.
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- </p>
  
  
  
--- 23085,23116 ----
  the same test conditions exists
  as for the free algorithm <tt>remove</tt> (25.3.8 [alg.remove]). The error was
  introduced in the process of conceptifying.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  NAD, solved by the removal of concepts.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol style="list-style-type:upper-alpha">
  <li>
  <p>
! Replace in 23.3.4.6 [forwardlist.ops] before 11 and in 23.3.5.5 [list.ops] before 15
  </p>
  
! <blockquote><pre>
! requires <del>EqualityComparable&lt;T&gt;</del> <ins>HasEqualTo&lt;T, T&gt;</ins> void remove(const T&amp; value);
  </pre></blockquote>
  </li>
  </ol>
  
  
  
  
*************** NAD Editorial.  Solved by
*** 28474,28483 ****
  
  <hr>
  <h3><a name="926"></a>926. Sequentially consistent fences, relaxed operations and modification order</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2008-10-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 313</b></p>
  
--- 23118,23128 ----
  
  <hr>
  <h3><a name="926"></a>926. Sequentially consistent fences, relaxed operations and modification order</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2008-10-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.order">active issues</a> in [atomics.order].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 313</b></p>
  
*************** There was an interesting issue raised ov
*** 28486,28492 ****
  today regarding the following example
  </p>
  
! <blockquote><pre>// Thread 1:
  x.store(1, memory_order_relaxed);           // SX
  atomic_thread_fence(memory_order_seq_cst);  // F1
  y.store(1, memory_order_relaxed);           // SY1
--- 23131,23138 ----
  today regarding the following example
  </p>
  
! <blockquote><pre>
! // Thread 1:
  x.store(1, memory_order_relaxed);           // SX
  atomic_thread_fence(memory_order_seq_cst);  // F1
  y.store(1, memory_order_relaxed);           // SY1
*************** If <tt>F3</tt> is <em>after</em> <tt>F2<
*** 28517,28523 ****
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>:
  </p>
  
! <blockquote>
  For atomic operations <tt>A</tt> and <tt>B</tt> on an atomic object
  <tt>M</tt>, where <tt>A</tt> modifies <tt>M</tt> and <tt>B</tt> takes
  its value, if there are <tt>memory_order_seq_cst</tt> fences <tt>X</tt>
--- 23163,23169 ----
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>:
  </p>
  
! <blockquote><p>
  For atomic operations <tt>A</tt> and <tt>B</tt> on an atomic object
  <tt>M</tt>, where <tt>A</tt> modifies <tt>M</tt> and <tt>B</tt> takes
  its value, if there are <tt>memory_order_seq_cst</tt> fences <tt>X</tt>
*************** and <tt>Y</tt> such that <tt>A</tt> is s
*** 28526,28532 ****
  <tt>Y</tt> in <tt>S</tt>, then <tt>B</tt> observes either the effects of
  <tt>A</tt> or a later modification of <tt>M</tt> in its modification
  order.
! </blockquote>
  
  <p>
  In this case, <tt>A</tt> is <tt>SX</tt>, <tt>B</tt> is <tt>RX</tt>, the
--- 23172,23178 ----
  <tt>Y</tt> in <tt>S</tt>, then <tt>B</tt> observes either the effects of
  <tt>A</tt> or a later modification of <tt>M</tt> in its modification
  order.
! </p></blockquote>
  
  <p>
  In this case, <tt>A</tt> is <tt>SX</tt>, <tt>B</tt> is <tt>RX</tt>, the
*************** disaster either.
*** 28593,28599 ****
  In any case, we should probably add text along the lines of the
  following between p5 and p6 in 29.3 [atomics.order]:
  </p>
! <blockquote>
  [Note: <tt>Memory_order_seq_cst</tt> only ensures sequential consistency for a
  data-race-free program that uses exclusively <tt>memory_order_seq_cst</tt>
  operations.  Any use of weaker ordering will invalidate this guarantee
--- 23239,23245 ----
  In any case, we should probably add text along the lines of the
  following between p5 and p6 in 29.3 [atomics.order]:
  </p>
! <blockquote><p>
  [Note: <tt>Memory_order_seq_cst</tt> only ensures sequential consistency for a
  data-race-free program that uses exclusively <tt>memory_order_seq_cst</tt>
  operations.  Any use of weaker ordering will invalidate this guarantee
*************** unless extreme care is used.  In particu
*** 28601,28607 ****
  only ensure a total order for the fences themselves.  They cannot, in
  general, be used to restore sequential consistency for atomic operations
  with weaker ordering specifications.]
! </blockquote>
  
  <p>
  Also see thread beginning at c++std-lib-23271.
--- 23247,23253 ----
  only ensure a total order for the fences themselves.  They cannot, in
  general, be used to restore sequential consistency for atomic operations
  with weaker ordering specifications.]
! </p></blockquote>
  
  <p>
  Also see thread beginning at c++std-lib-23271.
*************** has ingrained an automatic introspection
*** 28621,28631 ****
  think you meant:
  </p>
  
! <blockquote>
  [Note: <tt>Memory_order_seq_cst</tt> ensures sequential consistency only
  for . . . .  In particular, <tt>memory_order_seq_cst</tt> fences ensure a
  total order only for . . .
! </blockquote>
  <p>
  Unless, of course, <tt>Memory_order_seq_cst</tt> really do nothing but ensure
  sequential consistency for a data-race-free program that uses
--- 23267,23277 ----
  think you meant:
  </p>
  
! <blockquote><p>
  [Note: <tt>Memory_order_seq_cst</tt> ensures sequential consistency only
  for . . . .  In particular, <tt>memory_order_seq_cst</tt> fences ensure a
  total order only for . . .
! </p></blockquote>
  <p>
  Unless, of course, <tt>Memory_order_seq_cst</tt> really do nothing but ensure
  sequential consistency for a data-race-free program that uses
*************** exclusively <tt>memory_order_seq_cst</tt
*** 28638,28647 ****
  ]</i></p>
  
  
! <blockquote>
  NAD Editorial.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
! </blockquote>
  
  
  
--- 23284,23293 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD Editorial.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
! </p></blockquote>
  
  
  
*************** NAD Editorial.  Solved by
*** 28650,28656 ****
  Add a new paragraph after 29.3 [atomics.order]p5 that says
  </p>
  
! <blockquote>
  For atomic operations <tt>A</tt> and <tt>B</tt> on an atomic object
  <tt>M</tt>, where <tt>A</tt> and <tt>B</tt> modify <tt>M</tt>, if there
  are <tt>memory_order_seq_cst</tt> fences <tt>X</tt> and <tt>Y</tt> such
--- 23296,23302 ----
  Add a new paragraph after 29.3 [atomics.order]p5 that says
  </p>
  
! <blockquote><p>
  For atomic operations <tt>A</tt> and <tt>B</tt> on an atomic object
  <tt>M</tt>, where <tt>A</tt> and <tt>B</tt> modify <tt>M</tt>, if there
  are <tt>memory_order_seq_cst</tt> fences <tt>X</tt> and <tt>Y</tt> such
*************** that <tt>A</tt> is sequenced before <tt>
*** 28658,28664 ****
  before <tt>B</tt>, and <tt>X</tt> precedes <tt>Y</tt> in <tt>S</tt>,
  then <tt>B</tt> occurs later than <tt>A</tt> in the modifiction order of
  <tt>M</tt>.
! </blockquote>
  
  
  
--- 23304,23310 ----
  before <tt>B</tt>, and <tt>X</tt> precedes <tt>Y</tt> in <tt>S</tt>,
  then <tt>B</tt> occurs later than <tt>A</tt> in the modifiction order of
  <tt>M</tt>.
! </p></blockquote>
  
  
  
*************** then <tt>B</tt> occurs later than <tt>A<
*** 28666,28674 ****
  
  <hr>
  <h3><a name="927"></a>927. <tt>Dereferenceable</tt>  should be <tt>HasDereference</tt></h3>
! <p><b>Section:</b> X [allocator.concepts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2008-10-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  X [allocator.concepts] contains a reference to a concept named
--- 23312,23320 ----
  
  <hr>
  <h3><a name="927"></a>927. <tt>Dereferenceable</tt>  should be <tt>HasDereference</tt></h3>
! <p><b>Section:</b> X [allocator.concepts] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2008-10-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  X [allocator.concepts] contains a reference to a concept named
*************** Daniel adds 2009-02-14:
*** 28680,28690 ****
  ]</i></p>
  
  
! <blockquote>
  The proposal given in the paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2829.pdf">N2829</a>
  would automatically resolve this issue.
! </blockquote>
  
  
  <p><i>[
--- 23326,23336 ----
  ]</i></p>
  
  
! <blockquote><p>
  The proposal given in the paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2829.pdf">N2829</a>
  would automatically resolve this issue.
! </p></blockquote>
  
  
  <p><i>[
*************** Change all uses of the concept <tt>Deref
*** 28715,28731 ****
  
  <hr>
  <h3><a name="928"></a>928. Wrong concepts used for <tt>tuple</tt>'s comparison operators</h3>
! <p><b>Section:</b> 20.4.2.7 [tuple.rel] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2008-10-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.rel">issues</a> in [tuple.rel].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the latest working draft for C++0x, <tt>tuple</tt>'s <tt>operator==</tt> and <tt>operator&lt;</tt>
  are declared as 
  </p>
  
! <blockquote><pre>template&lt;class... TTypes, class... UTypes&gt; 
    requires EqualityComparable&lt;TTypes, UTypes&gt;... 
    bool operator==(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre></blockquote>
--- 23361,23379 ----
  
  <hr>
  <h3><a name="928"></a>928. Wrong concepts used for <tt>tuple</tt>'s comparison operators</h3>
! <p><b>Section:</b> 20.4.2.7 [tuple.rel] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2008-10-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#tuple.rel">active issues</a> in [tuple.rel].</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.rel">issues</a> in [tuple.rel].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the latest working draft for C++0x, <tt>tuple</tt>'s <tt>operator==</tt> and <tt>operator&lt;</tt>
  are declared as 
  </p>
  
! <blockquote><pre>
! template&lt;class... TTypes, class... UTypes&gt; 
    requires EqualityComparable&lt;TTypes, UTypes&gt;... 
    bool operator==(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre></blockquote>
*************** are declared as
*** 28734,28740 ****
  and
  </p>
  
! <blockquote><pre>template&lt;class... TTypes, class... UTypes&gt; 
    requires LessThanComparable&lt;TTypes, UTypes&gt;... 
    bool operator&lt;(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre></blockquote>
--- 23382,23389 ----
  and
  </p>
  
! <blockquote><pre>
! template&lt;class... TTypes, class... UTypes&gt; 
    requires LessThanComparable&lt;TTypes, UTypes&gt;... 
    bool operator&lt;(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre></blockquote>
*************** parameter, not two.  Also, even if <tt>L
*** 28745,28758 ****
  parameters, the definition of <tt>tuple::operator&lt;()</tt> should also require 
  </p>
  
! <blockquote><pre>LessThanComparable&lt;UTypes, TTypes&gt;... // (note the order) 
  </pre></blockquote>
  
  <p>
  since the algorithm for <tt>tuple::operator&lt;</tt> is the following (pseudo-code)
  </p>
  
! <blockquote><pre>for (size_t N = 0; N &lt; sizeof...(TTypes); ++N) { 
      if (get&lt;N&gt;(t) &lt; get&lt;N&gt;(u) return true; 
      else if ((get&lt;N&gt;(u) &lt; get&lt;N&gt;(t)) return false; 
  } 
--- 23394,23409 ----
  parameters, the definition of <tt>tuple::operator&lt;()</tt> should also require 
  </p>
  
! <blockquote><pre>
! LessThanComparable&lt;UTypes, TTypes&gt;... // (note the order) 
  </pre></blockquote>
  
  <p>
  since the algorithm for <tt>tuple::operator&lt;</tt> is the following (pseudo-code)
  </p>
  
! <blockquote><pre>
! for (size_t N = 0; N &lt; sizeof...(TTypes); ++N) { 
      if (get&lt;N&gt;(t) &lt; get&lt;N&gt;(u) return true; 
      else if ((get&lt;N&gt;(u) &lt; get&lt;N&gt;(t)) return false; 
  } 
*************** Post Summit:
*** 28769,28777 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend Tentatively Ready.
! </blockquote>
  
  
  
--- 23420,23428 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Tentatively Ready.
! </p></blockquote>
  
  
  
*************** Recommend Tentatively Ready.
*** 28780,28786 ****
  In 20.4.1 [tuple.general] and 20.4.2.7 [tuple.rel] change:
  </p>
  
! <blockquote><pre>template&lt;class... TTypes, class... UTypes&gt;
    requires <del>EqualityComparable</del><ins>HasEqualTo</ins>&lt;TTypes, UTypes&gt;...
    bool operator==(const tuple&lt;TTypes...&gt;&amp;, const tuple&lt;UTypes...&gt;&amp;);
  
--- 23431,23438 ----
  In 20.4.1 [tuple.general] and 20.4.2.7 [tuple.rel] change:
  </p>
  
! <blockquote><pre>
! template&lt;class... TTypes, class... UTypes&gt;
    requires <del>EqualityComparable</del><ins>HasEqualTo</ins>&lt;TTypes, UTypes&gt;...
    bool operator==(const tuple&lt;TTypes...&gt;&amp;, const tuple&lt;UTypes...&gt;&amp;);
  
*************** template&lt;class... TTypes, class... UT
*** 28811,28820 ****
  
  <hr>
  <h3><a name="930"></a>930. Access to std::array data as built-in array type</h3>
! <p><b>Section:</b> 23.3.1 [array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-11-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 23463,23473 ----
  
  <hr>
  <h3><a name="930"></a>930. Access to std::array data as built-in array type</h3>
! <p><b>Section:</b> 23.3.2 [array] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-11-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** The Working Draft (N2798) allows access
*** 28825,28831 ****
  <blockquote>
  
  <h5>23.2.1.4 array::data [array.data]</h5>
! <pre> T *data();
   const T *data() const;
  </pre>
  <ol><li>
--- 23478,23485 ----
  <blockquote>
  
  <h5>23.2.1.4 array::data [array.data]</h5>
! <pre>
!  T *data();
   const T *data() const;
  </pre>
  <ol><li>
*************** This hampers the use of <tt>std::array</
*** 28842,28848 ****
  pass its data to a C style API function:
  </p>
  
! <pre> // Some C style API function. 
   void set_path( char (*)[MAX_PATH] );
  
   std::array&lt;char,MAX_PATH&gt; path;
--- 23496,23503 ----
  pass its data to a C style API function:
  </p>
  
! <pre>
!  // Some C style API function. 
   void set_path( char (*)[MAX_PATH] );
  
   std::array&lt;char,MAX_PATH&gt; path;
*************** Another example, trying to pass the arra
*** 28855,28861 ****
  C++ class:
  </p>
  
! <pre> // Represents a 3-D point in space.
   class three_d_point {
   public:
     explicit three_d_point(const double (&amp;)[3]); 
--- 23510,23517 ----
  C++ class:
  </p>
  
! <pre>
!  // Represents a 3-D point in space.
   class three_d_point {
   public:
     explicit three_d_point(const double (&amp;)[3]); 
*************** type <tt>T</tt> that has a <tt>data()</t
*** 28907,28913 ****
  <tt>std::swap</tt> call may swap the container elements instead.
  </p>
  
! <pre> template &lt;typename T&gt;
   void func(T&amp; container1, T&amp; container2)
   {
     // Are data1 and data2 pointers or references?
--- 23563,23570 ----
  <tt>std::swap</tt> call may swap the container elements instead.
  </p>
  
! <pre>
!  template &lt;typename T&gt;
   void func(T&amp; container1, T&amp; container2)
   {
     // Are data1 and data2 pointers or references?
*************** containers, but it no longer is for <tt>
*** 28926,28932 ****
  is changed to return a reference (tested on ConceptGCC Alpha 7):
  </p>
  
! <pre> auto concept ContiguousContainerConcept&lt;typename T&gt;
   {
     typename value_type = typename T::value_type;
     const value_type * T::data() const;
--- 23583,23590 ----
  is changed to return a reference (tested on ConceptGCC Alpha 7):
  </p>
  
! <pre>
!  auto concept ContiguousContainerConcept&lt;typename T&gt;
   {
     typename value_type = typename T::value_type;
     const value_type * T::data() const;
*************** the new member function?
*** 28979,28985 ****
  <p>
  Alisdair: Noodling about:
  </p>
! <blockquote><pre>template&lt;size_t N, ValueType T&gt;
  struct array
  {
    T elems[N];
--- 23637,23644 ----
  <p>
  Alisdair: Noodling about:
  </p>
! <blockquote><pre>
! template&lt;size_t N, ValueType T&gt;
  struct array
  {
    T elems[N];
*************** Walter: Would this address the issue? Ar
*** 29023,29029 ****
  <p>
  Alan: What would usage look like?
  </p>
! <blockquote><pre>// 3-d point in space
  struct three_d_point
  {
    explicit three_d_point(const double (&amp;)[3]);
--- 23682,23689 ----
  <p>
  Alan: What would usage look like?
  </p>
! <blockquote><pre>
! // 3-d point in space
  struct three_d_point
  {
    explicit three_d_point(const double (&amp;)[3]);
*************** The idea to resolve the issue by adding
*** 29064,29073 ****
  was abandoned, because it would be inconvenient to use, especially when
  passing the array to a template function, as mentioned by Daniel. So we
  reconsidered the original proposed resolution, which appeared
! acceptable, except for its proposed changes to 23.3.1.7 [array.zero], which
  allowed <tt>c_array_type</tt> and <tt>c_array()</tt> to be absent for a zero-sized array.
  Alisdair argued that such wording would disallow certain generic use
! cases. New wording for 23.3.1.7 [array.zero] was agreed upon (Howard: and
  is reflected in the proposed resolution).
  </p>
  <p>
--- 23724,23733 ----
  was abandoned, because it would be inconvenient to use, especially when
  passing the array to a template function, as mentioned by Daniel. So we
  reconsidered the original proposed resolution, which appeared
! acceptable, except for its proposed changes to 23.3.2.8 [array.zero], which
  allowed <tt>c_array_type</tt> and <tt>c_array()</tt> to be absent for a zero-sized array.
  Alisdair argued that such wording would disallow certain generic use
! cases. New wording for 23.3.2.8 [array.zero] was agreed upon (Howard: and
  is reflected in the proposed resolution).
  </p>
  <p>
*************** prepared to proceed without it.
*** 29106,29122 ****
  ]</i></p>
  
  
! <blockquote>
  Mark as NAD. There was not enough consensus that this was sufficiently
  useful. There are known other ways to do this, such as small inline
  conversion functions.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to the template definition of array, 23.3.1 [array]/3:
  </p>
  
  <blockquote>
--- 23766,23782 ----
  ]</i></p>
  
  
! <blockquote><p>
  Mark as NAD. There was not enough consensus that this was sufficiently
  useful. There are known other ways to do this, such as small inline
  conversion functions.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to the template definition of array, 23.3.2 [array]/3:
  </p>
  
  <blockquote>
*************** const c_array_type &amp; c_array() const
*** 29130,29136 ****
  </blockquote>
  
  <p>
! Add the following subsection to 23.3.1 [array], after 23.3.1.4 [array.data]:
  </p>
  
  <blockquote>
--- 23790,23796 ----
  </blockquote>
  
  <p>
! Add the following subsection to 23.3.2 [array], after 23.3.2.5 [array.data]:
  </p>
  
  <blockquote>
*************** const c_array_type &amp; c_array() const
*** 29151,29157 ****
  
  
  <p>
! Change Zero sized arrays 23.3.1.7 [array.zero]:
  </p>
  
  <blockquote>
--- 23811,23817 ----
  
  
  <p>
! Change Zero sized arrays 23.3.2.8 [array.zero]:
  </p>
  
  <blockquote>
*************** The type <tt>c_array_type</tt> is unspec
*** 29174,29496 ****
  
  
  <hr>
- <h3><a name="933"></a>933. Unique_ptr defect</h3>
- <p><b>Section:</b> 20.9.9.2.5 [unique.ptr.single.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-11-27 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.single.modifiers">issues</a> in [unique.ptr.single.modifiers].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- If we are supporting stateful deleters, we need an overload for
- <tt>reset</tt> that
- takes a deleter as well.
- </p>
- 
- <blockquote><pre>void reset( pointer p, deleter_type d);
- </pre></blockquote>
- 
- <p>
- We probably need two overloads to support move-only deleters, and
- this
- sounds uncomfortably like the two constructors I have been ignoring
- for
- now...
- </p>
- 
- <p><i>[
- Batavia (2009-05):
- ]</i></p>
- 
- <blockquote>
- <p>
- Howard comments that we have the functionality via move-assigment.
- </p>
- <p>
- Move to Open.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Mark as NAD Future.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- </p>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="935"></a>935. clock error handling needs to be specified</h3>
- <p><b>Section:</b> 20.11.5 [time.clock] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-11-24 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Each of the three clocks specified in Clocks 20.11.5 [time.clock]
- provides the member function:
- </p>
- 
- <blockquote><pre>static time_point now();
- </pre></blockquote>
- 
- <p>
- The semantics specified by Clock requirements 20.11.1 [time.clock.req]
- make no mention of error handling. Thus the function may throw <tt>bad_alloc</tt>
- or an implementation-defined exception (17.6.4.12 [res.on.exception.handling]
- paragraph 4).
- </p>
- 
- <p>
- Some implementations of these functions on POSIX, Windows, and
- presumably on other operating systems, may fail in ways only detectable
- at runtime. Some failures on Windows are due to supporting chipset
- errata and can even occur after successful calls to a clock's <tt>now()</tt>
- function.
- </p>
- 
- <p>
- These functions are used in cases where exceptions are not appropriate
- or where the specifics of the exception or cause of error need to be
- available to the user. See
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2828.html">N2828</a>,
- <i>Library Support for hybrid error
- handling (Rev 1)</i>, for more specific discussion of use cases. Thus some change in
- the interface of now is required.
- </p>
- 
- <p>
- The proposed resolution has been implemented in the Boost version of the
- chrono library. No problems were encountered.
- </p>
- 
- <p><i>[
- Batavia (2009-05):
- ]</i></p>
- 
- <blockquote>
- <p>
- We recommend this issue be deferred until the next Committee Draft
- has been issued and the prerequisite paper has been accepted.
- </p>
- <p>
- Move to Open.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Mark as NAD future. Too late to make this change without having already
- accepted the hybrid error handling proposal.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Accept the proposed wording of
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2828.html">N2828</a>,
- <i>Library Support for hybrid error handling (Rev 1)</i>.
- </p>
- 
- <p>
- Change Clock requirements 20.11.1 [time.clock.req] as indicated:
- </p>
- 
- <blockquote>
- <p>
- -2- In Table 55 <tt>C1</tt> and <tt>C2</tt> denote clock types. <tt>t1</tt> and
- <tt>t2</tt> are values returned by <tt>C1::now()</tt> where the call 
- returning <tt>t1</tt> happens before (1.10) the call returning <tt>t2</tt> and
- both of these calls happen before <tt>C1::time_point::max()</tt>.
- <ins><tt>ec</tt> denotes an object of type <tt>error_code</tt> 
- (19.5.2.1 [syserr.errcode.overview]).</ins>
- </p>
- 
- <table border="1">
- <caption>Table 55 -- Clock requirements</caption>
- <tbody><tr>
- <th>Expression</th><th>Return type</th><th>Operational semantics</th>
- </tr>
- 
- <tr>
- <td>...</td>
- <td>...</td>
- <td>...</td>
- </tr>
- 
- <tr>
- <td><tt>C1::now()</tt></td>
- <td><tt>C1::time_point</tt></td>
- <td>Returns a <tt>time_point</tt> object representing the current point in time.
- </td>
- </tr>
- 
- <tr>
- <td><tt><ins>C1::now(ec)</ins></tt></td>
- <td><tt><ins>C1::time_point</ins></tt></td>
- <td><ins>Returns a <tt>time_point</tt> object representing the current point in time.</ins>
- </td>
- </tr>
- </tbody></table>
- </blockquote>
- 
- <p>
- Change Class system_clock 20.11.5.1 [time.clock.system] as indicated:
- </p>
- 
- <blockquote><pre>static time_point now(<ins>error_code&amp; ec=throws()</ins>);
- </pre></blockquote>
- 
- <p>
- Change Class monotonic_clock X [time.clock.monotonic] as indicated:
- </p>
- 
- <blockquote><pre>static time_point now(<ins>error_code&amp; ec=throws()</ins>);
- </pre></blockquote>
- 
- <p>
- Change Class high_resolution_clock 20.11.5.3 [time.clock.hires] as indicated:
- </p>
- 
- <blockquote><pre>static time_point now(<ins>error_code&amp; ec=throws()</ins>);
- </pre></blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="936"></a>936. Mutex type overspecified</h3>
- <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-12-05 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a></p>
- <p><b>Discussion:</b></p>
- 
- 
- 
- <p>
- 30.4.1 [thread.mutex.requirements] describes the requirements for a type to be
- a "Mutex type". A Mutex type can be used as the template argument for
- the <tt>Lock</tt> type that's passed to <tt>condition_variable_any::wait</tt> (although
- <tt>Lock</tt> seems like the wrong name here, since <tt>Lock</tt> is given a different
- formal meaning in 30.4.2 [thread.lock]) and, although the WD doesn't quite say
- so, as the template argument for <tt>lock_guard</tt> and <tt>unique_lock</tt>.
- </p>
- 
- <p>
- The requirements for a Mutex type include:
- </p>
- 
- <ul>
- <li>
- <tt>m.lock()</tt> shall be well-formed and have [described] semantics, including a return type of <tt>void</tt>.
- </li>
- <li>
- <tt>m.try_lock()</tt> shall be well-formed and have [described] semantics, including a return type of <tt>bool</tt>.
- </li>
- <li>
- <tt>m.unlock()</tt> shall be well-formed and have [described] semantics, including a return type of <tt>void</tt>.
- </li>
- </ul>
- 
- <p>
- Also, a Mutex type "shall not be copyable nor movable".
- </p>
- 
- <p>
- The latter requirement seems completely irrelevant, and the three
- requirements on return types are tighter than they need to be. For
- example, there's no reason that <tt>lock_guard</tt> can't be instantiated with a
- type that's copyable. The rule is, in fact, that <tt>lock_guard</tt>, etc. won't
- try to copy objects of that type. That's a constraint on locks, not on
- mutexes. Similarly, the requirements for <tt>void</tt> return types are
- unnecessary; the rule is, in fact, that <tt>lock_guard</tt>, etc. won't use any
- returned value. And with the return type of <tt>bool</tt>, the requirement should
- be that the return type is convertible to <tt>bool</tt>.
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Move to open. Related to conceptualization and should probably be tackled as part of that.
- </p>
- <ul>
- <li>
- The intention is not only to place a constraint on what types such as
- <tt>lock_guard</tt> may do with mutex types, but on what any code, including user
- code, may do with mutex types. Thus the constraints as they are apply to
- the mutex types themselves, not the current users of mutex types in the
- standard.
- </li>
- <li>
- This is a low priority issue; the wording as it is may be overly
- restrictive but this may not be a real issue.
- </li>
- </ul>
- </blockquote>
- 
- <p><i>[
- Post Summit Anthony adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Section 30.4.1 [thread.mutex.requirements] conflates the
- requirements on a generic Mutex type (including user-supplied mutexes)
- with the requirements placed on the standard-supplied mutex types in an
- attempt to group everything together and save space.
- </p>
- <p>
- When applying concepts to chapter 30, I suggest that the concepts
- <tt>Lockable</tt> and <tt>TimedLockable</tt> embody the requirements for
- *use* of a mutex type as required by
- <tt>unique_lock/lock_guard/condition_variable_any</tt>. These should be
- relaxed as Pete describes in the issue. The existing words in 30.4.1 [thread.mutex.requirements] are requirements on all of
- <tt>std::mutex</tt>, <tt>std::timed_mutex</tt>,
- <tt>std::recursive_mutex</tt> and <tt>std::recursive_timed_mutex</tt>,
- and should be rephrased as such.
- </p>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- </p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="937"></a>937. Atomics for standard typedef types</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Clark Nelson <b>Opened:</b> 2008-12-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 89</b></p>
--- 23834,23844 ----
  
  
  <hr>
  <h3><a name="937"></a>937. Atomics for standard typedef types</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Clark Nelson <b>Opened:</b> 2008-12-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 89</b></p>
*************** with C.
*** 29562,29812 ****
  
  
  <hr>
- <h3><a name="940"></a>940. <tt>std::distance</tt></h3>
- <p><b>Section:</b> 24.4.4 [iterator.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Thomas <b>Opened:</b> 2008-12-14 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.operations">issues</a> in [iterator.operations].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses UK 270</b></p>
- 
- <p>
- Regarding the <tt>std::distance</tt> - function, 24.4.4 [iterator.operations]
- / 4 says:
- </p>
- <blockquote>
- Returns the
- number of increments or decrements needed to get from first to last.
- </blockquote>
- <p>
- This sentence is completely silent about the sign of the return value.
- 24.4.4 [iterator.operations] / 1 gives more information about the
- underlying operations, but
- again no inferences about the sign can be made.
- Strictly speaking, that is taking that sentence literally, I think this
- sentence even implies a positive return value in all cases, as the
- number of increments or decrements is clearly a ratio scale variable,
- with a natural zero bound.
- </p>
- <p>
- Practically speaking, my implementations did what common sense and
- knowledge based on pointer arithmetic forecasts, namely a positive sign
- for increments (that is, going from <tt>first</tt> to <tt>last</tt> by <tt>operator++</tt>), and a
- negative sign for decrements (going from <tt>first</tt> to <tt>last</tt> by <tt>operator--</tt>).
- </p>
- <p>
- Here are my two questions:
- </p>
- <p>
- First, is that paragraph supposed to be interpreted in the way what I
- called 'common sense', that is negative sign for decrements ? I am
- fairly sure that's the supposed behavior, but a double-check here in
- this group can't hurt.
- </p>
- <p>
- Second, is the present wording (2003 standard version - no idea about
- the draft for the upcoming standard) worth an edit to make it a bit more
- sensible, to mention the sign of the return value explicitly ?
- </p>
- 
- <p><i>[
- Daniel adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- My first thought was that resolution <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#204">204</a> would already cover the
- issue report, but it seems that current normative wording is in
- contradiction to that resolution:
- </p>
- 
- <p>
- Referring to
- <a href="" ref="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>,
- 24.4.4 [iterator.operations]/ p.4 says:
- </p>
- 
- <blockquote>
- <i>Effects:</i> Returns the number of increments or decrements needed to get
- from <tt>first</tt> to <tt>last</tt>.
- </blockquote>
- 
- <p>
- IMO the part " or decrements" is in contradiction to p. 5 which says
- </p>
- 
- <blockquote>
- <i>Requires:</i> <tt>last</tt> shall be reachable from <tt>first</tt>.
- </blockquote>
- 
- <p>
- because "reachable" is defined in X [iterator.concepts]/7 as
- </p>
- 
- <blockquote>
- An iterator <tt>j</tt> is called reachable from an iterator <tt>i</tt> if and only if
- there is a finite
- sequence of applications of the expression <tt>++i</tt> that makes <tt>i == j</tt>.[..]
- </blockquote>
- 
- <p>
- Here is wording that would be consistent with this definition of "reachable":
- </p>
- 
- <p>
- Change 24.4.4 [iterator.operations] p4 as follows:
- </p>
- 
- <blockquote>
- <i>Effects:</i> Returns the number of increments <del>or decrements</del>
- needed to get from <tt>first</tt> to <tt>last</tt>.
- </blockquote>
- 
- </blockquote>
- 
- <p>
- Thomas adds more discussion and an alternative view point
- <a href="http://groups.google.com/group/comp.std.c++/browse_thread/thread/e8e46dcda0a5d797#">here</a>.
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- 
- <blockquote>
- The proposed wording below was verbally agreed to.  Howard provided.
- </blockquote>
- 
- <p><i>[
- Batavia (2009-05):
- ]</i></p>
- 
- <blockquote>
- <p>
- Pete reports that a recent similar change has been made
- for the <tt>advance()</tt> function.
- </p>
- <p>
- We agree with the proposed resolution.
- Move to Tentatively Ready.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- Moved from Tentatively Ready to Open only because the wording needs to be
- tweaked for concepts removal.
- </blockquote>
- 
- <p><i>[
- 2009-07 Frankfurt:
- ]</i></p>
- 
- 
- <blockquote>
- Leave Open pending arrival of a post-Concepts WD.
- </blockquote>
- 
- <p><i>[
- 2009-10-14 Daniel provided de-conceptified wording.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Move to Ready, replacing the Effects clause in the proposed wording with
- "If InputIterator meets the requirements of random access iterator then
- returns (last - first), otherwise returns the number of increments
- needed to get from first to list.".
- </blockquote>
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to NAD Editorial.  Rationale added below.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by N3066.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <ol>
- <li>
- <p>
- Change 24.2.7 [random.access.iterators], Table 105 as indicated [This change is not
- essential but it simplifies the specification] for the row with
- expression "<tt>b - a</tt>"
- and the column Operational semantics:
- </p>
- 
- <blockquote><pre><del>(a &lt; b) ? </del>distance(a,b)
- <del>: -distance(b,a)</del>
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Change 24.4.4 [iterator.operations]/4+5 as indicated:
- </p>
- 
- <blockquote><pre>template&lt;class InputIterator&gt;
-   typename iterator_traits&lt;InputIterator&gt;::difference_type
-     distance(InputIterator first, InputIterator last);
- </pre>
- <blockquote>
- <p>
- 4 <i>Effects:</i> <ins>If <tt>InputIterator</tt> meets the requirements
- of random access iterator then returns <tt>(last - first)</tt>,
- otherwise</ins> <del>R</del><ins>r</ins>eturns the number of increments
- <del>or decrements</del> needed to get from <tt>first</tt> to
- <tt>last</tt>.
- </p>
- 
- <p>
- 5 <i>Requires:</i> <ins>If <tt>InputIterator</tt> meets the requirements
- of random access iterator then <tt>last</tt> shall be reachable from
- <tt>first</tt> or <tt>first</tt> shall be reachable from <tt>last</tt>,
- otherwise</ins> <tt>last</tt> shall be reachable from <tt>first</tt>.
- </p>
- </blockquote>
- </blockquote>
- </li>
- </ol>
- 
- 
- 
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="941"></a>941. Ref-qualifiers for assignment operators</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-12-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The assignment and equality operators <tt>=</tt> and <tt>==</tt> are easily confused, just
--- 23910,23921 ----
  
  
  <hr>
  <h3><a name="941"></a>941. Ref-qualifiers for assignment operators</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-12-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The assignment and equality operators <tt>=</tt> and <tt>==</tt> are easily confused, just
*************** because of their visual similarity, and
*** 29814,29820 ****
  a serious bug. When the left side of an <tt>operator=</tt> is an rvalue, it's
  highly unlikely that the assignment was intended by the programmer:
  </p>
! <blockquote><pre>if ( func() = value )  // Typical typo: == intended!
  </pre></blockquote>
  <p>
  Built-in types don't support assignment to an rvalue, but unfortunately,
--- 23923,23930 ----
  a serious bug. When the left side of an <tt>operator=</tt> is an rvalue, it's
  highly unlikely that the assignment was intended by the programmer:
  </p>
! <blockquote><pre>
! if ( func() = value )  // Typical typo: == intended!
  </pre></blockquote>
  <p>
  Built-in types don't support assignment to an rvalue, but unfortunately,
*************** assignment operators in the library.
*** 29838,29847 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open.
  We recommend this be deferred until after the next Committee Draft.
! </blockquote>
  
  <p><i>[
  Frankfurt 2009-07:
--- 23948,23957 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open.
  We recommend this be deferred until after the next Committee Draft.
! </p></blockquote>
  
  <p><i>[
  Frankfurt 2009-07:
*************** A proposed resolution is provided by the
*** 29872,29883 ****
  
  <hr>
  <h3><a name="942"></a>942. Atomics synopsis typo</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Holger Grund <b>Opened:</b> 2008-12-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a></p>
  <p><b>Discussion:</b></p>
  
  
--- 23982,23992 ----
  
  <hr>
  <h3><a name="942"></a>942. Atomics synopsis typo</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Holger Grund <b>Opened:</b> 2008-12-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#880">880</a></p>
  <p><b>Discussion:</b></p>
  
  
*************** The <tt>atomic_exchange</tt> overload ta
*** 29895,29912 ****
  is missing the second parameter:
  </p>
  
! <blockquote><pre>void* atomic_exchange(volatile atomic_address*);
  </pre></blockquote>
  
  <p>
  should be
  </p>
  
! <blockquote><pre>void* atomic_exchange(volatile atomic_address*<ins>, void*</ins>);
  </pre></blockquote>
  
  <p>
! Note, that this is <em>not</em> covered by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a> "Missing atomic exchange parameter",
  which only talks about the <tt>atomic_bool</tt>.
  </p>
  </blockquote>
--- 24004,24023 ----
  is missing the second parameter:
  </p>
  
! <blockquote><pre>
! void* atomic_exchange(volatile atomic_address*);
  </pre></blockquote>
  
  <p>
  should be
  </p>
  
! <blockquote><pre>
! void* atomic_exchange(volatile atomic_address*<ins>, void*</ins>);
  </pre></blockquote>
  
  <p>
! Note, that this is <em>not</em> covered by <a href="lwg-defects.html#880">880</a> "Missing atomic exchange parameter",
  which only talks about the <tt>atomic_bool</tt>.
  </p>
  </blockquote>
*************** which only talks about the <tt>atomic_bo
*** 29918,29924 ****
  Change the synopsis in 29 [atomics]/2:
  </p>
  
! <blockquote><pre>void* atomic_exchange(volatile atomic_address*<ins>, void*</ins>);
  </pre></blockquote>
  
  
--- 24029,24036 ----
  Change the synopsis in 29 [atomics]/2:
  </p>
  
! <blockquote><pre>
! void* atomic_exchange(volatile atomic_address*<ins>, void*</ins>);
  </pre></blockquote>
  
  
*************** Change the synopsis in 29 [atomics]/2:
*** 29927,30023 ****
  
  
  <hr>
- <h3><a name="944"></a>944. <tt>atomic&lt;bool&gt;</tt> derive from <tt>atomic_bool</tt>?</h3>
- <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Holger Grund <b>Opened:</b> 2008-12-19 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- I think it's fairly obvious that <tt>atomic&lt;bool&gt;</tt> is supposed to be derived
- from <tt>atomic_bool</tt> (and otherwise follow the <tt>atomic&lt;integral&gt;</tt> interface),
- though I think the current wording doesn't support this. I raised this
- point along with <tt>atomic&lt;floating-point&gt;</tt> privately with Herb and I seem
- to recall it came up in the resulting discussion on this list. However,
- I don't see anything on the current libs issue list mentioning this
- problem.
- </p>
- 
- <p>
- 29.5 [atomics.types.generic]/3 reads
- </p>
- 
- <blockquote>
- There are full specializations over the integral types on the atomic
- class template. For each integral type integral in the second column of
- table 121 or table 122, the specialization <tt>atomic&lt;integral&gt;</tt> shall be
- publicly derived from the corresponding atomic integral type in the
- first column of the table. These specializations shall have trivial
- default constructors and trivial destructors.
- </blockquote>
- 
- <p>
- Table 121 does not include (<tt>atomic_bool</tt>, <tt>bool</tt>),
- so that this should probably be mentioned explicitly in the quoted paragraph.
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- 
- <blockquote>
- Move to open. Lawrence will draft a proposed resolution. Also, ask
- Howard to fix the title.
- </blockquote>
- 
- <p><i>[
- Post Summit Anthony provided proposed wording.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Replace paragraph 3 in 29.5 [atomics.types.generic] with
- </p>
- 
- <blockquote>
- -3- There are full specializations over the integral types on the <tt>atomic</tt>
- class template. For each integral type <tt>integral</tt> in the second column of
- table 121 or table 122, the specialization <tt>atomic&lt;integral&gt;</tt> shall be
- publicly derived from the corresponding atomic integral type in the first
- column of the table.
- <ins>In addition, the specialization <tt>atomic&lt;bool&gt;</tt>
- shall be publicly derived from <tt>atomic_bool</tt>.</ins>
- These specializations shall have trivial default
- constructors and trivial destructors.
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="945"></a>945. <tt>system_clock::rep</tt> not specified</h3>
! <p><b>Section:</b> 20.11.5.1 [time.clock.system] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-12-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.system">issues</a> in [time.clock.system].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.11.5.1 [time.clock.system], the declaration of <tt>system_clock::rep</tt> says "see
  below", but there is nothing below that describes it.
  </p>
  
--- 24039,24052 ----
  
  
  <hr>
  <h3><a name="945"></a>945. <tt>system_clock::rep</tt> not specified</h3>
! <p><b>Section:</b> 20.12.7.1 [time.clock.system] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-12-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.system">issues</a> in [time.clock.system].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.12.7.1 [time.clock.system], the declaration of <tt>system_clock::rep</tt> says "see
  below", but there is nothing below that describes it.
  </p>
  
*************** Howard adds:
*** 30031,30049 ****
  This note refers to:
  </p>
  
! <blockquote>
  -2- <tt>system_clock::duration::min() &lt; system_clock::duration::zero()</tt> shall be <tt>true</tt>.
! </blockquote>
  
  <p>
  I.e. this is standardeze for "<tt>system_clock::rep</tt> is signed".
  Perhaps an editorial note along the lines of:
  </p>
  
! <blockquote>
  -2- <tt>system_clock::duration::min() &lt; system_clock::duration::zero()</tt>
  shall be <tt>true</tt>. <ins>[<i>Note:</i> <tt>system_clock::rep</tt> shall be signed. <i>-- end note</i>].</ins>
! </blockquote>
  
  <p>
  ?
--- 24060,24078 ----
  This note refers to:
  </p>
  
! <blockquote><p>
  -2- <tt>system_clock::duration::min() &lt; system_clock::duration::zero()</tt> shall be <tt>true</tt>.
! </p></blockquote>
  
  <p>
  I.e. this is standardeze for "<tt>system_clock::rep</tt> is signed".
  Perhaps an editorial note along the lines of:
  </p>
  
! <blockquote><p>
  -2- <tt>system_clock::duration::min() &lt; system_clock::duration::zero()</tt>
  shall be <tt>true</tt>. <ins>[<i>Note:</i> <tt>system_clock::rep</tt> shall be signed. <i>-- end note</i>].</ins>
! </p></blockquote>
  
  <p>
  ?
*************** shall be <tt>true</tt>. <ins>[<i>Note:</
*** 30055,30075 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the direction of the proposed resolution.
  Move to NAD Editorial.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a note to 20.11.5.1 [time.clock.system], p2:
  </p>
! <blockquote>
  -2- <tt>system_clock::duration::min() &lt; system_clock::duration::zero()</tt>
  shall be <tt>true</tt>. <ins>[<i>Note:</i> <tt>system_clock::rep</tt> shall be signed. <i>-- end note</i>].</ins>
! </blockquote>
  
  
  
--- 24084,24104 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the direction of the proposed resolution.
  Move to NAD Editorial.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a note to 20.12.7.1 [time.clock.system], p2:
  </p>
! <blockquote><p>
  -2- <tt>system_clock::duration::min() &lt; system_clock::duration::zero()</tt>
  shall be <tt>true</tt>. <ins>[<i>Note:</i> <tt>system_clock::rep</tt> shall be signed. <i>-- end note</i>].</ins>
! </p></blockquote>
  
  
  
*************** shall be <tt>true</tt>. <ins>[<i>Note:</
*** 30077,30104 ****
  
  <hr>
  <h3><a name="946"></a>946. <tt>duration_cast</tt> improperly specified</h3>
! <p><b>Section:</b> 20.11.3.7 [time.duration.cast] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-12-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.duration.cast">issues</a> in [time.duration.cast].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! 20.11.3.7 [time.duration.cast]/3:
! 
! <blockquote>
  .... All intermediate computations shall be
  carried out in the widest possible representation... .
! </blockquote>
  
  <p>
! So ignoring
! floating-point types for the moment, all this arithmetic has to be done
  using the implementation's largest integral type, even if both arguments
! use int for their representation. This seems excessive. And it's not at
  all clear what this means if we don't ignore floating-point types.
  </p>
  
  <p>
! This issue is related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>.
  </p>
  
  <p><i>[
--- 24106,24133 ----
  
  <hr>
  <h3><a name="946"></a>946. <tt>duration_cast</tt> improperly specified</h3>
! <p><b>Section:</b> 20.12.5.7 [time.duration.cast] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-12-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration.cast">issues</a> in [time.duration.cast].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! 20.12.5.7 [time.duration.cast]/3:
! </p>
! <blockquote><p>
  .... All intermediate computations shall be
  carried out in the widest possible representation... .
! </p></blockquote>
  
  <p>
! So ignoring floating-point types for the moment, all this arithmetic has to be done
  using the implementation's largest integral type, even if both arguments
! use <tt>int</tt> for their representation. This seems excessive. And it's not at
  all clear what this means if we don't ignore floating-point types.
  </p>
  
  <p>
! This issue is related to <a href="lwg-closed.html#952">952</a>.
  </p>
  
  <p><i>[
*************** The intent of this remark is that interm
*** 30112,30118 ****
  using:
  </p>
  
! <blockquote><pre>common_type&lt;typename ToDuration::rep, Rep, intmax_t&gt;::type
  </pre></blockquote>
  
  <p>
--- 24141,24148 ----
  using:
  </p>
  
! <blockquote><pre>
! common_type&lt;typename ToDuration::rep, Rep, intmax_t&gt;::type
  </pre></blockquote>
  
  <p>
*************** Batavia (2009-05):
*** 30128,30134 ****
  
  <blockquote>
  <p>
! We view this as a specific case of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>,
  and should be resolved when that issue is resolved.
  </p>
  <p>
--- 24158,24164 ----
  
  <blockquote>
  <p>
! We view this as a specific case of issue <a href="lwg-closed.html#952">952</a>,
  and should be resolved when that issue is resolved.
  </p>
  <p>
*************** Move to NAD.
*** 30148,30166 ****
  
  <hr>
  <h3><a name="952"></a>952. Various threading bugs #2</h3>
! <p><b>Section:</b> 20.11.3.7 [time.duration.cast] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.duration.cast">issues</a> in [time.duration.cast].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.11.3.7 [time.duration.cast] specifies an implementation and imposes
  requirements in text (and the implementation doesn't satisfy all of the
  text requirements). Pick one.
  </p>
  
  <p>
! This issue is related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>.
  </p>
  
  <p><i>[
--- 24178,24196 ----
  
  <hr>
  <h3><a name="952"></a>952. Various threading bugs #2</h3>
! <p><b>Section:</b> 20.12.5.7 [time.duration.cast] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration.cast">issues</a> in [time.duration.cast].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.12.5.7 [time.duration.cast] specifies an implementation and imposes
  requirements in text (and the implementation doesn't satisfy all of the
  text requirements). Pick one.
  </p>
  
  <p>
! This issue is related to <a href="lwg-closed.html#946">946</a>.
  </p>
  
  <p><i>[
*************** Move to NAD Editorial.
*** 30202,30214 ****
  
  <hr>
  <h3><a name="955"></a>955. Various threading bugs #5</h3>
! <p><b>Section:</b> 20.11.1 [time.clock.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.req">issues</a> in [time.clock.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.11.1 [time.clock.req] requires that a clock type have a member
  typedef named <tt>time_point</tt> that names an instantiation of the
  template <tt>time_point</tt>, and a member named <tt>duration</tt> that
  names an instantiation of the template <tt>duration</tt>. This mixing of
--- 24232,24244 ----
  
  <hr>
  <h3><a name="955"></a>955. Various threading bugs #5</h3>
! <p><b>Section:</b> 20.12.3 [time.clock.req] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.req">issues</a> in [time.clock.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.12.3 [time.clock.req] requires that a clock type have a member
  typedef named <tt>time_point</tt> that names an instantiation of the
  template <tt>time_point</tt>, and a member named <tt>duration</tt> that
  names an instantiation of the template <tt>duration</tt>. This mixing of
*************** For example, here is code that I once wr
*** 30245,30251 ****
  this facility:
  </p>
  
! <blockquote><pre>template &lt;class Clock, class Duration&gt;
  void do_until(const std::chrono::<b>time_point</b>&lt;Clock, Duration&gt;&amp; t)
  {
      typename Clock::<b>time_point now</b> = Clock::now();
--- 24275,24282 ----
  this facility:
  </p>
  
! <blockquote><pre>
! template &lt;class Clock, class Duration&gt;
  void do_until(const std::chrono::<b>time_point</b>&lt;Clock, Duration&gt;&amp; t)
  {
      typename Clock::<b>time_point now</b> = Clock::now();
*************** I see no rationale to require the client
*** 30272,30287 ****
  of those declarations.  It seems overly burdensome on the author of <tt>do_until</tt>:
  </p>
  
! <blockquote><pre>template &lt;class Clock, class Duration&gt;
  void do_until(const std::chrono::<b>time_point</b>&lt;Clock, Duration&gt;&amp; t)
  {
!     typename Clock::<b>time_point<font color="#C80000">_type</font></b> now = Clock::now();
      if (t &gt; now)
      {
          typedef typename std::common_type
          &lt;
              Duration,
!             typename std::chrono::system_clock::<b>duration<font color="#C80000">_type</font></b>
          &gt;::type CD;
          typedef std::chrono::<b>duration</b>&lt;double, std::nano&gt; ID;
  
--- 24303,24319 ----
  of those declarations.  It seems overly burdensome on the author of <tt>do_until</tt>:
  </p>
  
! <blockquote><pre>
! template &lt;class Clock, class Duration&gt;
  void do_until(const std::chrono::<b>time_point</b>&lt;Clock, Duration&gt;&amp; t)
  {
!     typename Clock::<b>time_point<span style="color:#C80000">_type</span></b> now = Clock::now();
      if (t &gt; now)
      {
          typedef typename std::common_type
          &lt;
              Duration,
!             typename std::chrono::system_clock::<b>duration<span style="color:#C80000">_type</span></b>
          &gt;::type CD;
          typedef std::chrono::<b>duration</b>&lt;double, std::nano&gt; ID;
  
*************** Additionally I'm fairly certain that thi
*** 30299,30307 ****
  If it had, it would have been discovered that it is incomplete.  <tt>time_point</tt>
  also has a nested type (purposefully) named <tt>duration</tt>.
  </p>
! <blockquote>
  That is, the current proposed wording would put the WP into an inconsistent state.
! </blockquote>
  <p>
  In contrast,
  the current WP has been implemented and I've received very favorable feedback
--- 24331,24339 ----
  If it had, it would have been discovered that it is incomplete.  <tt>time_point</tt>
  also has a nested type (purposefully) named <tt>duration</tt>.
  </p>
! <blockquote><p>
  That is, the current proposed wording would put the WP into an inconsistent state.
! </p></blockquote>
  <p>
  In contrast,
  the current WP has been implemented and I've received very favorable feedback
*************** with the precedent of using the same nam
*** 30343,30349 ****
  class representing an identical concept.
  </p>
  
! <blockquote><pre>template&lt;class Category, class T, class Distance = ptrdiff_t,
           class Pointer = T*, class Reference = T&amp;&gt;
  struct <b>iterator</b>
  {
--- 24375,24382 ----
  class representing an identical concept.
  </p>
  
! <blockquote><pre>
! template&lt;class Category, class T, class Distance = ptrdiff_t,
           class Pointer = T*, class Reference = T&amp;&gt;
  struct <b>iterator</b>
  {
*************** names also having related meaning at nam
*** 30378,30384 ****
  Would we really be doing programmers a favor by renaming these nested types?
  </p>
  
! <blockquote><pre>template &lt;ValueType T, Allocator Alloc = allocator&lt;T&gt; &gt;
      requires NothrowDestructible&lt;T&gt;
  class list
  {
--- 24411,24418 ----
  Would we really be doing programmers a favor by renaming these nested types?
  </p>
  
! <blockquote><pre>
! template &lt;ValueType T, Allocator Alloc = allocator&lt;T&gt; &gt;
      requires NothrowDestructible&lt;T&gt;
  class list
  {
*************** reducing readability.
*** 30401,30430 ****
  ]</i></p>
  
  
! <blockquote>
  Mark as NAD.  No concensus for changing the WP.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.11 [time]:
  </p>
  
! <blockquote><pre>...
  template &lt;class Clock, class Duration = typename Clock::duration<ins>_type</ins>&gt; class time_point;
  ...
  </pre></blockquote>
  
  <p>
! Change 20.11.1 [time.clock.req]:
  </p>
  
  <blockquote>
  <table border="1">
  <caption>Table 45 -- Clock requirements</caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
--- 24435,24465 ----
  ]</i></p>
  
  
! <blockquote><p>
  Mark as NAD.  No concensus for changing the WP.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.12 [time]:
  </p>
  
! <blockquote><pre>
! ...
  template &lt;class Clock, class Duration = typename Clock::duration<ins>_type</ins>&gt; class time_point;
  ...
  </pre></blockquote>
  
  <p>
! Change 20.12.3 [time.clock.req]:
  </p>
  
  <blockquote>
  <table border="1">
  <caption>Table 45 -- Clock requirements</caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
*************** representing the current point
*** 30462,30472 ****
  in time.
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
! Change 20.11.5.1 [time.clock.system]:
  </p>
  
  <blockquote>
--- 24497,24507 ----
  in time.
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
! Change 20.12.7.1 [time.clock.system]:
  </p>
  
  <blockquote>
*************** Change 20.11.5.1 [time.clock.system]:
*** 30474,30480 ****
  -1- Objects of class <tt>system_clock</tt> represent wall clock time from the system-wide realtime clock.
  </p>
  
! <blockquote><pre>class system_clock { 
  public: 
    typedef <i>see below</i> rep; 
    typedef ratio&lt;<i>unspecified</i>, <i>unspecified</i>&gt; period; 
--- 24509,24516 ----
  -1- Objects of class <tt>system_clock</tt> represent wall clock time from the system-wide realtime clock.
  </p>
  
! <blockquote><pre>
! class system_clock { 
  public: 
    typedef <i>see below</i> rep; 
    typedef ratio&lt;<i>unspecified</i>, <i>unspecified</i>&gt; period; 
*************** public:
*** 30494,30523 ****
  -2- <tt>system_clock::duration<ins>_type</ins>::min() &lt; system_clock::duration<ins>_type</ins>::zero()</tt> shall be <tt>true</tt>.
  </p>
  
! <pre>time_t to_time_t(const time_point<ins>_type</ins>&amp; t);
  </pre>
  
! <blockquote>
  -3- <i>Returns:</i> A <tt>time_t</tt> object that represents the same
  point in time as <tt>t</tt> when both values are truncated to the
  coarser of the precisions of <tt>time_t</tt> and <tt>time_point<ins>_type</ins></tt>.
! </blockquote>
  
! <pre><tt>time_point<ins>_type</ins></tt> from_time_t(time_t t);
  </pre>
  
! <blockquote>
  -4- <i>Returns:</i> A <tt>time_point<ins>_type</ins></tt> object that represents the same point
  in time as <tt>t</tt> when both values are truncated to the coarser of the
  precisions of <tt>time_t</tt> and <tt>time_point<ins>_type</ins></tt>.
! </blockquote>
  </blockquote>
  
  <p>
  Change X [time.clock.monotonic]:
  </p>
  
! <blockquote><pre>class monotonic_clock { 
  public: 
    typedef <i>unspecified</i>                                rep; 
    typedef ratio&lt;<i>unspecified</i> , <i>unspecified</i>&gt;           period; 
--- 24530,24562 ----
  -2- <tt>system_clock::duration<ins>_type</ins>::min() &lt; system_clock::duration<ins>_type</ins>::zero()</tt> shall be <tt>true</tt>.
  </p>
  
! <pre>
! time_t to_time_t(const time_point<ins>_type</ins>&amp; t);
  </pre>
  
! <blockquote><p>
  -3- <i>Returns:</i> A <tt>time_t</tt> object that represents the same
  point in time as <tt>t</tt> when both values are truncated to the
  coarser of the precisions of <tt>time_t</tt> and <tt>time_point<ins>_type</ins></tt>.
! </p></blockquote>
  
! <pre>
! <tt>time_point<ins>_type</ins></tt> from_time_t(time_t t);
  </pre>
  
! <blockquote><p>
  -4- <i>Returns:</i> A <tt>time_point<ins>_type</ins></tt> object that represents the same point
  in time as <tt>t</tt> when both values are truncated to the coarser of the
  precisions of <tt>time_t</tt> and <tt>time_point<ins>_type</ins></tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
  Change X [time.clock.monotonic]:
  </p>
  
! <blockquote><pre>
! class monotonic_clock { 
  public: 
    typedef <i>unspecified</i>                                rep; 
    typedef ratio&lt;<i>unspecified</i> , <i>unspecified</i>&gt;           period; 
*************** public:
*** 30530,30539 ****
  </pre></blockquote>
  
  <p>
! Change 20.11.5.3 [time.clock.hires]:
  </p>
  
! <blockquote><pre>class high_resolution_clock { 
  public: 
    typedef <i>unspecified</i>                                rep; 
    typedef ratio&lt;<i>unspecified</i> , <i>unspecified</i>&gt;           period; 
--- 24569,24579 ----
  </pre></blockquote>
  
  <p>
! Change 20.12.7.3 [time.clock.hires]:
  </p>
  
! <blockquote><pre>
! class high_resolution_clock { 
  public: 
    typedef <i>unspecified</i>                                rep; 
    typedef ratio&lt;<i>unspecified</i> , <i>unspecified</i>&gt;           period; 
*************** public:
*** 30551,30617 ****
  
  
  <hr>
- <h3><a name="958"></a>958. Various threading bugs #8</h3>
- <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- 30.5.1 [thread.condition.condvar]: the specification for <tt>wait_for</tt>
- with no predicate has an effects clause that says it calls <tt>wait_until</tt>,
- and a returns clause that sets out in words how to determine the return
- value. Is this description of the return value subtly different from the
- description of the value returned by <tt>wait_until</tt>? Or should the effects
- clause and the returns clause be merged?
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- 
- <blockquote>
- Move to open. Associate with LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a> and any other monotonic-clock
- related issues.
- </blockquote>
- 
- <p><i>[
- 2009-08-01 Howard adds:
- ]</i></p>
- 
- 
- <blockquote>
- I believe that <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a> (currently Ready) addresses this issue, and
- that this issue should be marked NAD, solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a> (assuming
- it moves to WP).
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Mark as NAD Editorial, solved by resolution of Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- </p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="959"></a>959. Various threading bugs #9</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.1 [thread.condition.condvar]: <tt>condition_variable::wait_for</tt>
--- 24591,24601 ----
  
  
  <hr>
  <h3><a name="959"></a>959. Various threading bugs #9</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.1 [thread.condition.condvar]: <tt>condition_variable::wait_for</tt>
*************** Summit:
*** 30625,30654 ****
  ]</i></p>
  
  
! <blockquote>
! Move to open. Associate with LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a> and any other monotonic-clock
  related issues.
! </blockquote>
  
  <p><i>[
  2009-08-01 Howard adds:
  ]</i></p>
  
  
! <blockquote>
! I believe that <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a> (currently Ready) addresses this issue, and
! that this issue should be marked NAD, solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a> (assuming
  it moves to WP).
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Leave open, but expect to be fixed by N2969 revision that Detlef is writing.
! </blockquote>
  
  <p><i>[
  2009-11-18 Moved to Tentatively NAD after 5 positive votes on c++std-lib.
--- 24609,24638 ----
  ]</i></p>
  
  
! <blockquote><p>
! Move to open. Associate with LWG <a href="lwg-defects.html#859">859</a> and any other monotonic-clock
  related issues.
! </p></blockquote>
  
  <p><i>[
  2009-08-01 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
! I believe that <a href="lwg-defects.html#859">859</a> (currently Ready) addresses this issue, and
! that this issue should be marked NAD, solved by <a href="lwg-defects.html#859">859</a> (assuming
  it moves to WP).
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Leave open, but expect to be fixed by N2969 revision that Detlef is writing.
! </p></blockquote>
  
  <p><i>[
  2009-11-18 Moved to Tentatively NAD after 5 positive votes on c++std-lib.
*************** Rationale added below.
*** 30674,30737 ****
  
  
  <hr>
- <h3><a name="961"></a>961. Various threading bugs #11</h3>
- <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a></p>
- <p><b>Discussion:</b></p>
- <p>
- 30.4.1 [thread.mutex.requirements] describes required member
- functions of mutex types, and requires that they throw exceptions under
- certain circumstances. This is overspecified. User-defined types can
- abort on such errors without affecting the operation of templates
- supplied by standard-library.
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- <blockquote>
- Move to open. Related to conceptualization and should probably be
- tackled as part of that.
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Would be OK to leave it as is for time constraints, could loosen later.
- </p>
- 
- <p>
- Mark as NAD Future.
- </p>
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- </p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="969"></a>969. What happened to Library Issue 475?</h3>
! <p><b>Section:</b> 25.2.4 [alg.foreach] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2009-01-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.foreach">issues</a> in [alg.foreach].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Library Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a> has CD1 status, but the non-normative note in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
  was removed in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>
--- 24658,24671 ----
  
  
  <hr>
  <h3><a name="969"></a>969. What happened to Library Issue 475?</h3>
! <p><b>Section:</b> 25.2.4 [alg.foreach] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2009-01-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.foreach">issues</a> in [alg.foreach].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Library Issue <a href="lwg-defects.html#475">475</a> has CD1 status, but the non-normative note in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
  was removed in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>
*************** was removed in
*** 30742,30750 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 24676,24684 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Restore the non-normative note. It might
*** 30758,30766 ****
  
  <hr>
  <h3><a name="971"></a>971. Spurious diagnostic conversion function</h3>
! <p><b>Section:</b> 19.5.2.5 [syserr.errcode.nonmembers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-01-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Anthony Williams raised the question in c++std-lib-22987 "why is there
--- 24692,24700 ----
  
  <hr>
  <h3><a name="971"></a>971. Spurious diagnostic conversion function</h3>
! <p><b>Section:</b> 19.5.2.5 [syserr.errcode.nonmembers] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-01-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Anthony Williams raised the question in c++std-lib-22987 "why is there
*************** Post Summit:
*** 30779,30809 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend Review.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  The designer of the facility (Christopher Kohlhoff)
  strongly disagrees that there is an issue here,
  and especially disagrees with the proposed resolution.
  Bill would prefer to be conservative and not apply this proposed resolution.
  Move to Open, and recommend strong consideration for NAD status.
! </blockquote>
  
  <p><i>[
  2009-05-21 Beman adds:
  ]</i></p>
  
  
! <blockquote>
  My mistake. Christopher and Bill are correct and the issue should be
  NAD. The function is needed by users.
! </blockquote>
  
  <p><i>[
  2009-07-21 Christopher Kohlhoff adds rationale for <tt>make_error_code</tt>:
--- 24713,24743 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Review.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  The designer of the facility (Christopher Kohlhoff)
  strongly disagrees that there is an issue here,
  and especially disagrees with the proposed resolution.
  Bill would prefer to be conservative and not apply this proposed resolution.
  Move to Open, and recommend strong consideration for NAD status.
! </p></blockquote>
  
  <p><i>[
  2009-05-21 Beman adds:
  ]</i></p>
  
  
! <blockquote><p>
  My mistake. Christopher and Bill are correct and the issue should be
  NAD. The function is needed by users.
! </p></blockquote>
  
  <p><i>[
  2009-07-21 Christopher Kohlhoff adds rationale for <tt>make_error_code</tt>:
*************** Users (and indeed library implementers)
*** 30816,30822 ****
  <tt>errc</tt> codes in portable code. For example:
  </p>
  
! <blockquote><pre>void do_foo(error_code&amp; ec)
  {
  #if defined(_WIN32)
    // Windows implementation ...
--- 24750,24757 ----
  <tt>errc</tt> codes in portable code. For example:
  </p>
  
! <blockquote><pre>
! void do_foo(error_code&amp; ec)
  {
  #if defined(_WIN32)
    // Windows implementation ...
*************** Users (and indeed library implementers)
*** 30835,30843 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD.
! </blockquote>
  
  
  
--- 24770,24778 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD.
! </p></blockquote>
  
  
  
*************** Change System error support 19.5 [syserr
*** 30847,30853 ****
  synopsis, as indicated:
  </p>
  
! <blockquote><pre><del>error_code make_error_code(errc e);</del>
  error_condition make_error_condition(errc e);
  </pre></blockquote>
  
--- 24782,24789 ----
  synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! <del>error_code make_error_code(errc e);</del>
  error_condition make_error_condition(errc e);
  </pre></blockquote>
  
*************** Delete from Class error_code non-member
*** 30856,30867 ****
  19.5.2.5 [syserr.errcode.nonmembers]:
  </p>
  
! <blockquote><pre><del>error_code make_error_code(errc e);</del>
  </pre>
! <blockquote>
  <del><i>Returns:</i> <tt>error_code(static_cast&lt;int&gt;(e),
  generic_category)</tt>.</del>
! </blockquote>
  </blockquote>
  
  
--- 24792,24804 ----
  19.5.2.5 [syserr.errcode.nonmembers]:
  </p>
  
! <blockquote><pre>
! <del>error_code make_error_code(errc e);</del>
  </pre>
! <blockquote><p>
  <del><i>Returns:</i> <tt>error_code(static_cast&lt;int&gt;(e),
  generic_category)</tt>.</del>
! </p></blockquote>
  </blockquote>
  
  
*************** generic_category)</tt>.</del>
*** 30871,30881 ****
  
  <hr>
  <h3><a name="972"></a>972. The term "Assignable" undefined but still in use</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Previous versions of the Draft had a table, defining the Assignable 
--- 24808,24818 ----
  
  <hr>
  <h3><a name="972"></a>972. The term "Assignable" undefined but still in use</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Previous versions of the Draft had a table, defining the Assignable 
*************** Are all of those instances of "<tt>Assig
*** 30898,30906 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 24835,24843 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to NAD Editorial.
*** 30908,30960 ****
  <p>
  Change Exception Propagation 18.8.5 [propagation]:
  </p>
! <blockquote>
  <tt>exception_ptr</tt> shall be <tt>DefaultConstructible</tt>, <tt>CopyConstructible</tt>,
  <tt><ins>Copy</ins>Assignable</tt> and <tt>EqualityComparable</tt>.
! </blockquote>
  
  <p>
! Change Class template reference_wrapper 20.8.4 [refwrap]:
  </p>
! <blockquote>
! <tt>reference_wrapper&lt;T&gt;</tt> is a <tt>CopyConstructible</tt> and <tt><ins>Copy</ins>Assignable</tt> wrapper around a reference to an object of type <tt>T</tt>.
! </blockquote>
  <p>
! Change Placeholders 20.8.10.1.3 [func.bind.place]:
  </p>
! <blockquote>
! It is implementation defined whether placeholder types are <tt><ins>Copy</ins>Assignable</tt>. <tt><ins>Copy</ins>Assignable</tt> placeholders' copy assignment operators shall not throw exceptions.
! </blockquote>
  <p>
! Change Class template shared_ptr 20.9.10.2 [util.smartptr.shared]:
  </p>
! <blockquote>
  Specializations of <tt>shared_ptr</tt> shall be <tt>CopyConstructible</tt>, <tt><ins>Copy</ins>Assignable</tt>, and <tt>LessThanComparable</tt>...
! </blockquote>
  <p>
! Change Class template weak_ptr 20.9.10.3 [util.smartptr.weak]:
  </p>
! <blockquote>
  Specializations of <tt>weak_ptr</tt> shall be <tt>CopyConstructible</tt>, <tt><ins>Copy</ins>Assignable</tt>, and <tt>LessThanComparable</tt>...
! </blockquote>
  <p>
  Change traits typedefs 21.2.2 [char.traits.typedefs] (note: including deletion of reference to 23.1!):
  </p>
! <blockquote>
! <i>Requires:</i> <tt>state_type</tt> shall meet the requirements of <tt><ins>Copy</ins>Assignable</tt><del> (23.1)</del>, <tt>CopyConstructible</tt> (20.1.8), and <tt>DefaultConstructible</tt> types.
! </blockquote>
  <p>
  Change Class seed_seq 26.5.7.1 [rand.util.seedseq] (note again: including deletion of reference to 23.1!):
  </p>
! <blockquote>
  In addition to the requirements set forth below, instances of
  <tt>seed_seq</tt> shall meet the requirements of <tt>CopyConstructible</tt> (20.1.8) and of <tt><ins>Copy</ins>Assignable</tt><del> (23.1)</del>.
! </blockquote>
  
  <p>
  Note: The proposed resolution of this issue does not deal with the
! instance of the term "Assignable" in D.12.1 [auto.ptr], as this is dealt
! with more specifically by LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, "<tt>auto_ptr</tt> characteristics", submitted
  by Maarten Hilferink.
  </p>
  
--- 24845,24900 ----
  <p>
  Change Exception Propagation 18.8.5 [propagation]:
  </p>
! <blockquote><p>
  <tt>exception_ptr</tt> shall be <tt>DefaultConstructible</tt>, <tt>CopyConstructible</tt>,
  <tt><ins>Copy</ins>Assignable</tt> and <tt>EqualityComparable</tt>.
! </p></blockquote>
  
  <p>
! Change Class template reference_wrapper 20.9.4 [refwrap]:
  </p>
! <blockquote><p>
! <tt>reference_wrapper&lt;T&gt;</tt> is a <tt>CopyConstructible</tt> and <tt><ins>Copy</ins>Assignable</tt> 
! wrapper around a reference to an object of type <tt>T</tt>.
! </p></blockquote>
  <p>
! Change Placeholders 20.9.10.4 [func.bind.place]:
  </p>
! <blockquote><p>
! It is implementation defined whether placeholder types are <tt><ins>Copy</ins>Assignable</tt>. 
! <tt><ins>Copy</ins>Assignable</tt> placeholders' copy assignment operators shall not throw exceptions.
! </p></blockquote>
  <p>
! Change Class template shared_ptr 20.8.2.2 [util.smartptr.shared]:
  </p>
! <blockquote><p>
  Specializations of <tt>shared_ptr</tt> shall be <tt>CopyConstructible</tt>, <tt><ins>Copy</ins>Assignable</tt>, and <tt>LessThanComparable</tt>...
! </p></blockquote>
  <p>
! Change Class template weak_ptr 20.8.2.3 [util.smartptr.weak]:
  </p>
! <blockquote><p>
  Specializations of <tt>weak_ptr</tt> shall be <tt>CopyConstructible</tt>, <tt><ins>Copy</ins>Assignable</tt>, and <tt>LessThanComparable</tt>...
! </p></blockquote>
  <p>
  Change traits typedefs 21.2.2 [char.traits.typedefs] (note: including deletion of reference to 23.1!):
  </p>
! <blockquote><p>
! <i>Requires:</i> <tt>state_type</tt> shall meet the requirements of <tt><ins>Copy</ins>Assignable</tt><del> 
! (23.1)</del>, <tt>CopyConstructible</tt> (20.1.8), and <tt>DefaultConstructible</tt> types.
! </p></blockquote>
  <p>
  Change Class seed_seq 26.5.7.1 [rand.util.seedseq] (note again: including deletion of reference to 23.1!):
  </p>
! <blockquote><p>
  In addition to the requirements set forth below, instances of
  <tt>seed_seq</tt> shall meet the requirements of <tt>CopyConstructible</tt> (20.1.8) and of <tt><ins>Copy</ins>Assignable</tt><del> (23.1)</del>.
! </p></blockquote>
  
  <p>
  Note: The proposed resolution of this issue does not deal with the
! instance of the term "Assignable" in X [auto.ptr], as this is dealt
! with more specifically by LWG <a href="lwg-closed.html#973">973</a>, "<tt>auto_ptr</tt> characteristics", submitted
  by Maarten Hilferink.
  </p>
  
*************** by Maarten Hilferink.
*** 30965,30977 ****
  
  <hr>
  <h3><a name="973"></a>973. auto_ptr characteristics</h3>
! <p><b>Section:</b> D.12.1 [auto.ptr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Maarten Hilferink <b>Opened:</b> 2009-01-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! I think that the Note of D.12.1 [auto.ptr], paragraph 3 needs a rewrite 
  since "Assignable" is no longer defined as a concept. 
  The relationship of <tt>auto_ptr</tt> with the new <tt>CopyAssignable</tt>, <tt>MoveAssignable</tt>,
   and <tt>MoveConstructible</tt> concepts should be clarified.
--- 24905,24917 ----
  
  <hr>
  <h3><a name="973"></a>973. auto_ptr characteristics</h3>
! <p><b>Section:</b> X [auto.ptr] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Maarten Hilferink <b>Opened:</b> 2009-01-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! I think that the Note of X [auto.ptr], paragraph 3 needs a rewrite 
  since "Assignable" is no longer defined as a concept. 
  The relationship of <tt>auto_ptr</tt> with the new <tt>CopyAssignable</tt>, <tt>MoveAssignable</tt>,
   and <tt>MoveConstructible</tt> concepts should be clarified.
*************** Furthermore, since the use of <tt>auto_p
*** 30983,31000 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the intent of the proposed resolution.
  Move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change D.12.1 [auto.ptr], paragraph 3:
  </p>
  
! <blockquote>
  The <tt>auto_ptr</tt> provides a semantics of strict ownership. An
  <tt>auto_ptr</tt> owns the ob ject it holds a pointer to. Copying an
  <tt>auto_ptr</tt> copies the pointer and transfers ownership to the
--- 24923,24940 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the intent of the proposed resolution.
  Move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change X [auto.ptr], paragraph 3:
  </p>
  
! <blockquote><p>
  The <tt>auto_ptr</tt> provides a semantics of strict ownership. An
  <tt>auto_ptr</tt> owns the ob ject it holds a pointer to. Copying an
  <tt>auto_ptr</tt> copies the pointer and transfers ownership to the
*************** allocated memory from a function.
*** 31009,31112 ****
  standard library container elements and thus instantiating a standard
  library container with an <tt>auto_ptr</tt> results in undefined
  behavior.</del>
! 
  <ins>Instances of <tt>auto_ptr</tt> shall
  meet the <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt>
  requirements, but do not meet the <tt>CopyConstructible</tt> and
  <tt>CopyAssignable</tt> requirements.</ins>
  -- <i>end note</i>]
! </blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="976"></a>976. Class template std::stack should be movable</h3>
! <p><b>Section:</b> 23.5.3.1 [stack.defn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-02-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The synopsis given in 23.5.3.1 [stack.defn] does not show up
! </p>
! 
! <blockquote><pre>requires MoveConstructible&lt;Cont&gt; stack(stack&amp;&amp;);
! requires MoveAssignable&lt;Cont&gt; stack&amp; operator=(stack&amp;&amp;);
! </pre></blockquote>
! 
! <p>
! although the other container adaptors do provide corresponding
! members.
! </p>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote>
! <p>
! We agree with the proposed resolution.
! </p>
! <p>
! Move to Tentatively Ready.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-07 Frankfurt
! ]</i></p>
! 
! 
! <blockquote>
! Moved from Tentatively Ready to Open only because the wording needs to be
! tweaked for concepts removal.
! </blockquote>
! 
! <p><i>[
! 2009-08-18 Daniel updates the wording and Howard sets to Review.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-08-23 Howard adds:
! ]</i></p>
! 
! 
! <blockquote>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a> also adds these move members using an editorially different
! style.
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! Mark NAD Editorial, solved by issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! In the class stack synopsis of 23.5.3.1 [stack.defn] insert:
! </p>
! 
! <blockquote><pre>template &lt;class T, class Container = deque&lt;T&gt; &gt;
! class stack {
!   [..]
!   explicit stack(const Container&amp;);
!   explicit stack(Container&amp;&amp; = Container());
!   <ins>stack(stack&amp;&amp; s) : c(std::move(s.c)) {}</ins>
!   <ins>stack&amp; operator=(stack&amp;&amp; s) { c = std::move(s.c); return *this; }</ins>
!   [..]
! };
! </pre></blockquote>
! 
! 
! 
  
  
  
--- 24949,24961 ----
  standard library container elements and thus instantiating a standard
  library container with an <tt>auto_ptr</tt> results in undefined
  behavior.</del>
! <p/>
  <ins>Instances of <tt>auto_ptr</tt> shall
  meet the <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt>
  requirements, but do not meet the <tt>CopyConstructible</tt> and
  <tt>CopyAssignable</tt> requirements.</ins>
  -- <i>end note</i>]
! </p></blockquote>
  
  
  
*************** class stack {
*** 31114,31136 ****
  
  <hr>
  <h3><a name="977"></a>977. insert iterators inefficient for expensive to move types</h3>
! <p><b>Section:</b> 24.5.2 [insert.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#insert.iterators">issues</a> in [insert.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The new concepts for the insert iterators mandate an extra copy when
  inserting an lvalue:
  </p>
  
! <blockquote><pre>requires CopyConstructible&lt;Cont::value_type&gt;
    back_insert_iterator&lt;Cont&gt;&amp; 
    operator=(const Cont::value_type&amp; value);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <tt>push_back(*container, <b>Cont::value_type(</b>value<b>)</b>);</tt>
! </blockquote>
  </blockquote>
  
  <p>
--- 24963,24986 ----
  
  <hr>
  <h3><a name="977"></a>977. insert iterators inefficient for expensive to move types</h3>
! <p><b>Section:</b> 24.5.2 [insert.iterators] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#insert.iterators">issues</a> in [insert.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The new concepts for the insert iterators mandate an extra copy when
  inserting an lvalue:
  </p>
  
! <blockquote><pre>
! requires CopyConstructible&lt;Cont::value_type&gt;
    back_insert_iterator&lt;Cont&gt;&amp; 
    operator=(const Cont::value_type&amp; value);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <tt>push_back(*container, <b>Cont::value_type(</b>value<b>)</b>);</tt>
! </p></blockquote>
  </blockquote>
  
  <p>
*************** The reason is to convert <tt>value</tt>
*** 31139,31145 ****
  rvalues:
  </p>
  
! <blockquote><pre>concept BackInsertionContainer&lt;typename C&gt; : Container&lt;C&gt; { 
    void push_back(C&amp;, value_type&amp;&amp;); 
  }
  </pre></blockquote>
--- 24989,24996 ----
  rvalues:
  </p>
  
! <blockquote><pre>
! concept BackInsertionContainer&lt;typename C&gt; : Container&lt;C&gt; { 
    void push_back(C&amp;, value_type&amp;&amp;); 
  }
  </pre></blockquote>
*************** the client can pass in the parameter typ
*** 31155,31161 ****
  what is already done for the <tt>OutputIterator</tt> concept:
  </p>
  
! <blockquote><pre>concept BackInsertionContainer&lt;typename C, typename Value = C::value_type&amp;&amp;&gt;
    : Container&lt;C&gt; { 
       void push_back(C&amp;, Value); 
  }
--- 25006,25013 ----
  what is already done for the <tt>OutputIterator</tt> concept:
  </p>
  
! <blockquote><pre>
! concept BackInsertionContainer&lt;typename C, typename Value = C::value_type&amp;&amp;&gt;
    : Container&lt;C&gt; { 
       void push_back(C&amp;, Value); 
  }
*************** what is already done for the <tt>OutputI
*** 31165,31178 ****
  This allows the assignment operator to be adjusted appropriately:
  </p>
  
! <blockquote><pre>requires BackInsertionContainer&lt;Cont, Cont::value_type const&amp;&gt; &amp;&amp;
           CopyConstructible&lt;Cont::value_type&gt;
    back_insert_iterator&lt;Cont&gt;&amp; 
    operator=(const Cont::value_type&amp; value);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <tt>push_back(*container, value);</tt>
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 25017,25031 ----
  This allows the assignment operator to be adjusted appropriately:
  </p>
  
! <blockquote><pre>
! requires BackInsertionContainer&lt;Cont, Cont::value_type const&amp;&gt; &amp;&amp;
           CopyConstructible&lt;Cont::value_type&gt;
    back_insert_iterator&lt;Cont&gt;&amp; 
    operator=(const Cont::value_type&amp; value);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <tt>push_back(*container, value);</tt>
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** Committee Draft is issued.
*** 31207,31215 ****
  ]</i></p>
  
  
! <blockquote>
  NAD, solved by the removal of concepts.
! </blockquote>
  
  
  
--- 25060,25068 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD, solved by the removal of concepts.
! </p></blockquote>
  
  
  
*************** Change  [container.concepts.free]:
*** 31219,31225 ****
  </p>
  
  <blockquote>
! <pre>concept FrontInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : Container&lt;C&gt; { 
    void push_front(C&amp;, <del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  
--- 25072,25079 ----
  </p>
  
  <blockquote>
! <pre>
! concept FrontInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : Container&lt;C&gt; { 
    void push_front(C&amp;, <del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  
*************** Change  [container.concepts.free]:
*** 31231,31237 ****
  
  <p>...</p>
  
! <pre>concept BackInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : Container&lt;C&gt; { 
    void push_back(C&amp;, <del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  }
--- 25085,25092 ----
  
  <p>...</p>
  
! <pre>
! concept BackInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : Container&lt;C&gt; { 
    void push_back(C&amp;, <del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  }
*************** Change  [container.concepts.free]:
*** 31239,31245 ****
  
  <p>...</p>
  
! <pre>concept InsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : Container&lt;C&gt; { 
    iterator insert(C&amp;, const_iterator, <del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  
--- 25094,25101 ----
  
  <p>...</p>
  
! <pre>
! concept InsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : Container&lt;C&gt; { 
    iterator insert(C&amp;, const_iterator, <del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  
*************** Change  [container.concepts.member]:
*** 31256,31262 ****
  </p>
  
  <blockquote>
! <pre>auto concept MemberFrontInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : MemberContainer&lt;C&gt; { 
    void C::push_front(<del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  
--- 25112,25119 ----
  </p>
  
  <blockquote>
! <pre>
! auto concept MemberFrontInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : MemberContainer&lt;C&gt; { 
    void C::push_front(<del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  
*************** Change  [container.concepts.member]:
*** 31268,31274 ****
  
  <p>...</p>
  
! <pre>auto concept MemberBackInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : MemberContainer&lt;C&gt; { 
    void C::push_back(<del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  }
--- 25125,25132 ----
  
  <p>...</p>
  
! <pre>
! auto concept MemberBackInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : MemberContainer&lt;C&gt; { 
    void C::push_back(<del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  }
*************** Change  [container.concepts.member]:
*** 31276,31282 ****
  
  <p>...</p>
  
! <pre>auto concept MemberInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : MemberContainer&lt;C&gt; { 
    iterator C::insert(const_iterator, <del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  
--- 25134,25141 ----
  
  <p>...</p>
  
! <pre>
! auto concept MemberInsertionContainer&lt;typename C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt;
      : MemberContainer&lt;C&gt; { 
    iterator C::insert(const_iterator, <del>value_type&amp;&amp;</del> <ins>Value</ins>); 
  
*************** Change  [container.concepts.maps]:
*** 31292,31298 ****
  </p>
  
  <blockquote>
! <pre>template &lt;MemberFrontInsertionContainer C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt; 
  concept_map FrontInsertionContainer&lt;C<ins>, Value</ins>&gt; { 
    typedef Container&lt;C&gt;::value_type value_type;
  
--- 25151,25158 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;MemberFrontInsertionContainer C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt; 
  concept_map FrontInsertionContainer&lt;C<ins>, Value</ins>&gt; { 
    typedef Container&lt;C&gt;::value_type value_type;
  
*************** concept_map FrontInsertionContainer&lt;C
*** 31302,31308 ****
  
  <p>...</p>
  
! <pre>template &lt;MemberBackInsertionContainer C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt; 
  concept_map BackInsertionContainer&lt;C<ins>, Value</ins>&gt; { 
    typedef Container&lt;C&gt;::value_type value_type;
  
--- 25162,25169 ----
  
  <p>...</p>
  
! <pre>
! template &lt;MemberBackInsertionContainer C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt; 
  concept_map BackInsertionContainer&lt;C<ins>, Value</ins>&gt; { 
    typedef Container&lt;C&gt;::value_type value_type;
  
*************** concept_map BackInsertionContainer&lt;C<
*** 31312,31318 ****
  
  <p>...</p>
  
! <pre>template &lt;MemberInsertionContainer C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt; 
  concept_map InsertionContainer&lt;C<ins>, Value</ins>&gt; { 
    typedef Container&lt;C&gt;::value_type value_type;
    Container&lt;C&gt;::iterator insert(C&amp; c, Container&lt;C&gt;::const_iterator i, <del>value_type&amp;&amp;</del> <ins>Value</ins> v) 
--- 25173,25180 ----
  
  <p>...</p>
  
! <pre>
! template &lt;MemberInsertionContainer C<ins>, typename Value = C::value_type&amp;&amp;</ins>&gt; 
  concept_map InsertionContainer&lt;C<ins>, Value</ins>&gt; { 
    typedef Container&lt;C&gt;::value_type value_type;
    Container&lt;C&gt;::iterator insert(C&amp; c, Container&lt;C&gt;::const_iterator i, <del>value_type&amp;&amp;</del> <ins>Value</ins> v) 
*************** concept_map InsertionContainer&lt;C<ins>
*** 31326,31332 ****
  Change 24.5.2.1 [back.insert.iterator]:
  </p>
  
! <blockquote><pre>template &lt;BackInsertionContainer Cont&gt; 
  class back_insert_iterator {
    ...
    requires <ins>BackInsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
--- 25188,25195 ----
  Change 24.5.2.1 [back.insert.iterator]:
  </p>
  
! <blockquote><pre>
! template &lt;BackInsertionContainer Cont&gt; 
  class back_insert_iterator {
    ...
    requires <ins>BackInsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
*************** Change 24.5.2.2.2 [back.insert.iter.op=]
*** 31341,31361 ****
  </p>
  
  <blockquote>
! <pre>requires <ins>BackInsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
           <del>CopyConstructible&lt;Cont::value_type&gt;</del>
    back_insert_iterator&lt;Cont&gt;&amp; 
      operator=(const Cont::value_type&amp; value);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <tt>push_back(*container, <del>Cont::value_type(</del>value<del>)</del>);</tt>
! </blockquote>
  </blockquote>
  
  <p>
  Change 24.5.2.3 [front.insert.iterator]:
  </p>
  
! <blockquote><pre>template &lt;FrontInsertionContainer Cont&gt; 
  class front_insert_iterator {
    ...
    requires <ins>FrontInsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
--- 25204,25226 ----
  </p>
  
  <blockquote>
! <pre>
! requires <ins>BackInsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
           <del>CopyConstructible&lt;Cont::value_type&gt;</del>
    back_insert_iterator&lt;Cont&gt;&amp; 
      operator=(const Cont::value_type&amp; value);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <tt>push_back(*container, <del>Cont::value_type(</del>value<del>)</del>);</tt>
! </p></blockquote>
  </blockquote>
  
  <p>
  Change 24.5.2.3 [front.insert.iterator]:
  </p>
  
! <blockquote><pre>
! template &lt;FrontInsertionContainer Cont&gt; 
  class front_insert_iterator {
    ...
    requires <ins>FrontInsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
*************** Change 24.5.2.4.2 [front.insert.iter.op=
*** 31370,31390 ****
  </p>
  
  <blockquote>
! <pre>requires <ins>FrontInsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
           <del>CopyConstructible&lt;Cont::value_type&gt;</del>
    front_insert_iterator&lt;Cont&gt;&amp; 
      operator=(const Cont::value_type&amp; value);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <tt>push_front(*container, <del>Cont::value_type(</del>value<del>)</del>);</tt>
! </blockquote>
  </blockquote>
  
  <p>
  Change 24.5.2.5 [insert.iterator]:
  </p>
  
! <blockquote><pre>template &lt;InsertionContainer Cont&gt; 
  class insert_iterator {
    ...
    requires <ins>InsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
--- 25235,25257 ----
  </p>
  
  <blockquote>
! <pre>
! requires <ins>FrontInsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
           <del>CopyConstructible&lt;Cont::value_type&gt;</del>
    front_insert_iterator&lt;Cont&gt;&amp; 
      operator=(const Cont::value_type&amp; value);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <tt>push_front(*container, <del>Cont::value_type(</del>value<del>)</del>);</tt>
! </p></blockquote>
  </blockquote>
  
  <p>
  Change 24.5.2.5 [insert.iterator]:
  </p>
  
! <blockquote><pre>
! template &lt;InsertionContainer Cont&gt; 
  class insert_iterator {
    ...
    requires <ins>InsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
*************** Change 24.5.2.6.2 [insert.iter.op=]:
*** 31399,31405 ****
  </p>
  
  <blockquote>
! <pre>requires <ins>InsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
           <del>CopyConstructible&lt;Cont::value_type&gt;</del>
    insert_iterator&lt;Cont&gt;&amp; 
      operator=(const Cont::value_type&amp; value);
--- 25266,25273 ----
  </p>
  
  <blockquote>
! <pre>
! requires <ins>InsertionContainer&lt;Cont, const Cont::value_type&amp;&gt;</ins>
           <del>CopyConstructible&lt;Cont::value_type&gt;</del>
    insert_iterator&lt;Cont&gt;&amp; 
      operator=(const Cont::value_type&amp; value);
*************** Change 24.5.2.6.2 [insert.iter.op=]:
*** 31408,31414 ****
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>iter = insert(*container, iter, <del>Cont::value_type(</del>value<del>)</del>); 
  ++iter;
  </pre></blockquote>
  </blockquote>
--- 25276,25283 ----
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>
! iter = insert(*container, iter, <del>Cont::value_type(</del>value<del>)</del>); 
  ++iter;
  </pre></blockquote>
  </blockquote>
*************** Change 24.5.2.6.2 [insert.iter.op=]:
*** 31421,31429 ****
  
  <hr>
  <h3><a name="979"></a>979. Bad example</h3>
! <p><b>Section:</b> 24.5.3 [move.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  24.5.3 [move.iterators] has an incorrect example:
--- 25290,25299 ----
  
  <hr>
  <h3><a name="979"></a>979. Bad example</h3>
! <p><b>Section:</b> 24.5.3 [move.iterators] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#move.iterators">issues</a> in [move.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  24.5.3 [move.iterators] has an incorrect example:
*************** Change 24.5.2.6.2 [insert.iter.op=]:
*** 31434,31440 ****
  -2- [<i>Example:</i>
  </p>
  
! <blockquote><pre>set&lt;string&gt; s; 
  // populate the set s 
  vector&lt;string&gt; v1(s.begin(), s.end());          // copies strings into v1 
  vector&lt;string&gt; v2(make_move_iterator(s.begin()), 
--- 25304,25311 ----
  -2- [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! set&lt;string&gt; s; 
  // populate the set s 
  vector&lt;string&gt; v1(s.begin(), s.end());          // copies strings into v1 
  vector&lt;string&gt; v2(make_move_iterator(s.begin()), 
*************** references.
*** 31455,31463 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution. Move to NAD Editorial.
! </blockquote>
  
  
  
--- 25326,25334 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution. Move to NAD Editorial.
! </p></blockquote>
  
  
  
*************** Change 24.5.3 [move.iterators]/2:
*** 31471,31477 ****
  -2- [<i>Example:</i>
  </p>
  
! <blockquote><pre><del>set</del><ins>list</ins>&lt;string&gt; s; 
  // populate the <del>set</del><ins>list</ins> s 
  vector&lt;string&gt; v1(s.begin(), s.end());          // copies strings into v1 
  vector&lt;string&gt; v2(make_move_iterator(s.begin()), 
--- 25342,25349 ----
  -2- [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! <del>set</del><ins>list</ins>&lt;string&gt; s; 
  // populate the <del>set</del><ins>list</ins> s 
  vector&lt;string&gt; v1(s.begin(), s.end());          // copies strings into v1 
  vector&lt;string&gt; v2(make_move_iterator(s.begin()), 
*************** vector&lt;string&gt; v2(make_move_iterat
*** 31489,31498 ****
  
  <hr>
  <h3><a name="980"></a>980. <tt>mutex lock()</tt> missing error conditions</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ion Gaztañaga <b>Opened:</b> 2009-02-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  POSIX 2008 adds two return values for <tt>pthread_mutex_xxxlock()</tt>:
--- 25361,25371 ----
  
  <hr>
  <h3><a name="980"></a>980. <tt>mutex lock()</tt> missing error conditions</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Ion Gazta&ntilde;aga <b>Opened:</b> 2009-02-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  POSIX 2008 adds two return values for <tt>pthread_mutex_xxxlock()</tt>:
*************** being destroyed.
*** 31511,31517 ****
  Consider:
  </p>
  
! <blockquote><pre>//Suppose mutex.lock() throws "owner_dead"
  unique_lock ul(&amp;mutex);
  //mutex left locked if "owner_dead" is thrown
  </pre></blockquote>
--- 25384,25391 ----
  Consider:
  </p>
  
! <blockquote><pre>
! //Suppose mutex.lock() throws "owner_dead"
  unique_lock ul(&amp;mutex);
  //mutex left locked if "owner_dead" is thrown
  </pre></blockquote>
*************** Summit:
*** 31537,31546 ****
  ]</i></p>
  
  
! <blockquote>
  Not a defect. Handling these error conditions is an implementation
  detail and must be handled below the C++ interface.
! </blockquote>
  
  
  
--- 25411,25420 ----
  ]</i></p>
  
  
! <blockquote><p>
  Not a defect. Handling these error conditions is an implementation
  detail and must be handled below the C++ interface.
! </p></blockquote>
  
  
  
*************** to detect it.
*** 31579,31588 ****
  
  <hr>
  <h3><a name="988"></a>988. <tt>Reflexivity</tt> meaningless?</h3>
! <p><b>Section:</b> X [concept.comparison] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-02-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#concept.comparison">issues</a> in [concept.comparison].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  X [concept.comparison] p2:
--- 25453,25462 ----
  
  <hr>
  <h3><a name="988"></a>988. <tt>Reflexivity</tt> meaningless?</h3>
! <p><b>Section:</b> X [concept.comparison] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-02-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#concept.comparison">issues</a> in [concept.comparison].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  X [concept.comparison] p2:
*************** not do anything as written. It merely st
*** 31593,31607 ****
  with itself, rather than asserting a property of the <tt>==</tt> operator.
  </p>
  
! <b>
  Original proposed resolution:
! </b>
  
  <p>
  Change the definition of <tt>Reflexivity</tt> in X [concept.comparison]:
  </p>
  
! <blockquote><pre>axiom Reflexivity(T a) { <ins>(</ins>a == a<ins>) == true</ins>; }
  </pre></blockquote>
  
  <p><i>[
--- 25467,25482 ----
  with itself, rather than asserting a property of the <tt>==</tt> operator.
  </p>
  
! <p><b>
  Original proposed resolution:
! </b></p>
  
  <p>
  Change the definition of <tt>Reflexivity</tt> in X [concept.comparison]:
  </p>
  
! <blockquote><pre>
! axiom Reflexivity(T a) { <ins>(</ins>a == a<ins>) == true</ins>; }
  </pre></blockquote>
  
  <p><i>[
*************** NAD.
*** 31631,31641 ****
  
  <hr>
  <h3><a name="989"></a>989. late_check and library</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-02-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The example in 6.9p2 shows how late_check blocks inhibit concept_map lookup
--- 25506,25516 ----
  
  <hr>
  <h3><a name="989"></a>989. late_check and library</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-02-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The example in 6.9p2 shows how late_check blocks inhibit concept_map lookup
*************** Doug adds:
*** 31652,31673 ****
  ]</i></p>
  
  
! <blockquote>
  We need something like this, but it should be a more general statement
  about implementations respecting the concept maps provided by the
  user. Use of late_check is one way in which implementations can
  subvert the concept maps provided by the user, but there are other
  ways as well ("pattern-based" overloading, tricks with "auto" concept
  maps and defaulted associated type arguments).
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, pending proposed wording from Alisdair and/or Doug for further review.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 25527,25549 ----
  ]</i></p>
  
  
! <blockquote><p>
  We need something like this, but it should be a more general statement
  about implementations respecting the concept maps provided by the
  user. Use of late_check is one way in which implementations can
  subvert the concept maps provided by the user, but there are other
  ways as well ("pattern-based" overloading, tricks with "auto" concept
  maps and defaulted associated type arguments).
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! 
! <blockquote><p>
  Move to Open, pending proposed wording from Alisdair and/or Doug for further review.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Open, pending proposed wording f
*** 31677,31689 ****
  
  
  <hr>
! <h3><a name="992"></a>992. Response to UK 169</h3>
! <p><b>Section:</b> 17.6.1.1 [contents] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#contents">issues</a> in [contents].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 169</b></p>
  <p>
  This phrasing contradicts later freedom to implement the C standard
  library portions in the global namespace as well as std. (17.6.2.3p4)
--- 25553,25565 ----
  
  
  <hr>
! <h3><a name="992"></a>992. Allow implementations to implement C library in the global namespace</h3>
! <p><b>Section:</b> 17.6.1.1 [contents] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#contents">issues</a> in [contents].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK-169 [CD1]</b></p>
  <p>
  This phrasing contradicts later freedom to implement the C standard
  library portions in the global namespace as well as std. (17.6.2.3p4)
*************** library portions in the global namespace
*** 31693,31702 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  The proposed wording seems to go too far.
  Move back to Open.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 25569,25578 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  The proposed wording seems to go too far.
  Move back to Open.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** nested within namespace <tt>std</tt><ins
*** 31740,31746 ****
  </p>
  
  <p><ins>
! <sup>*</sup>The C standard library headers D.7 [depr.c.headers] also define
  names within the global namespace, while the C++ headers for
  C library facilities 17.6.1.2 [headers] may also define names within
  the global namespace.
--- 25616,25622 ----
  </p>
  
  <p><ins>
! <sup>*</sup>The C standard library headers D.5 [depr.c.headers] also define
  names within the global namespace, while the C++ headers for
  C library facilities 17.6.1.2 [headers] may also define names within
  the global namespace.
*************** the global namespace.
*** 31754,31762 ****
  
  <hr>
  <h3><a name="995"></a>995. Operational Semantics Unclear</h3>
! <p><b>Section:</b> 17.5.1.3 [structure.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As a practical matter there's disagreement on the meaning of <i>operational
--- 25630,25638 ----
  
  <hr>
  <h3><a name="995"></a>995. Operational Semantics Unclear</h3>
! <p><b>Section:</b> 17.5.1.3 [structure.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As a practical matter there's disagreement on the meaning of <i>operational
*************** disagreement is merely due to people not
*** 31769,31777 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Agree with the recommended NAD resolution.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 25645,25653 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Agree with the recommended NAD resolution.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** perfectly clear.
*** 31786,31796 ****
  
  <hr>
  <h3><a name="996"></a>996. Move operation not well specified</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are lots of places in the standard where we talk about "the move
--- 25662,25672 ----
  
  <hr>
  <h3><a name="996"></a>996. Move operation not well specified</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are lots of places in the standard where we talk about "the move
*************** we need to.
*** 31805,31814 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, pending proposed wording from Dave for further
  review.
! </blockquote>
  
  
  
--- 25681,25690 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open, pending proposed wording from Dave for further
  review.
! </p></blockquote>
  
  
  
*************** review.
*** 31817,31825 ****
  ]</i></p>
  
  
! <blockquote>
  Move to NAD.  We define what we expect from a moved-from object in Table 34 [movesconstructible].
! </blockquote>
  
  
  
--- 25693,25701 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to NAD.  We define what we expect from a moved-from object in Table 34 [movesconstructible].
! </p></blockquote>
  
  
  
*************** Move to NAD.  We define what we expect f
*** 31833,31842 ****
  
  <hr>
  <h3><a name="1000"></a>1000. adjacent_find is over-constrained</h3>
! <p><b>Section:</b> 25.2.8 [alg.adjacent.find] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2009-03-09 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.adjacent.find">issues</a> in [alg.adjacent.find].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <b>Addresses UK 296</b>
--- 25709,25718 ----
  
  <hr>
  <h3><a name="1000"></a>1000. adjacent_find is over-constrained</h3>
! <p><b>Section:</b> 25.2.8 [alg.adjacent.find] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2009-03-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.adjacent.find">issues</a> in [alg.adjacent.find].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <b>Addresses UK 296</b>
*************** number of use cases, including:
*** 31849,31855 ****
  </p>
  <blockquote>
  <table>
! <tbody><tr>
  <td valign="top">
  <tt>adjacent_find(begin,&nbsp;end,&nbsp;less&lt;double&gt;)</tt>
  </td>
--- 25725,25731 ----
  </p>
  <blockquote>
  <table>
! <tr>
  <td valign="top">
  <tt>adjacent_find(begin,&nbsp;end,&nbsp;less&lt;double&gt;)</tt>
  </td>
*************** to check an algorithm which produces poi
*** 31870,31876 ****
  points too far apart.
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
--- 25746,25752 ----
  points too far apart.
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
*************** Change the definition of adjacent_find i
*** 31891,31897 ****
  and 25.2.8 [alg.adjacent.find] to:
  </p>
  
! <blockquote><pre>template&lt;ForwardIterator Iter&gt; 
    requires <del>EqualityComparable</del><ins>HasEqualTo</ins>&lt;Iter::value_type<ins>, Iter::value_type</ins>&gt;
    Iter adjacent_find(Iter first, Iter last);
  
--- 25767,25774 ----
  and 25.2.8 [alg.adjacent.find] to:
  </p>
  
! <blockquote><pre>
! template&lt;ForwardIterator Iter&gt; 
    requires <del>EqualityComparable</del><ins>HasEqualTo</ins>&lt;Iter::value_type<ins>, Iter::value_type</ins>&gt;
    Iter adjacent_find(Iter first, Iter last);
  
*************** template&lt;ForwardIterator Iter, <del>E
*** 31906,31926 ****
  
  <hr>
  <h3><a name="1001"></a>1001. Pointers, concepts and headers</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-10 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 78</b></p>
  
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>.
  </p>
  
  <p>
! This is effectively an extension of LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#343">343</a>.
  </p>
  <p>
  We know there is an increasing trend (encouraged by conformance testers and
--- 25783,25803 ----
  
  <hr>
  <h3><a name="1001"></a>1001. Pointers, concepts and headers</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 78</b></p>
  
  <p>
! Related to <a href="lwg-closed.html#1063">1063</a>.
  </p>
  
  <p>
! This is effectively an extension of LWG issue <a href="lwg-defects.html#343">343</a>.
  </p>
  <p>
  We know there is an increasing trend (encouraged by conformance testers and
*************** iterator concepts are specifically requi
*** 31946,31952 ****
  At a minimum, the list of headers would be: (assuming all are constrained by
  concepts)
  </p>
! <blockquote><pre>algorithm
  array
  deque
  forward_list
--- 25823,25830 ----
  At a minimum, the list of headers would be: (assuming all are constrained by
  concepts)
  </p>
! <blockquote><pre>
! algorithm
  array
  deque
  forward_list
*************** iterator
*** 31955,31961 ****
  locale
  list
  map
! memory          // if <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1029">1029</a> is adopted
  memory_concepts
  numeric
  random
--- 25833,25839 ----
  locale
  list
  map
! memory          // if <a href="lwg-closed.html#1029">1029</a> is adopted
  memory_concepts
  numeric
  random
*************** he prefers a solution that spells out wh
*** 32024,32033 ****
  rather than how those declarations are to be provided,
  e.g.,
  </p>
! <blockquote>
  A C++ header shall provide the names
  that are required to be defined in that header.
! </blockquote>
  <p>
  Bill suggests approaching the wording from a programmer's perspective.
  We may want to consider promising that certain widely-used headers
--- 25902,25911 ----
  rather than how those declarations are to be provided,
  e.g.,
  </p>
! <blockquote><p>
  A C++ header shall provide the names
  that are required to be defined in that header.
! </p></blockquote>
  <p>
  Bill suggests approaching the wording from a programmer's perspective.
  We may want to consider promising that certain widely-used headers
*************** Move to Open status.
*** 32069,32075 ****
  <blockquote>
  <ul>
  <li>Strike two pieces of text considered unnecessary.</li>
! <li>Change "definitions" to "declarations and definitions" in two places.</li>
  <li>Wording tightened slightly.</li>
  </ul>
  </blockquote>
--- 25947,25953 ----
  <blockquote>
  <ul>
  <li>Strike two pieces of text considered unnecessary.</li>
! <li>Change &quot;definitions&quot; to &quot;declarations and definitions&quot; in two places.</li>
  <li>Wording tightened slightly.</li>
  </ul>
  </blockquote>
*************** in the synopses of those other headers.
*** 32092,32108 ****
  </p>
  <p>
  Alisdair: Does this address the BSI comment?
! </p>
! <p>
  Beman: There were several overlapping comments. I tried to handle them
  all with one resolution.
! </p>
! <p>
  Alisdair: I'd prefer to see this closed as NAD and have this resolution
  be the subject of some other, new issue.
! </p>
! <p>
! Move to NAD Concepts. Howard to open a new issue (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1178">1178</a>) in Ready state with the
  Proposed Resolution above. Beman will write up a discussion for the new
  issue.
  </p>
--- 25970,25983 ----
  </p>
  <p>
  Alisdair: Does this address the BSI comment?
! <p/>
  Beman: There were several overlapping comments. I tried to handle them
  all with one resolution.
! <p/>
  Alisdair: I'd prefer to see this closed as NAD and have this resolution
  be the subject of some other, new issue.
! <p/>
! Move to NAD Concepts. Howard to open a new issue (<a href="lwg-defects.html#1178">1178</a>) in Ready state with the
  Proposed Resolution above. Beman will write up a discussion for the new
  issue.
  </p>
*************** issue.
*** 32111,32117 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p><i>Change 17.6.4.2 [res.on.headers], Headers, paragraph 1, as indicated:</i></p>
  
  <blockquote>
  
--- 25986,25992 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p><i>Change 17.6.5.2 [res.on.headers], Headers, paragraph 1, as indicated:</i></p>
  
  <blockquote>
  
*************** if those other headers were included.</i
*** 32134,32147 ****
  
  
  <hr>
! <h3><a name="1002"></a>1002. Response to UK 170</h3>
! <p><b>Section:</b> 17.6.1.2 [headers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#headers">issues</a> in [headers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 170</b></p>
  
  <p>
  One of goals of C++0x is to make language easier to teach and for
--- 26009,26022 ----
  
  
  <hr>
! <h3><a name="1002"></a>1002. Provide bulk include headers</h3>
! <p><b>Section:</b> 17.6.1.2 [headers] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#headers">issues</a> in [headers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK-170 [CD1]</b></p>
  
  <p>
  One of goals of C++0x is to make language easier to teach and for
*************** single include statement.
*** 32156,32166 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We do not all agree that this is an issue,
  but we agree that if it needs solving this is the right way to do it.
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-07-06 Beman notes:
--- 26031,26041 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We do not all agree that this is an issue,
  but we agree that if it needs solving this is the right way to do it.
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-07-06 Beman notes:
*************** a chance to look at <a href="http://www.
*** 32197,32205 ****
  ]</i></p>
  
  
! <blockquote>
  No consensus for change.
! </blockquote>
  
  
  
--- 26072,26080 ----
  ]</i></p>
  
  
! <blockquote><p>
  No consensus for change.
! </p></blockquote>
  
  
  
*************** No consensus for change.
*** 32207,32232 ****
  <p>
  Insert a new paragraph in 17.6.1.2 [headers] between p4 and p5
  </p>
! <blockquote>
  An additional header <tt>&lt;std&gt;</tt> shall have the effect of
  supplying the entire standard library.  [<i>Note:</i> for example, it
  might be implemented as a file with an <tt>#include</tt> statement for each of the
  headers listed in tables 13 and 14. <i>-- end note</i>]
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1003"></a>1003. Response to JP 23</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses JP 23</b></p>
  
  <p>
  There is a freestanding implementation including
--- 26082,26107 ----
  <p>
  Insert a new paragraph in 17.6.1.2 [headers] between p4 and p5
  </p>
! <blockquote><p>
  An additional header <tt>&lt;std&gt;</tt> shall have the effect of
  supplying the entire standard library.  [<i>Note:</i> for example, it
  might be implemented as a file with an <tt>#include</tt> statement for each of the
  headers listed in tables 13 and 14. <i>-- end note</i>]
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1003"></a>1003. Require more useful headers for freestanding implementations</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses JP 23 [CD1]</b></p>
  
  <p>
  There is a freestanding implementation including
*************** library interface, so should be supporte
*** 32267,32273 ****
  <p>
  (it is anticipated the resolution will come via an update to paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2814.pdf">N2814</a>)
! (see also LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>)
  </p>
  </blockquote>
  
--- 26142,26148 ----
  <p>
  (it is anticipated the resolution will come via an update to paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2814.pdf">N2814</a>)
! (see also LWG <a href="lwg-closed.html#833">833</a>)
  </p>
  </blockquote>
  
*************** library interface, so should be supporte
*** 32275,32284 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Leave in Review status pending a paper on freestanding implementations
  by Martin Tasker.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 26150,26159 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Leave in Review status pending a paper on freestanding implementations
  by Martin Tasker.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** Add <tt>&lt;type_traits&gt;</tt> to Tabl
*** 32313,32324 ****
  
  
  
- 
  <hr>
  <h3><a name="1005"></a>1005. <tt>numeric_limits</tt> partial specializations not concept enabled</h3>
! <p><b>Section:</b> 18.3.1.1 [numeric.limits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses JP 26</b></p>
--- 26188,26198 ----
  
  
  
  <hr>
  <h3><a name="1005"></a>1005. <tt>numeric_limits</tt> partial specializations not concept enabled</h3>
! <p><b>Section:</b> 18.3.2.3 [numeric.limits] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses JP 26</b></p>
*************** Summit:
*** 32332,32381 ****
  ]</i></p>
  
  
! <blockquote>
! Alisdair will provide a soltion as part of treatment of axioms and LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>.
! </blockquote>
  
  <p><i>[
  Post Summit:
  ]</i></p>
  
  
! <blockquote>
  Alisdair recommends NAD as the partial specializations are already
  constrained by requirements on the primary template.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  The Working Draft does not in general repeat a primary template's constraints
  in any specializations.
  Move to NAD.
! </blockquote>
  
  <p><i>[
  2009-05-25 Howard adds:
  ]</i></p>
  
  
! <blockquote>
  A c++std-lib thread starting at c++std-lib-23880 has cast doubt that NAD is the
  correct resolution of this issue.  Indeed the discussion also casts doubt that
  the current proposed wording is the correct resolution as well.  Personally I'm
  inclined to reset the status to Open.  However I'm reverting the status to 
  that which it had prior to the Batavia recommendation.  I'm setting back to Review.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 18.3.1.1 [numeric.limits]:
  </p>
  
! <blockquote><pre>template&lt;<del>class</del> <ins>Regular</ins> T&gt; class numeric_limits&lt;const T&gt;;
  template&lt;<del>class</del> <ins>Regular</ins> T&gt; class numeric_limits&lt;volatile T&gt;;
  template&lt;<del>class</del> <ins>Regular</ins> T&gt; class numeric_limits&lt;const volatile T&gt;;
  </pre></blockquote>
--- 26206,26256 ----
  ]</i></p>
  
  
! <blockquote><p>
! Alisdair will provide a solution as part of treatment of axioms and LWG <a href="lwg-closed.html#902">902</a>.
! </p></blockquote>
  
  <p><i>[
  Post Summit:
  ]</i></p>
  
  
! <blockquote><p>
  Alisdair recommends NAD as the partial specializations are already
  constrained by requirements on the primary template.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  The Working Draft does not in general repeat a primary template's constraints
  in any specializations.
  Move to NAD.
! </p></blockquote>
  
  <p><i>[
  2009-05-25 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
  A c++std-lib thread starting at c++std-lib-23880 has cast doubt that NAD is the
  correct resolution of this issue.  Indeed the discussion also casts doubt that
  the current proposed wording is the correct resolution as well.  Personally I'm
  inclined to reset the status to Open.  However I'm reverting the status to 
  that which it had prior to the Batavia recommendation.  I'm setting back to Review.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 18.3.2.3 [numeric.limits]:
  </p>
  
! <blockquote><pre>
! template&lt;<del>class</del> <ins>Regular</ins> T&gt; class numeric_limits&lt;const T&gt;;
  template&lt;<del>class</del> <ins>Regular</ins> T&gt; class numeric_limits&lt;volatile T&gt;;
  template&lt;<del>class</del> <ins>Regular</ins> T&gt; class numeric_limits&lt;const volatile T&gt;;
  </pre></blockquote>
*************** template&lt;<del>class</del> <ins>Regula
*** 32387,32396 ****
  
  <hr>
  <h3><a name="1007"></a>1007. <tt>throw_with_nested</tt> not concept enabled</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses JP 29</b></p>
--- 26262,26272 ----
  
  <hr>
  <h3><a name="1007"></a>1007. <tt>throw_with_nested</tt> not concept enabled</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#except.nested">active issues</a> in [except.nested].</p>
! <p><b>View all other</b> <a href="lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses JP 29</b></p>
*************** Summit:
*** 32404,32412 ****
  ]</i></p>
  
   
! <blockquote>
  Agreed.
! </blockquote>
  
  
  
--- 26280,26288 ----
  ]</i></p>
  
   
! <blockquote><p>
  Agreed.
! </p></blockquote>
  
  
  
*************** review.
*** 32427,32436 ****
  
  <hr>
  <h3><a name="1008"></a>1008. <tt>nested_exception</tt> wording unclear</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses JP 31</b></p>
--- 26303,26313 ----
  
  <hr>
  <h3><a name="1008"></a>1008. <tt>nested_exception</tt> wording unclear</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#except.nested">active issues</a> in [except.nested].</p>
! <p><b>View all other</b> <a href="lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses JP 31</b></p>
*************** Summit:
*** 32444,32471 ****
  ]</i></p>
  
   
! <blockquote>
  Alisdair will add an example in an update to
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2619.pdf">N2619</a>.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  It doesn't appear that N2619 really addresses this. Alisdair to propose wording.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  Mark issue 1008 as NAD, the type is adequately described.
! </blockquote>
  
  
  
--- 26321,26348 ----
  ]</i></p>
  
   
! <blockquote><p>
  Alisdair will add an example in an update to
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2619.pdf">N2619</a>.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  It doesn't appear that N2619 really addresses this. Alisdair to propose wording.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  Mark issue 1008 as NAD, the type is adequately described.
! </p></blockquote>
  
  
  
*************** scenario.
*** 32487,32495 ****
  
  <hr>
  <h3><a name="1009"></a>1009. <tt>InputIterator</tt> post-increment dangerous</h3>
! <p><b>Section:</b> 24.2.2 [iterator.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 251</b></p>
--- 26364,26373 ----
  
  <hr>
  <h3><a name="1009"></a>1009. <tt>InputIterator</tt> post-increment dangerous</h3>
! <p><b>Section:</b> 24.2.2 [iterator.iterators] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.iterators">issues</a> in [iterator.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 251</b></p>
*************** percieved need for the post-increment op
*** 32509,32530 ****
  ]</i></p>
  
  
! <blockquote>
  We still think the issue is relevant, but needs totally rewording in
  non-concept language.  We would like to see the issue retained as Open,
  rather than deferred as NAD Concepts.  Review status is no longer
  appropriate.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  NAD.  Without concepts we do not feel that input iterator post increment
  is broken.
! </blockquote>
  
  
  
--- 26387,26408 ----
  ]</i></p>
  
  
! <blockquote><p>
  We still think the issue is relevant, but needs totally rewording in
  non-concept language.  We would like to see the issue retained as Open,
  rather than deferred as NAD Concepts.  Review status is no longer
  appropriate.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  NAD.  Without concepts we do not feel that input iterator post increment
  is broken.
! </p></blockquote>
  
  
  
*************** is broken.
*** 32533,32539 ****
  Change 24.2.2 [iterator.iterators]:
  </p>
  
! <blockquote><pre>concept Iterator&lt;typename X&gt; : Semiregular&lt;X&gt; { 
    MoveConstructible reference = typename X::reference; 
    <del>MoveConstructible postincrement_result;</del>
  
--- 26411,26418 ----
  Change 24.2.2 [iterator.iterators]:
  </p>
  
! <blockquote><pre>
! concept Iterator&lt;typename X&gt; : Semiregular&lt;X&gt; { 
    MoveConstructible reference = typename X::reference; 
    <del>MoveConstructible postincrement_result;</del>
  
*************** Change 24.2.2 [iterator.iterators]:
*** 32546,32557 ****
  </pre>
  
  <p>...</p>
! <pre><del>postincrement_result operator++(X&amp; r, int);</del>
  </pre>
  
! <blockquote>
  <del>-3- <i>Effects:</i> equivalent to <tt>{ X tmp = r; ++r; return tmp; }</tt>.</del>
! </blockquote>
  
  </blockquote>
  
--- 26425,26437 ----
  </pre>
  
  <p>...</p>
! <pre>
! <del>postincrement_result operator++(X&amp; r, int);</del>
  </pre>
  
! <blockquote><p>
  <del>-3- <i>Effects:</i> equivalent to <tt>{ X tmp = r; ++r; return tmp; }</tt>.</del>
! </p></blockquote>
  
  </blockquote>
  
*************** Change 24.2.3 [input.iterators]:
*** 32560,32566 ****
  </p>
  
  <blockquote>
! <pre>concept InputIterator&lt;typename X&gt; : Iterator&lt;X&gt;, EqualityComparable&lt;X&gt; { 
    ObjectType value_type = typename X::value_type; 
    MoveConstructible pointer = typename X::pointer; 
  
--- 26440,26447 ----
  </p>
  
  <blockquote>
! <pre>
! concept InputIterator&lt;typename X&gt; : Iterator&lt;X&gt;, EqualityComparable&lt;X&gt; { 
    ObjectType value_type = typename X::value_type; 
    MoveConstructible pointer = typename X::pointer; 
  
*************** Change 24.2.4 [output.iterators]:
*** 32582,32588 ****
  </p>
  
  <blockquote>
! <pre>auto concept OutputIterator&lt;typename X, typename Value&gt; { 
    requires Iterator&lt;X&gt;; 
  
    typename reference = Iterator&lt;X&gt;::reference; 
--- 26463,26470 ----
  </p>
  
  <blockquote>
! <pre>
! auto concept OutputIterator&lt;typename X, typename Value&gt; { 
    requires Iterator&lt;X&gt;; 
  
    typename reference = Iterator&lt;X&gt;::reference; 
*************** Change 24.2.5 [forward.iterators]:
*** 32601,32613 ****
  </p>
  
  <p><i>[
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1084">1084</a> which is attempting to change this same area in a compatible
  way.
  ]</i></p>
  
  
  <blockquote>
! <pre>concept ForwardIterator&lt;typename X&gt; : InputIterator&lt;X&gt;, Regular&lt;X&gt; { 
    <del>requires Convertible&lt;postincrement_result, const X&amp;&gt;;</del>
  
    <ins>MoveConstructible postincrement_result;</ins>
--- 26483,26496 ----
  </p>
  
  <p><i>[
! See <a href="lwg-closed.html#1084">1084</a> which is attempting to change this same area in a compatible
  way.
  ]</i></p>
  
  
  <blockquote>
! <pre>
! concept ForwardIterator&lt;typename X&gt; : InputIterator&lt;X&gt;, Regular&lt;X&gt; { 
    <del>requires Convertible&lt;postincrement_result, const X&amp;&gt;;</del>
  
    <ins>MoveConstructible postincrement_result;</ins>
*************** way.
*** 32627,32633 ****
  <p>-4- ...</p>
  </blockquote>
  
! <pre><ins>postincrement_result operator++(X&amp; r, int);</ins>
  </pre>
  
  <blockquote>
--- 26510,26517 ----
  <p>-4- ...</p>
  </blockquote>
  
! <pre>
! <ins>postincrement_result operator++(X&amp; r, int);</ins>
  </pre>
  
  <blockquote>
*************** way.
*** 32645,32654 ****
  
  <hr>
  <h3><a name="1010"></a>1010. <tt>operator-=</tt> should use default in concept</h3>
! <p><b>Section:</b> 24.2.7 [random.access.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#random.access.iterators">issues</a> in [random.access.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 263</b></p>
--- 26529,26538 ----
  
  <hr>
  <h3><a name="1010"></a>1010. <tt>operator-=</tt> should use default in concept</h3>
! <p><b>Section:</b> 24.2.7 [random.access.iterators] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#random.access.iterators">issues</a> in [random.access.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 263</b></p>
*************** implementation in the concept, with a ma
*** 32662,32675 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  The proposed resolution should also remove
  paragraph 5 and the declaration that precedes it.
  Further, we should provide an axiom
  that captures the desired semantics.
  This may be a broader policy to be applied.
  Move to Open.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 26546,26559 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  The proposed resolution should also remove
  paragraph 5 and the declaration that precedes it.
  Further, we should provide an axiom
  that captures the desired semantics.
  This may be a broader policy to be applied.
  Move to Open.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Open.
*** 32677,32683 ****
  Change 24.2.7 [random.access.iterators]:
  </p>
  
! <blockquote><pre>concept RandomAccessIterator&lt;typename X&gt; : BidirectionalIterator&lt;X&gt;, LessThanComparable&lt;X&gt; {
    ...
    X&amp; operator-=(X&amp; <ins>x</ins>, difference_type <ins>n</ins>)<ins> { return x += -n</ins>;<ins> }</ins>
    ...
--- 26561,26568 ----
  Change 24.2.7 [random.access.iterators]:
  </p>
  
! <blockquote><pre>
! concept RandomAccessIterator&lt;typename X&gt; : BidirectionalIterator&lt;X&gt;, LessThanComparable&lt;X&gt; {
    ...
    X&amp; operator-=(X&amp; <ins>x</ins>, difference_type <ins>n</ins>)<ins> { return x += -n</ins>;<ins> }</ins>
    ...
*************** Change 24.2.7 [random.access.iterators]:
*** 32690,32700 ****
  
  
  <hr>
! <h3><a name="1013"></a>1013. Response to UK 305</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 305</b></p>
--- 26575,26585 ----
  
  
  <hr>
! <h3><a name="1013"></a>1013. Remove <tt>IsSameType</tt> hold-over constraints</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 305</b></p>
*************** longer necessary.
*** 32709,32728 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  We believe this is NAD, but this needs to be reviewed against the
  post-remove-concepts draft.
! </blockquote>
  
  
  
--- 26594,26613 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  We believe this is NAD, but this needs to be reviewed against the
  post-remove-concepts draft.
! </p></blockquote>
  
  
  
*************** post-remove-concepts draft.
*** 32731,32737 ****
  Change 25 [algorithms]:
  </p>
  
! <blockquote><pre>template&lt;class T, StrictWeakOrder&lt;auto, T&gt; Compare&gt;
    <del>requires !SameType&lt;T, Compare&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;</del>
    const T&amp; min(const T&amp; a, const T&amp; b, Compare comp);
  ...
--- 26616,26623 ----
  Change 25 [algorithms]:
  </p>
  
! <blockquote><pre>
! template&lt;class T, StrictWeakOrder&lt;auto, T&gt; Compare&gt;
    <del>requires !SameType&lt;T, Compare&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;</del>
    const T&amp; min(const T&amp; a, const T&amp; b, Compare comp);
  ...
*************** template&lt;class T, StrictWeakOrder&lt;
*** 32748,32754 ****
  Change 25.4.7 [alg.min.max], p1, p9 and p17:
  </p>
  
! <blockquote><pre>template&lt;class T, StrictWeakOrder&lt;auto, T&gt; Compare&gt;
    <del>requires !SameType&lt;T, Compare&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;</del>
    const T&amp; min(const T&amp; a, const T&amp; b, Compare comp);
  ...
--- 26634,26641 ----
  Change 25.4.7 [alg.min.max], p1, p9 and p17:
  </p>
  
! <blockquote><pre>
! template&lt;class T, StrictWeakOrder&lt;auto, T&gt; Compare&gt;
    <del>requires !SameType&lt;T, Compare&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;</del>
    const T&amp; min(const T&amp; a, const T&amp; b, Compare comp);
  ...
*************** template&lt;class T, StrictWeakOrder&lt;
*** 32767,32777 ****
  
  
  <hr>
! <h3><a name="1015"></a>1015. Response to UK 199</h3>
! <p><b>Section:</b> X [concept.transform] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#concept.transform">issues</a> in [concept.transform].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 199</b></p>
--- 26654,26664 ----
  
  
  <hr>
! <h3><a name="1015"></a>1015. C++ programs - but not users - need to provide support <tt>concept_map</tt>s</h3>
! <p><b>Section:</b> X [concept.transform] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#concept.transform">issues</a> in [concept.transform].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 199</b></p>
*************** mandated there.
*** 32811,32823 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the issue,
  but believe the wording needs further improvement.
  We want to investigate current definitions for nomenclature such as
  "user" and "program."
  Move to Open pending the recommended investigation.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 26698,26710 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the issue,
  but believe the wording needs further improvement.
  We want to investigate current definitions for nomenclature such as
  "user" and "program."
  Move to Open pending the recommended investigation.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Open pending the recommended inv
*** 32825,32852 ****
  Change X [concept.transform] p2:
  </p>
  
! <blockquote>
  -2- A <del>program</del> <ins>user</ins> shall not provide concept maps for
  any concept in 20.1.1.
! </blockquote>
  
  <p>
  Change  [concept.true] p2:
  </p>
  
! <blockquote>
  -2- <i>Requires:</i> a <del>program</del> <ins>user</ins> shall not
  provide a concept map for the <tt>True</tt> concept.
! </blockquote>
  
  <p>
  Change  [concept.classify] p2:
  </p>
  
! <blockquote>
  -2- <i>Requires:</i> a <del>program</del><ins>user</ins> shall not provide concept
  maps for any concept in this section.
! </blockquote>
  
  
  
--- 26712,26739 ----
  Change X [concept.transform] p2:
  </p>
  
! <blockquote><p>
  -2- A <del>program</del> <ins>user</ins> shall not provide concept maps for
  any concept in 20.1.1.
! </p></blockquote>
  
  <p>
  Change  [concept.true] p2:
  </p>
  
! <blockquote><p>
  -2- <i>Requires:</i> a <del>program</del> <ins>user</ins> shall not
  provide a concept map for the <tt>True</tt> concept.
! </p></blockquote>
  
  <p>
  Change  [concept.classify] p2:
  </p>
  
! <blockquote><p>
  -2- <i>Requires:</i> a <del>program</del><ins>user</ins> shall not provide concept
  maps for any concept in this section.
! </p></blockquote>
  
  
  
*************** maps for any concept in this section.
*** 32854,32864 ****
  
  
  <hr>
! <h3><a name="1016"></a>1016. Response to JP 33</h3>
! <p><b>Section:</b> X [concept.comparison] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#concept.comparison">issues</a> in [concept.comparison].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses JP 33</b></p>
--- 26741,26751 ----
  
  
  <hr>
! <h3><a name="1016"></a>1016. Provide <tt>LessThanComparable</tt> and <tt>EqualityComparable</tt> for <tt>FloatingPointType</tt></h3>
! <p><b>Section:</b> X [concept.comparison] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#concept.comparison">issues</a> in [concept.comparison].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses JP 33</b></p>
*************** float/double etc. Also not clear how we
*** 32886,32892 ****
  concepts.
  </p>
  <p>
! Recommend NAD and treat as a subset of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>.
  </p>
  </blockquote>
  
--- 26773,26779 ----
  concepts.
  </p>
  <p>
! Recommend NAD and treat as a subset of issue <a href="lwg-closed.html#902">902</a>.
  </p>
  </blockquote>
  
*************** Recommend NAD.
*** 32902,32911 ****
  
  
  <hr>
! <h3><a name="1017"></a>1017. Response to US 66</h3>
! <p><b>Section:</b> X [concept.regular] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 66</b></p>
--- 26789,26798 ----
  
  
  <hr>
! <h3><a name="1017"></a>1017. Floating-point types should not satisfy <tt>Regular</tt></h3>
! <p><b>Section:</b> X [concept.regular] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 66</b></p>
*************** Summit:
*** 32928,32934 ****
  
  <blockquote>
  <p>
! Recommend that we handle the same as JP 33 / <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1016">1016</a>.
  </p>
  </blockquote>
  
--- 26815,26821 ----
  
  <blockquote>
  <p>
! Recommend that we handle the same as JP 33 / <a href="lwg-closed.html#1016">1016</a>.
  </p>
  </blockquote>
  
*************** Post Summit, Alisdair adds:
*** 32939,32945 ****
  
  <blockquote>
  <p>
! Recommend Open, and review after resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a> and revised axiom
  feature.
  </p>
  </blockquote>
--- 26826,26832 ----
  
  <blockquote>
  <p>
! Recommend Open, and review after resolution of <a href="lwg-closed.html#902">902</a> and revised axiom
  feature.
  </p>
  </blockquote>
*************** feature.
*** 32953,32966 ****
  
  
  <hr>
! <h3><a name="1018"></a>1018. Response to US 70</h3>
! <p><b>Section:</b> 20.7 [meta] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses US 70</b></p>
  
  <p>
  Specifications now expressed via narrative text are more accurately and
--- 26840,26854 ----
  
  
  <hr>
! <h3><a name="1018"></a>1018. Trait specifications should be expressed in terms of concepts</h3>
! <p><b>Section:</b> 20.10 [meta] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses US 70 [CD1]</b></p>
  
  <p>
  Specifications now expressed via narrative text are more accurately and
*************** at the next meeting.
*** 32996,33009 ****
  
  
  <hr>
! <h3><a name="1020"></a>1020. Response to UK 204</h3>
! <p><b>Section:</b> 20.7.7.6 [meta.trans.other] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 204</b></p>
  
  <p>
  It is not possible to create a variant union based on a parameter pack
--- 26884,26898 ----
  
  
  <hr>
! <h3><a name="1020"></a>1020. Restore <tt>aligned_union</tt></h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 204 [CD1]</b></p>
  
  <p>
  It is not possible to create a variant union based on a parameter pack
*************** expansion, e.g. to implement a classic d
*** 33013,33019 ****
  <p><b>Original proposed resolutuion:</b></p>
  
  <p>
! Restore <tt>aligned_union</tt> template that was removed by LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#856">856</a>. 
  </p>
  
  <p><i>[
--- 26902,26908 ----
  <p><b>Original proposed resolutuion:</b></p>
  
  <p>
! Restore <tt>aligned_union</tt> template that was removed by LWG issue <a href="lwg-defects.html#856">856</a>. 
  </p>
  
  <p><i>[
*************** Summit:
*** 33021,33050 ****
  ]</i></p>
  
  
! <blockquote>
  Agree. The need for <tt>aligned_union</tt> is compelling enough to reinstate.
! </blockquote>
  
  <p><i>[
  Post Summit, Alisdair adds:
  ]</i></p>
  
  
! <blockquote>
! paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2843.html">N2843</a>
  proposes an extension to the <tt>[[align]]</tt> attribute
  that further diminishes the need for this template.  Recommend NAD.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Mark NAD as suggested.
! </blockquote>
  
  
  
--- 26910,26939 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree. The need for <tt>aligned_union</tt> is compelling enough to reinstate.
! </p></blockquote>
  
  <p><i>[
  Post Summit, Alisdair adds:
  ]</i></p>
  
  
! <blockquote><p>
! Paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2843.html">N2843</a>
  proposes an extension to the <tt>[[align]]</tt> attribute
  that further diminishes the need for this template.  Recommend NAD.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Mark NAD as suggested.
! </p></blockquote>
  
  
  
*************** Mark NAD as suggested.
*** 33055,33074 ****
  
  
  <hr>
! <h3><a name="1022"></a>1022. Response to UK 212</h3>
! <p><b>Section:</b> 20.9.11 [util.dynamic.safety] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.dynamic.safety">issues</a> in [util.dynamic.safety].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 212</b></p>
  
  <p>
  The pointer-safety API is nothing to do with smart pointers, so does not
! belong in 20.9.10 [util.smartptr]. In fact it is a set of language
! support features are really belongs in clause 18 [language.support], with the contents declared in a header that
! deals with language-support of memory management.
  </p>
  
  <p><i>[
--- 26944,26964 ----
  
  
  <hr>
! <h3><a name="1022"></a>1022. Pointer-safety API has nothing to do with smart pointers</h3>
! <p><b>Section:</b> 20.7.4 [util.dynamic.safety] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.dynamic.safety">issues</a> in [util.dynamic.safety].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 212 [CD1]</b></p>
  
  <p>
  The pointer-safety API is nothing to do with smart pointers, so does not
! belong in 20.8.2 [util.smartptr]. In fact it is a set of language
! support features are really belongs in clause 18 [language.support], 
! with the contents declared in a header that deals with language-support 
! of memory management.
  </p>
  
  <p><i>[
*************** Summit:
*** 33076,33086 ****
  ]</i></p>
  
  
! <blockquote>
  Agree in principle, but not with the proposed resolution. We believe it
! belongs either a subsection of either 20 [utilities] or 20.9 [memory] as part of the general reorganization of 20 [utilities]. The declaration should stay in
! <tt>&lt;memory&gt;</tt>.
! </blockquote>
  
  
  
--- 26966,26977 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree in principle, but not with the proposed resolution. We believe it
! belongs either a subsection of either 20 [utilities] or 
! 20.7 [memory] as part of the general reorganization of 
! 20 [utilities]. The declaration should stay in <tt>&lt;memory&gt;</tt>.
! </p></blockquote>
  
  
  
*************** belongs either a subsection of either 20
*** 33091,33106 ****
  
  
  <hr>
! <h3><a name="1023"></a>1023. Response to DE 22</h3>
! <p><b>Section:</b> 20.8.14.2 [func.wrap.func] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses DE 22</b></p>
  
! <p>Related to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>.</p>
  
  <p>
  The conditions for deriving from <tt>std::unary_function</tt> and
--- 26982,26998 ----
  
  
  <hr>
! <h3><a name="1023"></a>1023. Unclear inheritance relation for <tt>std::function</tt></h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses DE 22 [CD1]</b></p>
  
! <p>Related to issue <a href="lwg-defects.html#1114">1114</a>.</p>
  
  <p>
  The conditions for deriving from <tt>std::unary_function</tt> and
*************** Summit:
*** 33114,33144 ****
  ]</i></p>
  
  
! <blockquote>
  Agree. <tt>std::reference_wrapper</tt> has the same structure, and we
  suggest that <tt>std::function</tt> be presented in the same way as
  <tt>std::reference_wrapper</tt>.
! </blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
  ]</i></p>
  
  
! <blockquote>
! Phrasing should be "publicly and
! unambiguously derived from" and probably back in reference_wrapper too.  Updated
! wording supplied.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed wording.
  Move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 27006,27035 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree. <tt>std::reference_wrapper</tt> has the same structure, and we
  suggest that <tt>std::function</tt> be presented in the same way as
  <tt>std::reference_wrapper</tt>.
! </p></blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
  ]</i></p>
  
  
! <blockquote><p>
! Phrasing should be "publicly and unambiguously derived from" and probably back in 
! <tt>reference_wrapper</tt> too.  Updated wording supplied.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed wording.
  Move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to NAD Editorial.
*** 33147,33156 ****
  </p>
  
  <p>
! Change synopsis in Class template function 20.8.14.2 [func.wrap.func]:
  </p>
  
! <blockquote><pre>template&lt;Returnable R, CopyConstructible... ArgTypes&gt; 
  class function&lt;R(ArgTypes...)&gt; 
    : public unary_function&lt;T1, R&gt;      // <del><i>iff</i> sizeof...(ArgTypes) == 1 <i>and</i></del> <ins><i>see below</i></ins>
                                        <del>// ArgTypes <i>contains</i> T1</del>
--- 27038,27048 ----
  </p>
  
  <p>
! Change synopsis in Class template function 20.9.12.2 [func.wrap.func]:
  </p>
  
! <blockquote><pre>
! template&lt;Returnable R, CopyConstructible... ArgTypes&gt; 
  class function&lt;R(ArgTypes...)&gt; 
    : public unary_function&lt;T1, R&gt;      // <del><i>iff</i> sizeof...(ArgTypes) == 1 <i>and</i></del> <ins><i>see below</i></ins>
                                        <del>// ArgTypes <i>contains</i> T1</del>
*************** class function&lt;R(ArgTypes...)&gt;
*** 33161,33167 ****
  </pre></blockquote>
  
  <p>
! Add new p1/p2 before 20.8.14.2.1 [func.wrap.func.con]:
  </p>
  
  <blockquote>
--- 27053,27059 ----
  </pre></blockquote>
  
  <p>
! Add new p1/p2 before 20.9.12.2.1 [func.wrap.func.con]:
  </p>
  
  <blockquote>
*************** parameter is a function type taking two
*** 33180,33186 ****
  returning <tt>R</tt>.
  </ins></p>
  
! <pre>explicit function();
  </pre>
  </blockquote>
  
--- 27072,27079 ----
  returning <tt>R</tt>.
  </ins></p>
  
! <pre>
! explicit function();
  </pre>
  </blockquote>
  
*************** returning <tt>R</tt>.
*** 33190,33203 ****
  
  
  <hr>
! <h3><a name="1024"></a>1024. Response to JP 39</h3>
! <p><b>Section:</b> 20.8.14.2 [func.wrap.func] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses JP 39</b></p>
  
  <p>
  There are no requires corresponding to <tt>F</tt> of <tt>std::function</tt>.
--- 27083,27097 ----
  
  
  <hr>
! <h3><a name="1024"></a>1024. <tt>std::function</tt> constructors overly generous</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses JP 39 [CD1]</b></p>
  
  <p>
  There are no requires corresponding to <tt>F</tt> of <tt>std::function</tt>.
*************** There are no requires corresponding to <
*** 33208,33246 ****
  ]</i></p>
  
  
! <blockquote>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a> removes the second constructor.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! If issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a> is accepted,
  the changes to the second constructor
  in this issue are moot.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Constructors have no definition.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Correct as follows in 20.8.14.2 [func.wrap.func] (class definition)
  </p>
  
! <blockquote><pre> template&lt;class F, Allocator Alloc&gt;
     <ins>requires ConstructibleWithAllocator&lt;F, Alloc&gt;
       &amp;&amp; call=Callable&lt;F, ArgTypes...&gt;
       &amp;&amp; Convertible&lt;call::result_type, R&gt;</ins>
--- 27102,27141 ----
  ]</i></p>
  
  
! <blockquote><p>
! <a href="lwg-defects.html#1070">1070</a> removes the second constructor.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! If issue <a href="lwg-defects.html#1070">1070</a> is accepted,
  the changes to the second constructor
  in this issue are moot.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Constructors have no definition.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Correct as follows in 20.9.12.2 [func.wrap.func] (class definition)
  </p>
  
! <blockquote><pre>
!  template&lt;class F, Allocator Alloc&gt;
     <ins>requires ConstructibleWithAllocator&lt;F, Alloc&gt;
       &amp;&amp; call=Callable&lt;F, ArgTypes...&gt;
       &amp;&amp; Convertible&lt;call::result_type, R&gt;</ins>
*************** Correct as follows in 20.8.14.2 [func.wr
*** 33258,33295 ****
  
  
  <hr>
! <h3><a name="1025"></a>1025. Response to UK 208</h3>
! <p><b>Section:</b> 20.8.15 [unord.hash] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 208</b></p>
! 
! <p>
! <tt>std::hash</tt> should be implemented for much more of the standard
! library. In particular for <tt>pair</tt>, <tt>tuple</tt> and all the
! standard containers.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1026"></a>1026. Response to UK 209</h3>
! <p><b>Section:</b> 20.9 [memory] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#memory">issues</a> in [memory].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 209</b></p>
  
  <p>
  Smart pointers cannot be used in constrained templates.
--- 27153,27166 ----
  
  
  <hr>
! <h3><a name="1026"></a>1026. Smart pointers need to be concept-constrained templates</h3>
! <p><b>Section:</b> 20.7 [memory] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#memory">issues</a> in [memory].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 209 [CD1]</b></p>
  
  <p>
  Smart pointers cannot be used in constrained templates.
*************** Summit:
*** 33300,33322 ****
  ]</i></p>
  
  
! <blockquote>
  We look forward to a paper on this topic. We recommend no action until a
  paper is available. We understand that a paper is forthcoming.
! </blockquote>
  
  <p><i>[
  Peter Dimov adds:
  ]</i></p>
  
  
! <blockquote>
  <tt>shared_ptr&lt;T&gt;</tt> and <tt>weak_ptr&lt;T&gt;</tt> support all
  types <tt>T</tt> for which <tt>T*</tt> is valid. In other words, a
  possible (partial) resolution is to change class <tt>T</tt> to
  <tt>PointeeType T</tt> for <tt>shared_ptr</tt>, <tt>weak_ptr</tt> and
  possibly <tt>enable_shared_from_this</tt>.
! </blockquote>
  
  
  
--- 27171,27193 ----
  ]</i></p>
  
  
! <blockquote><p>
  We look forward to a paper on this topic. We recommend no action until a
  paper is available. We understand that a paper is forthcoming.
! </p></blockquote>
  
  <p><i>[
  Peter Dimov adds:
  ]</i></p>
  
  
! <blockquote><p>
  <tt>shared_ptr&lt;T&gt;</tt> and <tt>weak_ptr&lt;T&gt;</tt> support all
  types <tt>T</tt> for which <tt>T*</tt> is valid. In other words, a
  possible (partial) resolution is to change class <tt>T</tt> to
  <tt>PointeeType T</tt> for <tt>shared_ptr</tt>, <tt>weak_ptr</tt> and
  possibly <tt>enable_shared_from_this</tt>.
! </p></blockquote>
  
  
  
*************** possibly <tt>enable_shared_from_this</tt
*** 33327,33339 ****
  
  
  <hr>
! <h3><a name="1027"></a>1027. Response to UK 213</h3>
! <p><b>Section:</b> 20.9.5 [default.allocator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 213</b></p>
  
  <p>
  <tt>std::allocator</tt> should be constrained to simplify its use on constrained
--- 27198,27211 ----
  
  
  <hr>
! <h3><a name="1027"></a>1027. <tt>std::allocator</tt> needs to be a concept-constrained template</h3>
! <p><b>Section:</b> 20.7.9 [default.allocator] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#default.allocator">issues</a> in [default.allocator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 213 [CD1]</b></p>
  
  <p>
  <tt>std::allocator</tt> should be constrained to simplify its use on constrained
*************** Summit:
*** 33359,33367 ****
  ]</i></p>
  
  
! <blockquote>
  Agree as stated. A future paper will address additional related issues.
! </blockquote>
  
  
  
--- 27231,27239 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree as stated. A future paper will address additional related issues.
! </p></blockquote>
  
  
  
*************** Agree as stated. A future paper will add
*** 33372,33384 ****
  
  
  <hr>
! <h3><a name="1028"></a>1028. Response to UK 214</h3>
! <p><b>Section:</b> 20.9.6 [storage.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 214</b></p>
  
  <p>
  <tt>raw_storage_iterator</tt> needs constraining as an iterator adaptor to be safely
--- 27244,27257 ----
  
  
  <hr>
! <h3><a name="1028"></a>1028. <tt>raw_storage_iterator</tt> needs to be a concept-constrained template</h3>
! <p><b>Section:</b> 20.7.10 [storage.iterator] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#storage.iterator">issues</a> in [storage.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 214 [CD1]</b></p>
  
  <p>
  <tt>raw_storage_iterator</tt> needs constraining as an iterator adaptor to be safely
*************** Summit:
*** 33390,33399 ****
  ]</i></p>
  
  
! <blockquote>
  We look forward to a paper on this topic. We recommend no action until a
  paper is available.
! </blockquote>
  
  <p><i>[
  Post Summit Alisdair provided wording and rationale.
--- 27263,27272 ----
  ]</i></p>
  
  
! <blockquote><p>
  We look forward to a paper on this topic. We recommend no action until a
  paper is available.
! </p></blockquote>
  
  <p><i>[
  Post Summit Alisdair provided wording and rationale.
*************** Post Summit Alisdair provided wording an
*** 33404,33415 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 20.9 [memory] p2
  </p>
  <p>
  Update the synopsis for <tt>&lt;memory&gt;</tt>
  </p>
! <blockquote><pre>// 20.7.8, raw storage iterator:
  template &lt;<del>class</del> <ins>ForwardIterator</ins> Out<del>put</del>Iter<del>ator</del>, <del>class</del> <ins>ObjectType</ins> T&gt; 
    <ins>requires OutputIterator&lt; OutIter, T &gt;</ins>
      class raw_storage_iterator;
--- 27277,27289 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 20.7 [memory] p2
  </p>
  <p>
  Update the synopsis for <tt>&lt;memory&gt;</tt>
  </p>
! <blockquote><pre>
! // 20.7.8, raw storage iterator:
  template &lt;<del>class</del> <ins>ForwardIterator</ins> Out<del>put</del>Iter<del>ator</del>, <del>class</del> <ins>ObjectType</ins> T&gt; 
    <ins>requires OutputIterator&lt; OutIter, T &gt;</ins>
      class raw_storage_iterator;
*************** template &lt;<del>class</del> <ins>Forwa
*** 33421,33432 ****
  
  
  <p>
! 20.9.6 [storage.iterator] p1
  </p>
  <p>
  Replace class template definition with:
  </p>
! <blockquote><pre>namespace std { 
    template &lt;<del>class</del> <ins>ForwardIterator</ins> Out<del>put</del>Iter<del>ator</del>, <del>class</del> <ins>ObjectType</ins> T&gt; 
      <ins>requires OutputIterator&lt; OutIter, T &gt;</ins>
    class raw_storage_iterator 
--- 27295,27307 ----
  
  
  <p>
! 20.7.10 [storage.iterator] p1
  </p>
  <p>
  Replace class template definition with:
  </p>
! <blockquote><pre>
! namespace std { 
    template &lt;<del>class</del> <ins>ForwardIterator</ins> Out<del>put</del>Iter<del>ator</del>, <del>class</del> <ins>ObjectType</ins> T&gt; 
      <ins>requires OutputIterator&lt; OutIter, T &gt;</ins>
    class raw_storage_iterator 
*************** Replace class template definition with:
*** 33453,33459 ****
  rather than just an <tt>InputIterator</tt> for two reasons:
  </p>
  
! <ol type="i">
  <li>
  The initial iterator passed by value is expected to remain valid,
  pointing to the initialized region of memory.
--- 27328,27334 ----
  rather than just an <tt>InputIterator</tt> for two reasons:
  </p>
  
! <ol style="list-style-type:lower-roman">
  <li>
  The initial iterator passed by value is expected to remain valid,
  pointing to the initialized region of memory.
*************** require some kind of proxy formulation t
*** 33470,33488 ****
  
  
  <hr>
! <h3><a name="1029"></a>1029. Response to UK 210</h3>
! <p><b>Section:</b> 20.9.8 [specialized.algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#specialized.algorithms">issues</a> in [specialized.algorithms].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 210</b></p>
  
! <p>Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a></p>
  
  <p>
! Specialized algorithms for memory managenment need requirements to be
  easily usable in constrained templates.
  </p>
  
--- 27345,27363 ----
  
  
  <hr>
! <h3><a name="1029"></a>1029. Specialized algorithms for memory management need to be concept-constrained templates</h3>
! <p><b>Section:</b> 20.7.12 [specialized.algorithms] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#specialized.algorithms">issues</a> in [specialized.algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 210 [CD1]</b></p>
  
! <p>Related to <a href="lwg-closed.html#582">582</a></p>
  
  <p>
! Specialized algorithms for memory management need requirements to be
  easily usable in constrained templates.
  </p>
  
*************** Summit:
*** 33491,33500 ****
  ]</i></p>
  
  
! <blockquote>
  We look forward to a paper on this topic. We recommend no action until a
  paper is available.
! </blockquote>
  
  <p><i>[
  Post Summit Alisdair provided wording.
--- 27366,27375 ----
  ]</i></p>
  
  
! <blockquote><p>
  We look forward to a paper on this topic. We recommend no action until a
  paper is available.
! </p></blockquote>
  
  <p><i>[
  Post Summit Alisdair provided wording.
*************** The current for-loop-test relies on eval
*** 33524,33530 ****
  not provided by <tt>ArithmeticLike</tt> and it's refinements. I propose to change the
  corresponding for-loop-headers to:
  </p>
! <ol type="a">
  <li>
  for <tt>uninitialized_copy_n</tt>: <tt>for ( ; n &gt; Size(0); ++result, ++first, --n) {</tt>
  </li>
--- 27399,27405 ----
  not provided by <tt>ArithmeticLike</tt> and it's refinements. I propose to change the
  corresponding for-loop-headers to:
  </p>
! <ol style="list-style-type:lower-alpha">
  <li>
  for <tt>uninitialized_copy_n</tt>: <tt>for ( ; n &gt; Size(0); ++result, ++first, --n) {</tt>
  </li>
*************** for <tt>uninitialized_fill_n</tt>: <tt>f
*** 33539,33547 ****
  <p>
  Alisdair adds:
  </p>
! <blockquote>
  For the record I agree with Daniel's suggestion.
! </blockquote>
  
  </blockquote>
  
--- 27414,27422 ----
  <p>
  Alisdair adds:
  </p>
! <blockquote><p>
  For the record I agree with Daniel's suggestion.
! </p></blockquote>
  
  </blockquote>
  
*************** For the record I agree with Daniel's sug
*** 33549,33560 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 20.9 [memory] p2
  </p>
  <p>
  Update the synopsis for <tt>&lt;memory&gt;</tt>
  </p>
! <blockquote><pre>template &lt;<del>class</del> InputIterator <ins>InIter</ins>,
           <del>class ForwardIterator</del> <ins>OutputIterator&lt;auto, InIter::reference&gt; OutIter</ins>&gt; 
     <ins>requires ForwardIterator&lt;OutIter&gt;</ins>
     <del>ForwardIterator</del> <ins>OutIter</ins>
--- 27424,27436 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 20.7 [memory] p2
  </p>
  <p>
  Update the synopsis for <tt>&lt;memory&gt;</tt>
  </p>
! <blockquote><pre>
! template &lt;<del>class</del> InputIterator <ins>InIter</ins>,
           <del>class ForwardIterator</del> <ins>OutputIterator&lt;auto, InIter::reference&gt; OutIter</ins>&gt; 
     <ins>requires ForwardIterator&lt;OutIter&gt;</ins>
     <del>ForwardIterator</del> <ins>OutIter</ins>
*************** Update as follows:
*** 33585,33594 ****
  </p>
  
  <p>
! uninitialized_copy 20.9.8.2 [uninitialized.copy]
  </p>
  
! <blockquote><pre>template &lt;<del>class</del> InputIterator <ins>InIter</ins>,
           <del>class ForwardIterator</del> <ins>OutputIterator&lt;auto, InIter::reference&gt; OutIter</ins>&gt; 
     <ins>requires ForwardIterator&lt;OutIter&gt;</ins>
     <del>ForwardIterator</del> <ins>OutIter</ins>
--- 27461,27471 ----
  </p>
  
  <p>
! uninitialized_copy 20.7.12.2 [uninitialized.copy]
  </p>
  
! <blockquote><pre>
! template &lt;<del>class</del> InputIterator <ins>InIter</ins>,
           <del>class ForwardIterator</del> <ins>OutputIterator&lt;auto, InIter::reference&gt; OutIter</ins>&gt; 
     <ins>requires ForwardIterator&lt;OutIter&gt;</ins>
     <del>ForwardIterator</del> <ins>OutIter</ins>
*************** uninitialized_copy 20.9.8.2 [uninitializ
*** 33600,33606 ****
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>for (; first != last; ++result, ++first)  {
     new (static_cast&lt;void*&gt;(&amp;*result))
         <del>typename iterator_traits&lt;ForwardIterator&gt;</del> <ins>OutIter</ins>::value_type(*first);
  }
--- 27477,27484 ----
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>
! for (; first != last; ++result, ++first)  {
     new (static_cast&lt;void*&gt;(&amp;*result))
         <del>typename iterator_traits&lt;ForwardIterator&gt;</del> <ins>OutIter</ins>::value_type(*first);
  }
*************** uninitialized_copy 20.9.8.2 [uninitializ
*** 33612,33618 ****
  
  </blockquote>
  
! <pre>template &lt;<del>class</del> InputIterator <ins>InIter</ins>,
            <del>class</del> <ins>IntegralLike</ins> Size,
            <del>class ForwardIterator</del> <ins>OutputIterator&lt;auto, InIter::reference&gt; OutIter</ins>&gt; 
    <ins>requires ForwardIterator&lt;OutIter&gt;</ins>
--- 27490,27497 ----
  
  </blockquote>
  
! <pre>
! template &lt;<del>class</del> InputIterator <ins>InIter</ins>,
            <del>class</del> <ins>IntegralLike</ins> Size,
            <del>class ForwardIterator</del> <ins>OutputIterator&lt;auto, InIter::reference&gt; OutIter</ins>&gt; 
    <ins>requires ForwardIterator&lt;OutIter&gt;</ins>
*************** uninitialized_copy 20.9.8.2 [uninitializ
*** 33625,33631 ****
  <p>
  -3- Effects:
  </p>
! <blockquote><pre>for ( ; n &gt; <ins>Size(</ins>0<ins>)</ins>; ++result, ++first, --n) {
     new (static_cast&lt;void*&gt;(&amp;*result))
         <del>typename iterator_traits&lt;ForwardIterator&gt;</del> <ins>OutIter</ins>::value_type(*first);
  }
--- 27504,27511 ----
  <p>
  -3- Effects:
  </p>
! <blockquote><pre>
! for ( ; n &gt; <ins>Size(</ins>0<ins>)</ins>; ++result, ++first, --n) {
     new (static_cast&lt;void*&gt;(&amp;*result))
         <del>typename iterator_traits&lt;ForwardIterator&gt;</del> <ins>OutIter</ins>::value_type(*first);
  }
*************** uninitialized_copy 20.9.8.2 [uninitializ
*** 33639,33648 ****
  
  
  <p>
! uninitialized_fill 20.9.8.3 [uninitialized.fill]
  </p>
  
! <blockquote><pre>template &lt;<del>class</del> ForwardIterator <ins>Iter</ins>, <del>class</del> <ins>ObjectType</ins> T&gt;
    <ins>requires Constructible&lt; Iter::value_type, const T&amp; &gt;</ins>
    void uninitialized_fill(<del>ForwardIterator</del> <ins>Iter</ins> first, <del>ForwardIterator</del> <ins>Iter</ins> last, 
                            const T&amp; x);
--- 27519,27529 ----
  
  
  <p>
! uninitialized_fill 20.7.12.3 [uninitialized.fill]
  </p>
  
! <blockquote><pre>
! template &lt;<del>class</del> ForwardIterator <ins>Iter</ins>, <del>class</del> <ins>ObjectType</ins> T&gt;
    <ins>requires Constructible&lt; Iter::value_type, const T&amp; &gt;</ins>
    void uninitialized_fill(<del>ForwardIterator</del> <ins>Iter</ins> first, <del>ForwardIterator</del> <ins>Iter</ins> last, 
                            const T&amp; x);
*************** uninitialized_fill 20.9.8.3 [uninitializ
*** 33652,33658 ****
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>for (; first != last; ++first) {
     new ( static_cast&lt;void*&gt;( &amp;*first) ) 
         <del>typename iterator_traits&lt;ForwardIterator&gt;</del> <ins>Iter</ins>::value_type(x);
  }
--- 27533,27540 ----
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>
! for (; first != last; ++first) {
     new ( static_cast&lt;void*&gt;( &amp;*first) ) 
         <del>typename iterator_traits&lt;ForwardIterator&gt;</del> <ins>Iter</ins>::value_type(x);
  }
*************** uninitialized_fill 20.9.8.3 [uninitializ
*** 33662,33671 ****
  
  
  <p>
! uninitialized_fill_n 20.9.8.4 [uninitialized.fill.n]
  </p>
  
! <blockquote><pre>template &lt;<del>class</del> ForwardIterator <ins>Iter</ins>, <del>class</del> <ins>IntegralLike</ins> Size, <del>class</del> <ins>ObjectType</ins> T&gt; 
    <ins>requires Constructible&lt; Iter::value_type, const T&amp; &gt;</ins>
    void
    uninitialized_fill_n(<del>ForwardIterator</del> <ins>Iter</ins> first, Size n, const T&amp; x);
--- 27544,27554 ----
  
  
  <p>
! uninitialized_fill_n 20.7.12.4 [uninitialized.fill.n]
  </p>
  
! <blockquote><pre>
! template &lt;<del>class</del> ForwardIterator <ins>Iter</ins>, <del>class</del> <ins>IntegralLike</ins> Size, <del>class</del> <ins>ObjectType</ins> T&gt; 
    <ins>requires Constructible&lt; Iter::value_type, const T&amp; &gt;</ins>
    void
    uninitialized_fill_n(<del>ForwardIterator</del> <ins>Iter</ins> first, Size n, const T&amp; x);
*************** uninitialized_fill_n 20.9.8.4 [uninitial
*** 33675,33681 ****
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>for (; n<del>--</del> <ins>&gt; Size(0)</ins>; ++first<ins>, --n</ins>) {
     new ( static_cast&lt;void*&gt;( &amp;*first) ) 
         <del>typename iterator_traits&lt;ForwardIterator&gt;</del> <ins>Iter</ins>::value_type(x);
  }
--- 27558,27565 ----
  <p>
  -1- <i>Effects:</i>
  </p>
! <blockquote><pre>
! for (; n<del>--</del> <ins>&gt; Size(0)</ins>; ++first<ins>, --n</ins>) {
     new ( static_cast&lt;void*&gt;( &amp;*first) ) 
         <del>typename iterator_traits&lt;ForwardIterator&gt;</del> <ins>Iter</ins>::value_type(x);
  }
*************** uninitialized_fill_n 20.9.8.4 [uninitial
*** 33689,33833 ****
  
  
  <hr>
! <h3><a name="1031"></a>1031. Response to US 78</h3>
! <p><b>Section:</b> 20.9.10.2 [util.smartptr.shared] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses US 78</b></p>
! 
! <p>
! There is presently no way to convert directly from a <tt>shared_ptr</tt> to a
! <tt>unique_ptr</tt>. Add an interface that performs the conversion. 
! </p>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote>
! We look forward to a paper on this topic. We recommend no action until a
! paper is available. We believe that the shared pointer must use the default
! deleter for the conversion to succeed.
! </blockquote>
! 
! <p><i>[
! Peter Dimov adds:
! ]</i></p>
! 
! 
! <blockquote>
! This is basically a request for <tt>shared_ptr&lt;&gt;::release</tt> in
! disguise, with all the associated problems. Not a good idea.
! </blockquote>
! 
! <p><i>[
! 2009-07 post-Frankfurt:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! The rationale for the omission of a release() member function from shared_ptr is given in:
! <a href="http://www.boost.org/doc/libs/1_39_0/libs/smart_ptr/shared_ptr.htm">http://www.boost.org/doc/libs/1_39_0/libs/smart_ptr/shared_ptr.htm</a>
! </p>
! <p>
! The implementation of such a member is non-trivial (and maybe
! impossible), because it would need to account for the deleter.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-07-26 Howard sets to Tentatively NAD Future.
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! I took an online poll and got 3 votes for NAD and 3 for NAD Future.  Personally
! I prefer NAD Future as this does refer to an extension that could conceivably be
! considered beyond C++0X.
! </p>
! 
! <p>
! However such an extension would need to solve a couple of problems:
! </p>
! 
! <ol>
! <li>What is the interface for such a conversion when the <tt>shared_ptr</tt> does
! not have unique ownership?  Throw an exception?  Create a null <tt>unique_ptr</tt>?
! Undefined behavior?
! </li>
! 
! <li>
! <p>
! How does one handle custom deleters given to the <tt>shared_ptr</tt> constructor?
! </p>
! <p>
! I do not believe it is possible to implement a general answer to this question.
! The <tt>shared_ptr</tt> deleter is a run time (or construction time) characteristic.
! The <tt>unique_ptr</tt> deleter is a compile time characteristic.  In general one
! can not know to what type of <tt>unqiue_ptr</tt> you are converting to.
! </p>
! <p>
! One answer is for the user of the conversion to specify the deleter type and perhaps
! throw an exception if the specification turns out to be incorrect.
! </p>
! <p>
! Another answer is for the conversion to only be valid when the underlying deleter
! is <tt>default_delete</tt>.  We would probalby need to specify that this is indeed the
! underlying deleter of a <tt>shared_ptr</tt> when a custom deleter is not given in
! the constructor.
! </p>
! </li>
! </ol>
! 
! <p>
! At any rate, there are non-trivial design issues which would need to be implemented
! and tested in the field for usability prior to standardization.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! Moved to NAD Future.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1032"></a>1032. Response to JP 45</h3>
! <p><b>Section:</b> 20.11 [time] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time">issues</a> in [time].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses JP 45</b></p>
  
  <p>
  <tt>Rep</tt>, <tt>Period</tt>, <tt>Clock</tt> and <tt>Duration</tt>
  don't correspond to concept.
  </p>
! <blockquote><pre>template &lt;class Rep, class Period = ratio&lt;1&gt;&gt; class duration; 
  template &lt;class Clock, class Duration = typename Clock::duration&gt; class time_point; 
  </pre></blockquote>
  <p>
  Make concept for <tt>Rep</tt>, <tt>Period</tt>, <tt>Clock</tt> and <tt>Duration</tt>.
! Fix 20.11 [time] and <tt>wait_until</tt>
  and <tt>wait_for</tt>'s template parameter at 30 [thread]. 
  </p>
  
--- 27573,27598 ----
  
  
  <hr>
! <h3><a name="1032"></a>1032. Tome utility templates need to be concept-constrained</h3>
! <p><b>Section:</b> 20.12 [time] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time">issues</a> in [time].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses JP 45 [CD1]</b></p>
  
  <p>
  <tt>Rep</tt>, <tt>Period</tt>, <tt>Clock</tt> and <tt>Duration</tt>
  don't correspond to concept.
  </p>
! <blockquote><pre>
! template &lt;class Rep, class Period = ratio&lt;1&gt;&gt; class duration; 
  template &lt;class Clock, class Duration = typename Clock::duration&gt; class time_point; 
  </pre></blockquote>
  <p>
  Make concept for <tt>Rep</tt>, <tt>Period</tt>, <tt>Clock</tt> and <tt>Duration</tt>.
! Fix 20.12 [time] and <tt>wait_until</tt>
  and <tt>wait_for</tt>'s template parameter at 30 [thread]. 
  </p>
  
*************** Summit:
*** 33836,33845 ****
  ]</i></p>
  
  
! <blockquote>
  We agree that this section needs concepts. We look forward to a paper on
  this topic. We recommend no action until a paper is available.
! </blockquote>
  
  
  
--- 27601,27610 ----
  ]</i></p>
  
  
! <blockquote><p>
  We agree that this section needs concepts. We look forward to a paper on
  this topic. We recommend no action until a paper is available.
! </p></blockquote>
  
  
  
*************** this topic. We recommend no action until
*** 33850,33864 ****
  
  
  <hr>
! <h3><a name="1035"></a>1035. Response to UK 226</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 226</b></p>
  
  <p>
  <tt>&lt;array&gt;</tt> must be added to this list. In particular it
--- 27615,27629 ----
  
  
  <hr>
! <h3><a name="1035"></a>1035. <tt>&lt;array&gt;::swap</tt> can invalidate references, pointers, and iterators</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 226 [CD1]</b></p>
  
  <p>
  <tt>&lt;array&gt;</tt> must be added to this list. In particular it
*************** Summit:
*** 33878,33914 ****
  ]</i></p>
  
  
! <blockquote>
  Agree. The proposed resolution is incomplete. Further work required.
! </blockquote>
  
  <p><i>[
  2009-05-01 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a> also suggests
! adding move constructor to this.
! </blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Howard is to draft a note that explains what happens to references.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Mark as NAD.  No consensus for change.
! </blockquote>
  
  
  
--- 27643,27678 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree. The proposed resolution is incomplete. Further work required.
! </p></blockquote>
  
  <p><i>[
  2009-05-01 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
! Issue <a href="lwg-closed.html#1099">1099</a> also suggests adding move constructor to this.
! </p></blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Howard is to draft a note that explains what happens to references.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Mark as NAD.  No consensus for change.
! </p></blockquote>
  
  
  
*************** Mark as NAD.  No consensus for change.
*** 33919,33940 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a paragraph to 23.3.1.2 [array.special]:
  </p>
  
! <blockquote><pre>template &lt;Swappable T, size_t N&gt; void swap(array&lt;T,N&gt;&amp; x, array&lt;T,N&gt;&amp; y);
  </pre>
  <blockquote>
  <p>
  <i>Effects:</i>
  </p>
! <blockquote><pre>swap_ranges(x.begin(), x.end(), y.begin());
  </pre></blockquote>
  
  <p><ins>
  [<i>Note:</i>
  Outstanding iterators, references and pointers may be invalidated.
! — <i>end note</i>]
  </ins></p>
  </blockquote>
  </blockquote>
--- 27683,27706 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a paragraph to 23.3.2.3 [array.special]:
  </p>
  
! <blockquote><pre>
! template &lt;Swappable T, size_t N&gt; void swap(array&lt;T,N&gt;&amp; x, array&lt;T,N&gt;&amp; y);
  </pre>
  <blockquote>
  <p>
  <i>Effects:</i>
  </p>
! <blockquote><pre>
! swap_ranges(x.begin(), x.end(), y.begin());
  </pre></blockquote>
  
  <p><ins>
  [<i>Note:</i>
  Outstanding iterators, references and pointers may be invalidated.
! &mdash; <i>end note</i>]
  </ins></p>
  </blockquote>
  </blockquote>
*************** Outstanding iterators, references and po
*** 33944,33957 ****
  
  
  <hr>
! <h3><a name="1036"></a>1036. Response to UK 231</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 231</b></p>
  
  <p>
  p9-p11 are redundant now that Concepts define what it means to be an
--- 27710,27723 ----
  
  
  <hr>
! <h3><a name="1036"></a>1036. Remove iterator specification that is redundant due to concept constraints</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 231 [CD1]</b></p>
  
  <p>
  p9-p11 are redundant now that Concepts define what it means to be an
*************** Summit:
*** 33963,33973 ****
  ]</i></p>
  
  
! <blockquote>
  Agree with issue and change to 23.2.3 [sequence.reqmts]. The
  changes required to 21 [strings] will be part of the general
  concept support for that clause.
! </blockquote>
  
  
  
--- 27729,27739 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree with issue and change to 23.2.3 [sequence.reqmts]. The
  changes required to 21 [strings] will be part of the general
  concept support for that clause.
! </p></blockquote>
  
  
  
*************** has constraints similar to
*** 33983,34140 ****
  
  
  <hr>
! <h3><a name="1041"></a>1041. Response to UK 239</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 239</b></p>
! 
! <p>
! It is not possible to take a move-only key out of an unordered
! container, such as (<tt>multi</tt>)<tt>set</tt> or
! (<tt>multi</tt>)<tt>map</tt>, or the new unordered containers.
! </p>
! 
! <p>
! Add below <tt>a.erase(q)</tt>, <tt>a.extract(q)</tt>, with the following notation:
! </p>
! <p>
! <tt>a.extract(q)&gt;</tt>, Return type <tt>pair&lt;key, iterator&gt;</tt>
! Extracts the element pointed to by <tt>q</tt> and erases it from the
! <tt>set</tt>. Returns a <tt>pair</tt> containing the value pointed to by
! <tt>q</tt> and an <tt>iterator</tt> pointing to the element immediately
! following <tt>q</tt> prior to the element being erased. If no such
! element exists,returns <tt>a.end()</tt>.
! </p>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote>
! We look forward to a paper on this topic. We recommend no action until a
! paper is available. The paper would need to address exception safety.
! </blockquote>
! 
! <p><i>[
! Post Summit Alisdair adds:
! ]</i></p>
! 
! 
! <blockquote>
! Would <tt>value_type</tt> be a better return type than <tt>key_type</tt>?
! </blockquote>
! 
! <p><i>[
! 2009-07 post-Frankfurt:
! ]</i></p>
! 
! 
! <blockquote>
! Leave Open. Alisdair to contact Chris Jefferson about this.
! </blockquote>
! 
! <p><i>[
! 2009-09-20 Howard adds:
! ]</i></p>
! 
! 
! <blockquote>
! See the 2009-09-19 comment of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#839">839</a> for an API which
! accomplishes this functionality and also addresses several other use
! cases which this proposal does not.
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! Mark as NAD Future. No consensus to make the change at this time.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! In 23.2.4 [associative.reqmts] Table 85, add:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 85 --  Associative container requirements (in addition to container)</caption>
! <tbody><tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
! <th>Complexity</th>
! </tr>
! <tr><td><tt>a.erase(q)</tt></td>
! <td>...</td>
! <td>...</td>
! <td>...</td>
! </tr><tr>
! <td><ins><tt>a.extract(q)</tt></ins></td>
! <td><ins><tt>pair&lt;key_type, iterator&gt;</tt></ins></td>
! <td><ins>Extracts the element pointed to by <tt>q</tt> and erases it from the <tt>set</tt>. 
! Returns a <tt>pair</tt> containing the value pointed to by <tt>q</tt> and an <tt>iterator</tt>
! pointing to the element immediately following <tt>q</tt> prior to the element being
! erased. If no such element 
! exists, returns <tt>a.end()</tt>.</ins></td>
! <td><ins>amortized constant</ins></td>
! </tr>
! </tbody></table>
! </blockquote>
! 
! <p>
! In 23.2.5 [unord.req] Table 87, add:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 87 -- Unordered associative container requirements (in addition to container)</caption>
! <tbody><tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
! <th>Complexity</th>
! </tr>
! <tr><td><tt>a.erase(q)</tt></td>
! <td>...</td>
! <td>...</td>
! <td>...</td>
! </tr><tr>
! <td><ins><tt>a.extract(q)</tt></ins></td>
! <td><ins><tt>pair&lt;key_type, iterator&gt;</tt></ins></td>
! <td><ins>Extracts the element pointed to by <tt>q</tt> and erases it from the <tt>set</tt>. 
! Returns a <tt>pair</tt> containing the value pointed to by <tt>q</tt> and an <tt>iterator</tt>
! pointing to the element immediately following <tt>q</tt> prior to the element being
! erased. If no such element 
! exists, returns <tt>a.end()</tt>.</ins></td>
! <td><ins>amortized constant</ins></td>
! </tr>
! </tbody></table>
! </blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1042"></a>1042. Response to UK 244</h3>
! <p><b>Section:</b> 23.3 [sequences] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequences">issues</a> in [sequences].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 244</b></p>
  
  <p>
  The validity of the expression <tt>&amp;a[n] == &amp;a[0] + n</tt> is contingent on
--- 27749,27762 ----
  
  
  <hr>
! <h3><a name="1042"></a>1042. Provide <tt>ContiguousStorage</tt> concept and apply it to corresponding containers</h3>
! <p><b>Section:</b> 23.3 [sequences] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequences">issues</a> in [sequences].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 244 [CD1]</b></p>
  
  <p>
  The validity of the expression <tt>&amp;a[n] == &amp;a[0] + n</tt> is contingent on
*************** Suggested solution:
*** 34150,34156 ****
  </p>
  
  <p>
! Define a <tt>ContiguousStrorage</tt> and apply it to
  <tt>vector</tt>, <tt>array</tt> and <tt>string</tt>.
  </p>
  
--- 27772,27778 ----
  </p>
  
  <p>
! Define a <tt>ContiguousStorage</tt> and apply it to
  <tt>vector</tt>, <tt>array</tt> and <tt>string</tt>.
  </p>
  
*************** Summit:
*** 34159,34197 ****
  ]</i></p>
  
  
! <blockquote>
  Agree with the issue but not the details of the proposed solution. Walter to
  provide wording for the new concept.
! </blockquote>
  
  <p><i>[
  Post Summit Alisdair adds:
  ]</i></p>
  
  
! <blockquote>
! Another LWG subgroup wondered if this concept
! should extend to <tt>complex&lt;T&gt;</tt>, and so not be built on the container concept at
! all?
! </blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Leave Open, pending a post-Concepts Working Draft.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Mark issue 1042 as NAD, in rationale state that this was solved by removal of concepts.
! </blockquote>
  
  
  
--- 27781,27818 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree with the issue but not the details of the proposed solution. Walter to
  provide wording for the new concept.
! </p></blockquote>
  
  <p><i>[
  Post Summit Alisdair adds:
  ]</i></p>
  
  
! <blockquote><p>
! Another LWG subgroup wondered if this concept should extend to <tt>complex&lt;T&gt;</tt>, 
! and so not be built on the container concept at all?
! </p></blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Leave Open, pending a post-Concepts Working Draft.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Mark issue 1042 as NAD, in rationale state that this was solved by removal of concepts.
! </p></blockquote>
  
  
  
*************** Mark issue 1042 as NAD, in rationale sta
*** 34200,34206 ****
  Add to <tt>&lt;container_concepts&gt;</tt> synopsis in  [container.concepts]
  </p>
  
! <blockquote><pre><ins>concept&lt; typename C &gt; ContiguousStorageContainer <i>see below</i>;</ins>
  </pre></blockquote>
  
  <p>
--- 27821,27828 ----
  Add to <tt>&lt;container_concepts&gt;</tt> synopsis in  [container.concepts]
  </p>
  
! <blockquote><pre>
! <ins>concept&lt; typename C &gt; ContiguousStorageContainer <i>see below</i>;</ins>
  </pre></blockquote>
  
  <p>
*************** Add a new section to the end of  [contai
*** 34212,34218 ****
  23.1.6.x ContiguousStorageContainer concept [container.concepts.contiguous]
  </p>
  
! <pre>concept ContiguousStorageContainer&lt; typename C &gt;
    : Container&lt;C&gt;
  {
    value_type* data(C&amp;);
--- 27834,27841 ----
  23.1.6.x ContiguousStorageContainer concept [container.concepts.contiguous]
  </p>
  
! <pre>
! concept ContiguousStorageContainer&lt; typename C &gt;
    : Container&lt;C&gt;
  {
    value_type* data(C&amp;);
*************** For example, the elements may be stored
*** 34234,34254 ****
  single array of suitable length.
  </p>
  
! <pre>value_type * data( C&amp; );
  </pre>
  
! <blockquote>
  <i>Returns:</i> a pointer to the first element in the region of storage.
  Result is unspecified for an empty container.
! </blockquote>
  
  </blockquote>
  
  <p>
! Change 23.3.1 [array] p1:
  </p>
  
! <blockquote>
  -1- The header <tt>&lt;array&gt;</tt> defines a class template for
  storing fixed-size sequences of objects. An <tt>array</tt> supports
  random access iterators. An instance of <tt>array&lt;T, N&gt;</tt>
--- 27857,27878 ----
  single array of suitable length.
  </p>
  
! <pre>
! value_type * data( C&amp; );
  </pre>
  
! <blockquote><p>
  <i>Returns:</i> a pointer to the first element in the region of storage.
  Result is unspecified for an empty container.
! </p></blockquote>
  
  </blockquote>
  
  <p>
! Change 23.3.2 [array] p1:
  </p>
  
! <blockquote><p>
  -1- The header <tt>&lt;array&gt;</tt> defines a class template for
  storing fixed-size sequences of objects. An <tt>array</tt> supports
  random access iterators. An instance of <tt>array&lt;T, N&gt;</tt>
*************** contiguously, meaning that <del>if <tt>a
*** 34259,34271 ****
  == &amp;a[0] + n</tt> for all <tt>0 &lt;= n &lt; N</tt></del>
  <ins>satisfies the concept <tt>ContiguousStorageContainer&lt; array&lt;T,
  N&gt;&gt;</tt></ins>.
! </blockquote>
  
  <p>
! Add to the synopsis in 23.3.1 [array]:
  </p>
  
! <blockquote><pre>    ...
      T * data(); 
      const T * data() const; 
    };
--- 27883,27896 ----
  == &amp;a[0] + n</tt> for all <tt>0 &lt;= n &lt; N</tt></del>
  <ins>satisfies the concept <tt>ContiguousStorageContainer&lt; array&lt;T,
  N&gt;&gt;</tt></ins>.
! </p></blockquote>
  
  <p>
! Add to the synopsis in 23.3.2 [array]:
  </p>
  
! <blockquote><pre>
!     ...
      T * data(); 
      const T * data() const; 
    };
*************** Add to the synopsis in 23.3.1 [array]:
*** 34276,34285 ****
  </pre></blockquote>
  
  <p>
! Change 23.4.1 [vector] p1:
  </p>
  
! <blockquote>
  A <tt>vector</tt> is a sequence container that supports random access
  iterators. In addition, it supports (amortized) constant time insert and
  erase operations at the end; insert and erase in the middle take linear
--- 27901,27910 ----
  </pre></blockquote>
  
  <p>
! Change 23.3.6 [vector] p1:
  </p>
  
! <blockquote><p>
  A <tt>vector</tt> is a sequence container that supports random access
  iterators. In addition, it supports (amortized) constant time insert and
  erase operations at the end; insert and erase in the middle take linear
*************** type other than <tt>bool</tt><ins>)</ins
*** 34291,34303 ****
  identity <tt>&amp;v[n] == &amp;v[0] + n</tt> for all <tt>0 &lt;= n &lt;
  v.size()</tt></del> <ins>satisfies the concept <tt>ContiguousStorageContainer&lt;
  vector&lt; T, Alloc&gt;&gt;</tt></ins>.
! </blockquote>
  
  <p>
! Add at the end of the synopsis in 23.4.1 [vector] p2:
  </p>
  
! <blockquote><pre><ins>template&lt; typename T, typename A &gt;
    requires !SameType&lt; T, bool &gt;
    concept_map ContiguousStorageContainer&lt; vector&lt;T, A&gt;&gt; {};</ins>
  </pre></blockquote>
--- 27916,27929 ----
  identity <tt>&amp;v[n] == &amp;v[0] + n</tt> for all <tt>0 &lt;= n &lt;
  v.size()</tt></del> <ins>satisfies the concept <tt>ContiguousStorageContainer&lt;
  vector&lt; T, Alloc&gt;&gt;</tt></ins>.
! </p></blockquote>
  
  <p>
! Add at the end of the synopsis in 23.3.6 [vector] p2:
  </p>
  
! <blockquote><pre>
! <ins>template&lt; typename T, typename A &gt;
    requires !SameType&lt; T, bool &gt;
    concept_map ContiguousStorageContainer&lt; vector&lt;T, A&gt;&gt; {};</ins>
  </pre></blockquote>
*************** Add at the end of the synopsis in 23.4.1
*** 34305,34976 ****
  
  
  <p><b>Rationale:</b></p>
! Solved by removal of concepts.
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1043"></a>1043. Response to US 91</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses US 91</b></p>
! 
! <p>
! It is unclear whether or not a failed <tt>compare_exchange</tt> is a RMW operation
! (as used in 1.10 [intro.multithread]).
! </p>
! 
! <p>
! Suggested solution:
! </p>
! 
! <p>
! Make failing <tt>compare_exchange</tt> operations <b>not</b> be RMW.
! </p>
! 
! <p><i>[
! Anthony Williams adds:
! ]</i></p>
! 
! 
! <blockquote>
! In 29.6 [atomics.types.operations] p18 it says that "These
! operations are atomic read-modify-write operations" (final sentence).
! This is overly restrictive on the implementations of
! <tt>compare_exchange_weak</tt> and <tt>compare_exchange_strong</tt> on platforms without a
! native CAS instruction.
! </blockquote>
! 
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote>
! Group agrees with the resolution as proposed by Anthony Williams in the attached note.
! </blockquote>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote>
! We recommend the proposed resolution be reviewed
! by members of the Concurrency Subgroup.
! </blockquote>
! 
! <p><i>[
! 2009-07 post-Frankfurt:
! ]</i></p>
! 
! 
! <blockquote>
! This is likely to be addressed by Lawrence's upcoming paper. He will
! adopt the proposed resolution.
! </blockquote>
! 
! <p><i>[
! 2009-08-17 Handled by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2925.html">N2925</a>.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Change 29.6 [atomics.types.operations] p18:
! </p>
! 
! <blockquote>
! -18- <i>Effects:</i> Atomically, compares the value pointed to by
! <tt>object</tt> or by <tt>this</tt> for equality with that in
! <tt>expected</tt>, and if true, replaces the value pointed to by
! <tt>object</tt> or by <tt>this</tt> with desired, and if false, updates
! the value in <tt>expected</tt> with the value pointed to by
! <tt>object</tt> or by <tt>this</tt>. Further, if the comparison is true,
! memory is affected according to the value of <tt>success</tt>, and if the
! comparison is false, memory is affected according to the value of
! <tt>failure</tt>. When only one <tt>memory_order</tt> argument is
! supplied, the value of <tt>success</tt> is <tt>order</tt>, and the value
! of <tt>failure</tt> is <tt>order</tt> except that a value of
! <tt>memory_order_acq_rel</tt> shall be replaced by the value
! <tt>memory_order_acquire</tt> and a value of
! <tt>memory_order_release</tt> shall be replaced by the value
! <tt>memory_order_relaxed</tt>. <ins>If the comparison is <tt>true</tt>, </ins>
! <del>T</del><ins>t</ins>hese operations are atomic
! read-modify-write operations (1.10). 
! <ins>If the comparison is <tt>false</tt>, these
! operations are atomic load operations.</ins>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1046"></a>1046. Response to UK 329</h3>
! <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures">issues</a> in [futures].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 329</b></p>
! 
! <p>
! <tt>future</tt>, <tt>promise</tt> and <tt>packaged_task</tt> provide a
! framework for creating future values, but a simple function to tie all
! three components together is missing. Note that we only need a *simple*
! facility for C++0x. Advanced thread pools are to be left for TR2.
! </p>
! 
! <p>
! Simple Proposal:
! </p>
! 
! <p>
! Provide a simple function along the lines of: 
! </p>
! <blockquote><pre>template&lt; typename F, typename ... Args &gt;
!   requires Callable&lt; F, Args... &gt;
!     future&lt; Callable::result_type &gt; async( F&amp;&amp; f, Args &amp;&amp; ... ); 
! </pre></blockquote>
! 
! <p>
! Semantics are similar to creating a <tt>thread</tt> object with a <tt>packaged_task</tt>
! invoking <tt>f</tt> with <tt>forward&lt;Args&gt;(args...)</tt>
! but details are left unspecified to allow different scheduling and thread
! spawning implementations. 
! </p>
! <p>
! It is unspecified whether a task submitted to async is run on its own thread
! or a thread previously used for another async task. If a call to <tt>async</tt>
! succeeds, it shall be safe to wait for it from any thread. 
! </p>
! <p>
! The state of <tt>thread_local</tt> variables shall be preserved during <tt>async</tt> calls. 
! </p>
! <p>
! No two incomplete async tasks shall see the same value of
! <tt>this_thread::get_id()</tt>. 
! </p>
! <p>
! [<i>Note:</i> this effectively forces new tasks to be run on a new thread, or a
! fixed-size pool with no queue. If the 
! library is unable to spawn a new thread or there are no free worker threads
! then the <tt>async</tt> call should fail. <i>--end note</i>] 
! </p>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! The concurrency subgroup has revisited this issue and decided that it
! could be considered a defect according to the Kona compromise. A task
! group was formed lead by Lawrence Crowl and Bjarne Stroustrup to write a
! paper for Frankfort proposing a simple asynchronous launch facility
! returning a <tt>future</tt>. It was agreed that the callable must be run on a
! separate thread from the caller, but not necessarily a brand-new thread.
! The proposal might or might not allow for an implementation that uses
! fixed-size or unlimited thread pools.
! </p>
! <p>
! Bjarne in c++std-lib-23121: I think that what we agreed was that to
! avoid deadlock <tt>async()</tt> would almost certainly be specified to  launch in
! a different thread from the thread that executed <tt>async()</tt>, but I don't
! think it was a specific design constraint.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! Proposed resolution: see
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2996.html">N2996</a>
! (Herb's and Lawrence's paper on Async). Move state to NAD editorial.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1047"></a>1047. Response to UK 334</h3>
! <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 334</b></p>
! 
! <p>
! Behaviour of <tt>get()</tt> is undefined if calling <tt>get()</tt> while
! not <tt>is_ready()</tt>. The intent is that <tt>get()</tt> is a blocking
! call, and will wait for the future to become ready.
! </p>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Agree, move to Review.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-04-03 Thomas J. Gritzan adds:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! This issue also applies to <tt>shared_future::get()</tt>.
! </p>
! 
! <p>
! Suggested wording:
! </p>
! 
! <p>
! Add a paragraph to 30.6.7 [futures.shared_future]:
! </p>
! 
! <blockquote><pre>void shared_future&lt;void&gt;::get() const;
! </pre>
! <blockquote>
! <i>Effects:</i> If <tt>is_ready()</tt> would return <tt>false</tt>, block on the asynchronous 
! result associated with <tt>*this</tt>.
! </blockquote>
! </blockquote>
! </blockquote>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote>
! It is not clear to us that this is an issue,
! because the proposed resolution's Effects clause seems to duplicate
! information already present in the Synchronization clause.
! Keep in Review status.
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.html">N2997</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Add a paragraph to 30.6.6 [futures.unique_future]:
! </p>
! 
! <blockquote><pre>R&amp;&amp; unique_future::get(); 
! R&amp; unique_future&lt;R&amp;&gt;::get(); 
! void unique_future&lt;void&gt;::get();
! </pre>
! <blockquote>
! <p><i>Note:</i>...</p>
! <p>
! <ins><i>Effects:</i> If <tt>is_ready()</tt> would return <tt>false</tt>,
! block on the asynchronous result associated with <tt>*this</tt>.</ins>
! </p>
! <p>
! <i>Synchronization:</i> if <tt>*this</tt> is associated with a
! <tt>promise</tt> object, the completion of <tt>set_value()</tt> or
! <tt>set_exception()</tt> to that <tt>promise</tt> happens before (1.10)
! <tt>get()</tt> returns.
! </p>
! </blockquote>
! </blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1048"></a>1048. Response to UK 335</h3>
! <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 335</b></p>
! 
! <p>
! <tt>std::unique_future</tt> is <tt>MoveConstructible</tt>, so you can transfer the
! association with an asynchronous result from one instance to another.
! However, there is no way to determine whether or not an instance has
! been moved from, and therefore whether or not it is safe to wait for it.
! </p>
! 
! <blockquote><pre>std::promise&lt;int&gt; p;
! std::unique_future&lt;int&gt; uf(p.get_future());
! std::unique_future&lt;int&gt; uf2(std::move(uf));
! uf.wait(); <font color="#C80000">// oops, uf has no result to wait for. </font>
! </pre></blockquote>
! 
! <p>
! Suggest we add a <tt>waitable()</tt> function to <tt>unique_future</tt>
! (and <tt>shared_future</tt>) akin to <tt>std::thread::joinable()</tt>,
! which returns <tt>true</tt> if there is an associated result to wait for
! (whether or not it is ready).
! </p>
! 
! <p>
! Then we can say:
! </p>
! 
! <blockquote><pre>if(uf.waitable()) uf.wait();
! </pre></blockquote>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Create an issue. Requires input from Howard. Probably NAD.
! </p>
! </blockquote>
! 
! <p><i>[
! Post Summit, Howard thows in his two cents:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Here is a copy/paste of my last prototype of <tt>unique_future</tt> which was
! several years ago.  At that time I was calling <tt>unique_future</tt> <tt>future</tt>:
! </p>
! 
! <blockquote><pre>template &lt;class R&gt;
! class future
! {
! public:
!     typedef R result_type;
! private:
!     future(const future&amp;);// = delete;
!     future&amp; operator=(const future&amp;);// = delete;
! 
!     template &lt;class R1, class F1&gt; friend class prommise;
! public:
!     future();
!     ~future();
! 
!     future(future&amp;&amp; f);
!     future&amp; operator=(future&amp;&amp; f);
! 
!     void swap(future&amp;&amp; f);
! 
!     <b>bool joinable() const;</b>
!     bool is_normal() const;
!     bool is_exceptional() const;
!     bool is_ready() const;
! 
!     R get();
! 
!     void join();
!     template &lt;class ElapsedTime&gt;
!         bool timed_join(const ElapsedTime&amp;);
! };
! </pre></blockquote>
! 
! <p>
! <tt>shared_future</tt> had a similar interface.  I intentionally reused
! the <tt>thread</tt> interface where possible to lessen the learning
! curve std::lib clients will be faced with.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.html">N2997</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1049"></a>1049. Response to UK 339</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 339</b></p>
! 
! <p>
! Move assignment is goiing in the wrong direction, assigning from
! <tt>*this</tt> to the passed rvalue, and then returning a reference to
! an unusable <tt>*this</tt>.
! </p>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Agree, move to Review.
! </p>
! </blockquote>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote>
! We recommend deferring this issue until after Detlef's paper (on futures)
! has been issued.
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.html">N2997</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Strike 30.6.5 [futures.promise] p6 and change p7:
! </p>
! 
! <blockquote><pre>promise&amp; operator=(promise&amp;&amp; rhs);
! </pre>
! <blockquote>
! <p>
! <del>-6- <i>Effects:</i> move assigns its associated state to <tt>rhs</tt>.</del>
! </p>
! <p>
! -7- <i>Postcondition:</i> <del><tt>*this</tt> has no associated
! state.</del> <ins>associated state of <tt>*this</tt> is the same as the
! associated state of <tt>rhs</tt> before the call. <tt>rhs</tt> has no
! associated state.</ins>
! </p>
! </blockquote>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1050"></a>1050. Response to UK 340</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 340</b></p>
! 
! <p>
! There is an implied postcondition for <tt>get_future()</tt> that the state of the
! <tt>promise</tt> is transferred into the <tt>future</tt> leaving the <tt>promise</tt> with no
! associated state. It should be spelled out.
! </p>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Agree, move to Review.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-04-03 Thomas J. Gritzan adds:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! <tt>promise::get_future()</tt> must not invalidate the state of the promise object. 
! </p>
! <p>
! A promise is used like this: 
! </p>
! <blockquote><pre>promise&lt;int&gt; p; 
! unique_future&lt;int&gt; f = p.get_future(); 
! <font color="#C80000">// post 'p' to a thread that calculates a value </font>
! <font color="#C80000">// use 'f' to retrieve the value. </font>
! </pre></blockquote>
! <p>
! So <tt>get_future()</tt> must return an object that shares the same associated 
! state with <tt>*this</tt>. 
! </p>
! <p>
! But still, this function should throw an <tt>future_already_retrieved</tt> error 
! when it is called twice. 
! </p>
! <p>
! <tt>packaged_task::get_future()</tt> throws <tt>std::bad_function_call</tt> if its <tt>future</tt>
! was already retrieved. It should throw 
! <tt>future_error(future_already_retrieved)</tt>, too. 
! </p>
! <p>
! Suggested resolution: 
! </p>
! <p>
! Replace p12/p13 30.6.5 [futures.promise]: 
! </p>
! <blockquote>
! <p>
! -12- <i>Throws:</i> <tt>future_error</tt> if <del><tt>*this</tt> has no associated state</del>
! <ins>the <tt>future</tt> has already been retrieved</ins>.
! </p>
! <p>
! -13- <i>Error conditions:</i> <tt>future_already_retrieved</tt> if <del><tt>*this</tt>
! has no associated state</del>
! <ins>the <tt>future</tt> associated with 
! the associated state has already been retrieved</ins>.
! </p>
! <p>
! <ins><i>Postcondition:</i> The returned object and <tt>*this</tt> share the associated state.</ins>
! </p>
! </blockquote>
! <p>
! Replace p14 30.6.10 [futures.task]: 
! </p>
! <blockquote>
! <p>
! -14- <i>Throws:</i> <tt><del>std::bad_function_call</del> <ins>future_error</ins></tt> if the future <del>associated with
! the task</del> has already been retrieved.
! </p>
! 
! <p><ins>
! <i>Error conditions:</i> <tt>future_already_retrieved</tt> if the <tt>future</tt> associated with 
! the task has already been retrieved. 
! </ins></p>
! <p>
! <ins><i>Postcondition:</i> The returned object and <tt>*this</tt> share the associated task.</ins>
! </p>
! </blockquote>
! </blockquote>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote>
! Keep in Review status
! pending Detlef's forthcoming paper on futures.
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.html">N2997</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Add after p13 30.6.5 [futures.promise]:
! </p>
! 
! <blockquote><pre>unique_future&lt;R&gt; get_future();
! </pre>
! <blockquote>
! <p>
! -13- ...
! </p>
! <p>
! <i>Postcondition:</i> <tt>*this</tt> has no associated state.
! </p>
! </blockquote>
! </blockquote>
! 
  
  
  
  
  
  <hr>
! <h3><a name="1051"></a>1051. Response to UK 279</h3>
! <p><b>Section:</b> 24.5.1.3.12 [reverse.iter.opindex], 24.5.3.3.12 [move.iter.op.index] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 279</b></p>
  
  <p>
! The reason the return type became unspecified is LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#386">386</a>. This
  reasoning no longer applies as there are at least two ways to get the right
  return type with the new language facilities added since the previous
  standard. 
--- 27931,27954 ----
  
  
  <p><b>Rationale:</b></p>
! <p>Solved by removal of concepts.</p>
  
  
  
  
  
  <hr>
! <h3><a name="1051"></a>1051. Specify subscript operation return types of <tt>reverse_iterator</tt> and <tt>move_iterator</tt></h3>
! <p><b>Section:</b> 24.5.1.3.12 [reverse.iter.opindex], 24.5.3.3.12 [move.iter.op.index] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reverse.iter.opindex">issues</a> in [reverse.iter.opindex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 279 [CD1]</b></p>
  
  <p>
! The reason the return type became unspecified is LWG issue <a href="lwg-defects.html#386">386</a>. This
  reasoning no longer applies as there are at least two ways to get the right
  return type with the new language facilities added since the previous
  standard. 
*************** Howard adds post Summit:
*** 34997,35005 ****
  ]</i></p>
  
  
! <blockquote>
  I am requesting test cases to demonstrate a position.
! </blockquote>
  
  <p><i>[
  2009-07-24 Daniel adds:
--- 27975,27983 ----
  ]</i></p>
  
  
! <blockquote><p>
  I am requesting test cases to demonstrate a position.
! </p></blockquote>
  
  <p><i>[
  2009-07-24 Daniel adds:
*************** I recommend NAD. Without concepts we can
*** 35012,35018 ****
  restrict this member in a trivial way. Using <tt>decltype</tt> the
  declaration would be along the lines of
  </p>
! <blockquote><pre>static const Iter&amp; __base(); // not defined
  auto operator[](difference_type n) const -&gt; decltype(__base()[-n-1]);
  </pre></blockquote>
  
--- 27990,27997 ----
  restrict this member in a trivial way. Using <tt>decltype</tt> the
  declaration would be along the lines of
  </p>
! <blockquote><pre>
! static const Iter&amp; __base(); // not defined
  auto operator[](difference_type n) const -&gt; decltype(__base()[-n-1]);
  </pre></blockquote>
  
*************** required, and no silent SFINAE eliminati
*** 35030,35038 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD.
! </blockquote>
  
  <p><i>[
  2009-10-22 Daniel adds:
--- 28009,28017 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD.
! </p></blockquote>
  
  <p><i>[
  2009-10-22 Daniel adds:
*************** be ABI compatible, though.
*** 35064,35070 ****
  It is now your own decision how to proceed ;-)
  </p>
  
! <blockquote><pre>#include &lt;type_traits&gt;
  #include &lt;cstddef&gt;
  
  template&lt;class T&gt;
--- 28043,28050 ----
  It is now your own decision how to proceed ;-)
  </p>
  
! <blockquote><pre>
! #include &lt;type_traits&gt;
  #include &lt;cstddef&gt;
  
  template&lt;class T&gt;
*************** int main() {
*** 35098,35104 ****
  The above declaration could be simplified, but the ideal solution
  </p>
  
! <blockquote><pre>template&lt;class U = It&gt;
    decltype(declval&lt;const U&amp;&gt;()[declval&lt;difference_type&gt;()])
       operator[](difference_type n) const;
  </pre></blockquote>
--- 28078,28085 ----
  The above declaration could be simplified, but the ideal solution
  </p>
  
! <blockquote><pre>
! template&lt;class U = It&gt;
    decltype(declval&lt;const U&amp;&gt;()[declval&lt;difference_type&gt;()])
       operator[](difference_type n) const;
  </pre></blockquote>
*************** does not work yet on gcc 4.4.1.
*** 35119,35639 ****
  
  
  <hr>
- <h3><a name="1052"></a>1052. Response to UK 281</h3>
- <p><b>Section:</b> 24.5.1.3.5 [reverse.iter.opref] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses UK 281</b></p>
- 
- <p>
- The current specification for return value for <tt>reverse_iterator::operator-&gt;</tt>
- will always be a true pointer type, but <tt>reverse_iterator</tt> supports proxy
- iterators where the pointer type may be some kind of 'smart pointer'.
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- <tt>move_iterator</tt> avoids this problem by returning a value of the wrapped
- Iterator type.
- study group formed to come up with a suggested resolution.
- </p>
- <p>
- <tt>move_iterator</tt> solution shown in proposed wording.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-07 post-Frankfurt:
- ]</i></p>
- 
- 
- <blockquote>
- Howard to deconceptize. Move to Review after that happens.
- </blockquote>
- 
- <p><i>[
- 2009-08-01 Howard deconceptized:
- ]</i></p>
- 
- 
- <blockquote>
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- We can't think of any reason we can't just define reverse
- iterator's pointer types to be the same as the underlying iterator's
- pointer type, and get it by calling the right arrow directly.
- </p>
- <p>
- Here is the proposed wording that was replaced:
- </p>
- <blockquote><pre>template &lt;class Iterator&gt; 
- class reverse_iterator { 
-   ...
-   typedef <del>typename iterator_traits&lt;</del>Iterator<del>&gt;::pointer</del> pointer;
- </pre></blockquote>
- 
- <p>
- Change 24.5.1.3.5 [reverse.iter.opref]:
- </p>
- 
- <blockquote><pre>pointer operator-&gt;() const;
- </pre>
- <blockquote>
- <i>Returns:</i>
- <blockquote><pre><del>&amp;(operator*());</del>
- <ins>this-&gt;tmp = current;</ins>
- <ins>--this-&gt;tmp;</ins>
- <ins>return this-&gt;tmp;</ins>
- </pre></blockquote>
- </blockquote>
- </blockquote>
- </blockquote>
- 
- <p><i>[
- 2010-03-03 Daniel opens:
- ]</i></p>
- 
- 
- <blockquote>
- <ol>
- 
- <li>
- There is a minor problem with the exposition-only declaration of the private
- member <tt>deref_tmp</tt> which is modified in a const member function (and the
- same problem occurs in the specification of <tt>operator*</tt>). The fix is to
- make it a mutable member.
- </li>
- 
- <li>
- <p>
- The more severe problem is that the resolution for some reasons
- does not explain in the rationale why it was decided to differ from
- the suggested fix (using <tt>deref_tmp</tt> instead of <tt>tmp</tt>) in the
- [ 2009-10 Santa Cruz] comment:
- </p>
- 
- <blockquote><pre>this-&gt;deref_tmp = current;
- --this-&gt;deref_tmp;
- return this-&gt;deref_tmp;
- </pre></blockquote>
- 
- <p>
- combined with the change of
- </p>
- 
- <blockquote><pre>typedef typename iterator_traits&lt;Iterator&gt;::pointer pointer;
- </pre></blockquote>
- 
- <p>
- to
- </p>
- 
- <blockquote><pre>typedef Iterator pointer;
- </pre></blockquote>
- 
- <p>
- The problem of the agreed on wording is that the following rather
- typical example, that compiled with the wording before 1052 had
- been applied, won't compile anymore:
- </p>
- 
- <blockquote><pre>#include &lt;iterator&gt;
- #include &lt;utility&gt;
- 
- int main() {
-   typedef std::pair&lt;int, double&gt; P;
-   P op;
-   std::reverse_iterator&lt;P*&gt; ri(&amp;op + 1);
-   ri-&gt;first; // Error
- }
- </pre></blockquote>
- 
- <p>
- Comeau online returns (if a correspondingly changed
- <tt>reverse_iterator</tt> is used):
- </p>
- 
- <blockquote><pre>"error: expression must have class type
-      return deref_tmp.operator-&gt;();
-             ^
-          detected during instantiation of "Iterator
-                    reverse_iterator&lt;Iterator&gt;::operator-&gt;() const [with
-                    Iterator=std::pair&lt;int, double&gt; *]""
- </pre></blockquote>
- 
- <p>
- Thus the change will break valid, existing code based
- on <tt>std::reverse_iterator</tt>.
- </p>
- 
- </li>
- 
- </ol>
- 
- <p>
- IMO the suggestion proposed in the comment is a necessary fix, which harmonizes
- with the similar specification of <tt>std::move_iterator</tt> and properly
- reflects the recursive nature of the evaluation of <tt>operator-&gt;</tt>
- overloads.
- </p>
- 
- <p>
- Suggested resolution:
- </p>
- 
- <ol>
- 
- <li>
- <p>
- In the class template <tt>reverse_iterator</tt> synopsis of 24.5.1.1 [reverse.iterator] change as indicated:
- </p>
- 
- <blockquote><pre>namespace std {
- template &lt;class Iterator&gt;
- class reverse_iterator : public
-              iterator&lt;typename iterator_traits&lt;Iterator&gt;::iterator_category,
-              typename iterator_traits&lt;Iterator&gt;::value_type,
-              typename iterator_traits&lt;Iterator&gt;::difference_type,
-              <del>typename iterator_traits&lt;</del>Iterator<del>&gt;::pointer</del>,
-              typename iterator_traits&lt;Iterator&gt;::reference&gt; {
- public:
-   [..]
-   typedef <del>typename iterator_traits&lt;</del>Iterator<del>&gt;::pointer</del> pointer;
-   [..]
- protected:
-   Iterator current;
- private:
-   <ins>mutable</ins> Iterator deref_tmp; // exposition only
- };
- </pre></blockquote>
- </li>
- 
- <li>
- Change 24.5.1.3.5 [reverse.iter.opref]/1 as indicated:
- 
- <blockquote><pre>pointer operator-&gt;() const;
- </pre>
- 
- <blockquote>
- 1 <i><del>Returns</del> <ins>Effects</ins>:</i> <del><tt>&amp;(operator*())</tt>.</del>
- <blockquote><pre><ins>deref_tmp = current;</ins>
- <ins>--deref_tmp;</ins>
- <ins>return deref_tmp;</ins>
- </pre></blockquote>
- </blockquote>
- </blockquote>
- 
- </li>
- 
- </ol>
- 
- </blockquote>
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- We prefer to make to use a local variable instead of <tt>deref_tmp</tt> within
- <tt>operator-&gt;()</tt>.  And although this means that the <tt>mutable</tt>
- change is no longer needed, we prefer to keep it because it is needed for
- <tt>operator*()</tt> anyway.
- </p>
- 
- <p>
- Here is the proposed wording that was replaced:
- </p>
- 
- <blockquote class="note">
- <p>
- Change 24.5.1.3.5 [reverse.iter.opref]:
- </p>
- 
- <blockquote><pre>pointer operator-&gt;() const;
- </pre>
- 
- <blockquote>
- 
- <i>Returns:</i>
- <blockquote><pre><del>&amp;(operator*());</del>
- <ins>deref_tmp = current;
- --deref_tmp;
- return deref_tmp::operator-&gt;();</ins>
- </pre></blockquote>
- 
- </blockquote>
- </blockquote>
- 
- 
- </blockquote>
- </blockquote>
- 
- <p><i>[
- 2010-03-10 Howard adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Here are three tests that the current proposed wording passes, and no
- other solution I've seen passes all three:
- </p>
- 
- <ol>
- <li>
- <p>
- Proxy pointer support:
- </p>
- <blockquote><pre>#include &lt;iterator&gt;
- #include &lt;cassert&gt;
- 
- struct X { int m; };
- 
- X x;
- 
- struct IterX {
-     typedef std::bidirectional_iterator_tag iterator_category;
-     typedef X&amp; reference;
-     struct pointer
-     {
-         pointer(X&amp; v) : value(v) {}
-         X&amp; value;
-         X* operator-&gt;() const {return &amp;value;}
-     };
-     typedef std::ptrdiff_t difference_type;
-     typedef X value_type;
-     // additional iterator requirements not important for this issue
-     
-     reference operator*() const { return x; }
-     pointer operator-&gt;() const { return pointer(x); }
-     IterX&amp; operator--() {return *this;}
- 
- };
- 
- int main()
- {
-     std::reverse_iterator&lt;IterX&gt; ix;
-     assert(&amp;ix-&gt;m == &amp;(*ix).m);
- }
- </pre></blockquote>
- </li>
- <li>
- <p>
- Raw pointer support:
- </p>
- <blockquote><pre>#include &lt;iterator&gt;
- #include &lt;utility&gt;
- 
- int main() {
-   typedef std::pair&lt;int, double&gt; P;
-   P op;
-   std::reverse_iterator&lt;P*&gt; ri(&amp;op + 1);
-   ri-&gt;first; // Error
- }
- </pre></blockquote>
- </li>
- <li>
- <p>
- Caching iterator support:
- </p>
- <blockquote><pre>#include &lt;iterator&gt;
- #include &lt;cassert&gt;
- 
- struct X { int m; };
- 
- struct IterX {
-     typedef std::bidirectional_iterator_tag iterator_category;
-     typedef X&amp; reference;
-     typedef X* pointer;
-     typedef std::ptrdiff_t difference_type;
-     typedef X value_type;
-     // additional iterator requirements not important for this issue
-     
-     reference operator*() const { return value; }
-     pointer operator-&gt;() const { return &amp;value; }
-     IterX&amp; operator--() {return *this;}
- 
- private:
-     mutable X value;
- };
- 
- int main()
- {
-     std::reverse_iterator&lt;IterX&gt; ix;
-     assert(&amp;ix-&gt;m == &amp;(*ix).m);
- }
- </pre></blockquote>
- </li>
- </ol>
- </blockquote>
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to NAD Future, rationale added.
- </blockquote>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- The LWG did not reach a consensus for a change to the WP.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- <ol>
- 
- <li>
- <p>
- In the class template <tt>reverse_iterator</tt> synopsis of 24.5.1.1 [reverse.iterator] change as indicated:
- </p>
- 
- <blockquote><pre>namespace std {
- template &lt;class Iterator&gt;
- class reverse_iterator : public
-              iterator&lt;typename iterator_traits&lt;Iterator&gt;::iterator_category,
-              typename iterator_traits&lt;Iterator&gt;::value_type,
-              typename iterator_traits&lt;Iterator&gt;::difference_type,
-              <del>typename iterator_traits&lt;</del>Iterator<ins>&amp;</ins><del>&gt;::pointer</del>,
-              typename iterator_traits&lt;Iterator&gt;::reference&gt; {
- public:
-   [..]
-   typedef <del>typename iterator_traits&lt;</del>Iterator<ins>&amp;</ins><del>&gt;::pointer</del> pointer;
-   [..]
- protected:
-   Iterator current;
- private:
-   <ins>mutable</ins> Iterator deref_tmp; // exposition only
- };
- </pre></blockquote>
- </li>
- 
- <li>
- Change 24.5.1.3.5 [reverse.iter.opref]/1 as indicated:
- 
- <blockquote><pre>pointer operator-&gt;() const;
- </pre>
- 
- <blockquote>
- 1 <i><del>Returns</del> <ins>Effects</ins>:</i> <del><tt>&amp;(operator*())</tt>.</del>
- <blockquote><pre><ins>deref_tmp = current;</ins>
- <ins>--deref_tmp;</ins>
- <ins>return deref_tmp;</ins>
- </pre></blockquote>
- </blockquote>
- </blockquote>
- 
- </li>
- 
- </ol>
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1053"></a>1053. Response to UK 295</h3>
- <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#algorithms">issues</a> in [algorithms].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses UK 295</b></p>
- 
- <p>
- There is a level of redundancy in the library specification for many
- algorithms that can be eliminated with the combination of concepts and
- default parameters for function templates. Eliminating redundancy simplified
- specification and reduces the risk of introducing accidental
- inconsistencies.
- </p>
- <p>
- Proposed resolution: Adopt
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2743.pdf">N2743</a>.
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- NAD, this change would break code that takes the address of an
- algorithm.
- </p>
- </blockquote>
- 
- <p><i>[
- Post Summit Alisdair adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Request 'Open'.  The issues in the paper go beyond just reducing
- the number of signatures, but cover unifying the idea of the ordering
- operation used by algorithms, containers and other library components.  At
- least, it takes a first pass at the problem.
- </p>
- 
- <p>
- For me (personally) that was the more important part of the paper, and not
- clearly addressed by the Summit resolution.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Too inventive, too late, would really need a paper. Moved to NAD Future.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1056"></a>1056. Must all Engines and Distributions be Streamable?</h3>
! <p><b>Section:</b> 26.5 [rand] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28100,28110 ----
  
  
  <hr>
  <h3><a name="1056"></a>1056. Must all Engines and Distributions be Streamable?</h3>
! <p><b>Section:</b> 26.5 [rand] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** persistence via streaming.
*** 35660,35668 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open.
! </blockquote>
  
  <p><i>[
  2009-05-31 Alisdair adds:
--- 28131,28139 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open.
! </p></blockquote>
  
  <p><i>[
  2009-05-31 Alisdair adds:
*************** below) to include when moving to NAD.
*** 35718,35726 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively NAD after 5 positive votes on c++std-lib.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 28189,28197 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively NAD after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** clause now concepts are removed.
*** 35747,35756 ****
  
  <hr>
  <h3><a name="1057"></a>1057. <tt>RandomNumberEngineAdaptor</tt></h3>
! <p><b>Section:</b> 26.5 [rand] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28218,28227 ----
  
  <hr>
  <h3><a name="1057"></a>1057. <tt>RandomNumberEngineAdaptor</tt></h3>
! <p><b>Section:</b> 26.5 [rand] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** Move to Open.
*** 35809,35818 ****
  
  <hr>
  <h3><a name="1058"></a>1058. New container issue</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28280,28289 ----
  
  <hr>
  <h3><a name="1058"></a>1058. New container issue</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** element constructed from <tt>args</tt> i
*** 35862,35871 ****
  
  <hr>
  <h3><a name="1059"></a>1059. Usage of no longer existing FunctionType concept</h3>
! <p><b>Section:</b> 20.8.14.2 [func.wrap.func] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Due to a deliberate core language decision, the earlier called
--- 28333,28343 ----
  
  <hr>
  <h3><a name="1059"></a>1059. Usage of no longer existing FunctionType concept</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Due to a deliberate core language decision, the earlier called
*************** before the first "conceptualized" versio
*** 35877,35884 ****
  had been
  prepared. This caused a break of the library, which already used this
  concept in the adapted definition of <tt>std::function</tt>
! (20.8 [function.objects]/2, header <tt>&lt;functional&gt;</tt> synopsis and
! 20.8.14.2 [func.wrap.func]).
  </p>
  <p>
  A simple fix would be to either (a) make <tt>std::function</tt>'s primary template
--- 28349,28356 ----
  had been
  prepared. This caused a break of the library, which already used this
  concept in the adapted definition of <tt>std::function</tt>
! (20.9 [function.objects]/2, header <tt>&lt;functional&gt;</tt> synopsis and
! 20.9.12.2 [func.wrap.func]).
  </p>
  <p>
  A simple fix would be to either (a) make <tt>std::function</tt>'s primary template
*************** specialization that matches every "free
*** 35898,35904 ****
  type w/o cv-qualifier-seq and w/o ref-qualifier).
  Expressing such a type as as single requirement would be written as
  </p>
! <blockquote><pre>template&lt;typename T&gt;
  requires ReferentType&lt;T&gt; // Eliminate cv void and function types with cv-qual-seq
                           //   or ref-qual (depending on core issue #749)
        &amp;&amp; PointeeType&lt;T&gt;  // Eliminate reference types
--- 28370,28377 ----
  type w/o cv-qualifier-seq and w/o ref-qualifier).
  Expressing such a type as as single requirement would be written as
  </p>
! <blockquote><pre>
! template&lt;typename T&gt;
  requires ReferentType&lt;T&gt; // Eliminate cv void and function types with cv-qual-seq
                           //   or ref-qual (depending on core issue #749)
        &amp;&amp; PointeeType&lt;T&gt;  // Eliminate reference types
*************** requires ReferentType&lt;T&gt; // Elimin
*** 35908,35914 ****
  Just for completeness approach (c), which would make sense, if the
  library has more reasons to constrain for free function types:
  </p>
! <blockquote><pre>auto concept FreeFunctionType&lt;typename T&gt;
    : ReferentType&lt;T&gt;, PointeeType&lt;T&gt;, MemberPointeeType&lt;T&gt;
  {
    requires !ObjectType&lt;T&gt;;
--- 28381,28388 ----
  Just for completeness approach (c), which would make sense, if the
  library has more reasons to constrain for free function types:
  </p>
! <blockquote><pre>
! auto concept FreeFunctionType&lt;typename T&gt;
    : ReferentType&lt;T&gt;, PointeeType&lt;T&gt;, MemberPointeeType&lt;T&gt;
  {
    requires !ObjectType&lt;T&gt;;
*************** their feedback.  Move to Open.
*** 35953,35961 ****
  <ol>
  <li>
  <p>
! Change in 20.8 [function.objects]/2, Header <tt>&lt;functional&gt;</tt> synopsis:
  </p>
! <blockquote><pre>// 20.6.16 polymorphic function wrappers:
  class bad_function_call;
  template&lt;<del>FunctionType</del><ins>ReferentType F</ins>&gt;
  <ins>requires PointeeType&lt;F&gt; &amp;&amp; !ObjectType&lt;F&gt;</ins>
--- 28427,28436 ----
  <ol>
  <li>
  <p>
! Change in 20.9 [function.objects]/2, Header <tt>&lt;functional&gt;</tt> synopsis:
  </p>
! <blockquote><pre>
! // 20.6.16 polymorphic function wrappers:
  class bad_function_call;
  template&lt;<del>FunctionType</del><ins>ReferentType F</ins>&gt;
  <ins>requires PointeeType&lt;F&gt; &amp;&amp; !ObjectType&lt;F&gt;</ins>
*************** class function; // undefined
*** 35964,35972 ****
  </li>
  <li>
  <p>
! Change in 20.8.14.2 [func.wrap.func]:
  </p>
! <blockquote><pre>namespace std {
  template&lt;<del>FunctionType</del><ins>ReferentType F</ins>&gt;
  <ins>requires PointeeType&lt;F&gt; &amp;&amp; !ObjectType&lt;F&gt;</ins>
  class function; // undefined
--- 28439,28448 ----
  </li>
  <li>
  <p>
! Change in 20.9.12.2 [func.wrap.func]:
  </p>
! <blockquote><pre>
! namespace std {
  template&lt;<del>FunctionType</del><ins>ReferentType F</ins>&gt;
  <ins>requires PointeeType&lt;F&gt; &amp;&amp; !ObjectType&lt;F&gt;</ins>
  class function; // undefined
*************** class function; // undefined
*** 35980,35988 ****
  
  <hr>
  <h3><a name="1060"></a>1060. Embedded nulls in NTBS</h3>
! <p><b>Section:</b> 17.5.2.1.4.1 [byte.strings] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28456,28464 ----
  
  <hr>
  <h3><a name="1060"></a>1060. Embedded nulls in NTBS</h3>
! <p><b>Section:</b> 17.5.2.1.4.1 [byte.strings] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** surprising, and probably not supportable
*** 35994,36003 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the issue, but believe this can be handled editorially.
  Move to NAD Editorial.
! </blockquote>
  
  
  
--- 28470,28479 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the issue, but believe this can be handled editorially.
  Move to NAD Editorial.
! </p></blockquote>
  
  
  
*************** Move to NAD Editorial.
*** 36009,36017 ****
  
  <hr>
  <h3><a name="1061"></a>1061. Bad indexing for tuple access to pair (Editorial?)</h3>
! <p><b>Section:</b> 20.3.5.4 [pair.astuple] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28485,28493 ----
  
  <hr>
  <h3><a name="1061"></a>1061. Bad indexing for tuple access to pair (Editorial?)</h3>
! <p><b>Section:</b> 20.3.4 [pair.astuple] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** given a negative integer.
*** 36023,36040 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to NAD Editorial.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 20.3.5.4 [pair.astuple] p5:
  </p>
  
! <blockquote><pre>template&lt;<del>int</del> <ins>size_t</ins> I, class T1, class T2&gt; 
    requires True&lt;(I &lt; 2)&gt; 
    const P&amp; get(const pair&lt;T1, T2&gt;&amp;);
  </pre>
--- 28499,28517 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to NAD Editorial.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 20.3.4 [pair.astuple] p5:
  </p>
  
! <blockquote><pre>
! template&lt;<del>int</del> <ins>size_t</ins> I, class T1, class T2&gt; 
    requires True&lt;(I &lt; 2)&gt; 
    const P&amp; get(const pair&lt;T1, T2&gt;&amp;);
  </pre>
*************** Move to NAD Editorial.
*** 36047,36056 ****
  
  <hr>
  <h3><a name="1062"></a>1062. Missing insert_iterator for stacks/queues</h3>
! <p><b>Section:</b> 24.5.2 [insert.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#insert.iterators">issues</a> in [insert.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28524,28533 ----
  
  <hr>
  <h3><a name="1062"></a>1062. Missing insert_iterator for stacks/queues</h3>
! <p><b>Section:</b> 24.5.2 [insert.iterators] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#insert.iterators">issues</a> in [insert.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** Committee Draft is issued.
*** 36085,36102 ****
  ]</i></p>
  
  
! <blockquote>
  A poll on the LWG reflector voted unanimously to move this issue to Tentatively NAD Future.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD.  The intent of these adapters are to restrict the interfaces.
! </blockquote>
  
  
  
--- 28562,28579 ----
  ]</i></p>
  
  
! <blockquote><p>
  A poll on the LWG reflector voted unanimously to move this issue to Tentatively NAD Future.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD.  The intent of these adapters are to restrict the interfaces.
! </p></blockquote>
  
  
  
*************** Moved to NAD.  The intent of these adapt
*** 36108,36116 ****
  
  <hr>
  <h3><a name="1063"></a>1063. 03 iterator compatibilty</h3>
! <p><b>Section:</b> X [iterator.backward] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28585,28593 ----
  
  <hr>
  <h3><a name="1063"></a>1063. 03 iterator compatibilty</h3>
! <p><b>Section:</b> X [iterator.backward] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** Which header must a user <tt>#include</t
*** 36122,36148 ****
  This is important information, as existing user code will break if this
  header is not included, and we should make a point of mandating this header
  is <tt>#include</tt>-d by library headers likely to make use of it, notably
! <tt>&lt;algorithm&gt;</tt>.  See issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a> for more details.
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the direction of the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  We believe this is NAD Concepts, but this needs to be reviewed against the
  post-remove-concepts draft.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 28599,28625 ----
  This is important information, as existing user code will break if this
  header is not included, and we should make a point of mandating this header
  is <tt>#include</tt>-d by library headers likely to make use of it, notably
! <tt>&lt;algorithm&gt;</tt>.  See issue <a href="lwg-closed.html#1001">1001</a> for more details.
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the direction of the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  We believe this is NAD Concepts, but this needs to be reviewed against the
  post-remove-concepts draft.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** indicated:</i></p>
*** 36169,36181 ****
  
  
  <hr>
! <h3><a name="1064"></a>1064. Response to UK 152</h3>
! <p><b>Section:</b> 17.3.18 [defns.obj.state] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 152</b></p>
  
  <p>
  Object state is using a definition of object (instance of a class) from
--- 28646,28658 ----
  
  
  <hr>
! <h3><a name="1064"></a>1064. Term "object state" should not refer to classes</h3>
! <p><b>Section:</b> 17.3 [defns.obj.state] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 152 [CD1]</b></p>
  
  <p>
  Object state is using a definition of object (instance of a class) from
*************** outside the standard, rather than the 'r
*** 36187,36204 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  We think we're removing this; See X [func.referenceclosure.cons].
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Mark as NAD.  This will not affect user or implementer code
! </blockquote>
  
  
  
--- 28664,28681 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  We think we're removing this; See X [func.referenceclosure.cons].
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Mark as NAD.  This will not affect user or implementer code
! </p></blockquote>
  
  
  
*************** Mark as NAD.  This will not affect user
*** 36212,36220 ****
  
  <hr>
  <h3><a name="1067"></a>1067. simplified wording for inner_product</h3>
! <p><b>Section:</b> 26.7 [numeric.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-17 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28689,28698 ----
  
  <hr>
  <h3><a name="1067"></a>1067. simplified wording for inner_product</h3>
! <p><b>Section:</b> 26.7 [numeric.ops] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numeric.ops">issues</a> in [numeric.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** template type parameters.
*** 36240,36252 ****
  <p>
  one part of the suggested resolution suggests the removal of the
  <tt>MoveConstructible&lt;T&gt;</tt> requirement from
! <tt>inner_product</tt>. According to 26.7.2 [inner.product]
  </p>
  
! <blockquote>
  Computes its result by initializing the accumulator <tt>acc</tt> with the
  initial value <tt>init</tt>
! </blockquote>
  
  <p>
  this step requires at least <tt>MoveConstructible</tt>.
--- 28718,28730 ----
  <p>
  one part of the suggested resolution suggests the removal of the
  <tt>MoveConstructible&lt;T&gt;</tt> requirement from
! <tt>inner_product</tt>. According to 26.7.3 [inner.product]
  </p>
  
! <blockquote><p>
  Computes its result by initializing the accumulator <tt>acc</tt> with the
  initial value <tt>init</tt>
! </p></blockquote>
  
  <p>
  this step requires at least <tt>MoveConstructible</tt>.
*************** Move to Tentatively Ready.
*** 36277,36296 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change in 26.7 [numeric.ops] and 26.7.1 [accumulate]:
  </p>
  
! <blockquote><pre>template &lt;InputIterator Iter, MoveConstructible T&gt;
   requires <ins>add =</ins> HasPlus&lt;T, Iter::reference&gt;
         &amp;&amp; HasAssign&lt;T, <del>HasPlus&lt;T, Iter::reference&gt;</del> <ins>add</ins>::result_type&gt;
   T accumulate(Iter first, Iter last, T init);
  </pre></blockquote>
  
  <p>
! Change in 26.7 [numeric.ops] and 26.7.2 [inner.product]:
  </p>
  
! <blockquote><pre>template &lt;InputIterator Iter1, InputIterator Iter2, MoveConstructible T&gt;
    requires <ins>mult =</ins> HasMultiply&lt;Iter1::reference, Iter2::reference&gt;
          &amp;&amp; <ins>add =</ins> HasPlus&lt;T, <del>HasMultiply&lt;Iter1::reference, Iter2::reference&gt;</del> <ins>mult</ins>::result_type&gt;
          &amp;&amp; HasAssign&lt; 
--- 28755,28776 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change in 26.7 [numeric.ops] and 26.7.2 [accumulate]:
  </p>
  
! <blockquote><pre>
! template &lt;InputIterator Iter, MoveConstructible T&gt;
   requires <ins>add =</ins> HasPlus&lt;T, Iter::reference&gt;
         &amp;&amp; HasAssign&lt;T, <del>HasPlus&lt;T, Iter::reference&gt;</del> <ins>add</ins>::result_type&gt;
   T accumulate(Iter first, Iter last, T init);
  </pre></blockquote>
  
  <p>
! Change in 26.7 [numeric.ops] and 26.7.3 [inner.product]:
  </p>
  
! <blockquote><pre>
! template &lt;InputIterator Iter1, InputIterator Iter2, MoveConstructible T&gt;
    requires <ins>mult =</ins> HasMultiply&lt;Iter1::reference, Iter2::reference&gt;
          &amp;&amp; <ins>add =</ins> HasPlus&lt;T, <del>HasMultiply&lt;Iter1::reference, Iter2::reference&gt;</del> <ins>mult</ins>::result_type&gt;
          &amp;&amp; HasAssign&lt; 
*************** Change in 26.7 [numeric.ops] and 26.7.2
*** 36301,36310 ****
  </pre></blockquote>
  
  <p>
! Change in 26.7 [numeric.ops] and 26.7.3 [partial.sum]:
  </p>
  
! <blockquote><pre>template &lt;InputIterator InIter, OutputIterator&lt;auto, const InIter::value_type&amp;&gt; OutIter&gt;
    requires <ins>add =</ins> HasPlus&lt;InIter::value_type, InIter::reference&gt;
          &amp;&amp; HasAssign&lt;InIter::value_type,
                       <del>HasPlus&lt;InIter::value_type, InIter::reference&gt;</del> <ins>add</ins>::result_type&gt;
--- 28781,28791 ----
  </pre></blockquote>
  
  <p>
! Change in 26.7 [numeric.ops] and 26.7.4 [partial.sum]:
  </p>
  
! <blockquote><pre>
! template &lt;InputIterator InIter, OutputIterator&lt;auto, const InIter::value_type&amp;&gt; OutIter&gt;
    requires <ins>add =</ins> HasPlus&lt;InIter::value_type, InIter::reference&gt;
          &amp;&amp; HasAssign&lt;InIter::value_type,
                       <del>HasPlus&lt;InIter::value_type, InIter::reference&gt;</del> <ins>add</ins>::result_type&gt;
*************** Change in 26.7 [numeric.ops] and 26.7.3
*** 36313,36322 ****
  </pre></blockquote>
  
  <p>
! Change in 26.7 [numeric.ops] and 26.7.4 [adjacent.difference]:
  </p>
  
! <blockquote><pre>template &lt;InputIterator InIter, OutputIterator&lt;auto, const InIter::value_type&amp;&gt; OutIter&gt;
    requires <ins>sub =</ins> HasMinus&lt;InIter::value_type, InIter::value_type&gt;
          &amp;&amp; Constructible&lt;InIter::value_type, InIter::reference&gt;
          &amp;&amp; OutputIterator&lt;OutIter, <del>HasMinus&lt;InIter::value_type, InIter::value_type&gt;</del> <ins>sub</ins>::result_type&gt;
--- 28794,28804 ----
  </pre></blockquote>
  
  <p>
! Change in 26.7 [numeric.ops] and 26.7.5 [adjacent.difference]:
  </p>
  
! <blockquote><pre>
! template &lt;InputIterator InIter, OutputIterator&lt;auto, const InIter::value_type&amp;&gt; OutIter&gt;
    requires <ins>sub =</ins> HasMinus&lt;InIter::value_type, InIter::value_type&gt;
          &amp;&amp; Constructible&lt;InIter::value_type, InIter::reference&gt;
          &amp;&amp; OutputIterator&lt;OutIter, <del>HasMinus&lt;InIter::value_type, InIter::value_type&gt;</del> <ins>sub</ins>::result_type&gt;
*************** Change in 26.7 [numeric.ops] and 26.7.4
*** 36330,36340 ****
  
  
  <hr>
! <h3><a name="1068"></a>1068. class random_device should be movable</h3>
! <p><b>Section:</b> 26.5.6 [rand.device] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-18 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.device">issues</a> in [rand.device].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28812,28822 ----
  
  
  <hr>
! <h3><a name="1068"></a>1068. class <tt>random_device</tt> should be movable</h3>
! <p><b>Section:</b> 26.5.6 [rand.device] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.device">issues</a> in [rand.device].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** class <tt>random_device</tt> should be m
*** 36345,36363 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, and recommend this issue be deferred until after the next
  Committee Draft is issued.
! </blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Leave open. Walter to provide drafting as part of his planned paper.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD.
--- 28827,28845 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open, and recommend this issue be deferred until after the next
  Committee Draft is issued.
! </p></blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Leave open. Walter to provide drafting as part of his planned paper.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD.
*************** WP is correct as written.
*** 36379,36389 ****
  
  
  <hr>
! <h3><a name="1069"></a>1069. class seed_seq should support efficient move operations</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-18 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 28861,28871 ----
  
  
  <hr>
! <h3><a name="1069"></a>1069. class <tt>seed_seq</tt> should support efficient move operations</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** class <tt>seed_seq</tt> should support e
*** 36394,36423 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, and recommend this issue be deferred until after the next
  Committee Draft is issued.
! </blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Leave open. Walter to provide drafting as part of his planned paper.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  <tt>seed_seq</tt> is explicitly not copyable, so, much like LWG issue
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, LWG issue 1069 could be marked NAD to be consistent
  with this.
! </blockquote>
  
  
  
--- 28876,28905 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open, and recommend this issue be deferred until after the next
  Committee Draft is issued.
! </p></blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Leave open. Walter to provide drafting as part of his planned paper.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  <tt>seed_seq</tt> is explicitly not copyable, so, much like LWG issue
! <a href="lwg-closed.html#1068">1068</a>, LWG issue 1069 could be marked NAD to be consistent
  with this.
! </p></blockquote>
  
  
  
*************** with this.
*** 36428,36448 ****
  
  
  <hr>
! <h3><a name="1072"></a>1072. Is std::hash a constrained template or not?</h3>
! <p><b>Section:</b> 20.8.15 [unord.hash] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  Is <tt>std::hash</tt> a constrained template or not?
  </p>
  <p>
! According to Class template hash 20.8.15 [unord.hash], the definition is:
  </p>
  
! <blockquote><pre>template &lt;class T&gt;
  struct hash : public std::unary_function&lt;T, std::size_t&gt; {
    std::size_t operator()(T val) const;
  };
--- 28910,28932 ----
  
  
  <hr>
! <h3><a name="1072"></a>1072. Is <tt>std::hash</tt> a constrained template or not?</h3>
! <p><b>Section:</b> 20.9.13 [unord.hash] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.hash">active issues</a> in [unord.hash].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  Is <tt>std::hash</tt> a constrained template or not?
  </p>
  <p>
! According to class template <tt>hash</tt> 20.9.13 [unord.hash], the definition is:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt;
  struct hash : public std::unary_function&lt;T, std::size_t&gt; {
    std::size_t operator()(T val) const;
  };
*************** And so unconstrained.
*** 36453,36462 ****
  </p>
  <p>
  According to the <tt>&lt;functional&gt;</tt> synopsis in p2 Function objects
! 20.8 [function.objects] the template is declared as:
  </p>
  
! <blockquote><pre>template &lt;ReferentType T&gt; struct hash;
  </pre></blockquote>
  
  <p>
--- 28937,28947 ----
  </p>
  <p>
  According to the <tt>&lt;functional&gt;</tt> synopsis in p2 Function objects
! 20.9 [function.objects] the template is declared as:
  </p>
  
! <blockquote><pre>
! template &lt;ReferentType T&gt; struct hash;
  </pre></blockquote>
  
  <p>
*************** Move to Open.
*** 36492,36515 ****
  
  <p>
  [To the editor: This resolution is merge-compatible to the
! resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1078">1078</a>]
  </p>
  
  <ol>
  <li>
  <p>
! In 20.8 [function.objects]/2, header <tt>&lt;functional&gt;</tt> synopsis, change as indicated:
  </p>
  
! <blockquote><pre>// 20.6.17, hash function base template:
  template &lt;ReferentType T&gt; struct hash; <ins>// undefined</ins>
  </pre></blockquote>
  </li>
  <li>
  <p>
! In 20.8.15 [unord.hash]/1 change as indicated:
  </p>
! <blockquote><pre>namespace std {
   <del>template &lt;class T&gt;
   struct hash : public std::unary_function&lt;T, std::size_t&gt; {
   std::size_t operator()(T val) const;
--- 28977,29002 ----
  
  <p>
  [To the editor: This resolution is merge-compatible to the
! resolution of <a href="lwg-closed.html#1078">1078</a>]
  </p>
  
  <ol>
  <li>
  <p>
! In 20.9 [function.objects]/2, header <tt>&lt;functional&gt;</tt> synopsis, change as indicated:
  </p>
  
! <blockquote><pre>
! // 20.6.17, hash function base template:
  template &lt;ReferentType T&gt; struct hash; <ins>// undefined</ins>
  </pre></blockquote>
  </li>
  <li>
  <p>
! In 20.9.13 [unord.hash]/1 change as indicated:
  </p>
! <blockquote><pre>
! namespace std {
   <del>template &lt;class T&gt;
   struct hash : public std::unary_function&lt;T, std::size_t&gt; {
   std::size_t operator()(T val) const;
*************** In 20.8.15 [unord.hash]/1 change as indi
*** 36520,36529 ****
  </li>
  <li>
  <p>
! In 20.8.15 [unord.hash]/2 change as indicated:
  </p>
  
! <blockquote>
  -2-  <ins>For all library-provided specializations, the template
  instantiation <tt>hash&lt;T&gt;</tt>
    shall provide a public <tt>operator()</tt> with return type <tt>std::size_t</tt> to
--- 29007,29016 ----
  </li>
  <li>
  <p>
! In 20.9.13 [unord.hash]/2 change as indicated:
  </p>
  
! <blockquote><p>
  -2-  <ins>For all library-provided specializations, the template
  instantiation <tt>hash&lt;T&gt;</tt>
    shall provide a public <tt>operator()</tt> with return type <tt>std::size_t</tt> to
*************** type or reference to
*** 36535,36547 ****
    </ins> The return value of <tt>operator()</tt> is unspecified, except that
  equal arguments
    shall yield the same result. <tt>operator()</tt> shall not throw exceptions.
! </blockquote>
  </li>
  <li>
  <p>
  In 18.7 [support.rtti]/1, header <tt>&lt;typeinfo&gt;</tt> synopsis change as indicated:
  </p>
! <blockquote><pre>namespace std {
    class type_info;
    class type_index;
    template &lt;<del>class</del><ins>ReferentType</ins> T&gt; struct hash;
--- 29022,29035 ----
    </ins> The return value of <tt>operator()</tt> is unspecified, except that
  equal arguments
    shall yield the same result. <tt>operator()</tt> shall not throw exceptions.
! </p></blockquote>
  </li>
  <li>
  <p>
  In 18.7 [support.rtti]/1, header <tt>&lt;typeinfo&gt;</tt> synopsis change as indicated:
  </p>
! <blockquote><pre>
! namespace std {
    class type_info;
    class type_index;
    template &lt;<del>class</del><ins>ReferentType</ins> T&gt; struct hash;
*************** In 18.7 [support.rtti]/1, header <tt>&lt
*** 36555,36563 ****
  
  <hr>
  <h3><a name="1074"></a>1074. concept map broken by N2840</h3>
! <p><b>Section:</b> X [allocator.element.concepts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 29043,29051 ----
  
  <hr>
  <h3><a name="1074"></a>1074. concept map broken by N2840</h3>
! <p><b>Section:</b> X [allocator.element.concepts] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** The changes to the <tt>AllocatableElemen
*** 36569,36575 ****
  specialization no longer matches the original concept:
  </p>
  
! <blockquote><pre>template &lt;Allocator Alloc, class T, class ... Args&gt;
    requires HasConstructor&lt;T, Args...&gt;
      concept_map AllocatableElement&lt;Alloc, T, Args&amp;&amp;...&gt; {
        void construct_element(Alloc&amp; a, T* t, Args&amp;&amp;... args) {
--- 29057,29064 ----
  specialization no longer matches the original concept:
  </p>
  
! <blockquote><pre>
! template &lt;Allocator Alloc, class T, class ... Args&gt;
    requires HasConstructor&lt;T, Args...&gt;
      concept_map AllocatableElement&lt;Alloc, T, Args&amp;&amp;...&gt; {
        void construct_element(Alloc&amp; a, T* t, Args&amp;&amp;... args) {
*************** specialization no longer matches the ori
*** 36583,36589 ****
  ]</i></p>
  
  
! <blockquote>
  Actually, this is incorrect,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2840.pdf">N2840</a>
  says. "In section 
--- 29072,29078 ----
  ]</i></p>
  
  
! <blockquote><p>
  Actually, this is incorrect,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2840.pdf">N2840</a>
  says. "In section 
*************** default implementation.  This regrettabl
*** 36600,36606 ****
  Abrahams, Doug, and myself) to be preferable to the complexity of
  providing a default implementation that would not under-constrain a more
  restrictive allocator (like the scoped allocators).
! </blockquote>
  
  <p><i>[
  2009-05-01 Daniel adds:
--- 29089,29095 ----
  Abrahams, Doug, and myself) to be preferable to the complexity of
  providing a default implementation that would not under-constrain a more
  restrictive allocator (like the scoped allocators).
! </p></blockquote>
  
  <p><i>[
  2009-05-01 Daniel adds:
*************** current WP has already removed the previ
*** 36613,36619 ****
  It introduced auto concept AllocatableElement instead, but as of
  X [allocator.element.concepts]/7 this guy contains now
  </p>
! <blockquote><pre>requires FreeStoreAllocatable&lt;T&gt;;
  void Alloc::construct(T*, Args&amp;&amp;...);
  </pre></blockquote>
  </blockquote>
--- 29102,29109 ----
  It introduced auto concept AllocatableElement instead, but as of
  X [allocator.element.concepts]/7 this guy contains now
  </p>
! <blockquote><pre>
! requires FreeStoreAllocatable&lt;T&gt;;
  void Alloc::construct(T*, Args&amp;&amp;...);
  </pre></blockquote>
  </blockquote>
*************** Move to NAD.
*** 36637,36643 ****
  Change X [allocator.element.concepts]:
  </p>
  
! <blockquote><pre>template &lt;Allocator Alloc, class T, class ... Args&gt;
    requires HasConstructor&lt;T, Args...&gt;
      concept_map AllocatableElement&lt;Alloc, T, Args&amp;&amp;...&gt; {
        void construct_element(<del>Alloc&amp; a,</del> T* t, Args&amp;&amp;... args) {
--- 29127,29134 ----
  Change X [allocator.element.concepts]:
  </p>
  
! <blockquote><pre>
! template &lt;Allocator Alloc, class T, class ... Args&gt;
    requires HasConstructor&lt;T, Args...&gt;
      concept_map AllocatableElement&lt;Alloc, T, Args&amp;&amp;...&gt; {
        void construct_element(<del>Alloc&amp; a,</del> T* t, Args&amp;&amp;... args) {
*************** Change X [allocator.element.concepts]:
*** 36653,36661 ****
  
  <hr>
  <h3><a name="1076"></a>1076. unary/binary_negate need constraining and move support</h3>
! <p><b>Section:</b> 20.8.9 [negators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The class templates <tt>unary/binary_negate</tt> need constraining and move support.
--- 29144,29152 ----
  
  <hr>
  <h3><a name="1076"></a>1076. unary/binary_negate need constraining and move support</h3>
! <p><b>Section:</b> 20.9.9 [negators] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The class templates <tt>unary/binary_negate</tt> need constraining and move support.
*************** because it is ill-formed at several plac
*** 36691,36703 ****
  <p>
  In concept AdaptableUnaryFunction change
  </p>
! <blockquote><pre>typename X::result_type;
  typename X::argument_type;
  </pre></blockquote>
  <p>
  to
  </p>
! <blockquote><pre>Returnable result_type = typename X::result_type;
  typename argument_type = typename X::argument_type;
  </pre></blockquote>
  <p>
--- 29182,29196 ----
  <p>
  In concept AdaptableUnaryFunction change
  </p>
! <blockquote><pre>
! typename X::result_type;
  typename X::argument_type;
  </pre></blockquote>
  <p>
  to
  </p>
! <blockquote><pre>
! Returnable result_type = typename X::result_type;
  typename argument_type = typename X::argument_type;
  </pre></blockquote>
  <p>
*************** result_type" is non-editorial, but maybe
*** 36709,36722 ****
  <p>
  In concept AdaptableBinaryFunction change
  </p>
! <blockquote><pre>typename X::result_type;
  typename X::first_argument_type;
  typename X::second_argument_type;
  </pre></blockquote>
  <p>
  to
  </p>
! <blockquote><pre>Returnable result_type = typename X::result_type;
  typename first_argument_type = typename X::first_argument_type;
  typename second_argument_type = typename X::second_argument_type;
  </pre></blockquote>
--- 29202,29217 ----
  <p>
  In concept AdaptableBinaryFunction change
  </p>
! <blockquote><pre>
! typename X::result_type;
  typename X::first_argument_type;
  typename X::second_argument_type;
  </pre></blockquote>
  <p>
  to
  </p>
! <blockquote><pre>
! Returnable result_type = typename X::result_type;
  typename first_argument_type = typename X::first_argument_type;
  typename second_argument_type = typename X::second_argument_type;
  </pre></blockquote>
*************** result_type" is non-editorial, but maybe
*** 36730,36736 ****
  <p>
  In class unary/binary_function
  </p>
! <ol type="a">
  <li>
  I suggest to change "ReturnType" to "Returnable" in both cases.
  </li>
--- 29225,29231 ----
  <p>
  In class unary/binary_function
  </p>
! <ol style="list-style-type:lower-alpha">
  <li>
  I suggest to change "ReturnType" to "Returnable" in both cases.
  </li>
*************** they would still remain unconstrained: T
*** 36747,36776 ****
  single requirement needs to be added to enable requirement implication. This
  could be done via a dummy ("requires True&lt;true&gt;") or just explicit as follows:
  </p>
! <ol type="a">
  <li>
! <blockquote><pre>template &lt;AdaptableUnaryFunction P&gt;
  requires Predicate&lt; P, P::argument_type&gt;
  unary_negate&lt;P&gt; not1(const P&amp;&amp; pred);
  template &lt;AdaptableUnaryFunction P&gt;
  requires Predicate&lt; P, P::argument_type &gt;
  unary_negate&lt;P&gt; not1(P&amp;&amp; pred);
  </pre>
! <blockquote>
  -3- Returns: unary_negate&lt;P&gt;(pred).
! </blockquote>
  </blockquote>
  <p>
  [Don't we want a move call for the second overload as in
  </p>
! <blockquote><pre>unary_negate&lt;P&gt;(std::move(pred))
  </pre></blockquote>
  <p>
  in the Returns clause ?]
  </p>
  </li>
  <li>
! <pre>template &lt;AdaptableBinaryFunction P&gt;
  requires Predicate&lt; P, P::first_argument_type, P::second_argument_type &gt;
  binary_negate&lt;P&gt; not2(const P&amp; pred);
  template &lt;AdaptableBinaryFunction P&gt;
--- 29242,29274 ----
  single requirement needs to be added to enable requirement implication. This
  could be done via a dummy ("requires True&lt;true&gt;") or just explicit as follows:
  </p>
! <ol style="list-style-type:lower-alpha">
  <li>
! <blockquote><pre>
! template &lt;AdaptableUnaryFunction P&gt;
  requires Predicate&lt; P, P::argument_type&gt;
  unary_negate&lt;P&gt; not1(const P&amp;&amp; pred);
  template &lt;AdaptableUnaryFunction P&gt;
  requires Predicate&lt; P, P::argument_type &gt;
  unary_negate&lt;P&gt; not1(P&amp;&amp; pred);
  </pre>
! <blockquote><p>
  -3- Returns: unary_negate&lt;P&gt;(pred).
! </p></blockquote>
  </blockquote>
  <p>
  [Don't we want a move call for the second overload as in
  </p>
! <blockquote><pre>
! unary_negate&lt;P&gt;(std::move(pred))
  </pre></blockquote>
  <p>
  in the Returns clause ?]
  </p>
  </li>
  <li>
! <pre>
! template &lt;AdaptableBinaryFunction P&gt;
  requires Predicate&lt; P, P::first_argument_type, P::second_argument_type &gt;
  binary_negate&lt;P&gt; not2(const P&amp; pred);
  template &lt;AdaptableBinaryFunction P&gt;
*************** binary_negate&lt;P&gt; not2(P&amp;&amp;
*** 36783,36789 ****
  <p>
  [Don't we want a move call for the second overload as in
  </p>
! <blockquote><pre>binary_negate&lt;P&gt;(std::move(pred))
  </pre></blockquote>
  <p>
  in the Returns clause ?]
--- 29281,29288 ----
  <p>
  [Don't we want a move call for the second overload as in
  </p>
! <blockquote><pre>
! binary_negate&lt;P&gt;(std::move(pred))
  </pre></blockquote>
  <p>
  in the Returns clause ?]
*************** Move to Open.
*** 36819,36828 ****
  ]</i></p>
  
  
! <blockquote>
  Leave open pending the potential move constructor paper. Note that
  we consider the "constraining" part NAD Concepts.
! </blockquote>
  
  <p><i>[
  2010-01-31 Alisdair removes the current proposed wording from the proposed
--- 29318,29327 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave open pending the potential move constructor paper. Note that
  we consider the "constraining" part NAD Concepts.
! </p></blockquote>
  
  <p><i>[
  2010-01-31 Alisdair removes the current proposed wording from the proposed
*************** wording section because it is based on c
*** 36835,36841 ****
  Add new concepts where appropriate::
  </p>
  
! <blockquote><pre>auto concept AdaptableUnaryFunction&lt; typename X &gt; {
    typename X::result_type;
    typename X::argument_type;
  }
--- 29334,29341 ----
  Add new concepts where appropriate::
  </p>
  
! <blockquote><pre>
! auto concept AdaptableUnaryFunction&lt; typename X &gt; {
    typename X::result_type;
    typename X::argument_type;
  }
*************** Revise as follows:
*** 36852,36858 ****
  </p>
  
  <p>
! Base X [base] (Only change is constrained Result)
  </p>
  
  <blockquote>
--- 29352,29358 ----
  </p>
  
  <p>
! Base  [base] (Only change is constrained Result)
  </p>
  
  <blockquote>
*************** Base X [base] (Only change is constraine
*** 36860,36866 ****
  -1-  The following classes are provided to simplify the typedefs of the
  argument and result types:
  </p>
! <pre>namespace std {
    template &lt;class Arg, <del>class</del> <ins>ReturnType</ins> Result&gt;
    struct unary_function {
       typedef Arg    argument_type;
--- 29360,29367 ----
  -1-  The following classes are provided to simplify the typedefs of the
  argument and result types:
  </p>
! <pre>
! namespace std {
    template &lt;class Arg, <del>class</del> <ins>ReturnType</ins> Result&gt;
    struct unary_function {
       typedef Arg    argument_type;
*************** argument and result types:
*** 36877,36883 ****
  </pre></blockquote>
  
  <p>
! Negators 20.8.9 [negators]:
  </p>
  
  <blockquote>
--- 29378,29384 ----
  </pre></blockquote>
  
  <p>
! Negators 20.9.9 [negators]:
  </p>
  
  <blockquote>
*************** Negators 20.8.9 [negators]:
*** 36886,36892 ****
  respectively, and return their complements (5.3.1).
  </p>
  
! <pre>template &lt;<del>class</del> <ins>AdaptableUnaryFunction</ins> P<del>redicate</del>&gt;
    <ins>requires Predicate&lt; P, P::argument_type &gt;</ins>
    class unary_negate
      : public unary_function&lt;<del>typename</del> P<del>redicate</del>::argument_type,bool&gt; {
--- 29387,29394 ----
  respectively, and return their complements (5.3.1).
  </p>
  
! <pre>
! template &lt;<del>class</del> <ins>AdaptableUnaryFunction</ins> P<del>redicate</del>&gt;
    <ins>requires Predicate&lt; P, P::argument_type &gt;</ins>
    class unary_negate
      : public unary_function&lt;<del>typename</del> P<del>redicate</del>::argument_type,bool&gt; {
*************** respectively, and return their complemen
*** 36902,36921 ****
      bool operator()(const <del>typename</del> P<del>redicate</del>::argument_type&amp; x) const;
    };
  </pre>
! <blockquote>
  -2 <tt>operator()</tt> returns <tt>!pred(x)</tt>.
! </blockquote>
  
! <pre>template &lt;class Predicate&gt;
    unary_negate&lt;Predicate&gt; not1(const Predicate&amp;amp; pred);
  <ins>template &lt;class Predicate&gt;
    unary_negate&lt;Predicate&gt; not1(Predicate&amp;&amp; pred);</ins>
  </pre>
! <blockquote>
  -3-  <i>Returns:</i> <tt>unary_negate&lt;Predicate&gt;(pred)</tt>.
! </blockquote>
  
! <pre>template &lt;<del>class</del> <ins>AdaptableBinaryFunction</ins> P<del>redicate</del> &gt;
    <ins>requires Predicate&lt; P, P::first_argument_type, P::second_argument_type &gt;</ins>
    class binary_negate
      : public binary_function&lt;<del>typename</del> P<del>redicate</del>::first_argument_type,
--- 29404,29425 ----
      bool operator()(const <del>typename</del> P<del>redicate</del>::argument_type&amp; x) const;
    };
  </pre>
! <blockquote><p>
  -2 <tt>operator()</tt> returns <tt>!pred(x)</tt>.
! </p></blockquote>
  
! <pre>
! template &lt;class Predicate&gt;
    unary_negate&lt;Predicate&gt; not1(const Predicate&amp;amp; pred);
  <ins>template &lt;class Predicate&gt;
    unary_negate&lt;Predicate&gt; not1(Predicate&amp;&amp; pred);</ins>
  </pre>
! <blockquote><p>
  -3-  <i>Returns:</i> <tt>unary_negate&lt;Predicate&gt;(pred)</tt>.
! </p></blockquote>
  
! <pre>
! template &lt;<del>class</del> <ins>AdaptableBinaryFunction</ins> P<del>redicate</del> &gt;
    <ins>requires Predicate&lt; P, P::first_argument_type, P::second_argument_type &gt;</ins>
    class binary_negate
      : public binary_function&lt;<del>typename</del> P<del>redicate</del>::first_argument_type,
*************** respectively, and return their complemen
*** 36933,36951 ****
                      const <del>typename</del> P<del>redicate</del>::second_argument_type&amp; y) const;
    };
  </pre>
! <blockquote>
  -4- <tt>operator()</tt> returns <tt>!pred(x,y)</tt>.
! </blockquote>
  
! <pre>template &lt;class Predicate&gt;
    binary_negate&lt;Predicate&gt; not2(const Predicate&amp; pred);
  <ins>template &lt;class Predicate&gt;
    binary_negate&lt;Predicate&gt; not2(Predicate&amp;&amp; pred);</ins>
  </pre>
  
! <blockquote>
  -5- <i>Returns:</i> <tt>binary_negate&lt;Predicate&gt;(pred)</tt>.
! </blockquote>
  </blockquote>
  
  </blockquote>
--- 29437,29456 ----
                      const <del>typename</del> P<del>redicate</del>::second_argument_type&amp; y) const;
    };
  </pre>
! <blockquote><p>
  -4- <tt>operator()</tt> returns <tt>!pred(x,y)</tt>.
! </p></blockquote>
  
! <pre>
! template &lt;class Predicate&gt;
    binary_negate&lt;Predicate&gt; not2(const Predicate&amp; pred);
  <ins>template &lt;class Predicate&gt;
    binary_negate&lt;Predicate&gt; not2(Predicate&amp;&amp; pred);</ins>
  </pre>
  
! <blockquote><p>
  -5- <i>Returns:</i> <tt>binary_negate&lt;Predicate&gt;(pred)</tt>.
! </p></blockquote>
  </blockquote>
  
  </blockquote>
*************** respectively, and return their complemen
*** 36956,36964 ****
  ]</i></p>
  
  
! <blockquote>
! Move to NAD Concepts.  The move-semantic part has been addressed by a core language change, which implicitly generates appropriate move constructors and move-assignment operators.
! </blockquote>
  
  
  
--- 29461,29470 ----
  ]</i></p>
  
  
! <blockquote><p>
! Move to NAD Concepts.  The move-semantic part has been addressed by a core language change, 
! which implicitly generates appropriate move constructors and move-assignment operators.
! </p></blockquote>
  
  
  
*************** Move to NAD Concepts.  The move-semantic
*** 36970,36985 ****
  
  <hr>
  <h3><a name="1077"></a>1077. Nonesense <tt>tuple</tt> declarations</h3>
! <p><b>Section:</b> 20.4.2 [tuple.tuple] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.tuple">issues</a> in [tuple.tuple].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class template tuple 20.4.2 [tuple.tuple]:
  </p>
  
! <blockquote><pre>template &lt;class... UTypes&gt;
    requires Constructible&lt;Types, const UTypes&amp;&gt;...
  template &lt;class... UTypes&gt;
    requires Constructible&lt;Types, RvalueOf&lt;UTypes&gt;::type&gt;...
--- 29476,29492 ----
  
  <hr>
  <h3><a name="1077"></a>1077. Nonesense <tt>tuple</tt> declarations</h3>
! <p><b>Section:</b> 20.4.2 [tuple.tuple] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.tuple">issues</a> in [tuple.tuple].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class template tuple 20.4.2 [tuple.tuple]:
  </p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt;
    requires Constructible&lt;Types, const UTypes&amp;&gt;...
  template &lt;class... UTypes&gt;
    requires Constructible&lt;Types, RvalueOf&lt;UTypes&gt;::type&gt;...
*************** Somebody needs to look at this and say w
*** 36998,37006 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  The resolution looks correct; move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 29505,29513 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  The resolution looks correct; move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** The resolution looks correct; move to NA
*** 37008,37014 ****
  In 20.4.2 [tuple.tuple], class <tt>tuple</tt>, change as indicated:
  </p>
  
! <blockquote><pre>template &lt;class... UTypes&gt;
    requires Constructible&lt;Types, const UTypes&amp;&gt;...
    <ins>tuple(const pair&lt;UTypes...&gt;&amp;);</ins>
  template &lt;class... UTypes&gt;
--- 29515,29522 ----
  In 20.4.2 [tuple.tuple], class <tt>tuple</tt>, change as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt;
    requires Constructible&lt;Types, const UTypes&amp;&gt;...
    <ins>tuple(const pair&lt;UTypes...&gt;&amp;);</ins>
  template &lt;class... UTypes&gt;
*************** template &lt;class... UTypes&gt;
*** 37026,37034 ****
  
  <hr>
  <h3><a name="1078"></a>1078. DE-17: Remove class type_index</h3>
! <p><b>Section:</b> 20.13 [type.index] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses DE 17</b></p>
--- 29534,29543 ----
  
  <hr>
  <h3><a name="1078"></a>1078. DE-17: Remove class type_index</h3>
! <p><b>Section:</b> 20.14 [type.index] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#type.index">issues</a> in [type.index].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses DE 17</b></p>
*************** needed for <tt>name()</tt> and <tt>befor
*** 37067,37073 ****
  <p>Modify the header &lt;typeinfo&gt; synopsis in 
    18.7 [support.rtti]p1 as follows:</p>
  
! <blockquote><pre>namespace std { 
    class type_info; 
    <del>class type_index;</del>
    template &lt;class T&gt; struct hash;
--- 29576,29583 ----
  <p>Modify the header &lt;typeinfo&gt; synopsis in 
    18.7 [support.rtti]p1 as follows:</p>
  
! <blockquote><pre>
! namespace std { 
    class type_info; 
    <del>class type_index;</del>
    template &lt;class T&gt; struct hash;
*************** needed for <tt>name()</tt> and <tt>befor
*** 37086,37092 ****
  <ins>18.7.1.1 Template specialization <code>hash&lt;const type_info *&gt;</code>
  [type.info.hash]</ins></p>
  
! <pre><ins>size_t operator()(const type_info *x) const;</ins>
  </pre>
  <ol>
  <li><ins><i>Returns</i>: <code>x-&gt;hash_code()</code></ins></li>
--- 29596,29603 ----
  <ins>18.7.1.1 Template specialization <code>hash&lt;const type_info *&gt;</code>
  [type.info.hash]</ins></p>
  
! <pre>
! <ins>size_t operator()(const type_info *x) const;</ins>
  </pre>
  <ol>
  <li><ins><i>Returns</i>: <code>x-&gt;hash_code()</code></ins></li>
*************** needed for <tt>name()</tt> and <tt>befor
*** 37098,37104 ****
  <p><ins>18.7.1.2 <code>type_info</code> concept map [type.info.concepts]</ins></p>
  
  
! <pre><ins>concept_map LessThanComparable&lt;const type_info *&gt; {</ins>
    <ins>bool operator&lt;(const type_info *x, const type_info *y) { return x-&gt;before(*y); }</ins>
    <ins>bool operator&lt;=(const type_info *x, const type_info *y) { return !y-&gt;before(*x); }</ins>
    <ins>bool operator&gt;(const type_info *x, const type_info *y) { return y-&gt;before(*x); }</ins>
--- 29609,29616 ----
  <p><ins>18.7.1.2 <code>type_info</code> concept map [type.info.concepts]</ins></p>
  
  
! <pre>
! <ins>concept_map LessThanComparable&lt;const type_info *&gt; {</ins>
    <ins>bool operator&lt;(const type_info *x, const type_info *y) { return x-&gt;before(*y); }</ins>
    <ins>bool operator&lt;=(const type_info *x, const type_info *y) { return !y-&gt;before(*x); }</ins>
    <ins>bool operator&gt;(const type_info *x, const type_info *y) { return y-&gt;before(*x); }</ins>
*************** needed for <tt>name()</tt> and <tt>befor
*** 37112,37118 ****
  </ol>
  </blockquote>
  
! <p>Remove section 20.13 [type.index]</p>
  
  
  
--- 29624,29630 ----
  </ol>
  </blockquote>
  
! <p>Remove section 20.14 [type.index]</p>
  
  
  
*************** needed for <tt>name()</tt> and <tt>befor
*** 37120,37128 ****
  
  <hr>
  <h3><a name="1080"></a>1080. Concept ArithmeticLike should provide explicit boolean  conversion</h3>
! <p><b>Section:</b> X [concept.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-03-21 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Astonishingly, the current concept ArithmeticLike as specified in
--- 29632,29640 ----
  
  <hr>
  <h3><a name="1080"></a>1080. Concept ArithmeticLike should provide explicit boolean  conversion</h3>
! <p><b>Section:</b> X [concept.arithmetic] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-03-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Astonishingly, the current concept ArithmeticLike as specified in
*************** Adding such an explicit conversion assoc
*** 37141,37147 ****
  partly solve a currently invalid effects clause in library, which bases
  on this property, 24.2.7 [random.access.iterators]/2:
  </p>
! <blockquote><pre>{ difference_type m = n;
   if (m &gt;= 0) while (m--) ++r;
   else while (m++) --r;
   return r; }
--- 29653,29660 ----
  partly solve a currently invalid effects clause in library, which bases
  on this property, 24.2.7 [random.access.iterators]/2:
  </p>
! <blockquote><pre>
! { difference_type m = n;
   if (m &gt;= 0) while (m--) ++r;
   else while (m++) --r;
   return r; }
*************** Both while-loops take advantage of a con
*** 37153,37159 ****
  longer supported existing implicit conversion from <tt>int</tt> to <tt>IntegralLike</tt>).
  </p>
  
! <b>Original proposed resolution:</b>
  <ol>
  <li>
  <p>
--- 29666,29672 ----
  longer supported existing implicit conversion from <tt>int</tt> to <tt>IntegralLike</tt>).
  </p>
  
! <p><b>Original proposed resolution:</b></p>
  <ol>
  <li>
  <p>
*************** In X [concept.arithmetic], add to the li
*** 37161,37167 ****
  concepts one further concept:
  </p>
  
! <blockquote><pre>concept ArithmeticLike&lt;typename T&gt;
    : Regular&lt;T&gt;, LessThanComparable&lt;T&gt;, HasUnaryPlus&lt;T&gt;, HasNegate&lt;T&gt;,
      HasPlus&lt;T, T&gt;, HasMinus&lt;T, T&gt;, HasMultiply&lt;T, T&gt;, HasDivide&lt;T, T&gt;,
      HasPreincrement&lt;T&gt;, HasPostincrement&lt;T&gt;, HasPredecrement&lt;T&gt;,
--- 29674,29681 ----
  concepts one further concept:
  </p>
  
! <blockquote><pre>
! concept ArithmeticLike&lt;typename T&gt;
    : Regular&lt;T&gt;, LessThanComparable&lt;T&gt;, HasUnaryPlus&lt;T&gt;, HasNegate&lt;T&gt;,
      HasPlus&lt;T, T&gt;, HasMinus&lt;T, T&gt;, HasMultiply&lt;T, T&gt;, HasDivide&lt;T, T&gt;,
      HasPreincrement&lt;T&gt;, HasPostincrement&lt;T&gt;, HasPredecrement&lt;T&gt;,
*************** as indicated [The proposed insertion fix
*** 37178,37184 ****
  implicit construction from integrals has been changed to an explicit
  constructor]:
  </p>
! <blockquote><pre>{ difference_type m = n;
   if (m &gt;= <ins>difference_type(</ins>0<ins>)</ins>) while (m--) ++r;
   else while (m++) --r;
   return r; }
--- 29692,29699 ----
  implicit construction from integrals has been changed to an explicit
  constructor]:
  </p>
! <blockquote><pre>
! { difference_type m = n;
   if (m &gt;= <ins>difference_type(</ins>0<ins>)</ins>) while (m--) ++r;
   else while (m++) --r;
   return r; }
*************** In X [concept.arithmetic], add to the li
*** 37212,37218 ****
  concepts one further concept:
  </p>
  
! <blockquote><pre>concept ArithmeticLike&lt;typename T&gt;
    : Regular&lt;T&gt;, LessThanComparable&lt;T&gt;, HasUnaryPlus&lt;T&gt;, HasNegate&lt;T&gt;,
      HasPlus&lt;T, T&gt;, HasMinus&lt;T, T&gt;, HasMultiply&lt;T, T&gt;, HasDivide&lt;T, T&gt;,
      HasPreincrement&lt;T&gt;, HasPostincrement&lt;T&gt;, HasPredecrement&lt;T&gt;,
--- 29727,29734 ----
  concepts one further concept:
  </p>
  
! <blockquote><pre>
! concept ArithmeticLike&lt;typename T&gt;
    : Regular&lt;T&gt;, LessThanComparable&lt;T&gt;, HasUnaryPlus&lt;T&gt;, HasNegate&lt;T&gt;,
      HasPlus&lt;T, T&gt;, HasMinus&lt;T, T&gt;, HasMultiply&lt;T, T&gt;, HasDivide&lt;T, T&gt;,
      HasPreincrement&lt;T&gt;, HasPostincrement&lt;T&gt;, HasPredecrement&lt;T&gt;,
*************** concepts one further concept:
*** 37227,37239 ****
  
  
  <hr>
! <h3><a name="1081"></a>1081. Response to UK 216</h3>
! <p><b>Section:</b> 21 [strings] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#strings">issues</a> in [strings].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 216, JP 46, JP 48</b></p>
  
  <p>
  All the containers use concepts for their iterator usage, exect for
--- 29743,29755 ----
  
  
  <hr>
! <h3><a name="1081"></a>1081. <tt>basic_string</tt> needs to be a concept-constrained template</h3>
! <p><b>Section:</b> 21 [strings] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#strings">issues</a> in [strings].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 216, JP 46, JP 48 [CD1]</b></p>
  
  <p>
  All the containers use concepts for their iterator usage, exect for
*************** Use concepts for iterator template param
*** 37248,37258 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  NB comments to be handled by Dave Abrahams and Howard Hinnant with
  advice from PJP: UK216 (which duplicates) JP46, JP48. JP46 supplies
  extensive proposed wording; start there.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 29764,29774 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  NB comments to be handled by Dave Abrahams and Howard Hinnant with
  advice from PJP: UK216 (which duplicates) JP46, JP48. JP46 supplies
  extensive proposed wording; start there.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** extensive proposed wording; start there.
*** 37262,37281 ****
  
  
  <hr>
! <h3><a name="1082"></a>1082. Response to JP 49</h3>
! <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#localization">issues</a> in [localization].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses JP 49</b></p>
  
  <p>
  <tt>codecvt</tt> does not use concept. For example, create <tt>CodeConvert</tt>
  concept and change as follows.
  </p>
  
! <blockquote><pre>template&lt;CodeConvert Codecvt, class Elem = wchar_t&gt;
    class wstring_convert {
  </pre></blockquote>
  
--- 29778,29798 ----
  
  
  <hr>
! <h3><a name="1082"></a>1082. <tt>codecvt</tt> needs to be a concept-constrained template</h3>
! <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#localization">issues</a> in [localization].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses JP 49 [CD1]</b></p>
  
  <p>
  <tt>codecvt</tt> does not use concept. For example, create <tt>CodeConvert</tt>
  concept and change as follows.
  </p>
  
! <blockquote><pre>
! template&lt;CodeConvert Codecvt, class Elem = wchar_t&gt;
    class wstring_convert {
  </pre></blockquote>
  
*************** concept and change as follows.
*** 37283,37291 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  To be handled by Howard Hinnant, Dave Abrahams, Martin Sebor, PJ Plauger.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 29800,29808 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  To be handled by Howard Hinnant, Dave Abrahams, Martin Sebor, PJ Plauger.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** To be handled by Howard Hinnant, Dave Ab
*** 37295,37307 ****
  
  
  <hr>
! <h3><a name="1083"></a>1083. Response to JP 52, 53</h3>
! <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#localization">issues</a> in [localization].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses JP 52, JP 53</b></p>
  
  <p>
  <tt>InputIterator</tt> does not use concept.
--- 29812,29824 ----
  
  
  <hr>
! <h3><a name="1083"></a>1083. <tt>InputIterator</tt> and <tt>OutputIterator</tt> template parameters need to be concept constraints</h3>
! <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#localization">issues</a> in [localization].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses JP 52, JP 53 [CD1]</b></p>
  
  <p>
  <tt>InputIterator</tt> does not use concept.
*************** Comments include proposed wording.
*** 37319,37327 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  To be handled by Howard Hinnant, Dave Abrahams, Martin Sebor, PJ Plauger.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 29836,29844 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  To be handled by Howard Hinnant, Dave Abrahams, Martin Sebor, PJ Plauger.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** To be handled by Howard Hinnant, Dave Ab
*** 37331,37343 ****
  
  
  <hr>
! <h3><a name="1084"></a>1084. Response to UK 250</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 250</b></p>
  
  <p>
  A default implementation should be supplied for the post-increment
--- 29848,29860 ----
  
  
  <hr>
! <h3><a name="1084"></a>1084. Concept <tt>ForwardIterator</tt> should provide default implementation for post-increment</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 250 [CD1]</b></p>
  
  <p>
  A default implementation should be supplied for the post-increment
*************** operator to simplify implementation of i
*** 37346,37368 ****
  
  <p>
  Copy the Effects clause into the concept description as the default
! implementation. Assumes a default value for postincrement_result
  </p>
  
  <p><i>[
  Summit:
  ]</i></p>
  
! <blockquote>
  Howard will open an issue.
! </blockquote>
  
  <p><i>[
  2009-06-07 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  This issue cannot currently be resolved as suggested, because
  that would render auto-detection of the return type
  <tt>postincrement_result</tt> invalid, see  [concept.map.assoc]/4+5. The
--- 29863,29885 ----
  
  <p>
  Copy the Effects clause into the concept description as the default
! implementation. Assumes a default value for <tt>postincrement_result</tt>.
  </p>
  
  <p><i>[
  Summit:
  ]</i></p>
  
! <blockquote><p>
  Howard will open an issue.
! </p></blockquote>
  
  <p><i>[
  2009-06-07 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  This issue cannot currently be resolved as suggested, because
  that would render auto-detection of the return type
  <tt>postincrement_result</tt> invalid, see  [concept.map.assoc]/4+5. The
*************** best fix would be to add a default type
*** 37370,37381 ****
  unfortunately any default type will prevent auto-deduction of types of
  associated functions as quoted above. A corresponding core issue
  is in preparation.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[
! This wording assumes the acceptance of UK 251 / <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>.  Both
  wordings change the same paragraphs.
  ]</i></p>
  
--- 29887,29898 ----
  unfortunately any default type will prevent auto-deduction of types of
  associated functions as quoted above. A corresponding core issue
  is in preparation.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[
! This wording assumes the acceptance of UK 251 / <a href="lwg-closed.html#1009">1009</a>.  Both
  wordings change the same paragraphs.
  ]</i></p>
  
*************** Change 24.2.5 [forward.iterators]:
*** 37385,37391 ****
  </p>
  
  <blockquote>
! <pre>concept ForwardIterator&lt;typename X&gt; : InputIterator&lt;X&gt;, Regular&lt;X&gt; { 
  
    MoveConstructible postincrement_result;
    requires HasDereference&lt;postincrement_result&gt;
--- 29902,29909 ----
  </p>
  
  <blockquote>
! <pre>
! concept ForwardIterator&lt;typename X&gt; : InputIterator&lt;X&gt;, Regular&lt;X&gt; { 
  
    MoveConstructible postincrement_result;
    requires HasDereference&lt;postincrement_result&gt;
*************** Change 24.2.5 [forward.iterators]:
*** 37410,37422 ****
  
  
  <hr>
! <h3><a name="1085"></a>1085. Response to UK 258</h3>
! <p><b>Section:</b> 24.2.6 [bidirectional.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bidirectional.iterators">issues</a> in [bidirectional.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 258</b></p>
  
  <p>
  A default implementation should be supplied for the post-decrement
--- 29928,29940 ----
  
  
  <hr>
! <h3><a name="1085"></a>1085. <tt>BidirectionalIterator</tt> concept should provide default implementation for post-decrement</h3>
! <p><b>Section:</b> 24.2.6 [bidirectional.iterators] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bidirectional.iterators">issues</a> in [bidirectional.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 258 [CD1]</b></p>
  
  <p>
  A default implementation should be supplied for the post-decrement
*************** operator to simplify implementation of i
*** 37425,37451 ****
  
  <p>
  Copy the Effects clause into the concept description as the default
! implementation. Assumes a default value for postincrement_result
  </p>
  
  <p><i>[
  Summit:
  ]</i></p>
  
! <blockquote>
  Howard will open an issue.
! </blockquote>
  
  <p><i>[
  2009-06-07 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  This issue cannot currently be resolved as suggested, because
  that would render auto-detection of the return type
! <tt>postdecrement_result</tt> invalid, see <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1084">1084</a>.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 29943,29969 ----
  
  <p>
  Copy the Effects clause into the concept description as the default
! implementation. Assumes a default value for <tt>postincrement_result</tt>.
  </p>
  
  <p><i>[
  Summit:
  ]</i></p>
  
! <blockquote><p>
  Howard will open an issue.
! </p></blockquote>
  
  <p><i>[
  2009-06-07 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  This issue cannot currently be resolved as suggested, because
  that would render auto-detection of the return type
! <tt>postdecrement_result</tt> invalid, see <a href="lwg-closed.html#1084">1084</a>.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Change 24.2.6 [bidirectional.iterators]:
*** 37455,37461 ****
  </p>
  
  <blockquote>
! <pre>concept BidirectionalIterator&lt;typename X&gt; : ForwardIterator&lt;X&gt; { 
    MoveConstructible postdecrement_result; 
    requires HasDereference&lt;postdecrement_result&gt; 
          &amp;&amp; Convertible&lt;HasDereference&lt;postdecrement_result&gt;::result_type, const value_type&amp;&gt; 
--- 29973,29980 ----
  </p>
  
  <blockquote>
! <pre>
! concept BidirectionalIterator&lt;typename X&gt; : ForwardIterator&lt;X&gt; { 
    MoveConstructible postdecrement_result; 
    requires HasDereference&lt;postdecrement_result&gt; 
          &amp;&amp; Convertible&lt;HasDereference&lt;postdecrement_result&gt;::result_type, const value_type&amp;&gt; 
*************** Change 24.2.6 [bidirectional.iterators]:
*** 37475,37486 ****
  
  
  <hr>
! <h3><a name="1086"></a>1086. Response to UK 284</h3>
! <p><b>Section:</b> 24.6 [stream.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 284</b></p>
  
  <p>
  The stream iterators need constraining with concepts/requrires clauses.
--- 29994,30005 ----
  
  
  <hr>
! <h3><a name="1086"></a>1086. Stream iterators need to be concept-constrained templates</h3>
! <p><b>Section:</b> 24.6 [stream.iterators] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 284 [CD1]</b></p>
  
  <p>
  The stream iterators need constraining with concepts/requrires clauses.
*************** The stream iterators need constraining w
*** 37490,37498 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  We agree. To be handled by Howard, Martin and PJ.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 30009,30017 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  We agree. To be handled by Howard, Martin and PJ.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** We agree. To be handled by Howard, Marti
*** 37502,37514 ****
  
  
  <hr>
! <h3><a name="1087"></a>1087. Response to UK 301</h3>
! <p><b>Section:</b> 25.3.5 [alg.replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.replace">issues</a> in [alg.replace].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 301</b></p>
  
  <p>
  <tt>replace</tt> and <tt>replace_if</tt> have the requirement: <tt>OutputIterator&lt;Iter,
--- 30021,30033 ----
  
  
  <hr>
! <h3><a name="1087"></a>1087. Incorrect <tt>OutputIterator</tt> concept requirements for <tt>replace</tt> algorithms</h3>
! <p><b>Section:</b> 25.3.5 [alg.replace] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.replace">issues</a> in [alg.replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 301 [CD1]</b></p>
  
  <p>
  <tt>replace</tt> and <tt>replace_if</tt> have the requirement: <tt>OutputIterator&lt;Iter,
*************** and <tt>replace_if</tt>.
*** 37527,37535 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  We agree. To be handled by Howard.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 30046,30054 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  We agree. To be handled by Howard.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** We agree. To be handled by Howard.
*** 37537,37543 ****
  Change in  [algorithms.syn] and 25.3.5 [alg.replace]:
  </p>
  
! <blockquote><pre>template&lt;ForwardIterator Iter, class T&gt; 
    requires <del>OutputIterator&lt;Iter, Iter::reference&gt; 
          &amp;&amp;</del> OutputIterator&lt;Iter, const T&amp;&gt; 
          &amp;&amp; HasEqualTo&lt;Iter::value_type, T&gt; 
--- 30056,30063 ----
  Change in  [algorithms.syn] and 25.3.5 [alg.replace]:
  </p>
  
! <blockquote><pre>
! template&lt;ForwardIterator Iter, class T&gt; 
    requires <del>OutputIterator&lt;Iter, Iter::reference&gt; 
          &amp;&amp;</del> OutputIterator&lt;Iter, const T&amp;&gt; 
          &amp;&amp; HasEqualTo&lt;Iter::value_type, T&gt; 
*************** template&lt;ForwardIterator Iter, Predic
*** 37557,37773 ****
  
  
  <hr>
- <h3><a name="1088"></a>1088. Response to UK 342</h3>
- <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p><b>Addresses UK 342</b></p>
- 
- <p>
- <tt>std::promise</tt> is missing a non-member overload of <tt>swap</tt>. This is
- inconsistent with other types that provide a <tt>swap</tt> member function.
- </p>
- 
- <p>
- Add a non-member overload <tt>void swap(promise&amp;&amp; x,promise&amp;&amp; y){ x.swap(y); }</tt>
- </p>
- 
- <p><i>[
- Summit:
- ]</i></p>
- 
- <blockquote>
- Create an issue. Move to review, attention: Howard. Detlef will also
- look into it.
- </blockquote>
- 
- <p><i>[
- Post Summit Daniel provided wording.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.html">N2997</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <ol>
- <li>
- <p>
- In 30.6.5 [futures.promise], before p.1, immediately after class template
- promise add:
- </p>
- <blockquote><pre><ins>
- template &lt;class R&gt;
- void swap(promise&lt;R&gt;&amp; x, promise&lt;R&gt;&amp; y);
- </ins>
- </pre></blockquote>
- </li>
- <li>
- <p>
- Change 30.6.5 [futures.promise]/10 as indicated (to fix a circular definition):
- </p>
- <blockquote>
- <p>
- -10- <i>Effects:</i> <del>swap(*this, other)</del><ins>Swaps the associated state
- of <tt>*this</tt> and <tt>other</tt></ins>
- </p>
- <p>
- <ins><i>Throws:</i> Nothing.</ins>
- </p>
- </blockquote>
- </li>
- <li>
- <p>
- After the last paragraph in 30.6.5 [futures.promise] add the following
- prototype description:
- </p>
- <blockquote><pre><ins>
- template &lt;class R&gt;
- void swap(promise&lt;R&gt;&amp; x, promise&lt;R&gt;&amp; y);
- </ins></pre>
- <blockquote>
- <p>
- <ins><i>Effects:</i> <tt>x.swap(y)</tt></ins>
- </p>
- <p>
- <ins><i>Throws:</i> Nothing.</ins>
- </p>
- </blockquote>
- </blockquote>
- </li>
- 
- </ol>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1090"></a>1090. Missing description of <tt>packaged_task</tt> member <tt>swap</tt>,  missing non-member <tt>swap</tt></h3>
- <p><b>Section:</b> 30.6.10 [futures.task] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.task">issues</a> in [futures.task].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Class template <tt>packaged_task</tt> in 30.6.10 [futures.task] shows a member <tt>swap</tt>
- declaration, but misses to
- document it's effects (No prototype provided). Further on this class
- misses to provide a non-member
- swap.
- </p>
- 
- <p><i>[
- Batavia (2009-05):
- ]</i></p>
- 
- <blockquote>
- <p>
- Alisdair notes that paragraph 2 of the proposed resolution has already been
- applied in the current Working Draft.
- </p>
- <p>
- We note a pending <tt>future</tt>-related paper by Detlef;
- we would like to wait for this paper before proceeding.
- </p>
- <p>
- Move to Open.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-05-24 Daniel removed part 2 of the proposed resolution.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 post-Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Move to Tentatively Ready, removing bullet 3 from the proposed
- resolution but keeping the other two bullets.
- </blockquote>
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to NAD Editorial.  Rationale added below.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by N3058.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <ol>
- <li>
- <p>
- In 30.6.10 [futures.task], immediately after the definition of class
- template packaged_task add:
- </p>
- <blockquote><pre><ins>
- template&lt;class R, class... Argtypes&gt;
- void swap(packaged_task&lt;R(ArgTypes...)&gt;&amp;, packaged_task&lt;R(ArgTypes...)&gt;&amp;);
- </ins>
- </pre></blockquote>
- </li>
- </ol>
- 
- <ol start="4">
- 
- <li>
- <p>
- At the end of 30.6.10 [futures.task] (after p. 20), add add the following
- prototype description:
- </p>
- 
- <blockquote><pre><ins>
- template&lt;class R, class... Argtypes&gt;
- void swap(packaged_task&lt;R(ArgTypes...)&gt;&amp; x, packaged_task&lt;R(ArgTypes...)&gt;&amp; y);
- </ins></pre>
- <blockquote>
- <p><ins>
- <i>Effects:</i> <tt>x.swap(y)</tt>
- </ins></p>
- <p><ins>
- <i>Throws:</i> Nothing.
- </ins></p>
- </blockquote>
- </blockquote>
- </li>
- </ol>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1091"></a>1091. Multimap description confusing</h3>
! <p><b>Section:</b> 23.6.2.2 [multimap.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 246</b></p>
--- 30077,30086 ----
  
  
  <hr>
  <h3><a name="1091"></a>1091. Multimap description confusing</h3>
! <p><b>Section:</b> 23.4.5.3 [multimap.modifiers] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 246</b></p>
*************** Beman adds:
*** 37784,37793 ****
  ]</i></p>
  
  
! <blockquote>
  Pete is clearly right that
  this one is technical rather than editorial.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
--- 30097,30106 ----
  ]</i></p>
  
  
! <blockquote><p>
  Pete is clearly right that
  this one is technical rather than editorial.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
*************** Move to Review.
*** 37807,37821 ****
  ]</i></p>
  
  
! <blockquote>
  Mark as NAD, solved by removing concepts.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Strike 23.6.2.2 [multimap.modifiers] entirely
  (but do NOT strike these signatures from the class template definition!).
  </p>
  
--- 30120,30134 ----
  ]</i></p>
  
  
! <blockquote><p>
  Mark as NAD, solved by removing concepts.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Strike 23.4.5.3 [multimap.modifiers] entirely
  (but do NOT strike these signatures from the class template definition!).
  </p>
  
*************** Strike 23.6.2.2 [multimap.modifiers] ent
*** 37825,37834 ****
  
  <hr>
  <h3><a name="1092"></a>1092. Class template <tt>integral_constant</tt> should be a  constrained template</h3>
! <p><b>Section:</b> 20.7.3 [meta.help] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.help">issues</a> in [meta.help].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A first step to change the type traits predicates to constrained templates is to
--- 30138,30147 ----
  
  <hr>
  <h3><a name="1092"></a>1092. Class template <tt>integral_constant</tt> should be a  constrained template</h3>
! <p><b>Section:</b> 20.10.3 [meta.help] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.help">issues</a> in [meta.help].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A first step to change the type traits predicates to constrained templates is to
*************** constrain their common base template <tt
*** 37836,37874 ****
  without enforcing depending classes to be constrained as well, but not
  vice versa
  without brute force <tt>late_check</tt> usages. The following proposed resolution depends
! on the resolution of LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, pending a paper that looks at constraints
  for the entirety of the type traits
  and their relationship to the foundation concepts.
  We recommend this be deferred
  until after the next Committee Draft is issued.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>
  <p>
! In 20.7.2 [meta.type.synop], Header <tt>&lt;type_traits&gt;</tt>
  synopsis change as indicated:
  </p>
! <blockquote><pre>namespace std {
  // 20.5.3, helper class:
  template &lt;<del>class</del><ins>IntegralConstantExpressionType</ins> T, T v&gt; struct integral_constant;
  </pre></blockquote>
  </li>
  <li>
  <p>
! In 20.7.3 [meta.help] change as indicated:
  </p>
! <blockquote><pre>template &lt;<del>class</del><ins>IntegralConstantExpressionType</ins> T, T v&gt;
  struct integral_constant {
    static constexpr T value = v;
    typedef T value_type;
--- 30149,30189 ----
  without enforcing depending classes to be constrained as well, but not
  vice versa
  without brute force <tt>late_check</tt> usages. The following proposed resolution depends
! on the resolution of LWG issue <a href="lwg-defects.html#1019">1019</a>.
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open, pending a paper that looks at constraints
  for the entirety of the type traits
  and their relationship to the foundation concepts.
  We recommend this be deferred
  until after the next Committee Draft is issued.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>
  <p>
! In 20.10.2 [meta.type.synop], Header <tt>&lt;type_traits&gt;</tt>
  synopsis change as indicated:
  </p>
! <blockquote><pre>
! namespace std {
  // 20.5.3, helper class:
  template &lt;<del>class</del><ins>IntegralConstantExpressionType</ins> T, T v&gt; struct integral_constant;
  </pre></blockquote>
  </li>
  <li>
  <p>
! In 20.10.3 [meta.help] change as indicated:
  </p>
! <blockquote><pre>
! template &lt;<del>class</del><ins>IntegralConstantExpressionType</ins> T, T v&gt;
  struct integral_constant {
    static constexpr T value = v;
    typedef T value_type;
*************** struct integral_constant {
*** 37884,38046 ****
  
  
  <hr>
- <h3><a name="1093"></a>1093. Multiple definitions for random_shuffle algorithm</h3>
- <p><b>Section:</b> 25.3.12 [alg.random.shuffle] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.random.shuffle">issues</a> in [alg.random.shuffle].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p>
- There are a couple of issues with the declaration of the <tt>random_shuffle</tt>
- algorithm accepting a random number engine.
- </p>
- 
- <ol type="i">
- <li>
- The Iterators must be shuffle iterators, yet this requirement is missing.
- </li>
- <li>
- The <tt>RandomNumberEngine</tt> concept is now provided by the random number
- library
- (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">n2836</a>)
- and the placeholder should be removed.
- </li>
- </ol>
- 
- <p><i>[
- 2009-05-02 Daniel adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- this issue completes adding necessary requirement to the
- third new <tt>random_shuffle</tt> overload. The current suggestion is:
- </p>
- 
- <blockquote><pre>template&lt;RandomAccessIterator Iter, UniformRandomNumberGenerator Rand&gt;
- requires ShuffleIterator&lt;Iter&gt;
- void random_shuffle(Iter first, Iter last, Rand&amp;&amp; g);
- </pre></blockquote>
- 
- <p>
- IMO this is still insufficient and I suggest to add the requirement
- </p>
- <blockquote><pre>Convertible&lt;Rand::result_type, Iter::difference_type&gt;
- </pre></blockquote>
- <p>
- to the list (as the two other overloads already have).
- </p>
- 
- <p>
- Rationale:
- </p>
- 
- <blockquote>
- <p>
- Its true that this third overload is somewhat different from the remaining
- two. Nevertheless we know from <tt>UniformRandomNumberGenerator</tt>, that
- it's <tt>result_type</tt> is an integral type and that it satisfies
- <tt>UnsignedIntegralLike&lt;result_type&gt;</tt>.
- </p>
- <p>
- To realize it's designated task, the algorithm has to invoke the
- <tt>Callable</tt> aspect of <tt>g</tt> and needs to perform some algebra involving
- it's <tt>min()/max()</tt> limits to compute another index value that
- at this point is converted into <tt>Iter::difference_type</tt>. This is so,
- because 24.2.7 [random.access.iterators] uses this type as argument
- of it's algebraic operators. Alternatively consider the equivalent
- iterator algorithms in 24.4.4 [iterator.operations] with the same result.
- </p>
- <p>
- This argument leads us to the conclusion that we also need
- <tt>Convertible&lt;Rand::result_type, Iter::difference_type&gt;</tt> here.
- </p>
- </blockquote>
- 
- </blockquote>
- 
- <p><i>[
- Batavia (2009-05):
- ]</i></p>
- 
- <blockquote>
- <p>
- Alisdair notes that point (ii) has already been addressed.
- </p>
- <p>
- We agree with the proposed resolution to point (i)
- with Daniel's added requirement.
- </p>
- <p>
- Move to Review.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-06-05 Daniel updated proposed wording as recommended in Batavia.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-07-28 Alisdair adds:
- ]</i></p>
- 
- 
- <blockquote>
- Revert to Open, with a note there is consensus on direction but the
- wording needs updating to reflect removal of concepts.
- </blockquote>
- 
- <p><i>[
- 2009-10 post-Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Leave Open, Walter to work on it.
- </blockquote>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial, solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3056.pdf">N3056</a>.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3056.pdf">N3056</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change in  [algorithms.syn] and 25.3.12 [alg.random.shuffle]:
- </p>
- 
- <blockquote><pre><del>concept UniformRandomNumberGenerator&lt;typename Rand&gt; { }</del>
- template&lt;RandomAccessIterator Iter, UniformRandomNumberGenerator Rand&gt;
-   <ins>requires ShuffleIterator&lt;Iter&gt; &amp;&amp;
-   Convertible&lt;Rand::result_type, Iter::difference_type&gt;</ins>
-   void random_shuffle(Iter first, Iter last, Rand&amp;&amp; g);
- </pre></blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1096"></a>1096. unconstrained rvalue ref parameters</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-03-21 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  TODO: Look at all cases of unconstrained rvalue ref parameters and check
--- 30199,30210 ----
  
  
  <hr>
  <h3><a name="1096"></a>1096. unconstrained rvalue ref parameters</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-03-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  TODO: Look at all cases of unconstrained rvalue ref parameters and check
*************** that concept req'ts work when <tt>T</tt>
*** 38057,38065 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, pending proposed wording from Dave for further review.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 30221,30229 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open, pending proposed wording from Dave for further review.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Open, pending proposed wording f
*** 38072,38082 ****
  
  <hr>
  <h3><a name="1099"></a>1099. Various issues</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-03-21 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Notes
--- 30236,30246 ----
  
  <hr>
  <h3><a name="1099"></a>1099. Various issues</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-03-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Notes
*************** on 550
*** 38093,38099 ****
  CD-1 reads:
  </p>
  
! <blockquote><pre>template &lt;MoveConstructible T1, MoveConstructible T2&gt; 
  pair&lt;V1, V2&gt; make_pair(T1&amp;&amp;, T2&amp;&amp;); 
  </pre></blockquote>
  
--- 30257,30264 ----
  CD-1 reads:
  </p>
  
! <blockquote><pre>
! template &lt;MoveConstructible T1, MoveConstructible T2&gt; 
  pair&lt;V1, V2&gt; make_pair(T1&amp;&amp;, T2&amp;&amp;); 
  </pre></blockquote>
  
*************** effects, "<tt>f</tt> is moved into the n
*** 38125,38131 ****
  agree (and ideally document) that saying "<tt>f</tt> is moved" implies 
  </p>
  
! <blockquote><pre>F x(move(f))
  </pre></blockquote>
  
  <p>
--- 30290,30297 ----
  agree (and ideally document) that saying "<tt>f</tt> is moved" implies 
  </p>
  
! <blockquote><pre>
! F x(move(f))
  </pre></blockquote>
  
  <p>
*************** is required to work.  That would cover b
*** 38140,38151 ****
  <p>
  [2009-03-21 Sat] p869 InputIterator pointer type should not be required
  to be convertible to const value_type*, rather it needs to have a
! operator-&gt; of its own that can be used for the value type.
  </p>
  
! <blockquote>
  This one is serious and unrelated to the move issue.
! </blockquote>
  
  <p>
  [2009-03-21 Sat] p818 stack has the same problem with default ctor.
--- 30306,30317 ----
  <p>
  [2009-03-21 Sat] p869 InputIterator pointer type should not be required
  to be convertible to const value_type*, rather it needs to have a
! operator-> of its own that can be used for the value type.
  </p>
  
! <blockquote><p>
  This one is serious and unrelated to the move issue.
! </p></blockquote>
  
  <p>
  [2009-03-21 Sat] p818 stack has the same problem with default ctor.
*************** This one is serious and unrelated to the
*** 38153,38159 ****
  <p>
  [2009-03-21 Sat] p816 priority_queue has the same sorts of problems as queue, only more so
  </p>
! <blockquote><pre>   requires MoveConstructible&lt;Cont&gt; 
       explicit priority_queue(const Compare&amp; x = Compare(), Cont&amp;&amp; = Cont()); 
  </pre>
  <p>
--- 30319,30326 ----
  <p>
  [2009-03-21 Sat] p816 priority_queue has the same sorts of problems as queue, only more so
  </p>
! <blockquote><pre>
!    requires MoveConstructible&lt;Cont&gt; 
       explicit priority_queue(const Compare&amp; x = Compare(), Cont&amp;&amp; = Cont()); 
  </pre>
  <p>
*************** This one is serious and unrelated to the
*** 38180,38189 ****
  ]</i></p>
  
  
! <blockquote>
! This could be done as part of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1035">1035</a>, which already handles
  deviation of <tt>std::array</tt> from container tables.
! </blockquote>
  
  <p>
   [2009-03-21 Sat] p622 all messed up.
--- 30347,30356 ----
  ]</i></p>
  
  
! <blockquote><p>
! This could be done as part of <a href="lwg-closed.html#1035">1035</a>, which already handles
  deviation of <tt>std::array</tt> from container tables.
! </p></blockquote>
  
  <p>
   [2009-03-21 Sat] p622 all messed up.
*************** deviation of <tt>std::array</tt> from co
*** 38192,38203 ****
  <p>
     para 8 "implementation-defined" is the wrong term; should be "see
     below" or something.  
! </p>
! <p>
     para 12 "will be selected" doesn't make any sense because we're not
     talking about actual arg types.
! </p>
! <p>
     paras 9-13 need to be totally rewritten for concepts.
  </p>
  </blockquote>
--- 30359,30368 ----
  <p>
     para 8 "implementation-defined" is the wrong term; should be "see
     below" or something.  
! <p/>
     para 12 "will be selected" doesn't make any sense because we're not
     talking about actual arg types.
! <p/>
     paras 9-13 need to be totally rewritten for concepts.
  </p>
  </blockquote>
*************** deviation of <tt>std::array</tt> from co
*** 38205,38225 ****
  <p>
   [2009-03-21 Sat] Null pointer comparisons (p587) have all become
   unconstrained.  Need to fix that
! </p>
! <p>
   [2009-03-21 Sat] mem_fun_t etc. definition doesn't match declaration.
    We think CopyConstructible is the right reqt.
! </p>
! <p>
   make_pair needs Constructible&lt;V1, T1&amp;&amp;&gt; requirements!
! </p>
! <p>
   make_tuple needs something similar
! </p>
! <p>
   tuple bug in synopsis:
  </p>
! <blockquote><pre>   template &lt;class... UTypes&gt;
     requires Constructible&lt;Types, const UTypes&amp;&gt;...
     template &lt;class... UTypes&gt;
     requires Constructible&lt;Types, RvalueOf&lt;UTypes&gt;::type&gt;...
--- 30370,30387 ----
  <p>
   [2009-03-21 Sat] Null pointer comparisons (p587) have all become
   unconstrained.  Need to fix that
! <p/>
   [2009-03-21 Sat] mem_fun_t etc. definition doesn't match declaration.
    We think CopyConstructible is the right reqt.
! <p/>
   make_pair needs Constructible&lt;V1, T1&amp;&amp;&gt; requirements!
! <p/>
   make_tuple needs something similar
! <p/>
   tuple bug in synopsis:
  </p>
! <blockquote><pre>
!    template &lt;class... UTypes&gt;
     requires Constructible&lt;Types, const UTypes&amp;&gt;...
     template &lt;class... UTypes&gt;
     requires Constructible&lt;Types, RvalueOf&lt;UTypes&gt;::type&gt;...
*************** deviation of <tt>std::array</tt> from co
*** 38235,38257 ****
  ]</i></p>
  
  
! <blockquote>
! This part of the issue is already covered by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>.
! </blockquote>
  
  <p>
   these unique_ptr constructors are broken [ I think this is covered in "p622 all messed up" ]
  </p>
! <blockquote><pre> unique_ptr(pointer p, implementation-defined d);
   unique_ptr(pointer p, implementation-defined d);
  </pre></blockquote>
  <p>
   multimap range constructor should not have MoveConstructible&lt;value_type&gt; requirement.
  </p>
! <blockquote>
!    same with insert(..., P&amp;&amp;); multiset has the same issue, as do
!    unordered_multiset and unordered_multimap. Review these!
! </blockquote>
  
  </blockquote>
  
--- 30397,30420 ----
  ]</i></p>
  
  
! <blockquote><p>
! This part of the issue is already covered by <a href="lwg-closed.html#1077">1077</a>.
! </p></blockquote>
  
  <p>
   these unique_ptr constructors are broken [ I think this is covered in "p622 all messed up" ]
  </p>
! <blockquote><pre>
!  unique_ptr(pointer p, implementation-defined d);
   unique_ptr(pointer p, implementation-defined d);
  </pre></blockquote>
  <p>
   multimap range constructor should not have MoveConstructible&lt;value_type&gt; requirement.
  </p>
! <blockquote><p>
!    same with <tt>insert(..., P&amp;&amp;);</tt> <tt>multiset</tt> has the same issue, as do
!    <tt>unordered_multiset</tt> and <tt>unordered_multimap</tt>. Review these!
! </p></blockquote>
  
  </blockquote>
  
*************** This part of the issue is already covere
*** 38259,38277 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, pending proposed wording from Dave for further review.
! </blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Tentatively NAD.  We are not sure what has been addressed and what hasn't.
  Recommend closing unless someone sorts this out into something more readable.
! </blockquote>
  
  
  
--- 30422,30440 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open, pending proposed wording from Dave for further review.
! </p></blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Tentatively NAD.  We are not sure what has been addressed and what hasn't.
  Recommend closing unless someone sorts this out into something more readable.
! </p></blockquote>
  
  
  
*************** The issue(s) at hand not adequately comm
*** 38291,38319 ****
  
  <hr>
  <h3><a name="1101"></a>1101. <tt>unique</tt> requirements</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From Message c++std-core-14160 Howard wrote:
  </p>
  
! <blockquote>
  It was the intent of the rvalue reference proposal for unique to only require MoveAssignable:
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1860.html#25.2.9%20-%20Unique">N1860</a>.
! </blockquote>
  
  <p>
  And Pete replied:
  </p>
  
! <blockquote>
  That was overridden by the subsequent changes made for concepts in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2573.pdf">N2573</a>,
  which reimposed the C++03 requirements.
! </blockquote>
  
  <p>
  My impression is that this overwrite was a simple (unintentional) mistake.
--- 30454,30482 ----
  
  <hr>
  <h3><a name="1101"></a>1101. <tt>unique</tt> requirements</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From Message c++std-core-14160 Howard wrote:
  </p>
  
! <blockquote><p>
  It was the intent of the rvalue reference proposal for unique to only require MoveAssignable:
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1860.html#25.2.9%20-%20Unique">N1860</a>.
! </p></blockquote>
  
  <p>
  And Pete replied:
  </p>
  
! <blockquote><p>
  That was overridden by the subsequent changes made for concepts in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2573.pdf">N2573</a>,
  which reimposed the C++03 requirements.
! </p></blockquote>
  
  <p>
  My impression is that this overwrite was a simple (unintentional) mistake.
*************** Move to NAD Editorial.
*** 38340,38346 ****
  Change 25.3.9 [alg.unique]:
  </p>
  
! <blockquote><pre>template&lt;ForwardIterator Iter&gt; 
    requires OutputIterator&lt;Iter, <ins>RvalueOf&lt;</ins>Iter::reference<ins>&gt;::type</ins>&gt; 
          &amp;&amp; EqualityComparable&lt;Iter::value_type&gt; 
    Iter unique(Iter first, Iter last); 
--- 30503,30510 ----
  Change 25.3.9 [alg.unique]:
  </p>
  
! <blockquote><pre>
! template&lt;ForwardIterator Iter&gt; 
    requires OutputIterator&lt;Iter, <ins>RvalueOf&lt;</ins>Iter::reference<ins>&gt;::type</ins>&gt; 
          &amp;&amp; EqualityComparable&lt;Iter::value_type&gt; 
    Iter unique(Iter first, Iter last); 
*************** Note that the synopsis in  [algorithms.s
*** 38362,38371 ****
  
  <hr>
  <h3><a name="1102"></a>1102. <tt>std::vector</tt>'s reallocation policy still unclear</h3>
! <p><b>Section:</b> 23.4.1.2 [vector.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-04-20 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I have the impression that even the wording of current draft
--- 30526,30536 ----
  
  <hr>
  <h3><a name="1102"></a>1102. <tt>std::vector</tt>'s reallocation policy still unclear</h3>
! <p><b>Section:</b> 23.3.6.3 [vector.capacity] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-04-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I have the impression that even the wording of current draft
*************** the belief that <tt>clear</tt> is allowe
*** 38378,38384 ****
  example is something like this:
  </p>
  
! <blockquote><pre>const int buf_size = ...;
  std::vector&lt;T&gt; buf(buf_size);
  for (int i = 0; i &lt; some_condition; ++i) {
    buf.resize(buf_size);
--- 30543,30550 ----
  example is something like this:
  </p>
  
! <blockquote><pre>
! const int buf_size = ...;
  std::vector&lt;T&gt; buf(buf_size);
  for (int i = 0; i &lt; some_condition; ++i) {
    buf.resize(buf_size);
*************** allowed to reallocate it's memory *insid
*** 38394,38423 ****
  IMO the problem is due to the fact, that
  </p>
  
! <ol type="a">
  <li>
  the actual memory-reallocation stability of <tt>std::vector</tt>
! is explained in 23.4.1.2 [vector.capacity]/3 and /6 which
  are describing just the effects of the <tt>reserve</tt>
  function, but in many examples (like above) there
  is no explicit call to <tt>reserve</tt> involved. Further-more
! 23.4.1.2 [vector.capacity]/6 does only mention <em>insertions</em>
  and never mentions the consequences of erasing
  elements.
  </li>
  <li>
  <p>
  the effects clause of <tt>std::vector</tt>'s <tt>erase</tt> overloads in
! 23.4.1.4 [vector.modifiers]/4 is silent about capacity changes. This
  easily causes a misunderstanding, because the counter
! parting insert functions described in 23.4.1.4 [vector.modifiers]/2
  explicitly say, that
  </p>
! <blockquote>
  Causes reallocation if the new size is greater than the
  old capacity. If no reallocation happens, all the iterators
  and references before the insertion point remain valid.
! </blockquote>
  <p>
  It requires a complex argumentation chain about four
  different places in the standard to provide the - possibly
--- 30560,30589 ----
  IMO the problem is due to the fact, that
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  the actual memory-reallocation stability of <tt>std::vector</tt>
! is explained in 23.3.6.3 [vector.capacity]/3 and /6 which
  are describing just the effects of the <tt>reserve</tt>
  function, but in many examples (like above) there
  is no explicit call to <tt>reserve</tt> involved. Further-more
! 23.3.6.3 [vector.capacity]/6 does only mention <em>insertions</em>
  and never mentions the consequences of erasing
  elements.
  </li>
  <li>
  <p>
  the effects clause of <tt>std::vector</tt>'s <tt>erase</tt> overloads in
! 23.3.6.5 [vector.modifiers]/4 is silent about capacity changes. This
  easily causes a misunderstanding, because the counter
! parting insert functions described in 23.3.6.5 [vector.modifiers]/2
  explicitly say, that
  </p>
! <blockquote><p>
  Causes reallocation if the new size is greater than the
  old capacity. If no reallocation happens, all the iterators
  and references before the insertion point remain valid.
! </p></blockquote>
  <p>
  It requires a complex argumentation chain about four
  different places in the standard to provide the - possibly
*************** Move to Review.
*** 38450,38459 ****
  ]</i></p>
  
  
! <blockquote>
  Mark as NAD. Rationale: there is no consensus to clarify the standard,
  general consensus that the standard is correct as written.
! </blockquote>
  
  
  
--- 30616,30625 ----
  ]</i></p>
  
  
! <blockquote><p>
  Mark as NAD. Rationale: there is no consensus to clarify the standard,
  general consensus that the standard is correct as written.
! </p></blockquote>
  
  
  
*************** general consensus that the standard is c
*** 38461,38468 ****
  <p><i>[
  This is a minimum version. I also
  suggest that the wording explaining the allocation strategy
! of <tt>std::vector</tt> in 23.4.1.2 [vector.capacity]/3 and /6 is moved into
! a separate sub paragraph of 23.4.1.2 [vector.capacity] <em>before</em>
  any of the prototype's are discussed, but I cannot provide
  reasonable wording changes now
  ]</i></p>
--- 30627,30634 ----
  <p><i>[
  This is a minimum version. I also
  suggest that the wording explaining the allocation strategy
! of <tt>std::vector</tt> in 23.3.6.3 [vector.capacity]/3 and /6 is moved into
! a separate sub paragraph of 23.3.6.3 [vector.capacity] <em>before</em>
  any of the prototype's are discussed, but I cannot provide
  reasonable wording changes now
  ]</i></p>
*************** reasonable wording changes now
*** 38471,38495 ****
  <ol>
  <li>
  <p>
! Change 23.4.1.2 [vector.capacity]/6 as follows:
  </p>
! <blockquote>
  It is guaranteed that no reallocation takes place during
  insertions <ins>or erasures</ins> that happen after a call
  to <tt>reserve()</tt> until the time when an insertion would make
  the size of the vector greater than the value of <tt>capacity()</tt>.
! </blockquote>
  </li>
  <li>
  <p>
! Change 23.4.1.4 [vector.modifiers]/4 as follows:
  </p>
! <blockquote>
  <i>Effects:</i> <ins>The capacity shall remain unchanged and no reallocation shall
  happen.</ins>
  Invalidates iterators and references at or after the point
  of the erase.
! </blockquote>
  </li>
  </ol>
  
--- 30637,30661 ----
  <ol>
  <li>
  <p>
! Change 23.3.6.3 [vector.capacity]/6 as follows:
  </p>
! <blockquote><p>
  It is guaranteed that no reallocation takes place during
  insertions <ins>or erasures</ins> that happen after a call
  to <tt>reserve()</tt> until the time when an insertion would make
  the size of the vector greater than the value of <tt>capacity()</tt>.
! </p></blockquote>
  </li>
  <li>
  <p>
! Change 23.3.6.5 [vector.modifiers]/4 as follows:
  </p>
! <blockquote><p>
  <i>Effects:</i> <ins>The capacity shall remain unchanged and no reallocation shall
  happen.</ins>
  Invalidates iterators and references at or after the point
  of the erase.
! </p></blockquote>
  </li>
  </ol>
  
*************** of the erase.
*** 38499,38507 ****
  
  <hr>
  <h3><a name="1105"></a>1105. Shouldn't <tt>Range</tt> be an <tt>auto concept</tt></h3>
! <p><b>Section:</b> X [iterator.concepts.range] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-04-23 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><i>[
--- 30665,30673 ----
  
  <hr>
  <h3><a name="1105"></a>1105. Shouldn't <tt>Range</tt> be an <tt>auto concept</tt></h3>
! <p><b>Section:</b> X [iterator.concepts.range] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-04-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><i>[
*************** Even though <tt>XYZCorpContainer</tt> ma
*** 38524,38530 ****
  algorithm, and has been working for years, it appears the user has to write
  at least this:
  </p>
! <blockquote><pre>template&lt;class T&gt; concept_map Range&lt;XYZCorpContainer&lt;T&gt;&gt; {};
  
  template&lt;class T&gt; concept_map Range&lt;const XYZCorpContainer&lt;T&gt;&gt; {};
  </pre></blockquote>
--- 30690,30697 ----
  algorithm, and has been working for years, it appears the user has to write
  at least this:
  </p>
! <blockquote><pre>
! template&lt;class T&gt; concept_map Range&lt;XYZCorpContainer&lt;T&gt;&gt; {};
  
  template&lt;class T&gt; concept_map Range&lt;const XYZCorpContainer&lt;T&gt;&gt; {};
  </pre></blockquote>
*************** Is that correct?
*** 38534,38540 ****
  <p>
  But he may actually have to write this as we do for initializer list:
  </p>
! <blockquote><pre>template&lt;class T&gt;
  concept_map Range&lt;XYZCorpContainer&lt;T&gt;&gt; {
     typedef T* iterator;
     iterator begin(XYZCorpContainer&lt;T&gt; c) { return c.begin(); }
--- 30701,30708 ----
  <p>
  But he may actually have to write this as we do for initializer list:
  </p>
! <blockquote><pre>
! template&lt;class T&gt;
  concept_map Range&lt;XYZCorpContainer&lt;T&gt;&gt; {
     typedef T* iterator;
     iterator begin(XYZCorpContainer&lt;T&gt; c) { return c.begin(); }
*************** Committee Draft is issued.
*** 38605,38707 ****
  
  
  <hr>
- <h3><a name="1106"></a>1106. Multiple exceptions from connected <tt>shared_future::get()</tt>?</h3>
- <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Thomas J. Gritzan <b>Opened:</b> 2009-04-03 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- It is not clear, if multiple threads are waiting in a 
- <tt>shared_future::get()</tt> call, if each will rethrow the stored exception.
- </p>
- <p>
- Paragraph 9 reads: 
- </p>
- <blockquote>
- <i>Throws:</i> the stored exception, if an exception was stored and not 
- retrieved before.
- </blockquote>
- <p>
- The "not retrieved before" suggests that only one exception is thrown, 
- but one exception for each call to <tt>get()</tt> is needed, and multiple calls 
- to <tt>get()</tt> even on the same <tt>shared_future</tt> object seem to be allowed. 
- </p>
- <p>
- I suggest removing "and not retrieved before" from the Throws paragraph. 
- I recommend adding a note that explains that multiple calls on <tt>get()</tt> are 
- allowed, and each call would result in an exception if an exception was 
- stored. 
- </p>
- 
- <p><i>[
- Batavia (2009-05):
- ]</i></p>
- 
- <blockquote>
- <p>
- We note there is a pending paper by Detlef
- on such <tt>future</tt>-related issues;
- we would like to wait for his paper before proceeding.
- </p>
- <p>
- Alisdair suggests we may want language to clarify that this
- <tt>get()</tt> function can be called from several threads
- with no need for explicit locking.
- </p>
- <p>
- Move to Open.
- </p>
- </blockquote>
- 
- <p><i>[
- 2010-01-23 Moved to Tentatively NAD Editorial after 5 positive votes on
- c++std-lib.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Resolved by paper
- <a href="file:///Users/hinnant/std%20documents/C++Mailings/papers/2009/n2997.htm">N2997</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change 30.6.7 [futures.shared_future]:
- </p>
- 
- <blockquote><pre>const R&amp; shared_future::get() const; 
- R&amp; shared_future&lt;R&amp;&gt;::get() const; 
- void shared_future&lt;void&gt;::get() const;
- </pre>
- <blockquote>
- <p>...</p>
- <p>
- -9- <i>Throws:</i> the stored exception, if an exception was stored<del> and not retrieved before</del>.
- <ins>
- [<i>Note:</i> Multiple calls on <tt>get()</tt> are 
- allowed, and each call would result in an exception if an exception was 
- stored. — <i>end note</i>]
- </ins>
- </p>
- </blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1107"></a>1107. constructor <tt>shared_future(unique_future)</tt> by value?</h3>
! <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Thomas J. Gritzan <b>Opened:</b> 2009-04-03 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the <tt>shared_future</tt> class definition in 30.6.7 [futures.shared_future]
--- 30773,30783 ----
  
  
  <hr>
  <h3><a name="1107"></a>1107. constructor <tt>shared_future(unique_future)</tt> by value?</h3>
! <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Thomas J. Gritzan <b>Opened:</b> 2009-04-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the <tt>shared_future</tt> class definition in 30.6.7 [futures.shared_future]
*************** I think that is a mistake and the constr
*** 38716,38722 ****
  reference: 
  </p>
  
! <blockquote><pre>shared_future(unique_future&lt;R&gt;&amp;&amp; rhs);
  </pre></blockquote>
  
  <p><i>[
--- 30792,30799 ----
  reference: 
  </p>
  
! <blockquote><pre>
! shared_future(unique_future&lt;R&gt;&amp;&amp; rhs);
  </pre></blockquote>
  
  <p><i>[
*************** Batavia (2009-05):
*** 38726,38733 ****
  <blockquote>
  <p>
  We agree with the proposed resolution.
! </p>
! <p>
  Move to Tentatively Ready.
  </p>
  </blockquote>
--- 30803,30809 ----
  <blockquote>
  <p>
  We agree with the proposed resolution.
! <p/>
  Move to Tentatively Ready.
  </p>
  </blockquote>
*************** Move to Tentatively Ready.
*** 38737,38746 ****
  ]</i></p>
  
  
! <blockquote>
  The proposed change has already been incorported into the current working draft
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 30813,30823 ----
  ]</i></p>
  
  
! <blockquote><p>
  The proposed change has already been incorported into the current working draft
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>.
! </p></blockquote>
! 
  
  
  <p><b>Proposed resolution:</b></p>
*************** The proposed change has already been inc
*** 38748,38761 ****
  Change the synopsis in 30.6.7 [futures.shared_future]:
  </p>
  
! <blockquote><pre>shared_future(unique_future&lt;R&gt;<ins>&amp;&amp;</ins> rhs);
  </pre></blockquote>
  
  <p>
  Change the definition of the constructor in 30.6.7 [futures.shared_future]:
  </p>
  
! <blockquote><pre>shared_future(<del>const</del> unique_future&lt;R&gt;<ins>&amp;&amp;</ins> rhs);
  </pre></blockquote>
  
  
--- 30825,30840 ----
  Change the synopsis in 30.6.7 [futures.shared_future]:
  </p>
  
! <blockquote><pre>
! shared_future(unique_future&lt;R&gt;<ins>&amp;&amp;</ins> rhs);
  </pre></blockquote>
  
  <p>
  Change the definition of the constructor in 30.6.7 [futures.shared_future]:
  </p>
  
! <blockquote><pre>
! shared_future(<del>const</del> unique_future&lt;R&gt;<ins>&amp;&amp;</ins> rhs);
  </pre></blockquote>
  
  
*************** Change the definition of the constructor
*** 38765,38774 ****
  
  <hr>
  <h3><a name="1109"></a>1109. <tt>std::includes</tt> should require <tt>CopyConstructible</tt> predicate</h3>
! <p><b>Section:</b> 25.4.5.1 [includes] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-04-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#includes">issues</a> in [includes].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  All the set operation algorithms require a <tt>CopyConstructible</tt> predicate, with
--- 30844,30853 ----
  
  <hr>
  <h3><a name="1109"></a>1109. <tt>std::includes</tt> should require <tt>CopyConstructible</tt> predicate</h3>
! <p><b>Section:</b> 25.4.5.1 [includes] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-04-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#includes">issues</a> in [includes].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  All the set operation algorithms require a <tt>CopyConstructible</tt> predicate, with
*************** constructible, and wording style of othe
*** 38781,38790 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to NAD Editorial.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 30860,30869 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to NAD Editorial.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to NAD Editorial.
*** 38792,38798 ****
  Change  [algorithms.syn] and 25.4.5.1 [includes]:
  </p>
  
! <blockquote><pre>template&lt;InputIterator Iter1, InputIterator Iter2,
           <del>typename</del> <ins>CopyConstructible</ins> Compare&gt;
    requires Predicate&lt;Compare, Iter1::value_type, Iter2::value_type&gt;
          &amp;&amp; Predicate&lt;Compare, Iter2::value_type, Iter1::value_type&gt;
--- 30871,30878 ----
  Change  [algorithms.syn] and 25.4.5.1 [includes]:
  </p>
  
! <blockquote><pre>
! template&lt;InputIterator Iter1, InputIterator Iter2,
           <del>typename</del> <ins>CopyConstructible</ins> Compare&gt;
    requires Predicate&lt;Compare, Iter1::value_type, Iter2::value_type&gt;
          &amp;&amp; Predicate&lt;Compare, Iter2::value_type, Iter1::value_type&gt;
*************** Change  [algorithms.syn] and 25.4.5.1 [i
*** 38807,38816 ****
  
  <hr>
  <h3><a name="1111"></a>1111. associative containers underconstrained</h3>
! <p><b>Section:</b> 23.6 [associative] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-04-29 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative">issues</a> in [associative].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to table 87 (n2857) the expression <tt>X::key_equal</tt> for an unordered
--- 30887,30897 ----
  
  <hr>
  <h3><a name="1111"></a>1111. associative containers underconstrained</h3>
! <p><b>Section:</b> 23.4 [associative] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-04-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative">active issues</a> in [associative].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative">issues</a> in [associative].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to table 87 (n2857) the expression <tt>X::key_equal</tt> for an unordered
*************** Move to Review.
*** 38841,38863 ****
  <p>
  For ordered containers, replace 
  </p>
! <blockquote><pre>Predicate&lt;auto, Key, Key&gt; Compare = less&lt;Key&gt;
  </pre></blockquote>
  <p>
  with 
  </p>
! <blockquote><pre>StrictWeakOrder&lt;auto, Key, Key&gt; Compare = less&lt;Key&gt;
  </pre></blockquote>
  
  <p>
  For unordered containers, replace 
  </p>
! <blockquote><pre>Predicate&lt;auto, Key, Key&gt; Compare = less&lt;Key&gt;
  </pre></blockquote>
  <p>
  with 
  </p>
! <blockquote><pre>EquivalenceRelation&lt;auto, Key, Key&gt; Compare = less&lt;Key&gt;
  </pre></blockquote>
  <p>
  As in the following declarations:
--- 30922,30948 ----
  <p>
  For ordered containers, replace 
  </p>
! <blockquote><pre>
! Predicate&lt;auto, Key, Key&gt; Compare = less&lt;Key&gt;
  </pre></blockquote>
  <p>
  with 
  </p>
! <blockquote><pre>
! StrictWeakOrder&lt;auto, Key, Key&gt; Compare = less&lt;Key&gt;
  </pre></blockquote>
  
  <p>
  For unordered containers, replace 
  </p>
! <blockquote><pre>
! Predicate&lt;auto, Key, Key&gt; Compare = less&lt;Key&gt;
  </pre></blockquote>
  <p>
  with 
  </p>
! <blockquote><pre>
! EquivalenceRelation&lt;auto, Key, Key&gt; Compare = less&lt;Key&gt;
  </pre></blockquote>
  <p>
  As in the following declarations:
*************** As in the following declarations:
*** 38865,38882 ****
  
  <blockquote>
  <p>
! Associative containers 23.6 [associative]
  </p>
  <p>
!  1 Headers &lt;map&gt; and &lt;set&gt;:
  </p>
  <p>
!    Header &lt;map&gt; synopsis
  </p>
! <blockquote><pre>   namespace std {
       template &lt;ValueType Key, ValueType T,
                 <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
!                Allocator Alloc = allocator&lt;pair&amp;lt;&lt;b&gt;const Key, T&gt; &gt; &gt;
         requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
               &amp;&amp; CopyConstructible&lt;Compare&gt;
               &amp;&amp; AllocatableElement&lt;Alloc, Compare, const Compare&amp;&gt;
--- 30950,30968 ----
  
  <blockquote>
  <p>
! Associative containers 23.4 [associative]
  </p>
  <p>
!  1 Headers <tt>&lt;map&gt;</tt> and <tt>&lt;set&gt;</tt>:
  </p>
  <p>
!    Header <tt>&lt;map&gt;</tt> synopsis
  </p>
! <blockquote><pre>
!    namespace std {
       template &lt;ValueType Key, ValueType T,
                 <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
!                Allocator Alloc = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
         requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
               &amp;&amp; CopyConstructible&lt;Compare&gt;
               &amp;&amp; AllocatableElement&lt;Alloc, Compare, const Compare&amp;&gt;
*************** Associative containers 23.6 [associative
*** 38887,38893 ****
  
       template &lt;ValueType Key, ValueType T,
                 <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
!                Allocator Alloc = allocator&lt;pair&amp;lt;&lt;b&gt;const Key, T&gt; &gt; &gt;
         requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
               &amp;&amp; CopyConstructible&lt;Compare&gt;
               &amp;&amp; AllocatableElement&lt;Alloc, Compare, const Compare&amp;&gt;
--- 30973,30979 ----
  
       template &lt;ValueType Key, ValueType T,
                 <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
!                Allocator Alloc = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
         requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
               &amp;&amp; CopyConstructible&lt;Compare&gt;
               &amp;&amp; AllocatableElement&lt;Alloc, Compare, const Compare&amp;&gt;
*************** Associative containers 23.6 [associative
*** 38902,38908 ****
  <p>
     Header &lt;set&gt; synopsis
  </p>
! <blockquote><pre>   namespace std {
       template &lt;ValueType Key, <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
                 Allocator Alloc = allocator&lt;Key&gt; &gt;
         requires NothrowDestructible&lt;Key&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;
--- 30988,30995 ----
  <p>
     Header &lt;set&gt; synopsis
  </p>
! <blockquote><pre>
!    namespace std {
       template &lt;ValueType Key, <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
                 Allocator Alloc = allocator&lt;Key&gt; &gt;
         requires NothrowDestructible&lt;Key&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;
*************** Associative containers 23.6 [associative
*** 38927,38936 ****
  <p>
   23.4.1p2 Class template map [map]
  </p>
! <blockquote><pre> namespace std {
     template &lt;ValueType Key, ValueType T,
               <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&amp;lt;&lt;b&gt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; CopyConstructible&lt;Compare&gt;
             &amp;&amp; AllocatableElement&lt;Alloc, Compare, const Compare&amp;&gt;
--- 31014,31024 ----
  <p>
   23.4.1p2 Class template map [map]
  </p>
! <blockquote><pre>
!  namespace std {
     template &lt;ValueType Key, ValueType T,
               <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; CopyConstructible&lt;Compare&gt;
             &amp;&amp; AllocatableElement&lt;Alloc, Compare, const Compare&amp;&gt;
*************** Associative containers 23.6 [associative
*** 38945,38954 ****
  <p>
   23.4.2p2 Class template multimap [multimap]
  </p>
! <blockquote><pre> namespace std {
     template &lt;ValueType Key, ValueType T,
               <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&amp;lt;&lt;b&gt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; CopyConstructible&lt;Compare&gt;
             &amp;&amp; AllocatableElement&lt;Alloc, Compare, const Compare&amp;&gt;
--- 31033,31043 ----
  <p>
   23.4.2p2 Class template multimap [multimap]
  </p>
! <blockquote><pre>
!  namespace std {
     template &lt;ValueType Key, ValueType T,
               <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; CopyConstructible&lt;Compare&gt;
             &amp;&amp; AllocatableElement&lt;Alloc, Compare, const Compare&amp;&gt;
*************** Associative containers 23.6 [associative
*** 38963,38969 ****
  <p>
   23.4.3p2 Class template set [set]
  </p>
! <blockquote><pre> namespace std {
     template &lt;ValueType Key, <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
               Allocator Alloc = allocator&lt;Key&gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;
--- 31052,31059 ----
  <p>
   23.4.3p2 Class template set [set]
  </p>
! <blockquote><pre>
!  namespace std {
     template &lt;ValueType Key, <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
               Allocator Alloc = allocator&lt;Key&gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;
*************** Associative containers 23.6 [associative
*** 38979,38985 ****
  <p>
   23.4.4p2 Class template multiset [multiset]
  </p>
! <blockquote><pre> namespace std {
     template &lt;ValueType Key, <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
               Allocator Alloc = allocator&lt;Key&gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;
--- 31069,31076 ----
  <p>
   23.4.4p2 Class template multiset [multiset]
  </p>
! <blockquote><pre>
!  namespace std {
     template &lt;ValueType Key, <del>Predicate</del><ins>StrictWeakOrder</ins>&lt;auto, Key<del>, Key</del>&gt; Compare = less&lt;Key&gt;,
               Allocator Alloc = allocator&lt;Key&gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; CopyConstructible&lt;Compare&gt;
*************** Associative containers 23.6 [associative
*** 39000,39012 ****
  <p>
   Header &lt;unordered_map&gt; synopsis
  </p>
! <blockquote><pre> namespace std {
     // 23.5.1, class template unordered_map:
     template &lt;ValueType Key,
               ValueType T,
               Callable&lt;auto, const Key&amp;&gt; Hash = hash&lt;Key&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Key<del>, Key</del>&gt; Pred = equal_to&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&amp;lt;&lt;b&gt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; SameType&lt;Hash::result_type, size_t&gt;
             &amp;&amp; CopyConstructible&lt;Hash&gt; &amp;&amp; CopyConstructible&lt;Pred&gt;
--- 31091,31104 ----
  <p>
   Header &lt;unordered_map&gt; synopsis
  </p>
! <blockquote><pre>
!  namespace std {
     // 23.5.1, class template unordered_map:
     template &lt;ValueType Key,
               ValueType T,
               Callable&lt;auto, const Key&amp;&gt; Hash = hash&lt;Key&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Key<del>, Key</del>&gt; Pred = equal_to&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; SameType&lt;Hash::result_type, size_t&gt;
             &amp;&amp; CopyConstructible&lt;Hash&gt; &amp;&amp; CopyConstructible&lt;Pred&gt;
*************** Associative containers 23.6 [associative
*** 39021,39027 ****
               ValueType T,
               Callable&lt;auto, const Key&amp;&gt; Hash = hash&lt;Key&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Key<del>, Key</del>&gt; Pred = equal_to&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&amp;lt;&lt;b&gt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; SameType&lt;Hash::result_type, size_t&gt;
             &amp;&amp; CopyConstructible&lt;Hash&gt; &amp;&amp; CopyConstructible&lt;Pred&gt;
--- 31113,31119 ----
               ValueType T,
               Callable&lt;auto, const Key&amp;&gt; Hash = hash&lt;Key&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Key<del>, Key</del>&gt; Pred = equal_to&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; SameType&lt;Hash::result_type, size_t&gt;
             &amp;&amp; CopyConstructible&lt;Hash&gt; &amp;&amp; CopyConstructible&lt;Pred&gt;
*************** Associative containers 23.6 [associative
*** 39038,39044 ****
  <p>
   Header &lt;unordered_set&gt; synopsis
  </p>
! <blockquote><pre> namespace std {
     // 23.5.3, class template unordered_set:
     template &lt;ValueType Value,
               Callable&lt;auto, const Value&amp;&gt; Hash = hash&lt;Value&gt;,
--- 31130,31137 ----
  <p>
   Header &lt;unordered_set&gt; synopsis
  </p>
! <blockquote><pre>
!  namespace std {
     // 23.5.3, class template unordered_set:
     template &lt;ValueType Value,
               Callable&lt;auto, const Value&amp;&gt; Hash = hash&lt;Value&gt;,
*************** Associative containers 23.6 [associative
*** 39074,39085 ****
  <p>
   23.5.1p3 Class template unordered_map [unord.map]
  </p>
! <blockquote><pre> namespace std {
     template &lt;ValueType Key,
               ValueType T,
               Callable&lt;auto, const Key&amp;&gt; Hash = hash&lt;Key&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Key<del>, Key</del>&gt; Pred = equal_to&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&amp;lt;&lt;b&gt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; SameType&lt;Hash::result_type, size_t&gt;
             &amp;&amp; CopyConstructible&lt;Hash&gt; &amp;&amp; CopyConstructible&lt;Pred&gt;
--- 31167,31179 ----
  <p>
   23.5.1p3 Class template unordered_map [unord.map]
  </p>
! <blockquote><pre>
!  namespace std {
     template &lt;ValueType Key,
               ValueType T,
               Callable&lt;auto, const Key&amp;&gt; Hash = hash&lt;Key&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Key<del>, Key</del>&gt; Pred = equal_to&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; SameType&lt;Hash::result_type, size_t&gt;
             &amp;&amp; CopyConstructible&lt;Hash&gt; &amp;&amp; CopyConstructible&lt;Pred&gt;
*************** Associative containers 23.6 [associative
*** 39097,39108 ****
  <p>
   23.5.2p3 Class template unordered_multimap [unord.multimap]
  </p>
! <blockquote><pre> namespace std {
     template &lt;ValueType Key,
               ValueType T,
               Callable&lt;auto, const Key&amp;&gt; Hash = hash&lt;Key&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Key<del>, Key</del>&gt; Pred = equal_to&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&amp;lt;&lt;b&gt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; SameType&lt;Hash::result_type, size_t&gt;
             &amp;&amp; CopyConstructible&lt;Hash&gt; &amp;&amp; CopyConstructible&lt;Pred&gt;
--- 31191,31203 ----
  <p>
   23.5.2p3 Class template unordered_multimap [unord.multimap]
  </p>
! <blockquote><pre>
!  namespace std {
     template &lt;ValueType Key,
               ValueType T,
               Callable&lt;auto, const Key&amp;&gt; Hash = hash&lt;Key&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Key<del>, Key</del>&gt; Pred = equal_to&lt;Key&gt;,
!              Allocator Alloc = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
       requires NothrowDestructible&lt;Key&gt; &amp;&amp; NothrowDestructible&lt;T&gt;
             &amp;&amp; SameType&lt;Hash::result_type, size_t&gt;
             &amp;&amp; CopyConstructible&lt;Hash&gt; &amp;&amp; CopyConstructible&lt;Pred&gt;
*************** Associative containers 23.6 [associative
*** 39120,39126 ****
  <p>
   23.5.3p3 Class template unordered_set [unord.set]
  </p>
! <blockquote><pre> namespace std {
     template &lt;ValueType Value,
               Callable&lt;auto, const Value&amp;&gt; Hash = hash&lt;Value&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Value<del>, Value</del>&gt; class Pred = equal_to&lt;Value&gt;,
--- 31215,31222 ----
  <p>
   23.5.3p3 Class template unordered_set [unord.set]
  </p>
! <blockquote><pre>
!  namespace std {
     template &lt;ValueType Value,
               Callable&lt;auto, const Value&amp;&gt; Hash = hash&lt;Value&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Value<del>, Value</del>&gt; class Pred = equal_to&lt;Value&gt;,
*************** Associative containers 23.6 [associative
*** 39141,39147 ****
  <p>
   23.5.4p3 Class template unordered_multiset [unord.multiset]
  </p>
! <blockquote><pre> namespace std {
     template &lt;ValueType Value,
               Callable&lt;auto, const Value&amp;&gt; Hash = hash&lt;Value&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Value<del>, Value</del>&gt; class Pred = equal_to&lt;Value&gt;,
--- 31237,31244 ----
  <p>
   23.5.4p3 Class template unordered_multiset [unord.multiset]
  </p>
! <blockquote><pre>
!  namespace std {
     template &lt;ValueType Value,
               Callable&lt;auto, const Value&amp;&gt; Hash = hash&lt;Value&gt;,
               <del>Predicate</del><ins>EquivalenceRelation</ins>&lt;auto, Value<del>, Value</del>&gt; class Pred = equal_to&lt;Value&gt;,
*************** Associative containers 23.6 [associative
*** 39168,39350 ****
  
  
  <hr>
- <h3><a name="1112"></a>1112. bitsets and new style for loop</h3>
- <p><b>Section:</b> 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-06 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- <tt>Std::bitset</tt> is a homogeneous container-like sequence of bits, yet it does
- not model the Range concept so cannot be used with the new for-loop syntax.
- It is the only such type in the library that does NOT support the new for
- loop.
- </p>
- <p>
- The obvious reason is that bitset does not support iterators.
- </p>
- <p>
- At least two reasonable solutions are available:
- </p>
- <ol type="i">
- <li>
- Add an iterator interface to <tt>bitset</tt>, bringing its interface close to that
- of <tt>std::array</tt>
- </li>
- <li>
- Provide an unspecified concept_map for <tt>Range&lt;bitset&gt;</tt>.
- </li>
- </ol>
- <p>
- The latter will still need some kind of iterator-like adapter for <tt>bitset</tt>,
- but gives implementers greater freedom on the details. E.g. begin/end return
- some type that simply invokes <tt>operator[]</tt> on the object it wraps, and
- increments its index on <tt>operator++</tt>.  A vendor can settle for <tt>InputIterator</tt>
- support, rather than wrapping up a full <tt>RandomAccessIterator</tt>.
- </p>
- <p>
- I have a mild preference for option (ii) as I think it is less work to
- specify at this stage of the process, although (i) is probably more useful
- in the long run.
- </p>
- <p>
- Hmm, my wording looks a little woolly, as it does not say what the element
- type of the range is.  Do I get a range of <tt>bool</tt>, <tt>bitset&lt;N&gt;::reference</tt>, or
- something else entirely?
- </p>
- <p>
- I guess most users will assume the behaviour of reference, but expect to
- work with <tt>bool</tt>.  <tt>Bool</tt> is OK for read-only traversal, but you really need to
- take a reference to a <tt>bitset::reference</tt> if you want to write back.
- </p>
- 
- <p><i>[
- Batavia (2009-05):
- ]</i></p>
- 
- <blockquote>
- Move to Open.
- We further recommend this be deferred until after the next Committee Draft.
- </blockquote>
- 
- <p><i>[
- 2009-05-25 Alisdair adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- I just stumbled over the <tt>Range concept_map</tt> for <tt>valarray</tt> and this should
- probably set the precedent on how to write the wording.
- </p>
- 
- <p><i>[
- Howard: I've replaced the proposed wording with Alisdair's suggestion.
- ]</i></p>
- 
- 
- </blockquote>
- 
- <p><i>[
- 2009-07-24 Daniel modifies the proposed wording for non-concepts.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 post-Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Mark as Tentatively NAD Future due to the loss of concepts.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- All concepts-related text has been removed from the draft.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <ol>
- <li>
- <p>
- Modify the section 20.5 [template.bitset] <tt>&lt;bitset&gt;</tt> synopsis by adding
- the following at the end of the synopsis:
- </p>
- <blockquote><pre><ins>
- // XX.X.X bitset range access [bitset.range]
- template&lt;size_t N&gt; <i>unspecified-1</i> begin(bitset&lt;N&gt;&amp;);
- template&lt;size_t N&gt; <i>unspecified-2</i> begin(const bitset&lt;N&gt;&amp;);
- template&lt;size_t N&gt; <i>unspecified-1</i> end(bitset&lt;N&gt;&amp;);
- template&lt;size_t N&gt; <i>unspecified-2</i> end(const bitset&lt;N&gt;&amp;);
- </ins>
- </pre></blockquote>
- </li>
- <li>
- <p>
- Add a new section <ins>"bitset range access" [bitset.range]</ins>
- after the current section 20.5.4 [bitset.operators] with the following series of
- paragraphs:
- </p>
- <blockquote>
- <p>
- <ins>
- 1.  In the <tt>begin</tt> and <tt>end</tt> function templates that follow, <i>unspecified-1</i>
- is a type that meets the requirements of a mutable random access
- iterator (24.2.7 [random.access.iterators]) whose <tt>value_type</tt> is <tt>bool</tt> and
- whose reference type is <tt>bitset&lt;N&gt;::reference</tt>.
- <i>unspecified-2</i> is a type that meets the requirements of a constant
- random access iterator (24.2.7 [random.access.iterators]) whose <tt>value_type</tt>
- is <tt>bool</tt> and whose reference type is <tt>bool</tt>.
- </ins>
- </p>
- <pre><ins>
- template&lt;size_t N&gt; <i>unspecified-1</i> begin(bitset&lt;N&gt;&amp;);
- template&lt;size_t N&gt; <i>unspecified-2</i> begin(const bitset&lt;N&gt;&amp;);
- </ins>
- </pre>
- <blockquote>
- <ins>2.  Returns: an iterator referencing the first bit in the bitset.</ins>
- </blockquote>
- 
- <pre><ins>
- template&lt;size_t N&gt; <i>unspecified-1</i> end(bitset&lt;N&gt;&amp;);
- template&lt;size_t N&gt; <i>unspecified-2</i> end(const bitset&lt;N&gt;&amp;);
- </ins></pre>
- 
- <blockquote>
- <ins>3.  Returns: an iterator referencing one past the last bit in the
- bitset.</ins>
- </blockquote>
- </blockquote>
- </li>
- </ol>
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1115"></a>1115. <tt>va_copy</tt> missing from Standard macros table</h3>
! <p><b>Section:</b> C.2 [diff.library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Miles Zhao <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#diff.library">issues</a> in [diff.library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In "Table 122 -- Standard macros" of C.2 [diff.library], which lists the 56 macros
  inherited from C library, <tt>va_copy</tt> seems to be missing. But in
! "Table 21 -- Header <tt>&lt;cstdarg&gt;</tt> synopsis" (18.10 [support.runtime]), there is.
  </p>
  
  <p><i>[
--- 31265,31280 ----
  
  
  <hr>
  <h3><a name="1115"></a>1115. <tt>va_copy</tt> missing from Standard macros table</h3>
! <p><b>Section:</b> C.5 [diff.library] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Miles Zhao <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#diff.library">issues</a> in [diff.library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In "Table 122 &mdash; Standard macros" of C.5 [diff.library], which lists the 56 macros
  inherited from C library, <tt>va_copy</tt> seems to be missing. But in
! "Table 21 &mdash; Header <tt>&lt;cstdarg&gt;</tt> synopsis" (18.10 [support.runtime]), there is.
  </p>
  
  <p><i>[
*************** inherited from C library, <tt>va_copy</t
*** 39352,39367 ****
  ]</i></p>
  
  
! <blockquote>
  Mark as Tentatively NAD Editorial, if Pete disagrees, Howard
  will move to Tentatively Ready
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add <tt>va_copy</tt> to Table 122 -- Standard macros in C.2 [diff.library].
  </p>
  
  
--- 31282,31297 ----
  ]</i></p>
  
  
! <blockquote><p>
  Mark as Tentatively NAD Editorial, if Pete disagrees, Howard
  will move to Tentatively Ready
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add <tt>va_copy</tt> to Table 122 -- Standard macros in C.5 [diff.library].
  </p>
  
  
*************** Add <tt>va_copy</tt> to Table 122 -- Sta
*** 39370,39379 ****
  
  <hr>
  <h3><a name="1119"></a>1119. tuple query APIs do not support references</h3>
! <p><b>Section:</b> 20.4.2.5 [tuple.helper] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.helper">issues</a> in [tuple.helper].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>tuple</tt> query APIs <tt>tuple_size</tt> and
--- 31300,31309 ----
  
  <hr>
  <h3><a name="1119"></a>1119. tuple query APIs do not support references</h3>
! <p><b>Section:</b> 20.4.2.5 [tuple.helper] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.helper">issues</a> in [tuple.helper].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>tuple</tt> query APIs <tt>tuple_size</tt> and
*************** Note that we have the same problem in nu
*** 39398,39406 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Open. Alisdair to provide wording.
! </blockquote>
  
  
  <p><i>[
--- 31328,31336 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Open. Alisdair to provide wording.
! </p></blockquote>
  
  
  <p><i>[
*************** Move to Open. Alisdair to provide wordin
*** 39408,39474 ****
  ]</i></p>
  
  
! <blockquote>
! Move to NAD.  This is an extension after the FCD, without a clear motivation.  May consider as NAD Future if motivating examples come forward.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1120"></a>1120. New type trait - remove_all</h3>
! <p><b>Section:</b> 20.7 [meta] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Sometimes it is necessary to remove all qualifiers from a type before
! passing on to a further API.  A good example would be calling the
! <tt>tuple</tt> query APIs <tt>tuple_size</tt> or <tt>tuple_element</tt>
! with a deduced type inside a function template.  If the deduced type is
! cv-qualified or a reference then the call will fail.  The solution is to
! chain calls to
! <tt>remove_cv&lt;remove_reference&lt;T&gt;::type&gt;::type</tt>, and
! note that the order matters.
! </p>
! <p>
! Suggest it would be helpful to add a new type trait,
! <tt>remove_all</tt>, that removes all top-level qualifiers from a type
! i.e. cv-qualification and any references.  Define the term in such a way
! that if additional qualifiers are added to the language, then
! <tt>remove_all</tt> is defined as stripping those as well.
! </p>
! 
! <p><i>[
! 2009-10-14 Daniel adds:
! ]</i></p>
! 
! 
! <blockquote>
! <tt>remove_all</tt> seems too generic, a possible alternative matching
! the current naming style could be <tt>remove_cv_reference</tt> or
! <tt>remove_reference_cv</tt>. It should also be considered whether this
! trait should also remove 'extents', or pointer 'decorations'. Especially
! if the latter situations are considered as well, it might be easier to
! chose the name not in terms of what it <em>removes</em> (which might be
! a lot), but in terms of it <em>creates</em>. In this case I could think
! of e.g. <tt>extract_value_type</tt>.
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Future.
! </blockquote>
  
  
  
--- 31338,31347 ----
  ]</i></p>
  
  
! <blockquote><p>
! Move to NAD.  This is an extension after the FCD, without a clear motivation.  
! May consider as NAD Future if motivating examples come forward.
! </p></blockquote>
  
  
  
*************** NAD Future.
*** 39479,39637 ****
  
  
  <hr>
- <h3><a name="1121"></a>1121. Support for multiple arguments</h3>
- <p><b>Section:</b> 20.6.2 [ratio.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-25 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ratio.arithmetic">issues</a> in [ratio.arithmetic].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Both add and multiply could sensibly be called with more than two arguments.
- The variadic template facility makes such declarations simple, and is likely
- to be frequently wrapped by end users if we do not supply the variant
- ourselves.
- </p>
- <p>
- We deliberately ignore divide at this point as it is not transitive.
- Likewise, subtract places special meaning on the first argument so I do not
- suggest extending that immediately.  Both could be supported with analogous
- wording to that for add/multiply below.
- </p>
- <p>
- Note that the proposed resolution is potentially incompatible with that
- proposed for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, although the addition of the typedef to ratio would be
- equally useful.
- </p>
- 
- <p><i>[
- 2009-10-30 Alisdair adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- The consensus of the group when we reviewed this in Santa Cruz was that
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a> would proceed to Ready as planned, and the
- multi-paramater add/multiply templates should be renamed as
- <tt>ratio_sum</tt> and <tt>ratio_product</tt> to avoid the problem
- mixing template aliases with partial specializations.
- </p>
- 
- <p>
- It was also suggested to close this issue as NAD Future as it does not
- correspond directly to any NB comment.  NBs are free to submit a
- specific comment (and re-open) in CD2 though.
- </p>
- 
- <p>
- Walter Brown also had concerns on better directing the order of
- evaluation to avoid overflows if we do proceed for 0x rather than TR1,
- so wording may not be complete yet.
- </p>
- 
- <p><i>[
- Alisdair updates wording.
- ]</i></p>
- 
- 
- </blockquote>
- 
- <p><i>[
- 2009-10-30 Howard:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to Tentatively NAD Future after 5 positive votes on c++std-lib.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Does not have sufficient support at this time. May wish to reconsider for a
- future standard.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- <p>
- Add the following type traits to p3 20.6 [ratio]
- </p>
- 
- <blockquote><pre>// ratio arithmetic
- template &lt;class R1, class R2&gt; struct ratio_add;
- template &lt;class R1, class R2&gt; struct ratio_subtract;
- template &lt;class R1, class R2&gt; struct ratio_multiply;
- template &lt;class R1, class R2&gt; struct ratio_divide;
- <ins>template &lt;class R1, class ... RList&gt; struct ratio_sum;</ins>
- <ins>template &lt;class R1, class ... RList&gt; struct ratio_product;</ins>
- </pre></blockquote>
- 
- <p>
- after 20.6.2 [ratio.arithmetic] p1: add
- </p>
- 
- <blockquote><pre>template &lt;class R1, class ... RList&gt; struct ratio_sum; // declared, never defined
- 
- template &lt;class R1&gt; struct ratio_sum&lt;R1&gt; : R1 {};
- </pre>
- 
- <blockquote>
- <i>Requires:</i> <tt>R1</tt> is a specialization of class template <tt>ratio</tt>
- </blockquote>
- 
- <pre>template &lt;class R1, class R2, class ... RList&gt; 
-  struct ratio_sum&lt;R1, R2, RList...&gt;
-    : ratio_add&lt; R1, ratio_sum&lt;R2, RList...&gt;&gt; {
- };
- </pre>
- 
- <blockquote>
- <i>Requires:</i> <tt>R1</tt> and each element in parmater pack
- <tt>RList</tt> is a specialization of class template <tt>ratio</tt>
- </blockquote>
- </blockquote>
- 
- <p>
- after 20.6.2 [ratio.arithmetic] p3: add
- </p>
- 
- <blockquote><pre>template &lt;class R1, class ... RList&gt; struct ratio_product; // declared, never defined
- 
- template &lt;class R1&gt; struct ratio_product&lt;R1&gt; : R1 {};
- </pre>
- 
- <blockquote>
- <i>Requires:</i> <tt>R1</tt> is a specialization of class template <tt>ratio</tt>
- </blockquote>
- 
- <pre>template &lt;class R1, class R2, class ... RList&gt; 
-  struct ratio_sum&lt;R1, R2, RList...&gt;
-    : ratio_add&lt; R1, ratio_product&lt;R2, RList...&gt;&gt; {
- };
- </pre>
- 
- <blockquote>
- <i>Requires:</i> <tt>R1</tt> and each element in parmater pack
- <tt>RList</tt> is a specialization of class template <tt>ratio</tt>
- </blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1124"></a>1124.  Invalid definition of concept RvalueOf</h3>
! <p><b>Section:</b> X [concept.transform] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#concept.transform">issues</a> in [concept.transform].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A recent news group
--- 31352,31362 ----
  
  
  <hr>
  <h3><a name="1124"></a>1124.  Invalid definition of concept RvalueOf</h3>
! <p><b>Section:</b> X [concept.transform] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#concept.transform">issues</a> in [concept.transform].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A recent news group
*************** One problem of the concept <tt>RvalueOf<
*** 39644,39650 ****
  X [concept.transform]:
  </p>
  
! <blockquote><pre>concept RvalueOf&lt;typename T&gt; {
   typename type = T&amp;&amp;;
   requires ExplicitlyConvertible&lt;T&amp;,type&gt; &amp;&amp; Convertible&lt;T&amp;&amp;,type&gt;;
  }
--- 31369,31376 ----
  X [concept.transform]:
  </p>
  
! <blockquote><pre>
! concept RvalueOf&lt;typename T&gt; {
   typename type = T&amp;&amp;;
   requires ExplicitlyConvertible&lt;T&amp;,type&gt; &amp;&amp; Convertible&lt;T&amp;&amp;,type&gt;;
  }
*************** type requirement.
*** 39672,39678 ****
  In X [concept.transform] before p. 4 change as indicated:
  </p>
  
! <blockquote><pre>auto concept RvalueOf&lt;typename T&gt; {
    <del>typename</del><ins>RvalueReference</ins> type = T&amp;&amp;;
    requires <del>ExplicitlyConvertible&lt;T&amp;, type&gt; &amp;&amp; Convertible&lt;T&amp;&amp;, type&gt;</del><ins>SameType&lt;T&amp;, type&amp;&gt;</ins>;
  }
--- 31398,31405 ----
  In X [concept.transform] before p. 4 change as indicated:
  </p>
  
! <blockquote><pre>
! auto concept RvalueOf&lt;typename T&gt; {
    <del>typename</del><ins>RvalueReference</ins> type = T&amp;&amp;;
    requires <del>ExplicitlyConvertible&lt;T&amp;, type&gt; &amp;&amp; Convertible&lt;T&amp;&amp;, type&gt;</del><ins>SameType&lt;T&amp;, type&amp;&gt;</ins>;
  }
*************** In X [concept.transform] before p. 4 cha
*** 39684,39692 ****
  
  <hr>
  <h3><a name="1125"></a>1125. ostream_iterator does not work with movable types</h3>
! <p><b>Section:</b> 24.6.2.2 [ostream.iterator.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>ostream_iterator</tt> has not been updated to support moveable types, in a
--- 31411,31419 ----
  
  <hr>
  <h3><a name="1125"></a>1125. ostream_iterator does not work with movable types</h3>
! <p><b>Section:</b> 24.6.2.2 [ostream.iterator.ops] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>ostream_iterator</tt> has not been updated to support moveable types, in a
*************** restricted to dealing with do not suppor
*** 39700,39709 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively NAD after 5 positive votes on c++std-lib.  Rationale
  added below.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 31427,31436 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively NAD after 5 positive votes on c++std-lib.  Rationale
  added below.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Add second <tt>operator=</tt> overload t
*** 39712,39718 ****
  in 24.6.2 [ostream.iterator], para 2:
  </p>
  
! <blockquote><pre>ostream_iterator&lt;T,charT,traits&gt;&amp; operator=(const T&amp; value);
  <ins>ostream_iterator&lt;T,charT,traits&gt;&amp; operator=(T&amp;&amp; value);</ins>
  </pre></blockquote>
  
--- 31439,31446 ----
  in 24.6.2 [ostream.iterator], para 2:
  </p>
  
! <blockquote><pre>
! ostream_iterator&lt;T,charT,traits&gt;&amp; operator=(const T&amp; value);
  <ins>ostream_iterator&lt;T,charT,traits&gt;&amp; operator=(T&amp;&amp; value);</ins>
  </pre></blockquote>
  
*************** Add a new paragraph: in 24.6.2.2 [ostrea
*** 39721,39733 ****
  </p>
  
  <blockquote>
! <pre>ostream_iterator&amp; operator=(T&amp;&amp; value);
  </pre>
  <blockquote>
  <p>
  -2- <i>Effects:</i>
  </p>
! <blockquote><pre>*out_stream &lt;&lt; std::move(value);
  if(delim != 0)
    *out_stream &lt;&lt; delim;
  return (*this);
--- 31449,31463 ----
  </p>
  
  <blockquote>
! <pre>
! ostream_iterator&amp; operator=(T&amp;&amp; value);
  </pre>
  <blockquote>
  <p>
  -2- <i>Effects:</i>
  </p>
! <blockquote><pre>
! *out_stream &lt;&lt; std::move(value);
  if(delim != 0)
    *out_stream &lt;&lt; delim;
  return (*this);
*************** lvalues.
*** 39751,39767 ****
  
  <hr>
  <h3><a name="1127"></a>1127. rvalue references and iterator traits</h3>
! <p><b>Section:</b> 24.4.1 [iterator.traits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.traits">issues</a> in [iterator.traits].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The deprecated support for <tt>iterator_traits</tt> and legacy (unconstrained)
  iterators features the (exposition only) concept:
  </p>
  
! <blockquote><pre>concept IsReference&lt;typename T&gt; { } // exposition only
  template&lt;typename T&gt; concept_map IsReference&lt;T&amp;&gt; { }
  </pre></blockquote>
  <p>
--- 31481,31498 ----
  
  <hr>
  <h3><a name="1127"></a>1127. rvalue references and iterator traits</h3>
! <p><b>Section:</b> 24.4.1 [iterator.traits] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.traits">issues</a> in [iterator.traits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The deprecated support for <tt>iterator_traits</tt> and legacy (unconstrained)
  iterators features the (exposition only) concept:
  </p>
  
! <blockquote><pre>
! concept IsReference&lt;typename T&gt; { } // exposition only
  template&lt;typename T&gt; concept_map IsReference&lt;T&amp;&gt; { }
  </pre></blockquote>
  <p>
*************** fuller investigation of type_trait/conce
*** 39785,39791 ****
  In Iterator traits 24.4.1 [iterator.traits] para 4 add:
  </p>
  
! <blockquote><pre>concept IsReference&lt;typename T&gt; { } // exposition only
  template&lt;typename T&gt; concept_map IsReference&lt;T&amp;&gt; { }
  <ins>template&lt;typename T&gt; concept_map IsReference&lt;T&amp;&amp;&gt; { }</ins>
  </pre></blockquote>
--- 31516,31523 ----
  In Iterator traits 24.4.1 [iterator.traits] para 4 add:
  </p>
  
! <blockquote><pre>
! concept IsReference&lt;typename T&gt; { } // exposition only
  template&lt;typename T&gt; concept_map IsReference&lt;T&amp;&gt; { }
  <ins>template&lt;typename T&gt; concept_map IsReference&lt;T&amp;&amp;&gt; { }</ins>
  </pre></blockquote>
*************** template&lt;typename T&gt; concept_map I
*** 39797,39805 ****
  
  <hr>
  <h3><a name="1128"></a>1128. Missing definition of <tt>iterator_traits&lt;T*&gt;</tt></h3>
! <p><b>Section:</b> X [iterator.syn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>&lt;iterator&gt;</tt> header synopsis declares a partial specialization of
--- 31529,31537 ----
  
  <hr>
  <h3><a name="1128"></a>1128. Missing definition of <tt>iterator_traits&lt;T*&gt;</tt></h3>
! <p><b>Section:</b> X [iterator.syn] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>&lt;iterator&gt;</tt> header synopsis declares a partial specialization of
*************** template will be present - just not in t
*** 39818,39824 ****
  I can see two obvious solutions:
  </p>
  
! <ol type="i">
  <li>
  Restore the <tt>iterator_traits&lt;T*&gt;</tt> partial specialization in D.10
  </li>
--- 31550,31556 ----
  I can see two obvious solutions:
  </p>
  
! <ol style="list-style-type:lower-roman">
  <li>
  Restore the <tt>iterator_traits&lt;T*&gt;</tt> partial specialization in D.10
  </li>
*************** standards.  This is probably a matter be
*** 39842,40028 ****
  In X [iterator.syn] strike:
  </p>
  
! <blockquote><pre><del>template&lt;class T&gt; struct iterator_traits&lt;T*&gt;;</del>
! </pre></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1129"></a>1129. <tt>istream(buf)_iterator</tt> should support literal sentinel value</h3>
! <p><b>Section:</b> 24.6.1.1 [istream.iterator.cons], 24.6.3 [istreambuf.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-30 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.iterator.cons">issues</a> in [istream.iterator.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>istream_iterator</tt> and <tt>istreambuf_iterator</tt> should support literal sentinel
! values.  The default constructor is frequently used to terminate ranges, and
! could easily be a literal value for <tt>istreambuf_iterator</tt>, and
! <tt>istream_iterator</tt> when iterating value types.  A little more work using a
! suitably sized/aligned char-array for storage (or an updated component like
! <tt>boost::optional</tt> proposed for TR2) would allow <tt>istream_iterator</tt> to support
! <tt>constexpr</tt> default constructor in all cases, although we might leave this
! tweak as a QoI issue.  Note that requiring <tt>constexpr</tt> be supported also
! allows us to place no-throw guarantees on this constructor too.
! </p>
! 
! <p><i>[
! 2009-06-02 Daniel adds:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! I agree with the usefulness of the issue suggestion, but we need
! to ensure that <tt>istream_iterator</tt> <em>can</em> satisfy be literal if needed.
! Currently this is not clear, because 24.6.1 [istream.iterator]/3 declares
! a copy constructor and a destructor and explains their semantic in
! 24.6.1.1 [istream.iterator.cons]/3+4.
! </p>
! <p>
! The prototype semantic specification is ok (although it seems
! somewhat redundant to me, because the semantic doesn't say
! anything interesting in both cases), but for support of trivial class
! types we also need a trivial copy constructor and destructor as of
! 9 [class]/6. The current non-informative specification of these
! two special members suggests to remove their explicit declaration
! in the class and add explicit wording that says that if <tt>T</tt> is
! trivial a default constructed iterator is also literal, alternatively it
! would be possible to mark both as defaulted and add explicit
! (memberwise) wording that guarantees that they are trivial.
! </p>
! <p>
! Btw.: I'm quite sure that the <tt>istreambuf_iterator</tt> additions to
! ensure triviality are not sufficient as suggested, because the
! library does not yet give general guarantees that a defaulted
! special member declaration makes this member also trivial.
! Note that e.g. the atomic types do give a general statement!
! </p>
! <p>
! Finally there is a wording issue: There does not exist something
! like a "literal constructor". The core language uses the term
! "constexpr constructor" for this.
! </p>
! <p>
! Suggestion:
! </p>
! <ol>
! <li>
! <p>
! Change 24.6.1 [istream.iterator]/3 as indicated:
! </p>
! <blockquote><pre><ins>constexpr</ins> istream_iterator();
! istream_iterator(istream_type&amp; s);
! istream_iterator(const istream_iterator<del>&lt;T,charT,traits,Distance&gt;</del>&amp; x)<ins> = default</ins>;
! ~istream_iterator()<ins> = default</ins>;
! </pre></blockquote>
! </li>
! <li>
! <p>
! Change 24.6.1.1 [istream.iterator.cons]/1 as indicated:
! </p>
! <blockquote><pre><ins>constexpr</ins> istream_iterator();
! </pre>
! <blockquote>
! -1- <i>Effects:</i> Constructs the end-of-stream iterator. <ins>If <tt>T</tt> is a literal type,
! then this constructor shall be a constexpr constructor.</ins>
! </blockquote>
! </blockquote>
! </li>
! <li>
! <p>
! Change 24.6.1.1 [istream.iterator.cons]/3 as indicated:
! </p>
! <blockquote><pre>istream_iterator(const istream_iterator<del>&lt;T,charT,traits,Distance&gt;</del>&amp; x)<ins> = default</ins>;
! </pre>
! <blockquote>
! -3- <i>Effects:</i> Constructs a copy of <tt>x</tt>. <ins>If <tt>T</tt> is a literal type, then
! this constructor shall be a trivial copy constructor.</ins>
! </blockquote>
! </blockquote>
! </li>
! <li>
! <p>
! Change 24.6.1.1 [istream.iterator.cons]/4 as indicated:
! </p>
! 
! <blockquote><pre>~istream_iterator()<ins> = default</ins>;
! </pre>
! <blockquote>
! -4- <i>Effects:</i> The iterator is destroyed. <ins>If <tt>T</tt> is a literal type, then
! this destructor shall be a trivial
! destructor.</ins>
! </blockquote>
! </blockquote>
! </li>
! <li>
! <p>
! Change 24.6.3 [istreambuf.iterator] before p. 1 as indicated:
! </p>
! 
! <blockquote><pre><ins>constexpr</ins> istreambuf_iterator() throw();
! <ins>istreambuf_iterator(const istreambuf_iterator&amp;)  throw() = default;</ins>
! <ins>~istreambuf_iterator()  throw() = default;</ins>
! </pre></blockquote>
! </li>
! <li>
! <p>
! Change 24.6.3 [istreambuf.iterator]/1 as indicated:
! </p>
! <blockquote>
! [..] The default constructor <tt>istreambuf_iterator()</tt> and the constructor
! <tt>istreambuf_iterator(0)</tt> both
! construct an end of stream iterator object suitable for use as an
! end-of-range. <ins>All
! specializations of <tt>istreambuf_iterator</tt> shall have a trivial copy
! constructor, a constexpr default
! constructor and a trivial destructor.</ins>
! </blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.html">N2994</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! 24.6.1 [istream.iterator] para 3
! </p>
! 
! <blockquote><pre><ins>constexpr</ins> istream_iterator();
! </pre></blockquote>
! 
! <p>
! 24.6.1.1 [istream.iterator.cons]
! </p>
! 
! <blockquote><pre><ins>constexpr</ins> istream_iterator();
! </pre>
! <blockquote>
! -1- <i>Effects:</i> Constructs the end-of-stream iterator.
! <ins>If <tt>T</tt> is a literal type, then this constructor shall
! be a literal constructor.</ins>
! </blockquote>
! </blockquote>
! 
! <p>
! 24.6.3 [istreambuf.iterator]
! </p>
! 
! <blockquote><pre><ins>constexpr</ins> istreambuf_iterator() throw();
  </pre></blockquote>
  
  
--- 31574,31581 ----
  In X [iterator.syn] strike:
  </p>
  
! <blockquote><pre>
! <del>template&lt;class T&gt; struct iterator_traits&lt;T*&gt;;</del>
  </pre></blockquote>
  
  
*************** be a literal constructor.</ins>
*** 40032,40041 ****
  
  <hr>
  <h3><a name="1132"></a>1132. JP-30: nested exceptions</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Seiji Hayashida <b>Opened:</b> 2009-06-01 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP 30</b></p>
  
--- 31585,31595 ----
  
  <hr>
  <h3><a name="1132"></a>1132. JP-30: nested exceptions</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Seiji Hayashida <b>Opened:</b> 2009-06-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#except.nested">active issues</a> in [except.nested].</p>
! <p><b>View all other</b> <a href="lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP 30</b></p>
  
*************** List A (code of tree structured exceptio
*** 40058,40064 ****
  in C++0x)
  </p>
  
! <blockquote><pre>void A()
  {
      try
      {
--- 31612,31619 ----
  in C++0x)
  </p>
  
! <blockquote><pre>
! void A()
  {
      try
      {
*************** List B ( code of tree structured excepti
*** 40141,40147 ****
  <a href="http://tricklib.com/cxx/dagger/trickerr.h">http://tricklib.com/cxx/dagger/trickerr.h</a>.
  </p>
  
! <blockquote><pre>void A()
  {
      tricklib::error_listener_type error_listener;
      // A_a() is like A(). A_a() can throw tree structured exception.
--- 31696,31703 ----
  <a href="http://tricklib.com/cxx/dagger/trickerr.h">http://tricklib.com/cxx/dagger/trickerr.h</a>.
  </p>
  
! <blockquote><pre>
! void A()
  {
      tricklib::error_listener_type error_listener;
      // A_a() is like A(). A_a() can throw tree structured exception.
*************** This text is based on the web page below
*** 40230,40240 ****
  ]</i></p>
  
  
! <blockquote>
! Mark as NAD. The committee agrees that nested_exception is not a good
  match for this usage model. The committee did not see a way of improving
  this within the timeframe allowed.
! </blockquote>
  
  
  
--- 31786,31796 ----
  ]</i></p>
  
  
! <blockquote><p>
! Mark as NAD. The committee agrees that <tt>nested_exception</tt> is not a good
  match for this usage model. The committee did not see a way of improving
  this within the timeframe allowed.
! </p></blockquote>
  
  
  
*************** this within the timeframe allowed.
*** 40248,40257 ****
  
  <hr>
  <h3><a name="1139"></a>1139. Thread support library not concept enabled</h3>
! <p><b>Section:</b> 30 [thread] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread">issues</a> in [thread].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 93, JP 79, UK 333, JP 81</b></p>
--- 31804,31813 ----
  
  <hr>
  <h3><a name="1139"></a>1139. Thread support library not concept enabled</h3>
! <p><b>Section:</b> 30 [thread] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread">issues</a> in [thread].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 93, JP 79, UK 333, JP 81</b></p>
*************** The thread chapter is not concept enable
*** 40270,40279 ****
  
  <hr>
  <h3><a name="1140"></a>1140. Numerics library not concept enabled</h3>
! <p><b>Section:</b> 26 [numerics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numerics">issues</a> in [numerics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 84</b></p>
--- 31826,31835 ----
  
  <hr>
  <h3><a name="1140"></a>1140. Numerics library not concept enabled</h3>
! <p><b>Section:</b> 26 [numerics] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numerics">issues</a> in [numerics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 84</b></p>
*************** which was accepted in Summit.
*** 40298,40307 ****
  
  <hr>
  <h3><a name="1141"></a>1141. Input/Output library not concept enabled</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 85, JP 67, JP 68, JP 69, JP 72, UK 308</b></p>
--- 31854,31863 ----
  
  <hr>
  <h3><a name="1141"></a>1141. Input/Output library not concept enabled</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 85, JP 67, JP 68, JP 69, JP 72, UK 308</b></p>
*************** The input/output chapter is not concept
*** 40320,40329 ****
  
  <hr>
  <h3><a name="1142"></a>1142. Regular expressions library not concept enabled</h3>
! <p><b>Section:</b> 28 [re] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re">issues</a> in [re].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 86, UK 309, UK 310</b></p>
--- 31876,31886 ----
  
  <hr>
  <h3><a name="1142"></a>1142. Regular expressions library not concept enabled</h3>
! <p><b>Section:</b> 28 [re] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re">active issues</a> in [re].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re">issues</a> in [re].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 86, UK 309, UK 310</b></p>
*************** The regular expressions chapter is not c
*** 40341,40823 ****
  
  
  <hr>
- <h3><a name="1143"></a>1143. Atomic operations library not concept enabled</h3>
- <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses US 87, UK 311</b></p>
- 
- <p>
- The atomics chapter is not concept enabled.
- </p>
- 
- <p>
- Needs to also consider issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>.
- </p>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1145"></a>1145. inappropriate headers for atomics</h3>
- <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-16 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses UK 312</b></p>
- 
- <p>
- The contents of the <tt>&lt;stdatomic.h&gt;</tt> header are not listed anywhere,
- and <tt>&lt;cstdatomic&gt;</tt> is listed as a C99 header in chapter 17.
- If we intend to use these for compatibility with a future C standard,
- we should not use them now.
- </p>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Remove <tt>&lt;cstdatomic&gt;</tt> from the C99 headers in table 14.
- Add a new header <tt>&lt;atomic&gt;</tt> to the headers in table 13.
- Update chapter 29 to remove reference to <tt>&lt;stdatomic.h&gt;</tt>
- and replace the use of <tt>&lt;cstdatomic&gt;</tt> with <tt>&lt;atomic&gt;</tt>.
- </p>
- <p><i>[
- If and when WG14 adds atomic operations to C
- we can add corresponding headers to table 14 with a TR.
- ]</i></p>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1146"></a>1146. "lockfree" does not say enough</h3>
- <p><b>Section:</b> 29.4 [atomics.lockfree] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-06-16 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.lockfree">issues</a> in [atomics.lockfree].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses US 88</b></p>
- 
- <p>
- The "lockfree" facilities do not tell the programmer enough.
- </p>
- 
- <p>
- There are 2 problems here.
- First, at least on x86,
- it's less important to me whether some integral types are lock free
- than what is the largest type I can pass to atomic and have it be lock-free.
- For example, if <tt>long long</tt>s are not lock-free,
- <tt>ATOMIC_INTEGRAL_LOCK_FREE</tt> is probably 1,
- but I'd still be interested in knowing whether longs are always lock-free.
- Or if long longs at any address are lock-free,
- I'd expect <tt>ATOMIC_INTEGRAL_LOCK_FREE</tt> to be 2,
- but I may actually care whether I have access to
- the <code>cmpxchg16b</code> instruction.
- None of the support here helps with that question.
- (There are really 2 related questions here:
- what alignment requirements are there for lock-free access;
- and what processor is the program actually running on,
- as opposed to what it was compiled for?)
- </p>
- 
- <p>
- Second, having <tt>atomic_is_lock_free</tt> only apply to individual objects
- is pretty useless
- (except, as Lawrence Crowl points out,
- for throwing an exception when an object is unexpectedly not lock-free).
- I'm likely to want to use its result to decide what algorithm to use,
- and that algorithm is probably going to allocate new memory
- containing atomic objects and then try to act on them.
- If I can't predict the lock-freedom of the new object
- by checking the lock-freedom of an existing object,
- I may discover after starting the algorithm that I can't continue.
- </p>
- 
- <p><i>[
- 2009-06-16 Jeffrey Yasskin adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- To solve the first problem, I think 2 macros would help:
- <tt>MAX_POSSIBLE_LOCK_FREE_SIZE</tt> and <tt>MAX_GUARANTEED_LOCK_FREE_SIZE</tt>,
- which expand to the maximum value of <tt>sizeof(T)</tt> for which atomic may
- (or will, respectively) use lock-free operations.
- Lawrence points out that this
- "relies heavily on implementations
- using word-size compare-swap on sub-word-size types,
- which in turn requires address modulation."
- He expects that to be the end state anyway, so it doesn't bother him much.
- </p>
- 
- <p>
- To solve the second,
- I think one could specify that equally aligned objects of the same type
- will return the same value from <tt>atomic_is_lock_free()</tt>.
- I don't know how to specify "equal alignment".
- Lawrence suggests an additional function, <tt>atomic_is_always_lock_free()</tt>.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-10-22 Benjamin Kosnik:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- In the evolution discussion of N2925, "More Collected Issues with
- Atomics," there is an action item with respect to
- LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1146">1146</a>, US 88
- </p>
- 
- <p>
- This is stated in the paper as:
- </p>
- <p>
- Relatedly, Mike Sperts will create an issue to propose adding a traits
- mechanism to check the compile-time properties through a template
- mechanism rather than macros
- </p>
- 
- <p>
- Here is my attempt to do this. I don't believe that a separate trait is
- necessary for this, and that instead <tt>atomic_integral::is_lock_free</tt> can
- be re-purposed with minimal work as follows.
- </p>
- 
- <p><i>[
- Howard: Put Benjamin's wording in the proposed wording section.
- ]</i></p>
- 
- 
- </blockquote>
- 
- <p><i>[
- 2009-10-22 Alberto Ganesh Barbati:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Just a thought... wouldn't it be better to use a scoped enum instead of
- plain integers? For example:
- </p>
- 
- <blockquote><pre>enum class is_lock_free
- {
-     never = 0, sometimes = 1, always = 2;
- };
- </pre></blockquote>
- 
- <p>
- if compatibility with C is deemed important, we could use an unscoped
- enum with suitably chosen names.  It would still be more descriptive
- than 0, 1 and 2.
- </p>
- 
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Header <tt>&lt;cstdatomic&gt;</tt> synopsis  [atomics.synopsis]
- </p>
- 
- <p>
- Edit  as follows:
- </p>
- 
- <blockquote><pre>namespace std {
- ...
- // 29.4, lock-free property
- <del>#define ATOMIC_INTEGRAL_LOCK_FREE unspecified</del>
- <ins>#define ATOMIC_CHAR_LOCK_FREE unspecified
- #define ATOMIC_CHAR16_T_LOCK_FREE unspecified
- #define ATOMIC_CHAR32_T_LOCK_FREE unspecified
- #define ATOMIC_WCHAR_T_LOCK_FREE unspecified
- #define ATOMIC_SHORT_LOCK_FREE unspecified
- #define ATOMIC_INT_LOCK_FREE unspecified
- #define ATOMIC_LONG_LOCK_FREE unspecified
- #define ATOMIC_LLONG_LOCK_FREE unspecified</ins>
- #define ATOMIC_ADDRESS_LOCK_FREE unspecified
- </pre></blockquote>
- 
- <p>
- Lock-free Property 29.4 [atomics.lockfree]
- </p>
- 
- <p>
- Edit the synopsis as follows.
- </p>
- 
- <blockquote><pre>namespace std {
-    <del>#define ATOMIC_INTEGRAL_LOCK_FREE unspecified</del>
-    <ins>#define ATOMIC_CHAR_LOCK_FREE unspecified
-    #define ATOMIC_CHAR16_T_LOCK_FREE unspecified
-    #define ATOMIC_CHAR32_T_LOCK_FREE unspecified
-    #define ATOMIC_WCHAR_T_LOCK_FREE unspecified
-    #define ATOMIC_SHORT_LOCK_FREE unspecified
-    #define ATOMIC_INT_LOCK_FREE unspecified
-    #define ATOMIC_LONG_LOCK_FREE unspecified
-    #define ATOMIC_LLONG_LOCK_FREE unspecified</ins>
-    #define ATOMIC_ADDRESS_LOCK_FREE unspecified
- }
- </pre></blockquote>
- 
- <p>
- Edit paragraph 1 as follows.
- </p>
- 
- <blockquote>
- The <ins>ATOMIC_...._LOCK_FREE</ins> macros <del>ATOMIC_INTEGRAL_LOCK_FREE and ATOMIC_ADDRESS_LOCK_FREE</del> indicate the general lock-free
- property of <del>integral and address atomic</del> <ins>the corresponding atomic integral</ins> types<ins>, with the
- signed and unsigned variants grouped together</ins>.
- <del>The properties also apply to the corresponding specializations of the atomic template.</del>
- A value of 0
- indicates that the types are never lock-free. A value of 1
- indicates that the types are sometimes lock-free. A value of 2
- indicates that the types are always lock-free.
- </blockquote>
- 
- <p>
- Operations on Atomic Types 29.6 [atomics.types.operations]
- </p>
- 
- <p>
- Edit as follows.
- </p>
- 
- <blockquote><pre><del>void</del> <ins>static constexpr bool</ins> A::is_lock_free() const volatile;
- </pre>
- <blockquote>
- <i>Returns:</i> True if the <del>object's</del> <ins>types's</ins> operations are lock-free, false
- otherwise.
- <ins>
- [<i>Note:</i> In the same way that <tt>&lt;limits&gt;</tt>
- <tt>std::numeric_limits&lt;short&gt;::max()</tt> is related to
- <tt>&lt;limits.h&gt;</tt> <tt>__LONG_LONG_MAX__</tt>, <tt>&lt;atomic&gt;
- std::atomic_short::is_lock_free</tt> is related to
- <tt>&lt;stdatomic.h&gt;</tt> and <tt>ATOMIC_SHORT_LOCK_FREE</tt> —
- <i>end note</i>]
- </ins>
- </blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1147"></a>1147. non-volatile atomic functions</h3>
- <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-06-16 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses US 90</b></p>
- 
- <p>
- The C++0X draft
- declares all of the functions dealing with atomics (section 29.6 [atomics.types.operations])
- to take volatile arguments.
- Yet it also says (29.4-3),
- </p>
- 
- <blockquote>
- <p>
- [ Note: Many operations are volatile-qualified.
- The "volatile as device register" semantics have not changed in the standard.
- This qualification means that volatility is preserved
- when applying these operations to volatile objects.
- It does not mean that operations on non-volatile objects become volatile.
- Thus, volatile qualified operations on non-volatile objects
- may be merged under some conditions. —end note ]
- </p>
- </blockquote>
- 
- <p>
- I was thinking about how to implement this in gcc,
- and I believe that we'll want to overload most of the functions
- on volatile and non-volatile.
- Here's why:
- </p>
- 
- <p>
- To let the compiler take advantage of the permission
- to merge non-volatile atomic operations and reorder atomics in certain,
- we'll need to tell the compiler backend
- about exactly which atomic operation was used.
- So I expect most of the functions of the form atomic_&lt;op&gt;_explicit()
- (e.g. atomic_load_explicit, atomic_exchange_explicit,
- atomic_fetch_add_explicit, etc.)
- to become compiler builtins.
- A builtin can tell whether its argument was volatile or not,
- so those functions don't really need extra explicit overloads.
- However, I don't expect that we'll want to add builtins
- for every function in chapter 29,
- since most can be implemented in terms of the _explicit free functions:
- </p>
- 
- <pre><code>class atomic_int {
-   __atomic_int_storage value;
-  public:
-   int fetch_add(int increment, memory_order order = memory_order_seq_cst) volatile {
-     // &amp;value has type "volatile __atomic_int_storage*".
-     atomic_fetch_add_explicit(&amp;value, increment, order);
-   }
-   ...
- };
- </code></pre>
- 
- <p>
- But now this <em>always</em> calls
- the volatile builtin version of atomic_fetch_add_explicit(),
- even if the atomic_int wasn't declared volatile.
- To preserve volatility and the compiler's permission to optimize,
- I'd need to write:
- </p>
- 
- <pre><code>class atomic_int {
-   __atomic_int_storage value;
-  public:
-   int fetch_add(int increment, memory_order order = memory_order_seq_cst) volatile {
-     atomic_fetch_add_explicit(&amp;value, increment, order);
-   }
-   int fetch_add(int increment, memory_order order = memory_order_seq_cst) {
-     atomic_fetch_add_explicit(&amp;value, increment, order);
-   }
-   ...
- };
- </code></pre>
- 
- <p>
- But this is visibly different from the declarations in the standard
- because it's now overloaded.
- (Consider passing &amp;atomic_int::fetch_add as a template parameter.)
- </p>
- 
- <p>
- The implementation may already have permission to add overloads
- to the member functions:
- </p>
- 
- <blockquote>
- <p>
- 17.6.4.5 [member.functions] An implementation may declare additional non-virtual
- member function signatures within a class:<br>
- ...
- </p>
- <ul>
- <li>by adding a member function signature for a member function name.</li>
- </ul>
- </blockquote>
- 
- <p>
- but I don't see an equivalent permission to add overloads to the free functions.
- </p>
- 
- <p><i>[
- 2009-06-16 Lawrence adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- I recommend allowing non-volatile overloads.
- </p>
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.html">N2992</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1148"></a>1148. Wrong argument type of I/O stream manipulators <tt>setprecision()</tt>
  and <tt>setw()</tt></h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Marc Steinbach <b>Opened:</b> 2009-06-20 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The header <tt>&lt;iomanip&gt;</tt> synopsis in 27.7 [iostream.format] specifies
  </p>
! <blockquote><pre>T5 setprecision(int n);
  T6 setw(int n);
  </pre></blockquote>
  
  <p>
  The argument types should be streamsize, as in class <tt>ios_base</tt>
! (see 27.5.2 [ios.base]):
  </p>
! <blockquote><pre>streamsize precision() const;
  streamsize precision(streamsize prec);
  streamsize width() const;
  streamsize width(streamsize wide);
--- 31898,31924 ----
  
  
  <hr>
  <h3><a name="1148"></a>1148. Wrong argument type of I/O stream manipulators <tt>setprecision()</tt>
  and <tt>setw()</tt></h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Marc Steinbach <b>Opened:</b> 2009-06-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The header <tt>&lt;iomanip&gt;</tt> synopsis in 27.7 [iostream.format] specifies
  </p>
! <blockquote><pre>
! T5 setprecision(int n);
  T6 setw(int n);
  </pre></blockquote>
  
  <p>
  The argument types should be streamsize, as in class <tt>ios_base</tt>
! (see 27.5.3 [ios.base]):
  </p>
! <blockquote><pre>
! streamsize precision() const;
  streamsize precision(streamsize prec);
  streamsize width() const;
  streamsize width(streamsize wide);
*************** But ultimately there was no concensus fo
*** 40854,40879 ****
  In 27.7 [iostream.format], header <tt>&lt;iomanip&gt;</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>T5 setprecision(<del>int</del><ins>streamsize</ins> n);
  T6 setw(<del>int</del><ins>streamsize</ins> n);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! In 27.7.3 [std.manip], just before p. 6 change as indicated:
  </p>
  
! <blockquote><pre>unspecified setprecision(<del>int</del><ins>streamsize</ins> n);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! In 27.7.3 [std.manip], just before p. 7 change as indicated:
  </p>
  
! <blockquote><pre>unspecified setw(<del>int</del><ins>streamsize</ins> n);
  </pre></blockquote>
  </li>
  </ol>
--- 31955,31983 ----
  In 27.7 [iostream.format], header <tt>&lt;iomanip&gt;</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>
! T5 setprecision(<del>int</del><ins>streamsize</ins> n);
  T6 setw(<del>int</del><ins>streamsize</ins> n);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! In 27.7.4 [std.manip], just before p. 6 change as indicated:
  </p>
  
! <blockquote><pre>
! unspecified setprecision(<del>int</del><ins>streamsize</ins> n);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! In 27.7.4 [std.manip], just before p. 7 change as indicated:
  </p>
  
! <blockquote><pre>
! unspecified setw(<del>int</del><ins>streamsize</ins> n);
  </pre></blockquote>
  </li>
  </ol>
*************** In 27.7.3 [std.manip], just before p. 7
*** 40887,40900 ****
  
  <hr>
  <h3><a name="1149"></a>1149. Reformulating NonemptyRange axiom</h3>
! <p><b>Section:</b> X [rand.concept.urng] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2009-06-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In X [rand.concept.urng], we have the following:
  </p>
! <blockquote><pre>concept UniformRandomNumberGenerator&lt;typename G&gt; : Callable&lt;G&gt; {
    ...
    axiom NonemptyRange(G&amp; g) {
      G::min() &lt; G::max();
--- 31991,32005 ----
  
  <hr>
  <h3><a name="1149"></a>1149. Reformulating NonemptyRange axiom</h3>
! <p><b>Section:</b> X [rand.concept.urng] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2009-06-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In X [rand.concept.urng], we have the following:
  </p>
! <blockquote><pre>
! concept UniformRandomNumberGenerator&lt;typename G&gt; : Callable&lt;G&gt; {
    ...
    axiom NonemptyRange(G&amp; g) {
      G::min() &lt; G::max();
*************** need for the axiom to be further paramet
*** 40909,40915 ****
  slightly simplified as:
  </p>
  
! <blockquote><pre>axiom NonemptyRange()  {
    G::min() &lt; G::max();
  }
  </pre></blockquote>
--- 32014,32021 ----
  slightly simplified as:
  </p>
  
! <blockquote><pre>
! axiom NonemptyRange()  {
    G::min() &lt; G::max();
  }
  </pre></blockquote>
*************** slightly simplified as:
*** 40918,40924 ****
  We can further reformulate so as to avoid any axiom machinery as:
  </p>
  
! <blockquote><pre>requires True&lt; G::min() &lt; G::max() &gt;;
  </pre></blockquote>
  
  <p>
--- 32024,32031 ----
  We can further reformulate so as to avoid any axiom machinery as:
  </p>
  
! <blockquote><pre>
! requires True&lt; G::min() &lt; G::max() &gt;;
  </pre></blockquote>
  
  <p>
*************** Post-Rapperswil:
*** 40931,40939 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 32038,32046 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Moved to Tentatively Ready after 5 posit
*** 40941,40947 ****
  In X [rand.concept.urng], replace the <tt>NonemptyRange</tt> axiom by:
  </p>
  
! <blockquote><pre><del>axiom NonemptyRange(G&amp; g) { 
     G::min() &lt; G::max(); 
  }</del>
  <ins>requires True&lt; G::min() &lt; G::max() &gt;;</ins>
--- 32048,32055 ----
  In X [rand.concept.urng], replace the <tt>NonemptyRange</tt> axiom by:
  </p>
  
! <blockquote><pre>
! <del>axiom NonemptyRange(G&amp; g) { 
     G::min() &lt; G::max(); 
  }</del>
  <ins>requires True&lt; G::min() &lt; G::max() &gt;;</ins>
*************** In X [rand.concept.urng], replace the <t
*** 40953,41015 ****
  
  
  <hr>
- <h3><a name="1150"></a>1150. wchar_t, char16_t and char32_t filenames</h3>
- <p><b>Section:</b> 27.9.1.14 [fstream] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p><b>Addresses JP 73</b></p>
- 
-    <p><b>Description</b></p>
-         <p>It is a problem
-         from C++98, <tt>fstream</tt> cannot appoint a filename of wide
-         character string(<tt>const wchar_t</tt> and <tt>const wstring&amp;</tt>).</p>
- <p><b>Suggestion</b></p>
-         <p>Add
-         interface corresponding to <tt>wchar_t</tt>, <tt>char16_t</tt> and <tt>char32_t</tt>.</p>
- 
- <p><i>[
- 2009-07-01 Alisdair notes that this is a duplicate of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#454">454</a> which has more
- in-depth rationale.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-09-21 Daniel adds:
- ]</i></p>
- 
- 
- <blockquote>
- I suggest to mark this issue as NAD Future with the intend to
- solve the issue with a single file path c'tor template assuming
- a provision of a TR2 filesystem library.
- </blockquote>
- 
- <p><i>[
- 2009 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Future.  This is a duplicate of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#454">454</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1153"></a>1153. Standard library needs review for constructors to be
  explicit to avoid treatment as initializer-list constructor</h3>
! <p><b>Section:</b> 17 [library], 30 [thread], D [depr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses DE 2</b></p>
--- 32061,32073 ----
  
  
  <hr>
  <h3><a name="1153"></a>1153. Standard library needs review for constructors to be
  explicit to avoid treatment as initializer-list constructor</h3>
! <p><b>Section:</b> 17 [library], 30 [thread], D [depr] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses DE 2</b></p>
*************** explicit to avoid treatment as initializ
*** 41035,41043 ****
  ]</i></p>
  
  
! <blockquote>
  Move to "Open". Robert Klarer has promised to provide wording.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD, rationale added below.
--- 32093,32101 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to "Open". Robert Klarer has promised to provide wording.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD, rationale added below.
*************** context, but if problems arise in the fu
*** 41060,41119 ****
  
  
  <hr>
- <h3><a name="1154"></a>1154. <tt>complex</tt> should accept integral types</h3>
- <p><b>Section:</b> 26.4 [complex.numbers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.numbers">issues</a> in [complex.numbers].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses FR 35</b></p>
- 
- <p><b>Description</b></p>
-         <p>Instantiations of the class
-         template <tt>complex&lt;&gt;</tt> have to be allowed for integral
-         types, to reflect existing practice and ISO standards
-         (LIA-III).</p>
-         
- <p><b>Suggestion</b></p>
- 
- <p><i>[
- 2009-10-26 Proposed wording in
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3002.pdf">N3002</a>.
- ]</i></p>
- 
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to NAD Future.  Rationale added.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- There is no consensus for making this change at this time.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- Adopt
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3002.pdf">N3002</a>.
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1155"></a>1155. Reference should be to C99</h3>
! <p><b>Section:</b> C.2 [diff.library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#diff.library">issues</a> in [diff.library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses FR 38</b></p>
--- 32118,32128 ----
  
  
  <hr>
  <h3><a name="1155"></a>1155. Reference should be to C99</h3>
! <p><b>Section:</b> C.5 [diff.library] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#diff.library">issues</a> in [diff.library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses FR 38</b></p>
*************** Adopt
*** 41139,41147 ****
  ]</i></p>
  
  
! <blockquote>
  NAD Editorial. Already fixed.
! </blockquote>
  
  
  
--- 32148,32156 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD Editorial. Already fixed.
! </p></blockquote>
  
  
  
*************** NAD Editorial. Already fixed.
*** 41153,41161 ****
  
  <hr>
  <h3><a name="1156"></a>1156. Constraints on bitmask and enumeration types to be tightened</h3>
! <p><b>Section:</b> 17.5.2.1.2 [enumerated.types], 17.5.2.1.3 [bitmask.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 165</b></p>
--- 32162,32170 ----
  
  <hr>
  <h3><a name="1156"></a>1156. Constraints on bitmask and enumeration types to be tightened</h3>
! <p><b>Section:</b> 17.5.2.1.2 [enumerated.types], 17.5.2.1.3 [bitmask.types] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 165</b></p>
*************** NAD Editorial. Already fixed.
*** 41179,41197 ****
  ]</i></p>
  
  
! <blockquote>
! Move to Open. Ping Robert Klarer to provide wording, using N2235 as
! guidance.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD.  Rationale added.
! </blockquote>
  
  
  
--- 32188,32205 ----
  ]</i></p>
  
  
! <blockquote><p>
! Move to Open. Ping Robert Klarer to provide wording, using N2235 as guidance.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD.  Rationale added.
! </p></blockquote>
  
  
  
*************** provided in the future, we would be happ
*** 41210,41465 ****
  
  
  <hr>
- <h3><a name="1160"></a>1160. <tt>future_error</tt> public constructor is 'exposition only'</h3>
- <p><b>Section:</b> 30.6.3 [futures.future_error] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses UK 331</b></p>
- 
- <p><b>Description</b></p>
-         <p>Not clear what
-         it means for a public constructor to be 'exposition only'.
-         If the intent is purely to support the library calling this
-         constructor then it can be made private and accessed
-         through friendship. Otherwise it should be documented for
-         public consumption.</p>
- <p><b>Suggestion</b></p>
-         <p>Declare the constructor as private with a
-         note about intended friendship, or remove the
-         exposition-only comment and document the semantics.</p>
- <p><b>Notes</b></p>
- <p>Create an issue. Assigned to Detlef. Suggested resolution probably makes 
-     sense.</p>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- Pending a paper from Anthony Williams / Detleff Volleman.
- </blockquote>
- 
- <p><i>[
- 2009-10-14 Pending paper:
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2967.html">N2967</a>.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.html">N2997</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1161"></a>1161. Unnecessary <tt>unique_future</tt> limitations</h3>
- <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses UK 336</b></p>
- 
- <p><b>Description</b></p>
- 
-         <p>It is possible
-         to transfer ownership of the asynchronous result from one
-         unique_future instance to another via the move-constructor.
-         However, it is not possible to transfer it back, and nor is
-         it possible to create a default-constructed unique_future
-         instance to use as a later move target. This unduly limits
-         the use of <tt>unique_future</tt> in code. Also, the lack of a
-         move-assignment operator restricts the use of <tt>unique_future</tt>
-         in containers such as <tt>std::vector</tt> - <tt>vector::insert</tt> requires
-         move-assignable for example.</p>
- <p><b>Suggestion</b></p>
-         <p>Add a default constructor with the
-         semantics that it creates a <tt>unique_future</tt> with no
-         associated asynchronous result. Add a move-assignment
-         operator which transfers ownership.</p>
- <p><b>Notes</b></p>
- <p>Create an issue. Detlef will look into it.</p>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- Pending a paper from Anthony Williams / Detleff Volleman.
- </blockquote>
- 
- <p><i>[
- 2009-10-14 Pending paper:
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2967.html">N2967</a>.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.html">N2997</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1162"></a>1162. <tt>shared_future</tt> should support an efficient move constructor</h3>
- <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses UK 337</b></p>
- 
- <p><b>Description</b></p>
-         <p><tt>shared_future</tt>
-         should support an efficient move constructor that can avoid
-         unnecessary manipulation of a reference count, much like
-         <tt>shared_ptr</tt></p>
- <p><b>Suggestion</b></p>
-         <p>Add a move constructor</p>
- <p><b>Notes</b></p>
- <p>Create an issue. Detlef will look into it.</p>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- Pending a paper from Anthony Williams / Detleff Volleman.
- </blockquote>
- 
- <p><i>[
- 2009-10-14 Pending paper:
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2967.html">N2967</a>.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.html">N2997</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1163"></a>1163. <tt>shared_future</tt> is inconsistent with <tt>shared_ptr</tt></h3>
- <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p><b>Addresses UK 338</b></p>
- 
- <p><b>Description</b></p>
- 
-         <p><tt>shared_future</tt> is currently
-         CopyConstructible, but not CopyAssignable. This is
-         inconsistent with <tt>shared_ptr</tt>, and will surprise users.
-         Users will then write work-arounds to provide this
-         behaviour. We should provide it simply and efficiently as
-         part of shared_future. Note that since the shared_future
-         member functions for accessing the state are all declared
-         const, the original usage of an immutable shared_future
-         value that can be freely copied by multiple threads can be
-         retained by declaring such an instance as "<tt>const
-         shared_future</tt>".</p>
- <p><b>Suggestion</b></p>
-         <p>Remove "=delete"
-         from the copy-assignment operator of shared_future. Add a
-         move-constructor <tt>shared_future(shared_future&amp;&amp;
-         rhs)</tt>, and a move-assignment operator <tt>shared_future&amp;
-         operator=(shared_future&amp;&amp; rhs)</tt>. The postcondition
-         for the copy-assignment operator is that <tt>*this</tt> has the same
-         associated state as <tt>rhs</tt>. The postcondition for the
-         move-constructor and move assignment is that <tt>*this</tt> has the
-         same associated as <tt>rhs</tt> had before the
-         constructor/assignment call and that <tt>rhs</tt> has no associated
-         state.</p>
- <p><b>Notes</b></p>
- <p>Create an issue. Detlef will look into it.</p>
- 
- <p><i>[
- 2009-07 Frankfurt
- ]</i></p>
- 
- 
- <blockquote>
- Pending a paper from Anthony Williams / Detleff Volleman.
- </blockquote>
- 
- <p><i>[
- 2009-10-14 Pending paper:
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2967.html">N2967</a>.
- ]</i></p>
- 
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Editorial.  Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1164"></a>1164. <tt>promise::swap</tt> should pass by rvalue reference</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 341</b></p>
--- 32218,32229 ----
  
  
  <hr>
  <h3><a name="1164"></a>1164. <tt>promise::swap</tt> should pass by rvalue reference</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 341</b></p>
*************** where those swap functions accept an rva
*** 41480,41597 ****
  ]</i></p>
  
  
! <blockquote>
  NAD, by virtue of the changed rvalue rules and swap signatures from Summit.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1165"></a>1165. Unneeded promise move constructor</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 343</b></p>
! 
! <p><b>Description</b></p>
!         <p>The move constructor of a std::promise
!         object does not need to allocate any memory, so the
!         move-construct-with-allocator overload of the constructor
!         is superfluous.</p>
! <p><b>Suggestion</b></p>
!         <p>Remove the
!         constructor with the signature <tt>template &lt;class
!         Allocator&gt; promise(allocator_arg_t, const Allocator&amp;
!         a, promise&amp; rhs);</tt></p>
! <p><b>Notes</b></p>
! <p>Create an issue. Detlef will look into it. Will solicit feedback from Pablo. 
!     Note that “rhs” argument should also be an rvalue reference in any case.</p>
! 
! <p><i>[
! 2009-07 Frankfurt
! ]</i></p>
! 
! 
! <blockquote>
! Pending a paper from Anthony Williams / Detleff Volleman.
! </blockquote>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.html">N2997</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1166"></a>1166. Allocator-specific move/copy break model of move-constructor and
!         move-assignment</h3>
! <p><b>Section:</b> X [allocator.propagation], X [allocator.propagation.map], 23 [containers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses US 77</b></p>
! 
! <p><b>Description</b></p>
!         <p>Allocator-specific move and copy behavior for containers
!         (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2525.pdf">N2525</a>) complicates a little-used and already-complicated
!         portion of the standard library (allocators), and breaks
!         the conceptual model of move-constructor and
!         move-assignment operations on standard containers being
!         efficient operations. The extensions for allocator-specific
!         move and copy behavior should be removed from the working
!         paper.</p>
!         <p>With the
!         introduction of rvalue references, we are teaching
!         programmers that moving from a standard container (e.g., a
!         <tt>vector&lt;string&gt;</tt>) is an efficient, constant-time
!         operation. The introduction of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2525.pdf">N2525</a> removed that
!         guarantee; depending on the behavior of four different
!         traits (20.8.4), the complexity of copy and move operations
!         can be constant or linear time. This level of customization
!         greatly increases the complexity of standard containers,
!         and benefits only a tiny fraction of the C++ community.</p>
! <p><b>Suggestion</b></p>
! 
!         <p>Remove 20.8.4.</p>
!         
!         <p>Remove 20.8.5.</p>
!         
!         <p>Remove all references to the facilities in
!         20.8.4 and 20.8.5 from clause 23.</p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </blockquote>
  
  
  
--- 32244,32252 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD, by virtue of the changed rvalue rules and swap signatures from Summit.
! </p></blockquote>
  
  
  
*************** NAD Editorial.  Addressed by
*** 41604,41613 ****
  <hr>
  <h3><a name="1167"></a>1167. <tt>pair&lt;T,U&gt;</tt> doesn't model <tt>LessThanComparable</tt> in unconstrained code even if
        <tt>T</tt> and <tt>U</tt> do.</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2009-07-01 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>LessThanComparable</tt> requires (and provides default
--- 32259,32268 ----
  <hr>
  <h3><a name="1167"></a>1167. <tt>pair&lt;T,U&gt;</tt> doesn't model <tt>LessThanComparable</tt> in unconstrained code even if
        <tt>T</tt> and <tt>U</tt> do.</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2009-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>LessThanComparable</tt> requires (and provides default
*************** accept the exported concept maps proposa
*** 41633,41639 ****
  <p>
  e.g., remove from the body of <tt>std::list</tt>
  </p>
! <blockquote><pre>template &lt;LessThanComparable T, class Allocator&gt; 
  bool operator&lt; (const list&lt;T,Allocator&gt;&amp; x, const list&lt;T,Allocator&gt;&amp; y); 
  template &lt;LessThanComparable T, class Allocator&gt; 
  bool operator&gt; (const list&lt;T,Allocator&gt;&amp; x, const list&lt;T,Allocator&gt;&amp; y); 
--- 32288,32295 ----
  <p>
  e.g., remove from the body of <tt>std::list</tt>
  </p>
! <blockquote><pre>
! template &lt;LessThanComparable T, class Allocator&gt; 
  bool operator&lt; (const list&lt;T,Allocator&gt;&amp; x, const list&lt;T,Allocator&gt;&amp; y); 
  template &lt;LessThanComparable T, class Allocator&gt; 
  bool operator&gt; (const list&lt;T,Allocator&gt;&amp; x, const list&lt;T,Allocator&gt;&amp; y); 
*************** bool operator&lt;=(const list&lt;T,Alloc
*** 41645,41651 ****
  <p>
  and add this concept_map afterwards:
  </p>
! <blockquote><pre>template &lt;LessThanComparable T, class Allocator&gt; 
  export concept_map LessThanComparable&lt;list&lt;T,Allocator&gt; &gt;
  {
      bool operator&lt;(const list&lt;T,Allocator&gt;&amp; x, const list&lt;T,Allocator&gt;&amp; y);
--- 32301,32308 ----
  <p>
  and add this concept_map afterwards:
  </p>
! <blockquote><pre>
! template &lt;LessThanComparable T, class Allocator&gt; 
  export concept_map LessThanComparable&lt;list&lt;T,Allocator&gt; &gt;
  {
      bool operator&lt;(const list&lt;T,Allocator&gt;&amp; x, const list&lt;T,Allocator&gt;&amp; y);
*************** Alternative Resolution: keep the ugly, c
*** 41669,41699 ****
  
  <hr>
  <h3><a name="1168"></a>1168. Odd wording for bitset equality operators</h3>
! <p><b>Section:</b> 20.5.2 [bitset.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-02 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitset.members">issues</a> in [bitset.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The following wording seems a little unusual to me:
  </p>
  <p>
! p42/43 20.5.2 [bitset.members]
  </p>
  
  <blockquote>
! <pre>bool operator==(const bitset&lt;N&gt;&amp; rhs) const;
  </pre>
! <blockquote>
  -42- <i>Returns:</i> A nonzero value if the value of each bit in
  <tt>*this</tt> equals the value of the corresponding bit in
  <tt>rhs</tt>.
! </blockquote>
! <pre>bool operator!=(const bitset&lt;N&gt;&amp; rhs) const;
  </pre>
! <blockquote>
  -43- <i>Returns:</i> A nonzero value if <tt>!(*this == rhs)</tt>.
! </blockquote>
  </blockquote>
  
  <p>
--- 32326,32358 ----
  
  <hr>
  <h3><a name="1168"></a>1168. Odd wording for bitset equality operators</h3>
! <p><b>Section:</b> 20.6.2 [bitset.members] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitset.members">issues</a> in [bitset.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The following wording seems a little unusual to me:
  </p>
  <p>
! p42/43 20.6.2 [bitset.members]
  </p>
  
  <blockquote>
! <pre>
! bool operator==(const bitset&lt;N&gt;&amp; rhs) const;
  </pre>
! <blockquote><p>
  -42- <i>Returns:</i> A nonzero value if the value of each bit in
  <tt>*this</tt> equals the value of the corresponding bit in
  <tt>rhs</tt>.
! </p></blockquote>
! <pre>
! bool operator!=(const bitset&lt;N&gt;&amp; rhs) const;
  </pre>
! <blockquote><p>
  -43- <i>Returns:</i> A nonzero value if <tt>!(*this == rhs)</tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** with the literal '<tt>true</tt>' (in app
*** 41712,41720 ****
  ]</i></p>
  
  
! <blockquote>
  It's obviously editorial. There's no need for further discussion.
! </blockquote>
  
  <p><i>[
  2009-07-27 Howard sets to NAD Editorial.
--- 32371,32379 ----
  ]</i></p>
  
  
! <blockquote><p>
  It's obviously editorial. There's no need for further discussion.
! </p></blockquote>
  
  <p><i>[
  2009-07-27 Howard sets to NAD Editorial.
*************** It's obviously editorial. There's no nee
*** 41725,41902 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.5.2 [bitset.members] p42-43:
  </p>
  
  <blockquote>
! <pre>bool operator==(const bitset&lt;N&gt;&amp; rhs) const;
  </pre>
! <blockquote>
  -42- <i>Returns:</i> <del>A nonzero value</del> <ins><tt>true</tt></ins> if the value of each bit in
  <tt>*this</tt> equals the value of the corresponding bit in
  <tt>rhs</tt>.
! </blockquote>
! <pre>bool operator!=(const bitset&lt;N&gt;&amp; rhs) const;
  </pre>
! <blockquote>
  -43- <i>Returns:</i> <del>A nonzero value</del> <ins><tt>true</tt></ins> if <tt>!(*this == rhs)</tt>.
! </blockquote>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1172"></a>1172. <tt>select_on_container_(copy|move)_construction</tt> over-constrained</h3>
! <p><b>Section:</b> X [allocator.concepts.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2009-07-08 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I believe the two functions
! <tt>select_on_container_(copy|move)_construction()</tt> are over-constrained. For
! example, the return value of the "copy" version is (see
! X [allocator.concepts.members]/21):
! </p>
! <blockquote>
! <i>Returns:</i> <tt>x</tt> if the allocator should propagate from the existing
! container to the new container on copy construction, otherwise <tt>X()</tt>.
! </blockquote>
! <p>
! Consider the case where a user decides to provide an explicit concept
! map for Allocator to adapt some legacy allocator class, as he wishes to
! provide customizations that the <tt>LegacyAllocator</tt> concept map template
! does not provide.  Now, although it's true that the legacy class is
! required to have a default constructor, the user might have reasons to
! prefer a different constructor to implement
! <tt>select_on_container_copy_construction()</tt>. However, the current wording
! requires the use of the default constructor.
! </p>
! <p>
! Moreover, it's not said explicitly that <tt>x</tt> is supposed to be the
! allocator of the existing container. A clarification would do no harm.
! </p>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! NAD Editorial.  Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Replace X [allocator.concepts.members]/21 with:
! </p>
! 
! <blockquote><pre>X select_on_container_copy_construction(const X&amp; x);
! </pre>
! <p>
! -21- <i>Returns:</i> <del><tt>x</tt> if the allocator should propagate from the existing
! container to the new container on copy construction, otherwise <tt>X()</tt>.</del>
! <ins>an allocator object to be used by the new container on copy
! construction. [<i>Note:</i> <tt>x</tt> is the allocator of the existing container that
! is being copied. The most obvious choices for the return value are <tt>x</tt>, if
! the allocator should propagate from the existing container, and <tt>X()</tt>.
! <i>— end note</i>]</ins>
! </p>
! </blockquote>
! 
! <p>
! Replace X [allocator.concepts.members]/25 with:
! </p>
! 
! <blockquote><pre>X select_on_container_move_construction(X&amp;&amp; x);
! </pre>
! <p>
! -25- <i>Returns:</i> <del><tt>move(x)</tt> if the allocator should propagate from the existing
! container to the new container on move construction, otherwise <tt>X()</tt>.</del>
! <ins>an allocator object to be used by the new container on move
! construction. [<i>Note:</i> <tt>x</tt> is the allocator of the existing container that
! is being moved. The most obvious choices for the return value are <tt>move(x)</tt>, if
! the allocator should propagate from the existing container, and <tt>X()</tt>.
! <i>— end note</i>]</ins>
! </p>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1173"></a>1173. "Equivalence" wishy-washiness</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-07-14 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Issue: The <tt>CopyConstructible</tt> requirements are wishy-washy.  It requires
! that the copy is "equivalent" to the original, but "equivalent" is never
! defined.
! </p>
! <p>
! I believe this to be an example of a more general lack of rigor around
! copy and assignment, although I haven't done the research to dig up all
! the instances.
! </p>
! <p>
! It's a problem because if you don't know what <tt>CopyConstructible</tt> means,
! you also don't know what it means to copy a pair of <tt>CopyConstructible</tt>
! types.  It doesn't prevent us from writing code, but it is a hole in our
! ability to understand the meaning of copy.
! </p>
! <p>
! Furthermore, I'm pretty sure that vector's copy constructor doesn't
! require the elements to be <tt>EqualityComparable</tt>, so that table is actually
! referring to some ill-defined notion of equivalence when it uses ==.
! </p>
! 
! <p><i>[
! 2009 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote>
! Move to "Open". Dave is right that this is a big issue. Paper D2987
! ("Defining Move Special Member Functions", Bjarne Stroustrup and
! Lawrence Crowl) touches on this but does not solve it. This issue is
! discussed in Elements of Programming.
! </blockquote>
! 
! 
! <p><i>[
! 2010 Rapperswil:
! ]</i></p>
! 
! 
! <blockquote>
! This issue is quite vague, so it is difficult to know if and when it has been resolved.
! 
! John Lakos wrote a paper covering this area a while back, and there is a real interest in providing some sort of clean-up in the future.
! 
! We need a more clearly draughted issues with an addressable set of concerns, ideally with a paper proposing a resolution, but for a future revision of the standard.
! 
! Move to Tentatively NAD Future.
  </blockquote>
  
- <p><i>[
- Moved to NAD Future at 2010-11 Batavia
- ]</i></p>
- 
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
  
  
  
--- 32384,32409 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.6.2 [bitset.members] p42-43:
  </p>
  
  <blockquote>
! <pre>
! bool operator==(const bitset&lt;N&gt;&amp; rhs) const;
  </pre>
! <blockquote><p>
  -42- <i>Returns:</i> <del>A nonzero value</del> <ins><tt>true</tt></ins> if the value of each bit in
  <tt>*this</tt> equals the value of the corresponding bit in
  <tt>rhs</tt>.
! </p></blockquote>
! <pre>
! bool operator!=(const bitset&lt;N&gt;&amp; rhs) const;
  </pre>
! <blockquote><p>
  -43- <i>Returns:</i> <del>A nonzero value</del> <ins><tt>true</tt></ins> if <tt>!(*this == rhs)</tt>.
! </p></blockquote>
  </blockquote>
  
  
  
  
*************** Moved to NAD Future at 2010-11 Batavia
*** 41904,41913 ****
  
  <hr>
  <h3><a name="1176"></a>1176. Make <tt>thread</tt> constructor non-variadic</h3>
! <p><b>Section:</b> 30.3.1.2 [thread.thread.constr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-07-18 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.constr">issues</a> in [thread.thread.constr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The variadic <tt>thread</tt> constructor is causing controversy, e.g.
--- 32411,32420 ----
  
  <hr>
  <h3><a name="1176"></a>1176. Make <tt>thread</tt> constructor non-variadic</h3>
! <p><b>Section:</b> 30.3.1.2 [thread.thread.constr] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-07-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.constr">issues</a> in [thread.thread.constr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The variadic <tt>thread</tt> constructor is causing controversy, e.g.
*************** The variadic <tt>thread</tt> constructor
*** 41915,41925 ****
  This issue has been created as a placeholder for this course of action.
  </p>
  
! <blockquote><pre>template &lt;class F<del>, class ...Args</del>&gt; thread(F&amp;&amp; f<del>, Args&amp;&amp;... args</del>);
  </pre></blockquote>
  
  <p>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a> for wording which specifies an rvalue-ref signature but
  with "decay behavior", but using variadics.
  </p>
  
--- 32422,32433 ----
  This issue has been created as a placeholder for this course of action.
  </p>
  
! <blockquote><pre>
! template &lt;class F<del>, class ...Args</del>&gt; thread(F&amp;&amp; f<del>, Args&amp;&amp;... args</del>);
  </pre></blockquote>
  
  <p>
! See <a href="lwg-defects.html#929">929</a> for wording which specifies an rvalue-ref signature but
  with "decay behavior", but using variadics.
  </p>
  
*************** The (tentative) concensus of the LWG is
*** 41946,41966 ****
  
  <hr>
  <h3><a name="1179"></a>1179. Probably editorial in [structure.specifications]</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2009-07-21 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! While reviewing <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a> I noted that 17.5.1.4 [structure.specifications]/7 says:
  </p>
  
! <blockquote>
  -7- Error conditions specify conditions where a function may fail. The
  conditions are listed, together with a suitable explanation, as the <tt>enum
  class errc</tt> constants (19.5) that could be used as an argument to
  function <tt>make_error_condition</tt> (19.5.3.6).
! </blockquote>
  
  <p>
  This paragraph should mention <tt>make_error_code</tt> or the text "that
--- 32454,32474 ----
  
  <hr>
  <h3><a name="1179"></a>1179. Probably editorial in [structure.specifications]</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2009-07-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! While reviewing <a href="lwg-closed.html#971">971</a> I noted that 17.5.1.4 [structure.specifications]/7 says:
  </p>
  
! <blockquote><p>
  -7- Error conditions specify conditions where a function may fail. The
  conditions are listed, together with a suitable explanation, as the <tt>enum
  class errc</tt> constants (19.5) that could be used as an argument to
  function <tt>make_error_condition</tt> (19.5.3.6).
! </p></blockquote>
  
  <p>
  This paragraph should mention <tt>make_error_code</tt> or the text "that
*************** user to test for the condition, whereas
*** 41981,42001 ****
  example:
  </p>
  
! <blockquote><pre>void foobar(error_code&amp; ec = throws());
  </pre></blockquote>
  
  <p>
   Error conditions:
  </p>
! <blockquote>
  permission_denied - Insufficient privilege to perform operation.
! </blockquote>
  
  <p>
  When a user writes:
  </p>
  
! <blockquote><pre>error_code ec;
  foobar(ec);
  if (ec == errc::permission_denied)
     ...
--- 32489,32511 ----
  example:
  </p>
  
! <blockquote><pre>
! void foobar(error_code&amp; ec = throws());
  </pre></blockquote>
  
  <p>
   Error conditions:
  </p>
! <blockquote><p>
  permission_denied - Insufficient privilege to perform operation.
! </p></blockquote>
  
  <p>
  When a user writes:
  </p>
  
! <blockquote><pre>
! error_code ec;
  foobar(ec);
  if (ec == errc::permission_denied)
     ...
*************** the implicit conversion <tt>errc-&gt;err
*** 42006,42019 ****
  equivalent to:
  </p>
  
! <blockquote><pre>if (ec == make_error_condition(errc::permission_denied))
  </pre></blockquote>
  
  <p>
  On the other hand, if the user had written:
  </p>
  
! <blockquote><pre>if (ec == make_error_code(errc::permission_denied))
  </pre></blockquote>
  
  <p>
--- 32516,32531 ----
  equivalent to:
  </p>
  
! <blockquote><pre>
! if (ec == make_error_condition(errc::permission_denied))
  </pre></blockquote>
  
  <p>
  On the other hand, if the user had written:
  </p>
  
! <blockquote><pre>
! if (ec == make_error_code(errc::permission_denied))
  </pre></blockquote>
  
  <p>
*************** other things that we say. We believe tha
*** 42053,42164 ****
  
  
  <hr>
- <h3><a name="1184"></a>1184. Feature request: dynamic bitset</h3>
- <p><b>Section:</b> 23.4.1 [vector] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-29 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector">issues</a> in [vector].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Opened at Alisdair's request, steming from <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>.
- Alisdair recommends NAD Future.
- </p>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Future.  We want a heap allocated bitset, but we don't have one today and
- don't have time to add one.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1185"></a>1185. iterator categories and output iterators</h3>
- <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-31 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- (wording relative to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
- pending new working paper)
- </p>
- 
- <p>
- According to p3 24.2 [iterator.requirements], Forward iterators,
- Bidirectional iterators and Random Access iterators all satisfy the
- requirements for an Output iterator:
- </p>
- 
- <blockquote>
- XXX iterators satisfy all the requirements of the input and output iterators
- and can be used whenever either kind is specified ...
- </blockquote>
- 
- <p>
- Meanwhile, p4 goes on to contradict this:
- </p>
- 
- <blockquote>
- Besides its category, a forward, bidirectional, or random access
- iterator can also be mutable or constant...
- </blockquote>
- 
- <blockquote>
- ... Constant iterators do not satisfy the requirements for output iterators
- </blockquote>
- 
- <p>
- The latter seems to be the overriding concern, as the iterator tag
- hierarchy does not define <tt>forward_iterator_tag</tt> as multiply derived from
- both <tt>input_iterator_tag</tt> and <tt>output_iterator_tag</tt>.
- </p>
- 
- <p>
- The work on concepts for iterators showed us that output iterator really
- is fundamentally a second dimension to the iterator categories, rather
- than part of the linear input -&gt; forward -&gt; bidirectional -&gt;
- random-access sequence.  It would be good to clear up these words to
- reflect that, and separately list output iterator requirements in the
- requires clauses for the appropriate algorithms and operations.
- </p>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1186"></a>1186. Forward list could model a stack</h3>
! <p><b>Section:</b> 23.5.3 [stack] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-31 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The library template <tt>forward_list</tt> could easily model the idea of a
--- 32565,32574 ----
  
  
  <hr>
  <h3><a name="1186"></a>1186. Forward list could model a stack</h3>
! <p><b>Section:</b> 23.6.5 [stack] <b>Status:</b> <a href="lwg-active.html#NAD Concepts">NAD Concepts</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Concepts">NAD Concepts</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The library template <tt>forward_list</tt> could easily model the idea of a
*************** library.
*** 42189,42197 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively NAD Concepts after 5 positive votes on c++std-lib.
! </blockquote>
  
  
  <p><b>Rationale:</b></p>
--- 32599,32607 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively NAD Concepts after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  
  <p><b>Rationale:</b></p>
*************** library.
*** 42210,42421 ****
  
  
  <hr>
- <h3><a name="1188"></a>1188. Unordered containers should have a minimum load factor as well as a maximum</h3>
- <p><b>Section:</b> 23.2.5 [unord.req], 23.7 [unord] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2009-08-10 <b>Last modified:</b> 2010-11-24</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Unordered associative containers have a notion of a maximum load factor:
- when the number of elements grows large enough, the containers
- automatically perform a rehash so that the number of elements per bucket
- stays below a user-specified bound. This ensures that the hash table's
- performance characteristics don't change dramatically as the size
- increases.
- </p>
- 
- <p>
- For similar reasons, Google has found it useful to specify a minimum
- load factor: when the number of elements shrinks by a large enough, the
- containers automatically perform a rehash so that the number of elements
- per bucket stays above a user-specified bound. This is useful for two
- reasons. First, it prevents wasting a lot of memory when an unordered
- associative container grows temporarily. Second, it prevents amortized
- iteration time from being arbitrarily large; consider the case of a hash
- table with a billion buckets and only one element. (This was discussed
- even before TR1 was published; it was TR issue 6.13, which the LWG
- closed as NAD on the grounds that it was a known design feature.
- However, the LWG did not consider the approach of a minimum load
- factor.)
- </p>
- 
- <p>
- The only interesting question is when shrinking is allowed. In principle
- the cleanest solution would be shrinking on erase, just as we grow on
- insert. However, that would be a usability problem; it would break a
- number of common idioms involving erase. Instead, Google's hash tables
- only shrink on insert and rehash.
- </p>
- 
- <p>
- The proposed resolution allows, but does not require, shrinking in
- rehash, mostly because a postcondition for rehash that involves the
- minimum load factor would be fairly complicated. (It would probably have
- to involve a number of special cases and it would probably have to
- mention yet another parameter, a minimum bucket count.)
- </p>
- 
- <p>
- The current behavior is equivalent to a minimum load factor of 0. If we
- specify that 0 is the default, this change will have no impact on
- backward compatibility.
- </p>
- 
- 
- <p><i>[
- 2010 Rapperswil:
- ]</i></p>
- 
- 
- <blockquote>
- This seems to a useful extension, but is too late for 0x.
- 
- Move to Tentatively NAD Future.
- </blockquote>
- 
- <p><i>[
- Moved to NAD Future at 2010-11 Batavia
- ]</i></p>
- 
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Add two new rows, and change rehash's postcondition in the unordered
- associative container requirements table in 23.2.5 [unord.req]:
- </p>
- 
- <blockquote>
- <table border="1">
- <caption>Table 87 — Unordered associative container requirements
- (in addition to container)</caption>
- 
- <tbody><tr>
- <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
- <th>Complexity</th>
- </tr>
- <tr>
- <td><ins>
- <tt>a.min_load_factor()</tt>
- </ins></td>
- <td><ins>
- <tt>float</tt>
- </ins></td>
- <td><ins>
- Returns a non-negative number that the container attempts to keep the
- load factor greater than or equal to. The container automatically
- decreases the number of buckets as necessary to keep the load factor
- above this number.
- </ins></td>
- <td><ins>
- constant
- </ins></td>
- </tr>
- 
- <tr>
- <td><ins><tt>a.min_load_factor(z)</tt></ins></td>
- <td><ins><tt>void</tt></ins></td>
- <td><ins>Pre: <tt>z</tt> shall be non-negative. Changes the container's minimum
- load factor, using <tt>z</tt> as a hint. [<i>Footnote:</i> the minimum
- load factor should be significantly smaller than the maximum. 
- If <tt>z</tt> is too large, the implementation may reduce it to a more sensible value.]
- </ins></td>
- <td><ins>
- constant
- </ins></td>
- </tr>
- <tr>
- <td><tt>a.rehash(n)</tt></td>
- <td><tt>void</tt></td>
- <td>
- Post: <ins><tt>a.bucket_count() &gt;= n</tt>, and <tt>a.size() &lt;= a.bucket_count()
- * a.max_load_factor()</tt>. [<i>Footnote:</i> It is intentional that the
- postcondition does not mention the minimum load factor.
- This member function is primarily intended for cases where the user knows
- that the container's size will increase soon, in which case the container's
- load factor will temporarily fall below <tt>a.min_load_factor()</tt>.]</ins>
- <del>
- <tt>a.bucket_cout &gt; a.size() / a.max_load_factor()</tt> and <tt>a.bucket_count()
- &gt;= n</tt>.
- </del>
- </td>
- <td>
- Average case linear in <tt>a.size()</tt>, worst case quadratic.
- </td>
- </tr>
- </tbody></table>
- </blockquote>
- 
- <p>
- Add a footnote to 23.2.5 [unord.req] p12:
- </p>
- 
- <blockquote>
- <p>
- The insert members shall not affect the validity of references to
- container elements, but may invalidate all iterators to the container.
- The erase members shall invalidate only iterators and references to the
- erased elements.
- </p>
- 
- <blockquote><ins>
- [A consequence of these requirements is that while insert may change the
- number of buckets, erase may not. The number of buckets may be reduced
- on calls to insert or rehash.]
- </ins></blockquote>
- </blockquote>
- 
- <p>
- Change paragraph 13:
- </p>
- 
- <blockquote>
- The insert members shall not affect the validity of iterators if
- <del><tt>(N+n) &lt; z * B</tt></del> <ins><tt>zmin * B &lt;= (N+n) &lt;= zmax * B</tt></ins>,
- where <tt>N</tt> is the number of elements in
- the container prior to the insert operation, <tt>n</tt> is the number of
- elements inserted, <tt>B</tt> is the container's bucket count,
- <ins><tt>zmin</tt> is the container's minimum load factor,</ins>
- and <tt>z<ins>max</ins></tt> is the container's maximum load factor.
- </blockquote>
- 
- <p>
- Add to the <tt>unordered_map</tt> class synopsis in section 23.7.1 [unord.map],
- the <tt>unordered_multimap</tt> class synopsis
- in 23.7.2 [unord.multimap], the <tt>unordered_set</tt> class synopsis in
- 23.7.3 [unord.set], and the <tt>unordered_multiset</tt> class synopsis
- in 23.7.4 [unord.multiset]:
- </p>
- 
- <blockquote><pre><ins>
- float min_load_factor() const;
- void min_load_factor(float z);
- </ins></pre></blockquote>
- 
- <p>
- In 23.7.1.1 [unord.map.cnstr], 23.7.2.1 [unord.multimap.cnstr], 23.7.3.1 [unord.set.cnstr], and
- 23.7.4.1 [unord.multiset.cnstr], change:
- </p>
- 
- <blockquote>
- ... <tt>max_load_factor()</tt> returns 1.0 <ins>and
- <tt>min_load_factor()</tt> returns 0</ins>.
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1190"></a>1190. Setting the maximum load factor should return the previous value</h3>
! <p><b>Section:</b> 23.2.5 [unord.req], 23.7 [unord] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2009-08-10 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The unordered associative container requirements table specifies that
--- 32620,32631 ----
  
  
  <hr>
  <h3><a name="1190"></a>1190. Setting the maximum load factor should return the previous value</h3>
! <p><b>Section:</b> 23.2.5 [unord.req], 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2009-08-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The unordered associative container requirements table specifies that
*************** don't need it can always ignore it.
*** 42430,42440 ****
  ]</i></p>
  
  
! <blockquote>
  The benefit seems minor, while breaking with the getter/setter idiom these overloads support.
  
  Move to Tentatively NAD.
! </blockquote>
  
  <p><i>[
  Moved to NAD at 2010-11 Batavia
--- 32640,32650 ----
  ]</i></p>
  
  
! <blockquote><p>
  The benefit seems minor, while breaking with the getter/setter idiom these overloads support.
  
  Move to Tentatively NAD.
! </p></blockquote>
  
  <p><i>[
  Moved to NAD at 2010-11 Batavia
*************** In the unordered associative container r
*** 42450,42459 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 87 — Unordered associative container requirements
  (in addition to container)</caption>
  
! <tbody><tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
--- 32660,32669 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 87 &mdash; Unordered associative container requirements
  (in addition to container)</caption>
  
! <tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
*************** In the unordered associative container r
*** 42470,42487 ****
  constant
  </td>
  </tr>
! <tr></tr>
! </tbody></table>
  </blockquote>
  
  <p>
  Change the return type of <tt>set_max_load_factor</tt>
! in the class synopses in 23.7.1 [unord.map], 23.7.2 [unord.multimap],  23.7.3 [unord.set],
! and 23.7.4 [unord.multiset].
  </p>
  
  <p>
! If issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a> is also accepted, make the same changes for
  <tt>min_load_factor</tt>.
  </p>
  
--- 32680,32696 ----
  constant
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
  Change the return type of <tt>set_max_load_factor</tt>
! in the class synopses in 23.5.4 [unord.map], 23.5.5 [unord.multimap],  23.5.6 [unord.set],
! and 23.5.7 [unord.multiset].
  </p>
  
  <p>
! If issue <a href="lwg-active.html#1188">1188</a> is also accepted, make the same changes for
  <tt>min_load_factor</tt>.
  </p>
  
*************** If issue <a href="http://www.open-std.or
*** 42490,42550 ****
  
  
  <hr>
- <h3><a name="1196"></a>1196. move semantics undefined for priority_queue</h3>
- <p><b>Section:</b> 23.5.2.1 [priqueue.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-08-19 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- The class template <tt>priority_queue</tt> declares signatures for a move
- constructor and move assignment operator in its class definition.
- However, it does not provide a definition (unlike <tt>std::queue</tt>, and
- proposed resolution for <tt>std::stack</tt>.) Nor does it provide a text clause
- specifying their behaviour.
- </p>
- 
- <p><i>[
- 2009-08-23 Daniel adds:
- ]</i></p>
- 
- 
- <blockquote>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a> provides wording that solves this issue.
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Mark NAD Editorial, solved by issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1200"></a>1200. "surprising" <tt>char_traits&lt;T&gt;::int_type</tt> requirements</h3>
! <p><b>Section:</b> 21.2.2 [char.traits.typedefs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2009-09-03 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#char.traits.typedefs">issues</a> in [char.traits.typedefs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The footnote for <tt>int_type</tt> in 21.2.2 [char.traits.typedefs] says that
  </p>
  
! <blockquote>
! If <tt>eof()</tt>
! can be held in <tt>char_type</tt> then some iostreams implementations may give
! surprising results.
! </blockquote>
  
  <p>
  This implies that <tt>int_type</tt> should be a superset of
--- 32699,32718 ----
  
  
  <hr>
  <h3><a name="1200"></a>1200. "surprising" <tt>char_traits&lt;T&gt;::int_type</tt> requirements</h3>
! <p><b>Section:</b> 21.2.2 [char.traits.typedefs] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2009-09-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#char.traits.typedefs">issues</a> in [char.traits.typedefs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The footnote for <tt>int_type</tt> in 21.2.2 [char.traits.typedefs] says that
  </p>
  
! <blockquote><p>
! If <tt>eof()</tt> can be held in <tt>char_type</tt> then some iostreams implementations 
! may give surprising results.
! </p></blockquote>
  
  <p>
  This implies that <tt>int_type</tt> should be a superset of
*************** for the second:
*** 42582,42609 ****
  Replace 21.2.3.2 [char.traits.specializations.char16_t] para 3 with:
  </p>
  
! <blockquote>
  The member <tt>eof()</tt> shall return <del>an implementation-defined
  constant that cannot appear as a valid UTF-16 code unit</del>
  <ins><tt>UINT_LEAST16_MAX</tt> [<i>Note:</i> this value is guaranteed to
  be a permanently reserved UCS-2 code position if <tt>UINT_LEAST16_MAX ==
! 0xFFFF</tt> and it's not a UCS-2 code position otherwise — <i>end
  note</i>]</ins>.
! </blockquote>
  
  <p>
  Replace 21.2.3.3 [char.traits.specializations.char32_t] para 3 with:
  </p>
  
! <blockquote>
  The member <tt>eof()</tt> shall return <del>an implementation-defined constant that
  cannot appear as a Unicode code point</del>
  <ins>
  <tt>UINT_LEAST32_MAX</tt> [<i>Note:</i> this value is guaranteed to be a
  permanently reserved UCS-4 code position if <tt>UINT_LEAST32_MAX ==
! 0xFFFFFFFF</tt> and it's not a UCS-4 code position otherwise — <i>end
  note</i>]</ins>.
! </blockquote>
  </li>
  <li>
  <p>
--- 32750,32777 ----
  Replace 21.2.3.2 [char.traits.specializations.char16_t] para 3 with:
  </p>
  
! <blockquote><p>
  The member <tt>eof()</tt> shall return <del>an implementation-defined
  constant that cannot appear as a valid UTF-16 code unit</del>
  <ins><tt>UINT_LEAST16_MAX</tt> [<i>Note:</i> this value is guaranteed to
  be a permanently reserved UCS-2 code position if <tt>UINT_LEAST16_MAX ==
! 0xFFFF</tt> and it's not a UCS-2 code position otherwise &mdash; <i>end
  note</i>]</ins>.
! </p></blockquote>
  
  <p>
  Replace 21.2.3.3 [char.traits.specializations.char32_t] para 3 with:
  </p>
  
! <blockquote><p>
  The member <tt>eof()</tt> shall return <del>an implementation-defined constant that
  cannot appear as a Unicode code point</del>
  <ins>
  <tt>UINT_LEAST32_MAX</tt> [<i>Note:</i> this value is guaranteed to be a
  permanently reserved UCS-4 code position if <tt>UINT_LEAST32_MAX ==
! 0xFFFFFFFF</tt> and it's not a UCS-4 code position otherwise &mdash; <i>end
  note</i>]</ins>.
! </p></blockquote>
  </li>
  <li>
  <p>
*************** definition of <tt>char_traits&lt;char16_
*** 42612,42618 ****
  typedef <tt>int_type</tt> with:
  </p>
  
! <blockquote><pre>namespace std {
    template&lt;&gt; struct char_traits&lt;char16_t&gt; {
      typedef char16_t         char_type;
      typedef <del>uint_least16_t</del> <ins>uint_fast16_t</ins> int_type;
--- 32780,32787 ----
  typedef <tt>int_type</tt> with:
  </p>
  
! <blockquote><pre>
! namespace std {
    template&lt;&gt; struct char_traits&lt;char16_t&gt; {
      typedef char16_t         char_type;
      typedef <del>uint_least16_t</del> <ins>uint_fast16_t</ins> int_type;
*************** typedef <tt>int_type</tt> with:
*** 42623,42636 ****
  Replace 21.2.3.2 [char.traits.specializations.char16_t] para 3 with:
  </p>
  
! <blockquote>
  The member <tt>eof()</tt> shall return <del>an implementation-defined
  constant that cannot appear as a valid UTF-16 code unit</del>
  <ins><tt>UINT_FAST16_MAX</tt> [<i>Note:</i> this value is guaranteed to
  be a permanently reserved UCS-2 code position if <tt>UINT_FAST16_MAX ==
! 0xFFFF</tt> and it's not a UCS-2 code position otherwise — <i>end
  note</i>]</ins>.
! </blockquote>
  
  <p>
  In 21.2.3.3 [char.traits.specializations.char32_t], in the
--- 32792,32805 ----
  Replace 21.2.3.2 [char.traits.specializations.char16_t] para 3 with:
  </p>
  
! <blockquote><p>
  The member <tt>eof()</tt> shall return <del>an implementation-defined
  constant that cannot appear as a valid UTF-16 code unit</del>
  <ins><tt>UINT_FAST16_MAX</tt> [<i>Note:</i> this value is guaranteed to
  be a permanently reserved UCS-2 code position if <tt>UINT_FAST16_MAX ==
! 0xFFFF</tt> and it's not a UCS-2 code position otherwise &mdash; <i>end
  note</i>]</ins>.
! </p></blockquote>
  
  <p>
  In 21.2.3.3 [char.traits.specializations.char32_t], in the
*************** definition of <tt>char_traits&lt;char32_
*** 42638,42644 ****
  typedef <tt>int_type</tt> with:
  </p>
  
! <blockquote><pre>namespace std {
    template&lt;&gt; struct char_traits&lt;char32_t&gt; {
      typedef char32_t         char_type;
      typedef <del>uint_least32_t</del> <ins>uint_fast32_t</ins> int_type;
--- 32807,32814 ----
  typedef <tt>int_type</tt> with:
  </p>
  
! <blockquote><pre>
! namespace std {
    template&lt;&gt; struct char_traits&lt;char32_t&gt; {
      typedef char32_t         char_type;
      typedef <del>uint_least32_t</del> <ins>uint_fast32_t</ins> int_type;
*************** typedef <tt>int_type</tt> with:
*** 42649,42663 ****
  Replace 21.2.3.3 [char.traits.specializations.char32_t] para 3 with:
  </p>
  
! <blockquote>
  The member <tt>eof()</tt> shall return <del>an implementation-defined constant that
  cannot appear as a Unicode code point</del>
  <ins>
  <tt>UINT_FAST32_MAX</tt> [<i>Note:</i> this value is guaranteed to be a
  permanently reserved UCS-4 code position if <tt>UINT_FAST32_MAX ==
! 0xFFFFFFFF</tt> and it's not a UCS-4 code position otherwise — <i>end
  note</i>]</ins>.
! </blockquote>
  </li>
  </ol>
  </blockquote>
--- 32819,32833 ----
  Replace 21.2.3.3 [char.traits.specializations.char32_t] para 3 with:
  </p>
  
! <blockquote><p>
  The member <tt>eof()</tt> shall return <del>an implementation-defined constant that
  cannot appear as a Unicode code point</del>
  <ins>
  <tt>UINT_FAST32_MAX</tt> [<i>Note:</i> this value is guaranteed to be a
  permanently reserved UCS-4 code position if <tt>UINT_FAST32_MAX ==
! 0xFFFFFFFF</tt> and it's not a UCS-4 code position otherwise &mdash; <i>end
  note</i>]</ins>.
! </p></blockquote>
  </li>
  </ol>
  </blockquote>
*************** note</i>]</ins>.
*** 42668,42678 ****
  ]</i></p>
  
  
! <blockquote>
! This seems an overspecification, and it is not clear what problem is being solved - these values can be used portably by using the named functions; there is no need for the value itself to be portable.
  
  Move to Tentatively NAD.
! </blockquote>
  
  <p><i>[
  Moved to NAD at 2010-11 Batavia
--- 32838,32850 ----
  ]</i></p>
  
  
! <blockquote><p>
! This seems an overspecification, and it is not clear what problem is being solved - 
! these values can be used portably by using the named functions; there is no need 
! for the value itself to be portable.
  
  Move to Tentatively NAD.
! </p></blockquote>
  
  <p><i>[
  Moved to NAD at 2010-11 Batavia
*************** Moved to NAD at 2010-11 Batavia
*** 42690,42887 ****
  
  
  <hr>
- <h3><a name="1201"></a>1201. Do we always want to unwrap <tt>ref</tt>-wrappers in <tt>make_tuple</tt></h3>
- <p><b>Section:</b> 20.4.2.4 [tuple.creation], 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-05 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Spotting a recent thread on the boost lists regarding collapsing
- optional representations in <tt>optional&lt;optional&lt;T&gt;&gt;</tt> instances, I wonder if
- we have some of the same issues with <tt>make_tuple</tt>, and now <tt>make_pair</tt>?
- </p>
- 
- <p>
- Essentially, if my generic code in my own library is handed a
- <tt>reference_wrapper</tt> by a user, and my library in turn delegates some logic
- to <tt>make_pair</tt> or <tt>make_tuple</tt>, then I am going to end up with a <tt>pair</tt>/<tt>tuple</tt>
- holding a real reference rather than the intended reference wrapper.
- </p>
- 
- <p>
- There are two things as a library author I can do at this point:
- </p>
- 
- <ol type="i">
- <li>
- document my library also has the same reference-wrapper behaviour as
- <tt>std::make_tuple</tt>
- </li>
- <li>
- roll my own <tt>make_tuple</tt> that does not unwrap rereferences, a lost
- opportunity to re-use the standard library.
- </li>
- </ol>
- 
- <p>
- (There may be some metaprogramming approaches my library can use to wrap
- the <tt>make_tuple</tt> call, but all will be significantly more complex than
- simply implementing a simplified <tt>make_tuple</tt>.)
- </p>
- 
- <p>
- Now I don't propose we lose this library facility, I think unwrapping
- references will be the common behaviour.  However, we might want to
- consider adding another overload that does nothing special with
- <tt>ref</tt>-wrappers.  Note that we already have a second overload of <tt>make_tuple</tt>
- in the library, called <tt>tie</tt>.
- </p>
- 
- <p><i>[
- 2009-09-30 Daniel adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- I suggest to change the currently proposed paragraph for
- <tt>make_simple_pair</tt>
- </p>
- 
- <blockquote><pre>template&lt;typename... Types&gt;
-   pair&lt;typename decay&lt;Types&gt;::type...&gt; make_simple_pair(Types&amp;&amp;... t);
- </pre>
- <blockquote>
- <p>
- <del><i>Type requirements:</i> <tt>sizeof...(Types) == 2</tt>.</del>
- <ins><i>Remarks:</i> The program shall be ill-formed, if
- <tt>sizeof...(Types) != 2</tt>.</ins>
- </p>
- <p>
- ...
- </p>
- </blockquote>
- </blockquote>
- 
- <p>
- or alternatively (but with a slightly different semantic):
- </p>
- 
- <blockquote>
- <blockquote>
- <i>Remarks:</i> If <tt>sizeof...(Types) != 2</tt>, this function shall not
- participate in overload resolution.
- </blockquote>
- </blockquote>
- 
- <p>
- to follow a currently introduced style and because the library does
- not have yet a specific "<i>Type requirements</i>" element. If such thing
- would be considered as useful this should be done as a separate
- issue. Given the increasing complexity of either of these wordings
- it might be preferable to use the normal two-argument-declaration
- style again in either of the following ways:
- </p>
- 
- <ol type="A">
- <li>
- <pre>template&lt;class T1, class T2&gt;
- pair&lt;typename decay&lt;T1&gt;::type, typename decay&lt;T2&gt;::type&gt;
- make_simple_pair(T1&amp;&amp; t1, T2&amp;&amp; t2);
- </pre>
- </li>
- <li>
- <pre>template&lt;class T1, class T2&gt;
- pair&lt;V1, V2&gt; make_simple_pair(T1&amp;&amp; t1, T2&amp;&amp; t2);
- </pre>
- <blockquote>
- Let <tt>V1</tt> be <tt>typename decay&lt;T1&gt;::type</tt> and <tt>V2</tt> be
- <tt>typename decay&lt;T2&gt;::type</tt>.
- </blockquote>
- </li>
- </ol>
- 
- </blockquote>
- 
- <p><i>[
- 2009-10 post-Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Mark as Tentatively NAD Future.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Does not have sufficient support at this time. May wish to reconsider for a
- future standard.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Add the following function to 20.3.5 [pairs] and signature in
- appropriate synopses:
- </p>
- 
- <blockquote><pre>template&lt;typename... Types&gt;
-   pair&lt;typename decay&lt;Types&gt;::type...&gt; make_simple_pair(Types&amp;&amp;... t);
- </pre>
- <blockquote>
- <p>
- <i>Type requirements:</i> <tt>sizeof...(Types) == 2</tt>.
- </p>
- <p>
- <i>Returns:</i> <tt>pair&lt;typename decay&lt;Types&gt;::type...&gt;(std::forward&lt;Types&gt;(t)...)</tt>.
- </p>
- </blockquote>
- </blockquote>
- 
- <p><i>[
- Draughting note: I chose a variadic representation similar to <tt>make_tuple</tt>
- rather than naming both types as it is easier to read through the
- clutter of metaprogramming this way.  Given there are exactly two
- elements, the committee may prefer to draught with two explicit template
- type parameters instead
- ]</i></p>
- 
- 
- <p>
- Add the following function to 20.4.2.4 [tuple.creation] and
- signature in appropriate synopses:
- </p>
- 
- <blockquote><pre>template&lt;typename... Types&gt;
-   tuple&lt;typename decay&lt;Types&gt;::type...&gt; make_simple_tuple(Types&amp;&amp;... t);
- </pre>
- <blockquote>
- <p>
- <i>Returns:</i> <tt>tuple&lt;typename decay&lt;Types&gt;::type...&gt;(std::forward&lt;Types&gt;(t)...)</tt>.
- </p>
- </blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1202"></a>1202. <tt>integral_constant</tt> needs a spring clean</h3>
! <p><b>Section:</b> 20.7.3 [meta.help] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-05 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.help">issues</a> in [meta.help].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The specification of <tt>integral_constant</tt> has been inherited
  essentially unchanged from TR1:
  </p>
  
! <blockquote><pre>template &lt;class T, T v&gt;
  struct integral_constant {
    static const T value = v;
    typedef T value_type;
--- 32862,32880 ----
  
  
  <hr>
  <h3><a name="1202"></a>1202. <tt>integral_constant</tt> needs a spring clean</h3>
! <p><b>Section:</b> 20.10.3 [meta.help] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.help">issues</a> in [meta.help].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The specification of <tt>integral_constant</tt> has been inherited
  essentially unchanged from TR1:
  </p>
  
! <blockquote><pre>
! template &lt;class T, T v&gt;
  struct integral_constant {
    static const T value = v;
    typedef T value_type;
*************** for it, where we could now implement wit
*** 42900,42906 ****
  syntax:
  </p>
  
! <blockquote><pre>template &lt;class T, T v&gt;
  struct integral_constant {
    <b>enum : T { value = v };</b>
    typedef T value_type;
--- 32893,32900 ----
  syntax:
  </p>
  
! <blockquote><pre>
! template &lt;class T, T v&gt;
  struct integral_constant {
    <b>enum : T { value = v };</b>
    typedef T value_type;
*************** struct integral_constant {
*** 42912,42918 ****
  The effective difference between these two implementation is:
  </p>
  
! <ol type="i">
  <li>
  No requirement to allocate storage for data member (which we hope but do
  not guarantee compilers strip today)
--- 32906,32912 ----
  The effective difference between these two implementation is:
  </p>
  
! <ol style="list-style-type:lower-roman">
  <li>
  No requirement to allocate storage for data member (which we hope but do
  not guarantee compilers strip today)
*************** constant form.  In that case we should g
*** 42942,42948 ****
  <tt>constexpr</tt>, much like we did throughout <tt>numeric_limits</tt>:
  </p>
  
! <blockquote><pre>template &lt;class T, T v&gt;
  struct integral_constant {
    static <b>constexpr</b> T value = v;
    typedef T value_type;
--- 32936,32943 ----
  <tt>constexpr</tt>, much like we did throughout <tt>numeric_limits</tt>:
  </p>
  
! <blockquote><pre>
! template &lt;class T, T v&gt;
  struct integral_constant {
    static <b>constexpr</b> T value = v;
    typedef T value_type;
*************** struct integral_constant {
*** 42952,42958 ****
  
  <p>
  [Footnote] It turns out <tt>constexpr</tt> is part of the Tentatively Ready
! resolution for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.  I don't want to interfere with that issue, but
  would like a new issue to consider if the fixed-base enum implementation
  should be allowed.
  </p>
--- 32947,32953 ----
  
  <p>
  [Footnote] It turns out <tt>constexpr</tt> is part of the Tentatively Ready
! resolution for <a href="lwg-defects.html#1019">1019</a>.  I don't want to interfere with that issue, but
  would like a new issue to consider if the fixed-base enum implementation
  should be allowed.
  </p>
*************** should be allowed.
*** 42967,42978 ****
  I think that the suggested resolution is incomplete and
  may have some possible unwanted side-effects. To understand
  why, note that <tt>integral_constant</tt> is <em>completely</em> specified
! by code in 20.7.3 [meta.help]. While this is usually considered
  as a good thing, let me give a possible user-defined
  specialization that would break given the suggested changes:
  </p>
  
! <blockquote><pre>enum NodeColor { Red, Black };
  
  std::integral_constant&lt;NodeColor, Red&gt; red;
  </pre></blockquote>
--- 32962,32974 ----
  I think that the suggested resolution is incomplete and
  may have some possible unwanted side-effects. To understand
  why, note that <tt>integral_constant</tt> is <em>completely</em> specified
! by code in 20.10.3 [meta.help]. While this is usually considered
  as a good thing, let me give a possible user-defined
  specialization that would break given the suggested changes:
  </p>
  
! <blockquote><pre>
! enum NodeColor { Red, Black };
  
  std::integral_constant&lt;NodeColor, Red&gt; red;
  </pre></blockquote>
*************** are easy to disappoint if they see a fai
*** 42999,43012 ****
  of the test
  </p>
  
! <blockquote><pre>assert(typeid(std::integral_constant&lt;int, 0&gt;::value) == typeid(int));
  </pre></blockquote>
  
  <p>
  or of
  </p>
  
! <blockquote><pre>static_assert(std::is_same&lt;decltype(std::integral_constant&lt;int, 0&gt;::value), const int&gt;::value, "Bad library");
  </pre></blockquote>
  
  </blockquote>
--- 32995,33010 ----
  of the test
  </p>
  
! <blockquote><pre>
! assert(typeid(std::integral_constant&lt;int, 0&gt;::value) == typeid(int));
  </pre></blockquote>
  
  <p>
  or of
  </p>
  
! <blockquote><pre>
! static_assert(std::is_same&lt;decltype(std::integral_constant&lt;int, 0&gt;::value), const int&gt;::value, "Bad library");
  </pre></blockquote>
  
  </blockquote>
*************** unwanted side-effects.  (see Daniel's 20
*** 43032,43569 ****
  
  
  <hr>
- <h3><a name="1203"></a>1203. More useful rvalue stream insertion</h3>
- <p><b>Section:</b> 27.7.2.9 [ostream.rvalue], 27.7.1.6 [istream.rvalue] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-09-06 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- 27.7.2.9 [ostream.rvalue] was created to preserve the ability to insert
- into (and extract from 27.7.1.6 [istream.rvalue]) rvalue streams:
- </p>
- 
- <blockquote><pre>template &lt;class charT, class traits, class T&gt;
-   basic_ostream&lt;charT, traits&gt;&amp;
-   operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp;&amp; os, const T&amp; x);
- </pre>
- <blockquote>
- <p>
- 1 <i>Effects:</i> <tt>os &lt;&lt; x</tt>
- </p>
- <p>
- 2 <i>Returns:</i> <tt>os</tt>
- </p>
- </blockquote>
- </blockquote>
- 
- <p>
- This is good as it allows code that wants to (for example) open, write to, and
- close an <tt>ofstream</tt> all in one statement:
- </p>
- 
- <blockquote><pre>std::ofstream("log file") &lt;&lt; "Some message\n";
- </pre></blockquote>
- 
- <p>
- However, I think we can easily make this "rvalue stream helper" even easier to
- use.  Consider trying to quickly create a formatted string.  With the current
- spec you have to write:
- </p>
- 
- <blockquote><pre>std::string s = static_cast&lt;std::ostringstream&amp;&gt;(std::ostringstream() &lt;&lt; "i = " &lt;&lt; i).str();
- </pre></blockquote>
- 
- <p>
- This will store "<tt>i = 10</tt>" (for example) in the string <tt>s</tt>.  Note
- the need to cast the stream back to <tt>ostringstream&amp;</tt> prior to using
- the member <tt>.str()</tt>.  This is necessary because the inserter has cast
- the <tt>ostringstream</tt> down to a more generic <tt>ostream</tt> during the
- insertion process.
- </p>
- 
- <p>
- I believe we can re-specify the rvalue-inserter so that this cast is unnecessary.
- Thus our customer now has to only type:
- </p>
- 
- <blockquote><pre>std::string s = (std::ostringstream() &lt;&lt; "i = " &lt;&lt; i).str();
- </pre></blockquote>
- 
- <p>
- This is accomplished by having the rvalue stream inserter return an rvalue of
- the same type, instead of casting it down to the base class.  This is done by
- making the stream generic, and constraining it to be an rvalue of a type derived
- from <tt>ios_base</tt>.
- </p>
- 
- <p>
- The same argument and solution also applies to the inserter.  This code has been
- implemented and tested.
- </p>
- 
- <p><i>[
- 2009 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Future.  No concensus for change.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change 27.7.1.6 [istream.rvalue]:
- </p>
- 
- <blockquote><pre>template &lt;class <del>charT, class traits</del> <ins>Istream</ins>, class T&gt;
-   <del>basic_istream&lt;charT, traits&gt;&amp;</del> <ins>Istream&amp;&amp;</ins>
-   operator&gt;&gt;(<del>basic_istream&lt;charT, traits&gt;</del> <ins>Istream</ins>&amp;&amp; is, T&amp; x);
- </pre>
- <blockquote>
- <p>
- 1 <i>Effects:</i> <tt>is &gt;&gt; x</tt>
- </p>
- <p>
- 2 <i>Returns:</i> <tt><ins>std::move(</ins>is<ins>)</ins></tt>
- </p>
- <p><ins>
- 3 <i>Remarks:</i> This signature shall participate in overload resolution if
- and only if <tt>Istream</tt> is not an lvalue reference type and is derived from
- <tt>ios_base</tt>.
- </ins></p>
- </blockquote>
- </blockquote>
- 
- <p>
- Change 27.7.2.9 [ostream.rvalue]:
- </p>
- 
- <blockquote><pre>template &lt;class <del>charT, class traits</del> <ins>Ostream</ins>, class T&gt;
-   <del>basic_ostream&lt;charT, traits&gt;&amp;</del> <ins>Ostream&amp;&amp;</ins>
-   operator&lt;&lt;(<del>basic_ostream&lt;charT, traits&gt;</del> <ins>Ostream</ins>&amp;&amp; os, const T&amp; x);
- </pre>
- <blockquote>
- <p>
- 1 <i>Effects:</i> <tt>os &lt;&lt; x</tt>
- </p>
- <p>
- 2 <i>Returns:</i> <tt><ins>std::move(</ins>os<ins>)</ins></tt>
- </p>
- <p><ins>
- 3 <i>Remarks:</i> This signature shall participate in overload resolution if
- and only if <tt>Ostream</tt> is not an lvalue reference type and is derived from
- <tt>ios_base</tt>.
- </ins></p>
- </blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1210"></a>1210. iterator reachability should not require a container</h3>
- <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-18 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- p6 Iterator requirements 24.2 [iterator.requirements]
- </p>
- 
- <blockquote>
- An iterator <tt>j</tt> is called reachable from an iterator <tt>i</tt> if and only if
- there is a finite sequence of applications of the expression <tt>++i</tt> that
- makes <tt>i == j</tt>. If <tt>j</tt> is reachable from <tt>i</tt>, they refer to the same
- container.
- </blockquote>
- 
- <p>
- A good example would be stream iterators, which do not refer to a
- container.  Typically, the end iterator from a range of stream iterators
- will compare equal for many such ranges.  I suggest striking the second
- sentence.
- </p>
- 
- <p>
- An alternative wording might be:
- </p>
- 
- <blockquote>
- If <tt>j</tt> is reachable from <tt>i</tt>, and both <tt>i</tt> and
- <tt>j</tt> are dereferencable iterators, then they refer to the same
- range.
- </blockquote>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change 24.2 [iterator.requirements], p6:
- </p>
- 
- <blockquote>
- An iterator <tt>j</tt> is called <i>reachable</i> from an iterator
- <tt>i</tt> if and only if there is a finite sequence of applications of
- the expression <tt>++i</tt> that makes <tt>i == j</tt>. <del>If
- <tt>j</tt> is reachable from <tt>i</tt>, they refer to the same
- container.</del>
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1211"></a>1211. move iterators should be restricted as input iterators</h3>
- <p><b>Section:</b> 24.5.3.1 [move.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-18 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#move.iterator">issues</a> in [move.iterator].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- I contend that while we can support both bidirectional and random access
- traversal, the category of a move iterator should never be better than
- <tt>input_iterator_tag</tt>.
- </p>
- 
- <p>
- The contentious point is that you cannot truly have a multipass property
- when values are moved from a range.  This is contentious if you view a
- moved-from object as still holding a valid value within the range.  
- </p>
- 
- <p>
- The second reason comes from the Forward Iterator requirements table:
- </p>
- 
- <blockquote>
- <p>
- Forward iterators 24.2.5 [forward.iterators]
- </p>
- 
- <p>
- Table 102 -- Forward iterator requirements
- </p>
- 
- <blockquote>
- For expression <tt>*a</tt> the return type is:
- "<tt>T&amp;</tt> if <tt>X</tt> is mutable, otherwise <tt>const T&amp;</tt>"
- </blockquote>
- </blockquote>
- 
- <p>
- There is a similar constraint on <tt>a-&gt;m</tt>.
- </p>
- 
- <p>
- There is no support for rvalue references, nor do I believe their should
- be.  Again, opinions may vary but either this table or the definition of
- <tt>move_iterator</tt> need updating.
- </p>
- 
- <p>
- Note: this requirement probably need updating anyway if we wish to
- support proxy iterators but I am waiting to see a new working paper
- before filing that issue.
- </p>
- 
- <p><i>[
- 2009-10 post-Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- Move to Open. Howard to put his rationale mentioned above into the issue
- as a note.
- </blockquote>
- 
- <p><i>[
- 2009-10-26 Howard adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- <tt>vector::insert(pos, iter, iter)</tt> is significantly more effcient when
- <tt>iter</tt> is a random access iterator, as compared to when it is an
- input iterator.
- </p>
- 
- <p>
- When <tt>iter</tt> is an input iterator, the best algorithm
- is to append the inserted range to the end of the <tt>vector</tt> using
- <tt>push_back</tt>.  This may involve several reallocations before the input
- range is exhausted.  After the append, then one can use <tt>std::rotate</tt>
- to place the inserted range into the correct position in the vector.
- </p>
- 
- <p>
- But when <tt>iter</tt> is a random access iterator, the best algorithm
- is to first compute the size of the range to be inserted (<tt>last - first</tt>),
- do a buffer reallocation if necessary, scoot existing elements in the <tt>vector</tt>
- down to make the "hole", and then insert the new elements directly to their correct
- place.
- </p>
- 
- <blockquote><b>
- The insert-with-random-access-iterators algorithm is considerably more efficient
- than the insert-with-input-iterators algorithm
- </b></blockquote>
- 
- <p>
- Now consider:
- </p>
- 
- <blockquote><pre>vector&lt;A&gt; v;
- <font color="#C80000">//  ... build up a large vector of A ...</font>
- vector&lt;A&gt; temp;
- <font color="#C80000">//  ... build up a large temporary vector of A to later be inserted ...</font>
- typedef move_iterator&lt;vector&lt;A&gt;::iterator&gt; MI;
- <font color="#C80000">//  Now insert the temporary elements:</font>
- v.insert(v.begin() + N, MI(temp.begin()), MI(temp.end()));
- </pre></blockquote>
- 
- <p>
- A major motivation for using <tt>move_iterator</tt> in the above example is the
- expectation that <tt>A</tt> is cheap to move but expensive to copy.  I.e. the
- customer is looking for <em>high performance</em>.  If we allow <tt>vector::insert</tt>
- to subtract two <tt>MI</tt>'s to get the distance between them, the customer enjoys
- substantially better performance, compared to if we say that <tt>vector::insert</tt>
- can not subtract two <tt>MI</tt>'s.
- </p>
- 
- <p>
- I can find no rationale for not giving this performance boost to our customers.
- Therefore I am strongly against restricting <tt>move_iterator</tt> to the
- <tt>input_iterator_tag</tt> category.
- </p>
- 
- <p>
- I believe that the requirement that forward
- iterators have a dereference that returns an lvalue reference to cause unacceptable
- pessimization.  For example <tt>vector&lt;bool&gt;::iterator</tt> also does not return
- a <tt>bool&amp;</tt> on dereference.  Yet I am not aware of a single vendor that
- is willing to ship <tt>vector&lt;bool&gt;::iterator</tt> as an input iterator.
- Everyone classifies it as a random access iterator.  Not only does this not
- cause any problems, it prevents significant performance problems.
- </p>
- 
- </blockquote>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Class template move_iterator 24.5.3.1 [move.iterator]
- </p>
- 
- <blockquote><pre>namespace std {
- template &lt;class Iterator&gt;
- class move_iterator {
- public:
-  ...
-  typedef <del>typename iterator_traits&lt;Iterator&gt;::iterator_category</del> <ins>input_iterator_tag</ins> iterator_category;
- </pre></blockquote>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1212"></a>1212. result of post-increment/decrement operator</h3>
- <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-18 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Forward iterator and bidirectional iterator place different requirements on the result of post-increment/decrement operator.  The same form should be used in each case.
- </p>
- 
- <p>
- Merging row from:
- </p>
- 
- <blockquote><pre>Table 102 -- Forward iterator requirements
- Table 103 -- Bidirectional iterator requirements
- 
-     r++ : convertible to const X&amp;
-     r-- : convertible to const X&amp;
-     
-     *r++ : T&amp; if X is mutable, otherwise const T&amp;
-     *r-- : convertible to T
- </pre></blockquote>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1217"></a>1217. Quaternion support</h3>
- <p><b>Section:</b> 26.4 [complex.numbers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Ted Shaneyfelt <b>Opened:</b> 2009-09-26 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.numbers">issues</a> in [complex.numbers].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Concerning mathematically proper operation of the type:
- </p>
- 
- <blockquote><pre>complex&lt;complex&lt;T&gt; &gt;
- </pre></blockquote>
- 
- <p>
- Generally accepted mathematical semantics of such a construct correspond
- to quaternions through Cayly-Dickson construct
- </p>
- 
- <blockquote><pre>(w+xi) + (y+zi) j
- </pre></blockquote>
- 
- <p>
- The proper implementation seems straightforward by adding a few
- declarations like those below. I have included operator definition for
- combining real scalars and complex types, as well, which seems
- appropriate, as algebra of complex numbers allows mixing complex and
- real numbers with operators. It also allows for constructs such as
- <tt>complex&lt;double&gt; i=(0,1),  x = 12.34 + 5*i;</tt>
- </p>
- 
- <p>
- Quaternions are often used in areas such as computer graphics, where,
- for example, they avoid the problem of Gimbal lock when rotating objects
- in 3D space, and can be more efficient than matrix multiplications,
- although I am applying them to a different field.
- </p>
- 
- <pre>/////////////////////////ALLOW OPERATORS TO COMBINE REAL SCALARS AND COMPLEX VALUES /////////////////////////
- template&lt;typename T,typename S&gt; complex&lt;T&gt; operator+(const complex&lt;T&gt; x,const S a) {
-     complex&lt;T&gt; result(x.real()+a, x.imag());
-     return result;
- }
- template&lt;typename T,typename S&gt; complex&lt;T&gt; operator+(const S a,const complex&lt;T&gt; x) {
-     complex&lt;T&gt; result(a+x.real(), x.imag());
-     return result;
- }
- template&lt;typename T,typename S&gt; complex&lt;T&gt; operator-(const complex&lt;T&gt; x,const S a) {
-     complex&lt;T&gt; result(x.real()-a, x.imag());
-     return result;
- }
- template&lt;typename T,typename S&gt; complex&lt;T&gt; operator-(const S a,const complex&lt;T&gt; x) {
-     complex&lt;T&gt; result(a-x.real(), x.imag());
-     return result;
- }
- template&lt;typename T,typename S&gt; complex&lt;T&gt; operator*(const complex&lt;T&gt; x,const S a) {
-     complex&lt;T&gt; result(x.real()*a, x.imag()*a);
-     return result;
- }
- template&lt;typename T,typename S&gt; complex&lt;T&gt; operator*(const S a,const complex&lt;T&gt; x) {
-     complex&lt;T&gt; result(a*x.real(), a*x.imag());
-     return result;
- }
- 
- /////////////////////////PROPERLY IMPLEMENT QUATERNION SEMANTICS/////////////////////////
- template&lt;typename T&gt; double normSq(const complex&lt;complex&lt;T&gt; &gt;q) {
-     return q.real().real()*q.real().real()
-          + q.real().imag()*q.real().imag()
-          + q.imag().real()*q.imag().real()
-          + q.imag().imag()*q.imag().imag();
- }
- template&lt;typename T&gt; double norm(const complex&lt;complex&lt;T&gt; &gt;q) {
-     return sqrt(normSq(q));
- }
- /////// Cayley-Dickson Construction
- template&lt;typename T&gt; complex&lt;complex&lt;T&gt; &gt; conj(const complex&lt;complex&lt;T&gt; &gt; x) {
-     complex&lt;complex&lt;T&gt; &gt; result(conj(x.real()),-x.imag());
-     return result;
- }
- template&lt;typename T&gt; complex&lt;complex&lt;T&gt; &gt; operator*(const complex&lt;complex&lt;T&gt; &gt; ab,const complex&lt;complex&lt;T&gt; &gt; cd) {
-     complex&lt;T&gt; re(ab.real()*cd.real()-conj(cd.imag())*ab.imag());
-     complex&lt;T&gt; im(cd.imag()*ab.real()+ab.imag()*conj(cd.real()));
-     complex&lt;complex&lt;double&gt; &gt; q(re,im);
-     return q;
- }
- //// Quaternion division
- template&lt;typename S,typename T&gt; complex&lt;complex&lt;T&gt; &gt; operator/(const complex&lt;complex&lt;T&gt; &gt; q,const S a) {
-     return q * (1/a);
- }
- template&lt;typename S,typename T&gt; complex&lt;complex&lt;T&gt; &gt; operator/(const S a,const complex&lt;complex&lt;T&gt; &gt; q) {
-     return a*conj(q)/normSq(q);
- }
- template&lt;typename T&gt; complex&lt;complex&lt;T&gt; &gt; operator/(const complex&lt;complex&lt;T&gt; &gt; n, const complex&lt;complex&lt;T&gt; &gt; d) {
-     return n * (conj(d)/normSq(d));
- }
- </pre>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Future.  There is no consensus or time to move this into C++0X.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1219"></a>1219. unique_lock::lock and resource_deadlock_would_occur</h3>
! <p><b>Section:</b> 30.4.2.2.2 [thread.lock.unique.locking] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.lock.unique.locking">issues</a> in [thread.lock.unique.locking].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1159">1159</a></p>
  <p><b>Discussion:</b></p>
  
  
--- 33030,33041 ----
  
  
  <hr>
  <h3><a name="1219"></a>1219. unique_lock::lock and resource_deadlock_would_occur</h3>
! <p><b>Section:</b> 30.4.2.2.2 [thread.lock.unique.locking] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.lock.unique.locking">issues</a> in [thread.lock.unique.locking].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1159">1159</a></p>
  <p><b>Discussion:</b></p>
  
  
*************** ownership_level/ would fix it.
*** 43582,43588 ****
  </p>
  
  <p><i>[
! 2009-11-11 Alisdair notes that this issue is very closely related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1159">1159</a>,
  if not a dup.
  ]</i></p>
  
--- 33054,33060 ----
  </p>
  
  <p><i>[
! 2009-11-11 Alisdair notes that this issue is very closely related to <a href="lwg-defects.html#1159">1159</a>,
  if not a dup.
  ]</i></p>
  
*************** if not a dup.
*** 43602,43611 ****
  
  <hr>
  <h3><a name="1223"></a>1223. condition_variable_any lock matching?</h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  For <tt>condition_variable_any</tt>, must all lock arguments to concurrent wait calls
--- 33074,33083 ----
  
  <hr>
  <h3><a name="1223"></a>1223. condition_variable_any lock matching?</h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  For <tt>condition_variable_any</tt>, must all lock arguments to concurrent wait calls
*************** internal synchronization anyway.
*** 43639,43648 ****
  
  <hr>
  <h3><a name="1224"></a>1224. condition_variable_any support for recursive mutexes?</h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  For <tt>condition_variable_any</tt>, are recursive mutexes allowed? (I think "no")
--- 33111,33120 ----
  
  <hr>
  <h3><a name="1224"></a>1224. condition_variable_any support for recursive mutexes?</h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  For <tt>condition_variable_any</tt>, are recursive mutexes allowed? (I think "no")
*************** mechanism is used to synchronize the dat
*** 43673,44042 ****
  
  
  <hr>
- <h3><a name="1225"></a>1225. C++0x result_of issue </h3>
- <p><b>Section:</b> X [func.ret] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Sebastian Gesemann <b>Opened:</b> 2009-10-05 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.ret">issues</a> in [func.ret].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- I think the text about <tt>std::result_of</tt> could be a little more precise.
- Quoting from
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>...
- </p>
- 
- <blockquote>
- <p>
- X [func.ret] Function object return types
- </p>
- 
- <pre>template&lt;class&gt; class result_of;
- 
- template&lt;class Fn, class... ArgTypes&gt;
- class result_of&lt;Fn(ArgTypes...)&gt; {
- public:
-   typedef <i>see below</i> type;
- };
- </pre>
- 
- <p>
- Given an rvalue <tt>fn</tt> of type <tt>Fn</tt> and values <tt>t1, t2,
- ..., tN</tt> of types <tt>T1, T2, ... TN</tt> in <tt>ArgTypes</tt>
- respectivly, the <tt>type</tt> member is the result type of the
- expression <tt>fn(t1,t2,...,tN)</tt>. the values <tt>ti</tt> are lvalues
- when the corresponding type <tt>Ti</tt> is an lvalue-reference type, and
- rvalues otherwise.
- </p>
- </blockquote>
- 
- <p>
- This text doesn't seem to consider lvalue reference types for <tt>Fn</tt>.
- Also, it's not clear whether this class template can be used for
- "SFINAE" like <tt>std::enable_if</tt>. Example:
- </p>
- 
- <blockquote><pre>template&lt;typename Fn, typename... Args&gt;
- typename std::result_of&lt;Fn(Args...)&gt;::type
- apply(Fn &amp;&amp; fn, Args &amp;&amp; ...args)
- {
-   // Fn may be an lvalue reference, too
-   return std::forward&lt;Fn&gt;(fn)(std::forward&lt;Args&gt;(args)...);
- }
- </pre></blockquote>
- 
- <p>
- Either <tt>std::result_of&lt;...&gt;</tt> can be instantiated and simply may not have
- a typedef "<tt>type</tt>" (--&gt;SFINAE) or instantiating the class template for
- some type combinations will be a "hard" compile-time error.
- </p>
- 
- <p><i>[
- 2010-02-14 Daniel adds:
- ]</i></p>
- 
- 
- <blockquote>
- This issue should be considered resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1270">1270</a>.  The wish to change <tt>result_of</tt> into a compiler-support
- trait was beyond the actual intention of the submitter Sebastian.
- </blockquote>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial, rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1270">1270</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- <p><i>[
- These changes will require compiler support
- ]</i></p>
- 
- 
- <p>
- Change X [func.ret]:
- </p>
- 
- <blockquote><pre>template&lt;class&gt; class result_of; // <i>undefined</i>
- 
- template&lt;class Fn, class... ArgTypes&gt;
- class result_of&lt;Fn(ArgTypes...)&gt; {
- public:
-   <del>typedef</del> <i>see below</i> <del>type;</del>
- };
- </pre>
- 
- <p><del>
- Given an rvalue <tt>fn</tt> of type <tt>Fn</tt> and values <tt>t1, t2,
- ..., tN</tt> of types <tt>T1, T2, ... TN</tt> in <tt>ArgTypes</tt>
- respectivly, the <tt>type</tt> member is the result type of the
- expression <tt>fn(t1,t2,...,tN)</tt>. the values <tt>ti</tt> are lvalues
- when the corresponding type <tt>Ti</tt> is an lvalue-reference type, and
- rvalues otherwise.
- </del></p>
- 
- <p>
- <ins>The class template <tt>result_of</tt> shall meet the requirements of a
- <i>TransformationTrait</i>: Given the types <tt>Fn</tt>, <tt>T1</tt>, <tt>T2</tt>, ..., <tt>TN</tt> every
- template specialization <tt>result_of&lt;Fn(T1,T2,...,TN)&gt;</tt> shall define the
- member typedef type equivalent to <tt>decltype(<i>RE</i>)</tt> if and only if
- the expression <tt><i>RE</i></tt>
- </ins></p>
- 
- <blockquote><pre><ins>
- value&lt;Fn&gt;() ( value&lt;T1&gt;(), value&lt;T2&gt;(), ... value&lt;TN&gt;()  )
- </ins></pre></blockquote>
- 
- <p><ins>
- would be well-formed. Otherwise, there shall be no member typedef
- <tt>type</tt> defined.
- </ins></p>
- 
- </blockquote>
-  
- <p><i>[
- The <tt>value&lt;&gt;</tt> helper function is a utility Daniel Krügler
- proposed in
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2958.html">N2958</a>.
- ]</i></p>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1226"></a>1226. Incomplete changes of #890</h3>
- <p><b>Section:</b> 30.6.2 [futures.errors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-10-05 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- Defect issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a> overlooked to adapt the <tt>future_category</tt> from
- 30.6.1 [futures.overview] and 30.6.2 [futures.errors]:
- </p>
- 
- <blockquote><pre>extern const error_category* const future_category;
- </pre></blockquote>
- 
- <p>
- which should be similarly transformed into function form.
- </p>
- 
- <p><i>[
- 2009-10-27 Howard:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to Tentatively Ready after 5 positive votes on c++std-lib.
- </blockquote>
- 
- <p><i>[
- 2009-11-11 Daniel adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- I just observe that the proposed resolution of this issue
- is incomplete and needs to reworded. The problem is that the
- corresponding declarations
- </p>
- 
- <blockquote><pre>constexpr error_code make_error_code(future_errc e);
- constexpr error_condition make_error_condition(future_errc e);
- </pre></blockquote>
- 
- <p>
- as constexpr functions are incompatible to the requirements of constexpr
- functions given their specified implementation. Note that the incompatibility
- is <em>not</em> a result of the modifications proposed by the issue resolution,
- but already existed within the
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>
- state where we have
- </p>
- 
- <blockquote><pre>extern const error_category* const future_category;
- </pre></blockquote>
- 
- <p>
- combined with
- </p>
- 
- <blockquote><pre>constexpr error_code make_error_code(future_errc e);
- </pre>
- <blockquote>
- 3 <i>Returns:</i> <tt>error_code(static_cast&lt;int&gt;(e), *future_category)</tt>.
- </blockquote>
- 
- <pre>constexpr error_code make_error_condition(future_errc e);
- </pre>
- <blockquote>
- 4 <i>Returns:</i> <tt>error_condition(static_cast&lt;int&gt;(e), *future_category)</tt>.
- </blockquote>
- </blockquote>
- 
- <p>
- Neither is any of the constructors of <tt>error_code</tt> and <tt>error_condition</tt>
- constexpr, nor does the expression <tt>*future_category</tt> satisfy the
- requirements for a constant expression (5.19 [expr.const]/2 bullet 6 in
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>).
- </p>
- 
- <p>
- The simple solution is just to remove the constexpr qualifiers for both
- functions, which makes sense, because none of the remaining <tt>make_error_*</tt>
- overloads in the library is constexpr. One might consider to realize that
- those <tt>make_*</tt> functions could satisfy the constexpr requirements, but this
- looks not like an easy task to me, because it would need to rely on a not
- yet existing language feature. If such a change is wanted, a new issue
- should be opened after the language extension approval (if at all) [1].
- </p>
- 
- <p>
- If no-one complaints I would like to ask Howard to add the following
- modifications to this issue, alternatively a new issue could be opened but I
- don't know what the best solution is that would cause as little overhead
- as possible.
- </p>
- <p>
- What-ever the route is, the following is my proposed resolution for this issue
- interaction part of the story:
- </p>
- 
- <blockquote>
- <p>
- In 30.6.1 [futures.overview]/1, Header <tt>&lt;future&gt;</tt> synopsis <em>and</em>
- in 30.6.2 [futures.errors]/3+4
- change as indicated:
- </p>
- 
- <blockquote><pre><del>constexpr</del> error_code make_error_code(future_errc e);
- <del>constexpr</del> error_condition make_error_condition(future_errc e);
- </pre></blockquote>
- </blockquote>
- 
- <p>
- [1] Let me add that we have a related  NAD issue here: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>
- so the chances for realization are little IMO.
- </p>
- 
- <p><i>[
- Howard: I've updated the proposed wording as Daniel suggests and set to Review.
- ]</i></p>
- 
- </blockquote>
- 
- <p><i>[
- 2009-11-13 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
- ]</i></p>
- 
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to NAD Editorial.  Rationale added below.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by N3058.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <ol>
- <li>
- <p>
- Change in 30.6.1 [futures.overview], header <tt>&lt;future&gt;</tt> synopsis:
- </p>
- 
- <blockquote><pre><del>extern</del> const error_category<ins>&amp;</ins><del>* const</del> future_category<ins>()</ins>;
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- In 30.6.1 [futures.overview]/1, Header <tt>&lt;future&gt;</tt> synopsis 
- change as indicated:
- </p>
- 
- <blockquote><pre><del>constexpr</del> error_code make_error_code(future_errc e);
- <del>constexpr</del> error_condition make_error_condition(future_errc e);
- </pre></blockquote>
- </li>
- 
- <li>
- <p>
- Change in 30.6.2 [futures.errors]:
- </p>
- 
- <blockquote><pre><del>extern</del> const error_category<ins>&amp;</ins><del>* const</del> future_category<ins>()</ins>;
- </pre>
- 
- <blockquote>
- <p>
- <del>1- <tt>future_category</tt> shall point to a statically initialized object
- of a type derived from class <tt>error_category</tt>.</del>
- </p>
- <p>
- <ins>1- <i>Returns:</i> A reference to an object of a type
- derived from class <tt>error_category</tt>.</ins>
- </p>
- </blockquote>
- 
- <pre><del>constexpr</del> error_code make_error_code(future_errc e);
- </pre>
- 
- <blockquote>
- 3 <i>Returns:</i> <tt>error_code(static_cast&lt;int&gt;(e),
- <del>*</del>future_category<ins>()</ins>)</tt>.
- </blockquote>
- 
- <pre><del>constexpr</del> error_<del>code</del><ins>condition</ins> make_error_condition(future_errc e);
- </pre>
- 
- <blockquote>
- 4 <i>Returns:</i> <tt>error_condition(static_cast&lt;int&gt;(e),
- <del>*</del>future_category<ins>()</ins>)</tt>.
- </blockquote>
- </blockquote>
- </li>
- </ol>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1228"></a>1228. User-specialized nothrow type traits</h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-10-07 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! According to p1 20.7.2 [meta.type.synop]:
  </p>
  
! <blockquote>
  The behavior of a program that adds specializations for any of the class
  templates defined in this subclause is undefined unless otherwise
  specified.
! </blockquote>
  
  <p>
  I believe we should 'otherwise specify' for the nothrow traits, are
--- 33145,33166 ----
  
  
  <hr>
  <h3><a name="1228"></a>1228. User-specialized nothrow type traits</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! According to p1 20.10.2 [meta.type.synop]:
  </p>
  
! <blockquote><p>
  The behavior of a program that adds specializations for any of the class
  templates defined in this subclause is undefined unless otherwise
  specified.
! </p></blockquote>
  
  <p>
  I believe we should 'otherwise specify' for the nothrow traits, are
*************** information than the compiler.
*** 44049,44060 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Open.  Definitely need to give the users the ability to ensure
  that the traits give the right answers. Unsure we want to give them the
  ability to say this in more than one way. Believes the noexcept proposal
  already gives this.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD, rationale added below.
--- 33173,33184 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Open.  Definitely need to give the users the ability to ensure
  that the traits give the right answers. Unsure we want to give them the
  ability to say this in more than one way. Believes the noexcept proposal
  already gives this.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD, rationale added below.
*************** is superior.
*** 44076,44088 ****
  Add the following comment:
  </p>
  
! <blockquote>
  user specialization permitted to derive from <tt>std::true_type</tt> when the
  operation is known not to throw.
! </blockquote>
  
  <p>
! to the following traits in 20.7.4.3 [meta.unary.prop] Table 43 Type
  property predicates.
  </p>
  
--- 33200,33212 ----
  Add the following comment:
  </p>
  
! <blockquote><p>
  user specialization permitted to derive from <tt>std::true_type</tt> when the
  operation is known not to throw.
! </p></blockquote>
  
  <p>
! to the following traits in 20.10.4.3 [meta.unary.prop] Table 43 Type
  property predicates.
  </p>
  
*************** This may require a new Comments column
*** 44091,44097 ****
  ]</i></p>
  
  
! <blockquote><pre>has_nothrow_default_constructor
  has_nothrow_copy_constructor
  has_nothrow_assign
  </pre></blockquote>
--- 33215,33222 ----
  ]</i></p>
  
  
! <blockquote><pre>
! has_nothrow_default_constructor
  has_nothrow_copy_constructor
  has_nothrow_assign
  </pre></blockquote>
*************** has_nothrow_assign
*** 44101,44292 ****
  
  
  <hr>
- <h3><a name="1229"></a>1229. <tt>error_code operator=</tt> typo</h3>
- <p><b>Section:</b> 19.5.2.3 [syserr.errcode.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
-  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2009-10-08 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>
- 19.5.2.1 [syserr.errcode.overview] and 19.5.2.3 [syserr.errcode.modifiers] say:
- </p>
- 
- <blockquote><pre> 
- template &lt;class ErrorCodeEnum&gt;
-   typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value&gt;::type&amp;
-     operator=(ErrorCodeEnum e);
- </pre></blockquote>
- 
- <p>
- They should say:
- </p>
- 
- <blockquote><pre> 
- template &lt;class ErrorCodeEnum&gt;
-   typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value, error_code&gt;::type&amp;
-     operator=(ErrorCodeEnum e);
- </pre></blockquote>
- 
- <p>
- Or (I prefer this form):
- </p>
-  
- <blockquote><pre> 
- template &lt;class ErrorCodeEnum&gt;
-   typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value, error_code&amp;&gt;::type
-     operator=(ErrorCodeEnum e);
- </pre></blockquote>
- 
- <p>
- This is because <tt>enable_if</tt> is declared as (20.7.7.6 [meta.trans.other]):
- </p>
-  
- <blockquote><pre> 
- template &lt;bool B, class T = void&gt; struct enable_if;
- </pre></blockquote>
- 
- <p>
- So, the current wording makes <tt>operator=</tt> return
- <tt>void&amp;</tt>, which is not good.
- </p>
- 
- <p> 
- 19.5.2.3 [syserr.errcode.modifiers]/4 says
- </p>
- 
- <blockquote>
- <i>Returns:</i> <tt>*this</tt>.
- </blockquote>
- <p>
- which is correct.
- </p>
- 
- <p>
- Additionally,
- </p>
- 
- <p>
- 19.5.3.1 [syserr.errcondition.overview]/1 says:
- </p>
-  
- <blockquote><pre> 
- template&lt;typename ErrorConditionEnum&gt;
-   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;, error_code&gt;::type &amp;
-     operator=( ErrorConditionEnum e );
- </pre></blockquote>
- 
- <p>
- Which contains several problems (<tt>typename</tt> versus <tt>class</tt>
- inconsistency, lack of <tt>::value</tt>, <tt>error_code</tt> instead of
- <tt>error_condition</tt>), while 19.5.3.3 [syserr.errcondition.modifiers] says:
- </p>
-  
- <blockquote><pre> 
- template &lt;class ErrorConditionEnum&gt;
-   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value&gt;::type&amp;
-     operator=(ErrorConditionEnum e);
- </pre></blockquote>
- 
- <p>
- Which returns <tt>void&amp;</tt>.  They should both say:
- </p>
-  
- <blockquote><pre> 
- template &lt;class ErrorConditionEnum&gt;
-   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value, error_condition&gt;::type&amp;
-     operator=(ErrorConditionEnum e);
- </pre></blockquote>
- 
- <p>
- Or (again, I prefer this form):
- </p>
- 
- <blockquote><pre> 
- template &lt;class ErrorConditionEnum&gt;
-   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value, error_condition&amp;&gt;::type
-     operator=(ErrorConditionEnum e);
- </pre></blockquote>
- 
- <p>
- Additionally, 19.5.3.3 [syserr.errcondition.modifiers] lacks a
- "<i>Returns:</i> <tt>*this</tt>." paragraph, which is presumably
- necessary.
- </p>
- 
- <p><i>[
- 2009-10-18 Beman adds:
- ]</i></p>
- 
- 
- <blockquote>
- The proposed resolution for issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1237">1237</a> makes this issue
- moot, so it should become NAD.
- </blockquote>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD, solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1237">1237</a>.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- <p>
- Change 19.5.2.1 [syserr.errcode.overview] and 19.5.2.3 [syserr.errcode.modifiers]:
- </p>
- 
- <blockquote><pre>template &lt;class ErrorCodeEnum&gt;
-   typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value<ins>, error_code&amp;</ins>&gt;::type<del>&amp;</del>
-     operator=(ErrorCodeEnum e);
- </pre></blockquote>
- 
- <p>
- Change 19.5.3.1 [syserr.errcondition.overview]:
- </p>
- 
- <blockquote><pre>template&lt;<del>typename</del> <ins>class</ins> ErrorConditionEnum&gt;
-   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;<ins>::value</ins>, error_co<ins>ndition</ins><del>de</del><ins>&amp;</ins>&gt;::type<del> &amp;</del>
-     operator=( ErrorConditionEnum e );
- </pre></blockquote>
- 
- <p>
- Change 19.5.3.3 [syserr.errcondition.modifiers]:
- </p>
- 
- <blockquote><pre>template &lt;class ErrorConditionEnum&gt;
-   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value<ins>, error_condition&amp;</ins>&gt;::type<del>&amp;</del>
-     operator=(ErrorConditionEnum e);
- </pre>
- <blockquote>
- <p>
- <i>Postcondition:</i> <tt>*this == make_error_condition(e)</tt>.
- </p>
- <p><ins>
- <i>Returns:</i> <tt>*this</tt>.
- </ins></p>
- <p>
- <i>Throws:</i> Nothing.
- </p>
- </blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1230"></a>1230. <tt>mem_fn</tt> and variadic templates</h3>
! <p><b>Section:</b> 20.8.13 [func.memfn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-10-09 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.memfn">issues</a> in [func.memfn].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a></p>
  <p><b>Discussion:</b></p>
  
  
--- 33226,33237 ----
  
  
  <hr>
  <h3><a name="1230"></a>1230. <tt>mem_fn</tt> and variadic templates</h3>
! <p><b>Section:</b> 20.9.11 [func.memfn] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-10-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.memfn">issues</a> in [func.memfn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#920">920</a></p>
  <p><b>Discussion:</b></p>
  
  
*************** arbitrary number of such overloads.  I b
*** 44305,44311 ****
  remark and add a second signature:
  </p>
  
! <blockquote><pre>template&lt;class R, class T, typename ... ArgTypes&gt;
    unspecified mem_fn(R (T::*pm)(ArgTypes...));
  </pre></blockquote>
  
--- 33250,33257 ----
  remark and add a second signature:
  </p>
  
! <blockquote><pre>
! template&lt;class R, class T, typename ... ArgTypes&gt;
    unspecified mem_fn(R (T::*pm)(ArgTypes...));
  </pre></blockquote>
  
*************** syntax.
*** 44316,44331 ****
  </p>
  
  <p><i>[
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a> as a similar proposed resolution.
  ]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! Add to 20.8 [function.objects] and 20.8.13 [func.memfn]:
! 
! 
! <blockquote><pre>template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::* pm)
  
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::* pm)(Args...));</ins>
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::* pm)(Args...) const);</ins>
--- 33262,33278 ----
  </p>
  
  <p><i>[
! <a href="lwg-defects.html#920">920</a> as a similar proposed resolution.
  ]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! Add to 20.9 [function.objects] and 20.9.11 [func.memfn]:
! </p>
! <blockquote><pre>
! template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::* pm)
  
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::* pm)(Args...));</ins>
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::* pm)(Args...) const);</ins>
*************** Add to 20.8 [function.objects] and 20.8.
*** 44344,44367 ****
  </pre></blockquote>
  
  <p>
! Strike 20.8.13 [func.memfn], p5:
  </p>
  
! <blockquote>
  <del><i>Remarks:</i> Implementations may implement <tt>mem_fn</tt> as a set
  of overloaded function templates.</del>
! </blockquote>
  
  
  
  
  <hr>
  <h3><a name="1232"></a>1232. Still <tt>swap</tt>'s with rvalue-references</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-10-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current library contains still rvalue reference-swaps that seem to be
--- 33291,33316 ----
  </pre></blockquote>
  
  <p>
! Strike 20.9.11 [func.memfn], p5:
  </p>
  
! <blockquote><p>
  <del><i>Remarks:</i> Implementations may implement <tt>mem_fn</tt> as a set
  of overloaded function templates.</del>
! </p></blockquote>
! 
! 
  
  
  
  
  <hr>
  <h3><a name="1232"></a>1232. Still <tt>swap</tt>'s with rvalue-references</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-10-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current library contains still rvalue reference-swaps that seem to be
*************** overlooked in the process of switching b
*** 44373,44381 ****
  ]</i></p>
  
  
! <blockquote>
  Editor accepts as NAD Editorial.
! </blockquote>
  
  
  
--- 33322,33330 ----
  ]</i></p>
  
  
! <blockquote><p>
  Editor accepts as NAD Editorial.
! </p></blockquote>
  
  
  
*************** Editor accepts as NAD Editorial.
*** 44383,44392 ****
  <ol>
  <li>
  <p>
! Change 20.3.5 [pairs]/1 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T1, class T2&gt;
  struct pair {
    ...
    void swap(pair&amp;<del>&amp;</del> p);
--- 33332,33342 ----
  <ol>
  <li>
  <p>
! Change 20.3 [pairs]/1 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T1, class T2&gt;
  struct pair {
    ...
    void swap(pair&amp;<del>&amp;</del> p);
*************** struct pair {
*** 44396,44405 ****
  
  <li>
  <p>
! Change 20.3.5 [pairs] before p. 17 as indicated:
  </p>
  
! <blockquote><pre>void swap(pair&amp;<del>&amp;</del> p);
  </pre></blockquote>
  
  </li>
--- 33346,33356 ----
  
  <li>
  <p>
! Change 20.3 [pairs] before p. 17 as indicated:
  </p>
  
! <blockquote><pre>
! void swap(pair&amp;<del>&amp;</del> p);
  </pre></blockquote>
  
  </li>
*************** Change 20.3.5 [pairs] before p. 17 as in
*** 44407,44416 ****
  <li>
  
  <p>
! Change 20.3.5 [pairs] before p. 21 as indicated:
  </p>
  
! <blockquote><pre>template&lt;class T1, class T2&gt; void swap(pair&lt;T1, T2&gt;&amp; x, pair&lt;T1, T2&gt;&amp; y);
  <del>template&lt;class T1, class T2&gt; void swap(pair&lt;T1, T2&gt;&amp;&amp; x, pair&lt;T1, T2&gt;&amp; y);</del>
  <del>template&lt;class T1, class T2&gt; void swap(pair&lt;T1, T2&gt;&amp; x, pair&lt;T1, T2&gt;&amp;&amp; y);</del>
  </pre></blockquote>
--- 33358,33368 ----
  <li>
  
  <p>
! Change 20.3 [pairs] before p. 21 as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;class T1, class T2&gt; void swap(pair&lt;T1, T2&gt;&amp; x, pair&lt;T1, T2&gt;&amp; y);
  <del>template&lt;class T1, class T2&gt; void swap(pair&lt;T1, T2&gt;&amp;&amp; x, pair&lt;T1, T2&gt;&amp; y);</del>
  <del>template&lt;class T1, class T2&gt; void swap(pair&lt;T1, T2&gt;&amp; x, pair&lt;T1, T2&gt;&amp;&amp; y);</del>
  </pre></blockquote>
*************** Change 20.3.5 [pairs] before p. 21 as in
*** 44422,44428 ****
  Change 20.4.1 [tuple.general]/2, header <tt>&lt;tuple&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>// 20.5.2.9, specialized algorithms:
  template &lt;class... Types&gt;
  void swap(tuple&lt;Types...&gt;&amp; x, tuple&lt;Types...&gt;&amp; y);
  <del>template &lt;class... Types&gt;
--- 33374,33381 ----
  Change 20.4.1 [tuple.general]/2, header <tt>&lt;tuple&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! // 20.5.2.9, specialized algorithms:
  template &lt;class... Types&gt;
  void swap(tuple&lt;Types...&gt;&amp; x, tuple&lt;Types...&gt;&amp; y);
  <del>template &lt;class... Types&gt;
*************** void swap(tuple&lt;Types...&gt;&amp; x,
*** 44438,44444 ****
  Change 20.4.2 [tuple.tuple] as indicated:
  </p>
  
! <blockquote><pre>// 20.5.2.3, tuple swap
  void swap(tuple&amp;<del>&amp;</del>)
  </pre></blockquote>
  
--- 33391,33398 ----
  Change 20.4.2 [tuple.tuple] as indicated:
  </p>
  
! <blockquote><pre>
! // 20.5.2.3, tuple swap
  void swap(tuple&amp;<del>&amp;</del>)
  </pre></blockquote>
  
*************** void swap(tuple&amp;<del>&amp;</del>)
*** 44449,44465 ****
  Change 20.4.2.3 [tuple.swap] before 1 as indicated:
  </p>
  
! <blockquote><pre>void swap(tuple&amp;<del>&amp;</del> rhs);
  </pre></blockquote>
  
  </li>
  
  <li>
  <p>
! Change 20.8 [function.objects]/2, header <tt>&lt;functional&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>template&lt;class R, class... ArgTypes&gt;
  void swap(function&lt;R(ArgTypes...)&gt;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
  <del>template&lt;class R, class... ArgTypes&gt;
  void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
--- 33403,33421 ----
  Change 20.4.2.3 [tuple.swap] before 1 as indicated:
  </p>
  
! <blockquote><pre>
! void swap(tuple&amp;<del>&amp;</del> rhs);
  </pre></blockquote>
  
  </li>
  
  <li>
  <p>
! Change 20.9 [function.objects]/2, header <tt>&lt;functional&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;class R, class... ArgTypes&gt;
  void swap(function&lt;R(ArgTypes...)&gt;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
  <del>template&lt;class R, class... ArgTypes&gt;
  void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
*************** void swap(function&lt;R(ArgTypes...)&gt;
*** 44471,44480 ****
  
  <li>
  <p>
! Change 20.8.14.2 [func.wrap.func], as indicated:
  </p>
  
! <blockquote><pre>// 20.7.15.2.2, function modifiers:
  void swap(function&amp;<del>&amp;</del>);
  template&lt;class F, class A&gt; void assign(F, const A&amp;);
  
--- 33427,33437 ----
  
  <li>
  <p>
! Change 20.9.12.2 [func.wrap.func], as indicated:
  </p>
  
! <blockquote><pre>
! // 20.7.15.2.2, function modifiers:
  void swap(function&amp;<del>&amp;</del>);
  template&lt;class F, class A&gt; void assign(F, const A&amp;);
  
*************** void swap(function&lt;R(ArgTypes...)&gt;
*** 44493,44502 ****
  
  <li>
  <p>
! Change 20.8.14.2.7 [func.wrap.func.alg] before 1 as indicated:
  </p>
  
! <blockquote><pre>template&lt;class R, class... ArgTypes&gt;
  void swap(function&lt;R(ArgTypes...)&gt;&amp; f1, function&lt;R(ArgTypes...)&gt;&amp; f2);
  <del>template&lt;class R, class... ArgTypes&gt;
  void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp; f1, function&lt;R(ArgTypes...)&gt;&amp; f2);
--- 33450,33460 ----
  
  <li>
  <p>
! Change 20.9.12.2.7 [func.wrap.func.alg] before 1 as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;class R, class... ArgTypes&gt;
  void swap(function&lt;R(ArgTypes...)&gt;&amp; f1, function&lt;R(ArgTypes...)&gt;&amp; f2);
  <del>template&lt;class R, class... ArgTypes&gt;
  void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp; f1, function&lt;R(ArgTypes...)&gt;&amp; f2);
*************** void swap(function&lt;R(ArgTypes...)&gt;
*** 44508,44517 ****
  
  <li>
  <p>
! Change 20.9.10.2 [util.smartptr.shared]/1 as indicated:
  </p>
  
! <blockquote><pre>// 20.8.12.2.4, modifiers:
  void swap(shared_ptr&amp;<del>&amp;</del> r);
  
  [..]
--- 33466,33476 ----
  
  <li>
  <p>
! Change 20.8.2.2 [util.smartptr.shared]/1 as indicated:
  </p>
  
! <blockquote><pre>
! // 20.8.12.2.4, modifiers:
  void swap(shared_ptr&amp;<del>&amp;</del> r);
  
  [..]
*************** template&lt;class T&gt; void swap(shared
*** 44529,44535 ****
  Change 21.3 [string.classes]/1, header <tt>&lt;string&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>// 21.4.8.8: swap
  template&lt;class charT, class traits, class Allocator&gt;
  void swap(basic_string&lt;charT,traits,Allocator&gt;&amp; lhs, basic_string&lt;charT,traits,Allocator&gt;&amp; rhs);
  <del>template&lt;class charT, class traits, class Allocator&gt;
--- 33488,33495 ----
  Change 21.3 [string.classes]/1, header <tt>&lt;string&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! // 21.4.8.8: swap
  template&lt;class charT, class traits, class Allocator&gt;
  void swap(basic_string&lt;charT,traits,Allocator&gt;&amp; lhs, basic_string&lt;charT,traits,Allocator&gt;&amp; rhs);
  <del>template&lt;class charT, class traits, class Allocator&gt;
*************** void swap(basic_string&lt;charT,traits,A
*** 44545,44551 ****
  Change 23.3 [sequences]/1, header <tt>&lt;deque&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Allocator&gt;
  void swap(deque&lt;T,Allocator&gt;&amp; x, deque&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(deque&lt;T,Allocator&gt;&amp;&amp; x, deque&lt;T,Allocator&gt;&amp; y);
--- 33505,33512 ----
  Change 23.3 [sequences]/1, header <tt>&lt;deque&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Allocator&gt;
  void swap(deque&lt;T,Allocator&gt;&amp; x, deque&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(deque&lt;T,Allocator&gt;&amp;&amp; x, deque&lt;T,Allocator&gt;&amp; y);
*************** void swap(deque&lt;T,Allocator&gt;&amp;
*** 44560,44566 ****
  Change 23.3 [sequences]/1, header <tt>&lt;list&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Allocator&gt;
  void swap(list&lt;T,Allocator&gt;&amp; x, list&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(list&lt;T,Allocator&gt;&amp;&amp; x, list&lt;T,Allocator&gt;&amp; y);
--- 33521,33528 ----
  Change 23.3 [sequences]/1, header <tt>&lt;list&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Allocator&gt;
  void swap(list&lt;T,Allocator&gt;&amp; x, list&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(list&lt;T,Allocator&gt;&amp;&amp; x, list&lt;T,Allocator&gt;&amp; y);
*************** void swap(list&lt;T,Allocator&gt;&amp; x
*** 44575,44581 ****
  Change 23.3 [sequences]/1, header <tt>&lt;queue&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Allocator&gt;
  void swap(queue&lt;T, Container&gt;&amp; x, queue&lt;T, Container&gt;&amp; y);
  <del>template &lt;class T, class Container&gt;
  void swap(queue&lt;T, Container&gt;&amp;&amp; x, queue&lt;T, Container&gt;&amp; y);
--- 33537,33544 ----
  Change 23.3 [sequences]/1, header <tt>&lt;queue&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Allocator&gt;
  void swap(queue&lt;T, Container&gt;&amp; x, queue&lt;T, Container&gt;&amp; y);
  <del>template &lt;class T, class Container&gt;
  void swap(queue&lt;T, Container&gt;&amp;&amp; x, queue&lt;T, Container&gt;&amp; y);
*************** void swap(priority_queue&lt;T, Container
*** 44599,44605 ****
  Change 23.3 [sequences]/1, header <tt>&lt;stack&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container&gt;
  void swap(stack&lt;T, Container&gt;&amp; x, stack&lt;T, Container&gt;&amp; y);
  <del>template &lt;class T, class Container&gt;
  void swap(stack&lt;T, Container&gt;&amp;&amp; x, stack&lt;T, Container&gt;&amp; y);
--- 33562,33569 ----
  Change 23.3 [sequences]/1, header <tt>&lt;stack&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container&gt;
  void swap(stack&lt;T, Container&gt;&amp; x, stack&lt;T, Container&gt;&amp; y);
  <del>template &lt;class T, class Container&gt;
  void swap(stack&lt;T, Container&gt;&amp;&amp; x, stack&lt;T, Container&gt;&amp; y);
*************** void swap(stack&lt;T, Container&gt;&amp;
*** 44614,44620 ****
  Change 23.3 [sequences]/1, header <tt>&lt;vector&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Allocator&gt;
  void swap(vector&lt;T,Allocator&gt;&amp; x, vector&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(vector&lt;T,Allocator&gt;&amp;&amp; x, vector&lt;T,Allocator&gt;&amp; y);
--- 33578,33585 ----
  Change 23.3 [sequences]/1, header <tt>&lt;vector&gt;</tt> synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Allocator&gt;
  void swap(vector&lt;T,Allocator&gt;&amp; x, vector&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(vector&lt;T,Allocator&gt;&amp;&amp; x, vector&lt;T,Allocator&gt;&amp; y);
*************** void swap(vector&lt;T,Allocator&gt;&amp;
*** 44626,44635 ****
  
  <li>
  <p>
! Change 23.3.2 [deque]/2 as indicated:
  </p>
  
! <blockquote><pre>iterator erase(const_iterator position);
  iterator erase(const_iterator first, const_iterator last);
  void swap(deque&lt;T,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
--- 33591,33601 ----
  
  <li>
  <p>
! Change 23.3.3 [deque]/2 as indicated:
  </p>
  
! <blockquote><pre>
! iterator erase(const_iterator position);
  iterator erase(const_iterator first, const_iterator last);
  void swap(deque&lt;T,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
*************** void swap(deque&lt;T,Allocator&gt;&amp;
*** 44649,44658 ****
  
  <li>
  <p>
! Change 23.3.2.4 [deque.special] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Allocator&gt;
  void swap(deque&lt;T,Allocator&gt;&amp; x, deque&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(deque&lt;T,Allocator&gt;&amp;&amp; x, deque&lt;T,Allocator&gt;&amp; y);
--- 33615,33625 ----
  
  <li>
  <p>
! Change 23.3.3.5 [deque.special] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Allocator&gt;
  void swap(deque&lt;T,Allocator&gt;&amp; x, deque&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(deque&lt;T,Allocator&gt;&amp;&amp; x, deque&lt;T,Allocator&gt;&amp; y);
*************** void swap(deque&lt;T,Allocator&gt;&amp;
*** 44664,44673 ****
  
  <li>
  <p>
! Change 23.3.3 [forwardlist]/2 as indicated:
  </p>
  
! <blockquote><pre>iterator erase_after(const_iterator position);
  iterator erase_after(const_iterator position, iterator last);
  void swap(forward_list&lt;T,Allocator&gt;&amp;<del>&amp;</del>);
  
--- 33631,33641 ----
  
  <li>
  <p>
! Change 23.3.4 [forwardlist]/2 as indicated:
  </p>
  
! <blockquote><pre>
! iterator erase_after(const_iterator position);
  iterator erase_after(const_iterator position, iterator last);
  void swap(forward_list&lt;T,Allocator&gt;&amp;<del>&amp;</del>);
  
*************** void swap(forward_list&lt;T,Allocator&gt
*** 44686,44695 ****
  
  <li>
  <p>
! Change 23.3.3.6 [forwardlist.spec] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Allocator&gt;
  void swap(forward_list&lt;T,Allocator&gt;&amp; x, forward_list&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(forward_list&lt;T,Allocator&gt;&amp;&amp; x, forward_list&lt;T,Allocator&gt;&amp; y);
--- 33654,33664 ----
  
  <li>
  <p>
! Change 23.3.4.7 [forwardlist.spec] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Allocator&gt;
  void swap(forward_list&lt;T,Allocator&gt;&amp; x, forward_list&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(forward_list&lt;T,Allocator&gt;&amp;&amp; x, forward_list&lt;T,Allocator&gt;&amp; y);
*************** void swap(forward_list&lt;T,Allocator&gt
*** 44701,44710 ****
  
  <li>
  <p>
! Change 23.3.4 [list]/2 as indicated:
  </p>
  
! <blockquote><pre>iterator erase(const_iterator position);
  iterator erase(const_iterator position, const_iterator last);
  void swap(list&lt;T,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
--- 33670,33680 ----
  
  <li>
  <p>
! Change 23.3.5 [list]/2 as indicated:
  </p>
  
! <blockquote><pre>
! iterator erase(const_iterator position);
  iterator erase(const_iterator position, const_iterator last);
  void swap(list&lt;T,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
*************** void swap(list&lt;T,Allocator&gt;&amp; x
*** 44724,44733 ****
  
  <li>
  <p>
! Change 23.3.4.5 [list.special] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Allocator&gt;
  void swap(list&lt;T,Allocator&gt;&amp; x, list&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(list&lt;T,Allocator&gt;&amp;&amp; x, list&lt;T,Allocator&gt;&amp; y);
--- 33694,33704 ----
  
  <li>
  <p>
! Change 23.3.5.6 [list.special] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Allocator&gt;
  void swap(list&lt;T,Allocator&gt;&amp; x, list&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(list&lt;T,Allocator&gt;&amp;&amp; x, list&lt;T,Allocator&gt;&amp; y);
*************** void swap(list&lt;T,Allocator&gt;&amp; x
*** 44739,44748 ****
  
  <li>
  <p>
! Change 23.5.1.1 [queue.defn] as indicated:
  </p>
  
! <blockquote><pre>void swap(queue&amp;<del>&amp;</del> q) { c.swap(q.c); }
  
  [..]
  
--- 33710,33720 ----
  
  <li>
  <p>
! Change 23.6.3.1 [queue.defn] as indicated:
  </p>
  
! <blockquote><pre>
! void swap(queue&amp;<del>&amp;</del> q) { c.swap(q.c); }
  
  [..]
  
*************** void swap(queue&lt;T, Container&gt;&amp;
*** 44758,44767 ****
  
  <li>
  <p>
! Change 23.5.1.5 [queue.special] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container&gt;
  void swap(queue&lt;T, Container&gt;&amp; x, queue&lt;T, Container&gt;&amp; y);
  <del>template &lt;class T, class Container&gt;
  void swap(queue&lt;T, Container&gt;&amp;&amp; x, queue&lt;T, Container&gt;&amp; y);
--- 33730,33740 ----
  
  <li>
  <p>
! Change 23.6.3.5 [queue.special] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container&gt;
  void swap(queue&lt;T, Container&gt;&amp; x, queue&lt;T, Container&gt;&amp; y);
  <del>template &lt;class T, class Container&gt;
  void swap(queue&lt;T, Container&gt;&amp;&amp; x, queue&lt;T, Container&gt;&amp; y);
*************** void swap(queue&lt;T, Container&gt;&amp;
*** 44773,44782 ****
  
  <li>
  <p>
! Change 23.5.2 [priority.queue]/1 as indicated:
  </p>
  
! <blockquote><pre>void swap(priority_queue&amp;<del>&amp;</del>);
  
  // no equality is provided
  template &lt;class T, class Container, class Compare&gt;
--- 33746,33756 ----
  
  <li>
  <p>
! Change 23.6.4 [priority.queue]/1 as indicated:
  </p>
  
! <blockquote><pre>
! void swap(priority_queue&amp;<del>&amp;</del>);
  
  // no equality is provided
  template &lt;class T, class Container, class Compare&gt;
*************** void swap(priority_queue&lt;T, Container
*** 44791,44800 ****
  
  <li>
  <p>
! Change 23.5.2.4 [priqueue.special] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container, Compare&gt;
  void swap(priority_queue&lt;T, Container, Compare&gt;&amp; x, priority_queue&lt;T, Container, Compare&gt;&amp; y);
  <del>template &lt;class T, class Container, Compare&gt;
  void swap(priority_queue&lt;T, Container, Compare&gt;&amp;&amp; x, priority_queue&lt;T, Container, Compare&gt;&amp; y);
--- 33765,33775 ----
  
  <li>
  <p>
! Change 23.6.4.4 [priqueue.special] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container, Compare&gt;
  void swap(priority_queue&lt;T, Container, Compare&gt;&amp; x, priority_queue&lt;T, Container, Compare&gt;&amp; y);
  <del>template &lt;class T, class Container, Compare&gt;
  void swap(priority_queue&lt;T, Container, Compare&gt;&amp;&amp; x, priority_queue&lt;T, Container, Compare&gt;&amp; y);
*************** void swap(priority_queue&lt;T, Container
*** 44806,44815 ****
  
  <li>
  <p>
! Change 23.5.3.1 [stack.defn] as indicated:
  </p>
  
! <blockquote><pre>void swap(stack&amp;<del>&amp;</del> s) { c.swap(s.c); }
  
  [..]
  
--- 33781,33791 ----
  
  <li>
  <p>
! Change 23.6.5.2 [stack.defn] as indicated:
  </p>
  
! <blockquote><pre>
! void swap(stack&amp;<del>&amp;</del> s) { c.swap(s.c); }
  
  [..]
  
*************** void swap(stack&lt;T,Allocator&gt;&amp;
*** 44826,44835 ****
  
  <li>
  <p>
! Change 23.5.3.5 [stack.special] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container&gt;
  void swap(stack&lt;T, Container&gt;&amp; x, stack&lt;T, Container&gt;&amp; y);
  <del>template &lt;class T, class Container&gt;
  void swap(stack&lt;T, Container&gt;&amp;&amp; x, stack&lt;T, Container&gt;&amp; y);
--- 33802,33812 ----
  
  <li>
  <p>
! Change 23.6.5.6 [stack.special] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container&gt;
  void swap(stack&lt;T, Container&gt;&amp; x, stack&lt;T, Container&gt;&amp; y);
  <del>template &lt;class T, class Container&gt;
  void swap(stack&lt;T, Container&gt;&amp;&amp; x, stack&lt;T, Container&gt;&amp; y);
*************** void swap(stack&lt;T, Container&gt;&amp;
*** 44841,44850 ****
  
  <li>
  <p>
! Change 23.4.1 [vector]/2 as indicated:
  </p>
  
! <blockquote><pre>void swap(vector&lt;T,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
  
  [..]
--- 33818,33828 ----
  
  <li>
  <p>
! Change 23.3.6 [vector]/2 as indicated:
  </p>
  
! <blockquote><pre>
! void swap(vector&lt;T,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
  
  [..]
*************** void swap(vector&lt;T,Allocator&gt;&amp;
*** 44862,44881 ****
  
  <li>
  <p>
! Change 23.4.1.2 [vector.capacity] before p. 8 as indicated:
  </p>
  
! <blockquote><pre>void swap(vector&lt;T,Allocator&gt;&amp;<del>&amp;</del> x);
  </pre></blockquote>
  
  </li>
  
  <li>
  <p>
! Change 23.4.1.5 [vector.special] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class T, class Allocator&gt;
  void swap(vector&lt;T,Allocator&gt;&amp; x, vector&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(vector&lt;T,Allocator&gt;&amp;&amp; x, vector&lt;T,Allocator&gt;&amp; y);
--- 33840,33861 ----
  
  <li>
  <p>
! Change 23.3.6.3 [vector.capacity] before p. 8 as indicated:
  </p>
  
! <blockquote><pre>
! void swap(vector&lt;T,Allocator&gt;&amp;<del>&amp;</del> x);
  </pre></blockquote>
  
  </li>
  
  <li>
  <p>
! Change 23.3.6.6 [vector.special] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Allocator&gt;
  void swap(vector&lt;T,Allocator&gt;&amp; x, vector&lt;T,Allocator&gt;&amp; y);
  <del>template &lt;class T, class Allocator&gt;
  void swap(vector&lt;T,Allocator&gt;&amp;&amp; x, vector&lt;T,Allocator&gt;&amp; y);
*************** void swap(vector&lt;T,Allocator&gt;&amp;
*** 44887,44896 ****
  
  <li>
  <p>
! Change 23.4.2 [vector.bool]/1 as indicated:
  </p>
  
! <blockquote><pre>iterator erase(const_iterator first, const_iterator last);
  void swap(vector&lt;bool,Allocator&gt;&amp;<del>&amp;</del>);
  static void swap(reference x, reference y);
  </pre></blockquote>
--- 33867,33877 ----
  
  <li>
  <p>
! Change 23.3.7 [vector.bool]/1 as indicated:
  </p>
  
! <blockquote><pre>
! iterator erase(const_iterator first, const_iterator last);
  void swap(vector&lt;bool,Allocator&gt;&amp;<del>&amp;</del>);
  static void swap(reference x, reference y);
  </pre></blockquote>
*************** static void swap(reference x, reference
*** 44899,44908 ****
  
  <li>
  <p>
! Change 23.6 [associative]/1, header <tt>&lt;map&gt;</tt> synopsis as indicated:
  </p>
  
! <blockquote><pre>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(map&lt;Key,T,Compare,Allocator&gt;&amp; x, map&lt;Key,T,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(map&lt;Key,T,Compare,Allocator&amp;&amp; x, map&lt;Key,T,Compare,Allocator&gt;&amp; y);
--- 33880,33890 ----
  
  <li>
  <p>
! Change 23.4 [associative]/1, header <tt>&lt;map&gt;</tt> synopsis as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(map&lt;Key,T,Compare,Allocator&gt;&amp; x, map&lt;Key,T,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(map&lt;Key,T,Compare,Allocator&amp;&amp; x, map&lt;Key,T,Compare,Allocator&gt;&amp; y);
*************** void swap(multimap&lt;Key,T,Compare,Allo
*** 44923,44932 ****
  
  <li>
  <p>
! Change 23.6 [associative]/1, header <tt>&lt;set&gt;</tt> synopsis as indicated:
  </p>
  
! <blockquote><pre>template &lt;class Key, class Compare, class Allocator&gt;
  void swap(set&lt;Key,Compare,Allocator&gt;&amp; x, set&lt;Key,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(set&lt;Key,T,Compare,Allocator&amp;&amp; x, set&lt;Key,T,Compare,Allocator&gt;&amp; y);
--- 33905,33915 ----
  
  <li>
  <p>
! Change 23.4 [associative]/1, header <tt>&lt;set&gt;</tt> synopsis as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class Key, class Compare, class Allocator&gt;
  void swap(set&lt;Key,Compare,Allocator&gt;&amp; x, set&lt;Key,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(set&lt;Key,T,Compare,Allocator&amp;&amp; x, set&lt;Key,T,Compare,Allocator&gt;&amp; y);
*************** void swap(multiset&lt;Key,T,Compare,Allo
*** 44947,44956 ****
  
  <li>
  <p>
! Change 23.6.1 [map]/2 as indicated:
  </p>
  
! <blockquote><pre>iterator erase(const_iterator first, const_iterator last);
  void swap(map&lt;Key,T,Compare,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
  
--- 33930,33940 ----
  
  <li>
  <p>
! Change 23.4.4 [map]/2 as indicated:
  </p>
  
! <blockquote><pre>
! iterator erase(const_iterator first, const_iterator last);
  void swap(map&lt;Key,T,Compare,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
  
*************** void swap(map&lt;Key,T,Compare,Allocator
*** 44969,44978 ****
  
  <li>
  <p>
! Change 23.6.1.5 [map.special] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(map&lt;Key,T,Compare,Allocator&gt;&amp; x, map&lt;Key,T,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(map&lt;Key,T,Compare,Allocator&gt;&amp;&amp; x, map&lt;Key,T,Compare,Allocator&gt;&amp; y);
--- 33953,33963 ----
  
  <li>
  <p>
! Change 23.4.4.5 [map.special] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(map&lt;Key,T,Compare,Allocator&gt;&amp; x, map&lt;Key,T,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(map&lt;Key,T,Compare,Allocator&gt;&amp;&amp; x, map&lt;Key,T,Compare,Allocator&gt;&amp; y);
*************** void swap(map&lt;Key,T,Compare,Allocator
*** 44984,44993 ****
  
  <li>
  <p>
! Change 23.6.2 [multimap]/2 as indicated:
  </p>
  
! <blockquote><pre>iterator erase(const_iterator first, const_iterator last);
  void swap(multimap&lt;Key,T,Compare,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
  
--- 33969,33979 ----
  
  <li>
  <p>
! Change 23.4.5 [multimap]/2 as indicated:
  </p>
  
! <blockquote><pre>
! iterator erase(const_iterator first, const_iterator last);
  void swap(multimap&lt;Key,T,Compare,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
  
*************** void swap(multimap&lt;Key,T,Compare,Allo
*** 45006,45015 ****
  
  <li>
  <p>
! Change 23.6.2.4 [multimap.special] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(multimap&lt;Key,T,Compare,Allocator&gt;&amp; x, multimap&lt;Key,T,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(multimap&lt;Key,T,Compare,Allocator&gt;&amp;&amp; x, multimap&lt;Key,T,Compare,Allocator&gt;&amp; y);
--- 33992,34002 ----
  
  <li>
  <p>
! Change 23.4.5.4 [multimap.special] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(multimap&lt;Key,T,Compare,Allocator&gt;&amp; x, multimap&lt;Key,T,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class T, class Compare, class Allocator&gt;
  void swap(multimap&lt;Key,T,Compare,Allocator&gt;&amp;&amp; x, multimap&lt;Key,T,Compare,Allocator&gt;&amp; y);
*************** void swap(multimap&lt;Key,T,Compare,Allo
*** 45021,45030 ****
  
  <li>
  <p>
! Change 23.6.3 [set]/2 and 23.6.3.2 [set.special] as indicated: (twice!)
  </p>
  
! <blockquote><pre>// specialized algorithms:
  template &lt;class Key, class Compare, class Allocator&gt;
  void swap(set&lt;Key,Compare,Allocator&gt;&amp; x, set&lt;Key,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class Compare, class Allocator&gt;
--- 34008,34018 ----
  
  <li>
  <p>
! Change 23.4.6 [set]/2 and 23.4.6.3 [set.special] as indicated: (twice!)
  </p>
  
! <blockquote><pre>
! // specialized algorithms:
  template &lt;class Key, class Compare, class Allocator&gt;
  void swap(set&lt;Key,Compare,Allocator&gt;&amp; x, set&lt;Key,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class Compare, class Allocator&gt;
*************** void swap(set&lt;Key,Compare,Allocator&a
*** 45037,45046 ****
  
  <li>
  <p>
! Change 23.6.4 [multiset]/2 as indicated:
  </p>
  
! <blockquote><pre>iterator erase(const_iterator first, const_iterator last);
  void swap(multiset&lt;Key,Compare,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
  
--- 34025,34035 ----
  
  <li>
  <p>
! Change 23.4.7 [multiset]/2 as indicated:
  </p>
  
! <blockquote><pre>
! iterator erase(const_iterator first, const_iterator last);
  void swap(multiset&lt;Key,Compare,Allocator&gt;&amp;<del>&amp;</del>);
  void clear();
  
*************** void swap(multiset&lt;Key,Compare,Alloca
*** 45059,45068 ****
  
  <li>
  <p>
! Change 23.6.4.2 [multiset.special] as indicated:
  </p>
  
! <blockquote><pre>template &lt;class Key, class Compare, class Allocator&gt;
  void swap(multiset&lt;Key,Compare,Allocator&gt;&amp; x, multiset&lt;Key,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class Compare, class Allocator&gt;
  void swap(multiset&lt;Key,Compare,Allocator&gt;&amp;&amp; x, multiset&lt;Key,Compare,Allocator&gt;&amp; y);
--- 34048,34058 ----
  
  <li>
  <p>
! Change 23.4.7.3 [multiset.special] as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class Key, class Compare, class Allocator&gt;
  void swap(multiset&lt;Key,Compare,Allocator&gt;&amp; x, multiset&lt;Key,Compare,Allocator&gt;&amp; y);
  <del>template &lt;class Key, class Compare, class Allocator&gt;
  void swap(multiset&lt;Key,Compare,Allocator&gt;&amp;&amp; x, multiset&lt;Key,Compare,Allocator&gt;&amp; y);
*************** void swap(multiset&lt;Key,Compare,Alloca
*** 45079,45092 ****
  
  <hr>
  <h3><a name="1233"></a>1233. Missing <tt>unique_ptr</tt> signatures in synopsis</h3>
! <p><b>Section:</b> 20.9 [memory] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-10-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#memory">issues</a> in [memory].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>.  Some <tt>unique_ptr</tt> signatures are missing
! from the synopsis in 20.9 [memory].
  </p>
  
  <p><i>[
--- 34069,34082 ----
  
  <hr>
  <h3><a name="1233"></a>1233. Missing <tt>unique_ptr</tt> signatures in synopsis</h3>
! <p><b>Section:</b> 20.7 [memory] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-10-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#memory">issues</a> in [memory].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Related to <a href="lwg-defects.html#296">296</a>.  Some <tt>unique_ptr</tt> signatures are missing
! from the synopsis in 20.7 [memory].
  </p>
  
  <p><i>[
*************** from the synopsis in 20.9 [memory].
*** 45094,45111 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively NAD Editorial.  The editor has adopted the fix.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add in 20.9 [memory], Header <tt>&lt;memory&gt;</tt> synopsis
  missing declarations as shown below:
  </p>
  
! <blockquote><pre>// 20.8.11 Class unique_ptr:
  template &lt;class X&gt; class default_delete;
  <ins>template&lt;class T&gt; struct default_delete&lt;T[]&gt;;</ins>
  template &lt;class X, class D = default_delete&lt;T&gt;&gt; class unique_ptr;
--- 34084,34102 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively NAD Editorial.  The editor has adopted the fix.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add in 20.7 [memory], Header <tt>&lt;memory&gt;</tt> synopsis
  missing declarations as shown below:
  </p>
  
! <blockquote><pre>
! // 20.8.11 Class unique_ptr:
  template &lt;class X&gt; class default_delete;
  <ins>template&lt;class T&gt; struct default_delete&lt;T[]&gt;;</ins>
  template &lt;class X, class D = default_delete&lt;T&gt;&gt; class unique_ptr;
*************** bool operator&gt;=(const unique_ptr&lt;T
*** 45132,45258 ****
  
  
  <hr>
- <h3><a name="1235"></a>1235. Issue with C++0x random number proposal</h3>
- <p><b>Section:</b> X [rand.concept.dist] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Matthias Troyer <b>Opened:</b> 2009-10-12 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- There exist optimized, vectorized vendor libraries for the creation of
- random number generators, such as Intel's MKL [1] and AMD's ACML [2]. In
- timing tests we have seen a performance gain of a factor of up to 80
- (eighty) compared to a pure C++ implementation (in Boost.Random) when
- using these generator to generate a sequence of normally distributed
- random numbers. In codes dominated by the generation of random numbers
- (we have application codes where random number generation is more than
- 50% of the CPU time) this factor 80 is very significant.
- </p>
- 
- <p>
- To make use of these vectorized generators, we use a C++ class modeling
- the <tt>RandomNumberEngine</tt> concept and forwarding the generation of random
- numbers to those optimized generators. For example:
- </p>
- 
- <blockquote><pre>namespace mkl {
-  class mt19937 {.... };
- }
- </pre></blockquote>
- 
- <p>
- For the generation of random variates we also want to dispatch to
- optimized vectorized functions in the MKL or ACML libraries. See this
- example:
- </p>
- 
- <blockquote><pre>mkl::mt19937 eng;
- std::normal_distribution&lt;double&gt; dist;
- 
- double n = dist(eng);
- </pre></blockquote>
- 
- <p>
- Since the variate generation is done through the <tt>operator()</tt> of the
- distribution there is no customization point to dispatch to Intel's or
- AMD's optimized functions to generate normally distributed numbers based
- on the <tt>mt19937</tt> generator. Hence, the performance gain of 80 cannot be
- achieved.
- </p>
- 
- <p>
- Contrast this with TR1:
- </p>
- 
- <blockquote><pre>mkl::mt19937 eng;
- std::tr1::normal_distribution&lt;double&gt; dist;
- std::tr1::variate_generator&lt;mkl::mt19937,std::tr1::normal_distribution&lt;double&gt; &gt; rng(eng,dist);
- double n = rng();
- </pre></blockquote>
- 
- <p>
- This - admittedly much uglier from an aestethic point of view - design
- allowed optimization by specializing the <tt>variate_generator</tt> template for
- <tt>mkl::mt19937</tt>:
- </p>
- 
- <blockquote><pre>namespace std { namespace tr1 {
- 
- template&lt;&gt;
- class variate_generator&lt;mkl::mt19937,std::tr1::normal_distribution&lt;double&gt; &gt; { .... };
- 
- } }
- </pre></blockquote>
- 
- <p>
- A similar customization point is missing in the C++0x design and
- prevents the optimized vectorized version to be used.
- </p>
- 
- <p>
- Suggested resolution:
- </p>
- 
- <p>
- Add a customization point to the distribution concept. Instead of the
- <tt>variate_generator</tt> template this can be done through a call to a
- free function <tt>generate_variate</tt> found by ADL instead of
- <tt>operator()</tt> of the distribution:
- </p>
- 
- <blockquote><pre>template &lt;RandomNumberDistribution, class RandomNumberEngine&gt;
- typename RandomNumberDistribution ::result_type
- generate_variate(RandomNumberDistribution const&amp; dist, RandomNumberEngine&amp; eng);
- </pre></blockquote>
- 
- <p>
- This function can be overloaded for optimized enginges like
- <tt>mkl::mt19937</tt>.
- </p>
- 
- <p><i>[
- 2009-10 Santa Cruz:
- ]</i></p>
- 
- 
- <blockquote>
- NAD Future.  No time to add this feature for C++0X.
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1236"></a>1236. reserved identifiers in programs not using the library</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2009-10-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I wasn't sure whether to consider this a library or a language issue,
--- 34123,34134 ----
  
  
  <hr>
  <h3><a name="1236"></a>1236. reserved identifiers in programs not using the library</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2009-10-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I wasn't sure whether to consider this a library or a language issue,
*************** you sort it out.
*** 45265,45272 ****
  Most reserved identifiers are treated as unilaterally available to the
  implementation, such as to implement language extensions, or provide
  macros documenting its functionality. However, the requirements for
! reserved identifers are in 17.6.3.3 [reserved.names], which are a
! subsection of 17.6.3 [constraints]. 17.6.3.1 [constraints.overview] appears only to apply to "C++ programs
  that use the facilities of the C++ standard library", meaning that, in
  theory, all implementations are erroneous in having any non-standard
  identifiers predefined for programs that do not, at some point, include
--- 34141,34148 ----
  Most reserved identifiers are treated as unilaterally available to the
  implementation, such as to implement language extensions, or provide
  macros documenting its functionality. However, the requirements for
! reserved identifers are in 17.6.4.3 [reserved.names], which are a
! subsection of 17.6.4 [constraints]. 17.6.4.1 [constraints.overview] appears only to apply to "C++ programs
  that use the facilities of the C++ standard library", meaning that, in
  theory, all implementations are erroneous in having any non-standard
  identifiers predefined for programs that do not, at some point, include
*************** a standard library header.
*** 45275,45282 ****
  
  <p>
  Furthermore, it's unclear whether the use of certain identifiers is UB
! or results in an ill-formed program. In particular, 17.6.3.3.1 [macro.names] uses a "shall not", where 17.6.3.3.2 [global.names] says that names are "reserved to the
! implementation". 17.6.3.3 [reserved.names] seems only to cover the
  instance of a name being described as "reserved", so are implementations
  required to diagnose a program that performs, as an example, "<tt>#undef
  get</tt>"?
--- 34151,34158 ----
  
  <p>
  Furthermore, it's unclear whether the use of certain identifiers is UB
! or results in an ill-formed program. In particular, 17.6.4.3.1 [macro.names] uses a "shall not", where  [global.names] says that names are "reserved to the
! implementation". 17.6.4.3 [reserved.names] seems only to cover the
  instance of a name being described as "reserved", so are implementations
  required to diagnose a program that performs, as an example, "<tt>#undef
  get</tt>"?
*************** get</tt>"?
*** 45287,45434 ****
  ]</i></p>
  
  
! <blockquote>
  Move to NAD. There may in theory be multiple interpretations possible,
  but there's no evidence that this causes any genuine problems or
  uncertainty about what implementations are allowed to do. We do not
  believe this rises to the level of a defect.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1238"></a>1238. defining algorithms taking iterator for range</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-10-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The library has many algorithms that take a source range represented by
! a pair of iterators, and the start of some second sequence given by a
! single iterator.  Internally, these algorithms will produce undefined
! behaviour if the second 'range' is not as large as the input range, but
! none of the algorithms spell this out in Requires clauses, and there is
! no catch-all wording to cover this in clause 17 or the front matter of
! 25.
! </p>
! 
! <p>
! There was an attempt to provide such wording in paper
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2944.pdf">n2944</a>
! but this
! seems incidental to the focus of the paper, and getting the wording of
! this issue right seems substantially more difficult than the simple
! approach taken in that paper.  Such wording will be removed from an
! updated paper, and hopefully tracked via the LWG issues list instead.
! </p>
! 
! <p>
! It seems there are several classes of problems here and finding wording
! to solve all in one paragraph could be too much.  I suspect we need
! several overlapping requirements that should cover the desired range of
! behaviours.
! </p>
! 
! <p>
! Motivating examples:
! </p>
! 
! <p>
! A good initial example is the <tt>swap_ranges</tt> algorithm.  Here there is a
! clear requirement that <tt>first2</tt> refers to the start of a valid range at
! least as long as the range <tt>[first1, last1)</tt>.  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2944.pdf">n2944</a> tries to solve this
! by positing a hypothetical <tt>last2</tt> iterator that is implied by the
! signature, and requires <tt>distance(first2,last2) &lt; distance(first1,last1)</tt>.
!  This mostly works, although I am uncomfortable assuming that <tt>last2</tt> is
! clearly defined and well known without any description of how to obtain
! it (and I have no idea how to write that).
! </p>
! 
! <p>
! A second motivating example might be the <tt>copy</tt> algorithm.  Specifically,
! let us image a call like:
! </p>
! 
! <blockquote><pre>copy(istream_iterator&lt;int&gt;(is),istream_iterator(),ostream_iterator&lt;int&gt;(os));
! </pre></blockquote>
! 
! <p>
! In this case, our input iterators are literally simple <tt>InputIterators</tt>,
! and the destination is a simple <tt>OutputIterator</tt>.  In neither case am I
! happy referring to <tt>std::distance</tt>, in fact it is not possible for the
! <tt>ostream_iterator</tt> at all as it does not meet the requirements.  However,
! any wording we provide must cover both cases.  Perhaps we might deduce
! <tt>last2 == ostream_iterator&lt;int&gt;{}</tt>, but that might not always be valid for
! user-defined iterator types.  I can well imagine an 'infinite range'
! that writes to <tt>/dev/null</tt> and has no meaningful <tt>last2</tt>.
! </p>
! 
! <p>
! The motivating example in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2944.pdf">n2944</a> is <tt>std::equal</tt>, and that seems to fall somewhere between the
! two.
! </p>
! 
! <p>
! Outlying examples might be <tt>partition_copy</tt> that takes two output
! iterators, and the <tt>_n</tt> algorithms where a range is specified by a
! specific number of iterations, rather than traditional iterator pair. 
! We should also <em>not</em> accidentally apply inappropriate constraints to
! <tt>std::rotate</tt> which takes a third iterator that is not intended to be a
! separate range at all.
! </p>
! 
! <p>
! I suspect we want some wording similar to:
! </p>
! 
! <blockquote>
! For algorithms that operate on ranges where the end iterator of the
! second range is not specified, the second range shall contain at least
! as many elements as the first.
! </blockquote>
! 
! <p>
! I don't think this quite captures the intent yet though.  I am not sure
! if 'range' is the right term here rather than sequence.  More awkwardly,
! I am not convinced we can describe an Output sequence such as produce by
! an <tt>ostream_iterator</tt> as "containing elements", at least not as a
! precondition to the call before they have been written.
! </p>
! 
! <p>
! Another idea was to describe require that the trailing iterator support
! at least distance(input range) applications of <tt>operator++</tt> and may be
! written through the same number of times if a mutable/output iterator.
! </p>
! 
! <p>
! We might also consider handling the case of an output range vs. an input
! range in separate paragraphs, if that simplifies how we describe some of
! these constraints.
! </p>
! 
! <p><i>[
! 2009-11-03 Howard adds:
! ]</i></p>
! 
  
- <blockquote>
- Moved to Tentatively NAD Future after 5 positive votes on c++std-lib.
- </blockquote>
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Does not have sufficient support at this time. May wish to reconsider for a
- future standard.
- </p>
  
  
  <p><b>Proposed resolution:</b></p>
--- 34163,34175 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to NAD. There may in theory be multiple interpretations possible,
  but there's no evidence that this causes any genuine problems or
  uncertainty about what implementations are allowed to do. We do not
  believe this rises to the level of a defect.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
*************** future standard.
*** 45439,45448 ****
  
  <hr>
  <h3><a name="1239"></a>1239. Defect report</h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-10-16 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 43 defines a number of traits that yield true for arrays of class
--- 34180,34190 ----
  
  <hr>
  <h3><a name="1239"></a>1239. Defect report</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-10-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 43 defines a number of traits that yield true for arrays of class
*************** types with the trait's property, but not
*** 45450,45459 ****
  property.  For example, <tt>has_trivial_default_constructor</tt>:
  </p>
  
! <blockquote>
  <tt>T</tt> is a trivial type (3.9) or a class type with a trivial default
  constructor (12.1) or an array of such a class type.
! </blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
--- 34192,34201 ----
  property.  For example, <tt>has_trivial_default_constructor</tt>:
  </p>
  
! <blockquote><p>
  <tt>T</tt> is a trivial type (3.9) or a class type with a trivial default
  constructor (12.1) or an array of such a class type.
! </p></blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
*************** Project editor may wish to accept the su
*** 45485,45494 ****
  Change all the traits in question following this pattern:
  </p>
  
! <blockquote>
  <tt>T</tt> is a trivial type (3.9) or a class type with a trivial default
   constructor (12.1)<ins>,</ins> or an array of such a <del>class</del> type.
! </blockquote>
  
  <p>
  i.e., add a comma and delete a "class."
--- 34227,34236 ----
  Change all the traits in question following this pattern:
  </p>
  
! <blockquote><p>
  <tt>T</tt> is a trivial type (3.9) or a class type with a trivial default
   constructor (12.1)<ins>,</ins> or an array of such a <del>class</del> type.
! </p></blockquote>
  
  <p>
  i.e., add a comma and delete a "class."
*************** i.e., add a comma and delete a "class."
*** 45499,45544 ****
  
  
  <hr>
- <h3><a name="1242"></a>1242. Enable SCARY iterators</h3>
- <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2009-10-21 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#containers">issues</a> in [containers].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- See
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2980.pdf">N2980</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1243"></a>1243. Missing <tt>operator+= (initializer_list&lt;T&gt;)</tt> for <tt>valarray</tt></h3>
! <p><b>Section:</b> 26.6.2.6 [valarray.cassign] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-10-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.cassign">issues</a> in [valarray.cassign].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP 64</b></p>
  
  <p>
  During the additions of <tt>initializer_list</tt> overloads
! <tt>basic_string</tt> added
  </p>
  
! <blockquote><pre>basic_string&amp; operator+=(initializer_list&lt;charT&gt;);
  </pre></blockquote>
  
  <p>
  but
  </p>
  
! <blockquote><pre>valarray&lt;T&gt;&amp; operator+= (initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  <p>
--- 34241,34269 ----
  
  
  <hr>
  <h3><a name="1243"></a>1243. Missing <tt>operator+= (initializer_list&lt;T&gt;)</tt> for <tt>valarray</tt></h3>
! <p><b>Section:</b> 26.6.2.7 [valarray.cassign] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-10-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.cassign">issues</a> in [valarray.cassign].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP 64</b></p>
  
  <p>
  During the additions of <tt>initializer_list</tt> overloads
! <tt>basic_string</tt> added:
  </p>
  
! <blockquote><pre>
! basic_string&amp; operator+=(initializer_list&lt;charT&gt;);
  </pre></blockquote>
  
  <p>
  but
  </p>
  
! <blockquote><pre>
! valarray&lt;T&gt;&amp; operator+= (initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  <p>
*************** Daniel adds on opening:
*** 45550,45556 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend NAD. The <tt>operator+=</tt> overload of <tt>basic_string</tt>
  behaves as-if calling <tt>append</tt>, which is completely different in
  meaning as the existing <tt>operator+=</tt> overloads in
--- 34275,34281 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend NAD. The <tt>operator+=</tt> overload of <tt>basic_string</tt>
  behaves as-if calling <tt>append</tt>, which is completely different in
  meaning as the existing <tt>operator+=</tt> overloads in
*************** meaning as the existing <tt>operator+=</
*** 45558,45582 ****
  elements. The suggestion to add a corresponding append function to
  <tt>valarray</tt> was not considered as appropriate and the request was
  withdrawn (c++std-lib-24968).
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Mark as NAD.  Request has been withdrawn by NB.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 26.6.2.6 [valarray.cassign]:
  </p>
  
! <blockquote><pre>valarray&lt;T&gt;&amp; operator+= (initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  
--- 34283,34308 ----
  elements. The suggestion to add a corresponding append function to
  <tt>valarray</tt> was not considered as appropriate and the request was
  withdrawn (c++std-lib-24968).
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Mark as NAD.  Request has been withdrawn by NB.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 26.6.2.7 [valarray.cassign]:
  </p>
  
! <blockquote><pre>
! valarray&lt;T&gt;&amp; operator+= (initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  
*************** Add to 26.6.2.6 [valarray.cassign]:
*** 45584,45636 ****
  
  
  <hr>
- <h3><a name="1244"></a>1244. wait_*() in *future for synchronous functions</h3>
- <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2009-10-22 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures">issues</a> in [futures].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- With the addition of <tt>async()</tt>, a <tt>future</tt> might be
- associated with a function that is not running in a different thread but
- is stored to by run synchronously on the <tt>get()</tt> call. It's not
- clear what the <tt>wait()</tt> functions should do in this case.
- </p>
- 
- <p>
- Suggested resolution:
- </p>
- 
- <p>
- Throw an exception.
- </p>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1246"></a>1246. <tt>vector::resize()</tt> missing efficiency guarantee</h3>
! <p><b>Section:</b> 23.4.1.2 [vector.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-10-24 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  If <tt>v</tt> is a <tt>vector</tt>, I think repeated calls to
--- 34310,34321 ----
  
  
  <hr>
  <h3><a name="1246"></a>1246. <tt>vector::resize()</tt> missing efficiency guarantee</h3>
! <p><b>Section:</b> 23.3.6.3 [vector.capacity] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2009-10-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  If <tt>v</tt> is a <tt>vector</tt>, I think repeated calls to
*************** If <tt>v</tt> is a <tt>vector</tt>, I th
*** 45638,45650 ****
  clear that's true from the text of the standard:
  </p>
  
! <blockquote><pre>void resize(size_type sz);
  </pre>
! <blockquote>
  <i>Effects:</i> If <tt>sz &lt; size()</tt>, equivalent to <tt>erase(begin() + sz, end());</tt>. If
  <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> default constructed elements to the
  sequence.
! </blockquote>
  </blockquote>
  
  <p>
--- 34323,34336 ----
  clear that's true from the text of the standard:
  </p>
  
! <blockquote><pre>
! void resize(size_type sz);
  </pre>
! <blockquote><p>
  <i>Effects:</i> If <tt>sz &lt; size()</tt>, equivalent to <tt>erase(begin() + sz, end());</tt>. If
  <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> default constructed elements to the
  sequence.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** the guarantee I'd like.  Thoughts?
*** 45657,45682 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively NAD after 5 positive votes on c++std-lib.  Rationale added
  below.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.4.1.2 [vector.capacity]/10, change
  </p>
  
! <blockquote><pre>void resize(size_type sz);
  </pre>
! <blockquote>
  <i>Effects:</i> If <tt>sz &lt; size()</tt>, equivalent to <tt>erase(begin() + sz, end());</tt>. If
  <tt>size() &lt; sz</tt>, <del>appends <tt>sz - size()</tt> default constructed elements to the
  sequence</del>
  <ins>equivalent to <tt>sz - size()</tt> consecutive evaluations of <tt>push_back(T())</tt></ins>.
! </blockquote>
  </blockquote>
  
  
--- 34343,34369 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively NAD after 5 positive votes on c++std-lib.  Rationale added
  below.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.3.6.3 [vector.capacity]/10, change
  </p>
  
! <blockquote><pre>
! void resize(size_type sz);
  </pre>
! <blockquote><p>
  <i>Effects:</i> If <tt>sz &lt; size()</tt>, equivalent to <tt>erase(begin() + sz, end());</tt>. If
  <tt>size() &lt; sz</tt>, <del>appends <tt>sz - size()</tt> default constructed elements to the
  sequence</del>
  <ins>equivalent to <tt>sz - size()</tt> consecutive evaluations of <tt>push_back(T())</tt></ins>.
! </p></blockquote>
  </blockquote>
  
  
*************** sequence</del>
*** 45686,45692 ****
  The description in terms of <tt>push_back</tt> led some to believe that
  one could expect the exact same growth pattern from both <tt>resize</tt> and
  <tt>push_back</tt> (e.g.) which could lead to sub-optimal implementations.
! Additionally, 23.4.1 [vector], p1 includes a statement that this container
  "supports (amortized) constant time insert and erase operations at the end;",
  therefore addressing the concern of this issue.
  </p>
--- 34373,34379 ----
  The description in terms of <tt>push_back</tt> led some to believe that
  one could expect the exact same growth pattern from both <tt>resize</tt> and
  <tt>push_back</tt> (e.g.) which could lead to sub-optimal implementations.
! Additionally, 23.3.6 [vector], p1 includes a statement that this container
  "supports (amortized) constant time insert and erase operations at the end;",
  therefore addressing the concern of this issue.
  </p>
*************** therefore addressing the concern of this
*** 45696,45761 ****
  
  
  <hr>
- <h3><a name="1248"></a>1248. Equality comparison for unordered containers</h3>
- <p><b>Section:</b> 23.7 [unord] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2009-10-25 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord">issues</a> in [unord].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- See
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2986.pdf">N2986</a>.
- </p>
- 
- <p><i>[
- 2010-01-22 Alisdair Opens.
- ]</i></p>
- 
- 
- <p><i>[
- 2010-01-24 Alisdair provides wording.
- ]</i></p>
- 
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3068.pdf">N3068</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Apply paper
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2986.pdf">N2986</a>.
- </p>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1251"></a>1251. move constructing <tt>basic_stringbuf</tt></h3>
! <p><b>Section:</b> 27.8.1.1 [stringbuf.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2009-10-29 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#stringbuf.cons">issues</a> in [stringbuf.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! I just came across issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a> -- Global permission to move, which
  seems to address the concern raised by the example in c++std-lib-25030.
  </p>
  <p>
  IIUC, the example violates the permission to assume that arguments
  bound to rvalue references are unnamed temporaries granted to
! implementations by the resolution of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a> - Global permission
  to move.
  </p>
  
--- 34383,34402 ----
  
  
  <hr>
  <h3><a name="1251"></a>1251. move constructing <tt>basic_stringbuf</tt></h3>
! <p><b>Section:</b> 27.8.2.1 [stringbuf.cons] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2009-10-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.cons">issues</a> in [stringbuf.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! I just came across issue <a href="lwg-defects.html#1204">1204</a> -- Global permission to move, which
  seems to address the concern raised by the example in c++std-lib-25030.
  </p>
  <p>
  IIUC, the example violates the permission to assume that arguments
  bound to rvalue references are unnamed temporaries granted to
! implementations by the resolution of issue <a href="lwg-defects.html#1204">1204</a> - Global permission
  to move.
  </p>
  
*************** guaranteed to be empty.
*** 45795,45804 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Strike from 27.8.1.1 [stringbuf.cons]:
  </p>
  
! <blockquote><pre>basic_stringbuf(basic_stringbuf&amp;&amp; rhs);
  </pre>
  <blockquote>
  <p>
--- 34436,34446 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Strike from 27.8.2.1 [stringbuf.cons]:
  </p>
  
! <blockquote><pre>
! basic_stringbuf(basic_stringbuf&amp;&amp; rhs);
  </pre>
  <blockquote>
  <p>
*************** if <tt>(epptr()) epptr() != rhs_a.epptr(
*** 45861,45870 ****
  
  <hr>
  <h3><a name="1259"></a>1259. Should initializer-list constructors move elements?</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2009-11-05 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to 23.2.3 [sequence.reqmts], <tt>X(il)</tt> is
--- 34503,34512 ----
  
  <hr>
  <h3><a name="1259"></a>1259. Should initializer-list constructors move elements?</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2009-11-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to 23.2.3 [sequence.reqmts], <tt>X(il)</tt> is
*************** overloads for the constructor, one for m
*** 45880,45889 ****
  ]</i></p>
  
  
! <blockquote>
  I've moved this issue to Tentatively NAD after 5 positive votes on c++std-lib,
  and added a rationale below.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 34522,34531 ----
  ]</i></p>
  
  
! <blockquote><p>
  I've moved this issue to Tentatively NAD after 5 positive votes on c++std-lib,
  and added a rationale below.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** survey.
*** 45906,45914 ****
  
  <hr>
  <h3><a name="1263"></a>1263. missing <tt>swap</tt> overloads for <tt>regex</tt></h3>
! <p><b>Section:</b> 28.4 [re.syn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-11-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses: UK 314</b></p>
--- 34548,34557 ----
  
  <hr>
  <h3><a name="1263"></a>1263. missing <tt>swap</tt> overloads for <tt>regex</tt></h3>
! <p><b>Section:</b> 28.4 [re.syn] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-11-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.syn">issues</a> in [re.syn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses: UK 314</b></p>
*************** UK 314, bringing consistency to the stan
*** 45960,45969 ****
  
  <hr>
  <h3><a name="1265"></a>1265. <tt>longjmp</tt> and destructors</h3>
! <p><b>Section:</b> 18.10 [support.runtime] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2009-11-16 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.runtime">issues</a> in [support.runtime].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  18.10 [support.runtime]/4 says that <tt>longjmp</tt> is undefined if
--- 34603,34613 ----
  
  <hr>
  <h3><a name="1265"></a>1265. <tt>longjmp</tt> and destructors</h3>
! <p><b>Section:</b> 18.10 [support.runtime] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2009-11-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#support.runtime">active issues</a> in [support.runtime].</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.runtime">issues</a> in [support.runtime].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  18.10 [support.runtime]/4 says that <tt>longjmp</tt> is undefined if
*************** destructors. However, the text as writte
*** 45972,45978 ****
  dealing with <tt>catch(...)</tt>:
  </p>
  
! <blockquote><pre>void foo() {
    jump_buf buf;
    non_trivial_dtor n1; // 1
    if (!setjmp(buf)) {
--- 34616,34623 ----
  dealing with <tt>catch(...)</tt>:
  </p>
  
! <blockquote><pre>
! void foo() {
    jump_buf buf;
    non_trivial_dtor n1; // 1
    if (!setjmp(buf)) {
*************** I suggest that paragraph 4 of 18.10 [sup
*** 46011,46024 ****
  with the following, or something that reads better but has the same effect:
  </p>
  
! <blockquote>
  The function signature <tt>longjmp(jmp_buf jbuf, int val)</tt> has more
  restricted behavior in this International Standard. A call to <tt>longjmp</tt>
  has undefined behavior if any non-trivial destructors would be called were the
  <tt>longjmp</tt> call replaced with a throw-expression whose nearest matching
  handler were a (possibly imaginary) function-try-block on the function
  containing the corresponding <tt>setjmp</tt> call.
! </blockquote>
  
  <p><i>[
  2009-11-17 Moved to Tentatively NAD after 5 positive votes on c++std-lib. 
--- 34656,34669 ----
  with the following, or something that reads better but has the same effect:
  </p>
  
! <blockquote><p>
  The function signature <tt>longjmp(jmp_buf jbuf, int val)</tt> has more
  restricted behavior in this International Standard. A call to <tt>longjmp</tt>
  has undefined behavior if any non-trivial destructors would be called were the
  <tt>longjmp</tt> call replaced with a throw-expression whose nearest matching
  handler were a (possibly imaginary) function-try-block on the function
  containing the corresponding <tt>setjmp</tt> call.
! </p></blockquote>
  
  <p><i>[
  2009-11-17 Moved to Tentatively NAD after 5 positive votes on c++std-lib. 
*************** Rationale added below.
*** 46032,46038 ****
  Change 18.10 [support.runtime]/4:
  </p>
  
! <blockquote>
  The function signature <tt>longjmp(jmp_buf jbuf, int val)</tt> has more
  restricted behavior in this International Standard. <del>A
  <tt>setjmp</tt>/<tt>longjmp</tt> call pair has undefined behavior if replacing
--- 34677,34683 ----
  Change 18.10 [support.runtime]/4:
  </p>
  
! <blockquote><p>
  The function signature <tt>longjmp(jmp_buf jbuf, int val)</tt> has more
  restricted behavior in this International Standard. <del>A
  <tt>setjmp</tt>/<tt>longjmp</tt> call pair has undefined behavior if replacing
*************** destructors would be called were the <tt
*** 46043,46049 ****
  throw-expression whose nearest matching handler were a (possibly imaginary)
  function-try-block on the function containing the corresponding <tt>setjmp</tt>
  call.</ins>
! </blockquote>
  
  
  <p><b>Rationale:</b></p>
--- 34688,34694 ----
  throw-expression whose nearest matching handler were a (possibly imaginary)
  function-try-block on the function containing the corresponding <tt>setjmp</tt>
  call.</ins>
! </p></blockquote>
  
  
  <p><b>Rationale:</b></p>
*************** sake of improved clarity is likely to do
*** 46062,47331 ****
  
  
  <hr>
- <h3><a name="1266"></a>1266. <tt>shared_future::get</tt> and deferred async functions</h3>
- <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-17 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- If a <tt>shared_future</tt> is constructed with the result of an <tt>async</tt> call with a
- deferred function, and two or more copies of that <tt>shared_future</tt> are created,
- with multiple threads calling <tt>get()</tt>, it is not clear which thread runs the
- deferred function. 30.6.7 [futures.shared_future]p22 from
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>
- says (minus editor's note):
- </p>
- 
- <blockquote>
- <i>Effects:</i> if the associated state contains a deferred function, executes
- the deferred function. Otherwise, blocks until the associated state is ready.
- </blockquote>
- 
- <p>
- In the absence of wording to the contrary, this implies that every thread that
- calls <tt>wait()</tt> will execute the deferred function.
- </p>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Replace 30.6.7 [futures.shared_future]p22 with the following:
- </p>
- 
- <blockquote>
- <p>
- <i>Effects:</i> If the associated state 
- <del>contains a deferred function, executes the deferred function. Otherwise,
- blocks until the associated state is ready.</del>
- <ins>was created by a <tt>promise</tt> or <tt>packaged_task</tt> object, block
- until the associated state is ready. If the associated state is associated with
- a thread created for an <tt>async</tt> call (30.6.9 [futures.async]), as
- if <tt>associated-thread.join()</tt>.
- </ins></p>
- 
- <p><ins>
- If the associated state contains a deferred function, calls to <tt>wait()</tt>
- on all <tt>shared_future</tt> objects that share the same associated state are
- serialized. The first call to <tt>wait()</tt> that shares a given associated
- state executes the deferred function and stores the return value or exception in
- the associated state.
- </ins></p>
- 
- <p><ins>
- <i>Synchronization:</i> if the associated state was created by a
- <tt>promise</tt> object, the completion of <tt>set_value()</tt> or
- <tt>set_exception()</tt> to that <tt>promise</tt> happens before (1.10 [intro.multithread]) <tt>wait()</tt> returns. If the associated state
- was created by a <tt>packaged_task</tt> object, the completion of the associated
- task happens before <tt>wait()</tt> returns. If the associated state is
- associated with a thread created for an <tt>async</tt> call (30.6.9 [futures.async]), the completion of the associated thread happens-before
- <tt>wait()</tt> returns.
- </ins></p>
- 
- <p><ins>
- If the associated state contained a deferred function, the invocation of the
- deferred function happens-before any call to <tt>wait()</tt> on a
- <tt>future</tt> that shares that state returns.
- </ins></p>
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1269"></a>1269. Associated state doesn't account for async</h3>
- <p><b>Section:</b> 30.6.4 [futures.state] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-18 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.state">active issues</a> in [futures.state].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.state">issues</a> in [futures.state].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- The current description of the associated state in 30.6.4 [futures.state]
- does not allow for futures created by an <tt>async</tt> call. The description
- therefore needs to be extended to cover that.
- </p>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Add a new sentence to 30.6.4 [futures.state] p2:
- </p>
- 
- <blockquote>
- 2 This <i>associated state</i> consists of some state information and some
- (possibly not yet evaluated) <i>result</i>, which can be a (possibly
- <tt>void</tt>) value or an exception. <ins>If the associated state was created
- by a call to <tt>async</tt> (30.6.9 [futures.async]) then it may also
- contain a deferred function or an associated <tt>thread</tt>.</ins>
- </blockquote>
- 
- <p>
- Add an extra bullet to 30.6.4 [futures.state] p3:
- </p>
- 
- <blockquote>
- <p>
- The result of an associated state can be set by calling:
- </p>
- <ul>
- <li>
- <tt>promise::set_value</tt>,
- </li>
- <li>
- <tt>promise::set_exception</tt>, <del>or</del>
- </li>
- <li>
- packaged_task::operator()<del>.</del><ins>, or</ins>
- </li>
- <li>
- <ins>a call to <tt>async</tt> (30.6.9 [futures.async]).</ins>
- </li>
- </ul>
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1272"></a>1272. confusing declarations of <tt>promise::set_value</tt></h3>
- <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-22 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- The definitions of <tt>promise::set_value</tt> need tidying up, the
- synopsis says:
- </p>
- 
- <blockquote><pre>// setting the result
- void set_value(const R&amp; r);
- void set_value(<i>see below</i>);
- </pre></blockquote>
- 
- <p>
- Why is the first one there?  It implies it is always present for all
- specialisations of promise, which is not true.
- </p>
- 
- <p>
- The definition says:
- </p>
- 
- <blockquote><pre>void set_value(const R&amp; r);
- void promise::set_value(R&amp;&amp; r);
- void promise&lt;R&amp;&gt;::set_value(R&amp; r);
- void promise&lt;void&gt;::set_value();
- </pre></blockquote>
- 
- <p>
- The lack of qualification on the first one again implies it's present
- for all specialisations, again not true.
- </p>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change the synopsis in 30.6.5 [futures.promise]:
- </p>
- 
- <blockquote><pre>// setting the result
- <del>void set_value(const R&amp; r);</del>
- void set_value(<i>see below</i>);
- </pre></blockquote>
- 
- <p>
- And the definition be changed by qualifying the first signature:
- </p>
- 
- <blockquote><pre>void <ins>promise::</ins>set_value(const R&amp; r);
- void promise::set_value(R&amp;&amp; r);
- void promise&lt;R&amp;&gt;::set_value(R&amp; r);
- void promise&lt;void&gt;::set_value();
- </pre></blockquote>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1273"></a>1273. <tt>future::valid</tt> should be callable on an invalid future</h3>
- <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-22 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- 30.6.6 [futures.unique_future]/3 says:
- </p>
- 
- <blockquote>
- The effect of calling any member function other than the destructor or
- the move-assignment operator on a <tt>future</tt> object for which <tt>valid() ==
- false</tt> is undefined.
- </blockquote>
- 
- <p>
- This means calling <tt>future::valid()</tt> is undefined unless it will
- return <tt>true</tt>, so you can only use it if you know the answer!
- </p>
- 
- <p><i>[
- 2009-12-08 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
- ]</i></p>
- 
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to NAD Editorial.  Rationale added below.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by N3058.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change 30.6.6 [futures.unique_future]/3:
- </p>
- 
- <blockquote>
- The effect of calling any member function other than the
- destructor<ins>,</ins> or the move-assignment operator<ins>, or
- <tt>valid</tt>,</ins> on a <tt>future</tt> object for which <tt>valid()
- == false</tt> is undefined.
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1274"></a>1274. <tt>atomic_future</tt> constructor</h3>
- <p><b>Section:</b> 30.6.8 [futures.atomic_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-22 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- In 30.6.8 [futures.atomic_future] this constructor:
- </p>
- 
- <blockquote><pre>atomic_future(future&lt;R&gt;&amp;&amp;);
- </pre></blockquote>
- 
- <p>
- is declared in the synopsis, but not defined. Instead
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">n2997</a>
- defines:
- </p>
- 
- <blockquote><pre>atomic_future(const future&lt;R&gt;&amp;&amp; rhs);
- </pre></blockquote>
- 
- <p>
- and
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">n3000</a>
- defines
- </p>
- 
- <blockquote><pre>atomic_future(atomic_future&lt;R&gt;&amp;&amp; rhs);
- </pre></blockquote>
- 
- <p>
- both of which are wrong. The constructor definition should be changed
- to match the synopsis.
- </p>
- 
- <p><i>[
- 2009-12-12 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
- ]</i></p>
- 
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to NAD Editorial.  Rationale added below.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by N3058.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Adjust the signature above 30.6.8 [futures.atomic_future]/6 like so:
- </p>
- 
- <blockquote><pre>atomic_future(<del>atomic_</del>future<ins>&lt;R&gt;</ins>&amp;&amp; rhs);
- </pre></blockquote>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1275"></a>1275. creating and setting futures</h3>
- <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-22 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures">issues</a> in [futures].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- 30.6.6 [futures.unique_future]/1 should be updated to mention
- <tt>async</tt>.
- </p>
- 
- <p>
- 30.6.7 [futures.shared_future]/1 should also be updated for
- <tt>async</tt>. That paragraph also says
- </p>
- 
- <blockquote>
- ... Its value or exception can be set by use of a
- <tt>shared_future</tt>, <tt>promise</tt> (30.6.5 [futures.promise]), or <tt>packaged_task</tt> (30.6.10 [futures.task]) object that shares the same associated state.
- </blockquote>
- 
- <p>
- How can the value be set by a <tt>shared_future</tt>?
- </p>
- 
- <p>
- 30.6.8 [futures.atomic_future]/1 says
- </p>
- 
- <blockquote>
- An <tt>atomic_future</tt> object can only be created by use of a
- <tt>promise</tt> (30.6.5 [futures.promise]) or
- <tt>packaged_task</tt> (30.6.10 [futures.task]) object.
- </blockquote>
- 
- <p>
- which is wrong, it's created from a <tt>std::future</tt>, which could
- have been default-cosntructed. That paragraph should be closer to the
- text of 30.6.7 [futures.shared_future]/1, and should also mention
- <tt>async</tt>.
- </p>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1281"></a>1281. CopyConstruction and Assignment between ratios having the same normalized form</h3>
- <p><b>Section:</b> 20.6.1 [ratio.ratio] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Vicente Juan Botet Escribá <b>Opened:</b> 2009-12-07 <b>Last modified:</b> 2010-11-24</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ratio.ratio">issues</a> in [ratio.ratio].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- CopyConstruction and Assignment between <tt>ratio</tt>s having the same
- normalized form. Current
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>
- do not allows to copy-construct or assign <tt>ratio</tt> instances of
- <tt>ratio</tt> classes having the same normalized form.
- </p>
- 
- <p>
- Two <tt>ratio</tt> classes <tt>ratio&lt;N1,D1&gt;</tt> and
- <tt>ratio&lt;N2,D2&gt;</tt> have the same normalized form if
- </p>
- 
- <blockquote><pre>ratio&lt;N1, D1&gt;::num == ratio&lt;N2, D2&gt;::num &amp;&amp;
- ratio&lt;N1, D1&gt;::den == ratio&lt;N2, D2&gt;::den
- </pre></blockquote>
- 
- <p>
- This simple example
- </p>
- 
- <blockquote><pre>ratio&lt;1,3&gt; r1;
- ratio&lt;3,9&gt; r2;
- r1 = r2; // (1)
- </pre></blockquote>
- 
- <p>
- fails to compile in (1). Other example
- </p>
- 
- <blockquote><pre>ratio&lt;1,3&gt; r1;
- ratio_subtract&lt;ratio&lt;2,3&gt;, ratio&lt;1,3&gt;&gt;::type r2;
- r1 = r2;  
- </pre></blockquote>
- 
- <p>
- The nested type of <tt>ratio_subtract&lt;ratio&lt;2,3&gt;,
- ratio&lt;1,3&gt;&gt;</tt> could be <tt>ratio&lt;3,9&gt;</tt> so the compilation
- could fail. It could also be <tt>ratio&lt;1,3&gt;</tt> and the compilation
- succeeds.
- </p>
- 
- <p>
- In 20.6.2 [ratio.arithmetic] 3 and similar clauses
- </p>
- 
- <blockquote>
- 3 The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
- T2&gt;</tt> where <tt>T1</tt> has the value <tt>R1::num * R2::den - R2::num *
- R1::den</tt> and <tt>T2</tt> has the value <tt>R1::den * R2::den</tt>.
- </blockquote>
- 
- <p>
- the meaning of synonym let think that the result shall be a normalized
- <tt>ratio</tt> equivalent to <tt>ratio&lt;T1, T2&gt;</tt>, but there is not an
- explicit definition of what synonym means in this context.
- </p>
- 
- <p>
- Additionally we should add a typedef for accessing the normalized
- <tt>ratio</tt>, and  change 20.6.2 [ratio.arithmetic] to return only this
- <em>normalized</em> result.
- </p>
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- There is no consensus to add the converting copy constructor or converting copy
- assignment operator.  However there was consensus to add the typedef.
- </p>
- 
- <p>
- Proposed wording modified.  Original proposed wording preserved here.  Moved to
- Review.
- </p>
- 
- <blockquote class="note">
- <p>
- Make <tt>ratio</tt> default constructible, copy-constructible and assignable
- from any <tt>ratio</tt> which has the same reduced form.
- </p>
- 
- <p>
- Add to 20.6.1 [ratio.ratio] synopsis
- </p>
- 
- <blockquote><pre>template &lt;intmax_t N, intmax_t D = 1&gt;
- class ratio {
- public:
-   static constexpr intmax_t num;
-   static constexpr intmax_t den;
- 
-   <ins>typedef ratio&lt;num, den&gt; type;</ins>
- 
-   <ins>ratio() = default;
-   template &lt;intmax_t N2, intmax_t D2&gt;
-     ratio(const ratio&lt;N2, D2&gt;&amp;);
-   template &lt;intmax_t N2, intmax_t D2&gt;
-     ratio&amp; operator=(const ratio&lt;N2, D2&gt;&amp;);</ins>
- };
- </pre></blockquote>
- 
- <p>
- Add to 20.6.1 [ratio.ratio]:
- </p>
- 
- <blockquote>
- <p>
- Two ratio classes <tt>ratio&lt;N1,D1&gt;</tt> and <tt>ratio&lt;N2,D2&gt;</tt>
- have the same reduced form if <tt>ratio&lt;N1,D1&gt;::type</tt> is the same
- type as <tt>ratio&lt;N2,D2&gt;::type</tt>
- </p>
- 
- </blockquote>
- 
- <p>
- Add a new section: [ratio.cons]
- </p>
- 
- <blockquote>
- <p><b>
- Construction and assignment  [ratio.cons]
- </b></p>
- 
- <pre>template &lt;intmax_t N2, intmax_t D2&gt;
-   ratio(const ratio&lt;N2, D2&gt;&amp; r);
- </pre>
- 
- <blockquote>
- <p>
- <i>Effects:</i> Constructs a <tt>ratio</tt> object.
- </p>
- <p>
- <i>Remarks:</i> This constructor shall not participate in overload resolution
- unless <tt>r</tt> has the same reduced form as <tt>*this</tt>.
- </p>
- </blockquote>
- 
- <pre>template &lt;intmax_t N2, intmax_t D2&gt;
-   ratio&amp; operator=(const ratio&lt;N2, D2&gt;&amp; r);
- </pre>
- 
- <blockquote>
- <p>
- <i>Effects:</i> None.
- </p>
- <p>
- <i>Returns:</i> <tt>*this</tt>.
- </p>
- <p>
- <i>Remarks:</i> This operator shall not participate in overload resolution
- unless <tt>r</tt> has the same reduced form as <tt>*this</tt>.
- </p>
- </blockquote>
- 
- </blockquote>
- 
- <p>
- Change 20.6.2 [ratio.arithmetic] 
- </p>
- 
- <blockquote>
- <p>
- Implementations may use other algorithms to compute these values. If overflow
- occurs, a diagnostic shall be issued.
- </p>
- 
- <pre>template &lt;class R1, class R2&gt; struct ratio_add {
-   typedef <i>see below</i> type;
- };
- </pre>
- 
- <blockquote>
- The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
- T2&gt;<ins>::type</ins></tt> where <tt>T1</tt> has the value <tt>R1::num *
- R2::den + R2::num * R1::den</tt> and <tt>T2</tt> has the value <tt>R1::den *
- R2::den</tt>.
- </blockquote>
- 
- <pre>template &lt;class R1, class R2&gt; struct ratio_subtract {
-   typedef <i>see below</i> type;
- };
- </pre>
- 
- <blockquote>
- The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
- T2&gt;<ins>::type</ins></tt> where <tt>T1</tt> has the value <tt>R1::num *
- R2::den - R2::num * R1::den</tt> and <tt>T2</tt> has the value <tt>R1::den *
- R2::den</tt>.
- </blockquote>
- 
- <pre>template &lt;class R1, class R2&gt; struct ratio_multiply {
-   typedef <i>see below</i> type;
- };
- </pre>
- 
- <blockquote>
- The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
- T2&gt;<ins>::type</ins></tt> where <tt>T1</tt> has the value <tt>R1::num *
- R2::num</tt> and <tt>T2</tt> has the value <tt>R1::den * R2::den</tt>.
- </blockquote>
- 
- <pre>template &lt;class R1, class R2&gt; struct ratio_divide {
-   typedef <i>see below</i> type;
- };
- </pre>
- 
- <blockquote>
- The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
- T2&gt;<ins>::type</ins></tt> where <tt>T1</tt> has the value <tt>R1::num *
- R2::den</tt> and <tt>T2</tt> has the value <tt>R1::den * R2::num</tt>.
- </blockquote>
- 
- </blockquote>
- 
- </blockquote>
- 
- </blockquote>
- 
- <p><i>[
- 2010-03-27 Howard adds:
- ]</i></p>
- 
- 
- <blockquote>
- <p>
- Daniel brought to my attention the recent addition of the typedef <tt>type</tt>
- to the FCD
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3092.pdf">N3092</a>:
- </p>
- 
- <blockquote><pre>typedef ratio type;
- </pre></blockquote>
- 
- <p>
- This issue was discussed in Pittsburgh, and the decision there was to accept the
- typedef as proposed and move to Review.  Unfortunately the issue was accidently
- applied to the FCD, and incorrectly.  The FCD version of the typedef refers to
- <tt>ratio&lt;N, D&gt;</tt>, but the typedef is intended to refer to
- <tt>ratio&lt;num, den&gt;</tt> which in general is not the same type.
- </p>
- 
- <p>
- I've updated the wording to diff against
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3092.pdf">N3092</a>.
- </p>
- 
- </blockquote>
- 
- <p><i>[Batavia: NAD Editorial - see rationale below]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>Already fixed in working draft
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Add to 20.6.1 [ratio.ratio] synopsis
- </p>
- 
- <blockquote><pre>template &lt;intmax_t N, intmax_t D = 1&gt;
- class ratio {
- public:
-   static constexpr intmax_t num;
-   static constexpr intmax_t den;
- 
-   typedef ratio<ins>&lt;num, den&gt;</ins> type;
- };
- </pre></blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1282"></a>1282. A proposal to add std::split algorithm</h3>
- <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Igor Semenov <b>Opened:</b> 2009-12-07 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#algorithms">issues</a> in [algorithms].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <ol type="I">
- 
- <li>
- <p>
- Motivation and Scope
- </p>
- <p>
- Splitting strings into parts by some set of delimiters is an often task, but
- there is no simple and generalized solution in C++ Standard. Usually C++
- developers use <tt>std::basic_stringstream&lt;&gt;</tt> to split string into
- parts, but there are several inconvenient restrictions:
- </p>
- 
- <ul>
- <li>
- we cannot explicitly assign the set of delimiters;
- </li>
- <li>
- this approach is suitable only for strings, but not for other types of
- containers;
- </li>
- <li>
- we have (possible) performance leak due to string instantiation.
- </li>
- </ul>
- </li>
- 
- <li>
- <p>
- Impact on the Standard
- </p>
- <p>
- This algorithm doesn't interfere with any of current standard algorithms.
- </p>
- </li>
- 
- <li>
- <p>
- Design Decisions
- </p>
- <p>
- This algorithm is implemented in terms of input/output iterators. Also, there is
- one additional wrapper for <tt>const CharType *</tt> specified delimiters.
- </p>
- </li>
- 
- <li>
- <p>
- Example implementation
- </p>
- <pre>template&lt; class It, class DelimIt, class OutIt &gt;
- void split( It begin, It end, DelimIt d_begin, DelimIt d_end, OutIt out )
- {
-    while ( begin != end )
-    {
-        It it = std::find_first_of( begin, end, d_begin, d_end );
-        *out++ = std::make_pair( begin, it );
-        begin = std::find_first_of( it, end, d_begin, d_end,
-            std::not2( std::equal_to&lt; typename It::value_type &gt;() ) );
-    }
- }
- 
- template&lt; class It, class CharType, class OutIt &gt;
- void split( It begin, It end, const CharType * delim, OutIt out )
- {
-    split( begin, end, delim, delim + std::strlen( delim ), out );
- }
- </pre>
- </li>
- 
- <li>
- <p>
- Usage
- </p>
- <pre>std::string ss( "word1 word2 word3" );
- std::vector&lt; std::pair&lt; std::string::const_iterator, std::string::const_iterator &gt; &gt; v;
- split( ss.begin(), ss.end(), " ", std::back_inserter( v ) );
- 
- for ( int i = 0; i &lt; v.size(); ++i )
- {
-    std::cout &lt;&lt; std::string( v[ i ].first, v[ i ].second ) &lt;&lt; std::endl;
- }
- // word1
- // word2
- // word3
- </pre>
- </li>
- 
- </ol>
- 
- <p><i>[
- 2010-01-22 Moved to Tentatively NAD Future after 5 positive votes on c++std-lib.
- Rationale added below.
- ]</i></p>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- The LWG is not considering completely new features for standardization at this
- time.  We would like to revisit this good suggestion for a future TR and/or
- standard.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Add to the synopsis in 25.1 [algorithms.general]:
- </p>
- 
- <blockquote><pre>template&lt; class ForwardIterator1, class ForwardIterator2, class OutputIterator &gt;
-   void split( ForwardIterator1 first, ForwardIterator1 last,
-               ForwardIterator2 delimiter_first, ForwardIterator2 delimiter_last,
-               OutputIterator result );
- 
- template&lt; class ForwardIterator1, class CharType, class OutputIterator &gt;
-   void split( ForwardIterator1 first, ForwardIterator1 last,
-               const CharType * delimiters, OutputIterator result );
- </pre></blockquote>
- 
- <p>
- Add a new section [alg.split]:
- </p>
- 
- <blockquote><pre>template&lt; class ForwardIterator1, class ForwardIterator2, class OutputIterator &gt;
-   void split( ForwardIterator1 first, ForwardIterator1 last,
-               ForwardIterator2 delimiter_first, ForwardIterator2 delimiter_last,
-               OutputIterator result );
- </pre>
- 
- <blockquote>
- <p>
- 1. <i>Effects:</i> splits the range <tt>[first, last)</tt> into parts, using any
- element of <tt>[delimiter_first, delimiter_last)</tt> as a delimiter. Results
- are pushed to output iterator in the form of <tt>std::pair&lt;ForwardIterator1,
- ForwardIterator1&gt;</tt>. Each of these pairs specifies a maximal subrange of
- <tt>[first, last)</tt> which does not contain a delimiter.
- </p>
- <p>
- 2. <i>Returns:</i> nothing.
- </p>
- <p>
- 3. <i>Complexity:</i> Exactly <tt>last - first</tt> assignments.
- </p>
- </blockquote>
- 
- <pre>template&lt; class ForwardIterator1, class CharType, class OutputIterator &gt;
-   void split( ForwardIterator1 first, ForwardIterator1 last,
-               const CharType * delimiters, OutputIterator result );
- </pre>
- 
- <blockquote>
- <p>
- 1. <i>Effects:</i> split the range <tt>[first, last)</tt> into parts, using any
- element of <tt>delimiters</tt> (interpreted as zero-terminated string) as a
- delimiter. Results are pushed to output iterator in the form of
- <tt>std::pair&lt;ForwardIterator1, ForwardIterator1&gt;</tt>. Each of these
- pairs specifies a maximal subrange of <tt>[first, last)</tt> which does not
- contain a delimiter.
- </p>
- <p>
- 2. <i>Returns:</i> nothing.
- </p>
- <p>
- 3. <i>Complexity:</i> Exactly <tt>last - first</tt> assignments.
- </p>
- </blockquote>
- 
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1289"></a>1289. Generic casting requirements for smart pointers</h3>
- <p><b>Section:</b> 20.3 [utility] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
-  <b>Submitter:</b> Ion Gaztañaga <b>Opened:</b> 2009-12-14 <b>Last modified:</b> 2010-11-24</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility">issues</a> in [utility].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- In section 20.2.5 [allocator.requirements], Table 40 — Allocator requirements,
- the following expression is required for allocator pointers:
- </p>
- 
- <blockquote>
- <table border="1">
- <caption>Table 40 — Allocator requirements</caption>
- <tbody><tr>
- <th>Expression</th>
- <th>Return type</th>
- <th>Assertion/note<br>pre-/post-condition</th>
- <th>Default</th>
- </tr>
- <tr>
- <td><tt>static_cast&lt;X::pointer&gt;(w)</tt></td>
- <td><tt>X::pointer</tt></td>
- <td><tt>static_cast&lt;X::pointer&gt;(w) == p</tt></td>
- <td>&nbsp;</td>
- </tr>
- </tbody></table>
- </blockquote>
- 
- <p>
- To achieve this expression, a smart pointer writer must introduce an explicit
- conversion operator from <tt>smart_ptr&lt;void&gt;</tt> to
- <tt>smart_ptr&lt;T&gt;</tt> so that
- <tt>static_cast&lt;pointer&gt;(void_ptr)</tt> is a valid expression.
- Unfortunately this explicit conversion weakens the safety of a smart pointer
- since the following expression (invalid for raw pointers) would become valid:
- </p>
- 
- <blockquote><pre>smart_ptr&lt;void&gt; smart_v = ...;
- smart_ptr&lt;T&gt; smart_t(smart_v);
- </pre></blockquote>
- 
- <p>
- On the other hand, <tt>shared_ptr</tt> also defines its own casting functions in
- 20.9.10.2.10 [util.smartptr.shared.cast], and although it's unlikely that a
- programmer will use <tt>shared_ptr</tt> as <tt>allocator::pointer</tt>, having
- two different ways to do the same cast operation does not seem reasonable. A
- possible solution would be to replace <tt>static_cast&lt;X::pointer&gt;(w)</tt>
- expression with a user customizable (via ADL)
- <tt>static_pointer_cast&lt;value_type&gt;(w)</tt>, and establish the
- <tt>xxx_pointer_cast</tt> functions introduced by <tt>shared_ptr</tt> as the
- recommended generic casting utilities of the standard.
- </p>
- 
- <p>
- Unfortunately, we've experienced problems in Boost when trying to establish
- <tt>xxx_pointer_cast</tt> as customization points for generic libraries (<a href="http://objectmix.com/c/40424-adl-lookup-explicit-template-parameters.html">http://objectmix.com/c/40424-adl-lookup-explicit-template-parameters.html</a>)
- because these casting functions are called with explicit template parameters and
- the standard says in 14.8.1 [temp.arg.explicit] p.8 "Explicit template
- argument specification":
- </p>
- 
- <blockquote>
- 8 ...But when a function template with explicit template arguments is used, the
- call does not have the correct syntactic form unless there is a function
- template with that name visible at the point of the call. If no such name is
- visible, the call is not syntactically well-formed and argument-dependent lookup
- does not apply.
- </blockquote>
- 
- <p>
- So we can do this:
- </p>
- 
- <blockquote><pre>template&lt;class BasePtr&gt;
- void generic_ptr_swap(BasePtr p)
- {
-   //ADL customization point
-   swap(p, p);
-   //...
- }
- </pre></blockquote>
- 
- <p>
- but not the following:
- </p>
- 
- <blockquote><pre>template&lt;class BasePtr&gt;
- void generic_ptr_algo(BasePtr p)
- {
-   typedef std::pointer_traits&lt;BasePtr&gt;::template
-      rebind&lt;Derived&gt; DerivedPtr;
-   DerivedPtr dp = static_pointer_cast&lt;Derived&gt;(p);
- }
- </pre></blockquote>
- 
- <p>
- The solution to make <tt>static_pointer_cast</tt> a customization point is to
- add a generic declaration (no definition) of <tt>static_pointer_cast</tt> in a
- namespace (like <tt>std</tt>) and apply "<tt>using
- std::static_pointer_cast</tt>" declaration to activate ADL:
- </p>
- 
- <blockquote><pre>namespace std{
- 
- template&lt;typename U, typename T&gt;
- <i>unspecified</i>
- static_pointer_cast(T&amp;&amp;) = delete;
- 
- }
- 
- template&lt;class BasePtr&gt;
- void generic_ptr_algo(BasePtr p)
- {
-   typedef std::pointer_traits&lt;BasePtr&gt;::template
-      rebind&lt;Derived&gt; DerivedPtr;
- 
-   //ADL applies because static_pointer_cast is made
-   //  visible according to [temp.arg.explicit]/8
-   using std::static_pointer_cast;
- 
-   DerivedPtr dp = static_pointer_cast&lt;Derived&gt;(p);
- 
-   //...
- }
- </pre></blockquote>
- 
- <p>
- A complete solution will need also the definition of
- <tt>static_pointer_cast</tt> for raw pointers, and this definition has been
- present in Boost (<a href="http://www.boost.org/boost/pointer_cast.hpp">http://www.boost.org/boost/
- pointer_cast.hpp</a>) for years.
- </p>
- 
- <p><i>[
- 2010-03-26 Daniel made editorial adjustments to the proposed wording.
- ]</i></p>
- 
- 
- <p><i>[
- Moved to NAD Future at 2010-11 Batavia
- ]</i></p>
- 
- <blockquote>
- This is a new feature rather than a defect. 
- It can be added later: "this is such a hairy area that people will put up with changes"
- </blockquote>
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Add to section 20.3 [utility] Utility components, Header
- <tt>&lt;utility&gt;</tt> synopsis:
- </p>
- 
- <blockquote><pre>// 20.3.X, generic pointer cast functions
- 
- template&lt;typename U, typename T&gt;
- <i>unspecified</i>
- static_pointer_cast(T&amp;&amp;) = delete;
- 
- template&lt;typename U, typename T&gt;
- <i>unspecified</i>
- dynamic_pointer_cast(T&amp;&amp;) = delete;
- 
- template&lt;typename U, typename T&gt;
- <i>unspecified</i>
- const_pointer_cast(T&amp;&amp;) = delete;
- 
- //Overloads for raw pointers
- template&lt;typename U, typename T&gt;
- auto static_pointer_cast(T* t) -&gt; decltype(static_cast&lt;U*&gt;(t));
- 
- template&lt;typename U, typename T&gt;
- auto dynamic_pointer_cast(T* t) -&gt; decltype(dynamic_cast&lt;U*&gt;(t));
- 
- template&lt;typename U, typename T&gt;
- auto const_pointer_cast(T* t) -&gt; decltype(const_cast&lt;U*&gt;(t));
- </pre></blockquote>
- 
- <p>
- Add to section 20.3 [utility] Utility components, a new subclause
- 20.3.X Pointer cast utilities [pointer.cast]:
- </p>
- 
- <blockquote>
- <p>
- 20.3.X Pointer cast utilities [pointer.cast]
- </p>
- 
- <p>
- 1 The library defines generic pointer casting function templates so that template code
- can explicitly make these names visible and activate argument-dependent lookup
- for pointer cast calls.
- </p>
- 
- <pre>//Generic declarations
- template&lt;typename U, typename T&gt;
- <i>unspecified</i>
- static_pointer_cast(T&amp;&amp;) = delete;
- 
- template&lt;typename U, typename T&gt;
- <i>unspecified</i>
- dynamic_pointer_cast(T&amp;&amp;) = delete;
- 
- template&lt;typename U, typename T&gt;
- <i>unspecified</i>
- const_pointer_cast(T&amp;&amp;) = delete;
- </pre>
- 
- <p>
- 2 The library also defines overloads of these functions for raw pointers.
- </p>
- 
- <pre>//Overloads for raw pointers
- template&lt;typename U, typename T&gt;
- auto static_pointer_cast(T* t) -&gt; decltype(static_cast&lt;U*&gt;(t));
- </pre>
- 
- <blockquote>
- <i>Returns:</i> <tt>static_cast&lt;U*&gt;(t)</tt>
- </blockquote>
- 
- <pre>template&lt;typename U, typename T&gt;
- auto dynamic_pointer_cast(T* t) -&gt; decltype(dynamic_cast&lt;U*&gt;(t));
- </pre>
- 
- <blockquote>
- <i>Returns:</i> <tt>dynamic_cast&lt;U*&gt;(t)</tt>
- </blockquote>
- 
- <pre>template&lt;typename U, typename T&gt;
- auto const_pointer_cast(T* t) -&gt; decltype(const_cast&lt;U*&gt;(t));
- </pre>
- 
- <blockquote>
- <i>Returns:</i> <tt>const_cast&lt;U*&gt;(t)</tt>
- </blockquote>
- 
- <p>
- [<i>Example:</i>
- </p>
- 
- <blockquote><pre>#include &lt;utility&gt; //static_pointer_cast
- #include &lt;memory&gt;  //pointer_traits
- 
- class Base{};
- class Derived : public Base{};
- 
- template&lt;class BasePtr&gt;
- void generic_pointer_code(BasePtr b)
- {
-    typedef std::pointer_traits&lt;BasePtr&gt;::template
-       rebind&lt;Derived&gt; DerivedPtr;
- 
-    using std::static_pointer_cast;
-    //ADL applies now that static_pointer_cast is visible
-    DerivedPtr d = static_pointer_cast&lt;Derived&gt;(b);
- }
- </pre></blockquote>
- 
- <p>
- — <i>end example</i>]
- </p>
- 
- </blockquote>
- 
- <p>
- Replace in section 20.2.5 [allocator.requirements] Table 40 — Allocator
- requirements, the following table entries for allocator pointers:
- </p>
- 
- <blockquote>
- <table border="1">
- <caption>Table 40 — Allocator requirements</caption>
- <tbody><tr>
- <th>Expression</th>
- <th>Return type</th>
- <th>Assertion/note<br>pre-/post-condition</th>
- <th>Default</th>
- </tr>
- 
- <tr>
- <td><tt>static<ins>_pointer</ins>_cast&lt;<del>X::pointer</del><ins>T</ins>&gt;(w)</tt></td>
- <td><tt>X::pointer</tt></td>
- <td><tt>static<ins>_pointer</ins>_cast&lt;<del>X::pointer</del><ins>T</ins>&gt;(w) == p</tt></td>
- <td>&nbsp;</td>
- </tr>
- 
- <tr>
- <td><tt>static<ins>_pointer</ins>_cast&lt;<del>X::const_pointer</del><ins>const T</ins>&gt;(w)</tt></td>
- <td><tt>X::const_pointer</tt></td>
- <td><tt>static<ins>_pointer</ins>_cast&lt;<del>X::const_pointer</del><ins>const T</ins>&gt;(z) == q</tt></td>
- <td>&nbsp;</td>
- </tr>
- 
- </tbody></table>
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1291"></a>1291. exceptions thrown during <tt>promise::set_value</tt></h3>
- <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-18 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- In 30.6.5 [futures.promise]
- </p>
- 
- <p>
- Does <tt>promise&lt;R&gt;::set_value</tt> return normally if the copy/move
- constructor of <tt>R</tt> throws?
- </p>
- 
- <p>
- The exception could be caught and set using
- <tt>promise&lt;R&gt;::set_exception</tt>, or it could be allowed to leave the
- <tt>set_value</tt> call, but it's not clear which is intended. I suggest the
- exception should not be caught.
- </p>
- 
- <p>
- N.B. This doesn't apply to <tt>promise&lt;R&amp;&gt;::set_value</tt> or
- <tt>promise&lt;void&gt;::set_value</tt> because they don't construct a new
- object.
- </p>
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change 30.6.5 [futures.promise]/18:
- </p>
- 
- <blockquote>
- 18 <i>Throws:</i> <tt>future_error</tt> if its associated state is already
- ready<ins> or, for the first version an exception thrown by the copy constructor
- of <tt>R</tt>, or for the second version an exception thrown by the move
- constructor of <tt>R</tt></ins>.
- </blockquote>
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1296"></a>1296. <tt>map</tt> and <tt>multimap value_compare</tt> overspecified</h3>
! <p><b>Section:</b> 23.6.1 [map] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-12-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#map">issues</a> in [map].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The container class templates <tt>map</tt> and <tt>multimap</tt> both contain a
--- 34707,34717 ----
  
  
  <hr>
  <h3><a name="1296"></a>1296. <tt>map</tt> and <tt>multimap value_compare</tt> overspecified</h3>
! <p><b>Section:</b> 23.4.4 [map] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-12-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#map">issues</a> in [map].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The container class templates <tt>map</tt> and <tt>multimap</tt> both contain a
*************** mentioned in this issue.
*** 47375,47385 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! p2 23.6.1 [map]:
  Above the declaration of class <tt>value_compare</tt> in the map synopsis, add:
  </p>
  
! <blockquote><pre>template &lt;class Key, class T, class Compare = less&lt;Key&gt;,
            class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
  class map {
  public:
--- 34761,34772 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! p2 23.4.4 [map]:
  Above the declaration of class <tt>value_compare</tt> in the map synopsis, add:
  </p>
  
! <blockquote><pre>
! template &lt;class Key, class T, class Compare = less&lt;Key&gt;,
            class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
  class map {
  public:
*************** public:
*** 47394,47404 ****
  
  
  <p>
! p2 23.6.2 [multimap]:
  Above the declaration of class <tt>value_compare</tt> in the map synopsis, add:
  </p>
  
! <blockquote><pre>template &lt;class Key, class T, class Compare = less&lt;Key&gt;,
            class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
  class multimap {
  public:
--- 34781,34792 ----
  
  
  <p>
! p2 23.4.5 [multimap]:
  Above the declaration of class <tt>value_compare</tt> in the map synopsis, add:
  </p>
  
! <blockquote><pre>
! template &lt;class Key, class T, class Compare = less&lt;Key&gt;,
            class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
  class multimap {
  public:
*************** public:
*** 47415,47512 ****
  
  
  <hr>
- <h3><a name="1300"></a>1300. circular definition of <tt>promise::swap</tt></h3>
- <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-26 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- <p>
- 30.6.5 [futures.promise]/12 defines the effects of
- <tt>promise::swap(promise&amp;)</tt> as
- </p>
- 
- <blockquote><pre>void swap(promise&amp; other);
- </pre>
- <blockquote>
- 12 <i>Effects:</i> <tt>swap(*this, other)</tt>
- </blockquote>
- </blockquote>
- 
- <p>
- and 30.6.5 [futures.promise]/25 defines <tt>swap(promise&lt;R&amp;&gt;,
- promise&lt;R&gt;&amp;)</tt> as
- </p>
- 
- <blockquote><pre>template &lt;class R&gt;
-   void swap(promise&lt;R&gt;&amp; x, promise&lt;R&gt;&amp; y);
- </pre>
- <blockquote>
- 25 <i>Effects:</i> <tt>x.swap(y)</tt>.
- </blockquote>
- </blockquote>
- 
- <p><i>[
- 2010-01-13 Daniel added "Throws: Nothing."
- ]</i></p>
- 
- 
- <p><i>[
- 2010-01-14 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
- ]</i></p>
- 
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to NAD Editorial.  Rationale added below.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by N3058.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Change 30.6.5 [futures.promise] paragraph 12
- </p>
- 
- <blockquote><pre>void swap(promise&amp; other);
- </pre>
- <blockquote>
- <p>
- 12 <i>Effects:</i> <del><tt>swap(*this, other)</tt></del> <ins>Exchanges the
- associated
- states of <tt>*this</tt> and <tt>other</tt>.</ins>
- </p>
- <p>
- 13 ...
- </p>
- <p><ins>
- <i>Throws:</i> Nothing.
- </ins></p>
- </blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1301"></a>1301. <tt>clear()</tt> and assignment</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-01-01 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I propose that <tt>clear()</tt> be defined to be equivalent to
--- 34803,34813 ----
  
  
  <hr>
  <h3><a name="1301"></a>1301. <tt>clear()</tt> and assignment</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-01-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I propose that <tt>clear()</tt> be defined to be equivalent to
*************** I propose that <tt>clear()</tt> be defin
*** 47515,47521 ****
  
  <blockquote>
  <p>
! To: C++ libraries mailing list<br>
  Message c++std-lib-26465
  </p>
  
--- 34816,34822 ----
  
  <blockquote>
  <p>
! To: C++ libraries mailing list<br/>
  Message c++std-lib-26465
  </p>
  
*************** Bjarne Stroustrup schrieb/wrote:
*** 47531,47537 ****
  
  <blockquote>
  <p>
! To: C++ libraries mailing list<br>
  Message c++std-lib-26458
  </p>
  
--- 34832,34838 ----
  
  <blockquote>
  <p>
! To: C++ libraries mailing list<br/>
  Message c++std-lib-26458
  </p>
  
*************** Message c++std-lib-26458
*** 47539,47545 ****
  in table 94 we define <tt>clear()</tt> as:
  </p>
  
! <blockquote><pre>a.clear() void erase(begin(), end())
  post: size() == 0
  </pre></blockquote>
  
--- 34840,34847 ----
  in table 94 we define <tt>clear()</tt> as:
  </p>
  
! <blockquote><pre>
! a.clear() void erase(begin(), end())
  post: size() == 0
  </pre></blockquote>
  
*************** sense if we have to move an element, but
*** 47570,47576 ****
  <p>
  First, I read the newly proposed spec for <tt>clear()</tt> that it does in
  general <em>not</em> invalidate a previous past-the-end iterator value, but
! <tt>deque</tt> says in 23.3.2.3 [deque.modifiers] for the semantics of
  <tt>erase</tt> that erasures at the end will invalidate the past-the-end
  iterator. With removal of a direct binding between <tt>clear()</tt> and
  <tt>erase()</tt> there seem to be some fixes necessary. One way to fix that
--- 34872,34878 ----
  <p>
  First, I read the newly proposed spec for <tt>clear()</tt> that it does in
  general <em>not</em> invalidate a previous past-the-end iterator value, but
! <tt>deque</tt> says in 23.3.3.4 [deque.modifiers] for the semantics of
  <tt>erase</tt> that erasures at the end will invalidate the past-the-end
  iterator. With removal of a direct binding between <tt>clear()</tt> and
  <tt>erase()</tt> there seem to be some fixes necessary. One way to fix that
*************** would be to mention in Table 94 that thi
*** 47578,47584 ****
  iterator" and then to mention for all specific containers where this does not
  happen, the exception, [1] e.g. in <tt>std::vector</tt>. <tt>std::vector</tt>
  has no own specification of <tt>clear()</tt> and one aspect of the closed issue
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a> was to realize just that (indirectly via <tt>erase</tt>). IMO
  we should now add an extra specification for <tt>clear()</tt>. Btw.:
  <tt>std::vector::erase</tt> reads to me that it would invalidate previous
  past-the-end values (and that seems correct in general).
--- 34880,34886 ----
  iterator" and then to mention for all specific containers where this does not
  happen, the exception, [1] e.g. in <tt>std::vector</tt>. <tt>std::vector</tt>
  has no own specification of <tt>clear()</tt> and one aspect of the closed issue
! <a href="lwg-closed.html#1102">1102</a> was to realize just that (indirectly via <tt>erase</tt>). IMO
  we should now add an extra specification for <tt>clear()</tt>. Btw.:
  <tt>std::vector::erase</tt> reads to me that it would invalidate previous
  past-the-end values (and that seems correct in general).
*************** Rationale added below.
*** 47604,47610 ****
  
  <p><b>Rationale:</b></p>
  <p>
! Solved as proposed by LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>.
  </p>
  
  
--- 34906,34912 ----
  
  <p><b>Rationale:</b></p>
  <p>
! Solved as proposed by LWG <a href="lwg-defects.html#704">704</a>.
  </p>
  
  
*************** no <tt>erase()</tt>, <ins><tt>clear()</t
*** 47639,47675 ****
  </blockquote>
  
  <p>
! Replace the following words from Table 94 — Sequence container
  requirements (in addition to container) in 23.2.3 [sequence.reqmts]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 94 — Sequence container requirements (in addition to
  container)</caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  </tr>
  
  <tr>
  <td><tt>a.clear()</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>erase(begin(), end())</tt></del><br>
  <ins>Destroys all elements in the container a. Invalidates all references,
  pointers, and iterators referring to the elements of <tt>a</tt> and may
! invalidate the past-the-end iterator.</ins><br>
  post: <tt><del>size() == 0</del> <ins>a.empty() == true</ins></tt>.  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
! Add a new paragraph after 23.3.3.4 [forwardlist.modifiers]/23:
  </p>
  
! <blockquote><pre>void clear();
  </pre>
  
  <blockquote>
--- 34941,34978 ----
  </blockquote>
  
  <p>
! Replace the following words from Table 94 &mdash; Sequence container
  requirements (in addition to container) in 23.2.3 [sequence.reqmts]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 94 &mdash; Sequence container requirements (in addition to
  container)</caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
  </tr>
  
  <tr>
  <td><tt>a.clear()</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>erase(begin(), end())</tt></del><br/>
  <ins>Destroys all elements in the container a. Invalidates all references,
  pointers, and iterators referring to the elements of <tt>a</tt> and may
! invalidate the past-the-end iterator.</ins><br/>
  post: <tt><del>size() == 0</del> <ins>a.empty() == true</ins></tt>.  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
! Add a new paragraph after 23.3.4.5 [forwardlist.modifiers]/23:
  </p>
  
! <blockquote><pre>
! void clear();
  </pre>
  
  <blockquote>
*************** Add a new paragraph after 23.3.3.4 [forw
*** 47689,47706 ****
  
  <hr>
  <h3><a name="1302"></a>1302. different <tt>emplace</tt> semantics for sequence and associated containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.2.5 [unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-01-03 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to the new naming scheme introduced with
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2680.pdf">N2680</a>
  </p>
  
! <blockquote><pre>vector&lt;T&gt; v;
  v.emplace(v.begin(),x,y,z)
  </pre></blockquote>
  
--- 34992,35010 ----
  
  <hr>
  <h3><a name="1302"></a>1302. different <tt>emplace</tt> semantics for sequence and associated containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-01-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to the new naming scheme introduced with
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2680.pdf">N2680</a>
  </p>
  
! <blockquote><pre>
! vector&lt;T&gt; v;
  v.emplace(v.begin(),x,y,z)
  </pre></blockquote>
  
*************** v.emplace(v.begin(),x,y,z)
*** 47708,47714 ****
  now has a different semantics than
  </p>
  
! <blockquote><pre>set&lt;T&gt; s;
  s.emplace(s.begin(),x,y,z);
  </pre></blockquote>
  
--- 35012,35019 ----
  now has a different semantics than
  </p>
  
! <blockquote><pre>
! set&lt;T&gt; s;
  s.emplace(s.begin(),x,y,z);
  </pre></blockquote>
  
*************** code.
*** 47732,47738 ****
  <p>
  In fact, when I write the following simple function template:
  </p>
! <blockquote><pre>template &lt;typename T&gt;
  void doEmplace (T&amp; cont)
  {
     cont.emplace(cont.begin(),"nico","josuttis",42);
--- 35037,35044 ----
  <p>
  In fact, when I write the following simple function template:
  </p>
! <blockquote><pre>
! template &lt;typename T&gt;
  void doEmplace (T&amp; cont)
  {
     cont.emplace(cont.begin(),"nico","josuttis",42);
*************** There was no consensus to make this chan
*** 47799,47807 ****
  <p> In 23.2.5 [unord.req], change: </p>
  <blockquote> 
    <table border="1">
!     <caption>Table 96 — Associative container requirements (in addition to 
      container)</caption>
!     <tbody><tr> 
        <th>expression</th>
        <th>Return type</th>
        <th>Assertion/note pre-/post-condition</th>
--- 35105,35113 ----
  <p> In 23.2.5 [unord.req], change: </p>
  <blockquote> 
    <table border="1">
!     <caption>Table 96 &mdash; Associative container requirements (in addition to 
      container)</caption>
!     <tr> 
        <th>expression</th>
        <th>Return type</th>
        <th>Assertion/note pre-/post-condition</th>
*************** There was no consensus to make this chan
*** 47813,47821 ****
      <tr> 
        <td><tt>a_uniq.emplace<ins>_value</ins>(args)</tt></td>
        <td><tt>pair&lt;iterator, bool&gt;</tt></td>
!       <td>inserts a T object t constructed with std::forward&lt;Args&gt;(args)...<br>
          if and only if there is no element in the container with key equivalent 
!         to the key of t.<br>
          The bool component of the returned pair is true if and only if the insertion 
          takes place, and the iterator component of the pair points to the element 
          with key equivalent to the key of t.</td>
--- 35119,35127 ----
      <tr> 
        <td><tt>a_uniq.emplace<ins>_value</ins>(args)</tt></td>
        <td><tt>pair&lt;iterator, bool&gt;</tt></td>
!       <td>inserts a T object t constructed with std::forward&lt;Args&gt;(args)...<br/>
          if and only if there is no element in the container with key equivalent 
!         to the key of t.<br/>
          The bool component of the returned pair is true if and only if the insertion 
          takes place, and the iterator component of the pair points to the element 
          with key equivalent to the key of t.</td>
*************** There was no consensus to make this chan
*** 47842,47856 ****
      <tr> 
        <td colspan="4">... </td>
      </tr>
!   </tbody></table>
    
  </blockquote>
  <p> In 23.2.5 [unord.req], change: </p>
  <blockquote>
    <table border="1">
!     <caption>Table 98 — Unordered associative container requirements (in 
      addition to container)</caption>
!     <tbody><tr> 
        <th>expression</th>
        <th>Return type</th>
        <th>Assertion/note pre-/post-condition</th>
--- 35148,35162 ----
      <tr> 
        <td colspan="4">... </td>
      </tr>
!   </table>
    
  </blockquote>
  <p> In 23.2.5 [unord.req], change: </p>
  <blockquote>
    <table border="1">
!     <caption>Table 98 &mdash; Unordered associative container requirements (in 
      addition to container)</caption>
!     <tr> 
        <th>expression</th>
        <th>Return type</th>
        <th>Assertion/note pre-/post-condition</th>
*************** There was no consensus to make this chan
*** 47890,47917 ****
      <tr> 
        <td colspan="4">... </td>
      </tr>
!   </tbody></table>
  </blockquote>
  
  <p>
! In 23.6.1 [map], 23.6.3 [set], 23.7.1 [unord.map], 23.7.3 [unord.set], change:
  </p>
  <blockquote> 
!   <p><i>// modifiers:</i><br>
      <tt>template &lt;class... Args&gt; pair&lt;iterator, bool&gt; emplace<ins>_value</ins>(Args&amp;&amp;... 
!     args);<br>
      template &lt;class... Args&gt; iterator emplace<del>_hint</del>(const_iterator 
      position, Args&amp;&amp;... args);</tt></p>
  </blockquote>
  
  <p>
! In 23.6.2 [multimap], 23.6.4 [multiset], 23.7.2 [unord.multimap], 23.7.4 [unord.multiset], change:
  </p>
  <blockquote> 
!   <p><i>// modifiers:<br></i><tt>template &lt;class... Args&gt; iterator emplace<ins>_value</ins>(Args&amp;&amp;... 
!     args);<br>
      template &lt;class... Args&gt; iterator emplace<del>_hint</del>(const_iterator position, 
!     Args&amp;&amp;... args);<br>
      </tt> </p>
  </blockquote>
  
--- 35196,35223 ----
      <tr> 
        <td colspan="4">... </td>
      </tr>
!   </table>
  </blockquote>
  
  <p>
! In 23.4.4 [map], 23.4.6 [set], 23.5.4 [unord.map], 23.5.6 [unord.set], change:
  </p>
  <blockquote> 
!   <p><i>// modifiers:</i><br/>
      <tt>template &lt;class... Args&gt; pair&lt;iterator, bool&gt; emplace<ins>_value</ins>(Args&amp;&amp;... 
!     args);<br/>
      template &lt;class... Args&gt; iterator emplace<del>_hint</del>(const_iterator 
      position, Args&amp;&amp;... args);</tt></p>
  </blockquote>
  
  <p>
! In 23.4.5 [multimap], 23.4.7 [multiset], 23.5.5 [unord.multimap], 23.5.7 [unord.multiset], change:
  </p>
  <blockquote> 
!   <p><i>// modifiers:<br/></i><tt>template &lt;class... Args&gt; iterator emplace<ins>_value</ins>(Args&amp;&amp;... 
!     args);<br/>
      template &lt;class... Args&gt; iterator emplace<del>_hint</del>(const_iterator position, 
!     Args&amp;&amp;... args);<br/>
      </tt> </p>
  </blockquote>
  
*************** In 23.6.2 [multimap], 23.6.4 [multiset],
*** 47920,48246 ****
  
  
  <hr>
- <h3><a name="1304"></a>1304. missing preconditions for <tt>shared_future</tt></h3>
- <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-01-23 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p>
- The revised futures package in the current working paper simplified the
- <tt>is_ready/has_exception/has_value</tt> set of APIs, replacing them with a
- single 'valid' method.  This method is used in many places to signal pre- and
- post- conditions, but that edit is not complete.  Each method on a
- <tt>shared_future</tt> that requires an associated state should have a
- pre-condition that <tt>valid() == true</tt>.
- </p>
- 
- <p><i>[
- 2010-01-28 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
- ]</i></p>
- 
- 
- <p><i>[
- 2010 Pittsburgh:
- ]</i></p>
- 
- 
- <blockquote>
- Moved to NAD Editorial.  Rationale added below.
- </blockquote>
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by N3058.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Insert the following extra paragraphs:
- </p>
- 
- <p>
- In 30.6.7 [futures.shared_future]
- </p>
- 
- <blockquote><pre>shared_future();
- </pre>
- <blockquote>
- <p>
- 4 <i>Effects:</i> constructs ...
- </p>
- 
- <p><ins>
- <i>Postcondition:</i> <tt>valid() == false</tt>.
- </ins></p>
- 
- <p><ins>
- <i>Throws:</i> nothing.
- </ins></p>
- </blockquote>
- </blockquote>
- 
- <blockquote><pre>void wait() const;
- </pre>
- <blockquote>
- 
- <p><ins>
- <i>Requires:</i> <tt>valid() == true</tt>.
- </ins></p>
- 
- <p>
- 22 <i>Effects:</i> if the associated ...
- </p>
- </blockquote>
- </blockquote>
- 
- <blockquote><pre>template &lt;class Rep, class Period&gt;
-   bool wait_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) const;
- </pre>
- <blockquote>
- 
- <p><ins>
- <i>Requires:</i> <tt>valid() == true</tt>.
- </ins></p>
- 
- <p>
- 23 <i>Effects:</i> if the associated ...
- </p>
- </blockquote>
- </blockquote>
- 
- <blockquote><pre>template &lt;class Clock, class Duration&gt;
-   bool wait_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) const;
- </pre>
- <blockquote>
- 
- <p><ins>
- <i>Requires:</i> <tt>valid() == true</tt>.
- </ins></p>
- 
- <p>
- 25 <i>Effects:</i> blocks until ...
- </p>
- </blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
- <h3><a name="1305"></a>1305. preconditions for <tt>atomic_future</tt></h3>
- <p><b>Section:</b> 30.6.8 [futures.atomic_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
-  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-01-23 <b>Last modified:</b> 2010-10-23</p>
- <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
- <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
- <p><b>Discussion:</b></p>
- 
- <p>
- The revised futures package in the current working paper simplified the
- <tt>is_ready/has_exception/has_value</tt> set of APIs, replacing them with a
- single 'valid' method.  This method is used in many places to signal pre- and
- post- conditions, but that edit is not complete.  
- </p>
- 
- <p>
- Atomic future retains the extended earlier API, and provides defined,
- synchronized behaviour for all calls.  However, some preconditions and throws
- clauses are missing, which can easily be built around the new <tt>valid()</tt>
- api.  Note that for consistency, I suggest <tt>is_ready/has_exception/has_value
- throw</tt> an exception if <tt>valid()</tt> is not <tt>true</tt>, rather than
- return <tt>false</tt>.  I think this is implied by the existing pre-condition on
- <tt>is_ready</tt>.
- </p>
- 
- <p><i>[
- 2010-01-23 See discussion starting with Message c++std-lib-26666.
- ]</i></p>
- 
- 
- <p><i>[
- 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
- ]</i></p>
- 
- 
- 
- 
- <p><b>Rationale:</b></p>
- <p>
- Solved by
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
- </p>
- 
- 
- <p><b>Proposed resolution:</b></p>
- <p>
- Insert the following extra paragraphs:
- </p>
- 
- <p>
- In 30.6.8 [futures.atomic_future]
- </p>
- 
- <blockquote><pre>bool is_ready() const;
- </pre>
- <blockquote>
- <p>
- 17 <i><del>Precondition</del> <ins>Requires</ins>:</i> <tt>valid() == true</tt>.
- </p>
- 
- <p>
- 18 <i>Returns:</i> <tt>true</tt> only if the associated state is ready.
- </p>
- 
- <p><ins>
- <i>Throws:</i> <tt>future_error</tt> with an error condition of
- <tt>no_state</tt> if the precondition is not met.
- </ins></p>
- 
- </blockquote>
- </blockquote>
- 
- <blockquote><pre>bool has_exception() const;
- </pre>
- <blockquote>
- 
- <p><ins>
- <i>Requires:</i> <tt>valid() == true</tt>.
- </ins></p>
- 
- <p>
- 19 <i>Returns:</i> <tt>true</tt> only if the associated state is ready and
- contains an exception.
- </p>
- 
- <p><ins>
- <i>Throws:</i> <tt>future_error</tt> with an error condition of
- <tt>no_state</tt> if the precondition is not met.
- </ins></p>
- 
- </blockquote>
- </blockquote>
- 
- <blockquote><pre>bool has_value() const;
- </pre>
- <blockquote>
- 
- <p><ins>
- <i>Requires:</i> <tt>valid() == true</tt>.
- </ins></p>
- 
- <p>
- 20 <i>Returns:</i> <tt>true</tt> only if the associated state is ready and
- contains a value.
- </p>
- 
- <p><ins>
- <i>Throws:</i> <tt>future_error</tt> with an error condition of
- <tt>no_state</tt> if the precondition is not met.
- </ins></p>
- 
- </blockquote>
- </blockquote>
- 
- <blockquote><pre>void wait() const;
- </pre>
- <blockquote>
- 
- <p><ins>
- <i>Requires:</i> <tt>valid() == true</tt>.
- </ins></p>
- 
- <p>
- 22 <i>Effects:</i> blocks until ...
- </p>
- 
- <p><ins>
- <i>Throws:</i> <tt>future_error</tt> with an error condition of
- <tt>no_state</tt> if the precondition is not met.
- </ins></p>
- 
- </blockquote>
- </blockquote>
- 
- <blockquote><pre>template &lt;class Rep, class Period&gt;
-   bool wait_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) const;
- </pre>
- <blockquote>
- 
- <p><ins>
- <i>Requires:</i> <tt>valid() == true</tt>.
- </ins></p>
- 
- <p>
- 23 <i>Effects:</i> blocks until ...
- </p>
- 
- <p>
- 24 <i>Returns:</i> <tt>true</tt> only if ...
- </p>
- 
- <p><ins>
- <i>Throws:</i> <tt>future_error</tt> with an error condition of
- <tt>no_state</tt> if the precondition is not met.
- </ins></p>
- 
- </blockquote>
- </blockquote>
- 
- <blockquote><pre>template &lt;class Clock, class Duration&gt;
-   bool wait_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) const;
- </pre>
- <blockquote>
- 
- <p><ins>
- <i>Requires:</i> <tt>valid() == true</tt>.
- </ins></p>
- 
- <p>
- 25 <i>Effects:</i> blocks until ...
- </p>
- 
- <p>
- 26 <i>Returns:</i> <tt>true</tt> only if ...
- </p>
- 
- <p><ins>
- <i>Throws:</i> <tt>future_error</tt> with an error condition of
- <tt>no_state</tt> if the precondition is not met.
- </ins></p>
- 
- </blockquote>
- </blockquote>
- 
- 
- 
- 
- 
- 
- <hr>
  <h3><a name="1308"></a>1308. Concerns about <tt>initializer_list</tt> overloads of <tt>min</tt>,
  <tt>max</tt>, and <tt>minmax</tt></h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2010-02-02 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In San Francisco, June 2008, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2722.pdf">N2722</a>
  was adopted, replacing the variadic templates <tt>min</tt>, <tt>max</tt>, and
  <tt>minmax</tt> by overloads that have an <tt>initializer_list&lt;T&gt;</tt>
  parameter. The paper showed benchmark results wherein <tt>initializer_list</tt>
  versions of <tt>min</tt> appeared to outperform the corresponding variadic
  template. Unfortunately, in October 2009 a very serious error was detected in
! the benchmark. (<a href="http://accu.org/cgi-bin/wg21/message?wg=lib&msg=25210">c++std-lib-25210</a>).
  In fact, an <tt>initializer_list&lt;T&gt;</tt> version of <tt>min</tt> often
  appears to perform <i>worse</i> than the corresponding variadic template,
! especially when <tt>T</tt> has an expensive copy constructor (<a href="http://accu.org/cgi-bin/wg21/message?wg=lib&msg=25253">c++std-lib-25253</a>,
  <a href="http://www.xs4all.nl/~nd/dekkerware/issues/n2772_fix">http://www.xs4all.nl/~nd/dekkerware/issues/n2772_fix</a>).
  </p>
  <p>
--- 35226,35251 ----
  
  
  <hr>
  <h3><a name="1308"></a>1308. Concerns about <tt>initializer_list</tt> overloads of <tt>min</tt>,
  <tt>max</tt>, and <tt>minmax</tt></h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2010-02-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In San Francisco, June 2008, 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2722.pdf">N2722</a>
  was adopted, replacing the variadic templates <tt>min</tt>, <tt>max</tt>, and
  <tt>minmax</tt> by overloads that have an <tt>initializer_list&lt;T&gt;</tt>
  parameter. The paper showed benchmark results wherein <tt>initializer_list</tt>
  versions of <tt>min</tt> appeared to outperform the corresponding variadic
  template. Unfortunately, in October 2009 a very serious error was detected in
! the benchmark. (<a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=25210">c++std-lib-25210</a>).
  In fact, an <tt>initializer_list&lt;T&gt;</tt> version of <tt>min</tt> often
  appears to perform <i>worse</i> than the corresponding variadic template,
! especially when <tt>T</tt> has an expensive copy constructor 
! (<a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=25253">c++std-lib-25253</a>,
  <a href="http://www.xs4all.nl/~nd/dekkerware/issues/n2772_fix">http://www.xs4all.nl/~nd/dekkerware/issues/n2772_fix</a>).
  </p>
  <p>
*************** consequences:
*** 48251,48257 ****
  
  <ol>
  <li>
! They require that <tt>T</tt> is CopyConstructible. IMO that is too much of a
  constraint for a generic, general purpose function like
  <tt>std::min&lt;T&gt;</tt>.
  </li>
--- 35256,35262 ----
  
  <ol>
  <li>
! They require that <tt>T</tt> is <tt>CopyConstructible</tt>. IMO that is too much of a
  constraint for a generic, general purpose function like
  <tt>std::min&lt;T&gt;</tt>.
  </li>
*************** They potentially throw an exception, eve
*** 48260,48268 ****
  throws nothing. (And of course, less-than typically throws nothing.)
  </li>
  <li>
! They are inconsistent with C++03 std::<tt>min</tt> and std::<tt>max</tt>.
  Consider the subtle difference between <tt>const T&amp; c1 = min(a,b);</tt> and
! <tt>const T&amp; c2 = min({a,b});</tt> (<a href="http://accu.org/cgi-bin/wg21/message?wg=lib&msg=25265">c++std-lib-25265</a>)
  </li>
  <li>
  They do not conveniently support use cases that need to have a reference to the
--- 35265,35274 ----
  throws nothing. (And of course, less-than typically throws nothing.)
  </li>
  <li>
! They are inconsistent with C++03 <tt>std::min</tt> and <tt>std::max</tt>.
  Consider the subtle difference between <tt>const T&amp; c1 = min(a,b);</tt> and
! <tt>const T&amp; c2 = min({a,b});</tt> 
! (<a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=25265">c++std-lib-25265</a>)
  </li>
  <li>
  They do not conveniently support use cases that need to have a reference to the
*************** themselves have a size of <i>n</i>.
*** 48278,48303 ****
  In the future, this problem might be solvable by using an
  <tt>initializer_list</tt> of <i>const references</i>, instead:
  </p>
! <blockquote><pre>const T&amp; min(initializer_list&lt;const T&amp;&gt;);
  const T&amp; max(initializer_list&lt;const T&amp;&gt;);
  pair&lt;const T&amp;, const T&amp;&gt; minmax(initializer_list&lt;const T&amp;&gt;);
  </pre></blockquote>
  
  <p>
! It is unlikely that C++0x will support <tt>initializer_list&lt;const
! T&amp;&gt;</tt>, but technically it seems possible to add such a language
! feature after C++0x (<a href="http://accu.org/cgi-bin/wg21/message?wg=core&msg=15428">c++std-core-15428</a>).
  </p>
  <p>
  Variadic templates of <tt>min</tt>, <tt>max</tt>, and <tt>minmax</tt>, as
! proposed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2551.pdf">N2551</a>
  (Sylvain Pion), do have some other advantages over <tt>initializer_list</tt>
  overloads:
  </p>
  <ol>
  <li>
  It is likely that those variadic templates can be declared <tt>constexpr</tt>,
! now that <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3006.html#991">
  CWG issue #991</a> is in drafting status.
  </li>
  <li>
--- 35284,35313 ----
  In the future, this problem might be solvable by using an
  <tt>initializer_list</tt> of <i>const references</i>, instead:
  </p>
! <blockquote><pre>
! const T&amp; min(initializer_list&lt;const T&amp;&gt;);
  const T&amp; max(initializer_list&lt;const T&amp;&gt;);
  pair&lt;const T&amp;, const T&amp;&gt; minmax(initializer_list&lt;const T&amp;&gt;);
  </pre></blockquote>
  
  <p>
! It is unlikely that C++0x will support <tt>initializer_list&lt;const T&amp;&gt;</tt>, 
! but technically it seems possible to add such a language
! feature after C++0x 
! (<a href="http://accu.org/cgi-bin/wg21/message?wg=core&amp;msg=15428">c++std-core-15428</a>).
  </p>
  <p>
  Variadic templates of <tt>min</tt>, <tt>max</tt>, and <tt>minmax</tt>, as
! proposed by 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2551.pdf">N2551</a>
  (Sylvain Pion), do have some other advantages over <tt>initializer_list</tt>
  overloads:
  </p>
  <ol>
  <li>
  It is likely that those variadic templates can be declared <tt>constexpr</tt>,
! now that 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3006.html#991">
  CWG issue #991</a> is in drafting status.
  </li>
  <li>
*************** solution of
*** 48323,48333 ****
  
  
  
! <p><b>Rationale:</b></p>
  We prefer the solution of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2772.pdf">N2772</a>
  which will be reapplied.
! 
  
  <p><b>Proposed resolution:</b></p>
  <p>
--- 35333,35343 ----
  
  
  
! <p><b>Rationale:</b></p><p>
  We prefer the solution of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2772.pdf">N2772</a>
  which will be reapplied.
! </p>
  
  <p><b>Proposed resolution:</b></p>
  <p>
*************** Remove both variadic templates and <tt>i
*** 48338,48344 ****
  
  <blockquote>
  <p><i>[
! Note: This proposed resolution will resolve LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a> as NAD.
  ]</i></p>
  
  </blockquote>
--- 35348,35354 ----
  
  <blockquote>
  <p><i>[
! Note: This proposed resolution will resolve LWG <a href="lwg-closed.html#915">915</a> as NAD.
  ]</i></p>
  
  </blockquote>
*************** Note: This proposed resolution will reso
*** 48348,48471 ****
  
  
  <hr>
! <h3><a name="1311"></a>1311. multi-pass property of Forward Iterator underspecified</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-02-07 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The following example demonstrates code that would meet the guarantees of a
! Forward Iterator, but only permits a single traversal of the underlying
! sequence:
! </p>
! 
! <blockquote><pre>template&lt; typename ForwardIterator&gt;
! struct bad_iterator {
!   shared_ptr&lt;ForwardIterator&gt; impl;
! 
!   bad_iterator( ForwardIterator iter ) {
!      : impl{new ForwardIterator{iter} } 
!      {
!   }
! 
!   auto operator*() const -&gt; decltype(*ForwardIterator{}) {
!      return **impl;
!   }
! 
!   auto operator-&gt;() const -&gt; ForwardIterator {
!      return *impl;
!   }
! 
!   auto operator==(bad_iterator const &amp; rhs) {
!      return impl == rhs.impl;
!   }
! 
!   auto operator++() {
!      ++(*imp);
!   }
!   // other operations as necessary...
! };
! </pre></blockquote>
! 
! <p>
! Here, we use <tt>shared_ptr</tt> to wrap a forward iterator, so all iterators
! constructed from the same original iterator share the same 'value', and
! incrementing any one copy increments all others.
! </p>
! 
! <p>
! There is a missing guarantee, expressed by the following code sequence
! </p>
! 
! <blockquote><pre>FwdIter x = seq.begin();  // obtain forward iterator from a sequence
! FwdIter y = x;            // copy the iterator
! assert(x == y);           // iterators must be the same
! ++x;                      // increment *just one* iterator
! assert(x != y);           // iterators *must now be different*
! ++y;                      // increment the other iterator
! assert(x == y);           // now the iterators must be the same again
! </pre></blockquote>
! 
! <p>
! That inequality in the middle is an essential guarantee.  Note that this list is
! simplified, as each assertion should also note that they refer to exactly the
! same element <tt>(&amp;*x == &amp;*y)</tt> but I am not complicating the issue
! with tests to support proxy iterators, or value types overloading unary
! <tt>operator+</tt>.
! </p>
! 
! <p>
! I have not yet found a perverse example that can meet this additional
! constraint, and not meet the multi-pass expectations of a Forward Iterator
! without also violating other Forward Iterator requirements.
! </p>
! 
! <p>
! Note that I do not yet have standard-ready wording to resolve the problem, as
! saying this neatly and succinctly in 'standardese' is more difficult.
! </p>
! 
! <p><i>[
! 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
! ]</i></p>
! 
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1313"></a>1313. Seed sequence's param function not useful for pure  output iterator</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-02-07 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The Seed sequence requirements (26.5.1.2 [rand.req.seedseq]) require the
  existence of a member function
  </p>
  
! <blockquote><pre>template&lt;typename OutputIterator&gt;
  void param(OutputIterator ob);
  </pre></blockquote>
  
  <p>
  The fact that this function returns <tt>void</tt> instead of the value of
  <tt>ob</tt> after accepting the sequence data leads to the same problem as in
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a> - In case of pure output iterators there is no way to
  serialize further data into that data sink.
  </p>
  
--- 35358,35383 ----
  
  
  <hr>
! <h3><a name="1313"></a>1313. Seed sequence's param function not useful for pure output iterator</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-02-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The Seed sequence requirements (26.5.1.2 [rand.req.seedseq]) require the
  existence of a member function
  </p>
  
! <blockquote><pre>
! template&lt;typename OutputIterator&gt;
  void param(OutputIterator ob);
  </pre></blockquote>
  
  <p>
  The fact that this function returns <tt>void</tt> instead of the value of
  <tt>ob</tt> after accepting the sequence data leads to the same problem as in
! issue <a href="lwg-defects.html#865">865</a> - In case of pure output iterators there is no way to
  serialize further data into that data sink.
  </p>
  
*************** serialize further data into that data si
*** 48474,48505 ****
  ]</i></p>
  
  
! <blockquote>
  At the time this issue was opened, the suggested changes are with respect to an
  anticipated draft which does not yet exist.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  No technical counterarguments, but it is simply too late in the process
  to make this change at this point.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>
  <p>
! In Table 109 — Seed sequence requirements, expression "<tt>r.param(ob)</tt>"
! change the<br>
  Return type entry:
  </p>
  
! <blockquote><pre><del>void</del><ins>OutputIterator</ins>
  </pre></blockquote>
  </li>
  
--- 35386,35418 ----
  ]</i></p>
  
  
! <blockquote><p>
  At the time this issue was opened, the suggested changes are with respect to an
  anticipated draft which does not yet exist.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  No technical counterarguments, but it is simply too late in the process
  to make this change at this point.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>
  <p>
! In Table 109 &mdash; Seed sequence requirements, expression "<tt>r.param(ob)</tt>"
! change the<br/>
  Return type entry:
  </p>
  
! <blockquote><pre>
! <del>void</del><ins>OutputIterator</ins>
  </pre></blockquote>
  </li>
  
*************** Return type entry:
*** 48508,48514 ****
  In 26.5.7.1 [rand.util.seedseq], class seed_seq synopsis change
  </p>
  
! <blockquote><pre>template&lt;class OutputIterator&gt;
  <del>void</del><ins>OutputIterator</ins> param(OutputIterator dest) const;
  </pre></blockquote>
  </li>
--- 35421,35428 ----
  In 26.5.7.1 [rand.util.seedseq], class seed_seq synopsis change
  </p>
  
! <blockquote><pre>
! template&lt;class OutputIterator&gt;
  <del>void</del><ins>OutputIterator</ins> param(OutputIterator dest) const;
  </pre></blockquote>
  </li>
*************** In 26.5.7.1 [rand.util.seedseq], class s
*** 48522,48531 ****
  
  <hr>
  <h3><a name="1314"></a>1314. <tt>NULL</tt> and <tt>nullptr</tt></h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2010-02-07 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Currently, the 18.2 [support.types]/3 allows <tt>NULL</tt> to be any
--- 35436,35445 ----
  
  <hr>
  <h3><a name="1314"></a>1314. <tt>NULL</tt> and <tt>nullptr</tt></h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2010-02-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Currently, the 18.2 [support.types]/3 allows <tt>NULL</tt> to be any
*************** to be <tt>nullptr</tt>. This may lead to
*** 48535,48541 ****
  serious than with the C++98 version:
  </p>
  
! <blockquote><pre>void f(void*);
  void f(int);
  
  void g()
--- 35449,35456 ----
  serious than with the C++98 version:
  </p>
  
! <blockquote><pre>
! void f(void*);
  void f(int);
  
  void g()
*************** Standard (4.10).<sup>196</sup></del>
*** 48605,48654 ****
  </blockquote>
  
  <p>
! 20.9.13 [c.malloc]
  </p>
  
! <blockquote>
  7 The contents are the same as the Standard C library header
  <tt>&lt;string.h&gt;</tt>, with the change to <tt>memchr()</tt> specified in
  21.6 <ins>and the macro <tt>NULL</tt> defined to be <tt>nullptr</tt></ins>.
! </blockquote>
  
  
  <p>
! 20.12 [date.time]
  </p>
  
! <blockquote>
  2 The contents are the same as the Standard C library header
  <tt>&lt;time.h&gt;</tt><del>.</del><sup>232</sup> <ins>except the macro
  <tt>NULL</tt>, which is defined to be <tt>nullptr</tt>.</ins> The functions
  <tt>asctime</tt>, <tt>ctime</tt>, <tt>gmtime</tt>, and <tt>localtime</tt> are
  not required to avoid data races (17.6.4.8).
! </blockquote>
  
  
  <p>
  22.6 [c.locales]
  </p>
  
! <blockquote>
  2 The contents are the same as the Standard C library header
  <tt>&lt;locale.h&gt;</tt> <ins>except the macro <tt>NULL</tt>, which is defined
  to be <tt>nullptr</tt></ins>.
! </blockquote>
  
  <p>
! C.2.2.4 [diff.null]
  </p>
  
! <blockquote>
  1 The macro <tt>NULL</tt>, defined in any of <tt>&lt;clocale&gt;</tt>,
  <tt>&lt;cstddef&gt;</tt>, <tt>&lt;cstdio&gt;</tt>, <tt>&lt;cstdlib&gt;</tt>,
  <tt>&lt;cstring&gt;</tt>, <tt>&lt;ctime&gt;</tt>, or <tt>&lt;cwchar&gt;</tt>, is
  <ins>nullptr</ins> <del>an implementation-defined C++ null pointer constant in
  this International Standard (18.2).</del>
! </blockquote>
  
  
  
--- 35520,35569 ----
  </blockquote>
  
  <p>
! 20.7.13 [c.malloc]
  </p>
  
! <blockquote><p>
  7 The contents are the same as the Standard C library header
  <tt>&lt;string.h&gt;</tt>, with the change to <tt>memchr()</tt> specified in
  21.6 <ins>and the macro <tt>NULL</tt> defined to be <tt>nullptr</tt></ins>.
! </p></blockquote>
  
  
  <p>
! 20.12.8 [date.time]
  </p>
  
! <blockquote><p>
  2 The contents are the same as the Standard C library header
  <tt>&lt;time.h&gt;</tt><del>.</del><sup>232</sup> <ins>except the macro
  <tt>NULL</tt>, which is defined to be <tt>nullptr</tt>.</ins> The functions
  <tt>asctime</tt>, <tt>ctime</tt>, <tt>gmtime</tt>, and <tt>localtime</tt> are
  not required to avoid data races (17.6.4.8).
! </p></blockquote>
  
  
  <p>
  22.6 [c.locales]
  </p>
  
! <blockquote><p>
  2 The contents are the same as the Standard C library header
  <tt>&lt;locale.h&gt;</tt> <ins>except the macro <tt>NULL</tt>, which is defined
  to be <tt>nullptr</tt></ins>.
! </p></blockquote>
  
  <p>
! C.5.2.4 [diff.null]
  </p>
  
! <blockquote><p>
  1 The macro <tt>NULL</tt>, defined in any of <tt>&lt;clocale&gt;</tt>,
  <tt>&lt;cstddef&gt;</tt>, <tt>&lt;cstdio&gt;</tt>, <tt>&lt;cstdlib&gt;</tt>,
  <tt>&lt;cstring&gt;</tt>, <tt>&lt;ctime&gt;</tt>, or <tt>&lt;cwchar&gt;</tt>, is
  <ins>nullptr</ins> <del>an implementation-defined C++ null pointer constant in
  this International Standard (18.2).</del>
! </p></blockquote>
  
  
  
*************** this International Standard (18.2).</del
*** 48657,48672 ****
  
  <hr>
  <h3><a name="1315"></a>1315. return type of <tt>async</tt></h3>
! <p><b>Section:</b> 30.6.9 [futures.async] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-02-09 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Both overloads of <tt>async</tt> return <tt>future&lt;typename
  F::result_type&gt;</tt> which requires that <tt>F</tt> has a nested type. This
  prevents <tt>async</tt> being used with function pointers and makes the example
! in 30.6.9 [futures.async] invalid. I believe this is unintentional.
  </p>
  
  <p>
--- 35572,35587 ----
  
  <hr>
  <h3><a name="1315"></a>1315. return type of <tt>async</tt></h3>
! <p><b>Section:</b> 30.6.8 [futures.async] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Both overloads of <tt>async</tt> return <tt>future&lt;typename
  F::result_type&gt;</tt> which requires that <tt>F</tt> has a nested type. This
  prevents <tt>async</tt> being used with function pointers and makes the example
! in 30.6.8 [futures.async] invalid. I believe this is unintentional.
  </p>
  
  <p>
*************** use the latter.
*** 48723,48731 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD Editorial.  Rationale added below.
! </blockquote>
  
  
  
--- 35638,35646 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD Editorial.  Rationale added below.
! </p></blockquote>
  
  
  
*************** Solved by N3058.
*** 48740,48746 ****
  In 30.6.1 [futures.overview] paragraph 1:
  </p>
  
! <blockquote><pre>template &lt;class F, class... Args&gt;
    <del>future&lt;typename F::result_type&gt;</del>
    <ins>future&lt;typename result_of&lt;F(Args...)&gt;::type&gt;</ins>
    async(F&amp;&amp; f, Args&amp;&amp;... args);
--- 35655,35662 ----
  In 30.6.1 [futures.overview] paragraph 1:
  </p>
  
! <blockquote><pre>
! template &lt;class F, class... Args&gt;
    <del>future&lt;typename F::result_type&gt;</del>
    <ins>future&lt;typename result_of&lt;F(Args...)&gt;::type&gt;</ins>
    async(F&amp;&amp; f, Args&amp;&amp;... args);
*************** template &lt;class F, class... Args&gt;
*** 48751,48760 ****
  </pre></blockquote>
  
  <p>
! In 30.6.9 [futures.async] before paragraph 1
  </p>
  
! <blockquote><pre>template &lt;class F, class... Args&gt;
    <del>future&lt;typename F::result_type&gt;</del>
    <ins>future&lt;typename result_of&lt;F(Args...)&gt;::type&gt;</ins>
    async(F&amp;&amp; f, Args&amp;&amp;... args);
--- 35667,35677 ----
  </pre></blockquote>
  
  <p>
! In 30.6.8 [futures.async] before paragraph 1
  </p>
  
! <blockquote><pre>
! template &lt;class F, class... Args&gt;
    <del>future&lt;typename F::result_type&gt;</del>
    <ins>future&lt;typename result_of&lt;F(Args...)&gt;::type&gt;</ins>
    async(F&amp;&amp; f, Args&amp;&amp;... args);
*************** if <tt>decay&lt;F&gt;::type</tt> is <tt>
*** 48778,49062 ****
  
  
  <hr>
! <h3><a name="1317"></a>1317. make_hash</h3>
! <p><b>Section:</b> 20.8.15 [unord.hash] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> Nicolai M. Josuttis <b>Opened:</b> 2010-02-10 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Currently, the library lacks a convenient way to provide a hash function that
! can be used with the provided unordered containers to allow the usage of non
! trivial element types.
  </p>
  
! <p>
! While we can easily declare an
! </p>
  
- <blockquote><pre>std::unordered_set&lt;int&gt;
- </pre></blockquote>
  
  <p>
! or
  </p>
  
- <blockquote><pre>std::unordered_set&lt;std::string&gt;
- </pre></blockquote>
- 
  <p>
! we have no easy way to declare an <tt>unordered_set</tt> for a user defined
! type. IMO, this is a big obstacle to use unordered containers in practice. Note
! that in Java, the wide usage of <tt>HashMap</tt> is based on the fact that there
! is always a default hash function provided.
  </p>
  
! <p>
! Of course, a default hash function implies the risk to provide poor hash
! functions. But often even poor hash functions are good enough.
! </p>
  
  <p>
! While I really would like to see a default hash function, I don't propose it
! here because this would probably introduce a discussion that's too big for this
! state of C++0x.
  </p>
  
  <p>
! However, I strongly suggest at least to provide a convenience variadic template
! function <tt>make_hash&lt;&gt;()</tt> to allow an easy definition of a (possibly
! poor) hash function.
  </p>
  
! <p>
! As a consequence for a user-defined type such as
! </p>
  
- <blockquote><pre>class Customer {
-    friend class CustomerHash;
-    private:
-      string firstname;
-      string lastname;
-      long   no;
-    ...
-  };
- </pre></blockquote>
  
  <p>
! would allow to specify:
  </p>
  
! <blockquote><pre>class CustomerHash : public std::unary_function&lt;Customer, std::size_t&gt;
! {
!   public:
!     std::size_t operator() (const Customer&amp; c) const  {
!        return make_hash(c.firstname,c.lastname,c.no);
!     }
! };
! </pre></blockquote>
! 
! <p>
! instead of:
! </p>
  
- <blockquote><pre>class CustomerHash : public std::unary_function&lt;Customer, std::size_t&gt;
- {
-   public:
-     std::size_t operator() (const Customer&amp; c) const  {
-        return std::hash&lt;std::string&gt;()(c.firstname) +
-               std::hash&lt;std::string&gt;()(c.lastname) +
-               std::hash&lt;long&gt;()(c.no);
-     }
- };
- </pre></blockquote>
  
  <p>
! Note that, in principle, we can either specify that
  </p>
  
! <blockquote>
! <tt>make_hash</tt> returns the sum of a call of
! <tt>std::hash&lt;T&gt;()(x)</tt> for each argument <tt>x</tt> of type
! <tt>T</tt>
! </blockquote>
  
  <p>
! or we can specify that
  </p>
! 
  <blockquote>
! <tt>make_hash</tt> provides a hash value for each argument, for which a
! <tt>std::hash()</tt> function is provided
  </blockquote>
! 
! <p>
! with the possible note that the hash value may be poor or only a good hash value
! if the ranges of all passed arguments is equally distributed.
! </p>
! 
! <p>
! For my convenience, I propose wording that describes
! the concrete implementation.
! </p>
  
  <p><i>[
! 2010 Pittsburgh:  Moved to NAD Editorial, rationale added below.
  ]</i></p>
  
  
  
  
- <p><b>Rationale:</b></p>
- <p>
- There is no consensus to make this change at this time.
- </p>
  
  
- <p><b>Proposed resolution:</b></p>
- <p>
- In Function objects 20.8 [function.objects]
- in paragraph 2 at the end of the Header <tt>&lt;functional&gt;</tt> synopsis
- insert:
- </p>
  
! <blockquote><pre>// convenience functions
! template &lt;class T&gt;
!   size_t make_hash (const T&amp;);
! template &lt;class T, class... Types&gt;
!   size_t make_hash (const T&amp;, const Types&amp;...);
! </pre></blockquote>
  
- <p>
- In Class template hash 20.8.15 [unord.hash]
- add:
- </p>
  
! <blockquote>
! <p>
! <b>20.7.16.1 Hash creation functions [hash.creation]</b>
! </p>
  
- <pre>template &lt;class T&gt;
-   size_t make_hash (const T&amp; val);
- </pre>
  
! <blockquote>
! <i>Returns:</i> <tt>hash&lt;T&gt;()(val);</tt>
! </blockquote>
  
- <pre>template &lt;class T, class... Types&gt;
-   size_t make_hash (const T&amp; val, const Types&amp;... args);
- </pre>
  
- <blockquote>
- <i>Returns:</i> <tt>hash&lt;T&gt;()(val) + std::make_hash(args...)</tt>
- </blockquote>
  
! </blockquote>
  
  
  
  
  
  
  <hr>
! <h3><a name="1329"></a>1329. Data races on <code>vector&lt;bool&gt;</code></h3>
! <p><b>Section:</b> 23.2.2 [container.requirements.dataraces] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Jeffrey Yaskin <b>Opened:</b> 2010-03-09 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The common implementation of <tt>vector&lt;bool&gt;</tt> is as an
! unsynchronized bitfield.  The addition of 23.2.2 [container.requirements.dataraces]/2 would require either a
! change in representation or a change in access synchronization, both of
! which are undesireable with respect to compatibility and performance.
  </p>
  
! <p><i>[
! 2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
! ]</i></p>
  
  
  
  
- <p><b>Rationale:</b></p>
  <p>
! Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3069.html">N3069</a>.
  </p>
  
  
- <p><b>Proposed resolution:</b></p>
  <p>
! Container data races 23.2.2 [container.requirements.dataraces]
  </p>
  
  <p>
! Paragraph 1 is unchanged as follows:
  </p>
  
! <blockquote>
! 1 For purposes of avoiding data races (17.6.4.8), implementations shall
! consider the following functions to be <code>const</code>:
! <code>begin</code>, <code>end</code>, <code>rbegin</code>,
! <code>rend</code>, <code>front</code>, <code>back</code>,
! <code>data</code>, <code>find</code>, <code>lower_bound</code>,
! <code>upper_bound</code>, <code>equal_range</code>, and, except in
! associative containers, <code>operator[]</code>.
! </blockquote>
  
  <p>
! Edit paragraph 2 as follows:
  </p>
  
! <blockquote>
! 2 Notwithstanding (17.6.4.8), implementations are required to avoid data
! races when the contents of the contained object in different elements in
! the same sequence<ins>, excepting <code>vector&lt;bool&gt;</code>,</ins>
! are modified concurrently.
! </blockquote>
  
  <p>
! Edit paragraph 3 as follows:
  </p>
  
- <blockquote>
- 3 [<i>Note:</i>
- For a <code>vector&lt;int&gt; x</code> with a size greater than one,
- <code>x[1] = 5</code> and <code>*x.begin() = 10</code>
- can be executed concurrently without a data race,
- but <code>x[0] = 5</code> and <code>*x.begin() = 10</code>
- executed concurrently may result in a data race.
- <ins>As an exception to the general rule,
- for a <code>vector&lt;bool&gt; y</code>,
- <code>y[i] = true</code> may race with <code>y[j] = true</code>.</ins>
- —<i>end note</i>]
- </blockquote>
  
  
  
  
  
  
  <hr>
  <h3><a name="1331"></a>1331. incorporate move special member functions into library</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2010-03-10 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Review the library portion of the spec and incorporate the newly added
  core feature Move Special Member Functions (N3044).
  </p>
  
! <p><b>Rationale:</b></p>
  2010 Batavia: This has now been done to a large extent.
  
  
  
  
  <p><b>Proposed resolution:</b></p>
  
  
--- 35695,36140 ----
  
  
  <hr>
! <h3><a name="1318"></a>1318. N2982 removes previous allocator capabilities</h3>
! <p><b>Section:</b> 20.7.8.1 [allocator.traits.types] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2010-02-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1375">1375</a></p>
  <p><b>Discussion:</b></p>
+ <p><b>Addresses US-87</b></p>
  <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>
! says that containers should have a nested typedef that defines their
! <tt>reference_type</tt> as <tt>value_type&amp;</tt>; the previous
! standard deferred to the allocator to define its
! <tt>reference_type</tt>, and containers simply passed the allocator's
! typedef on. This change is a mistake. Allocators should define both a
! <tt>pointer</tt> type and a <tt>reference</tt> type. That's essential
! for their original purpose, which was to make different memory models
! transparent. If an allocator defines a <tt>pointer</tt> type that isn't
! compatible with a normal pointer it also has to define a corresponding
! <tt>reference</tt> type. For example (and please forgive a Windows-ism),
! if an allocator's pointer is <tt>T __far*</tt>, then it's
! <tt>reference</tt> has to be <tt>T __far&amp;</tt>. Otherwise everything
! crashes (under the hood, references are pointers and have to have the
! same memory access mechanics). Extensions such as this for more general
! memory models were explicitly encouraged by C++03, and the allocator's
! <tt>pointer</tt> and <tt>reference</tt> typedefs were the hooks for such
! extensions. Removing the allocator's <tt>reference</tt> and
! <tt>const_reference</tt> typedefs makes those extensions unimplementable
! and breaks existing implementations that rely on those hooks.
  </p>
  
! <p><i>[
! 2010-02-25 Alisdair adds:
! ]</i></p>
  
  
+ <blockquote>
  <p>
! <tt>vector&lt;bool&gt;::reference</tt> is a nested class, and not a typedef.  It
! should be removed from the list of containers when this change is made.
  </p>
  
  <p>
! In general, I am uncomfortable placing this reference requirement on each
! container, as I would prefer to require:
  </p>
  
! <blockquote><pre>
! is_same&lt;Container::reference, Container::iterator::reference&gt;
! </pre></blockquote>
  
  <p>
! This distinction is important, if we intend to support proxy iterators.  The
! iterator paper in the pre-Pittsburgh mailing
! (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3046.html">N3046</a>)
! does <em>not</em> make this proposal, but organises clause 24 in such a way this
! will be much easier to specify.
  </p>
  
  <p>
! The changes to clause 20 remain important for all the reasons Pete highlights.
  </p>
+ </blockquote>
  
! <p><i>[
! 2010 Batavia
! ]</i></p>
  
  
  <p>
! Removed <tt>vector</tt> from list of templates that should be adjusted as of meeting outcome.
  </p>
  
! <p><i>[
! 2010 post-Batavia
! ]</i></p>
  
  
  <p>
! Replaced <tt>vector&lt;bool&gt;</tt> reference by <tt>vector</tt> reference because of misinterpreting meeting typo.
! Additional corrected numbering in P/R to N3225 wording.
  </p>
  
! <p><i>[
! 2010-12-06 Daniel reopens
! ]</i></p>
! 
  
  <p>
! Unfortunately, the current P/R is defective for several reasons:
  </p>
! <ol>
! <li> Table 43 &mdash; Descriptive variable definitions still contains three
! references to <tt>T&amp;</tt>, namely in:
  <blockquote>
! <table border="1">
! <tr>
! <td>
! <tt>t</tt>
! </td>
! <td>a value of type <tt>const T&amp;</tt></td>
! </tr>
! <tr>
! <td>
! <tt>r</tt>
! </td>
! <td>a value of type <tt>T&amp;</tt> obtained by the expression <tt>*p</tt></td>
! </tr>
! <tr>
! <td>
! <tt>s</tt>
! </td>
! <td>a value of type <tt>const T&amp;</tt> obtained by the expression <tt>*q</tt>
! or by conversion from a value <tt>r</tt></td>
! </tr>
! </table>
  </blockquote>
! Especially the second and third items are misses in the 1318 P/R,
! e.g. in N2723 or in C++03 these were referring
! to <tt>X::reference</tt> and <tt>X::const_reference</tt>, resp.
! None of them is referenced anywhere in the allocator requirements
! table: <tt>r</tt> and <tt>s</tt> where historically needed to
! define the expressions <tt>a.address(r)</tt> and <tt>a.address(s)</tt> which are gone now,
! and <tt>t</tt> was needed to define the expression <tt>a.construct(p, t)</tt> which has been
! replaced by <tt>a.construct(p,args)</tt>.
! <p/>
! The easiest fix seems to be to remove all three rows from Table 43.
! </li>
! <li>
! Further-on, the current P/R suggests to replace the the current
! definitions of the adaptor classes
! <blockquote><pre>
! stack
! priority_queue
! queue
! </pre></blockquote>
! similar to the other container types, i.e. to define <tt>reference</tt> and
! <tt>const_reference</tt> now as
! <blockquote><pre>
! typedef typename allocator_traits&lt;Allocator&gt;::reference reference;
! typedef typename allocator_traits&lt;Allocator&gt;::const_reference const_reference;
! </pre></blockquote>
! This would not only be an ill-formed definition (because there is no name
! <tt>Allocator</tt> in scope), but it would also introduce a breakage compared to C++03,
! where these definitions where already referring to the definition of the wrapped 
! containers. So, the adaptor class templates should be removed from the current list.
! </li>
! <li>
! Then the current P/R wording leads to one further unexpected and unwanted change due to 
! the general formular used: <tt>match_result::reference</tt> is currently defined as
! <blockquote><pre>
! typedef const_reference reference;
! </pre></blockquote>
! because it is an <em>immutable</em> container (And we had this definition
! already in N2723). The application of the rule would change this silently.
! </li>
! <li>
! Finally the suggested wording for the <tt>unordered_</tt> containers is incomplete.
! The reason is a current inconsistency between these containers and the rest: While
! normally the definition of the pointer types is
! <blockquote><pre>
! typedef typename allocator_traits&lt;Allocator&gt;::pointer pointer;
! typedef typename allocator_traits&lt;Allocator&gt;::const_pointer const_pointer;
! </pre></blockquote>
! for the unordered containers they are
! <blockquote><pre>
! typedef typename allocator_type::pointer pointer;
! typedef typename allocator_type::const_pointer const_pointer;
! </pre></blockquote>
! These definitions are <em>not</em> equivalent, because allocators are no longer
! required to define typedefs <tt>pointer</tt> and <tt>const_pointer</tt>, the
! <tt>allocator_traits</tt> were invented as a further indirection to cope
! with that. I.e. for the unordered containers we need to bring both the definition
! of references <em>and</em> pointers in sync.
! </li>
! </ol>
  
  <p><i>[
! 2011-02-23 Daniel updates the proposed wording with support from Pablo
  ]</i></p>
  
  
+ <p>The update attempts to fix the backward-compatibility problem that we have
+ introduced by ignoring the C++03 member function overloads <tt>address</tt>
+ of allocator types in C++0x completely. The resolution attempts to fix that
+ by adding these functions as optional members of allocators that are considered
+ first before falling back to <tt>pointer_traits::pointer_to</tt>. This still
+ allows us to remove the unused symbol <tt>t</tt> from the table, but we adapt
+ the symbols <tt>r</tt> and <tt>s</tt> to purely refer to the typenames
+ <tt>reference</tt> and <tt>const_reference</tt>.</p>
  
+ <p><i>[2011-03-06 Daniel adapts numbering to N3242]</i></p>
  
  
+ <p><i>[2011-03-11 Daniel removes <tt>noexcept</tt> specifiers from <tt>address</tt> functions]</i></p>
  
  
! <p><i>[2011-03-12 Further wording improvements by Daniel and Pablo]</i></p>
  
  
! <p><i>[2011-03-22 Madrid]</i></p>
  
  
! <p>Closed as NAD, no consensus to make a change</p>
  
  
  
! <p><b>Rationale:</b></p><p>No consensus to make a change</p>
  
+ <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1330"></a>1330. Move container requirements into requirements tables</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-03-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Abstract:
! </p>
! <p>
! In general, it seems that in a couple of places container behavior is
! not described in requirement tables although it is a general behavior.
  </p>
  
! <p>
! History:
! </p>
  
+ <p>
+ Issue <a href="lwg-defects.html#676">676</a> added move semantics to unordered containers.
+ For the added insert functions the Editor requested to put their
+ semantic description into a requirements table rather than describing
+ them for each container individually. The text however was taken from
+ the associative containers, where we also have the semantics for each
+ container described. Also, <a href="lwg-defects.html#1034">1034</a> is to some extend
+ requesting a clarification of the requirement tables and it turned out
+ that in other places we have the same problem (e.g. we have no general
+ requirement for type pointer and const_pointer although each container
+ has them with issue <a href="lwg-defects.html#1306">1306</a>).
+ </p>
  
+ <p>
+ From my personal list of functions in requirement tables
+ and containers, the following types/functions are missing in
+ requirement tables:
+ </p>
  
+ <ul>
+ <li>
+ <tt>pointer</tt>, <tt>const_pointer</tt> in Table 91 (container requirements)
+ </li>
+ <li>
+ <p>
+ all copy constructors, copy constructors with allocator,
+  assignment operators, and insert operators
+  with move semantics for associative and unordered containers
+ </p>
+ <blockquote><pre>
+ ContType c1(c2&amp;&amp;)
+ ContType c1(c2&amp;&amp;,alloc)
+ c1 = c2&amp;&amp;
+ c.insert(val&amp;&amp;)
+ c.insert(pos,val&amp;&amp;)
+ </pre></blockquote>
+ </li>
+ </ul>
  
  <p>
! As a special case, we lack the following requirements for all sequence
! containers BUT array (so special wording or a new container category is
! required):
  </p>
  
+ <ul>
+ <li>
+ <p>
+ constructor with only a size argument
+ </p>
+ <blockquote><pre>
+ ContType c(num)
+ </pre></blockquote>
+ </li>
+ <li>
+ <p>
+ copy constructor with allocator and move semantics
+ </p>
+ <blockquote><pre>
+ ContType c1(c2&amp;&amp;,alloc)
+ </pre></blockquote>
+ </li>
+ <li>
+ <p>
+ all constructors that insert multiple elements with additional allocator
+ </p>
+ <blockquote><pre>
+ ContType c(num, val,alloc)
+ ContType c(beg, end,alloc)
+ ContType c(initlist,alloc)
+ </pre></blockquote>
+ </li>
+ <li>
+ <p>
+ all resize functiuons:
+ </p>
+ <blockquote><pre>
+ c.resize(num)
+ c.resize(num,val)
+ </pre></blockquote>
+ </li>
+ </ul>
  
  <p>
! Note that we also might have to add additional requirements on other
! places for sequence containers because having an allocator requires
! additional statements for the treatment of the allocators. E.g. swap for
! containers with allocators is not specified in any requirement table.
  </p>
  
  <p>
! And finally, if we have the requirements in the requirements tables, we
! can remove the corresponding descriptions for the individual container.
! However, note that sequence container requirements have NO complexity
! column, so that we still need container specific descriptions for the
! functions listed there.
  </p>
  
! <p><i>[
! 2010 Batavia
! ]</i></p>
  
  <p>
! While there is consensus that further cleaning up the container requirement
! tables would be a good thing, there is no feeling that this <em>must</em>
! be done in time for 0x.  The issue remains open, but Deferred.
  </p>
  
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
  
  <p>
! Closes as NAD. There are a number of deficiencies in the way the container
! requirements tables are presented, and the LWG welcomes further papers that
! will help clear up this presentation.
  </p>
  
  
  
  
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
  
  
  
  <hr>
  <h3><a name="1331"></a>1331. incorporate move special member functions into library</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2010-03-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Review the library portion of the spec and incorporate the newly added
  core feature Move Special Member Functions (N3044).
  </p>
  
! <p><b>Rationale:</b></p><p>
  2010 Batavia: This has now been done to a large extent.
+ </p>
+ 
+ 
  
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1348"></a>1348. Exception safety of unspecified types</h3>
+ <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-64</b></p>
+ <p>
+ There are a number of unspecified types used throughout
+ the library, such as the container iterators. Many of these
+ unspecified types have restrictions or expectations on
+ their behaviour in terms of exceptions. Are they permitted
+ or required to use exception specifications, more
+ specifically the new <tt>noexcept</tt> specification? For example,
+ if <tt>vector&lt;T>::iterator</tt> is implemented as a native pointer,
+ all its operations will have an (effective) <tt>noexcept</tt>
+ specification. If the implementation uses a class type to
+ implement this iterator, is it permitted or required to
+ support that same guarantee?
+ </p>
+ 
+ <p><i>[
+ Resolution proposed by ballot comment
+ ]</i></p>
  
+ <p>
+ Clearly state the requirements for exception
+ specifications on all unspecified library types. For
+ example, all container iterator operations should
+ be conditionally <tt>noexcept</tt>, with the condition
+ matching the same operation applied to the
+ allocator's <tt>pointer_type</tt>, a certain subset of which
+ are already required not to throw.
+ </p>
+ 
+ <p><i>[2011-03-24 Madrid meeting]</i></p>
  
  
+ <p>Discussion:</p>
+ <p>Alisdair: Probably an NAD Future at least but could be NAD.
+ <p/>
+ Daniel K: Approach is not consistent with what we've decided with <tt>noexcept</tt>.
+ <p/>
+ Alisdair: Any objection to marking 1348 as NAD?
+ <p/>
+ No objections. 
+ </p>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p><p>Standard is correct as written</p>
  <p><b>Proposed resolution:</b></p>
  
  
*************** core feature Move Special Member Functio
*** 49064,49076 ****
  
  
  <hr>
! <h3><a name="1350"></a>1350. [FCD] Implicit contructors accidentally made some library types move-only</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-25</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1421">1421</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-15</b></p>
  <p>
--- 36142,36154 ----
  
  
  <hr>
! <h3><a name="1350"></a>1350. Implicit contructors accidentally made some library types move-only</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1421">1421</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-15</b></p>
  <p>
*************** Make them copyable again.
*** 49094,49106 ****
  
  
  <hr>
! <h3><a name="1351"></a>1351. [FCD] Replace dynamic exception specifications with <tt>noexcept</tt></h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-25</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1344">1344</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses CH-16</b></p>
--- 36172,36184 ----
  
  
  <hr>
! <h3><a name="1351"></a>1351. Replace dynamic exception specifications with <tt>noexcept</tt></h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1344">1344</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses CH-16</b></p>
*************** Replace dynamic exception specifications
*** 49125,49137 ****
  
  
  <hr>
! <h3><a name="1352"></a>1352. [FCD] Apply <tt>noexcept</tt> where library specification says "Throws: Nothing"</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-25</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1346">1346</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses CH-17</b></p>
--- 36203,36215 ----
  
  
  <hr>
! <h3><a name="1352"></a>1352. Apply <tt>noexcept</tt> where library specification says "Throws: Nothing"</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1346">1346</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses CH-17</b></p>
*************** the respective noexcept specification.
*** 49157,49167 ****
  
  
  <hr>
! <h3><a name="1359"></a>1359. [FCD] Add <tt>&lt;tuple&gt;</tt> and <tt>&lt;utility&gt;</tt> to freestanding implementations</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-56</b></p>
  <p>
--- 36235,36446 ----
  
  
  <hr>
! <h3><a name="1358"></a>1358. Add <tt>&lt;chrono&gt;</tt> and <tt>&lt;ratio&gt;</tt> to
! freestanding implementations</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-55</b></p>
! <p>
! The <tt>&lt;thread&gt;</tt> header uses <tt>duration</tt> types, found in the
! <tt>&lt;chrono&gt;</tt> header, and which rely on the <tt>ratio</tt> types
! declared in the <tt>&lt;ratio></tt> header.
! </p>
! 
! <p><i>[
! Extracts from lengthy Rapperswil discussion:
! ]</i></p>
! 
! <p>
! There is a concern that this issue is a misunderstanding of the actual
! requirements of a free-standing implementation to support the <tt>&lt;thread></tt>
! header.  In general, a free-standanding implementation will provide an <em>empty</em>
! header, specifically so that a user can test for the absence of the 
! <tt>_ _ STDCPP_THREADS _ _</tt> macro.  This idiom as used as there is no portable 
! way to test for the lack of a header.
! </p>
! <p>
! At this point, it was suggested the NB comment is trying to solve the wrong problem, 
! and that <tt>_ _ STDCPP_THREADS _ _</tt> should be a pre-defined macro in clause 16 
! that can be tested before including <tt>&lt;thread&gt;</tt>.  That would remove the 
! need to add additional headers to the free-standanding requirements.
! </p>
! <p>
! It is worth noting that Japan requested <tt>&lt;ratio&gt;</tt> as a free-standing header 
! in their CD1 comments.  No-one seemed keen to require clocks of a free-standing 
! implementation though.
! </p>
! 
! <p>Detlef volunteers to look at a way to redraft 17.6.1.3 p3.</p> 
! 
! <p><i>[
! Original resolution proposed by NB comment:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Add the <tt>&lt;chrono&gt;</tt> and <tt>&lt;ratio&gt;</tt> headers to the
! freestanding requirements.
! </p>
! <p>
! It might be necessary to address scaled-down
! expectations of clock support in a freestanding
! environment, much like <tt>&lt;thread&gt;</tt>.
! </p>
! </blockquote>
! 
! <p><i>[2011-02-25: Alberto drafts wording]</i></p>
! 
! 
! <p><i>[2011-03-06: Daniel observes:]</i></p>
! 
! 
! <p>Accepting the proposal <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3256.html">n3256</a> 
! would solve this issue.</p>
! 
! <p><i>[2011-03-24 Madrid meeting]</i></p>
! 
! 
! <p>Freestanding no longer requires <tt>&lt;thread&gt;</tt> header</p>
! 
! 
! <p><b>Rationale:</b></p><p>We are not adding new headers to freestanding at this point.</p>
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li><p>Add a new entry in Table 14 &mdash; C++ library headers:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 14 &mdash; C++ library headers</caption>
! <tr>
! <td style="text-align:center;">&hellip;</td>
! </tr>
! <tr>
! <td><tt>&lt;iterator&gt;</tt></td>
! </tr>
! <tr>
! <td><ins><tt>&lt;library_support&gt;</tt></ins></td>
! </tr>
! <tr>
! <td><tt>&lt;limits&gt;</tt></td>
! </tr>
! <tr>
! <td style="text-align:center;">&hellip;</td>
! </tr>
! </table>
! </blockquote>  
! </li>
! 
! <li><p>Remove the last row 30.3 [thread.threads] <tt>&lt;threads&gt;</tt>
! from Table 16 &mdash; C++ headers for freestanding implementations and insert
! a new one instead (To the editor: For the actual target Clause please see the comment
! in bullet 5 of this proposed resolution):</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 16 &mdash; C++ headers for freestanding implementations</caption>
! 
! <tr>
! <th>Subclause</th>
! <th>Header(s)</th>
! </tr>
! 
! <tr>
! <td colspan="2" style="text-align:center;">&hellip;</td>
! </tr>
! 
! <tr>
! <td><del>30.3 [thread.threads] Threads</del></td>
! <td><del><tt>&lt;thread&gt;</tt></del></td>
! </tr>
! 
! <tr>
! <td><ins>?? Library support</ins></td>
! <td><ins><tt>&lt;library_support&gt;</tt></ins></td>
! </tr>
! 
! </table>
! 
! </blockquote>
!  </li>
!  
!  <li><p>Modify paragraph 17.6.1.3 [compliance] p. 3:</p>
!  <blockquote><p>
!  3 The supplied version of the header <tt>&lt;cstdlib&gt;</tt> shall declare at least the functions 
!  <tt>abort</tt>, <tt>atexit</tt>, <tt>at_quick_exit</tt>, <tt>exit</tt>, and <tt>quick_exit</tt> 
!  (18.5). <del>The supplied version of the header <tt>&lt;thread&gt;</tt> shall meet the
! same requirements as for a hosted implementation or including it shall have no effect</del>. The 
! other headers listed in this table shall meet the same requirements as for a hosted 
! implementation. <ins>A program can detect the presence of standard headers not listed in Table
! 16 using the facilities provided by the <tt>&lt;library_support&gt;</tt> header.</ins>
! </p></blockquote>
! </li>
!  
! <li><p>Remove the following line from the header <tt>&lt;thread&gt;</tt> synopsis in 
! 30.3 [thread.threads] p. 1:</p>
! <blockquote><pre>
! namespace std {
!   <del>#define __STDCPP_THREADS__ __cplusplus</del>
! 
!   class thread;
!   [...]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Add a new section in Clause 18 or 20 (or any other suitable place at
! the editor's discretion):</p>
! 
! <blockquote>
! <p><ins>?? Library support [library.support]</ins></p>
! <blockquote><p>
! <ins>The header <tt>&lt;library_support&gt;</tt> defines an implementation-defined set 
! of macros to allow a program detect the presence of standard headers in freestanding
! implementations. [<i>Note</i>: Hosted implementations shall provide all
! standard headers, thus shall provide all macros. &mdash; <i>end note</i>]</ins>
! </p></blockquote>
! <blockquote><p>
! <ins>For each standard header listed in Tables 14 (C++ library headers) and 15 (C++ headers for C library facilities)
! that is provided by the implementation, <tt>&lt;library_support&gt;</tt> shall define a macro with name 
! <code>_ _HAS_<i>XXX</i>_HEADER_ _</code> where <code><i>XXX</i></code> is replaced by the uppercase version of the 
! name of the header. Each such macro shall expand to the value <code>_ _cplusplus</code>.
! [<i>Example</i>:</ins></p>
! <blockquote><pre>
! <ins>#include &lt;library_support&gt;
! 
! #ifdef _ _HAS_THREADS_HEADER_ _
!   #include &lt;threads&gt;
!   // code that exploit the presence of threads
! #else
!   // fallback code that doesn't rely on threads
! #endif</ins>
! </pre></blockquote>
! <p><ins>&mdash; <i>end example</i>]</ins></p>
! </blockquote>
! <blockquote><p>
! <ins>No other standard header shall define macros with a name beginning with <code>_ _HAS_</code>
! and ending with <code>_HEADER_ _</code>.</ins>
! </p></blockquote>
! 
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1359"></a>1359. Add <tt>&lt;tuple&gt;</tt> and <tt>&lt;utility&gt;</tt> to freestanding implementations</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-56</b></p>
  <p>
*************** Summary of Rapperswil discusions
*** 49186,49196 ****
  ]</i></p>
  
  <p>
! The preference of the meeting was to extract the rvalue-reference related utilities and swap into a freestanding header, but there was no clear preference for a name.  Howard suggested simply dropping them into <tt>&lt;type_traits&gt;</tt> as both these utilities and type traits are used pretty much everywhere in the library implementation, it is the most convenient place to keep them (from an implementer's perspective).
  </p>
  
  <p>
! Poll: Two-way: New header for forward, move, swap, move_with_noexcept and declval vs. calling out forward, move, swap, move_with_noexcept and declval as freestanding explicitly?
  
  SF new header: 4 WF new header: 3 WF call out as freestanding: 1 SF call out as freestanding: 2
  
--- 36465,36481 ----
  ]</i></p>
  
  <p>
! The preference of the meeting was to extract the rvalue-reference related utilities 
! and swap into a freestanding header, but there was no clear preference for a name.  
! Howard suggested simply dropping them into <tt>&lt;type_traits&gt;</tt> as both 
! these utilities and type traits are used pretty much everywhere in the library 
! implementation, it is the most convenient place to keep them (from an implementer's 
! perspective).
  </p>
  
  <p>
! Poll: Two-way: New header for forward, move, swap, move_with_noexcept and declval vs. 
! calling out forward, move, swap, move_with_noexcept and declval as freestanding explicitly?
  
  SF new header: 4 WF new header: 3 WF call out as freestanding: 1 SF call out as freestanding: 2
  
*************** Closed as NAD, reversing the decision at
*** 49220,49231 ****
  <p>
  The consensus was that
  any freestanding implementation is going to feel compelled to offer the important
! features of <tt>&lt;utility&gt;</tt> even if we do not make them a freestanding
  requirement; breaking out additional small headers may have additional costs at
  compile time, and while the critical <tt>move</tt>-related functions could migrate
! to <tt>&lt;type_traits&gt;</tt>, the header name is far from appealing; adding the
! whole of <tt>&lt;utility&gt;</tt> starts to drag in dependencies on <tt>&lt;tuple&gt;</tt>
! and <tt>&lt;memory&gt;</tt>, so we prefer to place the burden of slicing or supporting
  this whole header on free-standing vendors.
  </p>
  
--- 36505,36516 ----
  <p>
  The consensus was that
  any freestanding implementation is going to feel compelled to offer the important
! features of <tt>&lt;utility></tt> even if we do not make them a freestanding
  requirement; breaking out additional small headers may have additional costs at
  compile time, and while the critical <tt>move</tt>-related functions could migrate
! to <tt>&lt;type_traits></tt>, the header name is far from appealing; adding the
! whole of <tt>&lt;utility></tt> starts to drag in dependencies on <tt>&lt;tuple></tt>
! and <tt>&lt;memory></tt>, so we prefer to place the burden of slicing or supporting
  this whole header on free-standing vendors.
  </p>
  
*************** this whole header on free-standing vendo
*** 49234,49250 ****
  <p><b>Proposed resolution:</b></p>
  
  
! <p><b>Rationale:</b></p>No consensus for a change at this time. 
! 
  
  
  
  
  <hr>
! <h3><a name="1361"></a>1361. [FCD] Does use of <tt>std::size_t</tt> in a header imply that typedef name is available to users?</h3>
! <p><b>Section:</b> 17.6.2 [using] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-58</b></p>
  <p>
--- 36519,36534 ----
  <p><b>Proposed resolution:</b></p>
  
  
! <p><b>Rationale:</b></p><p>No consensus for a change at this time.</p>
  
  
  
  
  <hr>
! <h3><a name="1361"></a>1361. Does use of <tt>std::size_t</tt> in a header imply that typedef name is available to users?</h3>
! <p><b>Section:</b> 17.6.2 [using] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-58</b></p>
  <p>
*************** cannot be used without including the spe
*** 49256,49262 ****
  defines it. For example, is the following code required to
  be accepted:
  </p>
! <blockquote><pre>#include &lt;vector&gt;
  std::size_t x = 0;
  </pre></blockquote>
  <p>
--- 36540,36547 ----
  defines it. For example, is the following code required to
  be accepted:
  </p>
! <blockquote><pre>
! #include &lt;vector&gt;
  std::size_t x = 0;
  </pre></blockquote>
  <p>
*************** use this name.
*** 49282,49298 ****
  
  <p><b>Proposed resolution:</b></p>
  
! <p><b>Rationale:</b></p>The standard is correct as written.
  
  
  
  
  <hr>
! <h3><a name="1373"></a>1373. [FCD] Customizable traits should have their own headers</h3>
! <p><b>Section:</b> 20.3 [utility] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility">issues</a> in [utility].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-79</b></p>
  <p>
--- 36567,36742 ----
  
  <p><b>Proposed resolution:</b></p>
  
! <p><b>Rationale:</b></p><p>The standard is correct as written.</p>
  
  
  
  
  <hr>
! <h3><a name="1369"></a>1369. <tt>rethrow_exception</tt> may introduce data races</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-74</b></p>
! <p>
! One idea for the <tt>exception_ptr</tt> type was that a reference-counted
! implementation could simply 'reactivate' the same
! exception object in the context of a call to
! <tt>rethrow_exception</tt>. Such an implementation would allow
! the same exception object to be active in multiple threads
! (such as when multiple threads join on a <tt>shared_future</tt>)
! and introduce potential data races in any exception
! handler that catches exceptions by reference - notably
! existing library code written before this capability was
! added. <tt>rethrow_exception</tt> should <em>always</em> make a copy
! of the target exception object.
! </p>
! 
! <p><i>[Resolution suggested by NB comment]</i></p>
! 
! 
! <p>
! Add the following to 18.8.5, [propogation]
! </p>
! <blockquote><p><ins>
! <i>Throws</i>: a copy of the exception object to which <tt>p</tt> refers.
! </ins></p></blockquote>
! 
! <p><i>[2011-03-15: Anthony drafts wording]</i></p>
! 
! 
! <p><i>[2011-03-23 Madrid meeting]</i></p>
! 
! 
! <p>No consensus for a change</p>
! 
! 
! 
! <p><b>Rationale:</b></p><p>It would break too many existing implementations</p>
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li><p>Alter 15.1 [except.throw] p. 5 as follows:</p>
! 
! <blockquote><p>
! 5 When the thrown object is a class object, the copy/move constructor and the destructor shall be accessible,
! even if the copy/move operation is elided (12.8 [class.copy]). <ins>The copy constructor shall be
! accessible, and is odr-used (3.2 [basic.def.odr]), even if the copy operation is elided, 
! or a move constructor used to construct the exception object.</ins>
! </p></blockquote>
! </li>
! 
! <li><p>Alter 18.8.5 [propagation] p. 7 as follows:</p>
! 
! <blockquote><pre>
! exception_ptr current_exception() noexcept;
! </pre><blockquote>
! <p>
! 7 <i>Returns</i>: An <tt>exception_ptr</tt> object that refers to <del>the currently handled exception 
! (15.3 [except.handle]) or</del> a copy of the currently handled exception, or a null <tt>exception_ptr</tt> 
! object if no exception is being handled. The referenced object shall remain valid at least as long as there 
! is an <tt>exception_ptr</tt> object that refers to it. If the function needs to allocate memory and the 
! attempt fails, it returns an <tt>exception_ptr</tt> object that refers to an instance of <tt>bad_alloc</tt>. 
! It is unspecified whether the return values of two successive calls to <tt>current_exception</tt> refer to 
! the same exception object. [ <i>Note</i>: That is, it is unspecified whether <tt>current_exception</tt> 
! creates a new copy each time it is called. &mdash; <i>end note</i> ] If the attempt to copy the current 
! exception object throws an exception,<ins> or is otherwise not possible,</ins> the function returns an 
! <tt>exception_ptr</tt> object that refers to the thrown exception <ins>if any</ins> or, <del>if this is not possible,</del> 
! to an instance of <tt>bad_exception</tt>. [ <i>Note</i>: The copy constructor of the thrown exception 
! may also fail, so the implementation is allowed to substitute a <tt>bad_exception</tt> object to avoid 
! infinite recursion. &mdash; <i>end note</i> ]
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Alter 18.8.5 [propagation] p. 9 and add a new paragraph after p. 9 as follows:</p>
! 
! <blockquote><pre>
! [[noreturn]] void rethrow_exception(exception_ptr p);
! </pre><blockquote>
! <p>
! 8 <i>Requires</i>: <tt>p</tt> shall not be a null pointer.
! <p/>
! 9 <i>Throws</i>: <ins>a copy of</ins> the exception object to which <tt>p</tt> refers<ins>, or any exception 
! thrown by the attempt to copy the exception object to which <tt>p</tt> refers</ins>.
! <p/>
! <ins>? <i>Synchronization</i>: Calls to <tt>rethrow_exception</tt> on <tt>exception_ptr</tt> objects
! that refer to the same exception object shall appear to occur in a single total order. The completion 
! of each call shall synchronize with (1.10 [intro.multithread]) the next call in that total order.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1371"></a>1371. Standard exceptions require stronger no-throw guarantees</h3>
! <p><b>Section:</b> 19 [diagnostics] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-75</b></p>
! <p>
! None of the exception types defined in clause 19 are
! allowed to throw an exception on copy or move
! operations, but there is no clear specification that the
! operations have an exception specification to prove it.
! Note that the implicitly declared constructors, taking the
! exception specification from their base class (ultimately
! <tt>std::exception</tt>) will implicitly generate a <tt>noexcept</tt>
! exception specification if all of their data members
! similarly declare <tt>noexcept</tt> operations. As the
! representation is unspecified, we cannot assume nonthrowing
! operations unless we explicitly state this as a
! constraint on the implementation.
! </p>
! 
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <p>
! Add a global guarantee that all exception types
! defined in clause 19 that rely on implicitly declared
! operations have a non-throwing exception
! specification on those operations.
! </p>
! 
! <p><i>[
! 2010 Batavia:
! ]</i></p>
! 
! <p>
! This is addressed by the current words in 18.8.1 [exception], p2
! </p>
! <blockquote><p>
! Each standard library class <tt>T</tt> that derives from class <tt>exception</tt> 
! shall have a publicly accessible copy constructor and a publicly accessible copy
! assignment operator that do not exit with an exception.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1373"></a>1373. Customizable traits should have their own headers</h3>
! <p><b>Section:</b> 20.2 [utility] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#utility">active issues</a> in [utility].</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility">issues</a> in [utility].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-79</b></p>
  <p>
*************** headers, and require the existing header
*** 49335,49341 ****
  <tt>#include</tt> the traits header to support backwards
  compatibility:
  </p>
! <blockquote><pre>iterator_traits (plus the iterator tag-types)
  allocator_traits
  pointer_traits
  char_traits
--- 36779,36786 ----
  <tt>#include</tt> the traits header to support backwards
  compatibility:
  </p>
! <blockquote><pre>
! iterator_traits (plus the iterator tag-types)
  allocator_traits
  pointer_traits
  char_traits
*************** Closed as NAD with the rationale below.
*** 49352,49377 ****
  
  
  
! <p><b>Rationale:</b></p>
  This suggest is not a defect, as the likely benefit is small, if any,
  compared to the cost of not just implementating the feature, but also
  explaining/teaching it.
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1375"></a>1375. [FCD] <tt>reference_type</tt> should not have been removed from the
  allocator requirements</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1318">1318</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-87</b></p>
--- 36797,36883 ----
  
  
  
! <p><b>Rationale:</b></p><p>
  This suggest is not a defect, as the likely benefit is small, if any,
  compared to the cost of not just implementating the feature, but also
  explaining/teaching it.
+ </p>
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1374"></a>1374. Clarify moved-from objects are &quot;toxic&quot;</h3>
+ <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
+  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses US-85</b></p>
+ <p>
+ 20.2.1 Table 34 "MoveConstructible requirements" says
+ "Note: rv remains a valid object. Its state is unspecified".
+ Some components give stronger guarantees. For
+ example, moved-from <tt>shared_ptr</tt>s are guaranteed <tt>empty</tt>
+ (20.9.11.2.1/25).
+ In general, what the standard really should say (preferably
+ as a global blanket statement) is that moved-from objects
+ can be destroyed and can be the destination of an
+ assignment. Anything else is radioactive. For example,
+ containers can be "emptier than empty". This needs to be
+ explicit and required generally.
+ </p>
+ <p>
+ Note: The last time that one of us mentioned "emptier
+ than empty" (i.e. containers missing sentinel nodes, etc.)
+ the objection was that containers can store sentinel nodes
+ inside themselves in order to avoid dynamically allocating
+ them. This is unacceptable because
+ </p>
+ <p>
+ (a) it forces existing implementations (i.e. Dinkumware's, Microsoft's,
+ IBM's,  etc.) to change for no good reason (i.e. permitting more
+ operations on moved-from objects), and 
+ </p>
+ <p>
+ (b) it invalidates end-iterators when swapping containers. (The Working
+ Paper currently permits end-iterator invalidation, which we
+ consider to be wrong, but that's a separate argument. In
+ any event, <em>mandating</em> end-iterator invalidation is very
+ different from permitting it.)
+ </p>
+ 
+ <p><i>[
+ Resolution proposed in ballot comment
+ ]</i></p>
+ 
+ <p>
+ State as a general requirement that moved-from
+ objects can be destroyed and can be the
+ destination of an assignment. Any other use is
+ undefined behavior.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3241.html">N3241</a></p>
  
  
  
  
  
  <hr>
! <h3><a name="1375"></a>1375. <tt>reference_type</tt> should not have been removed from the
  allocator requirements</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1318">1318</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-87</b></p>
*************** extensions and future features.
*** 49388,49403 ****
  In [allocator.requirements] Table 42 - Allocotor Requirements, 
  Add a row (after <tt>value_type</tt>) with columns:
  </p>
! <blockquote>
! Expression: <ins><tt>X::reference_type</tt></ins><br>
! Return type: <ins><tt>T&amp;</tt></ins><br>
! Assertion/note...: (empty)<br>
! Default: <ins><tt>T&amp;</tt></ins><br>
! </blockquote>
  <p>
  [allocator.traits]:
  </p> 
! <blockquote><pre>namespace std {
    template &lt;class Alloc&gt; struct allocator_traits {
      typedef Alloc allocator_type;
      
--- 36894,36910 ----
  In [allocator.requirements] Table 42 - Allocotor Requirements, 
  Add a row (after <tt>value_type</tt>) with columns:
  </p>
! <blockquote><p>
! Expression: <ins><tt>X::reference_type</tt></ins><BR/>
! Return type: <ins><tt>T&amp;</tt></ins><BR/>
! Assertion/note...: (empty)<BR/>
! Default: <ins><tt>T&amp;</tt></ins><BR/>
! </p></blockquote>
  <p>
  [allocator.traits]:
  </p> 
! <blockquote><pre>
! namespace std {
    template &lt;class Alloc&gt; struct allocator_traits {
      typedef Alloc allocator_type;
      
*************** Default: <ins><tt>T&amp;</tt></ins><br>
*** 49409,49429 ****
      typedef <i>see below</i>   const_void_pointer;
      <ins>typedef value_type&amp; reference_type;</ins>
  </pre></blockquote>
! 
  Add <tt>reference_type</tt> to
  allocator_traits template, defaulted to
  value_type&amp;.
  
  
  
  
  
  <hr>
! <h3><a name="1376"></a>1376. [FCD] Allocator interface is not backward compatible</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-88</b></p>
  <p>
--- 36916,36938 ----
      typedef <i>see below</i>   const_void_pointer;
      <ins>typedef value_type&amp; reference_type;</ins>
  </pre></blockquote>
! <p>
  Add <tt>reference_type</tt> to
  allocator_traits template, defaulted to
  value_type&amp;.
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1376"></a>1376. Allocator interface is not backward compatible</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-88</b></p>
  <p>
*************** See Appendix 1 - Additional Details
*** 49443,49451 ****
  ]</i></p>
  
  
! <blockquote>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3165.pdf">n3165</a> provides an alternative resolution.
! </blockquote>
  
  <p><i>[
  2910 Batavia:
--- 36952,36960 ----
  ]</i></p>
  
  
! <blockquote><p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3165.pdf">n3165</a> provides an alternative resolution.
! </p></blockquote>
  
  <p><i>[
  2910 Batavia:
*************** Closed as NAD - withdrawn by the submitt
*** 49456,49476 ****
  </p>
  
  
! <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3165.pdf">n3165</a>
  
! 
! <p><b>Rationale:</b></p>Withdrawn by the submitter.
  
  
  
  
  <hr>
! <h3><a name="1395"></a>1395. [FCD] Ballot Comment JP-32</h3>
! <p><b>Section:</b> 20.7.6 [meta.rel] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.rel">issues</a> in [meta.rel].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-32</b></p>
  <p>
--- 36965,36985 ----
  </p>
  
  
! <p><b>Proposed resolution:</b></p><p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3165.pdf">n3165</a>
+ </p>
  
! <p><b>Rationale:</b></p><p>Withdrawn by the submitter.</p>
  
  
  
  
  <hr>
! <h3><a name="1395"></a>1395. Inconsistent reference links should be unified</h3>
! <p><b>Section:</b> 20.10.6 [meta.rel] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.rel">issues</a> in [meta.rel].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-32</b></p>
  <p>
*************** number Z.
*** 49487,49504 ****
  
  
  <p><b>Proposed resolution:</b></p>
  Change "(10)" to "(Clause 10)".
  
  
  
  
  
  <hr>
! <h3><a name="1398"></a>1398. [FCD] Users should be able to specialize functors without depending on whole <tt>&lt;functional&gt;</tt> header</h3>
! <p><b>Section:</b> 20.8 [function.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-96</b></p>
  <p>
--- 36996,37015 ----
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  Change "(10)" to "(Clause 10)".
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1398"></a>1398. Users should be able to specialize functors without depending on whole <tt>&lt;functional&gt;</tt> header</h3>
! <p><b>Section:</b> 20.9 [function.objects] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-96</b></p>
  <p>
*************** in pursuing this issue as an extension -
*** 49552,49672 ****
  
  
  
! <p><b>Rationale:</b></p>No consensus to make a change
! 
! <p><b>Proposed resolution:</b></p>
! See paper "Forwarding <tt>&lt;functional&gt;</tt> functor templates"
! on the Batavia LWG document list
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1406"></a>1406. [FCD] Support hashing smart-pointers based on <i>owner</i></h3>
! <p><b>Section:</b> 20.9.10.2 [util.smartptr.shared] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses JP-5</b></p>
! <p>
! Hash support based on ownership sharing should be
! supplied for <tt>shared_ptr</tt> and <tt>weak_ptr</tt>.
! For two <tt>shared_ptr</tt> objects <tt>p</tt> and <tt>q</tt>, two distinct
! equivalence relations can be defined. One is based on
! equivalence of pointer values, which is derived from the
! expression <tt>p.get() == q.get()</tt> (hereafter called <i>address based
! equivalence relation</i>), the other is based on
! equivalence of ownership sharing, which is derived from
! the expression <tt>!p.owner_before(q) &amp;&amp; !q.owner_before(p)</tt>
! (hereafter called <i>ownership-based equivalence relation</i>).
! These two equivalence relations are independent in
! general. For example, a <tt>shared_ptr</tt> object created by the
! constructor of the signature <tt>shared_ptr(shared_ptr&lt;U&gt;
! const &amp;, T *)</tt> could reveal a difference between these two
! relations. Therefore, hash support based on each
! equivalence relation should be supplied for <tt>shared_ptr</tt>.
! However, while the standard library provides the hash
! support for address-based one (20.9.11.6 paragraph 2), it
! lacks the hash support for ownership-based one. In
! addition, associative containers work well in combination
! with the <tt>shared_ptr</tt>'s ownership-based comparison but
! unordered associative containers don't. This is
! inconsistent.
! </p>
! <p>
! For the case of <tt>weak_ptr</tt>, hash support for the ownership based
! equivalence relation can be safely defined on
! <tt>weak_ptr</tt>s, and even on expired ones. The absence of
! hash support for the ownership-based equivalence
! relation is fatal, especially for expired <tt>weak_ptr</tt>s. And the
! absence of such hash support precludes some quite
! effective use-cases, e.g. erasing the <tt>unordered_map</tt> entry
! of an expired <tt>weak_ptr</tt> key from a customized deleter
! supplied to <tt>shared_ptr</tt>s.
! </p>
! <p>
! Hash support for the ownership-based equivalence
! relation cannot be provided by any user-defined manner
! because information about ownership sharing is not
! available to users at all. Therefore, the only way to provide
! ownership-based hash support is to offer it intrusively by
! the standard library.
! </p>
! <p>
! As far as we know, such hash support is implementable.
! Typical implementation of such hash function could return
! the hash value of the pointer of the counter object that is
! internally managed by <tt>shared_ptr</tt> and <tt>weak_ptr</tt>.
! </p>
! 
! <p><i>[2010 Rapperswil:]</i></p>
! 
! <blockquote>
! <p>No consensus to make this change at this time.</p>
! </blockquote>
! 
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following non-static member functions to
! <tt>shared_ptr</tt> and <tt>weak_ptr</tt> class template;
! </p>
! <p>
! Update [util.smartptr.shared], 20.9.11.2 paragraph 1
! </p>
! <pre>namespace std{
! template&lt;class T&gt; class shared_ptr {
! public:
! ...
!   <ins>size_t owner_hash() const;</ins>
! ...
! };
! }
! </pre>
! <p>
! Update [util.smartptr.weak], 20.9.11.3 paragraph 1
! </p>
! <pre>namespace std{
! template&lt;class T&gt; class weak_ptr {
! public:
! ...
!   <ins>size_t owner_hash() const;</ins>
! ...
! };
! }
! </pre>
! <p>
! These functions satisfy the following
! requirements. Let <tt>p</tt> and <tt>q</tt> be objects of either
! <tt>shared_ptr</tt> or <tt>weak_ptr</tt>, <tt>H</tt> be a hypothetical
! function object type that satisfies the hash
! requirements ([hash.requirements], 20.2.4) and <tt>h</tt> be an object of the
! type <tt>H</tt>. The expression <tt>p.owner_hash()</tt> behaves
! as if it were equivalent to the expression <tt>h(p)</tt>. In
! addition, <tt>h(p) == h(q)</tt> must become <tt>true</tt> if <tt>p</tt> and
! <tt>q</tt> share ownership.
  </p>
  
  
--- 37063,37074 ----
  
  
  
! <p><b>Rationale:</b></p><p>No consensus to make a change</p>
  
  <p><b>Proposed resolution:</b></p>
  <p>
! See paper &quot;Forwarding <tt>&lt;functional&gt;</tt> functor templates&quot;
! on the Batavia LWG document list
  </p>
  
  
*************** addition, <tt>h(p) == h(q)</tt> must bec
*** 49674,49897 ****
  
  
  <hr>
! <h3><a name="1411"></a>1411. [FCD] Add a compile-time flag to detect <tt>monotonic_clock</tt></h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1410">1410</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses DE-20</b></p>
! 
  The library component <tt>monotonic_clock</tt> is conditionally
  supported, but no compile-time flag exists that allows
  user-code to query its existence. Further-on there exist no
  portable means to simulate such a query. (To do so, user
  code would be required to add types to namespace
  <tt>std::chrono</tt>.)
  
  
  <p><b>Proposed resolution:</b></p>
  Provide a compile-time flag (preferably a macro)
  that can be used to query the existence of
  <tt>monotonic_clock</tt>.
  
  
  
  
  
  <hr>
! <h3><a name="1415"></a>1415. [FCD] iterator stability bans the short-string optimization</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
! Requirements on iterators swapping allegiance would
! disallow the small-string optimization.
  
  <p><i>[
! Resolved in Rapperswil by paper N3108.
  ]</i></p>
  
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! Add an exclusion for <tt>basic_string</tt> to the sentence
! beginning “Every iterator referring to an
! element...”. Add a sentence to 21.4.6.8/2 saying
! that iterators and references to string elements
! remain valid, but it is not specified whether they
! refer to the same string or the other string.
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1419"></a>1419. [FCD] Ballot Comment US-117</h3>
! <p><b>Section:</b> 23.3.3 [forwardlist] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist">issues</a> in [forwardlist].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-117</b></p>
! 
! forward_list::erase_after should return an iterator.
  
  <p><i>[
! Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
  ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
- See Appendix 1 - Additional Details
  
  
  
  
  
  <hr>
! <h3><a name="1422"></a>1422. [FCD] vector&lt;bool&gt; iterators are not random access</h3>
! <p><b>Section:</b> 23.4.2 [vector.bool] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
  <p><b>Discussion:</b></p>
- <p><b>Addresses GB-118</b></p>
  <p>
! <tt>vector&lt;bool&gt;</tt> iterators are not random access iterators
! because their reference type is a special class, and not
! <tt>bool &amp;</tt>. All standard libary operations taking iterators
! should treat this iterator as if it was a random access iterator, rather
! than a simple input iterator.
  </p>
- 
  <p><i>[
! Resolution proposed in ballot comment
  ]</i></p>
  
- <p>
- Either revise the iterator requirements to support proxy iterators
- (restoring functionality that was lost when the Concept facility was
- removed) or add an extra paragraph to the <tt>vector&lt;bool&gt;</tt>
- specification requiring the library to treat <tt>vector&lt;bool&gt;</tt>
- iterators as-if they were random access iterators, despite having the wrong
- reference type.
- </p>
  
- <p><i>[
- Rapperswil Review
- ]</i></p>
  
  <p>
! The consensus at Rapperswil is that it is too late for full support for
! proxy iterators, but requiring the library to respect <tt>vector&amp;;t;bool&gt;</tt>
! iterators as-if they were random access would be preferable to flagging
! this container as deliberately incompatible with standard library algorithms.
! </p>
! <p>
! Alisdair to write the note, which may become normative <i>Remark</i> depending
! on the preferences of the project editor.
  </p>
  
- <p><i>[
- Post-Rapperswil Alisdair provides wording
- ]</i></p>
  
- <p>
- Initial wording is supplied, deliberately using <i>Note</i> in preference to
- <i>Remark</i> although the author notes his preference for <i>Remark</i>.  The
- issue of whether <tt>iterator_traits&lt;vector&lt;bool&gt;&gt;::iterator_category</tt>
- is permitted to report <tt>random_access_iterator_tag</tt> or must report 
- <tt>input_iterator_tag</tt> is not addressed.
- </p>
  
- <p><i>[
- Old Proposed Resolution:
- ]</i></p>
  
! <blockquote>
  <p>
! Insert a new paragraph into 23.4.2 [vector.bool] between p4 and p5:
  </p>
- <blockquote>
- [<i>Note</i> All functions in the library that take a pair of iterators to
- denote a range shall treat <tt>vector&lt;bool&gt;</tt> iterators as-if they were
- random access iterators, even though the <tt>reference</tt> type is not a
- true reference.<i>-- end note</i>]
- </blockquote>
- </blockquote>
- 
  <p><i>[
! 2010-11 Batavia:
  ]</i></p>
  
- <blockquote>
- Closed as NAD Future, because the current iterator categories cannot correctly describe
- <tt>vector&lt;bool&gt;::iterator</tt>. But saying that they are Random Access Iterators
- is also incorrect, because it is not too hard to create a corresponding test that fails.
- We should deal with the more general proxy iterator problem in the future, and see no
- benefit to take a partial workaround specific to <tt>vector&lt;bool&gt;</tt> now.
- </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! 
! 
! <p><b>Rationale:</b></p>
! No consensus to make this change at this time.
  
  
  
  
  
  <hr>
! <h3><a name="1433"></a>1433. [FCD] Ballot Comment GB-119</h3>
! <p><b>Section:</b> 25.3.12 [alg.random.shuffle] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.random.shuffle">issues</a> in [alg.random.shuffle].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1432">1432</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-119</b></p>
! 
! The functions random_shuffle and shuffle both take
  arguments providing a source of randomness, but one
  take its argument by rvalue reference, and the other
  requires an lvalue reference. The technical merits of which
  form of argument passing should be settled for this
  specific case, and a single preferred form used
  consistently.
  
  
  <p><b>Proposed resolution:</b></p>
  [DEPENDS ON WHETHER RVALUE OR
  LVALUE REFERENCE IS THE PREFERRED
  FORM]
  
  
  
  
  
  <hr>
! <h3><a name="1434"></a>1434. [FCD] Ballot Comment US-122</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-122</b></p>
! 
! It was the LWG's intent in Pittsburgh that N2772 be
! applied to the WP.
! 
  <p><i>[
  Resolved in Rapperswil by paper N3106.
  ]</i></p>
--- 37076,37256 ----
  
  
  <hr>
! <h3><a name="1411"></a>1411. Add a compile-time flag to detect <tt>monotonic_clock</tt></h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1410">1410</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses DE-20</b></p>
! <p>
  The library component <tt>monotonic_clock</tt> is conditionally
  supported, but no compile-time flag exists that allows
  user-code to query its existence. Further-on there exist no
  portable means to simulate such a query. (To do so, user
  code would be required to add types to namespace
  <tt>std::chrono</tt>.)
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  Provide a compile-time flag (preferably a macro)
  that can be used to query the existence of
  <tt>monotonic_clock</tt>.
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1413"></a>1413. Specify whether <tt>high_resolution_clock</tt> is a distinct type or a typedef</h3>
! <p><b>Section:</b> 20.12.7.3 [time.clock.hires] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-112</b></p>
! <p>
! What it means for <tt>high_resolution_clock</tt> to be a synonym
! is undefined. If it may or may not be a typedef, then
! certain classes of programs become unportable.
! </p>
  
  <p><i>[
! Resolution proposed in ballot comment
  ]</i></p>
  
! <p>
! Require that it be a distinct class type.
! </p>
  
  <p><i>[
! 2010 Batavia
  ]</i></p>
  
+ <p>
+ This is not a defect.  Threre are a number of places in the standard where
+ we allow implentations to choose their preferred technique, the most obvious
+ example being the <tt>iterator</tt>/<tt>const_iterator</tt> types of <tt>set</tt>.
+ </p>
+ <p>
+ Typically, this means it is not portable to declare function overloads that differ
+ only in their use of these types.
+ </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1415"></a>1415. Iterator stability bans the short-string optimization</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Requirements on iterators swapping allegiance would
! disallow the small-string optimization.
  </p>
  <p><i>[
! Resolved in Rapperswil by paper N3108.
  ]</i></p>
  
  
  
+ 
+ <p><b>Proposed resolution:</b></p>
  <p>
! Add an exclusion for <tt>basic_string</tt> to the sentence
! beginning &#8220;Every iterator referring to an
! element...&#8221;. Add a sentence to 21.4.6.8/2 saying
! that iterators and references to string elements
! remain valid, but it is not specified whether they
! refer to the same string or the other string.
  </p>
  
  
  
  
! 
! <hr>
! <h3><a name="1419"></a>1419. <tt>forward_list::erase_after</tt> should return an iterator</h3>
! <p><b>Section:</b> 23.3.4 [forwardlist] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist">issues</a> in [forwardlist].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-117</b></p>
  <p>
! <tt>forward_list::erase_after</tt> should return an iterator.
  </p>
  <p><i>[
! Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
  ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! See Appendix 1 - Additional Details
! </p>
  
  
  
  
  
  <hr>
! <h3><a name="1433"></a>1433. <tt>random_shuffle</tt> and <tt>shuffle</tt> should have consistent signatures</h3>
! <p><b>Section:</b> 25.3.12 [alg.random.shuffle] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.random.shuffle">issues</a> in [alg.random.shuffle].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1432">1432</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-119</b></p>
! <p>
! The functions <tt>random_shuffle</tt> and <tt>shuffle</tt> both take
  arguments providing a source of randomness, but one
  take its argument by rvalue reference, and the other
  requires an lvalue reference. The technical merits of which
  form of argument passing should be settled for this
  specific case, and a single preferred form used
  consistently.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  [DEPENDS ON WHETHER RVALUE OR
  LVALUE REFERENCE IS THE PREFERRED
  FORM]
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1434"></a>1434. For <tt>min/max</tt> functions replace variadic arguments by <tt>initializer_list</tt> argument</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-122</b></p>
! <p>
! It was the LWG's intent in Pittsburgh that N2772 be applied to the WP.
! </p>
  <p><i>[
  Resolved in Rapperswil by paper N3106.
  ]</i></p>
*************** Resolved in Rapperswil by paper N3106.
*** 49900,49941 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Apply N2772 to the WP.
  
  
  
  
  
  <hr>
! <h3><a name="1442"></a>1442. [FCD] "happens-before" should be "synchronizes-with"</h3>
! <p><b>Section:</b> 30 [thread] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Canada <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-18</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread">issues</a> in [thread].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1443">1443</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CA-9, GB-122</b></p>
  
  <p><i>[CA-9:]</i></p>
  
! 
  Imposed happens-before edges should be in
! synchronizes-with<br>
  Each use of the words "happens-before" should be
  replaced with the words "synchronizes-with" in the
! following sentences:<br>
! 27.2.3p2<br>
! 30.3.1.2p6<br>
! 30.3.1.5p7<br>
! 30.6.4p7<br>
! 30.6.9p5<br>
! 30.6.10.1p23<br>
  Rationale: Happens-before is defined in 1.10p11 in a way
  that (deliberately) does not make it explicitly transitively
  closed. Adding edges to happens-before directly, as in
  27.2.3p2 etc., does not provide transitivity with
  sequenced-before or any other existing happens-before
  edge. This lack of transitivity seems to be unintentional.
  
  <p><i>[GB-122]</i></p>
  
--- 37259,37301 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Apply N2772 to the WP.</p>
  
  
  
  
  
  <hr>
! <h3><a name="1442"></a>1442. "happens-before" should be "synchronizes-with"</h3>
! <p><b>Section:</b> 30 [thread] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Canada <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread">issues</a> in [thread].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1443">1443</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CA-9, GB-122</b></p>
  
  <p><i>[CA-9:]</i></p>
  
! <p>
  Imposed happens-before edges should be in
! synchronizes-with<br/>
  Each use of the words "happens-before" should be
  replaced with the words "synchronizes-with" in the
! following sentences:<br/>
! 27.2.3p2<br/>
! 30.3.1.2p6<br/>
! 30.3.1.5p7<br/>
! 30.6.4p7<br/>
! 30.6.9p5<br/>
! 30.6.10.1p23<br/>
  Rationale: Happens-before is defined in 1.10p11 in a way
  that (deliberately) does not make it explicitly transitively
  closed. Adding edges to happens-before directly, as in
  27.2.3p2 etc., does not provide transitivity with
  sequenced-before or any other existing happens-before
  edge. This lack of transitivity seems to be unintentional.
+ </p>
  
  <p><i>[GB-122]</i></p>
  
*************** in the following sentences:</p>
*** 49974,50013 ****
  
  <p>Change 27.2.3 Thread Safety [iostreams.threadsafety] paragraph 2:</p>
  
! <p>If one thread makes a library call <tt>a</tt> that writes a value to a stream and, as a result, another thread reads this value from the stream through a library call <tt>b</tt> such that this does not result in a data race, then <tt>a</tt> <del>happens before</del> <ins>synchronizes with</ins> <tt>b</tt>.</p>
  
  <p>Change 30.3.1.2 thread constructors [thread.thread.constr] paragraph 6:</p>
  
! <p><i>Synchronization:</i> The invocation of the constructor <del>happens before</del> <ins>synchronizes with</ins> the invocation of the copy of <tt>f</tt>.</p>
  
  <p>Change 30.3.1.5 thread members [thread.thread.member] paragraph 7:</p>
  
! <p><i>Synchronization:</i> The completion of the thread represented by <tt>*this</tt> <del>happens before</del> <ins>synchronizes with</ins> (1.10) <tt>join()</tt> <del>returns</del> <ins>returning</ins>. [ Note: Operations on <tt>*this</tt> are not synchronized. --end note ]</p>
  
  <p>Change 30.6.4 Associated asynchronous state [futures.state] paragraph 7:</p>
  
! <p>Calls to functions that successfully set the stored result of an associated asynchronous state synchronize
! with (1.10) calls to functions successfully detecting the ready state resulting from that setting. The storage of the result (whether normal or exceptional) into the associated asynchronous state <del>happens before</del> <ins>synchronizes with</ins> (1.10) that state <del>is</del> <ins>being</ins> set to ready.</p>
  
  <p>Change 30.6.9 Function template async [futures.async] paragraph 5:</p>
  
! <p><i>Synchronization:</i> the invocation of <tt>async</tt> <del>happens before</del> <ins>synchronizes with</ins> (1.10) the invocation of <tt>f</tt>. [ Note: this
! statement applies even when the corresponding future object is moved to another thread. --end
! note ] If the invocation is not deferred, a call to a waiting function on an asynchronous return object
  that shares the associated asynchronous state created by this async call shall block until the associated
! thread has completed. If the invocation is not deferred, the <tt>join()</tt> on the created thread <del>happens before</del> <ins>synchronizes with</ins>
! (1.10) the first function that successfully detects the ready status of the associated asynchronous
! state returns or before the function that gives up the last reference to the associated asynchronous
! state returns, whichever happens first. If the invocation is deferred, the completion of the invocation
! of the deferred function <del>happens before</del> <ins>synchronizes with</ins> the calls to the waiting functions return.</p>
  
  <p>Change 30.6.10.1 packaged_task member functions [futures.task.members] paragraph 23:</p>
  
! <p><i>Synchronization:</i> a successful call to <tt>operator()</tt> synchronizes with (1.10) a call to any member function of a <tt>future</tt>, <tt>shared_future</tt>, or <tt>atomic_future</tt> object that shares the associated asynchronous
! state of <tt>*this</tt>. The completion of the invocation of the stored task and the storage of the result
! (whether normal or exceptional) into the associated asynchronous state <del>happens before</del> <ins>synchronizes with</ins> (1.10) the
! state <del>is</del> <ins>being</ins> set to ready. [ Note: <tt>operator()</tt> synchronizes and serializes with other functions through the
! associated asynchronous state. —end note ]</p>
  
  
  
--- 37334,37387 ----
  
  <p>Change 27.2.3 Thread Safety [iostreams.threadsafety] paragraph 2:</p>
  
! <p>If one thread makes a library call <tt>a</tt> that writes a value to a stream 
! and, as a result, another thread reads this value from the stream through a library 
! call <tt>b</tt> such that this does not result in a data race, then <tt>a</tt> 
! <del>happens before</del> <ins>synchronizes with</ins> <tt>b</tt>.</p>
  
  <p>Change 30.3.1.2 thread constructors [thread.thread.constr] paragraph 6:</p>
  
! <p><i>Synchronization:</i> The invocation of the constructor <del>happens 
! before</del> <ins>synchronizes with</ins> the invocation of the copy of <tt>f</tt>.</p>
  
  <p>Change 30.3.1.5 thread members [thread.thread.member] paragraph 7:</p>
  
! <p><i>Synchronization:</i> The completion of the thread represented by <tt>*this</tt> 
! <del>happens before</del> <ins>synchronizes with</ins> (1.10) <tt>join()</tt> 
! <del>returns</del> <ins>returning</ins>. [ Note: Operations on <tt>*this</tt> 
! are not synchronized. --end note ]</p>
  
  <p>Change 30.6.4 Associated asynchronous state [futures.state] paragraph 7:</p>
  
! <p>Calls to functions that successfully set the stored result of an associated 
! asynchronous state synchronize with (1.10) calls to functions successfully detecting 
! the ready state resulting from that setting. The storage of the result (whether normal 
! or exceptional) into the associated asynchronous state <del>happens before</del> 
! <ins>synchronizes with</ins> (1.10) that state <del>is</del> <ins>being</ins> set to ready.</p>
  
  <p>Change 30.6.9 Function template async [futures.async] paragraph 5:</p>
  
! <p><i>Synchronization:</i> the invocation of <tt>async</tt> <del>happens before</del> 
! <ins>synchronizes with</ins> (1.10) the invocation of <tt>f</tt>. [ <i>Note</i>: this
! statement applies even when the corresponding future object is moved to another thread. &mdash; <i>end
! note</i> ] If the invocation is not deferred, a call to a waiting function on an asynchronous return object
  that shares the associated asynchronous state created by this async call shall block until the associated
! thread has completed. If the invocation is not deferred, the <tt>join()</tt> on the created thread 
! <del>happens before</del> <ins>synchronizes with</ins> (1.10) the first function that successfully 
! detects the ready status of the associated asynchronous state returns or before the function that 
! gives up the last reference to the associated asynchronous state returns, whichever happens first. 
! If the invocation is deferred, the completion of the invocation of the deferred function <del>happens 
! before</del> <ins>synchronizes with</ins> the calls to the waiting functions return.</p>
  
  <p>Change 30.6.10.1 packaged_task member functions [futures.task.members] paragraph 23:</p>
  
! <p><i>Synchronization:</i> a successful call to <tt>operator()</tt> synchronizes with (1.10) a call 
! to any member function of a <tt>future</tt>, <tt>shared_future</tt>, or <tt>atomic_future</tt> object 
! that shares the associated asynchronous state of <tt>*this</tt>. The completion of the invocation 
! of the stored task and the storage of the result (whether normal or exceptional) into the associated 
! asynchronous state <del>happens before</del> <ins>synchronizes with</ins> (1.10) the state <del>is</del> 
! <ins>being</ins> set to ready. [ Note: <tt>operator()</tt> synchronizes and serializes with other 
! functions through the associated asynchronous state. —end note ]</p>
  
  
  
*************** associated asynchronous state. —end note
*** 50015,50026 ****
  
  
  <hr>
! <h3><a name="1443"></a>1443. [FCD] Imposed happens-before edges are not made transitive</h3>
! <p><b>Section:</b> 30 [thread] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-27</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread">issues</a> in [thread].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1442">1442</a></p>
  <p><b>Discussion:</b></p>
  
  
--- 37389,37400 ----
  
  
  <hr>
! <h3><a name="1443"></a>1443. Imposed happens-before edges are not made transitive</h3>
! <p><b>Section:</b> 30 [thread] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread">issues</a> in [thread].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1442">1442</a></p>
  <p><b>Discussion:</b></p>
  
  
*************** in the following sentences:</p>
*** 50055,50100 ****
  
  
  <p><b>Proposed resolution:</b></p>
  Request the concurrency working group to
  determine if changes are needed
  
  
  
  
  
  <hr>
! <h3><a name="1444"></a>1444. [FCD] <tt>OFF_T</tt> is not defined</h3>
! <p><b>Section:</b> 27.5.3.2 [fpos.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-28</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fpos.operations">issues</a> in [fpos.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1414">1414</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses GB-123</b></p>
! 
  Several rows in table 124 specify a Return type of
  'OFF_T', which does not appear to be a type defined in
  this standard.
  
  
  <p><b>Proposed resolution:</b></p>
! Resolve outstanding references to the removed
! type 'OFF_T'.
  
  
  
  
  
  <hr>
! <h3><a name="1446"></a>1446. [FCD] Move and swap for I/O streams</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-138</b></p>
  
  For istreams and ostreams, the move-constructor does
  not move-construct, the move-assignment operator does
  not move-assign, and the swap function does not swap
--- 37429,37479 ----
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  Request the concurrency working group to
  determine if changes are needed
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1444"></a>1444. <tt>OFF_T</tt> is not defined</h3>
! <p><b>Section:</b> 27.5.4.2 [fpos.operations] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fpos.operations">issues</a> in [fpos.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1414">1414</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses GB-123</b></p>
! <p>
  Several rows in table 124 specify a Return type of
  'OFF_T', which does not appear to be a type defined in
  this standard.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! Resolve outstanding references to the removed type 'OFF_T'.
! </p>
  
  
  
  
  
  <hr>
! <h3><a name="1446"></a>1446. Move and swap for I/O streams</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-138</b></p>
  
+ <p>
  For istreams and ostreams, the move-constructor does
  not move-construct, the move-assignment operator does
  not move-assign, and the swap function does not swap
*************** because these operations do not manage t
*** 50102,50107 ****
--- 37481,37487 ----
  pointer. Useful applications of these operations are
  prevented both by their incorrect semantics and because
  they are protected.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
*************** See Appendix 1 - Additional Details
*** 50124,50132 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3179.pdf">n3179</a> would solve this issue.
! </blockquote>
  
  <p><i>[
  2010-11 Batavia
--- 37504,37512 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3179.pdf">n3179</a> would solve this issue.
! </p></blockquote>
  
  <p><i>[
  2010-11 Batavia
*************** Accepting <a href="http://www.open-std.o
*** 50135,50146 ****
  <p>
  Closed as NAD.
  </p>
! <blockquote>
  The Library Working Group reviewed <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3179.pdf">n3179</a> and 
  concluded that this change alone was not sufficient, as it would require changes to some of the derived stream types in the library.  
  The preference is to not make such a broad fix, and retain the current semantics. This is closed as NAD rather than NAD future as it 
  will be difficult to rename the new functions introduced in the C++0x revision of the standard at a later date.
! </blockquote>
  
  
  
--- 37515,37526 ----
  <p>
  Closed as NAD.
  </p>
! <blockquote><p>
  The Library Working Group reviewed <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3179.pdf">n3179</a> and 
  concluded that this change alone was not sufficient, as it would require changes to some of the derived stream types in the library.  
  The preference is to not make such a broad fix, and retain the current semantics. This is closed as NAD rather than NAD future as it 
  will be difficult to rename the new functions introduced in the C++0x revision of the standard at a later date.
! </p></blockquote>
  
  
  
*************** will be difficult to rename the new func
*** 50151,50188 ****
  
  
  <hr>
! <h3><a name="1451"></a>1451. [FCD] <tt>regex</tt> should support allocators</h3>
! <p><b>Section:</b> 28.8 [re.regex] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.regex">issues</a> in [re.regex].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1396">1396</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-141</b></p>
  
! std::basic_regex should have an allocator for all the
! reasons that a std::string does. For example, I can use
! boost::interprocess to put a string or vector in shared
! memory, but not a regex.
  
  
  <p><b>Proposed resolution:</b></p>
  Add allocators to regexes; see paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3171.pdf">N3171</a>
  in the pre-Batavia mailing.
  
  
  
  
  
  <hr>
! <h3><a name="1454"></a>1454. [FCD] Ensure C compatibility for atomics</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1455">1455</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses GB-128</b></p>
--- 37531,37625 ----
  
  
  <hr>
! <h3><a name="1451"></a>1451. <tt>regex</tt> should support allocators</h3>
! <p><b>Section:</b> 28.8 [re.regex] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.regex">issues</a> in [re.regex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-active.html#1396">1396</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-141</b></p>
  
! <p>
! <tt>std::basic_regex</tt> should have an allocator for all the
! reasons that a <tt>std::string</tt> does. For example, I can use
! <tt>boost::interprocess</tt> to put a <tt>string</tt> or <tt>vector</tt> 
! in shared memory, but not a regex.
! </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  Add allocators to regexes; see paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3171.pdf">N3171</a>
  in the pre-Batavia mailing.
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1452"></a>1452. "target sequence" is not defined</h3>
! <p><b>Section:</b> 28.10.4 [re.results.acc] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results.acc">issues</a> in [re.results.acc].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-125</b></p>
! 
! <p>The term "target sequence" is not defined (28.10.4 [re.results.acc] p. 2).</p>
! 
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <p>
! Replace "target sequence" with "string being searched/matched"
! </p>
! 
! <p><i>[
! 2010-11-01 Daniel comments:
! ]</i></p>
! 
! <p>
! The proposed resolution looks incomplete to me, there are more normative
! usages of the term <em>target sequence</em> in clause 28, e.g.
! 28.12.2 [re.tokiter] p. 7.
! </p>
! 
! <p><i>[2011-03-22 Madrid meeting: Moved to NAD]</i></p>
! 
! 
! 
! 
! <p><b>Rationale:</b></p><p>Standard is correct as written</p>
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Wording changes are against N3126. They are intended not to conflict with the wording changes
! suggested by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3158.html">n3158</a>.
! </p>
! <p>
! Change 28.10.4 [re.results.acc] p. 2 as indicated:
! </p>
! <blockquote><pre>
! difference_type position(size_type sub = 0) const;
! </pre><blockquote><p>
! 2 <em>Returns</em>: The distance from the start of the <del>target sequence</del><ins>string being matched</ins> to <tt>(*this)[sub].first</tt>.
! </p></blockquote></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1454"></a>1454. Ensure C compatibility for atomics</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1455">1455</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses GB-128</b></p>
*************** to ensure compatibity from both sides.
*** 50217,50248 ****
  
  
  <hr>
! <h3><a name="1458"></a>1458. [FCD] Overlapping evaluations are allowed</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1459">1459</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses GB-131</b></p>
  
  29.4 [atomics.lockfree] p.8 states:
! <p></p><blockquote>
  An atomic store shall only store a value that has been computed
  from constants and program input values by a finite sequence of
  program evaluations, such that each evaluation observes the values
  of variables as computed by the last prior assignment in the
  sequence.
! </blockquote><p></p>
  <p>
  ... but 1.9 [intro.execution] p.13 states:
  </p>
! <p></p><blockquote>
  If A is not sequenced before B and B is not sequenced before A,
  then A and B are unsequenced. [ <em>Note</em>: The execution of unsequenced
! evaluations can overlap. — <em>end note</em> ]
! </blockquote><p></p>
  <p>
  Overlapping executions can make it impossible to construct the sequence
  described in 29.4 [atomics.lockfree] p.8. We are not sure of the intention here and do not
--- 37654,37806 ----
  
  
  <hr>
! <h3><a name="1456"></a>1456. Missing fixed-size <tt>atomic_</tt> typedefs</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-129</b></p>
! <p>
! Table 143 lists the typedefs for various atomic types
! corresponding to the various standard integer typedefs,
! such as <tt>atomic_int_least8_t</tt> for <tt>int_least8_t</tt>, and
! <tt>atomic_uint_fast64_t</tt> for <tt>uint_fast64_t</tt>. However, there are
! no atomic typedefs corresponding to the fixed-size
! standard typedefs <tt>int8_t</tt>, <tt>int16_t</tt>, and so forth.
! </p>
! <p><i>[
! 2010-10-24 Daniel adds:
! ]</i></p>
! 
! 
! <blockquote><p>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue.
! </p></blockquote>
! 
! <p><i>[
! 2011-02-15 Anthony corrects numbering/naming for N3225, Howard suggests improvement for the position
! of '(optional)', Daniel reorders rows in harmony to remaining entries and suggests specific optionality
! comments:
! ]</i></p>
! 
! 
! <p><i>[2011-02-16 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p>
! 
! <p><i>[2011-03-16: Hans reopenes and comments]</i></p>
! 
! 
! <p>WG14 briefly discussed LWG 1456. It turns out that they had previously made a conscious decision not to make a 
! similar change. If C++ would deviate, this would introduce a C divergence.
! <p/>
! We should reopen the issue and, in my opinion, probably resolve it as NAD instead.  This is in a part of the standard 
! that is there mostly for C compatibility, so introducing divergence here seems to make no sense.
! </p>
! 
! <p><i>[2011-03-24 Madrid]</i></p>
! 
! <p><b>Rationale:</b></p><p>
! WG14 does not require these typedefs, and we see no reason to be gratuitously different.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Add the following entries to table 143:
! </p>
! <blockquote>
! <table border="1">
! <caption>Table 146 &mdash; <tt>atomic</tt> <tt>&lt;inttypes.h&gt;</tt> typedefs</caption>
! <tr>
! <th>Atomic typedef</th>
! <th><tt>&lt;inttypes.h&gt;</tt> type</th>
! </tr>
! <tr>
! <td><tt>...</tt></td>
! <td><tt>...</tt></td>
! </tr>
! <tr>
! <td><tt>atomic_intmax_t</tt></td>
! <td><tt>intmax_t</tt></td>
! </tr>
! <tr>
! <td><tt>atomic_uintmax_t</tt></td>
! <td><tt>uintmax_t</tt></td>
! </tr>
! <tr>
! <td><ins><tt>atomic_int8_t&nbsp;</tt>// <em>iff <tt>int8_t</tt> is provided</em></ins></td>
! <td><ins><tt>int8_t</tt></ins></td>
! </tr>
! <tr>
! <td><ins><tt>atomic_uint8_t&nbsp;</tt>// <em>iff <tt>uint8_t</tt> is provided</em></ins></td>
! <td><ins><tt>uint8_t</tt></ins></td>
! </tr>
! <tr>
! <td><ins><tt>atomic_int16_t&nbsp;</tt>// <em>iff <tt>int16_t</tt> is provided</em></ins></td>
! <td><ins><tt>int16_t</tt></ins></td>
! </tr>
! <tr>
! <td><ins><tt>atomic_uint16_t&nbsp;</tt>// <em>iff <tt>uint16_t</tt> is provided</em></ins></td>
! <td><ins><tt>uint16_t</tt></ins></td>
! </tr>
! <tr>
! <td><ins><tt>atomic_int32_t&nbsp;</tt>// <em>iff <tt>int32_t</tt> is provided</em></ins></td>
! <td><ins><tt>int32_t</tt></ins></td>
! </tr>
! <tr>
! <td><ins><tt>atomic_uint32_t&nbsp;</tt>// <em>iff <tt>uint32_t</tt> is provided</em></ins></td>
! <td><ins><tt>uint32_t</tt></ins></td>
! </tr>
! <tr>
! <td><ins><tt>atomic_int64_t&nbsp;</tt>// <em>iff <tt>int64_t</tt> is provided</em></ins></td>
! <td><ins><tt>int64_t</tt></ins></td>
! </tr>
! <tr>
! <td><ins><tt>atomic_uint64_t&nbsp;</tt>// <em>iff <tt>uint64_t</tt> is provided</em></ins></td>
! <td><ins><tt>uint64_t</tt></ins></td>
! </tr>
! </table>
! </blockquote> 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1458"></a>1458. Overlapping evaluations are allowed</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.order">active issues</a> in [atomics.order].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-active.html#1459">1459</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses GB-131</b></p>
  
+ <p>
  29.4 [atomics.lockfree] p.8 states:
! </p>
! <blockquote><p>
  An atomic store shall only store a value that has been computed
  from constants and program input values by a finite sequence of
  program evaluations, such that each evaluation observes the values
  of variables as computed by the last prior assignment in the
  sequence.
! </p></blockquote>
  <p>
  ... but 1.9 [intro.execution] p.13 states:
  </p>
! <blockquote><p>
  If A is not sequenced before B and B is not sequenced before A,
  then A and B are unsequenced. [ <em>Note</em>: The execution of unsequenced
! evaluations can overlap. &mdash; <em>end note</em> ]
! </p></blockquote>
  <p>
  Overlapping executions can make it impossible to construct the sequence
  described in 29.4 [atomics.lockfree] p.8. We are not sure of the intention here and do not
*************** that prevents out-of-thin-air reads.
*** 50252,50302 ****
  
  
  <p><b>Proposed resolution:</b></p>
  Request the concurrency working group to
  determine if changes are needed. Consider
  changing the use of "sequence" in 29.4 [atomics.lockfree]
  
  
  
  
  
  <hr>
! <h3><a name="1463"></a>1463. [FCD] Inconsistent value assignment for <tt>atomic_bool</tt></h3>
! <p><b>Section:</b> 29.5.1 [atomics.types.integral] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.integral">issues</a> in [atomics.types.integral].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1462">1462</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-157</b></p>
  
  <tt>atomic_bool</tt> has a <tt>volatile</tt> assignment operator but not a
  non-<tt>volatile</tt> operator. The other integral types have both.
  
  
  <p><b>Proposed resolution:</b></p>
  Add a non-volatile assignment operator to <tt>atomic_bool</tt>.
  
  
  
  
  
  <hr>
! <h3><a name="1470"></a>1470. [FCD] "Same-ness" curiosities</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1474">1474</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-165</b></p>
  
  According to 29.6 [atomics.types.operations] p. 23:
! <p></p><blockquote>
! “is the same that same as that of” is not grammatical (and is not clear)
! </blockquote><p></p>
  
  
  
--- 37810,37978 ----
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  Request the concurrency working group to
  determine if changes are needed. Consider
  changing the use of "sequence" in 29.4 [atomics.lockfree]
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1461"></a>1461. Rename all <tt>ATOMIC_*</tt> macros as <tt>STD_ATOMIC_*</tt></h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Canada <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses CA-1</b></p>
! <p>
! All <tt>ATOMIC_</tt>... macros should be prefixed with <tt>STD_</tt> as
! in <tt>STD_ATOMIC_</tt>... to indicate they are <tt>STD</tt> macros as
! other standard macros. The rationale that they all seem too long seems weak.
! </p>
! 
! <p><i>[2011-03-06: Daniel adapts suggested wording to N3242 and comments]</i></p>
! 
! 
! <p>I suggest to declare this issue as NAD. Reason for this suggestion is, that
! C1x is currently going to suggest exactly the same macros as additions to
! header <tt>&lt;stdatomic.h&gt;</tt>, therefore C++0x should not define a
! whole new set. I'm making this suggestion with the understanding that
! C1x is intending to keep in sync in this regard. For example, the most
! <a href="http://www.open-std.org/jtc1/sc22/wg14/www/docs/n1548.pdf">recent 
! draft of C1x</a> does contain the macro <tt>ATOMIC_ADDRESS_LOCK_FREE</tt>
! which has recently been removed from the C++ working draft.</p>
! 
! <p><i>[2011-03-24]</i></p>
! 
! <p><b>Rationale:</b></p><p>
! C is not going to change the name of these macros, and it is
! important they have the same name for compatibility
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>Change sub-clause 29.2 [atomics.syn] as indicated:</p>
! <blockquote><pre>
! [..]
! // <em>[atomics.lockfree], lock-free property</em>
! #define <ins>STD_</ins>ATOMIC_CHAR_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_CHAR16_T_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_CHAR32_T_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_WCHAR_T_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_SHORT_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_INT_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_LONG_LOCK_FREE <em>unspecified</em>
! #define <ins>STD_</ins>ATOMIC_LLONG_LOCK_FREE <em>unspecified</em>
! 
! // <em>[atomics.types.operations.req], operations on atomic types</em>
! #define <ins>STD_</ins>ATOMIC_VAR_INIT(value) <em>see below</em>
! [..]
! </pre></blockquote>
! </li>
! <li>
! <p>Change 29.4 [atomics.lockfree] p. 1 as indicated:</p>
! <blockquote><pre>
! #define <ins>STD_</ins>ATOMIC_CHAR_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_CHAR16_T_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_CHAR32_T_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_WCHAR_T_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_SHORT_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_INT_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_LONG_LOCK_FREE <em>implementation-defined</em>
! #define <ins>STD_</ins>ATOMIC_LLONG_LOCK_FREE <em>implementation-defined</em>
! </pre><blockquote>
! <p>
! 1 The <tt><ins>STD_</ins>ATOMIC_..._LOCK_FREE</tt> macros indicate the lock-free property of the corresponding atomic types, [..]
! </p></blockquote></blockquote>
! </li>
! <li>
! <p>Change 29.6.5 [atomics.types.operations.req] p. 6 as indicated:</p>
! <blockquote><pre>
! #define <ins>STD_</ins>ATOMIC_VAR_INIT(value) <em>see below</em>
! </pre><blockquote><p>
! 5 <em>Remarks</em>: The macro expands to a token sequence suitable for constant initialization 
! an atomic variable of static storage duration of a type that is initialization-compatible
! with <i>value</i>. [ <i>Note</i>: This operation may need to initialize locks. &mdash; <i>end note</i> ] 
! Concurrent access to the variable being initialized, even via an atomic operation, constitutes 
! a data race. [ <em>Example:</em>
! </p><blockquote><pre>
! atomic&lt;int&gt; v = <ins>STD_</ins>ATOMIC_VAR_INIT(5);
! </pre></blockquote>
! <p>&mdash; <em>end example</em> ]</p>
! </blockquote></blockquote>
! </li>
! <li>
! <p>Change 29.7 [atomics.flag] p. 1+4 as indicated:</p>
! <blockquote><pre>
! namespace std {
!   [..]
!   #define <ins>STD_</ins>ATOMIC_FLAG_INIT <em>see below</em>
! }
! </pre><blockquote><p>
! [..]
! 4 The macro <tt><ins>STD_</ins>ATOMIC_FLAG_INIT</tt> shall be defined in such a way that it can be used to initialize an object of
! type <tt>atomic_flag</tt> to the clear state. For a static-duration object, that initialization shall be static. It is
! unspecified whether an unitialized <tt>atomic_flag</tt> object has an initial state of set or clear. [ <em>Example:</em>
! </p><blockquote><pre>
! atomic_flag guard = <ins>STD_</ins>ATOMIC_FLAG_INIT;
! </pre></blockquote>
! <p>&mdash; <em>end example</em> ]</p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1463"></a>1463. Inconsistent value assignment for <tt>atomic_bool</tt></h3>
! <p><b>Section:</b> X [atomics.types.integral] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.integral">issues</a> in [atomics.types.integral].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1462">1462</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-157</b></p>
  
+ <p>
  <tt>atomic_bool</tt> has a <tt>volatile</tt> assignment operator but not a
  non-<tt>volatile</tt> operator. The other integral types have both.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  Add a non-volatile assignment operator to <tt>atomic_bool</tt>.
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1470"></a>1470. &quot;Same-ness&quot; curiosities</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1474">1474</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-165</b></p>
  
+ <p>
  According to 29.6 [atomics.types.operations] p. 23:
! </p>
! <blockquote><p>
! &#8220;is the same that same as that of&#8221; is not grammatical (and is not clear)
! </p></blockquote>
  
  
  
*************** According to 29.6 [atomics.types.operati
*** 50307,50340 ****
  
  
  <hr>
! <h3><a name="1471"></a>1471. [FCD] Default constructor of atomics needs specification</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-18</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-168</b></p>
  
  29.6 [atomics.types.operations] around p. 4: The definition of the default constructor needs exposition.
  
  
  <p><b>Proposed resolution:</b></p>
- Insert a new general prototype description following the current 29.6 [atomics.types.operations] p. 3 as indicated:
  <p>
  </p>
! <blockquote>
  3 [<em>Note</em>: Many operations are volatile-qualified. The “volatile as device register” semantics have not changed
  in the standard. This qualification means that volatility is preserved when applying these operations to
  volatile objects. It does not mean that operations on non-volatile objects become volatile. Thus, volatile
  qualified operations on non-volatile objects may be merged under some conditions. -- <em>end note</em>]
! </blockquote>
! <blockquote><pre><ins>A::A() = default;</ins>
! </pre><blockquote>
  <ins>? <em>Effects</em>: Leaves the atomic object in an uninitialized state.
  [<em>Note</em>: These semantics ensure compatiblity with <tt>C</tt>. -- <em>end note</em>]</ins>
! </blockquote></blockquote>
! <blockquote><pre>constexpr A::A(C desired);
  [..]
  </pre></blockquote>
  
--- 37983,38019 ----
  
  
  <hr>
! <h3><a name="1471"></a>1471. Default constructor of atomics needs specification</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-168</b></p>
  
+ <p>
  29.6 [atomics.types.operations] around p. 4: The definition of the default constructor needs exposition.
+ </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
+ Insert a new general prototype description following the current 29.6 [atomics.types.operations] p. 3 as indicated:
  </p>
! <blockquote><p>
  3 [<em>Note</em>: Many operations are volatile-qualified. The “volatile as device register” semantics have not changed
  in the standard. This qualification means that volatility is preserved when applying these operations to
  volatile objects. It does not mean that operations on non-volatile objects become volatile. Thus, volatile
  qualified operations on non-volatile objects may be merged under some conditions. -- <em>end note</em>]
! </p></blockquote>
! <blockquote><pre>
! <ins>A::A() = default;</ins>
! </pre><blockquote><p>
  <ins>? <em>Effects</em>: Leaves the atomic object in an uninitialized state.
  [<em>Note</em>: These semantics ensure compatiblity with <tt>C</tt>. -- <em>end note</em>]</ins>
! </p></blockquote></blockquote>
! <blockquote><pre>
! constexpr A::A(C desired);
  [..]
  </pre></blockquote>
  
*************** qualified operations on non-volatile obj
*** 50343,50401 ****
  
  
  <hr>
! <h3><a name="1472"></a>1472. [FCD] Incorrect semantics of <tt>atomic_init</tt></h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-12</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-171</b></p>
  
- As of 29.6 [atomics.types.operations] p. 7:
  <p>
  The <tt>atomic_init</tt> definition "Non-atomically assigns the
  value" is not quite correct, as the <tt>atomic_init</tt> purpose is
  initialization.
  
  
! </p><p><b>Proposed resolution:</b></p>
  Change  29.6 [atomics.types.operations] p. 7 as indicated:
! <blockquote><pre>void atomic_init(volatile A *object, C desired);
  void atomic_init(A *object, C desired);
! </pre><blockquote>
  7 <em>Effects</em>: <del>Non-atomically assigns the value desired to <tt>*object</tt></del><ins>Initializes <tt>*object</tt> with value
  <tt>desired</tt></ins>. Concurrent access from another thread, even via an atomic operation, constitutes a data race.
  <ins>[<em>Note</em>: This function should only be applied to objects that have been default constructed. These semantics ensure
! compatibility with <tt>C</tt>. — <em>end note</em>]</ins>
! </blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1473"></a>1473. [FCD] Incomplete memory order specifications</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-172</b></p>
  
- As of 29.6 [atomics.types.operations] p. 9, 13, 17, 20:
  <p>
  The order specifications are incomplete because the non-<tt>_explicit</tt>
  functions do not have such parameters.
! </p><p>
  Add a new sentence: "If the program does not specify an order, it shall be
  <tt>memory_order_seq_cst</tt>." Or perhaps: "The non-_explicit
  non-member functions shall affect memory as though they were _explicit with
  <tt>memory_order_seq_cst</tt>."
  
! 
! </p><p><i>[
  2010 Batavia
  ]</i></p>
  
--- 38022,38084 ----
  
  
  <hr>
! <h3><a name="1472"></a>1472. Incorrect semantics of <tt>atomic_init</tt></h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-171</b></p>
  
  <p>
+ As of 29.6 [atomics.types.operations] p. 7:
+ <p/>
  The <tt>atomic_init</tt> definition "Non-atomically assigns the
  value" is not quite correct, as the <tt>atomic_init</tt> purpose is
  initialization.
+ </p>
  
  
! <p><b>Proposed resolution:</b></p>
! <p>
  Change  29.6 [atomics.types.operations] p. 7 as indicated:
! </p>
! <blockquote><pre>
! void atomic_init(volatile A *object, C desired);
  void atomic_init(A *object, C desired);
! </pre><blockquote><p>
  7 <em>Effects</em>: <del>Non-atomically assigns the value desired to <tt>*object</tt></del><ins>Initializes <tt>*object</tt> with value
  <tt>desired</tt></ins>. Concurrent access from another thread, even via an atomic operation, constitutes a data race.
  <ins>[<em>Note</em>: This function should only be applied to objects that have been default constructed. These semantics ensure
! compatibility with <tt>C</tt>. &mdash; <em>end note</em>]</ins>
! </p></blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1473"></a>1473. Incomplete memory order specifications</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-172</b></p>
  
  <p>
+ As of 29.6 [atomics.types.operations] p. 9, 13, 17, 20:
+ <p/>
  The order specifications are incomplete because the non-<tt>_explicit</tt>
  functions do not have such parameters.
! <p/>
  Add a new sentence: "If the program does not specify an order, it shall be
  <tt>memory_order_seq_cst</tt>." Or perhaps: "The non-_explicit
  non-member functions shall affect memory as though they were _explicit with
  <tt>memory_order_seq_cst</tt>."
+ </p>
  
! <p><i>[
  2010 Batavia
  ]</i></p>
  
*************** The Concurrency subgroup reviewed this,
*** 50404,50464 ****
  29.6 [atomics.types.operations] paragraph 2, bullet 4. 
  </p>
  
! <p><b>Rationale:</b></p>The working paper is correct as written.
  
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>Change 29.6 [atomics.types.operations] p. 9 as indicated:
! <blockquote><pre>void atomic_store(volatile A* object, C desired);
  void atomic_store(A* object, C desired);
  void atomic_store_explicit(volatile A *object, C desired, memory_order order);
  void atomic_store_explicit(A* object, C desired, memory_order order);
  void A::store(C desired, memory_order order = memory_order_seq_cst) volatile;
  void A::store(C desired, memory_order order = memory_order_seq_cst);
! </pre><blockquote>
  8 <em>Requires</em>: The order argument shall not be <tt>memory_order_consume</tt>, <tt>memory_order_acquire</tt>, nor
  <tt>memory_order_acq_rel</tt>.
! <p>
  9 <em>Effects</em>: Atomically replaces the value pointed to by <tt>object</tt> or by this with the value of <tt>desired</tt>.
  Memory is affected according to the value of <tt>order</tt>. <ins>If the program does not specify an order, it shall be
  <tt>memory_order_seq_cst</tt>.</ins>
! </p></blockquote></blockquote>
  </li>
  <li>Change 29.6 [atomics.types.operations] p. 13 as indicated:
! <blockquote><pre>C atomic_load(const volatile A* object);
  C atomic_load(const A* object);
  C atomic_load_explicit(const volatile A* object, memory_order);
  C atomic_load_explicit(const A* object, memory_order);
  C A::load(memory_order order = memory_order_seq_cst) const volatile;
  C A::load(memory_order order = memory_order_seq_cst) const;
! </pre><blockquote>
  12 <em>Requires</em>: The order argument shall not be <tt>memory_order_release</tt> nor <tt>memory_order_acq_rel</tt>.
! <p>
  13 <em>Effects</em>: Memory is affected according to the value of <tt>order</tt>. <ins>If the program does not specify an order, it shall be
  <tt>memory_order_seq_cst</tt>.</ins>
! </p><p>
  14 <em>Returns</em>: Atomically returns the value pointed to by <tt>object</tt> or by <tt>this</tt>.
! </p></blockquote></blockquote>
  </li>
  <li>Change 29.6 [atomics.types.operations] p. 17 as indicated:
! <blockquote><pre>C atomic_exchange(volatile A* object, C desired);
  C atomic_exchange(A* object, C desired);
  C atomic_exchange_explicit(volatile A* object, C desired, memory_order);
  C atomic_exchange_explicit(A* object, C desired, memory_order);
  C A::exchange(C desired, memory_order order = memory_order_seq_cst) volatile;
  C A::exchange(C desired, memory_order order = memory_order_seq_cst);
! </pre><blockquote>
  17 <em>Effects</em>: Atomically replaces the value pointed to by <tt>object</tt> or by <tt>this</tt> with <tt>desired</tt>. Memory
  is affected according to the value of <tt>order</tt>. These operations are atomic read-modify-write operations
  (1.10). <ins>If the program does not specify an order, it shall be <tt>memory_order_seq_cst</tt>.</ins>
! <p>
  18 <em>Returns</em>: Atomically returns the value pointed to by <tt>object</tt> or by <tt>this</tt> immediately before the effects.
! </p></blockquote></blockquote>
  </li>
  <li>Change 29.6 [atomics.types.operations] p. 20 as indicated:
! <blockquote><pre>bool atomic_compare_exchange_weak(volatile A* object, C * expected, C desired);
  bool atomic_compare_exchange_weak(A* object, C * expected, C desired);
  bool atomic_compare_exchange_strong(volatile A* object, C * expected, C desired);
  bool atomic_compare_exchange_strong(A* object, C * expected, C desired);
--- 38087,38154 ----
  29.6 [atomics.types.operations] paragraph 2, bullet 4. 
  </p>
  
! <p><b>Rationale:</b></p><p>The working paper is correct as written.</p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>Change 29.6 [atomics.types.operations] p. 9 as indicated:
! <blockquote><pre>
! void atomic_store(volatile A* object, C desired);
  void atomic_store(A* object, C desired);
  void atomic_store_explicit(volatile A *object, C desired, memory_order order);
  void atomic_store_explicit(A* object, C desired, memory_order order);
  void A::store(C desired, memory_order order = memory_order_seq_cst) volatile;
  void A::store(C desired, memory_order order = memory_order_seq_cst);
! </pre><blockquote><p>
  8 <em>Requires</em>: The order argument shall not be <tt>memory_order_consume</tt>, <tt>memory_order_acquire</tt>, nor
  <tt>memory_order_acq_rel</tt>.
! <p/>
  9 <em>Effects</em>: Atomically replaces the value pointed to by <tt>object</tt> or by this with the value of <tt>desired</tt>.
  Memory is affected according to the value of <tt>order</tt>. <ins>If the program does not specify an order, it shall be
  <tt>memory_order_seq_cst</tt>.</ins>
! </p>
! </blockquote></blockquote>
  </li>
  <li>Change 29.6 [atomics.types.operations] p. 13 as indicated:
! <blockquote><pre>
! C atomic_load(const volatile A* object);
  C atomic_load(const A* object);
  C atomic_load_explicit(const volatile A* object, memory_order);
  C atomic_load_explicit(const A* object, memory_order);
  C A::load(memory_order order = memory_order_seq_cst) const volatile;
  C A::load(memory_order order = memory_order_seq_cst) const;
! </pre><blockquote><p>
  12 <em>Requires</em>: The order argument shall not be <tt>memory_order_release</tt> nor <tt>memory_order_acq_rel</tt>.
! <p/>
  13 <em>Effects</em>: Memory is affected according to the value of <tt>order</tt>. <ins>If the program does not specify an order, it shall be
  <tt>memory_order_seq_cst</tt>.</ins>
! <p/>
  14 <em>Returns</em>: Atomically returns the value pointed to by <tt>object</tt> or by <tt>this</tt>.
! </p>
! </blockquote></blockquote>
  </li>
  <li>Change 29.6 [atomics.types.operations] p. 17 as indicated:
! <blockquote><pre>
! C atomic_exchange(volatile A* object, C desired);
  C atomic_exchange(A* object, C desired);
  C atomic_exchange_explicit(volatile A* object, C desired, memory_order);
  C atomic_exchange_explicit(A* object, C desired, memory_order);
  C A::exchange(C desired, memory_order order = memory_order_seq_cst) volatile;
  C A::exchange(C desired, memory_order order = memory_order_seq_cst);
! </pre><blockquote><p>
  17 <em>Effects</em>: Atomically replaces the value pointed to by <tt>object</tt> or by <tt>this</tt> with <tt>desired</tt>. Memory
  is affected according to the value of <tt>order</tt>. These operations are atomic read-modify-write operations
  (1.10). <ins>If the program does not specify an order, it shall be <tt>memory_order_seq_cst</tt>.</ins>
! <p/>
  18 <em>Returns</em>: Atomically returns the value pointed to by <tt>object</tt> or by <tt>this</tt> immediately before the effects.
! </p>
! </blockquote></blockquote>
  </li>
  <li>Change 29.6 [atomics.types.operations] p. 20 as indicated:
! <blockquote><pre>
! bool atomic_compare_exchange_weak(volatile A* object, C * expected, C desired);
  bool atomic_compare_exchange_weak(A* object, C * expected, C desired);
  bool atomic_compare_exchange_strong(volatile A* object, C * expected, C desired);
  bool atomic_compare_exchange_strong(A* object, C * expected, C desired);
*************** bool A::compare_exchange_strong(C &amp;
*** 50486,50495 ****
    memory_order order = memory_order_seq_cst) volatile;
  bool A::compare_exchange_strong(C &amp; expected, C desired,
    memory_order order = memory_order_seq_cst);
! </pre><blockquote>
  19 <em>Requires</em>: The <tt>failure</tt> argument shall not be <tt>memory_order_release</tt> nor <tt>memory_order_acq_rel</tt>.
  The <tt>failure</tt> argument shall be no stronger than the success argument.
! <p>
  20 <em>Effects</em>: Atomically, compares the contents of the memory pointed to by <tt>object</tt> or by <tt>this</tt> for equality
  with that in <tt>expected</tt>, and if true, replaces the contents of the memory pointed to by <tt>object</tt> or by
  <tt>this</tt> with that in <tt>desired</tt>, and if false, updates the contents of the memory in expected with the
--- 38176,38185 ----
    memory_order order = memory_order_seq_cst) volatile;
  bool A::compare_exchange_strong(C &amp; expected, C desired,
    memory_order order = memory_order_seq_cst);
! </pre><blockquote><p>
  19 <em>Requires</em>: The <tt>failure</tt> argument shall not be <tt>memory_order_release</tt> nor <tt>memory_order_acq_rel</tt>.
  The <tt>failure</tt> argument shall be no stronger than the success argument.
! <p/>
  20 <em>Effects</em>: Atomically, compares the contents of the memory pointed to by <tt>object</tt> or by <tt>this</tt> for equality
  with that in <tt>expected</tt>, and if true, replaces the contents of the memory pointed to by <tt>object</tt> or by
  <tt>this</tt> with that in <tt>desired</tt>, and if false, updates the contents of the memory in expected with the
*************** according to the value of <tt>failure</t
*** 50501,50509 ****
  <tt>memory_order_release</tt> shall be replaced by the value <tt>memory_order_relaxed</tt>. <ins>If 
  the program does not specify an order, it shall be <tt>memory_order_seq_cst</tt>.</ins> If the operation returns <tt>true</tt>, 
  these operations are atomic read-modify-write operations (1.10). Otherwise, these operations are atomic load operations.
! </p><p>
  [..]
! </p></blockquote></blockquote>
  </li>
  </ol>
  
--- 38191,38200 ----
  <tt>memory_order_release</tt> shall be replaced by the value <tt>memory_order_relaxed</tt>. <ins>If 
  the program does not specify an order, it shall be <tt>memory_order_seq_cst</tt>.</ins> If the operation returns <tt>true</tt>, 
  these operations are atomic read-modify-write operations (1.10). Otherwise, these operations are atomic load operations.
! <p/>
  [..]
! </p>
! </blockquote></blockquote>
  </li>
  </ol>
  
*************** these operations are atomic read-modify-
*** 50512,50528 ****
  
  
  <hr>
! <h3><a name="1475"></a>1475. [FCD] weak compare-and-exchange confusion II</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1474">1474</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-23</b></p>
  
  29.6 [atomics.types.operations] p. 23: The first sentence has non-English syntax.
  
  <p><i>[
  Resolution proposed in ballot comment:
--- 38203,38220 ----
  
  
  <hr>
! <h3><a name="1475"></a>1475. weak compare-and-exchange confusion II</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1474">1474</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-23</b></p>
  
+ <p>
  29.6 [atomics.types.operations] p. 23: The first sentence has non-English syntax.
+ </p>
  
  <p><i>[
  Resolution proposed in ballot comment:
*************** while leaving the contents of memory poi
*** 50536,50541 ****
--- 38228,38259 ----
  by expected unchanged."
  </p>
  
+ <p><i>[
+ Daniel translates NB comment in a proposed resolution
+ ]</i></p>
+ 
+ 
+ <p>Change 29.6 [atomics.types.operations] p. 23 as indicated:</p>
+ 
+ <blockquote><p>
+ 23 <em>Remark</em>: <del>The weak compare-and-exchange operations may fail spuriously, that is, return false while
+ leaving the contents of memory pointed to by <tt>expected</tt> before the operation is the same that same
+ as that of the <tt>object</tt> and the same as that of <tt>expected</tt> after the operation</del><ins>The weak 
+ compare-and-exchange operations may fail spuriously, that is, return false while leaving the contents of memory 
+ pointed to by <tt>expected</tt> unchanged.</ins>. [ <em>Note</em>: This spurious failure enables implementation of 
+ compare-and-exchange on a broader class of machines, e.g., loadlocked store-conditional machines. A consequence of 
+ spurious failure is that nearly all uses of weak compare-and-exchange will be in a loop.
+ <p/>
+ When a compare-and-exchange is in a loop, the weak version will yield better performance on some
+ platforms. When a weak compare-and-exchange would require a loop and a strong one would not, the
+ strong one is preferable. &mdash; <em>end note</em> ]
+ </p></blockquote>
+ 
+ <p><i>[
+ See <a href="lwg-defects.html#1474">1474</a> for the proposed resolution
+ ]</i></p>
+ 
+ 
  
  <p><b>Proposed resolution:</b></p>
  
*************** by expected unchanged."
*** 50544,50561 ****
  
  
  <hr>
! <h3><a name="1476"></a>1476. [FCD] Ballot Comment US-177</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-07</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1474">1474</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-177</b></p>
  
  The first sentence of this paragraph doesn't make sense.
  
  <p><i>[
  Resolution proposed in ballot comment
--- 38262,38280 ----
  
  
  <hr>
! <h3><a name="1476"></a>1476. Meaningless specification of spurious failure</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1474">1474</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-177</b></p>
  
+ <p>
  The first sentence of this paragraph doesn't make sense.
+ </p>
  
  <p><i>[
  Resolution proposed in ballot comment
*************** Figure out what it's supposed to say, an
*** 50573,50588 ****
  
  
  <hr>
! <h3><a name="1477"></a>1477. [FCD] weak compare-and-exchange confusion III</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-31</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1474">1474</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-135</b></p>
  
  The first sentence of 29.6 [atomics.types.operations] p.23 was changed by n2992 but
  now makes no sense: "that is, return <tt>false</tt> while leaving
  the contents of memory pointed to by <tt>expected</tt> before the
--- 38292,38307 ----
  
  
  <hr>
! <h3><a name="1477"></a>1477. weak compare-and-exchange confusion III</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#Dup">Dup</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Dup">Dup</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-defects.html#1474">1474</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-135</b></p>
  
+ <p>
  The first sentence of 29.6 [atomics.types.operations] p.23 was changed by n2992 but
  now makes no sense: "that is, return <tt>false</tt> while leaving
  the contents of memory pointed to by <tt>expected</tt> before the
*************** neither version makes sense.
*** 50594,50599 ****
--- 38313,38319 ----
  Also, the remark talks about "<tt>object</tt>" which should
  probably be "<tt>object</tt> or <tt>this</tt>" to cover the member functions
  which have no object parameter.
+ </p>
  
  <p><i>[
  Resolution proposed in ballot comment:
*************** Fix the Remark to say whatever was inten
*** 50612,50627 ****
  
  
  <hr>
! <h3><a name="1483"></a>1483. [FCD] <tt>__STDCPP_THREADS spelling</tt></h3>
! <p><b>Section:</b> 30.3 [thread.threads] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-26</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-23</b></p>
  
  Predefined macros usually start and end with two
  underscores, see 16.8 and FDIS 29124 = WG21 N3060
! clause 7. __STDCPP_THREADS should blend in.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 38332,38349 ----
  
  
  <hr>
! <h3><a name="1483"></a>1483. <tt>__STDCPP_THREADS spelling</tt></h3>
! <p><b>Section:</b> 30.3 [thread.threads] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-23</b></p>
  
+ <p>
  Predefined macros usually start and end with two
  underscores, see 16.8 and FDIS 29124 = WG21 N3060
! clause 7. <tt>__STDCPP_THREADS</tt> should blend in.
! </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 50631,50671 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Change the macro name to
! __STDCPP_THREADS__.
  
  
  
  
  
  <hr>
! <h3><a name="1484"></a>1484. [FCD] Need a way to join a thread with a timeout</h3>
! <p><b>Section:</b> 30.3.1 [thread.thread.class] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-183</b></p>
! 
! There is no way to join a thread with a timeout.
! 
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
! Add <tt>join_for</tt> and <tt>join_until</tt>. Or decide one should
! never join a thread with a timeout since <tt>pthread_join</tt> doesn't have a 
! timeout version.
! </blockquote>
  
  <p><i>[
! 2010 Batavia
  ]</i></p>
  
  <p>
! The concurrency working group deemed this an extension beyond the scope of C++0x.
  </p>
! <p><b>Rationale:</b></p>The LWG does not wish to make a change at this time.
  
  
  
--- 38353,38478 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! Change the macro name to <tt>__STDCPP_THREADS__</tt>.
! </p>
  
  
  
  
  
  <hr>
! <h3><a name="1485"></a>1485. Unclear <tt>thread::id</tt> specification</h3>
! <p><b>Section:</b> 30.3.1.1 [thread.thread.id] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.id">issues</a> in [thread.thread.id].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-184</b></p>
! <p>
! It is unclear when a <tt>thread::id</tt> ceases to be meaningful.
! The sentence "The library may reuse the value of a
! <tt>thread::id</tt> of a terminated thread that can no longer be
! joined." implies that some terminated threads can be
! joined. It says nothing about detached threads.
! </p>
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
! Require a unique <tt>thread::id</tt> for every thread that is
! (1) detached and not terminated or (2) has an associated <tt>std::thread</tt> 
! object.
! </p></blockquote>
  
  <p><i>[
! 2010-11-22 Howard Hinnant observes
  ]</i></p>
  
+ 
  <p>
! A thread can either be running or terminated. Additionally a thread can be joined, detached, or neither.  
! These combine into the five possible states shown in this table:
  </p>
! 
! <table border="1">
! <tr>
! <th></th><th>Running</th><th>Terminated</th>
! </tr>
! <tr>
! <th>Neither joined nor detached</th><td>shall not reuse id</td><td>shall not reuse id</td>
! </tr>
! <tr>
! <th>detached</th><td>shall not reuse id</td><td>may reuse id</td>
! </tr>
! <tr>
! <th>joined</th><td>impossible state</td><td>may reuse id</td>
! </tr>
! </table>
! <p>
! Only if a thread is neither joined nor detached can it be joined. Or said differently, if a 
! thread has already been joined or detached, then it can not be joined. The sentence:
! </p>
! <blockquote><p>
! The library may reuse the value of a <tt>thread::id</tt> of a terminated thread that can no longer be joined.
! </p></blockquote>
! <p>
! precisely defines the two states shown in the above table where a thread::id may be reused.
! </p>
! <p>
! The following program illustrates all of the possibilities:
! </p>
! <blockquote><pre>
! #include &lt;mutex>
! #include &lt;thread>
! #include &lt;iostream>
! #include &lt;chrono>
! 
! std::mutex mut;
! 
! void f()
! {
!    std::lock_guard&lt;std::mutex&gt; _(mut);
!    std::cout &lt;&lt; "f id = " &lt;&lt; std::this_thread::get_id() &lt;&lt; " terminating\n";
! }
! 
! void g()
! {
!    std::lock_guard&lt;std::mutex&gt; _(mut);
!    std::cout &lt;&lt; "g id = " &lt;&lt; std::this_thread::get_id() &lt;&lt; " terminating\n";
! }
! 
! int main()
! {
!    std::cout &lt;&lt; "main id = " &lt;&lt; std::this_thread::get_id() &lt;&lt; "\n";
!    std::thread t1(f);
!    std::thread(g).detach();
!    std::this_thread::sleep_for(std::chrono::seconds(1));
!    std::cout &lt;&lt; "g's thread::id can be reused here because g has terminated and is detached.\n";
!    std::cout &lt;&lt; "f's thread::id can't be reused here because f has terminated but is still joinable.\n";
!    std::cout &lt;&lt; "f id = " &lt;&lt; t1.get_id() &lt;&lt; "\n";
!    t1.join();
!    std::cout &lt;&lt; "f's thread::id can be reused here because f has terminated and is joined.\n";
!    std::cout &lt;&lt; "f id = " &lt;&lt; t1.get_id() &lt;&lt; "\n";
! }
! 
! main id = 0x7fff71197ca0
! f id = 0x100381000 terminating
! g id = 0x100581000 terminating
! g's thread::id can be reused here because g has terminated and is detached.
! f's thread::id can't be reused here because f has terminated but is still joinable.
! f id = 0x100381000
! f's thread::id can be reused here because f has terminated and is joined.
! f id = 0x0
! </pre></blockquote>
! 
! <p><i>[2011-02-11 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively NAD after 5 votes.
! </p>
! 
  
  
  
*************** The concurrency working group deemed thi
*** 50676,50717 ****
  
  
  <hr>
! <h3><a name="1488"></a>1488. [FCD] Improve interoperability between
! the C++0x and C1x threads APIs</h3>
! <p><b>Section:</b> 30.4 [thread.mutex] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex">issues</a> in [thread.mutex].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-185</b></p>
! 
! Cooperate with WG14 to improve interoperability between
! the <tt>C++0x</tt> and <tt>C1x</tt> threads APIs. In particular, <tt>C1x</tt>
! mutexes should be conveniently usable with a <tt>C++0x</tt>
! <tt>lock_guard</tt>. Performance overheads for this combination
! should be considered.
! 
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
! Remove <tt>C++0x</tt> <tt>timed_mutex</tt> and
! <tt>timed_recursive_mutex</tt> if that facilitates
! development of more compatible APIs.
! </blockquote>
  
  <p><i>[
! 2010 Batavia
  ]</i></p>
  
  <p>
! The concurrency sub-group reviewed the options, and decided that closer harmony should wait until both standards are published.
  </p>
  
! <p><b>Rationale:</b></p>
! The LWG does not wish to make any change at this time.
  
  
  
  
--- 38483,38526 ----
  
  
  <hr>
! <h3><a name="1486"></a>1486. Value of <tt>this_thread::get_id()</tt> underspecified for detached thread</h3>
! <p><b>Section:</b> 30.3.2 [thread.thread.this] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.this">issues</a> in [thread.thread.this].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses CH-24</b></p>
! <p>
! What would be the value <tt>this_thread::get_id()</tt> when called from a detached thread?
! </p>
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <p>
! Add some text to clarify that <tt>get_id()</tt> still returns the same value even after detaching.
! </p>
  
  <p><i>[
! 2010-11-22 Howard Hinnant observes
  ]</i></p>
  
+ 
  <p>
! 30.3.2 [thread.thread.this]/1 contains the following sentence describing <tt>this_thread::get_id()</tt>:
  </p>
  
! <blockquote><p>
! ... No other thread of execution shall have this id and this thread of execution shall always have this id.
! </p></blockquote>
! 
! <p>I don't object to adding "even if detached" to this sentence, but it seems unnecessary to me. "Always" means always.</p>
! 
! <p><i>[2011-02-11 Reflector discussion]</i></p>
  
+ <p>
+ Moved to Tentatively NAD after 5 votes.
+ </p>
  
  
  
*************** The LWG does not wish to make any change
*** 50722,50745 ****
  
  
  <hr>
! <h3><a name="1489"></a>1489. [FCD] <tt>unlock</tt> functions and unlock
! mutex requirements are inconsistent</h3>
! <p><b>Section:</b> 30.4 [thread.mutex] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-12</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex">issues</a> in [thread.mutex].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-26</b></p>
  
  Specifications of <tt>unlock</tt> member functions and <tt>unlock</tt>
  mutex requirements are inconsistent wrt to exceptions and
  pre- and postconditions.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  <tt>unlock</tt> should specifiy the precondition that the
  current thread "owns the lock", this will make calls
  without holding the locks "undefined behavior".
--- 38531,38555 ----
  
  
  <hr>
! <h3><a name="1489"></a>1489. <tt>unlock</tt> functions and unlock mutex requirements are inconsistent</h3>
! <p><b>Section:</b> 30.4 [thread.mutex] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex">issues</a> in [thread.mutex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-26</b></p>
  
+ <p>
  Specifications of <tt>unlock</tt> member functions and <tt>unlock</tt>
  mutex requirements are inconsistent wrt to exceptions and
  pre- and postconditions.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  <tt>unlock</tt> should specifiy the precondition that the
  current thread "owns the lock", this will make calls
  without holding the locks "undefined behavior".
*************** Furthermore <tt>unique_lock</tt>'s postc
*** 50752,50805 ****
  in the case of a recursive mutex where <tt>owns</tt>
  might stay true, when it is not the last <tt>unlock</tt>
  needed to be called.
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1493"></a>1493. [FCD] Add <tt>mutex</tt>, <tt>recursive_mutex</tt>, <tt>is_locked</tt> function</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-189</b></p>
! 
! <tt>mutex</tt> and <tt>recursive_mutex</tt> should have an <tt>is_locked()</tt>
! member function. <tt>is_locked</tt> allows a user to test a lock
! without acquiring it and can be used to implement a lightweight
! <tt>try_try_lock</tt>.
! 
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <blockquote>
! Add a member function:
! <pre>bool is_locked() const;
! </pre>
! to <tt>std::mutex</tt> and <tt>std::recursive_mutex</tt>. These
! functions return true if the current thread would
! not be able to obtain a mutex. These functions do
! not synchronize with anything (and, thus, can
! avoid a memory fence).
! </blockquote>
! 
! <p><i>[
! 2010 Batavia
! ]</i></p>
! 
! <p>
! The Concurrency subgroup reviewed this issue and deemed it to be an extension to be handled after publishing C++0x.
! </p>
! 
! <p><b>Rationale:</b></p>The LWG does not wish to make a change at this time.
  
  
  
--- 38562,38568 ----
  in the case of a recursive mutex where <tt>owns</tt>
  might stay true, when it is not the last <tt>unlock</tt>
  needed to be called.
! </p></blockquote>
  
  
  
*************** The Concurrency subgroup reviewed this i
*** 50810,50833 ****
  
  
  <hr>
! <h3><a name="1495"></a>1495. [FCD] Condition variable <tt>wait_for</tt> return insufficient</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-12</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-191</b></p>
  
  The condition variable <tt>wait_for</tt> returning <tt>cv_status</tt> is insufficient.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  Return a duration of timeout remaining instead.
  See Appendix 1 of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3141.pdf">n3141</a> - Additional Details, p. 211
! </blockquote>
  
  
  
--- 38573,38598 ----
  
  
  <hr>
! <h3><a name="1495"></a>1495. Condition variable <tt>wait_for</tt> return value insufficient</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-191</b></p>
  
+ <p>
  The condition variable <tt>wait_for</tt> returning <tt>cv_status</tt> is insufficient.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  Return a duration of timeout remaining instead.
  See Appendix 1 of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3141.pdf">n3141</a> - Additional Details, p. 211
! </p></blockquote>
  
  
  
*************** See Appendix 1 of <a href="http://www.op
*** 50838,50865 ****
  
  
  <hr>
! <h3><a name="1496"></a>1496. [FCD] <tt>condition_variable</tt> not implementable</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-12</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-28</b></p>
  
! Requiring wait_until makes it impossible to implement
! condition_variable correctly using respective objects
  provided by the operating system (i.e. implementing the
  native_handle() function) on many platforms (e.g. POSIX,
  Windows, MacOS X) or using the same object as for the
  condition variable proposed for C.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  Remove the <tt>wait_until</tt> functions or make them at least conditionally supported.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 38603,38632 ----
  
  
  <hr>
! <h3><a name="1496"></a>1496. <tt>condition_variable</tt> not implementable</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-28</b></p>
  
! <p>
! Requiring <tt>wait_until</tt> makes it impossible to implement
! <tt>condition_variable</tt> correctly using respective objects
  provided by the operating system (i.e. implementing the
  native_handle() function) on many platforms (e.g. POSIX,
  Windows, MacOS X) or using the same object as for the
  condition variable proposed for C.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  Remove the <tt>wait_until</tt> functions or make them at least conditionally supported.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Remove the <tt>wait_until</tt> functions
*** 50869,50953 ****
  
  
  <hr>
! <h3><a name="1499"></a>1499. [FCD] Condition variables preclude wakeup optimization</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Future">NAD Future</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Future">NAD Future</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US-193</b></p>
  
! Condition variables preclude a wakeup optimization.
  
  <p><i>[
! Resolution proposed by ballot comment:
  ]</i></p>
  
  
- <blockquote>
- Change condition_variable to allow such
- optimization. See Appendix 1 - Additional Details
- </blockquote>
  
- <p><i>[
- 2010 Batavia
- ]</i></p>
  
  <p>
! The Concurrency subgroup reviewed the issue, and deemed it an extension to be handled after C++0x.
  </p>
  
- <p><b>Rationale:</b></p>The LWG does not wish to make the change at this time.
- 
- 
- 
- <p><b>Proposed resolution:</b></p>
- 
  
  
  
  
  <hr>
! <h3><a name="1500"></a>1500. [FCD] Consider removal of <tt>native_handle()</tt></h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-28</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses CH-32</b></p>
! 
! Given that the lock type can be something the underlying
! doesn't know 'native_handle()' is probably
! unimplementable on essentially all platforms.
! 
  <p><i>[
! Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
  ]</i></p>
  
! 
  
  
  <p><b>Proposed resolution:</b></p>
! Consider the removal of 'native_handle()'.
  
  
  
  
  
  <hr>
! <h3><a name="1506"></a>1506. [FCD] set_exception with a null pointer</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-198</b></p>
! 
! promise::set_exception can be called with a null pointer,
! but none of the descriptions of the get() functions for the
  three types of futures say what happens for this case.
! 
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
  ]</i></p>
--- 38636,38718 ----
  
  
  <hr>
! <h3><a name="1500"></a>1500. Consider removal of <tt>native_handle()</tt></h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses CH-32</b></p>
  
! <p>
! Given that the lock type can be something the underlying
! doesn't know 'native_handle()' is probably
! unimplementable on essentially all platforms.
! </p>
  
  <p><i>[
! Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
  ]</i></p>
  
  
  
  
+ <p><b>Proposed resolution:</b></p>
  <p>
! Consider the removal of 'native_handle()'.
  </p>
  
  
  
  
  
  <hr>
! <h3><a name="1503"></a>1503. "associated asynchronous state" must go</h3>
! <p><b>Section:</b> 30.6.4 [futures.state] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.state">issues</a> in [futures.state].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses CH-35</b></p>
! <p>
! The term "associated asynchronous state" is long, ugly and misleading terminology. When 
! introduced we agreed upon that we should come up with a better name. Here it is: 
! "liaison state". Since the state is hidden and provides synchronization of a 
! <tt>future</tt> with its corresponding <tt>promise</tt>, we believe "liaison state" is 
! a much better and shorter name (liaison ~ (typically hidden) relationship)
! </p>
  <p><i>[
! Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
! Change all occurrences of "associated
! asynchronous state" to "liaison state".
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>The project editor may supply a more appopriate term, or use "liaison state",
! at his own discretion.</p>
  
  
  
  
  
  <hr>
! <h3><a name="1506"></a>1506. <tt>set_exception</tt> with a null pointer</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-198</b></p>
! <p>
! <tt>promise::set_exception</tt> can be called with a null pointer,
! but none of the descriptions of the <tt>get()</tt> functions for the
  three types of futures say what happens for this case.
! </p>
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
  ]</i></p>
*************** Resolved in Rapperswil by a motion to di
*** 50956,50975 ****
  
  
  <p><b>Proposed resolution:</b></p>
  Add the following sentence to the end of
  30.6.5/22: The behavior of a program that calls
! set_exception with a null pointer is undefined.
  
  
  
  
  
  <hr>
! <h3><a name="1509"></a>1509. [FCD] No restriction on calling <tt>future::get</tt> more than once</h3>
! <p><b>Section:</b> 30.6.8 [futures.atomic_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-12</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-202</b></p>
  <p>
--- 38721,38742 ----
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  Add the following sentence to the end of
  30.6.5/22: The behavior of a program that calls
! <tt>set_exception</tt> with a null pointer is undefined.
! </p>
  
  
  
  
  
  <hr>
! <h3><a name="1509"></a>1509. No restriction on calling <tt>future::get</tt> more than once</h3>
! <p><b>Section:</b> X [futures.atomic_future] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-202</b></p>
  <p>
*************** says.
*** 50998,51008 ****
  
  
  <hr>
! <h3><a name="1510"></a>1510. [FCD] Should be undefined behaviour to call <tt>atomic_future</tt> operations unless <tt>valid()</tt></h3>
! <p><b>Section:</b> 30.6.8 [futures.atomic_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-12</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-203</b></p>
  <p>
--- 38765,38775 ----
  
  
  <hr>
! <h3><a name="1510"></a>1510. Should be undefined behaviour to call <tt>atomic_future</tt> operations unless <tt>valid()</tt></h3>
! <p><b>Section:</b> X [futures.atomic_future] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-203</b></p>
  <p>
*************** Resolution proposed by ballot comment:
*** 51017,51023 ****
  ]</i></p>
  
  <p>
! Add a new paragraph after 30.6.8 [futures.atomic_future]/2 with the same words as
  30.6.7 [futures.shared_future]/3.
  </p>
  
--- 38784,38790 ----
  ]</i></p>
  
  <p>
! Add a new paragraph after X [futures.atomic_future]/2 with the same words as
  30.6.7 [futures.shared_future]/3.
  </p>
  
*************** Add a new paragraph after 30.6.8 [future
*** 51026,51056 ****
  ]</i></p>
  
  
! <blockquote>
  While applying the wording, I notice that 30.6.7 [futures.shared_future]/3 does
  speak of the move-assignment operator, and <em>not</em> of the copy-assignment operator.
  <tt>atomic_future</tt> obviously needs this to be true for the copy-assignment operator,
  but I strongly assume that <tt>shared_future</tt> needs to mention both special member
  assignment operators in this paragraph. To keep this consistent, the following P/R also
  provides wording to fix the corresponding location for <tt>shared_future</tt>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>Change 30.6.7 [futures.shared_future]/3 as indicated:
! <blockquote>
  3 The effect of calling any member function other than the destructor<ins>, the 
  copy-assignment operator</ins>, the move-assignment operator, or <tt>valid()</tt> 
  on a <tt>shared_future</tt> object for which <tt>valid() == false</tt> is undefined.
! </blockquote>
  </li>
! <li>Following 30.6.8 [futures.atomic_future]/2, add a new paragraph:
! <blockquote>
  <ins>? The effect of calling any member function other than the destructor, the copy-assignment operator, or <tt>valid()</tt>
  on a <tt>atomic_future</tt> object for which <tt>valid() == false</tt> is undefined.</ins>
! </blockquote>
  </li>
  </ol>
  
--- 38793,38823 ----
  ]</i></p>
  
  
! <blockquote><p>
  While applying the wording, I notice that 30.6.7 [futures.shared_future]/3 does
  speak of the move-assignment operator, and <em>not</em> of the copy-assignment operator.
  <tt>atomic_future</tt> obviously needs this to be true for the copy-assignment operator,
  but I strongly assume that <tt>shared_future</tt> needs to mention both special member
  assignment operators in this paragraph. To keep this consistent, the following P/R also
  provides wording to fix the corresponding location for <tt>shared_future</tt>.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>Change 30.6.7 [futures.shared_future]/3 as indicated:
! <blockquote><p>
  3 The effect of calling any member function other than the destructor<ins>, the 
  copy-assignment operator</ins>, the move-assignment operator, or <tt>valid()</tt> 
  on a <tt>shared_future</tt> object for which <tt>valid() == false</tt> is undefined.
! </p></blockquote>
  </li>
! <li>Following X [futures.atomic_future]/2, add a new paragraph:
! <blockquote><p>
  <ins>? The effect of calling any member function other than the destructor, the copy-assignment operator, or <tt>valid()</tt>
  on a <tt>atomic_future</tt> object for which <tt>valid() == false</tt> is undefined.</ins>
! </p></blockquote>
  </li>
  </ol>
  
*************** on a <tt>atomic_future</tt> object for w
*** 51059,51069 ****
  
  
  <hr>
! <h3><a name="1511"></a>1511. [FCD] Synchronize the move-constructor for <tt>atomic_future</tt></h3>
! <p><b>Section:</b> 30.6.8 [futures.atomic_future] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-12</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-204</b></p>
  <p>
--- 38826,38836 ----
  
  
  <hr>
! <h3><a name="1511"></a>1511. Synchronize the move-constructor for <tt>atomic_future</tt></h3>
! <p><b>Section:</b> X [futures.atomic_future] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-204</b></p>
  <p>
*************** the source
*** 51095,51109 ****
  
  
  <hr>
! <h3><a name="1512"></a>1512. [FCD] Conflict in spec: block or join?</h3>
! <p><b>Section:</b> 30.6.9 [futures.async] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-12</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-205</b></p>
  <p>
! 30.6.9 [futures.async] p. 3: The third sentence says 
  "If the invocation is not deferred, a call to a waiting function 
  on an asynchronous return object that shares the associated asynchronous state
  created by this <tt>async</tt> call shall block until the associated
--- 38862,38876 ----
  
  
  <hr>
! <h3><a name="1512"></a>1512. Conflict in specification: block or join?</h3>
! <p><b>Section:</b> 30.6.8 [futures.async] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-205</b></p>
  <p>
! 30.6.8 [futures.async] p. 3: The third sentence says 
  "If the invocation is not deferred, a call to a waiting function 
  on an asynchronous return object that shares the associated asynchronous state
  created by this <tt>async</tt> call shall block until the associated
*************** finished or to call join, and rewrite to
*** 51130,51135 ****
  
  
  
  
  
! </body></html>
\ No newline at end of file
--- 38897,42632 ----
  
  
  
+ <hr>
+ <h3><a name="2006"></a>2006. <tt>emplace</tt> broken for associative containers</h3>
+ <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
+  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2010-10-18 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The current definition of <tt>emplace(args)</tt> for associative containers as
+ described in Table 99 is:
+ </p>
+ <blockquote>
+ <p>
+ <i>Requires</i>: <tt>T</tt> shall be constructible from <tt>args</tt>.
+ <p/>
+ <i>Effects</i>: Inserts a <tt>T</tt> object <tt>t</tt> constructed with
+ <tt>std::forward&lt;Args&gt;(args)...</tt> if and only if there is no element
+ in the container with key equivalent to the key of <tt>t</tt>.  The <tt>bool</tt>
+ component of the returned <tt>pair</tt> is <tt>true</tt> if and only if the
+ insertion takes place, and the iterator component of the <tt>pair</tt>
+ points to the element with key equivalent to the key of <tt>t</tt>.
+ </p>
+ </blockquote>
+ <p>
+ There is similar language in Table 100 for unordered associative containers.
+ <p/>
+ The first issue is editorial: <tt>T</tt> should be <tt>value_type</tt> throughout
+ both tables.
+ <p/>
+ The major issue is that, if the container is <tt>map</tt>, <tt>multimap</tt>,
+ <tt>unordered_map</tt>, or <tt>unordered_multimap</tt>, then the only way to
+ construct an object of <tt>value_type</tt> is to supply exactly two arguments
+ for <tt>Key</tt> and <tt>Value</tt>, a <tt>pair&lt;Key,Value&gt;</tt>, or a
+ <tt>piecewise_construct_t</tt> followed by two <tt>tuple</tt>s.  The original
+ <tt>emplace()</tt> proposal would have allowed you to specify a <tt>Key</tt>
+ value followed by any number of constructor arguments for <tt>Value</tt>.
+ When we removed the variadic constructor to <tt>pair</tt>, this ability went
+ away.  I don't think that was deliberate.
+ <p/>
+ Fixing this is non-trivial, I think. I think that <tt>emplace()</tt> for <tt>map</tt>
+ and <tt>multimap</tt> need several overloads: one for each overloaded constructor in
+ <tt>pair&lt;Key,Value&gt;</tt>, and one for the <tt>emplace(Key, valueargs...)</tt> case.
+ And it probably needs some SFINAE meta-programming to ensure that the last case
+ doesn't override any of the other ones.  Alternatively, one could say that
+ there are exactly two cases: <tt>emplace(args)</tt> where <tt>pair&lt;Key,Value&gt;</tt>
+ is constructible from <tt>args</tt>, and <tt>emplace(args)</tt> where <tt>Key</tt> is
+ constructible form the first <tt>arg</tt> and <tt>Value</tt> is constructible from the
+ rest.
+ <p/>
+ Alternatively, the status quo is to use <tt>piecewise_construct_t</tt> if you want to
+ construct an object.
+ </p>
  
+ <p><i>[
+ 2010 Batavia:
+ ]</i></p>
  
! 
! <p>
! N3178 was looked at in session and moved to NAD.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2026"></a>2026. <tt>hash</tt> should be <tt>std</tt> qualified for unordered container</h3>
! <p><b>Section:</b> 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2011-02-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Tom Plum pointed out to me that there's an apparent inconsistency in the <tt>std::</tt> qualification of template names in the unordered containers:
! </p>
! 
! <blockquote><pre>
!  template &lt;class Key,
!            class T,
!            class Hash = hash&lt;Key&gt;,
!            class Pred = std::equal_to&lt;Key&gt;,
!            class Alloc = std::allocator&lt;std::pair&lt;const Key, T&gt; &gt; &gt;
!    class unordered_map;
! </pre></blockquote>
! 
! <p>
! Is there a reason that hash is not qualified with <tt>std::</tt>? TR1 also
! does not use <tt>std::</tt> here.
! </p>
! 
! <p><i>[
! 2011-02-07 Chris Jefferson adds:
! ]</i></p>
! 
! <p>
! I assumed (I might be wrong) it is because <tt>hash</tt> is designed to be a
! customisation point, like <tt>swap</tt>.
! </p>
! 
! <p><i>[
! 2011-02-07 Howard Hinnant adds:
! ]</i></p>
! 
! <p>I think this is incorrect.  We mean <tt>std::hash</tt>, though clients
! are free to specialize <tt>std::hash</tt> on user-defined types.  With the
! possible exception of <tt>begin</tt>/<tt>end</tt> (which I'm not sure if
! we've settled that), <tt>swap</tt> is the only intended customization point (look up a function by ADL) in the <tt>std::</tt> lib.
! </p>
! 
! <p><i>[
! 2011-02-24 Chris Jefferson adds:
! ]</i></p>
! 
! <p>I recommend NAD, due to 17.6.1.1 [contents] p3:</p>
! <blockquote><p>
! Whenever a name <tt>x</tt> defined in the standard library is mentioned, the name <tt>x</tt> is assumed to be fully qualified
! as <tt>::std::x</tt>, unless explicitly described otherwise. For example, if the Effects section for library function <tt>F</tt>
! is described as calling library function <tt>G</tt>, the function <tt>::std::G</tt> is meant.
! </p></blockquote>
! 
! <p><i>[2011-02-25 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively NAD after 5 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2036"></a>2036. <tt>istream &gt;&gt; char</tt> and <tt>eofbit</tt></h3>
! <p><b>Section:</b> 27.7.2.1 [istream] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2011-02-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream">issues</a> in [istream].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>The question is:  When a single character is extracted from an <tt>istream</tt> using <tt>operator&gt;&gt;</tt>, 
! does <tt>eofbit</tt> get set if this is the last character extracted from the stream?  The current standard is at 
! best ambiguous on the subject. 27.7.2.1 [istream]/p3 describes all extraction operations with:</p>
! 
! <blockquote><p>
! 3 If <tt>rdbuf()-&gt;sbumpc()</tt> or <tt>rdbuf()-&gt;sgetc()</tt> returns <tt>traits::eof()</tt>, then the input 
! function, except as explicitly noted otherwise, completes its actions and does <tt>setstate(eofbit)</tt>, which may 
! throw <tt>ios_base::failure</tt> (27.5.5.4 [iostate.flags]), before returning.
! </p></blockquote>
! 
! <p>And 27.7.2.2.3 [istream::extractors]/p12 in describing <tt>operator&gt;&gt;(basic_istream&lt;charT,traits&gt;&amp; in, charT&amp; c);</tt> 
! offers no further clarification:
! </p>
! 
! <blockquote><p>
! 12 <i>Effects</i>: Behaves like a formatted input member (as described in [istream.formatted.reqmts]) of <tt>in</tt>. 
! After a <tt>sentry</tt> object is constructed a character is extracted from <tt>in</tt>, if one is available, and 
! stored in <tt>c</tt>. Otherwise, the function calls <tt>in.setstate(failbit)</tt>.
! </p></blockquote>
! 
! <p>I coded it one way in libc++, and g++ coded it another way.  Chris Jefferson noted that some boost code was 
! sensitive to the difference and fails for libc++.  Therefore I believe that it is very important that we specify 
! this extraction operator in enough detail that both vendors and clients know what behavior is required and expected.
! </p>
! 
! <p>Here is a brief code example demonstrating the issue:</p>
! 
! <blockquote><pre>
! #include &lt;sstream&gt;
! #include &lt;cassert&gt;
! 
! int main()
! {
!   std::istringstream ss("1");
!   char t;
!   ss &gt;&gt; t;
!   assert(!ss.eof());
! };
! </pre></blockquote>
! 
! <p>For every type capable of reading this istringstream but <tt>char</tt>, <tt>ss.eof()</tt> will be true after the 
! extraction (<tt>bool</tt>, <tt>int</tt>, <tt>double</tt>, etc.).  So for consistency's sake we might want to have 
! <tt>char</tt> behave the same way as other built-in types.</p>
! 
! <p>However Jean-Marc Bourguet offers this counter example code using an interactive stream.  He argues that 
! setting <tt>eof</tt> inhibits reading the next line:</p>
! 
! <blockquote><pre>
! #include &lt;iostream&gt;
! 
! int main()
! {
!  char c;
!  std::cin &gt;&gt; std::noskipws;
!  std::cout &lt;&lt; "First line: ";
!  while (std::cin &gt;&gt; c) {
!     if (c == '\n') {
!        std::cout &lt;&lt; "Next line: ";
!     }
!  }
! }
! </pre></blockquote>
! 
! <p>As these two code examples demonstrate, whether or not <tt>eofbit</tt> gets set is an observable difference and it 
! is impacting real-world code.  I feel it is critical that we clearly and unambiguously choose one behavior or the other.  
! I am proposing wording for both behaviors and ask the LWG to choose one (and only one!).</p>
! 
! <p>Wording for setting <tt>eof</tt> bit:</p>
! 
! <p>Modify 27.7.2.2.3 [istream::extractors]/p12 as follows:</p>
! 
! <blockquote><p>
! 12 <i>Effects</i>: Behaves like a formatted input member (as described in [istream.formatted.reqmts]) of <tt>in</tt>. 
! After a <tt>sentry</tt> object is constructed a character is extracted from <tt>in</tt>, if one is available, and 
! stored in <tt>c</tt>. <del>Otherwise, the function calls <tt>in.setstate(failbit)</tt>.</del>  <ins>If a character is 
! extracted and it is the last character in the pending sequence, the function calls <tt>in.setstate(eofbit)</tt>.  
! If a character is not extracted the function calls <tt>in.setstate(failbit | eofbit)</tt>.</ins>
! </p></blockquote>
! 
! <p>Wording for not setting <tt>eof</tt> bit:</p>
! 
! <blockquote><p>
! 12 <i>Effects</i>: Behaves like a formatted input member (as described in [istream.formatted.reqmts]) of <tt>in</tt>. 
! After a <tt>sentry</tt> object is constructed a character is extracted from <tt>in</tt><del>, if one is available, 
! and stored in <tt>c</tt>. Otherwise, the function calls <tt>in.setstate(failbit)</tt>.</del> <ins>with 
! <tt>in.rdbuf()-&gt;sbumpc()</tt>.  If <tt>traits::eof()</tt> is returned, the function calls 
! <tt>in.setstate(failbit | eofbit)</tt>.  Otherwise the return value is converted to type <tt>charT</tt> and stored
! in <tt>c</tt>.</ins>
! </p></blockquote>
! 
! <p><i>[2011-02-27: Jean-Marc Bourguet comments]</i></p>
! 
! 
! <p>Just for completeness: it [the counter example] doesn't inhibit to read the next line, it inhibits the prompt 
! to be put at the appropriate time.</p>
! 
! <p>More information to take into account when deciding:</p>
! 
! <ul>
! <li><p>if I'm reading correctly the section to get boolean values when <tt>boolalpha</tt> is set, there we mandate 
! that <tt>eof</tt> isn't set if trying to read past the end of the pending sequence wasn't needed to determine the result.
! </p></li>
! 
! <li><p>
! see also the behaviour of <tt>getline</tt> (which isn't a formatted input function but won't set <tt>eof</tt> 
! if it occurs just after the delimiter)
! </p></li>
! 
! <li><p>
! if I'm reading the C standard correctly <tt>scanf("%c")</tt> wouldn't set <tt>feof</tt> either in that situation.
! </p></li>
! </ul>
! 
! <p><i>[2011-02-28: Martin Sebor comments]</i></p>
! 
! 
! <p>[Responds to bullet 1 of Jean-Marc's list]</p>
! 
! <p>
! Yes, this matches the stdcxx test suite for <tt>num_get</tt> and <tt>time_get</tt>
! but not <tt>money_get</tt> when the currency symbol is last. I don't see
! where in the locale.money.get.virtuals section we specify whether
! <tt>eofbit</tt> is or isn't set and when.
! <p/>
! IMO, if we try to fix the <tt>char</tt> extractor to be consistent we
! should also fix all the others extractors and manipulators that
! aren't consistent (including <tt>std::get_money</tt> and <tt>std::get_time</tt>).
! </p>
! 
! <p><i>[2011-03-24 Madrid meeting]</i></p>
! 
! 
! <p>Dietmar convinced Howard, that the standard does already say the right words</p>
! 
! 
! 
! <p><b>Rationale:</b></p><p>Reading the last character does not set eofbit and the standard says so already</p>
! 
! <p><b>Proposed resolution:</b></p>
! <p></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2043"></a>2043. <tt>std{in,out,err}</tt> should be usable as field names</h3>
! <p><b>Section:</b> 27.9.2 [c.files] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2011-03-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.files">issues</a> in [c.files].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! People often define structs and classes with fields named <tt>stdin</tt>,
! <tt>stdout</tt>, or <tt>stderr</tt>. According to 27.9.2 [c.files], 
! though, these are macros.
! <p/>
! glibc defines them to themselves, allowing their non-portable use as
! field names, while the Mac OS X libc defines them to either <tt>__stdoutp</tt>
! or <tt>(&amp;__sF[1])</tt>, etc depending on <tt>__DARWIN_UNIX03</tt>. It's possible to
! allow their use while, as far as I can see, only requiring minor
! changes to various libc's, so C++1x should allow it.
! </p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! Closed as NAD.  This is an extension request that has been an issue for over 20 years.
! Supporting the extension would place a burden on the underlying C library that we may
! not be in a position to influence.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>In 27.9.2 [c.files] add "stderr", "stdin", and "stdout" to a new Values section in Table
! 134 &mdash; Header <tt>&lt;cstdio&gt;</tt> synopsis:</p>
! 
! <blockquote>
! <table border="1">
! <caption>134 &mdash; Header <tt>&lt;cstdio&gt;</tt> synopsis</caption>
! 
! <tr>
! <th colspan="6" style="text-align:center;">Type Name(s)</th>
! </tr>
! 
! <tr>
! <th colspan="6" style="text-align:left;">Macros:</th>
! </tr>
! 
! <tr>
! <td><tt>BUFSIZ</tt></td>
! <td><tt>FOPEN_MAX</tt></td>
! <td><tt>SEEK_CUR</tt></td>
! <td><tt>TMP_MAX</tt></td>
! <td><tt>_IONBF</tt></td>
! <td><tt>stdout</tt></td>
! </tr>
! 
! <tr>
! <td><tt>EOF</tt></td>
! <td><tt>L_tmpnam</tt></td>
! <td><tt>SEEK_END</tt></td>
! <td><tt>_IOFBF</tt></td>
! <td><tt>stderr</tt></td>
! <td>&nbsp;</td>
! </tr>
! 
! <tr>
! <td><tt>FILENAME_MAX</tt></td>
! <td><tt>NULL &lt;cstdio&gt;</tt></td>
! <td><tt>SEEK_SET</tt></td>
! <td><tt>_IOLBF</tt></td>
! <td><tt>stdin</tt></td>
! <td>&nbsp;</td>
! </tr>
! 
! <tr>
! <th style="text-align:left;">Types:</th>
! <td><tt>FILE</tt></td>
! <td><tt>fpos_t</tt></td>
! <td><tt>size_t &lt;cstdio&gt;</tt></td>
! <td>&nbsp;</td>
! <td>&nbsp;</td>
! </tr>
! 
! <tr>
! <th colspan="6" style="text-align:left;">Functions:</th>
! </tr>
! 
! <tr>
! <td colspan="6" style="text-align:center;">&hellip;</td>
! </tr>
! 
! <tr>
! <th colspan="6" style="text-align:left;"><ins>Values:</ins></th>
! </tr>
! 
! <tr>
! <td><ins><tt>stderr</tt></ins></td>
! <td><ins><tt>stdin</tt></ins></td>
! <td><ins><tt>stdout</tt></ins></td>
! <td>&nbsp;</td>
! <td>&nbsp;</td>
! <td>&nbsp;</td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! 
! <li><p>Add a new paragraph after paragraph 2 as indicated:</p>
! 
! <blockquote><p>
! 2 Calls to the function <tt>tmpnam</tt> with an argument of <tt>NULL</tt> may 
! introduce a data race (17.6.5.9) with other calls to <tt>tmpnam</tt> with an 
! argument of <tt>NULL</tt>.<br/>
! See also: ISO C 7.9, Amendment 1 4.6.2.
! <p/>
! <ins>? The macros <tt>stderr</tt>, <tt>stdin</tt>, and <tt>stdout</tt> shall 
! expand to <tt>stderr</tt>, <tt>stdin</tt>, and <tt>stdout</tt>, respectively. 
! [<i>Note:</i> This allows uses of <tt>#ifdef</tt> to detect their presence, 
! while allowing code in other scopes to use them as identifiers. &mdash; <i>end note</i>]</ins>
! </p></blockquote>
! </li>
! 
! <li><p>In C.5 [diff.library] add "stderr", "stdin", and "stdout" to 
! Table 150 &mdash; Standard values:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 150 &mdash; Standard values</caption>
! 
! <tr>
! <td><tt>CHAR_BIT</tt></td>
! <td><tt>FLT_DIG</tt></td>
! <td><tt>INT_MIN</tt></td>
! <td><tt>MB_LEN_MAX</tt></td>
! </tr>
! 
! <tr>
! <td colspan="4" style="text-align:center;">&hellip;</td>
! </tr>
! 
! <tr>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td><tt>SHRT_MIN</tt></td>
! </tr>
! 
! <tr>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td><ins><tt>stderr</tt></ins></td>
! </tr>
! 
! <tr>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td><ins><tt>stdin</tt></ins></td>
! </tr>
! 
! <tr>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td><ins><tt>stdout</tt></ins></td>
! </tr>
! 
! <tr>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td>&hellip;</td>
! <td><tt>UCHAR_MAX</tt></td>
! </tr>
! 
! <tr>
! <td colspan="4" style="text-align:center;">&hellip;</td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2046"></a>2046. <tt>shared_future(future&lt;R&gt;&amp;&amp;)</tt> should be allowed to throw</h3>
! <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Peter Sommerlad <b>Opened:</b> 2011-04-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Requiring the constructor <tt>shared_future(future&lt;R&gt;&amp;&amp; rhs)</tt> not to throw 
! is a pessimisation of the case where a future is returned from a call to 
! <tt>async(function,launch::deferred)</tt> and possible other cases.
! <p/>
! Such a future not dealing with multiple threads only needs to keep (a copy of) the function 
! to be called it later. However, creating a <tt>shared_future</tt> from that future will require more 
! infrastructure, like space for the value of type <tt>R</tt>, an <tt>exception_ptr</tt>, and a synchronized 
! reference counter for the <tt>shared_future</tt>'s instances.
! <p/>
! Enforcing the constructor <tt>shared_future(future&lt;R&gt;&amp;&amp; rhs)</tt> not to throw, 
! implies that any implementation of <tt>future</tt> will need to pre-allocate space for <tt>shared_future</tt>'s 
! infrastructure, that also requires an operating system resource for synchronization, regardless 
! if is ever needed.
! <p/>
! All this came up when discussing D&#47;N3267 and Concurrency Working Group decided that the constructor 
! <tt>shared_future(future&lt;R&gt;&amp;&amp; rhs)</tt> should be allowed to throw. 
! </p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! Closed as NAD.  Rationale to follow by email...
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>Apply the proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3269.htm">n3269</a></p>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2060"></a>2060. <tt>unique_ptr&lt;T[]&gt;(nullptr_t)</tt> missing <tt>noexcept</tt></h3>
! <p><b>Section:</b> 20.8.1.3 [unique.ptr.runtime] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Howard Hinnant, Paolo Carlini <b>Opened:</b> 2011-05-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.runtime">issues</a> in [unique.ptr.runtime].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The synopsis in 20.8.1.2 [unique.ptr.single] specifies:
! </p><blockquote><pre>
! constexpr unique_ptr(nullptr_t) noexcept
! </pre></blockquote><p>
! which looks correct to me.  However the corresponding constructor in 20.8.1.3 [unique.ptr.runtime] is missing <tt>noexcept</tt>:
! </p><blockquote><pre>
! constexpr unique_ptr(nullptr_t) : unique_ptr() { }
! </pre></blockquote>
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Closed as NAD Editorial.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Modify the synopsis in 20.8.1.3 [unique.ptr.runtime]:</p>
! <blockquote><pre>
! namespace std {
!   template &lt;class T, class D&gt; class unique_ptr&lt;T[], D&gt; {
!   public:
!     typedef see below pointer;
!     typedef T element_type;
!     typedef D deleter_type;
! 
!     // 20.7.1.3.1, constructors
!     constexpr unique_ptr() noexcept;
!     [&hellip;]
!     constexpr unique_ptr(nullptr_t) <ins>noexcept</ins> : unique_ptr() { }
! 	
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2068"></a>2068. <tt>std::pair</tt> not C++03-compatible with defaulted copy c'tor</h3>
! <p><b>Section:</b> 20.3.2 [pairs.pair] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-06-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs.pair">issues</a> in [pairs.pair].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The specification of the copy semantics of the C++03 version of <tt>std::pair</tt>
! is defined by the class synopsis in [lib.pairs]:
! </p>
! <blockquote><pre>
! template &lt;class T1, class T2&gt;
! struct pair {
!   typedef T1 first_type;
!   typedef T2 second_type;
! 
!   T1 first;
!   T2 second;
!   pair();
!   pair(const T1&amp; x, const T2&amp; y);
!   template&lt;class U, class V&gt; pair(const pair&lt;U, V&gt; &amp;p);
! };
! </pre></blockquote>
! <p>
! The effect of this specification is, that the copy constructor is compiler-declared
! with the proper form depending on the contained member types. In particular, the
! instantiation of <tt>pair</tt> is well-formed with an element type that has a
! copy constructor with non-const first parameter type like specialzations of <tt>auto_ptr</tt>
! or any user-defined type like the following one:
! </p>
! <blockquote><pre>
! struct A {
!   A(A&amp;){}
! };
! </pre></blockquote>
! <p>
! In contrast to container types which require <tt>CopyConstructible</tt> value types, the C++03 <tt>pair</tt> 
! does support these, albeit unusual, element types.
! <p/>
! The FDIS version of the <tt>std::pair</tt> specification does specify the same semantics by 
! defaulting the copy and move constructor in 20.3.2 [pairs.pair]:
! </p>
! <blockquote><pre>
! template &lt;class T1, class T2&gt;
! struct pair {
!   typedef T1 first_type;
!   typedef T2 second_type;
! 
!   T1 first;
!   T2 second;
!   <span style="color:#C80000">pair(const pair&amp;) = default;</span>
!   <span style="color:#C80000">pair(pair&amp;&amp;) = default;</span>
!   pair();
!   [&hellip;]
! };
! </pre></blockquote>
! <p>
! But according to the current core rules this makes the instantiation of e.g. <tt>std::pair&lt;A, int&gt;</tt>
! ill-formed, because of the <tt>const</tt> mismatch of the compiler-declared form of the copy constructor
! with that of the defaulted declaration.
! <p/>
! Unfortunately there seems to be no simple library solution for this problem. If the defaulted declarations
! were removed, both copy c'tor and move c'tor would be <b>deleted</b>, because there exist user-declared
! copy assignment and move assignment operators in the FDIS. But these operations need to be user-defined 
! to realize the wanted semantics of these operations for element types that are reference types. If core
! rules would not be changed to fix that, I see the following options:
! </p>
! <ol>
! <li>Intentionally decide to break the support for element types with non-const copy c'tors in <tt>pair</tt>.</li>
! <li>User-declare both copy and move ctor to at least support the instantiation of the <tt>pair</tt> specializations, 
! but this would still not allow to copy them by the copy constructor.</li>
! <li>User-declare both the const and non-const copy ctors, the move ctor, and additionally the non-const copy assignment
! operator to support the instantiation of the <tt>pair</tt> specializations and of these members. This would 
! support all element types as it did in C++03, but all copy&#47;move members would be non-trivial.</li>
! <li>Intentionally decide to give up support for element types that are references for <tt>pair</tt>, but
! still keep the allocator support with the effect of removing all declarations of the special
! copy&#47;move members. User code that needs to use <tt>tuple</tt> instead. But this would be a rather
! drastic step requiring further corrections of the draft, e.g. a change of the signature of the algorithm
! <tt>minmax</tt> (not the overload with the <tt>initializer_list</tt>) with a different return type.</li>
! </ol>
! <p>
! This problem does <b>not</b> extend as backward-compatibility problem to <tt>tuple</tt>, because the TR1 
! specification did explicitly declare copy constructor and copy assignment operator via the &quot;normal&quot; 
! form:
! </p>
! <blockquote><pre>
! tuple(const tuple&amp;);
! tuple&amp; operator=(const tuple&amp;);
! </pre></blockquote>
! <p>
! </p>
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Closed as NAD.
! </p>
! 
! <p>
! This is an unfortunate change of behavior between C++03 and C++11, but is consistent with <tt>tuple</tt>.  There is no desire to go to lengths supporting types like <tt>auto_ptr</tt> now that rvalue references are in the language.
! </p>
! 
! <p>
! There may be an issue for Core/EWG to look at, so that some simple <tt>=default</tt> syntax could be used that would do the right thing.  If such a facility became availabile, LWG might revisit this issue.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2073"></a>2073. Library exceptions that take string arguments</h3>
! <p><b>Section:</b> 19.2 [std.exceptions], 19.5.6 [syserr.syserr], 27.5.3.1.1 [ios::failure] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Eelis van der Weegen <b>Opened:</b> 2011-08-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#std.exceptions">issues</a> in [std.exceptions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! This is an extension issue for LWG to add constructor overloads that take a 
! <tt>string</tt> by an rvalue reference in order to move the string into the 
! exception.
! </p>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to NAD.
! </p>
! <p>
! This was discussed during C++11 standardization, and deemed (at the time) to be a conforming
! extension that vendors are free to add, but there seemed no need to call it out in the standard.
! Since then it has been noted that the rvalue-reference overloads do not give you the move-semantic
! guarantee the proposer is thought to be looking for, as in order to meet the requirements that
! copy constructors do not throw (for standard exceptions) the exceptions that store strings must
! actually store a reference-counted immutable string, rather than an <tt>std::string</tt> internally.
! Therefore, an rvalue-reference overload is going to have to allocate memory in exactly the same
! way as copying from a <tt>const string&amp;</tt> argument.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2079"></a>2079. Required <tt>pow()</tt> overloads</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2011-08-29 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! LWG issue <a href="lwg-defects.html#550">550</a> removed the functions:
! </p>
! <blockquote><pre>
! float       pow(float, int);
! double      pow(double, int);
! long double pow(long double, int);
! </pre></blockquote>
! <p>
! from header <tt>&lt;cmath&gt;</tt>. This change does not seem to be mentioned in Annex C, C.2.14.
! <p/>
! Howard:
! </p>
! <blockquote><p>
! N3290 26.8 [c.math]&#47;p11 says:
! </p><blockquote>
! <p>
! Moreover, there shall be additional overloads sufficient to ensure:
! </p>
! <ol>
! <li>If any argument corresponding to a <tt>double</tt> parameter has type <tt>long double</tt>, 
! then all arguments corresponding to <tt>double</tt> parameters are effectively cast to 
! <tt>long double</tt>.
! </li>
! <li>Otherwise, if any argument corresponding to a <tt>double</tt> parameter has type <tt>double</tt> 
! or an integer type, then all arguments corresponding to <tt>double</tt> parameters are effectively 
! cast to <tt>double</tt>.
! </li>
! <li>Otherwise, all arguments corresponding to <tt>double</tt> parameters are effectively cast to 
! <tt>float</tt>.
! </li>
! </ol>
! </blockquote>
! <p>
! From C99 7.12.7.4 we have:
! </p>
! <blockquote><pre>
! double pow(double, double);
! </pre></blockquote>
! <p>
! 26.8 [c.math]&#47;p11&#47;b2 says that if the client calls <tt>pow(2.0f, 2)</tt>, then the 
! <tt>int</tt> for second argument causes the following effective call to be made:
! </p>
! <blockquote><pre>
! pow(static_cast&lt;double&gt;(2.0f), static_cast&lt;double&gt;(2)) -&gt; double
! </pre></blockquote>
! <p>
! The first sentence of p11 implies that this is done by supplying the following additional overload:
! </p>
! <blockquote><pre>
! double pow(float, int);
! </pre></blockquote>
! <p>
! If the client calls <tt>pow(2.0, 2)</tt>, then the same reasoning (b2 again) implies the following 
! additional overload:
! </p>
! <blockquote><pre>
! double pow(double, int);
! </pre></blockquote>
! <p>
! If the client calls <tt>pow(2.0l, 2)</tt>, then b1 implies the following additional overload:
! </p>
! <blockquote><pre>
! long double pow(long double, int);
! </pre></blockquote>
! <p>
! In all, p11 implies hundreds (perhaps thousands?) of extra overloads.  All but one of which is a superset 
! of the overloads required by C++98&#47;03 (that one being <tt>pow(float, int)</tt> which had its return 
! type changed from <tt>float</tt> to <tt>double</tt>).
! <p/>
! In practice, at least some vendors implement p11 by using templated overloads as opposed to ordinary overloads.
! </p></blockquote>
! 
! <p>
! Steve Clamage:
! </p>
! <blockquote><p>
! Thanks. I didn't see that those extra overloads were actually implied by p11, despite the first sentence. 
! Without examples, the point is a bit subtle (at least for me).
! </p></blockquote>
! 
! <p><i>[2015-05-05 Lenexa: Move to NAD]</i></p>
! 
! <p>Billy: I believe this is NAD.</p>
! <p>STL: Oh, Steve himself agrees.</p>
! <p>Wakely: The issue marked as NAD will be sufficient.</p>
! <p>STL: Yes, we should get rid of this.</p>
! <p>Billy: I don't see any minutes from Issaquah.</p>
! <p>Marshall: Since Steve agrees, does anyone object to marking as NAD?</p>
! <p>Nope.</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2082"></a>2082. Misleading complexity requirements in <tt>&lt;algorithm&gt;</tt></h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2011-09-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#algorithms">active issues</a> in [algorithms].</p>
! <p><b>View all other</b> <a href="lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The <tt>partition_point()</tt> algorithm is specified with:
! </p>
! <blockquote><p>
! <i>Complexity</i>: <i>O(log(last - first))</i> applications of <tt>pred</tt>.
! </p></blockquote>
! <p>
! While this is correct, it gives the impression that this is a logarithmic algorithm.
! But unless random access iterators are used it is not logarithmic because for advancing 
! the iterator we have last-first steps, which means that the complexity becomes linear here.
! <p/>
! Shouldn't we clarify the complexity here to something like:
! </p>
! <blockquote><p>
! <i>Complexity</i>: logarithmic for random-access iterators and linear otherwise
!             (in any case <i>O(log(last - first)</i>) applications of <tt>pred</tt>).
! </p></blockquote>
! <p>
! Or should we even require <i>O(log(last - first)</i> for random-access iterators only because 
! for other iterators just iterating over all elements, while calling <tt>pred</tt> for each element, 
! might often be faster.
! </p>
! 
! <p>
! Daniel Kr&uuml;gler:
! </p>
! <blockquote><p>
! I agree that especially this description is a bit misleading. I'm not
! convinced that this is a real defect, because the whole bunch of
! templates within <tt>&lt;algorithm&gt;</tt> document the complexity solely of
! <em>applications*</em> of predicates, assignment, or swaps, but never the
! complexity of traversal operations (e.g. increment or iterator
! equality tests). This means, the standard is consistent for this
! function template, even though it could say a bit more.
! <p/>
! I would like to see a wording improvement, but I would rather think that
! the complexity of the predicate should be mentioned first (as in other
! algorithms) and that a non-normative note could be added for
! specifically this algorithm to point out that this does not imply
! a logarithmic traversal complexity. The note could give more details,
! by explicity pointing out the linear traversal complexity for
! non-random-Access iterators.
! </p></blockquote>
! <p>
! Howard Hinnant:
! </p>
! <blockquote><p>
! If we are going to make such improvements, they should be made across the 
! board in <tt>&lt;algorithm&gt;</tt>, not to just <tt>partition_point</tt>.  
! For example all 4 algorithms in 25.4.3 [alg.binary.search] have the 
! same issue, and have since C++98.
! <p/>
! <tt>stable_partition</tt> and <tt>inplace_merge</tt> should be inspected as well.
! <p/>
! Perhaps a new paragraph in 25.1 [algorithms.general], similar to 
! p12 would be a better place to address this issue.
! </p></blockquote>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to NAD.
! </p>
! <p>
! There was some concern that the issue, if it were to be addressed, is much larger than
! the couple of algorithms called out here, and applies across the whole library.  There
! is no interest in looking at this or similar issues without a paper addressing the whole
! library.  In fairness to anyone considering writing such a paper, it should be noted
! that there was not much interest in such a paper in the group, although no strong opposition
! either.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2084"></a>2084. <tt>basic_string</tt> use of <tt>charT*</tt></h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2011-09-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! For C++11 we gave all of the containers, including basic_string new generalized pointer types:
! </p>
! 
! <blockquote><pre>
! typedef typename allocator_traits&lt;Allocator&gt;::pointer       pointer:
! typedef typename allocator_traits&lt;Allocator&gt;::const_pointer const_pointer;
! </pre></blockquote>
! 
! <p>
! However, the constructors, assignment, and member functions still traffic exclusively in terms 
! of <tt>const charT*</tt>, for example:
! </p>
! 
! <blockquote><pre>
! basic_string(const charT* s, const Allocator&amp; a = Allocator());
! </pre></blockquote>
! 
! <p>
! Was this an oversight? Did we mean instead:
! </p>
! 
! <blockquote><pre>
! basic_string(const_pointer s, const Allocator&amp; a = Allocator());
! </pre></blockquote>
! 
! <p><b>Rationale:</b></p><p>
! It's intentional. <tt>char_traits</tt> assumes that all elements of
! a string can be accessed indirect on plain pointers. So <tt>basic_string</tt> 
! doesn't support allocators with fancy pointers or references. And we meant 
! to do that.
! <p/>
! Let's take the constructor example you called out:
! </p>
! 
! <blockquote><pre>
! basic_string(const charT* s, const Allocator&amp; a = Allocator());
! </pre></blockquote>
! 
! <p>
! This constructor allows us to create a <tt>basic_string</tt> object from a string literal.  
! If we were to change the pointer type, that would no longer be possible.
! <p/>
! There is no issue here, as the implementation of the constructor must make a 
! copy of the string pointed-to by the pointer 's' rather than adopt ownership of 
! that buffer. It is that internal copy that must make use of the <tt>allocator::pointer</tt> type.
! <p/>
! Now what about the return value of '<tt>c_str()</tt>', should that return an <tt>allocator::pointer</tt>?
! <p/>
! Again, the answer (I believe) is 'no' because this is the function that allows us 
! to pass the string's contents to a legacy&#47;OS 'C' API. It is deliberately returning 
! a raw pointer for a reason.
! <p/>
! There was an issue where <tt>vector::data</tt> was changed to return an <tt>allocator::pointer</tt>
! to the internal buffer, and this was changed back exactly because this was intended 
! to support passing to external APIs.
! <p/>
! Do we have a use-case where the pointer type of internal data structures of our 
! containers (notably <tt>basic_string</tt> and <tt>vector</tt>) need to be exposed through a public API?  
! All my current use-cases for <tt>allocator::pointer</tt> are specific to the implementation 
! of containers themselves.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2090"></a>2090. Minor Overconstraint in Mutex Types</h3>
! <p><b>Section:</b> 30.4.1.2 [thread.mutex.requirements.mutex] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2011-10-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements.mutex">issues</a> in [thread.mutex.requirements.mutex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 30.4.1.2 [thread.mutex.requirements.mutex]&#47;6, fourth bullet requires the 
! return type of <tt>m.lock()</tt> to be <tt>void</tt>. 
! <p/>
! This is over-constrained. The true requirement is that the standard library 
! ignores any value that the function returns. Yes, allowing non-void return 
! types means that users can't store a pointer to this member function. No, 
! that's not the least bit important.
! <p/>
! [See also the discussion following c++std-lib-31318]
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! This does not specify a concept; it specifies requirements on the concrete mutex types. 
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2107"></a>2107. Some iterator category should guarantee the lifetime of references</h3>
! <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2011-11-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Many iterators guarantee that references and pointers returned from
! their methods will outlive the iterator itself. Other useful iterators
! can't guarantee this, leading to the rule in 24.2 [iterator.requirements] 
! p9 that "Destruction of an iterator may invalidate pointers and references 
! previously obtained from that iterator."
! <p/>
! Some algorithms can take advantage of long-lived references by
! returning them, while they can adapt to short-lived references by
! returning by value instead. However, there doesn't seem to be a way in
! the standard to distinguish between these two types of iterators.
! <p/>
! The <tt>ForwardIterator</tt> requirements come close by saying "If <tt>a</tt> and <tt>b</tt> are
! both dereferenceable, then <tt>a == b</tt> if and only if <tt>*a</tt> and <tt>*b</tt> are bound
! to the same object." (24.2.5 [forward.iterators] p6) However, there are some
! subtle ways to satisfy this rule and still return a short-lived reference, meaning 
! algorithms can't be guaranteed that <tt>forward_iterator_tag</tt> will imply 
! long-lived references.
! <p/>
! On the other hand, defect <a href="lwg-defects.html#198">198</a>, which added the invalidation wording
! to iterator.requirements.general, refers to iterators with short-lived references 
! being used as arguments to reverse_iterator, which requires <tt>BidirectionalIterator</tt>s. 
! If <tt>ForwardIterator</tt> required long-lived references, this would be impossible.
! <p/>
! Either <tt>ForwardIterator</tt> should be clarified to require long-lived
! references, or a new category should be added that does.
! <p/>
! See also the discussion around c++std-lib-31477.
! <p/>
! Daniel: Related to this issue is that when applying <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>
! we unintentionally lost some forward iterator requirements from C++03, where we 
! had the post-conditions <tt>a == X(a)</tt> of <tt>X(a)</tt>, and <tt>u == a</tt> 
! of any copy operation from <tt>a</tt> to <tt>u</tt>. This wording must be restored as well.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to NAD.
! </p>
! <p>
! This issue affects only Input Iterators, as all other categories are required to return
! a native reference, and are not (currently) allowed to return proxies.  The issue with
! Input Iterators is known, and has been present since the original standard.  Any change
! in this regard would be an extension requiring a more substantial paper than treatment
! as a simple issue.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2113"></a>2113. Do library implementers have the freedom to add <tt>final</tt> to non-polymorphic components?</h3>
! <p><b>Section:</b> 17.6.5 [conforming] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-11-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#conforming">issues</a> in [conforming].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Related to LWG <a href="lwg-defects.html#2112">2112</a> the question has been raised whether a library implementation <em>may</em> declare
! non-polymorphic library components, such as class template <tt>std::vector</tt> or <tt>std::basic_string</tt>,
! as <tt>final</tt> class types.
! <p/>
! This issue is <em>not</em> suggesting to enforce that libraries are required to do that, it is asking
! whether libraries should have the freedom to do so.
! <p/>
! The existing wording in 17.6.5.11 [derivation] does not give a clear permission to do so. In my opinion
! this position should be clarified in either direction.
! <p/>
! Giving implementations this freedom would have both advantages and disadvantages. Several opponents where
! worried about breakage of code of existing user implementations. On the other hand such types where not
! designed to be used as base classes. Allowing implementations to mark these components as <tt>final</tt>
! could allow them to provide compile-modes that are intentionally restrictive to the advantage of user code
! that want to be alterted about that. Any implementation that would be concerned about user complaints would 
! not take advantage of this feature anyway.
! <p/>
! If agreement exists that such implementation freedom would be useful, wording like
! </p>
! <blockquote><p>
! An implementation may declare additional non-virtual member function signatures within a class as <tt>final</tt>.
! </p></blockquote>
! <p>
! or
! </p>
! <blockquote><p>
! An implementation may declare additional class without virtual member function signatures as <tt>final</tt>.
! </p></blockquote>
! <p>
! should be added to 17.6.5 [conforming] with corresponding exceptions of these rules (e.g. <tt>iterator</tt>,
! <tt>unary_function</tt>, or <tt>pair</tt>).
! <p/>
! If such freedom should not exist, it seems better to clarify this as well, e.g. by adding around 17.6.5.11 [derivation]:
! </p>
! <blockquote><p>
! An implementation shall not declare any class or any member function signature as <tt>final</tt>.
! </p></blockquote>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to NAD.
! </p>
! <p>
! Unless the library uses the keyword <tt>final</tt> in a specification, the user clearly has
! freedom to derive from such a class, and so equally clearly, the library vendor does not have
! freedom to add a <tt>final</tt> overrider or class attribute.  Howard observed there may be
! some wiggle-room with 'unspecified types' such as those returned from <tt>bind</tt> expressions,
! or iterators, but we did not see a need to further clarify the issue.  Note that, for example,
! a <tt>vector::iterator</tt> may be implemented as a raw pointer, so users cannot generally
! assume the ability to derive from unspecified library types.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2124"></a>2124. Seed sequence over-specified</h3>
! <p><b>Section:</b> 26.5.1.2 [rand.req.seedseq] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2012-01-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req.seedseq">issues</a> in [rand.req.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The seed sequence requirements described in 26.5.1.2 [rand.req.seedseq] appear to be over-specified. 
! All seed sequence types are required to have a <tt>result_type</tt> nested type, a specific set of 
! constructors, function members <tt>size()</tt> and <tt>param()</tt>, which are never used by the library. 
! In fact, the only library components that actively use seed sequences are the random engines and all the 
! engines need is the <tt>generate()</tt> member function. In particular, library components never attempts 
! to construct seed sequence objects. These extraneous requirements are clearly written to describe the 
! library provided type <tt>seed_seq</tt> type; while it's good that seed_seq has all those constructors and 
! members, it's not a compelling reason to require a user-provided seed sequence type to implement all of 
! them.
! <p/>
! Suppose I want to write my own seed sequence class, this should do fine (and actually works as expected with libc++):
! </p>
! <blockquote><pre>
! class my_seed_seq
! {
!   /* internals */
! public:
!   my_seed_seq(/* my own parameters */);
! 
!   template &lt;class It&gt;
!   void generate(It first, It last);
! };
! 
! my_seed_seq s(/* params */);
! std::default_random_engine e(s);
! </pre></blockquote>
! <p>
! The only reason to have these extra members would be to provide some support for generic serializability&#47;persistence 
! of seed sequence objects. I believe that would be out of the scope of the random library, so I doubt we will ever need 
! those requirements in the future.
! <p/>
! I therefore propose to remove all requirements from 26.5.1.2 [rand.req.seedseq] except for the presence of the 
! <tt>generate()</tt> function.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Tenatively NAD.  (Tentative as issue was not in pre-meeting mailing)
! </p>
! <p>
! The 'overspecification', as such, was a deliberate intent to provide guarantees consumers of the whole
! random number framework may rely upon, especially in generic code.  While the standard engines may be
! built without relying on these guarantees, this specification is part of a commitment to a broader
! framework, and Walter indicated future proposals in preparation for parallel generation of random
! numbers that may depend more inimately on these existing requirements.
! </p>
! <p>
! Alisdair noted that the <tt>result_type</tt> typedef was a call-back to how we used to specify
! adaptable functors before TR1 <tt>result_of</tt> and the addition of <tt>std::bind</tt> and is
! probably not something we should be actively promoting in future libraries.  However, it is too
! late to remove this requirement from seed sequences unless we are doing further surgery, as
! recommended by this issue.
! </p>
! <p>
! Walter notes that the <tt>result_type</tt> protocol has not been formally deprecated by the
! standard.  Alisdair replies that was the intent of deprecating the <tt>bind_1st</tt>/
! <tt>unary_function</tt> set of templates in C++11, although we did not say anything about
! <tt>result_type</tt> in general.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li>
! <p>Edit 26.5.1.2 [rand.req.seedseq] p2 as indicated:</p>
! 
! <blockquote><p>
! A class <tt>S</tt> satisfies the requirements of a seed sequence if the expressions shown in Table 115 are valid and
! have the indicated semantics, and if <tt>S</tt> also satisfies all other requirements of this section 26.5.1.2 [rand.req.seedseq]. 
! In that Table and throughout this section:
! </p>
! <ol style="list-style-type:lower-alpha">
! <li>
! <del><tt>T</tt> is the type named by <tt>S</tt>'s associated <tt>result_type</tt>;</del>
! </li>
! <li>
! <tt>q</tt> is a value of <tt>S</tt><del> and <tt>r</tt> is a possibly const value of <tt>S</tt></del>; <ins>and</ins>
! </li>
! <li>
! <del><tt>ib</tt> and <tt>ie</tt> are input iterators with an unsigned integer <tt>value_type</tt> of at least 32 bits;</del>
! </li>
! <li><tt>rb</tt> and <tt>re</tt> are mutable random access iterators with an unsigned integer <tt>value_type</tt> of at least 32 bits;</li>
! <li>
! <del><tt>ob</tt> is an output iterator; and</del>
! </li>
! <li>
! <del><tt>il</tt> is a value of <tt>initializer_list&lt;T&gt;</tt>.</del>
! </li>
! </ol>
! </blockquote>
! </li>
! 
! <li>
! <p>Ditto, in Table 115, remove all rows except the one describing <tt>q.generate(rb, re)</tt>:</p>
! 
! <table border="1">
! <caption>Table 115 &mdash; Seed sequence requirements</caption>
! <tr align="center">
! <th>Expression</th>
! <th>Return type</th>
! <th>Pre&#47;Post-condition</th>
! <th>Complexity</th>
! </tr> 
! 
! <tr>
! <td>
! <del><tt>S::result_type</tt></del>
! </td>
! <td>
! <del><tt>T</tt></del>
! </td>
! <td>
! <del><tt>T</tt> is an unsigned integer<br/>
! type (3.9.1 [basic.fundamental]) of at least 32 bits.</del>
! </td>
! <td>
! <del>compile-time</del>
! </td>
! </tr>
! 
! <tr>
! <td>
! <del><tt>S()</tt></del>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! <del>Creates a seed sequence with<br/>
! the same initial state as all<br/>
! other default-constructed seed<br/>
! sequences of type <tt>S</tt>.</del>
! </td>
! <td>
! <del>constant</del>
! </td>
! </tr>
! 
! <tr>
! <td>
! <del><tt>S(ib,ie)</tt></del>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! <del>Creates a seed sequence having<br/>
! internal state that depends on<br/>
! some or all of the bits of the<br/>
! supplied sequence <tt>[ib, ie)</tt>.</del>
! </td>
! <td>
! <del><tt>&#x1d4aa;(ie - ib)</tt></del>
! </td>
! </tr>
! 
! <tr>
! <td>
! <del><tt>S(il)</tt></del>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! <del>Same as <tt>S(il.begin(),<br/>
! il.end())</tt>.</del>
! </td>
! <td>
! <del>same as<br/>
! <tt>S(il.begin(),<br/>
! il.end())</tt></del>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>q.generate(rb,re)</tt>
! </td>
! <td>
! <tt>void</tt>
! </td>
! <td>
! Does nothing if <tt>rb == re</tt>.<br/>
! Otherwise, fills the supplied<br/>
! sequence <tt>[rb, re)</tt> with 32-bit<br/>
! quantities that depend on the<br/>
! sequence supplied to the<br/>
! constructor and possibly also<br/>
! depend on the history of<br/>
! <tt>generate</tt>'s previous<br/>
! invocations.
! </td>
! <td>
! <tt>&#x1d4aa;(re - rb)</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <del><tt>r.size()</tt></del>
! </td>
! <td>
! <del><tt>size_t</tt></del>
! </td>
! <td>
! <del>The number of 32-bit units that<br/>
! would be copied by a call to<br/>
! <tt>r.param</tt>.</del>
! </td>
! <td>
! <del>constant</del>
! </td>
! </tr>
! 
! <tr>
! <td>
! <del><tt>r.param(ob)</tt></del>
! </td>
! <td>
! <del><tt>void</tt></del>
! </td>
! <td>
! <del>Copies to the given destination
! a sequence of 32-bit units that<br/>
! can be provided to the<br/>
! constructor of a second object<br/>
! of type <tt>S</tt>, and that would<br/>
! reproduce in that second object<br/>
! a state indistinguishable from<br/>
! the state of the first object.</del>
! </td>
! <td>
! <del><tt>&#x1d4aa;(r.size())</tt></del>
! </td>
! </tr>
! 
! </table>
!  </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2125"></a>2125. <tt>TimedMutex</tt> specification problem</h3>
! <p><b>Section:</b> 30.4.1.3 [thread.timedmutex.requirements], 30.4.1.3.1 [thread.timedmutex.class] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">Pending NAD Editorial</a>
!  <b>Submitter:</b> Vicente J. Botet Escriba <b>Opened:</b> 2012-01-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.timedmutex.requirements">issues</a> in [thread.timedmutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Pending NAD Editorial">Pending NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 30.4.1.3.1 [thread.timedmutex.class] says:
! </p>
! <blockquote><p>
! The class <tt>timed_mutex</tt> shall satisfy all of the <tt>TimedMutex</tt> requirements (30.4.1.3 [thread.timedmutex.requirements]). 
! It shall be a standardlayout class (Clause 9 [class]).
! </p></blockquote>
! <p>
! Problem here is that 30.4.1.3 [thread.timedmutex.requirements] does not define a requirement set named &quot;<tt>TimedMutex</tt>&quot;,
! it only refers to &quot;<i>timed mutex types</i>&quot;
! </p>
! 
! <p><i>[See also issue <a href="lwg-closed.html#2126">2126</a>]</i></p>
! 
! 
! <p><i>[2012, Portland: move to Tentatively NAD Editorial]</i></p>
! 
! <p>
! We have timed mutex type, but it is labeled timed mutex requirements
! </p>
! <p>
! We can make a suggestion, but will send to the editor as it seems purely editorial.
! There is a typo, and we don't have the timed mutex but 30.4.1.3 [thread.timedmutex.requirements] already
! says timed mutex type, and we need to reuse that term down in the class to fulfil the mutex requirement.
! </p>
! <p><i>[To Editor:]</i></p>
! 
! <p>
! Replace this one with timed mutex type.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2126"></a>2126. Several specification problems in regard to mutex requirements</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements], 30.4.1.2.1 [thread.mutex.class], 30.4.1.2 [thread.mutex.requirements.mutex], 30.4.1.2.2 [thread.mutex.recursive], 30.4.1.3 [thread.timedmutex.requirements], 30.4.1.3.1 [thread.timedmutex.class], 30.4.1.3.2 [thread.timedmutex.recursive] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">Pending NAD Editorial</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-01-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Pending NAD Editorial">Pending NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
!  30.4.1.2.1 [thread.mutex.class]&#47;3 says that the class mutex "shall satisfy all the <tt>Mutex</tt> requirements (30.4.1 [thread.mutex.requirements])". 
!  30.4.1.2.1 [thread.mutex.class] is part of 30.4.1 [thread.mutex.requirements], so at the very least, this 
!  requirement is recursive. But worse, there is nothing that says what "the <tt>Mutex</tt> requirements" refers to. For example, 
!  the "<tt>Lockable</tt> requirements" section starts with "A type <tt>L</tt> meets the <tt>Lockable</tt> requirements if &hellip;". There is no such 
!  statement for "the <tt>Mutex</tt> requirements".
! <p/>
! Organizationally, paragraphs 1-26 in 30.4.1.2 [thread.mutex.requirements.mutex] should probably be in a subclause with a name. 
! (This is actually an ISO requirement, to avoid exactly this kind of ambiguous referencing) Then the first sentence of 
! 30.4.1.2.1 [thread.mutex.class]&#47;3 can become a note: "The class mutex meets the requirements of (whatever)", since that 
! subclause already says that the mutex types "shall meet the requirements set out in this section."
! <p/>
! And similarly for 30.4.1.2.2 [thread.mutex.recursive]&#47;2 (<tt>recursive_mutex</tt>).
! <p/>
! 30.4.1.3 [thread.timedmutex.requirements], Timed mutex types, also needs the same rearrangement: its introductory 
! requirements should be moved into a subclause, and the first sentences of 30.4.1.3.1 [thread.timedmutex.class]&#47;2 
! and 30.4.1.3.2 [thread.timedmutex.recursive]&#47;2 should be turned into notes that refer to this new subclause and 
! to the new subclause in 30.4.1.2 [thread.mutex.requirements.mutex].
! </p>
! 
! <p><i>[See also issue <a href="lwg-closed.html#2125">2125</a>]</i></p>
! 
! 
! <p><i>[2012, Portland: move to Tentatively NAD Editorial]</i></p>
! 
! <p>
! Seems no real ambiguity. May need some reorg of text rather then changing the wording.
! </p>
! <p>
! Is there much that needs to be changed? But Pete's suggestion of putting requirement in separate sub section is good.
! Should be the direction to editor.
! </p>
! <p>
! Suggest this is an editorial change. Happy with Pete's comments.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2131"></a>2131. Member function getline taking a string as parameter</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Lo&iuml;c Joly <b>Opened:</b> 2012-03-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I think the following code should be legal:
! </p>
! <blockquote><pre>
! void f(std::istream&amp; is)
! {
!   std::string s;
!   is.getline(s); // Would be equivalent to std::getline(is, s)
! }
! </pre></blockquote>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! 
! <p>
! Unanimous that this is a new feature request and not a issue. 
! <p/>
! Resolution: Tentatively NAD 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change the class template <tt>basic_istream</tt> synopsis, 27.7.2.1 [istream], as indicated</p>
! <blockquote><pre>
! namespace std {
!   template &lt;class charT, class traits = char_traits&lt;charT&gt; &gt;
!   class basic_istream : virtual public basic_ios&lt;charT,traits&gt; {
!   public:
!     [&hellip;]
!     <i>// 27.7.2.3 Unformatted input:</i>
!     [&hellip;]
!     basic_istream&lt;charT,traits&gt;&amp; getline(char_type* s, streamsize n);
!     basic_istream&lt;charT,traits&gt;&amp; getline(char_type* s, streamsize n,
!       char_type delim);
!     <ins>template&lt;class Allocator&gt;
!     basic_istream&lt;charT,traits&gt;&amp; getline(basic_string&lt;charT,traits,Allocator&gt;&amp; str);
!     template&lt;class Allocator&gt;
!     basic_istream&lt;charT,traits&gt;&amp; getline(basic_string&lt;charT,traits,Allocator&gt;&amp; str,
!       char_type delim);</ins>
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Insert the following two new prototype descriptions after 27.7.2.3 [istream.unformatted] paragraph 24:</p>
! 
! <blockquote>
! <pre>
! basic_istream&lt;charT,traits&gt;&amp; getline(char_type* s, streamsize n);
! </pre>
! <blockquote><p>
! -24- <i>Returns</i>: <tt>getline(s,n,widen('\n'))</tt>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template&lt;class Allocator&gt;
! basic_istream&lt;charT,traits&gt;&amp; getline(basic_string&lt;charT,traits,Allocator&gt;&amp; str);</ins>
! </pre>
! <blockquote><p>
! <ins>-??- <i>Returns</i>: <tt>std::getline(*this, str)</tt></ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template&lt;class Allocator&gt;
! basic_istream&lt;charT,traits&gt;&amp; getline(basic_string&lt;charT,traits,Allocator&gt;&amp; str, char_type delim);</ins>
! </pre>
! <blockquote><p>
! <ins>-??- <i>Returns</i>: <tt>std::getline(*this, str, delim)</tt></ins>
! </p>
! </blockquote>
! 
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2134"></a>2134. Redundant Mutex requirement?</h3>
! <p><b>Section:</b> 30.4.1.2 [thread.mutex.requirements.mutex] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">Pending NAD Editorial</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-03-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements.mutex">issues</a> in [thread.mutex.requirements.mutex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Pending NAD Editorial">Pending NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 30.4.1.2 [thread.mutex.requirements.mutex]&#47;11 says that prior unlock operations <em>synchronize with</em> <tt>m.lock()</tt>.
! <p/>
! 30.4.1.2 [thread.mutex.requirements.mutex]&#47;19 says that if <tt>m.try_lock()</tt> succeeds, prior unlock operations 
! <em>synchronize with</em> the operation. 
! <p/>
! 30.4.1.2 [thread.mutex.requirements.mutex]&#47;25 says that <tt>m.unlock()</tt> <em>synchronizes with</em> subsequent 
! successful lock operations. 
! <p/>
! Does the third requirement add anything to the first two? If not, it should probably be a non-normative note.
! </p>
! 
! <p><i>[2012, Portland: move to Tentatively NAD Editorial]</i></p>
! 
! <p>
! Agree that third note should be non-normative and adds nothing.
! </p>
! <p>
! Seems An Editorial change, but does changing a normative to non-normative wording makes it a non-editorial change?
! </p>
! <p>
! Ask the editor. If not editorial, then we will agree on the fix as removal of the third point,
! then we will put it in ready state for Bristol.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2167"></a>2167. Copy assignment requirements of Containers</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Dean Michael Berris <b>Opened:</b> 2012-07-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Table 96 defines the general requirement for copy assignment (row 23, page 704) as:
! </p>
! 
! <table border="1">
! <caption>Table 96 &mdash; Container requirements</caption>
! 
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational semantics</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Complexity</th>
! </tr> 
! 
! <tr>
! <td>
! <tt>r = a</tt>
! </td>
! <td>
! <tt>X&amp;</tt>
! </td>
! <td>
! <tt></tt>
! </td>
! <td>
! post: <tt>r == a.</tt>
! </td>
! <td>
! linear
! </td>
! </tr>
! 
! </table>
! 
! <p>
! However there is no requirement that <tt>T</tt> is <tt>CopyInsertable</tt> into <tt>X</tt>.
! </p>
! 
! <p><i>[2012, Portland: Move to Tentatively NAD]</i></p>
! 
! <p>
! Howard notes that this may be a difficult requirement for <tt>std::array</tt>
! </p>
! 
! <p>
! We already have this requirement for allocator aware containers, and
! <tt>std::array</tt> already adds the appropriate extra requirement.
! </p>
! 
! <p>
! We say the necessary things in the necessary places, but the container requirements
! continue to cause confusion in where we sometimes say things.  Consensus is that
! this issue remains NAD though.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change Table 96 &mdash; "Container requirements" in 23.2.1 [container.requirements.general]:</p>
! 
! <table border="1">
! <caption>Table 96 &mdash; Container requirements</caption>
! 
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational semantics</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Complexity</th>
! </tr> 
! 
! <tr>
! <td>
! <tt>r = a</tt>
! </td>
! <td>
! <tt>X&amp;</tt>
! </td>
! <td>
! <tt></tt>
! </td>
! <td>
! <ins><i>Requires</i>: <tt>T</tt> is <tt>CopyInsertable</tt> into <tt>X</tt>.</ins><br/>
! post: <tt>r == a.</tt>
! </td>
! <td>
! linear
! </td>
! </tr>
! 
! </table>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2171"></a>2171. "swappable" undefined for swapping lvalue and rvalue</h3>
! <p><b>Section:</b> 17.6.3.2 [swappable.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Robert Shearer <b>Opened:</b> 2012-07-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#swappable.requirements">issues</a> in [swappable.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Paragraph 17.6.3.2 [swappable.requirements] p4 states:
! </p>
! <blockquote><p>
! An rvalue or lvalue <tt>t</tt> is <em>swappable</em> if and only if <tt>t</tt> is swappable with any rvalue or lvalue, 
! respectively, of type <tt>T</tt>.
! </p></blockquote>
! <p>
! This paragraph seems to establish two disjoint definitions of "swappable" &mdash; one for lvalues and one 
! for rvalues &mdash; with neither definition including the case of swapping an rvalue with an lvalue.
! <p/>
! Resolution proposal:
! <p/>
! Delete the word "respectively".
! </p>
! 
! <p><i>[
! 2012-10 Portland: Close as NAD
! ]</i></p>
! 
! 
! <p>
! The current wording does intentionally specify two families of 'swappable' behaviors, for lvalues
! and for rvalues, and not for mixed behavior.  The need to support rvalues is for types like
! <tt>vector&lt;bool>::reference</tt>.  Likewise, library types like <tt>string</tt> provide a
! <tt>swap</tt> for values, but not a mixed-mode <tt>swap</tt> between lvalues and rvalues, which
! were deliberately removed from C++11 after initally being part of the standard.
! </p>
! 
! <p>
! Accepting this resolution would break the library specification, as no current library type would
! meet the new requirements.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <p>Change 17.6.3.2 [swappable.requirements] p4 as indicated:</p>
! 
! <blockquote><p>
! An rvalue or lvalue <tt>t</tt> is <em>swappable</em> if and only if <tt>t</tt> is swappable with any rvalue or 
! lvalue <del>, respectively,</del> of type <tt>T</tt>.
! </p></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2204"></a>2204. <tt>reverse_iterator</tt> should not require a second copy of the base iterator</h3>
! <p><b>Section:</b> 24.5.1.3.4 [reverse.iter.op.star] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> David Abrahams <b>Opened:</b> 2012-10-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! This note in 24.5.1.3.4 [reverse.iter.op.star]/2:
! </p>
! <blockquote>
!  [ <i>Note</i>: This operation must use an auxiliary member variable rather than a
!  temporary variable to avoid returning a reference that persists beyond the
!  lifetime of its associated iterator. (See 24.2.) &mdash;<i>end note</i> ]
! </blockquote>
! <p>
! is incorrect because such iterator implementations are ruled out by
! 24.2.5 [forward.iterators]/6, where it says:
! </p>
! <blockquote>
!  If <tt>a</tt> and <tt>b</tt> are both dereferenceable, then <tt>a == b</tt> if and only if <tt>*a</tt> and
!  <tt>*b</tt> are bound to the same object.
! </blockquote>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! 
! <p>
! Alisdair: sugested to strike the "exposition only" member.
! <p/>
! Daniel: we must check that it wouldn't conflict with a previous solution to another issue.
! <p/>
! Dietmar: This is an issue but the proposing word is not correct. When we have proxies inside the sequence.
! <p/>
! Solution: NAD thanks to a contrieved example by Dietmar. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Strike the note, 24.5.1.3.4 [reverse.iter.op.star]/2:
! </p>
! 
! <blockquote>
!  <del>[ <i>Note</i>: This operation must use an auxiliary member variable rather than a
!  temporary variable to avoid returning a reference that persists beyond the
!  lifetime of its associated iterator. (See 24.2.) &mdash;<i>end note</i> ]</del>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2251"></a>2251. C++ library should define <tt>ssize_t</tt></h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2013-04-19 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The C++ standard library defines <tt>size_t</tt>, a typedef for an implementation defined unsigned integer type 
! that can represent the sizes of objects. The POSIX standard augments this with <tt>ssize_t</tt>, a typedef for a 
! signed integer type that corresponds to <tt>size_t</tt>.
! <p/>
! The <tt>ssize_t</tt> typedef is useful &mdash; useful enough that the C++ standard even refers to it. (In a 
! non-normative footnote in 27.5.2 [stream.types].)  Also, lots of OS vendors add it to their headers anyway, 
! even though it isn't part of the C or C++ standards, because those vendors are trying to define headers that 
! conform to multiple standards at once. We should make users' and implementers' lives easier by adding 
! <tt>ssize_t</tt> to 18.2 [support.types].
! </p>
! 
! <p><i>[2013-09-29, Suggested wording from Jayson Oldfather]</i></p>
! 
! <p> 
! I decided to use the phrase to describe <tt>ssize_t</tt> below because of the text describing it in the 
! <a href="http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/sys_types.h.html#tag_13_67">POSIX</a> standard. 
! In it, it describes <tt>ssize_t</tt> with the value range of <tt>[-1,{SSIZE_MAX}]</tt>.
! <tt>SSIZE_MAX</tt> is specified in the <a href="http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/limits.h.html#tag_13_24">POSIX</a> 
! standard as a minimum value of <tt>_POSIX_SSIZE_MAX</tt>. This macro is referenced in the wording below.
! </p>
! 
! <p><i>[Lenexa 2015-05-05: NAD - no consensus for a change]</i></p>
! 
! <p>Billy : ssize_t that was promised to be signed, was based on rsize_t from safe secure C</p>
! <p>NM : ssize_t s ptrdif_t</p>
! <p>Z : ptrdiff_t is full range, ssize_t has only -1 as negative value</p>
! <p>Billy : motivations for ptrdiff_T, ssize_t and rsize_T all fuzzy. - Reads rsize max -</p>
! <p>NM : ptrdiff_T not big enough to rep difference of pointers anymore</p>
! <p>STL : description incorporates posixisms</p>
! <p>Billy : Don't need it</p>
! <p>NM : rather remove it from footnote</p>
! <p>Z : Name has precise meaning</p>
! <p>STL : everyone understands ptrdiff_t is signed counterpart to size_t</p>
! <p>Billy : Not in all implementations anymore</p>
! <p>DK : footnote says something different from ...</p>
! <p>Z/NM : off_t historically tainted</p>
! <p>STL : we have a type trait to make signed version of size_t. we should just use that</p>
! <p>MC : NAD; is feature request</p>
! <p>TP : It's not cstdsef</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>
! Ammend 18.2 [support.types], Table 30 as indicated:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 30 &mdash; Header <tt>&lt;cstddef&gt;</tt> synopsis</caption>
! <tr>
! <th>Type</th>
! <th>Name(s)</th>
! </tr>
! 
! <tr>
! <td>
! <b>Macros:</b>
! </td>
! <td>
! <tt>NULL offset_t</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <b>Types:</b>
! </td>
! <td>
! <tt>ptrdiff_t <ins>ssize_t</ins> size_t max_align_t nullptr_t</tt>
! </td>
! </tr>
! </table>
! </blockquote>
! 
! <p>Add the following paragraph to describe <tt>ssize_t</tt></p>
! <blockquote><p><ins>
! -?- The type <tt>ssize_t</tt> is an implementation-defined signed integer type that shall contain the minimum range 
! <tt>[-1, {SSIZE_MAX}]</tt> where <tt>SSIZE_MAX</tt> is specified at a minimum of <tt>_POSIX_SSIZE_MAX</tt>.</ins>
! </p></blockquote>
! <p>Ammend p7 as follows:</p>
! <blockquote><p>
! -7- [<i>Note:</i> It is recommended that implementations choose types for <tt>ptrdiff_t<ins>, ssize_t,</ins></tt> and <tt>size_t</tt> whose integer conversion ranks &hellip;</p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2270"></a>2270. Inconsistent <tt>to_string</tt> overloads</h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Raf Schietekat <b>Opened:</b> 2013-07-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! For internal consistency, <tt>to_string()</tt> should either list all relevant types (including <tt>bool</tt>, <tt>char</tt>, etc.), 
! or only those that are the destination types of integral or floating-point promotion (<tt>float</tt> not being among them).
! <p/>
! A defensible reason for having (or rather keeping) the <tt>float</tt> overloads anyway could be to exactly mirror the adjacent 
! sets of <tt>stoX()</tt> function overloads (even without round-trip fidelity for floating-point numbers).
! <p/>
! Unfortunately, that reveals a bigger issue than redundant overloads: the glaring and indefensible omission of an overloaded 
! function <tt>stoui()</tt>. Adding that is not as trivial as removing redundant overloads, of course, because it requires 
! everybody to take action. Still, it is the preferable remedy for the present situation.
! <p/>
! As far as I can tell from easily accessible information, C++ has already created the precedent with <tt>stoi()</tt>, which 
! is not the equivalent of a pair of functions <tt>strtoi()</tt>/<tt>wcstoi()</tt> in C, but it would be if such functions 
! existed. The function <tt>atoi()</tt> may look similar, but it does not qualify because it is as different from a 
! hypothetical <tt>strtoi()</tt> as <tt>atol()</tt> currently is from <tt>strtol()</tt>, with the latter two both Standard C. 
! It is only logical to act on this one-sided precedent by completing the set. Whether or not Standard C leads the way 
! (or follows suit) is immaterial, but an invitation could be extended.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! These overloads were very carefully and experimentally determined to be the minimal set, when all (known) promotion and
! conversion scenarios were considered.  Removing superfluous-looking overloads is likely to result in ambiguities.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Modify 21.3 [string.classes], header <tt>&lt;string&gt;</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! #include &lt;initializer_list&gt;
! 
! namespace std {
!   [&hellip;]
!   string to_string(int val);
!   string to_string(unsigned val);
!   string to_string(long val);
!   string to_string(unsigned long val);
!   string to_string(long long val);
!   string to_string(unsigned long long val);
!   <del>string to_string(float val);</del>
!   string to_string(double val);
!   string to_string(long double val);
!   [&hellip;]
! 
!   [&hellip;]
!   wstring to_wstring(int val);
!   wstring to_wstring(unsigned val);
!   wstring to_wstring(long val);
!   wstring to_wstring(unsigned long val);
!   wstring to_wstring(long long val);
!   wstring to_wstring(unsigned long long val);
!   <del>wstring to_wstring(float val);</del>
!   wstring to_wstring(double val);
!   wstring to_wstring(long double val);
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Modify 21.5 [string.conversions] p7+14 as indicated:</p>
! 
! <blockquote>
! <pre>
! string to_string(int val);
! string to_string(unsigned val);
! string to_string(long val);
! string to_string(unsigned long val);
! string to_string(long long val);
! string to_string(unsigned long long val);
! <del>string to_string(float val);</del>
! string to_string(double val);
! string to_string(long double val);
! </pre>
! <blockquote>
! <p>
! -7- <i>Returns:</i> Each function returns a <tt>string</tt> object holding the character representation of the value of
! its argument that would be generated by calling <tt>sprintf(buf, fmt, val)</tt> with a format specifier of
! <tt>"%d"</tt>, <tt>"%u"</tt>, <tt>"%ld"</tt>, <tt>"%lu"</tt>, <tt>"%lld"</tt>, <tt>"%llu"</tt>, <del><tt>"%f"</tt>,</del> 
! <tt>"%f"</tt>, or <tt>"%Lf"</tt>, respectively, where <tt>buf</tt> designates an internal character buffer of sufficient size.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! wstring to_wstring(int val);
! wstring to_wstring(unsigned val);
! wstring to_wstring(long val);
! wstring to_wstring(unsigned long val);
! wstring to_wstring(long long val);
! wstring to_wstring(unsigned long long val);
! <del>wstring to_wstring(float val);</del>
! wstring to_wstring(double val);
! wstring to_wstring(long double val);
! </pre>
! <blockquote>
! <p>
! -14- <i>Returns:</i> Each function returns a <tt>wstring</tt> object holding the character representation of the value of
! its argument that would be generated by calling <tt>swprintf(buf, buffsz, fmt, val)</tt> with a format specifier of
! <tt>L"%d"</tt>, <tt>L"%u"</tt>, <tt>L"%ld"</tt>, <tt>L"%lu"</tt>, <tt>L"%lld"</tt>, <tt>L"%llu"</tt>, <del><tt>L"%f"</tt>,</del> 
! <tt>L"%f"</tt>, or <tt>L"%Lf"</tt>, respectively, where <tt>buf</tt> designates an internal character buffer of sufficient 
! size <tt>buffsz</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2279"></a>2279. Carefully state effects of <tt>list::splice</tt> function</h3>
! <p><b>Section:</b> 23.3.5.5 [list.ops], 23.3.4.6 [forwardlist.ops] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Arseny Klimovsky <b>Opened:</b> 2013-08-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I think that the effects of <tt>list::splice</tt> function should be stated more carefully.
! <p/>
! Function transferring a single element is described now in the following way (23.3.5.5 [list.ops] p7):
! </p>
! 
! <blockquote>
! <pre>
! void splice(const_iterator position, list&amp; x, const_iterator i);
! void splice(const_iterator position, list&amp;&amp; x, const_iterator i);
! </pre>
! <blockquote>
! <p>
! <i>Effects:</i> Inserts an element pointed to by <tt>i</tt> from list <tt>x</tt> before position and removes the element from
! <tt>x</tt>. The result is unchanged if <tt>position == i</tt> or <tt>position == ++i</tt>. Pointers and references to <tt>*i</tt>
! continue to refer to this same element but as a member of <tt>*this</tt>. Iterators to <tt>*i</tt> (including <tt>i</tt> itself)
! continue to refer to the same element, but now behave as iterators into <tt>*this</tt>, not into <tt>x</tt>.
! </p>
! </blockquote>
! </blockquote>
! 
! <p>
! But it is incorrect to talk about <tt>operator==</tt> for iterators that are not from the same container (after acceptance of 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>, 24.2.5 [forward.iterators] p2). 
! So, the text operates with an undefined behaviour.
! </p>
! 
! <p>
! One is formally allowed to have list implementation where two iterators from different lists return true to <tt>operator==</tt>.
! For example, this can only happen to non-dereferenceable iterators, and <tt>position</tt> and <tt>++i</tt> can be 
! non-dereferenceable. So, literally according to the standard, it is not allowed in this implementation to transfer 
! such elements with <tt>splice</tt> function.
! </p>
! 
! <p><i>[2013-09 Chicago (late night issues)]</i></p>
! 
! <p>
! Moved to NAD.
! </p>
! <p>
! The condition under which the <tt>list</tt> is unchanged is not program code, so there is no undefined behavior to protect against.
! Rather, the precondition that the evaluation can be performed is implicit if determining when the condition applies.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Modify 23.3.4.6 [forwardlist.ops] p6 as indicated:</p>
! 
! <blockquote>
! <pre>
! void splice_after(const_iterator position, forward_list&amp; x, const_iterator i);
! void splice_after(const_iterator position, forward_list&amp;&amp; x, const_iterator i);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -6- <i>Effects:</i> Inserts the element following <tt>i</tt> into <tt>*this</tt>, following <tt>position</tt>, 
! and removes it from <tt>x</tt>. The result is unchanged if <ins><tt>&amp;x == this</tt> and the following 
! condition is satisfied:</ins> <tt>position == i</tt> or <tt>position == ++i</tt>. Pointers and references to 
! <tt>*++i</tt> continue to refer to the same element but as a member of <tt>*this</tt>. Iterators to <tt>*++i</tt> 
! continue to refer to the same element, but now behave as iterators into <tt>*this</tt>, not into <tt>x</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Modify 23.3.5.5 [list.ops] p7 as indicated:</p>
! 
! <blockquote>
! <pre>
! void splice(const_iterator position, list&amp; x, const_iterator i);
! void splice(const_iterator position, list&amp;&amp; x, const_iterator i);
! </pre>
! <blockquote>
! <p>
! -7- <i>Effects:</i> Inserts an element pointed to by <tt>i</tt> from list <tt>x</tt> before position and removes 
! the element from <tt>x</tt>. The result is unchanged if <ins><tt>&amp;x == this</tt> and the following 
! condition is satisfied:</ins> <tt>position == i</tt> or <tt>position == ++i</tt>. Pointers and references to 
! <tt>*i</tt> continue to refer to this same element but as a member of <tt>*this</tt>. Iterators to <tt>*i</tt> 
! (including <tt>i</tt> itself) continue to refer to the same element, but now behave as iterators into <tt>*this</tt>, 
! not into <tt>x</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2281"></a>2281. C99 cross-reference typo in [using.linkage]</h3>
! <p><b>Section:</b> 17.6.2.3 [using.linkage] <b>Status:</b> <a href="lwg-active.html#NAD Editorial">NAD Editorial</a>
!  <b>Submitter:</b> Chris Sharpe <b>Opened:</b> 2013-08-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#using.linkage">issues</a> in [using.linkage].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD Editorial">NAD Editorial</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! There is a footnote at section 17.6.2.3 [using.linkage]/2 that reads:
! </p>
! <blockquote><p>
! "The only reliable way to declare an object or function signature from the Standard C library is by including 
! the header that declares it, notwithstanding the latitude granted in 7.1.7 of the C Standard."
! </p></blockquote>
! <p>
! There is no section 7.1.7 in the C99 Standard (or C11 final draft). I think the relevant section is:
! </p>
! <blockquote><p>
! "Provided that a library function can be declared without reference to any type defined in a header, it is also 
! permissible to declare the function and use it without including its associated header."
! </p></blockquote>
! <p>
! at 7.1.4/2 from C99.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Moved to NAD Editorial.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit footnote 182, 17.6.2.3 [using.linkage] as indicated:</p>
! 
! <blockquote>
! <p>
! The only reliable way to declare an object or function signature from the Standard C library is by including the header
! that declares it, notwithstanding the latitude granted in <del>7.1.7</del><ins>7.1.4</ins> of the C Standard.
! </p>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2297"></a>2297. [CD] Missing type requirements for <tt>std::exchange</tt></h3>
! <p><b>Section:</b> 20.2.3 [utility.exchange] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2013-09-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.exchange">issues</a> in [utility.exchange].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB 5</b></p>
! 
! <p>
! The wording describes example code including the call of a move constructor, but there is no requirement 
! stated that <tt>T</tt> be move constructible. 
! <p/>
! We would like to add a new Para 1 before existing paragraph:
! </p>
! <blockquote><p>
! <i>Requires:</i> Type <tt>T</tt> shall be <tt>MoveConstructible</tt> (Table 20) and <tt>MoveAssignable</tt> (Table 22).
! </p></blockquote>
! 
! <p>
! However the <tt>MoveAssignable</tt> concept currently does not cover cases where the source and destination types may differ.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! The requirements are implicit according to 17.5.1.4 [structure.specifications]p4.  There is no desire to redundantly
! repeat a set of requirements.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2302"></a>2302. Passing null pointer to placement new</h3>
! <p><b>Section:</b> 18.6.1.3 [new.delete.placement] <b>Status:</b> <a href="lwg-active.html#NAD">Pending NAD</a>
!  <b>Submitter:</b> Marc Glisse <b>Opened:</b> 2013-09-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete.placement">issues</a> in [new.delete.placement].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Pending NAD">Pending NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Based on <a href="http://stackoverflow.com/questions/17571103/passing-null-pointer-to-placement-new">this discussion</a> 
! and as discussed in <a href="http://accu.org/cgi-bin/wg21/message?wg=core&amp;msg=23998">c++std-core-23998</a> and
! <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=34442">c++std-lib-34442</a>, calling placement new currently forces the 
! compiler to check if the pointer is null before initializing the object (a non-negligible cost). It seems many people were not 
! aware of this and they consider it a user error to pass a null pointer to it.
! <p/>
! Proposed resolution: for <tt>operator new</tt> and <tt>operator new[]</tt>, add:
! </p>
! <blockquote><p>
! <i>Requires:</i> <tt>ptr</tt> shall not be a null pointer.
! </p></blockquote>
! 
! <p><i>[2014-02-15 post-Issaquah session : move to Tentatively NAD]</i></p>
! 
! <p>
! AJM to supply the rationale...
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 18.6.1.3 [new.delete.placement] as indicated:</p>
! 
! <blockquote>
! <pre>
! void* operator new(std::size_t size, void* ptr) noexcept;
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires:</i> <tt>ptr</tt> shall not be a null pointer.</ins>
! <p/>
! -2- <i>Returns:</i> <tt>ptr</tt>.
! <p/>
! -3- <i>Remarks:</i> Intentionally performs no other action.
! <p/>
! -4- [<i>Example:</i> This can be useful for constructing an object at a known address:
! </p><blockquote><pre>
! void* place = operator new(sizeof(Something));
! Something* p = new (place) Something();
! </pre></blockquote>
! <p>
! &mdash; <i>end example</i>]
! </p>
! </blockquote>
! </blockquote>
! <blockquote>
! <pre>
! void* operator new[](std::size_t size, void* ptr) noexcept;
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires:</i> <tt>ptr</tt> shall not be a null pointer.</ins>
! <p/>
! -5- <i>Returns:</i> <tt>ptr</tt>.
! <p/>
! -6- <i>Remarks:</i> Intentionally performs no other action.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2305"></a>2305. [fund.ts] <tt>optional</tt> forwarding construction/assignment</h3>
! <p><b>Section:</b> X [optional.object.ctor] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Cassio Neri <b>Opened:</b> 2013-09-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! Consider:
! </p>
! <blockquote><pre>
! struct foo {
!   foo(std::initializer_list&lt;int&gt;&amp;);        // 1
!   foo(const std::initializer_list&lt;int&gt;&amp;);  // 2
!   foo(std::initializer_list&lt;int&gt;&amp;&amp;);       // 3
!   foo(const std::initializer_list&lt;int&gt;&amp;&amp;); // 4
! };
! 
! std::initializer_list&lt;int&gt; il{0, 1, 2};
! 
! foo foo_0{1, 2, 3};                                 // calls 3
! foo foo_1{il};                                      // calls 1
! foo foo_2((const std::initializer_list&lt;int&gt;&amp;) il);  // calls 2
! foo foo_3{(std::initializer_list&lt;int&gt;&amp;&amp;) il};       // calls 3
! foo foo_4((const std::initializer_list&lt;int&gt;&amp;&amp;) il); // calls 4
! </pre></blockquote>
! <p>
! Although the constructors of <tt>foo</tt> are unusual (<tt>initializer_list</tt>s are <i>normally</i> passed by
! value) users of <tt>optional</tt> could naturally expect perfect forwarding of <tt>initializer_list</tt>s. However,
! all lines below end up calling 1.
! </p>
! <blockquote><pre>
! optional&lt;foo&gt; opt0{in_place, {1, 2, 3}};
! optional&lt;foo&gt; opt1{in_place, il};                    
! optional&lt;foo&gt; opt3{in_place, (const std::initializer_list&lt;int&gt;&amp;) il};
! optional&lt;foo&gt; opt2{in_place, (std::initializer_list&lt;int&gt;&amp;&amp;) il};
! optional&lt;foo&gt; opt4{in_place, (const std::initializer_list&lt;int&gt;&amp;&amp;) il};
! 
! opt0.emplace({1, 2, 3});
! opt0.emplace(il);
! opt0.emplace((const std::initializer_list&lt;int&gt;&amp;) il);
! opt0.emplace((std::initializer_list&lt;int&gt;&amp;&amp;) il);
! opt0.emplace((const std::initializer_list&lt;int&gt;&amp;&amp;) il);
! </pre></blockquote>
! <p>
! The constructor
! </p>
! <blockquote><pre>
! template &lt;class... Args&gt; constexpr explicit optional(in_place_t, Args&amp;&amp;... args);
! </pre></blockquote>
! <p>
! can handle all constructor calls above, except the one taking <tt>{1, 2, 3}</tt>. Hence, a simple
! <ins>modification</ins> of
! </p>
! <blockquote><pre>
! template &lt;class U, class... Args&gt;
! constexpr explicit optional(in_place_t, initializer_list&lt;U&gt;<ins>&amp;&amp;</ins> il, Args&amp;&amp;... args);
! </pre></blockquote>
! <p>
! allows perfect forwarding of <tt>std::initializer_list&lt;U&gt;</tt>s to be complete.
! </p>
! 
! <p><i>[2014-06-06 pre-Rapperswil]</i></p>
! 
! <p>
! This issue has been reopened as fundamentals-ts.
! </p>
! 
! <p><i>[2014-06-17, Rapperswil]</i></p>
! 
! <p>
! Move to NAD
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change X [optional.object.ctor] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class U, class... Args&gt; 
! constexpr explicit optional(in_place_t, initializer_list&lt;U&gt;<ins>&amp;&amp;</ins> il, Args&amp;&amp;... args);
! </pre><blockquote>
! <p>
! -27- <i>Requires</i>: <tt>is_constructible&lt;T, initializer_list&lt;U&gt;&amp;<ins>&amp;</ins>, Args&amp;&amp;...>::value</tt> is <tt>true.</tt>
! <p/>
! -28- <i>Effects</i>: Initializes the contained value as if constructing an object of type <tt>T</tt> with the arguments
! <tt><del>il</del><ins>std::move(il)</ins></tt>, <tt>std::forward&lt;Args&gt;(args)...</tt>.
! <p/>
! [&hellip;]
! <p/>
! <del>-31- <i>Remarks</i>: The function shall not participate in overload resolution unless
! <tt>is_constructible&lt;T, initializer_list&lt;U&gt;&amp;, Args&amp;&amp;...&gt;::value</tt> is <tt>true</tt>.</del>
! </p>
! </blockquote>
! </blockquote>
! </li>
! <li><p>Change X [optional.object.assign] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class U, class... Args&gt;
! void optional&lt;T&gt;::emplace(initializer_list&lt;U&gt;<ins>&amp;&amp;</ins> il, Args&amp;&amp;... args);
! </pre><blockquote>
! <p>
! -27- <i>Requires</i>: <tt>is_constructible&lt;T, initializer_list&lt;U&gt;&amp;<ins>&amp;</ins>, Args&amp;&amp;...>::value</tt> is <tt>true.</tt>
! <p/>
! -28- <i>Effects</i>: Calls <tt>*this = nullopt</tt>. Then initializes the contained value as if constructing an object of
! type <tt>T</tt> with the arguments <tt><del>il</del><ins>std::move(il)</ins></tt>, <tt>std::forward&lt;Args&gt;(args)...</tt>.
! <p/>
! [&hellip;]
! <p/>
! <del>-32- <i>Remarks</i>: This function shall not participate in overload resolution unless
! <tt>is_constructible&lt;T, initializer_list&lt;U&gt;&amp;, Args&amp;&amp;...>::value</tt> is <tt>true.</tt></del>
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2311"></a>2311. Allocator requirements should be further minimized</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! C++11's minimized allocator requirements are great, but they're still requiring more things from users than absolutely necessary.
! </p>
! <ul>
! <li><p>
! They require <tt>X::value_type</tt>, but that can be deduced from <tt>SomeAllocator&lt;T, Args&gt;</tt>.
! </p></li>
! <li><p>
! They require <tt>a1 == a2</tt>, but that could default to <tt>true</tt> as most allocators are stateless.
! </p></li>
! <li><p>
! They require <tt>a1 != a2</tt>, but if we start requiring STL implementations to go through <tt>allocator_traits</tt> 
! to provide an <tt>op==</tt> default, we won't need to require <tt>op!=</tt> from users at all. (<tt>std::allocator</tt>, 
! of course, would continue to provide <tt>op!=</tt>. Note that this is analogous to <tt>reference</tt>/<tt>const_reference</tt> &mdash; 
! <tt>std::allocator</tt> still provides them, but we don't require them from users, and in fact we don't require them to be 
! consistent or meaningful if present.)
! </p></li>
! <li><p>
! They require <tt>a == b</tt> and <tt>a != b</tt>. This requirement was not present in C++98/03, it is not necessary 
! (<tt>a == b</tt> is always required to be equivalent to rebind-then-compare), and STL implementations don't even need 
! to compare allocators of different types directly.
! </p></li>
! </ul>
! 
! <p><i>[2014-02-14 Issaquah: Close as NAD]</i></p>
! 
! <p>
! Different vendors rely on each of the different elements suggested to be removed.
! </p>
! <p>
! While <tt>value_type</tt> my be deduced as suggested, far too much wording relies on it being available,
! and the standard churn is likely to be much harder than presented here.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change in 17.6.3.5 [allocator.requirements], Table 28 &mdash; "Allocator requirements" as indicated:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 28 &mdash; Allocator requirements (continued)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Default</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X::value_type</tt>
! </td>
! <td>
! Identical to <tt>T</tt>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! <ins>See Note B, below.</ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a1 == a2</tt>
! </td>
! <td>
! <tt>bool</tt>
! </td>
! <td>
! returns <tt>true</tt> only if storage<br/>
! allocated from each can be<br/>
! deallocated via the other.<br/>
! <tt>operator==</tt> shall be reflexive,<br/>
! symmetric, and transitive, and<br/>
! shall not exit via an exception.<br/>
! </td>
! <td>
! <ins><tt>true</tt></ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <del><tt>a1 != a2</tt></del>
! </td>
! <td>
! <del><tt>bool</tt></del>
! </td>
! <td>
! <del>same as <tt>!(a1 == a2)</tt></del>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td>
! <del><tt>a == b</tt></del>
! </td>
! <td>
! <del><tt>bool</tt></del>
! </td>
! <td>
! <del>same as <tt>a ==<br/>
! Y::rebind&lt;T&gt;::other(b)</tt></del>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td>
! <del><tt>a != b</tt></del>
! </td>
! <td>
! <del><tt>bool</tt></del>
! </td>
! <td>
! <del>same as <tt>!(a == b)</tt></del>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X a(b);</tt>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! Shall not exit via an exception.<br/>
! post: <tt>Y(a) == b</tt>, <tt>a == X(b)</tt>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X a(move(b));</tt>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! Shall not exit via an exception.<br/>
! post: <tt>a</tt> equals the prior value of <tt>X(b)</tt>.
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! 
! <li><p>After 17.6.3.5 [allocator.requirements] p3, add a new paragraph:</p>
! 
! <blockquote>
! <p>
! <ins>Note B: If <tt>Allocator</tt> is a class template instantiation of the form <tt>SomeAllocator&lt;T, Args&gt;</tt>, 
! where <tt>Args</tt> is zero or more type arguments, and <tt>Allocator</tt> does not supply a nested type named <tt>value_type</tt>, 
! the standard <tt>allocator_traits</tt> template uses <tt>T</tt> in place of <tt>Allocator::value_type</tt> by default. 
! For allocator types that are not template instantiations of the above form, no default is provided.</ins>
! </p>
! </blockquote>
! </li>
! 
! <li><p>In the example provided in 17.6.3.5 [allocator.requirements]/5, delete as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class Tp&gt;
! struct SimpleAllocator {
!   <del>typedef Tp value_type;</del>
!   SimpleAllocator(ctor args);
!   template &lt;class T&gt; SimpleAllocator(const SimpleAllocator&lt;T&gt;&amp; other);
!   Tp *allocate(std::size_t n);
!   void deallocate(Tp *p, std::size_t n);
! };
! 
! <del>template &lt;class T, class U&gt;
! bool operator==(const SimpleAllocator&lt;T&gt;&amp;, const SimpleAllocator&lt;U&gt;&amp;);
! template &lt;class T, class U&gt;
! bool operator!=(const SimpleAllocator&lt;T&gt;&amp;, const SimpleAllocator&lt;U&gt;&amp;);</del>
! </pre>
! </blockquote>
! 
! </li>
! 
! <li><p>Edit 20.7.8 [allocator.traits]p1, class template <tt>allocator_traits</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Alloc&gt; struct allocator_traits {
!     typedef Alloc allocator_type;
! 
!     typedef <del>typename Alloc::value_type</del><ins><i>see below</i></ins> value_type;
! 
!     [&hellip;]
! 
!     static Alloc select_on_container_copy_construction(const Alloc&amp; rhs);
! 
!     <ins>static bool equal(const Alloc&amp; a1, const Alloc&amp; a2) noexcept;</ins>
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>At the beginning of 20.7.8.1 [allocator.traits.types], add a new paragraph:</p>
! 
! <blockquote><pre>
! <ins>typedef <i>see below</i> value_type;</ins>
! </pre><blockquote>
! <p>
! <ins><i>Type:</i> <tt>Alloc::value_type</tt> if such a type exists; otherwise, <tt>T</tt> if <tt>Alloc</tt> is a class template 
! instantiation of the form <tt>Alloc&lt;T, Args&gt;</tt>, where <tt>Args</tt> is zero or more type arguments; otherwise, the program 
! is ill-formed.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>At the end of 20.7.8.2 [allocator.traits.members], add a new paragraph:</p>
! 
! <blockquote><pre>
! <ins>static bool equal(const Alloc&amp; a1, const Alloc&amp; a2) noexcept;</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Returns:</i> <tt>a1 == a2</tt> if that expression is well-formed; otherwise, <tt>true</tt>.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2327"></a>2327. Non-power-of-two URNGs should be forbidden</h3>
! <p><b>Section:</b> 26.5.1.3 [rand.req.urng] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req.urng">issues</a> in [rand.req.urng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 26.5.1.3 [rand.req.urng] allows URNGs with non-power-of-two (NPOT) ranges, like <tt>[0, 1729]</tt>. This is unnecessarily permissive 
! (I cannot imagine a realistic source of randomness that would generate such a range) and has real costs for implementers, as 
! <tt>uniform_int_distribution</tt> must be prepared to accept such URNGs. The most efficient way to accumulate randomness is to 
! concatenate random bits, so NPOT randomness is not just useless, it is actively harmful (to avoid bias, if a URNG generates a 
! random number outside of a power-of-two range, the number must be discarded).
! <p/>
! Forbidding NPOT URNGs wouldn't affect users, and would simplify Standard Library implementations. It would be nice to require 
! <tt>min()</tt> to be <tt>0</tt>, but this is not necessary; it is simple for implementations to say <tt>g() - G::min()</tt> and 
! this will optimize away if <tt>min()</tt> is <tt>0</tt>. (It is vaguely plausible for a URNG to have a nonzero minimum; I can 
! imagine something that simply masks off low-order bits without shifting the rest downwards.) What is important is for the entire 
! range to have a power-of-two width; <tt>[1729, 1984]</tt> is acceptable as its size is 256.
! </p>
! 
! <p><i>[2013-10-12: Howard presents a counterexample]</i></p>
! 
! 
! <p>
! Consider:
! </p>
! <blockquote><pre>
! #include &lt;random&gt;
! #include &lt;string&gt;
! #include &lt;iostream&gt;
! 
! template &lt;class Int&gt;
! bool is_power_2m1(Int i)
! {
!   return (i &amp; (i + 1)) == 0;
! }
! 
! template &lt;class URNG&gt;
! void test(const std::string&amp; urng)
! {
!   using namespace std;
!   typename URNG::result_type rng = URNG::max() - URNG::min();
!   if (!is_power_2m1(rng))
!   {
!     cout &lt;&lt; hex;
!     cout &lt;&lt; urng &lt;&lt; " : min = " &lt;&lt; URNG::min() &lt;&lt; ", max = " &lt;&lt; URNG::max()
!          &lt;&lt; ", max-min = " &lt;&lt; rng &lt;&lt; '\n';
!   }
! };
! 
! int main()
! {
!     using namespace std;
!     test&lt;minstd_rand0&gt;("minstd_rand0");
!     test&lt;minstd_rand&gt;("minstd_rand");
!     test&lt;mt19937&gt;("mt19937");
!     test&lt;mt19937_64&gt;("mt19937_64");
!     test&lt;ranlux24_base&gt;("ranlux24_base");
!     test&lt;ranlux48_base&gt;("ranlux48_base");
!     test&lt;ranlux24&gt;("ranlux24");
!     test&lt;ranlux48&gt;("ranlux48");
!     test&lt;knuth_b&gt;("knuth_b");
! }
! </pre></blockquote>
! 
! <p>
! Which for me outputs:
! </p>
! 
! <blockquote><pre>
! minstd_rand0 : min = 1, max = 7ffffffe, max-min = 7ffffffd
! minstd_rand : min = 1, max = 7ffffffe, max-min = 7ffffffd
! knuth_b : min = 1, max = 7ffffffe, max-min = 7ffffffd
! </pre></blockquote>
! 
! <p>
! We do not want to outlaw these three URNG's, and the proposed wording would do that.
! </p>
! 
! <p><i>[Issaquah 2014-02-10: Moved to NAD]</i></p>
! 
! <p>
! STL withdraws the issue, non-power-of-2 URNGs are used in the field, it is too late to consider removing them.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Add a new paragraph at the end of 26.5.1.3 [rand.req.urng] as indicated:</p>
! 
! <blockquote>
! <p>
! -3- The following relation shall hold: <tt>G::min() &lt; G::max()</tt>.
! <p/>
! <ins>-?- <tt>G::max() - G::min()</tt> shall be 2<sup><tt>n</tt></sup> - 1 for some <tt>n &gt; 0</tt>.</ins>
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2345"></a>2345. <tt>integer_sequence</tt> should have a self-typedef <tt>::type</tt></h3>
! <p><b>Section:</b> 20.5.2 [intseq.intseq] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-11-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 20.10.3 [meta.help] says that <tt>integral_constant&lt;T, v&gt;</tt> provides <tt>::value_type</tt> (for <tt>T</tt>) 
! and <tt>::type</tt> (for itself).
! <p/>
! 20.5.2 [intseq.intseq] says that <tt>integer_sequence&lt;T, I...&gt;</tt> provides <tt>::value_type</tt> (for <tt>T</tt>), 
! but nothing for itself.
! <p/>
! Self-typedefs can be useful when users create chains of derived classes, then want to get the Standard base type.  
! This is especially relevant to <tt>integer_sequence</tt>, as variadic templates encourage recursive inheritance.
! </p>
! 
! <p><i>[2014-02-13 Issaquah: Close as NAD]</i></p>
! 
! <p>
! AJM: My own implementation used a different alias for types representing parameter packs, and specifically
! did <em>not</em> define <tt>type</tt>.  I tried it both ways, and found bugs more quickly when <tt>type</tt> was
! not defined.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Edit 20.5.2 [intseq.intseq] as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template&lt;class T, T... I&gt;
!   struct integer_sequence {
!     typedef T value_type;
!     <ins>typedef integer_sequence&lt;T, I...&gt; type;</ins>
!     static constexpr size_t size() noexcept { return sizeof...(I); }
!   };
! }
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2347"></a>2347. <tt>reverse_iterator::operator[]</tt> calls const version of <tt>current[]</tt></h3>
! <p><b>Section:</b> 24.5.1.3.12 [reverse.iter.opindex] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Timo Bingmann <b>Opened:</b> 2013-11-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reverse.iter.opindex">issues</a> in [reverse.iter.opindex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Currently <tt>reverse_iterator::operator[]()</tt> returns "<tt>current[-n-1]</tt>" and has
! an "<em>unspecified</em>" return type.
! <p/>
! When <tt>Iterator</tt> is a mutable random access iterator, the expression
! "<tt>current[-n-1]</tt>" calls "<tt>Iterator::operator[] const</tt>", which returns a
! const reference. This const reference cannot be converted back to a
! mutable reference.
! <p/>
! This issue is related to the "<em>unspecified</em>" return value of
! <tt>reverse_iterator::operator[]</tt>, see defect <a href="lwg-defects.html#386">386</a>.
! <p/>
! The -1 is due to "current" pointing one item beyond the
! <tt>reverse_iterator</tt>'s real current value.
! <p/>
! The current libstdc++ implementation reads "<tt>*(current + n)</tt>" for
! <tt>reverse_iterator::operator[]</tt>.
! <p/>
! This copied <tt>current</tt>, advances (backwards) via <tt>operator+</tt> and
! dereferences. It bypasses the issues due to <tt>reverse_iterator::operator[]</tt>
! being const by copying the iterator.
! </p>
! 
! <p><i>[2014-02-13 Issaquah : close as NAD]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Edit 24.5.1.1 [reverse.iterator], class template <tt>reverse_iterator</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Iterator&gt;
!   class reverse_iterator : public
!   iterator&lt;typename iterator_traits&lt;Iterator&gt;::iterator_category,
!     typename iterator_traits&lt;Iterator&gt;::value_type,
!     typename iterator_traits&lt;Iterator&gt;::difference_type,
!     typename iterator_traits&lt;Iterator&gt;::pointer,
!     typename iterator_traits&lt;Iterator&gt;::reference> {
!   public:
!     [&hellip;]
!     <del><em>unspecified</em></del><ins>reference</ins> operator[](difference_type n) const;
!     [&hellip;]
!   };
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Edit 24.5.1.3.12 [reverse.iter.opindex] as indicated:</p>
! 
! <blockquote><pre>
! <del><em>unspecified</em></del><ins>reference</ins> operator[](
!   typename reverse_iterator&lt;Iterator&gt;::difference_type n) const;
! </pre><blockquote>
! <p>
! -1- <i>Returns:</i> <tt><del>current[-n-1]</del><ins>*(current + n)</ins></tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2351"></a>2351. Does <tt>.seed()</tt> completely reset state of engine?</h3>
! <p><b>Section:</b> 26.5.3 [rand.eng] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2013-12-02 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.eng">issues</a> in [rand.eng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! With regard to Random number engine class templates 26.5.3 [rand.eng],
! the Standard can be read in two different ways: when the member function
! </p>
! <blockquote><pre>
! .seed(result_type s = default_seed)
! </pre></blockquote>
! <p>
! is invoked, is all associated state (such as carry) reset to the same
! state that would have been created by the constructor
! </p>
! <blockquote><pre>
! explicit <em>engine-type</em>(result_type s = default_seed)
! </pre></blockquote>
! <p>
! or is the exact state unspecified?
! <p/>
! Implementations differ.
! </p>
! 
! <p><i>[2014-02-13, Issaquah]</i></p>
! 
! <p>
! Walter Brown says that Table 117 makes this very clear, and that the answer is "Yes"
! <p/>
! Suggested resolution: NAD
! </p>
! 
! <p><i>[2015-05-05 Lenexa: Move to NAD]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Suggested resolution: NAD
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2355"></a>2355. <tt>"s"</tt> UDL suffix should be reserved for a compile-time string library type</h3>
! <p><b>Section:</b> 21.7 [basic.string.literals] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Michael Price <b>Opened:</b> 2014-01-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The current draft uses the <tt>"s"</tt> UDL suffix as a UDL for <tt>basic_string&lt;charT&gt;</tt> (21.7 [basic.string.literals]). 
! In light of EWG active issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3682.html#66">66</a> (concerning N3599), 
! the <tt>"s"</tt> suffix (when applied to character string literals) should be reserved for a compile-time string library type.
! </p>
! 
! <p><i>[Issaquah 2014-10-12: Move to NAD]</i></p>
! 
! 
! <p>We discussed leaving the <tt>s</tt> UDL suffix for <tt>string_view</tt> in Portland, and voted strongly in favor of using it for <tt>std::string</tt>.
! <tt>string</tt> is also an extremely widely used type, and the difference is observable in type deduction cases.
! In addition, a compile-time string is likely to cost significant compile time, which we don't want to make the default with <tt>s</tt>.</p>
! <table>
!   <caption>Mark 2355 as NAD?</caption>
!   <tr><td>SF</td><td>F</td><td>N</td><td>A</td><td>SA</td></tr>
!   <tr><td>8</td> <td>4</td><td>0</td><td>2</td><td>0</td></tr>
! </table>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2373"></a>2373. Make new entities and names in namespace <tt>std</tt> conforming extensions</h3>
! <p><b>Section:</b> 17.6.5 [conforming] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Chandler Carruth <b>Opened:</b> 2014-03-22 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#conforming">issues</a> in [conforming].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Technically, right now, it is not a conforming extension to add a new function to namespace <tt>std</tt>. Doing so could cause 
! unqualified lookup on the name of that function in the presence of a using directive to find a different function. This seems 
! an unreasonable restriction on library vendors providing conforming extensions, as such a using directive seems inherently risky 
! in unqualified name lookup.
! </p>
! <p>
! 17.6.5.5 [member.functions] implies that adding overloads to a method <em>is</em> a conforming extension, and within some 
! limits the same is true for global functions due to 17.6.5.4 [global.functions].
! <p/>
! It would likely be useful to specify that other new entities are valid conforming extensions, or preclude them where they pose 
! serious compatibility problems.
! </p>
! 
! <p><i>[Lenexa 2015-05-06: Move to NAD]</i></p>
! 
! <p>JY: It's a design question, move to LEWG?</p>
! <p>AM: NAD: extensions led to us being unable to use the names hash_map, leading to unordered_map etc. Will result in collisions between members.</p>
! <p>MC: Agrees, implementations that extend std:: must use __ugly_names for this reason.</p>
! <p>JY: I would not oppose NAD.</p>
! <p>Move to NAD, consensus.</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2382"></a>2382. Unclear order of container update versus object destruction on removing an object</h3>
! <p><b>Section:</b> 17.6.5.8 [reentrancy] <b>Status:</b> <a href="lwg-active.html#NAD">Pending NAD</a>
!  <b>Submitter:</b> Peter Kasting <b>Opened:</b> 2014-05-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reentrancy">issues</a> in [reentrancy].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Pending NAD">Pending NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The standard does not seem to discuss reentrant access to a container during removal of an element, 
! leaving it unclear whether a removed object is destroyed before or after it is removed from the container.  
! For example, the behavior of the following code seems to be unspecified:
! </p>
! <blockquote><pre>
! #include &lt;iostream&gt;
! #include &lt;map&gt;
! #include &lt;memory&gt;
! 
! struct T;
! typedef std::map&lt;int, std::shared_ptr&lt;T&gt;&gt; TMap;
! 
! struct T {
!   T(TMap* t_map, int index) : t_map(t_map), index(index) {}
!   ~T() {
!     std::cout &lt;&lt; "Object " &lt;&lt; index &lt;&lt; " is ";
!     if (t_map->count(index))
!       std::cout &lt;&lt; "destroyed before being removed from the map" &lt;&lt; std::endl;
!     else
!       std::cout &lt;&lt; "removed from the map before being destroyed" &lt;&lt; std::endl;
!   }
! 
!   static void AddToMap(TMap* map, int index) {
!     (*map)[index] = std::make_shared&lt;T&gt;(map, index);
!   }
! 
!   TMap* t_map;
!   int index;
! };
! 
! int main()
! {
!   TMap t_map;
!   T::AddToMap(&amp;t_map, 0);
!   T::AddToMap(&amp;t_map, 1);
!   t_map.erase(1);
!   t_map.erase(0);
! }
! </pre></blockquote>
! <p>
! The output of this program in Visual Studio 2013 is:
! </p>
! <blockquote><pre>
! Object 1 is removed from the map before being destroyed
! Object 0 is destroyed before being removed from the map
! </pre></blockquote>
! <p>
! The core issue here is whether an object removed from a container should be destroyed before or after 
! it is removed from the container. The current standard seems to be silent on this issue. 
! The above output demonstrates that the behavior is actually inconsistent. (It's difficult to fully 
! describe Visual Studio's behavior; for example, changing <tt>main()</tt> in the above example to the following:)
! </p>
! <blockquote><pre>
! int main()
! {
!   TMap t_map;
!   T::AddToMap(&amp;t_map, 0);
!   T::AddToMap(&amp;t_map, 1);
!   T::AddToMap(&amp;t_map, 2);
!   T::AddToMap(&amp;t_map, 3);
!   t_map.erase(3);
!   t_map.clear();
! }
! </pre></blockquote>
! <p>
! (...gives this output:)
! </p>
! <blockquote><pre>
! Object 3 is removed from the map before being destroyed
! Object 2 is destroyed before being removed from the map
! Object 1 is destroyed before being removed from the map
! Object 0 is removed from the map before being destroyed
! </pre></blockquote>
! <p>
! In my opinion, the standard should explicitly describe when objects are destroyed as part of removal from a container. 
! To me, it makes the most sense to say that objects should be removed from the container before they are destroyed.
! </p>
! <p><i>[2014-05-07, Jeffrey Yasskin comments]</i></p>
! 
! <p>
! I think there are two main points here beyond this writeup:
! </p>
! <ol>
! <li><p>We can't make recursive use of a standard library container valid
! in all cases.</p></li>
! <li><p>If recursion through especially <tt>erase()</tt> is undefined behavior,
! that's pretty scary for existing large applications with code in
! destructors. Of course, "scary" doesn't mean we have to define the
! behavior.</p></li>
! </ol>
! <p>
! I'll add a third: The language in 17.6.5.8 [reentrancy] nearly makes this
! undefined behavior already. I think any fix is probably going to live
! there, and extend the current "implementation-defined" on recursive
! reentrancy for individual functions to recursive reentrancy on class
! instances. I'm not sure exactly how to word that.
! </p>
! 
! <p><i>[2014-06 Rapperswil]</i></p>
! 
! <p>
! STL: We need more wording about how container methods can be reentrency.
! <p/>
! Jeffrey: The title for this issue is confusing, what we really want is "reentrancy for objects".
! <p/>
! Alisdair: Should we then close 2382 as NAD with a link to the new issue? 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2386"></a>2386. <tt>function::operator=</tt> handles allocators incorrectly</h3>
! <p><b>Section:</b> 20.9.12.2.1 [func.wrap.func.con] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2014-05-23 <b>Last modified:</b> 2015-05-05</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The <i>Effects</i> clauses for the assignment operator for class template <tt>function</tt> are
! written as code that constructs a temporary <tt>function</tt> and then swaps it with <tt>*this</tt>.
! The intention appears to be that assignment should have the strong exception 
! guarantee, i.e., <tt>*this</tt> is not modified if an exception is thrown. However, the current 
! description is incorrect when <tt>*this</tt> was constructed using an allocator.
! <p/>
! Part of the problem is the under-specification of <tt>swap</tt>, which does not state the 
! allocator requirements or allocator postconditions. If <tt>swap</tt> behaves like the rest of the 
! standard library, swapping function objects constructed with different allocators 
! would be undefined behavior. Alternatively <tt>swap</tt> could exchange the allocators, 
! though I would argue against this specification.
! <p/>
! For either specification of <tt>swap</tt>, the current <i>Effects</i> clauses for <tt>operator=</tt> are
! incorrect. If <tt>swap</tt> does not exchange the allocators, then <tt>operator=</tt> would have 
! undefined behavior, which is clearly not desired. If <tt>swap</tt> does exchange the allocators, 
! then <tt>operator=</tt> would always leave the left-hand side (lhs) of the assignment with a 
! default allocator. The latter would be surprising behavior, as the allocator instance is 
! normally unchanged for the lifetime of an object (for good reason), and is certainly not 
! reset to default arbitrarily.
! <p/>
! The desired behavior is that assignment would leave the allocator of the lhs
! unchanged. The way to achieve this behavior is to construct the temporary <tt>function</tt> 
! using the original allocator. Unfortunately, we cannot describe the desired behavior in 
! pure code, because there is no way to name the type-erased value of the allocator. 
! (N3916 would improve this situation for the Library Fundamentals TS, but even with 
! those changes, there is no way to recover the original type of the allocator.) The PR 
! below, therefore, uses pseudo-code, inventing a fictitious <tt><i>ALLOCATOR_OF</i>(f)</tt> 
! expression that evaluates to the actual allocator type, even if that allocator was type 
! erased. I have implemented this PR successfully.
! </p>
! 
! <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.9.12.2.1 [func.wrap.func.con] as indicated:</p>
! 
! <blockquote>
! <p>
! <ins>In the following descriptions, <tt><i>ALLOCATOR_OF</i>(f)</tt> is a copy of the allocator specified in the 
! construction of <tt>function</tt> <tt>f</tt>, or <tt>allocator&lt;char&gt;()</tt> if no allocator was specified.</ins>
! </p>
! <pre>
! function&amp; operator=(const function&amp; f);
! </pre>
! <blockquote>
! <p>
! -12- <i>Effects</i>: <tt>function(<ins>allocator_arg, <i>ALLOCATOR_OF</i>(*this),</ins> f).swap(*this);</tt>
! <p/>
! -13- <i>Returns</i>: <tt>*this</tt>
! </p>
! </blockquote>
! <pre>
! function&amp; operator=(function&amp;&amp; f);
! </pre>
! <blockquote>
! <p>
! -14- <i>Effects</i>: <del>Replaces the target of <tt>*this</tt> with the target of <tt>f</tt>.</del><ins><tt>function(allocator_arg,
! <i>ALLOCATOR_OF</i>(*this), std::move(f)).swap(*this);</tt></ins>
! <p/>
! -15- <i>Returns</i>: <tt>*this</tt>
! </p>
! </blockquote>
! <pre>
! function&amp; operator=(nullptr_t);
! </pre>
! <blockquote>
! <p>
! -16- <i>Effects</i>: If <tt>*this != nullptr</tt>, destroys the target of <tt>this</tt>.
! <p/>
! -17- <i>Postconditions</i>: <tt>!(*this)</tt>. <ins>The allocator is unchanged.</ins>
! <p/>
! -18- <i>Returns</i>: <tt>*this</tt>
! <p/>
! <ins>-?- <i>Throws</i>: Nothing.</ins>
! </p>
! </blockquote>
! <pre>
! template&lt;class F&gt; function&amp; operator=(F&amp;&amp; f);
! </pre>
! <blockquote>
! <p>
! -19- <i>Effects</i>: <tt>function(<ins>allocator_arg, <i>ALLOCATOR_OF</i>(*this),</ins> std::forward&lt;F&gt;(f)).swap(*this);</tt>
! <p/>
! -20- <i>Returns</i>: <tt>*this</tt>
! <p/>
! -21- <i>Remarks</i>: This assignment operator shall not participate in overload resolution unless 
! <tt>declval&lt;typename decay&lt;F&gt;::type&amp;&gt;()</tt> is <tt>Callable</tt> (20.9.11.2) for argument types 
! <tt>ArgTypes...</tt> and return type <tt>R</tt>.
! </p>
! </blockquote>
! <pre>
! template&lt;class F&gt; function&amp; operator=(reference_wrapper&lt;F&gt; f);
! </pre>
! <blockquote>
! <p>
! -22- <i>Effects</i>: <tt>function(<ins>allocator_arg, <i>ALLOCATOR_OF</i>(*this),</ins> f).swap(*this);</tt>
! <p/>
! -23- <i>Returns</i>: <tt>*this</tt>
! </p>
! </blockquote>
! 
! </blockquote>
! </li>
! 
! </ol>
! 
! </blockquote>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! STL: think this is NAD, don't think this is implementable or even should be.<br/>
! STL: think this issue should be dealt with the same as 2370, don't think this should be done ever.<br/>
! STL: NAD because there is nothing broken here.<br/>
! STL: already fixed <tt>operator= noexcept</tt> so <i>Throws</i> nothing is not needed<br/>
! STL: nothing to salvage here<br/>
! MC: consensus for NAD 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! There was consensus by the committee that the issue does not constitute as defect.
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2388"></a>2388. Handling self-assignment in the proposed library function <tt>std::exchange</tt></h3>
! <p><b>Section:</b> 20.2.3 [utility.exchange] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Nick Calus <b>Opened:</b> 2014-05-09 <b>Last modified:</b> 2015-05-06</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.exchange">issues</a> in [utility.exchange].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3668.html">N3668</a>, the addition of a template function 
! <tt>std::exchange</tt> had been proposed. In the rationale provided by the paper, we find the following:
! </p>
! <blockquote>
! <p>
! I chose the name for symmetry with <tt>atomic_exchange</tt>, since they behave the same except for this function not being atomic.
! </p>
! </blockquote>
! <p>
! and:
! </p>
! <blockquote>
! <p>
! Atomic objects provide an <tt>atomic_exchange</tt> function ([atomics.types.operations.req]p18) that <em>assigns a new value to the object 
! and returns the old value</em>. This operation is also useful on non-atomic objects, and this paper proposes adding it to the library.
! <p/>
! But the specified semantics of <tt>std::exchange</tt> is defined as follows:
! </p>
! </blockquote>
! <blockquote><pre>
! template &lt;class T, class U=T&gt; T exchange(T&amp; obj, U&amp;&amp; new_val);
! </pre>
! <blockquote>
! <p>
! <i>Effects</i>: Equivalent to:
! </p>
! <blockquote><pre>
! T old_val = std::move(obj);
! obj = std::forward&lt;U&gt;(new_val);
! return old_val;
! </pre>
! </blockquote>
! </blockquote>
! </blockquote>
! <p>
! When looking at the post-condition of the <tt>std::exchange</tt> function, one would expect the return value to be the old value 
! of <tt>obj</tt> and also that <tt>obj</tt> now contains the value of <tt>new_value</tt>.
! This post-condition is violated when <tt>obj</tt> is a reference to the same object as <tt>new_value</tt> and type <tt>T</tt> 
! has move semantics.
! <p/>
! Given it's specification, it is clear that <tt>std::exchange</tt> is meant to be used with types that have move semantics.
! Therefore, the post-condition is violated for self-assignments.
! <p/>
! Suppose the following situation:
! <p/>
! You have a vector of objects. The objects implement move semantics and are emptied when moved from.
! You provide a function that allows you to replace an object at a specific index by a new object (provided by reference as 
! an argument to your function). When replacing an object, your function calls a member-function <tt>do_something_fancy</tt> 
! on the old object.
! </p>
! <blockquote><pre>
! void your_function(int i, X&amp; new_val) {
!   std::exchange(vec[i], new_val).do_something_fancy();
! }
! </pre></blockquote>
! <p>
! Your function gets called with a given index and the corresponding element of said vector. (by coincidence or by purpose, it 
! doesn't really matter)
! </p>
! <blockquote><pre>
! your_function(5, vec[5]);
! </pre></blockquote>
! <p>
! This will cause the object at <tt>vec[5]</tt> to be in an empty state.
! If this object would not implement move semantics, assignment performance is potentially worse, but at least it 
! is not in an empty (to my business logic, invalid) state.
! <p/>
! So to me, the current reference implementation of <tt>std::exchange</tt> does not have the behavior it is expected to have.
! </p>
! 
! <p><i>[2014-12-18 Telecon]</i></p>
! 
! <p>
! MC: does this resolution solve the problem?
! <p/>
! JW: and is the cost of the extra construction and move acceptable?
! <p/>
! AM: not all moves are cheap
! <p/>
! VV: seems like a design change
! <p/>
! JW: maybe this should be rolled into my unwritten paper on self-swap, so we deal with them consistently
! <p/>
! VV: we should update the issue saying something like that and maybe NAD Future
! <p/>
! MC: instead, add Requires clause saying the arguments are not the same.
! <p/>
! JW: interesting, that can even be checked in a debug mode assertion
! <p/>
! MC: ACTION: send alternative P/R that we can consider
! </p>
! 
! <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.2.3 [utility.exchange] as indicated:</p>
! <blockquote><pre>
! template &lt;class T, class U=T&gt; T exchange(T&amp; obj, U&amp;&amp; new_val);
! </pre>
! <blockquote>
! <p>
! -1- <i>Effects</i>: Equivalent to:
! </p>
! <blockquote><pre>
! <ins>T tmp = std::forward&lt;U&gt;(new_val);</ins>
! T old_val = std::move(obj);
! obj = <del>std::forward&lt;U&gt;(new_val)</del><ins>std::move(tmp)</ins>;
! return old_val;
! </pre>
! </blockquote>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p>
! <strong>Previous resolution from Marshall [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Change 20.2.3 [utility.exchange] as indicated:</p>
! <blockquote><pre>
! template &lt;class T, class U=T&gt; T exchange(T&amp; obj, U&amp;&amp; new_val);
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>obj</tt> and <tt>new_val</tt> shall not refer to the same object.</ins>
! <p/>
! -1- <i>Effects</i>: Equivalent to:
! </p>
! <blockquote><pre>
! T old_val = std::move(obj);
! obj = std::forward&lt;U&gt;(new_val);
! return old_val;
! </pre>
! </blockquote>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2015-03-30, Marshall provides alternative wording]</i></p>
! 
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! MC: self <tt>exchange</tt> does not work<br/>
! MC: PR is just to add requires<br/>
! STL: what if the new thing is a subobject, isn't that just as bad, any aliasing<br/>
! STL: don't know that we need to do anything here if we aren't changing the implementation<br/>
! NM: should remove the requires<br/>
! MC: so NAD<br/>
! STL: could add note<br/>
! NM: remove requires<br/>
! DK: requires isn't already there<br/>
! RL: no note?<br/>
! STL: no note, NAD, burden for next person that asks about aliasing<br/>
! DK: what do we do for <tt>swap</tt>?<br/>
! STL: self <tt>swap</tt> has always been noop, <tt>exchange</tt> could do something bad because it clears out<br/>
! MC: alright, NAD it is<br/>
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! The current specification is clear about the implications described by the issue example and is as intended.
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2405"></a>2405. <tt>rotate()</tt>'s return value is incorrect when <tt>middle == first</tt></h3>
! <p><b>Section:</b> 25.3.11 [alg.rotate] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.rotate">issues</a> in [alg.rotate].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! When LWG <a href="lwg-defects.html#488">488</a> was resolved, the intention was to return "where the subrange <tt>[first, middle)</tt> starts after 
! the rotate is performed". However, this wasn't achieved in one case.
! <p/>
! When <tt>middle == last</tt>, <tt>rotate()</tt> does nothing and returns <tt>first</tt>. This is good.
! <p/>
! When <tt>middle == first</tt>, <tt>rotate()</tt> does nothing and returns <tt>last</tt>. This is bad. In addition to being 
! inconsistent with the other do-nothing case, it prevents <tt>rotate()</tt> from providing the useful guarantee that LWG 
! <a href="lwg-defects.html#488">488</a> wanted: when <tt>[first, last)</tt> is non-empty, <tt>rotate()</tt>'s return value should always be 
! dereferenceable to get the originally-first element.
! <p/>
! Howard Hinnant:
! <p/>
! As the author of LWG <a href="lwg-defects.html#488">488</a> I can assure everyone that the edge cases the proposed resolution specifies were 
! not specified by accident. <tt>rotate(i, i, j)</tt> should return <tt>j</tt> and <tt>rotate(i, j, j)</tt> should return <tt>i</tt>.  
! Doing otherwise will break working code. These return values were motivated by the uses of <tt>rotate</tt> in the implementation 
! of algorithms such as <tt>stable_partition</tt> and <tt>inplace_merge</tt>. The results of these edge cases were not chosen lightly.
! <p/>
! Also a good read:
! <p/>
! <a href="http://www.cs.rpi.edu/~musser/gsd/notes-on-programming-2006-10-13.pdf">notes-on-programming-2006-10-13</a>
! <p/>
! Summary: NAD.
! </p>
! 
! <p><i>[2014-06-16 Rapperswill]</i></p>
! 
! <p>
! Closed as NAD.
! </p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 25.3.11 [alg.rotate] p2 as indicated:</p>
! 
! <blockquote>
! <p>
! -2- <i>Returns</i>: <ins>If <tt>middle == first</tt>, returns <tt>first</tt>. Otherwise, returns</ins> <tt>first + (last - middle)</tt>.
! </p>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2429"></a>2429. <tt>std::basic_ostringstream</tt> is missing an allocator-extended constructor</h3>
! <p><b>Section:</b> 27.8.4 [ostringstream] <b>Status:</b> <a href="lwg-active.html#NAD">NAD</a>
!  <b>Submitter:</b> Markus Kemp <b>Opened:</b> 2014-09-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostringstream">issues</a> in [ostringstream].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#NAD">NAD</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I initially brought this issue up on <a href="http://stackoverflow.com/questions/23955828/how-to-use-basic-ostringstream-with-stateful-custom-allocator-c11">Stack Overflow</a>, 
! where I was then told to make a topic about this problem on <a href="https://groups.google.com/a/isocpp.org/d/msg/std-discussion/kAQFOWz47m0/cOXSHa5Iwg4J">std-discussion</a>, 
! where I was then in turn asked to report the issue.
! <p/>
! The problem: The <tt>std::basic_ostringstream</tt> class template can be instantiated with an allocator type, but none of the 
! constructors provided accept an allocator argument, which means it's impossible to use <tt>std::basic_ostringstream</tt> with 
! stateful allocators. The C++ Standard Library Defect Report List seems to already mention a similar issue (<a href="lwg-defects.html#2210">2210</a>).
! </p>
! 
! 
! <p><i>[2014-11 Urbana]</i></p>
! 
! <p>Closed as NAD</p>
! <p>
! This is not a rejection of the suggestion, but an observation that simply adding an allocator-aware
! constructor is only part of the problem.  <tt>stringstream</tt> returns the <tt>string</tt> assembled
! in its buffer by value, as the result of a call to <tt>str</tt>, and typically this will not use the
! same allocator as would be supplied at construction.
! </p>
! <p>
! The appropriate way to make progress on this issue, if motivated, is to submit a paper to LEWG
! addressing the larger design concerns in addition to 'just' adding an (optional) allocator to
! the constructors.
! </p>
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! </body>
! </html>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/ext/lwg-defects.html gcc-5.5.0/libstdc++-v3/doc/html/ext/lwg-defects.html
*** gcc-5.4.0/libstdc++-v3/doc/html/ext/lwg-defects.html	Mon Jan 31 00:19:58 2011
--- gcc-5.5.0/libstdc++-v3/doc/html/ext/lwg-defects.html	Fri Jul  8 13:29:06 2016
***************
*** 1,6 ****
! <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
! <!-- saved from url=(0060)http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html -->
! <html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
  <title>C++ Standard Library Defect Report List</title>
  <style type="text/css">
    p {text-align:justify}
--- 1,7 ----
! <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
!     "http://www.w3.org/TR/html4/strict.dtd">
! <html>
! <head>
  <title>C++ Standard Library Defect Report List</title>
  <style type="text/css">
    p {text-align:justify}
***************
*** 19,31 ****
  </head>
  <body>
  <table>
! <tbody><tr>
    <td align="left">Doc. no.</td>
!   <td align="left">D3182=10-0172</td>
  </tr>
  <tr>
    <td align="left">Date:</td>
!   <td align="left">2010-11-29</td>
  </tr>
  <tr>
    <td align="left">Project:</td>
--- 20,32 ----
  </head>
  <body>
  <table>
! <tr>
    <td align="left">Doc. no.</td>
!   <td align="left">N4485</td>
  </tr>
  <tr>
    <td align="left">Date:</td>
!   <td align="left">2015-05-23</td>
  </tr>
  <tr>
    <td align="left">Project:</td>
***************
*** 33,1110 ****
  </tr>
  <tr>
    <td align="left">Reply to:</td>
!   <td align="left">Alisdair Meredith &lt;<a href="mailto:lwgchair@gmail.com">lwgchair@gmail.com</a>&gt;</td>
  </tr>
! </tbody></table>
! <h1>C++ Standard Library Defect Report List (Revision D73)</h1>
! <p>Revised 2010-11-29 at 10:11:56 UTC</p>
! 
!   <p>Reference ISO/IEC IS 14882:2003(E)</p>
    <p>Also see:</p>
      <ul>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-toc.html">Table of Contents</a> for all library issues.</li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html">Index by Section</a> for all library issues.</li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html">Index by Status</a> for all library issues.</li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html">Library Active Issues List</a></li>
!       <li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html">Library Closed Issues List</a></li>
      </ul>
    <p>This document contains only library issues which have been closed
    by the Library Working Group (LWG) after being found to be defects
!   in the standard.  That is, issues which have a status of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#DR">DR</a>,
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC">TC</a>, or <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#RR">RR</a>. See the
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html">Library Closed Issues List</a> for issues closed as non-defects.  See the
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html">Library Active Issues List</a> for active issues and more information.  The
!   introductory material in that document also applies to this
!   document.</p>
  
  <h2>Revision History</h2>
  <ul>
! <li>D73: Batavia meeting preview<ul>
! <li><b>Summary:</b><ul>
! <li>80 open issues, down by 126.</li>
! <li>1459 closed issues, up by 145.</li>
! <li>1539 issues total, up by 19.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following 11 New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1521">1521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1523">1523</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2008">2008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2012">2012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2013">2013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2014">2014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2015">2015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2016">2016</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2017">2017</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2018">2018</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2019">2019</a>.</li>
! <li>Added the following 5 Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2001">2001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2003">2003</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2005">2005</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2010">2010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2011">2011</a>.</li>
! <li>Added the following Resolved issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#2002">2002</a>.</li>
! <li>Added the following Review issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2009">2009</a>.</li>
! <li>Added the following Tentatively NAD issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2006">2006</a>.</li>
! <li>Added the following 3 Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2000">2000</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2004">2004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2007">2007</a>.</li>
! <li>Added the following WP issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1522">1522</a>.</li>
! <li>Changed the following 3 issues from New to Deferred: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1213">1213</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1214">1214</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1330">1330</a>.</li>
! <li>Changed the following issue from Open to Deferred: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1450">1450</a>.</li>
! <li>Changed the following 14 issues from Open to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1350">1350</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1351">1351</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1352">1352</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1375">1375</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1411">1411</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1443">1443</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1451">1451</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1454">1454</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1458">1458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1463">1463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1470">1470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1475">1475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1476">1476</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1477">1477</a>.</li>
! <li>Changed the following issue from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1331">1331</a>.</li>
! <li>Changed the following 8 issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1359">1359</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1361">1361</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1373">1373</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1376">1376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1398">1398</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1446">1446</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1473">1473</a>.</li>
! <li>Changed the following 2 issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1190">1190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1200">1200</a>.</li>
! <li>Changed the following issue from WP to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>.</li>
! <li>Changed the following 11 issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1395">1395</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1442">1442</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1471">1471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1472">1472</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1489">1489</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1495">1495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1496">1496</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1509">1509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1510">1510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1511">1511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1512">1512</a>.</li>
! <li>Changed the following issue from Review to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1281">1281</a>.</li>
! <li>Changed the following issue from New to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1289">1289</a>.</li>
! <li>Changed the following 6 issues from Open to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1406">1406</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1422">1422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1484">1484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1488">1488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1493">1493</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1499">1499</a>.</li>
! <li>Changed the following 2 issues from Tentatively NAD Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a>.</li>
! <li>Changed the following 2 issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1252">1252</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1297">1297</a>.</li>
! <li>Changed the following 3 issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1279">1279</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1318">1318</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1332">1332</a>.</li>
! <li>Changed the following 6 issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1385">1385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1401">1401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1408">1408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1418">1418</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1420">1420</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1438">1438</a>.</li>
! <li>Changed the following 42 issues from NAD Editorial to Resolved: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#353">353</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#482">482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#525">525</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#658">658</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#697">697</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#786">786</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1055">1055</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1075">1075</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1122">1122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1174">1174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1260">1260</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1293">1293</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1307">1307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1321">1321</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1394">1394</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1405">1405</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1407">1407</a>.</li>
! <li>Changed the following 5 issues from New to Resolved: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1290">1290</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1322">1322</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1324">1324</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1326">1326</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1328">1328</a>.</li>
! <li>Changed the following 46 issues from Open to Resolved: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#801">801</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1327">1327</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1344">1344</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1346">1346</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1347">1347</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1355">1355</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1356">1356</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1357">1357</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1365">1365</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1366">1366</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1377">1377</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1378">1378</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1379">1379</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1380">1380</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1382">1382</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1383">1383</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1389">1389</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1390">1390</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1391">1391</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1392">1392</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1393">1393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1397">1397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1409">1409</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1410">1410</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1412">1412</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1445">1445</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1447">1447</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1453">1453</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1455">1455</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1462">1462</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1464">1464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1465">1465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1466">1466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1467">1467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1468">1468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1469">1469</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1481">1481</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1482">1482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1490">1490</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1491">1491</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1492">1492</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1498">1498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1501">1501</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1508">1508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1513">1513</a>.</li>
! <li>Changed the following issue from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1480">1480</a>.</li>
! <li>Changed the following 2 issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1371">1371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1413">1413</a>.</li>
! <li>Changed the following issue from New to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1320">1320</a>.</li>
! <li>Changed the following 3 issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1215">1215</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1253">1253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1310">1310</a>.</li>
! <li>Changed the following issue from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1497">1497</a>.</li>
! <li>Changed the following 24 issues from NAD Editorial to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1360">1360</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1363">1363</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1367">1367</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1372">1372</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1381">1381</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1384">1384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1386">1386</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1387">1387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1388">1388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1399">1399</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1400">1400</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1402">1402</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1403">1403</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1416">1416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1417">1417</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1423">1423</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1424">1424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1425">1425</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1426">1426</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1427">1427</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1429">1429</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1430">1430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1431">1431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1441">1441</a>.</li>
! <li>Changed the following issue from New to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1294">1294</a>.</li>
! <li>Changed the following 10 issues from Open to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1354">1354</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1362">1362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1368">1368</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1370">1370</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1428">1428</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1435">1435</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1436">1436</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1437">1437</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1439">1439</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1440">1440</a>.</li>
! <li>Changed the following 2 issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>.</li>
! <li>Changed the following 33 issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1181">1181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1240">1240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1249">1249</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1292">1292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1295">1295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1316">1316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1319">1319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1323">1323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1325">1325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1333">1333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1334">1334</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1335">1335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1337">1337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1338">1338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1339">1339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1340">1340</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1404">1404</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1414">1414</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1432">1432</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1449">1449</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1516">1516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1517">1517</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1518">1518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1519">1519</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1520">1520</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R72: 
! 2010-10-18 pre-Batavia mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>206 open issues, up by 141.</li>
! <li>1314 closed issues, up by 36.</li>
! <li>1520 issues total, up by 177.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following Dup issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1433">1433</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1444">1444</a>.</li>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1360">1360</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1363">1363</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1367">1367</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1372">1372</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1381">1381</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1384">1384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1386">1386</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1387">1387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1388">1388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1394">1394</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1399">1399</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1400">1400</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1402">1402</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1403">1403</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1405">1405</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1407">1407</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1415">1415</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1416">1416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1417">1417</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1419">1419</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1423">1423</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1424">1424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1425">1425</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1426">1426</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1427">1427</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1429">1429</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1430">1430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1431">1431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1434">1434</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1441">1441</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1483">1483</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1500">1500</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1506">1506</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1344">1344</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1345">1345</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1346">1346</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1347">1347</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1348">1348</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1349">1349</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1350">1350</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1351">1351</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1352">1352</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1353">1353</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1354">1354</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1355">1355</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1356">1356</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1357">1357</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1358">1358</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1359">1359</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1361">1361</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1362">1362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1364">1364</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1365">1365</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1366">1366</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1368">1368</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1369">1369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1370">1370</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1371">1371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1373">1373</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1374">1374</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1375">1375</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1376">1376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1377">1377</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1378">1378</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1379">1379</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1380">1380</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1382">1382</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1383">1383</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1385">1385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1389">1389</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1390">1390</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1391">1391</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1392">1392</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1393">1393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1395">1395</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1396">1396</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1397">1397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1398">1398</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1401">1401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1406">1406</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1408">1408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1409">1409</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1410">1410</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1411">1411</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1412">1412</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1413">1413</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1418">1418</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1420">1420</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1421">1421</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1422">1422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1428">1428</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1435">1435</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1436">1436</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1437">1437</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1438">1438</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1439">1439</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1440">1440</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1442">1442</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1443">1443</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1445">1445</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1446">1446</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1447">1447</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1448">1448</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1450">1450</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1451">1451</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1452">1452</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1453">1453</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1454">1454</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1455">1455</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1456">1456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1457">1457</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1458">1458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1459">1459</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1460">1460</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1461">1461</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1462">1462</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1463">1463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1464">1464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1465">1465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1466">1466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1467">1467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1468">1468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1469">1469</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1470">1470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1471">1471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1472">1472</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1473">1473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1474">1474</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1475">1475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1476">1476</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1477">1477</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1478">1478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1479">1479</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1480">1480</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1481">1481</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1482">1482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1484">1484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1485">1485</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1486">1486</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1487">1487</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1488">1488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1489">1489</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1490">1490</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1491">1491</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1492">1492</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1493">1493</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1494">1494</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1495">1495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1496">1496</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1497">1497</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1498">1498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1499">1499</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1501">1501</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1502">1502</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1503">1503</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1504">1504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1505">1505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1507">1507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1508">1508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1509">1509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1510">1510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1511">1511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1512">1512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1513">1513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1514">1514</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1515">1515</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1404">1404</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1414">1414</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1432">1432</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1449">1449</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1516">1516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1517">1517</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1518">1518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1519">1519</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1520">1520</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1260">1260</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1181">1181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1240">1240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1249">1249</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1292">1292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1295">1295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1316">1316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1319">1319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1323">1323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1325">1325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1333">1333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1334">1334</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1335">1335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1337">1337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1338">1338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1339">1339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1340">1340</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R71: 
! 2010-08-25 post-Rapperswil mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>65 open issues, up by 2.</li>
! <li>1278 closed issues, up by 7.</li>
! <li>1343 issues total, up by 9.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1335">1335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2008">2008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1337">1337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1338">1338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1339">1339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1340">1340</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2009">2009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2010">2010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2011">2011</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#996">996</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1119">1119</a>.</li>
! <li>Changed the following issues from Open to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1076">1076</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1169">1169</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1175">1175</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1190">1190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1200">1200</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1187">1187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1206">1206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1278">1278</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R70: 
! 2010-03-26 post-Pittsburgh mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>63 open issues, down by 203.</li>
! <li>1271 closed issues, up by 219.</li>
! <li>1334 issues total, up by 16.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1321">1321</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1329">1329</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1319">1319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1320">1320</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1322">1322</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1323">1323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1324">1324</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1325">1325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1326">1326</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1328">1328</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1330">1330</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1331">1331</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1332">1332</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1333">1333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1334">1334</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1327">1327</a>.</li>
! <li>Changed the following issues from Tentatively Dup to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1302">1302</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1308">1308</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1313">1313</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1314">1314</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#887">887</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1008">1008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1069">1069</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1153">1153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1156">1156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1228">1228</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1125">1125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1202">1202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1223">1223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1224">1224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1246">1246</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1251">1251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1259">1259</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1263">1263</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1265">1265</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1296">1296</a>.</li>
! <li>Changed the following issues from Tentatively NAD Concepts to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1186">1186</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1185">1185</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1210">1210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1212">1212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1225">1225</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1244">1244</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1266">1266</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1269">1269</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1272">1272</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1275">1275</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1291">1291</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1305">1305</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1307">1307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1311">1311</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#446">446</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1211">1211</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1248">1248</a>.</li>
! <li>Changed the following issues from Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#485">485</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>.</li>
! <li>Changed the following issues from Tentatively NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1115">1115</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1233">1233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1239">1239</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1301">1301</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1226">1226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1273">1273</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1274">1274</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1293">1293</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1300">1300</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1304">1304</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1315">1315</a>.</li>
! <li>Changed the following issues from New to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1154">1154</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1317">1317</a>.</li>
! <li>Changed the following issues from Ready to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1112">1112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1201">1201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1238">1238</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1282">1282</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1187">1187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1206">1206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1278">1278</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1281">1281</a>.</li>
! <li>Changed the following issues from Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>.</li>
! <li>Changed the following issues from New to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1159">1159</a>.</li>
! <li>Changed the following issues from Open to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#427">427</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#430">430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#819">819</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#861">861</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#885">885</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#896">896</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#473">473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1030">1030</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1123">1123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1134">1134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1136">1136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1144">1144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1157">1157</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1216">1216</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1227">1227</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1237">1237</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1089">1089</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1126">1126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1131">1131</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1138">1138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1152">1152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1158">1158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1170">1170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1180">1180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1189">1189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1192">1192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1193">1193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1197">1197</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1208">1208</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1209">1209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1218">1218</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1220">1220</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1221">1221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1222">1222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1231">1231</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1241">1241</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1250">1250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1254">1254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1256">1256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1257">1257</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1261">1261</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1262">1262</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1264">1264</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1267">1267</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1270">1270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1271">1271</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1276">1276</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1277">1277</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1280">1280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1284">1284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1285">1285</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1286">1286</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1287">1287</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1288">1288</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1298">1298</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1299">1299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1303">1303</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1306">1306</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1309">1309</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1312">1312</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R69: 
! 2010-02-12 pre-Pittsburgh mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>266 open issues, up by 61.</li>
! <li>1052 closed issues, down by 3.</li>
! <li>1318 issues total, up by 58.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1266">1266</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1269">1269</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1272">1272</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1275">1275</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1278">1278</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1279">1279</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1281">1281</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1289">1289</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1290">1290</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1291">1291</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1292">1292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1294">1294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1295">1295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1297">1297</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1302">1302</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1305">1305</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1307">1307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1308">1308</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1310">1310</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1311">1311</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1313">1313</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1314">1314</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1316">1316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1317">1317</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1318">1318</a>.</li>
! <li>Added the following Tentatively NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1263">1263</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1265">1265</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1296">1296</a>.</li>
! <li>Added the following Tentatively NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1301">1301</a>.</li>
! <li>Added the following Tentatively NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1282">1282</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1261">1261</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1262">1262</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1264">1264</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1267">1267</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1270">1270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1271">1271</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1273">1273</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1274">1274</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1276">1276</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1277">1277</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1280">1280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1284">1284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1285">1285</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1286">1286</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1287">1287</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1288">1288</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1293">1293</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1298">1298</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1299">1299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1300">1300</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1303">1303</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1304">1304</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1306">1306</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1309">1309</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1312">1312</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1315">1315</a>.</li>
! <li>Changed the following issues from NAD to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#101">101</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1248">1248</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>.</li>
! <li>Changed the following issues from New to Tentatively Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1125">1125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1202">1202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1223">1223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1224">1224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1246">1246</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1251">1251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1259">1259</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>.</li>
! <li>Changed the following issues from Review to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>.</li>
! <li>Changed the following issues from Ready to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>.</li>
! <li>Changed the following issues from NAD to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>.</li>
! <li>Changed the following issues from NAD Editorial to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1131">1131</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1170">1170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1180">1180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1193">1193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1197">1197</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1209">1209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1218">1218</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1221">1221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1222">1222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1250">1250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1254">1254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1256">1256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1257">1257</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1089">1089</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>.</li>
! <li>Changed the following issues from Ready to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>.</li>
! <li>Changed the following issues from Pending WP to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R68: 
! 2009-11-06 post-Santa Cruz mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>205 open issues, down by 77.</li>
! <li>1055 closed issues, up by 120.</li>
! <li>1260 issues total, up by 43.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following Dup issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1230">1230</a>.</li>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1229">1229</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1236">1236</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1243">1243</a>.</li>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1232">1232</a>.</li>
! <li>Added the following NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1235">1235</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1242">1242</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1248">1248</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1218">1218</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1221">1221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1222">1222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1223">1223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1224">1224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1225">1225</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1240">1240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1244">1244</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1246">1246</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1249">1249</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1250">1250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1251">1251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1252">1252</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1253">1253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1254">1254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1256">1256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1257">1257</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1259">1259</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1260">1260</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1228">1228</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1227">1227</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1237">1237</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1247">1247</a>.</li>
! <li>Added the following Tentatively NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1233">1233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1239">1239</a>.</li>
! <li>Added the following Tentatively NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1238">1238</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1220">1220</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1226">1226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1231">1231</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1241">1241</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1132">1132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1148">1148</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#458">458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#955">955</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#977">977</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1020">1020</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1035">1035</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1042">1042</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1051">1051</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1064">1064</a>.</li>
! <li>Changed the following issues from Review to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1091">1091</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>.</li>
! <li>Changed the following issues from NAD Concepts to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1143">1143</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1122">1122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1129">1129</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1145">1145</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1146">1146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1147">1147</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1155">1155</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1166">1166</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1172">1172</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1174">1174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1179">1179</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1196">1196</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#908">908</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#926">926</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#944">944</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1046">1046</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1048">1048</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1055">1055</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1075">1075</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1088">1088</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1160">1160</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1161">1161</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1162">1162</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1163">1163</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1165">1165</a>.</li>
! <li>Changed the following issues from Review to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1043">1043</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1047">1047</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1049">1049</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1050">1050</a>.</li>
! <li>Changed the following issues from New to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1120">1120</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1150">1150</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1184">1184</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1203">1203</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1217">1217</a>.</li>
! <li>Changed the following issues from Open to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#484">484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#851">851</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#933">933</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#935">935</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1041">1041</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1053">1053</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1031">1031</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1119">1119</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1153">1153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1156">1156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1211">1211</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#430">430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1123">1123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1134">1134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1136">1136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1144">1144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1216">1216</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#485">485</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1030">1030</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#473">473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1157">1157</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1186">1186</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1115">1115</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1201">1201</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1112">1112</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1126">1126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1138">1138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1152">1152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1158">1158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1189">1189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1192">1192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1208">1208</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#419">419</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#881">881</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1178">1178</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R67: 
! 2009-09-25 pre-Santa Cruz mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>282 open issues, up by 32.</li>
! <li>935 closed issues, down by 1.</li>
! <li>1217 issues total, up by 31.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1187">1187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1188">1188</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1189">1189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1190">1190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1191">1191</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1192">1192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1193">1193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1196">1196</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1197">1197</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1200">1200</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1201">1201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1202">1202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1203">1203</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1206">1206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1207">1207</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1208">1208</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1209">1209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1210">1210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1211">1211</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1212">1212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1213">1213</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1214">1214</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1215">1215</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1216">1216</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1217">1217</a>.</li>
! <li>Changed the following issues from NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#296">296</a>.</li>
! <li>Changed the following issues from WP to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>.</li>
! <li>Changed the following issues from Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R66: 
! 2009-07-31 post-Frankfurt mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>250 open issues, down by 128.</li>
! <li>936 closed issues, up by 171.</li>
! <li>1186 issues total, up by 43.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1164">1164</a>.</li>
! <li>Added the following NAD Concepts issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1149">1149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1167">1167</a>.</li>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1168">1168</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1144">1144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1145">1145</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1146">1146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1147">1147</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1148">1148</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1150">1150</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1151">1151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1152">1152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1153">1153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1154">1154</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1155">1155</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1156">1156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1158">1158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1159">1159</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1166">1166</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1169">1169</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1170">1170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1171">1171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1172">1172</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1174">1174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1175">1175</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1179">1179</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1180">1180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1181">1181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1183">1183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1184">1184</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1185">1185</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1186">1186</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1160">1160</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1161">1161</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1162">1162</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1163">1163</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1165">1165</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1178">1178</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1157">1157</a>.</li>
! <li>Changed the following issues from Open to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#895">895</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#219">219</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#290">290</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#309">309</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#343">343</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#382">382</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#394">394</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#398">398</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#417">417</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#418">418</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#421">421</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#459">459</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#492">492</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#502">502</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#503">503</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#546">546</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#573">573</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#585">585</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#597">597</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#606">606</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#614">614</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#632">632</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#747">747</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#751">751</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#941">941</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#992">992</a>.</li>
! <li>Changed the following issues from Review to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1003">1003</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#568">568</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#701">701</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#702">702</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#785">785</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#863">863</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#903">903</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#988">988</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#995">995</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1002">1002</a>.</li>
! <li>Changed the following issues from New to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1124">1124</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1127">1127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1128">1128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1139">1139</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1140">1140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1141">1141</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1142">1142</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1143">1143</a>.</li>
! <li>Changed the following issues from Open to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#989">989</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1000">1000</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1007">1007</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1010">1010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1015">1015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1016">1016</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1017">1017</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1018">1018</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1026">1026</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1027">1027</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1028">1028</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1029">1029</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1032">1032</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1036">1036</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1057">1057</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1059">1059</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1072">1072</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1078">1078</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1081">1081</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1082">1082</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1083">1083</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1084">1084</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1085">1085</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1086">1086</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1092">1092</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1096">1096</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1105">1105</a>.</li>
! <li>Changed the following issues from Review to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1005">1005</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1080">1080</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1087">1087</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1111">1111</a>.</li>
! <li>Changed the following issues from Tentatively NAD to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#912">912</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#918">918</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1074">1074</a>.</li>
! <li>Changed the following issues from Tentatively NAD Editorial to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#927">927</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1109">1109</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Concepts: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#906">906</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#913">913</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#914">914</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#928">928</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1067">1067</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#873">873</a>.</li>
! <li>Changed the following issues from Tentatively NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#837">837</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#862">862</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#945">945</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#969">969</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#972">972</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#979">979</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1058">1058</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1060">1060</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1061">1061</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1101">1101</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1013">1013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1107">1107</a>.</li>
! <li>Changed the following issues from Open to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#255">255</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#423">423</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#708">708</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#839">839</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>.</li>
! <li>Changed the following issues from CD1 to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>.</li>
! <li>Changed the following issues from NAD Editorial to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#484">484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#458">458</a>.</li>
! <li>Changed the following issues from Tentatively NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#419">419</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#430">430</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#881">881</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>.</li>
! <li>Changed the following issues from NAD to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#473">473</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>.</li>
! <li>Changed the following issues from Tentatively NAD to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1031">1031</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#810">810</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#888">888</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#898">898</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#904">904</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#922">922</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#925">925</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#931">931</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#949">949</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#981">981</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#982">982</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#984">984</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#986">986</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#990">990</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#991">991</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#993">993</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#994">994</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1006">1006</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1014">1014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1037">1037</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1038">1038</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1039">1039</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1040">1040</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1044">1044</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1045">1045</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1065">1065</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1073">1073</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1103">1103</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R65: 
! 2009-06-19 pre-Frankfurt mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>378 open issues, up by 32.</li>
! <li>765 closed issues, up by 0.</li>
! <li>1143 issues total, up by 32.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1115">1115</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1118">1118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1119">1119</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1120">1120</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1122">1122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1123">1123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1124">1124</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1125">1125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1126">1126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1127">1127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1128">1128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1129">1129</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1130">1130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1131">1131</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1132">1132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1133">1133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1134">1134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1135">1135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1136">1136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1138">1138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1139">1139</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1140">1140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1141">1141</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1142">1142</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1143">1143</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1112">1112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#937">937</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#933">933</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#935">935</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#941">941</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#955">955</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#977">977</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#985">985</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#989">989</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#996">996</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1057">1057</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1059">1059</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1069">1069</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1072">1072</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1076">1076</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1092">1092</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1096">1096</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1105">1105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#992">992</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1010">1010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1015">1015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1080">1080</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1091">1091</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1111">1111</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1087">1087</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#568">568</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#701">701</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#702">702</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#785">785</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#863">863</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#903">903</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#912">912</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#918">918</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#995">995</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1074">1074</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#458">458</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>.</li>
! <li>Changed the following issues from Review to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Tentatively NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#988">988</a>.</li>
! <li>Changed the following issues from New to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#837">837</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#862">862</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#927">927</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#945">945</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#969">969</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#972">972</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#979">979</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1058">1058</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1060">1060</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1061">1061</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1101">1101</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1109">1109</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>.</li>
! <li>Changed the following issues from Review to Tentatively NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>.</li>
! <li>Changed the following issues from Open to Tentatively NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#810">810</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#898">898</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#906">906</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#913">913</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#914">914</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#925">925</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#981">981</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#982">982</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#984">984</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#990">990</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1067">1067</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1073">1073</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1103">1103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1107">1107</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#986">986</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#991">991</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#993">993</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#994">994</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1002">1002</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1006">1006</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1013">1013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1014">1014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1037">1037</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1038">1038</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1039">1039</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1040">1040</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1044">1044</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1045">1045</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1065">1065</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R64: 
! 2009-05-01 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>346 open issues, up by 19.</li>
! <li>765 closed issues, up by 0.</li>
! <li>1111 issues total, up by 19.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1093">1093</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1094">1094</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1095">1095</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1096">1096</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1097">1097</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1098">1098</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1099">1099</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1100">1100</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1101">1101</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1102">1102</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1103">1103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1104">1104</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1105">1105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1106">1106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1107">1107</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1108">1108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1109">1109</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1110">1110</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1111">1111</a>.</li>
! <li>Changed the following issues from DR to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#130">130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#386">386</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#406">406</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#409">409</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#413">413</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#434">434</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#438">438</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#444">444</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#445">445</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#455">455</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#457">457</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#460">460</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#469">469</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#533">533</a>.</li>
! <li>Changed the following issues from Review to New: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R63: 
! 2009-03-20 post-Summit mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>327 open issues, up by 96.</li>
! <li>765 closed issues, up by 14.</li>
! <li>1092 issues total, up by 110.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1022">1022</a>.</li>
! <li>Added the following NAD Future issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1025">1025</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#983">983</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#984">984</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#985">985</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#989">989</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#990">990</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#995">995</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#996">996</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#999">999</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1033">1033</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1054">1054</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1056">1056</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1057">1057</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1058">1058</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1059">1059</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1060">1060</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1061">1061</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1062">1062</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1063">1063</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1067">1067</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1068">1068</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1069">1069</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1071">1071</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1072">1072</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1073">1073</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1074">1074</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1076">1076</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1077">1077</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1080">1080</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1090">1090</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1091">1091</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1092">1092</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1000">1000</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1007">1007</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1008">1008</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1016">1016</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1017">1017</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1018">1018</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1020">1020</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1026">1026</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1027">1027</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1028">1028</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1029">1029</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1030">1030</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1031">1031</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1032">1032</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1034">1034</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1035">1035</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1036">1036</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1041">1041</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1042">1042</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1046">1046</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1048">1048</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1051">1051</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1052">1052</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1053">1053</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1055">1055</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1064">1064</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1075">1075</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1078">1078</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1079">1079</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1081">1081</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1082">1082</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1083">1083</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1084">1084</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1085">1085</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1086">1086</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1087">1087</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1088">1088</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1089">1089</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#986">986</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#991">991</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#992">992</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#993">993</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#994">994</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#997">997</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1002">1002</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1003">1003</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1004">1004</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1005">1005</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1006">1006</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1009">1009</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1010">1010</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1013">1013</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1014">1014</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1015">1015</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1019">1019</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1037">1037</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1038">1038</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1039">1039</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1040">1040</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1043">1043</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1044">1044</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1045">1045</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1047">1047</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1049">1049</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1050">1050</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1065">1065</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1070">1070</a>.</li>
! <li>Added the following Tentatively Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#988">988</a>.</li>
! <li>Changed the following issues from New to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#905">905</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#942">942</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#980">980</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#874">874</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#875">875</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#800">800</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#683">683</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#892">892</a>.</li>
! <li>Changed the following issues from Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Changed the following issues from NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#219">219</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#908">908</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#926">926</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#944">944</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#964">964</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#966">966</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#937">937</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#904">904</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#922">922</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#928">928</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#931">931</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#949">949</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#888">888</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#866">866</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#894">894</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R62: 
! 2009-02-06 pre-Summit mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>231 open issues, up by 44.</li>
! <li>751 closed issues, up by 0.</li>
! <li>982 issues total, up by 44.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#940">940</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#941">941</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#942">942</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#943">943</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#944">944</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#945">945</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#946">946</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#949">949</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#952">952</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#954">954</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#955">955</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#956">956</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#957">957</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#960">960</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#961">961</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#963">963</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#964">964</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#965">965</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#966">966</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#967">967</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#968">968</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#969">969</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#970">970</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#971">971</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#972">972</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#977">977</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#979">979</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#980">980</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#981">981</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#982">982</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R61: 
! 2008-12-05 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>187 open issues, up by 20.</li>
! <li>751 closed issues, up by 0.</li>
! <li>938 issues total, up by 20.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#919">919</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#920">920</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#921">921</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#922">922</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#923">923</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#924">924</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#925">925</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#926">926</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#927">927</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#928">928</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#930">930</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#931">931</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#933">933</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#934">934</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#935">935</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#936">936</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#937">937</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#938">938</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R60: 
! 2008-10-03 post-San Francisco mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>167 open issues, down by 25.</li>
! <li>751 closed issues, up by 65.</li>
! <li>918 issues total, up by 40.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following CD1 issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#882">882</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#879">879</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#880">880</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#891">891</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#893">893</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#897">897</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#898">898</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#899">899</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#901">901</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#902">902</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#903">903</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#904">904</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#905">905</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#906">906</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#907">907</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#908">908</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#909">909</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#912">912</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#913">913</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#914">914</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#915">915</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#916">916</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#917">917</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#918">918</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#881">881</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#884">884</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#885">885</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#887">887</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#890">890</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#895">895</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#896">896</a>.</li>
! <li>Added the following Pending NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#892">892</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#894">894</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#888">888</a>.</li>
! <li>Changed the following issues from New to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#818">818</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#820">820</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#843">843</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#845">845</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#846">846</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#856">856</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#858">858</a>.</li>
! <li>Changed the following issues from Ready to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#396">396</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#713">713</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#714">714</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#769">769</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#772">772</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#779">779</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787">787</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#807">807</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#808">808</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#813">813</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#824">824</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#829">829</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#842">842</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#844">844</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#848">848</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#850">850</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#852">852</a>.</li>
! <li>Changed the following issues from Review to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#23">23</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#692">692</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#698">698</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>.</li>
! <li>Changed the following issues from WP to CD1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#44">44</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#49">49</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#76">76</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#91">91</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#92">92</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#98">98</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#117">117</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#118">118</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#120">120</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#123">123</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#136">136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#153">153</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#165">165</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#167">167</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#171">171</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#179">179</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#182">182</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#183">183</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#184">184</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#185">185</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#186">186</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#187">187</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#198">198</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#200">200</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#201">201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#202">202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#206">206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#214">214</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#221">221</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#229">229</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#230">230</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#231">231</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#232">232</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#234">234</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#237">237</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#238">238</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#239">239</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#240">240</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#241">241</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#242">242</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#243">243</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#247">247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#248">248</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#251">251</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#252">252</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#253">253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#256">256</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#259">259</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#260">260</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#261">261</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#262">262</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#263">263</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#265">265</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#266">266</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#268">268</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#270">270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#271">271</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#272">272</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#273">273</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#274">274</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#275">275</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#276">276</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#278">278</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#280">280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#281">281</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#282">282</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#283">283</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#284">284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#285">285</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#286">286</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#288">288</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#291">291</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#292">292</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#294">294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#295">295</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#297">297</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#298">298</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#300">300</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#301">301</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#303">303</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#305">305</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#306">306</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#307">307</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#308">308</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#310">310</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#311">311</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#312">312</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#315">315</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#316">316</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#317">317</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#318">318</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#319">319</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#320">320</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#321">321</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#322">322</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#324">324</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#325">325</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#327">327</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#328">328</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#329">329</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#331">331</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#333">333</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#334">334</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#335">335</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#336">336</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#337">337</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#338">338</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#339">339</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#340">340</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#341">341</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#345">345</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#346">346</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#347">347</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#349">349</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#352">352</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#354">354</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#355">355</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#358">358</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#359">359</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#360">360</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#363">363</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#364">364</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#365">365</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#369">369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#370">370</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#373">373</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#375">375</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#376">376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#379">379</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#380">380</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#381">381</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#383">383</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#389">389</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#391">391</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#395">395</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#400">400</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#401">401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#402">402</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#403">403</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#404">404</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#405">405</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#407">407</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#410">410</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#411">411</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#412">412</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#414">414</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#415">415</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#416">416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#420">420</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#422">422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#425">425</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#426">426</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#428">428</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#432">432</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#435">435</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#436">436</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#441">441</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#442">442</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#443">443</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#448">448</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#449">449</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#453">453</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#456">456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#461">461</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#464">464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#465">465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#467">467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#468">468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#474">474</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#495">495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#496">496</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#497">497</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#505">505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#507">507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#508">508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#519">519</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#520">520</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#521">521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#524">524</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#552">552</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#650">650</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#651">651</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#652">652</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#678">678</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#681">681</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#699">699</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#712">712</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#792">792</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#798">798</a>.</li>
! <li>Changed the following issues from Open to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#849">849</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#855">855</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#454">454</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#812">812</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#841">841</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#864">864</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#484">484</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#717">717</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#725">725</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#738">738</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#751">751</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#819">819</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#861">861</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#873">873</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#851">851</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#866">866</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>.</li>
! <li>Changed the following issues from TC to TC1: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1">1</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#3">3</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#5">5</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#7">7</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#8">8</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#9">9</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#11">11</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#13">13</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#14">14</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#15">15</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#16">16</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#17">17</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#18">18</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#19">19</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#20">20</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#21">21</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#22">22</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#24">24</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#25">25</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#26">26</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#27">27</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#28">28</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#29">29</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#30">30</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#31">31</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#32">32</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#33">33</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#34">34</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#35">35</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#36">36</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#37">37</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#38">38</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#39">39</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#40">40</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#41">41</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#42">42</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#46">46</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#47">47</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#48">48</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#50">50</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#51">51</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#52">52</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#53">53</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#54">54</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#55">55</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#56">56</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#57">57</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#59">59</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#61">61</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#62">62</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#63">63</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#64">64</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#66">66</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#68">68</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#69">69</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#70">70</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#71">71</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#74">74</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#75">75</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#78">78</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#79">79</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#80">80</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#83">83</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#86">86</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#90">90</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#106">106</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#108">108</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#110">110</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#115">115</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#119">119</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#122">122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#124">124</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#125">125</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#126">126</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#127">127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#129">129</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#132">132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#133">133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#134">134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#137">137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#139">139</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#141">141</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#142">142</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#144">144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#146">146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#147">147</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#148">148</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#150">150</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#151">151</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#152">152</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#154">154</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#155">155</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#156">156</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#158">158</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#159">159</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#160">160</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#161">161</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#164">164</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#168">168</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#169">169</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#170">170</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#172">172</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#173">173</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#174">174</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#175">175</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#176">176</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#181">181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#189">189</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#193">193</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#195">195</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199">199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#208">208</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#209">209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#210">210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#211">211</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#212">212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#217">217</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#220">220</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#222">222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#223">223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#224">224</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R59: 
! 2008-08-22 pre-San Francisco mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>192 open issues, up by 9.</li>
! <li>686 closed issues, up by 0.</li>
! <li>878 issues total, up by 9.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#871">871</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#872">872</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#873">873</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#874">874</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#875">875</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#876">876</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#878">878</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R58: 
! 2008-07-28 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>183 open issues, up by 12.</li>
! <li>686 closed issues, down by 4.</li>
! <li>869 issues total, up by 8.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#862">862</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#863">863</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#864">864</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#865">865</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#866">866</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#869">869</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#393">393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#592">592</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#754">754</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#757">757</a>.</li>
! <li>Changed the following issues from Pending WP to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>.</li>
! <li>Changed the following issues from WP to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R57: 
! 2008-06-27 post-Sophia Antipolis mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>171 open issues, down by 20.</li>
! <li>690 closed issues, up by 43.</li>
! <li>861 issues total, up by 23.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#840">840</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#841">841</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#843">843</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#845">845</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#846">846</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#847">847</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#849">849</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#854">854</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#855">855</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#856">856</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#858">858</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#860">860</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#861">861</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#839">839</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#842">842</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#844">844</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#848">848</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#850">850</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#852">852</a>.</li>
! <li>Added the following Review issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#851">851</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#826">826</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#570">570</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#786">786</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#831">831</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>.</li>
! <li>Changed the following issues from Review to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#713">713</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#714">714</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#769">769</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#772">772</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#779">779</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787">787</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#807">807</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#808">808</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#813">813</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#824">824</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#829">829</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#396">396</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#692">692</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#698">698</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#23">23</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Changed the following issues from Ready to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#792">792</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#798">798</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R56: 
! 2008-05-16 pre-Sophia Antipolis mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>191 open issues, up by 24.</li>
! <li>647 closed issues, up by 1.</li>
! <li>838 issues total, up by 25.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#814">814</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#815">815</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#818">818</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#819">819</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#820">820</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#824">824</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#825">825</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#826">826</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#827">827</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#829">829</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#830">830</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#831">831</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#833">833</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#834">834</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#835">835</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#836">836</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#837">837</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#838">838</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#802">802</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R55: 
! 2008-03-14 post-Bellevue mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>167 open issues, down by 39.</li>
! <li>646 closed issues, up by 65.</li>
! <li>813 issues total, up by 26.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following Dup issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#795">795</a>.</li>
! <li>Added the following NAD issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#790">790</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#791">791</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#796">796</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#797">797</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#799">799</a>.</li>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#794">794</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#802">802</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#804">804</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#807">807</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#808">808</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#809">809</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#810">810</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#812">812</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#813">813</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#793">793</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#800">800</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#801">801</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a>.</li>
! <li>Added the following Ready issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#789">789</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#792">792</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#798">798</a>.</li>
! <li>Changed the following issues from NAD Future to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#116">116</a>.</li>
! <li>Changed the following issues from NAD Future to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#188">188</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#729">729</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#730">730</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#731">731</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#733">733</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#735">735</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#736">736</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#737">737</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#739">739</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#741">741</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#745">745</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#748">748</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#763">763</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#764">764</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#773">773</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#784">784</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#388">388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#462">462</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#627">627</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#653">653</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#686">686</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#707">707</a>.</li>
! <li>Changed the following issues from NAD Future to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#390">390</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#529">529</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#626">626</a>.</li>
! <li>Changed the following issues from Review to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#645">645</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#684">684</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#747">747</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a>.</li>
! <li>Changed the following issues from Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#717">717</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#725">725</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#738">738</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#754">754</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#757">757</a>.</li>
! <li>Changed the following issues from Open to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R54: 
! 2008-02-01 pre-Bellevue mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>206 open issues, up by 23.</li>
! <li>581 closed issues, up by 0.</li>
! <li>787 issues total, up by 23.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#765">765</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#766">766</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#767">767</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#768">768</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#769">769</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#770">770</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#772">772</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#773">773</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#775">775</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776">776</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#778">778</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#779">779</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#780">780</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#781">781</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#782">782</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#783">783</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#784">784</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#785">785</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#786">786</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787">787</a>.</li>
! <li>Changed the following issues from NAD Future to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#105">105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#348">348</a>.</li>
! <li>Changed the following issues from NAD Future to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#353">353</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#697">697</a>.</li>
! <li>Changed the following issues from NAD Future to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#388">388</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R53: 
! 2007-12-09 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>183 open issues, up by 11.</li>
! <li>581 closed issues, down by 1.</li>
! <li>764 issues total, up by 10.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#756">756</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#757">757</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#758">758</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#759">759</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#760">760</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#761">761</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#763">763</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#764">764</a>.</li>
! <li>Changed the following issues from NAD to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>.</li>
! <li>Changed the following issues from Pending WP to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R52: 
! 2007-10-19 post-Kona mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>172 open issues, up by 4.</li>
! <li>582 closed issues, up by 27.</li>
! <li>754 issues total, up by 31.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#725">725</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#727">727</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#728">728</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#729">729</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#730">730</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#731">731</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#732">732</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#733">733</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#734">734</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#735">735</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#736">736</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#737">737</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#738">738</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#739">739</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#741">741</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#744">744</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#745">745</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#746">746</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#747">747</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#748">748</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#749">749</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#751">751</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#752">752</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#753">753</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#754">754</a>.</li>
! <li>Changed the following issues from NAD Future to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#77">77</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#639">639</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#657">657</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#663">663</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#548">548</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#546">546</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#573">573</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#585">585</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#627">627</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#632">632</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#653">653</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#686">686</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#707">707</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#708">708</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#393">393</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#592">592</a>.</li>
! <li>Changed the following issues from New to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>.</li>
! <li>Changed the following issues from New to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#574">574</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#645">645</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#684">684</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>.</li>
! <li>Changed the following issues from New to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#552">552</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#650">650</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#651">651</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#652">652</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#678">678</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#681">681</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#699">699</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#712">712</a>.</li>
! <li>Changed the following issues from Open to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#401">401</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#524">524</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R51: 
! 2007-09-09 pre-Kona mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>168 open issues, up by 15.</li>
! <li>555 closed issues, up by 0.</li>
! <li>723 issues total, up by 15.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#709">709</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#710">710</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#712">712</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#713">713</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#714">714</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715">715</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#716">716</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#717">717</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#719">719</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#722">722</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R50: 
! 2007-08-05 post-Toronto mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>153 open issues, down by 5.</li>
! <li>555 closed issues, up by 17.</li>
! <li>708 issues total, up by 12.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#697">697</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#698">698</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#699">699</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#701">701</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#702">702</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#703">703</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#706">706</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#707">707</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#708">708</a>.</li>
! <li>Changed the following issues from New to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#583">583</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#584">584</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#662">662</a>.</li>
! <li>Changed the following issues from Open to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#528">528</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#637">637</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#647">647</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#658">658</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#690">690</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#525">525</a>.</li>
! <li>Changed the following issues from Pending NAD Editorial to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#633">633</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#636">636</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#641">641</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#642">642</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#648">648</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#649">649</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#656">656</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>.</li>
! <li>Changed the following issues from Pending WP to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>.</li>
! <li>Changed the following issues from Ready to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>.</li>
! <li>Changed the following issues from Open to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>.</li>
! <li>Changed the following issues from Open to Review: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>.</li>
! <li>Changed the following issues from Ready to TRDec: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a>.</li>
! <li>Changed the following issues from DR to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#453">453</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R49: 
! 2007-06-23 pre-Toronto mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>158 open issues, up by 13.</li>
! <li>538 closed issues, up by 7.</li>
! <li>696 issues total, up by 20.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#678">678</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#680">680</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#681">681</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#682">682</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#684">684</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#685">685</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#686">686</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#688">688</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#689">689</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#690">690</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#691">691</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#692">692</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#693">693</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#694">694</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#695">695</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#696">696</a>.</li>
! <li>Added the following Pending NAD Editorial issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#683">683</a>.</li>
! <li>Changed the following issues from New to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#587">587</a>.</li>
! <li>Changed the following issues from Open to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#590">590</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#636">636</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#642">642</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#648">648</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#649">649</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R48: 
! 2007-05-06 post-Oxford mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>145 open issues, down by 33.</li>
! <li>531 closed issues, up by 53.</li>
! <li>676 issues total, up by 20.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#657">657</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#658">658</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#659">659</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#660">660</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#661">661</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#662">662</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#663">663</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#664">664</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#665">665</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#666">666</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#667">667</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#668">668</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#669">669</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#671">671</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#676">676</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Dup: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#385">385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#470">470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#515">515</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#547">547</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#560">560</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#572">572</a>.</li>
! <li>Changed the following issues from NAD to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#351">351</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#357">357</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#368">368</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#499">499</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#513">513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#514">514</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#516">516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#555">555</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#558">558</a>.</li>
! <li>Changed the following issues from Tentatively Ready to NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#482">482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#615">615</a>.</li>
! <li>Changed the following issues from NAD_Future to NAD Future: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#77">77</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#105">105</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#116">116</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#188">188</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#219">219</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#348">348</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#353">353</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#388">388</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#390">390</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>.</li>
! <li>Changed the following issues from New to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#633">633</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#641">641</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#656">656</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Pending NAD Editorial: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>.</li>
! <li>Changed the following issues from Tentatively Ready to Pending WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>.</li>
! <li>Changed the following issues from New to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>.</li>
! <li>Changed the following issues from Review to Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a>.</li>
! <li>Changed the following issues from Ready to TRDec: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#598">598</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#599">599</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#600">600</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#601">601</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#602">602</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#603">603</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#605">605</a>.</li>
! <li>Changed the following issues from Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>.</li>
! <li>Changed the following issues from Tentatively Ready to WP: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#201">201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#206">206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#416">416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#422">422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#456">456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R47: 
! 2007-03-09 pre-Oxford mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>178 open issues, up by 37.</li>
! <li>478 closed issues, up by 0.</li>
! <li>656 issues total, up by 37.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added the following New issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#620">620</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#621">621</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#622">622</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#623">623</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#624">624</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#627">627</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#628">628</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#629">629</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#630">630</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#631">631</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#632">632</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#633">633</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#634">634</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#635">635</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#636">636</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#637">637</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#638">638</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#639">639</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#640">640</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#641">641</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#642">642</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#643">643</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#644">644</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#645">645</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#646">646</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#647">647</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#648">648</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#649">649</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#650">650</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#651">651</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#652">652</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#653">653</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#654">654</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#655">655</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#656">656</a>.</li>
! <li>Added the following Open issues: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#625">625</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#626">626</a>.</li>
! <li>Changed the following issues from New to Open: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#570">570</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#590">590</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#614">614</a>.</li>
! <li>Changed the following issues from New to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#547">547</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#560">560</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#572">572</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#615">615</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>.</li>
! <li>Changed the following issues from Open to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#201">201</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#206">206</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#258">258</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#385">385</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#416">416</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#422">422</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#456">456</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#466">466</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#470">470</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#471">471</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#482">482</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#515">515</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>.</li>
! <li>Changed the following issues from Review to Tentatively Ready: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R46: 
! 2007-01-12 mid-term mailing.
! <ul>
! <li><b>Summary:</b><ul>
! <li>141 open issues, up by 11.</li>
! <li>478 closed issues, down by 1.</li>
! <li>619 issues total, up by 10.</li>
! </ul></li>
! <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#610">610</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#611">611</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#612">612</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#613">613</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#614">614</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#615">615</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#616">616</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#617">617</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#618">618</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#619">619</a>.</li>
! </ul></li>
! </ul>
! </li>
! <li>R45: 
! 2006-11-03 post-Portland mailing.
! <ul>
  <li><b>Summary:</b><ul>
! <li>130 open issues, up by 0.</li>
! <li>479 closed issues, up by 17.</li>
! <li>609 issues total, up by 17.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#520">520</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#521">521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a> to WP.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#516">516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#554">554</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#555">555</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#558">558</a> to NAD.</li>
! <li>Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a> to Dup.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#524">524</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#597">597</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#606">606</a> to Open.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#598">598</a> - <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#603">603</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#605">605</a> to Ready.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a> to Review.</li>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#593">593</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#595">595</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#596">596</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#597">597</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#598">598</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#599">599</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#600">600</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#601">601</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#602">602</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#603">603</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#604">604</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#605">605</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#606">606</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#607">607</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#608">608</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#609">609</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R44: 
! 2006-09-08 pre-Portland mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>130 open issues, up by 6.</li>
! <li>462 closed issues, down by 1.</li>
! <li>592 issues total, up by 5.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#583">583</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#584">584</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#585">585</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#586">586</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#587">587</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#589">589</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#590">590</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#591">591</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#592">592</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R43: 
! 2006-06-23 mid-term mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>124 open issues, up by 14.</li>
! <li>463 closed issues, down by 1.</li>
! <li>587 issues total, up by 13.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#575">575</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576">576</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#577">577</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#578">578</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#579">579</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#582">582</a>.</li>
! <li>Reopened <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#255">255</a>.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#520">520</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a> to Tentatively Ready.</li>
  </ul></li>
  </ul>
  </li>
! <li>R42: 
! 2006-04-21 post-Berlin mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>110 open issues, down by 16.</li>
! <li>464 closed issues, up by 24.</li>
! <li>574 issues total, up by 8.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#567">567</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#568">568</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#570">570</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#571">571</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#572">572</a>.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#499">499</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#501">501</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#506">506</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#509">509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#510">510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#511">511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#513">513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#514">514</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#517">517</a> to NAD.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#502">502</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#503">503</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#515">515</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#516">516</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#525">525</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#528">528</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#529">529</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#548">548</a> to Open.</li>
! <li>Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#521">521</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a> to Ready.</li>
! <li>Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#247">247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#294">294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#369">369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#376">376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#495">495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#497">497</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#505">505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#507">507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#508">508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#519">519</a> to WP.</li>
! <li>Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a> to Review.</li>
  </ul></li>
  </ul>
  </li>
! <li>R41: 
! 2006-02-24 pre-Berlin mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>126 open issues, up by 31.</li>
! <li>440 closed issues, up by 0.</li>
! <li>566 issues total, up by 31.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#537">537</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#538">538</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#539">539</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#540">540</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">541</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#542">542</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#543">543</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#544">544</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#545">545</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#546">546</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#547">547</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#548">548</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#549">549</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a> ,<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#551">551</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#552">552</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#553">553</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#554">554</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#555">555</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#556">556</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#557">557</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#558">558</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#559">559</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#560">560</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#561">561</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#562">562</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#563">563</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#564">564</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#565">565</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#566">566</a>.</li>
! <li>Moved <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a> from Ready to Open.</li>
! <li>Reopened <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#309">309</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R40: 
! 2005-12-16 mid-term mailing.
  <ul>
  <li><b>Summary:</b><ul>
! <li>95 open issues.</li>
! <li>440 closed issues.</li>
! <li>535 issues total.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#529">529</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#530">530</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#531">531</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#532">532</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#533">533</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#534">534</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#535">535</a>.</li>
  </ul></li>
  </ul>
  </li>
- <li>R39: 
- 2005-10-14 post-Mont Tremblant mailing.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#526">526</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#528">528</a>.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#280">280</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#461">461</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#464">464</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#465">465</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#467">467</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#468">468</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#474">474</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#496">496</a> from Ready to WP as per the vote from Mont Tremblant.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#247">247</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#294">294</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#369">369</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#376">376</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#475">475</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#495">495</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#497">497</a> from Review to Ready.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#506">506</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#509">509</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#510">510</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#511">511</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#512">512</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#513">513</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#514">514</a> from New to Open.
- Moved issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#505">505</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#507">507</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#508">508</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#519">519</a> from New to Ready.
- Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#500">500</a> from New to NAD.
- Moved issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#518">518</a> from New to Review.
- </li>
- <li>R38: 
- 2005-07-03 pre-Mont Tremblant mailing.
- Merged open TR1 issues in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#504">504</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#523">523</a>
- </li>
- <li>R37: 
- 2005-06 mid-term mailing.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#498">498</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#503">503</a>.
- </li>
- <li>R36: 
- 2005-04 post-Lillehammer mailing. All issues in "ready" status except
- for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#454">454</a> were moved to "DR" status, and all issues
- previously in "DR" status were moved to "WP".
- </li>
- <li>R35: 
- 2005-03 pre-Lillehammer mailing.
- </li>
- <li>R34: 
- 2005-01 mid-term mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#494">494</a>.
- </li>
- <li>R33: 
- 2004-11 post-Redmond mailing. Reflects actions taken in Redmond.
- </li>
- <li>R32: 
- 2004-09 pre-Redmond mailing: reflects new proposed resolutions and
- new issues received after the 2004-07 mailing.  Added
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#479">479</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#481">481</a>.
- </li>
- <li>R31: 
- 2004-07 mid-term mailing: reflects new proposed resolutions and
- new issues received after the post-Sydney mailing.  Added
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#478">478</a>.
- </li>
- <li>R30: 
- Post-Sydney mailing: reflects decisions made at the Sydney meeting.
- Voted all "Ready" issues from R29 into the working paper.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#460">460</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#462">462</a>.
- </li>
- <li>R29: 
- Pre-Sydney mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#441">441</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#457">457</a>.
- </li>
- <li>R28: 
- Post-Kona mailing: reflects decisions made at the Kona meeting.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#432">432</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#440">440</a>.
- </li>
- <li>R27: 
- Pre-Kona mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#404">404</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>.
- </li>
- <li>R26: 
- Post-Oxford mailing: reflects decisions made at the Oxford meeting.
- All issues in Ready status were voted into DR status.  All issues in
- DR status were voted into WP status.
- </li>
- <li>R25: 
- Pre-Oxford mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#390">390</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#402">402</a>.
- </li>
- <li>R24: 
- Post-Santa Cruz mailing: reflects decisions made at the Santa Cruz
- meeting.  All Ready issues from R23 with the exception of <iref ref="253">, which has been given a new proposed resolution, were
- moved to DR status.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#383">383</a>-<iref ref="389">.  (Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#387">387</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#389">389</a> were discussed
- at the meeting.)  Made progress on issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a>, <iref ref="226">, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#229">229</a>: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a> and <iref ref="229"> have been moved to Ready status, and the only remaining
- concerns with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a> involve wording.
- </iref></iref></iref></iref></li>
- <li>R23: 
- Pre-Santa Cruz mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#367">367</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#382">382</a>.
- Moved issues in the TC to TC status.
- </li>
- <li>R22: 
- Post-Curaçao mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#362">362</a>-<iref ref="366">.
- </iref></li>
- <li>R21: 
- Pre-Curaçao mailing.  Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#351">351</a>-<iref ref="361">.
- </iref></li>
- <li>R20: 
- Post-Redmond mailing; reflects actions taken in Redmond.  Added
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#336">336</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a>, of which issues 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#347">347</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a> were added since Redmond, hence
- not discussed at the meeting.  
- 
- All Ready issues were moved to DR status, with the exception of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#284">284</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#241">241</a>, and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#267">267</a>.
- 
- Noteworthy issues discussed at Redmond include 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#120">120</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#202">202</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>, 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#270">270</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#253">253</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#254">254</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>.
- </li>
- <li>R19: 
- Pre-Redmond mailing.  Added new issues 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#335">335</a>.
- </li>
- <li>R18: 
- Post-Copenhagen mailing; reflects actions taken in Copenhagen.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#312">312</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#317">317</a>, and discussed
- new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#271">271</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#314">314</a>.
- 
- Changed status of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#118">118</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#136">136</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#153">153</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#165">165</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#171">171</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#183">183</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#184">184</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#185">185</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#186">186</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#214">214</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#221">221</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#234">234</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#237">237</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#243">243</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#248">248</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#251">251</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#252">252</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#256">256</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#260">260</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#261">261</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#262">262</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#263">263</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#265">265</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#268">268</a>
- to DR.
- 
- Changed status of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#49">49</a>  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#117">117</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#182">182</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#230">230</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#232">232</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#238">238</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#241">241</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#242">242</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#259">259</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#266">266</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#267">267</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#271">271</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#272">272</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#273">273</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#275">275</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#281">281</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#284">284</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#285">285</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#286">286</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#288">288</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#292">292</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#295">295</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#297">297</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#298">298</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#301">301</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#303">303</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#306">306</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#307">307</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#308">308</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#312">312</a>
- to Ready.
- 
- Closed issues 
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#277">277</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#279">279</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#287">287</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#289">289</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#293">293</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#302">302</a> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#313">313</a>
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#314">314</a>
- as NAD.
- 
- </li>
- <li>R17: 
- Pre-Copenhagen mailing.  Converted issues list to XML.  Added proposed
- resolutions for issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#49">49</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#76">76</a>, <iref ref="91">, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#235">235</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#267">267</a>.
- Added new issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#278">278</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#311">311</a>.
- </iref></li>
- <li>R16:  
- post-Toronto mailing; reflects actions taken in Toronto. Added new
- issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#265">265</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#277">277</a>.  Changed status of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#3">3</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#8">8</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#9">9</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#19">19</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#26">26</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#31">31</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#61">61</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#63">63</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#86">86</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#108">108</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#115">115</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#122">122</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#127">127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#129">129</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#134">134</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#137">137</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#142">142</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#144">144</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#146">146</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#147">147</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#159">159</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#164">164</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#170">170</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#181">181</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199">199</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#208">208</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#209">209</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#210">210</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#211">211</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#212">212</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#217">217</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#220">220</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#222">222</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#223">223</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#224">224</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a> to "DR".  Reopened issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#23">23</a>. Reopened
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#187">187</a>. Changed issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#2">2</a> and
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#4">4</a> to NAD. Fixed a typo in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#17">17</a>. Fixed
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#70">70</a>: signature should be changed both places it
- appears. Fixed issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#160">160</a>: previous version didn't fix
- the bug in enough places.
- </li>
- <li>R15: 
- pre-Toronto mailing. Added issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233">233</a>-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#264">264</a>. Some small HTML formatting
- changes so that we pass Weblint tests.
- </li>
- <li>R14: 
- post-Tokyo II mailing; reflects committee actions taken in
- Tokyo. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#232">232</a>. (00-0019R1/N1242)
- </li>
- <li>R13: 
- pre-Tokyo II updated: Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#212">212</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a>.
- </li>
- <li>R12: 
- pre-Tokyo II mailing: Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199">199</a> to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#211">211</a>. Added "and paragraph 5" to the proposed resolution
- of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#29">29</a>.  Add further rationale to issue
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#178">178</a>.
- </li>
- <li>R11: 
- post-Kona mailing: Updated to reflect LWG and full committee actions
- in Kona (99-0048/N1224). Note changed resolution of issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#4">4</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#38">38</a>. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#196">196</a>
- to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#198">198</a>. Closed issues list split into "defects" and
- "closed" documents.  Changed the proposed resolution of issue
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#4">4</a> to NAD, and changed the wording of proposed resolution
- of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#38">38</a>.
- </li>
- <li>R10: 
- pre-Kona updated.  Added proposed resolutions <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#83">83</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#86">86</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#91">91</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#92">92</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a>. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#190">190</a> to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#195">195</a>. (99-0033/D1209, 14 Oct 99)
- </li>
- <li>R9: 
- pre-Kona mailing.  Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a> to
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#189">189</a>. Issues list split into separate "active" and
- "closed" documents. (99-0030/N1206, 25 Aug 99)
- </li>
- <li>R8: 
- post-Dublin mailing. Updated to reflect LWG and full committee actions
- in Dublin. (99-0016/N1193, 21 Apr 99)
- </li>
- <li>R7: 
- pre-Dublin updated: Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#130">130</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#131">131</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#132">132</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#133">133</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#134">134</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#135">135</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#136">136</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#137">137</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#139">139</a> (31 Mar 99)
- </li>
- <li>R6: 
- pre-Dublin mailing. Added issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#127">127</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#128">128</a>,
- and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#129">129</a>.  (99-0007/N1194, 22 Feb 99)
- </li>
- <li>R5: 
- update issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>; added issues
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#114">114</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#126">126</a>. Format revisions to prepare
- for making list public. (30 Dec 98)
- </li>
- <li>R4: 
- post-Santa Cruz II updated: Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#110">110</a>,
- <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#111">111</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#112">112</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#113">113</a> added, several
- issues corrected. (22 Oct 98)
- </li>
- <li>R3: 
- post-Santa Cruz II: Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#94">94</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#109">109</a>
- added, many issues updated to reflect LWG consensus (12 Oct 98)
- </li>
- <li>R2: 
- pre-Santa Cruz II: Issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#73">73</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#93">93</a> added,
- issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#17">17</a> updated. (29 Sep 98)
- </li>
- <li>R1: 
- Correction to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#55">55</a> resolution, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#60">60</a> code
- format, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#64">64</a> title. (17 Sep 98)
- </li>
  </ul>
  
  <h2>Defect Reports</h2>
  <hr>
  <h3><a name="1"></a>1. C library linkage editing oversight</h3>
! <p><b>Section:</b> 17.6.2.3 [using.linkage] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 1997-11-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The change specified in the proposed resolution below did not make
  it into the Standard. This change was accepted in principle at the
--- 34,218 ----
  </tr>
  <tr>
    <td align="left">Reply to:</td>
!   <td align="left">Marshall Clow &lt;<a href="mailto:lwgchair@gmail.com">lwgchair@gmail.com</a>&gt;</td>
  </tr>
! </table>
! <h1>C++ Standard Library Defect Report List (Revision R93)</h1>
! <p><p>Revised 2015-05-23 at 15:05:40 UTC</p>
! </p>
!   <p>Reference ISO/IEC IS 14882:2014(E)</p>
    <p>Also see:</p>
      <ul>
!       <li><a href="lwg-toc.html">Table of Contents</a> for all library issues.</li>
!       <li><a href="lwg-index.html">Index by Section</a> for all library issues.</li>
!       <li><a href="lwg-status.html">Index by Status</a> for all library issues.</li>
!       <li><a href="lwg-active.html">Library Active Issues List</a></li>
!       <li><a href="lwg-closed.html">Library Closed Issues List</a></li>
      </ul>
    <p>This document contains only library issues which have been closed
    by the Library Working Group (LWG) after being found to be defects
!   in the standard.  That is, issues which have a status of <a href="lwg-active.html#DR">DR</a>,
!   <a href="lwg-active.html#TC1">TC1</a>, <a href="lwg-active.html#C++11">C++11</a>, 
!   <a href="lwg-active.html#C++14">C++14</a>, or <a href="lwg-active.html#Resolved">Resolved</a>. See
!   the <a href="lwg-closed.html">Library Closed Issues List</a> for issues closed as non-defects.  See
!   the <a href="lwg-active.html">Library Active Issues List</a> for active issues and more information.
!   The introductory material in that document also applies to this document.</p>
  
  <h2>Revision History</h2>
  <ul>
! <li>R93: 2014-05-22 2015 post-Lenexa mailing<ul>
  <li><b>Summary:</b><ul>
! <li>256 open issues, down by 36.</li>
! <li>1770 closed issues, up by 48.</li>
! <li>2026 issues total, up by 12.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 2 Ready issues: <a href="lwg-active.html#2492">2492</a>, <a href="lwg-active.html#2494">2494</a>.</li>
! <li>Added the following 10 New issues: <a href="lwg-active.html#2493">2493</a>, <a href="lwg-active.html#2495">2495</a>, <a href="lwg-active.html#2496">2496</a>, <a href="lwg-active.html#2497">2497</a>, <a href="lwg-active.html#2498">2498</a>, <a href="lwg-active.html#2499">2499</a>, <a href="lwg-active.html#2500">2500</a>, <a href="lwg-active.html#2501">2501</a>, <a href="lwg-active.html#2502">2502</a>, <a href="lwg-active.html#2503">2503</a>.</li>
! <li>Changed the following 2 issues to Ready (from Review): <a href="lwg-active.html#2111">2111</a>, <a href="lwg-active.html#2380">2380</a>.</li>
! <li>Changed the following 20 issues to Ready (from New): <a href="lwg-active.html#2244">2244</a>, <a href="lwg-active.html#2250">2250</a>, <a href="lwg-active.html#2259">2259</a>, <a href="lwg-active.html#2336">2336</a>, <a href="lwg-active.html#2353">2353</a>, <a href="lwg-active.html#2367">2367</a>, <a href="lwg-active.html#2384">2384</a>, <a href="lwg-active.html#2385">2385</a>, <a href="lwg-active.html#2435">2435</a>, <a href="lwg-active.html#2462">2462</a>, <a href="lwg-active.html#2466">2466</a>, <a href="lwg-active.html#2473">2473</a>, <a href="lwg-active.html#2476">2476</a>, <a href="lwg-active.html#2477">2477</a>, <a href="lwg-active.html#2483">2483</a>, <a href="lwg-active.html#2484">2484</a>, <a href="lwg-active.html#2485">2485</a>, <a href="lwg-active.html#2486">2486</a>, <a href="lwg-active.html#2487">2487</a>, <a href="lwg-active.html#2489">2489</a>.</li>
! <li>Changed the following 12 issues to Ready (from Open): <a href="lwg-active.html#1169">1169</a>, <a href="lwg-active.html#2072">2072</a>, <a href="lwg-active.html#2101">2101</a>, <a href="lwg-active.html#2119">2119</a>, <a href="lwg-active.html#2127">2127</a>, <a href="lwg-active.html#2133">2133</a>, <a href="lwg-active.html#2156">2156</a>, <a href="lwg-active.html#2181">2181</a>, <a href="lwg-active.html#2218">2218</a>, <a href="lwg-active.html#2219">2219</a>, <a href="lwg-active.html#2447">2447</a>, <a href="lwg-active.html#2469">2469</a>.</li>
! <li>Changed the following issue to Tentatively Ready (from Open): <a href="lwg-active.html#2224">2224</a>.</li>
! <li>Changed the following issue to Review (from New): <a href="lwg-active.html#2296">2296</a>.</li>
! <li>Changed the following issue to Review (from Open): <a href="lwg-active.html#2328">2328</a>.</li>
! <li>Changed the following 11 issues to Open (from New): <a href="lwg-active.html#2262">2262</a>, <a href="lwg-active.html#2289">2289</a>, <a href="lwg-active.html#2338">2338</a>, <a href="lwg-active.html#2348">2348</a>, <a href="lwg-active.html#2349">2349</a>, <a href="lwg-active.html#2370">2370</a>, <a href="lwg-active.html#2398">2398</a>, <a href="lwg-active.html#2402">2402</a>, <a href="lwg-active.html#2422">2422</a>, <a href="lwg-active.html#2450">2450</a>, <a href="lwg-active.html#2456">2456</a>.</li>
! <li>Changed the following 8 issues to Open (from SG1): <a href="lwg-active.html#2245">2245</a>, <a href="lwg-active.html#2265">2265</a>, <a href="lwg-active.html#2276">2276</a>, <a href="lwg-active.html#2309">2309</a>, <a href="lwg-active.html#2363">2363</a>, <a href="lwg-active.html#2379">2379</a>, <a href="lwg-active.html#2426">2426</a>, <a href="lwg-active.html#2441">2441</a>.</li>
! <li>Changed the following issue to LEWG (from New): <a href="lwg-active.html#2372">2372</a>.</li>
! <li>Changed the following issue to EWG (from New): <a href="lwg-active.html#2432">2432</a>.</li>
! <li>Changed the following issue to Deferred (from Open): <a href="lwg-active.html#2202">2202</a>.</li>
! <li>Changed the following 14 issues to WP (from Ready): <a href="lwg-defects.html#2160">2160</a>, <a href="lwg-defects.html#2168">2168</a>, <a href="lwg-defects.html#2364">2364</a>, <a href="lwg-defects.html#2403">2403</a>, <a href="lwg-defects.html#2406">2406</a>, <a href="lwg-defects.html#2411">2411</a>, <a href="lwg-defects.html#2425">2425</a>, <a href="lwg-defects.html#2427">2427</a>, <a href="lwg-defects.html#2428">2428</a>, <a href="lwg-defects.html#2433">2433</a>, <a href="lwg-defects.html#2434">2434</a>, <a href="lwg-defects.html#2438">2438</a>, <a href="lwg-defects.html#2439">2439</a>, <a href="lwg-defects.html#2440">2440</a>.</li>
! <li>Changed the following 18 issues to WP (from Tentatively Ready): <a href="lwg-defects.html#2059">2059</a>, <a href="lwg-defects.html#2076">2076</a>, <a href="lwg-defects.html#2239">2239</a>, <a href="lwg-defects.html#2369">2369</a>, <a href="lwg-defects.html#2378">2378</a>, <a href="lwg-defects.html#2410">2410</a>, <a href="lwg-defects.html#2415">2415</a>, <a href="lwg-defects.html#2418">2418</a>, <a href="lwg-defects.html#2437">2437</a>, <a href="lwg-defects.html#2448">2448</a>, <a href="lwg-defects.html#2454">2454</a>, <a href="lwg-defects.html#2455">2455</a>, <a href="lwg-defects.html#2458">2458</a>, <a href="lwg-defects.html#2459">2459</a>, <a href="lwg-defects.html#2463">2463</a>, <a href="lwg-defects.html#2467">2467</a>, <a href="lwg-defects.html#2470">2470</a>, <a href="lwg-defects.html#2482">2482</a>.</li>
! <li>Changed the following 3 issues to WP (from New): <a href="lwg-defects.html#2420">2420</a>, <a href="lwg-defects.html#2464">2464</a>, <a href="lwg-defects.html#2488">2488</a>.</li>
! <li>Changed the following issue to WP (from Open): <a href="lwg-defects.html#2063">2063</a>.</li>
! <li>Changed the following 2 issues to WP (from SG1): <a href="lwg-defects.html#2407">2407</a>, <a href="lwg-defects.html#2442">2442</a>.</li>
! <li>Changed the following issue to Resolved (from Review): <a href="lwg-defects.html#2228">2228</a>.</li>
! <li>Changed the following 3 issues to Resolved (from Open): <a href="lwg-defects.html#1526">1526</a>, <a href="lwg-defects.html#2274">2274</a>, <a href="lwg-defects.html#2397">2397</a>.</li>
! <li>Changed the following 5 issues to NAD (from New): <a href="lwg-closed.html#2079">2079</a>, <a href="lwg-closed.html#2251">2251</a>, <a href="lwg-closed.html#2351">2351</a>, <a href="lwg-closed.html#2373">2373</a>, <a href="lwg-closed.html#2386">2386</a>.</li>
! <li>Changed the following issue to NAD (from Open): <a href="lwg-closed.html#2388">2388</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R92: 
! 2015-04-09 pre-Lenexa mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>292 open issues, up by 33.</li>
! <li>1722 closed issues, up by 0.</li>
! <li>2014 issues total, up by 33.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 5 Tentatively Ready issues: <a href="lwg-active.html#2459">2459</a>, <a href="lwg-active.html#2463">2463</a>, <a href="lwg-active.html#2467">2467</a>, <a href="lwg-active.html#2470">2470</a>, <a href="lwg-active.html#2482">2482</a>.</li>
! <li>Added the following 27 New issues: <a href="lwg-active.html#2460">2460</a>, <a href="lwg-active.html#2461">2461</a>, <a href="lwg-active.html#2462">2462</a>, <a href="lwg-active.html#2464">2464</a>, <a href="lwg-active.html#2465">2465</a>, <a href="lwg-active.html#2466">2466</a>, <a href="lwg-active.html#2468">2468</a>, <a href="lwg-active.html#2471">2471</a>, <a href="lwg-active.html#2472">2472</a>, <a href="lwg-active.html#2473">2473</a>, <a href="lwg-active.html#2474">2474</a>, <a href="lwg-active.html#2475">2475</a>, <a href="lwg-active.html#2476">2476</a>, <a href="lwg-active.html#2477">2477</a>, <a href="lwg-active.html#2478">2478</a>, <a href="lwg-active.html#2479">2479</a>, <a href="lwg-active.html#2480">2480</a>, <a href="lwg-active.html#2481">2481</a>, <a href="lwg-active.html#2483">2483</a>, <a href="lwg-active.html#2484">2484</a>, <a href="lwg-active.html#2485">2485</a>, <a href="lwg-active.html#2486">2486</a>, <a href="lwg-active.html#2487">2487</a>, <a href="lwg-active.html#2488">2488</a>, <a href="lwg-active.html#2489">2489</a>, <a href="lwg-active.html#2490">2490</a>, <a href="lwg-active.html#2491">2491</a>.</li>
! <li>Added the following Open issue: <a href="lwg-active.html#2469">2469</a>.</li>
! <li>Changed the following issue to Tentatively Ready (from Review): <a href="lwg-active.html#2378">2378</a>.</li>
! <li>Changed the following 11 issues to Tentatively Ready (from New): <a href="lwg-active.html#2076">2076</a>, <a href="lwg-active.html#2239">2239</a>, <a href="lwg-active.html#2369">2369</a>, <a href="lwg-active.html#2410">2410</a>, <a href="lwg-active.html#2415">2415</a>, <a href="lwg-active.html#2418">2418</a>, <a href="lwg-active.html#2437">2437</a>, <a href="lwg-active.html#2448">2448</a>, <a href="lwg-active.html#2454">2454</a>, <a href="lwg-active.html#2455">2455</a>, <a href="lwg-active.html#2458">2458</a>.</li>
! <li>Changed the following issue to Tentatively Ready (from Open): <a href="lwg-active.html#2059">2059</a>.</li>
! <li>Changed the following issue to Tentatively NAD (from New): <a href="lwg-active.html#2337">2337</a>.</li>
! <li>Changed the following issue to Tentatively NAD (from Open): <a href="lwg-active.html#760">760</a>.</li>
! <li>Changed the following 5 issues to Open (from New): <a href="lwg-active.html#2312">2312</a>, <a href="lwg-active.html#2388">2388</a>, <a href="lwg-active.html#2393">2393</a>, <a href="lwg-active.html#2444">2444</a>, <a href="lwg-active.html#2447">2447</a>.</li>
! <li>Changed the following 4 issues to LEWG (from New): <a href="lwg-active.html#2391">2391</a>, <a href="lwg-active.html#2417">2417</a>, <a href="lwg-active.html#2436">2436</a>, <a href="lwg-active.html#2451">2451</a>.</li>
! <li>Changed the following issue to EWG (from Open): <a href="lwg-active.html#2089">2089</a>.</li>
! <li>Changed the following issue to Core (from New): <a href="lwg-active.html#2452">2452</a>.</li>
! <li>Changed the following 13 issues to SG1 (from New): <a href="lwg-active.html#2236">2236</a>, <a href="lwg-active.html#2245">2245</a>, <a href="lwg-active.html#2265">2265</a>, <a href="lwg-active.html#2276">2276</a>, <a href="lwg-active.html#2309">2309</a>, <a href="lwg-active.html#2334">2334</a>, <a href="lwg-active.html#2363">2363</a>, <a href="lwg-active.html#2379">2379</a>, <a href="lwg-active.html#2407">2407</a>, <a href="lwg-active.html#2412">2412</a>, <a href="lwg-active.html#2426">2426</a>, <a href="lwg-active.html#2442">2442</a>, <a href="lwg-active.html#2445">2445</a>.</li>
! <li>Changed the following issue to SG1 (from Open): <a href="lwg-active.html#2441">2441</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R91: 
! 2014-11-23 post-Urbana mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>259 open issues, up by 32.</li>
! <li>1722 closed issues, down by 20.</li>
! <li>1981 issues total, up by 12.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 12 New issues: <a href="lwg-active.html#2447">2447</a>, <a href="lwg-defects.html#2448">2448</a>, <a href="lwg-active.html#2449">2449</a>, <a href="lwg-active.html#2450">2450</a>, <a href="lwg-active.html#2451">2451</a>, <a href="lwg-active.html#2452">2452</a>, <a href="lwg-active.html#2453">2453</a>, <a href="lwg-defects.html#2454">2454</a>, <a href="lwg-defects.html#2455">2455</a>, <a href="lwg-active.html#2456">2456</a>, <a href="lwg-active.html#2457">2457</a>, <a href="lwg-defects.html#2458">2458</a>.</li>
! <li>Changed the following 2 issues to Ready (from Review): <a href="lwg-defects.html#2160">2160</a>, <a href="lwg-defects.html#2364">2364</a>.</li>
! <li>Changed the following 11 issues to Ready (from New): <a href="lwg-defects.html#2403">2403</a>, <a href="lwg-defects.html#2406">2406</a>, <a href="lwg-defects.html#2411">2411</a>, <a href="lwg-defects.html#2425">2425</a>, <a href="lwg-defects.html#2427">2427</a>, <a href="lwg-defects.html#2428">2428</a>, <a href="lwg-defects.html#2433">2433</a>, <a href="lwg-defects.html#2434">2434</a>, <a href="lwg-defects.html#2438">2438</a>, <a href="lwg-defects.html#2439">2439</a>, <a href="lwg-defects.html#2440">2440</a>.</li>
! <li>Changed the following issue to Ready (from Open): <a href="lwg-defects.html#2168">2168</a>.</li>
! <li>Changed the following issue to Review (from New): <a href="lwg-active.html#2424">2424</a>.</li>
! <li>Changed the following 5 issues to Open (from New): <a href="lwg-active.html#2307">2307</a>, <a href="lwg-active.html#2310">2310</a>, <a href="lwg-active.html#2383">2383</a>, <a href="lwg-active.html#2414">2414</a>, <a href="lwg-active.html#2441">2441</a>.</li>
! <li>Changed the following 2 issues to Open (from NAD Future): <a href="lwg-active.html#760">760</a>, <a href="lwg-active.html#1173">1173</a>.</li>
! <li>Changed the following 4 issues to LEWG (from New): <a href="lwg-active.html#2419">2419</a>, <a href="lwg-active.html#2430">2430</a>, <a href="lwg-active.html#2443">2443</a>, <a href="lwg-active.html#2446">2446</a>.</li>
! <li>Changed the following 48 issues to LEWG (from NAD Future): <a href="lwg-active.html#255">255</a>, <a href="lwg-active.html#423">423</a>, <a href="lwg-active.html#484">484</a>, <a href="lwg-active.html#523">523</a>, <a href="lwg-active.html#532">532</a>, <a href="lwg-active.html#708">708</a>, <a href="lwg-active.html#839">839</a>, <a href="lwg-active.html#851">851</a>, <a href="lwg-active.html#877">877</a>, <a href="lwg-active.html#933">933</a>, <a href="lwg-active.html#935">935</a>, <a href="lwg-active.html#936">936</a>, <a href="lwg-active.html#961">961</a>, <a href="lwg-active.html#1025">1025</a>, <a href="lwg-active.html#1031">1031</a>, <a href="lwg-active.html#1041">1041</a>, <a href="lwg-active.html#1052">1052</a>, <a href="lwg-active.html#1053">1053</a>, <a href="lwg-active.html#1112">1112</a>, <a href="lwg-active.html#1120">1120</a>, <a href="lwg-active.html#1121">1121</a>, <a href="lwg-active.html#1150">1150</a>, <a href="lwg-active.html#1154">1154</a>, <a href="lwg-active.html#1184">1184</a>, <a href="lwg-active.html#1188">1188</a>, <a href="lwg-active.html#1201">1201</a>, <a href="lwg-active.html#1203">1203</a>, <a href="lwg-active.html#1217">1217</a>, <a href="lwg-active.html#1235">1235</a>, <a href="lwg-active.html#1238">1238</a>, <a href="lwg-active.html#1242">1242</a>, <a href="lwg-active.html#1282">1282</a>, <a href="lwg-active.html#1289">1289</a>, <a href="lwg-active.html#1317">1317</a>, <a href="lwg-active.html#1320">1320</a>, <a href="lwg-active.html#1396">1396</a>, <a href="lwg-active.html#1406">1406</a>, <a href="lwg-active.html#1422">1422</a>, <a href="lwg-active.html#1459">1459</a>, <a href="lwg-active.html#1484">1484</a>, <a href="lwg-active.html#1488">1488</a>, <a href="lwg-active.html#1493">1493</a>, <a href="lwg-active.html#1499">1499</a>, <a href="lwg-active.html#1521">1521</a>, <a href="lwg-active.html#2040">2040</a>, <a href="lwg-active.html#2055">2055</a>, <a href="lwg-active.html#2226">2226</a>, <a href="lwg-active.html#2232">2232</a>.</li>
! <li>Changed the following 2 issues to Pending NAD (from Tentatively NAD): <a href="lwg-closed.html#2302">2302</a>, <a href="lwg-closed.html#2382">2382</a>.</li>
! <li>Changed the following 11 issues to WP (from Ready): <a href="lwg-defects.html#2016">2016</a>, <a href="lwg-defects.html#2170">2170</a>, <a href="lwg-defects.html#2340">2340</a>, <a href="lwg-defects.html#2354">2354</a>, <a href="lwg-defects.html#2377">2377</a>, <a href="lwg-defects.html#2396">2396</a>, <a href="lwg-defects.html#2399">2399</a>, <a href="lwg-defects.html#2400">2400</a>, <a href="lwg-defects.html#2401">2401</a>, <a href="lwg-defects.html#2404">2404</a>, <a href="lwg-defects.html#2408">2408</a>.</li>
! <li>Changed the following 12 issues to WP (from Tentatively Ready): <a href="lwg-defects.html#2106">2106</a>, <a href="lwg-defects.html#2129">2129</a>, <a href="lwg-defects.html#2212">2212</a>, <a href="lwg-defects.html#2217">2217</a>, <a href="lwg-defects.html#2230">2230</a>, <a href="lwg-defects.html#2233">2233</a>, <a href="lwg-defects.html#2266">2266</a>, <a href="lwg-defects.html#2325">2325</a>, <a href="lwg-defects.html#2361">2361</a>, <a href="lwg-defects.html#2365">2365</a>, <a href="lwg-defects.html#2376">2376</a>, <a href="lwg-defects.html#2387">2387</a>.</li>
! <li>Changed the following issue to Resolved (from Ready): <a href="lwg-defects.html#2319">2319</a>.</li>
! <li>Changed the following issue to Resolved (from Review): <a href="lwg-defects.html#2118">2118</a>.</li>
! <li>Changed the following issue to Resolved (from New): <a href="lwg-defects.html#2416">2416</a>.</li>
! <li>Changed the following issue to Resolved (from Open): <a href="lwg-defects.html#2108">2108</a>.</li>
! <li>Changed the following issue to NAD (from New): <a href="lwg-closed.html#2429">2429</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R90: 
! 2014-10-13 pre-Urbana mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>227 open issues, up by 31.</li>
! <li>1742 closed issues, up by 0.</li>
! <li>1969 issues total, up by 31.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 31 New issues: <a href="lwg-defects.html#2416">2416</a>, <a href="lwg-active.html#2417">2417</a>, <a href="lwg-defects.html#2418">2418</a>, <a href="lwg-active.html#2419">2419</a>, <a href="lwg-defects.html#2420">2420</a>, <a href="lwg-active.html#2421">2421</a>, <a href="lwg-active.html#2422">2422</a>, <a href="lwg-active.html#2423">2423</a>, <a href="lwg-active.html#2424">2424</a>, <a href="lwg-defects.html#2425">2425</a>, <a href="lwg-active.html#2426">2426</a>, <a href="lwg-defects.html#2427">2427</a>, <a href="lwg-defects.html#2428">2428</a>, <a href="lwg-closed.html#2429">2429</a>, <a href="lwg-active.html#2430">2430</a>, <a href="lwg-active.html#2431">2431</a>, <a href="lwg-active.html#2432">2432</a>, <a href="lwg-defects.html#2433">2433</a>, <a href="lwg-defects.html#2434">2434</a>, <a href="lwg-active.html#2435">2435</a>, <a href="lwg-active.html#2436">2436</a>, <a href="lwg-defects.html#2437">2437</a>, <a href="lwg-defects.html#2438">2438</a>, <a href="lwg-defects.html#2439">2439</a>, <a href="lwg-defects.html#2440">2440</a>, <a href="lwg-active.html#2441">2441</a>, <a href="lwg-defects.html#2442">2442</a>, <a href="lwg-active.html#2443">2443</a>, <a href="lwg-active.html#2444">2444</a>, <a href="lwg-active.html#2445">2445</a>, <a href="lwg-active.html#2446">2446</a>.</li>
! <li>No issues changed.</li>
  </ul></li>
  </ul>
  </li>
! <li>R89: 
! 2014-07-08 post-Rapperswil mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>196 open issues, up by 14.</li>
! <li>1742 closed issues, up by 12.</li>
! <li>1938 issues total, up by 26.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 6 Ready issues: <a href="lwg-defects.html#2396">2396</a>, <a href="lwg-defects.html#2399">2399</a>, <a href="lwg-defects.html#2400">2400</a>, <a href="lwg-defects.html#2401">2401</a>, <a href="lwg-defects.html#2404">2404</a>, <a href="lwg-defects.html#2408">2408</a>.</li>
! <li>Added the following 15 New issues: <a href="lwg-active.html#2391">2391</a>, <a href="lwg-active.html#2392">2392</a>, <a href="lwg-active.html#2393">2393</a>, <a href="lwg-active.html#2394">2394</a>, <a href="lwg-active.html#2398">2398</a>, <a href="lwg-active.html#2402">2402</a>, <a href="lwg-defects.html#2403">2403</a>, <a href="lwg-defects.html#2406">2406</a>, <a href="lwg-defects.html#2407">2407</a>, <a href="lwg-defects.html#2410">2410</a>, <a href="lwg-defects.html#2411">2411</a>, <a href="lwg-active.html#2412">2412</a>, <a href="lwg-active.html#2413">2413</a>, <a href="lwg-active.html#2414">2414</a>, <a href="lwg-defects.html#2415">2415</a>.</li>
! <li>Added the following Open issue: <a href="lwg-defects.html#2397">2397</a>.</li>
! <li>Added the following 3 WP issues: <a href="lwg-defects.html#2390">2390</a>, <a href="lwg-defects.html#2395">2395</a>, <a href="lwg-defects.html#2409">2409</a>.</li>
! <li>Added the following NAD issue: <a href="lwg-closed.html#2405">2405</a>.</li>
! <li>Changed the following issue to Ready (from New): <a href="lwg-defects.html#2377">2377</a>.</li>
! <li>Changed the following 2 issues to Ready (from Deferred): <a href="lwg-active.html#2253">2253</a>, <a href="lwg-active.html#2255">2255</a>.</li>
! <li>Changed the following 2 issues to Tentatively Ready (from New): <a href="lwg-defects.html#2325">2325</a>, <a href="lwg-defects.html#2387">2387</a>.</li>
! <li>Changed the following issue to Tentatively NAD (from New): <a href="lwg-closed.html#2382">2382</a>.</li>
! <li>Changed the following 3 issues to Review (from New): <a href="lwg-defects.html#2364">2364</a>, <a href="lwg-defects.html#2378">2378</a>, <a href="lwg-active.html#2380">2380</a>.</li>
! <li>Changed the following 2 issues to Review (from Open): <a href="lwg-defects.html#2118">2118</a>, <a href="lwg-defects.html#2160">2160</a>.</li>
! <li>Changed the following 3 issues to Open (from New): <a href="lwg-defects.html#2168">2168</a>, <a href="lwg-active.html#2238">2238</a>, <a href="lwg-active.html#2273">2273</a>.</li>
! <li>Changed the following 3 issues to Open (from Deferred): <a href="lwg-active.html#2254">2254</a>, <a href="lwg-active.html#2264">2264</a>, <a href="lwg-active.html#2277">2277</a>.</li>
! <li>Changed the following 3 issues to WP (from New): <a href="lwg-defects.html#2371">2371</a>, <a href="lwg-defects.html#2374">2374</a>, <a href="lwg-defects.html#2389">2389</a>.</li>
! <li>Changed the following 4 issues to Resolved (from Deferred): <a href="lwg-defects.html#2282">2282</a>, <a href="lwg-defects.html#2283">2283</a>, <a href="lwg-defects.html#2287">2287</a>, <a href="lwg-defects.html#2333">2333</a>.</li>
! <li>Changed the following issue to NAD (from Deferred): <a href="lwg-closed.html#2305">2305</a>.</li>
  </ul></li>
  </ul>
  </li>
! <li>R88: 
! 2014-05-24 pre-Rapperswil mailing
  <ul>
  <li><b>Summary:</b><ul>
! <li>182 open issues, up by 29.</li>
! <li>1730 closed issues, up by 0.</li>
! <li>1912 issues total, up by 29.</li>
  </ul></li>
  <li><b>Details:</b><ul>
! <li>Added the following 3 Tentatively Ready issues: <a href="lwg-defects.html#2361">2361</a>, <a href="lwg-defects.html#2365">2365</a>, <a href="lwg-defects.html#2376">2376</a>.</li>
! <li>Added the following 26 New issues: <a href="lwg-active.html#2362">2362</a>, <a href="lwg-active.html#2363">2363</a>, <a href="lwg-defects.html#2364">2364</a>, <a href="lwg-active.html#2366">2366</a>, <a href="lwg-active.html#2367">2367</a>, <a href="lwg-active.html#2368">2368</a>, <a href="lwg-defects.html#2369">2369</a>, <a href="lwg-active.html#2370">2370</a>, <a href="lwg-defects.html#2371">2371</a>, <a href="lwg-active.html#2372">2372</a>, <a href="lwg-closed.html#2373">2373</a>, <a href="lwg-defects.html#2374">2374</a>, <a href="lwg-active.html#2375">2375</a>, <a href="lwg-defects.html#2377">2377</a>, <a href="lwg-defects.html#2378">2378</a>, <a href="lwg-active.html#2379">2379</a>, <a href="lwg-active.html#2380">2380</a>, <a href="lwg-active.html#2381">2381</a>, <a href="lwg-closed.html#2382">2382</a>, <a href="lwg-active.html#2383">2383</a>, <a href="lwg-active.html#2384">2384</a>, <a href="lwg-active.html#2385">2385</a>, <a href="lwg-closed.html#2386">2386</a>, <a href="lwg-defects.html#2387">2387</a>, <a href="lwg-closed.html#2388">2388</a>, <a href="lwg-defects.html#2389">2389</a>.</li>
! <li>Changed the following 5 issues to Tentatively Ready (from Open): <a href="lwg-defects.html#2106">2106</a>, <a href="lwg-defects.html#2129">2129</a>, <a href="lwg-defects.html#2212">2212</a>, <a href="lwg-defects.html#2230">2230</a>, <a href="lwg-defects.html#2233">2233</a>.</li>
  </ul></li>
  </ul>
  </li>
  </ul>
  
  <h2>Defect Reports</h2>
  <hr>
  <h3><a name="1"></a>1. C library linkage editing oversight</h3>
! <p><b>Section:</b> 17.6.2.3 [using.linkage] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 1997-11-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#using.linkage">issues</a> in [using.linkage].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The change specified in the proposed resolution below did not make
  it into the Standard. This change was accepted in principle at the
*************** from:</p>
*** 1118,1134 ****
  
  <blockquote>
    <p>It is unspecified whether a name from the Standard C library
!   declared with external linkage has either extern "C" or
!   extern "C++" linkage.</p>
  </blockquote>
  
  <p>to:</p>
  
  <blockquote>
    <p>Whether a name from the Standard C library declared with external
!   linkage has extern "C" or extern "C++" linkage
    is implementation defined. It is recommended that an implementation
!   use extern "C++" linkage for this purpose.</p>
  </blockquote>
  
  
--- 226,242 ----
  
  <blockquote>
    <p>It is unspecified whether a name from the Standard C library
!   declared with external linkage has either extern &quot;C&quot; or
!   extern &quot;C++&quot; linkage.</p>
  </blockquote>
  
  <p>to:</p>
  
  <blockquote>
    <p>Whether a name from the Standard C library declared with external
!   linkage has extern &quot;C&quot; or extern &quot;C++&quot; linkage
    is implementation defined. It is recommended that an implementation
!   use extern &quot;C++&quot; linkage for this purpose.</p>
  </blockquote>
  
  
*************** from:</p>
*** 1137,1151 ****
  
  <hr>
  <h3><a name="3"></a>3. Atexit registration during atexit() call is not described</h3>
! <p><b>Section:</b> 18.5 [support.start.term] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1997-12-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.start.term">issues</a> in [support.start.term].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>We appear not to have covered all the possibilities of
   exit processing with respect to
! atexit registration. <br>
! <br>
  Example 1: (C and C++)</p>
  
  <pre>    #include &lt;stdlib.h&gt;
--- 245,259 ----
  
  <hr>
  <h3><a name="3"></a>3. Atexit registration during atexit() call is not described</h3>
! <p><b>Section:</b> 18.5 [support.start.term] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1997-12-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.start.term">issues</a> in [support.start.term].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>We appear not to have covered all the possibilities of
   exit processing with respect to
! atexit registration. <br/>
! <br/>
  Example 1: (C and C++)</p>
  
  <pre>    #include &lt;stdlib.h&gt;
*************** through its definition, and all static o
*** 1194,1200 ****
  exit processing. Is the code valid? If so, what are its semantics?</p>
  
  <p>
! Section 18.3 "Start and termination" says that if a function
  F is registered with atexit before a static object t is initialized, F
  will not be called until after t's destructor completes.</p>
  
--- 302,308 ----
  exit processing. Is the code valid? If so, what are its semantics?</p>
  
  <p>
! Section 18.3 &quot;Start and termination&quot; says that if a function
  F is registered with atexit before a static object t is initialized, F
  will not be called until after t's destructor completes.</p>
  
*************** supporting to the proposed resolution.</
*** 1271,1281 ****
  
  <hr>
  <h3><a name="5"></a>5. String::compare specification questionable</h3>
! <p><b>Section:</b> 21.4.6.8 [string::swap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Jack Reeves <b>Opened:</b> 1997-12-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::swap">issues</a> in [string::swap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#87">87</a></p>
  <p><b>Discussion:</b></p>
  <p>At the very end of the basic_string class definition is the signature: int
  compare(size_type pos1, size_type n1, const charT* s, size_type n2 = npos) const; In the
--- 379,389 ----
  
  <hr>
  <h3><a name="5"></a>5. String::compare specification questionable</h3>
! <p><b>Section:</b> 21.4.6.8 [string::swap] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Jack Reeves <b>Opened:</b> 1997-12-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::swap">issues</a> in [string::swap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#87">87</a></p>
  <p><b>Discussion:</b></p>
  <p>At the very end of the basic_string class definition is the signature: int
  compare(size_type pos1, size_type n1, const charT* s, size_type n2 = npos) const; In the
*************** charT* s, size_type n2) const; each defi
*** 1302,1308 ****
  (at the very end of the basic_string synopsis) which reads:</p>
  
  <blockquote>
!   <p><tt>int compare(size_type pos1, size_type n1,<br>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT* s,
    size_type n2 = npos) const;</tt></p>
  </blockquote>
--- 410,416 ----
  (at the very end of the basic_string synopsis) which reads:</p>
  
  <blockquote>
!   <p><tt>int compare(size_type pos1, size_type n1,<br/>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT* s,
    size_type n2 = npos) const;</tt></p>
  </blockquote>
*************** charT* s, size_type n2) const; each defi
*** 1310,1318 ****
  <p>with:</p>
  
  <blockquote>
!   <p><tt>int compare(size_type pos1, size_type n1,<br>
!   &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT* s) const;<br>
!   int compare(size_type pos1, size_type n1,<br>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT* s,
    size_type n2) const;</tt></p>
  </blockquote>
--- 418,426 ----
  <p>with:</p>
  
  <blockquote>
!   <p><tt>int compare(size_type pos1, size_type n1,<br/>
!   &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT* s) const;<br/>
!   int compare(size_type pos1, size_type n1,<br/>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT* s,
    size_type n2) const;</tt></p>
  </blockquote>
*************** charT* s, size_type n2) const; each defi
*** 1321,1331 ****
  paragraphs 5 and 6 which read:</p>
  
  <blockquote>
!   <p><tt>int compare(size_type pos, size_type n1,<br>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; charT * s, size_type n2
!   = npos) const;<br>
!   </tt>Returns:<tt><br>
!   basic_string&lt;charT,traits,Allocator&gt;(*this, pos, n1).compare(<br>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
    basic_string&lt;charT,traits,Allocator&gt;( s, n2))</tt></p>
  </blockquote>
--- 429,439 ----
  paragraphs 5 and 6 which read:</p>
  
  <blockquote>
!   <p><tt>int compare(size_type pos, size_type n1,<br/>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; charT * s, size_type n2
!   = npos) const;<br/>
!   </tt>Returns:<tt><br/>
!   basic_string&lt;charT,traits,Allocator&gt;(*this, pos, n1).compare(<br/>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
    basic_string&lt;charT,traits,Allocator&gt;( s, n2))</tt></p>
  </blockquote>
*************** paragraphs 5 and 6 which read:</p>
*** 1333,1350 ****
  <p>with:</p>
  
  <blockquote>
!   <p><tt>int compare(size_type pos, size_type n1,<br>
!   &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT * s) const;<br>
!   </tt>Returns:<tt><br>
!   basic_string&lt;charT,traits,Allocator&gt;(*this, pos, n1).compare(<br>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
!   basic_string&lt;charT,traits,Allocator&gt;( s ))<br>
!   <br>
!   int compare(size_type pos, size_type n1,<br>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT * s,
!   size_type n2) const;<br>
!   </tt>Returns:<tt><br>
!   basic_string&lt;charT,traits,Allocator&gt;(*this, pos, n1).compare(<br>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
    basic_string&lt;charT,traits,Allocator&gt;( s, n2))</tt></p>
  </blockquote>
--- 441,458 ----
  <p>with:</p>
  
  <blockquote>
!   <p><tt>int compare(size_type pos, size_type n1,<br/>
!   &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT * s) const;<br/>
!   </tt>Returns:<tt><br/>
!   basic_string&lt;charT,traits,Allocator&gt;(*this, pos, n1).compare(<br/>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
!   basic_string&lt;charT,traits,Allocator&gt;( s ))<br/>
!   <br/>
!   int compare(size_type pos, size_type n1,<br/>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; const charT * s,
!   size_type n2) const;<br/>
!   </tt>Returns:<tt><br/>
!   basic_string&lt;charT,traits,Allocator&gt;(*this, pos, n1).compare(<br/>
    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
    basic_string&lt;charT,traits,Allocator&gt;( s, n2))</tt></p>
  </blockquote>
*************** identified in issues 7 (item 5) and 87.<
*** 1364,1373 ****
  
  <hr>
  <h3><a name="7"></a>7. String clause minor problems</h3>
! <p><b>Section:</b> 21 [strings] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1997-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#strings">issues</a> in [strings].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>(1) In 21.4.6.4 [string::insert], the description of template
  &lt;class InputIterator&gt; insert(iterator, InputIterator,
--- 472,481 ----
  
  <hr>
  <h3><a name="7"></a>7. String clause minor problems</h3>
! <p><b>Section:</b> 21 [strings] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1997-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#strings">issues</a> in [strings].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>(1) In 21.4.6.4 [string::insert], the description of template
  &lt;class InputIterator&gt; insert(iterator, InputIterator,
*************** getting thrown. This is paragraphs 5 and
*** 1393,1400 ****
  21.4.6.8 [string::swap]</p>
  
  <p>(6) In table 37, in section 21.2.1 [char.traits.require],
! there's a note for X::move(s, p, n). It says "Copies correctly
! even where p is in [s, s+n)". This is correct as far as it goes,
  but it doesn't go far enough; it should also guarantee that the copy
  is correct even where s in in [p, p+n). These are two orthogonal
  guarantees, and neither one follows from the other. Both guarantees
--- 501,508 ----
  21.4.6.8 [string::swap]</p>
  
  <p>(6) In table 37, in section 21.2.1 [char.traits.require],
! there's a note for X::move(s, p, n). It says &quot;Copies correctly
! even where p is in [s, s+n)&quot;. This is correct as far as it goes,
  but it doesn't go far enough; it should also guarantee that the copy
  is correct even where s in in [p, p+n). These are two orthogonal
  guarantees, and neither one follows from the other. Both guarantees
*************** useful. </p>
*** 1405,1443 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>ITEM 1: In 21.3.5.4 [lib.string::insert], change paragraph 16 to <br>
! <br>
! &nbsp;&nbsp;&nbsp; EFFECTS: Equivalent to insert(p - begin(), basic_string(first, last)).<br>
! <br>
  ITEM 2:&nbsp; Not a defect; the Standard is clear.. There are ten versions of replace() in
! the synopsis, and ten versions in 21.3.5.6 [lib.string::replace].<br>
! <br>
  ITEM 3: Change the declaration of push_back in the string synopsis (21.3,
  [lib.basic.string]) from:</p>
  
! <p>&nbsp;&nbsp;&nbsp;&nbsp; void push_back(const charT)<br>
! <br>
! to<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp; void push_back(charT)<br>
! <br>
! Add the following text immediately after 21.3.5.2 [lib.string::append], paragraph 10.<br>
! <br>
! &nbsp;&nbsp;&nbsp; void basic_string::push_back(charT c);<br>
! &nbsp;&nbsp;&nbsp; EFFECTS: Equivalent to append(static_cast&lt;size_type&gt;(1), c);<br>
! <br>
! ITEM 4: Not a defect. The omission appears to have been deliberate.<br>
! <br>
! ITEM 5: Duplicate; see issue 5 (and 87).<br>
! <br>
! ITEM 6: In table 37, Replace:<br>
! <br>
! &nbsp;&nbsp;&nbsp; "Copies correctly even where p is in [s, s+n)."<br>
! <br>
! with:<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp; "Copies correctly even where the ranges [p, p+n) and [s,
! s+n) overlap."</p>
  
  
  
--- 513,551 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>ITEM 1: In 21.3.5.4 [lib.string::insert], change paragraph 16 to <br/>
! <br/>
! &nbsp;&nbsp;&nbsp; EFFECTS: Equivalent to insert(p - begin(), basic_string(first, last)).<br/>
! <br/>
  ITEM 2:&nbsp; Not a defect; the Standard is clear.. There are ten versions of replace() in
! the synopsis, and ten versions in 21.3.5.6 [lib.string::replace].<br/>
! <br/>
  ITEM 3: Change the declaration of push_back in the string synopsis (21.3,
  [lib.basic.string]) from:</p>
  
! <p>&nbsp;&nbsp;&nbsp;&nbsp; void push_back(const charT)<br/>
! <br/>
! to<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp; void push_back(charT)<br/>
! <br/>
! Add the following text immediately after 21.3.5.2 [lib.string::append], paragraph 10.<br/>
! <br/>
! &nbsp;&nbsp;&nbsp; void basic_string::push_back(charT c);<br/>
! &nbsp;&nbsp;&nbsp; EFFECTS: Equivalent to append(static_cast&lt;size_type&gt;(1), c);<br/>
! <br/>
! ITEM 4: Not a defect. The omission appears to have been deliberate.<br/>
! <br/>
! ITEM 5: Duplicate; see issue 5 (and 87).<br/>
! <br/>
! ITEM 6: In table 37, Replace:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp; &quot;Copies correctly even where p is in [s, s+n).&quot;<br/>
! <br/>
! with:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp; &quot;Copies correctly even where the ranges [p, p+n) and [s,
! s+n) overlap.&quot;</p>
  
  
  
*************** s+n) overlap."</p>
*** 1445,1453 ****
  
  <hr>
  <h3><a name="8"></a>8. Locale::global lacks guarantee</h3>
! <p><b>Section:</b> 22.3.1.5 [locale.statics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1997-12-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It appears there's an important guarantee missing from clause
  22. We're told that invoking locale::global(L) sets the C locale if L
--- 553,561 ----
  
  <hr>
  <h3><a name="8"></a>8. Locale::global lacks guarantee</h3>
! <p><b>Section:</b> 22.3.1.5 [locale.statics] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1997-12-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It appears there's an important guarantee missing from clause
  22. We're told that invoking locale::global(L) sets the C locale if L
*************** paragraph 2:&nbsp; </p>
*** 1474,1483 ****
  
  <hr>
  <h3><a name="9"></a>9. Operator new(0) calls should not yield the same pointer</h3>
! <p><b>Section:</b> 18.6.1 [new.delete] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-01-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#new.delete">issues</a> in [new.delete].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Scott Meyers, in a comp.std.c++ posting: I just noticed that
  section 3.7.3.1 of CD2 seems to allow for the possibility that all
--- 582,591 ----
  
  <hr>
  <h3><a name="9"></a>9. Operator new(0) calls should not yield the same pointer</h3>
! <p><b>Section:</b> 18.6.1 [new.delete] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-01-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete">issues</a> in [new.delete].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Scott Meyers, in a comp.std.c++ posting: I just noticed that
  section 3.7.3.1 of CD2 seems to allow for the possibility that all
*************** supporting to the proposed resolution.</
*** 1542,1551 ****
  
  <hr>
  <h3><a name="11"></a>11. Bitset minor problems</h3>
! <p><b>Section:</b> 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-01-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>(1) bitset&lt;&gt;::operator[] is mentioned in the class synopsis (23.3.5), but it is
  not documented in 23.3.5.2. </p>
--- 650,660 ----
  
  <hr>
  <h3><a name="11"></a>11. Bitset minor problems</h3>
! <p><b>Section:</b> 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-01-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>(1) bitset&lt;&gt;::operator[] is mentioned in the class synopsis (23.3.5), but it is
  not documented in 23.3.5.2. </p>
*************** go in the Effects clause.</p>
*** 1560,1589 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>ITEMS 1 AND 2:<br>
! <br>
! In the bitset synopsis (20.5 [template.bitset]), 
! replace the member function <br>
! <br>
! <tt>&nbsp;&nbsp;&nbsp; reference operator[](size_t pos);<br>
! </tt><br>
! with the two member functions<br>
! <br>
! <tt>&nbsp;&nbsp;&nbsp; bool operator[](size_t pos) const; <br>
! &nbsp;&nbsp;&nbsp; reference operator[](size_t pos); <br>
! </tt><br>
! Add the following text at the end of 20.5.2 [bitset.members], 
  immediately after paragraph 45:</p>
  
  <blockquote>
!   <p><tt>bool operator[](size_t pos) const;</tt><br>
!   Requires: pos is valid<br>
!   Throws: nothing<br>
!   Returns: <tt>test(pos)</tt><br>
!   <br>
!   <tt>bitset&lt;N&gt;::reference operator[](size_t pos);</tt> <br>
!   Requires: pos is valid<br>
!   Throws: nothing<br>
    Returns: An object of type <tt>bitset&lt;N&gt;::reference</tt> such that <tt>(*this)[pos]
    == this-&gt;test(pos)</tt>, and such that <tt>(*this)[pos] = val</tt> is equivalent to <tt>this-&gt;set(pos,
    val);</tt></p>
--- 669,698 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>ITEMS 1 AND 2:<br/>
! <br/>
! In the bitset synopsis (20.6 [template.bitset]), 
! replace the member function <br/>
! <br/>
! <tt>&nbsp;&nbsp;&nbsp; reference operator[](size_t pos);<br/>
! </tt><br/>
! with the two member functions<br/>
! <br/>
! <tt>&nbsp;&nbsp;&nbsp; bool operator[](size_t pos) const; <br/>
! &nbsp;&nbsp;&nbsp; reference operator[](size_t pos); <br/>
! </tt><br/>
! Add the following text at the end of 20.6.2 [bitset.members], 
  immediately after paragraph 45:</p>
  
  <blockquote>
!   <p><tt>bool operator[](size_t pos) const;</tt><br/>
!   Requires: pos is valid<br/>
!   Throws: nothing<br/>
!   Returns: <tt>test(pos)</tt><br/>
!   <br/>
!   <tt>bitset&lt;N&gt;::reference operator[](size_t pos);</tt> <br/>
!   Requires: pos is valid<br/>
!   Throws: nothing<br/>
    Returns: An object of type <tt>bitset&lt;N&gt;::reference</tt> such that <tt>(*this)[pos]
    == this-&gt;test(pos)</tt>, and such that <tt>(*this)[pos] = val</tt> is equivalent to <tt>this-&gt;set(pos,
    val);</tt></p>
*************** immediately after paragraph 45:</p>
*** 1591,1598 ****
  
  
  <p><b>Rationale:</b></p>
! <p>The LWG believes Item 3 is not a defect. "Formatted
! input" implies the desired semantics. See 27.7.1.2 [istream.formatted].
  </p>
  
  
--- 700,707 ----
  
  
  <p><b>Rationale:</b></p>
! <p>The LWG believes Item 3 is not a defect. &quot;Formatted
! input&quot; implies the desired semantics. See 27.7.2.2 [istream.formatted].
  </p>
  
  
*************** input" implies the desired semantics. Se
*** 1601,1619 ****
  
  <hr>
  <h3><a name="13"></a>13. Eos refuses to die</h3>
! <p><b>Section:</b> 27.7.1.2.3 [istream::extractors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> William M. Miller <b>Opened:</b> 1998-03-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 27.6.1.2.3, there is a reference to "eos", which is
  the only one in the whole draft (at least using Acrobat search), so
  it's undefined. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.1.2.3 [istream::extractors], replace "eos" with
! "charT()"</p>
  
  
  
--- 710,728 ----
  
  <hr>
  <h3><a name="13"></a>13. Eos refuses to die</h3>
! <p><b>Section:</b> 27.7.2.2.3 [istream::extractors] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> William M. Miller <b>Opened:</b> 1998-03-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 27.6.1.2.3, there is a reference to &quot;eos&quot;, which is
  the only one in the whole draft (at least using Acrobat search), so
  it's undefined. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.2.2.3 [istream::extractors], replace &quot;eos&quot; with
! &quot;charT()&quot;</p>
  
  
  
*************** it's undefined. </p>
*** 1621,1646 ****
  
  <hr>
  <h3><a name="14"></a>14. Locale::combine should be const</h3>
! <p><b>Section:</b> 22.3.1.3 [locale.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.members">issues</a> in [locale.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>locale::combine is the only member function of locale (other than constructors and
  destructor) that is not const. There is no reason for it not to be const, and good reasons
  why it should have been const. Furthermore, leaving it non-const conflicts with 22.1.1
! paragraph 6: "An instance of a locale is immutable." </p>
  
  <p>History: this member function originally was a constructor. it happened that the
  interface it specified had no corresponding language syntax, so it was changed to a member
! function. As constructors are never const, there was no "const" in the interface
! which was transformed into member "combine". It should have been added at that
  time, but the omission was not noticed. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.3.1 [locale] and also in 22.3.1.3 [locale.members], add 
! "const" to the declaration of member combine: </p>
  <blockquote>
    <pre>template &lt;class Facet&gt; locale combine(const locale&amp; other) const; </pre>
  </blockquote>
--- 730,755 ----
  
  <hr>
  <h3><a name="14"></a>14. Locale::combine should be const</h3>
! <p><b>Section:</b> 22.3.1.3 [locale.members] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.members">issues</a> in [locale.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>locale::combine is the only member function of locale (other than constructors and
  destructor) that is not const. There is no reason for it not to be const, and good reasons
  why it should have been const. Furthermore, leaving it non-const conflicts with 22.1.1
! paragraph 6: &quot;An instance of a locale is immutable.&quot; </p>
  
  <p>History: this member function originally was a constructor. it happened that the
  interface it specified had no corresponding language syntax, so it was changed to a member
! function. As constructors are never const, there was no &quot;const&quot; in the interface
! which was transformed into member &quot;combine&quot;. It should have been added at that
  time, but the omission was not noticed. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.3.1 [locale] and also in 22.3.1.3 [locale.members], add 
! &quot;const&quot; to the declaration of member combine: </p>
  <blockquote>
    <pre>template &lt;class Facet&gt; locale combine(const locale&amp; other) const; </pre>
  </blockquote>
*************** time, but the omission was not noticed.
*** 1651,1660 ****
  
  <hr>
  <h3><a name="15"></a>15. Locale::name requirement inconsistent</h3>
! <p><b>Section:</b> 22.3.1.3 [locale.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.members">issues</a> in [locale.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>locale::name() is described as returning a string that can be passed to a locale
  constructor, but there is no matching constructor. </p>
--- 760,769 ----
  
  <hr>
  <h3><a name="15"></a>15. Locale::name requirement inconsistent</h3>
! <p><b>Section:</b> 22.3.1.3 [locale.members] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.members">issues</a> in [locale.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>locale::name() is described as returning a string that can be passed to a locale
  constructor, but there is no matching constructor. </p>
*************** constructor, but there is no matching co
*** 1662,1669 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.3.1.3 [locale.members], paragraph 5, replace
! "<tt>locale(name())</tt>" with
! "<tt>locale(name().c_str())</tt>".
  </p>
  
  
--- 771,778 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.3.1.3 [locale.members], paragraph 5, replace
! &quot;<tt>locale(name())</tt>&quot; with
! &quot;<tt>locale(name().c_str())</tt>&quot;.
  </p>
  
  
*************** constructor, but there is no matching co
*** 1672,1681 ****
  
  <hr>
  <h3><a name="16"></a>16. Bad ctype_byname&lt;char&gt; decl</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The new virtual members ctype_byname&lt;char&gt;::do_widen and do_narrow did not get
  edited in properly. Instead, the member do_widen appears four times, with wrong argument
--- 781,790 ----
  
  <hr>
  <h3><a name="16"></a>16. Bad ctype_byname&lt;char&gt; decl</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The new virtual members ctype_byname&lt;char&gt;::do_widen and do_narrow did not get
  edited in properly. Instead, the member do_widen appears four times, with wrong argument
*************** from 22.4.1.3 [facet.ctype.special].</p>
*** 1693,1714 ****
  
  <hr>
  <h3><a name="17"></a>17. Bad bool parsing</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This section describes the process of parsing a text boolean value from the input
! stream. It does not say it recognizes either of the sequences "true" or
! "false" and returns the corresponding bool value; instead, it says it recognizes
  only one of those sequences, and chooses which according to the received value of a
  reference argument intended for returning the result, and reports an error if the other
  sequence is found. (!) Furthermore, it claims to get the names from the ctype&lt;&gt;
! facet rather than the numpunct&lt;&gt; facet, and it examines the "boolalpha"
! flag wrongly; it doesn't define the value "loc"; and finally, it computes
! wrongly whether to use numeric or "alpha" parsing.<br>
! <br>
! I believe the correct algorithm is "as if": </p>
  
  <pre>  // in, err, val, and str are arguments.
    err = 0;
--- 802,824 ----
  
  <hr>
  <h3><a name="17"></a>17. Bad bool parsing</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This section describes the process of parsing a text boolean value from the input
! stream. It does not say it recognizes either of the sequences &quot;true&quot; or
! &quot;false&quot; and returns the corresponding bool value; instead, it says it recognizes
  only one of those sequences, and chooses which according to the received value of a
  reference argument intended for returning the result, and reports an error if the other
  sequence is found. (!) Furthermore, it claims to get the names from the ctype&lt;&gt;
! facet rather than the numpunct&lt;&gt; facet, and it examines the &quot;boolalpha&quot;
! flag wrongly; it doesn't define the value &quot;loc&quot;; and finally, it computes
! wrongly whether to use numeric or &quot;alpha&quot; parsing.<br/>
! <br/>
! I believe the correct algorithm is &quot;as if&quot;: </p>
  
  <pre>  // in, err, val, and str are arguments.
    err = 0;
*************** code above.</p>
*** 1742,1754 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.4.2.1.2 [facet.num.get.virtuals], in the first line of paragraph 14,
! change "&amp;&amp;" to "&amp;".</p>
  
  <p>Then, replace paragraphs 15 and 16 as follows:</p>
  
  <blockquote>
  
!   <p>Otherwise target sequences are determined "as if" by
    calling the members <tt>falsename()</tt> and
    <tt>truename()</tt> of the facet obtained by
    <tt>use_facet&lt;numpunct&lt;charT&gt;&nbsp;&gt;(str.getloc())</tt>.  
--- 852,864 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.4.2.1.2 [facet.num.get.virtuals], in the first line of paragraph 14,
! change &quot;&amp;&amp;&quot; to &quot;&amp;&quot;.</p>
  
  <p>Then, replace paragraphs 15 and 16 as follows:</p>
  
  <blockquote>
  
!   <p>Otherwise target sequences are determined &quot;as if&quot; by
    calling the members <tt>falsename()</tt> and
    <tt>truename()</tt> of the facet obtained by
    <tt>use_facet&lt;numpunct&lt;charT&gt;&nbsp;&gt;(str.getloc())</tt>.  
*************** change "&amp;&amp;" to "&amp;".</p>
*** 1769,1780 ****
    <tt>(in==end)</tt>. If <tt>val</tt> is not set, then <i>err</i> is set to <tt>str.failbit</tt>; or to
    <tt>(str.failbit|str.eofbit)</tt>if
    the reason for the failure was that <tt>(in==end)</tt>. [Example: for targets
!   <tt>true</tt>:"a" and <tt>false</tt>:"abb", the input sequence "a" yields
!   <tt>val==true</tt> and <tt>err==str.eofbit</tt>; the input sequence "abc" yields
    <tt>err=str.failbit</tt>, with <tt>in</tt> ending at the 'c' element. For targets
!   <tt>true</tt>:"1"
!   and <tt>false</tt>:"0", the input sequence "1" yields <tt>val==true</tt>
!   and <tt>err=str.goodbit</tt>. For empty targets (""), any input sequence yields
    <tt>err==str.failbit</tt>. --end example]</p>
  </blockquote>
  
--- 879,890 ----
    <tt>(in==end)</tt>. If <tt>val</tt> is not set, then <i>err</i> is set to <tt>str.failbit</tt>; or to
    <tt>(str.failbit|str.eofbit)</tt>if
    the reason for the failure was that <tt>(in==end)</tt>. [Example: for targets
!   <tt>true</tt>:&quot;a&quot; and <tt>false</tt>:&quot;abb&quot;, the input sequence &quot;a&quot; yields
!   <tt>val==true</tt> and <tt>err==str.eofbit</tt>; the input sequence &quot;abc&quot; yields
    <tt>err=str.failbit</tt>, with <tt>in</tt> ending at the 'c' element. For targets
!   <tt>true</tt>:&quot;1&quot;
!   and <tt>false</tt>:&quot;0&quot;, the input sequence &quot;1&quot; yields <tt>val==true</tt>
!   and <tt>err=str.goodbit</tt>. For empty targets (&quot;&quot;), any input sequence yields
    <tt>err==str.failbit</tt>. --end example]</p>
  </blockquote>
  
*************** change "&amp;&amp;" to "&amp;".</p>
*** 1784,1793 ****
  
  <hr>
  <h3><a name="18"></a>18. Get(...bool&amp;) omitted</h3>
! <p><b>Section:</b> 22.4.2.1.1 [facet.num.get.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.members">issues</a> in [facet.num.get.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In the list of num_get&lt;&gt; non-virtual members on page 22-23, the member
  that parses bool values was omitted from the list of definitions of non-virtual
--- 894,903 ----
  
  <hr>
  <h3><a name="18"></a>18. Get(...bool&amp;) omitted</h3>
! <p><b>Section:</b> 22.4.2.1.1 [facet.num.get.members] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.members">issues</a> in [facet.num.get.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In the list of num_get&lt;&gt; non-virtual members on page 22-23, the member
  that parses bool values was omitted from the list of definitions of non-virtual
*************** another get member for bool&amp;, copied
*** 1805,1821 ****
  
  
  <hr>
! <h3><a name="19"></a>19. "Noconv" definition too vague</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#10">10</a></p>
  <p><b>Discussion:</b></p>
  <p>
  In the definitions of codecvt&lt;&gt;::do_out and do_in, they are
! specified to return noconv if "no conversion is
! needed". This definition is too vague, and does not say
  normatively what is done with the buffers.
  </p>
  
--- 915,931 ----
  
  
  <hr>
! <h3><a name="19"></a>19. &quot;Noconv&quot; definition too vague</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#10">10</a></p>
  <p><b>Discussion:</b></p>
  <p>
  In the definitions of codecvt&lt;&gt;::do_out and do_in, they are
! specified to return noconv if &quot;no conversion is
! needed&quot;. This definition is too vague, and does not say
  normatively what is done with the buffers.
  </p>
  
*************** Change the entry for noconv in the table
*** 1843,1861 ****
  
  <hr>
  <h3><a name="20"></a>20. Thousands_sep returns wrong type</h3>
! <p><b>Section:</b> 22.4.3.1.2 [facet.numpunct.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The synopsis for numpunct&lt;&gt;::do_thousands_sep, and the
  definition of numpunct&lt;&gt;::thousands_sep which calls it, specify
  that it returns a value of type char_type. Here it is erroneously
! described as returning a "string_type". </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.4.3.1.2 [facet.numpunct.virtuals], above paragraph 2, change 
! "string_type" to "char_type". </p>
  
  
  
--- 953,971 ----
  
  <hr>
  <h3><a name="20"></a>20. Thousands_sep returns wrong type</h3>
! <p><b>Section:</b> 22.4.3.1.2 [facet.numpunct.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The synopsis for numpunct&lt;&gt;::do_thousands_sep, and the
  definition of numpunct&lt;&gt;::thousands_sep which calls it, specify
  that it returns a value of type char_type. Here it is erroneously
! described as returning a &quot;string_type&quot;. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.4.3.1.2 [facet.numpunct.virtuals], above paragraph 2, change 
! &quot;string_type&quot; to &quot;char_type&quot;. </p>
  
  
  
*************** described as returning a "string_type".
*** 1863,1882 ****
  
  <hr>
  <h3><a name="21"></a>21. Codecvt_byname&lt;&gt; instantiations</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In the second table in the section, captioned "Required
! instantiations", the instantiations for codecvt_byname&lt;&gt;
  have been omitted. These are necessary to allow users to construct a
  locale by name from facets. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Add in 22.3.1.1.1 [locale.category] to the table captioned
! "Required instantiations", in the category "ctype"
  the lines </p>
  
  <blockquote>
--- 973,992 ----
  
  <hr>
  <h3><a name="21"></a>21. Codecvt_byname&lt;&gt; instantiations</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In the second table in the section, captioned &quot;Required
! instantiations&quot;, the instantiations for codecvt_byname&lt;&gt;
  have been omitted. These are necessary to allow users to construct a
  locale by name from facets. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Add in 22.3.1.1.1 [locale.category] to the table captioned
! &quot;Required instantiations&quot;, in the category &quot;ctype&quot;
  the lines </p>
  
  <blockquote>
*************** codecvt_byname&lt;wchar_t,char,mbstate_t
*** 1890,1899 ****
  
  <hr>
  <h3><a name="22"></a>22. Member open vs. flags</h3>
! <p><b>Section:</b> 27.9.1.9 [ifstream.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ifstream.members">issues</a> in [ifstream.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of basic_istream&lt;&gt;::open leaves unanswered questions about how it
  responds to or changes flags in the error status for the stream. A strict reading
--- 1000,1009 ----
  
  <hr>
  <h3><a name="22"></a>22. Member open vs. flags</h3>
! <p><b>Section:</b> 27.9.1.9 [ifstream.members] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ifstream.members">issues</a> in [ifstream.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of basic_istream&lt;&gt;::open leaves unanswered questions about how it
  responds to or changes flags in the error status for the stream. A strict reading
*************** believes to have been the original inten
*** 1930,1939 ****
  
  <hr>
  <h3><a name="23"></a>23. Num_get overflow result</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The current description of numeric input does not account for the
  possibility of overflow. This is an implicit result of changing the
--- 1040,1050 ----
  
  <hr>
  <h3><a name="23"></a>23. Num_get overflow result</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The current description of numeric input does not account for the
  possibility of overflow. This is an implicit result of changing the
*************** Change 22.4.2.1.2 [facet.num.get.virtual
*** 2092,2098 ****
  </p>
  
  <blockquote>
! <pre>iter_type do_get(iter_type <i>in</i>, iter_type <i>end</i>, ios_base&amp; <i>str</i>, 
                   ios_base::iostate&amp; <i>err</i>, bool&amp; <i>val</i>) const;
  </pre>
  <blockquote>
--- 1203,1210 ----
  </p>
  
  <blockquote>
! <pre>
! iter_type do_get(iter_type <i>in</i>, iter_type <i>end</i>, ios_base&amp; <i>str</i>, 
                   ios_base::iostate&amp; <i>err</i>, bool&amp; <i>val</i>) const;
  </pre>
  <blockquote>
*************** is assigned to <i>err</i>.</ins>
*** 2127,2149 ****
  
  
  <hr>
! <h3><a name="24"></a>24. "do_convert" doesn't exist</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#72">72</a></p>
  <p><b>Discussion:</b></p>
  <p>The description of codecvt&lt;&gt;::do_out and do_in mentions a
! symbol "do_convert" which is not defined in the
! standard. This is a leftover from an edit, and should be "do_in
! and do_out". </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.4.1.4 [locale.codecvt], paragraph 3, change
! "do_convert" to "do_in or do_out". Also, in 22.4.1.4.2 [locale.codecvt.virtuals], change "do_convert()" to "do_in
! or do_out". </p>
  
  
  
--- 1239,1261 ----
  
  
  <hr>
! <h3><a name="24"></a>24. &quot;do_convert&quot; doesn't exist</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#72">72</a></p>
  <p><b>Discussion:</b></p>
  <p>The description of codecvt&lt;&gt;::do_out and do_in mentions a
! symbol &quot;do_convert&quot; which is not defined in the
! standard. This is a leftover from an edit, and should be &quot;do_in
! and do_out&quot;. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.4.1.4 [locale.codecvt], paragraph 3, change
! &quot;do_convert&quot; to &quot;do_in or do_out&quot;. Also, in 22.4.1.4.2 [locale.codecvt.virtuals], change &quot;do_convert()&quot; to &quot;do_in
! or do_out&quot;. </p>
  
  
  
*************** or do_out". </p>
*** 2151,2177 ****
  
  <hr>
  <h3><a name="25"></a>25. String operator&lt;&lt; uses width() value wrong</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#67">67</a></p>
  <p><b>Discussion:</b></p>
  <p>In the description of operator&lt;&lt; applied to strings, the standard says that uses
! the smaller of os.width() and str.size(), to pad "as described in stage 3"
  elsewhere; but this is inconsistent, as this allows no possibility of space for padding. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 21.4.8.9 [string.io]  paragraph 4 from:<br>
! <br>
! &nbsp;&nbsp;&nbsp; "... where <tt>n</tt> is the smaller of <tt>os.width()</tt> and <tt>str.size()</tt>;
! ..."<br>
! <br>
! to: <br>
! <br>
! &nbsp;&nbsp;&nbsp; "... where <tt>n</tt> is the larger of <tt>os.width()</tt> and <tt>str.size()</tt>;
! ..."</p>
  
  
  
--- 1263,1289 ----
  
  <hr>
  <h3><a name="25"></a>25. String operator&lt;&lt; uses width() value wrong</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#67">67</a></p>
  <p><b>Discussion:</b></p>
  <p>In the description of operator&lt;&lt; applied to strings, the standard says that uses
! the smaller of os.width() and str.size(), to pad &quot;as described in stage 3&quot;
  elsewhere; but this is inconsistent, as this allows no possibility of space for padding. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 21.4.8.9 [string.io]  paragraph 4 from:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp; &quot;... where <tt>n</tt> is the smaller of <tt>os.width()</tt> and <tt>str.size()</tt>;
! ...&quot;<br/>
! <br/>
! to: <br/>
! <br/>
! &nbsp;&nbsp;&nbsp; &quot;... where <tt>n</tt> is the larger of <tt>os.width()</tt> and <tt>str.size()</tt>;
! ...&quot;</p>
  
  
  
*************** to: <br>
*** 2179,2188 ****
  
  <hr>
  <h3><a name="26"></a>26. Bad sentry example</h3>
! <p><b>Section:</b> 27.7.1.1.3 [istream::sentry] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In paragraph 6, the code in the example: </p>
  
--- 1291,1300 ----
  
  <hr>
  <h3><a name="26"></a>26. Bad sentry example</h3>
! <p><b>Section:</b> 27.7.2.1.3 [istream::sentry] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In paragraph 6, the code in the example: </p>
  
*************** sequence without examining it.) </p>
*** 2209,2215 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove the example above from 27.7.1.1.3 [istream::sentry]
  paragraph 6.</p>
  
  
--- 1321,1327 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove the example above from 27.7.2.1.3 [istream::sentry]
  paragraph 6.</p>
  
  
*************** example, which might well still contain
*** 2227,2240 ****
  
  <hr>
  <h3><a name="27"></a>27. String::erase(range) yields wrong iterator</h3>
! <p><b>Section:</b> 21.4.6.5 [string::erase] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::erase">issues</a> in [string::erase].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The string::erase(iterator first, iterator last) is specified to return an element one
  place beyond the next element after the last one erased. E.g. for the string
! "abcde", erasing the range ['b'..'d') would yield an iterator for element 'e',
  while 'd' has not been erased. </p>
  
  
--- 1339,1352 ----
  
  <hr>
  <h3><a name="27"></a>27. String::erase(range) yields wrong iterator</h3>
! <p><b>Section:</b> 21.4.6.5 [string::erase] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::erase">issues</a> in [string::erase].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The string::erase(iterator first, iterator last) is specified to return an element one
  place beyond the next element after the last one erased. E.g. for the string
! &quot;abcde&quot;, erasing the range ['b'..'d') would yield an iterator for element 'e',
  while 'd' has not been erased. </p>
  
  
*************** while 'd' has not been erased. </p>
*** 2259,2269 ****
  
  <hr>
  <h3><a name="28"></a>28. Ctype&lt;char&gt;is ambiguous</h3>
! <p><b>Section:</b> 22.4.1.3.2 [facet.ctype.char.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.ctype.char.members">issues</a> in [facet.ctype.char.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#236">236</a></p>
  <p><b>Discussion:</b></p>
  <p>The description of the vector form of ctype&lt;char&gt;::is can be interpreted to mean
  something very different from what was intended. Paragraph 4 says </p>
--- 1371,1381 ----
  
  <hr>
  <h3><a name="28"></a>28. Ctype&lt;char&gt;is ambiguous</h3>
! <p><b>Section:</b> 22.4.1.3.2 [facet.ctype.char.members] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.ctype.char.members">issues</a> in [facet.ctype.char.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#236">236</a></p>
  <p><b>Discussion:</b></p>
  <p>The description of the vector form of ctype&lt;char&gt;::is can be interpreted to mean
  something very different from what was intended. Paragraph 4 says </p>
*************** vec[]. </p>
*** 2291,2311 ****
  
  <hr>
  <h3><a name="29"></a>29. Ios_base::init doesn't exist</h3>
! <p><b>Section:</b> 27.4.1 [narrow.stream.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#narrow.stream.objects">issues</a> in [narrow.stream.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Sections 27.4.1 [narrow.stream.objects] and 27.4.2 [wide.stream.objects] mention
  a function ios_base::init, which is not defined. Probably they mean
! basic_ios&lt;&gt;::init, defined in 27.5.4.1 [basic.ios.cons],
  paragraph 3. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>[R12: modified to include paragraph 5.]</p>
  
! <p>In 27.4.1 [narrow.stream.objects] paragraph 2 and 5, change </p>
  
  <blockquote>
    <p>ios_base::init </p>
--- 1403,1423 ----
  
  <hr>
  <h3><a name="29"></a>29. Ios_base::init doesn't exist</h3>
! <p><b>Section:</b> 27.4.2 [narrow.stream.objects] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#narrow.stream.objects">issues</a> in [narrow.stream.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Sections 27.4.2 [narrow.stream.objects] and 27.4.3 [wide.stream.objects] mention
  a function ios_base::init, which is not defined. Probably they mean
! basic_ios&lt;&gt;::init, defined in 27.5.5.2 [basic.ios.cons],
  paragraph 3. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>[R12: modified to include paragraph 5.]</p>
  
! <p>In 27.4.2 [narrow.stream.objects] paragraph 2 and 5, change </p>
  
  <blockquote>
    <p>ios_base::init </p>
*************** paragraph 3. </p>
*** 2317,2323 ****
    <p>basic_ios&lt;char&gt;::init </p>
  </blockquote>
  
! <p>Also, make a similar change in 27.4.2 [wide.stream.objects] except it
  should read </p>
  
  <blockquote>
--- 1429,1435 ----
    <p>basic_ios&lt;char&gt;::init </p>
  </blockquote>
  
! <p>Also, make a similar change in 27.4.3 [wide.stream.objects] except it
  should read </p>
  
  <blockquote>
*************** should read </p>
*** 2330,2339 ****
  
  <hr>
  <h3><a name="30"></a>30. Wrong header for LC_*</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 2 implies that the C macros LC_CTYPE etc. are defined in &lt;cctype&gt;,
  where they are in fact defined elsewhere to appear in &lt;clocale&gt;. </p>
--- 1442,1451 ----
  
  <hr>
  <h3><a name="30"></a>30. Wrong header for LC_*</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 2 implies that the C macros LC_CTYPE etc. are defined in &lt;cctype&gt;,
  where they are in fact defined elsewhere to appear in &lt;clocale&gt;. </p>
*************** where they are in fact defined elsewhere
*** 2341,2347 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.3.1.1.1 [locale.category], paragraph 2, change
! "&lt;cctype&gt;" to read "&lt;clocale&gt;". </p>
  
  
  
--- 1453,1459 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.3.1.1.1 [locale.category], paragraph 2, change
! &quot;&lt;cctype&gt;&quot; to read &quot;&lt;clocale&gt;&quot;. </p>
  
  
  
*************** where they are in fact defined elsewhere
*** 2349,2363 ****
  
  <hr>
  <h3><a name="31"></a>31. Immutable locale values</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#378">378</a></p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 6, says "An instance of <tt>locale</tt> is
  <i>immutable</i>; once a facet reference is obtained from it,
! ...". This has caused some confusion, because locale variables
  are manifestly assignable. </p>
  
  
--- 1461,1475 ----
  
  <hr>
  <h3><a name="31"></a>31. Immutable locale values</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#378">378</a></p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 6, says &quot;An instance of <tt>locale</tt> is
  <i>immutable</i>; once a facet reference is obtained from it,
! ...&quot;. This has caused some confusion, because locale variables
  are manifestly assignable. </p>
  
  
*************** are manifestly assignable. </p>
*** 2385,2393 ****
  
  <hr>
  <h3><a name="32"></a>32. Pbackfail description inconsistent</h3>
! <p><b>Section:</b> 27.6.2.4.4 [streambuf.virt.pback] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of the required state before calling virtual member
  basic_streambuf&lt;&gt;::pbackfail requirements is inconsistent with the conditions
--- 1497,1505 ----
  
  <hr>
  <h3><a name="32"></a>32. Pbackfail description inconsistent</h3>
! <p><b>Section:</b> 27.6.3.4.4 [streambuf.virt.pback] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of the required state before calling virtual member
  basic_streambuf&lt;&gt;::pbackfail requirements is inconsistent with the conditions
*************** Specifically, the latter says it calls p
*** 2404,2419 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.6.2.4.4 [streambuf.virt.pback], paragraph 1, change:</p>
  
  <blockquote>
!   <p>"<tt>traits::eq(*gptr(),traits::to_char_type( c))</tt>"</p>
  </blockquote>
  
  <p>to </p>
  
  <blockquote>
!   <p>"<tt>traits::eq(traits::to_char_type(c),gptr()[-1])</tt>"
    </p>
  </blockquote>
  
--- 1516,1531 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.6.3.4.4 [streambuf.virt.pback], paragraph 1, change:</p>
  
  <blockquote>
!   <p>&quot;<tt>traits::eq(*gptr(),traits::to_char_type( c))</tt>&quot;</p>
  </blockquote>
  
  <p>to </p>
  
  <blockquote>
!   <p>&quot;<tt>traits::eq(traits::to_char_type(c),gptr()[-1])</tt>&quot;
    </p>
  </blockquote>
  
*************** the argument value.</p>
*** 2428,2438 ****
  
  <hr>
  <h3><a name="33"></a>33. Codecvt&lt;&gt; mentions from_type</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#43">43</a></p>
  <p><b>Discussion:</b></p>
  <p>In the table defining the results from do_out and do_in, the specification for the
  result <i>error</i> says </p>
--- 1540,1550 ----
  
  <hr>
  <h3><a name="33"></a>33. Codecvt&lt;&gt; mentions from_type</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#43">43</a></p>
  <p><b>Discussion:</b></p>
  <p>In the table defining the results from do_out and do_in, the specification for the
  result <i>error</i> says </p>
*************** in the table for the case of _error_ wit
*** 2459,2468 ****
  
  <hr>
  <h3><a name="34"></a>34. True/falsename() not in ctype&lt;&gt;</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In paragraph 19, Effects:, members truename() and falsename are used from facet
  ctype&lt;charT&gt;, but it has no such members. Note that this is also a problem in
--- 1571,1580 ----
  
  <hr>
  <h3><a name="34"></a>34. True/falsename() not in ctype&lt;&gt;</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In paragraph 19, Effects:, members truename() and falsename are used from facet
  ctype&lt;charT&gt;, but it has no such members. Note that this is also a problem in
*************** string_type s = val ? np.truename() : np
*** 2485,2503 ****
  
  <hr>
  <h3><a name="35"></a>35. No manipulator unitbuf in synopsis</h3>
! <p><b>Section:</b> 27.5 [iostreams.base] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostreams.base">issues</a> in [iostreams.base].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 27.5.5.1 [fmtflags.manip], we have a definition for a manipulator
! named "unitbuf". Unlike other manipulators, it's not listed
! in synopsis. Similarly for "nounitbuf". </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Add to the synopsis for &lt;ios&gt; in 27.5 [iostreams.base], after
! the entry for "nouppercase", the prototypes: </p>
  
  <blockquote>
    <pre>ios_base&amp; unitbuf(ios_base&amp; str);
--- 1597,1615 ----
  
  <hr>
  <h3><a name="35"></a>35. No manipulator unitbuf in synopsis</h3>
! <p><b>Section:</b> 27.5 [iostreams.base] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostreams.base">issues</a> in [iostreams.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 27.5.6.1 [fmtflags.manip], we have a definition for a manipulator
! named &quot;unitbuf&quot;. Unlike other manipulators, it's not listed
! in synopsis. Similarly for &quot;nounitbuf&quot;. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Add to the synopsis for &lt;ios&gt; in 27.5 [iostreams.base], after
! the entry for &quot;nouppercase&quot;, the prototypes: </p>
  
  <blockquote>
    <pre>ios_base&amp; unitbuf(ios_base&amp; str);
*************** ios_base&amp; nounitbuf(ios_base&amp; st
*** 2510,2519 ****
  
  <hr>
  <h3><a name="36"></a>36. Iword &amp; pword storage lifetime omitted</h3>
! <p><b>Section:</b> 27.5.2.5 [ios.base.storage] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios.base.storage">issues</a> in [ios.base.storage].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In the definitions for ios_base::iword and pword, the lifetime of the storage is
  specified badly, so that an implementation which only keeps the last value stored appears
--- 1622,1631 ----
  
  <hr>
  <h3><a name="36"></a>36. Iword &amp; pword storage lifetime omitted</h3>
! <p><b>Section:</b> 27.5.3.5 [ios.base.storage] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios.base.storage">issues</a> in [ios.base.storage].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In the definitions for ios_base::iword and pword, the lifetime of the storage is
  specified badly, so that an implementation which only keeps the last value stored appears
*************** member with a different index ... </p>
*** 2526,2532 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add in 27.5.2.5 [ios.base.storage], in both paragraph 2 and also in
  paragraph 4, replace the sentence: </p>
  
  <blockquote>
--- 1638,1644 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add in 27.5.3.5 [ios.base.storage], in both paragraph 2 and also in
  paragraph 4, replace the sentence: </p>
  
  <blockquote>
*************** paragraph 4, replace the sentence: </p>
*** 2543,2560 ****
    calling iword [pword] with the same index yields another reference to the same value. </p>
  </blockquote>
  
! <p>substituting "iword" or "pword" as appropriate. </p>
  
  
  
  
  
  <hr>
! <h3><a name="37"></a>37. Leftover "global" reference</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In the overview of locale semantics, paragraph 4, is the sentence </p>
  
--- 1655,1672 ----
    calling iword [pword] with the same index yields another reference to the same value. </p>
  </blockquote>
  
! <p>substituting &quot;iword&quot; or &quot;pword&quot; as appropriate. </p>
  
  
  
  
  
  <hr>
! <h3><a name="37"></a>37. Leftover &quot;global&quot; reference</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In the overview of locale semantics, paragraph 4, is the sentence </p>
  
*************** expression </p>
*** 2581,2592 ****
  
  <hr>
  <h3><a name="38"></a>38. Facet definition incomplete</h3>
! <p><b>Section:</b> 22.3.2 [locale.global.templates] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It has been noticed by Esa Pulkkinen that the definition of
! "facet" is incomplete. In particular, a class derived from
  another facet, but which does not define a member <i>id</i>, cannot
  safely serve as the argument <i>F</i> to use_facet&lt;F&gt;(loc),
  because there is no guarantee that a reference to the facet instance
--- 1693,1704 ----
  
  <hr>
  <h3><a name="38"></a>38. Facet definition incomplete</h3>
! <p><b>Section:</b> 22.3.2 [locale.global.templates] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It has been noticed by Esa Pulkkinen that the definition of
! &quot;facet&quot; is incomplete. In particular, a class derived from
  another facet, but which does not define a member <i>id</i>, cannot
  safely serve as the argument <i>F</i> to use_facet&lt;F&gt;(loc),
  because there is no guarantee that a reference to the facet instance
*************** reads: </p>
*** 2609,2618 ****
  </blockquote>
  
  <p><i>[
! Kona: strike as overspecification the text "(not inherits)"
! from the original resolution, which read "... whose definition
  contains (not inherits) the public static member
! <tt>id</tt>..."
  ]</i></p>
  
  
--- 1721,1730 ----
  </blockquote>
  
  <p><i>[
! Kona: strike as overspecification the text &quot;(not inherits)&quot;
! from the original resolution, which read &quot;... whose definition
  contains (not inherits) the public static member
! <tt>id</tt>...&quot;
  ]</i></p>
  
  
*************** contains (not inherits) the public stati
*** 2623,2631 ****
  
  <hr>
  <h3><a name="39"></a>39. istreambuf_iterator&lt;&gt;::operator++(int) definition garbled</h3>
! <p><b>Section:</b> 24.6.3.4 [istreambuf.iterator::op++] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Following the definition of istreambuf_iterator&lt;&gt;::operator++(int) in paragraph
  3, the standard contains three lines of garbage text left over from a previous edit. </p>
--- 1735,1743 ----
  
  <hr>
  <h3><a name="39"></a>39. istreambuf_iterator&lt;&gt;::operator++(int) definition garbled</h3>
! <p><b>Section:</b> 24.6.3.4 [istreambuf.iterator::op++] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Following the definition of istreambuf_iterator&lt;&gt;::operator++(int) in paragraph
  3, the standard contains three lines of garbage text left over from a previous edit. </p>
*************** end of paragraph 3. </p>
*** 2647,2656 ****
  
  <hr>
  <h3><a name="40"></a>40. Meaningless normative paragraph in examples</h3>
! <p><b>Section:</b> 22.4.8 [facets.examples] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facets.examples">issues</a> in [facets.examples].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 3 of the locale examples is a description of part of an
  implementation technique that has lost its referent, and doesn't mean
--- 1759,1768 ----
  
  <hr>
  <h3><a name="40"></a>40. Meaningless normative paragraph in examples</h3>
! <p><b>Section:</b> 22.4.8 [facets.examples] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facets.examples">issues</a> in [facets.examples].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 3 of the locale examples is a description of part of an
  implementation technique that has lost its referent, and doesn't mean
*************** anything. </p>
*** 2658,2665 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Delete 22.4.8 [facets.examples] paragraph 3 which begins "This
! initialization/identification system depends...", or (at the
  editor's option) replace it with a place-holder to keep the paragraph
  numbering the same. </p>
  
--- 1770,1777 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Delete 22.4.8 [facets.examples] paragraph 3 which begins &quot;This
! initialization/identification system depends...&quot;, or (at the
  editor's option) replace it with a place-holder to keep the paragraph
  numbering the same. </p>
  
*************** numbering the same. </p>
*** 2669,2688 ****
  
  <hr>
  <h3><a name="41"></a>41. Ios_base needs clear(), exceptions()</h3>
! <p><b>Section:</b> 27.5.2 [ios.base] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios.base">issues</a> in [ios.base].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#157">157</a></p>
  <p><b>Discussion:</b></p>
! <p>The description of ios_base::iword() and pword() in 27.5.2.4 [ios.members.static], say that if they fail, they "set badbit,
! which may throw an exception". However, ios_base offers no
  interface to set or to test badbit; those interfaces are defined in
  basic_ios&lt;&gt;. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the description in 27.5.2.5 [ios.base.storage] in
  paragraph 2, and also in paragraph 4, as follows. Replace</p>
  
  <blockquote>
--- 1781,1800 ----
  
  <hr>
  <h3><a name="41"></a>41. Ios_base needs clear(), exceptions()</h3>
! <p><b>Section:</b> 27.5.3 [ios.base] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios.base">issues</a> in [ios.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#157">157</a></p>
  <p><b>Discussion:</b></p>
! <p>The description of ios_base::iword() and pword() in 27.5.3.4 [ios.members.static], say that if they fail, they &quot;set badbit,
! which may throw an exception&quot;. However, ios_base offers no
  interface to set or to test badbit; those interfaces are defined in
  basic_ios&lt;&gt;. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the description in 27.5.3.5 [ios.base.storage] in
  paragraph 2, and also in paragraph 4, as follows. Replace</p>
  
  <blockquote>
*************** setstate(badbit).]</i></p>
*** 2709,2718 ****
  
  <hr>
  <h3><a name="42"></a>42. String ctors specify wrong default allocator</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The basic_string&lt;&gt; copy constructor: </p>
  
--- 1821,1831 ----
  
  <hr>
  <h3><a name="42"></a>42. String ctors specify wrong default allocator</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The basic_string&lt;&gt; copy constructor: </p>
  
*************** the declaration of the copy constructor
*** 2782,2789 ****
  </blockquote>
  
  <p>The proposed resolution reflects the original intent of the LWG. It
! was also noted by Pete Becker that this fix "will cause
! a small amount of existing code to now work correctly."</p>
  
  <p><i>[
  Kona: issue editing snafu fixed - the proposed resolution now correctly
--- 1895,1902 ----
  </blockquote>
  
  <p>The proposed resolution reflects the original intent of the LWG. It
! was also noted by Pete Becker that this fix &quot;will cause
! a small amount of existing code to now work correctly.&quot;</p>
  
  <p><i>[
  Kona: issue editing snafu fixed - the proposed resolution now correctly
*************** reflects the LWG consensus.
*** 2797,2806 ****
  
  <hr>
  <h3><a name="44"></a>44. Iostreams use operator== on int_type values</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Many of the specifications for iostreams specify that character
  values or their int_type equivalents are compared using operators ==
--- 1910,1919 ----
  
  <hr>
  <h3><a name="44"></a>44. Iostreams use operator== on int_type values</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Many of the specifications for iostreams specify that character
  values or their int_type equivalents are compared using operators ==
*************** change uses of == and != to use the trai
*** 2820,2831 ****
     In lib.basic.ios.members paragraph 13 (postcondition clause for
     'fill(cT)') change
  
! <blockquote><pre>     fillch == fill()
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(fillch, fill())
  </pre></blockquote>
  
  
--- 1933,1946 ----
     In lib.basic.ios.members paragraph 13 (postcondition clause for
     'fill(cT)') change
  
! <blockquote><pre>
!      fillch == fill()
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(fillch, fill())
  </pre></blockquote>
  
  
*************** change uses of == and != to use the trai
*** 2834,2858 ****
     In lib.istream.unformatted paragraph 7 (effects clause for
     'get(cT,streamsize,cT)'), third bullet, change
  
! <blockquote><pre>     c == delim for the next available input character c
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(c, delim) for the next available input character c
  </pre></blockquote>
  
  </li>
  <li>
     In lib.istream.unformatted paragraph 12 (effects clause for
!    'get(basic_streambuf&lt;cT,Tr&gt;&amp;,cT)'), third bullet, change
  
! <blockquote><pre>     c == delim for the next available input character c
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(c, delim) for the next available input character c
  </pre></blockquote>
  
  </li>
--- 1949,1977 ----
     In lib.istream.unformatted paragraph 7 (effects clause for
     'get(cT,streamsize,cT)'), third bullet, change
  
! <blockquote><pre>
!      c == delim for the next available input character c
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(c, delim) for the next available input character c
  </pre></blockquote>
  
  </li>
  <li>
     In lib.istream.unformatted paragraph 12 (effects clause for
!    'get(basic_streambuf&lt;cT,Tr>&amp;,cT)'), third bullet, change
  
! <blockquote><pre>
!      c == delim for the next available input character c
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(c, delim) for the next available input character c
  </pre></blockquote>
  
  </li>
*************** change uses of == and != to use the trai
*** 2860,2871 ****
     In lib.istream.unformatted paragraph 17 (effects clause for
     'getline(cT,streamsize,cT)'), second bullet, change
  
! <blockquote><pre>     c == delim for the next available input character c
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(c, delim) for the next available input character c
    </pre></blockquote>
  
  </li>
--- 1979,1992 ----
     In lib.istream.unformatted paragraph 17 (effects clause for
     'getline(cT,streamsize,cT)'), second bullet, change
  
! <blockquote><pre>
!      c == delim for the next available input character c
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(c, delim) for the next available input character c
    </pre></blockquote>
  
  </li>
*************** change uses of == and != to use the trai
*** 2873,2884 ****
     In lib.istream.unformatted paragraph 24 (effects clause for
     'ignore(int,int_type)'), second bullet, change
  
! <blockquote><pre>     c == delim for the next available input character c
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq_int_type(c, delim) for the next available input
       character c
  </pre></blockquote>
    
--- 1994,2007 ----
     In lib.istream.unformatted paragraph 24 (effects clause for
     'ignore(int,int_type)'), second bullet, change
  
! <blockquote><pre>
!      c == delim for the next available input character c
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq_int_type(c, delim) for the next available input
       character c
  </pre></blockquote>
    
*************** change uses of == and != to use the trai
*** 2887,2898 ****
     In lib.istream.unformatted paragraph 25 (notes clause for
     'ignore(int,int_type)'), second bullet, change
  
! <blockquote><pre>     The last condition will never occur if delim == traits::eof()
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     The last condition will never occur if
       traits::eq_int_type(delim, traits::eof()).
  </pre></blockquote>
  
--- 2010,2023 ----
     In lib.istream.unformatted paragraph 25 (notes clause for
     'ignore(int,int_type)'), second bullet, change
  
! <blockquote><pre>
!      The last condition will never occur if delim == traits::eof()
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      The last condition will never occur if
       traits::eq_int_type(delim, traits::eof()).
  </pre></blockquote>
  
*************** change uses of == and != to use the trai
*** 2901,2912 ****
     In lib.istream.sentry paragraph 6 (example implementation for the
     sentry constructor) change
  
! <blockquote><pre>     while ((c = is.rdbuf()-&gt;snextc()) != traits::eof()) {
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     while (!traits::eq_int_type(c = is.rdbuf()-&gt;snextc(), traits::eof())) {
  </pre></blockquote>
  
  </li>
--- 2026,2039 ----
     In lib.istream.sentry paragraph 6 (example implementation for the
     sentry constructor) change
  
! <blockquote><pre>
!      while ((c = is.rdbuf()->snextc()) != traits::eof()) {
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      while (!traits::eq_int_type(c = is.rdbuf()->snextc(), traits::eof())) {
  </pre></blockquote>
  
  </li>
*************** change uses of == and != to use the trai
*** 2919,2930 ****
     In lib.string::find paragraph 1 (effects clause for find()),
     second bullet, change
  
! <blockquote><pre>     at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  
  </li>
--- 2046,2059 ----
     In lib.string::find paragraph 1 (effects clause for find()),
     second bullet, change
  
! <blockquote><pre>
!      at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  
  </li>
*************** change uses of == and != to use the trai
*** 2932,2943 ****
     In lib.string::rfind paragraph 1 (effects clause for rfind()),
     second bullet, change
  
! <blockquote><pre>     at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  
  </li>
--- 2061,2074 ----
     In lib.string::rfind paragraph 1 (effects clause for rfind()),
     second bullet, change
  
! <blockquote><pre>
!      at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  
  </li>
*************** change uses of == and != to use the trai
*** 2945,2956 ****
     In lib.string::find.first.of paragraph 1 (effects clause for
     find_first_of()), second bullet, change
  
! <blockquote><pre>     at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  
  </li>
--- 2076,2089 ----
     In lib.string::find.first.of paragraph 1 (effects clause for
     find_first_of()), second bullet, change
  
! <blockquote><pre>
!      at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  
  </li>
*************** change uses of == and != to use the trai
*** 2958,2969 ****
     In lib.string::find.last.of paragraph 1 (effects clause for
     find_last_of()), second bullet, change
  
! <blockquote><pre>     at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  
  </li>
--- 2091,2104 ----
     In lib.string::find.last.of paragraph 1 (effects clause for
     find_last_of()), second bullet, change
  
! <blockquote><pre>
!      at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  
  </li>
*************** change uses of == and != to use the trai
*** 2971,2982 ****
     In lib.string::find.first.not.of paragraph 1 (effects clause for
     find_first_not_of()), second bullet, change
  
! <blockquote><pre>     at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  </li>
  
--- 2106,2119 ----
     In lib.string::find.first.not.of paragraph 1 (effects clause for
     find_first_not_of()), second bullet, change
  
! <blockquote><pre>
!      at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  </li>
  
*************** change uses of == and != to use the trai
*** 2984,2995 ****
     In lib.string::find.last.not.of paragraph 1 (effects clause for
     find_last_not_of()), second bullet, change
  
! <blockquote><pre>     at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  </li>
  
--- 2121,2134 ----
     In lib.string::find.last.not.of paragraph 1 (effects clause for
     find_last_not_of()), second bullet, change
  
! <blockquote><pre>
!      at(xpos+I) == str.at(I) for all elements ...
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(at(xpos+I), str.at(I)) for all elements ...
  </pre></blockquote>
  </li>
  
*************** change uses of == and != to use the trai
*** 2997,3008 ****
     In lib.string.ios paragraph 5 (effects clause for getline()),
     second bullet, change
  
! <blockquote><pre>     c == delim for the next available input character c 
  </pre></blockquote>
  
     to
  
! <blockquote><pre>     traits::eq(c, delim) for the next available input character c 
  </pre></blockquote>
  </li>
  
--- 2136,2149 ----
     In lib.string.ios paragraph 5 (effects clause for getline()),
     second bullet, change
  
! <blockquote><pre>
!      c == delim for the next available input character c 
  </pre></blockquote>
  
     to
  
! <blockquote><pre>
!      traits::eq(c, delim) for the next available input character c 
  </pre></blockquote>
  </li>
  
*************** change uses of == and != to use the trai
*** 3048,3060 ****
  
  <hr>
  <h3><a name="46"></a>46. Minor Annex D errors</h3>
! <p><b>Section:</b> D.9 [depr.str.strstreams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Brendan Kehoe <b>Opened:</b> 1998-06-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p><p>See lib-6522 and edit-814.</p>
  
  <p><b>Proposed resolution:</b></p>
! <p>Change D.9.1 [depr.strstreambuf] (since streambuf is a typedef of
  basic_streambuf&lt;char&gt;) from:</p>
  
  <pre>         virtual streambuf&lt;char&gt;* setbuf(char* s, streamsize n);</pre>
--- 2189,2201 ----
  
  <hr>
  <h3><a name="46"></a>46. Minor Annex D errors</h3>
! <p><b>Section:</b> D.7 [depr.str.strstreams] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Brendan Kehoe <b>Opened:</b> 1998-06-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p><p>See lib-6522 and edit-814.</p>
  
  <p><b>Proposed resolution:</b></p>
! <p>Change D.7.1 [depr.strstreambuf] (since streambuf is a typedef of
  basic_streambuf&lt;char&gt;) from:</p>
  
  <pre>         virtual streambuf&lt;char&gt;* setbuf(char* s, streamsize n);</pre>
*************** basic_streambuf&lt;char&gt;) from:</p>
*** 3063,3069 ****
  
  <pre>         virtual streambuf* setbuf(char* s, streamsize n);</pre>
  
! <p>In D.9.4 [depr.strstream] insert the semicolon now missing after
  int_type:</p>
  
  <pre>     namespace std {
--- 2204,2210 ----
  
  <pre>         virtual streambuf* setbuf(char* s, streamsize n);</pre>
  
! <p>In D.7.4 [depr.strstream] insert the semicolon now missing after
  int_type:</p>
  
  <pre>     namespace std {
*************** int_type:</p>
*** 3081,3090 ****
  
  <hr>
  <h3><a name="47"></a>47. Imbue() and getloc() Returns clauses swapped</h3>
! <p><b>Section:</b> 27.5.2.3 [ios.base.locales] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios.base.locales">issues</a> in [ios.base.locales].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 27.4.2.3 specifies how imbue() and getloc() work. That
  section has two RETURNS clauses, and they make no sense as
--- 2222,2231 ----
  
  <hr>
  <h3><a name="47"></a>47. Imbue() and getloc() Returns clauses swapped</h3>
! <p><b>Section:</b> 27.5.3.3 [ios.base.locales] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios.base.locales">issues</a> in [ios.base.locales].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 27.4.2.3 specifies how imbue() and getloc() work. That
  section has two RETURNS clauses, and they make no sense as
*************** accident?</p>
*** 3094,3100 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.5.2.3 [ios.base.locales] swap paragraphs 2 and 4.</p>
  
  
  
--- 2235,2241 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.5.3.3 [ios.base.locales] swap paragraphs 2 and 4.</p>
  
  
  
*************** accident?</p>
*** 3102,3111 ****
  
  <hr>
  <h3><a name="48"></a>48. Use of non-existent exception constructor</h3>
! <p><b>Section:</b> 27.5.2.1.1 [ios::failure] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios::failure">issues</a> in [ios::failure].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.4.2.1.1, paragraph 2, says that class failure initializes the
  base class, exception, with exception(msg). Class exception (see
--- 2243,2252 ----
  
  <hr>
  <h3><a name="48"></a>48. Use of non-existent exception constructor</h3>
! <p><b>Section:</b> 27.5.3.1.1 [ios::failure] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios::failure">issues</a> in [ios::failure].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.4.2.1.1, paragraph 2, says that class failure initializes the
  base class, exception, with exception(msg). Class exception (see
*************** base class, exception, with exception(ms
*** 3113,3119 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace 27.5.2.1.1 [ios::failure], paragraph 2, with</p>
  
  <blockquote>
    <p>EFFECTS: Constructs an object of class <tt>failure</tt>.</p>
--- 2254,2260 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace 27.5.3.1.1 [ios::failure], paragraph 2, with</p>
  
  <blockquote>
    <p>EFFECTS: Constructs an object of class <tt>failure</tt>.</p>
*************** base class, exception, with exception(ms
*** 3125,3133 ****
  
  <hr>
  <h3><a name="49"></a>49. Underspecification of ios_base::sync_with_stdio</h3>
! <p><b>Section:</b> 27.5.2.4 [ios.members.static] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Two problems</p>
  
--- 2266,2274 ----
  
  <hr>
  <h3><a name="49"></a>49. Underspecification of ios_base::sync_with_stdio</h3>
! <p><b>Section:</b> 27.5.3.4 [ios.members.static] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Two problems</p>
  
*************** guesses, but that's another matter.)</p>
*** 3143,3149 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the following sentence in 27.5.2.4 [ios.members.static]
  returns clause from:</p>
  
  <blockquote>
--- 2284,2290 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the following sentence in 27.5.3.4 [ios.members.static]
  returns clause from:</p>
  
  <blockquote>
*************** returns clause from:</p>
*** 3159,3193 ****
    <tt>false</tt>.</p>
  </blockquote>
  
! <p>Add the following immediately after 27.5.2.4 [ios.members.static],
  paragraph 2:</p>
  
  <blockquote>
  <p>When a standard iostream object str is <i>synchronized</i> with a
  standard stdio stream f, the effect of inserting a character c by</p>
! <pre>  fputc(f, c);
  </pre>
  
  <p>is the same as the effect of</p>
! <pre>  str.rdbuf()-&gt;sputc(c);
  </pre>
  
  <p>for any sequence of characters; the effect of extracting a
  character c by</p>
! <pre>  c = fgetc(f);
  </pre>
  
  <p>is the same as the effect of:</p>
! <pre>  c = str.rdbuf()-&gt;sbumpc(c);
  </pre>
  
  <p>for any sequences of characters; and the effect of pushing
  back a character c by</p>
! <pre>  ungetc(c, f);
  </pre>
  
  <p>is the same as the effect of</p>
! <pre>  str.rdbuf()-&gt;sputbackc(c);
  </pre>
  
  <p>for any sequence of characters.  [<i>Footnote</i>: This implies
--- 2300,2340 ----
    <tt>false</tt>.</p>
  </blockquote>
  
! <p>Add the following immediately after 27.5.3.4 [ios.members.static],
  paragraph 2:</p>
  
  <blockquote>
  <p>When a standard iostream object str is <i>synchronized</i> with a
  standard stdio stream f, the effect of inserting a character c by</p>
! <pre>
!   fputc(f, c);
  </pre>
  
  <p>is the same as the effect of</p>
! <pre>
!   str.rdbuf()-&gt;sputc(c);
  </pre>
  
  <p>for any sequence of characters; the effect of extracting a
  character c by</p>
! <pre>
!   c = fgetc(f);
  </pre>
  
  <p>is the same as the effect of:</p>
! <pre>
!   c = str.rdbuf()-&gt;sbumpc(c);
  </pre>
  
  <p>for any sequences of characters; and the effect of pushing
  back a character c by</p>
! <pre>
!   ungetc(c, f);
  </pre>
  
  <p>is the same as the effect of</p>
! <pre>
!   str.rdbuf()-&gt;sputbackc(c);
  </pre>
  
  <p>for any sequence of characters.  [<i>Footnote</i>: This implies
*************** on the two streams can be mixed arbitrar
*** 3212,3221 ****
  
  <hr>
  <h3><a name="50"></a>50. Copy constructor and assignment operator of ios_base</h3>
! <p><b>Section:</b> 27.5.2 [ios.base] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios.base">issues</a> in [ios.base].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>As written, ios_base has a copy constructor and an assignment
  operator. (Nothing in the standard says it doesn't have one, and all
--- 2359,2368 ----
  
  <hr>
  <h3><a name="50"></a>50. Copy constructor and assignment operator of ios_base</h3>
! <p><b>Section:</b> 27.5.3 [ios.base] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios.base">issues</a> in [ios.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>As written, ios_base has a copy constructor and an assignment
  operator. (Nothing in the standard says it doesn't have one, and all
*************** semantics (e.g. what happens to the iarr
*** 3238,3244 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.5.2 [ios.base], class ios_base, specify the copy
  constructor and operator= members as being private.</p>
  
  
--- 2385,2391 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.5.3 [ios.base], class ios_base, specify the copy
  constructor and operator= members as being private.</p>
  
  
*************** outweighs any benefit of allowing ios_ba
*** 3252,3261 ****
  
  <hr>
  <h3><a name="51"></a>51. Requirement to not invalidate iterators missing</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> David Vandevoorde <b>Opened:</b> 1998-06-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The std::sort algorithm can in general only sort a given sequence
  by moving around values. The list&lt;&gt;::sort() member on the other
--- 2399,2409 ----
  
  <hr>
  <h3><a name="51"></a>51. Requirement to not invalidate iterators missing</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> David Vandevoorde <b>Opened:</b> 1998-06-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The std::sort algorithm can in general only sort a given sequence
  by moving around values. The list&lt;&gt;::sort() member on the other
*************** function otherwise.</p>
*** 3303,3310 ****
  <p>This was US issue CD2-23-011; it was accepted in London but the
  change was not made due to an editing oversight. The wording in the
  proposed resolution below is somewhat updated from CD2-23-011,
! particularly the addition of the phrase "or change the values
! of"</p>
  
  
  
--- 2451,2458 ----
  <p>This was US issue CD2-23-011; it was accepted in London but the
  change was not made due to an editing oversight. The wording in the
  proposed resolution below is somewhat updated from CD2-23-011,
! particularly the addition of the phrase &quot;or change the values
! of&quot;</p>
  
  
  
*************** of"</p>
*** 3312,3334 ****
  
  <hr>
  <h3><a name="52"></a>52. Small I/O problems</h3>
! <p><b>Section:</b> 27.5.3.2 [fpos.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fpos.operations">issues</a> in [fpos.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>First, 27.5.4.1 [basic.ios.cons], table 89. This is pretty obvious:
! it should be titled "basic_ios&lt;&gt;() effects", not
! "ios_base() effects". </p>
  
! <p>[The second item is a duplicate; see issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#6">6</a> for
  resolution.]</p>
  
! <p>Second, 27.5.3.2 [fpos.operations] table 88 . There are a couple
  different things wrong with it, some of which I've already discussed
  with Jerry, but the most obvious mechanical sort of error is that it
  uses expressions like P(i) and p(i), without ever defining what sort
! of thing "i" is.
  </p>
  
  <p>(The other problem is that it requires support for streampos
--- 2460,2482 ----
  
  <hr>
  <h3><a name="52"></a>52. Small I/O problems</h3>
! <p><b>Section:</b> 27.5.4.2 [fpos.operations] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fpos.operations">issues</a> in [fpos.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>First, 27.5.5.2 [basic.ios.cons], table 89. This is pretty obvious:
! it should be titled &quot;basic_ios&lt;&gt;() effects&quot;, not
! &quot;ios_base() effects&quot;. </p>
  
! <p>[The second item is a duplicate; see issue <a href="lwg-closed.html#6">6</a> for
  resolution.]</p>
  
! <p>Second, 27.5.4.2 [fpos.operations] table 88 . There are a couple
  different things wrong with it, some of which I've already discussed
  with Jerry, but the most obvious mechanical sort of error is that it
  uses expressions like P(i) and p(i), without ever defining what sort
! of thing &quot;i&quot; is.
  </p>
  
  <p>(The other problem is that it requires support for streampos
*************** arithmetic is possible.) </p>
*** 3341,3349 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.5.4.1 [basic.ios.cons] table 89 title from
! "ios_base() effects" to "basic_ios&lt;&gt;()
! effects". </p>
  
  
  
--- 2489,2497 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.5.5.2 [basic.ios.cons] table 89 title from
! &quot;ios_base() effects&quot; to &quot;basic_ios&lt;&gt;()
! effects&quot;. </p>
  
  
  
*************** effects". </p>
*** 3351,3360 ****
  
  <hr>
  <h3><a name="53"></a>53. Basic_ios destructor unspecified</h3>
! <p><b>Section:</b> 27.5.4.1 [basic.ios.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.ios.cons">issues</a> in [basic.ios.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There's nothing in 27.4.4 saying what basic_ios's destructor does.
  The important question is whether basic_ios::~basic_ios() destroys
--- 2499,2508 ----
  
  <hr>
  <h3><a name="53"></a>53. Basic_ios destructor unspecified</h3>
! <p><b>Section:</b> 27.5.5.2 [basic.ios.cons] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.cons">issues</a> in [basic.ios.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There's nothing in 27.4.4 saying what basic_ios's destructor does.
  The important question is whether basic_ios::~basic_ios() destroys
*************** rdbuf().</p>
*** 3362,3368 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add after 27.5.4.1 [basic.ios.cons] paragraph 2:</p>
  
  <blockquote>
    <p><tt>virtual ~basic_ios();</tt></p>
--- 2510,2516 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add after 27.5.5.2 [basic.ios.cons] paragraph 2:</p>
  
  <blockquote>
    <p><tt>virtual ~basic_ios();</tt></p>
*************** rdbuf().</p>
*** 3373,3382 ****
  <p><b>Rationale:</b></p> 
  <p>The LWG reviewed the additional question of whether or not
  <tt>rdbuf(0)</tt> may set <tt>badbit</tt>.  The answer is
! clearly yes; it may be set via <tt>clear()</tt>.  See 27.5.4.2 [basic.ios.members], paragraph 6.  This issue was reviewed at length
  by the LWG, which removed from the original proposed resolution a
! footnote which incorrectly said "<tt>rdbuf(0)</tt> does not set
! <tt>badbit</tt>".</p>
  
  
  
--- 2521,2530 ----
  <p><b>Rationale:</b></p> 
  <p>The LWG reviewed the additional question of whether or not
  <tt>rdbuf(0)</tt> may set <tt>badbit</tt>.  The answer is
! clearly yes; it may be set via <tt>clear()</tt>.  See 27.5.5.3 [basic.ios.members], paragraph 6.  This issue was reviewed at length
  by the LWG, which removed from the original proposed resolution a
! footnote which incorrectly said &quot;<tt>rdbuf(0)</tt> does not set
! <tt>badbit</tt>&quot;.</p>
  
  
  
*************** footnote which incorrectly said "<tt>rdb
*** 3384,3393 ****
  
  <hr>
  <h3><a name="54"></a>54. Basic_streambuf's destructor</h3>
! <p><b>Section:</b> 27.6.2.1 [streambuf.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#streambuf.cons">issues</a> in [streambuf.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The class synopsis for basic_streambuf shows a (virtual)
  destructor, but the standard doesn't say what that destructor does. My
--- 2532,2541 ----
  
  <hr>
  <h3><a name="54"></a>54. Basic_streambuf's destructor</h3>
! <p><b>Section:</b> 27.6.3.1 [streambuf.cons] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#streambuf.cons">issues</a> in [streambuf.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The class synopsis for basic_streambuf shows a (virtual)
  destructor, but the standard doesn't say what that destructor does. My
*************** explicitly. </p>
*** 3396,3402 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add after 27.6.2.1 [streambuf.cons] paragraph 2:</p>
  
  <blockquote>
    <p><tt>virtual&nbsp; ~basic_streambuf();</tt></p>
--- 2544,2550 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add after 27.6.3.1 [streambuf.cons] paragraph 2:</p>
  
  <blockquote>
    <p><tt>virtual&nbsp; ~basic_streambuf();</tt></p>
*************** explicitly. </p>
*** 3409,3421 ****
  
  <hr>
  <h3><a name="55"></a>55. Invalid stream position is undefined</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Several member functions in clause 27 are defined in certain
! circumstances to return an "invalid stream position", a term
  that is defined nowhere in the standard. Two places (27.5.2.4.2,
  paragraph 4, and 27.8.1.4, paragraph 15) contain a cross-reference to
  a definition in _lib.iostreams.definitions_, a nonexistent
--- 2557,2569 ----
  
  <hr>
  <h3><a name="55"></a>55. Invalid stream position is undefined</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Several member functions in clause 27 are defined in certain
! circumstances to return an &quot;invalid stream position&quot;, a term
  that is defined nowhere in the standard. Two places (27.5.2.4.2,
  paragraph 4, and 27.8.1.4, paragraph 15) contain a cross-reference to
  a definition in _lib.iostreams.definitions_, a nonexistent
*************** section. </p>
*** 3424,3477 ****
  <p>I suspect that the invalid stream position is just supposed to be
  pos_type(-1).  Probably best to say explicitly in (for example)
  27.5.2.4.2 that the return value is pos_type(-1), rather than to use
! the term "invalid stream position", define that term
  somewhere, and then put in a cross-reference. </p>
  
! <p>The phrase "invalid stream position" appears ten times in
  the C++ Standard.  In seven places it refers to a return value, and it
  should be changed. In three places it refers to an argument, and it
! should not be changed. Here are the three places where "invalid
! stream position" should not be changed:</p>
  
  <blockquote>
!   <p>27.8.1.4 [stringbuf.virtuals], paragraph 14<br>
!   27.9.1.5 [filebuf.virtuals], paragraph 14<br>
!   D.9.1.3 [depr.strstreambuf.virtuals], paragraph 17
    </p>
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.6.2.4.2 [streambuf.virt.buffer], paragraph 4, change "Returns an
  object of class pos_type that stores an invalid stream position
! (_lib.iostreams.definitions_)" to "Returns
! <tt>pos_type(off_type(-1))</tt>".
  </p>
  
! <p>In 27.6.2.4.2 [streambuf.virt.buffer], paragraph 6, change "Returns
  an object of class pos_type that stores an invalid stream
! position" to "Returns <tt>pos_type(off_type(-1))</tt>".</p>
  
! <p>In 27.8.1.4 [stringbuf.virtuals], paragraph 13, change "the object
! stores an invalid stream position" to "the return value is
! <tt>pos_type(off_type(-1))</tt>". </p>
  
! <p>In 27.9.1.5 [filebuf.virtuals], paragraph 13, change "returns an
! invalid stream position (27.4.3)" to "returns
! <tt>pos_type(off_type(-1))</tt>" </p>
  
! <p>In 27.9.1.5 [filebuf.virtuals], paragraph 15, change "Otherwise
! returns an invalid stream position (_lib.iostreams.definitions_)"
! to "Otherwise returns <tt>pos_type(off_type(-1))</tt>"
  </p>
  
! <p>In D.9.1.3 [depr.strstreambuf.virtuals], paragraph 15, change "the object
! stores an invalid stream position" to "the return value is
! <tt>pos_type(off_type(-1))</tt>" </p>
  
! <p>In D.9.1.3 [depr.strstreambuf.virtuals], paragraph 18, change "the object
! stores an invalid stream position" to "the return value is
! <tt>pos_type(off_type(-1))</tt>"</p>
  
  
  
--- 2572,2625 ----
  <p>I suspect that the invalid stream position is just supposed to be
  pos_type(-1).  Probably best to say explicitly in (for example)
  27.5.2.4.2 that the return value is pos_type(-1), rather than to use
! the term &quot;invalid stream position&quot;, define that term
  somewhere, and then put in a cross-reference. </p>
  
! <p>The phrase &quot;invalid stream position&quot; appears ten times in
  the C++ Standard.  In seven places it refers to a return value, and it
  should be changed. In three places it refers to an argument, and it
! should not be changed. Here are the three places where &quot;invalid
! stream position&quot; should not be changed:</p>
  
  <blockquote>
!   <p>27.8.2.4 [stringbuf.virtuals], paragraph 14<br/>
!   27.9.1.5 [filebuf.virtuals], paragraph 14<br/>
!   D.7.1.3 [depr.strstreambuf.virtuals], paragraph 17
    </p>
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.6.3.4.2 [streambuf.virt.buffer], paragraph 4, change &quot;Returns an
  object of class pos_type that stores an invalid stream position
! (_lib.iostreams.definitions_)&quot; to &quot;Returns
! <tt>pos_type(off_type(-1))</tt>&quot;.
  </p>
  
! <p>In 27.6.3.4.2 [streambuf.virt.buffer], paragraph 6, change &quot;Returns
  an object of class pos_type that stores an invalid stream
! position&quot; to &quot;Returns <tt>pos_type(off_type(-1))</tt>&quot;.</p>
  
! <p>In 27.8.2.4 [stringbuf.virtuals], paragraph 13, change &quot;the object
! stores an invalid stream position&quot; to &quot;the return value is
! <tt>pos_type(off_type(-1))</tt>&quot;. </p>
  
! <p>In 27.9.1.5 [filebuf.virtuals], paragraph 13, change &quot;returns an
! invalid stream position (27.4.3)&quot; to &quot;returns
! <tt>pos_type(off_type(-1))</tt>&quot; </p>
  
! <p>In 27.9.1.5 [filebuf.virtuals], paragraph 15, change &quot;Otherwise
! returns an invalid stream position (_lib.iostreams.definitions_)&quot;
! to &quot;Otherwise returns <tt>pos_type(off_type(-1))</tt>&quot;
  </p>
  
! <p>In D.7.1.3 [depr.strstreambuf.virtuals], paragraph 15, change &quot;the object
! stores an invalid stream position&quot; to &quot;the return value is
! <tt>pos_type(off_type(-1))</tt>&quot; </p>
  
! <p>In D.7.1.3 [depr.strstreambuf.virtuals], paragraph 18, change &quot;the object
! stores an invalid stream position&quot; to &quot;the return value is
! <tt>pos_type(off_type(-1))</tt>&quot;</p>
  
  
  
*************** stores an invalid stream position" to "t
*** 3479,3488 ****
  
  <hr>
  <h3><a name="56"></a>56. Showmanyc's return type</h3>
! <p><b>Section:</b> 27.6.2 [streambuf] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#streambuf">issues</a> in [streambuf].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The class summary for basic_streambuf&lt;&gt;, in 27.5.2, says that
  showmanyc has return type int. However, 27.5.2.4.3 says that its
--- 2627,2636 ----
  
  <hr>
  <h3><a name="56"></a>56. Showmanyc's return type</h3>
! <p><b>Section:</b> 27.6.3 [streambuf] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-06-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#streambuf">issues</a> in [streambuf].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The class summary for basic_streambuf&lt;&gt;, in 27.5.2, says that
  showmanyc has return type int. However, 27.5.2.4.3 says that its
*************** return type is streamsize. </p>
*** 3491,3497 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Change <tt>showmanyc</tt>'s return type in the
! 27.6.2 [streambuf] class summary to <tt>streamsize</tt>.</p>
  
  
  
--- 2639,2645 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Change <tt>showmanyc</tt>'s return type in the
! 27.6.3 [streambuf] class summary to <tt>streamsize</tt>.</p>
  
  
  
*************** return type is streamsize. </p>
*** 3499,3512 ****
  
  <hr>
  <h3><a name="57"></a>57. Mistake in char_traits</h3>
! <p><b>Section:</b> 21.2.3.4 [char.traits.specializations.wchar.t] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-07-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>21.1.3.2, paragraph 3, says "The types streampos and
  wstreampos may be different if the implementation supports no shift
  encoding in narrow-oriented iostreams but supports one or more shift
! encodings in wide-oriented streams". </p>
  
  <p>That's wrong: the two are the same type. The &lt;iosfwd&gt; summary
  in 27.2 says that streampos and wstreampos are, respectively, synonyms
--- 2647,2660 ----
  
  <hr>
  <h3><a name="57"></a>57. Mistake in char_traits</h3>
! <p><b>Section:</b> 21.2.3.4 [char.traits.specializations.wchar.t] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>21.1.3.2, paragraph 3, says &quot;The types streampos and
  wstreampos may be different if the implementation supports no shift
  encoding in narrow-oriented iostreams but supports one or more shift
! encodings in wide-oriented streams&quot;. </p>
  
  <p>That's wrong: the two are the same type. The &lt;iosfwd&gt; summary
  in 27.2 says that streampos and wstreampos are, respectively, synonyms
*************** char_traits&lt;wchar_t&gt;::state_type m
*** 3519,3526 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Remove the sentence in 21.2.3.4 [char.traits.specializations.wchar.t] paragraph 3 which
! begins "The types streampos and wstreampos may be
! different..." . </p>
  
  
  
--- 2667,2674 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Remove the sentence in 21.2.3.4 [char.traits.specializations.wchar.t] paragraph 3 which
! begins &quot;The types streampos and wstreampos may be
! different...&quot; . </p>
  
  
  
*************** different..." . </p>
*** 3528,3539 ****
  
  <hr>
  <h3><a name="59"></a>59. Ambiguity in specification of gbump</h3>
! <p><b>Section:</b> 27.6.2.3.2 [streambuf.get.area] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-07-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>27.5.2.3.1 says that basic_streambuf::gbump() "Advances the
! next pointer for the input sequence by n." </p>
  
  <p>The straightforward interpretation is that it is just gptr() +=
  n. An alternative interpretation, though, is that it behaves as if it
--- 2676,2687 ----
  
  <hr>
  <h3><a name="59"></a>59. Ambiguity in specification of gbump</h3>
! <p><b>Section:</b> 27.6.3.3.2 [streambuf.get.area] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-07-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>27.5.2.3.1 says that basic_streambuf::gbump() &quot;Advances the
! next pointer for the input sequence by n.&quot; </p>
  
  <p>The straightforward interpretation is that it is just gptr() +=
  n. An alternative interpretation, though, is that it behaves as if it
*************** calls sbumpc n times. (The issue, of cou
*** 3541,3552 ****
  call underflow.) There is a similar ambiguity in the case of
  pbump. </p>
  
! <p>(The "classic" AT&amp;T implementation used the
  former interpretation.)</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.6.2.3.2 [streambuf.get.area] paragraph 4 gbump effects from:</p>
  
  <blockquote>
    <p>Effects: Advances the next pointer for the input sequence by n.</p>
--- 2689,2700 ----
  call underflow.) There is a similar ambiguity in the case of
  pbump. </p>
  
! <p>(The &quot;classic&quot; AT&amp;T implementation used the
  former interpretation.)</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.6.3.3.2 [streambuf.get.area] paragraph 4 gbump effects from:</p>
  
  <blockquote>
    <p>Effects: Advances the next pointer for the input sequence by n.</p>
*************** former interpretation.)</p>
*** 3558,3564 ****
    <p>Effects: Adds <tt>n</tt> to the next pointer for the input sequence.</p>
  </blockquote>
  
! <p>Make the same change to 27.6.2.3.3 [streambuf.put.area] paragraph 4 pbump
  effects.</p>
  
  
--- 2706,2712 ----
    <p>Effects: Adds <tt>n</tt> to the next pointer for the input sequence.</p>
  </blockquote>
  
! <p>Make the same change to 27.6.3.3.3 [streambuf.put.area] paragraph 4 pbump
  effects.</p>
  
  
*************** effects.</p>
*** 3567,3587 ****
  
  <hr>
  <h3><a name="60"></a>60. What is a formatted input function?</h3>
! <p><b>Section:</b> 27.7.1.2.1 [istream.formatted.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.formatted.reqmts">issues</a> in [istream.formatted.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#162">162</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#163">163</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#166">166</a></p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 1 of 27.6.1.2.1 contains general requirements for all
  formatted input functions. Some of the functions defined in section
! 27.6.1.2 explicitly say that those requirements apply ("Behaves
! like a formatted input member (as described in 27.6.1.2.1)"), but
  others don't. The question: is 27.6.1.2.1 supposed to apply to
  everything in 27.6.1.2, or only to those member functions that
! explicitly say "behaves like a formatted input member"? Or
  to put it differently: are we to assume that everything that appears
! in a section called "Formatted input functions" really is a
  formatted input function? I assume that 27.6.1.2.1 is intended to
  apply to the arithmetic extractors (27.6.1.2.2), but I assume that it
  is not intended to apply to extractors like </p>
--- 2715,2735 ----
  
  <hr>
  <h3><a name="60"></a>60. What is a formatted input function?</h3>
! <p><b>Section:</b> 27.7.2.2.1 [istream.formatted.reqmts] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.formatted.reqmts">issues</a> in [istream.formatted.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#162">162</a>, <a href="lwg-closed.html#163">163</a>, <a href="lwg-closed.html#166">166</a></p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 1 of 27.6.1.2.1 contains general requirements for all
  formatted input functions. Some of the functions defined in section
! 27.6.1.2 explicitly say that those requirements apply (&quot;Behaves
! like a formatted input member (as described in 27.6.1.2.1)&quot;), but
  others don't. The question: is 27.6.1.2.1 supposed to apply to
  everything in 27.6.1.2, or only to those member functions that
! explicitly say &quot;behaves like a formatted input member&quot;? Or
  to put it differently: are we to assume that everything that appears
! in a section called &quot;Formatted input functions&quot; really is a
  formatted input function? I assume that 27.6.1.2.1 is intended to
  apply to the arithmetic extractors (27.6.1.2.2), but I assume that it
  is not intended to apply to extractors like </p>
*************** output. </p>
*** 3599,3631 ****
  basic_istream and basic_ostream operator &lt;&lt;()'s that are used
  for the manipulators and streambuf* are in the wrong section and
  should have their own separate section or be modified to make it clear
! that the "Common requirements" listed in section 27.6.1.2.1
  (for basic_istream) and section 27.6.2.5.1 (for basic_ostream) do not
  apply to them. </p>
  
! <p>Additional comments from Dietmar Kühl: It appears to be somewhat
! nonsensical to consider the functions defined in 27.7.1.2.3 [istream::extractors] paragraphs 1 to 5 to be "Formatted input
! function" but since these functions are defined in a section
! labeled "Formatted input functions" it is unclear to me
  whether these operators are considered formatted input functions which
! have to conform to the "common requirements" from 27.7.1.2.1 [istream.formatted.reqmts]: If this is the case, all manipulators, not
  just <tt>ws</tt>, would skip whitespace unless <tt>noskipws</tt> is
  set (... but setting <tt>noskipws</tt> using the manipulator syntax
  would also skip whitespace :-)</p> <p>It is not clear which functions
  are to be considered unformatted input functions. As written, it seems
! that all functions in 27.7.1.3 [istream.unformatted] are unformatted input
  functions. However, it does not really make much sense to construct a
  sentry object for <tt>gcount()</tt>, <tt>sync()</tt>, ... Also it is
  unclear what happens to the <tt>gcount()</tt> if
  eg. <tt>gcount()</tt>, <tt>putback()</tt>, <tt>unget()</tt>, or
  <tt>sync()</tt> is called: These functions don't extract characters,
! some of them even "unextract" a character. Should this still
  be reflected in <tt>gcount()</tt>? Of course, it could be read as if
  after a call to <tt>gcount()</tt> <tt>gcount()</tt> return <tt>0</tt>
  (the last unformatted input function, <tt>gcount()</tt>, didn't
  extract any character) and after a call to <tt>putback()</tt>
  <tt>gcount()</tt> returns <tt>-1</tt> (the last unformatted input
! function <tt>putback()</tt> did "extract" back into the
  stream). Correspondingly for <tt>unget()</tt>. Is this what is
  intended?  If so, this should be clarified. Otherwise, a corresponding
  clarification should be used.</p>
--- 2747,2779 ----
  basic_istream and basic_ostream operator &lt;&lt;()'s that are used
  for the manipulators and streambuf* are in the wrong section and
  should have their own separate section or be modified to make it clear
! that the &quot;Common requirements&quot; listed in section 27.6.1.2.1
  (for basic_istream) and section 27.6.2.5.1 (for basic_ostream) do not
  apply to them. </p>
  
! <p>Additional comments from Dietmar K&uuml;hl: It appears to be somewhat
! nonsensical to consider the functions defined in 27.7.2.2.3 [istream::extractors] paragraphs 1 to 5 to be &quot;Formatted input
! function&quot; but since these functions are defined in a section
! labeled &quot;Formatted input functions&quot; it is unclear to me
  whether these operators are considered formatted input functions which
! have to conform to the &quot;common requirements&quot; from 27.7.2.2.1 [istream.formatted.reqmts]: If this is the case, all manipulators, not
  just <tt>ws</tt>, would skip whitespace unless <tt>noskipws</tt> is
  set (... but setting <tt>noskipws</tt> using the manipulator syntax
  would also skip whitespace :-)</p> <p>It is not clear which functions
  are to be considered unformatted input functions. As written, it seems
! that all functions in 27.7.2.3 [istream.unformatted] are unformatted input
  functions. However, it does not really make much sense to construct a
  sentry object for <tt>gcount()</tt>, <tt>sync()</tt>, ... Also it is
  unclear what happens to the <tt>gcount()</tt> if
  eg. <tt>gcount()</tt>, <tt>putback()</tt>, <tt>unget()</tt>, or
  <tt>sync()</tt> is called: These functions don't extract characters,
! some of them even &quot;unextract&quot; a character. Should this still
  be reflected in <tt>gcount()</tt>? Of course, it could be read as if
  after a call to <tt>gcount()</tt> <tt>gcount()</tt> return <tt>0</tt>
  (the last unformatted input function, <tt>gcount()</tt>, didn't
  extract any character) and after a call to <tt>putback()</tt>
  <tt>gcount()</tt> returns <tt>-1</tt> (the last unformatted input
! function <tt>putback()</tt> did &quot;extract&quot; back into the
  stream). Correspondingly for <tt>unget()</tt>. Is this what is
  intended?  If so, this should be clarified. Otherwise, a corresponding
  clarification should be used.</p>
*************** clarification should be used.</p>
*** 3634,3702 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  In 27.6.1.2.2 [lib.istream.formatted.arithmetic], paragraph 1.
! Change the beginning of the second sentence from "The conversion
! occurs" to "These extractors behave as formatted input functions (as
  described in 27.6.1.2.1).  After a sentry object is constructed,
! the conversion occurs"
  </p>
  
  <p>
  In 27.6.1.2.3, [lib.istream::extractors], before paragraph 1.
! Add an effects clause.  "Effects: None.  This extractor does
  not behave as a formatted input function (as described in
  27.6.1.2.1).
  </p>
  
  <p>
  In 27.6.1.2.3, [lib.istream::extractors], paragraph 2.  Change the
! effects clause to "Effects: Calls pf(*this).  This extractor does not
  behave as a formatted input function (as described in 27.6.1.2.1).
  </p>
  
  <p>
  In 27.6.1.2.3, [lib.istream::extractors], paragraph 4.  Change the
! effects clause to "Effects: Calls pf(*this).  This extractor does not
  behave as a formatted input function (as described in 27.6.1.2.1).
  </p>
  
  <p>
  In 27.6.1.2.3, [lib.istream::extractors], paragraph 12.  Change the
! first two sentences from "If sb is null, calls setstate(failbit),
  which may throw ios_base::failure (27.4.4.3).  Extracts characters
! from *this..." to "Behaves as a formatted input function (as described
  in 27.6.1.2.1).  If sb is null, calls setstate(failbit), which may
  throw ios_base::failure (27.4.4.3).  After a sentry object is
! constructed, extracts characters from *this...".
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], before paragraph 2.  Add an
! effects clause.  "Effects: none. This member function does not behave
! as an unformatted input function (as described in 27.6.1.3, paragraph 1)."
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 3.  Change the
! beginning of the first sentence of the effects clause from "Extracts a
! character" to "Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts a
! character"
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 5.  Change the
! beginning of the first sentence of the effects clause from "Extracts a
! character" to "Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts a
! character"
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 7.  Change the
! beginning of the first sentence of the effects clause from "Extracts
! characters" to "Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts
! characters"
  </p>
  
  <p>
--- 2782,2850 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  In 27.6.1.2.2 [lib.istream.formatted.arithmetic], paragraph 1.
! Change the beginning of the second sentence from &quot;The conversion
! occurs&quot; to &quot;These extractors behave as formatted input functions (as
  described in 27.6.1.2.1).  After a sentry object is constructed,
! the conversion occurs&quot;
  </p>
  
  <p>
  In 27.6.1.2.3, [lib.istream::extractors], before paragraph 1.
! Add an effects clause.  &quot;Effects: None.  This extractor does
  not behave as a formatted input function (as described in
  27.6.1.2.1).
  </p>
  
  <p>
  In 27.6.1.2.3, [lib.istream::extractors], paragraph 2.  Change the
! effects clause to &quot;Effects: Calls pf(*this).  This extractor does not
  behave as a formatted input function (as described in 27.6.1.2.1).
  </p>
  
  <p>
  In 27.6.1.2.3, [lib.istream::extractors], paragraph 4.  Change the
! effects clause to &quot;Effects: Calls pf(*this).  This extractor does not
  behave as a formatted input function (as described in 27.6.1.2.1).
  </p>
  
  <p>
  In 27.6.1.2.3, [lib.istream::extractors], paragraph 12.  Change the
! first two sentences from &quot;If sb is null, calls setstate(failbit),
  which may throw ios_base::failure (27.4.4.3).  Extracts characters
! from *this...&quot; to &quot;Behaves as a formatted input function (as described
  in 27.6.1.2.1).  If sb is null, calls setstate(failbit), which may
  throw ios_base::failure (27.4.4.3).  After a sentry object is
! constructed, extracts characters from *this...&quot;.
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], before paragraph 2.  Add an
! effects clause.  &quot;Effects: none. This member function does not behave
! as an unformatted input function (as described in 27.6.1.3, paragraph 1).&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 3.  Change the
! beginning of the first sentence of the effects clause from &quot;Extracts a
! character&quot; to &quot;Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts a
! character&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 5.  Change the
! beginning of the first sentence of the effects clause from &quot;Extracts a
! character&quot; to &quot;Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts a
! character&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 7.  Change the
! beginning of the first sentence of the effects clause from &quot;Extracts
! characters&quot; to &quot;Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts
! characters&quot;
  </p>
  
  <p>
*************** characters"
*** 3705,3714 ****
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 12.  Change the
! beginning of the first sentence of the effects clause from "Extracts
! characters" to "Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts
! characters"
  </p>
  
  <p>
--- 2853,2862 ----
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 12.  Change the
! beginning of the first sentence of the effects clause from &quot;Extracts
! characters&quot; to &quot;Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts
! characters&quot;
  </p>
  
  <p>
*************** characters"
*** 3717,3726 ****
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 17.  Change the
! beginning of the first sentence of the effects clause from "Extracts
! characters" to "Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts
! characters"
  </p>
  
  <p>
--- 2865,2874 ----
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 17.  Change the
! beginning of the first sentence of the effects clause from &quot;Extracts
! characters&quot; to &quot;Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts
! characters&quot;
  </p>
  
  <p>
*************** characters"
*** 3729,3803 ****
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 24.  Change the
! beginning of the first sentence of the effects clause from "Extracts
! characters" to "Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts
! characters"
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], before paragraph 27.  Add an
! Effects clause: "Effects: Behaves as an unformatted input function (as
  described in 27.6.1.3, paragraph 1).  After constructing a sentry
! object, reads but does not extract the current input character."
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 28.  Change the
! first sentence of the Effects clause from "If !good() calls" to
  Behaves as an unformatted input function (as described in 27.6.1.3,
! paragraph 1).  After constructing a sentry object, if !good() calls"
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 30.  Change the
! first sentence of the Effects clause from "If !good() calls" to
! "Behaves as an unformatted input function (as described in 27.6.1.3,
! paragraph 1).  After constructing a sentry object, if !good() calls"
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 32.  Change the
! first sentence of the Effects clause from "If !good() calls..." to
! "Behaves as an unformatted input function (as described in 27.6.1.3,
  paragraph 1).  After constructing a sentry object, if !good()
! calls..."  Add a new sentence to the end of the Effects clause:
! "[Note: this function extracts no characters, so the value returned
! by the next call to gcount() is 0.]"
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 34.  Change the
! first sentence of the Effects clause from "If !good() calls" to
! "Behaves as an unformatted input function (as described in 27.6.1.3,
! paragraph 1).  After constructing a sentry object, if !good() calls".
! Add a new sentence to the end of the Effects clause: "[Note: this
  function extracts no characters, so the value returned by the next
! call to gcount() is 0.]"
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 36.  Change the
! first sentence of the Effects clause from "If !rdbuf() is" to "Behaves
  as an unformatted input function (as described in 27.6.1.3, paragraph
  1), except that it does not count the number of characters extracted
  and does not affect the value returned by subsequent calls to
! gcount().  After constructing a sentry object, if rdbuf() is"
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], before paragraph 37.  Add an
! Effects clause: "Effects: Behaves as an unformatted input function (as
  described in 27.6.1.3, paragraph 1), except that it does not count the
  number of characters extracted and does not affect the value returned
! by subsequent calls to gcount()."  Change the first sentence of
! paragraph 37 from "if fail()" to "after constructing a sentry object,
! if fail()".
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 38.  Change the
! first sentence of the Effects clause from "If fail()" to "Behaves
  as an unformatted input function (as described in 27.6.1.3, paragraph
  1), except that it does not count the number of characters extracted
  and does not affect the value returned by subsequent calls to
--- 2877,2951 ----
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 24.  Change the
! beginning of the first sentence of the effects clause from &quot;Extracts
! characters&quot; to &quot;Behaves as an unformatted input function (as described
  in 27.6.1.3, paragraph 1).  After constructing a sentry object, extracts
! characters&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], before paragraph 27.  Add an
! Effects clause: &quot;Effects: Behaves as an unformatted input function (as
  described in 27.6.1.3, paragraph 1).  After constructing a sentry
! object, reads but does not extract the current input character.&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 28.  Change the
! first sentence of the Effects clause from &quot;If !good() calls&quot; to
  Behaves as an unformatted input function (as described in 27.6.1.3,
! paragraph 1).  After constructing a sentry object, if !good() calls&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 30.  Change the
! first sentence of the Effects clause from &quot;If !good() calls&quot; to
! &quot;Behaves as an unformatted input function (as described in 27.6.1.3,
! paragraph 1).  After constructing a sentry object, if !good() calls&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 32.  Change the
! first sentence of the Effects clause from &quot;If !good() calls...&quot; to
! &quot;Behaves as an unformatted input function (as described in 27.6.1.3,
  paragraph 1).  After constructing a sentry object, if !good()
! calls...&quot;  Add a new sentence to the end of the Effects clause:
! &quot;[Note: this function extracts no characters, so the value returned
! by the next call to gcount() is 0.]&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 34.  Change the
! first sentence of the Effects clause from &quot;If !good() calls&quot; to
! &quot;Behaves as an unformatted input function (as described in 27.6.1.3,
! paragraph 1).  After constructing a sentry object, if !good() calls&quot;.
! Add a new sentence to the end of the Effects clause: &quot;[Note: this
  function extracts no characters, so the value returned by the next
! call to gcount() is 0.]&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 36.  Change the
! first sentence of the Effects clause from &quot;If !rdbuf() is&quot; to &quot;Behaves
  as an unformatted input function (as described in 27.6.1.3, paragraph
  1), except that it does not count the number of characters extracted
  and does not affect the value returned by subsequent calls to
! gcount().  After constructing a sentry object, if rdbuf() is&quot;
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], before paragraph 37.  Add an
! Effects clause: &quot;Effects: Behaves as an unformatted input function (as
  described in 27.6.1.3, paragraph 1), except that it does not count the
  number of characters extracted and does not affect the value returned
! by subsequent calls to gcount().&quot;  Change the first sentence of
! paragraph 37 from &quot;if fail()&quot; to &quot;after constructing a sentry object,
! if fail()&quot;.
  </p>
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 38.  Change the
! first sentence of the Effects clause from &quot;If fail()&quot; to &quot;Behaves
  as an unformatted input function (as described in 27.6.1.3, paragraph
  1), except that it does not count the number of characters extracted
  and does not affect the value returned by subsequent calls to
*************** gcount().  After constructing a sentry o
*** 3806,3812 ****
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 40.  Change the
! first sentence of the Effects clause from "If fail()" to "Behaves
  as an unformatted input function (as described in 27.6.1.3, paragraph
  1), except that it does not count the number of characters extracted
  and does not affect the value returned by subsequent calls to
--- 2954,2960 ----
  
  <p>
  In 27.6.1.3, [lib.istream.unformatted], paragraph 40.  Change the
! first sentence of the Effects clause from &quot;If fail()&quot; to &quot;Behaves
  as an unformatted input function (as described in 27.6.1.3, paragraph
  1), except that it does not count the number of characters extracted
  and does not affect the value returned by subsequent calls to
*************** gcount().  After constructing a sentry o
*** 3815,3869 ****
  
  <p>
  In 27.6.2.5.2 [lib.ostream.inserters.arithmetic], paragraph 1.  Change
! the beginning of the third sentence from "The formatting conversion"
! to "These extractors behave as formatted output functions (as
  described in 27.6.2.5.1).  After the sentry object is constructed, the
! conversion occurs".
  </p>
  
  <p>
  In 27.6.2.5.3 [lib.ostream.inserters], before paragraph 1.  Add an
! effects clause: "Effects: None. Does not behave as a formatted output
! function (as described in 27.6.2.5.1).".
  </p>
  
  <p>
  In 27.6.2.5.3 [lib.ostream.inserters], paragraph 2.  Change the
! effects clause to "Effects: calls pf(*this).  This extractor does not
! behave as a formatted output function (as described in 27.6.2.5.1).".
  </p>
  
  <p>
  In 27.6.2.5.3 [lib.ostream.inserters], paragraph 4.  Change the
! effects clause to "Effects: calls pf(*this).  This extractor does not
! behave as a formatted output function (as described in 27.6.2.5.1).".
  </p>
  
  <p>
  In 27.6.2.5.3 [lib.ostream.inserters], paragraph 6.  Change the first
! sentence from "If sb" to "Behaves as a formatted output function (as
  described in 27.6.2.5.1).  After the sentry object is constructed, if
! sb".
  </p>
  
  <p>
  In 27.6.2.6 [lib.ostream.unformatted], paragraph 2.  Change the first
! sentence from "Inserts the character" to "Behaves as an unformatted
  output function (as described in 27.6.2.6, paragraph 1).  After
! constructing a sentry object, inserts the character".
  </p>
  
  <p>
  In 27.6.2.6 [lib.ostream.unformatted], paragraph 5.  Change the first
! sentence from "Obtains characters" to "Behaves as an unformatted
  output function (as described in 27.6.2.6, paragraph 1).  After
! constructing a sentry object, obtains characters".
  </p>
  
  <p>
  In 27.6.2.6 [lib.ostream.unformatted], paragraph 7.  Add a new
! sentence at the end of the paragraph: "Does not behave as an
! unformatted output function (as described in 27.6.2.6, paragraph 1)."
  </p>
  
  
--- 2963,3017 ----
  
  <p>
  In 27.6.2.5.2 [lib.ostream.inserters.arithmetic], paragraph 1.  Change
! the beginning of the third sentence from &quot;The formatting conversion&quot;
! to &quot;These extractors behave as formatted output functions (as
  described in 27.6.2.5.1).  After the sentry object is constructed, the
! conversion occurs&quot;.
  </p>
  
  <p>
  In 27.6.2.5.3 [lib.ostream.inserters], before paragraph 1.  Add an
! effects clause: &quot;Effects: None. Does not behave as a formatted output
! function (as described in 27.6.2.5.1).&quot;.
  </p>
  
  <p>
  In 27.6.2.5.3 [lib.ostream.inserters], paragraph 2.  Change the
! effects clause to &quot;Effects: calls pf(*this).  This extractor does not
! behave as a formatted output function (as described in 27.6.2.5.1).&quot;.
  </p>
  
  <p>
  In 27.6.2.5.3 [lib.ostream.inserters], paragraph 4.  Change the
! effects clause to &quot;Effects: calls pf(*this).  This extractor does not
! behave as a formatted output function (as described in 27.6.2.5.1).&quot;.
  </p>
  
  <p>
  In 27.6.2.5.3 [lib.ostream.inserters], paragraph 6.  Change the first
! sentence from &quot;If sb&quot; to &quot;Behaves as a formatted output function (as
  described in 27.6.2.5.1).  After the sentry object is constructed, if
! sb&quot;.
  </p>
  
  <p>
  In 27.6.2.6 [lib.ostream.unformatted], paragraph 2.  Change the first
! sentence from &quot;Inserts the character&quot; to &quot;Behaves as an unformatted
  output function (as described in 27.6.2.6, paragraph 1).  After
! constructing a sentry object, inserts the character&quot;.
  </p>
  
  <p>
  In 27.6.2.6 [lib.ostream.unformatted], paragraph 5.  Change the first
! sentence from &quot;Obtains characters&quot; to &quot;Behaves as an unformatted
  output function (as described in 27.6.2.6, paragraph 1).  After
! constructing a sentry object, obtains characters&quot;.
  </p>
  
  <p>
  In 27.6.2.6 [lib.ostream.unformatted], paragraph 7.  Add a new
! sentence at the end of the paragraph: &quot;Does not behave as an
! unformatted output function (as described in 27.6.2.6, paragraph 1).&quot;
  </p>
  
  
*************** VI of that paper.</p>
*** 3878,3887 ****
  
  <hr>
  <h3><a name="61"></a>61. Ambiguity in iostreams exception policy</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The introduction to the section on unformatted input (27.6.1.3)
  says that every unformatted input function catches all exceptions that
--- 3026,3036 ----
  
  <hr>
  <h3><a name="61"></a>61. Ambiguity in iostreams exception policy</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The introduction to the section on unformatted input (27.6.1.3)
  says that every unformatted input function catches all exceptions that
*************** circumstances as setting eofbit and/or f
*** 3892,3898 ****
  correctly, that setting eofbit or failbit can sometimes result in an
  exception being thrown.) The question: if one of these functions
  throws an exception triggered by setting failbit, is this an exception
! "thrown during input" and hence covered by 27.6.1.3, or does
  27.6.1.3 only refer to a limited class of exceptions? Just to make
  this concrete, suppose you have the following snippet. </p>
  
--- 3041,3047 ----
  correctly, that setting eofbit or failbit can sometimes result in an
  exception being thrown.) The question: if one of these functions
  throws an exception triggered by setting failbit, is this an exception
! &quot;thrown during input&quot; and hence covered by 27.6.1.3, or does
  27.6.1.3 only refer to a limited class of exceptions? Just to make
  this concrete, suppose you have the following snippet. </p>
  
*************** be thrown? </p>
*** 3911,3919 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  In 27.6.1.3, paragraph 1, after the sentence that begins
! "If an exception is thrown...", add the following
! parenthetical comment: "(Exceptions thrown from 
! <tt>basic_ios&lt;&gt;::clear()</tt> are not caught or rethrown.)"
  </p>
  
  
--- 3060,3068 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  In 27.6.1.3, paragraph 1, after the sentence that begins
! &quot;If an exception is thrown...&quot;, add the following
! parenthetical comment: &quot;(Exceptions thrown from 
! <tt>basic_ios&lt;&gt;::clear()</tt> are not caught or rethrown.)&quot;
  </p>
  
  
*************** resolution as better standardese.</p>
*** 3927,3948 ****
  
  <hr>
  <h3><a name="62"></a>62. <tt>Sync</tt>'s return value</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The Effects clause for sync() (27.6.1.3, paragraph 36) says that it
! "calls rdbuf()-&gt;pubsync() and, if that function returns -1
! ... returns traits::eof()." </p>
  
  <p>That looks suspicious, because traits::eof() is of type
  traits::int_type while the return type of sync() is int. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.1.3 [istream.unformatted], paragraph 36, change "returns
! <tt>traits::eof()</tt>" to "returns <tt>-1</tt>".
  </p>
  
  
--- 3076,3098 ----
  
  <hr>
  <h3><a name="62"></a>62. <tt>Sync</tt>'s return value</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The Effects clause for sync() (27.6.1.3, paragraph 36) says that it
! &quot;calls rdbuf()-&gt;pubsync() and, if that function returns -1
! ... returns traits::eof().&quot; </p>
  
  <p>That looks suspicious, because traits::eof() is of type
  traits::int_type while the return type of sync() is int. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.2.3 [istream.unformatted], paragraph 36, change &quot;returns
! <tt>traits::eof()</tt>&quot; to &quot;returns <tt>-1</tt>&quot;.
  </p>
  
  
*************** traits::int_type while the return type o
*** 3951,3960 ****
  
  <hr>
  <h3><a name="63"></a>63. Exception-handling policy for unformatted output</h3>
! <p><b>Section:</b> 27.7.2.7 [ostream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream.unformatted">issues</a> in [ostream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Clause 27 details an exception-handling policy for formatted input,
  unformatted input, and formatted output. It says nothing for
--- 3101,3110 ----
  
  <hr>
  <h3><a name="63"></a>63. Exception-handling policy for unformatted output</h3>
! <p><b>Section:</b> 27.7.3.7 [ostream.unformatted] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream.unformatted">issues</a> in [ostream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Clause 27 details an exception-handling policy for formatted input,
  unformatted input, and formatted output. It says nothing for
*************** deliberate. </p>
*** 3966,3975 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.6.2.6, paragraph 1, replace the last sentence ("In any
  case, the unformatted output function ends by destroying the sentry
  object, then returning the value specified for the formatted output
! function.") with the following text:
  </p>
  <blockquote><p>
  If an exception is thrown during output, then <tt>ios::badbit</tt> is
--- 3116,3125 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.6.2.6, paragraph 1, replace the last sentence (&quot;In any
  case, the unformatted output function ends by destroying the sentry
  object, then returning the value specified for the formatted output
! function.&quot;) with the following text:
  </p>
  <blockquote><p>
  If an exception is thrown during output, then <tt>ios::badbit</tt> is
*************** input, unformatted input, and formatted
*** 3994,4003 ****
  
  <hr>
  <h3><a name="64"></a>64. Exception handling in <tt>basic_istream::operator&gt;&gt;(basic_streambuf*)</tt></h3>
! <p><b>Section:</b> 27.7.1.2.3 [istream::extractors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.6.1.2.3, paragraph 13, is ambiguous. It can be interpreted two
  different ways, depending on whether the second sentence is read as an
--- 3144,3153 ----
  
  <hr>
  <h3><a name="64"></a>64. Exception handling in <tt>basic_istream::operator&gt;&gt;(basic_streambuf*)</tt></h3>
! <p><b>Section:</b> 27.7.2.2.3 [istream::extractors] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.6.1.2.3, paragraph 13, is ambiguous. It can be interpreted two
  different ways, depending on whether the second sentence is read as an
*************** elaboration of the first. </p>
*** 4005,4012 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace 27.7.1.2.3 [istream::extractors], paragraph 13, which begins
! "If the function inserts no characters ..." with:</p>
  
  <blockquote>
    <p>If the function inserts no characters, it calls
--- 3155,3162 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace 27.7.2.2.3 [istream::extractors], paragraph 13, which begins
! &quot;If the function inserts no characters ...&quot; with:</p>
  
  <blockquote>
    <p>If the function inserts no characters, it calls
*************** elaboration of the first. </p>
*** 4023,4044 ****
  
  <hr>
  <h3><a name="66"></a>66. Strstreambuf::setbuf</h3>
! <p><b>Section:</b> D.9.1.3 [depr.strstreambuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#depr.strstreambuf.virtuals">issues</a> in [depr.strstreambuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>D.7.1.3, paragraph 19, says that strstreambuf::setbuf
! "Performs an operation that is defined separately for each class
! derived from strstreambuf". This is obviously an incorrect
  cut-and-paste from basic_streambuf. There are no classes derived from
  strstreambuf. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>D.9.1.3 [depr.strstreambuf.virtuals], paragraph 19, replace the setbuf effects
! clause which currently says "Performs an operation that is
! defined separately for each class derived from strstreambuf"
  with:</p>
  
  <blockquote>
--- 3173,3194 ----
  
  <hr>
  <h3><a name="66"></a>66. Strstreambuf::setbuf</h3>
! <p><b>Section:</b> D.7.1.3 [depr.strstreambuf.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-08-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.strstreambuf.virtuals">issues</a> in [depr.strstreambuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>D.7.1.3, paragraph 19, says that strstreambuf::setbuf
! &quot;Performs an operation that is defined separately for each class
! derived from strstreambuf&quot;. This is obviously an incorrect
  cut-and-paste from basic_streambuf. There are no classes derived from
  strstreambuf. </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>D.7.1.3 [depr.strstreambuf.virtuals], paragraph 19, replace the setbuf effects
! clause which currently says &quot;Performs an operation that is
! defined separately for each class derived from strstreambuf&quot;
  with:</p>
  
  <blockquote>
*************** with:</p>
*** 4052,4061 ****
  
  <hr>
  <h3><a name="68"></a>68. Extractors for char* should store null at end</h3>
! <p><b>Section:</b> 27.7.1.2.3 [istream::extractors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1998-07-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Extractors for char* (27.6.1.2.3) do not store a null character
  after the extracted character sequence whereas the unformatted
--- 3202,3211 ----
  
  <hr>
  <h3><a name="68"></a>68. Extractors for char* should store null at end</h3>
! <p><b>Section:</b> 27.7.2.2.3 [istream::extractors] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1998-07-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Extractors for char* (27.6.1.2.3) do not store a null character
  after the extracted character sequence whereas the unformatted
*************** said a null is stored.</p>
*** 4068,4074 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>27.7.1.2.3 [istream::extractors], paragraph 7, change the last list
  item from:</p>
  
  <blockquote><p>
--- 3218,3224 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>27.7.2.2.3 [istream::extractors], paragraph 7, change the last list
  item from:</p>
  
  <blockquote><p>
*************** item from:</p>
*** 4090,4110 ****
  
  <hr>
  <h3><a name="69"></a>69. Must elements of a vector be contiguous?</h3>
! <p><b>Section:</b> 23.4.1 [vector] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1998-07-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The issue is this: Must the elements of a vector be in contiguous memory?</p>
  
  <p>(Please note that this is entirely separate from the question of
  whether a vector iterator is required to be a pointer; the answer to
! that question is clearly "no," as it would rule out
  debugging implementations)</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add the following text to the end of 23.4.1 [vector],
  paragraph 1. </p>
  
  <blockquote>
--- 3240,3260 ----
  
  <hr>
  <h3><a name="69"></a>69. Must elements of a vector be contiguous?</h3>
! <p><b>Section:</b> 23.3.6 [vector] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1998-07-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The issue is this: Must the elements of a vector be in contiguous memory?</p>
  
  <p>(Please note that this is entirely separate from the question of
  whether a vector iterator is required to be a pointer; the answer to
! that question is clearly &quot;no,&quot; as it would rule out
  debugging implementations)</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add the following text to the end of 23.3.6 [vector],
  paragraph 1. </p>
  
  <blockquote>
*************** paragraph 1. </p>
*** 4117,4132 ****
  
  <p><b>Rationale:</b></p>
  <p>The LWG feels that as a practical matter the answer is clearly
! "yes".  There was considerable discussion as to the best way
! to express the concept of "contiguous", which is not
  directly defined in the standard.  Discussion included:</p>
  
  <ul>
    <li>An operational definition similar to the above proposed resolution is 
!     already used for valarray (26.6.2.3 [valarray.access]).</li>
    <li>There is no need to explicitly consider a user-defined operator&amp; 
      because elements must be copyconstructible (23.2 [container.requirements] para 3) 
!     and copyconstructible (20.2.1 [utility.arg.requirements]) specifies
      requirements for operator&amp;.</li>
    <li>There is no issue of one-past-the-end because of language rules.</li>
  </ul>
--- 3267,3282 ----
  
  <p><b>Rationale:</b></p>
  <p>The LWG feels that as a practical matter the answer is clearly
! &quot;yes&quot;.  There was considerable discussion as to the best way
! to express the concept of &quot;contiguous&quot;, which is not
  directly defined in the standard.  Discussion included:</p>
  
  <ul>
    <li>An operational definition similar to the above proposed resolution is 
!     already used for valarray (26.6.2.4 [valarray.access]).</li>
    <li>There is no need to explicitly consider a user-defined operator&amp; 
      because elements must be copyconstructible (23.2 [container.requirements] para 3) 
!     and copyconstructible (17.6.3.1 [utility.arg.requirements]) specifies
      requirements for operator&amp;.</li>
    <li>There is no issue of one-past-the-end because of language rules.</li>
  </ul>
*************** directly defined in the standard.  Discu
*** 4137,4146 ****
  
  <hr>
  <h3><a name="70"></a>70. Uncaught_exception() missing throw() specification</h3>
! <p><b>Section:</b> 18.8 [support.exception], 18.8.4 [uncaught] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-08-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.exception">issues</a> in [support.exception].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In article 3E04@pratique.fr, Valentin Bonnard writes: </p>
  
--- 3287,3296 ----
  
  <hr>
  <h3><a name="70"></a>70. Uncaught_exception() missing throw() specification</h3>
! <p><b>Section:</b> 18.8 [support.exception], X [uncaught] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-08-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.exception">issues</a> in [support.exception].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In article 3E04@pratique.fr, Valentin Bonnard writes: </p>
  
*************** exception safety is very important.</p>
*** 4154,4180 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 15.5.3 [except.uncaught], paragraph 1, 18.8 [support.exception], and 18.8.4 [uncaught], add "throw()" to uncaught_exception().</p>
  
  
  
  
  <hr>
  <h3><a name="71"></a>71. Do_get_monthname synopsis missing argument</h3>
! <p><b>Section:</b> 22.4.5.1 [locale.time.get] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The locale facet member <tt>time_get&lt;&gt;::do_get_monthname</tt>
  is described in 22.4.5.1.2 [locale.time.get.virtuals] with five arguments,
  consistent with do_get_weekday and with its specified use by member
  get_monthname. However, in the synopsis, it is specified instead with
! four arguments. The missing argument is the "end" iterator
  value.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 22.4.5.1 [locale.time.get], add an "end" argument to
  the declaration of member do_monthname as follows:</p>
  
  <pre>  virtual iter_type do_get_monthname(iter_type s, iter_type end, ios_base&amp;,
--- 3304,3330 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 15.5.3 [except.uncaught], paragraph 1, 18.8 [support.exception], and X [uncaught], add &quot;throw()&quot; to uncaught_exception().</p>
  
  
  
  
  <hr>
  <h3><a name="71"></a>71. Do_get_monthname synopsis missing argument</h3>
! <p><b>Section:</b> 22.4.5.1 [locale.time.get] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-08-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The locale facet member <tt>time_get&lt;&gt;::do_get_monthname</tt>
  is described in 22.4.5.1.2 [locale.time.get.virtuals] with five arguments,
  consistent with do_get_weekday and with its specified use by member
  get_monthname. However, in the synopsis, it is specified instead with
! four arguments. The missing argument is the &quot;end&quot; iterator
  value.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 22.4.5.1 [locale.time.get], add an &quot;end&quot; argument to
  the declaration of member do_monthname as follows:</p>
  
  <pre>  virtual iter_type do_get_monthname(iter_type s, iter_type end, ios_base&amp;,
*************** the declaration of member do_monthname a
*** 4185,4196 ****
  
  <hr>
  <h3><a name="74"></a>74. Garbled text for <tt>codecvt::do_max_length</tt></h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-09-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The text of <tt>codecvt::do_max_length</tt>'s "Returns"
  clause (22.2.1.5.2, paragraph 11) is garbled. It has unbalanced
  parentheses and a spurious <b>n</b>.</p>
  
--- 3335,3346 ----
  
  <hr>
  <h3><a name="74"></a>74. Garbled text for <tt>codecvt::do_max_length</tt></h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-09-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The text of <tt>codecvt::do_max_length</tt>'s &quot;Returns&quot;
  clause (22.2.1.5.2, paragraph 11) is garbled. It has unbalanced
  parentheses and a spurious <b>n</b>.</p>
  
*************** following:</p>
*** 4212,4222 ****
  
  <hr>
  <h3><a name="75"></a>75. Contradiction in <tt>codecvt::length</tt>'s argument types</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
   <b>Submitter:</b>  Matt
! Austern <b>Opened:</b> 1998-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The class synopses for classes <tt>codecvt&lt;&gt;</tt> (22.2.1.5)
  and <tt>codecvt_byname&lt;&gt;</tt> (22.2.1.6) say that the first
--- 3362,3372 ----
  
  <hr>
  <h3><a name="75"></a>75. Contradiction in <tt>codecvt::length</tt>'s argument types</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
   <b>Submitter:</b>  Matt
! Austern <b>Opened:</b> 1998-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The class synopses for classes <tt>codecvt&lt;&gt;</tt> (22.2.1.5)
  and <tt>codecvt_byname&lt;&gt;</tt> (22.2.1.6) say that the first
*************** change the <tt>stateT</tt> argument type
*** 4261,4270 ****
  
  <hr>
  <h3><a name="76"></a>76. Can a <tt>codecvt</tt> facet always convert one internal character at a time?</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-09-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This issue concerns the requirements on classes derived from
  <tt>codecvt</tt>, including user-defined classes. What are the
--- 3411,3420 ----
  
  <hr>
  <h3><a name="76"></a>76. Can a <tt>codecvt</tt> facet always convert one internal character at a time?</h3>
! <p><b>Section:</b> 22.4.1.4 [locale.codecvt] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-09-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt">issues</a> in [locale.codecvt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This issue concerns the requirements on classes derived from
  <tt>codecvt</tt>, including user-defined classes. What are the
*************** that the corresponding sequence of inter
*** 4293,4299 ****
  character <tt>*ifirst</tt>?
  </p>
  
! <p>(What a "no" answer would mean is that
  <tt>my_encoding</tt> translates sequences only as blocks. There's a
  sequence of <i>M</i> external characters that maps to a sequence of
  <i>N</i> internal characters, but that external sequence has no
--- 3443,3449 ----
  character <tt>*ifirst</tt>?
  </p>
  
! <p>(What a &quot;no&quot; answer would mean is that
  <tt>my_encoding</tt> translates sequences only as blocks. There's a
  sequence of <i>M</i> external characters that maps to a sequence of
  <i>N</i> internal characters, but that external sequence has no
*************** and several of <tt>codecvt</tt>'s member
*** 4321,4336 ****
  <blockquote>
  <p>A <tt>codecvt</tt> facet that is used by <tt>basic_filebuf</tt>
  (27.9 [file.streams]) must have the property that if</p>
! <pre>    do_out(state, from, from_end, from_next, to, to_lim, to_next)
  </pre>
  <p>would return <tt>ok</tt>, where <tt>from != from_end</tt>, then </p>
! <pre>    do_out(state, from, from + 1, from_next, to, to_end, to_next)
  </pre>
  <p>must also return <tt>ok</tt>, and that if</p>
! <pre>    do_in(state, from, from_end, from_next, to, to_lim, to_next)
  </pre>
  <p>would return <tt>ok</tt>, where <tt>to != to_lim</tt>, then</p>
! <pre>    do_in(state, from, from_end, from_next, to, to + 1, to_next)
  </pre>
  <p>must also return <tt>ok</tt>.  [<i>Footnote:</i> Informally, this
  means that <tt>basic_filebuf</tt> assumes that the mapping from
--- 3471,3490 ----
  <blockquote>
  <p>A <tt>codecvt</tt> facet that is used by <tt>basic_filebuf</tt>
  (27.9 [file.streams]) must have the property that if</p>
! <pre>
!     do_out(state, from, from_end, from_next, to, to_lim, to_next)
  </pre>
  <p>would return <tt>ok</tt>, where <tt>from != from_end</tt>, then </p>
! <pre>
!     do_out(state, from, from + 1, from_next, to, to_end, to_next)
  </pre>
  <p>must also return <tt>ok</tt>, and that if</p>
! <pre>
!     do_in(state, from, from_end, from_next, to, to_lim, to_next)
  </pre>
  <p>would return <tt>ok</tt>, where <tt>to != to_lim</tt>, then</p>
! <pre>
!     do_in(state, from, from_end, from_next, to, to + 1, to_next)
  </pre>
  <p>must also return <tt>ok</tt>.  [<i>Footnote:</i> Informally, this
  means that <tt>basic_filebuf</tt> assumes that the mapping from
*************** return value.]</i></p>
*** 4384,4410 ****
  
  <hr>
  <h3><a name="78"></a>78. Typo: event_call_back</h3>
! <p><b>Section:</b> 27.5.2 [ios.base] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios.base">issues</a> in [ios.base].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>typo: event_call_back should be event_callback &nbsp; </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In the 27.5.2 [ios.base] synopsis change
! "event_call_back" to "event_callback". </p>
  
  
  
  
  <hr>
  <h3><a name="79"></a>79. Inconsistent declaration of polar()</h3>
! <p><b>Section:</b> 26.4.1 [complex.syn], 26.4.7 [complex.value.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.syn">issues</a> in [complex.syn].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 26.4.1 [complex.syn] polar is declared as follows:</p>
  <pre>   template&lt;class T&gt; complex&lt;T&gt; polar(const T&amp;, const T&amp;); </pre>
--- 3538,3564 ----
  
  <hr>
  <h3><a name="78"></a>78. Typo: event_call_back</h3>
! <p><b>Section:</b> 27.5.3 [ios.base] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios.base">issues</a> in [ios.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>typo: event_call_back should be event_callback &nbsp; </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In the 27.5.3 [ios.base] synopsis change
! &quot;event_call_back&quot; to &quot;event_callback&quot;. </p>
  
  
  
  
  <hr>
  <h3><a name="79"></a>79. Inconsistent declaration of polar()</h3>
! <p><b>Section:</b> 26.4.1 [complex.syn], 26.4.7 [complex.value.ops] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.syn">issues</a> in [complex.syn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 26.4.1 [complex.syn] polar is declared as follows:</p>
  <pre>   template&lt;class T&gt; complex&lt;T&gt; polar(const T&amp;, const T&amp;); </pre>
*************** return value.]</i></p>
*** 4428,4437 ****
  
  <hr>
  <h3><a name="80"></a>80. Global Operators of complex declared twice</h3>
! <p><b>Section:</b> 26.4.1 [complex.syn], 26.4.2 [complex] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.syn">issues</a> in [complex.syn].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Both 26.2.1 and 26.2.2 contain declarations of global operators for
  class complex. This redundancy should be removed.</p>
--- 3582,3591 ----
  
  <hr>
  <h3><a name="80"></a>80. Global Operators of complex declared twice</h3>
! <p><b>Section:</b> 26.4.1 [complex.syn], 26.4.2 [complex] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.syn">issues</a> in [complex.syn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Both 26.2.1 and 26.2.2 contain declarations of global operators for
  class complex. This redundancy should be removed.</p>
*************** class complex. This redundancy should be
*** 4445,4455 ****
  
  <hr>
  <h3><a name="83"></a>83. String::npos vs. string::max_size()</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#89">89</a></p>
  <p><b>Discussion:</b></p>
  <p>Many string member functions throw if size is getting or exceeding
  npos. However, I wonder why they don't throw if size is getting or
--- 3599,3610 ----
  
  <hr>
  <h3><a name="83"></a>83. String::npos vs. string::max_size()</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#89">89</a></p>
  <p><b>Discussion:</b></p>
  <p>Many string member functions throw if size is getting or exceeding
  npos. However, I wonder why they don't throw if size is getting or
*************** lacks some clarifications here.</p>
*** 4460,4467 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>After 21.4 [basic.string] paragraph 4 ("The functions
! described in this clause...") add a new paragraph:</p>
  
  <blockquote>
    <p>For any string operation, if as a result of the operation, <tt> size()</tt> would exceed
--- 3615,3622 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>After 21.4 [basic.string] paragraph 4 (&quot;The functions
! described in this clause...&quot;) add a new paragraph:</p>
  
  <blockquote>
    <p>For any string operation, if as a result of the operation, <tt> size()</tt> would exceed
*************** described in this clause...") add a new
*** 4478,4487 ****
  
  <hr>
  <h3><a name="86"></a>86. String constructors don't describe exceptions</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The constructor from a range:</p>
  
--- 3633,3642 ----
  
  <hr>
  <h3><a name="86"></a>86. String constructors don't describe exceptions</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The constructor from a range:</p>
  
*************** the range equals npos (or exceeds max_si
*** 4496,4519 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>In 21.4.1 [string.require], Strike throws paragraphs for
! constructors which say "Throws: length_error if n ==
! npos."</p>
  
  
  <p><b>Rationale:</b></p>
  <p>Throws clauses for length_error if n == npos are no longer needed
  because they are subsumed by the general wording added by the
! resolution for issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#83">83</a>.</p>
  
  
  
  
  <hr>
  <h3><a name="90"></a>90. Incorrect description of operator &gt;&gt; for strings</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The effect of operator &gt;&gt; for strings contain the following item:</p>
  
--- 3651,3674 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>In 21.4.1 [string.require], Strike throws paragraphs for
! constructors which say &quot;Throws: length_error if n ==
! npos.&quot;</p>
  
  
  <p><b>Rationale:</b></p>
  <p>Throws clauses for length_error if n == npos are no longer needed
  because they are subsumed by the general wording added by the
! resolution for issue <a href="lwg-defects.html#83">83</a>.</p>
  
  
  
  
  <hr>
  <h3><a name="90"></a>90. Incorrect description of operator &gt;&gt; for strings</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The effect of operator &gt;&gt; for strings contain the following item:</p>
  
*************** character c.</p>
*** 4542,4551 ****
  
  <hr>
  <h3><a name="91"></a>91. Description of operator&gt;&gt; and getline() for string&lt;&gt; might cause endless loop</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Operator &gt;&gt; and getline() for strings read until eof()
  in the input stream is true. However, this might never happen, if the
--- 3697,3706 ----
  
  <hr>
  <h3><a name="91"></a>91. Description of operator&gt;&gt; and getline() for string&lt;&gt; might cause endless loop</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Operator &gt;&gt; and getline() for strings read until eof()
  in the input stream is true. However, this might never happen, if the
*************** extracted and appended until any of the
*** 4566,4572 ****
  </p></blockquote>
  <p>with:</p>
  <blockquote><p>
! Effects: Behaves as a formatted input function (27.7.1.2.1 [istream.formatted.reqmts]).  After constructing a sentry object, if the
  sentry converts to true, calls str.erase() and then extracts
  characters from is and appends them to str as if by calling
  str.append(1,c). If is.width() is greater than zero, the maximum
--- 3721,3727 ----
  </p></blockquote>
  <p>with:</p>
  <blockquote><p>
! Effects: Behaves as a formatted input function (27.7.2.2.1 [istream.formatted.reqmts]).  After constructing a sentry object, if the
  sentry converts to true, calls str.erase() and then extracts
  characters from is and appends them to str as if by calling
  str.append(1,c). If is.width() is greater than zero, the maximum
*************** following occurs:
*** 4585,4591 ****
  </p></blockquote>
  <p>with:</p>
  <blockquote><p>
! Effects: Behaves as an unformatted input function (27.7.1.3 [istream.unformatted]), except that it does not affect the value returned
  by subsequent calls to basic_istream&lt;&gt;::gcount().  After
  constructing a sentry object, if the sentry converts to true, calls
  str.erase() and then extracts characters from is and appends them to
--- 3740,3746 ----
  </p></blockquote>
  <p>with:</p>
  <blockquote><p>
! Effects: Behaves as an unformatted input function (27.7.2.3 [istream.unformatted]), except that it does not affect the value returned
  by subsequent calls to basic_istream&lt;&gt;::gcount().  After
  constructing a sentry object, if the sentry converts to true, calls
  str.erase() and then extracts characters from is and appends them to
*************** there is no mechanism for <tt>gcount</tt
*** 4600,4606 ****
  <tt>basic_istream</tt>'s member functions.]</i></p>
  
  
! <p><i>[Curaçao: Nico agrees with proposed resolution.]</i></p>
  
  
  
--- 3755,3761 ----
  <tt>basic_istream</tt>'s member functions.]</i></p>
  
  
! <p><i>[Cura&ccedil;ao: Nico agrees with proposed resolution.]</i></p>
  
  
  
*************** functions do get characters from a strea
*** 4619,4628 ****
  
  <hr>
  <h3><a name="92"></a>92. Incomplete Algorithm Requirements</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard does not state, how often a function object is copied,
  called, or the order of calls inside an algorithm. This may lead to
--- 3774,3784 ----
  
  <hr>
  <h3><a name="92"></a>92. Incomplete Algorithm Requirements</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 1998-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#algorithms">active issues</a> in [algorithms].</p>
! <p><b>View all other</b> <a href="lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard does not state, how often a function object is copied,
  called, or the order of calls inside an algorithm. This may lead to
*************** affect the behavior of the function obje
*** 4691,4709 ****
  
  
  <p><i>[Pre-Kona: Nico comments: It seems the problem is that we don't
! have a clear statement of "predicate" in the
! standard. People including me seemed to think "a function
  returning a Boolean value and being able to be called by an STL
  algorithm or be used as sorting criterion or ... is a
! predicate". But a predicate has more requirements: It should
  never change its behavior due to a call or being copied. IMHO we have
  to state this in the standard. If you like, see section 8.1.4 of my
  library book for a detailed discussion.]</i></p>
  
  
! <p><i>[Kona: Nico will provide wording to the effect that "unless
  otherwise specified, the number of copies of and calls to function
! objects by algorithms is unspecified".&nbsp; Consider placing in
  25 [algorithms] after paragraph 9.]</i></p>
  
  
--- 3847,3865 ----
  
  
  <p><i>[Pre-Kona: Nico comments: It seems the problem is that we don't
! have a clear statement of &quot;predicate&quot; in the
! standard. People including me seemed to think &quot;a function
  returning a Boolean value and being able to be called by an STL
  algorithm or be used as sorting criterion or ... is a
! predicate&quot;. But a predicate has more requirements: It should
  never change its behavior due to a call or being copied. IMHO we have
  to state this in the standard. If you like, see section 8.1.4 of my
  library book for a detailed discussion.]</i></p>
  
  
! <p><i>[Kona: Nico will provide wording to the effect that &quot;unless
  otherwise specified, the number of copies of and calls to function
! objects by algorithms is unspecified&quot;.&nbsp; Consider placing in
  25 [algorithms] after paragraph 9.]</i></p>
  
  
*************** objects by algorithms is unspecified".&n
*** 4728,4737 ****
  
  <hr>
  <h3><a name="98"></a>98. Input iterator requirements are badly written</h3>
! <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Table 72 in 24.2.3 [input.iterators] specifies semantics for
  <tt>*r++</tt> of:</p>
--- 3884,3893 ----
  
  <hr>
  <h3><a name="98"></a>98. Input iterator requirements are badly written</h3>
! <p><b>Section:</b> 24.2.3 [input.iterators] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.iterators">issues</a> in [input.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Table 72 in 24.2.3 [input.iterators] specifies semantics for
  <tt>*r++</tt> of:</p>
*************** This is too specific: we want to allow *
*** 4746,4752 ****
  suggests that the effects *r++ should precisely replicate the behavior
  of this code, including side effects.  (Does this mean that *r++
  should invoke the copy constructor exactly as many times as the sample
! code above would?) See issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#334">334</a> for a similar
  problem.</p>
  
  
--- 3902,3908 ----
  suggests that the effects *r++ should precisely replicate the behavior
  of this code, including side effects.  (Does this mean that *r++
  should invoke the copy constructor exactly as many times as the sample
! code above would?) See issue <a href="lwg-defects.html#334">334</a> for a similar
  problem.</p>
  
  
*************** for <tt>*r++</tt> from <tt>T</tt> to "co
*** 4782,4792 ****
  
  <hr>
  <h3><a name="103"></a>103. set::iterator is required to be modifiable, but this allows modification of keys</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Set::iterator is described as implementation-defined with a
  reference to the container requirement; the container requirement says
--- 3938,3948 ----
  
  <hr>
  <h3><a name="103"></a>103. set::iterator is required to be modifiable, but this allows modification of keys</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Set::iterator is described as implementation-defined with a
  reference to the container requirement; the container requirement says
*************** specified. Especially considering that t
*** 4799,4805 ****
  that iterator for associative containers be different from
  const_iterator. Set, for example, has the following: </p>
  
! <p><tt>typedef implementation defined iterator;<br>
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // See _lib.container.requirements_</tt></p>
  
  <p>23.2 [container.requirements] actually requires that iterator type pointing
--- 3955,3961 ----
  that iterator for associative containers be different from
  const_iterator. Set, for example, has the following: </p>
  
! <p><tt>typedef implementation defined iterator;<br/>
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // See _lib.container.requirements_</tt></p>
  
  <p>23.2 [container.requirements] actually requires that iterator type pointing
*************** goes in line with trusting user knows wh
*** 4816,4822 ****
  <p><b>Other Options Evaluated:</b> </p>
  
  <p>Option A.&nbsp;&nbsp; In 23.2.4 [associative.reqmts], paragraph 2, after
! first sentence, and before "In addition,...", add one line:
  </p>
  
  <blockquote>
--- 3972,3978 ----
  <p><b>Other Options Evaluated:</b> </p>
  
  <p>Option A.&nbsp;&nbsp; In 23.2.4 [associative.reqmts], paragraph 2, after
! first sentence, and before &quot;In addition,...&quot;, add one line:
  </p>
  
  <blockquote>
*************** first sentence, and before "In addition,
*** 4826,4838 ****
  <p>Option B.&nbsp;Add three new sentences to 23.2.4 [associative.reqmts]:</p>
  
  <blockquote>
!   <p>At the end of paragraph 5: "Keys in an associative container
!   are immutable." At the end of paragraph 6: "For
    associative containers where the value type is the same as the key
    type, both <tt>iterator</tt> and <tt>const_iterator</tt> are
    constant iterators. It is unspecified whether or not
    <tt>iterator</tt> and <tt>const_iterator</tt> are the same
!   type."</p>
  </blockquote>
  
  <p>Option C.&nbsp;To 23.2.4 [associative.reqmts], paragraph 3, which
--- 3982,3994 ----
  <p>Option B.&nbsp;Add three new sentences to 23.2.4 [associative.reqmts]:</p>
  
  <blockquote>
!   <p>At the end of paragraph 5: &quot;Keys in an associative container
!   are immutable.&quot; At the end of paragraph 6: &quot;For
    associative containers where the value type is the same as the key
    type, both <tt>iterator</tt> and <tt>const_iterator</tt> are
    constant iterators. It is unspecified whether or not
    <tt>iterator</tt> and <tt>const_iterator</tt> are the same
!   type.&quot;</p>
  </blockquote>
  
  <p>Option C.&nbsp;To 23.2.4 [associative.reqmts], paragraph 3, which
*************** currently reads:</p>
*** 4865,4878 ****
  the indicated location:</p>
  
  <blockquote>
!   <p>At the end of paragraph 3: "For any two keys k1 and k2 in the same container,
    calling comp(k1, k2) shall always return the same
!   value."</p>
!   <p>At the end of paragraph 5: "Keys in an associative container are immutable."</p>
!   <p>At the end of paragraph 6: "For associative containers where the value type is the
    same as the key type, both <tt>iterator</tt> and <tt>const_iterator</tt> are constant
    iterators. It is unspecified whether or not <tt>iterator</tt> and <tt>const_iterator</tt>
!   are the same type."</p>
  </blockquote>
  
  
--- 4021,4034 ----
  the indicated location:</p>
  
  <blockquote>
!   <p>At the end of paragraph 3: &quot;For any two keys k1 and k2 in the same container,
    calling comp(k1, k2) shall always return the same
!   value.&quot;</p>
!   <p>At the end of paragraph 5: &quot;Keys in an associative container are immutable.&quot;</p>
!   <p>At the end of paragraph 6: &quot;For associative containers where the value type is the
    same as the key type, both <tt>iterator</tt> and <tt>const_iterator</tt> are constant
    iterators. It is unspecified whether or not <tt>iterator</tt> and <tt>const_iterator</tt>
!   are the same type.&quot;</p>
  </blockquote>
  
  
*************** conversion from <tt>iterator</tt> to <tt
*** 4908,4917 ****
  
  <hr>
  <h3><a name="106"></a>106. Numeric library private members are implementation defined</h3>
! <p><b>Section:</b> 26.6.5 [template.slice.array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.slice.array">issues</a> in [template.slice.array].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This is the only place in the whole standard where the implementation has to document
  something private.</p>
--- 4064,4073 ----
  
  <hr>
  <h3><a name="106"></a>106. Numeric library private members are implementation defined</h3>
! <p><b>Section:</b> 26.6.5 [template.slice.array] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.slice.array">issues</a> in [template.slice.array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This is the only place in the whole standard where the implementation has to document
  something private.</p>
*************** something private.</p>
*** 4919,4925 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Remove the comment which says "// remainder implementation defined" from:
  </p>
  
  <ul>
--- 4075,4081 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Remove the comment which says &quot;// remainder implementation defined&quot; from:
  </p>
  
  <ul>
*************** Remove the comment which says "// remain
*** 4935,4943 ****
  
  <hr>
  <h3><a name="108"></a>108. Lifetime of exception::what() return unspecified</h3>
! <p><b>Section:</b> 18.7.1 [type.info] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 18.6.1, paragraphs 8-9, the lifetime of the return value of
  exception::what() is left unspecified. This issue has implications
--- 4091,4100 ----
  
  <hr>
  <h3><a name="108"></a>108. Lifetime of exception::what() return unspecified</h3>
! <p><b>Section:</b> 18.7.1 [type.info] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> AFNOR <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#type.info">issues</a> in [type.info].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 18.6.1, paragraphs 8-9, the lifetime of the return value of
  exception::what() is left unspecified. This issue has implications
*************** returned by <tt>what()</tt>.
*** 4967,4981 ****
  
  <hr>
  <h3><a name="109"></a>109. Missing binders for non-const sequence elements</h3>
! <p><b>Section:</b> D.11 [depr.lib.binders] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bjarne Stroustrup <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#depr.lib.binders">issues</a> in [depr.lib.binders].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>There are no versions of binders that apply to non-const elements
  of a sequence. This makes examples like for_each() using bind2nd() on
! page 521 of "The C++ Programming Language (3rd)"
  non-conforming. Suitable versions of the binders need to be added.</p>
  
  <p>Further discussion from Nico:</p>
--- 4124,4138 ----
  
  <hr>
  <h3><a name="109"></a>109. Missing binders for non-const sequence elements</h3>
! <p><b>Section:</b> X [depr.lib.binders] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bjarne Stroustrup <b>Opened:</b> 1998-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.lib.binders">issues</a> in [depr.lib.binders].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>There are no versions of binders that apply to non-const elements
  of a sequence. This makes examples like for_each() using bind2nd() on
! page 521 of &quot;The C++ Programming Language (3rd)&quot;
  non-conforming. Suitable versions of the binders need to be added.</p>
  
  <p>Further discussion from Nico:</p>
*************** public:
*** 5048,5071 ****
  <p><b>Howard believes there is a flaw</b> in this resolution.
  See c++std-lib-9127.  We may need to reopen this issue.</p>
  
! <p>In D.11 [depr.lib.binders] in the declaration of binder1st after:</p>
  <blockquote>
!   <p><tt>typename Operation::result_type<br>
    &nbsp;operator()(const typename Operation::second_argument_type&amp; x) const;</tt></p>
  </blockquote>
  <p>insert:</p>
  <blockquote>
!   <p><tt>typename Operation::result_type<br>
    &nbsp;operator()(typename Operation::second_argument_type&amp; x) const;</tt></p>
  </blockquote>
! <p>In D.11 [depr.lib.binders] in the declaration of binder2nd after:</p>
  <blockquote>
!   <p><tt>typename Operation::result_type<br>
    &nbsp;operator()(const typename Operation::first_argument_type&amp; x) const;</tt></p>
  </blockquote>
  <p>insert:</p>
  <blockquote>
!   <p><tt>typename Operation::result_type<br>
    &nbsp;operator()(typename Operation::first_argument_type&amp; x) const;</tt></p>
  </blockquote>
  
--- 4205,4228 ----
  <p><b>Howard believes there is a flaw</b> in this resolution.
  See c++std-lib-9127.  We may need to reopen this issue.</p>
  
! <p>In X [depr.lib.binders] in the declaration of binder1st after:</p>
  <blockquote>
!   <p><tt>typename Operation::result_type<br/>
    &nbsp;operator()(const typename Operation::second_argument_type&amp; x) const;</tt></p>
  </blockquote>
  <p>insert:</p>
  <blockquote>
!   <p><tt>typename Operation::result_type<br/>
    &nbsp;operator()(typename Operation::second_argument_type&amp; x) const;</tt></p>
  </blockquote>
! <p>In X [depr.lib.binders] in the declaration of binder2nd after:</p>
  <blockquote>
!   <p><tt>typename Operation::result_type<br/>
    &nbsp;operator()(const typename Operation::first_argument_type&amp; x) const;</tt></p>
  </blockquote>
  <p>insert:</p>
  <blockquote>
!   <p><tt>typename Operation::result_type<br/>
    &nbsp;operator()(typename Operation::first_argument_type&amp; x) const;</tt></p>
  </blockquote>
  
*************** Leave open - 1.]</i></p>
*** 5087,5099 ****
  
  <hr>
  <h3><a name="110"></a>110. istreambuf_iterator::equal not const</h3>
! <p><b>Section:</b> 24.6.3 [istreambuf.iterator], 24.6.3.5 [istreambuf.iterator::equal] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-10-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istreambuf.iterator">issues</a> in [istreambuf.iterator].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Member istreambuf_iterator&lt;&gt;::equal is not declared
! "const", yet 24.6.3.6 [istreambuf.iterator::op==] says that operator==,
  which is const, calls it. This is contradictory. </p>
  
  
--- 4244,4256 ----
  
  <hr>
  <h3><a name="110"></a>110. istreambuf_iterator::equal not const</h3>
! <p><b>Section:</b> 24.6.3 [istreambuf.iterator], 24.6.3.5 [istreambuf.iterator::equal] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 1998-10-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istreambuf.iterator">issues</a> in [istreambuf.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Member istreambuf_iterator&lt;&gt;::equal is not declared
! &quot;const&quot;, yet 24.6.3.6 [istreambuf.iterator::op==] says that operator==,
  which is const, calls it. This is contradictory. </p>
  
  
*************** replace:</p>
*** 5117,5137 ****
  
  <hr>
  <h3><a name="112"></a>112. Minor typo in <tt>ostreambuf_iterator</tt> constructor</h3>
! <p><b>Section:</b> 24.6.4.1 [ostreambuf.iter.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-10-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The <b>requires</b> clause for <tt>ostreambuf_iterator</tt>'s
  constructor from an <tt>ostream_type</tt> (24.5.4.1, paragraph 1)
! reads "<i>s</i> is not null". However, <i>s</i> is a
  reference, and references can't be null. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 24.6.4.1 [ostreambuf.iter.cons]:</p>
  
! <p>Move the current paragraph 1, which reads "Requires: s is not
! null.", from the first constructor to the second constructor.</p>
  
  <p>Insert a new paragraph 1 Requires clause for the first constructor
  reading:</p>
--- 4274,4294 ----
  
  <hr>
  <h3><a name="112"></a>112. Minor typo in <tt>ostreambuf_iterator</tt> constructor</h3>
! <p><b>Section:</b> 24.6.4.1 [ostreambuf.iter.cons] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-10-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The <b>requires</b> clause for <tt>ostreambuf_iterator</tt>'s
  constructor from an <tt>ostream_type</tt> (24.5.4.1, paragraph 1)
! reads &quot;<i>s</i> is not null&quot;. However, <i>s</i> is a
  reference, and references can't be null. </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 24.6.4.1 [ostreambuf.iter.cons]:</p>
  
! <p>Move the current paragraph 1, which reads &quot;Requires: s is not
! null.&quot;, from the first constructor to the second constructor.</p>
  
  <p>Insert a new paragraph 1 Requires clause for the first constructor
  reading:</p>
*************** reading:</p>
*** 5146,5156 ****
  
  <hr>
  <h3><a name="114"></a>114. Placement forms example in error twice</h3>
! <p><b>Section:</b> 18.6.1.3 [new.delete.placement] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-10-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#new.delete.placement">issues</a> in [new.delete.placement].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#196">196</a></p>
  <p><b>Discussion:</b></p>
  <p>Section 18.5.1.3 contains the following example: </p>
  
--- 4303,4313 ----
  
  <hr>
  <h3><a name="114"></a>114. Placement forms example in error twice</h3>
! <p><b>Section:</b> 18.6.1.3 [new.delete.placement] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-10-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete.placement">issues</a> in [new.delete.placement].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#196">196</a></p>
  <p><b>Discussion:</b></p>
  <p>Section 18.5.1.3 contains the following example: </p>
  
*************** reading:</p>
*** 5159,5165 ****
          Something* p = new (place) Something();
   -end example]</pre>
  
! <p>First code line: "place" need not have any special alignment, and the
  following constructor could fail due to misaligned data.</p>
  
  <p>Second code line: Aren't the parens on Something() incorrect?&nbsp; [Dublin: the LWG
--- 4316,4322 ----
          Something* p = new (place) Something();
   -end example]</pre>
  
! <p>First code line: &quot;place&quot; need not have any special alignment, and the
  following constructor could fail due to misaligned data.</p>
  
  <p>Second code line: Aren't the parens on Something() incorrect?&nbsp; [Dublin: the LWG
*************** likely to fail.</p>
*** 5184,5192 ****
  
  <hr>
  <h3><a name="115"></a>115. Typo in strstream constructors</h3>
! <p><b>Section:</b> D.9.4.1 [depr.strstream.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>D.7.4.1 strstream constructors paragraph 2 says: </p>
  
--- 4341,4349 ----
  
  <hr>
  <h3><a name="115"></a>115. Typo in strstream constructors</h3>
! <p><b>Section:</b> D.7.4.1 [depr.strstream.cons] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 1998-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>D.7.4.1 strstream constructors paragraph 2 says: </p>
  
*************** likely to fail.</p>
*** 5201,5212 ****
  </blockquote>
  
  <p>Notice the second condition is the same as the first. I think the second condition
! should be "If mode&amp;app==app", or "mode&amp;app!=0", meaning that
  the append bit is set.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In D.9.3.1 [depr.ostrstream.cons] paragraph 2 and D.9.4.1 [depr.strstream.cons]
  paragraph 2, change the first condition to <tt>(mode&amp;app)==0</tt>
  and the second condition to <tt>(mode&amp;app)!=0</tt>.</p>
  
--- 4358,4369 ----
  </blockquote>
  
  <p>Notice the second condition is the same as the first. I think the second condition
! should be &quot;If mode&amp;app==app&quot;, or &quot;mode&amp;app!=0&quot;, meaning that
  the append bit is set.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In D.7.3.1 [depr.ostrstream.cons] paragraph 2 and D.7.4.1 [depr.strstream.cons]
  paragraph 2, change the first condition to <tt>(mode&amp;app)==0</tt>
  and the second condition to <tt>(mode&amp;app)!=0</tt>.</p>
  
*************** and the second condition to <tt>(mode&am
*** 5216,5225 ****
  
  <hr>
  <h3><a name="117"></a>117. <tt>basic_ostream</tt> uses nonexistent <tt>num_put</tt> member functions</h3>
! <p><b>Section:</b> 27.7.2.6.2 [ostream.inserters.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-11-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream.inserters.arithmetic">issues</a> in [ostream.inserters.arithmetic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The <b>effects</b> clause for numeric inserters says that
  insertion of a value <tt>x</tt>, whose type is either <tt>bool</tt>,
--- 4373,4382 ----
  
  <hr>
  <h3><a name="117"></a>117. <tt>basic_ostream</tt> uses nonexistent <tt>num_put</tt> member functions</h3>
! <p><b>Section:</b> 27.7.3.6.2 [ostream.inserters.arithmetic] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-11-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream.inserters.arithmetic">issues</a> in [ostream.inserters.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The <b>effects</b> clause for numeric inserters says that
  insertion of a value <tt>x</tt>, whose type is either <tt>bool</tt>,
*************** formatting conversion occurs as if it pe
*** 5259,5265 ****
  fragment:
  </p>
  
! <pre>bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(), val). failed();
  </pre>
--- 4416,4423 ----
  fragment:
  </p>
  
! <pre>
! bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(), val). failed();
  </pre>
*************** When val is of type short the formatting
*** 5269,5275 ****
  performed the following code fragment:
  </p>
  
! <pre>ios_base::fmtflags baseflags = ios_base::flags() &amp; ios_base::basefield;
  bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(),
--- 4427,4434 ----
  performed the following code fragment:
  </p>
  
! <pre>
! ios_base::fmtflags baseflags = ios_base::flags() &amp; ios_base::basefield;
  bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(),
*************** When val is of type int the formatting c
*** 5283,5289 ****
  the following code fragment:
  </p>
  
! <pre>ios_base::fmtflags baseflags = ios_base::flags() &amp; ios_base::basefield;
  bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(),
--- 4442,4449 ----
  the following code fragment:
  </p>
  
! <pre>
! ios_base::fmtflags baseflags = ios_base::flags() &amp; ios_base::basefield;
  bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(),
*************** When val is of type unsigned short or un
*** 5297,5303 ****
  occurs as if it performed the following code fragment:
  </p>
  
! <pre>bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(), static_cast&lt;unsigned long&gt;(val)).
  failed();
--- 4457,4464 ----
  occurs as if it performed the following code fragment:
  </p>
  
! <pre>
! bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(), static_cast&lt;unsigned long&gt;(val)).
  failed();
*************** When val is of type float the formatting
*** 5308,5314 ****
  performed the following code fragment:
  </p>
  
! <pre>bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(), static_cast&lt;double&gt;(val)).
  failed();
--- 4469,4476 ----
  performed the following code fragment:
  </p>
  
! <pre>
! bool failed = use_facet&lt;
     num_put&lt;charT,ostreambuf_iterator&lt;charT,traits&gt; &gt;
     &gt;(getloc()).put(*this, *this, fill(), static_cast&lt;double&gt;(val)).
  failed();
*************** example, printing short(-1) in hex forma
*** 5337,5346 ****
  
  <hr>
  <h3><a name="118"></a>118. <tt>basic_istream</tt> uses nonexistent <tt>num_get</tt> member functions</h3>
! <p><b>Section:</b> 27.7.1.2.2 [istream.formatted.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-11-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.formatted.arithmetic">issues</a> in [istream.formatted.arithmetic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Formatted input is defined for the types <tt>short</tt>, <tt>unsigned short</tt>, <tt>int</tt>,
  <tt>unsigned int</tt>, <tt>long</tt>, <tt>unsigned long</tt>, <tt>float</tt>, <tt>double</tt>,
--- 4499,4508 ----
  
  <hr>
  <h3><a name="118"></a>118. <tt>basic_istream</tt> uses nonexistent <tt>num_get</tt> member functions</h3>
! <p><b>Section:</b> 27.7.2.2.2 [istream.formatted.arithmetic] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1998-11-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.formatted.arithmetic">issues</a> in [istream.formatted.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Formatted input is defined for the types <tt>short</tt>, <tt>unsigned short</tt>, <tt>int</tt>,
  <tt>unsigned int</tt>, <tt>long</tt>, <tt>unsigned long</tt>, <tt>float</tt>, <tt>double</tt>,
*************** that 27.6.1.2.2 is using a nonexistent f
*** 5363,5369 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.1.2.2 [istream.formatted.arithmetic] Arithmetic Extractors, remove the
  two lines (1st and 3rd) which read:</p>
  <blockquote>
    <pre>operator&gt;&gt;(short&amp; val);
--- 4525,4531 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.2.2.2 [istream.formatted.arithmetic] Arithmetic Extractors, remove the
  two lines (1st and 3rd) which read:</p>
  <blockquote>
    <pre>operator&gt;&gt;(short&amp; val);
*************** operator&gt;&gt;(int&amp; val);</pre>
*** 5407,5421 ****
  
  <hr>
  <h3><a name="119"></a>119. Should virtual functions be allowed to strengthen the exception specification?</h3>
! <p><b>Section:</b> 17.6.4.12 [res.on.exception.handling] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#res.on.exception.handling">issues</a> in [res.on.exception.handling].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Section 17.6.4.12 [res.on.exception.handling] states: </p>
  
! <p>"An implementation may strengthen the exception-specification
! for a function by removing listed exceptions." </p>
  
  <p>The problem is that if an implementation is allowed to do this for
  virtual functions, then a library user cannot write a class that
--- 4569,4583 ----
  
  <hr>
  <h3><a name="119"></a>119. Should virtual functions be allowed to strengthen the exception specification?</h3>
! <p><b>Section:</b> 17.6.5.12 [res.on.exception.handling] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#res.on.exception.handling">issues</a> in [res.on.exception.handling].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Section 17.6.5.12 [res.on.exception.handling] states: </p>
  
! <p>&quot;An implementation may strengthen the exception-specification
! for a function by removing listed exceptions.&quot; </p>
  
  <p>The problem is that if an implementation is allowed to do this for
  virtual functions, then a library user cannot write a class that
*************** public:
*** 5436,5450 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change Section 17.6.4.12 [res.on.exception.handling] from:</p>
  
! <p>&nbsp;&nbsp;&nbsp;&nbsp; "may strengthen the
! exception-specification for a function"</p>
  
  <p>to:</p>
  
! <p>&nbsp;&nbsp;&nbsp;&nbsp; "may strengthen the
! exception-specification for a non-virtual function". </p>
  
  
  
--- 4598,4612 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change Section 17.6.5.12 [res.on.exception.handling] from:</p>
  
! <p>&nbsp;&nbsp;&nbsp;&nbsp; &quot;may strengthen the
! exception-specification for a function&quot;</p>
  
  <p>to:</p>
  
! <p>&nbsp;&nbsp;&nbsp;&nbsp; &quot;may strengthen the
! exception-specification for a non-virtual function&quot;. </p>
  
  
  
*************** exception-specification for a non-virtua
*** 5452,5461 ****
  
  <hr>
  <h3><a name="120"></a>120. Can an implementor add specializations?</h3>
! <p><b>Section:</b> 17.6.3.3 [reserved.names] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#reserved.names">issues</a> in [reserved.names].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>The original issue asked whether a library implementor could
--- 4614,4623 ----
  
  <hr>
  <h3><a name="120"></a>120. Can an implementor add specializations?</h3>
! <p><b>Section:</b> 17.6.4.3 [reserved.names] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reserved.names">issues</a> in [reserved.names].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>The original issue asked whether a library implementor could
*************** different explicit instantiations might
*** 5503,5509 ****
  
  
  <p><b>Proposed resolution:</b></p>
!   <p>Append to 17.6.3.3 [reserved.names] paragraph 1: </p>
    <blockquote><p>
      A program may explicitly instantiate any templates in the standard
      library only if the declaration depends on the name of a user-defined
--- 4665,4671 ----
  
  
  <p><b>Proposed resolution:</b></p>
!   <p>Append to 17.6.4.3 [reserved.names] paragraph 1: </p>
    <blockquote><p>
      A program may explicitly instantiate any templates in the standard
      library only if the declaration depends on the name of a user-defined
*************** different explicit instantiations might
*** 5522,5528 ****
  <blockquote>
    <p>In light of the resolution to core issue 259, no normative changes
    in the library clauses are necessary.  Add the following non-normative
!   note to the end of 17.6.3.3 [reserved.names] paragraph 1:</p>
    <blockquote><p>
      [<i>Note:</i> A program may explicitly instantiate standard library
      templates, even when an explicit instantiation does not depend on
--- 4684,4690 ----
  <blockquote>
    <p>In light of the resolution to core issue 259, no normative changes
    in the library clauses are necessary.  Add the following non-normative
!   note to the end of 17.6.4.3 [reserved.names] paragraph 1:</p>
    <blockquote><p>
      [<i>Note:</i> A program may explicitly instantiate standard library
      templates, even when an explicit instantiation does not depend on
*************** different explicit instantiations might
*** 5567,5576 ****
  
  <hr>
  <h3><a name="122"></a>122. streambuf/wstreambuf description should not say they are specializations</h3>
! <p><b>Section:</b> 27.6.2 [streambuf] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#streambuf">issues</a> in [streambuf].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 27.5.2 describes the streambuf classes this way: </p>
  
--- 4729,4738 ----
  
  <hr>
  <h3><a name="122"></a>122. streambuf/wstreambuf description should not say they are specializations</h3>
! <p><b>Section:</b> 27.6.3 [streambuf] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#streambuf">issues</a> in [streambuf].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 27.5.2 describes the streambuf classes this way: </p>
  
*************** specialized for the type wchar_t. </p>
*** 5590,5596 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove 27.6.2 [streambuf] paragraphs 2 and 3 (the above two
  sentences). </p>
  
  
--- 4752,4758 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove 27.6.3 [streambuf] paragraphs 2 and 3 (the above two
  sentences). </p>
  
  
*************** typedefs and that is sufficient. </p>
*** 5604,5620 ****
  
  <hr>
  <h3><a name="123"></a>123. Should valarray helper arrays fill functions be const?</h3>
! <p><b>Section:</b> 26.6.5.3 [slice.arr.fill], 26.6.7.3 [gslice.array.fill], 26.6.8.3 [mask.array.fill], 26.6.9.3 [indirect.array.fill] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>One of the operator= in the valarray helper arrays is const and one
  is not. For example, look at slice_array. This operator= in Section
! 26.6.5.1 [slice.arr.assign] is const: </p>
  
  <p>&nbsp;&nbsp;&nbsp; <tt>void operator=(const valarray&lt;T&gt;&amp;) const;</tt> </p>
  
! <p>but this one in Section 26.6.5.3 [slice.arr.fill] is not: </p>
  
  <p>&nbsp;&nbsp;&nbsp; <tt>void operator=(const T&amp;); </tt></p>
  
--- 4766,4782 ----
  
  <hr>
  <h3><a name="123"></a>123. Should valarray helper arrays fill functions be const?</h3>
! <p><b>Section:</b> 26.6.5.4 [slice.arr.fill], 26.6.7.4 [gslice.array.fill], 26.6.8.4 [mask.array.fill], 26.6.9.4 [indirect.array.fill] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>One of the operator= in the valarray helper arrays is const and one
  is not. For example, look at slice_array. This operator= in Section
! 26.6.5.2 [slice.arr.assign] is const: </p>
  
  <p>&nbsp;&nbsp;&nbsp; <tt>void operator=(const valarray&lt;T&gt;&amp;) const;</tt> </p>
  
! <p>but this one in Section 26.6.5.4 [slice.arr.fill] is not: </p>
  
  <p>&nbsp;&nbsp;&nbsp; <tt>void operator=(const T&amp;); </tt></p>
  
*************** is not. For example, look at slice_array
*** 5628,5648 ****
  
     <p>In the class template definition for slice_array, replace the member
     function declaration</p>
!     <pre>      void operator=(const T&amp;);
      </pre>
     <p>with</p>
!     <pre>      void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
! <p>26.6.5.3 [slice.arr.fill] slice_array fill function</p>
  <blockquote>
  
     <p>Change the function declaration</p>
!     <pre>      void operator=(const T&amp;);
      </pre>
     <p>to</p>
!     <pre>      void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
--- 4790,4814 ----
  
     <p>In the class template definition for slice_array, replace the member
     function declaration</p>
!     <pre>
!       void operator=(const T&amp;);
      </pre>
     <p>with</p>
!     <pre>
!       void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
! <p>26.6.5.4 [slice.arr.fill] slice_array fill function</p>
  <blockquote>
  
     <p>Change the function declaration</p>
!     <pre>
!       void operator=(const T&amp;);
      </pre>
     <p>to</p>
!     <pre>
!       void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
*************** is not. For example, look at slice_array
*** 5651,5671 ****
  
     <p>In the class template definition for gslice_array, replace the member
     function declaration</p>
!     <pre>      void operator=(const T&amp;);
      </pre>
     <p>with</p>
!     <pre>      void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
! <p>26.6.7.3 [gslice.array.fill] gslice_array fill function</p>
  <blockquote>
  
     <p>Change the function declaration</p>
!     <pre>      void operator=(const T&amp;);
      </pre>
     <p>to</p>
!     <pre>      void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
--- 4817,4841 ----
  
     <p>In the class template definition for gslice_array, replace the member
     function declaration</p>
!     <pre>
!       void operator=(const T&amp;);
      </pre>
     <p>with</p>
!     <pre>
!       void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
! <p>26.6.7.4 [gslice.array.fill] gslice_array fill function</p>
  <blockquote>
  
     <p>Change the function declaration</p>
!     <pre>
!       void operator=(const T&amp;);
      </pre>
     <p>to</p>
!     <pre>
!       void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
*************** is not. For example, look at slice_array
*** 5674,5694 ****
  
     <p>In the class template definition for mask_array, replace the member
     function declaration</p>
!     <pre>      void operator=(const T&amp;);
      </pre>
     <p>with</p>
!     <pre>      void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
! <p>26.6.8.3 [mask.array.fill] mask_array fill function</p>
  <blockquote>
  
     <p>Change the function declaration</p>
!     <pre>      void operator=(const T&amp;);
      </pre>
     <p>to</p>
!     <pre>      void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
--- 4844,4868 ----
  
     <p>In the class template definition for mask_array, replace the member
     function declaration</p>
!     <pre>
!       void operator=(const T&amp;);
      </pre>
     <p>with</p>
!     <pre>
!       void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
! <p>26.6.8.4 [mask.array.fill] mask_array fill function</p>
  <blockquote>
  
     <p>Change the function declaration</p>
!     <pre>
!       void operator=(const T&amp;);
      </pre>
     <p>to</p>
!     <pre>
!       void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
*************** is not. For example, look at slice_array
*** 5697,5717 ****
  
     <p>In the class template definition for indirect_array, replace the member
     function declaration</p>
!     <pre>      void operator=(const T&amp;);
      </pre>
     <p>with</p>
!     <pre>      void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
! <p>26.6.9.3 [indirect.array.fill] indirect_array fill function</p>
  <blockquote>
  
     <p>Change the function declaration</p>
!     <pre>      void operator=(const T&amp;);
      </pre>
     <p>to</p>
!     <pre>      void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
--- 4871,4895 ----
  
     <p>In the class template definition for indirect_array, replace the member
     function declaration</p>
!     <pre>
!       void operator=(const T&amp;);
      </pre>
     <p>with</p>
!     <pre>
!       void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
! <p>26.6.9.4 [indirect.array.fill] indirect_array fill function</p>
  <blockquote>
  
     <p>Change the function declaration</p>
!     <pre>
!       void operator=(const T&amp;);
      </pre>
     <p>to</p>
!     <pre>
!       void operator=(const T&amp;) const;
      </pre>
  </blockquote>
  
*************** is not. For example, look at slice_array
*** 5723,5729 ****
  
  <p><b>Rationale:</b></p>
  <p>There's no good reason for one version of operator= being const and
! another one not.  Because of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#253">253</a>, this now
  matters: these functions are now callable in more circumstances.  In
  many existing implementations, both versions are already const.</p>
  
--- 4901,4907 ----
  
  <p><b>Rationale:</b></p>
  <p>There's no good reason for one version of operator= being const and
! another one not.  Because of issue <a href="lwg-defects.html#253">253</a>, this now
  matters: these functions are now callable in more circumstances.  In
  many existing implementations, both versions are already const.</p>
  
*************** many existing implementations, both vers
*** 5733,5742 ****
  
  <hr>
  <h3><a name="124"></a>124. ctype_byname&lt;charT&gt;::do_scan_is &amp; do_scan_not return type should be const charT*</h3>
! <p><b>Section:</b> 22.4.1.2 [locale.ctype.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.ctype.byname">issues</a> in [locale.ctype.byname].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 22.4.1.2 [locale.ctype.byname]
  ctype_byname&lt;charT&gt;::do_scan_is() and do_scan_not() are declared
--- 4911,4920 ----
  
  <hr>
  <h3><a name="124"></a>124. ctype_byname&lt;charT&gt;::do_scan_is &amp; do_scan_not return type should be const charT*</h3>
! <p><b>Section:</b> 22.4.1.2 [locale.ctype.byname] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.ctype.byname">issues</a> in [locale.ctype.byname].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 22.4.1.2 [locale.ctype.byname]
  ctype_byname&lt;charT&gt;::do_scan_is() and do_scan_not() are declared
*************** charT*</tt>. </p>
*** 5754,5766 ****
  
  <hr>
  <h3><a name="125"></a>125. valarray&lt;T&gt;::operator!() return type is inconsistent</h3>
! <p><b>Section:</b> 26.6.2 [template.valarray] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.valarray">issues</a> in [template.valarray].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 26.6.2 [template.valarray] valarray&lt;T&gt;::operator!() is
! declared to return a valarray&lt;T&gt;, but in Section 26.6.2.5 [valarray.unary] it is declared to return a valarray&lt;bool&gt;. The
  latter appears to be correct. </p>
  
  
--- 4932,4944 ----
  
  <hr>
  <h3><a name="125"></a>125. valarray&lt;T&gt;::operator!() return type is inconsistent</h3>
! <p><b>Section:</b> 26.6.2 [template.valarray] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.valarray">issues</a> in [template.valarray].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 26.6.2 [template.valarray] valarray&lt;T&gt;::operator!() is
! declared to return a valarray&lt;T&gt;, but in Section 26.6.2.6 [valarray.unary] it is declared to return a valarray&lt;bool&gt;. The
  latter appears to be correct. </p>
  
  
*************** latter appears to be correct. </p>
*** 5774,5783 ****
  
  <hr>
  <h3><a name="126"></a>126. typos in Effects clause of ctype::do_narrow()</h3>
! <p><b>Section:</b> 22.4.1.1.2 [locale.ctype.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.ctype.virtuals">issues</a> in [locale.ctype.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p><p>Typos in 22.2.1.1.2 need to be fixed.</p>
  
  <p><b>Proposed resolution:</b></p>
--- 4952,4961 ----
  
  <hr>
  <h3><a name="126"></a>126. typos in Effects clause of ctype::do_narrow()</h3>
! <p><b>Section:</b> 22.4.1.1.2 [locale.ctype.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.ctype.virtuals">issues</a> in [locale.ctype.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p><p>Typos in 22.2.1.1.2 need to be fixed.</p>
  
  <p><b>Proposed resolution:</b></p>
*************** latter appears to be correct. </p>
*** 5803,5812 ****
  
  <hr>
  <h3><a name="127"></a>127. auto_ptr&lt;&gt; conversion issues</h3>
! <p><b>Section:</b> D.12.1 [auto.ptr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Greg Colvin <b>Opened:</b> 1999-02-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There are two problems with the current <tt>auto_ptr</tt> wording
  in the standard: </p>
--- 4981,4990 ----
  
  <hr>
  <h3><a name="127"></a>127. auto_ptr&lt;&gt; conversion issues</h3>
! <p><b>Section:</b> X [auto.ptr] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Greg Colvin <b>Opened:</b> 1999-02-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There are two problems with the current <tt>auto_ptr</tt> wording
  in the standard: </p>
*************** of the standard. </p>
*** 5826,5833 ****
  
  <p>25 Aug 1999: The proposed resolution now reflects changes suggested
  by Dave Abrahams, with Greg Colvin's concurrence; 1) changed
! "assignment operator" to "public assignment
! operator", 2) changed effects to specify use of release(), 3)
  made the conversion to auto_ptr_ref const. </p>
  
  <p>2 Feb 2000: Lisa Lippincott comments: [The resolution of] this issue
--- 5004,5011 ----
  
  <p>25 Aug 1999: The proposed resolution now reflects changes suggested
  by Dave Abrahams, with Greg Colvin's concurrence; 1) changed
! &quot;assignment operator&quot; to &quot;public assignment
! operator&quot;, 2) changed effects to specify use of release(), 3)
  made the conversion to auto_ptr_ref const. </p>
  
  <p>2 Feb 2000: Lisa Lippincott comments: [The resolution of] this issue
*************** object parameter may be bound to an rval
*** 5844,5850 ****
  
    <p>Tokyo: The LWG removed the following from the proposed resolution:</p>
  
!   <p>In 20.7.4 [meta.unary], paragraph 2, and 20.7.4.3 [meta.unary.prop], 
    paragraph 2, make the conversion to auto_ptr_ref const:</p>
    <blockquote>
      <pre>template&lt;class Y&gt; operator auto_ptr_ref&lt;Y&gt;() const throw();</pre>
--- 5022,5028 ----
  
    <p>Tokyo: The LWG removed the following from the proposed resolution:</p>
  
!   <p>In 20.10.4 [meta.unary], paragraph 2, and 20.10.4.3 [meta.unary.prop], 
    paragraph 2, make the conversion to auto_ptr_ref const:</p>
    <blockquote>
      <pre>template&lt;class Y&gt; operator auto_ptr_ref&lt;Y&gt;() const throw();</pre>
*************** object parameter may be bound to an rval
*** 5852,5874 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.7.4 [meta.unary], paragraph 2, move
  the <tt>auto_ptr_ref</tt> definition to namespace scope.</p>
  
! <p>In 20.7.4 [meta.unary], paragraph 2, add
  a public assignment operator to the <tt>auto_ptr</tt> definition: </p>
  
  <blockquote>
    <pre>auto_ptr&amp; operator=(auto_ptr_ref&lt;X&gt; r) throw();</pre>
  </blockquote>
  
! <p>Also add the assignment operator to 20.7.4.3 [meta.unary.prop]: </p>
  
  <blockquote>
    <pre>auto_ptr&amp; operator=(auto_ptr_ref&lt;X&gt; r) throw()</pre>
  
    <p><b>Effects:</b> Calls <tt>reset(p.release())</tt> for the <tt>auto_ptr
!   p</tt> that <tt>r</tt> holds a reference to.<br>
    <b>Returns: </b><tt>*this</tt>.</p>
  
  </blockquote>
--- 5030,5052 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.10.4 [meta.unary], paragraph 2, move
  the <tt>auto_ptr_ref</tt> definition to namespace scope.</p>
  
! <p>In 20.10.4 [meta.unary], paragraph 2, add
  a public assignment operator to the <tt>auto_ptr</tt> definition: </p>
  
  <blockquote>
    <pre>auto_ptr&amp; operator=(auto_ptr_ref&lt;X&gt; r) throw();</pre>
  </blockquote>
  
! <p>Also add the assignment operator to 20.10.4.3 [meta.unary.prop]: </p>
  
  <blockquote>
    <pre>auto_ptr&amp; operator=(auto_ptr_ref&lt;X&gt; r) throw()</pre>
  
    <p><b>Effects:</b> Calls <tt>reset(p.release())</tt> for the <tt>auto_ptr
!   p</tt> that <tt>r</tt> holds a reference to.<br/>
    <b>Returns: </b><tt>*this</tt>.</p>
  
  </blockquote>
*************** a public assignment operator to the <tt>
*** 5879,5888 ****
  
  <hr>
  <h3><a name="129"></a>129. Need error indication from seekp() and seekg()</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted], 27.7.2.5 [ostream.seeks] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-02-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Currently, the standard does not specify how seekg() and seekp()
  indicate failure. They are not required to set failbit, and they can't
--- 5057,5067 ----
  
  <hr>
  <h3><a name="129"></a>129. Need error indication from seekp() and seekg()</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted], 27.7.3.5 [ostream.seeks] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-02-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Currently, the standard does not specify how seekg() and seekp()
  indicate failure. They are not required to set failbit, and they can't
*************** stream state in case of failure.</p>
*** 5898,5905 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Add to the Effects: clause of&nbsp; seekg() in 
! 27.7.1.3 [istream.unformatted] and to the Effects: clause of seekp() in
! 27.7.2.5 [ostream.seeks]: </p>
  
  <blockquote>
    <p>In case of failure, the function calls <tt>setstate(failbit)</tt> (which may throw <tt>ios_base::failure</tt>).
--- 5077,5084 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Add to the Effects: clause of&nbsp; seekg() in 
! 27.7.2.3 [istream.unformatted] and to the Effects: clause of seekp() in
! 27.7.3.5 [ostream.seeks]: </p>
  
  <blockquote>
    <p>In case of failure, the function calls <tt>setstate(failbit)</tt> (which may throw <tt>ios_base::failure</tt>).
*************** stream state in case of failure.</p>
*** 5915,5926 ****
  
  <hr>
  <h3><a name="130"></a>130. Return type of container::erase(iterator) differs for associative containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-03-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#451">451</a></p>
  <p><b>Discussion:</b></p>
  <p>Table 67 (23.1.1) says that container::erase(iterator) returns an
  iterator. Table 69 (23.1.2) says that in addition to this requirement,
--- 5094,5105 ----
  
  <hr>
  <h3><a name="130"></a>130. Return type of container::erase(iterator) differs for associative containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-03-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#451">451</a></p>
  <p><b>Discussion:</b></p>
  <p>Table 67 (23.1.1) says that container::erase(iterator) returns an
  iterator. Table 69 (23.1.2) says that in addition to this requirement,
*************** q2)</tt>.  Returns q2."
*** 5953,5968 ****
  </p>
  
  <p>
! In 23.6.1 [map], in the <tt>map</tt> class synopsis; and 
! in 23.6.2 [multimap], in the <tt>multimap</tt> class synopsis; and
! in 23.6.3 [set], in the <tt>set</tt> class synopsis; and
! in 23.6.4 [multiset], in the <tt>multiset</tt> class synopsis:
  change the signature of the first <tt>erase</tt> overload to
  </p>
! <pre>   iterator erase(iterator position);
  </pre>
  <p>and change the signature of the third <tt>erase</tt> overload to</p>
! <pre>  iterator erase(iterator first, iterator last); 
  </pre>
  
  
--- 5132,5149 ----
  </p>
  
  <p>
! In 23.4.4 [map], in the <tt>map</tt> class synopsis; and 
! in 23.4.5 [multimap], in the <tt>multimap</tt> class synopsis; and
! in 23.4.6 [set], in the <tt>set</tt> class synopsis; and
! in 23.4.7 [multiset], in the <tt>multiset</tt> class synopsis:
  change the signature of the first <tt>erase</tt> overload to
  </p>
! <pre>
!    iterator erase(iterator position);
  </pre>
  <p>and change the signature of the third <tt>erase</tt> overload to</p>
! <pre>
!   iterator erase(iterator first, iterator last); 
  </pre>
  
  
*************** Redmond:  formally voted into WP.
*** 5996,6005 ****
  
  <hr>
  <h3><a name="132"></a>132. list::resize description uses random access iterators</h3>
! <p><b>Section:</b> 23.3.4.2 [list.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.capacity">issues</a> in [list.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description reads:</p>
  
--- 5177,5186 ----
  
  <hr>
  <h3><a name="132"></a>132. list::resize description uses random access iterators</h3>
! <p><b>Section:</b> 23.3.5.3 [list.capacity] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.capacity">issues</a> in [list.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description reads:</p>
  
*************** Redmond:  formally voted into WP.
*** 6016,6022 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 23.3.4.2 [list.capacity] paragraph 1 to:</p>
  
  <p>Effects:</p>
  
--- 5197,5203 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 23.3.5.3 [list.capacity] paragraph 1 to:</p>
  
  <p>Effects:</p>
  
*************** no issue of exception safety with the pr
*** 6040,6053 ****
  
  <hr>
  <h3><a name="133"></a>133. map missing get_allocator()</h3>
! <p><b>Section:</b> 23.6.1 [map] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#map">issues</a> in [map].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p><p>The title says it all.</p>
  
  <p><b>Proposed resolution:</b></p>
! <p>Insert in 23.6.1 [map], paragraph 2,
  after operator= in the map declaration:</p>
  
  <pre>    allocator_type get_allocator() const;</pre>
--- 5221,5234 ----
  
  <hr>
  <h3><a name="133"></a>133. map missing get_allocator()</h3>
! <p><b>Section:</b> 23.4.4 [map] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#map">issues</a> in [map].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p><p>The title says it all.</p>
  
  <p><b>Proposed resolution:</b></p>
! <p>Insert in 23.4.4 [map], paragraph 2,
  after operator= in the map declaration:</p>
  
  <pre>    allocator_type get_allocator() const;</pre>
*************** after operator= in the map declaration:<
*** 6057,6075 ****
  
  <hr>
  <h3><a name="134"></a>134. vector constructors over specified</h3>
! <p><b>Section:</b> 23.4.1.1 [vector.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The complexity description says: "It does at most 2N calls to the copy constructor
! of T and logN reallocations if they are just input iterators ...".</p>
  
  <p>This appears to be overly restrictive, dictating the precise memory/performance
  tradeoff for the implementor.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 23.4.1.1 [vector.cons], paragraph 1 to:</p>
  
  <p>-1- Complexity: The constructor template &lt;class
  InputIterator&gt; vector(InputIterator first, InputIterator last)
--- 5238,5256 ----
  
  <hr>
  <h3><a name="134"></a>134. vector constructors over specified</h3>
! <p><b>Section:</b> 23.3.6.2 [vector.cons] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The complexity description says: &quot;It does at most 2N calls to the copy constructor
! of T and logN reallocations if they are just input iterators ...&quot;.</p>
  
  <p>This appears to be overly restrictive, dictating the precise memory/performance
  tradeoff for the implementor.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 23.3.6.2 [vector.cons], paragraph 1 to:</p>
  
  <p>-1- Complexity: The constructor template &lt;class
  InputIterator&gt; vector(InputIterator first, InputIterator last)
*************** order logN reallocations if they are jus
*** 6082,6088 ****
  
  
  <p><b>Rationale:</b></p>
! <p>"at most 2N calls" is correct only if the growth factor
  is greater than or equal to 2.
  </p>
  
--- 5263,5269 ----
  
  
  <p><b>Rationale:</b></p>
! <p>&quot;at most 2N calls&quot; is correct only if the growth factor
  is greater than or equal to 2.
  </p>
  
*************** is greater than or equal to 2.
*** 6091,6100 ****
  
  <hr>
  <h3><a name="136"></a>136. seekp, seekg setting wrong streams?</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>I may be misunderstanding the intent, but should not seekg set only
  the input stream and seekp set only the output stream? The description
--- 5272,5282 ----
  
  <hr>
  <h3><a name="136"></a>136. seekp, seekg setting wrong streams?</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>I may be misunderstanding the intent, but should not seekg set only
  the input stream and seekp set only the output stream? The description
*************** Effects: If fail() != true, executes rdb
*** 6139,6145 ****
  
  <pre>-4- Effects: If fail() != true, executes rdbuf()-&gt;pubseekoff(off, dir, ios_base::out). </pre>
  
! <p><i>[Dublin: Dietmar Kühl thinks this is probably correct, but would
  like the opinion of more iostream experts before taking action.]</i></p>
  
  
--- 5321,5327 ----
  
  <pre>-4- Effects: If fail() != true, executes rdbuf()-&gt;pubseekoff(off, dir, ios_base::out). </pre>
  
! <p><i>[Dublin: Dietmar K&uuml;hl thinks this is probably correct, but would
  like the opinion of more iostream experts before taking action.]</i></p>
  
  
*************** incorrect, his implementation already im
*** 6148,6161 ****
  Resolution.]</i></p>
  
  
! <p><i>[Post-Tokyo: Matt Austern comments:<br>
  Is it a problem with basic_istream and basic_ostream, or is it a problem
  with basic_stringbuf?
  We could resolve the issue either by changing basic_istream and
  basic_ostream, or by changing basic_stringbuf. I prefer the latter
  change (or maybe both changes): I don't see any reason for the standard to
! require that std::stringbuf s(std::string("foo"), std::ios_base::in);
! s.pubseekoff(0, std::ios_base::beg); must fail.<br>
  This requirement is a bit weird. There's no similar requirement
  for basic_streambuf&lt;&gt;::seekpos, or for basic_filebuf&lt;&gt;::seekoff or
  basic_filebuf&lt;&gt;::seekpos.]</i></p>
--- 5330,5343 ----
  Resolution.]</i></p>
  
  
! <p><i>[Post-Tokyo: Matt Austern comments:<br/>
  Is it a problem with basic_istream and basic_ostream, or is it a problem
  with basic_stringbuf?
  We could resolve the issue either by changing basic_istream and
  basic_ostream, or by changing basic_stringbuf. I prefer the latter
  change (or maybe both changes): I don't see any reason for the standard to
! require that std::stringbuf s(std::string(&quot;foo&quot;), std::ios_base::in);
! s.pubseekoff(0, std::ios_base::beg); must fail.<br/>
  This requirement is a bit weird. There's no similar requirement
  for basic_streambuf&lt;&gt;::seekpos, or for basic_filebuf&lt;&gt;::seekoff or
  basic_filebuf&lt;&gt;::seekpos.]</i></p>
*************** basic_filebuf&lt;&gt;::seekpos.]</i></p>
*** 6167,6176 ****
  
  <hr>
  <h3><a name="137"></a>137. Do use_facet and has_facet look in the global locale?</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-03-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 22.3.1 [locale] says:</p>
  
--- 5349,5358 ----
  
  <hr>
  <h3><a name="137"></a>137. Do use_facet and has_facet look in the global locale?</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-03-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 22.3.1 [locale] says:</p>
  
*************** function has_facet&lt;Facet&gt;(). </p>
*** 6183,6201 ****
  
  <p>This contradicts the specification given in section 
  22.3.2 [locale.global.templates]:
! <br><br>
  template &lt;class&nbsp; Facet&gt; const&nbsp; Facet&amp; use_facet(const
! locale&amp;&nbsp; loc); <br>
! <br>
! -1- Get a reference to a facet of a locale. <br>
! -2- Returns: a reference to the corresponding facet of loc, if present. <br>
! -3- Throws: bad_cast if has_facet&lt;Facet&gt;(loc) is false. <br>
  -4- Notes: The reference returned remains valid at least as long as any copy of loc exists
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove the phrase "(or, failing that, in the global locale)"
  from section 22.1.1. </p>
  
  
--- 5365,5383 ----
  
  <p>This contradicts the specification given in section 
  22.3.2 [locale.global.templates]:
! <br/><br/>
  template &lt;class&nbsp; Facet&gt; const&nbsp; Facet&amp; use_facet(const
! locale&amp;&nbsp; loc); <br/>
! <br/>
! -1- Get a reference to a facet of a locale. <br/>
! -2- Returns: a reference to the corresponding facet of loc, if present. <br/>
! -3- Throws: bad_cast if has_facet&lt;Facet&gt;(loc) is false. <br/>
  -4- Notes: The reference returned remains valid at least as long as any copy of loc exists
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove the phrase &quot;(or, failing that, in the global locale)&quot;
  from section 22.1.1. </p>
  
  
*************** in the standard.</p>
*** 6208,6233 ****
  
  <hr>
  <h3><a name="139"></a>139. Optional sequence operation table description unclear</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-03-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The sentence introducing the Optional sequence operation table
  (23.1.1 paragraph 12) has two problems:</p>
  
  <p>A. It says ``The operations in table 68 are provided only for the containers for which
! they take constant time.''<br>
! <br>
  That could be interpreted in two ways, one of them being ``Even though table 68 shows
  particular operations as being provided, implementations are free to omit them if they
! cannot implement them in constant time.''<br>
! <br>
  B. That paragraph says nothing about amortized constant time, and it should.&nbsp;</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace the wording in 23.1.1 paragraph 12&nbsp; which begins ``The operations in table 68 are provided only..."
  with:</p>
  
  <blockquote>
--- 5390,5415 ----
  
  <hr>
  <h3><a name="139"></a>139. Optional sequence operation table description unclear</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-03-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The sentence introducing the Optional sequence operation table
  (23.1.1 paragraph 12) has two problems:</p>
  
  <p>A. It says ``The operations in table 68 are provided only for the containers for which
! they take constant time.''<br/>
! <br/>
  That could be interpreted in two ways, one of them being ``Even though table 68 shows
  particular operations as being provided, implementations are free to omit them if they
! cannot implement them in constant time.''<br/>
! <br/>
  B. That paragraph says nothing about amortized constant time, and it should.&nbsp;</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace the wording in 23.1.1 paragraph 12&nbsp; which begins ``The operations in table 68 are provided only...&quot;
  with:</p>
  
  <blockquote>
*************** with:</p>
*** 6242,6256 ****
  
  <hr>
  <h3><a name="141"></a>141. basic_string::find_last_of, find_last_not_of say pos instead of xpos</h3>
! <p><b>Section:</b> 21.4.6.4 [string::insert], 21.4.6.6 [string::replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Arch Robison <b>Opened:</b> 1999-04-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::insert">issues</a> in [string::insert].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Sections 21.3.6.4 paragraph 1 and 21.3.6.6 paragraph 1 surely have misprints where they
! say:<br>
! <br>
! — <tt>xpos &lt;= pos</tt> and <tt>pos &lt; size();</tt></p>
  
  <p>Surely the document meant to say ``<tt>xpos &lt; size()</tt>'' in both places.</p>
  
--- 5424,5438 ----
  
  <hr>
  <h3><a name="141"></a>141. basic_string::find_last_of, find_last_not_of say pos instead of xpos</h3>
! <p><b>Section:</b> 21.4.6.4 [string::insert], 21.4.6.6 [string::replace] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Arch Robison <b>Opened:</b> 1999-04-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::insert">issues</a> in [string::insert].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Sections 21.3.6.4 paragraph 1 and 21.3.6.6 paragraph 1 surely have misprints where they
! say:<br/>
! <br/>
! &#151; <tt>xpos &lt;= pos</tt> and <tt>pos &lt; size();</tt></p>
  
  <p>Surely the document meant to say ``<tt>xpos &lt; size()</tt>'' in both places.</p>
  
*************** proposed resolution.]</i></p>
*** 6260,6287 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change Sections 21.3.6.4 paragraph 1 and 21.3.6.6 paragraph 1, the line which says:<br>
! <br>
! — <tt>xpos &lt;= pos</tt> and <tt>pos &lt; size();<br>
! <br>
! </tt>to:<br>
! <tt><br>
! </tt>— <tt>xpos &lt;= pos</tt> and <tt>xpos &lt; size();</tt></p>
  
  
  
  
  <hr>
  <h3><a name="142"></a>142. lexicographical_compare complexity wrong</h3>
! <p><b>Section:</b> 25.4.8 [alg.lex.comparison] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-06-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The lexicographical_compare complexity is specified as:<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp; "At most min((last1 - first1), (last2 - first2))
! applications of the corresponding comparison."<br>
! <br>
  The best I can do is twice that expensive.</p>
  
  <p>Nicolai Josuttis comments in lib-6862: You mean, to check for
--- 5442,5469 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change Sections 21.3.6.4 paragraph 1 and 21.3.6.6 paragraph 1, the line which says:<br/>
! <br/>
! &#151; <tt>xpos &lt;= pos</tt> and <tt>pos &lt; size();<br/>
! <br/>
! </tt>to:<br/>
! <tt><br/>
! </tt>&#151; <tt>xpos &lt;= pos</tt> and <tt>xpos &lt; size();</tt></p>
  
  
  
  
  <hr>
  <h3><a name="142"></a>142. lexicographical_compare complexity wrong</h3>
! <p><b>Section:</b> 25.4.8 [alg.lex.comparison] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-06-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The lexicographical_compare complexity is specified as:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp; &quot;At most min((last1 - first1), (last2 - first2))
! applications of the corresponding comparison.&quot;<br/>
! <br/>
  The best I can do is twice that expensive.</p>
  
  <p>Nicolai Josuttis comments in lib-6862: You mean, to check for
*************** right! (and Matt states this complexity
*** 6299,6313 ****
  
  <p>Change the example at the end of paragraph 3 to read:</p>
      <blockquote><p>
!     [Example:<br>
!     <br>
      &nbsp;&nbsp;&nbsp; for ( ; first1 != last1 &amp;&amp; first2 != last2 ;
!     ++first1, ++first2) {<br>
!     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (*first1 &lt; *first2) return true;<br>
!     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (*first2 &lt; *first1) return false;<br>
!     &nbsp;&nbsp;&nbsp; }<br>
!     &nbsp;&nbsp;&nbsp; return first1 == last1 &amp;&amp; first2 != last2;<br>
!     &nbsp;&nbsp;&nbsp;<br>
      --end example]
      </p></blockquote>
  
--- 5481,5495 ----
  
  <p>Change the example at the end of paragraph 3 to read:</p>
      <blockquote><p>
!     [Example:<br/>
!     <br/>
      &nbsp;&nbsp;&nbsp; for ( ; first1 != last1 &amp;&amp; first2 != last2 ;
!     ++first1, ++first2) {<br/>
!     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (*first1 &lt; *first2) return true;<br/>
!     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (*first2 &lt; *first1) return false;<br/>
!     &nbsp;&nbsp;&nbsp; }<br/>
!     &nbsp;&nbsp;&nbsp; return first1 == last1 &amp;&amp; first2 != last2;<br/>
!     &nbsp;&nbsp;&nbsp;<br/>
      --end example]
      </p></blockquote>
  
*************** right! (and Matt states this complexity
*** 6316,6327 ****
  
  <hr>
  <h3><a name="144"></a>144. Deque constructor complexity wrong </h3>
! <p><b>Section:</b> 23.3.2.1 [deque.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 1999-05-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#deque.cons">issues</a> in [deque.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 23.3.2.1 [deque.cons] paragraph 6, the deque ctor that takes an iterator range appears
  to have complexity requirements which are incorrect, and which contradict the
  complexity requirements for insert(). I suspect that the text in question,
  below, was taken from vector:</p>
--- 5498,5509 ----
  
  <hr>
  <h3><a name="144"></a>144. Deque constructor complexity wrong </h3>
! <p><b>Section:</b> 23.3.3.2 [deque.cons] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 1999-05-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#deque.cons">issues</a> in [deque.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 23.3.3.2 [deque.cons] paragraph 6, the deque ctor that takes an iterator range appears
  to have complexity requirements which are incorrect, and which contradict the
  complexity requirements for insert(). I suspect that the text in question,
  below, was taken from vector:</p>
*************** below, was taken from vector:</p>
*** 6331,6337 ****
    N calls to the copy constructor, and performs no reallocations, where N is
    last - first.</p>
  </blockquote>
! <p>The word "reallocations" does not really apply to deque. Further,
  all of the following appears to be spurious:</p>
  <blockquote>
    <p>It makes at most 2N calls to the copy constructor of T and log N
--- 5513,5519 ----
    N calls to the copy constructor, and performs no reallocations, where N is
    last - first.</p>
  </blockquote>
! <p>The word &quot;reallocations&quot; does not really apply to deque. Further,
  all of the following appears to be spurious:</p>
  <blockquote>
    <p>It makes at most 2N calls to the copy constructor of T and log N
*************** insert?</p>
*** 6346,6353 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 23.3.2.1 [deque.cons] paragraph 6, replace the Complexity description, including the
! footnote, with the following text (which also corrects the "abd"
  typo):</p>
  <blockquote>
    <p>Complexity: Makes last - first calls to the copy constructor of T.</p>
--- 5528,5535 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 23.3.3.2 [deque.cons] paragraph 6, replace the Complexity description, including the
! footnote, with the following text (which also corrects the &quot;abd&quot;
  typo):</p>
  <blockquote>
    <p>Complexity: Makes last - first calls to the copy constructor of T.</p>
*************** typo):</p>
*** 6358,6409 ****
  
  <hr>
  <h3><a name="146"></a>146. complex&lt;T&gt; Inserter and Extractor need sentries</h3>
! <p><b>Section:</b> 26.4.6 [complex.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-05-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.ops">issues</a> in [complex.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The extractor for complex numbers is specified as:&nbsp;</p>
  
  <blockquote>
  
! <p>     template&lt;class T, class charT, class traits&gt;&nbsp;<br>
!      basic_istream&lt;charT, traits&gt;&amp;&nbsp;<br>
!      operator&gt;&gt;(basic_istream&lt;charT, traits&gt;&amp;  is, complex&lt;T&gt;&amp;  x);<br>
! &nbsp;<br>
  Effects: Extracts a complex number x of the form: u, (u), or (u,v),
  where u is the real part and v is the imaginary part
! (lib.istream.formatted).&nbsp;<br>
  Requires: The input values be convertible to T. If bad input is
  encountered, calls is.setstate(ios::failbit) (which may throw
! ios::failure (lib.iostate.flags).&nbsp;<br>
  Returns: is .</p>
  
  </blockquote>
  <p>Is it intended that the extractor for complex numbers does not skip
  whitespace, unlike all other extractors in the standard library do?
! Shouldn't a sentry be used?&nbsp;<br>
! <br>
  The inserter for complex numbers is specified as:</p>
  
  <blockquote>
  
! <p>     template&lt;class T, class charT, class traits&gt;&nbsp;<br>
!      basic_ostream&lt;charT, traits&gt;&amp;&nbsp;<br>
!      operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp;  o, const complex&lt;T&gt;&amp;  x);<br>
! <br>
! Effects: inserts the complex number x onto the stream o as if it were implemented as follows:<br>
! <br>
!      template&lt;class T, class charT, class traits&gt;&nbsp;<br>
!      basic_ostream&lt;charT, traits&gt;&amp;&nbsp;<br>
!      operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp; o, const complex&lt;T&gt;&amp; x)&nbsp;<br>
!      {&nbsp;<br>
!              basic_ostringstream&lt;charT, traits&gt; s;&nbsp;<br>
!              s.flags(o.flags());&nbsp;<br>
!              s.imbue(o.getloc());&nbsp;<br>
!              s.precision(o.precision());&nbsp;<br>
!              s &lt;&lt; '(' &lt;&lt; x.real() &lt;&lt; "," &lt;&lt; x.imag() &lt;&lt; ')';&nbsp;<br>
!              return o &lt;&lt; s.str();&nbsp;<br>
       }</p>
  
  </blockquote>
--- 5540,5591 ----
  
  <hr>
  <h3><a name="146"></a>146. complex&lt;T&gt; Inserter and Extractor need sentries</h3>
! <p><b>Section:</b> 26.4.6 [complex.ops] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-05-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.ops">issues</a> in [complex.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The extractor for complex numbers is specified as:&nbsp;</p>
  
  <blockquote>
  
! <p>     template&lt;class T, class charT, class traits&gt;&nbsp;<br/>
!      basic_istream&lt;charT, traits&gt;&amp;&nbsp;<br/>
!      operator&gt;&gt;(basic_istream&lt;charT, traits&gt;&amp;  is, complex&lt;T&gt;&amp;  x);<br/>
! &nbsp;<br/>
  Effects: Extracts a complex number x of the form: u, (u), or (u,v),
  where u is the real part and v is the imaginary part
! (lib.istream.formatted).&nbsp;<br/>
  Requires: The input values be convertible to T. If bad input is
  encountered, calls is.setstate(ios::failbit) (which may throw
! ios::failure (lib.iostate.flags).&nbsp;<br/>
  Returns: is .</p>
  
  </blockquote>
  <p>Is it intended that the extractor for complex numbers does not skip
  whitespace, unlike all other extractors in the standard library do?
! Shouldn't a sentry be used?&nbsp;<br/>
! <br/>
  The inserter for complex numbers is specified as:</p>
  
  <blockquote>
  
! <p>     template&lt;class T, class charT, class traits&gt;&nbsp;<br/>
!      basic_ostream&lt;charT, traits&gt;&amp;&nbsp;<br/>
!      operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp;  o, const complex&lt;T&gt;&amp;  x);<br/>
! <br/>
! Effects: inserts the complex number x onto the stream o as if it were implemented as follows:<br/>
! <br/>
!      template&lt;class T, class charT, class traits&gt;&nbsp;<br/>
!      basic_ostream&lt;charT, traits&gt;&amp;&nbsp;<br/>
!      operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp; o, const complex&lt;T&gt;&amp; x)&nbsp;<br/>
!      {&nbsp;<br/>
!              basic_ostringstream&lt;charT, traits&gt; s;&nbsp;<br/>
!              s.flags(o.flags());&nbsp;<br/>
!              s.imbue(o.getloc());&nbsp;<br/>
!              s.precision(o.precision());&nbsp;<br/>
!              s &lt;&lt; '(' &lt;&lt; x.real() &lt;&lt; "," &lt;&lt; x.imag() &lt;&lt; ')';&nbsp;<br/>
!              return o &lt;&lt; s.str();&nbsp;<br/>
       }</p>
  
  </blockquote>
*************** same for each of the simpler extractions
*** 6435,6441 ****
  
  <p><b>Rationale:</b></p>
  <p>For extractors, the note is added to make it clear that skipping whitespace
! follows an "all-or-none" rule.</p>
  
  <p>For inserters, the LWG believes there is no defect; the standard is correct
  as written.</p>
--- 5617,5623 ----
  
  <p><b>Rationale:</b></p>
  <p>For extractors, the note is added to make it clear that skipping whitespace
! follows an &quot;all-or-none&quot; rule.</p>
  
  <p>For inserters, the LWG believes there is no defect; the standard is correct
  as written.</p>
*************** as written.</p>
*** 6445,6454 ****
  
  <hr>
  <h3><a name="147"></a>147. Library Intro refers to global functions that aren't global</h3>
! <p><b>Section:</b> 17.6.4.4 [global.functions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Lois Goldthwaite <b>Opened:</b> 1999-06-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#global.functions">issues</a> in [global.functions].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The library had many global functions until 17.4.1.1 [lib.contents]
  paragraph 2 was added: </p>
--- 5627,5636 ----
  
  <hr>
  <h3><a name="147"></a>147. Library Intro refers to global functions that aren't global</h3>
! <p><b>Section:</b> 17.6.5.4 [global.functions] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Lois Goldthwaite <b>Opened:</b> 1999-06-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#global.functions">issues</a> in [global.functions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The library had many global functions until 17.4.1.1 [lib.contents]
  paragraph 2 was added: </p>
*************** within namespace std. </p>
*** 6465,6490 ****
  
  <blockquote>
  
! <p>17.4.4.3 - Global functions [lib.global.functions]<br>
! <br>
  -1- It is unspecified whether any global functions in the C++ Standard
! Library are defined as inline (dcl.fct.spec).<br>
! <br>
  -2- A call to a global function signature described in Clauses
  lib.language.support through lib.input.output behaves the same as if
  the implementation declares no additional global function
! signatures.*<br>
! <br>
      [Footnote: A valid C++ program always calls the expected library
      global function. An implementation may also define additional
      global functions that would otherwise not be called by a valid C++
!     program. --- end footnote]<br>
! <br>
  -3- A global function cannot be declared by the implementation as
! taking additional default arguments.&nbsp;<br>
! <br>
! 17.4.4.4 - Member functions [lib.member.functions]<br>
! <br>
  -2- An implementation can declare additional non-virtual member
  function signatures within a class: </p>
  
--- 5647,5672 ----
  
  <blockquote>
  
! <p>17.4.4.3 - Global functions [lib.global.functions]<br/>
! <br/>
  -1- It is unspecified whether any global functions in the C++ Standard
! Library are defined as inline (dcl.fct.spec).<br/>
! <br/>
  -2- A call to a global function signature described in Clauses
  lib.language.support through lib.input.output behaves the same as if
  the implementation declares no additional global function
! signatures.*<br/>
! <br/>
      [Footnote: A valid C++ program always calls the expected library
      global function. An implementation may also define additional
      global functions that would otherwise not be called by a valid C++
!     program. --- end footnote]<br/>
! <br/>
  -3- A global function cannot be declared by the implementation as
! taking additional default arguments.&nbsp;<br/>
! <br/>
! 17.4.4.4 - Member functions [lib.member.functions]<br/>
! <br/>
  -2- An implementation can declare additional non-virtual member
  function signatures within a class: </p>
  
*************** virtual or global functions, however. </
*** 6499,6511 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>     Change "global" to "global or non-member" in:</p>
  <blockquote>
!   <p>17.4.4.3 [lib.global.functions] section title,<br>
!   17.4.4.3 [lib.global.functions] para 1,<br>
    17.4.4.3 [lib.global.functions] para 2 in 2 places plus 2 
!            places in the footnote,<br>
!   17.4.4.3 [lib.global.functions] para 3,<br>
    17.4.4.4 [lib.member.functions] para 2</p>
  </blockquote>
  
--- 5681,5693 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>     Change "global" to &quot;global or non-member&quot; in:</p>
  <blockquote>
!   <p>17.4.4.3 [lib.global.functions] section title,<br/>
!   17.4.4.3 [lib.global.functions] para 1,<br/>
    17.4.4.3 [lib.global.functions] para 2 in 2 places plus 2 
!            places in the footnote,<br/>
!   17.4.4.3 [lib.global.functions] para 3,<br/>
    17.4.4.4 [lib.member.functions] para 2</p>
  </blockquote>
  
*************** virtual or global functions, however. </
*** 6513,6519 ****
  <p><b>Rationale:</b></p>
  <p>
  Because operator new and delete are global, the proposed resolution
! was changed from "non-member" to "global or non-member.
  </p>
  
  
--- 5695,5701 ----
  <p><b>Rationale:</b></p>
  <p>
  Because operator new and delete are global, the proposed resolution
! was changed from &quot;non-member&quot; to &quot;global or non-member.
  </p>
  
  
*************** was changed from "non-member" to "global
*** 6521,6530 ****
  
  <hr>
  <h3><a name="148"></a>148. Functions in the example facet BoolNames should be const</h3>
! <p><b>Section:</b> 22.4.8 [facets.examples] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Jeremy Siek <b>Opened:</b> 1999-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facets.examples">issues</a> in [facets.examples].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 22.4.8 [facets.examples] paragraph 13, the do_truename() and
  do_falsename() functions in the example facet BoolNames should be
--- 5703,5712 ----
  
  <hr>
  <h3><a name="148"></a>148. Functions in the example facet BoolNames should be const</h3>
! <p><b>Section:</b> 22.4.8 [facets.examples] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Jeremy Siek <b>Opened:</b> 1999-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facets.examples">issues</a> in [facets.examples].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 22.4.8 [facets.examples] paragraph 13, the do_truename() and
  do_falsename() functions in the example facet BoolNames should be
*************** numpunct_byname&lt;char&gt; are const. <
*** 6533,6543 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 22.4.8 [facets.examples] paragraph 13, insert "const" in
  two places:</p>
  <blockquote>
!   <p><tt>string do_truename() const { return "Oui Oui!"; }<br>
!   string do_falsename() const { return "Mais Non!"; }</tt></p>
  </blockquote>
  
  
--- 5715,5725 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 22.4.8 [facets.examples] paragraph 13, insert &quot;const&quot; in
  two places:</p>
  <blockquote>
!   <p><tt>string do_truename() const { return &quot;Oui Oui!&quot;; }<br/>
!   string do_falsename() const { return &quot;Mais Non!&quot;; }</tt></p>
  </blockquote>
  
  
*************** two places:</p>
*** 6545,6554 ****
  
  <hr>
  <h3><a name="149"></a>149. Insert should return iterator to first element inserted</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-06-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Suppose that c and c1 are sequential containers and i is an
  iterator that refers to an element of c.  Then I can insert a copy of
--- 5727,5736 ----
  
  <hr>
  <h3><a name="149"></a>149. Insert should return iterator to first element inserted</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Suppose that c and c1 are sequential containers and i is an
  iterator that refers to an element of c.  Then I can insert a copy of
*************** c.insert(i, c1.begin(), c1.end());</pre>
*** 6571,6579 ****
  </blockquote>
  
  <p>and now the first inserted element is at c.begin()+i_loc and one
! past the last is at c.begin()+i_loc+c1.size().<br>
! <br>
! But what if c is a list?  I can still find the location of one    past the last inserted element, because i is still valid.    To find the location of the first inserted element, though,    I must execute something like </p>
  
  <blockquote>
  
--- 5753,5764 ----
  </blockquote>
  
  <p>and now the first inserted element is at c.begin()+i_loc and one
! past the last is at c.begin()+i_loc+c1.size().<br/>
! <br/>
! But what if c is a list?  I can still find the location of one    
! past the last inserted element, because i is still valid.    
! To find the location of the first inserted element, though,    
! I must execute something like </p>
  
  <blockquote>
  
*************** But what if c is a list?  I can still fi
*** 6582,6589 ****
  
  </blockquote>
  
! <p>because i is now no longer a random-access iterator.<br>
! <br>
  Alternatively, I might write something like </p>
  
  <blockquote>
--- 5767,5774 ----
  
  </blockquote>
  
! <p>because i is now no longer a random-access iterator.<br/>
! <br/>
  Alternatively, I might write something like </p>
  
  <blockquote>
*************** else
*** 6599,6606 ****
  
  </blockquote>
  
! <p>which, although wretched, requires less overhead.<br>
! <br>
  But I think the right solution is to change the definition of insert
  so that instead of returning void, it returns an iterator that refers
  to the first element inserted, if any, and otherwise is a copy of its
--- 5784,5791 ----
  
  </blockquote>
  
! <p>which, although wretched, requires less overhead.<br/>
! <br/>
  But I think the right solution is to change the definition of insert
  so that instead of returning void, it returns an iterator that refers
  to the first element inserted, if any, and otherwise is a copy of its
*************** Summit:
*** 6611,6619 ****
  ]</i></p>
  
  
! <blockquote>
  Reopened by Alisdair.
! </blockquote>
  
  <p><i>[
  Post Summit Alisdair adds:
--- 5796,5804 ----
  ]</i></p>
  
  
! <blockquote><p>
  Reopened by Alisdair.
! </p></blockquote>
  
  <p><i>[
  Post Summit Alisdair adds:
*************** Moved to Ready.
*** 6655,6671 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! <sef ref="[sequence.reqmts]"> Table 83
  change return type from <tt>void</tt> to <tt>iterator</tt> for the following rows:
! </sef></p>
  
  <blockquote>
  <table border="1">
! <caption>Table 83 -- Sequence container requirements (in addition to container)</caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note pre-/post-condition</th>
  </tr>
  <tr>
  <td>
--- 5840,5856 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 23.2.3 [sequence.reqmts] Table 83
  change return type from <tt>void</tt> to <tt>iterator</tt> for the following rows:
! </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 83 &mdash; Sequence container requirements (in addition to container)</caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
  </tr>
  <tr>
  <td>
*************** Inserts copies of elements in <tt>[i, j)
*** 6705,6711 ****
  <tt>a.insert(p, il.begin(), il.end())</tt>.
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
--- 5890,5896 ----
  <tt>a.insert(p, il.begin(), il.end())</tt>.
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
*************** first element inserted into <tt>a</tt>,
*** 6733,6753 ****
  </blockquote>
  
  <p>
! p2 23.3.2 [deque] Update class definition, change return type
  from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  <p>
! 23.3.2.3 [deque.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt> on following declarations:
  </p>
  
! <blockquote><pre>  <del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
  </pre></blockquote>
--- 5918,5940 ----
  </blockquote>
  
  <p>
! p2 23.3.3 [deque] Update class definition, change return type
  from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  <p>
! 23.3.3.4 [deque.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt> on following declarations:
  </p>
  
! <blockquote><pre>
!   <del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
  </pre></blockquote>
*************** template &lt;class InputIterator&gt;
*** 6756,6795 ****
  Add the following (missing) declaration
  </p>
  
! <blockquote><pre><ins>iterator insert(const_iterator position, initializer_list&lt;T&gt;);</ins>
  </pre></blockquote>
  
  <p>
! 23.3.3 [forwardlist] Update class definition, change return type
  from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert_after(const_iterator position, initializer_list&lt;T&gt; il);
  <del>void</del> <ins>iterator</ins> insert_after(const_iterator position, size_type n, const T&amp; x);
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert_after(const_iterator position, InputIterator first, InputIterator last);
  </pre></blockquote>
  
  <p>
! p8 23.3.3.4 [forwardlist.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert_after(const_iterator position, size_type n, const T&amp; x);
  </pre></blockquote>
  
  <p>
  Add paragraph:
  </p>
  
! <blockquote>
  Returns: position.
! </blockquote>
  
  <p>
! p10 23.3.3.4 [forwardlist.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert_after(const_iterator position, InputIterator first, InputIterator last);
  </pre></blockquote>
  
--- 5943,5986 ----
  Add the following (missing) declaration
  </p>
  
! <blockquote><pre>
! <ins>iterator insert(const_iterator position, initializer_list&lt;T&gt;);</ins>
  </pre></blockquote>
  
  <p>
! 23.3.4 [forwardlist] Update class definition, change return type
  from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert_after(const_iterator position, initializer_list&lt;T&gt; il);
  <del>void</del> <ins>iterator</ins> insert_after(const_iterator position, size_type n, const T&amp; x);
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert_after(const_iterator position, InputIterator first, InputIterator last);
  </pre></blockquote>
  
  <p>
! p8 23.3.4.5 [forwardlist.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert_after(const_iterator position, size_type n, const T&amp; x);
  </pre></blockquote>
  
  <p>
  Add paragraph:
  </p>
  
! <blockquote><p>
  Returns: position.
! </p></blockquote>
  
  <p>
! p10 23.3.4.5 [forwardlist.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert_after(const_iterator position, InputIterator first, InputIterator last);
  </pre></blockquote>
  
*************** p10 23.3.3.4 [forwardlist.modifiers] cha
*** 6797,6811 ****
  Add paragraph:
  </p>
  
! <blockquote>
  Returns: position.
! </blockquote>
  
  <p>
! p12 23.3.3.4 [forwardlist.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt> on following declarations:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert_after(const_iterator position, initializer_list&lt;T&gt; il);
  </pre></blockquote>
  
  <p>
--- 5988,6003 ----
  Add paragraph:
  </p>
  
! <blockquote><p>
  Returns: position.
! </p></blockquote>
  
  <p>
! p12 23.3.4.5 [forwardlist.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt> on following declarations:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert_after(const_iterator position, initializer_list&lt;T&gt; il);
  </pre></blockquote>
  
  <p>
*************** change return type from <tt>void</tt> to
*** 6813,6822 ****
  </p>
  
  <p>
! p2 23.3.4 [list] Update class definition, change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  
  template &lt;class InputIterator&gt;
  <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
--- 6005,6015 ----
  </p>
  
  <p>
! p2 23.3.5 [list] Update class definition, change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  
  template &lt;class InputIterator&gt;
  <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
*************** template &lt;class InputIterator&gt;
*** 6825,6834 ****
  </pre></blockquote>
  
  <p>
! 23.3.4.3 [list.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt> on following declarations:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
--- 6018,6028 ----
  </pre></blockquote>
  
  <p>
! 23.3.5.4 [list.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt> on following declarations:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
*************** template &lt;class InputIterator&gt;
*** 6838,6855 ****
  Add the following (missing) declaration
  </p>
  
! <blockquote><pre>iterator insert(const_iterator position, initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  <p>
! p2 23.4.1 [vector]
  </p>
  
  <p>
  Update class definition, change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert(const_iterator position, T&amp;&amp; x);
  
  <del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  
--- 6032,6051 ----
  Add the following (missing) declaration
  </p>
  
! <blockquote><pre>
! iterator insert(const_iterator position, initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  <p>
! p2 23.3.6 [vector]
  </p>
  
  <p>
  Update class definition, change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert(const_iterator position, T&amp;&amp; x);
  
  <del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  
*************** template &lt;class InputIterator&gt;
*** 6860,6869 ****
  </pre></blockquote>
  
  <p>
! 23.4.1.4 [vector.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt> on following declarations:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
--- 6056,6066 ----
  </pre></blockquote>
  
  <p>
! 23.3.6.5 [vector.modifiers] change return type from <tt>void</tt> to <tt>iterator</tt> on following declarations:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert(const_iterator position, size_type n, const T&amp; x);
  
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
*************** template &lt;class InputIterator&gt;
*** 6873,6887 ****
  Add the following (missing) declaration
  </p>
  
! <blockquote><pre>iterator insert(const_iterator position, initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  
  <p>
! p1 23.4.2 [vector.bool] Update class definition, change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert (const_iterator position, size_type n, const bool&amp; x);
  
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
--- 6070,6086 ----
  Add the following (missing) declaration
  </p>
  
! <blockquote><pre>
! iterator insert(const_iterator position, initializer_list&lt;T&gt;);
  </pre></blockquote>
  
  
  <p>
! p1 23.3.7 [vector.bool] Update class definition, change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert (const_iterator position, size_type n, const bool&amp; x);
  
  template &lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator position, InputIterator first, InputIterator last);
*************** template &lt;class InputIterator&gt;
*** 6893,6899 ****
  p5 21.4 [basic.string] Update class definition, change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert(const_iterator p, size_type n, charT c);
  
  template&lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator p, InputIterator first, InputIterator last);
--- 6092,6099 ----
  p5 21.4 [basic.string] Update class definition, change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert(const_iterator p, size_type n, charT c);
  
  template&lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator p, InputIterator first, InputIterator last);
*************** template&lt;class InputIterator&gt;
*** 6905,6927 ****
  p13 21.4.6.4 [string::insert] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert(const_iterator p, size_type n, charT c);
  </pre></blockquote>
  
  <p>
  Add paragraph:
  </p>
  
! <blockquote>
  <i>Returns:</i> an iterator which refers to the copy of the first inserted
  character, or <tt>p</tt> if <tt>n == 0</tt>.
! </blockquote>
  
  <p>
  p15 21.4.6.4 [string::insert] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>template&lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator p, InputIterator first, InputIterator last);
  </pre></blockquote>
  
--- 6105,6129 ----
  p13 21.4.6.4 [string::insert] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert(const_iterator p, size_type n, charT c);
  </pre></blockquote>
  
  <p>
  Add paragraph:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> an iterator which refers to the copy of the first inserted
  character, or <tt>p</tt> if <tt>n == 0</tt>.
! </p></blockquote>
  
  <p>
  p15 21.4.6.4 [string::insert] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! template&lt;class InputIterator&gt;
    <del>void</del> <ins>iterator</ins> insert(const_iterator p, InputIterator first, InputIterator last);
  </pre></blockquote>
  
*************** p15 21.4.6.4 [string::insert] change ret
*** 6929,6961 ****
  Add paragraph:
  </p>
  
! <blockquote>
  <i>Returns:</i> an iterator which refers to the copy of the first inserted
  character, or <tt>p</tt> if <tt>first == last</tt>.
! </blockquote>
  
  <p>
  p17 21.4.6.4 [string::insert] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre><del>void</del> <ins>iterator</ins> insert(const_iterator p, initializer_list&lt;charT&gt; il);
  </pre></blockquote>
  
  <p>
  Add paragraph:
  </p>
  
! <blockquote>
  <i>Returns:</i> an iterator which refers to the copy of the first inserted
  character, or <tt>p</tt> if <tt>il</tt> is empty.
! </blockquote>
  
  
  
  <p><b>Rationale:</b></p>
  
  <p><i>[
! The following was the C++98/03 rationale and does not necessarily apply to the
  proposed resolution in the C++0X time frame:
  ]</i></p>
  
--- 6131,6164 ----
  Add paragraph:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> an iterator which refers to the copy of the first inserted
  character, or <tt>p</tt> if <tt>first == last</tt>.
! </p></blockquote>
  
  <p>
  p17 21.4.6.4 [string::insert] change return type from <tt>void</tt> to <tt>iterator</tt>:
  </p>
  
! <blockquote><pre>
! <del>void</del> <ins>iterator</ins> insert(const_iterator p, initializer_list&lt;charT&gt; il);
  </pre></blockquote>
  
  <p>
  Add paragraph:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> an iterator which refers to the copy of the first inserted
  character, or <tt>p</tt> if <tt>il</tt> is empty.
! </p></blockquote>
  
  
  
  <p><b>Rationale:</b></p>
  
  <p><i>[
! The following was the C++98&#47;03 rationale and does not necessarily apply to the
  proposed resolution in the C++0X time frame:
  ]</i></p>
  
*************** not a defect. It may be worth revisiting
*** 6970,6979 ****
  
  <hr>
  <h3><a name="150"></a>150. Find_first_of says integer instead of iterator </h3>
! <p><b>Section:</b> 25.2.7 [alg.find.first.of] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt McClure <b>Opened:</b> 1999-06-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.find.first.of">issues</a> in [alg.find.first.of].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  
--- 6173,6182 ----
  
  <hr>
  <h3><a name="150"></a>150. Find_first_of says integer instead of iterator </h3>
! <p><b>Section:</b> 25.2.7 [alg.find.first.of] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt McClure <b>Opened:</b> 1999-06-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.find.first.of">issues</a> in [alg.find.first.of].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  
*************** that for some iterator j in the range [f
*** 6997,7017 ****
  
  <hr>
  <h3><a name="151"></a>151. Can't currently clear() empty container</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Ed Brey <b>Opened:</b> 1999-06-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>For both sequences and associative containers, a.clear() has the
  semantics of erase(a.begin(),a.end()), which is undefined for an empty
  container since erase(q1,q2) requires that q1 be dereferenceable
  (23.1.1,3 and 23.1.2,7).  When the container is empty, a.begin() is
! not dereferenceable.<br>
! <br>
  The requirement that q1 be unconditionally dereferenceable causes many
  operations to be intuitively undefined, of which clearing an empty
! container is probably the most dire.<br>
! <br>
  Since q1 and q2 are only referenced in the range [q1, q2), and [q1,
  q2) is required to be a valid range, stating that q1 and q2 must be
  iterators or certain kinds of iterators is unnecessary.
--- 6200,6220 ----
  
  <hr>
  <h3><a name="151"></a>151. Can't currently clear() empty container</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Ed Brey <b>Opened:</b> 1999-06-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>For both sequences and associative containers, a.clear() has the
  semantics of erase(a.begin(),a.end()), which is undefined for an empty
  container since erase(q1,q2) requires that q1 be dereferenceable
  (23.1.1,3 and 23.1.2,7).  When the container is empty, a.begin() is
! not dereferenceable.<br/>
! <br/>
  The requirement that q1 be unconditionally dereferenceable causes many
  operations to be intuitively undefined, of which clearing an empty
! container is probably the most dire.<br/>
! <br/>
  Since q1 and q2 are only referenced in the range [q1, q2), and [q1,
  q2) is required to be a valid range, stating that q1 and q2 must be
  iterators or certain kinds of iterators is unnecessary.
*************** iterators or certain kinds of iterators
*** 7044,7053 ****
  
  <hr>
  <h3><a name="152"></a>152. Typo in <tt>scan_is()</tt> semantics</h3>
! <p><b>Section:</b> 22.4.1.1.2 [locale.ctype.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.ctype.virtuals">issues</a> in [locale.ctype.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The semantics of <tt>scan_is()</tt> (paragraphs 4 and 6) is not exactly described
  because there is no function <tt>is()</tt> which only takes a character as
--- 6247,6256 ----
  
  <hr>
  <h3><a name="152"></a>152. Typo in <tt>scan_is()</tt> semantics</h3>
! <p><b>Section:</b> 22.4.1.1.2 [locale.ctype.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.ctype.virtuals">issues</a> in [locale.ctype.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The semantics of <tt>scan_is()</tt> (paragraphs 4 and 6) is not exactly described
  because there is no function <tt>is()</tt> which only takes a character as
*************** vague.</p>
*** 7059,7069 ****
  <p>In 22.4.1.1.2 [locale.ctype.virtuals] paragraphs 4 and 6, change the returns
  clause from:</p>
  <blockquote>
!   <p>"... such that <tt>is(*p)</tt>
! would..."</p>
  </blockquote>
! <p>to:&nbsp; "... such that <tt>is(m, *p)</tt>
!  would...."</p>
  
  
  
--- 6262,6272 ----
  <p>In 22.4.1.1.2 [locale.ctype.virtuals] paragraphs 4 and 6, change the returns
  clause from:</p>
  <blockquote>
!   <p>&quot;... such that <tt>is(*p)</tt>
! would...&quot;</p>
  </blockquote>
! <p>to:&nbsp; &quot;... such that <tt>is(m, *p)</tt>
!  would....&quot;</p>
  
  
  
*************** would..."</p>
*** 7071,7081 ****
  
  <hr>
  <h3><a name="153"></a>153. Typo in <tt>narrow()</tt> semantics</h3>
! <p><b>Section:</b> 22.4.1.3.2 [facet.ctype.char.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.ctype.char.members">issues</a> in [facet.ctype.char.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#207">207</a></p>
  <p><b>Discussion:</b></p>
  <p>The description of the array version of <tt>narrow()</tt> (in
  paragraph 11) is flawed: There is no member <tt>do_narrow()</tt> which
--- 6274,6284 ----
  
  <hr>
  <h3><a name="153"></a>153. Typo in <tt>narrow()</tt> semantics</h3>
! <p><b>Section:</b> 22.4.1.3.2 [facet.ctype.char.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.ctype.char.members">issues</a> in [facet.ctype.char.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#207">207</a></p>
  <p><b>Discussion:</b></p>
  <p>The description of the array version of <tt>narrow()</tt> (in
  paragraph 11) is flawed: There is no member <tt>do_narrow()</tt> which
*************** defined version could be different.]</i>
*** 7115,7127 ****
  
  <p><i>[Post-Tokyo: Dietmar provided the above wording at the request of
  the LWG. He could find no other places the problem occurred. He
! asks for clarification of the Kona "a user defined
! version..." comment above.  Perhaps it was a circuitous way of
! saying "dfault" needed to be uncommented?]</i></p>
  
  
  <p><i>[Post-Toronto: the issues list maintainer has merged in the
! proposed resolution from issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#207">207</a>, which addresses the
  same paragraphs.]</i></p>
  
  
--- 6318,6330 ----
  
  <p><i>[Post-Tokyo: Dietmar provided the above wording at the request of
  the LWG. He could find no other places the problem occurred. He
! asks for clarification of the Kona &quot;a user defined
! version...&quot; comment above.  Perhaps it was a circuitous way of
! saying &quot;dfault&quot; needed to be uncommented?]</i></p>
  
  
  <p><i>[Post-Toronto: the issues list maintainer has merged in the
! proposed resolution from issue <a href="lwg-closed.html#207">207</a>, which addresses the
  same paragraphs.]</i></p>
  
  
*************** same paragraphs.]</i></p>
*** 7131,7140 ****
  
  <hr>
  <h3><a name="154"></a>154. Missing <tt>double</tt> specifier for <tt>do_get()</tt></h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The table in paragraph 7 for the length modifier does not list the length
  modifier <tt>l</tt> to be applied if the type is <tt>double</tt>. Thus, the
--- 6334,6344 ----
  
  <hr>
  <h3><a name="154"></a>154. Missing <tt>double</tt> specifier for <tt>do_get()</tt></h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The table in paragraph 7 for the length modifier does not list the length
  modifier <tt>l</tt> to be applied if the type is <tt>double</tt>. Thus, the
*************** Modifier table to say that for <tt>doubl
*** 7157,7176 ****
  
  <hr>
  <h3><a name="155"></a>155. Typo in naming the class defining the class <tt>Init</tt></h3>
! <p><b>Section:</b> 27.4 [iostream.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.objects">issues</a> in [iostream.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There are conflicting statements about where the class
  <tt>Init</tt> is defined. According to 27.4 [iostream.objects] paragraph 2
! it is defined as <tt>basic_ios::Init</tt>, according to 27.5.2 [ios.base] it is defined as <tt>ios_base::Init</tt>.</p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Change 27.4 [iostream.objects] paragraph 2 from
! "<tt>basic_ios::Init"</tt> to
! "<tt>ios_base::Init"</tt>.</p>
  
  
  <p><b>Rationale:</b></p>
--- 6361,6380 ----
  
  <hr>
  <h3><a name="155"></a>155. Typo in naming the class defining the class <tt>Init</tt></h3>
! <p><b>Section:</b> 27.4 [iostream.objects] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.objects">issues</a> in [iostream.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There are conflicting statements about where the class
  <tt>Init</tt> is defined. According to 27.4 [iostream.objects] paragraph 2
! it is defined as <tt>basic_ios::Init</tt>, according to 27.5.3 [ios.base] it is defined as <tt>ios_base::Init</tt>.</p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Change 27.4 [iostream.objects] paragraph 2 from
! &quot;<tt>basic_ios::Init&quot;</tt> to
! &quot;<tt>ios_base::Init&quot;</tt>.</p>
  
  
  <p><b>Rationale:</b></p>
*************** the change.</p>
*** 7182,7212 ****
  
  <hr>
  <h3><a name="156"></a>156. Typo in <tt>imbue()</tt> description</h3>
! <p><b>Section:</b> 27.5.2.3 [ios.base.locales] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios.base.locales">issues</a> in [ios.base.locales].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There is a small discrepancy between the declarations of
! <tt>imbue()</tt>: in 27.5.2 [ios.base] the argument is passed as
! <tt>locale const&amp;</tt> (correct), in 27.5.2.3 [ios.base.locales] it
  is passed as <tt>locale const</tt> (wrong).</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.5.2.3 [ios.base.locales] change the <tt>imbue</tt> argument
! from "<tt>locale const" to "locale
! const&amp;".</tt></p>
  
  
  
  
  <hr>
  <h3><a name="158"></a>158. Underspecified semantics for <tt>setbuf()</tt></h3>
! <p><b>Section:</b> 27.6.2.4.2 [streambuf.virt.buffer] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#streambuf.virt.buffer">issues</a> in [streambuf.virt.buffer].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The default behavior of <tt>setbuf()</tt> is described only for the
  situation that <tt>gptr() != 0 &amp;&amp; gptr() != egptr()</tt>:
--- 6386,6416 ----
  
  <hr>
  <h3><a name="156"></a>156. Typo in <tt>imbue()</tt> description</h3>
! <p><b>Section:</b> 27.5.3.3 [ios.base.locales] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios.base.locales">issues</a> in [ios.base.locales].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There is a small discrepancy between the declarations of
! <tt>imbue()</tt>: in 27.5.3 [ios.base] the argument is passed as
! <tt>locale const&amp;</tt> (correct), in 27.5.3.3 [ios.base.locales] it
  is passed as <tt>locale const</tt> (wrong).</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.5.3.3 [ios.base.locales] change the <tt>imbue</tt> argument
! from &quot;<tt>locale const&quot; to &quot;locale
! const&amp;&quot;.</tt></p>
  
  
  
  
  <hr>
  <h3><a name="158"></a>158. Underspecified semantics for <tt>setbuf()</tt></h3>
! <p><b>Section:</b> 27.6.3.4.2 [streambuf.virt.buffer] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#streambuf.virt.buffer">issues</a> in [streambuf.virt.buffer].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The default behavior of <tt>setbuf()</tt> is described only for the
  situation that <tt>gptr() != 0 &amp;&amp; gptr() != egptr()</tt>:
*************** to do nothing.</p>
*** 7221,7237 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.6.2.4.2 [streambuf.virt.buffer], paragraph 3, Default behavior,
! to: "Default behavior: Does nothing. Returns this."</p>
  
  
  
  
  <hr>
  <h3><a name="159"></a>159. Strange use of <tt>underflow()</tt></h3>
! <p><b>Section:</b> 27.6.2.4.3 [streambuf.virt.get] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of the meaning of the result of
  <tt>showmanyc()</tt> seems to be rather strange: It uses calls to
--- 6425,6441 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.6.3.4.2 [streambuf.virt.buffer], paragraph 3, Default behavior,
! to: &quot;Default behavior: Does nothing. Returns this.&quot;</p>
  
  
  
  
  <hr>
  <h3><a name="159"></a>159. Strange use of <tt>underflow()</tt></h3>
! <p><b>Section:</b> 27.6.3.4.3 [streambuf.virt.get] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of the meaning of the result of
  <tt>showmanyc()</tt> seems to be rather strange: It uses calls to
*************** be fixed to use <tt>sbumpc()</tt> instea
*** 7242,7261 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.6.2.4.3 [streambuf.virt.get] paragraph 1,
  <tt>showmanyc()</tt>returns clause, by replacing the word
! "supplied" with the words "extracted from the
! stream".</p>
  
  
  
  
  <hr>
  <h3><a name="160"></a>160. Typo: Use of non-existing function <tt>exception()</tt></h3>
! <p><b>Section:</b> 27.7.1.1 [istream] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream">issues</a> in [istream].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The paragraph 4 refers to the function <tt>exception()</tt> which
  is not defined. Probably, the referred function is
--- 6446,6465 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.6.3.4.3 [streambuf.virt.get] paragraph 1,
  <tt>showmanyc()</tt>returns clause, by replacing the word
! &quot;supplied&quot; with the words &quot;extracted from the
! stream&quot;.</p>
  
  
  
  
  <hr>
  <h3><a name="160"></a>160. Typo: Use of non-existing function <tt>exception()</tt></h3>
! <p><b>Section:</b> 27.7.2.1 [istream] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream">issues</a> in [istream].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The paragraph 4 refers to the function <tt>exception()</tt> which
  is not defined. Probably, the referred function is
*************** is not defined. Probably, the referred f
*** 7263,7274 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.1.1 [istream], 27.7.1.3 [istream.unformatted], paragraph 1,
! 27.7.2.1 [ostream], paragraph 3, and 27.7.2.6.1 [ostream.formatted.reqmts],
! paragraph 1, change "<tt>exception()" to
! "exceptions()"</tt>.</p>
  
! <p><i>[Note to Editor: "exceptions" with an "s"
  is the correct spelling.]</i></p>
  
  
--- 6467,6478 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.2.1 [istream], 27.7.2.3 [istream.unformatted], paragraph 1,
! 27.7.3.1 [ostream], paragraph 3, and 27.7.3.6.1 [ostream.formatted.reqmts],
! paragraph 1, change &quot;<tt>exception()&quot; to
! &quot;exceptions()&quot;</tt>.</p>
  
! <p><i>[Note to Editor: &quot;exceptions&quot; with an &quot;s&quot;
  is the correct spelling.]</i></p>
  
  
*************** is the correct spelling.]</i></p>
*** 7278,7287 ****
  
  <hr>
  <h3><a name="161"></a>161. Typo: <tt>istream_iterator</tt> vs. <tt>istreambuf_iterator</tt></h3>
! <p><b>Section:</b> 27.7.1.2.2 [istream.formatted.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.formatted.arithmetic">issues</a> in [istream.formatted.arithmetic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The note in the second paragraph pretends that the first argument
  is an object of type <tt>istream_iterator</tt>. This is wrong: It is
--- 6482,6491 ----
  
  <hr>
  <h3><a name="161"></a>161. Typo: <tt>istream_iterator</tt> vs. <tt>istreambuf_iterator</tt></h3>
! <p><b>Section:</b> 27.7.2.2.2 [istream.formatted.arithmetic] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.formatted.arithmetic">issues</a> in [istream.formatted.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The note in the second paragraph pretends that the first argument
  is an object of type <tt>istream_iterator</tt>. This is wrong: It is
*************** an object of type <tt>istreambuf_iterato
*** 7289,7295 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.7.1.2.2 [istream.formatted.arithmetic] from:</p>
  <blockquote>
    <p>The first argument provides an object of the istream_iterator class...</p>
  </blockquote>
--- 6493,6499 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.7.2.2.2 [istream.formatted.arithmetic] from:</p>
  <blockquote>
    <p>The first argument provides an object of the istream_iterator class...</p>
  </blockquote>
*************** an object of type <tt>istreambuf_iterato
*** 7304,7312 ****
  
  <hr>
  <h3><a name="164"></a>164. do_put() has apparently unused fill argument</h3>
! <p><b>Section:</b> 22.4.5.3.2 [locale.time.put.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 22.4.5.3.2 [locale.time.put.virtuals] the do_put() function is specified
  as taking a fill character as an argument, but the description of the
--- 6508,6516 ----
  
  <hr>
  <h3><a name="164"></a>164. do_put() has apparently unused fill argument</h3>
! <p><b>Section:</b> 22.4.5.3.2 [locale.time.put.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 22.4.5.3.2 [locale.time.put.virtuals] the do_put() function is specified
  as taking a fill character as an argument, but the description of the
*************** in which way. The same holds for any for
*** 7315,7321 ****
  are accessible through the ios_base&amp; argument, such as the
  adjustment or the field width. Is strftime() supposed to use the fill
  character in any way? In any case, the specification of
! time_put.do_put() looks inconsistent to me.<br> <br> Is the
  signature of do_put() wrong, or is the effects clause incomplete?</p>
  
  
--- 6519,6525 ----
  are accessible through the ios_base&amp; argument, such as the
  adjustment or the field width. Is strftime() supposed to use the fill
  character in any way? In any case, the specification of
! time_put.do_put() looks inconsistent to me.<br/> <br/> Is the
  signature of do_put() wrong, or is the effects clause incomplete?</p>
  
  
*************** argument since the standard doesn't say
*** 7338,7351 ****
  
  <hr>
  <h3><a name="165"></a>165. <tt>xsputn()</tt>, <tt>pubsync()</tt> never called by <tt>basic_ostream</tt> members?</h3>
! <p><b>Section:</b> 27.7.2.1 [ostream] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream">issues</a> in [ostream].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 2 explicitly states that none of the <tt>basic_ostream</tt>
! functions falling into one of the groups "formatted output functions"
! and "unformatted output functions" calls any stream buffer function
  which might call a virtual function other than <tt>overflow()</tt>. Basically
  this is fine but this implies that <tt>sputn()</tt> (this function would call
  the virtual function <tt>xsputn()</tt>) is never called by any of the standard
--- 6542,6555 ----
  
  <hr>
  <h3><a name="165"></a>165. <tt>xsputn()</tt>, <tt>pubsync()</tt> never called by <tt>basic_ostream</tt> members?</h3>
! <p><b>Section:</b> 27.7.3.1 [ostream] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream">issues</a> in [ostream].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 2 explicitly states that none of the <tt>basic_ostream</tt>
! functions falling into one of the groups &quot;formatted output functions&quot;
! and &quot;unformatted output functions&quot; calls any stream buffer function
  which might call a virtual function other than <tt>overflow()</tt>. Basically
  this is fine but this implies that <tt>sputn()</tt> (this function would call
  the virtual function <tt>xsputn()</tt>) is never called by any of the standard
*************** call <tt>xsputn()</tt> for strings... Al
*** 7354,7363 ****
  is the only virtual member of <tt>basic_streambuf</tt> called is in conflict
  with the definition of <tt>flush()</tt> which calls <tt>rdbuf()-&gt;pubsync()</tt>
  and thereby the virtual function <tt>sync()</tt> (<tt>flush()</tt> is listed
! under "unformatted output functions").</p>
! <p>In addition, I guess that the sentence starting with "They may use other
! public members of <tt>basic_ostream</tt> ..." probably was intended to
! start with "They may use other public members of <tt>basic_streamuf</tt>..."
  although the problem with the virtual members exists in both cases.</p>
  <p>I see two obvious resolutions:</p>
  <ol>
--- 6558,6567 ----
  is the only virtual member of <tt>basic_streambuf</tt> called is in conflict
  with the definition of <tt>flush()</tt> which calls <tt>rdbuf()-&gt;pubsync()</tt>
  and thereby the virtual function <tt>sync()</tt> (<tt>flush()</tt> is listed
! under &quot;unformatted output functions&quot;).</p>
! <p>In addition, I guess that the sentence starting with &quot;They may use other
! public members of <tt>basic_ostream</tt> ...&quot; probably was intended to
! start with &quot;They may use other public members of <tt>basic_streamuf</tt>...&quot;
  although the problem with the virtual members exists in both cases.</p>
  <p>I see two obvious resolutions:</p>
  <ol>
*************** is allowed to call sync() while other fu
*** 7398,7407 ****
  
  <hr>
  <h3><a name="167"></a>167. Improper use of <tt>traits_type::length()</tt></h3>
! <p><b>Section:</b> 27.7.2.6.4 [ostream.inserters.character] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream.inserters.character">issues</a> in [ostream.inserters.character].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 4 states that the length is determined using
  <tt>traits::length(s)</tt>.  Unfortunately, this function is not
--- 6602,6611 ----
  
  <hr>
  <h3><a name="167"></a>167. Improper use of <tt>traits_type::length()</tt></h3>
! <p><b>Section:</b> 27.7.3.6.4 [ostream.inserters.character] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream.inserters.character">issues</a> in [ostream.inserters.character].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 4 states that the length is determined using
  <tt>traits::length(s)</tt>.  Unfortunately, this function is not
*************** const*</tt>.</p>
*** 7413,7419 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.7.2.6.4 [ostream.inserters.character] paragraph 4 from:</p>
  <blockquote>
    <p>Effects: Behaves like an formatted inserter (as described in
    lib.ostream.formatted.reqmts) of out. After a sentry object is
--- 6617,6623 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 27.7.3.6.4 [ostream.inserters.character] paragraph 4 from:</p>
  <blockquote>
    <p>Effects: Behaves like an formatted inserter (as described in
    lib.ostream.formatted.reqmts) of out. After a sentry object is
*************** to char_traits&lt;char&gt;</p>
*** 7478,7487 ****
  
  <hr>
  <h3><a name="168"></a>168. Typo: formatted vs. unformatted</h3>
! <p><b>Section:</b> 27.7.2.7 [ostream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream.unformatted">issues</a> in [ostream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The first paragraph begins with a descriptions what has to be done
  in <i>formatted</i> output functions. Probably this is a typo and the
--- 6682,6691 ----
  
  <hr>
  <h3><a name="168"></a>168. Typo: formatted vs. unformatted</h3>
! <p><b>Section:</b> 27.7.3.7 [ostream.unformatted] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream.unformatted">issues</a> in [ostream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The first paragraph begins with a descriptions what has to be done
  in <i>formatted</i> output functions. Probably this is a typo and the
*************** paragraph really want to describe unform
*** 7489,7501 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.2.7 [ostream.unformatted] paragraph 1, the first and last
! sentences, change the word "formatted" to
! "unformatted":</p>
  <blockquote>
!   <p>"Each <b>unformatted </b> output function begins ..."<br>
!   "... value specified for the <b>unformatted </b>  output 
!   function."</p>
  </blockquote>
  
  
--- 6693,6705 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.3.7 [ostream.unformatted] paragraph 1, the first and last
! sentences, change the word &quot;formatted&quot; to
! &quot;unformatted&quot;:</p>
  <blockquote>
!   <p>&quot;Each <b>unformatted </b> output function begins ...&quot;<br/>
!   &quot;... value specified for the <b>unformatted </b>  output 
!   function.&quot;</p>
  </blockquote>
  
  
*************** sentences, change the word "formatted" t
*** 7503,7517 ****
  
  <hr>
  <h3><a name="169"></a>169. Bad efficiency of <tt>overflow()</tt> mandated</h3>
! <p><b>Section:</b> 27.8.1.4 [stringbuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 8, Notes, of this section seems to mandate an extremely
  inefficient way of buffer handling for <tt>basic_stringbuf</tt>,
  especially in view of the restriction that <tt>basic_ostream</tt>
! member functions are not allowed to use <tt>xsputn()</tt> (see 27.7.2.1 [ostream]): For each character to be inserted, a new buffer
  is to be created.</p> 
  <p>Of course, the resolution below requires some handling of
  simultaneous input and output since it is no longer possible to update
--- 6707,6721 ----
  
  <hr>
  <h3><a name="169"></a>169. Bad efficiency of <tt>overflow()</tt> mandated</h3>
! <p><b>Section:</b> 27.8.2.4 [stringbuf.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Paragraph 8, Notes, of this section seems to mandate an extremely
  inefficient way of buffer handling for <tt>basic_stringbuf</tt>,
  especially in view of the restriction that <tt>basic_ostream</tt>
! member functions are not allowed to use <tt>xsputn()</tt> (see 27.7.3.1 [ostream]): For each character to be inserted, a new buffer
  is to be created.</p> 
  <p>Of course, the resolution below requires some handling of
  simultaneous input and output since it is no longer possible to update
*************** solution is to handle this in <tt>underf
*** 7520,7527 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.8.1.4 [stringbuf.virtuals] paragraph 8, Notes, insert the words
! "at least" as in the following:</p>
  <blockquote>
    <p>To make a write position available, the function reallocates (or initially
    allocates) an array object with a sufficient number of elements to hold the
--- 6724,6731 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.8.2.4 [stringbuf.virtuals] paragraph 8, Notes, insert the words
! &quot;at least&quot; as in the following:</p>
  <blockquote>
    <p>To make a write position available, the function reallocates (or initially
    allocates) an array object with a sufficient number of elements to hold the
*************** solution is to handle this in <tt>underf
*** 7534,7546 ****
  
  <hr>
  <h3><a name="170"></a>170. Inconsistent definition of <tt>traits_type</tt></h3>
! <p><b>Section:</b> 27.8.4 [stringstream] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The classes <tt>basic_stringstream</tt> (27.8.4 [stringstream]),
! <tt>basic_istringstream</tt> (27.8.2 [istringstream]), and
! <tt>basic_ostringstream</tt> (27.8.3 [ostringstream]) are inconsistent
  in their definition of the type <tt>traits_type</tt>: For
  <tt>istringstream</tt>, this type is defined, for the other two it is
  not. This should be consistent.</p>
--- 6738,6750 ----
  
  <hr>
  <h3><a name="170"></a>170. Inconsistent definition of <tt>traits_type</tt></h3>
! <p><b>Section:</b> 27.8.5 [stringstream] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The classes <tt>basic_stringstream</tt> (27.8.5 [stringstream]),
! <tt>basic_istringstream</tt> (27.8.3 [istringstream]), and
! <tt>basic_ostringstream</tt> (27.8.4 [ostringstream]) are inconsistent
  in their definition of the type <tt>traits_type</tt>: For
  <tt>istringstream</tt>, this type is defined, for the other two it is
  not. This should be consistent.</p>
*************** not. This should be consistent.</p>
*** 7548,7555 ****
  
  <p><b>Proposed resolution:</b></p>
  <p><b>Proposed resolution:</b></p> <p>To the declarations of
! <tt>basic_ostringstream</tt> (27.8.3 [ostringstream]) and
! <tt>basic_stringstream</tt> (27.8.4 [stringstream]) add:</p>
  <blockquote>
  <pre>typedef traits traits_type;</pre>
  </blockquote>
--- 6752,6759 ----
  
  <p><b>Proposed resolution:</b></p>
  <p><b>Proposed resolution:</b></p> <p>To the declarations of
! <tt>basic_ostringstream</tt> (27.8.4 [ostringstream]) and
! <tt>basic_stringstream</tt> (27.8.5 [stringstream]) add:</p>
  <blockquote>
  <pre>typedef traits traits_type;</pre>
  </blockquote>
*************** not. This should be consistent.</p>
*** 7559,7568 ****
  
  <hr>
  <h3><a name="171"></a>171. Strange <tt>seekpos()</tt> semantics due to joint position</h3>
! <p><b>Section:</b> 27.9.1.5 [filebuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#filebuf.virtuals">issues</a> in [filebuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Overridden virtual functions, seekpos()</p> <p>In 27.9.1.1 [filebuf] paragraph 3, it is stated that a joint input and
  output position is maintained by <tt>basic_filebuf</tt>. Still, the
--- 6763,6772 ----
  
  <hr>
  <h3><a name="171"></a>171. Strange <tt>seekpos()</tt> semantics due to joint position</h3>
! <p><b>Section:</b> 27.9.1.5 [filebuf.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#filebuf.virtuals">issues</a> in [filebuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Overridden virtual functions, seekpos()</p> <p>In 27.9.1.1 [filebuf] paragraph 3, it is stated that a joint input and
  output position is maintained by <tt>basic_filebuf</tt>. Still, the
*************** paragraph 14 from:</p>
*** 7625,7645 ****
  
  <hr>
  <h3><a name="172"></a>172. Inconsistent types for <tt>basic_istream::ignore()</tt></h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Greg Comeau, Dietmar Kühl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 27.7.1.1 [istream] the function
  <tt>ignore()</tt> gets an object of type <tt>streamsize</tt> as first
! argument. However, in 27.7.1.3 [istream.unformatted]
  paragraph 23 the first argument is of type <tt>int.</tt></p>
  
  <p>As far as I can see this is not really a contradiction because
  everything is consistent if <tt>streamsize</tt> is typedef to be
  <tt>int</tt>. However, this is almost certainly not what was
  intended. The same thing happened to <tt>basic_filebuf::setbuf()</tt>,
! as described in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#173">173</a>.</p>
  
  <p>Darin Adler also
  submitted this issue, commenting: Either 27.6.1.1 should be modified
--- 6829,6850 ----
  
  <hr>
  <h3><a name="172"></a>172. Inconsistent types for <tt>basic_istream::ignore()</tt></h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Greg Comeau, Dietmar K&uuml;hl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 27.7.2.1 [istream] the function
  <tt>ignore()</tt> gets an object of type <tt>streamsize</tt> as first
! argument. However, in 27.7.2.3 [istream.unformatted]
  paragraph 23 the first argument is of type <tt>int.</tt></p>
  
  <p>As far as I can see this is not really a contradiction because
  everything is consistent if <tt>streamsize</tt> is typedef to be
  <tt>int</tt>. However, this is almost certainly not what was
  intended. The same thing happened to <tt>basic_filebuf::setbuf()</tt>,
! as described in issue <a href="lwg-defects.html#173">173</a>.</p>
  
  <p>Darin Adler also
  submitted this issue, commenting: Either 27.6.1.1 should be modified
*************** numeric_limits&lt;streamsize&gt;::max.</
*** 7649,7655 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.1.3 [istream.unformatted] paragraph 23 and 24, change both uses
  of <tt>int</tt> in the description of <tt>ignore()</tt> to
  <tt>streamsize</tt>.</p>
  
--- 6854,6860 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 27.7.2.3 [istream.unformatted] paragraph 23 and 24, change both uses
  of <tt>int</tt> in the description of <tt>ignore()</tt> to
  <tt>streamsize</tt>.</p>
  
*************** of <tt>int</tt> in the description of <t
*** 7658,7667 ****
  
  <hr>
  <h3><a name="173"></a>173. Inconsistent types for <tt>basic_filebuf::setbuf()</tt></h3>
! <p><b>Section:</b> 27.9.1.5 [filebuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Greg Comeau, Dietmar Kühl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#filebuf.virtuals">issues</a> in [filebuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 6863,6872 ----
  
  <hr>
  <h3><a name="173"></a>173. Inconsistent types for <tt>basic_filebuf::setbuf()</tt></h3>
! <p><b>Section:</b> 27.9.1.5 [filebuf.virtuals] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Greg Comeau, Dietmar K&uuml;hl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#filebuf.virtuals">issues</a> in [filebuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** As far as I can see this is not really a
*** 7676,7682 ****
  everything is consistent if <tt>streamsize</tt> is typedef to be
  <tt>int</tt>. However, this is almost certainly not what was
  intended. The same thing happened to <tt>basic_istream::ignore()</tt>,
! as described in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#172">172</a>.
  </p>
  
  
--- 6881,6887 ----
  everything is consistent if <tt>streamsize</tt> is typedef to be
  <tt>int</tt>. However, this is almost certainly not what was
  intended. The same thing happened to <tt>basic_istream::ignore()</tt>,
! as described in issue <a href="lwg-defects.html#172">172</a>.
  </p>
  
  
*************** as described in issue <a href="http://ww
*** 7691,7700 ****
  
  <hr>
  <h3><a name="174"></a>174. Typo: <tt>OFF_T</tt> vs. <tt>POS_T</tt></h3>
! <p><b>Section:</b> D.8 [depr.ios.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#depr.ios.members">issues</a> in [depr.ios.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>According to paragraph 1 of this section, <tt>streampos</tt> is the
  type <tt>OFF_T</tt>, the same type as <tt>streamoff</tt>. However, in
--- 6896,6905 ----
  
  <hr>
  <h3><a name="174"></a>174. Typo: <tt>OFF_T</tt> vs. <tt>POS_T</tt></h3>
! <p><b>Section:</b> D.6 [depr.ios.members] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.ios.members">issues</a> in [depr.ios.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>According to paragraph 1 of this section, <tt>streampos</tt> is the
  type <tt>OFF_T</tt>, the same type as <tt>streamoff</tt>. However, in
*************** paragraph 6 the <tt>streampos</tt> gets
*** 7702,7725 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change D.8 [depr.ios.members] paragraph 1 from "<tt>typedef
! OFF_T streampos;</tt>" to "<tt>typedef POS_T
! streampos;</tt>"</p>
  
  
  
  
  <hr>
  <h3><a name="175"></a>175. Ambiguity for <tt>basic_streambuf::pubseekpos()</tt> and a few other functions.</h3>
! <p><b>Section:</b> D.8 [depr.ios.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#depr.ios.members">issues</a> in [depr.ios.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>According to paragraph 8 of this section, the methods
  <tt>basic_streambuf::pubseekpos()</tt>,
  <tt>basic_ifstream::open()</tt>, and <tt>basic_ofstream::open</tt>
! "may" be overloaded by a version of this function taking the
  type <tt>ios_base::open_mode</tt> as last argument argument instead of
  <tt>ios_base::openmode</tt> (<tt>ios_base::open_mode</tt> is defined
  in this section to be an alias for one of the integral types). The
--- 6907,6930 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change D.6 [depr.ios.members] paragraph 1 from &quot;<tt>typedef
! OFF_T streampos;</tt>&quot; to &quot;<tt>typedef POS_T
! streampos;</tt>&quot;</p>
  
  
  
  
  <hr>
  <h3><a name="175"></a>175. Ambiguity for <tt>basic_streambuf::pubseekpos()</tt> and a few other functions.</h3>
! <p><b>Section:</b> D.6 [depr.ios.members] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.ios.members">issues</a> in [depr.ios.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>According to paragraph 8 of this section, the methods
  <tt>basic_streambuf::pubseekpos()</tt>,
  <tt>basic_ifstream::open()</tt>, and <tt>basic_ofstream::open</tt>
! &quot;may&quot; be overloaded by a version of this function taking the
  type <tt>ios_base::open_mode</tt> as last argument argument instead of
  <tt>ios_base::openmode</tt> (<tt>ios_base::open_mode</tt> is defined
  in this section to be an alias for one of the integral types). The
*************** argument is not specified.</p>
*** 7730,7736 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In D.8 [depr.ios.members] paragraph 8, remove the default arguments for
  <tt>basic_streambuf::pubseekpos()</tt>,
  <tt>basic_ifstream::open()</tt>, and
  <tt>basic_ofstream::open().</tt></p>
--- 6935,6941 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In D.6 [depr.ios.members] paragraph 8, remove the default arguments for
  <tt>basic_streambuf::pubseekpos()</tt>,
  <tt>basic_ifstream::open()</tt>, and
  <tt>basic_ofstream::open().</tt></p>
*************** argument is not specified.</p>
*** 7740,7760 ****
  
  <hr>
  <h3><a name="176"></a>176. <tt>exceptions()</tt> in <tt>ios_base</tt>...?</h3>
! <p><b>Section:</b> D.8 [depr.ios.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#depr.ios.members">issues</a> in [depr.ios.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The "overload" for the function <tt>exceptions()</tt> in
  paragraph 8 gives the impression that there is another function of
  this function defined in class <tt>ios_base</tt>. However, this is not
  the case. Thus, it is hard to tell how the semantics (paragraph 9) can
! be implemented: "Call the corresponding member function specified
! in clause 27 [input.output]."</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In D.8 [depr.ios.members] paragraph 8, move the declaration of the
  function <tt>exceptions()</tt>into class <tt>basic_ios</tt>.</p>
  
  
--- 6945,6965 ----
  
  <hr>
  <h3><a name="176"></a>176. <tt>exceptions()</tt> in <tt>ios_base</tt>...?</h3>
! <p><b>Section:</b> D.6 [depr.ios.members] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 1999-07-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.ios.members">issues</a> in [depr.ios.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The &quot;overload&quot; for the function <tt>exceptions()</tt> in
  paragraph 8 gives the impression that there is another function of
  this function defined in class <tt>ios_base</tt>. However, this is not
  the case. Thus, it is hard to tell how the semantics (paragraph 9) can
! be implemented: &quot;Call the corresponding member function specified
! in clause 27 [input.output].&quot;</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In D.6 [depr.ios.members] paragraph 8, move the declaration of the
  function <tt>exceptions()</tt>into class <tt>basic_ios</tt>.</p>
  
  
*************** function <tt>exceptions()</tt>into class
*** 7762,7771 ****
  
  <hr>
  <h3><a name="179"></a>179. Comparison of const_iterators to iterators doesn't work</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-07-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Currently the following will not compile on two well-known standard
  library implementations:</p>
--- 6967,6977 ----
  
  <hr>
  <h3><a name="179"></a>179. Comparison of const_iterators to iterators doesn't work</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 1998-07-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Currently the following will not compile on two well-known standard
  library implementations:</p>
*************** return i == ci;
*** 7818,7824 ****
      The fix is to make the comparison operators templated on two types.
      </p>
  
!     <pre>    template &lt;class Iterator1, class Iterator2&gt;
      bool operator== (reverse_iterator&lt;Iterator1&gt; const&amp; x,
                       reverse_iterator&lt;Iterator2&gt; const&amp; y);
      </pre>
--- 7024,7031 ----
      The fix is to make the comparison operators templated on two types.
      </p>
  
!     <pre>
!     template &lt;class Iterator1, class Iterator2&gt;
      bool operator== (reverse_iterator&lt;Iterator1&gt; const&amp; x,
                       reverse_iterator&lt;Iterator2&gt; const&amp; y);
      </pre>
*************** return i == ci;
*** 7844,7850 ****
  <p>Insert this paragraph after 23.2 [container.requirements] paragraph 7:</p>
  <blockquote>
    <p>In the expressions</p>
!   <pre>    i == j
      i != j
      i &lt; j
      i &lt;= j
--- 7051,7058 ----
  <p>Insert this paragraph after 23.2 [container.requirements] paragraph 7:</p>
  <blockquote>
    <p>In the expressions</p>
!   <pre>
!     i == j
      i != j
      i &lt; j
      i &lt;= j
*************** the nested types <tt>X::iterator</tt> an
*** 7876,7882 ****
  where <tt>X</tt> is a container.  There is no requirement that
  <tt>X::reverse_iterator</tt> and <tt>X::const_reverse_iterator</tt>
  can be mixed.  If mixing them is considered important, that's a
! separate issue.  (Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#280">280</a>.)
  </p>
  
  
--- 7084,7090 ----
  where <tt>X</tt> is a container.  There is no requirement that
  <tt>X::reverse_iterator</tt> and <tt>X::const_reverse_iterator</tt>
  can be mixed.  If mixing them is considered important, that's a
! separate issue.  (Issue <a href="lwg-defects.html#280">280</a>.)
  </p>
  
  
*************** separate issue.  (Issue <a href="http://
*** 7884,7893 ****
  
  <hr>
  <h3><a name="180"></a>180. Container member iterator arguments constness has unintended consequences</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 1999-07-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It is the constness of the container which should control whether
  it can be modified through a member function such as erase(), not the
--- 7092,7102 ----
  
  <hr>
  <h3><a name="180"></a>180. Container member iterator arguments constness has unintended consequences</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 1999-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It is the constness of the container which should control whether
  it can be modified through a member function such as erase(), not the
*************** We note that the supplied wording addres
*** 7956,7962 ****
  Update the following signature in the <tt>basic_string</tt> class template definition in
  21.4 [basic.string], p5:
  </p>
! <blockquote><pre>namespace std {
    template&lt;class charT, class traits = char_traits&lt;charT&gt;,
      class Allocator = allocator&lt;charT&gt; &gt;
    class basic_string {
--- 7165,7172 ----
  Update the following signature in the <tt>basic_string</tt> class template definition in
  21.4 [basic.string], p5:
  </p>
! <blockquote><pre>
! namespace std {
    template&lt;class charT, class traits = char_traits&lt;charT&gt;,
      class Allocator = allocator&lt;charT&gt; &gt;
    class basic_string {
*************** Update the following signature in the <t
*** 7984,7990 ****
  Update the following signatures in 21.4.6.4 [string::insert]:
  </p>
  
! <blockquote><pre>iterator insert(<ins>const_</ins>iterator p, charT c);
  void insert(<ins>const_</ins>iterator p, size_type n, charT c);
  template&lt;class InputIterator&gt;
    void insert(<ins>const_</ins>iterator p, InputIterator first, InputIterator last);
--- 7194,7201 ----
  Update the following signatures in 21.4.6.4 [string::insert]:
  </p>
  
! <blockquote><pre>
! iterator insert(<ins>const_</ins>iterator p, charT c);
  void insert(<ins>const_</ins>iterator p, size_type n, charT c);
  template&lt;class InputIterator&gt;
    void insert(<ins>const_</ins>iterator p, InputIterator first, InputIterator last);
*************** void insert(<ins>const_</ins>iterator <i
*** 7995,8001 ****
  Update the following signatures in 21.4.6.5 [string::erase]:
  </p>
  
! <blockquote><pre>iterator erase(<ins>const_</ins>iterator <ins>const_</ins>position);
  iterator erase(<ins>const_</ins>iterator first, <ins>const_</ins>iterator last);
  </pre></blockquote>
  
--- 7206,7213 ----
  Update the following signatures in 21.4.6.5 [string::erase]:
  </p>
  
! <blockquote><pre>
! iterator erase(<ins>const_</ins>iterator <ins>const_</ins>position);
  iterator erase(<ins>const_</ins>iterator first, <ins>const_</ins>iterator last);
  </pre></blockquote>
  
*************** seems more of a design issue that an out
*** 8012,8042 ****
  
  <p>The LWG believes that this issue should be considered as part of a
  general review of const issues for the next revision of the
! standard. Also see issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#200">200</a>.</p>
  
  
  
  
  <hr>
  <h3><a name="181"></a>181. make_pair() unintended behavior</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-08-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The claim has surfaced in Usenet that expressions such as<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <tt>make_pair("abc", 3)</tt><br>
! <br>
  are illegal, notwithstanding their use in examples, because template instantiation tries to bind the first template
! parameter to <tt> const char (&amp;)[4]</tt>, which type is uncopyable.<br>
! <br>
  I doubt anyone intended that behavior...
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.3 [utility], paragraph 1 change the following
  declaration of make_pair():</p>
  <blockquote>
    <pre>template &lt;class T1, class T2&gt; pair&lt;T1,T2&gt; make_pair(const T1&amp;, const T2&amp;);</pre>
--- 7224,7254 ----
  
  <p>The LWG believes that this issue should be considered as part of a
  general review of const issues for the next revision of the
! standard. Also see issue <a href="lwg-defects.html#200">200</a>.</p>
  
  
  
  
  <hr>
  <h3><a name="181"></a>181. make_pair() unintended behavior</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-08-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The claim has surfaced in Usenet that expressions such as<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <tt>make_pair(&quot;abc&quot;, 3)</tt><br/>
! <br/>
  are illegal, notwithstanding their use in examples, because template instantiation tries to bind the first template
! parameter to <tt> const char (&amp;)[4]</tt>, which type is uncopyable.<br/>
! <br/>
  I doubt anyone intended that behavior...
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.2 [utility], paragraph 1 change the following
  declaration of make_pair():</p>
  <blockquote>
    <pre>template &lt;class T1, class T2&gt; pair&lt;T1,T2&gt; make_pair(const T1&amp;, const T2&amp;);</pre>
*************** declaration of make_pair():</p>
*** 8045,8051 ****
  <blockquote>
    <pre>template &lt;class T1, class T2&gt; pair&lt;T1,T2&gt; make_pair(T1, T2);</pre>
  </blockquote>
! <p>  In 20.3.5 [pairs] paragraph 7 and the line before, change:</p>
  <blockquote>
  <pre>template &lt;class T1, class T2&gt;
  pair&lt;T1, T2&gt; make_pair(const T1&amp; x, const T2&amp; y);</pre>
--- 7257,7263 ----
  <blockquote>
    <pre>template &lt;class T1, class T2&gt; pair&lt;T1,T2&gt; make_pair(T1, T2);</pre>
  </blockquote>
! <p>  In 20.3 [pairs] paragraph 7 and the line before, change:</p>
  <blockquote>
  <pre>template &lt;class T1, class T2&gt;
  pair&lt;T1, T2&gt; make_pair(const T1&amp; x, const T2&amp; y);</pre>
*************** pair&lt;T1, T2&gt; make_pair(T1 x, T2 y)
*** 8065,8071 ****
  
  <p><b>Rationale:</b></p>
  <p>Two potential fixes were suggested by Matt Austern and Dietmar
! Kühl, respectively, 1) overloading with array arguments, and 2) use of
  a reference_traits class with a specialization for arrays.  Andy
  Koenig suggested changing to pass by value. In discussion, it appeared
  that this was a much smaller change to the standard that the other two
--- 7277,7283 ----
  
  <p><b>Rationale:</b></p>
  <p>Two potential fixes were suggested by Matt Austern and Dietmar
! K&uuml;hl, respectively, 1) overloading with array arguments, and 2) use of
  a reference_traits class with a specialization for arrays.  Andy
  Koenig suggested changing to pass by value. In discussion, it appeared
  that this was a much smaller change to the standard that the other two
*************** proposed resolution passed their test su
*** 8078,8092 ****
  
  <hr>
  <h3><a name="182"></a>182. Ambiguous references to size_t</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Al Stevens <b>Opened:</b> 1999-08-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Many references to <tt> size_t</tt> throughout the document
  omit the <tt> std::</tt> namespace qualification.</p> <p>For
! example, 17.6.3.6 [replacement.functions] paragraph 2:</p>
  <blockquote>
  <pre> operator new(size_t)
   operator new(size_t, const std::nothrow_t&amp;)
--- 7290,7304 ----
  
  <hr>
  <h3><a name="182"></a>182. Ambiguous references to size_t</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Al Stevens <b>Opened:</b> 1999-08-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Many references to <tt> size_t</tt> throughout the document
  omit the <tt> std::</tt> namespace qualification.</p> <p>For
! example, 17.6.4.6 [replacement.functions] paragraph 2:</p>
  <blockquote>
  <pre> operator new(size_t)
   operator new(size_t, const std::nothrow_t&amp;)
*************** example, 17.6.3.6 [replacement.functions
*** 8096,8106 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>   In 17.6.3.6 [replacement.functions] paragraph 2: replace:</p>
  <blockquote>
! <p><tt>     - operator new(size_t)<br>
!      - operator new(size_t, const std::nothrow_t&amp;)<br>
!      - operator new[](size_t)<br>
       - operator new[](size_t, const std::nothrow_t&amp;)</tt></p>
  </blockquote>
  <p>    by:</p>
--- 7308,7318 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>   In 17.6.4.6 [replacement.functions] paragraph 2: replace:</p>
  <blockquote>
! <p><tt>     - operator new(size_t)<br/>
!      - operator new(size_t, const std::nothrow_t&amp;)<br/>
!      - operator new[](size_t)<br/>
       - operator new[](size_t, const std::nothrow_t&amp;)</tt></p>
  </blockquote>
  <p>    by:</p>
*************** example, 17.6.3.6 [replacement.functions
*** 8154,8170 ****
    pos denotes a value of type X::pos_type; and state denotes a value of type X::state_type.</p>
  </blockquote>
  <p>In [lib.char.traits.require] 21.1.1, table 37: replace the return type of
! X::length(p): "size_t" by "std::size_t".</p>
! <p>   In [lib.std.iterator.tags] 24.3.3, paragraph 2:    replace:<br>
! &nbsp;&nbsp;&nbsp; typedef ptrdiff_t difference_type;<br>
!     by:<br>
  &nbsp;&nbsp;&nbsp; typedef std::ptrdiff_t difference_type;</p>
! <p>   In [lib.locale.ctype] 22.2.1.1 put namespace std { ...} around the declaration of    template &lt;class charT&gt; class ctype.<br>
! <br>
!    In [lib.iterator.traits] 24.3.1, paragraph 2    put namespace std { ...} around the declaration of:<br>
! <br>
! &nbsp;&nbsp;&nbsp; template&lt;class Iterator&gt; struct iterator_traits<br>
! &nbsp;&nbsp;&nbsp; template&lt;class T&gt; struct iterator_traits&lt;T*&gt;<br>
  &nbsp;&nbsp;&nbsp; template&lt;class T&gt; struct iterator_traits&lt;const T*&gt;</p>
  
  
--- 7366,7382 ----
    pos denotes a value of type X::pos_type; and state denotes a value of type X::state_type.</p>
  </blockquote>
  <p>In [lib.char.traits.require] 21.1.1, table 37: replace the return type of
! X::length(p): &quot;size_t&quot; by &quot;std::size_t&quot;.</p>
! <p>   In [lib.std.iterator.tags] 24.3.3, paragraph 2:    replace:<br/>
! &nbsp;&nbsp;&nbsp; typedef ptrdiff_t difference_type;<br/>
!     by:<br/>
  &nbsp;&nbsp;&nbsp; typedef std::ptrdiff_t difference_type;</p>
! <p>   In [lib.locale.ctype] 22.2.1.1 put namespace std { ...} around the declaration of    template &lt;class charT&gt; class ctype.<br/>
! <br/>
!    In [lib.iterator.traits] 24.3.1, paragraph 2    put namespace std { ...} around the declaration of:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp; template&lt;class Iterator&gt; struct iterator_traits<br/>
! &nbsp;&nbsp;&nbsp; template&lt;class T&gt; struct iterator_traits&lt;T*&gt;<br/>
  &nbsp;&nbsp;&nbsp; template&lt;class T&gt; struct iterator_traits&lt;const T*&gt;</p>
  
  
*************** X::length(p): "size_t" by "std::size_t".
*** 8172,8178 ****
  <p>The LWG believes correcting names like <tt>size_t</tt> and
  <tt>ptrdiff_t</tt> to <tt>std::size_t</tt> and <tt>std::ptrdiff_t</tt>
  to be essentially editorial.  There there can't be another size_t or
! ptrdiff_t meant anyway because, according to 17.6.3.3.4 [extern.types],</p>
  
  <blockquote><p>
  For each type T from the Standard C library, the types ::T and std::T
--- 7384,7390 ----
  <p>The LWG believes correcting names like <tt>size_t</tt> and
  <tt>ptrdiff_t</tt> to <tt>std::size_t</tt> and <tt>std::ptrdiff_t</tt>
  to be essentially editorial.  There there can't be another size_t or
! ptrdiff_t meant anyway because, according to 17.6.4.3.3 [extern.types],</p>
  
  <blockquote><p>
  For each type T from the Standard C library, the types ::T and std::T
*************** Editor's authority to make this change.<
*** 8187,8193 ****
  request of the LWG.]</i></p>
  
  
! <p><i>[Toronto: This is tangentially related to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#229">229</a>, but only tangentially: the intent of this issue is to
  address use of the name <tt>size_t</tt> in contexts outside of
  namespace std, such as in the description of <tt>::operator new</tt>.
  The proposed changes should be reviewed to make sure they are
--- 7399,7405 ----
  request of the LWG.]</i></p>
  
  
! <p><i>[Toronto: This is tangentially related to issue <a href="lwg-defects.html#229">229</a>, but only tangentially: the intent of this issue is to
  address use of the name <tt>size_t</tt> in contexts outside of
  namespace std, such as in the description of <tt>::operator new</tt>.
  The proposed changes should be reviewed to make sure they are
*************** them to be correct.]</i></p>
*** 8205,8216 ****
  
  <hr>
  <h3><a name="183"></a>183. I/O stream manipulators don't work for wide character streams</h3>
! <p><b>Section:</b> 27.7.3 [std.manip] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 1999-07-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#std.manip">issues</a> in [std.manip].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>27.7.3 [std.manip] paragraph 3 says (clause numbering added for
  exposition):</p>
  <blockquote>
  <p>Returns: An object s of unspecified type such that if [1] out is an (instance
--- 7417,7428 ----
  
  <hr>
  <h3><a name="183"></a>183. I/O stream manipulators don't work for wide character streams</h3>
! <p><b>Section:</b> 27.7.4 [std.manip] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 1999-07-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#std.manip">issues</a> in [std.manip].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>27.7.4 [std.manip] paragraph 3 says (clause numbering added for
  exposition):</p>
  <blockquote>
  <p>Returns: An object s of unspecified type such that if [1] out is an (instance
*************** out&lt;&lt;s has type ostream&amp; and v
*** 8223,8352 ****
  has type istream&amp; and value in.</p>
  </blockquote>
  <p>Given the definitions [1] and [2] for out and in, surely [3] should read:
! "The expression out &lt;&lt; s has type basic_ostream&amp; ..." and
! [4] should read: "The expression in &gt;&gt; s has type basic_istream&amp;
! ..."</p>
  <p>If the wording in the standard is correct, I can see no way of implementing
  any of the manipulators so that they will work with wide character streams.</p>
  <p>e.g. wcout &lt;&lt; setbase( 16 );</p>
  <p>Must have value 'wcout' (which makes sense) and type 'ostream&amp;' (which
  doesn't).</p>
! <p>The same "cut'n'paste" type also seems to occur in Paras 4,5,7 and
  8. In addition, Para 6 [setfill] has a similar error, but relates only to
  ostreams.</p>
  <p>I'd be happier if there was a better way of saying this, to make it clear
! that the value of the expression is "the same specialization of
! basic_ostream as out"&amp;</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace section 27.7.3 [std.manip] except paragraph 1 with the
  following:</p>
  <blockquote>
  <p>2- The type designated smanip in each of the following function descriptions is implementation-specified and may be different for each
! function.<br>
! <br>
! <tt>smanip resetiosflags(ios_base::fmtflags mask);</tt><br>
! <br>
  -3- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, mask) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if
! f(s, mask) were called. The function f can be defined as:*<br>
! <br>
  [Footnote: The expression cin &gt;&gt; resetiosflags(ios_base::skipws) clears ios_base::skipws in the format flags stored in the
  basic_istream&lt;charT,traits&gt; object cin (the same as cin &gt;&gt; noskipws), and the expression cout &lt;&lt; resetiosflags(ios_base::showbase) clears
  ios_base::showbase in the format flags stored in the basic_ostream&lt;charT,traits&gt; object cout (the same as cout &lt;&lt;
! noshowbase). --- end footnote]<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, ios_base::fmtflags mask)<br>
! &nbsp;&nbsp; {<br>
! &nbsp;&nbsp; //  reset specified flags<br>
! &nbsp;&nbsp; str.setf(ios_base::fmtflags(0), mask);<br>
! &nbsp;&nbsp; return str;<br>
! &nbsp;&nbsp; }<br>
! </tt><br>
  The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.
! The expression in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value in.<br>
! <br>
! &nbsp;<tt>smanip setiosflags(ios_base::fmtflags mask);</tt><br>
! <br>
  -4- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, mask) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if f(s,
! mask) were called. The function f can be defined as:<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, ios_base::fmtflags mask)<br>
! &nbsp;&nbsp; {<br>
! &nbsp;&nbsp; //  set specified flags<br>
! &nbsp;&nbsp; str.setf(mask);<br>
! &nbsp;&nbsp; return str;<br>
! &nbsp;&nbsp; }<br>
! </tt><br>
  The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.
! The expression in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value in.<br>
! <br>
! <tt>smanip setbase(int base);</tt><br>
! <br>
  -5- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, base) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if f(s,
! base) were called. The function f can be defined as:<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, int base)<br>
! &nbsp;&nbsp; {<br>
! &nbsp;&nbsp; //  set  basefield<br>
! &nbsp;&nbsp; str.setf(base ==  8 ? ios_base::oct :<br>
! &nbsp;&nbsp; base == 10 ? ios_base::dec :<br>
! &nbsp;&nbsp; base == 16 ? ios_base::hex :<br>
! &nbsp;&nbsp; ios_base::fmtflags(0), ios_base::basefield);<br>
! &nbsp;&nbsp; return str;<br>
! &nbsp;&nbsp; }<br>
! </tt><br>
  The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.
! The expression in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value in.<br>
! <br>
! <tt>smanip setfill(char_type c);<br>
! </tt><br>
  -6- Returns: An object s of unspecified type such that if out is (or is derived from) basic_ostream&lt;charT,traits&gt; and c has type charT then the
  expression out&lt;&lt;s behaves as if f(s, c) were called. The function f can be
! defined as:<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <tt>template&lt;class charT, class traits&gt;<br>
! &nbsp;&nbsp; basic_ios&lt;charT,traits&gt;&amp; f(basic_ios&lt;charT,traits&gt;&amp; str, charT c)<br>
! &nbsp;&nbsp; {<br>
! &nbsp;&nbsp; //  set fill character<br>
! &nbsp;&nbsp; str.fill(c);<br>
! &nbsp;&nbsp; return str;<br>
! &nbsp;&nbsp; }<br>
! </tt><br>
! The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.<br>
! <br>
! <tt>smanip setprecision(int n);</tt><br>
! <br>
  -7- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, n) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if f(s, n)
! were called. The function f can be defined as:<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, int n)<br>
! &nbsp;&nbsp; {<br>
! &nbsp;&nbsp; //  set precision<br>
! &nbsp;&nbsp; str.precision(n);<br>
! &nbsp;&nbsp; return str;<br>
! &nbsp;&nbsp; }<br>
! </tt><br>
  The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.
! The expression in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value in<br>
! .<br>
! <tt>smanip setw(int n);<br>
! </tt><br>
  -8- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, n) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if f(s, n)
! were called. The function f can be defined as:<br>
! <br>
! &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, int n)<br>
! &nbsp;&nbsp; {<br>
! &nbsp;&nbsp; //  set width<br>
! &nbsp;&nbsp; str.width(n);<br>
! &nbsp;&nbsp; return str;<br>
! &nbsp;&nbsp; }<br>
! </tt><br>
  The expression out&lt;&lt;s has type
  basic_ostream&lt;charT,traits&gt;&amp; and value out.  The expression
  in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value
--- 7435,7564 ----
  has type istream&amp; and value in.</p>
  </blockquote>
  <p>Given the definitions [1] and [2] for out and in, surely [3] should read:
! &quot;The expression out &lt;&lt; s has type basic_ostream&amp; ...&quot; and
! [4] should read: &quot;The expression in &gt;&gt; s has type basic_istream&amp;
! ...&quot;</p>
  <p>If the wording in the standard is correct, I can see no way of implementing
  any of the manipulators so that they will work with wide character streams.</p>
  <p>e.g. wcout &lt;&lt; setbase( 16 );</p>
  <p>Must have value 'wcout' (which makes sense) and type 'ostream&amp;' (which
  doesn't).</p>
! <p>The same &quot;cut'n'paste&quot; type also seems to occur in Paras 4,5,7 and
  8. In addition, Para 6 [setfill] has a similar error, but relates only to
  ostreams.</p>
  <p>I'd be happier if there was a better way of saying this, to make it clear
! that the value of the expression is &quot;the same specialization of
! basic_ostream as out&quot;&amp;</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace section 27.7.4 [std.manip] except paragraph 1 with the
  following:</p>
  <blockquote>
  <p>2- The type designated smanip in each of the following function descriptions is implementation-specified and may be different for each
! function.<br/>
! <br/>
! <tt>smanip resetiosflags(ios_base::fmtflags mask);</tt><br/>
! <br/>
  -3- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, mask) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if
! f(s, mask) were called. The function f can be defined as:*<br/>
! <br/>
  [Footnote: The expression cin &gt;&gt; resetiosflags(ios_base::skipws) clears ios_base::skipws in the format flags stored in the
  basic_istream&lt;charT,traits&gt; object cin (the same as cin &gt;&gt; noskipws), and the expression cout &lt;&lt; resetiosflags(ios_base::showbase) clears
  ios_base::showbase in the format flags stored in the basic_ostream&lt;charT,traits&gt; object cout (the same as cout &lt;&lt;
! noshowbase). --- end footnote]<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, ios_base::fmtflags mask)<br/>
! &nbsp;&nbsp; {<br/>
! &nbsp;&nbsp; //  reset specified flags<br/>
! &nbsp;&nbsp; str.setf(ios_base::fmtflags(0), mask);<br/>
! &nbsp;&nbsp; return str;<br/>
! &nbsp;&nbsp; }<br/>
! </tt><br/>
  The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.
! The expression in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value in.<br/>
! <br/>
! &nbsp;<tt>smanip setiosflags(ios_base::fmtflags mask);</tt><br/>
! <br/>
  -4- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, mask) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if f(s,
! mask) were called. The function f can be defined as:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, ios_base::fmtflags mask)<br/>
! &nbsp;&nbsp; {<br/>
! &nbsp;&nbsp; //  set specified flags<br/>
! &nbsp;&nbsp; str.setf(mask);<br/>
! &nbsp;&nbsp; return str;<br/>
! &nbsp;&nbsp; }<br/>
! </tt><br/>
  The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.
! The expression in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value in.<br/>
! <br/>
! <tt>smanip setbase(int base);</tt><br/>
! <br/>
  -5- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, base) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if f(s,
! base) were called. The function f can be defined as:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, int base)<br/>
! &nbsp;&nbsp; {<br/>
! &nbsp;&nbsp; //  set  basefield<br/>
! &nbsp;&nbsp; str.setf(base ==  8 ? ios_base::oct :<br/>
! &nbsp;&nbsp; base == 10 ? ios_base::dec :<br/>
! &nbsp;&nbsp; base == 16 ? ios_base::hex :<br/>
! &nbsp;&nbsp; ios_base::fmtflags(0), ios_base::basefield);<br/>
! &nbsp;&nbsp; return str;<br/>
! &nbsp;&nbsp; }<br/>
! </tt><br/>
  The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.
! The expression in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value in.<br/>
! <br/>
! <tt>smanip setfill(char_type c);<br/>
! </tt><br/>
  -6- Returns: An object s of unspecified type such that if out is (or is derived from) basic_ostream&lt;charT,traits&gt; and c has type charT then the
  expression out&lt;&lt;s behaves as if f(s, c) were called. The function f can be
! defined as:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <tt>template&lt;class charT, class traits&gt;<br/>
! &nbsp;&nbsp; basic_ios&lt;charT,traits&gt;&amp; f(basic_ios&lt;charT,traits&gt;&amp; str, charT c)<br/>
! &nbsp;&nbsp; {<br/>
! &nbsp;&nbsp; //  set fill character<br/>
! &nbsp;&nbsp; str.fill(c);<br/>
! &nbsp;&nbsp; return str;<br/>
! &nbsp;&nbsp; }<br/>
! </tt><br/>
! The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.<br/>
! <br/>
! <tt>smanip setprecision(int n);</tt><br/>
! <br/>
  -7- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, n) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if f(s, n)
! were called. The function f can be defined as:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, int n)<br/>
! &nbsp;&nbsp; {<br/>
! &nbsp;&nbsp; //  set precision<br/>
! &nbsp;&nbsp; str.precision(n);<br/>
! &nbsp;&nbsp; return str;<br/>
! &nbsp;&nbsp; }<br/>
! </tt><br/>
  The expression out&lt;&lt;s has type basic_ostream&lt;charT,traits&gt;&amp; and value out.
! The expression in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value in<br/>
! .<br/>
! <tt>smanip setw(int n);<br/>
! </tt><br/>
  -8- Returns: An object s of unspecified type such that if out is an instance of basic_ostream&lt;charT,traits&gt; then the expression out&lt;&lt;s behaves
  as if f(s, n) were called, or if in is an instance of basic_istream&lt;charT,traits&gt; then the expression in&gt;&gt;s behaves as if f(s, n)
! were called. The function f can be defined as:<br/>
! <br/>
! &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <tt>ios_base&amp; f(ios_base&amp; str, int n)<br/>
! &nbsp;&nbsp; {<br/>
! &nbsp;&nbsp; //  set width<br/>
! &nbsp;&nbsp; str.width(n);<br/>
! &nbsp;&nbsp; return str;<br/>
! &nbsp;&nbsp; }<br/>
! </tt><br/>
  The expression out&lt;&lt;s has type
  basic_ostream&lt;charT,traits&gt;&amp; and value out.  The expression
  in&gt;&gt;s has type basic_istream&lt;charT,traits&gt;&amp; and value
*************** in.
*** 8358,8369 ****
  the proposed resolution.]</i></p>
  
  
! <p><i>[Tokyo - The LWG noted that issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#216">216</a> involves
  the same paragraphs.]</i></p>
  
  
  <p><i>[Post-Tokyo: The issues list maintainer combined the proposed
! resolution of this issue with the proposed resolution for issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#216">216</a> as they both involved the same paragraphs, and were so
  intertwined that dealing with them separately appear fraught with
  error.  The full text was supplied by Bill Plauger; it was cross
  checked against changes supplied by Andy Sawyer. It should be further
--- 7570,7581 ----
  the proposed resolution.]</i></p>
  
  
! <p><i>[Tokyo - The LWG noted that issue <a href="lwg-closed.html#216">216</a> involves
  the same paragraphs.]</i></p>
  
  
  <p><i>[Post-Tokyo: The issues list maintainer combined the proposed
! resolution of this issue with the proposed resolution for issue <a href="lwg-closed.html#216">216</a> as they both involved the same paragraphs, and were so
  intertwined that dealing with them separately appear fraught with
  error.  The full text was supplied by Bill Plauger; it was cross
  checked against changes supplied by Andy Sawyer. It should be further
*************** checked by the LWG.]</i></p>
*** 8376,8388 ****
  
  <hr>
  <h3><a name="184"></a>184. numeric_limits&lt;bool&gt; wording problems</h3>
! <p><b>Section:</b> 18.3.1.5 [numeric.special] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 1999-07-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numeric.special">issues</a> in [numeric.special].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>bools are defined by the standard to be of integer types, as per
! 3.9.1 [basic.fundamental] paragraph 7.  However "integer types"
  seems to have a special meaning for the author of 18.2. The net effect
  is an unclear and confusing specification for
  numeric_limits&lt;bool&gt; as evidenced below.</p>
--- 7588,7600 ----
  
  <hr>
  <h3><a name="184"></a>184. numeric_limits&lt;bool&gt; wording problems</h3>
! <p><b>Section:</b> 18.3.2.7 [numeric.special] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 1999-07-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numeric.special">issues</a> in [numeric.special].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>bools are defined by the standard to be of integer types, as per
! 3.9.1 [basic.fundamental] paragraph 7.  However &quot;integer types&quot;
  seems to have a special meaning for the author of 18.2. The net effect
  is an unclear and confusing specification for
  numeric_limits&lt;bool&gt; as evidenced below.</p>
*************** to be meaningful.</p>
*** 8410,8420 ****
  </blockquote>
  
  <p>This disposition is at best misleading and confusing for the standard
! requires a "pure binary numeration system" for integer types as per
  3.9.1/7</p>
  
! <p>The footnote 186) says: "Distinguishes types with base other than 2 (e.g
! BCD)."&nbsp; This also erroneous as the standard never defines any integer
  types with base representation other than 2.</p>
  
  <p>Furthermore, numeric_limits&lt;bool&gt;::is_modulo and
--- 7622,7632 ----
  </blockquote>
  
  <p>This disposition is at best misleading and confusing for the standard
! requires a &quot;pure binary numeration system&quot; for integer types as per
  3.9.1/7</p>
  
! <p>The footnote 186) says: &quot;Distinguishes types with base other than 2 (e.g
! BCD).&quot;&nbsp; This also erroneous as the standard never defines any integer
  types with base representation other than 2.</p>
  
  <p>Furthermore, numeric_limits&lt;bool&gt;::is_modulo and
*************** numeric_limits&lt;bool&gt;::is_signed ha
*** 8422,8428 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Append to the end of 18.3.1.5 [numeric.special]:</p>
  <blockquote>
    <p>The specialization for bool shall be provided as follows:</p>
    <pre>    namespace std {
--- 7634,7640 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Append to the end of 18.3.2.7 [numeric.special]:</p>
  <blockquote>
    <p>The specialization for bool shall be provided as follows:</p>
    <pre>    namespace std {
*************** Josuttis provided the above wording.]</i
*** 8481,8501 ****
  
  
  <hr>
! <h3><a name="185"></a>185. Questionable use of term "inline"</h3>
! <p><b>Section:</b> 20.8 [function.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> UK Panel <b>Opened:</b> 1999-07-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 4 of 20.8 [function.objects] says:</p>
  <blockquote>
    <p>&nbsp;[Example: To negate every element of a: transform(a.begin(), a.end(),
    a.begin(), negate&lt;double&gt;()); The corresponding functions will inline
    the addition and the negation. end example]</p>
  </blockquote>
! <p>(Note: The "addition" referred to in the above is in para 3) we can
  find no other wording, except this (non-normative) example which suggests that
! any "inlining" will take place in this case.</p>
  <p>Indeed both:</p>
  <blockquote>
    <p>17.4.4.3 Global Functions [lib.global.functions] 1 It is
--- 7693,7713 ----
  
  
  <hr>
! <h3><a name="185"></a>185. Questionable use of term &quot;inline&quot;</h3>
! <p><b>Section:</b> 20.9 [function.objects] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> UK Panel <b>Opened:</b> 1999-07-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 4 of 20.9 [function.objects] says:</p>
  <blockquote>
    <p>&nbsp;[Example: To negate every element of a: transform(a.begin(), a.end(),
    a.begin(), negate&lt;double&gt;()); The corresponding functions will inline
    the addition and the negation. end example]</p>
  </blockquote>
! <p>(Note: The &quot;addition&quot; referred to in the above is in para 3) we can
  find no other wording, except this (non-normative) example which suggests that
! any &quot;inlining&quot; will take place in this case.</p>
  <p>Indeed both:</p>
  <blockquote>
    <p>17.4.4.3 Global Functions [lib.global.functions] 1 It is
*************** any "inlining" will take place in this c
*** 8509,8530 ****
    are defined as inline (7.1.2).</p>
  </blockquote>
  <p>take care to state that this may indeed NOT be the case.</p>
! <p>Thus the example "mandates" behavior that is explicitly
  not required elsewhere.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.8 [function.objects] paragraph 1, remove the sentence:</p>
  <blockquote>
  <p>They are important for the effective use of the library.</p>
  </blockquote>
! <p>Remove 20.8 [function.objects] paragraph 2, which reads:</p>
  <blockquote>
    <p> Using function objects together with function templates
    increases the expressive power of the library as well as making the
    resulting code much more efficient.</p>
  </blockquote>
! <p>In 20.8 [function.objects] paragraph 4, remove the sentence:</p>
  <blockquote>
    <p>The corresponding functions will inline the addition and the
    negation.</p>
--- 7721,7742 ----
    are defined as inline (7.1.2).</p>
  </blockquote>
  <p>take care to state that this may indeed NOT be the case.</p>
! <p>Thus the example &quot;mandates&quot; behavior that is explicitly
  not required elsewhere.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.9 [function.objects] paragraph 1, remove the sentence:</p>
  <blockquote>
  <p>They are important for the effective use of the library.</p>
  </blockquote>
! <p>Remove 20.9 [function.objects] paragraph 2, which reads:</p>
  <blockquote>
    <p> Using function objects together with function templates
    increases the expressive power of the library as well as making the
    resulting code much more efficient.</p>
  </blockquote>
! <p>In 20.9 [function.objects] paragraph 4, remove the sentence:</p>
  <blockquote>
    <p>The corresponding functions will inline the addition and the
    negation.</p>
*************** not required elsewhere.</p>
*** 8541,8552 ****
  
  <hr>
  <h3><a name="186"></a>186. bitset::set() second parameter should be bool</h3>
! <p><b>Section:</b> 20.5.2 [bitset.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Darin Adler <b>Opened:</b> 1999-08-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitset.members">issues</a> in [bitset.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In section 20.5.2 [bitset.members], paragraph 13 defines the
  bitset::set operation to take a second parameter of type int. The
  function tests whether this value is non-zero to determine whether to
  set the bit to true or false. The type of this second parameter should
--- 7753,7764 ----
  
  <hr>
  <h3><a name="186"></a>186. bitset::set() second parameter should be bool</h3>
! <p><b>Section:</b> 20.6.2 [bitset.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Darin Adler <b>Opened:</b> 1999-08-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitset.members">issues</a> in [bitset.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In section 20.6.2 [bitset.members], paragraph 13 defines the
  bitset::set operation to take a second parameter of type int. The
  function tests whether this value is non-zero to determine whether to
  set the bit to true or false. The type of this second parameter should
*************** translating 0 to false and any non-zero
*** 8558,8564 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.5 [template.bitset] Para 1 Replace:</p>
  <blockquote>
  <pre>bitset&lt;N&gt;&amp; set(size_t pos, int val = true ); </pre>
  </blockquote>
--- 7770,7776 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.6 [template.bitset] Para 1 Replace:</p>
  <blockquote>
  <pre>bitset&lt;N&gt;&amp; set(size_t pos, int val = true ); </pre>
  </blockquote>
*************** translating 0 to false and any non-zero
*** 8566,8572 ****
  <blockquote>
    <pre>bitset&lt;N&gt;&amp; set(size_t pos, bool val = true );</pre>
  </blockquote>
! <p>In 20.5.2 [bitset.members] Para 12(.5) Replace:</p>
  <blockquote>
    <pre>bitset&lt;N&gt;&amp; set(size_t pos, int val = 1 );</pre>
  </blockquote>
--- 7778,7784 ----
  <blockquote>
    <pre>bitset&lt;N&gt;&amp; set(size_t pos, bool val = true );</pre>
  </blockquote>
! <p>In 20.6.2 [bitset.members] Para 12(.5) Replace:</p>
  <blockquote>
    <pre>bitset&lt;N&gt;&amp; set(size_t pos, int val = 1 );</pre>
  </blockquote>
*************** nonvirtual member of a standard library
*** 8595,8611 ****
  
  <hr>
  <h3><a name="187"></a>187. iter_swap underspecified</h3>
! <p><b>Section:</b> 25.3.3 [alg.swap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-08-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.swap">issues</a> in [alg.swap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of iter_swap in 25.2.2 paragraph 7,says that it
  ``exchanges the values'' of the objects to which two iterators
! refer.<br> <br> What it doesn't say is whether it does so using swap
! or using the assignment operator and copy constructor.<br> <br> This
  question is an important one to answer, because swap is specialized to
! work efficiently for standard containers.<br> For example:</p>
  <blockquote>
  <pre>vector&lt;int&gt; v1, v2;
  iter_swap(&amp;v1, &amp;v2);</pre>
--- 7807,7823 ----
  
  <hr>
  <h3><a name="187"></a>187. iter_swap underspecified</h3>
! <p><b>Section:</b> 25.3.3 [alg.swap] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-08-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.swap">issues</a> in [alg.swap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of iter_swap in 25.2.2 paragraph 7,says that it
  ``exchanges the values'' of the objects to which two iterators
! refer.<br/> <br/> What it doesn't say is whether it does so using swap
! or using the assignment operator and copy constructor.<br/> <br/> This
  question is an important one to answer, because swap is specialized to
! work efficiently for standard containers.<br/> For example:</p>
  <blockquote>
  <pre>vector&lt;int&gt; v1, v2;
  iter_swap(&amp;v1, &amp;v2);</pre>
*************** one list to another.  That would surely
*** 8666,8713 ****
  
  <hr>
  <h3><a name="189"></a>189. setprecision() not specified correctly</h3>
! <p><b>Section:</b> 27.5.2.2 [fmtflags.state] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-08-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fmtflags.state">issues</a> in [fmtflags.state].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.4.2.2 paragraph 9 claims that setprecision() sets the precision,
  and includes a parenthetical note saying that it is the number of
! digits after the decimal point.<br>
! <br>
  This claim is not strictly correct.  For example, in the default
  floating-point output format, setprecision sets the number of
  significant digits printed, not the number of digits after the decimal
! point.<br>
! <br>
  I would like the committee to look at the definition carefully and
  correct the statement in 27.4.2.2</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove from 27.5.2.2 [fmtflags.state], paragraph 9, the text
! "(number of digits after the decimal point)".</p>
  
  
  
  
  <hr>
  <h3><a name="193"></a>193. Heap operations description incorrect</h3>
! <p><b>Section:</b> 25.4.6 [alg.heap.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Markus Mauhart <b>Opened:</b> 1999-09-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#216">216</a></p>
  <p><b>Discussion:</b></p>
  <p>25.3.6 [lib.alg.heap.operations] states two key properties of a heap [a,b), the first of them
! is<br>
! <br>
! &nbsp;&nbsp;&nbsp; `"(1) *a is the largest element"<br>
! <br>
  I think this is incorrect and should be changed to the wording in the proposed
  resolution.</p>
  <p>Actually there are two independent changes:</p>
  <blockquote>
!   <p>A-"part of largest equivalence class" instead of "largest", cause 25.3
    [lib.alg.sorting] asserts "strict weak ordering" for all its sub clauses.</p>
    <p>B-Take 'an oldest' from that equivalence class, otherwise the heap functions  could not be used for a
    priority queue as explained in 23.2.3.2.2 [lib.priqueue.members] (where I assume that a "priority queue" respects  priority AND time).</p>
--- 7878,7926 ----
  
  <hr>
  <h3><a name="189"></a>189. setprecision() not specified correctly</h3>
! <p><b>Section:</b> 27.5.3.2 [fmtflags.state] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 1999-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fmtflags.state">issues</a> in [fmtflags.state].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.4.2.2 paragraph 9 claims that setprecision() sets the precision,
  and includes a parenthetical note saying that it is the number of
! digits after the decimal point.<br/>
! <br/>
  This claim is not strictly correct.  For example, in the default
  floating-point output format, setprecision sets the number of
  significant digits printed, not the number of digits after the decimal
! point.<br/>
! <br/>
  I would like the committee to look at the definition carefully and
  correct the statement in 27.4.2.2</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove from 27.5.3.2 [fmtflags.state], paragraph 9, the text
! &quot;(number of digits after the decimal point)&quot;.</p>
  
  
  
  
  <hr>
  <h3><a name="193"></a>193. Heap operations description incorrect</h3>
! <p><b>Section:</b> 25.4.6 [alg.heap.operations] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Markus Mauhart <b>Opened:</b> 1999-09-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.heap.operations">issues</a> in [alg.heap.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#216">216</a></p>
  <p><b>Discussion:</b></p>
  <p>25.3.6 [lib.alg.heap.operations] states two key properties of a heap [a,b), the first of them
! is<br/>
! <br/>
! &nbsp;&nbsp;&nbsp; `"(1) *a is the largest element"<br/>
! <br/>
  I think this is incorrect and should be changed to the wording in the proposed
  resolution.</p>
  <p>Actually there are two independent changes:</p>
  <blockquote>
!   <p>A-&quot;part of largest equivalence class" instead of "largest", cause 25.3
    [lib.alg.sorting] asserts "strict weak ordering" for all its sub clauses.</p>
    <p>B-Take 'an oldest' from that equivalence class, otherwise the heap functions  could not be used for a
    priority queue as explained in 23.2.3.2.2 [lib.priqueue.members] (where I assume that a "priority queue" respects  priority AND time).</p>
*************** resolution.</p>
*** 8730,8739 ****
  
  <hr>
  <h3><a name="195"></a>195. Should <tt>basic_istream::sentry</tt>'s constructor ever set eofbit?</h3>
! <p><b>Section:</b> 27.7.1.1.3 [istream::sentry] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1999-10-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Suppose that <tt>is.flags() &amp; ios_base::skipws</tt> is nonzero.
  What should <tt>basic_istream&lt;&gt;::sentry</tt>'s constructor do if it
--- 7943,7952 ----
  
  <hr>
  <h3><a name="195"></a>195. Should <tt>basic_istream::sentry</tt>'s constructor ever set eofbit?</h3>
! <p><b>Section:</b> 27.7.2.1.3 [istream::sentry] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1999-10-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Suppose that <tt>is.flags() &amp; ios_base::skipws</tt> is nonzero.
  What should <tt>basic_istream&lt;&gt;::sentry</tt>'s constructor do if it
*************** reaches eof while skipping whitespace?
*** 8741,8753 ****
  should set failbit. Should it set eofbit as well?  The standard
  doesn't seem to answer that question.</p>
  
! <p>On the one hand, nothing in 27.7.1.1.3 [istream::sentry] says that
  <tt>basic_istream&lt;&gt;::sentry</tt> should ever set eofbit.  On the
! other hand, 27.7.1.1 [istream] paragraph 4 says that if
! extraction from a <tt>streambuf</tt> "returns
  <tt>traits::eof()</tt>, then the input function, except as explicitly
  noted otherwise, completes its actions and does
! <tt>setstate(eofbit)"</tt>.  So the question comes down to
  whether <tt>basic_istream&lt;&gt;::sentry</tt>'s constructor is an
  input function.</p>
  
--- 7954,7966 ----
  should set failbit. Should it set eofbit as well?  The standard
  doesn't seem to answer that question.</p>
  
! <p>On the one hand, nothing in 27.7.2.1.3 [istream::sentry] says that
  <tt>basic_istream&lt;&gt;::sentry</tt> should ever set eofbit.  On the
! other hand, 27.7.2.1 [istream] paragraph 4 says that if
! extraction from a <tt>streambuf</tt> &quot;returns
  <tt>traits::eof()</tt>, then the input function, except as explicitly
  noted otherwise, completes its actions and does
! <tt>setstate(eofbit)&quot;</tt>.  So the question comes down to
  whether <tt>basic_istream&lt;&gt;::sentry</tt>'s constructor is an
  input function.</p>
  
*************** signaled eof.</p>
*** 8763,8774 ****
  <p>
  The classic case is a streambuf reading from a UNIX file.  EOF isn't
  really a state for UNIX file descriptors.  The convention is that a
! read on UNIX returns 0 bytes to indicate "EOF", but the file
  descriptor isn't shut down in any way and future reads do not
  necessarily also return 0 bytes.  In particular, you can read from
! tty's on UNIX even after they have signaled "EOF".  (It
  isn't always understood that a ^D on UNIX is not an EOF indicator, but
! an EOL indicator.  By typing a "line" consisting solely of
  ^D you cause a read to return 0 bytes, and by convention this is
  interpreted as end of file.)</p>
  </blockquote>
--- 7976,7987 ----
  <p>
  The classic case is a streambuf reading from a UNIX file.  EOF isn't
  really a state for UNIX file descriptors.  The convention is that a
! read on UNIX returns 0 bytes to indicate &quot;EOF&quot;, but the file
  descriptor isn't shut down in any way and future reads do not
  necessarily also return 0 bytes.  In particular, you can read from
! tty's on UNIX even after they have signaled &quot;EOF&quot;.  (It
  isn't always understood that a ^D on UNIX is not an EOF indicator, but
! an EOL indicator.  By typing a &quot;line&quot; consisting solely of
  ^D you cause a read to return 0 bytes, and by convention this is
  interpreted as end of file.)</p>
  </blockquote>
*************** returns <tt>traits::eof()</tt>, the func
*** 8789,8798 ****
  
  <hr>
  <h3><a name="198"></a>198. Validity of pointers and references unspecified after iterator destruction</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 1999-11-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Is a pointer or reference obtained from an iterator still valid after
--- 8002,8011 ----
  
  <hr>
  <h3><a name="198"></a>198. Validity of pointers and references unspecified after iterator destruction</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 1999-11-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Is a pointer or reference obtained from an iterator still valid after
*************** Is a pointer or reference obtained from
*** 8803,8809 ****
  of the iterator changes?
  </p>
  <blockquote>
! <pre>#include &lt;iostream&gt;
  #include &lt;vector&gt;
  #include &lt;iterator&gt;
  
--- 8016,8023 ----
  of the iterator changes?
  </p>
  <blockquote>
! <pre>
! #include &lt;iostream&gt;
  #include &lt;vector&gt;
  #include &lt;iterator&gt;
  
*************** previously obtained from that iterator.
*** 8870,8878 ****
  
  <blockquote>
  <p><b>Effects:</b></p>
! <pre>  this-&gt;tmp = current;
!   --this-&gt;tmp;
!   return *this-&gt;tmp;
  </pre>
  
  <p>
--- 8084,8093 ----
  
  <blockquote>
  <p><b>Effects:</b></p>
! <pre>
!   this->tmp = current;
!   --this->tmp;
!   return *this->tmp;
  </pre>
  
  <p>
*************** reformulated yet again to reflect this r
*** 8897,8903 ****
  assumes its underlying iterator has persistent pointers and
  references.  Andy Koenig pointed out that it is possible to rewrite
  reverse_iterator so that it no longer makes such an assupmption.
! However, this issue is related to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>.  If we
  decide it is intentional that <tt>p[n]</tt> may return by value
  instead of reference when <tt>p</tt> is a Random Access Iterator,
  other changes in reverse_iterator will be necessary.]</i></p>
--- 8112,8118 ----
  assumes its underlying iterator has persistent pointers and
  references.  Andy Koenig pointed out that it is possible to rewrite
  reverse_iterator so that it no longer makes such an assupmption.
! However, this issue is related to issue <a href="lwg-closed.html#299">299</a>.  If we
  decide it is intentional that <tt>p[n]</tt> may return by value
  instead of reference when <tt>p</tt> is a Random Access Iterator,
  other changes in reverse_iterator will be necessary.]</i></p>
*************** predefined iterators are as strong as us
*** 8929,8938 ****
  
  <hr>
  <h3><a name="199"></a>199. What does <tt>allocate(0)</tt> return?</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1999-11-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Suppose that <tt>A</tt> is a class that conforms to the
--- 8144,8154 ----
  
  <hr>
  <h3><a name="199"></a>199. What does <tt>allocate(0)</tt> return?</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1999-11-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Suppose that <tt>A</tt> is a class that conforms to the
*************** unique non-null pointer.
*** 8948,8954 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  Add a note to the <tt>allocate</tt> row of Table 32:
! "[<i>Note:</i> If <tt>n == 0</tt>, the return value is unspecified. <i>--end note</i>]"</p>
  
  
  <p><b>Rationale:</b></p>
--- 8164,8170 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  Add a note to the <tt>allocate</tt> row of Table 32:
! &quot;[<i>Note:</i> If <tt>n == 0</tt>, the return value is unspecified. <i>--end note</i>]&quot;</p>
  
  
  <p><b>Rationale:</b></p>
*************** would be over-specification to mandate t
*** 8964,8973 ****
  
  <hr>
  <h3><a name="200"></a>200. Forward iterator requirements don't allow constant iterators</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1999-11-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In table 74, the return type of the expression <tt>*a</tt> is given
--- 8180,8189 ----
  
  <hr>
  <h3><a name="200"></a>200. Forward iterator requirements don't allow constant iterators</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 1999-11-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In table 74, the return type of the expression <tt>*a</tt> is given
*************** otherwise <tt>const U&amp;</tt>".
*** 8992,8998 ****
  <p><i>[Tokyo: The LWG believes this is the tip of a larger iceberg;
  there are multiple const problems with the STL portion of the library
  and that these should be addressed as a single package.&nbsp; Note
! that issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#180">180</a> has already been declared NAD Future for
  that very reason.]</i></p>
  
  
--- 8208,8214 ----
  <p><i>[Tokyo: The LWG believes this is the tip of a larger iceberg;
  there are multiple const problems with the STL portion of the library
  and that these should be addressed as a single package.&nbsp; Note
! that issue <a href="lwg-defects.html#180">180</a> has already been declared NAD Future for
  that very reason.]</i></p>
  
  
*************** that we also need to worry about *r++ an
*** 9010,9019 ****
  
  <hr>
  <h3><a name="201"></a>201. Numeric limits terminology wrong</h3>
! <p><b>Section:</b> 18.3.1 [limits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephen Cleary <b>Opened:</b> 1999-12-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#limits">issues</a> in [limits].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In some places in this section, the terms "fundamental types" and
--- 8226,8235 ----
  
  <hr>
  <h3><a name="201"></a>201. Numeric limits terminology wrong</h3>
! <p><b>Section:</b> 18.3.2 [limits] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephen Cleary <b>Opened:</b> 1999-12-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#limits">issues</a> in [limits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In some places in this section, the terms "fundamental types" and
*************** characteristics of implementation-depend
*** 9045,9051 ****
  </blockquote>
  
  <p>
! Change 18.3.1 [limits] to:
  </p>
  
  <blockquote>
--- 8261,8267 ----
  </blockquote>
  
  <p>
! Change 18.3.2 [limits] to:
  </p>
  
  <blockquote>
*************** as <tt>complex&lt;T&gt;</tt> (26.3.2), s
*** 9068,9074 ****
  </blockquote>
  
  <p>
! Change 18.3.1.1 [numeric.limits] to:
  </p>
  
  <blockquote>
--- 8284,8290 ----
  </blockquote>
  
  <p>
! Change 18.3.2.3 [numeric.limits] to:
  </p>
  
  <blockquote>
*************** which do not.</del>
*** 9086,9095 ****
  
  <hr>
  <h3><a name="202"></a>202. unique() effects unclear when predicate not an equivalence relation</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2000-01-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  What should unique() do if you give it a predicate that is not an
--- 8302,8311 ----
  
  <hr>
  <h3><a name="202"></a>202. unique() effects unclear when predicate not an equivalence relation</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2000-01-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  What should unique() do if you give it a predicate that is not an
*************** sequence into subsequences whose element
*** 9151,9158 ****
  order, and keep only the first element of each subsequence".  So the
  result would be 1, 1, 2.  If we take the description at its word, it
  would seem to call for strictly DEcreasing order, in which case the
! result should be 1, 3, 7, 2.<br>
! <br>
  In fact, the SGI implementation of unique() does neither: It yields 1,
  3, 7.
  </p>
--- 8367,8374 ----
  order, and keep only the first element of each subsequence".  So the
  result would be 1, 1, 2.  If we take the description at its word, it
  would seem to call for strictly DEcreasing order, in which case the
! result should be 1, 3, 7, 2.<br/>
! <br/>
  In fact, the SGI implementation of unique() does neither: It yields 1,
  3, 7.
  </p>
*************** iterator in the range.  Matt provided wo
*** 9184,9191 ****
  problem.]</i></p>
  
  
! <p><i>[Curaçao: The LWG changed "... the range (first,
! last)..." to "...  the range [first+1, last)..." for
  clarity. They considered this change close enough to editorial to not
  require another round of review.]</i></p>
  
--- 8400,8407 ----
  problem.]</i></p>
  
  
! <p><i>[Cura&ccedil;ao: The LWG changed &quot;... the range (first,
! last)...&quot; to &quot;...  the range [first+1, last)...&quot; for
  clarity. They considered this change close enough to editorial to not
  require another round of review.]</i></p>
  
*************** existing implementations.</p>
*** 9223,9232 ****
  
  <hr>
  <h3><a name="206"></a>206. operator new(size_t, nothrow) may become unlinked to ordinary operator new if ordinary version replaced</h3>
! <p><b>Section:</b> 18.6.1.1 [new.delete.single] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-08-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#new.delete.single">issues</a> in [new.delete.single].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>As specified, the implementation of the nothrow version of operator
  new does not necessarily call the ordinary operator new, but may
--- 8439,8448 ----
  
  <hr>
  <h3><a name="206"></a>206. operator new(size_t, nothrow) may become unlinked to ordinary operator new if ordinary version replaced</h3>
! <p><b>Section:</b> 18.6.1.1 [new.delete.single] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 1999-08-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete.single">issues</a> in [new.delete.single].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>As specified, the implementation of the nothrow version of operator
  new does not necessarily call the ordinary operator new, but may
*************** Change 18.5.1.1 [new.delete.single]:
*** 9272,9278 ****
  </p>
  
  <blockquote>
! <pre>void* operator new(std::size_t <i>size</i>, const std::nothrow_t&amp;) throw();
  </pre>
  <blockquote>
  <p>
--- 8488,8495 ----
  </p>
  
  <blockquote>
! <pre>
! void* operator new(std::size_t <i>size</i>, const std::nothrow_t&amp;) throw();
  </pre>
  <blockquote>
  <p>
*************** exception</tt>, the function returns a n
*** 9334,9340 ****
  <p>
  -9- [<i>Example:</i>
  </p>
! <blockquote><pre>T* p1 = new T;                 <i>// throws bad_alloc if it fails</i>
  T* p2 = new(nothrow) T;        <i>// returns 0 if it fails</i>
  </pre></blockquote>
  <p>
--- 8551,8558 ----
  <p>
  -9- [<i>Example:</i>
  </p>
! <blockquote><pre>
! T* p1 = new T;                 <i>// throws bad_alloc if it fails</i>
  T* p2 = new(nothrow) T;        <i>// returns 0 if it fails</i>
  </pre></blockquote>
  <p>
*************** T* p2 = new(nothrow) T;        <i>// ret
*** 9342,9348 ****
  </p>
  </blockquote>
  
! <pre>void operator delete(void* <i>ptr</i>) throw();
  <del>void operator delete(void* <i>ptr</i>, const std::nothrow_t&amp;) throw();</del>
  </pre>
  
--- 8560,8567 ----
  </p>
  </blockquote>
  
! <pre>
! void operator delete(void* <i>ptr</i>) throw();
  <del>void operator delete(void* <i>ptr</i>, const std::nothrow_t&amp;) throw();</del>
  </pre>
  
*************** declared in <tt>&lt;cstdlib&gt;</tt>.
*** 9385,9391 ****
  </p>
  </blockquote>
  
! <pre><ins>void operator delete(void* <i>ptr</i>, const std::nothrow_t&amp;) throw();</ins>
  </pre>
  
  <blockquote>
--- 8604,8611 ----
  </p>
  </blockquote>
  
! <pre>
! <ins>void operator delete(void* <i>ptr</i>, const std::nothrow_t&amp;) throw();</ins>
  </pre>
  
  <blockquote>
*************** Change 18.5.1.2 [new.delete.array]
*** 9416,9422 ****
  </p>
  
  <blockquote>
! <pre>void* operator new[](std::size_t <i>size</i>, const std::nothrow_t&amp;) throw();
  </pre>
  
  <blockquote>
--- 8636,8643 ----
  </p>
  
  <blockquote>
! <pre>
! void* operator new[](std::size_t <i>size</i>, const std::nothrow_t&amp;) throw();
  </pre>
  
  <blockquote>
*************** a null pointer.
*** 9463,9469 ****
  </ul>
  </blockquote>
  
! <pre>void operator delete[](void* <i>ptr</i>) throw(); 
  void operator delete[](void* <i>ptr</i>, const std::nothrow_t&amp;) throw();
  </pre>
  
--- 8684,8691 ----
  </ul>
  </blockquote>
  
! <pre>
! void operator delete[](void* <i>ptr</i>) throw(); 
  void operator delete[](void* <i>ptr</i>, const std::nothrow_t&amp;) throw();
  </pre>
  
*************** his customers.
*** 9520,9538 ****
  
  <hr>
  <h3><a name="208"></a>208. Unnecessary restriction on past-the-end iterators</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Stephen Cleary <b>Opened:</b> 2000-02-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 24.1 paragraph 5, it is stated ". . . Dereferenceable and
! past-the-end values are always non-singular."</p>
  <p>This places an unnecessary restriction on past-the-end iterators for
  containers with forward iterators (for example, a singly-linked list). If the
  past-the-end value on such a container was a well-known singular value, it would
  still satisfy all forward iterator requirements.</p>
  <p>Removing this restriction would allow, for example, a singly-linked list
! without a "footer" node.</p>
  <p>This would have an impact on existing code that expects past-the-end
  iterators obtained from different (generic) containers being not equal.</p>
  
--- 8742,8760 ----
  
  <hr>
  <h3><a name="208"></a>208. Unnecessary restriction on past-the-end iterators</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Stephen Cleary <b>Opened:</b> 2000-02-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>In 24.1 paragraph 5, it is stated &quot;. . . Dereferenceable and
! past-the-end values are always non-singular.&quot;</p>
  <p>This places an unnecessary restriction on past-the-end iterators for
  containers with forward iterators (for example, a singly-linked list). If the
  past-the-end value on such a container was a well-known singular value, it would
  still satisfy all forward iterator requirements.</p>
  <p>Removing this restriction would allow, for example, a singly-linked list
! without a &quot;footer&quot; node.</p>
  <p>This would have an impact on existing code that expects past-the-end
  iterators obtained from different (generic) containers being not equal.</p>
  
*************** iterators.  Null pointers are singular.
*** 9559,9568 ****
  
  <hr>
  <h3><a name="209"></a>209. basic_string declarations inconsistent</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Igor Stauder <b>Opened:</b> 2000-02-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 21.4 [basic.string] the basic_string member function
  declarations use a consistent style except for the following functions:</p>
--- 8781,8791 ----
  
  <hr>
  <h3><a name="209"></a>209. basic_string declarations inconsistent</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Igor Stauder <b>Opened:</b> 2000-02-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In Section 21.4 [basic.string] the basic_string member function
  declarations use a consistent style except for the following functions:</p>
*************** declarations use a consistent style exce
*** 9571,9579 ****
  basic_string&amp; assign(const basic_string&amp;);
  void swap(basic_string&lt;charT,traits,Allocator&gt;&amp;);</pre>
  </blockquote>
! <p>- push_back, assign, swap: missing argument name&nbsp;<br>
  - push_back: use of const with charT (i.e. POD type passed by value
! not by reference - should be charT or const charT&amp; )<br>
  - swap: redundant use of template parameters in argument
  basic_string&lt;charT,traits,Allocator&gt;&amp;</p>
  
--- 8794,8802 ----
  basic_string&amp; assign(const basic_string&amp;);
  void swap(basic_string&lt;charT,traits,Allocator&gt;&amp;);</pre>
  </blockquote>
! <p>- push_back, assign, swap: missing argument name&nbsp;<br/>
  - push_back: use of const with charT (i.e. POD type passed by value
! not by reference - should be charT or const charT&amp; )<br/>
  - swap: redundant use of template parameters in argument
  basic_string&lt;charT,traits,Allocator&gt;&amp;</p>
  
*************** change.
*** 9601,9625 ****
  
  <hr>
  <h3><a name="210"></a>210. distance first and last confused</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Lisa Lippincott <b>Opened:</b> 2000-02-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In paragraph 9 of section 25 [algorithms], it is written:</p>
  <blockquote>
    <p>      In the description of the algorithms operators + and - are used
             for some of the iterator categories for which they do not have to
             be defined. In these cases the semantics of [...] a-b is the same
!            as of<br>
!   <br>
    &nbsp;&nbsp;&nbsp;&nbsp; <tt>return distance(a, b);</tt></p>
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>On the last line of paragraph 9 of section 25 [algorithms] change
! <tt>"a-b"</tt> to <tt>"b-a".</tt></p>
  
  
  <p><b>Rationale:</b></p>
--- 8824,8849 ----
  
  <hr>
  <h3><a name="210"></a>210. distance first and last confused</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Lisa Lippincott <b>Opened:</b> 2000-02-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#algorithms">active issues</a> in [algorithms].</p>
! <p><b>View all other</b> <a href="lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In paragraph 9 of section 25 [algorithms], it is written:</p>
  <blockquote>
    <p>      In the description of the algorithms operators + and - are used
             for some of the iterator categories for which they do not have to
             be defined. In these cases the semantics of [...] a-b is the same
!            as of<br/>
!   <br/>
    &nbsp;&nbsp;&nbsp;&nbsp; <tt>return distance(a, b);</tt></p>
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>On the last line of paragraph 9 of section 25 [algorithms] change
! <tt>&quot;a-b&quot;</tt> to <tt>&quot;b-a&quot;.</tt></p>
  
  
  <p><b>Rationale:</b></p>
*************** former for consistency.</p>
*** 9632,9641 ****
  
  <hr>
  <h3><a name="211"></a>211. operator&gt;&gt;(istream&amp;, string&amp;) doesn't set failbit</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Scott Snyder <b>Opened:</b> 2000-02-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of the stream extraction operator for std::string (section
  21.3.7.9 [lib.string.io]) does not contain a requirement that failbit be set in
--- 8856,8865 ----
  
  <hr>
  <h3><a name="211"></a>211. operator&gt;&gt;(istream&amp;, string&amp;) doesn't set failbit</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Scott Snyder <b>Opened:</b> 2000-02-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The description of the stream extraction operator for std::string (section
  21.3.7.9 [lib.string.io]) does not contain a requirement that failbit be set in
*************** while (is &gt;&gt; str) ... ;</pre>
*** 9650,9656 ****
  </blockquote>
  <p>(which tests failbit) is not required to terminate at EOF.</p>
  <p>Furthermore, this is inconsistent with other extraction operators,
! which do include this requirement. (See sections 27.7.1.2 [istream.formatted] and 27.7.1.3 [istream.unformatted]), where this
  requirement is present, either explicitly or implicitly, for the
  extraction operators. It is also present explicitly in the description
  of getline (istream&amp;, string&amp;, charT) in section 21.4.8.9 [string.io] paragraph 8.)</p>
--- 8874,8880 ----
  </blockquote>
  <p>(which tests failbit) is not required to terminate at EOF.</p>
  <p>Furthermore, this is inconsistent with other extraction operators,
! which do include this requirement. (See sections 27.7.2.2 [istream.formatted] and 27.7.2.3 [istream.unformatted]), where this
  requirement is present, either explicitly or implicitly, for the
  extraction operators. It is also present explicitly in the description
  of getline (istream&amp;, string&amp;, charT) in section 21.4.8.9 [string.io] paragraph 8.)</p>
*************** is.setstate(ios::failbit) which may thro
*** 9670,9679 ****
  
  <hr>
  <h3><a name="212"></a>212. Empty range behavior unclear for several algorithms</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 2000-02-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard doesn't specify what min_element() and max_element() shall
  return if the range is empty (first equals last). The usual implementations
--- 8894,8903 ----
  
  <hr>
  <h3><a name="212"></a>212. Empty range behavior unclear for several algorithms</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Nico Josuttis <b>Opened:</b> 2000-02-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard doesn't specify what min_element() and max_element() shall
  return if the range is empty (first equals last). The usual implementations
*************** last.</p>
*** 9697,9711 ****
  
  <hr>
  <h3><a name="214"></a>214. set::find() missing const overload</h3>
! <p><b>Section:</b> 23.6.3 [set], 23.6.4 [multiset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-02-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#set">issues</a> in [set].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#450">450</a></p>
  <p><b>Discussion:</b></p>
  <p>The specification for the associative container requirements in
! Table 69 state that the find member function should "return
! iterator; const_iterator for constant a". The map and multimap
  container descriptions have two overloaded versions of find, but set
  and multiset do not, all they have is:</p>
  <blockquote>
--- 8921,8935 ----
  
  <hr>
  <h3><a name="214"></a>214. set::find() missing const overload</h3>
! <p><b>Section:</b> 23.4.6 [set], 23.4.7 [multiset] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-02-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#set">issues</a> in [set].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#450">450</a></p>
  <p><b>Discussion:</b></p>
  <p>The specification for the associative container requirements in
! Table 69 state that the find member function should &quot;return
! iterator; const_iterator for constant a&quot;. The map and multimap
  container descriptions have two overloaded versions of find, but set
  and multiset do not, all they have is:</p>
  <blockquote>
*************** and multiset do not, all they have is:</
*** 9715,9721 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Change the prototypes for find(), lower_bound(), upper_bound(), and
! equal_range() in section 23.6.3 [set] and section 23.6.4 [multiset] to each have two overloads:</p>
  <blockquote>
    <pre>iterator find(const key_type &amp; x);
  const_iterator find(const key_type &amp; x) const;</pre>
--- 8939,8945 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Change the prototypes for find(), lower_bound(), upper_bound(), and
! equal_range() in section 23.4.6 [set] and section 23.4.7 [multiset] to each have two overloads:</p>
  <blockquote>
    <pre>iterator find(const key_type &amp; x);
  const_iterator find(const key_type &amp; x) const;</pre>
*************** equal_range.]</i></p>
*** 9738,9747 ****
  
  <hr>
  <h3><a name="217"></a>217. Facets example (Classifying Japanese characters) contains errors</h3>
! <p><b>Section:</b> 22.4.8 [facets.examples] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-02-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facets.examples">issues</a> in [facets.examples].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The example in 22.2.8, paragraph 11 contains the following errors:</p>
  <p>1) The member function `My::JCtype::is_kanji()' is non-const; the function
--- 8962,8971 ----
  
  <hr>
  <h3><a name="217"></a>217. Facets example (Classifying Japanese characters) contains errors</h3>
! <p><b>Section:</b> 22.4.8 [facets.examples] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-02-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facets.examples">issues</a> in [facets.examples].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The example in 22.2.8, paragraph 11 contains the following errors:</p>
  <p>1) The member function `My::JCtype::is_kanji()' is non-const; the function
*************** rather than `My::JCType'.</p>
*** 9755,9761 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace the "Classifying Japanese characters" example in 22.2.8,
  paragraph 11 with the following:</p>
  <pre>#include &lt;locale&gt;</pre>
  <pre>namespace My {
--- 8979,8985 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace the &quot;Classifying Japanese characters&quot; example in 22.2.8,
  paragraph 11 with the following:</p>
  <pre>#include &lt;locale&gt;</pre>
  <pre>namespace My {
*************** paragraph 11 with the following:</p>
*** 9772,9789 ****
  <pre>//  file:  filt.C
  #include &lt;iostream&gt;
  #include &lt;locale&gt;
! #include "jctype"                 //  above
  std::locale::id My::JCtype::id;   //  the static  JCtype  member
  declared above.</pre>
  <pre>int main()
  {
      using namespace std;
      typedef ctype&lt;wchar_t&gt; wctype;
!     locale loc(locale(""),              //  the user's preferred locale...
                 new My::JCtype);         //  and a new feature ...
      wchar_t c = use_facet&lt;wctype&gt;(loc).widen('!');
      if (!use_facet&lt;My::JCtype&gt;(loc).is_kanji(c))
!         cout &lt;&lt; "no it isn't!" &lt;&lt; endl;
      return 0;
  }</pre>
  
--- 8996,9013 ----
  <pre>//  file:  filt.C
  #include &lt;iostream&gt;
  #include &lt;locale&gt;
! #include &quot;jctype&quot;                 //  above
  std::locale::id My::JCtype::id;   //  the static  JCtype  member
  declared above.</pre>
  <pre>int main()
  {
      using namespace std;
      typedef ctype&lt;wchar_t&gt; wctype;
!     locale loc(locale(&quot;&quot;),              //  the user's preferred locale...
                 new My::JCtype);         //  and a new feature ...
      wchar_t c = use_facet&lt;wctype&gt;(loc).widen('!');
      if (!use_facet&lt;My::JCtype&gt;(loc).is_kanji(c))
!         cout &lt;&lt; &quot;no it isn't!&quot; &lt;&lt; endl;
      return 0;
  }</pre>
  
*************** declared above.</pre>
*** 9792,9800 ****
  
  <hr>
  <h3><a name="220"></a>220. ~ios_base() usage valid?</h3>
! <p><b>Section:</b> 27.5.2.7 [ios.base.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Jonathan Schilling, Howard Hinnant <b>Opened:</b> 2000-03-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The pre-conditions for the ios_base destructor are described in 27.4.2.7
  paragraph 2:</p>
--- 9016,9024 ----
  
  <hr>
  <h3><a name="220"></a>220. ~ios_base() usage valid?</h3>
! <p><b>Section:</b> 27.5.3.7 [ios.base.cons] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Jonathan Schilling, Howard Hinnant <b>Opened:</b> 2000-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The pre-conditions for the ios_base destructor are described in 27.4.2.7
  paragraph 2:</p>
*************** behavior.</p>
*** 9843,9852 ****
  
  <hr>
  <h3><a name="221"></a>221. num_get&lt;&gt;::do_get stage 2 processing broken</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-03-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Stage 2 processing of numeric conversion is broken.</p>
  
--- 9067,9077 ----
  
  <hr>
  <h3><a name="221"></a>221. num_get&lt;&gt;::do_get stage 2 processing broken</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-03-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Stage 2 processing of numeric conversion is broken.</p>
  
*************** conversion specifier is %i. A %i specifi
*** 9855,9867 ****
  by its prefix (0 for octal, 0x for hex), so the intention is clearly
  that a 0x prefix is allowed.  Paragraph 8 in the same section,
  however, describes very precisely how characters are processed. (It
! must be done "as if" by a specified code fragment.) That
  description does not allow a 0x prefix to be recognized.</p>
  
  <p>Very roughly, stage 2 processing reads a char_type ct. It converts
  ct to a char, not by using narrow but by looking it up in a
  translation table that was created by widening the string literal
! "0123456789abcdefABCDEF+-". The character "x" is
  not found in that table, so it can't be recognized by stage 2
  processing.</p>
  
--- 9080,9092 ----
  by its prefix (0 for octal, 0x for hex), so the intention is clearly
  that a 0x prefix is allowed.  Paragraph 8 in the same section,
  however, describes very precisely how characters are processed. (It
! must be done &quot;as if&quot; by a specified code fragment.) That
  description does not allow a 0x prefix to be recognized.</p>
  
  <p>Very roughly, stage 2 processing reads a char_type ct. It converts
  ct to a char, not by using narrow but by looking it up in a
  translation table that was created by widening the string literal
! &quot;0123456789abcdefABCDEF+-&quot;. The character &quot;x&quot; is
  not found in that table, so it can't be recognized by stage 2
  processing.</p>
  
*************** processing.</p>
*** 9869,9879 ****
  <p><b>Proposed resolution:</b></p>
  <p>In 22.2.2.1.2 paragraph 8, replace the line:</p>
  <blockquote>
!   <pre>static const char src[] = "0123456789abcdefABCDEF+-";</pre>
  </blockquote>
  <p>with the line:</p>
  <blockquote>
!   <pre>static const char src[] = "0123456789abcdefxABCDEFX+-";</pre>
  </blockquote>
  
  
--- 9094,9104 ----
  <p><b>Proposed resolution:</b></p>
  <p>In 22.2.2.1.2 paragraph 8, replace the line:</p>
  <blockquote>
!   <pre>static const char src[] = &quot;0123456789abcdefABCDEF+-&quot;;</pre>
  </blockquote>
  <p>with the line:</p>
  <blockquote>
!   <pre>static const char src[] = &quot;0123456789abcdefxABCDEFX+-&quot;;</pre>
  </blockquote>
  
  
*************** deliberately, with full knowledge of tha
*** 9890,9899 ****
  
  <hr>
  <h3><a name="222"></a>222. Are throw clauses necessary if a throw is already implied by the effects clause?</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-03-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 21.3.6.8 describes the basic_string::compare function this way:</p>
  <blockquote>
--- 9115,9124 ----
  
  <hr>
  <h3><a name="222"></a>222. Are throw clauses necessary if a throw is already implied by the effects clause?</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-03-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Section 21.3.6.8 describes the basic_string::compare function this way:</p>
  <blockquote>
*************** defined to throw an out-of-range excepti
*** 9913,9934 ****
  section 21.4.1 [string.require] paragraph 4.</p>
  
  <p>On the other hand, the compare function descriptions themselves don't have
! "Throws: " clauses and according to 17.3.1.3, paragraph 3, elements
  that do not apply to a function are omitted.</p>
  <p>So it seems there is an inconsistency in the standard -- are the
! "Effects" clauses correct, or are the "Throws" clauses
  missing?</p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 17.5.1.4 [structure.specifications] paragraph 3, the footnote 148 attached to
! the sentence "Descriptions of function semantics contain the
! following elements (as appropriate):", insert the word
! "further" so that the foot note reads:</p>
  <blockquote>
    <p>To save space, items that do not apply to a function are
    omitted. For example, if a function does not specify any further
!   preconditions, there will be no "Requires" paragraph.</p>
  </blockquote>
  
  
--- 9138,9159 ----
  section 21.4.1 [string.require] paragraph 4.</p>
  
  <p>On the other hand, the compare function descriptions themselves don't have
! &quot;Throws: &quot; clauses and according to 17.3.1.3, paragraph 3, elements
  that do not apply to a function are omitted.</p>
  <p>So it seems there is an inconsistency in the standard -- are the
! &quot;Effects&quot; clauses correct, or are the &quot;Throws&quot; clauses
  missing?</p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 17.5.1.4 [structure.specifications] paragraph 3, the footnote 148 attached to
! the sentence &quot;Descriptions of function semantics contain the
! following elements (as appropriate):&quot;, insert the word
! &quot;further&quot; so that the foot note reads:</p>
  <blockquote>
    <p>To save space, items that do not apply to a function are
    omitted. For example, if a function does not specify any further
!   preconditions, there will be no &quot;Requires&quot; paragraph.</p>
  </blockquote>
  
  
*************** footnote.</p>
*** 9944,9952 ****
  
  <hr>
  <h3><a name="223"></a>223. reverse algorithm should use iter_swap rather than swap</h3>
! <p><b>Section:</b> 25.3.10 [alg.reverse] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-03-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Shouldn't the effects say "applies iter_swap to all pairs..."?</p>
  
--- 9169,9178 ----
  
  <hr>
  <h3><a name="223"></a>223. reverse algorithm should use iter_swap rather than swap</h3>
! <p><b>Section:</b> 25.3.10 [alg.reverse] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-03-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.reverse">issues</a> in [alg.reverse].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Shouldn't the effects say "applies iter_swap to all pairs..."?</p>
  
*************** footnote.</p>
*** 9968,9992 ****
  
  <hr>
  <h3><a name="224"></a>224. clear() complexity for associative containers refers to undefined N</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Ed Brey <b>Opened:</b> 2000-03-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In the associative container requirements table in 23.1.2 paragraph 7,
! a.clear() has complexity "log(size()) + N". However, the meaning of N
  is not defined.</p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In the associative container requirements table in 23.1.2 paragraph
! 7, the complexity of a.clear(), change "log(size()) + N" to
! "linear in <tt>size()</tt>".</p>
  
  
  <p><b>Rationale:</b></p>
! <p>It's the "log(size())", not the "N", that is in
  error: there's no difference between <i>O(N)</i> and <i>O(N +
  log(N))</i>.  The text in the standard is probably an incorrect
  cut-and-paste from the range version of <tt>erase</tt>.</p>
--- 9194,9218 ----
  
  <hr>
  <h3><a name="224"></a>224. clear() complexity for associative containers refers to undefined N</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Ed Brey <b>Opened:</b> 2000-03-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In the associative container requirements table in 23.1.2 paragraph 7,
! a.clear() has complexity &quot;log(size()) + N&quot;. However, the meaning of N
  is not defined.</p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In the associative container requirements table in 23.1.2 paragraph
! 7, the complexity of a.clear(), change &quot;log(size()) + N&quot; to
! &quot;linear in <tt>size()</tt>&quot;.</p>
  
  
  <p><b>Rationale:</b></p>
! <p>It's the &quot;log(size())&quot;, not the &quot;N&quot;, that is in
  error: there's no difference between <i>O(N)</i> and <i>O(N +
  log(N))</i>.  The text in the standard is probably an incorrect
  cut-and-paste from the range version of <tt>erase</tt>.</p>
*************** cut-and-paste from the range version of
*** 9996,10005 ****
  
  <hr>
  <h3><a name="225"></a>225. std:: algorithms use of other unqualified algorithms</h3>
! <p><b>Section:</b> 17.6.4.4 [global.functions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-04-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#global.functions">issues</a> in [global.functions].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Are algorithms in std:: allowed to use other algorithms without qualification, so functions in
  user namespaces might be found through Koenig lookup?</p>
--- 9222,9231 ----
  
  <hr>
  <h3><a name="225"></a>225. std:: algorithms use of other unqualified algorithms</h3>
! <p><b>Section:</b> 17.6.5.4 [global.functions] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-04-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#global.functions">issues</a> in [global.functions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Are algorithms in std:: allowed to use other algorithms without qualification, so functions in
  user namespaces might be found through Koenig lookup?</p>
*************** implementation of std::unique:</p>
*** 10016,10023 ****
  </blockquote>
  <p>Imagine two users on opposite sides of town, each using unique on his own
  sequences bounded by my_iterators . User1 looks at his standard library
! implementation and says, "I know how to implement a more efficient
! unique_copy for my_iterators", and writes:</p>
  <blockquote>
  <pre>namespace user1 {
      class my_iterator;
--- 9242,9249 ----
  </blockquote>
  <p>Imagine two users on opposite sides of town, each using unique on his own
  sequences bounded by my_iterators . User1 looks at his standard library
! implementation and says, &quot;I know how to implement a more efficient
! unique_copy for my_iterators&quot;, and writes:</p>
  <blockquote>
  <pre>namespace user1 {
      class my_iterator;
*************** implementation of unique() shown is non-
*** 10056,10069 ****
  rather than ::std::unique_copy(). Most standard library implementations,
  however, seem to disagree with this notion.</p>
  <p> <i>[Tokyo:&nbsp; Steve Adamczyk from
! the core working group indicates that "std::" is sufficient;&nbsp;
! leading "::" qualification is not required because any namespace
  qualification is sufficient to suppress Koenig lookup.]</i></p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Add a paragraph and a note at the end of 
! 17.6.4.4 [global.functions]:</p>
  <blockquote>
  
  <p>Unless otherwise specified, no global or non-member function in the
--- 9282,9295 ----
  rather than ::std::unique_copy(). Most standard library implementations,
  however, seem to disagree with this notion.</p>
  <p> <i>[Tokyo:&nbsp; Steve Adamczyk from
! the core working group indicates that &quot;std::&quot; is sufficient;&nbsp;
! leading &quot;::&quot; qualification is not required because any namespace
  qualification is sufficient to suppress Koenig lookup.]</i></p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Add a paragraph and a note at the end of 
! 17.6.5.4 [global.functions]:</p>
  <blockquote>
  
  <p>Unless otherwise specified, no global or non-member function in the
*************** standard library shall use a function fr
*** 10071,10083 ****
  found through <i>argument-dependent name lookup</i> (3.4.2 [basic.lookup.argdep]).</p>
  
  <p>[Note: the phrase "unless otherwise specified" is intended to
! allow Koenig lookup in cases like that of ostream_iterators:<br>
  
! <br>
    Effects:</p>
    <blockquote>
! <p>*out_stream &lt;&lt; value;<br>
!       if(delim != 0) *out_stream &lt;&lt; delim;<br>
        return (*this);</p>
      <p>--end note]</p>
    </blockquote>
--- 9297,9309 ----
  found through <i>argument-dependent name lookup</i> (3.4.2 [basic.lookup.argdep]).</p>
  
  <p>[Note: the phrase "unless otherwise specified" is intended to
! allow Koenig lookup in cases like that of ostream_iterators:<br/>
  
! <br/>
    Effects:</p>
    <blockquote>
! <p>*out_stream &lt;&lt; value;<br/>
!       if(delim != 0) *out_stream &lt;&lt; delim;<br/>
        return (*this);</p>
      <p>--end note]</p>
    </blockquote>
*************** allow Koenig lookup in cases like that o
*** 10087,10095 ****
  is as yet unsure if the proposed resolution is the best
  solution. Furthermore, the LWG believes that the same problem of
  unqualified library names applies to wording in the standard itself,
! and has opened issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#229">229</a> accordingly. Any resolution of
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a> should be coordinated with the resolution of
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#229">229</a>.]</i></p>
  
  
  <p><i>[Toronto: The LWG is not sure if this is a defect in the
--- 9313,9321 ----
  is as yet unsure if the proposed resolution is the best
  solution. Furthermore, the LWG believes that the same problem of
  unqualified library names applies to wording in the standard itself,
! and has opened issue <a href="lwg-defects.html#229">229</a> accordingly. Any resolution of
! issue <a href="lwg-defects.html#225">225</a> should be coordinated with the resolution of
! issue <a href="lwg-defects.html#229">229</a>.]</i></p>
  
  
  <p><i>[Toronto: The LWG is not sure if this is a defect in the
*************** those specified in the standard.  The st
*** 10101,10107 ****
  should have any effect.]</i></p>
  
  
! <p><i>[Curaçao: An LWG-subgroup spent an afternoon working on issues
  225, 226, and 229.  Their conclusion was that the issues should be
  separated into an LWG portion (Howard's paper, N1387=02-0045), and a
  EWG portion (Dave will write a proposal). The LWG and EWG had
--- 9327,9333 ----
  should have any effect.]</i></p>
  
  
! <p><i>[Cura&ccedil;ao: An LWG-subgroup spent an afternoon working on issues
  225, 226, and 229.  Their conclusion was that the issues should be
  separated into an LWG portion (Howard's paper, N1387=02-0045), and a
  EWG portion (Dave will write a proposal). The LWG and EWG had
*************** resolution for this issue is in accordan
*** 10119,10125 ****
    other namespace.  However, this is at worst a clarification.  It is
    surely right that algorithsm shouldn't pick up random names, that
    user-defined names should have no effect unless otherwise specified.
!   Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#226">226</a> deals with the question of when it is
    appropriate for the standard to explicitly specify otherwise.</p>
  
  
--- 9345,9351 ----
    other namespace.  However, this is at worst a clarification.  It is
    surely right that algorithsm shouldn't pick up random names, that
    user-defined names should have no effect unless otherwise specified.
!   Issue <a href="lwg-defects.html#226">226</a> deals with the question of when it is
    appropriate for the standard to explicitly specify otherwise.</p>
  
  
*************** resolution for this issue is in accordan
*** 10128,10137 ****
  
  <hr>
  <h3><a name="226"></a>226. User supplied specializations or overloads of namespace std function templates</h3>
! <p><b>Section:</b> 17.6.3.3 [reserved.names] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-04-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#reserved.names">issues</a> in [reserved.names].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The issues are:&nbsp;</p>
  <p>1. How can a 3rd party library implementor (lib1) write a version of a standard
--- 9354,9363 ----
  
  <hr>
  <h3><a name="226"></a>226. User supplied specializations or overloads of namespace std function templates</h3>
! <p><b>Section:</b> 17.6.4.3 [reserved.names] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-04-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reserved.names">issues</a> in [reserved.names].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The issues are:&nbsp;</p>
  <p>1. How can a 3rd party library implementor (lib1) write a version of a standard
*************** namespace lib2
*** 10170,10181 ****
  and somewhat slippery. The implementor needs to remember to write the
  using-declaration, or generic_sort will fail to compile when T is a built-in
  type. The second drawback is that the use of this style in lib2 effectively
! "reserves" names in any namespace which defines types which may
  eventually be used with lib2. This may seem innocuous at first when applied to
  names like swap, but consider more ambiguous names like unique_copy() instead.
  It is easy to imagine the user wanting to define these names differently in his
  own namespace. A definition with semantics incompatible with the standard
! library could cause serious problems (see issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a>).</p>
  <p>Why, you may ask, can't we just partially specialize std::swap()? It's
  because the language doesn't allow for partial specialization of function
  templates. If you write:</p>
--- 9396,9407 ----
  and somewhat slippery. The implementor needs to remember to write the
  using-declaration, or generic_sort will fail to compile when T is a built-in
  type. The second drawback is that the use of this style in lib2 effectively
! &quot;reserves&quot; names in any namespace which defines types which may
  eventually be used with lib2. This may seem innocuous at first when applied to
  names like swap, but consider more ambiguous names like unique_copy() instead.
  It is easy to imagine the user wanting to define these names differently in his
  own namespace. A definition with semantics incompatible with the standard
! library could cause serious problems (see issue <a href="lwg-defects.html#225">225</a>).</p>
  <p>Why, you may ask, can't we just partially specialize std::swap()? It's
  because the language doesn't allow for partial specialization of function
  templates. If you write:</p>
*************** language rules. On the other hand, the f
*** 10196,10203 ****
  }</pre>
  </blockquote>
  
! <p>This issue reflects concerns raised by the "Namespace issue
! with specialized swap" thread on comp.lang.c++.moderated. A
  similar set of concerns was earlier raised on the boost.org mailing
  list and the ACCU-general mailing list.  Also see library reflector
  message c++std-lib-7354.</p>
--- 9422,9429 ----
  }</pre>
  </blockquote>
  
! <p>This issue reflects concerns raised by the &quot;Namespace issue
! with specialized swap&quot; thread on comp.lang.c++.moderated. A
  similar set of concerns was earlier raised on the boost.org mailing
  list and the ACCU-general mailing list.  Also see library reflector
  message c++std-lib-7354.</p>
*************** not provide an operator&lt;&lt; for std:
*** 10223,10230 ****
    N1523=03-0106, "Proposed Resolution To LWG issues 225, 226, 229".</p>
  
  
! <p><i>[Tokyo: Summary, "There is no conforming way to extend
! std::swap for user defined templates."&nbsp; The LWG agrees that
  there is a problem.  Would like more information before
  proceeding. This may be a core issue.  Core issue 229 has been opened
  to discuss the core aspects of this problem. It was also noted that
--- 9449,9456 ----
    N1523=03-0106, "Proposed Resolution To LWG issues 225, 226, 229".</p>
  
  
! <p><i>[Tokyo: Summary, &quot;There is no conforming way to extend
! std::swap for user defined templates.&quot;&nbsp; The LWG agrees that
  there is a problem.  Would like more information before
  proceeding. This may be a core issue.  Core issue 229 has been opened
  to discuss the core aspects of this problem. It was also noted that
*************** sources, but too late to be integrated i
*** 10234,10241 ****
  
  
  <p><i>[Post-Tokyo: A paper with several proposed resolutions,
! J16/00-0029==WG21/N1252, "Shades of namespace std functions
! " by Alan Griffiths, is in the Post-Tokyo mailing. It
  should be considered a part of this issue.]</i></p>
  
  
--- 9460,9467 ----
  
  
  <p><i>[Post-Tokyo: A paper with several proposed resolutions,
! J16/00-0029==WG21/N1252, &quot;Shades of namespace std functions
! &quot; by Alan Griffiths, is in the Post-Tokyo mailing. It
  should be considered a part of this issue.]</i></p>
  
  
*************** A small group (Nathan, Howard, Jeremy, D
*** 10283,10289 ****
  try to put together a proposal before the next meeting.]</i></p>
  
  
! <p><i>[Curaçao: An LWG-subgroup spent an afternoon working on issues
  225, 226, and 229.  Their conclusion was that the issues should be
  separated into an LWG portion (Howard's paper, N1387=02-0045), and a
  EWG portion (Dave will write a proposal). The LWG and EWG had
--- 9509,9515 ----
  try to put together a proposal before the next meeting.]</i></p>
  
  
! <p><i>[Cura&ccedil;ao: An LWG-subgroup spent an afternoon working on issues
  225, 226, and 229.  Their conclusion was that the issues should be
  separated into an LWG portion (Howard's paper, N1387=02-0045), and a
  EWG portion (Dave will write a proposal). The LWG and EWG had
*************** resolution is the one proposed by Howard
*** 10319,10334 ****
  
  <hr>
  <h3><a name="227"></a>227. std::swap() should require CopyConstructible or DefaultConstructible arguments</h3>
! <p><b>Section:</b> 25.3.3 [alg.swap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-04-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.swap">issues</a> in [alg.swap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>25.2.2 reads:</p>
  <blockquote>
!   <p><tt>  template&lt;class T&gt; void swap(T&amp; a, T&amp; b);</tt><br>
!   <br>
!   Requires:    Type T is Assignable (_lib.container.requirements_).<br>
    Effects:    Exchanges values stored in two locations.</p>
  </blockquote>
  <p>The only reasonable** generic implementation of swap requires construction of a 
--- 9545,9560 ----
  
  <hr>
  <h3><a name="227"></a>227. std::swap() should require CopyConstructible or DefaultConstructible arguments</h3>
! <p><b>Section:</b> 25.3.3 [alg.swap] <b>Status:</b> <a href="lwg-active.html#TC1">TC1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-04-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.swap">issues</a> in [alg.swap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TC1">TC1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>25.2.2 reads:</p>
  <blockquote>
!   <p><tt>  template&lt;class T&gt; void swap(T&amp; a, T&amp; b);</tt><br/>
!   <br/>
!   Requires:    Type T is Assignable (_lib.container.requirements_).<br/>
    Effects:    Exchanges values stored in two locations.</p>
  </blockquote>
  <p>The only reasonable** generic implementation of swap requires construction of a 
*************** resolution is the one proposed by Howard
*** 10371,10390 ****
  
  
  <hr>
! <h3><a name="228"></a>228. Incorrect specification of "..._byname" facets</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 2000-04-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The sections 22.4.1.2 [locale.ctype.byname], 22.4.1.5 [locale.codecvt.byname],
  sref ref="22.2.1.6", 22.4.3.2 [locale.numpunct.byname], 22.4.4.2 [locale.collate.byname], 22.4.5.4 [locale.time.put.byname], 22.4.6.4 [locale.moneypunct.byname], and 22.4.7.2 [locale.messages.byname] overspecify the
! definitions of the "..._byname" classes by listing a bunch
  of virtual functions. At the same time, no semantics of these
  functions are defined. Real implementations do not define these
  functions because the functional part of the facets is actually
  implemented in the corresponding base classes and the constructor of
! the "..._byname" version just provides suitable date used by
  these implementations. For example, the 'numpunct' methods just return
  values from a struct. The base class uses a statically initialized
  struct while the derived version reads the contents of this struct
--- 9597,9616 ----
  
  
  <hr>
! <h3><a name="228"></a>228. Incorrect specification of &quot;..._byname&quot; facets</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 2000-04-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The sections 22.4.1.2 [locale.ctype.byname], 22.4.1.5 [locale.codecvt.byname],
  sref ref="22.2.1.6", 22.4.3.2 [locale.numpunct.byname], 22.4.4.2 [locale.collate.byname], 22.4.5.4 [locale.time.put.byname], 22.4.6.4 [locale.moneypunct.byname], and 22.4.7.2 [locale.messages.byname] overspecify the
! definitions of the &quot;..._byname&quot; classes by listing a bunch
  of virtual functions. At the same time, no semantics of these
  functions are defined. Real implementations do not define these
  functions because the functional part of the facets is actually
  implemented in the corresponding base classes and the constructor of
! the &quot;..._byname&quot; version just provides suitable date used by
  these implementations. For example, the 'numpunct' methods just return
  values from a struct. The base class uses a statically initialized
  struct while the derived version reads the contents of this struct
*************** specialization it is not virtual.</p>
*** 10474,10480 ****
         protected:
          ~time_put_byname();          //  virtual
         };
!      }"</pre>
  <p>&nbsp; Change section 22.2.6.4 (lib.locale.moneypunct.byname) to become:</p>
  <pre>     namespace std {
         template &lt;class charT, bool Intl = false&gt;
--- 9700,9706 ----
         protected:
          ~time_put_byname();          //  virtual
         };
!      }&quot;</pre>
  <p>&nbsp; Change section 22.2.6.4 (lib.locale.moneypunct.byname) to become:</p>
  <pre>     namespace std {
         template &lt;class charT, bool Intl = false&gt;
*************** specialization it is not virtual.</p>
*** 10503,10510 ****
  this case only those members are defined to be virtual which are
  defined to be virtual in 'ctype&lt;cT&gt;'.)</p>
  
! <p><i>[Post-Tokyo: Dietmar Kühl submitted this issue at the request of
! the LWG to solve the underlying problems raised by issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#138">138</a>.]</i></p>
  
  
  <p><i>[Copenhagen: proposed resolution was revised slightly, to remove
--- 9729,9736 ----
  this case only those members are defined to be virtual which are
  defined to be virtual in 'ctype&lt;cT&gt;'.)</p>
  
! <p><i>[Post-Tokyo: Dietmar K&uuml;hl submitted this issue at the request of
! the LWG to solve the underlying problems raised by issue <a href="lwg-closed.html#138">138</a>.]</i></p>
  
  
  <p><i>[Copenhagen: proposed resolution was revised slightly, to remove
*************** three last virtual functions from <tt>me
*** 10518,10548 ****
  
  <hr>
  <h3><a name="229"></a>229. Unqualified references of other library entities</h3>
! <p><b>Section:</b> 17.6.1.1 [contents] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2000-04-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#contents">issues</a> in [contents].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Throughout the library chapters, the descriptions of library entities refer
  to other library entities without necessarily qualifying the names.</p>
  
! <p>For example, section 25.2.2 "Swap" describes the effect of
! swap_ranges in terms of the unqualified name "swap". This section
  could reasonably be interpreted to mean that the library must be implemented so
! as to do a lookup of the unqualified name "swap", allowing users to
  override any ::std::swap function when Koenig lookup applies.</p>
  
  <p>Although it would have been best to use explicit qualification with
! "::std::" throughout, too many lines in the standard would have to be
  adjusted to make that change in a Technical Corrigendum.</p>
  
! <p>Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#182">182</a>, which addresses qualification of
  <tt>size_t</tt>, is a special case of this.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>To section 17.4.1.1 "Library contents" Add the following paragraph:</p>
  <blockquote>
    <p>Whenever a name x defined in the standard library is mentioned, the name x
    is assumed to be fully qualified as ::std::x, unless explicitly described
--- 9744,9774 ----
  
  <hr>
  <h3><a name="229"></a>229. Unqualified references of other library entities</h3>
! <p><b>Section:</b> 17.6.1.1 [contents] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2000-04-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#contents">issues</a> in [contents].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Throughout the library chapters, the descriptions of library entities refer
  to other library entities without necessarily qualifying the names.</p>
  
! <p>For example, section 25.2.2 &quot;Swap&quot; describes the effect of
! swap_ranges in terms of the unqualified name &quot;swap&quot;. This section
  could reasonably be interpreted to mean that the library must be implemented so
! as to do a lookup of the unqualified name &quot;swap&quot;, allowing users to
  override any ::std::swap function when Koenig lookup applies.</p>
  
  <p>Although it would have been best to use explicit qualification with
! &quot;::std::&quot; throughout, too many lines in the standard would have to be
  adjusted to make that change in a Technical Corrigendum.</p>
  
! <p>Issue <a href="lwg-defects.html#182">182</a>, which addresses qualification of
  <tt>size_t</tt>, is a special case of this.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>To section 17.4.1.1 &quot;Library contents&quot; Add the following paragraph:</p>
  <blockquote>
    <p>Whenever a name x defined in the standard library is mentioned, the name x
    is assumed to be fully qualified as ::std::x, unless explicitly described
*************** adjusted to make that change in a Techni
*** 10552,10558 ****
  
  <p><i>[Post-Tokyo: Steve Clamage submitted this issue at the request of
  the LWG to solve a problem in the standard itself similar to the
! problem within implementations of library identified by issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a>.  Any resolution of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225">225</a> should be
  coordinated with the resolution of this issue.]</i></p>
  
  
--- 9778,9784 ----
  
  <p><i>[Post-Tokyo: Steve Clamage submitted this issue at the request of
  the LWG to solve a problem in the standard itself similar to the
! problem within implementations of library identified by issue <a href="lwg-defects.html#225">225</a>.  Any resolution of issue <a href="lwg-defects.html#225">225</a> should be
  coordinated with the resolution of this issue.]</i></p>
  
  
*************** class, and this requires argument-depend
*** 10565,10574 ****
  are intended to be called by library code.  Several LWG members are
  concerned that valarray appears to require argument-dependent lookup,
  but that the wording may not be clear enough to fall under
! "unless explicitly described otherwise".]</i></p>
  
  
! <p><i>[Curaçao: An LWG-subgroup spent an afternoon working on issues
  225, 226, and 229.  Their conclusion was that the issues should be
  separated into an LWG portion (Howard's paper, N1387=02-0045), and a
  EWG portion (Dave will write a proposal). The LWG and EWG had
--- 9791,9800 ----
  are intended to be called by library code.  Several LWG members are
  concerned that valarray appears to require argument-dependent lookup,
  but that the wording may not be clear enough to fall under
! &quot;unless explicitly described otherwise&quot;.]</i></p>
  
  
! <p><i>[Cura&ccedil;ao: An LWG-subgroup spent an afternoon working on issues
  225, 226, and 229.  Their conclusion was that the issues should be
  separated into an LWG portion (Howard's paper, N1387=02-0045), and a
  EWG portion (Dave will write a proposal). The LWG and EWG had
*************** resolution for the current issue makes s
*** 10584,10596 ****
  
  <hr>
  <h3><a name="230"></a>230. Assignable specified without also specifying CopyConstructible</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2000-04-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#227">227</a> identified an instance (std::swap) where
  Assignable was specified without also specifying
  CopyConstructible. The LWG asked that the standard be searched to
  determine if the same defect existed elsewhere.</p>
--- 9810,9822 ----
  
  <hr>
  <h3><a name="230"></a>230. Assignable specified without also specifying CopyConstructible</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2000-04-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Issue <a href="lwg-defects.html#227">227</a> identified an instance (std::swap) where
  Assignable was specified without also specifying
  CopyConstructible. The LWG asked that the standard be searched to
  determine if the same defect existed elsewhere.</p>
*************** specified. For example, 26.5.1 [rand.req
*** 10604,10615 ****
  <p><b>Proposed resolution:</b></p>
  <p>In  23.2 [container.requirements] table 65 for value_type:
  change "T is Assignable" to "T is CopyConstructible and
! Assignable"
  </p>
  
  <p>In 23.2.4 [associative.reqmts] table 69 X::key_type; change
! "Key is Assignable" to "Key is
! CopyConstructible and Assignable"<br>
  </p>
  
  <p>In 24.2.4 [output.iterators] paragraph 1, change:
--- 9830,9841 ----
  <p><b>Proposed resolution:</b></p>
  <p>In  23.2 [container.requirements] table 65 for value_type:
  change "T is Assignable" to "T is CopyConstructible and
! Assignable&quot;
  </p>
  
  <p>In 23.2.4 [associative.reqmts] table 69 X::key_type; change
! &quot;Key is Assignable" to &quot;Key is
! CopyConstructible and Assignable&quot;<br/>
  </p>
  
  <p>In 24.2.4 [output.iterators] paragraph 1, change:
*************** overspecification.]</i></p>
*** 10637,10643 ****
  
  
  <p><i>[Portions of the resolution for issue 230 have been superceded by
! the resolution of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#276">276</a>.]</i></p>
  
  
  
--- 9863,9869 ----
  
  
  <p><i>[Portions of the resolution for issue 230 have been superceded by
! the resolution of issue <a href="lwg-defects.html#276">276</a>.]</i></p>
  
  
  
*************** Copy Constructible property.</p>
*** 10655,10664 ****
  
  <hr>
  <h3><a name="231"></a>231. Precision in iostream?</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> James Kanze, Stephen Clamage <b>Opened:</b> 2000-04-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>What is the following program supposed to output?</p>
  <pre>#include &lt;iostream&gt;
--- 9881,9890 ----
  
  <hr>
  <h3><a name="231"></a>231. Precision in iostream?</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> James Kanze, Stephen Clamage <b>Opened:</b> 2000-04-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>What is the following program supposed to output?</p>
  <pre>#include &lt;iostream&gt;
*************** Copy Constructible property.</p>
*** 10671,10684 ****
          std::cout &lt;&lt; 1.00 &lt;&lt; '\n' ;
          return 0 ;
      }</pre>
! <p>From my C experience, I would expect "1e+00"; this is what 
! <tt>printf("%.0e" , 1.00 );</tt> does. G++ outputs 
! "1.000000e+00".</p>
  
  <p>The only indication I can find in the standard is 22.2.2.2.2/11,
! where it says "For conversion from a floating-point type, if
  (flags &amp; fixed) != 0 or if str.precision() &gt; 0, then
! str.precision() is specified in the conversion specification."
  This is an obvious error, however, fixed is not a mask for a field,
  but a value that a multi-bit field may take -- the results of and'ing
  fmtflags with ios::fixed are not defined, at least not if
--- 9897,9910 ----
          std::cout &lt;&lt; 1.00 &lt;&lt; '\n' ;
          return 0 ;
      }</pre>
! <p>From my C experience, I would expect &quot;1e+00&quot;; this is what 
! <tt>printf(&quot;%.0e&quot; , 1.00 );</tt> does. G++ outputs 
! &quot;1.000000e+00&quot;.</p>
  
  <p>The only indication I can find in the standard is 22.2.2.2.2/11,
! where it says &quot;For conversion from a floating-point type, if
  (flags &amp; fixed) != 0 or if str.precision() &gt; 0, then
! str.precision() is specified in the conversion specification.&quot;
  This is an obvious error, however, fixed is not a mask for a field,
  but a value that a multi-bit field may take -- the results of and'ing
  fmtflags with ios::fixed are not defined, at least not if
*************** precision 1.</p>
*** 10725,10733 ****
  specifying a precision of 0, which will be internally
  turned into 1.  There's no need to call it out as a special
  case.</p>
! <p>The output of the above program will be "1e+00".</p>
  
! <p><i>[Post-Curaçao: Howard provided improved wording covering the case
  where precision is 0 and mode is %g.]</i></p>
  
  
--- 9951,9959 ----
  specifying a precision of 0, which will be internally
  turned into 1.  There's no need to call it out as a special
  case.</p>
! <p>The output of the above program will be &quot;1e+00&quot;.</p>
  
! <p><i>[Post-Cura&ccedil;ao: Howard provided improved wording covering the case
  where precision is 0 and mode is %g.]</i></p>
  
  
*************** where precision is 0 and mode is %g.]</i
*** 10737,10751 ****
  
  
  <hr>
! <h3><a name="232"></a>232. "depends" poorly defined in 17.4.3.1</h3>
! <p><b>Section:</b> 17.6.3.3 [reserved.names] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2000-04-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#reserved.names">issues</a> in [reserved.names].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>17.4.3.1/1 uses the term "depends" to limit the set of allowed
! specializations of standard templates to those that "depend on a
! user-defined name of external linkage."</p>
  <p>This term, however, is not adequately defined, making it possible to
  construct a specialization that is, I believe, technically legal according to
  17.4.3.1/1, but that specializes a standard template for a built-in type such as
--- 9963,9977 ----
  
  
  <hr>
! <h3><a name="232"></a>232. &quot;depends&quot; poorly defined in 17.4.3.1</h3>
! <p><b>Section:</b> 17.6.4.3 [reserved.names] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2000-04-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reserved.names">issues</a> in [reserved.names].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>17.4.3.1/1 uses the term &quot;depends&quot; to limit the set of allowed
! specializations of standard templates to those that &quot;depend on a
! user-defined name of external linkage.&quot;</p>
  <p>This term, however, is not adequately defined, making it possible to
  construct a specialization that is, I believe, technically legal according to
  17.4.3.1/1, but that specializes a standard template for a built-in type such as
*************** construct a specialization that is, I be
*** 10765,10772 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change "user-defined name" to "user-defined
! type".</p>
  
  
  <p><b>Rationale:</b></p>
--- 9991,9998 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change &quot;user-defined name&quot; to &quot;user-defined
! type&quot;.</p>
  
  
  <p><b>Rationale:</b></p>
*************** possible way for a user to come up with
*** 10778,10784 ****
  for example, that might not have already been specialized by the
  implementor?</p>
  
! <p><i>[Toronto: this may be related to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#120">120</a>.]</i></p>
  
  
  <p><i>[post-Toronto: Judy provided the above proposed resolution and
--- 10004,10010 ----
  for example, that might not have already been specialized by the
  implementor?</p>
  
! <p><i>[Toronto: this may be related to issue <a href="lwg-defects.html#120">120</a>.]</i></p>
  
  
  <p><i>[post-Toronto: Judy provided the above proposed resolution and
*************** rationale.]</i></p>
*** 10791,10802 ****
  
  <hr>
  <h3><a name="233"></a>233. Insertion hints in associative containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2000-04-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#192">192</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#246">246</a></p>
  <p><b>Discussion:</b></p>
  <p>
  If <tt>mm</tt> is a multimap and <tt>p</tt> is an iterator
--- 10017,10028 ----
  
  <hr>
  <h3><a name="233"></a>233. Insertion hints in associative containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2000-04-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#192">192</a>, <a href="lwg-closed.html#246">246</a></p>
  <p><b>Discussion:</b></p>
  <p>
  If <tt>mm</tt> is a multimap and <tt>p</tt> is an iterator
*************** can supply <tt>p</tt>, and the implement
*** 10819,10825 ****
  disregard it entirely.
  </p>
  
! <p><b>Additional comments from Nathan:</b><br>
  
  The vote [in Redmond] was on whether to elaborately specify the use of
  the hint, or to require behavior only if the value could be inserted
--- 10045,10051 ----
  disregard it entirely.
  </p>
  
! <p><b>Additional comments from Nathan:</b><br/>
  
  The vote [in Redmond] was on whether to elaborately specify the use of
  the hint, or to require behavior only if the value could be inserted
*************** other (perhaps better) balanced tree tec
*** 10860,10866 ****
  enough to make the detailed semantics hard to satisfy."]</i></p>
  
  
! <p><i>[Curaçao: Nathan should give us the alternative wording he
  suggests so the LWG can decide between the two options.]</i></p>
  
  
--- 10086,10092 ----
  enough to make the detailed semantics hard to satisfy."]</i></p>
  
  
! <p><i>[Cura&ccedil;ao: Nathan should give us the alternative wording he
  suggests so the LWG can decide between the two options.]</i></p>
  
  
*************** accepted with minor wording changes in t
*** 10887,10893 ****
  proposed resolution below).  Concerns about the performance of the algorithm
  were satisfactorily met by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1780.html">1780</a>.
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#371">371</a> already handles the stability of equal ranges
  and so that part of the resolution from
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1780.html">1780</a>
  is no longer needed (or reflected in the proposed wording below).
--- 10113,10119 ----
  proposed resolution below).  Concerns about the performance of the algorithm
  were satisfactorily met by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1780.html">1780</a>.
! <a href="lwg-defects.html#371">371</a> already handles the stability of equal ranges
  and so that part of the resolution from
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1780.html">1780</a>
  is no longer needed (or reflected in the proposed wording below).
*************** Change the indicated rows of the "Associ
*** 10903,10913 ****
  23.2.4 [associative.reqmts] to:
  </p>
  
- <p></p><center>
  <table border="1">
  <caption>Associative container requirements</caption>
! <tbody><tr><th>expression</th> <th>return type</th>
! <th>assertion/note<br>pre/post-condition</th>
  <th>complexity</th></tr>
  <tr><td><tt>a_eq.insert(t)</tt></td>
  <td><tt>iterator</tt></td>
--- 10129,10138 ----
  23.2.4 [associative.reqmts] to:
  </p>
  
  <table border="1">
  <caption>Associative container requirements</caption>
! <tr><th>expression</th> <th>return type</th>
! <th>assertion&#47;note<br/>pre&#47;post-condition</th>
  <th>complexity</th></tr>
  <tr><td><tt>a_eq.insert(t)</tt></td>
  <td><tt>iterator</tt></td>
*************** to the position just prior to <tt>p</tt>
*** 10933,10940 ****
  logarithmic in general, but amortized constant if <tt>t</tt> is inserted right <del>after</del>
   <ins>before</ins> <tt>p</tt>.
  </td></tr>
! </tbody></table>
! </center><p></p>
  
  
  
--- 10158,10164 ----
  logarithmic in general, but amortized constant if <tt>t</tt> is inserted right <del>after</del>
   <ins>before</ins> <tt>p</tt>.
  </td></tr>
! </table>
  
  
  
*************** logarithmic in general, but amortized co
*** 10943,10952 ****
  
  <hr>
  <h3><a name="234"></a>234. Typos in allocator definition</h3>
! <p><b>Section:</b> 20.9.5.1 [allocator.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 2000-04-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In paragraphs 12 and 13 the effects of <tt>construct()</tt> and
  <tt>destruct()</tt> are described as returns but the functions actually
--- 10167,10176 ----
  
  <hr>
  <h3><a name="234"></a>234. Typos in allocator definition</h3>
! <p><b>Section:</b> 20.7.9.1 [allocator.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 2000-04-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In paragraphs 12 and 13 the effects of <tt>construct()</tt> and
  <tt>destruct()</tt> are described as returns but the functions actually
*************** return <tt>void</tt>.</p>
*** 10954,10969 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Substitute "Returns" by "Effect".</p>
  
  
  
  
  <hr>
  <h3><a name="235"></a>235. No specification of default ctor for reverse_iterator</h3>
! <p><b>Section:</b> 24.5.1.1 [reverse.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 2000-04-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The declaration of <tt>reverse_iterator</tt> lists a default
  constructor.  However, no specification is given what this constructor
--- 10178,10194 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Substitute &quot;Returns&quot; by &quot;Effect&quot;.</p>
  
  
  
  
  <hr>
  <h3><a name="235"></a>235. No specification of default ctor for reverse_iterator</h3>
! <p><b>Section:</b> 24.5.1.1 [reverse.iterator] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 2000-04-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reverse.iterator">issues</a> in [reverse.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The declaration of <tt>reverse_iterator</tt> lists a default
  constructor.  However, no specification is given what this constructor
*************** should do.</p>
*** 10991,11000 ****
  
  <hr>
  <h3><a name="237"></a>237. Undefined expression in complexity specification</h3>
! <p><b>Section:</b> 23.3.2.1 [deque.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 2000-04-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#deque.cons">issues</a> in [deque.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The complexity specification in paragraph 6 says that the complexity
  is linear in <tt>first - last</tt>. Even if <tt>operator-()</tt> is
--- 10216,10225 ----
  
  <hr>
  <h3><a name="237"></a>237. Undefined expression in complexity specification</h3>
! <p><b>Section:</b> 23.3.3.2 [deque.cons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 2000-04-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#deque.cons">issues</a> in [deque.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The complexity specification in paragraph 6 says that the complexity
  is linear in <tt>first - last</tt>. Even if <tt>operator-()</tt> is
*************** would have to be <tt>last - first</tt>.<
*** 11013,11028 ****
  
  <hr>
  <h3><a name="238"></a>238. Contradictory results of stringbuf initialization.</h3>
! <p><b>Section:</b> 27.8.1.1 [stringbuf.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar Kühl <b>Opened:</b> 2000-05-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#stringbuf.cons">issues</a> in [stringbuf.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 27.7.1.1 paragraph 4 the results of calling the constructor of
  'basic_stringbuf' are said to be <tt>str() == str</tt>. This is fine
  that far but consider this code:</p>
  
! <pre>  std::basic_stringbuf&lt;char&gt; sbuf("hello, world", std::ios_base::openmode(0));
    std::cout &lt;&lt; "'" &lt;&lt; sbuf.str() &lt;&lt; "'\n";
  </pre>
  
--- 10238,10254 ----
  
  <hr>
  <h3><a name="238"></a>238. Contradictory results of stringbuf initialization.</h3>
! <p><b>Section:</b> 27.8.2.1 [stringbuf.cons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dietmar K&uuml;hl <b>Opened:</b> 2000-05-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.cons">issues</a> in [stringbuf.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 27.7.1.1 paragraph 4 the results of calling the constructor of
  'basic_stringbuf' are said to be <tt>str() == str</tt>. This is fine
  that far but consider this code:</p>
  
! <pre>
!   std::basic_stringbuf&lt;char&gt; sbuf("hello, world", std::ios_base::openmode(0));
    std::cout &lt;&lt; "'" &lt;&lt; sbuf.str() &lt;&lt; "'\n";
  </pre>
  
*************** in the standard.</p>
*** 11051,11060 ****
  
  <hr>
  <h3><a name="239"></a>239. Complexity of unique() and/or unique_copy incorrect</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The complexity of unique and unique_copy are inconsistent with each
  other and inconsistent with the implementations.&nbsp; The standard
--- 10277,10286 ----
  
  <hr>
  <h3><a name="239"></a>239. Complexity of unique() and/or unique_copy incorrect</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The complexity of unique and unique_copy are inconsistent with each
  other and inconsistent with the implementations.&nbsp; The standard
*************** applications of the corresponding predic
*** 11096,11110 ****
  
  <hr>
  <h3><a name="240"></a>240. Complexity of adjacent_find() is meaningless</h3>
! <p><b>Section:</b> 25.2.8 [alg.adjacent.find] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.adjacent.find">issues</a> in [alg.adjacent.find].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The complexity section of adjacent_find is defective:</p>
  
  <blockquote>
! <pre>template &lt;class ForwardIterator&gt;
  ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last
                                BinaryPredicate pred);
  </pre>
--- 10322,10337 ----
  
  <hr>
  <h3><a name="240"></a>240. Complexity of adjacent_find() is meaningless</h3>
! <p><b>Section:</b> 25.2.8 [alg.adjacent.find] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.adjacent.find">issues</a> in [alg.adjacent.find].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The complexity section of adjacent_find is defective:</p>
  
  <blockquote>
! <pre>
! template &lt;class ForwardIterator&gt;
  ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last
                                BinaryPredicate pred);
  </pre>
*************** of the corresponding predicate.
*** 11119,11126 ****
  </p>
  </blockquote>
  
! <p>In the Complexity section, it is not defined what "value"
! is supposed to mean. My best guess is that "value" means an
  object for which one of the conditions pred(*i,value) or
  pred(value,*i) is true, where i is the iterator defined in the Returns
  section. However, the value type of the input sequence need not be
--- 10346,10353 ----
  </p>
  </blockquote>
  
! <p>In the Complexity section, it is not defined what &quot;value&quot;
! is supposed to mean. My best guess is that &quot;value&quot; means an
  object for which one of the conditions pred(*i,value) or
  pred(value,*i) is true, where i is the iterator defined in the Returns
  section. However, the value type of the input sequence need not be
*************** the intended specification.  Binders can
*** 11133,11139 ****
  objects that have the function call operator declared const, which is
  not required of predicates because they can have non-const data
  members. For this reason, a specification using a binder could only be
! an "as-if" specification.</p>
  
  
  <p><b>Proposed resolution:</b></p>
--- 10360,10366 ----
  objects that have the function call operator declared const, which is
  not required of predicates because they can have non-const data
  members. For this reason, a specification using a binder could only be
! an &quot;as-if&quot; specification.</p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** bound.  The LWG preferred an exact count
*** 11156,11165 ****
  
  <hr>
  <h3><a name="241"></a>241. Does unique_copy() require CopyConstructible and Assignable?</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>Some popular implementations of unique_copy() create temporary
--- 10383,10392 ----
  
  <hr>
  <h3><a name="241"></a>241. Does unique_copy() require CopyConstructible and Assignable?</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>Some popular implementations of unique_copy() create temporary
*************** that requirement.  Howard provided new w
*** 11210,11218 ****
  
  
  <p><i>[
! Curaçao: The LWG changed the PR editorially to specify
! "neither...nor...meet..." as clearer than
! "both...and...do not meet...". Change believed to be so
  minor as not to require re-review.
  ]</i></p>
  
--- 10437,10445 ----
  
  
  <p><i>[
! Cura&ccedil;ao: The LWG changed the PR editorially to specify
! &quot;neither...nor...meet...&quot; as clearer than
! &quot;both...and...do not meet...&quot;. Change believed to be so
  minor as not to require re-review.
  ]</i></p>
  
*************** minor as not to require re-review.
*** 11225,11234 ****
  
  <hr>
  <h3><a name="242"></a>242. Side effects of function objects</h3>
! <p><b>Section:</b> 25.3.4 [alg.transform], 26.5 [rand] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.transform">issues</a> in [alg.transform].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The algorithms transform(), accumulate(), inner_product(),
  partial_sum(), and adjacent_difference() require that the function
--- 10452,10461 ----
  
  <hr>
  <h3><a name="242"></a>242. Side effects of function objects</h3>
! <p><b>Section:</b> 25.3.4 [alg.transform], 26.5 [rand] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Angelika Langer <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.transform">issues</a> in [alg.transform].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The algorithms transform(), accumulate(), inner_product(),
  partial_sum(), and adjacent_difference() require that the function
*************** intentional.]</i></p>
*** 11413,11438 ****
  
  <hr>
  <h3><a name="243"></a>243. <tt>get</tt> and <tt>getline</tt> when sentry reports failure</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>basic_istream&lt;&gt;::get(), and basic_istream&lt;&gt;::getline(),
  are unclear with respect to the behavior and side-effects of the named
  functions in case of an error.</p>
  
! <p>27.6.1.3, p1 states that "... If the sentry object returns
  true, when converted to a value of type bool, the function endeavors
! to obtain the requested input..." It is not clear from this (or
  the rest of the paragraph) what precisely the behavior should be when
  the sentry ctor exits by throwing an exception or when the sentry
  object returns false.  In particular, what is the number of characters
  extracted that gcount() returns supposed to be?</p>
  
  <p>27.6.1.3 p8 and p19 say about the effects of get() and getline():
! "...  In any case, it then stores a null character (using
! charT()) into the next successive location of the array." Is not
  clear whether this sentence applies if either of the conditions above
  holds (i.e., when sentry fails).</p>
  
--- 10640,10666 ----
  
  <hr>
  <h3><a name="243"></a>243. <tt>get</tt> and <tt>getline</tt> when sentry reports failure</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-05-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>basic_istream&lt;&gt;::get(), and basic_istream&lt;&gt;::getline(),
  are unclear with respect to the behavior and side-effects of the named
  functions in case of an error.</p>
  
! <p>27.6.1.3, p1 states that &quot;... If the sentry object returns
  true, when converted to a value of type bool, the function endeavors
! to obtain the requested input...&quot; It is not clear from this (or
  the rest of the paragraph) what precisely the behavior should be when
  the sentry ctor exits by throwing an exception or when the sentry
  object returns false.  In particular, what is the number of characters
  extracted that gcount() returns supposed to be?</p>
  
  <p>27.6.1.3 p8 and p19 say about the effects of get() and getline():
! &quot;...  In any case, it then stores a null character (using
! charT()) into the next successive location of the array.&quot; Is not
  clear whether this sentence applies if either of the conditions above
  holds (i.e., when sentry fails).</p>
  
*************** holds (i.e., when sentry fails).</p>
*** 11441,11461 ****
  <p>Add to 27.6.1.3, p1 after the sentence</p>
  
  <blockquote><p>
! "... If the sentry object returns true, when converted to a value of
! type bool, the function endeavors to obtain the requested input."
  </p></blockquote>
  
  <p>the following</p>
  
  
  <blockquote><p>
! "Otherwise, if the sentry constructor exits by throwing an exception or
  if the sentry object returns false, when converted to a value of type
  bool, the function returns without attempting to obtain any input. In
  either case the number of extracted characters is set to 0; unformatted
  input functions taking a character array of non-zero size as an argument
  shall also store a null character (using charT()) in the first location
! of the array."
  </p></blockquote>
  
  
--- 10669,10689 ----
  <p>Add to 27.6.1.3, p1 after the sentence</p>
  
  <blockquote><p>
! &quot;... If the sentry object returns true, when converted to a value of
! type bool, the function endeavors to obtain the requested input.&quot;
  </p></blockquote>
  
  <p>the following</p>
  
  
  <blockquote><p>
! &quot;Otherwise, if the sentry constructor exits by throwing an exception or
  if the sentry object returns false, when converted to a value of type
  bool, the function returns without attempting to obtain any input. In
  either case the number of extracted characters is set to 0; unformatted
  input functions taking a character array of non-zero size as an argument
  shall also store a null character (using charT()) in the first location
! of the array.&quot;
  </p></blockquote>
  
  
*************** Jerry Schwarz's message c++std-lib-7618.
*** 11473,11484 ****
  
  <hr>
  <h3><a name="247"></a>247. <tt>vector</tt>, <tt>deque::insert</tt> complexity</h3>
! <p><b>Section:</b> 23.4.1.4 [vector.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Lisa Lippincott <b>Opened:</b> 2000-06-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 2 of 23.4.1.4 [vector.modifiers] describes the complexity
  of <tt>vector::insert</tt>:</p>
  
     <blockquote><p>
--- 10701,10713 ----
  
  <hr>
  <h3><a name="247"></a>247. <tt>vector</tt>, <tt>deque::insert</tt> complexity</h3>
! <p><b>Section:</b> 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Lisa Lippincott <b>Opened:</b> 2000-06-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.modifiers">active issues</a> in [vector.modifiers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 2 of 23.3.6.5 [vector.modifiers] describes the complexity
  of <tt>vector::insert</tt>:</p>
  
     <blockquote><p>
*************** the end of a <tt>vector</tt> in constant
*** 11499,11505 ****
  
  <p>I looked to see if <tt>deque</tt> had a similar problem, and was
  surprised to find that <tt>deque</tt> places no requirement on the
! complexity of inserting multiple elements (23.3.2.3 [deque.modifiers],
  paragraph 3):</p>
  
     <blockquote><p>
--- 10728,10734 ----
  
  <p>I looked to see if <tt>deque</tt> had a similar problem, and was
  surprised to find that <tt>deque</tt> places no requirement on the
! complexity of inserting multiple elements (23.3.3.4 [deque.modifiers],
  paragraph 3):</p>
  
     <blockquote><p>
*************** paragraph 3):</p>
*** 11515,11521 ****
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Change Paragraph 2 of 23.4.1.4 [vector.modifiers] to</p>
     <blockquote><p>
     Complexity: The complexity is linear in the number of elements 
     inserted plus the distance to the end of the vector.
--- 10744,10750 ----
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Change Paragraph 2 of 23.3.6.5 [vector.modifiers] to</p>
     <blockquote><p>
     Complexity: The complexity is linear in the number of elements 
     inserted plus the distance to the end of the vector.
*************** paragraph 3):</p>
*** 11526,11532 ****
     <tt>rotate</tt>.]</i></p>
  
  
! <p>Change 23.3.2.3 [deque.modifiers], paragraph 3, to:</p>
  
     <blockquote><p>
     Complexity: The complexity is linear in the number of elements 
--- 10755,10761 ----
     <tt>rotate</tt>.]</i></p>
  
  
! <p>Change 23.3.3.4 [deque.modifiers], paragraph 3, to:</p>
  
     <blockquote><p>
     Complexity: The complexity is linear in the number of elements 
*************** paragraph 3):</p>
*** 11551,11559 ****
  
  <hr>
  <h3><a name="248"></a>248. time_get fails to set eofbit</h3>
! <p><b>Section:</b> 22.4.5 [category.time] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-06-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There is no requirement that any of time_get member functions set
  ios::eofbit when they reach the end iterator while parsing their input.
--- 10780,10788 ----
  
  <hr>
  <h3><a name="248"></a>248. time_get fails to set eofbit</h3>
! <p><b>Section:</b> 22.4.5 [category.time] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-06-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>There is no requirement that any of time_get member functions set
  ios::eofbit when they reach the end iterator while parsing their input.
*************** input facets.</p>
*** 11581,11595 ****
  
  <hr>
  <h3><a name="250"></a>250. splicing invalidates iterators</h3>
! <p><b>Section:</b> 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Brian Parker  <b>Opened:</b> 2000-07-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 23.3.4.4 [list.ops] states that
  </p>
! <pre>  void splice(iterator position, list&lt;T, Allocator&gt;&amp; x);
  </pre>
  <p>
  <i>invalidates</i> all iterators and references to list <tt>x</tt>.
--- 10810,10825 ----
  
  <hr>
  <h3><a name="250"></a>250. splicing invalidates iterators</h3>
! <p><b>Section:</b> 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Brian Parker  <b>Opened:</b> 2000-07-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 23.3.5.5 [list.ops] states that
  </p>
! <pre>
!   void splice(iterator position, list&lt;T, Allocator&gt;&amp; x);
  </pre>
  <p>
  <i>invalidates</i> all iterators and references to list <tt>x</tt>.
*************** after <tt>splice</tt>.
*** 11604,11617 ****
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Add a footnote to 23.3.4.4 [list.ops], paragraph 1:</p>
  <blockquote><p>
  [<i>Footnote:</i> As specified in  [default.con.req], paragraphs
  4-5, the semantics described in this clause applies only to the case
  where allocators compare equal.  --end footnote]
  </p></blockquote>
  
! <p>In 23.3.4.4 [list.ops], replace paragraph 4 with:</p>
  <blockquote><p>
  Effects: Inserts the contents of x before position and x becomes 
  empty.  Pointers and references to the moved elements of x now refer to 
--- 10834,10847 ----
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Add a footnote to 23.3.5.5 [list.ops], paragraph 1:</p>
  <blockquote><p>
  [<i>Footnote:</i> As specified in  [default.con.req], paragraphs
  4-5, the semantics described in this clause applies only to the case
  where allocators compare equal.  --end footnote]
  </p></blockquote>
  
! <p>In 23.3.5.5 [list.ops], replace paragraph 4 with:</p>
  <blockquote><p>
  Effects: Inserts the contents of x before position and x becomes 
  empty.  Pointers and references to the moved elements of x now refer to 
*************** moved elements will continue to refer to
*** 11620,11626 ****
  behave as iterators into *this, not into x.
  </p></blockquote>
  
! <p>In 23.3.4.4 [list.ops], replace paragraph 7 with:</p>
  <blockquote><p>
  Effects: Inserts an element pointed to by i from list x before 
  position and removes the element from x. The result is unchanged if 
--- 10850,10856 ----
  behave as iterators into *this, not into x.
  </p></blockquote>
  
! <p>In 23.3.5.5 [list.ops], replace paragraph 7 with:</p>
  <blockquote><p>
  Effects: Inserts an element pointed to by i from list x before 
  position and removes the element from x. The result is unchanged if 
*************** to refer to this same element but as a m
*** 11630,11636 ****
  behave as iterators into *this, not into x.
  </p></blockquote>
  
! <p>In 23.3.4.4 [list.ops], replace paragraph 12 with:</p>
  <blockquote><p>
  Requires: [first, last) is a valid range in x. The result is 
  undefined if position is an iterator in the range [first, last).  
--- 10860,10866 ----
  behave as iterators into *this, not into x.
  </p></blockquote>
  
! <p>In 23.3.5.5 [list.ops], replace paragraph 12 with:</p>
  <blockquote><p>
  Requires: [first, last) is a valid range in x. The result is 
  undefined if position is an iterator in the range [first, last).  
*************** allocators compare nonequal is outside t
*** 11656,11664 ****
  
  <hr>
  <h3><a name="251"></a>251. basic_stringbuf missing allocator_type</h3>
! <p><b>Section:</b> 27.8.1 [stringbuf] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-07-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The synopsis for the template class <tt>basic_stringbuf</tt>
  doesn't list a typedef for the template parameter
--- 10886,10894 ----
  
  <hr>
  <h3><a name="251"></a>251. basic_stringbuf missing allocator_type</h3>
! <p><b>Section:</b> 27.8.2 [stringbuf] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-07-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The synopsis for the template class <tt>basic_stringbuf</tt>
  doesn't list a typedef for the template parameter
*************** template classes in the library that do
*** 11672,11678 ****
  <p>Add to the synopses of the class templates basic_stringbuf (27.7.1),
  basic_istringstream (27.7.2), basic_ostringstream (27.7.3), and 
  basic_stringstream (27.7.4) the typedef:</p>
! <pre>  typedef Allocator allocator_type;
  </pre>
  
  
--- 10902,10909 ----
  <p>Add to the synopses of the class templates basic_stringbuf (27.7.1),
  basic_istringstream (27.7.2), basic_ostringstream (27.7.3), and 
  basic_stringstream (27.7.4) the typedef:</p>
! <pre>
!   typedef Allocator allocator_type;
  </pre>
  
  
*************** basic_stringstream (27.7.4) the typedef:
*** 11680,11689 ****
  
  <hr>
  <h3><a name="252"></a>252. missing casts/C-style casts used in iostreams</h3>
! <p><b>Section:</b> 27.8 [string.streams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-07-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.streams">issues</a> in [string.streams].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.7.2.2, p1 uses a C-style cast rather than the more appropriate
  const_cast&lt;&gt; in the Returns clause for basic_istringstream&lt;&gt;::rdbuf().
--- 10911,10920 ----
  
  <hr>
  <h3><a name="252"></a>252. missing casts/C-style casts used in iostreams</h3>
! <p><b>Section:</b> 27.8 [string.streams] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-07-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.streams">issues</a> in [string.streams].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.7.2.2, p1 uses a C-style cast rather than the more appropriate
  const_cast&lt;&gt; in the Returns clause for basic_istringstream&lt;&gt;::rdbuf().
*************** issue is stylistic rather than a matter
*** 11726,11735 ****
  
  <hr>
  <h3><a name="253"></a>253. valarray helper functions are almost entirely useless</h3>
! <p><b>Section:</b> 26.6.2.1 [valarray.cons], 26.6.2.2 [valarray.assign] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2000-07-31 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This discussion is adapted from message c++std-lib-7056 posted
  November 11, 1999.  I don't think that anyone can reasonably claim
--- 10957,10966 ----
  
  <hr>
  <h3><a name="253"></a>253. valarray helper functions are almost entirely useless</h3>
! <p><b>Section:</b> 26.6.2.2 [valarray.cons], 26.6.2.3 [valarray.assign] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2000-07-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>This discussion is adapted from message c++std-lib-7056 posted
  November 11, 1999.  I don't think that anyone can reasonably claim
*************** that the problem described below is NAD.
*** 11737,11743 ****
  
  <p>These valarray constructors can never be called:</p>
  
! <pre>   template &lt;class T&gt;
           valarray&lt;T&gt;::valarray(const slice_array&lt;T&gt; &amp;);
     template &lt;class T&gt;
           valarray&lt;T&gt;::valarray(const gslice_array&lt;T&gt; &amp;);
--- 10968,10975 ----
  
  <p>These valarray constructors can never be called:</p>
  
! <pre>
!    template &lt;class T&gt;
           valarray&lt;T&gt;::valarray(const slice_array&lt;T&gt; &amp;);
     template &lt;class T&gt;
           valarray&lt;T&gt;::valarray(const gslice_array&lt;T&gt; &amp;);
*************** that the problem described below is NAD.
*** 11750,11756 ****
  <p>Similarly, these valarray assignment operators cannot be
  called:</p>
  
! <pre>     template &lt;class T&gt;
       valarray&lt;T&gt; valarray&lt;T&gt;::operator=(const slice_array&lt;T&gt; &amp;);
       template &lt;class T&gt;
       valarray&lt;T&gt; valarray&lt;T&gt;::operator=(const gslice_array&lt;T&gt; &amp;);
--- 10982,10989 ----
  <p>Similarly, these valarray assignment operators cannot be
  called:</p>
  
! <pre>
!      template &lt;class T&gt;
       valarray&lt;T&gt; valarray&lt;T&gt;::operator=(const slice_array&lt;T&gt; &amp;);
       template &lt;class T&gt;
       valarray&lt;T&gt; valarray&lt;T&gt;::operator=(const gslice_array&lt;T&gt; &amp;);
*************** called:</p>
*** 11762,11768 ****
  
  <p>Please consider the following example:</p>
  
! <pre>   #include &lt;valarray&gt;
     using namespace std;
  
     int main()
--- 10995,11002 ----
  
  <p>Please consider the following example:</p>
  
! <pre>
!    #include &lt;valarray&gt;
     using namespace std;
  
     int main()
*************** std::slice_array&lt;double&gt;.  This sl
*** 11779,11785 ****
  construct va2.  The constructor that is used to construct va2 is
  declared like this:</p>
  
! <pre>     template &lt;class T&gt;
       valarray&lt;T&gt;::valarray(const slice_array&lt;T&gt; &amp;);
  </pre>
  
--- 11013,11020 ----
  construct va2.  The constructor that is used to construct va2 is
  declared like this:</p>
  
! <pre>
!      template &lt;class T&gt;
       valarray&lt;T&gt;::valarray(const slice_array&lt;T&gt; &amp;);
  </pre>
  
*************** classes are almost entirely useless.</p>
*** 11812,11820 ****
  <li> remove the copy constructor declaration from  [cons.slice.arr]</li>
  <li> change paragraph 1 of  [cons.slice.arr] to read "This constructor is declared
      to be private.  This constructor need not be defined."</li>
! <li> remove the first sentence of paragraph 1 of 26.6.5.1 [slice.arr.assign]</li>
  <li> Change the first three words of the second sentence of paragraph 1 of
!     26.6.5.1 [slice.arr.assign] to "These assignment operators have"</li>
  </ul>
  
  <p>gslice_array:</p>
--- 11047,11055 ----
  <li> remove the copy constructor declaration from  [cons.slice.arr]</li>
  <li> change paragraph 1 of  [cons.slice.arr] to read "This constructor is declared
      to be private.  This constructor need not be defined."</li>
! <li> remove the first sentence of paragraph 1 of 26.6.5.2 [slice.arr.assign]</li>
  <li> Change the first three words of the second sentence of paragraph 1 of
!     26.6.5.2 [slice.arr.assign] to "These assignment operators have"</li>
  </ul>
  
  <p>gslice_array:</p>
*************** classes are almost entirely useless.</p>
*** 11825,11833 ****
  <li> remove the copy constructor declaration from  [gslice.array.cons]</li>
  <li> change paragraph 1 of  [gslice.array.cons] to read "This constructor is declared
      to be private.  This constructor need not be defined."</li>
! <li> remove the first sentence of paragraph 1 of 26.6.7.1 [gslice.array.assign]</li>
  <li> Change the first three words of the second sentence of paragraph 1 of
!     26.6.7.1 [gslice.array.assign] to "These assignment operators have"</li>
  </ul>
  
  <p>mask_array:</p>
--- 11060,11068 ----
  <li> remove the copy constructor declaration from  [gslice.array.cons]</li>
  <li> change paragraph 1 of  [gslice.array.cons] to read "This constructor is declared
      to be private.  This constructor need not be defined."</li>
! <li> remove the first sentence of paragraph 1 of 26.6.7.2 [gslice.array.assign]</li>
  <li> Change the first three words of the second sentence of paragraph 1 of
!     26.6.7.2 [gslice.array.assign] to "These assignment operators have"</li>
  </ul>
  
  <p>mask_array:</p>
*************** classes are almost entirely useless.</p>
*** 11838,11846 ****
  <li> remove the copy constructor declaration from  [mask.array.cons]</li>
  <li> change paragraph 1 of  [mask.array.cons] to read "This constructor is declared
      to be private.  This constructor need not be defined."</li>
! <li> remove the first sentence of paragraph 1 of 26.6.8.1 [mask.array.assign]</li>
  <li> Change the first three words of the second sentence of paragraph 1 of
!     26.6.8.1 [mask.array.assign] to "These assignment operators have"</li>
  </ul>
  
  <p>indirect_array:</p>
--- 11073,11081 ----
  <li> remove the copy constructor declaration from  [mask.array.cons]</li>
  <li> change paragraph 1 of  [mask.array.cons] to read "This constructor is declared
      to be private.  This constructor need not be defined."</li>
! <li> remove the first sentence of paragraph 1 of 26.6.8.2 [mask.array.assign]</li>
  <li> Change the first three words of the second sentence of paragraph 1 of
!     26.6.8.2 [mask.array.assign] to "These assignment operators have"</li>
  </ul>
  
  <p>indirect_array:</p>
*************** classes are almost entirely useless.</p>
*** 11851,11859 ****
  <li> remove the copy constructor declaration from  [indirect.array.cons]</li>
  <li> change the descriptive text in  [indirect.array.cons] to read "This constructor is
      declared to be private.  This constructor need not be defined."</li>
! <li> remove the first sentence of paragraph 1 of 26.6.9.1 [indirect.array.assign]</li>
  <li> Change the first three words of the second sentence of paragraph 1 of
!     26.6.9.1 [indirect.array.assign] to "These assignment operators have"</li>
  </ul>
  <p><i>[Proposed resolution was modified in Santa Cruz: explicitly make
  copy constructor and copy assignment operators public, instead of
--- 11086,11094 ----
  <li> remove the copy constructor declaration from  [indirect.array.cons]</li>
  <li> change the descriptive text in  [indirect.array.cons] to read "This constructor is
      declared to be private.  This constructor need not be defined."</li>
! <li> remove the first sentence of paragraph 1 of 26.6.9.2 [indirect.array.assign]</li>
  <li> Change the first three words of the second sentence of paragraph 1 of
!     26.6.9.2 [indirect.array.assign] to "These assignment operators have"</li>
  </ul>
  <p><i>[Proposed resolution was modified in Santa Cruz: explicitly make
  copy constructor and copy assignment operators public, instead of
*************** expectation.</p>
*** 11879,11887 ****
  
  <hr>
  <h3><a name="254"></a>254. Exception types in clause 19 are constructed from <tt>std::string</tt></h3>
! <p><b>Section:</b> 19.2 [std.exceptions], 27.5.2.1.1 [ios::failure] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-08-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Many of the standard exception types which implementations are
--- 11114,11123 ----
  
  <hr>
  <h3><a name="254"></a>254. Exception types in clause 19 are constructed from <tt>std::string</tt></h3>
! <p><b>Section:</b> 19.2 [std.exceptions], 27.5.3.1.1 [ios::failure] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2000-08-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#std.exceptions">issues</a> in [std.exceptions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Many of the standard exception types which implementations are
*************** required to throw are constructed with a
*** 11889,11895 ****
  parameter. For example:
  </p>
  
! <pre>     19.1.5  Class out_of_range                          [lib.out.of.range]
       namespace std {
         class out_of_range : public logic_error {
         public:
--- 11125,11132 ----
  parameter. For example:
  </p>
  
! <pre>
!      19.1.5  Class out_of_range                          [lib.out.of.range]
       namespace std {
         class out_of_range : public logic_error {
         public:
*************** a lot, though.
*** 11934,11940 ****
  There is a cure for (2), but it isn't completely obvious. I think a
  note for implementors should be made in the standard. Avoiding
  possible termination in this case shouldn't be left up to chance.  The
! cure is to use a reference-counted "string" implementation
  in the exception object. I am not necessarily referring to a
  std::string here; any simple reference-counting scheme for a NTBS
  would do.
--- 11171,11177 ----
  There is a cure for (2), but it isn't completely obvious. I think a
  note for implementors should be made in the standard. Avoiding
  possible termination in this case shouldn't be left up to chance.  The
! cure is to use a reference-counted &quot;string&quot; implementation
  in the exception object. I am not necessarily referring to a
  std::string here; any simple reference-counting scheme for a NTBS
  would do.
*************** std::bad_alloc don't require a temporary
*** 11953,11961 ****
  <p>
  ...I don't think the fixed-size buffer is a solution to the problem,
  strictly speaking, because you can't satisfy the postcondition
! <br>
      <tt>&nbsp;&nbsp;strcmp(what(), what_arg.c_str()) == 0</tt>
! <br>
  For all values of what_arg (i.e. very long values). That means that
  the only truly conforming solution requires a dynamic allocation.
  </p>
--- 11190,11198 ----
  <p>
  ...I don't think the fixed-size buffer is a solution to the problem,
  strictly speaking, because you can't satisfy the postcondition
! <br/>
      <tt>&nbsp;&nbsp;strcmp(what(), what_arg.c_str()) == 0</tt>
! <br/>
  For all values of what_arg (i.e. very long values). That means that
  the only truly conforming solution requires a dynamic allocation.
  </p>
*************** copy constructor is potentially invoked
*** 11971,11977 ****
  
  <p>The copy constructor is a more serious problem, becuase failure
  during stack unwinding invokes <tt>terminate</tt>.  The copy
! constructor must be nothrow. <i>Curaçao: Howard thinks this
  requirement may already be present.</i></p>
  
  <p>The fundamental problem is that it's difficult to get the nothrow
--- 11208,11214 ----
  
  <p>The copy constructor is a more serious problem, becuase failure
  during stack unwinding invokes <tt>terminate</tt>.  The copy
! constructor must be nothrow. <i>Cura&ccedil;ao: Howard thinks this
  requirement may already be present.</i></p>
  
  <p>The fundamental problem is that it's difficult to get the nothrow
*************** Change 19.2.1 [logic.error]
*** 12006,12012 ****
  </p>
  
  <blockquote>
! <pre>namespace std {
    class logic_error : public exception {
    public:
      explicit logic_error(const string&amp; <i>what_arg</i>);
--- 11243,11250 ----
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class logic_error : public exception {
    public:
      explicit logic_error(const string&amp; <i>what_arg</i>);
*************** Change 19.2.2 [domain.error]
*** 12034,12040 ****
  </p>
  
  <blockquote>
! <pre>namespace std {
    class domain_error : public logic_error {
    public:
      explicit domain_error(const string&amp; <i>what_arg</i>);
--- 11272,11279 ----
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class domain_error : public logic_error {
    public:
      explicit domain_error(const string&amp; <i>what_arg</i>);
*************** Change 19.2.3 [invalid.argument]
*** 12062,12068 ****
  </p>
  
  <blockquote>
! <pre>namespace std {
    class invalid_argument : public logic_error {
    public:
      explicit invalid_argument(const string&amp; <i>what_arg</i>);
--- 11301,11308 ----
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class invalid_argument : public logic_error {
    public:
      explicit invalid_argument(const string&amp; <i>what_arg</i>);
*************** Change 19.2.4 [length.error]
*** 12090,12096 ****
  </p>
  
  <blockquote>
! <pre>namespace std {
    class length_error : public logic_error {
    public:
      explicit length_error(const string&amp; <i>what_arg</i>);
--- 11330,11337 ----
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class length_error : public logic_error {
    public:
      explicit length_error(const string&amp; <i>what_arg</i>);
*************** Change 19.2.5 [out.of.range]
*** 12118,12124 ****
  </p>
  
  <blockquote>
! <pre>namespace std {
    class out_of_range : public logic_error {
    public:
      explicit out_of_range(const string&amp; <i>what_arg</i>);
--- 11359,11366 ----
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class out_of_range : public logic_error {
    public:
      explicit out_of_range(const string&amp; <i>what_arg</i>);
*************** Change 19.2.6 [runtime.error]
*** 12146,12152 ****
  </p>
  
  <blockquote>
! <pre>namespace std {
    class runtime_error : public exception {
    public:
      explicit runtime_error(const string&amp; <i>what_arg</i>);
--- 11388,11395 ----
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class runtime_error : public exception {
    public:
      explicit runtime_error(const string&amp; <i>what_arg</i>);
*************** Change 19.2.7 [range.error]
*** 12174,12180 ****
  </p>
  
  <blockquote>
! <pre>namespace std {
    class range_error : public runtime_error {
    public:
      explicit range_error(const string&amp; <i>what_arg</i>);
--- 11417,11424 ----
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class range_error : public runtime_error {
    public:
      explicit range_error(const string&amp; <i>what_arg</i>);
*************** Change 19.2.8 [overflow.error]
*** 12202,12208 ****
  </p>
  
  <blockquote>
! <pre>namespace std {
    class overflow_error : public runtime_error {
    public:
      explicit overflow_error(const string&amp; <i>what_arg</i>);
--- 11446,11453 ----
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class overflow_error : public runtime_error {
    public:
      explicit overflow_error(const string&amp; <i>what_arg</i>);
*************** Change 19.2.9 [underflow.error]
*** 12230,12236 ****
  </p>
  
  <blockquote>
! <pre>namespace std {
    class underflow_error : public runtime_error {
    public:
      explicit underflow_error(const string&amp; <i>what_arg</i>);
--- 11475,11482 ----
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class underflow_error : public runtime_error {
    public:
      explicit underflow_error(const string&amp; <i>what_arg</i>);
*************** Change 19.2.9 [underflow.error]
*** 12254,12264 ****
  </blockquote>
  
  <p>
! Change 27.5.2.1.1 [ios::failure]
  </p>
  
  <blockquote>
! <pre>namespace std {
    class ios_base::failure : public exception {
    public:
      explicit failure(const string&amp; <i>msg</i>);
--- 11500,11511 ----
  </blockquote>
  
  <p>
! Change 27.5.3.1.1 [ios::failure]
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    class ios_base::failure : public exception {
    public:
      explicit failure(const string&amp; <i>msg</i>);
*************** the need to explicit include or construc
*** 12329,12338 ****
  
  <hr>
  <h3><a name="256"></a>256. typo in 27.4.4.2, p17: copy_event does not exist</h3>
! <p><b>Section:</b> 27.5.4.2 [basic.ios.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-08-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  27.4.4.2, p17 says
--- 11576,11585 ----
  
  <hr>
  <h3><a name="256"></a>256. typo in 27.4.4.2, p17: copy_event does not exist</h3>
! <p><b>Section:</b> 27.5.5.3 [basic.ios.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-08-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  27.4.4.2, p17 says
*************** copyfmt_event.
*** 12359,12368 ****
  
  <hr>
  <h3><a name="258"></a>258. Missing allocator requirement</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-08-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From lib-7752:
--- 11606,11616 ----
  
  <hr>
  <h3><a name="258"></a>258. Missing allocator requirement</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-08-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From lib-7752:
*************** Given x1 == x2  and x2 == x3, this does
*** 12412,12420 ****
  
  <blockquote>
  <p>
! x1 can deallocate pointers from:  x1, x2, x3    <br>
! x2 can deallocate pointers from:  x1, x2, x4    <br>
! x3 can deallocate pointers from:  x1, x3        <br>
  x4 can deallocate pointers from:  x2, x4 
  </p>
  
--- 11660,11668 ----
  
  <blockquote>
  <p>
! x1 can deallocate pointers from:  x1, x2, x3    <br/>
! x2 can deallocate pointers from:  x1, x2, x4    <br/>
! x3 can deallocate pointers from:  x1, x3        <br/>
  x4 can deallocate pointers from:  x2, x4 
  </p>
  
*************** issue to Ready status to be voted into t
*** 12468,12477 ****
  
  <hr>
  <h3><a name="259"></a>259. <tt>basic_string::operator[]</tt> and const correctness</h3>
! <p><b>Section:</b> 21.4.4 [string.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Chris Newton  <b>Opened:</b> 2000-08-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.capacity">issues</a> in [string.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <i>Paraphrased from a message that Chris Newton posted to comp.std.c++:</i>
--- 11716,11725 ----
  
  <hr>
  <h3><a name="259"></a>259. <tt>basic_string::operator[]</tt> and const correctness</h3>
! <p><b>Section:</b> 21.4.4 [string.capacity] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Chris Newton  <b>Opened:</b> 2000-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.capacity">issues</a> in [string.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <i>Paraphrased from a message that Chris Newton posted to comp.std.c++:</i>
*************** seems to violate const correctness.
*** 12483,12490 ****
  </p>
  
  <p>
! The standard (21.3.4/1) says that "If <tt>pos &lt; size()</tt>,
! returns <tt>data()[pos]</tt>." The types don't work.  The
  return value of <tt>data()</tt> is <tt>const charT*</tt>, but
  <tt>operator[]</tt> has a non-const version whose return type is <tt>reference</tt>.
  </p>
--- 11731,11738 ----
  </p>
  
  <p>
! The standard (21.3.4/1) says that &quot;If <tt>pos &lt; size()</tt>,
! returns <tt>data()[pos]</tt>.&quot; The types don't work.  The
  return value of <tt>data()</tt> is <tt>const charT*</tt>, but
  <tt>operator[]</tt> has a non-const version whose return type is <tt>reference</tt>.
  </p>
*************** return value of <tt>data()</tt> is <tt>c
*** 12493,12500 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  In section 21.3.4, paragraph 1, change
! "<tt>data()[<i>pos</i>]</tt>" to "<tt>*(begin() +
! <i>pos</i>)</tt>".
  </p>
  
  
--- 11741,11748 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  In section 21.3.4, paragraph 1, change
! &quot;<tt>data()[<i>pos</i>]</tt>&quot; to &quot;<tt>*(begin() +
! <i>pos</i>)</tt>&quot;.
  </p>
  
  
*************** In section 21.3.4, paragraph 1, change
*** 12502,12511 ****
  
  <hr>
  <h3><a name="260"></a>260. Inconsistent return type of <tt>istream_iterator::operator++(int)</tt></h3>
! <p><b>Section:</b> 24.6.1.2 [istream.iterator.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-08-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.iterator.ops">issues</a> in [istream.iterator.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The synopsis of istream_iterator::operator++(int) in 24.5.1 shows
  it as returning the iterator by value. 24.5.1.2, p5 shows the same
--- 11750,11759 ----
  
  <hr>
  <h3><a name="260"></a>260. Inconsistent return type of <tt>istream_iterator::operator++(int)</tt></h3>
! <p><b>Section:</b> 24.6.1.2 [istream.iterator.ops] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.iterator.ops">issues</a> in [istream.iterator.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The synopsis of istream_iterator::operator++(int) in 24.5.1 shows
  it as returning the iterator by value. 24.5.1.2, p5 shows the same
*************** given the Effects clause below (since a
*** 12516,12525 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Change the declaration in 24.5.1.2, p5 from</p>
!  <pre> istream_iterator&lt;T,charT,traits,Distance&gt;&amp; operator++(int);
   </pre>
  <p>to</p>
!  <pre> istream_iterator&lt;T,charT,traits,Distance&gt; operator++(int);
   </pre>
  <p>(that is, remove the `&amp;').</p>
  
--- 11764,11775 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Change the declaration in 24.5.1.2, p5 from</p>
!  <pre>
!  istream_iterator&lt;T,charT,traits,Distance&gt;&amp; operator++(int);
   </pre>
  <p>to</p>
!  <pre>
!  istream_iterator&lt;T,charT,traits,Distance&gt; operator++(int);
   </pre>
  <p>(that is, remove the `&amp;').</p>
  
*************** given the Effects clause below (since a
*** 12528,12543 ****
  
  <hr>
  <h3><a name="261"></a>261. Missing description of <tt>istream_iterator::operator!=</tt></h3>
! <p><b>Section:</b> 24.6.1.2 [istream.iterator.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-08-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.iterator.ops">issues</a> in [istream.iterator.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  24.5.1, p3 lists the synopsis for
  </p>
  
! <pre>   template &lt;class T, class charT, class traits, class Distance&gt;
          bool operator!=(const istream_iterator&lt;T,charT,traits,Distance&gt;&amp; x,
                          const istream_iterator&lt;T,charT,traits,Distance&gt;&amp; y);
  </pre>
--- 11778,11794 ----
  
  <hr>
  <h3><a name="261"></a>261. Missing description of <tt>istream_iterator::operator!=</tt></h3>
! <p><b>Section:</b> 24.6.1.2 [istream.iterator.ops] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.iterator.ops">issues</a> in [istream.iterator.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  24.5.1, p3 lists the synopsis for
  </p>
  
! <pre>
!    template &lt;class T, class charT, class traits, class Distance&gt;
          bool operator!=(const istream_iterator&lt;T,charT,traits,Distance&gt;&amp; x,
                          const istream_iterator&lt;T,charT,traits,Distance&gt;&amp; y);
  </pre>
*************** or Returns clause) in 24.5.1.2.
*** 12553,12559 ****
  Add paragraph 7 to the end of section 24.5.1.2 with the following text:
  </p>
  
! <pre>   template &lt;class T, class charT, class traits, class Distance&gt;
          bool operator!=(const istream_iterator&lt;T,charT,traits,Distance&gt;&amp; x,
                          const istream_iterator&lt;T,charT,traits,Distance&gt;&amp; y);
  </pre>
--- 11804,11811 ----
  Add paragraph 7 to the end of section 24.5.1.2 with the following text:
  </p>
  
! <pre>
!    template &lt;class T, class charT, class traits, class Distance&gt;
          bool operator!=(const istream_iterator&lt;T,charT,traits,Distance&gt;&amp; x,
                          const istream_iterator&lt;T,charT,traits,Distance&gt;&amp; y);
  </pre>
*************** Add paragraph 7 to the end of section 24
*** 12565,12574 ****
  
  <hr>
  <h3><a name="262"></a>262. Bitmask operator ~ specified incorrectly</h3>
! <p><b>Section:</b> 17.5.2.1.3 [bitmask.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2000-09-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitmask.types">issues</a> in [bitmask.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The ~ operation should be applied after the cast to int_type.
--- 11817,11826 ----
  
  <hr>
  <h3><a name="262"></a>262. Bitmask operator ~ specified incorrectly</h3>
! <p><b>Section:</b> 17.5.2.1.3 [bitmask.types] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2000-09-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitmask.types">issues</a> in [bitmask.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The ~ operation should be applied after the cast to int_type.
*************** The ~ operation should be applied after
*** 12580,12586 ****
  Change 17.3.2.1.2 [lib.bitmask.types] operator~ from:
  </p>
  
! <pre>   bitmask operator~ ( bitmask X )
       { return static_cast&lt; bitmask&gt;(static_cast&lt;int_type&gt;(~ X)); }
  </pre>
  
--- 11832,11839 ----
  Change 17.3.2.1.2 [lib.bitmask.types] operator~ from:
  </p>
  
! <pre>
!    bitmask operator~ ( bitmask X )
       { return static_cast&lt; bitmask&gt;(static_cast&lt;int_type&gt;(~ X)); }
  </pre>
  
*************** Change 17.3.2.1.2 [lib.bitmask.types] op
*** 12588,12594 ****
  to:
  </p>
  
! <pre>   bitmask operator~ ( bitmask X )
       { return static_cast&lt; bitmask&gt;(~static_cast&lt;int_type&gt;(X)); }
  </pre>
  
--- 11841,11848 ----
  to:
  </p>
  
! <pre>
!    bitmask operator~ ( bitmask X )
       { return static_cast&lt; bitmask&gt;(~static_cast&lt;int_type&gt;(X)); }
  </pre>
  
*************** to:
*** 12597,12612 ****
  
  <hr>
  <h3><a name="263"></a>263. Severe restriction on <tt>basic_string</tt> reference counting</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Kevlin Henney <b>Opened:</b> 2000-09-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The note in paragraph 6 suggests that the invalidation rules for
  references, pointers, and iterators in paragraph 5 permit a reference-
  counted implementation (actually, according to paragraph 6, they permit
! a "reference counted implementation", but this is a minor editorial fix).
  </p>
  
  <p>
--- 11851,11867 ----
  
  <hr>
  <h3><a name="263"></a>263. Severe restriction on <tt>basic_string</tt> reference counting</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Kevlin Henney <b>Opened:</b> 2000-09-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The note in paragraph 6 suggests that the invalidation rules for
  references, pointers, and iterators in paragraph 5 permit a reference-
  counted implementation (actually, according to paragraph 6, they permit
! a &quot;reference counted implementation&quot;, but this is a minor editorial fix).
  </p>
  
  <p>
*************** implementation unviable. In the followin
*** 12615,12622 ****
  conditions for iterator invalidation are satisfied:
  </p>
  
! <pre>    // first example: "*******************" should be printed twice
!     string original = "some arbitrary text", copy = original;
      const string &amp; alias = original;
  
      string::const_iterator i = alias.begin(), e = alias.end();
--- 11870,11878 ----
  conditions for iterator invalidation are satisfied:
  </p>
  
! <pre>
!     // first example: &quot;*******************&quot; should be printed twice
!     string original = &quot;some arbitrary text&quot;, copy = original;
      const string &amp; alias = original;
  
      string::const_iterator i = alias.begin(), e = alias.end();
*************** conditions for iterator invalidation are
*** 12632,12639 ****
  Similarly, in the following example:
  </p>
  
! <pre>    // second example: "some arbitrary text" should be printed out
!     string original = "some arbitrary text", copy = original;
      const string &amp; alias = original;
  
      string::const_iterator i = alias.begin();
--- 11888,11896 ----
  Similarly, in the following example:
  </p>
  
! <pre>
!     // second example: &quot;some arbitrary text&quot; should be printed out
!     string original = &quot;some arbitrary text&quot;, copy = original;
      const string &amp; alias = original;
  
      string::const_iterator i = alias.begin();
*************** Similarly, in the following example:
*** 12645,12651 ****
  <p>
  I have tested this on three string implementations, two of which were
  reference counted. The reference-counted implementations gave
! "surprising behavior" because they invalidated iterators on
  the first call to non-const begin since construction. The current
  wording does not permit such invalidation because it does not take
  into account the first call since construction, only the first call
--- 11902,11908 ----
  <p>
  I have tested this on three string implementations, two of which were
  reference counted. The reference-counted implementations gave
! &quot;surprising behavior&quot; because they invalidated iterators on
  the first call to non-const begin since construction. The current
  wording does not permit such invalidation because it does not take
  into account the first call since construction, only the first call
*************** Change the following sentence in 21.3 pa
*** 12678,12689 ****
  
  <hr>
  <h3><a name="264"></a>264. Associative container <tt>insert(i, j)</tt> complexity requirements are not feasible.</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> John Potter <b>Opened:</b> 2000-09-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#102">102</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Table 69 requires linear time if [i, j) is sorted.  Sorted is necessary but not sufficient.
--- 11935,11946 ----
  
  <hr>
  <h3><a name="264"></a>264. Associative container <tt>insert(i, j)</tt> complexity requirements are not feasible.</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> John Potter <b>Opened:</b> 2000-09-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#102">102</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Table 69 requires linear time if [i, j) is sorted.  Sorted is necessary but not sufficient.
*************** Consider inserting a sorted range of eve
*** 12691,12706 ****
  integers in the same range.
  </p>
  
! <p><i>Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#102">102</a></i></p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  In Table 69, in section 23.1.2, change the complexity clause for
! insertion of a range from "N log(size() + N) (N is the distance
  from i to j) in general; linear if [i, j) is sorted according to
! value_comp()" to "N log(size() + N), where N is the distance
! from i to j".
  </p>
  
  <p><i>[Copenhagen: Minor fix in proposed resolution: fixed unbalanced
--- 11948,11963 ----
  integers in the same range.
  </p>
  
! <p><i>Related issue: <a href="lwg-closed.html#102">102</a></i></p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  In Table 69, in section 23.1.2, change the complexity clause for
! insertion of a range from &quot;N log(size() + N) (N is the distance
  from i to j) in general; linear if [i, j) is sorted according to
! value_comp()&quot; to &quot;N log(size() + N), where N is the distance
! from i to j&quot;.
  </p>
  
  <p><i>[Copenhagen: Minor fix in proposed resolution: fixed unbalanced
*************** linear in some special cases.
*** 12733,12742 ****
  
  <hr>
  <h3><a name="265"></a>265. std::pair::pair() effects overly restrictive</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-09-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I don't see any requirements on the types of the elements of the
--- 11990,11999 ----
  
  <hr>
  <h3><a name="265"></a>265. std::pair::pair() effects overly restrictive</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-09-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I don't see any requirements on the types of the elements of the
*************** the straightforward implementation is co
*** 12783,12791 ****
  
  <hr>
  <h3><a name="266"></a>266. bad_exception::~bad_exception() missing Effects clause</h3>
! <p><b>Section:</b> 18.8.2 [bad.exception] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-09-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The synopsis for std::bad_exception lists the function ~bad_exception()
--- 12040,12048 ----
  
  <hr>
  <h3><a name="266"></a>266. bad_exception::~bad_exception() missing Effects clause</h3>
! <p><b>Section:</b> 18.8.2 [bad.exception] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-09-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The synopsis for std::bad_exception lists the function ~bad_exception()
*************** described in clause 19.
*** 12818,12827 ****
  
  <hr>
  <h3><a name="268"></a>268. Typo in locale synopsis</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-10-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The synopsis of the class std::locale in 22.1.1 contains two typos:
  the semicolons after the declarations of the default ctor
--- 12075,12084 ----
  
  <hr>
  <h3><a name="268"></a>268. Typo in locale synopsis</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-10-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The synopsis of the class std::locale in 22.1.1 contains two typos:
  the semicolons after the declarations of the default ctor
*************** are missing.</p>
*** 12832,12845 ****
  <p><b>Proposed resolution:</b></p>
  <p>Add the missing semicolons, i.e., change</p>
  
! <pre>    //  construct/copy/destroy:
          locale() throw()
          locale(const locale&amp; other) throw()
  </pre>
  
  <p>in the synopsis in 22.1.1 to</p>
  
! <pre>    //  construct/copy/destroy:
          locale() throw();
          locale(const locale&amp; other) throw();
  </pre>
--- 12089,12104 ----
  <p><b>Proposed resolution:</b></p>
  <p>Add the missing semicolons, i.e., change</p>
  
! <pre>
!     //  construct/copy/destroy:
          locale() throw()
          locale(const locale&amp; other) throw()
  </pre>
  
  <p>in the synopsis in 22.1.1 to</p>
  
! <pre>
!     //  construct/copy/destroy:
          locale() throw();
          locale(const locale&amp; other) throw();
  </pre>
*************** are missing.</p>
*** 12849,12859 ****
  
  <hr>
  <h3><a name="270"></a>270. Binary search requirements overly strict</h3>
! <p><b>Section:</b> 25.4.3 [alg.binary.search] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-10-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.binary.search">issues</a> in [alg.binary.search].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#472">472</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Each of the four binary search algorithms (lower_bound, upper_bound,
--- 12108,12118 ----
  
  <hr>
  <h3><a name="270"></a>270. Binary search requirements overly strict</h3>
! <p><b>Section:</b> 25.4.3 [alg.binary.search] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-10-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.binary.search">issues</a> in [alg.binary.search].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#472">472</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Each of the four binary search algorithms (lower_bound, upper_bound,
*************** large record with an integer key.  We mi
*** 12869,12875 ****
  up a record by key, in which case we would want to write something
  like this:
  </p>
! <pre>    struct key_comp {
        bool operator()(const X&amp; x, int n) const {
          return x.key() &lt; n;
        }
--- 12128,12135 ----
  up a record by key, in which case we would want to write something
  like this:
  </p>
! <pre>
!     struct key_comp {
        bool operator()(const X&amp; x, int n) const {
          return x.key() &lt; n;
        }
*************** The proposed resolution is based on that
*** 13064,13070 ****
  
  <p>to:</p>
  
! <pre>   -2- Returns: 
           make_pair(lower_bound(first, last, value),
                     upper_bound(first, last, value))
         or
--- 12324,12331 ----
  
  <p>to:</p>
  
! <pre>
!    -2- Returns: 
           make_pair(lower_bound(first, last, value),
                     upper_bound(first, last, value))
         or
*************** part of that pair is the lower bound.</p
*** 13116,13124 ****
  
  <hr>
  <h3><a name="271"></a>271. basic_iostream missing typedefs</h3>
! <p><b>Section:</b> 27.7.1.5 [iostreamclass] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class template basic_iostream has no typedefs.  The typedefs it
--- 12377,12385 ----
  
  <hr>
  <h3><a name="271"></a>271. basic_iostream missing typedefs</h3>
! <p><b>Section:</b> 27.7.2.5 [iostreamclass] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class template basic_iostream has no typedefs.  The typedefs it
*************** basic_iostream&lt;T&gt;::traits_type is
*** 13130,13138 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>Add the following to basic_iostream's class synopsis in 
! 27.7.1.5 [iostreamclass], immediately after <tt>public</tt>:</p>
  
! <pre>  // types:
    typedef charT                     char_type;
    typedef typename traits::int_type int_type;
    typedef typename traits::pos_type pos_type;
--- 12391,12400 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>Add the following to basic_iostream's class synopsis in 
! 27.7.2.5 [iostreamclass], immediately after <tt>public</tt>:</p>
  
! <pre>
!   // types:
    typedef charT                     char_type;
    typedef typename traits::int_type int_type;
    typedef typename traits::pos_type pos_type;
*************** basic_iostream&lt;T&gt;::traits_type is
*** 13145,13155 ****
  
  <hr>
  <h3><a name="272"></a>272. Missing parentheses around subexpression</h3>
! <p><b>Section:</b> 27.5.4.3 [iostate.flags] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#569">569</a></p>
  <p><b>Discussion:</b></p>
  <p>
  27.4.4.3, p4 says about the postcondition of the function: If
--- 12407,12417 ----
  
  <hr>
  <h3><a name="272"></a>272. Missing parentheses around subexpression</h3>
! <p><b>Section:</b> 27.5.5.4 [iostate.flags] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#569">569</a></p>
  <p><b>Discussion:</b></p>
  <p>
  27.4.4.3, p4 says about the postcondition of the function: If
*************** Add parentheses like so: rdstate()==(sta
*** 13174,13183 ****
  
  <hr>
  <h3><a name="273"></a>273. Missing ios_base qualification on members of a dependent class</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.5.2.4.2, p4, and 27.8.1.6, p2, 27.8.1.7, p3, 27.8.1.9, p2,
  27.8.1.10, p3 refer to in and/or out w/o ios_base:: qualification.
--- 12436,12445 ----
  
  <hr>
  <h3><a name="273"></a>273. Missing ios_base qualification on members of a dependent class</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.5.2.4.2, p4, and 27.8.1.6, p2, 27.8.1.7, p3, 27.8.1.9, p2,
  27.8.1.10, p3 refer to in and/or out w/o ios_base:: qualification.
*************** members, i.e., ios_base.</p>
*** 13194,13203 ****
  
  <hr>
  <h3><a name="274"></a>274. a missing/impossible allocator requirement</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I see that table 31 in 20.1.5, p3 allows T in std::allocator&lt;T&gt; to be of
--- 12456,12466 ----
  
  <hr>
  <h3><a name="274"></a>274. a missing/impossible allocator requirement</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I see that table 31 in 20.1.5, p3 allows T in std::allocator&lt;T&gt; to be of
*************** The original text for proposed resolutio
*** 13254,13260 ****
  also forbids volatile types and reference types.
  </p>
  
! <p><i>[Curaçao: LWG double checked and believes volatile is correctly
  excluded from the PR.]</i></p>
  
  
--- 12517,12523 ----
  also forbids volatile types and reference types.
  </p>
  
! <p><i>[Cura&ccedil;ao: LWG double checked and believes volatile is correctly
  excluded from the PR.]</i></p>
  
  
*************** excluded from the PR.]</i></p>
*** 13265,13274 ****
  
  <hr>
  <h3><a name="275"></a>275. Wrong type in num_get::get() overloads</h3>
! <p><b>Section:</b> 22.4.2.1.1 [facet.num.get.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.members">issues</a> in [facet.num.get.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 22.2.2.1.1, we have a list of overloads for num_get&lt;&gt;::get().
--- 12528,12537 ----
  
  <hr>
  <h3><a name="275"></a>275. Wrong type in num_get::get() overloads</h3>
! <p><b>Section:</b> 22.4.2.1.1 [facet.num.get.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2000-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.members">issues</a> in [facet.num.get.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 22.2.2.1.1, we have a list of overloads for num_get&lt;&gt;::get().
*************** the arguments it was given.
*** 13311,13321 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.4.2.1.1 [facet.num.get.members], change</p>
! <pre>  iter_type get(iter_type in, iter_type end, ios_base&amp; str,
                  ios_base::iostate&amp; err, short&amp; val) const;
  </pre>
  <p>to</p>
! <pre>  iter_type get(iter_type in, iter_type end, ios_base&amp; str,
                  ios_base::iostate&amp; err, float&amp; val) const;
  </pre>
  
--- 12574,12586 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>In 22.4.2.1.1 [facet.num.get.members], change</p>
! <pre>
!   iter_type get(iter_type in, iter_type end, ios_base&amp; str,
                  ios_base::iostate&amp; err, short&amp; val) const;
  </pre>
  <p>to</p>
! <pre>
!   iter_type get(iter_type in, iter_type end, ios_base&amp; str,
                  ios_base::iostate&amp; err, float&amp; val) const;
  </pre>
  
*************** the arguments it was given.
*** 13324,13337 ****
  
  <hr>
  <h3><a name="276"></a>276. Assignable requirement for container value type overly strict</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2000-11-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  23.1/3 states that the objects stored in a container must be
! Assignable.  23.6.1 [map], paragraph 2,
  states that map satisfies all requirements for a container, while in
  the same time defining value_type as pair&lt;const Key, T&gt; - a type
  that is not Assignable.
--- 12589,12603 ----
  
  <hr>
  <h3><a name="276"></a>276. Assignable requirement for container value type overly strict</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2000-11-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  23.1/3 states that the objects stored in a container must be
! Assignable.  23.4.4 [map], paragraph 2,
  states that map satisfies all requirements for a container, while in
  the same time defining value_type as pair&lt;const Key, T&gt; - a type
  that is not Assignable.
*************** that is not Assignable.
*** 13340,13347 ****
  <p>
  It should be noted that there exists a valid and non-contradictory
  interpretation of the current text. The wording in 23.1/3 avoids 
! mentioning value_type, referring instead to "objects stored in a
! container." One might argue that map does not store objects of
  type map::value_type, but of map::mapped_type instead, and that the
  Assignable requirement applies to map::mapped_type, not
  map::value_type.
--- 12606,12613 ----
  <p>
  It should be noted that there exists a valid and non-contradictory
  interpretation of the current text. The wording in 23.1/3 avoids 
! mentioning value_type, referring instead to &quot;objects stored in a
! container.&quot; One might argue that map does not store objects of
  type map::value_type, but of map::mapped_type instead, and that the
  Assignable requirement applies to map::mapped_type, not
  map::value_type.
*************** general.
*** 13355,13368 ****
  
  <p>
  For example, the proposed resolution of active library issue 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#103">103</a> is to make set::iterator a constant iterator; this
  means that no set operations can exploit the fact that the stored
  objects are Assignable.
  </p>
  
  <p>
  This is related to, but slightly broader than, closed issue
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#140">140</a>.
  </p>
  
  
--- 12621,12634 ----
  
  <p>
  For example, the proposed resolution of active library issue 
! <a href="lwg-defects.html#103">103</a> is to make set::iterator a constant iterator; this
  means that no set operations can exploit the fact that the stored
  objects are Assignable.
  </p>
  
  <p>
  This is related to, but slightly broader than, closed issue
! <a href="lwg-closed.html#140">140</a>.
  </p>
  
  
*************** following methods are instantiated:
*** 13424,13430 ****
  [Footnote: Implementors are permitted but not required to take advantage 
  of T's Assignable properties for these methods. -- end foonote]
  </p>
! <pre>     list&lt;T,Allocator&gt;&amp; operator=(const list&lt;T,Allocator&gt;&amp;  x );
       template &lt;class InputIterator&gt;
         void assign(InputIterator first, InputIterator last);
       void assign(size_type n, const T&amp; t);
--- 12690,12697 ----
  [Footnote: Implementors are permitted but not required to take advantage 
  of T's Assignable properties for these methods. -- end foonote]
  </p>
! <pre>
!      list&lt;T,Allocator&gt;&amp; operator=(const list&lt;T,Allocator&gt;&amp;  x );
       template &lt;class InputIterator&gt;
         void assign(InputIterator first, InputIterator last);
       void assign(size_type n, const T&amp; t);
*************** to forbid such implementations.</p>
*** 13462,13468 ****
  
  <p>Note that the type stored in a standard container must still satisfy
  the requirements of the container's allocator; this rules out, for
! example, such types as "const int".  See issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#274">274</a>
  for more details.
  </p>
  
--- 12729,12735 ----
  
  <p>Note that the type stored in a standard container must still satisfy
  the requirements of the container's allocator; this rules out, for
! example, such types as "const int".  See issue <a href="lwg-defects.html#274">274</a>
  for more details.
  </p>
  
*************** implement <tt>vector::push_back</tt> in
*** 13479,13500 ****
  
  <hr>
  <h3><a name="278"></a>278. What does iterator validity mean?</h3>
! <p><b>Section:</b> 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2000-11-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 23.3.4.4 [list.ops] states that
  </p>
! <pre>  void splice(iterator position, list&lt;T, Allocator&gt;&amp; x);
  </pre>
  <p>
  <i>invalidates</i> all iterators and references to list <tt>x</tt>.
  </p>
  
  <p>
! But what does the C++ Standard mean by "invalidate"?  You
  can still dereference the iterator to a spliced list element, but
  you'd better not use it to delimit a range within the original
  list. For the latter operation, it has definitely lost some of its
--- 12746,12768 ----
  
  <hr>
  <h3><a name="278"></a>278. What does iterator validity mean?</h3>
! <p><b>Section:</b> 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2000-11-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 23.3.5.5 [list.ops] states that
  </p>
! <pre>
!   void splice(iterator position, list&lt;T, Allocator&gt;&amp; x);
  </pre>
  <p>
  <i>invalidates</i> all iterators and references to list <tt>x</tt>.
  </p>
  
  <p>
! But what does the C++ Standard mean by &quot;invalidate&quot;?  You
  can still dereference the iterator to a spliced list element, but
  you'd better not use it to delimit a range within the original
  list. For the latter operation, it has definitely lost some of its
*************** validity.
*** 13502,13514 ****
  </p>
  
  <p>
! If we accept the proposed resolution to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#250">250</a>,
! then we'd better clarify that a "valid" iterator need no
  longer designate an element within the same container as it once did.
  We then have to clarify what we mean by invalidating a past-the-end
  iterator, as when a vector or string grows by reallocation. Clearly,
  such an iterator has a different kind of validity. Perhaps we should
! introduce separate terms for the two kinds of "validity."
  </p>
  
  
--- 12770,12782 ----
  </p>
  
  <p>
! If we accept the proposed resolution to issue <a href="lwg-defects.html#250">250</a>,
! then we'd better clarify that a &quot;valid&quot; iterator need no
  longer designate an element within the same container as it once did.
  We then have to clarify what we mean by invalidating a past-the-end
  iterator, as when a vector or string grows by reallocation. Clearly,
  such an iterator has a different kind of validity. Perhaps we should
! introduce separate terms for the two kinds of &quot;validity.&quot;
  </p>
  
  
*************** the wording.  Dave provided new wording.
*** 13549,13578 ****
  
  <hr>
  <h3><a name="280"></a>280. Comparison of reverse_iterator to const reverse_iterator</h3>
! <p><b>Section:</b> 24.5.1 [reverse.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Cleary <b>Opened:</b> 2000-11-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This came from an email from Steve Cleary to Fergus in reference to
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#179">179</a>. The library working group briefly discussed
  this in Toronto and believed it should be a separate issue.  There was
  also some reservations about whether this was a worthwhile problem to
  fix.
  </p>
  
  <p>
! Steve said: "Fixing reverse_iterator. std::reverse_iterator can
  (and should) be changed to preserve these additional
! requirements." He also said in email that it can be done without
! breaking user's code: "If you take a look at my suggested
  solution, reverse_iterator doesn't have to take two parameters; there
  is no danger of breaking existing code, except someone taking the
  address of one of the reverse_iterator global operator functions, and
  I have to doubt if anyone has ever done that. . .  <i>But</i>, just in
  case they have, you can leave the old global functions in as well --
  they won't interfere with the two-template-argument functions.  With
! that, I don't see how <i>any</i> user code could break."
  </p>
  
  
--- 12817,12847 ----
  
  <hr>
  <h3><a name="280"></a>280. Comparison of reverse_iterator to const reverse_iterator</h3>
! <p><b>Section:</b> 24.5.1 [reverse.iterators] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Cleary <b>Opened:</b> 2000-11-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reverse.iterators">issues</a> in [reverse.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This came from an email from Steve Cleary to Fergus in reference to
! issue <a href="lwg-defects.html#179">179</a>. The library working group briefly discussed
  this in Toronto and believed it should be a separate issue.  There was
  also some reservations about whether this was a worthwhile problem to
  fix.
  </p>
  
  <p>
! Steve said: &quot;Fixing reverse_iterator. std::reverse_iterator can
  (and should) be changed to preserve these additional
! requirements.&quot; He also said in email that it can be done without
! breaking user's code: &quot;If you take a look at my suggested
  solution, reverse_iterator doesn't have to take two parameters; there
  is no danger of breaking existing code, except someone taking the
  address of one of the reverse_iterator global operator functions, and
  I have to doubt if anyone has ever done that. . .  <i>But</i>, just in
  case they have, you can leave the old global functions in as well --
  they won't interfere with the two-template-argument functions.  With
! that, I don't see how <i>any</i> user code could break.&quot;
  </p>
  
  
*************** that, I don't see how <i>any</i> user co
*** 13580,13586 ****
  <p>
  <b>Section:</b> 24.5.1.1 [reverse.iterator]
  add/change the following declarations:</p>
! <pre>  A) Add a templated assignment operator, after the same manner
          as the templated copy constructor, i.e.:
  
    template &lt; class U &gt;
--- 12849,12856 ----
  <p>
  <b>Section:</b> 24.5.1.1 [reverse.iterator]
  add/change the following declarations:</p>
! <pre>
!   A) Add a templated assignment operator, after the same manner
          as the templated copy constructor, i.e.:
  
    template &lt; class U &gt;
*************** this solution is safe and correct.
*** 13629,13643 ****
  
  <hr>
  <h3><a name="281"></a>281. std::min() and max() requirements overly restrictive</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-12-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#486">486</a></p>
  <p><b>Discussion:</b></p>
  <p>The requirements in 25.3.7, p1 and 4 call for T to satisfy the
  requirements of <tt>LessThanComparable</tt> ( [lessthancomparable])
! and <tt>CopyConstructible</tt> (20.2.1 [utility.arg.requirements]).
  Since the functions take and return their arguments and result by
  const reference, I believe the <tt>CopyConstructible</tt> requirement
  is unnecessary.
--- 12899,12913 ----
  
  <hr>
  <h3><a name="281"></a>281. std::min() and max() requirements overly restrictive</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-12-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#486">486</a></p>
  <p><b>Discussion:</b></p>
  <p>The requirements in 25.3.7, p1 and 4 call for T to satisfy the
  requirements of <tt>LessThanComparable</tt> ( [lessthancomparable])
! and <tt>CopyConstructible</tt> (17.6.3.1 [utility.arg.requirements]).
  Since the functions take and return their arguments and result by
  const reference, I believe the <tt>CopyConstructible</tt> requirement
  is unnecessary.
*************** is unnecessary.
*** 13660,13669 ****
  
  <hr>
  <h3><a name="282"></a>282. What types does numpunct grouping refer to?</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2000-12-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 16 mistakenly singles out integral types for inserting 
--- 12930,12939 ----
  
  <hr>
  <h3><a name="282"></a>282. What types does numpunct grouping refer to?</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2000-12-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 16 mistakenly singles out integral types for inserting 
*************** standard.
*** 13708,13714 ****
  ]</i></p>
  
  
! <p><i>[Post-Curaçao: the above proposed resolution is the consensus of
  Howard, Bill, Pete, Benjamin, Nathan, Dietmar, Boris, and Martin.]</i></p>
  
  
--- 12978,12984 ----
  ]</i></p>
  
  
! <p><i>[Post-Cura&ccedil;ao: the above proposed resolution is the consensus of
  Howard, Bill, Pete, Benjamin, Nathan, Dietmar, Boris, and Martin.]</i></p>
  
  
*************** Howard, Bill, Pete, Benjamin, Nathan, Di
*** 13718,13728 ****
  
  <hr>
  <h3><a name="283"></a>283. std::replace() requirement incorrect/insufficient</h3>
! <p><b>Section:</b> 25.3.5 [alg.replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-12-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.replace">issues</a> in [alg.replace].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#483">483</a></p>
  <p><b>Discussion:</b></p>
  <p>
  (revision of the further discussion)
--- 12988,12998 ----
  
  <hr>
  <h3><a name="283"></a>283. std::replace() requirement incorrect/insufficient</h3>
! <p><b>Section:</b> 25.3.5 [alg.replace] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.replace">issues</a> in [alg.replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#483">483</a></p>
  <p><b>Discussion:</b></p>
  <p>
  (revision of the further discussion)
*************** imposing a greater restriction that what
*** 13880,13894 ****
  
  <hr>
  <h3><a name="284"></a>284. unportable example in 20.3.7, p6</h3>
! <p><b>Section:</b> 20.8.6 [comparisons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-12-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The example in 20.8.6 [comparisons], p6 shows how to use the C
  library function <tt>strcmp()</tt> with the function pointer adapter
  <tt>ptr_fun()</tt>. But since it's unspecified whether the C library
! functions have <tt>extern "C"</tt> or <tt>extern
! "C++"</tt> linkage [17.6.2.3 [using.linkage]], and since
  function pointers with different the language linkage specifications
  (7.5 [dcl.link]) are incompatible, whether this example is
  well-formed is unspecified.
--- 13150,13166 ----
  
  <hr>
  <h3><a name="284"></a>284. unportable example in 20.3.7, p6</h3>
! <p><b>Section:</b> 20.9.6 [comparisons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-12-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#comparisons">active issues</a> in [comparisons].</p>
! <p><b>View all other</b> <a href="lwg-index.html#comparisons">issues</a> in [comparisons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The example in 20.9.6 [comparisons], p6 shows how to use the C
  library function <tt>strcmp()</tt> with the function pointer adapter
  <tt>ptr_fun()</tt>. But since it's unspecified whether the C library
! functions have <tt>extern &quot;C&quot;</tt> or <tt>extern
! &quot;C++&quot;</tt> linkage [17.6.2.3 [using.linkage]], and since
  function pointers with different the language linkage specifications
  (7.5 [dcl.link]) are incompatible, whether this example is
  well-formed is unspecified.
*************** well-formed is unspecified.
*** 13896,13905 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 20.8.6 [comparisons] paragraph 6 from:</p>
  <blockquote>
    <p>[<i>Example:</i></p>
!   <pre>    replace_if(v.begin(), v.end(), not1(bind2nd(ptr_fun(strcmp), "C")), "C++");
    </pre>
    <p>replaces each <tt>C</tt> with <tt>C++</tt> in sequence <tt>v</tt>.</p>
  </blockquote>
--- 13168,13178 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 20.9.6 [comparisons] paragraph 6 from:</p>
  <blockquote>
    <p>[<i>Example:</i></p>
!   <pre>
!     replace_if(v.begin(), v.end(), not1(bind2nd(ptr_fun(strcmp), "C")), "C++");
    </pre>
    <p>replaces each <tt>C</tt> with <tt>C++</tt> in sequence <tt>v</tt>.</p>
  </blockquote>
*************** well-formed is unspecified.
*** 13908,13914 ****
  <p>to:</p>
  <blockquote>
    <p>[<i>Example:</i></p>
!   <pre>    int compare(const char*, const char*);
      replace_if(v.begin(), v.end(),
                 not1(bind2nd(ptr_fun(compare), "abc")), "def");
    </pre>
--- 13181,13188 ----
  <p>to:</p>
  <blockquote>
    <p>[<i>Example:</i></p>
!   <pre>
!     int compare(const char*, const char*);
      replace_if(v.begin(), v.end(),
                 not1(bind2nd(ptr_fun(compare), "abc")), "def");
    </pre>
*************** it corresponds to the new code fragment.
*** 13935,13943 ****
  
  <hr>
  <h3><a name="285"></a>285. minor editorial errors in fstream ctors</h3>
! <p><b>Section:</b> 27.9.1.7 [ifstream.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-12-31 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.9.1.7 [ifstream.cons], p2, 27.9.1.11 [ofstream.cons], p2, and
  27.9.1.15 [fstream.cons], p2 say about the effects of each constructor:
--- 13209,13217 ----
  
  <hr>
  <h3><a name="285"></a>285. minor editorial errors in fstream ctors</h3>
! <p><b>Section:</b> 27.9.1.7 [ifstream.cons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2000-12-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.9.1.7 [ifstream.cons], p2, 27.9.1.11 [ofstream.cons], p2, and
  27.9.1.15 [fstream.cons], p2 say about the effects of each constructor:
*************** it corresponds to the new code fragment.
*** 13948,13954 ****
  </p>
  
  <p>The parenthetical note doesn't apply since the ctors cannot throw an
! exception due to the requirement in 27.5.4.1 [basic.ios.cons], p3 
  that <tt>exceptions()</tt> be initialized to <tt>ios_base::goodbit</tt>.
  </p>
  
--- 13222,13228 ----
  </p>
  
  <p>The parenthetical note doesn't apply since the ctors cannot throw an
! exception due to the requirement in 27.5.5.2 [basic.ios.cons], p3 
  that <tt>exceptions()</tt> be initialized to <tt>ios_base::goodbit</tt>.
  </p>
  
*************** paragraphs mentioned above.
*** 13964,13973 ****
  
  <hr>
  <h3><a name="286"></a>286. &lt;cstdlib&gt; requirements missing size_t typedef</h3>
! <p><b>Section:</b> 25.5 [alg.c.library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-12-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.c.library">issues</a> in [alg.c.library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The &lt;cstdlib&gt; header file contains prototypes for bsearch and
--- 13238,13247 ----
  
  <hr>
  <h3><a name="286"></a>286. &lt;cstdlib&gt; requirements missing size_t typedef</h3>
! <p><b>Section:</b> 25.5 [alg.c.library] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-12-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.c.library">issues</a> in [alg.c.library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The &lt;cstdlib&gt; header file contains prototypes for bsearch and
*************** the type size_t &lt;cstdlib&gt; to Table
*** 13994,14007 ****
  
  <hr>
  <h3><a name="288"></a>288. &lt;cerrno&gt; requirements missing macro EILSEQ</h3>
! <p><b>Section:</b> 19.4 [errno] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-12-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! ISO/IEC 9899:1990/Amendment1:1994 Section 4.3 States: "The list
  of macros defined in &lt;errno.h&gt; is adjusted to include a new
! macro, EILSEQ"
  </p>
  
  <p>
--- 13268,13281 ----
  
  <hr>
  <h3><a name="288"></a>288. &lt;cerrno&gt; requirements missing macro EILSEQ</h3>
! <p><b>Section:</b> 19.4 [errno] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Judy Ward <b>Opened:</b> 2000-12-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! ISO/IEC 9899:1990/Amendment1:1994 Section 4.3 States: &quot;The list
  of macros defined in &lt;errno.h&gt; is adjusted to include a new
! macro, EILSEQ&quot;
  </p>
  
  <p>
*************** to the above amendment.
*** 14013,14020 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Update Table 26 (section 19.3) "Header  &lt;cerrno&gt; synopsis"
! and Table 95 (section C.2) "Standard Macros" to include EILSEQ.
  </p>
  
  
--- 13287,13294 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Update Table 26 (section 19.3) &quot;Header  &lt;cerrno&gt; synopsis&quot;
! and Table 95 (section C.2) &quot;Standard Macros&quot; to include EILSEQ.
  </p>
  
  
*************** and Table 95 (section C.2) "Standard Mac
*** 14023,14032 ****
  
  <hr>
  <h3><a name="291"></a>291. Underspecification of set algorithms</h3>
! <p><b>Section:</b> 25.4.5 [alg.set.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2001-01-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.set.operations">issues</a> in [alg.set.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard library contains four algorithms that compute set
--- 13297,13306 ----
  
  <hr>
  <h3><a name="291"></a>291. Underspecification of set algorithms</h3>
! <p><b>Section:</b> 25.4.5 [alg.set.operations] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2001-01-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.set.operations">issues</a> in [alg.set.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard library contains four algorithms that compute set
*************** in the output range are sorted.
*** 14040,14046 ****
  <p>
  The ordinary mathematical definitions are generalized so that they
  apply to ranges containing multiple copies of a given element.  Two
! elements are considered to be "the same" if, according to an
  ordering relation provided by the user, neither one is less than the
  other.  So, for example, if one input range contains five copies of an
  element and another contains three, the output range of <tt>set_union</tt>
--- 13314,13320 ----
  <p>
  The ordinary mathematical definitions are generalized so that they
  apply to ranges containing multiple copies of a given element.  Two
! elements are considered to be &quot;the same&quot; if, according to an
  ordering relation provided by the user, neither one is less than the
  other.  So, for example, if one input range contains five copies of an
  element and another contains three, the output range of <tt>set_union</tt>
*************** will contain five copies, the output ran
*** 14051,14057 ****
  </p>
  
  <p>
! Because two elements can be "the same" for the purposes
  of these set algorithms, without being identical in other respects
  (consider, for example, strings under case-insensitive comparison),
  this raises a number of unanswered questions:
--- 13325,13331 ----
  </p>
  
  <p>
! Because two elements can be &quot;the same&quot; for the purposes
  of these set algorithms, without being identical in other respects
  (consider, for example, strings under case-insensitive comparison),
  this raises a number of unanswered questions:
*************** m</i> of these elements from [first2, la
*** 14139,14148 ****
  
  <hr>
  <h3><a name="292"></a>292. effects of a.copyfmt (a)</h3>
! <p><b>Section:</b> 27.5.4.2 [basic.ios.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-01-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The Effects clause of the member function <tt>copyfmt()</tt> in
  27.4.4.2, p15 doesn't consider the case where the left-hand side
--- 13413,13422 ----
  
  <hr>
  <h3><a name="292"></a>292. effects of a.copyfmt (a)</h3>
! <p><b>Section:</b> 27.5.5.3 [basic.ios.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-01-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The Effects clause of the member function <tt>copyfmt()</tt> in
  27.4.4.2, p15 doesn't consider the case where the left-hand side
*************** objects of <tt>rhs</tt>, except that...
*** 14178,14194 ****
  
  <hr>
  <h3><a name="294"></a>294. User defined macros and standard headers</h3>
! <p><b>Section:</b> 17.6.3.3.1 [macro.names] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2001-01-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#macro.names">issues</a> in [macro.names].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 2 of 17.6.3.3.1 [macro.names] reads: "A
  translation unit that includes a header shall not contain any macros
! that define names declared in that header." As I read this, it
  would mean that the following program is legal:</p>
  
! <pre>  #define npos 3.14
    #include &lt;sstream&gt;
  </pre>
  
--- 13452,13469 ----
  
  <hr>
  <h3><a name="294"></a>294. User defined macros and standard headers</h3>
! <p><b>Section:</b> 17.6.4.3.1 [macro.names] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2001-01-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#macro.names">issues</a> in [macro.names].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Paragraph 2 of 17.6.4.3.1 [macro.names] reads: &quot;A
  translation unit that includes a header shall not contain any macros
! that define names declared in that header.&quot; As I read this, it
  would mean that the following program is legal:</p>
  
! <pre>
!   #define npos 3.14
    #include &lt;sstream&gt;
  </pre>
  
*************** which &lt;sstream&gt; didn't include &lt
*** 14199,14210 ****
  <p>I think that this phrase was probably formulated before it was
  decided that a standard header may freely include other standard
  headers.  The phrase would be perfectly appropriate for C, for
! example.  In light of 17.6.4.2 [res.on.headers] paragraph 1, however,
  it isn't stringent enough.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>For 17.6.3.3.1 [macro.names], replace the current wording, which reads:</p>
  <blockquote>
       <p>Each name defined as a macro in a header is reserved to the
       implementation for any use if the translation unit includes
--- 13474,13485 ----
  <p>I think that this phrase was probably formulated before it was
  decided that a standard header may freely include other standard
  headers.  The phrase would be perfectly appropriate for C, for
! example.  In light of 17.6.5.2 [res.on.headers] paragraph 1, however,
  it isn't stringent enough.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>For 17.6.4.3.1 [macro.names], replace the current wording, which reads:</p>
  <blockquote>
       <p>Each name defined as a macro in a header is reserved to the
       implementation for any use if the translation unit includes
*************** it isn't stringent enough.</p>
*** 14238,14247 ****
  
  <hr>
  <h3><a name="295"></a>295. Is abs defined in &lt;cmath&gt;?</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2001-01-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 80 lists the contents of the &lt;cmath&gt; header.  It does not
--- 13513,13523 ----
  
  <hr>
  <h3><a name="295"></a>295. Is abs defined in &lt;cmath&gt;?</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2001-01-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 80 lists the contents of the &lt;cmath&gt; header.  It does not
*************** rid of that vestigial list of functions
*** 14268,14274 ****
  <p>All this DR does is fix a typo; it's uncontroversial.  A 
  separate question is whether we're doing the right thing in 
  putting some overloads in &lt;cmath&gt; that we aren't also 
! putting in &lt;cstdlib&gt;.  That's issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#323">323</a>.</p>
  
  
  
--- 13544,13550 ----
  <p>All this DR does is fix a typo; it's uncontroversial.  A 
  separate question is whether we're doing the right thing in 
  putting some overloads in &lt;cmath&gt; that we aren't also 
! putting in &lt;cstdlib&gt;.  That's issue <a href="lwg-closed.html#323">323</a>.</p>
  
  
  
*************** putting in &lt;cstdlib&gt;.  That's issu
*** 14276,14287 ****
  
  <hr>
  <h3><a name="296"></a>296. Missing descriptions and requirements of pair operators</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-01-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The synopsis of the header <tt>&lt;utility&gt;</tt> in 20.3 [utility]
  lists the complete set of equality and relational operators for <tt>pair</tt>
  but the section describing the template and the operators only describes
  <tt>operator==()</tt> and <tt>operator&lt;()</tt>, and it fails to mention
--- 13552,13563 ----
  
  <hr>
  <h3><a name="296"></a>296. Missing descriptions and requirements of pair operators</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-01-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>The synopsis of the header <tt>&lt;utility></tt> in 20.2 [utility]
  lists the complete set of equality and relational operators for <tt>pair</tt>
  but the section describing the template and the operators only describes
  <tt>operator==()</tt> and <tt>operator&lt;()</tt>, and it fails to mention
*************** precedes <tt>pair</tt> in the document t
*** 14306,14312 ****
  Reading the current working paper I make two observations:
  </p>
  
! <ol type="i">
  <li>
  relops no longer immediately precedes <tt>pair</tt> in the order of
  specification.  However, even if it did, there is a lot of <tt>pair</tt>
--- 13582,13588 ----
  Reading the current working paper I make two observations:
  </p>
  
! <ol style="list-style-type:lower-roman">
  <li>
  relops no longer immediately precedes <tt>pair</tt> in the order of
  specification.  However, even if it did, there is a lot of <tt>pair</tt>
*************** manner that could have deferred to the r
*** 14323,14329 ****
  </li>
  </ol>
  
! <blockquote><pre>tuple
  unique_ptr
  duration
  time_point
--- 13599,13606 ----
  </li>
  </ol>
  
! <blockquote><pre>
! tuple
  unique_ptr
  duration
  time_point
*************** with the rest of the library.
*** 14369,14375 ****
  </blockquote>
  
  <p><i>[
! 2009-10-11 Daniel opens <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1233">1233</a> which deals with the same issue as
  it pertains to <tt>unique_ptr</tt>.
  ]</i></p>
  
--- 13646,13652 ----
  </blockquote>
  
  <p><i>[
! 2009-10-11 Daniel opens <a href="lwg-closed.html#1233">1233</a> which deals with the same issue as
  it pertains to <tt>unique_ptr</tt>.
  ]</i></p>
  
*************** it pertains to <tt>unique_ptr</tt>.
*** 14379,14434 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! After p20 20.3.5 [pairs] add:
  </p>
  
! <blockquote><pre>template &lt;class T1, class T2&gt;
  bool operator!=(const pair&lt;T1,T2&gt;&amp; x, const pair&lt;T1,T2&gt;&amp; y);
  </pre>
  
! <blockquote>
  <i>Returns:</i> <tt>!(x==y)</tt>
! </blockquote>
  
! <pre>template &lt;class T1, class T2&gt;
  bool operator&gt; (const pair&lt;T1,T2&gt;&amp; x, const pair&lt;T1,T2&gt;&amp; y);
  </pre>
  
! <blockquote>
  <i>Returns:</i> <tt>y &lt; x</tt>
! </blockquote>
  
! <pre>template &lt;class T1, class T2&gt;
  bool operator&gt;=(const pair&lt;T1,T2&gt;&amp; x, const pair&lt;T1,T2&gt;&amp; y);
  </pre>
  
! <blockquote>
  <i>Returns:</i> <tt>!(x &lt; y)</tt>
! </blockquote>
  
! <pre>template &lt;class T1, class T2&gt;
  bool operator&lt;=(const pair&lt;T1,T2&gt;&amp; x, const pair&lt;T1,T2&gt;&amp; y);
  </pre>
  
! <blockquote>
  <i>Returns:</i> <tt>!(y &lt; x)</tt>
! </blockquote>
  </blockquote>
  
  
  <p><b>Rationale:</b></p>
! <p>20.3.1 [operators] paragraph 10 already specifies the semantics.
  That paragraph says that, if declarations of operator!=, operator&gt;,
  operator&lt;=, and operator&gt;= appear without definitions, they are
! defined as specified in 20.3.1 [operators].  There should be no user
  confusion, since that paragraph happens to immediately precede the
  specification of <tt>pair</tt>.</p>
  
--- 13656,13715 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! After p20 20.3 [pairs] add:
  </p>
  
! <blockquote><pre>
! template &lt;class T1, class T2&gt;
  bool operator!=(const pair&lt;T1,T2&gt;&amp; x, const pair&lt;T1,T2&gt;&amp; y);
  </pre>
  
! <blockquote><p>
  <i>Returns:</i> <tt>!(x==y)</tt>
! </p></blockquote>
  
! <pre>
! template &lt;class T1, class T2&gt;
  bool operator&gt; (const pair&lt;T1,T2&gt;&amp; x, const pair&lt;T1,T2&gt;&amp; y);
  </pre>
  
! <blockquote><p>
  <i>Returns:</i> <tt>y &lt; x</tt>
! </p></blockquote>
  
! <pre>
! template &lt;class T1, class T2&gt;
  bool operator&gt;=(const pair&lt;T1,T2&gt;&amp; x, const pair&lt;T1,T2&gt;&amp; y);
  </pre>
  
! <blockquote><p>
  <i>Returns:</i> <tt>!(x &lt; y)</tt>
! </p></blockquote>
  
! <pre>
! template &lt;class T1, class T2&gt;
  bool operator&lt;=(const pair&lt;T1,T2&gt;&amp; x, const pair&lt;T1,T2&gt;&amp; y);
  </pre>
  
! <blockquote><p>
  <i>Returns:</i> <tt>!(y &lt; x)</tt>
! </p></blockquote>
  </blockquote>
  
  
  <p><b>Rationale:</b></p>
! <p>20.2.1 [operators] paragraph 10 already specifies the semantics.
  That paragraph says that, if declarations of operator!=, operator&gt;,
  operator&lt;=, and operator&gt;= appear without definitions, they are
! defined as specified in 20.2.1 [operators].  There should be no user
  confusion, since that paragraph happens to immediately precede the
  specification of <tt>pair</tt>.</p>
  
*************** specification of <tt>pair</tt>.</p>
*** 14438,14452 ****
  
  <hr>
  <h3><a name="297"></a>297. const_mem_fun_t&lt;&gt;::argument_type should be const T*</h3>
! <p><b>Section:</b> 20.8.7 [logical.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-01-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The class templates <tt>const_mem_fun_t</tt> in 20.5.8, p8 and
  <tt>const_mem_fun1_t</tt>
! in 20.5.8, p9 derive from <tt>unary_function&lt;T*, S&gt;</tt>, and
  <tt>binary_function&lt;T*,
! A, S&gt;</tt>, respectively. Consequently, their <tt>argument_type</tt>, and
  <tt>first_argument_type</tt>
  members, respectively, are both defined to be <tt>T*</tt> (non-const).
  However, their function call member operator takes a <tt>const T*</tt>
--- 13719,13733 ----
  
  <hr>
  <h3><a name="297"></a>297. const_mem_fun_t&lt;&gt;::argument_type should be const T*</h3>
! <p><b>Section:</b> 20.9.7 [logical.operations] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-01-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The class templates <tt>const_mem_fun_t</tt> in 20.5.8, p8 and
  <tt>const_mem_fun1_t</tt>
! in 20.5.8, p9 derive from <tt>unary_function&lt;T*, S></tt>, and
  <tt>binary_function&lt;T*,
! A, S></tt>, respectively. Consequently, their <tt>argument_type</tt>, and
  <tt>first_argument_type</tt>
  members, respectively, are both defined to be <tt>T*</tt> (non-const).
  However, their function call member operator takes a <tt>const T*</tt>
*************** example below derived from existing code
*** 14456,14486 ****
  discrepancy:
  </p>
  
! <p><tt>template &lt;class T&gt;</tt>
! <br><tt>void foo (typename T::argument_type arg)&nbsp;&nbsp; // #1</tt>
! <br><tt>{</tt>
! <br><tt>&nbsp;&nbsp;&nbsp; typename T::result_type (T::*pf) (typename
  T::argument_type)
  const =&nbsp;&nbsp; // #2</tt>
! <br><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &amp;T::operator();</tt>
! <br><tt>}</tt>
  </p>
  
  <p><tt>struct X { /* ... */ };</tt></p>
  
  <p><tt>int main ()</tt>
! <br><tt>{</tt>
! <br><tt>&nbsp;&nbsp;&nbsp; const X x;</tt>
! <br><tt>&nbsp;&nbsp;&nbsp; foo&lt;std::const_mem_fun_t&lt;void, X&gt;
! &gt;(&amp;x);&nbsp;&nbsp;
  // #3</tt>
! <br><tt>}</tt>
  </p>
  
  <p>#1 <tt>foo()</tt> takes a plain unqualified <tt>X*</tt> as an argument
! <br>#2 the type of the pointer is incompatible with the type of the member
  function
! <br>#3 the address of a constant being passed to a function taking a non-const
  <tt>X*</tt>
  </p>
  
--- 13737,13767 ----
  discrepancy:
  </p>
  
! <p><tt>template &lt;class T></tt>
! <br/><tt>void foo (typename T::argument_type arg)&nbsp;&nbsp; // #1</tt>
! <br/><tt>{</tt>
! <br/><tt>&nbsp;&nbsp;&nbsp; typename T::result_type (T::*pf) (typename
  T::argument_type)
  const =&nbsp;&nbsp; // #2</tt>
! <br/><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &amp;T::operator();</tt>
! <br/><tt>}</tt>
  </p>
  
  <p><tt>struct X { /* ... */ };</tt></p>
  
  <p><tt>int main ()</tt>
! <br/><tt>{</tt>
! <br/><tt>&nbsp;&nbsp;&nbsp; const X x;</tt>
! <br/><tt>&nbsp;&nbsp;&nbsp; foo&lt;std::const_mem_fun_t&lt;void, X>
! >(&amp;x);&nbsp;&nbsp;
  // #3</tt>
! <br/><tt>}</tt>
  </p>
  
  <p>#1 <tt>foo()</tt> takes a plain unqualified <tt>X*</tt> as an argument
! <br/>#2 the type of the pointer is incompatible with the type of the member
  function
! <br/>#3 the address of a constant being passed to a function taking a non-const
  <tt>X*</tt>
  </p>
  
*************** function
*** 14489,14513 ****
  <p>Replace the top portion of the definition of the class template
  const_mem_fun_t in 20.5.8, p8
  </p>
! <p><tt>template &lt;class S, class T&gt; class const_mem_fun_t</tt>
! <br><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : public
! unary_function&lt;T*, S&gt; {</tt>
  </p>
  <p>with</p>
! <p><tt>template &lt;class S, class T&gt; class const_mem_fun_t</tt>
! <br><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : public
! unary_function&lt;<b>const</b> T*, S&gt; {</tt>
  </p>
  <p>Also replace the top portion of the definition of the class template
  const_mem_fun1_t in 20.5.8, p9</p>
! <p><tt>template &lt;class S, class T, class A&gt; class const_mem_fun1_t</tt>
! <br><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : public
! binary_function&lt;T*, A, S&gt; {</tt>
  </p>
  <p>with</p>
! <p><tt>template &lt;class S, class T, class A&gt; class const_mem_fun1_t</tt>
! <br><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : public
! binary_function&lt;<b>const</b> T*, A, S&gt; {</tt>
  </p>
  
  
--- 13770,13794 ----
  <p>Replace the top portion of the definition of the class template
  const_mem_fun_t in 20.5.8, p8
  </p>
! <p><tt>template &lt;class S, class T> class const_mem_fun_t</tt>
! <br/><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : public
! unary_function&lt;T*, S> {</tt>
  </p>
  <p>with</p>
! <p><tt>template &lt;class S, class T> class const_mem_fun_t</tt>
! <br/><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : public
! unary_function&lt;<b>const</b> T*, S> {</tt>
  </p>
  <p>Also replace the top portion of the definition of the class template
  const_mem_fun1_t in 20.5.8, p9</p>
! <p><tt>template &lt;class S, class T, class A> class const_mem_fun1_t</tt>
! <br/><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : public
! binary_function&lt;T*, A, S> {</tt>
  </p>
  <p>with</p>
! <p><tt>template &lt;class S, class T, class A> class const_mem_fun1_t</tt>
! <br/><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : public
! binary_function&lt;<b>const</b> T*, A, S> {</tt>
  </p>
  
  
*************** and the argument type itself, are not th
*** 14521,14529 ****
  
  <hr>
  <h3><a name="298"></a>298. ::operator delete[] requirement incorrect/insufficient</h3>
! <p><b>Section:</b> 18.6.1.2 [new.delete.array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> John A. Pedretti <b>Opened:</b> 2001-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The default behavior of <tt>operator delete[]</tt> described in 18.5.1.2, p12 -
--- 13802,13810 ----
  
  <hr>
  <h3><a name="298"></a>298. ::operator delete[] requirement incorrect/insufficient</h3>
! <p><b>Section:</b> 18.6.1.2 [new.delete.array] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> John A. Pedretti <b>Opened:</b> 2001-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The default behavior of <tt>operator delete[]</tt> described in 18.5.1.2, p12 -
*************** For a null value of <i><tt>ptr</tt></i>
*** 14549,14555 ****
  Any other value of <i><tt>ptr</tt></i> shall be a value returned
  earlier by a call to the default <tt>operator new[](std::size_t)</tt>.
  [Footnote: The value must not have been invalidated by an intervening
! call to <tt>operator delete[](void*)</tt> (17.6.3.9 [res.on.arguments]).
  --- end footnote]
  For such a non-null value of <i><tt>ptr</tt></i> , reclaims storage
  allocated by the earlier call to the default <tt>operator new[]</tt>.
--- 13830,13836 ----
  Any other value of <i><tt>ptr</tt></i> shall be a value returned
  earlier by a call to the default <tt>operator new[](std::size_t)</tt>.
  [Footnote: The value must not have been invalidated by an intervening
! call to <tt>operator delete[](void*)</tt> (17.6.4.9 [res.on.arguments]).
  --- end footnote]
  For such a non-null value of <i><tt>ptr</tt></i> , reclaims storage
  allocated by the earlier call to the default <tt>operator new[]</tt>.
*************** or <tt>operator delete(<i>ptr</i>, std::
*** 14571,14583 ****
  
  <hr>
  <h3><a name="300"></a>300. list::merge() specification incomplete</h3>
! <p><b>Section:</b> 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> John Pedretti <b>Opened:</b> 2001-01-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The "Effects" clause for list::merge() (23.3.4.4 [list.ops], p23)
  appears to be incomplete: it doesn't cover the case where the argument
  list is identical to *this (i.e., this == &amp;x). The requirement in the
  note in p24 (below) is that x be empty after the merge which is surely
--- 13852,13864 ----
  
  <hr>
  <h3><a name="300"></a>300. list::merge() specification incomplete</h3>
! <p><b>Section:</b> 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> John Pedretti <b>Opened:</b> 2001-01-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The &quot;Effects&quot; clause for list::merge() (23.3.5.5 [list.ops], p23)
  appears to be incomplete: it doesn't cover the case where the argument
  list is identical to *this (i.e., this == &amp;x). The requirement in the
  note in p24 (below) is that x be empty after the merge which is surely
*************** unintended in this case.
*** 14586,14592 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 23.3.4.4 [list.ops], replace paragraps 23-25 with:</p>
  <blockquote>
  <p>
  23 Effects: if (&amp;x == this) does nothing; otherwise, merges the two
--- 13867,13873 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 23.3.5.5 [list.ops], replace paragraps 23-25 with:</p>
  <blockquote>
  <p>
  23 Effects: if (&amp;x == this) does nothing; otherwise, merges the two
*************** effects.
*** 14615,14628 ****
  </blockquote>
  
  <p><i>[Copenhagen: The original proposed resolution did not fix all of
! the problems in 23.3.4.4 [list.ops], p22-25.  Three different
  paragraphs (23, 24, 25) describe the effects of <tt>merge</tt>.
  Changing p23, without changing the other two, appears to introduce
  contradictions.  Additionally, "merges the argument list into the
  list" is excessively vague.]</i></p>
  
  
! <p><i>[Post-Curaçao: Robert Klarer provided new wording.]</i></p>
  
  
  
--- 13896,13909 ----
  </blockquote>
  
  <p><i>[Copenhagen: The original proposed resolution did not fix all of
! the problems in 23.3.5.5 [list.ops], p22-25.  Three different
  paragraphs (23, 24, 25) describe the effects of <tt>merge</tt>.
  Changing p23, without changing the other two, appears to introduce
  contradictions.  Additionally, "merges the argument list into the
  list" is excessively vague.]</i></p>
  
  
! <p><i>[Post-Cura&ccedil;ao: Robert Klarer provided new wording.]</i></p>
  
  
  
*************** list" is excessively vague.]</i></p>
*** 14632,14641 ****
  
  <hr>
  <h3><a name="301"></a>301. basic_string template ctor effects clause omits allocator argument</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-01-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The effects clause for the basic_string template ctor in 21.3.1, p15
--- 13913,13922 ----
  
  <hr>
  <h3><a name="301"></a>301. basic_string template ctor effects clause omits allocator argument</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-01-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The effects clause for the basic_string template ctor in 21.3.1, p15
*************** a mistake.
*** 14670,14683 ****
  
  <hr>
  <h3><a name="303"></a>303. Bitset input operator underspecified</h3>
! <p><b>Section:</b> 20.5.4 [bitset.operators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2001-02-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 23.3.5.3, we are told that <tt>bitset</tt>'s input operator
! "Extracts up to <i>N</i> (single-byte) characters from
! <i>is</i>.", where <i>is</i> is a stream of type
  <tt>basic_istream&lt;charT, traits&gt;</tt>.
  </p>
  
--- 13951,13964 ----
  
  <hr>
  <h3><a name="303"></a>303. Bitset input operator underspecified</h3>
! <p><b>Section:</b> 20.6.4 [bitset.operators] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2001-02-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 23.3.5.3, we are told that <tt>bitset</tt>'s input operator
! &quot;Extracts up to <i>N</i> (single-byte) characters from
! <i>is</i>.&quot;, where <i>is</i> is a stream of type
  <tt>basic_istream&lt;charT, traits&gt;</tt>.
  </p>
  
*************** consequence of the design choice.</p>
*** 14789,14798 ****
  
  <hr>
  <h3><a name="305"></a>305. Default behavior of codecvt&lt;wchar_t, char, mbstate_t&gt;::length()</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-01-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>22.2.1.5/3 introduces codecvt in part with:</p>
  
--- 14070,14079 ----
  
  <hr>
  <h3><a name="305"></a>305. Default behavior of codecvt&lt;wchar_t, char, mbstate_t&gt;::length()</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-01-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>22.2.1.5/3 introduces codecvt in part with:</p>
  
*************** that this is not what was intended and i
*** 14824,14830 ****
  
  <p>Discussion from the -lib reflector:
  
! <br>This proposal would have the effect of making the semantics of
  all of the virtual functions in <tt>codecvt&lt;wchar_t, char,
  mbstate_t&gt;</tt> implementation specified.  Is that what we want, or
  do we want to mandate specific behavior for the base class virtuals
--- 14105,14111 ----
  
  <p>Discussion from the -lib reflector:
  
! <br/>This proposal would have the effect of making the semantics of
  all of the virtual functions in <tt>codecvt&lt;wchar_t, char,
  mbstate_t&gt;</tt> implementation specified.  Is that what we want, or
  do we want to mandate specific behavior for the base class virtuals
*************** single external character), but this wou
*** 14906,14913 ****
  encodings that are in common use: it would rule out JIS, for
  example, and it would rule out a fixed-width encoding of UCS-4.</p>
  
! <p><i>[Curaçao: fixed rationale typo at the request of Ichiro Koshida;
! "shift-JIS" changed to "JIS".]</i></p>
  
  
  
--- 14187,14194 ----
  encodings that are in common use: it would rule out JIS, for
  example, and it would rule out a fixed-width encoding of UCS-4.</p>
  
! <p><i>[Cura&ccedil;ao: fixed rationale typo at the request of Ichiro Koshida;
! &quot;shift-JIS&quot; changed to &quot;JIS&quot;.]</i></p>
  
  
  
*************** example, and it would rule out a fixed-w
*** 14917,14938 ****
  
  <hr>
  <h3><a name="306"></a>306. offsetof macro and non-POD types</h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2001-02-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p> 
  <p>Spliced together from reflector messages c++std-lib-8294 and -8295:</p>
  
! <p>18.1, paragraph 5, reads: "The macro <tt>offsetof</tt>
  accepts a restricted set of <i>type</i> arguments in this
  International Standard. <i>type</i> shall be a POD structure or a POD
  union (clause 9). The result of applying the offsetof macro to a field
  that is a static data member or a function member is
! undefined."</p>
  
! <p>For the POD requirement, it doesn't say "no diagnostic
! required" or "undefined behavior". I read 1.4 [intro.compliance], paragraph 1, to mean that a diagnostic is required.
  It's not clear whether this requirement was intended.  While it's
  possible to provide such a diagnostic, the extra complication doesn't
  seem to add any value.
--- 14198,14219 ----
  
  <hr>
  <h3><a name="306"></a>306. offsetof macro and non-POD types</h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2001-02-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p> 
  <p>Spliced together from reflector messages c++std-lib-8294 and -8295:</p>
  
! <p>18.1, paragraph 5, reads: &quot;The macro <tt>offsetof</tt>
  accepts a restricted set of <i>type</i> arguments in this
  International Standard. <i>type</i> shall be a POD structure or a POD
  union (clause 9). The result of applying the offsetof macro to a field
  that is a static data member or a function member is
! undefined.&quot;</p>
  
! <p>For the POD requirement, it doesn't say &quot;no diagnostic
! required&quot; or &quot;undefined behavior&quot;. I read 1.4 [intro.compliance], paragraph 1, to mean that a diagnostic is required.
  It's not clear whether this requirement was intended.  While it's
  possible to provide such a diagnostic, the extra complication doesn't
  seem to add any value.
*************** seem to add any value.
*** 14940,14947 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 18.1, paragraph 5, to "If <i>type</i> is not a POD
! structure or a POD union the results are undefined."</p>
  
  <p><i>[Copenhagen: straw poll was 7-4 in favor.  It was generally
  agreed that requiring a diagnostic was inadvertent, but some LWG
--- 14221,14228 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 18.1, paragraph 5, to &quot;If <i>type</i> is not a POD
! structure or a POD union the results are undefined.&quot;</p>
  
  <p><i>[Copenhagen: straw poll was 7-4 in favor.  It was generally
  agreed that requiring a diagnostic was inadvertent, but some LWG
*************** possible.]</i></p>
*** 14955,14970 ****
  
  <hr>
  <h3><a name="307"></a>307. Lack of reference typedefs in container adaptors</h3>
! <p><b>Section:</b> 23.3.4 [list] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-03-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>From reflector message c++std-lib-8330.  See also lib-8317.</p>
  
  <p>
! The standard is currently inconsistent in 23.3.4.2 [list.capacity]
! paragraph 1 and 23.3.4.3 [list.modifiers] paragraph 1.
  23.2.3.3/1, for example, says:
  </p>
  
--- 14236,14251 ----
  
  <hr>
  <h3><a name="307"></a>307. Lack of reference typedefs in container adaptors</h3>
! <p><b>Section:</b> 23.3.5 [list] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>From reflector message c++std-lib-8330.  See also lib-8317.</p>
  
  <p>
! The standard is currently inconsistent in 23.3.5.3 [list.capacity]
! paragraph 1 and 23.3.5.4 [list.modifiers] paragraph 1.
  23.2.3.3/1, for example, says:
  </p>
  
*************** container's reference type.</p>
*** 14990,14996 ****
  
  <p>
  I propose 3.  This does not preclude option 2 if we choose to do it
! later (see issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#96">96</a>); the issues are independent.  Option
  3 offers a small step towards support for proxied containers.  This
  small step fixes a current contradiction, is easy for vendors to
  implement, is already implemented in at least one popular lib, and
--- 14271,14277 ----
  
  <p>
  I propose 3.  This does not preclude option 2 if we choose to do it
! later (see issue <a href="lwg-closed.html#96">96</a>); the issues are independent.  Option
  3 offers a small step towards support for proxied containers.  This
  small step fixes a current contradiction, is easy for vendors to
  implement, is already implemented in at least one popular lib, and
*************** priority_queue and stack.  Change return
*** 15007,15013 ****
  
  <p>Change 23.2.3.1/1 from:</p>
  
! <pre>  namespace std {
      template &lt;class T, class Container = deque&lt;T&gt; &gt;
      class queue {
      public:
--- 14288,14295 ----
  
  <p>Change 23.2.3.1/1 from:</p>
  
! <pre>
!   namespace std {
      template &lt;class T, class Container = deque&lt;T&gt; &gt;
      class queue {
      public:
*************** priority_queue and stack.  Change return
*** 15033,15039 ****
  
  <p>to:</p>
  
! <pre>  namespace std {
      template &lt;class T, class Container = deque&lt;T&gt; &gt;
      class queue {
      public:
--- 14315,14322 ----
  
  <p>to:</p>
  
! <pre>
!   namespace std {
      template &lt;class T, class Container = deque&lt;T&gt; &gt;
      class queue {
      public:
*************** priority_queue and stack.  Change return
*** 15062,15068 ****
  
  <p>Change 23.2.3.2/1 from:</p>
  
! <pre>  namespace std {
      template &lt;class T, class Container = vector&lt;T&gt;,
                class Compare = less&lt;typename Container::value_type&gt; &gt;
      class priority_queue {
--- 14345,14352 ----
  
  <p>Change 23.2.3.2/1 from:</p>
  
! <pre>
!   namespace std {
      template &lt;class T, class Container = vector&lt;T&gt;,
                class Compare = less&lt;typename Container::value_type&gt; &gt;
      class priority_queue {
*************** priority_queue and stack.  Change return
*** 15094,15100 ****
  
  <p>to:</p>
  
! <pre>  namespace std {
      template &lt;class T, class Container = vector&lt;T&gt;,
                class Compare = less&lt;typename Container::value_type&gt; &gt;
      class priority_queue {
--- 14378,14385 ----
  
  <p>to:</p>
  
! <pre>
!   namespace std {
      template &lt;class T, class Container = vector&lt;T&gt;,
                class Compare = less&lt;typename Container::value_type&gt; &gt;
      class priority_queue {
*************** priority_queue and stack.  Change return
*** 15128,15134 ****
  
  <p>And change 23.2.3.3/1 from:</p>
  
! <pre>  namespace std {
      template &lt;class T, class Container = deque&lt;T&gt; &gt;
      class stack {
      public:
--- 14413,14420 ----
  
  <p>And change 23.2.3.3/1 from:</p>
  
! <pre>
!   namespace std {
      template &lt;class T, class Container = deque&lt;T&gt; &gt;
      class stack {
      public:
*************** priority_queue and stack.  Change return
*** 15172,15178 ****
  
  <p>to:</p>
  
! <pre>  namespace std {
      template &lt;class T, class Container = deque&lt;T&gt; &gt;
      class stack {
      public:
--- 14458,14465 ----
  
  <p>to:</p>
  
! <pre>
!   namespace std {
      template &lt;class T, class Container = deque&lt;T&gt; &gt;
      class stack {
      public:
*************** and it was deliberately not adopted.  Ne
*** 15227,15236 ****
  
  <hr>
  <h3><a name="308"></a>308. Table 82 mentions unrelated headers</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-03-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 82 in section 27 mentions the header &lt;cstdlib&gt; for String
--- 14514,14523 ----
  
  <hr>
  <h3><a name="308"></a>308. Table 82 mentions unrelated headers</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-03-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 82 in section 27 mentions the header &lt;cstdlib&gt; for String
*************** section 27.9 [file.streams], including 2
*** 15259,15268 ****
  
  <hr>
  <h3><a name="310"></a>310. Is errno a macro?</h3>
! <p><b>Section:</b> 17.6.1.2 [headers], 19.4 [errno] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2001-03-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#headers">issues</a> in [headers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
    <p>
    Exactly how should errno be declared in a conforming C++ header?
--- 14546,14555 ----
  
  <hr>
  <h3><a name="310"></a>310. Is errno a macro?</h3>
! <p><b>Section:</b> 17.6.1.2 [headers], 19.4 [errno] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2001-03-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#headers">issues</a> in [headers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
    <p>
    Exactly how should errno be declared in a conforming C++ header?
*************** section 27.9 [file.streams], including 2
*** 15299,15306 ****
  
    <p>Two acceptable fixes:</p>
    <ul>
!     <li><p>errno must be a macro. This is trivially satisfied by adding<br>
!         &nbsp;&nbsp;#define errno (::std::errno)<br>
          to the headers if errno is not already a macro. You then always
          write errno without any scope qualification, and it always expands
          to a correct reference. Since it is always a macro, you know to
--- 14586,14593 ----
  
    <p>Two acceptable fixes:</p>
    <ul>
!     <li><p>errno must be a macro. This is trivially satisfied by adding<br/>
!         &nbsp;&nbsp;#define errno (::std::errno)<br/>
          to the headers if errno is not already a macro. You then always
          write errno without any scope qualification, and it always expands
          to a correct reference. Since it is always a macro, you know to
*************** not a name is a macro; it must explicitl
*** 15352,15358 ****
  are required to be macros.  The only one that really works is for it
  to be a macro.</p>
  
! <p><i>[Curaçao: additional rationale added.]</i></p>
  
  
  
--- 14639,14645 ----
  are required to be macros.  The only one that really works is for it
  to be a macro.</p>
  
! <p><i>[Cura&ccedil;ao: additional rationale added.]</i></p>
  
  
  
*************** to be a macro.</p>
*** 15362,15376 ****
  
  <hr>
  <h3><a name="311"></a>311. Incorrect wording in basic_ostream class synopsis</h3>
! <p><b>Section:</b> 27.7.2.1 [ostream] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-03-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream">issues</a> in [ostream].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>In 27.7.2.1 [ostream], the synopsis of class basic_ostream says:</p>
  
! <pre>  // partial specializationss
    template&lt;class traits&gt;
      basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;( basic_ostream&lt;char,traits&gt;&amp;,
                                              const char * );
--- 14649,14664 ----
  
  <hr>
  <h3><a name="311"></a>311. Incorrect wording in basic_ostream class synopsis</h3>
! <p><b>Section:</b> 27.7.3.1 [ostream] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-03-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream">issues</a> in [ostream].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>In 27.7.3.1 [ostream], the synopsis of class basic_ostream says:</p>
  
! <pre>
!   // partial specializationss
    template&lt;class traits&gt;
      basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;( basic_ostream&lt;char,traits&gt;&amp;,
                                              const char * );
*************** to be a macro.</p>
*** 15385,15398 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In the synopsis in 27.7.2.1 [ostream], remove the 
  <i>// partial specializationss</i> comment.  Also remove the same 
  comment (correctly spelled, but still incorrect) from the synopsis in 
! 27.7.2.6.4 [ostream.inserters.character].
  </p>
  
  <p><i>[
! Pre-Redmond: added 27.7.2.6.4 [ostream.inserters.character] because of Martin's
  comment in c++std-lib-8939.
  ]</i></p>
  
--- 14673,14686 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In the synopsis in 27.7.3.1 [ostream], remove the 
  <i>// partial specializationss</i> comment.  Also remove the same 
  comment (correctly spelled, but still incorrect) from the synopsis in 
! 27.7.3.6.4 [ostream.inserters.character].
  </p>
  
  <p><i>[
! Pre-Redmond: added 27.7.3.6.4 [ostream.inserters.character] because of Martin's
  comment in c++std-lib-8939.
  ]</i></p>
  
*************** comment in c++std-lib-8939.
*** 15404,15417 ****
  
  <hr>
  <h3><a name="312"></a>312. Table 27 is missing headers</h3>
! <p><b>Section:</b> 20 [utilities] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-03-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utilities">issues</a> in [utilities].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Table 27 in section 20 lists the header &lt;memory&gt; (only) for
  Memory (lib.memory) but neglects to mention the headers
! &lt;cstdlib&gt; and &lt;cstring&gt; that are discussed in 20.7.6 [meta.rel].</p>
  
  
  <p><b>Proposed resolution:</b></p>
--- 14692,14705 ----
  
  <hr>
  <h3><a name="312"></a>312. Table 27 is missing headers</h3>
! <p><b>Section:</b> 20 [utilities] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-03-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utilities">issues</a> in [utilities].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Table 27 in section 20 lists the header &lt;memory&gt; (only) for
  Memory (lib.memory) but neglects to mention the headers
! &lt;cstdlib&gt; and &lt;cstring&gt; that are discussed in 20.10.6 [meta.rel].</p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** as &lt;memory&gt;.</p>
*** 15424,15436 ****
  
  <hr>
  <h3><a name="315"></a>315. Bad "range" in list::unique complexity</h3>
! <p><b>Section:</b> 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-05-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 23.3.4.4 [list.ops], Para 21 describes the complexity of
  list::unique as: "If the range (last - first) is not empty, exactly
  (last - first) -1 applications of the corresponding predicate,
  otherwise no applications of the predicate)".
--- 14712,14724 ----
  
  <hr>
  <h3><a name="315"></a>315. Bad "range" in list::unique complexity</h3>
! <p><b>Section:</b> 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-05-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 23.3.5.5 [list.ops], Para 21 describes the complexity of
  list::unique as: "If the range (last - first) is not empty, exactly
  (last - first) -1 applications of the corresponding predicate,
  otherwise no applications of the predicate)".
*************** Change the "range" from (last - first) t
*** 15451,15461 ****
  
  <hr>
  <h3><a name="316"></a>316. Vague text in Table 69</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-05-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Table 69 says this about a_uniq.insert(t):</p>
  
--- 14739,14749 ----
  
  <hr>
  <h3><a name="316"></a>316. Vague text in Table 69</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-05-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Table 69 says this about a_uniq.insert(t):</p>
  
*************** takes place...
*** 15484,15493 ****
  
  <hr>
  <h3><a name="317"></a>317. Instantiation vs. specialization of facets</h3>
! <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-05-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#localization">issues</a> in [localization].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The localization section of the standard refers to specializations of
--- 14772,14781 ----
  
  <hr>
  <h3><a name="317"></a>317. Instantiation vs. specialization of facets</h3>
! <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-05-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#localization">issues</a> in [localization].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The localization section of the standard refers to specializations of
*************** change.</p>
*** 15550,15563 ****
  
  <hr>
  <h3><a name="318"></a>318. Misleading comment in definition of numpunct_byname</h3>
! <p><b>Section:</b> 22.4.3.2 [locale.numpunct.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-05-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The definition of the numpunct_byname template contains the following
  comment:</p>
  
! <pre>    namespace std {
          template &lt;class charT&gt;
          class numpunct_byname : public numpunct&lt;charT&gt; {
      // this class is specialized for char and wchar_t.
--- 14838,14852 ----
  
  <hr>
  <h3><a name="318"></a>318. Misleading comment in definition of numpunct_byname</h3>
! <p><b>Section:</b> 22.4.3.2 [locale.numpunct.byname] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-05-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The definition of the numpunct_byname template contains the following
  comment:</p>
  
! <pre>
!     namespace std {
          template &lt;class charT&gt;
          class numpunct_byname : public numpunct&lt;charT&gt; {
      // this class is specialized for char and wchar_t.
*************** template at all, but simply provide the
*** 15571,15587 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Remove the comment from the text in 22.2.3.2 and from the proposed
! resolution of library issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#228">228</a>.</p>
  
  
  
  
  <hr>
  <h3><a name="319"></a>319. Storage allocation wording confuses "Required behavior", "Requires"</h3>
! <p><b>Section:</b> 18.6.1.1 [new.delete.single], 18.6.1.2 [new.delete.array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2001-05-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#new.delete.single">issues</a> in [new.delete.single].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard specifies 17.5.1.4 [structure.specifications] that "Required
  behavior" elements describe "the semantics of a function definition
--- 14860,14876 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Remove the comment from the text in 22.2.3.2 and from the proposed
! resolution of library issue <a href="lwg-defects.html#228">228</a>.</p>
  
  
  
  
  <hr>
  <h3><a name="319"></a>319. Storage allocation wording confuses "Required behavior", "Requires"</h3>
! <p><b>Section:</b> 18.6.1.1 [new.delete.single], 18.6.1.2 [new.delete.array] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2001-05-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete.single">issues</a> in [new.delete.single].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The standard specifies 17.5.1.4 [structure.specifications] that "Required
  behavior" elements describe "the semantics of a function definition
*************** should be specified as "Requires".</p>
*** 15626,15638 ****
  
  <hr>
  <h3><a name="320"></a>320. list::assign overspecified</h3>
! <p><b>Section:</b> 23.3.4.1 [list.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-05-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.cons">issues</a> in [list.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 23.3.4.1 [list.cons], paragraphs 6-8 specify that list assign (both forms) have
  the "effects" of a call to erase followed by a call to insert.
  </p>
  
--- 14915,14927 ----
  
  <hr>
  <h3><a name="320"></a>320. list::assign overspecified</h3>
! <p><b>Section:</b> 23.3.5.2 [list.cons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2001-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.cons">issues</a> in [list.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 23.3.5.2 [list.cons], paragraphs 6-8 specify that list assign (both forms) have
  the "effects" of a call to erase followed by a call to insert.
  </p>
  
*************** Metrowerks and SGI recycle nodes, Dinkum
*** 15658,15669 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 23.3.4.1 [list.cons]/7 from:</p>
  
  <blockquote>
  <p>Effects:</p>
  
! <pre>   erase(begin(), end());
     insert(begin(), first, last);
  </pre>
  </blockquote>
--- 14947,14959 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 23.3.5.2 [list.cons]/7 from:</p>
  
  <blockquote>
  <p>Effects:</p>
  
! <pre>
!    erase(begin(), end());
     insert(begin(), first, last);
  </pre>
  </blockquote>
*************** Metrowerks and SGI recycle nodes, Dinkum
*** 15676,15682 ****
  
  <p>In 23.2.3 [sequence.reqmts], in Table 67 (sequence requirements), 
  add two new rows:</p>
! <pre>      a.assign(i,j)     void      pre: i,j are not iterators into a.
                                    Replaces elements in a with a copy
                                    of [i, j).
  
--- 14966,14973 ----
  
  <p>In 23.2.3 [sequence.reqmts], in Table 67 (sequence requirements), 
  add two new rows:</p>
! <pre>
!       a.assign(i,j)     void      pre: i,j are not iterators into a.
                                    Replaces elements in a with a copy
                                    of [i, j).
  
*************** add two new rows:</p>
*** 15685,15695 ****
                                    of t.
  </pre>
  
! <p>Change 23.3.4.1 [list.cons]/8 from:</p>
  
  <blockquote>
  <p>Effects:</p>
! <pre>   erase(begin(), end());
     insert(begin(), n, t);
  </pre>
  </blockquote>
--- 14976,14987 ----
                                    of t.
  </pre>
  
! <p>Change 23.3.5.2 [list.cons]/8 from:</p>
  
  <blockquote>
  <p>Effects:</p>
! <pre>
!    erase(begin(), end());
     insert(begin(), n, t);
  </pre>
  </blockquote>
*************** temporary.  Howard provided wording.
*** 15710,15718 ****
  ]</i></p>
  
  
! <p><i>[Curaçao: Made editorial improvement in wording; changed
! "Replaces elements in a with copies of elements in [i, j)."
! with "Replaces the elements of a with a copy of [i, j)."
  Changes not deemed serious enough to requre rereview.]</i></p>
  
  
--- 15002,15010 ----
  ]</i></p>
  
  
! <p><i>[Cura&ccedil;ao: Made editorial improvement in wording; changed
! &quot;Replaces elements in a with copies of elements in [i, j).&quot;
! with &quot;Replaces the elements of a with a copy of [i, j).&quot;
  Changes not deemed serious enough to requre rereview.]</i></p>
  
  
*************** Changes not deemed serious enough to req
*** 15723,15732 ****
  
  <hr>
  <h3><a name="321"></a>321. Typo in num_get</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Kevin Djang <b>Opened:</b> 2001-05-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 22.2.2.1.2 at p7 states that "A length specifier is added to
--- 15015,15025 ----
  
  <hr>
  <h3><a name="321"></a>321. Typo in num_get</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Kevin Djang <b>Opened:</b> 2001-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 22.2.2.1.2 at p7 states that "A length specifier is added to
*************** to be "A length modifier is added ..."
*** 15753,15762 ****
  
  <hr>
  <h3><a name="322"></a>322. iterator and const_iterator should have the same value type</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2001-05-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It's widely assumed that, if X is a container,
--- 15046,15056 ----
  
  <hr>
  <h3><a name="322"></a>322. iterator and const_iterator should have the same value type</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2001-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It's widely assumed that, if X is a container,
*************** iterator_traits&lt;X::const_iterator&gt;
*** 15769,15775 ****
  X::value_type".
  </p>
  
! <p>Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#279">279</a>.</p>
  
  
  <p><b>Proposed resolution:</b></p>
--- 15063,15069 ----
  X::value_type".
  </p>
  
! <p>Related issue: <a href="lwg-closed.html#279">279</a>.</p>
  
  
  <p><b>Proposed resolution:</b></p>
*************** requires that iterator_traits&lt;const i
*** 15799,15808 ****
  
  <hr>
  <h3><a name="324"></a>324. Do output iterators have value types?</h3>
! <p><b>Section:</b> 24.2.4 [output.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2001-06-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#output.iterators">issues</a> in [output.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>Table 73 suggests that output iterators have value types.  It 
--- 15093,15103 ----
  
  <hr>
  <h3><a name="324"></a>324. Do output iterators have value types?</h3>
! <p><b>Section:</b> 24.2.4 [output.iterators] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2001-06-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#output.iterators">active issues</a> in [output.iterators].</p>
! <p><b>View all other</b> <a href="lwg-index.html#output.iterators">issues</a> in [output.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>Table 73 suggests that output iterators have value types.  It 
*************** output iterator.
*** 15884,15911 ****
  <p>Table 73, change</p>
  
  <blockquote>
! <pre>*a = t
  </pre>
  </blockquote>
  
  <p>to</p>
  
  <blockquote>
! <pre>*r = o
  </pre>
  </blockquote>
  
  <p>and change</p>
  
  <blockquote>
! <pre>*r++ = t
  </pre>
  </blockquote>
  
  <p>to</p>
  
  <blockquote>
! <pre>*r++ = o
  </pre>
  </blockquote>
  
--- 15179,15210 ----
  <p>Table 73, change</p>
  
  <blockquote>
! <pre>
! *a = t
  </pre>
  </blockquote>
  
  <p>to</p>
  
  <blockquote>
! <pre>
! *r = o
  </pre>
  </blockquote>
  
  <p>and change</p>
  
  <blockquote>
! <pre>
! *r++ = t
  </pre>
  </blockquote>
  
  <p>to</p>
  
  <blockquote>
! <pre>
! *r++ = o
  </pre>
  </blockquote>
  
*************** decision.</p>
*** 15932,15941 ****
  
  <hr>
  <h3><a name="325"></a>325. Misleading text in moneypunct&lt;&gt;::do_grouping</h3>
! <p><b>Section:</b> 22.4.6.3.2 [locale.moneypunct.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-07-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.moneypunct.virtuals">issues</a> in [locale.moneypunct.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The Returns clause in 22.2.6.3.2, p3 says about
  moneypunct&lt;charT&gt;::do_grouping()
--- 15231,15240 ----
  
  <hr>
  <h3><a name="325"></a>325. Misleading text in moneypunct&lt;&gt;::do_grouping</h3>
! <p><b>Section:</b> 22.4.6.3.2 [locale.moneypunct.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-07-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.moneypunct.virtuals">issues</a> in [locale.moneypunct.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The Returns clause in 22.2.6.3.2, p3 says about
  moneypunct&lt;charT&gt;::do_grouping()
*************** integers, not ASCII characters.
*** 15997,16007 ****
  
  <hr>
  <h3><a name="327"></a>327. Typo in time_get facet in table 52</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Tiki Wan <b>Opened:</b> 2001-07-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#447">447</a></p>
  <p><b>Discussion:</b></p>
  <p>The <tt>wchar_t</tt> versions of <tt>time_get</tt> and
  <tt>time_get_byname</tt> are listed incorrectly in table 52,
--- 15296,15306 ----
  
  <hr>
  <h3><a name="327"></a>327. Typo in time_get facet in table 52</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Tiki Wan <b>Opened:</b> 2001-07-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#447">447</a></p>
  <p><b>Discussion:</b></p>
  <p>The <tt>wchar_t</tt> versions of <tt>time_get</tt> and
  <tt>time_get_byname</tt> are listed incorrectly in table 52,
*************** InputIterator, since these are input fac
*** 16014,16024 ****
  <p>
  In table 52, required instantiations, in 
  22.3.1.1.1 [locale.category], change</p>
! <pre>    time_get&lt;wchar_t, OutputIterator&gt;
      time_get_byname&lt;wchar_t, OutputIterator&gt;
  </pre>
  <p>to</p>
! <pre>    time_get&lt;wchar_t, InputIterator&gt;
      time_get_byname&lt;wchar_t, InputIterator&gt;
  </pre>
  
--- 15313,15325 ----
  <p>
  In table 52, required instantiations, in 
  22.3.1.1.1 [locale.category], change</p>
! <pre>
!     time_get&lt;wchar_t, OutputIterator&gt;
      time_get_byname&lt;wchar_t, OutputIterator&gt;
  </pre>
  <p>to</p>
! <pre>
!     time_get&lt;wchar_t, InputIterator&gt;
      time_get_byname&lt;wchar_t, InputIterator&gt;
  </pre>
  
*************** a typo, wchart instead of wchar_t.]</i><
*** 16032,16040 ****
  
  <hr>
  <h3><a name="328"></a>328. Bad sprintf format modifier in money_put&lt;&gt;::do_put()</h3>
! <p><b>Section:</b> 22.4.6.2.2 [locale.money.put.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-07-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The sprintf format string , "%.01f" (that's the digit one), in the
  description of the do_put() member functions of the money_put facet in
--- 15333,15341 ----
  
  <hr>
  <h3><a name="328"></a>328. Bad sprintf format modifier in money_put&lt;&gt;::do_put()</h3>
! <p><b>Section:</b> 22.4.6.2.2 [locale.money.put.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-07-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The sprintf format string , "%.01f" (that's the digit one), in the
  description of the do_put() member functions of the money_put facet in
*************** modifier.</p>
*** 16056,16073 ****
  
  <hr>
  <h3><a name="329"></a>329. vector capacity, reserve and reallocation</h3>
! <p><b>Section:</b> 23.4.1.2 [vector.capacity], 23.4.1.4 [vector.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2001-07-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is an apparent contradiction about which circumstances can cause
! a reallocation of a vector in Section 23.4.1.2 [vector.capacity] and
! section 23.4.1.4 [vector.modifiers].
  </p>
  
! <p>23.4.1.2 [vector.capacity],p5 says:</p>
  <blockquote><p>
  Notes: Reallocation invalidates all the references, pointers, and iterators
  referring to the elements in the sequence. It is guaranteed that no
--- 15357,15375 ----
  
  <hr>
  <h3><a name="329"></a>329. vector capacity, reserve and reallocation</h3>
! <p><b>Section:</b> 23.3.6.3 [vector.capacity], 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2001-07-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is an apparent contradiction about which circumstances can cause
! a reallocation of a vector in Section 23.3.6.3 [vector.capacity] and
! section 23.3.6.5 [vector.modifiers].
  </p>
  
! <p>23.3.6.3 [vector.capacity],p5 says:</p>
  <blockquote><p>
  Notes: Reallocation invalidates all the references, pointers, and iterators
  referring to the elements in the sequence. It is guaranteed that no
*************** greater than the size specified in the m
*** 16078,16084 ****
  
  <p>Which implies if I do</p>
  
! <pre>  std::vector&lt;int&gt; vec;
    vec.reserve(23);
    vec.reserve(0);
    vec.insert(vec.end(),1);
--- 15380,15387 ----
  
  <p>Which implies if I do</p>
  
! <pre>
!   std::vector&lt;int&gt; vec;
    vec.reserve(23);
    vec.reserve(0);
    vec.insert(vec.end(),1);
*************** greater than the size specified in the m
*** 16087,16093 ****
  <p>then the implementation may reallocate the vector for the insert,
  as the size specified in the previous call to reserve was zero.</p>
  
! <p>However, the previous paragraphs (23.4.1.2 [vector.capacity], p1-2) state:</p>
  <blockquote>
  <p>
  (capacity) Returns: The total number of elements the vector
--- 15390,15396 ----
  <p>then the implementation may reallocate the vector for the insert,
  as the size specified in the previous call to reserve was zero.</p>
  
! <p>However, the previous paragraphs (23.3.6.3 [vector.capacity], p1-2) state:</p>
  <blockquote>
  <p>
  (capacity) Returns: The total number of elements the vector
*************** of capacity() otherwise...
*** 16103,16109 ****
  <p>
  This implies that vec.capacity() is still 23, and so the insert()
  should not require a reallocation, as vec.size() is 0. This is backed
! up by 23.4.1.4 [vector.modifiers], p1:
  </p>
  <blockquote><p>
  (insert) Notes: Causes reallocation if the new size is greater than the old
--- 15406,15412 ----
  <p>
  This implies that vec.capacity() is still 23, and so the insert()
  should not require a reallocation, as vec.size() is 0. This is backed
! up by 23.3.6.5 [vector.modifiers], p1:
  </p>
  <blockquote><p>
  (insert) Notes: Causes reallocation if the new size is greater than the old
*************** than the old capacity, I think the inten
*** 16118,16124 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the wording of 23.4.1.2 [vector.capacity] paragraph 5 to:</p>
  
  <blockquote><p>
  Notes: Reallocation invalidates all the references, pointers, and
--- 15421,15427 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the wording of 23.3.6.3 [vector.capacity] paragraph 5 to:</p>
  
  <blockquote><p>
  Notes: Reallocation invalidates all the references, pointers, and
*************** reallocation guarantees was inadvertant.
*** 16151,16169 ****
  
  <hr>
  <h3><a name="331"></a>331. bad declaration of destructor for ios_base::failure</h3>
! <p><b>Section:</b> 27.5.2.1.1 [ios::failure] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> PremAnand M. Rao <b>Opened:</b> 2001-08-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios::failure">issues</a> in [ios::failure].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! With the change in 17.6.4.12 [res.on.exception.handling] to state
     "An implementation may strengthen the exception-specification for a 
      non-virtual function by removing listed exceptions."
! (issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#119">119</a>)
  and the following declaration of ~failure() in ios_base::failure
  </p>
! <pre>    namespace std {
         class ios_base::failure : public exception {
         public:
             ...
--- 15454,15473 ----
  
  <hr>
  <h3><a name="331"></a>331. bad declaration of destructor for ios_base::failure</h3>
! <p><b>Section:</b> 27.5.3.1.1 [ios::failure] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> PremAnand M. Rao <b>Opened:</b> 2001-08-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios::failure">issues</a> in [ios::failure].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! With the change in 17.6.5.12 [res.on.exception.handling] to state
     "An implementation may strengthen the exception-specification for a 
      non-virtual function by removing listed exceptions."
! (issue <a href="lwg-defects.html#119">119</a>)
  and the following declaration of ~failure() in ios_base::failure
  </p>
! <pre>
!     namespace std {
         class ios_base::failure : public exception {
         public:
             ...
*************** and the following declaration of ~failur
*** 16174,16180 ****
  </pre>
  <p>the class failure cannot be implemented since in 18.7.1 [type.info] the destructor of class exception has an empty
  exception specification:</p>
! <pre>    namespace std {
         class exception {
         public:
           ...
--- 15478,15485 ----
  </pre>
  <p>the class failure cannot be implemented since in 18.7.1 [type.info] the destructor of class exception has an empty
  exception specification:</p>
! <pre>
!     namespace std {
         class exception {
         public:
           ...
*************** of other classes derived from <tt>except
*** 16201,16211 ****
  
  <hr>
  <h3><a name="333"></a>333. does endl imply synchronization with the device?</h3>
! <p><b>Section:</b> 27.7.2.8 [ostream.manip] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> PremAnand M. Rao <b>Opened:</b> 2001-08-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>A footnote in 27.7.2.8 [ostream.manip] states:</p>
  <blockquote><p>
      [Footnote: The effect of executing cout &lt;&lt; endl is to insert a 
       newline character in the output sequence controlled by cout, then 
--- 15506,15516 ----
  
  <hr>
  <h3><a name="333"></a>333. does endl imply synchronization with the device?</h3>
! <p><b>Section:</b> 27.7.3.8 [ostream.manip] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> PremAnand M. Rao <b>Opened:</b> 2001-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>A footnote in 27.7.3.8 [ostream.manip] states:</p>
  <blockquote><p>
      [Footnote: The effect of executing cout &lt;&lt; endl is to insert a 
       newline character in the output sequence controlled by cout, then 
*************** the behavior one way or the other.
*** 16232,16238 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove footnote 300 from section 27.7.2.8 [ostream.manip].</p>
  
  
  <p><b>Rationale:</b></p>
--- 15537,15543 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove footnote 300 from section 27.7.3.8 [ostream.manip].</p>
  
  
  <p><b>Rationale:</b></p>
*************** does.</p>
*** 16250,16259 ****
  
  <hr>
  <h3><a name="334"></a>334. map::operator[] specification forces inefficient implementation</h3>
! <p><b>Section:</b> 23.6.1.2 [map.access] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrea Griffini <b>Opened:</b> 2001-09-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#map.access">issues</a> in [map.access].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current standard describes map::operator[] using a
--- 15555,15564 ----
  
  <hr>
  <h3><a name="334"></a>334. map::operator[] specification forces inefficient implementation</h3>
! <p><b>Section:</b> 23.4.4.3 [map.access] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrea Griffini <b>Opened:</b> 2001-09-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#map.access">issues</a> in [map.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current standard describes map::operator[] using a
*************** require all those temporary copies.
*** 16266,16272 ****
  </p>
  
  <p>Currently map::operator[] behaviour is specified as: </p>
! <pre>  Returns:
      (*((insert(make_pair(x, T()))).first)).second.
  </pre>
    
--- 15571,15578 ----
  </p>
  
  <p>Currently map::operator[] behaviour is specified as: </p>
! <pre>
!   Returns:
      (*((insert(make_pair(x, T()))).first)).second.
  </pre>
    
*************** construction for each type).
*** 16293,16299 ****
  </p>
  
  <p>A simple (half) solution would be replacing the description with:</p>
! <pre>  Returns:
      (*((insert(value_type(x, T()))).first)).second.
  </pre>
  
--- 15599,15606 ----
  </p>
  
  <p>A simple (half) solution would be replacing the description with:</p>
! <pre>
!   Returns:
      (*((insert(value_type(x, T()))).first)).second.
  </pre>
  
*************** non-conforming.
*** 16333,16339 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Replace 23.6.1.2 [map.access] paragraph 1 with
  </p>
  <blockquote>
  <p>
--- 15640,15646 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Replace 23.4.4.3 [map.access] paragraph 1 with
  </p>
  <blockquote>
  <p>
*************** value_type(x, T()) into the map.
*** 16352,16358 ****
  wording.  We may also wish to have a blanket statement somewhere in
  clause 17 saying that we do not intend the semantics of sample code
  fragments to be interpreted as specifing exactly how many copies are
! made.  See issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#98">98</a> for a similar problem.]</i></p>
  
  
  
--- 15659,15665 ----
  wording.  We may also wish to have a blanket statement somewhere in
  clause 17 saying that we do not intend the semantics of sample code
  fragments to be interpreted as specifing exactly how many copies are
! made.  See issue <a href="lwg-defects.html#98">98</a> for a similar problem.]</i></p>
  
  
  
*************** we are no longer defining <tt>operator[]
*** 16373,16387 ****
  
  <hr>
  <h3><a name="335"></a>335. minor issue with char_traits, table 37</h3>
! <p><b>Section:</b> 21.2.1 [char.traits.require] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-09-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 37, in 21.2.1 [char.traits.require], descibes char_traits::assign
  as:
  </p>
! <pre>  X::assign(c,d)   assigns c = d.
  </pre>
  
  <p>And para 1 says:</p>
--- 15680,15695 ----
  
  <hr>
  <h3><a name="335"></a>335. minor issue with char_traits, table 37</h3>
! <p><b>Section:</b> 21.2.1 [char.traits.require] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-09-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 37, in 21.2.1 [char.traits.require], descibes char_traits::assign
  as:
  </p>
! <pre>
!   X::assign(c,d)   assigns c = d.
  </pre>
  
  <p>And para 1 says:</p>
*************** assign, at least), 'c' is intended to be
*** 16398,16404 ****
  
  <p>I did a quick survey of the four implementations I happened to have
  lying around, and sure enough they all have signatures:</p>
! <pre>    assign( charT&amp;, const charT&amp; );
  </pre>
  
  <p>(or the equivalent). It's also described this way in Nico's book.
--- 15706,15713 ----
  
  <p>I did a quick survey of the four implementations I happened to have
  lying around, and sure enough they all have signatures:</p>
! <pre>
!     assign( charT&amp;, const charT&amp; );
  </pre>
  
  <p>(or the equivalent). It's also described this way in Nico's book.
*************** and char_traits&lt;wchar_t&gt; in 21.1.3
*** 16414,16420 ****
  </p></blockquote>
  
  <p>and change the description of assign in the table to:</p>
! <pre>  X::assign(r,d)   assigns r = d
  </pre>
  
  
--- 15723,15730 ----
  </p></blockquote>
  
  <p>and change the description of assign in the table to:</p>
! <pre>
!   X::assign(r,d)   assigns r = d
  </pre>
  
  
*************** and char_traits&lt;wchar_t&gt; in 21.1.3
*** 16423,16433 ****
  
  <hr>
  <h3><a name="336"></a>336. Clause 17 lack of references to deprecated headers</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2001-09-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>From c++std-edit-873:</p>
  
--- 15733,15743 ----
  
  <hr>
  <h3><a name="336"></a>336. Clause 17 lack of references to deprecated headers</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2001-09-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>From c++std-edit-873:</p>
  
*************** library (though a deprecated one).</p>
*** 16458,16466 ****
  <li>17.5.2.3 [objects.within.classes] Private members/1/(2 places)</li>
  <li>17.6 [requirements] Library-wide requirements/1</li>
  <li>17.6.1.2 [headers] Headers/4</li>
! <li>17.6.3.6 [replacement.functions] Replacement functions/1</li>
! <li>17.6.4.4 [global.functions] Global or non-member functions/2</li>
! <li>17.6.4.10 [protection.within.classes] Protection within classes/1</li>
  </ul>
  
  
--- 15768,15776 ----
  <li>17.5.2.3 [objects.within.classes] Private members/1/(2 places)</li>
  <li>17.6 [requirements] Library-wide requirements/1</li>
  <li>17.6.1.2 [headers] Headers/4</li>
! <li>17.6.4.6 [replacement.functions] Replacement functions/1</li>
! <li>17.6.5.4 [global.functions] Global or non-member functions/2</li>
! <li>17.6.5.10 [protection.within.classes] Protection within classes/1</li>
  </ul>
  
  
*************** library (though a deprecated one).</p>
*** 16471,16480 ****
  
  <hr>
  <h3><a name="337"></a>337. replace_copy_if's template parameter should be InputIterator</h3>
! <p><b>Section:</b> 25.3.5 [alg.replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2001-09-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.replace">issues</a> in [alg.replace].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>From c++std-edit-876:</p>
  
--- 15781,15790 ----
  
  <hr>
  <h3><a name="337"></a>337. replace_copy_if's template parameter should be InputIterator</h3>
! <p><b>Section:</b> 25.3.5 [alg.replace] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2001-09-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.replace">issues</a> in [alg.replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>From c++std-edit-876:</p>
  
*************** parameter name conveys real normative me
*** 16495,16509 ****
  
  <hr>
  <h3><a name="338"></a>338.  is whitespace allowed between `-' and a digit?</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-09-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From Stage 2 processing in 22.4.2.1.2 [facet.num.get.virtuals], p8 and 9 (the
  original text or the text corrected by the proposed resolution of
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#221">221</a>) it seems clear that no whitespace is allowed
  within a number, but 22.4.3.1 [locale.numpunct], p2, which gives the
  format for integer and floating point values, says that whitespace is
  optional between a plusminus and a sign.
--- 15805,15819 ----
  
  <hr>
  <h3><a name="338"></a>338.  is whitespace allowed between `-' and a digit?</h3>
! <p><b>Section:</b> 22.4 [locale.categories] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-09-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.categories">issues</a> in [locale.categories].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From Stage 2 processing in 22.4.2.1.2 [facet.num.get.virtuals], p8 and 9 (the
  original text or the text corrected by the proposed resolution of
! issue <a href="lwg-defects.html#221">221</a>) it seems clear that no whitespace is allowed
  within a number, but 22.4.3.1 [locale.numpunct], p2, which gives the
  format for integer and floating point values, says that whitespace is
  optional between a plusminus and a sign.
*************** The text needs to be clarified to either
*** 16514,16520 ****
  disallow whitespace between a plusminus and a sign. It might be
  worthwhile to consider the fact that the C library stdio facility does
  not permit whitespace embedded in numbers and neither does the C or
! C++ core language (the syntax of integer-literals is given in 2.14.2 [lex.icon], that of floating-point-literals in 2.14.4 [lex.fcon] of the C++ standard).
  </p>
  
  
--- 15824,15830 ----
  disallow whitespace between a plusminus and a sign. It might be
  worthwhile to consider the fact that the C library stdio facility does
  not permit whitespace embedded in numbers and neither does the C or
! C++ core language (the syntax of integer-literals is given in 2.13.2 [lex.icon], that of floating-point-literals in 2.13.4 [lex.fcon] of the C++ standard).
  </p>
  
  
*************** value, <tt>whitespace</tt> is as determi
*** 16530,16536 ****
  <tt>numpunct&lt;charT&gt;</tt> members.  Integer values have the
  format:
  </p>
! <pre>  integer   ::= [sign] units
    sign      ::= plusminus [whitespace]
    plusminus ::= '+' | '-'
    units     ::= digits [thousands-sep units]
--- 15840,15847 ----
  <tt>numpunct&lt;charT&gt;</tt> members.  Integer values have the
  format:
  </p>
! <pre>
!   integer   ::= [sign] units
    sign      ::= plusminus [whitespace]
    plusminus ::= '+' | '-'
    units     ::= digits [thousands-sep units]
*************** value, and <tt>thousands-sep</tt> and <t
*** 16546,16552 ****
  results of corresponding <tt>numpunct&lt;charT&gt;</tt> members.
  Integer values have the format:
  </p>
! <pre>  integer   ::= [sign] units
    sign      ::= plusminus
    plusminus ::= '+' | '-'
    units     ::= digits [thousands-sep units]
--- 15857,15864 ----
  results of corresponding <tt>numpunct&lt;charT&gt;</tt> members.
  Integer values have the format:
  </p>
! <pre>
!   integer   ::= [sign] units
    sign      ::= plusminus
    plusminus ::= '+' | '-'
    units     ::= digits [thousands-sep units]
*************** resolution removes all mention of "white
*** 16568,16577 ****
  
  <hr>
  <h3><a name="339"></a>339. definition of bitmask type restricted to clause 27</h3>
! <p><b>Section:</b> 22.4.1 [category.ctype], 17.5.2.1.3 [bitmask.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-09-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#category.ctype">issues</a> in [category.ctype].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The ctype_category::mask type is declared to be an enum in 22.4.1 [category.ctype] with p1 then stating that it is a bitmask type, most
--- 15880,15889 ----
  
  <hr>
  <h3><a name="339"></a>339. definition of bitmask type restricted to clause 27</h3>
! <p><b>Section:</b> 22.4.1 [category.ctype], 17.5.2.1.3 [bitmask.types] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-09-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#category.ctype">issues</a> in [category.ctype].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The ctype_category::mask type is declared to be an enum in 22.4.1 [category.ctype] with p1 then stating that it is a bitmask type, most
*************** clause 27, making the reference in 22.2.
*** 16585,16591 ****
      <blockquote><p>
      Several types defined in clause 27 are bitmask types. Each bitmask type
      can be implemented as an enumerated type that overloads certain operators,
!     as an integer type, or as a bitset (20.5 [template.bitset]).
      </p></blockquote>
  <p>to read</p>
      <blockquote><p>
--- 15897,15903 ----
      <blockquote><p>
      Several types defined in clause 27 are bitmask types. Each bitmask type
      can be implemented as an enumerated type that overloads certain operators,
!     as an integer type, or as a bitset (20.6 [template.bitset]).
      </p></blockquote>
  <p>to read</p>
      <blockquote><p>
*************** following (note, in particluar, the cros
*** 16604,16610 ****
  
  <blockquote>
  <p>22.2.1 The ctype category [lib.category.ctype]</p>
! <pre>namespace std {
      class ctype_base {
      public:
          typedef <b><i>T</i></b> mask;
--- 15916,15923 ----
  
  <blockquote>
  <p>22.2.1 The ctype category [lib.category.ctype]</p>
! <pre>
! namespace std {
      class ctype_base {
      public:
          typedef <b><i>T</i></b> mask;
*************** following (note, in particluar, the cros
*** 16628,16634 ****
  <p>The type <tt>mask</tt> is a bitmask type (17.5.2.1.3 [bitmask.types]).</p>
  </blockquote>
  
! <p><i>[Curaçao: The LWG notes that T above should be bold-italics to be
  consistent with the rest of the standard.]</i></p>
  
  
--- 15941,15947 ----
  <p>The type <tt>mask</tt> is a bitmask type (17.5.2.1.3 [bitmask.types]).</p>
  </blockquote>
  
! <p><i>[Cura&ccedil;ao: The LWG notes that T above should be bold-italics to be
  consistent with the rest of the standard.]</i></p>
  
  
*************** consistent with the rest of the standard
*** 16641,16650 ****
  
  <hr>
  <h3><a name="340"></a>340. interpretation of <tt>has_facet&lt;Facet&gt;(loc)</tt></h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It's unclear whether 22.1.1.1.1, p3 says that
--- 15954,15963 ----
  
  <hr>
  <h3><a name="340"></a>340. interpretation of <tt>has_facet&lt;Facet&gt;(loc)</tt></h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It's unclear whether 22.1.1.1.1, p3 says that
*************** complete list of the ones we need.</p>
*** 16713,16735 ****
  
  <hr>
  <h3><a name="341"></a>341. Vector reallocation and swap</h3>
! <p><b>Section:</b> 23.4.1.2 [vector.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2001-09-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It is a common idiom to reduce the capacity of a vector by swapping it with
  an empty one:</p>
! <pre>  std::vector&lt;SomeType&gt; vec;
    // fill vec with data
    std::vector&lt;SomeType&gt;().swap(vec);
    // vec is now empty, with minimal capacity
  </pre>
  
! <p>However, the wording of 23.4.1.2 [vector.capacity]paragraph 5 prevents
  the capacity of a vector being reduced, following a call to
  reserve(). This invalidates the idiom, as swap() is thus prevented
! from reducing the capacity. The proposed wording for issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#329">329</a> does not affect this.  Consequently, the example above
  requires the temporary to be expanded to cater for the contents of
  vec, and the contents be copied across. This is a linear-time
  operation.</p>
--- 16026,16050 ----
  
  <hr>
  <h3><a name="341"></a>341. Vector reallocation and swap</h3>
! <p><b>Section:</b> 23.3.6.3 [vector.capacity] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2001-09-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It is a common idiom to reduce the capacity of a vector by swapping it with
  an empty one:</p>
! <pre>
!   std::vector&lt;SomeType&gt; vec;
    // fill vec with data
    std::vector&lt;SomeType&gt;().swap(vec);
    // vec is now empty, with minimal capacity
  </pre>
  
! <p>However, the wording of 23.3.6.3 [vector.capacity]paragraph 5 prevents
  the capacity of a vector being reduced, following a call to
  reserve(). This invalidates the idiom, as swap() is thus prevented
! from reducing the capacity. The proposed wording for issue <a href="lwg-defects.html#329">329</a> does not affect this.  Consequently, the example above
  requires the temporary to be expanded to cater for the contents of
  vec, and the contents be copied across. This is a linear-time
  operation.</p>
*************** referred to one vector now refer to the
*** 16759,16767 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add a new paragraph after 23.4.1.2 [vector.capacity] paragraph 5:</p>
  <blockquote>
! <pre>  void swap(vector&lt;T,Allocator&gt;&amp; x);
  </pre>
  <p><b>Effects:</b> Exchanges the contents and capacity() of <tt>*this</tt>
  with that of <tt>x</tt>.</p>
--- 16074,16083 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add a new paragraph after 23.3.6.3 [vector.capacity] paragraph 5:</p>
  <blockquote>
! <pre>
!   void swap(vector&lt;T,Allocator&gt;&amp; x);
  </pre>
  <p><b>Effects:</b> Exchanges the contents and capacity() of <tt>*this</tt>
  with that of <tt>x</tt>.</p>
*************** the two vectors, including their realloc
*** 16787,16807 ****
  
  
  <hr>
  <h3><a name="345"></a>345. type tm in &lt;cwchar&gt;</h3>
! <p><b>Section:</b> 21.7 [c.strings] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Clark Nelson <b>Opened:</b> 2001-10-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.strings">issues</a> in [c.strings].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  C99, and presumably amendment 1 to C90, specify that &lt;wchar.h&gt;
! declares struct tm as an incomplete type. However, table 48 in 21.7 [c.strings] does not mention the type tm as being declared in
  &lt;cwchar&gt;. Is this omission intentional or accidental?
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In section 21.7 [c.strings], add "tm" to table 48.</p>
  
  
  
--- 16103,16377 ----
  
  
  <hr>
+ <h3><a name="343"></a>343. Unspecified library header dependencies</h3>
+ <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-10-09 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The synopses of the C++ library headers clearly show which names are
+ required to be defined in each header. Since in order to implement the
+ classes and templates defined in these headers declarations of other
+ templates (but not necessarily their definitions) are typically
+ necessary the standard in 17.4.4, p1 permits library implementers to
+ include any headers needed to implement the definitions in each header.
+ </p>
+ 
+ <p>
+ For instance, although it is not explicitly specified in the synopsis of
+ <tt>&lt;string&gt;</tt>, at the point of definition of the <tt>std::basic_string</tt> template
+ the declaration of the <tt>std::allocator</tt> template must be in scope. All
+ current implementations simply include <tt>&lt;memory&gt;</tt> from within <tt>&lt;string&gt;</tt>,
+ either directly or indirectly, to bring the declaration of
+ <tt>std::allocator</tt> into scope.
+ </p>
+ 
+ <p>
+ Additionally, however, some implementation also include <tt>&lt;istream&gt;</tt> and
+ <tt>&lt;ostream&gt;</tt> at the top of <tt>&lt;string&gt;</tt> to bring the declarations of
+ <tt>std::basic_istream</tt> and <tt>std::basic_ostream</tt> into scope (which are needed
+ in order to implement the string inserter and extractor operators
+ (21.3.7.9 [lib.string.io])). Other implementations only include
+ <tt>&lt;iosfwd&gt;</tt>, since strictly speaking, only the declarations and not the
+ full definitions are necessary.
+ </p>
+ 
+ <p>
+ Obviously, it is possible to implement <tt>&lt;string&gt;</tt> without actually
+ providing the full definitions of all the templates <tt>std::basic_string</tt>
+ uses (<tt>std::allocator</tt>, <tt>std::basic_istream</tt>, and <tt>std::basic_ostream</tt>).
+ Furthermore, not only is it possible, doing so is likely to have a
+ positive effect on compile-time efficiency.
+ </p>
+ 
+ <p>
+ But while it may seem perfectly reasonable to expect a program that uses
+ the <tt>std::basic_string</tt> insertion and extraction operators to also
+ explicitly include <tt>&lt;istream&gt;</tt> or <tt>&lt;ostream&gt;</tt>, respectively, it doesn't seem
+ reasonable to also expect it to explicitly include <tt>&lt;memory&gt;</tt>. Since
+ what's reasonable and what isn't is highly subjective one would expect
+ the standard to specify what can and what cannot be assumed.
+ Unfortunately, that isn't the case.
+ </p>
+ 
+ <p>The examples below demonstrate the issue.</p>
+ 
+ <p>Example 1:</p>
+ 
+ <p>It is not clear whether the following program is complete:</p>
+ 
+ <pre>
+ #include &lt;string&gt;
+ 
+ extern std::basic_ostream&lt;char&gt; &amp;strm;
+ 
+ int main () {
+     strm &lt;&lt; std::string ("Hello, World!\n");
+ }
+ </pre>    
+ 
+ <p>or whether one must explicitly include <tt>&lt;memory&gt;</tt> or
+ <tt>&lt;ostream&gt;</tt> (or both) in addition to <tt>&lt;string&gt;</tt> in order for
+ the program to compile.</p>
+ 
+ 
+ <p>Example 2:</p>
+ 
+ <p>Similarly, it is unclear whether the following program is complete:</p>
+ 
+ <pre>
+ #include &lt;istream&gt;
+ 
+ extern std::basic_iostream&lt;char&gt; &amp;strm;
+ 
+ int main () {
+     strm &lt;&lt; "Hello, World!\n";
+ }
+ </pre>
+ 
+ <p>
+ or whether one needs to explicitly include <tt>&lt;ostream&gt;</tt>, and
+ perhaps even other headers containing the definitions of other
+ required templates:</p>
+ 
+ <pre>
+ #include &lt;ios&gt;
+ #include &lt;istream&gt;
+ #include &lt;ostream&gt;
+ #include &lt;streambuf&gt;
+ 
+ extern std::basic_iostream&lt;char&gt; &amp;strm;
+ 
+ int main () {
+     strm &lt;&lt; "Hello, World!\n";
+ }
+ </pre>
+ 
+ <p>Example 3:</p>
+ 
+ <p>Likewise, it seems unclear whether the program below is complete:</p>
+ <pre>
+ #include &lt;iterator&gt;
+ 
+ bool foo (std::istream_iterator&lt;int&gt; a, std::istream_iterator&lt;int&gt; b)
+ {
+     return a == b;
+ }
+ 
+ int main () { }
+ </pre>
+ 
+ <p>or whether one should be required to include <tt>&lt;istream&gt;</tt>.</p>
+ 
+ <p>There are many more examples that demonstrate this lack of a
+ requirement.  I believe that in a good number of cases it would be
+ unreasonable to require that a program explicitly include all the
+ headers necessary for a particular template to be specialized, but I
+ think that there are cases such as some of those above where it would
+ be desirable to allow implementations to include only as much as
+ necessary and not more.</p>
+ 
+ <p><i>[
+ post Bellevue:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Position taken in prior reviews is that the idea of a table of header
+ dependencies is a good one. Our view is that a full paper is needed to
+ do justice to this, and we've made that recommendation to the issue
+ author.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Resolved. Handled by LWG <a href="lwg-defects.html#1178">1178</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ For every C++ library header, supply a minimum set of other C++ library
+ headers that are required to be included by that header. The proposed
+ list is below (C++ headers for C Library Facilities, table 12 in
+ 17.4.1.2, p3, are omitted):
+ </p>
+ 
+ <pre>
+ +------------+--------------------+
+ | C++ header |required to include |
+ +============+====================+
+ |&lt;algorithm&gt; |                    |
+ +------------+--------------------+
+ |&lt;bitset&gt;    |                    |
+ +------------+--------------------+
+ |&lt;complex&gt;   |                    |
+ +------------+--------------------+
+ |&lt;deque&gt;     |&lt;memory&gt;            |
+ +------------+--------------------+
+ |&lt;exception&gt; |                    |
+ +------------+--------------------+
+ |&lt;fstream&gt;   |&lt;ios&gt;               |
+ +------------+--------------------+
+ |&lt;functional&gt;|                    |
+ +------------+--------------------+
+ |&lt;iomanip&gt;   |&lt;ios&gt;               |
+ +------------+--------------------+
+ |&lt;ios&gt;       |&lt;streambuf&gt;         |
+ +------------+--------------------+
+ |&lt;iosfwd&gt;    |                    |
+ +------------+--------------------+
+ |&lt;iostream&gt;  |&lt;istream&gt;, &lt;ostream&gt;|
+ +------------+--------------------+
+ |&lt;istream&gt;   |&lt;ios&gt;               |
+ +------------+--------------------+
+ |&lt;iterator&gt;  |                    |
+ +------------+--------------------+
+ |&lt;limits&gt;    |                    |
+ +------------+--------------------+
+ |&lt;list&gt;      |&lt;memory&gt;            |
+ +------------+--------------------+
+ |&lt;locale&gt;    |                    |
+ +------------+--------------------+
+ |&lt;map&gt;       |&lt;memory&gt;            |
+ +------------+--------------------+
+ |&lt;memory&gt;    |                    |
+ +------------+--------------------+
+ |&lt;new&gt;       |&lt;exception&gt;         |
+ +------------+--------------------+
+ |&lt;numeric&gt;   |                    |
+ +------------+--------------------+
+ |&lt;ostream&gt;   |&lt;ios&gt;               |
+ +------------+--------------------+
+ |&lt;queue&gt;     |&lt;deque&gt;             |
+ +------------+--------------------+
+ |&lt;set&gt;       |&lt;memory&gt;            |
+ +------------+--------------------+
+ |&lt;sstream&gt;   |&lt;ios&gt;, &lt;string&gt;     |
+ +------------+--------------------+
+ |&lt;stack&gt;     |&lt;deque&gt;             |
+ +------------+--------------------+
+ |&lt;stdexcept&gt; |                    |
+ +------------+--------------------+
+ |&lt;streambuf&gt; |&lt;ios&gt;               |
+ +------------+--------------------+
+ |&lt;string&gt;    |&lt;memory&gt;            |
+ +------------+--------------------+
+ |&lt;strstream&gt; |                    |
+ +------------+--------------------+
+ |&lt;typeinfo&gt;  |&lt;exception&gt;         |
+ +------------+--------------------+
+ |&lt;utility&gt;   |                    |
+ +------------+--------------------+
+ |&lt;valarray&gt;  |                    |
+ +------------+--------------------+
+ |&lt;vector&gt;    |&lt;memory&gt;            |
+ +------------+--------------------+
+ </pre>
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>The portability problem is real.  A program that works correctly on
+ one implementation might fail on another, because of different header
+ dependencies.  This problem was understood before the standard was
+ completed, and it was a conscious design choice.</p>
+ <p>One possible way to deal with this, as a library extension, would
+ be an <tt>&lt;all&gt;</tt> header.</p>
+ 
+ <p>
+ Hinnant:  It's time we dealt with this issue for C++0X.  Reopened.
+ </p>
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="345"></a>345. type tm in &lt;cwchar&gt;</h3>
! <p><b>Section:</b> 21.8 [c.strings] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Clark Nelson <b>Opened:</b> 2001-10-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.strings">active issues</a> in [c.strings].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.strings">issues</a> in [c.strings].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  C99, and presumably amendment 1 to C90, specify that &lt;wchar.h&gt;
! declares struct tm as an incomplete type. However, table 48 in 21.8 [c.strings] does not mention the type tm as being declared in
  &lt;cwchar&gt;. Is this omission intentional or accidental?
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In section 21.8 [c.strings], add "tm" to table 48.</p>
  
  
  
*************** declares struct tm as an incomplete type
*** 16809,16818 ****
  
  <hr>
  <h3><a name="346"></a>346. Some iterator member functions should be const</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jeremy Siek <b>Opened:</b> 2001-10-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Iterator member functions and operators that do not change the state
  of the iterator should be defined as const member functions or as
--- 16379,16388 ----
  
  <hr>
  <h3><a name="346"></a>346. Some iterator member functions should be const</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jeremy Siek <b>Opened:</b> 2001-10-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Iterator member functions and operators that do not change the state
  of the iterator should be defined as const member functions or as
*************** make this more explicit and also fix a c
*** 16832,16854 ****
  "In the following sections, a and b denote values of type const X...".</p>
  
  <p>In Table 73, change</p>
! <pre>    a-&gt;m   U&amp;         ...
  </pre>
  
  <p>to</p>
  
! <pre>    a-&gt;m   const U&amp;   ...
      r-&gt;m   U&amp;         ...
  </pre>
  
  <p>In Table 73 expression column, change</p>
  
! <pre>    *a = t
  </pre>
  
  <p>to</p>
  
! <pre>    *r = t
  </pre>
  
  <p><i>[Redmond: The container requirements should be reviewed to see if
--- 16402,16428 ----
  "In the following sections, a and b denote values of type const X...".</p>
  
  <p>In Table 73, change</p>
! <pre>
!     a-&gt;m   U&amp;         ...
  </pre>
  
  <p>to</p>
  
! <pre>
!     a-&gt;m   const U&amp;   ...
      r-&gt;m   U&amp;         ...
  </pre>
  
  <p>In Table 73 expression column, change</p>
  
! <pre>
!     *a = t
  </pre>
  
  <p>to</p>
  
! <pre>
!     *r = t
  </pre>
  
  <p><i>[Redmond: The container requirements should be reviewed to see if
*************** the same problem appears there.]</i></p>
*** 16862,16871 ****
  
  <hr>
  <h3><a name="347"></a>347. locale::category and bitmask requirements</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger, Nathan Myers <b>Opened:</b> 2001-10-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 22.3.1.1.1 [locale.category] paragraph 1, the category members
--- 16436,16445 ----
  
  <hr>
  <h3><a name="347"></a>347. locale::category and bitmask requirements</h3>
! <p><b>Section:</b> 22.3.1.1.1 [locale.category] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger, Nathan Myers <b>Opened:</b> 2001-10-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.category">issues</a> in [locale.category].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 22.3.1.1.1 [locale.category] paragraph 1, the category members
*************** changes beyond resolving the DR.</p>
*** 16893,16899 ****
  <p><b>Proposed resolution:</b></p>
  <p>Replace the first two paragraphs of 22.3.1.1 [locale.types] with:</p>
  <blockquote>
! <pre>    typedef int category;
  </pre>
  
  <p>Valid category values include the <tt>locale</tt> member bitmask
--- 16467,16474 ----
  <p><b>Proposed resolution:</b></p>
  <p>Replace the first two paragraphs of 22.3.1.1 [locale.types] with:</p>
  <blockquote>
! <pre>
!     typedef int category;
  </pre>
  
  <p>Valid category values include the <tt>locale</tt> member bitmask
*************** represents a single locale category. In
*** 16903,16909 ****
  bitmask constant <tt>none</tt> is defined as zero and represents no
  category. And locale member bitmask constant <tt>all</tt> is defined such that
  the expression</p>
! <pre>    (collate | ctype | monetary | numeric | time | messages | all) == all
  </pre>
  <p>
  is <tt>true</tt>, and represents the union of all categories.  Further
--- 16478,16485 ----
  bitmask constant <tt>none</tt> is defined as zero and represents no
  category. And locale member bitmask constant <tt>all</tt> is defined such that
  the expression</p>
! <pre>
!     (collate | ctype | monetary | numeric | time | messages | all) == all
  </pre>
  <p>
  is <tt>true</tt>, and represents the union of all categories.  Further
*************** in turn, identifies a set of locale face
*** 16921,16927 ****
  shown in Table 51:
  </p>
  </blockquote>
! <p><i>[Curaçao: need input from locale experts.]</i></p>
  
  
  
--- 16497,16503 ----
  shown in Table 51:
  </p>
  </blockquote>
! <p><i>[Cura&ccedil;ao: need input from locale experts.]</i></p>
  
  
  
*************** shown in Table 51:
*** 16937,16943 ****
    extra locale categories.</p>
  
  <blockquote>
! <p><b>Option 2:</b> <br>
  Replace the first paragraph of 22.3.1.1 [locale.types] with:</p>
  <blockquote>
  <p>
--- 16513,16519 ----
    extra locale categories.</p>
  
  <blockquote>
! <p><b>Option 2:</b> <br/>
  Replace the first paragraph of 22.3.1.1 [locale.types] with:</p>
  <blockquote>
  <p>
*************** of the other enumerated values; implemen
*** 16965,16976 ****
  
  <hr>
  <h3><a name="349"></a>349. Minor typographical error in ostream_iterator</h3>
! <p><b>Section:</b> 24.6.2 [ostream.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-10-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>24.5.2 [lib.ostream.iterator] states:</p>
! <pre>    [...]
  
      private:
      // basic_ostream&lt;charT,traits&gt;* out_stream; exposition only
--- 16541,16553 ----
  
  <hr>
  <h3><a name="349"></a>349. Minor typographical error in ostream_iterator</h3>
! <p><b>Section:</b> 24.6.2 [ostream.iterator] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2001-10-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>24.5.2 [lib.ostream.iterator] states:</p>
! <pre>
!     [...]
  
      private:
      // basic_ostream&lt;charT,traits&gt;* out_stream; exposition only
*************** In 24.6.2 [ostream.iterator], replace <t
*** 16993,17002 ****
  
  <hr>
  <h3><a name="352"></a>352. missing fpos requirements</h3>
! <p><b>Section:</b> 21.2.2 [char.traits.typedefs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-12-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#char.traits.typedefs">issues</a> in [char.traits.typedefs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <i>(1)</i>
--- 16570,16579 ----
  
  <hr>
  <h3><a name="352"></a>352. missing fpos requirements</h3>
! <p><b>Section:</b> 21.2.2 [char.traits.typedefs] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-12-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#char.traits.typedefs">issues</a> in [char.traits.typedefs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <i>(1)</i>
*************** be considered NAD.</p>
*** 17050,17059 ****
  
  <hr>
  <h3><a name="353"></a>353. <tt>std::pair</tt> missing template assignment</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-12-02 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The class template <tt>std::pair</tt> defines a template ctor (20.2.2, p4) but
--- 16627,16636 ----
  
  <hr>
  <h3><a name="353"></a>353. <tt>std::pair</tt> missing template assignment</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2001-12-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The class template <tt>std::pair</tt> defines a template ctor (20.2.2, p4) but
*************** instead of just a straight assignment.
*** 17071,17084 ****
  <p>
  Add the following declaration to the definition of <tt>std::pair</tt>:
  </p>
! <pre>    template&lt;class U, class V&gt;
      pair&amp; operator=(const pair&lt;U, V&gt; &amp;p);
  </pre>
  <p>
  And also add a paragraph describing the effects of the function template to the
  end of 20.2.2:
  </p>
! <pre>    template&lt;class U, class V&gt;
      pair&amp; operator=(const pair&lt;U, V&gt; &amp;p);
  </pre>
  <p>
--- 16648,16663 ----
  <p>
  Add the following declaration to the definition of <tt>std::pair</tt>:
  </p>
! <pre>
!     template&lt;class U, class V&gt;
      pair&amp; operator=(const pair&lt;U, V&gt; &amp;p);
  </pre>
  <p>
  And also add a paragraph describing the effects of the function template to the
  end of 20.2.2:
  </p>
! <pre>
!     template&lt;class U, class V&gt;
      pair&amp; operator=(const pair&lt;U, V&gt; &amp;p);
  </pre>
  <p>
*************** end of 20.2.2:
*** 17087,17093 ****
      <b>Returns</b>: <tt>*this</tt>
  </p>
  
! <p><i>[Curaçao: There is no indication this is was anything other than
  a design decision, and thus NAD.&nbsp; May be appropriate for a future
  standard.]</i></p>
  
--- 16666,16672 ----
      <b>Returns</b>: <tt>*this</tt>
  </p>
  
! <p><i>[Cura&ccedil;ao: There is no indication this is was anything other than
  a design decision, and thus NAD.&nbsp; May be appropriate for a future
  standard.]</i></p>
  
*************** and thus moved from NAD Future to <del>N
*** 17105,17115 ****
  
  <hr>
  <h3><a name="354"></a>354. Associative container lower/upper bound requirements</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Hans Aberg <b>Opened:</b> 2001-12-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Discussions in the thread "Associative container lower/upper bound
--- 16684,16694 ----
  
  <hr>
  <h3><a name="354"></a>354. Associative container lower/upper bound requirements</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Hans Aberg <b>Opened:</b> 2001-12-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Discussions in the thread "Associative container lower/upper bound
*************** key greater than k, or a.end() if such a
*** 17161,17167 ****
  </p>
  </blockquote>
  
! <p><i>[Curaçao: LWG reviewed PR.]</i></p>
  
  
  
--- 16740,16746 ----
  </p>
  </blockquote>
  
! <p><i>[Cura&ccedil;ao: LWG reviewed PR.]</i></p>
  
  
  
*************** key greater than k, or a.end() if such a
*** 17172,17191 ****
  
  <hr>
  <h3><a name="355"></a>355. Operational semantics for a.back()</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Yaroslav Mironov <b>Opened:</b> 2002-01-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>Table 68 "Optional Sequence Operations" in 23.1.1/12
! specifies operational semantics for "a.back()" as
! "*--a.end()", which may be ill-formed <i>[because calling
  operator-- on a temporary (the return) of a built-in type is
  ill-formed]</i>, provided a.end() returns a simple pointer rvalue
  (this is almost always the case for std::vector::end(), for
  example). Thus, the specification is not only incorrect, it
! demonstrates a dangerous construct: "--a.end()" may
  successfully compile and run as intended, but after changing the type
  of the container or the mode of compilation it may produce
  compile-time error. </p>
--- 16751,16770 ----
  
  <hr>
  <h3><a name="355"></a>355. Operational semantics for a.back()</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Yaroslav Mironov <b>Opened:</b> 2002-01-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>Table 68 &quot;Optional Sequence Operations&quot; in 23.1.1/12
! specifies operational semantics for &quot;a.back()&quot; as
! &quot;*--a.end()&quot;, which may be ill-formed <i>[because calling
  operator-- on a temporary (the return) of a built-in type is
  ill-formed]</i>, provided a.end() returns a simple pointer rvalue
  (this is almost always the case for std::vector::end(), for
  example). Thus, the specification is not only incorrect, it
! demonstrates a dangerous construct: &quot;--a.end()&quot; may
  successfully compile and run as intended, but after changing the type
  of the container or the mode of compilation it may produce
  compile-time error. </p>
*************** compile-time error. </p>
*** 17193,17230 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the specification in table 68 "Optional Sequence
! Operations" in 23.1.1/12 for "a.back()" from</p>
  
  
! <blockquote><pre>*--a.end()
  </pre></blockquote>
  
  <p>to</p>
  
! <blockquote><pre>  { iterator tmp = a.end(); --tmp; return *tmp; }
  </pre></blockquote>
  
  <p>and the specification for "a.pop_back()" from</p>
  
! <blockquote><pre>a.erase(--a.end())
  </pre></blockquote>
  
  <p>to</p>
  
! <blockquote><pre>  { iterator tmp = a.end(); --tmp; a.erase(tmp); }
  </pre></blockquote>
  
! <p><i>[Curaçao: LWG changed PR from "{ X::iterator tmp =
! a.end(); return *--tmp; }" to "*a.rbegin()", and from
! "{ X::iterator tmp = a.end(); a.erase(--tmp); }" to
! "a.erase(rbegin())".]</i></p>
  
  
! <p><i>[There is a second possible defect; table 68 "Optional
! Sequence Operations" in the "Operational Semantics"
! column uses operations present only in the "Reversible
! Container" requirements, yet there is no stated dependency
  between these separate requirements tables. Ask in Santa Cruz if the
  LWG would like a new issue opened.]</i></p>
  
--- 16772,16813 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the specification in table 68 &quot;Optional Sequence
! Operations&quot; in 23.1.1/12 for &quot;a.back()&quot; from</p>
  
  
! <blockquote><pre>
! *--a.end()
  </pre></blockquote>
  
  <p>to</p>
  
! <blockquote><pre>
!   { iterator tmp = a.end(); --tmp; return *tmp; }
  </pre></blockquote>
  
  <p>and the specification for "a.pop_back()" from</p>
  
! <blockquote><pre>
! a.erase(--a.end())
  </pre></blockquote>
  
  <p>to</p>
  
! <blockquote><pre>
!   { iterator tmp = a.end(); --tmp; a.erase(tmp); }
  </pre></blockquote>
  
! <p><i>[Cura&ccedil;ao: LWG changed PR from &quot;{ X::iterator tmp =
! a.end(); return *--tmp; }&quot; to &quot;*a.rbegin()&quot;, and from
! &quot;{ X::iterator tmp = a.end(); a.erase(--tmp); }&quot; to
! &quot;a.erase(rbegin())&quot;.]</i></p>
  
  
! <p><i>[There is a second possible defect; table 68 &quot;Optional
! Sequence Operations&quot; in the &quot;Operational Semantics&quot;
! column uses operations present only in the &quot;Reversible
! Container&quot; requirements, yet there is no stated dependency
  between these separate requirements tables. Ask in Santa Cruz if the
  LWG would like a new issue opened.]</i></p>
  
*************** LWG would like a new issue opened.]</i><
*** 17254,17263 ****
  
  <hr>
  <h3><a name="358"></a>358. interpreting <tt>thousands_sep</tt> after a <tt>decimal_point</tt></h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-03-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I don't think <tt>thousands_sep</tt> is being treated correctly after
--- 16837,16847 ----
  
  <hr>
  <h3><a name="358"></a>358. interpreting <tt>thousands_sep</tt> after a <tt>decimal_point</tt></h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I don't think <tt>thousands_sep</tt> is being treated correctly after
*************** Change the first sentence of 22.2.2.1.2,
*** 17314,17326 ****
  
  <hr>
  <h3><a name="359"></a>359. num_put&lt;&gt;::do_put (..., bool) undocumented</h3>
! <p><b>Section:</b> 22.4.2.2.1 [facet.num.put.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-03-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>22.2.2.2.1, p1:</p>
  
!     <pre>    iter_type put (iter_type out, ios_base&amp; str, char_type fill,
                     bool val) const;
      ...
  
--- 16898,16911 ----
  
  <hr>
  <h3><a name="359"></a>359. num_put&lt;&gt;::do_put (..., bool) undocumented</h3>
! <p><b>Section:</b> 22.4.2.2.1 [facet.num.put.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>22.2.2.2.1, p1:</p>
  
!     <pre>
!     iter_type put (iter_type out, ios_base&amp; str, char_type fill,
                     bool val) const;
      ...
  
*************** Change the first sentence of 22.2.2.1.2,
*** 17331,17337 ****
  however, 22.2.2.2.2, p23:</p>
  
  <blockquote>
! <pre>iter_type put (iter_type out, ios_base&amp; str, char_type fill,
                 bool val) const;
  </pre>
  
--- 16916,16923 ----
  however, 22.2.2.2.2, p23:</p>
  
  <blockquote>
! <pre>
! iter_type put (iter_type out, ios_base&amp; str, char_type fill,
                 bool val) const;
  </pre>
  
*************** however, 22.2.2.2.2, p23:</p>
*** 17339,17345 ****
          <p>Effects: If (str.flags() &amp; ios_base::boolalpha) == 0 then do
               out = do_put(out, str, fill, (int)val)
             Otherwise do</p>
! <pre>             string_type s =
                   val ? use_facet&lt;ctype&lt;charT&gt; &gt;(loc).truename()
                       : use_facet&lt;ctype&lt;charT&gt; &gt;(loc).falsename();
  </pre>
--- 16925,16932 ----
          <p>Effects: If (str.flags() &amp; ios_base::boolalpha) == 0 then do
               out = do_put(out, str, fill, (int)val)
             Otherwise do</p>
! <pre>
!              string_type s =
                   val ? use_facet&lt;ctype&lt;charT&gt; &gt;(loc).truename()
                       : use_facet&lt;ctype&lt;charT&gt; &gt;(loc).falsename();
  </pre>
*************** In 22.4.2.2.2 [facet.num.put.virtuals],
*** 17389,17395 ****
           ios_base::boolalpha) == 0</tt> then
           <tt>do_put (out, str, fill, (long)val)</tt>
           Otherwise the function obtains a string <tt>s</tt> as if by</p>
! <pre>             string_type s =
                  val ? use_facet&lt;ctype&lt;charT&gt; &gt;(loc).truename()
                      : use_facet&lt;ctype&lt;charT&gt; &gt;(loc).falsename();
  </pre>
--- 16976,16983 ----
           ios_base::boolalpha) == 0</tt> then
           <tt>do_put (out, str, fill, (long)val)</tt>
           Otherwise the function obtains a string <tt>s</tt> as if by</p>
! <pre>
!              string_type s =
                  val ? use_facet&lt;ctype&lt;charT&gt; &gt;(loc).truename()
                      : use_facet&lt;ctype&lt;charT&gt; &gt;(loc).falsename();
  </pre>
*************** be a requirement of gratuitous inefficie
*** 17410,17419 ****
  
  <hr>
  <h3><a name="360"></a>360. locale mandates inefficient implementation</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-03-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.1.1, p7 (copied below) allows iostream formatters and extractors
--- 16998,17007 ----
  
  <hr>
  <h3><a name="360"></a>360. locale mandates inefficient implementation</h3>
! <p><b>Section:</b> 22.3.1 [locale] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale">issues</a> in [locale].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.1.1, p7 (copied below) allows iostream formatters and extractors
*************** prevents locale from being implemented e
*** 17460,17478 ****
  
  <hr>
  <h3><a name="362"></a>362. bind1st/bind2nd type safety</h3>
! <p><b>Section:</b> D.11 [depr.lib.binders] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Demkin <b>Opened:</b> 2002-04-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#depr.lib.binders">issues</a> in [depr.lib.binders].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The definition of bind1st() (D.11 [depr.lib.binders]) can result in
  the construction of an unsafe binding between incompatible pointer
  types. For example, given a function whose first parameter type is
  'pointer to T', it's possible without error to bind an argument of
  type 'pointer to U' when U does not derive from T:
  </p>
! <pre>   foo(T*, int);
  
     struct T {};
     struct U {};
--- 17048,17067 ----
  
  <hr>
  <h3><a name="362"></a>362. bind1st/bind2nd type safety</h3>
! <p><b>Section:</b> X [depr.lib.binders] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andrew Demkin <b>Opened:</b> 2002-04-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.lib.binders">issues</a> in [depr.lib.binders].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The definition of bind1st() (X [depr.lib.binders]) can result in
  the construction of an unsafe binding between incompatible pointer
  types. For example, given a function whose first parameter type is
  'pointer to T', it's possible without error to bind an argument of
  type 'pointer to U' when U does not derive from T:
  </p>
! <pre>
!    foo(T*, int);
  
     struct T {};
     struct U {};
*************** The definition of bind1st() includes a f
*** 17490,17509 ****
  map its argument to the expected argument type of the bound function
  (see below):
  </p>
! <pre>  typename Operation::first_argument_type(x)
  </pre>
  
  <p>
! A functional-style conversion (D.11 [depr.lib.binders]) is defined to be
! semantically equivalent to an explicit cast expression (D.11 [depr.lib.binders]), which may (according to 5.4, paragraph 5) be interpreted
  as a reinterpret_cast, thus masking the error.
  </p>
  
! <p>The problem and proposed change also apply to D.11 [depr.lib.binders].</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add this sentence to the end of D.11 [depr.lib.binders]/1:
    "Binders <tt>bind1st</tt> and <tt>bind2nd</tt> are deprecated in
    favor of <tt>std::tr1::bind</tt>."</p>
  
--- 17079,17099 ----
  map its argument to the expected argument type of the bound function
  (see below):
  </p>
! <pre>
!   typename Operation::first_argument_type(x)
  </pre>
  
  <p>
! A functional-style conversion (X [depr.lib.binders]) is defined to be
! semantically equivalent to an explicit cast expression (X [depr.lib.binders]), which may (according to 5.4, paragraph 5) be interpreted
  as a reinterpret_cast, thus masking the error.
  </p>
  
! <p>The problem and proposed change also apply to X [depr.lib.binders].</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add this sentence to the end of X [depr.lib.binders]/1:
    "Binders <tt>bind1st</tt> and <tt>bind2nd</tt> are deprecated in
    favor of <tt>std::tr1::bind</tt>."</p>
  
*************** as a reinterpret_cast, thus masking the
*** 17522,17531 ****
  
  <hr>
  <h3><a name="363"></a>363. Missing exception specification in 27.4.2.1.1</h3>
! <p><b>Section:</b> 27.5.2.1.1 [ios::failure] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown and Marc Paterno <b>Opened:</b> 2002-05-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios::failure">issues</a> in [ios::failure].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The destructor of ios_base::failure should have an empty throw
--- 17112,17121 ----
  
  <hr>
  <h3><a name="363"></a>363. Missing exception specification in 27.4.2.1.1</h3>
! <p><b>Section:</b> 27.5.3.1.1 [ios::failure] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown and Marc Paterno <b>Opened:</b> 2002-05-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios::failure">issues</a> in [ios::failure].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The destructor of ios_base::failure should have an empty throw
*************** declared in this way.
*** 17536,17542 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Change the destructor to</p>
! <pre>  virtual ~failure() throw();
  </pre>
  
  
--- 17126,17133 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Change the destructor to</p>
! <pre>
!   virtual ~failure() throw();
  </pre>
  
  
*************** declared in this way.
*** 17549,17561 ****
  
  <hr>
  <h3><a name="364"></a>364. Inconsistent wording in 27.5.2.4.2</h3>
! <p><b>Section:</b> 27.6.2.4.2 [streambuf.virt.buffer] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown, Marc Paterno <b>Opened:</b> 2002-05-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#streambuf.virt.buffer">issues</a> in [streambuf.virt.buffer].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 27.6.2.4.2 [streambuf.virt.buffer] paragraph 1 is inconsistent with the Effects
  clause for seekoff.
  </p>
  
--- 17140,17152 ----
  
  <hr>
  <h3><a name="364"></a>364. Inconsistent wording in 27.5.2.4.2</h3>
! <p><b>Section:</b> 27.6.3.4.2 [streambuf.virt.buffer] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown, Marc Paterno <b>Opened:</b> 2002-05-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#streambuf.virt.buffer">issues</a> in [streambuf.virt.buffer].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 27.6.3.4.2 [streambuf.virt.buffer] paragraph 1 is inconsistent with the Effects
  clause for seekoff.
  </p>
  
*************** for each class derived from basic_stream
*** 17595,17604 ****
  
  <hr>
  <h3><a name="365"></a>365. Lack of const-qualification in clause 27</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown, Marc Paterno <b>Opened:</b> 2002-05-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Some stream and streambuf member functions are declared non-const,
--- 17186,17195 ----
  
  <hr>
  <h3><a name="365"></a>365. Lack of const-qualification in clause 27</h3>
! <p><b>Section:</b> 27 [input.output] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown, Marc Paterno <b>Opened:</b> 2002-05-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#input.output">issues</a> in [input.output].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Some stream and streambuf member functions are declared non-const,
*************** document N1360 for details and rationale
*** 17610,17633 ****
  <p>The list of member functions under discussion: <tt>in_avail</tt>,
  <tt>showmanyc</tt>, <tt>tellg</tt>, <tt>tellp</tt>, <tt>is_open</tt>.</p>
  
! <p>Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#73">73</a></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 27.8.1.5, 27.8.1.7, 27.8.1.8, 27.8.1.10, 27.8.1.11, and 27.8.1.13</p>
  <p>Replace</p>
! <pre>  bool is_open();
  </pre>
  <p>with</p>
! <pre>  bool is_open() const;
  </pre>
  
  
  <p><b>Rationale:</b></p>
  <p>Of the changes proposed in N1360, the only one that is safe is
  changing the filestreams' is_open to const.  The LWG believed that
! this was NAD the first time it considered this issue (issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#73">73</a>), but now thinks otherwise.  The corresponding streambuf
  member function, after all,is already const.</p>
  
  <p>The other proposed changes are less safe, because some streambuf
--- 17201,17226 ----
  <p>The list of member functions under discussion: <tt>in_avail</tt>,
  <tt>showmanyc</tt>, <tt>tellg</tt>, <tt>tellp</tt>, <tt>is_open</tt>.</p>
  
! <p>Related issue: <a href="lwg-closed.html#73">73</a></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>In 27.8.1.5, 27.8.1.7, 27.8.1.8, 27.8.1.10, 27.8.1.11, and 27.8.1.13</p>
  <p>Replace</p>
! <pre>
!   bool is_open();
  </pre>
  <p>with</p>
! <pre>
!   bool is_open() const;
  </pre>
  
  
  <p><b>Rationale:</b></p>
  <p>Of the changes proposed in N1360, the only one that is safe is
  changing the filestreams' is_open to const.  The LWG believed that
! this was NAD the first time it considered this issue (issue <a href="lwg-closed.html#73">73</a>), but now thinks otherwise.  The corresponding streambuf
  member function, after all,is already const.</p>
  
  <p>The other proposed changes are less safe, because some streambuf
*************** way by providing both overloads; this wo
*** 17648,17657 ****
  
  <hr>
  <h3><a name="369"></a>369. io stream objects and static ctors</h3>
! <p><b>Section:</b> 27.4 [iostream.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ruslan Abdikeev <b>Opened:</b> 2002-07-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.objects">issues</a> in [iostream.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Is it safe to use standard iostream objects from constructors of
--- 17241,17250 ----
  
  <hr>
  <h3><a name="369"></a>369. io stream objects and static ctors</h3>
! <p><b>Section:</b> 27.4 [iostream.objects] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ruslan Abdikeev <b>Opened:</b> 2002-07-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.objects">issues</a> in [iostream.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Is it safe to use standard iostream objects from constructors of
*************** initialized non-local objects defined la
*** 17742,17748 ****
  <p>
  The original proposed resolution unconditionally required
  implementations to define an ios_base::Init object of some
! implementation-defined name in the header &lt;iostream&gt;. That's an
  overspecification. First, defining the object may be unnecessary
  and even detrimental to performance if an implementation can
  guarantee that the 8 standard iostream objects will be initialized
--- 17335,17341 ----
  <p>
  The original proposed resolution unconditionally required
  implementations to define an ios_base::Init object of some
! implementation-defined name in the header &lt;iostream>. That's an
  overspecification. First, defining the object may be unnecessary
  and even detrimental to performance if an implementation can
  guarantee that the 8 standard iostream objects will be initialized
*************** do to ensure that stream objects are con
*** 17760,17774 ****
  
  <hr>
  <h3><a name="370"></a>370. Minor error in basic_istream::get</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-07-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Defect report for description of basic_istream::get (section 27.7.1.3 [istream.unformatted]), paragraph 15. The description for the get function
  with the following signature:</p>
  
! <pre>  basic_istream&lt;charT,traits&gt;&amp; get(basic_streambuf&lt;char_type,traits&gt;&amp;
    sb);
  </pre>
  
--- 17353,17369 ----
  
  <hr>
  <h3><a name="370"></a>370. Minor error in basic_istream::get</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-07-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Defect report for description of basic_istream::get (section 27.7.2.3 [istream.unformatted]), paragraph 15. The description for the get function
  with the following signature:</p>
  
! <pre>
!   basic_istream&lt;charT,traits&gt;&amp; get(basic_streambuf&lt;char_type,traits&gt;&amp;
    sb);
  </pre>
  
*************** with the following signature:</p>
*** 17788,17798 ****
  <p><b>Proposed resolution:</b></p>
  <p>Change the <b>Effects</b> paragraph to:</p>
  <blockquote><p>
!   Effects: Calls get(sb,this-&gt;widen('\n'))
  </p></blockquote>
  
  <p><i>[Pre-Oxford: Minor correction from Howard: replaced 'widen' 
!       with 'this-&gt;widen'.]</i></p>
  
  
  
--- 17383,17393 ----
  <p><b>Proposed resolution:</b></p>
  <p>Change the <b>Effects</b> paragraph to:</p>
  <blockquote><p>
!   Effects: Calls get(sb,this->widen('\n'))
  </p></blockquote>
  
  <p><i>[Pre-Oxford: Minor correction from Howard: replaced 'widen' 
!       with 'this->widen'.]</i></p>
  
  
  
*************** with the following signature:</p>
*** 17804,17813 ****
  
  <hr>
  <h3><a name="371"></a>371. Stability of multiset and multimap member functions</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Frank Compagner <b>Opened:</b> 2002-07-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirements for multiset and multimap containers (23.1
--- 17399,17409 ----
  
  <hr>
  <h3><a name="371"></a>371. Stability of multiset and multimap member functions</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Frank Compagner <b>Opened:</b> 2002-07-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirements for multiset and multimap containers (23.1
*************** following 'idiom' that removes elements
*** 17825,17831 ****
  function.
  </p>
  
! <pre>  multimap&lt;int, int&gt; m;
    multimap&lt;int, int&gt;::iterator i = m.begin();
    while (i != m.end()) {
        if (pred(i))
--- 17421,17428 ----
  function.
  </p>
  
! <pre>
!   multimap&lt;int, int&gt; m;
    multimap&lt;int, int&gt;::iterator i = m.begin();
    while (i != m.end()) {
        if (pred(i))
*************** be hard to track down by users. This wou
*** 17860,17866 ****
  erase_if() member function that much greater.
  </p>
  
! <p>This issue is somewhat related to LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#130">130</a>.</p>
  
  
  
--- 17457,17463 ----
  erase_if() member function that much greater.
  </p>
  
! <p>This issue is somewhat related to LWG issue <a href="lwg-defects.html#130">130</a>.</p>
  
  
  
*************** wording.]</i></p>
*** 17897,17920 ****
  
  <hr>
  <h3><a name="373"></a>373. Are basic_istream and basic_ostream to use (exceptions()&amp;badbit) != 0 ?</h3>
! <p><b>Section:</b> 27.7.1.2.1 [istream.formatted.reqmts], 27.7.2.6.1 [ostream.formatted.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Keith Baker <b>Opened:</b> 2002-07-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.formatted.reqmts">issues</a> in [istream.formatted.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! In 27.7.1.2.1 [istream.formatted.reqmts] and 27.7.2.6.1 [ostream.formatted.reqmts]
  (exception()&amp;badbit) != 0 is used in testing for rethrow, yet
  exception() is the constructor to class std::exception in 18.7.1 [type.info] that has no return type. Should member function
! exceptions() found in 27.5.4 [ios] be used instead?
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.7.1.2.1 [istream.formatted.reqmts] and 27.7.2.6.1 [ostream.formatted.reqmts], change
  "(exception()&amp;badbit) != 0" to "(exceptions()&amp;badbit) != 0".
  </p>
  
--- 17494,17517 ----
  
  <hr>
  <h3><a name="373"></a>373. Are basic_istream and basic_ostream to use (exceptions()&amp;badbit) != 0 ?</h3>
! <p><b>Section:</b> 27.7.2.2.1 [istream.formatted.reqmts], 27.7.3.6.1 [ostream.formatted.reqmts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Keith Baker <b>Opened:</b> 2002-07-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.formatted.reqmts">issues</a> in [istream.formatted.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! In 27.7.2.2.1 [istream.formatted.reqmts] and 27.7.3.6.1 [ostream.formatted.reqmts]
  (exception()&amp;badbit) != 0 is used in testing for rethrow, yet
  exception() is the constructor to class std::exception in 18.7.1 [type.info] that has no return type. Should member function
! exceptions() found in 27.5.5 [ios] be used instead?
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.7.2.2.1 [istream.formatted.reqmts] and 27.7.3.6.1 [ostream.formatted.reqmts], change
  "(exception()&amp;badbit) != 0" to "(exceptions()&amp;badbit) != 0".
  </p>
  
*************** In 27.7.1.2.1 [istream.formatted.reqmts]
*** 17928,17940 ****
  
  <hr>
  <h3><a name="375"></a>375. basic_ios should be ios_base in 27.7.1.3</h3>
! <p><b>Section:</b> 27.8.1.4 [stringbuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-08-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Section 27.8.1.4 [stringbuf.virtuals]: Table 90, Table 91, and paragraph
  14 all contain references to "basic_ios::" which should be
  "ios_base::".
  </p>
--- 17525,17537 ----
  
  <hr>
  <h3><a name="375"></a>375. basic_ios should be ios_base in 27.7.1.3</h3>
! <p><b>Section:</b> 27.8.2.4 [stringbuf.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-08-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Section 27.8.2.4 [stringbuf.virtuals]: Table 90, Table 91, and paragraph
  14 all contain references to "basic_ios::" which should be
  "ios_base::".
  </p>
*************** paragraph 14 to "ios_base".
*** 17954,17966 ****
  
  <hr>
  <h3><a name="376"></a>376. basic_streambuf semantics</h3>
! <p><b>Section:</b> 27.8.1.4 [stringbuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-08-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Section 27.8.1.4 [stringbuf.virtuals], Table 90, the implication is that
  the four conditions should be mutually exclusive, but they are not.
  The first two cases, as written, are subcases of the third.</p>
  
--- 17551,17563 ----
  
  <hr>
  <h3><a name="376"></a>376. basic_streambuf semantics</h3>
! <p><b>Section:</b> 27.8.2.4 [stringbuf.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2002-08-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Section 27.8.2.4 [stringbuf.virtuals], Table 90, the implication is that
  the four conditions should be mutually exclusive, but they are not.
  The first two cases, as written, are subcases of the third.</p>
  
*************** are both true, but case 3 is false.
*** 18004,18031 ****
  
  <hr>
  <h3><a name="379"></a>379. nonsensical ctype::do_widen() requirement</h3>
! <p><b>Section:</b> 22.4.1.1.2 [locale.ctype.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-09-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.ctype.virtuals">issues</a> in [locale.ctype.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The last sentence in 22.2.1.1.2, p11 below doesn't seem to make sense.
  </p>
! <pre>  charT do_widen (char c) const;
  
    -11- Effects: Applies the simplest reasonable transformation from
         a char value or sequence of char values to the corresponding
         charT value or values. The only characters for which unique
         transformations are required are those in the basic source
         character set (2.2). For any named ctype category with a
!        ctype&lt;charT&gt; facet ctw and valid ctype_base::mask value
         M (is(M, c) || !ctw.is(M, do_widen(c))) is true.
  </pre>
  <p>
  Shouldn't the last sentence instead read
  </p>
! <pre>       For any named ctype category with a ctype&lt;char&gt; facet ctc
         and valid ctype_base::mask value M
         (ctc.is(M, c) || !is(M, do_widen(c))) is true.
  </pre>
--- 17601,17630 ----
  
  <hr>
  <h3><a name="379"></a>379. nonsensical ctype::do_widen() requirement</h3>
! <p><b>Section:</b> 22.4.1.1.2 [locale.ctype.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-09-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.ctype.virtuals">issues</a> in [locale.ctype.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The last sentence in 22.2.1.1.2, p11 below doesn't seem to make sense.
  </p>
! <pre>
!   charT do_widen (char c) const;
  
    -11- Effects: Applies the simplest reasonable transformation from
         a char value or sequence of char values to the corresponding
         charT value or values. The only characters for which unique
         transformations are required are those in the basic source
         character set (2.2). For any named ctype category with a
!        ctype&lt;charT> facet ctw and valid ctype_base::mask value
         M (is(M, c) || !ctw.is(M, do_widen(c))) is true.
  </pre>
  <p>
  Shouldn't the last sentence instead read
  </p>
! <pre>
!        For any named ctype category with a ctype&lt;char> facet ctc
         and valid ctype_base::mask value M
         (ctc.is(M, c) || !is(M, do_widen(c))) is true.
  </pre>
*************** footnote 224.)
*** 18041,18047 ****
  Replace the last sentence of 22.4.1.1.2 [locale.ctype.virtuals], p11 with the
  following text:
  </p>
! <pre>       For any named ctype category with a ctype&lt;char&gt; facet ctc
         and valid ctype_base::mask value M,
         (ctc.is(M, c) || !is(M, do_widen(c))) is true.
  </pre>
--- 17640,17647 ----
  Replace the last sentence of 22.4.1.1.2 [locale.ctype.virtuals], p11 with the
  following text:
  </p>
! <pre>
!        For any named ctype category with a ctype&lt;char> facet ctc
         and valid ctype_base::mask value M,
         (ctc.is(M, c) || !is(M, do_widen(c))) is true.
  </pre>
*************** following text:
*** 18060,18069 ****
  
  <hr>
  <h3><a name="380"></a>380. typos in codecvt tables 53 and 54</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-09-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Tables 53 and 54 in 22.4.1.5 [locale.codecvt.byname] are both titled "convert
--- 17660,17669 ----
  
  <hr>
  <h3><a name="380"></a>380. typos in codecvt tables 53 and 54</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-09-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Tables 53 and 54 in 22.4.1.5 [locale.codecvt.byname] are both titled "convert
*************** elements was needed to terminate a seque
*** 18098,18107 ****
  
  <hr>
  <h3><a name="381"></a>381. detection of invalid mbstate_t in codecvt</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-09-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  All but one codecvt member functions that take a state_type argument
--- 17698,17707 ----
  
  <hr>
  <h3><a name="381"></a>381. detection of invalid mbstate_t in codecvt</h3>
! <p><b>Section:</b> 22.4.1.5 [locale.codecvt.byname] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2002-09-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.byname">issues</a> in [locale.codecvt.byname].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  All but one codecvt member functions that take a state_type argument
*************** cases, I propose the following:
*** 18125,18137 ****
  Add a new paragraph before 22.2.1.5.2, p5, and after the function
  declaration below
  </p>
! <pre>    result do_unshift(stateT&amp; state,
      externT* to, externT* to_limit, externT*&amp; to_next) const;
  </pre>
  <p>
  as follows:
  </p>
! <pre>    Requires: (to &lt;= to_end) well defined and true; state initialized,
      if at the beginning of a sequence, or else equal to the result of
      converting the preceding characters in the sequence.
  </pre>
--- 17725,17739 ----
  Add a new paragraph before 22.2.1.5.2, p5, and after the function
  declaration below
  </p>
! <pre>
!     result do_unshift(stateT&amp; state,
      externT* to, externT* to_limit, externT*&amp; to_next) const;
  </pre>
  <p>
  as follows:
  </p>
! <pre>
!     Requires: (to &lt;= to_end) well defined and true; state initialized,
      if at the beginning of a sequence, or else equal to the result of
      converting the preceding characters in the sequence.
  </pre>
*************** as follows:
*** 18139,18150 ****
  and change the text in Table 54, row 4, the <b>error</b> row, under
  the heading Meaning, from
  </p>
! <pre>    state has invalid value
  </pre>
  <p>
  to
  </p>
! <pre>    an unspecified error has occurred
  </pre>
  
  
--- 17741,17754 ----
  and change the text in Table 54, row 4, the <b>error</b> row, under
  the heading Meaning, from
  </p>
! <pre>
!     state has invalid value
  </pre>
  <p>
  to
  </p>
! <pre>
!     an unspecified error has occurred
  </pre>
  
  
*************** values, or that choose to detect any oth
*** 18162,18171 ****
  
  <hr>
  <h3><a name="383"></a>383. Bidirectional iterator assertion typo</h3>
! <p><b>Section:</b> 24.2.6 [bidirectional.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> ysapir (submitted via comp.std.c++) <b>Opened:</b> 2002-10-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bidirectional.iterators">issues</a> in [bidirectional.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Following a discussion on the boost list regarding end iterators and
--- 17766,17775 ----
  
  <hr>
  <h3><a name="383"></a>383. Bidirectional iterator assertion typo</h3>
! <p><b>Section:</b> 24.2.6 [bidirectional.iterators] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> ysapir (submitted via comp.std.c++) <b>Opened:</b> 2002-10-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bidirectional.iterators">issues</a> in [bidirectional.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Following a discussion on the boost list regarding end iterators and
*************** with that discussion.
*** 18178,18185 ****
  I have checked this newsgroup, as well as attempted a search of the
  Active/Defect/Closed Issues List on the site for the words "s is
  derefer" so I believe this has not been proposed before.  Furthermore,
! the "Lists by Index" mentions only DR <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a> on section
! 24.1.4, and DR <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a> is not related to this issue.
  </p>
  
  <p>
--- 17782,17789 ----
  I have checked this newsgroup, as well as attempted a search of the
  Active/Defect/Closed Issues List on the site for the words "s is
  derefer" so I believe this has not been proposed before.  Furthermore,
! the "Lists by Index" mentions only DR <a href="lwg-closed.html#299">299</a> on section
! 24.1.4, and DR <a href="lwg-closed.html#299">299</a> is not related to this issue.
  </p>
  
  <p>
*************** The standard makes the following asserti
*** 18187,18193 ****
  in section 24.1.4 [lib.bidirectional.iterators], Table 75:
  </p>
  
! <pre>                         operational  assertion/note
  expression  return type   semantics    pre/post-condition
  
  --r          X&amp;                        pre: there exists s such
--- 17791,17798 ----
  in section 24.1.4 [lib.bidirectional.iterators], Table 75:
  </p>
  
! <pre>
!                          operational  assertion/note
  expression  return type   semantics    pre/post-condition
  
  --r          X&amp;                        pre: there exists s such
*************** expression  return type   semantics    p
*** 18199,18205 ****
  </pre>
  
  <p>
! (See <a href="http://aspn.activestate.com/ASPN/Mail/Message/boost/1395763">http://aspn.activestate.com/ASPN/Mail/Message/boost/1395763</a>.)
  </p>
  
  <p>
--- 17804,17810 ----
  </pre>
  
  <p>
! (See <a href="http://lists.boost.org/Archives/boost/2002/10/37636.php">http://lists.boost.org/Archives/boost/2002/10/37636.php</a>.)
  </p>
  
  <p>
*************** Change the guarantee to "postcondition:
*** 18231,18240 ****
  
  <hr>
  <h3><a name="384"></a>384. equal_range has unimplementable runtime complexity</h3>
! <p><b>Section:</b> 25.4.3.3 [equal.range] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Hans Bos <b>Opened:</b> 2002-10-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#equal.range">issues</a> in [equal.range].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 25.4.3.3 [equal.range]
--- 17836,17845 ----
  
  <hr>
  <h3><a name="384"></a>384. equal_range has unimplementable runtime complexity</h3>
! <p><b>Section:</b> 25.4.3.3 [equal.range] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Hans Bos <b>Opened:</b> 2002-10-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#equal.range">issues</a> in [equal.range].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 25.4.3.3 [equal.range]
*************** comparisons are allowed for equal_range.
*** 18245,18251 ****
  <p>It is not possible to implement equal_range with these constraints.</p>
  
  <p>In a range of one element as in:</p>
! <pre>    int x = 1;
      equal_range(&amp;x, &amp;x + 1, 1)
  </pre>
  
--- 17850,17857 ----
  <p>It is not possible to implement equal_range with these constraints.</p>
  
  <p>In a range of one element as in:</p>
! <pre>
!     int x = 1;
      equal_range(&amp;x, &amp;x + 1, 1)
  </pre>
  
*************** comparisons are allowed for equal_range.
*** 18255,18261 ****
  
  <p>I have checked a few libraries and they all use the same (nonconforming)
  algorithm for equal_range that has a complexity of</p>
! <pre>     2* log(distance(first, last)) + 2.
  </pre>
  <p>I guess this is the algorithm that the standard assumes for equal_range.</p>
  
--- 17861,17868 ----
  
  <p>I have checked a few libraries and they all use the same (nonconforming)
  algorithm for equal_range that has a complexity of</p>
! <pre>
!      2* log(distance(first, last)) + 2.
  </pre>
  <p>I guess this is the algorithm that the standard assumes for equal_range.</p>
  
*************** to <tt>2*log<sub>2</sub>(last - first) +
*** 18303,18311 ****
  
  <hr>
  <h3><a name="386"></a>386. Reverse iterator's operator[] has impossible return type</h3>
! <p><b>Section:</b> 24.5.1.3.11 [reverse.iter.op-=] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2002-10-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 24.5.1.3.11 [reverse.iter.op-=], <tt>reverse_iterator&lt;&gt;::operator[]</tt> 
  is specified as having a return type of <tt>reverse_iterator::reference</tt>,
--- 17910,17918 ----
  
  <hr>
  <h3><a name="386"></a>386. Reverse iterator's operator[] has impossible return type</h3>
! <p><b>Section:</b> 24.5.1.3.11 [reverse.iter.op-=] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2002-10-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In 24.5.1.3.11 [reverse.iter.op-=], <tt>reverse_iterator&lt;&gt;::operator[]</tt> 
  is specified as having a return type of <tt>reverse_iterator::reference</tt>,
*************** which is the same as <tt>iterator_traits
*** 18319,18325 ****
    to <tt>Iterator</tt>'s value type.  The return type specified for
    reverse_iterator's operator[] would thus appear to be impossible.</p>
  
! <p>With the resolution of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#299">299</a>, the type of
    <tt>a[n]</tt> will continue to be required (for random access
    iterators) to be convertible to the value type, and also <tt>a[n] =
    t</tt> will be a valid expression.  Implementations of
--- 17926,17932 ----
    to <tt>Iterator</tt>'s value type.  The return type specified for
    reverse_iterator's operator[] would thus appear to be impossible.</p>
  
! <p>With the resolution of issue <a href="lwg-closed.html#299">299</a>, the type of
    <tt>a[n]</tt> will continue to be required (for random access
    iterators) to be convertible to the value type, and also <tt>a[n] =
    t</tt> will be a valid expression.  Implementations of
*************** which is the same as <tt>iterator_traits
*** 18336,18349 ****
  <p>In 24.5.1.2 [reverse.iter.requirements] change:</p>
  
  <blockquote>
! <pre>reference operator[](difference_type n) const;
  </pre>
  </blockquote>
  
  <p>to:</p>
  
  <blockquote>
! <pre><b><i>unspecified</i></b> operator[](difference_type n) const; // see 24.2.7 [random.access.iterators]
  </pre>
  </blockquote>
  
--- 17943,17958 ----
  <p>In 24.5.1.2 [reverse.iter.requirements] change:</p>
  
  <blockquote>
! <pre>
! reference operator[](difference_type n) const;
  </pre>
  </blockquote>
  
  <p>to:</p>
  
  <blockquote>
! <pre>
! <b><i>unspecified</i></b> operator[](difference_type n) const; // see 24.2.7 [random.access.iterators]
  </pre>
  </blockquote>
  
*************** Comments from Dave Abrahams: IMO we shou
*** 18365,18389 ****
  
  
  <hr>
! <h3><a name="387"></a>387. std::complex over-encapsulated</h3>
! <p><b>Section:</b> 26.4 [complex.numbers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2002-11-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.numbers">issues</a> in [complex.numbers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The absence of explicit description of std::complex&lt;T&gt; layout
  makes it imposible to reuse existing software developed in traditional
  languages like Fortran or C with unambigous and commonly accepted
  layout assumptions.  There ought to be a way for practitioners to
! predict with confidence the layout of std::complex&lt;T&gt; whenever T
  is a numerical datatype.  The absence of ways to access individual
! parts of a std::complex&lt;T&gt; object as lvalues unduly promotes
  severe pessimizations. For example, the only way to change,
  independently, the real and imaginary parts is to write something like
  </p>
  
! <pre>complex&lt;T&gt; z;
  // ...
  // set the real part to r
  z = complex&lt;T&gt;(r, z.imag());
--- 17974,18000 ----
  
  
  <hr>
! <h3><a name="387"></a>387. <tt>std::complex</tt> over-encapsulated</h3>
! <p><b>Section:</b> 26.4 [complex.numbers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2002-11-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#complex.numbers">active issues</a> in [complex.numbers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.numbers">issues</a> in [complex.numbers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The absence of explicit description of <tt>std::complex&lt;T&gt;</tt> layout
  makes it imposible to reuse existing software developed in traditional
  languages like Fortran or C with unambigous and commonly accepted
  layout assumptions.  There ought to be a way for practitioners to
! predict with confidence the layout of <tt>std::complex&lt;T&gt;</tt> whenever <tt>T</tt>
  is a numerical datatype.  The absence of ways to access individual
! parts of a <tt>std::complex&lt;T&gt;</tt> object as lvalues unduly promotes
  severe pessimizations. For example, the only way to change,
  independently, the real and imaginary parts is to write something like
  </p>
  
! <pre>
! complex&lt;T&gt; z;
  // ...
  // set the real part to r
  z = complex&lt;T&gt;(r, z.imag());
*************** is, in effect, just a pair of numbers wi
*** 18398,18404 ****
  maintain.  Existing practice in numerical computations has it that a
  complex number datatype is usually represented by Cartesian
  coordinates. Therefore the over-encapsulation put in the specification
! of std::complex&lt;&gt; is not justified.
  </p>
  
  
--- 18009,18015 ----
  maintain.  Existing practice in numerical computations has it that a
  complex number datatype is usually represented by Cartesian
  coordinates. Therefore the over-encapsulation put in the specification
! of <tt>std::complex&lt;&gt;</tt> is not justified.
  </p>
  
  
*************** of std::complex&lt;&gt; is not justified
*** 18406,18433 ****
  <p><b>Proposed resolution:</b></p>
  <p>Add the following requirements to 26.4 [complex.numbers] as 26.3/4:</p>
  <blockquote>
! <p>If z is an lvalue expression of type cv std::complex&lt;T&gt; then</p>
  
  <ul>
! <li>the expression reinterpret_cast&lt;cv T(&amp;)[2]&gt;(z)
  is well-formed; and</li>
! <li>reinterpret_cast&lt;cv T(&amp;)[2]&gt;(z)[0]designates the
! real part of z; and</li>
! <li>reinterpret_cast&lt;cv T(&amp;)[2]&gt;(z)[1]designates the
! imaginary part of z.</li>
  </ul>
  
  <p>
! Moreover, if a is an expression of pointer type cv complex&lt;T&gt;*
! and the expression a[i] is well-defined for an integer expression
! i then:
  </p>
  
  <ul>
! <li>reinterpret_cast&lt;cv T*&gt;(a)[2*i] designates the real
! part of a[i]; and</li>
! <li>reinterpret_cast&lt;cv T*&gt;(a)[2*i+1] designates the
! imaginary part of a[i].</li>
  </ul>
  </blockquote>
  
--- 18017,18044 ----
  <p><b>Proposed resolution:</b></p>
  <p>Add the following requirements to 26.4 [complex.numbers] as 26.3/4:</p>
  <blockquote>
! <p>If <tt>z</tt> is an lvalue expression of type <i>cv</i> <tt>std::complex&lt;T&gt;</tt> then</p>
  
  <ul>
! <li>the expression <tt>reinterpret_cast&lt;cv T(&amp;)[2]&gt;(z)</tt>
  is well-formed; and</li>
! <li><tt>reinterpret_cast&lt;cv T(&amp;)[2]&gt;(z)[0]</tt> designates the
! real part of <tt>z</tt>; and</li>
! <li><tt>reinterpret_cast&lt;cv T(&amp;)[2]&gt;(z)[1]</tt> designates the
! imaginary part of <tt>z</tt>.</li>
  </ul>
  
  <p>
! Moreover, if <tt>a</tt> is an expression of pointer type <i>cv</i> <tt>complex&lt;T&gt;*</tt>
! and the expression <tt>a[i]</tt> is well-defined for an integer expression
! <tt>i</tt> then:
  </p>
  
  <ul>
! <li><tt>reinterpret_cast&lt;cv T*&gt;(a)[2*i]</tt> designates the real
! part of <tt>a[i]</tt>; and</li>
! <li><tt>reinterpret_cast&lt;cv T*&gt;(a)[2*i+1]</tt> designates the
! imaginary part of <tt>a[i]</tt>.</li>
  </ul>
  </blockquote>
  
*************** In 26.4.2 [complex] and 26.4.3 [complex.
*** 18436,18442 ****
  (changing <tt>T</tt> to concrete types as appropriate for the specializations).
  </p>
  
! <blockquote><pre>void real(T);
  void imag(T);
  </pre></blockquote>
  
--- 18047,18054 ----
  (changing <tt>T</tt> to concrete types as appropriate for the specializations).
  </p>
  
! <blockquote><pre>
! void real(T);
  void imag(T);
  </pre></blockquote>
  
*************** Add to 26.4.4 [complex.members]
*** 18445,18477 ****
  </p>
  
  <blockquote>
! <pre>T real() const;
  </pre>
! <blockquote>
  <i>Returns:</i> the value of the real component
! </blockquote>
! <pre>void real(T val);
  </pre>
! <blockquote>
! Assigns val to the real component.
! </blockquote>
! <pre>T imag() const;
  </pre>
! <blockquote>
  <i>Returns:</i> the value of the imaginary component
! </blockquote>
! <pre>void imag(T val);
  </pre>
! <blockquote>
! Assigns val to the imaginary component.
! </blockquote>
  </blockquote>
  
  <p><i>[Kona: The layout guarantee is absolutely necessary for C
    compatibility.  However, there was disagreement about the other part
    of this proposal: retrieving elements of the complex number as
!   lvalues.  An alternative: continue to have real() and imag() return
!   rvalues, but add set_real() and set_imag().  Straw poll: return
    lvalues - 2, add setter functions - 5.  Related issue: do we want
    reinterpret_cast as the interface for converting a complex to an
    array of two reals, or do we want to provide a more explicit way of
--- 18057,18093 ----
  </p>
  
  <blockquote>
! <pre>
! T real() const;
  </pre>
! <blockquote><p>
  <i>Returns:</i> the value of the real component
! </p></blockquote>
! <pre>
! void real(T val);
  </pre>
! <blockquote><p>
! Assigns <tt>val</tt> to the real component.
! </p></blockquote>
! <pre>
! T imag() const;
  </pre>
! <blockquote><p>
  <i>Returns:</i> the value of the imaginary component
! </p></blockquote>
! <pre>
! void imag(T val);
  </pre>
! <blockquote><p>
! Assigns <tt>val</tt> to the imaginary component.
! </p></blockquote>
  </blockquote>
  
  <p><i>[Kona: The layout guarantee is absolutely necessary for C
    compatibility.  However, there was disagreement about the other part
    of this proposal: retrieving elements of the complex number as
!   lvalues.  An alternative: continue to have <tt>real()</tt> and <tt>imag()</tt> return
!   rvalues, but add <tt>set_real()</tt> and <tt>set_imag()</tt>.  Straw poll: return
    lvalues - 2, add setter functions - 5.  Related issue: do we want
    reinterpret_cast as the interface for converting a complex to an
    array of two reals, or do we want to provide a more explicit way of
*************** Bellevue:
*** 18487,18514 ****
  ]</i></p>
  
  
! <blockquote>
  Second half of proposed wording replaced and moved to Ready.
! </blockquote>
  
  <p><i>[
  Pre-Sophia Antipolis, Howard adds:
  ]</i></p>
  
  
! <blockquote>
  Added the members to 26.4.3 [complex.special] and changed from Ready to Review.
! </blockquote>
  
  <p><i>[
  Post-Sophia Antipolis:
  ]</i></p>
  
  
! <blockquote>
  Moved from WP back to Ready so that the "and 26.4.3 [complex.special]" in the proposed
  resolution can be officially applied.
! </blockquote>
  
  
  
--- 18103,18130 ----
  ]</i></p>
  
  
! <blockquote><p>
  Second half of proposed wording replaced and moved to Ready.
! </p></blockquote>
  
  <p><i>[
  Pre-Sophia Antipolis, Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
  Added the members to 26.4.3 [complex.special] and changed from Ready to Review.
! </p></blockquote>
  
  <p><i>[
  Post-Sophia Antipolis:
  ]</i></p>
  
  
! <blockquote><p>
  Moved from WP back to Ready so that the "and 26.4.3 [complex.special]" in the proposed
  resolution can be officially applied.
! </p></blockquote>
  
  
  
*************** existing implementations already have th
*** 18523,18536 ****
  
  <hr>
  <h3><a name="389"></a>389. Const overload of valarray::operator[] returns by value</h3>
! <p><b>Section:</b> 26.6.2.3 [valarray.access] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2002-11-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.access">issues</a> in [valarray.access].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#77">77</a></p>
  <p><b>Discussion:</b></p>
  <p>Consider the following program:</p>
! <pre>    #include &lt;iostream&gt;
      #include &lt;ostream&gt;
      #include &lt;vector&gt;
      #include &lt;valarray&gt;
--- 18139,18153 ----
  
  <hr>
  <h3><a name="389"></a>389. Const overload of valarray::operator[] returns by value</h3>
! <p><b>Section:</b> 26.6.2.4 [valarray.access] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2002-11-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.access">issues</a> in [valarray.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#77">77</a></p>
  <p><b>Discussion:</b></p>
  <p>Consider the following program:</p>
! <pre>
!     #include &lt;iostream&gt;
      #include &lt;ostream&gt;
      #include &lt;vector&gt;
      #include &lt;valarray&gt;
*************** should not return a const T&amp;.</p>
*** 18571,18581 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>In the class synopsis in 26.6.2 [template.valarray], and in
! 26.6.2.3 [valarray.access] just above paragraph 1, change</p>
! <pre>  T operator[](size_t const);
  </pre>
  <p>to</p>
! <pre>  const T&amp; operator[](size_t const);
  </pre>
  
  <p><i>[Kona: fixed a minor typo: put semicolon at the end of the line
--- 18188,18200 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>In the class synopsis in 26.6.2 [template.valarray], and in
! 26.6.2.4 [valarray.access] just above paragraph 1, change</p>
! <pre>
!   T operator[](size_t const);
  </pre>
  <p>to</p>
! <pre>
!   const T&amp; operator[](size_t const);
  </pre>
  
  <p><i>[Kona: fixed a minor typo: put semicolon at the end of the line
*************** impact on allowable optimizations.</p>
*** 18597,18605 ****
  
  <hr>
  <h3><a name="391"></a>391. non-member functions specified as const</h3>
! <p><b>Section:</b> 22.3.3.2 [conversions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2002-12-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The specifications of toupper and tolower both specify the functions as
--- 18216,18224 ----
  
  <hr>
  <h3><a name="391"></a>391. non-member functions specified as const</h3>
! <p><b>Section:</b> 22.3.3.2 [conversions] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2002-12-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The specifications of toupper and tolower both specify the functions as
*************** const in the header file synopsis in sec
*** 18620,18629 ****
  
  <hr>
  <h3><a name="395"></a>395. inconsistencies in the definitions of rand() and random_shuffle()</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2003-01-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 26.8 [c.math], the C++ standard refers to the C standard for the
--- 18239,18249 ----
  
  <hr>
  <h3><a name="395"></a>395. inconsistencies in the definitions of rand() and random_shuffle()</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2003-01-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 26.8 [c.math], the C++ standard refers to the C standard for the
*************** implementation is permitted to use <tt>r
*** 18674,18683 ****
  
  <hr>
  <h3><a name="396"></a>396. what are characters zero and one</h3>
! <p><b>Section:</b> 20.5.1 [bitset.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-01-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitset.cons">issues</a> in [bitset.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
  23.3.5.1, p6 [lib.bitset.cons] talks about a generic character
--- 18294,18303 ----
  
  <hr>
  <h3><a name="396"></a>396. what are characters zero and one</h3>
! <p><b>Section:</b> 20.6.1 [bitset.cons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-01-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitset.cons">issues</a> in [bitset.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
      <p>
  23.3.5.1, p6 [lib.bitset.cons] talks about a generic character
*************** that means for charT other than char and
*** 18686,18702 ****
  those two types, the values 0 and 1 are not actually what is
  intended -- the values '0' and '1' are. This, along with the
  converse problem in the description of to_string() in 23.3.5.2,
! p33, looks like a defect remotely related to DR 303.
      </p>
      <p>
! http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#303
      </p>
!     <pre>23.3.5.1:
    -6-  An element of the constructed string has value zero if the
         corresponding character in str, beginning at position pos,
         is 0. Otherwise, the element has the value one.
      </pre>
!     <pre>23.3.5.2:
    -33-  Effects: Constructs a string object of the appropriate
          type and initializes it to a string of length N characters.
          Each character is determined by the value of its
--- 18306,18324 ----
  those two types, the values 0 and 1 are not actually what is
  intended -- the values '0' and '1' are. This, along with the
  converse problem in the description of to_string() in 23.3.5.2,
! p33, looks like a defect remotely related to DR <a href="lwg-defects.html#303">303</a>.
      </p>
      <p>
! http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#303
      </p>
!     <pre>
! 23.3.5.1:
    -6-  An element of the constructed string has value zero if the
         corresponding character in str, beginning at position pos,
         is 0. Otherwise, the element has the value one.
      </pre>
!     <pre>
! 23.3.5.2:
    -33-  Effects: Constructs a string object of the appropriate
          type and initializes it to a string of length N characters.
          Each character is determined by the value of its
*************** Sophia Antipolis:
*** 18719,18731 ****
  <blockquote>
  <p>
  We note that <tt>bitset</tt> has been moved from section 23 to section 20, by
! another issue (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#842">842</a>) previously resolved at this meeting.
  </p>
  <p>
  Disposition: move to ready.
  </p>
  <p>
! We request that Howard submit a separate issue regarding the three to_string overloads.
  </p>
  </blockquote>
  
--- 18341,18353 ----
  <blockquote>
  <p>
  We note that <tt>bitset</tt> has been moved from section 23 to section 20, by
! another issue (<a href="lwg-defects.html#842">842</a>) previously resolved at this meeting.
  </p>
  <p>
  Disposition: move to ready.
  </p>
  <p>
! We request that Howard submit a separate issue regarding the three <tt>to_string</tt> overloads.
  </p>
  </blockquote>
  
*************** We request that Howard submit a separate
*** 18733,18740 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Change the constructor's function declaration immediately before 
! 20.5.1 [bitset.cons] p3 to:</p>
! <pre>    template &lt;class charT, class traits, class Allocator&gt;
      explicit
      bitset(const basic_string&lt;charT, traits, Allocator&gt;&amp; str,
             typename basic_string&lt;charT, traits, Allocator&gt;::size_type pos = 0,
--- 18355,18363 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Change the constructor's function declaration immediately before 
! 20.6.1 [bitset.cons] p3 to:</p>
! <pre>
!     template &lt;class charT, class traits, class Allocator&gt;
      explicit
      bitset(const basic_string&lt;charT, traits, Allocator&gt;&amp; str,
             typename basic_string&lt;charT, traits, Allocator&gt;::size_type pos = 0,
*************** We request that Howard submit a separate
*** 18742,18748 ****
               basic_string&lt;charT, traits, Allocator&gt;::npos,
             charT zero = charT('0'), charT one = charT('1'))
  </pre>
! <p>Change the first two sentences of 20.5.1 [bitset.cons] p6 to: "An
  element of the constructed string has value 0 if the corresponding
  character in <i>str</i>, beginning at position <i>pos</i>,
  is <i>zero</i>. Otherwise, the element has the value 1.</p>
--- 18365,18371 ----
               basic_string&lt;charT, traits, Allocator&gt;::npos,
             charT zero = charT('0'), charT one = charT('1'))
  </pre>
! <p>Change the first two sentences of 20.6.1 [bitset.cons] p6 to: "An
  element of the constructed string has value 0 if the corresponding
  character in <i>str</i>, beginning at position <i>pos</i>,
  is <i>zero</i>. Otherwise, the element has the value 1.</p>
*************** is <i>zero</i>. Otherwise, the element h
*** 18755,18771 ****
  </p>
  
  <p>Change the declaration of the <tt>to_string</tt> member function
!   immediately before 20.5.2 [bitset.members] p33 to:</p>
! <pre>    template &lt;class charT, class traits, class Allocator&gt;
      basic_string&lt;charT, traits, Allocator&gt; 
      to_string(charT zero = charT('0'), charT one = charT('1')) const;
  </pre>
! <p>Change the last sentence of 20.5.2 [bitset.members] p33 to: "Bit
    value 0 becomes the character <tt><i>zero</i></tt>, bit value 1 becomes the
    character <tt><i>one</i></tt>.</p>
! <p>Change 20.5.4 [bitset.operators] p8 to:</p>
  <p><b>Returns</b>:</p> 
! <pre>  os &lt;&lt; x.template to_string&lt;charT,traits,allocator&lt;charT&gt; &gt;(
        use_facet&lt;ctype&lt;charT&gt; &gt;(<i>os</i>.getloc()).widen('0'),
        use_facet&lt;ctype&lt;charT&gt; &gt;(<i>os</i>.getloc()).widen('1'));
  </pre>
--- 18378,18396 ----
  </p>
  
  <p>Change the declaration of the <tt>to_string</tt> member function
!   immediately before 20.6.2 [bitset.members] p33 to:</p>
! <pre>
!     template &lt;class charT, class traits, class Allocator&gt;
      basic_string&lt;charT, traits, Allocator&gt; 
      to_string(charT zero = charT('0'), charT one = charT('1')) const;
  </pre>
! <p>Change the last sentence of 20.6.2 [bitset.members] p33 to: "Bit
    value 0 becomes the character <tt><i>zero</i></tt>, bit value 1 becomes the
    character <tt><i>one</i></tt>.</p>
! <p>Change 20.6.4 [bitset.operators] p8 to:</p>
  <p><b>Returns</b>:</p> 
! <pre>
!   os &lt;&lt; x.template to_string&lt;charT,traits,allocator&lt;charT&gt; &gt;(
        use_facet&lt;ctype&lt;charT&gt; &gt;(<i>os</i>.getloc()).widen('0'),
        use_facet&lt;ctype&lt;charT&gt; &gt;(<i>os</i>.getloc()).widen('1'));
  </pre>
*************** is <i>zero</i>. Otherwise, the element h
*** 18781,18787 ****
    resolution allows those users who care about this issue to get it
    right.</p>
  <p>We fix the inserter to use the new arguments.  Note that we already
!   fixed the analogous problem with the extractor in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#303">303</a>.</p>
  
  
  
--- 18406,18412 ----
    resolution allows those users who care about this issue to get it
    right.</p>
  <p>We fix the inserter to use the new arguments.  Note that we already
!   fixed the analogous problem with the extractor in issue <a href="lwg-defects.html#303">303</a>.</p>
  
  
  
*************** post Bellevue:
*** 18790,18824 ****
  ]</i></p>
  
  
! <blockquote>
  We are happy with the resolution as proposed, and we move this to Ready.
! </blockquote>
  
  <p><i>[
  Howard adds:
  ]</i></p>
  
  
! <blockquote>
! The proposed wording neglects the 3 newer to_string overloads.
! </blockquote>
  
  
  
  
  <hr>
  <h3><a name="400"></a>400. redundant type cast in lib.allocator.members</h3>
! <p><b>Section:</b> 20.9.5.1 [allocator.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Markus Mauhart <b>Opened:</b> 2003-02-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.9.5.1 [allocator.members] allocator members, contains
  the following 3 lines:
  </p>
  
! <pre>  12 Returns: new((void *) p) T( val)
       void destroy(pointer p);
    13 Returns: ((T*) p)-&gt;~T()
  </pre>
--- 18415,18450 ----
  ]</i></p>
  
  
! <blockquote><p>
  We are happy with the resolution as proposed, and we move this to Ready.
! </p></blockquote>
  
  <p><i>[
  Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
! The proposed wording neglects the 3 newer <tt>to_string</tt> overloads.
! </p></blockquote>
  
  
  
  
  <hr>
  <h3><a name="400"></a>400. redundant type cast in lib.allocator.members</h3>
! <p><b>Section:</b> 20.7.9.1 [allocator.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Markus Mauhart <b>Opened:</b> 2003-02-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.7.9.1 [allocator.members] allocator members, contains
  the following 3 lines:
  </p>
  
! <pre>
!   12 Returns: new((void *) p) T( val)
       void destroy(pointer p);
    13 Returns: ((T*) p)-&gt;~T()
  </pre>
*************** Replace "((T*) p)" with "p".
*** 18842,18858 ****
  
  <hr>
  <h3><a name="401"></a>401.  incorrect type casts in table 32 in lib.allocator.requirements</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Markus Mauhart <b>Opened:</b> 2003-02-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I think that in par2 of  [default.con.req] the last two
  lines of table 32 contain two incorrect type casts. The lines are ...
  </p>
  
! <pre>  a.construct(p,t)   Effect: new((void*)p) T(t)
    a.destroy(p)       Effect: ((T*)p)?-&gt;~T()
  </pre>
  
--- 18468,18486 ----
  
  <hr>
  <h3><a name="401"></a>401.  incorrect type casts in table 32 in lib.allocator.requirements</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Markus Mauhart <b>Opened:</b> 2003-02-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I think that in par2 of  [default.con.req] the last two
  lines of table 32 contain two incorrect type casts. The lines are ...
  </p>
  
! <pre>
!   a.construct(p,t)   Effect: new((void*)p) T(t)
    a.destroy(p)       Effect: ((T*)p)?-&gt;~T()
  </pre>
  
*************** lines of table 32 contain two incorrect
*** 18861,18867 ****
  from table 31:
  </p>
  
! <pre>  alloc&lt;T&gt;             a     ;// an allocator for T
    alloc&lt;T&gt;::pointer    p     ;// random access iterator
                                // (may be different from T*)
    alloc&lt;T&gt;::reference  r = *p;// T&amp;
--- 18489,18496 ----
  from table 31:
  </p>
  
! <pre>
!   alloc&lt;T&gt;             a     ;// an allocator for T
    alloc&lt;T&gt;::pointer    p     ;// random access iterator
                                // (may be different from T*)
    alloc&lt;T&gt;::reference  r = *p;// T&amp;
*************** issue to Ready status to be voted into t
*** 18925,18953 ****
  
  <hr>
  <h3><a name="402"></a>402. wrong new expression in [some_]allocator::construct</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements], 20.9.5.1 [allocator.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Markus Mauhart <b>Opened:</b> 2003-02-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This applies to the new expression that is contained in both par12 of
! 20.9.5.1 [allocator.members] and in par2 (table 32) of  [default.con.req].
  I think this new expression is wrong, involving unintended side
  effects.
  </p>
  
  
! <p>20.9.5.1 [allocator.members]  contains the following 3 lines:</p>
  
! <pre>  11 Returns: the largest value N for which the call allocate(N,0) might succeed.
       void construct(pointer p, const_reference val);
    12 Returns: new((void *) p) T( val)
  </pre>
  
  
  <p> [default.con.req] in table 32 has the following line:</p>
! <pre>  a.construct(p,t)   Effect: new((void*)p) T(t)
  </pre>
  
  <p>
--- 18554,18585 ----
  
  <hr>
  <h3><a name="402"></a>402. wrong new expression in [some_]allocator::construct</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements], 20.7.9.1 [allocator.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Markus Mauhart <b>Opened:</b> 2003-02-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This applies to the new expression that is contained in both par12 of
! 20.7.9.1 [allocator.members] and in par2 (table 32) of  [default.con.req].
  I think this new expression is wrong, involving unintended side
  effects.
  </p>
  
  
! <p>20.7.9.1 [allocator.members]  contains the following 3 lines:</p>
  
! <pre>
!   11 Returns: the largest value N for which the call allocate(N,0) might succeed.
       void construct(pointer p, const_reference val);
    12 Returns: new((void *) p) T( val)
  </pre>
  
  
  <p> [default.con.req] in table 32 has the following line:</p>
! <pre>
!   a.construct(p,t)   Effect: new((void*)p) T(t)
  </pre>
  
  <p>
*************** effects.
*** 18955,18961 ****
  especially from table 31:
  </p>
  
! <pre>  alloc&lt;T&gt;             a     ;// an allocator for T
    alloc&lt;T&gt;::pointer    p     ;// random access iterator
                                // (may be different from T*)
    alloc&lt;T&gt;::reference  r = *p;// T&amp;
--- 18587,18594 ----
  especially from table 31:
  </p>
  
! <pre>
!   alloc&lt;T&gt;             a     ;// an allocator for T
    alloc&lt;T&gt;::pointer    p     ;// random access iterator
                                // (may be different from T*)
    alloc&lt;T&gt;::reference  r = *p;// T&amp;
*************** Replace "new" with "::new" in both cases
*** 18991,19000 ****
  
  <hr>
  <h3><a name="403"></a>403. basic_string::swap should not throw exceptions</h3>
! <p><b>Section:</b> 21.4.6.8 [string::swap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2003-03-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::swap">issues</a> in [string::swap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 18624,18633 ----
  
  <hr>
  <h3><a name="403"></a>403. basic_string::swap should not throw exceptions</h3>
! <p><b>Section:</b> 21.4.6.8 [string::swap] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2003-03-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::swap">issues</a> in [string::swap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** Throws: Shall not throw exceptions.
*** 19059,19067 ****
  
  <hr>
  <h3><a name="404"></a>404. May a replacement allocation function be declared inline?</h3>
! <p><b>Section:</b> 17.6.3.6 [replacement.functions], 18.6.1 [new.delete] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-04-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The eight basic dynamic memory allocation functions (single-object
--- 18692,18701 ----
  
  <hr>
  <h3><a name="404"></a>404. May a replacement allocation function be declared inline?</h3>
! <p><b>Section:</b> 17.6.4.6 [replacement.functions], 18.6.1 [new.delete] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-04-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#replacement.functions">issues</a> in [replacement.functions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The eight basic dynamic memory allocation functions (single-object
*************** in preference to the implementation's de
*** 19073,19079 ****
  
  <p>
  Three different parts of the standard mention requirements on
! replacement functions: 17.6.3.6 [replacement.functions], 18.6.1.1 [new.delete.single]
  and 18.6.1.2 [new.delete.array], and 3.7.3 [basic.stc.auto].
  </p>
  
--- 18707,18713 ----
  
  <p>
  Three different parts of the standard mention requirements on
! replacement functions: 17.6.4.6 [replacement.functions], 18.6.1.1 [new.delete.single]
  and 18.6.1.2 [new.delete.array], and 3.7.3 [basic.stc.auto].
  </p>
  
*************** and 18.6.1.2 [new.delete.array], and 3.7
*** 19091,19097 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new sentence to the end of 17.6.3.6 [replacement.functions] paragraph 3:
  "The program's definitions shall not be specified as <tt>inline</tt>.
  No diagnostic is required."
  </p>
--- 18725,18731 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new sentence to the end of 17.6.4.6 [replacement.functions] paragraph 3:
  "The program's definitions shall not be specified as <tt>inline</tt>.
  No diagnostic is required."
  </p>
*************** believed to be of limited value.
*** 19116,19125 ****
  
  <hr>
  <h3><a name="405"></a>405. qsort and POD</h3>
! <p><b>Section:</b> 25.5 [alg.c.library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2003-04-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.c.library">issues</a> in [alg.c.library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 25.5 [alg.c.library] describes bsearch and qsort, from the C
--- 18750,18759 ----
  
  <hr>
  <h3><a name="405"></a>405. qsort and POD</h3>
! <p><b>Section:</b> 25.5 [alg.c.library] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ray Lischner <b>Opened:</b> 2003-04-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.c.library">issues</a> in [alg.c.library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 25.5 [alg.c.library] describes bsearch and qsort, from the C
*************** type."
*** 19148,19157 ****
  
  <hr>
  <h3><a name="406"></a>406. vector::insert(s) exception safety</h3>
! <p><b>Section:</b> 23.4.1.4 [vector.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2003-04-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is a possible defect in the standard: the standard text was
--- 18782,18792 ----
  
  <hr>
  <h3><a name="406"></a>406. vector::insert(s) exception safety</h3>
! <p><b>Section:</b> 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2003-04-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.modifiers">active issues</a> in [vector.modifiers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is a possible defect in the standard: the standard text was
*************** existing implementation.
*** 19165,19171 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace 23.4.1.4 [vector.modifiers] paragraph 1 with:</p>
  <blockquote><p>
    1- Notes: Causes reallocation if the new size is greater than the
    old capacity. If no reallocation happens, all the iterators and
--- 18800,18806 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Replace 23.3.6.5 [vector.modifiers] paragraph 1 with:</p>
  <blockquote><p>
    1- Notes: Causes reallocation if the new size is greater than the
    old capacity. If no reallocation happens, all the iterators and
*************** existing implementation.
*** 19184,19193 ****
  
  <hr>
  <h3><a name="407"></a>407. Can singular iterators be destroyed?</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 2003-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Clause X [iterator.concepts], paragraph 5, says that the only expression
--- 18819,18828 ----
  
  <hr>
  <h3><a name="407"></a>407. Can singular iterators be destroyed?</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 2003-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Clause X [iterator.concepts], paragraph 5, says that the only expression
*************** of a non-singular value to an iterator t
*** 19212,19221 ****
  
  <hr>
  <h3><a name="409"></a>409. Closing an fstream should clear error state</h3>
! <p><b>Section:</b> 27.9.1.9 [ifstream.members], 27.9.1.13 [ofstream.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 2003-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ifstream.members">issues</a> in [ifstream.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A strict reading of 27.9.1 [fstreams] shows that opening or
--- 18847,18856 ----
  
  <hr>
  <h3><a name="409"></a>409. Closing an fstream should clear error state</h3>
! <p><b>Section:</b> 27.9.1.9 [ifstream.members], 27.9.1.13 [ofstream.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nathan Myers <b>Opened:</b> 2003-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ifstream.members">issues</a> in [ifstream.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A strict reading of 27.9.1 [fstreams] shows that opening or
*************** the EOF bit in the stream's error state
*** 19226,19232 ****
  counterintuitive.
  </p>
  <p>
! The LWG considered this issue once before, as issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#22">22</a>,
  and put in a footnote to clarify that the strict reading was indeed
  correct.  We did that because we believed the standard was
  unambiguous and consistent, and that we should not make architectural
--- 18861,18867 ----
  counterintuitive.
  </p>
  <p>
! The LWG considered this issue once before, as issue <a href="lwg-defects.html#22">22</a>,
  and put in a footnote to clarify that the strict reading was indeed
  correct.  We did that because we believed the standard was
  unambiguous and consistent, and that we should not make architectural
*************** language, those considerations no longer
*** 19240,19276 ****
  <p>Change 27.9.1.9 [ifstream.members], para. 3 from:</p>
  
  <blockquote><p>
! Calls rdbuf()-&gt;open(s,mode|in). If that function returns a null pointer, calls setstate(failbit) (which may throw ios_base::failure [Footnote: (lib.iostate.flags)].
  </p></blockquote>
  
  <p>to:</p>
  
  <blockquote><p>
! Calls rdbuf()-&gt;open(s,mode|in). If that function returns a null pointer, calls setstate(failbit) (which may throw ios_base::failure [Footnote: (lib.iostate.flags)), else calls clear().
  </p></blockquote>
  
  <p>Change 27.9.1.13 [ofstream.members], para. 3 from:</p>
  
  <blockquote><p>
! Calls rdbuf()-&gt;open(s,mode|out). If that function returns a null pointer, calls setstate(failbit) (which may throw ios_base::failure [Footnote: (lib.iostate.flags)).
  </p></blockquote>
  
  <p>to:</p>
  
  <blockquote><p>
! Calls rdbuf()-&gt;open(s,mode|out). If that function returns a null pointer, calls setstate(failbit) (which may throw ios_base::failure [Footnote: (lib.iostate.flags)), else calls clear().
  </p></blockquote>
  
  <p>Change 27.9.1.17 [fstream.members], para. 3 from:</p>
  
  <blockquote><p>
! Calls rdbuf()-&gt;open(s,mode), If that function returns a null pointer, calls setstate(failbit), (which may throw ios_base::failure). (lib.iostate.flags) )
  </p></blockquote>
  
  <p>to:</p>
  
  <blockquote><p>
! Calls rdbuf()-&gt;open(s,mode), If that function returns a null pointer, calls setstate(failbit), (which may throw ios_base::failure). (lib.iostate.flags) ), else calls clear().
  </p></blockquote>
  
  
--- 18875,18911 ----
  <p>Change 27.9.1.9 [ifstream.members], para. 3 from:</p>
  
  <blockquote><p>
! Calls rdbuf()->open(s,mode|in). If that function returns a null pointer, calls setstate(failbit) (which may throw ios_base::failure [Footnote: (lib.iostate.flags)].
  </p></blockquote>
  
  <p>to:</p>
  
  <blockquote><p>
! Calls rdbuf()->open(s,mode|in). If that function returns a null pointer, calls setstate(failbit) (which may throw ios_base::failure [Footnote: (lib.iostate.flags)), else calls clear().
  </p></blockquote>
  
  <p>Change 27.9.1.13 [ofstream.members], para. 3 from:</p>
  
  <blockquote><p>
! Calls rdbuf()->open(s,mode|out). If that function returns a null pointer, calls setstate(failbit) (which may throw ios_base::failure [Footnote: (lib.iostate.flags)).
  </p></blockquote>
  
  <p>to:</p>
  
  <blockquote><p>
! Calls rdbuf()->open(s,mode|out). If that function returns a null pointer, calls setstate(failbit) (which may throw ios_base::failure [Footnote: (lib.iostate.flags)), else calls clear().
  </p></blockquote>
  
  <p>Change 27.9.1.17 [fstream.members], para. 3 from:</p>
  
  <blockquote><p>
! Calls rdbuf()->open(s,mode), If that function returns a null pointer, calls setstate(failbit), (which may throw ios_base::failure). (lib.iostate.flags) )
  </p></blockquote>
  
  <p>to:</p>
  
  <blockquote><p>
! Calls rdbuf()->open(s,mode), If that function returns a null pointer, calls setstate(failbit), (which may throw ios_base::failure). (lib.iostate.flags) ), else calls clear().
  </p></blockquote>
  
  
*************** flags.]</i></p>
*** 19295,19363 ****
  
  <hr>
  <h3><a name="410"></a>410. Missing semantics for stack and queue comparison operators</h3>
! <p><b>Section:</b> 23.3.4.1 [list.cons], 23.3.4.3 [list.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Hans Bos <b>Opened:</b> 2003-06-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.cons">issues</a> in [list.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Sections 23.3.4.1 [list.cons] and 23.3.4.3 [list.modifiers] list
  comparison operators (==, !=, &lt;, &lt;=, &gt;, =&gt;) for queue and
! stack.  Only the semantics for queue::operator== (23.3.4.1 [list.cons] par2) and queue::operator&lt; (23.3.4.1 [list.cons]
  par3) are defined.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Add the following new paragraphs after 23.3.4.1 [list.cons]
    paragraph 3:</p>
  
  <blockquote>
  
! <pre>  operator!=
  </pre>
  <p>Returns: <tt>x.c != y.c</tt></p>
  
! <pre>  operator&gt;
  </pre>
  <p>Returns: <tt>x.c &gt; y.c</tt></p>
  
! <pre>  operator&lt;=
  </pre>
  <p>Returns: <tt>x.c &lt;= y.c</tt></p>
  
! <pre>  operator&gt;=
  </pre>
  <p>Returns: <tt>x.c &gt;= y.c</tt></p>
  
  </blockquote>
  
! <p>Add the following paragraphs at the end of 23.3.4.3 [list.modifiers]:</p>
  
  <blockquote>
  
! <pre>  operator==
  </pre>
  <p>Returns: <tt>x.c == y.c</tt></p>
  
! <pre>  operator&lt;
  </pre>
  <p>Returns: <tt>x.c &lt; y.c</tt></p>
  
! <pre>  operator!=
  </pre>
  <p>Returns: <tt>x.c != y.c</tt></p>
  
! <pre>  operator&gt;
  </pre>
  <p>Returns: <tt>x.c &gt; y.c</tt></p>
  
! <pre>  operator&lt;=
  </pre>
  <p>Returns: <tt>x.c &lt;= y.c</tt></p>
  
! <pre>  operator&gt;=
  </pre>
  <p>Returns: <tt>x.c &gt;= y.c</tt></p>
  
--- 18930,19008 ----
  
  <hr>
  <h3><a name="410"></a>410. Missing semantics for stack and queue comparison operators</h3>
! <p><b>Section:</b> 23.3.5.2 [list.cons], 23.3.5.4 [list.modifiers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Hans Bos <b>Opened:</b> 2003-06-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.cons">issues</a> in [list.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Sections 23.3.5.2 [list.cons] and 23.3.5.4 [list.modifiers] list
  comparison operators (==, !=, &lt;, &lt;=, &gt;, =&gt;) for queue and
! stack.  Only the semantics for queue::operator== (23.3.5.2 [list.cons] par2) and queue::operator&lt; (23.3.5.2 [list.cons]
  par3) are defined.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Add the following new paragraphs after 23.3.5.2 [list.cons]
    paragraph 3:</p>
  
  <blockquote>
  
! <pre>
!   operator!=
  </pre>
  <p>Returns: <tt>x.c != y.c</tt></p>
  
! <pre>
!   operator&gt;
  </pre>
  <p>Returns: <tt>x.c &gt; y.c</tt></p>
  
! <pre>
!   operator&lt;=
  </pre>
  <p>Returns: <tt>x.c &lt;= y.c</tt></p>
  
! <pre>
!   operator&gt;=
  </pre>
  <p>Returns: <tt>x.c &gt;= y.c</tt></p>
  
  </blockquote>
  
! <p>Add the following paragraphs at the end of 23.3.5.4 [list.modifiers]:</p>
  
  <blockquote>
  
! <pre>
!   operator==
  </pre>
  <p>Returns: <tt>x.c == y.c</tt></p>
  
! <pre>
!   operator&lt;
  </pre>
  <p>Returns: <tt>x.c &lt; y.c</tt></p>
  
! <pre>
!   operator!=
  </pre>
  <p>Returns: <tt>x.c != y.c</tt></p>
  
! <pre>
!   operator&gt;
  </pre>
  <p>Returns: <tt>x.c &gt; y.c</tt></p>
  
! <pre>
!   operator&lt;=
  </pre>
  <p>Returns: <tt>x.c &lt;= y.c</tt></p>
  
! <pre>
!   operator&gt;=
  </pre>
  <p>Returns: <tt>x.c &gt;= y.c</tt></p>
  
*************** supposed to do, but we ought to spell it
*** 19379,19388 ****
  
  <hr>
  <h3><a name="411"></a>411. Wrong names of set member functions</h3>
! <p><b>Section:</b> 25.4.5 [alg.set.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Frey <b>Opened:</b> 2003-07-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.set.operations">issues</a> in [alg.set.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  25.4.5 [alg.set.operations] paragraph 1 reads:
--- 19024,19033 ----
  
  <hr>
  <h3><a name="411"></a>411. Wrong names of set member functions</h3>
! <p><b>Section:</b> 25.4.5 [alg.set.operations] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Frey <b>Opened:</b> 2003-07-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.set.operations">issues</a> in [alg.set.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  25.4.5 [alg.set.operations] paragraph 1 reads:
*************** set_intersection(), not union() and inte
*** 19407,19420 ****
  
  <hr>
  <h3><a name="412"></a>412. Typo in 27.4.4.3</h3>
! <p><b>Section:</b> 27.5.4.3 [iostate.flags] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-07-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#429">429</a></p>
  <p><b>Discussion:</b></p>
  <p>
! The Effects clause in 27.5.4.3 [iostate.flags] paragraph 5 says that the
  function only throws if the respective bits are already set prior to
  the function call. That's obviously not the intent. The typo ought to
  be corrected and the text reworded as: "If (<i>state</i> &amp;
--- 19052,19065 ----
  
  <hr>
  <h3><a name="412"></a>412. Typo in 27.4.4.3</h3>
! <p><b>Section:</b> 27.5.5.4 [iostate.flags] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-07-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#429">429</a></p>
  <p><b>Discussion:</b></p>
  <p>
! The Effects clause in 27.5.5.4 [iostate.flags] paragraph 5 says that the
  function only throws if the respective bits are already set prior to
  the function call. That's obviously not the intent. The typo ought to
  be corrected and the text reworded as: "If (<i>state</i> &amp;
*************** exceptions()) == 0, returns. ..."
*** 19424,19430 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.5.4.3 [iostate.flags] paragraph 5, replace "If (rdstate() &amp;
  exceptions()) == 0" with "If ((state | (rdbuf() ? goodbit : badbit))
  &amp; exceptions()) == 0".
  </p>
--- 19069,19075 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.5.5.4 [iostate.flags] paragraph 5, replace "If (rdstate() &amp;
  exceptions()) == 0" with "If ((state | (rdbuf() ? goodbit : badbit))
  &amp; exceptions()) == 0".
  </p>
*************** exceptions()) == 0" with "If ((state | (
*** 19443,19452 ****
  
  <hr>
  <h3><a name="413"></a>413. Proposed resolution to LDR#64 still wrong</h3>
! <p><b>Section:</b> 27.7.1.2.3 [istream::extractors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2003-07-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The second sentence of the proposed resolution says:
--- 19088,19097 ----
  
  <hr>
  <h3><a name="413"></a>413. Proposed resolution to LDR#64 still wrong</h3>
! <p><b>Section:</b> 27.7.2.2.3 [istream::extractors] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2003-07-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::extractors">issues</a> in [istream::extractors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The second sentence of the proposed resolution says:
*************** basic_istream (*this) and inserting into
*** 19466,19472 ****
  <p><i>[
  Sydney: Definitely a real issue. We are, indeed, extracting characters
  from an istream and not from sb. The problem was there in the FDIS and
! wasn't fixed by issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#64">64</a>. Probably what was intended was
  to have *this instead of sb. We're talking about the exception flag
  state of a basic_istream object, and there's only one basic_istream
  object in this discussion, so that would be a consistent
--- 19111,19117 ----
  <p><i>[
  Sydney: Definitely a real issue. We are, indeed, extracting characters
  from an istream and not from sb. The problem was there in the FDIS and
! wasn't fixed by issue <a href="lwg-defects.html#64">64</a>. Probably what was intended was
  to have *this instead of sb. We're talking about the exception flag
  state of a basic_istream object, and there's only one basic_istream
  object in this discussion, so that would be a consistent
*************** then the caught exception is rethrown.
*** 19501,19516 ****
  
  <hr>
  <h3><a name="414"></a>414. Which iterators are invalidated by v.erase()?</h3>
! <p><b>Section:</b> 23.4.1.4 [vector.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-08-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider the following code fragment:
  </p>
  <blockquote>
! <pre>int A[8] = { 1,3,5,7,9,8,4,2 };
  std::vector&lt;int&gt; v(A, A+8);
  
  std::vector&lt;int&gt;::iterator i1 = v.begin() + 3;
--- 19146,19163 ----
  
  <hr>
  <h3><a name="414"></a>414. Which iterators are invalidated by v.erase()?</h3>
! <p><b>Section:</b> 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-08-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.modifiers">active issues</a> in [vector.modifiers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider the following code fragment:
  </p>
  <blockquote>
! <pre>
! int A[8] = { 1,3,5,7,9,8,4,2 };
  std::vector&lt;int&gt; v(A, A+8);
  
  std::vector&lt;int&gt;::iterator i1 = v.begin() + 3;
*************** techniques.)
*** 19556,19562 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.4.1.4 [vector.modifiers] paragraph 3, change "Invalidates all the
  iterators and references after the point of the erase" to
  "Invalidates iterators and references at or after the point of the
  erase". 
--- 19203,19209 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.3.6.5 [vector.modifiers] paragraph 3, change "Invalidates all the
  iterators and references after the point of the erase" to
  "Invalidates iterators and references at or after the point of the
  erase". 
*************** erase".
*** 19576,19584 ****
  
  <hr>
  <h3><a name="415"></a>415. behavior of std::ws</h3>
! <p><b>Section:</b> 27.7.1.4 [istream.manip] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to 27.6.1.4, the ws() manipulator is not required to construct
--- 19223,19231 ----
  
  <hr>
  <h3><a name="415"></a>415. behavior of std::ws</h3>
! <p><b>Section:</b> 27.7.2.4 [istream.manip] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to 27.6.1.4, the ws() manipulator is not required to construct
*************** doesn't affect the stream's gcount).
*** 19594,19600 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 27.7.1.4 [istream.manip], immediately before the first sentence
  of paragraph 1, the following text:
  </p>
  
--- 19241,19247 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 27.7.2.4 [istream.manip], immediately before the first sentence
  of paragraph 1, the following text:
  </p>
  
*************** of paragraph 1, the following text:
*** 19615,19623 ****
  
  <hr>
  <h3><a name="416"></a>416. definitions of XXX_MIN and XXX_MAX macros in climits</h3>
! <p><b>Section:</b> 18.3.2 [c.limits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 19262,19270 ----
  
  <hr>
  <h3><a name="416"></a>416. definitions of XXX_MIN and XXX_MAX macros in climits</h3>
! <p><b>Section:</b> 18.3.3 [c.limits] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** is true depends on the #defintion of the
*** 19628,19639 ****
  its type. This issue is about the fact that the type of these macros
  is not actually required to be the same as the the type each respective
  limit.
! <br>
  
  Section 18.2.2 of the C++ Standard does not specify the exact types of
! the XXX_MIN and XXX_MAX macros #defined in the &lt;climits&gt; and &lt;limits.h&gt;
  headers such as INT_MAX and LONG_MAX and instead defers to the C standard.
! <br>
  
  Section 5.2.4.2.1, p1 of the C standard specifies that "The values [of
  these constants] shall be replaced by constant expressions suitable for use
--- 19275,19286 ----
  its type. This issue is about the fact that the type of these macros
  is not actually required to be the same as the the type each respective
  limit.
! <br/>
  
  Section 18.2.2 of the C++ Standard does not specify the exact types of
! the XXX_MIN and XXX_MAX macros #defined in the &lt;climits> and &lt;limits.h>
  headers such as INT_MAX and LONG_MAX and instead defers to the C standard.
! <br/>
  
  Section 5.2.4.2.1, p1 of the C standard specifies that "The values [of
  these constants] shall be replaced by constant expressions suitable for use
*************** in #if preprocessing directives. Moreove
*** 19641,19655 ****
  the following shall be replaced by expressions that have the same type as
  would an expression that is an object of the corresponding type converted
  according to the integer promotions."
! <br>
  
  The "corresponding type converted according to the integer promotions" for
  LONG_MAX is, according to 6.4.4.1, p5 of the C standard, the type of long
  converted to the first of the following set of types that can represent it:
  int, long int, long long int. So on an implementation where (sizeof(long)
  == sizeof(int)) this type is actually int, while on an implementation where
! (sizeof(long) &gt; sizeof(int)) holds this type will be long.
! <br>
  
  This is not an issue in C since the type of the macro cannot be detected
  by any conforming C program, but it presents a portability problem in C++
--- 19288,19302 ----
  the following shall be replaced by expressions that have the same type as
  would an expression that is an object of the corresponding type converted
  according to the integer promotions."
! <br/>
  
  The "corresponding type converted according to the integer promotions" for
  LONG_MAX is, according to 6.4.4.1, p5 of the C standard, the type of long
  converted to the first of the following set of types that can represent it:
  int, long int, long long int. So on an implementation where (sizeof(long)
  == sizeof(int)) this type is actually int, while on an implementation where
! (sizeof(long) > sizeof(int)) holds this type will be long.
! <br/>
  
  This is not an issue in C since the type of the macro cannot be detected
  by any conforming C program, but it presents a portability problem in C++
*************** where the actual type is easily detectab
*** 19670,19676 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 18.3.2 [c.limits], paragraph 2:
  </p>
  
  <blockquote><p>
--- 19317,19323 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 18.3.3 [c.limits], paragraph 2:
  </p>
  
  <blockquote><p>
*************** to match the type to which they refer.<i
*** 19684,19715 ****
  
  
  <hr>
! <h3><a name="419"></a>419. istream extractors not setting failbit if eofbit is already set</h3>
! <p><b>Section:</b> 27.7.1.1.3 [istream::sentry] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
! 27.7.1.1.3 [istream::sentry], p2 says that istream::sentry ctor prepares for input if is.good()
! is true. p4 then goes on to say that the ctor sets the sentry::ok_ member to
! true if the stream state is good after any preparation. 27.7.1.2.1 [istream.formatted.reqmts], p1 then
  says that a formatted input function endeavors to obtain the requested input
! if the sentry's operator bool() returns true.
  
! Given these requirements, no formatted extractor should ever set failbit if
! the initial stream rdstate() == eofbit. That is contrary to the behavior of
  all implementations I tested. The program below prints out
! 
  eof = 1, fail = 0
  eof = 1, fail = 1
! 
  on all of them.
          </p>
  <pre>
! #include &lt;sstream&gt;
! #include &lt;cstdio&gt;
  
  int main()
  {
--- 19331,19365 ----
  
  
  <hr>
! <h3><a name="419"></a>419. istream extractors not setting <tt>failbit</tt> if <tt>eofbit</tt> is already set</h3>
! <p><b>Section:</b> 27.7.2.1.3 [istream::sentry] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
! 27.7.2.1.3 [istream::sentry], p2 says that <tt>istream::sentry</tt> ctor prepares for input if <tt>is.good()</tt>
! is true. p4 then goes on to say that the ctor sets the <tt>sentry::ok_</tt> member to
! true if the stream state is good after any preparation. 27.7.2.2.1 [istream.formatted.reqmts], p1 then
  says that a formatted input function endeavors to obtain the requested input
! if the sentry's <tt>operator bool()</tt> returns true.
  
! Given these requirements, no formatted extractor should ever set <tt>failbit</tt> if
! the initial stream <tt>rdstate() == eofbit</tt>. That is contrary to the behavior of
  all implementations I tested. The program below prints out
! </p>
! <blockquote><pre>
  eof = 1, fail = 0
  eof = 1, fail = 1
! </pre></blockquote>
! <p>
  on all of them.
          </p>
  <pre>
! 
! #include &lt;sstream>
! #include &lt;cstdio>
  
  int main()
  {
*************** int main()
*** 19717,19728 ****
  
      int i = 0;
  
!     strm &gt;&gt; i;
  
      std::printf ("eof = %d, fail = %d\n",
                   !!strm.eof (), !!strm.fail ());
  
!     strm &gt;&gt; i;
  
      std::printf ("eof = %d, fail = %d\n",
                   !!strm.eof (), !!strm.fail ());
--- 19367,19378 ----
  
      int i = 0;
  
!     strm >> i;
  
      std::printf ("eof = %d, fail = %d\n",
                   !!strm.eof (), !!strm.fail ());
  
!     strm >> i;
  
      std::printf ("eof = %d, fail = %d\n",
                   !!strm.eof (), !!strm.fail ());
*************** int main()
*** 19730,19772 ****
  
  </pre>
          <p>
! <br>
  
  Comments from Jerry Schwarz (c++std-lib-11373):
! <br>
  
  Jerry Schwarz wrote:
! <br>
  
  I don't know where (if anywhere) it says it in the standard, but the
! formatted extractors are supposed to set failbit if they don't extract
  any characters. If they didn't then simple loops like
! <br>
  
! while (cin &gt;&gt; x);
! <br>
  
  would loop forever.
! <br>
  
  Further comments from Martin Sebor:
! <br>
  
  The question is which part of the extraction should prevent this from happening
! by setting failbit when eofbit is already set. It could either be the sentry
  object or the extractor. It seems that most implementations have chosen to
! set failbit in the sentry [...] so that's the text that will need to be
  corrected. 
  
          </p>
  <p>
! Pre Berlin:  This issue is related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a>.  If the sentry
  sets <tt>failbit</tt> when it finds <tt>eofbit</tt> already set, then
  you can never seek away from the end of stream.
  </p>
! <p>Kona: Possibly NAD.  If eofbit is set then good() will return false.  We
    then set <i>ok</i> to false.  We believe that the sentry's
!   constructor should always set failbit when <i>ok</i> is false, and
    we also think the standard already says that.  Possibly it could be
    clearer.</p> 
  
--- 19380,19422 ----
  
  </pre>
          <p>
! <br/>
  
  Comments from Jerry Schwarz (c++std-lib-11373):
! <br/>
  
  Jerry Schwarz wrote:
! <br/>
  
  I don't know where (if anywhere) it says it in the standard, but the
! formatted extractors are supposed to set <tt>failbit</tt> if they don't extract
  any characters. If they didn't then simple loops like
! <br/>
  
! while (cin >> x);
! <br/>
  
  would loop forever.
! <br/>
  
  Further comments from Martin Sebor:
! <br/>
  
  The question is which part of the extraction should prevent this from happening
! by setting <tt>failbit</tt> when <tt>eofbit</tt> is already set. It could either be the sentry
  object or the extractor. It seems that most implementations have chosen to
! set <tt>failbit</tt> in the sentry [...] so that's the text that will need to be
  corrected. 
  
          </p>
  <p>
! Pre Berlin:  This issue is related to <a href="lwg-closed.html#342">342</a>.  If the sentry
  sets <tt>failbit</tt> when it finds <tt>eofbit</tt> already set, then
  you can never seek away from the end of stream.
  </p>
! <p>Kona: Possibly NAD.  If <tt>eofbit</tt> is set then <tt>good()</tt> will return false.  We
    then set <i>ok</i> to false.  We believe that the sentry's
!   constructor should always set <tt>failbit</tt> when <i>ok</i> is false, and
    we also think the standard already says that.  Possibly it could be
    clearer.</p> 
  
*************** you can never seek away from the end of
*** 19776,19790 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 27.7.1.1.3 [istream::sentry], p2 to:
  </p>
  
  <blockquote>
--- 19426,19440 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 27.7.2.1.3 [istream::sentry], p2 to:
  </p>
  
  <blockquote>
*************** Otherwise</ins> prepares for formatted o
*** 19803,19821 ****
  
  <hr>
  <h3><a name="420"></a>420. is std::FILE a complete type?</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  7.19.1, p2, of C99 requires that the FILE type only be declared in
! &lt;stdio.h&gt;.  None of the (implementation-defined) members of the
  struct is mentioned anywhere for obvious reasons.
  </p>
  
  <p>
! C++ says in 27.8.1, p2 that FILE is a type that's defined in &lt;cstdio&gt;. Is
  it really the intent that FILE be a complete type or is an implementation
  allowed to just declare it without providing a full definition?
  </p>
--- 19453,19471 ----
  
  <hr>
  <h3><a name="420"></a>420. is std::FILE a complete type?</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  7.19.1, p2, of C99 requires that the FILE type only be declared in
! &lt;stdio.h>.  None of the (implementation-defined) members of the
  struct is mentioned anywhere for obvious reasons.
  </p>
  
  <p>
! C++ says in 27.8.1, p2 that FILE is a type that's defined in &lt;cstdio>. Is
  it really the intent that FILE be a complete type or is an implementation
  allowed to just declare it without providing a full definition?
  </p>
*************** allowed to just declare it without provi
*** 19837,19846 ****
  
  <hr>
  <h3><a name="422"></a>422. explicit specializations of member functions of class templates</h3>
! <p><b>Section:</b> 17.6.3.3 [reserved.names] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#reserved.names">issues</a> in [reserved.names].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It has been suggested that 17.4.3.1, p1 may or may not allow programs to
--- 19487,19496 ----
  
  <hr>
  <h3><a name="422"></a>422. explicit specializations of member functions of class templates</h3>
! <p><b>Section:</b> 17.6.4.3 [reserved.names] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reserved.names">issues</a> in [reserved.names].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It has been suggested that 17.4.3.1, p1 may or may not allow programs to
*************** the program) by relying on the "as if" r
*** 19857,19863 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
!   Add the following sentence to 17.6.3.3 [reserved.names], p1:
  </p>
  
  <blockquote><p>
--- 19507,19513 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
!   Add the following sentence to 17.6.4.3 [reserved.names], p1:
  </p>
  
  <blockquote><p>
*************** use the right wording.]</i></p>
*** 19905,19913 ****
  
  <hr>
  <h3><a name="425"></a>425. return value of std::get_temporary_buffer</h3>
! <p><b>Section:</b> 20.9.7 [temporary.buffer] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard is not clear about the requirements on the value returned from
--- 19555,19564 ----
  
  <hr>
  <h3><a name="425"></a>425. return value of std::get_temporary_buffer</h3>
! <p><b>Section:</b> 20.7.11 [temporary.buffer] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#temporary.buffer">issues</a> in [temporary.buffer].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard is not clear about the requirements on the value returned from
*************** is when the argument is less than 0.
*** 19920,19926 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 20.7.3 [meta.help] paragraph 2 from "...or a pair of 0
  values if no storage can be obtained" to "...or a pair of 0 values if
  no storage can be obtained or if <i>n</i> &lt;= 0."</p>
  <p><i>[Kona: Matt provided wording]</i></p>
--- 19571,19577 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 20.10.3 [meta.help] paragraph 2 from "...or a pair of 0
  values if no storage can be obtained" to "...or a pair of 0 values if
  no storage can be obtained or if <i>n</i> &lt;= 0."</p>
  <p><i>[Kona: Matt provided wording]</i></p>
*************** no storage can be obtained or if <i>n</i
*** 19931,19956 ****
  
  <hr>
  <h3><a name="426"></a>426. search_n(), fill_n(), and generate_n() with negative n</h3>
! <p><b>Section:</b> 25.2.13 [alg.search], 25.3.6 [alg.fill], 25.3.7 [alg.generate] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.search">issues</a> in [alg.search].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity requirements for these function templates are incorrect
  (or don't even make sense) for negative n:</p>
  
  <p>25.1.9, p7 (search_n):
! <br>
  Complexity: At most (last1 - first1) * count applications
  of the corresponding predicate.</p>
  
  <p>25.2.5, p3 (fill_n):
! <br>
  Complexity: Exactly last - first (or n) assignments.</p>
  
  <p>25.2.6, p3 (generate_n):
! <br>
  Complexity: Exactly last - first (or n) assignments.</p>
  
  <p>
--- 19582,19607 ----
  
  <hr>
  <h3><a name="426"></a>426. search_n(), fill_n(), and generate_n() with negative n</h3>
! <p><b>Section:</b> 25.2.13 [alg.search], 25.3.6 [alg.fill], 25.3.7 [alg.generate] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.search">issues</a> in [alg.search].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity requirements for these function templates are incorrect
  (or don't even make sense) for negative n:</p>
  
  <p>25.1.9, p7 (search_n):
! <br/>
  Complexity: At most (last1 - first1) * count applications
  of the corresponding predicate.</p>
  
  <p>25.2.5, p3 (fill_n):
! <br/>
  Complexity: Exactly last - first (or n) assignments.</p>
  
  <p>25.2.6, p3 (generate_n):
! <br/>
  Complexity: Exactly last - first (or n) assignments.</p>
  
  <p>
*************** or 0 otherwise) assignments.
*** 20010,20024 ****
  
  
  <hr>
! <h3><a name="427"></a>427. stage 2 and rationale of DR 221</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirements specified in Stage 2 and reiterated in the rationale
! of DR 221 (and echoed again in DR 303) specify that num_get&lt;charT&gt;::
  do_get() compares characters on the stream against the widened elements
  of "012...abc...ABCX+-"
  </p>
--- 19661,19676 ----
  
  
  <hr>
! <h3><a name="427"></a>427. Stage 2 and rationale of DR 221</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirements specified in Stage 2 and reiterated in the rationale
! of DR 221 (and echoed again in DR 303) specify that num_get&lt;charT>::
  do_get() compares characters on the stream against the widened elements
  of "012...abc...ABCX+-"
  </p>
*************** character type to be equality comparable
*** 20031,20037 ****
  be used to perform tests for equality). Hence, the num_get template cannot
  be implemented to support any arbitrary character type. The num_get template
  must either make the assumption that the character type is equality-comparable
! (as some popular implementations do), or it may use char_traits&lt;charT&gt; to do
  the comparisons (some other popular implementations do that). This diversity
  of approaches makes it difficult to write portable programs that attempt to
  instantiate the num_get template on user-defined types.
--- 19683,19689 ----
  be used to perform tests for equality). Hence, the num_get template cannot
  be implemented to support any arbitrary character type. The num_get template
  must either make the assumption that the character type is equality-comparable
! (as some popular implementations do), or it may use char_traits&lt;charT> to do
  the comparisons (some other popular implementations do that). This diversity
  of approaches makes it difficult to write portable programs that attempt to
  instantiate the num_get template on user-defined types.
*************** instantiate the num_get template on user
*** 20046,20052 ****
    and traits is in order.  The LWG considered and rejected the
    possibility of changing numeric facets to use narrowing instead of
    widening.  This may be a good idea for other reasons (see issue
!   <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#459">459</a>), but it doesn't solve the problem raised by this
    issue.  Whether we use widen or narrow the <tt>num_get</tt> facet
    still has no idea which traits class the user wants to use for 
    the comparison, because only streams, not facets, are passed traits
--- 19698,19704 ----
    and traits is in order.  The LWG considered and rejected the
    possibility of changing numeric facets to use narrowing instead of
    widening.  This may be a good idea for other reasons (see issue
!   <a href="lwg-closed.html#459">459</a>), but it doesn't solve the problem raised by this
    issue.  Whether we use widen or narrow the <tt>num_get</tt> facet
    still has no idea which traits class the user wants to use for 
    the comparison, because only streams, not facets, are passed traits
*************** Daniel volunteered to provide wording.
*** 20106,20116 ****
  ]</i></p>
  
  
! <blockquote>
! Leave as Open. Alisdair and/or Tom will provide wording based on discussions.
  We want to clearly state that streams and locales work just on <tt>char</tt>
  and <tt>wchar_t</tt> (except where otherwise specified).
! </blockquote>
  
  <p><i>[
  2010-02-06 Tom updated the proposed wording.
--- 19758,19768 ----
  ]</i></p>
  
  
! <blockquote><p>
! Leave as Open. Alisdair and&#47;or Tom will provide wording based on discussions.
  We want to clearly state that streams and locales work just on <tt>char</tt>
  and <tt>wchar_t</tt> (except where otherwise specified).
! </p></blockquote>
  
  <p><i>[
  2010-02-06 Tom updated the proposed wording.
*************** The original proposed wording is preserv
*** 20130,20141 ****
  Change 22.3.1.1.1 [locale.category]/6:
  </p>
  
! <blockquote>
  [..] A template formal parameter with name <tt>C</tt> represents the set of all possible
  specializations on a <ins><tt>char</tt> or <tt>wchar_t</tt></ins> parameter<del> that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated</del>. [..]
! </blockquote>
  </li>
  
  <li>
--- 19782,19793 ----
  Change 22.3.1.1.1 [locale.category]/6:
  </p>
  
! <blockquote><p>
  [..] A template formal parameter with name <tt>C</tt> represents the set of all possible
  specializations on a <ins><tt>char</tt> or <tt>wchar_t</tt></ins> parameter<del> that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated</del>. [..]
! </p></blockquote>
  </li>
  
  <li>
*************** can be instantiated</del>. [..]
*** 20143,20155 ****
  Add the following sentence to the end of 22.4.2 [category.numeric]/2:
  </p>
  
! <blockquote>
  [..] These specializations refer to [..], and also for the <tt>ctype&lt;&gt;</tt> facet to
  perform character classification. <ins>Implementations are encouraged
  but not required to use the <tt>char_traits&lt;charT&gt;</tt> functions for all
  comparisons and assignments of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations.</ins>
! </blockquote>
  </li>
  
  <li>
--- 19795,19807 ----
  Add the following sentence to the end of 22.4.2 [category.numeric]/2:
  </p>
  
! <blockquote><p>
  [..] These specializations refer to [..], and also for the <tt>ctype&lt;&gt;</tt> facet to
  perform character classification. <ins>Implementations are encouraged
  but not required to use the <tt>char_traits&lt;charT&gt;</tt> functions for all
  comparisons and assignments of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations.</ins>
! </p></blockquote>
  </li>
  
  <li>
*************** Stage 2: If <tt>in==end</tt> then stage
*** 20163,20169 ****
  from <tt>in</tt> and local variables are initialized as if by
  </p>
  
! <blockquote><pre>char_type ct = *in;
  <ins>using tr = char_traits&lt;char_type&gt;;
  const char_type* pos = tr::find(atoms, sizeof(src) - 1, ct);</ins>
  char c = src[<del>find(atoms, atoms + sizeof(src) - 1, ct) - atoms</del>
--- 19815,19822 ----
  from <tt>in</tt> and local variables are initialized as if by
  </p>
  
! <blockquote><pre>
! char_type ct = *in;
  <ins>using tr = char_traits&lt;char_type&gt;;
  const char_type* pos = tr::find(atoms, sizeof(src) - 1, ct);</ins>
  char c = src[<del>find(atoms, atoms + sizeof(src) - 1, ct) - atoms</del>
*************** it is a copy-initialization context, not
*** 20194,20206 ****
  Add the following sentence to the end of 22.4.5 [category.time]/1:
  </p>
  
! <blockquote>
  [..] Their members use [..] , to determine formatting details.
  <ins>Implementations are encouraged but not required to use the
  <tt>char_traits&lt;charT&gt;</tt> functions for all comparisons and assignments
  of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations.</ins>
! </blockquote>
  </li>
  
  <li>
--- 19847,19859 ----
  Add the following sentence to the end of 22.4.5 [category.time]/1:
  </p>
  
! <blockquote><p>
  [..] Their members use [..] , to determine formatting details.
  <ins>Implementations are encouraged but not required to use the
  <tt>char_traits&lt;charT&gt;</tt> functions for all comparisons and assignments
  of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations.</ins>
! </p></blockquote>
  </li>
  
  <li>
*************** of <tt>fmt char_traits&lt;char_type&gt;:
*** 20222,20234 ****
  Add the following sentence to the end of 22.4.6 [category.monetary]/2:
  </p>
  
! <blockquote>
  Their members use [..] to determine formatting details.
  <ins>Implementations are encouraged but not required to use the
  <tt>char_traits&lt;charT&gt;</tt> functions for all comparisons and assignments
  of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations.</ins>
! </blockquote>
  </li>
  
  <li>
--- 19875,19887 ----
  Add the following sentence to the end of 22.4.6 [category.monetary]/2:
  </p>
  
! <blockquote><p>
  Their members use [..] to determine formatting details.
  <ins>Implementations are encouraged but not required to use the
  <tt>char_traits&lt;charT&gt;</tt> functions for all comparisons and assignments
  of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations.</ins>
! </p></blockquote>
  </li>
  
  <li>
*************** Change 22.4.6.1.2 [locale.money.get.virt
*** 20241,20247 ****
  [..] The value <tt>units</tt> is produced as if by:
  </p>
  
! <blockquote><pre>for (int i = 0; i &lt; n; ++i)
    buf2[i] = src[<ins>char_traits&lt;charT&gt;::</ins>find(atoms, <del>atoms+</del>sizeof(src), buf1[i]) - atoms];
  buf2[n] = 0;
  sscanf(buf2, "%Lf", &amp;units);
--- 19894,19901 ----
  [..] The value <tt>units</tt> is produced as if by:
  </p>
  
! <blockquote><pre>
! for (int i = 0; i &lt; n; ++i)
    buf2[i] = src[<ins>char_traits&lt;charT&gt;::</ins>find(atoms, <del>atoms+</del>sizeof(src), buf1[i]) - atoms];
  buf2[n] = 0;
  sscanf(buf2, "%Lf", &amp;units);
*************** sscanf(buf2, "%Lf", &amp;units);
*** 20254,20271 ****
  Change 22.4.6.2.2 [locale.money.put.virtuals]/1:
  </p>
  
! <blockquote>
  [..] for character buffers <tt>buf1</tt> and <tt>buf2</tt>. If <ins>for</ins> the first
  character <ins><tt>c</tt></ins>
  in <tt>digits</tt> or <tt>buf2</tt> <del>is equal to
  <tt>ct.widen('-')</tt></del><ins><tt>char_traits&lt;charT&gt;::eq(c,
  ct.widen('-')) == true</tt></ins>, [..]
! </blockquote>
  </li>
  
  <li>
  <p>
! Add a footnote to the first sentence of 27.7.1.2.2 [istream.formatted.arithmetic]/1:
  </p>
  
  <blockquote>
--- 19908,19925 ----
  Change 22.4.6.2.2 [locale.money.put.virtuals]/1:
  </p>
  
! <blockquote><p>
  [..] for character buffers <tt>buf1</tt> and <tt>buf2</tt>. If <ins>for</ins> the first
  character <ins><tt>c</tt></ins>
  in <tt>digits</tt> or <tt>buf2</tt> <del>is equal to
  <tt>ct.widen('-')</tt></del><ins><tt>char_traits&lt;charT&gt;::eq(c,
  ct.widen('-')) == true</tt></ins>, [..]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Add a footnote to the first sentence of 27.7.2.2.2 [istream.formatted.arithmetic]/1:
  </p>
  
  <blockquote>
*************** results.
*** 20287,20293 ****
  
  <li>
  <p>
! Add a footnote to the second sentence of 27.7.2.6.2 [ostream.inserters.arithmetic]/1:
  </p>
  
  <blockquote>
--- 19941,19947 ----
  
  <li>
  <p>
! Add a footnote to the second sentence of 27.7.3.6.2 [ostream.inserters.arithmetic]/1:
  </p>
  
  <blockquote>
*************** results.
*** 20310,20316 ****
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.4 [ext.manip]/4:
  </p>
  
  <blockquote>
--- 19964,19970 ----
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.5 [ext.manip]/4:
  </p>
  
  <blockquote>
*************** results.
*** 20333,20339 ****
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.4 [ext.manip]/5:
  </p>
  
  <blockquote>
--- 19987,19993 ----
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.5 [ext.manip]/5:
  </p>
  
  <blockquote>
*************** results.
*** 20356,20362 ****
  
  <li>
  <p>
! 13) Add a footnote after the first sentence of 27.7.4 [ext.manip]/8:
  </p>
  
  <blockquote>
--- 20010,20016 ----
  
  <li>
  <p>
! 13) Add a footnote after the first sentence of 27.7.5 [ext.manip]/8:
  </p>
  
  <blockquote>
*************** results.
*** 20379,20385 ****
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.4 [ext.manip]/10:
  </p>
  
  <blockquote>
--- 20033,20039 ----
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.5 [ext.manip]/10:
  </p>
  
  <blockquote>
*************** here:
*** 20422,20428 ****
  Change 22.3.1.1.1 [locale.category]/6:
  </p>
  
! <blockquote>
  [..] A template formal parameter with name <tt>C</tt> represents 
  the set 
  <del>of all possible specializations on a</del> 
--- 20076,20082 ----
  Change 22.3.1.1.1 [locale.category]/6:
  </p>
  
! <blockquote><p>
  [..] A template formal parameter with name <tt>C</tt> represents 
  the set 
  <del>of all possible specializations on a</del> 
*************** and any other implementation-defined cha
*** 20433,20439 ****
  that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated. [..]
! </blockquote>
  </li>
  
  <li>
--- 20087,20093 ----
  that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated. [..]
! </p></blockquote>
  </li>
  
  <li>
*************** can be instantiated. [..]
*** 20441,20453 ****
  Add the following sentence to the end of 22.4.2 [category.numeric]/2:
  </p>
  
! <blockquote>
  [..] These specializations refer to [..], and also for the <tt>ctype&lt;&gt;</tt> facet to
  perform character classification. <ins>[<i>Note:</i> Implementations are encouraged
  but not required to use the <tt>char_traits&lt;charT&gt;</tt> functions for all
  comparisons and assignments of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations - <i>end note</i>].</ins>
! </blockquote>
  </li>
  
  <li>
--- 20095,20107 ----
  Add the following sentence to the end of 22.4.2 [category.numeric]/2:
  </p>
  
! <blockquote><p>
  [..] These specializations refer to [..], and also for the <tt>ctype&lt;&gt;</tt> facet to
  perform character classification. <ins>[<i>Note:</i> Implementations are encouraged
  but not required to use the <tt>char_traits&lt;charT&gt;</tt> functions for all
  comparisons and assignments of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations - <i>end note</i>].</ins>
! </p></blockquote>
  </li>
  
  <li>
*************** Stage 2: If <tt>in==end</tt> then stage
*** 20461,20467 ****
  from <tt>in</tt> and local variables are initialized as if by
  </p>
  
! <blockquote><pre>char_type ct = *in;
  <ins>using tr = char_traits&lt;char_type&gt;;
  const char_type* pos = tr::find(atoms, sizeof(src) - 1, ct);</ins>
  char c = src[<del>find(atoms, atoms + sizeof(src) - 1, ct) - atoms</del>
--- 20115,20122 ----
  from <tt>in</tt> and local variables are initialized as if by
  </p>
  
! <blockquote><pre>
! char_type ct = *in;
  <ins>using tr = char_traits&lt;char_type&gt;;
  const char_type* pos = tr::find(atoms, sizeof(src) - 1, ct);</ins>
  char c = src[<del>find(atoms, atoms + sizeof(src) - 1, ct) - atoms</del>
*************** it is a copy-initialization context, not
*** 20492,20504 ****
  Add the following sentence to the end of 22.4.5 [category.time]/1:
  </p>
  
! <blockquote>
  [..] Their members use [..] , to determine formatting details.
  <ins>[<i>Note:</i> Implementations are encouraged but not required to use the
  <tt>char_traits&lt;charT&gt;</tt> functions for all comparisons and assignments
  of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations - <i>end note</i>].</ins>
! </blockquote>
  </li>
  
  <li>
--- 20147,20159 ----
  Add the following sentence to the end of 22.4.5 [category.time]/1:
  </p>
  
! <blockquote><p>
  [..] Their members use [..] , to determine formatting details.
  <ins>[<i>Note:</i> Implementations are encouraged but not required to use the
  <tt>char_traits&lt;charT&gt;</tt> functions for all comparisons and assignments
  of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations - <i>end note</i>].</ins>
! </p></blockquote>
  </li>
  
  <li>
*************** of <tt>fmt char_traits&lt;char_type&gt;:
*** 20520,20532 ****
  Add the following sentence to the end of 22.4.6 [category.monetary]/2:
  </p>
  
! <blockquote>
  Their members use [..] to determine formatting details.
  <ins>[<i>Note:</i> Implementations are encouraged but not required to use the
  <tt>char_traits&lt;charT&gt;</tt> functions for all comparisons and assignments
  of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations - <i>end note</i>].</ins>
! </blockquote>
  </li>
  
  <li>
--- 20175,20187 ----
  Add the following sentence to the end of 22.4.6 [category.monetary]/2:
  </p>
  
! <blockquote><p>
  Their members use [..] to determine formatting details.
  <ins>[<i>Note:</i> Implementations are encouraged but not required to use the
  <tt>char_traits&lt;charT&gt;</tt> functions for all comparisons and assignments
  of characters of type <tt>charT</tt> that do
  not belong to the set of required specializations - <i>end note</i>].</ins>
! </p></blockquote>
  </li>
  
  <li>
*************** Change 22.4.6.1.2 [locale.money.get.virt
*** 20539,20545 ****
  [..] The value <tt>units</tt> is produced as if by:
  </p>
  
! <blockquote><pre>for (int i = 0; i &lt; n; ++i)
    buf2[i] = src[<ins>char_traits&lt;charT&gt;::</ins>find(atoms, <del>atoms+</del>sizeof(src), buf1[i]) - atoms];
  buf2[n] = 0;
  sscanf(buf2, "%Lf", &amp;units);
--- 20194,20201 ----
  [..] The value <tt>units</tt> is produced as if by:
  </p>
  
! <blockquote><pre>
! for (int i = 0; i &lt; n; ++i)
    buf2[i] = src[<ins>char_traits&lt;charT&gt;::</ins>find(atoms, <del>atoms+</del>sizeof(src), buf1[i]) - atoms];
  buf2[n] = 0;
  sscanf(buf2, "%Lf", &amp;units);
*************** sscanf(buf2, "%Lf", &amp;units);
*** 20552,20564 ****
  Change 22.4.6.2.2 [locale.money.put.virtuals]/1:
  </p>
  
! <blockquote>
  [..] for character buffers <tt>buf1</tt> and <tt>buf2</tt>. If <ins>for</ins> the first
  character <ins><tt>c</tt></ins>
  in <tt>digits</tt> or <tt>buf2</tt> <del>is equal to
  <tt>ct.widen('-')</tt></del><ins><tt>char_traits&lt;charT&gt;::eq(c,
  ct.widen('-')) == true</tt></ins>, [..]
! </blockquote>
  </li>
  
  <li>
--- 20208,20220 ----
  Change 22.4.6.2.2 [locale.money.put.virtuals]/1:
  </p>
  
! <blockquote><p>
  [..] for character buffers <tt>buf1</tt> and <tt>buf2</tt>. If <ins>for</ins> the first
  character <ins><tt>c</tt></ins>
  in <tt>digits</tt> or <tt>buf2</tt> <del>is equal to
  <tt>ct.widen('-')</tt></del><ins><tt>char_traits&lt;charT&gt;::eq(c,
  ct.widen('-')) == true</tt></ins>, [..]
! </p></blockquote>
  </li>
  
  <li>
*************** ct.widen('-')) == true</tt></ins>, [..]
*** 20566,20572 ****
  Add a new paragraph after the 
  first paragraph of 27.2.2 [iostreams.limits.pos]/1:
  </p>
! <blockquote>
  In the classes of clause 27,
  a template formal parameter with name <tt>charT</tt> represents 
  one of
--- 20222,20228 ----
  Add a new paragraph after the 
  first paragraph of 27.2.2 [iostreams.limits.pos]/1:
  </p>
! <blockquote><p>
  In the classes of clause 27,
  a template formal parameter with name <tt>charT</tt> represents 
  one of
*************** and any other implementation-defined cha
*** 20576,20587 ****
  that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated.
! </blockquote>
  </li>
  
  <li>
  <p>
! Add a footnote to the first sentence of 27.7.1.2.2 [istream.formatted.arithmetic]/1:
  </p>
  
  <blockquote>
--- 20232,20243 ----
  that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Add a footnote to the first sentence of 27.7.2.2.2 [istream.formatted.arithmetic]/1:
  </p>
  
  <blockquote>
*************** results.
*** 20603,20609 ****
  
  <li>
  <p>
! Add a footnote to the second sentence of 27.7.2.6.2 [ostream.inserters.arithmetic]/1:
  </p>
  
  <blockquote>
--- 20259,20265 ----
  
  <li>
  <p>
! Add a footnote to the second sentence of 27.7.3.6.2 [ostream.inserters.arithmetic]/1:
  </p>
  
  <blockquote>
*************** results.
*** 20627,20633 ****
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.4 [ext.manip]/4:
  </p>
  
  <blockquote>
--- 20283,20289 ----
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.5 [ext.manip]/4:
  </p>
  
  <blockquote>
*************** results.
*** 20650,20656 ****
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.4 [ext.manip]/5:
  </p>
  
  <blockquote>
--- 20306,20312 ----
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.5 [ext.manip]/5:
  </p>
  
  <blockquote>
*************** results.
*** 20673,20679 ****
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.4 [ext.manip]/8:
  </p>
  
  <blockquote>
--- 20329,20335 ----
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.5 [ext.manip]/8:
  </p>
  
  <blockquote>
*************** results.
*** 20696,20702 ****
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.4 [ext.manip]/10:
  </p>
  
  <blockquote>
--- 20352,20358 ----
  
  <li>
  <p>
! Add a footnote after the first sentence of 27.7.5 [ext.manip]/10:
  </p>
  
  <blockquote>
*************** results.
*** 20729,20735 ****
  Change 22.3.1.1.1 [locale.category]/6:
  </p>
  
! <blockquote>
  [..] A template formal parameter with name <tt>C</tt> represents 
  the set 
  <del>of all possible specializations on a</del> 
--- 20385,20391 ----
  Change 22.3.1.1.1 [locale.category]/6:
  </p>
  
! <blockquote><p>
  [..] A template formal parameter with name <tt>C</tt> represents 
  the set 
  <del>of all possible specializations on a</del> 
*************** and any other implementation-defined cha
*** 20740,20746 ****
  that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated. [..]
! </blockquote>
  </li>
  
  <li>
--- 20396,20402 ----
  that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated. [..]
! </p></blockquote>
  </li>
  
  <li>
*************** can be instantiated. [..]
*** 20748,20754 ****
  Add a new paragraph after the 
  first paragraph of 27.2.2 [iostreams.limits.pos]/1:
  </p>
! <blockquote>
  In the classes of clause 27,
  a template formal parameter with name <tt>charT</tt> represents 
  one of
--- 20404,20410 ----
  Add a new paragraph after the 
  first paragraph of 27.2.2 [iostreams.limits.pos]/1:
  </p>
! <blockquote><p>
  In the classes of clause 27,
  a template formal parameter with name <tt>charT</tt> represents 
  one of
*************** and any other implementation-defined cha
*** 20758,20764 ****
  that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated.
! </blockquote>
  </li>
  
  </ol>
--- 20414,20420 ----
  that satisfies
  the requirements for a character on which any of the iostream components
  can be instantiated.
! </p></blockquote>
  </li>
  
  </ol>
*************** can be instantiated.
*** 20768,20777 ****
  
  <hr>
  <h3><a name="428"></a>428. string::erase(iterator) validity</h3>
! <p><b>Section:</b> 21.4.6.5 [string::erase] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::erase">issues</a> in [string::erase].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  23.1.1, p3 along with Table 67 specify as a prerequisite for a.erase(q)
--- 20424,20433 ----
  
  <hr>
  <h3><a name="428"></a>428. string::erase(iterator) validity</h3>
! <p><b>Section:</b> 21.4.6.5 [string::erase] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::erase">issues</a> in [string::erase].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  23.1.1, p3 along with Table 67 specify as a prerequisite for a.erase(q)
*************** which is most likely not the intent.
*** 20805,20814 ****
  
  
  <hr>
! <h3><a name="430"></a>430. valarray subset operations</h3>
! <p><b>Section:</b> 26.6.2.4 [valarray.sub] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard fails to specify the behavior of valarray::operator[](slice)
--- 20461,20470 ----
  
  
  <hr>
! <h3><a name="430"></a>430. <tt>valarray</tt> subset operations</h3>
! <p><b>Section:</b> 26.6.2.5 [valarray.sub] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard fails to specify the behavior of valarray::operator[](slice)
*************** Bellevue:
*** 20828,20838 ****
  ]</i></p>
  
  
! <blockquote>
  Please note that the standard also fails to specify the behavior of
  slice_array and gslice_array in the valid case. Bill Plauger will
! endeavor to provide revised wording for slice_array and gslice_array.
! </blockquote>
  
  <p><i>[
  post-Bellevue:  Bill provided wording.
--- 20484,20494 ----
  ]</i></p>
  
  
! <blockquote><p>
  Please note that the standard also fails to specify the behavior of
  slice_array and gslice_array in the valid case. Bill Plauger will
! endeavor to provide revised wording for <tt>slice_array</tt> and <tt>gslice_array</tt>.
! </p></blockquote>
  
  <p><i>[
  post-Bellevue:  Bill provided wording.
*************** Move to Ready.
*** 20855,20864 ****
  ]</i></p>
  
  
! <blockquote>
! The resolution to LWG issue 430 has not been applied --- there have been
  changes to the underlying text, and the resolution needs to be reworked.
! </blockquote>
  
  <p><i>[
  2010-03-09 Matt updated wording.
--- 20511,20520 ----
  ]</i></p>
  
  
! <blockquote><p>
! The resolution to LWG issue <a href="lwg-defects.html#430">430</a> has not been applied &mdash; there have been
  changes to the underlying text, and the resolution needs to be reworked.
! </p></blockquote>
  
  <p><i>[
  2010-03-09 Matt updated wording.
*************** changes to the underlying text, and the
*** 20874,20880 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Replace 26.6.2.4 [valarray.sub], with the following:
  </p>
  
  <blockquote>
--- 20530,20536 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Replace 26.6.2.5 [valarray.sub], with the following:
  </p>
  
  <blockquote>
*************** selective replacement (slicing) of the c
*** 20890,20896 ****
  the selected element(s) must exist.
  </p>
  
! <pre>valarray&lt;T&gt; operator[](slice slicearr) const; 
  </pre>
  
  <blockquote>
--- 20546,20553 ----
  the selected element(s) must exist.
  </p>
  
! <pre>
! valarray&lt;T&gt; operator[](slice slicearr) const; 
  </pre>
  
  <blockquote>
*************** containing those elements of the control
*** 20900,20906 ****
  <tt>slicearr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABCDE", 5); 
  v0[slice(2, 5, 3)] = v1; 
  // v0 == valarray&lt;char&gt;("abAdeBghCjkDmnEp", 16)
--- 20557,20564 ----
  <tt>slicearr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABCDE", 5); 
  v0[slice(2, 5, 3)] = v1; 
  // v0 == valarray&lt;char&gt;("abAdeBghCjkDmnEp", 16)
*************** v0[slice(2, 5, 3)] = v1;
*** 20910,20916 ****
  </p>
  </blockquote>
   
! <pre>valarray&lt;T&gt; operator[](slice slicearr); 
  </pre>
  
  <blockquote>
--- 20568,20575 ----
  </p>
  </blockquote>
   
! <pre>
! valarray&lt;T&gt; operator[](slice slicearr); 
  </pre>
  
  <blockquote>
*************** This function selects those elements of
*** 20919,20925 ****
  designated by <tt>slicearr</tt>.  [<i>Example</i>:
  </p>
  
! <blockquote><pre>valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABCDE", 5); 
  v0[slice(2, 5, 3)] = v1; 
  // v0 == valarray&lt;char&gt;("abAdeBghCjkDmnEp", 16)
--- 20578,20585 ----
  designated by <tt>slicearr</tt>.  [<i>Example</i>:
  </p>
  
! <blockquote><pre>
! valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABCDE", 5); 
  v0[slice(2, 5, 3)] = v1; 
  // v0 == valarray&lt;char&gt;("abAdeBghCjkDmnEp", 16)
*************** v0[slice(2, 5, 3)] = v1;
*** 20929,20935 ****
  </p>
  </blockquote>
   
! <pre>valarray&lt;T&gt; operator[](const gslice&amp; gslicearr) const; 
  </pre>
  
  <blockquote>
--- 20589,20596 ----
  </p>
  </blockquote>
   
! <pre>
! valarray&lt;T&gt; operator[](const gslice&amp; gslicearr) const; 
  </pre>
  
  <blockquote>
*************** containing those elements of the control
*** 20939,20945 ****
  <tt>gslicearr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  const size_t lv[] = {2, 3}; 
  const size_t dv[] = {7, 2}; 
  const valarray&lt;size_t&gt; len(lv, 2), str(dv, 2); 
--- 20600,20607 ----
  <tt>gslicearr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  const size_t lv[] = {2, 3}; 
  const size_t dv[] = {7, 2}; 
  const valarray&lt;size_t&gt; len(lv, 2), str(dv, 2); 
*************** const valarray&lt;size_t&gt; len(lv, 2),
*** 20951,20957 ****
  </p>
  </blockquote>
   
! <pre>gslice_array&lt;T&gt; operator[](const gslice&amp; gslicearr); 
  </pre>
  
  <blockquote>
--- 20613,20620 ----
  </p>
  </blockquote>
   
! <pre>
! gslice_array&lt;T&gt; operator[](const gslice&amp; gslicearr); 
  </pre>
  
  <blockquote>
*************** This function selects those elements of
*** 20960,20966 ****
  designated by <tt>gslicearr</tt>.  [<i>Example:</i>
  </p>
  
! <blockquote><pre>valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABCDEF", 6); 
  const size_t lv[] = {2, 3}; 
  const size_t dv[] = {7, 2}; 
--- 20623,20630 ----
  designated by <tt>gslicearr</tt>.  [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABCDEF", 6); 
  const size_t lv[] = {2, 3}; 
  const size_t dv[] = {7, 2}; 
*************** v0[gslice(3, len, str)] = v1;
*** 20973,20979 ****
  </p>
  </blockquote>
   
! <pre>valarray&lt;T&gt; operator[](const valarray&lt;bool&gt;&amp; boolarr) const; 
  </pre>
  
  <blockquote>
--- 20637,20644 ----
  </p>
  </blockquote>
   
! <pre>
! valarray&lt;T&gt; operator[](const valarray&lt;bool&gt;&amp; boolarr) const; 
  </pre>
  
  <blockquote>
*************** containing those elements of the control
*** 20983,20989 ****
  <tt>boolarr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  const bool vb[] = {false, false, true, true, false, true}; 
  // v0[valarray&lt;bool&gt;(vb, 6)] returns 
  // valarray&lt;char&gt;("cdf", 3)
--- 20648,20655 ----
  <tt>boolarr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  const bool vb[] = {false, false, true, true, false, true}; 
  // v0[valarray&lt;bool&gt;(vb, 6)] returns 
  // valarray&lt;char&gt;("cdf", 3)
*************** const bool vb[] = {false, false, true, t
*** 20993,20999 ****
  </p>
  </blockquote>
   
! <pre>mask_array&lt;T&gt; operator[](const valarray&lt;bool&gt;&amp; boolarr); 
  </pre>
  
  <blockquote>
--- 20659,20666 ----
  </p>
  </blockquote>
   
! <pre>
! mask_array&lt;T&gt; operator[](const valarray&lt;bool&gt;&amp; boolarr); 
  </pre>
  
  <blockquote>
*************** This function selects those elements of
*** 21002,21008 ****
  designated by <tt>boolarr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABC", 3); 
  const bool vb[] = {false, false, true, true, false, true}; 
  v0[valarray&lt;bool&gt;(vb, 6)] = v1; 
--- 20669,20676 ----
  designated by <tt>boolarr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABC", 3); 
  const bool vb[] = {false, false, true, true, false, true}; 
  v0[valarray&lt;bool&gt;(vb, 6)] = v1; 
*************** v0[valarray&lt;bool&gt;(vb, 6)] = v1;
*** 21013,21019 ****
  </p>
  </blockquote>
   
! <pre>valarray&lt;T&gt; operator[](const valarray&lt;size_t&gt;&amp; indarr) const; 
  </pre>
  
  <blockquote>
--- 20681,20688 ----
  </p>
  </blockquote>
   
! <pre>
! valarray&lt;T&gt; operator[](const valarray&lt;size_t&gt;&amp; indarr) const; 
  </pre>
  
  <blockquote>
*************** containing those elements of the control
*** 21023,21029 ****
  <tt>indarr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  const size_t vi[] = {7, 5, 2, 3, 8}; 
  // v0[valarray&lt;size_t&gt;(vi, 5)] returns 
  // valarray&lt;char&gt;("hfcdi", 5)
--- 20692,20699 ----
  <tt>indarr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  const size_t vi[] = {7, 5, 2, 3, 8}; 
  // v0[valarray&lt;size_t&gt;(vi, 5)] returns 
  // valarray&lt;char&gt;("hfcdi", 5)
*************** const size_t vi[] = {7, 5, 2, 3, 8};
*** 21033,21039 ****
  </p>
  </blockquote>
   
! <pre>indirect_array&lt;T&gt; operator[](const valarray&lt;size_t&gt;&amp; indarr);
  </pre>
  
  <blockquote>
--- 20703,20710 ----
  </p>
  </blockquote>
   
! <pre>
! indirect_array&lt;T&gt; operator[](const valarray&lt;size_t&gt;&amp; indarr);
  </pre>
  
  <blockquote>
*************** This function selects those elements of
*** 21042,21048 ****
  designated by <tt>indarr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABCDE", 5); 
  const size_t vi[] = {7, 5, 2, 3, 8}; 
  v0[valarray&lt;size_t&gt;(vi, 5)] = v1; 
--- 20713,20720 ----
  designated by <tt>indarr</tt>. [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! valarray&lt;char&gt; v0("abcdefghijklmnop", 16); 
  valarray&lt;char&gt; v1("ABCDE", 5); 
  const size_t vi[] = {7, 5, 2, 3, 8}; 
  v0[valarray&lt;size_t&gt;(vi, 5)] = v1; 
*************** v0[valarray&lt;size_t&gt;(vi, 5)] = v1;
*** 21061,21072 ****
  
  <hr>
  <h3><a name="431"></a>431. Swapping containers with unequal allocators</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements], 25 [algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-09-20 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Clause 20.2.5 [allocator.requirements] paragraph 4 says that implementations
    are permitted to supply containers that are unable to cope with
    allocator instances and that container implementations may assume
    that all instances of an allocator type compare equal.  We gave
--- 20733,20745 ----
  
  <hr>
  <h3><a name="431"></a>431. Swapping containers with unequal allocators</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements], 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2003-09-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Clause 17.6.3.5 [allocator.requirements] paragraph 4 says that implementations
    are permitted to supply containers that are unable to cope with
    allocator instances and that container implementations may assume
    that all instances of an allocator type compare equal.  We gave
*************** v0[valarray&lt;size_t&gt;(vi, 5)] = v1;
*** 21089,21100 ****
  <p>3. The operation swaps both the vectors' contents and their
    allocators.  This would be an O(1) operation. That is:</p>
    <blockquote>
!   <pre>    my_alloc a1(...);
      my_alloc a2(...);
      assert(a1 != a2);
  
!     vector&lt;int, my_alloc&gt; v1(a1);
!     vector&lt;int, my_alloc&gt; v2(a2);
      assert(a1 == v1.get_allocator());
      assert(a2 == v2.get_allocator());
  
--- 20762,20774 ----
  <p>3. The operation swaps both the vectors' contents and their
    allocators.  This would be an O(1) operation. That is:</p>
    <blockquote>
!   <pre>
!     my_alloc a1(...);
      my_alloc a2(...);
      assert(a1 != a2);
  
!     vector&lt;int, my_alloc> v1(a1);
!     vector&lt;int, my_alloc> v2(a2);
      assert(a1 == v1.get_allocator());
      assert(a2 == v2.get_allocator());
  
*************** swap allocators, else it will perform a
*** 21131,21137 ****
  2009-04-28 Pablo adds:
  ]</i></p>
  
! <blockquote>
  Fixed in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2525.pdf">N2525</a>.
  I argued for marking this Tentatively-Ready right after Bellevue,
--- 20805,20811 ----
  2009-04-28 Pablo adds:
  ]</i></p>
  
! <blockquote><p>
  Fixed in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2525.pdf">N2525</a>.
  I argued for marking this Tentatively-Ready right after Bellevue,
*************** would break in the presence of the RVO.
*** 21141,21152 ****
  swap, but never-the-less). I addressed that breakage in in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2840.pdf">N2840</a>
  (Summit) by means of a non-normative reference:
! 
! <blockquote>
  [<i>Note:</i> in situations where the copy constructor for a container is elided,
  this function is not called. The behavior in these cases is as if
! <tt>select_on_container_copy_construction</tt> returned <tt>x</tt> — <i>end note</i>]
! </blockquote>
  
  </blockquote>
  
--- 20815,20826 ----
  swap, but never-the-less). I addressed that breakage in in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2840.pdf">N2840</a>
  (Summit) by means of a non-normative reference:
! </p>
! <blockquote><p>
  [<i>Note:</i> in situations where the copy constructor for a container is elided,
  this function is not called. The behavior in these cases is as if
! <tt>select_on_container_copy_construction</tt> returned <tt>x</tt> &mdash; <i>end note</i>]
! </p></blockquote>
  
  </blockquote>
  
*************** this function is not called. The behavio
*** 21155,21164 ****
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </blockquote>
  
  
  
--- 20829,20838 ----
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </p></blockquote>
  
  
  
*************** this function is not called. The behavio
*** 21170,21179 ****
  
  <hr>
  <h3><a name="432"></a>432. stringbuf::overflow() makes only one write position available</h3>
! <p><b>Section:</b> 27.8.1.4 [stringbuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Christian W Brock <b>Opened:</b> 2003-09-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.7.1.3 par 8 says:</p>
  <blockquote><p>
--- 20844,20853 ----
  
  <hr>
  <h3><a name="432"></a>432. stringbuf::overflow() makes only one write position available</h3>
! <p><b>Section:</b> 27.8.2.4 [stringbuf.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Christian W Brock <b>Opened:</b> 2003-09-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>27.7.1.3 par 8 says:</p>
  <blockquote><p>
*************** basic_stringbuf underlying character seq
*** 21265,21271 ****
  created in input mode, the underlying character sequence is equal to
  the input sequence; otherwise, it is equal to the output sequence. In
  case of an empty underlying character sequence, the function returns
! basic_string&lt;charT,traits,Allocator&gt;().
  </p>
  </blockquote>
  
--- 20939,20945 ----
  created in input mode, the underlying character sequence is equal to
  the input sequence; otherwise, it is equal to the output sequence. In
  case of an empty underlying character sequence, the function returns
! basic_string&lt;charT,traits,Allocator>().
  </p>
  </blockquote>
  
*************** newoff + off to the next pointer xnext .
*** 21391,21397 ****
  <blockquote>
  <p>
  -12- _ If (newoff + off) &lt; 0, or if (newoff + off) refers to an
! uninitialized character (as defined in 27.8.1.3 [stringbuf.members]
  paragraph 1), the positioning operation fails. Otherwise, the function
  assigns xbeg + newoff + off to the next pointer xnext .
  </p>
--- 21065,21071 ----
  <blockquote>
  <p>
  -12- _ If (newoff + off) &lt; 0, or if (newoff + off) refers to an
! uninitialized character (as defined in 27.8.2.3 [stringbuf.members]
  paragraph 1), the positioning operation fails. Otherwise, the function
  assigns xbeg + newoff + off to the next pointer xnext .
  </p>
*************** initialized range.</p>
*** 21456,21465 ****
  
  <hr>
  <h3><a name="434"></a>434. bitset::to_string() hard to use</h3>
! <p><b>Section:</b> 20.5.2 [bitset.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-10-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitset.members">issues</a> in [bitset.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It has been pointed out a number of times that the bitset to_string() member
--- 21130,21139 ----
  
  <hr>
  <h3><a name="434"></a>434. bitset::to_string() hard to use</h3>
! <p><b>Section:</b> 20.6.2 [bitset.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-10-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitset.members">issues</a> in [bitset.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It has been pointed out a number of times that the bitset to_string() member
*************** interface (declarations only) of the cla
*** 21478,21499 ****
  section 23.3.5.2, immediately after p34, the Returns clause of the existing
  to_string() member function template:</p>
  
! <pre>    template &lt;class charT, class traits&gt;
!     basic_string&lt;charT, traits, allocator&lt;charT&gt; &gt;
      to_string () const;
  
!     -34.1- Returns: to_string&lt;charT, traits, allocator&lt;charT&gt; &gt;().
  
!     template &lt;class charT&gt;
!     basic_string&lt;charT, char_traits&lt;charT&gt;, allocator&lt;charT&gt; &gt;
      to_string () const;
  
!     -34.2- Returns: to_string&lt;charT, char_traits&lt;charT&gt;, allocator&lt;charT&gt; &gt;().
  
!     basic_string&lt;char, char_traits&lt;char&gt;, allocator&lt;char&gt; &gt;
      to_string () const;
  
!     -34.3- Returns: to_string&lt;char, char_traits&lt;char&gt;, allocator&lt;char&gt; &gt;().
  </pre>
  
  <p><i>[Kona: the LWG agrees that this is an improvement over the
--- 21152,21174 ----
  section 23.3.5.2, immediately after p34, the Returns clause of the existing
  to_string() member function template:</p>
  
! <pre>
!     template &lt;class charT, class traits>
!     basic_string&lt;charT, traits, allocator&lt;charT> >
      to_string () const;
  
!     -34.1- Returns: to_string&lt;charT, traits, allocator&lt;charT> >().
  
!     template &lt;class charT>
!     basic_string&lt;charT, char_traits&lt;charT>, allocator&lt;charT> >
      to_string () const;
  
!     -34.2- Returns: to_string&lt;charT, char_traits&lt;charT>, allocator&lt;charT> >().
  
!     basic_string&lt;char, char_traits&lt;char>, allocator&lt;char> >
      to_string () const;
  
!     -34.3- Returns: to_string&lt;char, char_traits&lt;char>, allocator&lt;char> >().
  </pre>
  
  <p><i>[Kona: the LWG agrees that this is an improvement over the
*************** to_string() member function template:</p
*** 21511,21527 ****
  
  <hr>
  <h3><a name="435"></a>435. bug in DR 25</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-10-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! It has been pointed out that the proposed resolution in DR 25 may not be
! quite up to snuff: <br>
  http://gcc.gnu.org/ml/libstdc++/2003-09/msg00147.html
! http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#25<br>
  </p>
  
  <p>
--- 21186,21202 ----
  
  <hr>
  <h3><a name="435"></a>435. bug in DR 25</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-10-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! It has been pointed out that the proposed resolution in DR <a href="lwg-defects.html#25">25</a> may not be
! quite up to snuff: <br/>
  http://gcc.gnu.org/ml/libstdc++/2003-09/msg00147.html
! http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#25<br/>
  </p>
  
  <p>
*************** iostreams where the operator does trunca
*** 21545,21551 ****
  <p>Change the text in 21.3.7.9, p4 from</p>
      <blockquote><p>
      If bool(k) is true, inserts characters as if by calling
!     os.rdbuf()-&gt;sputn(str.data(), n), padding as described in stage 3
      of lib.facet.num.put.virtuals, where n is the larger of os.width()
      and str.size(); 
      </p></blockquote>
--- 21220,21226 ----
  <p>Change the text in 21.3.7.9, p4 from</p>
      <blockquote><p>
      If bool(k) is true, inserts characters as if by calling
!     os.rdbuf()->sputn(str.data(), n), padding as described in stage 3
      of lib.facet.num.put.virtuals, where n is the larger of os.width()
      and str.size(); 
      </p></blockquote>
*************** iostreams where the operator does trunca
*** 21554,21560 ****
      If bool(k) is true, determines padding as described in
      lib.facet.num.put.virtuals, and then inserts the resulting
      sequence of characters <tt>seq</tt> as if by calling
!     <tt>os.rdbuf()-&gt;sputn(seq, n)</tt>, where <tt>n</tt> is the larger of
      <tt>os.width()</tt> and <tt>str.size()</tt>;
       </p></blockquote>
  
--- 21229,21235 ----
      If bool(k) is true, determines padding as described in
      lib.facet.num.put.virtuals, and then inserts the resulting
      sequence of characters <tt>seq</tt> as if by calling
!     <tt>os.rdbuf()->sputn(seq, n)</tt>, where <tt>n</tt> is the larger of
      <tt>os.width()</tt> and <tt>str.size()</tt>;
       </p></blockquote>
  
*************** iostreams where the operator does trunca
*** 21575,21588 ****
  
  <hr>
  <h3><a name="436"></a>436. are cv-qualified facet types valid facets?</h3>
! <p><b>Section:</b> 22.3.1.1.2 [locale.facet] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-10-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Is "const std::ctype&lt;char&gt;" a valid template argument to has_facet, use_facet,
  and the locale template ctor? And if so, does it designate the same Facet as
! the non-const "std::ctype&lt;char&gt;?" What about "volatile std::ctype&lt;char&gt;?"
  Different implementations behave differently: some fail to compile, others
  accept such types but behave inconsistently.
  </p>
--- 21250,21263 ----
  
  <hr>
  <h3><a name="436"></a>436. are cv-qualified facet types valid facets?</h3>
! <p><b>Section:</b> 22.3.1.1.2 [locale.facet] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2003-10-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Is "const std::ctype&lt;char>" a valid template argument to has_facet, use_facet,
  and the locale template ctor? And if so, does it designate the same Facet as
! the non-const "std::ctype&lt;char>?" What about "volatile std::ctype&lt;char>?"
  Different implementations behave differently: some fail to compile, others
  accept such types but behave inconsistently.
  </p>
*************** text.]</i></p>
*** 21609,21638 ****
  
  <hr>
  <h3><a name="438"></a>438. Ambiguity in the "do the right thing" clause</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2003-10-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>Section 23.2.3 [sequence.reqmts], paragraphs 9-11, fixed up the problem
  noticed with statements like:</p>
! <pre>vector&lt;int&gt; v(10, 1);
  </pre>
  
  <p>The intent of the above statement was to construct with:</p>
! <pre>vector(size_type, const value_type&amp;);
  </pre>
  
  <p>but early implementations failed to compile as they bound to:</p>
! <pre>template &lt;class InputIterator&gt;
  vector(InputIterator f, InputIterator l);
  </pre>
  <p>instead.</p>
  
  <p>Paragraphs 9-11 say that if InputIterator is an integral type, then the
  member template constructor will have the same effect as:</p>
! <pre>vector&lt;static_cast&lt;size_type&gt;(f), static_cast&lt;value_type&gt;(l));
  </pre>
  <p>(and similarly for the other member template functions of sequences).</p>
  
--- 21284,21317 ----
  
  <hr>
  <h3><a name="438"></a>438. Ambiguity in the "do the right thing" clause</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2003-10-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>Section 23.2.3 [sequence.reqmts], paragraphs 9-11, fixed up the problem
  noticed with statements like:</p>
! <pre>
! vector&lt;int&gt; v(10, 1);
  </pre>
  
  <p>The intent of the above statement was to construct with:</p>
! <pre>
! vector(size_type, const value_type&amp;);
  </pre>
  
  <p>but early implementations failed to compile as they bound to:</p>
! <pre>
! template &lt;class InputIterator&gt;
  vector(InputIterator f, InputIterator l);
  </pre>
  <p>instead.</p>
  
  <p>Paragraphs 9-11 say that if InputIterator is an integral type, then the
  member template constructor will have the same effect as:</p>
! <pre>
! vector&lt;static_cast&lt;size_type&gt;(f), static_cast&lt;value_type&gt;(l));
  </pre>
  <p>(and similarly for the other member template functions of sequences).</p>
  
*************** member template constructor will have th
*** 21644,21650 ****
  
  <p>This might look something like:</p>
  <blockquote>
! <pre>template &lt;class T&gt;
  struct vector
  {
       typedef unsigned size_type;
--- 21323,21330 ----
  
  <p>This might look something like:</p>
  <blockquote>
! <pre>
! template &lt;class T&gt;
  struct vector
  {
       typedef unsigned size_type;
*************** every call with the member template, det
*** 21686,21692 ****
  and then redirect to the correct logic.  Something like:
  </p>
  <blockquote>
! <pre>template &lt;class T&gt;
  template &lt;class I&gt;
  vector&lt;T&gt;::vector(I f, I l)
  {
--- 21366,21373 ----
  and then redirect to the correct logic.  Something like:
  </p>
  <blockquote>
! <pre>
! template &lt;class T&gt;
  template &lt;class I&gt;
  vector&lt;T&gt;::vector(I f, I l)
  {
*************** vector&lt;T&gt;::choose_init(I f, I l, i
*** 21715,21721 ****
  
  <p>Both of these solutions solve the case the standard specifically
  mentions:</p>
! <pre>vector&lt;int&gt; v(10, 1);  // ok, vector size 10, initialized to 1
  </pre>
  
  <p>
--- 21396,21403 ----
  
  <p>Both of these solutions solve the case the standard specifically
  mentions:</p>
! <pre>
! vector&lt;int&gt; v(10, 1);  // ok, vector size 10, initialized to 1
  </pre>
  
  <p>
*************** However, (and here is the problem), the
*** 21723,21729 ****
  behavior in some cases where the value_type of the sequence is not an
  integral type.  For example consider:
  </p>
! <blockquote><pre>     pair&lt;char, char&gt;                     p('a', 'b');
       vector&lt;vector&lt;pair&lt;char, char&gt; &gt; &gt;   d('a', 'b');
  </pre></blockquote>
  <p>
--- 21405,21412 ----
  behavior in some cases where the value_type of the sequence is not an
  integral type.  For example consider:
  </p>
! <blockquote><pre>
!      pair&lt;char, char&gt;                     p('a', 'b');
       vector&lt;vector&lt;pair&lt;char, char&gt; &gt; &gt;   d('a', 'b');
  </pre></blockquote>
  <p>
*************** The second line of this snippet is likel
*** 21731,21737 ****
  the error and refuses to compile.  The reason is that there is no
  specialization of the member template constructor that looks like:
  </p>
! <pre>template &lt;&gt;
  template &lt;&gt;
  vector&lt;vector&lt;pair&lt;char, char&gt; &gt; &gt;::vector(char, char) { ... }
  </pre>
--- 21414,21421 ----
  the error and refuses to compile.  The reason is that there is no
  specialization of the member template constructor that looks like:
  </p>
! <pre>
! template &lt;&gt;
  template &lt;&gt;
  vector&lt;vector&lt;pair&lt;char, char&gt; &gt; &gt;::vector(char, char) { ... }
  </pre>
*************** unsigned integral type and used to size
*** 21748,21754 ****
  static casted to the inner vector using it's explicit constructor:
  </p>
  
! <pre>explicit vector(size_type n);
  </pre>
  
  <p>
--- 21432,21439 ----
  static casted to the inner vector using it's explicit constructor:
  </p>
  
! <pre>
! explicit vector(size_type n);
  </pre>
  
  <p>
*************** explicit qualifier on the inner vector h
*** 21765,21771 ****
  The standard is not clear whether the expression:
  </p>
  
! <pre>     vector&lt;vector&lt;pair&lt;char, char&gt; &gt; &gt;   d('a', 'b');
  </pre>
  
  <p>
--- 21450,21457 ----
  The standard is not clear whether the expression:
  </p>
  
! <pre>
!      vector&lt;vector&lt;pair&lt;char, char&gt; &gt; &gt;   d('a', 'b');
  </pre>
  
  <p>
*************** the expression above would be to change
*** 21800,21806 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class T, class U&gt;
  inline
  T implicit_cast(const U&amp; u)
  {
--- 21486,21493 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class T, class U&gt;
  inline
  T implicit_cast(const U&amp; u)
  {
*************** T implicit_cast(const U&amp; u)
*** 21820,21841 ****
  <ul>
    <li>
      <p>If the constructor</p>
!        <pre>       template &lt;class InputIterator&gt;
         X(InputIterator f, InputIterator l,
           const allocator_type&amp; a = allocator_type())
         </pre>
      <p>is called with a type InputIterator that does not qualify as
      an input iterator, then the constructor will behave as if the
      overloaded constructor:</p>
!        <pre>       X(size_type, const value_type&amp; = value_type(),
           const allocator_type&amp; = allocator_type())
         </pre>
!     <p>were called instead, with the arguments static_cast&lt;size_type&gt;(f), l and a, respectively.</p>
    </li>
  
    <li>
      <p>If the member functions of the forms:</p>
!        <pre>       template &lt;class InputIterator&gt;          //  such as  insert()
         rt fx1(iterator p, InputIterator f, InputIterator l);
  
         template &lt;class InputIterator&gt;          //  such as  append(), assign()
--- 21507,21531 ----
  <ul>
    <li>
      <p>If the constructor</p>
!        <pre>
!        template &lt;class InputIterator&gt;
         X(InputIterator f, InputIterator l,
           const allocator_type&amp; a = allocator_type())
         </pre>
      <p>is called with a type InputIterator that does not qualify as
      an input iterator, then the constructor will behave as if the
      overloaded constructor:</p>
!        <pre>
!        X(size_type, const value_type&amp; = value_type(),
           const allocator_type&amp; = allocator_type())
         </pre>
!     <p>were called instead, with the arguments static_cast&lt;size_type>(f), l and a, respectively.</p>
    </li>
  
    <li>
      <p>If the member functions of the forms:</p>
!        <pre>
!        template &lt;class InputIterator&gt;          //  such as  insert()
         rt fx1(iterator p, InputIterator f, InputIterator l);
  
         template &lt;class InputIterator&gt;          //  such as  append(), assign()
*************** T implicit_cast(const U&amp; u)
*** 21847,21853 ****
      <p>are called with a type InputIterator that does not qualify as
      an input iterator, then these functions will behave as if the
      overloaded member functions:</p>
!        <pre>       rt fx1(iterator, size_type, const value_type&amp;);
  
         rt fx2(size_type, const value_type&amp;);
  
--- 21537,21544 ----
      <p>are called with a type InputIterator that does not qualify as
      an input iterator, then these functions will behave as if the
      overloaded member functions:</p>
!        <pre>
!        rt fx1(iterator, size_type, const value_type&amp;);
  
         rt fx2(size_type, const value_type&amp;);
  
*************** Redmond.
*** 21891,21897 ****
  
  <p><i>[Redmond: one very small change in wording: the first argument
    is cast to size_t.  This fixes the problem of something like
!   <tt>vector&lt;vector&lt;int&gt; &gt;(5, 5)</tt>, where int is not 
    implicitly convertible to the value type.]</i></p>
  
  
--- 21582,21588 ----
  
  <p><i>[Redmond: one very small change in wording: the first argument
    is cast to size_t.  This fixes the problem of something like
!   <tt>vector&lt;vector&lt;int> >(5, 5)</tt>, where int is not 
    implicitly convertible to the value type.]</i></p>
  
  
*************** Redmond.
*** 21900,21906 ****
  <p><b>Rationale:</b></p>
  <p>The proposed resolution fixes:</p>
  
! <pre>  vector&lt;int&gt; v(10, 1);
  </pre>
  
  <p>
--- 21591,21598 ----
  <p><b>Rationale:</b></p>
  <p>The proposed resolution fixes:</p>
  
! <pre>
!   vector&lt;int&gt; v(10, 1);
  </pre>
  
  <p>
*************** if).</p>
*** 21910,21916 ****
  
  <p>The proposed resolution breaks:</p>
  
! <pre>  vector&lt;vector&lt;T&gt; &gt; v(10, 1);
  </pre>
  
  <p>
--- 21602,21609 ----
  
  <p>The proposed resolution breaks:</p>
  
! <pre>
!   vector&lt;vector&lt;T&gt; &gt; v(10, 1);
  </pre>
  
  <p>
*************** The proposed resolution leaves the behav
*** 21922,21928 ****
  unspecified.
  </p>
  
! <pre>  struct A
    {
      operator int () const {return 10;}
    };
--- 21615,21622 ----
  unspecified.
  </p>
  
! <pre>
!   struct A
    {
      operator int () const {return 10;}
    };
*************** implicitly convertible to B.
*** 21949,21969 ****
  
  <hr>
  <h3><a name="441"></a>441. Is fpos::state const?</h3>
! <p><b>Section:</b> 27.5.3 [fpos] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Vincent Leloup <b>Opened:</b> 2003-11-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fpos">issues</a> in [fpos].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In section 27.5.3.1 [fpos.members] fpos&lt;stateT&gt;::state() is declared
! non const, but in section 27.5.3 [fpos] it is declared const.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In section 27.5.3.1 [fpos.members], change the declaration of 
! <tt>fpos&lt;stateT&gt;::state()</tt> to const.
  </p>
  
  
--- 21643,21663 ----
  
  <hr>
  <h3><a name="441"></a>441. Is fpos::state const?</h3>
! <p><b>Section:</b> 27.5.4 [fpos] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Vincent Leloup <b>Opened:</b> 2003-11-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fpos">issues</a> in [fpos].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In section 27.5.4.1 [fpos.members] fpos&lt;stateT>::state() is declared
! non const, but in section 27.5.4 [fpos] it is declared const.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In section 27.5.4.1 [fpos.members], change the declaration of 
! <tt>fpos&lt;stateT>::state()</tt> to const.
  </p>
  
  
*************** In section 27.5.3.1 [fpos.members], chan
*** 21972,21985 ****
  
  <hr>
  <h3><a name="442"></a>442. sentry::operator bool() inconsistent signature</h3>
! <p><b>Section:</b> 27.7.2.4 [ostream::sentry] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Vincent Leloup <b>Opened:</b> 2003-11-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream::sentry">issues</a> in [ostream::sentry].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In section 27.7.2.4 [ostream::sentry] paragraph 4, in description part
! basic_ostream&lt;charT, traits&gt;::sentry::operator bool() is declared
  as non const, but in section 27.6.2.3, in synopsis it is declared
  const.
  </p>
--- 21666,21679 ----
  
  <hr>
  <h3><a name="442"></a>442. sentry::operator bool() inconsistent signature</h3>
! <p><b>Section:</b> 27.7.3.4 [ostream::sentry] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Vincent Leloup <b>Opened:</b> 2003-11-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream::sentry">issues</a> in [ostream::sentry].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In section 27.7.3.4 [ostream::sentry] paragraph 4, in description part
! basic_ostream&lt;charT, traits>::sentry::operator bool() is declared
  as non const, but in section 27.6.2.3, in synopsis it is declared
  const.
  </p>
*************** const.
*** 21987,21993 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In section 27.7.2.4 [ostream::sentry] paragraph 4, change the declaration
  of <tt>sentry::operator bool()</tt> to const.
  </p>
  
--- 21681,21687 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In section 27.7.3.4 [ostream::sentry] paragraph 4, change the declaration
  of <tt>sentry::operator bool()</tt> to const.
  </p>
  
*************** of <tt>sentry::operator bool()</tt> to c
*** 21997,22010 ****
  
  <hr>
  <h3><a name="443"></a>443. filebuf::close() inconsistent use of EOF</h3>
! <p><b>Section:</b> 27.9.1.4 [filebuf.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Vincent Leloup <b>Opened:</b> 2003-11-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#filebuf.members">issues</a> in [filebuf.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In section 27.9.1.4 [filebuf.members] par6, in effects description of
! basic_filebuf&lt;charT, traits&gt;::close(), overflow(EOF) is used twice;
  should be overflow(traits::eof()).
  </p>
  
--- 21691,21704 ----
  
  <hr>
  <h3><a name="443"></a>443. filebuf::close() inconsistent use of EOF</h3>
! <p><b>Section:</b> 27.9.1.4 [filebuf.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Vincent Leloup <b>Opened:</b> 2003-11-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#filebuf.members">issues</a> in [filebuf.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In section 27.9.1.4 [filebuf.members] par6, in effects description of
! basic_filebuf&lt;charT, traits>::close(), overflow(EOF) is used twice;
  should be overflow(traits::eof()).
  </p>
  
*************** Change overflow(EOF) to overflow(traits:
*** 22020,22033 ****
  
  <hr>
  <h3><a name="444"></a>444. Bad use of casts in fstream</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Vincent Leloup <b>Opened:</b> 2003-11-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  27.9.1.9 [ifstream.members] p1, 27.9.1.13 [ofstream.members] p1, 27.9.1.17 [fstream.members] p1 seems have same problem as exposed in LWG issue
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#252">252</a>.
  </p>
  
  
--- 21714,21727 ----
  
  <hr>
  <h3><a name="444"></a>444. Bad use of casts in fstream</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Vincent Leloup <b>Opened:</b> 2003-11-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  27.9.1.9 [ifstream.members] p1, 27.9.1.13 [ofstream.members] p1, 27.9.1.17 [fstream.members] p1 seems have same problem as exposed in LWG issue
! <a href="lwg-defects.html#252">252</a>.
  </p>
  
  
*************** Change overflow(EOF) to overflow(traits:
*** 22041,22062 ****
  
  <p>Change 27.8.1.7/1 from:</p>
  <blockquote><p>
!   Returns: (basic_filebuf&lt;charT,traits&gt;*)&amp;sb.
  </p></blockquote>
  
  <p>to:</p>
  <blockquote><p>
!   Returns: const_cast&lt;basic_filebuf&lt;charT,traits&gt;*&gt;(&amp;sb).
  </p></blockquote>
  
  <p>Change 27.8.1.10/1 from:</p>
  <blockquote><p>
!   Returns: (basic_filebuf&lt;charT,traits&gt;*)&amp;sb.
  </p></blockquote>
  
  <p>to:</p>
  <blockquote><p>
!   Returns: const_cast&lt;basic_filebuf&lt;charT,traits&gt;*&gt;(&amp;sb).
  </p></blockquote>
  
  <p>Change 27.8.1.13/1 from:</p>
--- 21735,21756 ----
  
  <p>Change 27.8.1.7/1 from:</p>
  <blockquote><p>
!   Returns: (basic_filebuf&lt;charT,traits>*)&amp;sb.
  </p></blockquote>
  
  <p>to:</p>
  <blockquote><p>
!   Returns: const_cast&lt;basic_filebuf&lt;charT,traits>*>(&amp;sb).
  </p></blockquote>
  
  <p>Change 27.8.1.10/1 from:</p>
  <blockquote><p>
!   Returns: (basic_filebuf&lt;charT,traits>*)&amp;sb.
  </p></blockquote>
  
  <p>to:</p>
  <blockquote><p>
!   Returns: const_cast&lt;basic_filebuf&lt;charT,traits>*>(&amp;sb).
  </p></blockquote>
  
  <p>Change 27.8.1.13/1 from:</p>
*************** Change overflow(EOF) to overflow(traits:
*** 22066,22072 ****
  
  <p>to:</p>
  <blockquote><p>
!   Returns: const_cast&lt;basic_filebuf&lt;charT,traits&gt;*&gt;(&amp;sb).
  </p></blockquote>
  
  
--- 21760,21766 ----
  
  <p>to:</p>
  <blockquote><p>
!   Returns: const_cast&lt;basic_filebuf&lt;charT,traits>*>(&amp;sb).
  </p></blockquote>
  
  
*************** Change overflow(EOF) to overflow(traits:
*** 22078,22087 ****
  
  <hr>
  <h3><a name="445"></a>445. iterator_traits::reference unspecified for some iterator categories</h3>
! <p><b>Section:</b> 24.4.1 [iterator.traits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2003-12-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.traits">issues</a> in [iterator.traits].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard places no restrictions at all on the reference type
--- 21772,21781 ----
  
  <hr>
  <h3><a name="445"></a>445. iterator_traits::reference unspecified for some iterator categories</h3>
! <p><b>Section:</b> 24.4.1 [iterator.traits] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2003-12-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.traits">issues</a> in [iterator.traits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The standard places no restrictions at all on the reference type
*************** and V is its value_type
*** 22116,22122 ****
  </ul>
  
  <p>A mutable forward iterator ought to satisfy, for x of type V:</p>
!   <pre>      { R r = *a; r = x; } is equivalent to *a = x;
    </pre>
  
  <p>
--- 21810,21817 ----
  </ul>
  
  <p>A mutable forward iterator ought to satisfy, for x of type V:</p>
!   <pre>
!       { R r = *a; r = x; } is equivalent to *a = x;
    </pre>
  
  <p>
*************** category, respectively.
*** 22187,22193 ****
  
  <blockquote><p>
  In addition, the types</p>
! <pre>iterator_traits&lt;Iterator&gt;::reference
  iterator_traits&lt;Iterator&gt;::pointer
  </pre>
  <p>must be defined as the iterator's reference and pointer types, that
--- 21882,21889 ----
  
  <blockquote><p>
  In addition, the types</p>
! <pre>
! iterator_traits&lt;Iterator&gt;::reference
  iterator_traits&lt;Iterator&gt;::pointer
  </pre>
  <p>must be defined as the iterator's reference and pointer types, that
*************** respectively.</p>
*** 22199,22205 ****
  
  <blockquote><p>
  In the case of an output iterator, the types</p>
! <pre>iterator_traits&lt;Iterator&gt;::difference_type
  iterator_traits&lt;Iterator&gt;::value_type
  </pre>
  <p>are both defined as <tt>void</tt>.</p>
--- 21895,21902 ----
  
  <blockquote><p>
  In the case of an output iterator, the types</p>
! <pre>
! iterator_traits&lt;Iterator&gt;::difference_type
  iterator_traits&lt;Iterator&gt;::value_type
  </pre>
  <p>are both defined as <tt>void</tt>.</p>
*************** iterator_traits&lt;Iterator&gt;::value_t
*** 22208,22214 ****
  <p>to:</p>
  <blockquote><p>
  In the case of an output iterator, the types</p>
! <pre>iterator_traits&lt;Iterator&gt;::difference_type
  iterator_traits&lt;Iterator&gt;::value_type
  iterator_traits&lt;Iterator&gt;::reference
  iterator_traits&lt;Iterator&gt;::pointer
--- 21905,21912 ----
  <p>to:</p>
  <blockquote><p>
  In the case of an output iterator, the types</p>
! <pre>
! iterator_traits&lt;Iterator&gt;::difference_type
  iterator_traits&lt;Iterator&gt;::value_type
  iterator_traits&lt;Iterator&gt;::reference
  iterator_traits&lt;Iterator&gt;::pointer
*************** iterator_traits&lt;Iterator&gt;::pointer
*** 22218,22229 ****
  
  <p>In 24.6.3 [istreambuf.iterator], change:</p>
  <blockquote>
! <pre>typename traits::off_type, charT*, charT&amp;&gt;
  </pre>
  </blockquote>
  <p>to:</p>
  <blockquote>
! <pre>typename traits::off_type, charT*, charT&gt;
  </pre>
  </blockquote>
  
--- 21916,21929 ----
  
  <p>In 24.6.3 [istreambuf.iterator], change:</p>
  <blockquote>
! <pre>
! typename traits::off_type, charT*, charT&amp;&gt;
  </pre>
  </blockquote>
  <p>to:</p>
  <blockquote>
! <pre>
! typename traits::off_type, charT*, charT&gt;
  </pre>
  </blockquote>
  
*************** needed to be changed.
*** 22244,22253 ****
  
  <hr>
  <h3><a name="448"></a>448. Random Access Iterators over abstract classes</h3>
! <p><b>Section:</b> 24.2.7 [random.access.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#random.access.iterators">issues</a> in [random.access.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 76, the random access iterator requirement table, says that the
--- 21944,21953 ----
  
  <hr>
  <h3><a name="448"></a>448. Random Access Iterators over abstract classes</h3>
! <p><b>Section:</b> 24.2.7 [random.access.iterators] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#random.access.iterators">issues</a> in [random.access.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 76, the random access iterator requirement table, says that the
*************** Change the return type to "convertible t
*** 22268,22277 ****
  
  <hr>
  <h3><a name="449"></a>449. Library Issue 306 Goes Too Far</h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2004-01-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Original text:</p>
  <blockquote><p>
--- 21968,21977 ----
  
  <hr>
  <h3><a name="449"></a>449. Library Issue 306 Goes Too Far</h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2004-01-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Original text:</p>
  <blockquote><p>
*************** undefined."
*** 22310,22321 ****
  
  <hr>
  <h3><a name="453"></a>453. basic_stringbuf::seekoff need not always fail for an empty stream</h3>
! <p><b>Section:</b> 27.8.1.4 [stringbuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <pre>  pos_type basic_stringbuf::seekoff(off_type, ios_base::seekdir,
                                      ios_base::openmode);
  </pre>
  <p>
--- 22010,22022 ----
  
  <hr>
  <h3><a name="453"></a>453. basic_stringbuf::seekoff need not always fail for an empty stream</h3>
! <p><b>Section:</b> 27.8.2.4 [stringbuf.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <pre>
!   pos_type basic_stringbuf::seekoff(off_type, ios_base::seekdir,
                                      ios_base::openmode);
  </pre>
  <p>
*************** is nonzero, the positioning operation fa
*** 22353,22362 ****
  
  <hr>
  <h3><a name="455"></a>455. cerr::tie() and wcerr::tie() are overspecified</h3>
! <p><b>Section:</b> 27.4 [iostream.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.objects">issues</a> in [iostream.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Both cerr::tie() and wcerr::tie() are obliged to be null at program
--- 22054,22063 ----
  
  <hr>
  <h3><a name="455"></a>455. cerr::tie() and wcerr::tie() are overspecified</h3>
! <p><b>Section:</b> 27.4 [iostream.objects] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.objects">issues</a> in [iostream.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Both cerr::tie() and wcerr::tie() are obliged to be null at program
*************** permitted if not required. Same for wcer
*** 22372,22378 ****
  <p>Add to the description of cerr:</p>
  <blockquote><p>
  After the object cerr is initialized, cerr.tie() returns &amp;cout.
! Its state is otherwise the same as required for basic_ios&lt;char&gt;::init
  (lib.basic.ios.cons).
  </p></blockquote>
  
--- 22073,22079 ----
  <p>Add to the description of cerr:</p>
  <blockquote><p>
  After the object cerr is initialized, cerr.tie() returns &amp;cout.
! Its state is otherwise the same as required for basic_ios&lt;char>::init
  (lib.basic.ios.cons).
  </p></blockquote>
  
*************** Its state is otherwise the same as requi
*** 22380,22386 ****
  
  <blockquote><p>
  After the object wcerr is initialized, wcerr.tie() returns &amp;wcout.
! Its state is otherwise the same as required for basic_ios&lt;wchar_t&gt;::init
  (lib.basic.ios.cons).
  </p></blockquote>
  
--- 22081,22087 ----
  
  <blockquote><p>
  After the object wcerr is initialized, wcerr.tie() returns &amp;wcout.
! Its state is otherwise the same as required for basic_ios&lt;wchar_t>::init
  (lib.basic.ios.cons).
  </p></blockquote>
  
*************** Its state is otherwise the same as requi
*** 22395,22404 ****
  
  <hr>
  <h3><a name="456"></a>456. Traditional C header files are overspecified</h3>
! <p><b>Section:</b> 17.6.1.2 [headers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#headers">issues</a> in [headers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>The C++ Standard effectively requires that the traditional C headers
--- 22096,22105 ----
  
  <hr>
  <h3><a name="456"></a>456. Traditional C header files are overspecified</h3>
! <p><b>Section:</b> 17.6.1.2 [headers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#headers">issues</a> in [headers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>The C++ Standard effectively requires that the traditional C headers
*************** using-declarations (7.3.3 [namespace.ude
*** 22503,22509 ****
  </p></blockquote>
  
  <p>
! Change D.7 [depr.c.headers], para. 2-3:
  </p>
  
  <blockquote>
--- 22204,22210 ----
  </p></blockquote>
  
  <p>
! Change D.5 [depr.c.headers], para. 2-3:
  </p>
  
  <blockquote>
*************** names within the namespace <tt>std</tt>.
*** 22535,22544 ****
  
  <hr>
  <h3><a name="457"></a>457. bitset constructor: incorrect number of initialized bits</h3>
! <p><b>Section:</b> 20.5.1 [bitset.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dag Henriksson <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitset.cons">issues</a> in [bitset.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The constructor from unsigned long says it initializes "the first M
--- 22236,22245 ----
  
  <hr>
  <h3><a name="457"></a>457. bitset constructor: incorrect number of initialized bits</h3>
! <p><b>Section:</b> 20.6.1 [bitset.cons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dag Henriksson <b>Opened:</b> 2004-01-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitset.cons">issues</a> in [bitset.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The constructor from unsigned long says it initializes "the first M
*************** guaranteed to have any corresponding bit
*** 22555,22561 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.5.1 [bitset.cons] paragraph 2, change "M is the smaller of
    N and the value CHAR_BIT * sizeof (unsigned long). (249)" to
    "<tt>M</tt> is the smaller of <tt>N</tt> and the number of bits in
    the value representation (section 3.9 [basic.types]) of <tt>unsigned
--- 22256,22262 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 20.6.1 [bitset.cons] paragraph 2, change "M is the smaller of
    N and the value CHAR_BIT * sizeof (unsigned long). (249)" to
    "<tt>M</tt> is the smaller of <tt>N</tt> and the number of bits in
    the value representation (section 3.9 [basic.types]) of <tt>unsigned
*************** guaranteed to have any corresponding bit
*** 22568,22577 ****
  
  <hr>
  <h3><a name="460"></a>460. Default modes missing from basic_fstream member specifications</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ben Hutchings <b>Opened:</b> 2004-04-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The second parameters of the non-default constructor and of the open
--- 22269,22278 ----
  
  <hr>
  <h3><a name="460"></a>460. Default modes missing from basic_fstream member specifications</h3>
! <p><b>Section:</b> 27.9.1 [fstreams] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ben Hutchings <b>Opened:</b> 2004-04-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#fstreams">issues</a> in [fstreams].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The second parameters of the non-default constructor and of the open
*************** that it is intended to be callable with
*** 22586,22602 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>In 27.9.1.15 [fstream.cons], change</p>
! <pre>  explicit basic_fstream(const char* s, ios_base::openmode mode); 
  </pre>
  <p>to</p>
! <pre>  explicit basic_fstream(const char* s,
                           ios_base::openmode mode = ios_base::in|ios_base::out);
  </pre>
  <p>In 27.9.1.17 [fstream.members], change</p>
! <pre>  void open(const char*s, ios_base::openmode mode); 
  </pre>
  <p>to</p>
! <pre>  void open(const char*s,
              ios_base::openmode mode = ios_base::in|ios_base::out);
  </pre>
  
--- 22287,22307 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>In 27.9.1.15 [fstream.cons], change</p>
! <pre>
!   explicit basic_fstream(const char* s, ios_base::openmode mode); 
  </pre>
  <p>to</p>
! <pre>
!   explicit basic_fstream(const char* s,
                           ios_base::openmode mode = ios_base::in|ios_base::out);
  </pre>
  <p>In 27.9.1.17 [fstream.members], change</p>
! <pre>
!   void open(const char*s, ios_base::openmode mode); 
  </pre>
  <p>to</p>
! <pre>
!   void open(const char*s,
              ios_base::openmode mode = ios_base::in|ios_base::out);
  </pre>
  
*************** that it is intended to be callable with
*** 22606,22614 ****
  
  <hr>
  <h3><a name="461"></a>461. time_get hard or impossible to implement</h3>
! <p><b>Section:</b> 22.4.5.1.2 [locale.time.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-03-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Template time_get currently contains difficult, if not impossible,
--- 22311,22319 ----
  
  <hr>
  <h3><a name="461"></a>461. time_get hard or impossible to implement</h3>
! <p><b>Section:</b> 22.4.5.1.2 [locale.time.get.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bill Plauger <b>Opened:</b> 2004-03-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Template time_get currently contains difficult, if not impossible,
*************** and maximum latitude, we can permit an i
*** 22648,22654 ****
  <p><b>Proposed resolution:</b></p>
  
  <p><b>In the description:</b></p>
! <pre>iter_type do_get_time(iter_type s, iter_type end, ios_base&amp; str,
          ios_base::iostate&amp; err, tm* t) const;
  </pre>
  
--- 22353,22360 ----
  <p><b>Proposed resolution:</b></p>
  
  <p><b>In the description:</b></p>
! <pre>
! iter_type do_get_time(iter_type s, iter_type end, ios_base&amp; str,
          ios_base::iostate&amp; err, tm* t) const;
  </pre>
  
*************** encounters an error or end of sequence.
*** 22665,22693 ****
  
  
  <p>Change</p>
! <pre>iter_type do_get_date(iter_type s, iter_type end, ios_base&amp; str,
          ios_base::iostate&amp; err, tm* t) const;
  
  4 Effects: Reads characters starting at s until it has extracted those
  struct tm members, and remaining format characters, used by
! time_put&lt;&gt;::put to produce the format specified by 'x', or until it
  encounters an error.
  </pre>
  
  <p>to</p>
! <pre>iter_type do_get_date(iter_type s, iter_type end, ios_base&amp; str,
          ios_base::iostate&amp; err, tm* t) const;
  </pre>
  
  <p>
  4 Effects: Reads characters starting at s until it has extracted those
  struct tm members, and remaining format characters, used by
! time_put&lt;&gt;::put to produce one of the following formats, or until it
  encounters an error. The format depends on the value returned by
  date_order() as follows:
  </p>
  
! <pre>        date_order()  format
  
          no_order      "%m/%d/%y"
          dmy           "%d/%m/%y"
--- 22371,22402 ----
  
  
  <p>Change</p>
! <pre>
! iter_type do_get_date(iter_type s, iter_type end, ios_base&amp; str,
          ios_base::iostate&amp; err, tm* t) const;
  
  4 Effects: Reads characters starting at s until it has extracted those
  struct tm members, and remaining format characters, used by
! time_put&lt;>::put to produce the format specified by 'x', or until it
  encounters an error.
  </pre>
  
  <p>to</p>
! <pre>
! iter_type do_get_date(iter_type s, iter_type end, ios_base&amp; str,
          ios_base::iostate&amp; err, tm* t) const;
  </pre>
  
  <p>
  4 Effects: Reads characters starting at s until it has extracted those
  struct tm members, and remaining format characters, used by
! time_put&lt;>::put to produce one of the following formats, or until it
  encounters an error. The format depends on the value returned by
  date_order() as follows:
  </p>
  
! <pre>
!         date_order()  format
  
          no_order      "%m/%d/%y"
          dmy           "%d/%m/%y"
*************** An implementation may also accept additi
*** 22711,22727 ****
  
  <hr>
  <h3><a name="464"></a>464. Suggestion for new member functions in standard containers</h3>
! <p><b>Section:</b> 23.4.1 [vector], 23.6.1 [map] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2004-05-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>To add slightly more convenience to vector&lt;T&gt; and map&lt;Key,T&gt; we should consider to add</p>
  <ol>
! <li> add vector&lt;T&gt;::data() member (const and non-const version)
  semantics: if( empty() ) return 0; else return buffer_;</li>
! <li> add map&lt;Key,T&gt;::at( const Key&amp; k ) member (const and non-const version)
  <i>semantics</i>: iterator i = find( k ); if( i != end() ) return *i; else throw range_error();</li>
  </ol>
  
--- 22420,22436 ----
  
  <hr>
  <h3><a name="464"></a>464. Suggestion for new member functions in standard containers</h3>
! <p><b>Section:</b> 23.3.6 [vector], 23.4.4 [map] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2004-05-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>To add slightly more convenience to vector&lt;T> and map&lt;Key,T> we should consider to add</p>
  <ol>
! <li> add vector&lt;T>::data() member (const and non-const version)
  semantics: if( empty() ) return 0; else return buffer_;</li>
! <li> add map&lt;Key,T>::at( const Key&amp; k ) member (const and non-const version)
  <i>semantics</i>: iterator i = find( k ); if( i != end() ) return *i; else throw range_error();</li>
  </ol>
  
*************** semantics: if( empty() ) return 0; else
*** 22729,22735 ****
  
  <ul>
  <li>To obtain a pointer to the vector's buffer, one must use either operator[]() (which can give undefined  behavior for empty vectors) or at() (which will then throw if the vector is empty).  </li>
! <li>tr1::array&lt;T,sz&gt; already has a data() member</li>
  <li>e cannot use operator[]() when T is not DefaultDonstructible</li>
  <li>Neither when the map is const.</li>
  <li>when we want to make sure we don't add an element accidently</li>
--- 22438,22444 ----
  
  <ul>
  <li>To obtain a pointer to the vector's buffer, one must use either operator[]() (which can give undefined  behavior for empty vectors) or at() (which will then throw if the vector is empty).  </li>
! <li>tr1::array&lt;T,sz> already has a data() member</li>
  <li>e cannot use operator[]() when T is not DefaultDonstructible</li>
  <li>Neither when the map is const.</li>
  <li>when we want to make sure we don't add an element accidently</li>
*************** semantics: if( empty() ) return 0; else
*** 22739,22755 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 23.4.1 [vector], add the following to the <tt>vector</tt>
    synopsis after "element access" and before "modifiers":</p>
! <pre>  // <i>[lib.vector.data] data access</i>
    pointer       data();
    const_pointer data() const;
  </pre>
  
! <p>Add a new subsection of 23.4.1 [vector]:</p>
  <blockquote>
  <p>23.2.4.x <tt>vector</tt> data access</p>
! <pre>   pointer       data();
     const_pointer data() const;
  </pre>
  <p><b>Returns:</b> A pointer such that [data(), data() + size()) is a valid
--- 22448,22466 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>In 23.3.6 [vector], add the following to the <tt>vector</tt>
    synopsis after "element access" and before "modifiers":</p>
! <pre>
!   // <i>[lib.vector.data] data access</i>
    pointer       data();
    const_pointer data() const;
  </pre>
  
! <p>Add a new subsection of 23.3.6 [vector]:</p>
  <blockquote>
  <p>23.2.4.x <tt>vector</tt> data access</p>
! <pre>
!    pointer       data();
     const_pointer data() const;
  </pre>
  <p><b>Returns:</b> A pointer such that [data(), data() + size()) is a valid
*************** semantics: if( empty() ) return 0; else
*** 22758,22772 ****
  <p><b>Throws:</b> Nothing.</p>
  </blockquote>
  
! <p>In 23.6.1 [map], add the following to the <tt>map</tt>
  synopsis immediately after the line for operator[]:</p>
! <pre>  T&amp;       at(const key_type&amp; x);
    const T&amp; at(const key_type&amp; x) const;
  </pre>
  
! <p>Add the following to 23.6.1.2 [map.access]:</p>
  <blockquote>
! <pre>  T&amp;       at(const key_type&amp; x);
    const T&amp; at(const key_type&amp; x) const;
  </pre>
  
--- 22469,22485 ----
  <p><b>Throws:</b> Nothing.</p>
  </blockquote>
  
! <p>In 23.4.4 [map], add the following to the <tt>map</tt>
  synopsis immediately after the line for operator[]:</p>
! <pre>
!   T&amp;       at(const key_type&amp; x);
    const T&amp; at(const key_type&amp; x) const;
  </pre>
  
! <p>Add the following to 23.4.4.3 [map.access]:</p>
  <blockquote>
! <pre>
!   T&amp;       at(const key_type&amp; x);
    const T&amp; at(const key_type&amp; x) const;
  </pre>
  
*************** synopsis immediately after the line for
*** 22789,22816 ****
  
  
  <hr>
! <h3><a name="465"></a>465. Contents of &lt;ciso646&gt;</h3>
! <p><b>Section:</b> 17.6.1.2 [headers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2004-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#headers">issues</a> in [headers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>C header &lt;iso646.h&gt; defines macros for some operators, such as
  not_eq for !=.</p>
  
  <p>Section 17.6.1.2 [headers] "Headers" says that except as noted in
! clauses 18 through 27, the &lt;cname&gt; C++ header contents are the same
! as the C header &lt;name.h&gt;. In particular, table 12 lists
! &lt;ciso646&gt; as a C++ header.</p>
  
! <p>I don't find any other mention of &lt;ciso646&gt;, or any mention of
! &lt;iso646.h&gt;, in clauses 17 thorough 27. That implies that the
! contents of &lt;ciso646&gt; are the same as C header &lt;iso646.h&gt;.</p>
  
  <p>Annex C (informative, not normative) in [diff.header.iso646.h] C.2.2.2
! "Header &lt;iso646.h&gt;" says that the alternative tokens are not
! defined as macros in &lt;ciso646&gt;, but does not mention the contents
! of &lt;iso646.h&gt;.</p>
  
  <p>I don't find any normative text to support C.2.2.2.</p>
  
--- 22502,22529 ----
  
  
  <hr>
! <h3><a name="465"></a>465. Contents of &lt;ciso646></h3>
! <p><b>Section:</b> 17.6.1.2 [headers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve Clamage <b>Opened:</b> 2004-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#headers">issues</a> in [headers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>C header &lt;iso646.h> defines macros for some operators, such as
  not_eq for !=.</p>
  
  <p>Section 17.6.1.2 [headers] "Headers" says that except as noted in
! clauses 18 through 27, the &lt;cname> C++ header contents are the same
! as the C header &lt;name.h>. In particular, table 12 lists
! &lt;ciso646> as a C++ header.</p>
  
! <p>I don't find any other mention of &lt;ciso646>, or any mention of
! &lt;iso646.h>, in clauses 17 thorough 27. That implies that the
! contents of &lt;ciso646> are the same as C header &lt;iso646.h>.</p>
  
  <p>Annex C (informative, not normative) in [diff.header.iso646.h] C.2.2.2
! "Header &lt;iso646.h>" says that the alternative tokens are not
! defined as macros in &lt;ciso646>, but does not mention the contents
! of &lt;iso646.h>.</p>
  
  <p>I don't find any normative text to support C.2.2.2.</p>
  
*************** of &lt;iso646.h&gt;.</p>
*** 22823,22830 ****
  <blockquote>
  <p>Identifiers that are keywords or operators in C++ shall not be defined
  as macros in C++ standard library headers. 
! [Footnote:In particular, including the standard header &lt;iso646.h&gt;
! or &lt;ciso646&gt; has no effect. </p>
  </blockquote>
  
  <p><i>[post-Redmond: Steve provided wording.]</i></p>
--- 22536,22543 ----
  <blockquote>
  <p>Identifiers that are keywords or operators in C++ shall not be defined
  as macros in C++ standard library headers. 
! [Footnote:In particular, including the standard header &lt;iso646.h>
! or &lt;ciso646> has no effect. </p>
  </blockquote>
  
  <p><i>[post-Redmond: Steve provided wording.]</i></p>
*************** or &lt;ciso646&gt; has no effect. </p>
*** 22837,22855 ****
  
  <hr>
  <h3><a name="467"></a>467. char_traits::lt(), compare(), and memcmp()</h3>
! <p><b>Section:</b> 21.2.3.1 [char.traits.specializations.char] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  Table 37 describes the requirements on Traits::compare() in terms of
! those on Traits::lt(). 21.1.3.1, p6 requires char_traits&lt;char&gt;::lt()
  to yield the same result as operator&lt;(char, char).
  </p>
  
  <p>
! Most, if not all, implementations of char_traits&lt;char&gt;::compare()
  call memcmp() for efficiency. However, the C standard requires both
  memcmp() and strcmp() to interpret characters under comparison as
  unsigned, regardless of the signedness of char. As a result, all
--- 22550,22568 ----
  
  <hr>
  <h3><a name="467"></a>467. char_traits::lt(), compare(), and memcmp()</h3>
! <p><b>Section:</b> 21.2.3.1 [char.traits.specializations.char] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  Table 37 describes the requirements on Traits::compare() in terms of
! those on Traits::lt(). 21.1.3.1, p6 requires char_traits&lt;char>::lt()
  to yield the same result as operator&lt;(char, char).
  </p>
  
  <p>
! Most, if not all, implementations of char_traits&lt;char>::compare()
  call memcmp() for efficiency. However, the C standard requires both
  memcmp() and strcmp() to interpret characters under comparison as
  unsigned, regardless of the signedness of char. As a result, all
*************** imposed by Table 37 on compare() when ch
*** 22888,22897 ****
  
  <hr>
  <h3><a name="468"></a>468. unexpected consequences of ios_base::operator void*()</h3>
! <p><b>Section:</b> 27.5.4.3 [iostate.flags] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>The program below is required to compile but when run it typically
--- 22601,22610 ----
  
  <hr>
  <h3><a name="468"></a>468. unexpected consequences of ios_base::operator void*()</h3>
! <p><b>Section:</b> 27.5.5.4 [iostate.flags] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>The program below is required to compile but when run it typically
*************** produces unexpected results due to the u
*** 22899,22906 ****
  std::cout or any object derived from basic_ios to void*.
  </p>
  
! <pre>    #include &lt;cassert&gt;
!     #include &lt;iostream&gt;
  
      int main ()
      {
--- 22612,22620 ----
  std::cout or any object derived from basic_ios to void*.
  </p>
  
! <pre>
!     #include &lt;cassert>
!     #include &lt;iostream>
  
      int main ()
      {
*************** std::cout or any object derived from bas
*** 22913,22919 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Replace std::basic_ios&lt;charT, traits&gt;::operator void*() with another
  conversion operator to some unspecified type that is guaranteed not
  to be convertible to any other type except for bool (a pointer-to-member
  might be one such suitable type). In addition, make it clear that the
--- 22627,22633 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Replace std::basic_ios&lt;charT, traits>::operator void*() with another
  conversion operator to some unspecified type that is guaranteed not
  to be convertible to any other type except for bool (a pointer-to-member
  might be one such suitable type). In addition, make it clear that the
*************** the value need not be valid.
*** 22922,22937 ****
  </p>
  
  <p>Specifically, change in [lib.ios] the signature of</p>
! <pre>    operator void*() const;
  </pre>
  <p>to</p>
! <pre>    operator unspecified-bool-type() const;
  </pre>
  <p>and change [lib.iostate.flags], p1 from</p>
! <pre>    operator void*() const;
  </pre>
  <p>to</p>
! <pre>operator unspecified-bool-type() const;
  
       -1- Returns: if fail() then a value that will evaluate false in a
        boolean context; otherwise a value that will evaluate true in a
--- 22636,22655 ----
  </p>
  
  <p>Specifically, change in [lib.ios] the signature of</p>
! <pre>
!     operator void*() const;
  </pre>
  <p>to</p>
! <pre>
!     operator unspecified-bool-type() const;
  </pre>
  <p>and change [lib.iostate.flags], p1 from</p>
! <pre>
!     operator void*() const;
  </pre>
  <p>to</p>
! <pre>
! operator unspecified-bool-type() const;
  
       -1- Returns: if fail() then a value that will evaluate false in a
        boolean context; otherwise a value that will evaluate true in a
*************** the value need not be valid.
*** 22960,22973 ****
  
  <hr>
  <h3><a name="469"></a>469. vector&lt;bool&gt; ill-formed relational operators</h3>
! <p><b>Section:</b> 23.4.1 [vector] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! The overloads of relational operators for vector&lt;bool&gt; specified
  in [lib.vector.bool] are redundant (they are semantically identical
  to those provided for the vector primary template) and may even be
  diagnosed as ill-formed (refer to Daveed Vandevoorde's explanation
--- 22678,22691 ----
  
  <hr>
  <h3><a name="469"></a>469. vector&lt;bool&gt; ill-formed relational operators</h3>
! <p><b>Section:</b> 23.3.6 [vector] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! The overloads of relational operators for vector&lt;bool> specified
  in [lib.vector.bool] are redundant (they are semantically identical
  to those provided for the vector primary template) and may even be
  diagnosed as ill-formed (refer to Daveed Vandevoorde's explanation
*************** in c++std-lib-13647).
*** 22979,22999 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  Remove all overloads of overloads of relational operators for
! vector&lt;bool&gt; from [lib.vector.bool].
  </p>
  
  
  
  
  <hr>
! <h3><a name="471"></a>471. result of what() implementation-defined</h3>
! <p><b>Section:</b> 18.8.1 [exception] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>[lib.exception] specifies the following:</p>
! <pre>    exception (const exception&amp;) throw();
      exception&amp; operator= (const exception&amp;) throw();
  
      -4- Effects: Copies an exception object.
--- 22697,22718 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  Remove all overloads of overloads of relational operators for
! vector&lt;bool> from [lib.vector.bool].
  </p>
  
  
  
  
  <hr>
! <h3><a name="471"></a>471. result of <tt>what()</tt> implementation-defined</h3>
! <p><b>Section:</b> 18.8.1 [exception] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>[lib.exception] specifies the following:</p>
! <pre>
!     exception (const exception&amp;) throw();
      exception&amp; operator= (const exception&amp;) throw();
  
      -4- Effects: Copies an exception object.
*************** Sophia Antipolis:
*** 23068,23077 ****
  ]</i></p>
  
  
! <blockquote>
  The issue was pulled from Ready.  It needs to make clear that only homogenous copying
  is intended to be supported, not coping from a derived to a base.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
--- 22787,22796 ----
  ]</i></p>
  
  
! <blockquote><p>
  The issue was pulled from Ready.  It needs to make clear that only homogenous copying
  is intended to be supported, not coping from a derived to a base.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
*************** Batavia (2009-05):
*** 23082,23093 ****
  Howard supplied the following replacement wording
  for paragraph 7 of the proposed resolution:
  </p>
! <blockquote>
  <ins>-7- <i>Postcondition:</i> <tt>what()</tt> shall return the same NTBS
    as would be obtained by using <tt>static_cast</tt>
    to cast the rhs to the same types as the lhs
    and then calling <tt>what()</tt> on that possibly sliced object.</ins>
! </blockquote>
  <p>
  Pete asks what "the same NTBS" means.
  </p>
--- 22801,22812 ----
  Howard supplied the following replacement wording
  for paragraph 7 of the proposed resolution:
  </p>
! <blockquote><p>
  <ins>-7- <i>Postcondition:</i> <tt>what()</tt> shall return the same NTBS
    as would be obtained by using <tt>static_cast</tt>
    to cast the rhs to the same types as the lhs
    and then calling <tt>what()</tt> on that possibly sliced object.</ins>
! </p></blockquote>
  <p>
  Pete asks what "the same NTBS" means.
  </p>
*************** Pete asks what "the same NTBS" means.
*** 23098,23106 ****
  ]</i></p>
  
  
! <blockquote>
  Further discussion in the thread starting with c++std-lib-24512.
! </blockquote>
  
  <p><i>[
  2009-09-24 Niels provided updated wording:
--- 22817,22825 ----
  ]</i></p>
  
  
! <blockquote><p>
  Further discussion in the thread starting with c++std-lib-24512.
! </p></blockquote>
  
  <p><i>[
  2009-09-24 Niels provided updated wording:
*************** satisfy the proposed resolution, includi
*** 23119,23125 ****
  stdcxx-4.2.1, GCC 4.1.2, GCC 4.3.2, and CodeGear C++ 6.13.
  </p>
  <p>
! The proposed resolution was updated with help from Daniel Krügler;
  the update aims to clarify that the proposed postcondition only
  applies to homogeneous copying.
  </p>
--- 22838,22844 ----
  stdcxx-4.2.1, GCC 4.1.2, GCC 4.3.2, and CodeGear C++ 6.13.
  </p>
  <p>
! The proposed resolution was updated with help from Daniel Kr&uuml;gler;
  the update aims to clarify that the proposed postcondition only
  applies to homogeneous copying.
  </p>
*************** applies to homogeneous copying.
*** 23130,23138 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready after inserting "publicly accessible" in two places.
! </blockquote>
  
  
  
--- 22849,22857 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready after inserting "publicly accessible" in two places.
! </p></blockquote>
  
  
  
*************** are implementation-defined.</del>
*** 23188,23203 ****
  
  
  <hr>
! <h3><a name="473"></a>473. underspecified ctype calls</h3>
! <p><b>Section:</b> 22.4.1.1 [locale.ctype] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-07-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Most ctype member functions come in two forms: one that operates
  on a single character at a time and another form that operates
  on a range of characters. Both forms are typically described by
! a single Effects and/or Returns clause.
  </p>
  <p>
  The Returns clause of each of the single-character non-virtual forms
--- 22907,22922 ----
  
  
  <hr>
! <h3><a name="473"></a>473. underspecified <tt>ctype</tt> calls</h3>
! <p><b>Section:</b> 22.4.1.1 [locale.ctype] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Most <tt>ctype</tt> member functions come in two forms: one that operates
  on a single character at a time and another form that operates
  on a range of characters. Both forms are typically described by
! a single Effects and&#47;or Returns clause.
  </p>
  <p>
  The Returns clause of each of the single-character non-virtual forms
*************** the virtual function of the alternate fo
*** 23231,23239 ****
  overriden.
  </p>
  <p>
! Thus, it might be possible for, say, ctype::widen(c) to return one
! value, while for ctype::widen(&amp;c, &amp;c + 1, &amp;wc) to set
! wc to another value. This is almost certainly not intended. Both
  forms of every function should be required to return the same result
  for the same character, otherwise the same program using an
  implementation that calls one form of the functions will behave
--- 22950,22958 ----
  overriden.
  </p>
  <p>
! Thus, it might be possible for, say, <tt>ctype::widen(c)</tt> to return one
! value, while for <tt>ctype::widen(&amp;c, &amp;c + 1, &amp;wc)</tt> to set
! <tt>wc</tt> to another value. This is almost certainly not intended. Both
  forms of every function should be required to return the same result
  for the same character, otherwise the same program using an
  implementation that calls one form of the functions will behave
*************** of the function in turn calls the other
*** 23254,23264 ****
  </p>
  <p>
  Lillehammer: Part of this isn't a real problem. We already talk about
! caching. 22.1.1/6 But part is a real problem. ctype virtuals may call
  each other, so users don't know which ones to override to avoid avoid
  infinite loops.</p>
  
! <p>This is a problem for all facet virtuals, not just ctype virtuals,
  so we probably want a blanket statement in clause 22 for all
  facets. The LWG is leaning toward a blanket prohibition, that a
  facet's virtuals may never call each other. We might want to do that
--- 22973,22983 ----
  </p>
  <p>
  Lillehammer: Part of this isn't a real problem. We already talk about
! caching. 22.1.1&#47;6 But part is a real problem. <tt>ctype</tt> virtuals may call
  each other, so users don't know which ones to override to avoid avoid
  infinite loops.</p>
  
! <p>This is a problem for all facet virtuals, not just <tt>ctype</tt> virtuals,
  so we probably want a blanket statement in clause 22 for all
  facets. The LWG is leaning toward a blanket prohibition, that a
  facet's virtuals may never call each other. We might want to do that
*************** provide wording.</p>
*** 23275,23283 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 22994,23002 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Move to Ready.
*** 23286,23295 ****
  Add paragraph 3 to 22.4 [locale.categories]:
  </p>
  
! <blockquote><ins>
  -3- Within this clause it is unspecified if one virtual function calls another
  virtual function.
! </ins></blockquote>
  
  
  
--- 23005,23014 ----
  Add paragraph 3 to 22.4 [locale.categories]:
  </p>
  
! <blockquote><p><ins>
  -3- Within this clause it is unspecified if one virtual function calls another
  virtual function.
! </ins></p></blockquote>
  
  
  
*************** override both virtual functions, not jus
*** 23305,23320 ****
  
  <hr>
  <h3><a name="474"></a>474. confusing Footnote 297</h3>
! <p><b>Section:</b> 27.7.2.6.4 [ostream.inserters.character] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-07-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream.inserters.character">issues</a> in [ostream.inserters.character].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  I think Footnote 297 is confused. The paragraph it applies to seems
  quite clear in that widen() is only called if the object is not a char
! stream (i.e., not basic_ostream&lt;char&gt;), so it's irrelevant what the
  value of widen(c) is otherwise.
  </p>
  
--- 23024,23039 ----
  
  <hr>
  <h3><a name="474"></a>474. confusing Footnote 297</h3>
! <p><b>Section:</b> 27.7.3.6.4 [ostream.inserters.character] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2004-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream.inserters.character">issues</a> in [ostream.inserters.character].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
  I think Footnote 297 is confused. The paragraph it applies to seems
  quite clear in that widen() is only called if the object is not a char
! stream (i.e., not basic_ostream&lt;char>), so it's irrelevant what the
  value of widen(c) is otherwise.
  </p>
  
*************** I propose to strike the Footnote.
*** 23329,23338 ****
  
  <hr>
  <h3><a name="475"></a>475. May the function object passed to for_each modify the elements of the iterated sequence?</h3>
! <p><b>Section:</b> 25.2.4 [alg.foreach] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephan T. Lavavej, Jaakko Jarvi <b>Opened:</b> 2004-07-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.foreach">issues</a> in [alg.foreach].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is not clear whether the function object passed to for_each is allowed to
--- 23048,23057 ----
  
  <hr>
  <h3><a name="475"></a>475. May the function object passed to for_each modify the elements of the iterated sequence?</h3>
! <p><b>Section:</b> 25.2.4 [alg.foreach] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephan T. Lavavej, Jaakko Jarvi <b>Opened:</b> 2004-07-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.foreach">issues</a> in [alg.foreach].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is not clear whether the function object passed to for_each is allowed to
*************** passed to it.
*** 23413,23435 ****
  
  
  <hr>
! <h3><a name="478"></a>478. Should forward iterator requirements table have a line for r-&gt;m?</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-07-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#477">477</a></p>
  <p><b>Discussion:</b></p>
  <p>
  The Forward Iterator requirements table contains the following:
  </p>
! <pre> expression  return type         operational  precondition
                                    semantics
    ==========  ==================  ===========  ==========================
!   a-&gt;m        U&amp; if X is mutable, (*a).m       pre: (*a).m is well-defined.
                otherwise const U&amp;
  
!   r-&gt;m        U&amp;                  (*r).m       pre: (*r).m is well-defined.
  </pre>
  
  <p>The second line may be unnecessary.  Paragraph 11 of
--- 23132,23155 ----
  
  
  <hr>
! <h3><a name="478"></a>478. Should forward iterator requirements table have a line for r->m?</h3>
! <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2004-07-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#477">477</a></p>
  <p><b>Discussion:</b></p>
  <p>
  The Forward Iterator requirements table contains the following:
  </p>
! <pre>
!  expression  return type         operational  precondition
                                    semantics
    ==========  ==================  ===========  ==========================
!   a->m        U&amp; if X is mutable, (*a).m       pre: (*a).m is well-defined.
                otherwise const U&amp;
  
!   r->m        U&amp;                  (*r).m       pre: (*r).m is well-defined.
  </pre>
  
  <p>The second line may be unnecessary.  Paragraph 11 of
*************** current requirements allow iterators to
*** 23450,23461 ****
  specified using the identifiers a and b invalid for non-const
  iterators.</p>
  
! <p>Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#477">477</a></p>
  
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Remove the "r-&gt;m" line from the Forward Iterator requirements
  table. Change</p>
  <blockquote><p>
      "const X"
--- 23170,23181 ----
  specified using the identifiers a and b invalid for non-const
  iterators.</p>
  
! <p>Related issue: <a href="lwg-closed.html#477">477</a></p>
  
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Remove the "r->m" line from the Forward Iterator requirements
  table. Change</p>
  <blockquote><p>
      "const X"
*************** This is a defect because it constrains a
*** 23483,23499 ****
  
  <hr>
  <h3><a name="482"></a>482. Swapping pairs</h3>
! <p><b>Section:</b> 20.3.5 [pairs], 20.4 [tuple] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2004-09-14 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>(Based on recent comp.std.c++ discussion)</p>
  
  <p>Pair (and tuple) should specialize std::swap to work in terms of
  std::swap on their components.  For example, there's no obvious reason
! why swapping two objects of type pair&lt;vector&lt;int&gt;,
! list&lt;double&gt; &gt; should not take O(1).</p>
  
  <p><i>[Lillehammer: We agree it should be swappable.  Howard will
    provide wording.]</i></p>
--- 23203,23219 ----
  
  <hr>
  <h3><a name="482"></a>482. Swapping pairs</h3>
! <p><b>Section:</b> 20.3 [pairs], 20.4 [tuple] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2004-09-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>(Based on recent comp.std.c++ discussion)</p>
  
  <p>Pair (and tuple) should specialize std::swap to work in terms of
  std::swap on their components.  For example, there's no obvious reason
! why swapping two objects of type pair&lt;vector&lt;int>,
! list&lt;double> > should not take O(1).</p>
  
  <p><i>[Lillehammer: We agree it should be swappable.  Howard will
    provide wording.]</i></p>
*************** list&lt;double&gt; &gt; should not take
*** 23501,23507 ****
  
  <p><i>[
  Post Oxford:  We got <tt>swap</tt> for <tt>pair</tt> but accidently
! missed <tt>tuple</tt>.  <tt>tuple::swap</tt> is being tracked by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#522">522</a>.
  ]</i></p>
  
  
--- 23221,23227 ----
  
  <p><i>[
  Post Oxford:  We got <tt>swap</tt> for <tt>pair</tt> but accidently
! missed <tt>tuple</tt>.  <tt>tuple::swap</tt> is being tracked by <a href="lwg-defects.html#522">522</a>.
  ]</i></p>
  
  
*************** Recommend <del>NAD</del><ins>Resolved</i
*** 23524,23533 ****
  
  
  <hr>
  <h3><a name="488"></a>488. rotate throws away useful information</h3>
! <p><b>Section:</b> 25.3.11 [alg.rotate] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2004-11-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  rotate takes 3 iterators:  first, middle and last which point into a
--- 23244,23462 ----
  
  
  <hr>
+ <h3><a name="485"></a>485. output iterator insufficiently constrained</h3>
+ <p><b>Section:</b> 24.2.4 [output.iterators] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2004-10-13 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#output.iterators">active issues</a> in [output.iterators].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#output.iterators">issues</a> in [output.iterators].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The note on 24.1.2 Output iterators insufficiently limits what can be
+ performed on output iterators. While it requires that each iterator is
+ progressed through only once and that each iterator is written to only
+ once, it does not require the following things:</p>
+ 
+ <p>Note: Here it is assumed that <tt>x</tt> is an output iterator of type <tt>X</tt> which
+ has not yet been assigned to.</p>
+ 
+ <p>a) That each value of the output iterator is written to:
+ The standard allows:
+ <tt>++x; ++x; ++x;</tt>
+ </p>
+ 
+ <p>
+ b) That assignments to the output iterator are made in order
+ <tt>X a(x); ++a; *a=1; *x=2;</tt> is allowed
+ </p>
+ 
+ <p>
+ c) Chains of output iterators cannot be constructed:
+ <tt>X a(x); ++a; X b(a); ++b; X c(b); ++c;</tt> is allowed, and under the current
+ wording (I believe) <tt>x,a,b,c</tt> could be written to in any order.
+ </p>
+ 
+ <p>I do not believe this was the intension of the standard?</p>
+ <p><i>[Lillehammer: Real issue.  There are lots of constraints we
+   intended but didn't specify.  Should be solved as part of iterator
+   redesign.]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Bill provided wording according to consensus.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-07-21 Alisdair requests change from Review to Open.  See thread starting
+ with c++std-lib-24459 for discussion.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Modified wording.  Set to Review.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to Ready after looking at again in a larger group in Santa Cruz.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by N3066.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change Table 101 &mdash; Output iterator requirements in 24.2.4 [output.iterators]:
+ </p>
+ <blockquote>
+ <table border="1">
+ <caption>Table 101 &mdash; Output iterator requirements</caption>
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Operational semantics</th>
+ <th>Assertion/note pre-/post-condition</th>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X(a)</tt>
+ </td>
+ <td>
+ &nbsp;
+ </td>
+ <td>
+ &nbsp;
+ </td>
+ <td>
+ <tt>a = t</tt> is equivalent to <tt>X(a) = t</tt>. note: a destructor is assumed.
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>X u(a);</tt><br/>
+ <tt>X u = a;</tt>
+ </td>
+ <td>
+ &nbsp;
+ </td>
+ <td>
+ &nbsp;
+ </td>
+ <td>
+ &nbsp;
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>*r = o</tt>
+ </td>
+ <td>
+ result is not used
+ </td>
+ <td>
+ &nbsp;
+ </td>
+ <td>
+ <ins>
+ Post: <tt>r</tt> is not required to be dereferenceable.  <tt>r</tt> is incrementable.
+ </ins>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>++r</tt>
+ </td>
+ <td>
+ <tt>X&amp;</tt>
+ </td>
+ <td>
+ &nbsp;
+ </td>
+ <td>
+ <tt>&amp;r == &amp;++r</tt>
+ <ins>
+ Post: <tt>r</tt> is dereferenceable, unless otherwise specified.  <tt>r</tt> is not required to be incrementable.
+ </ins>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>r++</tt>
+ </td>
+ <td>
+ convertible to <tt>const X&amp;</tt>
+ </td>
+ <td>
+ <tt>{X tmp = r;<br/>++r;<br/>return tmp;}</tt>
+ </td>
+ <td>
+ <ins>
+ Post: <tt>r</tt> is dereferenceable, unless otherwise specified. <tt>r</tt> is not required to be incrementable.
+ </ins>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>*r++ = o;</tt>
+ </td>
+ <td>
+ result is not used
+ </td>
+ <td>
+ &nbsp;
+ </td>
+ <td>
+ 
+ </td>
+ </tr>
+ 
+ </table>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="488"></a>488. rotate throws away useful information</h3>
! <p><b>Section:</b> 25.3.11 [alg.rotate] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2004-11-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.rotate">issues</a> in [alg.rotate].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  rotate takes 3 iterators:  first, middle and last which point into a
*************** In many use cases of rotate, the client
*** 23541,23547 ****
  subrange [first, middle) starts after the rotate is performed.  This
  might look like: 
  </p>
! <pre>  rotate(first, middle, last);
    Iterator i = advance(first, distance(middle, last));
  </pre>
  
--- 23470,23477 ----
  subrange [first, middle) starts after the rotate is performed.  This
  might look like: 
  </p>
! <pre>
!   rotate(first, middle, last);
    Iterator i = advance(first, distance(middle, last));
  </pre>
  
*************** start of the subrange [first, middle) ha
*** 23551,23557 ****
  it is not difficult for rotate to return this information with
  negligible additional computation expense.  So the client could code: 
  </p>
! <pre>  Iterator i = rotate(first, middle, last);
  </pre>
  
  <p>
--- 23481,23488 ----
  it is not difficult for rotate to return this information with
  negligible additional computation expense.  So the client could code: 
  </p>
! <pre>
!   Iterator i = rotate(first, middle, last);
  </pre>
  
  <p>
*************** and the resulting program becomes signif
*** 23560,23566 ****
  
  <p>
  While the backwards compatibility hit with this change is not zero, it
! is very small (similar to that of lwg <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#130">130</a>), and there is
  a significant benefit to the change. 
  </p>
  
--- 23491,23497 ----
  
  <p>
  While the backwards compatibility hit with this change is not zero, it
! is very small (similar to that of lwg <a href="lwg-defects.html#130">130</a>), and there is
  a significant benefit to the change. 
  </p>
  
*************** a significant benefit to the change.
*** 23569,23582 ****
  <p><b>Proposed resolution:</b></p>
  <p>In 25 [algorithms] p2, change:</p>
  
! <blockquote><pre>  template&lt;class ForwardIterator&gt;
      <del>void</del> <ins>ForwardIterator</ins> rotate(ForwardIterator first, ForwardIterator middle,
                  ForwardIterator last);
  </pre></blockquote>
  
  <p>In 25.3.11 [alg.rotate], change:</p>
  
! <blockquote><pre>  template&lt;class ForwardIterator&gt;
      <del>void</del> <ins>ForwardIterator</ins> rotate(ForwardIterator first, ForwardIterator middle,
                  ForwardIterator last);
  </pre></blockquote>
--- 23500,23515 ----
  <p><b>Proposed resolution:</b></p>
  <p>In 25 [algorithms] p2, change:</p>
  
! <blockquote><pre>
!   template&lt;class ForwardIterator>
      <del>void</del> <ins>ForwardIterator</ins> rotate(ForwardIterator first, ForwardIterator middle,
                  ForwardIterator last);
  </pre></blockquote>
  
  <p>In 25.3.11 [alg.rotate], change:</p>
  
! <blockquote><pre>
!   template&lt;class ForwardIterator>
      <del>void</del> <ins>ForwardIterator</ins> rotate(ForwardIterator first, ForwardIterator middle,
                  ForwardIterator last);
  </pre></blockquote>
*************** Toronto: moved to Ready.
*** 23611,23620 ****
  
  <hr>
  <h3><a name="495"></a>495. Clause 22 template parameter requirements</h3>
! <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2005-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#localization">issues</a> in [localization].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It appears that there are no requirements specified for many of the
  template parameters in clause 22. It looks like this issue has never
--- 23544,23553 ----
  
  <hr>
  <h3><a name="495"></a>495. Clause 22 template parameter requirements</h3>
! <p><b>Section:</b> 22 [localization] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2005-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#localization">issues</a> in [localization].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>It appears that there are no requirements specified for many of the
  template parameters in clause 22. It looks like this issue has never
*************** requirements of charT (described in 21 [
*** 23687,23702 ****
  
  <hr>
  <h3><a name="496"></a>496. Illegal use of "T" in vector&lt;bool&gt;</h3>
! <p><b>Section:</b> 23.4.1 [vector] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> richard@ex-parrot.com <b>Opened:</b> 2005-02-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In the synopsis of the std::vector&lt;bool&gt; specialisation in 23.4.1 [vector],
  the non-template assign() function has the signature</p>
  
! <pre>  void assign( size_type n, const T&amp; t );
  </pre>
  
  <p>The type, T, is not defined in this context.</p>
--- 23620,23636 ----
  
  <hr>
  <h3><a name="496"></a>496. Illegal use of "T" in vector&lt;bool&gt;</h3>
! <p><b>Section:</b> 23.3.6 [vector] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> richard@ex-parrot.com <b>Opened:</b> 2005-02-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector">issues</a> in [vector].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In the synopsis of the std::vector&lt;bool> specialisation in 23.3.6 [vector],
  the non-template assign() function has the signature</p>
  
! <pre>
!   void assign( size_type n, const T&amp; t );
  </pre>
  
  <p>The type, T, is not defined in this context.</p>
*************** the non-template assign() function has t
*** 23711,23728 ****
  
  <hr>
  <h3><a name="497"></a>497. meaning of numeric_limits::traps for floating point types</h3>
! <p><b>Section:</b> 18.3.1.2 [numeric.limits.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-03-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numeric.limits.members">issues</a> in [numeric.limits.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>18.2.1.2, p59 says this much about the traps member of numeric_limits:</p>
  
  <blockquote>
! <p>static const bool traps;<br>
  -59- true if trapping is implemented for the type.204)
! <br>
  Footnote 204: Required by LIA-1.
  </p>
  </blockquote>
--- 23645,23662 ----
  
  <hr>
  <h3><a name="497"></a>497. meaning of numeric_limits::traps for floating point types</h3>
! <p><b>Section:</b> 18.3.2.4 [numeric.limits.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-03-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numeric.limits.members">issues</a> in [numeric.limits.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>18.2.1.2, p59 says this much about the traps member of numeric_limits:</p>
  
  <blockquote>
! <p>static const bool traps;<br/>
  -59- true if trapping is implemented for the type.204)
! <br/>
  Footnote 204: Required by LIA-1.
  </p>
  </blockquote>
*************** at runtime.
*** 23774,23782 ****
  
  <hr>
  <h3><a name="498"></a>498. Requirements for partition() and stable_partition() too strong</h3>
! <p><b>Section:</b> 25.3.13 [alg.partitions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Sean Parent, Joe Gottman <b>Opened:</b> 2005-05-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Problem:
--- 23708,23717 ----
  
  <hr>
  <h3><a name="498"></a>498. Requirements for partition() and stable_partition() too strong</h3>
! <p><b>Section:</b> 25.3.13 [alg.partitions] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Sean Parent, Joe Gottman <b>Opened:</b> 2005-05-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.partitions">issues</a> in [alg.partitions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Problem:
*************** Proposed resolution:
*** 23805,23814 ****
  Add the following signature to:
  </p>
  <p>
! Header <tt>&lt;algorithm&gt;</tt> synopsis  [algorithms.syn]<br>
  p3 Partitions 25.3.13 [alg.partitions]
  </p>
! <blockquote><pre> template&lt;ForwardIterator Iter, Predicate&lt;auto, Iter::value_type&gt; Pred&gt;
     requires ShuffleIterator&lt;Iter&gt;
           &amp;&amp; CopyConstructible&lt;Pred&gt;
     Iter partition(Iter first, Iter last, Pred pred);
--- 23740,23750 ----
  Add the following signature to:
  </p>
  <p>
! Header <tt>&lt;algorithm&gt;</tt> synopsis  [algorithms.syn]<br/>
  p3 Partitions 25.3.13 [alg.partitions]
  </p>
! <blockquote><pre>
!  template&lt;ForwardIterator Iter, Predicate&lt;auto, Iter::value_type&gt; Pred&gt;
     requires ShuffleIterator&lt;Iter&gt;
           &amp;&amp; CopyConstructible&lt;Pred&gt;
     Iter partition(Iter first, Iter last, Pred pred);
*************** Move to Ready.
*** 23867,23879 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  Change 25.2.12 from </p>
! <blockquote><pre>template&lt;class BidirectionalIterator, class Predicate&gt; 
  BidirectionalIterator partition(BidirectionalIterato r first, 
                                  BidirectionalIterator last, 
                                  Predicate pred); 
  </pre></blockquote>
  <p>to </p>
! <blockquote><pre>template&lt;class ForwardIterator, class Predicate&gt; 
  ForwardIterator partition(ForwardIterator first, 
                            ForwardIterator last, 
                            Predicate pred); 
--- 23803,23817 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  Change 25.2.12 from </p>
! <blockquote><pre>
! template&lt;class BidirectionalIterator, class Predicate&gt; 
  BidirectionalIterator partition(BidirectionalIterato r first, 
                                  BidirectionalIterator last, 
                                  Predicate pred); 
  </pre></blockquote>
  <p>to </p>
! <blockquote><pre>
! template&lt;class ForwardIterator, class Predicate&gt; 
  ForwardIterator partition(ForwardIterator first, 
                            ForwardIterator last, 
                            Predicate pred); 
*************** to work for ForwardIterator a minor emba
*** 23918,23927 ****
  
  <hr>
  <h3><a name="505"></a>505. Result_type in random distribution requirements</h3>
! <p><b>Section:</b> 26.5.1 [rand.req], TR1 5.1.1 [tr.rand.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.req">issues</a> in [rand.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 17: Random distribution requirements
--- 23856,23865 ----
  
  <hr>
  <h3><a name="505"></a>505. Result_type in random distribution requirements</h3>
! <p><b>Section:</b> 26.5.1 [rand.req], TR1 5.1.1 [tr.rand.req] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req">issues</a> in [rand.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 17: Random distribution requirements
*************** for all distributions and should therefo
*** 23944,23951 ****
  row to this table 17:
  </p>
  <table border="1" cellpadding="5">
! <tbody><tr><td>X::result_type</td><td>T</td><td>---</td><td>compile-time</td></tr>
! </tbody></table>
  
  <p><i>[
  Berlin:  Voted to WP.  N1932 adopts the proposed resolution:  see Table 5 row 1.
--- 23882,23889 ----
  row to this table 17:
  </p>
  <table border="1" cellpadding="5">
! <tr><td>X::result_type</td><td>T</td><td>---</td><td>compile-time</td></tr>
! </table>
  
  <p><i>[
  Berlin:  Voted to WP.  N1932 adopts the proposed resolution:  see Table 5 row 1.
*************** Berlin:  Voted to WP.  N1932 adopts the
*** 23959,23978 ****
  
  <hr>
  <h3><a name="507"></a>507. Missing requirement for variate_generator::operator()</h3>
! <p><b>Section:</b> 26.5 [rand], TR1 5.1.3 [tr.rand.var] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 11 of [tr.rand.var] equires that the member template
  </p>
! <blockquote><pre>template&lt;class T&gt; result_type operator() (T value);
  </pre></blockquote>
  <p>
  return
  </p>
! <blockquote><pre>distribution()(e, value)
  </pre></blockquote>
  <p>
  However, not all distributions have an operator() with a corresponding signature.
--- 23897,23918 ----
  
  <hr>
  <h3><a name="507"></a>507. Missing requirement for variate_generator::operator()</h3>
! <p><b>Section:</b> 26.5 [rand], TR1 5.1.3 [tr.rand.var] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Paragraph 11 of [tr.rand.var] equires that the member template
  </p>
! <blockquote><pre>
! template&lt;class T&gt; result_type operator() (T value);
  </pre></blockquote>
  <p>
  return
  </p>
! <blockquote><pre>
! distribution()(e, value)
  </pre></blockquote>
  <p>
  However, not all distributions have an operator() with a corresponding signature.
*************** Precondition:  <tt>distribution().operat
*** 24001,24024 ****
  
  <hr>
  <h3><a name="508"></a>508. Bad parameters for ranlux64_base_01</h3>
! <p><b>Section:</b> 26.5.5 [rand.predef], TR1 5.1.5 [tr.rand.predef] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.predef">issues</a> in [rand.predef].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The fifth of these engines with predefined parameters, ranlux64_base_01,
  appears to have an unintentional error for which there is a simple correction.
  The two pre-defined  subtract_with_carry_01 engines are given as: 
  </p>
! <blockquote><pre>typedef subtract_with_carry_01&lt;float,  24, 10, 24&gt; ranlux_base_01;
  typedef subtract_with_carry_01&lt;double, 48, 10, 24&gt; ranlux64_base_01;
  </pre></blockquote>
  <p>
  We demonstrate below that ranlux64_base_01 fails to meet the intent of the
  random number generation proposal, but that the simple correction to
  </p>
! <blockquote><pre>typedef subtract_with_carry_01&lt;double, 48,  5, 12&gt; ranlux64_base_01;
  </pre></blockquote>
  <p>
  does meet the intent of defining well-known good parameterizations.
--- 23941,23966 ----
  
  <hr>
  <h3><a name="508"></a>508. Bad parameters for ranlux64_base_01</h3>
! <p><b>Section:</b> 26.5.5 [rand.predef], TR1 5.1.5 [tr.rand.predef] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.predef">issues</a> in [rand.predef].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The fifth of these engines with predefined parameters, ranlux64_base_01,
  appears to have an unintentional error for which there is a simple correction.
  The two pre-defined  subtract_with_carry_01 engines are given as: 
  </p>
! <blockquote><pre>
! typedef subtract_with_carry_01&lt;float,  24, 10, 24&gt; ranlux_base_01;
  typedef subtract_with_carry_01&lt;double, 48, 10, 24&gt; ranlux64_base_01;
  </pre></blockquote>
  <p>
  We demonstrate below that ranlux64_base_01 fails to meet the intent of the
  random number generation proposal, but that the simple correction to
  </p>
! <blockquote><pre>
! typedef subtract_with_carry_01&lt;double, 48,  5, 12&gt; ranlux64_base_01;
  </pre></blockquote>
  <p>
  does meet the intent of defining well-known good parameterizations.
*************** to deliver 48 random bits at a time rath
*** 24057,24063 ****
  <p>
  To achieve this intended behavior, the correct template parameteriztion  would be:
  </p>
! <blockquote><pre>typedef subtract_with_carry_01&lt;double, 48, 5, 12&gt; ranlux64_base_01;
  </pre></blockquote>
  <p>
  The sequence of mantissa bits delivered by this is isomorphic (treating each
--- 23999,24006 ----
  <p>
  To achieve this intended behavior, the correct template parameteriztion  would be:
  </p>
! <blockquote><pre>
! typedef subtract_with_carry_01&lt;double, 48, 5, 12&gt; ranlux64_base_01;
  </pre></blockquote>
  <p>
  The sequence of mantissa bits delivered by this is isomorphic (treating each
*************** just above paragraph 5.
*** 24085,24095 ****
  
  <hr>
  <h3><a name="518"></a>518. Are insert and erase stable for unordered_multiset and unordered_multimap?</h3>
! <p><b>Section:</b> 23.2.5 [unord.req], TR1 6.3.1 [tr.unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Issue 371 deals with stability of multiset/multimap under insert and erase
--- 24028,24038 ----
  
  <hr>
  <h3><a name="518"></a>518. Are insert and erase stable for unordered_multiset and unordered_multimap?</h3>
! <p><b>Section:</b> 23.2.5 [unord.req], TR1 6.3.1 [tr.unord.req] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Issue 371 deals with stability of multiset/multimap under insert and erase
*************** preserves the relative ordering of equiv
*** 24154,24163 ****
  
  <hr>
  <h3><a name="519"></a>519. Data() undocumented</h3>
! <p><b>Section:</b> 23.3.1 [array], TR1 6.2.2 [tr.array.array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>array&lt;&gt;::data()</tt> is present in the class synopsis, but not documented.
--- 24097,24107 ----
  
  <hr>
  <h3><a name="519"></a>519. Data() undocumented</h3>
! <p><b>Section:</b> 23.3.2 [array], TR1 6.2.2 [tr.array.array] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>array&lt;&gt;::data()</tt> is present in the class synopsis, but not documented.
*************** preserves the relative ordering of equiv
*** 24168,24174 ****
  <p>
  Add a new section, after 6.2.2.3:
  </p>
! <blockquote><pre>T*       data()
  const T* data() const;
  </pre></blockquote>
  <p>
--- 24112,24119 ----
  <p>
  Add a new section, after 6.2.2.3:
  </p>
! <blockquote><pre>
! T*       data()
  const T* data() const;
  </pre></blockquote>
  <p>
*************** of <tt>data()</tt> is unspecified.
*** 24188,24196 ****
  
  <hr>
  <h3><a name="520"></a>520. Result_of and pointers to data members</h3>
! <p><b>Section:</b> 20.8.10.1 [func.bind], TR1 3.6 [tr.func.bind] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the original proposal for binders, the return type of bind() when
--- 24133,24141 ----
  
  <hr>
  <h3><a name="520"></a>520. Result_of and pointers to data members</h3>
! <p><b>Section:</b> 20.9.10 [func.bind], TR1 3.6 [tr.func.bind] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the original proposal for binders, the return type of bind() when
*************** Pete and Peter will provide wording.
*** 24213,24219 ****
  <p>
  In 20.5.4 [lib.func.ret] ([tr.func.ret]) p3 add the following bullet after bullet 2:
  </p>
! <ol start="3">
  <li>If <tt>F</tt> is a member data pointer type <tt>R T::*</tt>, <tt>type</tt>
  shall be <tt><i>cv</i> R&amp;</tt> when <tt>T1</tt> is <tt><i>cv</i> U1&amp;</tt>,
  <tt>R</tt> otherwise.</li>
--- 24158,24166 ----
  <p>
  In 20.5.4 [lib.func.ret] ([tr.func.ret]) p3 add the following bullet after bullet 2:
  </p>
! <ol>
! <li>[&hellip;]</li>
! <li>[&hellip;]</li>
  <li>If <tt>F</tt> is a member data pointer type <tt>R T::*</tt>, <tt>type</tt>
  shall be <tt><i>cv</i> R&amp;</tt> when <tt>T1</tt> is <tt><i>cv</i> U1&amp;</tt>,
  <tt>R</tt> otherwise.</li>
*************** Peter provided wording.
*** 24231,24240 ****
  
  <hr>
  <h3><a name="521"></a>521. Garbled requirements for argument_type in reference_wrapper</h3>
! <p><b>Section:</b> 20.8.4 [refwrap], TR1 2.1.2 [tr.util.refwrp.refwrp] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#refwrap">issues</a> in [refwrap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  2.1.2/3, second bullet item currently says that reference_wrapper&lt;T&gt; is
--- 24178,24187 ----
  
  <hr>
  <h3><a name="521"></a>521. Garbled requirements for argument_type in reference_wrapper</h3>
! <p><b>Section:</b> 20.9.4 [refwrap], TR1 2.1.2 [tr.util.refwrp.refwrp] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#refwrap">issues</a> in [refwrap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  2.1.2/3, second bullet item currently says that reference_wrapper&lt;T&gt; is
*************** function's cv-qualifiers); the type <tt>
*** 24303,24312 ****
  
  <hr>
  <h3><a name="522"></a>522. Tuple doesn't define swap</h3>
! <p><b>Section:</b> 20.4 [tuple], TR1 6.1 [tr.tuple] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Koenig <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple">issues</a> in [tuple].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Tuple doesn't define swap().  It should.
--- 24250,24259 ----
  
  <hr>
  <h3><a name="522"></a>522. Tuple doesn't define swap</h3>
! <p><b>Section:</b> 20.4 [tuple], TR1 6.1 [tr.tuple] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Andy Koenig <b>Opened:</b> 2005-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple">issues</a> in [tuple].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Tuple doesn't define swap().  It should.
*************** Bellevue:  Alisdair provided wording.
*** 24337,24343 ****
  Add these signatures to 20.4 [tuple]
  </p>
  
! <blockquote><pre>template &lt;class... Types&gt;
    void swap(tuple&lt;Types...&gt;&amp; x, tuple&lt;Types...&gt;&amp; y);
  template &lt;class... Types&gt;
    void swap(tuple&lt;Types...&gt;&amp;&amp; x, tuple&lt;Types...&gt;&amp; y);
--- 24284,24291 ----
  Add these signatures to 20.4 [tuple]
  </p>
  
! <blockquote><pre>
! template &lt;class... Types&gt;
    void swap(tuple&lt;Types...&gt;&amp; x, tuple&lt;Types...&gt;&amp; y);
  template &lt;class... Types&gt;
    void swap(tuple&lt;Types...&gt;&amp;&amp; x, tuple&lt;Types...&gt;&amp; y);
*************** template &lt;class... Types&gt;
*** 24349,24355 ****
  Add this signature to 20.4.2 [tuple.tuple]
  </p>
  
! <blockquote><pre>void swap(tuple&amp;&amp;);
  </pre></blockquote>
  
  <p>
--- 24297,24304 ----
  Add this signature to 20.4.2 [tuple.tuple]
  </p>
  
! <blockquote><pre>
! void swap(tuple&amp;&amp;);
  </pre></blockquote>
  
  <p>
*************** Add the following two sections to the en
*** 24361,24367 ****
  20.3.1.7 tuple swap [tuple.swap]
  </p>
  
! <pre>void swap(tuple&amp;&amp; rhs); 
  </pre>
  
  <blockquote>
--- 24310,24317 ----
  20.3.1.7 tuple swap [tuple.swap]
  </p>
  
! <pre>
! void swap(tuple&amp;&amp; rhs); 
  </pre>
  
  <blockquote>
*************** exception.
*** 24382,24388 ****
  20.3.1.8 tuple specialized algorithms [tuple.special]
  </p>
  
! <pre>template &lt;class... Types&gt;
    void swap(tuple&lt;Types...&gt;&amp; x, tuple&lt;Types...&gt;&amp; y);
  template &lt;class... Types&gt;
    void swap(tuple&lt;Types...&gt;&amp;&amp; x, tuple&lt;Types...&gt;&amp; y);
--- 24332,24339 ----
  20.3.1.8 tuple specialized algorithms [tuple.special]
  </p>
  
! <pre>
! template &lt;class... Types&gt;
    void swap(tuple&lt;Types...&gt;&amp; x, tuple&lt;Types...&gt;&amp; y);
  template &lt;class... Types&gt;
    void swap(tuple&lt;Types...&gt;&amp;&amp; x, tuple&lt;Types...&gt;&amp; y);
*************** template &lt;class... Types&gt;
*** 24404,24413 ****
  
  <hr>
  <h3><a name="524"></a>524. regex named character classes and case-insensitivity don't mix</h3>
! <p><b>Section:</b> 28 [re] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2005-07-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re">issues</a> in [re].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This defect is also being discussed on the Boost developers list. The 
--- 24355,24365 ----
  
  <hr>
  <h3><a name="524"></a>524. regex named character classes and case-insensitivity don't mix</h3>
! <p><b>Section:</b> 28 [re] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2005-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re">active issues</a> in [re].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re">issues</a> in [re].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This defect is also being discussed on the Boost developers list. The 
*************** The LWG voted to accelerate this issue t
*** 24482,24491 ****
  
  <hr>
  <h3><a name="525"></a>525. type traits definitions not clear</h3>
! <p><b>Section:</b> 20.7.4 [meta.unary], TR1 4.5 [tr.meta.unary] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2005-07-11 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary">issues</a> in [meta.unary].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is not completely clear how the primary type traits deal with
--- 24434,24443 ----
  
  <hr>
  <h3><a name="525"></a>525. type traits definitions not clear</h3>
! <p><b>Section:</b> 20.10.4 [meta.unary], TR1 4.5 [tr.meta.unary] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2005-07-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary">issues</a> in [meta.unary].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is not completely clear how the primary type traits deal with
*************** Berlin:  Howard to provide wording.
*** 24502,24530 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  Wording provided in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2028.html">N2028</a>.
! A
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2157.html">revision (N2157)</a>
  provides more detail for motivation.
  </p>
  
  
! <p><b>Rationale:</b></p>
  Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2157.html">revision (N2157)</a>
  in the WP.
! 
  
  
  
  
  <hr>
! <h3><a name="527"></a>527. tr1::bind has lost its Throws clause</h3>
! <p><b>Section:</b> 20.8.10.1.2 [func.bind.bind], TR1 3.6.3 [tr.func.bind.bind] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2005-10-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.bind.bind">issues</a> in [func.bind.bind].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The original bind proposal gives the guarantee that tr1::bind(f, t1, ..., tN) does not throw when the copy constructors of f, t1, ..., tN don't.
  </p>
  
  <p>
--- 24454,24482 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  Wording provided in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2028.html">N2028</a>.
! A <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2157.html">revision (N2157)</a>
  provides more detail for motivation.
  </p>
  
  
! <p><b>Rationale:</b></p><p>
  Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2157.html">revision (N2157)</a>
  in the WP.
! </p>
  
  
  
  
  <hr>
! <h3><a name="527"></a>527. <tt>tr1::bind</tt> has lost its Throws clause</h3>
! <p><b>Section:</b> 20.9.10.3 [func.bind.bind], TR1 3.6.3 [tr.func.bind.bind] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2005-10-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.bind.bind">issues</a> in [func.bind.bind].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The original bind proposal gives the guarantee that <tt>tr1::bind(f, t1, ..., tN)</tt> 
! does not throw when the copy constructors of <tt>f, t1, ..., tN</tt> don't.
  </p>
  
  <p>
*************** throws an exception.
*** 24583,24604 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.8.10.1.2 [func.bind.bind], add a new paragraph after p2:
  </p>
  
! <blockquote>
  <i>Throws:</i> Nothing unless the copy constructor of <tt>F</tt> or of one of the types
  in the <tt>BoundArgs...</tt> pack expansion throws an exception. 
! </blockquote>
  
  <p>
! In 20.8.10.1.2 [func.bind.bind], add a new paragraph after p4:
  </p>
  
! <blockquote>
  <i>Throws:</i> Nothing unless the copy constructor of <tt>F</tt> or of one of the types
  in the <tt>BoundArgs...</tt> pack expansion throws an exception. 
! </blockquote>
  
  
  
--- 24535,24556 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9.10.3 [func.bind.bind], add a new paragraph after p2:
  </p>
  
! <blockquote><p>
  <i>Throws:</i> Nothing unless the copy constructor of <tt>F</tt> or of one of the types
  in the <tt>BoundArgs...</tt> pack expansion throws an exception. 
! </p></blockquote>
  
  <p>
! In 20.9.10.3 [func.bind.bind], add a new paragraph after p4:
  </p>
  
! <blockquote><p>
  <i>Throws:</i> Nothing unless the copy constructor of <tt>F</tt> or of one of the types
  in the <tt>BoundArgs...</tt> pack expansion throws an exception. 
! </p></blockquote>
  
  
  
*************** in the <tt>BoundArgs...</tt> pack expans
*** 24607,24622 ****
  
  <hr>
  <h3><a name="530"></a>530. Must elements of a string be contiguous?</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2005-11-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#69">69</a>, which was incorporated into C++03, mandated
     that the elements of a vector must be stored in contiguous memory.
     Should the same also apply to <tt>basic_string</tt>?</p>
  
! <p>We almost require contiguity already. Clause 23.6.4 [multiset]
    defines <tt>operator[]</tt> as <tt>data()[pos]</tt>. What's missing
    is a similar guarantee if we access the string's elements via the
    iterator interface.</p>
--- 24559,24575 ----
  
  <hr>
  <h3><a name="530"></a>530. Must elements of a string be contiguous?</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2005-11-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Issue <a href="lwg-defects.html#69">69</a>, which was incorporated into C++03, mandated
     that the elements of a vector must be stored in contiguous memory.
     Should the same also apply to <tt>basic_string</tt>?</p>
  
! <p>We almost require contiguity already. Clause 23.4.7 [multiset]
    defines <tt>operator[]</tt> as <tt>data()[pos]</tt>. What's missing
    is a similar guarantee if we access the string's elements via the
    iterator interface.</p>
*************** more design choices.
*** 24660,24669 ****
  
  <hr>
  <h3><a name="531"></a>531. array forms of unformatted input functions</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-11-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The array forms of unformatted input functions don't seem to have well-defined
--- 24613,24623 ----
  
  <hr>
  <h3><a name="531"></a>531. array forms of unformatted input functions</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-11-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The array forms of unformatted input functions don't seem to have well-defined
*************** writing to out of bounds memory when <tt
*** 24736,24745 ****
  
  <hr>
  <h3><a name="533"></a>533. typo in 2.2.3.10/1</h3>
! <p><b>Section:</b> 20.9.10.2.11 [util.smartptr.getdeleter], TR1 2.2.3.10 [tr.util.smartptr.getdeleter] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2005-11-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.getdeleter">issues</a> in [util.smartptr.getdeleter].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I'm seeing something that looks like a typo. The Return of <tt>get_deleter</tt>
--- 24690,24699 ----
  
  <hr>
  <h3><a name="533"></a>533. typo in 2.2.3.10/1</h3>
! <p><b>Section:</b> 20.8.2.2.10 [util.smartptr.getdeleter], TR1 2.2.3.10 [tr.util.smartptr.getdeleter] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2005-11-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.getdeleter">issues</a> in [util.smartptr.getdeleter].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I'm seeing something that looks like a typo. The Return of <tt>get_deleter</tt>
*************** If <tt><del>*this</del> <ins>p</ins></tt
*** 24767,24776 ****
  
  <hr>
  <h3><a name="534"></a>534. Missing basic_string members</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2005-11-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  OK, we all know std::basic_string is bloated and already has way too
--- 24721,24731 ----
  
  <hr>
  <h3><a name="534"></a>534. Missing basic_string members</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2005-11-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  OK, we all know std::basic_string is bloated and already has way too
*************** added to vector, or at() member added to
*** 24823,24829 ****
  <p>
  Add the following members to definition of class template basic_string, 21.3p7
  </p>
! <blockquote><pre>void pop_back ()
  
  const charT &amp; front() const
  charT &amp; front()
--- 24778,24785 ----
  <p>
  Add the following members to definition of class template basic_string, 21.3p7
  </p>
! <blockquote><pre>
! void pop_back ()
  
  const charT &amp; front() const
  charT &amp; front()
*************** Add the following paragraphs to basic_st
*** 24839,24845 ****
  21.3.4p5
  </p>
  <blockquote>
! <pre>const charT &amp; front() const
  charT &amp; front()
  </pre>
  <p>
--- 24795,24802 ----
  21.3.4p5
  </p>
  <blockquote>
! <pre>
! const charT &amp; front() const
  charT &amp; front()
  </pre>
  <p>
*************** charT &amp; front()
*** 24854,24860 ****
  21.3.4p6
  </p>
  <blockquote>
! <pre>const charT &amp; back() const
  charT &amp; back()
  </pre>
  <p>
--- 24811,24818 ----
  21.3.4p6
  </p>
  <blockquote>
! <pre>
! const charT &amp; back() const
  charT &amp; back()
  </pre>
  <p>
*************** charT &amp; back()
*** 24869,24875 ****
  21.3.5.5p10
  </p>
  <blockquote>
! <pre>void pop_back ()
  </pre>
  <p>
  <i>Precondition:</i> <tt>!empty()</tt>
--- 24827,24834 ----
  21.3.5.5p10
  </p>
  <blockquote>
! <pre>
! void pop_back ()
  </pre>
  <p>
  <i>Precondition:</i> <tt>!empty()</tt>
*************** charT &amp; back()
*** 24883,24889 ****
  Update Table 71: (optional sequence operations)
  Add basic_string to the list of containers for the following operations.
  </p>
! <blockquote><pre>a.front()
  a.back()
  a.push_back()
  a.pop_back()
--- 24842,24849 ----
  Update Table 71: (optional sequence operations)
  Add basic_string to the list of containers for the following operations.
  </p>
! <blockquote><pre>
! a.front()
  a.back()
  a.push_back()
  a.pop_back()
*************** Berlin: Has support.  Alisdair provided
*** 24901,24910 ****
  
  <hr>
  <h3><a name="535"></a>535. std::string::swap specification poorly worded</h3>
! <p><b>Section:</b> 21.4.6.8 [string::swap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2005-12-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::swap">issues</a> in [string::swap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  std::string::swap currently says for effects and postcondition:
--- 24861,24870 ----
  
  <hr>
  <h3><a name="535"></a>535. std::string::swap specification poorly worded</h3>
! <p><b>Section:</b> 21.4.6.8 [string::swap] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2005-12-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::swap">issues</a> in [string::swap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  std::string::swap currently says for effects and postcondition:
*************** characters that <del>were</del> <ins>was
*** 24948,24970 ****
  
  <hr>
  <h3><a name="537"></a>537. Typos in the signatures in 27.6.1.3/42-43 and 27.6.2.4</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-02-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the most recent working draft, I'm still seeing:
  </p>
  
! <blockquote><pre>seekg(off_type&amp; off, ios_base::seekdir dir)
  </pre></blockquote>
  
  <p>
  and
  </p>
  
! <blockquote><pre>seekp(pos_type&amp; pos)
  
  seekp(off_type&amp; off, ios_base::seekdir dir)
  </pre></blockquote>
--- 24908,24933 ----
  
  <hr>
  <h3><a name="537"></a>537. Typos in the signatures in 27.6.1.3/42-43 and 27.6.2.4</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2006-02-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the most recent working draft, I'm still seeing:
  </p>
  
! <blockquote><pre>
! seekg(off_type&amp; off, ios_base::seekdir dir)
  </pre></blockquote>
  
  <p>
  and
  </p>
  
! <blockquote><pre>
! seekp(pos_type&amp; pos)
  
  seekp(off_type&amp; off, ios_base::seekdir dir)
  </pre></blockquote>
*************** that is, by reference off and pos argume
*** 24979,24999 ****
  After 27.6.1.3p42 change:
  </p>
  
! <blockquote><pre>basic_istream&lt;charT,traits&gt;&amp; seekg(off_type<del>&amp;</del> <i>off</i>, ios_base::seekdir <i>dir</i>);
  </pre></blockquote>
  
  <p>
  After 27.6.2.4p1 change:
  </p>
  
! <blockquote><pre>basic_ostream&lt;charT,traits&gt;&amp; seekp(pos_type<del>&amp;</del> <i>pos</i>);
  </pre></blockquote>
  
  <p>
  After 27.6.2.4p3 change:
  </p>
  
! <blockquote><pre>basic_ostream&lt;charT,traits&gt;&amp; seekp(off_type<del>&amp;</del> <i>off</i>, ios_base::seekdir <i>dir</i>);
  </pre></blockquote>
  
  
--- 24942,24965 ----
  After 27.6.1.3p42 change:
  </p>
  
! <blockquote><pre>
! basic_istream&lt;charT,traits&gt;&amp; seekg(off_type<del>&amp;</del> <i>off</i>, ios_base::seekdir <i>dir</i>);
  </pre></blockquote>
  
  <p>
  After 27.6.2.4p1 change:
  </p>
  
! <blockquote><pre>
! basic_ostream&lt;charT,traits&gt;&amp; seekp(pos_type<del>&amp;</del> <i>pos</i>);
  </pre></blockquote>
  
  <p>
  After 27.6.2.4p3 change:
  </p>
  
! <blockquote><pre>
! basic_ostream&lt;charT,traits&gt;&amp; seekp(off_type<del>&amp;</del> <i>off</i>, ios_base::seekdir <i>dir</i>);
  </pre></blockquote>
  
  
*************** After 27.6.2.4p3 change:
*** 25002,25011 ****
  
  <hr>
  <h3><a name="538"></a>538. 241 again: Does unique_copy() require CopyConstructible and Assignable?</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I believe I botched the resolution of
--- 24968,24977 ----
  
  <hr>
  <h3><a name="538"></a>538. 241 again: Does unique_copy() require CopyConstructible and Assignable?</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I believe I botched the resolution of
*************** and that one can assign from <tt>*<i>fir
*** 25037,25043 ****
  This latter requirement does not necessarily imply that you can:
  </p>
  
! <blockquote><pre>*<i>first</i> = *<i>first</i>;
  </pre></blockquote>
  
  
--- 25003,25010 ----
  This latter requirement does not necessarily imply that you can:
  </p>
  
! <blockquote><pre>
! *<i>first</i> = *<i>first</i>;
  </pre></blockquote>
  
  
*************** Otherwise CopyConstructible is not requi
*** 25059,25072 ****
  
  
  <hr>
! <h3><a name="539"></a>539. partial_sum and adjacent_difference should mention requirements</h3>
! <p><b>Section:</b> 26.7.3 [partial.sum] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Marc Schoolderman <b>Opened:</b> 2006-02-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! There are some problems in the definition of partial_sum and
! adjacent_difference in 26.4 [lib.numeric.ops]
  </p>
  
  <p>
--- 25026,25039 ----
  
  
  <hr>
! <h3><a name="539"></a>539. <tt>partial_sum</tt> and <tt>adjacent_difference</tt> should mention requirements</h3>
! <p><b>Section:</b> 26.7.4 [partial.sum] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Marc Schoolderman <b>Opened:</b> 2006-02-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! There are some problems in the definition of <tt>partial_sum</tt> and
! <tt>adjacent_difference</tt> in 26.4 [lib.numeric.ops]
  </p>
  
  <p>
*************** specifies the effects clause as;
*** 25079,25085 ****
  Assigns to every element referred to by iterator <tt>i</tt> in the range
  <tt>[result,result + (last - first))</tt> a value correspondingly equal to
  </p>
! <blockquote><pre>((...(* first + *( first + 1)) + ...) + *( first + ( i - result )))
  </pre></blockquote>
  </blockquote>
  
--- 25046,25053 ----
  Assigns to every element referred to by iterator <tt>i</tt> in the range
  <tt>[result,result + (last - first))</tt> a value correspondingly equal to
  </p>
! <blockquote><pre>
! ((...(* first + *( first + 1)) + ...) + *( first + ( i - result )))
  </pre></blockquote>
  </blockquote>
  
*************** logical to expect that:
*** 25089,25095 ****
  </p>
  
  
! <blockquote><pre>char i_array[4] = { 100, 100, 100, 100 };
  int  o_array[4];
  
  std::partial_sum(i_array, i_array+4, o_array);
--- 25057,25064 ----
  </p>
  
  
! <blockquote><pre>
! char i_array[4] = { 100, 100, 100, 100 };
  int  o_array[4];
  
  std::partial_sum(i_array, i_array+4, o_array);
*************** std::partial_sum(i_array, i_array+4, o_a
*** 25099,25105 ****
  Is equivalent to
  </p>
  
! <blockquote><pre>int o_array[4] = { 100, 100+100, 100+100+100, 100+100+100+100 };
  </pre></blockquote>
  
  <p>
--- 25068,25075 ----
  Is equivalent to
  </p>
  
! <blockquote><pre>
! int o_array[4] = { 100, 100+100, 100+100+100, 100+100+100+100 };
  </pre></blockquote>
  
  <p>
*************** The issue becomes more noticeable when t
*** 25119,25125 ****
  <tt>value_type</tt>. In a contrived example:
  </p>
  
! <blockquote><pre>enum not_int { x = 1, y = 2 };
  ...
  not_int e_array[4] = { x, x, y, y };
  std::partial_sum(e_array, e_array+4, o_array);
--- 25089,25096 ----
  <tt>value_type</tt>. In a contrived example:
  </p>
  
! <blockquote><pre>
! enum not_int { x = 1, y = 2 };
  ...
  not_int e_array[4] = { x, x, y, y };
  std::partial_sum(e_array, e_array+4, o_array);
*************** In both cases, the semantics should prob
*** 25181,25187 ****
  all implementations seem to perform operations in the 'result' type:
  </p>
  
! <blockquote><pre>unsigned char i_array[4] = { 4, 3, 2, 1 };
  int o_array[4];
  
  std::adjacent_difference(i_array, i_array+4, o_array);
--- 25152,25159 ----
  all implementations seem to perform operations in the 'result' type:
  </p>
  
! <blockquote><pre>
! unsigned char i_array[4] = { 4, 3, 2, 1 };
  int o_array[4];
  
  std::adjacent_difference(i_array, i_array+4, o_array);
*************** Bellevue:
*** 25213,25236 ****
  ]</i></p>
  
  
! <blockquote>
  The intent of the algorithms is to perform their calculations using the type of the input iterator.
  Proposed wording provided.
! </blockquote>
  
  <p><i>[
  Sophia Antipolis:
  ]</i></p>
  
  
! <blockquote>
  We did not agree that the proposed resolution was correct. For example,
  when the arguments are types <tt>(float*, float*, double*)</tt>, the
  highest-quality solution would use double as the type of the
  accumulator. If the intent of the wording is to require that the type of
  the accumulator must be the <tt>input_iterator</tt>'s <tt>value_type</tt>, the wording
  should specify it.
! </blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
--- 25185,25208 ----
  ]</i></p>
  
  
! <blockquote><p>
  The intent of the algorithms is to perform their calculations using the type of the input iterator.
  Proposed wording provided.
! </p></blockquote>
  
  <p><i>[
  Sophia Antipolis:
  ]</i></p>
  
  
! <blockquote><p>
  We did not agree that the proposed resolution was correct. For example,
  when the arguments are types <tt>(float*, float*, double*)</tt>, the
  highest-quality solution would use double as the type of the
  accumulator. If the intent of the wording is to require that the type of
  the accumulator must be the <tt>input_iterator</tt>'s <tt>value_type</tt>, the wording
  should specify it.
! </p></blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
*************** should specify it.
*** 25242,25248 ****
  Now that we have the facility, the 'best' accumulator type could probably be
  deduced as:
  </p>
! <blockquote><pre>std::common_type&lt;InIter::value_type, OutIter::reference&gt;::type
  </pre></blockquote>
  <p>
  This type would then have additional requirements of constructability and
--- 25214,25221 ----
  Now that we have the facility, the 'best' accumulator type could probably be
  deduced as:
  </p>
! <blockquote><pre>
! std::common_type&lt;InIter::value_type, OutIter::reference&gt;::type
  </pre></blockquote>
  <p>
  This type would then have additional requirements of constructability and
*************** clearer indication of preferred directio
*** 25264,25274 ****
  ]</i></p>
  
  
! <blockquote>
  The proposed resolution isn't quite right. For example, "the type of
! *first" should be changed to "iterator::value_type" or similar. Daniel
  volunteered to correct the wording.
! </blockquote>
  
  <p><i>[
  2009-07-29 Daniel corrected wording.
--- 25237,25247 ----
  ]</i></p>
  
  
! <blockquote><p>
  The proposed resolution isn't quite right. For example, "the type of
! <tt>*first</tt>" should be changed to "<tt>iterator::value_type</tt>" or similar. Daniel
  volunteered to correct the wording.
! </p></blockquote>
  
  <p><i>[
  2009-07-29 Daniel corrected wording.
*************** volunteered to correct the wording.
*** 25280,25288 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 25253,25261 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Move to Ready.
*** 25293,25299 ****
  <ol>
  <li>
  <p>
! Change 26.7.3 [partial.sum]/1 as indicated:
  </p>
  
  <blockquote>
--- 25266,25272 ----
  <ol>
  <li>
  <p>
! Change 26.7.4 [partial.sum]/1 as indicated:
  </p>
  
  <blockquote>
*************** binary_op(binary_op(...,
*** 25325,25357 ****
  
  <li>
  <p>
! Change 26.7.3 [partial.sum]/3 as indicated:
  </p>
  
! <blockquote>
  <i>Complexity:</i> Exactly <tt><ins>max(</ins>(last - first) - 1<ins>, 0)</ins></tt>
  applications
  of <tt><del>binary_op</del></tt><ins>the binary operation</ins>.
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 26.7.3 [partial.sum]/4 as indicated:
  </p>
  
! <blockquote>
  <i>Requires:</i> <ins><tt>VT</tt> shall be constructible from the type of <tt>*first</tt>, the result of
  <tt>acc + *i</tt> or <tt>binary_op(acc, *i)</tt> shall be implicitly convertible to <tt>VT</tt>, and
  the result of the expression <tt>acc</tt> shall be writable to the <tt>result</tt>
  output iterator.</ins> In the ranges <tt>[first,last]</tt> and
  <tt>[result,result + (last - first)]</tt> [..]
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 26.7.4 [adjacent.difference]/1 as indicated:
  </p>
  
  <blockquote>
--- 25298,25330 ----
  
  <li>
  <p>
! Change 26.7.4 [partial.sum]/3 as indicated:
  </p>
  
! <blockquote><p>
  <i>Complexity:</i> Exactly <tt><ins>max(</ins>(last - first) - 1<ins>, 0)</ins></tt>
  applications
  of <tt><del>binary_op</del></tt><ins>the binary operation</ins>.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 26.7.4 [partial.sum]/4 as indicated:
  </p>
  
! <blockquote><p>
  <i>Requires:</i> <ins><tt>VT</tt> shall be constructible from the type of <tt>*first</tt>, the result of
  <tt>acc + *i</tt> or <tt>binary_op(acc, *i)</tt> shall be implicitly convertible to <tt>VT</tt>, and
  the result of the expression <tt>acc</tt> shall be writable to the <tt>result</tt>
  output iterator.</ins> In the ranges <tt>[first,last]</tt> and
  <tt>[result,result + (last - first)]</tt> [..]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 26.7.5 [adjacent.difference]/1 as indicated:
  </p>
  
  <blockquote>
*************** result gets the value of *first.</del>
*** 25388,25397 ****
  
  <li>
  <p>
! Change 26.7.4 [adjacent.difference]/2 as indicated:
  </p>
  
! <blockquote>
  <i>Requires:</i> <ins><tt>VT</tt> shall be <tt>MoveAssignable</tt> ([moveassignable])
  and shall be
  constructible from the type of <tt>*first</tt>. The result
--- 25361,25370 ----
  
  <li>
  <p>
! Change 26.7.5 [adjacent.difference]/2 as indicated:
  </p>
  
! <blockquote><p>
  <i>Requires:</i> <ins><tt>VT</tt> shall be <tt>MoveAssignable</tt> ([moveassignable])
  and shall be
  constructible from the type of <tt>*first</tt>. The result
*************** of the expression <tt>acc</tt> and the r
*** 25399,25417 ****
  <tt>binary_op(val, acc)</tt>
  shall be writable to the <tt>result</tt> output iterator.</ins> In the ranges
  <tt>[first,last]</tt> [..]
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 26.7.4 [adjacent.difference]/5 as indicated:
  </p>
  
! <blockquote>
  <i>Complexity:</i> Exactly <tt><ins>max(</ins>(last - first) - 1<ins>, 0)</ins></tt>
  applications
  of <del><tt>binary_op</tt></del><ins>the binary operation</ins>.
! </blockquote>
  </li>
  </ol>
  
--- 25372,25390 ----
  <tt>binary_op(val, acc)</tt>
  shall be writable to the <tt>result</tt> output iterator.</ins> In the ranges
  <tt>[first,last]</tt> [..]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 26.7.5 [adjacent.difference]/5 as indicated:
  </p>
  
! <blockquote><p>
  <i>Complexity:</i> Exactly <tt><ins>max(</ins>(last - first) - 1<ins>, 0)</ins></tt>
  applications
  of <del><tt>binary_op</tt></del><ins>the binary operation</ins>.
! </p></blockquote>
  </li>
  </ol>
  
*************** of <del><tt>binary_op</tt></del><ins>the
*** 25424,25433 ****
  
  <hr>
  <h3><a name="540"></a>540. shared_ptr&lt;void&gt;::operator*()</h3>
! <p><b>Section:</b> 20.9.10.2.5 [util.smartptr.shared.obs], TR1 2.2.3.5 [tr.util.smartptr.shared.obs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-10-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.obs">issues</a> in [util.smartptr.shared.obs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I'm trying to reconcile the note in tr.util.smartptr.shared.obs, p6
--- 25397,25406 ----
  
  <hr>
  <h3><a name="540"></a>540. shared_ptr&lt;void&gt;::operator*()</h3>
! <p><b>Section:</b> 20.8.2.2.5 [util.smartptr.shared.obs], TR1 2.2.3.5 [tr.util.smartptr.shared.obs] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-10-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.obs">issues</a> in [util.smartptr.shared.obs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I'm trying to reconcile the note in tr.util.smartptr.shared.obs, p6
*************** definition) of the function shall be wel
*** 25482,25491 ****
  
  <hr>
  <h3><a name="541"></a>541. shared_ptr template assignment and void</h3>
! <p><b>Section:</b> 20.9.10.2 [util.smartptr.shared], TR1 2.2.3 [tr.util.smartptr.shared] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-10-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Is the void specialization of the template assignment operator taking
--- 25455,25465 ----
  
  <hr>
  <h3><a name="541"></a>541. shared_ptr template assignment and void</h3>
! <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared], TR1 2.2.3 [tr.util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-10-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Is the void specialization of the template assignment operator taking
*************** a shared_ptr&lt;void&gt; as an argument
*** 25494,25500 ****
  <p>
  I.e., is this snippet well-formed:
  </p>
! <blockquote><pre>shared_ptr&lt;void&gt; p;
  p.operator=&lt;void&gt;(p);
  </pre></blockquote>
  
--- 25468,25475 ----
  <p>
  I.e., is this snippet well-formed:
  </p>
! <blockquote><pre>
! shared_ptr&lt;void&gt; p;
  p.operator=&lt;void&gt;(p);
  </pre></blockquote>
  
*************** though in a small test case (below) I ca
*** 25516,25522 ****
  it as well.
  </p>
  
! <blockquote><pre>template &lt;class T&gt;
  struct A { T&amp; operator*() { return *(T*)0; } };
  
  template &lt;class T&gt;
--- 25491,25498 ----
  it as well.
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt;
  struct A { T&amp; operator*() { return *(T*)0; } };
  
  template &lt;class T&gt;
*************** int main ()
*** 25540,25546 ****
  <p>
  In [lib.memory] change:
  </p>
! <blockquote><pre>template&lt;class X&gt; class auto_ptr;
  <ins>template&lt;&gt; class auto_ptr&lt;void&gt;;</ins>
  </pre></blockquote>
  
--- 25516,25523 ----
  <p>
  In [lib.memory] change:
  </p>
! <blockquote><pre>
! template&lt;class X&gt; class auto_ptr;
  <ins>template&lt;&gt; class auto_ptr&lt;void&gt;;</ins>
  </pre></blockquote>
  
*************** In [lib.memory] change:
*** 25548,25554 ****
  In [lib.auto.ptr]/2 add the following before the last closing brace:
  </p>
  
! <blockquote><pre>template&lt;&gt; class auto_ptr&lt;void&gt;
  {
  public:
      typedef void element_type;
--- 25525,25532 ----
  In [lib.auto.ptr]/2 add the following before the last closing brace:
  </p>
  
! <blockquote><pre>
! template&lt;&gt; class auto_ptr&lt;void&gt;
  {
  public:
      typedef void element_type;
*************** public:
*** 25562,25571 ****
  
  <hr>
  <h3><a name="542"></a>542. shared_ptr observers</h3>
! <p><b>Section:</b> 20.9.10.2.5 [util.smartptr.shared.obs], TR1 2.2.3.5 [tr.util.smartptr.shared.obs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-10-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.obs">issues</a> in [util.smartptr.shared.obs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Peter Dimov wrote:
--- 25540,25549 ----
  
  <hr>
  <h3><a name="542"></a>542. shared_ptr observers</h3>
! <p><b>Section:</b> 20.8.2.2.5 [util.smartptr.shared.obs], TR1 2.2.3.5 [tr.util.smartptr.shared.obs] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2005-10-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.obs">issues</a> in [util.smartptr.shared.obs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Peter Dimov wrote:
*************** capture the intent.
*** 25602,25608 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.10.2.5 [util.smartptr.shared.obs] p12:
  </p>
  <blockquote><p>
  [<i>Note:</i> <tt>use_count()</tt> is not necessarily efficient. <del>Use only for
--- 25580,25586 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.2.2.5 [util.smartptr.shared.obs] p12:
  </p>
  <blockquote><p>
  [<i>Note:</i> <tt>use_count()</tt> is not necessarily efficient. <del>Use only for
*************** debugging and testing purposes, not for
*** 25610,25616 ****
  </p></blockquote>
  
  <p>
! Change 20.9.10.3.5 [util.smartptr.weak.obs] p3:
  </p>
  <blockquote><p>
  [<i>Note:</i> <tt>use_count()</tt> is not necessarily efficient. <del>Use only for
--- 25588,25594 ----
  </p></blockquote>
  
  <p>
! Change 20.8.2.3.5 [util.smartptr.weak.obs] p3:
  </p>
  <blockquote><p>
  [<i>Note:</i> <tt>use_count()</tt> is not necessarily efficient. <del>Use only for
*************** debugging and testing purposes, not for
*** 25623,25631 ****
  
  <hr>
  <h3><a name="543"></a>543. valarray slice default constructor</h3>
! <p><b>Section:</b> 26.6.4 [class.slice] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2005-11-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  If one explicitly constructs a slice or glice with the default
--- 25601,25609 ----
  
  <hr>
  <h3><a name="543"></a>543. valarray slice default constructor</h3>
! <p><b>Section:</b> 26.6.4 [class.slice] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2005-11-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  If one explicitly constructs a slice or glice with the default
*************** could be interpreted two ways:
*** 25640,25646 ****
  <p>
  Here is a bit of code to illustrate:
  </p>
! <blockquote><pre>#include &lt;iostream&gt;
  #include &lt;valarray&gt;
  
  int main()
--- 25618,25625 ----
  <p>
  Here is a bit of code to illustrate:
  </p>
! <blockquote><pre>
! #include &lt;iostream&gt;
  #include &lt;valarray&gt;
  
  int main()
*************** int main()
*** 25655,25661 ****
  Is the behavior undefined?  Or should the output be:
  </p>
  
! <blockquote><pre>v[slice()].size() = 0
  </pre></blockquote>
  
  <p>
--- 25634,25641 ----
  Is the behavior undefined?  Or should the output be:
  </p>
  
! <blockquote><pre>
! v[slice()].size() = 0
  </pre></blockquote>
  
  <p>
*************** There is a similar question and wording
*** 25665,25675 ****
  
  <p><b>Proposed resolution:</b></p>
  
! <p><i>[Martin suggests removing the second sentence in 26.6.4.1 [cons.slice] as well.]</i></p>
  
  
  <p>
! Change 26.6.4.1 [cons.slice]:
  </p>
  
  <blockquote><p>
--- 25645,25655 ----
  
  <p><b>Proposed resolution:</b></p>
  
! <p><i>[Martin suggests removing the second sentence in 26.6.4.2 [cons.slice] as well.]</i></p>
  
  
  <p>
! Change 26.6.4.2 [cons.slice]:
  </p>
  
  <blockquote><p>
*************** takes a start, length, and stride parame
*** 25681,25687 ****
  </p></blockquote>
  
  <p>
! Change 26.6.6.1 [gslice.cons]:
  </p>
  
  <blockquote><p>
--- 25661,25667 ----
  </p></blockquote>
  
  <p>
! Change 26.6.6.2 [gslice.cons]:
  </p>
  
  <blockquote><p>
*************** lengths, and strides, as explained in th
*** 25699,25708 ****
  
  <hr>
  <h3><a name="545"></a>545. When is a deleter deleted?</h3>
! <p><b>Section:</b> 20.9.10.2.11 [util.smartptr.getdeleter], TR1 2.2.3.2 [tr.util.smartptr.shared.dest] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.getdeleter">issues</a> in [util.smartptr.getdeleter].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The description of ~shared_ptr doesn't say when the shared_ptr's deleter, if
--- 25679,25688 ----
  
  <hr>
  <h3><a name="545"></a>545. When is a deleter deleted?</h3>
! <p><b>Section:</b> 20.8.2.2.10 [util.smartptr.getdeleter], TR1 2.2.3.2 [tr.util.smartptr.shared.dest] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2006-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.getdeleter">issues</a> in [util.smartptr.getdeleter].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The description of ~shared_ptr doesn't say when the shared_ptr's deleter, if
*************** instances). We should say which it is.
*** 25717,25723 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add after the first sentence of 20.9.10.2.11 [util.smartptr.getdeleter]/1:
  </p>
  <blockquote>
  <p>
--- 25697,25703 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add after the first sentence of 20.8.2.2.10 [util.smartptr.getdeleter]/1:
  </p>
  <blockquote>
  <p>
*************** This can happen if the implementation do
*** 25736,25746 ****
  
  
  <hr>
! <h3><a name="550"></a>550. What should the return type of pow(float,int) be?</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-01-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Assuming we adopt the
--- 25716,25727 ----
  
  
  <hr>
! <h3><a name="550"></a>550. What should the return type of <tt>pow(float,int)</tt> be?</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-01-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Assuming we adopt the
*************** Assuming we adopt the
*** 25748,25763 ****
  compatibility package from C99</a>  what should be the return type of the
  following signature be:
  </p>
! <blockquote><pre>?  pow(float, int);
  </pre></blockquote>
  <p>
  C++03 says that the return type should be <tt>float</tt>. 
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf">
! TR1</a> and C90/99 say the return type should be <tt>double</tt>.  This can put
  clients into a situation where C++03 provides answers that are not as high
! quality as C90/C99/TR1.  For example:
  </p>
! <blockquote><pre>#include &lt;math.h&gt;
  
  int main()
  {
--- 25729,25746 ----
  compatibility package from C99</a>  what should be the return type of the
  following signature be:
  </p>
! <blockquote><pre>
! ?  pow(float, int);
  </pre></blockquote>
  <p>
  C++03 says that the return type should be <tt>float</tt>. 
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf">
! TR1</a> and C90&#47;99 say the return type should be <tt>double</tt>.  This can put
  clients into a situation where C++03 provides answers that are not as high
! quality as C90&#47;C99&#47;TR1.  For example:
  </p>
! <blockquote><pre>
! #include &lt;math.h&gt;
  
  int main()
  {
*************** int main()
*** 25766,25782 ****
  }
  </pre></blockquote>
  <p>
! Assuming an IEEE 32 bit float and IEEE 64 bit double, C90/C99/TR1 all suggest:
  </p>
  
! <blockquote><pre>y = 4329326534736.390625
  </pre></blockquote>
  
  <p>
! which is exactly right.  While C++98/C++03 demands:
  </p>
  
! <blockquote><pre>y = 4329326510080.
  </pre></blockquote>
  
  <p>
--- 25749,25767 ----
  }
  </pre></blockquote>
  <p>
! Assuming an IEEE 32 bit float and IEEE 64 bit double, C90&#47;C99&#47;TR1 all suggest:
  </p>
  
! <blockquote><pre>
! y = 4329326534736.390625
  </pre></blockquote>
  
  <p>
! which is exactly right.  While C++98&#47;C++03 demands:
  </p>
  
! <blockquote><pre>
! y = 4329326510080.
  </pre></blockquote>
  
  <p>
*************** Fortran, C and TR1 and make the return t
*** 25792,25808 ****
  <p><i>[
  Kona (2007): Other functions that are affected by this issue include
  <tt>ldexp</tt>, <tt>scalbln</tt>, and <tt>scalbn</tt>. We also believe that there is a typo in
! 26.7/10: <tt>float nexttoward(float, long double);</tt> [sic] should be <tt>float
  nexttoward(float, float);</tt> Proposed Disposition: Review (the proposed
  resolution appears above, rather than below, the heading "Proposed
  resolution")
  ]</i></p>
  
  
! <p><i>[
! </i></p><p><i>
! Howard, post Kona:
! </i></p><i>
  <blockquote>
  <p>
  Unfortunately I strongly disagree with a part of the resolution
--- 25777,25791 ----
  <p><i>[
  Kona (2007): Other functions that are affected by this issue include
  <tt>ldexp</tt>, <tt>scalbln</tt>, and <tt>scalbn</tt>. We also believe that there is a typo in
! 26.7&#47;10: <tt>float nexttoward(float, long double);</tt> [sic] should be <tt>float
  nexttoward(float, float);</tt> Proposed Disposition: Review (the proposed
  resolution appears above, rather than below, the heading "Proposed
  resolution")
  ]</i></p>
  
  
! <p><i>[Howard, post Kona:]</i></p>
! 
  <blockquote>
  <p>
  Unfortunately I strongly disagree with a part of the resolution
*************** For similar reasons, I do not believe th
*** 25821,25827 ****
  correct signature is:
  </p>
  <blockquote>
! <pre>float nexttoward(float, long double);
  </pre>
  </blockquote>
  <p>
--- 25804,25811 ----
  correct signature is:
  </p>
  <blockquote>
! <pre>
! float nexttoward(float, long double);
  </pre>
  </blockquote>
  <p>
*************** route (with <tt>pow</tt> only) and C99 t
*** 25833,25853 ****
  The proposed resolution basically says: C++98 got it wrong and C99 got it right; let's go with C99.
  </p>
  </blockquote>
- ]</i><p></p>
- 
  
  <p><i>[
  Bellevue:
  ]</i></p>
  
  
! <blockquote>
  This signature was not picked up from C99. Instead, if one types
! pow(2.0f,2), the promotion rules will invoke "double pow(double,
  double)", which generally gives special treatment for integral
  exponents, preserving full accuracy of the result.  New proposed
  wording provided.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 25817,25835 ----
  The proposed resolution basically says: C++98 got it wrong and C99 got it right; let's go with C99.
  </p>
  </blockquote>
  
  <p><i>[
  Bellevue:
  ]</i></p>
  
  
! <blockquote><p>
  This signature was not picked up from C99. Instead, if one types
! <tt>pow(2.0f,2)</tt>, the promotion rules will invoke "double pow(double,
  double)", which generally gives special treatment for integral
  exponents, preserving full accuracy of the result.  New proposed
  wording provided.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Change 26.8 [c.math] p10:
*** 25859,25865 ****
  <p>
  The added signatures are:
  </p>
! <blockquote><pre>...
  <del>float pow(float, int);</del>
  ...
  <del>double pow(double, int);</del>
--- 25841,25848 ----
  <p>
  The added signatures are:
  </p>
! <blockquote><pre>
! ...
  <del>float pow(float, int);</del>
  ...
  <del>double pow(double, int);</del>
*************** The added signatures are:
*** 25875,25883 ****
  
  <hr>
  <h3><a name="551"></a>551. &lt;ccomplex&gt;</h3>
! <p><b>Section:</b> X [cmplxh], TR1 8.3 [tr.c99.cmplxh] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-01-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Previously xxx.h was parsable by C++.  But in the case of C99's &lt;complex.h&gt;
--- 25858,25866 ----
  
  <hr>
  <h3><a name="551"></a>551. &lt;ccomplex&gt;</h3>
! <p><b>Section:</b> X [cmplxh], TR1 8.3 [tr.c99.cmplxh] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-01-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Previously xxx.h was parsable by C++.  But in the case of C99's &lt;complex.h&gt;
*************** note</i>]</ins>
*** 25936,25945 ****
  
  <hr>
  <h3><a name="552"></a>552. random_shuffle and its generator</h3>
! <p><b>Section:</b> 25.3.12 [alg.random.shuffle] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-01-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.random.shuffle">issues</a> in [alg.random.shuffle].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  ...is specified to shuffle its range by calling swap but not how
--- 25919,25928 ----
  
  <hr>
  <h3><a name="552"></a>552. random_shuffle and its generator</h3>
! <p><b>Section:</b> 25.3.12 [alg.random.shuffle] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-01-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.random.shuffle">issues</a> in [alg.random.shuffle].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  ...is specified to shuffle its range by calling swap but not how
*************** The LWG voted to accelerate this issue t
*** 25977,25987 ****
  
  
  <hr>
! <h3><a name="556"></a>556. is Compare a BinaryPredicate?</h3>
! <p><b>Section:</b> 25.4 [alg.sorting] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.sorting">issues</a> in [alg.sorting].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 25, p8 we allow BinaryPredicates to return a type that's convertible
--- 25960,25970 ----
  
  
  <hr>
! <h3><a name="556"></a>556. Is <tt>Compare</tt> a <tt>BinaryPredicate</tt>?</h3>
! <p><b>Section:</b> 25.4 [alg.sorting] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.sorting">issues</a> in [alg.sorting].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 25, p8 we allow BinaryPredicates to return a type that's convertible
*************** destroyed.
*** 26027,26054 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Review once wording received. Stefanus to send proposed wording.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Review once wording received. Stefanus to send proposed wording.
! </blockquote>
  
  <p><i>[
  2009-10-24 Stefanus supplied wording.
  ]</i></p>
  
  
! <blockquote>
  Move to Review once wording received. Stefanus to send proposed wording.
  Old proposed wording here:
! <blockquote>
  <p>
  I think we could fix this by rewording 25.3, p2 to read somthing like:
  </p>
--- 26010,26037 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Review once wording received. Stefanus to send proposed wording.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Review once wording received. Stefanus to send proposed wording.
! </p></blockquote>
  
  <p><i>[
  2009-10-24 Stefanus supplied wording.
  ]</i></p>
  
  
! <blockquote><p>
  Move to Review once wording received. Stefanus to send proposed wording.
  Old proposed wording here:
! </p><blockquote>
  <p>
  I think we could fix this by rewording 25.3, p2 to read somthing like:
  </p>
*************** Howard expresses concern that the curren
*** 26076,26082 ****
  wording outlaws expressions such as:
  </p>
  
! <blockquote><pre>if (!comp(x, y))
  </pre></blockquote>
  
  <p>
--- 26059,26066 ----
  wording outlaws expressions such as:
  </p>
  
! <blockquote><pre>
! if (!comp(x, y))
  </pre></blockquote>
  
  <p>
*************** The previous wording is saved here:
*** 26092,26098 ****
  <p>
  Change 25.4 [alg.sorting] p2:
  </p>
! <blockquote>
  <tt>Compare</tt> is used as a function object<ins>. The return value of
  the function call operator applied to an object of type Compare, when
  converted to type bool, yields true if the first argument of the
--- 26076,26082 ----
  <p>
  Change 25.4 [alg.sorting] p2:
  </p>
! <blockquote><p>
  <tt>Compare</tt> is used as a function object<ins>. The return value of
  the function call operator applied to an object of type Compare, when
  converted to type bool, yields true if the first argument of the
*************** is less than the second, and <tt>false</
*** 26101,26107 ****
  comp</tt> is used throughout for algorithms assuming an ordering
  relation. It is assumed that <tt>comp</tt> will not apply any
  non-constant function through the dereferenced iterator.
! </blockquote>
  
  </blockquote>
  
--- 26085,26091 ----
  comp</tt> is used throughout for algorithms assuming an ordering
  relation. It is assumed that <tt>comp</tt> will not apply any
  non-constant function through the dereferenced iterator.
! </p></blockquote>
  
  </blockquote>
  
*************** non-constant function through the derefe
*** 26162,26169 ****
  Change 25.4 [alg.sorting]/2 as indicated:
  </p>
  
! <blockquote>
! 2 <tt>Compare</tt> is <del>used as</del> a function object <ins>type (20.8 [function.objects]). The return value of the function call operation
  applied to an object of type <tt>Compare</tt>, when contextually converted to
  type <tt>bool</tt> (4 [conv]), yields <tt>true</tt> if the first
  argument of the call</ins><del> which returns <tt>true</tt> if the first
--- 26146,26153 ----
  Change 25.4 [alg.sorting]/2 as indicated:
  </p>
  
! <blockquote><p>
! 2 <tt>Compare</tt> is <del>used as</del> a function object <ins>type (20.9 [function.objects]). The return value of the function call operation
  applied to an object of type <tt>Compare</tt>, when contextually converted to
  type <tt>bool</tt> (4 [conv]), yields <tt>true</tt> if the first
  argument of the call</ins><del> which returns <tt>true</tt> if the first
*************** argument</del> is less than the second,
*** 26171,26177 ****
  <tt>Compare comp</tt> is used throughout for algorithms assuming an ordering
  relation. It is assumed that <tt>comp</tt> will not apply any non-constant
  function through the dereferenced iterator.
! </blockquote>
  </li>
  
  </ol>
--- 26155,26161 ----
  <tt>Compare comp</tt> is used throughout for algorithms assuming an ordering
  relation. It is assumed that <tt>comp</tt> will not apply any non-constant
  function through the dereferenced iterator.
! </p></blockquote>
  </li>
  
  </ol>
*************** function through the dereferenced iterat
*** 26183,26196 ****
  
  <hr>
  <h3><a name="559"></a>559. numeric_limits&lt;const T&gt;</h3>
! <p><b>Section:</b> 18.3.1 [limits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#limits">issues</a> in [limits].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
! 18.3.1 [limits], p2 requires implementations  to provide specializations of the
  <code>numeric_limits</code> template for  each scalar type. While this
  could be interepreted to include cv-qualified forms of such types such
  an  interepretation   is  not  reflected   in  the  synopsis   of  the
--- 26167,26180 ----
  
  <hr>
  <h3><a name="559"></a>559. numeric_limits&lt;const T&gt;</h3>
! <p><b>Section:</b> 18.3.2 [limits] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#limits">issues</a> in [limits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
! 18.3.2 [limits], p2 requires implementations  to provide specializations of the
  <code>numeric_limits</code> template for  each scalar type. While this
  could be interepreted to include cv-qualified forms of such types such
  an  interepretation   is  not  reflected   in  the  synopsis   of  the
*************** following:
*** 26225,26230 ****
--- 26209,26215 ----
  </p>
  
  <pre>
+ 
  template &lt;class T&gt; class numeric_limits&lt;const T&gt;;
  template &lt;class T&gt; class numeric_limits&lt;volatile T&gt;;
  template &lt;class T&gt; class numeric_limits&lt;const volatile T&gt;;
*************** template &lt;class T&gt; class numeric_l
*** 26233,26239 ****
  
          <p>
  
! Add  a new paragraph  to the  end of  18.3.1.1 [numeric.limits], with  the following
  text:
  
          </p>
--- 26218,26224 ----
  
          <p>
  
! Add  a new paragraph  to the  end of  18.3.2.3 [numeric.limits], with  the following
  text:
  
          </p>
*************** automatically.
*** 26258,26272 ****
  
  <hr>
  <h3><a name="561"></a>561. inserter overly generic</h3>
! <p><b>Section:</b> 24.5.2.6.5 [inserter] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-02-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The declaration of <tt>std::inserter</tt> is:
  </p>
  
! <blockquote><pre>template &lt;class Container, class Iterator&gt;
  insert_iterator&lt;Container&gt;
  inserter(Container&amp; x, Iterator i);
  </pre></blockquote>
--- 26243,26258 ----
  
  <hr>
  <h3><a name="561"></a>561. inserter overly generic</h3>
! <p><b>Section:</b> 24.5.2.6.5 [inserter] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2006-02-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The declaration of <tt>std::inserter</tt> is:
  </p>
  
! <blockquote><pre>
! template &lt;class Container, class Iterator&gt;
  insert_iterator&lt;Container&gt;
  inserter(Container&amp; x, Iterator i);
  </pre></blockquote>
*************** one has in a signature, the opportunity
*** 26284,26290 ****
  It would be much better if <tt>inserter</tt> had the following signature instead:
  </p>
  
! <blockquote><pre>template &lt;class Container&gt;
  insert_iterator&lt;Container&gt;
  inserter(Container&amp; x, typename Container::iterator i);
  </pre></blockquote>
--- 26270,26277 ----
  It would be much better if <tt>inserter</tt> had the following signature instead:
  </p>
  
! <blockquote><pre>
! template &lt;class Container&gt;
  insert_iterator&lt;Container&gt;
  inserter(Container&amp; x, typename Container::iterator i);
  </pre></blockquote>
*************** types need not be anything closely relat
*** 26304,26310 ****
  This can adversely impact well written code.  Consider:
  </p>
  
! <blockquote><pre>#include &lt;iterator&gt;
  #include &lt;string&gt;
  
  namespace my
--- 26291,26298 ----
  This can adversely impact well written code.  Consider:
  </p>
  
! <blockquote><pre>
! #include &lt;iterator&gt;
  #include &lt;string&gt;
  
  namespace my
*************** To make matters a little more insidious,
*** 26345,26351 ****
  simply change the first argument to an rvalue:
  </p>
  
! <blockquote><pre>    inserter(my::my_type(), c);
  </pre></blockquote>
  
  <p>
--- 26333,26340 ----
  simply change the first argument to an rvalue:
  </p>
  
! <blockquote><pre>
!     inserter(my::my_type(), c);
  </pre></blockquote>
  
  <p>
*************** Change 24.2:
*** 26374,26380 ****
  <blockquote><p>
  <b>24.2 Header</b> <tt>&lt;iterator&gt;</tt> <b>synopsis</b>
  </p>
! <blockquote><pre>...
  template &lt;class Container<del>, class Iterator</del>&gt;
     insert_iterator&lt;Container&gt; inserter(Container&amp; x, <del>Iterator</del> <ins>typename Container::iterator</ins> i);
  ...
--- 26363,26370 ----
  <blockquote><p>
  <b>24.2 Header</b> <tt>&lt;iterator&gt;</tt> <b>synopsis</b>
  </p>
! <blockquote><pre>
! ...
  template &lt;class Container<del>, class Iterator</del>&gt;
     insert_iterator&lt;Container&gt; inserter(Container&amp; x, <del>Iterator</del> <ins>typename Container::iterator</ins> i);
  ...
*************** Change 24.4.2.5:
*** 26387,26393 ****
  
  <blockquote><p>
  <b>24.4.2.5 Class template</b> <tt>insert_iterator</tt></p>
! <blockquote><pre>...
  template &lt;class Container<del>, class Iterator</del>&gt;
     insert_iterator&lt;Container&gt; inserter(Container&amp; x, <del>Iterator</del> <ins>typename Container::iterator</ins> i);
  ...
--- 26377,26384 ----
  
  <blockquote><p>
  <b>24.4.2.5 Class template</b> <tt>insert_iterator</tt></p>
! <blockquote><pre>
! ...
  template &lt;class Container<del>, class Iterator</del>&gt;
     insert_iterator&lt;Container&gt; inserter(Container&amp; x, <del>Iterator</del> <ins>typename Container::iterator</ins> i);
  ...
*************** Change 24.4.2.6.5:
*** 26402,26408 ****
  <p>
  <b>24.4.2.6.5</b> <tt>inserter</tt>
  </p>
! <pre>template &lt;class Container<del>, class Inserter</del>&gt;
     insert_iterator&lt;Container&gt; inserter(Container&amp; x, <del>Inserter</del> <ins>typename Container::iterator</ins> i);
  </pre>
  <blockquote><p>
--- 26393,26400 ----
  <p>
  <b>24.4.2.6.5</b> <tt>inserter</tt>
  </p>
! <pre>
! template &lt;class Container<del>, class Inserter</del>&gt;
     insert_iterator&lt;Container&gt; inserter(Container&amp; x, <del>Inserter</del> <ins>typename Container::iterator</ins> i);
  </pre>
  <blockquote><p>
*************** Proposed Disposition: Ready
*** 26423,26432 ****
  
  <hr>
  <h3><a name="562"></a>562. stringbuf ctor inefficient</h3>
! <p><b>Section:</b> 27.8 [string.streams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.streams">issues</a> in [string.streams].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 26415,26424 ----
  
  <hr>
  <h3><a name="562"></a>562. stringbuf ctor inefficient</h3>
! <p><b>Section:</b> 27.8 [string.streams] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.streams">issues</a> in [string.streams].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** Change 27.7.1.1, p3 of the Working Draft
*** 26449,26455 ****
  
          </p>
  
! <blockquote><pre>explicit basic_stringbuf(const basic_string&lt;charT,traits,Allocator&gt;&amp; <i>s<del>tr</del></i>,
                 ios_base::openmode <i>which</i> = ios_base::in | ios_base::out);
  </pre>
  
--- 26441,26448 ----
  
          </p>
  
! <blockquote><pre>
! explicit basic_stringbuf(const basic_string&lt;charT,traits,Allocator&gt;&amp; <i>s<del>tr</del></i>,
                 ios_base::openmode <i>which</i> = ios_base::in | ios_base::out);
  </pre>
  
*************** Kona (2007) Moved to Ready.
*** 26518,26527 ****
  
  <hr>
  <h3><a name="563"></a>563. stringbuf seeking from end</h3>
! <p><b>Section:</b> 27.8.1.4 [stringbuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to  Table 92  (unchanged by issue  432), when  <code>(way ==
--- 26511,26520 ----
  
  <hr>
  <h3><a name="563"></a>563. stringbuf seeking from end</h3>
! <p><b>Section:</b> 27.8.2.4 [stringbuf.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to  Table 92  (unchanged by issue  432), when  <code>(way ==
*************** Kona (2007) Moved to Ready.
*** 26575,26585 ****
  
  
  <hr>
! <h3><a name="564"></a>564. stringbuf seekpos underspecified</h3>
! <p><b>Section:</b> 27.8.1.4 [stringbuf.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The   effects  of  the   <code>seekpos()</code>  member   function  of
--- 26568,26578 ----
  
  
  <hr>
! <h3><a name="564"></a>564. <tt>stringbuf</tt> seekpos underspecified</h3>
! <p><b>Section:</b> 27.8.2.4 [stringbuf.virtuals] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#stringbuf.virtuals">issues</a> in [stringbuf.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The   effects  of  the   <code>seekpos()</code>  member   function  of
*************** is described.
*** 26594,26602 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 26587,26595 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** plugs the hole by specifying <tt>seekpos
*** 26647,26656 ****
  
  
  <hr>
! <h3><a name="565"></a>565. xsputn inefficient</h3>
! <p><b>Section:</b> 27.6.2.4.5 [streambuf.virt.put] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 26640,26649 ----
  
  
  <hr>
! <h3><a name="565"></a>565. <tt>xsputn</tt> inefficient</h3>
! <p><b>Section:</b> 27.6.3.4.5 [streambuf.virt.put] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** required to cause a call to <tt>overflow
*** 26683,26691 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 26676,26684 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** proposed wording doesn't accomplish that
*** 26730,26739 ****
  
  <hr>
  <h3><a name="566"></a>566. array forms of unformatted input function undefined for zero-element arrays</h3>
! <p><b>Section:</b> 27.7.1.3 [istream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 26723,26733 ----
  
  <hr>
  <h3><a name="566"></a>566. array forms of unformatted input function undefined for zero-element arrays</h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** location of the array.
*** 26802,26811 ****
  
  <hr>
  <h3><a name="567"></a>567. streambuf inserter and extractor should be unformatted</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 26796,26805 ----
  
  <hr>
  <h3><a name="567"></a>567. streambuf inserter and extractor should be unformatted</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-02-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** Kona (2007): Proposed Disposition: Ready
*** 26869,26885 ****
  
  <hr>
  <h3><a name="574"></a>574. DR 369 Contradicts Text</h3>
! <p><b>Section:</b> 27.4 [iostream.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2006-04-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.objects">issues</a> in [iostream.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  lib.iostream.objects requires that the standard stream objects are never
  destroyed, and it requires that they be destroyed.
  </p>
  <p>
! DR 369 adds words to say that we really mean for ios_base::Init objects to force
  construction of standard stream objects. It ends, though, with the phrase "these
  stream objects shall be destroyed after the destruction of dynamically ...".
  However, the rule for destruction is stated in the standard: "The objects are
--- 26863,26879 ----
  
  <hr>
  <h3><a name="574"></a>574. DR 369 Contradicts Text</h3>
! <p><b>Section:</b> 27.4 [iostream.objects] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2006-04-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.objects">issues</a> in [iostream.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  lib.iostream.objects requires that the standard stream objects are never
  destroyed, and it requires that they be destroyed.
  </p>
  <p>
! DR 369 adds words to say that we really mean for <tt>ios_base::Init</tt> objects to force
  construction of standard stream objects. It ends, though, with the phrase "these
  stream objects shall be destroyed after the destruction of dynamically ...".
  However, the rule for destruction is stated in the standard: "The objects are
*************** Change 27.4 [iostream.objects]/1:
*** 26898,26904 ****
  some time prior to or during the first time an object of class
  <tt>ios_base::Init</tt> is constructed, and in any case before the body of main
  begins execution.<sup>290)</sup> The objects are not destroyed during program
! execution.<sup>291)</sup> If a translation unit includes <tt>&lt;iostream&amp;t;</tt> or explicitly
  constructs an <tt>ios_base::Init</tt> object, these stream objects shall be
  constructed before dynamic initialization of non-local objects defined
  later in that translation unit<del>, and these stream objects shall be
--- 26892,26898 ----
  some time prior to or during the first time an object of class
  <tt>ios_base::Init</tt> is constructed, and in any case before the body of main
  begins execution.<sup>290)</sup> The objects are not destroyed during program
! execution.<sup>291)</sup> If a translation unit includes <tt>&lt;iostream&gt;</tt> or explicitly
  constructs an <tt>ios_base::Init</tt> object, these stream objects shall be
  constructed before dynamic initialization of non-local objects defined
  later in that translation unit<del>, and these stream objects shall be
*************** Disposition: Review
*** 26921,26930 ****
  
  <hr>
  <h3><a name="575"></a>575. the specification of ~shared_ptr is MT-unfriendly, makes implementation assumptions</h3>
! <p><b>Section:</b> 20.9.10.2.2 [util.smartptr.shared.dest], TR1 2.2.3.2 [tr.util.smartptr.shared.dest] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2006-04-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.dest">issues</a> in [util.smartptr.shared.dest].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  [tr.util.smartptr.shared.dest] says in its second bullet:
--- 26915,26924 ----
  
  <hr>
  <h3><a name="575"></a>575. the specification of ~shared_ptr is MT-unfriendly, makes implementation assumptions</h3>
! <p><b>Section:</b> 20.8.2.2.2 [util.smartptr.shared.dest], TR1 2.2.3.2 [tr.util.smartptr.shared.dest] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2006-04-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.dest">issues</a> in [util.smartptr.shared.dest].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  [tr.util.smartptr.shared.dest] says in its second bullet:
*************** of shared_ptr's state, this would lead t
*** 26961,26967 ****
  multiple threads. For example,
  </p>
  
! <blockquote><pre>p1 = p2;
  </pre></blockquote>
  
  <p>
--- 26955,26962 ----
  multiple threads. For example,
  </p>
  
! <blockquote><pre>
! p1 = p2;
  </pre></blockquote>
  
  <p>
*************** after <tt>*this</tt> is destroyed. <i>--
*** 27000,27016 ****
  
  <hr>
  <h3><a name="576"></a>576. find_first_of is overconstrained</h3>
! <p><b>Section:</b> 25.2.7 [alg.find.first.of] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2006-04-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.find.first.of">issues</a> in [alg.find.first.of].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 25.1.4 Find First [lib.alg.find.first], the two iterator type parameters to
  find_first_of are specified to require Forward Iterators, as follows:
  </p>
  
! <blockquote><pre>template&lt;class ForwardIterator1, class ForwardIterator2&gt;
    ForwardIterator1
    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
                          ForwardIterator2 first2, ForwardIterator2 last2);
--- 26995,27012 ----
  
  <hr>
  <h3><a name="576"></a>576. find_first_of is overconstrained</h3>
! <p><b>Section:</b> 25.2.7 [alg.find.first.of] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2006-04-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.find.first.of">issues</a> in [alg.find.first.of].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 25.1.4 Find First [lib.alg.find.first], the two iterator type parameters to
  find_first_of are specified to require Forward Iterators, as follows:
  </p>
  
! <blockquote><pre>
! template&lt;class ForwardIterator1, class ForwardIterator2&gt;
    ForwardIterator1
    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
                          ForwardIterator2 first2, ForwardIterator2 last2);
*************** Iterator or a true reference.
*** 27034,27040 ****
  Change the declarations of <tt>find_first_of</tt> to:
  </p>
  
! <blockquote><pre>template&lt;class <del>ForwardIterator1</del><ins>InputIterator1</ins>, class ForwardIterator2&gt;
    <del>ForwardIterator1</del><ins>InputIterator1</ins>
    find_first_of(<del>ForwardIterator1</del><ins>InputIterator1</ins> first1, <del>ForwardIterator1</del><ins>InputIterator1</ins> last1,
                          ForwardIterator2 first2, ForwardIterator2 last2);
--- 27030,27037 ----
  Change the declarations of <tt>find_first_of</tt> to:
  </p>
  
! <blockquote><pre>
! template&lt;class <del>ForwardIterator1</del><ins>InputIterator1</ins>, class ForwardIterator2&gt;
    <del>ForwardIterator1</del><ins>InputIterator1</ins>
    find_first_of(<del>ForwardIterator1</del><ins>InputIterator1</ins> first1, <del>ForwardIterator1</del><ins>InputIterator1</ins> last1,
                          ForwardIterator2 first2, ForwardIterator2 last2);
*************** template&lt;class <del>ForwardIterator1<
*** 27053,27061 ****
  
  <hr>
  <h3><a name="577"></a>577. upper_bound(first, last, ...) cannot return last</h3>
! <p><b>Section:</b> 25.4.3.2 [upper.bound] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Seungbeom Kim <b>Opened:</b> 2006-05-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  ISO/IEC 14882:2003 says:
--- 27050,27058 ----
  
  <hr>
  <h3><a name="577"></a>577. upper_bound(first, last, ...) cannot return last</h3>
! <p><b>Section:</b> 25.4.3.2 [upper.bound] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Seungbeom Kim <b>Opened:</b> 2006-05-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  ISO/IEC 14882:2003 says:
*************** conditions hold: <tt>!(value &lt; *j)</t
*** 27103,27112 ****
  
  <hr>
  <h3><a name="578"></a>578. purpose of hint to allocator::allocate()</h3>
! <p><b>Section:</b> 20.9.5.1 [allocator.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-05-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 27100,27109 ----
  
  <hr>
  <h3><a name="578"></a>578. purpose of hint to allocator::allocate()</h3>
! <p><b>Section:</b> 20.7.9.1 [allocator.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** adjacent element is often a good choice
*** 27162,27171 ****
  
  <hr>
  <h3><a name="581"></a>581. <code>flush()</code> not unformatted function</h3>
! <p><b>Section:</b> 27.7.2.7 [ostream.unformatted] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream.unformatted">issues</a> in [ostream.unformatted].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 27159,27168 ----
  
  <hr>
  <h3><a name="581"></a>581. <code>flush()</code> not unformatted function</h3>
! <p><b>Section:</b> 27.7.3.7 [ostream.unformatted] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream.unformatted">issues</a> in [ostream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** That has at least two in my opinion prob
*** 27176,27182 ****
          </p>
          <p>
  
! First, <code>flush()</code>  now calls <code>rdbuf()-&gt;pubsync()</code>
  unconditionally, without  regard to the  state of the stream.  I can't
  think of any reason why <code>flush()</code> should behave differently
  from the vast majority of stream functions in this respect.
--- 27173,27179 ----
          </p>
          <p>
  
! First, <code>flush()</code>  now calls <code>rdbuf()->pubsync()</code>
  unconditionally, without  regard to the  state of the stream.  I can't
  think of any reason why <code>flush()</code> should behave differently
  from the vast majority of stream functions in this respect.
*************** Effects: <ins>Behaves as an  unformatted
*** 27206,27212 ****
  in 27.6.2.6, paragraph 1). </ins>If <code>rdbuf()</code> is not a null
  pointer,  <ins>constructs a  sentry  object.  If  this object  returns
  <code>true</code> when converted to a  value of type bool the function
! </ins>calls <code>rdbuf()-&gt;pubsync()</code>.  If that function returns
  -1    calls    <code>setstate(badbit)</code>    (which    may    throw
  <code>ios_base::failure</code>  (27.4.4.3)).   <ins>Otherwise, if  the
  sentry object returns <code>false</code>, does nothing.</ins><del>Does
--- 27203,27209 ----
  in 27.6.2.6, paragraph 1). </ins>If <code>rdbuf()</code> is not a null
  pointer,  <ins>constructs a  sentry  object.  If  this object  returns
  <code>true</code> when converted to a  value of type bool the function
! </ins>calls <code>rdbuf()->pubsync()</code>.  If that function returns
  -1    calls    <code>setstate(badbit)</code>    (which    may    throw
  <code>ios_base::failure</code>  (27.4.4.3)).   <ins>Otherwise, if  the
  sentry object returns <code>false</code>, does nothing.</ins><del>Does
*************** Kona (2007): Proposed Disposition: Ready
*** 27226,27235 ****
  
  <hr>
  <h3><a name="586"></a>586. string inserter not a formatted function</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 27223,27232 ----
  
  <hr>
  <h3><a name="586"></a>586. string inserter not a formatted function</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-06-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** traits&gt;::sentry   k   (os)</code>.
*** 27285,27291 ****
  this  object returns <code>true</code>  when converted  to a  value of
  type   <code>bool</code>,   determines   padding   as   described   in
  22.2.2.2.2</ins>,  then inserts the  resulting sequence  of characters
! <code><i>seq</i></code> as if by calling <code>os.rdbuf()-&gt;sputn(seq ,
  n)</code>,    where   <code><i>n</i></code>    is   the    larger   of
  <code>os.width()</code>   and   <code>str.size()</code>;  then   calls
  <code>os.width(0)</code>.  <del>If  the  call  to sputn  fails,  calls
--- 27282,27288 ----
  this  object returns <code>true</code>  when converted  to a  value of
  type   <code>bool</code>,   determines   padding   as   described   in
  22.2.2.2.2</ins>,  then inserts the  resulting sequence  of characters
! <code><i>seq</i></code> as if by calling <code>os.rdbuf()->sputn(seq ,
  n)</code>,    where   <code><i>n</i></code>    is   the    larger   of
  <code>os.width()</code>   and   <code>str.size()</code>;  then   calls
  <code>os.width(0)</code>.  <del>If  the  call  to sputn  fails,  calls
*************** indicates a failure.
*** 27309,27319 ****
  
  <hr>
  <h3><a name="589"></a>589. Requirements on iterators of member template functions of containers</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2006-08-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#536">536</a></p>
  <p><b>Discussion:</b></p>
  <p>
  There appears to be no requirements on the InputIterators used in sequences in 23.1.1 in
--- 27306,27317 ----
  
  <hr>
  <h3><a name="589"></a>589. Requirements on iterators of member template functions of containers</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2006-08-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#536">536</a></p>
  <p><b>Discussion:</b></p>
  <p>
  There appears to be no requirements on the InputIterators used in sequences in 23.1.1 in
*************** easy to fix this up as a safety net and
*** 27369,27378 ****
  
  <hr>
  <h3><a name="593"></a>593. __STDC_CONSTANT_MACROS</h3>
! <p><b>Section:</b> 18.4 [cstdint], TR1 8.22 [tr.c99.cstdint] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2006-08-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#cstdint">issues</a> in [cstdint].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Clause 18.3 of the current Working Paper (N2009) deals with the new C++ headers
--- 27367,27376 ----
  
  <hr>
  <h3><a name="593"></a>593. __STDC_CONSTANT_MACROS</h3>
! <p><b>Section:</b> 18.4 [cstdint], TR1 8.22 [tr.c99.cstdint] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2006-08-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#cstdint">issues</a> in [cstdint].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Clause 18.3 of the current Working Paper (N2009) deals with the new C++ headers
*************** particular, the symbols __STDC_LIMIT_MAC
*** 27411,27430 ****
  
  
  <hr>
! <h3><a name="594"></a>594. Disadvantages of defining Swappable in terms of CopyConstructible and Assignable</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2006-11-02 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! It seems undesirable to define the Swappable requirement in terms of
! CopyConstructible and Assignable requirements. And likewise, once the
! MoveConstructible and MoveAssignable requirements (N1860) have made it
! into the Working Draft, it seems undesirable to define the Swappable
  requirement in terms of those requirements. Instead, it appears
! preferable to have the Swappable requirement defined exclusively in
  terms of the existence of an appropriate swap function.
  </p>
  
--- 27409,27428 ----
  
  
  <hr>
! <h3><a name="594"></a>594. Disadvantages of defining <tt>Swappable</tt> in terms of <tt>CopyConstructible</tt> and <tt>Assignable</tt></h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2006-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! It seems undesirable to define the <tt>Swappable</tt> requirement in terms of
! <tt>CopyConstructible</tt> and <tt>Assignable</tt> requirements. And likewise, once the
! <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt> requirements (N1860) have made it
! into the Working Draft, it seems undesirable to define the <tt>Swappable</tt>
  requirement in terms of those requirements. Instead, it appears
! preferable to have the <tt>Swappable</tt> requirement defined exclusively in
  terms of the existence of an appropriate swap function.
  </p>
  
*************** that the following code fragment will co
*** 27513,27519 ****
  type T, if and only if T is Swappable:
  </p>
  
! <pre>   using std::swap;
     swap(t, u);  // t and u are of type T.
  </pre>
  
--- 27511,27518 ----
  type T, if and only if T is Swappable:
  </p>
  
! <pre>
!    using std::swap;
     swap(t, u);  // t and u are of type T.
  </pre>
  
*************** San Francisco:
*** 27534,27561 ****
  ]</i></p>
  
  
! <blockquote>
! Recommend NAD.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2774.pdf">N2774</a>.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Moved to Open.  Waiting for non-concepts draft.
! </blockquote>
  
  <p><i>[
  2009-11-08 Howard adds:
  ]</i></p>
  
  
! <blockquote>
! This issue is very closely related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>.
! </blockquote>
  
  <p><i>[
  2010-02-03 Sean Hunt adds:
--- 27533,27560 ----
  ]</i></p>
  
  
! <blockquote><p>
! Recommend <del>NAD</del><ins>Resolved</ins>.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2774.pdf">N2774</a>.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Open.  Waiting for non-concepts draft.
! </p></blockquote>
  
  <p><i>[
  2009-11-08 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
! This issue is very closely related to <a href="lwg-defects.html#742">742</a>.
! </p></blockquote>
  
  <p><i>[
  2010-02-03 Sean Hunt adds:
*************** limiting the non-ADL overload set to std
*** 27585,27593 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD Editorial.  Rationale added.
! </blockquote>
  
  
  
--- 27584,27592 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD Editorial.  Rationale added.
! </p></blockquote>
  
  
  
*************** within the namespace std, and has the se
*** 27628,27644 ****
  
  
  <hr>
! <h3><a name="595"></a>595. TR1/C++0x: fabs(complex&lt;T&gt;) redundant / wrongly specified</h3>
! <p><b>Section:</b> 26.4.7 [complex.value.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stefan Große Pawig <b>Opened:</b> 2006-09-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.value.ops">issues</a> in [complex.value.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  TR1 introduced, in the C compatibility chapter, the function
! fabs(complex&lt;T&gt;):
  </p>
! <blockquote><pre>----- SNIP -----
  8.1.1 Synopsis                                [tr.c99.cmplx.syn]
  
    namespace std {
--- 27627,27644 ----
  
  
  <hr>
! <h3><a name="595"></a>595. TR1&#47;C++0x: <tt>fabs(complex&lt;T&gt;)</tt> redundant &#47; wrongly specified</h3>
! <p><b>Section:</b> 26.4.7 [complex.value.ops] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stefan Gro&szlig;e Pawig <b>Opened:</b> 2006-09-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.value.ops">issues</a> in [complex.value.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  TR1 introduced, in the C compatibility chapter, the function
! <tt>fabs(complex&lt;T&gt;)</tt>:
  </p>
! <blockquote><pre>
! ----- SNIP -----
  8.1.1 Synopsis                                [tr.c99.cmplx.syn]
  
    namespace std {
*************** But in C99 (ISO/IEC 9899:1999 as well as
*** 27667,27673 ****
  n1124), the referenced subclause reads
  </p>
  
! <blockquote><pre>----- SNIP -----
  7.3.8.1 The cabs functions
  
    Synopsis
--- 27667,27674 ----
  n1124), the referenced subclause reads
  </p>
  
! <blockquote><pre>
! ----- SNIP -----
  7.3.8.1 The cabs functions
  
    Synopsis
*************** document n2009.pdf).
*** 27699,27707 ****
  So either the return value of fabs() is specified wrongly, or fabs()
  does not behave the same as C99's cabs*().
  </p>
! 
  <b>Possible Resolutions</b>
! 
  <p>
  This depends on the intention behind the introduction of fabs().
  </p>
--- 27700,27708 ----
  So either the return value of fabs() is specified wrongly, or fabs()
  does not behave the same as C99's cabs*().
  </p>
! <p>
  <b>Possible Resolutions</b>
! </p>
  <p>
  This depends on the intention behind the introduction of fabs().
  </p>
*************** is really needed, since complex&lt;T&gt;
*** 27718,27731 ****
  assignment from real valued arguments.  There is no difference
  in observable behaviour between
  </p>
! <blockquote><pre>  complex&lt;double&gt; x, y;
    y = fabs(x);
    complex&lt;double&gt; z(fabs(x));
  </pre></blockquote>
  <p>
  and
  </p>
! <blockquote><pre>  complex&lt;double&gt; x, y;
    y = abs(x);
    complex&lt;double&gt; z(abs(x));
  </pre></blockquote>
--- 27719,27734 ----
  assignment from real valued arguments.  There is no difference
  in observable behaviour between
  </p>
! <blockquote><pre>
!   complex&lt;double&gt; x, y;
    y = fabs(x);
    complex&lt;double&gt; z(fabs(x));
  </pre></blockquote>
  <p>
  and
  </p>
! <blockquote><pre>
!   complex&lt;double&gt; x, y;
    y = abs(x);
    complex&lt;double&gt; z(abs(x));
  </pre></blockquote>
*************** Bellevue:
*** 27741,27749 ****
  ]</i></p>
  
  
! <blockquote>
! Bill believes that abs() is a suitable overload. We should remove fabs().
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 27744,27752 ----
  ]</i></p>
  
  
! <blockquote><p>
! Bill believes that <tt>abs()</tt> is a suitable overload. We should remove <tt>fabs()</tt>.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Bill believes that abs() is a suitable o
*** 27752,27758 ****
  Change the synopsis in 26.4.1 [complex.syn]:
  </p>
  
! <blockquote><pre><del>template&lt;class T&gt; complex&lt;T&gt; fabs(const complex&lt;T&gt;&amp;);</del>
  </pre></blockquote>
  
  <p>
--- 27755,27762 ----
  Change the synopsis in 26.4.1 [complex.syn]:
  </p>
  
! <blockquote><pre>
! <del>template&lt;class T&gt; complex&lt;T&gt; fabs(const complex&lt;T&gt;&amp;);</del>
  </pre></blockquote>
  
  <p>
*************** Remove 26.4.7 [complex.value.ops], p7:
*** 27760,27766 ****
  </p>
  
  <blockquote>
! <pre><del>template&lt;class T&gt; complex&lt;T&gt; fabs(const complex&lt;T&gt;&amp; <i>x</i>);</del>
  </pre>
  <blockquote>
  <p>
--- 27764,27771 ----
  </p>
  
  <blockquote>
! <pre>
! <del>template&lt;class T&gt; complex&lt;T&gt; fabs(const complex&lt;T&gt;&amp; <i>x</i>);</del>
  </pre>
  <blockquote>
  <p>
*************** Proposed Disposition: Ready
*** 27782,27796 ****
  
  <hr>
  <h3><a name="596"></a>596. 27.8.1.3 Table 112 omits "a+" and "a+b" modes</h3>
! <p><b>Section:</b> 27.9.1.4 [filebuf.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2006-09-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#filebuf.members">issues</a> in [filebuf.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In testing 27.9.1.4 [filebuf.members], Table 112 (in the latest N2009 draft), we invoke  
  </p>
! <blockquote><pre>   ostr.open("somename", ios_base::out | ios_base::in | ios_base::app)
  </pre></blockquote>
  <p>
  and we expect the open to fail, because out|in|app is not listed in
--- 27787,27802 ----
  
  <hr>
  <h3><a name="596"></a>596. 27.8.1.3 Table 112 omits "a+" and "a+b" modes</h3>
! <p><b>Section:</b> 27.9.1.4 [filebuf.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2006-09-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#filebuf.members">issues</a> in [filebuf.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In testing 27.9.1.4 [filebuf.members], Table 112 (in the latest N2009 draft), we invoke  
  </p>
! <blockquote><pre>
!    ostr.open("somename", ios_base::out | ios_base::in | ios_base::app)
  </pre></blockquote>
  <p>
  and we expect the open to fail, because out|in|app is not listed in
*************** Add to the table "File open modes" in 27
*** 27840,27846 ****
  <blockquote>
  <table border="1">
  <caption> File open modes</caption>
! <tbody><tr>
  <th colspan="5"><tt>ios_base</tt> Flag combination</th>
  <th><tt>stdio</tt> equivalent</th>
  </tr>
--- 27846,27852 ----
  <blockquote>
  <table border="1">
  <caption> File open modes</caption>
! <tr>
  <th colspan="5"><tt>ios_base</tt> Flag combination</th>
  <th><tt>stdio</tt> equivalent</th>
  </tr>
*************** Add to the table "File open modes" in 27
*** 27896,27910 ****
  </tr>
  <tr>
  <td><tt>+</tt></td> <td><tt>+</tt></td> <td><tt>+</tt></td> <td><tt>+</tt></td> <td>&nbsp;</td> <td><tt>"w+b"</tt></td>
! </tr><tr>
  <td><ins><tt>+</tt></ins></td> <td><ins><tt>+</tt></ins></td> <td><ins><tt>+</tt></ins></td> <td>&nbsp;</td> <td><ins><tt>+</tt></ins></td> <td><ins><tt>"a+b"</tt></ins></td>
  </tr>
  <tr>
  <td><ins><tt>+</tt></ins></td> <td><ins><tt>+</tt></ins></td> <td>&nbsp;</td> <td>&nbsp;</td> <td><ins><tt>+</tt></ins></td> <td><ins><tt>"a+b"</tt></ins></td>
  </tr>
  
! 
! </tbody></table>
  </blockquote>
  
  
--- 27902,27916 ----
  </tr>
  <tr>
  <td><tt>+</tt></td> <td><tt>+</tt></td> <td><tt>+</tt></td> <td><tt>+</tt></td> <td>&nbsp;</td> <td><tt>"w+b"</tt></td>
! </tr>
! <tr>
  <td><ins><tt>+</tt></ins></td> <td><ins><tt>+</tt></ins></td> <td><ins><tt>+</tt></ins></td> <td>&nbsp;</td> <td><ins><tt>+</tt></ins></td> <td><ins><tt>"a+b"</tt></ins></td>
  </tr>
  <tr>
  <td><ins><tt>+</tt></ins></td> <td><ins><tt>+</tt></ins></td> <td>&nbsp;</td> <td>&nbsp;</td> <td><ins><tt>+</tt></ins></td> <td><ins><tt>"a+b"</tt></ins></td>
  </tr>
  
! </table>
  </blockquote>
  
  
*************** Kona (2007) Added proposed wording and m
*** 27919,27928 ****
  
  <hr>
  <h3><a name="598"></a>598. Decimal: Conversion to integral should truncate, not round.</h3>
! <p><b>Section:</b> TRDecimal 3.2 [trdec.types.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Krugler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#trdec.types.types">issues</a> in [trdec.types.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 27925,27934 ----
  
  <hr>
  <h3><a name="598"></a>598. Decimal: Conversion to integral should truncate, not round.</h3>
! <p><b>Section:</b> TRDecimal 3.2 [trdec.types.types] <b>Status:</b> <a href="lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Krugler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#trdec.types.types">issues</a> in [trdec.types.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** I would like to
*** 27934,27940 ****
  ask, what where the reason for the decision to 
  define the semantics of the integral conversion of the decimal types, namely
  </p>
! <pre>"operator long long() const;
  
       Returns: Returns the result of the 
  conversion of *this to the type long long, as if 
--- 27940,27947 ----
  ask, what where the reason for the decision to 
  define the semantics of the integral conversion of the decimal types, namely
  </p>
! <pre>
! "operator long long() const;
  
       Returns: Returns the result of the 
  conversion of *this to the type long long, as if 
*************** Change the <b>Returns:</b> clause in 3.2
*** 27997,28005 ****
  
  <hr>
  <h3><a name="599"></a>599. Decimal: Say "octets" instead of "bytes."</h3>
! <p><b>Section:</b> TRDecimal 3.1 [trdec.types.encodings] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Krugler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Daniel writes in a private email:
--- 28004,28012 ----
  
  <hr>
  <h3><a name="599"></a>599. Decimal: Say "octets" instead of "bytes."</h3>
! <p><b>Section:</b> TRDecimal 3.1 [trdec.types.encodings] <b>Status:</b> <a href="lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Krugler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Daniel writes in a private email:
*************** Daniel writes in a private email:
*** 28009,28015 ****
  <p>
  - 3.1 'Decimal type encodings' says in its note:
  </p>
! <pre>"this implies that 
  sizeof(std::decimal::decimal32) == 4, 
  sizeof(std::decimal::decimal64) == 8, and 
  sizeof(std::decimal::decimal128) == 16."
--- 28016,28023 ----
  <p>
  - 3.1 'Decimal type encodings' says in its note:
  </p>
! <pre>
! "this implies that 
  sizeof(std::decimal::decimal32) == 4, 
  sizeof(std::decimal::decimal64) == 8, and 
  sizeof(std::decimal::decimal128) == 16."
*************** decimal128 is a <em>decimal128</em> numb
*** 28055,28063 ****
  
  <hr>
  <h3><a name="600"></a>600. Decimal: Wrong parameters for wcstod* functions</h3>
! <p><b>Section:</b> TRDecimal 3.9 [trdec.types.cwchar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Krugler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Daniel writes:
--- 28063,28071 ----
  
  <hr>
  <h3><a name="600"></a>600. Decimal: Wrong parameters for wcstod* functions</h3>
! <p><b>Section:</b> TRDecimal 3.9 [trdec.types.cwchar] <b>Status:</b> <a href="lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Krugler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Daniel writes:
*************** wcstod128 functions ([the parameters hav
*** 28073,28079 ****
  <p>
  Change "3.9.1 Additions to <code>&lt;cwchar&gt;</code> synopsis" to:
  </p>
! <pre>       namespace std {
         namespace decimal {
           // 3.9.2 wcstod functions:
           decimal32  wcstod32  (const <del>char</del> <ins>wchar_t</ins> * nptr, <del>char</del> <ins>wchar_t</ins> ** endptr);
--- 28081,28088 ----
  <p>
  Change "3.9.1 Additions to <code>&lt;cwchar&gt;</code> synopsis" to:
  </p>
! <pre>
!        namespace std {
         namespace decimal {
           // 3.9.2 wcstod functions:
           decimal32  wcstod32  (const <del>char</del> <ins>wchar_t</ins> * nptr, <del>char</del> <ins>wchar_t</ins> ** endptr);
*************** Change "3.9.1 Additions to <code>&lt;cwc
*** 28088,28096 ****
  
  <hr>
  <h3><a name="601"></a>601. Decimal: numeric_limits typos</h3>
! <p><b>Section:</b> TRDecimal 3.3 [trdec.types.limits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Krugler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Daniel writes in a private email:
--- 28097,28105 ----
  
  <hr>
  <h3><a name="601"></a>601. Decimal: numeric_limits typos</h3>
! <p><b>Section:</b> TRDecimal 3.3 [trdec.types.limits] <b>Status:</b> <a href="lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Krugler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Daniel writes in a private email:
*************** max. exponent for decimal::decimal64).</
*** 28114,28120 ****
  <p>
  In "3.3 Additions to header <code>&lt;limits&gt;</code>" change numeric_limits&lt;decimal::decimal128&gt; as follows:
  </p>
! <pre>        template&lt;&gt; class numeric_limits&lt;decimal::decimal128&gt; {
            public:
              static const bool is_specialized = true;
  
--- 28123,28130 ----
  <p>
  In "3.3 Additions to header <code>&lt;limits&gt;</code>" change numeric_limits&lt;decimal::decimal128&gt; as follows:
  </p>
! <pre>
!         template&lt;&gt; class numeric_limits&lt;decimal::decimal128&gt; {
            public:
              static const bool is_specialized = true;
  
*************** In "3.3 Additions to header <code>&lt;li
*** 28130,28139 ****
  
  <hr>
  <h3><a name="602"></a>602. Decimal: "generic floating type" not defined.</h3>
! <p><b>Section:</b> TRDecimal 3 [trdec.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Krugler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#trdec.types">issues</a> in [trdec.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The document uses the term "generic floating types," but defines it nowhere.
--- 28140,28149 ----
  
  <hr>
  <h3><a name="602"></a>602. Decimal: "generic floating type" not defined.</h3>
! <p><b>Section:</b> TRDecimal 3 [trdec.types] <b>Status:</b> <a href="lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#trdec.types">issues</a> in [trdec.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The document uses the term "generic floating types," but defines it nowhere.
*************** collectively described as the <i>basic f
*** 28159,28168 ****
  
  <hr>
  <h3><a name="603"></a>603. Decimal: Trivially simplifying decimal classes.</h3>
! <p><b>Section:</b> TRDecimal 3 [trdec.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#trdec.types">issues</a> in [trdec.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In c++std-lib-17198, Martin writes:</p>
  
--- 28169,28178 ----
  
  <hr>
  <h3><a name="603"></a>603. Decimal: Trivially simplifying decimal classes.</h3>
! <p><b>Section:</b> TRDecimal 3 [trdec.types] <b>Status:</b> <a href="lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#trdec.types">issues</a> in [trdec.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>In c++std-lib-17198, Martin writes:</p>
  
*************** standard (e.g., std::complex).
*** 28182,28188 ****
  <p>
  Change "3.2.2 Class <code>decimal32</code>" as follows:
  </p>
! <pre>      namespace std {
        namespace decimal {
          class decimal32 {
            public:
--- 28192,28199 ----
  <p>
  Change "3.2.2 Class <code>decimal32</code>" as follows:
  </p>
! <pre>
!       namespace std {
        namespace decimal {
          class decimal32 {
            public:
*************** Change "3.2.2 Class <code>decimal32</cod
*** 28196,28202 ****
  <p>
  Change "3.2.2.1 construct/copy/destroy" as follows:
  </p>
! <pre>        decimal32();
  
      Effects: Constructs an object of type decimal32 with the value 0;
  
--- 28207,28214 ----
  <p>
  Change "3.2.2.1 construct/copy/destroy" as follows:
  </p>
! <pre>
!         decimal32();
  
      Effects: Constructs an object of type decimal32 with the value 0;
  
*************** Change "3.2.2.1 construct/copy/destroy"
*** 28213,28219 ****
  <p>
  Change "3.2.3 Class <code>decimal64</code>" as follows:
  </p>
! <pre>      namespace std {
        namespace decimal {
          class decimal64 {
            public:
--- 28225,28232 ----
  <p>
  Change "3.2.3 Class <code>decimal64</code>" as follows:
  </p>
! <pre>
!       namespace std {
        namespace decimal {
          class decimal64 {
            public:
*************** Change "3.2.3 Class <code>decimal64</cod
*** 28227,28233 ****
  <p>
  Change "3.2.3.1 construct/copy/destroy" as follows:
  </p>
! <pre>        decimal64();
  
      Effects: Constructs an object of type decimal64 with the value 0;
  
--- 28240,28247 ----
  <p>
  Change "3.2.3.1 construct/copy/destroy" as follows:
  </p>
! <pre>
!         decimal64();
  
      Effects: Constructs an object of type decimal64 with the value 0;
  
*************** Change "3.2.3.1 construct/copy/destroy"
*** 28244,28250 ****
  <p>
  Change "3.2.4 Class <code>decimal128</code>" as follows:
  </p>
! <pre>      namespace std {
        namespace decimal {
          class decimal128 {
            public:
--- 28258,28265 ----
  <p>
  Change "3.2.4 Class <code>decimal128</code>" as follows:
  </p>
! <pre>
!       namespace std {
        namespace decimal {
          class decimal128 {
            public:
*************** Change "3.2.4 Class <code>decimal128</co
*** 28258,28264 ****
  <p>
  Change "3.2.4.1 construct/copy/destroy" as follows:
  </p>
! <pre>        decimal128();
  
      Effects: Constructs an object of type decimal128 with the value 0;
  
--- 28273,28280 ----
  <p>
  Change "3.2.4.1 construct/copy/destroy" as follows:
  </p>
! <pre>
!         decimal128();
  
      Effects: Constructs an object of type decimal128 with the value 0;
  
*************** Change "3.2.4.1 construct/copy/destroy"
*** 28278,28287 ****
  
  <hr>
  <h3><a name="604"></a>604. Decimal: Storing a reference to a facet unsafe.</h3>
! <p><b>Section:</b> TRDecimal 3 [trdec.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#trdec.types">issues</a> in [trdec.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In c++std-lib-17197, Martin writes:
--- 28294,28303 ----
  
  <hr>
  <h3><a name="604"></a>604. Decimal: Storing a reference to a facet unsafe.</h3>
! <p><b>Section:</b> TRDecimal 3 [trdec.types] <b>Status:</b> <a href="lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2006-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#trdec.types">issues</a> in [trdec.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In c++std-lib-17197, Martin writes:
*************** take a locale argument instead.
*** 28322,28345 ****
  <p>
  1. Change the <code>extended_num_get</code> synopsis in 3.10.2 as follows:
  </p>
! <pre>            extended_num_get(const <del>std::num_get&lt;charT, InputIterator&gt;</del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0);
  
              /* ... */
  
!             <del>// <i>const std::num_get&lt;charT, InputIterator&gt; &amp; <b>base</b></i>;        <i><b>exposition only</b></i></del>
              <ins>// <i>std::locale <b>baseloc</b></i>;                                    <i><b>exposition only</b></i></ins>
  </pre>
  <p>
  2. Change the description of the above constructor in 3.10.2.1:
  </p>
! <pre>            extended_num_get(const <del>std::num_get&lt;charT, InputIterator&gt;</del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0);
  
  </pre>
  <blockquote>
  <p>
  <b>Effects:</b> Constructs an <code>extended_num_get</code> facet as if by:
  </p>
! <pre>       extended_num_get(const <del>std::num_get&lt;charT, InputIterator&gt;</del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0)
                  : facet(<i>refs</i>), <i>base<ins>loc</ins></i>(<i>b</i>)
                  { /* ... */ }
  
--- 28338,28364 ----
  <p>
  1. Change the <code>extended_num_get</code> synopsis in 3.10.2 as follows:
  </p>
! <pre>
!             extended_num_get(const <del>std::num_get&lt;charT, InputIterator></del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0);
  
              /* ... */
  
!             <del>// <i>const std::num_get&lt;charT, InputIterator> &amp; <b>base</b></i>;        <i><b>exposition only</b></i></del>
              <ins>// <i>std::locale <b>baseloc</b></i>;                                    <i><b>exposition only</b></i></ins>
  </pre>
  <p>
  2. Change the description of the above constructor in 3.10.2.1:
  </p>
! <pre>
!             extended_num_get(const <del>std::num_get&lt;charT, InputIterator></del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0);
  
  </pre>
  <blockquote>
  <p>
  <b>Effects:</b> Constructs an <code>extended_num_get</code> facet as if by:
  </p>
! <pre>
!        extended_num_get(const <del>std::num_get&lt;charT, InputIterator></del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0)
                  : facet(<i>refs</i>), <i>base<ins>loc</ins></i>(<i>b</i>)
                  { /* ... */ }
  
*************** take a locale argument instead.
*** 28352,28379 ****
  3. Change the <b>Returns:</b> clause for <code>do_get(iter_type, iter_type, ios_base &amp;, ios_base::iostate &amp;, bool &amp;) const</code>, <i>et al</i> to
  </p>
  <blockquote><p>
! <b>Returns:</b> <code><del><i>base</i></del> <ins>std::use_facet&lt;std::num_get&lt;charT, InputIterator&gt; &gt;(<i>baseloc</i>)</ins>.get(<i>in</i>, <i>end</i>, <i>str</i>, <i>err</i>, <i>val</i>)</code>. 
  </p></blockquote>
  <p>
  4. Change the <code>extended_num_put</code> synopsis in 3.10.3 as follows:
  </p>
! <pre>            extended_num_put(const <del>std::num_put&lt;charT, OutputIterator&gt;</del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0);
  
              /* ... */
  
!             <del>// <i>const std::num_put&lt;charT, OutputIterator&gt; &amp; <b>base</b></i>;       <i><b>exposition only</b></i></del>
              <ins>// <i>std::locale <b>baseloc</b></i>;                                    <i><b>exposition only</b></i></ins>
  </pre>
  <p>
  5. Change the description of the above constructor in 3.10.3.1:
  </p>
! <pre>            extended_num_put(const <del>std::num_put&lt;charT, OutputIterator&gt;</del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0);
  </pre>
  <blockquote>
  <p>
  <b>Effects:</b> Constructs an <code>extended_num_put</code> facet as if by:
  </p>
! <pre>       extended_num_put(const <del>std::num_put&lt;charT, OutputIterator&gt;</del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0)
                  : facet(<i>refs</i>), <i>base<ins>loc</ins></i>(<i>b</i>)
                  { /* ... */ }
  
--- 28371,28401 ----
  3. Change the <b>Returns:</b> clause for <code>do_get(iter_type, iter_type, ios_base &amp;, ios_base::iostate &amp;, bool &amp;) const</code>, <i>et al</i> to
  </p>
  <blockquote><p>
! <b>Returns:</b> <code><del><i>base</i></del> <ins>std::use_facet&lt;std::num_get&lt;charT, InputIterator> >(<i>baseloc</i>)</ins>.get(<i>in</i>, <i>end</i>, <i>str</i>, <i>err</i>, <i>val</i>)</code>. 
  </p></blockquote>
  <p>
  4. Change the <code>extended_num_put</code> synopsis in 3.10.3 as follows:
  </p>
! <pre>
!             extended_num_put(const <del>std::num_put&lt;charT, OutputIterator></del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0);
  
              /* ... */
  
!             <del>// <i>const std::num_put&lt;charT, OutputIterator> &amp; <b>base</b></i>;       <i><b>exposition only</b></i></del>
              <ins>// <i>std::locale <b>baseloc</b></i>;                                    <i><b>exposition only</b></i></ins>
  </pre>
  <p>
  5. Change the description of the above constructor in 3.10.3.1:
  </p>
! <pre>
!             extended_num_put(const <del>std::num_put&lt;charT, OutputIterator></del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0);
  </pre>
  <blockquote>
  <p>
  <b>Effects:</b> Constructs an <code>extended_num_put</code> facet as if by:
  </p>
! <pre>
!        extended_num_put(const <del>std::num_put&lt;charT, OutputIterator></del> <ins>std::locale</ins> &amp; <i>b</i>, size_t <i>refs</i> = 0)
                  : facet(<i>refs</i>), <i>base<ins>loc</ins></i>(<i>b</i>)
                  { /* ... */ }
  
*************** take a locale argument instead.
*** 28386,28392 ****
  6. Change the <b>Returns:</b> clause for <code>do_put(iter_type, ios_base &amp;, char_type, bool &amp;) const</code>, <i>et al</i> to
  </p>
  <blockquote><p>
! <b>Returns:</b> <code><del><i>base</i></del> <ins>std::use_facet&lt;std::num_put&lt;charT, OutputIterator&gt; &gt;(<i>baseloc</i>)</ins>.put(<i>s</i>, <i>f</i>, <i>fill</i>, <i>val</i>)</code>. 
  </p></blockquote>
  
  <p><i>[
--- 28408,28414 ----
  6. Change the <b>Returns:</b> clause for <code>do_put(iter_type, ios_base &amp;, char_type, bool &amp;) const</code>, <i>et al</i> to
  </p>
  <blockquote><p>
! <b>Returns:</b> <code><del><i>base</i></del> <ins>std::use_facet&lt;std::num_put&lt;charT, OutputIterator> >(<i>baseloc</i>)</ins>.put(<i>s</i>, <i>f</i>, <i>fill</i>, <i>val</i>)</code>. 
  </p></blockquote>
  
  <p><i>[
*************** Redmond:  We would prefer to rename "ext
*** 28400,28442 ****
  
  <hr>
  <h3><a name="605"></a>605. Decimal: &lt;decfloat.h&gt; doesn't live here anymore.</h3>
! <p><b>Section:</b> TRDecimal 3.4 [trdec.types.cdecfloat] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2006-10-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Berlin, WG14 decided to drop the &lt;decfloat.h&gt; header.  The contents of that header have been moved into &lt;float.h&gt;.  For the sake of C compatibility, we should make corresponding changes.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 1. Change the heading of subclause 3.4, "Headers <code>&lt;cdecfloat&gt;</code> and <code>&lt;decfloat.h&gt;</code>" to "Additions to headers <code>&lt;cfloat&gt;</code> and <code>&lt;float.h&gt;</code>."
  </p>
  <p>
  2. Change the text of subclause 3.4 as follows:
  </p>
  <blockquote>
  <p>
! <del>The standard C++ headers <code>&lt;cfloat&gt;</code> and <code>&lt;float.h&gt;</code> define characteristics of the floating-point types <code>float</code>, <code>double</code>, and <code>long double</code>.  Their contents remain unchanged by this Technical Report.</del>
  </p>
  <p>
! <del>Headers <code>&lt;cdecfloat&gt;</code> and <code>&lt;decfloat.h&gt;</code> define characteristics of the decimal floating-point types <code>decimal32</code>, <code>decimal64</code>, and <code>decimal128</code>.  As well, <code>&lt;decfloat.h&gt;</code> defines the convenience typedefs <code>_Decimal32</code>, <code>_Decimal64</code>, and <code>_Decimal128</code>, for compatibilty with the C programming language.</del>
  </p>
  <p>
! <ins>The header <code>&lt;cfloat&gt;</code> is described in [tr.c99.cfloat].  The header <code>&lt;float.h&gt;</code> is described in [tr.c99.floath]. These headers are extended by this Technical Report to define characteristics of the decimal floating-point types <code>decimal32</code>, <code>decimal64</code>, and <code>decimal128</code>.  As well, <code>&lt;float.h&gt;</code> is extended to define the convenience typedefs <code>_Decimal32</code>, <code>_Decimal64</code>, and <code>_Decimal128</code> for compatibility with the C programming language.</ins>
  </p>
  </blockquote>
  <p>
! 3. Change the heading of subclause 3.4.1, "Header <code>&lt;cdecfloat&gt;</code> synopsis"  to "Additions to header <code>&lt;cfloat&gt;</code> synopsis."
  </p>
  <p>
! 4. Change the heading of subclause 3.4.2, "Header <code>&lt;decfloat.h&gt;</code> synopsis" to "Additions to header <code>&lt;float.h&gt;</code> synopsis."
  </p>
  <p>
  5. Change the contents of 3.4.2 as follows:
  </p>
! <pre>      <del>#include &lt;cdecfloat&gt;</del>
  
        // <i>C-compatibility convenience typedefs:</i>
  
--- 28422,28465 ----
  
  <hr>
  <h3><a name="605"></a>605. Decimal: &lt;decfloat.h&gt; doesn't live here anymore.</h3>
! <p><b>Section:</b> TRDecimal 3.4 [trdec.types.cdecfloat] <b>Status:</b> <a href="lwg-active.html#TRDec">TRDec</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2006-10-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#TRDec">TRDec</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Berlin, WG14 decided to drop the &lt;decfloat.h> header.  The contents of that header have been moved into &lt;float.h>.  For the sake of C compatibility, we should make corresponding changes.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 1. Change the heading of subclause 3.4, "Headers <code>&lt;cdecfloat></code> and <code>&lt;decfloat.h></code>" to "Additions to headers <code>&lt;cfloat></code> and <code>&lt;float.h></code>."
  </p>
  <p>
  2. Change the text of subclause 3.4 as follows:
  </p>
  <blockquote>
  <p>
! <del>The standard C++ headers <code>&lt;cfloat></code> and <code>&lt;float.h></code> define characteristics of the floating-point types <code>float</code>, <code>double</code>, and <code>long double</code>.  Their contents remain unchanged by this Technical Report.</del>
  </p>
  <p>
! <del>Headers <code>&lt;cdecfloat></code> and <code>&lt;decfloat.h></code> define characteristics of the decimal floating-point types <code>decimal32</code>, <code>decimal64</code>, and <code>decimal128</code>.  As well, <code>&lt;decfloat.h></code> defines the convenience typedefs <code>_Decimal32</code>, <code>_Decimal64</code>, and <code>_Decimal128</code>, for compatibilty with the C programming language.</del>
  </p>
  <p>
! <ins>The header <code>&lt;cfloat></code> is described in [tr.c99.cfloat].  The header <code>&lt;float.h></code> is described in [tr.c99.floath]. These headers are extended by this Technical Report to define characteristics of the decimal floating-point types <code>decimal32</code>, <code>decimal64</code>, and <code>decimal128</code>.  As well, <code>&lt;float.h></code> is extended to define the convenience typedefs <code>_Decimal32</code>, <code>_Decimal64</code>, and <code>_Decimal128</code> for compatibility with the C programming language.</ins>
  </p>
  </blockquote>
  <p>
! 3. Change the heading of subclause 3.4.1, "Header <code>&lt;cdecfloat></code> synopsis"  to "Additions to header <code>&lt;cfloat></code> synopsis."
  </p>
  <p>
! 4. Change the heading of subclause 3.4.2, "Header <code>&lt;decfloat.h></code> synopsis" to "Additions to header <code>&lt;float.h></code> synopsis."
  </p>
  <p>
  5. Change the contents of 3.4.2 as follows:
  </p>
! <pre>
!       <del>#include &lt;cdecfloat></del>
  
        // <i>C-compatibility convenience typedefs:</i>
  
*************** In Berlin, WG14 decided to drop the &lt;
*** 28451,28460 ****
  
  <hr>
  <h3><a name="607"></a>607. Concern about short seed vectors</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2006-10-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Short seed vectors of 32-bit quantities all result in different states. However
--- 28474,28483 ----
  
  <hr>
  <h3><a name="607"></a>607. Concern about short seed vectors</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2006-10-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Short seed vectors of 32-bit quantities all result in different states. However
*************** this is not true of seed vectors of 16-b
*** 28462,28468 ****
  these two seeds
  </p>
  
! <blockquote><pre>unsigned short seed = {1, 2, 3};
  unsigned short seed = {1, 2, 3, 0};
  </pre></blockquote>
  
--- 28485,28492 ----
  these two seeds
  </p>
  
! <blockquote><pre>
! unsigned short seed = {1, 2, 3};
  unsigned short seed = {1, 2, 3, 0};
  </pre></blockquote>
  
*************** unsigned short seed = {1, 2, 3, 0};
*** 28470,28476 ****
  both pack to
  </p>
  
! <blockquote><pre>unsigned seed = {0x20001, 0x3};
  </pre></blockquote>
  
  <p>
--- 28494,28501 ----
  both pack to
  </p>
  
! <blockquote><pre>
! unsigned seed = {0x20001, 0x3};
  </pre></blockquote>
  
  <p>
*************** The LWG voted to accelerate this issue t
*** 28502,28511 ****
  
  <hr>
  <h3><a name="608"></a>608. Unclear seed_seq construction details</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2006-10-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 26.4.7.1 [rand.util.seedseq] /6, the order of packing the inputs into b and the
--- 28527,28536 ----
  
  <hr>
  <h3><a name="608"></a>608. Unclear seed_seq construction details</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2006-10-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 26.4.7.1 [rand.util.seedseq] /6, the order of packing the inputs into b and the
*************** The LWG voted to accelerate this issue t
*** 28537,28552 ****
  
  <hr>
  <h3><a name="609"></a>609. missing static const</h3>
! <p><b>Section:</b> 26.5.4.2 [rand.adapt.ibits], TR1 5.1 [tr.rand] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter E. Brown <b>Opened:</b> 2006-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In preparing N2111, an error on my part resulted in the omission of the
  following line from the template synopsis in the cited section:
  </p>
  
! <blockquote><pre>static const size_t word_size = w;
  </pre></blockquote>
  
  <p>
--- 28562,28578 ----
  
  <hr>
  <h3><a name="609"></a>609. missing static const</h3>
! <p><b>Section:</b> 26.5.4.3 [rand.adapt.ibits], TR1 5.1 [tr.rand] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Walter E. Brown <b>Opened:</b> 2006-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In preparing N2111, an error on my part resulted in the omission of the
  following line from the template synopsis in the cited section:
  </p>
  
! <blockquote><pre>
! static const size_t word_size = w;
  </pre></blockquote>
  
  <p>
*************** following line from the template synopsi
*** 28559,28565 ****
  Add the above declaration as the first line after the comment in [rand.adapt.ibits] p4:
  </p>
  
! <blockquote><pre>// engine characteristics
  <ins>static const size_t word_size = w;</ins>
  </pre></blockquote>
  
--- 28585,28592 ----
  Add the above declaration as the first line after the comment in [rand.adapt.ibits] p4:
  </p>
  
! <blockquote><pre>
! // engine characteristics
  <ins>static const size_t word_size = w;</ins>
  </pre></blockquote>
  
*************** and accept my apologies for the oversigh
*** 28573,28582 ****
  
  <hr>
  <h3><a name="610"></a>610. Suggested non-normative note for C++0x</h3>
! <p><b>Section:</b> 20.8.14.2.1 [func.wrap.func.con], TR1 3.7.2.1 [tr.func.wrap.func.con] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Scott Meyers <b>Opened:</b> 2006-11-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  My suggestion is that implementers of both tr1::function and its 
--- 28600,28609 ----
  
  <hr>
  <h3><a name="610"></a>610. Suggested non-normative note for C++0x</h3>
! <p><b>Section:</b> 20.9.12.2.1 [func.wrap.func.con], TR1 3.7.2.1 [tr.func.wrap.func.con] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Scott Meyers <b>Opened:</b> 2006-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  My suggestion is that implementers of both tr1::function and its 
*************** either an empty function object or a mem
*** 28609,28615 ****
  The function implementation in the upcoming Boost 1.34.0 uses the
  "SFO", so that the function objects for typical bind expressions like
  </p>
! <blockquote><pre>bind(&amp;X::f, this, _1, _2, _3)
  </pre></blockquote>
  
  <p>
--- 28636,28643 ----
  The function implementation in the upcoming Boost 1.34.0 uses the
  "SFO", so that the function objects for typical bind expressions like
  </p>
! <blockquote><pre>
! bind(&amp;X::f, this, _1, _2, _3)
  </pre></blockquote>
  
  <p>
*************** function pointer (a "bound member functi
*** 28645,28659 ****
  
  <hr>
  <h3><a name="611"></a>611. Standard library templates and incomplete types</h3>
! <p><b>Section:</b> 17.6.3.8 [res.on.functions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nicola Musatti <b>Opened:</b> 2006-11-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#res.on.functions">issues</a> in [res.on.functions].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the latest available draft standard 
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2134.pdf">N2134</a>)
! § 17.4.3.6 [res.on.functions] states:
  </p>
  
  <blockquote>
--- 28673,28687 ----
  
  <hr>
  <h3><a name="611"></a>611. Standard library templates and incomplete types</h3>
! <p><b>Section:</b> 17.6.4.8 [res.on.functions] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nicola Musatti <b>Opened:</b> 2006-11-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#res.on.functions">issues</a> in [res.on.functions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the latest available draft standard 
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2134.pdf">N2134</a>)
! &sect; 17.4.3.6 [res.on.functions] states:
  </p>
  
  <blockquote>
*************** instantiating a template component. </li
*** 28678,28684 ****
  </blockquote>
  
  <p>
! This is contradicted by § 20.6.6.2/2 [util.smartptr.shared] which
  states:
  </p>
  
--- 28706,28712 ----
  </blockquote>
  
  <p>
! This is contradicted by &sect; 20.6.6.2/2 [util.smartptr.shared] which
  states:
  </p>
  
*************** The template parameter <tt>T</tt> of <tt
*** 28695,28701 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Modify the last bullet of § 17.4.3.6/2 [res.on.functions] to allow for
  exceptions:
  </p>
  
--- 28723,28729 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Modify the last bullet of &sect; 17.4.3.6/2 [res.on.functions] to allow for
  exceptions:
  </p>
  
*************** component</ins>. </li>
*** 28714,28723 ****
  
  <hr>
  <h3><a name="612"></a>612. numeric_limits::is_modulo insufficiently defined</h3>
! <p><b>Section:</b> 18.3.1.2 [numeric.limits.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2006-11-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numeric.limits.members">issues</a> in [numeric.limits.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  18.2.1.2 55 states that "A type is modulo if it is possible to add two
--- 28742,28751 ----
  
  <hr>
  <h3><a name="612"></a>612. numeric_limits::is_modulo insufficiently defined</h3>
! <p><b>Section:</b> 18.3.2.4 [numeric.limits.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Chris Jefferson <b>Opened:</b> 2006-11-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numeric.limits.members">issues</a> in [numeric.limits.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  18.2.1.2 55 states that "A type is modulo if it is possible to add two
*************** happens to b modulo? A: the standard alr
*** 28750,28756 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Suggest 18.3.1.2 [numeric.limits.members], paragraph 57 is amended to:
  </p>
  
  <blockquote><p>
--- 28778,28784 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Suggest 18.3.2.4 [numeric.limits.members], paragraph 57 is amended to:
  </p>
  
  <blockquote><p>
*************** differs from the true value by an intege
*** 28769,28781 ****
  
  <hr>
  <h3><a name="613"></a>613. max_digits10 missing from numeric_limits</h3>
! <p><b>Section:</b> 18.3.1.5 [numeric.special] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-11-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numeric.special">issues</a> in [numeric.special].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 18.3.1.5 [numeric.special] starts out by saying that "All members shall be provided 
  for all specializations."
  </p>
  <p>
--- 28797,28809 ----
  
  <hr>
  <h3><a name="613"></a>613. max_digits10 missing from numeric_limits</h3>
! <p><b>Section:</b> 18.3.2.7 [numeric.special] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-11-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numeric.special">issues</a> in [numeric.special].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Section 18.3.2.7 [numeric.special] starts out by saying that "All members shall be provided 
  for all specializations."
  </p>
  <p>
*************** For reference, here are the correct form
*** 28805,28811 ****
  <a href="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1822.pdf">N1822</a>:
  </p>
  
! <blockquote><pre>digits10 = floor((digits-1) * log10(2))
  max_digits10 = ceil((1 + digits) * log10(2))
  </pre></blockquote>
  
--- 28833,28840 ----
  <a href="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1822.pdf">N1822</a>:
  </p>
  
! <blockquote><pre>
! digits10 = floor((digits-1) * log10(2))
  max_digits10 = ceil((1 + digits) * log10(2))
  </pre></blockquote>
  
*************** We are also missing a statement regardin
*** 28817,28823 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change and add after 18.3.1.2 [numeric.limits.members], p11:
  </p>
  
  <blockquote>
--- 28846,28852 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change and add after 18.3.2.4 [numeric.limits.members], p11:
  </p>
  
  <blockquote>
*************** differ <del>by only one epsilon</del> ar
*** 28834,28843 ****
  </blockquote>
  
  <p>
! Change 18.3.1.5 [numeric.special], p2:
  </p>
  
! <blockquote><pre>template&lt;&gt; class numeric_limits&lt;float&gt; { 
  public: 
    static const bool is_specialized = true; 
    ...
--- 28863,28873 ----
  </blockquote>
  
  <p>
! Change 18.3.2.7 [numeric.special], p2:
  </p>
  
! <blockquote><pre>
! template&lt;&gt; class numeric_limits&lt;float&gt; { 
  public: 
    static const bool is_specialized = true; 
    ...
*************** public:
*** 28847,28856 ****
  </pre></blockquote>
  
  <p>
! Change 18.3.1.5 [numeric.special], p3:
  </p>
  
! <blockquote><pre>template&lt;&gt; class numeric_limits&lt;bool&gt; { 
  public: 
    static const bool is_specialized = true; 
    ...
--- 28877,28887 ----
  </pre></blockquote>
  
  <p>
! Change 18.3.2.7 [numeric.special], p3:
  </p>
  
! <blockquote><pre>
! template&lt;&gt; class numeric_limits&lt;bool&gt; { 
  public: 
    static const bool is_specialized = true; 
    ...
*************** public:
*** 28867,28883 ****
  
  <hr>
  <h3><a name="616"></a>616. missing 'typename' in ctype_byname</h3>
! <p><b>Section:</b> 22.4.1.2 [locale.ctype.byname] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-12-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.ctype.byname">issues</a> in [locale.ctype.byname].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 22.2.1.2 defines the ctype_byname class template. It contains the 
  line
  </p>
  
! <blockquote><pre>typedef ctype&lt;charT&gt;::mask   mask;
  </pre></blockquote>
  
  
--- 28898,28915 ----
  
  <hr>
  <h3><a name="616"></a>616. missing 'typename' in ctype_byname</h3>
! <p><b>Section:</b> 22.4.1.2 [locale.ctype.byname] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2006-12-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.ctype.byname">issues</a> in [locale.ctype.byname].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 22.2.1.2 defines the ctype_byname class template. It contains the 
  line
  </p>
  
! <blockquote><pre>
! typedef ctype&lt;charT&gt;::mask   mask;
  </pre></blockquote>
  
  
*************** line
*** 28887,28893 ****
  as this is a dependent type, it should obviously be
  </p>
  
! <blockquote><pre>typedef <ins>typename</ins> ctype&lt;charT&gt;::mask   mask;
  </pre></blockquote>
  
  
--- 28919,28926 ----
  as this is a dependent type, it should obviously be
  </p>
  
! <blockquote><pre>
! typedef <ins>typename</ins> ctype&lt;charT&gt;::mask   mask;
  </pre></blockquote>
  
  
*************** as this is a dependent type, it should o
*** 28896,28904 ****
  
  <hr>
  <h3><a name="618"></a>618. valarray::cshift() effects on empty array</h3>
! <p><b>Section:</b> 26.6.2.7 [valarray.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2007-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I would respectfully request an issue be opened with the intention to
--- 28929,28937 ----
  
  <hr>
  <h3><a name="618"></a>618. valarray::cshift() effects on empty array</h3>
! <p><b>Section:</b> 26.6.2.8 [valarray.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2007-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I would respectfully request an issue be opened with the intention to
*************** clarify the wording for <tt>size() == 0<
*** 28908,28919 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.6.2.7 [valarray.members], paragraph 10:
  </p>
  
  <blockquote>
  
! <pre>valarray&lt;T&gt; cshift(int <i>n</i>) const;
  </pre>
  
  <blockquote>
--- 28941,28953 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.6.2.8 [valarray.members], paragraph 10:
  </p>
  
  <blockquote>
  
! <pre>
! valarray&lt;T&gt; cshift(int <i>n</i>) const;
  </pre>
  
  <blockquote>
*************** Kona (2007) Changed proposed wording, ad
*** 28953,28962 ****
  
  <hr>
  <h3><a name="619"></a>619. Longjmp wording problem</h3>
! <p><b>Section:</b> 18.10 [support.runtime] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2007-01-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.runtime">issues</a> in [support.runtime].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The wording for <tt>longjmp</tt> is confusing.
--- 28987,28997 ----
  
  <hr>
  <h3><a name="619"></a>619. Longjmp wording problem</h3>
! <p><b>Section:</b> 18.10 [support.runtime] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2007-01-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#support.runtime">active issues</a> in [support.runtime].</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.runtime">issues</a> in [support.runtime].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The wording for <tt>longjmp</tt> is confusing.
*************** undefined behavior if replacing the <tt>
*** 29008,29017 ****
  
  <hr>
  <h3><a name="620"></a>620. valid uses of empty valarrays</h3>
! <p><b>Section:</b> 26.6.2.1 [valarray.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 29043,29052 ----
  
  <hr>
  <h3><a name="620"></a>620. valid uses of empty valarrays</h3>
! <p><b>Section:</b> 26.6.2.2 [valarray.cons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** language.
*** 29036,29042 ****
  <p><b>Proposed resolution:</b></p>
          <p>
  
! Reword the <i>Effects</i> clause and <i>Footnote 280</i> as follows (26.6.2.1 [valarray.cons]):
  
          </p>
          <blockquote>
--- 29071,29077 ----
  <p><b>Proposed resolution:</b></p>
          <p>
  
! Reword the <i>Effects</i> clause and <i>Footnote 280</i> as follows (26.6.2.2 [valarray.cons]):
  
          </p>
          <blockquote>
*************** function.
*** 29077,29086 ****
  
  <hr>
  <h3><a name="621"></a>621. non-const copy assignment operators of helper arrays</h3>
! <p><b>Section:</b> 26.6 [numarray] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numarray">issues</a> in [numarray].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 29112,29121 ----
  
  <hr>
  <h3><a name="621"></a>621. non-const copy assignment operators of helper arrays</h3>
! <p><b>Section:</b> 26.6 [numarray] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numarray">issues</a> in [numarray].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** The computed and  "fill" assignment oper
*** 29088,29094 ****
  helper     array     class    templates     (<code>slice_array</code>,
  <code>gslice_array</code>,         <code>mask_array</code>,        and
  <code>indirect_array</code>) are const  member functions of each class
! template     (the     latter    by     the     resolution    of  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#123">123</a>
  since  they have reference  semantics and thus do  not affect
  the state of  the object on which they are  called.  However, the copy
  assignment  operators  of  these  class  templates,  which  also  have
--- 29123,29129 ----
  helper     array     class    templates     (<code>slice_array</code>,
  <code>gslice_array</code>,         <code>mask_array</code>,        and
  <code>indirect_array</code>) are const  member functions of each class
! template     (the     latter    by     the     resolution    of  <a href="lwg-defects.html#123">123</a>
  since  they have reference  semantics and thus do  not affect
  the state of  the object on which they are  called.  However, the copy
  assignment  operators  of  these  class  templates,  which  also  have
*************** Specifically,  make the following edits:
*** 29135,29174 ****
          <p>
  
  Change     the    signature     in     26.6.5 [template.slice.array]    and
! 26.6.5.1 [slice.arr.assign] as follows:
  
          </p>
          <blockquote><pre>
  <code><ins>const</ins> slice_array&amp; operator= (const slice_array&amp;)<ins> const</ins>;</code>
  
          </pre></blockquote>
          <p>
  
  Change     the     signature     in    26.6.7 [template.gslice.array]     and
! 26.6.7.1 [gslice.array.assign] as follows:
  
          </p>
          <blockquote><pre>
  <code><ins>const</ins> gslice_array&amp; operator= (const gslice_array&amp;)<ins> const</ins>;</code>
  
          </pre></blockquote>
          <p>
  
! Change the  signature in 26.6.8 [template.mask.array]  and 26.6.8.1 [mask.array.assign] as
  follows:
  
          </p>
          <blockquote><pre>
  <code><ins>const</ins> mask_array&amp; operator= (const mask_array&amp;)<ins> const</ins>;</code>
  
          </pre></blockquote>
          <p>
  
  Change     the     signature     in    26.6.9 [template.indirect.array] and
! 26.6.9.1 [indirect.array.assign] as follows:
  
          </p>
          <blockquote><pre>
  <code><ins>const</ins> indirect_array&amp; operator= (const indirect_array&amp;)<ins> const</ins>;</code>
  
          </pre></blockquote>
--- 29170,29213 ----
          <p>
  
  Change     the    signature     in     26.6.5 [template.slice.array]    and
! 26.6.5.2 [slice.arr.assign] as follows:
  
          </p>
          <blockquote><pre>
+ 
  <code><ins>const</ins> slice_array&amp; operator= (const slice_array&amp;)<ins> const</ins>;</code>
  
          </pre></blockquote>
          <p>
  
  Change     the     signature     in    26.6.7 [template.gslice.array]     and
! 26.6.7.2 [gslice.array.assign] as follows:
  
          </p>
          <blockquote><pre>
+ 
  <code><ins>const</ins> gslice_array&amp; operator= (const gslice_array&amp;)<ins> const</ins>;</code>
  
          </pre></blockquote>
          <p>
  
! Change the  signature in 26.6.8 [template.mask.array]  and 26.6.8.2 [mask.array.assign] as
  follows:
  
          </p>
          <blockquote><pre>
+ 
  <code><ins>const</ins> mask_array&amp; operator= (const mask_array&amp;)<ins> const</ins>;</code>
  
          </pre></blockquote>
          <p>
  
  Change     the     signature     in    26.6.9 [template.indirect.array] and
! 26.6.9.2 [indirect.array.assign] as follows:
  
          </p>
          <blockquote><pre>
+ 
  <code><ins>const</ins> indirect_array&amp; operator= (const indirect_array&amp;)<ins> const</ins>;</code>
  
          </pre></blockquote>
*************** Kona (2007) Added const qualification to
*** 29184,29192 ****
  
  <hr>
  <h3><a name="622"></a>622. behavior of <code>filebuf</code> dtor and <code>close</code> on error</h3>
! <p><b>Section:</b> 27.9.1.17 [fstream.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 29223,29231 ----
  
  <hr>
  <h3><a name="622"></a>622. behavior of <code>filebuf</code> dtor and <code>close</code> on error</h3>
! <p><b>Section:</b> 27.9.1.17 [fstream.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** dtor? Should the  dtor catch and swallow
*** 29211,29217 ****
  to the caller?  The text doesn't  seem to provide any guidance in this
  regard  other  than  the  general  restriction on  throwing  (but  not
  propagating)  exceptions  from   destructors  of  library  classes  in
! 17.6.4.12 [res.on.exception.handling].
  
          </p>
          <p>
--- 29250,29256 ----
  to the caller?  The text doesn't  seem to provide any guidance in this
  regard  other  than  the  general  restriction on  throwing  (but  not
  propagating)  exceptions  from   destructors  of  library  classes  in
! 17.6.5.12 [res.on.exception.handling].
  
          </p>
          <p>
*************** errors.
*** 29259,29265 ****
          </p>
  
  <p><i>[
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#418">418</a> for related issues.
  ]</i></p>
  
  
--- 29298,29304 ----
          </p>
  
  <p><i>[
! See <a href="lwg-closed.html#397">397</a> and <a href="lwg-closed.html#418">418</a> for related issues.
  ]</i></p>
  
  
*************** Specifically,   we   propose   to   make
*** 29284,29289 ****
--- 29323,29329 ----
          </p>
          <blockquote>
              <pre>
+ 
  <code>basic_filebuf&lt;charT,traits&gt;* close();</code>
  
              </pre>
*************** And to make the following edits in 27.9.
*** 29316,29321 ****
--- 29356,29362 ----
          </p>
          <blockquote>
              <pre>
+ 
  <code>virtual ~basic_filebuf();</code>
  
              </pre>
*************** And to make the following edits in 27.9.
*** 29326,29332 ****
  <code>close()</code>.    <ins>If  an   exception  occurs   during  the
  destruction of the object, including the call to <code>close()</code>,
  the     exception    is     caught    but     not     rethrown    (see
! 17.6.4.12 [res.on.exception.handling]).</ins>
  
              </p>
          </blockquote>
--- 29367,29373 ----
  <code>close()</code>.    <ins>If  an   exception  occurs   during  the
  destruction of the object, including the call to <code>close()</code>,
  the     exception    is     caught    but     not     rethrown    (see
! 17.6.5.12 [res.on.exception.handling]).</ins>
  
              </p>
          </blockquote>
*************** the     exception    is     caught    bu
*** 29337,29345 ****
  
  <hr>
  <h3><a name="623"></a>623. <code>pubimbue</code> forbidden to call <code>imbue</code></h3>
! <p><b>Section:</b> 27.2.1 [iostream.limits.imbue] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 29378,29386 ----
  
  <hr>
  <h3><a name="623"></a>623. <code>pubimbue</code> forbidden to call <code>imbue</code></h3>
! <p><b>Section:</b> 27.2.1 [iostream.limits.imbue] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** causes    any    instance    of    <code
*** 29381,29389 ****
  
  <hr>
  <h3><a name="624"></a>624. <code>valarray</code> assignment and arrays of unequal length</h3>
! <p><b>Section:</b> 26.6.2.2 [valarray.assign] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 29422,29431 ----
  
  <hr>
  <h3><a name="624"></a>624. <code>valarray</code> assignment and arrays of unequal length</h3>
! <p><b>Section:</b> 26.6.2.3 [valarray.assign] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.assign">issues</a> in [valarray.assign].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** undefined behavior.
*** 29396,29402 ****
          <p>
  
  However, the generalized  subscripting assignment operators overloaded
! on <code>slice_array</code>  et al (26.6.2.2 [valarray.assign])  don't have any
  such restriction, leading  the reader to believe that  the behavior of
  these  overloads is  well defined  regardless  of the  lengths of  the
  arguments.
--- 29438,29444 ----
          <p>
  
  However, the generalized  subscripting assignment operators overloaded
! on <code>slice_array</code>  et al (26.6.2.3 [valarray.assign])  don't have any
  such restriction, leading  the reader to believe that  the behavior of
  these  overloads is  well defined  regardless  of the  lengths of  the
  arguments.
*************** For example,  based on  the reading  of
*** 29408,29414 ****
  snippet below can be expected to be well-defined:
  
          </p>
!         <pre>    const std::slice from_0_to_3 (0, 3, 1);   // refers to elements 0, 1, 2
      const std::valarray&lt;int&gt; a (1, 3);        // a = { 1, 1, 1 }
      std::valarray&lt;int&gt;       b (2, 4);        // b = { 2, 2, 2, 2 }
  
--- 29450,29457 ----
  snippet below can be expected to be well-defined:
  
          </p>
!         <pre>
!     const std::slice from_0_to_3 (0, 3, 1);   // refers to elements 0, 1, 2
      const std::valarray&lt;int&gt; a (1, 3);        // a = { 1, 1, 1 }
      std::valarray&lt;int&gt;       b (2, 4);        // b = { 2, 2, 2, 2 }
  
*************** the thread starting at c++std-lib-17786.
*** 29454,29460 ****
  In order  to reflect  such views, the  standard must specify  that the
  size of the  array referred to by the argument  of the assignment must
  match the size of the array  under assignment, for example by adding a
! <i>Requires</i> clause to 26.6.2.2 [valarray.assign] as follows:
  
          </p>
          <blockquote><p>
--- 29497,29503 ----
  In order  to reflect  such views, the  standard must specify  that the
  size of the  array referred to by the argument  of the assignment must
  match the size of the array  under assignment, for example by adding a
! <i>Requires</i> clause to 26.6.2.3 [valarray.assign] as follows:
  
          </p>
          <blockquote><p>
*************** to implement <code>valarray</code> effic
*** 29474,29484 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Insert new paragraph into 26.6.2.2 [valarray.assign]:
  </p>
  
  <blockquote>
! <pre>valarray&lt;T&gt;&amp; operator=(const slice_array&lt;T&gt;&amp;); 
  valarray&lt;T&gt;&amp; operator=(const gslice_array&lt;T&gt;&amp;); 
  valarray&lt;T&gt;&amp; operator=(const mask_array&lt;T&gt;&amp;); 
  valarray&lt;T&gt;&amp; operator=(const indirect_array&lt;T&gt;&amp;);
--- 29517,29528 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Insert new paragraph into 26.6.2.3 [valarray.assign]:
  </p>
  
  <blockquote>
! <pre>
! valarray&lt;T&gt;&amp; operator=(const slice_array&lt;T&gt;&amp;); 
  valarray&lt;T&gt;&amp; operator=(const gslice_array&lt;T&gt;&amp;); 
  valarray&lt;T&gt;&amp; operator=(const mask_array&lt;T&gt;&amp;); 
  valarray&lt;T&gt;&amp; operator=(const indirect_array&lt;T&gt;&amp;);
*************** These operators allow the results of a g
*** 29499,29511 ****
  
  
  <hr>
! <h3><a name="625"></a>625. mixed up <i>Effects</i> and <i>Returns</i> clauses</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#895">895</a></p>
  <p><b>Discussion:</b></p>
   <p>
  
--- 29543,29555 ----
  
  
  <hr>
! <h3><a name="625"></a>625. Mixed up <i>Effects</i> and <i>Returns</i> clauses</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#895">895</a></p>
  <p><b>Discussion:</b></p>
   <p>
  
*************** with regards to the observable effects.
*** 29548,29554 ****
  <p>
  Here's an example of this problem that was precipitated by the change
  from informative Notes to normative <i>Remark</i>s (presumably made to
! address <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#424">424</a>):
  </p>
  
  <p>
--- 29592,29598 ----
  <p>
  Here's an example of this problem that was precipitated by the change
  from informative Notes to normative <i>Remark</i>s (presumably made to
! address <a href="lwg-closed.html#424">424</a>):
  </p>
  
  <p>
*************** introduction of <i>Remark</i>s:
*** 29576,29600 ****
  
  <p>
  <code> insert(size_type pos, string, size_type, size_type)</code> is
! required to throw <code>out_of_range</code> if <code>pos &gt;
  size()</code>.
  </p>
  
  <p>
  <code>insert(size_type pos, string str)</code> is specified to return
  <code>insert(pos, str, 0, npos)</code> by a <i>Returns</i> clause and
! so its effects when <code>pos &gt; size()</code> are strictly speaking
  unspecified.
- </p><p>
- 
  </p>
  I believe a careful review of the current <i>Effects</i> and
  <i>Returns</i> clauses is needed in order to identify all such
  problematic cases. In addition, a review of the Working Paper should
  be done to make sure that the newly introduced normative <i>Remark</i>
  clauses do not impose any undesirable normative requirements in place
  of the original informative <i>Notes</i>.
! <p></p>
  
  <p><i>[
  Batavia: Alan and Pete to work.
--- 29620,29644 ----
  
  <p>
  <code> insert(size_type pos, string, size_type, size_type)</code> is
! required to throw <code>out_of_range</code> if <code>pos >
  size()</code>.
  </p>
  
  <p>
  <code>insert(size_type pos, string str)</code> is specified to return
  <code>insert(pos, str, 0, npos)</code> by a <i>Returns</i> clause and
! so its effects when <code>pos > size()</code> are strictly speaking
  unspecified.
  </p>
+ 
+ <p>
  I believe a careful review of the current <i>Effects</i> and
  <i>Returns</i> clauses is needed in order to identify all such
  problematic cases. In addition, a review of the Working Paper should
  be done to make sure that the newly introduced normative <i>Remark</i>
  clauses do not impose any undesirable normative requirements in place
  of the original informative <i>Notes</i>.
! </p>
  
  <p><i>[
  Batavia: Alan and Pete to work.
*************** Reopened.
*** 29617,29623 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Tom proposes we say that, unless specified otherwise,
  it is always the caller's responsibility to verify that supplied arguments
  meet the called function's requirements.
--- 29661,29667 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Tom proposes we say that, unless specified otherwise,
  it is always the caller's responsibility to verify that supplied arguments
  meet the called function's requirements.
*************** If further semantics are specified
*** 29626,29659 ****
  then it is up to the implementer to check those conditions.
  Alan feels strongly that our current use of Requires in this context
  is confusing, especially now that <tt>requires</tt> is a new keyword.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Move to Tentatively NAD.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Open.  Martin will work on proposed wording.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  Moved to NAD Editorial, solved by revision to N3021.
! </blockquote>
  
  
  
--- 29670,29703 ----
  then it is up to the implementer to check those conditions.
  Alan feels strongly that our current use of Requires in this context
  is confusing, especially now that <tt>requires</tt> is a new keyword.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Move to Tentatively NAD.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Open.  Martin will work on proposed wording.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to NAD Editorial, solved by revision to N3021.
! </p></blockquote>
  
  
  
*************** Solved by revision to N3021.
*** 29674,29689 ****
  
  <hr>
  <h3><a name="628"></a>628. Inconsistent definition of basic_regex constructor</h3>
! <p><b>Section:</b> 28.8 [re.regex] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-01-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.regex">issues</a> in [re.regex].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 28.8 [re.regex] lists a constructor
  </p>
  
! <blockquote><pre>template&lt;class InputIterator&gt;
  basic_regex(InputIterator first, InputIterator last,
                         flag_type f = regex_constants::ECMAScript);
  </pre></blockquote>
--- 29718,29734 ----
  
  <hr>
  <h3><a name="628"></a>628. Inconsistent definition of basic_regex constructor</h3>
! <p><b>Section:</b> 28.8 [re.regex] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-01-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.regex">issues</a> in [re.regex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 28.8 [re.regex] lists a constructor
  </p>
  
! <blockquote><pre>
! template&lt;class InputIterator&gt;
  basic_regex(InputIterator first, InputIterator last,
                         flag_type f = regex_constants::ECMAScript);
  </pre></blockquote>
*************** pair of <tt>ForwardIterator</tt>.
*** 29699,29705 ****
  Change 28.8.2 [re.regex.construct]:
  </p>
  
! <blockquote><pre>template &lt;class <del>ForwardIterator</del> <ins>InputIterator</ins>&gt;
    basic_regex(<del>ForwardIterator</del> <ins>InputIterator</ins> first, <del>ForwardIterator</del> <ins>InputIterator</ins> last, 
                flag_type f = regex_constants::ECMAScript);
  </pre></blockquote>
--- 29744,29751 ----
  Change 28.8.2 [re.regex.construct]:
  </p>
  
! <blockquote><pre>
! template &lt;class <del>ForwardIterator</del> <ins>InputIterator</ins>&gt;
    basic_regex(<del>ForwardIterator</del> <ins>InputIterator</ins> first, <del>ForwardIterator</del> <ins>InputIterator</ins> last, 
                flag_type f = regex_constants::ECMAScript);
  </pre></blockquote>
*************** Change 28.8.2 [re.regex.construct]:
*** 29710,29720 ****
  
  
  <hr>
! <h3><a name="629"></a>629. complex<t> insertion and locale dependence</t></h3>
! <p><b>Section:</b> 26.4.6 [complex.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2007-01-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.ops">issues</a> in [complex.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  is there an issue opened for (0,3) as complex number with
--- 29756,29766 ----
  
  
  <hr>
! <h3><a name="629"></a>629. <tt>complex&lt;T&gt;</tt> insertion and locale dependence</h3>
! <p><b>Section:</b> 26.4.6 [complex.ops] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2007-01-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.ops">issues</a> in [complex.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  is there an issue opened for (0,3) as complex number with
*************** real complex number.
*** 29724,29735 ****
  </p>
  
  <p>
! Further notes/ideas from the lib-reflector, messages 17982-17984:
  </p>
  
  <blockquote>
  <p>
! Add additional entries in num_punct to cover the complex separator (French would be ';').
  </p>
  <p>
  Insert a space before the comma, which should eliminate the ambiguity.
--- 29770,29781 ----
  </p>
  
  <p>
! Further notes&#47;ideas from the lib-reflector, messages 17982-17984:
  </p>
  
  <blockquote>
  <p>
! Add additional entries in <tt>num_punct</tt> to cover the complex separator (French would be ';').
  </p>
  <p>
  Insert a space before the comma, which should eliminate the ambiguity.
*************** Pre-Sophia Antipolis, Howard adds:
*** 29765,29773 ****
  ]</i></p>
  
  
! <blockquote>
  Changed "showbase" to "showpoint" and changed from Ready to Review.
! </blockquote>
  
  <p><i>[
  Post-Sophia Antipolis:
--- 29811,29819 ----
  ]</i></p>
  
  
! <blockquote><p>
  Changed "showbase" to "showpoint" and changed from Ready to Review.
! </p></blockquote>
  
  <p><i>[
  Post-Sophia Antipolis:
*************** I'm changing from WP back to Ready to pi
*** 29792,29814 ****
  Add a footnote to 26.4.6 [complex.ops] p16:
  </p>
  
! <blockquote>
  [In a locale in which comma is being used as a decimal point character,
  inserting <tt>showpoint</tt> into the output stream forces all outputs to show
  an explicit decimal point character; then all inserted complex sequences
  will extract unambiguously.]
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="630"></a>630. arrays of valarray</h3>
! <p><b>Section:</b> 26.6.2.1 [valarray.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
--- 29838,29860 ----
  Add a footnote to 26.4.6 [complex.ops] p16:
  </p>
  
! <blockquote><p>
  [In a locale in which comma is being used as a decimal point character,
  inserting <tt>showpoint</tt> into the output stream forces all outputs to show
  an explicit decimal point character; then all inserted complex sequences
  will extract unambiguously.]
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="630"></a>630. arrays of <tt>valarray</tt></h3>
! <p><b>Section:</b> 26.6.2.2 [valarray.cons] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-01-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
          <p>
  
*************** required or  guaranteed to have well-def
*** 29845,29854 ****
          <p>
  
  I  believe  this  problem  was  introduced  by  the  adoption  of  the
! resolution                outlined                in                <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1996/N0857.asc">N0857</a>,
  <i>Assignment  of  valarrays</i>,  from  1996.   The  copy  assignment
! operator  of  the original  numerical  array  classes  proposed in  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1993/N0280.pdf">N0280</a>,
! as      well       as      the      one       proposed      in      <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1993/N0308.asc">N0308</a>
  (both  from 1993), had  well-defined semantics  for arrays  of unequal
  size (the  latter explicitly  only when <code>*this</code>  was empty;
  assignment of non empty arrays of unequal size was a runtime error).
--- 29891,29903 ----
          <p>
  
  I  believe  this  problem  was  introduced  by  the  adoption  of  the
! resolution                outlined                in                <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1996/N0857.asc">N0857</a>,
  <i>Assignment  of  valarrays</i>,  from  1996.   The  copy  assignment
! operator  of  the original  numerical  array  classes  proposed in  <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1993/N0280.pdf">N0280</a>,
! as      well       as      the      one       proposed      in      <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1993/N0308.asc">N0308</a>
  (both  from 1993), had  well-defined semantics  for arrays  of unequal
  size (the  latter explicitly  only when <code>*this</code>  was empty;
  assignment of non empty arrays of unequal size was a runtime error).
*************** Bellevue:
*** 29882,29890 ****
  ]</i></p>
  
  
! <blockquote>
  If no proposed wording by June meeting, this issue should be closed NAD.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
--- 29931,29939 ----
  ]</i></p>
  
  
! <blockquote><p>
  If no proposed wording by June meeting, this issue should be closed NAD.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
*************** Can be brought back on demand.
*** 29906,29912 ****
  <p><b>Proposed resolution:</b></p>
          <p>
  
! Change 26.6.2.2 [valarray.assign], p1 as follows:
  
          </p>
          <blockquote>
--- 29955,29961 ----
  <p><b>Proposed resolution:</b></p>
          <p>
  
! Change 26.6.2.3 [valarray.assign], p1 as follows:
  
          </p>
          <blockquote>
*************** text:
*** 29944,29950 ****
          </blockquote>
          <p>
  
! Also add the following paragraph to 26.6.2.2 [valarray.assign], immediately after p4:
  
          </p>
          <blockquote>
--- 29993,29999 ----
          </blockquote>
          <p>
  
! Also add the following paragraph to 26.6.2.3 [valarray.assign], immediately after p4:
  
          </p>
          <blockquote>
*************** which you can assign to a <tt>valarray</
*** 29981,29995 ****
  
  <hr>
  <h3><a name="634"></a>634. <tt>allocator.address()</tt> doesn't work for types overloading <tt>operator&amp;</tt></h3>
! <p><b>Section:</b> 20.9.5.1 [allocator.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-02-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#350">350</a></p>
  <p><b>Discussion:</b></p>
  
  <p>
! 20.9.5.1 [allocator.members] says:
  </p>
  <blockquote>
  <pre>pointer address(reference <i>x</i>) const;</pre>
--- 30030,30044 ----
  
  <hr>
  <h3><a name="634"></a>634. <tt>allocator.address()</tt> doesn't work for types overloading <tt>operator&amp;</tt></h3>
! <p><b>Section:</b> 20.7.9.1 [allocator.members] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-02-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.members">issues</a> in [allocator.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#350">350</a></p>
  <p><b>Discussion:</b></p>
  
  <p>
! 20.7.9.1 [allocator.members] says:
  </p>
  <blockquote>
  <pre>pointer address(reference <i>x</i>) const;</pre>
*************** which you can assign to a <tt>valarray</
*** 30001,30007 ****
  </blockquote>
  
  <p>
! 20.9.5.1 [allocator.members] defines <tt>CopyConstructible</tt> which currently not
  only defines the semantics of copy construction, but also restricts what an overloaded
  <tt>operator&amp;</tt> may do.  I believe proposals are in the works (such as concepts
  and rvalue reference) to decouple these two requirements.  Indeed it is not evident
--- 30050,30056 ----
  </blockquote>
  
  <p>
! 20.7.9.1 [allocator.members] defines <tt>CopyConstructible</tt> which currently not
  only defines the semantics of copy construction, but also restricts what an overloaded
  <tt>operator&amp;</tt> may do.  I believe proposals are in the works (such as concepts
  and rvalue reference) to decouple these two requirements.  Indeed it is not evident
*************** yields a copy of the original proxy refe
*** 30020,30030 ****
  <p>
  On the other hand, some code truly needs the address of an object, and not a proxy
  (typically for determining the identity of an object compared to a reference object).
! <a href="http://www.boost.org/">boost</a> has long recognized this dilemma and solved it with 
  <a href="http://www.boost.org/libs/utility/utility.htm#addressof"><tt>boost::addressof</tt></a>.
  It appears to me that this would be useful functionality for the default allocator.  Adopting
  this definition for <tt>allocator::address</tt> would free the standard of requiring
! anything special from types which overload <tt>operator&amp;</tt>.  Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#580">580</a>
  is expected to make use of <tt>allocator::address</tt> mandatory for containers.
  </p>
  
--- 30069,30079 ----
  <p>
  On the other hand, some code truly needs the address of an object, and not a proxy
  (typically for determining the identity of an object compared to a reference object).
! <a href="http://www.boost.org">boost</a> has long recognized this dilemma and solved it with 
  <a href="http://www.boost.org/libs/utility/utility.htm#addressof"><tt>boost::addressof</tt></a>.
  It appears to me that this would be useful functionality for the default allocator.  Adopting
  this definition for <tt>allocator::address</tt> would free the standard of requiring
! anything special from types which overload <tt>operator&amp;</tt>.  Issue <a href="lwg-closed.html#580">580</a>
  is expected to make use of <tt>allocator::address</tt> mandatory for containers.
  </p>
  
*************** is expected to make use of <tt>allocator
*** 30032,30038 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.5.1 [allocator.members]:
  </p>
  
  <blockquote>
--- 30081,30087 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.7.9.1 [allocator.members]:
  </p>
  
  <blockquote>
*************** issue to Ready status to be voted into t
*** 30074,30089 ****
  
  <hr>
  <h3><a name="635"></a>635. domain of <tt>allocator::address</tt></h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-02-08 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The table of allocator requirements in 20.2.5 [allocator.requirements] describes
  <tt>allocator::address</tt> as:
  </p>
! <blockquote><pre>a.address(r)
  a.address(s)
  </pre></blockquote>
  <p>
--- 30123,30140 ----
  
  <hr>
  <h3><a name="635"></a>635. domain of <tt>allocator::address</tt></h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-02-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The table of allocator requirements in 17.6.3.5 [allocator.requirements] describes
  <tt>allocator::address</tt> as:
  </p>
! <blockquote><pre>
! a.address(r)
  a.address(s)
  </pre></blockquote>
  <p>
*************** post San Francisco:
*** 30125,30153 ****
  ]</i></p>
  
  
! <blockquote>
  Pablo recommends NAD Editorial, solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2768.pdf">N2768</a>.
! </blockquote>
  
  <p><i>[
  2009-04-28 Pablo adds:
  ]</i></p>
  
  
! <blockquote>
  Tentatively-ready NAD Editorial as fixed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2768.pdf">N2768</a>.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Fixed by N2768.
! </blockquote>
  
  <p><i>[
  2009-07-28 Reopened by Alisdair.  No longer solved by concepts.
--- 30176,30204 ----
  ]</i></p>
  
  
! <blockquote><p>
  Pablo recommends NAD Editorial, solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2768.pdf">N2768</a>.
! </p></blockquote>
  
  <p><i>[
  2009-04-28 Pablo adds:
  ]</i></p>
  
  
! <blockquote><p>
  Tentatively-ready NAD Editorial as fixed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2768.pdf">N2768</a>.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Fixed by N2768.
! </p></blockquote>
  
  <p><i>[
  2009-07-28 Reopened by Alisdair.  No longer solved by concepts.
*************** Fixed by N2768.
*** 30159,30174 ****
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.2.5 [allocator.requirements]:
  </p>
  
  <blockquote>
--- 30210,30225 ----
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 17.6.3.5 [allocator.requirements]:
  </p>
  
  <blockquote>
*************** no resolution to this issue was recorded
*** 30199,30213 ****
  
  
  <hr>
! <h3><a name="638"></a>638. deque end invalidation during erase</h3>
! <p><b>Section:</b> 23.3.2.3 [deque.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve LoBasso <b>Opened:</b> 2007-02-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The standard states at 23.3.2.3 [deque.modifiers]/4:
  </p>
! <blockquote><pre>deque erase(...)
  </pre>
   <p>
  <i>Effects:</i> ... An erase at either end of the deque invalidates only
--- 30250,30266 ----
  
  
  <hr>
! <h3><a name="638"></a>638. <tt>deque</tt> end invalidation during erase</h3>
! <p><b>Section:</b> 23.3.3.4 [deque.modifiers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Steve LoBasso <b>Opened:</b> 2007-02-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#deque.modifiers">issues</a> in [deque.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The standard states at 23.3.3.4 [deque.modifiers]/4:
  </p>
! <blockquote><pre>
! deque erase(...)
  </pre>
   <p>
  <i>Effects:</i> ... An erase at either end of the deque invalidates only
*************** Any time the last element is erased, ite
*** 30228,30234 ****
  <p>
  This would handle situations like:
  </p>
! <blockquote><pre>erase(begin(), end())
  erase(end() - 1)
  pop_back()
  resize(n, ...) where n &lt; size()
--- 30281,30288 ----
  <p>
  This would handle situations like:
  </p>
! <blockquote><pre>
! erase(begin(), end())
  erase(end() - 1)
  pop_back()
  resize(n, ...) where n &lt; size()
*************** Post Kona, Steve LoBasso notes:
*** 30241,30261 ****
  ]</i></p>
  
  
! <blockquote>
  My only issue with the proposed resolution is that it might not be clear
  that <tt>pop_front()</tt> [where <tt>size() == 1</tt>] can invalidate past-the-end
  iterators.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 23.3.2.3 [deque.modifiers], p4:
  </p>
  
  <blockquote>
! <pre>iterator erase(const_iterator position); 
  iterator erase(const_iterator first, const_iterator last);
  </pre>
  
--- 30295,30316 ----
  ]</i></p>
  
  
! <blockquote><p>
  My only issue with the proposed resolution is that it might not be clear
  that <tt>pop_front()</tt> [where <tt>size() == 1</tt>] can invalidate past-the-end
  iterators.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 23.3.3.4 [deque.modifiers], p4:
  </p>
  
  <blockquote>
! <pre>
! iterator erase(const_iterator position); 
  iterator erase(const_iterator first, const_iterator last);
  </pre>
  
*************** Bellevue:
*** 30283,30313 ****
  ]</i></p>
  
  
! <blockquote>
  Note that there is existing code that relies on iterators not being
  invalidated, but there are also existing implementations that do
  invalidate iterators. Thus, such code is not portable in any case. There
! is a pop_front() note, which should possibly be a separate issue. Mike
  Spertus to evaluate and, if need be, file an issue.
! </blockquote>
  
  
  
  
  <hr>
! <h3><a name="640"></a>640. 27.6.2.5.2 does not handle (unsigned) long long</h3>
! <p><b>Section:</b> 27.7.2.6.2 [ostream.inserters.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-02-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ostream.inserters.arithmetic">issues</a> in [ostream.inserters.arithmetic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The arithmetic inserters are described in 27.7.2.6.2 [ostream.inserters.arithmetic].
  Although the section starts with a listing of the inserters including
  the new ones:
  </p>
  
! <blockquote><pre>operator&lt;&lt;(long long val );
  operator&lt;&lt;(unsigned long long val );
  </pre></blockquote>
  
--- 30338,30369 ----
  ]</i></p>
  
  
! <blockquote><p>
  Note that there is existing code that relies on iterators not being
  invalidated, but there are also existing implementations that do
  invalidate iterators. Thus, such code is not portable in any case. There
! is a <tt>pop_front()</tt> note, which should possibly be a separate issue. Mike
  Spertus to evaluate and, if need be, file an issue.
! </p></blockquote>
  
  
  
  
  <hr>
! <h3><a name="640"></a>640. 27.6.2.5.2 does not handle <tt>(unsigned) long long</tt></h3>
! <p><b>Section:</b> 27.7.3.6.2 [ostream.inserters.arithmetic] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-02-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ostream.inserters.arithmetic">issues</a> in [ostream.inserters.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The arithmetic inserters are described in 27.7.3.6.2 [ostream.inserters.arithmetic].
  Although the section starts with a listing of the inserters including
  the new ones:
  </p>
  
! <blockquote><pre>
! operator&lt;&lt;(long long val );
  operator&lt;&lt;(unsigned long long val );
  </pre></blockquote>
  
*************** back.
*** 30329,30343 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.7.2.6.2 [ostream.inserters.arithmetic]/1 change the third sentence
  </p>
  
! <blockquote>
  When val is of type <tt>bool</tt>, <tt>long</tt>, <tt>unsigned
  long</tt>, <ins>long long, unsigned long long,</ins> <tt>double</tt>,
  <tt>long double</tt>, or <tt>const void*</tt>, the formatting conversion
  occurs as if it performed the following code fragment:
! </blockquote>
  
  
  
--- 30385,30399 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.7.3.6.2 [ostream.inserters.arithmetic]/1 change the third sentence
  </p>
  
! <blockquote><p>
  When val is of type <tt>bool</tt>, <tt>long</tt>, <tt>unsigned
  long</tt>, <ins>long long, unsigned long long,</ins> <tt>double</tt>,
  <tt>long double</tt>, or <tt>const void*</tt>, the formatting conversion
  occurs as if it performed the following code fragment:
! </p></blockquote>
  
  
  
*************** occurs as if it performed the following
*** 30345,30353 ****
  
  <hr>
  <h3><a name="643"></a>643. Impossible "as if" clauses</h3>
! <p><b>Section:</b> 27.9.1.1 [filebuf], 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-02-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current standard 14882:2003(E) as well as N2134 have the
--- 30401,30409 ----
  
  <hr>
  <h3><a name="643"></a>643. Impossible "as if" clauses</h3>
! <p><b>Section:</b> 27.9.1.1 [filebuf], 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-02-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current standard 14882:2003(E) as well as N2134 have the
*************** defects:
*** 30364,30370 ****
  In order to support file I/O and multibyte/wide character conversion, conversions are performed using members of a 
  facet, referred to as <tt><i>a_codecvt</i></tt> in following sections, obtained "as if" by
  </p>
! <blockquote><pre>codecvt&lt;charT,char,typename traits::state_type&gt; <i>a_codecvt</i> =
    use_facet&lt;codecvt&lt;charT,char,typename traits::state_type&gt; &gt;(getloc());
  </pre></blockquote>
  </blockquote>
--- 30420,30427 ----
  In order to support file I/O and multibyte/wide character conversion, conversions are performed using members of a 
  facet, referred to as <tt><i>a_codecvt</i></tt> in following sections, obtained "as if" by
  </p>
! <blockquote><pre>
! codecvt&lt;charT,char,typename traits::state_type&gt; <i>a_codecvt</i> =
    use_facet&lt;codecvt&lt;charT,char,typename traits::state_type&gt; &gt;(getloc());
  </pre></blockquote>
  </blockquote>
*************** A similar issue arises in 22.4.2.2.2 [fa
*** 30384,30390 ****
  In 27.9.1.1 [filebuf]/5 change the "as if" code
  </p>
  
! <blockquote><pre><ins>const </ins>codecvt&lt;charT,char,typename traits::state_type&gt;<ins>&amp;</ins> <i>a_codecvt</i> =
    use_facet&lt;codecvt&lt;charT,char,typename traits::state_type&gt; &gt;(getloc());
  </pre></blockquote>
  
--- 30441,30448 ----
  In 27.9.1.1 [filebuf]/5 change the "as if" code
  </p>
  
! <blockquote><pre>
! <ins>const </ins>codecvt&lt;charT,char,typename traits::state_type&gt;<ins>&amp;</ins> <i>a_codecvt</i> =
    use_facet&lt;codecvt&lt;charT,char,typename traits::state_type&gt; &gt;(getloc());
  </pre></blockquote>
  
*************** In 22.4.2.2.2 [facet.num.put.virtuals]/1
*** 30396,30402 ****
  <p>
  A local variable <tt><i>punct</i></tt> is initialized via
  </p>
! <blockquote><pre><ins>const </ins>numpunct&lt;charT&gt;<ins>&amp;</ins> <i>punct</i> = use_facet&lt; numpunct&lt;charT&gt; &gt;(<i>str</i>.getloc() )<ins>;</ins>
  </pre></blockquote>
  </blockquote>
  
--- 30454,30461 ----
  <p>
  A local variable <tt><i>punct</i></tt> is initialized via
  </p>
! <blockquote><pre>
! <ins>const </ins>numpunct&lt;charT&gt;<ins>&amp;</ins> <i>punct</i> = use_facet&lt; numpunct&lt;charT&gt; &gt;(<i>str</i>.getloc() )<ins>;</ins>
  </pre></blockquote>
  </blockquote>
  
*************** A local variable <tt><i>punct</i></tt> i
*** 30411,30419 ****
  
  <hr>
  <h3><a name="646"></a>646. const incorrect match_result members</h3>
! <p><b>Section:</b> 28.10.5 [re.results.form] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-02-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  28.10.5 [re.results.form] (root and para 3) in N2134 defines the two function template
--- 30470,30478 ----
  
  <hr>
  <h3><a name="646"></a>646. const incorrect match_result members</h3>
! <p><b>Section:</b> 28.10.5 [re.results.form] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-02-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  28.10.5 [re.results.form] (root and para 3) in N2134 defines the two function template
*************** in section 28.10.5 [re.results.form].
*** 30434,30443 ****
  
  <hr>
  <h3><a name="650"></a>650. regex_token_iterator and const correctness</h3>
! <p><b>Section:</b> 28.12.2 [re.tokiter] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-03-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.tokiter">issues</a> in [re.tokiter].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Both the class definition of regex_token_iterator (28.12.2 [re.tokiter]/6) and the latter member specifications (28.12.2.2 [re.tokiter.comp]/1+2) declare both comparison operators as
--- 30493,30502 ----
  
  <hr>
  <h3><a name="650"></a>650. regex_token_iterator and const correctness</h3>
! <p><b>Section:</b> 28.12.2 [re.tokiter] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-03-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.tokiter">issues</a> in [re.tokiter].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Both the class definition of regex_token_iterator (28.12.2 [re.tokiter]/6) and the latter member specifications (28.12.2.2 [re.tokiter.comp]/1+2) declare both comparison operators as
*************** as well as in (28.12.2.3 [re.tokiter.der
*** 30452,30458 ****
  1) In (28.12.2 [re.tokiter]/6) change the current declarations
  </p>
  
! <blockquote><pre>bool operator==(const regex_token_iterator&amp;) <ins>const</ins>;
  bool operator!=(const regex_token_iterator&amp;) <ins>const</ins>;
  const value_type&amp; operator*() <ins>const</ins>;
  const value_type* operator-&gt;() <ins>const</ins>;
--- 30511,30518 ----
  1) In (28.12.2 [re.tokiter]/6) change the current declarations
  </p>
  
! <blockquote><pre>
! bool operator==(const regex_token_iterator&amp;) <ins>const</ins>;
  bool operator!=(const regex_token_iterator&amp;) <ins>const</ins>;
  const value_type&amp; operator*() <ins>const</ins>;
  const value_type* operator-&gt;() <ins>const</ins>;
*************** const value_type* operator-&gt;() <ins>c
*** 30462,30468 ****
  2) In 28.12.2.2 [re.tokiter.comp] change the following declarations
  </p>
  
! <blockquote><pre>bool operator==(const regex_token_iterator&amp; right) <ins>const</ins>;
  bool operator!=(const regex_token_iterator&amp; right) <ins>const</ins>;
  </pre></blockquote>
  
--- 30522,30529 ----
  2) In 28.12.2.2 [re.tokiter.comp] change the following declarations
  </p>
  
! <blockquote><pre>
! bool operator==(const regex_token_iterator&amp; right) <ins>const</ins>;
  bool operator!=(const regex_token_iterator&amp; right) <ins>const</ins>;
  </pre></blockquote>
  
*************** bool operator!=(const regex_token_iterat
*** 30470,30476 ****
  3) In 28.12.2.3 [re.tokiter.deref] change the following declarations
  </p>
  
! <blockquote><pre>const value_type&amp; operator*() <ins>const</ins>;
  const value_type* operator-&gt;() <ins>const</ins>;
  </pre></blockquote>
  
--- 30531,30538 ----
  3) In 28.12.2.3 [re.tokiter.deref] change the following declarations
  </p>
  
! <blockquote><pre>
! const value_type&amp; operator*() <ins>const</ins>;
  const value_type* operator-&gt;() <ins>const</ins>;
  </pre></blockquote>
  
*************** The LWG voted to accelerate this issue t
*** 30487,30496 ****
  
  <hr>
  <h3><a name="651"></a>651. Missing preconditions for regex_token_iterator c'tors</h3>
! <p><b>Section:</b> 28.12.2.1 [re.tokiter.cnstr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-03-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.tokiter.cnstr">issues</a> in [re.tokiter.cnstr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The text provided in 28.12.2.1 [re.tokiter.cnstr]/2+3 describes
--- 30549,30558 ----
  
  <hr>
  <h3><a name="651"></a>651. Missing preconditions for regex_token_iterator c'tors</h3>
! <p><b>Section:</b> 28.12.2.1 [re.tokiter.cnstr] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-03-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.tokiter.cnstr">issues</a> in [re.tokiter.cnstr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The text provided in 28.12.2.1 [re.tokiter.cnstr]/2+3 describes
*************** The LWG voted to accelerate this issue t
*** 30536,30544 ****
  
  <hr>
  <h3><a name="652"></a>652. regex_iterator and const correctness</h3>
! <p><b>Section:</b> 28.12.1 [re.regiter] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-03-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Both the class definition of regex_iterator (28.12.1 [re.regiter]/1) and the latter member specification (28.12.1.2 [re.regiter.comp]/1+2) declare both comparison operators as
--- 30598,30606 ----
  
  <hr>
  <h3><a name="652"></a>652. regex_iterator and const correctness</h3>
! <p><b>Section:</b> 28.12.1 [re.regiter] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-03-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Both the class definition of regex_iterator (28.12.1 [re.regiter]/1) and the latter member specification (28.12.1.2 [re.regiter.comp]/1+2) declare both comparison operators as
*************** as well as in (28.12.1.3 [re.regiter.der
*** 30553,30559 ****
  1) In (28.12.1 [re.regiter]/1) change the current declarations
  </p>
  
! <blockquote><pre>bool operator==(const regex_iterator&amp;) <ins>const</ins>;
  bool operator!=(const regex_iterator&amp;) <ins>const</ins>;
  const value_type&amp; operator*() <ins>const</ins>;
  const value_type* operator-&gt;() <ins>const</ins>;
--- 30615,30622 ----
  1) In (28.12.1 [re.regiter]/1) change the current declarations
  </p>
  
! <blockquote><pre>
! bool operator==(const regex_iterator&amp;) <ins>const</ins>;
  bool operator!=(const regex_iterator&amp;) <ins>const</ins>;
  const value_type&amp; operator*() <ins>const</ins>;
  const value_type* operator-&gt;() <ins>const</ins>;
*************** const value_type* operator-&gt;() <ins>c
*** 30563,30569 ****
  2) In 28.12.1.3 [re.regiter.deref] change the following declarations
  </p>
  
! <blockquote><pre>const value_type&amp; operator*() <ins>const</ins>;
  const value_type* operator-&gt;() <ins>const</ins>;
  </pre></blockquote>
  
--- 30626,30633 ----
  2) In 28.12.1.3 [re.regiter.deref] change the following declarations
  </p>
  
! <blockquote><pre>
! const value_type&amp; operator*() <ins>const</ins>;
  const value_type* operator-&gt;() <ins>const</ins>;
  </pre></blockquote>
  
*************** const value_type* operator-&gt;() <ins>c
*** 30571,30577 ****
  3) In 28.12.1.2 [re.regiter.comp] change the following declarations
  </p>
  
! <blockquote><pre>bool operator==(const regex_iterator&amp; right) <ins>const</ins>;
  bool operator!=(const regex_iterator&amp; right) <ins>const</ins>;
  </pre></blockquote>
  
--- 30635,30642 ----
  3) In 28.12.1.2 [re.regiter.comp] change the following declarations
  </p>
  
! <blockquote><pre>
! bool operator==(const regex_iterator&amp; right) <ins>const</ins>;
  bool operator!=(const regex_iterator&amp; right) <ins>const</ins>;
  </pre></blockquote>
  
*************** The LWG voted to accelerate this issue t
*** 30588,30597 ****
  
  <hr>
  <h3><a name="654"></a>654. Missing IO roundtrip for random number engines</h3>
! <p><b>Section:</b> 26.5.1.4 [rand.req.eng] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-03-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.req.eng">issues</a> in [rand.req.eng].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 98 and para 5 in 26.5.1.4 [rand.req.eng] specify
--- 30653,30662 ----
  
  <hr>
  <h3><a name="654"></a>654. Missing IO roundtrip for random number engines</h3>
! <p><b>Section:</b> 26.5.1.4 [rand.req.eng] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-03-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req.eng">issues</a> in [rand.req.eng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 98 and para 5 in 26.5.1.4 [rand.req.eng] specify
*************** Proof: The following small program demon
*** 30623,30629 ****
  of requirements (exception safety not fulfilled):
  </p>
  
! <blockquote><pre>#include &lt;cassert&gt;
  #include &lt;ostream&gt;
  #include &lt;iostream&gt;
  #include &lt;iomanip&gt;
--- 30688,30695 ----
  of requirements (exception safety not fulfilled):
  </p>
  
! <blockquote><pre>
! #include &lt;cassert&gt;
  #include &lt;ostream&gt;
  #include &lt;iostream&gt;
  #include &lt;iomanip&gt;
*************** The LWG voted to accelerate this issue t
*** 30718,30733 ****
  
  <hr>
  <h3><a name="655"></a>655. Signature of generate_canonical not useful</h3>
! <p><b>Section:</b> 26.5.7.2 [rand.util.canonical] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-03-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.canonical">issues</a> in [rand.util.canonical].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 26.5.2 [rand.synopsis] we have the declaration
  </p>
  
! <blockquote><pre>template&lt;class RealType, class UniformRandomNumberGenerator,
    size_t bits&gt;
  result_type generate_canonical(UniformRandomNumberGenerator&amp; g);
  </pre></blockquote>
--- 30784,30800 ----
  
  <hr>
  <h3><a name="655"></a>655. Signature of generate_canonical not useful</h3>
! <p><b>Section:</b> 26.5.7.2 [rand.util.canonical] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-03-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.canonical">issues</a> in [rand.util.canonical].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 26.5.2 [rand.synopsis] we have the declaration
  </p>
  
! <blockquote><pre>
! template&lt;class RealType, class UniformRandomNumberGenerator,
    size_t bits&gt;
  result_type generate_canonical(UniformRandomNumberGenerator&amp; g);
  </pre></blockquote>
*************** The LWG voted to accelerate this issue t
*** 30767,30784 ****
  
  <hr>
  <h3><a name="658"></a>658. Two unspecified function comparators in [function.objects]</h3>
! <p><b>Section:</b> 20.8 [function.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-03-19 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The header <tt>&lt;functional&gt;</tt> synopsis in 20.8 [function.objects]
  contains the following two free comparison operator templates
  for the <tt>function</tt> class template
  </p>
  
! <blockquote><pre>template&lt;class Function1, class Function2&gt;
  void operator==(const function&lt;Function1&gt;&amp;, const function&lt;Function2&gt;&amp;);
  template&lt;class Function1, class Function2&gt;
  void operator!=(const function&lt;Function1&gt;&amp;, const function&lt;Function2&gt;&amp;);
--- 30834,30852 ----
  
  <hr>
  <h3><a name="658"></a>658. Two unspecified function comparators in [function.objects]</h3>
! <p><b>Section:</b> 20.9 [function.objects] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-03-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The header <tt>&lt;functional&gt;</tt> synopsis in 20.9 [function.objects]
  contains the following two free comparison operator templates
  for the <tt>function</tt> class template
  </p>
  
! <blockquote><pre>
! template&lt;class Function1, class Function2&gt;
  void operator==(const function&lt;Function1&gt;&amp;, const function&lt;Function2&gt;&amp;);
  template&lt;class Function1, class Function2&gt;
  void operator!=(const function&lt;Function1&gt;&amp;, const function&lt;Function2&gt;&amp;);
*************** void operator!=(const function&lt;Functi
*** 30787,30793 ****
  <p>
  which are nowhere described. I assume that they are relicts before the
  corresponding two private and undefined member templates in the function
! template (see 20.8.14.2 [func.wrap.func] and  [func.wrap.func.undef]) have been introduced. The original free
  function templates should be removed, because using an undefined entity
  would lead to an ODR violation of the user.
  </p>
--- 30855,30861 ----
  <p>
  which are nowhere described. I assume that they are relicts before the
  corresponding two private and undefined member templates in the function
! template (see 20.9.12.2 [func.wrap.func] and  [func.wrap.func.undef]) have been introduced. The original free
  function templates should be removed, because using an undefined entity
  would lead to an ODR violation of the user.
  </p>
*************** would lead to an ODR violation of the us
*** 30796,30805 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  Remove the above mentioned two function templates from
! the header <tt>&lt;functional&gt;</tt> synopsis (20.8 [function.objects])
  </p>
  
! <blockquote><pre><del>template&lt;class Function1, class Function2&gt;
  void operator==(const function&lt;Function1&gt;&amp;, const function&lt;Function2&gt;&amp;);
  template&lt;class Function1, class Function2&gt;
  void operator!=(const function&lt;Function1&gt;&amp;, const function&lt;Function2&gt;&amp;);</del>
--- 30864,30874 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  Remove the above mentioned two function templates from
! the header <tt>&lt;functional&gt;</tt> synopsis (20.9 [function.objects])
  </p>
  
! <blockquote><pre>
! <del>template&lt;class Function1, class Function2&gt;
  void operator==(const function&lt;Function1&gt;&amp;, const function&lt;Function2&gt;&amp;);
  template&lt;class Function1, class Function2&gt;
  void operator!=(const function&lt;Function1&gt;&amp;, const function&lt;Function2&gt;&amp;);</del>
*************** void operator!=(const function&lt;Functi
*** 30807,30840 ****
  
  
  
! <p><b>Rationale:</b></p>
  Fixed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2292.html">N2292</a>
  Standard Library Applications for Deleted Functions.
! 
  
  
  
  
  <hr>
! <h3><a name="659"></a>659. istreambuf_iterator should have an operator-&gt;()</h3>
! <p><b>Section:</b> 24.6.3 [istreambuf.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2007-03-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istreambuf.iterator">issues</a> in [istreambuf.iterator].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Greg Herlihy has clearly demonstrated that a user defined input
! iterator should have an operator-&gt;(), even if its
  value type is a built-in type (comp.std.c++, "Re: Should any iterator
! have an operator-&gt;() in C++0x?", March 2007).  And as Howard
  Hinnant remarked in the same thread that the input iterator
  <tt>istreambuf_iterator</tt> doesn't have one, this must be a
  defect!
  </p>
  <p>
  Based on Greg's example, the following code demonstrates the issue:
! </p><pre> #include &lt;iostream&gt; 
   #include &lt;fstream&gt;
   #include &lt;streambuf&gt; 
  
--- 30876,30910 ----
  
  
  
! <p><b>Rationale:</b></p><p>
  Fixed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2292.html">N2292</a>
  Standard Library Applications for Deleted Functions.
! </p>
  
  
  
  
  <hr>
! <h3><a name="659"></a>659. <tt>istreambuf_iterator</tt> should have an <tt>operator-&gt;()</tt></h3>
! <p><b>Section:</b> 24.6.3 [istreambuf.iterator] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2007-03-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istreambuf.iterator">issues</a> in [istreambuf.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Greg Herlihy has clearly demonstrated that a user defined input
! iterator should have an <tt>operator-&gt;()</tt>, even if its
  value type is a built-in type (comp.std.c++, "Re: Should any iterator
! have an <tt>operator-&gt;()</tt> in C++0x?", March 2007).  And as Howard
  Hinnant remarked in the same thread that the input iterator
  <tt>istreambuf_iterator</tt> doesn't have one, this must be a
  defect!
  </p>
  <p>
  Based on Greg's example, the following code demonstrates the issue:
! </p><pre>
!  #include &lt;iostream&gt; 
   #include &lt;fstream&gt;
   #include &lt;streambuf&gt; 
  
*************** Based on Greg's example, the following c
*** 30848,30862 ****
     i-&gt;~C();  // ... so this should be supported!
   }
  </pre>
- <p></p>
  <p>
! Of course, operator-&gt; is also needed when the value_type of
! istreambuf_iterator is a class.
  </p>
  <p>
! The operator-&gt; could be implemented in various ways.  For instance,
  by storing the current value inside the iterator, and returning its
! address.  Or by returning a proxy, like operator_arrow_proxy, from
  <a href="http://www.boost.org/boost/iterator/iterator_facade.hpp">http://www.boost.org/boost/iterator/iterator_facade.hpp</a>
  </p>
  <p>
--- 30918,30931 ----
     i-&gt;~C();  // ... so this should be supported!
   }
  </pre>
  <p>
! Of course, <tt>operator-&gt;</tt> is also needed when the <tt>value_type</tt> of
! <tt>istreambuf_iterator</tt> is a class.
  </p>
  <p>
! The <tt>operator-&gt;</tt> could be implemented in various ways.  For instance,
  by storing the current value inside the iterator, and returning its
! address.  Or by returning a proxy, like <tt>operator_arrow_proxy</tt>, from
  <a href="http://www.boost.org/boost/iterator/iterator_facade.hpp">http://www.boost.org/boost/iterator/iterator_facade.hpp</a>
  </p>
  <p>
*************** have <tt>istreambuf_iterator::pointer</t
*** 30883,30889 ****
  may in fact be a proxy.
  </p>
  <p>
! AFAIK, the resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#445">445</a> ("<tt>iterator_traits::reference</tt>
  unspecified for some iterator categories") implies that for any iterator
  class <tt>Iter</tt>, the return type of <tt>operator-&gt;()</tt> is <tt>Iter::pointer</tt>, by
  definition.  I don't think <tt>Iter::pointer</tt> needs to be a raw pointer.
--- 30952,30958 ----
  may in fact be a proxy.
  </p>
  <p>
! AFAIK, the resolution of <a href="lwg-defects.html#445">445</a> ("<tt>iterator_traits::reference</tt>
  unspecified for some iterator categories") implies that for any iterator
  class <tt>Iter</tt>, the return type of <tt>operator-&gt;()</tt> is <tt>Iter::pointer</tt>, by
  definition.  I don't think <tt>Iter::pointer</tt> needs to be a raw pointer.
*************** is just: <tt>istreambuf_iterator</tt> sh
*** 30903,30913 ****
  ]</i></p>
  
  
! <blockquote>
! Note that operator-&gt; is now a requirement in the <tt>InputIterator</tt> concept, so
  this issue cannot be ignored or existing valid programs will break when
  compiled with an 0x library.
! </blockquote>
  
  <p><i>[
  2009-05-29 Alisdair adds:
--- 30972,30982 ----
  ]</i></p>
  
  
! <blockquote><p>
! Note that <tt>operator-&gt;</tt> is now a requirement in the <tt>InputIterator</tt> concept, so
  this issue cannot be ignored or existing valid programs will break when
  compiled with an 0x library.
! </p></blockquote>
  
  <p><i>[
  2009-05-29 Alisdair adds:
*************** In addition to the current proposal:
*** 30946,30952 ****
  <p>
  24.6.3 [istreambuf.iterator]
  </p>
! <blockquote><pre>template&lt;class charT, class traits = char_traits&lt;charT&gt; &gt;
  class istreambuf_iterator
    : public iterator&lt;input_iterator_tag, charT,
                      typename traits::off_type, <del>charT*</del> <ins><i>unspecified</i></ins>, charT&gt; {
--- 31015,31022 ----
  <p>
  24.6.3 [istreambuf.iterator]
  </p>
! <blockquote><pre>
! template&lt;class charT, class traits = char_traits&lt;charT&gt; &gt;
  class istreambuf_iterator
    : public iterator&lt;input_iterator_tag, charT,
                      typename traits::off_type, <del>charT*</del> <ins><i>unspecified</i></ins>, charT&gt; {
*************** Move to Ready.
*** 30977,30983 ****
  Add to the synopsis in 24.6.3 [istreambuf.iterator]:
  </p>
  
! <blockquote><pre>charT operator*() const;
  <ins>pointer operator-&gt;() const;</ins>
  istreambuf_iterator&lt;charT,traits&gt;&amp; operator++();
  </pre></blockquote>
--- 31047,31054 ----
  Add to the synopsis in 24.6.3 [istreambuf.iterator]:
  </p>
  
! <blockquote><pre>
! charT operator*() const;
  <ins>pointer operator-&gt;() const;</ins>
  istreambuf_iterator&lt;charT,traits&gt;&amp; operator++();
  </pre></blockquote>
*************** istreambuf_iterator&lt;charT,traits&gt;&
*** 30986,30992 ****
  24.6.3 [istreambuf.iterator]
  </p>
  
! <blockquote><pre>template&lt;class charT, class traits = char_traits&lt;charT&gt; &gt;
  class istreambuf_iterator
    : public iterator&lt;input_iterator_tag, charT,
                      typename traits::off_type, <del>charT*</del> <ins><i>unspecified</i></ins>, charT&gt; {
--- 31057,31064 ----
  24.6.3 [istreambuf.iterator]
  </p>
  
! <blockquote><pre>
! template&lt;class charT, class traits = char_traits&lt;charT&gt; &gt;
  class istreambuf_iterator
    : public iterator&lt;input_iterator_tag, charT,
                      typename traits::off_type, <del>charT*</del> <ins><i>unspecified</i></ins>, charT&gt; {
*************** Change 24.6.3 [istreambuf.iterator], p1:
*** 31000,31006 ****
  The class template <tt>istreambuf_iterator</tt> reads successive
  characters from the <tt>streambuf</tt> for which it was constructed.
  <tt>operator*</tt> provides access to the current input character, if
! any. <ins>[<i>Note:</i> <tt>operator-&gt;</tt> may return a proxy. —
  <i>end note</i>]</ins> Each time
  <tt>operator++</tt> is evaluated, the iterator advances to the next
  input character. If the end of stream is reached
--- 31072,31078 ----
  The class template <tt>istreambuf_iterator</tt> reads successive
  characters from the <tt>streambuf</tt> for which it was constructed.
  <tt>operator*</tt> provides access to the current input character, if
! any. <ins>[<i>Note:</i> <tt>operator-&gt;</tt> may return a proxy. &mdash;
  <i>end note</i>]</ins> Each time
  <tt>operator++</tt> is evaluated, the iterator advances to the next
  input character. If the end of stream is reached
*************** object suitable for use as an end-of-ran
*** 31019,31049 ****
  
  <hr>
  <h3><a name="660"></a>660. Missing Bitwise Operations</h3>
! <p><b>Section:</b> 20.8 [function.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2007-04-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Section 20.8 [function.objects] provides <span id="st" name="st" class="st">function</span>
! <span id="st" name="st" class="st">objects</span> for some unary and binary 
  operations, but others are missing. In a LWG reflector discussion, beginning 
  with c++std-lib-18078, pros and cons of adding some of the missing operations 
! were discussed. Bjarne Stroustrup commented "Why standardize what isn't used? 
  Yes, I see the chicken and egg problems here, but it would be nice to see a 
! couple of genuine uses before making additions."</p>
  <p>A number of libraries, including Rogue Wave, GNU, Adobe ASL, and Boost, have 
  already added these functions, either publicly or for internal use. For example, 
! Doug Gregor commented: "Boost will also add ... (|, &amp;, ^) in 1.35.0, because we 
! need those <span id="st" name="st" class="st">function</span>
! <span id="st" name="st" class="st">objects</span> to represent various parallel 
  collective operations (reductions, prefix reductions, etc.) in the new Message 
! Passing Interface (MPI) library."</p>
  <p>Because the bitwise operators have the strongest use cases, the proposed 
  resolution is limited to them.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>To 20.8 [function.objects], Function objects, paragraph 2, add to the header 
  &lt;functional&gt; synopsis:</p>
  <blockquote>
    <pre>template &lt;class T&gt; struct bit_and;
--- 31091,31119 ----
  
  <hr>
  <h3><a name="660"></a>660. Missing Bitwise Operations</h3>
! <p><b>Section:</b> 20.9 [function.objects] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2007-04-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>Section 20.9 [function.objects] provides <em>function objects</em> for some unary and binary 
  operations, but others are missing. In a LWG reflector discussion, beginning 
  with c++std-lib-18078, pros and cons of adding some of the missing operations 
! were discussed. Bjarne Stroustrup commented &quot;Why standardize what isn't used? 
  Yes, I see the chicken and egg problems here, but it would be nice to see a 
! couple of genuine uses before making additions.&quot;</p>
  <p>A number of libraries, including Rogue Wave, GNU, Adobe ASL, and Boost, have 
  already added these functions, either publicly or for internal use. For example, 
! Doug Gregor commented: &quot;Boost will also add ... (|, &amp;, ^) in 1.35.0, because we 
! need those <em>function objects</em> to represent various parallel 
  collective operations (reductions, prefix reductions, etc.) in the new Message 
! Passing Interface (MPI) library.&quot;</p>
  <p>Because the bitwise operators have the strongest use cases, the proposed 
  resolution is limited to them.</p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>To 20.9 [function.objects], Function objects, paragraph 2, add to the header 
  &lt;functional&gt; synopsis:</p>
  <blockquote>
    <pre>template &lt;class T&gt; struct bit_and;
*************** template &lt;class T&gt; struct bit_xor;
*** 31080,31092 ****
  
  <hr>
  <h3><a name="661"></a>661. New 27.6.1.2.2 changes make special extractions useless</h3>
! <p><b>Section:</b> 27.7.1.2.2 [istream.formatted.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-04-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.formatted.arithmetic">issues</a> in [istream.formatted.arithmetic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! To the more drastic changes of 27.7.1.2.2 [istream.formatted.arithmetic] in the current draft N2134 belong
  the explicit description of the extraction of the types short and int in
  terms of as-if code fragments.
  </p>
--- 31150,31162 ----
  
  <hr>
  <h3><a name="661"></a>661. New 27.6.1.2.2 changes make special extractions useless</h3>
! <p><b>Section:</b> 27.7.2.2.2 [istream.formatted.arithmetic] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-04-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.formatted.arithmetic">issues</a> in [istream.formatted.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! To the more drastic changes of 27.7.2.2.2 [istream.formatted.arithmetic] in the current draft N2134 belong
  the explicit description of the extraction of the types short and int in
  terms of as-if code fragments.
  </p>
*************** beginning of the if-statement to be vali
*** 31102,31108 ****
  <li>
  I would like to ask whether the omission of a similar explicit
  extraction of unsigned short and unsigned int in terms of long -
! compared to their corresponding new insertions, as described in 27.7.2.6.2 [ostream.inserters.arithmetic], is a deliberate decision or an
  oversight.
  </li>
  </ol>
--- 31172,31178 ----
  <li>
  I would like to ask whether the omission of a similar explicit
  extraction of unsigned short and unsigned int in terms of long -
! compared to their corresponding new insertions, as described in 27.7.3.6.2 [ostream.inserters.arithmetic], is a deliberate decision or an
  oversight.
  </li>
  </ol>
*************** oversight.
*** 31112,31120 ****
  <ol>
  <li>
  <p>
! In 27.7.1.2.2 [istream.formatted.arithmetic]/2 change the current as-if code fragment
  </p>
! <blockquote><pre>typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = 0;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval );
--- 31182,31191 ----
  <ol>
  <li>
  <p>
! In 27.7.2.2.2 [istream.formatted.arithmetic]/2 change the current as-if code fragment
  </p>
! <blockquote><pre>
! typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = 0;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval );
*************** setstate(err);
*** 31128,31137 ****
  </pre></blockquote>
  
  <p>
! Similarily in 27.7.1.2.2 [istream.formatted.arithmetic]/3 change the current as-if fragment
  </p>
  
! <blockquote><pre>typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = 0;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval );
--- 31199,31209 ----
  </pre></blockquote>
  
  <p>
! Similarily in 27.7.2.2.2 [istream.formatted.arithmetic]/3 change the current as-if fragment
  </p>
  
! <blockquote><pre>
! typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = 0;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval );
*************** is deliberate.
*** 31165,31174 ****
  
  <hr>
  <h3><a name="664"></a>664. <tt>do_unshift</tt> for <tt>codecvt&lt;char, char, mbstate_t&gt;</tt></h3>
! <p><b>Section:</b> 22.4.1.4.2 [locale.codecvt.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.virtuals">issues</a> in [locale.codecvt.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.1.4.2 [locale.codecvt.virtuals], para 7 says (regarding <tt>do_unshift</tt>):
--- 31237,31246 ----
  
  <hr>
  <h3><a name="664"></a>664. <tt>do_unshift</tt> for <tt>codecvt&lt;char, char, mbstate_t&gt;</tt></h3>
! <p><b>Section:</b> 22.4.1.4.2 [locale.codecvt.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.virtuals">issues</a> in [locale.codecvt.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.1.4.2 [locale.codecvt.virtuals], para 7 says (regarding <tt>do_unshift</tt>):
*************** mbstate_t&gt;</tt> stores no characters.
*** 31220,31229 ****
  
  <hr>
  <h3><a name="665"></a>665. <tt>do_unshift</tt> return value</h3>
! <p><b>Section:</b> 22.4.1.4.2 [locale.codecvt.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.codecvt.virtuals">issues</a> in [locale.codecvt.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.1.4.2 [locale.codecvt.virtuals], para 8 says:
--- 31292,31301 ----
  
  <hr>
  <h3><a name="665"></a>665. <tt>do_unshift</tt> return value</h3>
! <p><b>Section:</b> 22.4.1.4.2 [locale.codecvt.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.codecvt.virtuals">issues</a> in [locale.codecvt.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.1.4.2 [locale.codecvt.virtuals], para 8 says:
*************** Change 22.4.1.4.2 [locale.codecvt.virtua
*** 31269,31278 ****
  
  <hr>
  <h3><a name="666"></a>666. <tt>moneypunct::do_curr_symbol()</tt></h3>
! <p><b>Section:</b> 22.4.6.3.2 [locale.moneypunct.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.moneypunct.virtuals">issues</a> in [locale.moneypunct.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.3.2 [locale.moneypunct.virtuals], para 4 footnote 257 says
--- 31341,31350 ----
  
  <hr>
  <h3><a name="666"></a>666. <tt>moneypunct::do_curr_symbol()</tt></h3>
! <p><b>Section:</b> 22.4.6.3.2 [locale.moneypunct.virtuals] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2007-04-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.moneypunct.virtuals">issues</a> in [locale.moneypunct.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  22.4.6.3.2 [locale.moneypunct.virtuals], para 4 footnote 257 says
*************** four characters long, usually three lett
*** 31317,31327 ****
  
  
  <hr>
! <h3><a name="671"></a>671. precision of hexfloat</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> John Salmon <b>Opened:</b> 2007-04-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I am trying to understand how TR1 supports hex float (%a) output.
--- 31389,31399 ----
  
  
  <hr>
! <h3><a name="671"></a>671. precision of <tt>hexfloat</tt></h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> John Salmon <b>Opened:</b> 2007-04-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I am trying to understand how TR1 supports hex float (%a) output.
*************** I am trying to understand how TR1 suppor
*** 31330,31346 ****
  As far as I can tell, it does so via the following:
  </p>
  <p>
! 8.15 Additions to header &lt;locale&gt; [tr.c99.locale]
  </p>
  <p>
  In subclause 22.4.2.2.2 [facet.num.put.virtuals], Table 58 Floating-point conversions, after
! the line:
! floatfield == ios_base::scientific %E
  </p>
  <p>
  add the two lines:
  </p>
! <blockquote><pre>floatfield == ios_base::fixed | ios_base::scientific &amp;&amp; !uppercase %a
  floatfield == ios_base::fixed | ios_base::scientific %A 2
  </pre></blockquote>
  <p>
--- 31402,31419 ----
  As far as I can tell, it does so via the following:
  </p>
  <p>
! 8.15 Additions to header <tt>&lt;locale&gt;</tt> [tr.c99.locale]
  </p>
  <p>
  In subclause 22.4.2.2.2 [facet.num.put.virtuals], Table 58 Floating-point conversions, after
! the line:<br/>
! <tt>floatfield == ios_base::scientific %E</tt>
  </p>
  <p>
  add the two lines:
  </p>
! <blockquote><pre>
! floatfield == ios_base::fixed | ios_base::scientific &amp;&amp; !uppercase %a
  floatfield == ios_base::fixed | ios_base::scientific %A 2
  </pre></blockquote>
  <p>
*************** conversion specifier.  end note]
*** 31354,31367 ****
  Following the thread, in 22.4.2.2.2 [facet.num.put.virtuals], we find:
  </p>
  <p>
! For conversion from a floating-point type, if (flags &amp; fixed) != 0 or
! if str.precision() &gt; 0, then str.precision() is specified in the
  conversion specification.
  </p>
  <p>
! This would seem to imply that when floatfield == fixed|scientific, the
  precision of the conversion specifier is to be taken from
! str.precision().  Is this really what's intended?  I sincerely hope
  that I'm either missing something or this is an oversight.  Please
  tell me that the committee did not intend to mandate that hex floats
  (and doubles) should by default be printed as if by %.6a.
--- 31427,31440 ----
  Following the thread, in 22.4.2.2.2 [facet.num.put.virtuals], we find:
  </p>
  <p>
! For conversion from a floating-point type, if <tt>(flags &amp; fixed) != 0</tt> or
! if <tt>str.precision() &gt; 0</tt>, then <tt>str.precision()</tt> is specified in the
  conversion specification.
  </p>
  <p>
! This would seem to imply that when <tt>floatfield == fixed|scientific</tt>, the
  precision of the conversion specifier is to be taken from
! <tt>str.precision()</tt>.  Is this really what's intended?  I sincerely hope
  that I'm either missing something or this is an oversight.  Please
  tell me that the committee did not intend to mandate that hex floats
  (and doubles) should by default be printed as if by %.6a.
*************** Daniel and Robert have direction to writ
*** 31408,31416 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 31481,31489 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Change 22.4.2.2.2 [facet.num.put.virtual
*** 31420,31431 ****
  of Stage 1):
  </p>
  
! <blockquote>
  For conversion from a floating-point type, <tt>str.precision()</tt> is specified
  <ins>as precision</ins> in the conversion specification
  <ins>if <tt>floatfield != (ios_base::fixed | ios_base::scientific)</tt>, else no
  precision is specified</ins>.
! </blockquote>
  
  
  
--- 31493,31504 ----
  of Stage 1):
  </p>
  
! <blockquote><p>
  For conversion from a floating-point type, <tt>str.precision()</tt> is specified
  <ins>as precision</ins> in the conversion specification
  <ins>if <tt>floatfield != (ios_base::fixed | ios_base::scientific)</tt>, else no
  precision is specified</ins>.
! </p></blockquote>
  
  
  
*************** Kona (2007): Robert volunteers to propos
*** 31439,31448 ****
  
  <hr>
  <h3><a name="672"></a>672. Swappable requirements need updating</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current <tt>Swappable</tt> is:
--- 31512,31521 ----
  
  <hr>
  <h3><a name="672"></a>672. Swappable requirements need updating</h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current <tt>Swappable</tt> is:
*************** The current <tt>Swappable</tt> is:
*** 31451,31457 ****
  <blockquote>
  <table border="1">
  <caption>Table 37: <tt>Swappable</tt> requirements <b>[swappable]</b></caption>
! <tbody><tr><th>expression</th><th>return type</th><th>post-condition</th></tr>
  <tr><td><tt>swap(s,t)</tt></td><td><tt>void</tt></td><td><tt>t</tt> has the value originally held by <tt>u</tt>, and <tt>u</tt> has the value originally 
  held by <tt>t</tt></td></tr>
  <tr><td colspan="3">
--- 31524,31530 ----
  <blockquote>
  <table border="1">
  <caption>Table 37: <tt>Swappable</tt> requirements <b>[swappable]</b></caption>
! <tr><th>expression</th><th>return type</th><th>post-condition</th></tr>
  <tr><td><tt>swap(s,t)</tt></td><td><tt>void</tt></td><td><tt>t</tt> has the value originally held by <tt>u</tt>, and <tt>u</tt> has the value originally 
  held by <tt>t</tt></td></tr>
  <tr><td colspan="3">
*************** and has the semantics described in this
*** 31470,31476 ****
  </li>
  </ul>
  </td></tr>
! </tbody></table>
  </blockquote>
  
  <p>
--- 31543,31549 ----
  </li>
  </ul>
  </td></tr>
! </table>
  </blockquote>
  
  <p>
*************** require only <tt>MoveConstructible</tt>
*** 31482,31488 ****
  Additionally we may want to support proxy references such that the following code is acceptable:
  </p>
  
! <blockquote><pre>namespace Mine {
  
  template &lt;class T&gt;
  struct proxy {...};
--- 31555,31562 ----
  Additionally we may want to support proxy references such that the following code is acceptable:
  </p>
  
! <blockquote><pre>
! namespace Mine {
  
  template &lt;class T&gt;
  struct proxy {...};
*************** between two different types for the case
*** 31529,31535 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 20.2.1 [utility.arg.requirements]:
  </p>
  
  <blockquote>
--- 31603,31609 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 17.6.3.1 [utility.arg.requirements]:
  </p>
  
  <blockquote>
*************** rvalue of type <tt>T</tt>.
*** 31547,31553 ****
  
  <table border="1">
  <caption>Table 37: <tt>Swappable</tt> requirements <b>[swappable]</b></caption>
! <tbody><tr><th>expression</th><th>return type</th><th>post-condition</th></tr>
  <tr><td><tt>swap(s,t)</tt></td><td><tt>void</tt></td>
  <td><tt>t</tt> has the value originally
  held by <tt>u</tt>, and
--- 31621,31627 ----
  
  <table border="1">
  <caption>Table 37: <tt>Swappable</tt> requirements <b>[swappable]</b></caption>
! <tr><th>expression</th><th>return type</th><th>post-condition</th></tr>
  <tr><td><tt>swap(s,t)</tt></td><td><tt>void</tt></td>
  <td><tt>t</tt> has the value originally
  held by <tt>u</tt>, and
*************** semantics described in this table.
*** 31573,31579 ****
  </li>
  </ul>
  </td></tr>
! </tbody></table>
  </blockquote>
  
  
--- 31647,31653 ----
  </li>
  </ul>
  </td></tr>
! </table>
  </blockquote>
  
  
*************** Kona (2007): We like the change to the <
*** 31583,31589 ****
  move semantics. The issue relating to the support of proxies is
  separable from the one relating to move semantics, and it's bigger than
  just swap. We'd like to address only the move semantics changes under
! this issue, and open a separated issue (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#742">742</a>) to handle proxies. Also, there
  may be a third issue, in that the current definition of <tt>Swappable</tt> does
  not permit rvalues to be operands to a swap operation, and Howard's
  proposed resolution would allow the right-most operand to be an rvalue,
--- 31657,31663 ----
  move semantics. The issue relating to the support of proxies is
  separable from the one relating to move semantics, and it's bigger than
  just swap. We'd like to address only the move semantics changes under
! this issue, and open a separated issue (<a href="lwg-defects.html#742">742</a>) to handle proxies. Also, there
  may be a third issue, in that the current definition of <tt>Swappable</tt> does
  not permit rvalues to be operands to a swap operation, and Howard's
  proposed resolution would allow the right-most operand to be an rvalue,
*************** swap to be rvalues).
*** 31598,31614 ****
  
  <hr>
  <h3><a name="673"></a>673. <tt>unique_ptr</tt> update</h3>
! <p><b>Section:</b> 20.9.9 [unique.ptr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr">issues</a> in [unique.ptr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Since the publication of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1856.html">N1856</a>
  there have been a few small but significant advances which should be included into
  <tt>unique_ptr</tt>.  There exists a
! <a href="http://home.twcny.rr.com/hinnant/cpp_extensions/unique_ptr.html">example implmenation</a>
  for all of these changes.
  </p>
  
--- 31672,31688 ----
  
  <hr>
  <h3><a name="673"></a>673. <tt>unique_ptr</tt> update</h3>
! <p><b>Section:</b> 20.8.1 [unique.ptr] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr">issues</a> in [unique.ptr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Since the publication of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1856.html">N1856</a>
  there have been a few small but significant advances which should be included into
  <tt>unique_ptr</tt>.  There exists a
! <a href="http://home.roadrunner.com/~hinnant/unique_ptr.hpp">example implementation</a>
  for all of these changes.
  </p>
  
*************** for all of these changes.
*** 31618,31626 ****
  <p>
  Even though <tt>unique_ptr&lt;void&gt;</tt> is not a valid use case (unlike for <tt>shared_ptr&lt;void&gt;</tt>),
  unexpected cases to crop up which require the instantiation of the interface of <tt>unique_ptr&lt;void&gt;</tt>
! even if it is never used.  For example see
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#541">LWG 541</a> for how this accidently
! happened to <tt>auto_ptr</tt>.  I believe the most robust way to protect <tt>unique_ptr</tt> against this
  type of failure is to augment the return type of <tt>unique_ptr&lt;T&gt;:operator*()</tt> with
  <tt>add_lvalue_reference&lt;T&gt;::type</tt>.  This means that given an instantiated <tt>unique_ptr&lt;void&gt;</tt>
  the act of dereferencing it will simply return <tt>void</tt> instead of causing a compile time failure.
--- 31692,31699 ----
  <p>
  Even though <tt>unique_ptr&lt;void&gt;</tt> is not a valid use case (unlike for <tt>shared_ptr&lt;void&gt;</tt>),
  unexpected cases to crop up which require the instantiation of the interface of <tt>unique_ptr&lt;void&gt;</tt>
! even if it is never used.  For example see <a href="lwg-defects.html#541">541</a> for how this accidently happened to <tt>auto_ptr</tt>.  
! I believe the most robust way to protect <tt>unique_ptr</tt> against this
  type of failure is to augment the return type of <tt>unique_ptr&lt;T&gt;:operator*()</tt> with
  <tt>add_lvalue_reference&lt;T&gt;::type</tt>.  This means that given an instantiated <tt>unique_ptr&lt;void&gt;</tt>
  the act of dereferencing it will simply return <tt>void</tt> instead of causing a compile time failure.
*************** for <tt>unique_ptr</tt> by having the de
*** 31644,31650 ****
  <tt>D::pointer</tt>.  Furthermore this type can easily be defaulted to
  <tt>T*</tt> should the deleter <tt>D</tt> choose not to define a pointer
  type (example implementation
! <a href="http://home.twcny.rr.com/hinnant/cpp_extensions/unique_ptr.html">here</a>).
  This change has no run time overhead.  It has no interface overhead on
  authors of custom delter types.  It simply allows (but not requires)
  authors of custom deleter types to define a smart pointer for the
--- 31717,31723 ----
  <tt>D::pointer</tt>.  Furthermore this type can easily be defaulted to
  <tt>T*</tt> should the deleter <tt>D</tt> choose not to define a pointer
  type (example implementation
! <a href="http://home.roadrunner.com/~hinnant/unique_ptr.hpp">here</a>).
  This change has no run time overhead.  It has no interface overhead on
  authors of custom delter types.  It simply allows (but not requires)
  authors of custom deleter types to define a smart pointer for the
*************** This case is easy to check for with a <t
*** 31663,31669 ****
  deleter is not a pointer type in those constructors which do not accept deleters.
  </p>
  
! <blockquote><pre>unique_ptr&lt;A, void(*)(void*)&gt; p(new A);  // error, no function given to delete the pointer!
  </pre></blockquote>
  
  </li>
--- 31736,31743 ----
  deleter is not a pointer type in those constructors which do not accept deleters.
  </p>
  
! <blockquote><pre>
! unique_ptr&lt;A, void(*)(void*)&gt; p(new A);  // error, no function given to delete the pointer!
  </pre></blockquote>
  
  </li>
*************** Post Kona: Howard adds example user code
*** 31686,31692 ****
  
  
  <blockquote>
! <pre>void legacy_code(void*, std::size_t);
  
  void foo(std::size_t N)
  {
--- 31760,31767 ----
  
  
  <blockquote>
! <pre>
! void legacy_code(void*, std::size_t);
  
  void foo(std::size_t N)
  {
*************** to disable with concepts.  The only part
*** 31702,31708 ****
  want to disable (with concepts or by other means) are the two member functions:
  </p>
  
! <blockquote><pre>T&amp; operator*() const;
  T* operator-&gt;() const;
  </pre></blockquote>
  
--- 31777,31784 ----
  want to disable (with concepts or by other means) are the two member functions:
  </p>
  
! <blockquote><pre>
! T&amp; operator*() const;
  T* operator-&gt;() const;
  </pre></blockquote>
  
*************** T* operator-&gt;() const;
*** 31711,31717 ****
  <p><b>Proposed resolution:</b></p>
  
  <p><i>[
! I am grateful for the generous aid of Peter Dimov and Ion Gaztañaga in helping formulate and review
  the proposed resolutions below.
  ]</i></p>
  
--- 31787,31793 ----
  <p><b>Proposed resolution:</b></p>
  
  <p><i>[
! I am grateful for the generous aid of Peter Dimov and Ion Gazta&ntilde;aga in helping formulate and review
  the proposed resolutions below.
  ]</i></p>
  
*************** the proposed resolutions below.
*** 31720,31729 ****
  <li>
  
  <p>
! Change 20.9.9.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>template &lt;class T, class D = default_delete&lt;T&gt;&gt; class unique_ptr {
     ...
     <del>T&amp;</del> <ins>typename add_lvalue_reference&lt;T&gt;::type</ins> operator*() const;
     ...
--- 31796,31806 ----
  <li>
  
  <p>
! Change 20.8.1.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class D = default_delete&lt;T&gt;&gt; class unique_ptr {
     ...
     <del>T&amp;</del> <ins>typename add_lvalue_reference&lt;T&gt;::type</ins> operator*() const;
     ...
*************** Change 20.9.9.2 [unique.ptr.single]:
*** 31731,31750 ****
  </pre></blockquote>
  
  <p>
! Change 20.9.9.2.4 [unique.ptr.single.observers]:
  </p>
  
! <blockquote><pre><del>T&amp;</del> <ins>typename add_lvalue_reference&lt;T&gt;::type</ins> operator*() const;
  </pre></blockquote>
  
  </li>
  
  <li>
  <p>
! Change 20.9.9.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>template &lt;class T, class D = default_delete&lt;T&gt;&gt; class unique_ptr {
  public:
    <ins>typedef <i>implementation (see description below)</i> pointer;</ins>
     ...
--- 31808,31829 ----
  </pre></blockquote>
  
  <p>
! Change 20.8.1.2.4 [unique.ptr.single.observers]:
  </p>
  
! <blockquote><pre>
! <del>T&amp;</del> <ins>typename add_lvalue_reference&lt;T&gt;::type</ins> operator*() const;
  </pre></blockquote>
  
  </li>
  
  <li>
  <p>
! Change 20.8.1.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class D = default_delete&lt;T&gt;&gt; class unique_ptr {
  public:
    <ins>typedef <i>implementation (see description below)</i> pointer;</ins>
     ...
*************** and <tt>CopyAssignable</tt>.
*** 31773,31782 ****
  </p>
  
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor]:
  </p>
  
! <blockquote><pre>unique_ptr(<del>T*</del> <ins>pointer</ins> p);
  ...
  unique_ptr(<del>T*</del> <ins>pointer</ins> p, <i>implementation defined</i> d); 
  unique_ptr(<del>T*</del> <ins>pointer</ins> p, <i>implementation defined</i> d); 
--- 31852,31862 ----
  </p>
  
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor]:
  </p>
  
! <blockquote><pre>
! unique_ptr(<del>T*</del> <ins>pointer</ins> p);
  ...
  unique_ptr(<del>T*</del> <ins>pointer</ins> p, <i>implementation defined</i> d); 
  unique_ptr(<del>T*</del> <ins>pointer</ins> p, <i>implementation defined</i> d); 
*************** internally stored deleter which was cons
*** 31813,31819 ****
  </p>
  
  <p>
! Change 20.9.9.2.3 [unique.ptr.single.asgn]:
  </p>
  
  <blockquote>
--- 31893,31899 ----
  </p>
  
  <p>
! Change 20.8.1.2.3 [unique.ptr.single.asgn]:
  </p>
  
  <blockquote>
*************** convertible to <del><tt>T*</tt></del> <i
*** 31826,31855 ****
  </blockquote>
  
  <p>
! Change 20.9.9.2.4 [unique.ptr.single.observers]:
  </p>
  
  <blockquote>
! <pre><del>T*</del> <ins>pointer</ins> operator-&gt;() const;</pre>
! ...
  <pre><del>T*</del> <ins>pointer</ins> get() const;</pre>
  </blockquote>
  
  <p>
! Change 20.9.9.2.5 [unique.ptr.single.modifiers]:
  </p>
  
  <blockquote>
  <pre><del>T*</del> <ins>pointer</ins> release();</pre>
! ...
  <pre>void reset(<del>T*</del> <ins>pointer</ins> p = <del>0</del> <ins>pointer()</ins>);</pre>
  </blockquote>
  
  <p>
! Change 20.9.9.3 [unique.ptr.runtime]:
  </p>
  
! <blockquote><pre>template &lt;class T, class D&gt; class unique_ptr&lt;T[], D&gt; {
  public:
    <ins>typedef <i>implementation</i> pointer;</ins>
     ...
--- 31906,31936 ----
  </blockquote>
  
  <p>
! Change 20.8.1.2.4 [unique.ptr.single.observers]:
  </p>
  
  <blockquote>
! <pre><del>T*</del> <ins>pointer</ins> operator->() const;</pre>
! <p>...</p>
  <pre><del>T*</del> <ins>pointer</ins> get() const;</pre>
  </blockquote>
  
  <p>
! Change 20.8.1.2.5 [unique.ptr.single.modifiers]:
  </p>
  
  <blockquote>
  <pre><del>T*</del> <ins>pointer</ins> release();</pre>
! <p>...</p>
  <pre>void reset(<del>T*</del> <ins>pointer</ins> p = <del>0</del> <ins>pointer()</ins>);</pre>
  </blockquote>
  
  <p>
! Change 20.8.1.3 [unique.ptr.runtime]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class D&gt; class unique_ptr&lt;T[], D&gt; {
  public:
    <ins>typedef <i>implementation</i> pointer;</ins>
     ...
*************** public:
*** 31866,31876 ****
  </pre></blockquote>
  
  <p>
! Change 20.9.9.3.1 [unique.ptr.runtime.ctor]:
  </p>
  
  <blockquote>
! <pre>unique_ptr(<del>T*</del> <ins>pointer</ins> p);
  unique_ptr(<del>T*</del> <ins>pointer</ins> p, <i>implementation defined</i> d);
  unique_ptr(<del>T*</del> <ins>pointer</ins> p, <i>implementation defined</i> d);
  </pre>
--- 31947,31958 ----
  </pre></blockquote>
  
  <p>
! Change 20.8.1.3.1 [unique.ptr.runtime.ctor]:
  </p>
  
  <blockquote>
! <pre>
! unique_ptr(<del>T*</del> <ins>pointer</ins> p);
  unique_ptr(<del>T*</del> <ins>pointer</ins> p, <i>implementation defined</i> d);
  unique_ptr(<del>T*</del> <ins>pointer</ins> p, <i>implementation defined</i> d);
  </pre>
*************** these members. <i>-- end note</i>]
*** 31885,31895 ****
  </blockquote>
  
  <p>
! Change 20.9.9.3.3 [unique.ptr.runtime.modifiers]:
  </p>
  
  <blockquote>
! <pre>void reset(<del>T*</del> <ins>pointer</ins> p = <del>0</del> <ins>pointer()</ins>);
  </pre>
  
  <p>
--- 31967,31978 ----
  </blockquote>
  
  <p>
! Change 20.8.1.3.4 [unique.ptr.runtime.modifiers]:
  </p>
  
  <blockquote>
! <pre>
! void reset(<del>T*</del> <ins>pointer</ins> p = <del>0</del> <ins>pointer()</ins>);
  </pre>
  
  <p>
*************** templated overload. <i>-- end note</i>]
*** 31905,31911 ****
  <li>
  
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor]:
  </p>
  
  <blockquote>
--- 31988,31994 ----
  <li>
  
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor]:
  </p>
  
  <blockquote>
*************** required)</ins>.
*** 31939,31948 ****
  
  <hr>
  <h3><a name="674"></a>674. <tt>shared_ptr</tt> interface changes for consistency with N1856</h3>
! <p><b>Section:</b> 20.9.10.2 [util.smartptr.shared] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-05-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1856.html">N1856</a> does not propose
--- 32022,32032 ----
  
  <hr>
  <h3><a name="674"></a>674. <tt>shared_ptr</tt> interface changes for consistency with N1856</h3>
! <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-05-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1856.html">N1856</a> does not propose
*************** and to interoperate with <tt>unique_ptr<
*** 31954,31960 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 20.9.10.2 [util.smartptr.shared] as follows:
  </p>
  
  <blockquote>
--- 32038,32044 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 20.8.2.2 [util.smartptr.shared] as follows:
  </p>
  
  <blockquote>
*************** template&lt;class Y, class D&gt; shared_
*** 31968,31974 ****
  </blockquote>
  
  <p>
! Change 20.9.10.2.1 [util.smartptr.shared.const] as follows:
  </p>
  
  <blockquote>
--- 32052,32058 ----
  </blockquote>
  
  <p>
! Change 20.8.2.2.1 [util.smartptr.shared.const] as follows:
  </p>
  
  <blockquote>
*************** Change 20.9.10.2.1 [util.smartptr.shared
*** 31976,31982 ****
  </blockquote>
  
  <p>
! Add to 20.9.10.2.1 [util.smartptr.shared.const]:
  </p>
  
  <blockquote>
--- 32060,32066 ----
  </blockquote>
  
  <p>
! Add to 20.8.2.2.1 [util.smartptr.shared.const]:
  </p>
  
  <blockquote>
*************** Add to 20.9.10.2.1 [util.smartptr.shared
*** 31997,32003 ****
  </blockquote>
  
  <p>
! Change 20.9.10.2.3 [util.smartptr.shared.assign] as follows:
  </p>
  
  <blockquote>
--- 32081,32087 ----
  </blockquote>
  
  <p>
! Change 20.8.2.2.3 [util.smartptr.shared.assign] as follows:
  </p>
  
  <blockquote>
*************** Change 20.9.10.2.3 [util.smartptr.shared
*** 32005,32011 ****
  </blockquote>
  
  <p>
! Add to 20.9.10.2.3 [util.smartptr.shared.assign]:
  </p>
  
  <blockquote>
--- 32089,32095 ----
  </blockquote>
  
  <p>
! Add to 20.8.2.2.3 [util.smartptr.shared.assign]:
  </p>
  
  <blockquote>
*************** Add to 20.9.10.2.3 [util.smartptr.shared
*** 32025,32031 ****
  
  
  <p><i>[
! Kona (2007): We may need to open an issue (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#743">743</a>) to deal with the question of
  whether <tt>shared_ptr</tt> needs an rvalue <tt>swap</tt>.
  ]</i></p>
  
--- 32109,32115 ----
  
  
  <p><i>[
! Kona (2007): We may need to open an issue (<a href="lwg-defects.html#743">743</a>) to deal with the question of
  whether <tt>shared_ptr</tt> needs an rvalue <tt>swap</tt>.
  ]</i></p>
  
*************** whether <tt>shared_ptr</tt> needs an rva
*** 32035,32044 ****
  
  <hr>
  <h3><a name="675"></a>675. Move assignment of containers</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  James Hopkin pointed out to me that if <tt>vector&lt;T&gt;</tt> move assignment is O(1)
--- 32119,32129 ----
  
  <hr>
  <h3><a name="675"></a>675. Move assignment of containers</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  James Hopkin pointed out to me that if <tt>vector&lt;T&gt;</tt> move assignment is O(1)
*************** the wrong semantics under move assignmen
*** 32047,32053 ****
  moved-from lvalue (destructors could run late).
  </p>
  
! <blockquote><pre><tt>vector&lt;shared_ptr&lt;ostream&gt;&gt;</tt> v1;
  <tt>vector&lt;shared_ptr&lt;ostream&gt;&gt;</tt> v2;
  ...
  v1 = v2;               // #1
--- 32132,32139 ----
  moved-from lvalue (destructors could run late).
  </p>
  
! <blockquote><pre>
! <tt>vector&lt;shared_ptr&lt;ostream&gt;&gt;</tt> v1;
  <tt>vector&lt;shared_ptr&lt;ostream&gt;&gt;</tt> v2;
  ...
  v1 = v2;               // #1
*************** Change 23.2 [container.requirements]:
*** 32086,32092 ****
  <blockquote>
  <table border="1">
  <caption>Table 89: Container requirements</caption>
! <tbody><tr>
  <th>expression</th><th>return type</th><th>operational semantics</th>
  <th>assertion/note pre/post-condition</th><th>complexity</th>
  </tr>
--- 32172,32178 ----
  <blockquote>
  <table border="1">
  <caption>Table 89: Container requirements</caption>
! <tr>
  <th>expression</th><th>return type</th><th>operational semantics</th>
  <th>assertion/note pre/post-condition</th><th>complexity</th>
  </tr>
*************** before this construction
*** 32099,32105 ****
  </td>
  <td><del>(Note C)</del> <ins>linear</ins></td>
  </tr>
! </tbody></table>
  
  <p>
  Notes: the algorithms <tt>swap()</tt>, <tt>equal()</tt> and
--- 32185,32191 ----
  </td>
  <td><del>(Note C)</del> <ins>linear</ins></td>
  </tr>
! </table>
  
  <p>
  Notes: the algorithms <tt>swap()</tt>, <tt>equal()</tt> and
*************** post Sophia Antipolis Howard updated pro
*** 32144,32153 ****
  
  <hr>
  <h3><a name="676"></a>676. Moving the unordered containers</h3>
! <p><b>Section:</b> 23.7 [unord] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Move semantics are missing from the <tt>unordered</tt> containers.  The proposed
--- 32230,32239 ----
  
  <hr>
  <h3><a name="676"></a>676. Moving the unordered containers</h3>
! <p><b>Section:</b> 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Move semantics are missing from the <tt>unordered</tt> containers.  The proposed
*************** on getting the unordered containers "mov
*** 32179,32187 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Review. Alisdair will review proposed wording.
! </blockquote>
  
  <p><i>[
  2009-10-29 Daniel updates wording.
--- 32265,32273 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Review. Alisdair will review proposed wording.
! </p></blockquote>
  
  <p><i>[
  2009-10-29 Daniel updates wording.
*************** Move to Review. Alisdair will review pro
*** 32195,32201 ****
  
  <p><i>[
  2010-02-10 Howard updates wording to reference the unordered container
! requirements table (modified by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>) as much as possible.
  ]</i></p>
  
  
--- 32281,32287 ----
  
  <p><i>[
  2010-02-10 Howard updates wording to reference the unordered container
! requirements table (modified by <a href="lwg-defects.html#704">704</a>) as much as possible.
  ]</i></p>
  
  
*************** that it requires. Please put it back int
*** 32240,32260 ****
  ]</i></p>
  
  
! <blockquote>
  The descriptions of the semantics of the added <tt>insert</tt> functions belong
  in the requirements table. That's where the rest of the <tt>insert</tt>
  functions are.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  Move issue 676 to Ready for Pittsburgh. Nico to send Howard an issue for
  the broader problem.
! </blockquote>
  
  
  
--- 32326,32346 ----
  ]</i></p>
  
  
! <blockquote><p>
  The descriptions of the semantics of the added <tt>insert</tt> functions belong
  in the requirements table. That's where the rest of the <tt>insert</tt>
  functions are.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  Move issue 676 to Ready for Pittsburgh. Nico to send Howard an issue for
  the broader problem.
! </p></blockquote>
  
  
  
*************** San Francisco:
*** 32264,32273 ****
  ]</i></p>
  
  
! <blockquote>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2776.pdf">N2776</a>.
! </blockquote>
  
  <p><i>[
  Rationale is obsolete.
--- 32350,32359 ----
  ]</i></p>
  
  
! <blockquote><p>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2776.pdf">N2776</a>.
! </p></blockquote>
  
  <p><i>[
  Rationale is obsolete.
*************** Rationale is obsolete.
*** 32282,32291 ****
  <p><b><tt>unordered_map</tt></b></p>
  
  <p>
! Change 23.7.1 [unord.map]:
  </p>
  
! <blockquote><pre>class unordered_map
  {
      ...
      unordered_map(const unordered_map&amp;);
--- 32368,32378 ----
  <p><b><tt>unordered_map</tt></b></p>
  
  <p>
! Change 23.5.4 [unord.map]:
  </p>
  
! <blockquote><pre>
! class unordered_map
  {
      ...
      unordered_map(const unordered_map&amp;);
*************** Change 23.7.1 [unord.map]:
*** 32312,32318 ****
  </pre></blockquote>
  
  <p>
! Add to 23.7.1.2 [unord.map.elem]:
  </p>
  
  <blockquote>
--- 32399,32405 ----
  </pre></blockquote>
  
  <p>
! Add to 23.5.4.3 [unord.map.elem]:
  </p>
  
  <blockquote>
*************** Add new section [unord.map.modifiers]:
*** 32364,32370 ****
  </p>
  
  <blockquote>
! <pre><ins>template &lt;class P&gt;
    pair&lt;iterator, bool&gt; insert(P&amp;&amp; x);</ins>
  </pre>
  
--- 32451,32458 ----
  </p>
  
  <blockquote>
! <pre>
! <ins>template &lt;class P&gt;
    pair&lt;iterator, bool&gt; insert(P&amp;&amp; x);</ins>
  </pre>
  
*************** resolution.
*** 32401,32407 ****
  </blockquote>
  
  
! <pre><ins>template &lt;class P&gt;
    iterator insert(const_iterator hint, P&amp;&amp; x);</ins>
  </pre>
  
--- 32489,32496 ----
  </blockquote>
  
  
! <pre>
! <ins>template &lt;class P&gt;
    iterator insert(const_iterator hint, P&amp;&amp; x);</ins>
  </pre>
  
*************** resolution.
*** 32441,32450 ****
  <p><b><tt>unordered_multimap</tt></b></p>
  
  <p>
! Change 23.7.2 [unord.multimap]:
  </p>
  
! <blockquote><pre>class unordered_multimap
  {
      ...
      unordered_multimap(const unordered_multimap&amp;);
--- 32530,32540 ----
  <p><b><tt>unordered_multimap</tt></b></p>
  
  <p>
! Change 23.5.5 [unord.multimap]:
  </p>
  
! <blockquote><pre>
! class unordered_multimap
  {
      ...
      unordered_multimap(const unordered_multimap&amp;);
*************** Add new section [unord.multimap.modifier
*** 32472,32478 ****
  </p>
  
  <blockquote>
! <pre><ins>template &lt;class P&gt;
    iterator insert(P&amp;&amp; x);</ins>
  </pre>
  
--- 32562,32569 ----
  </p>
  
  <blockquote>
! <pre>
! <ins>template &lt;class P&gt;
    iterator insert(P&amp;&amp; x);</ins>
  </pre>
  
*************** resolution.
*** 32504,32510 ****
  
  </blockquote>
  
! <pre><ins>template &lt;class P&gt;
    iterator insert(const_iterator hint, P&amp;&amp; x);</ins>
  </pre>
  
--- 32595,32602 ----
  
  </blockquote>
  
! <pre>
! <ins>template &lt;class P&gt;
    iterator insert(const_iterator hint, P&amp;&amp; x);</ins>
  </pre>
  
*************** resolution.
*** 32544,32553 ****
  <p><b><tt>unordered_set</tt></b></p>
  
  <p>
! Change 23.7.3 [unord.set]:
  </p>
  
! <blockquote><pre>class unordered_set
  {
      ...
      unordered_set(const unordered_set&amp;);
--- 32636,32646 ----
  <p><b><tt>unordered_set</tt></b></p>
  
  <p>
! Change 23.5.6 [unord.set]:
  </p>
  
! <blockquote><pre>
! class unordered_set
  {
      ...
      unordered_set(const unordered_set&amp;);
*************** Change 23.7.3 [unord.set]:
*** 32572,32581 ****
  <p><b><tt>unordered_multiset</tt></b></p>
  
  <p>
! Change 23.7.4 [unord.multiset]:
  </p>
  
! <blockquote><pre>class unordered_multiset
  {
      ...
      unordered_multiset(const unordered_multiset&amp;);
--- 32665,32675 ----
  <p><b><tt>unordered_multiset</tt></b></p>
  
  <p>
! Change 23.5.7 [unord.multiset]:
  </p>
  
! <blockquote><pre>
! class unordered_multiset
  {
      ...
      unordered_multiset(const unordered_multiset&amp;);
*************** Change 23.7.4 [unord.multiset]:
*** 32605,32614 ****
  
  <hr>
  <h3><a name="677"></a>677. Weaknesses in seed_seq::randomize [rand.util.seedseq]</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2007-05-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>seed_seq::randomize</tt> provides a mechanism for initializing random number
--- 32699,32708 ----
  
  <hr>
  <h3><a name="677"></a>677. Weaknesses in seed_seq::randomize [rand.util.seedseq]</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2007-05-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>seed_seq::randomize</tt> provides a mechanism for initializing random number
*************** The LWG voted to accelerate this issue t
*** 32709,32718 ****
  
  <hr>
  <h3><a name="678"></a>678. Changes for [rand.req.eng]</h3>
! <p><b>Section:</b> 26.5.1.4 [rand.req.eng] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2007-05-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.req.eng">issues</a> in [rand.req.eng].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 26.5.1.4 [rand.req.eng] Random number engine requirements:
--- 32803,32812 ----
  
  <hr>
  <h3><a name="678"></a>678. Changes for [rand.req.eng]</h3>
! <p><b>Section:</b> 26.5.1.4 [rand.req.eng] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2007-05-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.req.eng">issues</a> in [rand.req.eng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Section 26.5.1.4 [rand.req.eng] Random number engine requirements:
*************** Section 26.5.1.4 [rand.req.eng] Random n
*** 32720,32726 ****
  
  <p>
  This change follows naturally from the proposed change to
! <tt>seed_seq::randomize</tt> in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#677">677</a>.
  </p>
  
  <p>
--- 32814,32820 ----
  
  <p>
  This change follows naturally from the proposed change to
! <tt>seed_seq::randomize</tt> in <a href="lwg-defects.html#677">677</a>.
  </p>
  
  <p>
*************** The LWG voted to accelerate this issue t
*** 32764,32780 ****
  
  <hr>
  <h3><a name="679"></a>679. resize parameter by value</h3>
! <p><b>Section:</b> 23.3 [sequences] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-06-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequences">issues</a> in [sequences].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The C++98 standard specifies that one member function alone of the containers
  passes its parameter (<tt>T</tt>) by value instead of by const reference:
  </p>
  
! <blockquote><pre>void resize(size_type sz, T c = T());
  </pre></blockquote>
  
  <p>
--- 32858,32875 ----
  
  <hr>
  <h3><a name="679"></a>679. resize parameter by value</h3>
! <p><b>Section:</b> 23.3 [sequences] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-06-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequences">issues</a> in [sequences].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The C++98 standard specifies that one member function alone of the containers
  passes its parameter (<tt>T</tt>) by value instead of by const reference:
  </p>
  
! <blockquote><pre>
! void resize(size_type sz, T c = T());
  </pre></blockquote>
  
  <p>
*************** value has been:
*** 32787,32793 ****
  <p>
  So that self referencing statements are guaranteed to work, for example:
  </p>
! <blockquote><pre>v.resize(v.size() + 1, v[0]);
  </pre></blockquote>
  </blockquote>
  
--- 32882,32889 ----
  <p>
  So that self referencing statements are guaranteed to work, for example:
  </p>
! <blockquote><pre>
! v.resize(v.size() + 1, v[0]);
  </pre></blockquote>
  </blockquote>
  
*************** So that self referencing statements are
*** 32795,32801 ****
  However this rationale is not convincing as the signature for <tt>push_back</tt> is:
  </p>
  
! <blockquote><pre>void push_back(const T&amp; x);
  </pre></blockquote>
  
  <p>
--- 32891,32898 ----
  However this rationale is not convincing as the signature for <tt>push_back</tt> is:
  </p>
  
! <blockquote><pre>
! void push_back(const T&amp; x);
  </pre></blockquote>
  
  <p>
*************** And <tt>push_back</tt> has similar seman
*** 32803,32809 ****
  And <tt>push_back</tt> must also work in the self referencing case:
  </p>
  
! <blockquote><pre>v.push_back(v[0]);  // must work
  </pre></blockquote>
  
  <p>
--- 32900,32907 ----
  And <tt>push_back</tt> must also work in the self referencing case:
  </p>
  
! <blockquote><pre>
! v.push_back(v[0]);  // must work
  </pre></blockquote>
  
  <p>
*************** Even with move semantics available, pass
*** 32817,32823 ****
  Consider for example <tt>vector&lt;vector&lt;int&gt;&gt;</tt>:
  </p>
  
! <blockquote><pre>std::vector&lt;int&gt; x(1000);
  std::vector&lt;std::vector&lt;int&gt;&gt; v;
  ...
  v.resize(v.size()+1, x);
--- 32915,32922 ----
  Consider for example <tt>vector&lt;vector&lt;int&gt;&gt;</tt>:
  </p>
  
! <blockquote><pre>
! std::vector&lt;int&gt; x(1000);
  std::vector&lt;std::vector&lt;int&gt;&gt; v;
  ...
  v.resize(v.size()+1, x);
*************** CodeWarrior library with no reports of p
*** 32847,32897 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 23.3.2 [deque], p2:
  </p>
  
! <blockquote><pre>class deque {
     ...
     void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.3.2.2 [deque.capacity], p3:
  </p>
  
! <blockquote><pre>void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.3.4 [list], p2:
  </p>
  
! <blockquote><pre>class list {
     ...
     void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.3.4.2 [list.capacity], p3:
  </p>
  
! <blockquote><pre>void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.4.1 [vector], p2:
  </p>
  
! <blockquote><pre>class vector {
     ...
     void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.4.1.2 [vector.capacity], p11:
  </p>
  
! <blockquote><pre>void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  
--- 32946,33002 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 23.3.3 [deque], p2:
  </p>
  
! <blockquote><pre>
! class deque {
     ...
     void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.3.3.3 [deque.capacity], p3:
  </p>
  
! <blockquote><pre>
! void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.3.5 [list], p2:
  </p>
  
! <blockquote><pre>
! class list {
     ...
     void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.3.5.3 [list.capacity], p3:
  </p>
  
! <blockquote><pre>
! void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.3.6 [vector], p2:
  </p>
  
! <blockquote><pre>
! class vector {
     ...
     void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  <p>
! Change 23.3.6.3 [vector.capacity], p11:
  </p>
  
! <blockquote><pre>
! void resize(size_type sz, <ins>const </ins>T<ins>&amp;</ins> c);
  </pre></blockquote>
  
  
*************** Change 23.4.1.2 [vector.capacity], p11:
*** 32901,32910 ****
  
  <hr>
  <h3><a name="680"></a>680. move_iterator operator-&gt; return</h3>
! <p><b>Section:</b> 24.5.3.1 [move.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-06-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#move.iterator">issues</a> in [move.iterator].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>move_iterator</tt>'s <tt>operator-&gt;</tt> return type <tt>pointer</tt>
--- 33006,33015 ----
  
  <hr>
  <h3><a name="680"></a>680. move_iterator operator-&gt; return</h3>
! <p><b>Section:</b> 24.5.3.1 [move.iterator] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-06-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#move.iterator">issues</a> in [move.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>move_iterator</tt>'s <tt>operator-&gt;</tt> return type <tt>pointer</tt>
*************** does not consistently match the type whi
*** 32912,32918 ****
  in 24.5.3.3.5 [move.iter.op.ref].
  </p>
  
! <blockquote><pre>template &lt;class Iterator&gt;
  class move_iterator {
  public:
      ...
--- 33017,33024 ----
  in 24.5.3.3.5 [move.iter.op.ref].
  </p>
  
! <blockquote><pre>
! template &lt;class Iterator&gt;
  class move_iterator {
  public:
      ...
*************** finds a non-class type, the second solut
*** 32956,32962 ****
  Change the synopsis in 24.5.3.1 [move.iterator]:
  </p>
  
! <blockquote><pre>typedef <del>typename iterator_traits&lt;</del>Iterator<del>&gt;::pointer</del> pointer;
  </pre></blockquote>
  
  
--- 33062,33069 ----
  Change the synopsis in 24.5.3.1 [move.iterator]:
  </p>
  
! <blockquote><pre>
! typedef <del>typename iterator_traits&lt;</del>Iterator<del>&gt;::pointer</del> pointer;
  </pre></blockquote>
  
  
*************** Change the synopsis in 24.5.3.1 [move.it
*** 32966,32975 ****
  
  <hr>
  <h3><a name="681"></a>681. Operator functions impossible to compare are defined in [re.submatch.op]</h3>
! <p><b>Section:</b> 28.9.2 [re.submatch.op] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nozomu Katoo <b>Opened:</b> 2007-05-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.submatch.op">issues</a> in [re.submatch.op].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 28.9.2 [re.submatch.op] of N2284, 
--- 33073,33082 ----
  
  <hr>
  <h3><a name="681"></a>681. Operator functions impossible to compare are defined in [re.submatch.op]</h3>
! <p><b>Section:</b> 28.9.2 [re.submatch.op] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Nozomu Katoo <b>Opened:</b> 2007-05-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.submatch.op">issues</a> in [re.submatch.op].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 28.9.2 [re.submatch.op] of N2284, 
*************** operator functions numbered 31-42 seem i
*** 32977,32983 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class BiIter&gt;
     bool operator==(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
                      const sub_match&lt;BiIter&gt;&amp; rhs);
  </pre>
--- 33084,33091 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class BiIter&gt;
     bool operator==(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
                      const sub_match&lt;BiIter&gt;&amp; rhs);
  </pre>
*************** The LWG voted to accelerate this issue t
*** 33015,33030 ****
  
  <hr>
  <h3><a name="682"></a>682. basic_regex ctor takes InputIterator or ForwardIterator?</h3>
! <p><b>Section:</b> 28.8.2 [re.regex.construct] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2007-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.regex.construct">issues</a> in [re.regex.construct].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Looking at N2284, 28.8 [re.regex], p3 <tt>basic_regex</tt> class template synopsis shows this 
  constructor: 
  </p>
! <blockquote><pre>template &lt;class InputIterator&gt;
       basic_regex(InputIterator first, InputIterator last, 
                   flag_type f = regex_constants::ECMAScript);
  </pre></blockquote>
--- 33123,33139 ----
  
  <hr>
  <h3><a name="682"></a>682. basic_regex ctor takes InputIterator or ForwardIterator?</h3>
! <p><b>Section:</b> 28.8.2 [re.regex.construct] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Eric Niebler <b>Opened:</b> 2007-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.regex.construct">issues</a> in [re.regex.construct].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Looking at N2284, 28.8 [re.regex], p3 <tt>basic_regex</tt> class template synopsis shows this 
  constructor: 
  </p>
! <blockquote><pre>
! template &lt;class InputIterator&gt;
       basic_regex(InputIterator first, InputIterator last, 
                   flag_type f = regex_constants::ECMAScript);
  </pre></blockquote>
*************** constructor:
*** 33033,33039 ****
  In 28.8.2 [re.regex.construct], p15, the constructor appears with this signature: 
  </p>
  
! <blockquote><pre>template &lt;class ForwardIterator&gt;
       basic_regex(ForwardIterator first, ForwardIterator last, 
                   flag_type f = regex_constants::ECMAScript);
  </pre></blockquote>
--- 33142,33149 ----
  In 28.8.2 [re.regex.construct], p15, the constructor appears with this signature: 
  </p>
  
! <blockquote><pre>
! template &lt;class ForwardIterator&gt;
       basic_regex(ForwardIterator first, ForwardIterator last, 
                   flag_type f = regex_constants::ECMAScript);
  </pre></blockquote>
*************** The LWG voted to accelerate this issue t
*** 33077,33090 ****
  
  <hr>
  <h3><a name="685"></a>685. reverse_iterator/move_iterator difference has invalid signatures</h3>
! <p><b>Section:</b> 24.5.1.3.19 [reverse.iter.opdiff], 24.5.3.3.14 [move.iter.nonmember] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-06-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In C++03 the difference between two <tt>reverse_iterators</tt>
  </p>
! <blockquote><pre>ri1 - ri2
  </pre></blockquote>
  <p>
  is possible to compute only if both iterators have the same base 
--- 33187,33201 ----
  
  <hr>
  <h3><a name="685"></a>685. reverse_iterator/move_iterator difference has invalid signatures</h3>
! <p><b>Section:</b> 24.5.1.3.19 [reverse.iter.opdiff], 24.5.3.3.14 [move.iter.nonmember] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-06-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In C++03 the difference between two <tt>reverse_iterators</tt>
  </p>
! <blockquote><pre>
! ri1 - ri2
  </pre></blockquote>
  <p>
  is possible to compute only if both iterators have the same base 
*************** iterator. The result type is the <tt>dif
*** 33093,33099 ****
  <p>
  In the current draft, the operator is defined as 24.5.1.3.19 [reverse.iter.opdiff] 
  </p>
! <blockquote><pre>template&lt;class Iterator1, class Iterator2&gt; 
  typename reverse_iterator&lt;Iterator&gt;::difference_type 
     operator-(const reverse_iterator&lt;Iterator1&gt;&amp; x, 
                      const reverse_iterator&lt;Iterator2&gt;&amp; y);
--- 33204,33211 ----
  <p>
  In the current draft, the operator is defined as 24.5.1.3.19 [reverse.iter.opdiff] 
  </p>
! <blockquote><pre>
! template&lt;class Iterator1, class Iterator2&gt; 
  typename reverse_iterator&lt;Iterator&gt;::difference_type 
     operator-(const reverse_iterator&lt;Iterator1&gt;&amp; x, 
                      const reverse_iterator&lt;Iterator2&gt;&amp; y);
*************** Change the synopsis in 24.5.1.1 [reverse
*** 33119,33125 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class Iterator1, class Iterator2&gt; 
    <del>typename reverse_iterator&lt;Iterator&gt;::difference_type</del> <ins>auto</ins> operator-( 
      const reverse_iterator&lt;Iterator1&gt;&amp; x, 
      const reverse_iterator&lt;Iterator2&gt;&amp; y)<ins> -&gt; decltype(y.current - x.current)</ins>;
--- 33231,33238 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Iterator1, class Iterator2&gt; 
    <del>typename reverse_iterator&lt;Iterator&gt;::difference_type</del> <ins>auto</ins> operator-( 
      const reverse_iterator&lt;Iterator1&gt;&amp; x, 
      const reverse_iterator&lt;Iterator2&gt;&amp; y)<ins> -&gt; decltype(y.current - x.current)</ins>;
*************** Change 24.5.1.3.19 [reverse.iter.opdiff]
*** 33131,33137 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class Iterator1, class Iterator2&gt; 
    <del>typename reverse_iterator&lt;Iterator&gt;::difference_type</del> <ins>auto</ins> operator-( 
      const reverse_iterator&lt;Iterator1&gt;&amp; x, 
      const reverse_iterator&lt;Iterator2&gt;&amp; y)<ins> -&gt; decltype(y.current - x.current)</ins>;
--- 33244,33251 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Iterator1, class Iterator2&gt; 
    <del>typename reverse_iterator&lt;Iterator&gt;::difference_type</del> <ins>auto</ins> operator-( 
      const reverse_iterator&lt;Iterator1&gt;&amp; x, 
      const reverse_iterator&lt;Iterator2&gt;&amp; y)<ins> -&gt; decltype(y.current - x.current)</ins>;
*************** Change the synopsis in 24.5.3.1 [move.it
*** 33149,33155 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class Iterator1, class Iterator2&gt; 
    <del>typename move_iterator&lt;Iterator&gt;::difference_type</del> <ins>auto</ins> operator-( 
      const move_iterator&lt;Iterator1&gt;&amp; x, 
      const move_iterator&lt;Iterator2&gt;&amp; y)<ins> -&gt; decltype(x.base() - y.base())</ins>;
--- 33263,33270 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Iterator1, class Iterator2&gt; 
    <del>typename move_iterator&lt;Iterator&gt;::difference_type</del> <ins>auto</ins> operator-( 
      const move_iterator&lt;Iterator1&gt;&amp; x, 
      const move_iterator&lt;Iterator2&gt;&amp; y)<ins> -&gt; decltype(x.base() - y.base())</ins>;
*************** Change 24.5.3.3.14 [move.iter.nonmember]
*** 33161,33167 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class Iterator1, class Iterator2&gt; 
    <del>typename move_iterator&lt;Iterator&gt;::difference_type</del> <ins>auto</ins> operator-( 
      const move_iterator&lt;Iterator1&gt;&amp; x, 
      const move_iterator&lt;Iterator2&gt;&amp; y)<ins> -&gt; decltype(x.base() - y.base())</ins>;
--- 33276,33283 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Iterator1, class Iterator2&gt; 
    <del>typename move_iterator&lt;Iterator&gt;::difference_type</del> <ins>auto</ins> operator-( 
      const move_iterator&lt;Iterator1&gt;&amp; x, 
      const move_iterator&lt;Iterator2&gt;&amp; y)<ins> -&gt; decltype(x.base() - y.base())</ins>;
*************** goes in.
*** 33186,33195 ****
  
  <hr>
  <h3><a name="687"></a>687. shared_ptr conversion constructor not constrained</h3>
! <p><b>Section:</b> 20.9.10.2.1 [util.smartptr.shared.const], 20.9.10.3.1 [util.smartptr.weak.const] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-05-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Since all conversions from <tt>shared_ptr&lt;T&gt;</tt> to <tt>shared_ptr&lt;U&gt;</tt> have the same
--- 33302,33311 ----
  
  <hr>
  <h3><a name="687"></a>687. shared_ptr conversion constructor not constrained</h3>
! <p><b>Section:</b> 20.8.2.2.1 [util.smartptr.shared.const], 20.8.2.3.1 [util.smartptr.weak.const] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-05-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Since all conversions from <tt>shared_ptr&lt;T&gt;</tt> to <tt>shared_ptr&lt;U&gt;</tt> have the same
*************** rank regardless of the relationship betw
*** 33197,33203 ****
  code that works with raw pointers fails with <tt>shared_ptr</tt>:
  </p>
  
! <blockquote><pre>void f( shared_ptr&lt;void&gt; );
  void f( shared_ptr&lt;int&gt; );
  
  int main()
--- 33313,33320 ----
  code that works with raw pointers fails with <tt>shared_ptr</tt>:
  </p>
  
! <blockquote><pre>
! void f( shared_ptr&lt;void> );
  void f( shared_ptr&lt;int&gt; );
  
  int main()
*************** overload resolution when the pointer typ
*** 33215,33221 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9.10.2.1 [util.smartptr.shared.const], change:
  </p>
  
  <blockquote><p>
--- 33332,33338 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.8.2.2.1 [util.smartptr.shared.const], change:
  </p>
  
  <blockquote><p>
*************** to <tt>T*</tt>.
*** 33226,33236 ****
  </p></blockquote>
  
  <p>
! In 20.9.10.3.1 [util.smartptr.weak.const], change:
  </p>
  
  <blockquote>
! <pre><del>template&lt;class Y&gt; weak_ptr(shared_ptr&lt;Y&gt; const&amp; r);</del>
  <del>weak_ptr(weak_ptr const&amp; r);</del>
  <del>template&lt;class Y&gt; weak_ptr(weak_ptr&lt;Y&gt; const&amp; r);</del>
  <ins>weak_ptr(weak_ptr const&amp; r);</ins>
--- 33343,33354 ----
  </p></blockquote>
  
  <p>
! In 20.8.2.3.1 [util.smartptr.weak.const], change:
  </p>
  
  <blockquote>
! <pre>
! <del>template&lt;class Y&gt; weak_ptr(shared_ptr&lt;Y&gt; const&amp; r);</del>
  <del>weak_ptr(weak_ptr const&amp; r);</del>
  <del>template&lt;class Y&gt; weak_ptr(weak_ptr&lt;Y&gt; const&amp; r);</del>
  <ins>weak_ptr(weak_ptr const&amp; r);</ins>
*************** overload resolution unless</ins> <tt>Y*<
*** 33252,33261 ****
  
  <hr>
  <h3><a name="688"></a>688. reference_wrapper, cref unsafe, allow binding to rvalues</h3>
! <p><b>Section:</b> 20.8.4.1 [refwrap.const] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-05-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#refwrap.const">issues</a> in [refwrap.const].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A <tt>reference_wrapper</tt> can be constructed from an rvalue, either by using
--- 33370,33379 ----
  
  <hr>
  <h3><a name="688"></a>688. reference_wrapper, cref unsafe, allow binding to rvalues</h3>
! <p><b>Section:</b> 20.9.4.1 [refwrap.const] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-05-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#refwrap.const">issues</a> in [refwrap.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A <tt>reference_wrapper</tt> can be constructed from an rvalue, either by using
*************** overload.
*** 33296,33308 ****
  Without:
  </p>
  
! <blockquote><pre>template &lt;class T&gt; void ref(const T&amp;&amp; t) = delete;
  </pre></blockquote>
  <p>
  I believe this program will compile:
  </p>
  
! <blockquote><pre>#include &lt;functional&gt;
  
  struct A {};
  
--- 33414,33428 ----
  Without:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; void ref(const T&amp;&amp; t) = delete;
  </pre></blockquote>
  <p>
  I believe this program will compile:
  </p>
  
! <blockquote><pre>
! #include &lt;functional&gt;
  
  struct A {};
  
*************** int main()
*** 33316,33335 ****
  <p>
  I.e. in:
  </p>
! <blockquote><pre>template &lt;ObjectType T&gt; reference_wrapper&lt;T&gt; ref(T&amp; t);
  </pre></blockquote>
  
  <p>
  this:
  </p>
  
! <blockquote><pre>ref(source())
  </pre></blockquote>
  <p>
  deduces <tt>T</tt> as <tt>const A</tt>, and so:
  </p>
  
! <blockquote><pre>ref(const A&amp; t)
  </pre></blockquote>
  
  <p>
--- 33436,33458 ----
  <p>
  I.e. in:
  </p>
! <blockquote><pre>
! template &lt;ObjectType T&gt; reference_wrapper&lt;T&gt; ref(T&amp; t);
  </pre></blockquote>
  
  <p>
  this:
  </p>
  
! <blockquote><pre>
! ref(source())
  </pre></blockquote>
  <p>
  deduces <tt>T</tt> as <tt>const A</tt>, and so:
  </p>
  
! <blockquote><pre>
! ref(const A&amp; t)
  </pre></blockquote>
  
  <p>
*************** comment and am in favor of the proposed
*** 33347,33364 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.8 [function.objects], add the following two signatures to the synopsis:
  </p>
  
! <blockquote><pre>template &lt;class T&gt; void ref(const T&amp;&amp; t) = delete;
  template &lt;class T&gt; void cref(const T&amp;&amp; t) = delete;
  </pre></blockquote>
  
--- 33470,33488 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9 [function.objects], add the following two signatures to the synopsis:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; void ref(const T&amp;&amp; t) = delete;
  template &lt;class T&gt; void cref(const T&amp;&amp; t) = delete;
  </pre></blockquote>
  
*************** the "special deduction rule" is disabled
*** 33391,33400 ****
  
  <hr>
  <h3><a name="689"></a>689. reference_wrapper constructor overly constrained</h3>
! <p><b>Section:</b> 20.8.4.1 [refwrap.const] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-05-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#refwrap.const">issues</a> in [refwrap.const].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The constructor of <tt>reference_wrapper</tt> is currently <tt>explicit</tt>. The primary
--- 33515,33524 ----
  
  <hr>
  <h3><a name="689"></a>689. reference_wrapper constructor overly constrained</h3>
! <p><b>Section:</b> 20.9.4.1 [refwrap.const] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-05-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#refwrap.const">issues</a> in [refwrap.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The constructor of <tt>reference_wrapper</tt> is currently <tt>explicit</tt>. The primary
*************** proposed resolution of the previous issu
*** 33421,33430 ****
  
  <hr>
  <h3><a name="691"></a>691. const_local_iterator cbegin, cend missing from TR1</h3>
! <p><b>Section:</b> 23.7 [unord], TR1 6.3 [tr.hash] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Joaquín M López Muñoz <b>Opened:</b> 2007-06-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The last version of TR1 does not include the following member
--- 33545,33554 ----
  
  <hr>
  <h3><a name="691"></a>691. const_local_iterator cbegin, cend missing from TR1</h3>
! <p><b>Section:</b> 23.5 [unord], TR1 6.3 [tr.hash] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz <b>Opened:</b> 2007-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The last version of TR1 does not include the following member
*************** functions
*** 33432,33438 ****
  for unordered containers:
  </p>
  
! <blockquote><pre>const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;
  </pre></blockquote>
  
--- 33556,33563 ----
  for unordered containers:
  </p>
  
! <blockquote><pre>
! const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;
  </pre></blockquote>
  
*************** requirements) in section 23.2.5 [unord.r
*** 33456,33462 ****
  <blockquote>
  <table border="1">
  <caption>Unordered associative container requirements (in addition to container)</caption>
! <tbody><tr>
  <th>expression</th> <th>return type</th> <th>assertion/note pre/post-condition</th> <th>complexity</th>
  </tr>
  <tr>
--- 33581,33587 ----
  <blockquote>
  <table border="1">
  <caption>Unordered associative container requirements (in addition to container)</caption>
! <tr>
  <th>expression</th> <th>return type</th> <th>assertion/note pre/post-condition</th> <th>complexity</th>
  </tr>
  <tr>
*************** requirements) in section 23.2.5 [unord.r
*** 33465,33502 ****
  <tr>
  <td><ins><tt>b.cend(n)</tt></ins></td> <td><ins><tt>const_local_iterator</tt></ins></td> <td><ins><tt>n</tt> shall be in the range <tt>[0, bucket_count())</tt>.</ins></td> <td><ins>Constant</ins></td> 
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
! Add to the synopsis in 23.7.1 [unord.map]:
  </p>
  
! <blockquote><pre><ins>const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;</ins>
  </pre></blockquote>
  
  <p>
! Add to the synopsis in 23.7.2 [unord.multimap]:
  </p>
  
! <blockquote><pre><ins>const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;</ins>
  </pre></blockquote>
  
  <p>
! Add to the synopsis in 23.7.3 [unord.set]:
  </p>
  
! <blockquote><pre><ins>const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;</ins>
  </pre></blockquote>
  
  <p>
! Add to the synopsis in 23.7.4 [unord.multiset]:
  </p>
  
! <blockquote><pre><ins>const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;</ins>
  </pre></blockquote>
  
--- 33590,33631 ----
  <tr>
  <td><ins><tt>b.cend(n)</tt></ins></td> <td><ins><tt>const_local_iterator</tt></ins></td> <td><ins><tt>n</tt> shall be in the range <tt>[0, bucket_count())</tt>.</ins></td> <td><ins>Constant</ins></td> 
  </tr>
! </table>
  </blockquote>
  
  <p>
! Add to the synopsis in 23.5.4 [unord.map]:
  </p>
  
! <blockquote><pre>
! <ins>const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;</ins>
  </pre></blockquote>
  
  <p>
! Add to the synopsis in 23.5.5 [unord.multimap]:
  </p>
  
! <blockquote><pre>
! <ins>const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;</ins>
  </pre></blockquote>
  
  <p>
! Add to the synopsis in 23.5.6 [unord.set]:
  </p>
  
! <blockquote><pre>
! <ins>const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;</ins>
  </pre></blockquote>
  
  <p>
! Add to the synopsis in 23.5.7 [unord.multiset]:
  </p>
  
! <blockquote><pre>
! <ins>const_local_iterator cbegin(size_type n) const;
  const_local_iterator cend(size_type n) const;</ins>
  </pre></blockquote>
  
*************** const_local_iterator cend(size_type n) c
*** 33507,33516 ****
  
  <hr>
  <h3><a name="692"></a>692. <code>get_money</code> and <code>put_money</code> should be formatted I/O functions</h3>
! <p><b>Section:</b> 27.7.4 [ext.manip] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ext.manip">issues</a> in [ext.manip].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In a private email Bill Plauger notes:
--- 33636,33645 ----
  
  <hr>
  <h3><a name="692"></a>692. <code>get_money</code> and <code>put_money</code> should be formatted I/O functions</h3>
! <p><b>Section:</b> 27.7.5 [ext.manip] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ext.manip">issues</a> in [ext.manip].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In a private email Bill Plauger notes:
*************** Martin's response:
*** 33532,33565 ****
  </p>
  <blockquote><p>
  I agree that the manipulators should handle exceptions the same way as
! formatted I/O functions do. The text in N2072 assumes so but the
  <i>Returns</i> clause explicitly omits exception handling for the sake
  of brevity. The spec should be clarified to that effect.
  </p>
  <p>
  As for dealing  with whitespace, I also agree it  would make sense for
  the extractors  and inserters involving the new  manipulators to treat
! it the same way as formatted I/O.
  </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add  a new  paragraph immediately  above  p4 of 27.7.4 [ext.manip] with  the
  following text:
  </p>
  <blockquote><p>
  <i>Effects</i>:  The   expression  <code><i>in</i> &gt;&gt; get_money(mon, intl)</code>
  described below behaves as a formatted input function (as
! described in 27.7.1.2.1 [istream.formatted.reqmts]).
  </p></blockquote>
  <p>
! Also change p4 of 27.7.4 [ext.manip] as follows:
  </p>
  <blockquote><p>
  <i>Returns</i>: An object <code>s</code> of unspecified type such that
  if <code>in</code> is  an object of type <code>basic_istream&lt;charT,
! traits&gt;</code>    then    the    expression   <code><i>in</i> &gt;&gt; get_money(mon, intl)</code> behaves as <ins>a formatted input function
  that    calls    </ins><code>f(in, mon, intl)</code><del>    were
  called</del>. The function <code>f</code> can be defined as...
  </p></blockquote>
--- 33661,33695 ----
  </p>
  <blockquote><p>
  I agree that the manipulators should handle exceptions the same way as
! formatted I&#47;O functions do. The text in N2072 assumes so but the
  <i>Returns</i> clause explicitly omits exception handling for the sake
  of brevity. The spec should be clarified to that effect.
  </p>
  <p>
  As for dealing  with whitespace, I also agree it  would make sense for
  the extractors  and inserters involving the new  manipulators to treat
! it the same way as formatted I&#47;O.
  </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add  a new  paragraph immediately  above  p4 of 27.7.5 [ext.manip] with  the
  following text:
  </p>
  <blockquote><p>
  <i>Effects</i>:  The   expression  <code><i>in</i> &gt;&gt; get_money(mon, intl)</code>
  described below behaves as a formatted input function (as
! described in 27.7.2.2.1 [istream.formatted.reqmts]).
  </p></blockquote>
  <p>
! Also change p4 of 27.7.5 [ext.manip] as follows:
  </p>
  <blockquote><p>
  <i>Returns</i>: An object <code>s</code> of unspecified type such that
  if <code>in</code> is  an object of type <code>basic_istream&lt;charT,
! traits&gt;</code>    then    the    expression   <code><i>in</i> &gt;&gt; 
! get_money(mon, intl)</code> behaves as <ins>a formatted input function
  that    calls    </ins><code>f(in, mon, intl)</code><del>    were
  called</del>. The function <code>f</code> can be defined as...
  </p></blockquote>
*************** post Bellevue:
*** 33570,33592 ****
  ]</i></p>
  
  
! <blockquote>
  We recommend moving immediately to Review. We've looked at the issue and
  have a consensus that the proposed resolution is correct, but want an
  iostream expert to sign off. Alisdair has taken the action item to putt
  this up on the reflector for possible movement by Howard to Tenatively
  Ready.
! </blockquote>
  
  
  
  
  <hr>
  <h3><a name="693"></a>693. <code>std::bitset::all()</code> missing</h3>
! <p><b>Section:</b> 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The  <code>bitset</code> class template  provides the  member function
--- 33700,33723 ----
  ]</i></p>
  
  
! <blockquote><p>
  We recommend moving immediately to Review. We've looked at the issue and
  have a consensus that the proposed resolution is correct, but want an
  iostream expert to sign off. Alisdair has taken the action item to putt
  this up on the reflector for possible movement by Howard to Tenatively
  Ready.
! </p></blockquote>
  
  
  
  
  <hr>
  <h3><a name="693"></a>693. <code>std::bitset::all()</code> missing</h3>
! <p><b>Section:</b> 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The  <code>bitset</code> class template  provides the  member function
*************** the first word with a zero bit).
*** 33608,33619 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add  a declaration of the new  member function <code>all()</code> to the
! defintion of the <code>bitset</code> template in 20.5 [template.bitset], p1,
  right above the declaration of <code>any()</code> as shown below:
  </p>
  
! <blockquote><pre>bool operator!=(const bitset&lt;N&gt;&amp; rhs) const;
  bool test(size_t pos) const;
  <ins>bool all() const;</ins>
  bool any() const;
--- 33739,33751 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a declaration of the new  member function <code>all()</code> to the
! defintion of the <code>bitset</code> template in 20.6 [template.bitset], p1,
  right above the declaration of <code>any()</code> as shown below:
  </p>
  
! <blockquote><pre>
! bool operator!=(const bitset&lt;N&gt;&amp; rhs) const;
  bool test(size_t pos) const;
  <ins>bool all() const;</ins>
  bool any() const;
*************** bool none() const;
*** 33621,33634 ****
  </pre></blockquote>
  
  <p>
! Add a description of the new member function to the end of 20.5.2 [bitset.members] with the following text:
  </p>
  <blockquote><p>
  <code>bool all() const;</code>
  </p>
! <blockquote>
  <i>Returns</i>: <code>count() == size()</code>.
! </blockquote>
  </blockquote>
  
  <p>
--- 33753,33766 ----
  </pre></blockquote>
  
  <p>
! Add a description of the new member function to the end of 20.6.2 [bitset.members] with the following text:
  </p>
  <blockquote><p>
  <code>bool all() const;</code>
  </p>
! <blockquote><p>
  <i>Returns</i>: <code>count() == size()</code>.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** is one</del><ins><code>count() == 0</cod
*** 33662,33671 ****
  
  <hr>
  <h3><a name="694"></a>694. <code>std::bitset</code> and <code>long long</code></h3>
! <p><b>Section:</b> 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Objects of the  <code>bitset</code> class template specializations can
--- 33794,33804 ----
  
  <hr>
  <h3><a name="694"></a>694. <code>std::bitset</code> and <code>long long</code></h3>
! <p><b>Section:</b> 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Objects of the  <code>bitset</code> class template specializations can
*************** template tricks to  achieve the same eff
*** 33690,33696 ****
  ambiguities or changes in behavior.)
  </p>
  <blockquote>
! <pre>// [bitset.cons] constructors:
  bitset();
  bitset(unsigned <ins>long</ins> long val);
  template&lt;class charT, class traits, class Allocator&gt;
--- 33823,33830 ----
  ambiguities or changes in behavior.)
  </p>
  <blockquote>
! <pre>
! // [bitset.cons] constructors:
  bitset();
  bitset(unsigned <ins>long</ins> long val);
  template&lt;class charT, class traits, class Allocator&gt;
*************** explicit bitset(
*** 33702,33714 ****
  </pre>
  </blockquote>
  <p>
! Make a corresponding change in 20.5.1 [bitset.cons], p2:
  </p>
  <blockquote>
  <p>
  <code>bitset(unsigned <ins>long</ins> long val);</code>
  </p>
! <blockquote>
  <i>Effects</i>:  Constructs   an  object  of   class  bitset&lt;N&gt;,
  initializing  the  first <code><i>M</i></code>  bit  positions to  the
  corresponding      bit     values      in     <code><i>val</i></code>.
--- 33836,33848 ----
  </pre>
  </blockquote>
  <p>
! Make a corresponding change in 20.6.1 [bitset.cons], p2:
  </p>
  <blockquote>
  <p>
  <code>bitset(unsigned <ins>long</ins> long val);</code>
  </p>
! <blockquote><p>
  <i>Effects</i>:  Constructs   an  object  of   class  bitset&lt;N&gt;,
  initializing  the  first <code><i>M</i></code>  bit  positions to  the
  corresponding      bit     values      in     <code><i>val</i></code>.
*************** number of bits in  the value representat
*** 33717,33723 ****
  <code>unsigned  <ins> long</ins> long</code>.   If  <code><i>M</i> &lt;
  <i>N</i></code>  <ins>is  <code>true</code></ins>,  the remaining  bit
  positions are initialized to zero.
! </blockquote>
  </blockquote>
  
  <p>
--- 33851,33857 ----
  <code>unsigned  <ins> long</ins> long</code>.   If  <code><i>M</i> &lt;
  <i>N</i></code>  <ins>is  <code>true</code></ins>,  the remaining  bit
  positions are initialized to zero.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** Additionally, introduce a new member fun
*** 33725,33734 ****
  to make  it possible to  convert <code>bitset</code> to values  of the
  new  type. Add  the following  declaration  to the  definition of  the
  template, immediate  after the declaration  of <code>to_ulong()</code>
! in 20.5 [template.bitset], p1, as shown below:
  </p>
  <blockquote>
! <pre>// element access:
  bool operator[](size_t pos) const; // for b[i];
  reference operator[](size_t pos); // for b[i];
  unsigned long to_ulong() const;
--- 33859,33869 ----
  to make  it possible to  convert <code>bitset</code> to values  of the
  new  type. Add  the following  declaration  to the  definition of  the
  template, immediate  after the declaration  of <code>to_ulong()</code>
! in 20.6 [template.bitset], p1, as shown below:
  </p>
  <blockquote>
! <pre>
! // element access:
  bool operator[](size_t pos) const; // for b[i];
  reference operator[](size_t pos); // for b[i];
  unsigned long to_ulong() const;
*************** basic_string&lt;charT, traits, Allocator
*** 33738,33744 ****
  </pre>
  </blockquote>
  <p>
! And add a description of  the new member function to 20.5.2 [bitset.members],
  below  the  description of  the  existing <code>to_ulong()</code>  (if
  possible), with the following text:
  </p>
--- 33873,33879 ----
  </pre>
  </blockquote>
  <p>
! And add a description of  the new member function to 20.6.2 [bitset.members],
  below  the  description of  the  existing <code>to_ulong()</code>  (if
  possible), with the following text:
  </p>
*************** possible), with the following text:
*** 33746,33759 ****
  <p>
  <code>unsigned long long to_ullong() const;</code>
  </p>
! <blockquote>
  <i>Throws</i>:  <code>overflow_error</code>   if  the  integral  value
  <code><i>x</i></code> corresponding to  the bits in <code>*this</code>
  cannot be represented as type <code>unsigned long long</code>.
! </blockquote>
! <blockquote>
  <i>Returns:</i> <code><i>x</i></code>.
! </blockquote>
  </blockquote>
  
  
--- 33881,33894 ----
  <p>
  <code>unsigned long long to_ullong() const;</code>
  </p>
! <blockquote><p>
  <i>Throws</i>:  <code>overflow_error</code>   if  the  integral  value
  <code><i>x</i></code> corresponding to  the bits in <code>*this</code>
  cannot be represented as type <code>unsigned long long</code>.
! </p></blockquote>
! <blockquote><p>
  <i>Returns:</i> <code><i>x</i></code>.
! </p></blockquote>
  </blockquote>
  
  
*************** cannot be represented as type <code>unsi
*** 33762,33770 ****
  
  <hr>
  <h3><a name="695"></a>695. ctype&lt;char&gt;::classic_table() not accessible</h3>
! <p><b>Section:</b> 22.4.1.3 [facet.ctype.special] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The   <code>ctype&lt;char&gt;::classic_table()</code>   static  member
--- 33897,33905 ----
  
  <hr>
  <h3><a name="695"></a>695. ctype&lt;char&gt;::classic_table() not accessible</h3>
! <p><b>Section:</b> 22.4.1.3 [facet.ctype.special] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The   <code>ctype&lt;char&gt;::classic_table()</code>   static  member
*************** moving their declarations into the publi
*** 33804,33810 ****
  specialization in 22.4.1.3 [facet.ctype.special] as shown below:
  </p>
  <blockquote>
! <pre>  static locale::id id;
    static const size_t table_size = IMPLEMENTATION_DEFINED;
  <del>protected:</del>
    const mask* table() const throw();
--- 33939,33946 ----
  specialization in 22.4.1.3 [facet.ctype.special] as shown below:
  </p>
  <blockquote>
! <pre>
!   static locale::id id;
    static const size_t table_size = IMPLEMENTATION_DEFINED;
  <del>protected:</del>
    const mask* table() const throw();
*************** virtual char do_toupper(char c) const;
*** 33822,33837 ****
  
  <hr>
  <h3><a name="696"></a>696. <code>istream::operator&gt;&gt;(int&amp;)</code> broken</h3>
! <p><b>Section:</b> 27.7.1.2.2 [istream.formatted.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.formatted.arithmetic">issues</a> in [istream.formatted.arithmetic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From message c++std-lib-17897:
  </p>
  <p>
! The code shown in 27.7.1.2.2 [istream.formatted.arithmetic] as the "as if"
  implementation of the two arithmetic extractors that don't have a
  corresponding <code>num_get</code> interface (i.e., the
  <code>short</code> and <code>int</code> overloads) is subtly buggy in
--- 33958,33973 ----
  
  <hr>
  <h3><a name="696"></a>696. <code>istream::operator&gt;&gt;(int&amp;)</code> broken</h3>
! <p><b>Section:</b> 27.7.2.2.2 [istream.formatted.arithmetic] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-06-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.formatted.arithmetic">issues</a> in [istream.formatted.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  From message c++std-lib-17897:
  </p>
  <p>
! The code shown in 27.7.2.2.2 [istream.formatted.arithmetic] as the "as if"
  implementation of the two arithmetic extractors that don't have a
  corresponding <code>num_get</code> interface (i.e., the
  <code>short</code> and <code>int</code> overloads) is subtly buggy in
*************** However there is a contradictory sentenc
*** 33912,33924 ****
  </p>
  
  <p>
! 27.7.1.2.2 [istream.formatted.arithmetic] should mimic the behavior of 22.4.2.1.2 [facet.num.get.virtuals]
  (whatever we decide that behavior is) for
  <tt>int</tt> and <tt>short</tt>, and currently does not.  I believe that the
  correct code fragment should look like:
  </p>
  
! <blockquote><pre>typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = ios_base::goodbit;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval);
--- 34048,34061 ----
  </p>
  
  <p>
! 27.7.2.2.2 [istream.formatted.arithmetic] should mimic the behavior of 22.4.2.1.2 [facet.num.get.virtuals]
  (whatever we decide that behavior is) for
  <tt>int</tt> and <tt>short</tt>, and currently does not.  I believe that the
  correct code fragment should look like:
  </p>
  
! <blockquote><pre>
! typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = ios_base::goodbit;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval);
*************** setstate(err);
*** 33943,33951 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 34080,34088 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Move to Ready.
*** 33954,33973 ****
  Change 22.4.2.1.2 [facet.num.get.virtuals], p1:
  </p>
  
! <blockquote>
  -1- <i>Effects:</i> Reads characters from <tt>in</tt>, interpreting them
  according to <tt>str.flags()</tt>, <tt>use_facet&lt;ctype&lt;charT&gt;
  &gt;(loc)</tt>, and <tt>use_facet&lt; numpunct&lt;charT&gt;
  &gt;(loc)</tt>, where <tt>loc</tt> is <tt>str.getloc()</tt>. <del>If an error
  occurs, <tt>val</tt> is unchanged; otherwise it is set to the resulting value.</del>
! </blockquote>
  
  <p>
! Change 27.7.1.2.2 [istream.formatted.arithmetic], p2 and p3:
  </p>
  
  <blockquote>
! <pre>operator&gt;&gt;(short&amp; val);
  </pre>
  <blockquote>
  <p>
--- 34091,34111 ----
  Change 22.4.2.1.2 [facet.num.get.virtuals], p1:
  </p>
  
! <blockquote><p>
  -1- <i>Effects:</i> Reads characters from <tt>in</tt>, interpreting them
  according to <tt>str.flags()</tt>, <tt>use_facet&lt;ctype&lt;charT&gt;
  &gt;(loc)</tt>, and <tt>use_facet&lt; numpunct&lt;charT&gt;
  &gt;(loc)</tt>, where <tt>loc</tt> is <tt>str.getloc()</tt>. <del>If an error
  occurs, <tt>val</tt> is unchanged; otherwise it is set to the resulting value.</del>
! </p></blockquote>
  
  <p>
! Change 27.7.2.2.2 [istream.formatted.arithmetic], p2 and p3:
  </p>
  
  <blockquote>
! <pre>
! operator>>(short&amp; val);
  </pre>
  <blockquote>
  <p>
*************** Change 27.7.1.2.2 [istream.formatted.ari
*** 33975,33981 ****
  the preceding code fragment):
  </p>
  
! <blockquote><pre>typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = ios<del>tate</del><ins>_base</ins>::goodbit;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval);
--- 34113,34120 ----
  the preceding code fragment):
  </p>
  
! <blockquote><pre>
! typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = ios<del>tate</del><ins>_base</ins>::goodbit;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval);
*************** setstate(err);
*** 34001,34007 ****
  
  </blockquote>
  
! <pre>operator&gt;&gt;(int&amp; val);
  </pre>
  <blockquote>
  <p>
--- 34140,34147 ----
  
  </blockquote>
  
! <pre>
! operator>>(int&amp; val);
  </pre>
  <blockquote>
  <p>
*************** setstate(err);
*** 34009,34015 ****
  the preceding code fragment):
  </p>
  
! <blockquote><pre>typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = ios<del>tate</del><ins>_base</ins>::goodbit;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval);
--- 34149,34156 ----
  the preceding code fragment):
  </p>
  
! <blockquote><pre>
! typedef num_get&lt;charT,istreambuf_iterator&lt;charT,traits&gt; &gt; numget;
  iostate err = ios<del>tate</del><ins>_base</ins>::goodbit;
  long lval;
  use_facet&lt;numget&gt;(loc).get(*this, 0, *this, err, lval);
*************** setstate(err);
*** 34043,34052 ****
  
  <hr>
  <h3><a name="697"></a>697. New <tt>&lt;system_error&gt;</tt> header leads to name clashes</h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-06-24 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The most recent state of 
--- 34184,34193 ----
  
  <hr>
  <h3><a name="697"></a>697. New <tt>&lt;system_error&gt;</tt> header leads to name clashes</h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-06-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The most recent state of 
*************** the enumerators has the name <tt>invalid
*** 34062,34068 ****
  e.g. the following snippet invalid:
  </p>
  
! <blockquote><pre>#include &lt;system_error&gt;
  #include &lt;stdexcept&gt;
  
  void foo() { throw std::invalid_argument("Don't call us - we call you!"); }
--- 34203,34210 ----
  e.g. the following snippet invalid:
  </p>
  
! <blockquote><pre>
! #include &lt;system_error&gt;
  #include &lt;stdexcept&gt;
  
  void foo() { throw std::invalid_argument("Don't call us - we call you!"); }
*************** Fixed by <a href="http://www.open-std.or
*** 34105,34119 ****
  
  <hr>
  <h3><a name="698"></a>698. <tt>system_error</tt> needs <tt>const char*</tt> constructors</h3>
! <p><b>Section:</b> 19.5.6.1 [syserr.syserr.overview] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-06-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 19.5.6.1 [syserr.syserr.overview] we have the class definition of
  <tt>std::system_error</tt>. In contrast to all exception classes, which
  are constructible with a <tt>what_arg string</tt> (see 19.2 [std.exceptions],
! or <tt>ios_base::failure</tt> in 27.5.2.1.1 [ios::failure]), only overloads with with
  <tt>const string&amp;</tt> are possible. For consistency with the re-designed
  remaining exception classes this class should also provide
  c'tors which accept a const <tt>char* what_arg</tt> string.
--- 34247,34261 ----
  
  <hr>
  <h3><a name="698"></a>698. <tt>system_error</tt> needs <tt>const char*</tt> constructors</h3>
! <p><b>Section:</b> 19.5.6.1 [syserr.syserr.overview] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-06-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 19.5.6.1 [syserr.syserr.overview] we have the class definition of
  <tt>std::system_error</tt>. In contrast to all exception classes, which
  are constructible with a <tt>what_arg string</tt> (see 19.2 [std.exceptions],
! or <tt>ios_base::failure</tt> in 27.5.3.1.1 [ios::failure]), only overloads with with
  <tt>const string&amp;</tt> are possible. For consistency with the re-designed
  remaining exception classes this class should also provide
  c'tors which accept a const <tt>char* what_arg</tt> string.
*************** accepting a <tt>const char*</tt>.
*** 34129,34142 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! This proposed wording assumes issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a> has been accepted and applied to the working paper.
  </p>
  
  <p>
  Change 19.5.6.1 [syserr.syserr.overview] Class system_error overview, as indicated:
  </p>
  
! <blockquote><pre>public:
    system_error(error_code ec, const string&amp; what_arg);
    <ins>system_error(error_code ec, const char* what_arg);</ins>
    system_error(error_code ec);
--- 34271,34285 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! This proposed wording assumes issue <a href="lwg-closed.html#832">832</a> has been accepted and applied to the working paper.
  </p>
  
  <p>
  Change 19.5.6.1 [syserr.syserr.overview] Class system_error overview, as indicated:
  </p>
  
! <blockquote><pre>
! public:
    system_error(error_code ec, const string&amp; what_arg);
    <ins>system_error(error_code ec, const char* what_arg);</ins>
    system_error(error_code ec);
*************** To 19.5.6.2 [syserr.syserr.members] Clas
*** 34152,34158 ****
  </p>
  
  <blockquote>
! <pre>system_error(error_code ec, const char* what_arg);
  </pre>
  <blockquote>
  <p>
--- 34295,34302 ----
  </p>
  
  <blockquote>
! <pre>
! system_error(error_code ec, const char* what_arg);
  </pre>
  <blockquote>
  <p>
*************** To 19.5.6.2 [syserr.syserr.members] Clas
*** 34163,34169 ****
  </p>
  </blockquote>
  
! <pre>system_error(int ev, const error_category* ecat, const char* what_arg);
  </pre>
  
  <blockquote>
--- 34307,34314 ----
  </p>
  </blockquote>
  
! <pre>
! system_error(int ev, const error_category* ecat, const char* what_arg);
  </pre>
  
  <blockquote>
*************** To 19.5.6.2 [syserr.syserr.members] Clas
*** 34183,34192 ****
  
  <hr>
  <h3><a name="699"></a>699. N2111 changes min/max</h3>
! <p><b>Section:</b> 26.5 [rand] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2007-07-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2111.pdf">N2111</a>
--- 34328,34337 ----
  
  <hr>
  <h3><a name="699"></a>699. N2111 changes min/max</h3>
! <p><b>Section:</b> 26.5 [rand] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2007-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand">issues</a> in [rand].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2111.pdf">N2111</a>
*************** The LWG voted to accelerate this issue t
*** 34222,34231 ****
  
  <hr>
  <h3><a name="700"></a>700. N1856 defines struct <tt>identity</tt></h3>
! <p><b>Section:</b> 20.3.3 [forward] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2007-07-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1856.html">N1856</a>
--- 34367,34376 ----
  
  <hr>
  <h3><a name="700"></a>700. N1856 defines struct <tt>identity</tt></h3>
! <p><b>Section:</b> 20.2.4 [forward] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2007-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1856.html">N1856</a>
*************** if we could avoid this name clash for ba
*** 34238,34255 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.3.3 [forward]:
  </p>
  
  <blockquote>
! <pre>template &lt;class T&gt; struct identity
  {
      typedef T type;
      <ins>const T&amp; operator()(const T&amp; x) const;</ins>
  };
  </pre>
  <blockquote>
! <pre><ins>const T&amp; operator()(const T&amp; x) const;</ins>
  </pre>
  <blockquote>
  <p>
--- 34383,34402 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.2.4 [forward]:
  </p>
  
  <blockquote>
! <pre>
! template &lt;class T&gt; struct identity
  {
      typedef T type;
      <ins>const T&amp; operator()(const T&amp; x) const;</ins>
  };
  </pre>
  <blockquote>
! <pre>
! <ins>const T&amp; operator()(const T&amp; x) const;</ins>
  </pre>
  <blockquote>
  <p>
*************** Change 20.3.3 [forward]:
*** 34267,34276 ****
  
  <hr>
  <h3><a name="703"></a>703. <tt>map::at()</tt> need a complexity specification</h3>
! <p><b>Section:</b> 23.6.1.2 [map.access] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2007-07-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#map.access">issues</a> in [map.access].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>map::at()</tt> need a complexity specification.
--- 34414,34423 ----
  
  <hr>
  <h3><a name="703"></a>703. <tt>map::at()</tt> need a complexity specification</h3>
! <p><b>Section:</b> 23.4.4.3 [map.access] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2007-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#map.access">issues</a> in [map.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>map::at()</tt> need a complexity specification.
*************** Change 20.3.3 [forward]:
*** 34279,34285 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following to the specification of <tt>map::at()</tt>, 23.6.1.2 [map.access]:
  </p>
  <blockquote>
  <p>
--- 34426,34432 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following to the specification of <tt>map::at()</tt>, 23.4.4.3 [map.access]:
  </p>
  <blockquote>
  <p>
*************** Add the following to the specification o
*** 34292,34306 ****
  
  
  <hr>
! <h3><a name="704"></a>704. MoveAssignable requirement for container value type overly strict</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The move-related changes inadvertently overwrote the intent of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#276">276</a>.
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#276">276</a> removed the requirement of <tt>CopyAssignable</tt> from
  most of the member functions of node-based containers.  But the move-related changes
  unnecessarily introduced the <tt>MoveAssignable</tt> requirement for those members which used to
  require <tt>CopyAssignable</tt>.
--- 34439,34454 ----
  
  
  <hr>
! <h3><a name="704"></a>704. <tt>MoveAssignable</tt> requirement for container value type overly strict</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-05-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The move-related changes inadvertently overwrote the intent of <a href="lwg-defects.html#276">276</a>.
! Issue <a href="lwg-defects.html#276">276</a> removed the requirement of <tt>CopyAssignable</tt> from
  most of the member functions of node-based containers.  But the move-related changes
  unnecessarily introduced the <tt>MoveAssignable</tt> requirement for those members which used to
  require <tt>CopyAssignable</tt>.
*************** not omitted by mistake.
*** 34319,34325 ****
  
  <table border="1">
  <caption>Container Requirements</caption>
! <tbody><tr><td><tt>X u(a)</tt></td><td><tt>value_type</tt> must be <tt>CopyConstructible</tt></td></tr>
  <tr><td><tt>X u(rv)</tt></td><td><tt>array</tt> requires <tt>value_type</tt> to be <tt>CopyConstructible</tt></td></tr>
  <tr><td><tt>a = u</tt></td><td>Sequences require <tt>value_type</tt> to be <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt>.
                                 Associative containers require <tt>value_type</tt> to be <tt>CopyConstructible</tt>.</td></tr>
--- 34467,34473 ----
  
  <table border="1">
  <caption>Container Requirements</caption>
! <tr><td><tt>X u(a)</tt></td><td><tt>value_type</tt> must be <tt>CopyConstructible</tt></td></tr>
  <tr><td><tt>X u(rv)</tt></td><td><tt>array</tt> requires <tt>value_type</tt> to be <tt>CopyConstructible</tt></td></tr>
  <tr><td><tt>a = u</tt></td><td>Sequences require <tt>value_type</tt> to be <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt>.
                                 Associative containers require <tt>value_type</tt> to be <tt>CopyConstructible</tt>.</td></tr>
*************** not omitted by mistake.
*** 34327,34340 ****
                                  Sequences containers with <tt>propagate_on_container_move_assignment == false</tt> allocators require <tt>value_type</tt> to be <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt>.
                                  Associative containers with <tt>propagate_on_container_move_assignment == false</tt> allocators require <tt>value_type</tt> to be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>swap(a,u)</tt></td><td><tt>array</tt> requires <tt>value_type</tt> to be <tt>Swappable</tt>.</td></tr>
! </tbody></table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Sequence Requirements</caption>
! <tbody><tr><td><tt>X(n)</tt></td><td><tt>value_type</tt> must be <tt>DefaultConstructible</tt></td></tr>
  <tr><td><tt>X(n, t)</tt></td><td><tt>value_type</tt> must be <tt>CopyConstructible</tt></td></tr>
  <tr><td><tt>X(i, j)</tt></td><td>Sequences require <tt>value_type</tt> to be constructible from <tt>*i</tt>.  Additionally if input_iterators
                                   are used, <tt>vector</tt> and <tt>deque</tt> require <tt>MoveContructible</tt> and <tt>MoveAssignable</tt>.</td></tr>
--- 34475,34488 ----
                                  Sequences containers with <tt>propagate_on_container_move_assignment == false</tt> allocators require <tt>value_type</tt> to be <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt>.
                                  Associative containers with <tt>propagate_on_container_move_assignment == false</tt> allocators require <tt>value_type</tt> to be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>swap(a,u)</tt></td><td><tt>array</tt> requires <tt>value_type</tt> to be <tt>Swappable</tt>.</td></tr>
! </table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Sequence Requirements</caption>
! <tr><td><tt>X(n)</tt></td><td><tt>value_type</tt> must be <tt>DefaultConstructible</tt></td></tr>
  <tr><td><tt>X(n, t)</tt></td><td><tt>value_type</tt> must be <tt>CopyConstructible</tt></td></tr>
  <tr><td><tt>X(i, j)</tt></td><td>Sequences require <tt>value_type</tt> to be constructible from <tt>*i</tt>.  Additionally if input_iterators
                                   are used, <tt>vector</tt> and <tt>deque</tt> require <tt>MoveContructible</tt> and <tt>MoveAssignable</tt>.</td></tr>
*************** not omitted by mistake.
*** 34357,34370 ****
  <tr><td><tt>a.resize(n)</tt></td><td>The <tt>value_type</tt> must be <tt>DefaultConstructible</tt>.
                                       The sequence <tt>vector</tt> also requires the <tt>value_type</tt> to be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a.resize(n, t)</tt></td><td>The <tt>value_type</tt> must be <tt>CopyConstructible</tt>.</td></tr>
! </tbody></table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Optional Sequence Requirements</caption>
! <tbody><tr><td><tt>a.front()</tt></td><td></td></tr>
  <tr><td><tt>a.back()</tt></td><td></td></tr>
  <tr><td><tt>a.push_front(t)</tt></td><td>The <tt>value_type</tt> must be <tt>CopyConstructible</tt>.</td></tr>
  <tr><td><tt>a.push_front(rv)</tt></td><td>The <tt>value_type</tt> must be <tt>MoveConstructible</tt>.</td></tr>
--- 34505,34518 ----
  <tr><td><tt>a.resize(n)</tt></td><td>The <tt>value_type</tt> must be <tt>DefaultConstructible</tt>.
                                       The sequence <tt>vector</tt> also requires the <tt>value_type</tt> to be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a.resize(n, t)</tt></td><td>The <tt>value_type</tt> must be <tt>CopyConstructible</tt>.</td></tr>
! </table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Optional Sequence Requirements</caption>
! <tr><td><tt>a.front()</tt></td><td></td></tr>
  <tr><td><tt>a.back()</tt></td><td></td></tr>
  <tr><td><tt>a.push_front(t)</tt></td><td>The <tt>value_type</tt> must be <tt>CopyConstructible</tt>.</td></tr>
  <tr><td><tt>a.push_front(rv)</tt></td><td>The <tt>value_type</tt> must be <tt>MoveConstructible</tt>.</td></tr>
*************** not omitted by mistake.
*** 34374,34387 ****
  <tr><td><tt>a.pop_back()</tt></td><td></td></tr>
  <tr><td><tt>a[n]</tt></td><td></td></tr>
  <tr><td><tt>a.at[n]</tt></td><td></td></tr>
! </tbody></table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Associative Container Requirements</caption>
! <tbody><tr><td><tt>X(i, j)</tt></td><td>If the iterators return an lvalue the <tt>value_type</tt> must be <tt>CopyConstructible</tt>.
                                   If the iterators return an rvalue the <tt>value_type</tt> must be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a_uniq.insert(t)</tt></td><td>The <tt>value_type</tt> must be <tt>CopyConstructible</tt>.</td></tr>
  <tr><td><tt>a_uniq.insert(rv)</tt></td><td>The <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>.</td></tr>
--- 34522,34535 ----
  <tr><td><tt>a.pop_back()</tt></td><td></td></tr>
  <tr><td><tt>a[n]</tt></td><td></td></tr>
  <tr><td><tt>a.at[n]</tt></td><td></td></tr>
! </table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Associative Container Requirements</caption>
! <tr><td><tt>X(i, j)</tt></td><td>If the iterators return an lvalue the <tt>value_type</tt> must be <tt>CopyConstructible</tt>.
                                   If the iterators return an rvalue the <tt>value_type</tt> must be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a_uniq.insert(t)</tt></td><td>The <tt>value_type</tt> must be <tt>CopyConstructible</tt>.</td></tr>
  <tr><td><tt>a_uniq.insert(rv)</tt></td><td>The <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>.</td></tr>
*************** not omitted by mistake.
*** 34391,34404 ****
  <tr><td><tt>a.insert(p, rv)</tt></td><td>The <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a.insert(i, j)</tt></td><td>If the iterators return an lvalue the <tt>value_type</tt> must be <tt>CopyConstructible</tt>.
                                          If the iterators return an rvalue the <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>..</td></tr>
! </tbody></table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Unordered Associative Container Requirements</caption>
! <tbody><tr><td><tt>X(i, j, n, hf, eq)</tt></td><td>If the iterators return an lvalue the <tt>value_type</tt> must be <tt>CopyConstructible</tt>.
                                   If the iterators return an rvalue the <tt>value_type</tt> must be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a_uniq.insert(t)</tt></td><td>The <tt>value_type</tt> must be <tt>CopyConstructible</tt>.</td></tr>
  <tr><td><tt>a_uniq.insert(rv)</tt></td><td>The <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>.</td></tr>
--- 34539,34552 ----
  <tr><td><tt>a.insert(p, rv)</tt></td><td>The <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a.insert(i, j)</tt></td><td>If the iterators return an lvalue the <tt>value_type</tt> must be <tt>CopyConstructible</tt>.
                                          If the iterators return an rvalue the <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>..</td></tr>
! </table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Unordered Associative Container Requirements</caption>
! <tr><td><tt>X(i, j, n, hf, eq)</tt></td><td>If the iterators return an lvalue the <tt>value_type</tt> must be <tt>CopyConstructible</tt>.
                                   If the iterators return an rvalue the <tt>value_type</tt> must be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a_uniq.insert(t)</tt></td><td>The <tt>value_type</tt> must be <tt>CopyConstructible</tt>.</td></tr>
  <tr><td><tt>a_uniq.insert(rv)</tt></td><td>The <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>.</td></tr>
*************** not omitted by mistake.
*** 34408,34425 ****
  <tr><td><tt>a.insert(p, rv)</tt></td><td>The <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a.insert(i, j)</tt></td><td>If the iterators return an lvalue the <tt>value_type</tt> must be <tt>CopyConstructible</tt>.
                                          If the iterators return an rvalue the <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>..</td></tr>
! </tbody></table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Miscellaneous Requirements</caption>
! <tbody><tr><td><tt>map[lvalue-key]</tt></td><td>The <tt>key_type</tt> must be <tt>CopyConstructible</tt>.
                                           The <tt>mapped_type</tt> must be <tt>DefaultConstructible</tt> and <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>map[rvalue-key]</tt></td><td>The <tt>key_type</tt> must be <tt>MoveConstructible</tt>.
                                           The <tt>mapped_type</tt> must be <tt>DefaultConstructible</tt> and <tt>MoveConstructible</tt>.</td></tr>
! </tbody></table>
  
  <p><i>[
  Kona (2007): Howard and Alan to update requirements table in issue with emplace signatures.
--- 34556,34573 ----
  <tr><td><tt>a.insert(p, rv)</tt></td><td>The <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>a.insert(i, j)</tt></td><td>If the iterators return an lvalue the <tt>value_type</tt> must be <tt>CopyConstructible</tt>.
                                          If the iterators return an rvalue the <tt>key_type</tt> and the <tt>mapped_type</tt> (if it exists) must be <tt>MoveConstructible</tt>..</td></tr>
! </table>
  
  <p>
  </p>
  
  <table border="1">
  <caption>Miscellaneous Requirements</caption>
! <tr><td><tt>map[lvalue-key]</tt></td><td>The <tt>key_type</tt> must be <tt>CopyConstructible</tt>.
                                           The <tt>mapped_type</tt> must be <tt>DefaultConstructible</tt> and <tt>MoveConstructible</tt>.</td></tr>
  <tr><td><tt>map[rvalue-key]</tt></td><td>The <tt>key_type</tt> must be <tt>MoveConstructible</tt>.
                                           The <tt>mapped_type</tt> must be <tt>DefaultConstructible</tt> and <tt>MoveConstructible</tt>.</td></tr>
! </table>
  
  <p><i>[
  Kona (2007): Howard and Alan to update requirements table in issue with emplace signatures.
*************** MoveConstructible, etc.
*** 34467,34475 ****
  ]</i></p>
  
  
! <blockquote>
  Leave open. Howard to provide wording.
! </blockquote>
  
  <p><i>[
  2010-02-06 Howard provides wording.
--- 34615,34623 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave open. Howard to provide wording.
! </p></blockquote>
  
  <p><i>[
  2010-02-06 Howard provides wording.
*************** the argument is an rvalue.  Fixed it.
*** 34500,34528 ****
  
  <blockquote>
  <p>
! I took the task to see whether <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a> is covered by 704
  already.
  However, by doing that I have the impression that
  704 is a big mistake.
  </p>
  
  <p>
! Take e.g. the second change of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a>:
  </p>
  
  <blockquote>
  <p>
! Change 23.3.2.1 [deque.cons] para 5:
  </p>
! <blockquote>
  <i>Effects:</i> Constructs a <tt>deque</tt> with <tt>n</tt> default constructed
  elements.
! </blockquote>
  <p>
  where "default constructed" should be replaced by "value-initialized".
  This is the constructor out of a number of elements:
  </p>
! <blockquote><pre>ContType c(num)
  </pre></blockquote>
  
  <p>
--- 34648,34677 ----
  
  <blockquote>
  <p>
! I took the task to see whether <a href="lwg-defects.html#868">868</a> is covered by 704
  already.
  However, by doing that I have the impression that
  704 is a big mistake.
  </p>
  
  <p>
! Take e.g. the second change of <a href="lwg-defects.html#868">868</a>:
  </p>
  
  <blockquote>
  <p>
! Change 23.3.3.2 [deque.cons] para 5:
  </p>
! <blockquote><p>
  <i>Effects:</i> Constructs a <tt>deque</tt> with <tt>n</tt> default constructed
  elements.
! </p></blockquote>
  <p>
  where "default constructed" should be replaced by "value-initialized".
  This is the constructor out of a number of elements:
  </p>
! <blockquote><pre>
! ContType c(num)
  </pre></blockquote>
  
  <p>
*************** This is the constructor out of a number
*** 34531,34541 ****
  
  <blockquote>
  <p>
! Remove the entire section 23.3.2.1 [deque.cons].
  </p>
! <blockquote>
  [ This section is already specified by the requirements tables. ]
! </blockquote>
  </blockquote>
  
  <p>
--- 34680,34690 ----
  
  <blockquote>
  <p>
! Remove the entire section 23.3.3.2 [deque.cons].
  </p>
! <blockquote><p>
  [ This section is already specified by the requirements tables. ]
! </p></blockquote>
  </blockquote>
  
  <p>
*************** post San Francisco:
*** 34608,34617 ****
  ]</i></p>
  
  
! <blockquote>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2776.pdf">N2776</a>.
! </blockquote>
  
  <p>
  This rationale is obsolete. 
--- 34757,34766 ----
  ]</i></p>
  
  
! <blockquote><p>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2776.pdf">N2776</a>.
! </p></blockquote>
  
  <p>
  This rationale is obsolete. 
*************** This rationale is obsolete.
*** 34627,34653 ****
  Change 23.2.1 [container.requirements.general]/4:
  </p>
  
! <blockquote>
  4 In Tables 91 and 92, <tt>X</tt> denotes a container class containing objects
  of type <tt>T</tt>, <tt>a</tt> and <tt>b</tt> denote values of type <tt>X</tt>,
  <tt>u</tt> denotes an identifier, <tt>r</tt> denotes <del>an lvalue or a const
  rvalue</del> <ins>a non-const value</ins> of type <tt>X</tt>, and <tt>rv</tt>
  denotes a non-const rvalue of type <tt>X</tt>.
! </blockquote>
  
  <p>
! Change the following rows in Table 91 — Container requirements
  23.2.1 [container.requirements.general]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 91 — Container requirements</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
--- 34776,34802 ----
  Change 23.2.1 [container.requirements.general]/4:
  </p>
  
! <blockquote><p>
  4 In Tables 91 and 92, <tt>X</tt> denotes a container class containing objects
  of type <tt>T</tt>, <tt>a</tt> and <tt>b</tt> denote values of type <tt>X</tt>,
  <tt>u</tt> denotes an identifier, <tt>r</tt> denotes <del>an lvalue or a const
  rvalue</del> <ins>a non-const value</ins> of type <tt>X</tt>, and <tt>rv</tt>
  denotes a non-const rvalue of type <tt>X</tt>.
! </p></blockquote>
  
  <p>
! Change the following rows in Table 91 &mdash; Container requirements
  23.2.1 [container.requirements.general]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 91 &mdash; Container requirements</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
*************** Change the following rows in Table 91 —
*** 34658,34664 ****
  <td>compile time</td>
  </tr>
  
! </tbody></table>
  
  </blockquote>
  
--- 34807,34813 ----
  <td>compile time</td>
  </tr>
  
! </table>
  
  </blockquote>
  
*************** requirements:
*** 34675,34690 ****
  
  <ul>
  <li>
! ..
  </li>
  
! <li>
  no <tt>erase()</tt>, <ins><tt>clear()</tt>,</ins> <tt>pop_back()</tt> or
  <tt>pop_front()</tt> function throws an exception.
! </li>
  
  <li>
! ...
  </li>
  </ul>
  
--- 34824,34839 ----
  
  <ul>
  <li>
! <p>&hellip;</p>
  </li>
  
! <li><p>
  no <tt>erase()</tt>, <ins><tt>clear()</tt>,</ins> <tt>pop_back()</tt> or
  <tt>pop_front()</tt> function throws an exception.
! </p></li>
  
  <li>
! <p>&hellip;</p>
  </li>
  </ul>
  
*************** The default implementation of construct
*** 34730,34736 ****
  
  <p><ins>
  But the allocator author may override the above definition of <tt>construct</tt>
! and do the construction of <tt>T</tt> by some other means. — <i>end
  example</i>]
  </ins></p>
  
--- 34879,34885 ----
  
  <p><ins>
  But the allocator author may override the above definition of <tt>construct</tt>
! and do the construction of <tt>T</tt> by some other means. &mdash; <i>end
  example</i>]
  </ins></p>
  
*************** example</i>]
*** 34743,34788 ****
  Add to 23.2.1 [container.requirements.general]/14:
  </p>
  
! <blockquote>
  14 In Table 93, <tt>X</tt> denotes an allocator-aware container class with a
  <tt>value_type</tt> of <tt>T</tt> using allocator of type <tt>A</tt>, <tt>u</tt>
  denotes a variable, <ins><tt>a</tt> and <tt>b</tt> denote non-const lvalues of
  type <tt>X</tt>,</ins> <tt>t</tt> denotes an lvalue or a const rvalue of type
  <tt>X</tt>, <tt>rv</tt> denotes a non-const rvalue of type <tt>X</tt>,
  <tt>m</tt> is a value of type <tt>A</tt>, and <tt>Q</tt> is an allocator type.
! </blockquote>
  
  <p>
! Change or add the following rows in Table 93 — Allocator-aware container
  requirements in 23.2.1 [container.requirements.general]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 93 — Allocator-aware container requirements</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
  <tr>
! <td><tt>X(t, m)<br>X u(t, m);</tt></td>
  <td></td>
! <td><ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt>.</ins><br>
! post: <tt>u == t</tt>,<br>
  <tt>get_allocator() == m</tt></td>
  <td>linear</td>
  </tr>
  
  <tr>
! <td><tt>X(rv, m)<br>X u(rv, m);</tt></td>
  <td></td>
! <td><ins><i>Requires:</i> <tt>T</tt> is <tt>MoveConstructible</tt>.</ins><br>
  post: <tt>u</tt> shall have the same elements, or copies of the elements, that
! <tt>rv</tt> had before this construction,<br>
  <tt>get_allocator() == m</tt></td>
  <td>constant if <tt>m == rv.get_allocator()</tt>, otherwise linear</td>
  </tr>
--- 34892,34937 ----
  Add to 23.2.1 [container.requirements.general]/14:
  </p>
  
! <blockquote><p>
  14 In Table 93, <tt>X</tt> denotes an allocator-aware container class with a
  <tt>value_type</tt> of <tt>T</tt> using allocator of type <tt>A</tt>, <tt>u</tt>
  denotes a variable, <ins><tt>a</tt> and <tt>b</tt> denote non-const lvalues of
  type <tt>X</tt>,</ins> <tt>t</tt> denotes an lvalue or a const rvalue of type
  <tt>X</tt>, <tt>rv</tt> denotes a non-const rvalue of type <tt>X</tt>,
  <tt>m</tt> is a value of type <tt>A</tt>, and <tt>Q</tt> is an allocator type.
! </p></blockquote>
  
  <p>
! Change or add the following rows in Table 93 &mdash; Allocator-aware container
  requirements in 23.2.1 [container.requirements.general]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 93 &mdash; Allocator-aware container requirements</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
  <tr>
! <td><tt>X(t, m)<br/>X u(t, m);</tt></td>
  <td></td>
! <td><ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt>.</ins><br/>
! post: <tt>u == t</tt>,<br/>
  <tt>get_allocator() == m</tt></td>
  <td>linear</td>
  </tr>
  
  <tr>
! <td><tt>X(rv, m)<br/>X u(rv, m);</tt></td>
  <td></td>
! <td><ins><i>Requires:</i> <tt>T</tt> is <tt>MoveConstructible</tt>.</ins><br/>
  post: <tt>u</tt> shall have the same elements, or copies of the elements, that
! <tt>rv</tt> had before this construction,<br/>
  <tt>get_allocator() == m</tt></td>
  <td>constant if <tt>m == rv.get_allocator()</tt>, otherwise linear</td>
  </tr>
*************** post: <tt>u</tt> shall have the same ele
*** 34791,34797 ****
  <td><ins><tt>a = t</tt></ins></td>
  <td><ins><tt>X&amp;</tt></ins></td>
  <td><ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt><br>
  post: <tt>a == t</tt>.</ins></td>
  <td><ins>linear</ins></td>
  </tr>
--- 34940,34946 ----
  <td><ins><tt>a = t</tt></ins></td>
  <td><ins><tt>X&amp;</tt></ins></td>
  <td><ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt><br/>
  post: <tt>a == t</tt>.</ins></td>
  <td><ins>linear</ins></td>
  </tr>
*************** post: <tt>a == t</tt>.</ins></td>
*** 34801,34809 ****
  <td><ins><tt>X&amp;</tt></ins></td>
  <td><ins><i>Requires:</i> If <tt>allocator_traits&lt; allocator_type &gt;
  ::propagate_on_container_move_assignment ::value</tt> is <tt>false</tt>,
! <tt>T</tt> is <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt>.<br>
  All existing elements of <tt>a</tt> are either move assigned
! <ins>to</ins> or destroyed.<br>
  <tt>a</tt> shall be equal to the value that <tt>rv</tt> had before this
  assignment</ins></td>
  <td><ins>linear</ins></td>
--- 34950,34958 ----
  <td><ins><tt>X&amp;</tt></ins></td>
  <td><ins><i>Requires:</i> If <tt>allocator_traits&lt; allocator_type &gt;
  ::propagate_on_container_move_assignment ::value</tt> is <tt>false</tt>,
! <tt>T</tt> is <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt>.<br/>
  All existing elements of <tt>a</tt> are either move assigned
! <ins>to</ins> or destroyed.<br/>
  <tt>a</tt> shall be equal to the value that <tt>rv</tt> had before this
  assignment</ins></td>
  <td><ins>linear</ins></td>
*************** assignment</ins></td>
*** 34816,34852 ****
  <td><ins>constant</ins></td>
  </tr>
  
! </tbody></table>
  
  </blockquote>
  
  <p>
! Change the following rows in Table 94 — Sequence container requirements
  (in addition to container) in 23.2.3 [sequence.reqmts]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 94 — Sequence container requirements (in addition to
  container)</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  </tr>
  
  <tr>
! <td><tt>X(i, j)<br>X a(i, j)</tt></td>
  <td></td>
  <td><i>Requires:</i> <del>If the iterator's dereference operation returns an
  lvalue or a const rvalue, <tt>T</tt> shall be <tt>CopyConstructible</tt>.</del>
! <ins><tt>T</tt> shall be constructible from <tt>*i</tt>.</ins><br>
  <ins>If the iterator does not meet the forward iterator requirements (24.2.5 [forward.iterators]), then <tt>vector</tt> also requires <tt>T</tt> to
! be <tt>MoveConstructible</tt>.</ins><br>
  Each iterator in the range <tt>[i,j)</tt> shall be dereferenced exactly
! once.<br>
! post: <tt>size() ==</tt> distance between <tt>i</tt> and <tt>j</tt><br>
  Constructs a sequence container equal to the range <tt>[i, j)</tt></td>
  </tr>
  
--- 34965,35001 ----
  <td><ins>constant</ins></td>
  </tr>
  
! </table>
  
  </blockquote>
  
  <p>
! Change the following rows in Table 94 &mdash; Sequence container requirements
  (in addition to container) in 23.2.3 [sequence.reqmts]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 94 &mdash; Sequence container requirements (in addition to
  container)</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
  </tr>
  
  <tr>
! <td><tt>X(i, j)<br/>X a(i, j)</tt></td>
  <td></td>
  <td><i>Requires:</i> <del>If the iterator's dereference operation returns an
  lvalue or a const rvalue, <tt>T</tt> shall be <tt>CopyConstructible</tt>.</del>
! <ins><tt>T</tt> shall be constructible from <tt>*i</tt>.</ins><br/>
  <ins>If the iterator does not meet the forward iterator requirements (24.2.5 [forward.iterators]), then <tt>vector</tt> also requires <tt>T</tt> to
! be <tt>MoveConstructible</tt>.</ins><br/>
  Each iterator in the range <tt>[i,j)</tt> shall be dereferenced exactly
! once.<br/>
! post: <tt>size() ==</tt> distance between <tt>i</tt> and <tt>j</tt><br/>
  Constructs a sequence container equal to the range <tt>[i, j)</tt></td>
  </tr>
  
*************** Constructs a sequence container equal to
*** 34854,34863 ****
  <td><tt>a = il;</tt></td>
  <td><tt>X&amp;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt>.</ins><br>
! <del><tt>a = X(il);</tt></del><br>
  <ins>Assigns the range <tt>[il.begin(), il.end())</tt> into <tt>a</tt>.  All
! existing elements of <tt>a</tt> are either assigned or destroyed.</ins><br>
  <del>r</del><ins>R</ins>eturn<ins>s</ins> <tt>*this;</tt></td>
  </tr>
  
--- 35003,35012 ----
  <td><tt>a = il;</tt></td>
  <td><tt>X&amp;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt>.</ins><br/>
! <del><tt>a = X(il);</tt></del><br/>
  <ins>Assigns the range <tt>[il.begin(), il.end())</tt> into <tt>a</tt>.  All
! existing elements of <tt>a</tt> are either assigned or destroyed.</ins><br/>
  <del>r</del><ins>R</ins>eturn<ins>s</ins> <tt>*this;</tt></td>
  </tr>
  
*************** Inserts a copy <tt>rv</tt> before <tt>p<
*** 34897,34907 ****
  <td><tt>iterator</tt></td>
  <td><i>Requires:</i> <del>If the iterator's dereference operation returns an
  lvalue or a const rvalue, <tt>T</tt> shall be <tt>CopyConstructible</tt>.</del>
! <ins><tt>T</tt> shall be constructible from <tt>*i</tt>.</ins><br> <ins>If the
  iterator does not meet the forward iterator requirements (24.2.5 [forward.iterators]), then <tt>vector</tt> also requires <tt>T</tt> to
! be <tt>MoveConstructible</tt> and  <tt>MoveAssignable</tt>.</ins><br> Each
! iterator in the range <tt>[i,j)</tt> shall be dereferenced exactly once.<br>
! pre: <tt>i</tt> and <tt>j</tt> are not iterators into <tt>a</tt>.<br> Inserts
  copies of elements in <tt>[i, j)</tt> before <tt>p</tt></td>
  </tr>
  
--- 35046,35056 ----
  <td><tt>iterator</tt></td>
  <td><i>Requires:</i> <del>If the iterator's dereference operation returns an
  lvalue or a const rvalue, <tt>T</tt> shall be <tt>CopyConstructible</tt>.</del>
! <ins><tt>T</tt> shall be constructible from <tt>*i</tt>.</ins><br/> <ins>If the
  iterator does not meet the forward iterator requirements (24.2.5 [forward.iterators]), then <tt>vector</tt> also requires <tt>T</tt> to
! be <tt>MoveConstructible</tt> and  <tt>MoveAssignable</tt>.</ins><br/> Each
! iterator in the range <tt>[i,j)</tt> shall be dereferenced exactly once.<br/>
! pre: <tt>i</tt> and <tt>j</tt> are not iterators into <tt>a</tt>.<br/> Inserts
  copies of elements in <tt>[i, j)</tt> before <tt>p</tt></td>
  </tr>
  
*************** copies of elements in <tt>[i, j)</tt> be
*** 34926,34935 ****
  <tr>
  <td><tt>a.clear();</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>erase(begin(), end())</tt></del><br>
  <ins>Destroys all elements in <tt>a</tt>. <ins>Invalidates all references,
  pointers, and iterators referring to the elements of <tt>a</tt> and may
! invalidate the past-the-end iterator.</ins><br></ins>
  post: <tt><del>size() == 0</del> <ins>a.empty() == true</ins></tt></td>
  </tr>
  
--- 35075,35084 ----
  <tr>
  <td><tt>a.clear();</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>erase(begin(), end())</tt></del><br/>
  <ins>Destroys all elements in <tt>a</tt>. <ins>Invalidates all references,
  pointers, and iterators referring to the elements of <tt>a</tt> and may
! invalidate the past-the-end iterator.</ins><br/></ins>
  post: <tt><del>size() == 0</del> <ins>a.empty() == true</ins></tt></td>
  </tr>
  
*************** lvalue or a const rvalue, <tt>T</tt> sha
*** 34941,34967 ****
  <tt>CopyAssignable</tt>.</del>
  <ins><tt>T</tt> shall be constructible and assignable from <tt>*i</tt>.  If the
  iterator does not meet the forward iterator requirements (24.2.5 [forward.iterators]), then <tt>vector</tt> also requires <tt>T</tt> to
! be <tt>MoveConstructible</tt>.</ins><br>
  Each iterator in the range <tt>[i,j)</tt> shall be dereferenced exactly
! once.<br>
! pre: <tt>i</tt>, <tt>j</tt> are not iterators into <tt>a</tt>.<br>
  Replaces elements in <tt>a</tt> with a copy of <tt>[i, j)</tt>.</td>
  </tr>
  
! </tbody></table>
  
  </blockquote>
  
  <p>
! Change the following rows in Table 95 — Optional sequence container operations
  in 23.2.3 [sequence.reqmts]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 95 — Optional sequence container operations</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
--- 35090,35116 ----
  <tt>CopyAssignable</tt>.</del>
  <ins><tt>T</tt> shall be constructible and assignable from <tt>*i</tt>.  If the
  iterator does not meet the forward iterator requirements (24.2.5 [forward.iterators]), then <tt>vector</tt> also requires <tt>T</tt> to
! be <tt>MoveConstructible</tt>.</ins><br/>
  Each iterator in the range <tt>[i,j)</tt> shall be dereferenced exactly
! once.<br/>
! pre: <tt>i</tt>, <tt>j</tt> are not iterators into <tt>a</tt>.<br/>
  Replaces elements in <tt>a</tt> with a copy of <tt>[i, j)</tt>.</td>
  </tr>
  
! </table>
  
  </blockquote>
  
  <p>
! Change the following rows in Table 95 &mdash; Optional sequence container operations
  in 23.2.3 [sequence.reqmts]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 95 &mdash; Optional sequence container operations</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
*************** in 23.2.3 [sequence.reqmts]:
*** 34971,34979 ****
  <tr>
  <td><tt>a.emplace_front(args)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.emplace(a.begin(), std::forward&lt;Args&gt;(args)...)</tt></del><br>
  <ins>Prepends an object of type <tt>T</tt> constructed with
! <tt>std::forward&lt;Args&gt;(args)...</tt>.</ins><br>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, Args&gt;</tt></del>
  <ins><tt>T</tt> shall be constructible from <tt>args</tt>.</ins></td>
  <td><tt>list</tt>, <tt>deque</tt>, <tt>forward_list</tt></td>
--- 35120,35128 ----
  <tr>
  <td><tt>a.emplace_front(args)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.emplace(a.begin(), std::forward&lt;Args&gt;(args)...)</tt></del><br/>
  <ins>Prepends an object of type <tt>T</tt> constructed with
! <tt>std::forward&lt;Args&gt;(args)...</tt>.</ins><br/>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, Args&gt;</tt></del>
  <ins><tt>T</tt> shall be constructible from <tt>args</tt>.</ins></td>
  <td><tt>list</tt>, <tt>deque</tt>, <tt>forward_list</tt></td>
*************** in 23.2.3 [sequence.reqmts]:
*** 34982,34990 ****
  <tr>
  <td><tt>a.emplace_back(args)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.emplace(a.end(), std::forward&lt;Args&gt;(args)...)</tt></del><br>
  <ins>Appends an object of type <tt>T</tt> constructed with
! <tt>std::forward&lt;Args&gt;(args)...</tt>.</ins><br>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, Args&gt;</tt></del>
  <ins><tt>T</tt> shall be constructible from <tt>args</tt>. <tt>vector</tt> also
  requires <tt>T</tt> to be <tt>MoveConstructible</tt>.</ins></td>
--- 35131,35139 ----
  <tr>
  <td><tt>a.emplace_back(args)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.emplace(a.end(), std::forward&lt;Args&gt;(args)...)</tt></del><br/>
  <ins>Appends an object of type <tt>T</tt> constructed with
! <tt>std::forward&lt;Args&gt;(args)...</tt>.</ins><br/>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, Args&gt;</tt></del>
  <ins><tt>T</tt> shall be constructible from <tt>args</tt>. <tt>vector</tt> also
  requires <tt>T</tt> to be <tt>MoveConstructible</tt>.</ins></td>
*************** requires <tt>T</tt> to be <tt>MoveConstr
*** 34994,35001 ****
  <tr>
  <td><tt>a.push_front(t)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.insert(a.begin(), t)</tt></del><br>
! <ins>Prepends a copy of <tt>t</tt>.</ins><br>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, T&gt;</tt> and
  <tt>T</tt> shall be <tt>CopyAssignable</tt>.</del>
  <ins><tt>T</tt> shall be <tt>CopyConstructible</tt>.</ins></td>
--- 35143,35150 ----
  <tr>
  <td><tt>a.push_front(t)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.insert(a.begin(), t)</tt></del><br/>
! <ins>Prepends a copy of <tt>t</tt>.</ins><br/>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, T&gt;</tt> and
  <tt>T</tt> shall be <tt>CopyAssignable</tt>.</del>
  <ins><tt>T</tt> shall be <tt>CopyConstructible</tt>.</ins></td>
*************** requires <tt>T</tt> to be <tt>MoveConstr
*** 35005,35012 ****
  <tr>
  <td><tt>a.push_front(rv)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.insert(a.begin(), t)</tt></del><br>
! <ins>Prepends a copy of <tt>rv</tt>.</ins><br>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, T&amp;&amp;&gt;</tt> and
  <tt>T</tt> shall be <tt>MoveAssignable</tt>.</del>
  <ins><tt>T</tt> shall be <tt>MoveConstructible</tt>.</ins></td>
--- 35154,35161 ----
  <tr>
  <td><tt>a.push_front(rv)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.insert(a.begin(), t)</tt></del><br/>
! <ins>Prepends a copy of <tt>rv</tt>.</ins><br/>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, T&amp;&amp;&gt;</tt> and
  <tt>T</tt> shall be <tt>MoveAssignable</tt>.</del>
  <ins><tt>T</tt> shall be <tt>MoveConstructible</tt>.</ins></td>
*************** requires <tt>T</tt> to be <tt>MoveConstr
*** 35016,35023 ****
  <tr>
  <td><tt>a.push_back(t)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.insert(a.end(), t)</tt></del><br>
! <ins>Appends a copy of <tt>t</tt>.</ins><br>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, T&gt;</tt> and
  <tt>T</tt> shall be <tt>CopyAssignable</tt>.</del>
  <ins><tt>T</tt> shall be <tt>CopyConstructible</tt>.</ins></td>
--- 35165,35172 ----
  <tr>
  <td><tt>a.push_back(t)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.insert(a.end(), t)</tt></del><br/>
! <ins>Appends a copy of <tt>t</tt>.</ins><br/>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, T&gt;</tt> and
  <tt>T</tt> shall be <tt>CopyAssignable</tt>.</del>
  <ins><tt>T</tt> shall be <tt>CopyConstructible</tt>.</ins></td>
*************** requires <tt>T</tt> to be <tt>MoveConstr
*** 35027,35034 ****
  <tr>
  <td><tt>a.push_back(rv)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.insert(a.end(), t)</tt></del><br>
! <ins>Appends a copy of <tt>rv</tt>.</ins><br>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, T&amp;&amp;&gt;</tt> and
  <tt>T</tt> shall be <tt>MoveAssignable</tt>.</del>
  <ins><tt>T</tt> shall be <tt>MoveConstructible</tt>.</ins></td>
--- 35176,35183 ----
  <tr>
  <td><tt>a.push_back(rv)</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.insert(a.end(), t)</tt></del><br/>
! <ins>Appends a copy of <tt>rv</tt>.</ins><br/>
  <i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, T, T&amp;&amp;&gt;</tt> and
  <tt>T</tt> shall be <tt>MoveAssignable</tt>.</del>
  <ins><tt>T</tt> shall be <tt>MoveConstructible</tt>.</ins></td>
*************** requires <tt>T</tt> to be <tt>MoveConstr
*** 35038,35045 ****
  <tr>
  <td><tt>a.pop_front()</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.erase(a.begin())</tt></del><br>
! <ins>Destroys the first element.</ins><br>
  <ins><i>Requires:</i> <tt>a.empty()</tt> shall be <tt>false</tt>.</ins></td>
  <td><tt>list</tt>, <tt>deque</tt>, <tt>forward_list</tt></td>
  </tr>
--- 35187,35194 ----
  <tr>
  <td><tt>a.pop_front()</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>a.erase(a.begin())</tt></del><br/>
! <ins>Destroys the first element.</ins><br/>
  <ins><i>Requires:</i> <tt>a.empty()</tt> shall be <tt>false</tt>.</ins></td>
  <td><tt>list</tt>, <tt>deque</tt>, <tt>forward_list</tt></td>
  </tr>
*************** requires <tt>T</tt> to be <tt>MoveConstr
*** 35047,35059 ****
  <tr>
  <td><tt>a.pop_back()</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>{ iterator tmp = a.end();<br>--tmp;<br>a.erase(tmp); }</tt></del><br>
! <ins>Destroys the last element.</ins><br>
  <ins><i>Requires:</i> <tt>a.empty()</tt> shall be <tt>false</tt>.</ins></td>
  <td><tt>vector</tt>, <tt>list</tt>, <tt>deque</tt>, <tt>basic_string</tt></td>
  </tr>
  
! </tbody></table>
  
  </blockquote>
  
--- 35196,35208 ----
  <tr>
  <td><tt>a.pop_back()</tt></td>
  <td><tt>void</tt></td>
! <td><del><tt>{ iterator tmp = a.end();<br/>--tmp;<br/>a.erase(tmp); }</tt></del><br/>
! <ins>Destroys the last element.</ins><br/>
  <ins><i>Requires:</i> <tt>a.empty()</tt> shall be <tt>false</tt>.</ins></td>
  <td><tt>vector</tt>, <tt>list</tt>, <tt>deque</tt>, <tt>basic_string</tt></td>
  </tr>
  
! </table>
  
  </blockquote>
  
*************** containers <tt>map</tt> and <tt>multimap
*** 35071,35077 ****
  <tt>mapped_type</tt>. [<i>Note:</i> For example <tt>key_type</tt> and
  <tt>mapped_type</tt> are sometimes required to be <tt>CopyAssignable</tt> even
  though the <tt>value_type</tt> (<tt>pair&lt;const key_type,
! mapped_type&gt;</tt>) is not <tt>CopyAssignable</tt>. — <i>end note</i>]
  </ins></p>
  
  <p>
--- 35220,35226 ----
  <tt>mapped_type</tt>. [<i>Note:</i> For example <tt>key_type</tt> and
  <tt>mapped_type</tt> are sometimes required to be <tt>CopyAssignable</tt> even
  though the <tt>value_type</tt> (<tt>pair&lt;const key_type,
! mapped_type&gt;</tt>) is not <tt>CopyAssignable</tt>. &mdash; <i>end note</i>]
  </ins></p>
  
  <p>
*************** an allocator of a type convertible to <t
*** 35095,35113 ****
  </blockquote>
  
  <p>
! Change or add the following rows in Table 96 — Associative container
  requirements (in addition to container) in 23.2.4 [associative.reqmts]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 96 — Associative container requirements (in addition to
  container)</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
--- 35244,35262 ----
  </blockquote>
  
  <p>
! Change or add the following rows in Table 96 &mdash; Associative container
  requirements (in addition to container) in 23.2.4 [associative.reqmts]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 96 &mdash; Associative container requirements (in addition to
  container)</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
*************** container)</caption>
*** 35127,35160 ****
  </tr>
  
  <tr>
! <td><tt>X(c)<br>X a(c);</tt></td>
  <td></td>
  <td><i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, key_compare,
! key_compare&gt;</tt></del>.<br>
! <ins><tt>key_compare</tt> is <tt>CopyConstructible</tt>.</ins><br>
! Constructs an empty container.<br>
  Uses a copy of <tt>c</tt> as a comparison object.</td>
  <td>constant</td>
  </tr>
  
  <tr>
! <td><tt>X()<br>X a;</tt></td>
  <td></td>
  <td><i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, key_compare,
! key_compare&gt;</tt></del>.<br>
! <ins><tt>key_compare</tt> is <tt>DefaultConstructible</tt>.</ins><br>
! Constructs an empty container.<br>
  Uses <tt>Compare()</tt> as a comparison object.</td>
  <td>constant</td>
  </tr>
  
  <tr>
! <td><tt>X(i, j, c)<br>X a(i, j, c);</tt></td>
  <td></td>
  <td><i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, key_compare,
! key_compare&gt;</tt></del>.<br>
  <ins><tt>key_compare</tt> is <tt>CopyConstructible</tt>. <tt>value_type</tt>
! shall be constructible from <tt>*i</tt>.</ins><br>
  Constructs an empty container ans inserts elements from the range <tt>[i,
  j)</tt> into it; uses <tt>c</tt> as a comparison object.</td>
  <td><tt>N</tt> log <tt>N</tt> in general (<tt>N</tt> is the distance from
--- 35276,35309 ----
  </tr>
  
  <tr>
! <td><tt>X(c)<br/>X a(c);</tt></td>
  <td></td>
  <td><i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, key_compare,
! key_compare&gt;</tt></del>.<br/>
! <ins><tt>key_compare</tt> is <tt>CopyConstructible</tt>.</ins><br/>
! Constructs an empty container.<br/>
  Uses a copy of <tt>c</tt> as a comparison object.</td>
  <td>constant</td>
  </tr>
  
  <tr>
! <td><tt>X()<br/>X a;</tt></td>
  <td></td>
  <td><i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, key_compare,
! key_compare&gt;</tt></del>.<br/>
! <ins><tt>key_compare</tt> is <tt>DefaultConstructible</tt>.</ins><br/>
! Constructs an empty container.<br/>
  Uses <tt>Compare()</tt> as a comparison object.</td>
  <td>constant</td>
  </tr>
  
  <tr>
! <td><tt>X(i, j, c)<br/>X a(i, j, c);</tt></td>
  <td></td>
  <td><i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, key_compare,
! key_compare&gt;</tt></del>.<br/>
  <ins><tt>key_compare</tt> is <tt>CopyConstructible</tt>. <tt>value_type</tt>
! shall be constructible from <tt>*i</tt>.</ins><br/>
  Constructs an empty container ans inserts elements from the range <tt>[i,
  j)</tt> into it; uses <tt>c</tt> as a comparison object.</td>
  <td><tt>N</tt> log <tt>N</tt> in general (<tt>N</tt> is the distance from
*************** j)</tt> into it; uses <tt>c</tt> as a co
*** 35163,35174 ****
  </tr>
  
  <tr>
! <td><tt>X(i, j)<br>X a(i, j);</tt></td>
  <td></td>
  <td><i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, key_compare,
! key_compare&gt;</tt></del>.<br> <ins><tt>value_type</tt> shall be constructible
  from <tt>*i</tt>. <tt>key_compare</tt> is
! <tt>DefaultConstructible</tt>.</ins><br> Same as above, but uses
  <tt>Compare()</tt> as a comparison object.</td>
  <td>same as above</td>
  </tr>
--- 35312,35323 ----
  </tr>
  
  <tr>
! <td><tt>X(i, j)<br/>X a(i, j);</tt></td>
  <td></td>
  <td><i>Requires:</i> <del><tt>ConstructibleAsElement&lt;A, key_compare,
! key_compare&gt;</tt></del>.<br/> <ins><tt>value_type</tt> shall be constructible
  from <tt>*i</tt>. <tt>key_compare</tt> is
! <tt>DefaultConstructible</tt>.</ins><br/> Same as above, but uses
  <tt>Compare()</tt> as a comparison object.</td>
  <td>same as above</td>
  </tr>
*************** from <tt>*i</tt>. <tt>key_compare</tt> i
*** 35176,35185 ****
  <tr>
  <td><tt>a = il</tt></td>
  <td><tt>X&amp;</tt></td>
! <td><del><tt>a = X(il);<br>
! return *this;</tt></del><br>
  <ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt>.</ins><br>
  <ins>Assigns the range <tt>[il.begin(), il.end())</tt> into <tt>a</tt>.  All
  existing elements of <tt>a</tt> are either assigned or destroyed.</ins></td>
  <td><del>Same as <tt><tt>a = X(il)</tt></tt>.</del>
--- 35325,35334 ----
  <tr>
  <td><tt>a = il</tt></td>
  <td><tt>X&amp;</tt></td>
! <td><del><tt>a = X(il);<br/>
! return *this;</tt></del><br/>
  <ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt>.</ins><br/>
  <ins>Assigns the range <tt>[il.begin(), il.end())</tt> into <tt>a</tt>.  All
  existing elements of <tt>a</tt> are either assigned or destroyed.</ins></td>
  <td><del>Same as <tt><tt>a = X(il)</tt></tt>.</del>
*************** existing elements of <tt>a</tt> are eith
*** 35192,35198 ****
  <td><tt>a_uniq.emplace(args)</tt></td>
  <td><tt>pair&lt;iterator, bool&gt;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br>
  inserts a <tt>T</tt> object <tt>t</tt> constructed with
  <tt>std::forward&lt;Args&gt;(args)...</tt> if and only if there is no element in
  the container with key equivalent to the key of <tt>t</tt>. The <tt>bool</tt>
--- 35341,35347 ----
  <td><tt>a_uniq.emplace(args)</tt></td>
  <td><tt>pair&lt;iterator, bool&gt;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br/>
  inserts a <tt>T</tt> object <tt>t</tt> constructed with
  <tt>std::forward&lt;Args&gt;(args)...</tt> if and only if there is no element in
  the container with key equivalent to the key of <tt>t</tt>. The <tt>bool</tt>
*************** to the key of <tt>t</tt>.</td>
*** 35206,35212 ****
  <td><tt>a_eq.emplace(args)</tt></td>
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br>
  inserts a <tt>T</tt> object <tt>t</tt> constructed with
  <tt>std::forward&lt;Args&gt;(args)...</tt> and returns the iterator pointing to
  the newly inserted element.</td>
--- 35355,35361 ----
  <td><tt>a_eq.emplace(args)</tt></td>
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br/>
  inserts a <tt>T</tt> object <tt>t</tt> constructed with
  <tt>std::forward&lt;Args&gt;(args)...</tt> and returns the iterator pointing to
  the newly inserted element.</td>
*************** the newly inserted element.</td>
*** 35218,35224 ****
  <td><tt>pair&lt;iterator, bool&gt;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br>
  inserts <tt>t</tt> if and only if there is no element in the container with key
  equivalent to the key of <tt>t</tt>. The <tt>bool</tt> component of the returned
  pair is true if and only if the insertion takes place, and the iterator
--- 35367,35373 ----
  <td><tt>pair&lt;iterator, bool&gt;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br/>
  inserts <tt>t</tt> if and only if there is no element in the container with key
  equivalent to the key of <tt>t</tt>. The <tt>bool</tt> component of the returned
  pair is true if and only if the insertion takes place, and the iterator
*************** component of the pair points to the elem
*** 35232,35238 ****
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br>
  inserts <tt>t</tt> and returns the iterator pointing to the newly inserted
  element. If a range containing elements equivalent to <tt>t</tt> exists in
  <tt>a_eq</tt>, <tt>t</tt> is inserted at the end of that range.</td>
--- 35381,35387 ----
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br/>
  inserts <tt>t</tt> and returns the iterator pointing to the newly inserted
  element. If a range containing elements equivalent to <tt>t</tt> exists in
  <tt>a_eq</tt>, <tt>t</tt> is inserted at the end of that range.</td>
*************** element. If a range containing elements
*** 35244,35250 ****
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br>
  inserts <tt>t</tt> if and only if there is no element with key equivalent to the
  key of <tt>t</tt> in containers with unique keys; always inserts <tt>t</tt> in
  containers with equivalent keys; always returns the iterator pointing to the
--- 35393,35399 ----
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br/>
  inserts <tt>t</tt> if and only if there is no element with key equivalent to the
  key of <tt>t</tt> in containers with unique keys; always inserts <tt>t</tt> in
  containers with equivalent keys; always returns the iterator pointing to the
*************** right before <tt>p</tt>.</td>
*** 35258,35264 ****
  <td><tt>a.insert(i, j)</tt></td>
  <td><tt>void</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be
! constructible from <tt>*i</tt>.</ins><br>
  pre: <tt>i</tt>, <tt>j</tt> are not iterators into <tt>a</tt>. inserts each
  element from the range <tt>[i,j)</tt> if and only if there is no element with
  key equivalent to the key of that element in containers with unique keys; always
--- 35407,35413 ----
  <td><tt>a.insert(i, j)</tt></td>
  <td><tt>void</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be
! constructible from <tt>*i</tt>.</ins><br/>
  pre: <tt>i</tt>, <tt>j</tt> are not iterators into <tt>a</tt>. inserts each
  element from the range <tt>[i,j)</tt> if and only if there is no element with
  key equivalent to the key of that element in containers with unique keys; always
*************** inserts that element in containers with
*** 35266,35272 ****
  <td>N log(size() + N ) (N is the distance from i to j)</td>
  </tr>
  
! </tbody></table>
  
  </blockquote>
  
--- 35415,35421 ----
  <td>N log(size() + N ) (N is the distance from i to j)</td>
  </tr>
  
! </table>
  
  </blockquote>
  
*************** the requirements placed on <tt>value_typ
*** 35283,35289 ****
  directly to <tt>key_type</tt> and <tt>mapped_type</tt>. [<i>Note:</i> For
  example <tt>key_type</tt> and <tt>mapped_type</tt> are sometimes required to be
  <tt>CopyAssignable</tt> even though the <tt>value_type</tt> (<tt>pair&lt;const
! key_type, mapped_type&gt;</tt>) is not <tt>CopyAssignable</tt>. — <i>end
  note</i>]
  </ins></p>
  
--- 35432,35438 ----
  directly to <tt>key_type</tt> and <tt>mapped_type</tt>. [<i>Note:</i> For
  example <tt>key_type</tt> and <tt>mapped_type</tt> are sometimes required to be
  <tt>CopyAssignable</tt> even though the <tt>value_type</tt> (<tt>pair&lt;const
! key_type, mapped_type&gt;</tt>) is not <tt>CopyAssignable</tt>. &mdash; <i>end
  note</i>]
  </ins></p>
  
*************** note</i>]
*** 35293,35311 ****
  </blockquote>
  
  <p>
! Change or add the following rows in Table 98 — Unordered associative
  container requirements (in addition to container) in 23.2.5 [unord.req]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 98 — Unordered associative
  container requirements (in addition to container)</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
--- 35442,35460 ----
  </blockquote>
  
  <p>
! Change or add the following rows in Table 98 &mdash; Unordered associative
  container requirements (in addition to container) in 23.2.5 [unord.req]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 98 &mdash; Unordered associative
  container requirements (in addition to container)</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
*************** container requirements (in addition to c
*** 35326,35332 ****
  </tr>
  
  <tr>
! <td><tt>X(n, hf, eq)<br>X a(n, hf, eq)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>hasher</tt>  and <tt>key_equal</tt> are
  <tt>CopyConstructible</tt>.</ins> Constructs an empty container with at least
--- 35475,35481 ----
  </tr>
  
  <tr>
! <td><tt>X(n, hf, eq)<br/>X a(n, hf, eq)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>hasher</tt>  and <tt>key_equal</tt> are
  <tt>CopyConstructible</tt>.</ins> Constructs an empty container with at least
*************** the key equality predicate. </td>
*** 35336,35342 ****
  </tr>
  
  <tr>
! <td><tt>X(n, hf)<br>X a(n, hf)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>hasher</tt> is <tt>CopyConstructible</tt> and 
  <tt>key_equal</tt> is <tt>DefaultConstructible</tt>.</ins> Constructs an empty
--- 35485,35491 ----
  </tr>
  
  <tr>
! <td><tt>X(n, hf)<br/>X a(n, hf)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>hasher</tt> is <tt>CopyConstructible</tt> and 
  <tt>key_equal</tt> is <tt>DefaultConstructible</tt>.</ins> Constructs an empty
*************** function and <tt>key_equal()</tt> as the
*** 35346,35352 ****
  </tr>
  
  <tr>
! <td><tt>X(n)<br>X a(n)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>hasher</tt>  and <tt>key_equal</tt> are
  <tt>DefaultConstructible</tt>.</ins> Constructs an empty container with at least
--- 35495,35501 ----
  </tr>
  
  <tr>
! <td><tt>X(n)<br/>X a(n)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>hasher</tt>  and <tt>key_equal</tt> are
  <tt>DefaultConstructible</tt>.</ins> Constructs an empty container with at least
*************** the key equality predicate. </td>
*** 35356,35362 ****
  </tr>
  
  <tr>
! <td><tt>X()<br>X a</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>hasher</tt>  and <tt>key_equal</tt> are
  <tt>DefaultConstructible</tt>.</ins> Constructs an empty container an unspecified number of buckets,
--- 35505,35511 ----
  </tr>
  
  <tr>
! <td><tt>X()<br/>X a</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>hasher</tt>  and <tt>key_equal</tt> are
  <tt>DefaultConstructible</tt>.</ins> Constructs an empty container an unspecified number of buckets,
*************** the key equality predicate. </td>
*** 35366,35376 ****
  </tr>
  
  <tr>
! <td><tt>X(i, j, n, hf, eq)<br>X a(i, j, n, hf, eq)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>value_type</tt> is constructible from
  <tt>*i</tt>. <tt>hasher</tt>  and <tt>key_equal</tt> are
! <tt>CopyConstructible</tt>.</ins><br>
  Constructs an empty container with at least <tt>n</tt> buckets, using
  <tt>hf</tt> as the hash function and <tt>eq</tt> as the key equality predicate,
  and inserts elements from <tt>[i, j)</tt> into it.</td>
--- 35515,35525 ----
  </tr>
  
  <tr>
! <td><tt>X(i, j, n, hf, eq)<br/>X a(i, j, n, hf, eq)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>value_type</tt> is constructible from
  <tt>*i</tt>. <tt>hasher</tt>  and <tt>key_equal</tt> are
! <tt>CopyConstructible</tt>.</ins><br/>
  Constructs an empty container with at least <tt>n</tt> buckets, using
  <tt>hf</tt> as the hash function and <tt>eq</tt> as the key equality predicate,
  and inserts elements from <tt>[i, j)</tt> into it.</td>
*************** case <tt>O(N<sup>2</sup>)</tt></td>
*** 35379,35389 ****
  </tr>
  
  <tr>
! <td><tt>X(i, j, n, hf)<br>X a(i, j, n, hf)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>value_type</tt> is constructible from <tt>*i</tt>.
  <tt>hasher</tt> is <tt>CopyConstructible</tt> and <tt>key_equal</tt> is
! <tt>DefaultConstructible</tt>.</ins><br> Constructs an empty container with at
  least <tt>n</tt> buckets, using <tt>hf</tt> as the hash function and
  <tt>key_equal()</tt> as the key equality predicate, and inserts elements from
  <tt>[i, j)</tt> into it.</td>
--- 35528,35538 ----
  </tr>
  
  <tr>
! <td><tt>X(i, j, n, hf)<br/>X a(i, j, n, hf)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>value_type</tt> is constructible from <tt>*i</tt>.
  <tt>hasher</tt> is <tt>CopyConstructible</tt> and <tt>key_equal</tt> is
! <tt>DefaultConstructible</tt>.</ins><br/> Constructs an empty container with at
  least <tt>n</tt> buckets, using <tt>hf</tt> as the hash function and
  <tt>key_equal()</tt> as the key equality predicate, and inserts elements from
  <tt>[i, j)</tt> into it.</td>
*************** case <tt>O(N<sup>2</sup>)</tt></td>
*** 35392,35402 ****
  </tr>
  
  <tr>
! <td><tt>X(i, j, n)<br>X a(i, j, n)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>value_type</tt> is constructible from <tt>*i</tt>.
  <tt>hasher</tt> and <tt>key_equal</tt> are
! <tt>DefaultConstructible</tt>.</ins><br> Constructs an empty container with at
  least <tt>n</tt> buckets, using <tt>hasher()</tt> as the hash function and
  <tt>key_equal()</tt> as the key equality predicate, and inserts elements from
  <tt>[i, j)</tt> into it.</td>
--- 35541,35551 ----
  </tr>
  
  <tr>
! <td><tt>X(i, j, n)<br/>X a(i, j, n)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>value_type</tt> is constructible from <tt>*i</tt>.
  <tt>hasher</tt> and <tt>key_equal</tt> are
! <tt>DefaultConstructible</tt>.</ins><br/> Constructs an empty container with at
  least <tt>n</tt> buckets, using <tt>hasher()</tt> as the hash function and
  <tt>key_equal()</tt> as the key equality predicate, and inserts elements from
  <tt>[i, j)</tt> into it.</td>
*************** case <tt>O(N<sup>2</sup>)</tt></td>
*** 35405,35415 ****
  </tr>
  
  <tr>
! <td><tt>X(i, j)<br>X a(i, j)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>value_type</tt> is constructible from <tt>*i</tt>.
  <tt>hasher</tt> and <tt>key_equal</tt> are
! <tt>DefaultConstructible</tt>.</ins><br> Constructs an empty container with an
  unspecified number of buckets, using <tt>hasher()</tt> as the hash function and
  <tt>key_equal()</tt> as the key equality predicate, and inserts elements from
  <tt>[i, j)</tt> into it.</td>
--- 35554,35564 ----
  </tr>
  
  <tr>
! <td><tt>X(i, j)<br/>X a(i, j)</tt></td>
  <td><tt>X</tt></td>
  <td><ins><i>Requires:</i> <tt>value_type</tt> is constructible from <tt>*i</tt>.
  <tt>hasher</tt> and <tt>key_equal</tt> are
! <tt>DefaultConstructible</tt>.</ins><br/> Constructs an empty container with an
  unspecified number of buckets, using <tt>hasher()</tt> as the hash function and
  <tt>key_equal()</tt> as the key equality predicate, and inserts elements from
  <tt>[i, j)</tt> into it.</td>
*************** case <tt>O(N<sup>2</sup>)</tt></td>
*** 35418,35424 ****
  </tr>
  
  <tr>
! <td><tt>X(b)<br>X a(b)</tt></td>
  <td><tt>X</tt></td>
  <td>Copy constructor. In addition to the <del>contained elements</del>
  <ins>requirements of Table 93 (23.2.1 [container.requirements.general])</ins>, copies the hash function,
--- 35567,35573 ----
  </tr>
  
  <tr>
! <td><tt>X(b)<br/>X a(b)</tt></td>
  <td><tt>X</tt></td>
  <td>Copy constructor. In addition to the <del>contained elements</del>
  <ins>requirements of Table 93 (23.2.1 [container.requirements.general])</ins>, copies the hash function,
*************** predicate, and maximum load factor.</td>
*** 35438,35446 ****
  <tr>
  <td><tt>a = il</tt></td>
  <td><tt>X&amp;</tt></td>
! <td><del><tt>a = X(il); return *this;</tt></del><br>
  <ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt>.</ins><br>
  <ins>Assigns the range <tt>[il.begin(), il.end())</tt> into <tt>a</tt>.  All
  existing elements of <tt>a</tt> are either assigned or destroyed.</ins></td>
  <td>Average case linear in <tt>il.size()</tt>, worst case quadratic.</td>
--- 35587,35595 ----
  <tr>
  <td><tt>a = il</tt></td>
  <td><tt>X&amp;</tt></td>
! <td><del><tt>a = X(il); return *this;</tt></del><br/>
  <ins><i>Requires:</i> <tt>T</tt> is <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt>.</ins><br/>
  <ins>Assigns the range <tt>[il.begin(), il.end())</tt> into <tt>a</tt>.  All
  existing elements of <tt>a</tt> are either assigned or destroyed.</ins></td>
  <td>Average case linear in <tt>il.size()</tt>, worst case quadratic.</td>
*************** existing elements of <tt>a</tt> are eith
*** 35450,35456 ****
  <td><tt>a_uniq.emplace(args)</tt></td>
  <td><tt>pair&lt;iterator, bool&gt;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br>
  inserts a <tt>T</tt> object <tt>t</tt> constructed with
  <tt>std::forward&lt;Args&gt;(args)...</tt> if and only if there is no element in
  the container with key equivalent to the key of <tt>t</tt>. The <tt>bool</tt>
--- 35599,35605 ----
  <td><tt>a_uniq.emplace(args)</tt></td>
  <td><tt>pair&lt;iterator, bool&gt;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br/>
  inserts a <tt>T</tt> object <tt>t</tt> constructed with
  <tt>std::forward&lt;Args&gt;(args)...</tt> if and only if there is no element in
  the container with key equivalent to the key of <tt>t</tt>. The <tt>bool</tt>
*************** to the key of <tt>t</tt>.</td>
*** 35464,35470 ****
  <td><tt>a_eq.emplace(args)</tt></td>
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br>
  inserts a <tt>T</tt> object <tt>t</tt> constructed with
  <tt>std::forward&lt;Args&gt;(args)...</tt> and returns the iterator pointing to
  the newly inserted element.</td>
--- 35613,35619 ----
  <td><tt>a_eq.emplace(args)</tt></td>
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br/>
  inserts a <tt>T</tt> object <tt>t</tt> constructed with
  <tt>std::forward&lt;Args&gt;(args)...</tt> and returns the iterator pointing to
  the newly inserted element.</td>
*************** the newly inserted element.</td>
*** 35475,35481 ****
  <td><tt>a.emplace_hint(p, args)</tt></td>
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br>
  equivalent to <tt>a.emplace( std::forward&lt;Args&gt;(args)...)</tt>. Return
  value is an iterator pointing to the element with the key equivalent to the
  newly inserted element. The <tt>const_iterator p</tt> is a hint pointing to
--- 35624,35630 ----
  <td><tt>a.emplace_hint(p, args)</tt></td>
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be constructible from
! <tt>args</tt></ins><br/>
  equivalent to <tt>a.emplace( std::forward&lt;Args&gt;(args)...)</tt>. Return
  value is an iterator pointing to the element with the key equivalent to the
  newly inserted element. The <tt>const_iterator p</tt> is a hint pointing to
*************** hint.</td>
*** 35489,35495 ****
  <td><tt>pair&lt;iterator, bool&gt;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br>
  Inserts <tt>t</tt> if and only if there is no element in the container with key
  equivalent to the key of <tt>t</tt>. The <tt>bool</tt> component of the returned
  pair indicates whether the insertion takes place, and the iterator component
--- 35638,35644 ----
  <td><tt>pair&lt;iterator, bool&gt;</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br/>
  Inserts <tt>t</tt> if and only if there is no element in the container with key
  equivalent to the key of <tt>t</tt>. The <tt>bool</tt> component of the returned
  pair indicates whether the insertion takes place, and the iterator component
*************** points to the element with key equivalen
*** 35502,35508 ****
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br>
  Inserts <tt>t</tt>, and returns an iterator pointing to the newly inserted
  element.</td>
  <td>Average case O(1), worst case O(<tt>a_uniq.size()</tt>).</td>
--- 35651,35657 ----
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br/>
  Inserts <tt>t</tt>, and returns an iterator pointing to the newly inserted
  element.</td>
  <td>Average case O(1), worst case O(<tt>a_uniq.size()</tt>).</td>
*************** element.</td>
*** 35513,35519 ****
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br>
  Equivalent to <tt>a.insert(t)</tt>. Return value is an iterator pointing to the
  element with the key equivalent to that of <tt>t</tt>. The iterator <tt>q</tt>
  is a hint pointing to where the search should start. Implementations are
--- 35662,35668 ----
  <td><tt>iterator</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt> if
  <tt>t</tt> is a non-const rvalue expression, else <tt>T</tt> shall be
! <tt>CopyConstructible</tt>.</ins><br/>
  Equivalent to <tt>a.insert(t)</tt>. Return value is an iterator pointing to the
  element with the key equivalent to that of <tt>t</tt>. The iterator <tt>q</tt>
  is a hint pointing to where the search should start. Implementations are
*************** permitted to ignore the hint.</td>
*** 35525,35546 ****
  <td><tt>a.insert(i, j)</tt></td>
  <td><tt>void</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be
! constructible from <tt>*i</tt>.</ins><br>
  Pre: <tt>i</tt> and <tt>j</tt> are not iterators in <tt>a</tt>. Equivalent to
  <tt>a.insert(t)</tt> for each element in <tt>[i,j)</tt>.</td>
  <td>Average case O(<tt>N</tt>), where <tt>N</tt> is <tt>distance(i, j)</tt>.
  Worst case O(<tt>N * a.size()</tt>).</td>
  </tr>
  
! </tbody></table>
  
  </blockquote>
  
  <p>
! Change 23.3.3 [forwardlist]/2:
  </p>
  
! <blockquote>
  2 A <tt>forward_list</tt> satisfies all of the requirements of a container
  (table 91), except that the <tt>size()</tt> member function is not provided.
  <ins>A <tt>forward_list</tt> also satisfies all of the requirements of an
--- 35674,35695 ----
  <td><tt>a.insert(i, j)</tt></td>
  <td><tt>void</tt></td>
  <td><ins><i>Requires:</i> <tt>T</tt> shall be
! constructible from <tt>*i</tt>.</ins><br/>
  Pre: <tt>i</tt> and <tt>j</tt> are not iterators in <tt>a</tt>. Equivalent to
  <tt>a.insert(t)</tt> for each element in <tt>[i,j)</tt>.</td>
  <td>Average case O(<tt>N</tt>), where <tt>N</tt> is <tt>distance(i, j)</tt>.
  Worst case O(<tt>N * a.size()</tt>).</td>
  </tr>
  
! </table>
  
  </blockquote>
  
  <p>
! Change 23.3.4 [forwardlist]/2:
  </p>
  
! <blockquote><p>
  2 A <tt>forward_list</tt> satisfies all of the requirements of a container
  (table 91), except that the <tt>size()</tt> member function is not provided.
  <ins>A <tt>forward_list</tt> also satisfies all of the requirements of an
*************** requirements, and several of the optiona
*** 35551,35563 ****
  Descriptions are provided here only for operations on <tt>forward_list</tt> that
  are not described in that table or for operations where there is additional
  semantic information.
! </blockquote>
  
  <p>
! Add a new paragraph after 23.3.3.4 [forwardlist.modifiers]/23:
  </p>
  
! <blockquote><pre>void clear();
  </pre>
  
  <blockquote>
--- 35700,35713 ----
  Descriptions are provided here only for operations on <tt>forward_list</tt> that
  are not described in that table or for operations where there is additional
  semantic information.
! </p></blockquote>
  
  <p>
! Add a new paragraph after 23.3.4.5 [forwardlist.modifiers]/23:
  </p>
  
! <blockquote><pre>
! void clear();
  </pre>
  
  <blockquote>
*************** Add a new paragraph after 23.3.3.4 [forw
*** 35571,35590 ****
  </blockquote>
  
  <p>
! Change 23.4.1.2 [vector.capacity]/13:
  </p>
  
! <blockquote><pre>void resize(size_type sz, const T&amp; c);
  </pre>
! <blockquote>
  13 <i>Requires:</i> <ins><tt>T</tt> shall be <tt>CopyConstructible</tt>.</ins>
  If <tt>value_type</tt> has a move constructor, that constructor shall not throw
  any exceptions.
! </blockquote>
  </blockquote>
  
  <p>
! In 23.7.3 [unord.set] and 23.7.4 [unord.multiset] substitute
  "<tt>Key</tt>" for "<tt>Value</tt>".
  </p>
  
--- 35721,35741 ----
  </blockquote>
  
  <p>
! Change 23.3.6.3 [vector.capacity]/13:
  </p>
  
! <blockquote><pre>
! void resize(size_type sz, const T&amp; c);
  </pre>
! <blockquote><p>
  13 <i>Requires:</i> <ins><tt>T</tt> shall be <tt>CopyConstructible</tt>.</ins>
  If <tt>value_type</tt> has a move constructor, that constructor shall not throw
  any exceptions.
! </p></blockquote>
  </blockquote>
  
  <p>
! In 23.5.6 [unord.set] and 23.5.7 [unord.multiset] substitute
  "<tt>Key</tt>" for "<tt>Value</tt>".
  </p>
  
*************** The above substitution is normative as i
*** 35602,35614 ****
  
  <hr>
  <h3><a name="705"></a>705. type-trait <tt>decay</tt> incompletely specified</h3>
! <p><b>Section:</b> 20.7.7.6 [meta.trans.other] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2007-07-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The current working draft has a type-trait <tt>decay</tt> in 20.7.7.6 [meta.trans.other].
  </p>
  
  <p>
--- 35753,35766 ----
  
  <hr>
  <h3><a name="705"></a>705. type-trait <tt>decay</tt> incompletely specified</h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2007-07-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The current working draft has a type-trait <tt>decay</tt> in 20.10.7.6 [meta.trans.other].
  </p>
  
  <p>
*************** cv-qualification, as pass-by-value does.
*** 35622,35628 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.7.7.6 [meta.trans.other] change the last sentence:
  </p>
  
  <blockquote><p>
--- 35774,35780 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.10.7.6 [meta.trans.other] change the last sentence:
  </p>
  
  <blockquote><p>
*************** is <tt>X&amp;</tt> if <tt>Ui</tt> equals
*** 35653,35665 ****
  
  <hr>
  <h3><a name="706"></a>706. <tt>make_pair()</tt> should behave as <tt>make_tuple()</tt> wrt. <tt>reference_wrapper()</tt></h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2007-07-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The current draft has <tt>make_pair()</tt> in 20.3.5 [pairs]/16
  and <tt>make_tuple()</tt> in 20.4.2.4 [tuple.creation].
  <tt>make_tuple()</tt> detects the presence of
  <tt>reference_wrapper&lt;X&gt;</tt> arguments and "unwraps" the reference in
--- 35805,35817 ----
  
  <hr>
  <h3><a name="706"></a>706. <tt>make_pair()</tt> should behave as <tt>make_tuple()</tt> wrt. <tt>reference_wrapper()</tt></h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2007-07-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The current draft has <tt>make_pair()</tt> in 20.3 [pairs]/16
  and <tt>make_tuple()</tt> in 20.4.2.4 [tuple.creation].
  <tt>make_tuple()</tt> detects the presence of
  <tt>reference_wrapper&lt;X&gt;</tt> arguments and "unwraps" the reference in
*************** confusion.
*** 35672,35687 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.3 [utility] change the synopsis for make_pair() to read
  </p>
  
! <blockquote><pre>template &lt;class T1, class T2&gt;
    pair&lt;<del>typename decay&lt;T1&gt;::type</del> <ins>V1</ins>, <del>typename decay&lt;T2&gt;::type</del> <ins>V2</ins>&gt; make_pair(T1&amp;&amp;, T2&amp;&amp;);
  </pre></blockquote>
  
  <p>
! In 20.3.5 [pairs]/16 change the declaration to match the above synopsis.
! Then change the 20.3.5 [pairs]/17 to:
  </p>
  
  <blockquote>
--- 35824,35840 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.2 [utility] change the synopsis for make_pair() to read
  </p>
  
! <blockquote><pre>
! template &lt;class T1, class T2&gt;
    pair&lt;<del>typename decay&lt;T1&gt;::type</del> <ins>V1</ins>, <del>typename decay&lt;T2&gt;::type</del> <ins>V2</ins>&gt; make_pair(T1&amp;&amp;, T2&amp;&amp;);
  </pre></blockquote>
  
  <p>
! In 20.3 [pairs]/16 change the declaration to match the above synopsis.
! Then change the 20.3 [pairs]/17 to:
  </p>
  
  <blockquote>
*************** Then change the 20.3.5 [pairs]/17 to:
*** 35702,35711 ****
  
  <hr>
  <h3><a name="709"></a>709. <tt>char_traits::not_eof</tt> has wrong signature</h3>
! <p><b>Section:</b> 21.2.3 [char.traits.specializations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-08-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#char.traits.specializations">issues</a> in [char.traits.specializations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The changes made for <tt>constexpr</tt> in 21.2.3 [char.traits.specializations] have 
--- 35855,35864 ----
  
  <hr>
  <h3><a name="709"></a>709. <tt>char_traits::not_eof</tt> has wrong signature</h3>
! <p><b>Section:</b> 21.2.3 [char.traits.specializations] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2007-08-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#char.traits.specializations">issues</a> in [char.traits.specializations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The changes made for <tt>constexpr</tt> in 21.2.3 [char.traits.specializations] have 
*************** Change the signature in 21.2.3.1 [char.t
*** 35740,35746 ****
  and 21.2.3.4 [char.traits.specializations.wchar.t] to
  </p>
  
! <blockquote><pre>static constexpr int_type not_eof(<del>char_type</del> <ins>int_type</ins> c);
  </pre></blockquote>
  
  
--- 35893,35900 ----
  and 21.2.3.4 [char.traits.specializations.wchar.t] to
  </p>
  
! <blockquote><pre>
! static constexpr int_type not_eof(<del>char_type</del> <ins>int_type</ins> c);
  </pre></blockquote>
  
  
*************** Bellevue:
*** 35750,35777 ****
  ]</i></p>
  
  
! <blockquote>
  Resolution: NAD editorial - up to Pete's judgment
! </blockquote>
  
  <p><i>[
  Post Sophia Antipolis
  ]</i></p>
  
  
! <blockquote>
  Moved from Pending NAD Editorial to Review.  The proposed wording appears to be correct but non-editorial.
! </blockquote>
  
  
  
  
  <hr>
  <h3><a name="710"></a>710. Missing postconditions</h3>
! <p><b>Section:</b> 20.9.10.2 [util.smartptr.shared] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-08-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A discussion on
--- 35904,35932 ----
  ]</i></p>
  
  
! <blockquote><p>
  Resolution: NAD editorial - up to Pete's judgment
! </p></blockquote>
  
  <p><i>[
  Post Sophia Antipolis
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Pending NAD Editorial to Review.  The proposed wording appears to be correct but non-editorial.
! </p></blockquote>
  
  
  
  
  <hr>
  <h3><a name="710"></a>710. Missing postconditions</h3>
! <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-08-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A discussion on
*************** editor should consider rewording "If w i
*** 35801,35811 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 20.9.10.2.1 [util.smartptr.shared.const]:
  </p>
  
  <blockquote>
! <pre>shared_ptr(shared_ptr&amp;&amp; r);
  template&lt;class Y&gt; shared_ptr(shared_ptr&lt;Y&gt;&amp;&amp; r);
  </pre>
  <blockquote>
--- 35956,35967 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 20.8.2.2.1 [util.smartptr.shared.const]:
  </p>
  
  <blockquote>
! <pre>
! shared_ptr(shared_ptr&amp;&amp; r);
  template&lt;class Y&gt; shared_ptr(shared_ptr&lt;Y&gt;&amp;&amp; r);
  </pre>
  <blockquote>
*************** shall be empty. <ins><tt>r.get() == 0</t
*** 35817,35827 ****
  </blockquote>
  
  <p>
! Add to 20.9.10.2.10 [util.smartptr.shared.cast]:
  </p>
  
  <blockquote>
! <pre>template&lt;class T, class U&gt; shared_ptr&lt;T&gt; static_pointer_cast(shared_ptr&lt;U&gt; const&amp; r);
  </pre>
  <blockquote>
  <p>
--- 35973,35984 ----
  </blockquote>
  
  <p>
! Add to 20.8.2.2.9 [util.smartptr.shared.cast]:
  </p>
  
  <blockquote>
! <pre>
! template&lt;class T, class U&gt; shared_ptr&lt;T&gt; static_pointer_cast(shared_ptr&lt;U&gt; const&amp; r);
  </pre>
  <blockquote>
  <p>
*************** Add to 20.9.10.2.10 [util.smartptr.share
*** 35832,35838 ****
  </blockquote>
  
  <blockquote>
! <pre>template&lt;class T, class U&gt; shared_ptr&lt;T&gt; dynamic_pointer_cast(shared_ptr&lt;U&gt; const&amp; r);
  </pre>
  <blockquote>
  <p>
--- 35989,35996 ----
  </blockquote>
  
  <blockquote>
! <pre>
! template&lt;class T, class U&gt; shared_ptr&lt;T&gt; dynamic_pointer_cast(shared_ptr&lt;U&gt; const&amp; r);
  </pre>
  <blockquote>
  <p>
*************** Add to 20.9.10.2.10 [util.smartptr.share
*** 35842,35848 ****
  </blockquote>
  
  <blockquote>
! <pre>template&lt;class T, class U&gt; shared_ptr&lt;T&gt; const_pointer_cast(shared_ptr&lt;U&gt; const&amp; r);
  </pre>
  <blockquote>
  <p>
--- 36000,36007 ----
  </blockquote>
  
  <blockquote>
! <pre>
! template&lt;class T, class U&gt; shared_ptr&lt;T&gt; const_pointer_cast(shared_ptr&lt;U&gt; const&amp; r);
  </pre>
  <blockquote>
  <p>
*************** the aliasing constructor as follows:
*** 35860,35866 ****
  </p>
  
  <p>
! Change 20.9.10.2.10 [util.smartptr.shared.cast]:
  </p>
  
  <blockquote>
--- 36019,36025 ----
  </p>
  
  <p>
! Change 20.8.2.2.9 [util.smartptr.shared.cast]:
  </p>
  
  <blockquote>
*************** in the aliasing constructor postconditio
*** 35907,35916 ****
  
  <hr>
  <h3><a name="711"></a>711. Contradiction in empty <tt>shared_ptr</tt></h3>
! <p><b>Section:</b> 20.9.10.2.5 [util.smartptr.shared.obs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-08-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.obs">issues</a> in [util.smartptr.shared.obs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A discussion on
--- 36066,36075 ----
  
  <hr>
  <h3><a name="711"></a>711. Contradiction in empty <tt>shared_ptr</tt></h3>
! <p><b>Section:</b> 20.8.2.2.5 [util.smartptr.shared.obs] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2007-08-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.obs">issues</a> in [util.smartptr.shared.obs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A discussion on
*************** The note:
*** 35928,35934 ****
  after the aliasing constructor
  </p>
  
! <blockquote><pre>template&lt;class Y&gt; shared_ptr(shared_ptr&lt;Y&gt; const&amp; r, T *p);
  </pre></blockquote>
  
  <p>
--- 36087,36094 ----
  after the aliasing constructor
  </p>
  
! <blockquote><pre>
! template&lt;class Y&gt; shared_ptr(shared_ptr&lt;Y&gt; const&amp; r, T *p);
  </pre></blockquote>
  
  <p>
*************** with a non-NULL stored pointer.
*** 35939,35949 ****
  </p>
  
  <p>
! This is contradicted by the second sentence in the Returns clause of 20.9.10.2.5 [util.smartptr.shared.obs]:
  </p>
  
  <blockquote>
! <pre>T* get() const;
  </pre>
  <blockquote><p>
  <i>Returns:</i> the stored pointer. Returns a null pointer if <tt>*this</tt> is empty.
--- 36099,36110 ----
  </p>
  
  <p>
! This is contradicted by the second sentence in the Returns clause of 20.8.2.2.5 [util.smartptr.shared.obs]:
  </p>
  
  <blockquote>
! <pre>
! T* get() const;
  </pre>
  <blockquote><p>
  <i>Returns:</i> the stored pointer. Returns a null pointer if <tt>*this</tt> is empty.
*************** isn't defined anywhere), and whether we
*** 35965,35971 ****
  one behaves. We think it might be possible to deduce what the definition
  should be, but the words just aren't there. We need to open an issue on
  the use of this undefined term. (The resolution of that issue might
! affect the resolution of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>.)
  </p>
  <p>
  The LWG is getting more uncomfortable with the aliasing proposal (N2351)
--- 36126,36132 ----
  one behaves. We think it might be possible to deduce what the definition
  should be, but the words just aren't there. We need to open an issue on
  the use of this undefined term. (The resolution of that issue might
! affect the resolution of issue <a href="lwg-defects.html#711">711</a>.)
  </p>
  <p>
  The LWG is getting more uncomfortable with the aliasing proposal (N2351)
*************** The aliasing constructor is sharp enough
*** 35995,36001 ****
  doesn't make much sense in this particular case.
  </p>
  <p>
! &gt; Do you have a use case for r being empty and r being non-null? 
  </p>
  <p>
  I have received a few requests for it from "performance-conscious"
--- 36156,36162 ----
  doesn't make much sense in this particular case.
  </p>
  <p>
! > Do you have a use case for r being empty and r being non-null? 
  </p>
  <p>
  I have received a few requests for it from "performance-conscious"
*************** Howard:  Option 2 commented out for clar
*** 36030,36040 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In keeping the N2351 spirit and obviously my preference, change 20.9.10.2.5 [util.smartptr.shared.obs]:
  </p>
  
  <blockquote>
! <pre>T* get() const;
  </pre>
  <blockquote><p>
  <i>Returns:</i> the stored pointer. <del>Returns a null pointer if <tt>*this</tt> is empty.</del>
--- 36191,36202 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In keeping the N2351 spirit and obviously my preference, change 20.8.2.2.5 [util.smartptr.shared.obs]:
  </p>
  
  <blockquote>
! <pre>
! T* get() const;
  </pre>
  <blockquote><p>
  <i>Returns:</i> the stored pointer. <del>Returns a null pointer if <tt>*this</tt> is empty.</del>
*************** In keeping the N2351 spirit and obviousl
*** 36050,36059 ****
  
  <hr>
  <h3><a name="712"></a>712. <tt>seed_seq::size</tt> no longer useful</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Marc Paterno <b>Opened:</b> 2007-08-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  One of the motivations for incorporating <tt>seed_seq::size()</tt>
--- 36212,36221 ----
  
  <hr>
  <h3><a name="712"></a>712. <tt>seed_seq::size</tt> no longer useful</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Marc Paterno <b>Opened:</b> 2007-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  One of the motivations for incorporating <tt>seed_seq::size()</tt>
*************** The LWG voted to accelerate this issue t
*** 36093,36101 ****
  
  <hr>
  <h3><a name="713"></a>713. <tt>sort()</tt> complexity is too lax</h3>
! <p><b>Section:</b> 25.4.1.1 [sort] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2007-08-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity of <tt>sort()</tt> is specified as "Approximately <tt>N
--- 36255,36263 ----
  
  <hr>
  <h3><a name="713"></a>713. <tt>sort()</tt> complexity is too lax</h3>
! <p><b>Section:</b> 25.4.1.1 [sort] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2007-08-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity of <tt>sort()</tt> is specified as "Approximately <tt>N
*************** If the worst case behavior is important
*** 36137,36146 ****
  
  <hr>
  <h3><a name="714"></a>714. <tt>search_n</tt> complexity is too lax</h3>
! <p><b>Section:</b> 25.2.13 [alg.search] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2007-08-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.search">issues</a> in [alg.search].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity for <tt>search_n</tt> (25.2.13 [alg.search] par 7) is specified as "At most
--- 36299,36308 ----
  
  <hr>
  <h3><a name="714"></a>714. <tt>search_n</tt> complexity is too lax</h3>
! <p><b>Section:</b> 25.2.13 [alg.search] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2007-08-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.search">issues</a> in [alg.search].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity for <tt>search_n</tt> (25.2.13 [alg.search] par 7) is specified as "At most
*************** Change the complexity to "At most (last
*** 36157,36163 ****
  </p>
  
  <blockquote>
! <pre>template&lt;class ForwardIterator, class Size, class T&gt; 
    ForwardIterator 
      search_n(ForwardIterator first , ForwardIterator last , Size count , 
               const T&amp; value ); 
--- 36319,36326 ----
  </p>
  
  <blockquote>
! <pre>
! template&lt;class ForwardIterator, class Size, class T&gt; 
    ForwardIterator 
      search_n(ForwardIterator first , ForwardIterator last , Size count , 
               const T&amp; value ); 
*************** template&lt;class ForwardIterator, class
*** 36183,36192 ****
  
  <hr>
  <h3><a name="715"></a>715. <tt>minmax_element</tt> complexity is too lax</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2007-08-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity for <tt>minmax_element</tt> (25.4.7 [alg.min.max] par 16) says "At most <tt>max(2 *
--- 36346,36355 ----
  
  <hr>
  <h3><a name="715"></a>715. <tt>minmax_element</tt> complexity is too lax</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2007-08-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The complexity for <tt>minmax_element</tt> (25.4.7 [alg.min.max] par 16) says "At most <tt>max(2 *
*************** Change 25.4.7 [alg.min.max] to:
*** 36204,36210 ****
  </p>
  
  <blockquote>
! <pre>template&lt;class ForwardIterator&gt; 
    pair&lt;ForwardIterator, ForwardIterator&gt; 
      minmax_element(ForwardIterator first , ForwardIterator last); 
  template&lt;class ForwardIterator, class Compare&gt; 
--- 36367,36374 ----
  </p>
  
  <blockquote>
! <pre>
! template&lt;class ForwardIterator&gt; 
    pair&lt;ForwardIterator, ForwardIterator&gt; 
      minmax_element(ForwardIterator first , ForwardIterator last); 
  template&lt;class ForwardIterator, class Compare&gt; 
*************** in <tt>[first, last)</tt> such that no i
*** 36223,36229 ****
  </p>
  <p>
  <i>Complexity:</i> At most <del><tt>max(2 * (last - first ) - 2, 0)</tt></del>
! <ins><tt>max(&#8970;(3/2) (N-1)&#8971;, 0)</tt></ins> applications of the
  corresponding <del>comparisons</del> <ins>predicate, where <tt>N</tt> is <tt>distance(first, last)</tt></ins>.
  </p>
  </blockquote>
--- 36387,36393 ----
  </p>
  <p>
  <i>Complexity:</i> At most <del><tt>max(2 * (last - first ) - 2, 0)</tt></del>
! <ins><tt>max(&lfloor;(3/2) (N-1)&rfloor;, 0)</tt></ins> applications of the
  corresponding <del>comparisons</del> <ins>predicate, where <tt>N</tt> is <tt>distance(first, last)</tt></ins>.
  </p>
  </blockquote>
*************** corresponding <del>comparisons</del> <in
*** 36236,36244 ****
  
  <hr>
  <h3><a name="716"></a>716. Production in [re.grammar] not actually modified</h3>
! <p><b>Section:</b> 28.13 [re.grammar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2007-08-31 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  TR1 7.13 [tr.re.grammar]/3 and C++0x WP 28.13 [re.grammar]/3 say:
--- 36400,36409 ----
  
  <hr>
  <h3><a name="716"></a>716. Production in [re.grammar] not actually modified</h3>
! <p><b>Section:</b> 28.13 [re.grammar] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2007-08-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.grammar">issues</a> in [re.grammar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  TR1 7.13 [tr.re.grammar]/3 and C++0x WP 28.13 [re.grammar]/3 say:
*************** TR1 7.13 [tr.re.grammar]/3 and C++0x WP
*** 36249,36256 ****
  The following productions within the ECMAScript grammar are modified as follows:
  </p>
  
! <blockquote><pre>CharacterClass ::
! [ [lookahead &#8713; {^}] ClassRanges ]
  [ ^ ClassRanges ]
  </pre></blockquote>
  
--- 36414,36422 ----
  The following productions within the ECMAScript grammar are modified as follows:
  </p>
  
! <blockquote><pre>
! CharacterClass ::
! [ [lookahead &notin; {^}] ClassRanges ]
  [ ^ ClassRanges ]
  </pre></blockquote>
  
*************** Move to Open.
*** 36285,36293 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 36451,36459 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Move to Ready.
*** 36296,36303 ****
  Remove this mention of the CharacterClass production.
  </p>
  
! <blockquote><pre><del>CharacterClass ::
! [ [lookahead &#8713; {^}] ClassRanges ]
  [ ^ ClassRanges ]</del>
  </pre></blockquote>
  
--- 36462,36470 ----
  Remove this mention of the CharacterClass production.
  </p>
  
! <blockquote><pre>
! <del>CharacterClass ::
! [ [lookahead &notin; {^}] ClassRanges ]
  [ ^ ClassRanges ]</del>
  </pre></blockquote>
  
*************** Remove this mention of the CharacterClas
*** 36308,36318 ****
  
  <hr>
  <h3><a name="719"></a>719. <tt>std::is_literal</tt> type traits should be provided</h3>
! <p><b>Section:</b> 20.7 [meta] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-08-25 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#750">750</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Since the inclusion of <tt>constexpr</tt> in the standard draft N2369 we have
--- 36475,36486 ----
  
  <hr>
  <h3><a name="719"></a>719. <tt>std::is_literal</tt> type traits should be provided</h3>
! <p><b>Section:</b> 20.10 [meta] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#750">750</a></p>
  <p><b>Discussion:</b></p>
  <p>
  Since the inclusion of <tt>constexpr</tt> in the standard draft N2369 we have
*************** a new type category "literal", which is
*** 36340,36349 ****
  
  <p>
  I strongly suggest that the standard provides a type traits for
! literal types in 20.7.4.3 [meta.unary.prop] for several reasons:
  </p>
  
! <ol type="a">
  <li>To keep the traits in sync with existing types.</li>
  <li>I see many reasons for programmers to use this trait in template
     code to provide optimized template definitions for these types,
--- 36508,36517 ----
  
  <p>
  I strongly suggest that the standard provides a type traits for
! literal types in 20.10.4.3 [meta.unary.prop] for several reasons:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>To keep the traits in sync with existing types.</li>
  <li>I see many reasons for programmers to use this trait in template
     code to provide optimized template definitions for these types,
*************** These two issues should move to OPEN pen
*** 36376,36384 ****
  ]</i></p>
  
  
! <blockquote>
  Beman, Daniel, and Alisdair will work on a paper proposing new type traits.
! </blockquote>
  
  <p><i>[
  Addressed in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2947.html">N2947</a>.
--- 36544,36552 ----
  ]</i></p>
  
  
! <blockquote><p>
  Beman, Daniel, and Alisdair will work on a paper proposing new type traits.
! </p></blockquote>
  
  <p><i>[
  Addressed in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2947.html">N2947</a>.
*************** Addressed in <a href="http://www.open-st
*** 36390,36425 ****
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2984.htm">N2984</a>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.7.2 [meta.type.synop] in the group "type properties",
  just below the line
  </p>
  
! <blockquote><pre>template &lt;class T&gt; struct is_pod;
  </pre></blockquote>
  
  <p>
  add a new one:
  </p>
  
! <blockquote><pre>template &lt;class T&gt; struct is_literal;
  </pre></blockquote>
  
  <p>
! In 20.7.4.3 [meta.unary.prop], table Type Property Predicates, just
  below the line for the <tt>is_pod</tt> property add a new line:
  </p>
  
  <table border="1">
! <tbody><tr>
  <th>Template</th><th>Condition</th><th>Preconditions</th>
  </tr>
  <tr>
--- 36558,36595 ----
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2984.htm">N2984</a>.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.10.2 [meta.type.synop] in the group "type properties",
  just below the line
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; struct is_pod;
  </pre></blockquote>
  
  <p>
  add a new one:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; struct is_literal;
  </pre></blockquote>
  
  <p>
! In 20.10.4.3 [meta.unary.prop], table Type Property Predicates, just
  below the line for the <tt>is_pod</tt> property add a new line:
  </p>
  
  <table border="1">
! <tr>
  <th>Template</th><th>Condition</th><th>Preconditions</th>
  </tr>
  <tr>
*************** below the line for the <tt>is_pod</tt> p
*** 36429,36435 ****
  array of unknown bound, or
  (possibly cv-qualified) <tt>void</tt>.</td>
  </tr>
! </tbody></table>
  
  
  
--- 36599,36605 ----
  array of unknown bound, or
  (possibly cv-qualified) <tt>void</tt>.</td>
  </tr>
! </table>
  
  
  
*************** array of unknown bound, or
*** 36438,36447 ****
  
  <hr>
  <h3><a name="720"></a>720. Omissions in constexpr usages</h3>
! <p><b>Section:</b> 23.3.1 [array], 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-08-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <ol>
  <li>
--- 36608,36618 ----
  
  <hr>
  <h3><a name="720"></a>720. Omissions in constexpr usages</h3>
! <p><b>Section:</b> 23.3.2 [array], 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <ol>
  <li>
*************** In order to have a consistent working pa
*** 36494,36514 ****
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>
! <p>In the class template definition of 23.3.1 [array]/p. 3 change</p>
! <blockquote><pre><ins>constexpr</ins> bool empty() const;
  </pre></blockquote>
  </li>
  
  <li>
! <p>In the class template definition of 20.5 [template.bitset]/p. 1 change</p>
! <blockquote><pre><ins>constexpr</ins> bool test(size_t pos ) const;
  </pre></blockquote>
  
  <p>
! and in 20.5.2 [bitset.members] change
  </p>
  
! <blockquote><pre><ins>constexpr</ins> bool test(size_t pos ) const;
  </pre></blockquote>
  
  </li>
--- 36665,36688 ----
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>
! <p>In the class template definition of 23.3.2 [array]/p. 3 change</p>
! <blockquote><pre>
! <ins>constexpr</ins> bool empty() const;
  </pre></blockquote>
  </li>
  
  <li>
! <p>In the class template definition of 20.6 [template.bitset]/p. 1 change</p>
! <blockquote><pre>
! <ins>constexpr</ins> bool test(size_t pos ) const;
  </pre></blockquote>
  
  <p>
! and in 20.6.2 [bitset.members] change
  </p>
  
! <blockquote><pre>
! <ins>constexpr</ins> bool test(size_t pos ) const;
  </pre></blockquote>
  
  </li>
*************** and in 20.5.2 [bitset.members] change
*** 36520,36536 ****
  
  <hr>
  <h3><a name="722"></a>722. Missing [c.math] functions <tt>nanf</tt> and <tt>nanl</tt></h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-08-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the listing of 26.8 [c.math], table 108: Header <tt>&lt;cmath&gt;</tt> synopsis I miss
  the following C99 functions (from 7.12.11.2):
  </p>
  
! <blockquote><pre>float nanf(const char *tagp);
  long double nanl(const char *tagp);
  </pre></blockquote>
  
--- 36694,36712 ----
  
  <hr>
  <h3><a name="722"></a>722. Missing [c.math] functions <tt>nanf</tt> and <tt>nanl</tt></h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the listing of 26.8 [c.math], table 108: Header <tt>&lt;cmath&gt;</tt> synopsis I miss
  the following C99 functions (from 7.12.11.2):
  </p>
  
! <blockquote><pre>
! float nanf(const char *tagp);
  long double nanl(const char *tagp);
  </pre></blockquote>
  
*************** just after the existing entry <tt>nan</t
*** 36552,36561 ****
  
  <hr>
  <h3><a name="723"></a>723. <tt>basic_regex</tt> should be moveable</h3>
! <p><b>Section:</b> 28.8 [re.regex] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-08-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.regex">issues</a> in [re.regex].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 316</b></p>
--- 36728,36737 ----
  
  <hr>
  <h3><a name="723"></a>723. <tt>basic_regex</tt> should be moveable</h3>
! <p><b>Section:</b> 28.8 [re.regex] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-08-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.regex">issues</a> in [re.regex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 316</b></p>
*************** Sophia Antipolis:
*** 36575,36583 ****
  ]</i></p>
  
  
! <blockquote>
  Needs wording for the semantics, the idea is agreed upon.
! </blockquote>
  
  <p><i>[
  Post Summit Daniel updated wording to reflect new "swap rules".
--- 36751,36759 ----
  ]</i></p>
  
  
! <blockquote><p>
  Needs wording for the semantics, the idea is agreed upon.
! </p></blockquote>
  
  <p><i>[
  Post Summit Daniel updated wording to reflect new "swap rules".
*************** Post Summit Daniel updated wording to re
*** 36589,36597 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 36765,36773 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** In the class definition of <tt>basic_reg
*** 36601,36627 ****
  perform the following changes:
  </p>
  
! <ol type="a">
  <li>
  <p>
  Just after <tt>basic_regex(const basic_regex&amp;);</tt> insert:
  </p>
  
! <blockquote><pre>basic_regex(basic_regex&amp;&amp;);
  </pre></blockquote>
  </li>
  <li>
  <p>
  Just after <tt>basic_regex&amp; operator=(const basic_regex&amp;);</tt> insert:
  </p>
! <blockquote><pre>basic_regex&amp; operator=(basic_regex&amp;&amp;);
  </pre></blockquote>
  </li>
  <li>
  <p>
  Just after <tt>basic_regex&amp; assign(const basic_regex&amp; that);</tt> insert:
  </p>
! <blockquote><pre>basic_regex&amp; assign(basic_regex&amp;&amp; that);
  </pre></blockquote>
  </li>
  <li>
--- 36777,36806 ----
  perform the following changes:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
  Just after <tt>basic_regex(const basic_regex&amp;);</tt> insert:
  </p>
  
! <blockquote><pre>
! basic_regex(basic_regex&amp;&amp;);
  </pre></blockquote>
  </li>
  <li>
  <p>
  Just after <tt>basic_regex&amp; operator=(const basic_regex&amp;);</tt> insert:
  </p>
! <blockquote><pre>
! basic_regex&amp; operator=(basic_regex&amp;&amp;);
  </pre></blockquote>
  </li>
  <li>
  <p>
  Just after <tt>basic_regex&amp; assign(const basic_regex&amp; that);</tt> insert:
  </p>
! <blockquote><pre>
! basic_regex&amp; assign(basic_regex&amp;&amp; that);
  </pre></blockquote>
  </li>
  <li>
*************** Just after <tt>basic_regex&amp; assign(c
*** 36629,36635 ****
  In 28.8.2 [re.regex.construct], just after p.11 add the following
  new member definition:
  </p>
! <blockquote><pre>basic_regex(basic_regex&amp;&amp; e);
  </pre>
  <blockquote>
  <p>
--- 36808,36815 ----
  In 28.8.2 [re.regex.construct], just after p.11 add the following
  new member definition:
  </p>
! <blockquote><pre>
! basic_regex(basic_regex&amp;&amp; e);
  </pre>
  <blockquote>
  <p>
*************** Also in 28.8.2 [re.regex.construct], jus
*** 36653,36663 ****
  following new member definition:
  </p>
  
! <blockquote><pre>basic_regex&amp; operator=(basic_regex&amp;&amp; e);
  </pre>
! <blockquote>
  <i>Effects:</i> Returns the result of <tt>assign(std::move(e))</tt>.
! </blockquote>
  </blockquote>
  </li>
  <li>
--- 36833,36844 ----
  following new member definition:
  </p>
  
! <blockquote><pre>
! basic_regex&amp; operator=(basic_regex&amp;&amp; e);
  </pre>
! <blockquote><p>
  <i>Effects:</i> Returns the result of <tt>assign(std::move(e))</tt>.
! </p></blockquote>
  </blockquote>
  </li>
  <li>
*************** following new member definition:
*** 36665,36671 ****
  In 28.8.3 [re.regex.assign], just after p. 2 add the following new
  member definition:
  </p>
! <blockquote><pre>basic_regex&amp; assign(basic_regex&amp;&amp; rhs);
  </pre>
  <blockquote>
  <p>
--- 36846,36853 ----
  In 28.8.3 [re.regex.assign], just after p. 2 add the following new
  member definition:
  </p>
! <blockquote><pre>
! basic_regex&amp; assign(basic_regex&amp;&amp; rhs);
  </pre>
  <blockquote>
  <p>
*************** in a valid state with an unspecified val
*** 36691,36700 ****
  
  <hr>
  <h3><a name="724"></a>724. <tt>DefaultConstructible</tt> is not defined</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2007-09-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>DefaultConstructible</tt> requirement is referenced in
--- 36873,36882 ----
  
  <hr>
  <h3><a name="724"></a>724. <tt>DefaultConstructible</tt> is not defined</h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2007-09-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>DefaultConstructible</tt> requirement is referenced in
*************** Bellevue:
*** 36710,36716 ****
  
  <blockquote>
  <p>
! Walking into the default/value-initialization mess...
  </p>
  <p>
  Why two lines? Because we need both expressions to be valid.
--- 36892,36898 ----
  
  <blockquote>
  <p>
! Walking into the default&#47;value-initialization mess...
  </p>
  <p>
  Why two lines? Because we need both expressions to be valid.
*************** AJM not sure what the phrase "default co
*** 36720,36726 ****
  unfortunate, as the phrase is already used 24 times in the library!
  </p>
  <p>
! Example: const int would not accept first line, but will accept the second.
  </p>
  <p>
  This is an issue that must be solved by concepts, but we might need to solve it independantly first.
--- 36902,36908 ----
  unfortunate, as the phrase is already used 24 times in the library!
  </p>
  <p>
! Example: <tt>const int</tt> would not accept first line, but will accept the second.
  </p>
  <p>
  This is an issue that must be solved by concepts, but we might need to solve it independantly first.
*************** column is valid, but not clear what sema
*** 36733,36739 ****
  A table where there is no post-condition seems odd, but appears to sum up our position best.
  </p>
  <p>
! At a minimum an object is declared and is destuctible.
  </p>
  <p>
  Move to open, as no-one happy to produce wording on the fly.
--- 36915,36921 ----
  A table where there is no post-condition seems odd, but appears to sum up our position best.
  </p>
  <p>
! At a minimum an object is declared and is destructible.
  </p>
  <p>
  Move to open, as no-one happy to produce wording on the fly.
*************** Move to open, as no-one happy to produce
*** 36746,36752 ****
  
  
  <p><i>[
! 2009-08-17 Daniel adds "[defaultconstructible]" to table title.  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>
  depends upon this issue.
  ]</i></p>
  
--- 36928,36934 ----
  
  
  <p><i>[
! 2009-08-17 Daniel adds "[defaultconstructible]" to table title.  <a href="lwg-closed.html#408">408</a>
  depends upon this issue.
  ]</i></p>
  
*************** Looking at the proposed table in this is
*** 36764,36770 ****
  <blockquote>
  <table border="1">
  <caption>Table 33: <tt>DefaultConstructible</tt> requirements [defaultconstructible]</caption>
! <tbody><tr>
  <th>expression</th><th>post-condition</th>
  </tr>
  
--- 36946,36952 ----
  <blockquote>
  <table border="1">
  <caption>Table 33: <tt>DefaultConstructible</tt> requirements [defaultconstructible]</caption>
! <tr>
  <th>expression</th><th>post-condition</th>
  </tr>
  
*************** Looking at the proposed table in this is
*** 36775,36781 ****
  <tr>
  <td><tt>T{}</tt></td><td>Object of type <tt>T</tt> is value-initialized.</td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
--- 36957,36963 ----
  <tr>
  <td><tt>T{}</tt></td><td>Object of type <tt>T</tt> is value-initialized.</td>
  </tr>
! </table>
  </blockquote>
  
  <p>
*************** would fall back to suggest to use the ex
*** 36807,36813 ****
  expression
  </p>
  
! <blockquote><pre>T t();
  </pre></blockquote>
  </blockquote>
  
--- 36989,36996 ----
  expression
  </p>
  
! <blockquote><pre>
! T t();
  </pre></blockquote>
  </blockquote>
  
*************** expression
*** 36816,36873 ****
  ]</i></p>
  
  
! <blockquote>
  Leave Open. Core is looking to make Alisdair's proposed
  resolution correct.
! </blockquote>
  
  <p><i>[
! 2010-01-24 At Alisdiar's request, moved his proposal into the proposed wording
! seciton.  The old wording is preserved here:
  ]</i></p>
  
  
  <blockquote>
  <p>
! In section 20.2.1 [utility.arg.requirements], before table 33, add the
  following table:
  </p>
  
! <p align="center" style="text-align:center">Table 33: <tt>DefaultConstructible</tt> requirements [defaultconstructible]</p>
! 
! <div align="center">
  
! <table border="0" cellspacing="0" cellpadding="0" style="border-collapse:collapse">
!  <tbody><tr>
!   <td width="114" valign="top" style="width:85.5pt;border-top:solid navy 1.0pt;
!   border-left:solid navy 1.0pt;border-bottom:double navy 1.5pt;border-right:
!   none;padding:0in 5.4pt 0in 5.4pt">
!   <p align="center" style="margin:0in;margin-bottom:.0001pt;text-align:center">expression</p>
    </td>
!   <td width="324" valign="top" style="width:243.0pt;border-top:solid navy 1.0pt;
!   border-left:none;border-bottom:double navy 1.5pt;border-right:solid navy 1.0pt;
!   padding:0in 5.4pt 0in 5.4pt">
!   <p align="center" style="margin:0in;margin-bottom:.0001pt;text-align:center">post-condition</p>
    </td>
   </tr>
   <tr>
!   <td width="114" valign="top" style="width:85.5pt;border-top:none;border-left:
!   solid navy 1.0pt;border-bottom:solid navy 1.0pt;border-right:none;padding:
!   0in 5.4pt 0in 5.4pt">
!   <p style="margin:0in;margin-bottom:.0001pt"><tt>T
!   t;</tt><br>
    <tt>T()</tt></p>
    </td>
!   <td width="324" valign="top" style="width:243.0pt;border-top:none;border-left:
!   none;border-bottom:solid navy 1.0pt;border-right:solid navy 1.0pt;padding:
!   0in 5.4pt 0in 5.4pt">
!   <p style="margin:0in;margin-bottom:.0001pt"><tt>T</tt>
!   is <i>default constructed.</i></p>
    </td>
   </tr>
! </tbody></table>
! 
! </div>
  
  </blockquote>
  
--- 36999,37044 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave Open. Core is looking to make Alisdair's proposed
  resolution correct.
! </p></blockquote>
  
  <p><i>[
! 2010-01-24 At Alisdair's request, moved his proposal into the proposed wording
! section.  The old wording is preserved here:
  ]</i></p>
  
  
  <blockquote>
  <p>
! In section 17.6.3.1 [utility.arg.requirements], before table 33, add the
  following table:
  </p>
  
! <p style='text-align:center'>Table 33: <tt>DefaultConstructible</tt> 
! requirements [defaultconstructible]</p>
  
! <table border='0' cellspacing='0' cellpadding='0'
!  style='border-collapse:collapse'>
!  <tr>
!   <td>
!   <p style='text-align:center'>expression</p>
    </td>
!   <td>
!   <p style='text-align:center'>post-condition</p>
    </td>
   </tr>
   <tr>
!   <td>
!   <p><tt>T t;</tt><br/>
    <tt>T()</tt></p>
    </td>
!   <td>
!   <p><tt>T</tt> is <i>default constructed.</i></p>
    </td>
   </tr>
! </table>
  
  </blockquote>
  
*************** following table:
*** 36883,36892 ****
  San Francisco:
  ]</i></p>
  
! <blockquote>
  We believe concepts will solve this problem
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2774.pdf">N2774</a>).
! </blockquote>
  
  <p><i>[
  Rationale is obsolete.
--- 37054,37063 ----
  San Francisco:
  ]</i></p>
  
! <blockquote><p>
  We believe concepts will solve this problem
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2774.pdf">N2774</a>).
! </p></blockquote>
  
  <p><i>[
  Rationale is obsolete.
*************** Rationale is obsolete.
*** 36896,36909 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In section 20.2.1 [utility.arg.requirements], before table 33, add the
  following table:
  </p>
  
  <blockquote>
  <table border="1">
  <caption>Table 33: <tt>DefaultConstructible</tt> requirements [defaultconstructible]</caption>
! <tbody><tr>
  <th>expression</th><th>post-condition</th>
  </tr>
  
--- 37067,37080 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In section 17.6.3.1 [utility.arg.requirements], before table 33, add the
  following table:
  </p>
  
  <blockquote>
  <table border="1">
  <caption>Table 33: <tt>DefaultConstructible</tt> requirements [defaultconstructible]</caption>
! <tr>
  <th>expression</th><th>post-condition</th>
  </tr>
  
*************** following table:
*** 36916,36925 ****
  </tr>
  
  <tr>
! <td><tt>T()<br>T{}</tt></td><td>A temporary object of type <tt>T</tt> is value-initialized.</td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  
--- 37087,37096 ----
  </tr>
  
  <tr>
! <td><tt>T()<br/>T{}</tt></td><td>A temporary object of type <tt>T</tt> is value-initialized.</td>
  </tr>
  
! </table>
  </blockquote>
  
  
*************** following table:
*** 36929,36938 ****
  
  <hr>
  <h3><a name="727"></a>727. <tt>regex_replace()</tt> doesn't accept <tt>basic_string</tt>s with custom traits and allocators</h3>
! <p><b>Section:</b> 28.11.4 [re.alg.replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2007-09-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.alg.replace">issues</a> in [re.alg.replace].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>regex_match()</tt> and <tt>regex_search()</tt> take <tt>const basic_string&lt;charT, ST,
--- 37100,37109 ----
  
  <hr>
  <h3><a name="727"></a>727. <tt>regex_replace()</tt> doesn't accept <tt>basic_string</tt>s with custom traits and allocators</h3>
! <p><b>Section:</b> 28.11.4 [re.alg.replace] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2007-09-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.alg.replace">issues</a> in [re.alg.replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>regex_match()</tt> and <tt>regex_search()</tt> take <tt>const basic_string&lt;charT, ST,
*************** Move to Open.
*** 36973,36981 ****
  ]</i></p>
  
  
! <blockquote>
  Howard to ask Stephan Lavavej to provide wording.
! </blockquote>
  
  <p><i>[
  2009-07-17 Stephan provided wording.
--- 37144,37152 ----
  ]</i></p>
  
  
! <blockquote><p>
  Howard to ask Stephan Lavavej to provide wording.
! </p></blockquote>
  
  <p><i>[
  2009-07-17 Stephan provided wording.
*************** Howard to ask Stephan Lavavej to provide
*** 36983,36989 ****
  
  
  <p><i>[
! 2009-07-25 Daniel tweaks both this issue and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#726">726</a>.
  ]</i></p>
  
  
--- 37154,37160 ----
  
  
  <p><i>[
! 2009-07-25 Daniel tweaks both this issue and <a href="lwg-closed.html#726">726</a>.
  ]</i></p>
  
  
*************** in the Proposed Resolution.
*** 37021,37029 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Review. Chair is anxious to move this to Ready in Pittsburgh.
! </blockquote>
  
  <p><i>[
  2010-01-27 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
--- 37192,37200 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Review. Chair is anxious to move this to Ready in Pittsburgh.
! </p></blockquote>
  
  <p><i>[
  2010-01-27 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
*************** Move to Review. Chair is anxious to move
*** 37040,37046 ****
  Change 28.4 [re.syn] as indicated:
  </p>
  
! <blockquote><pre>// 28.11.4, function template regex_replace:
  template &lt;class OutputIterator, class BidirectionalIterator,
            class traits, class charT<ins>, class ST, class SA</ins>&gt;
    OutputIterator
--- 37211,37218 ----
  Change 28.4 [re.syn] as indicated:
  </p>
  
! <blockquote><pre>
! // 28.11.4, function template regex_replace:
  template &lt;class OutputIterator, class BidirectionalIterator,
            class traits, class charT<ins>, class ST, class SA</ins>&gt;
    OutputIterator
*************** template &lt;class traits, class charT&g
*** 37106,37116 ****
  
  <li>
  <p>
! Change 28.10 [re.results]/3, class template <tt>match_results</tt> as
  indicated:
  </p>
  
! <blockquote><pre><ins>
  template &lt;class OutputIter&gt;
    OutputIter
    format(OutputIter out,
--- 37278,37289 ----
  
  <li>
  <p>
! Change 28.10 [re.results]&#47;3, class template <tt>match_results</tt> as
  indicated:
  </p>
  
! <blockquote><pre>
! <ins>
  template &lt;class OutputIter&gt;
    OutputIter
    format(OutputIter out,
*************** format(const char_type* fmt,
*** 37146,37152 ****
  Insert at the very beginning of 28.10.5 [re.results.form] the following:
  </p>
  
! <blockquote><pre><ins>
  template &lt;class OutputIter&gt;
    OutputIter
    format(OutputIter out,
--- 37319,37326 ----
  Insert at the very beginning of 28.10.5 [re.results.form] the following:
  </p>
  
! <blockquote><pre>
! <ins>
  template &lt;class OutputIter&gt;
    OutputIter
    format(OutputIter out,
*************** recognized.
*** 37183,37189 ****
  Change 28.10.5 [re.results.form], before p. 1 until p. 3 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class OutputIter<ins>, class ST, class SA</ins>&gt;
    OutputIter
    format(OutputIter out,
           const <del>string_type</del><ins>basic_string&lt;char_type, ST, SA&gt;</ins>&amp; fmt,
--- 37357,37364 ----
  Change 28.10.5 [re.results.form], before p. 1 until p. 3 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class OutputIter<ins>, class ST, class SA</ins>&gt;
    OutputIter
    format(OutputIter out,
           const <del>string_type</del><ins>basic_string&lt;char_type, ST, SA&gt;</ins>&amp; fmt,
*************** specifiers and escape sequences are reco
*** 37219,37225 ****
  Change 28.10.5 [re.results.form], before p. 4 until p. 4 as indicated:
  </p>
  
! <blockquote><pre><ins>template &lt;class ST, class SA&gt;</ins>
    <del>string_type</del><ins>basic_string&lt;char_type, ST, SA&gt;</ins>
    format(const <del>string_type</del><ins>basic_string&lt;char_type, ST, SA&gt;</ins>&amp; fmt,
           regex_constants::match_flag_type flags =
--- 37394,37401 ----
  Change 28.10.5 [re.results.form], before p. 4 until p. 4 as indicated:
  </p>
  
! <blockquote><pre>
! <ins>template &lt;class ST, class SA&gt;</ins>
    <del>string_type</del><ins>basic_string&lt;char_type, ST, SA&gt;</ins>
    format(const <del>string_type</del><ins>basic_string&lt;char_type, ST, SA&gt;</ins>&amp; fmt,
           regex_constants::match_flag_type flags =
*************** and calls <tt>format(back_inserter(resul
*** 37251,37257 ****
  At the end of 28.10.5 [re.results.form] insert as indicated:
  </p>
  
! <blockquote><pre><ins>
  string_type
    format(const char_type* fmt,
           regex_constants::match_flag_type flags =
--- 37427,37434 ----
  At the end of 28.10.5 [re.results.form] insert as indicated:
  </p>
  
! <blockquote><pre>
! <ins>
  string_type
    format(const char_type* fmt,
           regex_constants::match_flag_type flags =
*************** char_traits&lt;char_type&gt;::length(fmt
*** 37277,37283 ****
  Change 28.11.4 [re.alg.replace] before p. 1 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class OutputIterator, class BidirectionalIterator,
            class traits, class charT<ins>, class ST, class SA</ins>&gt;
    OutputIterator
    regex_replace(OutputIterator out,
--- 37454,37461 ----
  Change 28.11.4 [re.alg.replace] before p. 1 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class OutputIterator, class BidirectionalIterator,
            class traits, class charT<ins>, class ST, class SA</ins>&gt;
    OutputIterator
    regex_replace(OutputIterator out,
*************** template &lt;class OutputIterator, class
*** 37299,37305 ****
                    regex_constants::match_default);
  </ins></pre>
  
! <blockquote>
  <i>Effects:</i> [..]. If any matches are found then, for each such match, if <tt>!(flags &amp;
   regex_constants::format_no_copy)</tt> calls <tt>std::copy(m.prefix().first,
  m.prefix().second,
--- 37477,37483 ----
                    regex_constants::match_default);
  </ins></pre>
  
! <blockquote><p>
  <i>Effects:</i> [..]. If any matches are found then, for each such match, if <tt>!(flags &amp;
   regex_constants::format_no_copy)</tt> calls <tt>std::copy(m.prefix().first,
  m.prefix().second,
*************** form of the function
*** 37308,37314 ****
   and <tt>m.format(out, fmt, fmt + char_traits&lt;charT&gt;::length(fmt), flags)</tt>
  for the second
   form</ins>. [..].
! </blockquote>
  </blockquote>
  </li>
  
--- 37486,37492 ----
   and <tt>m.format(out, fmt, fmt + char_traits&lt;charT&gt;::length(fmt), flags)</tt>
  for the second
   form</ins>. [..].
! </p></blockquote>
  </blockquote>
  </li>
  
*************** for the second
*** 37317,37323 ****
  Change 28.11.4 [re.alg.replace] before p. 3 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class traits, class charT<ins>, class ST, class SA,
            class FST, class FSA</ins>&gt;
    basic_string&lt;charT<ins>, ST, SA</ins>&gt;
    regex_replace(const basic_string&lt;charT<ins>, ST, SA</ins>&gt;&amp; s,
--- 37495,37502 ----
  Change 28.11.4 [re.alg.replace] before p. 3 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class traits, class charT<ins>, class ST, class SA,
            class FST, class FSA</ins>&gt;
    basic_string&lt;charT<ins>, ST, SA</ins>&gt;
    regex_replace(const basic_string&lt;charT<ins>, ST, SA</ins>&gt;&amp; s,
*************** template &lt;class traits, class charT,
*** 37336,37346 ****
                    regex_constants::match_default);
  </ins></pre>
  
! <blockquote>
  <i>Effects:</i> Constructs an empty string <tt>result</tt> of type <tt>basic_string&lt;charT<ins>,
  ST, SA</ins>&gt;</tt>, calls <tt>regex_replace(back_inserter(result), s.begin(), s.end(),
  e, fmt, flags)</tt>, and then returns <tt>result</tt>.
! </blockquote>
  </blockquote>
  </li>
  
--- 37515,37525 ----
                    regex_constants::match_default);
  </ins></pre>
  
! <blockquote><p>
  <i>Effects:</i> Constructs an empty string <tt>result</tt> of type <tt>basic_string&lt;charT<ins>,
  ST, SA</ins>&gt;</tt>, calls <tt>regex_replace(back_inserter(result), s.begin(), s.end(),
  e, fmt, flags)</tt>, and then returns <tt>result</tt>.
! </p></blockquote>
  </blockquote>
  </li>
  
*************** e, fmt, flags)</tt>, and then returns <t
*** 37349,37355 ****
  At the end of 28.11.4 [re.alg.replace] add the following new prototype description:
  </p>
  
! <blockquote><pre><ins>
  template &lt;class traits, class charT, class ST, class SA&gt;
    basic_string&lt;charT&gt;
    regex_replace(const charT* s,
--- 37528,37535 ----
  At the end of 28.11.4 [re.alg.replace] add the following new prototype description:
  </p>
  
! <blockquote><pre>
! <ins>
  template &lt;class traits, class charT, class ST, class SA&gt;
    basic_string&lt;charT&gt;
    regex_replace(const charT* s,
*************** template &lt;class traits, class charT&g
*** 37369,37382 ****
                    regex_constants::match_default);
  </ins></pre>
  
! <blockquote>
  <ins>
  <i>Effects:</i> Constructs an empty string <tt>result</tt> of type <tt>basic_string&lt;charT&gt;</tt>,
  calls <tt>regex_replace(back_inserter(result), s, s +
  char_traits&lt;charT&gt;::length(s),
  e, fmt, flags)</tt>, and then returns <tt>result</tt>.
  </ins>
! </blockquote>
  </blockquote>
  </li>
  
--- 37549,37562 ----
                    regex_constants::match_default);
  </ins></pre>
  
! <blockquote><p>
  <ins>
  <i>Effects:</i> Constructs an empty string <tt>result</tt> of type <tt>basic_string&lt;charT&gt;</tt>,
  calls <tt>regex_replace(back_inserter(result), s, s +
  char_traits&lt;charT&gt;::length(s),
  e, fmt, flags)</tt>, and then returns <tt>result</tt>.
  </ins>
! </p></blockquote>
  </blockquote>
  </li>
  
*************** e, fmt, flags)</tt>, and then returns <t
*** 37389,37399 ****
  
  
  <hr>
! <h3><a name="728"></a>728. Problem in [rand.eng.mers]/6</h3>
! <p><b>Section:</b> 26.5.3.2 [rand.eng.mers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.eng.mers">issues</a> in [rand.eng.mers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>mersenne_twister_engine</tt> is required to use a seeding method that is given 
--- 37569,37579 ----
  
  
  <hr>
! <h3><a name="728"></a>728. Problem in [rand.eng.mers]&#47;6</h3>
! <p><b>Section:</b> 26.5.3.2 [rand.eng.mers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.eng.mers">issues</a> in [rand.eng.mers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>mersenne_twister_engine</tt> is required to use a seeding method that is given 
*************** Matsumoto have chosen a dif ferent multi
*** 37409,37415 ****
  I see two possible resolutions: 
  </p>
  
! <ol type="a">
  <li>Restrict the parameter <tt>W</tt> of the <tt>mersenne_twister_template</tt> to values of 32 or 64 and use the 
  multiplier from [the above reference] for the 64-bit case (my preference)</li>
  <li>Interpret the state array for any <tt>W</tt> as a 32-bit array of appropriate length (and a specified byte 
--- 37589,37595 ----
  I see two possible resolutions: 
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>Restrict the parameter <tt>W</tt> of the <tt>mersenne_twister_template</tt> to values of 32 or 64 and use the 
  multiplier from [the above reference] for the 64-bit case (my preference)</li>
  <li>Interpret the state array for any <tt>W</tt> as a 32-bit array of appropriate length (and a specified byte 
*************** Stephan Tolksdorf adds pre-Bellevue:
*** 37455,37461 ****
  ]</i></p>
  
  
! <blockquote>
  I support the proposed resolution in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2424.pdf">N2424</a>,
  but there is a typo in the
--- 37635,37641 ----
  ]</i></p>
  
  
! <blockquote><p>
  I support the proposed resolution in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2424.pdf">N2424</a>,
  but there is a typo in the
*************** required behaviour for <tt>mt19937_64</t
*** 37464,37491 ****
  9981545732273789042 (not 14002232017267485025). The change to para. 8
  proposed by Charles Karney should also be included in the proposed
  wording.
! </blockquote>
  
  <p><i>[
  Sophia Antipolis:
  ]</i></p>
  
  
! <blockquote>
  Note the main part of the issue is resolved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2424.pdf">N2424</a>.
  </blockquote>
  
  
  
  
  
  
  <hr>
  <h3><a name="734"></a>734. Unnecessary restriction in [rand.dist.norm.chisq]</h3>
! <p><b>Section:</b> 26.5.8.4.3 [rand.dist.norm.chisq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>chi_squared_distribution</tt>, <tt>fisher_f_distribution</tt> and <tt>student_t_distribution</tt>
--- 37644,37748 ----
  9981545732273789042 (not 14002232017267485025). The change to para. 8
  proposed by Charles Karney should also be included in the proposed
  wording.
! </p></blockquote>
  
  <p><i>[
  Sophia Antipolis:
  ]</i></p>
  
  
! <blockquote><p>
  Note the main part of the issue is resolved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2424.pdf">N2424</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="732"></a>732. Defect in [rand.dist.samp.genpdf]</h3>
+ <p><b>Section:</b> X [rand.dist.samp.genpdf] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.genpdf">issues</a> in [rand.dist.samp.genpdf].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Duplicate of:</b> <a href="lwg-closed.html#795">795</a></p>
+ <p><b>Discussion:</b></p>
+ <p>
+ X [rand.dist.samp.genpdf] describes the interface for a distribution template that is 
+ meant to simulate random numbers from any general distribution given only the density and the 
+ support of the distribution. I'm not aware of any general purpose algorithm that would be capable 
+ of correctly and efficiently implementing the described functionality. From what I know, this is 
+ essentially an unsolved research problem. Existing algorithms either require more knowledge 
+ about the distribution and the problem domain or work only under very limited circumstances. 
+ Even the state of the art special purpose library UNU.RAN does not solve the problem in full 
+ generality, and in any case, testing and customer support for such a library feature would be a 
+ nightmare.
+ </p>
+ 
+ <p>
+ <b>Possible resolution:</b> For these reasons, I propose to delete section X [rand.dist.samp.genpdf].
+ </p>
+ 
+ <p><i>[
+ Bellevue:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Disagreement persists.
+ </p>
+ <p>
+ Objection to this issue is that this function takes a general functor.
+ The general approach would be to normalize this function, integrate it,
+ and take the inverse of the integral, which is not possible in general.
+ An example function is sin(1+n*x) &mdash; for any spatial frequency that the
+ implementor chooses, there is a value of n that renders that choice
+ arbitrarily erroneous.
+ </p>
+ <p>
+ Correction: The formula above should instead read 1+sin(n*x).
+ </p>
+ <p>
+ Objector proposes the following possible compromise positions:
+ </p>
+ <ul>
+ <li>
+ rand.dist.samp.genpdf takes an number of points so that implementor need not guess.
+ </li>
+ <li>
+ replace rand.disk.samp.genpdf with an extension to either or both of the discrete 
+ functions to take arguments that take a functor and number of points in place of 
+ the list of probabilities. Reference issues 793 and 794.
+ </li>
+ </ul>
  </blockquote>
  
  
  
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2813.pdf">N2813</a>
+ for the proposed resolution.
+ </p>
+ 
+ 
+ <p><b>Rationale:</b></p><p>
+ Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> 
+ "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
+ </p>
+ 
  
  
  
  <hr>
  <h3><a name="734"></a>734. Unnecessary restriction in [rand.dist.norm.chisq]</h3>
! <p><b>Section:</b> 26.5.8.5.3 [rand.dist.norm.chisq] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2007-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>chi_squared_distribution</tt>, <tt>fisher_f_distribution</tt> and <tt>student_t_distribution</tt>
*************** have parameters for the "degrees of free
*** 37493,37501 ****
  following two reasons this is an unnecessary restriction: First, in many applications such as 
  Bayesian inference or Monte Carlo simulations it is more convenient to treat the respective param- 
  eters as continuous variables. Second, the standard non-naive algorithms (i.e. 
! O(1) algorithms) 
! for simulating from these distributions work with floating-point parameters anyway (all three 
! distributions could be easily implemented using the Gamma distribution, for instance).
  </p>
  
  <p>
--- 37750,37757 ----
  following two reasons this is an unnecessary restriction: First, in many applications such as 
  Bayesian inference or Monte Carlo simulations it is more convenient to treat the respective param- 
  eters as continuous variables. Second, the standard non-naive algorithms (i.e. 
! O(1) algorithms) for simulating from these distributions work with floating-point parameters anyway (all 
! three distributions could be easily implemented using the Gamma distribution, for instance).
  </p>
  
  <p>
*************** Bellevue:
*** 37517,37526 ****
  ]</i></p>
  
  
! <blockquote>
  In N2424. Not wildly enthusiastic, not really felt necessary. Less
  frequently used in practice. Not terribly bad either. Move to OPEN.
! </blockquote>
  
  <p><i>[
  Sophia Antipolis:
--- 37773,37782 ----
  ]</i></p>
  
  
! <blockquote><p>
  In N2424. Not wildly enthusiastic, not really felt necessary. Less
  frequently used in practice. Not terribly bad either. Move to OPEN.
! </p></blockquote>
  
  <p><i>[
  Sophia Antipolis:
*************** Stephan Tolksdorf adds pre-Bellevue:
*** 37557,37563 ****
  
  <blockquote>
  <p>
! In 26.5.8.4.3 [rand.dist.norm.chisq]:
  </p>
  
  <blockquote>
--- 37813,37819 ----
  
  <blockquote>
  <p>
! In 26.5.8.5.3 [rand.dist.norm.chisq]:
  </p>
  
  <blockquote>
*************** Replace both occurrences of "<tt>int n()
*** 37577,37583 ****
  </blockquote>
  
  <p>
! In 26.5.8.4.5 [rand.dist.norm.f]:
  </p>
  <blockquote>
  <p>
--- 37833,37839 ----
  </blockquote>
  
  <p>
! In 26.5.8.5.5 [rand.dist.norm.f]:
  </p>
  <blockquote>
  <p>
*************** Delete ", where <tt>m</tt> and <tt>n</tt
*** 37587,37598 ****
  <p>
  Replace both occurrences of
  </p>
! <blockquote><pre>explicit fisher_f_distribution(int m = 1, int n = 1);
  </pre></blockquote>
  <p>
  with
  </p>
! <blockquote><pre>explicit fisher_f_distribution(RealType m = 1, RealType n = 1);
  </pre></blockquote>
  
  <p>
--- 37843,37856 ----
  <p>
  Replace both occurrences of
  </p>
! <blockquote><pre>
! explicit fisher_f_distribution(int m = 1, int n = 1);
  </pre></blockquote>
  <p>
  with
  </p>
! <blockquote><pre>
! explicit fisher_f_distribution(RealType m = 1, RealType n = 1);
  </pre></blockquote>
  
  <p>
*************** Replace both occurrences of "<tt>int n()
*** 37605,37611 ****
  </blockquote>
  
  <p>
! In 26.5.8.4.6 [rand.dist.norm.t]:
  </p>
  
  <blockquote>
--- 37863,37869 ----
  </blockquote>
  
  <p>
! In 26.5.8.5.6 [rand.dist.norm.t]:
  </p>
  
  <blockquote>
*************** Replace both occurrences of "<tt>int n()
*** 37631,37639 ****
  
  <hr>
  <h3><a name="740"></a>740. Please remove <tt>*_ptr&lt;T[N]&gt;</tt></h3>
! <p><b>Section:</b> X [unique.ptr.compiletime] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2007-10-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Please don't provide <tt>*_ptr&lt;T[N]&gt;</tt>. It doesn't enable any useful
--- 37889,37898 ----
  
  <hr>
  <h3><a name="740"></a>740. Please remove <tt>*_ptr&lt;T[N]&gt;</tt></h3>
! <p><b>Section:</b> 20.8.1 [unique.ptr] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2007-10-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr">issues</a> in [unique.ptr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Please don't provide <tt>*_ptr&lt;T[N]&gt;</tt>. It doesn't enable any useful
*************** straw poll unanimous move to Ready.
*** 37694,37703 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis under 20.9.9 [unique.ptr] p2:
  </p>
  
! <blockquote><pre>...
  template&lt;class T&gt; struct default_delete; 
  template&lt;class T&gt; struct default_delete&lt;T[]&gt;; 
  <del>template&lt;class T, size_t N&gt; struct default_delete&lt;T[N]&gt;;</del>
--- 37953,37963 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis under 20.8.1 [unique.ptr] p2:
  </p>
  
! <blockquote><pre>
! ...
  template&lt;class T&gt; struct default_delete; 
  template&lt;class T&gt; struct default_delete&lt;T[]&gt;; 
  <del>template&lt;class T, size_t N&gt; struct default_delete&lt;T[N]&gt;;</del>
*************** Remove the entire section  [unique.ptr.d
*** 37713,37719 ****
  </p>
  
  <p>
! Remove the entire section X [unique.ptr.compiletime] <b><tt>unique_ptr</tt> for array objects with a compile time length</b>
  and its subsections:  [unique.ptr.compiletime.dtor],  [unique.ptr.compiletime.observers],
   [unique.ptr.compiletime.modifiers].
  </p>
--- 37973,37979 ----
  </p>
  
  <p>
! Remove the entire section  [unique.ptr.compiletime] <b><tt>unique_ptr</tt> for array objects with a compile time length</b>
  and its subsections:  [unique.ptr.compiletime.dtor],  [unique.ptr.compiletime.observers],
   [unique.ptr.compiletime.modifiers].
  </p>
*************** and its subsections:  [unique.ptr.compil
*** 37725,37737 ****
  
  <hr>
  <h3><a name="742"></a>742. Enabling <tt>swap</tt> for proxy iterators</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! This issue was split from <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a>. <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#672">672</a> now just
  deals with changing the requirements of <tt>T</tt> in the <tt>Swappable</tt>
  requirement from <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt> to
  <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt>.
--- 37985,37997 ----
  
  <hr>
  <h3><a name="742"></a>742. Enabling <tt>swap</tt> for proxy iterators</h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! This issue was split from <a href="lwg-defects.html#672">672</a>. <a href="lwg-defects.html#672">672</a> now just
  deals with changing the requirements of <tt>T</tt> in the <tt>Swappable</tt>
  requirement from <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt> to
  <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt>.
*************** This issue seeks to widen the <tt>Swappa
*** 37742,37748 ****
  is example code:
  </p>
  
! <blockquote><pre>namespace Mine {
  
  template &lt;class T&gt;
  struct proxy {...};
--- 38002,38009 ----
  is example code:
  </p>
  
! <blockquote><pre>
! namespace Mine {
  
  template &lt;class T&gt;
  struct proxy {...};
*************** satisfies the semantics of swapping?
*** 37832,37860 ****
  ]</i></p>
  
  
! <blockquote>
  Leave as Open. Dave to provide wording.
! </blockquote>
  
  <p><i>[
  2009-11-08 Howard adds:
  ]</i></p>
  
  
! <blockquote>
  Updated wording to sync with
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>.
! Also this issue is very closely related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added.
! </blockquote>
  
  
  
--- 38093,38121 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave as Open. Dave to provide wording.
! </p></blockquote>
  
  <p><i>[
  2009-11-08 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
  Updated wording to sync with
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>.
! Also this issue is very closely related to <a href="lwg-defects.html#594">594</a>.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added.
! </p></blockquote>
  
  
  
*************** Solved by N3048.
*** 37866,37872 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.2.1 [utility.arg.requirements]:
  </p>
  
  <blockquote>
--- 38127,38133 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 17.6.3.1 [utility.arg.requirements]:
  </p>
  
  <blockquote>
*************** rvalue of type <tt>T</tt><ins>; <tt>w</t
*** 37884,37890 ****
  
  <table border="1">
  <caption>Table 37: <tt>Swappable</tt> requirements <b>[swappable]</b></caption>
! <tbody><tr><th>expression</th><th>Return type</th><th>Post-condition</th></tr>
  <tr><td><tt>swap(<del>s</del><ins>w</ins>,<del>t</del><ins>v</ins>)</tt></td><td><tt>void</tt></td>
  <td><del><tt>t</tt></del><ins><tt>w</tt></ins> has the value originally
  held by <del><tt>u</tt></del><ins><tt>v</tt></ins>, and
--- 38145,38151 ----
  
  <table border="1">
  <caption>Table 37: <tt>Swappable</tt> requirements <b>[swappable]</b></caption>
! <tr><th>expression</th><th>Return type</th><th>Post-condition</th></tr>
  <tr><td><tt>swap(<del>s</del><ins>w</ins>,<del>t</del><ins>v</ins>)</tt></td><td><tt>void</tt></td>
  <td><del><tt>t</tt></del><ins><tt>w</tt></ins> has the value originally
  held by <del><tt>u</tt></del><ins><tt>v</tt></ins>, and
*************** element type is <tt>Swappable</tt>.
*** 37916,37922 ****
  </li>
  </ul>
  </td></tr>
! </tbody></table>
  </blockquote>
  
  
--- 38177,38183 ----
  </li>
  </ul>
  </td></tr>
! </table>
  </blockquote>
  
  
*************** post San Francisco:
*** 37927,37936 ****
  ]</i></p>
  
  
! <blockquote>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2758.pdf">N2758</a>.
! </blockquote>
  
  
  
--- 38188,38197 ----
  ]</i></p>
  
  
! <blockquote><p>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2758.pdf">N2758</a>.
! </p></blockquote>
  
  
  
*************** Solved by
*** 37939,37950 ****
  
  <hr>
  <h3><a name="743"></a>743. rvalue <tt>swap</tt> for <tt>shared_ptr</tt></h3>
! <p><b>Section:</b> 20.9.10.2.9 [util.smartptr.shared.spec] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! When the LWG looked at <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#674">674</a> in Kona the following note was made:
  </p>
  
  <blockquote><p>
--- 38200,38211 ----
  
  <hr>
  <h3><a name="743"></a>743. rvalue <tt>swap</tt> for <tt>shared_ptr</tt></h3>
! <p><b>Section:</b> 20.8.2.2.8 [util.smartptr.shared.spec] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! When the LWG looked at <a href="lwg-defects.html#674">674</a> in Kona the following note was made:
  </p>
  
  <blockquote><p>
*************** Adopt issue as written.
*** 37981,37990 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 20.9.10.2 [util.smartptr.shared]:
  </p>
  
! <blockquote><pre>void swap(shared_ptr&amp;<ins>&amp;</ins> r);
  ...
  template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp; a, shared_ptr&lt;T&gt;&amp; b);
  <ins>template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp;&amp; a, shared_ptr&lt;T&gt;&amp; b);
--- 38242,38252 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 20.8.2.2 [util.smartptr.shared]:
  </p>
  
! <blockquote><pre>
! void swap(shared_ptr&amp;<ins>&amp;</ins> r);
  ...
  template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp; a, shared_ptr&lt;T&gt;&amp; b);
  <ins>template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp;&amp; a, shared_ptr&lt;T&gt;&amp; b);
*************** template&lt;class T&gt; void swap(shared
*** 37992,38008 ****
  </pre></blockquote>
  
  <p>
! Change 20.9.10.2.4 [util.smartptr.shared.mod]:
  </p>
  
! <blockquote><pre>void swap(shared_ptr&amp;<ins>&amp;</ins> r);
  </pre></blockquote>
  
  <p>
! Change 20.9.10.2.9 [util.smartptr.shared.spec]:
  </p>
  
! <blockquote><pre>template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp; a, shared_ptr&lt;T&gt;&amp; b);
  <ins>template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp;&amp; a, shared_ptr&lt;T&gt;&amp; b);
  template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp; a, shared_ptr&lt;T&gt;&amp;&amp; b);</ins>
  </pre></blockquote>
--- 38254,38272 ----
  </pre></blockquote>
  
  <p>
! Change 20.8.2.2.4 [util.smartptr.shared.mod]:
  </p>
  
! <blockquote><pre>
! void swap(shared_ptr&amp;<ins>&amp;</ins> r);
  </pre></blockquote>
  
  <p>
! Change 20.8.2.2.8 [util.smartptr.shared.spec]:
  </p>
  
! <blockquote><pre>
! template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp; a, shared_ptr&lt;T&gt;&amp; b);
  <ins>template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp;&amp; a, shared_ptr&lt;T&gt;&amp; b);
  template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp; a, shared_ptr&lt;T&gt;&amp;&amp; b);</ins>
  </pre></blockquote>
*************** template&lt;class T&gt; void swap(shared
*** 38012,38028 ****
  
  
  <hr>
! <h3><a name="744"></a>744. What is the lifetime of an exception pointed to by an exception_ptr?</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Without some lifetime guarantee, it is hard to know how this type can be
  used.  Very specifically, I don't see how the current wording would
! guarantee and exception_ptr caught at the end of one thread could be safely
  stored and rethrown in another thread - the original motivation for this
  API.
  </p>
--- 38276,38291 ----
  
  
  <hr>
! <h3><a name="744"></a>744. What is the lifetime of an exception pointed to by an <tt>exception_ptr</tt>?</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Without some lifetime guarantee, it is hard to know how this type can be
  used.  Very specifically, I don't see how the current wording would
! guarantee and <tt>exception_ptr</tt> caught at the end of one thread could be safely
  stored and rethrown in another thread - the original motivation for this
  API.
  </p>
*************** Move to Open.
*** 38062,38068 ****
  Change 18.8.5 [propagation]/7:
  </p>
  
! <blockquote>
  -7- Returns: An <tt>exception_ptr</tt> object that refers to the currently
  handled exception or a copy of the currently handled exception, or a
  null <tt>exception_ptr</tt> object if no exception is being handled.
--- 38325,38331 ----
  Change 18.8.5 [propagation]/7:
  </p>
  
! <blockquote><p>
  -7- Returns: An <tt>exception_ptr</tt> object that refers to the currently
  handled exception or a copy of the currently handled exception, or a
  null <tt>exception_ptr</tt> object if no exception is being handled.
*************** fails, it returns an <tt>exception_ptr</
*** 38074,38092 ****
  calls to <tt>current_exception</tt> refer to the same exception object. [<i>Note:</i>
  that is, it is unspecified whether <tt>current_exception</tt> creates a new copy
  each time it is called. <i>--end note</i>]
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="746"></a>746. current_exception may fail with bad_alloc</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I understand that the attempt to copy an exception may run out of memory,
--- 38337,38354 ----
  calls to <tt>current_exception</tt> refer to the same exception object. [<i>Note:</i>
  that is, it is unspecified whether <tt>current_exception</tt> creates a new copy
  each time it is called. <i>--end note</i>]
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="746"></a>746. <tt>current_exception</tt> may fail with <tt>bad_alloc</tt></h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I understand that the attempt to copy an exception may run out of memory,
*************** Accept the broad view and move to ready
*** 38138,38162 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following exemption clause to 17.6.4.12 [res.on.exception.handling]:
  </p>
  
! <blockquote>
  A function may throw a type not listed in its <i>Throws</i> clause so long as it is
  derived from a class named in the <i>Throws</i> clause, and would be caught by an
  exception handler for the base type.
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="749"></a>749. Currently <tt>has_nothrow_copy_constructor&lt;T&gt;::value</tt> is true if T has 'a' nothrow copy constructor.</h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Unfortunately a class can have multiple copy constructors, and I believe to
--- 38400,38425 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following exemption clause to 17.6.5.12 [res.on.exception.handling]:
  </p>
  
! <blockquote><p>
  A function may throw a type not listed in its <i>Throws</i> clause so long as it is
  derived from a class named in the <i>Throws</i> clause, and would be caught by an
  exception handler for the base type.
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="749"></a>749. Currently <tt>has_nothrow_copy_constructor&lt;T&gt;::value</tt> is true if <tt>T</tt> has 'a' nothrow copy constructor.</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2007-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Unfortunately a class can have multiple copy constructors, and I believe to
*************** no-throw.
*** 38167,38173 ****
  For instance:
  </p>
  <blockquote>
! <pre>struct awkward {
   awkward( const awkward &amp; ) throw() {}
   awkward( awkward &amp; ) { throw "oops"; } };
  </pre>
--- 38430,38437 ----
  For instance:
  </p>
  <blockquote>
! <pre>
! struct awkward {
   awkward( const awkward &amp; ) throw() {}
   awkward( awkward &amp; ) { throw "oops"; } };
  </pre>
*************** For instance:
*** 38176,38219 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.7.4.3 [meta.unary.prop]:
  </p>
  
  <blockquote>
  <pre>has_trivial_copy_constructor</pre>
! <blockquote>
  <tt>T</tt> is a trivial type (3.9) or a reference type or a class type <del>with a trivial copy constructor</del>
  <ins>where all copy constructors are trivial</ins> (12.8).
! </blockquote>
  </blockquote>
  
  <blockquote>
  <pre>has_trivial_assign</pre>
! <blockquote>
  <tt>T</tt> is neither <tt>const</tt> nor a reference type, and <tt>T</tt> is a trivial type (3.9)
  or a class type <del>with a trivial copy assignment operator</del> <ins>where all copy assignment operators are trivial</ins> (12.8).
! </blockquote>
  </blockquote>
  
  <blockquote>
  <pre>has_nothrow_copy_constructor</pre>
! <blockquote>
  <tt>has_trivial_copy_constructor&lt;T&gt;::value</tt> is <tt>true</tt> or <tt>T</tt> is a class type <del>with
  a</del> <ins>where all</ins> copy constructor<ins>s</ins> <del>that is</del> <ins>are</ins> 
  known not to throw any exceptions or <tt>T</tt> is an
  array of such a class type
! </blockquote>
  </blockquote>
  
  <blockquote>
  <pre>has_nothrow_assign</pre>
! <blockquote>
  <tt>T</tt> is neither <tt>const</tt> nor a reference type, and
  <tt>has_trivial_assign&lt;T&gt;::value</tt> is <tt>true</tt> or <tt>T</tt> is a class type <del>with a</del>
  <ins>where all</ins> copy
  assignment operator<ins>s</ins> tak<ins>e</ins><del>ing</del> an lvalue of type <tt>T</tt> that is known not to
  throw any exceptions or <tt>T</tt> is an array of such a class type.
! </blockquote>
  </blockquote>
  
  
--- 38440,38483 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.10.4.3 [meta.unary.prop]:
  </p>
  
  <blockquote>
  <pre>has_trivial_copy_constructor</pre>
! <blockquote><p>
  <tt>T</tt> is a trivial type (3.9) or a reference type or a class type <del>with a trivial copy constructor</del>
  <ins>where all copy constructors are trivial</ins> (12.8).
! </p></blockquote>
  </blockquote>
  
  <blockquote>
  <pre>has_trivial_assign</pre>
! <blockquote><p>
  <tt>T</tt> is neither <tt>const</tt> nor a reference type, and <tt>T</tt> is a trivial type (3.9)
  or a class type <del>with a trivial copy assignment operator</del> <ins>where all copy assignment operators are trivial</ins> (12.8).
! </p></blockquote>
  </blockquote>
  
  <blockquote>
  <pre>has_nothrow_copy_constructor</pre>
! <blockquote><p>
  <tt>has_trivial_copy_constructor&lt;T&gt;::value</tt> is <tt>true</tt> or <tt>T</tt> is a class type <del>with
  a</del> <ins>where all</ins> copy constructor<ins>s</ins> <del>that is</del> <ins>are</ins> 
  known not to throw any exceptions or <tt>T</tt> is an
  array of such a class type
! </p></blockquote>
  </blockquote>
  
  <blockquote>
  <pre>has_nothrow_assign</pre>
! <blockquote><p>
  <tt>T</tt> is neither <tt>const</tt> nor a reference type, and
  <tt>has_trivial_assign&lt;T&gt;::value</tt> is <tt>true</tt> or <tt>T</tt> is a class type <del>with a</del>
  <ins>where all</ins> copy
  assignment operator<ins>s</ins> tak<ins>e</ins><del>ing</del> an lvalue of type <tt>T</tt> that is known not to
  throw any exceptions or <tt>T</tt> is an array of such a class type.
! </p></blockquote>
  </blockquote>
  
  
*************** throw any exceptions or <tt>T</tt> is an
*** 38223,38235 ****
  
  <hr>
  <h3><a name="752"></a>752. Allocator complexity requirement</h3>
! <p><b>Section:</b> 20.2.5 [allocator.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2007-10-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Did LWG recently discuss 20.2.5 [allocator.requirements]-2, which states that "All the operations
  on the allocators are expected to be amortized constant time."?
  </p>
  <p>
--- 38487,38500 ----
  
  <hr>
  <h3><a name="752"></a>752. Allocator complexity requirement</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2007-10-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Did LWG recently discuss 17.6.3.5 [allocator.requirements]-2, which states that "All the operations
  on the allocators are expected to be amortized constant time."?
  </p>
  <p>
*************** the constants, not the asymptotic comple
*** 38252,38258 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.2.5 [allocator.requirements]/2:
  </p>
  
  <blockquote>
--- 38517,38523 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 17.6.3.5 [allocator.requirements]/2:
  </p>
  
  <blockquote>
*************** requirements on allocator types.
*** 38270,38279 ****
  
  <hr>
  <h3><a name="753"></a>753. Move constructor in draft</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Yechezkel Mett <b>Opened:</b> 2007-10-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The draft standard n2369 uses the term <i>move constructor</i> in a few
--- 38535,38544 ----
  
  <hr>
  <h3><a name="753"></a>753. Move constructor in draft</h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Yechezkel Mett <b>Opened:</b> 2007-10-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The draft standard n2369 uses the term <i>move constructor</i> in a few
*************** places, but doesn't seem to define it.
*** 38281,38304 ****
  </p>
  
  <p>
! <tt>MoveConstructible</tt> requirements are defined in Table 33 in 20.2.1 [utility.arg.requirements] as
  follows:
  </p>
  
  <blockquote>
  <table border="1">
  <caption><tt>MoveConstructible</tt> requirements</caption>
! <tbody><tr>
  <th>expression</th> <th>post-condition</th>
  </tr>
  <tr>
  <td><tt>T t = rv</tt></td> <td><tt>t</tt> is equivalent to the value of <tt>rv</tt> before the construction</td>
  </tr>
  <tr>
! <td colspan="2">[<i>Note:</i> There is no requirement on the value of <tt>rv</tt> after the 
  construction. <i>-- end note</i>]</td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
--- 38546,38569 ----
  </p>
  
  <p>
! <tt>MoveConstructible</tt> requirements are defined in Table 33 in 17.6.3.1 [utility.arg.requirements] as
  follows:
  </p>
  
  <blockquote>
  <table border="1">
  <caption><tt>MoveConstructible</tt> requirements</caption>
! <tr>
  <th>expression</th> <th>post-condition</th>
  </tr>
  <tr>
  <td><tt>T t = rv</tt></td> <td><tt>t</tt> is equivalent to the value of <tt>rv</tt> before the construction</td>
  </tr>
  <tr>
! <td colspan="2">[<i>Note:</i> There is no requirement on the value of <tt>rv</tt> after the
  construction. <i>-- end note</i>]</td>
  </tr>
! </table>
  </blockquote>
  
  <p>
*************** in filling the above requirement.
*** 38312,38324 ****
  
  <p>
  For <tt>vector::reserve</tt>, <tt>vector::resize</tt> and the <tt>vector</tt> modifiers given in
! 23.4.1.4 [vector.modifiers] we have
  </p>
  
! <blockquote>
  <i>Requires:</i> If <tt>value_type</tt> has a move constructor, that constructor shall
  not throw any exceptions.
! </blockquote>
  
  <p>
  Firstly "If <tt>value_type</tt> has a move constructor" is superfluous; every
--- 38577,38589 ----
  
  <p>
  For <tt>vector::reserve</tt>, <tt>vector::resize</tt> and the <tt>vector</tt> modifiers given in
! 23.3.6.5 [vector.modifiers] we have
  </p>
  
! <blockquote><p>
  <i>Requires:</i> If <tt>value_type</tt> has a move constructor, that constructor shall
  not throw any exceptions.
! </p></blockquote>
  
  <p>
  Firstly "If <tt>value_type</tt> has a move constructor" is superfluous; every
*************** Howard adds post-Bellevue:
*** 38384,38394 ****
  
  <blockquote>
  <p>
! Unfortunately I believe the wording recommended by the LWG in Bellevue is incorrect.  <tt>reserve</tt> et. al. will use a move constructor
! if one is available, else it will use a copy constructor.  A type may have both.  If the move constructor is
! used, it must not throw.  If the copy constructor is used, it can throw.  The sentence in the proposed wording
! is correct without the recommended insertion.  The Bellevue LWG recommended moving this issue to Ready.  I am
! unfortunately pulling it back to Open.  But I'm drafting wording to atone for this egregious action. :-)
  </p>
  </blockquote>
  
--- 38649,38660 ----
  
  <blockquote>
  <p>
! Unfortunately I believe the wording recommended by the LWG in Bellevue is incorrect.  <tt>reserve</tt> et. al. 
! will use a move constructor if one is available, else it will use a copy constructor.  A type may have both.  
! If the move constructor is used, it must not throw.  If the copy constructor is used, it can throw.  The 
! sentence in the proposed wording is correct without the recommended insertion.  The Bellevue LWG recommended 
! moving this issue to Ready.  I am unfortunately pulling it back to Open.  But I'm drafting wording to atone 
! for this egregious action. :-)
  </p>
  </blockquote>
  
*************** unfortunately pulling it back to Open.
*** 38399,38426 ****
  
  <hr>
  <h3><a name="755"></a>755. <tt>std::vector</tt> and <tt>std:string</tt> lack explicit shrink-to-fit operations</h3>
! <p><b>Section:</b> 23.4.1.2 [vector.capacity], 21.4.4 [string.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2007-10-31 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A <tt>std::vector</tt> can be shrunk-to-fit via the swap idiom:
  </p>
  
! <blockquote><pre>vector&lt;int&gt; v;
  ...
  v.swap(vector&lt;int&gt;(v));  // shrink to fit
  </pre>
  <blockquote><p>
  or:
  </p></blockquote>
! <pre>vector&lt;int&gt;(v).swap(v);  // shrink to fit
  </pre>
  <blockquote><p>
  or:
  </p></blockquote>
! <pre>swap(v, vector&lt;int&gt;(v));  // shrink to fit
  </pre>
  </blockquote>
  
--- 38665,38696 ----
  
  <hr>
  <h3><a name="755"></a>755. <tt>std::vector</tt> and <tt>std:string</tt> lack explicit shrink-to-fit operations</h3>
! <p><b>Section:</b> 23.3.6.3 [vector.capacity], 21.4.4 [string.capacity] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2007-10-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A <tt>std::vector</tt> can be shrunk-to-fit via the swap idiom:
  </p>
  
! <blockquote><pre>
! vector&lt;int&gt; v;
  ...
  v.swap(vector&lt;int&gt;(v));  // shrink to fit
  </pre>
  <blockquote><p>
  or:
  </p></blockquote>
! <pre>
! vector&lt;int&gt;(v).swap(v);  // shrink to fit
  </pre>
  <blockquote><p>
  or:
  </p></blockquote>
! <pre>
! swap(v, vector&lt;int&gt;(v));  // shrink to fit
  </pre>
  </blockquote>
  
*************** or:
*** 38428,38434 ****
  A non-binding request for shrink-to-fit can be made to a <tt>std::string</tt> via:
  </p>
  
! <blockquote><pre>string s;
  ...
  s.reserve(0);
  </pre></blockquote>
--- 38698,38705 ----
  A non-binding request for shrink-to-fit can be made to a <tt>std::string</tt> via:
  </p>
  
! <blockquote><pre>
! string s;
  ...
  s.reserve(0);
  </pre></blockquote>
*************** takes no arguments to keep the solution
*** 38454,38461 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  To Class template basic_string 21.4 [basic.string] synopsis,
! Class template vector 23.4.1 [vector] synopsis, and Class
! vector&lt;bool&gt; 23.4.2 [vector.bool] synopsis, add:
  </p>
  
  <blockquote><pre>    
--- 38725,38732 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  To Class template basic_string 21.4 [basic.string] synopsis,
! Class template vector 23.3.6 [vector] synopsis, and Class
! vector&lt;bool&gt; 23.3.7 [vector.bool] synopsis, add:
  </p>
  
  <blockquote><pre>    
*************** void shrink_to_fit();
*** 38464,38504 ****
  
  <p>
  To basic_string capacity 21.4.4 [string.capacity] and vector
! capacity 23.4.1.2 [vector.capacity], add:
  </p>
  
  <blockquote>
! <pre>void shrink_to_fit();
  </pre>
! <blockquote>
  <i>Remarks:</i> <tt>shrink_to_fit</tt> is a non-binding request to reduce
  <tt>capacity()</tt> to <tt>size()</tt>. [<i>Note:</i> The request is non-binding to
  allow latitude for implementation-specific optimizations.
! <i>-- end note</i>]
! </blockquote>
  </blockquote>
  
  <p><i>[
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#850">850</a> has been added to deal with this issue with respect to <tt>deque</tt>.
  ]</i></p>
  
  
  
  
  
  
  <hr>
  <h3><a name="758"></a>758. <tt>shared_ptr</tt> and <tt>nullptr</tt></h3>
! <p><b>Section:</b> 20.9.10.2 [util.smartptr.shared] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2007-10-31 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider the following program:
  </p>
  
! <blockquote><pre>int main() {
     shared_ptr&lt;int&gt; p(nullptr); 
     return 0;
  }
--- 38735,38883 ----
  
  <p>
  To basic_string capacity 21.4.4 [string.capacity] and vector
! capacity 23.3.6.3 [vector.capacity], add:
  </p>
  
  <blockquote>
! <pre>
! void shrink_to_fit();
  </pre>
! <blockquote><p>
  <i>Remarks:</i> <tt>shrink_to_fit</tt> is a non-binding request to reduce
  <tt>capacity()</tt> to <tt>size()</tt>. [<i>Note:</i> The request is non-binding to
  allow latitude for implementation-specific optimizations.
! &mdash; <i>end note</i>]
! </p></blockquote>
  </blockquote>
  
  <p><i>[
! <a href="lwg-defects.html#850">850</a> has been added to deal with this issue with respect to <tt>deque</tt>.
! ]</i></p>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="756"></a>756. Container adaptors push</h3>
! <p><b>Section:</b> 23.6 [container.adaptors] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2007-10-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! After n2369 we have a single <tt>push_back</tt> overload in the sequence containers,
! of the "emplace" type. At variance with that, still in n2461, we have
! two separate overloads, the C++03 one + one taking an rvalue reference
! in the container adaptors. Therefore, simply from a consistency point of
! view, I was wondering whether the container adaptors should be aligned
! with the specifications of the sequence container themselves: thus have
! a single <tt>push</tt> along the lines:
! </p>
! 
! <blockquote><pre>
! template&lt;typename... _Args&gt;
! void
! push(_Args&amp;&amp;... __args)
!   { c.push_back(std::forward&lt;_Args&gt;(__args)...); }
! </pre></blockquote>
! 
! <p><i>[
! Related to <a href="lwg-defects.html#767">767</a>
  ]</i></p>
  
  
  
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change 23.6.3.1 [queue.defn]:
+ </p>
+ 
+ <blockquote><pre>
+ <del>void push(const value_type&amp; x) { c.push_back(x); }</del>
+ <del>void push(value_type&amp;&amp; x) { c.push_back(std::move(x)); }</del>
+ <ins>template&lt;class... Args&gt; void push(Args&amp;&amp;... args) { c.push_back(std::forward&lt;Args&gt;(args)...); }</ins>
+ </pre></blockquote>
+ 
+ <p>
+ Change 23.6.4 [priority.queue]:
+ </p>
+ 
+ <blockquote><pre>
+ <del>void push(const value_type&amp; x) { c.push_back(x); }</del>
+ <del>void push(value_type&amp;&amp; x) { c.push_back(std::move(x)); }</del>
+ <ins>template&lt;class... Args&gt; void push(Args&amp;&amp;... args) { c.push_back(std::forward&lt;Args&gt;(args)...); }</ins>
+ </pre></blockquote>
+ 
+ <p>
+ Change 23.6.4.3 [priqueue.members]:
+ </p>
+ 
+ <blockquote>
+ <pre>
+ <del>void push(const value_type&amp; x);</del>
+ </pre>
+ <blockquote>
+ <p>
+ <del><i>Effects:</i></del>
+ </p>
+ <blockquote><pre>
+ <del>c.push_back(x);</del>
+ <del>push_heap(c.begin(), c.end(), comp);</del>
+ </pre></blockquote>
+ </blockquote>
+ 
+ <pre>
+ <ins>template&lt;class... Args&gt;</ins> void push(<del>value_type</del> <ins>Args</ins>&amp;&amp;<ins>...</ins> <del>x</del> <ins>args</ins>);
+ </pre>
+ <blockquote>
+ <p>
+ <i>Effects:</i>
+ </p>
+ <blockquote><pre>
+ c.push_back(std::<del>move</del><ins>forward&lt;Args&gt;</ins>(<del>x</del> <ins>args</ins>)<ins>...</ins>);
+ push_heap(c.begin(), c.end(), comp);
+ </pre></blockquote>
+ </blockquote>
+ </blockquote>
+ 
+ <p>
+ Change 23.6.5.2 [stack.defn]:
+ </p>
+ 
+ <blockquote><pre>
+ <del>void push(const value_type&amp; x) { c.push_back(x); }</del>
+ <del>void push(value_type&amp;&amp; x) { c.push_back(std::move(x)); }</del>
+ <ins>template&lt;class... Args&gt; void push(Args&amp;&amp;... args) { c.push_back(std::forward&lt;Args&gt;(args)...); }</ins>
+ </pre></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2680.pdf">N2680 Proposed Wording for Placement Insert (Revision 1)</a>.
+ </p>
+ 
+ 
  
  
  
  <hr>
  <h3><a name="758"></a>758. <tt>shared_ptr</tt> and <tt>nullptr</tt></h3>
! <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2007-10-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider the following program:
  </p>
  
! <blockquote><pre>
! int main() {
     shared_ptr&lt;int&gt; p(nullptr); 
     return 0;
  }
*************** This program will fail to compile becaus
*** 38509,38515 ****
  template constructor to construct itself from pointers:
  </p>
  
! <blockquote><pre>template &lt;class Y&gt; shared_ptr(Y *);
  </pre></blockquote>
  
  <p>
--- 38888,38895 ----
  template constructor to construct itself from pointers:
  </p>
  
! <blockquote><pre>
! template &lt;class Y&gt; shared_ptr(Y *);
  </pre></blockquote>
  
  <p>
*************** the conversion from <tt>nullptr_t</tt> t
*** 38519,38525 ****
  deducible, so the above constructor will not be found.  There are similar problems with the
  constructors that take a pointer and a <tt>deleter</tt> or a
  pointer, a <tt>deleter</tt> and an allocator, as well as the
! corresponding forms of <tt>reset()</tt>. Note that <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2435.htm">N2435</a>
  will solve this problem for constructing from just <tt>nullptr</tt>, but not for constructors that use
  <tt>deleters</tt> or allocators or for <tt>reset()</tt>.
  </p>
--- 38899,38906 ----
  deducible, so the above constructor will not be found.  There are similar problems with the
  constructors that take a pointer and a <tt>deleter</tt> or a
  pointer, a <tt>deleter</tt> and an allocator, as well as the
! corresponding forms of <tt>reset()</tt>. Note that <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2435.htm">N2435</a>
  will solve this problem for constructing from just <tt>nullptr</tt>, but not for constructors that use
  <tt>deleters</tt> or allocators or for <tt>reset()</tt>.
  </p>
*************** The following wording changes are less i
*** 38587,38603 ****
  </p>
  
  <p>
! In 20.9.10.2.1 [util.smartptr.shared.const], add:
  </p>
  
! <blockquote><pre>shared_ptr(nullptr_t);
  </pre></blockquote>
  
  <p>
  after:
  </p>
  
! <blockquote><pre>shared_ptr();
  </pre></blockquote>
  
  <p>
--- 38968,38986 ----
  </p>
  
  <p>
! In 20.8.2.2.1 [util.smartptr.shared.const], add:
  </p>
  
! <blockquote><pre>
! shared_ptr(nullptr_t);
  </pre></blockquote>
  
  <p>
  after:
  </p>
  
! <blockquote><pre>
! shared_ptr();
  </pre></blockquote>
  
  <p>
*************** extended to take <tt>nullptr</tt>, but i
*** 38616,38622 ****
  Add
  </p>
  
! <blockquote><pre>template&lt;class D&gt; shared_ptr(nullptr_t p, D d);
  template&lt;class D, class A&gt; shared_ptr(nullptr_t p, D d, A a);
  </pre></blockquote>
  
--- 38999,39006 ----
  Add
  </p>
  
! <blockquote><pre>
! template&lt;class D&gt; shared_ptr(nullptr_t p, D d);
  template&lt;class D, class A&gt; shared_ptr(nullptr_t p, D d, A a);
  </pre></blockquote>
  
*************** template&lt;class D, class A&gt; shared_
*** 38624,38630 ****
  after
  </p>
  
! <blockquote><pre>template&lt;class Y, class D&gt; shared_ptr(Y* p, D d);
  template&lt;class Y, class D, class A&gt; shared_ptr(Y* p, D d, A a);
  </pre></blockquote>
  
--- 39008,39015 ----
  after
  </p>
  
! <blockquote><pre>
! template&lt;class Y, class D&gt; shared_ptr(Y* p, D d);
  template&lt;class Y, class D, class A&gt; shared_ptr(Y* p, D d, A a);
  </pre></blockquote>
  
*************** Disposition: move to review. The review
*** 38666,38676 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9.10.2 [util.smartptr.shared] p4, add to the definition/synopsis
  of <tt>shared_ptr</tt>:
  </p>
  
! <blockquote><pre>template&lt;class D&gt; shared_ptr(nullptr_t p, D d);
  template&lt;class D, class A&gt; shared_ptr(nullptr_t p, D d, A a);
  </pre></blockquote>
  
--- 39051,39062 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.8.2.2 [util.smartptr.shared] p4, add to the definition/synopsis
  of <tt>shared_ptr</tt>:
  </p>
  
! <blockquote><pre>
! template&lt;class D&gt; shared_ptr(nullptr_t p, D d);
  template&lt;class D, class A&gt; shared_ptr(nullptr_t p, D d, A a);
  </pre></blockquote>
  
*************** template&lt;class D, class A&gt; shared_
*** 38678,38692 ****
  after
  </p>
  
! <blockquote><pre>template&lt;class Y, class D&gt; shared_ptr(Y* p, D d);
  template&lt;class Y, class D, class A&gt; shared_ptr(Y* p, D d, A a);
  </pre></blockquote>
  
  <p>
! In 20.9.10.2.1 [util.smartptr.shared.const] add:
  </p>
  
! <blockquote><pre>template&lt;class D&gt; shared_ptr(nullptr_t p, D d);
  template&lt;class D, class A&gt; shared_ptr(nullptr_t p, D d, A a);
  </pre></blockquote>
  
--- 39064,39080 ----
  after
  </p>
  
! <blockquote><pre>
! template&lt;class Y, class D&gt; shared_ptr(Y* p, D d);
  template&lt;class Y, class D, class A&gt; shared_ptr(Y* p, D d, A a);
  </pre></blockquote>
  
  <p>
! In 20.8.2.2.1 [util.smartptr.shared.const] add:
  </p>
  
! <blockquote><pre>
! template&lt;class D&gt; shared_ptr(nullptr_t p, D d);
  template&lt;class D, class A&gt; shared_ptr(nullptr_t p, D d, A a);
  </pre></blockquote>
  
*************** template&lt;class D, class A&gt; shared_
*** 38694,38716 ****
  after
  </p>
  
! <blockquote><pre>template&lt;class Y, class D&gt; shared_ptr(Y* p, D d);
  template&lt;class Y, class D, class A&gt; shared_ptr(Y* p, D d, A a);
  </pre></blockquote>
  
  <p>
! (reusing the following paragraphs 20.9.10.2.1 [util.smartptr.shared.const]/9-13 that speak of p.)
  </p>
  
  <p>
! In 20.9.10.2.1 [util.smartptr.shared.const]/10,  change
  </p>
  
! <blockquote>
  <i>Effects:</i> Constructs a <tt>shared_ptr</tt> object that <i>owns</i> the
  <del>pointer</del> <ins>object</ins> <tt>p</tt> and the deleter <tt>d</tt>. The second 
  constructor shall use a copy of <tt>a</tt> to allocate memory for internal use.
! </blockquote>
  
  
  <p><b>Rationale:</b></p>
--- 39082,39105 ----
  after
  </p>
  
! <blockquote><pre>
! template&lt;class Y, class D&gt; shared_ptr(Y* p, D d);
  template&lt;class Y, class D, class A&gt; shared_ptr(Y* p, D d, A a);
  </pre></blockquote>
  
  <p>
! (reusing the following paragraphs 20.8.2.2.1 [util.smartptr.shared.const]/9-13 that speak of p.)
  </p>
  
  <p>
! In 20.8.2.2.1 [util.smartptr.shared.const]/10,  change
  </p>
  
! <blockquote><p>
  <i>Effects:</i> Constructs a <tt>shared_ptr</tt> object that <i>owns</i> the
  <del>pointer</del> <ins>object</ins> <tt>p</tt> and the deleter <tt>d</tt>. The second 
  constructor shall use a copy of <tt>a</tt> to allocate memory for internal use.
! </p></blockquote>
  
  
  <p><b>Rationale:</b></p>
*************** San Francisco:
*** 38719,38727 ****
  ]</i></p>
  
  
! <blockquote>
! "pointer" is changed to "object" to handle the fact that nullptr_t isn't a pointer.
! </blockquote>
  
  
  
--- 39108,39116 ----
  ]</i></p>
  
  
! <blockquote><p>
! "pointer" is changed to "object" to handle the fact that <tt>nullptr_t</tt> isn't a pointer.
! </p></blockquote>
  
  
  
*************** San Francisco:
*** 38730,38748 ****
  
  <hr>
  <h3><a name="759"></a>759. A reference is not an object</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2007-11-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  23.2 [container.requirements] says:
  </p>
  
! <blockquote>
  -12- Objects passed to member functions of a container as rvalue references shall not be elements of that container. No 
  diagnostic required.
! </blockquote>
  
  <p>
  A reference is not an object, but this sentence appears to claim so.
--- 39119,39138 ----
  
  <hr>
  <h3><a name="759"></a>759. A reference is not an object</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2007-11-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  23.2 [container.requirements] says:
  </p>
  
! <blockquote><p>
  -12- Objects passed to member functions of a container as rvalue references shall not be elements of that container. No 
  diagnostic required.
! </p></blockquote>
  
  <p>
  A reference is not an object, but this sentence appears to claim so.
*************** A reference is not an object, but this s
*** 38751,38761 ****
  <p>
  What is probably meant here:
  </p>
! <blockquote>
  An object bound to an rvalue
  reference parameter of a member function of a container shall not be
  an element of that container; no diagnostic required.
! </blockquote>
  
  
  
--- 39141,39151 ----
  <p>
  What is probably meant here:
  </p>
! <blockquote><p>
  An object bound to an rvalue
  reference parameter of a member function of a container shall not be
  an element of that container; no diagnostic required.
! </p></blockquote>
  
  
  
*************** an element of that container; no diagnos
*** 38764,38777 ****
  Change 23.2 [container.requirements]:
  </p>
  
! <blockquote>
  -12- <del>Objects passed to member functions of a container as rvalue references shall not be elements</del>
  <ins>An object bound to an rvalue
  reference parameter of a member function of a container shall not be
  an element</ins>
  of that container<del>.</del><ins>;</ins> <del>N</del><ins>n</ins>o 
  diagnostic required.
! </blockquote>
  
  
  
--- 39154,39167 ----
  Change 23.2 [container.requirements]:
  </p>
  
! <blockquote><p>
  -12- <del>Objects passed to member functions of a container as rvalue references shall not be elements</del>
  <ins>An object bound to an rvalue
  reference parameter of a member function of a container shall not be
  an element</ins>
  of that container<del>.</del><ins>;</ins> <del>N</del><ins>n</ins>o 
  diagnostic required.
! </p></blockquote>
  
  
  
*************** diagnostic required.
*** 38780,38788 ****
  
  <hr>
  <h3><a name="761"></a>761. <tt>unordered_map</tt> needs an <tt>at()</tt> member function</h3>
! <p><b>Section:</b> 23.7.1.2 [unord.map.elem] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2007-11-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The new member function <tt>at()</tt> was recently added to <tt>std::map()</tt>.  It acts 
--- 39170,39178 ----
  
  <hr>
  <h3><a name="761"></a>761. <tt>unordered_map</tt> needs an <tt>at()</tt> member function</h3>
! <p><b>Section:</b> 23.5.4.3 [unord.map.elem] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2007-11-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The new member function <tt>at()</tt> was recently added to <tt>std::map()</tt>.  It acts 
*************** in <tt>std::unordered_map</tt>.
*** 38797,38815 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following functions to the definition of <tt>unordered_map</tt> under "lookup" (23.7.1 [unord.map]):
  </p>
  
! <blockquote><pre>mapped_type&amp; at(const key_type&amp; k);
  const mapped_type &amp;at(const key_type &amp;k) const;
  </pre></blockquote>
  
  <p>
! Add the following definitions to 23.7.1.2 [unord.map.elem]:
  </p>
  
  <blockquote>
! <pre>mapped_type&amp; at(const key_type&amp; k);
  const mapped_type &amp;at(const key_type &amp;k) const;
  </pre>
  <blockquote>
--- 39187,39207 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following functions to the definition of <tt>unordered_map</tt> under "lookup" (23.5.4 [unord.map]):
  </p>
  
! <blockquote><pre>
! mapped_type&amp; at(const key_type&amp; k);
  const mapped_type &amp;at(const key_type &amp;k) const;
  </pre></blockquote>
  
  <p>
! Add the following definitions to 23.5.4.3 [unord.map.elem]:
  </p>
  
  <blockquote>
! <pre>
! mapped_type&amp; at(const key_type&amp; k);
  const mapped_type &amp;at(const key_type &amp;k) const;
  </pre>
  <blockquote>
*************** Bellevue:  Editorial note: the "(unique)
*** 38836,38855 ****
  
  <hr>
  <h3><a name="762"></a>762. <tt>std::unique_ptr</tt> requires complete type?</h3>
! <p><b>Section:</b> 20.9.9 [unique.ptr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-11-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr">issues</a> in [unique.ptr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In contrast to the proposed <tt>std::shared_ptr</tt>, <tt>std::unique_ptr</tt>
  does currently not support incomplete types, because it
  gives no explicit grant - thus instantiating <tt>unique_ptr</tt> with
  an incomplete pointee type <tt>T</tt> automatically belongs to
! undefined behaviour according to 17.6.3.8 [res.on.functions]/2, last
  bullet. This is an unnecessary restriction and prevents
! many well-established patterns - like the bridge pattern -
! for <tt>std::unique_ptr</tt>.
  </p>
  
  <p><i>[
--- 39228,39246 ----
  
  <hr>
  <h3><a name="762"></a>762. <tt>std::unique_ptr</tt> requires complete type?</h3>
! <p><b>Section:</b> 20.8.1 [unique.ptr] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-11-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr">issues</a> in [unique.ptr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In contrast to the proposed <tt>std::shared_ptr</tt>, <tt>std::unique_ptr</tt>
  does currently not support incomplete types, because it
  gives no explicit grant - thus instantiating <tt>unique_ptr</tt> with
  an incomplete pointee type <tt>T</tt> automatically belongs to
! undefined behaviour according to 17.6.4.8 [res.on.functions]&#47;2, last
  bullet. This is an unnecessary restriction and prevents
! many well-established patterns - like the bridge pattern - for <tt>std::unique_ptr</tt>.
  </p>
  
  <p><i>[
*************** Bellevue:
*** 38857,38863 ****
  ]</i></p>
  
  
! <blockquote>
  Move to open. The LWG is comfortable with the intent of allowing
  incomplete types and making <tt>unique_ptr</tt> more like <tt>shared_ptr</tt>, but we are
  not comfortable with the wording. The specification for <tt>unique_ptr</tt>
--- 39248,39254 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to open. The LWG is comfortable with the intent of allowing
  incomplete types and making <tt>unique_ptr</tt> more like <tt>shared_ptr</tt>, but we are
  not comfortable with the wording. The specification for <tt>unique_ptr</tt>
*************** we need the same level of care here. We
*** 38868,38895 ****
  "part of the operational semantic" language; it's not used elsewhere in
  the standard, and it's not clear what it means. We need a volunteer to
  produce new wording.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  The proposed changes in the following revision refers to the current state of
! N2521 including the assumption that X [unique.ptr.compiletime] will be removed
! according to the current state of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#740">740</a>.
  </p>
  <p>
  The specialization <tt>unique_ptr&lt;T[]&gt;</tt> has some more restrictive constraints on
  type-completeness on <tt>T</tt> than <tt>unique_ptr&lt;T&gt;</tt>. The following proposed wordings
  try to cope with that. If the committee sees less usefulness on relaxed
  constraints on <tt>unique_ptr&lt;T[]&gt;</tt>, the alternative would be to stop this relaxation
! e.g. by adding one further bullet to 20.9.9.3 [unique.ptr.runtime]/1:
  "<tt>T</tt> shall be a complete type, if used as template argument of
  <tt>unique_ptr&lt;T[], D&gt;</tt>
  </p>
  <p>
! This issue has some overlap with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a>, but it seems not to cause any
  problems with this one,
! because <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a> adds only optional requirements on <tt>D</tt> that do not conflict
  with the here discussed
  ones, provided that <tt>D::pointer</tt>'s operations (including default
  construction, copy construction/assignment,
--- 39259,39286 ----
  "part of the operational semantic" language; it's not used elsewhere in
  the standard, and it's not clear what it means. We need a volunteer to
  produce new wording.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  The proposed changes in the following revision refers to the current state of
! N2521 including the assumption that  [unique.ptr.compiletime] will be removed
! according to the current state of <a href="lwg-defects.html#740">740</a>.
  </p>
  <p>
  The specialization <tt>unique_ptr&lt;T[]&gt;</tt> has some more restrictive constraints on
  type-completeness on <tt>T</tt> than <tt>unique_ptr&lt;T&gt;</tt>. The following proposed wordings
  try to cope with that. If the committee sees less usefulness on relaxed
  constraints on <tt>unique_ptr&lt;T[]&gt;</tt>, the alternative would be to stop this relaxation
! e.g. by adding one further bullet to 20.8.1.3 [unique.ptr.runtime]&#47;1:
  "<tt>T</tt> shall be a complete type, if used as template argument of
  <tt>unique_ptr&lt;T[], D&gt;</tt>
  </p>
  <p>
! This issue has some overlap with <a href="lwg-defects.html#673">673</a>, but it seems not to cause any
  problems with this one,
! because <a href="lwg-defects.html#673">673</a> adds only optional requirements on <tt>D</tt> that do not conflict
  with the here discussed
  ones, provided that <tt>D::pointer</tt>'s operations (including default
  construction, copy construction/assignment,
*************** current specification of <tt>unique_ptr<
*** 38901,38910 ****
  <ol>
  <li>
  <p>
! In 20.9.9 [unique.ptr]/2 add as the last sentence to the existing para:
  </p>
  
! <blockquote>
  The <tt>unique_ptr</tt> provides a semantics of strict ownership. A
  <tt>unique_ptr</tt> owns the object it holds a pointer to. A
  <tt>unique_ptr</tt> is not <tt>CopyConstructible</tt>, nor
--- 39292,39301 ----
  <ol>
  <li>
  <p>
! In 20.8.1 [unique.ptr]&#47;2 add as the last sentence to the existing para:
  </p>
  
! <blockquote><p>
  The <tt>unique_ptr</tt> provides a semantics of strict ownership. A
  <tt>unique_ptr</tt> owns the object it holds a pointer to. A
  <tt>unique_ptr</tt> is not <tt>CopyConstructible</tt>, nor
*************** uses of <tt>unique_ptr</tt> include prov
*** 38915,38926 ****
  dynamically allcoated memory, passing ownership of dynamically allocated
  memory to a function, and returning dynamically allocated memory from a
  function. -- <i>end note</i> ]
! </blockquote>
  </li>
  
  <li>
  <p>
! 20.9.9.2.1 [unique.ptr.single.ctor]/1: No changes necessary.
  </p>
  
  <blockquote>
--- 39306,39317 ----
  dynamically allcoated memory, passing ownership of dynamically allocated
  memory to a function, and returning dynamically allocated memory from a
  function. -- <i>end note</i> ]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! 20.8.1.2.1 [unique.ptr.single.ctor]&#47;1: No changes necessary.
  </p>
  
  <blockquote>
*************** The current wording says just this.
*** 38934,38940 ****
  
  <li>
  <p>
! In 20.9.9.2.1 [unique.ptr.single.ctor]/5 change the requires clause to say:
  </p>
  
  <blockquote>
--- 39325,39331 ----
  
  <li>
  <p>
! In 20.8.1.2.1 [unique.ptr.single.ctor]&#47;5 change the requires clause to say:
  </p>
  
  <blockquote>
*************** again requires Completeness of <tt>Y</tt
*** 38971,38977 ****
  
  <li>
  <p>
! Merge 20.9.9.2.1 [unique.ptr.single.ctor]/12+13 thereby removing the sentence
  of 12, but transferring the "requires" to 13:
  </p>
  
--- 39362,39368 ----
  
  <li>
  <p>
! Merge 20.8.1.2.1 [unique.ptr.single.ctor]&#47;12+13 thereby removing the sentence
  of 12, but transferring the "requires" to 13:
  </p>
  
*************** pointer and the <tt>D</tt> deleter are w
*** 38990,39001 ****
  </li>
  
  <li>
! 20.9.9.2.1 [unique.ptr.single.ctor]/17: No changes necessary.
  </li>
  <li>
! <p>20.9.9.2.1 [unique.ptr.single.ctor]/21:</p>
  
! <blockquote>
  <i>Requires:</i> If <tt>D</tt> is not a reference type, construction of
  the deleter <tt>D</tt> from an rvalue of type <tt>E</tt> shall be well
  formed and shall not throw an exception. If <tt>D</tt> is a reference
--- 39381,39392 ----
  </li>
  
  <li>
! 20.8.1.2.1 [unique.ptr.single.ctor]&#47;17: No changes necessary.
  </li>
  <li>
! <p>20.8.1.2.1 [unique.ptr.single.ctor]&#47;21:</p>
  
! <blockquote><p>
  <i>Requires:</i> If <tt>D</tt> is not a reference type, construction of
  the deleter <tt>D</tt> from an rvalue of type <tt>E</tt> shall be well
  formed and shall not throw an exception. If <tt>D</tt> is a reference
*************** type, then <tt>E</tt> shall be the same
*** 39003,39009 ****
  required). <tt>U*</tt> shall be implicitly convertible to <tt>T*</tt>.
  <ins>[<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt>
  be complete types. <i>-- end note</i>]</ins>
! </blockquote>
  
  <p><i>[
  N.B.: The current wording of 21 already implicitly guarantees that <tt>U</tt>
--- 39394,39400 ----
  required). <tt>U*</tt> shall be implicitly convertible to <tt>T*</tt>.
  <ins>[<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt>
  be complete types. <i>-- end note</i>]</ins>
! </p></blockquote>
  
  <p><i>[
  N.B.: The current wording of 21 already implicitly guarantees that <tt>U</tt>
*************** e.g. "<tt>U</tt> shall be a complete typ
*** 39016,39022 ****
  
  <li>
  <p>
! 20.9.9.2.2 [unique.ptr.single.dtor]: Just before p1 add a new paragraph:
  </p>
  <blockquote>
  <p>
--- 39407,39413 ----
  
  <li>
  <p>
! 20.8.1.2.2 [unique.ptr.single.dtor]: Just before p1 add a new paragraph:
  </p>
  <blockquote>
  <p>
*************** type-completeness of <tt>T</tt> is deleg
*** 39035,39041 ****
  
  <li>
  <p>
! 20.9.9.2.3 [unique.ptr.single.asgn]/1: No changes necessary, except the
  current editorial issue, that "must shall" has to be changed to
  "shall", but this change is not a special part of this resolution.
  </p>
--- 39426,39432 ----
  
  <li>
  <p>
! 20.8.1.2.3 [unique.ptr.single.asgn]&#47;1: No changes necessary, except the
  current editorial issue, that "must shall" has to be changed to
  "shall", but this change is not a special part of this resolution.
  </p>
*************** further requirements on the requirements
*** 39049,39064 ****
  
  <li>
  <p>
! 20.9.9.2.3 [unique.ptr.single.asgn]/6:
  </p>
  
! <blockquote>
  <i>Requires:</i> Assignment of the deleter <tt>D</tt> from an rvalue
  <tt>D</tt> shall not throw an exception. <tt>U*</tt> shall be implicitly
  convertible to <tt>T*</tt>.
  <ins>[<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt>
  be complete types. <i>-- end note</i>]</ins>
! </blockquote>
  
  <p><i>[
  N.B.: The current wording of p. 6 already implicitly guarantees that
--- 39440,39455 ----
  
  <li>
  <p>
! 20.8.1.2.3 [unique.ptr.single.asgn]&#47;6:
  </p>
  
! <blockquote><p>
  <i>Requires:</i> Assignment of the deleter <tt>D</tt> from an rvalue
  <tt>D</tt> shall not throw an exception. <tt>U*</tt> shall be implicitly
  convertible to <tt>T*</tt>.
  <ins>[<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt>
  be complete types. <i>-- end note</i>]</ins>
! </p></blockquote>
  
  <p><i>[
  N.B.: The current wording of p. 6 already implicitly guarantees that
*************** is true, see (6)+(8).
*** 39070,39076 ****
  
  <li>
  <p>
! 20.9.9.2.3 [unique.ptr.single.asgn]/11: No changes necessary.
  </p>
  <p><i>[
  N.B.: Delegation to requirements of effects clause is sufficient.
--- 39461,39467 ----
  
  <li>
  <p>
! 20.8.1.2.3 [unique.ptr.single.asgn]&#47;11: No changes necessary.
  </p>
  <p><i>[
  N.B.: Delegation to requirements of effects clause is sufficient.
*************** N.B.: Delegation to requirements of effe
*** 39079,39115 ****
  </li>
  
  <li>
! 20.9.9.2.4 [unique.ptr.single.observers]/1+4+7+9+11:
! </li>
  
  <blockquote>
  <pre>T* operator-&gt;() const;</pre>
! <blockquote>
! <ins><i>Note:</i> Use typically requires <tt>T</tt> shall be complete. <i>-- end note</i>]</ins>
! </blockquote>
  </blockquote>
  
  <li>
! 20.9.9.2.5 [unique.ptr.single.modifiers]/1: No changes necessary.
  </li>
  
  <li>
  <p>
! 20.9.9.2.5 [unique.ptr.single.modifiers]/4: Just before p. 4 add a new paragraph:
  </p>
! <blockquote>
  <i>Requires:</i> The expression <tt>get_deleter()(get())</tt> shall be well-formed,
  shall have well-defined behavior, and shall not throw exceptions.
! </blockquote>
  </li>
  
  <li>
! 20.9.9.2.5 [unique.ptr.single.modifiers]/7: No changes necessary.
  </li>
  
  <li>
  <p>
! 20.9.9.3 [unique.ptr.runtime]: Add one additional bullet on paragraph 1:
  </p>
  
  <blockquote>
--- 39470,39508 ----
  </li>
  
  <li>
! <p>
! 20.8.1.2.4 [unique.ptr.single.observers]&#47;1+4+7+9+11:
! </p>
  
  <blockquote>
  <pre>T* operator-&gt;() const;</pre>
! <blockquote><p>
! <ins><i>Note:</i> Use typically requires <tt>T</tt> shall be complete. &mdash; <i>end note</i>]</ins>
! </p></blockquote>
  </blockquote>
+ </li>
  
  <li>
! 20.8.1.2.5 [unique.ptr.single.modifiers]&#47;1: No changes necessary.
  </li>
  
  <li>
  <p>
! 20.8.1.2.5 [unique.ptr.single.modifiers]&#47;4: Just before p. 4 add a new paragraph:
  </p>
! <blockquote><p>
  <i>Requires:</i> The expression <tt>get_deleter()(get())</tt> shall be well-formed,
  shall have well-defined behavior, and shall not throw exceptions.
! </p></blockquote>
  </li>
  
  <li>
! 20.8.1.2.5 [unique.ptr.single.modifiers]&#47;7: No changes necessary.
  </li>
  
  <li>
  <p>
! 20.8.1.3 [unique.ptr.runtime]: Add one additional bullet on paragraph 1:
  </p>
  
  <blockquote>
*************** post Bellevue: Daniel provided revised w
*** 39140,39154 ****
  
  
  <hr>
! <h3><a name="765"></a>765. more on iterator validity</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-12-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
         <p>
  
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#278">278</a>
  defines the meaning of the term "invalid iterator" as one that may be
  singular.
  
--- 39533,39547 ----
  
  
  <hr>
! <h3><a name="765"></a>765. More on iterator validity</h3>
! <p><b>Section:</b> X [iterator.concepts] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2007-12-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.concepts">issues</a> in [iterator.concepts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
         <p>
  
! Issue <a href="lwg-defects.html#278">278</a>
  defines the meaning of the term "invalid iterator" as one that may be
  singular.
  
*************** singular.
*** 39158,39164 ****
  Consider the following code:
  
         </p>
!        <pre>   std::deque&lt;int&gt; x, y;
     std::deque&lt;int&gt;::iterator i = x.end(), j = y.end();
     x.swap(y);
         </pre>
--- 39551,39558 ----
  Consider the following code:
  
         </p>
!        <pre>
!    std::deque&lt;int&gt; x, y;
     std::deque&lt;int&gt;::iterator i = x.end(), j = y.end();
     x.swap(y);
         </pre>
*************** I.e., is the expression below required t
*** 39176,39182 ****
  to <code>true</code>?
  
         </p>
!        <pre>   i == y.end() &amp;&amp; j == x.end()
         </pre>
         <p>
  
--- 39570,39577 ----
  to <code>true</code>?
  
         </p>
!        <pre>
!    i == y.end() &amp;&amp; j == x.end()
         </pre>
         <p>
  
*************** returns <code>false</code>.)
*** 39186,39192 ****
         </p>
         <p>
  
! More generally, is the definition introduced in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#278">278</a> meant to
  make any guarantees about whether iterators actually point to the same
  elements or be associated with the same containers after a
  non-invalidating operation as they did before?
--- 39581,39587 ----
         </p>
         <p>
  
! More generally, is the definition introduced in issue <a href="lwg-defects.html#278">278</a> meant to
  make any guarantees about whether iterators actually point to the same
  elements or be associated with the same containers after a
  non-invalidating operation as they did before?
*************** Here's a motivating example intended to
*** 39198,39204 ****
  the question:
  
         </p>
!        <pre>   Container x, y ({ 1, 2});   // pseudocode to initialize y with { 1, 2 }
     Container::iterator i = y.begin() + 1;
     Container::iterator j = y.end();
     std::swap(x, y);
--- 39593,39600 ----
  the question:
  
         </p>
!        <pre>
!    Container x, y ({ 1, 2});   // pseudocode to initialize y with { 1, 2 }
     Container::iterator i = y.begin() + 1;
     Container::iterator j = y.end();
     std::swap(x, y);
*************** San Francisco:
*** 39220,39234 ****
  
  <blockquote>
  <p>
! Pablo: add a note to the last bullet of paragraph 11 of 23.1.1 clarifying that the end() iterator doesn't refer to an element and that it can therefore be invalidated.
  </p>
  <p>
  Proposed wording:
  </p>
! <blockquote>
  [<i>Note:</i> The <tt>end()</tt> iterator does not refer to any element and can
  therefore be invalidated. <i>-- end note</i>]
! </blockquote>
  <p>
  Howard will add this proposed wording to the issue and then move it to Review.
  </p>
--- 39616,39631 ----
  
  <blockquote>
  <p>
! Pablo: add a note to the last bullet of paragraph 11 of 23.1.1 clarifying that 
! the <tt>end()</tt> iterator doesn't refer to an element and that it can therefore be invalidated.
  </p>
  <p>
  Proposed wording:
  </p>
! <blockquote><p>
  [<i>Note:</i> The <tt>end()</tt> iterator does not refer to any element and can
  therefore be invalidated. <i>-- end note</i>]
! </p></blockquote>
  <p>
  Howard will add this proposed wording to the issue and then move it to Review.
  </p>
*************** additional requirements:
*** 39277,39284 ****
  <li>
  no <tt>swap()</tt> function invalidates any references, pointers, or
  iterators referring to the elements of the containers being swapped.
! <ins>[<i>Note:</i> The <tt>end()</tt> iterator does not refer to any element. It is therefore
! subject to being invalidated. <i>-- end note</i>]</ins>
  </li>
  </ul>
  </blockquote>
--- 39674,39681 ----
  <li>
  no <tt>swap()</tt> function invalidates any references, pointers, or
  iterators referring to the elements of the containers being swapped.
! <ins>[<i>Note:</i> The <tt>end()</tt> iterator does not refer to any element. 
! It is therefore subject to being invalidated. &mdash; <i>end note</i>]</ins>
  </li>
  </ul>
  </blockquote>
*************** subject to being invalidated. <i>-- end
*** 39289,39298 ****
  
  <hr>
  <h3><a name="766"></a>766. Inconsistent exception guarantees between ordered and unordered associative containers</h3>
! <p><b>Section:</b> 23.2 [container.requirements], 23.2.5.1 [unord.req.except] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ion Gaztañaga <b>Opened:</b> 2007-12-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  23.2 [container.requirements]p10 states:
--- 39686,39696 ----
  
  <hr>
  <h3><a name="766"></a>766. Inconsistent exception guarantees between ordered and unordered associative containers</h3>
! <p><b>Section:</b> 23.2 [container.requirements], 23.2.5.1 [unord.req.except] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Ion Gazta&ntilde;aga <b>Opened:</b> 2007-12-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  23.2 [container.requirements]p10 states:
*************** additional requirements:
*** 39313,39336 ****
  </blockquote>
  
  <p>
! 23.3.2.3 [deque.modifiers] and 23.4.1.4 [vector.modifiers] offer
  additional guarantees for <tt>deque</tt>/<tt>vector insert()</tt> and
! <tt>erase()</tt> members. However, 23.2 [container.requirements]p10 does not mention 23.2.5.1 [unord.req.except] that specifies exception safety guarantees
! for unordered containers. In addition,  23.2.5.1 [unord.req.except]p1 offers the following guaratee for
  <tt>erase()</tt>:
  </p>
  
! <blockquote>
  No <tt>erase()</tt> function throws an exception unless that exception
  is thrown by the container's Hash or Pred object (if any).
! </blockquote>
  
  <p>
  Summary:
  </p>
  
  <p>
! According to 23.2 [container.requirements]p10 no
  <tt>erase()</tt> function should throw an exception unless otherwise
  specified. Although does not explicitly mention 23.2.5.1 [unord.req.except], this section offers additional guarantees
  for unordered containers, allowing <tt>erase()</tt> to throw if
--- 39711,39736 ----
  </blockquote>
  
  <p>
! 23.3.3.4 [deque.modifiers] and 23.3.6.5 [vector.modifiers] offer
  additional guarantees for <tt>deque</tt>/<tt>vector insert()</tt> and
! <tt>erase()</tt> members. However, 23.2 [container.requirements] p10 
! does not mention 23.2.5.1 [unord.req.except] that specifies exception 
! safety guarantees for unordered containers. In addition,  
! 23.2.5.1 [unord.req.except] p1 offers the following guaratee for
  <tt>erase()</tt>:
  </p>
  
! <blockquote><p>
  No <tt>erase()</tt> function throws an exception unless that exception
  is thrown by the container's Hash or Pred object (if any).
! </p></blockquote>
  
  <p>
  Summary:
  </p>
  
  <p>
! According to 23.2 [container.requirements] p10 no
  <tt>erase()</tt> function should throw an exception unless otherwise
  specified. Although does not explicitly mention 23.2.5.1 [unord.req.except], this section offers additional guarantees
  for unordered containers, allowing <tt>erase()</tt> to throw if
*************** exception or swallow it, leaving the obj
*** 39376,39383 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Create a new sub-section of 23.2.4 [associative.reqmts] (perhaps [associative.req.except]) titled "Exception
! safety guarantees".
  </p>
  
  <blockquote>
--- 39776,39783 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Create a new sub-section of 23.2.4 [associative.reqmts] (perhaps 
! [associative.req.except]) titled "Exception safety guarantees".
  </p>
  
  <blockquote>
*************** assignment operator of the container's P
*** 39404,39430 ****
  Change 23.2.5.1 [unord.req.except]p1:
  </p>
  
! <blockquote>
  For unordered associative containers, no <tt>clear()</tt> function
  throws an exception. <del>No</del> <tt>erase(<ins>k</ins>)</tt>
  <del>function</del> <ins>does not</ins> throw<del>s</del> an exception
  unless that exception is thrown by the container's Hash or Pred object
  (if any).
! </blockquote>
  
  <p>
! Change 23.2 [container.requirements]p10 to add references to new sections:
  </p>
  
! <blockquote>
  Unless otherwise specified (see [deque.modifiers]<ins>,</ins>
  <del>and</del> [vector.modifiers]<ins>, [associative.req.except],
  [unord.req.except]</ins>) all container types defined in this clause meet
  the following additional requirements:
! </blockquote>
  
  <p>
! Change 23.2 [container.requirements]p10 referring to <tt>swap</tt>:
  </p>
  
  <blockquote>
--- 39804,39830 ----
  Change 23.2.5.1 [unord.req.except]p1:
  </p>
  
! <blockquote><p>
  For unordered associative containers, no <tt>clear()</tt> function
  throws an exception. <del>No</del> <tt>erase(<ins>k</ins>)</tt>
  <del>function</del> <ins>does not</ins> throw<del>s</del> an exception
  unless that exception is thrown by the container's Hash or Pred object
  (if any).
! </p></blockquote>
  
  <p>
! Change 23.2 [container.requirements] p10 to add references to new sections:
  </p>
  
! <blockquote><p>
  Unless otherwise specified (see [deque.modifiers]<ins>,</ins>
  <del>and</del> [vector.modifiers]<ins>, [associative.req.except],
  [unord.req.except]</ins>) all container types defined in this clause meet
  the following additional requirements:
! </p></blockquote>
  
  <p>
! Change 23.2 [container.requirements] p10 referring to <tt>swap</tt>:
  </p>
  
  <blockquote>
*************** Compare object (if any; see [associative
*** 39443,39453 ****
  
  
  <hr>
  <h3><a name="768"></a>768. Typos in [atomics]?</h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2007-12-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  in the latest publicly available draft, paper
--- 39843,40124 ----
  
  
  <hr>
+ <h3><a name="767"></a>767. Forwarding and backward compatibility</h3>
+ <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Sylvain Pion <b>Opened:</b> 2007-12-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#containers">active issues</a> in [containers].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#containers">issues</a> in [containers].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Playing with g++'s C++0X mode, I noticed that the following code, which used to compile:
+ </p>
+ 
+ <blockquote><pre>
+ #include &lt;vector&gt;
+ 
+ int main()
+ {
+     std::vector&lt;char *&gt; v;
+     v.push_back(0);
+ }
+ </pre></blockquote>
+ 
+ <p>
+ now fails with the following error message:
+ </p>
+ 
+ <blockquote><p>
+ .../include/c++/4.3.0/ext/new_allocator.h: In member function 'void __gnu_cxx::new_allocator&lt;_Tp&gt;::construct(_Tp*, _Args&amp;&amp; ...) [with _Args = int, _Tp = char*]':
+ .../include/c++/4.3.0/bits/stl_vector.h:707:   instantiated from 'void std::vector&lt;_Tp, _Alloc&gt;::push_back(_Args&amp;&amp; ...) [with _Args = int, _Tp = char*, _Alloc = std::allocator&lt;char*&gt;]'
+ test.cpp:6:   instantiated from here
+ .../include/c++/4.3.0/ext/new_allocator.h:114: error: invalid conversion from 'int' to 'char*'
+ </p></blockquote>
+ 
+ <p>
+ As far as I know, g++ follows the current draft here.
+ </p>
+ <p>
+ Does the committee really intend to break compatibility for such cases?
+ </p>
+ 
+ <p><i>[
+ Sylvain adds: 
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ I just noticed that <tt>std::pair</tt> has the same issue.
+ The following now fails with GCC's -std=c++0x mode:
+ </p>
+ 
+ <blockquote><pre>
+ #include &lt;utility&gt;
+ 
+ int main()
+ {
+    std::pair&lt;char *, char *&gt; p (0,0);
+ }
+ </pre></blockquote>
+ 
+ <p>
+ I have not made any general audit for such problems elsewhere.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ Related to <a href="lwg-defects.html#756">756</a>
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ Bellevue:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Motivation is to handle the old-style int-zero-valued <tt>NULL</tt> pointers.
+ Problem: this solution requires concepts in some cases, which some users
+ will be slow to adopt. Some discussion of alternatives involving
+ prohibiting variadic forms and additional library-implementation
+ complexity.
+ </p>
+ <p>
+ Discussion of "perfect world" solutions, the only such solution put
+ forward being to retroactively prohibit use of the integer zero for a
+ <tt>NULL</tt> pointer. This approach was deemed unacceptable given the large
+ bodies of pre-existing code that do use integer zero for a <tt>NULL</tt> pointer.
+ </p>
+ <p>
+ Another approach is to change the member names. Yet another approach is
+ to forbid the extension in absence of concepts.
+ </p>
+ <p>
+ Resolution: These issues (<a href="lwg-defects.html#756">756</a>, <a href="lwg-defects.html#767">767</a>, <a href="lwg-active.html#760">760</a>, 
+ <a href="lwg-closed.html#763">763</a>) will be subsumed into a paper to be produced by Alan Talbot 
+ in time for review at the 2008 meeting in France. Once this paper is produced, 
+ these issues will be moved to <del>NAD</del><ins>Resolved</ins>.
+ </p>
+ </blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add the following rows to Table 90 "Optional sequence container operations", 23.2.3 [sequence.reqmts]:
+ </p>
+ 
+ <blockquote>
+ <table border="1">
+ <tr>
+ <th>expression</th> <th>return type</th> <th>assertion/note<br/>pre-/post-condition</th> <th>container</th>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a.push_front(t)</tt>
+ </td>
+ <td>
+ <tt>void</tt>
+ </td>
+ <td>
+ <tt>a.insert(a.begin(), t)</tt><br/>
+ <i>Requires:</i> <tt>T</tt> shall be <tt>CopyConstructible</tt>.
+ </td>
+ <td>
+ <tt>list, deque</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a.push_front(rv)</tt>
+ </td>
+ <td>
+ <tt>void</tt>
+ </td>
+ <td>
+ <tt>a.insert(a.begin(), rv)</tt><br/>
+ <i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt>.
+ </td>
+ <td>
+ <tt>list, deque</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a.push_back(t)</tt>
+ </td>
+ <td>
+ <tt>void</tt>
+ </td>
+ <td>
+ <tt>a.insert(a.end(), t)</tt><br/>
+ <i>Requires:</i> <tt>T</tt> shall be <tt>CopyConstructible</tt>.
+ </td>
+ <td>
+ <tt>list, deque, vector, basic_string</tt>
+ </td>
+ </tr>
+ 
+ <tr>
+ <td>
+ <tt>a.push_back(rv)</tt>
+ </td>
+ <td>
+ <tt>void</tt>
+ </td>
+ <td>
+ <tt>a.insert(a.end(), rv)</tt><br/>
+ <i>Requires:</i> <tt>T</tt> shall be <tt>MoveConstructible</tt>.
+ </td>
+ <td>
+ <tt>list, deque, vector, basic_string</tt>
+ </td>
+ </tr>
+ 
+ </table>
+ </blockquote>
+ 
+ <p>
+ Change the synopsis in 23.3.3 [deque]:
+ </p>
+ 
+ <blockquote><pre>
+ <ins>void push_front(const T&amp; x);</ins>
+ <ins>void push_front(T&amp;&amp; x);</ins>
+ <ins>void push_back(const T&amp; x);</ins>
+ <ins>void push_back(T&amp;&amp; x);</ins>
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_front(Args&amp;&amp;... args);
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
+ </pre></blockquote>
+ 
+ <p>
+ Change 23.3.3.4 [deque.modifiers]:
+ </p>
+ 
+ <blockquote><pre>
+ <ins>void push_front(const T&amp; x);</ins>
+ <ins>void push_front(T&amp;&amp; x);</ins>
+ <ins>void push_back(const T&amp; x);</ins>
+ <ins>void push_back(T&amp;&amp; x);</ins>
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_front(Args&amp;&amp;... args);
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
+ </pre></blockquote>
+ 
+ <p>
+ Change the synopsis in 23.3.5 [list]:
+ </p>
+ 
+ <blockquote><pre>
+ <ins>void push_front(const T&amp; x);</ins>
+ <ins>void push_front(T&amp;&amp; x);</ins>
+ <ins>void push_back(const T&amp; x);</ins>
+ <ins>void push_back(T&amp;&amp; x);</ins>
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_front(Args&amp;&amp;... args);
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
+ </pre></blockquote>
+ 
+ <p>
+ Change 23.3.5.4 [list.modifiers]:
+ </p>
+ 
+ <blockquote><pre>
+ <ins>void push_front(const T&amp; x);</ins>
+ <ins>void push_front(T&amp;&amp; x);</ins>
+ <ins>void push_back(const T&amp; x);</ins>
+ <ins>void push_back(T&amp;&amp; x);</ins>
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_front(Args&amp;&amp;... args);
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
+ </pre></blockquote>
+ 
+ <p>
+ Change the synopsis in 23.3.6 [vector]:
+ </p>
+ 
+ <blockquote><pre>
+ <ins>void push_back(const T&amp; x);</ins>
+ <ins>void push_back(T&amp;&amp; x);</ins>
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
+ </pre></blockquote>
+ 
+ <p>
+ Change 23.3.6.5 [vector.modifiers]:
+ </p>
+ 
+ <blockquote><pre>
+ <ins>void push_back(const T&amp; x);</ins>
+ <ins>void push_back(T&amp;&amp; x);</ins>
+ template &lt;class... Args&gt; <ins>requires Constructible&lt;T, Args&amp;&amp;...&gt;</ins> void push_back(Args&amp;&amp;... args);
+ </pre></blockquote>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2680.pdf">N2680 Proposed Wording for Placement Insert (Revision 1)</a>.
+ </p>
+ 
+ <p>
+ If there is still an issue with pair, Howard should submit another issue.
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="768"></a>768. Typos in [atomics]?</h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2007-12-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.generic">active issues</a> in [atomics.types.generic].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  in the latest publicly available draft, paper
*************** in section 29.5 [atomics.types.generic],
*** 39456,39462 ****
  <tt>atomic&lt;&gt;</tt> is provided for pointers:
  </p>
  
! <blockquote><pre>template &lt;class T&gt; struct atomic&lt;T*&gt; : atomic_address { 
    T* fetch_add(ptrdiff_t, memory_order = memory_order_seq_cst) volatile; 
    T* fetch_sub(ptrdiff_t, memory_order = memory_order_seq_cst) volatile; 
  
--- 40127,40134 ----
  <tt>atomic&lt;&gt;</tt> is provided for pointers:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; struct atomic&lt;T*&gt; : atomic_address { 
    T* fetch_add(ptrdiff_t, memory_order = memory_order_seq_cst) volatile; 
    T* fetch_sub(ptrdiff_t, memory_order = memory_order_seq_cst) volatile; 
  
*************** methods from the base class <tt>atomic_a
*** 39487,39493 ****
  to the other methods, in particular these ones:
  </p>
  
! <blockquote><pre>void store(T*, memory_order = memory_order_seq_cst) volatile;
  T* load( memory_order = memory_order_seq_cst ) volatile;
  T* swap( T*, memory_order = memory_order_seq_cst ) volatile;
  bool compare_swap( T*&amp;, T*, memory_order, memory_order ) volatile;
--- 40159,40166 ----
  to the other methods, in particular these ones:
  </p>
  
! <blockquote><pre>
! void store(T*, memory_order = memory_order_seq_cst) volatile;
  T* load( memory_order = memory_order_seq_cst ) volatile;
  T* swap( T*, memory_order = memory_order_seq_cst ) volatile;
  bool compare_swap( T*&amp;, T*, memory_order, memory_order ) volatile;
*************** initialization.
*** 39539,39545 ****
  Change the synopsis in 29.5 [atomics.types.generic]:
  </p>
  
! <blockquote><pre>template &lt;class T&gt; struct atomic&lt;T*&gt; : atomic_address { 
    <ins>void store(T*, memory_order = memory_order_seq_cst) volatile;</ins>
    <ins>T* load( memory_order = memory_order_seq_cst ) volatile;</ins>
    <ins>T* swap( T*, memory_order = memory_order_seq_cst ) volatile;</ins>
--- 40212,40219 ----
  Change the synopsis in 29.5 [atomics.types.generic]:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; struct atomic&lt;T*&gt; : atomic_address { 
    <ins>void store(T*, memory_order = memory_order_seq_cst) volatile;</ins>
    <ins>T* load( memory_order = memory_order_seq_cst ) volatile;</ins>
    <ins>T* swap( T*, memory_order = memory_order_seq_cst ) volatile;</ins>
*************** Change the synopsis in 29.5 [atomics.typ
*** 39571,39583 ****
  
  <hr>
  <h3><a name="769"></a>769. std::function should use nullptr_t instead of "unspecified-null-pointer-type"</h3>
! <p><b>Section:</b> 20.8.14.2 [func.wrap.func] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! N2461 already replaced in 20.8.14.2 [func.wrap.func] it's originally proposed
  (implicit) conversion operator to "unspecified-bool-type" by the new
  explicit bool conversion, but the inverse conversion should also
  use the new <tt>std::nullptr_t</tt> type instead of "unspecified-null-pointer-
--- 40245,40258 ----
  
  <hr>
  <h3><a name="769"></a>769. std::function should use nullptr_t instead of "unspecified-null-pointer-type"</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! N2461 already replaced in 20.9.12.2 [func.wrap.func] it's originally proposed
  (implicit) conversion operator to "unspecified-bool-type" by the new
  explicit bool conversion, but the inverse conversion should also
  use the new <tt>std::nullptr_t</tt> type instead of "unspecified-null-pointer-
*************** type".
*** 39588,39597 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! In 20.8 [function.objects], header <tt>&lt;functional&gt;</tt> synopsis replace:
  </p>
  
! <blockquote><pre>template&lt;class R, class... ArgTypes&gt;
    bool operator==(const function&lt;R(ArgTypes...)&gt;&amp;, <del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  template&lt;class R, class... ArgTypes&gt;
    bool operator==(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins> , const function&lt;R(ArgTypes...)&gt;&amp;);
--- 40263,40273 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! In 20.9 [function.objects], header <tt>&lt;functional&gt;</tt> synopsis replace:
  </p>
  
! <blockquote><pre>
! template&lt;class R, class... ArgTypes&gt;
    bool operator==(const function&lt;R(ArgTypes...)&gt;&amp;, <del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  template&lt;class R, class... ArgTypes&gt;
    bool operator==(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins> , const function&lt;R(ArgTypes...)&gt;&amp;);
*************** template&lt;class R, class... ArgTypes&g
*** 39602,39620 ****
  </pre></blockquote>
  
  <p>
! In the class function synopsis of 20.8.14.2 [func.wrap.func] replace
  </p>
  
! <blockquote><pre>function(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  ...
  function&amp; operator=(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  </pre></blockquote>
  
  <p>
! In 20.8.14.2 [func.wrap.func], "Null pointer comparisons" replace:
  </p>
  
! <blockquote><pre>template &lt;class R, class... ArgTypes&gt;
    bool operator==(const function&lt;R(ArgTypes...)&gt;&amp;, <del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  template &lt;class R, class... ArgTypes&gt;
    bool operator==(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins> , const function&lt;R(ArgTypes...)&gt;&amp;);
--- 40278,40298 ----
  </pre></blockquote>
  
  <p>
! In the class function synopsis of 20.9.12.2 [func.wrap.func] replace
  </p>
  
! <blockquote><pre>
! function(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  ...
  function&amp; operator=(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  </pre></blockquote>
  
  <p>
! In 20.9.12.2 [func.wrap.func], "Null pointer comparisons" replace:
  </p>
  
! <blockquote><pre>
! template &lt;class R, class... ArgTypes&gt;
    bool operator==(const function&lt;R(ArgTypes...)&gt;&amp;, <del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  template &lt;class R, class... ArgTypes&gt;
    bool operator==(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins> , const function&lt;R(ArgTypes...)&gt;&amp;);
*************** template &lt;class R, class... ArgTypes&
*** 39625,39643 ****
  </pre></blockquote>
  
  <p>
! In 20.8.14.2.1 [func.wrap.func.con], replace
  </p>
  
! <blockquote><pre>function(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  ...
  function&amp; operator=(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  </pre></blockquote>
  
  <p>
! In 20.8.14.2.6 [func.wrap.func.nullptr], replace
  </p>
  
! <blockquote><pre>template &lt;class R, class... ArgTypes&gt;
    bool operator==(const function&lt;R(ArgTypes...)&gt;&amp; f, <del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  template &lt;class R, class... ArgTypes&gt;
    bool operator==(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins> , const function&lt;R(ArgTypes...)&gt;&amp; f);
--- 40303,40323 ----
  </pre></blockquote>
  
  <p>
! In 20.9.12.2.1 [func.wrap.func.con], replace
  </p>
  
! <blockquote><pre>
! function(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  ...
  function&amp; operator=(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  </pre></blockquote>
  
  <p>
! In 20.9.12.2.6 [func.wrap.func.nullptr], replace
  </p>
  
! <blockquote><pre>
! template &lt;class R, class... ArgTypes&gt;
    bool operator==(const function&lt;R(ArgTypes...)&gt;&amp; f, <del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  template &lt;class R, class... ArgTypes&gt;
    bool operator==(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins> , const function&lt;R(ArgTypes...)&gt;&amp; f);
*************** template &lt;class R, class... ArgTypes&
*** 39647,39653 ****
  and replace
  </p>
  
! <blockquote><pre>template &lt;class R, class... ArgTypes&gt;
    bool operator!=(const function&lt;R(ArgTypes...)&gt;&amp; f, <del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  template &lt;class R, class... ArgTypes&gt;
    bool operator!=(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins> , const function&lt;R(ArgTypes...)&gt;&amp; f);
--- 40327,40334 ----
  and replace
  </p>
  
! <blockquote><pre>
! template &lt;class R, class... ArgTypes&gt;
    bool operator!=(const function&lt;R(ArgTypes...)&gt;&amp; f, <del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins>);
  template &lt;class R, class... ArgTypes&gt;
    bool operator!=(<del>unspecified-null-pointer-type</del> <ins>nullptr_t</ins> , const function&lt;R(ArgTypes...)&gt;&amp; f);
*************** template &lt;class R, class... ArgTypes&
*** 39660,39668 ****
  
  <hr>
  <h3><a name="770"></a>770. std::function should use rvalue swap</h3>
! <p><b>Section:</b> 20.8.14 [func.wrap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-01-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is expected that typical implementations of <tt>std::function</tt> will
--- 40341,40349 ----
  
  <hr>
  <h3><a name="770"></a>770. std::function should use rvalue swap</h3>
! <p><b>Section:</b> 20.9.12 [func.wrap] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-01-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is expected that typical implementations of <tt>std::function</tt> will
*************** this class to rvalue swappability.
*** 39674,39683 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.8 [function.objects], header <tt>&lt;functional&gt;</tt> synopsis, just below of
  </p>
  
! <blockquote><pre>template&lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
  <ins>template&lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
--- 40355,40365 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9 [function.objects], header <tt>&lt;functional&gt;</tt> synopsis, just below of
  </p>
  
! <blockquote><pre>
! template&lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
  <ins>template&lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
*************** template&lt;class R, class... ArgTypes&g
*** 39686,39702 ****
  </pre></blockquote>
  
  <p>
! In 20.8.14.2 [func.wrap.func] class <tt>function</tt> definition, change
  </p>
  
! <blockquote><pre>void swap(function&amp;<ins>&amp;</ins>);
  </pre></blockquote>
  
  <p>
! In 20.8.14.2 [func.wrap.func], just below of
  </p>
  
! <blockquote><pre>template &lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
  <ins>template &lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
--- 40368,40386 ----
  </pre></blockquote>
  
  <p>
! In 20.9.12.2 [func.wrap.func] class <tt>function</tt> definition, change
  </p>
  
! <blockquote><pre>
! void swap(function&amp;<ins>&amp;</ins>);
  </pre></blockquote>
  
  <p>
! In 20.9.12.2 [func.wrap.func], just below of
  </p>
  
! <blockquote><pre>
! template &lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
  <ins>template &lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp;, function&lt;R(ArgTypes...)&gt;&amp;);
*************** template &lt;class R, class... ArgTypes&
*** 39705,39721 ****
  </pre></blockquote>
  
  <p>
! In 20.8.14.2.2 [func.wrap.func.mod] change
  </p>
  
! <blockquote><pre>void swap(function&amp;<ins>&amp;</ins> other);
  </pre></blockquote>
  
  <p>
! In 20.8.14.2.7 [func.wrap.func.alg] add the two overloads
  </p>
  
! <blockquote><pre><ins>template&lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp; f1, function&lt;R(ArgTypes...)&gt;&amp; f2);
  template&lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp; f1, function&lt;R(ArgTypes...)&gt;&amp;&amp; f2);</ins>
--- 40389,40407 ----
  </pre></blockquote>
  
  <p>
! In 20.9.12.2.2 [func.wrap.func.mod] change
  </p>
  
! <blockquote><pre>
! void swap(function&amp;<ins>&amp;</ins> other);
  </pre></blockquote>
  
  <p>
! In 20.9.12.2.7 [func.wrap.func.alg] add the two overloads
  </p>
  
! <blockquote><pre>
! <ins>template&lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp;&amp; f1, function&lt;R(ArgTypes...)&gt;&amp; f2);
  template&lt;class R, class... ArgTypes&gt;
    void swap(function&lt;R(ArgTypes...)&gt;&amp; f1, function&lt;R(ArgTypes...)&gt;&amp;&amp; f2);</ins>
*************** template&lt;class R, class... ArgTypes&g
*** 39728,39746 ****
  
  <hr>
  <h3><a name="771"></a>771. Impossible throws clause in [string.conversions]</h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-01-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The new <tt>to_string</tt> and <tt>to_wstring</tt> functions described in 21.5 [string.conversions]
  have throws clauses (paragraphs 8 and 16) which say:
  </p>
  
! <blockquote>
  <i>Throws:</i> nothing
! </blockquote>
  
  <p>
  Since all overloads return either a <tt>std::string</tt> or a <tt>std::wstring</tt> by value
--- 40414,40432 ----
  
  <hr>
  <h3><a name="771"></a>771. Impossible throws clause in [string.conversions]</h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-01-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The new <tt>to_string</tt> and <tt>to_wstring</tt> functions described in 21.5 [string.conversions]
  have throws clauses (paragraphs 8 and 16) which say:
  </p>
  
! <blockquote><p>
  <i>Throws:</i> nothing
! </p></blockquote>
  
  <p>
  Since all overloads return either a <tt>std::string</tt> or a <tt>std::wstring</tt> by value
*************** constructors can fail due to out-of-memo
*** 39749,39757 ****
  clauses should be removed or should be more detailled like:
  </p>
  
! <blockquote>
  <i>Throws:</i> Nothing if the string construction throws nothing
! </blockquote>
  
  <p>
  Further there is an editorial issue in p. 14: All three <tt>to_wstring</tt>
--- 40435,40443 ----
  clauses should be removed or should be more detailled like:
  </p>
  
! <blockquote><p>
  <i>Throws:</i> Nothing if the string construction throws nothing
! </p></blockquote>
  
  <p>
  Further there is an editorial issue in p. 14: All three <tt>to_wstring</tt>
*************** In 21.5 [string.conversions], remove the
*** 39768,39790 ****
  </p>
  
  <blockquote>
! <pre>string to_string(long long val); 
  string to_string(unsigned long long val); 
  string to_string(long double val); 
  </pre>
! <blockquote>
  <del><i>Throws:</i> nothing</del>
! </blockquote>
  </blockquote>
  
  <blockquote>
! <pre><ins>w</ins>string to_wstring(long long val); 
  <ins>w</ins>string to_wstring(unsigned long long val); 
  <ins>w</ins>string to_wstring(long double val); 
  </pre>
! <blockquote>
  <del><i>Throws:</i> nothing</del>
! </blockquote>
  </blockquote>
  
  
--- 40454,40478 ----
  </p>
  
  <blockquote>
! <pre>
! string to_string(long long val); 
  string to_string(unsigned long long val); 
  string to_string(long double val); 
  </pre>
! <blockquote><p>
  <del><i>Throws:</i> nothing</del>
! </p></blockquote>
  </blockquote>
  
  <blockquote>
! <pre>
! <ins>w</ins>string to_wstring(long long val); 
  <ins>w</ins>string to_wstring(unsigned long long val); 
  <ins>w</ins>string to_wstring(long double val); 
  </pre>
! <blockquote><p>
  <del><i>Throws:</i> nothing</del>
! </p></blockquote>
  </blockquote>
  
  
*************** string to_string(long double val);
*** 39793,39825 ****
  
  
  <hr>
! <h3><a name="772"></a>772.  Impossible return clause in [string.conversions]</h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-01-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The return clause 21.5 [string.conversions]/paragraph 15 of the new <tt>to_wstring</tt>
  overloads says:
  </p>
  
! <blockquote>
  <i>Returns:</i> each function returns a <tt>wstring</tt> object holding the character
  representation of the value of its argument that would be generated by
  calling <tt>wsprintf(buf, fmt, val)</tt> with a format specifier of <tt>L"%lld"</tt>, <tt>L"%ulld"</tt>,
  or <tt>L"%f"</tt>, respectively.
! </blockquote>
  
  <p>
  Problem is: There does not exist any <tt>wsprintf</tt> function in C99 (I checked
  the 2nd edition of ISO 9899, and the first and the second corrigenda from
  2001-09-01 and 2004-11-15). What probably meant here is the function
! <tt>swprintf</tt> from <tt>&lt;wchar.h&gt;/&lt;cwchar&gt;</tt>, but this has the non-equivalent
  declaration:
  </p>
  
! <blockquote><pre>int swprintf(wchar_t * restrict s, size_t n,
  const wchar_t * restrict format, ...);
  </pre></blockquote>
  
--- 40481,40514 ----
  
  
  <hr>
! <h3><a name="772"></a>772. Impossible return clause in [string.conversions]</h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-01-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The return clause 21.5 [string.conversions] paragraph 15 of the new <tt>to_wstring</tt>
  overloads says:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> each function returns a <tt>wstring</tt> object holding the character
  representation of the value of its argument that would be generated by
  calling <tt>wsprintf(buf, fmt, val)</tt> with a format specifier of <tt>L"%lld"</tt>, <tt>L"%ulld"</tt>,
  or <tt>L"%f"</tt>, respectively.
! </p></blockquote>
  
  <p>
  Problem is: There does not exist any <tt>wsprintf</tt> function in C99 (I checked
  the 2nd edition of ISO 9899, and the first and the second corrigenda from
  2001-09-01 and 2004-11-15). What probably meant here is the function
! <tt>swprintf</tt> from <tt>&lt;wchar.h&gt;&#47;&lt;cwchar&gt;</tt>, but this has the non-equivalent
  declaration:
  </p>
  
! <blockquote><pre>
! int swprintf(wchar_t * restrict s, size_t n,
  const wchar_t * restrict format, ...);
  </pre></blockquote>
  
*************** therefore the paragraph needs to mention
*** 39831,39840 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the current wording of 21.5 [string.conversions]/p. 15 to:
  </p>
  
! <blockquote>
  <i>Returns:</i> <del>e</del><ins>E</ins>ach function returns a
  <tt>wstring</tt> object holding the character representation of the
  value of its argument that would be generated by calling
--- 40520,40529 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the current wording of 21.5 [string.conversions] p. 15 to:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> <del>e</del><ins>E</ins>ach function returns a
  <tt>wstring</tt> object holding the character representation of the
  value of its argument that would be generated by calling
*************** value of its argument that would be gene
*** 39842,39848 ****
  val)</tt> with a format specifier <ins><tt>fmt</tt></ins> of <tt>L"%lld"</tt>,
  <tt>L"%ulld"</tt>, or <tt>L"%f"</tt>, respectively<ins>, where <tt>buf</tt>
  designates an internal character buffer of sufficient size <tt>bufsz</tt></ins>.
! </blockquote>
  
  <p>
  [Hint to the editor: The resolution also adds to mention the name of
--- 40531,40537 ----
  val)</tt> with a format specifier <ins><tt>fmt</tt></ins> of <tt>L"%lld"</tt>,
  <tt>L"%ulld"</tt>, or <tt>L"%f"</tt>, respectively<ins>, where <tt>buf</tt>
  designates an internal character buffer of sufficient size <tt>bufsz</tt></ins>.
! </p></blockquote>
  
  <p>
  [Hint to the editor: The resolution also adds to mention the name of
*************** paragraph 7 should also mention the mean
*** 39855,39870 ****
  </p>
  
  <p>
! Change the current wording of 21.5 [string.conversions]/p. 7 to:
  </p>
  
! <blockquote>
  <i>Returns:</i> <del>e</del><ins>E</ins>ach function returns a string object holding the
  character representation of the value of its argument that would be
  generated by calling <tt>sprintf(buf, fmt, val)</tt> with a format specifier <ins><tt>fmt</tt></ins> of
  <tt>"%lld"</tt>, <tt>"%ulld"</tt>, or <tt>"%f"</tt>, respectively<ins>, where <tt>buf</tt> designates an internal
  character buffer of sufficient size</ins>.
! </blockquote>
  
  
  
--- 40544,40559 ----
  </p>
  
  <p>
! Change the current wording of 21.5 [string.conversions] p. 7 to:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> <del>e</del><ins>E</ins>ach function returns a string object holding the
  character representation of the value of its argument that would be
  generated by calling <tt>sprintf(buf, fmt, val)</tt> with a format specifier <ins><tt>fmt</tt></ins> of
  <tt>"%lld"</tt>, <tt>"%ulld"</tt>, or <tt>"%f"</tt>, respectively<ins>, where <tt>buf</tt> designates an internal
  character buffer of sufficient size</ins>.
! </p></blockquote>
  
  
  
*************** character buffer of sufficient size</ins
*** 39872,39882 ****
  
  
  <hr>
! <h3><a name="774"></a>774. Member swap undefined for most containers</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-01-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It appears most containers declare but do not define a member-swap
--- 40561,40572 ----
  
  
  <hr>
! <h3><a name="774"></a>774. Member <tt>swap</tt> undefined for most containers</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-01-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#containers">active issues</a> in [containers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It appears most containers declare but do not define a member-swap
*************** A quick survey of clause 23 shows that t
*** 39901,39907 ****
  definition for member-swap:
  </p>
  
! <blockquote><pre>array
  queue
  stack
  vector
--- 40591,40598 ----
  definition for member-swap:
  </p>
  
! <blockquote><pre>
! array
  queue
  stack
  vector
*************** vector
*** 39911,39917 ****
  Whereas the following declare it, but do not define the semantics:
  </p>
  
! <blockquote><pre>deque
  list
  map
  multimap
--- 40602,40609 ----
  Whereas the following declare it, but do not define the semantics:
  </p>
  
! <blockquote><pre>
! deque
  list
  map
  multimap
*************** unordered_set
*** 39927,39955 ****
  <p>
  Suggested resolution:
  </p>
! <blockquote>
  Provide a definition for each of the affected containers...
! </blockquote>
  
  <p><i>[
  Bellevue:
  ]</i></p>
  
  
! <blockquote>
  Move to Open and ask Alisdair to provide wording.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Daniel to provide wording.
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2590.pdf">N2590</a>
  is no longer applicable.
! </blockquote>
  
  <p><i>[
  2009-07-28 Daniel provided wording.
--- 40619,40647 ----
  <p>
  Suggested resolution:
  </p>
! <blockquote><p>
  Provide a definition for each of the affected containers...
! </p></blockquote>
  
  <p><i>[
  Bellevue:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Open and ask Alisdair to provide wording.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Daniel to provide wording.
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2590.pdf">N2590</a>
  is no longer applicable.
! </p></blockquote>
  
  <p><i>[
  2009-07-28 Daniel provided wording.
*************** is no longer applicable.
*** 39959,39965 ****
  <blockquote>
  <ol>
  <li>
! It assumes that the proposed resolution for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a> is applied,
  which breaks the circularity of definition between member
  <tt>swap</tt> and free <tt>swap</tt>.
  </li>
--- 40651,40657 ----
  <blockquote>
  <ol>
  <li>
! It assumes that the proposed resolution for <a href="lwg-defects.html#883">883</a> is applied,
  which breaks the circularity of definition between member
  <tt>swap</tt> and free <tt>swap</tt>.
  </li>
*************** next refactoring phase of generalized al
*** 39973,39979 ****
  <li>
  It requires that compare objects, key equal functions and
  hash functions in containers are swapped via unqualified free
! <tt>swap</tt> according to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#594">594</a>.
  </li>
  </ol>
  </blockquote>
--- 40665,40671 ----
  <li>
  It requires that compare objects, key equal functions and
  hash functions in containers are swapped via unqualified free
! <tt>swap</tt> according to <a href="lwg-defects.html#594">594</a>.
  </li>
  </ol>
  </blockquote>
*************** hash functions in containers are swapped
*** 39983,40014 ****
  ]</i></p>
  
  
! <blockquote>
! The outcome of this issue should be considered with the outcome of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1198">1198</a> both in style and in content (e.g. bullet 9 suggests to
! define the semantic of <tt>void
! priority_queue::swap(priority_queue&amp;)</tt> in terms of the member
! <tt>swap</tt> of the container).
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Looked at, but took no action on as it overlaps too much with
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
  Waiting for a new draft WP.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Leave as open. Pablo to provide wording.
! </blockquote>
  
  <p><i>[
  2009-10-26 Pablo updated wording.  Here is the wording he replaced:
--- 40675,40706 ----
  ]</i></p>
  
  
! <blockquote><p>
! The outcome of this issue should be considered with the outcome of 
! <a href="lwg-defects.html#1198">1198</a> both in style and in content (e.g. bullet 9 suggests to
! define the semantic of <tt>void priority_queue::swap(priority_queue&amp;)</tt> 
! in terms of the member <tt>swap</tt> of the container).
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Looked at, but took no action on as it overlaps too much with
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
  Waiting for a new draft WP.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Leave as open. Pablo to provide wording.
! </p></blockquote>
  
  <p><i>[
  2009-10-26 Pablo updated wording.  Here is the wording he replaced:
*************** Leave as open. Pablo to provide wording.
*** 40022,40028 ****
  Add a new Throws clause just after X [allocator.propagation.map]/5:
  </p>
  
! <blockquote><pre>static void swap(Alloc&amp; a, Alloc&amp; b);
  </pre>
  <blockquote>
  <p>
--- 40714,40721 ----
  Add a new Throws clause just after X [allocator.propagation.map]/5:
  </p>
  
! <blockquote><pre>
! static void swap(Alloc&amp; a, Alloc&amp; b);
  </pre>
  <blockquote>
  <p>
*************** swap does never propagate an exception
*** 40052,40063 ****
  Change 23.2.4.1 [associative.reqmts.except]/3 as indicated:
  </p>
  
! <blockquote>
  For associative containers, no <tt>swap</tt> function throws an exception unless that
  exception is thrown by the <del>copy constructor or copy assignment
  operator</del>
  <ins><tt>swap</tt></ins> of the container's <tt>Pred</tt> object<ins>s</ins><del> (if any)</del>.
! </blockquote>
  </li>
  
  <li>
--- 40745,40756 ----
  Change 23.2.4.1 [associative.reqmts.except]/3 as indicated:
  </p>
  
! <blockquote><p>
  For associative containers, no <tt>swap</tt> function throws an exception unless that
  exception is thrown by the <del>copy constructor or copy assignment
  operator</del>
  <ins><tt>swap</tt></ins> of the container's <tt>Pred</tt> object<ins>s</ins><del> (if any)</del>.
! </p></blockquote>
  </li>
  
  <li>
*************** operator</del>
*** 40065,40078 ****
  Change 23.2.5.1 [unord.req.except]/3 as indicated:
  </p>
  
! <blockquote>
  For unordered associative containers, no <tt>swap</tt> function throws an
  exception unless
  that exception is thrown by the <del>copy constructor or copy
  assignment operator</del>
  <ins><tt>swap</tt></ins> of the container's <tt>Hash</tt> or <tt>Pred</tt> object<ins>s,
  respectively</ins><del> (if any)</del>.
! </blockquote>
  </li>
  
  <li>
--- 40758,40771 ----
  Change 23.2.5.1 [unord.req.except]/3 as indicated:
  </p>
  
! <blockquote><p>
  For unordered associative containers, no <tt>swap</tt> function throws an
  exception unless
  that exception is thrown by the <del>copy constructor or copy
  assignment operator</del>
  <ins><tt>swap</tt></ins> of the container's <tt>Hash</tt> or <tt>Pred</tt> object<ins>s,
  respectively</ins><del> (if any)</del>.
! </p></blockquote>
  </li>
  
  <li>
*************** respectively</ins><del> (if any)</del>.
*** 40080,40090 ****
  Insert a new paragraph just after 23.3 [sequences]/1:
  </p>
  
! <blockquote>
  <ins>In addition to being available via inclusion of the <tt>&lt;algorithm&gt;</tt> header,
  the <tt>swap</tt> function templates in 25.3.3 [alg.swap] are also available when the
  header <tt>&lt;queue&gt;</tt> is included.</ins>
! </blockquote>
  
  <p><i>[
  There is a new issue in process that will suggest a minimum header for <tt>swap</tt>
--- 40773,40783 ----
  Insert a new paragraph just after 23.3 [sequences]/1:
  </p>
  
! <blockquote><p>
  <ins>In addition to being available via inclusion of the <tt>&lt;algorithm&gt;</tt> header,
  the <tt>swap</tt> function templates in 25.3.3 [alg.swap] are also available when the
  header <tt>&lt;queue&gt;</tt> is included.</ins>
! </p></blockquote>
  
  <p><i>[
  There is a new issue in process that will suggest a minimum header for <tt>swap</tt>
*************** dependency should be added to <tt>&lt;qu
*** 40097,40131 ****
  
  <li>
  <p>
! Add one further clause at the end of 23.3.1.2 [array.special]:
  </p>
  <p><i>[This part is added, because otherwise <tt>array::swap</tt> would otherwise
  contradict the
  general contract of 23.2.1 [container.requirements.general] p. 10 b. 5]</i></p>
  
  
! <blockquote>
  <ins><i>Throws:</i> Nothing, unless one of the element-wise <tt>swap</tt> calls throws
  an exception.</ins>
! </blockquote>
  </li>
  
  <li>
! <ol type="a">
  <li>
  <p>
! In 23.3.2 [deque], class template deque synopsis change as indicated:
  </p>
! <blockquote><pre>void swap(deque<del>&lt;T,Alloc&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.3.2.3 [deque.modifiers] add as indicated:
  </p>
  
! <blockquote><pre><ins>void swap(deque&amp; x);</ins>
  </pre>
  <blockquote>
  <p>
--- 40790,40826 ----
  
  <li>
  <p>
! Add one further clause at the end of 23.3.2.3 [array.special]:
  </p>
  <p><i>[This part is added, because otherwise <tt>array::swap</tt> would otherwise
  contradict the
  general contract of 23.2.1 [container.requirements.general] p. 10 b. 5]</i></p>
  
  
! <blockquote><p>
  <ins><i>Throws:</i> Nothing, unless one of the element-wise <tt>swap</tt> calls throws
  an exception.</ins>
! </p></blockquote>
  </li>
  
  <li>
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! In 23.3.3 [deque], class template <tt>deque</tt> synopsis change as indicated:
  </p>
! <blockquote><pre>
! void swap(deque<del>&lt;T,Alloc&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.3.3.4 [deque.modifiers] add as indicated:
  </p>
  
! <blockquote><pre>
! <ins>void swap(deque&amp; x);</ins>
  </pre>
  <blockquote>
  <p>
*************** with that of <tt>x</tt>.</ins>
*** 40142,40163 ****
  </li>
  
  <li>
! <ol type="a">
  <li>
  <p>
! In 23.3.3 [forwardlist], class template <tt>forward_list</tt> synposis change as indicated:
  </p>
  
! <blockquote><pre>void swap(forward_list<del>&lt;T,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.3.3.4 [forwardlist.modifiers] add as indicated:
  </p>
  
! <blockquote><pre><ins>void swap(forward_list&amp; x);</ins>
  </pre>
  <blockquote>
  <p>
--- 40837,40860 ----
  </li>
  
  <li>
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! In 23.3.4 [forwardlist], class template <tt>forward_list</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>
! void swap(forward_list<del>&lt;T,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.3.4.5 [forwardlist.modifiers] add as indicated:
  </p>
  
! <blockquote><pre>
! <ins>void swap(forward_list&amp; x);</ins>
  </pre>
  <blockquote>
  <p>
*************** with that of <tt>x</tt>.</ins>
*** 40174,40195 ****
  </li>
  
  <li>
! <ol type="a">
  <li>
  <p>
! In 23.3.4 [list], class template <tt>list</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>void swap(list<del>&lt;T,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.3.4.3 [list.modifiers] add as indicated:
  </p>
  
! <blockquote><pre><ins>void swap(list&amp; x);</ins>
  </pre>
  
  <blockquote>
--- 40871,40894 ----
  </li>
  
  <li>
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! In 23.3.5 [list], class template <tt>list</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>
! void swap(list<del>&lt;T,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.3.5.4 [list.modifiers] add as indicated:
  </p>
  
! <blockquote><pre>
! <ins>void swap(list&amp; x);</ins>
  </pre>
  
  <blockquote>
*************** with that of <tt>x</tt>.</ins>
*** 40209,40218 ****
  
  <li>
  <p>
! At the end of 23.5.2.3 [priqueue.members] add a new prototype description:
  </p>
  
! <blockquote><pre><ins>void swap(priority_queue&amp; q);</ins>
  </pre>
  <blockquote>
  <p>
--- 40908,40918 ----
  
  <li>
  <p>
! At the end of 23.6.4.3 [priqueue.members] add a new prototype description:
  </p>
  
! <blockquote><pre>
! <ins>void swap(priority_queue&amp; q);</ins>
  </pre>
  <blockquote>
  <p>
*************** At the end of 23.5.2.3 [priqueue.members
*** 40222,40229 ****
  
  <p><i>[
  This requirement is added to ensure that even a user defined <tt>swap</tt>
! which is found by
! ADL for <tt>Compare</tt> satisfies the <tt>Swappable</tt> requirements
  ]</i></p>
  
  
--- 40922,40928 ----
  
  <p><i>[
  This requirement is added to ensure that even a user defined <tt>swap</tt>
! which is found by ADL for <tt>Compare</tt> satisfies the <tt>Swappable</tt> requirements
  ]</i></p>
  
  
*************** contradict the general contract of 23.2.
*** 40243,40271 ****
  </li>
  
  <li>
! <ol type="a">
  <li>
  <p>
! In 23.4.1 [vector], class template <tt>vector</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>void swap(vector<del>&lt;T,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! Change 23.4.1.2 [vector.capacity]/8 as indicated:
  </p>
  
! <blockquote><pre>void swap(vector<del>&lt;T,Allocator&gt;</del>&amp; x);
  </pre>
  
! <blockquote>
  <i>Effects:</i> Exchanges the contents and <tt>capacity()</tt> <ins>and swaps the
! allocators</ins>
! of <tt>*this</tt> with that of <tt>x</tt>.
! </blockquote>
  </blockquote>
  </li>
  </ol>
--- 40942,40971 ----
  </li>
  
  <li>
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! In 23.3.6 [vector], class template <tt>vector</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>
! void swap(vector<del>&lt;T,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.6.3 [vector.capacity] p. 8 as indicated:
  </p>
  
! <blockquote><pre>
! void swap(vector<del>&lt;T,Allocator&gt;</del>&amp; x);
  </pre>
  
! <blockquote><p>
  <i>Effects:</i> Exchanges the contents and <tt>capacity()</tt> <ins>and swaps the
! allocators</ins> of <tt>*this</tt> with that of <tt>x</tt>.
! </p></blockquote>
  </blockquote>
  </li>
  </ol>
*************** of <tt>*this</tt> with that of <tt>x</tt
*** 40273,40305 ****
  
  <li>
  <p>
! Insert a new paragraph just before 23.6 [associative]/1:
  </p>
  
! <blockquote>
  <ins>In addition to being available via inclusion of the <tt>&lt;algorithm&gt;</tt> header,
  the <tt>swap</tt> function templates in 25.3.3 [alg.swap] are also available when any of the
  headers <tt>&lt;map&gt;</tt> or <tt>&lt;set&gt;</tt> are included.</ins>
! </blockquote>
  </li>
  
  <li>
! <ol type="a">
  <li>
  <p>
! In 23.6.1 [map], class template <tt>map</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>void swap(map<del>&lt;Key,T,Compare,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.6.1.3 [map.modifiers] add as indicated:
  </p>
  
! <blockquote><pre><ins>void swap(map&amp; x);</ins>
  </pre>
  
  <blockquote>
--- 40973,41007 ----
  
  <li>
  <p>
! Insert a new paragraph just before 23.4 [associative]/1:
  </p>
  
! <blockquote><p>
  <ins>In addition to being available via inclusion of the <tt>&lt;algorithm&gt;</tt> header,
  the <tt>swap</tt> function templates in 25.3.3 [alg.swap] are also available when any of the
  headers <tt>&lt;map&gt;</tt> or <tt>&lt;set&gt;</tt> are included.</ins>
! </p></blockquote>
  </li>
  
  <li>
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! In 23.4.4 [map], class template <tt>map</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>
! void swap(map<del>&lt;Key,T,Compare,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.4.4.4 [map.modifiers] add as indicated:
  </p>
  
! <blockquote><pre>
! <ins>void swap(map&amp; x);</ins>
  </pre>
  
  <blockquote>
*************** of <tt>*this</tt> and <tt>x</tt>.</ins>
*** 40331,40352 ****
  </li>
  
  <li>
! <ol type="a">
  <li>
  <p>
! In 23.6.2 [multimap], class template <tt>multimap</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>void swap(multimap<del>&lt;Key,T,Compare,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.6.2.2 [multimap.modifiers] add as indicated:
  </p>
  
! <blockquote><pre><ins>void swap(multimap&amp; x);</ins>
  </pre>
  
  <blockquote>
--- 41033,41056 ----
  </li>
  
  <li>
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! In 23.4.5 [multimap], class template <tt>multimap</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>
! void swap(multimap<del>&lt;Key,T,Compare,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! At the end of 23.4.5.3 [multimap.modifiers] add as indicated:
  </p>
  
! <blockquote><pre>
! <ins>void swap(multimap&amp; x);</ins>
  </pre>
  
  <blockquote>
*************** of <tt>*this</tt> and <tt>x</tt>.</ins>
*** 40369,40392 ****
  </li>
  
  <li>
! <ol type="a">
  <li>
  <p>
! In 23.6.3 [set], class template <tt>set</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>void swap(set<del>&lt;Key,Compare,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! After section 23.6.3.1 [set.cons] add a new section <ins><tt>set</tt> modifiers
   [set.modifiers]</ins>
  and add the following paragraphs:
  </p>
  
! <blockquote><pre><ins>void swap(set&amp; x);</ins>
  </pre>
  
  <blockquote>
--- 41073,41098 ----
  </li>
  
  <li>
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! In 23.4.6 [set], class template <tt>set</tt> synopsis change as indicated:
  </p>
  
! <blockquote><pre>
! void swap(set<del>&lt;Key,Compare,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! After section 23.4.6.2 [set.cons] add a new section <ins><tt>set</tt> modifiers
   [set.modifiers]</ins>
  and add the following paragraphs:
  </p>
  
! <blockquote><pre>
! <ins>void swap(set&amp; x);</ins>
  </pre>
  
  <blockquote>
*************** of <tt>*this</tt> and <tt>x</tt>.</ins>
*** 40411,40433 ****
  </li>
  
  <li>
! <ol type="a">
  <li>
  <p>
! In 23.6.4 [multiset], class template <tt>multiset</tt> synosis, change as indicated:
  </p>
  
! <blockquote><pre>void swap(multiset<del>&lt;Key,Compare,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! After section 23.6.4.1 [multiset.cons] add a new section <ins><tt>multiset</tt> modifiers
   [multiset.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre><ins>void swap(multiset&amp; x);</ins>
  </pre>
  
  <blockquote>
--- 41117,41141 ----
  </li>
  
  <li>
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! In 23.4.7 [multiset], class template <tt>multiset</tt> synosis, change as indicated:
  </p>
  
! <blockquote><pre>
! void swap(multiset<del>&lt;Key,Compare,Allocator&gt;</del>&amp;);
  </pre></blockquote>
  </li>
  
  <li>
  <p>
! After section 23.4.7.2 [multiset.cons] add a new section <ins><tt>multiset</tt> modifiers
   [multiset.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre>
! <ins>void swap(multiset&amp; x);</ins>
  </pre>
  
  <blockquote>
*************** of <tt>*this</tt> and <tt>x</tt>.</ins>
*** 40453,40476 ****
  
  <li>
  <p>
! Insert a new paragraph just before 23.7 [unord]/1:
  </p>
  
! <blockquote>
  <ins>In addition to being available via inclusion of the <tt>&lt;algorithm&gt;</tt> header,
  the <tt>swap</tt> function templates in 25.3.3 [alg.swap] are also available when any of the
  headers <tt>&lt;unordered_map&gt;</tt> or <tt>&lt;unordered_set&gt;</tt> are included.</ins>
! </blockquote>
  
  </li>
  
  <li>
  <p>
! After section 23.7.1.2 [unord.map.elem] add a new section <ins>unordered_map
! modifiers  [unord.map.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre><ins>void swap(unordered_map&amp; x);</ins>
  </pre>
  
  <blockquote>
--- 41161,41185 ----
  
  <li>
  <p>
! Insert a new paragraph just before 23.5 [unord] p. 1:
  </p>
  
! <blockquote><p>
  <ins>In addition to being available via inclusion of the <tt>&lt;algorithm&gt;</tt> header,
  the <tt>swap</tt> function templates in 25.3.3 [alg.swap] are also available when any of the
  headers <tt>&lt;unordered_map&gt;</tt> or <tt>&lt;unordered_set&gt;</tt> are included.</ins>
! </p></blockquote>
  
  </li>
  
  <li>
  <p>
! After section 23.5.4.3 [unord.map.elem] add a new section <ins>unordered_map
! modifiers 23.5.4.4 [unord.map.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre>
! <ins>void swap(unordered_map&amp; x);</ins>
  </pre>
  
  <blockquote>
*************** requirements
*** 40487,40494 ****
  
  
  <p>
! <ins><i>Effects:</i> Exchanges the contents and hash policy and swaps the
! allocators of <tt>*this</tt>
  with that of <tt>x</tt>, followed by an unqualified <tt>swap</tt> of the <tt>Pred</tt> objects
  and an unqualified <tt>swap</tt> of the <tt>Hash</tt> objects of <tt>*this</tt> and <tt>x</tt>.</ins>
  </p>
--- 41196,41202 ----
  
  
  <p>
! <ins><i>Effects:</i> Exchanges the contents and hash policy and swaps the allocators of <tt>*this</tt> 
  with that of <tt>x</tt>, followed by an unqualified <tt>swap</tt> of the <tt>Pred</tt> objects
  and an unqualified <tt>swap</tt> of the <tt>Hash</tt> objects of <tt>*this</tt> and <tt>x</tt>.</ins>
  </p>
*************** and an unqualified <tt>swap</tt> of the
*** 40502,40513 ****
  
  <li>
  <p>
! After section 23.7.2.1 [unord.multimap.cnstr] add a new section
  <ins>unordered_multimap
! modifiers  [unord.multimap.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre><ins>void swap(unordered_multimap&amp; x);</ins>
  </pre>
  
  <blockquote>
--- 41210,41222 ----
  
  <li>
  <p>
! After section 23.5.5.2 [unord.multimap.cnstr] add a new section
  <ins>unordered_multimap
! modifiers 23.5.5.3 [unord.multimap.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre>
! <ins>void swap(unordered_multimap&amp; x);</ins>
  </pre>
  
  <blockquote>
*************** and an unqualified <tt>swap</tt> of the
*** 40531,40542 ****
  
  <li>
  <p>
! After section 23.7.3.1 [unord.set.cnstr] add a new section
  <ins>unordered_set modifiers
   [unord.set.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre><ins>void swap(unordered_set&amp; x);</ins>
  </pre>
  
  <blockquote>
--- 41240,41252 ----
  
  <li>
  <p>
! After section 23.5.6.2 [unord.set.cnstr] add a new section
  <ins>unordered_set modifiers
   [unord.set.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre>
! <ins>void swap(unordered_set&amp; x);</ins>
  </pre>
  
  <blockquote>
*************** and an unqualified <tt>swap</tt> of the
*** 40561,40572 ****
  
  <li>
  <p>
! After section 23.7.4.1 [unord.multiset.cnstr] add a new section
  <ins>unordered_multiset
  modifiers  [unord.multiset.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre><ins>void swap(unordered_multiset&amp; x);</ins>
  </pre>
  
  <blockquote>
--- 41271,41283 ----
  
  <li>
  <p>
! After section 23.5.7.2 [unord.multiset.cnstr] add a new section
  <ins>unordered_multiset
  modifiers  [unord.multiset.modifiers]</ins> and add the following paragraphs:
  </p>
  
! <blockquote><pre>
! <ins>void swap(unordered_multiset&amp; x);</ins>
  </pre>
  
  <blockquote>
*************** and an unqualified <tt>swap</tt> of the
*** 40609,40633 ****
  <p><i>[
  This resolution is based on the September 2009 WP,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>,
! except that it
! assumes that
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>
! and issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#883">883</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1232">1232</a> have already been applied.  Note in
  particular that Table 91 in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>
  is refered to as Table 90 because
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>
! removed the old Table 90.  This resolution also addresses issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#431">431</a>.
  ]</i></p>
  
  <p>
  In 23.2.1 [container.requirements.general], replace the a.swap(b) row in table 90,
! "container requirements" (was table 91 before the application of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a> to the
! WP):
  </p>
  <blockquote>
  <table border="1">
!   <tbody><tr>
      <td><code>a.swap(b)</code></td>
      <td><code>void</code></td>
      <td>&nbsp;&nbsp;&nbsp;</td>
--- 41320,41344 ----
  <p><i>[
  This resolution is based on the September 2009 WP,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>,
! except that it assumes that
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>
! and issues <a href="lwg-defects.html#883">883</a> and <a href="lwg-closed.html#1232">1232</a> have already been applied.  Note in
  particular that Table 91 in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>
  is refered to as Table 90 because
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>
! removed the old Table 90.  This resolution also addresses issue <a href="lwg-defects.html#431">431</a>.
  ]</i></p>
  
  <p>
  In 23.2.1 [container.requirements.general], replace the a.swap(b) row in table 90,
! "container requirements" (was table 91 before the application of 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a> 
! to the WP):
  </p>
  <blockquote>
  <table border="1">
!   <tr>
      <td><code>a.swap(b)</code></td>
      <td><code>void</code></td>
      <td>&nbsp;&nbsp;&nbsp;</td>
*************** WP):
*** 40641,40653 ****
      <td><ins><code>a.swap(b)</code></ins></td>
      <td><ins>(Note A)</ins></td>
    </tr>
! </tbody></table>
  </blockquote>
  <p>
  Modify the notes immediately following Table 90 in
  23.2.1 [container.requirements.general] as follows (The wording below is after the
! application of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a> to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>.  The editor might also want to combine Notes
! A and B into one.):
  </p>
  <blockquote><p>
  Notes: the algorithms<del> swap(),</del> equal() and lexicographical_compare()
--- 41352,41365 ----
      <td><ins><code>a.swap(b)</code></ins></td>
      <td><ins>(Note A)</ins></td>
    </tr>
! </table>
  </blockquote>
  <p>
  Modify the notes immediately following Table 90 in
  23.2.1 [container.requirements.general] as follows (The wording below is after the
! application of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a> 
! to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>.  The 
! editor might also want to combine Notes A and B into one.):
  </p>
  <blockquote><p>
  Notes: the algorithms<del> swap(),</del> equal() and lexicographical_compare()
*************** assignment operator</del><ins>swap</ins>
*** 40719,40729 ****
  or <code>Pred</code> object (if any).
  </p></blockquote>
  <p>
! Modify section 23.3.1.2 [array.special]:
  </p>
  <blockquote>
  <p>
! <b>array specialized algorithms 23.3.1.2 [array.special]</b>
  </p>
  <p>
  <code>template &lt;class T, size_t N&gt; void swap(array&lt;T,N&gt;&amp; x,array&lt;T,N&gt;&amp; y);</code>
--- 41431,41441 ----
  or <code>Pred</code> object (if any).
  </p></blockquote>
  <p>
! Modify section 23.3.2.3 [array.special]:
  </p>
  <blockquote>
  <p>
! <b>array specialized algorithms 23.3.2.3 [array.special]</b>
  </p>
  <p>
  <code>template &lt;class T, size_t N&gt; void swap(array&lt;T,N&gt;&amp; x,array&lt;T,N&gt;&amp; y);</code>
*************** Modify section 23.3.1.2 [array.special]:
*** 40735,40741 ****
  </blockquote>
  </blockquote>
  <p>
! Add a new section after 23.3.1.5 [array.fill] (Note to the editor: array::fill make use
  of a concept requirement that must be removed or changed to text.):
  </p>
  <blockquote>
--- 41447,41453 ----
  </blockquote>
  </blockquote>
  <p>
! Add a new section after 23.3.2.6 [array.fill] (Note to the editor: array::fill make use
  of a concept requirement that must be removed or changed to text.):
  </p>
  <blockquote>
*************** exception.
*** 40757,40769 ****
  [<i>Note</i>: Unlike other containers' <code>swap</code> functions,
  <code>array::swap</code> takes linear, not constant, time, may exit via an
  exception, and does not cause iterators to become associated with the other
! container. — <i>end note</i>]
  </ins></p>
  </blockquote>
  </blockquote>
  
  <p>
! Insert a new paragraph just after 23.5 [container.adaptors]/1:
  </p>
  <blockquote><p><ins>
  For container adaptors, no <code>swap</code> function throws an exception
--- 41469,41481 ----
  [<i>Note</i>: Unlike other containers' <code>swap</code> functions,
  <code>array::swap</code> takes linear, not constant, time, may exit via an
  exception, and does not cause iterators to become associated with the other
! container. &mdash; <i>end note</i>]
  </ins></p>
  </blockquote>
  </blockquote>
  
  <p>
! Insert a new paragraph just after 23.6 [container.adaptors]/1:
  </p>
  <blockquote><p><ins>
  For container adaptors, no <code>swap</code> function throws an exception
*************** adaptor's <code>Container</code> or <cod
*** 40784,40793 ****
  
  <hr>
  <h3><a name="775"></a>775. Tuple indexing should be unsigned?</h3>
! <p><b>Section:</b> 20.4.2.5 [tuple.helper] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-01-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.helper">issues</a> in [tuple.helper].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The tuple element access API identifies the element in the sequence
--- 41496,41505 ----
  
  <hr>
  <h3><a name="775"></a>775. Tuple indexing should be unsigned?</h3>
! <p><b>Section:</b> 20.4.2.5 [tuple.helper] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-01-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.helper">issues</a> in [tuple.helper].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The tuple element access API identifies the element in the sequence
*************** I be &gt;= 0.  There is a much easier wa
*** 40796,40802 ****
  <tt>unsigned</tt>.
  </p>
  <p>
! In fact the proposal is to use <code>std::size_t</code>, matching the type used in the <tt>tuple_size</tt> API.
  </p>
  <p>
  A second suggestion is that it is hard to imagine an API that deduces
--- 41508,41515 ----
  <tt>unsigned</tt>.
  </p>
  <p>
! In fact the proposal is to use <code>std::size_t</code>, matching the 
! type used in the <tt>tuple_size</tt> API.
  </p>
  <p>
  A second suggestion is that it is hard to imagine an API that deduces
*************** problem as all elements are of type <cod
*** 40823,40831 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Update header &lt;utility&gt; synopsis in 20.3 [utility]
  </p>
! <pre><em>// 20.2.3, tuple-like access to pair:</em>
  template &lt;class T&gt; class tuple_size;
  template &lt;<del>int</del><ins>size_t</ins> I, class T&gt; class tuple_element;
  
--- 41536,41545 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Update header &lt;utility&gt; synopsis in 20.2 [utility]
  </p>
! <pre>
! <em>// 20.2.3, tuple-like access to pair:</em>
  template &lt;class T&gt; class tuple_size;
  template &lt;<del>int</del><ins>size_t</ins> I, class T&gt; class tuple_element;
  
*************** template&lt;<del>int</del><ins>size_t</i
*** 40839,40847 ****
    const <del>P</del><ins>typename tuple_element&lt;I, std::pair&lt;T1, T2&gt; &gt;::type </ins>&amp; get(const std::pair&lt;T1, T2&gt;&amp;);
  </pre>
  <p>
! Update <strong>20.3.5 [pairs] Pairs</strong>
  </p>
! <pre>template&lt;<del>int</del><ins>size_t</ins> I, class T1, class T2&gt;
    <del>P</del><ins>typename tuple_element&lt;I, std::pair&lt;T1, T2&gt; &gt;::type </ins>&amp; get(pair&lt;T1, T2&gt;&amp;);
  template&lt;<del>int</del><ins>size_t</ins> I, class T1, class T2&gt;
    const <del>P</del><ins>typename tuple_element&lt;I, std::pair&lt;T1, T2&gt; &gt;::type </ins>&amp; get(const pair&lt;T1, T2&gt;&amp;);
--- 41553,41562 ----
    const <del>P</del><ins>typename tuple_element&lt;I, std::pair&lt;T1, T2&gt; &gt;::type </ins>&amp; get(const std::pair&lt;T1, T2&gt;&amp;);
  </pre>
  <p>
! Update <strong>20.3 [pairs] Pairs</strong>
  </p>
! <pre>
! template&lt;<del>int</del><ins>size_t</ins> I, class T1, class T2&gt;
    <del>P</del><ins>typename tuple_element&lt;I, std::pair&lt;T1, T2&gt; &gt;::type </ins>&amp; get(pair&lt;T1, T2&gt;&amp;);
  template&lt;<del>int</del><ins>size_t</ins> I, class T1, class T2&gt;
    const <del>P</del><ins>typename tuple_element&lt;I, std::pair&lt;T1, T2&gt; &gt;::type </ins>&amp; get(const pair&lt;T1, T2&gt;&amp;);
*************** template&lt;<del>int</del><ins>size_t</i
*** 40860,40867 ****
  <p>
  Update header &lt;tuple&gt; synopsis in 20.4 [tuple] with a APIs as below:
  </p>
! <pre>template &lt;<del>int</del><ins>size_t</ins> I, class T&gt; class tuple_element; <em>// undefined</em>
! template &lt;<del>int</del><ins>size_t</ins> I, class... Types&gt; class tuple_element&lt;I, tuple&lt;Types...&gt; &gt;;
  
  <em>// 20.3.1.4, element access:</em>
  template &lt;<del>int</del><ins>size_t</ins> I, class... Types&gt;
--- 41575,41583 ----
  <p>
  Update header &lt;tuple&gt; synopsis in 20.4 [tuple] with a APIs as below:
  </p>
! <pre>
! template &lt;<del>int</del><ins>size_t</ins> I, class T&gt; class tuple_element; <em>// undefined</em>
! template &lt;<del>int</del><ins>size_t</ins> I, class... Types> class tuple_element&lt;I, tuple&lt;Types...> >;
  
  <em>// 20.3.1.4, element access:</em>
  template &lt;<del>int</del><ins>size_t</ins> I, class... Types&gt;
*************** public:
*** 40887,40901 ****
  <p>
  Update <strong>20.4.2.6 [tuple.elem] Element access</strong>
  </p>
! <pre>template &lt;<del>int</del><ins>size_t</ins> I, class... types &gt;
  typename tuple_element&lt;I, tuple&lt;Types...&gt; &gt;::type&amp; get(tuple&lt;Types...&gt;&amp; t);
  </pre>
- 1 <em>Requires:</em> <code><del>0 &lt;= I and </del>I &lt; sizeof...(Types)</code>. The program is ill-formed if <code>I</code> is out of bounds.
  <p>
  2 <em>Returns:</em> A reference to the <code>I</code>th element of <code>t</code>, where indexing is zero-based.
  </p>
  <ins><em>Throws:</em> Nothing.</ins>
! <pre>template &lt;<del>int</del><ins>size_t</ins> I, class... types&gt;
  typename tuple_element&lt;I, tuple&lt;Types...&gt; &gt;::type const&amp; get(const tuple&lt;Types...&gt;&amp; t);
  </pre>
  <p>
--- 41603,41620 ----
  <p>
  Update <strong>20.4.2.6 [tuple.elem] Element access</strong>
  </p>
! <pre>
! template &lt;<del>int</del><ins>size_t</ins> I, class... types &gt;
  typename tuple_element&lt;I, tuple&lt;Types...&gt; &gt;::type&amp; get(tuple&lt;Types...&gt;&amp; t);
  </pre>
  <p>
+ 1 <em>Requires:</em> <code><del>0 &lt;= I and </del>I &lt; sizeof...(Types)</code>. The program is ill-formed if <code>I</code> is out of bounds.
+ <p/>
  2 <em>Returns:</em> A reference to the <code>I</code>th element of <code>t</code>, where indexing is zero-based.
  </p>
  <ins><em>Throws:</em> Nothing.</ins>
! <pre>
! template &lt;<del>int</del><ins>size_t</ins> I, class... types&gt;
  typename tuple_element&lt;I, tuple&lt;Types...&gt; &gt;::type const&amp; get(const tuple&lt;Types...&gt;&amp; t);
  </pre>
  <p>
*************** typename tuple_element&lt;I, tuple&lt;Ty
*** 40910,40919 ****
  
  
  <p>
! Update header &lt;array&gt; synopsis in 20.3 [utility]
  </p>
! <pre>template &lt;class T&gt; class tuple_size; <em>// forward declaration</em>
! template &lt;<del>int</del><ins>size_t</ins> I, class T&gt; class tuple_element; <em>// forward declaration</em>
  template &lt;class T, size_t N&gt;
    struct tuple_size&lt;array&lt;T, N&gt; &gt;;
  template &lt;<del>int</del><ins>size_t</ins> I, class T, size_t N&gt;
--- 41629,41639 ----
  
  
  <p>
! Update header &lt;array&gt; synopsis in 20.2 [utility]
  </p>
! <pre>
! template &lt;class T&gt; class tuple_size; <em>// forward declaration</em>
! template &lt;<del>int</del><ins>size_t</ins> I, class T> class tuple_element; <em>// forward declaration</em>
  template &lt;class T, size_t N&gt;
    struct tuple_size&lt;array&lt;T, N&gt; &gt;;
  template &lt;<del>int</del><ins>size_t</ins> I, class T, size_t N&gt;
*************** template &lt;<del>int</del><ins>size_t</
*** 40925,40933 ****
  </pre>
  
  <p>
! Update <strong>23.3.1.8 [array.tuple] Tuple interface to class template array</strong>
  </p>
! <pre>tuple_element&lt;<ins>size_t </ins>I, array&lt;T, N&gt; &gt;::type
  </pre>
  <p>
  3 <em>Requires:</em> <code><del>0 &lt;= </del>I &lt; N.</code> The program is ill-formed if <code>I</code> is out of bounds.
--- 41645,41654 ----
  </pre>
  
  <p>
! Update <strong>23.3.2.9 [array.tuple] Tuple interface to class template array</strong>
  </p>
! <pre>
! tuple_element&lt;<ins>size_t </ins>I, array&lt;T, N&gt; &gt;::type
  </pre>
  <p>
  3 <em>Requires:</em> <code><del>0 &lt;= </del>I &lt; N.</code> The program is ill-formed if <code>I</code> is out of bounds.
*************** Update <strong>23.3.1.8 [array.tuple] Tu
*** 40935,40941 ****
  <p>
  4 <em>Value:</em> The type <code>T</code>.
  </p>
! <pre>template &lt;<del>int</del><ins>size_t</ins> I, class T, size_t N&gt; T&amp; get(array&lt;T, N&gt;&amp; a);
  </pre>
  <p>
  5 <em>Requires:</em> <code><del>0 &lt;= </del>I &lt; N</code>. The program is ill-formed if <code>I</code> is out of bounds.
--- 41656,41663 ----
  <p>
  4 <em>Value:</em> The type <code>T</code>.
  </p>
! <pre>
! template &lt;<del>int</del><ins>size_t</ins> I, class T, size_t N&gt; T&amp; get(array&lt;T, N&gt;&amp; a);
  </pre>
  <p>
  5 <em>Requires:</em> <code><del>0 &lt;= </del>I &lt; N</code>. The program is ill-formed if <code>I</code> is out of bounds.
*************** Update <strong>23.3.1.8 [array.tuple] Tu
*** 40946,40952 ****
  <p>
  <ins><em>Throws:</em> Nothing.</ins>
  </p>
! <pre>template &lt;<del>int</del><ins>size_t</ins> I, class T, size_t N&gt; const T&amp; get(const array&lt;T, N&gt;&amp; a);
  </pre>
  <p>
  6 <em>Requires:</em> <code><del>0 &lt;= </del>I &lt; N</code>. The program is ill-formed if <code>I</code> is out of bounds.
--- 41668,41675 ----
  <p>
  <ins><em>Throws:</em> Nothing.</ins>
  </p>
! <pre>
! template &lt;<del>int</del><ins>size_t</ins> I, class T, size_t N&gt; const T&amp; get(const array&lt;T, N&gt;&amp; a);
  </pre>
  <p>
  6 <em>Requires:</em> <code><del>0 &lt;= </del>I &lt; N</code>. The program is ill-formed if <code>I</code> is out of bounds.
*************** for pair is also unnecessary.
*** 40970,40987 ****
  
  
  <hr>
! <h3><a name="776"></a>776. Undescribed assign function of std::array</h3>
! <p><b>Section:</b> 23.3.1 [array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-01-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The class template array synopsis in 23.3.1 [array]/3 declares a member
  function
  </p>
  
! <blockquote><pre>void assign(const T&amp; u);
  </pre></blockquote>
  
  <p>
--- 41693,41712 ----
  
  
  <hr>
! <h3><a name="776"></a>776. Undescribed <tt>assign</tt> function of <tt>std::array</tt></h3>
! <p><b>Section:</b> 23.3.2 [array] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-01-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The class template array synopsis in 23.3.2 [array] p. 3 declares a member
  function
  </p>
  
! <blockquote><pre>
! void assign(const T&amp; u);
  </pre></blockquote>
  
  <p>
*************** be derived by those.
*** 40992,41003 ****
  
  <p>
  I found only one reference to this function in the issue list,
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#588">588</a> where the question is raised:
  </p>
  
! <blockquote>
  what's the effect of calling <tt>assign(T&amp;)</tt> on a zero-sized array?
! </blockquote>
  
  <p>
  which does not answer the basic question of this issue.
--- 41717,41728 ----
  
  <p>
  I found only one reference to this function in the issue list,
! <a href="lwg-closed.html#588">588</a> where the question is raised:
  </p>
  
! <blockquote><p>
  what's the effect of calling <tt>assign(T&amp;)</tt> on a zero-sized array?
! </p></blockquote>
  
  <p>
  which does not answer the basic question of this issue.
*************** course such wording must be added.
*** 41012,41018 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Just after the section 23.3.1.4 [array.data] add the following new section:
  </p>
  
  <p>
--- 41737,41743 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Just after the section 23.3.2.5 [array.data] add the following new section:
  </p>
  
  <p>
*************** Just after the section 23.3.1.4 [array.d
*** 41020,41026 ****
  </p>
  
  <blockquote>
! <pre>void fill(const T&amp; u);
  </pre>
  
  <p>
--- 41745,41752 ----
  </p>
  
  <blockquote>
! <pre>
! void fill(const T&amp; u);
  </pre>
  
  <p>
*************** section. If it had, then <tt>assign</tt>
*** 41034,41043 ****
  </p>
  
  <p>
! Change the synopsis in 23.3.1 [array]/3:
  </p>
  
! <blockquote><pre>template &lt;class T, size_t N&gt;
  struct array { 
    ...
    void <del>assign</del> <ins>fill</ins>(const T&amp; u);
--- 41760,41770 ----
  </p>
  
  <p>
! Change the synopsis in 23.3.2 [array]/3:
  </p>
  
! <blockquote><pre>
! template &lt;class T, size_t N&gt;
  struct array { 
    ...
    void <del>assign</del> <ins>fill</ins>(const T&amp; u);
*************** Set state to Review given substitution o
*** 41064,41080 ****
  
  <hr>
  <h3><a name="777"></a>777. Atomics Library Issue</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-01-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics.types.operations">active issues</a> in [atomics.types.operations].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The load functions are defined as
  </p>
  
! <blockquote><pre>C atomic_load(volatile A* object);
  C atomic_load_explicit(volatile A* object, memory_order);
  C A::load(memory_order order = memory_order_seq_cst) volatile;
  </pre></blockquote>
--- 41791,41807 ----
  
  <hr>
  <h3><a name="777"></a>777. Atomics Library Issue</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-01-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The load functions are defined as
  </p>
  
! <blockquote><pre>
! C atomic_load(volatile A* object);
  C atomic_load_explicit(volatile A* object, memory_order);
  C A::load(memory_order order = memory_order_seq_cst) volatile;
  </pre></blockquote>
*************** post Bellevue Peter adds:
*** 41090,41096 ****
  
  <blockquote>
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#777">777</a> suggests making <tt>atomic_load</tt> operate on <tt>const</tt> objects. There is a
  subtle point here. Atomic loads do not generally write to the object, except
  potentially for the <tt>memory_order_seq_cst</tt> constraint. Depending on the
  architecture, a dummy write with the same value may be required to be issued
--- 41817,41823 ----
  
  <blockquote>
  <p>
! Issue <a href="lwg-defects.html#777">777</a> suggests making <tt>atomic_load</tt> operate on <tt>const</tt> objects. There is a
  subtle point here. Atomic loads do not generally write to the object, except
  potentially for the <tt>memory_order_seq_cst</tt> constraint. Depending on the
  architecture, a dummy write with the same value may be required to be issued
*************** by the atomic load to maintain sequentia
*** 41098,41104 ****
  make the following code:
  </p>
  
! <blockquote><pre>const atomic_int x{};
  
  int main()
  {
--- 41825,41832 ----
  make the following code:
  </p>
  
! <blockquote><pre>
! const atomic_int x{};
  
  int main()
  {
*************** mutable, as is already the case with mut
*** 41127,41133 ****
  Add the <tt>const</tt> qualifier to <tt>*object</tt> and <tt>*this</tt>.
  </p>
  
! <blockquote><pre>C atomic_load(<ins>const</ins> volatile A* object);
  C atomic_load_explicit(<ins>const</ins> volatile A* object, memory_order);
  C A::load(memory_order order = memory_order_seq_cst) <ins>const</ins> volatile;
  </pre></blockquote>
--- 41855,41862 ----
  Add the <tt>const</tt> qualifier to <tt>*object</tt> and <tt>*this</tt>.
  </p>
  
! <blockquote><pre>
! C atomic_load(<ins>const</ins> volatile A* object);
  C atomic_load_explicit(<ins>const</ins> volatile A* object, memory_order);
  C A::load(memory_order order = memory_order_seq_cst) <ins>const</ins> volatile;
  </pre></blockquote>
*************** C A::load(memory_order order = memory_or
*** 41139,41149 ****
  
  <hr>
  <h3><a name="778"></a>778. std::bitset does not have any constructor taking a string literal</h3>
! <p><b>Section:</b> 20.5.1 [bitset.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2008-01-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitset.cons">issues</a> in [bitset.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#116">116</a></p>
  <p><b>Discussion:</b></p>
  <p>
  A small issue with <tt>std::bitset</tt>: it does not have any constructor
--- 41868,41878 ----
  
  <hr>
  <h3><a name="778"></a>778. std::bitset does not have any constructor taking a string literal</h3>
! <p><b>Section:</b> 20.6.1 [bitset.cons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2008-01-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitset.cons">issues</a> in [bitset.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#116">116</a></p>
  <p><b>Discussion:</b></p>
  <p>
  A small issue with <tt>std::bitset</tt>: it does not have any constructor
*************** we tried to enable uniform use of <tt>st
*** 41155,41161 ****
  Suggestion: Add
  </p>
  
! <blockquote><pre>explicit bitset( const char* str );
  </pre></blockquote>
  
  <p>
--- 41884,41891 ----
  Suggestion: Add
  </p>
  
! <blockquote><pre>
! explicit bitset( const char* str );
  </pre></blockquote>
  
  <p>
*************** to std::bitset.
*** 41165,41181 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to synopsis in 20.5 [template.bitset]
  </p>
  
! <blockquote><pre>explicit bitset( const char* str );
  </pre></blockquote>
  
  <p>
! Add to synopsis in 20.5.1 [bitset.cons]
  </p>
  
! <blockquote><pre>explicit bitset( const char* str );
  </pre>
  <p>
  <i>Effects:</i> Constructs a <tt>bitset</tt> as if <tt>bitset(string(str))</tt>.
--- 41895,41913 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to synopsis in 20.6 [template.bitset]
  </p>
  
! <blockquote><pre>
! explicit bitset( const char* str );
  </pre></blockquote>
  
  <p>
! Add to synopsis in 20.6.1 [bitset.cons]
  </p>
  
! <blockquote><pre>
! explicit bitset( const char* str );
  </pre>
  <p>
  <i>Effects:</i> Constructs a <tt>bitset</tt> as if <tt>bitset(string(str))</tt>.
*************** Add to synopsis in 20.5.1 [bitset.cons]
*** 41189,41216 ****
  
  <hr>
  <h3><a name="779"></a>779. Resolution of #283 incomplete</h3>
! <p><b>Section:</b> 25.3.8 [alg.remove] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-01-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.remove">issues</a> in [alg.remove].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#283">283</a> did not resolve similar necessary changes for algorithm
! <tt>remove_copy[_if]</tt>,
! which seems to be an oversight.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 25.3.8 [alg.remove]/p.6, replace the N2461 requires clause with:
  </p>
  
! <blockquote>
  <i>Requires:</i> <del>Type <tt>T</tt> is <tt>EqualityComparable</tt> (31).</del> The ranges <tt>[first,last)</tt>
  and <tt>[result,result + (last - first))</tt> shall not overlap. <ins>The expression <tt>*result = *first</tt> shall be
  valid.</ins>
! </blockquote>
  
  
  
--- 41921,41947 ----
  
  <hr>
  <h3><a name="779"></a>779. Resolution of #283 incomplete</h3>
! <p><b>Section:</b> 25.3.8 [alg.remove] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-01-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.remove">issues</a> in [alg.remove].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The resolution of <a href="lwg-defects.html#283">283</a> did not resolve similar necessary changes for algorithm
! <tt>remove_copy[_if]</tt>, which seems to be an oversight.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 25.3.8 [alg.remove] p.6, replace the N2461 requires clause with:
  </p>
  
! <blockquote><p>
  <i>Requires:</i> <del>Type <tt>T</tt> is <tt>EqualityComparable</tt> (31).</del> The ranges <tt>[first,last)</tt>
  and <tt>[result,result + (last - first))</tt> shall not overlap. <ins>The expression <tt>*result = *first</tt> shall be
  valid.</ins>
! </p></blockquote>
  
  
  
*************** valid.</ins>
*** 41218,41230 ****
  
  
  <hr>
! <h3><a name="780"></a>780. <tt>std::merge()</tt> specification incorrect/insufficient</h3>
! <p><b>Section:</b> 25.4.4 [alg.merge] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-01-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Though issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#283">283</a> has fixed many open issues, it seems that some are still open:
  </p>
  
  <p>
--- 41949,41961 ----
  
  
  <hr>
! <h3><a name="780"></a>780. <tt>std::merge()</tt> specification incorrect&#47;insufficient</h3>
! <p><b>Section:</b> 25.4.4 [alg.merge] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-01-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Though issue <a href="lwg-defects.html#283">283</a> has fixed many open issues, it seems that some are still open:
  </p>
  
  <p>
*************** Post Summit Alisdair adds:
*** 41266,41283 ****
  <p>
  Suggest:
  </p>
! <blockquote>
  (where <tt>last</tt> is equal to <tt>next(result, distance(first1, last1) +
  distance(first2, last2))</tt>, such that resulting range will be sorted in
  non-decreasing order; that is, for every iterator <tt>i</tt> in <tt>[result,last)</tt> other
  than <tt>result</tt>, the condition <tt>*i &lt; *prev(i)</tt> or, respectively, <tt>comp(*i,
  *prev(i))</tt> will be <tt>false</tt>.
! </blockquote>
  
  <p>
  Note that this might still not be technically accurate in the case of
  <tt>InputIterators</tt>, depending on other resolutions working their way through the
! system (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1011">1011</a>).
  </p>
  </blockquote>
  
--- 41997,42014 ----
  <p>
  Suggest:
  </p>
! <blockquote><p>
  (where <tt>last</tt> is equal to <tt>next(result, distance(first1, last1) +
  distance(first2, last2))</tt>, such that resulting range will be sorted in
  non-decreasing order; that is, for every iterator <tt>i</tt> in <tt>[result,last)</tt> other
  than <tt>result</tt>, the condition <tt>*i &lt; *prev(i)</tt> or, respectively, <tt>comp(*i,
  *prev(i))</tt> will be <tt>false</tt>.
! </p></blockquote>
  
  <p>
  Note that this might still not be technically accurate in the case of
  <tt>InputIterators</tt>, depending on other resolutions working their way through the
! system (<a href="lwg-defects.html#1011">1011</a>).
  </p>
  </blockquote>
  
*************** Post Summit Daniel adds:
*** 41286,41296 ****
  ]</i></p>
  
  
! <blockquote>
  If we want to use <tt>prev</tt> and <tt>next</tt> here (Note: <tt>merge</tt>
! is sufficiently satisfied with <tt>InputIterator</tt>) we should instead *add* more to
! 25 [algorithms]/6, but I can currently not propose any good wording for this.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
--- 42017,42027 ----
  ]</i></p>
  
  
! <blockquote><p>
  If we want to use <tt>prev</tt> and <tt>next</tt> here (Note: <tt>merge</tt>
! is sufficiently satisfied with <tt>InputIterator</tt>) we should instead <em>add</em> more to
! 25 [algorithms] p. 6, but I can currently not propose any good wording for this.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
*************** Batavia (2009-05):
*** 41298,41304 ****
  
  <blockquote>
  <p>
! Pete points out the existing wording in [algorithms]/4
  that permits the use of + in algorithm specifications.
  </p>
  <p>
--- 42029,42035 ----
  
  <blockquote>
  <p>
! Pete points out the existing wording in [algorithms] p. 4
  that permits the use of + in algorithm specifications.
  </p>
  <p>
*************** Move to Review.
*** 41314,41322 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  2009-08-23 Daniel reopens:
--- 42045,42053 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  2009-08-23 Daniel reopens:
*************** Move to Ready.
*** 41328,41337 ****
  The proposed wording must be rephrased, because the part
  </p>
  
! <blockquote>
  for every iterator <tt>i</tt> in <tt>[result,last)</tt> other than <tt>result</tt>, the condition
  <tt>*i &lt; *(i - 1)</tt> or, respectively, <tt>comp(*i, *(i - 1))</tt> will be <tt>false</tt>"
! </blockquote>
  
  <p>
  isn't meaningful, because the range <tt>[result,last)</tt> is that of a pure
--- 42059,42068 ----
  The proposed wording must be rephrased, because the part
  </p>
  
! <blockquote><p>
  for every iterator <tt>i</tt> in <tt>[result,last)</tt> other than <tt>result</tt>, the condition
  <tt>*i &lt; *(i - 1)</tt> or, respectively, <tt>comp(*i, *(i - 1))</tt> will be <tt>false</tt>"
! </p></blockquote>
  
  <p>
  isn't meaningful, because the range <tt>[result,last)</tt> is that of a pure
*************** in <tt>[first,last)</tt> other than <tt>
*** 41427,41433 ****
  </blockquote>
  
  <p>
! Change 25.4.4 [alg.merge]/6+7 as indicated <i>[This ensures harmonization
  between <tt>inplace_merge</tt> and <tt>merge</tt>]</i>
  </p>
  
--- 42158,42164 ----
  </blockquote>
  
  <p>
! Change 25.4.4 [alg.merge] p. 6+7 as indicated <i>[This ensures harmonization
  between <tt>inplace_merge</tt> and <tt>merge</tt>]</i>
  </p>
  
*************** requirements (Table 33), and the the <tt
*** 41458,41467 ****
  
  <hr>
  <h3><a name="781"></a>781. <tt>std::complex</tt> should add missing C99 functions</h3>
! <p><b>Section:</b> 26.4.7 [complex.value.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-01-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.value.ops">issues</a> in [complex.value.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A comparision of the N2461 header <tt>&lt;complex&gt;</tt> synopsis ([complex.syn])
--- 42189,42198 ----
  
  <hr>
  <h3><a name="781"></a>781. <tt>std::complex</tt> should add missing C99 functions</h3>
! <p><b>Section:</b> 26.4.7 [complex.value.ops] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-01-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.value.ops">issues</a> in [complex.value.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A comparision of the N2461 header <tt>&lt;complex&gt;</tt> synopsis ([complex.syn])
*************** some complex functions that are missing
*** 41471,41482 ****
  
  <ol>
  <li>
! 7.3.9.4: (required elements of the C99 library)<br>
  The <tt>cproj</tt> functions
  </li>
  <li>
! 7.26.1: (optional elements of the C99 library)<br>
! <pre>cerf    cerfc    cexp2
  cexpm1  clog10   clog1p
  clog2   clgamma  ctgamma
  </pre>
--- 42202,42214 ----
  
  <ol>
  <li>
! 7.3.9.4: (required elements of the C99 library)<br/>
  The <tt>cproj</tt> functions
  </li>
  <li>
! 7.26.1: (optional elements of the C99 library)<br/>
! <pre>
! cerf    cerfc    cexp2
  cexpm1  clog10   clog1p
  clog2   clgamma  ctgamma
  </pre>
*************** function).
*** 41491,41497 ****
  
  <p>
  Please note also that the current entry <tt>polar</tt>
! in 26.4.9 [cmplx.over]/1
  should be removed from the mentioned overload list. It does not make sense to require that a
  function already expecting <em>scalar</em> arguments
  should cast these arguments into corresponding
--- 42223,42229 ----
  
  <p>
  Please note also that the current entry <tt>polar</tt>
! in 26.4.9 [cmplx.over] p. 1
  should be removed from the mentioned overload list. It does not make sense to require that a
  function already expecting <em>scalar</em> arguments
  should cast these arguments into corresponding
*************** this function.
*** 41505,41511 ****
  In 26.4.1 [complex.syn] add just between the declaration of <tt>conj</tt> and <tt>fabs</tt>:
  </p>
  
! <blockquote><pre>template&lt;class T&gt; complex&lt;T&gt; conj(const complex&lt;T&gt;&amp;);
  <ins>template&lt;class T&gt; complex&lt;T&gt; proj(const complex&lt;T&gt;&amp;);</ins>
  template&lt;class T&gt; complex&lt;T&gt; fabs(const complex&lt;T&gt;&amp;);
  </pre></blockquote>
--- 42237,42244 ----
  In 26.4.1 [complex.syn] add just between the declaration of <tt>conj</tt> and <tt>fabs</tt>:
  </p>
  
! <blockquote><pre>
! template&lt;class T&gt; complex&lt;T&gt; conj(const complex&lt;T&gt;&amp;);
  <ins>template&lt;class T&gt; complex&lt;T&gt; proj(const complex&lt;T&gt;&amp;);</ins>
  template&lt;class T&gt; complex&lt;T&gt; fabs(const complex&lt;T&gt;&amp;);
  </pre></blockquote>
*************** In 26.4.7 [complex.value.ops] just after
*** 41515,41531 ****
  </p>
  
  <blockquote>
! <pre>template&lt;class T&gt; complex&lt;T&gt; proj(const complex&lt;T&gt;&amp; x);
  </pre>
! <blockquote>
! 
  <i>Effects:</i> Behaves the same as C99 function <tt>cproj</tt>, defined in
  subclause 7.3.9.4."
! </blockquote>
  </blockquote>
  
  <p>
! In 26.4.9 [cmplx.over]/1, add one further entry <tt>proj</tt> to
  the overload list.
  </p>
  
--- 42248,42264 ----
  </p>
  
  <blockquote>
! <pre>
! template&lt;class T&gt; complex&lt;T&gt; proj(const complex&lt;T&gt;&amp; x);
  </pre>
! <blockquote><p>
  <i>Effects:</i> Behaves the same as C99 function <tt>cproj</tt>, defined in
  subclause 7.3.9.4."
! </p></blockquote>
  </blockquote>
  
  <p>
! In 26.4.9 [cmplx.over] p. 1, add one further entry <tt>proj</tt> to
  the overload list.
  </p>
  
*************** the overload list.
*** 41533,41539 ****
  <p>
  The following function templates shall have additional overloads:
  </p>
! <blockquote><pre>arg           norm 
  conj          <del>polar</del> <ins>proj</ins>
  imag          real
  </pre></blockquote>
--- 42266,42273 ----
  <p>
  The following function templates shall have additional overloads:
  </p>
! <blockquote><pre>
! arg           norm 
  conj          <del>polar</del> <ins>proj</ins>
  imag          real
  </pre></blockquote>
*************** imag          real
*** 41546,41555 ****
  
  <hr>
  <h3><a name="782"></a>782. Extended <tt>seed_seq</tt> constructor is useless</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-01-27 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Part of the resolution of n2423, issue 8 was the proposal to
--- 42280,42289 ----
  
  <hr>
  <h3><a name="782"></a>782. Extended <tt>seed_seq</tt> constructor is useless</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-01-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Part of the resolution of n2423, issue 8 was the proposal to
*************** extend the <tt>seed_seq</tt> constructor
*** 41557,41563 ****
  as follows (which is now part of N2461):
  </p>
  
! <blockquote><pre>template&lt;class InputIterator,
  size_t u = numeric_limits&lt;iterator_traits&lt;InputIterator&gt;::value_type&gt;::digits&gt;
  seed_seq(InputIterator begin, InputIterator end);
  </pre></blockquote>
--- 42291,42298 ----
  as follows (which is now part of N2461):
  </p>
  
! <blockquote><pre>
! template&lt;class InputIterator,
  size_t u = numeric_limits&lt;iterator_traits&lt;InputIterator&gt;::value_type&gt;::digits&gt;
  seed_seq(InputIterator begin, InputIterator end);
  </pre></blockquote>
*************** Proposed Resolution: Accept Solution A.
*** 41604,41622 ****
  </blockquote>
  
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#803">803</a> claims to make this issue moot.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol type="A">
  <li>
  <p>
  In 26.5.7.1 [rand.util.seedseq]/2, class <tt>seed_seq</tt> synopsis replace:
  </p>
  
! <blockquote><pre>class seed_seq 
  { 
  public:
     ...
--- 42339,42358 ----
  </blockquote>
  
  <p>
! Issue <a href="lwg-defects.html#803">803</a> claims to make this issue moot.
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol style="list-style-type:upper-alpha">
  <li>
  <p>
  In 26.5.7.1 [rand.util.seedseq]/2, class <tt>seed_seq</tt> synopsis replace:
  </p>
  
! <blockquote><pre>
! class seed_seq 
  { 
  public:
     ...
*************** In 26.5.7.1 [rand.util.seedseq]/2, class
*** 41640,41646 ****
  member description between p.3 and p.4 replace:
  </p>
  
! <blockquote><pre>template&lt;class InputIterator<del>,
    size_t u = numeric_limits&lt;iterator_traits&lt;InputIterator&gt;::value_type&gt;::digits</del>&gt;
        seed_seq(InputIterator begin, InputIterator end);
  <ins>template&lt;class InputIterator, size_t u&gt;
--- 42376,42383 ----
  member description between p.3 and p.4 replace:
  </p>
  
! <blockquote><pre>
! template&lt;class InputIterator<del>,
    size_t u = numeric_limits&lt;iterator_traits&lt;InputIterator&gt;::value_type&gt;::digits</del>&gt;
        seed_seq(InputIterator begin, InputIterator end);
  <ins>template&lt;class InputIterator, size_t u&gt;
*************** class <tt>seed_seq</tt> declaration <em>
*** 41653,41659 ****
  after the class <tt>seed_seq</tt> definition add:
  </p>
  
! <blockquote><pre>template&lt;size_t u, class InputIterator&gt;
    seed_seq make_seed_seq(InputIterator begin, InputIterator end);
  </pre></blockquote>
  
--- 42390,42397 ----
  after the class <tt>seed_seq</tt> definition add:
  </p>
  
! <blockquote><pre>
! template&lt;size_t u, class InputIterator&gt;
    seed_seq make_seed_seq(InputIterator begin, InputIterator end);
  </pre></blockquote>
  
*************** In 26.5.7.1 [rand.util.seedseq], just af
*** 41679,41685 ****
  </p>
  
  <blockquote>
! <pre>template&lt;size_t u, class InputIterator&gt;
     seed_seq make_seed_seq(InputIterator begin, InputIterator end);
  </pre>
  <blockquote>
--- 42417,42424 ----
  </p>
  
  <blockquote>
! <pre>
! template&lt;size_t u, class InputIterator&gt;
     seed_seq make_seed_seq(InputIterator begin, InputIterator end);
  </pre>
  <blockquote>
*************** where <tt>u</tt> is used to construct an
*** 41702,41711 ****
  
  <hr>
  <h3><a name="783"></a>783. <tt>thread::id</tt> reuse</h3>
! <p><b>Section:</b> 30.3.1.1 [thread.thread.id] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2008-02-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.id">issues</a> in [thread.thread.id].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current working paper 
--- 42441,42450 ----
  
  <hr>
  <h3><a name="783"></a>783. <tt>thread::id</tt> reuse</h3>
! <p><b>Section:</b> 30.3.1.1 [thread.thread.id] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2008-02-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.id">issues</a> in [thread.thread.id].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current working paper 
*************** example:
*** 41753,41759 ****
  </p>
  
  <p>
! <a href="http://www.decadentplace.org.uk/pipermail/cpp-threads/2006-August/001091.html">http://www.decadentplace.org.uk/pipermail/cpp-threads/2006-August/001091.html</a>
  </p>
  </blockquote>
  
--- 42492,42498 ----
  </p>
  
  <p>
! <a href="http://www.decadent.org.uk/pipermail/cpp-threads/2006-August/001091.html">http://www.decadent.org.uk/pipermail/cpp-threads/2006-August/001091.html</a>
  </p>
  </blockquote>
  
*************** terminated thread that can no longer be
*** 41787,41796 ****
  
  <hr>
  <h3><a name="786"></a>786. Thread library timed waits, UTC and monotonic clocks</h3>
! <p><b>Section:</b> 20.11 [time] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Christopher Kohlhoff, Jeff Garland <b>Opened:</b> 2008-02-03 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time">issues</a> in [time].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The draft C++0x thread library requires that the time points of type
--- 42526,42535 ----
  
  <hr>
  <h3><a name="786"></a>786. Thread library timed waits, UTC and monotonic clocks</h3>
! <p><b>Section:</b> 20.12 [time] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Christopher Kohlhoff, Jeff Garland <b>Opened:</b> 2008-02-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time">issues</a> in [time].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The draft C++0x thread library requires that the time points of type
*************** Universal Time (UTC) (section  [datetime
*** 41799,41805 ****
  surprising behavior when a library user performs a duration-based wait,
  such as <tt>condition_variable::timed_wait()</tt>. A complete explanation of the
  problem may be found in the
! <a href="http://www.opengroup.org/onlinepubs/009695399/xrat/xsh_chap02.html#tag_03_02_08_19">Rationale for the Monotonic Clock</a>
  section in POSIX, but in summary:
  </p>
  
--- 42538,42544 ----
  surprising behavior when a library user performs a duration-based wait,
  such as <tt>condition_variable::timed_wait()</tt>. A complete explanation of the
  problem may be found in the
! <a href="http://pubs.opengroup.org/onlinepubs/009695399/xrat/xsh_chap02.html#tag_03_02_08_19">Rationale for the Monotonic Clock</a>
  section in POSIX, but in summary:
  </p>
  
*************** Change the constructor <tt>explicit syst
*** 41904,41930 ****
  </p>
  
  
! <p><b>Rationale:</b></p>
  Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.html">N2661: A Foundation to Sleep On</a>.
! 
  
  
  
  
  <hr>
  <h3><a name="787"></a>787. complexity of <tt>binary_search</tt></h3>
! <p><b>Section:</b> 25.4.3.4 [binary.search] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-09-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 25.4.3.4 [binary.search]/3 the complexity of <tt>binary_search</tt> is described as
  </p>
  
! <blockquote>
  At most <tt>log(last - first) + 2</tt> comparisons.
! </blockquote>
  
  <p>
  This should be precised and brought in line with the nomenclature used for
--- 42643,42669 ----
  </p>
  
  
! <p><b>Rationale:</b></p><p>
  Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.htm">N2661: A Foundation to Sleep On</a>.
! </p>
  
  
  
  
  <hr>
  <h3><a name="787"></a>787. complexity of <tt>binary_search</tt></h3>
! <p><b>Section:</b> 25.4.3.4 [binary.search] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-09-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 25.4.3.4 [binary.search] p. 3 the complexity of <tt>binary_search</tt> is described as
  </p>
  
! <blockquote><p>
  At most <tt>log(last - first) + 2</tt> comparisons.
! </p></blockquote>
  
  <p>
  This should be precised and brought in line with the nomenclature used for
*************** This should be precised and brought in l
*** 41934,41942 ****
  <p>
  All existing libraries I'm aware of, delegate to
  <tt>lower_bound</tt> (+ one further comparison). Since
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a>
! has now WP status, the resolution of #787 should
! be brought in-line with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384">384</a> by changing the <tt>+ 2</tt>
  to <tt>+ O(1)</tt>.
  </p>
  
--- 42673,42680 ----
  <p>
  All existing libraries I'm aware of, delegate to
  <tt>lower_bound</tt> (+ one further comparison). Since
! issue <a href="lwg-defects.html#384">384</a> has now WP status, the resolution of #787 should
! be brought in-line with <a href="lwg-defects.html#384">384</a> by changing the <tt>+ 2</tt>
  to <tt>+ O(1)</tt>.
  </p>
  
*************** Sophia Antipolis:
*** 41945,41955 ****
  ]</i></p>
  
  
! <blockquote>
  Alisdair prefers to apply an upper bound instead of O(1), but that would
  require fixing for <tt>lower_bound</tt>, <tt>upper_bound</tt> etc. as well. If he really
  cares about it, he'll send an issue to Howard.
! </blockquote>
  
  
  
--- 42683,42693 ----
  ]</i></p>
  
  
! <blockquote><p>
  Alisdair prefers to apply an upper bound instead of O(1), but that would
  require fixing for <tt>lower_bound</tt>, <tt>upper_bound</tt> etc. as well. If he really
  cares about it, he'll send an issue to Howard.
! </p></blockquote>
  
  
  
*************** cares about it, he'll send an issue to H
*** 41958,41977 ****
  Change 25.4.3.4 [binary.search]/3
  </p>
  
! <blockquote>
  <i>Complexity:</i> At most <tt>log<ins><sub>2</sub></ins>(last - first) + <del>2</del> <ins><i>O</i>(1)</ins></tt> comparisons.
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="788"></a>788. ambiguity in [istream.iterator]</h3>
! <p><b>Section:</b> 24.6.1 [istream.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-02-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.iterator">issues</a> in [istream.iterator].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 287</b></p>
--- 42696,42715 ----
  Change 25.4.3.4 [binary.search]/3
  </p>
  
! <blockquote><p>
  <i>Complexity:</i> At most <tt>log<ins><sub>2</sub></ins>(last - first) + <del>2</del> <ins><i>O</i>(1)</ins></tt> comparisons.
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="788"></a>788. Ambiguity in [istream.iterator]</h3>
! <p><b>Section:</b> 24.6.1 [istream.iterator] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-02-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.iterator">issues</a> in [istream.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 287</b></p>
*************** Change 25.4.3.4 [binary.search]/3
*** 41979,41985 ****
  <blockquote>
  <p>
  It is not clear what the initial state of an <tt>istream_iterator</tt> should be. Is
! _value_ initialized by reading the stream, or default/value initialized? If
  it is initialized by reading the stream, what happens if the initialization
  is deferred until first dereference, when ideally the iterator value should
  have been that of an end-of-stream iterator which is not safely
--- 42717,42723 ----
  <blockquote>
  <p>
  It is not clear what the initial state of an <tt>istream_iterator</tt> should be. Is
! _value_ initialized by reading the stream, or default&#47;value initialized? If
  it is initialized by reading the stream, what happens if the initialization
  is deferred until first dereference, when ideally the iterator value should
  have been that of an end-of-stream iterator which is not safely
*************** the iterator takes on the end-of-stream
*** 41995,42004 ****
  <p>
  The description of how an istream_iterator object becomes an
  end-of-stream iterator is a) ambiguous and b) out of date WRT
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#468">468</a>:
  </p>
  
! <blockquote>
  <tt>istream_iterator</tt> reads (using <tt>operator&gt;&gt;</tt>) successive elements from the
  input stream for which it was constructed. After it is constructed, and
  every time <tt>++</tt> is used, the iterator reads and stores a value of <tt>T</tt>. If
--- 42733,42742 ----
  <p>
  The description of how an istream_iterator object becomes an
  end-of-stream iterator is a) ambiguous and b) out of date WRT
! issue <a href="lwg-defects.html#468">468</a>:
  </p>
  
! <blockquote><p>
  <tt>istream_iterator</tt> reads (using <tt>operator&gt;&gt;</tt>) successive elements from the
  input stream for which it was constructed. After it is constructed, and
  every time <tt>++</tt> is used, the iterator reads and stores a value of <tt>T</tt>. If
*************** store things into istream iterators. The
*** 42014,42020 ****
  iterators is the fact that <tt>++</tt> operators are not equality preserving,
  that is, <tt>i == j</tt> does not guarantee at all that <tt>++i == ++j</tt>. Every time <tt>++</tt>
  is used a new value is read.
! </blockquote>
  
  <p>
  <tt>istream::operator void*()</tt> returns null if <tt>istream::fail()</tt> is <tt>true</tt>,
--- 42752,42758 ----
  iterators is the fact that <tt>++</tt> operators are not equality preserving,
  that is, <tt>i == j</tt> does not guarantee at all that <tt>++i == ++j</tt>. Every time <tt>++</tt>
  is used a new value is read.
! </p></blockquote>
  
  <p>
  <tt>istream::operator void*()</tt> returns null if <tt>istream::fail()</tt> is <tt>true</tt>,
*************** Summit:
*** 42036,42045 ****
  ]</i></p>
  
  
! <blockquote>
  Moved from Ready to Open for the purposes of using this issue to address NB UK 287.
  Martin to handle.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 42774,42783 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Ready to Open for the purposes of using this issue to address NB UK 287.
  Martin to handle.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** Move to Ready.
*** 42062,42068 ****
  Change 24.6.1 [istream.iterator]/1:
  </p>
  
! <blockquote>
  <tt>istream_iterator</tt> reads (using <tt>operator&gt;&gt;</tt>) successive elements from the
  input stream for which it was constructed. After it is constructed, and
  every time <tt>++</tt> is used, the iterator reads and stores a value of <tt>T</tt>. If
--- 42800,42806 ----
  Change 24.6.1 [istream.iterator]/1:
  </p>
  
! <blockquote><p>
  <tt>istream_iterator</tt> reads (using <tt>operator&gt;&gt;</tt>) successive elements from the
  input stream for which it was constructed. After it is constructed, and
  every time <tt>++</tt> is used, the iterator reads and stores a value of <tt>T</tt>. If
*************** store things into istream iterators. The
*** 42079,42085 ****
  iterators is the fact that <tt>++</tt> operators are not equality preserving,
  that is, <tt>i == j</tt> does not guarantee at all that <tt>++i == ++j</tt>. Every time <tt>++</tt>
  is used a new value is read.
! </blockquote>
  
  
  
--- 42817,42823 ----
  iterators is the fact that <tt>++</tt> operators are not equality preserving,
  that is, <tt>i == j</tt> does not guarantee at all that <tt>++i == ++j</tt>. Every time <tt>++</tt>
  is used a new value is read.
! </p></blockquote>
  
  
  
*************** is used a new value is read.
*** 42087,42096 ****
  
  <hr>
  <h3><a name="789"></a>789. <tt>xor_combine_engine(result_type)</tt> should be explicit</h3>
! <p><b>Section:</b> X [rand.adapt.xor] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.adapt.xor">issues</a> in [rand.adapt.xor].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>xor_combine_engine(result_type)</tt> should be <tt>explicit</tt>. (Obvious oversight.)
--- 42825,42834 ----
  
  <hr>
  <h3><a name="789"></a>789. <tt>xor_combine_engine(result_type)</tt> should be explicit</h3>
! <p><b>Section:</b> X [rand.adapt.xor] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.adapt.xor">issues</a> in [rand.adapt.xor].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>xor_combine_engine(result_type)</tt> should be <tt>explicit</tt>. (Obvious oversight.)
*************** Bellevue:
*** 42101,42114 ****
  ]</i></p>
  
  
! <blockquote>
  Non-controversial. Bill is right, but Fermilab believes that this is
  easy to use badly and hard to use right, and so it should be removed
  entirely. Got into TR1 by well defined route, do we have permission to
  remove stuff? Should probably check with Jens, as it is believed he is
  the originator. Broad consensus that this is not a robust engine
  adapter.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 42839,42852 ----
  ]</i></p>
  
  
! <blockquote><p>
  Non-controversial. Bill is right, but Fermilab believes that this is
  easy to use badly and hard to use right, and so it should be removed
  entirely. Got into TR1 by well defined route, do we have permission to
  remove stuff? Should probably check with Jens, as it is believed he is
  the originator. Broad consensus that this is not a robust engine
  adapter.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Remove X [rand.adapt.xor] <tt>xor_combin
*** 42125,42134 ****
  
  <hr>
  <h3><a name="792"></a>792. <tt>piecewise_constant_distribution</tt> is undefined for a range with just one endpoint</h3>
! <p><b>Section:</b> 26.5.8.5.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>piecewise_constant_distribution</tt> is undefined for a range with just one
--- 42863,42872 ----
  
  <hr>
  <h3><a name="792"></a>792. <tt>piecewise_constant_distribution</tt> is undefined for a range with just one endpoint</h3>
! <p><b>Section:</b> 26.5.8.6.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>piecewise_constant_distribution</tt> is undefined for a range with just one
*************** endpoint. (Probably should be the same a
*** 42138,42149 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.5.8.5.2 [rand.dist.samp.pconst] paragraph 3b:
  </p>
  
! <blockquote>
  b) If <tt>firstB == lastB</tt> <ins>or the sequence <tt>w</tt> has the length zero</ins>,
  </blockquote>
  
  
  
--- 42876,43437 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.5.8.6.2 [rand.dist.samp.pconst] paragraph 3b:
  </p>
  
! <blockquote><p>
  b) If <tt>firstB == lastB</tt> <ins>or the sequence <tt>w</tt> has the length zero</ins>,
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="793"></a>793. <tt>discrete_distribution</tt> missing constructor</h3>
+ <p><b>Section:</b> 26.5.8.6.1 [rand.dist.samp.discrete] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.discrete">issues</a> in [rand.dist.samp.discrete].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ <tt>discrete_distribution</tt> should have a constructor like:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;class _Fn&gt;
+   discrete_distribution(result_type _Count, double _Low, double _High,
+                         _Fn&amp; _Func);
+ </pre></blockquote>
+ 
+ <p>
+ (Makes it easier to fill a histogram with function values over a range.)
+ </p>
+ 
+ <p><i>[
+ Bellevue:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ How do you specify the function so that it does not return negative
+ values? If you do it is a bad construction. This requirement is already
+ there. Where in each bin does one evaluate the function? In the middle.
+ Need to revisit tomorrow.
+ </p></blockquote>
+ 
+ <p><i>[
+ Sophia Antipolis:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Bill is not requesting this.
+ </p>
+ <p>
+ Marc Paterno: <tt>_Fn</tt> cannot return negative values at the points where the
+ function is sampled. It is sampled in the middle of each bin. <tt>_Fn</tt> cannot
+ return 0 everywhere it is sampled.
+ </p>
+ <p>
+ Jens: lambda expressions are rvalues
+ </p>
+ <p>
+ Add a library issue to provide an
+ <tt>initializer_list&lt;double&gt;</tt> constructor for
+ <tt>discrete_distribution</tt>.
+ </p>
+ <p>
+ Marc Paterno: dislikes reference for <tt>_Fn</tt> parameter. Make it pass-by-value (to use lambda),
+ use <tt>std::ref</tt> to wrap giant-state function objects.
+ </p>
+ <p>
+ Daniel: See <tt>random_shuffle</tt>, pass-by-rvalue-reference.
+ </p>
+ <p>
+ Daniel to draft wording.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ Pre San Francisco, Daniel provided wording:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ The here proposed changes of the WP refer to the current state of
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf">N2691</a>.
+ During the Sophia Antipolis meeting two different proposals came up
+ regarding the functor argument type, either by value or by rvalue-reference.
+ For consistence with existing conventions (state-free algorithms and the
+ <tt>general_pdf_distribution</tt> c'tor signature) the author decided to propose a
+ function argument that is provided by value. If severe concerns exists that
+ stateful functions would be of dominant relevance, it should be possible to
+ replace the two occurrences of <tt>Func</tt> by <tt>Func&amp;&amp;</tt> in this proposal as part
+ of an editorial process.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <p><b>Non-concept version of the proposed resolution</b></p>
+ 
+ <ol>
+ <li>
+ <p>
+ In 26.5.8.6.1 [rand.dist.samp.discrete]/1, class <tt>discrete_distribution</tt>, just
+ <em>before</em> the member declaration
+ </p>
+ 
+ <blockquote><pre>
+ explicit discrete_distribution(const param_type&amp; parm);
+ </pre></blockquote>
+ 
+ <p>
+ insert:
+ </p>
+ 
+ 
+ <blockquote><pre>
+ template&lt;typename Func&gt;
+ discrete_distribution(result_type nf, double xmin, double xmax, Func fw);
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Between p.4 and p.5 insert a series of new paragraphs as part of the
+ new member description::
+ </p>
+ <blockquote><pre>
+ template&lt;typename Func&gt;
+ discrete_distribution(result_type nf, double xmin, double xmax, Func fw);
+ </pre>
+ 
+ <p>
+ <i>Complexity:</i> Exactly nf invocations of fw.
+ </p>
+ <p>
+ <i>Requires:</i>
+ </p>
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ fw shall be callable with one argument of type double, and shall
+ return values of a type convertible to double;</li>
+ 
+ <li>If nf &gt; 0, the relation <tt><i>x</i><sub><i>min</i></sub></tt> &lt; <tt><i>x</i><sub><i>max</i></sub></tt> shall hold, and for all sample values
+ <tt><i>x</i><sub><i>k</i></sub></tt>, fw(<tt><i>x</i><sub><i>k</i></sub></tt>) shall return a weight value <tt><i>w</i><sub><i>k</i></sub></tt> that is non-negative, non-NaN,
+ and non-infinity;</li>
+ 
+ <li>The following relations shall hold: nf &ge; 0, and 0 &lt; S = <tt><i>w</i><sub><i>0</i></sub></tt>+. . .+<tt><i>w<sub>n-1</sub></i></tt>.</li>
+ 
+ </ol>
+ 
+ <p>
+ <i>Effects:</i>
+ </p>
+ <ol style="list-style-type:lower-alpha">
+ <li>If nf == 0, sets n = 1 and lets the sequence w have length n = 1 and
+    consist of the single value <tt><i>w</i><sub><i>0</i></sub></tt> = 1.</li>
+ 
+ <li>
+ <p>Otherwise, sets n = nf, deltax = (<tt><i>x</i><sub><i>max</i></sub></tt> - <tt><i>x</i><sub><i>min</i></sub></tt>)/n 
+ and <tt><i>x</i><sub><i>cent</i></sub></tt> = <tt><i>x</i><sub><i>min</i></sub></tt> + 0.5 * deltax.</p>
+ <p>
+ For each k = 0, . . . ,n-1, calculates:</p>
+ <p>
+ <tt><i>x</i><sub><i>k</i></sub></tt> = <tt><i>x</i><sub><i>cent</i></sub></tt> + k * deltax
+ <tt><i>w</i><sub><i>k</i></sub></tt> = fw(<tt><i>x</i><sub><i>k</i></sub></tt>)
+ </p>
+ </li>
+ <li>
+ <p>Constructs a discrete_distribution object with probabilities:</p>
+ <blockquote><p>
+ <tt><i>p</i><sub><i>k</i></sub></tt> = <tt><i>w</i><sub><i>k</i></sub></tt>/S  for k = 0, . . . , n-1.
+ </p></blockquote>
+ </li>
+ </ol>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ <p><b>Concept version of the proposed resolution</b></p>
+ 
+ 
+ <ol>
+ <li>
+ <p>
+ In 26.5.8.6.1 [rand.dist.samp.discrete]/1, class <tt>discrete_distribution</tt>, just
+ <em>before</em> the member declaration
+ </p>
+ 
+ <blockquote><pre>
+ explicit discrete_distribution(const param_type&amp; parm);
+ </pre></blockquote>
+ 
+ <p>
+ insert:
+ </p>
+ 
+ 
+ <blockquote><pre>
+ template&lt;Callable&lt;auto, double&gt; Func&gt;
+  requires Convertible&lt;Func::result_type, double&gt;
+ discrete_distribution(result_type nf, double xmin, double xmax, Func fw);
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Between p.4 and p.5 insert a series of new paragraphs as part of the
+ new member description::
+ </p>
+ <blockquote><pre>
+ template&lt;Callable&lt;auto, double&gt; Func&gt;
+  requires Convertible&lt;Func::result_type, double&gt;
+ discrete_distribution(result_type nf, double xmin, double xmax, Func fw);
+ </pre>
+ 
+ <p>
+ <i>Complexity:</i> Exactly nf invocations of fw.
+ </p>
+ <p>
+ <i>Requires:</i>
+ </p>
+ <ol style="list-style-type:lower-alpha">
+ <li>If nf &gt; 0, the relation <tt><i>x</i><sub><i>min</i></sub></tt> &lt; <tt><i>x</i><sub><i>max</i></sub></tt> shall hold, and for all sample values
+ <tt><i>x</i><sub><i>k</i></sub></tt>, fw(<tt><i>x</i><sub><i>k</i></sub></tt>) shall return a weight value <tt><i>w</i><sub><i>k</i></sub></tt> that is non-negative, non-NaN,
+ and non-infinity;</li>
+ 
+ <li>The following relations shall hold: nf &ge; 0, and 0 &lt; S = <tt><i>w</i><sub><i>0</i></sub></tt>+. . .+<tt><i>w<sub>n-1</sub></i></tt>.</li>
+ 
+ </ol>
+ 
+ <p>
+ <i>Effects:</i>
+ </p>
+ <ol style="list-style-type:lower-alpha">
+ <li>If nf == 0, sets n = 1 and lets the sequence w have length n = 1 and
+    consist of the single value <tt><i>w</i><sub><i>0</i></sub></tt> = 1.</li>
+ 
+ <li>
+ <p>Otherwise, sets n = nf, deltax = (<tt><i>x</i><sub><i>max</i></sub></tt> - <tt><i>x</i><sub><i>min</i></sub></tt>)/n 
+ and <tt><i>x</i><sub><i>cent</i></sub></tt> = <tt><i>x</i><sub><i>min</i></sub></tt> + 0.5 * deltax.
+ <p/>
+ For each k = 0, . . . ,n-1, calculates:
+ <p/>
+ <tt><i>x</i><sub><i>k</i></sub></tt> = <tt><i>x</i><sub><i>cent</i></sub></tt> + k * deltax
+ <tt><i>w</i><sub><i>k</i></sub></tt> = fw(<tt><i>x</i><sub><i>k</i></sub></tt>)
+ </p>
+ </li>
+ <li>
+ <p>Constructs a discrete_distribution object with probabilities:</p>
+ <blockquote><p>
+ <tt><i>p</i><sub><i>k</i></sub></tt> = <tt><i>w</i><sub><i>k</i></sub></tt>/S  for k = 0, . . . , n-1.
+ </p></blockquote>
+ </li>
+ </ol>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p><p>
+ Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="794"></a>794. <tt>piecewise_constant_distribution</tt> missing constructor</h3>
+ <p><b>Section:</b> 26.5.8.6.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2008-02-09 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ <tt>piecewise_constant_distribution</tt> should have a constructor like:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;class _Fn&gt;
+    piecewise_constant_distribution(size_t _Count,
+             _Ty _Low, _Ty _High, _Fn&amp; _Func);
+ </pre></blockquote>
+ 
+ <p>
+ (Makes it easier to fill a histogram with function values over a range.
+ The two (reference <a href="lwg-defects.html#793">793</a>) make a sensible replacement for
+ <tt>general_pdf_distribution</tt>.)
+ </p>
+ 
+ <p><i>[
+ Sophia Antipolis:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Marc: uses variable width of bins and weight for each bin. This is not
+ giving enough flexibility to control both variables.
+ </p>
+ <p>
+ Add a library issue to provide an constructor taking an
+ <tt>initializer_list&lt;double&gt;</tt> and <tt>_Fn</tt> for <tt>piecewise_constant_distribution</tt>.
+ </p>
+ <p>
+ Daniel to draft wording.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ Pre San Francisco, Daniel provided wording.
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ The here proposed changes of the WP refer to the current state of
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf">N2691</a>.
+ For reasons explained in <a href="lwg-defects.html#793">793</a>, the author decided to propose a function
+ argument that is provided by value. The issue proposes a c'tor signature,
+ that does not take advantage of the full flexibility of
+ <tt>piecewise_constant_distribution</tt>,
+ because it restricts on a constant bin width, but the use-case seems to
+ be popular enough to justify it's introduction.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <p><b>Non-concept version of the proposed resolution</b></p>
+ 
+ <ol>
+ <li>
+ <p>
+ In 26.5.8.6.2 [rand.dist.samp.pconst]/1, class <tt>piecewise_constant_distribution</tt>,
+ just <em>before</em> the member declaration
+ </p>
+ 
+ <blockquote><pre>
+ explicit piecewise_constant_distribution(const param_type&amp; parm);
+ </pre></blockquote>
+ <p>
+ insert:
+ </p>
+ <blockquote><pre>
+ template&lt;typename Func&gt;
+ piecewise_constant_distribution(size_t nf, RealType xmin, RealType xmax, Func fw);
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Between p.4 and p.5 insert a new sequence of paragraphs nominated
+ below as [p5_1], [p5_2],
+ [p5_3], and [p5_4] as part of the new member description:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;typename Func&gt;
+ piecewise_constant_distribution(size_t nf, RealType xmin, RealType xmax, Func fw);
+ </pre>
+ <blockquote>
+ <p>
+ [p5_1] <i>Complexity:</i> Exactly <tt>nf</tt> invocations of <tt>fw</tt>.
+ </p>
+ <p>
+ [p5_2] <i>Requires:</i>
+ </p>
+ <ol style="list-style-type:lower-alpha">
+ <li><tt>fw</tt> shall be callable with one argument of type <tt>RealType</tt>, and shall
+ return values of a type convertible to double;
+ </li>
+ <li>
+ For all sample values <tt><i>x<sub>k</sub></i></tt> defined below, fw(<tt><i>x<sub>k</sub></i></tt>) shall return a weight
+ value <tt><i>w<sub>k</sub></i></tt> that is non-negative, non-NaN, and non-infinity;
+ </li>
+ <li>
+ The following relations shall hold: <tt><i>x<sub>min</sub></i></tt> &lt; <tt><i>x<sub>max</sub></i></tt>, and
+ 0 &lt; S = <tt><i>w<sub>0</sub></i></tt>+. . .+<tt><i>w<sub>n-1</sub></i></tt>.
+ </li>
+ </ol>
+ <p>
+ [p5_3] <i>Effects:</i>
+ </p>
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ <p>If nf == 0,</p>
+  <ol style="list-style-type:lower-alpha">
+  <li>
+ sets deltax = <tt><i>x<sub>max</sub></i></tt> - <tt><i>x<sub>min</sub></i></tt>, and</li>
+ <li> lets the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist of the single
+     value <tt><i>w<sub>0</sub></i></tt> = 1, and</li>
+ <li> lets the sequence <tt>b</tt> have length <tt>n+1</tt> with <tt><i>b<sub>0</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> and 
+               <tt><i>b<sub>1</sub></i></tt> = <tt><i>x<sub>max</sub></i></tt>
+ </li>
+ </ol>
+ </li>
+ <li>
+ <p>Otherwise,</p>
+ <ol style="list-style-type:lower-alpha">
+ <li> sets <tt>n = nf</tt>, <tt>deltax = </tt>(<tt><i>x<sub>max</sub></i></tt> - <tt><i>x<sub>min</sub></i></tt>)/n,
+                  <tt><i>x<sub>cent</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> + 0.5 * deltax, and
+ </li>
+ <li><p>lets the sequences <tt>w</tt> and <tt>b</tt> have length <tt>n</tt> and <tt>n+1</tt>, resp. and
+ <p/>
+ for each k = 0, . . . ,n-1, calculates:
+ <p/>
+   <tt><i>dx<sub>k</sub></i></tt> = k * deltax
+   <tt><i>b<sub>k</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> + <tt><i>dx<sub>k</sub></i></tt>
+   <tt><i>x<sub>k</sub></i></tt> = <tt><i>x<sub>cent</sub></i></tt> + <tt><i>dx<sub>k</sub></i></tt>
+   <tt><i>w<sub>k</sub></i></tt> = fw(<tt><i>x<sub>k</sub></i></tt>),
+ </p> 
+ <p> and</p>
+ </li>
+ <li> sets <tt><i>b<sub>n</sub></i></tt> = <tt><i>x<sub>max</sub></i></tt></li>
+ </ol>
+ </li>
+ <li>
+ <p>
+ Constructs a <tt>piecewise_constant_distribution</tt> object with
+ the above computed sequence <tt>b</tt> as the interval boundaries
+ and with the probability densities:
+ </p>
+ <blockquote><p>
+ <tt><i>&rho;<sub>k</sub></i></tt> = <tt><i>w<sub>k</sub></i></tt>/(S * deltax)  for k = 0, . . . , n-1.
+ </p></blockquote> 
+ </li>
+ </ol>
+ <p>
+ [p5_4] [<i>Note:</i> In this context, the subintervals [<tt><i>b<sub>k</sub></i></tt>, <tt><i>b<sub>k+1</sub></i></tt>) are commonly
+  known as the <i>bins</i> of a histogram. <i>-- end note</i>]
+  </p>
+ </blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ <p><b>Concept version of the proposed resolution</b></p>
+ 
+ <ol>
+ <li>
+ <p>
+ In 26.5.8.6.2 [rand.dist.samp.pconst]/1, class <tt>piecewise_constant_distribution</tt>,
+ just <em>before</em> the member declaration
+ </p>
+ 
+ <blockquote><pre>
+ explicit piecewise_constant_distribution(const param_type&amp; parm);
+ </pre></blockquote>
+ <p>
+ insert:
+ </p>
+ <blockquote><pre>
+ template&lt;Callable&lt;auto, RealType&gt; Func&gt;
+  requires Convertible&lt;Func::result_type, double&gt;
+ piecewise_constant_distribution(size_t nf, RealType xmin, RealType xmax, Func fw);
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Between p.4 and p.5 insert a new sequence of paragraphs nominated
+ below as [p5_1], [p5_2],
+ [p5_3], and [p5_4] as part of the new member description:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;Callable&lt;auto, RealType&gt; Func&gt;
+  requires Convertible&lt;Func::result_type, double&gt;
+ piecewise_constant_distribution(size_t nf, RealType xmin, RealType xmax, Func fw);
+ </pre>
+ <blockquote>
+ <p>
+ [p5_1] <i>Complexity:</i> Exactly <tt>nf</tt> invocations of <tt>fw</tt>.
+ </p>
+ <p>
+ [p5_2] <i>Requires:</i>
+ </p>
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ For all sample values <tt><i>x<sub>k</sub></i></tt> defined below, fw(<tt><i>x<sub>k</sub></i></tt>) shall return a weight
+ value <tt><i>w<sub>k</sub></i></tt> that is non-negative, non-NaN, and non-infinity;
+ </li>
+ <li>
+ The following relations shall hold: <tt><i>x<sub>min</sub></i></tt> &lt; <tt><i>x<sub>max</sub></i></tt>, and
+ 0 &lt; S = <tt><i>w<sub>0</sub></i></tt>+. . .+<tt><i>w<sub>n-1</sub></i></tt>.
+ </li>
+ </ol>
+ <p>
+ [p5_3] <i>Effects:</i>
+ </p>
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ <p>If nf == 0,</p>
+  <ol style="list-style-type:lower-alpha">
+  <li>
+ sets deltax = <tt><i>x<sub>max</sub></i></tt> - <tt><i>x<sub>min</sub></i></tt>, and</li>
+ <li> lets the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist of the single
+     value <tt><i>w<sub>0</sub></i></tt> = 1, and</li>
+ <li> lets the sequence <tt>b</tt> have length <tt>n+1</tt> with <tt><i>b<sub>0</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> and 
+               <tt><i>b<sub>1</sub></i></tt> = <tt><i>x<sub>max</sub></i></tt>
+ </li>
+ </ol>
+ </li>
+ <li>
+ <p>Otherwise,</p>
+ <ol style="list-style-type:lower-alpha">
+ <li> sets <tt>n = nf</tt>, <tt>deltax = </tt>(<tt><i>x<sub>max</sub></i></tt> - <tt><i>x<sub>min</sub></i></tt>)/n,
+                  <tt><i>x<sub>cent</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> + 0.5 * deltax, and
+ </li>
+ <li><p>lets the sequences <tt>w</tt> and <tt>b</tt> have length <tt>n</tt> and <tt>n+1</tt>, resp. and
+ <p/>
+ for each k = 0, . . . ,n-1, calculates:
+   <tt><i>dx<sub>k</sub></i></tt> = k * deltax
+   <tt><i>b<sub>k</sub></i></tt> = <tt><i>x<sub>min</sub></i></tt> + <tt><i>dx<sub>k</sub></i></tt>
+   <tt><i>x<sub>k</sub></i></tt> = <tt><i>x<sub>cent</sub></i></tt> + <tt><i>dx<sub>k</sub></i></tt>
+   <tt><i>w<sub>k</sub></i></tt> = fw(<tt><i>x<sub>k</sub></i></tt>),
+ </p> 
+ <p> and</p>
+ </li>
+ <li> sets <tt><i>b<sub>n</sub></i></tt> = <tt><i>x<sub>max</sub></i></tt></li>
+ </ol>
+ </li>
+ <li>
+ <p>
+ Constructs a <tt>piecewise_constant_distribution</tt> object with
+ the above computed sequence <tt>b</tt> as the interval boundaries
+ and with the probability densities:
+ </p>
+ <blockquote><p>
+ <tt><i>&rho;<sub>k</sub></i></tt> = <tt><i>w<sub>k</sub></i></tt>/(S * deltax)  for k = 0, . . . , n-1.
+ </p></blockquote> 
+ </li>
+ </ol>
+ <p>
+ [p5_4] [<i>Note:</i> In this context, the subintervals [<tt><i>b<sub>k</sub></i></tt>, <tt><i>b<sub>k+1</sub></i></tt>) are commonly
+  known as the <i>bins</i> of a histogram. <i>-- end note</i>]
+  </p>
+ </blockquote>
  </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> 
+ "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
+ </p>
  
  
  
*************** b) If <tt>firstB == lastB</tt> <ins>or t
*** 42151,42165 ****
  
  <hr>
  <h3><a name="798"></a>798. Refactoring of binders lead to interface breakage</h3>
! <p><b>Section:</b> D.11 [depr.lib.binders] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-02-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#depr.lib.binders">issues</a> in [depr.lib.binders].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2521.pdf">N2521</a>
  and its earlier predecessors have moved the old binders from
! [lib.binders] to D.11 [depr.lib.binders] thereby introducing some renaming
  of the template parameter names (<tt>Operation -&gt; Fn</tt>). During this
  renaming process the <em>protected</em> data member <tt>op</tt> was also renamed to
  <tt>fn</tt>, which seems as an unnecessary interface breakage to me - even if
--- 43439,43453 ----
  
  <hr>
  <h3><a name="798"></a>798. Refactoring of binders lead to interface breakage</h3>
! <p><b>Section:</b> X [depr.lib.binders] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-02-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.lib.binders">issues</a> in [depr.lib.binders].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2521.pdf">N2521</a>
  and its earlier predecessors have moved the old binders from
! [lib.binders] to X [depr.lib.binders] thereby introducing some renaming
  of the template parameter names (<tt>Operation -&gt; Fn</tt>). During this
  renaming process the <em>protected</em> data member <tt>op</tt> was also renamed to
  <tt>fn</tt>, which seems as an unnecessary interface breakage to me - even if
*************** this user access point is probably rarel
*** 42169,42179 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change D.11.1 [depr.lib.binder.1st]:
  </p>
  
  <blockquote>
! <pre>template &lt;class Fn&gt; 
  class binder1st 
    : public unary_function&lt;typename Fn::second_argument_type, 
                            typename Fn::result_type&gt; { 
--- 43457,43468 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change  [depr.lib.binder.1st]:
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Fn&gt; 
  class binder1st 
    : public unary_function&lt;typename Fn::second_argument_type, 
                            typename Fn::result_type&gt; { 
*************** public:
*** 42201,42211 ****
  </blockquote>
  
  <p>
! Change D.11.3 [depr.lib.binder.2nd]:
  </p>
  
  <blockquote>
! <pre>template &lt;class Fn&gt; 
  class binder2nd
    : public unary_function&lt;typename Fn::first_argument_type, 
                            typename Fn::result_type&gt; { 
--- 43490,43501 ----
  </blockquote>
  
  <p>
! Change  [depr.lib.binder.2nd]:
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Fn&gt; 
  class binder2nd
    : public unary_function&lt;typename Fn::first_argument_type, 
                            typename Fn::result_type&gt; { 
*************** public:
*** 42238,42248 ****
  
  
  <hr>
  <h3><a name="801"></a>801. <tt>tuple</tt> and <tt>pair</tt> trivial members</h3>
! <p><b>Section:</b> 20.4 [tuple] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-02-18 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple">issues</a> in [tuple].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Classes with trivial special member functions are inherently more
--- 43528,43623 ----
  
  
  <hr>
+ <h3><a name="800"></a>800. Issues in 26.4.7.1 [rand.util.seedseq](6)</h3>
+ <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Stephan Tolksdorf <b>Opened:</b> 2008-02-18 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The for-loop in the algorithm specification has <tt>n</tt> iterations, where <tt>n</tt> is
+ defined to be <tt>end - begin</tt>, i.e. the number of supplied w-bit quantities.
+ Previous versions of this algorithm and the general logic behind it
+ suggest that this is an oversight and that in the context of the
+ for-loop <tt>n</tt> should be the number of full 32-bit quantities in <tt>b</tt> (rounded
+ upwards). If <tt>w</tt> is 64, the current algorithm throws away half of all bits
+ in <tt>b</tt>. If <tt>w</tt> is 16, the current algorithm sets half of all elements in <tt>v</tt>
+ to 0.
+ </p>
+ 
+ <p>
+ There are two more minor issues:
+ </p>
+ 
+ <ul>
+ <li>
+ Strictly speaking <tt>end - begin</tt> is not defined since
+ <tt>InputIterator</tt> is not required to be a random access iterator.
+ </li>
+ <li>
+ Currently all integral types are allowed as input to the <tt>seed_seq</tt>
+ constructor, including <tt>bool</tt>. IMHO allowing <tt>bool</tt>s unnecessarily
+ complicates the implementation without any real benefit to the user.
+ I'd suggest to exclude <tt>bool</tt>s as input.
+ </li>
+ </ul>
+ 
+ <p><i>[
+ Bellevue:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to Open: Bill will try to propose a resolution by the next meeting.
+ </p></blockquote>
+ 
+ <p><i>[
+ post Bellevue:  Bill provided wording.
+ ]</i></p>
+ 
+ 
+ <p>
+ This issue is made moot if <a href="lwg-defects.html#803">803</a> is accepted.
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Replace 26.5.7.1 [rand.util.seedseq] paragraph 6 with:
+ </p>
+ 
+ <blockquote>
+ <p>
+ <i>Effects:</i> Constructs a <tt>seed_seq</tt> object by effectively concatenating the
+ low-order <tt>u</tt> bits of each of the elements of the supplied sequence <tt>[begin,
+ end)</tt> in ascending order of significance to make a (possibly very large) unsigned
+ binary number <tt>b</tt> having a total of <tt>n</tt> bits, and then carrying out the
+ following algorithm:
+ </p>
+ 
+ <blockquote><p style="white-space: pre;">
+ for( v.clear(); n &gt; 0; n -= 32 )
+    v.push_back(b mod 2<sup>32</sup>), b /= 2<sup>32</sup>;
+ </p></blockquote>
+ </blockquote>
+ 
+ 
+ <p><b>Rationale:</b></p><p>
+ Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> 
+ "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="801"></a>801. <tt>tuple</tt> and <tt>pair</tt> trivial members</h3>
! <p><b>Section:</b> 20.4 [tuple] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-02-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple">issues</a> in [tuple].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Classes with trivial special member functions are inherently more
*************** which prevents static initialization of
*** 42271,42277 ****
  types are statically initializable.  Changing the definition to
  </p>
  
! <blockquote><pre>pair() = default;
  </pre></blockquote>
  
  <p>
--- 43646,43653 ----
  types are statically initializable.  Changing the definition to
  </p>
  
! <blockquote><pre>
! pair() = default;
  </pre></blockquote>
  
  <p>
*************** passing <tt>tuples</tt> in registers, th
*** 42294,42300 ****
  make explicitly <tt>default</tt>ed.  The new declarations are:
  </p>
  
! <blockquote><pre>tuple() = default;
  tuple(const tuple&amp;) = default;
  </pre></blockquote>
  
--- 43670,43677 ----
  make explicitly <tt>default</tt>ed.  The new declarations are:
  </p>
  
! <blockquote><pre>
! tuple() = default;
  tuple(const tuple&amp;) = default;
  </pre></blockquote>
  
*************** tabled until Alisdair's proposals are di
*** 42339,42357 ****
  ]</i></p>
  
  
! <blockquote>
! This is partly solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1117">1117</a>.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Wait for dust to settle from fixing exception safety problem
  with rvalue refs.
! </blockquote>
  
  <p><i>[
  2009-07-20 Alisdair adds:
--- 43716,43734 ----
  ]</i></p>
  
  
! <blockquote><p>
! This is partly solved by <a href="lwg-defects.html#1117">1117</a>.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Wait for dust to settle from fixing exception safety problem
  with rvalue refs.
! </p></blockquote>
  
  <p><i>[
  2009-07-20 Alisdair adds:
*************** implied in the process (even if elided).
*** 42388,42396 ****
  ]</i></p>
  
  
! <blockquote>
  Leave as open. Alisdair to provide wording.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
--- 43765,43773 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave as open. Alisdair to provide wording.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
*************** constexpr default constructors, but we'r
*** 42410,42454 ****
  ]</i></p>
  
  
  <blockquote>
! Daniel believes his pair/tuple paper will resolve this issue. <tt>constexpr</tt> will allow static initialization, and he is already changing the move and copy constructors to be defaulted.
  </blockquote>
  
  <p><i>[
! 2010-10-24 Daniel adds:
  ]</i></p>
  
  
  <blockquote>
! The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> should resolve this issue.
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
  </p>
  
  
  
  
  
  <hr>
  <h3><a name="804"></a>804. Some problems with classes <tt>error_code</tt>/<tt>error_condition</tt></h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-02-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <ol type="A">
  <li>
  <p>
  19.5.2.1 [syserr.errcode.overview]/1, class <tt>error_code</tt> and
  19.5.3.1 [syserr.errcondition.overview]/, class <tt>error_condition</tt> synopses
  declare an expository data member <tt>cat_</tt>:
  </p>
! <blockquote><pre>const error_category&amp; cat_; // exposition only
  </pre></blockquote>
  <p>
  which is used to define the semantics of several members. The decision
--- 43787,44092 ----
  ]</i></p>
  
  
+ <blockquote><p>
+ Daniel believes his pair&#47;tuple paper will resolve this issue. <tt>constexpr</tt> 
+ will allow static initialization, and he is already changing the move and copy 
+ constructors to be defaulted.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010-10-24 Daniel adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ The proposed resolution of 
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> 
+ should resolve this issue.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="803"></a>803. Simplification of <tt>seed_seq::seq_seq</tt></h3>
+ <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Charles Karney <b>Opened:</b> 2008-02-22 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ <tt>seed_seq(InputIterator begin, InputIterator end);</tt> constructs a <tt>seed_seq</tt>
+ object repacking the bits of supplied sequence <tt>[begin, end)</tt> into a
+ 32-bit vector.
+ </p>
+ <p>
+ This repacking triggers several problems:
+ </p>
+ <ol>
+ <li>
+ Distinctness of the output of <tt>seed_seq::generate</tt> required the
+ introduction of the initial "<tt>if (w &lt; 32) v.push_back(n);</tt>"  (Otherwise
+ the unsigned short vectors [1, 0] and [1] generate the same sequence.)
+ </li>
+ <li>
+ Portability demanded the introduction of the template parameter <tt>u</tt>.
+ (Otherwise some sequences could not be obtained on computers where no
+ integer types are exactly 32-bits wide.)
+ </li>
+ <li>
+ The description and algorithm have become unduly complicated.
+ </li>
+ </ol>
+ <p>
+ I propose simplifying this <tt>seed_seq</tt> constructor to be "32-bit only".
+ Despite it's being simpler, there is NO loss of functionality (see
+ below).
+ </p>
+ <p>
+ Here's how the description would read
+ </p>
  <blockquote>
! <p>
! 26.5.7.1 [rand.util.seedseq] Class <tt>seed_seq</tt>
! </p>
! 
! <blockquote>
! <pre>
! template&lt;class InputIterator&gt;
!   seed_seq(InputIterator begin, InputIterator end);
! </pre>
! <blockquote>
! <p>
! 5 <i>Requires:</i> NO CHANGE
! </p>
! <p>
! 6 <i>Effects:</i> Constructs a <tt>seed_seq</tt> object by
! </p>
! <blockquote><p style="white-space: pre;">
! for (InputIterator s = begin; s != end; ++s)
!    v.push_back((*s) mod 2<sup>32</sup>);
! </p></blockquote>
! </blockquote>
! </blockquote>
  </blockquote>
  
+ <p>
+ Discussion:
+ </p>
+ <p>
+ The chief virtues here are simplicity, portability, and generality.
+ </p>
+ <ul>
+ <li>
+ Simplicity &mdash; compare the above specification with the
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a> proposal.
+ </li>
+ <li>
+ Portability &mdash; with <tt>iterator_traits&lt;InputIterator&gt;::value_type =
+ uint_least32_t</tt> the user is guaranteed to get the same behavior across
+ platforms.
+ </li>
+ <li>
+ Generality &mdash; any behavior that the
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
+ proposal can achieve can be
+ obtained with this simpler proposal (albeit with a shuffling of bits
+ in the input sequence).
+ </li>
+ </ul>
+ <p>
+ Arguments (and counter-arguments) against making this change (and
+ retaining the
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
+ behavior) are:
+ </p>
+ <ul>
+ <li>
+ <p>
+ The user can pass an array of <tt>unsigned char</tt> and <tt>seed_seq</tt> will nicely
+  repack it.
+ </p>
+ <p>
+  Response: So what?  Consider the seed string "ABC".  The
+  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
+  proposal results in
+ </p>
+ <blockquote><pre>
+ v = { 0x3, 0x434241 };
+ </pre></blockquote>
+ <p>
+ while the simplified proposal yields
+ </p>
+ <blockquote><pre>
+ v = { 0x41, 0x42, 0x43 };
+ </pre></blockquote>
+ <p>
+ The results produced by <tt>seed_seq::generate</tt> with the two inputs are
+ different but nevertheless equivalently "mixed up" and this remains
+ true even if the seed string is long.
+ </p>
+ </li>
+ <li>
+ <p>
+ With long strings (e.g., with bit-length comparable to the number of
+  bits in the state), <tt>v</tt> is longer (by a factor of 4) with the simplified
+  proposal and <tt>seed_seq::generate</tt> will be slower.
+ </p>
+ <p>
+ Response: It's unlikely that the efficiency of <tt>seed_seq::generate</tt> will
+  be a big issue.  If it is, the user is free to repack the seed vector
+  before constructing <tt>seed_seq</tt>.
+ </p>
+ </li>
+ <li>
+ <p>
+ A user can pass an array of 64-bit integers and all the bits will be
+  used.
+ </p>
+ <p>
+  Response: Indeed.  However, there are many instances in the 
+  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
+  where integers are silently coerced to a narrower width and this
+  should just be a case of the user needing to read the documentation.
+  The user can of course get equivalent behavior by repacking his seed
+  into 32-bit pieces.  Furthermore, the unportability of the 
+  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf">n2461</a>
+  proposal with
+ </p>
+ <blockquote><pre>
+ unsigned long s[] = {1, 2, 3, 4};
+ seed_seq q(s, s+4);
+ </pre></blockquote>
+ <p>
+  which typically results in <tt>v = {1, 2, 3, 4}</tt> on 32-bit machines and in
+ <tt>v = {1, 0, 2, 0, 3, 0, 4, 0}</tt> on 64-bit machines is a major pitfall for
+  unsuspecting users.
+ </p>
+ </li>
+ </ul>
+ 
+ <p>
+ Note: this proposal renders moot issues <a href="lwg-defects.html#782">782</a> and <a href="lwg-defects.html#800">800</a>.
+ </p>
+ 
  <p><i>[
! Bellevue:
! ]</i></p>
! 
! 
! <blockquote><p>
! Walter needs to ask Fermilab for guidance. Defer till tomorrow. Bill likes the proposed resolution.
! </p></blockquote>
! 
! <p><i>[
! Sophia Antipolis:
  ]</i></p>
  
  
  <blockquote>
! <p>
! Marc Paterno wants portable behavior between 32bit and 64bit machines;
! we've gone to significant trouble to support portability of engines and
! their values.
! </p>
! <p>
! Jens: the new algorithm looks perfectly portable
! </p>
! <p>
! Marc Paterno to review off-line.
! </p>
! <p>
! Modify the proposed resolution to read "Constructs a seed_seq object by the following algorithm ..."
! </p>
! <p>
! Disposition: move to review; unanimous consent.
! </p>
! <p>
! (moots <a href="lwg-defects.html#782">782</a> and <a href="lwg-defects.html#800">800</a>)
! </p>
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.5.7.1 [rand.util.seedseq]:
! </p>
! 
! <blockquote>
! <pre>
! template&lt;class InputIterator<del>, 
!   size_t u = numeric_limits&lt;iterator_traits&lt;InputIterator&gt;::value_type&gt;::digits</del>&gt;
!   seed_seq(InputIterator begin, InputIterator end);
! </pre>
! <blockquote>
! <p>
! -5- <i>Requires:</i> <tt>InputIterator</tt> shall satisfy the requirements of an input iterator (24.1.1)
! such that <tt>iterator_traits&lt;InputIterator&gt;::value_type</tt> shall denote an integral type.
! </p>
! <p>
! -6- Constructs a <tt>seed_seq</tt> object by <ins>the following algorithm</ins> <del>rearranging some or all of the bits of the supplied sequence
! <tt>[begin,end)</tt> of w-bit quantities into 32-bit units, as if by the following: </del>
! </p>
! <p>
! <del>First extract the rightmost <tt>u</tt> bits from each of the <tt>n = end
! - begin</tt> elements of the supplied sequence and concatenate all the
! extracted bits to initialize a single (possibly very large) unsigned
! binary number, <tt>b = &sum;<sup>n-1</sup><sub>i=0</sub> (begin[i] 
! mod 2<sup>u</sup>) &middot; 2<sup>w&middot;i</sup></tt> (in which the bits of each <tt>begin[i]</tt>
! are treated as denoting an unsigned quantity). Then carry out 
! the following algorithm:</del>
  </p>
+ <blockquote><p style="white-space: pre;"><del>
+ v.clear(); 
+ if ($w$ &lt; 32) 
+   v.push_back($n$); 
+ for( ; $n$ &gt; 0; --$n$) 
+   v.push_back(b mod 2<sup>32</sup>), b /= 2<sup>32</sup>;
+ </del></p></blockquote>
+ <blockquote>
+ <p style="white-space: pre;"><ins>
+ for (InputIterator s = begin; s != end; ++s)
+    v.push_back((*s) mod 2<sup>32</sup>);
+ </ins></p>
+ </blockquote>
+ </blockquote>
+ </blockquote>
  
  
+ <p><b>Rationale:</b></p><p>
+ Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> 
+ "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
+ </p>
+ 
  
  
  
  <hr>
  <h3><a name="804"></a>804. Some problems with classes <tt>error_code</tt>/<tt>error_condition</tt></h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-02-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
! <ol style="list-style-type:upper-alpha">
  <li>
  <p>
  19.5.2.1 [syserr.errcode.overview]/1, class <tt>error_code</tt> and
  19.5.3.1 [syserr.errcondition.overview]/, class <tt>error_condition</tt> synopses
  declare an expository data member <tt>cat_</tt>:
  </p>
! <blockquote><pre>
! const error_category&amp; cat_; // exposition only
  </pre></blockquote>
  <p>
  which is used to define the semantics of several members. The decision
*************** The member function <tt>message</tt> thr
*** 42486,42492 ****
  19.5.3.4 [syserr.errcondition.observers]/6) guarantee "throws nothing",
  although
  they return a <tt>std::string</tt> by value, which might throw in out-of-memory
! conditions (see related issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#771">771</a>).
  </li>
  </ol>
  
--- 44124,44130 ----
  19.5.3.4 [syserr.errcondition.observers]/6) guarantee "throws nothing",
  although
  they return a <tt>std::string</tt> by value, which might throw in out-of-memory
! conditions (see related issue <a href="lwg-defects.html#771">771</a>).
  </li>
  </ol>
  
*************** Sophia Antipolis:
*** 42497,42510 ****
  
  <blockquote>
  <p>
! Part A: NAD (editorial), cleared by the resolution of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>.
  </p>
  <p>
  Part B: Technically correct, save for typo. Rendered moot by the concept proposal 
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2620.html">N2620</a>) NAD (editorial).
  </p>
  <p>
! Part C: We agree; this is consistent with the resolution of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#721">721</a>.
  </p>
  <p>
  Howard: please ping Beman, asking him to clear away parts A and B from
--- 44135,44148 ----
  
  <blockquote>
  <p>
! Part A: NAD (editorial), cleared by the resolution of issue <a href="lwg-closed.html#832">832</a>.
  </p>
  <p>
  Part B: Technically correct, save for typo. Rendered moot by the concept proposal 
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2620.html">N2620</a>) NAD (editorial).
  </p>
  <p>
! Part C: We agree; this is consistent with the resolution of issue <a href="lwg-closed.html#721">721</a>.
  </p>
  <p>
  Howard: please ping Beman, asking him to clear away parts A and B from
*************** the wording in the proposed resolution,
*** 42512,42518 ****
  what needs to be applied to the working paper.
  </p>
  <p>
! Beman provided updated wording. Since issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a> is not going
  forward, the provided wording includes resolution of part A.
  </p>
  </blockquote>
--- 44150,44156 ----
  what needs to be applied to the working paper.
  </p>
  <p>
! Beman provided updated wording. Since issue <a href="lwg-closed.html#832">832</a> is not going
  forward, the provided wording includes resolution of part A.
  </p>
  </blockquote>
*************** Resolution of part A:
*** 42529,42535 ****
  Change 19.5.2.1 [syserr.errcode.overview] Class error_code overview synopsis as indicated:
  </p>
  
! <blockquote><pre>private:
    int val_;                    // exposition only
    const error_category<del>&amp;</del><ins>*</ins> cat_; // exposition only
  </pre></blockquote>
--- 44167,44174 ----
  Change 19.5.2.1 [syserr.errcode.overview] Class error_code overview synopsis as indicated:
  </p>
  
! <blockquote><pre>
! private:
    int val_;                    // exposition only
    const error_category<del>&amp;</del><ins>*</ins> cat_; // exposition only
  </pre></blockquote>
*************** Change 19.5.2.2 [syserr.errcode.construc
*** 42539,42545 ****
  </p>
  
  <blockquote>
! <pre>error_code();
  </pre>
  <blockquote>
  <p>
--- 44178,44185 ----
  </p>
  
  <blockquote>
! <pre>
! error_code();
  </pre>
  <blockquote>
  <p>
*************** Change 19.5.2.2 [syserr.errcode.construc
*** 42552,42558 ****
  <i>Throws:</i> Nothing.
  </p>
  </blockquote>
! <pre>error_code(int val, const error_category&amp; cat);
  </pre>
  <blockquote>
  <p>
--- 44192,44199 ----
  <i>Throws:</i> Nothing.
  </p>
  </blockquote>
! <pre>
! error_code(int val, const error_category&amp; cat);
  </pre>
  <blockquote>
  <p>
*************** Change 19.5.2.3 [syserr.errcode.modifier
*** 42572,42578 ****
  </p>
  
  <blockquote>
! <pre>void assign(int val, const error_category&amp; cat);
  </pre>
  <blockquote>
  <p>
--- 44213,44220 ----
  </p>
  
  <blockquote>
! <pre>
! void assign(int val, const error_category&amp; cat);
  </pre>
  <blockquote>
  <p>
*************** Change 19.5.2.3 [syserr.errcode.modifier
*** 42588,42596 ****
  Change 19.5.2.4 [syserr.errcode.observers] Class error_code observers as indicated:
  </p>
  
! <blockquote>
  const error_category&amp; category() const;
! <blockquote>
  <p>
  <i>Returns:</i> <tt><ins>*</ins>cat_</tt>.
  </p>
--- 44230,44238 ----
  Change 19.5.2.4 [syserr.errcode.observers] Class error_code observers as indicated:
  </p>
  
! <blockquote><pre>
  const error_category&amp; category() const;
! </pre><blockquote>
  <p>
  <i>Returns:</i> <tt><ins>*</ins>cat_</tt>.
  </p>
*************** const error_category&amp; category() con
*** 42604,42610 ****
  Change 19.5.3.1 [syserr.errcondition.overview] Class error_condition overview synopsis as indicated:
  </p>
  
! <blockquote><pre>private:
    int val_;                    // exposition only
    const error_category<del>&amp;</del><ins>*</ins> cat_; // exposition only
  </pre></blockquote>
--- 44246,44253 ----
  Change 19.5.3.1 [syserr.errcondition.overview] Class error_condition overview synopsis as indicated:
  </p>
  
! <blockquote><pre>
! private:
    int val_;                    // exposition only
    const error_category<del>&amp;</del><ins>*</ins> cat_; // exposition only
  </pre></blockquote>
*************** Change 19.5.3.1 [syserr.errcondition.ove
*** 42613,42626 ****
  Change 19.5.3.2 [syserr.errcondition.constructors] Class error_condition constructors as indicated:
  </p>
  <p><i>[
! (If the proposed resolution of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#805">805</a> has already been applied, the
  name <tt>posix_category</tt> will have been changed to <tt>generic_category</tt>. That has
  no effect on this resolution.)
  ]</i></p>
  
  
  <blockquote>
! <pre>error_condition();
  </pre>
  <blockquote>
  <p>
--- 44256,44270 ----
  Change 19.5.3.2 [syserr.errcondition.constructors] Class error_condition constructors as indicated:
  </p>
  <p><i>[
! (If the proposed resolution of issue <a href="lwg-defects.html#805">805</a> has already been applied, the
  name <tt>posix_category</tt> will have been changed to <tt>generic_category</tt>. That has
  no effect on this resolution.)
  ]</i></p>
  
  
  <blockquote>
! <pre>
! error_condition();
  </pre>
  <blockquote>
  <p>
*************** no effect on this resolution.)
*** 42633,42639 ****
  <i>Throws:</i> Nothing.
  </p>
  </blockquote>
! <pre>error_condition(int val, const error_category&amp; cat);
  </pre>
  <blockquote>
  <p>
--- 44277,44284 ----
  <i>Throws:</i> Nothing.
  </p>
  </blockquote>
! <pre>
! error_condition(int val, const error_category&amp; cat);
  </pre>
  <blockquote>
  <p>
*************** no effect on this resolution.)
*** 42652,42660 ****
  Change 19.5.3.3 [syserr.errcondition.modifiers] Class error_condition modifiers as indicated:
  </p>
  
! <blockquote>
  void assign(int val, const error_category&amp; cat);
! <blockquote>
  <p>
  <i>Postconditions:</i> <tt>val_ == val</tt> and <tt>cat_ == <ins>&amp;</ins>cat</tt>.
  </p>
--- 44297,44305 ----
  Change 19.5.3.3 [syserr.errcondition.modifiers] Class error_condition modifiers as indicated:
  </p>
  
! <blockquote><pre>
  void assign(int val, const error_category&amp; cat);
! </pre><blockquote>
  <p>
  <i>Postconditions:</i> <tt>val_ == val</tt> and <tt>cat_ == <ins>&amp;</ins>cat</tt>.
  </p>
*************** void assign(int val, const error_categor
*** 42668,42676 ****
  Change 19.5.3.4 [syserr.errcondition.observers] Class error_condition observers as indicated:
  </p>
  
! <blockquote>
  const error_category&amp; category() const;
! <blockquote>
  <p>
  <i>Returns:</i> <tt><ins>*</ins>cat_</tt>.
  </p>
--- 44313,44321 ----
  Change 19.5.3.4 [syserr.errcondition.observers] Class error_condition observers as indicated:
  </p>
  
! <blockquote><pre>
  const error_category&amp; category() const;
! </pre><blockquote>
  <p>
  <i>Returns:</i> <tt><ins>*</ins>cat_</tt>.
  </p>
*************** In 19.5.1.2 [syserr.errcat.virtuals], re
*** 42692,42698 ****
  </p>
  
  <blockquote>
! <pre>virtual string message(int ev) const = 0;
  </pre>
  
  <blockquote>
--- 44337,44344 ----
  </p>
  
  <blockquote>
! <pre>
! virtual string message(int ev) const = 0;
  </pre>
  
  <blockquote>
*************** In 19.5.2.4 [syserr.errcode.observers],
*** 42710,42716 ****
  </p>
  
  <blockquote>
! <pre>string message() const;
  </pre>
  <blockquote>
  <p>
--- 44356,44363 ----
  </p>
  
  <blockquote>
! <pre>
! string message() const;
  </pre>
  <blockquote>
  <p>
*************** In 19.5.3.4 [syserr.errcondition.observe
*** 42727,42733 ****
  </p>
  
  <blockquote>
! <pre>string message() const;
  </pre>
  <blockquote>
  <p>
--- 44374,44381 ----
  </p>
  
  <blockquote>
! <pre>
! string message() const;
  </pre>
  <blockquote>
  <p>
*************** In 19.5.3.4 [syserr.errcondition.observe
*** 42748,42770 ****
  
  <hr>
  <h3><a name="805"></a>805. <tt>posix_error::posix_errno</tt> concerns</h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2008-02-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  19.5 [syserr]
  </p>
  
! <blockquote><pre>namespace posix_error {
    enum posix_errno {
      address_family_not_supported, // EAFNOSUPPORT
      ...
  </pre></blockquote>
  
  <p>
! should rather use the new scoped-enum  facility (7.2 [dcl.enum]),
  which would avoid the necessity for a new <tt>posix_error</tt>
  namespace, if I understand correctly.
  </p>
--- 44396,44419 ----
  
  <hr>
  <h3><a name="805"></a>805. <tt>posix_error::posix_errno</tt> concerns</h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2008-02-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  19.5 [syserr]
  </p>
  
! <blockquote><pre>
! namespace posix_error {
    enum posix_errno {
      address_family_not_supported, // EAFNOSUPPORT
      ...
  </pre></blockquote>
  
  <p>
! should rather use the new scoped-enum facility (7.2 [dcl.enum]),
  which would avoid the necessity for a new <tt>posix_error</tt>
  namespace, if I understand correctly.
  </p>
*************** The wording for the Proposed resolution
*** 42796,42802 ****
  Change System error support 19.5 [syserr] as indicated:
  </p>
  
! <blockquote><pre><del>namespace posix_error {</del>
    enum <del>posix_errno</del> <ins>class errc</ins> {
      address_family_not_supported, // EAFNOSUPPORT
      ...
--- 44445,44452 ----
  Change System error support 19.5 [syserr] as indicated:
  </p>
  
! <blockquote><pre>
! <del>namespace posix_error {</del>
    enum <del>posix_errno</del> <ins>class errc</ins> {
      address_family_not_supported, // EAFNOSUPPORT
      ...
*************** template &lt;&gt; struct is_error_condit
*** 42817,42828 ****
  Change System error support 19.5 [syserr] :
  </p>
  
! <blockquote>
  <del>The <tt>is_error_code_enum</tt> and <tt>is_error_condition_enum</tt> templates may be
  specialized for user-defined types to indicate that such a type is
  eligible for class <tt>error_code</tt> and class <tt>error_condition</tt> automatic
  conversions, respectively.</del>
! </blockquote>
  
  <p>
  Change System error support 19.5 [syserr] and its subsections:
--- 44467,44478 ----
  Change System error support 19.5 [syserr] :
  </p>
  
! <blockquote><p>
  <del>The <tt>is_error_code_enum</tt> and <tt>is_error_condition_enum</tt> templates may be
  specialized for user-defined types to indicate that such a type is
  eligible for class <tt>error_code</tt> and class <tt>error_condition</tt> automatic
  conversions, respectively.</del>
! </p></blockquote>
  
  <p>
  Change System error support 19.5 [syserr] and its subsections:
*************** change all instances of <tt>get_posix_ca
*** 42849,42872 ****
  Change Error category objects 19.5.1.5 [syserr.errcat.objects], paragraph 2:
  </p>
  
! <blockquote>
  <i>Remarks:</i> The object's <tt>default_error_condition</tt> and equivalent virtual
  functions shall behave as specified for the class <tt>error_category</tt>. The
  object's name virtual function shall return a pointer to the string
  <del>"POSIX"</del> <ins>"generic"</ins>.
! </blockquote>
  
  <p>
  Change 19.5.2.5 [syserr.errcode.nonmembers] Class <tt>error_code</tt> non-member functions as indicated:
  </p>
  
  <blockquote>
! <pre>error_code make_error_code(<del>posix_errno</del> <ins>errc</ins> e);
  </pre>
  
! <blockquote>
  <i>Returns:</i> <tt>error_code(<ins>static_cast&lt;int&gt;(</ins>e<ins>)</ins>, <del>posix</del><ins>generic</ins>_category)</tt>.
! </blockquote>
  </blockquote>
  
  <p>
--- 44499,44523 ----
  Change Error category objects 19.5.1.5 [syserr.errcat.objects], paragraph 2:
  </p>
  
! <blockquote><p>
  <i>Remarks:</i> The object's <tt>default_error_condition</tt> and equivalent virtual
  functions shall behave as specified for the class <tt>error_category</tt>. The
  object's name virtual function shall return a pointer to the string
  <del>"POSIX"</del> <ins>"generic"</ins>.
! </p></blockquote>
  
  <p>
  Change 19.5.2.5 [syserr.errcode.nonmembers] Class <tt>error_code</tt> non-member functions as indicated:
  </p>
  
  <blockquote>
! <pre>
! error_code make_error_code(<del>posix_errno</del> <ins>errc</ins> e);
  </pre>
  
! <blockquote><p>
  <i>Returns:</i> <tt>error_code(<ins>static_cast&lt;int&gt;(</ins>e<ins>)</ins>, <del>posix</del><ins>generic</ins>_category)</tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** Change 19.5.3.5 [syserr.errcondition.non
*** 42874,42892 ****
  </p>
  
  <blockquote>
! <pre>error_condition make_error_condition(<del>posix_errno</del> <ins>errc</ins> e);
  </pre>
  
! <blockquote>
  <i>Returns:</i> <tt>error_condition(<ins>static_cast&lt;int&gt;(</ins>e<ins>)</ins>, <del>posix</del><ins>generic</ins>_category)</tt>.
! </blockquote>
  </blockquote>
  
  
  
  <p><b>Rationale:</b></p>
  <table border="1">
! <tbody><tr>
  <th colspan="2">Names Considered</th>
  </tr>
  
--- 44525,44544 ----
  </p>
  
  <blockquote>
! <pre>
! error_condition make_error_condition(<del>posix_errno</del> <ins>errc</ins> e);
  </pre>
  
! <blockquote><p>
  <i>Returns:</i> <tt>error_condition(<ins>static_cast&lt;int&gt;(</ins>e<ins>)</ins>, <del>posix</del><ins>generic</ins>_category)</tt>.
! </p></blockquote>
  </blockquote>
  
  
  
  <p><b>Rationale:</b></p>
  <table border="1">
! <tr>
  <th colspan="2">Names Considered</th>
  </tr>
  
*************** name, given the existing <tt>errno</tt>
*** 42992,42998 ****
  intuitive. There are no uses of <tt>errc</tt> in the current C++ standard.
  </td>
  </tr>
! </tbody></table>
  
  
  
--- 44644,44650 ----
  intuitive. There are no uses of <tt>errc</tt> in the current C++ standard.
  </td>
  </tr>
! </table>
  
  
  
*************** intuitive. There are no uses of <tt>errc
*** 43000,43021 ****
  
  <hr>
  <h3><a name="806"></a>806. <tt>unique_ptr::reset</tt> effects incorrect, too permissive</h3>
! <p><b>Section:</b> 20.9.9.2.5 [unique.ptr.single.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-03-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.single.modifiers">issues</a> in [unique.ptr.single.modifiers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>void unique_ptr::reset(T* p = 0)</tt> is currently specified as:
  </p>
  
! <blockquote>
  <i>Effects:</i> If <tt>p == get()</tt> there are no effects. Otherwise <tt>get_deleter()(get())</tt>.
! </blockquote>
  
  <p>
  There are two problems with this. One, if <tt>get() == 0</tt> and <tt>p != 0</tt>, the
! deleter is called with a NULL pointer, and this is probably not what's
  intended (the destructor avoids calling the deleter with 0.)
  </p>
  
--- 44652,44673 ----
  
  <hr>
  <h3><a name="806"></a>806. <tt>unique_ptr::reset</tt> effects incorrect, too permissive</h3>
! <p><b>Section:</b> 20.8.1.2.5 [unique.ptr.single.modifiers] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.modifiers">issues</a> in [unique.ptr.single.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>void unique_ptr::reset(T* p = 0)</tt> is currently specified as:
  </p>
  
! <blockquote><p>
  <i>Effects:</i> If <tt>p == get()</tt> there are no effects. Otherwise <tt>get_deleter()(get())</tt>.
! </p></blockquote>
  
  <p>
  There are two problems with this. One, if <tt>get() == 0</tt> and <tt>p != 0</tt>, the
! deleter is called with a <tt>NULL</tt> pointer, and this is probably not what's
  intended (the destructor avoids calling the deleter with 0.)
  </p>
  
*************** self-resets in 2001 and there were no co
*** 43027,43043 ****
  </p>
  
  <p>
! One might think that self-resets are necessary for operator= to work; it's specified to perform
  </p>
  
! <blockquote><pre>reset( u.release() );
  </pre></blockquote>
  
  <p>
  and the self-assignment
  </p>
  
! <blockquote><pre>p = move(p);
  </pre></blockquote>
  
  <p>
--- 44679,44697 ----
  </p>
  
  <p>
! One might think that self-resets are necessary for <tt>operator=</tt> to work; it's specified to perform
  </p>
  
! <blockquote><pre>
! reset( u.release() );
  </pre></blockquote>
  
  <p>
  and the self-assignment
  </p>
  
! <blockquote><pre>
! p = move(p);
  </pre></blockquote>
  
  <p>
*************** scenario, as it definitely doesn't when
*** 43053,43075 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 20.9.9.2.5 [unique.ptr.single.modifiers]:
  </p>
  
  <blockquote>
! <pre>void reset(T* p = 0);
  </pre>
! <blockquote>
  -4- <i>Effects:</i> If <tt><del>p ==</del> get()<ins> == 0</ins></tt> there are no effects. Otherwise <tt>get_deleter()(get())</tt>.
! </blockquote>
  </blockquote>
  
  <p>
! Change 20.9.9.3.3 [unique.ptr.runtime.modifiers]:
  </p>
  
  <blockquote>
! <pre>void reset(T* p = 0);
  </pre>
  <blockquote>
  <p>...</p>
--- 44707,44731 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 20.8.1.2.5 [unique.ptr.single.modifiers]:
  </p>
  
  <blockquote>
! <pre>
! void reset(T* p = 0);
  </pre>
! <blockquote><p>
  -4- <i>Effects:</i> If <tt><del>p ==</del> get()<ins> == 0</ins></tt> there are no effects. Otherwise <tt>get_deleter()(get())</tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
! Change 20.8.1.3.4 [unique.ptr.runtime.modifiers]:
  </p>
  
  <blockquote>
! <pre>
! void reset(T* p = 0);
  </pre>
  <blockquote>
  <p>...</p>
*************** Change 20.9.9.3.3 [unique.ptr.runtime.mo
*** 43086,43098 ****
  
  <hr>
  <h3><a name="807"></a>807. <tt>tuple</tt> construction should not fail unless its element's construction fails</h3>
! <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-03-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a> Added a throws clause to <tt>bind</tt> constructors.  I believe the same throws clause
  should be added to <tt>tuple</tt> except it ought to take into account move constructors as well.
  </p>
  
--- 44742,44755 ----
  
  <hr>
  <h3><a name="807"></a>807. <tt>tuple</tt> construction should not fail unless its element's construction fails</h3>
! <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#tuple.cnstr">active issues</a> in [tuple.cnstr].</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! <a href="lwg-defects.html#527">527</a> Added a throws clause to <tt>bind</tt> constructors.  I believe the same throws clause
  should be added to <tt>tuple</tt> except it ought to take into account move constructors as well.
  </p>
  
*************** or assignment of one of the types in <tt
*** 43115,43131 ****
  
  <hr>
  <h3><a name="808"></a>808. [forward] incorrect redundant specification</h3>
! <p><b>Section:</b> 20.3.3 [forward] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2008-03-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  p4 (forward) says:
  </p>
! <blockquote>
  <i>Return type:</i> If <tt>T</tt> is an lvalue-reference type, an lvalue; otherwise, an rvalue.
! </blockquote>
  
  <p>
  First of all, lvalue-ness and rvalue-ness are properties of an expression,
--- 44772,44788 ----
  
  <hr>
  <h3><a name="808"></a>808. [forward] incorrect redundant specification</h3>
! <p><b>Section:</b> 20.2.4 [forward] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2008-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  p4 (forward) says:
  </p>
! <blockquote><p>
  <i>Return type:</i> If <tt>T</tt> is an lvalue-reference type, an lvalue; otherwise, an rvalue.
! </p></blockquote>
  
  <p>
  First of all, lvalue-ness and rvalue-ness are properties of an expression,
*************** have reference type, ever.)
*** 43144,43152 ****
  <p>
  Similar with move:
  </p>
! <blockquote>
  Return type: an rvalue.
! </blockquote>
  <p>
  is just wrong and also redundant.
  </p>
--- 44801,44809 ----
  <p>
  Similar with move:
  </p>
! <blockquote><p>
  Return type: an rvalue.
! </p></blockquote>
  <p>
  is just wrong and also redundant.
  </p>
*************** is just wrong and also redundant.
*** 43154,43164 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.3.3 [forward] as indicated:
  </p>
  
  <blockquote>
! <pre>template &lt;class T&gt; T&amp;&amp; forward(typename identity&lt;T&gt;::type&amp;&amp; t);
  </pre>
  
  <blockquote>
--- 44811,44822 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.2.4 [forward] as indicated:
  </p>
  
  <blockquote>
! <pre>
! template &lt;class T&gt; T&amp;&amp; forward(typename identity&lt;T&gt;::type&amp;&amp; t);
  </pre>
  
  <blockquote>
*************** In both cases, <tt>A2</tt> is deduced as
*** 43176,43182 ****
  </p>
  </blockquote>
  
! <pre>template &lt;class T&gt; typename remove_reference&lt;T&gt;::type&amp;&amp; move(T&amp;&amp; t);
  </pre>
  
  <blockquote>
--- 44834,44841 ----
  </p>
  </blockquote>
  
! <pre>
! template &lt;class T&gt; typename remove_reference&lt;T&gt;::type&amp;&amp; move(T&amp;&amp; t);
  </pre>
  
  <blockquote>
*************** In both cases, <tt>A2</tt> is deduced as
*** 43194,43211 ****
  
  
  <hr>
! <h3><a name="809"></a>809. std::swap should be overloaded for array types</h3>
! <p><b>Section:</b> 25.3.3 [alg.swap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-02-28 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.swap">issues</a> in [alg.swap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  For the sake of generic programming, the header <code>&lt;algorithm&gt;</code> should provide an
  overload of <code>std::swap</code> for array types:
! </p><pre>template&lt;class T, size_t N&gt; void swap(T (&amp;a)[N], T (&amp;b)[N]);
  </pre>
- <p></p>
  
  <p>
  It became apparent to me that this overload is missing, when I considered how to write a swap
--- 44853,44870 ----
  
  
  <hr>
! <h3><a name="809"></a>809. <tt>std::swap</tt> should be overloaded for array types</h3>
! <p><b>Section:</b> 25.3.3 [alg.swap] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-02-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.swap">issues</a> in [alg.swap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  For the sake of generic programming, the header <code>&lt;algorithm&gt;</code> should provide an
  overload of <code>std::swap</code> for array types:
! </p><pre>
! template&lt;class T, size_t N&gt; void swap(T (&amp;a)[N], T (&amp;b)[N]);
  </pre>
  
  <p>
  It became apparent to me that this overload is missing, when I considered how to write a swap
*************** function for a generic wrapper class tem
*** 43213,43223 ****
  (Actually I was thinking of Boost's <a href="http://www.boost.org/libs/utility/value_init.htm">value_initialized</a>.)
  Please look at the following template, <code>W</code>, and suppose that is intended to be a very
  <em>generic</em> wrapper:
! </p><pre>template&lt;class T&gt; class W {
  public:
!    T data;
  };
  </pre>
  Clearly <code>W&lt;T&gt;</code> is <em>CopyConstructible and CopyAssignable</em>, and therefore
  <em>Swappable</em>, whenever <code>T</code> is <em>CopyConstructible and CopyAssignable</em>.
  Moreover, <code>W&lt;T&gt;</code> is <em>also</em> Swappable when <code>T</code> is an array type
--- 44872,44885 ----
  (Actually I was thinking of Boost's <a href="http://www.boost.org/libs/utility/value_init.htm">value_initialized</a>.)
  Please look at the following template, <code>W</code>, and suppose that is intended to be a very
  <em>generic</em> wrapper:
! </p>
! <pre>
! template&lt;class T&gt; class W {
  public:
!   T data;
  };
  </pre>
+ <p>
  Clearly <code>W&lt;T&gt;</code> is <em>CopyConstructible and CopyAssignable</em>, and therefore
  <em>Swappable</em>, whenever <code>T</code> is <em>CopyConstructible and CopyAssignable</em>.
  Moreover, <code>W&lt;T&gt;</code> is <em>also</em> Swappable when <code>T</code> is an array type
*************** for the sake of efficiency and exception
*** 43227,43252 ****
  (E.g., <em>Scott Meyers, Effective C++, Third Edition, item 25: Consider support for a non-throwing
  swap</em>.)
  This function template is typically written as follows:
! <pre>template&lt;class T&gt; void swap(W&lt;T&gt;&amp; x, W&lt;T&gt;&amp; y) {
    using std::swap;
    swap(x.data, y.data);
  }
  </pre>
  Unfortunately, this will introduce an undesirable inconsistency, when <code>T</code> is an array.
  For instance, <code>W&lt;std::string[8]&gt;</code> is Swappable, but the current Standard does not
  allow calling the custom swap function that was especially written for <code>W</code>!
! <pre>W&lt;std::string[8]&gt; w1, w2;  // Two objects of a Swappable type.
  std::swap(w1, w2);  // Well-defined, but inefficient.
  using std::swap;
  swap(w1, w2);  // Ill-formed, just because ADL finds W's swap function!!!
  </pre>
! 
  <code>W</code>'s <code>swap</code> function would try to call <code>std::swap</code> for an array,
  <code>std::string[8]</code>, which is not supported by the Standard Library.
  This issue is easily solved by providing an overload of <code>std::swap</code> for array types.
  This swap function should be implemented in terms of swapping the elements of the arrays, so that
  it would be non-throwing for arrays whose element types have a non-throwing swap.
! <p></p>
  
  <p>
  Note that such an overload of <code>std::swap</code> should also support <em>multi-dimensional</em>
--- 44889,44919 ----
  (E.g., <em>Scott Meyers, Effective C++, Third Edition, item 25: Consider support for a non-throwing
  swap</em>.)
  This function template is typically written as follows:
! </p>
! <pre>
! template&lt;class T&gt; void swap(W&lt;T&gt;&amp; x, W&lt;T&gt;&amp; y) {
    using std::swap;
    swap(x.data, y.data);
  }
  </pre>
+ <p>
  Unfortunately, this will introduce an undesirable inconsistency, when <code>T</code> is an array.
  For instance, <code>W&lt;std::string[8]&gt;</code> is Swappable, but the current Standard does not
  allow calling the custom swap function that was especially written for <code>W</code>!
! </p>
! <pre>
! W&lt;std::string[8]&gt; w1, w2;  // Two objects of a Swappable type.
  std::swap(w1, w2);  // Well-defined, but inefficient.
  using std::swap;
  swap(w1, w2);  // Ill-formed, just because ADL finds W's swap function!!!
  </pre>
! <p>
  <code>W</code>'s <code>swap</code> function would try to call <code>std::swap</code> for an array,
  <code>std::string[8]</code>, which is not supported by the Standard Library.
  This issue is easily solved by providing an overload of <code>std::swap</code> for array types.
  This swap function should be implemented in terms of swapping the elements of the arrays, so that
  it would be non-throwing for arrays whose element types have a non-throwing swap.
! </p>
  
  <p>
  Note that such an overload of <code>std::swap</code> should also support <em>multi-dimensional</em>
*************** means of recursion.
*** 43255,43284 ****
  </p>
  
  <p>
! For your information, there was a discussion on this issue at comp.lang.c++.moderated: <a href="http://groups.google.com/group/comp.lang.c++.moderated/browse_thread/thread/9341ebd3635c9c74">[Standard
  Library] Shouldn't std::swap be overloaded for C-style arrays?</a>
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add an extra condition to the definition of Swappable requirements [swappable] in 20.2.1 [utility.arg.requirements]:
  </p>
! <blockquote>
  - <tt>T</tt> is <tt>Swappable</tt> if <tt>T</tt> is an array type whose element type is <tt>Swappable</tt>.
! </blockquote>
  <p>
  Add the following to 25.3.3 [alg.swap]:
  </p>
  <blockquote>
! <pre>template&lt;class T, size_t N&gt; void swap(T (&amp;a)[N], T (&amp;b)[N]);
  </pre>
! <blockquote>
  <i>Requires:</i> Type <code>T</code> shall be <tt>Swappable</tt>.
! </blockquote>
! <blockquote>
  <i>Effects:</i> <code>swap_ranges(a, a + N, b);</code>
! </blockquote>
  </blockquote>
  
  
--- 44922,44953 ----
  </p>
  
  <p>
! For your information, there was a discussion on this issue at comp.lang.c++.moderated: <a
! href="http://groups.google.com/group/comp.lang.c++.moderated/browse_thread/thread/9341ebd3635c9c74">[Standard
  Library] Shouldn't std::swap be overloaded for C-style arrays?</a>
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add an extra condition to the definition of Swappable requirements [swappable] in 17.6.3.1 [utility.arg.requirements]:
  </p>
! <blockquote><p>
  - <tt>T</tt> is <tt>Swappable</tt> if <tt>T</tt> is an array type whose element type is <tt>Swappable</tt>.
! </p></blockquote>
  <p>
  Add the following to 25.3.3 [alg.swap]:
  </p>
  <blockquote>
! <pre>
! template&lt;class T, size_t N&gt; void swap(T (&amp;a)[N], T (&amp;b)[N]);
  </pre>
! <blockquote><p>
  <i>Requires:</i> Type <code>T</code> shall be <tt>Swappable</tt>.
! </p></blockquote>
! <blockquote><p>
  <i>Effects:</i> <code>swap_ranges(a, a + N, b);</code>
! </p></blockquote>
  </blockquote>
  
  
*************** Add the following to 25.3.3 [alg.swap]:
*** 43287,43296 ****
  
  <hr>
  <h3><a name="810"></a>810. Missing traits dependencies in operational semantics of extended manipulators</h3>
! <p><b>Section:</b> 27.7.4 [ext.manip] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-03-01 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ext.manip">issues</a> in [ext.manip].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The recent draft (as well as the original proposal n2072) uses an
--- 44956,44965 ----
  
  <hr>
  <h3><a name="810"></a>810. Missing traits dependencies in operational semantics of extended manipulators</h3>
! <p><b>Section:</b> 27.7.5 [ext.manip] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-03-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ext.manip">issues</a> in [ext.manip].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The recent draft (as well as the original proposal n2072) uses an
*************** operational semantic
*** 43298,43311 ****
  for <tt>get_money</tt> ([ext.manip]/4) and <tt>put_money</tt> ([ext.manip]/6), which uses
  </p>
  
! <blockquote><pre>istreambuf_iterator&lt;charT&gt;
  </pre></blockquote>
  
  <p>
  and
  </p>
  
! <blockquote><pre>ostreambuf_iterator&lt;charT&gt;
  </pre></blockquote>
  
  <p>
--- 44967,44982 ----
  for <tt>get_money</tt> ([ext.manip]/4) and <tt>put_money</tt> ([ext.manip]/6), which uses
  </p>
  
! <blockquote><pre>
! istreambuf_iterator&lt;charT&gt;
  </pre></blockquote>
  
  <p>
  and
  </p>
  
! <blockquote><pre>
! ostreambuf_iterator&lt;charT&gt;
  </pre></blockquote>
  
  <p>
*************** Move to Tentatively Ready.
*** 43338,43384 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.7.4 [ext.manip]/4 within function <tt>f</tt> replace the first line
  </p>
  
! <blockquote><pre>template &lt;class charT, class traits, class moneyT&gt; 
  void f(basic_ios&lt;charT, traits&gt;&amp; str, moneyT&amp; mon, bool intl) { 
     typedef istreambuf_iterator&lt;charT<ins>, traits</ins>&gt; Iter;
     ...
  </pre></blockquote>
  
  <p>
! In 27.7.4 [ext.manip]/5 remove the first template <tt>charT</tt> parameter:
  </p>
  
! <blockquote><pre>template &lt;<del>class charT, </del>class moneyT&gt; unspecified put_money(const moneyT&amp; mon, bool intl = false<ins>)</ins>;
  </pre></blockquote>
  
  <p>
! In 27.7.4 [ext.manip]/6 within function <tt>f</tt> replace the first line
  </p>
  
! <blockquote><pre>template &lt;class charT, class traits, class moneyT&gt; 
  void f(basic_ios&lt;charT, traits&gt;&amp; str, const moneyT&amp; mon, bool intl) { 
    typedef ostreambuf_iterator&lt;charT<ins>, traits</ins>&gt; Iter;
    ...
  </pre></blockquote>
  
  <p>
! In 27.7.4 [ext.manip]/8 within function <tt>f</tt> replace the first line
  </p>
  
! <blockquote><pre>template &lt;class charT, class traits&gt; 
  void f(basic_ios&lt;charT, traits&gt;&amp; str, struct tm *tmb, const charT *fmt) { 
    typedef <ins>i</ins>streambuf_iterator&lt;charT<ins>, traits</ins>&gt; Iter;
    ...
  </pre></blockquote>
  
  <p>
! In 27.7.4 [ext.manip]/10 within function <tt>f</tt> replace the first line
  </p>
  
! <blockquote><pre>template &lt;class charT, class traits&gt; 
  void f(basic_ios&lt;charT, traits&gt;&amp; str, const struct tm *tmb, const charT *fmt) { 
    typedef ostreambuf_iterator&lt;charT<ins>, traits</ins>&gt; Iter;
    ...
--- 45009,45060 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 27.7.5 [ext.manip]/4 within function <tt>f</tt> replace the first line
  </p>
  
! <blockquote><pre>
! template &lt;class charT, class traits, class moneyT&gt; 
  void f(basic_ios&lt;charT, traits&gt;&amp; str, moneyT&amp; mon, bool intl) { 
     typedef istreambuf_iterator&lt;charT<ins>, traits</ins>&gt; Iter;
     ...
  </pre></blockquote>
  
  <p>
! In 27.7.5 [ext.manip]/5 remove the first template <tt>charT</tt> parameter:
  </p>
  
! <blockquote><pre>
! template &lt;<del>class charT, </del>class moneyT&gt; unspecified put_money(const moneyT&amp; mon, bool intl = false<ins>)</ins>;
  </pre></blockquote>
  
  <p>
! In 27.7.5 [ext.manip]/6 within function <tt>f</tt> replace the first line
  </p>
  
! <blockquote><pre>
! template &lt;class charT, class traits, class moneyT&gt; 
  void f(basic_ios&lt;charT, traits&gt;&amp; str, const moneyT&amp; mon, bool intl) { 
    typedef ostreambuf_iterator&lt;charT<ins>, traits</ins>&gt; Iter;
    ...
  </pre></blockquote>
  
  <p>
! In 27.7.5 [ext.manip]/8 within function <tt>f</tt> replace the first line
  </p>
  
! <blockquote><pre>
! template &lt;class charT, class traits&gt; 
  void f(basic_ios&lt;charT, traits&gt;&amp; str, struct tm *tmb, const charT *fmt) { 
    typedef <ins>i</ins>streambuf_iterator&lt;charT<ins>, traits</ins>&gt; Iter;
    ...
  </pre></blockquote>
  
  <p>
! In 27.7.5 [ext.manip]/10 within function <tt>f</tt> replace the first line
  </p>
  
! <blockquote><pre>
! template &lt;class charT, class traits&gt; 
  void f(basic_ios&lt;charT, traits&gt;&amp; str, const struct tm *tmb, const charT *fmt) { 
    typedef ostreambuf_iterator&lt;charT<ins>, traits</ins>&gt; Iter;
    ...
*************** void f(basic_ios&lt;charT, traits&gt;&am
*** 43388,43394 ****
  In 27.7 [iostream.format], Header <tt>&lt;iomanip&gt;</tt> synopsis change:
  </p>
  
! <blockquote><pre>template &lt;<del>class charT, </del>class moneyT&gt; T8 put_money(const moneyT&amp; mon, bool intl = false);
  </pre></blockquote>
  
  
--- 45064,45071 ----
  In 27.7 [iostream.format], Header <tt>&lt;iomanip&gt;</tt> synopsis change:
  </p>
  
! <blockquote><pre>
! template &lt;<del>class charT, </del>class moneyT&gt; T8 put_money(const moneyT&amp; mon, bool intl = false);
  </pre></blockquote>
  
  
*************** In 27.7 [iostream.format], Header <tt>&l
*** 43397,43408 ****
  
  <hr>
  <h3><a name="811"></a>811. <tt>pair</tt> of pointers no longer works with literal 0</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2008-03-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
! <blockquote><pre>#include &lt;utility&gt;
  
  int main()
  {
--- 45074,45086 ----
  
  <hr>
  <h3><a name="811"></a>811. <tt>pair</tt> of pointers no longer works with literal 0</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2008-03-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
! <blockquote><pre>
! #include &lt;utility&gt;
  
  int main()
  {
*************** rvalue references into the language, lon
*** 43420,43426 ****
  emplace came along:
  </p>
  
! <blockquote><pre>template&lt;class U, class V&gt; pair(U&amp;&amp; x, V&amp;&amp; y);
  </pre></blockquote>
  
  <p>
--- 45098,45105 ----
  emplace came along:
  </p>
  
! <blockquote><pre>
! template&lt;class U, class V&gt; pair(U&amp;&amp; x, V&amp;&amp; y);
  </pre></blockquote>
  
  <p>
*************** constructor to only <tt>U</tt>'s and <tt
*** 43430,43436 ****
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2322.pdf">N2322</a>):
  </p>
  
! <blockquote><pre>template&lt;class U , class V &gt;
  requires Constructible&lt;T1, U&amp;&amp;&gt; &amp;&amp; Constructible&lt;T2, V&amp;&amp;&gt;
  pair(U&amp;&amp; x , V&amp;&amp; y );
  </pre></blockquote>
--- 45109,45116 ----
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2322.pdf">N2322</a>):
  </p>
  
! <blockquote><pre>
! template&lt;class U , class V &gt;
  requires Constructible&lt;T1, U&amp;&amp;&gt; &amp;&amp; Constructible&lt;T2, V&amp;&amp;&gt;
  pair(U&amp;&amp; x , V&amp;&amp; y );
  </pre></blockquote>
*************** Side question: Should pair interoperate
*** 43449,43455 ****
  tuple of a pair, but not a pair from a two-element tuple.
  </p>
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#885">885</a>.
  </p>
  </blockquote>
  
--- 45129,45135 ----
  tuple of a pair, but not a pair from a two-element tuple.
  </p>
  <p>
! Related to <a href="lwg-defects.html#885">885</a>.
  </p>
  </blockquote>
  
*************** Related to <a href="http://www.open-std.
*** 43463,43471 ****
  ]</i></p>
  
  
! <blockquote>
  Leave as open. Howard to provide wording.
! </blockquote>
  
  <p><i>[
  2010-02-06 Howard provided wording.
--- 45143,45151 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave as open. Howard to provide wording.
! </p></blockquote>
  
  <p><i>[
  2010-02-06 Howard provided wording.
*************** San Francisco:
*** 43485,43494 ****
  ]</i></p>
  
  
! <blockquote>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2770.pdf">N2770</a>.
! </blockquote>
  
  <p><i>[
  The rationale is obsolete.
--- 45165,45174 ----
  ]</i></p>
  
  
! <blockquote><p>
  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2770.pdf">N2770</a>.
! </p></blockquote>
  
  <p><i>[
  The rationale is obsolete.
*************** The rationale is obsolete.
*** 43499,43509 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a paragraph to 20.3.5 [pairs]:
  </p>
  
  <blockquote>
! <pre>template&lt;class U, class V&gt; pair(U&amp;&amp; x, V&amp;&amp; y);
  </pre>
  <blockquote>
  <p>
--- 45179,45190 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a paragraph to 20.3 [pairs]:
  </p>
  
  <blockquote>
! <pre>
! template&lt;class U, class V&gt; pair(U&amp;&amp; x, V&amp;&amp; y);
  </pre>
  <blockquote>
  <p>
*************** resolution.</ins>
*** 43528,43556 ****
  
  <hr>
  <h3><a name="813"></a>813. "empty" undefined for <tt>shared_ptr</tt></h3>
! <p><b>Section:</b> 20.9.10.2 [util.smartptr.shared] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2008-02-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Several places in 20.9.10.2 [util.smartptr.shared] refer to an "empty" <tt>shared_ptr</tt>.
  However, that term is nowhere defined. The closest thing we have to a
  definition is that the default constructor creates an empty <tt>shared_ptr</tt>
  and that a copy of a default-constructed <tt>shared_ptr</tt> is empty. Are any
  other <tt>shared_ptr</tt>s empty? For example, is <tt>shared_ptr((T*) 0)</tt> empty? What
  are the properties of an empty <tt>shared_ptr</tt>? We should either clarify this
  term or stop using it.
- </p><p>
  </p>
  One reason it's not good enough to leave this term up to the reader's
  intuition is that, in light of
  <a href="http://www.open-std.org/JTC1/sc22/WG21/docs/papers/2007/n2351.htm">N2351</a>
! and issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#711">711</a>, most readers'
  intuitive understanding is likely to be wrong. Intuitively one might
  expect that an empty <tt>shared_ptr</tt> is one that doesn't store a pointer,
  but, whatever the definition is, that isn't it.
! <p></p>
  
  <p><i>[
  Peter adds:
--- 45209,45238 ----
  
  <hr>
  <h3><a name="813"></a>813. "empty" undefined for <tt>shared_ptr</tt></h3>
! <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2008-02-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Several places in 20.8.2.2 [util.smartptr.shared] refer to an "empty" <tt>shared_ptr</tt>.
  However, that term is nowhere defined. The closest thing we have to a
  definition is that the default constructor creates an empty <tt>shared_ptr</tt>
  and that a copy of a default-constructed <tt>shared_ptr</tt> is empty. Are any
  other <tt>shared_ptr</tt>s empty? For example, is <tt>shared_ptr((T*) 0)</tt> empty? What
  are the properties of an empty <tt>shared_ptr</tt>? We should either clarify this
  term or stop using it.
  </p>
+ <p>
  One reason it's not good enough to leave this term up to the reader's
  intuition is that, in light of
  <a href="http://www.open-std.org/JTC1/sc22/WG21/docs/papers/2007/n2351.htm">N2351</a>
! and issue <a href="lwg-defects.html#711">711</a>, most readers'
  intuitive understanding is likely to be wrong. Intuitively one might
  expect that an empty <tt>shared_ptr</tt> is one that doesn't store a pointer,
  but, whatever the definition is, that isn't it.
! </p>
  
  <p><i>[
  Peter adds:
*************** completely specified by the last mutatin
*** 43573,43581 ****
  Give me an example and I'll tell you whether the <tt>shared_ptr</tt> is empty or
  not.
  </p>
! <blockquote>
  (*) If it isn't, this is a legitimate defect.
! </blockquote>
  </li>
  
  <li>
--- 45255,45263 ----
  Give me an example and I'll tell you whether the <tt>shared_ptr</tt> is empty or
  not.
  </p>
! <blockquote><p>
  (*) If it isn't, this is a legitimate defect.
! </p></blockquote>
  </li>
  
  <li>
*************** Terms can be useful without a definition
*** 43625,43639 ****
  simplistic example. We have a type <tt>X</tt> with the following operations
  defined:
  </p>
! <blockquote><pre>X x;
  X x2(x);
  X f(X x);
  X g(X x1, X x2);
  </pre></blockquote>
  <p>
! A default-constructed value is green.<br>
! A copy has the same color as the original.<br>
! <tt>f(x)</tt> returns a red value if the argument is green, a green value otherwise.<br>
  <tt>g(x1,x2)</tt> returns a green value if the arguments are of the same color, a red value otherwise.
  </p>
  
--- 45307,45322 ----
  simplistic example. We have a type <tt>X</tt> with the following operations
  defined:
  </p>
! <blockquote><pre>
! X x;
  X x2(x);
  X f(X x);
  X g(X x1, X x2);
  </pre></blockquote>
  <p>
! A default-constructed value is green.<br/>
! A copy has the same color as the original.<br/>
! <tt>f(x)</tt> returns a red value if the argument is green, a green value otherwise.<br/>
  <tt>g(x1,x2)</tt> returns a green value if the arguments are of the same color, a red value otherwise.
  </p>
  
*************** Alisdair's wording is fine.
*** 43656,43671 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Append the following sentance to 20.9.10.2 [util.smartptr.shared]
  </p>
! <blockquote>
  The <code>shared_ptr</code> class template stores a pointer, usually obtained
  via <code>new</code>. <code>shared_ptr</code> implements semantics of
  shared ownership; the last remaining owner of the pointer is responsible for
  destroying the object, or otherwise releasing  the resources associated with
  the stored pointer. <ins>A <code>shared_ptr</code> object that does not own
  a pointer is said to be <i>empty</i>.</ins>
! </blockquote>
  
  
  
--- 45339,45354 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Append the following sentance to 20.8.2.2 [util.smartptr.shared]
  </p>
! <blockquote><p>
  The <code>shared_ptr</code> class template stores a pointer, usually obtained
  via <code>new</code>. <code>shared_ptr</code> implements semantics of
  shared ownership; the last remaining owner of the pointer is responsible for
  destroying the object, or otherwise releasing  the resources associated with
  the stored pointer. <ins>A <code>shared_ptr</code> object that does not own
  a pointer is said to be <i>empty</i>.</ins>
! </p></blockquote>
  
  
  
*************** a pointer is said to be <i>empty</i>.</i
*** 43673,43682 ****
  
  <hr>
  <h3><a name="814"></a>814. <tt>vector&lt;bool&gt;::swap(reference, reference)</tt> not defined</h3>
! <p><b>Section:</b> 23.4.2 [vector.bool] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-03-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>vector&lt;bool&gt;::swap(reference, reference)</tt> has no definition.
--- 45356,45365 ----
  
  <hr>
  <h3><a name="814"></a>814. <tt>vector&lt;bool&gt;::swap(reference, reference)</tt> not defined</h3>
! <p><b>Section:</b> 23.3.7 [vector.bool] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-03-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>vector&lt;bool&gt;::swap(reference, reference)</tt> has no definition.
*************** San Francisco:
*** 43687,43695 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Open. Alisdair to provide a resolution.
! </blockquote>
  
  <p><i>[
  Post Summit Daniel provided wording.
--- 45370,45378 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Open. Alisdair to provide a resolution.
! </p></blockquote>
  
  <p><i>[
  Post Summit Daniel provided wording.
*************** Post Summit Daniel provided wording.
*** 43700,43714 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Just after 23.4.2 [vector.bool]/5 add the following prototype and description:
  </p>
  
  <blockquote>
--- 45383,45397 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Just after 23.3.7 [vector.bool]/5 add the following prototype and description:
  </p>
  
  <blockquote>
*************** y = b;
*** 43733,43742 ****
  
  <hr>
  <h3><a name="815"></a>815. <tt>std::function</tt> and <tt>reference_closure</tt> do not use perfect forwarding</h3>
! <p><b>Section:</b> 20.8.14.2.4 [func.wrap.func.inv] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-03-16 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func.inv">issues</a> in [func.wrap.func.inv].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>std::function</tt> and <tt>reference_closure</tt> should use "perfect forwarding" as
--- 45416,45425 ----
  
  <hr>
  <h3><a name="815"></a>815. <tt>std::function</tt> and <tt>reference_closure</tt> do not use perfect forwarding</h3>
! <p><b>Section:</b> 20.9.12.2.4 [func.wrap.func.inv] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-03-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func.inv">issues</a> in [func.wrap.func.inv].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>std::function</tt> and <tt>reference_closure</tt> should use "perfect forwarding" as
*************** Sophia Antipolis:
*** 43748,43758 ****
  ]</i></p>
  
  
! <blockquote>
  According to Doug Gregor, as far as <tt>std::function</tt> is concerned, perfect
  forwarding can not be obtained because of type erasure. Not everyone
  agreed with this diagnosis of forwarding.
! </blockquote>
  
  <p><i>[
  2009-05-01 Howard adds:
--- 45431,45441 ----
  ]</i></p>
  
  
! <blockquote><p>
  According to Doug Gregor, as far as <tt>std::function</tt> is concerned, perfect
  forwarding can not be obtained because of type erasure. Not everyone
  agreed with this diagnosis of forwarding.
! </p></blockquote>
  
  <p><i>[
  2009-05-01 Howard adds:
*************** requirement on <tt>function</tt>'s <tt>A
*** 43766,43772 ****
  restriction.
  </p>
  
! <blockquote><pre>template&lt;Returnable R, <b>CopyConstructible</b>... ArgTypes&gt;
  class function&lt;R(ArgTypes...)&gt;
  ...
  </pre></blockquote>
--- 45449,45456 ----
  restriction.
  </p>
  
! <blockquote><pre>
! template&lt;Returnable R, <b>CopyConstructible</b>... ArgTypes&gt;
  class function&lt;R(ArgTypes...)&gt;
  ...
  </pre></blockquote>
*************** on <tt>ArgTypes</tt> in the first place
*** 43778,43784 ****
  <i>invoke</i> member:
  </p>
  
! <blockquote><pre>template&lt;class R, class ...ArgTypes&gt;
  R
  function&lt;R(ArgTypes...)&gt;::operator()(ArgTypes... arg) const
  {
--- 45462,45469 ----
  <i>invoke</i> member:
  </p>
  
! <blockquote><pre>
! template&lt;class R, class ...ArgTypes&gt;
  R
  function&lt;R(ArgTypes...)&gt;::operator()(ArgTypes... arg) const
  {
*************** be removed from the template class <tt>f
*** 43801,43807 ****
  Furthermore we need to mandate that the <i>invoker</i> is coded as:
  </p>
  
! <blockquote><pre>template&lt;class R, class ...ArgTypes&gt;
  R
  function&lt;R(ArgTypes...)&gt;::operator()(ArgTypes... arg) const
  {
--- 45486,45493 ----
  Furthermore we need to mandate that the <i>invoker</i> is coded as:
  </p>
  
! <blockquote><pre>
! template&lt;class R, class ...ArgTypes&gt;
  R
  function&lt;R(ArgTypes...)&gt;::operator()(ArgTypes... arg) const
  {
*************** reference type <tt>ArgTypes</tt>, this w
*** 43826,43832 ****
  that the following is a valid program:
  </p>
  
! <blockquote><pre>#include &lt;functional&gt;
  #include &lt;memory&gt;
  #include &lt;cassert&gt;
  
--- 45512,45519 ----
  that the following is a valid program:
  </p>
  
! <blockquote><pre>
! #include &lt;functional&gt;
  #include &lt;memory&gt;
  #include &lt;cassert&gt;
  
*************** and the second <tt>ArgType</tt> is <tt>i
*** 43870,43876 ****
  in the 2009-05-01 comment of above mentioned issue Howard
  </p>
  
! <ol type="a">
  <li>
  Recommends to replace the <tt>CopyConstructible</tt> requirement by a
  <tt>MoveConstructible</tt> requirement
--- 45557,45563 ----
  in the 2009-05-01 comment of above mentioned issue Howard
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  Recommends to replace the <tt>CopyConstructible</tt> requirement by a
  <tt>MoveConstructible</tt> requirement
*************** I'm fine with (a), but I think comment (
*** 43886,43892 ****
  sense I read these sentences. Let's look at Howard's example code:
  </p>
  
! <blockquote><pre>function&lt;R(ArgTypes...)&gt;::operator()(ArgTypes... arg) const
  {
     if (f_ == 0)
         throw bad_function_call();
--- 45573,45580 ----
  sense I read these sentences. Let's look at Howard's example code:
  </p>
  
! <blockquote><pre>
! function&lt;R(ArgTypes...)&gt;::operator()(ArgTypes... arg) const
  {
     if (f_ == 0)
         throw bad_function_call();
*************** do so, if <tt>ArgTypes</tt> aren't at le
*** 43906,43925 ****
  ]</i></p>
  
  
! <blockquote>
  Leave this open and wait until concepts are removed from the Working
  Draft so that we know how to write the proposed resolution in terms of
  diffs to otherwise stable text.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Leave as open. Howard to provide wording. Howard welcomes any help.
! </blockquote>
  
  <p><i>[
  2009-12-12 Jonathan Wakely adds:
--- 45594,45613 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave this open and wait until concepts are removed from the Working
  Draft so that we know how to write the proposed resolution in terms of
  diffs to otherwise stable text.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Leave as open. Howard to provide wording. Howard welcomes any help.
! </p></blockquote>
  
  <p><i>[
  2009-12-12 Jonathan Wakely adds:
*************** Leave as open. Howard to provide wording
*** 43928,43943 ****
  
  <blockquote>
  <p>
! 20.8.14.2 [func.wrap.func] says
  </p>
  
! <blockquote>
  2  A function object <tt>f</tt> of type <tt>F</tt> is Callable for argument
  types <tt>T1, T2, ..., TN</tt> in <tt>ArgTypes</tt> and a return type
  <tt>R</tt>, if, given lvalues <tt>t1, t2, ..., tN</tt> of types <tt>T1, T2, ...,
  TN</tt>, respectively, <tt>INVOKE (f, t1, t2, ..., tN)</tt> is well formed
  (20.7.2) and, if <tt>R</tt> is not <tt>void</tt>, convertible to <tt>R</tt>.
! </blockquote>
  
  <p>
  N.B. lvalues, which means you can't use <tt>function&lt;R(T&amp;&amp;)&gt;</tt>
--- 45616,45631 ----
  
  <blockquote>
  <p>
! 20.9.12.2 [func.wrap.func] says
  </p>
  
! <blockquote><p>
  2  A function object <tt>f</tt> of type <tt>F</tt> is Callable for argument
  types <tt>T1, T2, ..., TN</tt> in <tt>ArgTypes</tt> and a return type
  <tt>R</tt>, if, given lvalues <tt>t1, t2, ..., tN</tt> of types <tt>T1, T2, ...,
  TN</tt>, respectively, <tt>INVOKE (f, t1, t2, ..., tN)</tt> is well formed
  (20.7.2) and, if <tt>R</tt> is not <tt>void</tt>, convertible to <tt>R</tt>.
! </p></blockquote>
  
  <p>
  N.B. lvalues, which means you can't use <tt>function&lt;R(T&amp;&amp;)&gt;</tt>
*************** otherwise"?  I prefer the former, so I p
*** 43976,43992 ****
  </p>
  
  <p>
! Edit 20.8.14.2 [func.wrap.func] paragraph 2:
  </p>
  
! <blockquote>
  2  A function object <tt>f</tt> of type <tt>F</tt> is Callable for argument
  types <tt>T1, T2, ..., TN</tt> in <tt>ArgTypes</tt> and a return type
  <tt>R</tt>, if, given <del>l</del>values <tt>t1, t2, ..., tN</tt> of types
  <tt>T1, T2, ..., TN</tt>, respectively, <tt>INVOKE (f, t1, t2, ..., tN)</tt> is
  well formed (20.7.2) and, if <tt>R</tt> is not <tt>void</tt>, convertible to
  <tt>R</tt>.
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 45664,45680 ----
  </p>
  
  <p>
! Edit 20.9.12.2 [func.wrap.func] paragraph 2:
  </p>
  
! <blockquote><p>
  2  A function object <tt>f</tt> of type <tt>F</tt> is Callable for argument
  types <tt>T1, T2, ..., TN</tt> in <tt>ArgTypes</tt> and a return type
  <tt>R</tt>, if, given <del>l</del>values <tt>t1, t2, ..., tN</tt> of types
  <tt>T1, T2, ..., TN</tt>, respectively, <tt>INVOKE (f, t1, t2, ..., tN)</tt> is
  well formed (20.7.2) and, if <tt>R</tt> is not <tt>void</tt>, convertible to
  <tt>R</tt>.
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** well formed (20.7.2) and, if <tt>R</tt>
*** 43994,44011 ****
  ]</i></p>
  
  
! <blockquote>
  I don't like the reduction to "values" and prefer the alternative solution
  suggested using "lvalues when Ti is an lvalue-reference and rvalues otherwise".
  The reason why I dislike the shorter version is based on different usages of
  "values" as part of defining the semantics of requirement tables via
! expressions. E.g. 20.2.1 [utility.arg.requirements]/1 says "<tt>a</tt>,
  <tt>b</tt>, and <tt>c</tt> are values of type <tt>const T;</tt>" or similar in
  23.2.1 [container.requirements.general]/4 or /14 etc. My current reading
  of all these parts is that <em>both</em> rvalues and lvalues are required to be
  supported, but this interpretation would violate the intention of the suggested
  fix of #815, if I correctly understand Jonathan's rationale.
! </blockquote>
  
  <p><i>[
  2009-12-12 Howard adds:
--- 45682,45699 ----
  ]</i></p>
  
  
! <blockquote><p>
  I don't like the reduction to "values" and prefer the alternative solution
  suggested using "lvalues when Ti is an lvalue-reference and rvalues otherwise".
  The reason why I dislike the shorter version is based on different usages of
  "values" as part of defining the semantics of requirement tables via
! expressions. E.g. 17.6.3.1 [utility.arg.requirements]/1 says "<tt>a</tt>,
  <tt>b</tt>, and <tt>c</tt> are values of type <tt>const T;</tt>" or similar in
  23.2.1 [container.requirements.general]/4 or /14 etc. My current reading
  of all these parts is that <em>both</em> rvalues and lvalues are required to be
  supported, but this interpretation would violate the intention of the suggested
  fix of #815, if I correctly understand Jonathan's rationale.
! </p></blockquote>
  
  <p><i>[
  2009-12-12 Howard adds:
*************** fix of #815, if I correctly understand J
*** 44013,44021 ****
  
  
  <blockquote>
! <blockquote>
  "lvalues when Ti is an lvalue-reference and rvalues otherwise"
! </blockquote>
  <p>
  doesn't quite work here because the <tt>Ti</tt> aren't deduced.  They are
  specified by the <tt>function</tt> type.  <tt>Ti</tt> might be <tt>const
--- 45701,45709 ----
  
  
  <blockquote>
! <blockquote><p>
  "lvalues when Ti is an lvalue-reference and rvalues otherwise"
! </p></blockquote>
  <p>
  doesn't quite work here because the <tt>Ti</tt> aren't deduced.  They are
  specified by the <tt>function</tt> type.  <tt>Ti</tt> might be <tt>const
*************** int&amp;</tt> (an lvalue reference) and
*** 44041,44047 ****
  
  
  <p><i>[
! 2010-02-11 This issue is now addressed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>.
  ]</i></p>
  
  
--- 45729,45735 ----
  
  
  <p><i>[
! 2010-02-11 This issue is now addressed by <a href="lwg-defects.html#870">870</a>.
  ]</i></p>
  
  
*************** c++std-lib.  Rationale added below.
*** 44055,44067 ****
  
  <p><b>Rationale:</b></p>
  <p>
! Addressed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Edit 20.8.14.2 [func.wrap.func] paragraph 2:
  </p>
  
  <blockquote>
--- 45743,45755 ----
  
  <p><b>Rationale:</b></p>
  <p>
! Addressed by <a href="lwg-defects.html#870">870</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Edit 20.9.12.2 [func.wrap.func] paragraph 2:
  </p>
  
  <blockquote>
*************** operand (5 [expr]),</ins> is well formed
*** 44084,44096 ****
  
  <hr>
  <h3><a name="816"></a>816. Should <tt>bind()</tt>'s returned functor have a nofail copy ctor when <tt>bind()</tt> is nofail?</h3>
! <p><b>Section:</b> 20.8.10.1.2 [func.bind.bind] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2008-02-08 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.bind.bind">issues</a> in [func.bind.bind].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Library Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a> notes that <tt>bind(f, t1, ..., tN)</tt>
  should be nofail when <tt>f, t1, ..., tN</tt> have nofail copy ctors.
  </p>
  <p>
--- 45772,45784 ----
  
  <hr>
  <h3><a name="816"></a>816. Should <tt>bind()</tt>'s returned functor have a nofail copy ctor when <tt>bind()</tt> is nofail?</h3>
! <p><b>Section:</b> 20.9.10.3 [func.bind.bind] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2008-02-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.bind.bind">issues</a> in [func.bind.bind].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Library Issue <a href="lwg-defects.html#527">527</a> notes that <tt>bind(f, t1, ..., tN)</tt>
  should be nofail when <tt>f, t1, ..., tN</tt> have nofail copy ctors.
  </p>
  <p>
*************** implementation-defined exceptions unless
*** 44104,44110 ****
  17.4.4.8/3.)
  </p>
  <p>
! Should the nofail guarantee requested by Library Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#527">527</a> be extended
  to cover both calling <tt>bind()</tt> and copying the returned functor?
  </p>
  
--- 45792,45798 ----
  17.4.4.8/3.)
  </p>
  <p>
! Should the nofail guarantee requested by Library Issue <a href="lwg-defects.html#527">527</a> be extended
  to cover both calling <tt>bind()</tt> and copying the returned functor?
  </p>
  
*************** Howard adds:
*** 44113,44130 ****
  ]</i></p>
  
  
! <blockquote>
  <tt>tuple</tt> construction should probably have a similar guarantee.
! </blockquote>
  
  <p><i>[
  San Francisco:
  ]</i></p>
  
  
! <blockquote>
  Howard to provide wording.
! </blockquote>
  
  <p><i>[
  Post Summit, Anthony provided wording.
--- 45801,45818 ----
  ]</i></p>
  
  
! <blockquote><p>
  <tt>tuple</tt> construction should probably have a similar guarantee.
! </p></blockquote>
  
  <p><i>[
  San Francisco:
  ]</i></p>
  
  
! <blockquote><p>
  Howard to provide wording.
! </p></blockquote>
  
  <p><i>[
  Post Summit, Anthony provided wording.
*************** Post Summit, Anthony provided wording.
*** 44135,44166 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Part of all of this issue appears to be rendered moot
! by the proposed resolution to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a> (q.v.).
  We recommend the issues be considered simultaneously
  (or possibly even merged)
  to ensure there is no overlap.
! Move to Open, and likewise for issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a> (see below). Leave Open.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! Move to Ready. Decoupling from issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>.
! </blockquote>
  
  <p><i>[
  2010-02-11 Moved from Ready to Tentatively NAD Editorial, rationale added below.
--- 45823,45854 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Part of all of this issue appears to be rendered moot
! by the proposed resolution to issue <a href="lwg-defects.html#817">817</a> (q.v.).
  We recommend the issues be considered simultaneously
  (or possibly even merged)
  to ensure there is no overlap.
! Move to Open, and likewise for issue <a href="lwg-defects.html#817">817</a>.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
! Related to <a href="lwg-defects.html#817">817</a> (see below). Leave Open.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! Move to Ready. Decoupling from issue <a href="lwg-defects.html#817">817</a>.
! </p></blockquote>
  
  <p><i>[
  2010-02-11 Moved from Ready to Tentatively NAD Editorial, rationale added below.
*************** Move to Ready. Decoupling from issue <a
*** 44171,44183 ****
  
  <p><b>Rationale:</b></p>
  <p>
! This issue is solved as proposed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#817">817</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new sentence to the end of paragraphs 2 and 4 of 20.8.10.1.2 [func.bind.bind]:
  </p>
  
  <blockquote>
--- 45859,45871 ----
  
  <p><b>Rationale:</b></p>
  <p>
! This issue is solved as proposed by <a href="lwg-defects.html#817">817</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new sentence to the end of paragraphs 2 and 4 of 20.9.10.3 [func.bind.bind]:
  </p>
  
  <blockquote>
*************** in <tt>BoundArgs...</tt> throw an except
*** 44208,44217 ****
  
  <hr>
  <h3><a name="817"></a>817. <tt>bind</tt> needs to be moved</h3>
! <p><b>Section:</b> 20.8.10.1.2 [func.bind.bind] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-03-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.bind.bind">issues</a> in [func.bind.bind].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US 72, JP 38 and DE 21</b></p>
  
--- 45896,45905 ----
  
  <hr>
  <h3><a name="817"></a>817. <tt>bind</tt> needs to be moved</h3>
! <p><b>Section:</b> 20.9.10.3 [func.bind.bind] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-03-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.bind.bind">issues</a> in [func.bind.bind].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US 72, JP 38 and DE 21</b></p>
  
*************** requires only move construction of its c
*** 44221,44236 ****
  That way move-only functors can be passed to objects such as <tt>thread</tt>.
  </p>
  <p>
! This issue is related to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#816">816</a>.
  </p>
  
  <p>
  US 72:
  </p>
  
! <blockquote>
  <tt>bind</tt> should support move-only functors and bound arguments.
! </blockquote>
  
  <p>
  JP 38:
--- 45909,45924 ----
  That way move-only functors can be passed to objects such as <tt>thread</tt>.
  </p>
  <p>
! This issue is related to issue <a href="lwg-defects.html#816">816</a>.
  </p>
  
  <p>
  US 72:
  </p>
  
! <blockquote><p>
  <tt>bind</tt> should support move-only functors and bound arguments.
! </p></blockquote>
  
  <p>
  JP 38:
*************** add the move requirement for bind's retu
*** 44244,44250 ****
  For example, assume following <tt>th1</tt> and <tt>th2</tt>,
  </p>
  
! <blockquote><pre>void f(vector&lt;int&gt; v) { }
  
  vector&lt;int&gt; v{ ... };
  thread th1([v]{ f(v); });
--- 45932,45939 ----
  For example, assume following <tt>th1</tt> and <tt>th2</tt>,
  </p>
  
! <blockquote><pre>
! void f(vector&lt;int&gt; v) { }
  
  vector&lt;int&gt; v{ ... };
  thread th1([v]{ f(v); });
*************** And also, add the <tt>MoveConstructible<
*** 44270,44289 ****
  DE 21
  </p>
  
! <blockquote>
  The specification for bind claims twice that "the values and types for
  the bound arguments v1, v2, ..., vN are determined as specified below".
  No such specification appears to exist.
! </blockquote>
  
  <p><i>[
  San Francisco:
  ]</i></p>
  
  
! <blockquote>
  Howard to provide wording.
! </blockquote>
  
  <p><i>[
  Post Summit Alisdair and Howard provided wording.
--- 45959,45978 ----
  DE 21
  </p>
  
! <blockquote><p>
  The specification for bind claims twice that "the values and types for
  the bound arguments v1, v2, ..., vN are determined as specified below".
  No such specification appears to exist.
! </p></blockquote>
  
  <p><i>[
  San Francisco:
  ]</i></p>
  
  
! <blockquote><p>
  Howard to provide wording.
! </p></blockquote>
  
  <p><i>[
  Post Summit Alisdair and Howard provided wording.
*************** a place to see the complete solution in
*** 44302,44311 ****
  <tt>bind</tt> needs to be "moved".
  </li>
  <li>
! 20.8.10.1.2 [func.bind.bind]/p3, p6 and p7 were accidently removed from N2798.
  </li>
  <li>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a> argues for a way to pass by &amp;&amp; for
  efficiency but retain the decaying behavior of pass by value for the
  <tt>thread</tt> constructor.  That same solution is applicable here.
  </li>
--- 45991,46000 ----
  <tt>bind</tt> needs to be "moved".
  </li>
  <li>
! 20.9.10.3 [func.bind.bind]/p3, p6 and p7 were accidently removed from N2798.
  </li>
  <li>
! Issue <a href="lwg-defects.html#929">929</a> argues for a way to pass by &amp;&amp; for
  efficiency but retain the decaying behavior of pass by value for the
  <tt>thread</tt> constructor.  That same solution is applicable here.
  </li>
*************** and recommend both issues be considered
*** 44333,44350 ****
  ]</i></p>
  
  
! <blockquote>
  The proposed resolution uses concepts. Leave Open.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Leave as Open. Howard to provide deconceptified wording.
! </blockquote>
  
  <p><i>[
  2009-11-07 Howard updates wording.
--- 46022,46039 ----
  ]</i></p>
  
  
! <blockquote><p>
  The proposed resolution uses concepts. Leave Open.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Leave as Open. Howard to provide deconceptified wording.
! </p></blockquote>
  
  <p><i>[
  2009-11-07 Howard updates wording.
*************** Moved to Tentatively Ready after 6 posit
*** 44364,44385 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8 [function.objects] p2:
  </p>
  
! <blockquote><pre>template&lt;class F<del>n</del>, class... <del>Types</del> <ins>BoundArgs</ins>&gt;
    <i>unspecified</i> bind(F<del>n</del><ins>&amp;&amp;</ins>, <del>Types</del> <ins>BoundArgs&amp;&amp;</ins>...);
  template&lt;class R, class F<del>n</del>, class... <del>Types</del> <ins>BoundArgs</ins>&gt;
    <i>unspecified</i> bind(F<del>n</del><ins>&amp;&amp;</ins>, <del>Types</del> <ins>BoundArgs&amp;&amp;</ins>...);
  </pre></blockquote>
  
  <p>
! Change 20.8.2 [func.require]:
  </p>
  
  <blockquote>
  <p>
! 4 Every call wrapper (20.8.1 [func.def]) shall be
  <tt><del>Copy</del><ins>Move</ins>Constructible</tt>. A <i>simple call
  wrapper</i> is a call wrapper that is <ins><tt>CopyConstructible</tt> and</ins>
  <tt>CopyAssignable</tt> and whose copy constructor<ins>, move constructor</ins> and assignment operator do not
--- 46053,46075 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9 [function.objects] p2:
  </p>
  
! <blockquote><pre>
! template&lt;class F<del>n</del>, class... <del>Types</del> <ins>BoundArgs</ins>&gt;
    <i>unspecified</i> bind(F<del>n</del><ins>&amp;&amp;</ins>, <del>Types</del> <ins>BoundArgs&amp;&amp;</ins>...);
  template&lt;class R, class F<del>n</del>, class... <del>Types</del> <ins>BoundArgs</ins>&gt;
    <i>unspecified</i> bind(F<del>n</del><ins>&amp;&amp;</ins>, <del>Types</del> <ins>BoundArgs&amp;&amp;</ins>...);
  </pre></blockquote>
  
  <p>
! Change 20.9.2 [func.require]:
  </p>
  
  <blockquote>
  <p>
! 4 Every call wrapper (20.9.1 [func.def]) shall be
  <tt><del>Copy</del><ins>Move</ins>Constructible</tt>. A <i>simple call
  wrapper</i> is a call wrapper that is <ins><tt>CopyConstructible</tt> and</ins>
  <tt>CopyAssignable</tt> and whose copy constructor<ins>, move constructor</ins> and assignment operator do not
*************** throw exceptions. A <i>forwarding call w
*** 44387,44402 ****
  called with an argument list. [<i>Note:</i> in a typical implementation
  forwarding call wrappers have an overloaded function call operator of the form
  </p>
! <blockquote><pre>template&lt;class... <del>ArgTypes</del><ins>UnBoundsArgs</ins>&gt;
  R operator()(<del>ArgTypes</del><ins>UnBoundsArgs</ins>&amp;&amp;... <ins>unbound_</ins>args) cv-qual;
  </pre></blockquote>
  <p>
! — <i>end note</i>]
  </p>
  </blockquote>
  
  <p>
! Change 20.8.10.1.2 [func.bind.bind]:
  </p>
  
  <blockquote>
--- 46077,46093 ----
  called with an argument list. [<i>Note:</i> in a typical implementation
  forwarding call wrappers have an overloaded function call operator of the form
  </p>
! <blockquote><pre>
! template&lt;class... <del>ArgTypes</del><ins>UnBoundsArgs</ins>&gt;
  R operator()(<del>ArgTypes</del><ins>UnBoundsArgs</ins>&amp;&amp;... <ins>unbound_</ins>args) cv-qual;
  </pre></blockquote>
  <p>
! &mdash; <i>end note</i>]
  </p>
  </blockquote>
  
  <p>
! Change 20.9.10.3 [func.bind.bind]:
  </p>
  
  <blockquote>
*************** Let <tt>uj</tt> be the j<sup><i>th</i></
*** 44436,44442 ****
  </ins></li>
  </ul>
  
! <pre>template&lt;class F, class... BoundArgs&gt;
    <i>unspecified</i> bind(F<ins>&amp;&amp;</ins> f, BoundArgs<ins>&amp;&amp;</ins>... bound_args);
  </pre>
  
--- 46127,46134 ----
  </ins></li>
  </ul>
  
! <pre>
! template&lt;class F, class... BoundArgs&gt;
    <i>unspecified</i> bind(F<ins>&amp;&amp;</ins> f, BoundArgs<ins>&amp;&amp;</ins>... bound_args);
  </pre>
  
*************** shall be <tt>true</tt>.</ins>
*** 44450,44461 ****
  <tt>true</tt></ins>.
  <del><tt>F</tt> and each <tt>Ti</tt> in
  <tt>BoundArgs</tt> shall be CopyConstructible.</del>
! <tt><i>INVOKE</i>(f<ins>d</ins>, w1, w2, ..., wN)</tt> (20.8.2 [func.require]) shall be a valid expression for some values
  <i>w1, w2, ..., wN</i>, where <tt>N == sizeof...(bound_args)</tt>.
  </p>
  <p>
  -2- <i>Returns:</i> A forwarding call wrapper <tt>g</tt> with a weak
! result type (20.8.2 [func.require]). The effect of <tt>g(u1, u2,
  ..., uM)</tt> shall be <tt><i>INVOKE</i>(f<ins>d</ins>, v1, v2, ..., vN,
  result_of&lt;F<ins>D</ins> <i>cv</i> (V1, V2, ..., VN)&gt;::type)</tt>, where
  <i>cv</i> represents the <i>cv</i>-qualifiers of <tt>g</tt> and the
--- 46142,46153 ----
  <tt>true</tt></ins>.
  <del><tt>F</tt> and each <tt>Ti</tt> in
  <tt>BoundArgs</tt> shall be CopyConstructible.</del>
! <tt><i>INVOKE</i>(f<ins>d</ins>, w1, w2, ..., wN)</tt> (20.9.2 [func.require]) shall be a valid expression for some values
  <i>w1, w2, ..., wN</i>, where <tt>N == sizeof...(bound_args)</tt>.
  </p>
  <p>
  -2- <i>Returns:</i> A forwarding call wrapper <tt>g</tt> with a weak
! result type (20.9.2 [func.require]). The effect of <tt>g(u1, u2,
  ..., uM)</tt> shall be <tt><i>INVOKE</i>(f<ins>d</ins>, v1, v2, ..., vN,
  result_of&lt;F<ins>D</ins> <i>cv</i> (V1, V2, ..., VN)&gt;::type)</tt>, where
  <i>cv</i> represents the <i>cv</i>-qualifiers of <tt>g</tt> and the
*************** requirements of <tt>MoveConstructible</t
*** 44479,44491 ****
  <tt>TiD</tt> satisfy the requirements of <tt>CopyConstructible</tt> then
  the <i>unspecified</i> return type shall satisfy the requirements of
  <tt>CopyConstructible</tt>. [<i>Note:</i> This implies that all of
! <tt>FD</tt> and <tt>TiD</tt> shall be <tt>MoveConstructible</tt> —
  <i>end note</i>]
  </ins>
  </p>
  </blockquote>
  
! <pre>template&lt;class R, class F, class... BoundArgs&gt;
    <i>unspecified</i> bind(F<ins>&amp;&amp;</ins> f, BoundArgs<ins>&amp;&amp;</ins>... bound_args);
  </pre>
  
--- 46171,46184 ----
  <tt>TiD</tt> satisfy the requirements of <tt>CopyConstructible</tt> then
  the <i>unspecified</i> return type shall satisfy the requirements of
  <tt>CopyConstructible</tt>. [<i>Note:</i> This implies that all of
! <tt>FD</tt> and <tt>TiD</tt> shall be <tt>MoveConstructible</tt> &mdash;
  <i>end note</i>]
  </ins>
  </p>
  </blockquote>
  
! <pre>
! template&lt;class R, class F, class... BoundArgs&gt;
    <i>unspecified</i> bind(F<ins>&amp;&amp;</ins> f, BoundArgs<ins>&amp;&amp;</ins>... bound_args);
  </pre>
  
*************** requirements of <tt>MoveConstructible</t
*** 44527,44533 ****
  <tt>TiD</tt> satisfy the requirements of <tt>CopyConstructible</tt> then
  the <i>unspecified</i> return type shall satisfy the requirements of
  <tt>CopyConstructible</tt>. [<i>Note:</i> This implies that all of
! <tt>FD</tt> and <tt>TiD</tt> shall be <tt>MoveConstructible</tt> —
  <i>end note</i>]
  </ins>
  </p>
--- 46220,46226 ----
  <tt>TiD</tt> satisfy the requirements of <tt>CopyConstructible</tt> then
  the <i>unspecified</i> return type shall satisfy the requirements of
  <tt>CopyConstructible</tt>. [<i>Note:</i> This implies that all of
! <tt>FD</tt> and <tt>TiD</tt> shall be <tt>MoveConstructible</tt> &mdash;
  <i>end note</i>]
  </ins>
  </p>
*************** is <tt>Ti<ins>D</ins> <i>cv</i> &amp;</t
*** 44578,44587 ****
  
  <hr>
  <h3><a name="818"></a>818. wording for memory ordering</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2008-03-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  29.3 [atomics.order] p1 says in the table that
--- 46271,46281 ----
  
  <hr>
  <h3><a name="818"></a>818. wording for memory ordering</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2008-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.order">active issues</a> in [atomics.order].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  29.3 [atomics.order] p1 says in the table that
*************** is <tt>Ti<ins>D</ins> <i>cv</i> &amp;</t
*** 44589,44602 ****
  
  <blockquote>
  <table border="1">
! <tbody><tr>
  <th>Element</th><th>Meaning</th>
  </tr>
  <tr>
  <td><tt>memory_order_acq_rel</tt></td>
  <td>the operation has both acquire and release semantics</td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
--- 46283,46296 ----
  
  <blockquote>
  <table border="1">
! <tr>
  <th>Element</th><th>Meaning</th>
  </tr>
  <tr>
  <td><tt>memory_order_acq_rel</tt></td>
  <td>the operation has both acquire and release semantics</td>
  </tr>
! </table>
  </blockquote>
  
  <p>
*************** Then, p1 says in the table:
*** 44610,44616 ****
  
  <blockquote>
  <table border="1">
! <tbody><tr>
  <th>Element</th><th>Meaning</th>
  </tr>
  <tr>
--- 46304,46310 ----
  
  <blockquote>
  <table border="1">
! <tr>
  <th>Element</th><th>Meaning</th>
  </tr>
  <tr>
*************** Then, p1 says in the table:
*** 44618,44624 ****
  <td>the operation has both acquire and release semantics,
      and, in addition, has sequentially-consistent operation ordering</td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
--- 46312,46318 ----
  <td>the operation has both acquire and release semantics,
      and, in addition, has sequentially-consistent operation ordering</td>
  </tr>
! </table>
  </blockquote>
  
  <p>
*************** constraints.
*** 44630,44640 ****
  I'm then reading p2, where it says:
  </p>
  
! <blockquote>
  The <tt>memory_order_seq_cst</tt> operations that load a value are acquire operations
  on the affected locations. The <tt>memory_order_seq_cst</tt> operations that store a value
  are release operations on the affected locations.
! </blockquote>
  
  <p>
  That seems to imply that atomic reads only have acquire semantics.  If that
--- 46324,46334 ----
  I'm then reading p2, where it says:
  </p>
  
! <blockquote><p>
  The <tt>memory_order_seq_cst</tt> operations that load a value are acquire operations
  on the affected locations. The <tt>memory_order_seq_cst</tt> operations that store a value
  are release operations on the affected locations.
! </p></blockquote>
  
  <p>
  That seems to imply that atomic reads only have acquire semantics.  If that
*************** And why does 29.6 [atomics.types.operati
*** 44665,44674 ****
  </p>
  
  
! <blockquote>
  <i>Requires:</i> The order argument shall not be <tt>memory_order_acquire</tt>
  nor <tt>memory_order_acq_rel</tt>.
! </blockquote>
  
  <p>
  (Since this is exactly the same restriction as for "store", it seems to be a typo.)
--- 46359,46368 ----
  </p>
  
  
! <blockquote><p>
  <i>Requires:</i> The order argument shall not be <tt>memory_order_acquire</tt>
  nor <tt>memory_order_acq_rel</tt>.
! </p></blockquote>
  
  <p>
  (Since this is exactly the same restriction as for "store", it seems to be a typo.)
*************** nor <tt>memory_order_acq_rel</tt>.
*** 44678,44689 ****
  And then: 29.6 [atomics.types.operations] p12:
  </p>
  
! <blockquote>
  These operations are read-modify-write operations in the sense of the
  "synchronizes with" definition (1.10 [intro.multithread]), so both such an operation and the
  evaluation that produced the input value synchronize with any evaluation
  that reads the updated value.
! </blockquote>
  
  <p>
  This is redundant with 1.10 [intro.multithread], see above for the reasoning.
--- 46372,46383 ----
  And then: 29.6 [atomics.types.operations] p12:
  </p>
  
! <blockquote><p>
  These operations are read-modify-write operations in the sense of the
  "synchronizes with" definition (1.10 [intro.multithread]), so both such an operation and the
  evaluation that produced the input value synchronize with any evaluation
  that reads the updated value.
! </p></blockquote>
  
  <p>
  This is redundant with 1.10 [intro.multithread], see above for the reasoning.
*************** all of the atomics issues in one paper.
*** 44710,44716 ****
  
  <p>
  This issue is addressed in
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2783.html">N2783</a>.
  </p>
  </blockquote>
  
--- 46404,46410 ----
  
  <p>
  This issue is addressed in
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2783.htm">N2783</a>.
  </p>
  </blockquote>
  
*************** remove table 136 in 29.3 [atomics.order]
*** 44755,44762 ****
  
  <blockquote>
  <table border="1">
! <caption><del>Table 136 — memory_order effects</del></caption>
! <tbody><tr><th><del>Element</del></th><th><del>Meaning</del></th></tr>
  <tr><td valign="top"><del><code>memory_order_relaxed</code></del></td>
  <td valign="top"><del>the operation does not order memory</del></td></tr>
  <tr><td valign="top"><del><code>memory_order_release</code></del></td>
--- 46449,46456 ----
  
  <blockquote>
  <table border="1">
! <caption><del>Table 136 &mdash; memory_order effects</del></caption>
! <tr><th><del>Element</del></th><th><del>Meaning</del></th></tr>
  <tr><td valign="top"><del><code>memory_order_relaxed</code></del></td>
  <td valign="top"><del>the operation does not order memory</del></td></tr>
  <tr><td valign="top"><del><code>memory_order_release</code></del></td>
*************** that are dependencies of this consume op
*** 44782,44788 ****
  <tr><td valign="top"><del><code>memory_order_seq_cst</code></del></td>
  <td valign="top"><del>the operation has both acquire and release semantics,
  and, in addition, has sequentially-consistent operation ordering</del></td></tr>
! </tbody></table>
  </blockquote>
  
  <p>
--- 46476,46482 ----
  <tr><td valign="top"><del><code>memory_order_seq_cst</code></del></td>
  <td valign="top"><del>the operation has both acquire and release semantics,
  and, in addition, has sequentially-consistent operation ordering</del></td></tr>
! </table>
  </blockquote>
  
  <p>
*************** it can always be extended to an order
*** 44811,44817 ****
  that does include lock and unlock operations,
  since the ordering between those
  is already included in the happens before ordering.
! —<i>end note</i>]
  </p>
  </blockquote>
  
--- 46505,46511 ----
  that does include lock and unlock operations,
  since the ordering between those
  is already included in the happens before ordering.
! &mdash;<i>end note</i>]
  </p>
  </blockquote>
  
*************** is already included in the happens befor
*** 44822,44831 ****
  
  <hr>
  <h3><a name="819"></a>819. rethrow_if_nested</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-03-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Looking at the wording I submitted for <tt>rethrow_if_nested</tt>, I don't think I
--- 46516,46526 ----
  
  <hr>
  <h3><a name="819"></a>819. rethrow_if_nested</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-03-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#except.nested">active issues</a> in [except.nested].</p>
! <p><b>View all other</b> <a href="lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Looking at the wording I submitted for <tt>rethrow_if_nested</tt>, I don't think I
*************** The current wording says:
*** 44837,44843 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class E&gt; void rethrow_if_nested(const E&amp; e);
  </pre>
  <blockquote>
  <p>
--- 46532,46539 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class E&gt; void rethrow_if_nested(const E&amp; e);
  </pre>
  <blockquote>
  <p>
*************** San Francisco:
*** 44859,44876 ****
  ]</i></p>
  
  
! <blockquote>
  Alisdair was volunteered to provide wording.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Leave as Open. Alisdair to provide wording.
! </blockquote>
  
  <p><i>[
  2009-11-09 Alisdair provided wording.
--- 46555,46572 ----
  ]</i></p>
  
  
! <blockquote><p>
  Alisdair was volunteered to provide wording.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Leave as Open. Alisdair to provide wording.
! </p></blockquote>
  
  <p><i>[
  2009-11-09 Alisdair provided wording.
*************** Leave as Open. Alisdair to provide wordi
*** 44887,44895 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready for Pittsburgh.
! </blockquote>
  
  
  
--- 46583,46591 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready for Pittsburgh.
! </p></blockquote>
  
  
  
*************** Moved to Ready for Pittsburgh.
*** 44898,44912 ****
  Change 18.8.6 [except.nested], p8:
  </p>
  
! <blockquote><pre>template &lt;class E&gt; void rethrow_if_nested(const E&amp; e);
  </pre>
! <blockquote>
  -8- <i>Effects:</i> <del>Calls <tt>e.rethrow_nested()</tt>
  o</del><ins>O</ins>nly if <ins>the dynamic type of</ins> <tt>e</tt> is
  publicly <ins>and unambiguously</ins> derived from
  <tt>nested_exception</tt> <ins>this calls
  <tt>dynamic_cast&lt;const nested_exception&amp;&gt;(e).rethrow_nested()</tt></ins>.
! </blockquote>
  </blockquote>
  
  
--- 46594,46609 ----
  Change 18.8.6 [except.nested], p8:
  </p>
  
! <blockquote><pre>
! template &lt;class E&gt; void rethrow_if_nested(const E&amp; e);
  </pre>
! <blockquote><p>
  -8- <i>Effects:</i> <del>Calls <tt>e.rethrow_nested()</tt>
  o</del><ins>O</ins>nly if <ins>the dynamic type of</ins> <tt>e</tt> is
  publicly <ins>and unambiguously</ins> derived from
  <tt>nested_exception</tt> <ins>this calls
  <tt>dynamic_cast&lt;const nested_exception&amp;&gt;(e).rethrow_nested()</tt></ins>.
! </p></blockquote>
  </blockquote>
  
  
*************** publicly <ins>and unambiguously</ins> de
*** 44916,44926 ****
  
  <hr>
  <h3><a name="820"></a>820. <tt>current_exception()</tt>'s interaction with throwing copy ctors</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2008-03-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As of N2521, the Working Paper appears to be silent about what
--- 46613,46622 ----
  
  <hr>
  <h3><a name="820"></a>820. <tt>current_exception()</tt>'s interaction with throwing copy ctors</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2008-03-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As of N2521, the Working Paper appears to be silent about what
*************** consistent and does not introduce any ne
*** 44962,44972 ****
  However, the resolution of core issue 475 may relax this requirement:
  </p>
  
! <blockquote>
  The CWG agreed with the position that <tt>std::uncaught_exception()</tt> should
  return <tt>false</tt> during the copy to the exception object and that <tt>std::terminate()</tt>
  should not be called if that constructor exits with an exception.
! </blockquote>
  
  <p>
  Since throwing copy constructors will no longer call <tt>terminate()</tt>, option
--- 46658,46668 ----
  However, the resolution of core issue 475 may relax this requirement:
  </p>
  
! <blockquote><p>
  The CWG agreed with the position that <tt>std::uncaught_exception()</tt> should
  return <tt>false</tt> during the copy to the exception object and that <tt>std::terminate()</tt>
  should not be called if that constructor exits with an exception.
! </p></blockquote>
  
  <p>
  Since throwing copy constructors will no longer call <tt>terminate()</tt>, option
*************** Pete will make the required editorial tw
*** 45026,45041 ****
  
  <hr>
  <h3><a name="821"></a>821. Minor cleanup : <tt>unique_ptr</tt></h3>
! <p><b>Section:</b> 20.9.9.3.3 [unique.ptr.runtime.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-03-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Reading resolution of LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a> I noticed the following:
  </p>
  
  <blockquote>
! <pre>void reset(<del>T*</del> <ins>pointer</ins> p = <del>0</del> <ins>pointer()</ins>);
  </pre>
  
  <p>
--- 46722,46739 ----
  
  <hr>
  <h3><a name="821"></a>821. Minor cleanup : <tt>unique_ptr</tt></h3>
! <p><b>Section:</b> 20.8.1.3.4 [unique.ptr.runtime.modifiers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-03-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.runtime.modifiers">issues</a> in [unique.ptr.runtime.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Reading resolution of LWG issue <a href="lwg-defects.html#673">673</a> I noticed the following:
  </p>
  
  <blockquote>
! <pre>
! void reset(<del>T*</del> <ins>pointer</ins> p = <del>0</del> <ins>pointer()</ins>);
  </pre>
  
  <p>
*************** to be a stronger match than the deleted
*** 45055,45065 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to class template definition in 20.9.9.3 [unique.ptr.runtime]
  </p>
  
  <blockquote>
! <pre>// modifiers 
  pointer release(); 
  void reset(pointer p = pointer()); 
  <ins>void reset( nullptr_t );</ins>
--- 46753,46764 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to class template definition in 20.8.1.3 [unique.ptr.runtime]
  </p>
  
  <blockquote>
! <pre>
! // modifiers 
  pointer release(); 
  void reset(pointer p = pointer()); 
  <ins>void reset( nullptr_t );</ins>
*************** void swap(unique_ptr&amp;&amp; u);
*** 45069,45079 ****
  </blockquote>
  
  <p>
! Update 20.9.9.3.3 [unique.ptr.runtime.modifiers]
  </p>
  
  <blockquote>
! <pre>void reset(pointer p = pointer());
  <ins>void reset(nullptr_t);</ins>
  </pre>
  
--- 46768,46779 ----
  </blockquote>
  
  <p>
! Update 20.8.1.3.4 [unique.ptr.runtime.modifiers]
  </p>
  
  <blockquote>
! <pre>
! void reset(pointer p = pointer());
  <ins>void reset(nullptr_t);</ins>
  </pre>
  
*************** templated overload. <i>-- end note</i>]<
*** 45090,45096 ****
  </blockquote>
  
  <p><i>[
! Note this wording incorporates resolutions for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#806">806</a> (New) and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a> (Ready).
  ]</i></p>
  
  
--- 46790,46796 ----
  </blockquote>
  
  <p><i>[
! Note this wording incorporates resolutions for <a href="lwg-defects.html#806">806</a> (New) and <a href="lwg-defects.html#673">673</a> (Ready).
  ]</i></p>
  
  
*************** Note this wording incorporates resolutio
*** 45100,45113 ****
  
  <hr>
  <h3><a name="823"></a>823. <tt>identity&lt;void&gt;</tt> seems broken</h3>
! <p><b>Section:</b> 20.3.3 [forward] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2008-04-09 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  N2588 seems to have added an <tt>operator()</tt> member function to the
! <tt>identity&lt;&gt;</tt> helper in 20.3.3 [forward].  I believe this change makes it no
  longer possible to instantiate <tt>identity&lt;void&gt;</tt>, as it would require
  forming a reference-to-<tt>void</tt> type as this <tt>operator()</tt>'s parameter type.
  </p>
--- 46800,46813 ----
  
  <hr>
  <h3><a name="823"></a>823. <tt>identity&lt;void&gt;</tt> seems broken</h3>
! <p><b>Section:</b> 20.2.4 [forward] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Walter Brown <b>Opened:</b> 2008-04-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  N2588 seems to have added an <tt>operator()</tt> member function to the
! <tt>identity&lt;&gt;</tt> helper in 20.2.4 [forward].  I believe this change makes it no
  longer possible to instantiate <tt>identity&lt;void&gt;</tt>, as it would require
  forming a reference-to-<tt>void</tt> type as this <tt>operator()</tt>'s parameter type.
  </p>
*************** Alberto provided proposed wording.
*** 45143,45159 ****
  <p>
  This issue became closed, because the <tt>ReferentType</tt> requirement
  fixed the problem - this is no longer the case. In retrospective it seems
! to be that the root of current issues around <tt>std::identity</tt> (823, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#700">700</a>,
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>)
  is that it was standardized as something very different (an unconditional
  type mapper) than traditional usage indicated (a function object that should
  derive from <tt>std::unary_function)</tt>, as the SGI definition does. This issue could
! be solved, if <tt>std::identity</tt> is removed (one proposal of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>), but until this
  has been decided, this issue should remain open. An alternative for
  removing it, would be, to do the following:
  </p>
  
! <ol type="a">
  <li>
  <p>
  Let <tt>identity</tt> stay as a <em>real</em> function object, which would
--- 46843,46859 ----
  <p>
  This issue became closed, because the <tt>ReferentType</tt> requirement
  fixed the problem - this is no longer the case. In retrospective it seems
! to be that the root of current issues around <tt>std::identity</tt> (823, <a href="lwg-defects.html#700">700</a>,
! <a href="lwg-defects.html#939">939</a>)
  is that it was standardized as something very different (an unconditional
  type mapper) than traditional usage indicated (a function object that should
  derive from <tt>std::unary_function)</tt>, as the SGI definition does. This issue could
! be solved, if <tt>std::identity</tt> is removed (one proposal of <a href="lwg-defects.html#939">939</a>), but until this
  has been decided, this issue should remain open. An alternative for
  removing it, would be, to do the following:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
  Let <tt>identity</tt> stay as a <em>real</em> function object, which would
*************** now properly
*** 45161,45167 ****
  derive from <tt>unary_function</tt>:
  </p>
  
! <blockquote><pre>template &lt;class T&gt; struct identity : unary_function&lt;T, T&gt; {
    const T&amp; operator()(const T&amp;) const;
  };
  </pre></blockquote>
--- 46861,46868 ----
  derive from <tt>unary_function</tt>:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; struct identity : unary_function&lt;T, T&gt; {
    const T&amp; operator()(const T&amp;) const;
  };
  </pre></blockquote>
*************** derive from <tt>unary_function</tt>:
*** 45171,45180 ****
  <p>
  Invent (if needed) a generic type wrapper (corresponding to concept
  <tt>IdentityOf</tt>),
! e.g. <tt>identity_of</tt>, and move it's prototype description back to 20.3.3 [forward]:
  </p>
  
! <blockquote><pre>template &lt;class T&gt; struct identity_of {
    typedef T type;
  };
  </pre></blockquote>
--- 46872,46882 ----
  <p>
  Invent (if needed) a generic type wrapper (corresponding to concept
  <tt>IdentityOf</tt>),
! e.g. <tt>identity_of</tt>, and move it's prototype description back to 20.2.4 [forward]:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; struct identity_of {
    typedef T type;
  };
  </pre></blockquote>
*************** instead of <tt>identity</tt>.
*** 45192,45209 ****
  ]</i></p>
  
  
! <blockquote>
! Mark as <del>NAD Editorial</del><ins>Resolved</ins>, fixed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#939">939</a>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change definition of <tt>identity</tt> in 20.3.3 [forward], paragraph 2, to:
  </p>
  
! <blockquote><pre>template &lt;class T&gt;  struct identity {
      typedef T type;
  
      <ins>requires ReferentType&lt;T&gt;</ins>
--- 46894,46912 ----
  ]</i></p>
  
  
! <blockquote><p>
! Mark as <del>NAD Editorial</del><ins>Resolved</ins>, fixed by <a href="lwg-defects.html#939">939</a>.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change definition of <tt>identity</tt> in 20.2.4 [forward], paragraph 2, to:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt;  struct identity {
      typedef T type;
  
      <ins>requires ReferentType&lt;T&gt;</ins>
*************** Change definition of <tt>identity</tt> i
*** 45211,45217 ****
    };
  </pre></blockquote>
  <p>...</p>
! <blockquote><pre>  <ins>requires ReferentType&lt;T&gt;</ins>
      const T&amp; operator()(const T&amp; x) const;
  </pre></blockquote>
  
--- 46914,46921 ----
    };
  </pre></blockquote>
  <p>...</p>
! <blockquote><pre>
!   <ins>requires ReferentType&lt;T&gt;</ins>
      const T&amp; operator()(const T&amp; x) const;
  </pre></blockquote>
  
*************** than <tt>cv void</tt> which aren't refer
*** 45232,45241 ****
  
  <hr>
  <h3><a name="824"></a>824. rvalue ref issue with <tt>basic_string</tt> inserter</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-04-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the current working paper, the <tt>&lt;string&gt;</tt> header synopsis at the end of
--- 46936,46945 ----
  
  <hr>
  <h3><a name="824"></a>824. rvalue ref issue with <tt>basic_string</tt> inserter</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-04-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the current working paper, the <tt>&lt;string&gt;</tt> header synopsis at the end of
*************** In the current working paper, the <tt>&l
*** 45243,45249 ****
  for <tt>basic_string</tt>.
  </p>
  
! <blockquote><pre>template&lt;class charT, class traits, class Allocator&gt;
   basic_ostream&lt;charT, traits&gt;&amp;
     operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp;&amp; os,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; str);
--- 46947,46954 ----
  for <tt>basic_string</tt>.
  </p>
  
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
   basic_ostream&lt;charT, traits&gt;&amp;
     operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp;&amp; os,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; str);
*************** for <tt>basic_string</tt>.
*** 45253,45259 ****
  The definition in 21.4.8.9 [string.io] lists two:
  </p>
  
! <blockquote><pre>template&lt;class charT, class traits, class Allocator&gt;
   basic_ostream&lt;charT, traits&gt;&amp;
     operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp; os,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; str);
--- 46958,46965 ----
  The definition in 21.4.8.9 [string.io] lists two:
  </p>
  
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
   basic_ostream&lt;charT, traits&gt;&amp;
     operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp; os,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; str);
*************** signatures in 21.4.8.9 [string.io] shoul
*** 45275,45281 ****
  Delete the first of the two signatures in 21.4.8.9 [string.io]:
  </p>
  
! <blockquote><pre><del>template&lt;class charT, class traits, class Allocator&gt;
   basic_ostream&lt;charT, traits&gt;&amp;
     operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp; os,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; str);</del>
--- 46981,46988 ----
  Delete the first of the two signatures in 21.4.8.9 [string.io]:
  </p>
  
! <blockquote><pre>
! <del>template&lt;class charT, class traits, class Allocator&gt;
   basic_ostream&lt;charT, traits&gt;&amp;
     operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp; os,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; str);</del>
*************** template&lt;class charT, class traits, c
*** 45291,45301 ****
  
  
  <hr>
  <h3><a name="827"></a>827. <tt>constexpr shared_ptr::shared_ptr()?</tt></h3>
! <p><b>Section:</b> 20.9.10.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-04-11 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Would anyone object to making the default constructor of <tt>shared_ptr</tt> (and
--- 46998,47079 ----
  
  
  <hr>
+ <h3><a name="825"></a>825. Missing rvalues reference stream insert&#47;extract operators?</h3>
+ <p><b>Section:</b> 19.5.2.1 [syserr.errcode.overview], 20.8.2.2.11 [util.smartptr.shared.io], 22.4.8 [facets.examples], 20.6.4 [bitset.operators], 26.4.6 [complex.ops], 27.6 [stream.buffers], 28.9 [re.submatch] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-04-10 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses UK 220</b></p>
+ 
+ <p>
+ Should the following use rvalues references to stream in insert/extract operators?
+ </p>
+ 
+ <ul>
+ <li>19.5.2.1 [syserr.errcode.overview]</li>
+ <li>20.8.2.2.11 [util.smartptr.shared.io]</li>
+ <li>22.4.8 [facets.examples]</li>
+ <li>20.6.4 [bitset.operators]</li>
+ <li>26.4.6 [complex.ops]</li>
+ <li>Doubled signatures in 27.6 [stream.buffers] for character inserters
+ (ref 27.7.3.6.4 [ostream.inserters.character])
+ + definition 27.7.3.6.4 [ostream.inserters.character]</li>
+ <li>28.9 [re.submatch]</li>
+ </ul>
+ 
+ <p><i>[
+ Sophia Antipolis
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Agree with the idea in the issue, Alisdair to provide wording.
+ </p></blockquote>
+ 
+ <p><i>[
+ Daniel adds 2009-02-14:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ The proposal given in the paper
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2831.html">N2831</a>
+ apparently resolves this issue.
+ </p></blockquote>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote>
+ <p>
+ The cited paper is an earlier version of
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2844.html">N2844</a>,
+ which changed the rvalue reference binding rules.
+ That paper includes generic templates
+ <tt>operator&lt;&lt;</tt> and <tt>operator&gt;&gt;</tt>
+ that adapt rvalue streams.
+ </p>
+ <p>
+ We therefore agree with Daniel's observation. Move to <del>NAD Editorial</del><ins>Resolved</ins>.
+ </p>
+ </blockquote>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="827"></a>827. <tt>constexpr shared_ptr::shared_ptr()?</tt></h3>
! <p><b>Section:</b> 20.8.2.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-04-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Would anyone object to making the default constructor of <tt>shared_ptr</tt> (and
*************** literal types.  Otherwise this should be
*** 45346,45356 ****
  ]</i></p>
  
  
! <blockquote>
  If Alisdair's 2009-05-01 comment is correct, wouldn't that also make
  <tt>constexpr mutex()</tt> useless, because this class has a non-trivial
! destructor? (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#828">828</a>)
! </blockquote>
  
  <p><i>[
  2009-07-21 Alisdair adds:
--- 47124,47134 ----
  ]</i></p>
  
  
! <blockquote><p>
  If Alisdair's 2009-05-01 comment is correct, wouldn't that also make
  <tt>constexpr mutex()</tt> useless, because this class has a non-trivial
! destructor? (<a href="lwg-defects.html#828">828</a>)
! </p></blockquote>
  
  <p><i>[
  2009-07-21 Alisdair adds:
*************** Recommend we declare the default constru
*** 45376,45407 ****
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.html">N2994</a>.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.10.2 [util.smartptr.shared] and 20.9.10.2.1 [util.smartptr.shared.const]:
  </p>
  
! <blockquote><pre><ins>constexpr</ins> shared_ptr();
  </pre></blockquote>
  
  <p>
! Change 20.9.10.3 [util.smartptr.weak] and 20.9.10.3.1 [util.smartptr.weak.const]:
  </p>
  
! <blockquote><pre><ins>constexpr</ins> weak_ptr();
  </pre></blockquote>
  
  <p>
! Change 20.9.10.4 [util.smartptr.enab] (2 places):
  </p>
  
! <blockquote><pre><ins>constexpr</ins> enable_shared_from_this();
  </pre></blockquote>
  
  
--- 47154,47188 ----
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.htm">N2994</a>.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.2.2 [util.smartptr.shared] and 20.8.2.2.1 [util.smartptr.shared.const]:
  </p>
  
! <blockquote><pre>
! <ins>constexpr</ins> shared_ptr();
  </pre></blockquote>
  
  <p>
! Change 20.8.2.3 [util.smartptr.weak] and 20.8.2.3.1 [util.smartptr.weak.const]:
  </p>
  
! <blockquote><pre>
! <ins>constexpr</ins> weak_ptr();
  </pre></blockquote>
  
  <p>
! Change 20.8.2.5 [util.smartptr.enab] (2 places):
  </p>
  
! <blockquote><pre>
! <ins>constexpr</ins> enable_shared_from_this();
  </pre></blockquote>
  
  
*************** Change 20.9.10.4 [util.smartptr.enab] (2
*** 45410,45421 ****
  
  
  <hr>
  <h3><a name="829"></a>829. current_exception wording unclear about exception type</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-04-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Consider this code:</p>
  
--- 47191,47307 ----
  
  
  <hr>
+ <h3><a name="828"></a>828. Static initialization for <tt>std::mutex</tt>?</h3>
+ <p><b>Section:</b> 30.4.1.2.1 [thread.mutex.class] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-04-18 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.class">issues</a> in [thread.mutex.class].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ [Note: I'm assuming here that 3.6.2 [basic.start.init]/1 will be fixed.]
+ </p>
+ <p>
+ Currently <tt>std::mutex</tt> doesn't support static initialization. This is a
+ regression with respect to <tt>pthread_mutex_t</tt>, which does. I believe that
+ we should strive to eliminate such regressions in expressive power where
+ possible, both to ease migration and to not provide incentives to (or
+ force) people to forego the C++ primitives in favor of pthreads.
+ </p>
+ 
+ <p><i>[
+ Sophia Antipolis:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ We believe this is implementable on POSIX, because the initializer-list
+ feature and the constexpr feature make this work. Double-check core
+ language about static initialization for this case. Ask core for a core
+ issue about order of destruction of statically-initialized objects wrt.
+ dynamically-initialized objects (should come afterwards). Check
+ non-POSIX systems for implementability.
+ </p>
+ <p>
+ If ubiquitous implementability cannot be assured, plan B is to introduce
+ another constructor, make this constexpr, which is
+ conditionally-supported. To avoid ambiguities, this new constructor needs
+ to have an additional parameter.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ Post Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Jens: constant initialization seems to be ok core-language wise
+ </p>
+ <p>
+ Consensus: Defer to threading experts, in particular a Microsoft platform expert.
+ </p>
+ <p>
+ Lawrence to send e-mail to Herb Sutter, Jonathan Caves, Anthony Wiliams,
+ Paul McKenney, Martin Tasker, Hans Boehm, Bill Plauger, Pete Becker,
+ Peter Dimov to alert them of this issue.
+ </p>
+ <p>
+ Lawrence: What about header file shared with C? The initialization syntax is different in C and C++.
+ </p>
+ <p>
+ Recommend Keep in Review
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote><p>
+ Keep in Review status pending feedback from members of the Concurrency subgroup.
+ </p></blockquote>
+ 
+ <p><i>[
+ See related comments from Alisdair and Daniel in <a href="lwg-defects.html#827">827</a>.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.htm">N2994</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change 30.4.1.2.1 [thread.mutex.class]:
+ </p>
+ 
+ <blockquote><pre>
+ class mutex {
+ public:
+   <ins>constexpr</ins> mutex();
+   ...
+ </pre></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="829"></a>829. current_exception wording unclear about exception type</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-04-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>Consider this code:</p>
  
*************** creates a new copy each time it is calle
*** 45507,45520 ****
  
  
  <hr>
! <h3><a name="834"></a>834. Unique_ptr::pointer requirements underspecified</h3>
! <p><b>Section:</b> 20.9.9.2 [unique.ptr.single] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-05-14 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.single">issues</a> in [unique.ptr.single].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#673">673</a> (including recent updates by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#821">821</a>) proposes a useful
  extension point for <tt>unique_ptr</tt> by granting support for an optional
  <tt>deleter_type::pointer</tt> to act as pointer-like replacement for <tt>element_type*</tt>
  (In the following: <tt>pointer</tt>).
--- 47393,47406 ----
  
  
  <hr>
! <h3><a name="834"></a>834. <tt>unique_ptr::pointer</tt> requirements underspecified</h3>
! <p><b>Section:</b> 20.8.1.2 [unique.ptr.single] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-05-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single">issues</a> in [unique.ptr.single].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="lwg-defects.html#673">673</a> (including recent updates by <a href="lwg-defects.html#821">821</a>) proposes a useful
  extension point for <tt>unique_ptr</tt> by granting support for an optional
  <tt>deleter_type::pointer</tt> to act as pointer-like replacement for <tt>element_type*</tt>
  (In the following: <tt>pointer</tt>).
*************** impact on at least two key features of <
*** 45530,45549 ****
  </ol>
  
  <p>
! <tt>Unique_ptr</tt> specification makes great efforts to require that essentially *all*
  operations cannot throw and therefore adds proper wording to the affected
  operations of the deleter as well. If user-provided <tt>pointer</tt>-emulating types
! ("smart pointers") will be allowed, either *all* throw-nothing clauses have to
  be replaced by weaker "An exception is thrown only if <tt>pointer</tt>'s {op} throws
  an exception"-clauses or it has to be said explicitly that all used
! operations of
! <tt>pointer</tt> are required *not* to throw. I understand the main focus of <tt>unique_ptr</tt>
! to be as near as possible to the advantages of native pointers which cannot
  fail and thus strongly favor the second choice. Also, the alternative position
  would make it much harder to write safe and simple template code for
  <tt>unique_ptr</tt>. Additionally, I assume that a general statement need to be given
  that all of the expressions of <tt>pointer</tt> used to define semantics are required to
! be well-formed and well-defined (also as back-end for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#762">762</a>).
  </p>
  
  <p><i>[
--- 47416,47434 ----
  </ol>
  
  <p>
! The <tt>unique_ptr</tt> specification makes great efforts to require that essentially <em>all</em>
  operations cannot throw and therefore adds proper wording to the affected
  operations of the deleter as well. If user-provided <tt>pointer</tt>-emulating types
! ("smart pointers") will be allowed, either <em>all</em> throw-nothing clauses have to
  be replaced by weaker "An exception is thrown only if <tt>pointer</tt>'s {op} throws
  an exception"-clauses or it has to be said explicitly that all used
! operations of <tt>pointer</tt> are required <em>not</em> to throw. I understand the main 
! focus of <tt>unique_ptr</tt> to be as near as possible to the advantages of native pointers which cannot
  fail and thus strongly favor the second choice. Also, the alternative position
  would make it much harder to write safe and simple template code for
  <tt>unique_ptr</tt>. Additionally, I assume that a general statement need to be given
  that all of the expressions of <tt>pointer</tt> used to define semantics are required to
! be well-formed and well-defined (also as back-end for <a href="lwg-defects.html#762">762</a>).
  </p>
  
  <p><i>[
*************** Howard will go through and enumerate the
*** 45566,45574 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  2009-10-15 Alisdair pulls from Ready:
--- 47451,47459 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  2009-10-15 Alisdair pulls from Ready:
*************** fully baked yet.
*** 45585,45595 ****
  For reference the proposed resolution is to add the following words:
  </p>
  
! <blockquote>
  <tt>unique_ptr&lt;T, D&gt;::pointer</tt>'s operations shall be
  well-formed, shall have well defined behavior, and shall not throw
  exceptions.
! </blockquote>
  
  <p>
  This leaves me with a big question : which operations?
--- 47470,47480 ----
  For reference the proposed resolution is to add the following words:
  </p>
  
! <blockquote><p>
  <tt>unique_ptr&lt;T, D&gt;::pointer</tt>'s operations shall be
  well-formed, shall have well defined behavior, and shall not throw
  exceptions.
! </p></blockquote>
  
  <p>
  This leaves me with a big question : which operations?
*************** certain concept, and so nail down the in
*** 45608,45628 ****
  ]</i></p>
  
  
! <blockquote>
  I volunteer to prepare a more fine-grained solution, but I would like
  to ask for feedback that helps me doing so. If this question is asked
  early in the meeting I might be able to fix it within the week, but I
  cannot promise that now.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Leave in open. Daniel to provide wording as already suggested.
! </blockquote>
  
  <p><i>[
  2009-12-22 Daniel provided wording and rationale.
--- 47493,47513 ----
  ]</i></p>
  
  
! <blockquote><p>
  I volunteer to prepare a more fine-grained solution, but I would like
  to ask for feedback that helps me doing so. If this question is asked
  early in the meeting I might be able to fix it within the week, but I
  cannot promise that now.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Leave in open. Daniel to provide wording as already suggested.
! </p></blockquote>
  
  <p><i>[
  2009-12-22 Daniel provided wording and rationale.
*************** This might be a convincing argument to i
*** 45647,45658 ****
  requirement. The reason I did not do that is basically because we might find out
  that they are either over-constraining or under-constraining at this late point
  of specification. Note also that as a result of the idea of a general
! requirement set I added the requirement
  </p>
  
! <blockquote>
  A default-initialized object may have a singular value
! </blockquote>
  
  <p>
  even though this does not play a relevant role for <tt>unique_ptr</tt>.
--- 47532,47543 ----
  requirement. The reason I did not do that is basically because we might find out
  that they are either over-constraining or under-constraining at this late point
  of specification. Note also that as a result of the idea of a general
! requirement set I added the requirement:
  </p>
  
! <blockquote><p>
  A default-initialized object may have a singular value
! </p></blockquote>
  
  <p>
  even though this does not play a relevant role for <tt>unique_ptr</tt>.
*************** Solved by
*** 45679,45691 ****
  
  <li>
  <p>
! Change 20.9.9.2 [unique.ptr.single]/1 as indicated: <i>[The intent is to
  replace the coupling between <tt>T*</tt> and the deleter's <tt>operator()</tt>
  by a coupling between <tt>unique_ptr&lt;T, D&gt;::pointer</tt> and this
  <tt>operator()</tt>]</i>
  </p>
  
! <blockquote>
  1 - The default type for the template parameter <tt>D</tt> is
  <tt>default_delete</tt>. A client-supplied template argument <tt>D</tt> shall be
  a function pointer or functor for which, given a value <tt>d</tt> of type
--- 47564,47576 ----
  
  <li>
  <p>
! Change 20.8.1.2 [unique.ptr.single] p. 1 as indicated: <i>[The intent is to
  replace the coupling between <tt>T*</tt> and the deleter's <tt>operator()</tt>
  by a coupling between <tt>unique_ptr&lt;T, D&gt;::pointer</tt> and this
  <tt>operator()</tt>]</i>
  </p>
  
! <blockquote><p>
  1 - The default type for the template parameter <tt>D</tt> is
  <tt>default_delete</tt>. A client-supplied template argument <tt>D</tt> shall be
  a function pointer or functor for which, given a value <tt>d</tt> of type
*************** a function pointer or functor for which,
*** 45694,45705 ****
  expression <tt>d(ptr)</tt> is valid and has the effect of deallocating the
  pointer as appropriate for that deleter. <tt>D</tt> may also be an
  lvalue-reference to a deleter.
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.9.2 [unique.ptr.single]/3 as indicated:
  </p>
  
  <blockquote>
--- 47579,47590 ----
  expression <tt>d(ptr)</tt> is valid and has the effect of deallocating the
  pointer as appropriate for that deleter. <tt>D</tt> may also be an
  lvalue-reference to a deleter.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.1.2 [unique.ptr.single] p. 3 as indicated:
  </p>
  
  <blockquote>
*************** type <tt>unique_ptr&lt;T, D&gt;::pointer
*** 45712,45718 ****
  the requirements of <tt>EqualityComparable</tt>,
  <tt>DefaultConstructible</tt>,</ins> <tt>CopyConstructible</tt> <del>(Table 34)
  and</del><ins>,</ins> <tt>CopyAssignable</tt> <del>(Table 36)</del><ins>,
! <tt>Swappable</tt>, and <tt>Destructible</tt> (20.2.1 [utility.arg.requirements]). A default-initialized object may have a
  singular value.  A value-initialized object produces the null value of the type.
  The null value shall be equivalent only to itself. An object of this type can be
  copy-initialized with a value of type <tt>nullptr_t</tt>, compared for equality
--- 47597,47603 ----
  the requirements of <tt>EqualityComparable</tt>,
  <tt>DefaultConstructible</tt>,</ins> <tt>CopyConstructible</tt> <del>(Table 34)
  and</del><ins>,</ins> <tt>CopyAssignable</tt> <del>(Table 36)</del><ins>,
! <tt>Swappable</tt>, and <tt>Destructible</tt> (17.6.3.1 [utility.arg.requirements]). A default-initialized object may have a
  singular value.  A value-initialized object produces the null value of the type.
  The null value shall be equivalent only to itself. An object of this type can be
  copy-initialized with a value of type <tt>nullptr_t</tt>, compared for equality
*************** exception.
*** 45726,45740 ****
  </ins>
  </p>
  <p><ins>
! [<i>Note:</i> Given an allocator type <tt>X</tt> (20.2.5 [allocator.requirements]), the types <tt>X::pointer</tt>,
  <tt>X::const_pointer</tt>, <tt>X::void_pointer</tt>, and
  <tt>X::const_void_pointer</tt> may be used as <tt>unique_ptr&lt;T,
! D&gt;::pointer</tt> — <i>end note</i>]
  </ins></p>
  
  <p><ins>
  In addition to being available via inclusion of the <tt>&lt;utility&gt;</tt>
! header, the <tt>swap</tt> function template in 20.3.2 [utility.swap] is
  also available within the definition of <tt>unique_ptr</tt>'s <tt>swap</tt>
  function.
  </ins></p>
--- 47611,47625 ----
  </ins>
  </p>
  <p><ins>
! [<i>Note:</i> Given an allocator type <tt>X</tt> (17.6.3.5 [allocator.requirements]), the types <tt>X::pointer</tt>,
  <tt>X::const_pointer</tt>, <tt>X::void_pointer</tt>, and
  <tt>X::const_void_pointer</tt> may be used as <tt>unique_ptr&lt;T,
! D&gt;::pointer</tt> &mdash; <i>end note</i>]
  </ins></p>
  
  <p><ins>
  In addition to being available via inclusion of the <tt>&lt;utility&gt;</tt>
! header, the <tt>swap</tt> function template in 20.2.2 [utility.swap] is
  also available within the definition of <tt>unique_ptr</tt>'s <tt>swap</tt>
  function.
  </ins></p>
*************** function.
*** 45743,45755 ****
  
  <li>
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor]/2+3 as indicated: <i>[The first
  change ensures that we explicitly say, how the stored pointer is initialized.
  This is important for a <tt>constexpr</tt> function, because this may make a
  difference for user-defined pointer-like types]</i>
  </p>
  
! <blockquote><pre>constexpr unique_ptr();
  </pre>
  <blockquote>
  <p>...</p>
--- 47628,47641 ----
  
  <li>
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor] p. 2+3 as indicated: <i>[The first
  change ensures that we explicitly say, how the stored pointer is initialized.
  This is important for a <tt>constexpr</tt> function, because this may make a
  difference for user-defined pointer-like types]</i>
  </p>
  
! <blockquote><pre>
! constexpr unique_ptr();
  </pre>
  <blockquote>
  <p>...</p>
*************** value-initializing the stored pointer</i
*** 45767,45778 ****
  
  <li>
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor]/6+7 as indicated: <i>[This is a
  step-by-fix to ensure consistency to the changes of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2976.html">N2976</a>]</i>
  </p>
  
! <blockquote><pre>unique_ptr(pointer p);
  </pre>
  <blockquote>
  <p>...</p>
--- 47653,47665 ----
  
  <li>
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor] p. 6+7 as indicated: <i>[This is a
  step-by-fix to ensure consistency to the changes of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2976.html">N2976</a>]</i>
  </p>
  
! <blockquote><pre>
! unique_ptr(pointer p);
  </pre>
  <blockquote>
  <p>...</p>
*************** deleter <tt>D</tt>.
*** 45792,45803 ****
  
  <li>
  <p>
! Insert a new effects clause in 20.9.9.2.1 [unique.ptr.single.ctor] just
  before p. 14: <i>[The intent is to fix the current lack of specification in
  which way the stored pointer is initialized]</i>
  </p>
  
! <blockquote><pre>unique_ptr(pointer p, <i><del>implementation-defined</del> <ins>see below</ins></i> d1);
  unique_ptr(pointer p, <i><del>implementation-defined</del> <ins>see below</ins></i> d2);
  </pre>
  <blockquote>
--- 47679,47691 ----
  
  <li>
  <p>
! Insert a new effects clause in 20.8.1.2.1 [unique.ptr.single.ctor] just
  before p. 14: <i>[The intent is to fix the current lack of specification in
  which way the stored pointer is initialized]</i>
  </p>
  
! <blockquote><pre>
! unique_ptr(pointer p, <i><del>implementation-defined</del> <ins>see below</ins></i> d1);
  unique_ptr(pointer p, <i><del>implementation-defined</del> <ins>see below</ins></i> d2);
  </pre>
  <blockquote>
*************** then <tt>get_deleter()</tt> returns a re
*** 45819,45830 ****
  
  <li>
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor]/18+22 as indicated: <i>[The intent
  is to clarify that the moved-from source must contain a null pointer, there is
  no other choice left]</i>
  </p>
  
! <blockquote><pre>unique_ptr(unique_ptr&amp;&amp; u);
  </pre>
  <blockquote>
  <p>
--- 47707,47719 ----
  
  <li>
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor] p. 18+22 as indicated: <i>[The intent
  is to clarify that the moved-from source must contain a null pointer, there is
  no other choice left]</i>
  </p>
  
! <blockquote><pre>
! unique_ptr(unique_ptr&amp;&amp; u);
  </pre>
  <blockquote>
  <p>
*************** lvalue deleter.
*** 45842,45848 ****
  
  </blockquote>
  
! <pre>template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
--- 47731,47738 ----
  
  </blockquote>
  
! <pre>
! template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
*************** the internally stored deleter which was
*** 45865,45896 ****
  
  <li>
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor]/20 as indicated: <i>[With the
  possibility of user-defined pointer-like types the implication does only exist,
  if those are built-in pointers. Note that this change should also be applied
! with the acceptance of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>]</i>
  </p>
  
! <blockquote><pre>template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
! <blockquote>
  20 - <i>Requires:</i> If <tt>D</tt> is not a reference type, construction of the
  deleter <tt>D</tt> from an rvalue of type <tt>E</tt> shall be well formed and
  shall not throw an exception. If <tt>D</tt> is a reference type, then <tt>E</tt>
  shall be the same type as <tt>D</tt> (diagnostic required). <tt>unique_ptr&lt;U,
  E&gt;::pointer</tt> shall be implicitly convertible to <tt>pointer</tt>.
  <del>[<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt> are
! complete types. — <i>end note</i>]</del>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.9.2.2 [unique.ptr.single.dtor]/2 as indicated:
  </p>
  
! <blockquote><pre>~unique_ptr();
  </pre>
  <blockquote>
  <p>...</p>
--- 47755,47788 ----
  
  <li>
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor] p. 20 as indicated: <i>[With the
  possibility of user-defined pointer-like types the implication does only exist,
  if those are built-in pointers. Note that this change should also be applied
! with the acceptance of <a href="lwg-defects.html#950">950</a>]</i>
  </p>
  
! <blockquote><pre>
! template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
! <blockquote><p>
  20 - <i>Requires:</i> If <tt>D</tt> is not a reference type, construction of the
  deleter <tt>D</tt> from an rvalue of type <tt>E</tt> shall be well formed and
  shall not throw an exception. If <tt>D</tt> is a reference type, then <tt>E</tt>
  shall be the same type as <tt>D</tt> (diagnostic required). <tt>unique_ptr&lt;U,
  E&gt;::pointer</tt> shall be implicitly convertible to <tt>pointer</tt>.
  <del>[<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt> are
! complete types. &mdash; <i>end note</i>]</del>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.1.2.2 [unique.ptr.single.dtor] p. 2 as indicated:
  </p>
  
! <blockquote><pre>
! ~unique_ptr();
  </pre>
  <blockquote>
  <p>...</p>
*************** are no effects. Otherwise <tt>get_delete
*** 45904,45915 ****
  
  <li>
  <p>
! Change 20.9.9.2.3 [unique.ptr.single.asgn]/3+8 as indicated: <i>[The intent is to
  clarify that the moved-from source must contain a null pointer, there
  is no other choice left]</i>
  </p>
  
! <blockquote><pre>unique_ptr&amp; operator=(unique_ptr&amp;&amp; u);
  </pre>
  <blockquote>
  <p>[..]</p>
--- 47796,47808 ----
  
  <li>
  <p>
! Change 20.8.1.2.3 [unique.ptr.single.asgn] p. 3+8 as indicated: <i>[The intent is to
  clarify that the moved-from source must contain a null pointer, there
  is no other choice left]</i>
  </p>
  
! <blockquote><pre>
! unique_ptr&amp; operator=(unique_ptr&amp;&amp; u);
  </pre>
  <blockquote>
  <p>[..]</p>
*************** is no other choice left]</i>
*** 45917,45927 ****
  3 - <i>Postconditions:</i> This <tt>unique_ptr</tt> now owns the pointer which <tt>u</tt>
  owned, and <tt>u</tt> no longer owns it<ins>, <tt>u.get() == nullptr</tt></ins>.
  [<i>Note:</i> If <tt>D</tt> is a reference type, then the referenced lvalue deleters
! are move assigned. — <i>end note</i>]
  </p>
  </blockquote>
  
! <pre>template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
--- 47810,47821 ----
  3 - <i>Postconditions:</i> This <tt>unique_ptr</tt> now owns the pointer which <tt>u</tt>
  owned, and <tt>u</tt> no longer owns it<ins>, <tt>u.get() == nullptr</tt></ins>.
  [<i>Note:</i> If <tt>D</tt> is a reference type, then the referenced lvalue deleters
! are move assigned. &mdash; <i>end note</i>]
  </p>
  </blockquote>
  
! <pre>
! template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
*************** nullptr</tt></ins>.
*** 45938,45950 ****
  
  <li>
  <p>
! Change 20.9.9.2.3 [unique.ptr.single.asgn]/6 as indicated: <i>[With the
  possibility of user-defined pointer-like types the implication does only exist,
  if those are built-in pointers. Note that this change should also be applied
! with the acceptance of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>]</i>
  </p>
  
! <blockquote><pre>template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  <blockquote>
  <p>[..]</p>
--- 47832,47845 ----
  
  <li>
  <p>
! Change 20.8.1.2.3 [unique.ptr.single.asgn] p. 6 as indicated: <i>[With the
  possibility of user-defined pointer-like types the implication does only exist,
  if those are built-in pointers. Note that this change should also be applied
! with the acceptance of <a href="lwg-defects.html#950">950</a>]</i>
  </p>
  
! <blockquote><pre>
! template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  <blockquote>
  <p>[..]</p>
*************** with the acceptance of <a href="http://w
*** 45953,45959 ****
  <tt>D</tt> shall not throw an exception. <tt>unique_ptr&lt;U,
  E&gt;::pointer</tt> shall be implicitly convertible to <tt>pointer</tt>.
  <del>[<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt> are
! complete types. — <i>end note</i>]</del>
  </p>
  </blockquote>
  </blockquote>
--- 47848,47854 ----
  <tt>D</tt> shall not throw an exception. <tt>unique_ptr&lt;U,
  E&gt;::pointer</tt> shall be implicitly convertible to <tt>pointer</tt>.
  <del>[<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt> are
! complete types. &mdash; <i>end note</i>]</del>
  </p>
  </blockquote>
  </blockquote>
*************** complete types. — <i>end note</i>]</del>
*** 45961,45971 ****
  
  <li>
  <p>
! Change 20.9.9.2.3 [unique.ptr.single.asgn] before p. 11 and p. 12 as
  indicated: <i>[The first change is a simple typo fix]</i>
  </p>
  
! <blockquote><pre>unique_ptr&amp; operator=(nullptr_t<del>}</del><ins>)</ins>;
  </pre>
  
  <blockquote>
--- 47856,47867 ----
  
  <li>
  <p>
! Change 20.8.1.2.3 [unique.ptr.single.asgn] before p. 11 and p. 12 as
  indicated: <i>[The first change is a simple typo fix]</i>
  </p>
  
! <blockquote><pre>
! unique_ptr&amp; operator=(nullptr_t<del>}</del><ins>)</ins>;
  </pre>
  
  <blockquote>
*************** indicated: <i>[The first change is a sim
*** 45982,45991 ****
  
  <li>
  <p>
! Change 20.9.9.2.4 [unique.ptr.single.observers]/1+4+12 as indicated:
  </p>
  
! <blockquote><pre>typename add_lvalue_reference&lt;T&gt;::type operator*() const;
  </pre>
  <blockquote>
  <p>
--- 47878,47888 ----
  
  <li>
  <p>
! Change 20.8.1.2.4 [unique.ptr.single.observers] p. 1+4+12 as indicated:
  </p>
  
! <blockquote><pre>
! typename add_lvalue_reference&lt;T&gt;::type operator*() const;
  </pre>
  <blockquote>
  <p>
*************** an exception.</ins>
*** 46000,46006 ****
  
  </blockquote>
  
! <pre>pointer operator-&gt;() const;
  </pre>
  
  <blockquote>
--- 47897,47904 ----
  
  </blockquote>
  
! <pre>
! pointer operator-&gt;() const;
  </pre>
  
  <blockquote>
*************** an exception.</ins>
*** 46014,46045 ****
  
  </blockquote>
  
! <pre>explicit operator bool() const;
  </pre>
  
! <blockquote>
  12 - <i>Returns:</i> <tt>get() != <del>0</del><ins>nullptr</ins></tt>.
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.9.2.5 [unique.ptr.single.modifiers]/1 as indicated:
  </p>
  
! <blockquote><pre>pointer release();
  </pre>
  
! <blockquote>
  1 - <i>Postcondition:</i> <tt>get() == <del>0</del> <ins>nullptr</ins></tt>.
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.9.2.5 [unique.ptr.single.modifiers]/9 as indicated: <i>[The
  intent is to ensure that potentially user-defined swaps are used. A side-step
  fix and harmonization with the specification of the the deleter is realized.
  Please note the additional requirement in bullet 2 of this proposed resolution
--- 47912,47945 ----
  
  </blockquote>
  
! <pre>
! explicit operator bool() const;
  </pre>
  
! <blockquote><p>
  12 - <i>Returns:</i> <tt>get() != <del>0</del><ins>nullptr</ins></tt>.
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.1.2.5 [unique.ptr.single.modifiers] p. 1 as indicated:
  </p>
  
! <blockquote><pre>
! pointer release();
  </pre>
  
! <blockquote><p>
  1 - <i>Postcondition:</i> <tt>get() == <del>0</del> <ins>nullptr</ins></tt>.
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.1.2.5 [unique.ptr.single.modifiers] p. 9 as indicated: <i>[The
  intent is to ensure that potentially user-defined swaps are used. A side-step
  fix and harmonization with the specification of the the deleter is realized.
  Please note the additional requirement in bullet 2 of this proposed resolution
*************** regarding the availability of the generi
*** 46047,46053 ****
  member <tt>swap</tt> function.]</i>
  </p>
  
! <blockquote><pre>void swap(unique_ptr&amp; u);
  </pre>
  
  <blockquote>
--- 47947,47954 ----
  member <tt>swap</tt> function.]</i>
  </p>
  
! <blockquote><pre>
! void swap(unique_ptr&amp; u);
  </pre>
  
  <blockquote>
*************** shall not throw an exception under <tt>s
*** 46069,46121 ****
  
  <li>
  <p>
! Change 20.9.9.3.2 [unique.ptr.runtime.observers]/1 as indicated:
  </p>
  
! <blockquote><pre>T&amp; operator[](size_t i) const;
  </pre>
! <blockquote>
  <i>Requires:</i> <tt>i &lt;</tt> the size of the array to which the stored
  pointer points. <ins>The variable definition <tt>T&amp; t = get()[i]</tt> shall
  be well formed, shall have well-defined behavior, and shall not exit via an
  exception.</ins>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.9.3.3 [unique.ptr.runtime.modifiers]/1 as indicated:
  </p>
  
! <blockquote><pre>void reset(pointer p = pointer());
  void reset(nullptr_t p);
  </pre>
  
! <blockquote>
  1 - <i>Effects:</i> If <tt>get() == <del>0</del> <ins>nullptr</ins></tt> there
  are no effects. Otherwise <tt>get_deleter()(get())</tt>.
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.9.4 [unique.ptr.special] as indicated: <i>[We don't add the
  relational operators to the basic requirement set, therefore we need special
  handling here]</i>
  </p>
  
  <blockquote>
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator==(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
  <blockquote>
  <p>
! <ins><i>Requires:</i> The variable definition <tt>bool b = x.get() ==
! y.get();</tt> shall be well formed, shall have well-defined behavior, and shall
! not exit via an exception.</ins>
  </p>
  
  <p>
--- 47970,48024 ----
  
  <li>
  <p>
! Change 20.8.1.3.3 [unique.ptr.runtime.observers] p. 1 as indicated:
  </p>
  
! <blockquote><pre>
! T&amp; operator[](size_t i) const;
  </pre>
! <blockquote><p>
  <i>Requires:</i> <tt>i &lt;</tt> the size of the array to which the stored
  pointer points. <ins>The variable definition <tt>T&amp; t = get()[i]</tt> shall
  be well formed, shall have well-defined behavior, and shall not exit via an
  exception.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.1.3.4 [unique.ptr.runtime.modifiers] p. 1 as indicated:
  </p>
  
! <blockquote><pre>
! void reset(pointer p = pointer());
  void reset(nullptr_t p);
  </pre>
  
! <blockquote><p>
  1 - <i>Effects:</i> If <tt>get() == <del>0</del> <ins>nullptr</ins></tt> there
  are no effects. Otherwise <tt>get_deleter()(get())</tt>.
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.1.5 [unique.ptr.special] as indicated: <i>[We don't add the
  relational operators to the basic requirement set, therefore we need special
  handling here]</i>
  </p>
  
  <blockquote>
! <pre>
! template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator==(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
  <blockquote>
  <p>
! <ins><i>Requires:</i> The variable definition <tt>bool b = x.get() == y.get();</tt> shall be 
! well formed, shall have well-defined behavior, and shall not exit via an exception.</ins>
  </p>
  
  <p>
*************** not exit via an exception.</ins>
*** 46127,46133 ****
  </ins></p>
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator!=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
--- 48030,48037 ----
  </ins></p>
  </blockquote>
  
! <pre>
! template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator!=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
*************** an exception.</ins>
*** 46147,46153 ****
  </ins></p>
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
--- 48051,48058 ----
  </ins></p>
  </blockquote>
  
! <pre>
! template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
*************** an exception.</ins>
*** 46167,46173 ****
  </ins></p>
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
--- 48072,48079 ----
  </ins></p>
  </blockquote>
  
! <pre>
! template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
*************** an exception.</ins>
*** 46187,46193 ****
  </ins></p>
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
--- 48093,48100 ----
  </ins></p>
  </blockquote>
  
! <pre>
! template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
*************** an exception.</ins>
*** 46207,46213 ****
  </ins></p>
  </blockquote>
  
! <pre>template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
--- 48114,48121 ----
  </ins></p>
  </blockquote>
  
! <pre>
! template &lt;class T1, class D1, class T2, class D2&gt;
    bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
  </pre>
  
*************** an exception.</ins>
*** 46239,46254 ****
  
  
  <hr>
! <h3><a name="835"></a>835. tying two streams together (correction to DR 581)</h3>
! <p><b>Section:</b> 27.5.4.2 [basic.ios.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
         <p>
  
  The fix for
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#581">581</a>,
  now integrated into the working paper, overlooks a couple of minor
  problems.
  
--- 48147,48162 ----
  
  
  <hr>
! <h3><a name="835"></a>835. Tying two streams together (correction to DR 581)</h3>
! <p><b>Section:</b> 27.5.5.3 [basic.ios.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
         <p>
  
  The fix for
! issue <a href="lwg-defects.html#581">581</a>,
  now integrated into the working paper, overlooks a couple of minor
  problems.
  
*************** recursion for <code>std::cerr &lt;&lt; s
*** 46275,46281 ****
  
         </p>
         <blockquote>
!            <pre>#include &lt;iostream&gt;
  
  int main ()
  {
--- 48183,48190 ----
  
         </p>
         <blockquote>
!            <pre>
! #include &lt;iostream&gt;
  
  int main ()
  {
*************** int main ()
*** 46291,46300 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Review.
! </blockquote>
  
  <p><i>[
  2009-05-26 Daniel adds:
--- 48200,48209 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Review.
! </p></blockquote>
  
  <p><i>[
  2009-05-26 Daniel adds:
*************** Move to Review.
*** 46304,46310 ****
  <blockquote>
  <p>
  I think that the most recently suggested change in
! 27.7.2.4 [ostream::sentry] need some further word-smithing. As
  written, it would make the behavior undefined, if under
  conditions when <tt>pubsync()</tt> should be called, but when
  in this scenario <tt>os.rdbuf()</tt> returns 0.
--- 48213,48219 ----
  <blockquote>
  <p>
  I think that the most recently suggested change in
! 27.7.3.4 [ostream::sentry] need some further word-smithing. As
  written, it would make the behavior undefined, if under
  conditions when <tt>pubsync()</tt> should be called, but when
  in this scenario <tt>os.rdbuf()</tt> returns 0.
*************** This case is explicitly handled in <tt>f
*** 46314,46324 ****
  taken care of. My suggested fix is:
  </p>
  
! <blockquote>
  If <tt>((os.flags() &amp; ios_base::unitbuf) &amp;&amp; !uncaught_exception()</tt>
  <ins><tt>&amp;&amp; os.rdbuf() != 0</tt></ins>) is true, calls <del><tt>os.flush()</tt></del>
  <ins><tt>os.rdbuf()-&gt;pubsync()</tt></ins>.
! </blockquote>
  
  <p>
  Two secondary questions are:
--- 48223,48233 ----
  taken care of. My suggested fix is:
  </p>
  
! <blockquote><p>
  If <tt>((os.flags() &amp; ios_base::unitbuf) &amp;&amp; !uncaught_exception()</tt>
  <ins><tt>&amp;&amp; os.rdbuf() != 0</tt></ins>) is true, calls <del><tt>os.flush()</tt></del>
  <ins><tt>os.rdbuf()-&gt;pubsync()</tt></ins>.
! </p></blockquote>
  
  <p>
  Two secondary questions are:
*************** Move back to Open.
*** 46362,46381 ****
  ]</i></p>
  
  
! <blockquote>
  This proposed wording is written to match the outcome
! of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a>.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Open. Martin to propose updated wording that will also resolve
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#397">397</a> consistently.
! </blockquote>
  
  <p><i>[
  2010-02-15 Martin provided wording.
--- 48271,48290 ----
  ]</i></p>
  
  
! <blockquote><p>
  This proposed wording is written to match the outcome
! of <a href="lwg-closed.html#397">397</a>.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Open. Martin to propose updated wording that will also resolve
! issue <a href="lwg-closed.html#397">397</a> consistently.
! </p></blockquote>
  
  <p><i>[
  2010-02-15 Martin provided wording.
*************** issue <a href="http://www.open-std.org/j
*** 46387,46395 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready for Pittsburgh.
! </blockquote>
  
  
  
--- 48296,48304 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready for Pittsburgh.
! </p></blockquote>
  
  
  
*************** Moved to Ready for Pittsburgh.
*** 46398,46435 ****
  <ol>
  <li>
  <p>
! Just before 27.5.4.2 [basic.ios.members]/2 insert a new paragraph:
  </p>
  
! <blockquote>
  <ins><i>Requires:</i> If <tt>(tiestr != 0)</tt> is <tt>true</tt>,
  <tt>tiestr</tt> must not be reachable by traversing the linked list of tied
  stream objects starting from <tt>tiestr-&gt;tie()</tt>.</ins>
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 27.7.2.4 [ostream::sentry]/4 as indicated:
  </p>
  
! <blockquote>
  If <tt>((os.flags() &amp; ios_base::unitbuf) &amp;&amp; !uncaught_exception()
  <ins>&amp;&amp; os.good()</ins>)</tt> is <tt>true</tt>, calls
  <del><tt>os.flush()</tt></del> <ins><tt>os.rdbuf()-&gt;pubsync()</tt>. If that
  function returns -1 sets <tt>badbit</tt> in <tt>os.rdstate()</tt> without
  propagating an exception</ins>.
! </blockquote>
  </li>
  
  <li>
  <p>
! Add after 27.7.2.4 [ostream::sentry] p17, the following paragraph:
  </p>
  
! <blockquote>
  <ins><i>Throws:</i> Nothing.</ins>
! </blockquote>
  
  </li>
  
--- 48307,48344 ----
  <ol>
  <li>
  <p>
! Just before 27.5.5.3 [basic.ios.members] p. 2 insert a new paragraph:
  </p>
  
! <blockquote><p>
  <ins><i>Requires:</i> If <tt>(tiestr != 0)</tt> is <tt>true</tt>,
  <tt>tiestr</tt> must not be reachable by traversing the linked list of tied
  stream objects starting from <tt>tiestr-&gt;tie()</tt>.</ins>
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 27.7.3.4 [ostream::sentry] p. 4 as indicated:
  </p>
  
! <blockquote><p>
  If <tt>((os.flags() &amp; ios_base::unitbuf) &amp;&amp; !uncaught_exception()
  <ins>&amp;&amp; os.good()</ins>)</tt> is <tt>true</tt>, calls
  <del><tt>os.flush()</tt></del> <ins><tt>os.rdbuf()-&gt;pubsync()</tt>. If that
  function returns -1 sets <tt>badbit</tt> in <tt>os.rdstate()</tt> without
  propagating an exception</ins>.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Add after 27.7.3.4 [ostream::sentry] p17, the following paragraph:
  </p>
  
! <blockquote><p>
  <ins><i>Throws:</i> Nothing.</ins>
! </p></blockquote>
  
  </li>
  
*************** Add after 27.7.2.4 [ostream::sentry] p17
*** 46442,46455 ****
  
  <hr>
  <h3><a name="836"></a>836. 
!        effects of <code>money_base::space</code> and
         <code>money_base::none</code> on <code>money_get</code>
     </h3>
! <p><b>Section:</b> 22.4.6.1.2 [locale.money.get.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#locale.money.get.virtuals">issues</a> in [locale.money.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#670">670</a></p>
  <p><b>Discussion:</b></p>
  
         <p>
--- 48351,48364 ----
  
  <hr>
  <h3><a name="836"></a>836. 
!        Effects of <code>money_base::space</code> and
         <code>money_base::none</code> on <code>money_get</code>
     </h3>
! <p><b>Section:</b> 22.4.6.1.2 [locale.money.get.virtuals] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#locale.money.get.virtuals">issues</a> in [locale.money.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#670">670</a></p>
  <p><b>Discussion:</b></p>
  
         <p>
*************** Add after 27.7.2.4 [ostream::sentry] p17
*** 46457,46469 ****
  In paragraph 2, 22.4.6.1.2 [locale.money.get.virtuals] specifies the following:
  
         </p>
!        <blockquote>
  
  Where <code>space</code> or <code>none</code> appears in the format
  pattern, except at the end, optional white space (as recognized
  by <code>ct.is</code>) is consumed after any required space.
  
!        </blockquote>
         <p>
  
  This requirement can be (and has been) interpreted two mutually
--- 48366,48378 ----
  In paragraph 2, 22.4.6.1.2 [locale.money.get.virtuals] specifies the following:
  
         </p>
!        <blockquote><p>
  
  Where <code>space</code> or <code>none</code> appears in the format
  pattern, except at the end, optional white space (as recognized
  by <code>ct.is</code>) is consumed after any required space.
  
!        </p></blockquote>
         <p>
  
  This requirement can be (and has been) interpreted two mutually
*************** allowed but not required.
*** 46492,46511 ****
  The other is that:
  
         </p>
!        <blockquote>
  
  where either <code>money_base::space</code> or <code>money_base::none</code> appears in the format, white space is optional.
  
!        </blockquote>
  
  <p><i>[
  San Francisco:
  ]</i></p>
  
  
! <blockquote>
  Martin will revise the proposed resolution.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 48401,48420 ----
  The other is that:
  
         </p>
!        <blockquote><p>
  
  where either <code>money_base::space</code> or <code>money_base::none</code> appears in the format, white space is optional.
  
!        </p></blockquote>
  
  <p><i>[
  San Francisco:
  ]</i></p>
  
  
! <blockquote><p>
  Martin will revise the proposed resolution.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** There is a noun missing from the propose
*** 46518,46526 ****
  that the last sentence would be helpful, even if the word were not
  missing:
  </p>
! <blockquote>
! In either case, any required MISSINGWORD followed by all optional whitespace (as recognized by ct.is()) is consumed.
! </blockquote>
  <p>
  Strike this sentence and move to Review.
  </p>
--- 48427,48436 ----
  that the last sentence would be helpful, even if the word were not
  missing:
  </p>
! <blockquote><p>
! In either case, any required MISSINGWORD followed by all optional whitespace 
! (as recognized by <tt>ct.is()</tt>) is consumed.
! </p></blockquote>
  <p>
  Strike this sentence and move to Review.
  </p>
*************** Howard: done.
*** 46536,46544 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
     
  
--- 48446,48454 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
     
  
*************** Move to Ready.
*** 46547,46557 ****
  
  I propose to change the text to make it clear that the first
  interpretation is intended, that is, to make following change to
! 22.4.6.1.2 [locale.money.get.virtuals], p2:
  
         </p>
  
!        <blockquote>
  
  When <code><ins>money_base::</ins>space</code>
  or <code><ins>money_base::</ins>none</code> appears <ins>as the last
--- 48457,48467 ----
  
  I propose to change the text to make it clear that the first
  interpretation is intended, that is, to make following change to
! 22.4.6.1.2 [locale.money.get.virtuals], p. 2:
  
         </p>
  
!        <blockquote><p>
  
  When <code><ins>money_base::</ins>space</code>
  or <code><ins>money_base::</ins>none</code> appears <ins>as the last
*************** initial elements of the format pattern,
*** 46565,46583 ****
  required.</ins>
  If <code>(str.flags() &amp; str.showbase)</code> is <code>false</code>, ...
  
!        </blockquote>
     
  
  
  
  <hr>
  <h3><a name="838"></a>838. 
!    can an <i>end-of-stream</i> iterator become a <i>non-end-of-stream</i> one?
   </h3>
! <p><b>Section:</b> 24.6.1 [istream.iterator] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.iterator">issues</a> in [istream.iterator].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
     <p>
  
--- 48475,48493 ----
  required.</ins>
  If <code>(str.flags() &amp; str.showbase)</code> is <code>false</code>, ...
  
!        </p></blockquote>
     
  
  
  
  <hr>
  <h3><a name="838"></a>838. 
!    Can an <i>end-of-stream</i> iterator become a <i>non-end-of-stream</i> one?
   </h3>
! <p><b>Section:</b> 24.6.1 [istream.iterator] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.iterator">issues</a> in [istream.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
     <p>
  
*************** From message c++std-lib-20003...
*** 46587,46605 ****
     <p>
  
  The description of <code>istream_iterator</code> in
! 24.6.1 [istream.iterator], p1 specifies that objects of the
  class become the <i>end-of-stream</i> (EOS) iterators under the
! following condition (see also issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#788">788</a> another problem
  with this paragraph):
  
     </p>
!    <blockquote>
  
  If the end of stream is reached (<code>operator void*()</code> on the
  stream returns <code>false</code>), the iterator becomes equal to
  the <i>end-of-stream</i> iterator value.
  
!    </blockquote>
     <p>
  
  One possible implementation approach that has been used in practice is
--- 48497,48515 ----
     <p>
  
  The description of <code>istream_iterator</code> in
! 24.6.1 [istream.iterator], p. 1 specifies that objects of the
  class become the <i>end-of-stream</i> (EOS) iterators under the
! following condition (see also issue <a href="lwg-defects.html#788">788</a> another problem
  with this paragraph):
  
     </p>
!    <blockquote><p>
  
  If the end of stream is reached (<code>operator void*()</code> on the
  stream returns <code>false</code>), the iterator becomes equal to
  the <i>end-of-stream</i> iterator value.
  
!    </p></blockquote>
     <p>
  
  One possible implementation approach that has been used in practice is
*************** assertions in the program below expected
*** 46644,46650 ****
  
     </p>
     <blockquote>
!      <pre>   sstream strm ("1 ");
     istream_iterator eos;
     istream_iterator it (strm);
     int i;
--- 48554,48561 ----
  
     </p>
     <blockquote>
!      <pre>
!    sstream strm ("1 ");
     istream_iterator eos;
     istream_iterator it (strm);
     int i;
*************** that no reference is made to exposition
*** 46686,46694 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 48597,48605 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** To this end we propose to change 24.6.1
*** 46710,46716 ****
  as follows:
  
     </p>
!    <blockquote>
  
  The result of operator-&gt; on an end<ins>-</ins>of<ins>-</ins>stream
  is not defined. For any other iterator value a <code>const T*</code>
--- 48621,48627 ----
  as follows:
  
     </p>
!    <blockquote><p>
  
  The result of operator-&gt; on an end<ins>-</ins>of<ins>-</ins>stream
  is not defined. For any other iterator value a <code>const T*</code>
*************** is returned.<ins> Invoking <code>operato
*** 46718,46724 ****
  an <i>end-of-stream</i> iterator is undefined.</ins> It is impossible
  to store things into istream iterators...
  
!    </blockquote>
     <p>
  
  Add pre/postconditions to the member function descriptions of <code>istream_iterator</code> like so:
--- 48629,48635 ----
  an <i>end-of-stream</i> iterator is undefined.</ins> It is impossible
  to store things into istream iterators...
  
!    </p></blockquote>
     <p>
  
  Add pre/postconditions to the member function descriptions of <code>istream_iterator</code> like so:
*************** Add pre/postconditions to the member fun
*** 46727,46758 ****
     <blockquote>
  
  <pre>istream_iterator();</pre>
! 
! <i>Effects</i>: Constructs the <i>end-of-stream</i> iterator.<br>
  <ins><i>Postcondition</i>: <code>in_stream == 0</code>.</ins>
! 
  <pre>istream_iterator(istream_type &amp;s);</pre>
! 
  <i>Effects</i>: Initializes <code>in_stream</code> with &amp;s. value
  may be initialized during construction or the first time it is
! referenced.<br>
  <ins><i>Postcondition</i>: <code>in_stream == &amp;s</code>.</ins>
! 
  <pre>istream_iterator(const istream_iterator &amp;x);</pre>
! 
! <i>Effects</i>: Constructs a copy of <code>x</code>.<br>
  <ins><i>Postcondition</i>: <code>in_stream == x.in_stream</code>.</ins>
! 
  <pre>istream_iterator&amp; operator++();</pre>
! 
! <ins><i>Requires</i>: <code>in_stream != 0</code>.</ins><br>
  <i>Effects</i>: <code>*in_stream &gt;&gt; value</code>.
! 
  <pre>istream_iterator&amp; operator++(int);</pre>
! 
! <ins><i>Requires</i>: <code>in_stream != 0</code>.</ins><br>
  <i>Effects</i>:
!    <blockquote><pre>istream_iterator tmp (*this);
  *in_stream &gt;&gt; value;
  return tmp;
       </pre>
--- 48638,48671 ----
     <blockquote>
  
  <pre>istream_iterator();</pre>
! <p>
! <i>Effects</i>: Constructs the <i>end-of-stream</i> iterator.<br/>
  <ins><i>Postcondition</i>: <code>in_stream == 0</code>.</ins>
! </p>
  <pre>istream_iterator(istream_type &amp;s);</pre>
! <p>
  <i>Effects</i>: Initializes <code>in_stream</code> with &amp;s. value
  may be initialized during construction or the first time it is
! referenced.<br/>
  <ins><i>Postcondition</i>: <code>in_stream == &amp;s</code>.</ins>
! </p>
  <pre>istream_iterator(const istream_iterator &amp;x);</pre>
! <p>
! <i>Effects</i>: Constructs a copy of <code>x</code>.<br/>
  <ins><i>Postcondition</i>: <code>in_stream == x.in_stream</code>.</ins>
! </p>
  <pre>istream_iterator&amp; operator++();</pre>
! <p>
! <ins><i>Requires</i>: <code>in_stream != 0</code>.</ins><br/>
  <i>Effects</i>: <code>*in_stream &gt;&gt; value</code>.
! </p>
  <pre>istream_iterator&amp; operator++(int);</pre>
! <p>
! <ins><i>Requires</i>: <code>in_stream != 0</code>.</ins><br/>
  <i>Effects</i>:
! </p>
! <blockquote><pre>
! istream_iterator tmp (*this);
  *in_stream &gt;&gt; value;
  return tmp;
       </pre>
*************** return tmp;
*** 46763,46779 ****
  
  
  <hr>
! <h3><a name="842"></a>842. ConstructibleAsElement and bit containers</h3>
! <p><b>Section:</b> 23.2 [container.requirements], 23.4.2 [vector.bool], 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 23.2 [container.requirements]/p3 says:
  </p>
  
! <blockquote>
  Objects stored in these components shall be constructed using
  <tt>construct_element</tt> (20.6.9). For each operation that inserts an
  element of type <tt>T</tt> into a container (<tt>insert</tt>,
--- 48676,48693 ----
  
  
  <hr>
! <h3><a name="842"></a>842. <tt>ConstructibleAsElement</tt> and bit containers</h3>
! <p><b>Section:</b> 23.2 [container.requirements], 23.3.7 [vector.bool], 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 23.2 [container.requirements] p. 3 says:
  </p>
  
! <blockquote><p>
  Objects stored in these components shall be constructed using
  <tt>construct_element</tt> (20.6.9). For each operation that inserts an
  element of type <tt>T</tt> into a container (<tt>insert</tt>,
*************** with a scoped allocator of type <tt>A</t
*** 46784,46794 ****
  <tt>is_scoped_allocator&lt;A&gt;::value</tt> is <tt>true</tt>), then
  <tt>construct_element</tt> may pass an inner allocator argument to
  <tt>T</tt>'s constructor. <i>-- end note</i>]
! </blockquote>
  
  <p>
! However <tt>vector&lt;bool, A&gt;</tt> (23.4.2 [vector.bool]) and <tt>bitset&lt;N&gt;</tt> 
! (20.5 [template.bitset]) store bits, not <tt>bool</tt>s, and <tt>bitset&lt;N&gt;</tt>
  does not even have an allocator.  But these containers are governed by this clause.  Clearly this
  is not implementable.
  </p>
--- 48698,48708 ----
  <tt>is_scoped_allocator&lt;A&gt;::value</tt> is <tt>true</tt>), then
  <tt>construct_element</tt> may pass an inner allocator argument to
  <tt>T</tt>'s constructor. <i>-- end note</i>]
! </p></blockquote>
  
  <p>
! However <tt>vector&lt;bool, A&gt;</tt> (23.3.7 [vector.bool]) and <tt>bitset&lt;N&gt;</tt> 
! (20.6 [template.bitset]) store bits, not <tt>bool</tt>s, and <tt>bitset&lt;N&gt;</tt>
  does not even have an allocator.  But these containers are governed by this clause.  Clearly this
  is not implementable.
  </p>
*************** is not implementable.
*** 46796,46805 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 23.2 [container.requirements]/p3:
  </p>
  
! <blockquote>
  Objects stored in these components shall be constructed using
  <tt>construct_element</tt> (20.6.9)<ins>, unless otherwise specified</ins>.
  For each operation that inserts an
--- 48710,48719 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 23.2 [container.requirements] p. 3:
  </p>
  
! <blockquote><p>
  Objects stored in these components shall be constructed using
  <tt>construct_element</tt> (20.6.9)<ins>, unless otherwise specified</ins>.
  For each operation that inserts an
*************** with a scoped allocator of type <tt>A</t
*** 46811,46830 ****
  <tt>is_scoped_allocator&lt;A&gt;::value</tt> is <tt>true</tt>), then
  <tt>construct_element</tt> may pass an inner allocator argument to
  <tt>T</tt>'s constructor. <i>-- end note</i>]
! </blockquote>
  
  <p>
! Change 23.4.2 [vector.bool]/p2:
  </p>
  
! <blockquote>
  Unless described below, all operations have the same requirements and semantics as the primary <tt>vector</tt> template, 
  except that operations dealing with the <tt>bool</tt> value type map to bit values in the container storage<ins>,
  and <tt>construct_element</tt> (23.2 [container.requirements]) is not used to construct these values</ins>.
! </blockquote>
  
  <p>
! Move 20.5 [template.bitset] to clause 20.
  </p>
  
  
--- 48725,48744 ----
  <tt>is_scoped_allocator&lt;A&gt;::value</tt> is <tt>true</tt>), then
  <tt>construct_element</tt> may pass an inner allocator argument to
  <tt>T</tt>'s constructor. <i>-- end note</i>]
! </p></blockquote>
  
  <p>
! Change 23.3.7 [vector.bool]/p2:
  </p>
  
! <blockquote><p>
  Unless described below, all operations have the same requirements and semantics as the primary <tt>vector</tt> template, 
  except that operations dealing with the <tt>bool</tt> value type map to bit values in the container storage<ins>,
  and <tt>construct_element</tt> (23.2 [container.requirements]) is not used to construct these values</ins>.
! </p></blockquote>
  
  <p>
! Move 20.6 [template.bitset] to clause 20.
  </p>
  
  
*************** Move 20.5 [template.bitset] to clause 20
*** 46834,46842 ****
  
  <hr>
  <h3><a name="843"></a>843.  Reference Closure</h3>
! <p><b>Section:</b> X [func.referenceclosure.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-06-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>std::reference_closure</tt> type has a deleted copy assignment operator
--- 48748,48756 ----
  
  <hr>
  <h3><a name="843"></a>843.  Reference Closure</h3>
! <p><b>Section:</b> X [func.referenceclosure.cons] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-06-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>std::reference_closure</tt> type has a deleted copy assignment operator
*************** The semantics of assignment are effectiv
*** 46862,46868 ****
  default destructor and default copy assignment operator via
  </p>
  
! <blockquote><pre>x.~reference_closure(); new (x) reference_closure(y);
  </pre></blockquote>
  
  <p>
--- 48776,48783 ----
  default destructor and default copy assignment operator via
  </p>
  
! <blockquote><pre>
! x.~reference_closure(); new (x) reference_closure(y);
  </pre></blockquote>
  
  <p>
*************** replace the <tt>=delete</tt> in the copy
*** 46878,46884 ****
  with <tt>=default</tt>.
  </p>
  
! <blockquote><pre>template&lt;class R , class... ArgTypes &gt; 
    class reference_closure&lt;R (ArgTypes...)&gt; { 
    public:
       ...
--- 48793,48800 ----
  with <tt>=default</tt>.
  </p>
  
! <blockquote><pre>
! template&lt;class R , class... ArgTypes &gt; 
    class reference_closure&lt;R (ArgTypes...)&gt; { 
    public:
       ...
*************** add the member function description
*** 46892,46898 ****
  </p>
  
  <blockquote>
! <pre>reference_closure&amp; operator=(const reference_closure&amp; f)
  </pre>
  <blockquote>
  <p>
--- 48808,48815 ----
  </p>
  
  <blockquote>
! <pre>
! reference_closure&amp; operator=(const reference_closure&amp; f)
  </pre>
  <blockquote>
  <p>
*************** add the member function description
*** 46912,46921 ****
  
  <hr>
  <h3><a name="844"></a>844. <tt>complex pow</tt> return type is ambiguous</h3>
! <p><b>Section:</b> 26.4.9 [cmplx.over] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#cmplx.over">issues</a> in [cmplx.over].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current working draft is in an inconsistent state.
--- 48829,48838 ----
  
  <hr>
  <h3><a name="844"></a>844. <tt>complex pow</tt> return type is ambiguous</h3>
! <p><b>Section:</b> 26.4.9 [cmplx.over] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#cmplx.over">issues</a> in [cmplx.over].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current working draft is in an inconsistent state.
*************** The current working draft is in an incon
*** 46925,46941 ****
  26.4.8 [complex.transcendentals] says that:
  </p>
  
! <blockquote>
  <tt>pow(complex&lt;float&gt;(), int())</tt> returns a <tt>complex&lt;float&gt;</tt>.
! </blockquote>
  
  <p>
  26.4.9 [cmplx.over] says that:
  </p>
  
! <blockquote>
  <tt>pow(complex&lt;float&gt;(), int())</tt> returns a <tt>complex&lt;double&gt;</tt>.
! </blockquote>
  
  <p><i>[
  Sophia Antipolis:
--- 48842,48858 ----
  26.4.8 [complex.transcendentals] says that:
  </p>
  
! <blockquote><p>
  <tt>pow(complex&lt;float&gt;(), int())</tt> returns a <tt>complex&lt;float&gt;</tt>.
! </p></blockquote>
  
  <p>
  26.4.9 [cmplx.over] says that:
  </p>
  
! <blockquote><p>
  <tt>pow(complex&lt;float&gt;(), int())</tt> returns a <tt>complex&lt;double&gt;</tt>.
! </p></blockquote>
  
  <p><i>[
  Sophia Antipolis:
*************** Sophia Antipolis:
*** 46946,46959 ****
  <p>
  Since <tt>int</tt> promotes to <tt>double</tt>, and C99 doesn't have an <tt>int</tt>-based
  overload for <tt>pow</tt>, the C99 result is <tt>complex&lt;double&gt;</tt>, see also C99
! 7.22, see also library issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#550">550</a>.
  </p>
  <p>
  Special note: ask P.J. Plauger.
  </p>
! <blockquote>
  Looks fine.
! </blockquote>
  </blockquote>
  
  
--- 48863,48876 ----
  <p>
  Since <tt>int</tt> promotes to <tt>double</tt>, and C99 doesn't have an <tt>int</tt>-based
  overload for <tt>pow</tt>, the C99 result is <tt>complex&lt;double&gt;</tt>, see also C99
! 7.22, see also library issue <a href="lwg-defects.html#550">550</a>.
  </p>
  <p>
  Special note: ask P.J. Plauger.
  </p>
! <blockquote><p>
  Looks fine.
! </p></blockquote>
  </blockquote>
  
  
*************** Looks fine.
*** 46962,46968 ****
  Strike this <tt>pow</tt> overload in 26.4.1 [complex.syn] and in 26.4.8 [complex.transcendentals]:
  </p>
  
! <blockquote><pre><del>template&lt;class T&gt; complex&lt;T&gt; pow(const complex&lt;T&gt;&amp; x, int y);</del>
  </pre></blockquote>
  
  
--- 48879,48886 ----
  Strike this <tt>pow</tt> overload in 26.4.1 [complex.syn] and in 26.4.8 [complex.transcendentals]:
  </p>
  
! <blockquote><pre>
! <del>template&lt;class T&gt; complex&lt;T&gt; pow(const complex&lt;T&gt;&amp; x, int y);</del>
  </pre></blockquote>
  
  
*************** Strike this <tt>pow</tt> overload in 26.
*** 46971,46984 ****
  
  <hr>
  <h3><a name="845"></a>845. atomics cannot support aggregate initialization</h3>
! <p><b>Section:</b> X [atomics.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types">issues</a> in [atomics.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The atomic classes (and class templates) are required to support aggregate
! initialization (29.5.1 [atomics.types.integral]p2 / 29.5.2 [atomics.types.address]p1)
  yet also have user declared constructors, so cannot be aggregates.
  </p>
  <p>
--- 48889,48903 ----
  
  <hr>
  <h3><a name="845"></a>845. atomics cannot support aggregate initialization</h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.generic">active issues</a> in [atomics.types.generic].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The atomic classes (and class templates) are required to support aggregate
! initialization (X [atomics.types.integral] p. 2 &#47; X [atomics.types.address] p. 1)
  yet also have user declared constructors, so cannot be aggregates.
  </p>
  <p>
*************** Jens adds:
*** 46997,47010 ****
  <p>
  Note that
  </p>
! <blockquote><pre>atomic_itype a1 = { 5 };
  </pre></blockquote>
  <p>
  would be aggregate-initialization syntax (now coming under the disguise
  of brace initialization), but would be ill-formed, because the corresponding
  constructor for atomic_itype is explicit.  This works, though:
  </p>
! <blockquote><pre>atomic_itype a2 { 6 };
  </pre></blockquote>
  
  </blockquote>
--- 48916,48931 ----
  <p>
  Note that
  </p>
! <blockquote><pre>
! atomic_itype a1 = { 5 };
  </pre></blockquote>
  <p>
  would be aggregate-initialization syntax (now coming under the disguise
  of brace initialization), but would be ill-formed, because the corresponding
  constructor for atomic_itype is explicit.  This works, though:
  </p>
! <blockquote><pre>
! atomic_itype a2 { 6 };
  </pre></blockquote>
  
  </blockquote>
*************** Lawrence will provide wording.
*** 47024,47030 ****
  </p>
  <p>
  This issue is addressed in
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2783.html">N2783</a>.
  </p>
  </blockquote>
  
--- 48945,48951 ----
  </p>
  <p>
  This issue is addressed in
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2783.htm">N2783</a>.
  </p>
  </blockquote>
  
*************** This issue is addressed in
*** 47032,47038 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! within the synopsis in 29.5.1 [atomics.types.integral] edit as follows.
  </p>
  
  <blockquote><pre><code>
--- 48953,48959 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! within the synopsis in X [atomics.types.integral] edit as follows.
  </p>
  
  <blockquote><pre><code>
*************** typedef struct atomic_<var>itype</var> {
*** 47048,47057 ****
  </code></pre></blockquote>
  
  <p>
! edit 29.5.1 [atomics.types.integral] paragraph 2 as follows.
  </p>
  
! <blockquote>
  The atomic integral types shall have standard layout.
  They shall each have a trivial default constructor,
  a constexpr <del>explicit</del> value constructor,
--- 48969,48978 ----
  </code></pre></blockquote>
  
  <p>
! edit X [atomics.types.integral] paragraph 2 as follows.
  </p>
  
! <blockquote><p>
  The atomic integral types shall have standard layout.
  They shall each have a trivial default constructor,
  a constexpr <del>explicit</del> value constructor,
*************** a deleted copy constructor,
*** 47059,47068 ****
  a deleted copy assignment operator,
  and a trivial destructor.
  They shall each support aggregate initialization syntax.
! </blockquote>
  
  <p>
! within the synopsis of 29.5.2 [atomics.types.address] edit as follows.
  </p>
  
  <blockquote><pre><code>
--- 48980,48989 ----
  a deleted copy assignment operator,
  and a trivial destructor.
  They shall each support aggregate initialization syntax.
! </p></blockquote>
  
  <p>
! within the synopsis of X [atomics.types.address] edit as follows.
  </p>
  
  <blockquote><pre><code>
*************** typedef struct atomic_address {
*** 47074,47083 ****
  </code></pre></blockquote>
  
  <p>
! edit 29.5.2 [atomics.types.address] paragraph 1 as follows.
  </p>
  
! <blockquote>
  The type <code>atomic_address</code> shall have standard layout.
  It shall have a trivial default constructor,
  a constexpr <del>explicit</del> value constructor,
--- 48995,49004 ----
  </code></pre></blockquote>
  
  <p>
! edit X [atomics.types.address] paragraph 1 as follows.
  </p>
  
! <blockquote><p>
  The type <code>atomic_address</code> shall have standard layout.
  It shall have a trivial default constructor,
  a constexpr <del>explicit</del> value constructor,
*************** a deleted copy constructor,
*** 47085,47091 ****
  a deleted copy assignment operator,
  and a trivial destructor.
  It shall support aggregate initialization syntax.
! </blockquote>
  
  <p>
  within the synopsis of 29.5 [atomics.types.generic] edit as follows.
--- 49006,49012 ----
  a deleted copy assignment operator,
  and a trivial destructor.
  It shall support aggregate initialization syntax.
! </p></blockquote>
  
  <p>
  within the synopsis of 29.5 [atomics.types.generic] edit as follows.
*************** template &lt;&gt; struct atomic&lt;T*&gt
*** 47111,47122 ****
  edit 29.5 [atomics.types.generic] paragraph 2 as follows.
  </p>
  
! <blockquote>
  Specializations of the <code>atomic</code> template
  shall have a deleted copy constructor,
  a deleted copy assignment operator,
  and a constexpr <del>explicit</del> value constructor.
! </blockquote>
  
  
  
--- 49032,49043 ----
  edit 29.5 [atomics.types.generic] paragraph 2 as follows.
  </p>
  
! <blockquote><p>
  Specializations of the <code>atomic</code> template
  shall have a deleted copy constructor,
  a deleted copy assignment operator,
  and a constexpr <del>explicit</del> value constructor.
! </p></blockquote>
  
  
  
*************** and a constexpr <del>explicit</del> valu
*** 47125,47138 ****
  
  <hr>
  <h3><a name="846"></a>846. No definition for constructor</h3>
! <p><b>Section:</b> X [atomics.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-06-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types">issues</a> in [atomics.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The atomic classes and class templates (29.5.1 [atomics.types.integral] /
! 29.5.2 [atomics.types.address]) have a constexpr
  constructor taking a value of the appropriate type for that atomic.
  However, neither clause provides semantics or a definition for this
  constructor.  I'm not sure if the initialization is implied by use of
--- 49046,49059 ----
  
  <hr>
  <h3><a name="846"></a>846. No definition for constructor</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-06-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The atomic classes and class templates (X [atomics.types.integral] &#47;
! X [atomics.types.address]) have a constexpr
  constructor taking a value of the appropriate type for that atomic.
  However, neither clause provides semantics or a definition for this
  constructor.  I'm not sure if the initialization is implied by use of
*************** Lawrence will provide wording.
*** 47152,47158 ****
  </p>
  <p>
  This issue is addressed in
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2783.html">N2783</a>.
  </p>
  </blockquote>
  
--- 49073,49079 ----
  </p>
  <p>
  This issue is addressed in
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2783.htm">N2783</a>.
  </p>
  </blockquote>
  
*************** constexpr <var>A</var>::<var>A</var>(<va
*** 47175,47181 ****
  Initializes the object with the value <code>desired</code>.
  [<i>Note:</i>
  Construction is not atomic.
! —<i>end note</i>]
  </dd>
  </dl>
  </blockquote>
--- 49096,49102 ----
  Initializes the object with the value <code>desired</code>.
  [<i>Note:</i>
  Construction is not atomic.
! &mdash;<i>end note</i>]
  </dd>
  </dl>
  </blockquote>
*************** Construction is not atomic.
*** 47186,47195 ****
  
  <hr>
  <h3><a name="847"></a>847. string exception safety guarantees</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Hervé Brönnimann <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In March, on comp.lang.c++.moderated, I asked what were the
--- 49107,49116 ----
  
  <hr>
  <h3><a name="847"></a>847. string exception safety guarantees</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Herv&eacute; Br&ouml;nnimann <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In March, on comp.lang.c++.moderated, I asked what were the
*************** member throws exception). The closest th
*** 47200,47211 ****
  offering any guarantees is 21.4 [basic.string], para 3:
  </p>
  
! <blockquote>
  The class template <tt>basic_string</tt> conforms to the requirements
  for a Sequence Container (23.1.1), for a Reversible Container (23.1),
  and for an Allocator-aware container (91). The iterators supported by
  <tt>basic_string</tt> are random access iterators (24.1.5).
! </blockquote>
  
  <p>
  However, the chapter 23 only says, on the topic of exceptions:  23.2 [container.requirements],
--- 49121,49132 ----
  offering any guarantees is 21.4 [basic.string], para 3:
  </p>
  
! <blockquote><p>
  The class template <tt>basic_string</tt> conforms to the requirements
  for a Sequence Container (23.1.1), for a Reversible Container (23.1),
  and for an Allocator-aware container (91). The iterators supported by
  <tt>basic_string</tt> are random access iterators (24.1.5).
! </p></blockquote>
  
  <p>
  However, the chapter 23 only says, on the topic of exceptions:  23.2 [container.requirements],
*************** I take it  as saying that this paragraph
*** 47228,47234 ****
  <tt>std::basic_string</tt>, as <tt>basic_string</tt> isn't defined in Clause 23 and
  this paragraph does not define a *requirement* of Sequence
  nor Reversible Container, just of the models defined in Clause 23.
! In addition, LWG Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#718">718</a> proposes to remove 23.2 [container.requirements], para 3.
  </p>
  
  <p>
--- 49149,49155 ----
  <tt>std::basic_string</tt>, as <tt>basic_string</tt> isn't defined in Clause 23 and
  this paragraph does not define a *requirement* of Sequence
  nor Reversible Container, just of the models defined in Clause 23.
! In addition, LWG Issue <a href="lwg-closed.html#718">718</a> proposes to remove 23.2 [container.requirements], para 3.
  </p>
  
  <p>
*************** San Francisco:
*** 47254,47282 ****
  ]</i></p>
  
  
! <blockquote>
  Implementors will study this to confirm that it is actually possible.
! </blockquote>
  
  <p><i>[
  Daniel adds 2009-02-14:
  ]</i></p>
  
  
! <blockquote>
  The proposed resolution of paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2815.html">N2815</a>
  interacts with this issue (the paper does not refer to this issue).
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 49175,49203 ----
  ]</i></p>
  
  
! <blockquote><p>
  Implementors will study this to confirm that it is actually possible.
! </p></blockquote>
  
  <p><i>[
  Daniel adds 2009-02-14:
  ]</i></p>
  
  
! <blockquote><p>
  The proposed resolution of paper
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2815.html">N2815</a>
  interacts with this issue (the paper does not refer to this issue).
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** or add paragraphs to Effects clauses whe
*** 47308,47346 ****
  
  
  <hr>
! <h3><a name="848"></a>848. missing <tt>std::hash</tt> specializations for <tt>std::bitset/std::vector&lt;bool&gt;</tt></h3>
! <p><b>Section:</b> 20.8.15 [unord.hash] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the current working draft, <tt>std::hash&lt;T&gt;</tt> is specialized for builtin
  types and a few other types. Bitsets seems like one that is missing from
  the list, not because it cannot not be done by the user, but because it
  is hard or impossible to write an efficient implementation that works on
! 32bit/64bit chunks at a time. For example, <tt>std::bitset</tt> is too much
  encapsulated in this respect.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following to the synopsis in 20.8 [function.objects]/2:
  </p>
  
! <blockquote><pre>template&lt;class Allocator&gt; struct hash&lt;std::vector&lt;bool,Allocator&gt;&gt;;
  template&lt;size_t N&gt; struct hash&lt;std::bitset&lt;N&gt;&gt;;
  </pre></blockquote>
  
  <p>
! Modify the last sentence of 20.8.15 [unord.hash]/1 to end with:
  </p>
  
! <blockquote>
  ... and <tt>std::string</tt>, <tt>std::u16string</tt>, <tt>std::u32string</tt>, <tt>std::wstring</tt>,
  <tt>std::error_code</tt>, <tt>std::thread::id</tt>, <tt>std::bitset</tt>, <tt>and std::vector&lt;bool&gt;</tt>.
! </blockquote>
  
  
  
--- 49229,49269 ----
  
  
  <hr>
! <h3><a name="848"></a>848. Missing <tt>std::hash</tt> specializations for <tt>std::bitset&#47;std::vector&lt;bool&gt;</tt></h3>
! <p><b>Section:</b> 20.9.13 [unord.hash] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Thorsten Ottosen <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.hash">active issues</a> in [unord.hash].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In the current working draft, <tt>std::hash&lt;T&gt;</tt> is specialized for builtin
  types and a few other types. Bitsets seems like one that is missing from
  the list, not because it cannot not be done by the user, but because it
  is hard or impossible to write an efficient implementation that works on
! 32bit&#47;64bit chunks at a time. For example, <tt>std::bitset</tt> is too much
  encapsulated in this respect.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following to the synopsis in 20.9 [function.objects]/2:
  </p>
  
! <blockquote><pre>
! template&lt;class Allocator&gt; struct hash&lt;std::vector&lt;bool,Allocator&gt;&gt;;
  template&lt;size_t N&gt; struct hash&lt;std::bitset&lt;N&gt;&gt;;
  </pre></blockquote>
  
  <p>
! Modify the last sentence of 20.9.13 [unord.hash]/1 to end with:
  </p>
  
! <blockquote><p>
  ... and <tt>std::string</tt>, <tt>std::u16string</tt>, <tt>std::u32string</tt>, <tt>std::wstring</tt>,
  <tt>std::error_code</tt>, <tt>std::thread::id</tt>, <tt>std::bitset</tt>, <tt>and std::vector&lt;bool&gt;</tt>.
! </p></blockquote>
  
  
  
*************** Modify the last sentence of 20.8.15 [uno
*** 47349,47361 ****
  
  <hr>
  <h3><a name="850"></a>850. Should <tt>shrink_to_fit</tt> apply to <tt>std::deque</tt>?</h3>
! <p><b>Section:</b> 23.3.2.2 [deque.capacity] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#deque.capacity">issues</a> in [deque.capacity].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#755">755</a> added a <tt>shrink_to_fit</tt> function to <tt>std::vector</tt> and <tt>std::string</tt>.
  It did not yet deal with <tt>std::deque</tt>, because of the fundamental
  difference between <tt>std::deque</tt> and the other two container types. The
  need for <tt>std::deque</tt> may seem less evident, because one might think that
--- 49272,49284 ----
  
  <hr>
  <h3><a name="850"></a>850. Should <tt>shrink_to_fit</tt> apply to <tt>std::deque</tt>?</h3>
! <p><b>Section:</b> 23.3.3.3 [deque.capacity] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-06-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#deque.capacity">issues</a> in [deque.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="lwg-defects.html#755">755</a> added a <tt>shrink_to_fit</tt> function to <tt>std::vector</tt> and <tt>std::string</tt>.
  It did not yet deal with <tt>std::deque</tt>, because of the fundamental
  difference between <tt>std::deque</tt> and the other two container types. The
  need for <tt>std::deque</tt> may seem less evident, because one might think that
*************** blocks that's bounded by a small constan
*** 47366,47415 ****
  The container overhead can in fact be arbitrarily large (i.e. is not
  necessarily O(N) where N is the number of elements currently held by the
  <tt>deque</tt>).  As Bill Plauger noted in a reflector message, unless the map of
! block pointers is shrunk, it must hold at least maxN/B pointers where
  maxN is the maximum of N over the lifetime of the <tt>deque</tt> since its
  creation.  This is independent of how the map is implemented
  (<tt>vector</tt>-like circular buffer and all), and maxN bears no relation to N,
  the number of elements it currently holds.
  </p>
  <p>
! Hervé Brönnimann reports a situation where a <tt>deque</tt> of requests grew very
  large due to some temporary backup (the front request hanging), and the
  map of the <tt>deque</tt> grew quite large before getting back to normal.  Just
  to put some color on it, assuming a <tt>deque</tt> with 1K pointer elements in
  steady regime, that held, at some point in its lifetime, maxN=10M
  pointers, with one block holding 128 elements, the spine must be at
! least (maxN / 128), in that case 100K.   In that case, shrink-to-fit
  would allow to reuse about 100K which would otherwise never be reclaimed
  in the lifetime of the <tt>deque</tt>.
  </p>
  <p>
! An added bonus would be that it *allows* implementations to hang on to
  empty blocks at the end (but does not care if they do or not).  A
  <tt>shrink_to_fit</tt> would take care of both shrinks, and guarantee that at
  most O(B) space is used in addition to the storage to hold the N
! elements and the N/B block pointers.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! To Class template deque 23.3.2 [deque] synopsis, add:
  </p>
! <blockquote><pre>void shrink_to_fit();
  </pre></blockquote>
  
  <p>
! To deque capacity 23.3.2.2 [deque.capacity], add:
  </p>
! <blockquote><pre>void shrink_to_fit();
  </pre>
  
! <blockquote>
  <i>Remarks:</i> <tt>shrink_to_fit</tt> is a non-binding request to reduce memory
  use. [<i>Note:</i> The request is non-binding to allow latitude for
! implementation-specific optimizations. -- <i>end note</i>]
! </blockquote>
  </blockquote>
  
  
--- 49289,49340 ----
  The container overhead can in fact be arbitrarily large (i.e. is not
  necessarily O(N) where N is the number of elements currently held by the
  <tt>deque</tt>).  As Bill Plauger noted in a reflector message, unless the map of
! block pointers is shrunk, it must hold at least maxN&frasl;B pointers where
  maxN is the maximum of N over the lifetime of the <tt>deque</tt> since its
  creation.  This is independent of how the map is implemented
  (<tt>vector</tt>-like circular buffer and all), and maxN bears no relation to N,
  the number of elements it currently holds.
  </p>
  <p>
! Herv&eacute; Br&ouml;nnimann reports a situation where a <tt>deque</tt> of requests grew very
  large due to some temporary backup (the front request hanging), and the
  map of the <tt>deque</tt> grew quite large before getting back to normal.  Just
  to put some color on it, assuming a <tt>deque</tt> with 1K pointer elements in
  steady regime, that held, at some point in its lifetime, maxN=10M
  pointers, with one block holding 128 elements, the spine must be at
! least (maxN &frasl; 128), in that case 100K.   In that case, shrink-to-fit
  would allow to reuse about 100K which would otherwise never be reclaimed
  in the lifetime of the <tt>deque</tt>.
  </p>
  <p>
! An added bonus would be that it <em>allows</em> implementations to hang on to
  empty blocks at the end (but does not care if they do or not).  A
  <tt>shrink_to_fit</tt> would take care of both shrinks, and guarantee that at
  most O(B) space is used in addition to the storage to hold the N
! elements and the N&frasl;B block pointers.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! To class template <tt>deque</tt> 23.3.3 [deque] synopsis, add:
  </p>
! <blockquote><pre>
! void shrink_to_fit();
  </pre></blockquote>
  
  <p>
! To deque capacity 23.3.3.3 [deque.capacity], add:
  </p>
! <blockquote><pre>
! void shrink_to_fit();
  </pre>
  
! <blockquote><p>
  <i>Remarks:</i> <tt>shrink_to_fit</tt> is a non-binding request to reduce memory
  use. [<i>Note:</i> The request is non-binding to allow latitude for
! implementation-specific optimizations. &mdash; <i>end note</i>]
! </p></blockquote>
  </blockquote>
  
  
*************** implementation-specific optimizations. -
*** 47418,47442 ****
  
  <hr>
  <h3><a name="852"></a>852. unordered containers <tt>begin(n)</tt> mistakenly <tt>const</tt></h3>
! <p><b>Section:</b> 23.7 [unord] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2008-06-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 3 of the four unordered containers the local <tt>begin</tt> member is mistakenly declared <tt>const</tt>:
  </p>
  
! <blockquote><pre>local_iterator begin(size_type n) const;
  </pre></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 23.7.1 [unord.map], 23.7.2 [unord.multimap], and 23.7.4 [unord.multiset]:
  </p>
  
! <blockquote><pre>local_iterator begin(size_type n)<del> const</del>;
  </pre></blockquote>
  
  
--- 49343,49369 ----
  
  <hr>
  <h3><a name="852"></a>852. unordered containers <tt>begin(n)</tt> mistakenly <tt>const</tt></h3>
! <p><b>Section:</b> 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2008-06-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 3 of the four unordered containers the local <tt>begin</tt> member is mistakenly declared <tt>const</tt>:
  </p>
  
! <blockquote><pre>
! local_iterator begin(size_type n) const;
  </pre></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 23.5.4 [unord.map], 23.5.5 [unord.multimap], and 23.5.7 [unord.multiset]:
  </p>
  
! <blockquote><pre>
! local_iterator begin(size_type n)<del> const</del>;
  </pre></blockquote>
  
  
*************** Change the synopsis in 23.7.1 [unord.map
*** 47445,47457 ****
  
  <hr>
  <h3><a name="853"></a>853. <tt>to_string</tt> needs updating with <tt>zero</tt> and <tt>one</tt></h3>
! <p><b>Section:</b> 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-06-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#396">396</a> adds defaulted arguments to the <tt>to_string</tt> member, but neglects to update
  the three newer <tt>to_string</tt> overloads.
  </p>
  
--- 49372,49385 ----
  
  <hr>
  <h3><a name="853"></a>853. <tt>to_string</tt> needs updating with <tt>zero</tt> and <tt>one</tt></h3>
! <p><b>Section:</b> 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-06-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="lwg-defects.html#396">396</a> adds defaulted arguments to the <tt>to_string</tt> member, but neglects to update
  the three newer <tt>to_string</tt> overloads.
  </p>
  
*************** post San Francisco:
*** 47460,47469 ****
  ]</i></p>
  
  
! <blockquote>
  Daniel found problems with the wording and provided fixes.  Moved from Ready
  to Review.
! </blockquote>
  
  <p><i>[
  Post Summit:
--- 49388,49397 ----
  ]</i></p>
  
  
! <blockquote><p>
  Daniel found problems with the wording and provided fixes.  Moved from Ready
  to Review.
! </p></blockquote>
  
  <p><i>[
  Post Summit:
*************** Recommend Tentatively Ready.
*** 47488,47505 ****
  </blockquote>
  
  <p><i>[
! 2009-05-09:  See alternative solution in issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1113">1113</a>.
  ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol type="A">
  <li>
! <p>replace in 20.5 [template.bitset]/1 (class <tt>bitset</tt>)
  </p>
! <blockquote><pre>template &lt;class charT, class traits&gt;
    basic_string&lt;charT, traits, allocator&lt;charT&gt; &gt;
    to_string(<ins>charT zero = charT('0'), charT one = charT('1')</ins>) const;
  template &lt;class charT&gt;
--- 49416,49434 ----
  </blockquote>
  
  <p><i>[
! 2009-05-09:  See alternative solution in issue <a href="lwg-defects.html#1113">1113</a>.
  ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol style="list-style-type:upper-alpha">
  <li>
! <p>replace in 20.6 [template.bitset]/1 (class <tt>bitset</tt>)
  </p>
! <blockquote><pre>
! template &lt;class charT, class traits&gt;
    basic_string&lt;charT, traits, allocator&lt;charT&gt; &gt;
    to_string(<ins>charT zero = charT('0'), charT one = charT('1')</ins>) const;
  template &lt;class charT&gt;
*************** basic_string&lt;char, char_traits&lt;cha
*** 47511,47553 ****
  </li>
  <li>
  <p>
! replace in 20.5.2 [bitset.members]/37
  </p>
! <blockquote><pre>template &lt;class charT, class traits&gt;
    basic_string&lt;charT, traits, allocator&lt;charT&gt; &gt;
    to_string(<ins>charT zero = charT('0'), charT one = charT('1')</ins>) const;
  </pre>
! <blockquote>
  37 <i>Returns:</i> <tt>to_string&lt;charT, traits, allocator&lt;charT&gt; &gt;(<ins>zero, one</ins>)</tt>.
! </blockquote>
  </blockquote>
  </li>
  <li>
  <p>
! replace in 20.5.2 [bitset.members]/38
  </p>
  
! <blockquote><pre>template &lt;class charT&gt;
    basic_string&lt;charT, char_traits&lt;charT&gt;, allocator&lt;charT&gt; &gt;
    to_string(<ins>charT zero = charT('0'), charT one = charT('1')</ins>) const;
  </pre>
! <blockquote>
  38 <i>Returns:</i> <tt>to_string&lt;charT, char_traits&lt;charT&gt;, allocator&lt;charT&gt; &gt;(<ins>zero, one</ins>)</tt>.
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! replace in 20.5.2 [bitset.members]/39
  </p>
  
! <blockquote><pre>basic_string&lt;char, char_traits&lt;char&gt;, allocator&lt;char&gt; &gt;
    to_string(<ins>char zero = '0', char one = '1'</ins>) const;
  </pre>
! <blockquote>
  39 <i>Returns:</i> <tt>to_string&lt;char, char_traits&lt;char&gt;, allocator&lt;char&gt; &gt;(<ins>zero, one</ins>)</tt>.
! </blockquote>
  </blockquote>
  </li>
  
--- 49440,49485 ----
  </li>
  <li>
  <p>
! replace in 20.6.2 [bitset.members]/37
  </p>
! <blockquote><pre>
! template &lt;class charT, class traits&gt;
    basic_string&lt;charT, traits, allocator&lt;charT&gt; &gt;
    to_string(<ins>charT zero = charT('0'), charT one = charT('1')</ins>) const;
  </pre>
! <blockquote><p>
  37 <i>Returns:</i> <tt>to_string&lt;charT, traits, allocator&lt;charT&gt; &gt;(<ins>zero, one</ins>)</tt>.
! </p></blockquote>
  </blockquote>
  </li>
  <li>
  <p>
! replace in 20.6.2 [bitset.members]/38
  </p>
  
! <blockquote><pre>
! template &lt;class charT&gt;
    basic_string&lt;charT, char_traits&lt;charT&gt;, allocator&lt;charT&gt; &gt;
    to_string(<ins>charT zero = charT('0'), charT one = charT('1')</ins>) const;
  </pre>
! <blockquote><p>
  38 <i>Returns:</i> <tt>to_string&lt;charT, char_traits&lt;charT&gt;, allocator&lt;charT&gt; &gt;(<ins>zero, one</ins>)</tt>.
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! replace in 20.6.2 [bitset.members]/39
  </p>
  
! <blockquote><pre>
! basic_string&lt;char, char_traits&lt;char&gt;, allocator&lt;char&gt; &gt;
    to_string(<ins>char zero = '0', char one = '1'</ins>) const;
  </pre>
! <blockquote><p>
  39 <i>Returns:</i> <tt>to_string&lt;char, char_traits&lt;char&gt;, allocator&lt;char&gt; &gt;(<ins>zero, one</ins>)</tt>.
! </p></blockquote>
  </blockquote>
  </li>
  
*************** replace in 20.5.2 [bitset.members]/39
*** 47560,47569 ****
  
  <hr>
  <h3><a name="854"></a>854. <tt>default_delete</tt> converting constructor underspecified</h3>
! <p><b>Section:</b> 20.9.9.1.2 [unique.ptr.dltr.dflt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-06-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.dltr.dflt">issues</a> in [unique.ptr.dltr.dflt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  No relationship between <tt>U</tt> and <tt>T</tt> in the converting constructor for <tt>default_delete</tt> template.
--- 49492,49501 ----
  
  <hr>
  <h3><a name="854"></a>854. <tt>default_delete</tt> converting constructor underspecified</h3>
! <p><b>Section:</b> 20.8.1.1.2 [unique.ptr.dltr.dflt] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-06-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.dltr.dflt">issues</a> in [unique.ptr.dltr.dflt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  No relationship between <tt>U</tt> and <tt>T</tt> in the converting constructor for <tt>default_delete</tt> template.
*************** I believe the current proposed wording
*** 47591,47604 ****
  (<tt>requires Convertible&lt;U*, T*&gt; &amp;&amp; HasVirtualDestructor&lt;T&gt;</tt>) does so:
  </p>
  
! <blockquote><pre>#include &lt;memory&gt;
  
  int main()
  {
      std::unique_ptr&lt;int&gt; p1(new int(1));
      std::unique_ptr&lt;const int&gt; p2(move(p1));
      int i = *p2;
! <font color="#C80000">//    *p2 = i;  // should not compile</font>
  }
  </pre></blockquote>
  
--- 49523,49537 ----
  (<tt>requires Convertible&lt;U*, T*&gt; &amp;&amp; HasVirtualDestructor&lt;T&gt;</tt>) does so:
  </p>
  
! <blockquote><pre>
! #include &lt;memory&gt;
  
  int main()
  {
      std::unique_ptr&lt;int&gt; p1(new int(1));
      std::unique_ptr&lt;const int&gt; p2(move(p1));
      int i = *p2;
! <span style="color:#C80000">//    *p2 = i;  // should not compile</span>
  }
  </pre></blockquote>
  
*************** Recommend Keep in Review.
*** 47632,47640 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Keep in Review status for the reasons cited.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 49565,49573 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Keep in Review status for the reasons cited.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** Move back to Open.
*** 47661,47678 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add after 20.9.9.1.2 [unique.ptr.dltr.dflt], p1:
  </p>
  
! <blockquote><pre>template &lt;class U&gt; default_delete(const default_delete&lt;U&gt;&amp; other);
  </pre>
  <blockquote>
  <p>
--- 49594,49612 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add after 20.8.1.1.2 [unique.ptr.dltr.dflt], p1:
  </p>
  
! <blockquote><pre>
! template &lt;class U&gt; default_delete(const default_delete&lt;U&gt;&amp; other);
  </pre>
  <blockquote>
  <p>
*************** if and only if <tt>U*</tt> is implicitly
*** 47692,47701 ****
  
  <hr>
  <h3><a name="856"></a>856. Removal of <tt>aligned_union</tt></h3>
! <p><b>Section:</b> 20.7.7.6 [meta.trans.other] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2008-06-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  With the arrival of extended unions 
--- 49626,49636 ----
  
  <hr>
  <h3><a name="856"></a>856. Removal of <tt>aligned_union</tt></h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2008-06-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  With the arrival of extended unions 
*************** the "extended unions" core-language faci
*** 47708,47724 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Remove the following signature from 20.7.2 [meta.type.synop]:
  </p>
! <blockquote><pre>template &lt;std::size_t Len, class... Types&gt; struct aligned_union;
  </pre></blockquote>
  
  <p>
! Remove the second row from table 51 in 20.7.7.6 [meta.trans.other],
  starting with:
  </p>
  
! <blockquote><pre>template &lt;std::size_t Len,
  class... Types&gt;
  struct aligned_union;
  </pre></blockquote>
--- 49643,49661 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Remove the following signature from 20.10.2 [meta.type.synop]:
  </p>
! <blockquote><pre>
! template &lt;std::size_t Len, class... Types&gt; struct aligned_union;
  </pre></blockquote>
  
  <p>
! Remove the second row from table 51 in 20.10.7.6 [meta.trans.other],
  starting with:
  </p>
  
! <blockquote><pre>
! template &lt;std::size_t Len,
  class... Types&gt;
  struct aligned_union;
  </pre></blockquote>
*************** struct aligned_union;
*** 47729,47738 ****
  
  <hr>
  <h3><a name="857"></a>857. <tt>condition_variable::time_wait</tt> return <tt>bool</tt> error prone</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-06-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The meaning of the <tt>bool</tt> returned by <tt>condition_variable::timed_wait</tt> is so
--- 49666,49675 ----
  
  <hr>
  <h3><a name="857"></a>857. <tt>condition_variable::time_wait</tt> return <tt>bool</tt> error prone</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-06-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The meaning of the <tt>bool</tt> returned by <tt>condition_variable::timed_wait</tt> is so
*************** people have independently stumbled on th
*** 47742,47755 ****
  <p>
  It might be simpler to change the return type to a scoped enum:
  </p>
! <blockquote><pre>enum class timeout { not_reached, reached };
  </pre></blockquote>
  
  <p>
  That's the same cost as returning a <tt>bool</tt>, but not subject to mistakes. Your example below would be:
  </p>
  
! <blockquote><pre>if (cv.wait_until(lk, time_limit) == timeout::reached )
    throw time_out();
  </pre></blockquote>
  
--- 49679,49694 ----
  <p>
  It might be simpler to change the return type to a scoped enum:
  </p>
! <blockquote><pre>
! enum class timeout { not_reached, reached };
  </pre></blockquote>
  
  <p>
  That's the same cost as returning a <tt>bool</tt>, but not subject to mistakes. Your example below would be:
  </p>
  
! <blockquote><pre>
! if (cv.wait_until(lk, time_limit) == timeout::reached )
    throw time_out();
  </pre></blockquote>
  
*************** Howard to provide wording.
*** 47790,47798 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 49729,49737 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Change Condition variables 30.5 [thread.
*** 47802,47808 ****
  condition_variable synopsis, as indicated:
  </p>
  
! <blockquote><pre>namespace std {
    class condition_variable;
    class condition_variable_any;
  
--- 49741,49748 ----
  condition_variable synopsis, as indicated:
  </p>
  
! <blockquote><pre>
! namespace std {
    class condition_variable;
    class condition_variable_any;
  
*************** condition_variable synopsis, as indicate
*** 47811,47820 ****
  </pre></blockquote>
  
  <p>
! Change Class condition_variable 30.5.1 [thread.condition.condvar] as indicated:
  </p>
  
! <blockquote><pre>class condition_variable { 
  public:
    ...
    template &lt;class Clock, class Duration&gt;
--- 49751,49761 ----
  </pre></blockquote>
  
  <p>
! Change class <tt>condition_variable</tt> 30.5.1 [thread.condition.condvar] as indicated:
  </p>
  
! <blockquote><pre>
! class condition_variable { 
  public:
    ...
    template &lt;class Clock, class Duration&gt;
*************** cannot be achieved.
*** 47900,47906 ****
  
  <ul>
  <li>
! <tt>operation_not_permitted</tt> — if the thread does not own the lock.
  </li>
  <li>
  equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
--- 49841,49847 ----
  
  <ul>
  <li>
! <tt>operation_not_permitted</tt> &mdash; if the thread does not own the lock.
  </li>
  <li>
  equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
*************** equivalent error condition from <tt>lock
*** 47908,47914 ****
  </ul>
  </blockquote>
  
! <pre>template &lt;class Rep, class Period&gt;
    <del>bool</del> <ins>cv_status</ins> wait_for(unique_lock&lt;mutex&gt;&amp; lock,
                  const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  
--- 49849,49856 ----
  </ul>
  </blockquote>
  
! <pre>
! template &lt;class Rep, class Period&gt;
    <del>bool</del> <ins>cv_status</ins> wait_for(unique_lock&lt;mutex&gt;&amp; lock,
                  const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  
*************** equivalent error condition from <tt>lock
*** 47917,47923 ****
  <p>
  -21- <i><del>Effects</del> <ins>Returns</ins>:</i>
  </p>
! <blockquote><pre>wait_until(lock, chrono::monotonic_clock::now() + rel_time)
  </pre></blockquote>
  <p>
  <del>-22- <i>Returns:</i> <tt>false</tt> if the call is returning because the time
--- 49859,49866 ----
  <p>
  -21- <i><del>Effects</del> <ins>Returns</ins>:</i>
  </p>
! <blockquote><pre>
! wait_until(lock, chrono::monotonic_clock::now() + rel_time)
  </pre></blockquote>
  <p>
  <del>-22- <i>Returns:</i> <tt>false</tt> if the call is returning because the time
*************** otherwise <tt>true</tt>.</del>
*** 47926,47938 ****
  </p>
  
  <p><i>[
! This part of the wording may conflict with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a> in detail, but does
  not do so in spirit.  If both issues are accepted, there is a logical merge.
  ]</i></p>
  
  </blockquote>
  
! <pre>template &lt;class Clock, class Duration, class Predicate&gt; 
    bool wait_until(unique_lock&lt;mutex&gt;&amp; lock, 
                    const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time, 
                    Predicate pred);
--- 49869,49882 ----
  </p>
  
  <p><i>[
! This part of the wording may conflict with <a href="lwg-defects.html#859">859</a> in detail, but does
  not do so in spirit.  If both issues are accepted, there is a logical merge.
  ]</i></p>
  
  </blockquote>
  
! <pre>
! template &lt;class Clock, class Duration, class Predicate&gt; 
    bool wait_until(unique_lock&lt;mutex&gt;&amp; lock, 
                    const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time, 
                    Predicate pred);
*************** not do so in spirit.  If both issues are
*** 47942,47948 ****
  <p>
  -23- <i>Effects:</i>
  </p>
! <blockquote><pre>while (!pred()) 
    if (<del>!</del>wait_until(lock, abs_time) <ins>== cv_status::timeout</ins>) 
      return pred(); 
  return true;
--- 49886,49893 ----
  <p>
  -23- <i>Effects:</i>
  </p>
! <blockquote><pre>
! while (!pred()) 
    if (<del>!</del>wait_until(lock, abs_time) <ins>== cv_status::timeout</ins>) 
      return pred(); 
  return true;
*************** return true;
*** 47956,47962 ****
  -25- [<i>Note:</i>
  The returned value indicates whether the predicate evaluates to
  <tt>true</tt> regardless of whether the timeout was triggered.
! — <i>end note</i>].
  </p>
  </blockquote>
  </blockquote>
--- 49901,49907 ----
  -25- [<i>Note:</i>
  The returned value indicates whether the predicate evaluates to
  <tt>true</tt> regardless of whether the timeout was triggered.
! &mdash; <i>end note</i>].
  </p>
  </blockquote>
  </blockquote>
*************** The returned value indicates whether the
*** 47965,47971 ****
  Change Class condition_variable_any 30.5.2 [thread.condition.condvarany] as indicated:
  </p>
  
! <blockquote><pre>class condition_variable_any {
  public:
    ...
    template &lt;class Lock, class Clock, class Duration&gt;
--- 49910,49917 ----
  Change Class condition_variable_any 30.5.2 [thread.condition.condvarany] as indicated:
  </p>
  
! <blockquote><pre>
! class condition_variable_any {
  public:
    ...
    template &lt;class Lock, class Clock, class Duration&gt;
*************** equivalent error condition from <tt>lock
*** 48044,48050 ****
  </ul>
  </blockquote>
  
! <pre>template &lt;class Lock, class Rep, class Period&gt;
    <del>bool</del> <ins>cv_status</ins> wait_for(Lock&amp; lock,
                  const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  
--- 49990,49997 ----
  </ul>
  </blockquote>
  
! <pre>
! template &lt;class Lock, class Rep, class Period&gt;
    <del>bool</del> <ins>cv_status</ins> wait_for(Lock&amp; lock,
                  const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  
*************** equivalent error condition from <tt>lock
*** 48054,48060 ****
  <p>
  -18- <i><del>Effects</del> <ins>Returns</ins>:</i>
  </p>
! <blockquote><pre>wait_until(lock, chrono::monotonic_clock::now() + rel_time)
  </pre></blockquote>
  
  <p>
--- 50001,50008 ----
  <p>
  -18- <i><del>Effects</del> <ins>Returns</ins>:</i>
  </p>
! <blockquote><pre>
! wait_until(lock, chrono::monotonic_clock::now() + rel_time)
  </pre></blockquote>
  
  <p>
*************** otherwise <tt>true</tt>.</del>
*** 48064,48077 ****
  </p>
  
  <p><i>[
! This part of the wording may conflict with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a> in detail, but does
  not do so in spirit.  If both issues are accepted, there is a logical merge.
  ]</i></p>
  
  
  </blockquote>
  
! <pre>template &lt;class Lock, class Clock, class Duration, class Predicate&gt; 
    bool wait_until(Lock&amp; lock, 
                    const chrono::time_point&lt;Clock, Duration&gt;&amp; <del>rel_time</del> <ins>abs_time</ins>, 
                    Predicate pred);
--- 50012,50026 ----
  </p>
  
  <p><i>[
! This part of the wording may conflict with <a href="lwg-defects.html#859">859</a> in detail, but does
  not do so in spirit.  If both issues are accepted, there is a logical merge.
  ]</i></p>
  
  
  </blockquote>
  
! <pre>
! template &lt;class Lock, class Clock, class Duration, class Predicate&gt; 
    bool wait_until(Lock&amp; lock, 
                    const chrono::time_point&lt;Clock, Duration&gt;&amp; <del>rel_time</del> <ins>abs_time</ins>, 
                    Predicate pred);
*************** not do so in spirit.  If both issues are
*** 48081,48087 ****
  <p>
  -20- <i>Effects:</i>
  </p>
! <blockquote><pre>while (!pred()) 
    if (<del>!</del>wait_until(lock, abs_time) <ins>== cv_status::timeout</ins>) 
      return pred(); 
  return true;
--- 50030,50037 ----
  <p>
  -20- <i>Effects:</i>
  </p>
! <blockquote><pre>
! while (!pred()) 
    if (<del>!</del>wait_until(lock, abs_time) <ins>== cv_status::timeout</ins>) 
      return pred(); 
  return true;
*************** return true;
*** 48095,48101 ****
  -22- [<i>Note:</i>
  The returned value indicates whether the predicate evaluates to
  <tt>true</tt> regardless of whether the timeout was triggered.
! — <i>end note</i>].
  </p>
  </blockquote>
  
--- 50045,50051 ----
  -22- [<i>Note:</i>
  The returned value indicates whether the predicate evaluates to
  <tt>true</tt> regardless of whether the timeout was triggered.
! &mdash; <i>end note</i>].
  </p>
  </blockquote>
  
*************** The returned value indicates whether the
*** 48108,48125 ****
  
  <hr>
  <h3><a name="858"></a>858. Wording for Minimal Support for Garbage Collection</h3>
! <p><b>Section:</b> 20.9.11 [util.dynamic.safety] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker  <b>Opened:</b> 2008-06-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.dynamic.safety">issues</a> in [util.dynamic.safety].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The first sentence of the Effects clause for <tt>undeclare_reachable</tt> seems
  to be missing some words. I can't parse
  </p>
! <blockquote>
  ... for all non-null <tt>p</tt> referencing the argument is no longer declared reachable...
! </blockquote>
  <p>
  I take it the intent is that <tt>undeclare_reachable</tt> should be called only
  when there has been a corresponding call to <tt>declare_reachable</tt>. In
--- 50058,50075 ----
  
  <hr>
  <h3><a name="858"></a>858. Wording for Minimal Support for Garbage Collection</h3>
! <p><b>Section:</b> 20.7.4 [util.dynamic.safety] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Pete Becker  <b>Opened:</b> 2008-06-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.dynamic.safety">issues</a> in [util.dynamic.safety].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The first sentence of the Effects clause for <tt>undeclare_reachable</tt> seems
  to be missing some words. I can't parse
  </p>
! <blockquote><p>
  ... for all non-null <tt>p</tt> referencing the argument is no longer declared reachable...
! </p></blockquote>
  <p>
  I take it the intent is that <tt>undeclare_reachable</tt> should be called only
  when there has been a corresponding call to <tt>declare_reachable</tt>. In
*************** to clarify the intent.
*** 48159,48165 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9.11 [util.dynamic.safety]
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2670.htm">N2670</a>,
  Minimal Support for Garbage Collection)
  </p>
--- 50109,50115 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.7.4 [util.dynamic.safety]
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2670.htm">N2670</a>,
  Minimal Support for Garbage Collection)
  </p>
*************** Minimal Support for Garbage Collection)
*** 48167,48197 ****
  Add at the beginning, before paragraph 39
  </p>
  
! <blockquote>
  A complete object is <i>declared reachable</i> while the number of calls
  to <tt>declare_reachable</tt> with an argument referencing the object exceeds the
  number of <tt>undeclare_reachable</tt> calls with pointers to the same complete
  object.
! </blockquote>
  
  <p>
  Change paragraph 42 (Requires clause for <tt>undeclare_reachable</tt>)
  </p>
  
! <blockquote>
  If <tt>p</tt> is not null, <del><tt>declare_reachable(p)</tt> was previously called</del>
  <ins>the complete object referenced by <tt>p</tt> shall have
  been previously declared reachable</ins>, and shall
  be live <ins>(3.8 [basic.life])</ins> from the time of the call until the last <tt>undeclare_reachable(p)</tt>
  call on the object.
! </blockquote>
  
  <p>
  Change the first sentence in paragraph 44 (Effects clause for
  <tt>undeclare_reachable</tt>):
  </p>
  
! <blockquote>
  <i>Effects:</i> 
  <del>Once the number of calls to
  <tt>undeclare_reachable(p)</tt> equals the number of calls to
--- 50117,50147 ----
  Add at the beginning, before paragraph 39
  </p>
  
! <blockquote><p>
  A complete object is <i>declared reachable</i> while the number of calls
  to <tt>declare_reachable</tt> with an argument referencing the object exceeds the
  number of <tt>undeclare_reachable</tt> calls with pointers to the same complete
  object.
! </p></blockquote>
  
  <p>
  Change paragraph 42 (Requires clause for <tt>undeclare_reachable</tt>)
  </p>
  
! <blockquote><p>
  If <tt>p</tt> is not null, <del><tt>declare_reachable(p)</tt> was previously called</del>
  <ins>the complete object referenced by <tt>p</tt> shall have
  been previously declared reachable</ins>, and shall
  be live <ins>(3.8 [basic.life])</ins> from the time of the call until the last <tt>undeclare_reachable(p)</tt>
  call on the object.
! </p></blockquote>
  
  <p>
  Change the first sentence in paragraph 44 (Effects clause for
  <tt>undeclare_reachable</tt>):
  </p>
  
! <blockquote><p>
  <i>Effects:</i> 
  <del>Once the number of calls to
  <tt>undeclare_reachable(p)</tt> equals the number of calls to
*************** referenced by <tt>p</tt> is no longer de
*** 48206,48212 ****
  dereferencing any pointer to <tt>q</tt> that is not safely derived
  results in undefined behavior.
  </ins> ...
! </blockquote>
  
  <p>
  Change the final note:
--- 50156,50162 ----
  dereferencing any pointer to <tt>q</tt> that is not safely derived
  results in undefined behavior.
  </ins> ...
! </p></blockquote>
  
  <p>
  Change the final note:
*************** note</i>]
*** 48230,48245 ****
  
  <hr>
  <h3><a name="859"></a>859. Monotonic Clock is Conditionally Supported?</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-06-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#958">958</a>, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#959">959</a>.</p>
  
  <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.html">N2661</a>
  says that there is a class named <tt>monotonic_clock</tt>. It also says that this
  name may be a synonym for <tt>system_clock</tt>, and that it's conditionally
  supported. So the actual requirement is that it can be monotonic or not,
--- 50180,50195 ----
  
  <hr>
  <h3><a name="859"></a>859. Monotonic Clock is Conditionally Supported?</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-06-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p>Related to <a href="lwg-defects.html#958">958</a>, <a href="lwg-closed.html#959">959</a>.</p>
  
  <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.htm">N2661</a>
  says that there is a class named <tt>monotonic_clock</tt>. It also says that this
  name may be a synonym for <tt>system_clock</tt>, and that it's conditionally
  supported. So the actual requirement is that it can be monotonic or not,
*************** variants of <tt>wait_for</tt> explicitly
*** 48253,48259 ****
  meaning of an effects clause that says
  </p>
  
! <blockquote><pre>wait_until(lock, chrono::monotonic_clock::now() + rel_time)
  </pre></blockquote>
  
  <p>
--- 50203,50210 ----
  meaning of an effects clause that says
  </p>
  
! <blockquote><pre>
! wait_until(lock, chrono::monotonic_clock::now() + rel_time)
  </pre></blockquote>
  
  <p>
*************** San Francisco:
*** 48267,48286 ****
  
  <blockquote>
  <p>
! Nick: maybe instead of saying that chrono::monotonic_clock is
  conditionally supported, we could say that it's always there, but not
  necessarily supported..
  </p>
  <p>
  Beman: I'd prefer a typedef that identifies the best clock to use for
! wait_for locks.
  </p>
  <p>
  Tom: combine the two concepts; create a duration clock type, but keep
  the is_monotonic test.
  </p>
  <p>
! Howard: if we create a duration_clock type, is it a typedef or an
  entirely true type?
  </p>
  <p>
--- 50218,50237 ----
  
  <blockquote>
  <p>
! Nick: maybe instead of saying that <tt>chrono::monotonic_clock</tt> is
  conditionally supported, we could say that it's always there, but not
  necessarily supported..
  </p>
  <p>
  Beman: I'd prefer a typedef that identifies the best clock to use for
! <tt>wait_for</tt> locks.
  </p>
  <p>
  Tom: combine the two concepts; create a duration clock type, but keep
  the is_monotonic test.
  </p>
  <p>
! Howard: if we create a <tt>duration_clock</tt> type, is it a typedef or an
  entirely true type?
  </p>
  <p>
*************** And paragraph 2 of 30.2.4 [thread.req.ti
*** 48313,48323 ****
  implementations to use monotonic clocks for <tt>sleep_for</tt>:
  </p>
  
! <blockquote>
  2 The member functions whose names end in <tt>_for</tt> take an argument that
  specifies a relative time. Implementations should use a monotonic clock to
  measure time for these functions.
! </blockquote>
  
  <p>
  I believe the approach taken in describing the effects of <tt>sleep_for</tt>
--- 50264,50274 ----
  implementations to use monotonic clocks for <tt>sleep_for</tt>:
  </p>
  
! <blockquote><p>
  2 The member functions whose names end in <tt>_for</tt> take an argument that
  specifies a relative time. Implementations should use a monotonic clock to
  measure time for these functions.
! </p></blockquote>
  
  <p>
  I believe the approach taken in describing the effects of <tt>sleep_for</tt>
*************** Move to Ready.
*** 48342,48348 ****
  </blockquote>
  
  <p><i>[
! 2009-07-21 Beman added the requested wording changes to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>.
  ]</i></p>
  
  
--- 50293,50299 ----
  </blockquote>
  
  <p><i>[
! 2009-07-21 Beman added the requested wording changes to <a href="lwg-defects.html#962">962</a>.
  ]</i></p>
  
  
*************** Change 30.5.1 [thread.condition.condvar]
*** 48354,48360 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class Rep, class Period&gt; 
    bool wait_for(unique_lock&lt;mutex&gt;&amp; lock, 
                  const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
--- 50305,50312 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Rep, class Period&gt; 
    bool wait_for(unique_lock&lt;mutex&gt;&amp; lock, 
                  const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
*************** arguments supplied by all concurrently w
*** 48371,48377 ****
  <p>
  21 <i>Effects:</i>
  </p>
! <blockquote><pre><del>wait_until(lock, chrono::monotonic_clock::now() + rel_time)</del>
  </pre></blockquote>
  <ul>
  <li><ins>
--- 50323,50330 ----
  <p>
  21 <i>Effects:</i>
  </p>
! <blockquote><pre>
! <del>wait_until(lock, chrono::monotonic_clock::now() + rel_time)</del>
  </pre></blockquote>
  <ul>
  <li><ins>
*************** duration specified by <tt>rel_time</tt>
*** 48406,48412 ****
  </p>
  
  <p><i>[
! This part of the wording may conflict with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#857">857</a> in detail, but does
  not do so in spirit.  If both issues are accepted, there is a logical merge.
  ]</i></p>
  
--- 50359,50365 ----
  </p>
  
  <p><i>[
! This part of the wording may conflict with <a href="lwg-defects.html#857">857</a> in detail, but does
  not do so in spirit.  If both issues are accepted, there is a logical merge.
  ]</i></p>
  
*************** Change 30.5.1 [thread.condition.condvar]
*** 48436,48442 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class Rep, class Period, class Predicate&gt; 
    bool wait_for(unique_lock&lt;mutex&gt;&amp; lock, 
                  const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, 
                  Predicate pred);
--- 50389,50396 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Rep, class Period, class Predicate&gt; 
    bool wait_for(unique_lock&lt;mutex&gt;&amp; lock, 
                  const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, 
                  Predicate pred);
*************** arguments supplied by all concurrently w
*** 48454,48460 ****
  <p>
  <i>26 Effects:</i>
  </p>
! <blockquote><pre><del>wait_until(lock, chrono::monotonic_clock::now() + rel_time, std::move(pred))</del>
  </pre>
  <ul>
  <li><ins>
--- 50408,50415 ----
  <p>
  <i>26 Effects:</i>
  </p>
! <blockquote><pre>
! <del>wait_until(lock, chrono::monotonic_clock::now() + rel_time, std::move(pred))</del>
  </pre>
  <ul>
  <li><ins>
*************** Change 30.5.2 [thread.condition.condvara
*** 48527,48540 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class Lock, class Rep, class Period&gt; 
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
  <blockquote>
  <p>
  18 <i>Effects:</i>
  </p>
! <blockquote><pre><del>wait_until(lock, chrono::monotonic_clock::now() + rel_time)</del>
  </pre></blockquote>
  
  <ul>
--- 50482,50497 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Lock, class Rep, class Period&gt; 
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
  <blockquote>
  <p>
  18 <i>Effects:</i>
  </p>
! <blockquote><pre>
! <del>wait_until(lock, chrono::monotonic_clock::now() + rel_time)</del>
  </pre></blockquote>
  
  <ul>
*************** Change 30.5.2 [thread.condition.condvara
*** 48590,48596 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class Lock, class Rep, class Period, class Predicate&gt; 
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, Predicate pred);
  </pre>
  <blockquote>
--- 50547,50554 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Lock, class Rep, class Period, class Predicate&gt; 
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, Predicate pred);
  </pre>
  <blockquote>
*************** arguments supplied by all concurrently w
*** 48606,48612 ****
  <p>
  <i>23 Effects:</i>
  </p>
! <blockquote><pre><del>wait_until(lock, chrono::monotonic_clock::now() + rel_time, std::move(pred))</del>
  </pre>
  <ul>
  <li><ins>
--- 50564,50571 ----
  <p>
  <i>23 Effects:</i>
  </p>
! <blockquote><pre>
! <del>wait_until(lock, chrono::monotonic_clock::now() + rel_time, std::move(pred))</del>
  </pre>
  <ul>
  <li><ins>
*************** equivalent error condition from <tt>lock
*** 48682,48691 ****
  
  <hr>
  <h3><a name="860"></a>860. Floating-Point State</h3>
! <p><b>Section:</b> 26 [numerics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-06-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#numerics">issues</a> in [numerics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are a number of functions that affect the floating point state.
--- 50641,50650 ----
  
  <hr>
  <h3><a name="860"></a>860. Floating-Point State</h3>
! <p><b>Section:</b> 26 [numerics] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-06-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numerics">issues</a> in [numerics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are a number of functions that affect the floating point state.
*************** commentary.
*** 48767,48773 ****
  ]</i></p>
  
  
! <blockquote>
  If I understand the history correctly, Nick, as the Posix liaison,
  should probably get a veto on this, since I think it came from Posix (?)
  via WG14 and should probably really be addressed there (?).  But I think
--- 50726,50732 ----
  ]</i></p>
  
  
! <blockquote><p>
  If I understand the history correctly, Nick, as the Posix liaison,
  should probably get a veto on this, since I think it came from Posix (?)
  via WG14 and should probably really be addressed there (?).  But I think
*************** we are basically in agreement that there
*** 48775,48790 ****
  this, and hence we don't have to worry too much about stepping on toes. 
  As far as I can tell, this same issue also exists in the latest Posix
  standard (?).
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  
  
--- 50734,50749 ----
  this, and hence we don't have to worry too much about stepping on toes. 
  As far as I can tell, this same issue also exists in the latest Posix
  standard (?).
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  
  
*************** calling thread.
*** 48810,48830 ****
  
  
  <hr>
! <h3><a name="861"></a>861. Incomplete specification of EqualityComparable for std::forward_list</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-06-24 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 89, Container requirements, defines <tt>operator==</tt> in terms of the container
  member function <tt>size()</tt> and the algorithm <tt>std::equal</tt>:
  </p>
  
! <blockquote>
  <tt>==</tt> is an equivalence relation. <tt>a.size() == b.size() &amp;&amp;
  equal(a.begin(), a.end(), b.begin()</tt>
! </blockquote>
  
  <p>
  The new container <tt>forward_list</tt> does not provide a <tt>size</tt> member function
--- 50769,50790 ----
  
  
  <hr>
! <h3><a name="861"></a>861. Incomplete specification of <tt>EqualityComparable</tt> for <tt>std::forward_list</tt></h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-06-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 89, Container requirements, defines <tt>operator==</tt> in terms of the container
  member function <tt>size()</tt> and the algorithm <tt>std::equal</tt>:
  </p>
  
! <blockquote><p>
  <tt>==</tt> is an equivalence relation. <tt>a.size() == b.size() &amp;&amp;
  equal(a.begin(), a.end(), b.begin()</tt>
! </p></blockquote>
  
  <p>
  The new container <tt>forward_list</tt> does not provide a <tt>size</tt> member function
*************** because of the special design choices of
*** 48841,48847 ****
  I propose to apply one of the following resolutions, which are described as:
  </p>
  
! <ol type="A">
  <li>
  Provide a definition, which is optimal for this special container without
  previous size test. This choice prevents two <tt>O(N)</tt> calls of <tt>std::distance()</tt>
--- 50801,50807 ----
  I propose to apply one of the following resolutions, which are described as:
  </p>
  
! <ol style="list-style-type:upper-alpha">
  <li>
  Provide a definition, which is optimal for this special container without
  previous size test. This choice prevents two <tt>O(N)</tt> calls of <tt>std::distance()</tt>
*************** post San Francisco:
*** 48880,48888 ****
  ]</i></p>
  
  
! <blockquote>
  Martin provided wording for Option C.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
--- 50840,50848 ----
  ]</i></p>
  
  
! <blockquote><p>
  Martin provided wording for Option C.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
*************** Howard: Commented out options A and B.
*** 48911,48931 ****
  ]</i></p>
  
  
! <blockquote>
  Mark NAD Editorial. Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2986.pdf">N2986</a>.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Reopened.
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2986.pdf">N2986</a>
  was rejected in full committee on procedural grounds.
! </blockquote>
  
  <p><i>[
  2010-01-30 Howard updated Table numbers.
--- 50871,50891 ----
  ]</i></p>
  
  
! <blockquote><p>
  Mark NAD Editorial. Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2986.pdf">N2986</a>.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Reopened.
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2986.pdf">N2986</a>
  was rejected in full committee on procedural grounds.
! </p></blockquote>
  
  <p><i>[
  2010-01-30 Howard updated Table numbers.
*************** was rejected in full committee on proced
*** 48937,48945 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready for Pittsburgh.
! </blockquote>
  
  
  
--- 50897,50905 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready for Pittsburgh.
! </p></blockquote>
  
  
  
*************** Option (C):
*** 48957,48972 ****
  In 23.2.1 [container.requirements.general] change Table 90 -- Container requirements as indicated:
  </p>
  
! <ol type="a">
  <li>
  <p>
  Change the text in the Assertion/note column in the row for "<tt>X u</tt>;"
  as follows:
  </p>
  
! <blockquote>
  post: <tt>u.<del>size() == 0</del><ins>empty() == true</ins></tt>
! </blockquote>
  </li>
  
  <li>
--- 50917,50932 ----
  In 23.2.1 [container.requirements.general] change Table 90 -- Container requirements as indicated:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
  Change the text in the Assertion/note column in the row for "<tt>X u</tt>;"
  as follows:
  </p>
  
! <blockquote><p>
  post: <tt>u.<del>size() == 0</del><ins>empty() == true</ins></tt>
! </p></blockquote>
  </li>
  
  <li>
*************** Change the text in the Assertion/note co
*** 48975,48983 ****
  as follows:
  </p>
  
! <blockquote>
  <tt>X().<del>size() == 0</del><ins>empty() == true</ins></tt>
! </blockquote>
  </li>
  
  <li>
--- 50935,50943 ----
  as follows:
  </p>
  
! <blockquote><p>
  <tt>X().<del>size() == 0</del><ins>empty() == true</ins></tt>
! </p></blockquote>
  </li>
  
  <li>
*************** as follows:
*** 48985,48996 ****
  Change the text in the Operational Semantics column in the row for
  "<tt>a == b</tt>" as follows:
  </p>
! <blockquote>
  <tt>==</tt> is an equivalence relation.
  <tt><del>a.size()</del><ins>distance(a.begin(), a.end())</ins> ==
     <del>b.size()</del><ins>distance(b.begin(), b.end())</ins> &amp;&amp;
  equal(a.begin(), a.end(), b.begin())</tt>
! </blockquote>
  </li>
  
  <li>
--- 50945,50956 ----
  Change the text in the Operational Semantics column in the row for
  "<tt>a == b</tt>" as follows:
  </p>
! <blockquote><p>
  <tt>==</tt> is an equivalence relation.
  <tt><del>a.size()</del><ins>distance(a.begin(), a.end())</ins> ==
     <del>b.size()</del><ins>distance(b.begin(), b.end())</ins> &amp;&amp;
  equal(a.begin(), a.end(), b.begin())</tt>
! </p></blockquote>
  </li>
  
  <li>
*************** equal(a.begin(), a.end(), b.begin())</tt
*** 48998,49006 ****
  Add text in the Ass./Note/pre-/post-condition column in the row for
  "<tt>a == b</tt>" as follows:
  </p>
! <blockquote><ins>
  <i>Requires:</i> <tt>T</tt> is <tt>EqualityComparable</tt>
! </ins></blockquote>
  </li>
  
  <li>
--- 50958,50966 ----
  Add text in the Ass./Note/pre-/post-condition column in the row for
  "<tt>a == b</tt>" as follows:
  </p>
! <blockquote><p><ins>
  <i>Requires:</i> <tt>T</tt> is <tt>EqualityComparable</tt>
! </ins></p></blockquote>
  </li>
  
  <li>
*************** Change the text in the Operational Seman
*** 49009,49017 ****
  "<tt>a.size()</tt>" as follows:
  </p>
  
! <blockquote>
  <tt><del>a.end() - a.begin()</del><ins>distance(a.begin(), a.end())</ins></tt>
! </blockquote>
  </li>
  
  <li>
--- 50969,50977 ----
  "<tt>a.size()</tt>" as follows:
  </p>
  
! <blockquote><p>
  <tt><del>a.end() - a.begin()</del><ins>distance(a.begin(), a.end())</ins></tt>
! </p></blockquote>
  </li>
  
  <li>
*************** Change the text in the Operational Seman
*** 49020,49029 ****
  "<tt>a.max_size()</tt>" as follows:
  </p>
  
! <blockquote>
  <tt><del>size()</del><ins>distance(begin(), end())</ins></tt> of the largest
  possible container
! </blockquote>
  </li>
  
  <li>
--- 50980,50989 ----
  "<tt>a.max_size()</tt>" as follows:
  </p>
  
! <blockquote><p>
  <tt><del>size()</del><ins>distance(begin(), end())</ins></tt> of the largest
  possible container
! </p></blockquote>
  </li>
  
  <li>
*************** Change the text in the Operational Seman
*** 49032,49121 ****
  "<tt>a.empty()</tt>" as follows:
  </p>
  
! <blockquote>
  <tt><del>a.size() == 0</del><ins>a.begin() == a.end()</ins></tt>
! </blockquote>
  </li>
  </ol>
  </li>
  
  <li>
  <p>
! In 23.2.1 [container.requirements.general] change Table 93 -- Allocator-aware container requirements as indicated:
  </p>
  
! <ol type="a">
  <li>
  <p>
! Change the text in the Assertion/note column in the row for "<tt>X() /
  X u;</tt>" as follows:
  </p>
  
! <blockquote>
  <i>Requires:</i> <tt>A</tt> is <tt>DefaultConstructible</tt> post: <tt><del>u.size() ==
  0</del><ins>u.empty() == true</ins></tt>, <tt>get_allocator() == A()</tt>
! </blockquote>
  </li>
  
  <li>
  <p>
! Change the text in the Assertion/note column in the row for "<tt>X(m) /
  X u(m);</tt>" as follows:
  </p>
  
! <blockquote>
  post: <tt><del>u.size() == 0</del><ins>u.empty() == true</ins>,
  get_allocator() == m</tt>
! </blockquote>
  </li>
  </ol>
  </li>
  
  <li>
  <p>
! In 23.2.3 [sequence.reqmts] change Table 94 -- Sequence container requirements as indicated:
  </p>
  
! <ol type="a">
  <li>
  <p>
! Change the text in the Assertion/note column in the row for "<tt>X(n,
! t) / X a(n, t)</tt>" as follows:
  </p>
  
! <blockquote>
  post: <tt><del>size()</del><ins>distance(begin(), end())</ins> == n [..]</tt>
! </blockquote>
  </li>
  
  <li>
  <p>
! Change the text in the Assertion/note column in the row for "<tt>X(i,
! j) / X a(i, j)</tt>" as follows:
  </p>
  
! <blockquote>
  [..] post: <del><tt>size() ==</tt> distance between <tt>i</tt> and
  <tt>j</tt></del><ins><tt>distance(begin(), end()) == distance(i, j)</tt></ins> [..]
! </blockquote>
  </li>
  
  <li>
  <p>
! Change the text in the Assertion/note column in the row for
  "<tt>a.clear()</tt>" as follows:
  </p>
! <blockquote>
  <tt><ins>a.</ins>erase(<ins>a.</ins>begin(), <ins>a.</ins>end())</tt> post:
  <tt><del>size() == 0</del><ins>a.empty() == true</ins></tt>
! </blockquote>
  </li>
  </ol>
  </li>
  
  <li>
  <p>
! In 23.2.4 [associative.reqmts] change Table 96 -- Associative container requirements as indicated:
  </p>
  
  <p><i>[
--- 50992,51081 ----
  "<tt>a.empty()</tt>" as follows:
  </p>
  
! <blockquote><p>
  <tt><del>a.size() == 0</del><ins>a.begin() == a.end()</ins></tt>
! </p></blockquote>
  </li>
  </ol>
  </li>
  
  <li>
  <p>
! In 23.2.1 [container.requirements.general] change Table 93 &mdash; Allocator-aware container requirements as indicated:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! Change the text in the Assertion&#47;note column in the row for "<tt>X() &#47;
  X u;</tt>" as follows:
  </p>
  
! <blockquote><p>
  <i>Requires:</i> <tt>A</tt> is <tt>DefaultConstructible</tt> post: <tt><del>u.size() ==
  0</del><ins>u.empty() == true</ins></tt>, <tt>get_allocator() == A()</tt>
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change the text in the Assertion&#47;note column in the row for "<tt>X(m) &#47;
  X u(m);</tt>" as follows:
  </p>
  
! <blockquote><p>
  post: <tt><del>u.size() == 0</del><ins>u.empty() == true</ins>,
  get_allocator() == m</tt>
! </p></blockquote>
  </li>
  </ol>
  </li>
  
  <li>
  <p>
! In 23.2.3 [sequence.reqmts] change Table 94 &mdash; Sequence container requirements as indicated:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! Change the text in the Assertion&#47;note column in the row for "<tt>X(n,
! t) &#47; X a(n, t)</tt>" as follows:
  </p>
  
! <blockquote><p>
  post: <tt><del>size()</del><ins>distance(begin(), end())</ins> == n [..]</tt>
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change the text in the Assertion&#47;note column in the row for "<tt>X(i,
! j) &#47; X a(i, j)</tt>" as follows:
  </p>
  
! <blockquote><p>
  [..] post: <del><tt>size() ==</tt> distance between <tt>i</tt> and
  <tt>j</tt></del><ins><tt>distance(begin(), end()) == distance(i, j)</tt></ins> [..]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change the text in the Assertion&#47;note column in the row for
  "<tt>a.clear()</tt>" as follows:
  </p>
! <blockquote><p>
  <tt><ins>a.</ins>erase(<ins>a.</ins>begin(), <ins>a.</ins>end())</tt> post:
  <tt><del>size() == 0</del><ins>a.empty() == true</ins></tt>
! </p></blockquote>
  </li>
  </ol>
  </li>
  
  <li>
  <p>
! In 23.2.4 [associative.reqmts] change Table 96 &mdash; Associative container requirements as indicated:
  </p>
  
  <p><i>[
*************** for all tables and adds some missing obj
*** 49127,49144 ****
  ]</i></p>
  
  
! <ol type="a">
  
  <li>
  <p>
! Change the text in the Complexity column in the row for <tt>X(i,j,c)/X
! a(i,j,c);</tt> as follows:
  </p>
  
! <blockquote>
  <tt>N</tt> log <tt>N</tt> in general (<tt>N</tt> <ins><tt> == distance(i,
  j)</tt></ins><del>is the distance from <tt>i</tt> to <tt>j</tt></del>); ...
! </blockquote>
  
  </li>
  
--- 51087,51104 ----
  ]</i></p>
  
  
! <ol style="list-style-type:lower-alpha">
  
  <li>
  <p>
! Change the text in the Complexity column in the row for <tt>X(i,j,c)&#47;Xa(i,j,c);</tt> 
! as follows:
  </p>
  
! <blockquote><p>
  <tt>N</tt> log <tt>N</tt> in general (<tt>N</tt> <ins><tt> == distance(i,
  j)</tt></ins><del>is the distance from <tt>i</tt> to <tt>j</tt></del>); ...
! </p></blockquote>
  
  </li>
  
*************** j)</tt></ins><del>is the distance from <
*** 49147,49156 ****
  Change the text in the Complexity column in the row for
  "<tt>a.insert(i, j)</tt>" as follows:
  </p>
! <blockquote>
  <tt>N log(<ins>a.</ins>size() + N)</tt> <del>(<tt>N</tt> is the distance from <tt>i</tt> to
  <tt>j</tt>)</del><ins> where <tt>N == distance(i, j)</tt></ins>
! </blockquote>
  </li>
  
  <li>
--- 51107,51116 ----
  Change the text in the Complexity column in the row for
  "<tt>a.insert(i, j)</tt>" as follows:
  </p>
! <blockquote><p>
  <tt>N log(<ins>a.</ins>size() + N)</tt> <del>(<tt>N</tt> is the distance from <tt>i</tt> to
  <tt>j</tt>)</del><ins> where <tt>N == distance(i, j)</tt></ins>
! </p></blockquote>
  </li>
  
  <li>
*************** Change the text in the Complexity column
*** 49158,49166 ****
  Change the text in the Complexity column in the row for
  "<tt>a.erase(k)</tt>" as follows:
  </p>
! <blockquote>
  <tt>log(<ins>a.</ins>size()) + <ins>a.</ins>count(k)</tt>
! </blockquote>
  </li>
  
  <li>
--- 51118,51126 ----
  Change the text in the Complexity column in the row for
  "<tt>a.erase(k)</tt>" as follows:
  </p>
! <blockquote><p>
  <tt>log(<ins>a.</ins>size()) + <ins>a.</ins>count(k)</tt>
! </p></blockquote>
  </li>
  
  <li>
*************** Change the text in the Complexity column
*** 49169,49191 ****
  "<tt>a.erase(q1, q2)</tt>" as follows:
  </p>
  
! <blockquote>
  <tt>log(<ins>a.</ins>size()) + N</tt> where <tt>N</tt> <del>is the distance from <tt>q1</tt>
  to <tt>q2</tt></del>
     <ins><tt>== distance(q1, q2)</tt></ins>.
! </blockquote>
  </li>
  
  <li>
  <p>
! Change the text in the Assertion/note column in the row for
  "<tt>a.clear()</tt>" as follows:
  </p>
  
! <blockquote>
  <tt><ins>a.</ins>erase(a.begin(),a.end())</tt> post: <tt><del>size() ==
  0</del><ins>a.empty() == true</ins></tt>
! </blockquote>
  </li>
  
  <li>
--- 51129,51151 ----
  "<tt>a.erase(q1, q2)</tt>" as follows:
  </p>
  
! <blockquote><p>
  <tt>log(<ins>a.</ins>size()) + N</tt> where <tt>N</tt> <del>is the distance from <tt>q1</tt>
  to <tt>q2</tt></del>
     <ins><tt>== distance(q1, q2)</tt></ins>.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change the text in the Assertion&#47;note column in the row for
  "<tt>a.clear()</tt>" as follows:
  </p>
  
! <blockquote><p>
  <tt><ins>a.</ins>erase(a.begin(),a.end())</tt> post: <tt><del>size() ==
  0</del><ins>a.empty() == true</ins></tt>
! </p></blockquote>
  </li>
  
  <li>
*************** Change the text in the Complexity column
*** 49194,49202 ****
  as follows:
  </p>
  
! <blockquote>
  linear in <tt><ins>a.</ins>size()</tt>
! </blockquote>
  </li>
  
  <li>
--- 51154,51162 ----
  as follows:
  </p>
  
! <blockquote><p>
  linear in <tt><ins>a.</ins>size()</tt>
! </p></blockquote>
  </li>
  
  <li>
*************** Change the text in the Complexity column
*** 49205,49236 ****
  "<tt>a.count(k)</tt>" as follows:
  </p>
  
! <blockquote>
  <tt>log(<ins>a.</ins>size()) + <ins>a.</ins>count(k)</tt>
! </blockquote>
  </li>
  </ol>
  </li>
  
  <li>
  <p>
! In 23.2.5 [unord.req] change Table 98 -- Unordered associative container requirements as indicated:
  </p>
  <p><i>[
  The same rational as for Table 96 applies here
  ]</i></p>
  
  
! <ol type="a">
  <li>
  <p>
! Change the text in the Assertion/note column in the row for
  "<tt>a.clear()</tt>" as follows:
  </p>
  
! <blockquote>
  [..] Post: <tt>a.<del>size() == 0</del><ins>empty() == true</ins></tt>
! </blockquote>
  </li>
  </ol>
  </li>
--- 51165,51196 ----
  "<tt>a.count(k)</tt>" as follows:
  </p>
  
! <blockquote><p>
  <tt>log(<ins>a.</ins>size()) + <ins>a.</ins>count(k)</tt>
! </p></blockquote>
  </li>
  </ol>
  </li>
  
  <li>
  <p>
! In 23.2.5 [unord.req] change Table 98 &mdash; Unordered associative container requirements as indicated:
  </p>
  <p><i>[
  The same rational as for Table 96 applies here
  ]</i></p>
  
  
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
! Change the text in the Assertion&#47;note column in the row for
  "<tt>a.clear()</tt>" as follows:
  </p>
  
! <blockquote><p>
  [..] Post: <tt>a.<del>size() == 0</del><ins>empty() == true</ins></tt>
! </p></blockquote>
  </li>
  </ol>
  </li>
*************** Change the text in the Assertion/note co
*** 49245,49256 ****
  
  <hr>
  <h3><a name="865"></a>865. More algorithms that throw away information</h3>
! <p><b>Section:</b> 25.3.6 [alg.fill], 25.3.7 [alg.generate] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-07-13 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In regard to library defect <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#488">488</a> I found some more algorithms which
  unnecessarily throw away information. These are typically algorithms,
  which sequentially write into an <tt>OutputIterator</tt>, but do not return the
  final value of this output iterator. These cases are:
--- 51205,51216 ----
  
  <hr>
  <h3><a name="865"></a>865. More algorithms that throw away information</h3>
! <p><b>Section:</b> 25.3.6 [alg.fill], 25.3.7 [alg.generate] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-07-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In regard to library defect <a href="lwg-defects.html#488">488</a> I found some more algorithms which
  unnecessarily throw away information. These are typically algorithms,
  which sequentially write into an <tt>OutputIterator</tt>, but do not return the
  final value of this output iterator. These cases are:
*************** void generate_n(OutputIterator first, Si
*** 49268,49275 ****
  <p>
  In both cases the minimum requirements on the iterator are
  <tt>OutputIterator</tt>, which means according to the requirements of
! 24.2.4 [output.iterators]/2 that only single-pass iterations are guaranteed.
! So, if users of <tt>fill_n</tt> and <tt>generate_n</tt> have *only* an <tt>OutputIterator</tt>
  available, they have no chance to continue pushing further values
  into it, which seems to be a severe limitation to me.
  </p>
--- 51228,51235 ----
  <p>
  In both cases the minimum requirements on the iterator are
  <tt>OutputIterator</tt>, which means according to the requirements of
! 24.2.4 [output.iterators] p. 2 that only single-pass iterations are guaranteed.
! So, if users of <tt>fill_n</tt> and <tt>generate_n</tt> have <em>only</em> an <tt>OutputIterator</tt>
  available, they have no chance to continue pushing further values
  into it, which seems to be a severe limitation to me.
  </p>
*************** Move to Open.
*** 49304,49313 ****
  ]</i></p>
  
  
! <blockquote>
  We have a consensus for moving forward on this issue, but Daniel needs
  to deconceptify it.
! </blockquote>
  
  <p><i>[
  2009-07-25 Daniel provided non-concepts wording.
--- 51264,51273 ----
  ]</i></p>
  
  
! <blockquote><p>
  We have a consensus for moving forward on this issue, but Daniel needs
  to deconceptify it.
! </p></blockquote>
  
  <p><i>[
  2009-07-25 Daniel provided non-concepts wording.
*************** to deconceptify it.
*** 49319,49327 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  
  
--- 51279,51287 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  
  
*************** Replace the current declaration of <tt>f
*** 49334,49340 ****
  <tt>&lt;algorithm&gt;</tt> synopsis and in 25.3.6 [alg.fill] by
  </p>
  
! <blockquote><pre>template&lt;class OutputIterator, class Size, class T&gt;
    <del>void</del><ins>OutputIterator</ins> fill_n(OutputIterator first, Size n, const T&amp; value);
  </pre></blockquote>
  
--- 51294,51301 ----
  <tt>&lt;algorithm&gt;</tt> synopsis and in 25.3.6 [alg.fill] by
  </p>
  
! <blockquote><pre>
! template&lt;class OutputIterator, class Size, class T&gt;
    <del>void</del><ins>OutputIterator</ins> fill_n(OutputIterator first, Size n, const T&amp; value);
  </pre></blockquote>
  
*************** Replace the current declaration of <tt>f
*** 49342,49351 ****
  Just after the effects clause add a new returns clause saying:
  </p>
  
! <blockquote>
  <ins><i>Returns:</i> For <tt>fill_n</tt> and positive <tt>n</tt>, returns <tt>first + n</tt>. Otherwise
  returns <tt>first</tt> for <tt>fill_n</tt>.</ins>
! </blockquote>
  </li>
  
  <li>
--- 51303,51312 ----
  Just after the effects clause add a new returns clause saying:
  </p>
  
! <blockquote><p>
  <ins><i>Returns:</i> For <tt>fill_n</tt> and positive <tt>n</tt>, returns <tt>first + n</tt>. Otherwise
  returns <tt>first</tt> for <tt>fill_n</tt>.</ins>
! </p></blockquote>
  </li>
  
  <li>
*************** Replace the current declaration of <tt>g
*** 49354,49360 ****
  header <tt>&lt;algorithm&gt;</tt> synopsis and in 25.3.7 [alg.generate] by
  </p>
  
! <blockquote><pre>template&lt;class OutputIterator, class Size, class Generator&gt;
    <del>void</del><ins>OutputIterator</ins> generate_n(OutputIterator first, Size n, Generator gen);
  </pre></blockquote>
  
--- 51315,51322 ----
  header <tt>&lt;algorithm&gt;</tt> synopsis and in 25.3.7 [alg.generate] by
  </p>
  
! <blockquote><pre>
! template&lt;class OutputIterator, class Size, class Generator&gt;
    <del>void</del><ins>OutputIterator</ins> generate_n(OutputIterator first, Size n, Generator gen);
  </pre></blockquote>
  
*************** header <tt>&lt;algorithm&gt;</tt> synops
*** 49362,49371 ****
  Just after the effects clause add a new returns clause saying:
  </p>
  
! <blockquote>
  <ins>For <tt>generate_n</tt> and positive <tt>n</tt>, returns <tt>first + n</tt>. Otherwise
  returns <tt>first</tt> for <tt>generate_n</tt>.</ins>
! </blockquote>
  </li>
  </ol>
  
--- 51324,51333 ----
  Just after the effects clause add a new returns clause saying:
  </p>
  
! <blockquote><p>
  <ins>For <tt>generate_n</tt> and positive <tt>n</tt>, returns <tt>first + n</tt>. Otherwise
  returns <tt>first</tt> for <tt>generate_n</tt>.</ins>
! </p></blockquote>
  </li>
  </ol>
  
*************** returns <tt>first</tt> for <tt>generate_
*** 49377,49407 ****
  
  <hr>
  <h3><a name="866"></a>866. Qualification of placement new-expressions</h3>
! <p><b>Section:</b> 20.9.8 [specialized.algorithms], 20.9.10.2.6 [util.smartptr.shared.create] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-07-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#specialized.algorithms">issues</a> in [specialized.algorithms].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#402">402</a> replaced "<tt>new</tt>" with "<tt>::new</tt>" in the placement
! new-expression in 20.9.5.1 [allocator.members]. I believe the rationale
! given in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#402">402</a> applies also to the following other contexts:
  </p>
  <ul>
  <li>
  <p>
! in 20.9.8 [specialized.algorithms], all four algorithms <tt>unitialized_copy</tt>,
  <tt>unitialized_copy_n</tt>, <tt>unitialized_fill</tt> and <tt>unitialized_fill_n</tt> use
  the unqualified placement new-expression in some variation of the form:
  </p>
! <blockquote><pre>new  (static_cast&lt;void*&gt;(&amp;*result)) typename  iterator_traits&lt;ForwardIterator&gt;::value_type(*first);
  </pre></blockquote>
  </li>
  <li>
  <p>
! in 20.9.10.2.6 [util.smartptr.shared.create] there is a reference to the unqualified placement new-expression:
  </p>
! <blockquote><pre>new  (pv)  T(std::forward&lt;Args&gt;(args)...),
  </pre></blockquote>
  </li>
  </ul>
--- 51339,51371 ----
  
  <hr>
  <h3><a name="866"></a>866. Qualification of placement new-expressions</h3>
! <p><b>Section:</b> 20.7.12 [specialized.algorithms], 20.8.2.2.6 [util.smartptr.shared.create] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-07-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#specialized.algorithms">issues</a> in [specialized.algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! LWG issue <a href="lwg-defects.html#402">402</a> replaced "<tt>new</tt>" with "<tt>::new</tt>" in the placement
! new-expression in 20.7.9.1 [allocator.members]. I believe the rationale
! given in <a href="lwg-defects.html#402">402</a> applies also to the following other contexts:
  </p>
  <ul>
  <li>
  <p>
! in 20.7.12 [specialized.algorithms], all four algorithms <tt>unitialized_copy</tt>,
  <tt>unitialized_copy_n</tt>, <tt>unitialized_fill</tt> and <tt>unitialized_fill_n</tt> use
  the unqualified placement new-expression in some variation of the form:
  </p>
! <blockquote><pre>
! new  (static_cast&lt;void*&gt;(&amp;*result)) typename  iterator_traits&lt;ForwardIterator&gt;::value_type(*first);
  </pre></blockquote>
  </li>
  <li>
  <p>
! in 20.8.2.2.6 [util.smartptr.shared.create] there is a reference to the unqualified placement new-expression:
  </p>
! <blockquote><pre>
! new  (pv)  T(std::forward&lt;Args&gt;(args)...),
  </pre></blockquote>
  </li>
  </ul>
*************** San Francisco:
*** 49425,49444 ****
  ]</i></p>
  
  
! <blockquote>
  Detlef: If we move this to Ready, it's likely that we'll forget about
  the side comment about the <tt>HasPlacementNew</tt> concept.
! </blockquote>
  
  <p><i>[
  post San Francisco:
  ]</i></p>
  
  
! <blockquote>
  Daniel:  <tt>HasPlacementNew</tt> has been removed from
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2774.pdf">N2774 (Foundational Concepts)</a>.
! </blockquote>
  
  
  
--- 51389,51408 ----
  ]</i></p>
  
  
! <blockquote><p>
  Detlef: If we move this to Ready, it's likely that we'll forget about
  the side comment about the <tt>HasPlacementNew</tt> concept.
! </p></blockquote>
  
  <p><i>[
  post San Francisco:
  ]</i></p>
  
  
! <blockquote><p>
  Daniel:  <tt>HasPlacementNew</tt> has been removed from
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2774.pdf">N2774 (Foundational Concepts)</a>.
! </p></blockquote>
  
  
  
*************** Replace "<tt>new</tt>" with "<tt>::new</
*** 49448,49463 ****
  </p>
  <ul>
  <li>
! 20.9.8.2 [uninitialized.copy], paragraphs 1 and 3
  </li>
  <li>
! 20.9.8.3 [uninitialized.fill]  paragraph 1
  </li>
  <li>
! 20.9.8.4 [uninitialized.fill.n] paragraph 1
  </li>
  <li>
! 20.9.10.2.6 [util.smartptr.shared.create] once in paragraph 1 and twice in paragraph 2.
  </li>
  </ul>
  
--- 51412,51427 ----
  </p>
  <ul>
  <li>
! 20.7.12.2 [uninitialized.copy], paragraphs 1 and 3
  </li>
  <li>
! 20.7.12.3 [uninitialized.fill]  paragraph 1
  </li>
  <li>
! 20.7.12.4 [uninitialized.fill.n] paragraph 1
  </li>
  <li>
! 20.8.2.2.6 [util.smartptr.shared.create] once in paragraph 1 and twice in paragraph 2.
  </li>
  </ul>
  
*************** Replace "<tt>new</tt>" with "<tt>::new</
*** 49467,49477 ****
  
  
  <hr>
! <h3><a name="868"></a>868. default construction and value-initialization</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-07-22 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The term "default constructed" is often used in wording that predates
--- 51431,51442 ----
  
  
  <hr>
! <h3><a name="868"></a>868. Default construction and value-initialization</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-07-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#containers">active issues</a> in [containers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The term "default constructed" is often used in wording that predates
*************** the introduction of the concept of value
*** 49479,49490 ****
  places the concept of value-initialization is more correct than the
  current wording (for example when the type involved can be a built-in)
  so a replacement is in order. Two of such places are already covered by
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#867">867</a>. This issue deliberately addresses the hopefully
  non-controversial changes in the attempt of being approved more quickly.
  A few other occurrences (for example in <tt>std::tuple</tt>,
  <tt>std::reverse_iterator</tt> and <tt>std::move_iterator</tt>) are left to separate
! issues. For <tt>std::reverse_iterator</tt>, see also issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>. This issue is
! related with issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#724">724</a>.
  </p>
  
  <p><i>[
--- 51444,51455 ----
  places the concept of value-initialization is more correct than the
  current wording (for example when the type involved can be a built-in)
  so a replacement is in order. Two of such places are already covered by
! issue <a href="lwg-closed.html#867">867</a>. This issue deliberately addresses the hopefully
  non-controversial changes in the attempt of being approved more quickly.
  A few other occurrences (for example in <tt>std::tuple</tt>,
  <tt>std::reverse_iterator</tt> and <tt>std::move_iterator</tt>) are left to separate
! issues. For <tt>std::reverse_iterator</tt>, see also issue <a href="lwg-closed.html#408">408</a>. This issue is
! related with issue <a href="lwg-defects.html#724">724</a>.
  </p>
  
  <p><i>[
*************** Dennett will review the library and prov
*** 49499,49505 ****
  double-check the vocabulary.
  </p>
  <p>
! This issue relates to Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#886">886</a> tuple construction
  </p>
  </blockquote>
  
--- 51464,51470 ----
  double-check the vocabulary.
  </p>
  <p>
! This issue relates to Issue <a href="lwg-defects.html#886">886</a> tuple construction
  </p>
  </blockquote>
  
*************** If wording is forthcoming, Howard will m
*** 49525,49531 ****
  
  <blockquote>
  <p>
! Howard:  Moved back to Review.  Note that 20.2.1 [utility.arg.requirements]
  refers to a section that is not in the current working paper, but does refer to
  a section that we expect to reappear after the de-concepts merge.  This was a
  point of confusion we did not recognize when we reviewed this issue in Frankfurt.
--- 51490,51496 ----
  
  <blockquote>
  <p>
! Howard:  Moved back to Review.  Note that 17.6.3.1 [utility.arg.requirements]
  refers to a section that is not in the current working paper, but does refer to
  a section that we expect to reappear after the de-concepts merge.  This was a
  point of confusion we did not recognize when we reviewed this issue in Frankfurt.
*************** of this nature and purposefully <em>not<
*** 49537,49552 ****
  
  <blockquote>
  <p>
! Places where changes are <u>not</u> being
  proposed
  </p>
  <p>
  In the following paragraphs, we are not proposing changes because
  it's not clear whether we actually prefer value-initialization over
! default-initialization (now partially covered by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1012">1012</a>):
  </p>
  <ul>
!     <li><p>20.9.9.2.1 [unique.ptr.single.ctor] para 3 e 7</p></li>
      <li><p>24.5.1.3.1 [reverse.iter.cons] para 1</p></li>
      <li><p>24.5.3.3.1 [move.iter.op.const] para 1</p></li>
  </ul>
--- 51502,51517 ----
  
  <blockquote>
  <p>
! Places where changes are <span style="text-decoration:underline">not</span> being
  proposed
  </p>
  <p>
  In the following paragraphs, we are not proposing changes because
  it's not clear whether we actually prefer value-initialization over
! default-initialization (now partially covered by <a href="lwg-defects.html#1012">1012</a>):
  </p>
  <ul>
!     <li><p>20.8.1.2.1 [unique.ptr.single.ctor] para 3 e 7</p></li>
      <li><p>24.5.1.3.1 [reverse.iter.cons] para 1</p></li>
      <li><p>24.5.3.3.1 [move.iter.op.const] para 1</p></li>
  </ul>
*************** of
*** 49582,49597 ****
  <ol>
  <li>
  <p>
! 21.4.1 [string.require]/2:
  </p>
  
! <blockquote>
! "[..] The <tt>Allocator</tt> object used shall be a copy of the <tt>Allocator&gt;</tt>
  object passed to the <tt>basic_string</tt> object's
  constructor or, if the constructor does not take an <tt>Allocator</tt>
  argument, a copy of a default-constructed
  <tt>Allocator</tt> object."
! </blockquote>
  </li>
  
  <li>
--- 51547,51562 ----
  <ol>
  <li>
  <p>
! 21.4.1 [string.require] p. 2:
  </p>
  
! <blockquote><p>
! "[..] The <tt>Allocator</tt> object used shall be a copy of the <tt>Allocator></tt>
  object passed to the <tt>basic_string</tt> object's
  constructor or, if the constructor does not take an <tt>Allocator</tt>
  argument, a copy of a default-constructed
  <tt>Allocator</tt> object."
! </p></blockquote>
  </li>
  
  <li>
*************** argument, a copy of a default-constructe
*** 49599,49611 ****
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>,
  26.5.1.4 [rand.req.eng], Table 109, expression "<tt>T()</tt>":
  </p>
! <blockquote>
! Pre-/post-condition: "Creates an engine with the same initial state as
  all other default-constructed engines of type <tt>X</tt>."
! </blockquote>
  
  <p>
! as well as in 26.5.5 [rand.predef]/1-9 (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>), 26.5.7.1 [rand.util.seedseq]/3, 27.7.1.1.1 [istream.cons]/3, 27.7.2.2 [ostream.cons]/9 (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>), 28.13 [re.grammar]/2, 30.3.1.4 [thread.thread.assign]/1 (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>),
  </p>
  <p><i>[
  Candidates for the "the expression "default constructed" need not be
--- 51564,51580 ----
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>,
  26.5.1.4 [rand.req.eng], Table 109, expression "<tt>T()</tt>":
  </p>
! <blockquote><p>
! Pre-&#47;post-condition: "Creates an engine with the same initial state as
  all other default-constructed engines of type <tt>X</tt>."
! </p></blockquote>
  
  <p>
! as well as in 26.5.5 [rand.predef]/1-9 (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>), 
! 26.5.7.1 [rand.util.seedseq]/3, 27.7.2.1.1 [istream.cons]/3, 
! 27.7.3.2 [ostream.cons]/9 (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>), 
! 28.13 [re.grammar]/2, 30.3.1.4 [thread.thread.assign]/1 
! (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>),
  </p>
  <p><i>[
  Candidates for the "the expression "default constructed" need not be
*************** this component does no longer exist.
*** 49632,49639 ****
  <li>
  <p>
  I also suggest to add a short comment that all paragraphs in the
! resolution whether they refer to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a> or to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a> numbering, because e.g. "Change 23.3.2.1 [deque.cons] para 5" is an <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a> coordinate, while "Change 23.3.2.2 [deque.capacity] para 1" is an <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a> coordinate. Even better would be to use one default document
! for the numbering (probably <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>) and mention special cases (e.g. "Change 20.2.1 [utility.arg.requirements] para 2" as referring to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a> numbering).
  </p>
  </li>
  </ol>
--- 51601,51620 ----
  <li>
  <p>
  I also suggest to add a short comment that all paragraphs in the
! resolution whether they refer to <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf"
! >N2723</a> or to <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf"
! >N2914</a> numbering, because e.g. "Change 23.3.3.2 [deque.cons] para 5" is an <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf"
! >N2723</a> coordinate, while "Change 23.3.3.3 [deque.capacity] para 1" is an <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf"
! >N2914</a> coordinate. Even better would be to use one default document
! for the numbering (probably <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf"
! >N2914</a>) and mention special cases (e.g. "Change 17.6.3.1 [utility.arg.requirements] para 2" as referring to <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf"
! >N2723</a> numbering).
  </p>
  </li>
  </ol>
*************** confusing enough without supporting furt
*** 49672,49689 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
! Moved to review in order to enable conflict resolution with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#704">704</a>.
! </blockquote>
  
  <p><i>[
  2010-03-26 Daniel harmonized the wording with the upcoming FCD.
--- 51653,51670 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
! Moved to review in order to enable conflict resolution with <a href="lwg-defects.html#704">704</a>.
! </p></blockquote>
  
  <p><i>[
  2010-03-26 Daniel harmonized the wording with the upcoming FCD.
*************** Moved to review in order to enable confl
*** 49696,49704 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 51677,51685 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 49709,49812 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.2.1 [utility.arg.requirements] para 2:
  </p>
  
! <blockquote>
  2 In general, a default constructor is
  not required. Certain container class member function signatures
! specify <del>the default constructor</del><ins>T()</ins>
! as a default argument. T() shall be a well-defined expression (8.5)
  if one of those signatures is called using the default argument
  (8.3.6).
! </blockquote>
  
  <p>
! Change 23.3.2.1 [deque.cons] para 3:
  </p>
  
! <blockquote>
! 3 <i>Effects:</i> Constructs a deque with n
  <del>default constructed</del><ins>value-initialized</ins>
  elements. 
! </blockquote>
  
  <p>
! Change 23.3.2.2 [deque.capacity] para 1:
  </p>
  
! <blockquote>
! 1 <i>Effects:</i> If sz &lt; size(), equivalent
! to erase(begin() + sz, end());. If size() &lt; sz, appends sz -
! size() <del>default
! constructed</del><ins>value-initialized</ins>
  elements to the sequence.
! </blockquote>
  
  <p>
! Change 23.3.3.1 [forwardlist.cons] para 3:
  </p>
  
! <blockquote>
! 3 <i>Effects:</i> Constructs a forward_list object with n <del>default
! constructed</del><ins>value-initialized</ins>
! elements.
! </blockquote>
  
  <p>
! Change 23.3.3.4 [forwardlist.modifiers] para 22:
  </p>
  
! <blockquote>
  22 <i>Effects:</i> [...] For the first signature
  the inserted elements are <del>default
  constructed</del><ins>value-initialized</ins>,
! and for the second signature they are copies of c.
! </blockquote>
  
  <p>
! Change 23.3.4.1 [list.cons] para 3:
  </p>
  
! <blockquote>
! 3 <i>Effects:</i> Constructs a list with n <del>default
  constructed</del><ins>value-initialized</ins>
  elements. 
! </blockquote>
  
  <p>
! Change 23.3.4.2 [list.capacity] para 1:
  </p>
  
! <blockquote>
! 1 <i>Effects:</i> If sz &lt; size(), equivalent
! to list&lt;T&gt;::iterator it = begin(); advance(it, sz); erase(it,
! end());. If size() &lt; sz, appends sz - size() <del>default
! constructed</del><ins>value-initialized</ins>
! elements to the sequence.
! </blockquote>
  
  <p>
! Change 23.4.1.1 [vector.cons] para 3:
  </p>
  
! <blockquote>
! 3 <i>Effects:</i> Constructs a vector with n
  <del>default constructed</del><ins>value-initialized</ins>
  elements. 
! </blockquote>
  
  <p>
! Change 23.4.1.2 [vector.capacity] para 9:
  </p>
  
! <blockquote>
! 9 <i>Effects:</i> If sz &lt; size(), equivalent
! to erase(begin() + sz, end());. If size() &lt; sz, appends sz -
! size() <del>default
! constructed</del><ins>value-initialized</ins>
  elements to the sequence.
! </blockquote>
  
  
  
--- 51690,51790 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 17.6.3.1 [utility.arg.requirements] para 2:
  </p>
  
! <blockquote><p>
  2 In general, a default constructor is
  not required. Certain container class member function signatures
! specify <del>the default constructor</del><ins><tt>T()</tt></ins>
! as a default argument. <tt>T()</tt> shall be a well-defined expression (8.5)
  if one of those signatures is called using the default argument
  (8.3.6).
! </p></blockquote>
  
  <p>
! Change 23.3.3.2 [deque.cons] para 3:
  </p>
  
! <blockquote><p>
! 3 <i>Effects:</i> Constructs a deque with <tt>n</tt>
  <del>default constructed</del><ins>value-initialized</ins>
  elements. 
! </p></blockquote>
  
  <p>
! Change 23.3.3.3 [deque.capacity] para 1:
  </p>
  
! <blockquote><p>
! 1 <i>Effects:</i> If <tt>sz &lt; size()</tt>, equivalent
! to <tt>erase(begin() + sz, end());</tt>. If <tt>size() &lt; sz</tt>, 
! appends <tt>sz - size()</tt> <del>default constructed</del><ins>value-initialized</ins>
  elements to the sequence.
! </p></blockquote>
  
  <p>
! Change 23.3.4.2 [forwardlist.cons] para 3:
  </p>
  
! <blockquote><p>
! 3 <i>Effects:</i> Constructs a <tt>forward_list</tt> object with <tt>n</tt> 
! <del>default constructed</del><ins>value-initialized</ins> elements.
! </p></blockquote>
  
  <p>
! Change 23.3.4.5 [forwardlist.modifiers] para 22:
  </p>
  
! <blockquote><p>
  22 <i>Effects:</i> [...] For the first signature
  the inserted elements are <del>default
  constructed</del><ins>value-initialized</ins>,
! and for the second signature they are copies of <tt>c</tt>.
! </p></blockquote>
  
  <p>
! Change 23.3.5.2 [list.cons] para 3:
  </p>
  
! <blockquote><p>
! 3 <i>Effects:</i> Constructs a <tt>list</tt> with <tt>n</tt> <del>default
  constructed</del><ins>value-initialized</ins>
  elements. 
! </p></blockquote>
  
  <p>
! Change 23.3.5.3 [list.capacity] para 1:
  </p>
  
! <blockquote><p>
! 1 <i>Effects:</i> If <tt>sz &lt; size()</tt>, equivalent
! to <tt>list&lt;T&gt;::iterator it = begin(); advance(it, sz); erase(it,
! end());</tt>. If <tt>size() &lt; sz</tt>, <tt>appends sz - size()</tt> 
! <del>default constructed</del><ins>value-initialized</ins> elements to 
! the sequence.
! </p></blockquote>
  
  <p>
! Change 23.3.6.2 [vector.cons] para 3:
  </p>
  
! <blockquote><p>
! 3 <i>Effects:</i> Constructs a <tt>vector</tt> with <tt>n</tt>
  <del>default constructed</del><ins>value-initialized</ins>
  elements. 
! </p></blockquote>
  
  <p>
! Change 23.3.6.3 [vector.capacity] para 9:
  </p>
  
! <blockquote><p>
! 9 <i>Effects:</i> If <tt>sz &lt; size()</tt>, equivalent
! to <tt>erase(begin() + sz, end());</tt>. If <tt>size() &lt; sz</tt>, appends 
! <tt>sz - size()</tt> <del>default constructed</del><ins>value-initialized</ins>
  elements to the sequence.
! </p></blockquote>
  
  
  
*************** elements to the sequence.
*** 49815,49831 ****
  
  <hr>
  <h3><a name="869"></a>869. Bucket (local) iterators and iterating past end</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Sohail Somani <b>Opened:</b> 2008-07-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Is there any language in the current draft specifying the behaviour of the following snippet?
  </p>
  
! <blockquote><pre>unordered_set&lt;int&gt; s;
  unordered_set&lt;int&gt;::local_iterator it = s.end(0);
  
  // Iterate past end - the unspecified part
--- 51793,51810 ----
  
  <hr>
  <h3><a name="869"></a>869. Bucket (local) iterators and iterating past end</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Sohail Somani <b>Opened:</b> 2008-07-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Is there any language in the current draft specifying the behaviour of the following snippet?
  </p>
  
! <blockquote><pre>
! unordered_set&lt;int&gt; s;
  unordered_set&lt;int&gt;::local_iterator it = s.end(0);
  
  // Iterate past end - the unspecified part
*************** San Francisco:
*** 49842,49860 ****
  ]</i></p>
  
  
! <blockquote>
  We believe that this is not a substantive change, but the proposed
  change to the wording is clearer than what we have now.
! </blockquote>
  
  <p><i>[
  Post Summit:
  ]</i></p>
  
  
! <blockquote>
  Recommend Tentatively Ready.
! </blockquote>
  
  
  
--- 51821,51839 ----
  ]</i></p>
  
  
! <blockquote><p>
  We believe that this is not a substantive change, but the proposed
  change to the wording is clearer than what we have now.
! </p></blockquote>
  
  <p><i>[
  Post Summit:
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Tentatively Ready.
! </p></blockquote>
  
  
  
*************** Change Table 97 "Unordered associative c
*** 49866,49877 ****
  <blockquote>
  <table border="1">
  <caption>Table 97: Unordered associative container requirements</caption>
! <tbody><tr>
! <th>expression</th><th>return type</th><th>assertion/note pre/post-condition</th><th>complexity</th>
  </tr>
  <tr>
  <td><tt>b.begin(n)</tt></td>
! <td><tt>local_iterator</tt><br><tt>const_local_iterator</tt> for const <tt>b</tt>.</td>
  <td>Pre: n shall be in the range [0,b.bucket_count()). <del>Note: [b.begin(n), b.end(n)) is a
  valid range containing all of the elements in the n<sup>th</sup> bucket.</del>
  <ins><tt>b.begin(n)</tt> returns an iterator referring to the first element in the bucket.
--- 51845,51856 ----
  <blockquote>
  <table border="1">
  <caption>Table 97: Unordered associative container requirements</caption>
! <tr>
! <th>expression</th><th>return type</th><th>assertion&#47;note pre&#47;post-condition</th><th>complexity</th>
  </tr>
  <tr>
  <td><tt>b.begin(n)</tt></td>
! <td><tt>local_iterator</tt><br/><tt>const_local_iterator</tt> for const <tt>b</tt>.</td>
  <td>Pre: n shall be in the range [0,b.bucket_count()). <del>Note: [b.begin(n), b.end(n)) is a
  valid range containing all of the elements in the n<sup>th</sup> bucket.</del>
  <ins><tt>b.begin(n)</tt> returns an iterator referring to the first element in the bucket.
*************** If the bucket is empty, then <tt>b.begin
*** 49880,49891 ****
  </tr>
  <tr>
  <td><tt>b.end(n)</tt></td>
! <td><tt>local_iterator</tt><br><tt>const_local_iterator</tt> for const <tt>b</tt>.</td>
  <td>Pre: n shall be in the range <tt>[0, b.bucket_count())</tt>.
  <ins><tt>b.end(n)</tt> returns an iterator which is the past-the-end value for the bucket.</ins></td>
  <td>Constant</td>
  </tr>
! </tbody></table>
  </blockquote>
  
  
--- 51859,51870 ----
  </tr>
  <tr>
  <td><tt>b.end(n)</tt></td>
! <td><tt>local_iterator</tt><br/><tt>const_local_iterator</tt> for const <tt>b</tt>.</td>
  <td>Pre: n shall be in the range <tt>[0, b.bucket_count())</tt>.
  <ins><tt>b.end(n)</tt> returns an iterator which is the past-the-end value for the bucket.</ins></td>
  <td>Constant</td>
  </tr>
! </table>
  </blockquote>
  
  
*************** If the bucket is empty, then <tt>b.begin
*** 49894,49928 ****
  
  
  <hr>
! <h3><a name="870"></a>870. Do unordered containers not support function pointers for predicate/hasher?</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-08-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Good ol' associative containers allow both function pointers and
! function objects as feasible
! comparators, as described in 23.2.4 [associative.reqmts]/2:
  </p>
  
! <blockquote>
  Each associative container is parameterized on <tt>Key</tt> and an ordering
! relation <tt>Compare</tt> that
! induces a strict weak ordering (25.3) on elements of Key. [..]. The
! object of type <tt>Compare</tt> is
! called the comparison object of a container. This comparison object
! may be a pointer to
  function or an object of a type with an appropriate function call operator.[..]
! </blockquote>
  
  <p>
  The corresponding wording for unordered containers is not so clear,
! but I read it to disallow
! function pointers for the hasher and I miss a clear statement for the
! equality predicate, see
! 23.2.5 [unord.req]/3+4+5:
  </p>
  
  <blockquote>
--- 51873,51904 ----
  
  
  <hr>
! <h3><a name="870"></a>870. Do unordered containers not support function pointers for predicate&#47;hasher?</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-08-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Good ol' associative containers allow both function pointers and
! function objects as feasible comparators, as described in 
! 23.2.4 [associative.reqmts]&#47;2:
  </p>
  
! <blockquote><p>
  Each associative container is parameterized on <tt>Key</tt> and an ordering
! relation <tt>Compare</tt> that induces a strict weak ordering (25.3) on 
! elements of Key. [..]. The object of type <tt>Compare</tt> is called the 
! comparison object of a container. This comparison object may be a pointer to
  function or an object of a type with an appropriate function call operator.[..]
! </p></blockquote>
  
  <p>
  The corresponding wording for unordered containers is not so clear,
! but I read it to disallow function pointers for the hasher and I miss 
! a clear statement for the equality predicate, see
! 23.2.5 [unord.req]&#47;3+4+5:
  </p>
  
  <blockquote>
*************** equivalence relation on values of type <
*** 49935,49962 ****
  </p>
  <p>
  A hash function is a function object that takes a single argument of
! type <tt>Key</tt> and returns a
! value of type <tt>std::size_t</tt>.
  </p>
  <p>
! Two values <tt>k1</tt> and <tt>k2</tt> of type <tt>Key</tt> are considered equal if the
! container's equality function object
! returns <tt>true</tt> when passed those values.[..]
  </p>
  </blockquote>
  
  <p>
  and table 97 says in the column "assertion...post-condition" for the
! expression X::hasher:
  </p>
  
! <blockquote>
  <tt>Hash</tt> shall be a unary function object type such that the expression
  <tt>hf(k)</tt> has type <tt>std::size_t</tt>.
! </blockquote>
  
  <p>
! Note that 20.8 [function.objects]/1 defines as "Function objects are
  objects with an <tt>operator()</tt> defined.[..]"
  </p>
  <p>
--- 51911,51937 ----
  </p>
  <p>
  A hash function is a function object that takes a single argument of
! type <tt>Key</tt> and returns a value of type <tt>std::size_t</tt>.
  </p>
  <p>
! Two values <tt>k1</tt> and <tt>k2</tt> of type <tt>Key</tt> are considered 
! equal if the container's equality function object returns <tt>true</tt> 
! when passed those values.[..]
  </p>
  </blockquote>
  
  <p>
  and table 97 says in the column "assertion...post-condition" for the
! expression <tt>X::hasher</tt>:
  </p>
  
! <blockquote><p>
  <tt>Hash</tt> shall be a unary function object type such that the expression
  <tt>hf(k)</tt> has type <tt>std::size_t</tt>.
! </p></blockquote>
  
  <p>
! Note that 20.9 [function.objects]&#47;1 defines as "Function objects are
  objects with an <tt>operator()</tt> defined.[..]"
  </p>
  <p>
*************** the following
*** 49975,49989 ****
  ]</i></p>
  
  
! <blockquote>
  Ask Daniel to provide proposed wording that: makes it explicit that
! function pointers are function objects at the beginning of 20.8 [function.objects]; fixes the "requirements" for typedefs in
! 20.8.4 [refwrap] to instead state that the function objects
  defined in that clause have these typedefs, but not that these typedefs
  are requirements on function objects; remove the wording that explicitly
  calls out that associative container comparators may be function
  pointers.
! </blockquote>
  
  <p><i>[
  2009-12-19 Daniel updates wording and rationale.
--- 51950,51965 ----
  ]</i></p>
  
  
! <blockquote><p>
  Ask Daniel to provide proposed wording that: makes it explicit that
! function pointers are function objects at the beginning of 
! 20.9 [function.objects]; fixes the "requirements" for typedefs in
! 20.9.4 [refwrap] to instead state that the function objects
  defined in that clause have these typedefs, but not that these typedefs
  are requirements on function objects; remove the wording that explicitly
  calls out that associative container comparators may be function
  pointers.
! </p></blockquote>
  
  <p><i>[
  2009-12-19 Daniel updates wording and rationale.
*************** pointers.
*** 50001,50014 ****
  
  <p>
  The below provided wording also affects some part of the library which is
! involved with <em>callable types</em> (20.8.1 [func.def]/3). Reason for
  this is that <em>callable objects</em> do have a lot in common with <em>function
  objects</em>. A simple formula seems to be:
  </p>
  
! <blockquote>
  callable objects = function objects + pointers to member
! </blockquote>
  
  <p>
  The latter group is excluded from function objects because of the
--- 51977,51990 ----
  
  <p>
  The below provided wording also affects some part of the library which is
! involved with <em>callable types</em> (20.9.1 [func.def]&#47;3). Reason for
  this is that <em>callable objects</em> do have a lot in common with <em>function
  objects</em>. A simple formula seems to be:
  </p>
  
! <blockquote><p>
  callable objects = function objects + pointers to member
! </p></blockquote>
  
  <p>
  The latter group is excluded from function objects because of the
*************** between the above subset of callable obj
*** 50023,50037 ****
  be unintended: Backed by the Santa Cruz outcome function objects should include
  both function pointers and "object[s] with an operator() defined". This clearly
  excludes class types with a conversion function to a function pointer or all
! similar conversion function situations described in 13.3 [over.match]/2
  b. 2. In contrast to this, the wording for callable types seems to be less
! constrained (20.8.1 [func.def]/3):
  </p>
  
! <blockquote>
  A callable type is a [..] class type whose objects can appear immediately to the
  left of a function call operator.
! </blockquote>
  
  <p>
  The rationale given in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1673.html#fn2">N1673</a>
--- 51999,52013 ----
  be unintended: Backed by the Santa Cruz outcome function objects should include
  both function pointers and "object[s] with an operator() defined". This clearly
  excludes class types with a conversion function to a function pointer or all
! similar conversion function situations described in 13.3 [over.match]&#47;2
  b. 2. In contrast to this, the wording for callable types seems to be less
! constrained (20.9.1 [func.def]/3):
  </p>
  
! <blockquote><p>
  A callable type is a [..] class type whose objects can appear immediately to the
  left of a function call operator.
! </p></blockquote>
  
  <p>
  The rationale given in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1673.html#fn2">N1673</a>
*************** functions as well. To me the current wor
*** 50041,50057 ****
  either way and I suggest to make the intention more explicit by replacing
  </p>
  
! <blockquote>
  [..] class type whose objects can appear immediately to the left of a function
  call operator
! </blockquote>
! 
  by
! 
! <blockquote>
  [..] class type whose objects can appear as the leftmost subexpression of a
  function call expression 5.2.2 [expr.call].
! </blockquote>
  
  <p>
  and to use the same definition for the class type part of <em>function
--- 52017,52033 ----
  either way and I suggest to make the intention more explicit by replacing
  </p>
  
! <blockquote><p>
  [..] class type whose objects can appear immediately to the left of a function
  call operator
! </p></blockquote>
! <p>
  by
! </p>
! <blockquote><p>
  [..] class type whose objects can appear as the leftmost subexpression of a
  function call expression 5.2.2 [expr.call].
! </p></blockquote>
  
  <p>
  and to use the same definition for the class type part of <em>function
*************** conversion function to e.g. pointer to f
*** 50062,50082 ****
  <p>
  Now this last term "function objects" itself brings us to a third unsatisfactory
  state: The term is used both for objects (e.g. "Function objects are
! objects[..]" in 20.8 [function.objects]/1) and for types (e.g. "Each
  unordered associative container is parameterized [..] by a function object Hash
! that acts as a hash function [..]" in 23.2.5 [unord.req]/3). This
  impreciseness should be fixed and I suggest to introduce the term <em>function
  object type</em> as the counter part to <em>callable type</em>. This word seems
  to be a quite natural choice, because the library already uses it here and there
  (e.g. "Hash shall be a unary function object type such that the expression
  <tt>hf(k)</tt> has type <tt>std::size_t</tt>." in Table 98, "<tt>X::hasher</tt>"
! or "Requires: <tt>T</tt> shall be a function object type [..]" in 20.8.14.2.5 [func.wrap.func.targ]/3).
  </p>
  
  <p>
  Finally I would like to add that part of the issue 870 discussion related to the
! requirements for typedefs in 20.8.4 [refwrap] during the Santa Cruz
! meeting is now handled by the new issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1290">1290</a>.
  </p>
  
  <p>
--- 52038,52059 ----
  <p>
  Now this last term "function objects" itself brings us to a third unsatisfactory
  state: The term is used both for objects (e.g. "Function objects are
! objects[..]" in 20.9 [function.objects]&#47;1) and for types (e.g. "Each
  unordered associative container is parameterized [..] by a function object Hash
! that acts as a hash function [..]" in 23.2.5 [unord.req]&#47;3). This
  impreciseness should be fixed and I suggest to introduce the term <em>function
  object type</em> as the counter part to <em>callable type</em>. This word seems
  to be a quite natural choice, because the library already uses it here and there
  (e.g. "Hash shall be a unary function object type such that the expression
  <tt>hf(k)</tt> has type <tt>std::size_t</tt>." in Table 98, "<tt>X::hasher</tt>"
! or "Requires: <tt>T</tt> shall be a function object type [..]" in 
! 20.9.12.2.5 [func.wrap.func.targ]&#47;3).
  </p>
  
  <p>
  Finally I would like to add that part of the issue 870 discussion related to the
! requirements for typedefs in 20.9.4 [refwrap] during the Santa Cruz
! meeting is now handled by the new issue <a href="lwg-defects.html#1290">1290</a>.
  </p>
  
  <p>
*************** San Francisco:
*** 50089,50098 ****
  ]</i></p>
  
  
! <blockquote>
  This is fixed by
! <a href="" ref="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2776.pdf">N2776</a>.
! </blockquote>
  
  </blockquote>
  
--- 52066,52075 ----
  ]</i></p>
  
  
! <blockquote><p>
  This is fixed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2776.pdf">N2776</a>.
! </p></blockquote>
  
  </blockquote>
  
*************** This is fixed by
*** 50104,50210 ****
  
  <li>
  <p>
! Change 20.8 [function.objects]/1 as indicated:
  </p>
  
  <blockquote>
  <p>
  1 <del>Function objects are objects with an <tt>operator()</tt>
  defined.</del> <ins>An object type (3.9 [basic.types]) that can be the
! type of the <em>postfix-expression</em> in a function call (5.2.2 [expr.call], 13.3.1.1 [over.match.call]) is called a <em>function
  object type</em><sup>*</sup>. A <em>function object</em> is an object of a
  <em>function object type</em>.</ins> In the places where one would expect to
! pass a pointer to a function to an algorithmic template (Clause 25 [algorithms]), the interface is specified to accept <del>an object with
  an <tt>operator()</tt> defined</del><ins>a function object</ins>. This not only
  makes algorithmic templates work with pointers to functions, but also enables
  them to work with arbitrary function objects.
  </p>
! <blockquote><ins>
  * Such a type is either a function pointer or a class type which often has a
  member <tt>operator()</tt>, but in some cases it can omit that member and
  provide a conversion to a pointer to function.
! </ins></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.1 [func.def]/3 as indicated: <i>[The intent is to make the
  commonality of callable types and function object
  types more explicit and to get rid of wording redundancies]</i>
  </p>
  
! <blockquote>
  3 A <i>callable type</i> is <del>a pointer to function,</del> a pointer to
  member <del>function, a pointer to member data,</del> or a <del>class type whose
  objects can appear immediately to the left of a function call operator</del>
! <ins><em>function object type</em> (20.8 [function.objects])</ins>.
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.10 [bind]/1 as indicated:
  </p>
  
! <blockquote>
  1 The function template <tt>bind</tt> returns an object that binds a
  <del>function</del> <ins>callable</ins> object passed as an argument to
  additional arguments.
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.10.1 [func.bind]/1 as indicated:
  </p>
  
! <blockquote>
  1 This subclause describes a uniform mechanism for binding arguments of
  <del>function</del> <ins>callable</ins> objects.
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.14 [func.wrap]/1 as indicated:
  </p>
  
! <blockquote>
  1 This subclause describes a polymorphic wrapper class that encapsulates
  arbitrary <del>function</del> <ins>callable</ins> objects.
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.14.2 [func.wrap.func]/2 as indicated <i>[The reason for this
! change is that 20.8.14.2 [func.wrap.func]/1 clearly says that all callable
  types may be wrapped by <tt>std::function</tt> and current implementations
  indeed do provide support for pointer to members as well. One further suggested
  improvement is to set the below definition of Callable in italics]</i>:
  </p>
  
! <blockquote>
  2 A <del>function</del><ins>callable</ins> object <tt>f</tt> of type <tt>F</tt>
  is <del>Callable</del> <ins><em>Callable</em></ins> for argument types
  <del><tt>T1, T2, ..., TN</tt> in</del> <tt>ArgTypes</tt> and <del>a</del> return
  type <tt>R</tt><del>,</del> if<del>, given lvalues <tt>t1, t2, ..., tN</tt> of
  types <tt>T1, T2, ..., TN</tt>, respectively,</del> <ins>the expression</ins>
  <tt><i>INVOKE</i>(f, <ins>declval&lt;ArgTypes&gt;()..., R</ins><del>t1, t2, ...,
! tN</del>)</tt><ins>, considered as an unevaluated operand (5 [expr]),</ins> is well formed (20.7.2)<del> and, if <tt>R</tt> is not
! <tt>void</tt>, convertible to <tt>R</tt></del>.
! </blockquote>
  </li>
  
  
  
  <li>
  <p>
! Change 20.8.14.2.1 [func.wrap.func.con]/7 as indicated:
  </p>
  
! <blockquote><pre>function(const function&amp; f);
  template &lt;class A&gt; function(allocator_arg_t, const A&amp; a, const function&amp; f);
  </pre>
  <blockquote>
--- 52081,52191 ----
  
  <li>
  <p>
! Change 20.9 [function.objects]&#47;1 as indicated:
  </p>
  
  <blockquote>
  <p>
  1 <del>Function objects are objects with an <tt>operator()</tt>
  defined.</del> <ins>An object type (3.9 [basic.types]) that can be the
! type of the <em>postfix-expression</em> in a function call (5.2.2 [expr.call], 
! 13.3.1.1 [over.match.call]) is called a <em>function
  object type</em><sup>*</sup>. A <em>function object</em> is an object of a
  <em>function object type</em>.</ins> In the places where one would expect to
! pass a pointer to a function to an algorithmic template (Clause 25 [algorithms]), 
! the interface is specified to accept <del>an object with
  an <tt>operator()</tt> defined</del><ins>a function object</ins>. This not only
  makes algorithmic templates work with pointers to functions, but also enables
  them to work with arbitrary function objects.
  </p>
! <blockquote><p><ins>
  * Such a type is either a function pointer or a class type which often has a
  member <tt>operator()</tt>, but in some cases it can omit that member and
  provide a conversion to a pointer to function.
! </ins></p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.1 [func.def]&#47;3 as indicated: <i>[The intent is to make the
  commonality of callable types and function object
  types more explicit and to get rid of wording redundancies]</i>
  </p>
  
! <blockquote><p>
  3 A <i>callable type</i> is <del>a pointer to function,</del> a pointer to
  member <del>function, a pointer to member data,</del> or a <del>class type whose
  objects can appear immediately to the left of a function call operator</del>
! <ins><em>function object type</em> (20.9 [function.objects])</ins>.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change  [bind]&#47;1 as indicated:
  </p>
  
! <blockquote><p>
  1 The function template <tt>bind</tt> returns an object that binds a
  <del>function</del> <ins>callable</ins> object passed as an argument to
  additional arguments.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.10 [func.bind]&#47;1 as indicated:
  </p>
  
! <blockquote><p>
  1 This subclause describes a uniform mechanism for binding arguments of
  <del>function</del> <ins>callable</ins> objects.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.12 [func.wrap]&#47;1 as indicated:
  </p>
  
! <blockquote><p>
  1 This subclause describes a polymorphic wrapper class that encapsulates
  arbitrary <del>function</del> <ins>callable</ins> objects.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.12.2 [func.wrap.func]&#47;2 as indicated <i>[The reason for this
! change is that 20.9.12.2 [func.wrap.func]&#47;1 clearly says that all callable
  types may be wrapped by <tt>std::function</tt> and current implementations
  indeed do provide support for pointer to members as well. One further suggested
  improvement is to set the below definition of Callable in italics]</i>:
  </p>
  
! <blockquote><p>
  2 A <del>function</del><ins>callable</ins> object <tt>f</tt> of type <tt>F</tt>
  is <del>Callable</del> <ins><em>Callable</em></ins> for argument types
  <del><tt>T1, T2, ..., TN</tt> in</del> <tt>ArgTypes</tt> and <del>a</del> return
  type <tt>R</tt><del>,</del> if<del>, given lvalues <tt>t1, t2, ..., tN</tt> of
  types <tt>T1, T2, ..., TN</tt>, respectively,</del> <ins>the expression</ins>
  <tt><i>INVOKE</i>(f, <ins>declval&lt;ArgTypes&gt;()..., R</ins><del>t1, t2, ...,
! tN</del>)</tt><ins>, considered as an unevaluated operand (5 [expr]),</ins> 
! is well formed (20.7.2)<del> and, if <tt>R</tt> is not <tt>void</tt>, convertible 
! to <tt>R</tt></del>.
! </p></blockquote>
  </li>
  
  
  
  <li>
  <p>
! Change 20.9.12.2.1 [func.wrap.func.con]&#47;7 as indicated:
  </p>
  
! <blockquote><pre>
! function(const function&amp; f);
  template &lt;class A&gt; function(allocator_arg_t, const A&amp; a, const function&amp; f);
  </pre>
  <blockquote>
*************** exception thrown by the copy constructor
*** 50218,50224 ****
  avoid the use of dynamically allocated memory for small <del>function</del>
  <ins>callable</ins> objects, e.g., where <tt>f</tt>'s target is an object
  holding only a pointer or reference to an object and a member function pointer.
! — <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
--- 52199,52205 ----
  avoid the use of dynamically allocated memory for small <del>function</del>
  <ins>callable</ins> objects, e.g., where <tt>f</tt>'s target is an object
  holding only a pointer or reference to an object and a member function pointer.
! &mdash; <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
*************** holding only a pointer or reference to a
*** 50226,50235 ****
  
  <li>
  <p>
! Change 20.8.14.2.1 [func.wrap.func.con]/11 as indicated:
  </p>
  
! <blockquote><pre>template&lt;class F&gt; function(F f);
  template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
  </pre>
  <blockquote>
--- 52207,52217 ----
  
  <li>
  <p>
! Change 20.9.12.2.1 [func.wrap.func.con]&#47;11 as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;class F&gt; function(F f);
  template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
  </pre>
  <blockquote>
*************** template &lt;class F, class A&gt; functi
*** 50238,50244 ****
  11 [..] [<i>Note:</i> implementations are encouraged to avoid the use of dynamically
  allocated memory for small <del>function</del> <ins>callable</ins> objects, for
  example, where <tt>f</tt>'s target is an object holding only a pointer or
! reference to an object and a member function pointer. — <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
--- 52220,52226 ----
  11 [..] [<i>Note:</i> implementations are encouraged to avoid the use of dynamically
  allocated memory for small <del>function</del> <ins>callable</ins> objects, for
  example, where <tt>f</tt>'s target is an object holding only a pointer or
! reference to an object and a member function pointer. &mdash; <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
*************** reference to an object and a member func
*** 50246,50255 ****
  
  <li>
  <p>
! Change 20.8.14.2.4 [func.wrap.func.inv]/3 as indicated:
  </p>
  
! <blockquote><pre>R operator()(ArgTypes... args) const
  </pre>
  <blockquote>
  <p>...</p>
--- 52228,52238 ----
  
  <li>
  <p>
! Change 20.9.12.2.4 [func.wrap.func.inv]&#47;3 as indicated:
  </p>
  
! <blockquote><pre>
! R operator()(ArgTypes... args) const
  </pre>
  <blockquote>
  <p>...</p>
*************** exception thrown by the wrapped <del>fun
*** 50263,50279 ****
  
  <li>
  <p>
! Change 20.8.14.2.5 [func.wrap.func.targ]/3 as indicated:
  </p>
  
! <blockquote><pre>template&lt;typename T&gt;       T* target();
  template&lt;typename T&gt; const T* target() const;
  </pre>
  <blockquote>
  <p>...</p>
  <p>
  3 <i>Requires:</i> <tt>T</tt> shall be a <del>function object</del> type that is
! Callable (20.8.14.2 [func.wrap.func]) for parameter types <tt>ArgTypes</tt>
  and return type <tt>R</tt>.
  </p>
  </blockquote>
--- 52246,52263 ----
  
  <li>
  <p>
! Change 20.9.12.2.5 [func.wrap.func.targ]&#47;3 as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;typename T&gt;       T* target();
  template&lt;typename T&gt; const T* target() const;
  </pre>
  <blockquote>
  <p>...</p>
  <p>
  3 <i>Requires:</i> <tt>T</tt> shall be a <del>function object</del> type that is
! Callable (20.9.12.2 [func.wrap.func]) for parameter types <tt>ArgTypes</tt>
  and return type <tt>R</tt>.
  </p>
  </blockquote>
*************** and return type <tt>R</tt>.
*** 50282,50325 ****
  
  <li>
  <p>
! Change 23.2.4 [associative.reqmts]/2 as indicated: <i>[The suggested
  removal seems harmless, because 25.4 [alg.sorting]1 already clarifies
  that <tt>Compare</tt> is a function object type. Nevertheless it is recommended,
  because the explicit naming of "pointer to function" is misleading]</i>
  </p>
  
! <blockquote>
  2 Each associative container is parameterized on <tt>Key</tt> and an ordering
! relation <tt>Compare</tt> that induces a strict weak ordering (25.4 [alg.sorting]) on elements of <tt>Key</tt>. In addition, <tt>map</tt>
! and <tt>multimap</tt> associate an arbitrary type <tt>T</tt> with the
! <tt>Key</tt>. The object of type <tt>Compare</tt> is called the comparison
! object of a container. <del>This comparison object may be a pointer to function
! or an object of a type with an appropriate function call operator.</del>
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.2.5 [unord.req]/3 as indicated:
  </p>
  
! <blockquote>
  3 Each unordered associative container is parameterized by <tt>Key</tt>, by a
  function object <ins>type</ins> <tt>Hash</tt> that acts as a hash function for
  values of type <tt>Key</tt>, and by a binary predicate <tt>Pred</tt> that
  induces an equivalence relation on values of type Key. [..]
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 25.1 [algorithms.general]/7 as indicated: <i>[The intent is to
! bring this part in sync with 20.8 [function.objects]]</i>
  </p>
  
! <blockquote>
  7 The <tt>Predicate</tt> parameter is used whenever an algorithm expects a
! function object <ins>(20.8 [function.objects])</ins> that when applied
  to the result of dereferencing the corresponding iterator returns a value
  testable as <tt>true</tt>. In other words, if an algorithm takes <tt>Predicate
  pred</tt> as its argument and <tt>first</tt> as its iterator argument, it should
--- 52266,52310 ----
  
  <li>
  <p>
! Change 23.2.4 [associative.reqmts]&#47;2 as indicated: <i>[The suggested
  removal seems harmless, because 25.4 [alg.sorting]1 already clarifies
  that <tt>Compare</tt> is a function object type. Nevertheless it is recommended,
  because the explicit naming of "pointer to function" is misleading]</i>
  </p>
  
! <blockquote><p>
  2 Each associative container is parameterized on <tt>Key</tt> and an ordering
! relation <tt>Compare</tt> that induces a strict weak ordering (25.4 [alg.sorting]) 
! on elements of <tt>Key</tt>. In addition, <tt>map</tt> and <tt>multimap</tt> 
! associate an arbitrary type <tt>T</tt> with the <tt>Key</tt>. The object of type 
! <tt>Compare</tt> is called the comparison object of a container. <del>This 
! comparison object may be a pointer to function or an object of a type with an 
! appropriate function call operator.</del>
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 23.2.5 [unord.req]&#47;3 as indicated:
  </p>
  
! <blockquote><p>
  3 Each unordered associative container is parameterized by <tt>Key</tt>, by a
  function object <ins>type</ins> <tt>Hash</tt> that acts as a hash function for
  values of type <tt>Key</tt>, and by a binary predicate <tt>Pred</tt> that
  induces an equivalence relation on values of type Key. [..]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 25.1 [algorithms.general]&#47;7 as indicated: <i>[The intent is to
! bring this part in sync with 20.9 [function.objects]]</i>
  </p>
  
! <blockquote><p>
  7 The <tt>Predicate</tt> parameter is used whenever an algorithm expects a
! function object <ins>(20.9 [function.objects])</ins> that when applied
  to the result of dereferencing the corresponding iterator returns a value
  testable as <tt>true</tt>. In other words, if an algorithm takes <tt>Predicate
  pred</tt> as its argument and <tt>first</tt> as its iterator argument, it should
*************** work correctly in the construct <tt>if (
*** 50327,50341 ****
  object <tt>pred</tt> shall not apply any nonconstant function through the
  dereferenced iterator. <del>This function object may be a pointer to function,
  or an object of a type with an appropriate function call operator.</del>
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.9.2 [unique.ptr.single]/1 as indicated:
  </p>
  
! <blockquote>
  1 The default type for the template parameter <tt>D</tt> is
  <tt>default_delete</tt>. A client-supplied template argument <tt>D</tt> shall be
  a function <del>pointer or functor</del> <ins>object type</ins> for which, given
--- 52312,52326 ----
  object <tt>pred</tt> shall not apply any nonconstant function through the
  dereferenced iterator. <del>This function object may be a pointer to function,
  or an object of a type with an appropriate function call operator.</del>
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.1.2 [unique.ptr.single]&#47;1 as indicated:
  </p>
  
! <blockquote><p>
  1 The default type for the template parameter <tt>D</tt> is
  <tt>default_delete</tt>. A client-supplied template argument <tt>D</tt> shall be
  a function <del>pointer or functor</del> <ins>object type</ins> for which, given
*************** a value <tt>d</tt> of type <tt>D</tt> an
*** 50343,50349 ****
  <tt>T*</tt>, the expression <tt>d(ptr)</tt> is valid and has the effect of
  deallocating the pointer as appropriate for that deleter. <tt>D</tt> may also be
  an lvalue-reference to a deleter.
! </blockquote>
  </li>
  
  </ol>
--- 52328,52334 ----
  <tt>T*</tt>, the expression <tt>d(ptr)</tt> is valid and has the effect of
  deallocating the pointer as appropriate for that deleter. <tt>D</tt> may also be
  an lvalue-reference to a deleter.
! </p></blockquote>
  </li>
  
  </ol>
*************** an lvalue-reference to a deleter.
*** 50356,50377 ****
  
  
  <hr>
! <h3><a name="871"></a>871. Iota's requirements on T are too strong</h3>
! <p><b>Section:</b> 26.7.5 [numeric.iota] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-08-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to the recent WP
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf">N2691</a>,
! 26.7.5 [numeric.iota]/1, the requires clause
  of <tt>std::iota</tt> says:
  </p>
  
! <blockquote>
  <tt>T</tt> shall meet the requirements of <tt>CopyConstructible</tt> and <tt>Assignable</tt> types, and
  shall be convertible to <tt>ForwardIterator</tt>'s value type.[..]
! </blockquote>
  
  <p>
  Neither <tt>CopyConstructible</tt> nor <tt>Assignable</tt> is needed, instead <tt>MoveConstructible</tt>
--- 52341,52362 ----
  
  
  <hr>
! <h3><a name="871"></a>871. Iota's requirements on <tt>T</tt> are too strong</h3>
! <p><b>Section:</b> 26.7.6 [numeric.iota] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-08-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to the recent WP
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf">N2691</a>,
! 26.7.6 [numeric.iota]/1, the requires clause
  of <tt>std::iota</tt> says:
  </p>
  
! <blockquote><p>
  <tt>T</tt> shall meet the requirements of <tt>CopyConstructible</tt> and <tt>Assignable</tt> types, and
  shall be convertible to <tt>ForwardIterator</tt>'s value type.[..]
! </p></blockquote>
  
  <p>
  Neither <tt>CopyConstructible</tt> nor <tt>Assignable</tt> is needed, instead <tt>MoveConstructible</tt>
*************** artifact from comparing it with similar
*** 50381,50389 ****
  
  <p>
  Note: If this function will be conceptualized, the here proposed
! <tt>MoveConstructible</tt>
! requirement can be removed, because this is an implied requirement of
! function arguments, see
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2710.pdf">N2710</a>/[temp.req.impl]/3, last bullet.
  </p>
  
--- 52366,52373 ----
  
  <p>
  Note: If this function will be conceptualized, the here proposed
! <tt>MoveConstructible</tt> requirement can be removed, because this 
! is an implied requirement of function arguments, see
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2710.pdf">N2710</a>/[temp.req.impl]/3, last bullet.
  </p>
  
*************** post San Francisco:
*** 50392,50433 ****
  ]</i></p>
  
  
! <blockquote>
  Issue pulled by author prior to review.
! </blockquote>
  
  <p><i>[
  2009-07-30 Daniel reopened:
  ]</i></p>
  
  
! <blockquote>
  with the absence of concepts, this issue (closed) is valid again and I
  suggest to reopen it.
  I also revised by proposed resolution based on N2723 wording:
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Change 'convertible' to 'assignable', Move To Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the first sentence of 26.7.5 [numeric.iota]/1:
  </p>
  
! <blockquote>
  <i>Requires:</i> <tt>T</tt> shall <del>meet the requirements of <tt>CopyConstructible</tt> and
  <tt>Assignable</tt> types, and shall</del> be
  assignable to <tt>ForwardIterator</tt>'s value type. [..]
! </blockquote>
  
  
  
--- 52376,52417 ----
  ]</i></p>
  
  
! <blockquote><p>
  Issue pulled by author prior to review.
! </p></blockquote>
  
  <p><i>[
  2009-07-30 Daniel reopened:
  ]</i></p>
  
  
! <blockquote><p>
  with the absence of concepts, this issue (closed) is valid again and I
  suggest to reopen it.
  I also revised by proposed resolution based on N2723 wording:
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Change 'convertible' to 'assignable', Move To Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the first sentence of 26.7.6 [numeric.iota]/1:
  </p>
  
! <blockquote><p>
  <i>Requires:</i> <tt>T</tt> shall <del>meet the requirements of <tt>CopyConstructible</tt> and
  <tt>Assignable</tt> types, and shall</del> be
  assignable to <tt>ForwardIterator</tt>'s value type. [..]
! </p></blockquote>
  
  
  
*************** assignable to <tt>ForwardIterator</tt>'s
*** 50438,50452 ****
  
  <hr>
  <h3><a name="872"></a>872. <tt>move_iterator::operator[]</tt> has wrong return type</h3>
! <p><b>Section:</b> 24.5.3.3.12 [move.iter.op.index] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2008-08-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>move_iterator</tt>'s <tt>operator[]</tt> is declared as:
  </p>
  
! <blockquote><pre>reference operator[](difference_type n) const;
  </pre></blockquote>
  
  <p>
--- 52422,52437 ----
  
  <hr>
  <h3><a name="872"></a>872. <tt>move_iterator::operator[]</tt> has wrong return type</h3>
! <p><b>Section:</b> 24.5.3.3.12 [move.iter.op.index] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2008-08-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>move_iterator</tt>'s <tt>operator[]</tt> is declared as:
  </p>
  
! <blockquote><pre>
! reference operator[](difference_type n) const;
  </pre></blockquote>
  
  <p>
*************** This has the same problem that <tt>rever
*** 50454,50460 ****
  have: if the underlying iterator's <tt>operator[]</tt> returns a proxy, the
  implicit conversion to <tt>value_type&amp;&amp;</tt> could end up referencing a temporary
  that has already been destroyed. This is essentially the same issue that
! we dealt with for <tt>reverse_iterator</tt> in DR <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#386">386</a>.
  </p>
  
  <p><i>[
--- 52439,52445 ----
  have: if the underlying iterator's <tt>operator[]</tt> returns a proxy, the
  implicit conversion to <tt>value_type&amp;&amp;</tt> could end up referencing a temporary
  that has already been destroyed. This is essentially the same issue that
! we dealt with for <tt>reverse_iterator</tt> in DR <a href="lwg-defects.html#386">386</a>.
  </p>
  
  <p><i>[
*************** we dealt with for <tt>reverse_iterator</
*** 50467,50486 ****
  ]</i></p>
  
  
! <blockquote>
! I recommend closing this as  a duplicate of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1051">1051</a> which addresses
  this issue for both <tt>move_iterator</tt> and <tt>reverse_iterator</tt>.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! Move to Ready. Note that if <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1051">1051</a> is reopened, it may yield a
! better resolution, but <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1051">1051</a> is currently marked NAD.
! </blockquote>
  
  
  
--- 52452,52471 ----
  ]</i></p>
  
  
! <blockquote><p>
! I recommend closing this as  a duplicate of <a href="lwg-closed.html#1051">1051</a> which addresses
  this issue for both <tt>move_iterator</tt> and <tt>reverse_iterator</tt>.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! Move to Ready. Note that if <a href="lwg-closed.html#1051">1051</a> is reopened, it may yield a
! better resolution, but <a href="lwg-closed.html#1051">1051</a> is currently marked NAD.
! </p></blockquote>
  
  
  
*************** In 24.5.3.1 [move.iterator] and 24.5.3.3
*** 50490,50496 ****
  <tt>move_iterator</tt>'s <tt>operator[]</tt> to:
  </p>
  
! <blockquote><pre><del>reference</del> <ins><i>unspecified</i></ins> operator[](difference_type n) const;
  </pre></blockquote>
  
  
--- 52475,52482 ----
  <tt>move_iterator</tt>'s <tt>operator[]</tt> to:
  </p>
  
! <blockquote><pre>
! <del>reference</del> <ins><i>unspecified</i></ins> operator[](difference_type n) const;
  </pre></blockquote>
  
  
*************** San Francisco:
*** 50501,50520 ****
  ]</i></p>
  
  
! <blockquote>
  NAD Editorial, see
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2777.pdf">N2777</a>.
  </blockquote>
  
  
  
  
  <hr>
  <h3><a name="876"></a>876. <tt>basic_string</tt> access operations should give stronger guarantees</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-08-22 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  During the Sophia Antipolis meeting it was decided to split-off some
--- 52487,52831 ----
  ]</i></p>
  
  
! <blockquote><p>
  NAD Editorial, see
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2777.pdf">N2777</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="874"></a>874. Missing <tt>initializer_list</tt> constructor for <tt>discrete_distribution</tt></h3>
+ <p><b>Section:</b> 26.5.8.6.1 [rand.dist.samp.discrete] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-08-22 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.discrete">issues</a> in [rand.dist.samp.discrete].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ During the Sophia Antipolis meeting it was decided to separate from <a href="lwg-defects.html#793">793</a> a
+ subrequest that adds initializer list support to <tt>discrete_distribution</tt>, specifically,
+ the issue proposed to add a c'tor taking a <tt>initializer_list&lt;double&gt;</tt>.
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li>
+ <p>
+ In 26.5.8.6.1 [rand.dist.samp.discrete] p. 1, class <tt>discrete_distribution</tt>,
+ just <em>before</em> the member declaration
+ </p>
+ 
+ <blockquote><pre>
+ explicit discrete_distribution(const param_type&amp; parm);
+ </pre></blockquote>
+ 
+ <p>
+ insert
+ </p>
+ 
+ <blockquote><pre>
+ discrete_distribution(initializer_list&lt;double&gt; wl);
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Between p.4 and p.5 of the same section insert a new
+ paragraph as part of the new member description:
+ </p>
+ 
+ <blockquote><pre>
+ discrete_distribution(initializer_list&lt;double&gt; wl);
+ </pre>
+ 
+ <blockquote><p>
+ <i>Effects:</i> Same as <tt>discrete_distribution(wl.begin(), wl.end())</tt>.
+ </p></blockquote>
  </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ <p><b>Rationale:</b></p><p>
+ Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> 
+ "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="875"></a>875. Missing <tt>initializer_list</tt> constructor for <tt>piecewise_constant_distribution</tt></h3>
+ <p><b>Section:</b> 26.5.8.6.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-08-22 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ During the Sophia Antipolis meeting it was decided to separate from
+ <a href="lwg-defects.html#794">794</a> a subrequest that adds initializer list support to
+ <tt>piecewise_constant_distribution</tt>, specifically, the issue proposed
+ to add a c'tor taking a <tt>initializer_list&lt;double&gt;</tt> and a <tt>Callable</tt> to evaluate
+ weight values. For consistency with the remainder of this class and
+ the remainder of the <tt>initializer_list</tt>-aware library the author decided to
+ change the list argument type to the template parameter <tt>RealType</tt>
+ instead. For the reasoning to use <tt>Func</tt> instead of <tt>Func&amp;&amp;</tt> as c'tor
+ function argument see issue <a href="lwg-defects.html#793">793</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p><b>Non-concept version of the proposed resolution</b></p>
+ 
+ <ol>
+ <li>
+ <p>
+ In 26.5.8.6.2 [rand.dist.samp.pconst]/1, class <tt>piecewise_constant_distribution</tt>,
+ just <em>before</em> the member declaration
+ </p>
+ 
+ <blockquote><pre>
+ explicit piecewise_constant_distribution(const param_type&amp; parm);
+ </pre></blockquote>
+ 
+ <p>
+ insert
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;typename Func&gt;
+ piecewise_constant_distribution(initializer_list&lt;RealType&gt; bl, Func fw);
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Between p.4 and p.5 of the same section insert a series of
+ new paragraphs nominated below as [p5_1], [p5_2], and [p5_3]
+ as part of the new member description:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;typename Func&gt;
+ piecewise_constant_distribution(initializer_list&lt;RealType&gt; bl, Func fw);
+ </pre>
+ 
+ <blockquote>
+ 
+ <p>
+ [p5_1] <i>Complexity:</i> Exactly <tt>nf = max(bl.size(), 1) - 1</tt> invocations of <tt>fw</tt>.
+ </p>
+ 
+ <p>
+ [p5_2] <i>Requires:</i>
+ </p>
+ 
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ <tt>fw</tt> shall be callable with one argument of type <tt>RealType</tt>, and shall
+    return values of a type convertible to <tt>double</tt>;
+ </li>
+ <li>
+ The relation <tt>0 &lt; S = w<sub>0</sub>+. . .+w<sub>n-1</sub></tt> shall hold. 
+ For all sampled values <tt><i>x<sub>k</sub></i></tt> defined below, <tt>fw(<i>x<sub>k</sub></i>)</tt> shall return a weight
+    value <tt><i>w<sub>k</sub></i></tt> that is non-negative, non-NaN, and non-infinity;
+ </li>
+ <li>
+ If <tt>nf &gt; 0</tt> let <tt>b<sub><i>k</i></sub> = *(bl.begin() + k), k = 0, . . . , bl.size()-1</tt> and the
+ following relations shall hold for <tt>k = 0, . . . , nf-1: b<sub><i>k</i></sub> &lt; b<sub><i>k+1</i></sub></tt>.
+ </li>
+ </ol>
+ 
+ <p>
+ [p5_3] <i>Effects:</i>
+ </p>
+ 
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ <p>If <tt>nf == 0</tt>,</p>
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ lets the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist of the single
+      value <tt>w<sub>0</sub> = 1</tt>, and
+ </li>
+ <li>
+ lets the sequence <tt>b</tt> have length <tt>n+1</tt> with <tt>b<sub>0</sub> = 0</tt> and <tt>b<sub>1</sub> = 1</tt>.
+ </li>
+ </ol>
+ </li>
+ 
+ <li>
+ <p>Otherwise,</p>
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ sets <tt>n = nf</tt>, and <tt>[bl.begin(), bl.end())</tt> shall form the sequence <tt>b</tt> of
+ length <tt>n+1</tt>, and
+ </li>
+ <li>
+ <p>lets the sequences <tt>w</tt> have length <tt>n</tt> and for each <tt>k = 0, . . . ,n-1</tt>,
+      calculates:</p>
+ <blockquote><p style="white-space: pre;">
+ x<sub><i>k</i></sub> = 0.5*(b<sub><i>k+1</i></sub> + b<sub><i>k</i></sub>)
+ w<sub><i>k</i></sub> = fw(x<sub><i>k</i></sub>)
+ </p></blockquote>
+ </li>
+ </ol>
+ </li>
+ 
+ <li>
+ <p>
+ Constructs a <tt>piecewise_constant_distribution</tt> object with
+ the above computed sequence <tt>b</tt> as the interval boundaries
+ and with the probability densities:
+ </p>
+ <blockquote><p style="white-space: pre;">
+ &rho;<sub><i>k</i></sub> = w<sub><i>k</i></sub>/(S * (b<sub><i>k+1</i></sub> - b<sub><i>k</i></sub>)) for k = 0, . . . , n-1.
+ </p></blockquote>
+ 
+ </li>
+ </ol>
+ 
+ </blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ <p><b>Concept version of the proposed resolution</b></p>
+ 
+ <ol>
+ <li>
+ <p>
+ In 26.5.8.6.2 [rand.dist.samp.pconst]/1, class <tt>piecewise_constant_distribution</tt>,
+ just <em>before</em> the member declaration
+ </p>
+ 
+ <blockquote><pre>
+ explicit piecewise_constant_distribution(const param_type&amp; parm);
+ </pre></blockquote>
+ 
+ <p>
+ insert
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;Callable&lt;auto, RealType&gt; Func&gt;
+  requires Convertible&lt;Func::result_type, double&gt;
+ piecewise_constant_distribution(initializer_list&lt;RealType&gt; bl, Func fw);
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Between p.4 and p.5 of the same section insert a series of
+ new paragraphs nominated below as [p5_1], [p5_2], and [p5_3]
+ as part of the new member description:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;Callable&lt;auto, RealType&gt; Func&gt;
+  requires Convertible&lt;Func::result_type, double&gt;
+ piecewise_constant_distribution(initializer_list&lt;RealType&gt; bl, Func fw);
+ </pre>
+ 
+ <blockquote>
+ 
+ <p>
+ [p5_1] <i>Complexity:</i> Exactly <tt>nf = max(bl.size(), 1) - 1</tt> invocations of <tt>fw</tt>.
+ </p>
+ 
+ <p>
+ [p5_2] <i>Requires:</i>
+ </p>
+ 
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ The relation <tt>0 &lt; S = w<sub>0</sub>+. . .+w<sub>n-1</sub></tt> shall hold. 
+ For all sampled values <tt><i>x<sub>k</sub></i></tt> defined below, <tt>fw(<i>x<sub>k</sub></i>)</tt> shall return a weight
+    value <tt><i>w<sub>k</sub></i></tt> that is non-negative, non-NaN, and non-infinity;
+ </li>
+ <li>
+ If <tt>nf &gt; 0</tt> let <tt>b<sub><i>k</i></sub> = *(bl.begin() + k), k = 0, . . . , bl.size()-1</tt> and the
+ following relations shall hold for <tt>k = 0, . . . , nf-1: b<sub><i>k</i></sub> &lt; b<sub><i>k+1</i></sub></tt>.
+ </li>
+ </ol>
+ 
+ <p>
+ [p5_3] <i>Effects:</i>
+ </p>
+ 
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ <p>If <tt>nf == 0</tt>,</p>
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ lets the sequence <tt>w</tt> have length <tt>n = 1</tt> and consist of the single
+      value <tt>w<sub>0</sub> = 1</tt>, and
+ </li>
+ <li>
+ lets the sequence <tt>b</tt> have length <tt>n+1</tt> with <tt>b<sub>0</sub> = 0</tt> and <tt>b<sub>1</sub> = 1</tt>.
+ </li>
+ </ol>
+ </li>
+ 
+ <li>
+ <p>Otherwise,</p>
+ <ol style="list-style-type:lower-alpha">
+ <li>
+ sets <tt>n = nf</tt>, and <tt>[bl.begin(), bl.end())</tt> shall form the sequence <tt>b</tt> of
+ length <tt>n+1</tt>, and
+ </li>
+ <li>
+ <p>lets the sequences <tt>w</tt> have length <tt>n</tt> and for each <tt>k = 0, . . . ,n-1</tt>,
+      calculates:</p>
+ <blockquote><p style="white-space: pre;">
+ x<sub><i>k</i></sub> = 0.5*(b<sub><i>k+1</i></sub> + b<sub><i>k</i></sub>)
+ w<sub><i>k</i></sub> = fw(x<sub><i>k</i></sub>)
+ </p></blockquote>
+ </li>
+ </ol>
+ </li>
+ 
+ <li>
+ <p>
+ Constructs a <tt>piecewise_constant_distribution</tt> object with
+ the above computed sequence <tt>b</tt> as the interval boundaries
+ and with the probability densities:
+ </p>
+ <blockquote><p style="white-space: pre;">
+ &rho;<sub><i>k</i></sub> = w<sub><i>k</i></sub>/(S * (b<sub><i>k+1</i></sub> - b<sub><i>k</i></sub>)) for k = 0, . . . , n-1.
+ </p></blockquote>
+ 
+ </li>
+ </ol>
+ 
+ </blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">N2836</a> "Wording Tweaks for Concept-enabled Random Number Generation in C++0X".
+ </p>
+ 
  
  
  
  
  <hr>
  <h3><a name="876"></a>876. <tt>basic_string</tt> access operations should give stronger guarantees</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-08-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  During the Sophia Antipolis meeting it was decided to split-off some
*************** San Francisco:
*** 50584,50590 ****
  <blockquote>
  <p>
  We oppose part 1 of the issue but hope to address <tt>size()</tt> in
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#877">877</a>.
  </p>
  <p>
  We do not support part B. 4 of the issue because of the breaking API change.
--- 52895,52901 ----
  <blockquote>
  <p>
  We oppose part 1 of the issue but hope to address <tt>size()</tt> in
! issue <a href="lwg-active.html#877">877</a>.
  </p>
  <p>
  We do not support part B. 4 of the issue because of the breaking API change.
*************** We support part A. 2 of the issue.
*** 50595,50606 ****
  <p>
  On support part A. 3 of the issue:
  </p>
! <blockquote>
! Pete's broader comment: now that we know that basic_string will be a
  block of contiguous memory, we should just rewrite its specification
  with that in mind. The expression of the specification will be simpler
  and probably more correct as a result.
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 52906,52917 ----
  <p>
  On support part A. 3 of the issue:
  </p>
! <blockquote><p>
! Pete's broader comment: now that we know that <tt>basic_string</tt> will be a
  block of contiguous memory, we should just rewrite its specification
  with that in mind. The expression of the specification will be simpler
  and probably more correct as a result.
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** Howard: Commented out part B.
*** 50621,50635 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <ol type="A">
  <li>
  <ol>
  <li>
  <p>In 21.4.4 [string.capacity], just after p. 1 add a new paragraph:
  </p>
! <blockquote>
  <i>Throws:</i> Nothing.
! </blockquote>
  
  </li>
  <li>
--- 52932,52946 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <ol style="list-style-type:upper-alpha">
  <li>
  <ol>
  <li>
  <p>In 21.4.4 [string.capacity], just after p. 1 add a new paragraph:
  </p>
! <blockquote><p>
  <i>Throws:</i> Nothing.
! </p></blockquote>
  
  </li>
  <li>
*************** In 21.4.5 [string.access] <em>replace</e
*** 50639,50645 ****
  
  <blockquote>
  <p>
! <i>Requires:</i> <tt>pos &#8804; size()</tt>.
  </p>
  <p>
  <i>Returns:</i> If <tt>pos &lt; size()</tt>, returns <tt>*(begin() + pos)</tt>. Otherwise, returns
--- 52950,52956 ----
  
  <blockquote>
  <p>
! <i>Requires:</i> <tt>pos &le; size()</tt>.
  </p>
  <p>
  <i>Returns:</i> If <tt>pos &lt; size()</tt>, returns <tt>*(begin() + pos)</tt>. Otherwise, returns
*************** in <tt>[0, size()]</tt>.
*** 50684,50693 ****
  
  <hr>
  <h3><a name="878"></a>878. <tt>forward_list</tt> preconditions</h3>
! <p><b>Section:</b> 23.3.3 [forwardlist] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-08-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist">issues</a> in [forwardlist].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
         <p>
  
--- 52995,53004 ----
  
  <hr>
  <h3><a name="878"></a>878. <tt>forward_list</tt> preconditions</h3>
! <p><b>Section:</b> 23.3.4 [forwardlist] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2008-08-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist">issues</a> in [forwardlist].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
         <p>
  
*************** a <tt>forward_list::iterator</tt> (denot
*** 50696,50718 ****
  function signatures) argument have the following precondition:
  
         </p>
!        <blockquote>
  
  <i>Requires:</i> <tt>position</tt> is dereferenceable or equal
  to <tt>before_begin()</tt>.
  
!        </blockquote>
         <p>
  
  I believe what's actually intended is this:
  
         </p>
!        <blockquote>
  
  <i>Requires:</i> <tt>position</tt> is in the range
  [<tt>before_begin()</tt>, <tt>end()</tt>).
  
!        </blockquote>
         <p>
  
  That is, when it's dereferenceable, <tt>position</tt> must point
--- 53007,53029 ----
  function signatures) argument have the following precondition:
  
         </p>
!        <blockquote><p>
  
  <i>Requires:</i> <tt>position</tt> is dereferenceable or equal
  to <tt>before_begin()</tt>.
  
!        </p></blockquote>
         <p>
  
  I believe what's actually intended is this:
  
         </p>
!        <blockquote><p>
  
  <i>Requires:</i> <tt>position</tt> is in the range
  [<tt>before_begin()</tt>, <tt>end()</tt>).
  
!        </p></blockquote>
         <p>
  
  That is, when it's dereferenceable, <tt>position</tt> must point
*************** San Francisco:
*** 50725,50733 ****
  ]</i></p>
  
  
! <blockquote>
  Robert suggested alternate proposed wording which had large support.
! </blockquote>
  
  <p><i>[
  Post Summit:
--- 53036,53044 ----
  ]</i></p>
  
  
! <blockquote><p>
  Robert suggested alternate proposed wording which had large support.
! </p></blockquote>
  
  <p><i>[
  Post Summit:
*************** With that minor update, Recommend Tentat
*** 50750,50781 ****
  
  Change the <i>Requires</i> clauses
   [forwardlist] , p21, p24, p26, p29, and,
! 23.3.3.5 [forwardlist.ops], p39, p43, p47
  as follows:
  
         </p>
!        <blockquote>
  
  <i>Requires:</i> <tt>position</tt> is <ins><tt>before_begin()</tt> or is a</ins>
  dereferenceable
  <ins>iterator in the range <tt>[begin(), end())</tt></ins>
  <del>or equal to <tt>before_begin()</tt></del>. ...
  
!        </blockquote>
     
  
  
  
  <hr>
! <h3><a name="881"></a>881. shared_ptr conversion issue</h3>
! <p><b>Section:</b> 20.9.10.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-08-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  We've changed <tt>shared_ptr&lt;Y&gt;</tt> to not convert to <tt>shared_ptr&lt;T&gt;</tt> when <tt>Y*</tt>
! doesn't convert to <tt>T*</tt> by resolving issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a>. This only fixed the
  converting copy constructor though.
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2351.htm">N2351</a>
  later added move support, and
--- 53061,53171 ----
  
  Change the <i>Requires</i> clauses
   [forwardlist] , p21, p24, p26, p29, and,
! 23.3.4.6 [forwardlist.ops], p39, p43, p47
  as follows:
  
         </p>
!        <blockquote><p>
  
  <i>Requires:</i> <tt>position</tt> is <ins><tt>before_begin()</tt> or is a</ins>
  dereferenceable
  <ins>iterator in the range <tt>[begin(), end())</tt></ins>
  <del>or equal to <tt>before_begin()</tt></del>. ...
  
!        </p></blockquote>
     
  
  
  
  <hr>
! <h3><a name="880"></a>880. Missing atomic exchange parameter</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-08-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#942">942</a></p>
! <p><b>Discussion:</b></p>
! <p>
! The <tt>atomic_exchange</tt> and <tt>atomic_exchange_explicit</tt> functions seem to
! be inconsistently missing parameters.
! </p>
! 
! <p><i>[
! Post Summit:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Lawrence: Need to write up a list for Pete with details.
! </p>
! <p>
! Detlef: Should not be New, we already talked about in Concurrency group.
! </p>
! <p>
! Recommend Open.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-07 Frankfurt
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! Lawrence will handle all issues relating to atomics in a single paper.
! </p>
! <p>
! LWG will defer discussion on atomics until that paper appears.
! </p>
! <p>
! Move to Open.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-08-17 Handled by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2925.html">N2925</a>.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! <del>NAD Editorial</del><ins>Resolved</ins>. Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Add the appropriate parameters.  For example,
! </p>
! 
! <blockquote><pre>
! bool atomic_exchange(volatile atomic_bool*<ins>, bool</ins>);
! bool atomic_exchange_explicit(volatile atomic_bool*, bool<ins>, memory_order</ins>);
! </pre></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="881"></a>881. <tt>shared_ptr</tt> conversion issue</h3>
! <p><b>Section:</b> 20.8.2.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-08-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  We've changed <tt>shared_ptr&lt;Y&gt;</tt> to not convert to <tt>shared_ptr&lt;T&gt;</tt> when <tt>Y*</tt>
! doesn't convert to <tt>T*</tt> by resolving issue <a href="lwg-defects.html#687">687</a>. This only fixed the
  converting copy constructor though.
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2351.htm">N2351</a>
  later added move support, and
*************** San Francisco:
*** 50787,50796 ****
  ]</i></p>
  
  
! <blockquote>
  We might be able to move this to NAD, Editorial once shared_ptr is
  conceptualized, but we want to revisit this issue to make sure.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
--- 53177,53186 ----
  ]</i></p>
  
  
! <blockquote><p>
  We might be able to move this to NAD, Editorial once shared_ptr is
  conceptualized, but we want to revisit this issue to make sure.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
*************** This issue now represents the favored fo
*** 50813,50833 ****
  We need to change the Requires clause of the move constructor:
  </p>
  
! <blockquote><pre>shared_ptr(shared_ptr&amp;&amp; r); 
  template&lt;class Y&gt; shared_ptr(shared_ptr&lt;Y&gt;&amp;&amp; r); 
  </pre>
! <blockquote>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <del>For the second constructor <tt>Y*</tt> shall be
  convertible to <tt>T*</tt>.</del>
  <ins>
  The second constructor shall not participate in overload resolution
  unless <tt>Y*</tt> is convertible to <tt>T*</tt>.
  </ins>
! </blockquote>
  </blockquote>
  
  <p>
! in order to actually make the example in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#687">687</a> compile
  (it now resolves to the move constructor).
  </p>
  
--- 53203,53224 ----
  We need to change the Requires clause of the move constructor:
  </p>
  
! <blockquote><pre>
! shared_ptr(shared_ptr&amp;&amp; r); 
  template&lt;class Y&gt; shared_ptr(shared_ptr&lt;Y&gt;&amp;&amp; r); 
  </pre>
! <blockquote><p>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <del>For the second constructor <tt>Y*</tt> shall be
  convertible to <tt>T*</tt>.</del>
  <ins>
  The second constructor shall not participate in overload resolution
  unless <tt>Y*</tt> is convertible to <tt>T*</tt>.
  </ins>
! </p></blockquote>
  </blockquote>
  
  <p>
! in order to actually make the example in <a href="lwg-defects.html#687">687</a> compile
  (it now resolves to the move constructor).
  </p>
  
*************** in order to actually make the example in
*** 50838,50847 ****
  
  <hr>
  <h3><a name="882"></a>882. <tt>duration</tt> non-member arithmetic requirements</h3>
! <p><b>Section:</b> 20.11.3.5 [time.duration.nonmember] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-09-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.duration.nonmember">issues</a> in [time.duration.nonmember].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.htm">N2661</a>
--- 53229,53238 ----
  
  <hr>
  <h3><a name="882"></a>882. <tt>duration</tt> non-member arithmetic requirements</h3>
! <p><b>Section:</b> 20.12.5.5 [time.duration.nonmember] <b>Status:</b> <a href="lwg-active.html#CD1">CD1</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-09-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration.nonmember">issues</a> in [time.duration.nonmember].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#CD1">CD1</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.htm">N2661</a>
*************** arithmetic:
*** 50851,50888 ****
  
  <blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator*(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote>
  <i>Requires:</i> Let <tt>CR</tt> represent the <tt>common_type</tt> of <tt>Rep1</tt> and
  <tt>Rep2</tt>.  Both <tt>Rep1</tt> and <tt>Rep2</tt> shall be implicitly convertible
  to CR, diagnostic required.
! </blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator*(const Rep1&amp; s, const duration&lt;Rep2, Period&gt;&amp; d);
  </pre>
  
! <blockquote>
  <i>Requires:</i> Let <tt>CR</tt> represent the <tt>common_type</tt> of
  <tt>Rep1</tt> and <tt>Rep2</tt>. Both <tt>Rep1</tt> and <tt>Rep2</tt>
  shall be implicitly convertible to <tt>CR</tt>, diagnostic required.
! </blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator/(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
  
! <blockquote>
  <i>Requires:</i> Let <tt>CR</tt> represent the <tt>common_type</tt> of
  <tt>Rep1</tt> and <tt>Rep2</tt>. Both <tt>Rep1</tt> and <tt>Rep2</tt> shall be
  implicitly convertible to <tt>CR</tt>, and <tt>Rep2</tt> shall not be an
  instantiation of <tt>duration</tt>, diagnostic required.
! </blockquote>
  
  </blockquote>
  
--- 53242,53282 ----
  
  <blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator*(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote><p>
  <i>Requires:</i> Let <tt>CR</tt> represent the <tt>common_type</tt> of <tt>Rep1</tt> and
  <tt>Rep2</tt>.  Both <tt>Rep1</tt> and <tt>Rep2</tt> shall be implicitly convertible
  to CR, diagnostic required.
! </p></blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator*(const Rep1&amp; s, const duration&lt;Rep2, Period&gt;&amp; d);
  </pre>
  
! <blockquote><p>
  <i>Requires:</i> Let <tt>CR</tt> represent the <tt>common_type</tt> of
  <tt>Rep1</tt> and <tt>Rep2</tt>. Both <tt>Rep1</tt> and <tt>Rep2</tt>
  shall be implicitly convertible to <tt>CR</tt>, diagnostic required.
! </p></blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator/(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
  
! <blockquote><p>
  <i>Requires:</i> Let <tt>CR</tt> represent the <tt>common_type</tt> of
  <tt>Rep1</tt> and <tt>Rep2</tt>. Both <tt>Rep1</tt> and <tt>Rep2</tt> shall be
  implicitly convertible to <tt>CR</tt>, and <tt>Rep2</tt> shall not be an
  instantiation of <tt>duration</tt>, diagnostic required.
! </p></blockquote>
  
  </blockquote>
  
*************** During transcription into the working pa
*** 50891,50899 ****
  three functions was changed to:
  </p>
  
! <blockquote>
  <i>Requires:</i> <tt>CR(Rep1, Rep2)</tt> shall exist. Diagnostic required.
! </blockquote>
  
  <p>
  This is a non editorial change with respect to
--- 53285,53293 ----
  three functions was changed to:
  </p>
  
! <blockquote><p>
  <i>Requires:</i> <tt>CR(Rep1, Rep2)</tt> shall exist. Diagnostic required.
! </p></blockquote>
  
  <p>
  This is a non editorial change with respect to
*************** fine for most expressions as long as the
*** 50905,50911 ****
  relating the user written representation and the arithmetic type.  For example:
  </p>
  
! <blockquote><pre>class saturate
  {
  public:
    explicit saturate(long long i);
--- 53299,53306 ----
  relating the user written representation and the arithmetic type.  For example:
  </p>
  
! <blockquote><pre>
! class saturate
  {
  public:
    explicit saturate(long long i);
*************** implicit convertibility is required betw
*** 50939,50945 ****
  for the member <tt>*=</tt> operator:
  </p>
  
! <blockquote><pre>template &lt;class Rep, class Period = ratio&lt;1&gt;&gt; 
  class duration { 
  public: 
     ...
--- 53334,53341 ----
  for the member <tt>*=</tt> operator:
  </p>
  
! <blockquote><pre>
! template &lt;class Rep, class Period = ratio&lt;1&gt;&gt; 
  class duration { 
  public: 
     ...
*************** The last line does not (and should not)
*** 50957,50963 ****
  to have the same behavior as member arithmetic:
  </p>
  
! <blockquote><pre>my_ms = my_ms * saturate(2);  // ok, rhs is lhs's representation
  my_ms = my_ms * 2;            // <em>should be</em> error, 2 is not implicitly convertible to saturate
  </pre></blockquote>
  
--- 53353,53360 ----
  to have the same behavior as member arithmetic:
  </p>
  
! <blockquote><pre>
! my_ms = my_ms * saturate(2);  // ok, rhs is lhs's representation
  my_ms = my_ms * 2;            // <em>should be</em> error, 2 is not implicitly convertible to saturate
  </pre></blockquote>
  
*************** as specified by
*** 50976,51036 ****
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.htm">N2661</a>.
  </p>
  
! <blockquote>
  <i>Requires:</i> ... <em>Both</em> <tt>Rep1</tt> and <tt>Rep2</tt> shall be implicitly convertible
  to CR, diagnostic required.
! </blockquote>
  
  <p>
  It is not necessary for both <tt>Rep</tt>s to be <i>implicitly</i> convertible to
  the <tt>CR</tt>.  It is only necessary for the rhs <tt>Rep</tt> to be implicitly
  convertible to the <tt>CR</tt>.  The <tt>Rep</tt> within the <tt>duration</tt>
  should be allowed to only be explicitly convertible to the <tt>CR</tt>.  The
! explicit-conversion-requirement is covered under 20.11.3.7 [time.duration.cast].
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the requirements clauses under 20.11.3.5 [time.duration.nonmember]:
  </p>
  
  <blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator*(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
  
! <blockquote>
  <i>Requires:</i> <del><tt>CR(Rep1, Rep2)</tt> shall exist.</del>
  <ins><tt>Rep2</tt> shall be implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.</ins>
  Diagnostic required.
! </blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator*(const Rep1&amp; s, const duration&lt;Rep2, Period&gt;&amp; d);
  </pre>
  
! <blockquote>
  <i>Require<ins>s</ins><del>d behavior</del>:</i> <del><tt>CR(Rep1, Rep2)</tt> shall exist.</del>
  <ins><tt>Rep1</tt> shall be implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.</ins>
  Diagnostic required.
! </blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator/(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
  
! <blockquote>
  <i>Requires:</i> <del><tt>CR(Rep1, Rep2)</tt> shall exist</del>
  <ins><tt>Rep2</tt> shall be implicitly convertible to <tt>CR(Rep1, Rep2)</tt></ins>
  and <tt>Rep2</tt> shall not
  be an instantiation of <tt>duration</tt>. Diagnostic required.
! </blockquote>
  
  </blockquote>
  
--- 53373,53436 ----
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.htm">N2661</a>.
  </p>
  
! <blockquote><p>
  <i>Requires:</i> ... <em>Both</em> <tt>Rep1</tt> and <tt>Rep2</tt> shall be implicitly convertible
  to CR, diagnostic required.
! </p></blockquote>
  
  <p>
  It is not necessary for both <tt>Rep</tt>s to be <i>implicitly</i> convertible to
  the <tt>CR</tt>.  It is only necessary for the rhs <tt>Rep</tt> to be implicitly
  convertible to the <tt>CR</tt>.  The <tt>Rep</tt> within the <tt>duration</tt>
  should be allowed to only be explicitly convertible to the <tt>CR</tt>.  The
! explicit-conversion-requirement is covered under 20.12.5.7 [time.duration.cast].
  </p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the requirements clauses under 20.12.5.5 [time.duration.nonmember]:
  </p>
  
  <blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator*(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
  
! <blockquote><p>
  <i>Requires:</i> <del><tt>CR(Rep1, Rep2)</tt> shall exist.</del>
  <ins><tt>Rep2</tt> shall be implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.</ins>
  Diagnostic required.
! </p></blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator*(const Rep1&amp; s, const duration&lt;Rep2, Period&gt;&amp; d);
  </pre>
  
! <blockquote><p>
  <i>Require<ins>s</ins><del>d behavior</del>:</i> <del><tt>CR(Rep1, Rep2)</tt> shall exist.</del>
  <ins><tt>Rep1</tt> shall be implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.</ins>
  Diagnostic required.
! </p></blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator/(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
  
! <blockquote><p>
  <i>Requires:</i> <del><tt>CR(Rep1, Rep2)</tt> shall exist</del>
  <ins><tt>Rep2</tt> shall be implicitly convertible to <tt>CR(Rep1, Rep2)</tt></ins>
  and <tt>Rep2</tt> shall not
  be an instantiation of <tt>duration</tt>. Diagnostic required.
! </p></blockquote>
  
  </blockquote>
  
*************** be an instantiation of <tt>duration</tt>
*** 51040,51049 ****
  
  <hr>
  <h3><a name="883"></a>883. swap circular definition</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 53440,53450 ----
  
  <hr>
  <h3><a name="883"></a>883. swap circular definition</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#containers">active issues</a> in [containers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** San Francisco:
*** 51058,51068 ****
  ]</i></p>
  
  
! <blockquote>
! Robert to propose a resolution along the lines of "Postcondition: "a =
! b, b = a" This will be a little tricky for the hash containers, since
! they don't have <tt>operator==</tt>.
! </blockquote>
  
  <p><i>[
  Post Summit Anthony Williams provided proposed wording.
--- 53459,53469 ----
  ]</i></p>
  
  
! <blockquote><p>
! Robert to propose a resolution along the lines of "Postcondition: "a = b, b = a" 
! This will be a little tricky for the hash containers, since they don't have 
! <tt>operator==</tt>.
! </p></blockquote>
  
  <p><i>[
  Post Summit Anthony Williams provided proposed wording.
*************** Post Summit Anthony Williams provided pr
*** 51074,51082 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready with minor edits (which have been made).
! </blockquote>
  
  
  
--- 53475,53483 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready with minor edits (which have been made).
! </p></blockquote>
  
  
  
*************** replace the postcondition of <tt>a.swap(
*** 51089,51095 ****
  <blockquote>
  <table border="1">
  <caption>Table 80 -- Container requirements</caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
--- 53490,53496 ----
  <blockquote>
  <table border="1">
  <caption>Table 80 -- Container requirements</caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
*************** replace the postcondition of <tt>a.swap(
*** 51111,51139 ****
  <ins>Exchange the contents of <tt>a</tt> and <tt>b</tt>.</ins></td>
  <td>(Note A)</td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
  Remove the reference to swap from the paragraph following the table.
  </p>
  
! <blockquote>
  Notes: the algorithms <del><tt>swap()</tt>, </del><tt>equal()</tt> and
  <tt>lexicographical_compare()</tt> are defined in Clause 25. ...
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="884"></a>884. shared_ptr swap</h3>
! <p><b>Section:</b> 20.9.10.2.4 [util.smartptr.shared.mod] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
! <blockquote><pre>#include &lt;memory&gt;
  #include &lt;cassert&gt;
  
  struct A { };
--- 53512,53541 ----
  <ins>Exchange the contents of <tt>a</tt> and <tt>b</tt>.</ins></td>
  <td>(Note A)</td>
  </tr>
! </table>
  </blockquote>
  
  <p>
  Remove the reference to swap from the paragraph following the table.
  </p>
  
! <blockquote><p>
  Notes: the algorithms <del><tt>swap()</tt>, </del><tt>equal()</tt> and
  <tt>lexicographical_compare()</tt> are defined in Clause 25. ...
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="884"></a>884. <tt>shared_ptr</tt> swap</h3>
! <p><b>Section:</b> 20.8.2.2.4 [util.smartptr.shared.mod] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
! <blockquote><pre>
! #include &lt;memory&gt;
  #include &lt;cassert&gt;
  
  struct A { };
*************** unavoidable, or not worth worrying about
*** 51158,51164 ****
  This calls the lvalue/rvalue swap overload for <tt>shared_ptr</tt>:
  </p>
  
! <blockquote><pre>template&lt;class T&gt; void swap( shared_ptr&lt;T&gt; &amp; a, shared_ptr&lt;T&gt; &amp;&amp; b );
  </pre></blockquote>
  
  <p>
--- 53560,53567 ----
  This calls the lvalue/rvalue swap overload for <tt>shared_ptr</tt>:
  </p>
  
! <blockquote><pre>
! template&lt;class T&gt; void swap( shared_ptr&lt;T&gt; &amp; a, shared_ptr&lt;T&gt; &amp;&amp; b );
  </pre></blockquote>
  
  <p>
*************** eliminate the rvalue swap overloads alto
*** 51179,51199 ****
  was:
  </p>
  
! <blockquote><pre>vector&lt;A&gt; v = ...;
  ...
  swap(v, vector&lt;A&gt;(v));
  </pre></blockquote>
! 
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1690.html#Improved%20swap%20Interface">N1690</a>.
! 
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to <del>NAD Editorial</del><ins>Resolved</ins>.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 53582,53603 ----
  was:
  </p>
  
! <blockquote><pre>
! vector&lt;A&gt; v = ...;
  ...
  swap(v, vector&lt;A&gt;(v));
  </pre></blockquote>
! <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1690.html#Improved%20swap%20Interface">N1690</a>.
! </p>
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to <del>NAD Editorial</del><ins>Resolved</ins>.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Recommend <del>NAD Editorial</del><ins>R
*** 51207,51219 ****
  
  
  <hr>
! <h3><a name="885"></a>885. pair assignment</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
! <blockquote><pre>20.2.3 pairs
  Missing assignemnt operator:
  template&lt;class U , class V&gt;
    requires CopyAssignable&lt;T1, U&gt; &amp;&amp; CopyAssignable&lt;T2, V&gt;
--- 53611,53624 ----
  
  
  <hr>
! <h3><a name="885"></a>885. <tt>pair</tt> assignment</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
! <blockquote><pre>
! 20.2.3 pairs
  Missing assignemnt operator:
  template&lt;class U , class V&gt;
    requires CopyAssignable&lt;T1, U&gt; &amp;&amp; CopyAssignable&lt;T2, V&gt;
*************** San Francisco:
*** 51241,51247 ****
  Would be NAD if better ctors fixed it.
  </p>
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>.
  </p>
  </blockquote>
  
--- 53646,53652 ----
  Would be NAD if better ctors fixed it.
  </p>
  <p>
! Related to <a href="lwg-defects.html#811">811</a>.
  </p>
  </blockquote>
  
*************** post San Francisco:
*** 51250,51282 ****
  ]</i></p>
  
  
! <blockquote>
  Possibly NAD Editorial, solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2770.pdf">N2770</a>.
! </blockquote>
  
  <p><i>[
  2009-05-25 Alisdair adds:
  ]</i></p>
  
  
! <blockquote>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#885">885</a> was something I reported while reviewing the library concepts
  documents ahead of San Francisco.  The missing operator was added as part of
  the paper adopted at that meeting
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2770.pdf">N2770</a>)
  and I can confirm this operator is
  present in the current working paper.  I recommend NAD.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  We agree with the intent, but we need to wait for the dust to settle on concepts.
! </blockquote>
  
  <p><i>[
  2010-03-11 Stefanus provided wording.
--- 53655,53687 ----
  ]</i></p>
  
  
! <blockquote><p>
  Possibly NAD Editorial, solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2770.pdf">N2770</a>.
! </p></blockquote>
  
  <p><i>[
  2009-05-25 Alisdair adds:
  ]</i></p>
  
  
! <blockquote><p>
! Issue <a href="lwg-defects.html#885">885</a> was something I reported while reviewing the library concepts
  documents ahead of San Francisco.  The missing operator was added as part of
  the paper adopted at that meeting
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2770.pdf">N2770</a>)
  and I can confirm this operator is
  present in the current working paper.  I recommend NAD.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  We agree with the intent, but we need to wait for the dust to settle on concepts.
! </p></blockquote>
  
  <p><i>[
  2010-03-11 Stefanus provided wording.
*************** We agree with the intent, but we need to
*** 51292,51310 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following declaration 20.3.5.2 [pairs.pair], before the
  declaration of <tt>pair&amp; operator=(pair&amp;&amp; p);</tt>:
  </p>
   
! <blockquote><pre>template&lt;class U, class V&gt; pair&amp; operator=(const pair&lt;U, V&gt;&amp; p);
  </pre></blockquote>
  
  <p>
! Add the following description to 20.3.5.2 [pairs.pair] after paragraph 11 (before
  the description of <tt>pair&amp; operator=(pair&amp;&amp; p);)</tt>:
  </p>
   
! <blockquote><pre>template&lt;class U, class V&gt; pair&amp; operator=(const pair&lt;U, V&gt;&amp; p);
  </pre>
  <blockquote>
  <p>
--- 53697,53717 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add the following declaration 20.3.2 [pairs.pair], before the
  declaration of <tt>pair&amp; operator=(pair&amp;&amp; p);</tt>:
  </p>
   
! <blockquote><pre>
! template&lt;class U, class V&gt; pair&amp; operator=(const pair&lt;U, V&gt;&amp; p);
  </pre></blockquote>
  
  <p>
! Add the following description to 20.3.2 [pairs.pair] after paragraph 11 (before
  the description of <tt>pair&amp; operator=(pair&amp;&amp; p);)</tt>:
  </p>
   
! <blockquote><pre>
! template&lt;class U, class V&gt; pair&amp; operator=(const pair&lt;U, V&gt;&amp; p);
  </pre>
  <blockquote>
  <p>
*************** satisfy the requirements of <tt>CopyAssi
*** 51328,51345 ****
  
  
  <hr>
! <h3><a name="886"></a>886. tuple construction</h3>
! <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  20.4.2.1 [tuple.cnstr]:
  </p>
! <blockquote>
  <i>Effects:</i> Default initializes each element.
! </blockquote>
  
  <p>
  Could be clarified to state each "non-trivial" element.  Otherwise
--- 53735,53753 ----
  
  
  <hr>
! <h3><a name="886"></a>886. <tt>tuple</tt> construction</h3>
! <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#tuple.cnstr">active issues</a> in [tuple.cnstr].</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  20.4.2.1 [tuple.cnstr]:
  </p>
! <blockquote><p>
  <i>Effects:</i> Default initializes each element.
! </p></blockquote>
  
  <p>
  Could be clarified to state each "non-trivial" element.  Otherwise
*************** Request resolution text from Alisdair.
*** 51374,51380 ****
  </p>
  
  <p>
! This issue relates to Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#868">868</a> default construction and value-initialization.
  </p>
  </blockquote>
  
--- 53782,53788 ----
  </p>
  
  <p>
! This issue relates to Issue <a href="lwg-defects.html#868">868</a> default construction and value-initialization.
  </p>
  </blockquote>
  
*************** Note: This <em>IS</em> a change of seman
*** 51389,51399 ****
  with during the discussion.  To preserve TR1 semantics, this would have been
  worded:
  </p>
! <blockquote><pre>requires DefaultConstructible&lt;Types&gt;... tuple();
  </pre>
! <blockquote>
  -2-   <i>Effects:</i> Default-initializes each non-trivial element.
! </blockquote>
  </blockquote>
  
  
--- 53797,53808 ----
  with during the discussion.  To preserve TR1 semantics, this would have been
  worded:
  </p>
! <blockquote><pre>
! requires DefaultConstructible&lt;Types&gt;... tuple();
  </pre>
! <blockquote><p>
  -2-   <i>Effects:</i> Default-initializes each non-trivial element.
! </p></blockquote>
  </blockquote>
  
  
*************** worded:
*** 51404,51412 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 53813,53821 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Move to Ready.
*** 51415,51421 ****
  Change p2 in Construction 20.4.2.1 [tuple.cnstr]:
  </p>
  
! <blockquote><pre>requires DefaultConstructible&lt;Types&gt;... tuple();
  </pre>
  <blockquote>
  <p>
--- 53824,53831 ----
  Change p2 in Construction 20.4.2.1 [tuple.cnstr]:
  </p>
  
! <blockquote><pre>
! requires DefaultConstructible&lt;Types&gt;... tuple();
  </pre>
  <blockquote>
  <p>
*************** Change p2 in Construction 20.4.2.1 [tupl
*** 51430,51441 ****
  
  
  <hr>
! <h3><a name="888"></a>888. this_thread::yield too strong</h3>
! <p><b>Section:</b> 30.3.2 [thread.thread.this] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#thread.thread.this">active issues</a> in [thread.thread.this].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.this">issues</a> in [thread.thread.this].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I never thought I'd say this, but <tt>this_thread::yield</tt> seems to be too
--- 53840,53850 ----
  
  
  <hr>
! <h3><a name="888"></a>888. <tt>this_thread::yield</tt> too strong</h3>
! <p><b>Section:</b> 30.3.2 [thread.thread.this] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.this">issues</a> in [thread.thread.this].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I never thought I'd say this, but <tt>this_thread::yield</tt> seems to be too
*************** Post Summit:
*** 51454,51462 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend move to Tentatively Ready.
! </blockquote>
  
  
  
--- 53863,53871 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend move to Tentatively Ready.
! </p></blockquote>
  
  
  
*************** Change 30.3.2 [thread.thread.this]/3:
*** 51466,51478 ****
  </p>
  
  <blockquote>
! <pre>void this_thread::yield();
  </pre>
! <blockquote>
  <i>Effects:</i> Offers the <del>operating system</del> <ins>implementation</ins>
  the opportunity to <ins>re</ins>schedule.
  <del>another thread.</del>
  </blockquote>
  </blockquote>
  
  
--- 53875,54140 ----
  </p>
  
  <blockquote>
! <pre>
! void this_thread::yield();
  </pre>
! <blockquote><p>
  <i>Effects:</i> Offers the <del>operating system</del> <ins>implementation</ins>
  the opportunity to <ins>re</ins>schedule.
  <del>another thread.</del>
+ </p></blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="889"></a>889. <tt>thread::id</tt> comparisons</h3>
+ <p><b>Section:</b> 30.3.1.1 [thread.thread.id] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Lawrence Crowl <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.thread.id">issues</a> in [thread.thread.id].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 324</b></p>
+ 
+ <p>
+ The <tt>thread::id</tt> type supports the full set of comparison operators.  This
+ is substantially more than is required for the associative containers that
+ justified them.  Please place an issue against the threads library.
+ </p>
+ 
+ <p><i>[
+ San Francisco:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Would depend on proposed extension to POSIX, or non-standard extension.
+ What about hash? POSIX discussing op. POSIX not known to be considering
+ support needed for hash, op.
+ </p>
+ <p>
+ Group expresses support for putting ids in both unordered and ordered containers.
+ </p>
  </blockquote>
+ 
+ <p><i>[
+ post San Francisco:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Howard:  It turns out the current working paper
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
+ <i>already has</i> <tt>hash&lt;thread::id&gt;</tt>
+ (20.9 [function.objects], 20.9.13 [unord.hash]).  We simply
+ overlooked it in the meeting.  It is a good thing we voted in favor of it
+ (again). :-)
+ </p>
+ <p>
+ Recommend NAD.
+ </p>
+ 
+ </blockquote>
+ 
+ <p><i>[
+ Post Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Recommend to close as NAD. For POSIX, see if we need to add a function to
+ convert <tt>pthread_t</tt> to integer.
+ </p></blockquote>
+ 
+ <p><i>[
+ Post Summit, Alisdair adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ The recommendation for LWG-889/UK-324 is NAD, already specified.
+ </p>
+ <p>
+ It is not clear to me that the specification is complete.
+ </p>
+ <p>
+ In particular, the synopsis of <tt>&lt;functional&gt;</tt> in 
+ 20.9 [function.objects] does not mention <tt>hash&lt; thread::id&gt;</tt> 
+ nor <tt>hash&lt; error_code &gt;</tt>, although their existence is 
+ implied by 20.9.13 [unord.hash], p1.
+ </p>
+ <p>
+ I am fairly uncomfortable putting the declaration for the
+ <tt>thread_id</tt> specialization into <tt>&lt;functional&gt;</tt> as
+ <tt>id</tt> is a nested class inside <tt>std::thread</tt>, so it implies
+ that <tt>&lt;functional&gt;</tt> would require the definition of the
+ <tt>thread</tt> class template in order to forward declared
+ <tt>thread::id</tt> and form this specialization.
+ </p>
+ <p>
+ It seems better to me that the dependency goes the other way around
+ (<tt>&lt;thread&gt;</tt> will more typically make use of
+ <tt>&lt;functional&gt;</tt> than vice-versa) and the
+ <tt>hash&lt;thread::id&gt;</tt> specialization be declared in the
+ <tt>&lt;thread&gt;</tt> header.
+ </p>
+ <p>
+ I think <tt>hash&lt;error_code&gt;</tt> could go into either
+ <tt>&lt;system_error&gt;</tt> or <tt>&lt;functional&gt;</tt> and have no
+ immediate preference either way.  However, it should clearly appear in
+ the synopsis of one of these two.
+ </p>
+ <p>
+ Recommend moving 889 back to open, and tying in a reference to UK-324.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote><p>
+ Howard observes that <tt>thread::id</tt> need not be a nested class;
+ it could be a <tt>typedef</tt> for a more visible type.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-05-24 Alisdair adds:
+ ]</i></p>
+ 
+ <blockquote><p>
+ I do not believe this is correct.  <tt>thread::id</tt> is explicitly documents as a
+ nested class, rather than as an unspecified typedef analogous to an
+ iterator.  If the intent is that this is not implemented as a nested class
+ (under the as-if freedoms) then this is a novel form of standardese.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Decided we want to move hash specialization for thread_id to the thread
+ header. Alisdair to provide wording.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-07-28 Alisdair provided wording, moved to Review.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Add a strike for <tt>hash&lt;thread::id&gt;</tt>. Move to Ready
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-11-13 The proposed wording of <a href="lwg-defects.html#1182">1182</a> is a superset of the
+ wording in this issue.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010-02-09 Moved from Ready to Open:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Issue <a href="lwg-defects.html#1182">1182</a> is not quite a superset of this issue and it is controversial
+ whether or not the note:
+ </p>
+ 
+ <blockquote><p>
+ hash template specialization allows <tt>thread::id</tt> objects to be used as keys in
+ unordered containers.
+ </p></blockquote>
+ 
+ <p>
+ should be added to the WP.
+ </p>
+ 
+ 
+ </blockquote>
+ 
+ <p><i>[
+ 2010-02-09 Objections to moving this to <del>NAD Editorial</del><ins>Resolved</ins>, addressed by <a href="lwg-defects.html#1182">1182</a> have been removed.  Set to Tentatively <del>NAD Editorial</del><ins>Resolved</ins>.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by <a href="lwg-defects.html#1182">1182</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <p>
+ Remove the following prototype from the synopsis in
+ 20.9 [function.objects]:
+ </p>
+ 
+ <blockquote><pre><del>
+ template &lt;&gt; struct hash&lt;std::thread::id&gt;;
+ </del></pre></blockquote>
+ 
+ <p>
+ Add to 30.3 [thread.threads], p1 Header <tt>&lt;thread&gt;</tt> synopsis:
+ </p>
+ 
+ <blockquote><pre>
+ <ins>template &lt;class T&gt; struct hash;
+ template &lt;&gt; struct hash&lt;thread::id&gt;;</ins>
+ </pre></blockquote>
+ 
+ <p>
+ Add template specialization below class definition in 30.3.1.1 [thread.thread.id]
+ </p>
+ 
+ <blockquote><pre>
+ <ins>template &lt;&gt;
+ struct hash&lt;thread::id&gt; : public unary_function&lt;thread::id, size_t&gt; {
+    size_t operator()(thread::id val) const;
+ };</ins>
+ </pre></blockquote>
+ 
+ <p>
+ Extend note in p2 30.3.1.1 [thread.thread.id] with second sentence:
+ </p>
+ 
+ <blockquote><p>
+ [<i>Note:</i> Relational operators allow <tt>thread::id</tt> objects to be used
+ as keys in associative containers.
+ <ins><tt>hash</tt> template specialization allows <tt>thread::id</tt> objects to be used as keys
+ in unordered containers.</ins>
+ &mdash; <i>end note</i>]
+ </p></blockquote>
+ 
+ <p>
+ Add new paragraph to end of 30.3.1.1 [thread.thread.id]
+ </p>
+ 
+ <blockquote><pre>
+ <ins>template &lt;&gt; struct hash&lt;thread::id&gt;;</ins>
+ </pre>
+ <blockquote><p><ins>
+ An explicit specialization of the class template hash (20.9.13 [unord.hash])
+ shall be provided for the type <tt>thread::id</tt>.
+ </ins></p></blockquote>
  </blockquote>
  
  
*************** the opportunity to <ins>re</ins>schedule
*** 51481,51496 ****
  
  <hr>
  <h3><a name="890"></a>890. Improving <tt>&lt;system_error&gt;</tt> initialization</h3>
! <p><b>Section:</b> 19.5.1 [syserr.errcat] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-09-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>static const error_category</tt> objects <tt>generic_category</tt> and
  <tt>system_category</tt> in header <tt>&lt;system_error&gt;</tt> are currently declared:
  </p>
  
! <blockquote><pre>const error_category&amp; get_generic_category();
  const error_category&amp; get_system_category();
  
  static const error_category&amp; generic_category = get_generic_category();
--- 54143,54160 ----
  
  <hr>
  <h3><a name="890"></a>890. Improving <tt>&lt;system_error&gt;</tt> initialization</h3>
! <p><b>Section:</b> 19.5.1 [syserr.errcat] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2008-09-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#syserr.errcat">issues</a> in [syserr.errcat].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>static const error_category</tt> objects <tt>generic_category</tt> and
  <tt>system_category</tt> in header <tt>&lt;system_error&gt;</tt> are currently declared:
  </p>
  
! <blockquote><pre>
! const error_category&amp; get_generic_category();
  const error_category&amp; get_system_category();
  
  static const error_category&amp; generic_category = get_generic_category();
*************** still suffer much the same problems.
*** 51528,51534 ****
  
  <p>
  The original plan was to eliminate these problems by applying the C++0x
! <tt>constexpr</tt> feature. See LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#832">832</a>. However, that approach turned out
  to be unimplementable, since it would require a <tt>constexpr</tt> object of a
  class with virtual functions, and that is not allowed by the core
  language.
--- 54192,54198 ----
  
  <p>
  The original plan was to eliminate these problems by applying the C++0x
! <tt>constexpr</tt> feature. See LWG issue <a href="lwg-closed.html#832">832</a>. However, that approach turned out
  to be unimplementable, since it would require a <tt>constexpr</tt> object of a
  class with virtual functions, and that is not allowed by the core
  language.
*************** like to see <tt>get_*</tt> functions ins
*** 51583,51589 ****
  
  <p>
  Beman: The proposed resolution has been reworked to remove the file-scope 
! static objects, per Martin's suggestions. The <tt>get_</tt> prefix has been 
  eliminated from the function names as no longer necessary and to conform with 
  standard library naming practice.
  </p>
--- 54247,54253 ----
  
  <p>
  Beman: The proposed resolution has been reworked to remove the file-scope 
! static objects, per Martin&#39;s suggestions. The <tt>get_</tt> prefix has been 
  eliminated from the function names as no longer necessary and to conform with 
  standard library naming practice.
  </p>
*************** Post Summit:
*** 51595,51610 ****
  ]</i></p>
  
  
! <blockquote>
  Agreement that this is wise and essential, text provided works and has
  been implemented. Seems to be widespread consensus. Move to Tentative Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Change 17.6.4.14 [value.error.codes] Value of error codes as indicated:</p>
  <blockquote>
   <p>Certain functions in the C++ standard library report errors via a 
   <tt>std::error_code</tt> (19.4.2.2) object. That object's <tt>category()</tt> member shall 
--- 54259,54274 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agreement that this is wise and essential, text provided works and has
  been implemented. Seems to be widespread consensus. Move to Tentative Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
! <p>Change 17.6.5.14 [value.error.codes] Value of error codes as indicated:</p>
  <blockquote>
   <p>Certain functions in the C++ standard library report errors via a 
   <tt>std::error_code</tt> (19.4.2.2) object. That object's <tt>category()</tt> member shall 
*************** Change 19.5.1.1 [syserr.errcat.overview]
*** 51627,51633 ****
  </p>
  
  <blockquote>
! <pre>const error_category&amp; <del>get_</del>generic_category();
  const error_category&amp; <del>get_</del>system_category();
  
  <del>static storage-class-specifier const error_category&amp; generic_category = get_generic_category();
--- 54291,54298 ----
  </p>
  
  <blockquote>
! <pre>
! const error_category&amp; <del>get_</del>generic_category();
  const error_category&amp; <del>get_</del>system_category();
  
  <del>static storage-class-specifier const error_category&amp; generic_category = get_generic_category();
*************** object's <tt>name</tt> virtual function
*** 51657,51663 ****
  </p>
  </blockquote>
  
! <pre>const error_category&amp; <del>get_</del>system_category();
  </pre>
  
  <blockquote>
--- 54322,54329 ----
  </p>
  </blockquote>
  
! <pre>
! const error_category&amp; <del>get_</del>system_category();
  </pre>
  
  <blockquote>
*************** specified for class <tt>error_category</
*** 51671,51677 ****
  shall return a pointer to the string <tt>"system"</tt>. The object's
  <tt>default_error_condition</tt> virtual function shall behave as follows:
  </p>
! <blockquote>
  If the argument <tt>ev</tt> corresponds to a POSIX <tt>errno</tt> value <tt>posv</tt>, the function
  shall return <tt>error_condition(posv, generic_category<ins>()</ins>)</tt>. Otherwise, the
  function shall return <tt>error_condition(ev, system_category<ins>()</ins>)</tt>. What
--- 54337,54343 ----
  shall return a pointer to the string <tt>"system"</tt>. The object's
  <tt>default_error_condition</tt> virtual function shall behave as follows:
  </p>
! <blockquote><p>
  If the argument <tt>ev</tt> corresponds to a POSIX <tt>errno</tt> value <tt>posv</tt>, the function
  shall return <tt>error_condition(posv, generic_category<ins>()</ins>)</tt>. Otherwise, the
  function shall return <tt>error_condition(ev, system_category<ins>()</ins>)</tt>. What
*************** constitutes correspondence for any given
*** 51679,51691 ****
  unspecified. [<i>Note:</i> The number of potential system error codes is large
  and unbounded, and some may not correspond to any POSIX <tt>errno</tt> value.
  Thus implementations are given latitude in determining correspondence.
! <i>-- end note</i>]
! </blockquote>
  </blockquote>
  
  </blockquote>
  
! <p>Change 19.5.2.2 [syserr.errcode.constructors] Class error_code constructors 
  as indicated:</p>
  <blockquote>
   <pre>error_code();</pre>
--- 54345,54357 ----
  unspecified. [<i>Note:</i> The number of potential system error codes is large
  and unbounded, and some may not correspond to any POSIX <tt>errno</tt> value.
  Thus implementations are given latitude in determining correspondence.
! &mdash; <i>end note</i>]
! </p></blockquote>
  </blockquote>
  
  </blockquote>
  
! <p>Change 19.5.2.2 [syserr.errcode.constructors] Class <tt>error_code</tt> constructors 
  as indicated:</p>
  <blockquote>
   <pre>error_code();</pre>
*************** as indicated:</p>
*** 51694,51700 ****
   <p><i>Postconditions:</i> <code>val_ == 0 </code>and <code>cat_ == &amp;system_category</code><tt><ins>()</ins></tt>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.2.3 [syserr.errcode.modifiers] Class error_code modifiers as 
  indicated:</p>
  <blockquote>
   <pre>void clear();</pre>
--- 54360,54366 ----
   <p><i>Postconditions:</i> <code>val_ == 0 </code>and <code>cat_ == &amp;system_category</code><tt><ins>()</ins></tt>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.2.3 [syserr.errcode.modifiers] Class <tt>error_code</tt> modifiers as 
  indicated:</p>
  <blockquote>
   <pre>void clear();</pre>
*************** indicated:</p>
*** 51703,51709 ****
   system_category</code><tt><ins>()</ins></tt>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.2.5 [syserr.errcode.nonmembers] Class error_code non-member 
  functions as indicated:</p>
  <blockquote>
   <pre>error_code make_error_code(errc e);</pre>
--- 54369,54375 ----
   system_category</code><tt><ins>()</ins></tt>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.2.5 [syserr.errcode.nonmembers] Class <tt>error_code</tt> non-member 
  functions as indicated:</p>
  <blockquote>
   <pre>error_code make_error_code(errc e);</pre>
*************** functions as indicated:</p>
*** 51711,51717 ****
   <p><i>Returns:</i> <code>error_code(static_cast&lt;int&gt;(e), generic_category</code><tt><ins>()</ins></tt><code>)</code>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.3.2 [syserr.errcondition.constructors] Class error_condition 
  constructors as indicated:</p>
  <blockquote>
   <pre>error_condition();</pre>
--- 54377,54383 ----
   <p><i>Returns:</i> <code>error_code(static_cast&lt;int&gt;(e), generic_category</code><tt><ins>()</ins></tt><code>)</code>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.3.2 [syserr.errcondition.constructors] Class <tt>error_condition</tt> 
  constructors as indicated:</p>
  <blockquote>
   <pre>error_condition();</pre>
*************** constructors as indicated:</p>
*** 51720,51726 ****
   <p><i>Postconditions:</i> <code>val_ == 0</code> and <code>cat_ == &amp;generic_category</code><tt><ins>()</ins></tt>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.3.3 [syserr.errcondition.modifiers] Class error_condition 
  modifiers as indicated:</p>
  <blockquote>
   <pre>void clear();</pre>
--- 54386,54392 ----
   <p><i>Postconditions:</i> <code>val_ == 0</code> and <code>cat_ == &amp;generic_category</code><tt><ins>()</ins></tt>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.3.3 [syserr.errcondition.modifiers] Class <tt>error_condition</tt> 
  modifiers as indicated:</p>
  <blockquote>
   <pre>void clear();</pre>
*************** modifiers as indicated:</p>
*** 51729,51735 ****
   generic_category</code><tt><ins>()</ins></tt>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.3.5 [syserr.errcondition.nonmembers] Class error_condition 
  non-member functions as indicated:</p>
  <blockquote>
   <pre>error_condition make_error_condition(errc e);</pre>
--- 54395,54401 ----
   generic_category</code><tt><ins>()</ins></tt>.</p>
   </blockquote>
  </blockquote>
! <p>Change 19.5.3.5 [syserr.errcondition.nonmembers] Class <tt>error_condition</tt> 
  non-member functions as indicated:</p>
  <blockquote>
   <pre>error_condition make_error_condition(errc e);</pre>
*************** non-member functions as indicated:</p>
*** 51737,51743 ****
   <p><i>Returns:</i> <tt>error_condition(static_cast&lt;int&gt;(e), generic_category<ins>()</ins>)</tt>.</p>
   </blockquote>
  </blockquote>
!  <p>Change 27.5 [iostreams.base] Iostreams base classes, Header &lt;ios&gt; 
   synopsis as indicated:</p>
  <blockquote>
   <pre>concept_map ErrorCodeEnum&lt;io_errc&gt; { };
--- 54403,54409 ----
   <p><i>Returns:</i> <tt>error_condition(static_cast&lt;int&gt;(e), generic_category<ins>()</ins>)</tt>.</p>
   </blockquote>
  </blockquote>
!  <p>Change 27.5 [iostreams.base] Iostreams base classes, Header <tt>&lt;ios&gt;</tt> 
   synopsis as indicated:</p>
  <blockquote>
   <pre>concept_map ErrorCodeEnum&lt;io_errc&gt; { };
*************** error_code make_error_code(io_errc e);
*** 51745,51762 ****
  error_condition make_error_condition(io_errc e);
  <del>storage-class-specifier</del> const error_category&amp; iostream_category<ins>()</ins>;</pre>
  </blockquote>
! <p>Change 27.5.2.1.1 [ios::failure] Class ios_base::failure, paragraph 2 as 
  indicated:</p>
  <blockquote>
! <p>When throwing ios_base::failure exceptions, implementations should provide 
! values of ec that identify the specific reason for the failure. [ Note: Errors 
  arising from the operating system would typically be reported as <tt>
  system_category</tt><tt><ins>()</ins></tt> errors with an error value of the 
  error number reported by the operating system. Errors arising from within the 
  stream library would typically be reported as <tt>error_code(io_errc::stream, 
! iostream_category<ins>()</ins>)</tt>. --end note ]</p>
  </blockquote>
! <p>Change 27.5.5.5 [error.reporting] Error reporting as indicated:</p>
  <blockquote>
   <pre>error_code make_error_code(io_errc e);</pre>
   <blockquote>
--- 54411,54428 ----
  error_condition make_error_condition(io_errc e);
  <del>storage-class-specifier</del> const error_category&amp; iostream_category<ins>()</ins>;</pre>
  </blockquote>
! <p>Change 27.5.3.1.1 [ios::failure] Class ios_base::failure, paragraph 2 as 
  indicated:</p>
  <blockquote>
! <p>When throwing <tt>ios_base::failure</tt> exceptions, implementations should provide 
! values of <tt>ec</tt> that identify the specific reason for the failure. [ <i>Note</i>: Errors 
  arising from the operating system would typically be reported as <tt>
  system_category</tt><tt><ins>()</ins></tt> errors with an error value of the 
  error number reported by the operating system. Errors arising from within the 
  stream library would typically be reported as <tt>error_code(io_errc::stream, 
! iostream_category<ins>()</ins>)</tt>. &mdash; <i>end note</i> ]</p>
  </blockquote>
! <p>Change 27.5.6.5 [error.reporting] Error reporting as indicated:</p>
  <blockquote>
   <pre>error_code make_error_code(io_errc e);</pre>
   <blockquote>
*************** iostream_category<ins>()</ins>)</tt>. --
*** 51779,51785 ****
  </p>
  <p><i>Remarks:</i> The object's default_error_condition and equivalent virtual functions shall 
  behave as specified for the class error_category. The object's name virtual 
! function shall return a pointer to the string "iostream".</p>
   </blockquote>
  </blockquote>
  
--- 54445,54451 ----
  </p>
  <p><i>Remarks:</i> The object's default_error_condition and equivalent virtual functions shall 
  behave as specified for the class error_category. The object's name virtual 
! function shall return a pointer to the string &quot;iostream&quot;.</p>
   </blockquote>
  </blockquote>
  
*************** function shall return a pointer to the s
*** 51790,51800 ****
  
  
  <hr>
! <h3><a name="891"></a>891. std::thread, std::call_once issue</h3>
! <p><b>Section:</b> 30.3.1.2 [thread.thread.constr], 30.4.4.2 [thread.once.callonce] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.constr">issues</a> in [thread.thread.constr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I notice that the vararg overloads of <tt>std::thread</tt> and <tt>std::call_once</tt>
--- 54456,54466 ----
  
  
  <hr>
! <h3><a name="891"></a>891. <tt>std::thread</tt>, <tt>std::call_once</tt> issue</h3>
! <p><b>Section:</b> 30.3.1.2 [thread.thread.constr], 30.4.4.2 [thread.once.callonce] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.constr">issues</a> in [thread.thread.constr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I notice that the vararg overloads of <tt>std::thread</tt> and <tt>std::call_once</tt>
*************** There are two problems with this.
*** 51809,51815 ****
  First, the specification (and implementation) in terms of <tt>std::bind</tt> allows, for example:
  </p>
  
! <blockquote><pre>std::thread th( f, 1, std::bind( g ) );
  </pre></blockquote>
  
  <p>
--- 54475,54482 ----
  First, the specification (and implementation) in terms of <tt>std::bind</tt> allows, for example:
  </p>
  
! <blockquote><pre>
! std::thread th( f, 1, std::bind( g ) );
  </pre></blockquote>
  
  <p>
*************** which executes <tt>f( 1, g() )</tt> in a
*** 51820,51846 ****
  Second, assuming that we don't want the above, the specification has copied the wording
  </p>
  
! <blockquote>
  <tt>INVOKE(func, w1, w2, ..., wN)</tt> (20.6.2) shall be a valid
  expression for some values <tt>w1, w2, ..., wN</tt>
! </blockquote>
  
  <p>
  but this is not needed since we know that our argument list is args; it should simply be
  </p>
  
! <blockquote>
  <tt>INVOKE(func, args...)</tt> (20.6.2) shall be a valid expression
! </blockquote>
  
  <p><i>[
  Summit:
  ]</i></p>
  
  
! <blockquote>
  Move to open.
! </blockquote>
  
  <p><i>[
  Post Summit Anthony provided proposed wording.
--- 54487,54513 ----
  Second, assuming that we don't want the above, the specification has copied the wording
  </p>
  
! <blockquote><p>
  <tt>INVOKE(func, w1, w2, ..., wN)</tt> (20.6.2) shall be a valid
  expression for some values <tt>w1, w2, ..., wN</tt>
! </p></blockquote>
  
  <p>
  but this is not needed since we know that our argument list is args; it should simply be
  </p>
  
! <blockquote><p>
  <tt>INVOKE(func, args...)</tt> (20.6.2) shall be a valid expression
! </p></blockquote>
  
  <p><i>[
  Summit:
  ]</i></p>
  
  
! <blockquote><p>
  Move to open.
! </p></blockquote>
  
  <p><i>[
  Post Summit Anthony provided proposed wording.
*************** Post Summit Anthony provided proposed wo
*** 51852,51872 ****
  ]</i></p>
  
  
! <blockquote>
  Leave Open. Await decision for thread variadic constructor.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! See proposed wording for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a> for this, for the formulation
! on how to solve this.  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#929">929</a> modifies the thread constructor to
  have "pass by value" behavior with pass by reference efficiency through the use
  of the <tt>decay</tt> trait.  This same formula would be useful for <tt>call_once</tt>.
! </blockquote>
  
  <p><i>[
  2010-02-11 Anthony updates wording.
--- 54519,54539 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave Open. Await decision for thread variadic constructor.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! See proposed wording for <a href="lwg-defects.html#929">929</a> for this, for the formulation
! on how to solve this.  <a href="lwg-defects.html#929">929</a> modifies the thread constructor to
  have "pass by value" behavior with pass by reference efficiency through the use
  of the <tt>decay</tt> trait.  This same formula would be useful for <tt>call_once</tt>.
! </p></blockquote>
  
  <p><i>[
  2010-02-11 Anthony updates wording.
*************** of the <tt>decay</tt> trait.  This same
*** 51884,51893 ****
  Modify 30.4.4.2 [thread.once.callonce] p1-p2 with the following:
  </p>
  
! <blockquote>
! <pre>template&lt;class Callable, class ...Args&gt;
!   void call_once(once_flag&amp; flag, Callable<ins>&amp;&amp;</ins> func, Args&amp;&amp;... args);</pre>
! <blockquote>
  
  <p><ins>
  Given a function as follows:
--- 54551,54560 ----
  Modify 30.4.4.2 [thread.once.callonce] p1-p2 with the following:
  </p>
  
! <blockquote><pre>
! template&lt;class Callable, class ...Args&gt;
!   void call_once(once_flag&amp; flag, Callable<ins>&amp;&amp;</ins> func, Args&amp;&amp;... args);
! </pre><blockquote>
  
  <p><ins>
  Given a function as follows:
*************** template&lt;typename T&gt; typename deca
*** 51901,51912 ****
  <p>
  1 <i>Requires:</i> <del>The template parameters</del> <tt>Callable</tt> and each
  <tt>Ti</tt> in <tt>Args</tt> shall <del>be <tt>CopyConstructible</tt> if an
! lvalue and otherwise</del> <ins>satisfy the</ins>
! <tt>MoveConstructible</tt> <ins>requirements</ins>.
  <tt><i>INVOKE</i>(<ins>decay_copy(std::forward&lt;Callable&gt;(</ins>func<ins>)</ins>,
  <del>w1, w2, ..., wN</del>
! <ins>decay_copy(std::forward&lt;Args&gt;(args))...</ins>)</tt> (20.8.2 [func.require]) shall be a valid expression<del> for some values <tt>w1,
! w2, ..., wN</tt>, where <tt>N == sizeof...(Args)</tt></del>.
  </p>
  
  <p>
--- 54568,54580 ----
  <p>
  1 <i>Requires:</i> <del>The template parameters</del> <tt>Callable</tt> and each
  <tt>Ti</tt> in <tt>Args</tt> shall <del>be <tt>CopyConstructible</tt> if an
! lvalue and otherwise</del> <ins>satisfy the</ins> <tt>MoveConstructible</tt> 
! <ins>requirements</ins>.
  <tt><i>INVOKE</i>(<ins>decay_copy(std::forward&lt;Callable&gt;(</ins>func<ins>)</ins>,
  <del>w1, w2, ..., wN</del>
! <ins>decay_copy(std::forward&lt;Args&gt;(args))...</ins>)</tt> (20.9.2 [func.require]) 
! shall be a valid expression<del> for some values <tt>w1, w2, ..., wN</tt>, where 
! <tt>N == sizeof...(Args)</tt></del>.
  </p>
  
  <p>
*************** throwing an exception. If an exception i
*** 51936,51947 ****
  
  
  <hr>
! <h3><a name="893"></a>893. std::mutex issue</h3>
! <p><b>Section:</b> 30.4.1.2.1 [thread.mutex.class] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.class">issues</a> in [thread.mutex.class].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#905">905</a></p>
  <p><b>Discussion:</b></p>
  <p>
  30.4.1.2.1 [thread.mutex.class]/27 (in
--- 54604,54615 ----
  
  
  <hr>
! <h3><a name="893"></a>893. <tt>std::mutex</tt> issue</h3>
! <p><b>Section:</b> 30.4.1.2.1 [thread.mutex.class] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-09-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.class">issues</a> in [thread.mutex.class].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#905">905</a></p>
  <p><b>Discussion:</b></p>
  <p>
  30.4.1.2.1 [thread.mutex.class]/27 (in
*************** calls <tt>lock()</tt> or <tt>try_lock()<
*** 51993,52001 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Review. Alisdair to provide note.
! </blockquote>
  
  <p><i>[
  2009-07-31 Alisdair provided note.
--- 54661,54669 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Review. Alisdair to provide note.
! </p></blockquote>
  
  <p><i>[
  2009-07-31 Alisdair provided note.
*************** Move to Review. Alisdair to provide note
*** 52007,52015 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  <p><i>[
  2009-11-18 Peter Opens:
--- 54675,54683 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  <p><i>[
  2009-11-18 Peter Opens:
*************** Moved to Ready.
*** 52021,52032 ****
  I don't believe that the proposed note:
  </p>
  
! <blockquote>
  [<i>Note:</i> a program may deadlock if the thread that owns a <tt>mutex</tt>
  object calls <tt>lock()</tt> or <tt>try_lock()</tt> on that object. If the program can
  detect the deadlock, a <tt>resource_deadlock_would_occur</tt> error condition may
! be observed. — <i>end note</i>]
! </blockquote>
  
  <p>
  is entirely correct. "or <tt>try_lock()</tt>" should be removed, because
--- 54689,54700 ----
  I don't believe that the proposed note:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> a program may deadlock if the thread that owns a <tt>mutex</tt>
  object calls <tt>lock()</tt> or <tt>try_lock()</tt> on that object. If the program can
  detect the deadlock, a <tt>resource_deadlock_would_occur</tt> error condition may
! be observed. &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  is entirely correct. "or <tt>try_lock()</tt>" should be removed, because
*************** Strike 30.4.1.2.1 [thread.mutex.class] p
*** 52084,52095 ****
  Add the following note after p3 30.4.1.2.1 [thread.mutex.class]
  </p>
  
! <blockquote>
  [<i>Note:</i> a program may deadlock if the thread that owns a <tt>mutex</tt>
  object calls <tt>lock()</tt> on that object. If the implementation can detect the
  deadlock, a <tt>resource_deadlock_would_occur</tt> error condition may be
! observed. — <i>end note</i>]
! </blockquote>
  
  
  
--- 54752,54763 ----
  Add the following note after p3 30.4.1.2.1 [thread.mutex.class]
  </p>
  
! <blockquote><p>
  [<i>Note:</i> a program may deadlock if the thread that owns a <tt>mutex</tt>
  object calls <tt>lock()</tt> on that object. If the implementation can detect the
  deadlock, a <tt>resource_deadlock_would_occur</tt> error condition may be
! observed. &mdash; <i>end note</i>]
! </p></blockquote>
  
  
  
*************** observed. — <i>end note</i>]
*** 52098,52107 ****
  
  <hr>
  <h3><a name="894"></a>894. longjmp and destructors</h3>
! <p><b>Section:</b> 18.10 [support.runtime] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Lawrence Crowl, Alisdair Meredith <b>Opened:</b> 2008-09-17 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.runtime">issues</a> in [support.runtime].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The interaction between <tt>longjmp</tt> and exceptions seems unnecessarily
--- 54766,54776 ----
  
  <hr>
  <h3><a name="894"></a>894. longjmp and destructors</h3>
! <p><b>Section:</b> 18.10 [support.runtime] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Lawrence Crowl, Alisdair Meredith <b>Opened:</b> 2008-09-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#support.runtime">active issues</a> in [support.runtime].</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.runtime">issues</a> in [support.runtime].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The interaction between <tt>longjmp</tt> and exceptions seems unnecessarily
*************** restrictive and not in keeping with exis
*** 52114,52120 ****
  Edit paragraph 4 of 18.10 [support.runtime] as follows:
  </p>
  
! <blockquote>
  The function signature <tt>longjmp(jmp_buf jbuf, int val)</tt> has more
  restricted behavior in this International Standard. A
  <tt>setjmp/longjmp</tt> call pair has undefined behavior if replacing the
--- 54783,54789 ----
  Edit paragraph 4 of 18.10 [support.runtime] as follows:
  </p>
  
! <blockquote><p>
  The function signature <tt>longjmp(jmp_buf jbuf, int val)</tt> has more
  restricted behavior in this International Standard. A
  <tt>setjmp/longjmp</tt> call pair has undefined behavior if replacing the
*************** restricted behavior in this Internationa
*** 52122,52128 ****
  <tt>throw</tt> would <del>destroy</del>
  <ins>invoke any non-trivial destructors for</ins>
  any automatic objects.
! </blockquote>
  
  
  
--- 54791,54797 ----
  <tt>throw</tt> would <del>destroy</del>
  <ins>invoke any non-trivial destructors for</ins>
  any automatic objects.
! </p></blockquote>
  
  
  
*************** any automatic objects.
*** 52130,52139 ****
  
  <hr>
  <h3><a name="896"></a>896. Library thread safety issue</h3>
! <p><b>Section:</b> 20.9.10.2 [util.smartptr.shared] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2008-09-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is unclear whether <tt>shared_ptr</tt> is thread-safe in the sense that
--- 54799,54809 ----
  
  <hr>
  <h3><a name="896"></a>896. Library thread safety issue</h3>
! <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2008-09-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is unclear whether <tt>shared_ptr</tt> is thread-safe in the sense that
*************** attempts to <tt>make shared_ptr</tt> thr
*** 52207,52223 ****
  <p>
  I'd mildly prefer if
  </p>
! <blockquote>
  [<i>Note:</i> This is true in spite of that fact that such functions often
  modify <tt>use_count()</tt> <i>--end note</i>]
! </blockquote>
  <p>
  is changed to
  </p>
! <blockquote>
  [<i>Note:</i> This is true in spite of that fact that such functions often
  cause a change in <tt>use_count()</tt> <i>--end note</i>]
! </blockquote>
  <p>
  (or something along these lines) to emphasise that <tt>use_count()</tt> is not,
  conceptually, a variable, but a return value.
--- 54877,54893 ----
  <p>
  I'd mildly prefer if
  </p>
! <blockquote><p>
  [<i>Note:</i> This is true in spite of that fact that such functions often
  modify <tt>use_count()</tt> <i>--end note</i>]
! </p></blockquote>
  <p>
  is changed to
  </p>
! <blockquote><p>
  [<i>Note:</i> This is true in spite of that fact that such functions often
  cause a change in <tt>use_count()</tt> <i>--end note</i>]
! </p></blockquote>
  <p>
  (or something along these lines) to emphasise that <tt>use_count()</tt> is not,
  conceptually, a variable, but a return value.
*************** Hans to improve wording in consultation
*** 52250,52260 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready. Ask Editor to clear up wording a little when integrating to
  make it clear that the portion after the first comma only applies for
  the presence of data races.
! </blockquote>
  
  <p><i>[
  2009-10-24 Hans adds:
--- 54920,54930 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready. Ask Editor to clear up wording a little when integrating to
  make it clear that the portion after the first comma only applies for
  the presence of data races.
! </p></blockquote>
  
  <p><i>[
  2009-10-24 Hans adds:
*************** doesn't say the right thing.
*** 52271,52283 ****
  I suspect we really want to say something along the lines of:
  </p>
  
! <blockquote>
  For purposes of determining the presence of a data race, member
  functions access and modify only the <tt>shared_ptr</tt> and
  <tt>weak_ptr</tt> objects themselves and not objects they refer to.
  Changes in <tt>use_count()</tt> do not reflect modifications that can
  introduce data races.
! </blockquote>
  
  <p>
  But I think this needs further discussion by experts to make sure this
--- 54941,54953 ----
  I suspect we really want to say something along the lines of:
  </p>
  
! <blockquote><p>
  For purposes of determining the presence of a data race, member
  functions access and modify only the <tt>shared_ptr</tt> and
  <tt>weak_ptr</tt> objects themselves and not objects they refer to.
  Changes in <tt>use_count()</tt> do not reflect modifications that can
  introduce data races.
! </p></blockquote>
  
  <p>
  But I think this needs further discussion by experts to make sure this
*************** and preserved the previous wording here:
*** 52309,52315 ****
  Make it explicitly thread-safe, in this weak sense, as I believe was intended:
  </p>
  <p>
! Insert in 20.9.10.2 [util.smartptr.shared], before p5:
  </p>
  <blockquote>
  <p>
--- 54979,54985 ----
  Make it explicitly thread-safe, in this weak sense, as I believe was intended:
  </p>
  <p>
! Insert in 20.8.2.2 [util.smartptr.shared], before p5:
  </p>
  <blockquote>
  <p>
*************** anywhere else, since nothing else has th
*** 52338,52380 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Insert a new paragraph at the end of 20.9.10.2 [util.smartptr.shared]:
  </p>
  
! <blockquote>
  For purposes of determining the presence of a data race, member functions access
  and modify only the <tt>shared_ptr</tt> and <tt>weak_ptr</tt> objects themselves
  and not objects they refer to. Changes in <tt>use_count()</tt> do not reflect
  modifications that can introduce data races.
  </blockquote>
  
  
  
  
  
  <hr>
  <h3><a name="898"></a>898. Small contradiction in n2723 to forward to committee</h3>
! <p><b>Section:</b> 23.3.3.5 [forwardlist.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Arch Robison <b>Opened:</b> 2008-09-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I ran across a small contradiction in working draft n2723. 
  </p>
  <blockquote>
  <p>
! 23.3.3 [forwardlist]p2: A <tt>forward_list</tt> satisfies all of the
  requirements of a container (table 90), except that the <tt>size()</tt> member
  function is not provided.
  </p>
  <p>
! 23.3.3.5 [forwardlist.ops]p57: <i>Complexity:</i> At most <tt>size() + x.size() - 1</tt>
  comparisons.
  </p>
  </blockquote>
  <p>
! Presumably 23.3.3.5 [forwardlist.ops]p57 needs to be rephrased to not use
  <tt>size()</tt>, or note that it is used there only for sake of notational convenience. 
  </p>
  
--- 55008,55389 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Insert a new paragraph at the end of 20.8.2.2 [util.smartptr.shared]:
  </p>
  
! <blockquote><p>
  For purposes of determining the presence of a data race, member functions access
  and modify only the <tt>shared_ptr</tt> and <tt>weak_ptr</tt> objects themselves
  and not objects they refer to. Changes in <tt>use_count()</tt> do not reflect
  modifications that can introduce data races.
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="897"></a>897. Forward_list issues... Part 2</h3>
+ <p><b>Section:</b> 23.3.4.5 [forwardlist.modifiers] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-09-22 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#forwardlist.modifiers">issues</a> in [forwardlist.modifiers].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ This issue was split off from <a href="lwg-closed.html#892">892</a> at the request of the LWG.
+ </p>
+ 
+ <p><i>[
+ San Francisco:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ This issue is more complicated than it looks.
+ </p>
+ <p>
+ paragraph 47: replace each <tt>(first, last) with (first, last]</tt>
+ </p>
+ <p>
+ add a statement after paragraph 48 that complexity is O(1)
+ </p>
+ <p>
+ remove the complexity statement from the first overload of splice_after
+ </p>
+ <p>
+ We may have the same problems with other modifiers, like erase_after.
+ Should it require that all iterators in the range (position, last] be
+ dereferenceable?
+ </p>
+ </blockquote>
+ 
+ <p>
+ There are actually 3 issues here:
+ </p>
+ 
+ <ol>
+ <li>
+ <p>
+ What value should <tt>erase_after</tt> return?  With <tt>list</tt>, code often
+ looks like:
+ </p>
+ <blockquote><pre>
+ for (auto i = l.begin(); i != l.end();)
+ {
+     // inspect *i and decide if you want to erase it
+     // ...
+     if (I want to erase *i)
+         i = l.erase(i);
+     else
+         ++i;
+ }
+ </pre></blockquote>
+ <p>
+ I.e. the iterator returned from <tt>erase</tt> is useful for setting up the
+ logic for operating on the next element.  For <tt>forward_list</tt> this might
+ look something like:
+ </p>
+ <blockquote><pre>
+ auto i = fl.before_begin();
+ auto ip1 = i;
+ for (++ip1; ip1 != fl.end(); ++ip1)
+ {
+     // inspect *(i+1) and decide if you want to erase it
+     // ...
+     if (I want to erase *(i+1))
+         i = fl.erase_after(i);
+     else
+         ++i;
+     ip1 = i;
+ }
+ </pre></blockquote>
+ <p>
+ In the above example code, it is convenient if <tt>erase_after</tt> returns
+ the element <i>prior</i> to the erased element (range) instead of the element
+ <i>after</i> the erase element (range).
+ </p>
+ <p>
+ Existing practice:
+ </p>
+ <ul>
+ <li>SGI slist returns an iterator referencing the element <i>after</i> the erased range.</li>
+ <li>CodeWarrior slist returns an iterator referencing the element <i>before</i> the erased range.</li>
+ </ul>
+ <p>
+ There is not a strong technical argument for either solution over the other.
+ </p>
+ </li>
+ 
+ <li>
+ <p>
+ With all other containers, operations always work on the range
+ <tt>[first, last)</tt> and/or <i>prior to</i> the given <tt>position</tt>.
+ </p>
+ <p>
+ With <tt>forward_list</tt>, operations sometimes work on the range
+ <tt>(first, last]</tt> and/or <i>after</i> the given <tt>position</tt>.
+ </p>
+ <p>
+ This is simply due to the fact that in order to operate on
+ <tt>*first</tt> (with <tt>forward_list</tt>) one needs access to
+ <tt>*(first-1)</tt>.  And that's not practical with
+ <tt>forward_list</tt>.  So the operating range needs to start with <tt>(first</tt>,
+ not <tt>[first</tt> (as the current working paper says). 
+ </p>
+ <p>
+ Additionally, if one is interested in  splicing the range <tt>(first, last)</tt>,
+ then (with <tt>forward_list</tt>), one needs practical (constant time) access to
+ <tt>*(last-1)</tt> so that one can set the <i>next</i> field in this node to
+ the proper value.  As this is not possible with <tt>forward_list</tt>, one must
+ specify the last element of interest instead of one past the last element of
+ interest.  The syntax for doing this is to pass <tt>(first, last]</tt> instead
+ of <tt>(first, last)</tt>.
+ </p>
+ <p>
+ With <tt>erase_after</tt> we have a choice of either erasing the range
+ <tt>(first, last]</tt> <em>or</em> <tt>(first, last)</tt>.  Choosing the latter
+ enables:
+ </p>
+ <blockquote><pre>
+ x.erase_after(pos, x.end());
+ </pre></blockquote>
+ 
+ <p>
+ With the former, the above statement is inconvenient or expensive due to the lack
+ of constant time access to <tt>x.end()-1</tt>.  However we could introduce:
+ </p>
+ 
+ <blockquote><pre>
+ iterator erase_to_end(const_iterator position);
+ </pre></blockquote>
+ 
+ <p>
+ to compensate.
+ </p>
+ 
+ <p>
+ The advantage of the former (<tt>(first, last]</tt>) for <tt>erase_after</tt>
+ is a consistency with <tt>splice_after</tt> which uses <tt>(first, last]</tt>
+ as the specified range.  But this either requires the addition of <tt>erase_to_end</tt>
+ or giving up such functionality.
+ </p>
+ 
+ </li>
+ 
+ <li>
+ As stated in the discussion of <a href="lwg-closed.html#892">892</a>, and reienforced by point 2 above,
+ a <tt>splice_after</tt> should work on the source range <tt>(first, last]</tt>
+ if the operation is to be <i>&#927;</i>(1).  When splicing an entire list <tt>x</tt> the
+ algorithm needs <tt>(x.before_begin(), x.end()-1]</tt>.  Unfortunately <tt>x.end()-1</tt>
+ is not available in constant time unless we specify that it must be.  In order to
+ make <tt>x.end()-1</tt> available in constant time, the implementation would have
+ to dedicate a pointer to it.  I believe the design of
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2543.htm">N2543</a>
+ intended a nominal overhead of <tt>foward_list</tt> of 1 pointer.  Thus splicing
+ one <i>entire</i> <tt>forward_list</tt> into another can not be <i>&#927;</i>(1).
+ </li>
+ </ol>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote>
+ <p>
+ We agree with the proposed resolution.
+ </p>
+ <p>
+ Move to Review.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ We may need a new issue to correct splice_after, because it may no
+ longer be correct to accept an rvalues as an argument. Merge may be
+ affected, too. This might be issue <a href="lwg-defects.html#1133">1133</a>. (Howard: confirmed)
+ </p>
+ <p>
+ Move this to Ready, but the Requires clause of the second form of
+ splice_after should say "(first, last)," not "(first, last]" (there are
+ three occurrences). There was considerable discussion on this. (Howard: fixed)
+ </p>
+ <p>
+ Alan suggested removing the "foward_last&lt;T. Alloc&gt;&amp;&amp; x"
+ parameter from the second form of splice_after, because it is redundant.
+ PJP wanted to keep it, because it allows him to check for bad ranges
+ (i.e. "Granny knots").
+ </p>
+ <p>
+ We prefer to keep <tt>x</tt>.
+ </p>
+ <p>
+ Beman. Whenever we deviate from the customary half-open range in the
+ specification, we should add a non-normative comment to the standard
+ explaining the deviation. This clarifies the intention and spares the
+ committee much confusion in the future.
+ </p>
+ <p>
+ Alan to write a non-normative comment to explain the use of fully-closed ranges.
+ </p>
+ <p>
+ Move to Ready, with the changes described above. (Howard: awaiting note from Alan)
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>, addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2988.pdf">N2988</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Wording below assumes issue <a href="lwg-defects.html#878">878</a> is accepted, but this issue is
+ independent of that issue.
+ </p>
+ 
+ <p>
+ Change 23.3.4.5 [forwardlist.modifiers]:
+ </p>
+ 
+ <blockquote>
+ <pre>
+ iterator erase_after(const_iterator position);
+ </pre>
+ <blockquote>
+ <p>
+ <i>Requires:</i> The iterator following <tt>position</tt> is dereferenceable.
+ </p>
+ <p>
+ <i>Effects:</i> Erases the element pointed to by the iterator following <tt>position</tt>.
+ </p>
+ <p>
+ <i>Returns:</i> <del>An iterator pointing to the element following the one that was erased, or <tt>end()</tt> if no such 
+ element exists</del>
+ <ins>An iterator equal to <tt>position</tt></ins>.
+ </p>
+ </blockquote>
+ 
+ 
+ <pre>
+ iterator erase_after(const_iterator position, <ins>const_</ins>iterator last);
+ </pre>
+ <blockquote>
+ <p>
+ <i>Requires:</i> All iterators in the range
+ <tt><del>[</del><ins>(</ins>position,last)</tt>
+ are dereferenceable.
+ </p>
+ <p>
+ <i>Effects:</i> Erases the elements in the range
+ <tt><del>[</del><ins>(</ins>position,last)</tt>.
+ </p>
+ <p>
+ <i>Returns:</i>  <ins>An iterator equal to <tt>position</tt></ins> <del><tt>last</tt></del>
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ <p>
+ Change 23.3.4.6 [forwardlist.ops]:
+ </p>
+ 
+ <blockquote>
+ <pre>
+ void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp;&amp; x);
+ </pre>
+ <blockquote>
+ <p>
+ <i>Requires:</i> <tt>position</tt> is <tt>before_begin()</tt> or a
+ dereferenceable iterator in the range <tt>[begin(), end))</tt>. <tt>&amp;x != this</tt>.
+ </p>
+ <p>
+ <i>Effects:</i> Inserts the contents of <tt>x</tt> after <tt>position</tt>, and
+ <tt>x</tt> becomes empty. Pointers and references to 
+ the moved elements of <tt>x</tt> now refer to those same elements but as members of <tt>*this</tt>.
+ Iterators referring to the moved elements will continue to refer to their elements,
+ but they now behave as iterators into <tt>*this</tt>, not into <tt>x</tt>. 
+ </p>
+ <p>
+ <i>Throws:</i> Nothing. 
+ </p>
+ <p>
+ <i>Complexity:</i> <del><i>&#927;</i>(1)</del> <ins><i>&#927;</i>(<tt>distance(x.begin(), x.end())</tt>)</ins>
+ </p>
+ </blockquote>
+ 
+ <p>...</p>
+ 
+ <pre>
+ void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp;&amp; x, 
+                   const_iterator first, const_iterator last);
+ </pre>
+ <blockquote>
+ <p>
+ <i>Requires:</i> <tt>position</tt> is <tt>before_begin()</tt> or a
+ dereferenceable iterator in the range <tt>[begin(), end))</tt>.
+ <tt>(first,last)</tt> is a valid range in
+ <tt>x</tt>, and all iterators in the range
+ <tt>(first,last)</tt> are dereferenceable.
+ <tt>position</tt> is not an iterator in the range <tt>(first,last)</tt>.
+ </p>
+ <p>
+ <i>Effects:</i> Inserts elements in the range <tt>(first,last)</tt>
+ after <tt>position</tt> and removes the elements from <tt>x</tt>.
+ Pointers and references to the moved elements of <tt>x</tt> now refer to
+ those same elements but as members of <tt>*this</tt>. Iterators
+ referring to the moved elements will continue to refer to their
+ elements, but they now behave as iterators into <tt>*this</tt>, not into
+ <tt>x</tt>.
+ </p>
+ <p>
+ <ins><i>Complexity:</i> <i>&#927;</i>(1).</ins>
+ </p>
  </blockquote>
  
+ </blockquote>
+ 
+ 
  
  
  
  
  <hr>
  <h3><a name="898"></a>898. Small contradiction in n2723 to forward to committee</h3>
! <p><b>Section:</b> 23.3.4.6 [forwardlist.ops] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Arch Robison <b>Opened:</b> 2008-09-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I ran across a small contradiction in working draft n2723. 
  </p>
  <blockquote>
  <p>
! 23.3.4 [forwardlist]p2: A <tt>forward_list</tt> satisfies all of the
  requirements of a container (table 90), except that the <tt>size()</tt> member
  function is not provided.
  </p>
  <p>
! 23.3.4.6 [forwardlist.ops]p57: <i>Complexity:</i> At most <tt>size() + x.size() - 1</tt>
  comparisons.
  </p>
  </blockquote>
  <p>
! Presumably 23.3.4.6 [forwardlist.ops]p57 needs to be rephrased to not use
  <tt>size()</tt>, or note that it is used there only for sake of notational convenience. 
  </p>
  
*************** Move to Tentatively Ready.
*** 52398,52410 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p><i>Change 23.3.3.5 [forwardlist.ops],
  forward_list operations, paragraph 19, merge complexity as indicated:
  </i></p>
! <blockquote><i>Complexity:</i> At most <tt><del>size() + x.size()</del>
  <ins>distance(begin(), end()) + distance(x.begin(), x.end())</ins> - 1</tt>
  comparisons.
! </blockquote>
  
  
  
--- 55407,55420 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p><i>Change 23.3.4.6 [forwardlist.ops],
  forward_list operations, paragraph 19, merge complexity as indicated:
  </i></p>
! <blockquote><p>
! <i>Complexity:</i> At most <tt><del>size() + x.size()</del>
  <ins>distance(begin(), end()) + distance(x.begin(), x.end())</ins> - 1</tt>
  comparisons.
! </p></blockquote>
  
  
  
*************** comparisons.
*** 52412,52454 ****
  
  <hr>
  <h3><a name="899"></a>899. Adjusting <tt>shared_ptr</tt> for <tt>nullptr_t</tt></h3>
! <p><b>Section:</b> 20.9.10.2.2 [util.smartptr.shared.dest] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-09-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.dest">issues</a> in [util.smartptr.shared.dest].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  James Dennett, message c++std-lib-22442:
  </p>
! <blockquote>
  The wording below addresses one case of this, but opening an
  issue to address the need to sanity check uses of the term "pointer"
! in 20.9.10.2 [util.smartptr.shared] would be a good thing.
! </blockquote>
  <p>
  There's one more reference, in <tt>~shared_ptr;</tt> we can apply your suggested change to it, too. That is:
  </p>
  <p>
! Change 20.9.10.2.2 [util.smartptr.shared.dest]/1 second bullet from:
  </p>
! <blockquote>
  Otherwise, if *this owns a pointer p and a deleter d, d(p) is called.
! </blockquote>
  <p>
  to:
  </p>
! <blockquote>
  Otherwise, if *this owns an object p and a deleter d, d(p) is called.
! </blockquote>
  
  <p><i>[
  Post Summit:
  ]</i></p>
  
  
! <blockquote>
  Recommend Review.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
--- 55422,55464 ----
  
  <hr>
  <h3><a name="899"></a>899. Adjusting <tt>shared_ptr</tt> for <tt>nullptr_t</tt></h3>
! <p><b>Section:</b> 20.8.2.2.2 [util.smartptr.shared.dest] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2008-09-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.dest">issues</a> in [util.smartptr.shared.dest].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  James Dennett, message c++std-lib-22442:
  </p>
! <blockquote><p>
  The wording below addresses one case of this, but opening an
  issue to address the need to sanity check uses of the term "pointer"
! in 20.8.2.2 [util.smartptr.shared] would be a good thing.
! </p></blockquote>
  <p>
  There's one more reference, in <tt>~shared_ptr;</tt> we can apply your suggested change to it, too. That is:
  </p>
  <p>
! Change 20.8.2.2.2 [util.smartptr.shared.dest]/1 second bullet from:
  </p>
! <blockquote><p>
  Otherwise, if *this owns a pointer p and a deleter d, d(p) is called.
! </p></blockquote>
  <p>
  to:
  </p>
! <blockquote><p>
  Otherwise, if *this owns an object p and a deleter d, d(p) is called.
! </p></blockquote>
  
  <p><i>[
  Post Summit:
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Review.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
*************** Batavia (2009-05):
*** 52457,52464 ****
  <blockquote>
  <p>
  Peter Dimov notes the analogous change has already been made
! to "the new nullptr_t taking constructors
! in 20.9.10.2.1 [util.smartptr.shared.const] p9-13."
  </p>
  <p>
  We agree with the proposed resolution.
--- 55467,55474 ----
  <blockquote>
  <p>
  Peter Dimov notes the analogous change has already been made
! to "the new <tt>nullptr_t</tt> taking constructors
! in 20.8.2.2.1 [util.smartptr.shared.const] p9-13."
  </p>
  <p>
  We agree with the proposed resolution.
*************** Move to Tentatively Ready.
*** 52469,52475 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.10.2.2 [util.smartptr.shared.dest]/1 second bullet:
  </p>
  <blockquote>
  <ul>
--- 55479,55485 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.2.2.2 [util.smartptr.shared.dest] p1 second bullet:
  </p>
  <blockquote>
  <ul>
*************** deleter <tt>d</tt>, <tt>d(p)</tt> is cal
*** 52487,52524 ****
  
  
  <hr>
! <h3><a name="900"></a>900. stream move-assignment</h3>
! <p><b>Section:</b> 27.9.1.8 [ifstream.assign] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-09-20 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! It
! appears that we have an issue similar to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#675">675</a> regarding the move-assignment of
! stream types. For example, when assigning to an <tt>std::ifstream</tt>,
! <tt>ifstream1</tt>, it seems preferable to close the file originally held by
! <tt>ifstream1</tt>:
  </p>
  
! <blockquote><pre>ifstream1 = std::move(ifstream2); 
  </pre></blockquote>
  
  <p>
  The current Draft
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>)
! specifies that the move-assignment of
! stream types like <tt>ifstream</tt> has the same effect as a swap:
  </p>
  
  <blockquote>
  <p>
  Assign and swap 27.9.1.8 [ifstream.assign]
  </p>
! <pre>basic_ifstream&amp; operator=(basic_ifstream&amp;&amp; rhs); 
  </pre>
! <blockquote>
  <i>Effects:</i> <tt>swap(rhs)</tt>.
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 55497,55534 ----
  
  
  <hr>
! <h3><a name="900"></a>900. Stream move-assignment</h3>
! <p><b>Section:</b> 27.9.1.8 [ifstream.assign] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2008-09-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! It appears that we have an issue similar to issue <a href="lwg-defects.html#675">675</a> regarding the move-assignment of
! stream types. For example, when assigning to an <tt>std::ifstream</tt>, <tt>ifstream1</tt>, it 
! seems preferable to close the file originally held by <tt>ifstream1</tt>:
  </p>
  
! <blockquote><pre>
! ifstream1 = std::move(ifstream2); 
  </pre></blockquote>
  
  <p>
  The current Draft
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>)
! specifies that the move-assignment of stream types like <tt>ifstream</tt> has the 
! same effect as a swap:
  </p>
  
  <blockquote>
  <p>
  Assign and swap 27.9.1.8 [ifstream.assign]
  </p>
! <pre>
! basic_ifstream&amp; operator=(basic_ifstream&amp;&amp; rhs); 
  </pre>
! <blockquote><p>
  <i>Effects:</i> <tt>swap(rhs)</tt>.
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** Move to Open pending specific wording to
*** 52539,52547 ****
  ]</i></p>
  
  
! <blockquote>
  Howard is going to write wording.
! </blockquote>
  
  <p><i>[
  2009-07-26 Howard provided wording.
--- 55549,55557 ----
  ]</i></p>
  
  
! <blockquote><p>
  Howard is going to write wording.
! </p></blockquote>
  
  <p><i>[
  2009-07-26 Howard provided wording.
*************** Howard is going to write wording.
*** 52553,52696 ****
  ]</i></p>
  
  
! <blockquote>
! Note: The proposed change of 27.9.1.3 [filebuf.assign]/1 depends on the
! resolution of LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1204">1204</a>, which allows implementations to assume that
  <tt>*this</tt> and <tt>rhs</tt> refer to different objects.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! Leave as Open.  Too closely related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#911">911</a> to move on at this time.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready for Pittsburgh.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 27.8.1.2 [stringbuf.assign]/1:
  </p>
  
! <blockquote><pre>basic_stringbuf&amp; operator=(basic_stringbuf&amp;&amp; rhs);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>After the move assignment <tt>*this</tt> reflects the same observable
  state it would have if it had been move constructed from <tt>rhs</tt>
! (27.8.1.1 [stringbuf.cons]).
  </ins>
! </blockquote>
  </blockquote>
  
  <p>
! Change 27.8.2.2 [istringstream.assign]/1:
  </p>
  
! <blockquote><pre>basic_istringstream&amp; operator=(basic_istringstream&amp;&amp; rhs);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.
  </ins>
! </blockquote>
  </blockquote>
  
  <p>
! Change 27.8.3.2 [ostringstream.assign]/1:
  </p>
  
! <blockquote><pre>basic_ostringstream&amp; operator=(basic_ostringstream&amp;&amp; rhs);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.
  </ins>
! </blockquote>
  </blockquote>
  
  <p>
! Change 27.8.5.1 [stringstream.assign]/1:
  </p>
  
! <blockquote><pre>basic_stringstream&amp; operator=(basic_stringstream&amp;&amp; rhs);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.
  </ins>
! </blockquote>
  </blockquote>
  
  <p>
  Change 27.9.1.3 [filebuf.assign]/1:
  </p>
  
! <blockquote><pre>basic_filebuf&amp; operator=(basic_filebuf&amp;&amp; rhs);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Begins by calling <tt>this-&gt;close()</tt>.
  After the move assignment <tt>*this</tt> reflects the same observable
  state it would have if it had been move constructed from <tt>rhs</tt>
  (27.9.1.2 [filebuf.cons]).
  </ins>
! </blockquote>
  </blockquote>
  
  <p>
  Change 27.9.1.8 [ifstream.assign]/1:
  </p>
  
! <blockquote><pre>basic_ifstream&amp; operator=(basic_ifstream&amp;&amp; rhs);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.</ins>
! </blockquote>
  </blockquote>
  
  <p>
  Change 27.9.1.12 [ofstream.assign]/1:
  </p>
  
! <blockquote><pre>basic_ofstream&amp; operator=(basic_ofstream&amp;&amp; rhs);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.</ins>
! </blockquote>
  </blockquote>
  
  <p>
  Change 27.9.1.16 [fstream.assign]/1:
  </p>
  
! <blockquote><pre>basic_fstream&amp; operator=(basic_fstream&amp;&amp; rhs);
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.</ins>
! </blockquote>
  </blockquote>
  
  
--- 55563,55714 ----
  ]</i></p>
  
  
! <blockquote><p>
! Note: The proposed change of 27.9.1.3 [filebuf.assign] p1 depends on the
! resolution of LWG <a href="lwg-defects.html#1204">1204</a>, which allows implementations to assume that
  <tt>*this</tt> and <tt>rhs</tt> refer to different objects.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! Leave as Open.  Too closely related to <a href="lwg-defects.html#911">911</a> to move on at this time.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready for Pittsburgh.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 27.8.2.2 [stringbuf.assign]/1:
  </p>
  
! <blockquote><pre>
! basic_stringbuf&amp; operator=(basic_stringbuf&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>After the move assignment <tt>*this</tt> reflects the same observable
  state it would have if it had been move constructed from <tt>rhs</tt>
! (27.8.2.1 [stringbuf.cons]).
  </ins>
! </p></blockquote>
  </blockquote>
  
  <p>
! Change 27.8.3.2 [istringstream.assign]/1:
  </p>
  
! <blockquote><pre>
! basic_istringstream&amp; operator=(basic_istringstream&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.
  </ins>
! </p></blockquote>
  </blockquote>
  
  <p>
! Change 27.8.4.2 [ostringstream.assign]/1:
  </p>
  
! <blockquote><pre>
! basic_ostringstream&amp; operator=(basic_ostringstream&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.
  </ins>
! </p></blockquote>
  </blockquote>
  
  <p>
! Change 27.8.5.2 [stringstream.assign]/1:
  </p>
  
! <blockquote><pre>
! basic_stringstream&amp; operator=(basic_stringstream&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.
  </ins>
! </p></blockquote>
  </blockquote>
  
  <p>
  Change 27.9.1.3 [filebuf.assign]/1:
  </p>
  
! <blockquote><pre>
! basic_filebuf&amp; operator=(basic_filebuf&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Begins by calling <tt>this-&gt;close()</tt>.
  After the move assignment <tt>*this</tt> reflects the same observable
  state it would have if it had been move constructed from <tt>rhs</tt>
  (27.9.1.2 [filebuf.cons]).
  </ins>
! </p></blockquote>
  </blockquote>
  
  <p>
  Change 27.9.1.8 [ifstream.assign]/1:
  </p>
  
! <blockquote><pre>
! basic_ifstream&amp; operator=(basic_ifstream&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.</ins>
! </p></blockquote>
  </blockquote>
  
  <p>
  Change 27.9.1.12 [ofstream.assign]/1:
  </p>
  
! <blockquote><pre>
! basic_ofstream&amp; operator=(basic_ofstream&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.</ins>
! </p></blockquote>
  </blockquote>
  
  <p>
  Change 27.9.1.16 [fstream.assign]/1:
  </p>
  
! <blockquote><pre>
! basic_fstream&amp; operator=(basic_fstream&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <del><tt>swap(rhs)</tt>.</del>
  <ins>Move assigns the base and members of <tt>*this</tt> with the respective
  base and members of <tt>rhs</tt>.</ins>
! </p></blockquote>
  </blockquote>
  
  
*************** base and members of <tt>rhs</tt>.</ins>
*** 52699,52728 ****
  
  
  <hr>
! <h3><a name="904"></a>904. result_of argument types</h3>
! <p><b>Section:</b> X [func.ret] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2008-09-10 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.ret">issues</a> in [func.ret].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The WP and TR1 have the same text regarding the argument types of a
  <tt>result_of</tt> expression:
  </p>
! <blockquote>
  The values <tt>ti</tt> are lvalues when the corresponding type <tt>Ti</tt> is a
  reference type, and rvalues otherwise.
! </blockquote>
  <p>
  I read this to mean that this compiles:
  </p>
! <blockquote><pre>typedef int (*func)(int&amp;);
  result_of&lt;func(int&amp;&amp;)&gt;::type i = 0;
  </pre></blockquote>
  <p>
  even though this doesn't:
  </p>
! <blockquote><pre>int f(int&amp;);
  f( std::move(0) );
  </pre></blockquote>
  <p>
--- 55717,55748 ----
  
  
  <hr>
! <h3><a name="904"></a>904. <tt>result_of</tt> argument types</h3>
! <p><b>Section:</b> X [func.ret] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2008-09-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.ret">issues</a> in [func.ret].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The WP and TR1 have the same text regarding the argument types of a
  <tt>result_of</tt> expression:
  </p>
! <blockquote><p>
  The values <tt>ti</tt> are lvalues when the corresponding type <tt>Ti</tt> is a
  reference type, and rvalues otherwise.
! </p></blockquote>
  <p>
  I read this to mean that this compiles:
  </p>
! <blockquote><pre>
! typedef int (*func)(int&amp;);
  result_of&lt;func(int&amp;&amp;)&gt;::type i = 0;
  </pre></blockquote>
  <p>
  even though this doesn't:
  </p>
! <blockquote><pre>
! int f(int&amp;);
  f( std::move(0) );
  </pre></blockquote>
  <p>
*************** type" or am I missing something?
*** 52733,52739 ****
  I later came up with this self-contained example which won't compile,
  but I think it should:
  </p>
! <blockquote><pre>struct X {
    void operator()(int&amp;);
    int operator()(int&amp;&amp;);
  } x;
--- 55753,55760 ----
  I later came up with this self-contained example which won't compile,
  but I think it should:
  </p>
! <blockquote><pre>
! struct X {
    void operator()(int&amp;);
    int operator()(int&amp;&amp;);
  } x;
*************** Post Summit:
*** 52746,52754 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend Tentatively Ready.
! </blockquote>
  
  
  
--- 55767,55775 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Tentatively Ready.
! </p></blockquote>
  
  
  
*************** Recommend Tentatively Ready.
*** 52757,52767 ****
  Change X [func.ret], p1:
  </p>
  
! <blockquote>
  ... The values <tt>ti</tt> are lvalues 
  when the corresponding type <tt>Ti</tt> is a<ins>n</ins> <ins>lvalue-</ins>reference type,
  and rvalues otherwise. 
! </blockquote>
  
  
  
--- 55778,55788 ----
  Change X [func.ret], p1:
  </p>
  
! <blockquote><p>
  ... The values <tt>ti</tt> are lvalues 
  when the corresponding type <tt>Ti</tt> is a<ins>n</ins> <ins>lvalue-</ins>reference type,
  and rvalues otherwise. 
! </p></blockquote>
  
  
  
*************** and rvalues otherwise.
*** 52769,52791 ****
  
  <hr>
  <h3><a name="907"></a>907. Bitset's immutable element retrieval is inconsistently defined</h3>
! <p><b>Section:</b> 20.5.2 [bitset.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-09-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitset.members">issues</a> in [bitset.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current standard 14882::2003(E) as well as the current draft
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
! have in common a contradiction of the operational semantics
! of member function test 20.5.2 [bitset.members]/56-58 and the immutable
! member <tt>operator[]</tt> overload 20.5.2 [bitset.members]/64-66 (all references
  are defined in terms of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>):
  </p>
  
  <ol>
! <li><pre>bool test(size_t pos) const;
  </pre>
  <blockquote>
  <p>
--- 55790,55813 ----
  
  <hr>
  <h3><a name="907"></a>907. Bitset's immutable element retrieval is inconsistently defined</h3>
! <p><b>Section:</b> 20.6.2 [bitset.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-09-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitset.members">issues</a> in [bitset.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current standard 14882::2003(E) as well as the current draft
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
! have in common a contradiction of the operational semantics of member function 
! <tt>test</tt> 20.6.2 [bitset.members] p.56-58 and the immutable
! member <tt>operator[]</tt> overload 20.6.2 [bitset.members] p.64-66 (all references
  are defined in terms of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>):
  </p>
  
  <ol>
! <li><pre>
! bool test(size_t pos) const;
  </pre>
  <blockquote>
  <p>
*************** has the value one.
*** 52801,52807 ****
  </p>
  </blockquote>
  </li>
! <li><pre>constexpr bool operator[](size_t pos) const;
  </pre>
  <blockquote>
  <p>
--- 55823,55830 ----
  </p>
  </blockquote>
  </li>
! <li><pre>
! constexpr bool operator[](size_t pos) const;
  </pre>
  <blockquote>
  <p>
*************** has the value one.
*** 52821,52833 ****
  Three interpretations:
  </p>
  
! <ol type="A">
  <li>
  The <tt>operator[]</tt> overload is indeed allowed to throw an exception
  (via <tt>test()</tt>, if <tt>pos</tt> corresponds to an invalid bit position) which does
  not leave the call frame. In this case this function cannot be a
  <tt>constexpr</tt> function, because <tt>test()</tt> is not, due to
! 5.19 [expr.const]/2, last bullet.
  </li>
  <li>
  The intend was not to throw an exception in <tt>test</tt> in case of an
--- 55844,55856 ----
  Three interpretations:
  </p>
  
! <ol style="list-style-type:upper-alpha">
  <li>
  The <tt>operator[]</tt> overload is indeed allowed to throw an exception
  (via <tt>test()</tt>, if <tt>pos</tt> corresponds to an invalid bit position) which does
  not leave the call frame. In this case this function cannot be a
  <tt>constexpr</tt> function, because <tt>test()</tt> is not, due to
! 5.20 [expr.const]/2, last bullet.
  </li>
  <li>
  The intend was not to throw an exception in <tt>test</tt> in case of an
*************** is invalid.
*** 52841,52847 ****
  </ol>
  
  <p>
! The problem became worse, because issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>
  recently voted into WP argued that member <tt>test</tt> logically must be
  a <tt>constexpr</tt> function, because it was used to define the semantics
  of another <tt>constexpr</tt> function (the <tt>operator[]</tt> overload).
--- 55864,55870 ----
  </ol>
  
  <p>
! The problem became worse, because issue <a href="lwg-defects.html#720">720</a>
  recently voted into WP argued that member <tt>test</tt> logically must be
  a <tt>constexpr</tt> function, because it was used to define the semantics
  of another <tt>constexpr</tt> function (the <tt>operator[]</tt> overload).
*************** Three alternatives are proposed, corresp
*** 52852,52870 ****
  (A), (B), and (C), the author suggests to follow proposal (C).
  </p>
  
! <b>
  Proposed alternatives:
! </b>
  
! <ol type="A">
  <li>
  <p>
  Remove the <tt>constexpr</tt> specifier in front of <tt>operator[]</tt> overload and
! undo that of member <tt>test</tt> (assuming <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a> is accepted) in both the
! class declaration 20.5 [template.bitset]/1 and in the member description
! before 20.5.2 [bitset.members]/56 and before /64 to read:
  </p>
! <blockquote><pre><del>constexpr</del> bool test(size_t pos) const;
  ..
  <del>constexpr</del> bool operator[](size_t pos) const;
  </pre></blockquote>
--- 55875,55894 ----
  (A), (B), and (C), the author suggests to follow proposal (C).
  </p>
  
! <p><b>
  Proposed alternatives:
! </b></p>
  
! <ol style="list-style-type:upper-alpha">
  <li>
  <p>
  Remove the <tt>constexpr</tt> specifier in front of <tt>operator[]</tt> overload and
! undo that of member <tt>test</tt> (assuming <a href="lwg-defects.html#720">720</a> is accepted) in both the
! class declaration 20.6 [template.bitset]/1 and in the member description
! before 20.6.2 [bitset.members]/56 and before /64 to read:
  </p>
! <blockquote><pre>
! <del>constexpr</del> bool test(size_t pos) const;
  ..
  <del>constexpr</del> bool operator[](size_t pos) const;
  </pre></blockquote>
*************** before 20.5.2 [bitset.members]/56 and be
*** 52873,52913 ****
  Change the throws clause of p. 65 to read:
  </p>
  
! <blockquote>
  <i>Throws:</i> <del>nothing</del>
  <ins><tt>out_of_range</tt> if <tt>pos</tt> does not correspond to a valid bit
  position</ins>.
! </blockquote>
  </li>
  <li>
  <p>
  Replace the throws clause p. 57 to read:
  </p>
  
! <blockquote>
  <i>Throws:</i> <del><tt>out_of_range</tt> if <tt>pos</tt> does not correspond to a valid bit
  position</del> <ins>nothing</ins>.
! </blockquote>
  </li>
  <li>
  <p>
  Undo the addition of the <tt>constexpr</tt> specifier to the <tt>test</tt> member
! function in both class declaration 20.5 [template.bitset]/1 and in the
! member description before 20.5.2 [bitset.members]/56, assuming that <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>
  was applied.
  </p>
  
! <blockquote><pre><del>constexpr</del> bool test(size_t pos) const;
  </pre></blockquote>
  
  <p>
  Change the returns clause p. 66 to read:
  </p>
  
! <blockquote>
  <i>Returns:</i> <del><tt>test(pos)</tt></del> <ins><tt>true</tt> if the bit at position <tt>pos</tt> in <tt>*this</tt>
  has the value one, otherwise <tt>false</tt></ins>.
! </blockquote>
  </li>
  </ol>
  
--- 55897,55938 ----
  Change the throws clause of p. 65 to read:
  </p>
  
! <blockquote><p>
  <i>Throws:</i> <del>nothing</del>
  <ins><tt>out_of_range</tt> if <tt>pos</tt> does not correspond to a valid bit
  position</ins>.
! </p></blockquote>
  </li>
  <li>
  <p>
  Replace the throws clause p. 57 to read:
  </p>
  
! <blockquote><p>
  <i>Throws:</i> <del><tt>out_of_range</tt> if <tt>pos</tt> does not correspond to a valid bit
  position</del> <ins>nothing</ins>.
! </p></blockquote>
  </li>
  <li>
  <p>
  Undo the addition of the <tt>constexpr</tt> specifier to the <tt>test</tt> member
! function in both class declaration 20.6 [template.bitset]/1 and in the
! member description before 20.6.2 [bitset.members]/56, assuming that <a href="lwg-defects.html#720">720</a>
  was applied.
  </p>
  
! <blockquote><pre>
! <del>constexpr</del> bool test(size_t pos) const;
  </pre></blockquote>
  
  <p>
  Change the returns clause p. 66 to read:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> <del><tt>test(pos)</tt></del> <ins><tt>true</tt> if the bit at position <tt>pos</tt> in <tt>*this</tt>
  has the value one, otherwise <tt>false</tt></ins>.
! </p></blockquote>
  </li>
  </ol>
  
*************** Recommend Review with option C.
*** 52929,52962 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  
! <ol type="A" ,="" start="3">
  <li>
  <p>
  Undo the addition of the <tt>constexpr</tt> specifier to the <tt>test</tt> member
! function in both class declaration 20.5 [template.bitset]/1 and in the
! member description before 20.5.2 [bitset.members]/56, assuming that <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#720">720</a>
  was applied.
  </p>
  
! <blockquote><pre><del>constexpr</del> bool test(size_t pos) const;
  </pre></blockquote>
  
  <p>
  Change the returns clause p. 66 to read:
  </p>
  
! <blockquote>
  <i>Returns:</i> <del><tt>test(pos)</tt></del> <ins><tt>true</tt> if the bit at position <tt>pos</tt> in <tt>*this</tt>
  has the value one, otherwise <tt>false</tt></ins>.
! </blockquote>
  </li>
  </ol>
  
--- 55954,55990 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  
! <ol style="list-style-type:upper-alpha">
! <li>[&hellip;]</li>
! <li>[&hellip;]</li>
  <li>
  <p>
  Undo the addition of the <tt>constexpr</tt> specifier to the <tt>test</tt> member
! function in both class declaration 20.6 [template.bitset] p.1 and in the
! member description before 20.6.2 [bitset.members] p.56, assuming that <a href="lwg-defects.html#720">720</a>
  was applied.
  </p>
  
! <blockquote><pre>
! <del>constexpr</del> bool test(size_t pos) const;
  </pre></blockquote>
  
  <p>
  Change the returns clause p. 66 to read:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> <del><tt>test(pos)</tt></del> <ins><tt>true</tt> if the bit at position <tt>pos</tt> in <tt>*this</tt>
  has the value one, otherwise <tt>false</tt></ins>.
! </p></blockquote>
  </li>
  </ol>
  
*************** has the value one, otherwise <tt>false</
*** 52966,52976 ****
  
  
  <hr>
  <h3><a name="909"></a>909. <tt>regex_token_iterator</tt> should use <tt>initializer_list</tt></h3>
! <p><b>Section:</b> 28.12.2 [re.tokiter] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2008-09-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.tokiter">issues</a> in [re.tokiter].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 319</b></p>
--- 55994,56094 ----
  
  
  <hr>
+ <h3><a name="908"></a>908. Deleted assignment operators for atomic types must be volatile</h3>
+ <p><b>Section:</b> X [atomics.types] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2008-09-26 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses US 90</b></p>
+ 
+ <p>
+ The deleted copy-assignment operators for the atomic types are not
+ marked as volatile in N2723, whereas the assignment operators from the
+ associated non-atomic types are. e.g.
+ </p>
+ <blockquote><pre>
+ atomic_bool&amp; operator=(atomic_bool const&amp;) = delete;
+ atomic_bool&amp; operator=(bool) volatile;
+ </pre></blockquote>
+ 
+ <p>
+ This leads to ambiguity when assigning a non-atomic value to a
+ non-volatile instance of an atomic type:
+ </p>
+ <blockquote><pre>
+ atomic_bool b;
+ b=false;
+ </pre></blockquote>
+ 
+ <p>
+ Both assignment operators require a standard conversions: the
+ copy-assignment operator can use the implicit <tt>atomic_bool(bool)</tt>
+ conversion constructor to convert <tt>false</tt> to an instance of
+ <tt>atomic_bool</tt>, or <tt>b</tt> can undergo a qualification conversion in order to
+ use the assignment from a plain <tt>bool</tt>.
+ </p>
+ 
+ <p>
+ This is only a problem once issue <a href="lwg-defects.html#845">845</a> is applied.
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ <blockquote><p>
+ Move to open. Assign to Lawrence. Related to US 90 comment.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-08-17 Handled by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2925.html">N2925</a>.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add volatile qualification to the deleted copy-assignment operator of
+ all the atomic types:
+ </p>
+ 
+ <blockquote><pre>
+ atomic_bool&amp; operator=(atomic_bool const&amp;) <ins>volatile</ins> = delete;
+ atomic_itype&amp; operator=(atomic_itype const&amp;) <ins>volatile</ins> = delete;
+ </pre></blockquote>
+ 
+ <p>
+ etc.
+ </p>
+ <p>
+ This will mean that the deleted copy-assignment operator will require
+ <i>two</i> conversions in the above example, and thus be a worse match than
+ the assignment from plain <tt>bool</tt>.
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="909"></a>909. <tt>regex_token_iterator</tt> should use <tt>initializer_list</tt></h3>
! <p><b>Section:</b> 28.12.2 [re.tokiter] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2008-09-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.tokiter">issues</a> in [re.tokiter].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 319</b></p>
*************** range type:
*** 52992,53007 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We strongly recommend alternative B of the proposed resolution
  in order that existing code not be broken.
  With that understanding, move to Tentatively Ready.
! </blockquote>
  
  <p><b>Original proposed wording:</b></p>
  
! <ol type="A">
! <li><br>
  <ol>
  <li>
  <p>
--- 56110,56125 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We strongly recommend alternative B of the proposed resolution
  in order that existing code not be broken.
  With that understanding, move to Tentatively Ready.
! </p></blockquote>
  
  <p><b>Original proposed wording:</b></p>
  
! <ol style="list-style-type:upper-alpha">
! <li><br/>
  <ol>
  <li>
  <p>
*************** In 28.12.2 [re.tokiter]/6 and the list 2
*** 53009,53015 ****
  constructor declaration:
  </p>
  
! <blockquote><pre><del>template &lt;std::size_t N&gt;</del>
  regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
                       const regex_type&amp; re,
                       <del>const int (&amp;submatches)[N]</del> <ins>initializer_list&lt;int&gt; submatches</ins>,
--- 56127,56134 ----
  constructor declaration:
  </p>
  
! <blockquote><pre>
! <del>template &lt;std::size_t N&gt;</del>
  regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
                       const regex_type&amp; re,
                       <del>const int (&amp;submatches)[N]</del> <ins>initializer_list&lt;int&gt; submatches</ins>,
*************** regex_token_iterator(BidirectionalIterat
*** 53023,53039 ****
  In 28.12.2.1 [re.tokiter.cnstr]/12 change the last sentence
  </p>
  
! <blockquote>
  The third constructor initializes the member <tt>subs</tt> to hold
  a copy of the sequence of integer values pointed to by the
  iterator range <tt>[<del>&amp;</del>submatches<ins>.begin()</ins>,
  <del>&amp;</del>submatches<ins>.end()</ins> <del>+ N</del>)</tt>.
! </blockquote>
  </li>
  </ol>
  </li>
  
! <li><br>
  <ol>
  <li>
  <p>
--- 56142,56158 ----
  In 28.12.2.1 [re.tokiter.cnstr]/12 change the last sentence
  </p>
  
! <blockquote><p>
  The third constructor initializes the member <tt>subs</tt> to hold
  a copy of the sequence of integer values pointed to by the
  iterator range <tt>[<del>&amp;</del>submatches<ins>.begin()</ins>,
  <del>&amp;</del>submatches<ins>.end()</ins> <del>+ N</del>)</tt>.
! </p></blockquote>
  </li>
  </ol>
  </li>
  
! <li><br/>
  <ol>
  <li>
  <p>
*************** following constructor declaration betwee
*** 53042,53048 ****
  accepting a <tt>std::vector</tt> and a C array of <tt>int</tt>, resp.:
  </p>
  
! <blockquote><pre>regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
                       const regex_type&amp; re,
                       initializer_list&lt;int&gt; submatches,
                       regex_constants::match_flag_type m =
--- 56161,56168 ----
  accepting a <tt>std::vector</tt> and a C array of <tt>int</tt>, resp.:
  </p>
  
! <blockquote><pre>
! regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
                       const regex_type&amp; re,
                       initializer_list&lt;int&gt; submatches,
                       regex_constants::match_flag_type m =
*************** accepting a <tt>std::vector</tt> and a C
*** 53054,53065 ****
  In 28.12.2.1 [re.tokiter.cnstr]/12 change the last sentence
  </p>
  
! <blockquote>
  The third <ins>and fourth</ins> constructor initialize<del>s</del> the member <tt>subs</tt>
  to hold a copy of the sequence of integer values pointed to
  by the iterator range <tt>[&amp;submatches,&amp;submatches + N)</tt>
  <ins>and <tt>[submatches.begin(),submatches.end())</tt>, respectively</ins>.
! </blockquote>
  </li>
  </ol>
  </li>
--- 56174,56185 ----
  In 28.12.2.1 [re.tokiter.cnstr]/12 change the last sentence
  </p>
  
! <blockquote><p>
  The third <ins>and fourth</ins> constructor initialize<del>s</del> the member <tt>subs</tt>
  to hold a copy of the sequence of integer values pointed to
  by the iterator range <tt>[&amp;submatches,&amp;submatches + N)</tt>
  <ins>and <tt>[submatches.begin(),submatches.end())</tt>, respectively</ins>.
! </p></blockquote>
  </li>
  </ol>
  </li>
*************** by the iterator range <tt>[&amp;submatch
*** 53070,53078 ****
  
  <p><b>Proposed resolution:</b></p>
  
! <ol type="A" start="2">
! 
! <li><br>
  <ol>
  <li>
  <p>
--- 56190,56198 ----
  
  <p><b>Proposed resolution:</b></p>
  
! <ol style="list-style-type:upper-alpha">
! <li>[&hellip;]</li>
! <li><br/>
  <ol>
  <li>
  <p>
*************** following constructor declaration betwee
*** 53081,53087 ****
  accepting a <tt>std::vector</tt> and a C array of <tt>int</tt>, resp.:
  </p>
  
! <blockquote><pre>regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
                       const regex_type&amp; re,
                       initializer_list&lt;int&gt; submatches,
                       regex_constants::match_flag_type m =
--- 56201,56208 ----
  accepting a <tt>std::vector</tt> and a C array of <tt>int</tt>, resp.:
  </p>
  
! <blockquote><pre>
! regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
                       const regex_type&amp; re,
                       initializer_list&lt;int&gt; submatches,
                       regex_constants::match_flag_type m =
*************** accepting a <tt>std::vector</tt> and a C
*** 53093,53104 ****
  In 28.12.2.1 [re.tokiter.cnstr]/12 change the last sentence
  </p>
  
! <blockquote>
  The third <ins>and fourth</ins> constructor initialize<del>s</del> the member <tt>subs</tt>
  to hold a copy of the sequence of integer values pointed to
  by the iterator range <tt>[&amp;submatches,&amp;submatches + N)</tt>
  <ins>and <tt>[submatches.begin(),submatches.end())</tt>, respectively</ins>.
! </blockquote>
  </li>
  </ol>
  </li>
--- 56214,56225 ----
  In 28.12.2.1 [re.tokiter.cnstr]/12 change the last sentence
  </p>
  
! <blockquote><p>
  The third <ins>and fourth</ins> constructor initialize<del>s</del> the member <tt>subs</tt>
  to hold a copy of the sequence of integer values pointed to
  by the iterator range <tt>[&amp;submatches,&amp;submatches + N)</tt>
  <ins>and <tt>[submatches.begin(),submatches.end())</tt>, respectively</ins>.
! </p></blockquote>
  </li>
  </ol>
  </li>
*************** by the iterator range <tt>[&amp;submatch
*** 53111,53120 ****
  
  
  <hr>
! <h3><a name="911"></a>911. I/O streams and <tt>move/swap</tt> semantic</h3>
! <p><b>Section:</b> 27.7.1 [input.streams], 27.7.2 [output.streams] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-09-29 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class template <tt>basic_istream</tt>, <tt>basic_ostream</tt> and <tt>basic_iostream</tt>
--- 56232,56241 ----
  
  
  <hr>
! <h3><a name="911"></a>911. I&#47;O streams and <tt>move&#47;swap</tt> semantic</h3>
! <p><b>Section:</b> 27.7.2 [input.streams], 27.7.3 [output.streams] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2008-09-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class template <tt>basic_istream</tt>, <tt>basic_ostream</tt> and <tt>basic_iostream</tt>
*************** and <tt>Swappable</tt>. However, those c
*** 53125,53131 ****
  expectations. For example:
  </p>
  
! <blockquote><pre>std::ostream os(std::ofstream("file.txt"));
  assert(os.rdbuf() == 0); // buffer object is not moved to os, file.txt has been closed
  
  std::vector&lt;std::ostream&gt; v;
--- 56246,56253 ----
  expectations. For example:
  </p>
  
! <blockquote><pre>
! std::ostream os(std::ofstream("file.txt"));
  assert(os.rdbuf() == 0); // buffer object is not moved to os, file.txt has been closed
  
  std::vector&lt;std::ostream&gt; v;
*************** I've implemented this proposal and am li
*** 53259,53287 ****
  ]</i></p>
  
  
! <blockquote>
  Leave Open.  Pablo expected to propose alternative wording which would rename
  move construction, move assignment and swap, and may or may not make them
! protected.  This will impact issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready for Pittsburgh.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 27.7.1.1 [istream]: make the following member functions protected:
  </p>
  
! <blockquote><pre>basic_istream(basic_istream&amp;&amp;  rhs);
  basic_istream&amp;  operator=(basic_istream&amp;&amp;  rhs);
  void  swap(basic_istream&amp;  rhs);
  </pre></blockquote>
--- 56381,56410 ----
  ]</i></p>
  
  
! <blockquote><p>
  Leave Open.  Pablo expected to propose alternative wording which would rename
  move construction, move assignment and swap, and may or may not make them
! protected.  This will impact issue <a href="lwg-defects.html#900">900</a>.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready for Pittsburgh.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 27.7.2.1 [istream]: make the following member functions protected:
  </p>
  
! <blockquote><pre>
! basic_istream(basic_istream&amp;&amp;  rhs);
  basic_istream&amp;  operator=(basic_istream&amp;&amp;  rhs);
  void  swap(basic_istream&amp;  rhs);
  </pre></blockquote>
*************** void  swap(basic_istream&amp;  rhs);
*** 53290,53317 ****
  Ditto: remove the swap free function signature
  </p>
  
! <blockquote><pre><del>// swap: 
  template &lt;class charT, class traits&gt; 
    void swap(basic_istream&lt;charT, traits&gt;&amp; x, basic_istream&lt;charT, traits&gt;&amp; y);</del>
  </pre></blockquote>
  
  <p>
! 27.7.1.1.2 [istream.assign]: remove paragraph 4
  </p>
  
! <blockquote><pre><del>template &lt;class charT, class traits&gt; 
    void swap(basic_istream&lt;charT, traits&gt;&amp; x, basic_istream&lt;charT, traits&gt;&amp; y);</del>
  </pre>
! <blockquote>
  <del><i>Effects:</i> <tt>x.swap(y)</tt>.</del>
! </blockquote>
  </blockquote>
  
  <p>
! 27.7.1.5 [iostreamclass]: make the following member function protected:
  </p>
  
! <blockquote><pre>basic_iostream(basic_iostream&amp;&amp;  rhs);
  basic_iostream&amp;  operator=(basic_iostream&amp;&amp;  rhs);
  void  swap(basic_iostream&amp;  rhs);
  </pre></blockquote>
--- 56413,56443 ----
  Ditto: remove the swap free function signature
  </p>
  
! <blockquote><pre>
! <del>// swap: 
  template &lt;class charT, class traits&gt; 
    void swap(basic_istream&lt;charT, traits&gt;&amp; x, basic_istream&lt;charT, traits&gt;&amp; y);</del>
  </pre></blockquote>
  
  <p>
! 27.7.2.1.2 [istream.assign]: remove paragraph 4
  </p>
  
! <blockquote><pre>
! <del>template &lt;class charT, class traits&gt; 
    void swap(basic_istream&lt;charT, traits&gt;&amp; x, basic_istream&lt;charT, traits&gt;&amp; y);</del>
  </pre>
! <blockquote><p>
  <del><i>Effects:</i> <tt>x.swap(y)</tt>.</del>
! </p></blockquote>
  </blockquote>
  
  <p>
! 27.7.2.5 [iostreamclass]: make the following member function protected:
  </p>
  
! <blockquote><pre>
! basic_iostream(basic_iostream&amp;&amp;  rhs);
  basic_iostream&amp;  operator=(basic_iostream&amp;&amp;  rhs);
  void  swap(basic_iostream&amp;  rhs);
  </pre></blockquote>
*************** void  swap(basic_iostream&amp;  rhs);
*** 53320,53346 ****
  Ditto: remove the swap free function signature
  </p>
  
! <blockquote><pre><del>template &lt;class charT, class traits&gt; 
    void swap(basic_iostream&lt;charT, traits&gt;&amp; x, basic_iostream&lt;charT, traits&gt;&amp; y);</del>
  </pre></blockquote>
  
  <p>
! 27.7.1.5.3 [iostream.assign]: remove paragraph 3
  </p>
  
! <blockquote><pre><del>template &lt;class charT, class traits&gt; 
    void swap(basic_iostream&lt;charT, traits&gt;&amp; x, basic_iostream&lt;charT, traits&gt;&amp; y);</del>
  </pre>
! <blockquote>
  <del><i>Effects:</i> <tt>x.swap(y)</tt>.</del>
! </blockquote>
  </blockquote>
  
  <p>
! 27.7.2.1 [ostream]: make the following member function protected:
  </p>
  
! <blockquote><pre>basic_ostream(basic_ostream&amp;&amp;  rhs);
  basic_ostream&amp;  operator=(basic_ostream&amp;&amp;  rhs);
  void  swap(basic_ostream&amp;  rhs);
  </pre></blockquote>
--- 56446,56475 ----
  Ditto: remove the swap free function signature
  </p>
  
! <blockquote><pre>
! <del>template &lt;class charT, class traits&gt; 
    void swap(basic_iostream&lt;charT, traits&gt;&amp; x, basic_iostream&lt;charT, traits&gt;&amp; y);</del>
  </pre></blockquote>
  
  <p>
! 27.7.2.5.3 [iostream.assign]: remove paragraph 3
  </p>
  
! <blockquote><pre>
! <del>template &lt;class charT, class traits&gt; 
    void swap(basic_iostream&lt;charT, traits&gt;&amp; x, basic_iostream&lt;charT, traits&gt;&amp; y);</del>
  </pre>
! <blockquote><p>
  <del><i>Effects:</i> <tt>x.swap(y)</tt>.</del>
! </p></blockquote>
  </blockquote>
  
  <p>
! 27.7.3.1 [ostream]: make the following member function protected:
  </p>
  
! <blockquote><pre>
! basic_ostream(basic_ostream&amp;&amp;  rhs);
  basic_ostream&amp;  operator=(basic_ostream&amp;&amp;  rhs);
  void  swap(basic_ostream&amp;  rhs);
  </pre></blockquote>
*************** void  swap(basic_ostream&amp;  rhs);
*** 53349,53369 ****
  Ditto: remove the swap free function signature
  </p>
  
! <blockquote><pre><del>// swap: 
  template &lt;class charT, class traits&gt; 
    void swap(basic_ostream&lt;charT, traits&gt;&amp; x, basic_ostream&lt;charT, traits&gt;&amp; y);</del>
  </pre></blockquote>
  
  <p>
! 27.7.2.3 [ostream.assign]: remove paragraph 4 
  </p>
  
! <blockquote><pre><del>template &lt;class charT, class traits&gt; 
    void swap(basic_ostream&lt;charT, traits&gt;&amp; x, basic_ostream&lt;charT, traits&gt;&amp; y);</del>
  </pre>
! <blockquote>
  <del><i>Effects:</i> <tt>x.swap(y)</tt>.</del>
! </blockquote>
  </blockquote>
  
  
--- 56478,56500 ----
  Ditto: remove the swap free function signature
  </p>
  
! <blockquote><pre>
! <del>// swap: 
  template &lt;class charT, class traits&gt; 
    void swap(basic_ostream&lt;charT, traits&gt;&amp; x, basic_ostream&lt;charT, traits&gt;&amp; y);</del>
  </pre></blockquote>
  
  <p>
! 27.7.3.3 [ostream.assign]: remove paragraph 4 
  </p>
  
! <blockquote><pre>
! <del>template &lt;class charT, class traits&gt; 
    void swap(basic_ostream&lt;charT, traits&gt;&amp; x, basic_ostream&lt;charT, traits&gt;&amp; y);</del>
  </pre>
! <blockquote><p>
  <del><i>Effects:</i> <tt>x.swap(y)</tt>.</del>
! </p></blockquote>
  </blockquote>
  
  
*************** template &lt;class charT, class traits&g
*** 53373,53386 ****
  
  <hr>
  <h3><a name="920"></a>920. Ref-qualification support in the library</h3>
! <p><b>Section:</b> 20.8.13 [func.memfn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Bronek Kozicki <b>Opened:</b> 2008-10-06 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.memfn">issues</a> in [func.memfn].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1230">1230</a></p>
  <p><b>Discussion:</b></p>
  <p>
! Daniel Krügler wrote:
  </p>
  
  <blockquote>
--- 56504,56517 ----
  
  <hr>
  <h3><a name="920"></a>920. Ref-qualification support in the library</h3>
! <p><b>Section:</b> 20.9.11 [func.memfn] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Bronek Kozicki <b>Opened:</b> 2008-10-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.memfn">issues</a> in [func.memfn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1230">1230</a></p>
  <p><b>Discussion:</b></p>
  <p>
! Daniel Kr&uuml;gler wrote:
  </p>
  
  <blockquote>
*************** Daniel Krügler wrote:
*** 53388,53394 ****
  Shouldn't above list be completed for &amp;- and &amp;&amp;-qualified
  member functions This would cause to add:
  </p>
! <blockquote><pre>template&lt;Returnable R, class T, CopyConstructible... Args&gt;
  unspecified mem_fn(R (T::* pm)(Args...) &amp;);
  template&lt;Returnable R, class T, CopyConstructible... Args&gt;
  unspecified mem_fn(R (T::* pm)(Args...) const &amp;);
--- 56519,56526 ----
  Shouldn't above list be completed for &amp;- and &amp;&amp;-qualified
  member functions This would cause to add:
  </p>
! <blockquote><pre>
! template&lt;Returnable R, class T, CopyConstructible... Args&gt;
  unspecified mem_fn(R (T::* pm)(Args...) &amp;);
  template&lt;Returnable R, class T, CopyConstructible... Args&gt;
  unspecified mem_fn(R (T::* pm)(Args...) const &amp;);
*************** Committee Draft has been issued.
*** 53443,53460 ****
  ]</i></p>
  
  
! <blockquote>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1230">1230</a> has a similar proposed resolution
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 56575,56592 ----
  ]</i></p>
  
  
! <blockquote><p>
! <a href="lwg-closed.html#1230">1230</a> has a similar proposed resolution
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Move to Ready.
*** 53462,53472 ****
  <ol>
  <li>
  <p>
! Change 20.8 [function.objects]/2, header
  <tt>&lt;functional&gt;</tt> synopsis as follows:
  </p>
  
! <blockquote><pre>// 20.7.14, member function adaptors:
  template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::*);
  
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::*)(Args...));</ins>
--- 56594,56605 ----
  <ol>
  <li>
  <p>
! Change 20.9 [function.objects]/2, header
  <tt>&lt;functional&gt;</tt> synopsis as follows:
  </p>
  
! <blockquote><pre>
! // 20.7.14, member function adaptors:
  template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::*);
  
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::*)(Args...));</ins>
*************** template&lt;class R, class T&gt; <i>unsp
*** 53488,53501 ****
  
  <li>
  <p>
! Change the prototype list of 20.8.13 [func.memfn] as follows [NB: The
  following text, most notably p.2 and p.3 which
  discuss influence of the cv-qualification on the definition of the
  base class's first template parameter remains
  unchanged. ]:
  </p>
  
! <blockquote><pre>template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::* pm);
  
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::* pm)(Args...));</ins>
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::* pm)(Args...) const);</ins>
--- 56621,56635 ----
  
  <li>
  <p>
! Change the prototype list of 20.9.11 [func.memfn] as follows [NB: The
  following text, most notably p.2 and p.3 which
  discuss influence of the cv-qualification on the definition of the
  base class's first template parameter remains
  unchanged. ]:
  </p>
  
! <blockquote><pre>
! template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::* pm);
  
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::* pm)(Args...));</ins>
  <ins>template&lt;class R, class T, class ...Args&gt; <i>unspecified</i> mem_fn(R (T::* pm)(Args...) const);</ins>
*************** unchanged. ]:
*** 53516,53528 ****
  
  <li>
  <p>
! Remove 20.8.13 [func.memfn]/5:
  </p>
  
! <blockquote>
  <del><i>Remarks:</i> Implementations may implement <tt>mem_fn</tt> as a set of
  overloaded function templates.</del>
! </blockquote>
  </li>
  </ol>
  
--- 56650,56662 ----
  
  <li>
  <p>
! Remove 20.9.11 [func.memfn]/5:
  </p>
  
! <blockquote><p>
  <del><i>Remarks:</i> Implementations may implement <tt>mem_fn</tt> as a set of
  overloaded function templates.</del>
! </p></blockquote>
  </li>
  </ol>
  
*************** overloaded function templates.</del>
*** 53533,53542 ****
  
  <hr>
  <h3><a name="921"></a>921. Rational Arithmetic should use template aliases</h3>
! <p><b>Section:</b> 20.6.1 [ratio.ratio] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2008-10-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ratio.ratio">issues</a> in [ratio.ratio].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The compile-time functions that operate on <tt>ratio&lt;N,D&gt;</tt> require the
--- 56667,56676 ----
  
  <hr>
  <h3><a name="921"></a>921. Rational Arithmetic should use template aliases</h3>
! <p><b>Section:</b> 20.11.3 [ratio.ratio] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2008-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ratio.ratio">issues</a> in [ratio.ratio].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The compile-time functions that operate on <tt>ratio&lt;N,D&gt;</tt> require the
*************** meta-programming style that predates the
*** 53545,53558 ****
  Thus, multiplying three ratios <tt>a</tt>, <tt>b</tt>, and <tt>c</tt> requires the expression:
  </p>
  
! <blockquote><pre>ratio_multiply&lt;a, ratio_multiply&lt;b, c&gt;::type&gt;::type
  </pre></blockquote>
  
  <p>
  The simpler expression:
  </p>
  
! <blockquote><pre>ratio_multiply&lt;a, ratio_multiply&lt;b, c&gt;&gt;
  </pre></blockquote>
  
  <p>
--- 56679,56694 ----
  Thus, multiplying three ratios <tt>a</tt>, <tt>b</tt>, and <tt>c</tt> requires the expression:
  </p>
  
! <blockquote><pre>
! ratio_multiply&lt;a, ratio_multiply&lt;b, c&gt;::type&gt;::type
  </pre></blockquote>
  
  <p>
  The simpler expression:
  </p>
  
! <blockquote><pre>
! ratio_multiply&lt;a, ratio_multiply&lt;b, c&gt;&gt;
  </pre></blockquote>
  
  <p>
*************** Recommend Open.
*** 53585,53596 ****
  <p>
  Personally I'm <em>not</em> in favor for the addition of:
  </p>
! <blockquote><pre>typedef ratio type;
  </pre></blockquote>
  <p>
! For a reader of the
! standard it's usage or purpose is unclear. I haven't seen similar examples
! of attempts to satisfy non-feature complete compilers.
  </p>
  </blockquote>
  
--- 56721,56732 ----
  <p>
  Personally I'm <em>not</em> in favor for the addition of:
  </p>
! <blockquote><pre>
! typedef ratio type;
  </pre></blockquote>
  <p>
! For a reader of the standard it's usage or purpose is unclear. I haven't 
! seen similar examples of attempts to satisfy non-feature complete compilers.
  </p>
  </blockquote>
  
*************** reviewers to decide.
*** 53613,53660 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Bill asks for additional discussion in the issue
  that spells out more details of the implementation.
! Howard points us to issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#948">948</a>
  which has at least most of the requested details.
  Tom is strongly in favor of overflow-checking at compile time.
  Pete points out that there is no change of functionality implied.
  We agree with the proposed resolution,
  but recommend moving the issue to Review
  to allow time to improve the discussion if needed.
! </blockquote>
  
  <p><i>[
  2009-07-21 Alisdair adds:
  ]</i></p>
  
  
! <blockquote>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1121">1121</a> for a potentially incompatible proposal.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
   
!  <ol start="0">
  <li>
  <p>
! In 20.6 [ratio]/3 change as indicated:
  </p>
  
! <blockquote><pre>// ratio arithmetic
  template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_add<ins> = <em>see below</em></ins>;
  template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_subtract<ins> = <em>see below</em></ins>;
  template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_multiply<ins> = <em>see below</em></ins>;
--- 56749,56797 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Bill asks for additional discussion in the issue
  that spells out more details of the implementation.
! Howard points us to issue <a href="lwg-defects.html#948">948</a>
  which has at least most of the requested details.
  Tom is strongly in favor of overflow-checking at compile time.
  Pete points out that there is no change of functionality implied.
  We agree with the proposed resolution,
  but recommend moving the issue to Review
  to allow time to improve the discussion if needed.
! </p></blockquote>
  
  <p><i>[
  2009-07-21 Alisdair adds:
  ]</i></p>
  
  
! <blockquote><p>
! See <a href="lwg-active.html#1121">1121</a> for a potentially incompatible proposal.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
   
!  <ol>
  <li>
  <p>
! In 20.11 [ratio] p.3 change as indicated:
  </p>
  
! <blockquote><pre>
! // ratio arithmetic
  template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_add<ins> = <em>see below</em></ins>;
  template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_subtract<ins> = <em>see below</em></ins>;
  template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_multiply<ins> = <em>see below</em></ins>;
*************** template &lt;class R1, class R2&gt; <del
*** 53663,53671 ****
  </li>
  <li>
  <p>
! In 20.6.1 [ratio.ratio], change as indicated:
  </p>
! <blockquote><pre>namespace std {
    template &lt;intmax_t N, intmax_t D = 1&gt;
    class ratio {
    public:
--- 56800,56809 ----
  </li>
  <li>
  <p>
! In 20.11.3 [ratio.ratio], change as indicated:
  </p>
! <blockquote><pre>
! namespace std {
    template &lt;intmax_t N, intmax_t D = 1&gt;
    class ratio {
    public:
*************** In 20.6.1 [ratio.ratio], change as indic
*** 53678,53687 ****
  </li>
  <li>
  <p>
! In 20.6.2 [ratio.arithmetic] change as indicated:
  </p>
  
! <blockquote><pre>template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_add<ins> = <em>see below</em></ins><del>{
    typedef <em>see below</em> type;
  }</del>;
  </pre>
--- 56816,56826 ----
  </li>
  <li>
  <p>
! In 20.11.4 [ratio.arithmetic] change as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_add<ins> = <em>see below</em></ins><del>{
    typedef <em>see below</em> type;
  }</del>;
  </pre>
*************** has the value <tt>R1::den * R2::den</tt>
*** 53695,53701 ****
  </p>
  </blockquote>
  </blockquote>
! <blockquote><pre>template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_subtract<ins> = <em>see below</em></ins><del>{
    typedef <em>see below</em> type;
  }</del>;
  </pre>
--- 56834,56841 ----
  </p>
  </blockquote>
  </blockquote>
! <blockquote><pre>
! template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_subtract<ins> = <em>see below</em></ins><del>{
    typedef <em>see below</em> type;
  }</del>;
  </pre>
*************** has the value <tt>R1::den * R2::den</tt>
*** 53708,53714 ****
  </p>
  </blockquote>
  </blockquote>
! <blockquote><pre>template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_multiply<ins> = <em>see below</em></ins><del>{
    typedef <em>see below</em> type;
  }</del>;
  </pre>
--- 56848,56855 ----
  </p>
  </blockquote>
  </blockquote>
! <blockquote><pre>
! template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_multiply<ins> = <em>see below</em></ins><del>{
    typedef <em>see below</em> type;
  }</del>;
  </pre>
*************** where <tt>T1</tt> has the value <tt>R1::
*** 53720,53726 ****
  </p>
  </blockquote>
  </blockquote>
! <blockquote><pre>template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_divide<ins> = <em>see below</em></ins><del>{
    typedef <em>see below</em> type;
  }</del>;
  </pre>
--- 56861,56868 ----
  </p>
  </blockquote>
  </blockquote>
! <blockquote><pre>
! template &lt;class R1, class R2&gt; <del>struct</del><ins>using</ins> ratio_divide<ins> = <em>see below</em></ins><del>{
    typedef <em>see below</em> type;
  }</del>;
  </pre>
*************** where <tt>T1</tt> has the value <tt>R1::
*** 53735,53741 ****
  </li>
  <li>
  <p>
! In 20.11.3.1 [time.duration.cons]/4 change as indicated:
  </p>
  <blockquote>
  <p>
--- 56877,56883 ----
  </li>
  <li>
  <p>
! In 20.12.5.1 [time.duration.cons] p.4 change as indicated:
  </p>
  <blockquote>
  <p>
*************** In 20.11.3.1 [time.duration.cons]/4 chan
*** 53746,53752 ****
  </li>
  <li>
  <p>
! In 20.11.3.7 [time.duration.cast]/2 change as indicated:
  </p>
  <blockquote>
  <p>
--- 56888,56894 ----
  </li>
  <li>
  <p>
! In 20.12.5.7 [time.duration.cast] p.2 change as indicated:
  </p>
  <blockquote>
  <p>
*************** ToDuration::period&gt;<del>::type</del><
*** 53763,53776 ****
  
  <hr>
  <h3><a name="922"></a>922. [func.bind.place] Number of placeholders</h3>
! <p><b>Section:</b> B [implimits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Sohail Somani <b>Opened:</b> 2008-10-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE 24</b></p>
  
  <p>
! With respect to the section 20.8.10.1.3 [func.bind.place]:
  </p>
  <p>
  TR1 dropped some suggested implementation quantities for the number of
--- 56905,56918 ----
  
  <hr>
  <h3><a name="922"></a>922. [func.bind.place] Number of placeholders</h3>
! <p><b>Section:</b> B [implimits] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Sohail Somani <b>Opened:</b> 2008-10-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE 24</b></p>
  
  <p>
! With respect to the section 20.9.10.4 [func.bind.place]:
  </p>
  <p>
  TR1 dropped some suggested implementation quantities for the number of
*************** Recommend applying the proposed resoluti
*** 53791,53807 ****
  Tentatively Ready.
  </p>
  </blockquote>
! 
  <b>Original proposed resolution:</b>
! 
  <p>
! Add 20.8.10.1.3 [func.bind.place]/2:
  </p>
  
! <blockquote>
  While the exact number of placeholders (<tt>_M</tt>) is implementation defined,
  this number shall be at least 10.
! </blockquote>
  
  
  
--- 56933,56949 ----
  Tentatively Ready.
  </p>
  </blockquote>
! <p>
  <b>Original proposed resolution:</b>
! </p>
  <p>
! Add 20.9.10.4 [func.bind.place] p.2:
  </p>
  
! <blockquote><p>
  While the exact number of placeholders (<tt>_M</tt>) is implementation defined,
  this number shall be at least 10.
! </p></blockquote>
  
  
  
*************** Add to B [implimits]:
*** 53813,53819 ****
  
  <ul>
  <li>
! Number of placeholders (20.8.10.1.3 [func.bind.place]) [10].
  </li>
  </ul>
  
--- 56955,56961 ----
  
  <ul>
  <li>
! Number of placeholders (20.9.10.4 [func.bind.place]) [10].
  </li>
  </ul>
  
*************** Number of placeholders (20.8.10.1.3 [fun
*** 53823,53845 ****
  
  
  <hr>
  <h3><a name="925"></a>925. <tt>shared_ptr</tt>'s explicit conversion from <tt>unique_ptr</tt></h3>
! <p><b>Section:</b> 20.9.10.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Rodolfo Lima <b>Opened:</b> 2008-10-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current working draft
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>),
! section 20.9.10.2.1 [util.smartptr.shared.const] declares
  <tt>shared_ptr</tt>'s constructor that takes a rvalue reference to <tt>unique_ptr</tt> and
  <tt>auto_ptr</tt> as being explicit, affecting several valid smart pointer use
  cases that would take advantage of this conversion being implicit, for
  example:
  </p>
  
! <blockquote><pre>class A;
  std::unique_ptr&lt;A&gt; create();
  void process(std::shared_ptr&lt;A&gt; obj);
  
--- 56965,57190 ----
  
  
  <hr>
+ <h3><a name="923"></a>923. atomics with floating-point </h3>
+ <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2008-10-17 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Right now, C++0x doesn't have <tt>atomic&lt;float&gt;</tt>. We're thinking of adding
+ the words to support it for TR2 (note: that would be slightly post-C++0x). If we 
+ need it, we could probably add the words.
+ </p>
+ <p>
+ <b>Proposed resolutions:</b> Using <tt>atomic&lt;FP&gt;::compare_exchange</tt> (weak or
+ strong) should be either:
+ </p>
+ 
+ <ol>
+ <li>
+ ill-formed, or
+ </li>
+ <li>
+ well-defined.
+ </li>
+ </ol>
+ 
+ <p>
+ I propose Option 1 for C++0x for expediency. If someone wants to argue
+ for Option 2, they need to say what exactly they want <tt>compare_exchange</tt>
+ to mean in this case (IIRC, C++0x doesn't even assume IEEE 754).
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to open. Blocked until concepts for atomics are addressed.
+ </p></blockquote>
+ 
+ <p><i>[
+ Post Summit Anthony adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Recommend NAD. C++0x does have <tt>std::atomic&lt;float&gt;</tt>, and both
+ <tt>compare_exchange_weak</tt> and <tt>compare_exchange_strong</tt> are well-defined in
+ this case. Maybe change the note in 29.6 [atomics.types.operations] paragraph 20 to:
+ </p>
+ 
+ <blockquote>
+ <p>
+ [<i>Note:</i> The effect of the compare-and-exchange operations is
+ </p>
+ <blockquote><pre>
+ if (!memcmp(object,expected,sizeof(*object)))
+     *object = desired;
+ else
+     *expected = *object;
+ </pre></blockquote>
+ 
+ <p>
+ This may result in failed comparisons for values that compare equal if
+ the underlying type has padding bits or alternate representations of
+ the same value. <i>-- end note</i>]
+ </p>
+ </blockquote>
+ 
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change the note in 29.6 [atomics.types.operations] paragraph 20 to:
+ </p>
+ 
+ <blockquote>
+ <p>
+ [<i>Note:</i> The effect of the compare-and-exchange operations is
+ </p>
+ <blockquote><pre>
+ if (<del>*object == *expected</del> <ins>!memcmp(object,expected,sizeof(*object))</ins>)
+     *object = desired;
+ else
+     *expected = *object;
+ </pre></blockquote>
+ 
+ <p><ins>
+ This may result in failed comparisons for values that compare equal if
+ the underlying type has padding bits or alternate representations of
+ the same value.</ins> <i>-- end note</i>]
+ </p>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="924"></a>924. structs with internal padding</h3>
+ <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2008-10-17 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Right now, the <tt>compare_exchange_weak</tt> loop should rapidly converge on the
+ padding contents. But <tt>compare_exchange_strong</tt> will require a bit more
+ compiler work to ignore padding for comparison purposes.
+ </p>
+ <p>
+ Note that this isn't a problem for structs with no padding, and we do
+ already have one portable way to ensure that there is no padding that
+ covers the key use cases: Have elements be the same type. I suspect that
+ the greatest need is for a structure of two pointers, which has no
+ padding problem. I suspect the second need is a structure of a pointer
+ and some form of an integer. If that integer is <tt>intptr_t</tt>, there will be
+ no padding.
+ </p>
+ <p>
+ Related but separable issue: For unused bitfields, or other unused
+ fields for that matter, we should probably say it's the programmer's
+ responsibility to set them to zero or otherwise ensure they'll be
+ ignored by <tt>memcmp</tt>.
+ </p>
+ 
+ <p>
+ <b>Proposed resolution:</b> Using
+ <tt>atomic&lt;struct-with-padding&gt;::compare_exchange_strong</tt> should be either:
+ </p>
+ 
+ <ol>
+ <li>
+ ill-formed, or
+ </li>
+ <li>
+ well-defined.
+ </li>
+ </ol>
+ 
+ <p>
+ I propose Option 1 for C++0x for expediency, though I'm not sure how to
+ say it. I would be happy with Option 2, which I believe would mean that
+ <tt>compare_exchange_strong</tt> would be implemented to avoid comparing padding
+ bytes, or something equivalent such as always zeroing out padding when
+ loading/storing/comparing. (Either implementation might require compiler
+ support.)
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to open. Blocked until concepts for atomics are addressed.
+ </p></blockquote>
+ 
+ <p><i>[
+ Post Summit Anthony adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ The resolution of LWG <a href="lwg-defects.html#923">923</a> should resolve this issue as well.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="925"></a>925. <tt>shared_ptr</tt>'s explicit conversion from <tt>unique_ptr</tt></h3>
! <p><b>Section:</b> 20.8.2.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Rodolfo Lima <b>Opened:</b> 2008-10-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current working draft
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>),
! section 20.8.2.2.1 [util.smartptr.shared.const] declares
  <tt>shared_ptr</tt>'s constructor that takes a rvalue reference to <tt>unique_ptr</tt> and
  <tt>auto_ptr</tt> as being explicit, affecting several valid smart pointer use
  cases that would take advantage of this conversion being implicit, for
  example:
  </p>
  
! <blockquote><pre>
! class A;
  std::unique_ptr&lt;A&gt; create();
  void process(std::shared_ptr&lt;A&gt; obj);
  
*************** If <tt>unique_ptr</tt> to <tt>shared_ptr
*** 53857,53863 ****
  should be written:
  </p>
  
! <blockquote><pre>process(std::shared_ptr&lt;A&gt;(create()));        // use case #1
  process(std::shared_ptr&lt;A&gt;(std::move(uobj))); // use case #2
  </pre></blockquote>
  
--- 57202,57209 ----
  should be written:
  </p>
  
! <blockquote><pre>
! process(std::shared_ptr&lt;A&gt;(create()));        // use case #1
  process(std::shared_ptr&lt;A&gt;(std::move(uobj))); // use case #2
  </pre></blockquote>
  
*************** Move to Tentatively Ready.
*** 53893,53903 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In both 20.9.10.2 [util.smartptr.shared] paragraph 1 and 
! 20.9.10.2.1 [util.smartptr.shared.const] change:
  </p>
  
! <blockquote><pre>template &lt;class Y&gt; <del>explicit</del> shared_ptr(auto_ptr&lt;Y&gt; &amp;&amp;r);
  template &lt;class Y, class D&gt; <del>explicit</del> shared_ptr(unique_ptr&lt;Y, D&gt; &amp;&amp;r);
  </pre></blockquote>
  
--- 57239,57250 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In both 20.8.2.2 [util.smartptr.shared] paragraph 1 and 
! 20.8.2.2.1 [util.smartptr.shared.const] change:
  </p>
  
! <blockquote><pre>
! template &lt;class Y&gt; <del>explicit</del> shared_ptr(auto_ptr&lt;Y&gt; &amp;&amp;r);
  template &lt;class Y, class D&gt; <del>explicit</del> shared_ptr(unique_ptr&lt;Y, D&gt; &amp;&amp;r);
  </pre></blockquote>
  
*************** template &lt;class Y, class D&gt; <del>e
*** 53908,53917 ****
  
  <hr>
  <h3><a name="929"></a>929. Thread constructor</h3>
! <p><b>Section:</b> 30.3.1.2 [thread.thread.constr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2008-10-23 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.constr">issues</a> in [thread.thread.constr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 323</b></p>
--- 57255,57264 ----
  
  <hr>
  <h3><a name="929"></a>929. Thread constructor</h3>
! <p><b>Section:</b> 30.3.1.2 [thread.thread.constr] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2008-10-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.constr">issues</a> in [thread.thread.constr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 323</b></p>
*************** parameters. In particular it prevents th
*** 53932,53938 ****
  Consequently a simple case such as
  </p>
  
! <blockquote><pre>void f(const char*);
  std::thread t(f,"hello");
  </pre></blockquote>
  
--- 57279,57286 ----
  Consequently a simple case such as
  </p>
  
! <blockquote><pre>
! void f(const char*);
  std::thread t(f,"hello");
  </pre></blockquote>
  
*************** The new signature of the <tt>thread</tt>
*** 53954,53960 ****
  arguments is thus:
  </p>
  
! <blockquote><pre>template&lt;typename F,typename... Args&gt;
  thread(F,Args... args);
  </pre></blockquote>
  
--- 57302,57309 ----
  arguments is thus:
  </p>
  
! <blockquote><pre>
! template&lt;typename F,typename... Args&gt;
  thread(F,Args... args);
  </pre></blockquote>
  
*************** removes a <tt>move</tt> when passing in
*** 53977,53997 ****
  </p>
  
  <p>
! This circumstance is very analogous to <tt>make_pair</tt> (20.3.5 [pairs])
  where we started with passing by const reference, changed to pass by value to
  get pointer decay, and then changed to pass by rvalue reference, but modified with
  <tt>decay&lt;T&gt;</tt> to retain the pass-by-value behavior.  If we were to
  apply the same solution here it would look like:
  </p>
  
! <blockquote><pre><del>template &lt;class F&gt; explicit thread(F f);</del>
  template &lt;class F, class ...Args&gt; thread(F&amp;&amp; f, Args&amp;&amp;... args);
  </pre>
  <blockquote>
  <p>
  -4- <i>Requires:</i> <tt>F</tt> and each <tt>Ti</tt> in <tt>Args</tt> shall be <del><tt>CopyConstructible</tt>
  if an lvalue and otherwise</del> <tt>MoveConstructible</tt>.
! <tt><i>INVOKE</i>(f, w1, w2, ..., wN)</tt> (20.8.2 [func.require]) shall be a valid expression for
  some values <tt>w1, w2, ... , wN,</tt> where <tt>N == sizeof...(Args)</tt>.
  </p>
  <p>
--- 57326,57347 ----
  </p>
  
  <p>
! This circumstance is very analogous to <tt>make_pair</tt> (20.3 [pairs])
  where we started with passing by const reference, changed to pass by value to
  get pointer decay, and then changed to pass by rvalue reference, but modified with
  <tt>decay&lt;T&gt;</tt> to retain the pass-by-value behavior.  If we were to
  apply the same solution here it would look like:
  </p>
  
! <blockquote><pre>
! <del>template &lt;class F&gt; explicit thread(F f);</del>
  template &lt;class F, class ...Args&gt; thread(F&amp;&amp; f, Args&amp;&amp;... args);
  </pre>
  <blockquote>
  <p>
  -4- <i>Requires:</i> <tt>F</tt> and each <tt>Ti</tt> in <tt>Args</tt> shall be <del><tt>CopyConstructible</tt>
  if an lvalue and otherwise</del> <tt>MoveConstructible</tt>.
! <tt><i>INVOKE</i>(f, w1, w2, ..., wN)</tt> (20.9.2 [func.require]) shall be a valid expression for
  some values <tt>w1, w2, ... , wN,</tt> where <tt>N == sizeof...(Args)</tt>.
  </p>
  <p>
*************** thread of execution, where <tt>t1, t2, .
*** 54002,54008 ****
  the following objects in memory which is accessible to a new thread of execution
  as if:</ins>
  </p>
! <blockquote><pre><ins>typename decay&lt;F&gt;::type g(std::forward&lt;F&gt;(f));</ins>
  <ins>tuple&lt;typename decay&lt;Args&gt;::type...&gt; w(std::forward&lt;Args&gt;(args)...);</ins>
  </pre></blockquote>
  <p>
--- 57352,57359 ----
  the following objects in memory which is accessible to a new thread of execution
  as if:</ins>
  </p>
! <blockquote><pre>
! <ins>typename decay&lt;F&gt;::type g(std::forward&lt;F&gt;(f));</ins>
  <ins>tuple&lt;typename decay&lt;Args&gt;::type...&gt; w(std::forward&lt;Args&gt;(args)...);</ins>
  </pre></blockquote>
  <p>
*************** Text referring to when <tt>terminate()</
*** 54030,54040 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution,
  but would like the final sentence to be reworded
  since "catchable" is not a term of art (and is used nowhere else).
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 57381,57391 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution,
  but would like the final sentence to be reworded
  since "catchable" is not a term of art (and is used nowhere else).
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** This is linked to
*** 54047,54053 ****
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2901.pdf">N2901</a>.
  </p>
  <p>
! Howard to open a separate issue to remove (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>).
  </p>
  <p>
  In Frankfurt there is no consensus for removing the variadic constructor.
--- 57398,57404 ----
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2901.pdf">N2901</a>.
  </p>
  <p>
! Howard to open a separate issue to remove (<a href="lwg-closed.html#1176">1176</a>).
  </p>
  <p>
  In Frankfurt there is no consensus for removing the variadic constructor.
*************** In Frankfurt there is no consensus for r
*** 54059,54068 ****
  ]</i></p>
  
  
! <blockquote>
! We want to move forward with this issue.  If we later take it out via <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1176">1176</a>
  then that's ok too.  Needs small group to improve wording.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
--- 57410,57419 ----
  ]</i></p>
  
  
! <blockquote><p>
! We want to move forward with this issue.  If we later take it out via <a href="lwg-closed.html#1176">1176</a>
  then that's ok too.  Needs small group to improve wording.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
*************** Modify the class definition of <tt>std::
*** 54079,54085 ****
  following signature:
  </p>
  
! <blockquote><pre><del>template&lt;class F&gt; explicit thread(F f);</del>
  template&lt;class F, class ... Args&gt; <ins>explicit</ins> thread(F&amp;&amp; f, Args&amp;&amp; ... args);
  </pre></blockquote>
  
--- 57430,57437 ----
  following signature:
  </p>
  
! <blockquote><pre>
! <del>template&lt;class F&gt; explicit thread(F f);</del>
  template&lt;class F, class ... Args&gt; <ins>explicit</ins> thread(F&amp;&amp; f, Args&amp;&amp; ... args);
  </pre></blockquote>
  
*************** following:
*** 54093,54099 ****
  <p>
  -4- <i>Requires:</i> <tt>F</tt> and each <tt>Ti</tt> in <tt>Args</tt> shall be <del><tt>CopyConstructible</tt>
  if an lvalue and otherwise</del> <tt>MoveConstructible</tt>.
! <tt><i>INVOKE</i>(f, w1, w2, ..., wN)</tt> (20.8.2 [func.require]) shall be a valid expression for
  some values <tt>w1, w2, ... , wN,</tt> where <tt>N == sizeof...(Args)</tt>.
  </p>
  <p>
--- 57445,57451 ----
  <p>
  -4- <i>Requires:</i> <tt>F</tt> and each <tt>Ti</tt> in <tt>Args</tt> shall be <del><tt>CopyConstructible</tt>
  if an lvalue and otherwise</del> <tt>MoveConstructible</tt>.
! <tt><i>INVOKE</i>(f, w1, w2, ..., wN)</tt> (20.9.2 [func.require]) shall be a valid expression for
  some values <tt>w1, w2, ... , wN,</tt> where <tt>N == sizeof...(Args)</tt>.
  </p>
  <p>
*************** thread of execution, where <tt>t1, t2, .
*** 54103,54109 ****
  <ins>Constructs
  the following objects:</ins>
  </p>
! <blockquote><pre><ins>typename decay&lt;F&gt;::type g(std::forward&lt;F&gt;(f));</ins>
  <ins>tuple&lt;typename decay&lt;Args&gt;::type...&gt; w(std::forward&lt;Args&gt;(args)...);</ins>
  </pre></blockquote>
  <p>
--- 57455,57462 ----
  <ins>Constructs
  the following objects:</ins>
  </p>
! <blockquote><pre>
! <ins>typename decay&lt;F&gt;::type g(std::forward&lt;F&gt;(f));</ins>
  <ins>tuple&lt;typename decay&lt;Args&gt;::type...&gt; w(std::forward&lt;Args&gt;(args)...);</ins>
  </pre></blockquote>
  <p>
*************** Modify the class definition of <tt>std::
*** 54138,54144 ****
  following signature:
  </p>
  
! <blockquote><pre><del>template&lt;class F&gt; explicit thread(F f);</del>
  template&lt;class F, class ... Args&gt; <ins>explicit</ins> thread(F&amp;&amp; f, Args&amp;&amp; ... args);
  </pre></blockquote>
  
--- 57491,57498 ----
  following signature:
  </p>
  
! <blockquote><pre>
! <del>template&lt;class F&gt; explicit thread(F f);</del>
  template&lt;class F, class ... Args&gt; <ins>explicit</ins> thread(F&amp;&amp; f, Args&amp;&amp; ... args);
  </pre></blockquote>
  
*************** template&lt;typename T&gt; typename deca
*** 54162,54171 ****
  -4- <i>Requires:</i> <tt>F</tt> and each <tt>Ti</tt> in <tt>Args</tt> shall
  <del>be <tt>CopyConstructible</tt> if an lvalue and otherwise</del> <ins>satisfy
  the</ins> <tt>MoveConstructible</tt> <ins>requirements</ins>.
! <del><tt><i>INVOKE</i>(f, w1, w2, ..., wN)</tt> (20.8.2 [func.require])
  shall be a valid expression for some values <tt>w1, w2, ... , wN,</tt> where
  <tt>N == sizeof...(Args)</tt>.</del>
! <ins><tt><i>INVOKE</i>(decay_copy(std::forward&lt;F&gt;(f)), decay_copy(std::forward&lt;Args&gt;(args))...)</tt> (20.8.2 [func.require]) shall be a valid expression.</ins>
  </p>
  
  <p>
--- 57516,57525 ----
  -4- <i>Requires:</i> <tt>F</tt> and each <tt>Ti</tt> in <tt>Args</tt> shall
  <del>be <tt>CopyConstructible</tt> if an lvalue and otherwise</del> <ins>satisfy
  the</ins> <tt>MoveConstructible</tt> <ins>requirements</ins>.
! <del><tt><i>INVOKE</i>(f, w1, w2, ..., wN)</tt> (20.9.2 [func.require])
  shall be a valid expression for some values <tt>w1, w2, ... , wN,</tt> where
  <tt>N == sizeof...(Args)</tt>.</del>
! <ins><tt><i>INVOKE</i>(decay_copy(std::forward&lt;F&gt;(f)), decay_copy(std::forward&lt;Args&gt;(args))...)</tt> (20.9.2 [func.require]) shall be a valid expression.</ins>
  </p>
  
  <p>
*************** decay_copy(std::forward&lt;Args&gt;(args
*** 54180,54186 ****
  the constructing thread. Any return value from this invocation is
  ignored. [<i>Note:</i> this implies any exceptions not thrown from the
  invocation of the copy of <tt>f</tt> will be thrown in the constructing thread,
! not the new thread. — <i>end note</i>].
  If the invocation of <tt><i>INVOKE</i>(decay_copy(std::forward&lt;F&gt;(f)),
  decay_copy(std::forward&lt;Args&gt;(args))...)</tt> terminates with an uncaught
  exception, <tt>std::terminate</tt> shall be called.
--- 57534,57540 ----
  the constructing thread. Any return value from this invocation is
  ignored. [<i>Note:</i> this implies any exceptions not thrown from the
  invocation of the copy of <tt>f</tt> will be thrown in the constructing thread,
! not the new thread. &mdash; <i>end note</i>].
  If the invocation of <tt><i>INVOKE</i>(decay_copy(std::forward&lt;F&gt;(f)),
  decay_copy(std::forward&lt;Args&gt;(args))...)</tt> terminates with an uncaught
  exception, <tt>std::terminate</tt> shall be called.
*************** invocation of <ins>the copy of</ins> <tt
*** 54199,54216 ****
  
  <hr>
  <h3><a name="931"></a>931. type trait <tt>extent&lt;T, I&gt;</tt></h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Yechezkel Mett <b>Opened:</b> 2008-11-04 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The draft (N2798) says in 20.7.4.3 [meta.unary.prop] Table 44: 
  </p>
  <blockquote>
  <table border="1">
  <caption>Table 44 -- Type property queries</caption>
! <tbody><tr><th>Template</th><th>Value</th></tr>
  <tr>
  <td>
  <tt>template &lt;class T, unsigned I = 0&gt; struct extent;</tt>
--- 57553,57571 ----
  
  <hr>
  <h3><a name="931"></a>931. type trait <tt>extent&lt;T, I&gt;</tt></h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Yechezkel Mett <b>Opened:</b> 2008-11-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The draft (N2798) says in 20.10.4.3 [meta.unary.prop] Table 44: 
  </p>
  <blockquote>
  <table border="1">
  <caption>Table 44 -- Type property queries</caption>
! <tr><th>Template</th><th>Value</th></tr>
  <tr>
  <td>
  <tt>template &lt;class T, unsigned I = 0&gt; struct extent;</tt>
*************** and <tt>T</tt> has type "array of unknow
*** 54222,54228 ****
  size of the <tt>I</tt>'th dimension of <tt>T</tt>
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
--- 57577,57583 ----
  size of the <tt>I</tt>'th dimension of <tt>T</tt>
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
*************** Recommend Tentatively Ready.
*** 54260,54273 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In Table 44 of 20.7.4.3 [meta.unary.prop], third row, column "Value",
  change the cell content:
  </p>
  
  <blockquote>
  <table border="1">
  <caption>Table 44 -- Type property queries</caption>
! <tbody><tr><th>Template</th><th>Value</th></tr>
  <tr>
  <td>
  <tt>template &lt;class T, unsigned I = 0&gt; struct extent;</tt>
--- 57615,57628 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In Table 44 of 20.10.4.3 [meta.unary.prop], third row, column "Value",
  change the cell content:
  </p>
  
  <blockquote>
  <table border="1">
  <caption>Table 44 -- Type property queries</caption>
! <tr><th>Template</th><th>Value</th></tr>
  <tr>
  <td>
  <tt>template &lt;class T, unsigned I = 0&gt; struct extent;</tt>
*************** and <tt>T</tt> has type "array of unknow
*** 54280,54286 ****
  where indexing of <tt>I</tt> is zero-based.</ins>
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p><i>[
--- 57635,57641 ----
  where indexing of <tt>I</tt> is zero-based.</ins>
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p><i>[
*************** Wording supplied by Daniel.
*** 54295,54320 ****
  
  <hr>
  <h3><a name="932"></a>932. <tt>unique_ptr(pointer p)</tt> for pointer deleter types</h3>
! <p><b>Section:</b> 20.9.9.2.1 [unique.ptr.single.ctor] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-11-26 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.single.ctor">issues</a> in [unique.ptr.single.ctor].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 79</b></p>
  
  <p>
! 20.9.9.2.1 [unique.ptr.single.ctor]/5 no longer requires for <tt>D</tt>
  not to be a pointer type.  I believe this restriction was accidently removed
  when we relaxed the completeness reuqirements on <tt>T</tt>. The restriction
  needs to be put back in.  Otherwise we have a run time failure that could
  have been caught at compile time:
  </p>
  
! <blockquote><pre>{
! unique_ptr&lt;int, void(*)(void*)&gt; p1(malloc(sizeof(int)));  <font color="#C80000">// should not compile</font>
! }  <font color="#C80000">// p1.~unique_ptr() dereferences a null function pointer</font>
! unique_ptr&lt;int, void(*)(void*)&gt; p2(malloc(sizeof(int)), free);  <font color="#C80000">// ok</font>
  </pre></blockquote>
  
  <p><i>[
--- 57650,57676 ----
  
  <hr>
  <h3><a name="932"></a>932. <tt>unique_ptr(pointer p)</tt> for pointer deleter types</h3>
! <p><b>Section:</b> 20.8.1.2.1 [unique.ptr.single.ctor] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-11-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.ctor">issues</a> in [unique.ptr.single.ctor].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 79</b></p>
  
  <p>
! 20.8.1.2.1 [unique.ptr.single.ctor]/5 no longer requires for <tt>D</tt>
  not to be a pointer type.  I believe this restriction was accidently removed
  when we relaxed the completeness reuqirements on <tt>T</tt>. The restriction
  needs to be put back in.  Otherwise we have a run time failure that could
  have been caught at compile time:
  </p>
  
! <blockquote><pre>
! {
! unique_ptr&lt;int, void(*)(void*)&gt; p1(malloc(sizeof(int)));  <span style="color:#C80000">// should not compile</span>
! }  <span style="color:#C80000">// p1.~unique_ptr() dereferences a null function pointer</span>
! unique_ptr&lt;int, void(*)(void*)&gt; p2(malloc(sizeof(int)), free);  <span style="color:#C80000">// ok</span>
  </pre></blockquote>
  
  <p><i>[
*************** Post Summit:
*** 54322,54341 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Moved from Tentatively Ready to Open only because the wording needs to be
! improved for enable_if type constraining, possibly following Robert's
  formula.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 57678,57697 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Tentatively Ready to Open only because the wording needs to be
! improved for <tt>enable_if</tt> type constraining, possibly following Robert's
  formula.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** The two constructors to which this issue
*** 54364,54370 ****
  with <tt>enable_if</tt> as they are not templated:
  </p>
  
! <blockquote><pre>unique_ptr();
  explicit unique_ptr(pointer p);
  </pre></blockquote>
  
--- 57720,57727 ----
  with <tt>enable_if</tt> as they are not templated:
  </p>
  
! <blockquote><pre>
! unique_ptr();
  explicit unique_ptr(pointer p);
  </pre></blockquote>
  
*************** is insufficient motivation for such hero
*** 54375,54381 ****
  reasonable implementation for these constructors:
  </p>
  
! <blockquote><pre>unique_ptr()
      : ptr_(pointer())
      {
          static_assert(!is_pointer&lt;deleter_type&gt;::value,
--- 57732,57739 ----
  reasonable implementation for these constructors:
  </p>
  
! <blockquote><pre>
! unique_ptr()
      : ptr_(pointer())
      {
          static_assert(!is_pointer&lt;deleter_type&gt;::value,
*************** the implementation from the Requires par
*** 54412,54427 ****
  <p>
  It is insufficient to require a diagnostic. This doesn't imply an
  ill-formed program
! as of 1.3.6 [defns.diagnostic] (a typical alternative would be a compiler
  warning), but
  exactly that seems to be the intend. I suggest to use the following
  remark instead:
  </p>
  
! <blockquote>
  <i>Remarks:</i> The program shall be ill-formed if this constructor is
  instantiated when <tt>D</tt> is a pointer type or reference type.
! </blockquote>
  
  <p>
  Via the general standard rules of 1.4 [intro.compliance] the "diagnostic
--- 57770,57785 ----
  <p>
  It is insufficient to require a diagnostic. This doesn't imply an
  ill-formed program
! as of 1.3 [defns.diagnostic] (a typical alternative would be a compiler
  warning), but
  exactly that seems to be the intend. I suggest to use the following
  remark instead:
  </p>
  
! <blockquote><p>
  <i>Remarks:</i> The program shall be ill-formed if this constructor is
  instantiated when <tt>D</tt> is a pointer type or reference type.
! </p></blockquote>
  
  <p>
  Via the general standard rules of 1.4 [intro.compliance] the "diagnostic
*************** required" is implied.
*** 54435,54455 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  <p><i>[
  2010-03-14 Howard adds:
  ]</i></p>
  
  
! <blockquote>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </blockquote>
  
  
  
--- 57793,57813 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  <p><i>[
  2010-03-14 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </p></blockquote>
  
  
  
*************** Solved by <a href="http://www.open-std.o
*** 54461,54470 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the description of the default constructor in 20.9.9.2.1 [unique.ptr.single.ctor]:
  </p>
  
! <blockquote><pre>unique_ptr();
  </pre>
  <blockquote>
  <p>
--- 57819,57829 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the description of the default constructor in 20.8.1.2.1 [unique.ptr.single.ctor]:
  </p>
  
! <blockquote><pre>
! unique_ptr();
  </pre>
  <blockquote>
  <p>
*************** not be a reference type or pointer type
*** 54476,54498 ****
  <p><ins>
  <i>Remarks:</i> The program shall be ill-formed if this constructor is
  instantiated when <tt>D</tt> is a pointer type or reference type.
- 
  </ins></p>
  </blockquote>
  </blockquote>
  
  <p>
! Add  after 20.9.9.2.1 [unique.ptr.single.ctor]/8:
  </p>
  
! <blockquote><pre>unique_ptr(pointer p);
  </pre>
  <blockquote>
  <p>...</p>
  <p><ins>
  <i>Remarks:</i> The program shall be ill-formed if this constructor is
  instantiated when <tt>D</tt> is a pointer type or reference type.
- 
  </ins></p>
  </blockquote>
  </blockquote>
--- 57835,57856 ----
  <p><ins>
  <i>Remarks:</i> The program shall be ill-formed if this constructor is
  instantiated when <tt>D</tt> is a pointer type or reference type.
  </ins></p>
  </blockquote>
  </blockquote>
  
  <p>
! Add  after 20.8.1.2.1 [unique.ptr.single.ctor]/8:
  </p>
  
! <blockquote><pre>
! unique_ptr(pointer p);
  </pre>
  <blockquote>
  <p>...</p>
  <p><ins>
  <i>Remarks:</i> The program shall be ill-formed if this constructor is
  instantiated when <tt>D</tt> is a pointer type or reference type.
  </ins></p>
  </blockquote>
  </blockquote>
*************** instantiated when <tt>D</tt> is a pointe
*** 54503,54512 ****
  
  <hr>
  <h3><a name="934"></a>934. <tt>duration</tt> is missing <tt>operator%</tt></h3>
! <p><b>Section:</b> 20.11.3 [time.duration] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Terry Golubiewski <b>Opened:</b> 2008-11-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.duration">issues</a> in [time.duration].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 81</b></p>
--- 57861,57870 ----
  
  <hr>
  <h3><a name="934"></a>934. <tt>duration</tt> is missing <tt>operator%</tt></h3>
! <p><b>Section:</b> 20.12.5 [time.duration] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Terry Golubiewski <b>Opened:</b> 2008-11-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration">issues</a> in [time.duration].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US 81</b></p>
*************** motivating example is converting a <tt>d
*** 54518,54524 ****
  time duration such as hours::minutes::seconds:
  </p>
  
! <blockquote><pre>class ClockTime
  {
      typedef std::chrono::hours hours;
      typedef std::chrono::minutes minutes;
--- 57876,57883 ----
  time duration such as hours::minutes::seconds:
  </p>
  
! <blockquote><pre>
! class ClockTime
  {
      typedef std::chrono::hours hours;
      typedef std::chrono::minutes minutes;
*************** Summit:
*** 54542,54571 ****
  ]</i></p>
  
  
! <blockquote>
  Agree except that there is a typo in the proposed resolution. The member
! operators should be operator%=.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Moved from Tentatively Ready to Open only because the wording needs to be
  improved for enable_if type constraining, possibly following Robert's
  formula.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
--- 57901,57930 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree except that there is a typo in the proposed resolution. The member
! operators should be <tt>operator%=</tt>.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Tentatively Ready to Open only because the wording needs to be
  improved for enable_if type constraining, possibly following Robert's
  formula.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
*************** formula.
*** 54574,54582 ****
  
  <blockquote>
  <p>
! Howard to open a separate issue (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>) to handle the removal of member
  functions from overload sets, provide wording, and possibly demonstrate
! how this can be implemented using enable_if (see <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a>).
  </p>
  <p>
  Move to Ready.
--- 57933,57941 ----
  
  <blockquote>
  <p>
! Howard to open a separate issue (<a href="lwg-defects.html#1177">1177</a>) to handle the removal of member
  functions from overload sets, provide wording, and possibly demonstrate
! how this can be implemented using enable_if (see <a href="lwg-defects.html#947">947</a>).
  </p>
  <p>
  Move to Ready.
*************** Move to Ready.
*** 54587,54596 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to the synopsis in 20.11 [time]:
  </p>
  
! <blockquote><pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator%(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  template &lt;class Rep1, class Period1, class Rep2, class Period2&gt;
--- 57946,57956 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to the synopsis in 20.12 [time]:
  </p>
  
! <blockquote><pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator%(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  template &lt;class Rep1, class Period1, class Rep2, class Period2&gt;
*************** template &lt;class Rep1, class Period1,
*** 54599,54608 ****
  </pre></blockquote>
  
  <p>
! Add to the synopsis of <tt>duration</tt> in 20.11.3 [time.duration]:
  </p>
  
! <blockquote><pre>template &lt;class Rep, class Period = ratio&lt;1&gt;&gt;
  class duration {
  public:
    ...
--- 57959,57969 ----
  </pre></blockquote>
  
  <p>
! Add to the synopsis of <tt>duration</tt> in 20.12.5 [time.duration]:
  </p>
  
! <blockquote><pre>
! template &lt;class Rep, class Period = ratio&lt;1&gt;&gt;
  class duration {
  public:
    ...
*************** public:
*** 54613,54623 ****
  </pre></blockquote>
  
  <p>
! Add to 20.11.3.3 [time.duration.arithmetic]:
  </p>
  
  <blockquote>
! <pre>duration&amp; operator%=(const rep&amp; rhs);
  </pre>
  <blockquote>
  <p>
--- 57974,57985 ----
  </pre></blockquote>
  
  <p>
! Add to 20.12.5.3 [time.duration.arithmetic]:
  </p>
  
  <blockquote>
! <pre>
! duration&amp; operator%=(const rep&amp; rhs);
  </pre>
  <blockquote>
  <p>
*************** Add to 20.11.3.3 [time.duration.arithmet
*** 54628,54634 ****
  </p>
  </blockquote>
  
! <pre>duration&amp; operator%=(const duration&amp; d);
  </pre>
  <blockquote>
  <p>
--- 57990,57997 ----
  </p>
  </blockquote>
  
! <pre>
! duration&amp; operator%=(const duration&amp; d);
  </pre>
  <blockquote>
  <p>
*************** Add to 20.11.3.3 [time.duration.arithmet
*** 54641,54652 ****
  </blockquote>
  
  <p>
! Add to 20.11.3.5 [time.duration.nonmember]:
  </p>
  
  <blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator%(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
--- 58004,58016 ----
  </blockquote>
  
  <p>
! Add to 20.12.5.5 [time.duration.nonmember]:
  </p>
  
  <blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator%(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
*************** Add to 20.11.3.5 [time.duration.nonmembe
*** 54660,54666 ****
  </p>
  </blockquote>
  
! <pre>template &lt;class Rep1, class Period1, class Rep2, class Period2&gt;
    typename common_type&lt;duration&lt;Rep1, Period1&gt;, duration&lt;Rep2, Period2&gt;&gt;::type
    operator%(const duration&lt;Rep1, Period1&gt;&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
  </pre>
--- 58024,58031 ----
  </p>
  </blockquote>
  
! <pre>
! template &lt;class Rep1, class Period1, class Rep2, class Period2&gt;
    typename common_type&lt;duration&lt;Rep1, Period1&gt;, duration&lt;Rep2, Period2&gt;&gt;::type
    operator%(const duration&lt;Rep1, Period1&gt;&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
  </pre>
*************** Add to 20.11.3.5 [time.duration.nonmembe
*** 54679,54695 ****
  
  <hr>
  <h3><a name="938"></a>938. <tt>default_delete&lt;T[]&gt;::operator()</tt> should only accept <tt>T*</tt></h3>
! <p><b>Section:</b> 20.9.9.1.3 [unique.ptr.dltr.dflt1] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-12-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider:
  </p>
  
! <blockquote><pre>derived* p = new derived[3];
  std::default_delete&lt;base[]&gt; d;
! d(p);  <font color="#C80000">// should fail</font>
  </pre></blockquote>
  
  <p>
--- 58044,58061 ----
  
  <hr>
  <h3><a name="938"></a>938. <tt>default_delete&lt;T[]&gt;::operator()</tt> should only accept <tt>T*</tt></h3>
! <p><b>Section:</b> 20.8.1.1.3 [unique.ptr.dltr.dflt1] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-12-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider:
  </p>
  
! <blockquote><pre>
! derived* p = new derived[3];
  std::default_delete&lt;base[]&gt; d;
! d(p);  <span style="color:#C80000">// should fail</span>
  </pre></blockquote>
  
  <p>
*************** Post Summit:
*** 54702,54727 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend Review.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 20.9.9.1.3 [unique.ptr.dltr.dflt1]:
  </p>
  
! <blockquote><pre>namespace std {
    template &lt;class T&gt; struct default_delete&lt;T[]&gt; {
      void operator()(T*) const;
    <ins>template &lt;class U&gt; void operator()(U*) const = delete;</ins>
--- 58068,58094 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Review.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 20.8.1.1.3 [unique.ptr.dltr.dflt1]:
  </p>
  
! <blockquote><pre>
! namespace std {
    template &lt;class T&gt; struct default_delete&lt;T[]&gt; {
      void operator()(T*) const;
    <ins>template &lt;class U&gt; void operator()(U*) const = delete;</ins>
*************** Add to 20.9.9.1.3 [unique.ptr.dltr.dflt1
*** 54735,54744 ****
  
  <hr>
  <h3><a name="939"></a>939. Problem with <tt>std::identity</tt> and reference-to-temporaries</h3>
! <p><b>Section:</b> 20.3.3 [forward] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-12-11 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>std::identity</tt> takes an argument of type <tt>T const &amp;</tt>
--- 58102,58111 ----
  
  <hr>
  <h3><a name="939"></a>939. Problem with <tt>std::identity</tt> and reference-to-temporaries</h3>
! <p><b>Section:</b> 20.2.4 [forward] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2008-12-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>std::identity</tt> takes an argument of type <tt>T const &amp;</tt>
*************** types
*** 54761,54767 ****
  <p>
  ii/ Provide an additional overload:
  </p>
! <blockquote><pre>template&lt; typename T &gt;
  template operator( U &amp; ) = delete;
  </pre></blockquote>
  <p>
--- 58128,58135 ----
  <p>
  ii/ Provide an additional overload:
  </p>
! <blockquote><pre>
! template&lt; typename T &gt;
  template operator( U &amp; ) = delete;
  </pre></blockquote>
  <p>
*************** my latest reformulation of <tt>forward</
*** 54838,54844 ****
  at Summit, no longer uses <tt>identity</tt>. :-)
  </p>
  
! <blockquote><pre>template &lt;class T, class U,
      class = typename enable_if
              &lt;
                  !is_lvalue_reference&lt;T&gt;::value || 
--- 58206,58213 ----
  at Summit, no longer uses <tt>identity</tt>. :-)
  </p>
  
! <blockquote><pre>
! template &lt;class T, class U,
      class = typename enable_if
              &lt;
                  !is_lvalue_reference&lt;T&gt;::value || 
*************** forward(U&amp;&amp; t)
*** 54860,54866 ****
  </pre>
  
  <p><i>[
! The above code assumes acceptance of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1120">1120</a> for the definition of
  <tt>remove_all</tt>.  This is just to make the syntax a little more palatable.
  Without this trait the above is still very implementable.
  ]</i></p>
--- 58229,58235 ----
  </pre>
  
  <p><i>[
! The above code assumes acceptance of <a href="lwg-active.html#1120">1120</a> for the definition of
  <tt>remove_all</tt>.  This is just to make the syntax a little more palatable.
  Without this trait the above is still very implementable.
  ]</i></p>
*************** Paper with rationale is on the way ... <
*** 54874,54880 ****
  </blockquote>
  
  <p><i>[
! 2009-07-30 Daniel adds:  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#823">823</a> for an alternative resolution.
  ]</i></p>
  
  
--- 58243,58249 ----
  </blockquote>
  
  <p><i>[
! 2009-07-30 Daniel adds:  See <a href="lwg-defects.html#823">823</a> for an alternative resolution.
  ]</i></p>
  
  
*************** Paper with rationale is on the way ... <
*** 54883,54908 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready. Howard will update proposed wording to reflect current draft.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Strike from 20.3 [utility]:
  </p>
  
! <blockquote><pre><del>template &lt;class T&gt; struct identity;</del>
  </pre></blockquote>
  
  <p>
! Remove from 20.3.3 [forward]:
  </p>
  
  <blockquote>
! <pre><del>template &lt;class T&gt; struct identity {
    typedef T type;
  
    const T&amp; operator()(const T&amp; x) const;
--- 58252,58279 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready. Howard will update proposed wording to reflect current draft.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Strike from 20.2 [utility]:
  </p>
  
! <blockquote><pre>
! <del>template &lt;class T&gt; struct identity;</del>
  </pre></blockquote>
  
  <p>
! Remove from 20.2.4 [forward]:
  </p>
  
  <blockquote>
! <pre>
! <del>template &lt;class T&gt; struct identity {
    typedef T type;
  
    const T&amp; operator()(const T&amp; x) const;
*************** Remove from 20.3.3 [forward]:
*** 54910,54920 ****
  
  <del>const T&amp; operator()(const T&amp; x) const;</del>
  </pre>
! <blockquote>
  <del>-2-  <i>Returns:</i> <tt>x</tt></del>
  </blockquote>
  </blockquote>
  
  
  
  
--- 58281,58529 ----
  
  <del>const T&amp; operator()(const T&amp; x) const;</del>
  </pre>
! <blockquote><p>
  <del>-2-  <i>Returns:</i> <tt>x</tt></del>
+ </p></blockquote>
  </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="940"></a>940. <tt>std::distance</tt></h3>
+ <p><b>Section:</b> 24.4.4 [iterator.operations] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Thomas <b>Opened:</b> 2008-12-14 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#iterator.operations">issues</a> in [iterator.operations].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 270</b></p>
+ 
+ <p>
+ Regarding the <tt>std::distance</tt> - function, 24.4.4 [iterator.operations]
+ p.4 says:
+ </p>
+ <blockquote><p>
+ Returns the number of increments or decrements needed to get from first to last.
+ </p></blockquote>
+ <p>
+ This sentence is completely silent about the sign of the return value.
+ 24.4.4 [iterator.operations] p.1 gives more information about the
+ underlying operations, but again no inferences about the sign can be made.
+ Strictly speaking, that is taking that sentence literally, I think this
+ sentence even implies a positive return value in all cases, as the
+ number of increments or decrements is clearly a ratio scale variable,
+ with a natural zero bound.
+ </p>
+ <p>
+ Practically speaking, my implementations did what common sense and
+ knowledge based on pointer arithmetic forecasts, namely a positive sign
+ for increments (that is, going from <tt>first</tt> to <tt>last</tt> by <tt>operator++</tt>), and a
+ negative sign for decrements (going from <tt>first</tt> to <tt>last</tt> by <tt>operator--</tt>).
+ </p>
+ <p>
+ Here are my two questions:
+ </p>
+ <p>
+ First, is that paragraph supposed to be interpreted in the way what I
+ called 'common sense', that is negative sign for decrements ? I am
+ fairly sure that's the supposed behavior, but a double-check here in
+ this group can't hurt.
+ </p>
+ <p>
+ Second, is the present wording (2003 standard version - no idea about
+ the draft for the upcoming standard) worth an edit to make it a bit more
+ sensible, to mention the sign of the return value explicitly ?
+ </p>
+ 
+ <p><i>[
+ Daniel adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ My first thought was that resolution <a href="lwg-closed.html#204">204</a> would already cover the
+ issue report, but it seems that current normative wording is in
+ contradiction to that resolution:
+ </p>
+ 
+ <p>
+ Referring to
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>,
+ 24.4.4 [iterator.operations]/ p.4 says:
+ </p>
+ 
+ <blockquote><p>
+ <i>Effects:</i> Returns the number of increments or decrements needed to get
+ from <tt>first</tt> to <tt>last</tt>.
+ </p></blockquote>
+ 
+ <p>
+ IMO the part " or decrements" is in contradiction to p. 5 which says
+ </p>
+ 
+ <blockquote><p>
+ <i>Requires:</i> <tt>last</tt> shall be reachable from <tt>first</tt>.
+ </p></blockquote>
+ 
+ <p>
+ because "reachable" is defined in X [iterator.concepts]/7 as
+ </p>
+ 
+ <blockquote><p>
+ An iterator <tt>j</tt> is called reachable from an iterator <tt>i</tt> if and only if
+ there is a finite sequence of applications of the expression <tt>++i</tt> that makes 
+ <tt>i == j</tt>.[..]
+ </p></blockquote>
+ 
+ <p>
+ Here is wording that would be consistent with this definition of "reachable":
+ </p>
+ 
+ <p>
+ Change 24.4.4 [iterator.operations] p4 as follows:
+ </p>
+ 
+ <blockquote><p>
+ <i>Effects:</i> Returns the number of increments <del>or decrements</del>
+ needed to get from <tt>first</tt> to <tt>last</tt>.
+ </p></blockquote>
+ 
  </blockquote>
  
+ <p>
+ Thomas adds more discussion and an alternative view point
+ <a href="http://groups.google.com/group/comp.std.c++/browse_thread/thread/e8e46dcda0a5d797#">here</a>.
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ The proposed wording below was verbally agreed to.  Howard provided.
+ </p></blockquote>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote>
+ <p>
+ Pete reports that a recent similar change has been made
+ for the <tt>advance()</tt> function.
+ </p>
+ <p>
+ We agree with the proposed resolution.
+ Move to Tentatively Ready.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved from Tentatively Ready to Open only because the wording needs to be
+ tweaked for concepts removal.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-07 Frankfurt:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Leave Open pending arrival of a post-Concepts WD.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10-14 Daniel provided de-conceptified wording.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to Ready, replacing the Effects clause in the proposed wording with
+ "If InputIterator meets the requirements of random access iterator then
+ returns (last - first), otherwise returns the number of increments
+ needed to get from first to list.".
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li>
+ <p>
+ Change 24.2.7 [random.access.iterators], Table 105 as indicated [This change is not
+ essential but it simplifies the specification] for the row with expression "<tt>b - a</tt>"
+ and the column Operational semantics:
+ </p>
+ 
+ <blockquote><pre>
+ <del>(a &lt; b) ? </del>distance(a,b)
+ <del>: -distance(b,a)</del>
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Change 24.4.4 [iterator.operations]/4+5 as indicated:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;class InputIterator&gt;
+   typename iterator_traits&lt;InputIterator&gt;::difference_type
+     distance(InputIterator first, InputIterator last);
+ </pre>
+ <blockquote>
+ <p>
+ 4 <i>Effects:</i> <ins>If <tt>InputIterator</tt> meets the requirements
+ of random access iterator then returns <tt>(last - first)</tt>,
+ otherwise</ins> <del>R</del><ins>r</ins>eturns the number of increments
+ <del>or decrements</del> needed to get from <tt>first</tt> to
+ <tt>last</tt>.
+ </p>
+ 
+ <p>
+ 5 <i>Requires:</i> <ins>If <tt>InputIterator</tt> meets the requirements
+ of random access iterator then <tt>last</tt> shall be reachable from
+ <tt>first</tt> or <tt>first</tt> shall be reachable from <tt>last</tt>,
+ otherwise</ins> <tt>last</tt> shall be reachable from <tt>first</tt>.
+ </p>
+ </blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
  
  
  
*************** Remove from 20.3.3 [forward]:
*** 54922,54935 ****
  
  <hr>
  <h3><a name="943"></a>943. <tt>ssize_t</tt> undefined</h3>
! <p><b>Section:</b> 29.5.2 [atomics.types.address] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Holger Grund <b>Opened:</b> 2008-12-19 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is a row in "Table 122 - Atomics for standard typedef types"
! in 29.5.1 [atomics.types.integral] with <tt>atomic_ssize_t</tt>
  and <tt>ssize_t</tt>. Unless, I'm missing something <tt>ssize_t</tt>
  is not defined by the standard.
  </p>
--- 58531,58544 ----
  
  <hr>
  <h3><a name="943"></a>943. <tt>ssize_t</tt> undefined</h3>
! <p><b>Section:</b> X [atomics.types.address] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Holger Grund <b>Opened:</b> 2008-12-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is a row in "Table 122 - Atomics for standard typedef types"
! in X [atomics.types.integral] with <tt>atomic_ssize_t</tt>
  and <tt>ssize_t</tt>. Unless, I'm missing something <tt>ssize_t</tt>
  is not defined by the standard.
  </p>
*************** Summit:
*** 54939,54963 ****
  ]</i></p>
  
  
! <blockquote>
! Move to review. Proposed resolution: Remove the typedef. Note: ssize_t
  is a POSIX type.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  Remove the row containing <tt>ssize_t</tt> from Table 119
! "Atomics for standard typedef types" in 29.5.2 [atomics.types.address].
  </p>
  
  
--- 58548,58572 ----
  ]</i></p>
  
  
! <blockquote><p>
! Move to review. Proposed resolution: Remove the typedef. Note: <tt>ssize_t</tt>
  is a POSIX type.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  Remove the row containing <tt>ssize_t</tt> from Table 119
! "Atomics for standard typedef types" in X [atomics.types.address].
  </p>
  
  
*************** Remove the row containing <tt>ssize_t</t
*** 54965,54982 ****
  
  
  <hr>
! <h3><a name="947"></a>947. duration arithmetic: contradictory requirements</h3>
! <p><b>Section:</b> 20.11.3.5 [time.duration.nonmember] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-12-20 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.duration.nonmember">issues</a> in [time.duration.nonmember].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.11.3.5 [time.duration.nonmember], paragraph 8 says that calling
! <tt>dur / rep</tt>
! when <tt>rep</tt> is an instantiation of <tt>duration</tt> requires a diagnostic.
! That's followed by an <tt>operator/</tt> that takes two durations.
! So <tt>dur1 / dur2</tt> is legal under the second version,
  but requires a diagnostic under the first.
  </p>
  
--- 58574,58674 ----
  
  
  <hr>
! <h3><a name="944"></a>944. <tt>atomic&lt;bool&gt;</tt> derive from <tt>atomic_bool</tt>?</h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Holger Grund <b>Opened:</b> 2008-12-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.generic">active issues</a> in [atomics.types.generic].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! I think it's fairly obvious that <tt>atomic&lt;bool&gt;</tt> is supposed to be derived
! from <tt>atomic_bool</tt> (and otherwise follow the <tt>atomic&lt;integral&gt;</tt> interface),
! though I think the current wording doesn't support this. I raised this
! point along with <tt>atomic&lt;floating-point&gt;</tt> privately with Herb and I seem
! to recall it came up in the resulting discussion on this list. However,
! I don't see anything on the current libs issue list mentioning this
! problem.
! </p>
! 
! <p>
! 29.5 [atomics.types.generic]/3 reads
! </p>
! 
! <blockquote><p>
! There are full specializations over the integral types on the atomic
! class template. For each integral type integral in the second column of
! table 121 or table 122, the specialization <tt>atomic&lt;integral&gt;</tt> shall be
! publicly derived from the corresponding atomic integral type in the
! first column of the table. These specializations shall have trivial
! default constructors and trivial destructors.
! </p></blockquote>
! 
! <p>
! Table 121 does not include (<tt>atomic_bool</tt>, <tt>bool</tt>),
! so that this should probably be mentioned explicitly in the quoted paragraph.
! </p>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote><p>
! Move to open. Lawrence will draft a proposed resolution. Also, ask
! Howard to fix the title.
! </p></blockquote>
! 
! <p><i>[
! Post Summit Anthony provided proposed wording.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Replace paragraph 3 in 29.5 [atomics.types.generic] with
! </p>
! 
! <blockquote><p>
! -3- There are full specializations over the integral types on the <tt>atomic</tt>
! class template. For each integral type <tt>integral</tt> in the second column of
! table 121 or table 122, the specialization <tt>atomic&lt;integral&gt;</tt> shall be
! publicly derived from the corresponding atomic integral type in the first
! column of the table.
! <ins>In addition, the specialization <tt>atomic&lt;bool&gt;</tt>
! shall be publicly derived from <tt>atomic_bool</tt>.</ins>
! These specializations shall have trivial default
! constructors and trivial destructors.
! </p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="947"></a>947. <tt>duration</tt> arithmetic: contradictory requirements</h3>
! <p><b>Section:</b> 20.12.5.5 [time.duration.nonmember] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2008-12-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration.nonmember">issues</a> in [time.duration.nonmember].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 20.12.5.5 [time.duration.nonmember], paragraph 8 says that calling
! <tt>dur / rep</tt> when <tt>rep</tt> is an instantiation of <tt>duration</tt> 
! requires a diagnostic. That's followed by an <tt>operator/</tt> that takes 
! two durations. So <tt>dur1 / dur2</tt> is legal under the second version,
  but requires a diagnostic under the first.
  </p>
  
*************** Howard adds:
*** 54985,55001 ****
  ]</i></p>
  
  
! <blockquote>
  Please see the thread starting with c++std-lib-22980 for more information.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, pending proposed wording (and preferably an implementation).
! </blockquote>
  
  <p><i>[
  2009-07-27 Howard adds:
--- 58677,58693 ----
  ]</i></p>
  
  
! <blockquote><p>
  Please see the thread starting with c++std-lib-22980 for more information.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open, pending proposed wording (and preferably an implementation).
! </p></blockquote>
  
  <p><i>[
  2009-07-27 Howard adds:
*************** Move to Open, pending proposed wording (
*** 55004,55018 ****
  
  <blockquote>
  <p>
! I've addressed this issue under the proposed wording for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a> which
! cleans up several places under 20.11.3 [time.duration] which used the
  phrase "diagnostic required".
  </p>
  <p>
  For clarity's sake, here is an example implementation of the constrained <tt>operator/</tt>:
  </p>
  
! <blockquote><pre>template &lt;class _Duration, class _Rep, bool = __is_duration&lt;_Rep&gt;::value&gt;
  struct __duration_divide_result
  {
  };
--- 58696,58711 ----
  
  <blockquote>
  <p>
! I've addressed this issue under the proposed wording for <a href="lwg-defects.html#1177">1177</a> which
! cleans up several places under 20.12.5 [time.duration] which used the
  phrase "diagnostic required".
  </p>
  <p>
  For clarity's sake, here is an example implementation of the constrained <tt>operator/</tt>:
  </p>
  
! <blockquote><pre>
! template &lt;class _Duration, class _Rep, bool = __is_duration&lt;_Rep&gt;::value&gt;
  struct __duration_divide_result
  {
  };
*************** The constrained <tt>operator%</tt> works
*** 55067,55075 ****
  ]</i></p>
  
  
! <blockquote>
! Mark <del>NAD Editorial</del><ins>Resolved</ins>, fixed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>.
! </blockquote>
  
  
  
--- 58760,58768 ----
  ]</i></p>
  
  
! <blockquote><p>
! Mark <del>NAD Editorial</del><ins>Resolved</ins>, fixed by <a href="lwg-defects.html#1177">1177</a>.
! </p></blockquote>
  
  
  
*************** Mark <del>NAD Editorial</del><ins>Resolv
*** 55083,55096 ****
  
  <hr>
  <h3><a name="948"></a>948. <tt>ratio</tt> arithmetic tweak</h3>
! <p><b>Section:</b> 20.6.2 [ratio.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-12-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ratio.arithmetic">issues</a> in [ratio.arithmetic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2800.pdf">N2800</a>,
! 20.6.2 [ratio.arithmetic] lacks a paragraph from the proposal
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.htm">N2661</a>:
  </p>
  
--- 58776,58789 ----
  
  <hr>
  <h3><a name="948"></a>948. <tt>ratio</tt> arithmetic tweak</h3>
! <p><b>Section:</b> 20.11.4 [ratio.arithmetic] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2008-12-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ratio.arithmetic">issues</a> in [ratio.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2800.pdf">N2800</a>,
! 20.11.4 [ratio.arithmetic] lacks a paragraph from the proposal
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2661.htm">N2661</a>:
  </p>
  
*************** For example:
*** 55117,55131 ****
  </p>
  
  <blockquote>
! <pre>template &lt;class R1, class R2&gt; struct ratio_multiply {
    typedef <i>see below</i>} type; 
  </pre>
  
! <blockquote>
  The nested typedef type shall be a synonym for <tt>ratio&lt;T1, T2&gt;</tt> where
  <tt>T1</tt> has the value <tt>R1::num * R2::num</tt> and <tt>T2</tt> has the
  value <tt>R1::den * R2::den</tt>.
! </blockquote>
  
  </blockquote>
  
--- 58810,58825 ----
  </p>
  
  <blockquote>
! <pre>
! template &lt;class R1, class R2&gt; struct ratio_multiply {
    typedef <i>see below</i>} type; 
  </pre>
  
! <blockquote><p>
  The nested typedef type shall be a synonym for <tt>ratio&lt;T1, T2&gt;</tt> where
  <tt>T1</tt> has the value <tt>R1::num * R2::num</tt> and <tt>T2</tt> has the
  value <tt>R1::den * R2::den</tt>.
! </p></blockquote>
  
  </blockquote>
  
*************** Consider the case where <tt>intmax_t</tt
*** 55134,55140 ****
  and we have:
  </p>
  
! <blockquote><pre>typedef std::ratio&lt;0x7FFFFFFFFFFFFFFF, 0x7FFFFFFFFFFFFFF0&gt; R1;
  typedef std::ratio&lt;8, 7&gt; R2;
  typedef std::ratio_multiply&lt;R1, R2&gt;::type RT;
  </pre></blockquote>
--- 58828,58835 ----
  and we have:
  </p>
  
! <blockquote><pre>
! typedef std::ratio&lt;0x7FFFFFFFFFFFFFFF, 0x7FFFFFFFFFFFFFF0&gt; R1;
  typedef std::ratio&lt;8, 7&gt; R2;
  typedef std::ratio_multiply&lt;R1, R2&gt;::type RT;
  </pre></blockquote>
*************** by <tt>7</tt> obtaining <tt>0x1249249249
*** 55152,55165 ****
  then the exact result can then be computed without overflow:
  </p>
  
! <blockquote><pre>[0x7FFFFFFFFFFFFFFF/0x7FFFFFFFFFFFFFF0] * [8/7] = [0x1249249249249249/0x0FFFFFFFFFFFFFFE]
  </pre></blockquote>
  
  <p>
  Example implmentation which accomplishes this:
  </p>
  
! <blockquote><pre>template &lt;class R1, class R2&gt;
  struct ratio_multiply
  {
  private:
--- 58847,58862 ----
  then the exact result can then be computed without overflow:
  </p>
  
! <blockquote><pre>
! [0x7FFFFFFFFFFFFFFF/0x7FFFFFFFFFFFFFF0] * [8/7] = [0x1249249249249249/0x0FFFFFFFFFFFFFFE]
  </pre></blockquote>
  
  <p>
  Example implmentation which accomplishes this:
  </p>
  
! <blockquote><pre>
! template &lt;class R1, class R2&gt;
  struct ratio_multiply
  {
  private:
*************** Post Summit:
*** 55176,55197 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend Tentatively Ready.
! </blockquote>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a paragraph prior to p1 in 20.6.2 [ratio.arithmetic]:
  </p>
  
! <blockquote>
  Implementations may use other algorithms to compute the indicated ratios to avoid overflow. 
  If overflow occurs, a diagnostic shall be issued.
! </blockquote>
  
  
  
--- 58873,58894 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Tentatively Ready.
! </p></blockquote>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a paragraph prior to p1 in 20.11.4 [ratio.arithmetic]:
  </p>
  
! <blockquote><p>
  Implementations may use other algorithms to compute the indicated ratios to avoid overflow. 
  If overflow occurs, a diagnostic shall be issued.
! </p></blockquote>
  
  
  
*************** If overflow occurs, a diagnostic shall b
*** 55199,55210 ****
  
  <hr>
  <h3><a name="949"></a>949. <tt>owner_less</tt></h3>
! <p><b>Section:</b> 20.9.10.3.7 [util.smartptr.ownerless] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2008-12-30 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.9.10.3.7 [util.smartptr.ownerless] (class template <tt>owner_less</tt>) says that 
  <tt>operator()(x,y)</tt> shall return <tt>x.before(y)</tt>.
  </p>
  <p>
--- 58896,58907 ----
  
  <hr>
  <h3><a name="949"></a>949. <tt>owner_less</tt></h3>
! <p><b>Section:</b> 20.8.2.4 [util.smartptr.ownerless] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2008-12-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.8.2.4 [util.smartptr.ownerless] (class template <tt>owner_less</tt>) says that 
  <tt>operator()(x,y)</tt> shall return <tt>x.before(y)</tt>.
  </p>
  <p>
*************** Herve adds:
*** 55221,55268 ****
  ]</i></p>
  
  
! <blockquote>
  Agreed with the typo, it should be "shall return <tt>x.owner_before(y)</tt>".
! </blockquote>
  
  <p><i>[
  Post Summit:
  ]</i></p>
  
  
! <blockquote>
  Recommend Tentatively Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.10.3.7 [util.smartptr.ownerless] p2:
  </p>
  
! <blockquote>
  -2- <tt>operator()(x,y)</tt> shall return
  <tt>x.<ins>owner_</ins>before(y)</tt>. [<i>Note:</i> ...
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="950"></a>950. unique_ptr converting ctor shouldn't accept array form</h3>
! <p><b>Section:</b> 20.9.9.2.1 [unique.ptr.single.ctor] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.single.ctor">issues</a> in [unique.ptr.single.ctor].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>unique_ptr</tt>'s of array type should not convert to
  <tt>unique_ptr</tt>'s which do not have an array type.
  </p>
  
! <blockquote><pre>struct Deleter
  {
     void operator()(void*) {}
  };
--- 58918,58966 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agreed with the typo, it should be "shall return <tt>x.owner_before(y)</tt>".
! </p></blockquote>
  
  <p><i>[
  Post Summit:
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Tentatively Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.2.4 [util.smartptr.ownerless] p2:
  </p>
  
! <blockquote><p>
  -2- <tt>operator()(x,y)</tt> shall return
  <tt>x.<ins>owner_</ins>before(y)</tt>. [<i>Note:</i> ...
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="950"></a>950. <tt>unique_ptr</tt> converting ctor shouldn't accept array form</h3>
! <p><b>Section:</b> 20.8.1.2.1 [unique.ptr.single.ctor] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.ctor">issues</a> in [unique.ptr.single.ctor].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>unique_ptr</tt>'s of array type should not convert to
  <tt>unique_ptr</tt>'s which do not have an array type.
  </p>
  
! <blockquote><pre>
! struct Deleter
  {
     void operator()(void*) {}
  };
*************** Change 20.9.10.3.7 [util.smartptr.ownerl
*** 55270,55276 ****
  int main()
  {
     unique_ptr&lt;int[], Deleter&gt; s;
!    unique_ptr&lt;int, Deleter&gt; s2(std::move(s));  <font color="#C80000">// should not compile</font>
  }
  </pre></blockquote>
  
--- 58968,58974 ----
  int main()
  {
     unique_ptr&lt;int[], Deleter&gt; s;
!    unique_ptr&lt;int, Deleter&gt; s2(std::move(s));  <span style="color:#C80000">// should not compile</span>
  }
  </pre></blockquote>
  
*************** Recommend Review.
*** 55298,55319 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  The post-Summit comments have been applied to the proposed resolution.
  We now agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Moved from Tentatively Ready to Open only because the wording needs to be
! improved for enable_if type constraining, possibly following Robert's
  formula.
! </blockquote>
  
  <p><i>[
  2009-08-01 Howard updates wording and sets to Review.
--- 58996,59017 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  The post-Summit comments have been applied to the proposed resolution.
  We now agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Tentatively Ready to Open only because the wording needs to be
! improved for <tt>enable_if</tt> type constraining, possibly following Robert's
  formula.
! </p></blockquote>
  
  <p><i>[
  2009-08-01 Howard updates wording and sets to Review.
*************** formula.
*** 55325,55333 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  2010-02-27 Pete Opens:
--- 59023,59031 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  2010-02-27 Pete Opens:
*************** Move to Ready.
*** 55339,55348 ****
  The proposed replacement text doesn't make sense.
  </p>
  
! <blockquote>
  If <tt>D</tt> is a reference type, then <tt>E</tt> shall be the same type as
  <tt>D</tt>, else this constructor shall not participate in overload resolution.
! </blockquote>
  
  <p>
  This imposes two requirements. 1. If <tt>D</tt> is a reference type, <tt>E</tt>
--- 59037,59046 ----
  The proposed replacement text doesn't make sense.
  </p>
  
! <blockquote><p>
  If <tt>D</tt> is a reference type, then <tt>E</tt> shall be the same type as
  <tt>D</tt>, else this constructor shall not participate in overload resolution.
! </p></blockquote>
  
  <p>
  This imposes two requirements. 1. If <tt>D</tt> is a reference type, <tt>E</tt>
*************** in the preceding paragraph that this con
*** 55353,55362 ****
  intention, but I can't parse this text any other way.
  </p>
  
! <blockquote>
  <tt>U</tt> shall not be an array type, else this constructor shall not
  participate in overload resolution.
! </blockquote>
  
  <p>
  I don't know what this means.
--- 59051,59060 ----
  intention, but I can't parse this text any other way.
  </p>
  
! <blockquote><p>
  <tt>U</tt> shall not be an array type, else this constructor shall not
  participate in overload resolution.
! </p></blockquote>
  
  <p>
  I don't know what this means.
*************** Solved by
*** 55452,55462 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor]:
  </p>
  
  <blockquote>
! <pre>template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  <blockquote>
  <p>
--- 59150,59161 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor]:
  </p>
  
  <blockquote>
! <pre>
! template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  <blockquote>
  <p>
*************** shall be well formed and shall not throw
*** 55466,55472 ****
  a reference type, then <tt>E</tt> shall be the same type as <tt>D</tt>
  (diagnostic required). <tt>unique_ptr&lt;U, E&gt;::pointer</tt> shall be
  implicitly convertible to <tt>pointer</tt>. [<i>Note:</i> These requirements
! imply that <tt>T</tt> and <tt>U</tt> are complete types. — <i>end note</i>]</del>
  </p>
  
  <p><ins>
--- 59165,59171 ----
  a reference type, then <tt>E</tt> shall be the same type as <tt>D</tt>
  (diagnostic required). <tt>unique_ptr&lt;U, E&gt;::pointer</tt> shall be
  implicitly convertible to <tt>pointer</tt>. [<i>Note:</i> These requirements
! imply that <tt>T</tt> and <tt>U</tt> are complete types. &mdash; <i>end note</i>]</del>
  </p>
  
  <p><ins>
*************** implicitly convertible to <tt>pointer</t
*** 55477,55494 ****
  constructor shall not participate in overload resolution. <tt>U</tt> shall not be
  an array type, else this
  constructor shall not participate in overload resolution. [<i>Note:</i> These requirements
! imply that <tt>T</tt> and <tt>U</tt> are complete types. — <i>end note</i>]
  </ins></p>
  
  </blockquote>
  </blockquote>
  
  <p>
! Change 20.9.9.2.3 [unique.ptr.single.asgn]:
  </p>
  
  <blockquote>
! <pre>template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  <blockquote>
  <p>
--- 59176,59194 ----
  constructor shall not participate in overload resolution. <tt>U</tt> shall not be
  an array type, else this
  constructor shall not participate in overload resolution. [<i>Note:</i> These requirements
! imply that <tt>T</tt> and <tt>U</tt> are complete types. &mdash; <i>end note</i>]
  </ins></p>
  
  </blockquote>
  </blockquote>
  
  <p>
! Change 20.8.1.2.3 [unique.ptr.single.asgn]:
  </p>
  
  <blockquote>
! <pre>
! template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  <blockquote>
  <p>
*************** Change 20.9.9.2.3 [unique.ptr.single.asg
*** 55496,55502 ****
  <tt>D</tt> shall not throw an exception. <del><tt>unique_ptr&lt;U,
  E&gt;::pointer</tt> shall be implicitly convertible to <tt>pointer</tt>.
  [<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt>
! are complete types. — <i>end note</i>]</del>
  </p>
  
  <p><ins>
--- 59196,59202 ----
  <tt>D</tt> shall not throw an exception. <del><tt>unique_ptr&lt;U,
  E&gt;::pointer</tt> shall be implicitly convertible to <tt>pointer</tt>.
  [<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt>
! are complete types. &mdash; <i>end note</i>]</del>
  </p>
  
  <p><ins>
*************** operator shall not participate in overlo
*** 55506,55512 ****
  <tt>U</tt> shall not be an array type, else this
  operator shall not participate in overload resolution.
  [<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt>
! are complete types. — <i>end note</i>]
  </ins></p>
  
  </blockquote>
--- 59206,59212 ----
  <tt>U</tt> shall not be an array type, else this
  operator shall not participate in overload resolution.
  [<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U</tt>
! are complete types. &mdash; <i>end note</i>]
  </ins></p>
  
  </blockquote>
*************** are complete types. — <i>end note</i>]
*** 55519,55535 ****
  
  <hr>
  <h3><a name="951"></a>951. Various threading bugs #1</h3>
! <p><b>Section:</b> 20.11.2.1 [time.traits.is_fp] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>.
  </p>
  
  <p>
! 20.11.2.1 [time.traits.is_fp] says that the type <tt>Rep</tt> "is
  assumed to be ... a class emulating an integral type." What are the
  requirements for such a type?
  </p>
--- 59219,59235 ----
  
  <hr>
  <h3><a name="951"></a>951. Various threading bugs #1</h3>
! <p><b>Section:</b> 20.12.4.1 [time.traits.is_fp] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! Related to <a href="lwg-defects.html#953">953</a>.
  </p>
  
  <p>
! 20.12.4.1 [time.traits.is_fp] says that the type <tt>Rep</tt> "is
  assumed to be ... a class emulating an integral type." What are the
  requirements for such a type?
  </p>
*************** requirements for such a type?
*** 55538,55546 ****
  ]</i></p>
  
  
! <blockquote>
  <tt>IntegralLike</tt>.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
--- 59238,59246 ----
  ]</i></p>
  
  
! <blockquote><p>
  <tt>IntegralLike</tt>.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
*************** Batavia (2009-05):
*** 55548,55554 ****
  
  <blockquote>
  <p>
! As with issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#953">953</a>,
  we recommend this issue be addressed in the context of providing concepts for the entire <tt>thread</tt> header.
  </p>
  <p>
--- 59248,59254 ----
  
  <blockquote>
  <p>
! As with issue <a href="lwg-defects.html#953">953</a>,
  we recommend this issue be addressed in the context of providing concepts for the entire <tt>thread</tt> header.
  </p>
  <p>
*************** Move to Open.
*** 55566,55573 ****
  
  <blockquote>
  <p>
! I have surveyed all clauses of 20.11.2.2 [time.traits.duration_values],
! 20.11.2.3 [time.traits.specializations] and 20.11.3 [time.duration].
  I can not find any clause which involves the use of a <tt>duration::rep</tt> type
  where the requirements on the <tt>rep</tt> type are not clearly spelled out.
  These requirements were carefully crafted to allow any arithmetic type, or
--- 59266,59273 ----
  
  <blockquote>
  <p>
! I have surveyed all clauses of 20.12.4.2 [time.traits.duration_values],
! 20.12.4.3 [time.traits.specializations] and 20.12.5 [time.duration].
  I can not find any clause which involves the use of a <tt>duration::rep</tt> type
  where the requirements on the <tt>rep</tt> type are not clearly spelled out.
  These requirements were carefully crafted to allow any arithmetic type, or
*************** on <tt>Rep</tt> are specified for each o
*** 55589,55613 ****
  </p>
  
  <p>
! In 20.11.2.1 [time.traits.is_fp] p1:
  </p>
  
! <blockquote><pre>template &lt;class Rep&gt; struct treat_as_floating_point 
    : is_floating_point&lt;Rep&gt; { };
  </pre>
  
! <blockquote>
  The <tt>duration</tt> template uses the <tt>treat_as_floating_point</tt> trait to help
  determine if a <tt>duration</tt> object can be converted to another <tt>duration</tt>
  with a different tick period. If <tt>treat_as_floating_point&lt;Rep&gt;::value</tt> is
  <tt>true</tt>, then <tt>Rep</tt> is a floating-point type and implicit conversions are
  allowed among <tt>duration</tt>s. Otherwise, the implicit convertibility depends
! on the tick periods of the <tt>duration</tt>s. If <tt>Rep</tt> is <u>a class type which
! emulates a floating-point type</u>, the author of <tt>Rep</tt> can specialize
! <tt>treat_as_floating_point</tt> so that <tt>duration</tt> will treat this <tt>Rep</tt> as if it
! were a floating-point type. Otherwise <tt>Rep</tt> is assumed to be an integral
! type or <u>a class emulating an integral type</u>.
! </blockquote>
  </blockquote>
  
  <p>
--- 59289,59315 ----
  </p>
  
  <p>
! In 20.12.4.1 [time.traits.is_fp] p1:
  </p>
  
! <blockquote><pre>
! template &lt;class Rep&gt; struct treat_as_floating_point 
    : is_floating_point&lt;Rep&gt; { };
  </pre>
  
! <blockquote><p>
  The <tt>duration</tt> template uses the <tt>treat_as_floating_point</tt> trait to help
  determine if a <tt>duration</tt> object can be converted to another <tt>duration</tt>
  with a different tick period. If <tt>treat_as_floating_point&lt;Rep&gt;::value</tt> is
  <tt>true</tt>, then <tt>Rep</tt> is a floating-point type and implicit conversions are
  allowed among <tt>duration</tt>s. Otherwise, the implicit convertibility depends
! on the tick periods of the <tt>duration</tt>s. If <tt>Rep</tt> is 
! <span style="text-decoration:underline">a class type which emulates a floating-point type</span>, 
! the author of <tt>Rep</tt> can specialize <tt>treat_as_floating_point</tt> so that 
! <tt>duration</tt> will treat this <tt>Rep</tt> as if it were a floating-point type. 
! Otherwise <tt>Rep</tt> is assumed to be an integral type or 
! <span style="text-decoration:underline">a class emulating an integral type</span>.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** but none has been pointed out).
*** 55628,55634 ****
  I am amenable to improved wording of this paragraph (and any others), but do not have any
  suggestions for improved wording at this time.  I am <em>strongly</em> opposed to
  changes which would significantly alter the semantics of the
! specification under 20.11 [time] without firmly grounded and
  documented rationale, example implementation, testing, and user
  experience which relates a positive experience.
  </p>
--- 59330,59336 ----
  I am amenable to improved wording of this paragraph (and any others), but do not have any
  suggestions for improved wording at this time.  I am <em>strongly</em> opposed to
  changes which would significantly alter the semantics of the
! specification under 20.12 [time] without firmly grounded and
  documented rationale, example implementation, testing, and user
  experience which relates a positive experience.
  </p>
*************** I recommend NAD unless someone wants to
*** 55643,55651 ****
  ]</i></p>
  
  
! <blockquote>
  Stefanus to provide wording to turn this into a note.
! </blockquote>
  
  <p><i>[
  2010-02-11 Stefanus provided wording.
--- 59345,59353 ----
  ]</i></p>
  
  
! <blockquote><p>
  Stefanus to provide wording to turn this into a note.
! </p></blockquote>
  
  <p><i>[
  2010-02-11 Stefanus provided wording.
*************** Stefanus to provide wording to turn this
*** 55658,55666 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 59360,59368 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 55671,55680 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.11.2.1 [time.traits.is_fp]/1:
  </p>
  
! <blockquote>
  1 The <tt>duration</tt> template uses the <tt>treat_as_floating_point</tt> trait
  to help determine if a <tt>duration</tt> object can be converted to another
  <tt>duration</tt> with a different tick period. If
--- 59373,59382 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.12.4.1 [time.traits.is_fp]/1:
  </p>
  
! <blockquote><p>
  1 The <tt>duration</tt> template uses the <tt>treat_as_floating_point</tt> trait
  to help determine if a <tt>duration</tt> object can be converted to another
  <tt>duration</tt> with a different tick period. If
*************** class behaves like a floating point type
*** 55691,55698 ****
  by another with acceptable loss of precision. If
  <tt>treat_as_floating_point&lt;Rep&gt;::value</tt> is <tt>false</tt>,
  <tt>Rep</tt> will be treated as if it behaved like an integral type for the
! purpose of these conversions. — <i>end note</i>]</ins>
! </blockquote>
  
  
  
--- 59393,59400 ----
  by another with acceptable loss of precision. If
  <tt>treat_as_floating_point&lt;Rep&gt;::value</tt> is <tt>false</tt>,
  <tt>Rep</tt> will be treated as if it behaved like an integral type for the
! purpose of these conversions. &mdash; <i>end note</i>]</ins>
! </p></blockquote>
  
  
  
*************** purpose of these conversions. — <i>end n
*** 55701,55718 ****
  
  <hr>
  <h3><a name="953"></a>953. Various threading bugs #3</h3>
! <p><b>Section:</b> 20.11.1 [time.clock.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.req">issues</a> in [time.clock.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>.
  </p>
  
  <p>
! 20.11.1 [time.clock.req] says that a clock's <tt>rep</tt> member is "an
  arithmetic type or a class emulating an arithmetic type." What are the
  requirements for such a type?
  </p>
--- 59403,59420 ----
  
  <hr>
  <h3><a name="953"></a>953. Various threading bugs #3</h3>
! <p><b>Section:</b> 20.12.3 [time.clock.req] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.req">issues</a> in [time.clock.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! Related to <a href="lwg-defects.html#951">951</a>.
  </p>
  
  <p>
! 20.12.3 [time.clock.req] says that a clock's <tt>rep</tt> member is "an
  arithmetic type or a class emulating an arithmetic type." What are the
  requirements for such a type?
  </p>
*************** requirements for such a type?
*** 55722,55730 ****
  ]</i></p>
  
  
! <blockquote>
  This wording was aimed directly at the <tt>ArithmeticLike</tt> concept.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
--- 59424,59432 ----
  ]</i></p>
  
  
! <blockquote><p>
  This wording was aimed directly at the <tt>ArithmeticLike</tt> concept.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
*************** We look forward to proposed wording.  Mo
*** 55753,55773 ****
  ]</i></p>
  
  
! <blockquote>
! See commented dated 2009-08-01 in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Stefanus to provide wording to turn this into a note.
! </blockquote>
  
  <p><i>[
! 2010-02-11 Stephanus provided wording for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a> which addresses
  this issue as well.
  ]</i></p>
  
--- 59455,59475 ----
  ]</i></p>
  
  
! <blockquote><p>
! See commented dated 2009-08-01 in <a href="lwg-defects.html#951">951</a>.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Stefanus to provide wording to turn this into a note.
! </p></blockquote>
  
  <p><i>[
! 2010-02-11 Stephanus provided wording for <a href="lwg-defects.html#951">951</a> which addresses
  this issue as well.
  ]</i></p>
  
*************** this issue as well.
*** 55778,55786 ****
  ]</i></p>
  
  
! <blockquote>
! Move to <del>NAD Editorial</del><ins>Resolved</ins>, resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#951">951</a>.
! </blockquote>
  
  
  
--- 59480,59488 ----
  ]</i></p>
  
  
! <blockquote><p>
! Move to <del>NAD Editorial</del><ins>Resolved</ins>, resolved by <a href="lwg-defects.html#951">951</a>.
! </p></blockquote>
  
  
  
*************** Move to <del>NAD Editorial</del><ins>Res
*** 55795,55810 ****
  
  <hr>
  <h3><a name="954"></a>954. Various threading bugs #4</h3>
! <p><b>Section:</b> 20.11.1 [time.clock.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.req">issues</a> in [time.clock.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Table 55 -- Clock Requirements (in 20.11.1 [time.clock.req])
  </p>
  
! <ol type="a">
  <li>
  the requirements for <tt>C1::time_point</tt> require <tt>C1</tt> and <tt>C2</tt>
  to "refer to the same epoch", but "epoch" is not defined.
--- 59497,59512 ----
  
  <hr>
  <h3><a name="954"></a>954. Various threading bugs #4</h3>
! <p><b>Section:</b> 20.12.3 [time.clock.req] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.req">issues</a> in [time.clock.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Table 55 &mdash; Clock Requirements (in 20.12.3 [time.clock.req])
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  the requirements for <tt>C1::time_point</tt> require <tt>C1</tt> and <tt>C2</tt>
  to "refer to the same epoch", but "epoch" is not defined.
*************** to "refer to the same epoch", but "epoch
*** 55813,55819 ****
  "Different clocks may share a <tt>time_point</tt> definition if it is
  valid to compare their <tt>time_point</tt>s by comparing their
  respective <tt>duration</tt>s." What does "valid" mean here? And, since
! <tt>C1::rep</tt> is "**THE** representation type of the native
  <tt>duration</tt> and <tt>time_point</tt>" (emphasis added), there
  doesn't seem to be much room for some other representation.
  </li>
--- 59515,59521 ----
  "Different clocks may share a <tt>time_point</tt> definition if it is
  valid to compare their <tt>time_point</tt>s by comparing their
  respective <tt>duration</tt>s." What does "valid" mean here? And, since
! <tt>C1::rep</tt> is "<em>THE</em> representation type of the native
  <tt>duration</tt> and <tt>time_point</tt>" (emphasis added), there
  doesn't seem to be much room for some other representation.
  </li>
*************** it's a template. What is the required ty
*** 55832,55842 ****
  ]</i></p>
  
  
! <ol type="a">
  <li>
  <p>
  "epoch" is purposefully not defined beyond the common English
! <a href="http://www.dictionary.net/epoch">definition</a>.  The C standard
  also chose not to define epoch, though POSIX did.  I believe it is a strength
  of the C standard that epoch is not defined.  When it is known that two <tt>time_point</tt>s
  refer to the same epoch, then a definition of the epoch is not needed to compare
--- 59534,59544 ----
  ]</i></p>
  
  
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
  "epoch" is purposefully not defined beyond the common English
! <a href="http://definitions.dictionary.net/epoch">definition</a>.  The C standard
  also chose not to define epoch, though POSIX did.  I believe it is a strength
  of the C standard that epoch is not defined.  When it is known that two <tt>time_point</tt>s
  refer to the same epoch, then a definition of the epoch is not needed to compare
*************** The <tt>time_point</tt> represents an of
*** 55851,55872 ****
  <p>
  The sentence:
  </p>
! <blockquote>
  Different clocks 
  may share a <tt>time_point</tt>
  definition if it is valid to 
  compare their <tt>time_point</tt>s by 
  comparing their respective 
  <tt>duration</tt>s.
! </blockquote>
  
  <p>
  is redundant and could be removed.  I believe the sentence which follows the above:
  </p>
  
! <blockquote>
  <tt>C1</tt> and <tt>C2</tt> shall refer to the same epoch.
! </blockquote>
  
  <p>
  is sufficient.  If two clocks share the same epoch, then by definition, comparing
--- 59553,59574 ----
  <p>
  The sentence:
  </p>
! <blockquote><p>
  Different clocks 
  may share a <tt>time_point</tt>
  definition if it is valid to 
  compare their <tt>time_point</tt>s by 
  comparing their respective 
  <tt>duration</tt>s.
! </p></blockquote>
  
  <p>
  is redundant and could be removed.  I believe the sentence which follows the above:
  </p>
  
! <blockquote><p>
  <tt>C1</tt> and <tt>C2</tt> shall refer to the same epoch.
! </p></blockquote>
  
  <p>
  is sufficient.  If two clocks share the same epoch, then by definition, comparing
*************** desired that this value be usable in com
*** 55881,55889 ****
  <p>
  This should probably instead be worded:
  </p>
! <blockquote>
  An instantiation of <tt>ratio</tt>.
! </blockquote>
  </li>
  </ol>
  
--- 59583,59591 ----
  <p>
  This should probably instead be worded:
  </p>
! <blockquote><p>
  An instantiation of <tt>ratio</tt>.
! </p></blockquote>
  </li>
  </ol>
  
*************** Move to Open pending proposed wording.
*** 55909,55919 ****
  ]</i></p>
  
  
! <blockquote>
  In regards to (d) I suggest to say "a specialization of ratio" instead of
  "An instantiation of ratio". This seems to be the better matching standard
  core language term for this kind of entity.
! </blockquote>
  
  <p><i>[
  2009-05-25 Ganesh adds:
--- 59611,59621 ----
  ]</i></p>
  
  
! <blockquote><p>
  In regards to (d) I suggest to say "a specialization of ratio" instead of
  "An instantiation of ratio". This seems to be the better matching standard
  core language term for this kind of entity.
! </p></blockquote>
  
  <p><i>[
  2009-05-25 Ganesh adds:
*************** which is part of ISO/IEC 18026 "Informat
*** 55943,55966 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol type="a">
  <li>
  <p>
! Change 20.11.1 [time.clock.req] p1:
  </p>
! <blockquote>
  -1- A clock is a bundle consisting of a native <tt>duration</tt>, a native <tt>time_point</tt>, and a function <tt>now()</tt> to get the 
  current <tt>time_point</tt>.  <ins>The origin of the clock's <tt>time_point</tt> is referred to as the clock's <i>epoch</i> as defined in 
  section 6.3 of ISO/IEC 18026.</ins>
  A clock shall meet the requirements in Table 45.
! </blockquote>
  </li>
  <li>
  <p>
--- 59645,59668 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <ol>
  <li>
  <p>
! Change 20.12.3 [time.clock.req] p1:
  </p>
! <blockquote><p>
  -1- A clock is a bundle consisting of a native <tt>duration</tt>, a native <tt>time_point</tt>, and a function <tt>now()</tt> to get the 
  current <tt>time_point</tt>.  <ins>The origin of the clock's <tt>time_point</tt> is referred to as the clock's <i>epoch</i> as defined in 
  section 6.3 of ISO/IEC 18026.</ins>
  A clock shall meet the requirements in Table 45.
! </p></blockquote>
  </li>
  <li>
  <p>
*************** Remove the sentence from the <tt>time_po
*** 55968,55974 ****
  </p>
  <table border="1">
  <caption>Clock requirements</caption>
! <tbody><tr>
  <td>
  <tt>C1::time_point</tt>
  </td>
--- 59670,59676 ----
  </p>
  <table border="1">
  <caption>Clock requirements</caption>
! <tr>
  <td>
  <tt>C1::time_point</tt>
  </td>
*************** The native <tt>time_point</tt> type of t
*** 55981,55997 ****
  <tt>C1</tt> and <tt>C2</tt> shall refer to the same epoch.
  </td>
  </tr>
! </tbody></table>
  </li>
- </ol>
- <ol type="a" start="4">
  <li>
  <p>
  Change the row starting with <tt>C1::period</tt> of the table "Clock Requirements":
  </p>
  <table border="1">
  <caption>Clock requirements</caption>
! <tbody><tr>
  <td>
  <tt>C1::period</tt>
  </td>
--- 59683,59697 ----
  <tt>C1</tt> and <tt>C2</tt> shall refer to the same epoch.
  </td>
  </tr>
! </table>
  </li>
  <li>
  <p>
  Change the row starting with <tt>C1::period</tt> of the table "Clock Requirements":
  </p>
  <table border="1">
  <caption>Clock requirements</caption>
! <tr>
  <td>
  <tt>C1::period</tt>
  </td>
*************** Change the row starting with <tt>C1::per
*** 56002,56008 ****
  The tick period of the clock in seconds.
  </td>
  </tr>
! </tbody></table>
  
  </li>
  </ol>
--- 59702,59708 ----
  The tick period of the clock in seconds.
  </td>
  </tr>
! </table>
  
  </li>
  </ol>
*************** The tick period of the clock in seconds.
*** 56013,56025 ****
  
  <hr>
  <h3><a name="956"></a>956. Various threading bugs #6</h3>
! <p><b>Section:</b> 20.11.1 [time.clock.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.req">issues</a> in [time.clock.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.11.1 [time.clock.req] uses the word "native" in several places,
  but doesn't define it. What is a "native <tt>duration</tt>"?
  </p>
  
--- 59713,59725 ----
  
  <hr>
  <h3><a name="956"></a>956. Various threading bugs #6</h3>
! <p><b>Section:</b> 20.12.3 [time.clock.req] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.req">issues</a> in [time.clock.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.12.3 [time.clock.req] uses the word "native" in several places,
  but doesn't define it. What is a "native <tt>duration</tt>"?
  </p>
  
*************** but doesn't define it. What is a "native
*** 56028,56048 ****
  ]</i></p>
  
  
! <blockquote>
  The standard uses "native" in several places without defining it (e.g.
! 2.14.3 [lex.ccon]).  It is meant to mean "that which is defined
  by the facility", or something along those lines.  In this case it refers
  to the nested <tt>time_point</tt> and <tt>duration</tt> types of the clock.
  Better wording is welcome.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open pending proposed wording from Pete.
! </blockquote>
  
  <p><i>[
  2009-10-23 Pete provides wording:
--- 59728,59748 ----
  ]</i></p>
  
  
! <blockquote><p>
  The standard uses "native" in several places without defining it (e.g.
! 2.13.3 [lex.ccon]).  It is meant to mean "that which is defined
  by the facility", or something along those lines.  In this case it refers
  to the nested <tt>time_point</tt> and <tt>duration</tt> types of the clock.
  Better wording is welcome.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open pending proposed wording from Pete.
! </p></blockquote>
  
  <p><i>[
  2009-10-23 Pete provides wording:
*************** Move to Open pending proposed wording fr
*** 56059,56082 ****
  I see that 30.4.1.3 [thread.timedmutex.requirements]/3 says:
  </p>
  
! <blockquote>
  <i>Precondition:</i> If the tick <tt>period</tt> of <tt>rel_time</tt> is not
  exactly convertible to the native tick <tt>period</tt>, the <tt>duration</tt>
  shall be rounded up to the nearest native tick <tt>period</tt>.
! </blockquote>
  
  <p>
  I would prefer to see that adapted as well. Following the same style as
  the proposed resolution I come up with
  </p>
  
! <blockquote>
  <i>Precondition:</i> If the tick <tt>period</tt> of <tt>rel_time</tt> is not
  exactly convertible to the <del>native</del> tick <tt>period</tt> <ins>of the
  execution environment</ins>, the <tt>duration</tt> shall be rounded up to the
  nearest <del>native</del> tick <tt>period</tt> <ins>of the execution
  environment</ins>.
! </blockquote>
  
  </blockquote>
  
--- 59759,59782 ----
  I see that 30.4.1.3 [thread.timedmutex.requirements]/3 says:
  </p>
  
! <blockquote><p>
  <i>Precondition:</i> If the tick <tt>period</tt> of <tt>rel_time</tt> is not
  exactly convertible to the native tick <tt>period</tt>, the <tt>duration</tt>
  shall be rounded up to the nearest native tick <tt>period</tt>.
! </p></blockquote>
  
  <p>
  I would prefer to see that adapted as well. Following the same style as
  the proposed resolution I come up with
  </p>
  
! <blockquote><p>
  <i>Precondition:</i> If the tick <tt>period</tt> of <tt>rel_time</tt> is not
  exactly convertible to the <del>native</del> tick <tt>period</tt> <ins>of the
  execution environment</ins>, the <tt>duration</tt> shall be rounded up to the
  nearest <del>native</del> tick <tt>period</tt> <ins>of the execution
  environment</ins>.
! </p></blockquote>
  
  </blockquote>
  
*************** Post-Rapperswil, Howard provides wording
*** 56090,56098 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready with revised wording from Howard Hinnant after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 59790,59798 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready with revised wording from Howard Hinnant after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 56104,56110 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 20.11.1 [time.clock.req]:
  </p>
  
  <blockquote>
--- 59804,59810 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 20.12.3 [time.clock.req]:
  </p>
  
  <blockquote>
*************** Table 56.
*** 56121,56128 ****
  </p>
  
  <table border="1">
! <caption>Table 56 — Clock requirements</caption>
! <tbody><tr><th>Expression</th> <th>Return type</th> <th>Operational semantics</th></tr>
  
  <tr>
  <td><tt>C1::rep</tt></td>
--- 59821,59828 ----
  </p>
  
  <table border="1">
! <caption>Table 56 &mdash; Clock requirements</caption>
! <tr><th>Expression</th> <th>Return type</th> <th>Operational semantics</th></tr>
  
  <tr>
  <td><tt>C1::rep</tt></td>
*************** C1::duration&gt;</tt></td>
*** 56156,56162 ****
  <td colspan="3" align="center">...</td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  
--- 59856,59862 ----
  <td colspan="3" align="center">...</td>
  </tr>
  
! </table>
  </blockquote>
  
  
*************** C1::duration&gt;</tt></td>
*** 56166,56178 ****
  
  <hr>
  <h3><a name="957"></a>957. Various threading bugs #7</h3>
! <p><b>Section:</b> 20.11.5.1 [time.clock.system] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.system">issues</a> in [time.clock.system].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.11.5.1 [time.clock.system]: <tt>to_time_t</tt> is overspecified. It
  requires truncation, but should allow rounding. For example, suppose a
  system has a clock that gives times in milliseconds, but <tt>time()</tt> rounds
  those times to the nearest second. Then <tt>system_clock</tt> can't use any
--- 59866,59878 ----
  
  <hr>
  <h3><a name="957"></a>957. Various threading bugs #7</h3>
! <p><b>Section:</b> 20.12.7.1 [time.clock.system] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.system">issues</a> in [time.clock.system].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.12.7.1 [time.clock.system]: <tt>to_time_t</tt> is overspecified. It
  requires truncation, but should allow rounding. For example, suppose a
  system has a clock that gives times in milliseconds, but <tt>time()</tt> rounds
  those times to the nearest second. Then <tt>system_clock</tt> can't use any
*************** Post Summit Anthony Williams provided pr
*** 56190,56246 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Review pending input from Howard. and other stakeholders.
! </blockquote>
  
  <p><i>[
  2009-05-23 Howard adds:
  ]</i></p>
  
  
! <blockquote>
  I am in favor of the wording provided by Anthony.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.11.5.1 [time.clock.system] replace paragraphs 3 and 4 with:
  </p>
  
  <blockquote>
! <pre>time_t to_time_t(const time_point&amp; t);
  </pre>
! <blockquote>
  -3- <i>Returns:</i> A <tt>time_t</tt> object that represents the same
  point in time as <tt>t</tt> when both values are <del>truncated</del>
  <ins>restricted</ins> to the coarser of the precisions of
  <tt>time_t</tt> and <tt>time_point</tt>. <ins> It is implementation
  defined whether values are rounded or truncated to the required
  precision.</ins>
! </blockquote>
  
! <pre>time_point from_time_t(time_t t);
  </pre>
! <blockquote>
  -4- <i>Returns:</i> A <tt>time_point</tt> object that represents the
  same point in time as <tt>t</tt> when both values are <del>truncated</del>
  <ins>restricted</ins> to the
  coarser of the precisions of <tt>time_t</tt> and <tt>time_point</tt>.
  <ins>It is implementation defined whether values are
  rounded or truncated to the required precision.</ins>
! </blockquote>
  </blockquote>
  
  
--- 59890,59948 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Review pending input from Howard. and other stakeholders.
! </p></blockquote>
  
  <p><i>[
  2009-05-23 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
  I am in favor of the wording provided by Anthony.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.12.7.1 [time.clock.system] replace paragraphs 3 and 4 with:
  </p>
  
  <blockquote>
! <pre>
! time_t to_time_t(const time_point&amp; t);
  </pre>
! <blockquote><p>
  -3- <i>Returns:</i> A <tt>time_t</tt> object that represents the same
  point in time as <tt>t</tt> when both values are <del>truncated</del>
  <ins>restricted</ins> to the coarser of the precisions of
  <tt>time_t</tt> and <tt>time_point</tt>. <ins> It is implementation
  defined whether values are rounded or truncated to the required
  precision.</ins>
! </p></blockquote>
  
! <pre>
! time_point from_time_t(time_t t);
  </pre>
! <blockquote><p>
  -4- <i>Returns:</i> A <tt>time_point</tt> object that represents the
  same point in time as <tt>t</tt> when both values are <del>truncated</del>
  <ins>restricted</ins> to the
  coarser of the precisions of <tt>time_t</tt> and <tt>time_point</tt>.
  <ins>It is implementation defined whether values are
  rounded or truncated to the required precision.</ins>
! </p></blockquote>
  </blockquote>
  
  
*************** rounded or truncated to the required pre
*** 56248,56258 ****
  
  
  <hr>
  <h3><a name="960"></a>960. Various threading bugs #10</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.4.1 [thread.mutex.requirements]: paragraph 4 is entitled
--- 59950,60018 ----
  
  
  <hr>
+ <h3><a name="958"></a>958. Various threading bugs #8</h3>
+ <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 30.5.1 [thread.condition.condvar]: the specification for <tt>wait_for</tt>
+ with no predicate has an effects clause that says it calls <tt>wait_until</tt>,
+ and a returns clause that sets out in words how to determine the return
+ value. Is this description of the return value subtly different from the
+ description of the value returned by <tt>wait_until</tt>? Or should the effects
+ clause and the returns clause be merged?
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to open. Associate with LWG <a href="lwg-defects.html#859">859</a> and any other monotonic-clock
+ related issues.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-08-01 Howard adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ I believe that <a href="lwg-defects.html#859">859</a> (currently Ready) addresses this issue, and
+ that this issue should be marked NAD, solved by <a href="lwg-defects.html#859">859</a> (assuming
+ it moves to WP).
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Mark as <del>NAD Editorial</del><ins>Resolved</ins>, addressed by resolution 
+ of Issue <a href="lwg-defects.html#859">859</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="960"></a>960. Various threading bugs #10</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.4.1 [thread.mutex.requirements]: paragraph 4 is entitled
*************** Summit:
*** 56267,56275 ****
  ]</i></p>
  
  
! <blockquote>
  Move to open.
! </blockquote>
  
  <p><i>[
  Beman provided proposed wording.
--- 60027,60035 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to open.
! </p></blockquote>
  
  <p><i>[
  Beman provided proposed wording.
*************** Beman provided proposed wording.
*** 56281,56290 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready. Fix the proposed wording with "functions of type Mutex"
! -&gt; "functions of Mutex type"
! </blockquote>
  
  
  
--- 60041,60050 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready. Fix the proposed wording with "functions of type Mutex"
! -> "functions of Mutex type"
! </p></blockquote>
  
  
  
*************** functions of Mutex type shall be:</ins>
*** 56302,56324 ****
  </p>
  <ul>
  <li>
! <tt>not_enough_memory</tt> -- if there is not enough memory to construct
  the mutex object.
  </li>
  <li>
! <tt>resource_unavailable_try_again</tt> -- if any native handle type
  manipulated is not available.
  </li>
  <li>
! <tt>operation_not_permitted</tt> -- if the thread does not have the
  necessary permission to change the state of the mutex object.
  </li>
  <li>
! <tt>device_or_resource_busy</tt> -- if any native handle type
  manipulated is already locked.
  </li>
  <li>
! <tt>invalid_argument</tt> -- if any native handle type manipulated as
  part of mutex construction is incorrect.
  </li>
  </ul>
--- 60062,60084 ----
  </p>
  <ul>
  <li>
! <tt>not_enough_memory</tt> &mdash; if there is not enough memory to construct
  the mutex object.
  </li>
  <li>
! <tt>resource_unavailable_try_again</tt> &mdash; if any native handle type
  manipulated is not available.
  </li>
  <li>
! <tt>operation_not_permitted</tt> &mdash; if the thread does not have the
  necessary permission to change the state of the mutex object.
  </li>
  <li>
! <tt>device_or_resource_busy</tt> &mdash; if any native handle type
  manipulated is already locked.
  </li>
  <li>
! <tt>invalid_argument</tt> &mdash; if any native handle type manipulated as
  part of mutex construction is incorrect.
  </li>
  </ul>
*************** part of mutex construction is incorrect.
*** 56330,56339 ****
  
  <hr>
  <h3><a name="962"></a>962. Various threading bugs #12</h3>
! <p><b>Section:</b> 30.4.2.2.2 [thread.lock.unique.locking] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.lock.unique.locking">issues</a> in [thread.lock.unique.locking].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.4.2.2.2 [thread.lock.unique.locking]:  <tt>unique_lock::lock</tt> is
--- 60090,60099 ----
  
  <hr>
  <h3><a name="962"></a>962. Various threading bugs #12</h3>
! <p><b>Section:</b> 30.4.2.2.2 [thread.lock.unique.locking] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.lock.unique.locking">issues</a> in [thread.lock.unique.locking].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.4.2.2.2 [thread.lock.unique.locking]:  <tt>unique_lock::lock</tt> is
*************** to mean something more than that.
*** 56347,56355 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  Move to open.
! </blockquote>
  
  <p><i>[
  Beman has volunteered to provide proposed wording.
--- 60107,60115 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  Move to open.
! </p></blockquote>
  
  <p><i>[
  Beman has volunteered to provide proposed wording.
*************** Beman has volunteered to provide propose
*** 56358,56364 ****
  
  <p><i>[
  2009-07-21 Beman added wording to address 30.2.2 [thread.req.exception]
! in response to the Frankfurt notes in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>.
  ]</i></p>
  
  
--- 60118,60124 ----
  
  <p><i>[
  2009-07-21 Beman added wording to address 30.2.2 [thread.req.exception]
! in response to the Frankfurt notes in <a href="lwg-defects.html#859">859</a>.
  ]</i></p>
  
  
*************** in response to the Frankfurt notes in <a
*** 56372,56380 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 60132,60140 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** system or other underlying API results i
*** 56389,56395 ****
  function from <del>satisfying its postconditions or from returning a meaningful 
  value</del> <ins>meeting its specifications</ins>. <ins>Failure to
  allocate storage shall be reported as described in
! 17.6.4.12 [res.on.exception.handling].</ins></p>
  </blockquote>
  
  <p><i>Change thread assignment 30.3.1.5 [thread.thread.member], join(), 
--- 60149,60155 ----
  function from <del>satisfying its postconditions or from returning a meaningful 
  value</del> <ins>meeting its specifications</ins>. <ins>Failure to
  allocate storage shall be reported as described in
! 17.6.5.12 [res.on.exception.handling].</ins></p>
  </blockquote>
  
  <p><i>Change thread assignment 30.3.1.5 [thread.thread.member], join(), 
*************** postcondition cannot be achieved</del> <
*** 56419,56454 ****
  paragraph 3, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change unique_lock locking 30.4.2.2.2 [thread.lock.unique.locking], 
  paragraph 8, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change unique_lock locking 30.4.2.2.2 [thread.lock.unique.locking], 
  paragraph 13, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change unique_lock locking 30.4.2.2.2 [thread.lock.unique.locking], 
  paragraph 18, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change unique_lock locking 30.4.2.2.2 [thread.lock.unique.locking], 
  paragraph 22, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change Function call_once 30.4.4.2 [thread.once.callonce], paragraph 4, as 
  indicated</i></p>
  <blockquote>
!   <p><i>Throws:</i> <code>std::system_error</code> when <del>the effects cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>, 
    or any exception thrown by <code>func</code>.</p>
  </blockquote>
  <p><i>Change Class condition_variable 30.5.1 [thread.condition.condvar], 
--- 60179,60220 ----
  paragraph 3, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be 
! achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change unique_lock locking 30.4.2.2.2 [thread.lock.unique.locking], 
  paragraph 8, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be 
! achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change unique_lock locking 30.4.2.2.2 [thread.lock.unique.locking], 
  paragraph 13, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be 
! achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change unique_lock locking 30.4.2.2.2 [thread.lock.unique.locking], 
  paragraph 18, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be 
! achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change unique_lock locking 30.4.2.2.2 [thread.lock.unique.locking], 
  paragraph 22, as indicated:</i></p>
  <blockquote>
  
! <p><i>Throws:</i> <code>std::system_error</code> when <del>the  postcondition cannot be 
! achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  <p><i>Change Function call_once 30.4.4.2 [thread.once.callonce], paragraph 4, as 
  indicated</i></p>
  <blockquote>
!   <p><i>Throws:</i> <code>std::system_error</code> when <del>the effects cannot be 
!   achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>, 
    or any exception thrown by <code>func</code>.</p>
  </blockquote>
  <p><i>Change Class condition_variable 30.5.1 [thread.condition.condvar], 
*************** paragraph 16, as indicated:</i></p>
*** 56480,56486 ****
  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  
! <p><i>Assuming issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, Monotonic Clock is Conditionally Supported?, has been 
  applied to the working paper, change Change 30.5.1 [thread.condition.condvar] as 
  indicated:</i></p>
  <blockquote>
--- 60246,60252 ----
  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  
! <p><i>Assuming issue <a href="lwg-defects.html#859">859</a>, Monotonic Clock is Conditionally Supported?, has been 
  applied to the working paper, change Change 30.5.1 [thread.condition.condvar] as 
  indicated:</i></p>
  <blockquote>
*************** bool wait_for(unique_lock&lt;mutex&gt;&a
*** 56493,56499 ****
  postcondition cannot be achieved</del> <ins>an exception is required ([thread.req.exception])</ins>.</p>
  </blockquote>
  
! <p><i>Assuming issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, Monotonic Clock is Conditionally Supported?, has been 
  applied to the working paper, change Change 30.5.1 [thread.condition.condvar] as 
  indicated:</i></p>
  <blockquote>
--- 60259,60265 ----
  postcondition cannot be achieved</del> <ins>an exception is required ([thread.req.exception])</ins>.</p>
  </blockquote>
  
! <p><i>Assuming issue <a href="lwg-defects.html#859">859</a>, Monotonic Clock is Conditionally Supported?, has been 
  applied to the working paper, change Change 30.5.1 [thread.condition.condvar] as 
  indicated:</i></p>
  <blockquote>
*************** indicated:</i></p>
*** 56507,56513 ****
  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  
! <p><i>Assuming issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, Monotonic Clock is Conditionally Supported?, has been 
  applied to the working paper, change 30.5.2 [thread.condition.condvarany] as 
  indicated:</i></p>
  <blockquote>
--- 60273,60279 ----
  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  
! <p><i>Assuming issue <a href="lwg-defects.html#859">859</a>, Monotonic Clock is Conditionally Supported?, has been 
  applied to the working paper, change 30.5.2 [thread.condition.condvarany] as 
  indicated:</i></p>
  <blockquote>
*************** indicated:</i></p>
*** 56519,56525 ****
  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  
! <p><i>Assuming issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#859">859</a>, Monotonic Clock is Conditionally Supported?, has been 
  applied to the working paper, change 30.5.2 [thread.condition.condvarany] as 
  indicated:</i></p>
  <blockquote>
--- 60285,60291 ----
  postcondition cannot be achieved</del> <ins>an exception is required (30.2.2 [thread.req.exception])</ins>.</p>
  </blockquote>
  
! <p><i>Assuming issue <a href="lwg-defects.html#859">859</a>, Monotonic Clock is Conditionally Supported?, has been 
  applied to the working paper, change 30.5.2 [thread.condition.condvarany] as 
  indicated:</i></p>
  <blockquote>
*************** postcondition cannot be achieved</del> <
*** 56538,56547 ****
  
  <hr>
  <h3><a name="963"></a>963. Various threading bugs #13</h3>
! <p><b>Section:</b> 30.3.1.5 [thread.thread.member] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.member">issues</a> in [thread.thread.member].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.3.1.5 [thread.thread.member]:  <tt>thread::detach</tt> is required to
--- 60304,60313 ----
  
  <hr>
  <h3><a name="963"></a>963. Various threading bugs #13</h3>
! <p><b>Section:</b> 30.3.1.5 [thread.thread.member] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.member">issues</a> in [thread.thread.member].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.3.1.5 [thread.thread.member]:  <tt>thread::detach</tt> is required to
*************** Howard adds:
*** 56554,56563 ****
  ]</i></p>
  
  
! <blockquote>
  Due to a mistake on my part, 3 proposed resolutions appeared at approximately
  the same time.  They are all three noted below in the discussion.
! </blockquote>
  
  <p><i>[
  Summit, proposed resolution:
--- 60320,60329 ----
  ]</i></p>
  
  
! <blockquote><p>
  Due to a mistake on my part, 3 proposed resolutions appeared at approximately
  the same time.  They are all three noted below in the discussion.
! </p></blockquote>
  
  <p><i>[
  Summit, proposed resolution:
*************** Summit, proposed resolution:
*** 56569,56575 ****
  In 30.3.1.5 [thread.thread.member] change:
  </p>
  
! <blockquote><pre>void detach();
  </pre>
  <blockquote>
  <p>...</p>
--- 60335,60342 ----
  In 30.3.1.5 [thread.thread.member] change:
  </p>
  
! <blockquote><pre>
! void detach();
  </pre>
  <blockquote>
  <p>...</p>
*************** we can just use that.
*** 56598,56607 ****
  This corresponds to the pthreads specification, where pthread_detach
  fails if the thread is not joinable:
  </p>
! <blockquote>
  EINVAL: The  implementation  has  detected  that  the value specified by
  thread does not refer to a joinable thread.
! </blockquote>
  <p>
  Jonathan recommends this proposed wording:
  </p>
--- 60365,60374 ----
  This corresponds to the pthreads specification, where pthread_detach
  fails if the thread is not joinable:
  </p>
! <blockquote><p>
  EINVAL: The  implementation  has  detected  that  the value specified by
  thread does not refer to a joinable thread.
! </p></blockquote>
  <p>
  Jonathan recommends this proposed wording:
  </p>
*************** Jonathan recommends this proposed wordin
*** 56610,56616 ****
  In 30.3.1.5 [thread.thread.member] change:
  </p>
  
! <blockquote><pre>void detach();
  </pre>
  <blockquote>
  <p>...</p>
--- 60377,60384 ----
  In 30.3.1.5 [thread.thread.member] change:
  </p>
  
! <blockquote><pre>
! void detach();
  </pre>
  <blockquote>
  <p>...</p>
*************** Anthony recommends this proposed wording
*** 56643,56649 ****
  In 30.3.1.5 [thread.thread.member] change:
  </p>
  
! <blockquote><pre>void detach();
  </pre>
  <blockquote>
  <p>...</p>
--- 60411,60418 ----
  In 30.3.1.5 [thread.thread.member] change:
  </p>
  
! <blockquote><pre>
! void detach();
  </pre>
  <blockquote>
  <p>...</p>
*************** In 30.3.1.5 [thread.thread.member] chang
*** 56665,56673 ****
  ]</i></p>
  
  
! <blockquote>
  Mark as Ready with proposed resolution from Summit.
! </blockquote>
  
  
  
--- 60434,60442 ----
  ]</i></p>
  
  
! <blockquote><p>
  Mark as Ready with proposed resolution from Summit.
! </p></blockquote>
  
  
  
*************** Mark as Ready with proposed resolution f
*** 56677,56683 ****
  In 30.3.1.5 [thread.thread.member] change:
  </p>
  
! <blockquote><pre>void detach();
  </pre>
  <blockquote>
  <p>...</p>
--- 60446,60453 ----
  In 30.3.1.5 [thread.thread.member] change:
  </p>
  
! <blockquote><pre>
! void detach();
  </pre>
  <blockquote>
  <p>...</p>
*************** In 30.3.1.5 [thread.thread.member] chang
*** 56696,56706 ****
  
  
  <hr>
  <h3><a name="965"></a>965. Various threading bugs #15</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.1 [thread.condition.condvar]: the constructor for
--- 60466,60557 ----
  
  
  <hr>
+ <h3><a name="964"></a>964. Various threading bugs #14</h3>
+ <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The requirements for the constructor for <tt>condition_variable</tt> has several
+ error conditions, but the requirements for the constructor for
+ <tt>condition_variable_any</tt> has none. Is this difference intentional?
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to open, pass to Howard. If this is intentional, a note may be
+ helpful. If the error conditions are to be copied from
+ <tt>condition_variable</tt>, this depends on LWG <a href="lwg-defects.html#965">965</a>.
+ </p></blockquote>
+ 
+ <p><i>[
+ Post Summit Howard adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ The original intention 
+ (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2447.htm#ConditionVariablesWording">N2447</a>)
+ was to let the OS return whatever errors it was going to return, and for
+ those to be translated into exceptions, for both
+ <tt>condition_variable</tt> and <tt>condition_variable_any</tt>.  I have not
+ received any complaints about specific error conditions from vendors on
+ non-POSIX platforms, but such complaints would not surprise me if they surfaced.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Leave open. Benjamin to provide wording.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ We don't have throw clauses for condition variables.
+ </p>
+ <p>
+ This issue may be dependent on LWG <a href="lwg-defects.html#1268">1268</a>.
+ </p>
+ <p>
+ Leave open. Detlef will coordinate with Benjamin.
+ </p>
+ <p>
+ Consider merging LWG 964, <a href="lwg-defects.html#966">966</a>, and <a href="lwg-defects.html#1268">1268</a> into a
+ single paper.
+ </p>
+ </blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Resolved 2011-03 Madrid meeting by paper 
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278.htm">N3278</a>
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="965"></a>965. Various threading bugs #15</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.1 [thread.condition.condvar]: the constructor for
*************** C++ interface does not separate declarat
*** 56731,56740 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 60582,60591 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** previously-initialized but as of yet und
*** 56758,56768 ****
  
  
  <hr>
  <h3><a name="967"></a>967. Various threading bugs #17</h3>
! <p><b>Section:</b> 30.3.1.2 [thread.thread.constr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.constr">issues</a> in [thread.thread.constr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  the error handling for the constructor for <tt>condition_variable</tt>
--- 60609,60849 ----
  
  
  <hr>
+ <h3><a name="966"></a>966. Various threading bugs #16</h3>
+ <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 30.5.1 [thread.condition.condvar]:
+ <tt>condition_variable::wait</tt> and
+ <tt>condition_variable::wait_until</tt> both have a postcondition that
+ <tt>lock</tt> is locked by the calling thread, and a throws clause that
+ requires throwing an exception if this postcondition cannot be achieved.
+ How can the implementation detect that this <tt>lock</tt> can never be
+ obtained?
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to open. Requires wording. Agreed this is an issue, and the
+ specification should not require detecting deadlocks.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-08-01 Howard provides wording.
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ The proposed wording is inspired by the POSIX spec which says:
+ </p>
+ 
+ <blockquote>
+ <dl>
+ <dt>[EINVAL]</dt>
+ <dd>The value specified by cond or mutex is invalid.</dd>
+ <dt>[EPERM]</dt>
+ <dd>The mutex was not owned by the current thread at the time of the call.</dd>
+ </dl>
+ </blockquote>
+ 
+ <p>
+ I do not believe [EINVAL] is possible without memory corruption (which we don't
+ specify).  [EPERM] is possible if this thread doesn't own the mutex, which is
+ listed as a precondition.  "May" is used instead of "Shall" because not all
+ OS's are POSIX.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Leave open, Detlef to provide improved wording.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10-23 Detlef Provided wording.
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Detlef's wording put in Proposed resolution.  Original wording here:
+ </p>
+ <blockquote>
+ <p>
+ Change 30.5.1 [thread.condition.condvar] p12, p19 and
+ 30.5.2 [thread.condition.condvarany] p10, p16:
+ </p>
+ 
+ <blockquote><p>
+ <i>Throws:</i> <ins>May throw</ins> <tt>std::system_error</tt> 
+ <ins>
+ if a precondition is not met.
+ </ins>
+ <del>when the effects or postcondition
+ cannot be achieved.</del>
+ </p></blockquote>
+ </blockquote>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Leave open, Detlef to provide improved wording.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-11-18 Anthony adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ <tt>condition_variable::wait</tt> takes a <tt>unique_lock&lt;mutex&gt;</tt>. We
+ know whether or not a <tt>unique_lock</tt> owns a lock, through use of its
+ <tt>owns_lock()</tt> member.
+ </p>
+ 
+ <p>
+ I would like to propose the following resolution:
+ </p>
+ 
+ <blockquote>
+ <p>
+ Modify the first sentence of 30.5.1 [thread.condition.condvar] p9:
+ </p>
+ 
+ <blockquote><pre>
+ void wait(unique_lock&lt;mutex&gt;&amp; lock);
+ </pre>
+ <blockquote><p>
+ 9 <i>Precondition:</i> <del><tt>lock</tt> is locked by the calling thread</del>
+ <ins><tt>lock.owns_lock()</tt> is <tt>true</tt></ins>, and either
+ </p><p>...</p>
+ </blockquote>
+ </blockquote>
+ 
+ <p>
+ Replace 30.5.1 [thread.condition.condvar] p11-13 with:
+ </p>
+ 
+ <blockquote><pre>
+ void wait(unique_lock&lt;mutex&gt;&amp; lock);
+ </pre>
+ <blockquote>
+ <p>...</p>
+ <p>
+ 11 <i>Postcondition:</i> <del><tt>lock</tt> is locked by the calling
+ thread</del> <ins><tt>lock.owns_lock()</tt> is <tt>true</tt></ins>.
+ </p>
+ 
+ <p>
+ 12 <i>Throws:</i> <tt>std::system_error</tt> <del>when the effects or
+ postcondition cannot be achieved</del> <ins>if the implementation detects that
+ the preconditions are not met or the effects cannot be achieved. Any exception
+ thrown by <tt>lock.lock()</tt> or <tt>lock.unlock()</tt></ins>.
+ </p>
+ 
+ <p>
+ 13 <i>Error Conditions:</i> <ins>The error conditions are implementation
+ defined.</ins>
+ </p>
+ 
+ <ul>
+ <li><del>
+ equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
+ </del></li>
+ </ul>
+ 
+ </blockquote>
+ </blockquote>
+ </blockquote>
+ </blockquote>
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ There are heavy conflicts with adopted papers.
+ </p>
+ <p>
+ This issue is dependent on LWG <a href="lwg-defects.html#1268">1268</a>.
+ </p>
+ <p>
+ Leave open pending outstanding edits to the working draft. Detlef will provide
+ wording.
+ </p>
+ <p>
+ Possibly related to <a href="lwg-defects.html#964">964</a>.
+ </p>
+ 
+ </blockquote>
+ 
+ <p><i>[2011-03-24 Madrid]</i></p>
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ This has been resolved since filing, with the introduction of <tt>system_error</tt> to the thread specification.
+ </p>
+ 
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Replace 30.5.1 [thread.condition.condvar] p12, p19 and
+ 30.5.2 [thread.condition.condvarany] p10, p16:
+ </p>
+ 
+ <blockquote>
+ <p><del>
+ <i>Throws:</i> <tt>std::system_error</tt> when the effects or
+ postcondition cannot be achieved.
+ </del></p>
+ <p><del>
+ Error conditions:
+ </del></p>
+ <ul>
+ <li><del>
+ equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
+ </del></li>
+ </ul>
+ 
+ <p><ins>
+ <i>Throws:</i> It is implementation-defined whether a <tt>std::system_error</tt>
+ with implementation-defined error condition is thrown if the
+ precondition is not met.
+ </ins></p>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="967"></a>967. Various threading bugs #17</h3>
! <p><b>Section:</b> 30.3.1.2 [thread.thread.constr] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.constr">issues</a> in [thread.thread.constr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  the error handling for the constructor for <tt>condition_variable</tt>
*************** Beman has volunteered to provide propose
*** 56781,56799 ****
  ]</i></p>
  
  
! <blockquote>
! The proposed resolution assumes <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a> has been accepted and
  its proposed resolution applied to the working paper.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 60862,60880 ----
  ]</i></p>
  
  
! <blockquote><p>
! The proposed resolution assumes <a href="lwg-defects.html#962">962</a> has been accepted and
  its proposed resolution applied to the working paper.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** paragraph 4, as indicated:</span></p>
*** 56808,56832 ****
    <blockquote>
  
  <ul>
! <li><del> <code>not_enough_memory</code> — if there is not enough memory to construct 
  the mutex object.</del></li>
  
! <li><code>resource_unavailable_try_again</code> — if any native handle type 
  manipulated is not available.</li>
  
! <li><code>operation_not_permitted</code> — if the thread does not have the 
  necessary permission to change the state of the mutex object.</li>
  
! <li><code>device_or_resource_busy</code> — if any native handle type 
  manipulated is already locked.</li>
  
! <li><code>invalid_argument</code> — if any native handle type manipulated as 
  part of mutex construction is incorrect.</li>
  </ul>
    </blockquote>
  </blockquote>
  
! <p><span style="font-style: italic">Change Class condition_variable 30.5.1 [thread.condition.condvar], 
  default constructor, as indicated:</span></p>
  <blockquote>
    <p><code>condition_variable();</code></p>
--- 60889,60913 ----
    <blockquote>
  
  <ul>
! <li><del> <code>not_enough_memory</code> &mdash; if there is not enough memory to construct 
  the mutex object.</del></li>
  
! <li><code>resource_unavailable_try_again</code> &mdash; if any native handle type 
  manipulated is not available.</li>
  
! <li><code>operation_not_permitted</code> &mdash; if the thread does not have the 
  necessary permission to change the state of the mutex object.</li>
  
! <li><code>device_or_resource_busy</code> &mdash; if any native handle type 
  manipulated is already locked.</li>
  
! <li><code>invalid_argument</code> &mdash; if any native handle type manipulated as 
  part of mutex construction is incorrect.</li>
  </ul>
    </blockquote>
  </blockquote>
  
! <p><span style="font-style: italic">Change Class <tt>condition_variable</tt> 30.5.1 [thread.condition.condvar], 
  default constructor, as indicated:</span></p>
  <blockquote>
    <p><code>condition_variable();</code></p>
*************** default constructor, as indicated:</span
*** 56836,56846 ****
      <p><i>Error conditions:</i></p>
      <blockquote>
      <ul>
!       <li><del><code>not_enough_memory</code> — if a memory limitation prevents 
        initialization.</del></li>
!       <li> <code>resource_unavailable_try_again</code> — if some non-memory 
        resource limitation prevents initialization.</li>
!       <li> <code>device_or_resource_busy</code> — if attempting to initialize a 
        previously-initialized but as of yet undestroyed <code>condition_variable</code>.</li>
      </ul>
      </blockquote>
--- 60917,60927 ----
      <p><i>Error conditions:</i></p>
      <blockquote>
      <ul>
!       <li><del><code>not_enough_memory</code> &mdash; if a memory limitation prevents 
        initialization.</del></li>
!       <li> <code>resource_unavailable_try_again</code> &mdash; if some non-memory 
        resource limitation prevents initialization.</li>
!       <li> <code>device_or_resource_busy</code> &mdash; if attempting to initialize a 
        previously-initialized but as of yet undestroyed <code>condition_variable</code>.</li>
      </ul>
      </blockquote>
*************** default constructor, as indicated:</span
*** 56853,56862 ****
  
  <hr>
  <h3><a name="968"></a>968. Various threading bugs #18</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.4.1 [thread.mutex.requirements]: several functions are
--- 60934,60944 ----
  
  <hr>
  <h3><a name="968"></a>968. Various threading bugs #18</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-01-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.4.1 [thread.mutex.requirements]: several functions are
*************** permission ...". "The necessary permissi
*** 56868,56876 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  Move to open.
! </blockquote>
  
  
  <p><i>[
--- 60950,60958 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  Move to open.
! </p></blockquote>
  
  
  <p><i>[
*************** Beman has volunteered to provide propose
*** 56883,56891 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready with minor word-smithing in the example.
! </blockquote>
  
  
  
--- 60965,60973 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready with minor word-smithing in the example.
! </p></blockquote>
  
  
  
*************** Moved to Ready with minor word-smithing
*** 56898,56905 ****
  specified to throw exceptions of type <code>system_error</code> (19.5.5). Such exceptions 
  shall be thrown if any of the <i>Error conditions</i> are detected or a call to an operating system or other underlying API 
  results in an error that prevents the library function from meeting its specifications.
! <i>[Note:</i> See 17.6.4.12 [res.on.exception.handling] for exceptions thrown to report 
! storage allocation failures. <i>—end 
  note]</i></p>
  
  <p><ins><i>[Example:</i></ins></p>
--- 60980,60987 ----
  specified to throw exceptions of type <code>system_error</code> (19.5.5). Such exceptions 
  shall be thrown if any of the <i>Error conditions</i> are detected or a call to an operating system or other underlying API 
  results in an error that prevents the library function from meeting its specifications.
! <i>[Note:</i> See 17.6.5.12 [res.on.exception.handling] for exceptions thrown to report 
! storage allocation failures. <i>&mdash;end 
  note]</i></p>
  
  <p><ins><i>[Example:</i></ins></p>
*************** operation_not_permitted</code> for a thr
*** 56912,56925 ****
  perform the operation. Assume that, during the execution of this function, an <code>errno</code> 
  of <code>EPERM</code> is reported by a POSIX API call used by the 
  implementation. Since POSIX specifies an <code>errno</code> of <code>EPERM</code> 
! when "the caller does not have the privilege to perform the operation", 
  the implementation maps <code>EPERM</code>&nbsp; to an <code>error_condition</code> 
  of <code>operation_not_permitted</code> (19.5 [syserr]) and an exception of type <code>
  system_error</code> is thrown. </ins></p>
  
  </blockquote>
  
! <p><ins><i>—end example]</i></ins></p>
  
  <p><span style="font-style: italic">Editorial note: For the sake of exposition, 
  the existing text above is shown with the changes proposed in issues 962 and 967. The 
--- 60994,61007 ----
  perform the operation. Assume that, during the execution of this function, an <code>errno</code> 
  of <code>EPERM</code> is reported by a POSIX API call used by the 
  implementation. Since POSIX specifies an <code>errno</code> of <code>EPERM</code> 
! when &quot;the caller does not have the privilege to perform the operation&quot;, 
  the implementation maps <code>EPERM</code>&nbsp; to an <code>error_condition</code> 
  of <code>operation_not_permitted</code> (19.5 [syserr]) and an exception of type <code>
  system_error</code> is thrown. </ins></p>
  
  </blockquote>
  
! <p><ins><i>&mdash;end example]</i></ins></p>
  
  <p><span style="font-style: italic">Editorial note: For the sake of exposition, 
  the existing text above is shown with the changes proposed in issues 962 and 967. The 
*************** paragraph 4, as indicated:</span></p>
*** 56933,56939 ****
  
  <blockquote>
  
! <p>— <code>operation_not_permitted</code> — if the thread does not have the 
  <del>necessary permission to change the state of the mutex object</del> <ins>privilege to perform the operation</ins>.</p>
  
  </blockquote>
--- 61015,61021 ----
  
  <blockquote>
  
! <p>&mdash; <code>operation_not_permitted</code> &mdash; if the thread does not have the 
  <del>necessary permission to change the state of the mutex object</del> <ins>privilege to perform the operation</ins>.</p>
  
  </blockquote>
*************** paragraph 12, as indicated:</span></p>
*** 56943,56949 ****
  
  <blockquote>
  
! <p>— <code>operation_not_permitted</code> — if the thread does not have the 
  <del>necessary permission to change the state of the mutex</del> <ins>privilege to perform the operation</ins>.</p>
  
  </blockquote>
--- 61025,61031 ----
  
  <blockquote>
  
! <p>&mdash; <code>operation_not_permitted</code> &mdash; if the thread does not have the 
  <del>necessary permission to change the state of the mutex</del> <ins>privilege to perform the operation</ins>.</p>
  
  </blockquote>
*************** paragraph 12, as indicated:</span></p>
*** 56954,56969 ****
  
  
  <hr>
! <h3><a name="970"></a>970. addressof overload unneeded</h3>
! <p><b>Section:</b> 20.9.8.1 [specialized.addressof] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-01-16 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.9.8.1 [specialized.addressof] specifies:
  </p>
  
! <blockquote><pre>template &lt;ObjectType T&gt; T* addressof(T&amp; r);
  template &lt;ObjectType T&gt; T* addressof(T&amp;&amp; r);
  </pre></blockquote>
  
--- 61036,61053 ----
  
  
  <hr>
! <h3><a name="970"></a>970. <tt>addressof</tt> overload unneeded</h3>
! <p><b>Section:</b> 20.7.12.1 [specialized.addressof] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-01-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#specialized.addressof">issues</a> in [specialized.addressof].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.7.12.1 [specialized.addressof] specifies:
  </p>
  
! <blockquote><pre>
! template &lt;ObjectType T&gt; T* addressof(T&amp; r);
  template &lt;ObjectType T&gt; T* addressof(T&amp;&amp; r);
  </pre></blockquote>
  
*************** Post Summit:
*** 56978,56995 ****
  ]</i></p>
  
  
! <blockquote>
  Recommend Review.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-11-18 Moved from Pending WP to WP.  Confirmed in
--- 61062,61079 ----
  ]</i></p>
  
  
! <blockquote><p>
  Recommend Review.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-11-18 Moved from Pending WP to WP.  Confirmed in
*************** Move to Tentatively Ready.
*** 57000,57009 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.8.1 [specialized.addressof]:
  </p>
  
! <blockquote><pre>template &lt;ObjectType T&gt; T* addressof(T&amp; r);
  <del>template &lt;ObjectType T&gt; T* addressof(T&amp;&amp; r);</del>
  </pre></blockquote>
  
--- 61084,61094 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.7.12.1 [specialized.addressof]:
  </p>
  
! <blockquote><pre>
! template &lt;ObjectType T&gt; T* addressof(T&amp; r);
  <del>template &lt;ObjectType T&gt; T* addressof(T&amp;&amp; r);</del>
  </pre></blockquote>
  
*************** Change 20.9.8.1 [specialized.addressof]:
*** 57014,57030 ****
  
  <hr>
  <h3><a name="974"></a>974. <tt>duration&lt;double&gt;</tt> should not implicitly convert to <tt>duration&lt;int&gt;</tt></h3>
! <p><b>Section:</b> 20.11.3.1 [time.duration.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-01-21 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The following code should not compile because it involves implicit truncation
  errors (against the design philosophy of the <tt>duration</tt> library).
  </p>
  
! <blockquote><pre>duration&lt;double&gt; d(3.5);
! duration&lt;int&gt; i = d;  <font color="#C80000">// implicit truncation, should not compile</font>
  </pre></blockquote>
  
  <p>
--- 61099,61117 ----
  
  <hr>
  <h3><a name="974"></a>974. <tt>duration&lt;double&gt;</tt> should not implicitly convert to <tt>duration&lt;int&gt;</tt></h3>
! <p><b>Section:</b> 20.12.5.1 [time.duration.cons] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-01-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration.cons">issues</a> in [time.duration.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The following code should not compile because it involves implicit truncation
  errors (against the design philosophy of the <tt>duration</tt> library).
  </p>
  
! <blockquote><pre>
! duration&lt;double&gt; d(3.5);
! duration&lt;int&gt; i = d;  <span style="color:#C80000">// implicit truncation, should not compile</span>
  </pre></blockquote>
  
  <p>
*************** Move to Tentatively Ready.
*** 57051,57092 ****
  ]</i></p>
  
  
! <blockquote>
  Moved from Tentatively Ready to Open only because the wording needs to be
! improved for enable_if type constraining, possibly following Robert's
  formula.
! </blockquote>
  
  <p><i>[
  2009-08-01 Howard adds:
  ]</i></p>
  
  
! <blockquote>
! Addressed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
! Not completely addressed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>.  Move to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.11.3.1 [time.duration.cons], p4:
  </p>
  
  <blockquote>
! <pre>template &lt;class Rep2, class Period2&gt; 
    duration(const duration&lt;Rep2, Period2&gt;&amp; d);
  </pre>
! <blockquote>
  -4- <i>Requires:</i> <tt>treat_as_floating_point&lt;rep&gt;::value</tt>
  shall be <tt>true</tt> or <ins>both</ins> <tt>ratio_divide&lt;Period2,
  period&gt;::type::den</tt> shall be 1
--- 61138,61180 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Tentatively Ready to Open only because the wording needs to be
! improved for <tt>enable_if</tt> type constraining, possibly following Robert's
  formula.
! </p></blockquote>
  
  <p><i>[
  2009-08-01 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
! Addressed by <a href="lwg-defects.html#1177">1177</a>.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
! Not completely addressed by <a href="lwg-defects.html#1177">1177</a>.  Move to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.12.5.1 [time.duration.cons], p4:
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Rep2, class Period2&gt; 
    duration(const duration&lt;Rep2, Period2&gt;&amp; d);
  </pre>
! <blockquote><p>
  -4- <i>Requires:</i> <tt>treat_as_floating_point&lt;rep&gt;::value</tt>
  shall be <tt>true</tt> or <ins>both</ins> <tt>ratio_divide&lt;Period2,
  period&gt;::type::den</tt> shall be 1
*************** Diagnostic required.
*** 57096,57103 ****
  [<i>Note:</i> This requirement prevents implicit truncation error when
  converting between integral-based <tt>duration</tt> types. Such a
  construction could easily lead to confusion about the value of the
! <tt>duration</tt>. -- <i>end note</i>]
! </blockquote>
  </blockquote>
  
  
--- 61184,61191 ----
  [<i>Note:</i> This requirement prevents implicit truncation error when
  converting between integral-based <tt>duration</tt> types. Such a
  construction could easily lead to confusion about the value of the
! <tt>duration</tt>. &mdash; <i>end note</i>]
! </p></blockquote>
  </blockquote>
  
  
*************** construction could easily lead to confus
*** 57105,57127 ****
  
  
  <hr>
! <h3><a name="975"></a>975. <tt>is_convertible</tt> cannot be instantiated for  non-convertible types</h3>
! <p><b>Section:</b> 20.7.6 [meta.rel] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-01-25 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.rel">issues</a> in [meta.rel].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
! 
! <b>Addresses UK 206</b>
  
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1114">1114</a>.
  </p>
  
  <p>
  The current specification of <tt>std::is_convertible</tt> (reference is draft
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>)
! is basically defined by 20.7.6 [meta.rel]/4:
  </p>
  
  <blockquote>
--- 61193,61214 ----
  
  
  <hr>
! <h3><a name="975"></a>975. <tt>is_convertible</tt> cannot be instantiated for non-convertible types</h3>
! <p><b>Section:</b> 20.10.6 [meta.rel] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-01-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.rel">issues</a> in [meta.rel].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 206</b></p>
  
  <p>
! Related to <a href="lwg-defects.html#1114">1114</a>.
  </p>
  
  <p>
  The current specification of <tt>std::is_convertible</tt> (reference is draft
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">N2798</a>)
! is basically defined by 20.10.6 [meta.rel] p.4:
  </p>
  
  <blockquote>
*************** In order to instantiate the template <tt
*** 57130,57136 ****
  To&gt;</tt>, the following code shall be well formed:
  </p>
  
! <blockquote><pre>template &lt;class T&gt;
    typename add_rvalue_reference&lt;T&gt;::type create();
  
  To test() {
--- 61217,61224 ----
  To&gt;</tt>, the following code shall be well formed:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt;
    typename add_rvalue_reference&lt;T&gt;::type create();
  
  To test() {
*************** To test() {
*** 57140,57146 ****
  
  <p>
  [<i>Note:</i> This requirement gives well defined results for reference
! types, void types, array types, and function types. --<i>end note</i>]
  </p>
  </blockquote>
  
--- 61228,61234 ----
  
  <p>
  [<i>Note:</i> This requirement gives well defined results for reference
! types, void types, array types, and function types. &mdash; <i>end note</i>]
  </p>
  </blockquote>
  
*************** types, void types, array types, and func
*** 57148,57154 ****
  The first sentence can be interpreted, that e.g. the expression
  </p>
  
! <blockquote><pre>std::is_convertible&lt;double, int*&gt;::value
  </pre></blockquote>
  
  <p>
--- 61236,61243 ----
  The first sentence can be interpreted, that e.g. the expression
  </p>
  
! <blockquote><pre>
! std::is_convertible&lt;double, int*&gt;::value
  </pre></blockquote>
  
  <p>
*************** If the following <tt>test</tt> function
*** 57171,57177 ****
  is <tt>true</tt>, else it is <tt>false</tt>.
  </p>
  
! <blockquote><pre>template &lt;class T&gt;
    typename add_rvalue_reference&lt;T&gt;::type create();
  
  To test() {
--- 61260,61267 ----
  is <tt>true</tt>, else it is <tt>false</tt>.
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt;
    typename add_rvalue_reference&lt;T&gt;::type create();
  
  To test() {
*************** To test() {
*** 57181,57187 ****
  
  <p>
  [<i>Note:</i> This definition gives well defined results for <tt>reference</tt>
! types, <tt>void</tt> types, array types, and function types. --<i>end note</i>]
  </p>
  </blockquote>
  
--- 61271,61277 ----
  
  <p>
  [<i>Note:</i> This definition gives well defined results for <tt>reference</tt>
! types, <tt>void</tt> types, array types, and function types. &mdash; <i>end note</i>]
  </p>
  </blockquote>
  
*************** Post Summit:
*** 57192,57198 ****
  
  <blockquote>
  <p>
! Jens: Checking that code is well-formed and then returning true/false
  sounds like speculative compilation. John Spicer would really dislike
  this. Please find another wording suggesting speculative compilation.
  </p>
--- 61282,61288 ----
  
  <blockquote>
  <p>
! Jens: Checking that code is well-formed and then returning <tt>true</tt>&#47;<tt>false</tt>
  sounds like speculative compilation. John Spicer would really dislike
  this. Please find another wording suggesting speculative compilation.
  </p>
*************** John finds the following wording clearer
*** 57213,57234 ****
  <blockquote>
  
  <table border="1">
! <tbody><tr>
  <th>Template</th><th>Condition</th><th>Comments</th>
  </tr>
  <tr>
! <td><tt>template &lt;class From, class To&gt;<br>struct is_convertible;</tt></td>
  <td><i>see below</i></td>
  <td><tt>From</tt> and <tt>To</tt> shall be complete types, arrays of unknown bound,
  or (possibly cv-qualified) <tt>void</tt> types.</td>
  </tr>
! </tbody></table>
  
  <p>
  Given the following function prototype:
  </p>
  
! <blockquote><pre>template &lt;class T&gt;
    typename add_rvalue_reference&lt;T&gt;::type create();
  </pre></blockquote>
  
--- 61303,61325 ----
  <blockquote>
  
  <table border="1">
! <tr>
  <th>Template</th><th>Condition</th><th>Comments</th>
  </tr>
  <tr>
! <td><tt>template &lt;class From, class To&gt;<br/>struct is_convertible;</tt></td>
  <td><i>see below</i></td>
  <td><tt>From</tt> and <tt>To</tt> shall be complete types, arrays of unknown bound,
  or (possibly cv-qualified) <tt>void</tt> types.</td>
  </tr>
! </table>
  
  <p>
  Given the following function prototype:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt;
    typename add_rvalue_reference&lt;T&gt;::type create();
  </pre></blockquote>
  
*************** any implicit conversions to the return t
*** 57239,57245 ****
  <tt>is_convertible&lt;From, To&gt;::value</tt> shall be <tt>false</tt>.
  </p>
  
! <blockquote><pre>To test() {
    return create&lt;From&gt;();
  }
  </pre></blockquote>
--- 61330,61337 ----
  <tt>is_convertible&lt;From, To&gt;::value</tt> shall be <tt>false</tt>.
  </p>
  
! <blockquote><pre>
! To test() {
    return create&lt;From&gt;();
  }
  </pre></blockquote>
*************** any implicit conversions to the return t
*** 57247,57290 ****
  </blockquote>
  
  </blockquote>
! 
  <b>Original proposed wording:</b>
! 
  <p>
! In 20.7.6 [meta.rel]/4 change:
  </p>
  
! <blockquote>
  <del>In order to instantiate the template <tt>is_convertible&lt;From, To&gt;</tt>, the
  following code shall be well formed</del> <ins>If the following code
  is well formed <tt>is_convertible&lt;From, To&gt;::value</tt> is <tt>true</tt>, otherwise
  <tt>false</tt></ins>:[..]
! </blockquote>
  
  <p><b>Revision 2</b></p>
  
  <blockquote>
  
  <p>
! In 20.7.6 [meta.rel] change:
  </p>
  
  <blockquote>
  
  <table border="1">
! <tbody><tr>
  <th>Template</th><th>Condition</th><th>Comments</th>
  </tr>
  <tr>
! </tr><tr><td>...</td><td>...</td><td>...</td></tr>
! <tr><td><tt>template &lt;class From, class To&gt;<br>struct is_convertible;</tt></td>
  <td>
  <del>The code set out below shall be well formed.</del>
  <ins><i>see below</i></ins></td>
  <td><tt>From</tt> and <tt>To</tt> shall be complete types, arrays of unknown bound,
  or (possibly cv-qualified) <tt>void</tt> types.</td>
  </tr>
! </tbody></table>
  
  <p>
  -4- <del>In order to instantiate the template <tt>is_convertible&lt;From, To&gt;</tt>, the
--- 61339,61382 ----
  </blockquote>
  
  </blockquote>
! <p>
  <b>Original proposed wording:</b>
! </p>
  <p>
! In 20.10.6 [meta.rel]/4 change:
  </p>
  
! <blockquote><p>
  <del>In order to instantiate the template <tt>is_convertible&lt;From, To&gt;</tt>, the
  following code shall be well formed</del> <ins>If the following code
  is well formed <tt>is_convertible&lt;From, To&gt;::value</tt> is <tt>true</tt>, otherwise
  <tt>false</tt></ins>:[..]
! </p></blockquote>
  
  <p><b>Revision 2</b></p>
  
  <blockquote>
  
  <p>
! In 20.10.6 [meta.rel] change:
  </p>
  
  <blockquote>
  
  <table border="1">
! <tr>
  <th>Template</th><th>Condition</th><th>Comments</th>
  </tr>
+ <tr><td>...</td><td>...</td><td>...</td></tr>
  <tr>
! <td><tt>template &lt;class From, class To&gt;<br/>struct is_convertible;</tt></td>
  <td>
  <del>The code set out below shall be well formed.</del>
  <ins><i>see below</i></ins></td>
  <td><tt>From</tt> and <tt>To</tt> shall be complete types, arrays of unknown bound,
  or (possibly cv-qualified) <tt>void</tt> types.</td>
  </tr>
! </table>
  
  <p>
  -4- <del>In order to instantiate the template <tt>is_convertible&lt;From, To&gt;</tt>, the
*************** following code shall be well formed:</de
*** 57292,57298 ****
  <ins>Given the following function prototype:</ins>
  </p>
  
! <blockquote><pre>template &lt;class T&gt; 
    typename add_rvalue_reference&lt;T&gt;::type create();
  </pre></blockquote>
  
--- 61384,61391 ----
  <ins>Given the following function prototype:</ins>
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; 
    typename add_rvalue_reference&lt;T&gt;::type create();
  </pre></blockquote>
  
*************** any implicit conversions to the return t
*** 57305,57311 ****
  indirectly from <tt>false_type</tt>.</ins>
  </p>
  
! <blockquote><pre>To test() { 
    return create&lt;From&gt;(); 
  }
  </pre></blockquote>
--- 61398,61405 ----
  indirectly from <tt>false_type</tt>.</ins>
  </p>
  
! <blockquote><pre>
! To test() { 
    return create&lt;From&gt;(); 
  }
  </pre></blockquote>
*************** void types, array types, and function ty
*** 57322,57355 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  
  <p>
! In 20.7.6 [meta.rel] change:
  </p>
  
  <blockquote>
  
  <table border="1">
! <tbody><tr>
  <th>Template</th><th>Condition</th><th>Comments</th>
  </tr>
  <tr>
! </tr><tr><td>...</td><td>...</td><td>...</td></tr>
! <tr><td><tt>template &lt;class From, class To&gt;<br>struct is_convertible;</tt></td>
  <td>
  <del>The code set out below shall be well formed.</del>
  <ins><i>see below</i></ins></td>
  <td><tt>From</tt> and <tt>To</tt> shall be complete types, arrays of unknown bound,
  or (possibly cv-qualified) <tt>void</tt> types.</td>
  </tr>
! </tbody></table>
  
  <p>
  -4- <del>In order to instantiate the template <tt>is_convertible&lt;From, To&gt;</tt>, the
--- 61416,61449 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  
  <p>
! In 20.10.6 [meta.rel] change:
  </p>
  
  <blockquote>
  
  <table border="1">
! <tr>
  <th>Template</th><th>Condition</th><th>Comments</th>
  </tr>
+ <tr><td>...</td><td>...</td><td>...</td></tr>
  <tr>
! <td><tt>template &lt;class From, class To&gt;<br/>struct is_convertible;</tt></td>
  <td>
  <del>The code set out below shall be well formed.</del>
  <ins><i>see below</i></ins></td>
  <td><tt>From</tt> and <tt>To</tt> shall be complete types, arrays of unknown bound,
  or (possibly cv-qualified) <tt>void</tt> types.</td>
  </tr>
! </table>
  
  <p>
  -4- <del>In order to instantiate the template <tt>is_convertible&lt;From, To&gt;</tt>, the
*************** following code shall be well formed:</de
*** 57357,57363 ****
  <ins>Given the following function prototype:</ins>
  </p>
  
! <blockquote><pre>template &lt;class T&gt; 
    typename add_rvalue_reference&lt;T&gt;::type create();
  </pre></blockquote>
  
--- 61451,61458 ----
  <ins>Given the following function prototype:</ins>
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; 
    typename add_rvalue_reference&lt;T&gt;::type create();
  </pre></blockquote>
  
*************** including any implicit conversions to th
*** 57369,57396 ****
  function.</ins>
  </p>
  
! <blockquote><pre>To test() { 
    return create&lt;From&gt;(); 
  }
  </pre></blockquote>
  
  <p>
  [<i>Note:</i> This requirement gives well defined results for reference types,
! void types, array types, and function types. <i>— end note</i>]
  </p>
  
  </blockquote>
  
  
  
  
  
  <hr>
  <h3><a name="978"></a>978. Hashing smart pointers</h3>
! <p><b>Section:</b> 20.8.15 [unord.hash] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-02-02 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 208</b></p>
  <p>
--- 61464,61584 ----
  function.</ins>
  </p>
  
! <blockquote><pre>
! To test() { 
    return create&lt;From&gt;(); 
  }
  </pre></blockquote>
  
  <p>
  [<i>Note:</i> This requirement gives well defined results for reference types,
! void types, array types, and function types. &mdash; <i>end note</i>]
! </p>
! 
! </blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="976"></a>976. Class template <tt>std::stack</tt> should be movable</h3>
! <p><b>Section:</b> 23.6.5.2 [stack.defn] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-02-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The synopsis given in 23.6.5.2 [stack.defn] does not show up
  </p>
  
+ <blockquote><pre>
+ requires MoveConstructible&lt;Cont&gt; stack(stack&amp;&amp;);
+ requires MoveAssignable&lt;Cont&gt; stack&amp; operator=(stack&amp;&amp;);
+ </pre></blockquote>
+ 
+ <p>
+ although the other container adaptors do provide corresponding members.
+ </p>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote>
+ <p>
+ We agree with the proposed resolution.
+ </p>
+ <p>
+ Move to Tentatively Ready.
+ </p>
  </blockquote>
  
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved from Tentatively Ready to Open only because the wording needs to be
+ tweaked for concepts removal.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-08-18 Daniel updates the wording and Howard sets to Review.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-08-23 Howard adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <a href="lwg-defects.html#1194">1194</a> also adds these move members using an editorially different style.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Mark <del>NAD Editorial</del><ins>Resolved</ins>, addressed by issue <a href="lwg-defects.html#1194">1194</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ In the class stack synopsis of 23.6.5.2 [stack.defn] insert:
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class T, class Container = deque&lt;T&gt; &gt;
+ class stack {
+   [..]
+   explicit stack(const Container&amp;);
+   explicit stack(Container&amp;&amp; = Container());
+   <ins>stack(stack&amp;&amp; s) : c(std::move(s.c)) {}</ins>
+   <ins>stack&amp; operator=(stack&amp;&amp; s) { c = std::move(s.c); return *this; }</ins>
+   [..]
+ };
+ </pre></blockquote>
+ 
+ 
+ 
+ 
  
  
  
  
  <hr>
  <h3><a name="978"></a>978. Hashing smart pointers</h3>
! <p><b>Section:</b> 20.9.13 [unord.hash] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-02-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.hash">active issues</a> in [unord.hash].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 208</b></p>
  <p>
*************** Bill would prefer to be conservative.
*** 57420,57426 ****
  </p>
  <p>
  Alisdair mentions that this issue may also be viewed as a subissue or
! duplicate of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1025">1025</a>.
  </p>
  <p>
  Move to Open, and recommend the issue be deferred until after the next
--- 61608,61614 ----
  </p>
  <p>
  Alisdair mentions that this issue may also be viewed as a subissue or
! duplicate of issue <a href="lwg-active.html#1025">1025</a>.
  </p>
  <p>
  Move to Open, and recommend the issue be deferred until after the next
*************** Committee Draft is issued.
*** 57434,57442 ****
  
  
  <blockquote>
! <blockquote>
  Howard points out that the client can always supply a custom hash function.
! </blockquote>
  <p>
  Not entirely true. The client cannot supply the function that hashes the
  address of the control block (the equivalent of the old <tt>operator&lt;</tt>, now
--- 61622,61630 ----
  
  
  <blockquote>
! <blockquote><p>
  Howard points out that the client can always supply a custom hash function.
! </p></blockquote>
  <p>
  Not entirely true. The client cannot supply the function that hashes the
  address of the control block (the equivalent of the old <tt>operator&lt;</tt>, now
*************** This hash function makes sense in certai
*** 57462,57470 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  2009-11-16 Moved from Ready to Open:
--- 61650,61658 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  2009-11-16 Moved from Ready to Open:
*************** containers.
*** 57494,57502 ****
  Howard writes:
  </p>
  
! <blockquote>
  Is this a request to pull 978 from Ready?
! </blockquote>
  
  <p>
  Barry writes:
--- 61682,61690 ----
  Howard writes:
  </p>
  
! <blockquote><p>
  Is this a request to pull 978 from Ready?
! </p></blockquote>
  
  <p>
  Barry writes:
*************** Ready.
*** 57511,57517 ****
  </blockquote>
  
  <p><i>[
! 2010-01-31 Alisdair: related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>.
  ]</i></p>
  
  
--- 61699,61705 ----
  </blockquote>
  
  <p><i>[
! 2010-01-31 Alisdair: related to <a href="lwg-defects.html#1245">1245</a> and <a href="lwg-defects.html#1182">1182</a>.
  ]</i></p>
  
  
*************** Ready.
*** 57530,57536 ****
  <p><b>Proposed resolution:</b></p>
  
  <p><i>Add the following declarations to the synopsis of <tt>&lt;memory&gt;</tt> in 
! 20.9 [memory] </i></p>
  
  <blockquote>
  <pre><ins>// [util.smartptr.hash] hash support
--- 61718,61724 ----
  <p><b>Proposed resolution:</b></p>
  
  <p><i>Add the following declarations to the synopsis of <tt>&lt;memory&gt;</tt> in 
! 20.7 [memory] </i></p>
  
  <blockquote>
  <pre><ins>// [util.smartptr.hash] hash support
*************** template &lt;class T, class D&gt; struct
*** 57539,57545 ****
  template &lt;class T&gt; struct hash&lt;shared_ptr&lt;T&gt;&gt;;</ins></pre>
  </blockquote>
  
! <p><i>Add a new subclause under 20.9.10 [util.smartptr] called hash support </i></p>
  
  <blockquote>
  <h3><ins>hash support [util.smartptr.hash]</ins></h3>
--- 61727,61733 ----
  template &lt;class T&gt; struct hash&lt;shared_ptr&lt;T&gt;&gt;;</ins></pre>
  </blockquote>
  
! <p><i>Add a new subclause under 20.8.2 [util.smartptr] called hash support </i></p>
  
  <blockquote>
  <h3><ins>hash support [util.smartptr.hash]</ins></h3>
*************** template &lt;class T&gt; struct hash&lt;
*** 57548,57554 ****
  
  <blockquote>
  <p><ins>
! Specialization meeting the requirements of class template <tt>hash</tt> (20.8.15 [unord.hash]). For an object <tt>p</tt> of type <tt>UP</tt>, where
  <tt>UP</tt> is a type <tt>unique_ptr&lt;T,D&gt;</tt>,
  <tt>hash&lt;UP&gt;()(p)</tt> shall evaluate to the same value as
  <tt>hash&lt;typename UP::pointer&gt;()(p.get())</tt>. The specialization
--- 61736,61742 ----
  
  <blockquote>
  <p><ins>
! Specialization meeting the requirements of class template <tt>hash</tt> (20.9.13 [unord.hash]). For an object <tt>p</tt> of type <tt>UP</tt>, where
  <tt>UP</tt> is a type <tt>unique_ptr&lt;T,D&gt;</tt>,
  <tt>hash&lt;UP&gt;()(p)</tt> shall evaluate to the same value as
  <tt>hash&lt;typename UP::pointer&gt;()(p.get())</tt>. The specialization
*************** Specialization meeting the requirements
*** 57560,57566 ****
  
  <blockquote>
  <p><ins>
! Specialization meeting the requirements of class template <tt>hash</tt> (20.8.15 [unord.hash]). For an object <tt>p</tt> of type
  <tt>shared_ptr&lt;T&gt;</tt>, <tt>hash&lt;shared_ptr&lt;T&gt;&gt;()(p)</tt>
  shall evaluate to the same value as <tt> hash&lt;T*&gt;()(p.get())</tt>.
  </ins></p>
--- 61748,61754 ----
  
  <blockquote>
  <p><ins>
! Specialization meeting the requirements of class template <tt>hash</tt> (20.9.13 [unord.hash]). For an object <tt>p</tt> of type
  <tt>shared_ptr&lt;T&gt;</tt>, <tt>hash&lt;shared_ptr&lt;T&gt;&gt;()(p)</tt>
  shall evaluate to the same value as <tt> hash&lt;T*&gt;()(p.get())</tt>.
  </ins></p>
*************** shall evaluate to the same value as <tt>
*** 57574,57584 ****
  
  <hr>
  <h3><a name="981"></a>981. Unordered container requirements should add  <tt>initializer_list</tt> support</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-02-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Refering to
--- 61762,61772 ----
  
  <hr>
  <h3><a name="981"></a>981. Unordered container requirements should add  <tt>initializer_list</tt> support</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-02-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Refering to
*************** Refering to
*** 57586,57592 ****
  all container requirements tables (including those for
  associative containers) provide useful member function overloads
  accepting <tt>std::initializer_list</tt> as argument, the only exception is
! Table 87. There seems to be no reason for not providing them, because 23.7 [unord]
  is already <tt>initializer_list</tt>-aware. For the sake of 
  library interface consistency and user-expectations corresponding 
  overloads should be added to the table requirements of unordered 
--- 61774,61780 ----
  all container requirements tables (including those for
  associative containers) provide useful member function overloads
  accepting <tt>std::initializer_list</tt> as argument, the only exception is
! Table 87. There seems to be no reason for not providing them, because 23.5 [unord]
  is already <tt>initializer_list</tt>-aware. For the sake of 
  library interface consistency and user-expectations corresponding 
  overloads should be added to the table requirements of unordered 
*************** Move to Tentatively Ready.
*** 57613,57623 ****
  In 23.2.5 [unord.req]/9 insert:
  </p>
  
! <blockquote>
  ... <tt>[q1, q2)</tt> is a valid range in <tt>a</tt>, <ins><tt>il</tt>
  designates an object of type <tt>initializer_list&lt;value_type&gt;</tt>, </ins><tt>t</tt> is a value of type
  <tt>X::value_type</tt>, ...
! </blockquote>
  
  <p>
  In 23.2.5 [unord.req], Table 87 insert:
--- 61801,61811 ----
  In 23.2.5 [unord.req]/9 insert:
  </p>
  
! <blockquote><p>
  ... <tt>[q1, q2)</tt> is a valid range in <tt>a</tt>, <ins><tt>il</tt>
  designates an object of type <tt>initializer_list&lt;value_type&gt;</tt>, </ins><tt>t</tt> is a value of type
  <tt>X::value_type</tt>, ...
! </p></blockquote>
  
  <p>
  In 23.2.5 [unord.req], Table 87 insert:
*************** In 23.2.5 [unord.req], Table 87 insert:
*** 57626,57636 ****
  <blockquote>
  <table border="1">
  <caption>Table 87 - Unordered associative container requirements (in addition to container)</caption>
! <tbody><tr>
! <th>Expression</th> <th>Return type</th> <th>Assertion/note<br>pre-/post-condition</th> <th>Complexity</th>
  </tr>
  <tr>
! <td><tt>X(i, j)<br>X a(i, j)</tt></td> <td><tt>X</tt></td> <td>...</td> <td>...</td>
  </tr>
  <tr>
  <td><ins><tt>X(il)</tt></ins></td> <td><ins><tt>X</tt></ins></td> 
--- 61814,61824 ----
  <blockquote>
  <table border="1">
  <caption>Table 87 - Unordered associative container requirements (in addition to container)</caption>
! <tr>
! <th>Expression</th> <th>Return type</th> <th>Assertion/note<br/>pre-/post-condition</th> <th>Complexity</th>
  </tr>
  <tr>
! <td><tt>X(i, j)<br/>X a(i, j)</tt></td> <td><tt>X</tt></td> <td>...</td> <td>...</td>
  </tr>
  <tr>
  <td><ins><tt>X(il)</tt></ins></td> <td><ins><tt>X</tt></ins></td> 
*************** In 23.2.5 [unord.req], Table 87 insert:
*** 57659,57665 ****
  <td><ins>Same as <tt>a.insert(il.begin(), il.end())</tt>.</ins></td> 
  <td><ins>Same as <tt>a.insert(il.begin(), il.end())</tt>.</ins></td>
  </tr>
! </tbody></table>
  </blockquote>
  
  
--- 61847,61853 ----
  <td><ins>Same as <tt>a.insert(il.begin(), il.end())</tt>.</ins></td> 
  <td><ins>Same as <tt>a.insert(il.begin(), il.end())</tt>.</ins></td>
  </tr>
! </table>
  </blockquote>
  
  
*************** In 23.2.5 [unord.req], Table 87 insert:
*** 57669,57679 ****
  
  <hr>
  <h3><a name="982"></a>982. Wrong complexity for initializer_list assignment in  Table 85</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-02-08 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to
--- 61857,61867 ----
  
  <hr>
  <h3><a name="982"></a>982. Wrong complexity for initializer_list assignment in  Table 85</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-02-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  According to
*************** In 23.2.4 [associative.reqmts], Table 85
*** 57706,57719 ****
  <blockquote>
  <table border="1">
  <caption>Table 85 - Associative container requirements (in addition to container)</caption>
! <tbody><tr>
! <th>Expression</th> <th>Return type</th> <th>Assertion/note<br>pre-/post-condition</th> <th>Complexity</th>
  </tr>
  <tr>
! <td><tt>a = il</tt></td> <td><tt>X&amp;</tt></td> <td><tt>a = X(il);<br>return *this;</tt></td> 
  <td><del>constant</del><ins>Same as <tt>a = X(il)</tt>.</ins></td>
  </tr>
! </tbody></table>
  </blockquote>
  
  
--- 61894,61907 ----
  <blockquote>
  <table border="1">
  <caption>Table 85 - Associative container requirements (in addition to container)</caption>
! <tr>
! <th>Expression</th> <th>Return type</th> <th>Assertion/note<br/>pre-/post-condition</th> <th>Complexity</th>
  </tr>
  <tr>
! <td><tt>a = il</tt></td> <td><tt>X&amp;</tt></td> <td><tt>a = X(il);<br/>return *this;</tt></td> 
  <td><del>constant</del><ins>Same as <tt>a = X(il)</tt>.</ins></td>
  </tr>
! </table>
  </blockquote>
  
  
*************** In 23.2.4 [associative.reqmts], Table 85
*** 57723,57732 ****
  
  <hr>
  <h3><a name="983"></a>983. <tt>unique_ptr</tt> reference deleters should not be moved from</h3>
! <p><b>Section:</b> 20.9.9.2 [unique.ptr.single] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-10 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.single">issues</a> in [unique.ptr.single].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Dave brought to my attention that when a <tt>unique_ptr</tt> has a non-const reference
--- 61911,61920 ----
  
  <hr>
  <h3><a name="983"></a>983. <tt>unique_ptr</tt> reference deleters should not be moved from</h3>
! <p><b>Section:</b> 20.8.1.2 [unique.ptr.single] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single">issues</a> in [unique.ptr.single].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Dave brought to my attention that when a <tt>unique_ptr</tt> has a non-const reference
*************** type deleter, move constructing from it,
*** 57734,57743 ****
  the reference is an rvalue, could have surprising results:
  </p>
  
! <blockquote><pre>D d(some-state);
  unique_ptr&lt;A, D&amp;&gt; p(new A, d);
  unique_ptr&lt;A, D&gt; p2 = std::move(p);
! <font color="#C80000">// has d's state changed here?</font>
  </pre></blockquote>
  
  <p>
--- 61922,61932 ----
  the reference is an rvalue, could have surprising results:
  </p>
  
! <blockquote><pre>
! D d(some-state);
  unique_ptr&lt;A, D&amp;&gt; p(new A, d);
  unique_ptr&lt;A, D&gt; p2 = std::move(p);
! <span style="#C80000">// has d's state changed here?</span>
  </pre></blockquote>
  
  <p>
*************** Thanks Dave.
*** 57754,57783 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Seems correct, but complicated enough that we recommend moving to Review.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  2010-03-14 Howard adds:
  ]</i></p>
  
  
! <blockquote>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </blockquote>
  
  
  
--- 61943,61972 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Seems correct, but complicated enough that we recommend moving to Review.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  2010-03-14 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </p></blockquote>
  
  
  
*************** Solved by <a href="http://www.open-std.o
*** 57789,57799 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor], p20-21
  </p>
  
  <blockquote>
! <pre>template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
--- 61978,61989 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor], p20-21
  </p>
  
  <blockquote>
! <pre>
! template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
*************** a reference type, then <tt>E</tt> shall
*** 57812,57818 ****
  (diagnostic required). <tt>unique_ptr&lt;U, E&gt;::pointer</tt> shall be
  implicitly convertible to <tt>pointer</tt>. [<tt>Note:</tt> These
  requirements imply that <tt>T</tt> and <tt>U</tt> are complete types.
! <i>-- end note</i>]
  </p>
  
  <p>
--- 62002,62008 ----
  (diagnostic required). <tt>unique_ptr&lt;U, E&gt;::pointer</tt> shall be
  implicitly convertible to <tt>pointer</tt>. [<tt>Note:</tt> These
  requirements imply that <tt>T</tt> and <tt>U</tt> are complete types.
! &mdash; <i>end note</i>]
  </p>
  
  <p>
*************** deleter</ins> is move constructed from <
*** 57823,57829 ****
  <del>the reference</del> <ins>this deleter</ins> is copy constructed
  from <tt>u</tt>.'s deleter. After the construction, <tt>u</tt> no longer
  owns a pointer. [<i>Note:</i> The deleter constructor can be implemented
! with <tt>std::forward&lt;<del>D</del><ins>E</ins>&gt;</tt>. <i>-- end
  note</i>]
  </p>
  
--- 62013,62019 ----
  <del>the reference</del> <ins>this deleter</ins> is copy constructed
  from <tt>u</tt>.'s deleter. After the construction, <tt>u</tt> no longer
  owns a pointer. [<i>Note:</i> The deleter constructor can be implemented
! with <tt>std::forward&lt;<del>D</del><ins>E</ins>&gt;</tt>. &mdash; <i>end
  note</i>]
  </p>
  
*************** note</i>]
*** 57831,57841 ****
  </blockquote>
  
  <p>
! Change 20.9.9.2.3 [unique.ptr.single.asgn], p1-3
  </p>
  
  <blockquote>
! <pre>unique_ptr&amp; operator=(unique_ptr&amp;&amp; u);
  </pre>
  <blockquote>
  
--- 62021,62032 ----
  </blockquote>
  
  <p>
! Change 20.8.1.2.3 [unique.ptr.single.asgn], p1-3
  </p>
  
  <blockquote>
! <pre>
! unique_ptr&amp; operator=(unique_ptr&amp;&amp; u);
  </pre>
  <blockquote>
  
*************** a<ins>n</ins> <del>move</del> assignment
*** 57857,57873 ****
  -3- <i>Postconditions:</i> This <tt>unique_ptr</tt> now owns the pointer
  which <tt>u</tt> owned, and <tt>u</tt> no longer owns it. <del>[<i>Note:</i> If
  <tt>D</tt> is a reference type, then the referenced lvalue deleters are
! move assigned. <i>-- end note</i>]</del>
  </p>
  </blockquote>
  </blockquote>
  
  <p>
! Change 20.9.9.2.3 [unique.ptr.single.asgn], p6-7
  </p>
  
  <blockquote>
! <pre>template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  <blockquote>
  
--- 62048,62065 ----
  -3- <i>Postconditions:</i> This <tt>unique_ptr</tt> now owns the pointer
  which <tt>u</tt> owned, and <tt>u</tt> no longer owns it. <del>[<i>Note:</i> If
  <tt>D</tt> is a reference type, then the referenced lvalue deleters are
! move assigned. &mdash; <i>end note</i>]</del>
  </p>
  </blockquote>
  </blockquote>
  
  <p>
! Change 20.8.1.2.3 [unique.ptr.single.asgn], p6-7
  </p>
  
  <blockquote>
! <pre>
! template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u);
  </pre>
  <blockquote>
  
*************** Change 20.9.9.2.3 [unique.ptr.single.asg
*** 57879,57886 ****
  Otherwise the deleter <tt>E</tt> is a reference type,
  and assignment of the deleter <tt>D</tt> from an lvalue <tt>E</tt> shall not throw an exception.</ins>
  <tt>unique_ptr&lt;U, E&gt;::pointer</tt> shall be implicitly convertible to <tt>pointer</tt>.
! [<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U&gt;</tt>
! are complete types. <i>-- end note</i>]
  </p>
  
  <p>
--- 62071,62078 ----
  Otherwise the deleter <tt>E</tt> is a reference type,
  and assignment of the deleter <tt>D</tt> from an lvalue <tt>E</tt> shall not throw an exception.</ins>
  <tt>unique_ptr&lt;U, E&gt;::pointer</tt> shall be implicitly convertible to <tt>pointer</tt>.
! [<i>Note:</i> These requirements imply that <tt>T</tt> and <tt>U></tt>
! are complete types. &mdash; <i>end note</i>]
  </p>
  
  <p>
*************** deleter participates in the move assignm
*** 57902,57933 ****
  
  <hr>
  <h3><a name="984"></a>984. Does <tt>&lt;cinttypes&gt;</tt> have macro guards?</h3>
! <p><b>Section:</b> 27.9.2 [c.files] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-12 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The C standard says about <tt>&lt;inttypes.h&gt;</tt>:
  </p>
  
! <blockquote>
  C++ implementations should define these macros only when <tt>__STDC_FORMAT_MACROS</tt>is defined 
  before <tt>&lt;inttypes.h&gt;</tt> is included.
! </blockquote>
  
  <p>
  The C standard has a similar note about <tt>&lt;stdint.h&gt;</tt>.  For <tt>&lt;cstdint&gt;</tt>
! we adopted a "thanks but no thanks" policy and documented that fact in
! 18.4.1 [cstdint.syn]:
  </p>
  
! <blockquote>
  ... [<i>Note:</i> The macros defined by <tt>&lt;stdint&gt;</tt> are
  provided unconditionally. In particular, the symbols
  <tt>__STDC_LIMIT_MACROS</tt> and <tt>__STDC_CONSTANT_MACROS</tt>
  (mentioned in C99 footnotes 219, 220, and 222) play no role in C++.
! <i>-- end note</i>]
! </blockquote>
  
  <p>
  I recommend we put a similar note in 27.9.2 [c.files] regarding <tt>&lt;cinttypes&gt;</tt>.
--- 62094,62125 ----
  
  <hr>
  <h3><a name="984"></a>984. Does <tt>&lt;cinttypes&gt;</tt> have macro guards?</h3>
! <p><b>Section:</b> 27.9.2 [c.files] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.files">issues</a> in [c.files].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The C standard says about <tt>&lt;inttypes.h&gt;</tt>:
  </p>
  
! <blockquote><p>
  C++ implementations should define these macros only when <tt>__STDC_FORMAT_MACROS</tt>is defined 
  before <tt>&lt;inttypes.h&gt;</tt> is included.
! </p></blockquote>
  
  <p>
  The C standard has a similar note about <tt>&lt;stdint.h&gt;</tt>.  For <tt>&lt;cstdint&gt;</tt>
! we adopted a "thanks but no thanks" policy and documented that fact in 18.4.1 [cstdint.syn]:
  </p>
  
! <blockquote><p>
  ... [<i>Note:</i> The macros defined by <tt>&lt;stdint&gt;</tt> are
  provided unconditionally. In particular, the symbols
  <tt>__STDC_LIMIT_MACROS</tt> and <tt>__STDC_CONSTANT_MACROS</tt>
  (mentioned in C99 footnotes 219, 220, and 222) play no role in C++.
! &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  I recommend we put a similar note in 27.9.2 [c.files] regarding <tt>&lt;cinttypes&gt;</tt>.
*************** I recommend we put a similar note in 27.
*** 57937,57946 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 62129,62138 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Tentatively Ready.
*** 57948,57973 ****
  Add to 27.9.2 [c.files]:
  </p>
  
! <blockquote>
  Table 112 describes header <tt>&lt;cinttypes&gt;</tt>.
  <ins>
  [<i>Note:</i> The macros defined by <tt>&lt;cintypes&gt;</tt> are
  provided unconditionally. In particular, the symbol
  <tt>__STDC_FORMAT_MACROS</tt>
  (mentioned in C99 footnote 182) plays no role in C++.
! <i>-- end note</i>]
  </ins>
  </blockquote>
  
  
  
  
  
  <hr>
  <h3><a name="986"></a>986. Generic <tt>try_lock</tt> contradiction</h3>
! <p><b>Section:</b> 30.4.3 [thread.lock.algorithm] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Chris Fairles <b>Opened:</b> 2009-02-14 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 30.4.3 [thread.lock.algorithm], the generic <tt>try_lock</tt> effects (p2) say that a failed
--- 62140,62491 ----
  Add to 27.9.2 [c.files]:
  </p>
  
! <blockquote><p>
  Table 112 describes header <tt>&lt;cinttypes&gt;</tt>.
  <ins>
  [<i>Note:</i> The macros defined by <tt>&lt;cintypes&gt;</tt> are
  provided unconditionally. In particular, the symbol
  <tt>__STDC_FORMAT_MACROS</tt>
  (mentioned in C99 footnote 182) plays no role in C++.
! &mdash; <i>end note</i>]
  </ins>
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="985"></a>985. Allowing throwing move</h3>
+ <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Rani Sharoni <b>Opened:</b> 2009-02-12 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ <b>Introduction</b>
+ </p>
+ 
+ <p>This proposal is meant to resolve potential regression of the
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2800.pdf">N2800</a>
+ draft, see
+ next section, and to relax the requirements for containers of types with
+ throwing move constructors.</p>
+ 
+ <p>The basic problem is that some containers operations, like <tt>push_back</tt>,
+ have a strong exception safety
+ guarantee (i.e. no side effects upon exception) that are not achievable when
+ throwing move constructors are used since there is no way to guarantee revert
+ after partial move. For such operations the implementation can at most provide
+ the basic guarantee (i.e. valid but unpredictable) as it does with multi
+ copying operations (e.g. range insert).</p>
+ 
+ <p>For example, <tt>vector&lt;T&gt;::push_back()</tt> (where <tt>T</tt> has a move
+ constructor) might resize the <tt>vector</tt> and move the objects to the new underlying
+ buffer. If move constructor throws it might
+ not be possible to recover the throwing object or to move the old objects back to
+ the original buffer.</p>
+ 
+ <p>The current draft is explicit by disallowing throwing move
+ for some operations (e.g. <tt>vector&lt;&gt;::reserve</tt>) and not clear about other
+ operations mentioned in 23.2.1 [container.requirements.general]/10
+ (e.g. single element <tt>insert</tt>): it guarantees strong exception
+ safety without explicitly disallowing a throwing move constructor.
+ </p>
+ 
+ <p>
+ <b>Regression</b>
+ </p>
+ 
+ <p>This section only refers to cases in which the contained object
+ is by itself a standard container.</p>
+ 
+ <p>Move constructors of standard containers are allowed to throw and therefore
+ existing operations are broken, compared with C++03, due to move optimization.
+ (In fact existing implementations like Dinkumware are actually throwing).</p>
+ 
+ <p>For example, <tt>vector&lt; list&lt;int&gt; &gt;::reserve</tt> yields
+ undefined behavior since <tt>list&lt;int&gt;</tt>'s move constructor is allowed to throw.
+ On the other hand, the same operation has strong exception safety guarantee in
+ C++03.</p>
+ 
+ <p>There are few options to solve this regression:</p>
+ 
+ <ol>
+ <li>
+ Disallow throwing move and throwing default constructor
+ </li>
+ 
+ <li>
+ Disallow throwing move but disallowing usage after move
+ </li>
+ 
+ <li>
+ Special casing
+ </li>
+ 
+ <li>
+ Disallow throwing move and making it optional
+ </li>
+ 
+ </ol>
+ 
+ <p>Option 1 is suggested by proposal
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2815.html">N2815</a>
+ but it might not be applicable for existing implementations for which
+ containers default constructors are throwing.</p>
+ 
+ <p>Option 2 limits the usage significantly and it's error prone
+ by allowing zombie objects that are nothing but destructible (e.g. no <tt>clear()</tt>
+ is allowed after move). It also potentially complicates the implementation by
+ introducing special state.</p>
+ 
+ <p>Option 3 is possible, for example, using default
+ construction and <tt>swap</tt> instead of move for standard containers case. The
+ implementation is also free to provide special hidden operation for non
+ throwing move without forcing the user the cope with the limitation of option-2
+ when using the public move.</p>
+ 
+ <p>Option 4 impact the efficiency in all use cases due to rare throwing move.</p>
+ 
+ <p>The proposed wording will imply option 1 or 3 though option 2 is also
+ achievable using more wording. I personally oppose to option 2 that has impact
+ on usability.</p>
+ 
+ <p>
+ <b>Relaxation for user types</b>
+ </p>
+ 
+ <p>Disallowing throwing move constructors in general seems very restrictive
+ since, for example, common implementation of move will be default construction
+ + <tt>swap</tt> so move will throw if the
+ default constructor will throw. This is currently the case with the Dinkumware
+ implementation of node based containers (e.g. <tt>std::list</tt>)
+ though this section doesn't refer to standard types.</p>
+ 
+ <p>For throwing move constructors it seem that the implementation should have
+ no problems to provide the basic guarantee instead of the strong one. It's
+ better to allow throwing move constructors with basic guarantee than to
+ disallow it silently (compile and run), via undefined behavior.</p>
+ 
+ <p>There might still be cases in which the relaxation will break existing generic
+ code that assumes the strong guarantee but it's broken either way given a
+ throwing move constructor since this is not a preserving optimization. </p>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote>
+ <p>
+ Bjarne comments (referring to his draft paper):
+ "I believe that my suggestion simply solves that. Thus, we don't need a throwing move."
+ </p>
+ <p>
+ Move to Open and recommend it be deferred until after the next
+ Committee Draft is issued.
+ </p>
  </blockquote>
  
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Should wait to get direction from Dave/Rani
+ (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2983.html">N2983</a>).
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010-03-28 Daniel updated wording to sync with N3092.
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ The suggested change of 23.3.3.4 [deque.modifiers]/2 should be removed,
+ because the current wording does say more general things:
+ </p>
+ 
+ <blockquote><p>
+ 2 <i>Remarks:</i> If an exception is thrown other than by the copy constructor,
+ move constructor, assignment operator, or move assignment operator of <tt>T</tt>
+ there are no effects. If an exception is thrown by the move constructor of a
+ non-CopyConstructible <tt>T</tt>, the effects are unspecified.
+ </p></blockquote>
+ 
+ <p>
+ The suggested change of 23.3.6.3 [vector.capacity]/2 should be removed,
+ because the current wording does say more general things:
+ </p>
+ 
+ <blockquote><p>
+ 2 <i>Effects:</i> A directive that informs a <tt>vector</tt> of a planned change
+ in size, so that it can manage the storage allocation accordingly. After
+ <tt>reserve()</tt>, <tt>capacity()</tt> is greater or equal to the argument of
+ <tt>reserve</tt> if reallocation happens; and equal to the previous value of
+ <tt>capacity()</tt> otherwise. Reallocation happens at this point if and only if
+ the current capacity is less than the argument of <tt>reserve()</tt>. If an
+ exception is thrown other than by the move constructor of a
+ non-<tt>CopyConstructible</tt> type, there are no effects.
+ </p></blockquote>
+ 
+ </blockquote>
+ 
+ <p><i>[2011-03-15: Daniel updates wording to sync with N3242 and comments]</i></p>
+ 
+ 
+ <blockquote><p>
+ The issue has nearly been resolved by previous changes to the working paper, in 
+ particular all suggested changes for <tt>deque</tt> and <tt>vector</tt> are no 
+ longer necessary. The still remaining parts involve the unordered associative containers.
+ </p></blockquote>
+ 
+ <p><i>[2011-03-24 Madrid meeting]</i></p>
+ 
+ 
+ <p>It looks like this issue has been resolved already by <tt>noexcept</tt> paper N3050</p>
+ 
+ 
+ <p><b>Rationale:</b></p><p>
+ Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3050.html">N3050</a>
+ </p>
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <p>
+ 23.2.1 [container.requirements.general] paragraph 10 add footnote:
+ </p>
+ 
+ <blockquote>
+ <p>
+ -10- Unless otherwise specified (see 23.2.4.1 [associative.reqmts.except], 23.2.5.1 [unord.req.except], 
+ 23.3.3.4 [deque.modifiers], and 23.3.6.5 [vector.modifiers]) all container types defined in this 
+ Clause meet the following additional requirements:
+ </p>
+ <ul>
+ <li>&hellip;</li>
+ </ul>
+ 
+ <p>
+ <ins>[<i>Note</i>: for compatibility with C++ 2003, when "no effect" is required, standard containers should not use the
+ <tt>value_type</tt>'s throwing move constructor when the contained object is by itself a standard container. &mdash; <i>end note</i>]</ins>
+ </p>
+ 
+ </blockquote>
+ 
+ <p>23.2.5.1 [unord.req.except] change paragraph 2+4 to say: </p>
+ 
+ <blockquote>
+ <p>
+ -2- For unordered associative containers, if an exception is
+ thrown by any operation other than the container's hash function from within an
+ <tt>insert()</tt> function inserting a single element, the <tt>insert()</tt>
+ function has no effect<ins> unless the exception is thrown by the contained
+ object move constructor</ins>.
+ <p/>
+ [&hellip;]
+ <p/>
+ -4- For unordered associative containers, if an exception is
+ thrown from within a <tt>rehash()</tt> function other than by the container's hash
+ function or comparison function, the <tt>rehash()</tt> function has no effect
+ <ins>unless the exception is thrown by the contained
+ object move constructor</ins>.</p>
+ 
+ </blockquote>
+ 
+ <p>
+ Keep 23.3.3.4 [deque.modifiers] paragraph 2 unchanged <em>[Drafting note: The originally
+ proposed wording did suggest to add a last sentence as follows:</em>
+ </p>
+ <blockquote><p>
+ <em><ins>If an exception is thrown by <tt>push_back()</tt> or <tt>emplace_back()</tt>
+ function, that function has no effects unless the exception is thrown by
+ the move constructor of <tt>T</tt>.</ins></em> 
+ </p></blockquote>
+ <p> &mdash; <em> end drafting note ]</em></p>
+ 
+ <blockquote><p>
+ -2- <i>Remarks:</i> If an exception is thrown other than by
+ the copy constructor, move constructor, assignment operator, 
+ or move assignment operator of <tt>T</tt> there are no effects.
+ If an exception is thrown by the move constructor of a non-CopyInsertable 
+ <tt>T</tt>, the effects are unspecified.
+ </p></blockquote>
+ 
+ <p>
+ Keep 23.3.6.3 [vector.capacity] paragraph 2 unchanged <em>[Drafting note: The originally
+ proposed wording did suggest to change the last sentence as follows:</em>
+ </p>
+ <blockquote><p>
+ <em>If an exception is thrown, there are no effects<ins> unless the exception is thrown by the 
+ contained object move constructor</ins>.</em> 
+ </p></blockquote>
+ <p> &mdash; <em> end drafting note ]</em></p>
+ 
+ <blockquote><p>
+ -2- <i>Effects:</i> A directive that informs a <tt>vector</tt>
+ of a planned change in size, so
+ that it can manage the storage allocation accordingly. After <tt>reserve()</tt>,
+ <tt>capacity()</tt> is greater or equal to the argument of <tt>reserve</tt>
+ if reallocation happens; and equal
+ to the previous value of <tt>capacity()</tt>
+ otherwise. Reallocation happens at this point if and only if the current
+ capacity is less than the argument of <tt>reserve()</tt>.
+ If an exception is thrown other than by the move constructor of a 
+ non-<tt>CopyInsertable</tt> type, there are no effects.
+ </p></blockquote>
+ 
+ <p>
+ Keep 23.3.6.3 [vector.capacity] paragraph 12 unchanged <em>[Drafting note: The originally
+ proposed wording did suggest to change the old paragraph as follows:</em>
+ </p>
+ <blockquote><p>
+ <em>-12- <i>Requires:</i> <del>If <tt>value_type</tt> has a move constructor,
+ that constructor shall not throw any exceptions.</del>
+ <ins>If an exception is thrown, there are no effects unless the exception is thrown by
+ the contained object move constructor.</ins></em>
+ </p></blockquote>
+ <p> &mdash; <em> end drafting note ]</em></p>
+ 
+ <blockquote><p>
+ -12- <i>Requires:</i> If an exception is thrown other than by the move constructor of a non-<tt>CopyInsertable</tt> 
+ <tt>T</tt> there are no effects.
+ </p></blockquote>
+ 
+ <p>
+ Keep 23.3.6.5 [vector.modifiers] paragraph 1 unchanged <em>[Drafting note: The originally
+ proposed wording did suggest to change the old paragraph as follows:</em>
+ </p>
+ <blockquote><p>
+ <em>-1- <del><i>Requires:</i> If <tt>value_type</tt> has a move constructor,
+ that constructor shall not throw any exceptions.</del>
+ <ins><i>Remarks:</i> If an exception is thrown by <tt>push_back()</tt>
+ or <tt>emplace_back()</tt> function, that function has no effect unless the
+ exception is thrown by the move constructor of <tt>T</tt>.</ins></em>
+ </p></blockquote>
+ <p> &mdash; <em> end drafting note ]</em></p>
+ 
+ <blockquote><p>
+ -1- <i>Remarks</i>: Causes reallocation if the new size is greater than the old capacity. If no reallocation happens,
+ all the iterators and references before the insertion point remain valid. If an exception is thrown other
+ than by the copy constructor, move constructor, assignment operator, or move assignment operator
+ of <tt>T</tt> or by any <tt>InputIterator</tt> operation there are no effects. If an exception is thrown by the move
+ constructor of a non-<tt>CopyInsertable</tt> <tt>T</tt>, the effects are unspecified.
+ </p></blockquote>
+ 
+ 
  
  
  
  
  <hr>
  <h3><a name="986"></a>986. Generic <tt>try_lock</tt> contradiction</h3>
! <p><b>Section:</b> 30.4.3 [thread.lock.algorithm] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Chris Fairles <b>Opened:</b> 2009-02-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 30.4.3 [thread.lock.algorithm], the generic <tt>try_lock</tt> effects (p2) say that a failed
*************** will be. So what happens if multiple loc
*** 57983,57989 ****
  Example:
  </p>
  
! <blockquote><pre>#include &lt;mutex&gt;
  
  int main() {
   std::mutex m0, m1, m2;
--- 62501,62508 ----
  Example:
  </p>
  
! <blockquote><pre>
! #include &lt;mutex&gt;
  
  int main() {
   std::mutex m0, m1, m2;
*************** Further discussion and possible resoluti
*** 58018,58035 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  Move to review. Agree with proposed resolution.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 62537,62554 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  Move to review. Agree with proposed resolution.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Tentatively Ready.
*** 58038,58062 ****
  Change 30.4.3 [thread.lock.algorithm], p2:
  </p>
  
! <blockquote>
  -2- <i>Effects:</i> Calls <tt>try_lock()</tt> for each argument in order
  beginning with the first until all arguments have been processed or a
  call to <tt>try_lock()</tt> fails, either by returning <tt>false</tt> or by throwing an
  exception. If a call to <tt>try_lock()</tt> fails, <tt>unlock()</tt> shall be called for
  all prior arguments<ins> and there shall be no further calls to <tt>try_lock()</tt></ins>.
! </blockquote>
  
  <p>
  Delete the note from 30.4.3 [thread.lock.algorithm], p3
  </p>
  
! <blockquote>
  -3- <i>Returns:</i> -1 if all calls to <tt>try_lock()</tt> returned <tt>true</tt>,
  otherwise a 0-based index value that indicates 
  the argument for which <tt>try_lock()</tt> returned <tt>false</tt>. <del>[<i>Note:</i>
  On return, either all arguments will be 
  locked or none will be locked. -- <i>end note</i>]</del>
! </blockquote>
  
  
  
--- 62557,62581 ----
  Change 30.4.3 [thread.lock.algorithm], p2:
  </p>
  
! <blockquote><p>
  -2- <i>Effects:</i> Calls <tt>try_lock()</tt> for each argument in order
  beginning with the first until all arguments have been processed or a
  call to <tt>try_lock()</tt> fails, either by returning <tt>false</tt> or by throwing an
  exception. If a call to <tt>try_lock()</tt> fails, <tt>unlock()</tt> shall be called for
  all prior arguments<ins> and there shall be no further calls to <tt>try_lock()</tt></ins>.
! </p></blockquote>
  
  <p>
  Delete the note from 30.4.3 [thread.lock.algorithm], p3
  </p>
  
! <blockquote><p>
  -3- <i>Returns:</i> -1 if all calls to <tt>try_lock()</tt> returned <tt>true</tt>,
  otherwise a 0-based index value that indicates 
  the argument for which <tt>try_lock()</tt> returned <tt>false</tt>. <del>[<i>Note:</i>
  On return, either all arguments will be 
  locked or none will be locked. -- <i>end note</i>]</del>
! </p></blockquote>
  
  
  
*************** locked or none will be locked. -- <i>end
*** 58064,58079 ****
  
  <hr>
  <h3><a name="987"></a>987. <tt>reference_wrapper</tt> and function types</h3>
! <p><b>Section:</b> 20.8.4 [refwrap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-18 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#refwrap">issues</a> in [refwrap].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The synopsis in 20.8.4 [refwrap] says:
  </p>
  
! <blockquote><pre>template &lt;<b>ObjectType</b> T&gt; class reference_wrapper
  ...
  </pre></blockquote>
  
--- 62583,62599 ----
  
  <hr>
  <h3><a name="987"></a>987. <tt>reference_wrapper</tt> and function types</h3>
! <p><b>Section:</b> 20.9.4 [refwrap] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-02-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#refwrap">issues</a> in [refwrap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The synopsis in 20.9.4 [refwrap] says:
  </p>
  
! <blockquote><pre>
! template &lt;<b>ObjectType</b> T&gt; class reference_wrapper
  ...
  </pre></blockquote>
  
*************** where <tt>F</tt> is a function type, rep
*** 58131,58137 ****
  a legitimate entity. So <tt>boost::ref</tt> was changed to allow it.
  </p>
  <p>
! <a href="https://svn.boost.org/trac/boost/browser/trunk/libs/bind/test/ref_fn_test.cpp">https://svn.boost.org/trac/boost/browser/trunk/libs/bind/test/ref_fn_test.cpp</a>
  </p>
  <p>
  Therefore, I believe an alternative proposed resolution for issue 987 could simply
--- 62651,62657 ----
  a legitimate entity. So <tt>boost::ref</tt> was changed to allow it.
  </p>
  <p>
! <a href="http://svn.boost.org/svn/boost/trunk/libs/bind/test/ref_fn_test.cpp">http://svn.boost.org/svn/boost/trunk/libs/bind/test/ref_fn_test.cpp</a>
  </p>
  <p>
  Therefore, I believe an alternative proposed resolution for issue 987 could simply
*************** is code that demonstrates how easy (and
*** 58151,58157 ****
  <tt>reference_wrapper</tt> with a function type:
  </p>
  
! <blockquote><pre>#include &lt;functional&gt;
  
  template &lt;class F&gt;
  void test(F f);
--- 62671,62678 ----
  <tt>reference_wrapper</tt> with a function type:
  </p>
  
! <blockquote><pre>
! #include &lt;functional&gt;
  
  template &lt;class F&gt;
  void test(F f);
*************** Output (link time error shows type of <t
*** 58169,58175 ****
  with function type):
  </p>
  
! <blockquote><pre>Undefined symbols:
    "void test&lt;std::reference_wrapper&lt;void ()()&gt; &gt;(std::reference_wrapper&lt;void ()()&gt;)",...
  </pre></blockquote>
  
--- 62690,62697 ----
  with function type):
  </p>
  
! <blockquote><pre>
! Undefined symbols:
    "void test&lt;std::reference_wrapper&lt;void ()()&gt; &gt;(std::reference_wrapper&lt;void ()()&gt;)",...
  </pre></blockquote>
  
*************** implied reference collapsing the intende
*** 58221,58230 ****
  ]</i></p>
  
  
! <blockquote>
  Moved from Review to Open only because the wording needs to be
  tweaked for concepts removal.
! </blockquote>
  
  <p><i>[
  2009-10-14 Daniel provided de-conceptified wording.
--- 62743,62752 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Review to Open only because the wording needs to be
  tweaked for concepts removal.
! </p></blockquote>
  
  <p><i>[
  2009-10-14 Daniel provided de-conceptified wording.
*************** tweaked for concepts removal.
*** 58236,58257 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Tentatively Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.4 [refwrap]/1 as indicated:
  </p>
  
! <blockquote>
  <tt>reference_wrapper&lt;T&gt;</tt> is a <tt>CopyConstructible</tt> and
  <tt><ins>Copy</ins>Assignable</tt> wrapper around a
  reference to an object <ins>or function</ins> of type <tt>T</tt>.
! </blockquote>
  
  
  
--- 62758,62779 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.4 [refwrap]/1 as indicated:
  </p>
  
! <blockquote><p>
  <tt>reference_wrapper&lt;T&gt;</tt> is a <tt>CopyConstructible</tt> and
  <tt><ins>Copy</ins>Assignable</tt> wrapper around a
  reference to an object <ins>or function</ins> of type <tt>T</tt>.
! </p></blockquote>
  
  
  
*************** reference to an object <ins>or function<
*** 58262,58271 ****
  
  <hr>
  <h3><a name="990"></a>990. <tt>monotonic_clock::is_monotonic</tt> must be <tt>true</tt></h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is some confusion over what the value of <tt>monotonic_clock::is_monotonic</tt>
--- 62784,62793 ----
  
  <hr>
  <h3><a name="990"></a>990. <tt>monotonic_clock::is_monotonic</tt> must be <tt>true</tt></h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There is some confusion over what the value of <tt>monotonic_clock::is_monotonic</tt>
*************** Move to Tentatively Ready.
*** 58293,58317 ****
  Change X [time.clock.monotonic], p1:
  </p>
  
! <blockquote>
  -1- Objects of class <tt>monotonic_clock</tt> represent clocks for which
  values of <tt>time_point</tt> never decrease as physical time advances.
  <tt>monotonic_clock</tt> may be a synonym for <tt>system_clock</tt>
  <ins>if and only if <tt>system_clock::is_monotonic</tt> is
  <tt>true</tt></ins>.
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="991"></a>991. Response to JP 50</h3>
! <p><b>Section:</b> 22.3.3.2.2 [conversions.string] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Add custom allocator parameter to <tt>wstring_convert</tt>, since we cannot
  allocate memory for strings from a custom allocator.
--- 62815,62841 ----
  Change X [time.clock.monotonic], p1:
  </p>
  
! <blockquote><p>
  -1- Objects of class <tt>monotonic_clock</tt> represent clocks for which
  values of <tt>time_point</tt> never decrease as physical time advances.
  <tt>monotonic_clock</tt> may be a synonym for <tt>system_clock</tt>
  <ins>if and only if <tt>system_clock::is_monotonic</tt> is
  <tt>true</tt></ins>.
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="991"></a>991. Provide allocator for <tt>wstring_convert</tt></h3>
! <p><b>Section:</b> 22.3.3.2.2 [conversions.string] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#conversions.string">active issues</a> in [conversions.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
+ <p><b>Addresses JP-50 [CD1]</b></p>
  <p>
  Add custom allocator parameter to <tt>wstring_convert</tt>, since we cannot
  allocate memory for strings from a custom allocator.
*************** allocate memory for strings from a custo
*** 58321,58330 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 62845,62854 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Tentatively Ready.
*** 58332,58338 ****
  Change 22.3.3.2.2 [conversions.string]:
  </p>
  
! <blockquote><pre>template&lt;class Codecvt, class Elem = wchar_t<ins>,
           class Wide_alloc = std::allocator&lt;Elem&gt;,
           class Byte_alloc = std::allocator&lt;char&gt; </ins>&gt; class wstring_convert {
    public:
--- 62856,62863 ----
  Change 22.3.3.2.2 [conversions.string]:
  </p>
  
! <blockquote><pre>
! template&lt;class Codecvt, class Elem = wchar_t<ins>,
           class Wide_alloc = std::allocator&lt;Elem&gt;,
           class Byte_alloc = std::allocator&lt;char&gt; </ins>&gt; class wstring_convert {
    public:
*************** Change 22.3.3.2.2 [conversions.string]:
*** 58345,58358 ****
  Change 22.3.3.2.2 [conversions.string], p3:
  </p>
  
! <blockquote>
  -3- The class template describes an ob ject that controls conversions
  between wide string ob jects of class
  <tt>std::basic_string&lt;Elem<ins>, char_traits&lt;Elem&gt;, Wide_alloc</ins>&gt;</tt>
  and byte string objects of class
  <tt>std::basic_string&lt;char<ins>, char_traits&lt;char&gt;, Byte_alloc</ins>&gt;</tt>
  <del>(also known as <tt>std::string</tt>)</del>.
! </blockquote>
  
  
  
--- 62870,62883 ----
  Change 22.3.3.2.2 [conversions.string], p3:
  </p>
  
! <blockquote><p>
  -3- The class template describes an ob ject that controls conversions
  between wide string ob jects of class
  <tt>std::basic_string&lt;Elem<ins>, char_traits&lt;Elem&gt;, Wide_alloc</ins>&gt;</tt>
  and byte string objects of class
  <tt>std::basic_string&lt;char<ins>, char_traits&lt;char&gt;, Byte_alloc</ins>&gt;</tt>
  <del>(also known as <tt>std::string</tt>)</del>.
! </p></blockquote>
  
  
  
*************** and byte string objects of class
*** 58360,58371 ****
  
  
  <hr>
! <h3><a name="993"></a>993. Response to UK 188</h3>
! <p><b>Section:</b> 18.5 [support.start.term] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.start.term">issues</a> in [support.start.term].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The function <tt>_Exit</tt> does not appear to be defined in this standard.
  Should it be added to the table of functions included-by-reference to
--- 62885,62897 ----
  
  
  <hr>
! <h3><a name="993"></a>993. <tt>_Exit</tt> needs better specification</h3>
! <p><b>Section:</b> 18.5 [support.start.term] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.start.term">issues</a> in [support.start.term].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
+ <p><b>Addresses UK-188 [CD1]</b></p>
  <p>
  The function <tt>_Exit</tt> does not appear to be defined in this standard.
  Should it be added to the table of functions included-by-reference to
*************** the C standard?
*** 58381,58390 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 62907,62916 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Add to 18.5 [support.start.term] Table 2
*** 58393,58406 ****
  <tt>&lt;cstdlib&gt;</tt> synopsis) Functions:
  </p>
  
! <blockquote><pre>_Exit
  </pre></blockquote>
  
  <p>
  Add before the description of <tt>abort(void)</tt>:
  </p>
  
! <blockquote><pre>void _Exit [[noreturn]] (int status)
  </pre>
  
  <blockquote>
--- 62919,62934 ----
  <tt>&lt;cstdlib&gt;</tt> synopsis) Functions:
  </p>
  
! <blockquote><pre>
! _Exit
  </pre></blockquote>
  
  <p>
  Add before the description of <tt>abort(void)</tt>:
  </p>
  
! <blockquote><pre>
! void _Exit [[noreturn]] (int status)
  </pre>
  
  <blockquote>
*************** functions passed to <tt>atexit()</tt> (3
*** 58424,58447 ****
  
  
  <hr>
! <h3><a name="994"></a>994. Response to UK 193</h3>
! <p><b>Section:</b> 18.6.2.3 [new.handler] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>quick_exit</tt> has been added as a new valid way to terminate a program in a
! well defined way
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 62952,62976 ----
  
  
  <hr>
! <h3><a name="994"></a>994. <tt>quick_exit</tt> should terminate well-defined</h3>
! <p><b>Section:</b> 18.6.2.3 [new.handler] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
+ <p><b>Addresses UK-193 [CD1]</b></p>
  <p>
  <tt>quick_exit</tt> has been added as a new valid way to terminate a program in a
! well defined way.
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Change 18.6.2.3 [new.handler], p2:
*** 58469,58480 ****
  
  
  <hr>
! <h3><a name="997"></a>997. Response to UK 163</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Many functions are defined as "Effects: Equivalent to a...", which seems
  to also define the preconditions, effects, etc. But this is not made
--- 62998,63010 ----
  
  
  <hr>
! <h3><a name="997"></a>997. "<i>Effects</i>: Equivalent to" is underspecified</h3>
! <p><b>Section:</b> 17.5.1.4 [structure.specifications] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Thomas Plum <b>Opened:</b> 2009-03-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#structure.specifications">issues</a> in [structure.specifications].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
+ <p><b>Addresses UK-163 [CD1]</b></p>
  <p>
  Many functions are defined as "Effects: Equivalent to a...", which seems
  to also define the preconditions, effects, etc. But this is not made
*************** result in much less editorial re-work.
*** 58509,58526 ****
  ]</i></p>
  
  
! <blockquote>
! This issue is related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#492">492</a>.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 63039,63056 ----
  ]</i></p>
  
  
! <blockquote><p>
! This issue is related to <a href="lwg-closed.html#492">492</a>.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** supersedes any occurrences of that eleme
*** 58590,58606 ****
  
  <hr>
  <h3><a name="998"></a>998. Smart pointer referencing its owner</h3>
! <p><b>Section:</b> 20.9.9.2.5 [unique.ptr.single.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pavel Minaev <b>Opened:</b> 2009-02-26 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.single.modifiers">issues</a> in [unique.ptr.single.modifiers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider the following (simplified) implementation of 
  <tt>std::auto_ptr&lt;T&gt;::reset()</tt>: 
  </p>
  
! <blockquote><pre>void reset(T* newptr = 0) { 
     if (this-&gt;ptr &amp;&amp; this-&gt;ptr != newptr) { 
       delete this-&gt;ptr; 
     } 
--- 63120,63137 ----
  
  <hr>
  <h3><a name="998"></a>998. Smart pointer referencing its owner</h3>
! <p><b>Section:</b> 20.8.1.2.5 [unique.ptr.single.modifiers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pavel Minaev <b>Opened:</b> 2009-02-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.modifiers">issues</a> in [unique.ptr.single.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider the following (simplified) implementation of 
  <tt>std::auto_ptr&lt;T&gt;::reset()</tt>: 
  </p>
  
! <blockquote><pre>
! void reset(T* newptr = 0) { 
     if (this-&gt;ptr &amp;&amp; this-&gt;ptr != newptr) { 
       delete this-&gt;ptr; 
     } 
*************** Consider the following (simplified) impl
*** 58612,58618 ****
  Now consider the following code which uses the above implementation: 
  </p>
  
! <blockquote><pre>struct foo { 
     std::auto_ptr&lt;foo&gt; ap; 
     foo() : ap(this) {} 
     void reset() { ap.reset(); } 
--- 63143,63150 ----
  Now consider the following code which uses the above implementation: 
  </p>
  
! <blockquote><pre>
! struct foo { 
     std::auto_ptr&lt;foo&gt; ap; 
     foo() : ap(this) {} 
     void reset() { ap.reset(); } 
*************** Howard adds:
*** 58664,58673 ****
  ]</i></p>
  
  
! <blockquote>
  To fix this behavior <tt>reset</tt> must be specified such that deleting the
  pointer is the last action to be taken within <tt>reset</tt>.
! </blockquote>
  
  <p><i>[
  Alisdair adds:
--- 63196,63205 ----
  ]</i></p>
  
  
! <blockquote><p>
  To fix this behavior <tt>reset</tt> must be specified such that deleting the
  pointer is the last action to be taken within <tt>reset</tt>.
! </p></blockquote>
  
  <p><i>[
  Alisdair adds:
*************** Alisdair adds:
*** 58676,58682 ****
  
  <blockquote>
  <p>
! The example providing the rationale for LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#998">998</a> is poor, as it relies on
  broken semantics of having two object believing they are unique owners of a
  single resource.  It should not be surprising that UB results from such
  code, and I feel no need to go out of our way to support such behaviour.
--- 63208,63214 ----
  
  <blockquote>
  <p>
! The example providing the rationale for LWG <a href="lwg-defects.html#998">998</a> is poor, as it relies on
  broken semantics of having two object believing they are unique owners of a
  single resource.  It should not be surprising that UB results from such
  code, and I feel no need to go out of our way to support such behaviour.
*************** Batavia (2009-05):
*** 58696,58708 ****
  <p>
  Howard summarizes:
  </p>
! <blockquote>
  This issue has to do with circular ownership,
  and affects <tt>auto_ptr</tt>, too (but we don't really care about that).
  It is intended to spell out the order in which operations must be performed
  so as to avoid the possibility
  of undefined behavior in the self-referential case.
! </blockquote>
  <p>
  Howard points to message c++std-lib-23175 for another example,
  requested by Alisdair.
--- 63228,63240 ----
  <p>
  Howard summarizes:
  </p>
! <blockquote><p>
  This issue has to do with circular ownership,
  and affects <tt>auto_ptr</tt>, too (but we don't really care about that).
  It is intended to spell out the order in which operations must be performed
  so as to avoid the possibility
  of undefined behavior in the self-referential case.
! </p></blockquote>
  <p>
  Howard points to message c++std-lib-23175 for another example,
  requested by Alisdair.
*************** Move to Tentatively Ready.
*** 58717,58723 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.9.2.5 [unique.ptr.single.modifiers], p5 (<i>Effects</i> clause for <tt>reset</tt>), and p6:
  </p>
  
  <blockquote>
--- 63249,63255 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.1.2.5 [unique.ptr.single.modifiers], p5 (<i>Effects</i> clause for <tt>reset</tt>), and p6:
  </p>
  
  <blockquote>
*************** expression. <i>-- end note</i>]</ins>
*** 58743,58755 ****
  
  <hr>
  <h3><a name="999"></a>999. Taking the address of a function</h3>
! <p><b>Section:</b> 20.9.8 [specialized.algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2009-03-09 <b>Last modified:</b> 2010-10-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#specialized.algorithms">issues</a> in [specialized.algorithms].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The same fix (reference <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#987">987</a>) may be applied to <tt>addressof</tt>, which is also constrained to
  <tt>ObjectType</tt>. (That was why <tt>boost::ref</tt> didn't work with functions - it
  tried to apply <tt>boost::addressof</tt> and the <tt>reinterpret_cast&lt;char&amp;&gt;</tt>
  implementation of <tt>addressof</tt> failed.)
--- 63275,63287 ----
  
  <hr>
  <h3><a name="999"></a>999. Taking the address of a function</h3>
! <p><b>Section:</b> 20.7.12 [specialized.algorithms] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2009-03-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#specialized.algorithms">issues</a> in [specialized.algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The same fix (reference <a href="lwg-defects.html#987">987</a>) may be applied to <tt>addressof</tt>, which is also constrained to
  <tt>ObjectType</tt>. (That was why <tt>boost::ref</tt> didn't work with functions - it
  tried to apply <tt>boost::addressof</tt> and the <tt>reinterpret_cast&lt;char&amp;&gt;</tt>
  implementation of <tt>addressof</tt> failed.)
*************** Move to Tentatively Ready.
*** 58775,58784 ****
  ]</i></p>
  
  
! <blockquote>
  Moved from Tentatively Ready to Open only because the wording needs to be
  tweaked for concepts removal.
! </blockquote>
  
  <p><i>[
  2009-10-10 Daniel updates wording to concept-free.
--- 63307,63316 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Tentatively Ready to Open only because the wording needs to be
  tweaked for concepts removal.
! </p></blockquote>
  
  <p><i>[
  2009-10-10 Daniel updates wording to concept-free.
*************** tweaked for concepts removal.
*** 58790,58798 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Tentatively Ready.
! </blockquote>
  
  
  
--- 63322,63330 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  
*************** The resolution assumes that <tt>addresso
*** 58804,58819 ****
  
  
  <p>
! In 20.9.8 [specialized.algorithms] change as described:
  </p>
  
! <blockquote><pre>template &lt;class T&gt; T* addressof(T&amp; r);
  </pre>
! <blockquote>
  <i>Returns:</i> The actual address of the object <ins>or function</ins>
! referenced by <tt>r</tt>, even in the
! presence of an overloaded <tt>operator&amp;</tt>.
! </blockquote>
  </blockquote>
  
  
--- 63336,63351 ----
  
  
  <p>
! In 20.7.12 [specialized.algorithms] change as described:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; T* addressof(T&amp; r);
  </pre>
! <blockquote><p>
  <i>Returns:</i> The actual address of the object <ins>or function</ins>
! referenced by <tt>r</tt>, even in the presence of an overloaded <tt>operator&amp;</tt>.
! </p></blockquote>
  </blockquote>
  
  
*************** presence of an overloaded <tt>operator&a
*** 58823,58833 ****
  
  
  <hr>
! <h3><a name="1004"></a>1004. Response to UK 179</h3>
! <p><b>Section:</b> 17.6.3.8 [res.on.functions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#res.on.functions">issues</a> in [res.on.functions].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 179</b></p>
--- 63355,63365 ----
  
  
  <hr>
! <h3><a name="1004"></a>1004. Clarify "throws an exception"</h3>
! <p><b>Section:</b> 17.6.4.8 [res.on.functions] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#res.on.functions">issues</a> in [res.on.functions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 179</b></p>
*************** they are caught within the function.
*** 58843,58869 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  The phrasing "throws an exception" is commonly used elsewhere
  to mean "throws or propagates an exception."
  Move to Open pending a possible more general resolution.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  Replace "propagates" in the proposed resolution with the phrase "exits
  via" and move to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the 4th bullet of 17.6.3.8 [res.on.functions], p2:
  </p>
  
  <blockquote>
--- 63375,63401 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  The phrasing "throws an exception" is commonly used elsewhere
  to mean "throws or propagates an exception."
  Move to Open pending a possible more general resolution.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  Replace "propagates" in the proposed resolution with the phrase "exits
  via" and move to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the 4th bullet of 17.6.4.8 [res.on.functions], p2:
  </p>
  
  <blockquote>
*************** allowed in the applicable <i>Required be
*** 58883,58892 ****
  
  <hr>
  <h3><a name="1006"></a>1006. <tt>operator delete</tt> in garbage collected implementation</h3>
! <p><b>Section:</b> 18.6.1 [new.delete] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#new.delete">issues</a> in [new.delete].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 190</b></p>
--- 63415,63424 ----
  
  <hr>
  <h3><a name="1006"></a>1006. <tt>operator delete</tt> in garbage collected implementation</h3>
! <p><b>Section:</b> 18.6.1 [new.delete] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete">issues</a> in [new.delete].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 190</b></p>
*************** Summit:
*** 58901,58929 ****
  ]</i></p>
  
   
! <blockquote>
  Agreed.
! </blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
  ]</i></p>
  
  
! <blockquote>
  Proposed wording is too strict for implementations that do not support
  garbage collection.  Updated wording supplied.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We recommend advancing this to Tentatively Ready
  with the understanding that it will not be moved for adoption
  unless and until the proposed resolution to Core issue #853 is adopted.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 63433,63461 ----
  ]</i></p>
  
   
! <blockquote><p>
  Agreed.
! </p></blockquote>
  
  <p><i>[
  2009-05-09 Alisdair adds:
  ]</i></p>
  
  
! <blockquote><p>
  Proposed wording is too strict for implementations that do not support
  garbage collection.  Updated wording supplied.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We recommend advancing this to Tentatively Ready
  with the understanding that it will not be moved for adoption
  unless and until the proposed resolution to Core issue #853 is adopted.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** resolution for Core #853)
*** 58937,58943 ****
  Add paragraphs to 18.6.1.1 [new.delete.single]:
  </p>
  
! <blockquote><pre>void operator delete(void* ptr) throw();
  <del>void operator delete(void* ptr, const std::nothrow_t&amp;) throw();</del>
  </pre>
  
--- 63469,63476 ----
  Add paragraphs to 18.6.1.1 [new.delete.single]:
  </p>
  
! <blockquote><pre>
! void operator delete(void* ptr) throw();
  <del>void operator delete(void* ptr, const std::nothrow_t&amp;) throw();</del>
  </pre>
  
*************** be a safely-derived pointer.
*** 58956,58962 ****
  <p>-10- ...</p>
  </blockquote>
  
! <pre>void operator delete(void* ptr, const std::nothrow_t&amp;) throw();
  </pre>
  
  <blockquote>
--- 63489,63496 ----
  <p>-10- ...</p>
  </blockquote>
  
! <pre>
! void operator delete(void* ptr, const std::nothrow_t&amp;) throw();
  </pre>
  
  <blockquote>
*************** be a safely-derived pointer.
*** 58975,58981 ****
  Add paragraphs to 18.6.1.2 [new.delete.array]:
  </p>
  
! <blockquote><pre>void operator delete[](void* ptr) throw();
  <del>void operator delete[](void* ptr, const std::nothrow_t&amp;) throw();</del>
  </pre>
  
--- 63509,63516 ----
  Add paragraphs to 18.6.1.2 [new.delete.array]:
  </p>
  
! <blockquote><pre>
! void operator delete[](void* ptr) throw();
  <del>void operator delete[](void* ptr, const std::nothrow_t&amp;) throw();</del>
  </pre>
  
*************** be a safely-derived pointer.
*** 58994,59000 ****
  <p>-9- ...</p>
  </blockquote>
  
! <pre>void operator delete[](void* ptr, const std::nothrow_t&amp;) throw();
  </pre>
  
  <blockquote>
--- 63529,63536 ----
  <p>-9- ...</p>
  </blockquote>
  
! <pre>
! void operator delete[](void* ptr, const std::nothrow_t&amp;) throw();
  </pre>
  
  <blockquote>
*************** be a safely-derived pointer.
*** 59014,59020 ****
  Add paragraphs to 18.6.1.3 [new.delete.placement]:
  </p>
  
! <blockquote><pre>void operator delete(void* ptr, void*) throw();
  </pre>
  
  <blockquote>
--- 63550,63557 ----
  Add paragraphs to 18.6.1.3 [new.delete.placement]:
  </p>
  
! <blockquote><pre>
! void operator delete(void* ptr, void*) throw();
  </pre>
  
  <blockquote>
*************** be a safely-derived pointer.
*** 59027,59033 ****
  <p>-7- ...</p>
  </blockquote>
  
! <pre>void operator delete[](void* ptr, void*) throw();
  </pre>
  
  <blockquote>
--- 63564,63571 ----
  <p>-7- ...</p>
  </blockquote>
  
! <pre>
! void operator delete[](void* ptr, void*) throw();
  </pre>
  
  <blockquote>
*************** be a safely-derived pointer.
*** 59048,59058 ****
  
  
  <hr>
! <h3><a name="1011"></a>1011. <tt>next/prev</tt> wrong iterator type</h3>
! <p><b>Section:</b> 24.4.4 [iterator.operations] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iterator.operations">issues</a> in [iterator.operations].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 271</b></p>
--- 63586,63596 ----
  
  
  <hr>
! <h3><a name="1011"></a>1011. <tt>next&#47;prev</tt> wrong iterator type</h3>
! <p><b>Section:</b> 24.4.4 [iterator.operations] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.operations">issues</a> in [iterator.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 271</b></p>
*************** the original iterator. However, even thi
*** 59068,59087 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote>
  Moved from Tentatively Ready to Open only because the wording needs to be
  tweaked for concepts removal.
! </blockquote>
  
  <p><i>[
  2009-10-14 Daniel provided de-conceptified wording.
--- 63606,63625 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009-07 Frankfurt
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Tentatively Ready to Open only because the wording needs to be
  tweaked for concepts removal.
! </p></blockquote>
  
  <p><i>[
  2009-10-14 Daniel provided de-conceptified wording.
*************** tweaked for concepts removal.
*** 59093,59101 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  
  
--- 63631,63639 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  
  
*************** Moved to Ready.
*** 59108,59114 ****
  Change header <tt>&lt;iterator&gt;</tt> synopsis 24.3 [iterator.synopsis] as indicated:
  </p>
  
! <blockquote><pre>// 24.4.4, iterator operations:
  ...
  template &lt;class <del>Input</del><ins>Forward</ins>Iterator&gt;
    <del>Input</del><ins>Forward</ins>Iterator
--- 63646,63653 ----
  Change header <tt>&lt;iterator&gt;</tt> synopsis 24.3 [iterator.synopsis] as indicated:
  </p>
  
! <blockquote><pre>
! // 24.4.4, iterator operations:
  ...
  template &lt;class <del>Input</del><ins>Forward</ins>Iterator&gt;
    <del>Input</del><ins>Forward</ins>Iterator
*************** template &lt;class <del>Input</del><ins>
*** 59121,59127 ****
  Change 24.4.4 [iterator.operations] before p.6 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class <del>Input</del><ins>Forward</ins>Iterator&gt;
    <del>Input</del><ins>Forward</ins>Iterator
    next(<del>Input</del><ins>Forward</ins>Iterator x, typename std::iterator_traits&lt;<del>Input</del><ins>Forward</ins>Iterator&gt;::difference_type n = 1);
  </pre></blockquote>
--- 63660,63667 ----
  Change 24.4.4 [iterator.operations] before p.6 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class <del>Input</del><ins>Forward</ins>Iterator>
    <del>Input</del><ins>Forward</ins>Iterator
    next(<del>Input</del><ins>Forward</ins>Iterator x, typename std::iterator_traits&lt;<del>Input</del><ins>Forward</ins>Iterator&gt;::difference_type n = 1);
  </pre></blockquote>
*************** Change 24.4.4 [iterator.operations] befo
*** 59135,59143 ****
  
  <hr>
  <h3><a name="1012"></a>1012. <tt>reverse_iterator</tt> default ctor should value initialize</h3>
! <p><b>Section:</b> 24.5.1.3.1 [reverse.iter.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 277</b></p>
--- 63675,63683 ----
  
  <hr>
  <h3><a name="1012"></a>1012. <tt>reverse_iterator</tt> default ctor should value initialize</h3>
! <p><b>Section:</b> 24.5.1.3.1 [reverse.iter.cons] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 277</b></p>
*************** Summit:
*** 59157,59180 ****
  ]</i></p>
  
  
! <blockquote>
  Agree with option i.
! </blockquote>
  
  <p>
! Related issue: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We believe this should be revisited
! in conjunction with issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#408">408</a>,
  which nearly duplicates this issue.
  Move to Open.
! </blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
--- 63697,63720 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree with option i.
! </p></blockquote>
  
  <p>
! Related issue: <a href="lwg-closed.html#408">408</a>
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We believe this should be revisited
! in conjunction with issue <a href="lwg-closed.html#408">408</a>,
  which nearly duplicates this issue.
  Move to Open.
! </p></blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
*************** Move to Tentatively Ready.
*** 59195,59203 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready for this meeting.
! </blockquote>
  
  
  
--- 63735,63743 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready for this meeting.
! </p></blockquote>
  
  
  
*************** Moved to Ready for this meeting.
*** 59206,59229 ****
  Change  [reverse.iter.con]:
  </p>
  
! <blockquote><pre>reverse_iterator();
  </pre>
! <blockquote>
  -1- <i>Effects:</i> <del>Default</del> <ins>Value</ins> initializes <tt>current</tt>. Iterator
  operations applied to the resulting iterator have defined behavior if and
  only if the corresponding operations are defined on a <del>default constructed</del>
  <ins>value initialized</ins>
  iterator of type <tt>Iterator</tt>.
! </blockquote>
  </blockquote>
  
  <p>
  Change 24.5.3.3.1 [move.iter.op.const]:
  </p>
  
! <blockquote><pre>move_iterator();
  </pre>
! <blockquote>
  -1- <i>Effects:</i> Constructs a <tt>move_iterator</tt>, <del>default</del> <ins>value</ins>
  initializing <tt>current</tt>.
  <ins>Iterator
--- 63746,63771 ----
  Change  [reverse.iter.con]:
  </p>
  
! <blockquote><pre>
! reverse_iterator();
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> <del>Default</del> <ins>Value</ins> initializes <tt>current</tt>. Iterator
  operations applied to the resulting iterator have defined behavior if and
  only if the corresponding operations are defined on a <del>default constructed</del>
  <ins>value initialized</ins>
  iterator of type <tt>Iterator</tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
  Change 24.5.3.3.1 [move.iter.op.const]:
  </p>
  
! <blockquote><pre>
! move_iterator();
  </pre>
! <blockquote><p>
  -1- <i>Effects:</i> Constructs a <tt>move_iterator</tt>, <del>default</del> <ins>value</ins>
  initializing <tt>current</tt>.
  <ins>Iterator
*************** operations applied to the resulting iter
*** 59231,59237 ****
  only if the corresponding operations are defined on a
  value initialized
  iterator of type <tt>Iterator</tt>.</ins>
! </blockquote>
  </blockquote>
  
  
--- 63773,63779 ----
  only if the corresponding operations are defined on a
  value initialized
  iterator of type <tt>Iterator</tt>.</ins>
! </p></blockquote>
  </blockquote>
  
  
*************** iterator of type <tt>Iterator</tt>.</ins
*** 59240,59250 ****
  
  
  <hr>
! <h3><a name="1014"></a>1014. Response to UK 317 and JP 74</h3>
! <p><b>Section:</b> 28.8.2 [re.regex.construct] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.regex.construct">issues</a> in [re.regex.construct].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 317 and JP 74</b></p>
--- 63782,63792 ----
  
  
  <hr>
! <h3><a name="1014"></a>1014. <tt>basic_regex</tt> should be created/assigned from initializer lists</h3>
! <p><b>Section:</b> 28.8.2 [re.regex.construct] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.regex.construct">issues</a> in [re.regex.construct].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 317 and JP 74</b></p>
*************** iterator of type <tt>Iterator</tt>.</ins
*** 59253,59281 ****
  UK 317:
  </p>
  
! <blockquote>
  <tt>basic_string</tt> has both a constructor and an assignment operator that
  accepts an initializer list, <tt>basic_regex</tt> should have the same.
! </blockquote>
  
  <p>
  JP 74:
  </p>
  
! <blockquote>
! <tt>basic_regx &amp; operator= (initializer_list&lt;T&gt;);</tt> is not defined.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  UK 317 asks for both assignment and constructor,
  but the requested constructor is already present in the current Working Paper.
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 63795,63823 ----
  UK 317:
  </p>
  
! <blockquote><p>
  <tt>basic_string</tt> has both a constructor and an assignment operator that
  accepts an initializer list, <tt>basic_regex</tt> should have the same.
! </p></blockquote>
  
  <p>
  JP 74:
  </p>
  
! <blockquote><p>
! <tt>basic_regex &amp; operator= (initializer_list&lt;T&gt;);</tt> is not defined.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  UK 317 asks for both assignment and constructor,
  but the requested constructor is already present in the current Working Paper.
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Tentatively Ready.
*** 59283,59289 ****
  Change 28.8 [re.regex]:
  </p>
  
! <blockquote><pre>template &lt;class charT,
            class traits = regex_traits&lt;charT&gt; &gt;
  class basic_regex {
    ...
--- 63825,63832 ----
  Change 28.8 [re.regex]:
  </p>
  
! <blockquote><pre>
! template &lt;class charT,
            class traits = regex_traits&lt;charT&gt; &gt;
  class basic_regex {
    ...
*************** Add in  28.8.2 [re.regex.construct]:
*** 59300,59313 ****
  </p>
  
  <blockquote>
! <blockquote>
  -20- ...
! </blockquote>
! <pre>basic_regex&amp; operator=(initializer_list&lt;charT&gt; il);
  </pre>
! <blockquote>
  -21- <i>Effects:</i> returns <tt>assign(il.begin(), il.end());</tt>
! </blockquote>
  </blockquote>
  
  
--- 63843,63857 ----
  </p>
  
  <blockquote>
! <blockquote><p>
  -20- ...
! </p></blockquote>
! <pre>
! basic_regex&amp; operator=(initializer_list&lt;charT&gt; il);
  </pre>
! <blockquote><p>
  -21- <i>Effects:</i> returns <tt>assign(il.begin(), il.end());</tt>
! </p></blockquote>
  </blockquote>
  
  
*************** Add in  28.8.2 [re.regex.construct]:
*** 59316,59329 ****
  
  
  <hr>
! <h3><a name="1019"></a>1019. Response to UK 205</h3>
! <p><b>Section:</b> 20.7.3 [meta.help] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.help">issues</a> in [meta.help].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 205</b></p>
  
  <p>
  <tt>integral_constant</tt> objects should be usable in integral-constant-expressions.
--- 63860,63873 ----
  
  
  <hr>
! <h3><a name="1019"></a>1019. Make <tt>integral_constant</tt> objects useable in integral-constant-expressions</h3>
! <p><b>Section:</b> 20.10.3 [meta.help] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.help">issues</a> in [meta.help].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 205 [CD1]</b></p>
  
  <p>
  <tt>integral_constant</tt> objects should be usable in integral-constant-expressions.
*************** constant expressions make this possible.
*** 59335,59347 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree that the <tt>static</tt> data member
  ought be declared <tt>constexpr</tt>,
  but do not see a need for the proposed <tt>operator value_type()</tt>.
  (A use case would be helpful.)
  Move to Open.
! </blockquote>
  
  <p><i>[
  2009-05-23 Alisdair adds:
--- 63879,63891 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree that the <tt>static</tt> data member
  ought be declared <tt>constexpr</tt>,
  but do not see a need for the proposed <tt>operator value_type()</tt>.
  (A use case would be helpful.)
  Move to Open.
! </p></blockquote>
  
  <p><i>[
  2009-05-23 Alisdair adds:
*************** that explicit conversion is more appropr
*** 59373,59379 ****
  Here's a use case which demonstrates the syntactic niceness which Alisdair describes:
  </p>
  
! <blockquote><pre>#define requires(...) class = typename std::enable_if&lt;(__VA_ARGS__)&gt;::type
  
  template &lt;class T, class U,
      requires(!is_lvalue_reference&lt;T&gt;() ||
--- 63917,63924 ----
  Here's a use case which demonstrates the syntactic niceness which Alisdair describes:
  </p>
  
! <blockquote><pre>
! #define requires(...) class = typename std::enable_if&lt;(__VA_ARGS__)&gt;::type
  
  template &lt;class T, class U,
      requires(!is_lvalue_reference&lt;T&gt;() ||
*************** forward(U&amp;&amp; t)
*** 59394,59420 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready for this meeting.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to the <tt>integral_constant</tt> struct definition in 20.7.3 [meta.help]:
  </p>
  
! <blockquote><pre>template &lt;class T, T v&gt;
  struct integral_constant {
    static const<ins>expr</ins> T value = v;
    typedef T value_type;
--- 63939,63966 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready for this meeting.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to the <tt>integral_constant</tt> struct definition in 20.10.3 [meta.help]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, T v&gt;
  struct integral_constant {
    static const<ins>expr</ins> T value = v;
    typedef T value_type;
*************** struct integral_constant {
*** 59428,59444 ****
  
  
  <hr>
! <h3><a name="1021"></a>1021. Response to UK 211</h3>
! <p><b>Section:</b> 20.9.9.2.3 [unique.ptr.single.asgn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 211</b></p>
  
  <p>
  The <tt>nullptr_t</tt> type was introduced to resolve the null pointer literal
! problem. It should be used for the assignemnt operator, as with the
  constructor and elsewhere through the library.
  </p>
  
--- 63974,63991 ----
  
  
  <hr>
! <h3><a name="1021"></a>1021. Allow <tt>nullptr_t</tt> assignments to <tt>unique_ptr</tt></h3>
! <p><b>Section:</b> 20.8.1.2.3 [unique.ptr.single.asgn] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.asgn">issues</a> in [unique.ptr.single.asgn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 211 [CD1]</b></p>
  
  <p>
  The <tt>nullptr_t</tt> type was introduced to resolve the null pointer literal
! problem. It should be used for the assignment operator, as with the
  constructor and elsewhere through the library.
  </p>
  
*************** constructor and elsewhere through the li
*** 59446,59477 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 20.9.9.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>unique_ptr&amp; operator=(<del><i>unspecified-pointer-type</i></del> <ins>nullptr_t</ins>);
  </pre></blockquote>
  
  <p>
! Change 20.9.9.2.3 [unique.ptr.single.asgn]:
  </p>
  
! <blockquote><pre>unique_ptr&amp; operator=(<del><i>unspecified-pointer-type</i></del> <ins>nullptr_t</ins>);
  </pre>
! <blockquote>
  <del>Assigns from the literal 0 or <tt>NULL</tt>. [<i>Note:</i> The
  <i>unspecified-pointer-type</i> is often implemented as a pointer to a
  private data member, avoiding many of the implicit conversion pitfalls.
! <i>-- end note</i>]</del>
! </blockquote>
  </blockquote>
  
  
--- 63993,64026 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis in 20.8.1.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>
! unique_ptr&amp; operator=(<del><i>unspecified-pointer-type</i></del> <ins>nullptr_t</ins>);
  </pre></blockquote>
  
  <p>
! Change 20.8.1.2.3 [unique.ptr.single.asgn]:
  </p>
  
! <blockquote><pre>
! unique_ptr&amp; operator=(<del><i>unspecified-pointer-type</i></del> <ins>nullptr_t</ins>);
  </pre>
! <blockquote><p>
  <del>Assigns from the literal 0 or <tt>NULL</tt>. [<i>Note:</i> The
  <i>unspecified-pointer-type</i> is often implemented as a pointer to a
  private data member, avoiding many of the implicit conversion pitfalls.
! &mdash; <i>end note</i>]</del>
! </p></blockquote>
  </blockquote>
  
  
*************** private data member, avoiding many of th
*** 59479,59491 ****
  
  
  <hr>
! <h3><a name="1030"></a>1030. Response to JP 44</h3>
! <p><b>Section:</b> 20.9.10.5 [util.smartptr.shared.atomic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses JP 44</b></p>
  
  <p>
  The 1st parameter <tt>p</tt> and 2nd parameter <tt>v</tt> is now
--- 64028,64041 ----
  
  
  <hr>
! <h3><a name="1030"></a>1030. Missing requirements for smart-pointer safety API</h3>
! <p><b>Section:</b> 20.8.2.6 [util.smartptr.shared.atomic] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.atomic">issues</a> in [util.smartptr.shared.atomic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses JP 44 [CD1]</b></p>
  
  <p>
  The 1st parameter <tt>p</tt> and 2nd parameter <tt>v</tt> is now
*************** Summit:
*** 59502,59511 ****
  ]</i></p>
  
  
! <blockquote>
  Agree. All of the functions need a requirement that <tt>p</tt> (or
  <tt>v</tt>) is a pointer to a valid object.
! </blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
--- 64052,64061 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree. All of the functions need a requirement that <tt>p</tt> (or
  <tt>v</tt>) is a pointer to a valid object.
! </p></blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
*************** to require that such pointers not be nul
*** 59550,59565 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  In section "<code>shared_ptr</code> atomic access"
! 20.9.10.5 [util.smartptr.shared.atomic], add to each function the
  following clause.
  </p>
  <blockquote><p>
--- 64100,64115 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
  In section "<code>shared_ptr</code> atomic access"
! 20.8.2.6 [util.smartptr.shared.atomic], add to each function the
  following clause.
  </p>
  <blockquote><p>
*************** following clause.
*** 59572,59581 ****
  
  <hr>
  <h3><a name="1033"></a>1033. <tt>thread::join()</tt> effects?</h3>
! <p><b>Section:</b> 30.3.1.5 [thread.thread.member] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.member">issues</a> in [thread.thread.member].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 64122,64131 ----
  
  <hr>
  <h3><a name="1033"></a>1033. <tt>thread::join()</tt> effects?</h3>
! <p><b>Section:</b> 30.3.1.5 [thread.thread.member] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.member">issues</a> in [thread.thread.member].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** issue or NB comment about that, but I mi
*** 59588,59605 ****
  The postconditions clause for <tt>thread::join()</tt> is:
  </p>
  
! <blockquote>
  <i>Postconditions:</i> If <tt>join()</tt> throws an exception, the value
  returned by <tt>get_id()</tt> is unchanged. Otherwise, <tt>get_id() == id()</tt>.
! </blockquote>
  
  <p>
  and the throws clause is:
  </p>
  
! <blockquote>
  <i>Throws:</i> <tt>std::system_error</tt> when the postconditions cannot be achieved.
! </blockquote>
  
  <p>
  Now... how could the postconditions <em>not</em> be achieved?
--- 64138,64155 ----
  The postconditions clause for <tt>thread::join()</tt> is:
  </p>
  
! <blockquote><p>
  <i>Postconditions:</i> If <tt>join()</tt> throws an exception, the value
  returned by <tt>get_id()</tt> is unchanged. Otherwise, <tt>get_id() == id()</tt>.
! </p></blockquote>
  
  <p>
  and the throws clause is:
  </p>
  
! <blockquote><p>
  <i>Throws:</i> <tt>std::system_error</tt> when the postconditions cannot be achieved.
! </p></blockquote>
  
  <p>
  Now... how could the postconditions <em>not</em> be achieved?
*************** postconditions, but the postconditions a
*** 59613,59622 ****
  I believe the throws clause should be:
  </p>
  
! <blockquote>
  <i>Throws:</i> <tt>std::system_error</tt> when the effects or postconditions
  cannot be achieved.
! </blockquote>
  
  <p>
  as it is in <tt>detach()</tt>, or, even better, as the postcondition is
--- 64163,64172 ----
  I believe the throws clause should be:
  </p>
  
! <blockquote><p>
  <i>Throws:</i> <tt>std::system_error</tt> when the effects or postconditions
  cannot be achieved.
! </p></blockquote>
  
  <p>
  as it is in <tt>detach()</tt>, or, even better, as the postcondition is
*************** trivially satisfiable and to remove the
*** 59624,59632 ****
  </p>
  
  
! <blockquote>
  <i>Throws:</i> <tt>std::system_error</tt> if the effects cannot be achieved.
! </blockquote>
  
  <p>
  Problem is that... ehm... <tt>join()</tt> has no "Effects" clause. Is that intentional?
--- 64174,64182 ----
  </p>
  
  
! <blockquote><p>
  <i>Throws:</i> <tt>std::system_error</tt> if the effects cannot be achieved.
! </p></blockquote>
  
  <p>
  Problem is that... ehm... <tt>join()</tt> has no "Effects" clause. Is that intentional?
*************** Batavia (2009-05):
*** 59644,59650 ****
  <blockquote>
  <p>
  Pete believes there may be some more general language (in frontmatter)
! that can address this and related issues such as <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#962">962</a>.
  </p>
  <p>
  Move to Open.
--- 64194,64200 ----
  <blockquote>
  <p>
  Pete believes there may be some more general language (in frontmatter)
! that can address this and related issues such as <a href="lwg-defects.html#962">962</a>.
  </p>
  <p>
  Move to Open.
*************** Move to Open.
*** 59667,59673 ****
  Edit 30.3.1.5 [thread.thread.member] as indicated:
  </p>
  
! <blockquote><pre>void join();
  </pre>
  <blockquote>
  <p>
--- 64217,64224 ----
  Edit 30.3.1.5 [thread.thread.member] as indicated:
  </p>
  
! <blockquote><pre>
! void join();
  </pre>
  <blockquote>
  <p>
*************** Edit 30.3.1.5 [thread.thread.member] as
*** 59681,59687 ****
  6 <i>Synchronization:</i> The completion of the thread represented by
  <tt>*this</tt> happens before (1.10 [intro.multithread])
  <tt>join()</tt> returns. [<i>Note:</i> Operations on <tt>*this</tt> are not
! synchronized. — <i>end note</i>]
  </p>
  
  <p>
--- 64232,64238 ----
  6 <i>Synchronization:</i> The completion of the thread represented by
  <tt>*this</tt> happens before (1.10 [intro.multithread])
  <tt>join()</tt> returns. [<i>Note:</i> Operations on <tt>*this</tt> are not
! synchronized. &mdash; <i>end note</i>]
  </p>
  
  <p>
*************** represented by <tt>*this</tt> has comple
*** 59704,59718 ****
  
  
  <hr>
! <h3><a name="1034"></a>1034. Response to UK 222</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 222</b></p>
  
  <p>
  It is not clear what purpose the Requirement tables serve in the
--- 64255,64269 ----
  
  
  <hr>
! <h3><a name="1034"></a>1034. Clarify generality of Container Requirement tables</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 222 [CD1]</b></p>
  
  <p>
  It is not clear what purpose the Requirement tables serve in the
*************** Summit:
*** 59747,59776 ****
  ]</i></p>
  
  
! <blockquote>
  Agree in principle.
! </blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
  ]</i></p>
  
  
! <blockquote>
  We agree in principle, but we have a timetable. This group feels that
  the issue should be closed as NAD unless a proposed resolution is
  submitted prior to the March 2010 meeting.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Looked at this and still intend to close as NAD in March
  2010 unless there is proposed wording that we like.
! </blockquote>
  
  <p><i>[
  2010-02-02 Nicolai M. Josuttis updates proposed wording and adds:
--- 64298,64327 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree in principle.
! </p></blockquote>
  
  <p><i>[
  2009-07 post-Frankfurt:
  ]</i></p>
  
  
! <blockquote><p>
  We agree in principle, but we have a timetable. This group feels that
  the issue should be closed as NAD unless a proposed resolution is
  submitted prior to the March 2010 meeting.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Looked at this and still intend to close as NAD in March
  2010 unless there is proposed wording that we like.
! </p></blockquote>
  
  <p><i>[
  2010-02-02 Nicolai M. Josuttis updates proposed wording and adds:
*************** For me, currently, this follows from
*** 59787,59797 ****
  Sequence containers 23.2.3 [sequence.reqmts]
  saying:
  </p>
! <blockquote>
  The library provides five basic kinds of sequence containers: <tt>array</tt>,
  <tt>vector</tt>, <tt>forward_list</tt>, <tt>list</tt>, and <tt>deque</tt>. while
  later on in Table 94 "Sequence container requirements" are defined.
! </blockquote>
  
  <p>
  IMO, you can hardly argue that this is NAD.
--- 64338,64348 ----
  Sequence containers 23.2.3 [sequence.reqmts]
  saying:
  </p>
! <blockquote><p>
  The library provides five basic kinds of sequence containers: <tt>array</tt>,
  <tt>vector</tt>, <tt>forward_list</tt>, <tt>list</tt>, and <tt>deque</tt>. while
  later on in Table 94 "Sequence container requirements" are defined.
! </p></blockquote>
  
  <p>
  IMO, you can hardly argue that this is NAD.
*************** In fact, out of all sequence container r
*** 59846,59858 ****
  provides the following operations:
  from sequence requirements (Table 94):
  </p>
! <blockquote><pre>X(il);
  a = il;
  </pre></blockquote>
  <p>
  and from optional requirements (Table 95):
  </p>
! <blockquote><pre>[], at(), front(), back()
  </pre></blockquote>
  <p>
  This is almost nothing!
--- 64397,64411 ----
  provides the following operations:
  from sequence requirements (Table 94):
  </p>
! <blockquote><pre>
! X(il);
  a = il;
  </pre></blockquote>
  <p>
  and from optional requirements (Table 95):
  </p>
! <blockquote><pre>
! [], at(), front(), back()
  </pre></blockquote>
  <p>
  This is almost nothing!
*************** a construction or assignment with an ini
*** 59866,59872 ****
  for all sequence containers but not valid for array:
  </p>
  
! <blockquote><pre>vector&lt;int&gt;  v({1,2,3});   // OK
  v = {4,5,6};               // OK
  
  array&lt;int,3&gt; a({1,2,3});   // Error
--- 64419,64426 ----
  for all sequence containers but not valid for array:
  </p>
  
! <blockquote><pre>
! vector&lt;int&gt;  v({1,2,3});   // OK
  v = {4,5,6};               // OK
  
  array&lt;int,3&gt; a({1,2,3});   // Error
*************** indicated: </i> </p>
*** 59927,59933 ****
    most insertions and deletions take place at the beginning or at the end of the 
    sequence. </p>
  </blockquote>
! <p><i>In Class template array 23.3.1 [array] modify paragraph 3 as indicated:
  </i> </p>
  <blockquote>
    <p>3 <del>Unless otherwise specified, all <tt>array</tt> operations are as 
--- 64481,64487 ----
    most insertions and deletions take place at the beginning or at the end of the 
    sequence. </p>
  </blockquote>
! <p><i>In Class template array 23.3.2 [array] modify paragraph 3 as indicated:
  </i> </p>
  <blockquote>
    <p>3 <del>Unless otherwise specified, all <tt>array</tt> operations are as 
*************** indicated: </i> </p>
*** 59940,59946 ****
    <del>in that Clause</del> <ins>in one of these tables</ins> or for operations 
    where there is additional semantic information. </p>
  </blockquote>
! <p><i>In array specialized algorithms 23.3.1.2 [array.special] add to the 
  specification of <tt>swap()</tt>: </i> </p>
  <blockquote>
    <pre>template &lt;class T, size_t N&gt; void swap(array&lt;T,N&gt;&amp; x, array&lt;T,N&gt;&amp; y);
--- 64494,64500 ----
    <del>in that Clause</del> <ins>in one of these tables</ins> or for operations 
    where there is additional semantic information. </p>
  </blockquote>
! <p><i>In array specialized algorithms 23.3.2.3 [array.special] add to the 
  specification of <tt>swap()</tt>: </i> </p>
  <blockquote>
    <pre>template &lt;class T, size_t N&gt; void swap(array&lt;T,N&gt;&amp; x, array&lt;T,N&gt;&amp; y);
*************** specification of <tt>swap()</tt>: </i> <
*** 59960,59973 ****
  
  
  <hr>
! <h3><a name="1037"></a>1037. Response to UK 232</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 232</b></p>
  
  <p>
  <tt>match_results</tt> may follow the requirements but is not listed a general
--- 64514,64527 ----
  
  
  <hr>
! <h3><a name="1037"></a>1037. Unclear status of <tt>match_results</tt> as library container</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 232 [CD1]</b></p>
  
  <p>
  <tt>match_results</tt> may follow the requirements but is not listed a general
*************** Summit:
*** 59983,60000 ****
  ]</i></p>
  
  
! <blockquote>
  Agree. <tt>operator[]</tt> is defined elsewhere.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 64537,64554 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree. <tt>operator[]</tt> is defined elsewhere.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** In 23.2.3 [sequence.reqmts] Table 84, re
*** 60008,60021 ****
  
  
  <hr>
! <h3><a name="1038"></a>1038. Response to UK 233</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 233</b></p>
  
  <p>
  Table 84 is missing references to several new container types.
--- 64562,64575 ----
  
  
  <hr>
! <h3><a name="1038"></a>1038. Sequence requirement table needs to reference several new containers</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 233 [CD1]</b></p>
  
  <p>
  Table 84 is missing references to several new container types.
*************** Summit:
*** 60026,60043 ****
  ]</i></p>
  
  
! <blockquote>
  Agree.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 64580,64597 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** containers to the following rows:
*** 60049,60055 ****
  <blockquote>
  <table border="1">
  <caption>Table 84 -- Optional sequence container operations</caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
--- 64603,64609 ----
  <blockquote>
  <table border="1">
  <caption>Table 84 -- Optional sequence container operations</caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
*************** containers to the following rows:
*** 60103,60109 ****
  <td>...</td>
  <td><tt>vector, deque<ins>, basic_string, array</ins></tt></td>
  </tr>
! </tbody></table>
  </blockquote>
  
  
--- 64657,64663 ----
  <td>...</td>
  <td><tt>vector, deque<ins>, basic_string, array</ins></tt></td>
  </tr>
! </table>
  </blockquote>
  
  
*************** containers to the following rows:
*** 60111,60124 ****
  
  
  <hr>
! <h3><a name="1039"></a>1039. Response to UK 234</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 234</b></p>
  
  <p>
  The reference to <tt>iterator</tt> in semantics for <tt>back</tt> should
--- 64665,64678 ----
  
  
  <hr>
! <h3><a name="1039"></a>1039. Sequence container <tt>back</tt> function should also support <tt>const_iterator</tt></h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 234 [CD1]</b></p>
  
  <p>
  The reference to <tt>iterator</tt> in semantics for <tt>back</tt> should
*************** Summit:
*** 60132,60149 ****
  ]</i></p>
  
  
! <blockquote>
  Agree.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 64686,64703 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** In 23.2.3 [sequence.reqmts] Table 84, re
*** 60153,60160 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 84 -- Optional sequence container operations</caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
--- 64707,64714 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 84 &mdash; Optional sequence container operations</caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
*************** In 23.2.3 [sequence.reqmts] Table 84, re
*** 60163,60172 ****
  <tr>
  <td><tt>a.back()</tt></td>
  <td><tt>reference; const_reference</tt> for constant <tt>a</tt></td>
! <td><tt>{ <del>iterator</del> <ins>auto</ins> tmp = a.end();<br>--tmp;<br>return *tmp; }</tt></td>
  <td><tt>vector, list, deque, basic_string</tt></td>
  </tr>
! </tbody></table>
  </blockquote>
  
  
--- 64717,64726 ----
  <tr>
  <td><tt>a.back()</tt></td>
  <td><tt>reference; const_reference</tt> for constant <tt>a</tt></td>
! <td><tt>{ <del>iterator</del> <ins>auto</ins> tmp = a.end();<br/>--tmp;<br/>return *tmp; }</tt></td>
  <td><tt>vector, list, deque, basic_string</tt></td>
  </tr>
! </table>
  </blockquote>
  
  
*************** In 23.2.3 [sequence.reqmts] Table 84, re
*** 60174,60188 ****
  
  
  <hr>
! <h3><a name="1040"></a>1040. Response to UK 238</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 238</b></p>
  
  <p>
  Leaving it unspecified whether or not <tt>iterator</tt> and <tt>const_iterator</tt> are the
--- 64728,64742 ----
  
  
  <hr>
! <h3><a name="1040"></a>1040. Clarify possible sameness of associative container's <tt>iterator</tt> and <tt>const_iterator</tt></h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 238 [CD1]</b></p>
  
  <p>
  Leaving it unspecified whether or not <tt>iterator</tt> and <tt>const_iterator</tt> are the
*************** Summit:
*** 60201,60219 ****
  ]</i></p>
  
  
! <blockquote>
  Agree with issue. Agree with adding the note but not with changing the
  normative text. We believe the note provides sufficient guidance.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 64755,64773 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree with issue. Agree with adding the note but not with changing the
  normative text. We believe the note provides sufficient guidance.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Tentatively Ready.
*** 60221,60227 ****
  In 23.2.4 [associative.reqmts] p6, add:
  </p>
  
! <blockquote>
  -6- <tt>iterator</tt> of an associative container meets the requirements
  of the <tt>BidirectionalIterator</tt> concept. For associative
  containers where the value type is the same as the key type, both
--- 64775,64781 ----
  In 23.2.4 [associative.reqmts] p6, add:
  </p>
  
! <blockquote><p>
  -6- <tt>iterator</tt> of an associative container meets the requirements
  of the <tt>BidirectionalIterator</tt> concept. For associative
  containers where the value type is the same as the key type, both
*************** is unspecified whether or not <tt>iterat
*** 60232,60255 ****
  this case, and <tt>iterator</tt> is convertible to <tt>const_iterator</tt>. Users can avoid
  violating the One Definition Rule by always using <tt>const_iterator</tt>
  in their function parameter lists <i>-- end note</i>]</ins>
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1044"></a>1044. Response to UK 325</h3>
! <p><b>Section:</b> 30.4 [thread.mutex] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex">issues</a> in [thread.mutex].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 325</b></p>
  
  <p>
! We believe constexpr literal values should be a more natural expression
  of empty tag types than extern objects as it should improve the
  compiler's ability to optimize the empty object away completely.
  </p>
--- 64786,64924 ----
  this case, and <tt>iterator</tt> is convertible to <tt>const_iterator</tt>. Users can avoid
  violating the One Definition Rule by always using <tt>const_iterator</tt>
  in their function parameter lists <i>-- end note</i>]</ins>
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1043"></a>1043. Clarify that <tt>compare_exchange</tt> is not a read-modify-write operation</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses US 91 [CD1]</b></p>
  
  <p>
! It is unclear whether or not a failed <tt>compare_exchange</tt> is a RMW operation
! (as used in 1.10 [intro.multithread]).
! </p>
! 
! <p>
! Suggested solution:
! </p>
! 
! <p>
! Make failing <tt>compare_exchange</tt> operations <b>not</b> be RMW.
! </p>
! 
! <p><i>[
! Anthony Williams adds:
! ]</i></p>
! 
! 
! <blockquote><p>
! In 29.6 [atomics.types.operations] p18 it says that "These
! operations are atomic read-modify-write operations" (final sentence).
! This is overly restrictive on the implementations of
! <tt>compare_exchange_weak</tt> and <tt>compare_exchange_strong</tt> on platforms without a
! native CAS instruction.
! </p></blockquote>
! 
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! 
! <blockquote><p>
! Group agrees with the resolution as proposed by Anthony Williams in the attached note.
! </p></blockquote>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote><p>
! We recommend the proposed resolution be reviewed
! by members of the Concurrency Subgroup.
! </p></blockquote>
! 
! <p><i>[
! 2009-07 post-Frankfurt:
! ]</i></p>
! 
! 
! <blockquote><p>
! This is likely to be addressed by Lawrence's upcoming paper. He will
! adopt the proposed resolution.
! </p></blockquote>
! 
! <p><i>[
! 2009-08-17 Handled by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2925.html">N2925</a>.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Change 29.6 [atomics.types.operations] p18:
! </p>
! 
! <blockquote><p>
! -18- <i>Effects:</i> Atomically, compares the value pointed to by
! <tt>object</tt> or by <tt>this</tt> for equality with that in
! <tt>expected</tt>, and if true, replaces the value pointed to by
! <tt>object</tt> or by <tt>this</tt> with desired, and if false, updates
! the value in <tt>expected</tt> with the value pointed to by
! <tt>object</tt> or by <tt>this</tt>. Further, if the comparison is true,
! memory is affected according to the value of <tt>success</tt>, and if the
! comparison is false, memory is affected according to the value of
! <tt>failure</tt>. When only one <tt>memory_order</tt> argument is
! supplied, the value of <tt>success</tt> is <tt>order</tt>, and the value
! of <tt>failure</tt> is <tt>order</tt> except that a value of
! <tt>memory_order_acq_rel</tt> shall be replaced by the value
! <tt>memory_order_acquire</tt> and a value of
! <tt>memory_order_release</tt> shall be replaced by the value
! <tt>memory_order_relaxed</tt>. <ins>If the comparison is <tt>true</tt>, </ins>
! <del>T</del><ins>t</ins>hese operations are atomic
! read-modify-write operations (1.10). 
! <ins>If the comparison is <tt>false</tt>, these
! operations are atomic load operations.</ins>
! </p></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1044"></a>1044. Empty tag types should be <tt>constexpr</tt> literals</h3>
! <p><b>Section:</b> 30.4 [thread.mutex] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex">issues</a> in [thread.mutex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 325 [CD1]</b></p>
! 
! <p>
! We believe <tt>constexpr</tt> literal values should be a more natural expression
  of empty tag types than extern objects as it should improve the
  compiler's ability to optimize the empty object away completely.
  </p>
*************** Summit:
*** 60259,60277 ****
  ]</i></p>
  
  
! <blockquote>
  Move to review. The current specification is a "hack", and the proposed
  specification is a better "hack".
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 64928,64946 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to review. The current specification is a "hack", and the proposed
  specification is a better "hack".
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Tentatively Ready.
*** 60279,60285 ****
  Change the synopsis in 30.4 [thread.mutex]:
  </p>
  
! <blockquote><pre>struct defer_lock_t <ins>{}</ins>;
  struct try_to_lock_t <ins>{}</ins>;
  struct adopt_lock_t <ins>{}</ins>;
  
--- 64948,64955 ----
  Change the synopsis in 30.4 [thread.mutex]:
  </p>
  
! <blockquote><pre>
! struct defer_lock_t <ins>{}</ins>;
  struct try_to_lock_t <ins>{}</ins>;
  struct adopt_lock_t <ins>{}</ins>;
  
*************** struct adopt_lock_t <ins>{}</ins>;
*** 60294,60310 ****
  
  
  <hr>
! <h3><a name="1045"></a>1045. Response to UK 326</h3>
! <p><b>Section:</b> 30.4.2.2.1 [thread.lock.unique.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 326</b></p>
  
  <p>
  The precondition that the mutex is not owned by this thread offers
! introduces the risk of un-necessary undefined behaviour into the
  program. The only time it matters whether the current thread owns the
  mutex is in the lock operation, and that will happen subsequent to
  construction in this case. The lock operation has the identical
--- 64964,64980 ----
  
  
  <hr>
! <h3><a name="1045"></a>1045. Remove unnecessary preconditions from <tt>unique_lock</tt> constructor</h3>
! <p><b>Section:</b> 30.4.2.2.1 [thread.lock.unique.cons] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 326 [CD1]</b></p>
  
  <p>
  The precondition that the mutex is not owned by this thread offers
! introduces the risk of unnecessary undefined behaviour into the
  program. The only time it matters whether the current thread owns the
  mutex is in the lock operation, and that will happen subsequent to
  construction in this case. The lock operation has the identical
*************** Summit:
*** 60318,60335 ****
  ]</i></p>
  
  
! <blockquote>
  Agree, move to review.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 64988,65005 ----
  ]</i></p>
  
  
! <blockquote><p>
  Agree, move to review.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Move to Tentatively Ready.
*** 60337,60347 ****
  Strike 30.4.2.2.1 [thread.lock.unique.cons] p7:
  </p>
  
! <blockquote><pre>unique_lock(mutex_type&amp; m, defer_lock_t);
  </pre>
! <blockquote>
  <del>-7- <i>Precondition:</i> If <tt>mutex_type</tt> is not a recursive mutex
  the calling thread does not own the mutex.</del>
  </blockquote>
  </blockquote>
  
--- 65007,65559 ----
  Strike 30.4.2.2.1 [thread.lock.unique.cons] p7:
  </p>
  
! <blockquote><pre>
! unique_lock(mutex_type&amp; m, defer_lock_t);
  </pre>
! <blockquote><p>
  <del>-7- <i>Precondition:</i> If <tt>mutex_type</tt> is not a recursive mutex
  the calling thread does not own the mutex.</del>
+ </p></blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1046"></a>1046. Provide simple facility to start asynchronous operations</h3>
+ <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures">issues</a> in [futures].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 329 [CD1]</b></p>
+ 
+ <p>
+ <tt>future</tt>, <tt>promise</tt> and <tt>packaged_task</tt> provide a
+ framework for creating future values, but a simple function to tie all
+ three components together is missing. Note that we only need a <em>simple</em>
+ facility for C++0x. Advanced thread pools are to be left for TR2.
+ </p>
+ 
+ <p>
+ Simple Proposal:
+ </p>
+ 
+ <p>
+ Provide a simple function along the lines of: 
+ </p>
+ <blockquote><pre>
+ template&lt; typename F, typename ... Args &gt;
+   requires Callable&lt; F, Args... &gt;
+     future&lt; Callable::result_type &gt; async( F&amp;&amp; f, Args &amp;&amp; ... ); 
+ </pre></blockquote>
+ 
+ <p>
+ Semantics are similar to creating a <tt>thread</tt> object with a <tt>packaged_task</tt>
+ invoking <tt>f</tt> with <tt>forward&lt;Args&gt;(args...)</tt>
+ but details are left unspecified to allow different scheduling and thread
+ spawning implementations. 
+ </p>
+ <p>
+ It is unspecified whether a task submitted to async is run on its own thread
+ or a thread previously used for another async task. If a call to <tt>async</tt>
+ succeeds, it shall be safe to wait for it from any thread. 
+ </p>
+ <p>
+ The state of <tt>thread_local</tt> variables shall be preserved during <tt>async</tt> calls. 
+ </p>
+ <p>
+ No two incomplete async tasks shall see the same value of
+ <tt>this_thread::get_id()</tt>. 
+ </p>
+ <p>
+ [<i>Note:</i> this effectively forces new tasks to be run on a new thread, or a
+ fixed-size pool with no queue. If the 
+ library is unable to spawn a new thread or there are no free worker threads
+ then the <tt>async</tt> call should fail. <i>--end note</i>] 
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ The concurrency subgroup has revisited this issue and decided that it
+ could be considered a defect according to the Kona compromise. A task
+ group was formed lead by Lawrence Crowl and Bjarne Stroustrup to write a
+ paper for Frankfort proposing a simple asynchronous launch facility
+ returning a <tt>future</tt>. It was agreed that the callable must be run on a
+ separate thread from the caller, but not necessarily a brand-new thread.
+ The proposal might or might not allow for an implementation that uses
+ fixed-size or unlimited thread pools.
+ </p>
+ <p>
+ Bjarne in c++std-lib-23121: I think that what we agreed was that to
+ avoid deadlock <tt>async()</tt> would almost certainly be specified to launch in
+ a different thread from the thread that executed <tt>async()</tt>, but I don't
+ think it was a specific design constraint.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Proposed resolution: see
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2996.htm">N2996</a>
+ (Herb's and Lawrence's paper on Async). Move state to <del>NAD editorial</del><ins>Resolved</ins>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1047"></a>1047. Ensure that future's <tt>get()</tt> blocks when not ready</h3>
+ <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 334 [CD1]</b></p>
+ 
+ <p>
+ Behaviour of <tt>get()</tt> is undefined if calling <tt>get()</tt> while
+ not <tt>is_ready()</tt>. The intent is that <tt>get()</tt> is a blocking
+ call, and will wait for the future to become ready.
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Agree, move to Review.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-04-03 Thomas J. Gritzan adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ This issue also applies to <tt>shared_future::get()</tt>.
+ </p>
+ 
+ <p>
+ Suggested wording:
+ </p>
+ 
+ <p>
+ Add a paragraph to 30.6.7 [futures.shared_future]:
+ </p>
+ 
+ <blockquote><pre>
+ void shared_future&lt;void&gt;::get() const;
+ </pre>
+ <blockquote><p>
+ <i>Effects:</i> If <tt>is_ready()</tt> would return <tt>false</tt>, block on the asynchronous 
+ result associated with <tt>*this</tt>.
+ </p></blockquote>
+ </blockquote>
+ </blockquote>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote><p>
+ It is not clear to us that this is an issue,
+ because the proposed resolution's Effects clause seems to duplicate
+ information already present in the Synchronization clause.
+ Keep in Review status.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add a paragraph to 30.6.6 [futures.unique_future]:
+ </p>
+ 
+ <blockquote><pre>
+ R&amp;&amp; unique_future::get(); 
+ R&amp; unique_future&lt;R&amp;&gt;::get(); 
+ void unique_future&lt;void&gt;::get();
+ </pre>
+ <blockquote>
+ <p><i>Note:</i>...</p>
+ <p>
+ <ins><i>Effects:</i> If <tt>is_ready()</tt> would return <tt>false</tt>,
+ block on the asynchronous result associated with <tt>*this</tt>.</ins>
+ </p>
+ <p>
+ <i>Synchronization:</i> if <tt>*this</tt> is associated with a
+ <tt>promise</tt> object, the completion of <tt>set_value()</tt> or
+ <tt>set_exception()</tt> to that <tt>promise</tt> happens before (1.10)
+ <tt>get()</tt> returns.
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1048"></a>1048. Provide empty-state inspection for <tt>std::unique_future</tt></h3>
+ <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 335 [CD1]</b></p>
+ 
+ <p>
+ <tt>std::unique_future</tt> is <tt>MoveConstructible</tt>, so you can transfer the
+ association with an asynchronous result from one instance to another.
+ However, there is no way to determine whether or not an instance has
+ been moved from, and therefore whether or not it is safe to wait for it.
+ </p>
+ 
+ <blockquote><pre>
+ std::promise&lt;int&gt; p;
+ std::unique_future&lt;int&gt; uf(p.get_future());
+ std::unique_future&lt;int&gt; uf2(std::move(uf));
+ uf.wait(); <span style="color:#C80000">// oops, uf has no result to wait for. </span>
+ </pre></blockquote>
+ 
+ <p>
+ Suggest we add a <tt>waitable()</tt> function to <tt>unique_future</tt>
+ (and <tt>shared_future</tt>) akin to <tt>std::thread::joinable()</tt>,
+ which returns <tt>true</tt> if there is an associated result to wait for
+ (whether or not it is ready).
+ </p>
+ 
+ <p>
+ Then we can say:
+ </p>
+ 
+ <blockquote><pre>
+ if(uf.waitable()) uf.wait();
+ </pre></blockquote>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Create an issue. Requires input from Howard. Probably NAD.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ Post Summit, Howard throws in his two cents:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Here is a copy/paste of my last prototype of <tt>unique_future</tt> which was
+ several years ago.  At that time I was calling <tt>unique_future</tt> <tt>future</tt>:
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class R&gt;
+ class future
+ {
+ public:
+     typedef R result_type;
+ private:
+     future(const future&amp;);// = delete;
+     future&amp; operator=(const future&amp;);// = delete;
+ 
+     template &lt;class R1, class F1&gt; friend class prommise;
+ public:
+     future();
+     ~future();
+ 
+     future(future&amp;&amp; f);
+     future&amp; operator=(future&amp;&amp; f);
+ 
+     void swap(future&amp;&amp; f);
+ 
+     <b>bool joinable() const;</b>
+     bool is_normal() const;
+     bool is_exceptional() const;
+     bool is_ready() const;
+ 
+     R get();
+ 
+     void join();
+     template &lt;class ElapsedTime&gt;
+         bool timed_join(const ElapsedTime&amp;);
+ };
+ </pre></blockquote>
+ 
+ <p>
+ <tt>shared_future</tt> had a similar interface.  I intentionally reused
+ the <tt>thread</tt> interface where possible to lessen the learning
+ curve std::lib clients will be faced with.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1049"></a>1049. Move assignment of <tt>promise</tt> inverted</h3>
+ <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 339 [CD1]</b></p>
+ 
+ <p>
+ Move assignment is going in the wrong direction, assigning from
+ <tt>*this</tt> to the passed rvalue, and then returning a reference to
+ an unusable <tt>*this</tt>.
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Agree, move to Review.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote><p>
+ We recommend deferring this issue until after Detlef's paper (on futures)
+ has been issued.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Strike 30.6.5 [futures.promise] p6 and change p7:
+ </p>
+ 
+ <blockquote><pre>
+ promise&amp; operator=(promise&amp;&amp; rhs);
+ </pre>
+ <blockquote>
+ <p>
+ <del>-6- <i>Effects:</i> move assigns its associated state to <tt>rhs</tt>.</del>
+ </p>
+ <p>
+ -7- <i>Postcondition:</i> <del><tt>*this</tt> has no associated
+ state.</del> <ins>associated state of <tt>*this</tt> is the same as the
+ associated state of <tt>rhs</tt> before the call. <tt>rhs</tt> has no
+ associated state.</ins>
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1050"></a>1050. Clarify postconditions for <tt>get_future()</tt></h3>
+ <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 340 [CD1]</b></p>
+ 
+ <p>
+ There is an implied postcondition for <tt>get_future()</tt> that the state of the
+ <tt>promise</tt> is transferred into the <tt>future</tt> leaving the <tt>promise</tt> with no
+ associated state. It should be spelled out.
+ </p>
+ 
+ <p><i>[
+ Summit:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Agree, move to Review.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-04-03 Thomas J. Gritzan adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ <tt>promise::get_future()</tt> must not invalidate the state of the promise object. 
+ </p>
+ <p>
+ A promise is used like this: 
+ </p>
+ <blockquote><pre>
+ promise&lt;int&gt; p; 
+ unique_future&lt;int&gt; f = p.get_future(); 
+ <span style="color:#C80000">// post 'p' to a thread that calculates a value </span>
+ <span style="color:#C80000">// use 'f' to retrieve the value. </span>
+ </pre></blockquote>
+ <p>
+ So <tt>get_future()</tt> must return an object that shares the same associated 
+ state with <tt>*this</tt>. 
+ </p>
+ <p>
+ But still, this function should throw an <tt>future_already_retrieved</tt> error 
+ when it is called twice. 
+ </p>
+ <p>
+ <tt>packaged_task::get_future()</tt> throws <tt>std::bad_function_call</tt> if its <tt>future</tt>
+ was already retrieved. It should throw 
+ <tt>future_error(future_already_retrieved)</tt>, too. 
+ </p>
+ <p>
+ Suggested resolution: 
+ </p>
+ <p>
+ Replace p12/p13 30.6.5 [futures.promise]: 
+ </p>
+ <blockquote>
+ <p>
+ -12- <i>Throws:</i> <tt>future_error</tt> if <del><tt>*this</tt> has no associated state</del>
+ <ins>the <tt>future</tt> has already been retrieved</ins>.
+ </p>
+ <p>
+ -13- <i>Error conditions:</i> <tt>future_already_retrieved</tt> if <del><tt>*this</tt>
+ has no associated state</del>
+ <ins>the <tt>future</tt> associated with 
+ the associated state has already been retrieved</ins>.
+ </p>
+ <p>
+ <ins><i>Postcondition:</i> The returned object and <tt>*this</tt> share the associated state.</ins>
+ </p>
+ </blockquote>
+ <p>
+ Replace p14 30.6.9 [futures.task]: 
+ </p>
+ <blockquote>
+ <p>
+ -14- <i>Throws:</i> <tt><del>std::bad_function_call</del> <ins>future_error</ins></tt> if the future <del>associated with
+ the task</del> has already been retrieved.
+ </p>
+ 
+ <p><ins>
+ <i>Error conditions:</i> <tt>future_already_retrieved</tt> if the <tt>future</tt> associated with 
+ the task has already been retrieved. 
+ </ins></p>
+ <p>
+ <ins><i>Postcondition:</i> The returned object and <tt>*this</tt> share the associated task.</ins>
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote><p>
+ Keep in Review status pending Detlef's forthcoming paper on futures.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add after p13 30.6.5 [futures.promise]:
+ </p>
+ 
+ <blockquote><pre>
+ unique_future&lt;R&gt; get_future();
+ </pre>
+ <blockquote>
+ <p>
+ -13- ...
+ </p>
+ <p>
+ <i>Postcondition:</i> <tt>*this</tt> has no associated state.
+ </p>
  </blockquote>
  </blockquote>
  
*************** the calling thread does not own the mute
*** 60352,60361 ****
  
  <hr>
  <h3><a name="1054"></a>1054. <tt>forward</tt> broken</h3>
! <p><b>Section:</b> 20.3.3 [forward] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 65564,65573 ----
  
  <hr>
  <h3><a name="1054"></a>1054. <tt>forward</tt> broken</h3>
! <p><b>Section:</b> 20.2.4 [forward] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forward">issues</a> in [forward].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** this issue I have not done so yet.
*** 60377,60385 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, awaiting the promised paper.
! </blockquote>
  
  <p><i>[
  2009-08-02 Howard adds:
--- 65589,65598 ----
  Batavia (2009-05):
  ]</i></p>
  
! 
! <blockquote><p>
  Move to Open, awaiting the promised paper.
! </p></blockquote>
  
  <p><i>[
  2009-08-02 Howard adds:
*************** Move to Open, awaiting the promised pape
*** 60391,60397 ****
  My current preferred solution is:
  </p>
  
! <blockquote><pre>template &lt;class T&gt;
  struct __base_type
  {
     typedef typename remove_cv&lt;typename remove_reference&lt;T&gt;::type&gt;::type type;
--- 65604,65611 ----
  My current preferred solution is:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt;
  struct __base_type
  {
     typedef typename remove_cv&lt;typename remove_reference&lt;T&gt;::type&gt;::type type;
*************** Cast an rvalue <tt>t</tt> to an rvalue <
*** 60437,60443 ****
  It disallows:
  </p>
  
! <ol type="a">
  <li>
  Cast an rvalue <tt>t</tt> to an lvalue <tt>T</tt>.
  </li>
--- 65651,65657 ----
  It disallows:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  Cast an rvalue <tt>t</tt> to an lvalue <tt>T</tt>.
  </li>
*************** neither dangerous, nor compelling.  I.e.
*** 60459,60465 ****
  constraint.  Without it, forward would look like:
  </p>
  
! <blockquote><pre>template &lt;class T, class U,
     class = typename enable_if&lt;
         !is_lvalue_reference&lt;T&gt;::value ||
          is_lvalue_reference&lt;T&gt;::value &amp;&amp;
--- 65673,65680 ----
  constraint.  Without it, forward would look like:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class U,
     class = typename enable_if&lt;
         !is_lvalue_reference&lt;T&gt;::value ||
          is_lvalue_reference&lt;T&gt;::value &amp;&amp;
*************** forward(U&amp;&amp; t)
*** 60476,60482 ****
  Or possibly:
  </p>
  
! <blockquote><pre>template &lt;class T, class U,
     class = typename enable_if&lt;
         !is_lvalue_reference&lt;T&gt;::value ||
          is_lvalue_reference&lt;T&gt;::value &amp;&amp;
--- 65691,65698 ----
  Or possibly:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class U,
     class = typename enable_if&lt;
         !is_lvalue_reference&lt;T&gt;::value ||
          is_lvalue_reference&lt;T&gt;::value &amp;&amp;
*************** or non-const lvalue or rvalue, restore t
*** 60513,60519 ****
  actual argument:
  </p>
  
! <blockquote><pre>template &lt;class T&gt;
  void f(T&amp;&amp; x)
  {
      // x is an lvalue here.  If the actual argument to f was an
--- 65729,65736 ----
  actual argument:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt;
  void f(T&amp;&amp; x)
  {
      // x is an lvalue here.  If the actual argument to f was an
*************** Use a simple definition of <tt>forward</
*** 60542,60548 ****
  purpose without complications to accomodate other uses:
  </p>
  
! <blockquote><pre>template &lt;class T, class U&gt;
  T&amp;&amp; forward(U&amp; x)
  {
      return static_cast&lt;T&amp;&amp;&gt;(x);
--- 65759,65766 ----
  purpose without complications to accomodate other uses:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class U&gt;
  T&amp;&amp; forward(U&amp; x)
  {
      return static_cast&lt;T&amp;&amp;&gt;(x);
*************** potential mistakes as possible, by activ
*** 60557,60563 ****
  uses:
  </p>
  
! <blockquote><pre>template &lt;class T, class U&gt;
  boost::enable_if_c&lt;
      // in forward&lt;T&gt;(x), x is a parameter of the caller, thus an lvalue
      is_lvalue_reference&lt;U&gt;::value
--- 65775,65782 ----
  uses:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class U&gt;
  boost::enable_if_c&lt;
      // in forward&lt;T&gt;(x), x is a parameter of the caller, thus an lvalue
      is_lvalue_reference&lt;U&gt;::value
*************** boost::enable_if_c&lt;
*** 60580,60601 ****
  ]</i></p>
  
  
! <blockquote>
  A paper,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2951.html">N2951</a>,
  is available which compares several implementations (including David's) with respect to several
  use cases (including Jason's) and provides wording for one implementation.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2951.html">N2951</a>.
! </blockquote>
  
  
  
--- 65799,65820 ----
  ]</i></p>
  
  
! <blockquote><p>
  A paper,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2951.html">N2951</a>,
  is available which compares several implementations (including David's) with respect to several
  use cases (including Jason's) and provides wording for one implementation.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2951.html">N2951</a>.
! </p></blockquote>
  
  
  
*************** use cases (including Jason's) and provid
*** 60606,60619 ****
  
  
  <hr>
! <h3><a name="1055"></a>1055. Response to UK 98</h3>
! <p><b>Section:</b> 20.7.7.6 [meta.trans.other] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 98</b></p>
  
  <p>
  It would be useful to be able to determine the underlying
--- 65825,65839 ----
  
  
  <hr>
! <h3><a name="1055"></a>1055. Provide a trait that returns the underlying type of an enumeration type</h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  
! <p><b>Addresses UK 98 [CD1]</b></p>
  
  <p>
  It would be useful to be able to determine the underlying
*************** programming with enumerations easier.
*** 60628,60634 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Pete observes (and Tom concurs)
  that the proposed resolution seems to require compiler support
  for its implementation,
--- 65848,65854 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Pete observes (and Tom concurs)
  that the proposed resolution seems to require compiler support
  for its implementation,
*************** then the library might be able to do bet
*** 60641,60660 ****
  but there is no such requirement.
  Keep status as Open
  and solicit input from CWG.
! </blockquote>
  
  <p><i>[
  2009-05-23 Alisdair adds:
  ]</i></p>
  
  
! <blockquote>
  Just to confirm that the BSI originator of this comment assumed it did
  indeed imply a compiler intrinsic.  Rather than request a Core extension, it
  seemed in keeping with that the type traits interface provides a library API
  to unspecified compiler features - where we require several other traits
  (e.g. <tt>has_trivial_*</tt>) to get the 'right' answer now, unlike in TR1.
! </blockquote>
  
  <p><i>[
  Addressed in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2947.html">N2947</a>.
--- 65861,65880 ----
  but there is no such requirement.
  Keep status as Open
  and solicit input from CWG.
! </p></blockquote>
  
  <p><i>[
  2009-05-23 Alisdair adds:
  ]</i></p>
  
  
! <blockquote><p>
  Just to confirm that the BSI originator of this comment assumed it did
  indeed imply a compiler intrinsic.  Rather than request a Core extension, it
  seemed in keeping with that the type traits interface provides a library API
  to unspecified compiler features - where we require several other traits
  (e.g. <tt>has_trivial_*</tt>) to get the 'right' answer now, unlike in TR1.
! </p></blockquote>
  
  <p><i>[
  Addressed in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2947.html">N2947</a>.
*************** Addressed in <a href="http://www.open-st
*** 60666,60687 ****
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2984.html">N2984</a>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new row to the table in 20.7.7.6 [meta.trans.other]:
  </p>
  
  <blockquote>
  <table border="1">
  <caption>Table 41 -- Other transformations</caption>
! <tbody><tr>
  <th>Template</th>
  <th>Condition</th>
  <th>Comments</th>
--- 65886,65907 ----
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2984.htm">N2984</a>.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new row to the table in 20.10.7.6 [meta.trans.other]:
  </p>
  
  <blockquote>
  <table border="1">
  <caption>Table 41 -- Other transformations</caption>
! <tr>
  <th>Template</th>
  <th>Condition</th>
  <th>Comments</th>
*************** The member typedef <tt>type</tt> shall n
*** 60698,60704 ****
  of the enum <tt>T</tt>.
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  
--- 65918,65924 ----
  of the enum <tt>T</tt>.
  </td>
  </tr>
! </table>
  </blockquote>
  
  
*************** of the enum <tt>T</tt>.
*** 60706,60718 ****
  
  
  <hr>
! <h3><a name="1065"></a>1065. Response to UK 168</h3>
! <p><b>Section:</b> 17.6.1.1 [contents] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#contents">issues</a> in [contents].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 168</b></p>
  <p>
  We should make it clear (either by note or normatively) that namespace
  <tt>std</tt> may contain inline namespaces, and that entities specified to be
--- 65926,65938 ----
  
  
  <hr>
! <h3><a name="1065"></a>1065. Allow inline namespaces within namespace <tt>std</tt> for implementations</h3>
! <p><b>Section:</b> 17.6.1.1 [contents] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#contents">issues</a> in [contents].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 168 [CD1]</b></p>
  <p>
  We should make it clear (either by note or normatively) that namespace
  <tt>std</tt> may contain inline namespaces, and that entities specified to be
*************** namespaces nested directly or indirectly
*** 60731,60739 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  adopt UK words (some have reservations whether it is correct)
! </blockquote>
  
  <p><i>[
  2009-05-09 Alisdair improves the wording.
--- 65951,65959 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  adopt UK words (some have reservations whether it is correct)
! </p></blockquote>
  
  <p><i>[
  2009-05-09 Alisdair improves the wording.
*************** Move to Tentatively Ready.
*** 60761,60767 ****
  Change 17.6.1.1 [contents] p2:
  </p>
  
! <blockquote>
  All library entities except macros, <tt>operator new</tt> and
  <tt>operator delete</tt> are defined within the namespace <tt>std</tt> or
  namespaces nested within namespace <tt>std</tt>.
--- 65981,65987 ----
  Change 17.6.1.1 [contents] p2:
  </p>
  
! <blockquote><p>
  All library entities except macros, <tt>operator new</tt> and
  <tt>operator delete</tt> are defined within the namespace <tt>std</tt> or
  namespaces nested within namespace <tt>std</tt>.
*************** namespaces nested within namespace <tt>s
*** 60769,60787 ****
  are declared directly in that namespace, or in an inline namespace inside
  that namespace. [<i>Footnote:</i> This gives implementers freedom to support
  multiple configurations of the library.]</ins>
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1066"></a>1066. Response to UK 189 and JP 27</h3>
! <p><b>Section:</b> 18 [language.support] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 189 and JP 27</b></p>
  <p>
  The addition of the <tt>[[noreturn]]</tt> attribute to the language will be an
  important aid for static analysis tools.
--- 65989,66007 ----
  are declared directly in that namespace, or in an inline namespace inside
  that namespace. [<i>Footnote:</i> This gives implementers freedom to support
  multiple configurations of the library.]</ins>
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1066"></a>1066. Use <tt>[[noreturn]]</tt> attribute in the library</h3>
! <p><b>Section:</b> 18 [language.support] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 189 and JP 27 [CD1]</b></p>
  <p>
  The addition of the <tt>[[noreturn]]</tt> attribute to the language will be an
  important aid for static analysis tools.
*************** The following functions should be declar
*** 60798,60815 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  Agreed.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 66018,66035 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  Agreed.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** Change 18.5 [support.start.term] p3:
*** 60819,60833 ****
  
  <blockquote>
  <p>-2- ...</p>
! <pre><ins>void</ins> abort <ins>[[noreturn]]</ins> (void)
  </pre>
  <p>-3- ...</p>
  <p>-6- ...</p>
! <pre><ins>void</ins> exit<ins> [[noreturn]] </ins>(int status)
  </pre>
  <p>-7- ...</p>
  <p>-11- ...</p>
! <pre>void quick_exit<ins> [[noreturn]] </ins>(int status)
  </pre>
  <p>-12- ...</p>
  </blockquote>
--- 66039,66056 ----
  
  <blockquote>
  <p>-2- ...</p>
! <pre>
! <ins>void</ins> abort <ins>[[noreturn]]</ins> (void)
  </pre>
  <p>-3- ...</p>
  <p>-6- ...</p>
! <pre>
! <ins>void</ins> exit<ins> [[noreturn]] </ins>(int status)
  </pre>
  <p>-7- ...</p>
  <p>-11- ...</p>
! <pre>
! void quick_exit<ins> [[noreturn]] </ins>(int status)
  </pre>
  <p>-12- ...</p>
  </blockquote>
*************** Change 18.5 [support.start.term] p3:
*** 60836,60842 ****
  Change the <tt>&lt;exception&gt;</tt> synopsis in 18.8 [support.exception]:
  </p>
  
! <blockquote><pre>void unexpected<ins> [[noreturn]] </ins>();
  ...
  void terminate<ins> [[noreturn]] </ins>();
  ...
--- 66059,66066 ----
  Change the <tt>&lt;exception&gt;</tt> synopsis in 18.8 [support.exception]:
  </p>
  
! <blockquote><pre>
! void unexpected<ins> [[noreturn]] </ins>();
  ...
  void terminate<ins> [[noreturn]] </ins>();
  ...
*************** template &lt;class T&gt; void throw_with
*** 60846,60876 ****
  </pre></blockquote>
  
  <p>
! Change D.13.3 [unexpected]:
  </p>
  
! <blockquote><pre>void unexpected<ins> [[noreturn]] </ins>();
  </pre></blockquote>
  
  <p>
! Change 18.8.3.3 [terminate]:
  </p>
  
! <blockquote><pre>void terminate<ins> [[noreturn]] </ins>();
  </pre></blockquote>
  
  <p>
  Change 18.8.5 [propagation]:
  </p>
  
! <blockquote><pre>void rethrow_exception<ins> [[noreturn]] </ins>(exception_ptr p);
  </pre></blockquote>
  
  <p>
  In the synopsis of 18.8.6 [except.nested] and the definition area change:
  </p>
  
! <blockquote><pre>template &lt;class T&gt; void throw_with_nested<ins> [[noreturn]] </ins>(T&amp;&amp; t); <del>// [[noreturn]]</del>
  </pre></blockquote>
  
  
--- 66070,66104 ----
  </pre></blockquote>
  
  <p>
! Change D.8.4 [unexpected]:
  </p>
  
! <blockquote><pre>
! void unexpected<ins> [[noreturn]] </ins>();
  </pre></blockquote>
  
  <p>
! Change 18.8.3.4 [terminate]:
  </p>
  
! <blockquote><pre>
! void terminate<ins> [[noreturn]] </ins>();
  </pre></blockquote>
  
  <p>
  Change 18.8.5 [propagation]:
  </p>
  
! <blockquote><pre>
! void rethrow_exception<ins> [[noreturn]] </ins>(exception_ptr p);
  </pre></blockquote>
  
  <p>
  In the synopsis of 18.8.6 [except.nested] and the definition area change:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt; void throw_with_nested<ins> [[noreturn]] </ins>(T&amp;&amp; t); <del>// [[noreturn]]</del>
  </pre></blockquote>
  
  
*************** In the synopsis of 18.8.6 [except.nested
*** 60879,60894 ****
  
  <hr>
  <h3><a name="1070"></a>1070. Ambiguous move overloads in function</h3>
! <p><b>Section:</b> 20.8.14.2 [func.wrap.func] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The synopsis in 20.8.14.2 [func.wrap.func] says:
  </p>
  
! <blockquote><pre>template&lt;Returnable R, CopyConstructible... ArgTypes&gt; 
  class function&lt;R(ArgTypes...)&gt;
  {
      ...
--- 66107,66124 ----
  
  <hr>
  <h3><a name="1070"></a>1070. Ambiguous move overloads in function</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The synopsis in 20.9.12.2 [func.wrap.func] says:
  </p>
  
! <blockquote><pre>
! template&lt;Returnable R, CopyConstructible... ArgTypes&gt; 
  class function&lt;R(ArgTypes...)&gt;
  {
      ...
*************** In the proposed wording I've gotten lazy
*** 60928,60936 ****
  ]</i></p>
  
  
! <blockquote>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1024">1024</a> modifies the second removed constructor.
! </blockquote>
  
  <p><i>[
  Batavia (2009-05):
--- 66158,66166 ----
  ]</i></p>
  
  
! <blockquote><p>
! <a href="lwg-closed.html#1024">1024</a> modifies the second removed constructor.
! </p></blockquote>
  
  <p><i>[
  Batavia (2009-05):
*************** Move to Tentatively Ready.
*** 60949,60959 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis of 20.8.14.2 [func.wrap.func], and remove the associated definitions in
! 20.8.14.2.1 [func.wrap.func.con]:
  </p>
  
! <blockquote><pre>template&lt;Returnable R, CopyConstructible... ArgTypes&gt; 
  class function&lt;R(ArgTypes...)&gt;
  {
      ...
--- 66179,66190 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopsis of 20.9.12.2 [func.wrap.func], and remove the associated definitions in
! 20.9.12.2.1 [func.wrap.func.con]:
  </p>
  
! <blockquote><pre>
! template&lt;Returnable R, CopyConstructible... ArgTypes&gt; 
  class function&lt;R(ArgTypes...)&gt;
  {
      ...
*************** class function&lt;R(ArgTypes...)&gt;
*** 60987,61004 ****
  
  
  <hr>
! <h3><a name="1071"></a>1071. is_bind_expression should derive from integral_constant&lt;bool&gt;</h3>
! <p><b>Section:</b> 20.8.10.1.1 [func.bind.isbind] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.bind.isbind">issues</a> in [func.bind.isbind].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! Class template is_bind_expression 20.8.10.1.1 [func.bind.isbind]:
  </p>
  
! <blockquote><pre>namespace std {
    template&lt;class T&gt; struct is_bind_expression {
      static const bool value = see below;
    };
--- 66218,66236 ----
  
  
  <hr>
! <h3><a name="1071"></a>1071. <tt>is_bind_expression</tt> should derive from <tt>integral_constant&lt;bool&gt;</tt></h3>
! <p><b>Section:</b> 20.9.10.1 [func.bind.isbind] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.bind.isbind">issues</a> in [func.bind.isbind].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! Class template is_bind_expression 20.9.10.1 [func.bind.isbind]:
  </p>
  
! <blockquote><pre>
! namespace std {
    template&lt;class T&gt; struct is_bind_expression {
      static const bool value = see below;
    };
*************** other similar trait types.
*** 61013,61021 ****
  Daniel adds:
  ]</i></p>
  
! <blockquote>
  We need the same thing for the trait <tt>is_placeholder</tt> as well.
! </blockquote>
  <p><i>[
  2009-03-22 Daniel provided wording.
  ]</i></p>
--- 66245,66253 ----
  Daniel adds:
  ]</i></p>
  
! <blockquote><p>
  We need the same thing for the trait <tt>is_placeholder</tt> as well.
! </p></blockquote>
  <p><i>[
  2009-03-22 Daniel provided wording.
  ]</i></p>
*************** alone.
*** 61067,61076 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Tentatively Ready.  We are comfortable with requiring user specializations
  to derive from <tt>integral_constant</tt>.
! </blockquote>
  
  
  
--- 66299,66308 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Tentatively Ready.  We are comfortable with requiring user specializations
  to derive from <tt>integral_constant</tt>.
! </p></blockquote>
  
  
  
*************** to derive from <tt>integral_constant</tt
*** 61078,61086 ****
  <ol>
  <li>
  <p>
! In 20.8.10.1.1 [func.bind.isbind] change as indicated:
  </p>
! <blockquote><pre>namespace std {
   template&lt;class T&gt; struct is_bind_expression <ins>: integral_constant&lt;bool, <i>see below</i>&gt; { };</ins><del>{
     static const bool value = <i>see below</i>;
   };</del>
--- 66310,66319 ----
  <ol>
  <li>
  <p>
! In 20.9.10.1 [func.bind.isbind] change as indicated:
  </p>
! <blockquote><pre>
! namespace std {
   template&lt;class T&gt; struct is_bind_expression <ins>: integral_constant&lt;bool, <i>see below</i>&gt; { };</ins><del>{
     static const bool value = <i>see below</i>;
   };</del>
*************** In 20.8.10.1.1 [func.bind.isbind] change
*** 61089,61113 ****
  </li>
  <li>
  <p>
! In 20.8.10.1.1 [func.bind.isbind]/2 change as indicated:
  </p>
! <blockquote><pre><del>static const bool value;</del>
  </pre>
! <blockquote>
  -2- <del><tt>true</tt> if <tt>T</tt> is a type returned from <tt>bind</tt>, <tt>false</tt> otherwise.</del>
    <ins>If <tt>T</tt> is a type returned from <tt>bind</tt>, <tt>is_bind_expression&lt;T&gt;</tt> shall
  be publicly derived from
          <tt>integral_constant&lt;bool, true&gt;</tt>, otherwise it shall be
  publicly derived from
            <tt>integral_constant&lt;bool, false&gt;</tt>.</ins>
! </blockquote>
  </blockquote>
  </li>
  <li>
  <p>
! In  [func.bind.isplace] change as indicated:
  </p>
! <blockquote><pre>namespace std {
   template&lt;class T&gt; struct is_placeholder <ins>: integral_constant&lt;int, <i>see below</i>&gt; { };</ins><del>{
     static const int value = <i>see below</i>;
   };</del>
--- 66322,66348 ----
  </li>
  <li>
  <p>
! In 20.9.10.1 [func.bind.isbind]/2 change as indicated:
  </p>
! <blockquote><pre>
! <del>static const bool value;</del>
  </pre>
! <blockquote><p>
  -2- <del><tt>true</tt> if <tt>T</tt> is a type returned from <tt>bind</tt>, <tt>false</tt> otherwise.</del>
    <ins>If <tt>T</tt> is a type returned from <tt>bind</tt>, <tt>is_bind_expression&lt;T&gt;</tt> shall
  be publicly derived from
          <tt>integral_constant&lt;bool, true&gt;</tt>, otherwise it shall be
  publicly derived from
            <tt>integral_constant&lt;bool, false&gt;</tt>.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  <li>
  <p>
! In 20.9.10.2 [func.bind.isplace] change as indicated:
  </p>
! <blockquote><pre>
! namespace std {
   template&lt;class T&gt; struct is_placeholder <ins>: integral_constant&lt;int, <i>see below</i>&gt; { };</ins><del>{
     static const int value = <i>see below</i>;
   };</del>
*************** In  [func.bind.isplace] change as indica
*** 61116,61133 ****
  </li>
  <li>
  <p>
! In  [func.bind.isplace]/2 change as indicated:
  </p>
! <blockquote><pre><del>static const int value;</del>
  </pre>
! <blockquote>
  -2- <del>value is <tt>J</tt> if <tt>T</tt> is the type of <tt>std::placeholders::_J</tt>, 0 otherwise.</del>
    <ins>If <tt>T</tt> is the type of <tt>std::placeholders::_J</tt>, <tt>is_placeholder&lt;T&gt;</tt>
  shall be publicly
            derived from <tt>integral_constant&lt;int, J&gt;</tt> otherwise it shall
  be publicly derived
            from <tt>integral_constant&lt;int, 0&gt;</tt>.</ins>
! </blockquote>
  </blockquote>
  </li>
  </ol>
--- 66351,66369 ----
  </li>
  <li>
  <p>
! In 20.9.10.2 [func.bind.isplace]/2 change as indicated:
  </p>
! <blockquote><pre>
! <del>static const int value;</del>
  </pre>
! <blockquote><p>
  -2- <del>value is <tt>J</tt> if <tt>T</tt> is the type of <tt>std::placeholders::_J</tt>, 0 otherwise.</del>
    <ins>If <tt>T</tt> is the type of <tt>std::placeholders::_J</tt>, <tt>is_placeholder&lt;T&gt;</tt>
  shall be publicly
            derived from <tt>integral_constant&lt;int, J&gt;</tt> otherwise it shall
  be publicly derived
            from <tt>integral_constant&lt;int, 0&gt;</tt>.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  </ol>
*************** be publicly derived
*** 61138,61147 ****
  
  <hr>
  <h3><a name="1073"></a>1073. Declaration of <tt>allocator_arg</tt> should be <tt>constexpr</tt></h3>
! <p><b>Section:</b> 20.9 [memory] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#memory">issues</a> in [memory].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 66374,66383 ----
  
  <hr>
  <h3><a name="1073"></a>1073. Declaration of <tt>allocator_arg</tt> should be <tt>constexpr</tt></h3>
! <p><b>Section:</b> 20.7 [memory] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#memory">issues</a> in [memory].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** initialization.
*** 61153,61169 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.  Move to Tentatively Ready.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9 [memory] p2:
  </p>
  
! <blockquote><pre>// 20.8.1, allocator argument tag
  struct allocator_arg_t { };
  const<ins>expr</ins> allocator_arg_t allocator_arg = allocator_arg_t();
  </pre></blockquote>
--- 66389,66406 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.  Move to Tentatively Ready.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.7 [memory] p2:
  </p>
  
! <blockquote><pre>
! // 20.8.1, allocator argument tag
  struct allocator_arg_t { };
  const<ins>expr</ins> allocator_arg_t allocator_arg = allocator_arg_t();
  </pre></blockquote>
*************** const<ins>expr</ins> allocator_arg_t all
*** 61174,61195 ****
  
  
  <hr>
! <h3><a name="1075"></a>1075. Response to US 65, US 74.1</h3>
! <p><b>Section:</b> 20 [utilities], 23 [containers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alan Talbot <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utilities">issues</a> in [utilities].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US 65 and US 74.1</b></p>
  
  <p>US 65:</p>
  
! <blockquote>
  Scoped allocators and allocator propagation traits add a small amount of
  utility at the cost of a great deal of machinery. The machinery is user
  visible, and it extends to library components that don't have any
  obvious connection to allocators, including basic concepts and simple
  components like <tt>pair</tt> and <tt>tuple</tt>.
  
  <p>Suggested resolution:</p>
  
--- 66411,66433 ----
  
  
  <hr>
! <h3><a name="1075"></a>1075. Scoped allocators are too complex</h3>
! <p><b>Section:</b> 20 [utilities], 23 [containers] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alan Talbot <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utilities">issues</a> in [utilities].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses US 65 and US 74.1 [CD1]</b></p>
  
  <p>US 65:</p>
  
! <blockquote><p>
  Scoped allocators and allocator propagation traits add a small amount of
  utility at the cost of a great deal of machinery. The machinery is user
  visible, and it extends to library components that don't have any
  obvious connection to allocators, including basic concepts and simple
  components like <tt>pair</tt> and <tt>tuple</tt>.
+ </p>
  
  <p>Suggested resolution:</p>
  
*************** components that don't explicitly allocat
*** 61201,61209 ****
  container interfaces to reflect this simplification.
  </p>
  <p>
! Components that I propose eliminating include HasAllocatorType,
! is_scoped_allocator, allocator_propagation_map, scoped_allocator_adaptor,
! and ConstructibleAsElement.
  </p>
  </blockquote>
  
--- 66439,66447 ----
  container interfaces to reflect this simplification.
  </p>
  <p>
! Components that I propose eliminating include <tt>HasAllocatorType</tt>,
! <tt>is_scoped_allocator</tt>, <tt>allocator_propagation_map</tt>, <tt>scoped_allocator_adaptor</tt>,
! and <tt>ConstructibleAsElement</tt>.
  </p>
  </blockquote>
  
*************** Some evidence of the complexity introduc
*** 61231,61237 ****
  </p>
  <blockquote>
  <p>
! 20.3.5 [pairs], 20.4 [tuple]: Large increase in the
  number of pair and tuple constructors.
  </p>
  <p>
--- 66469,66475 ----
  </p>
  <blockquote>
  <p>
! 20.3 [pairs], 20.4 [tuple]: Large increase in the
  number of pair and tuple constructors.
  </p>
  <p>
*************** includes at least the following changes:
*** 61250,61256 ****
  Remove X [allocator.element.concepts]
  </p>
  <p>
! Remove 20.10 [allocator.adaptor]
  </p>
  <p>
  Remove  [construct.element]
--- 66488,66494 ----
  Remove X [allocator.element.concepts]
  </p>
  <p>
! Remove 20.13 [allocator.adaptor]
  </p>
  <p>
  Remove  [construct.element]
*************** bullet) but we do want to allow explicit
*** 61285,61292 ****
  following example shows:
  </p>
  
! <blockquote><pre>vector&lt;shared_ptr&lt;int&gt;&gt; v;
! v.emplace_back(new int); <font color="#C80000">// should be allowed</font>
  </pre></blockquote>
  
  <p>
--- 66523,66531 ----
  following example shows:
  </p>
  
! <blockquote><pre>
! vector&lt;shared_ptr&lt;int&gt;&gt; v;
! v.emplace_back(new int); <span style="color:#C80000">// should be allowed</span>
  </pre></blockquote>
  
  <p>
*************** If the issue is accepted and scoped allo
*** 61294,61300 ****
  add a new pair of concepts to  [concept.construct], namely:
  </p>
  
! <blockquote><pre>auto concept HasExplicitConstructor&lt;typename T, typename... Args&gt; {
   explicit T::T(Args...);
  }
  
--- 66533,66540 ----
  add a new pair of concepts to  [concept.construct], namely:
  </p>
  
! <blockquote><pre>
! auto concept HasExplicitConstructor&lt;typename T, typename... Args&gt; {
   explicit T::T(Args...);
  }
  
*************** For coherence and consistency with the s
*** 61313,61319 ****
  <tt>Constructible</tt> to:
  </p>
  
! <blockquote><pre>auto concept Constructible&lt;typename T, typename... Args&gt;
   : HasConstructor&lt;T, Args...&gt;, ExplicitConstructible&lt;T, Args...&gt;
  { }
  </pre></blockquote>
--- 66553,66560 ----
  <tt>Constructible</tt> to:
  </p>
  
! <blockquote><pre>
! auto concept Constructible&lt;typename T, typename... Args&gt;
   : HasConstructor&lt;T, Args...&gt;, ExplicitConstructible&lt;T, Args...&gt;
  { }
  </pre></blockquote>
*************** On the other hand, if the issue is not a
*** 61329,61338 ****
  adaptors should be fixed because the following code:
  </p>
  
! <blockquote><pre>template &lt;typename T&gt; using scoped_allocator = scoped_allocator_adaptor&lt;allocator&lt;T&gt;&gt;;
  
  vector&lt;shared_ptr&lt;int&gt;, scoped_allocator&lt;shared_ptr&lt;int&gt;&gt;&gt; v;
! v.emplace_back(new int); <font color="#C80000">// ops! doesn't compile</font>
  </pre></blockquote>
  
  <p>
--- 66570,66580 ----
  adaptors should be fixed because the following code:
  </p>
  
! <blockquote><pre>
! template &lt;typename T&gt; using scoped_allocator = scoped_allocator_adaptor&lt;allocator&lt;T&gt;&gt;;
  
  vector&lt;shared_ptr&lt;int&gt;, scoped_allocator&lt;shared_ptr&lt;int&gt;&gt;&gt; v;
! v.emplace_back(new int); <span style="color:#C80000">// ops! doesn't compile</span>
  </pre></blockquote>
  
  <p>
*************** requires a disposition that addresses th
*** 61360,61366 ****
  <p>
  The notes in the NB comment list (US 65 &amp; US 74.1) say that:
  </p>
! <ol type="a">
  <li>
  this issue has not introduced any new arguments not previously discussed,
  </li>
--- 66602,66608 ----
  <p>
  The notes in the NB comment list (US 65 &amp; US 74.1) say that:
  </p>
! <ol style="list-style-type:lower-alpha">
  <li>
  this issue has not introduced any new arguments not previously discussed,
  </li>
*************** the issue is resolved by
*** 61375,61381 ****
  <p>
  My opinion is:
  </p>
! <ol type="a">
  <li>
  there are new arguments in both comments regarding concepts (which were
  not present in the library when the scoped allocator proposal was voted
--- 66617,66623 ----
  <p>
  My opinion is:
  </p>
! <ol style="list-style-type:lower-alpha">
  <li>
  there are new arguments in both comments regarding concepts (which were
  not present in the library when the scoped allocator proposal was voted
*************** rather than later so there is more time
*** 61410,61419 ****
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </blockquote>
  
  
  
--- 66652,66661 ----
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </p></blockquote>
  
  
  
*************** rather than later so there is more time
*** 61421,61427 ****
--- 66663,66671 ----
  
  
  <p><b>Rationale:</b></p>
+ <p>
  Scoped allocators have been revised significantly.
+ </p>
  
  
  
*************** Scoped allocators have been revised sign
*** 61429,61438 ****
  
  <hr>
  <h3><a name="1079"></a>1079. UK-265: <code>RandomAccessIterator</code>'s <code>operator-</code> has nonsensical effects clause</h3>
! <p><b>Section:</b> 24.2.7 [random.access.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#random.access.iterators">issues</a> in [random.access.iterators].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 265</b></p>
  
--- 66673,66682 ----
  
  <hr>
  <h3><a name="1079"></a>1079. UK-265: <code>RandomAccessIterator</code>'s <code>operator-</code> has nonsensical effects clause</h3>
! <p><b>Section:</b> 24.2.7 [random.access.iterators] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2009-03-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#random.access.iterators">issues</a> in [random.access.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 265</b></p>
  
*************** For random access iterators, the definit
*** 61458,61464 ****
  From table Table 104 -- Random access iterator requirements:
  </p>
  
! <blockquote><pre>b - a :==&gt;  (a &lt; b) ? distance(a,b) : -distance(b,a)
  
  a &lt; b :==&gt;  b - a &gt; 0
  </pre></blockquote>
--- 66702,66709 ----
  From table Table 104 -- Random access iterator requirements:
  </p>
  
! <blockquote><pre>
! b - a :==&gt;  (a &lt; b) ? distance(a,b) : -distance(b,a)
  
  a &lt; b :==&gt;  b - a &gt; 0
  </pre></blockquote>
*************** a &lt; b :==&gt;  b - a &gt; 0
*** 61469,61477 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  <p><i>[
  2010-02-13 Alisdair opens.
--- 66714,66722 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  <p><i>[
  2010-02-13 Alisdair opens.
*************** Moved to Ready.
*** 61480,61486 ****
  
  <blockquote>
  <p>
! Looking again at LWG #1079, the wording in the issue no longer exists, and
  appears to be entirely an artefact of the concepts wording.
  </p>
  
--- 66725,66731 ----
  
  <blockquote>
  <p>
! Looking again at LWG <a href="lwg-defects.html#1079">1079</a>, the wording in the issue no longer exists, and
  appears to be entirely an artefact of the concepts wording.
  </p>
  
*************** The previous wording is preserved here:
*** 61510,61524 ****
  
  <p>Modify 24.2.7 [random.access.iterators]p7-9 as follows:</p>
  
! <blockquote><pre>difference_type operator-(const X&amp; a, const X&amp; b);
  </pre>
! <ol start="7">
!   <li><i>Precondition</i>: there exists a value <code>n</code> of
!   <code>difference_type</code> such that <code>a == b + n</code>.</li>
!   <li><del><i>Effects</i>: <code>b == a + (b - a)</code></del></li>
!   <li><i>Returns</i>: <del><code>(a &lt; b) ? distance(a,b) :
!   -distance(b,a)</code></del><ins><code>n</code></ins></li>
! </ol>
  </blockquote>
  
  </blockquote>
--- 66755,66772 ----
  
  <p>Modify 24.2.7 [random.access.iterators]p7-9 as follows:</p>
  
! <blockquote><pre>
! difference_type operator-(const X&amp; a, const X&amp; b);
  </pre>
! <blockquote><p>
!   -7- <i>Precondition</i>: there exists a value <code>n</code> of
!   <code>difference_type</code> such that <code>a == b + n</code>.
!   <p/>
!   -8- <del><i>Effects</i>: <code>b == a + (b - a)</code></del>
!   <p/>
!   -9- <i>Returns</i>: <del><code>(a &lt; b) ? distance(a,b) :
!   -distance(b,a)</code></del><ins><code>n</code></ins>
! </p></blockquote>
  </blockquote>
  
  </blockquote>
*************** The previous wording is preserved here:
*** 61529,61537 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready for Pittsburgh.
! </blockquote>
  
  
  
--- 66777,66785 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready for Pittsburgh.
! </p></blockquote>
  
  
  
*************** Modify Table 105 in 24.2.7 [random.acces
*** 61542,61555 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 105 — Random access iterator requirements (in addition to
  bidirectional iterator)</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  </tr>
  
  <tr>
--- 66790,66803 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 105 &mdash; Random access iterator requirements (in addition to
  bidirectional iterator)</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
! <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
  </tr>
  
  <tr>
*************** bidirectional iterator)</caption>
*** 61561,61567 ****
  n == b</tt>. <tt>b == a + (b - a)</tt>.</td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  
--- 66809,66815 ----
  n == b</tt>. <tt>b == a + (b - a)</tt>.</td>
  </tr>
  
! </table>
  </blockquote>
  
  
*************** n == b</tt>. <tt>b == a + (b - a)</tt>.<
*** 61569,61581 ****
  
  
  <hr>
! <h3><a name="1089"></a>1089. Response to JP 76</h3>
! <p><b>Section:</b> 30 [thread] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread">issues</a> in [thread].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses JP 76</b></p>
  
  <p>
  A description for "Throws: Nothing." are not unified.
--- 66817,66929 ----
  
  
  <hr>
! <h3><a name="1088"></a>1088. <tt>std::promise</tt> should provide non-member <tt>swap</tt> overload</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses UK 342 [CD1]</b></p>
! 
! <p>
! <tt>std::promise</tt> is missing a non-member overload of <tt>swap</tt>. This is
! inconsistent with other types that provide a <tt>swap</tt> member function.
! </p>
! 
! <p>
! Add a non-member overload <tt>void swap(promise&amp;&amp; x,promise&amp;&amp; y){ x.swap(y); }</tt>
! </p>
! 
! <p><i>[
! Summit:
! ]</i></p>
! 
! <blockquote><p>
! Create an issue. Move to review, attention: Howard. Detlef will also look into it.
! </p></blockquote>
! 
! <p><i>[
! Post Summit Daniel provided wording.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>
! In 30.6.5 [futures.promise], before p.1, immediately after class template
! promise add:
! </p>
! <blockquote><pre>
! <ins>
! template &lt;class R&gt;
! void swap(promise&lt;R&gt;&amp; x, promise&lt;R&gt;&amp; y);
! </ins>
! </pre></blockquote>
! </li>
! <li>
! <p>
! Change 30.6.5 [futures.promise]/10 as indicated (to fix a circular definition):
! </p>
! <blockquote>
! <p>
! -10- <i>Effects:</i> <del>swap(*this, other)</del><ins>Swaps the associated state
! of <tt>*this</tt> and <tt>other</tt></ins>
! </p>
! <p>
! <ins><i>Throws:</i> Nothing.</ins>
! </p>
! </blockquote>
! </li>
! <li>
! <p>
! After the last paragraph in 30.6.5 [futures.promise] add the following
! prototype description:
! </p>
! <blockquote><pre>
! <ins>
! template &lt;class R&gt;
! void swap(promise&lt;R&gt;&amp; x, promise&lt;R&gt;&amp; y);
! </ins></pre>
! <blockquote>
! <p>
! <ins><i>Effects:</i> <tt>x.swap(y)</tt></ins>
! </p>
! <p>
! <ins><i>Throws:</i> Nothing.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1089"></a>1089. Unify "Throws: Nothing." specifications</h3>
! <p><b>Section:</b> 30 [thread] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread">issues</a> in [thread].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses JP 76 [CD1]</b></p>
  
  <p>
  A description for "Throws: Nothing." are not unified.
*************** Add "Throws: Nothing." to the following.
*** 61611,61619 ****
  Summit:
  ]</i></p>
  
! <blockquote>
  Pass on to editor.
! </blockquote>
  
  <p><i>[
  Post Summit:  Editor declares this non-editorial.
--- 66959,66967 ----
  Summit:
  ]</i></p>
  
! <blockquote><p>
  Pass on to editor.
! </p></blockquote>
  
  <p><i>[
  Post Summit:  Editor declares this non-editorial.
*************** It can call a function which never retur
*** 61649,61657 ****
  It can throw an exception.
  </li>
  </ol>
! 
  The above list can be abbreviated with:
! 
  <ol>
  <li><b>R</b>eturns.</li>
  <li><b>E</b>nds program.</li>
--- 66997,67005 ----
  It can throw an exception.
  </li>
  </ol>
! <p>
  The above list can be abbreviated with:
! </p>
  <ol>
  <li><b>R</b>eturns.</li>
  <li><b>E</b>nds program.</li>
*************** function.  It may return, it may end the
*** 61679,61685 ****
  specify a function with an empty throw spec:
  </p>
  
! <blockquote><pre>void f() throw();
  </pre></blockquote>
  
  <p>
--- 67027,67034 ----
  specify a function with an empty throw spec:
  </p>
  
! <blockquote><pre>
! void f() throw();
  </pre></blockquote>
  
  <p>
*************** allow these functions to throw:
*** 61713,61719 ****
  Add a paragraph under 30.4.2.1 [thread.lock.guard] p4:
  </p>
  
! <blockquote><pre>explicit lock_guard(mutex_type&amp; m);
  </pre>
  
  <p><ins>
--- 67062,67069 ----
  Add a paragraph under 30.4.2.1 [thread.lock.guard] p4:
  </p>
  
! <blockquote><pre>
! explicit lock_guard(mutex_type&amp; m);
  </pre>
  
  <p><ins>
*************** Add a paragraph under 30.4.2.1 [thread.l
*** 61725,61731 ****
  Add a paragraph under 30.4.2.2.1 [thread.lock.unique.cons] p6:
  </p>
  
! <blockquote><pre>explicit unique_lock(mutex_type&amp; m);
  </pre>
  
  <p><ins>
--- 67075,67082 ----
  Add a paragraph under 30.4.2.2.1 [thread.lock.unique.cons] p6:
  </p>
  
! <blockquote><pre>
! explicit unique_lock(mutex_type&amp; m);
  </pre>
  
  <p><ins>
*************** Add a paragraph under 30.4.2.2.1 [thread
*** 61737,61743 ****
  Add a paragraph under 30.5.2 [thread.condition.condvarany] p19, p21 and p25:
  </p>
  
! <blockquote><pre>template &lt;class Lock, class Rep, class Period&gt; 
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
  
--- 67088,67095 ----
  Add a paragraph under 30.5.2 [thread.condition.condvarany] p19, p21 and p25:
  </p>
  
! <blockquote><pre>
! template &lt;class Lock, class Rep, class Period&gt; 
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
  
*************** Add a paragraph under 30.5.2 [thread.con
*** 61746,61752 ****
  </ins></p>
  </blockquote>
  
! <blockquote><pre>template &lt;class Lock, class Duration, class Predicate&gt; 
    bool wait_until(Lock&amp; lock, const chrono::time_point&lt;Clock, Duration&gt;&amp; rel_time, Predicate pred);
  </pre>
  
--- 67098,67105 ----
  </ins></p>
  </blockquote>
  
! <blockquote><pre>
! template &lt;class Lock, class Duration, class Predicate&gt; 
    bool wait_until(Lock&amp; lock, const chrono::time_point&lt;Clock, Duration&gt;&amp; rel_time, Predicate pred);
  </pre>
  
*************** Add a paragraph under 30.5.2 [thread.con
*** 61755,61761 ****
  </ins></p>
  </blockquote>
  
! <blockquote><pre>template &lt;class Lock, class Rep, class Period, class Predicate&gt; 
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, Predicate pred);
  </pre>
  
--- 67108,67115 ----
  </ins></p>
  </blockquote>
  
! <blockquote><pre>
! template &lt;class Lock, class Rep, class Period, class Predicate&gt; 
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, Predicate pred);
  </pre>
  
*************** Add a paragraph under 30.5.2 [thread.con
*** 61773,61781 ****
  ]</i></p>
  
  
! <blockquote>
  Defer pending further developments with exception restriction annotations.
! </blockquote>
  
  <p><i>[
  2010-02-11 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
--- 67127,67135 ----
  ]</i></p>
  
  
! <blockquote><p>
  Defer pending further developments with exception restriction annotations.
! </p></blockquote>
  
  <p><i>[
  2010-02-11 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
*************** Defer pending further developments with
*** 61787,61808 ****
  ]</i></p>
  
  
! <blockquote>
  A "<i>Throws:</i> Nothing" specification is not the place to say that a function
  is not allowed to call <tt>exit()</tt>. While I agree with the thrust of the
  proposed resolution, "doesn't throw exceptions" is a subset of "always returns
  normally". If it's important to say that most library functions don't call
  <tt>exit()</tt>, say so.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready except for the added paragraph to 17.5.1.4 [structure.specifications].
! </blockquote>
  
  
  
--- 67141,67162 ----
  ]</i></p>
  
  
! <blockquote><p>
  A "<i>Throws:</i> Nothing" specification is not the place to say that a function
  is not allowed to call <tt>exit()</tt>. While I agree with the thrust of the
  proposed resolution, "doesn't throw exceptions" is a subset of "always returns
  normally". If it's important to say that most library functions don't call
  <tt>exit()</tt>, say so.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready except for the added paragraph to 17.5.1.4 [structure.specifications].
! </p></blockquote>
  
  
  
*************** Move to Ready except for the added parag
*** 61813,61819 ****
  Add a paragraph under 30.3.1.6 [thread.thread.static] p1:
  </p>
  
! <blockquote><pre>unsigned hardware_concurrency();
  </pre>
  
  <p>
--- 67167,67174 ----
  Add a paragraph under 30.3.1.6 [thread.thread.static] p1:
  </p>
  
! <blockquote><pre>
! unsigned hardware_concurrency();
  </pre>
  
  <p>
*************** Add a paragraph under 30.5.1 [thread.con
*** 61835,61844 ****
  </p>
  <dl>
  <dt><i>[EINVAL]</i></dt>
! <dd><i>The value <tt>cond</tt> does not refer to an initialized condition variable. — end informational]</i></dd>
  </dl>
  
! <pre>void notify_one();
  </pre>
  
  <p>
--- 67190,67200 ----
  </p>
  <dl>
  <dt><i>[EINVAL]</i></dt>
! <dd><i>The value <tt>cond</tt> does not refer to an initialized condition variable. &mdash; end informational]</i></dd>
  </dl>
  
! <pre>
! void notify_one();
  </pre>
  
  <p>
*************** Add a paragraph under 30.5.1 [thread.con
*** 61850,61856 ****
  </ins></p>
  </blockquote>
  
! <blockquote><pre>void notify_all();
  </pre>
  
  <p>
--- 67206,67213 ----
  </ins></p>
  </blockquote>
  
! <blockquote><pre>
! void notify_all();
  </pre>
  
  <p>
*************** Add a paragraph under 30.5.2 [thread.con
*** 61868,61874 ****
  </p>
  
  <blockquote>
! <pre>void notify_one();
  </pre>
  
  <p>
--- 67225,67232 ----
  </p>
  
  <blockquote>
! <pre>
! void notify_one();
  </pre>
  
  <p>
*************** Add a paragraph under 30.5.2 [thread.con
*** 61880,61886 ****
  </ins></p>
  </blockquote>
  
! <blockquote><pre>void notify_all();
  </pre>
  
  <p>
--- 67238,67245 ----
  </ins></p>
  </blockquote>
  
! <blockquote><pre>
! void notify_all();
  </pre>
  
  <p>
*************** Add a paragraph under 30.5.2 [thread.con
*** 61899,61911 ****
  
  
  <hr>
! <h3><a name="1094"></a>1094. Response to JP 65 and JP 66</h3>
! <p><b>Section:</b> 27.5.4.3 [iostate.flags] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-24 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses JP 65 and JP 66</b></p>
  
  <p>
  Switch from "unspecified-bool-type" to "explicit operator bool() const". 
--- 67258,67528 ----
  
  
  <hr>
! <h3><a name="1090"></a>1090. Missing description of <tt>packaged_task</tt> member <tt>swap</tt>,  missing non-member <tt>swap</tt></h3>
! <p><b>Section:</b> 30.6.9 [futures.task] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task">issues</a> in [futures.task].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
! <p>
! Class template <tt>packaged_task</tt> in 30.6.9 [futures.task] shows a member <tt>swap</tt>
! declaration, but misses to document it's effects (No prototype provided). Further on this class
! misses to provide a non-member swap.
! </p>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote>
! <p>
! Alisdair notes that paragraph 2 of the proposed resolution has already been
! applied in the current Working Draft.
! </p>
! <p>
! We note a pending <tt>future</tt>-related paper by Detlef;
! we would like to wait for this paper before proceeding.
! </p>
! <p>
! Move to Open.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-05-24 Daniel removed part 2 of the proposed resolution.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-10 post-Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! Move to Tentatively Ready, removing bullet 3 from the proposed
! resolution but keeping the other two bullets.
! </p></blockquote>
! 
! <p><i>[
! 2010 Pittsburgh:
! ]</i></p>
! 
! 
! <blockquote><p>
! Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
! </p></blockquote>
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>
! In 30.6.9 [futures.task], immediately after the definition of class
! template packaged_task add:
! </p>
! <blockquote><pre>
! <ins>
! template&lt;class R, class... Argtypes&gt;
! void swap(packaged_task&lt;R(ArgTypes...)&gt;&amp;, packaged_task&lt;R(ArgTypes...)&gt;&amp;);
! </ins>
! </pre></blockquote>
! </li>
! <li>
! <p>
! At the end of 30.6.9 [futures.task] (after p. 20), add the following
! prototype description:
! </p>
! 
! <blockquote><pre>
! <ins>
! template&lt;class R, class... Argtypes&gt;
! void swap(packaged_task&lt;R(ArgTypes...)&gt;&amp; x, packaged_task&lt;R(ArgTypes...)&gt;&amp; y);
! </ins></pre>
! <blockquote>
! <p><ins>
! <i>Effects:</i> <tt>x.swap(y)</tt>
! </ins></p>
! <p><ins>
! <i>Throws:</i> Nothing.
! </ins></p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1093"></a>1093. Multiple definitions for <tt>random_shuffle</tt> algorithm</h3>
! <p><b>Section:</b> 25.3.12 [alg.random.shuffle] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-03-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.random.shuffle">issues</a> in [alg.random.shuffle].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! There are a couple of issues with the declaration of the <tt>random_shuffle</tt>
! algorithm accepting a random number engine.
! </p>
! 
! <ol style="list-style-type:lower-roman">
! <li>
! The Iterators must be shuffle iterators, yet this requirement is missing.
! </li>
! <li>
! The <tt>RandomNumberEngine</tt> concept is now provided by the random number
! library
! (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2836.pdf">n2836</a>)
! and the placeholder should be removed.
! </li>
! </ol>
! 
! <p><i>[
! 2009-05-02 Daniel adds:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! this issue completes adding necessary requirement to the
! third new <tt>random_shuffle</tt> overload. The current suggestion is:
! </p>
! 
! <blockquote><pre>
! template&lt;RandomAccessIterator Iter, UniformRandomNumberGenerator Rand&gt;
! requires ShuffleIterator&lt;Iter&gt;
! void random_shuffle(Iter first, Iter last, Rand&amp;&amp; g);
! </pre></blockquote>
! 
! <p>
! IMO this is still insufficient and I suggest to add the requirement
! </p>
! <blockquote><pre>
! Convertible&lt;Rand::result_type, Iter::difference_type&gt;
! </pre></blockquote>
! <p>
! to the list (as the two other overloads already have).
! </p>
! 
! <p>
! Rationale:
! </p>
! 
! <blockquote>
! <p>
! Its true that this third overload is somewhat different from the remaining
! two. Nevertheless we know from <tt>UniformRandomNumberGenerator</tt>, that
! it's <tt>result_type</tt> is an integral type and that it satisfies
! <tt>UnsignedIntegralLike&lt;result_type&gt;</tt>.
! </p>
! <p>
! To realize it's designated task, the algorithm has to invoke the
! <tt>Callable</tt> aspect of <tt>g</tt> and needs to perform some algebra involving
! it's <tt>min()/max()</tt> limits to compute another index value that
! at this point is converted into <tt>Iter::difference_type</tt>. This is so,
! because 24.2.7 [random.access.iterators] uses this type as argument
! of it's algebraic operators. Alternatively consider the equivalent
! iterator algorithms in 24.4.4 [iterator.operations] with the same result.
! </p>
! <p>
! This argument leads us to the conclusion that we also need
! <tt>Convertible&lt;Rand::result_type, Iter::difference_type&gt;</tt> here.
! </p>
! </blockquote>
! 
! </blockquote>
! 
! <p><i>[
! Batavia (2009-05):
! ]</i></p>
! 
! <blockquote>
! <p>
! Alisdair notes that point (ii) has already been addressed.
! </p>
! <p>
! We agree with the proposed resolution to point (i)
! with Daniel's added requirement.
! </p>
! <p>
! Move to Review.
! </p>
! </blockquote>
! 
! <p><i>[
! 2009-06-05 Daniel updated proposed wording as recommended in Batavia.
! ]</i></p>
! 
! 
! <p><i>[
! 2009-07-28 Alisdair adds:
! ]</i></p>
! 
! 
! <blockquote><p>
! Revert to Open, with a note there is consensus on direction but the
! wording needs updating to reflect removal of concepts.
! </p></blockquote>
! 
! <p><i>[
! 2009-10 post-Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! Leave Open, Walter to work on it.
! </p></blockquote>
! 
! <p><i>[
! 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>, addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3056.pdf">N3056</a>.
! ]</i></p>
! 
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3056.pdf">N3056</a>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Change in  [algorithms.syn] and 25.3.12 [alg.random.shuffle]:
! </p>
! 
! <blockquote><pre>
! <del>concept UniformRandomNumberGenerator&lt;typename Rand&gt; { }</del>
! template&lt;RandomAccessIterator Iter, UniformRandomNumberGenerator Rand&gt;
!   <ins>requires ShuffleIterator&lt;Iter&gt; &amp;&amp;
!   Convertible&lt;Rand::result_type, Iter::difference_type&gt;</ins>
!   void random_shuffle(Iter first, Iter last, Rand&amp;&amp; g);
! </pre></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1094"></a>1094. Replace "<em>unspecified-bool-type</em>" by "<tt>explicit operator bool() const</tt>" in I/O library</h3>
! <p><b>Section:</b> 27.5.5.4 [iostate.flags] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2009-03-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostate.flags">issues</a> in [iostate.flags].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses JP 65 and JP 66 [CD1]</b></p>
  
  <p>
  Switch from "unspecified-bool-type" to "explicit operator bool() const". 
*************** Replace <tt>operator unspecified-bool-ty
*** 61919,61953 ****
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  We agree with the proposed resolution.
  Move to Review.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopis in 27.5.4 [ios]:
  </p>
  
! <blockquote><pre><ins>explicit</ins> operator <del><i>unspecified-bool-type</i></del> <ins>bool</ins>() const;
  </pre></blockquote>
  
  <p>
! Change 27.5.4.3 [iostate.flags]:
  </p>
  
! <blockquote><pre><ins>explicit</ins> operator <del><i>unspecified-bool-type</i></del> <ins>bool</ins>() const;
  </pre>
  
  <blockquote>
--- 67536,67572 ----
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  We agree with the proposed resolution.
  Move to Review.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the synopis in 27.5.5 [ios]:
  </p>
  
! <blockquote><pre>
! <ins>explicit</ins> operator <del><i>unspecified-bool-type</i></del> <ins>bool</ins>() const;
  </pre></blockquote>
  
  <p>
! Change 27.5.5.4 [iostate.flags]:
  </p>
  
! <blockquote><pre>
! <ins>explicit</ins> operator <del><i>unspecified-bool-type</i></del> <ins>bool</ins>() const;
  </pre>
  
  <blockquote>
*************** choice for this type is pointer-to-membe
*** 61975,62001 ****
  
  <hr>
  <h3><a name="1095"></a>1095. <i>Shared objects and the library</i> wording unclear</h3>
! <p><b>Section:</b> 17.6.3.10 [res.on.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-03-27 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2775.htm">N2775</a>,
  <i>Small library thread-safety revisions</i>, among other changes, removed a note from
! 17.6.3.10 [res.on.objects] that read:
  </p>
  
! <blockquote>
  [<i>Note:</i> This prohibition against concurrent non-const access means that
  modifying an object of a standard library type shared between threads
  without using a locking mechanism may result in a data race. <i>--end note</i>.]
! </blockquote>
  
  <p>
  That resulted in wording which is technically correct but can only be
! understood by reading the lengthy and complex 17.6.4.9 [res.on.data.races]
  Data race avoidance. This has the effect of making
! 17.6.3.10 [res.on.objects] unclear, and has already resulted in a query
  to the LWG reflector. See c++std-lib-23194.
  </p>
  
--- 67594,67621 ----
  
  <hr>
  <h3><a name="1095"></a>1095. <i>Shared objects and the library</i> wording unclear</h3>
! <p><b>Section:</b> 17.6.4.10 [res.on.objects] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-03-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#res.on.objects">issues</a> in [res.on.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2775.htm">N2775</a>,
  <i>Small library thread-safety revisions</i>, among other changes, removed a note from
! 17.6.4.10 [res.on.objects] that read:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> This prohibition against concurrent non-const access means that
  modifying an object of a standard library type shared between threads
  without using a locking mechanism may result in a data race. <i>--end note</i>.]
! </p></blockquote>
  
  <p>
  That resulted in wording which is technically correct but can only be
! understood by reading the lengthy and complex 17.6.5.9 [res.on.data.races]
  Data race avoidance. This has the effect of making
! 17.6.4.10 [res.on.objects] unclear, and has already resulted in a query
  to the LWG reflector. See c++std-lib-23194.
  </p>
  
*************** move to Review status.
*** 62022,62036 ****
  ]</i></p>
  
  
! <blockquote>
  Note: Change to read: "Modifying...", Delete 'thus', move to Ready
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 17.6.3.10 [res.on.objects] as indicated:
  </p>
  
  <blockquote>
--- 67642,67656 ----
  ]</i></p>
  
  
! <blockquote><p>
  Note: Change to read: "Modifying...", Delete 'thus', move to Ready
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 17.6.4.10 [res.on.objects] as indicated:
  </p>
  
  <blockquote>
*************** locking mechanism. <i>--end note</i>]
*** 62053,62062 ****
  
  <hr>
  <h3><a name="1097"></a>1097. #define __STDCPP_THREADS</h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2009-04-03 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE 18</b></p>
  
--- 67673,67682 ----
  
  <hr>
  <h3><a name="1097"></a>1097. #define __STDCPP_THREADS</h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2009-04-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE 18</b></p>
  
*************** Move to Review.
*** 62109,62117 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  2010-02-25 Pete moved to Open:
--- 67729,67737 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  2010-02-25 Pete moved to Open:
*************** The proposed resolution adds a feature-t
*** 62124,62133 ****
  <tt>__STDCPP_THREADS</tt>, described after the following new text:
  </p>
  
! <blockquote>
  The standard library defines the following macros; no explicit prior inclusion
  of any header file is necessary.
! </blockquote>
  
  <p>
  The correct term here is "header", not "header file". But that's minor. The real
--- 67744,67753 ----
  <tt>__STDCPP_THREADS</tt>, described after the following new text:
  </p>
  
! <blockquote><p>
  The standard library defines the following macros; no explicit prior inclusion
  of any header file is necessary.
! </p></blockquote>
  
  <p>
  The correct term here is "header", not "header file". But that's minor. The real
*************** mention of a decision to change this.
*** 62159,62168 ****
  ]</i></p>
  
  
! <blockquote>
  Most macros we have begin and end with with double underbars, this one
  only begins with double underbars.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Ganesh's wording adopted and moved to Ready for Pittsburgh.
--- 67779,67788 ----
  ]</i></p>
  
  
! <blockquote><p>
  Most macros we have begin and end with with double underbars, this one
  only begins with double underbars.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Ganesh's wording adopted and moved to Ready for Pittsburgh.
*************** only begins with double underbars.
*** 62177,62183 ****
  Change 17.6.1.3 [compliance]/3:
  </p>
  
! <blockquote>
  3 The supplied version of the header <tt>&lt;cstdlib&gt;</tt> shall
  declare at least the functions <tt>abort()</tt>, <tt>atexit()</tt>, and
  <tt>exit()</tt> (18.5). <ins>The supplied version of the header
--- 67797,67803 ----
  Change 17.6.1.3 [compliance]/3:
  </p>
  
! <blockquote><p>
  3 The supplied version of the header <tt>&lt;cstdlib&gt;</tt> shall
  declare at least the functions <tt>abort()</tt>, <tt>atexit()</tt>, and
  <tt>exit()</tt> (18.5). <ins>The supplied version of the header
*************** declare at least the functions <tt>abort
*** 62185,62191 ****
  hosted implementation or including it shall have no effect.</ins> The
  other headers listed in this table shall meet the same requirements as
  for a hosted implementation.
! </blockquote>
  
  <p>
  Add the following line to table 15:
--- 67805,67811 ----
  hosted implementation or including it shall have no effect.</ins> The
  other headers listed in this table shall meet the same requirements as
  for a hosted implementation.
! </p></blockquote>
  
  <p>
  Add the following line to table 15:
*************** Add the following line to table 15:
*** 62193,62201 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 15 — C++ headers for freestanding implementations</caption>
  
! <tbody><tr>
  <th>Subclause</th>
  <th>Header(s)</th>
  </tr>
--- 67813,67821 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 15 &mdash; C++ headers for freestanding implementations</caption>
  
! <tr>
  <th>Subclause</th>
  <th>Header(s)</th>
  </tr>
*************** Add the following line to table 15:
*** 62209,62215 ****
  <td><ins><tt>&lt;thread&gt;</tt></ins></td>
  </tr>
  
! </tbody></table>
  
  </blockquote>
  
--- 67829,67835 ----
  <td><ins><tt>&lt;thread&gt;</tt></ins></td>
  </tr>
  
! </table>
  
  </blockquote>
  
*************** Add the following line to table 15:
*** 62217,62223 ****
  Add to the <tt>&lt;thread&gt;</tt> synopsis in 30.3 [thread.threads]/1 the line:
  </p>
  
! <blockquote><pre>namespace std {
  
  <ins>#define __STDCPP_THREADS __cplusplus</ins>
  
--- 67837,67844 ----
  Add to the <tt>&lt;thread&gt;</tt> synopsis in 30.3 [thread.threads]/1 the line:
  </p>
  
! <blockquote><pre>
! namespace std {
  
  <ins>#define __STDCPP_THREADS __cplusplus</ins>
  
*************** Add to the <tt>&lt;thread&gt;</tt> synop
*** 62234,62249 ****
  
  
  <hr>
! <h3><a name="1098"></a>1098. definition of get_pointer_safety()</h3>
! <p><b>Section:</b> 20.9.11 [util.dynamic.safety] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2009-04-03 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.dynamic.safety">issues</a> in [util.dynamic.safety].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE 18</b></p>
  
  <p>
!  In 20.9.11 [util.dynamic.safety], <tt>get_pointer_safety()</tt> purports
  to define behavior for
   non-safely derived pointers (3.7.4.3 [basic.stc.dynamic.safety]).  However,
   the cited core-language section in paragraph 4 specifies undefined behavior
--- 67855,67870 ----
  
  
  <hr>
! <h3><a name="1098"></a>1098. definition of <tt>get_pointer_safety()</tt></h3>
! <p><b>Section:</b> 20.7.4 [util.dynamic.safety] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2009-04-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.dynamic.safety">issues</a> in [util.dynamic.safety].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE 18</b></p>
  
  <p>
!  In 20.7.4 [util.dynamic.safety], <tt>get_pointer_safety()</tt> purports
  to define behavior for
   non-safely derived pointers (3.7.4.3 [basic.stc.dynamic.safety]).  However,
   the cited core-language section in paragraph 4 specifies undefined behavior
*************** Move to Open.
*** 62282,62296 ****
  ]</i></p>
  
  
! <blockquote>
  The core issue is 853 and is in Ready status.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9.11 [util.dynamic.safety] p16, replace the description of
  <tt>get_pointer_safety()</tt> with:
  </p>
  
--- 67903,67917 ----
  ]</i></p>
  
  
! <blockquote><p>
  The core issue is 853 and is in Ready status.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.7.4 [util.dynamic.safety] p16, replace the description of
  <tt>get_pointer_safety()</tt> with:
  </p>
  
*************** Footnote) <tt>pointer_safety::preferred<
*** 62343,62352 ****
  
  <hr>
  <h3><a name="1100"></a>1100. <tt>auto_ptr</tt> to <tt>unique_ptr</tt> conversion</h3>
! <p><b>Section:</b> 20.9.9.2.1 [unique.ptr.single.ctor] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.single.ctor">issues</a> in [unique.ptr.single.ctor].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Message c++std-lib-23182 led to a discussion in which several people
--- 67964,67973 ----
  
  <hr>
  <h3><a name="1100"></a>1100. <tt>auto_ptr</tt> to <tt>unique_ptr</tt> conversion</h3>
! <p><b>Section:</b> 20.8.1.2.1 [unique.ptr.single.ctor] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.ctor">issues</a> in [unique.ptr.single.ctor].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Message c++std-lib-23182 led to a discussion in which several people
*************** Move to Tentatively Ready.
*** 62383,62425 ****
  ]</i></p>
  
  
! <blockquote>
  Moved from Tentatively Ready to Open only because the wording needs to be
  tweaked for concepts removal.
! </blockquote>
  
  <p><i>[
  2009-08-01 Howard deconceptifies wording:
  ]</i></p>
  
  
! <blockquote>
! I also moved the change from D.12 [depr.auto.ptr]
! to 20.9.9.2 [unique.ptr.single] per the Editor's request
  in Batavia (as long as I was making changes anyway).  Set back
  to Review.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  <p><i>[
  2010-03-14 Howard adds:
  ]</i></p>
  
  
! <blockquote>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </blockquote>
  
  
  
--- 68004,68046 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved from Tentatively Ready to Open only because the wording needs to be
  tweaked for concepts removal.
! </p></blockquote>
  
  <p><i>[
  2009-08-01 Howard deconceptifies wording:
  ]</i></p>
  
  
! <blockquote><p>
! I also moved the change from X [depr.auto.ptr]
! to 20.8.1.2 [unique.ptr.single] per the Editor's request
  in Batavia (as long as I was making changes anyway).  Set back
  to Review.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  <p><i>[
  2010-03-14 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </p></blockquote>
  
  
  
*************** Solved by <a href="http://www.open-std.o
*** 62431,62440 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 20.9.9.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>template &lt;class T, class D&gt;
  class unique_ptr
  {
  public:
--- 68052,68062 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 20.8.1.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class D&gt;
  class unique_ptr
  {
  public:
*************** public:
*** 62446,62455 ****
  </pre></blockquote>
  
  <p>
! Add to 20.9.9.2.1 [unique.ptr.single.ctor]:
  </p>
  
! <blockquote><pre>template &lt;class U&gt;
    unique_ptr(auto_ptr&lt;U&gt;&amp; u);
  template &lt;class U&gt;
    unique_ptr(auto_ptr&lt;U&gt;&amp;&amp; u);
--- 68068,68078 ----
  </pre></blockquote>
  
  <p>
! Add to 20.8.1.2.1 [unique.ptr.single.ctor]:
  </p>
  
! <blockquote><pre>
! template &lt;class U&gt;
    unique_ptr(auto_ptr&lt;U&gt;&amp; u);
  template &lt;class U&gt;
    unique_ptr(auto_ptr&lt;U&gt;&amp;&amp; u);
*************** constructors shall not participate in ov
*** 62484,62498 ****
  
  <hr>
  <h3><a name="1103"></a>1103. <tt>system_error</tt> constructor postcondition overly strict</h3>
! <p><b>Section:</b> 19.5.6.2 [syserr.syserr.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  19.5.6.2 [syserr.syserr.members] says:
  </p>
  
! <blockquote><pre>system_error(error_code ec, const string&amp; what_arg);
  </pre>
  <blockquote>
  <p>
--- 68107,68122 ----
  
  <hr>
  <h3><a name="1103"></a>1103. <tt>system_error</tt> constructor postcondition overly strict</h3>
! <p><b>Section:</b> 19.5.6.2 [syserr.syserr.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  19.5.6.2 [syserr.syserr.members] says:
  </p>
  
! <blockquote><pre>
! system_error(error_code ec, const string&amp; what_arg);
  </pre>
  <blockquote>
  <p>
*************** constructors shall not participate in ov
*** 62508,62517 ****
  However the intent is for:
  </p>
  
! <blockquote><pre>std::system_error se(std::errc::not_a_directory, "In FooBar");
  ...
! se.what();  <font color="#C80000">// returns something along the lines of:</font>
!             <font color="#C80000">//   "In FooBar: Not a directory"</font>
  </pre></blockquote>
  
  <p>
--- 68132,68142 ----
  However the intent is for:
  </p>
  
! <blockquote><pre>
! std::system_error se(std::errc::not_a_directory, "In FooBar");
  ...
! se.what();  <span style="color:#C80000">// returns something along the lines of:</span>
!             <span style="color:#C80000">//   "In FooBar: Not a directory"</span>
  </pre></blockquote>
  
  <p>
*************** In 19.5.6.2 [syserr.syserr.members], cha
*** 62582,62632 ****
  </p>
  
  <blockquote>
! <pre>system_error(error_code ec, const string&amp; what_arg);
  </pre>
! <blockquote>
  -2- <i>Postconditions:</i> <tt>code() == ec</tt>
  and <tt><del>strcmp(runtime_error::what(), what_arg.c_str()) == 0</del>
  <ins>string(what()).find(what_arg) != string::npos</ins></tt>.
! </blockquote>
  
! <pre>system_error(error_code ec, const char* what_arg);
  </pre>
! <blockquote>
  -4- <i>Postconditions:</i> <tt>code() == ec</tt>
  and <tt><del>strcmp(runtime_error::what(), what_arg) == 0</del>
  <ins>string(what()).find(what_arg) != string::npos</ins></tt>.
! </blockquote>
  
! <pre>system_error(error_code ec);
  </pre>
! <blockquote>
  -6- <i>Postconditions:</i> <tt>code() == ec</tt>
  <del>and <tt>strcmp(runtime_error::what(), ""</tt></del>.
! </blockquote>
  
! <pre>system_error(int ev, const error_category&amp; ecat, const string&amp; what_arg);
  </pre>
! <blockquote>
  -8- <i>Postconditions:</i> <tt>code() == error_code(ev, ecat)</tt>
  and <tt><del>strcmp(runtime_error::what(), what_arg.c_str()) == 0</del>
  <ins>string(what()).find(what_arg) != string::npos</ins></tt>.
! </blockquote>
  
! <pre>system_error(int ev, const error_category&amp; ecat, const char* what_arg);
  </pre>
! <blockquote>
  -10- <i>Postconditions:</i> <tt>code() == error_code(ev, ecat)</tt>
  and <tt><del>strcmp(runtime_error::what(), what_arg) == 0</del>
  <ins>string(what()).find(what_arg) != string::npos</ins></tt>.
! </blockquote>
  
! <pre>system_error(int ev, const error_category&amp; ecat);
  </pre>
! <blockquote>
  -12- <i>Postconditions:</i> <tt>code() == error_code(ev, ecat)</tt>
  <del>and <tt>strcmp(runtime_error::what(), "") == 0</tt></del>.
! </blockquote>
  
  </blockquote>
  
--- 68207,68263 ----
  </p>
  
  <blockquote>
! <pre>
! system_error(error_code ec, const string&amp; what_arg);
  </pre>
! <blockquote><p>
  -2- <i>Postconditions:</i> <tt>code() == ec</tt>
  and <tt><del>strcmp(runtime_error::what(), what_arg.c_str()) == 0</del>
  <ins>string(what()).find(what_arg) != string::npos</ins></tt>.
! </p></blockquote>
  
! <pre>
! system_error(error_code ec, const char* what_arg);
  </pre>
! <blockquote><p>
  -4- <i>Postconditions:</i> <tt>code() == ec</tt>
  and <tt><del>strcmp(runtime_error::what(), what_arg) == 0</del>
  <ins>string(what()).find(what_arg) != string::npos</ins></tt>.
! </p></blockquote>
  
! <pre>
! system_error(error_code ec);
  </pre>
! <blockquote><p>
  -6- <i>Postconditions:</i> <tt>code() == ec</tt>
  <del>and <tt>strcmp(runtime_error::what(), ""</tt></del>.
! </p></blockquote>
  
! <pre>
! system_error(int ev, const error_category&amp; ecat, const string&amp; what_arg);
  </pre>
! <blockquote><p>
  -8- <i>Postconditions:</i> <tt>code() == error_code(ev, ecat)</tt>
  and <tt><del>strcmp(runtime_error::what(), what_arg.c_str()) == 0</del>
  <ins>string(what()).find(what_arg) != string::npos</ins></tt>.
! </p></blockquote>
  
! <pre>
! system_error(int ev, const error_category&amp; ecat, const char* what_arg);
  </pre>
! <blockquote><p>
  -10- <i>Postconditions:</i> <tt>code() == error_code(ev, ecat)</tt>
  and <tt><del>strcmp(runtime_error::what(), what_arg) == 0</del>
  <ins>string(what()).find(what_arg) != string::npos</ins></tt>.
! </p></blockquote>
  
! <pre>
! system_error(int ev, const error_category&amp; ecat);
  </pre>
! <blockquote><p>
  -12- <i>Postconditions:</i> <tt>code() == error_code(ev, ecat)</tt>
  <del>and <tt>strcmp(runtime_error::what(), "") == 0</tt></del>.
! </p></blockquote>
  
  </blockquote>
  
*************** In 19.5.6.2 [syserr.syserr.members], cha
*** 62635,62641 ****
  </p>
  
  <blockquote>
! <pre>const char *what() const throw();
  </pre>
  <blockquote>
  <p>
--- 68266,68273 ----
  </p>
  
  <blockquote>
! <pre>
! const char *what() const throw();
  </pre>
  <blockquote>
  <p>
*************** if (msg.empty()) {
*** 62662,62677 ****
  return msg.c_str();
  </del></pre></blockquote>
  <p>
! — <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
  
  <p>
! In 27.5.2.1.1 [ios::failure], change the synopsis:
  </p>
  
! <blockquote><pre>namespace std { 
    class ios_base::failure : public system_error { 
    public: 
      explicit failure(const string&amp; msg, const error_code&amp; ec = io_errc::stream); 
--- 68294,68310 ----
  return msg.c_str();
  </del></pre></blockquote>
  <p>
! &mdash; <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
  
  <p>
! In 27.5.3.1.1 [ios::failure], change the synopsis:
  </p>
  
! <blockquote><pre>
! namespace std { 
    class ios_base::failure : public system_error { 
    public: 
      explicit failure(const string&amp; msg, const error_code&amp; ec = io_errc::stream); 
*************** In 27.5.2.1.1 [ios::failure], change the
*** 62682,62693 ****
  </pre></blockquote>
  
  <p>
! In 27.5.2.1.1 [ios::failure], change the description of the constructors:
  </p>
  
  <blockquote>
  
! <pre>explicit failure(const string&amp; msg, , const error_code&amp; ec = io_errc::stream);
  </pre>
  <blockquote>
  <p>
--- 68315,68327 ----
  </pre></blockquote>
  
  <p>
! In 27.5.3.1.1 [ios::failure], change the description of the constructors:
  </p>
  
  <blockquote>
  
! <pre>
! explicit failure(const string&amp; msg, , const error_code&amp; ec = io_errc::stream);
  </pre>
  <blockquote>
  <p>
*************** In 27.5.2.1.1 [ios::failure], change the
*** 62699,62705 ****
  </p>
  </blockquote>
  
! <pre>explicit failure(const char* msg, const error_code&amp; ec = io_errc::stream);
  </pre>
  <blockquote>
  <p>
--- 68333,68340 ----
  </p>
  </blockquote>
  
! <pre>
! explicit failure(const char* msg, const error_code&amp; ec = io_errc::stream);
  </pre>
  <blockquote>
  <p>
*************** In 27.5.2.1.1 [ios::failure], change the
*** 62714,62729 ****
  </blockquote>
  
  <p>
! In 27.5.2.1.1 [ios::failure], remove <tt>what</tt> (the base class definition
  need not be repeated here).
  </p>
  
  <blockquote>
! <pre><del>const char* what() const;</del>
  </pre>
! <blockquote>
  <del>-7- <i>Returns:</i> The message <tt>msg</tt> with which the exception was created.</del>
! </blockquote>
  
  </blockquote>
  
--- 68349,68365 ----
  </blockquote>
  
  <p>
! In 27.5.3.1.1 [ios::failure], remove <tt>what</tt> (the base class definition
  need not be repeated here).
  </p>
  
  <blockquote>
! <pre>
! <del>const char* what() const;</del>
  </pre>
! <blockquote><p>
  <del>-7- <i>Returns:</i> The message <tt>msg</tt> with which the exception was created.</del>
! </p></blockquote>
  
  </blockquote>
  
*************** need not be repeated here).
*** 62734,62743 ****
  
  <hr>
  <h3><a name="1104"></a>1104. <tt>basic_ios::move</tt> should accept lvalues</h3>
! <p><b>Section:</b> 27.5.4.2 [basic.ios.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  With the rvalue reference changes in
--- 68370,68379 ----
  
  <hr>
  <h3><a name="1104"></a>1104. <tt>basic_ios::move</tt> should accept lvalues</h3>
! <p><b>Section:</b> 27.5.5.3 [basic.ios.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  With the rvalue reference changes in
*************** With the rvalue reference changes in
*** 62745,62751 ****
  <tt>basic_ios::move</tt> no longer has the most convenient signature:
  </p>
  
! <blockquote><pre>void move(basic_ios&amp;&amp; rhs);
  </pre></blockquote>
  
  <p>
--- 68381,68388 ----
  <tt>basic_ios::move</tt> no longer has the most convenient signature:
  </p>
  
! <blockquote><pre>
! void move(basic_ios&amp;&amp; rhs);
  </pre></blockquote>
  
  <p>
*************** Move to Open.
*** 62779,62806 ****
  ]</i></p>
  
  
! <blockquote>
  Added overload, moved to Review.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a signature to the existing prototype in the synopsis of 27.5.4 [ios]
! and in 27.5.4.2 [basic.ios.members]:
  </p>
  
! <blockquote><pre><ins>void move(basic_ios&amp; rhs);</ins>
  void move(basic_ios&amp;&amp; rhs);
  </pre></blockquote>
  
--- 68416,68444 ----
  ]</i></p>
  
  
! <blockquote><p>
  Added overload, moved to Review.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a signature to the existing prototype in the synopsis of 27.5.5 [ios]
! and in 27.5.5.3 [basic.ios.members]:
  </p>
  
! <blockquote><pre>
! <ins>void move(basic_ios&amp; rhs);</ins>
  void move(basic_ios&amp;&amp; rhs);
  </pre></blockquote>
  
*************** void move(basic_ios&amp;&amp; rhs);
*** 62809,62827 ****
  
  
  <hr>
  <h3><a name="1108"></a>1108. thread.req.exception overly constrains implementations</h3>
! <p><b>Section:</b> 30.2.2 [thread.req.exception] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Christopher Kohlhoff <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current formulation of 30.2.2 [thread.req.exception]/2 reads:
  </p>
! <blockquote>
! The error_category of the <tt>error_code</tt> reported by such an
  exception's <tt>code()</tt> member function is as specified in the error
  condition Clause.
! </blockquote>
  <p>
  This constraint on the code's associated <tt>error_categor</tt> means an
  implementation must perform a mapping from the system-generated
--- 68447,68556 ----
  
  
  <hr>
+ <h3><a name="1106"></a>1106. Multiple exceptions from connected <tt>shared_future::get()</tt>?</h3>
+ <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Thomas J. Gritzan <b>Opened:</b> 2009-04-03 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ It is not clear, if multiple threads are waiting in a 
+ <tt>shared_future::get()</tt> call, if each will rethrow the stored exception.
+ </p>
+ <p>
+ Paragraph 9 reads: 
+ </p>
+ <blockquote><p>
+ <i>Throws:</i> the stored exception, if an exception was stored and not 
+ retrieved before.
+ </p></blockquote>
+ <p>
+ The "not retrieved before" suggests that only one exception is thrown, 
+ but one exception for each call to <tt>get()</tt> is needed, and multiple calls 
+ to <tt>get()</tt> even on the same <tt>shared_future</tt> object seem to be allowed. 
+ </p>
+ <p>
+ I suggest removing "and not retrieved before" from the Throws paragraph. 
+ I recommend adding a note that explains that multiple calls on <tt>get()</tt> are 
+ allowed, and each call would result in an exception if an exception was 
+ stored. 
+ </p>
+ 
+ <p><i>[
+ Batavia (2009-05):
+ ]</i></p>
+ 
+ <blockquote>
+ <p>
+ We note there is a pending paper by Detlef
+ on such <tt>future</tt>-related issues;
+ we would like to wait for his paper before proceeding.
+ </p>
+ <p>
+ Alisdair suggests we may want language to clarify that this
+ <tt>get()</tt> function can be called from several threads
+ with no need for explicit locking.
+ </p>
+ <p>
+ Move to Open.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2010-01-23 Moved to Tentatively NAD Editorial after 5 positive votes on c++std-lib.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Resolved by paper
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change 30.6.7 [futures.shared_future]:
+ </p>
+ 
+ <blockquote><pre>
+ const R&amp; shared_future::get() const; 
+ R&amp; shared_future&lt;R&amp;&gt;::get() const; 
+ void shared_future&lt;void&gt;::get() const;
+ </pre>
+ <blockquote>
+ <p>...</p>
+ <p>
+ -9- <i>Throws:</i> the stored exception, if an exception was stored<del> and not retrieved before</del>.
+ <ins>
+ [<i>Note:</i> Multiple calls on <tt>get()</tt> are allowed, and each call would result in an exception 
+ if an exception was stored. &mdash; <i>end note</i>]
+ </ins>
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1108"></a>1108. thread.req.exception overly constrains implementations</h3>
! <p><b>Section:</b> 30.2.2 [thread.req.exception] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Christopher Kohlhoff <b>Opened:</b> 2009-04-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current formulation of 30.2.2 [thread.req.exception]/2 reads:
  </p>
! <blockquote><p>
! The <tt>error_category</tt> of the <tt>error_code</tt> reported by such an
  exception's <tt>code()</tt> member function is as specified in the error
  condition Clause.
! </p></blockquote>
  <p>
  This constraint on the code's associated <tt>error_categor</tt> means an
  implementation must perform a mapping from the system-generated
*************** The original error produced by the opera
*** 62844,62851 ****
  The latter was one of Peter Dimov's main objections (in a private
  email discussion) to the original <tt>error_code</tt>-only design, and led to
  the creation of <tt>error_condition</tt> in the first place. Specifically,
! <tt>error_code</tt> and <tt>error_condition</tt> are intended to perform the following
! roles:
  </p>
  <ul>
  <li>
--- 68573,68580 ----
  The latter was one of Peter Dimov's main objections (in a private
  email discussion) to the original <tt>error_code</tt>-only design, and led to
  the creation of <tt>error_condition</tt> in the first place. Specifically,
! <tt>error_code</tt> and <tt>error_condition</tt> are intended to perform 
! the following roles:
  </p>
  <ul>
  <li>
*************** need to match the right error condition
*** 62866,62900 ****
  from a library function.)
  </p>
  <p>
! It is important that this <tt>error_code/error_condition</tt> usage is done
! correctly for the thread library since it is likely to set the
! pattern for future TR libraries that interact with the operating
! system.
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open, and recommend the issue be deferred until after the next
  Committee Draft is issued.
! </blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Tentatively Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 30.2.2 [thread.req.exception]/2:
  </p>
  
  <blockquote>
--- 68595,68628 ----
  from a library function.)
  </p>
  <p>
! It is important that this <tt>error_code&#47;error_condition</tt> usage is done
! correctly for the thread library since it is likely to set the pattern for future 
! TR libraries that interact with the operating system.
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open, and recommend the issue be deferred until after the next
  Committee Draft is issued.
! </p></blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 30.2.2 [thread.req.exception] p.2:
  </p>
  
  <blockquote>
*************** ec == errc::resource_unavailable_try_aga
*** 62915,62921 ****
  </ins></pre></blockquote>
  
  <p><ins>
! — <i>end example</i>]
  </ins></p>
  
  </blockquote>
--- 68643,68649 ----
  </ins></pre></blockquote>
  
  <p><ins>
! &mdash; <i>end example</i>]
  </ins></p>
  
  </blockquote>
*************** ec == errc::resource_unavailable_try_aga
*** 62927,62943 ****
  
  <hr>
  <h3><a name="1110"></a>1110. Is <tt>for_each</tt> overconstrained?</h3>
! <p><b>Section:</b> 25.2.4 [alg.foreach] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-04-29 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.foreach">issues</a> in [alg.foreach].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Quoting working paper for reference (25.2.4 [alg.foreach]):
  </p>
  
  <blockquote>
! <pre>template&lt;InputIterator Iter, Callable&lt;auto, Iter::reference&gt; Function&gt;
    requires CopyConstructible&lt;Function&gt;
    Function for_each(Iter first, Iter last, Function f);
  </pre>
--- 68655,68672 ----
  
  <hr>
  <h3><a name="1110"></a>1110. Is <tt>for_each</tt> overconstrained?</h3>
! <p><b>Section:</b> 25.2.4 [alg.foreach] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-04-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.foreach">issues</a> in [alg.foreach].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Quoting working paper for reference (25.2.4 [alg.foreach]):
  </p>
  
  <blockquote>
! <pre>
! template&lt;InputIterator Iter, Callable&lt;auto, Iter::reference&gt; Function&gt;
    requires CopyConstructible&lt;Function&gt;
    Function for_each(Iter first, Iter last, Function f);
  </pre>
*************** Committee Draft is issued.
*** 62996,63005 ****
  <p>
  The note in 25.1 [algorithms.general]/9 already says the right thing:
  </p>
! <blockquote>
  Unless otherwise specified, algorithms that take function objects
  as arguments are permitted to copy those function objects freely.
! </blockquote>
  <p>
  So we only need to ensure that the wording for <tt>for_each</tt> is sufficiently
  clear, which is the intend of the following rewording.
--- 68725,68734 ----
  <p>
  The note in 25.1 [algorithms.general]/9 already says the right thing:
  </p>
! <blockquote><p>
  Unless otherwise specified, algorithms that take function objects
  as arguments are permitted to copy those function objects freely.
! </p></blockquote>
  <p>
  So we only need to ensure that the wording for <tt>for_each</tt> is sufficiently
  clear, which is the intend of the following rewording.
*************** Add a new Requires clause just after the
*** 63029,63037 ****
  Change 25.2.4 [alg.foreach]/2 as indicated:
  </p>
  
! <blockquote>
  <i>Returns:</i> <ins>std::move(</ins>f<ins>)</ins>.
! </blockquote>
  </li>
  </ul>
  </blockquote>
--- 68758,68766 ----
  Change 25.2.4 [alg.foreach]/2 as indicated:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> <ins>std::move(</ins>f<ins>)</ins>.
! </p></blockquote>
  </li>
  </ul>
  </blockquote>
*************** Change 25.2.4 [alg.foreach]/2 as indicat
*** 63041,63050 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Tentatively Ready, using Daniel's wording without the portion
  saying "CopyConstructible is not required".
! </blockquote>
  
  <p><i>[
  2009-10-27 Daniel adds:
--- 68770,68779 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Tentatively Ready, using Daniel's wording without the portion
  saying "CopyConstructible is not required".
! </p></blockquote>
  
  <p><i>[
  2009-10-27 Daniel adds:
*************** saying "CopyConstructible is not require
*** 63056,63074 ****
  I see that during the Santa Cruz meeting the originally proposed addition
  </p>
  
! <blockquote>
  , <tt>CopyConstructible</tt> is not required.
! </blockquote>
  
  <p>
  was removed. I don't think that this removal was a good idea. The combination
! of 25.1 [algorithms.general]/9
  </p>
  
! <blockquote>
  [<i>Note:</i> Unless otherwise specified, algorithms that take function objects
  as arguments are permitted to copy those function objects freely.[..]
! </blockquote>
  
  <p>
  with the fact that <tt>CopyConstructible</tt> is a refinement <tt>MoveConstructible</tt>
--- 68785,68803 ----
  I see that during the Santa Cruz meeting the originally proposed addition
  </p>
  
! <blockquote><p>
  , <tt>CopyConstructible</tt> is not required.
! </p></blockquote>
  
  <p>
  was removed. I don't think that this removal was a good idea. The combination
! of 25.1 [algorithms.general] p.9
  </p>
  
! <blockquote><p>
  [<i>Note:</i> Unless otherwise specified, algorithms that take function objects
  as arguments are permitted to copy those function objects freely.[..]
! </p></blockquote>
  
  <p>
  with the fact that <tt>CopyConstructible</tt> is a refinement <tt>MoveConstructible</tt>
*************** makes it necessary that such an explicit
*** 63076,63087 ****
  existence of the usage of <tt>std::move</tt> in the <i>Returns</i> clause doesn't
  help much, because this would still be well-formed for a <tt>CopyConstructible</tt>
  without move constructor. Let me add that the originally proposed
! addition reflects current practice in the standard, e.g. 25.3.9 [alg.unique]/5
  usages a similar terminology.
  </p>
  
  <p>
! For similar wording need in case for auto_ptr see <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#973">973</a>.
  </p>
  
  <p><i>[
--- 68805,68816 ----
  existence of the usage of <tt>std::move</tt> in the <i>Returns</i> clause doesn't
  help much, because this would still be well-formed for a <tt>CopyConstructible</tt>
  without move constructor. Let me add that the originally proposed
! addition reflects current practice in the standard, e.g. 25.3.9 [alg.unique] p.5
  usages a similar terminology.
  </p>
  
  <p>
! For similar wording need in case for auto_ptr see <a href="lwg-closed.html#973">973</a>.
  </p>
  
  <p><i>[
*************** Add a new Requires clause just after the
*** 63121,63129 ****
  Change 25.2.4 [alg.foreach]/2 as indicated:
  </p>
  
! <blockquote>
  <i>Returns:</i> <ins>std::move(</ins>f<ins>)</ins>.
! </blockquote>
  </li>
  </ul>
  
--- 68850,68858 ----
  Change 25.2.4 [alg.foreach]/2 as indicated:
  </p>
  
! <blockquote><p>
  <i>Returns:</i> <ins>std::move(</ins>f<ins>)</ins>.
! </p></blockquote>
  </li>
  </ul>
  
*************** Change 25.2.4 [alg.foreach]/2 as indicat
*** 63136,63148 ****
  
  <hr>
  <h3><a name="1113"></a>1113. <tt>bitset::to_string</tt> could be simplified</h3>
! <p><b>Section:</b> 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-09 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a> our resolution is changing the signature by adding two
  defaulting arguments to 3 calls.  In principle, this means that ABI breakage
  is not an issue, while API is preserved.
  </p>
--- 68865,68878 ----
  
  <hr>
  <h3><a name="1113"></a>1113. <tt>bitset::to_string</tt> could be simplified</h3>
! <p><b>Section:</b> 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In <a href="lwg-defects.html#853">853</a> our resolution is changing the signature by adding two
  defaulting arguments to 3 calls.  In principle, this means that ABI breakage
  is not an issue, while API is preserved.
  </p>
*************** is not an issue, while API is preserved.
*** 63150,63187 ****
  With that observation, it would be very nice to use the new ability to
  supply default template parameters to function templates to collapse all 3
  signatures into 1.  In that spirit, this issue offers an alternative resolution
! than that of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a>.
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote>
  Move to Open,
! and look at the issue again after <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#853">853</a> has been accepted.
  We further recommend this be deferred until after the next Committee Draft.
! </blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Tentatively Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
! <ol type="A">
  <li>
  <p>
! In 20.5 [template.bitset]/1 (class bitset) ammend:
  </p>
! <blockquote><pre>template &lt;class charT <ins>= char</ins>,
              class traits <ins>= char_traits&lt;charT&gt;</ins>,
              class Allocator <ins>= allocator&lt;charT&gt;</ins>&gt; 
    basic_string&lt;charT, traits, Allocator&gt;
--- 68880,68918 ----
  With that observation, it would be very nice to use the new ability to
  supply default template parameters to function templates to collapse all 3
  signatures into 1.  In that spirit, this issue offers an alternative resolution
! than that of <a href="lwg-defects.html#853">853</a>.
  </p>
  
  <p><i>[
  Batavia (2009-05):
  ]</i></p>
  
! <blockquote><p>
  Move to Open,
! and look at the issue again after <a href="lwg-defects.html#853">853</a> has been accepted.
  We further recommend this be deferred until after the next Committee Draft.
! </p></blockquote>
  
  <p><i>[
  2009-10 post-Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  
! <ol style="list-style-type:upper-alpha">
  <li>
  <p>
! In 20.6 [template.bitset]/1 (class bitset) ammend:
  </p>
! <blockquote><pre>
! template &lt;class charT <ins>= char</ins>,
              class traits <ins>= char_traits&lt;charT&gt;</ins>,
              class Allocator <ins>= allocator&lt;charT&gt;</ins>&gt; 
    basic_string&lt;charT, traits, Allocator&gt;
*************** basic_string&lt;char, char_traits&lt;cha
*** 63195,63203 ****
  </li>
  <li>
  <p>
! In 20.5.2 [bitset.members] prior to p35 ammend:
  </p>
! <blockquote><pre>template &lt;class charT <ins>= char</ins>,
              class traits <ins>= char_traits&lt;charT&gt;</ins>,
              class Allocator <ins>= allocator&lt;charT&gt;</ins>&gt; 
    basic_string&lt;charT, traits, Allocator&gt;
--- 68926,68935 ----
  </li>
  <li>
  <p>
! In 20.6.2 [bitset.members] prior to p35 ammend:
  </p>
! <blockquote><pre>
! template &lt;class charT <ins>= char</ins>,
              class traits <ins>= char_traits&lt;charT&gt;</ins>,
              class Allocator <ins>= allocator&lt;charT&gt;</ins>&gt; 
    basic_string&lt;charT, traits, Allocator&gt;
*************** In 20.5.2 [bitset.members] prior to p35
*** 63205,63211 ****
  </pre></blockquote>
  </li>
  <li>
! Strike 20.5.2 [bitset.members] paragraphs 37 -&gt; 39 (including signature
  above 37)
  </li>
  </ol>
--- 68937,68943 ----
  </pre></blockquote>
  </li>
  <li>
! Strike 20.6.2 [bitset.members] paragraphs 37 -> 39 (including signature
  above 37)
  </li>
  </ol>
*************** above 37)
*** 63217,63253 ****
  
  <hr>
  <h3><a name="1114"></a>1114. Type traits underspecified</h3>
! <p><b>Section:</b> 20.7 [meta] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-05-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#975">975</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1023">1023</a>.
  </p>
  
  <p>
! The current wording in 20.7.1 [meta.rqmts] is still unclear concerning
  it's requirements on the type traits classes regarding ambiguities.
  Specifically it's unclear
  </p>
  
  <ul>
  <li>
! if a predicate trait (20.7.4 [meta.unary], 20.7.6 [meta.rel]) could derive from both
! <tt>true_type</tt>/<tt>false_type</tt>.
  </li>
  <li>
! if any of the type traits (20.7.1 [meta.rqmts], 20.7.4 [meta.unary], 20.7.6 [meta.rel]) could ambiguously derive
  from the same specified result type.
  </li>
  <li>
! if any of the type traits (20.7.1 [meta.rqmts], 20.7.4 [meta.unary], 20.7.6 [meta.rel]) could derive from other
  <tt>integral_constant</tt> types making the contained names ambiguous
  </li>
  <li>
! if any of the type traits (20.7.1 [meta.rqmts], 20.7.4 [meta.unary], 20.7.6 [meta.rel]) could have other base
  classes that contain members hiding the name of the result type members
  or make the contained member names ambiguous.
  </li>
--- 68949,68986 ----
  
  <hr>
  <h3><a name="1114"></a>1114. Type traits underspecified</h3>
! <p><b>Section:</b> 20.10 [meta] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-05-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
! Related to <a href="lwg-defects.html#975">975</a> and <a href="lwg-closed.html#1023">1023</a>.
  </p>
  
  <p>
! The current wording in 20.10.1 [meta.rqmts] is still unclear concerning
  it's requirements on the type traits classes regarding ambiguities.
  Specifically it's unclear
  </p>
  
  <ul>
  <li>
! if a predicate trait (20.10.4 [meta.unary], 20.10.6 [meta.rel]) could derive from both
! <tt>true_type</tt>&#47;<tt>false_type</tt>.
  </li>
  <li>
! if any of the type traits (20.10.1 [meta.rqmts], 20.10.4 [meta.unary], 20.10.6 [meta.rel]) could ambiguously derive
  from the same specified result type.
  </li>
  <li>
! if any of the type traits (20.10.1 [meta.rqmts], 20.10.4 [meta.unary], 20.10.6 [meta.rel]) could derive from other
  <tt>integral_constant</tt> types making the contained names ambiguous
  </li>
  <li>
! if any of the type traits (20.10.1 [meta.rqmts], 20.10.4 [meta.unary], 20.10.6 [meta.rel]) could have other base
  classes that contain members hiding the name of the result type members
  or make the contained member names ambiguous.
  </li>
*************** Move to Open.
*** 63273,63288 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Tentatively Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[
  The usage of the notion of a <i>BaseCharacteristic</i> below might be
! useful in other places - e.g. to define the base class relation in 20.8.4 [refwrap], 20.8.13 [func.memfn], or 20.8.14.2 [func.wrap.func]. In this case it's definition should probably
  be moved to Clause 17
  ]</i></p>
  
--- 69006,69021 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Tentatively Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[
  The usage of the notion of a <i>BaseCharacteristic</i> below might be
! useful in other places - e.g. to define the base class relation in 20.9.4 [refwrap], 20.9.11 [func.memfn], or 20.9.12.2 [func.wrap.func]. In this case it's definition should probably
  be moved to Clause 17
  ]</i></p>
  
*************** be moved to Clause 17
*** 63290,63298 ****
  <ol>
  <li>
  <p>
! Change 20.7.1 [meta.rqmts]/1 as indicated:
  </p>
! <blockquote>
  [..] It shall be <tt>DefaultConstructible</tt>, <tt>CopyConstructible</tt>, and publicly
  <ins>and unambiguously</ins> derived, directly or indirectly, from
  <ins>its <i>BaseCharacteristic</i>, which is</ins> a specialization of the
--- 69023,69031 ----
  <ol>
  <li>
  <p>
! Change 20.10.1 [meta.rqmts] p.1 as indicated:
  </p>
! <blockquote><p>
  [..] It shall be <tt>DefaultConstructible</tt>, <tt>CopyConstructible</tt>, and publicly
  <ins>and unambiguously</ins> derived, directly or indirectly, from
  <ins>its <i>BaseCharacteristic</i>, which is</ins> a specialization of the
*************** template <tt>integral_constant</tt> (20.
*** 63301,63313 ****
  property being described. <ins>The member names of the
  <i>BaseCharacteristic</i> shall be unhidden and unambiguously
  available in the <i>UnaryTypeTrait</i>.</ins>
! </blockquote>
  </li>
  <li>
  <p>
! Change 20.7.1 [meta.rqmts]/2 as indicated:
  </p>
! <blockquote>
  [..] It shall be <tt>DefaultConstructible</tt>, <tt>CopyConstructible</tt>, and publicly
  <ins>and unambiguously</ins> derived, directly or indirectly, from
  <del>an instance</del> <ins>its <i>BaseCharacteristic</i>, which is a
--- 69034,69046 ----
  property being described. <ins>The member names of the
  <i>BaseCharacteristic</i> shall be unhidden and unambiguously
  available in the <i>UnaryTypeTrait</i>.</ins>
! </p></blockquote>
  </li>
  <li>
  <p>
! Change 20.10.1 [meta.rqmts] p.2 as indicated:
  </p>
! <blockquote><p>
  [..] It shall be <tt>DefaultConstructible</tt>, <tt>CopyConstructible</tt>, and publicly
  <ins>and unambiguously</ins> derived, directly or indirectly, from
  <del>an instance</del> <ins>its <i>BaseCharacteristic</i>, which is a
*************** the arguments to the template <tt>integr
*** 63316,63347 ****
  requirements for the particular relationship being described. <ins>The
  member names of the <i>BaseCharacteristic</i> shall be unhidden
  and unambiguously available in the <i>BinaryTypeTrait</i>.</ins>
! </blockquote>
  </li>
  <li>
  <p>
! Change 20.7.4 [meta.unary]/2 as indicated:
  </p>
! <blockquote>
  Each of these templates shall be a <i>UnaryTypeTrait</i> (20.6.1),
  <del>publicly derived directly or indirectly from <tt>true_type</tt> if the
  corresponding condition is true, otherwise from <tt>false_type</tt></del>
  <ins>where its <i>BaseCharacteristic</i> shall be <tt>true_type</tt> if the
  corresponding condition is true, otherwise <tt>false_type</tt></ins>.
! </blockquote>
  </li>
  <li>
  <p>
! Change 20.7.6 [meta.rel]/2 as indicated:
  </p>
  
! <blockquote>
  Each of these templates shall be a <i>BinaryTypeTrait</i> (20.6.1),
  <del>publicly derived directly or indirectly from <tt>true_type</tt> if the
  corresponding condition is true, otherwise from <tt>false_type</tt></del>
  <ins>where its <i>BaseCharacteristic</i> shall be <tt>true_type</tt> if the
  corresponding condition is true, otherwise <tt>false_type</tt></ins>.
! </blockquote>
  </li>
  </ol>
  
--- 69049,69080 ----
  requirements for the particular relationship being described. <ins>The
  member names of the <i>BaseCharacteristic</i> shall be unhidden
  and unambiguously available in the <i>BinaryTypeTrait</i>.</ins>
! </p></blockquote>
  </li>
  <li>
  <p>
! Change 20.10.4 [meta.unary] p.2 as indicated:
  </p>
! <blockquote><p>
  Each of these templates shall be a <i>UnaryTypeTrait</i> (20.6.1),
  <del>publicly derived directly or indirectly from <tt>true_type</tt> if the
  corresponding condition is true, otherwise from <tt>false_type</tt></del>
  <ins>where its <i>BaseCharacteristic</i> shall be <tt>true_type</tt> if the
  corresponding condition is true, otherwise <tt>false_type</tt></ins>.
! </p></blockquote>
  </li>
  <li>
  <p>
! Change 20.10.6 [meta.rel] p.2 as indicated:
  </p>
  
! <blockquote><p>
  Each of these templates shall be a <i>BinaryTypeTrait</i> (20.6.1),
  <del>publicly derived directly or indirectly from <tt>true_type</tt> if the
  corresponding condition is true, otherwise from <tt>false_type</tt></del>
  <ins>where its <i>BaseCharacteristic</i> shall be <tt>true_type</tt> if the
  corresponding condition is true, otherwise <tt>false_type</tt></ins>.
! </p></blockquote>
  </li>
  </ol>
  
*************** corresponding condition is true, otherwi
*** 63352,63361 ****
  
  <hr>
  <h3><a name="1116"></a>1116. Literal constructors for tuple</h3>
! <p><b>Section:</b> 20.4.2 [tuple.tuple] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.tuple">issues</a> in [tuple.tuple].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is not currently possible to construct <tt>tuple</tt> literal values,
--- 69085,69094 ----
  
  <hr>
  <h3><a name="1116"></a>1116. Literal constructors for tuple</h3>
! <p><b>Section:</b> 20.4.2 [tuple.tuple] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.tuple">issues</a> in [tuple.tuple].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It is not currently possible to construct <tt>tuple</tt> literal values,
*************** clear of that class while other construc
*** 63380,63389 ****
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.html">N2994</a>.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 69113,69122 ----
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.htm">N2994</a>.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** follows
*** 63397,63403 ****
  Add the following concept:
  </p>
  
! <blockquote><pre>auto concept AllLiteral&lt; typename ... Types &gt; {
    requires LiteralType&lt;Types&gt;...;
  }
  </pre></blockquote>
--- 69130,69137 ----
  Add the following concept:
  </p>
  
! <blockquote><pre>
! auto concept AllLiteral&lt; typename ... Types &gt; {
    requires LiteralType&lt;Types&gt;...;
  }
  </pre></blockquote>
*************** Add the following concept:
*** 63406,63412 ****
  ammend the constructor 
  </p>
  
! <blockquote><pre><ins>template &lt;class... UTypes&gt;
    requires AllLiteral&lt;Types...&gt;
          &amp;&amp; Constructible&lt;Types, UTypes&gt;...
    explicit tuple(UTypes...);</ins>
--- 69140,69147 ----
  ammend the constructor 
  </p>
  
! <blockquote><pre>
! <ins>template &lt;class... UTypes&gt;
    requires AllLiteral&lt;Types...&gt;
          &amp;&amp; Constructible&lt;Types, UTypes&gt;...
    explicit tuple(UTypes...);</ins>
*************** template &lt;class... UTypes&gt;
*** 63421,63427 ****
  ammend the constructor
  </p>
  
! <blockquote><pre><ins>template &lt;class... UTypes&gt;
    requires AllLiteral&lt;Types...&gt;
          &amp;&amp; Constructible&lt;Types, UTypes&gt;...
    tuple(tuple&lt;UTypes...&gt;);</ins>
--- 69156,69163 ----
  ammend the constructor
  </p>
  
! <blockquote><pre>
! <ins>template &lt;class... UTypes&gt;
    requires AllLiteral&lt;Types...&gt;
          &amp;&amp; Constructible&lt;Types, UTypes&gt;...
    tuple(tuple&lt;UTypes...&gt;);</ins>
*************** Update the same signatures in 20.4.2.1 [
*** 63443,63453 ****
  
  
  <hr>
! <h3><a name="1117"></a>1117. tuple copy constructor</h3>
! <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The copy constructor for the <tt>tuple</tt> template is constrained.  This seems an
--- 69179,69190 ----
  
  
  <hr>
! <h3><a name="1117"></a>1117. <tt>tuple</tt> copy constructor</h3>
! <p><b>Section:</b> 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#tuple.cnstr">active issues</a> in [tuple.cnstr].</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.cnstr">issues</a> in [tuple.cnstr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The copy constructor for the <tt>tuple</tt> template is constrained.  This seems an
*************** unusual strategy, as the copy constructo
*** 63455,63461 ****
  constraints are not met.  This is exactly the same effect as requesting an
  <tt>=default;</tt> constructor.  The advantage of the latter is that it retains
  triviality, and provides support for <tt>tuple</tt>s as literal types if issue
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1116">1116</a> is also accepted.
  </p>
  <p>
  Actually, it might be worth checking with core if a constrained copy
--- 69192,69198 ----
  constraints are not met.  This is exactly the same effect as requesting an
  <tt>=default;</tt> constructor.  The advantage of the latter is that it retains
  triviality, and provides support for <tt>tuple</tt>s as literal types if issue
! <a href="lwg-defects.html#1116">1116</a> is also accepted.
  </p>
  <p>
  Actually, it might be worth checking with core if a constrained copy
*************** the template in this case.
*** 63469,63487 ****
  ]</i></p>
  
  
! <blockquote>
! This would solve one half of the suggested changes in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#801">801</a>.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.htm">N2994</a>.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 69206,69224 ----
  ]</i></p>
  
  
! <blockquote><p>
! This would solve one half of the suggested changes in <a href="lwg-defects.html#801">801</a>.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.htm">N2994</a>.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** This would solve one half of the suggest
*** 63489,63495 ****
  Change 20.4.2 [tuple.tuple] and 20.4.2.1 [tuple.cnstr] p4:
  </p>
  
! <blockquote><pre><del>requires CopyConstructible&lt;Types&gt;...</del> tuple(const tuple&amp;)<ins> = default</ins>;
  </pre></blockquote>
  
  
--- 69226,69233 ----
  Change 20.4.2 [tuple.tuple] and 20.4.2.1 [tuple.cnstr] p4:
  </p>
  
! <blockquote><pre>
! <del>requires CopyConstructible&lt;Types&gt;...</del> tuple(const tuple&amp;)<ins> = default</ins>;
  </pre></blockquote>
  
  
*************** Change 20.4.2 [tuple.tuple] and 20.4.2.1
*** 63497,63507 ****
  
  
  <hr>
! <h3><a name="1118"></a>1118. tuple query APIs do not support cv-qualification</h3>
! <p><b>Section:</b> 20.4.2.5 [tuple.helper] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.helper">issues</a> in [tuple.helper].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The APIs <tt>tuple_size</tt> and <tt>tuple_element</tt> do not support
--- 69235,69245 ----
  
  
  <hr>
! <h3><a name="1118"></a>1118. <tt>tuple</tt> query APIs do not support cv-qualification</h3>
! <p><b>Section:</b> 20.4.2.5 [tuple.helper] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.helper">issues</a> in [tuple.helper].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The APIs <tt>tuple_size</tt> and <tt>tuple_element</tt> do not support
*************** cv-qualified <tt>tuple</tt>s, <tt>pair</
*** 63510,63516 ****
  <p>
  The most generic solution would be to supply partial specializations once
  for each cv-type in the <tt>tuple</tt> header.  However, requiring this header for
! cv-qualified <tt>pair</tt>s/<tt>array</tt>s seems unhelpful.  The BSI editorial
  suggestion (UK-198/US-69,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2533.html">N2533</a>)
  to merge <tt>tuple</tt> into <tt>&lt;utility&gt;</tt> would help with <tt>pair</tt>,
--- 69248,69254 ----
  <p>
  The most generic solution would be to supply partial specializations once
  for each cv-type in the <tt>tuple</tt> header.  However, requiring this header for
! cv-qualified <tt>pair</tt>s&#47;<tt>array</tt>s seems unhelpful.  The BSI editorial
  suggestion (UK-198/US-69,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2533.html">N2533</a>)
  to merge <tt>tuple</tt> into <tt>&lt;utility&gt;</tt> would help with <tt>pair</tt>,
*************** the dependency be fulfilled in a Remark.
*** 63529,63535 ****
  All <tt>tuple_size</tt> templates with a base class need to derive publicly, e.g.
  </p>
  
! <blockquote><pre>template &lt;IdentityOf T&gt; class tuple_size&lt; const T &gt; :
     <ins>public</ins> tuple_size&lt;T&gt; {};
  </pre></blockquote>
  
--- 69267,69274 ----
  All <tt>tuple_size</tt> templates with a base class need to derive publicly, e.g.
  </p>
  
! <blockquote><pre>
! template &lt;IdentityOf T&gt; class tuple_size&lt; const T &gt; :
     <ins>public</ins> tuple_size&lt;T&gt; {};
  </pre></blockquote>
  
*************** The same applies to the tuple_element cl
*** 63539,63548 ****
  <p>
  What is actually meant with the comment
  </p>
! <blockquote>
  this solution relies on 'metafunction forwarding' to inherit the
  nested typename type
! </blockquote>
  <p>
  ?
  </p>
--- 69278,69287 ----
  <p>
  What is actually meant with the comment
  </p>
! <blockquote><p>
  this solution relies on 'metafunction forwarding' to inherit the
  nested typename type
! </p></blockquote>
  <p>
  ?
  </p>
*************** though.
*** 63581,63590 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Open, Alisdair to provide wording. Once wording is
  provided, Howard will move to Review.
! </blockquote>
  
  <p><i>[
  2010-03-28 Daniel deconceptified wording.
--- 69320,69329 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Open, Alisdair to provide wording. Once wording is
  provided, Howard will move to Review.
! </p></blockquote>
  
  <p><i>[
  2010-03-28 Daniel deconceptified wording.
*************** Post-Rapperswil - Daniel provides wordin
*** 63597,63603 ****
  
  
  <p>
! The below given P/R reflects the discussion from the Rapperswil meeting that the wording should not constrain 
  implementation freedom to realize the actual issue target. Thus the original code form was replaced by
  normative words.
  </p>
--- 69336,69342 ----
  
  
  <p>
! The below given P&#47;R reflects the discussion from the Rapperswil meeting that the wording should not constrain 
  implementation freedom to realize the actual issue target. Thus the original code form was replaced by
  normative words.
  </p>
*************** unqualified type uses. The following wor
*** 63612,63620 ****
  The wording refers to N3126.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready after 6 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 69351,69359 ----
  The wording refers to N3126.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready after 6 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 63626,63633 ****
  <p><b>Proposed resolution:</b></p>
  
  <ol>
! <li>Change 20.4.1 [tuple.general]/2, header <tt>&lt;tuple&gt;</tt> synopsis, as indicated:
! <blockquote><pre>// 20.4.2.5, tuple helper classes:
  template &lt;class T&gt; class tuple_size; // undefined
  <ins>template &lt;class T&gt; class tuple_size&lt;const T&gt;;</ins>
  <ins>template &lt;class T&gt; class tuple_size&lt;volatile T&gt;;</ins>
--- 69365,69373 ----
  <p><b>Proposed resolution:</b></p>
  
  <ol>
! <li>Change 20.4.1 [tuple.general] p.2, header <tt>&lt;tuple&gt;</tt> synopsis, as indicated:
! <blockquote><pre>
! // 20.4.2.5, tuple helper classes:
  template &lt;class T&gt; class tuple_size; // undefined
  <ins>template &lt;class T&gt; class tuple_size&lt;const T&gt;;</ins>
  <ins>template &lt;class T&gt; class tuple_size&lt;volatile T&gt;;</ins>
*************** template &lt;size_t I, class... Types&gt
*** 63644,63665 ****
  </pre></blockquote>
  </li>
  <li>Add the end of subclause 20.4.2.5 [tuple.helper] insert the following two paragraphs:
! <blockquote><pre><ins>template &lt;class T&gt; class tuple_size&lt;const T&gt;;</ins>
  <ins>template &lt;class T&gt; class tuple_size&lt;volatile T&gt;;</ins>
  <ins>template &lt;class T&gt; class tuple_size&lt;const volatile T&gt;;</ins>
! </pre><blockquote>
  <ins>Let <em>TS</em> denote <tt>tuple_size&lt;T&gt;</tt> of the <em>cv</em>-unqualified type <tt>T</tt>. 
  Then each of the three templates shall meet the UnaryTypeTrait requirements (20.7.1) with a BaseCharacteristic of 
  <tt>integral_constant&lt;remove_cv&lt;decltype(<em>TS</em>::value)&gt;::type, <em>TS</em>::value&gt;</tt>.</ins>
! </blockquote></blockquote>
  
! <blockquote><pre><ins>template &lt;size_t I, class T&gt; class tuple_element&lt;I, const T&gt;;</ins>
  <ins>template &lt;size_t I, class T&gt; class tuple_element&lt;I, volatile T&gt;;</ins>
  <ins>template &lt;size_t I, class T&gt; class tuple_element&lt;I, const volatile T&gt;;</ins>
! </pre><blockquote>
  <ins>Let <em>TE</em> denote <tt>tuple_element&lt;I, T&gt;</tt> of the <em>cv</em>-unqualified type <tt>T</tt>. Then each of the 
  three templates shall meet the TransformationTrait requirements (20.7.1) with a member typedef <tt>type</tt> that shall name the 
! same type as the following type:</ins>
  <ul>
  <li><ins>for the first specialization, the type <tt>add_const&lt;<em>TE</em>::type&gt;::type</tt>,</ins></li>
  <li><ins>for the second specialization, the type <tt>add_volatile&lt;<em>TE</em>::type&gt;::type</tt>, and</ins></li>
--- 69384,69407 ----
  </pre></blockquote>
  </li>
  <li>Add the end of subclause 20.4.2.5 [tuple.helper] insert the following two paragraphs:
! <blockquote><pre>
! <ins>template &lt;class T&gt; class tuple_size&lt;const T&gt;;</ins>
  <ins>template &lt;class T&gt; class tuple_size&lt;volatile T&gt;;</ins>
  <ins>template &lt;class T&gt; class tuple_size&lt;const volatile T&gt;;</ins>
! </pre><blockquote><p>
  <ins>Let <em>TS</em> denote <tt>tuple_size&lt;T&gt;</tt> of the <em>cv</em>-unqualified type <tt>T</tt>. 
  Then each of the three templates shall meet the UnaryTypeTrait requirements (20.7.1) with a BaseCharacteristic of 
  <tt>integral_constant&lt;remove_cv&lt;decltype(<em>TS</em>::value)&gt;::type, <em>TS</em>::value&gt;</tt>.</ins>
! </p></blockquote></blockquote>
  
! <blockquote><pre>
! <ins>template &lt;size_t I, class T&gt; class tuple_element&lt;I, const T&gt;;</ins>
  <ins>template &lt;size_t I, class T&gt; class tuple_element&lt;I, volatile T&gt;;</ins>
  <ins>template &lt;size_t I, class T&gt; class tuple_element&lt;I, const volatile T&gt;;</ins>
! </pre><blockquote><p>
  <ins>Let <em>TE</em> denote <tt>tuple_element&lt;I, T&gt;</tt> of the <em>cv</em>-unqualified type <tt>T</tt>. Then each of the 
  three templates shall meet the TransformationTrait requirements (20.7.1) with a member typedef <tt>type</tt> that shall name the 
! same type as the following type:</ins></p>
  <ul>
  <li><ins>for the first specialization, the type <tt>add_const&lt;<em>TE</em>::type&gt;::type</tt>,</ins></li>
  <li><ins>for the second specialization, the type <tt>add_volatile&lt;<em>TE</em>::type&gt;::type</tt>, and</ins></li>
*************** same type as the following type:</ins>
*** 63675,63685 ****
  
  
  <hr>
! <h3><a name="1122"></a>1122. Ratio values should be constexpr</h3>
! <p><b>Section:</b> 20.6.1 [ratio.ratio] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-25 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ratio.ratio">issues</a> in [ratio.ratio].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The values <tt>num</tt> and <tt>den</tt> in the <tt>ratio</tt> template
--- 69417,69427 ----
  
  
  <hr>
! <h3><a name="1122"></a>1122. Ratio values should be <tt>constexpr</tt></h3>
! <p><b>Section:</b> 20.11.3 [ratio.ratio] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ratio.ratio">issues</a> in [ratio.ratio].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The values <tt>num</tt> and <tt>den</tt> in the <tt>ratio</tt> template
*************** should be declared <tt>constexpr</tt>.
*** 63691,63708 ****
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.htm">N2994</a>.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 20.6.1 [ratio.ratio]
  </p>
  
! <blockquote><pre>namespace std {
    template &lt;intmax_t N, intmax_t D = 1&gt;
    class ratio {
    public:
--- 69433,69451 ----
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.htm">N2994</a>.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 20.11.3 [ratio.ratio]
  </p>
  
! <blockquote><pre>
! namespace std {
    template &lt;intmax_t N, intmax_t D = 1&gt;
    class ratio {
    public:
*************** should be declared <tt>constexpr</tt>.
*** 63718,63728 ****
  
  
  <hr>
! <h3><a name="1123"></a>1123. no requirement that standard streams be flushed</h3>
! <p><b>Section:</b> 27.5.2.1.6 [ios::Init] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2009-05-14 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ios::Init">issues</a> in [ios::Init].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As currently formulated, the standard doesn't require that there 
--- 69461,69471 ----
  
  
  <hr>
! <h3><a name="1123"></a>1123. No requirement that standard streams be flushed</h3>
! <p><b>Section:</b> 27.5.3.1.6 [ios::Init] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2009-05-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios::Init">issues</a> in [ios::Init].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As currently formulated, the standard doesn't require that there 
*************** be constructed before <tt>main</tt>, and
*** 63735,63764 ****
  initialization of any non-local objects defined after the 
  inclusion of <tt>&lt;iostream&gt;</tt> in the same translation unit.  The only 
  requirement that I can find concerning flushing, however, is in 
! 27.5.2.1.6 [ios::Init], where the destructor of the last 
  <tt>std::ios_base::Init</tt> object flushes.  But there is, as far as I 
  can see, no guarantee that such an object ever exists. 
  </p>
  <p>
  Also, the wording in  [iostreams.objects] says that:
  </p>
! <blockquote>
  The objects 
  are constructed and the associations are established at some 
  time prior to or during the first time an object of class 
  <tt>ios_base::Init</tt> is constructed, and in any case before the body 
  of main begins execution.
! </blockquote>
  <p>
! In 27.5.2.1.6 [ios::Init], however, as an 
  effect of the constructor, it says that
  </p>
! <blockquote>
  If <tt>init_cnt</tt> is zero, 
  the function stores the value one in <tt>init_cnt</tt>, then constructs 
  and initializes the objects <tt>cin</tt>, <tt>cout</tt>, <tt>cerr</tt>, <tt>clog</tt> 
  <tt>wcin</tt>, <tt>wcout</tt>, <tt>wcerr</tt>, and <tt>wclog</tt>"
! </blockquote>
  
  <p>
  which seems to forbid earlier 
--- 69478,69507 ----
  initialization of any non-local objects defined after the 
  inclusion of <tt>&lt;iostream&gt;</tt> in the same translation unit.  The only 
  requirement that I can find concerning flushing, however, is in 
! 27.5.3.1.6 [ios::Init], where the destructor of the last 
  <tt>std::ios_base::Init</tt> object flushes.  But there is, as far as I 
  can see, no guarantee that such an object ever exists. 
  </p>
  <p>
  Also, the wording in  [iostreams.objects] says that:
  </p>
! <blockquote><p>
  The objects 
  are constructed and the associations are established at some 
  time prior to or during the first time an object of class 
  <tt>ios_base::Init</tt> is constructed, and in any case before the body 
  of main begins execution.
! </p></blockquote>
  <p>
! In 27.5.3.1.6 [ios::Init], however, as an 
  effect of the constructor, it says that
  </p>
! <blockquote><p>
  If <tt>init_cnt</tt> is zero, 
  the function stores the value one in <tt>init_cnt</tt>, then constructs 
  and initializes the objects <tt>cin</tt>, <tt>cout</tt>, <tt>cerr</tt>, <tt>clog</tt> 
  <tt>wcin</tt>, <tt>wcout</tt>, <tt>wcerr</tt>, and <tt>wclog</tt>"
! </p></blockquote>
  
  <p>
  which seems to forbid earlier 
*************** int init_cnt</tt>" in <tt>ios_base::Init
*** 63773,63784 ****
  Of course, a determined programmer can still inhibit the 
  flush with things like: 
  </p>
! <blockquote><pre>new std::ios_base::Init ;       //  never deleted 
  </pre></blockquote>
  <p>
  or (in a function): 
  </p>
! <blockquote><pre>std::ios_base::Init ensureConstruction ; 
  //  ... 
  exit( EXIT_SUCCESS ) ; 
  </pre></blockquote>
--- 69516,69529 ----
  Of course, a determined programmer can still inhibit the 
  flush with things like: 
  </p>
! <blockquote><pre>
! new std::ios_base::Init ;       //  never deleted 
  </pre></blockquote>
  <p>
  or (in a function): 
  </p>
! <blockquote><pre>
! std::ios_base::Init ensureConstruction ; 
  //  ... 
  exit( EXIT_SUCCESS ) ; 
  </pre></blockquote>
*************** would be in order.
*** 63793,63802 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.  Some editorial changes are expected (in addition to the
  proposed wording) to remove <tt>init_cnt</tt> from <tt>Init</tt>.
! </blockquote>
  
  
  
--- 69538,69547 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.  Some editorial changes are expected (in addition to the
  proposed wording) to remove <tt>init_cnt</tt> from <tt>Init</tt>.
! </p></blockquote>
  
  
  
*************** proposed wording) to remove <tt>init_cnt
*** 63805,63811 ****
  Change 27.4 [iostream.objects]/2:
  </p>
  
! <blockquote>
  -2- The objects are constructed and the associations are established at
  some time prior to or during the first time an object of class
  <tt>ios_base::Init</tt> is constructed, and in any case before the body
--- 69550,69556 ----
  Change 27.4 [iostream.objects]/2:
  </p>
  
! <blockquote><p>
  -2- The objects are constructed and the associations are established at
  some time prior to or during the first time an object of class
  <tt>ios_base::Init</tt> is constructed, and in any case before the body
*************** unit shall be as if <tt>&lt;iostream&gt;
*** 63821,63836 ****
  <tt>ios_base::Init</tt> with static lifetime. Similarly, the entire
  program shall behave as if there were at least one instance of
  <tt>ios_base::Init</tt> with static lifetime.</ins>
! </blockquote>
  
  <p>
! Change 27.5.2.1.6 [ios::Init]/3:
  </p>
  
  <blockquote>
! <pre>Init();
  </pre>
! <blockquote>
  -3- <i>Effects:</i> Constructs an object of class <tt>Init</tt>. 
  <del>If <tt>init_cnt</tt> is zero, the function stores the value one in
  <tt>init_cnt</tt>, then constructs and initializes the objects
--- 69566,69582 ----
  <tt>ios_base::Init</tt> with static lifetime. Similarly, the entire
  program shall behave as if there were at least one instance of
  <tt>ios_base::Init</tt> with static lifetime.</ins>
! </p></blockquote>
  
  <p>
! Change 27.5.3.1.6 [ios::Init]/3:
  </p>
  
  <blockquote>
! <pre>
! Init();
  </pre>
! <blockquote><p>
  -3- <i>Effects:</i> Constructs an object of class <tt>Init</tt>. 
  <del>If <tt>init_cnt</tt> is zero, the function stores the value one in
  <tt>init_cnt</tt>, then constructs and initializes the objects
*************** Change 27.5.2.1.6 [ios::Init]/3:
*** 63842,63858 ****
  <tt>cerr</tt>, <tt>clog</tt>, <tt>wcin</tt>, <tt>wcout</tt>,
  <tt>wcerr</tt> and <tt>wclog</tt> if they have not already been
  constructed and initialized.</ins>
! </blockquote>
  </blockquote>
  
  <p>
! Change 27.5.2.1.6 [ios::Init]/4:
  </p>
  
  <blockquote>
! <pre>~Init();
  </pre>
! <blockquote>
  -4- <i>Effects:</i> Destroys an object of class <tt>Init</tt>.
  <del>The function subtracts one from the value stored in <tt>init_cnt</tt> and,
  if the resulting stored value is one,</del>
--- 69588,69605 ----
  <tt>cerr</tt>, <tt>clog</tt>, <tt>wcin</tt>, <tt>wcout</tt>,
  <tt>wcerr</tt> and <tt>wclog</tt> if they have not already been
  constructed and initialized.</ins>
! </p></blockquote>
  </blockquote>
  
  <p>
! Change 27.5.3.1.6 [ios::Init]/4:
  </p>
  
  <blockquote>
! <pre>
! ~Init();
  </pre>
! <blockquote><p>
  -4- <i>Effects:</i> Destroys an object of class <tt>Init</tt>.
  <del>The function subtracts one from the value stored in <tt>init_cnt</tt> and,
  if the resulting stored value is one,</del>
*************** existance,</ins>
*** 63861,63867 ****
  calls <tt>cout.flush()</tt>,
  <tt>cerr.flush()</tt>, <tt>clog.flush()</tt>, <tt>wcout.flush()</tt>,
  <tt>wcerr.flush()</tt>, <tt>wclog.flush()</tt>.
! </blockquote>
  </blockquote>
  
  
--- 69608,69614 ----
  calls <tt>cout.flush()</tt>,
  <tt>cerr.flush()</tt>, <tt>clog.flush()</tt>, <tt>wcout.flush()</tt>,
  <tt>wcerr.flush()</tt>, <tt>wclog.flush()</tt>.
! </p></blockquote>
  </blockquote>
  
  
*************** calls <tt>cout.flush()</tt>,
*** 63871,63880 ****
  
  <hr>
  <h3><a name="1126"></a>1126. <tt>istreambuff_iterator::equal</tt> needs a const &amp; parameter</h3>
! <p><b>Section:</b> 24.6.3.5 [istreambuf.iterator::equal] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istreambuf.iterator::equal">issues</a> in [istreambuf.iterator::equal].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>equal</tt> member function of <tt>istreambuf_iterator</tt> is
--- 69618,69627 ----
  
  <hr>
  <h3><a name="1126"></a>1126. <tt>istreambuff_iterator::equal</tt> needs a const &amp; parameter</h3>
! <p><b>Section:</b> 24.6.3.5 [istreambuf.iterator::equal] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istreambuf.iterator::equal">issues</a> in [istreambuf.iterator::equal].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>equal</tt> member function of <tt>istreambuf_iterator</tt> is
*************** const.
*** 63887,63893 ****
  </p>
  
  <p><i>[
! The proposed wording is consistent with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#110">110</a> with status TC1.
  ]</i></p>
  
  
--- 69634,69640 ----
  </p>
  
  <p><i>[
! The proposed wording is consistent with <a href="lwg-defects.html#110">110</a> with status TC1.
  ]</i></p>
  
  
*************** The proposed wording is consistent with
*** 63896,63915 ****
  ]</i></p>
  
  
! <blockquote>
  Set to Tentatively Ready after 5 positive votes on c++std-lib.
  </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Ammend in both:<br>
! 24.6.3 [istreambuf.iterator]<br>
! 24.6.3.5 [istreambuf.iterator::equal]<br>
  </p>
  
! <blockquote><pre>bool equal(<ins>const </ins>istreambuf_iterator&amp; b) const;
  </pre></blockquote>
  
  
--- 69643,69849 ----
  ]</i></p>
  
  
! <blockquote><p>
  Set to Tentatively Ready after 5 positive votes on c++std-lib.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Ammend in both:<br/>
+ 24.6.3 [istreambuf.iterator]<br/>
+ 24.6.3.5 [istreambuf.iterator::equal]<br/>
+ </p>
+ 
+ <blockquote><pre>
+ bool equal(<ins>const </ins>istreambuf_iterator&amp; b) const;
+ </pre></blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1129"></a>1129. <tt>istream(buf)_iterator</tt> should support literal sentinel value</h3>
+ <p><b>Section:</b> 24.6.1.1 [istream.iterator.cons], 24.6.3 [istreambuf.iterator] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-30 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#istream.iterator.cons">issues</a> in [istream.iterator.cons].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ <tt>istream_iterator</tt> and <tt>istreambuf_iterator</tt> should support literal sentinel
+ values.  The default constructor is frequently used to terminate ranges, and
+ could easily be a literal value for <tt>istreambuf_iterator</tt>, and
+ <tt>istream_iterator</tt> when iterating value types.  A little more work using a
+ suitably sized/aligned char-array for storage (or an updated component like
+ <tt>boost::optional</tt> proposed for TR2) would allow <tt>istream_iterator</tt> to support
+ <tt>constexpr</tt> default constructor in all cases, although we might leave this
+ tweak as a QoI issue.  Note that requiring <tt>constexpr</tt> be supported also
+ allows us to place no-throw guarantees on this constructor too.
+ </p>
+ 
+ <p><i>[
+ 2009-06-02 Daniel adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ I agree with the usefulness of the issue suggestion, but we need
+ to ensure that <tt>istream_iterator</tt> <em>can</em> satisfy be literal if needed.
+ Currently this is not clear, because 24.6.1 [istream.iterator]/3 declares
+ a copy constructor and a destructor and explains their semantic in
+ 24.6.1.1 [istream.iterator.cons]/3+4.
+ </p>
+ <p>
+ The prototype semantic specification is ok (although it seems
+ somewhat redundant to me, because the semantic doesn't say
+ anything interesting in both cases), but for support of trivial class
+ types we also need a trivial copy constructor and destructor as of
+ 9 [class]/6. The current non-informative specification of these
+ two special members suggests to remove their explicit declaration
+ in the class and add explicit wording that says that if <tt>T</tt> is
+ trivial a default constructed iterator is also literal, alternatively it
+ would be possible to mark both as defaulted and add explicit
+ (memberwise) wording that guarantees that they are trivial.
+ </p>
+ <p>
+ Btw.: I'm quite sure that the <tt>istreambuf_iterator</tt> additions to
+ ensure triviality are not sufficient as suggested, because the
+ library does not yet give general guarantees that a defaulted
+ special member declaration makes this member also trivial.
+ Note that e.g. the atomic types do give a general statement!
+ </p>
+ <p>
+ Finally there is a wording issue: There does not exist something
+ like a "literal constructor". The core language uses the term
+ "constexpr constructor" for this.
+ </p>
+ <p>
+ Suggestion:
+ </p>
+ <ol>
+ <li>
+ <p>
+ Change 24.6.1 [istream.iterator]/3 as indicated:
+ </p>
+ <blockquote><pre>
+ <ins>constexpr</ins> istream_iterator();
+ istream_iterator(istream_type&amp; s);
+ istream_iterator(const istream_iterator<del>&lt;T,charT,traits,Distance&gt;</del>&amp; x)<ins> = default</ins>;
+ ~istream_iterator()<ins> = default</ins>;
+ </pre></blockquote>
+ </li>
+ <li>
+ <p>
+ Change 24.6.1.1 [istream.iterator.cons]/1 as indicated:
+ </p>
+ <blockquote><pre>
+ <ins>constexpr</ins> istream_iterator();
+ </pre>
+ <blockquote><p>
+ -1- <i>Effects:</i> Constructs the end-of-stream iterator. <ins>If <tt>T</tt> is a literal type,
+ then this constructor shall be a constexpr constructor.</ins>
+ </p></blockquote>
  </blockquote>
+ </li>
+ <li>
+ <p>
+ Change 24.6.1.1 [istream.iterator.cons]/3 as indicated:
+ </p>
+ <blockquote><pre>
+ istream_iterator(const istream_iterator<del>&lt;T,charT,traits,Distance&gt;</del>&amp; x)<ins> = default</ins>;
+ </pre>
+ <blockquote><p>
+ -3- <i>Effects:</i> Constructs a copy of <tt>x</tt>. <ins>If <tt>T</tt> is a literal type, then
+ this constructor shall be a trivial copy constructor.</ins>
+ </p></blockquote>
+ </blockquote>
+ </li>
+ <li>
+ <p>
+ Change 24.6.1.1 [istream.iterator.cons]/4 as indicated:
+ </p>
+ 
+ <blockquote><pre>
+ ~istream_iterator()<ins> = default</ins>;
+ </pre>
+ <blockquote><p>
+ -4- <i>Effects:</i> The iterator is destroyed. <ins>If <tt>T</tt> is a literal type, then
+ this destructor shall be a trivial
+ destructor.</ins>
+ </p></blockquote>
+ </blockquote>
+ </li>
+ <li>
+ <p>
+ Change 24.6.3 [istreambuf.iterator] before p. 1 as indicated:
+ </p>
+ 
+ <blockquote><pre>
+ <ins>constexpr</ins> istreambuf_iterator() throw();
+ <ins>istreambuf_iterator(const istreambuf_iterator&amp;)  throw() = default;</ins>
+ <ins>~istreambuf_iterator()  throw() = default;</ins>
+ </pre></blockquote>
+ </li>
+ <li>
+ <p>
+ Change 24.6.3 [istreambuf.iterator]/1 as indicated:
+ </p>
+ <blockquote><p>
+ [..] The default constructor <tt>istreambuf_iterator()</tt> and the constructor
+ <tt>istreambuf_iterator(0)</tt> both construct an end of stream iterator object 
+ suitable for use as an end-of-range. <ins>All specializations of 
+ <tt>istreambuf_iterator</tt> shall have a trivial copy constructor, a constexpr 
+ default constructor and a trivial destructor.</ins>
+ </p></blockquote>
+ </li>
+ </ol>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.htm">N2994</a>.
+ </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 24.6.1 [istream.iterator] para 3
  </p>
  
! <blockquote><pre>
! <ins>constexpr</ins> istream_iterator();
! </pre></blockquote>
! 
! <p>
! 24.6.1.1 [istream.iterator.cons]
! </p>
! 
! <blockquote><pre>
! <ins>constexpr</ins> istream_iterator();
! </pre>
! <blockquote><p>
! -1- <i>Effects:</i> Constructs the end-of-stream iterator.
! <ins>If <tt>T</tt> is a literal type, then this constructor shall
! be a literal constructor.</ins>
! </p></blockquote>
! </blockquote>
! 
! <p>
! 24.6.3 [istreambuf.iterator]
! </p>
! 
! <blockquote><pre>
! <ins>constexpr</ins> istreambuf_iterator() throw();
  </pre></blockquote>
  
  
*************** Ammend in both:<br>
*** 63919,63929 ****
  
  <hr>
  <h3><a name="1130"></a>1130. <tt>copy_exception</tt> name misleading</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2009-05-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The naming of <tt>std::copy_exception</tt> misleads almost everyone
--- 69853,69862 ----
  
  <hr>
  <h3><a name="1130"></a>1130. <tt>copy_exception</tt> name misleading</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2009-05-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The naming of <tt>std::copy_exception</tt> misleads almost everyone
*************** The naming of <tt>std::copy_exception</t
*** 63931,63937 ****
  <tt>exception_ptr</tt>:
  </p>
  
! <blockquote><pre>exception_ptr p1 = current_exception();
  exception_ptr p2 = copy_exception( p1 );
  </pre></blockquote>
  
--- 69864,69871 ----
  <tt>exception_ptr</tt>:
  </p>
  
! <blockquote><pre>
! exception_ptr p1 = current_exception();
  exception_ptr p2 = copy_exception( p1 );
  </pre></blockquote>
  
*************** Therefore, I propose <tt>copy_exception<
*** 63952,63967 ****
  <tt>create_exception</tt>:
  </p>
  
! <blockquote><pre>template&lt;class E&gt; exception_ptr create_exception(E e);
  </pre></blockquote>
  
  <p>
  with the following explanatory paragraph after it:
  </p>
  
! <blockquote>
  Creates an <tt>exception_ptr</tt> that refers to a copy of <tt>e</tt>.
! </blockquote>
  
  <p><i>[
  2009-05-13 Daniel adds:
--- 69886,69902 ----
  <tt>create_exception</tt>:
  </p>
  
! <blockquote><pre>
! template&lt;class E&gt; exception_ptr create_exception(E e);
  </pre></blockquote>
  
  <p>
  with the following explanatory paragraph after it:
  </p>
  
! <blockquote><p>
  Creates an <tt>exception_ptr</tt> that refers to a copy of <tt>e</tt>.
! </p></blockquote>
  
  <p><i>[
  2009-05-13 Daniel adds:
*************** Creates an <tt>exception_ptr</tt> that r
*** 63972,63978 ****
  <p>
  What about
  </p>
! <blockquote><pre>make_exception_ptr
  </pre></blockquote>
  <p>
  in similarity to <tt>make_pair</tt> and <tt>make_tuple</tt>, <tt>make_error_code</tt> and
--- 69907,69914 ----
  <p>
  What about
  </p>
! <blockquote><pre>
! make_exception_ptr
  </pre></blockquote>
  <p>
  in similarity to <tt>make_pair</tt> and <tt>make_tuple</tt>, <tt>make_error_code</tt> and
*************** in similarity to <tt>make_pair</tt> and
*** 63980,63986 ****
  <tt>current_exception</tt> is preferred:
  </p>
  
! <blockquote><pre>make_exception
  </pre></blockquote>
  <p>
  We have not a single <tt>create_*</tt> function in the library, it was always
--- 69916,69923 ----
  <tt>current_exception</tt> is preferred:
  </p>
  
! <blockquote><pre>
! make_exception
  </pre></blockquote>
  <p>
  We have not a single <tt>create_*</tt> function in the library, it was always
*************** We have not a single <tt>create_*</tt> f
*** 63993,64001 ****
  ]</i></p>
  
  
! <blockquote>
  <tt>make_exception_ptr</tt> works for me.
! </blockquote>
  
  <p><i>[
  2009-06-02 Thomas J. Gritzan adds:
--- 69930,69938 ----
  ]</i></p>
  
  
! <blockquote><p>
  <tt>make_exception_ptr</tt> works for me.
! </p></blockquote>
  
  <p><i>[
  2009-06-02 Thomas J. Gritzan adds:
*************** To avoid surprises and unwanted recursio
*** 64010,64016 ****
  <p>
  It might work like this:
  </p>
! <blockquote><pre>template&lt;class E&gt;
  exception_ptr make_exception_ptr(E e);
  template&lt;&gt;
  exception_ptr make_exception_ptr&lt;exception_ptr&gt;(exception_ptr e) = delete;
--- 69947,69954 ----
  <p>
  It might work like this:
  </p>
! <blockquote><pre>
! template&lt;class E&gt;
  exception_ptr make_exception_ptr(E e);
  template&lt;&gt;
  exception_ptr make_exception_ptr&lt;exception_ptr&gt;(exception_ptr e) = delete;
*************** exception_ptr make_exception_ptr&lt;exce
*** 64022,64045 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Review for the time being. The subgroup thinks this is a good
  idea, but doesn't want to break compatibility unnecessarily if someone
  is already shipping this. Let's talk to Benjamin and PJP tomorrow to
  make sure neither objects.
! </blockquote>
  
  <p><i>[
  2009-11-16 Jonathan Wakely adds:
  ]</i></p>
  
  
! <blockquote>
  GCC 4.4 shipped with <tt>copy_exception</tt> but we could certainly keep that
  symbol in the library (but not the headers) so it can still be found
  by any apps foolishly relying on the experimental C++0x mode being ABI
  stable.
! </blockquote>
  
  <p><i>[
  2009-11-16 Peter adopts wording supplied by Daniel.
--- 69960,69983 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Review for the time being. The subgroup thinks this is a good
  idea, but doesn't want to break compatibility unnecessarily if someone
  is already shipping this. Let's talk to Benjamin and PJP tomorrow to
  make sure neither objects.
! </p></blockquote>
  
  <p><i>[
  2009-11-16 Jonathan Wakely adds:
  ]</i></p>
  
  
! <blockquote><p>
  GCC 4.4 shipped with <tt>copy_exception</tt> but we could certainly keep that
  symbol in the library (but not the headers) so it can still be found
  by any apps foolishly relying on the experimental C++0x mode being ABI
  stable.
! </p></blockquote>
  
  <p><i>[
  2009-11-16 Peter adopts wording supplied by Daniel.
*************** Change 18.8 [support.exception]/1, heade
*** 64060,64066 ****
  synopsis as indicated:
  </p>
  
! <blockquote><pre>exception_ptr current_exception();
  void rethrow_exception [[noreturn]] (exception_ptr p);
  template&lt;class E&gt; exception_ptr <del>copy_exception</del><ins>make_exception_ptr</ins>(E e);
  </pre></blockquote>
--- 69998,70005 ----
  synopsis as indicated:
  </p>
  
! <blockquote><pre>
! exception_ptr current_exception();
  void rethrow_exception [[noreturn]] (exception_ptr p);
  template&lt;class E&gt; exception_ptr <del>copy_exception</del><ins>make_exception_ptr</ins>(E e);
  </pre></blockquote>
*************** Change 18.8.5 [propagation]:
*** 64072,64078 ****
  </p>
  
  <blockquote>
! <pre>template&lt;class E&gt; exception_ptr <del>copy_exception</del><ins>make_exception_ptr</ins>(E e);
  </pre>
  
  <blockquote>
--- 70011,70018 ----
  </p>
  
  <blockquote>
! <pre>
! template&lt;class E&gt; exception_ptr <del>copy_exception</del><ins>make_exception_ptr</ins>(E e);
  </pre>
  
  <blockquote>
*************** Change 18.8.5 [propagation]:
*** 64081,64087 ****
  to a copy of <tt>e</tt>,</ins> as if
  </p>
  
! <blockquote><pre>try {
    throw e;
  } catch(...) {
    return current_exception();
--- 70021,70028 ----
  to a copy of <tt>e</tt>,</ins> as if
  </p>
  
! <blockquote><pre>
! try {
    throw e;
  } catch(...) {
    return current_exception();
*************** to a copy of <tt>e</tt>,</ins> as if
*** 64099,64110 ****
  Change 30.6.5 [futures.promise]/7 as indicated:
  </p>
  
! <blockquote>
  <i>Effects:</i> if the associated state of <tt>*this</tt> is not ready, stores an exception
  object of type <tt>future_error</tt> with an error code of <tt>broken_promise</tt> as if by
  <tt>this-&gt;set_exception(<del>copy_exception</del><ins>make_exception_ptr</ins>(
  future_error(future_errc::broken_promise))</tt>.  Destroys ...
! </blockquote>
  </li>
  </ol>
  
--- 70040,70051 ----
  Change 30.6.5 [futures.promise]/7 as indicated:
  </p>
  
! <blockquote><p>
  <i>Effects:</i> if the associated state of <tt>*this</tt> is not ready, stores an exception
  object of type <tt>future_error</tt> with an error code of <tt>broken_promise</tt> as if by
  <tt>this-&gt;set_exception(<del>copy_exception</del><ins>make_exception_ptr</ins>(
  future_error(future_errc::broken_promise))</tt>.  Destroys ...
! </p></blockquote>
  </li>
  </ol>
  
*************** future_error(future_errc::broken_promise
*** 64115,64131 ****
  
  <hr>
  <h3><a name="1131"></a>1131. C++0x does not need <tt>alignment_of</tt></h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2009-06-01 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>alignment_of</tt> template is no longer necessary, now that the
  core language will provide <tt>alignof</tt>. Scott Meyers raised this
  issue at comp.std.c++,
  <a href="http://groups.google.com/group/comp.std.c++/browse_thread/thread/9b020306e803f08a">C++0x: alignof vs. alignment_of</a>,
! May 21, 2009.  In a reply, Daniel Krügler pointed out that
  <tt>alignof</tt> was added to the working paper <i>after</i>
  <tt>alignment_of</tt>. So it appears that <tt>alignment_of</tt> is only
  part of the current Working Draft 
--- 70056,70073 ----
  
  <hr>
  <h3><a name="1131"></a>1131. C++0x does not need <tt>alignment_of</tt></h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Niels Dekker <b>Opened:</b> 2009-06-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>alignment_of</tt> template is no longer necessary, now that the
  core language will provide <tt>alignof</tt>. Scott Meyers raised this
  issue at comp.std.c++,
  <a href="http://groups.google.com/group/comp.std.c++/browse_thread/thread/9b020306e803f08a">C++0x: alignof vs. alignment_of</a>,
! May 21, 2009.  In a reply, Daniel Kr&uuml;gler pointed out that
  <tt>alignof</tt> was added to the working paper <i>after</i>
  <tt>alignment_of</tt>. So it appears that <tt>alignment_of</tt> is only
  part of the current Working Draft 
*************** Suggested Resolution:
*** 64161,64203 ****
  <blockquote>
  <p>
  Change the first row of Table 44 ("Type property queries"), from Type properties
! 20.7.4.3 [meta.unary.prop]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 44 — Type property queries</caption>
! <tbody><tr>
  <td>
  <tt>template &lt;class T&gt; struct alignment_of;</tt>
  </td>
  <td>
! <tt>alignof(T)</tt>.<br>
  <i>Precondition:</i> <del><tt>T</tt> shall be a complete type, a reference type,
  or an array of unknown bound, but shall not be a function type or (possibly
  cv-qualified) <tt>void</tt>.</del> <ins><tt>alignof(T)</tt> shall be defined</ins>
  </td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  <p>
  Change text in Table 51 ("Other transformations"), from Other transformations
! 20.7.7.6 [meta.trans.other], as follows:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 51 — Other transformations</caption>
! <tbody><tr><td>...<tt>aligned_storage;</tt></td>
  <td>
  <tt>Len</tt> shall not be zero. <tt>Align</tt> shall be equal to
  <tt><del>alignment_of&lt;T&gt;::value</del> <ins>alignof(T)</ins></tt> for some
  type <tt>T</tt> or to <i>default-alignment</i>.
  </td>
! <td>...</td>
! </tr></tbody></table>
  </blockquote>
  </blockquote>
  </blockquote>
--- 70103,70147 ----
  <blockquote>
  <p>
  Change the first row of Table 44 ("Type property queries"), from Type properties
! 20.10.4.3 [meta.unary.prop]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 44 &mdash; Type property queries</caption>
! <tr>
  <td>
  <tt>template &lt;class T&gt; struct alignment_of;</tt>
  </td>
  <td>
! <tt>alignof(T)</tt>.<br/>
  <i>Precondition:</i> <del><tt>T</tt> shall be a complete type, a reference type,
  or an array of unknown bound, but shall not be a function type or (possibly
  cv-qualified) <tt>void</tt>.</del> <ins><tt>alignof(T)</tt> shall be defined</ins>
  </td>
  </tr>
  
! </table>
  </blockquote>
  
  <p>
  Change text in Table 51 ("Other transformations"), from Other transformations
! 20.10.7.6 [meta.trans.other], as follows:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 51 &mdash; Other transformations</caption>
! <tr>
! <td>&hellip;<tt>aligned_storage;</tt></td>
  <td>
  <tt>Len</tt> shall not be zero. <tt>Align</tt> shall be equal to
  <tt><del>alignment_of&lt;T&gt;::value</del> <ins>alignof(T)</ins></tt> for some
  type <tt>T</tt> or to <i>default-alignment</i>.
  </td>
! <td>&hellip;</td>
! </tr>
! </table>
  </blockquote>
  </blockquote>
  </blockquote>
*************** Original proposed wording saved here:
*** 64214,64257 ****
  </p>
  <blockquote>
  <p>
! Remove from Header &lt;type_traits&gt; synopsis 20.7.2 [meta.type.synop]:
  </p>
! <blockquote><pre><del>template &lt;class T&gt; struct alignment_of;</del>
  </pre></blockquote>
  
  <p>
  Remove the first row of Table 44 ("Type property queries"), from
! Type properties 20.7.4.3 [meta.unary.prop]:
  </p>
  <blockquote>
  <table border="1">
! <caption>Table 44 — Type property queries</caption>
! <tbody><tr>
  <td><del><tt>template &lt;class T&gt; struct alignment_of;</tt></del></td>
! <td><del><tt>alignof(T)</tt>.</del><br>
  <del><i>Precondition:</i> <tt>T</tt> shall be a complete type, a reference
  type, or an array of unknown bound, but shall not be a function type or
  (possibly cv-qualified) <tt>void</tt>.</del>
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
  Change text in Table 51 ("Other transformations"), from Other
! transformations 20.7.7.6 [meta.trans.other], as follows:
  </p>
  <blockquote>
  <table border="1">
! <caption>Table 51 — Other transformations</caption>
! <tbody><tr><td>...<tt>aligned_storage;</tt></td>
  <td>
  <tt>Len</tt> shall not be zero.  Align shall be equal to
  <tt><del>alignment_of&lt;T&gt;::value</del> <ins>alignof(T)</ins></tt> for some
  type <tt>T</tt> or to <i>default-alignment</i>.
  </td>
! <td>...</td>
! </tr></tbody></table>
  </blockquote>
  </blockquote>
  </blockquote>
--- 70158,70204 ----
  </p>
  <blockquote>
  <p>
! Remove from Header &lt;type_traits&gt; synopsis 20.10.2 [meta.type.synop]:
  </p>
! <blockquote><pre>
! <del>template &lt;class T&gt; struct alignment_of;</del>
  </pre></blockquote>
  
  <p>
  Remove the first row of Table 44 ("Type property queries"), from
! Type properties 20.10.4.3 [meta.unary.prop]:
  </p>
  <blockquote>
  <table border="1">
! <caption>Table 44 &mdash; Type property queries</caption>
! <tr>
  <td><del><tt>template &lt;class T&gt; struct alignment_of;</tt></del></td>
! <td><del><tt>alignof(T)</tt>.</del><br/>
  <del><i>Precondition:</i> <tt>T</tt> shall be a complete type, a reference
  type, or an array of unknown bound, but shall not be a function type or
  (possibly cv-qualified) <tt>void</tt>.</del>
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
  Change text in Table 51 ("Other transformations"), from Other
! transformations 20.10.7.6 [meta.trans.other], as follows:
  </p>
  <blockquote>
  <table border="1">
! <caption>Table 51 &mdash; Other transformations</caption>
! <tr>
! <td>&hellip;<tt>aligned_storage;</tt></td>
  <td>
  <tt>Len</tt> shall not be zero.  Align shall be equal to
  <tt><del>alignment_of&lt;T&gt;::value</del> <ins>alignof(T)</ins></tt> for some
  type <tt>T</tt> or to <i>default-alignment</i>.
  </td>
! <td>&hellip;</td>
! </tr>
! </table>
  </blockquote>
  </blockquote>
  </blockquote>
*************** type <tt>T</tt> or to <i>default-alignme
*** 64267,64284 ****
  
  <p>
  Change the first row of Table 43 ("Type property queries"), from Type properties
! 20.7.4.3 [meta.unary.prop]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 43 — Type property queries</caption>
! <tbody><tr>
  <td>
  <tt>template &lt;class T&gt; struct alignment_of;</tt>
  </td>
  <td>
! <tt>alignof(T)</tt>.<br>
  <i>Precondition:</i> <del><tt>T</tt> shall be a complete type, a reference type,
  or an array of unknown bound, but shall not be a function type or (possibly
  cv-qualified) <tt>void</tt>.</del> <ins><tt>alignof(T)</tt> is a valid
--- 70214,70231 ----
  
  <p>
  Change the first row of Table 43 ("Type property queries"), from Type properties
! 20.10.4.3 [meta.unary.prop]:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 43 &mdash; Type property queries</caption>
! <tr>
  <td>
  <tt>template &lt;class T&gt; struct alignment_of;</tt>
  </td>
  <td>
! <tt>alignof(T)</tt>.<br/>
  <i>Precondition:</i> <del><tt>T</tt> shall be a complete type, a reference type,
  or an array of unknown bound, but shall not be a function type or (possibly
  cv-qualified) <tt>void</tt>.</del> <ins><tt>alignof(T)</tt> is a valid
*************** expression (5.3.6 [expr.alignof])</ins>
*** 64286,64310 ****
  </td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  <p>
  Change text in Table 51 ("Other transformations"), from Other transformations
! 20.7.7.6 [meta.trans.other], as follows:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 51 — Other transformations</caption>
! <tbody><tr><td>...<tt>aligned_storage;</tt></td>
  <td>
  <tt>Len</tt> shall not be zero. <tt>Align</tt> shall be equal to
  <tt><del>alignment_of&lt;T&gt;::value</del> <ins>alignof(T)</ins></tt> for some
  type <tt>T</tt> or to <i>default-alignment</i>.
  </td>
! <td>...</td>
! </tr></tbody></table>
  </blockquote>
  
  
--- 70233,70259 ----
  </td>
  </tr>
  
! </table>
  </blockquote>
  
  <p>
  Change text in Table 51 ("Other transformations"), from Other transformations
! 20.10.7.6 [meta.trans.other], as follows:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 51 &mdash; Other transformations</caption>
! <tr>
! <td>&hellip;<tt>aligned_storage;</tt></td>
  <td>
  <tt>Len</tt> shall not be zero. <tt>Align</tt> shall be equal to
  <tt><del>alignment_of&lt;T&gt;::value</del> <ins>alignof(T)</ins></tt> for some
  type <tt>T</tt> or to <i>default-alignment</i>.
  </td>
! <td>&hellip;</td>
! </tr>
! </table>
  </blockquote>
  
  
*************** type <tt>T</tt> or to <i>default-alignme
*** 64314,64330 ****
  
  <hr>
  <h3><a name="1133"></a>1133. Does N2844 break current specification of list::splice?</h3>
! <p><b>Section:</b> 23.3.3.5 [forwardlist.ops], 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-09 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  IIUC,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2844.html">N2844</a>
  means that lvalues will no longer bind to rvalue references.
  Therefore, the current specification of <tt>list::splice</tt> (list
! operations 23.3.4.4 [list.ops]) will be a breaking change of behaviour for existing
  programs.  That is because we changed the signature to swallow via an rvalue
  reference rather than the lvalue reference used in 03.
  </p>
--- 70263,70279 ----
  
  <hr>
  <h3><a name="1133"></a>1133. Does N2844 break current specification of list::splice?</h3>
! <p><b>Section:</b> 23.3.4.6 [forwardlist.ops], 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-05-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  IIUC,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2844.html">N2844</a>
  means that lvalues will no longer bind to rvalue references.
  Therefore, the current specification of <tt>list::splice</tt> (list
! operations 23.3.5.5 [list.ops]) will be a breaking change of behaviour for existing
  programs.  That is because we changed the signature to swallow via an rvalue
  reference rather than the lvalue reference used in 03.
  </p>
*************** breaking programs so here it might be vi
*** 64337,64343 ****
  <p>
  The problem signatures:
  </p>
! <blockquote><pre>void splice_after(const_iterator position, forward_list&lt;T,Alloc&gt;&amp;&amp; x);
  void splice_after(const_iterator position, forward_list&lt;T,Alloc&gt;&amp;&amp; x,
                    const_iterator i);
  void splice_after(const_iterator position, forward_list&lt;T,Alloc&gt;&amp;&amp; x,
--- 70286,70293 ----
  <p>
  The problem signatures:
  </p>
! <blockquote><pre>
! void splice_after(const_iterator position, forward_list&lt;T,Alloc&gt;&amp;&amp; x);
  void splice_after(const_iterator position, forward_list&lt;T,Alloc&gt;&amp;&amp; x,
                    const_iterator i);
  void splice_after(const_iterator position, forward_list&lt;T,Alloc&gt;&amp;&amp; x,
*************** void splice(const_iterator position, lis
*** 64350,64356 ****
--- 70300,70308 ----
              const_iterator first, const_iterator last);
  </pre></blockquote>
  
+ <p>
  <b>Possible resolutions:</b>
+ </p>
  
  <p>
  Option A.   Add an additional (non-const) lvalue-reference
*************** Wording updated.
*** 64405,64418 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.3.4 [list]
  </p>
  
  <p>
  Add lvalue overloads before rvalue ones:
  </p>
  
! <blockquote><pre><ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x);
  <ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x, const_iterator i);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator i);
--- 70357,70371 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.3.5 [list]
  </p>
  
  <p>
  Add lvalue overloads before rvalue ones:
  </p>
  
! <blockquote><pre>
! <ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x);
  <ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x, const_iterator i);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator i);
*************** template &lt;class Compare&gt; void merg
*** 64428,64440 ****
  </pre></blockquote>
  
  <p>
! In 23.3.4.4 [list.ops], similarly add lvalue overload before each rvalue one:
  </p>
  <p>
  (After paragraph 2)
  </p>
  
! <blockquote><pre><ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x);
  </pre></blockquote>
  
--- 70381,70394 ----
  </pre></blockquote>
  
  <p>
! In 23.3.5.5 [list.ops], similarly add lvalue overload before each rvalue one:
  </p>
  <p>
  (After paragraph 2)
  </p>
  
! <blockquote><pre>
! <ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x);
  </pre></blockquote>
  
*************** void splice(const_iterator position, lis
*** 64442,64448 ****
  (After paragraph 6)
  </p>
  
! <blockquote><pre><ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x, const_iterator i);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x, <ins>const_</ins>iterator i);
  </pre></blockquote>
  
--- 70396,70403 ----
  (After paragraph 6)
  </p>
  
! <blockquote><pre>
! <ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x, const_iterator i);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x, <ins>const_</ins>iterator i);
  </pre></blockquote>
  
*************** void splice(const_iterator position, lis
*** 64450,64466 ****
  (After paragraph 10)
  </p>
  
! <blockquote><pre><ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x,
              const_iterator first, const_iterator last);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x,
              <ins>const_</ins>iterator first, <ins>const_</ins>iterator last);
  </pre></blockquote>
  
  <p>
! In 23.3.4.4 [list.ops], after paragraph 21
  </p>
  
! <blockquote><pre><ins>void merge(list&lt;T,Allocator&gt;&amp; x);
  template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp; x, Compare comp);</ins>
  void merge(list&lt;T,Allocator&gt;&amp;&amp; x);
  template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);
--- 70405,70423 ----
  (After paragraph 10)
  </p>
  
! <blockquote><pre>
! <ins>void splice(const_iterator position, list&lt;T,Allocator&gt;&amp; x,
              const_iterator first, const_iterator last);</ins>
  void splice(const_iterator position, list&lt;T,Allocator&gt;&amp;&amp; x,
              <ins>const_</ins>iterator first, <ins>const_</ins>iterator last);
  </pre></blockquote>
  
  <p>
! In 23.3.5.5 [list.ops], after paragraph 21
  </p>
  
! <blockquote><pre>
! <ins>void merge(list&lt;T,Allocator&gt;&amp; x);
  template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp; x, Compare comp);</ins>
  void merge(list&lt;T,Allocator&gt;&amp;&amp; x);
  template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);
*************** template &lt;class Compare&gt; void merg
*** 64472,64481 ****
  
  
  <hr>
! <h3><a name="1134"></a>1134. Redundant specification of stdint.h, fenv.h, tgmath.h, and maybe complex.h</h3>
! <p><b>Section:</b> X [stdinth], X [fenv], 26.8 [c.math], X [cmplxh] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2009-05-26 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This is probably editorial.
--- 70429,70439 ----
  
  
  <hr>
! <h3><a name="1134"></a>1134. Redundant specification of <tt>&lt;stdint.h&gt;</tt>, <tt>&lt;fenv.h&gt;</tt>, <tt>&lt;tgmath.h&gt;</tt>, 
!        and maybe <tt>&lt;complex.h&gt;</tt></h3>
! <p><b>Section:</b> X [stdinth], X [fenv], 26.8 [c.math], X [cmplxh] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Robert Klarer <b>Opened:</b> 2009-05-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This is probably editorial.
*************** X [cmplxh] (regarding <tt>&lt;complex.h&
*** 64503,64522 ****
  ]</i></p>
  
  
! <blockquote>
  While searching for <tt>stdint</tt> in the CD, I found that <tt>&lt;stdint.h&gt;</tt> is also
! mentioned in 3.9.1 [basic.fundamental] /5. It guess it should refer to
  <tt>&lt;cstdint&gt;</tt> instead.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Real issue. Maybe just editorial, maybe not. Move to Ready.
! </blockquote>
  
  
  
--- 70461,70480 ----
  ]</i></p>
  
  
! <blockquote><p>
  While searching for <tt>stdint</tt> in the CD, I found that <tt>&lt;stdint.h&gt;</tt> is also
! mentioned in 3.9.1 [basic.fundamental] p.5. I guess it should refer to
  <tt>&lt;cstdint&gt;</tt> instead.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Real issue. Maybe just editorial, maybe not. Move to Ready.
! </p></blockquote>
  
  
  
*************** Remove the section X [fenv].
*** 64531,64540 ****
  Remove 26.8 [c.math], p3:
  </p>
  
! <blockquote>
  <del>-3- The header <tt>&lt;tgmath.h&gt;</tt> effectively includes the headers <tt>&lt;complex.h&gt;</tt>
  and <tt>&lt;math.h&gt;</tt>.</del>
! </blockquote>
  <p>
  Remove the section X [cmplxh].
  </p>
--- 70489,70498 ----
  Remove 26.8 [c.math], p3:
  </p>
  
! <blockquote><p>
  <del>-3- The header <tt>&lt;tgmath.h&gt;</tt> effectively includes the headers <tt>&lt;complex.h&gt;</tt>
  and <tt>&lt;math.h&gt;</tt>.</del>
! </p></blockquote>
  <p>
  Remove the section X [cmplxh].
  </p>
*************** Remove the section X [cmplxh].
*** 64545,64564 ****
  
  <hr>
  <h3><a name="1135"></a>1135. <tt>exception_ptr</tt> should support contextual conversion to <tt>bool</tt></h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-06-06 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2857.pdf">N2857</a>
! 18.8.5 [propagation]/5, the implementation-defined type
  <tt>exception_ptr</tt> does provide the following ways to check whether
  it is a null value:
  </p>
! <blockquote><pre>void f(std::exception_ptr p) {
    p == nullptr;
    p == 0;
    p == exception_ptr();
--- 70503,70522 ----
  
  <hr>
  <h3><a name="1135"></a>1135. <tt>exception_ptr</tt> should support contextual conversion to <tt>bool</tt></h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-06-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2857.pdf">N2857</a>
! 18.8.5 [propagation] p.5, the implementation-defined type
  <tt>exception_ptr</tt> does provide the following ways to check whether
  it is a null value:
  </p>
! <blockquote><pre>
! void f(std::exception_ptr p) {
    p == nullptr;
    p == 0;
    p == exception_ptr();
*************** and I suggest to require support for eva
*** 64570,64576 ****
  context like so:
  </p>
  
! <blockquote><pre>void g(std::exception_ptr p) {
    if (p) {}
    !p;
  }
--- 70528,70535 ----
  context like so:
  </p>
  
! <blockquote><pre>
! void g(std::exception_ptr p) {
    if (p) {}
    !p;
  }
*************** context like so:
*** 64581,64603 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready. Note to editor: considering putting in a cross-reference
  to 4 [conv], paragraph 3, which defines the phrase
  "contextually converted to <tt>bool</tt>".
! </blockquote>
  
  <p><i>[
  2010-03-14 Howard adds:
  ]</i></p>
  
  
! <blockquote>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </blockquote>
  
  
  
--- 70540,70562 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready. Note to editor: considering putting in a cross-reference
  to 4 [conv], paragraph 3, which defines the phrase
  "contextually converted to <tt>bool</tt>".
! </p></blockquote>
  
  <p><i>[
  2010-03-14 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </p></blockquote>
  
  
  
*************** Solved by <a href="http://www.open-std.o
*** 64612,64625 ****
  In section 18.8.5 [propagation] insert a new paragraph between p.5 and p.6:
  </p>
  
! <blockquote>
  <ins>
  An object <tt>e</tt> of type <tt>exception_ptr</tt> can be contextually converted to <tt>bool</tt>.
  The effect shall be as if <tt>e != exception_ptr()</tt> had been evaluated in place
  of <tt>e</tt>. There shall be no implicit conversion to arithmetic type, to
  enumeration type or to pointer type.
  </ins>
! </blockquote>
  
  
  
--- 70571,70584 ----
  In section 18.8.5 [propagation] insert a new paragraph between p.5 and p.6:
  </p>
  
! <blockquote><p>
  <ins>
  An object <tt>e</tt> of type <tt>exception_ptr</tt> can be contextually converted to <tt>bool</tt>.
  The effect shall be as if <tt>e != exception_ptr()</tt> had been evaluated in place
  of <tt>e</tt>. There shall be no implicit conversion to arithmetic type, to
  enumeration type or to pointer type.
  </ins>
! </p></blockquote>
  
  
  
*************** enumeration type or to pointer type.
*** 64627,64636 ****
  
  <hr>
  <h3><a name="1136"></a>1136. Incomplete specification of <tt>nested_exception::rethrow_nested()</tt></h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2007-06-06 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It was recently mentioned in a newsgroup article
--- 70586,70596 ----
  
  <hr>
  <h3><a name="1136"></a>1136. Incomplete specification of <tt>nested_exception::rethrow_nested()</tt></h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2007-06-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#except.nested">active issues</a> in [except.nested].</p>
! <p><b>View all other</b> <a href="lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It was recently mentioned in a newsgroup article
*************** class <tt>nested_exception</tt> is incom
*** 64640,64656 ****
  what happens, if member <tt>nested_ptr()</tt> returns a null value. In
  18.8.6 [except.nested] we find only the following paragraph related to that:
  </p>
! <blockquote><pre>void rethrow_nested() const; // [[noreturn]]
  </pre>
! <blockquote>
  -4- <i>Throws:</i> the stored exception captured by this <tt>nested_exception</tt> object.
! </blockquote>
  </blockquote>
  <p>
  This is a problem, because it is possible to create an object of
  <tt>nested_exception</tt> with exactly such a state, e.g.
  </p>
! <blockquote><pre>#include &lt;exception&gt;
  #include &lt;iostream&gt;
  
  int main() try {
--- 70600,70618 ----
  what happens, if member <tt>nested_ptr()</tt> returns a null value. In
  18.8.6 [except.nested] we find only the following paragraph related to that:
  </p>
! <blockquote><pre>
! void rethrow_nested() const; // [[noreturn]]
  </pre>
! <blockquote><p>
  -4- <i>Throws:</i> the stored exception captured by this <tt>nested_exception</tt> object.
! </p></blockquote>
  </blockquote>
  <p>
  This is a problem, because it is possible to create an object of
  <tt>nested_exception</tt> with exactly such a state, e.g.
  </p>
! <blockquote><pre>
! #include &lt;exception&gt;
  #include &lt;iostream&gt;
  
  int main() try {
*************** exception is being handled.
*** 64675,64689 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change around 18.8.6 [except.nested]/4 as indicated:
  </p>
  <blockquote>
  <p>
--- 70637,70651 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change around 18.8.6 [except.nested] p.4 as indicated:
  </p>
  <blockquote>
  <p>
*************** shall be called.</ins>
*** 64702,64711 ****
  
  <hr>
  <h3><a name="1137"></a>1137. Return type of <tt>conj</tt> and <tt>proj</tt></h3>
! <p><b>Section:</b> 26.4.9 [cmplx.over] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Marc Steinbach <b>Opened:</b> 2009-06-11 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#cmplx.over">issues</a> in [cmplx.over].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In clause 1, the Working Draft 
--- 70664,70673 ----
  
  <hr>
  <h3><a name="1137"></a>1137. Return type of <tt>conj</tt> and <tt>proj</tt></h3>
! <p><b>Section:</b> 26.4.9 [cmplx.over] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Marc Steinbach <b>Opened:</b> 2009-06-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#cmplx.over">issues</a> in [cmplx.over].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In clause 1, the Working Draft 
*************** In clause 1, the Working Draft
*** 64713,64719 ****
  specifies overloads of the
  functions
  </p>
! <blockquote><pre>arg, conj, imag, norm, proj, real
  </pre></blockquote>
  <p>
  for non-complex arithmetic types (<tt>float</tt>, <tt>double</tt>,
--- 70675,70682 ----
  specifies overloads of the
  functions
  </p>
! <blockquote><pre>
! arg, conj, imag, norm, proj, real
  </pre></blockquote>
  <p>
  for non-complex arithmetic types (<tt>float</tt>, <tt>double</tt>,
*************** The only requirement (clause 2) specifie
*** 64723,64732 ****
  <p>
  I strongly suggest to add the following requirement on the return types:
  </p>
! <blockquote>
  All the specified overloads must return real (i.e., non-complex) values,
  specifically, the nested <tt>value_type</tt> of effectively promoted arguments.
! </blockquote>
  
  <p>
  (This has no effect on <tt>arg</tt>, <tt>imag</tt>, <tt>norm</tt>, <tt>real</tt>:
--- 70686,70695 ----
  <p>
  I strongly suggest to add the following requirement on the return types:
  </p>
! <blockquote><p>
  All the specified overloads must return real (i.e., non-complex) values,
  specifically, the nested <tt>value_type</tt> of effectively promoted arguments.
! </p></blockquote>
  
  <p>
  (This has no effect on <tt>arg</tt>, <tt>imag</tt>, <tt>norm</tt>, <tt>real</tt>:
*************** mathematical property in the same way as
*** 64742,64748 ****
  A typical use of <tt>conj()</tt>, e.g., is the generic scalar product of n-vectors:
  </p>
  
! <blockquote><pre>template&lt;typename T&gt;
  inline T
  scalar_product(size_t n, T const* x, T const* y) {
    T result = 0;
--- 70705,70712 ----
  A typical use of <tt>conj()</tt>, e.g., is the generic scalar product of n-vectors:
  </p>
  
! <blockquote><pre>
! template&lt;typename T&gt;
  inline T
  scalar_product(size_t n, T const* x, T const* y) {
    T result = 0;
*************** of <tt>conj()</tt> and <tt>proj()</tt> n
*** 64786,64807 ****
  Insert a new paragraph after 26.4.9 [cmplx.over]/2:
  </p>
  
! <blockquote>
  <ins>
  All of the specified overloads shall have a return type which is the nested <tt>value_type</tt> of
  the effectively cast arguments.
  </ins>
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1138"></a>1138. unusual return value for operator+</h3>
! <p><b>Section:</b> 21.4.8.1 [string::op+] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-06-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Many of the <tt>basic_string operator+</tt> overloads return an rvalue-reference.  Is
--- 70750,70771 ----
  Insert a new paragraph after 26.4.9 [cmplx.over]/2:
  </p>
  
! <blockquote><p>
  <ins>
  All of the specified overloads shall have a return type which is the nested <tt>value_type</tt> of
  the effectively cast arguments.
  </ins>
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1138"></a>1138. Unusual return value for <tt>operator+</tt></h3>
! <p><b>Section:</b> 21.4.8.1 [string::op+] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-06-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Many of the <tt>basic_string operator+</tt> overloads return an rvalue-reference.  Is
*************** un-necessary copies of a cheaply movable
*** 64813,64826 ****
  references in code like:
  </p>
  
! <blockquote><pre>auto &amp;&amp; s = string{"x"} + string{y};
  </pre></blockquote>
  
  <p>
  and I'm not sure about:
  </p>
  
! <blockquote><pre>auto s = string{"x"} + string{y};
  </pre></blockquote>
  
  <p><i>[
--- 70777,70792 ----
  references in code like:
  </p>
  
! <blockquote><pre>
! auto &amp;&amp; s = string{"x"} + string{y};
  </pre></blockquote>
  
  <p>
  and I'm not sure about:
  </p>
  
! <blockquote><pre>
! auto s = string{"x"} + string{y};
  </pre></blockquote>
  
  <p><i>[
*************** and I'm not sure about:
*** 64833,64841 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
--- 70799,70807 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
*************** signatures:
*** 64849,64855 ****
  21.3 [string.classes] p2 Header Synopsis
  </p>
  
! <blockquote><pre>template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs);
--- 70815,70822 ----
  21.3 [string.classes] p2 Header Synopsis
  </p>
  
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs);
*************** template&lt;class charT, class traits, c
*** 64888,64948 ****
  21.4.8.1 [string::op+]
  </p>
  
! <blockquote><pre>template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs);
  </pre>
! <blockquote>
  <i>Returns:</i> <tt><ins>std::move(</ins>lhs.append(rhs)<ins>)</ins></tt>
! </blockquote>
! <pre>template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
                basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; rhs);
  </pre>
! <blockquote>
  <i>Returns:</i> <tt><ins>std::move(</ins>rhs.insert(0, lhs)<ins>)</ins></tt>
! </blockquote>
! <pre>template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs,
                basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; rhs);
  </pre>
! <blockquote>
  <i>Returns:</i> <tt><ins>std::move(</ins>lhs.append(rhs)<ins>)</ins></tt> [<i>Note:</i> Or equivalently
! <tt><ins>std::move(</ins>rhs.insert(0, lhs)<ins>)</ins></tt> — <i>end note</i>]
! </blockquote>
! <pre>template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(const charT* lhs,
                basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; rhs);
  </pre>
! <blockquote>
  <i>Returns:</i> <tt><ins>std::move(</ins>rhs.insert(0, lhs)<ins>)</ins></tt>.
! </blockquote>
! <pre>template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(charT lhs, basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; rhs);
  </pre>
! <blockquote>
  <i>Returns:</i> <tt><ins>std::move(</ins>rhs.insert(0, 1, lhs)<ins>)</ins></tt>.
! </blockquote>
! <pre>template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs,
                const charT* rhs);
  </pre>
! <blockquote>
  <i>Returns:</i> <tt><ins>std::move(</ins>lhs.append(rhs)<ins>)</ins></tt>.
! </blockquote>
! <pre>template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs, charT rhs);
  </pre>
! <blockquote>
  <i>Returns:</i> <tt><ins>std::move(</ins>lhs.append(1, rhs)<ins>)</ins></tt>.
! </blockquote>
  </blockquote>
  
  </blockquote>
--- 70855,70922 ----
  21.4.8.1 [string::op+]
  </p>
  
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs,
                const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs);
  </pre>
! <blockquote><p>
  <i>Returns:</i> <tt><ins>std::move(</ins>lhs.append(rhs)<ins>)</ins></tt>
! </p></blockquote>
! <pre>
! template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
                basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  <i>Returns:</i> <tt><ins>std::move(</ins>rhs.insert(0, lhs)<ins>)</ins></tt>
! </p></blockquote>
! <pre>
! template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs,
                basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  <i>Returns:</i> <tt><ins>std::move(</ins>lhs.append(rhs)<ins>)</ins></tt> [<i>Note:</i> Or equivalently
! <tt><ins>std::move(</ins>rhs.insert(0, lhs)<ins>)</ins></tt> &mdash; <i>end note</i>]
! </p></blockquote>
! <pre>
! template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(const charT* lhs,
                basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  <i>Returns:</i> <tt><ins>std::move(</ins>rhs.insert(0, lhs)<ins>)</ins></tt>.
! </p></blockquote>
! <pre>
! template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(charT lhs, basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; rhs);
  </pre>
! <blockquote><p>
  <i>Returns:</i> <tt><ins>std::move(</ins>rhs.insert(0, 1, lhs)<ins>)</ins></tt>.
! </p></blockquote>
! <pre>
! template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs,
                const charT* rhs);
  </pre>
! <blockquote><p>
  <i>Returns:</i> <tt><ins>std::move(</ins>lhs.append(rhs)<ins>)</ins></tt>.
! </p></blockquote>
! <pre>
! template&lt;class charT, class traits, class Allocator&gt;
    basic_string&lt;charT,traits,Allocator&gt;<del>&amp;&amp;</del>
      operator+(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; lhs, charT rhs);
  </pre>
! <blockquote><p>
  <i>Returns:</i> <tt><ins>std::move(</ins>lhs.append(1, rhs)<ins>)</ins></tt>.
! </p></blockquote>
  </blockquote>
  
  </blockquote>
*************** template&lt;class charT, class traits, c
*** 64953,64963 ****
  
  
  <hr>
  <h3><a name="1144"></a>1144. "thread safe" is undefined</h3>
! <p><b>Section:</b> 18.5 [support.start.term] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-16 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.start.term">issues</a> in [support.start.term].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 187</b></p>
--- 70927,70973 ----
  
  
  <hr>
+ <h3><a name="1143"></a>1143. Atomic operations library not concept enabled</h3>
+ <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-15 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses US 87, UK 311</b></p>
+ 
+ <p>
+ The atomics chapter is not concept enabled.
+ </p>
+ 
+ <p>
+ Needs to also consider issues <a href="lwg-defects.html#923">923</a> and <a href="lwg-defects.html#924">924</a>.
+ </p>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1144"></a>1144. "thread safe" is undefined</h3>
! <p><b>Section:</b> 18.5 [support.start.term] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.start.term">issues</a> in [support.start.term].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 187</b></p>
*************** will succeed.
*** 65020,65037 ****
  the <code>at_quick_exit()</code> functions
  shall not introduce a data race (17.6.4.7).
  <del>exitnote</del>
! <ins>—<i>end note</i>]</ins>
  <ins>
  [<i>Note:</i>
  The order of registration may be indeterminate
  if <code>at_quick_exit</code> was called from more than one thread.
! —<i>end note</i>]
  </ins>
  [<i>Note:</i> The <code>at_quick_exit</code> registrations
  are distinct from the <code>atexit</code> registrations,
  and applications may need to call both registration functions
  with the same argument.
! —<i>end note</i>]
  </p></blockquote>
  
  <p>
--- 71030,71047 ----
  the <code>at_quick_exit()</code> functions
  shall not introduce a data race (17.6.4.7).
  <del>exitnote</del>
! <ins>&mdash;<i>end note</i>]</ins>
  <ins>
  [<i>Note:</i>
  The order of registration may be indeterminate
  if <code>at_quick_exit</code> was called from more than one thread.
! &mdash;<i>end note</i>]
  </ins>
  [<i>Note:</i> The <code>at_quick_exit</code> registrations
  are distinct from the <code>atexit</code> registrations,
  and applications may need to call both registration functions
  with the same argument.
! &mdash;<i>end note</i>]
  </p></blockquote>
  
  <p>
*************** because the function does not provide a
*** 65060,65086 ****
  [<i>Note:</i>
  Functions registered by one thread may be called by any thread,
  and hence should not rely on the identity of thread-storage-duration objects.
! —<i>end note</i>]
  </ins>
  After calling registered functions,
  <code>quick_exit</code> shall call <code>_Exit(status)</code>.
  [<i>Note:</i>
  The standard file buffers are not flushed.
  See: ISO C 7.20.4.4.
! —<i>end note</i>]
  </p></blockquote>
  
  
  
  
  
  <hr>
  <h3><a name="1151"></a>1151. Behavior of the library in the presence of threads is incompletely specified</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US 63</b></p>
  
--- 71070,71516 ----
  [<i>Note:</i>
  Functions registered by one thread may be called by any thread,
  and hence should not rely on the identity of thread-storage-duration objects.
! &mdash;<i>end note</i>]
  </ins>
  After calling registered functions,
  <code>quick_exit</code> shall call <code>_Exit(status)</code>.
  [<i>Note:</i>
  The standard file buffers are not flushed.
  See: ISO C 7.20.4.4.
! &mdash;<i>end note</i>]
! </p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1145"></a>1145. Inappropriate headers for atomics</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses UK 312</b></p>
! 
! <p>
! The contents of the <tt>&lt;stdatomic.h&gt;</tt> header are not listed anywhere,
! and <tt>&lt;cstdatomic&gt;</tt> is listed as a C99 header in chapter 17.
! If we intend to use these for compatibility with a future C standard,
! we should not use them now.
! </p>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
  </p></blockquote>
  
  
  
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Remove <tt>&lt;cstdatomic&gt;</tt> from the C99 headers in table 14.
+ Add a new header <tt>&lt;atomic&gt;</tt> to the headers in table 13.
+ Update chapter 29 to remove reference to <tt>&lt;stdatomic.h&gt;</tt>
+ and replace the use of <tt>&lt;cstdatomic&gt;</tt> with <tt>&lt;atomic&gt;</tt>.
+ </p>
+ <p><i>[
+ If and when WG14 adds atomic operations to C
+ we can add corresponding headers to table 14 with a TR.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1146"></a>1146. "lockfree" does not say enough</h3>
+ <p><b>Section:</b> 29.4 [atomics.lockfree] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-06-16 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#atomics.lockfree">issues</a> in [atomics.lockfree].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses US 88</b></p>
+ 
+ <p>
+ The "lockfree" facilities do not tell the programmer enough.
+ </p>
+ 
+ <p>
+ There are 2 problems here.
+ First, at least on x86,
+ it's less important to me whether some integral types are lock free
+ than what is the largest type I can pass to atomic and have it be lock-free.
+ For example, if <tt>long long</tt>s are not lock-free,
+ <tt>ATOMIC_INTEGRAL_LOCK_FREE</tt> is probably 1,
+ but I'd still be interested in knowing whether longs are always lock-free.
+ Or if long longs at any address are lock-free,
+ I'd expect <tt>ATOMIC_INTEGRAL_LOCK_FREE</tt> to be 2,
+ but I may actually care whether I have access to
+ the <code>cmpxchg16b</code> instruction.
+ None of the support here helps with that question.
+ (There are really 2 related questions here:
+ what alignment requirements are there for lock-free access;
+ and what processor is the program actually running on,
+ as opposed to what it was compiled for?)
+ </p>
+ 
+ <p>
+ Second, having <tt>atomic_is_lock_free</tt> only apply to individual objects
+ is pretty useless
+ (except, as Lawrence Crowl points out,
+ for throwing an exception when an object is unexpectedly not lock-free).
+ I'm likely to want to use its result to decide what algorithm to use,
+ and that algorithm is probably going to allocate new memory
+ containing atomic objects and then try to act on them.
+ If I can't predict the lock-freedom of the new object
+ by checking the lock-freedom of an existing object,
+ I may discover after starting the algorithm that I can't continue.
+ </p>
+ 
+ <p><i>[
+ 2009-06-16 Jeffrey Yasskin adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ To solve the first problem, I think 2 macros would help:
+ <tt>MAX_POSSIBLE_LOCK_FREE_SIZE</tt> and <tt>MAX_GUARANTEED_LOCK_FREE_SIZE</tt>,
+ which expand to the maximum value of <tt>sizeof(T)</tt> for which atomic may
+ (or will, respectively) use lock-free operations.
+ Lawrence points out that this
+ "relies heavily on implementations
+ using word-size compare-swap on sub-word-size types,
+ which in turn requires address modulation."
+ He expects that to be the end state anyway, so it doesn't bother him much.
+ </p>
+ 
+ <p>
+ To solve the second,
+ I think one could specify that equally aligned objects of the same type
+ will return the same value from <tt>atomic_is_lock_free()</tt>.
+ I don't know how to specify "equal alignment".
+ Lawrence suggests an additional function, <tt>atomic_is_always_lock_free()</tt>.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10-22 Benjamin Kosnik:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ In the evolution discussion of N2925, "More Collected Issues with
+ Atomics," there is an action item with respect to
+ LWG <a href="lwg-defects.html#1146">1146</a>, US 88
+ </p>
+ 
+ <p>
+ This is stated in the paper as:
+ </p>
+ <p>
+ Relatedly, Mike Sperts will create an issue to propose adding a traits
+ mechanism to check the compile-time properties through a template
+ mechanism rather than macros
+ </p>
+ 
+ <p>
+ Here is my attempt to do this. I don't believe that a separate trait is
+ necessary for this, and that instead <tt>atomic_integral::is_lock_free</tt> can
+ be re-purposed with minimal work as follows.
+ </p>
+ 
+ <p><i>[
+ Howard: Put Benjamin's wording in the proposed wording section.
+ ]</i></p>
+ 
+ 
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10-22 Alberto Ganesh Barbati:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Just a thought... wouldn't it be better to use a scoped enum instead of
+ plain integers? For example:
+ </p>
+ 
+ <blockquote><pre>
+ enum class is_lock_free
+ {
+     never = 0, sometimes = 1, always = 2;
+ };
+ </pre></blockquote>
+ 
+ <p>
+ if compatibility with C is deemed important, we could use an unscoped
+ enum with suitably chosen names.  It would still be more descriptive
+ than 0, 1 and 2.
+ </p>
+ 
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Header <tt>&lt;cstdatomic&gt;</tt> synopsis  [atomics.synopsis]
+ </p>
+ 
+ <p>
+ Edit  as follows:
+ </p>
+ 
+ <blockquote><pre>
+ namespace std {
+ ...
+ // 29.4, lock-free property
+ <del>#define ATOMIC_INTEGRAL_LOCK_FREE unspecified</del>
+ <ins>#define ATOMIC_CHAR_LOCK_FREE unspecified
+ #define ATOMIC_CHAR16_T_LOCK_FREE unspecified
+ #define ATOMIC_CHAR32_T_LOCK_FREE unspecified
+ #define ATOMIC_WCHAR_T_LOCK_FREE unspecified
+ #define ATOMIC_SHORT_LOCK_FREE unspecified
+ #define ATOMIC_INT_LOCK_FREE unspecified
+ #define ATOMIC_LONG_LOCK_FREE unspecified
+ #define ATOMIC_LLONG_LOCK_FREE unspecified</ins>
+ #define ATOMIC_ADDRESS_LOCK_FREE unspecified
+ </pre></blockquote>
+ 
+ <p>
+ Lock-free Property 29.4 [atomics.lockfree]
+ </p>
+ 
+ <p>
+ Edit the synopsis as follows.
+ </p>
+ 
+ <blockquote><pre>
+ namespace std {
+    <del>#define ATOMIC_INTEGRAL_LOCK_FREE unspecified</del>
+    <ins>#define ATOMIC_CHAR_LOCK_FREE unspecified
+    #define ATOMIC_CHAR16_T_LOCK_FREE unspecified
+    #define ATOMIC_CHAR32_T_LOCK_FREE unspecified
+    #define ATOMIC_WCHAR_T_LOCK_FREE unspecified
+    #define ATOMIC_SHORT_LOCK_FREE unspecified
+    #define ATOMIC_INT_LOCK_FREE unspecified
+    #define ATOMIC_LONG_LOCK_FREE unspecified
+    #define ATOMIC_LLONG_LOCK_FREE unspecified</ins>
+    #define ATOMIC_ADDRESS_LOCK_FREE unspecified
+ }
+ </pre></blockquote>
+ 
+ <p>
+ Edit paragraph 1 as follows.
+ </p>
+ 
+ <blockquote><p>
+ The <ins>ATOMIC_...._LOCK_FREE</ins> macros <del>ATOMIC_INTEGRAL_LOCK_FREE and ATOMIC_ADDRESS_LOCK_FREE</del> indicate the general lock-free
+ property of <del>integral and address atomic</del> <ins>the corresponding atomic integral</ins> types<ins>, with the
+ signed and unsigned variants grouped together</ins>.
+ <del>The properties also apply to the corresponding specializations of the atomic template.</del>
+ A value of 0
+ indicates that the types are never lock-free. A value of 1
+ indicates that the types are sometimes lock-free. A value of 2
+ indicates that the types are always lock-free.
+ </p></blockquote>
+ 
+ <p>
+ Operations on Atomic Types 29.6 [atomics.types.operations]
+ </p>
+ 
+ <p>
+ Edit as follows.
+ </p>
+ 
+ <blockquote><pre>
+ <del>void</del> <ins>static constexpr bool</ins> A::is_lock_free() const volatile;
+ </pre>
+ <blockquote><p>
+ <i>Returns:</i> True if the <del>object's</del> <ins>types's</ins> operations are lock-free, false
+ otherwise.
+ <ins>
+ [<i>Note:</i> In the same way that <tt>&lt;limits&gt;</tt>
+ <tt>std::numeric_limits&lt;short&gt;::max()</tt> is related to <tt>&lt;limits.h&gt;</tt> 
+ <tt>__LONG_LONG_MAX__</tt>, <tt>&lt;atomic&gt; std::atomic_short::is_lock_free</tt> is related to
+ <tt>&lt;stdatomic.h&gt;</tt> and <tt>ATOMIC_SHORT_LOCK_FREE</tt> &mdash; <i>end note</i>]
+ </ins>
+ </p></blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1147"></a>1147. Non-volatile atomic functions</h3>
+ <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-06-16 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses US 90</b></p>
+ 
+ <p>
+ The C++0X draft declares all of the functions dealing with atomics 
+ (section 29.6 [atomics.types.operations]) to take volatile 
+ arguments. Yet it also says (29.4-3),
+ </p>
+ 
+ <blockquote>
+ <p>
+ [ Note: Many operations are volatile-qualified.
+ The "volatile as device register" semantics have not changed in the standard.
+ This qualification means that volatility is preserved
+ when applying these operations to volatile objects.
+ It does not mean that operations on non-volatile objects become volatile.
+ Thus, volatile qualified operations on non-volatile objects
+ may be merged under some conditions. &mdash; end note ]
+ </p>
+ </blockquote>
+ 
+ <p>
+ I was thinking about how to implement this in gcc,
+ and I believe that we'll want to overload most of the functions
+ on volatile and non-volatile.
+ Here's why:
+ </p>
+ 
+ <p>
+ To let the compiler take advantage of the permission
+ to merge non-volatile atomic operations and reorder atomics in certain,
+ we'll need to tell the compiler backend
+ about exactly which atomic operation was used.
+ So I expect most of the functions of the form <tt>atomic_&lt;op&gt;_explicit()</tt>
+ (e.g. <tt>atomic_load_explicit</tt>, <tt>atomic_exchange_explicit</tt>,
+ <tt>atomic_fetch_add_explicit</tt>, etc.)
+ to become compiler builtins.
+ A builtin can tell whether its argument was volatile or not,
+ so those functions don't really need extra explicit overloads.
+ However, I don't expect that we'll want to add builtins
+ for every function in chapter 29,
+ since most can be implemented in terms of the <tt>_explicit</tt> free functions:
+ </p>
+ 
+ <pre><code>class atomic_int {
+   __atomic_int_storage value;
+  public:
+   int fetch_add(int increment, memory_order order = memory_order_seq_cst) volatile {
+     // &amp;value has type "volatile __atomic_int_storage*".
+     atomic_fetch_add_explicit(&amp;value, increment, order);
+   }
+   ...
+ };
+ </code></pre>
+ 
+ <p>
+ But now this <em>always</em> calls
+ the volatile builtin version of <tt>atomic_fetch_add_explicit()</tt>,
+ even if the <tt>atomic_int</tt> wasn't declared volatile.
+ To preserve volatility and the compiler's permission to optimize,
+ I'd need to write:
+ </p>
+ 
+ <pre><code>class atomic_int {
+   __atomic_int_storage value;
+  public:
+   int fetch_add(int increment, memory_order order = memory_order_seq_cst) volatile {
+     atomic_fetch_add_explicit(&amp;value, increment, order);
+   }
+   int fetch_add(int increment, memory_order order = memory_order_seq_cst) {
+     atomic_fetch_add_explicit(&amp;value, increment, order);
+   }
+   ...
+ };
+ </code></pre>
+ 
+ <p>
+ But this is visibly different from the declarations in the standard
+ because it's now overloaded.
+ (Consider passing <tt>&amp;atomic_int::fetch_add</tt> as a template parameter.)
+ </p>
+ 
+ <p>
+ The implementation may already have permission to add overloads
+ to the member functions:
+ </p>
+ 
+ <blockquote>
+ <p>
+ 17.6.5.5 [member.functions] An implementation may declare additional non-virtual
+ member function signatures within a class:<br/>
+ ...
+ </p>
+ <ul>
+ <li>by adding a member function signature for a member function name.</li>
+ </ul>
+ </blockquote>
+ 
+ <p>
+ but I don't see an equivalent permission to add overloads to the free functions.
+ </p>
+ 
+ <p><i>[
+ 2009-06-16 Lawrence adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ I recommend allowing non-volatile overloads.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2992.htm">N2992</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
  
  
  <hr>
  <h3><a name="1151"></a>1151. Behavior of the library in the presence of threads is incompletely specified</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US 63</b></p>
  
*************** See: ISO C 7.20.4.4.
*** 65106,65116 ****
  ]</i></p>
  
  
! <blockquote>
  Move to "Open". Hans and the rest of the concurrency working group will
  study this. We can't make progress without a thorough review and a
  paper.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
--- 71536,71546 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to "Open". Hans and the rest of the concurrency working group will
  study this. We can't make progress without a thorough review and a
  paper.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to NAD Editorial.  Rationale added below.
*************** Solved by
*** 65133,65153 ****
  
  
  <hr>
! <h3><a name="1152"></a>1152. expressions parsed differently than intended</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Seungbeom Kim <b>Opened:</b> 2009-06-27 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Table 73 -- Floating-point conversions, 22.4.2.2.2 [facet.num.put.virtuals], 
  in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>,
  we have the following entries: 
  </p>
  <table border="1">
! <caption>Table 73 — Floating-point conversions</caption>
! <tbody><tr>
  <th>State</th> <th><tt>stdio</tt> equivalent</th>
  </tr>
  <tr>
--- 71563,71583 ----
  
  
  <hr>
! <h3><a name="1152"></a>1152. Expressions parsed differently than intended</h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Seungbeom Kim <b>Opened:</b> 2009-06-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Table 73 &mdash; Floating-point conversions, 22.4.2.2.2 [facet.num.put.virtuals], 
  in
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>,
  we have the following entries: 
  </p>
  <table border="1">
! <caption>Table 73 &mdash; Floating-point conversions</caption>
! <tr>
  <th>State</th> <th><tt>stdio</tt> equivalent</th>
  </tr>
  <tr>
*************** we have the following entries:
*** 65159,65177 ****
  <td><tt>floatfield == ios_base::fixed | ios_base::scientific</tt></td>
  <td align="center"><tt>%A</tt></td>
  </tr>
! </tbody></table>
  
  <p>
  These expressions are supposed to mean: 
  </p>
  
! <blockquote><pre>floatfield == (ios_base::fixed | ios_base::scientific) &amp;&amp; !uppercase 
  floatfield == (ios_base::fixed | ios_base::scientific) 
  </pre></blockquote>
  <p>
  but technically parsed as: 
  </p>
! <blockquote><pre>((floatfield == ios_base::fixed) | ios_base::scientific) &amp;&amp; (!uppercase) 
  ((floatfield == ios_base::fixed) | ios_base::scientific) 
  </pre></blockquote>
  <p>
--- 71589,71609 ----
  <td><tt>floatfield == ios_base::fixed | ios_base::scientific</tt></td>
  <td align="center"><tt>%A</tt></td>
  </tr>
! </table>
  
  <p>
  These expressions are supposed to mean: 
  </p>
  
! <blockquote><pre>
! floatfield == (ios_base::fixed | ios_base::scientific) &amp;&amp; !uppercase 
  floatfield == (ios_base::fixed | ios_base::scientific) 
  </pre></blockquote>
  <p>
  but technically parsed as: 
  </p>
! <blockquote><pre>
! ((floatfield == ios_base::fixed) | ios_base::scientific) &amp;&amp; (!uppercase) 
  ((floatfield == ios_base::fixed) | ios_base::scientific) 
  </pre></blockquote>
  <p>
*************** and should be corrected with additional
*** 65183,65202 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change Table 83 — Floating-point conversions in  22.4.2.2.2 [facet.num.put.virtuals]:
  </p>
  
  <table border="1">
! <caption>Table 83 — Floating-point conversions</caption>
! <tbody><tr>
  <th>State</th> <th><tt>stdio</tt> equivalent</th>
  </tr>
  <tr>
--- 71615,71634 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change Table 83 &mdash; Floating-point conversions in  22.4.2.2.2 [facet.num.put.virtuals]:
  </p>
  
  <table border="1">
! <caption>Table 83 &mdash; Floating-point conversions</caption>
! <tr>
  <th>State</th> <th><tt>stdio</tt> equivalent</th>
  </tr>
  <tr>
*************** Change Table 83 — Floating-point convers
*** 65208,65214 ****
  <td><tt>floatfield == <ins>(</ins>ios_base::fixed | ios_base::scientific<ins>)</ins></tt></td>
  <td align="center"><tt>%A</tt></td>
  </tr>
! </tbody></table>
  
  
  
--- 71640,71646 ----
  <td><tt>floatfield == <ins>(</ins>ios_base::fixed | ios_base::scientific<ins>)</ins></tt></td>
  <td align="center"><tt>%A</tt></td>
  </tr>
! </table>
  
  
  
*************** Change Table 83 — Floating-point convers
*** 65216,65224 ****
  
  <hr>
  <h3><a name="1157"></a>1157. Local types can now instantiate templates</h3>
! <p><b>Section:</b> 17.6.3.2.1 [namespace.std] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 175</b></p>
--- 71648,71657 ----
  
  <hr>
  <h3><a name="1157"></a>1157. Local types can now instantiate templates</h3>
! <p><b>Section:</b> 17.6.4.2.1 [namespace.std] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#namespace.std">issues</a> in [namespace.std].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 175</b></p>
*************** Change Table 83 — Floating-point convers
*** 65243,65257 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 17.6.3.2.1 [namespace.std]
  </p>
  <p>
  Strike "of external linkage" in p1 and p2:
--- 71676,71690 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 17.6.4.2.1 [namespace.std]
  </p>
  <p>
  Strike "of external linkage" in p1 and p2:
*************** library requirements for the original te
*** 65301,65310 ****
  
  <hr>
  <h3><a name="1158"></a>1158. Encouragement to use monotonic clock</h3>
! <p><b>Section:</b> 30.2.4 [thread.req.timing] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.req.timing">issues</a> in [thread.req.timing].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 322, US 96</b></p>
--- 71734,71743 ----
  
  <hr>
  <h3><a name="1158"></a>1158. Encouragement to use monotonic clock</h3>
! <p><b>Section:</b> 30.2.4 [thread.req.timing] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.req.timing">issues</a> in [thread.req.timing].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 322, US 96</b></p>
*************** library requirements for the original te
*** 65319,65326 ****
  
  <p><b>Notes</b></p>
  <p>Create an issue, together with UK 96. Note that the specification as is 
!     already allows a non-monotonic clock due to the word “should” rather than 
!     “shall”. If this wording is kept, a footnote should be added to make the 
      meaning clear.</p>
  
  <p><i>[ 2009-06-29 Beman provided a proposed resolution. ] </i></p>
--- 71752,71759 ----
  
  <p><b>Notes</b></p>
  <p>Create an issue, together with UK 96. Note that the specification as is 
!     already allows a non-monotonic clock due to the word &#8220;should&#8221; rather than 
!     &#8220;shall&#8221;. If this wording is kept, a footnote should be added to make the 
      meaning clear.</p>
  
  <p><i>[ 2009-06-29 Beman provided a proposed resolution. ] </i></p>
*************** library requirements for the original te
*** 65330,65351 ****
  ]</i></p>
  
  
! <blockquote>
  Set to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  2010-02-24 Pete moved to Open:
  ]</i></p>
  
  
! <blockquote>
  LWG 1158's proposed resolution replaces the ISO-specified normative term
  "should" with "are encouraged but not required to", which presumably means the
  same thing, but has no ISO normative status. The WD used the latter formulation
  in quite a few non-normative places, but only three normative ones. I've changed
  all the normative uses to "should".
! </blockquote>
  
  <p><i>[
  2010-03-06 Beman updates wording.
--- 71763,71784 ----
  ]</i></p>
  
  
! <blockquote><p>
  Set to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  2010-02-24 Pete moved to Open:
  ]</i></p>
  
  
! <blockquote><p>
  LWG 1158's proposed resolution replaces the ISO-specified normative term
  "should" with "are encouraged but not required to", which presumably means the
  same thing, but has no ISO normative status. The WD used the latter formulation
  in quite a few non-normative places, but only three normative ones. I've changed
  all the normative uses to "should".
! </p></blockquote>
  
  <p><i>[
  2010-03-06 Beman updates wording.
*************** The member functions whose names end in
*** 65368,65374 ****
  specifies a relative time. Implementations should use a monotonic clock to
  measure time for these functions.  <ins>[<i>Note:</i> Implementations are not
  required to use a monotonic clock because such a clock may be unavailable.
! — <i>end note</i>]</ins>
  </p>
  
  
--- 71801,71807 ----
  specifies a relative time. Implementations should use a monotonic clock to
  measure time for these functions.  <ins>[<i>Note:</i> Implementations are not
  required to use a monotonic clock because such a clock may be unavailable.
! &mdash; <i>end note</i>]</ins>
  </p>
  
  
*************** required to use a monotonic clock becaus
*** 65378,65388 ****
  
  <hr>
  <h3><a name="1159"></a>1159. Unclear spec for <tt>resource_deadlock_would_occur</tt></h3>
! <p><b>Section:</b> 30.4.2.2.2 [thread.lock.unique.locking] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.lock.unique.locking">issues</a> in [thread.lock.unique.locking].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 327, UK 328</b></p>
--- 71811,71821 ----
  
  <hr>
  <h3><a name="1159"></a>1159. Unclear spec for <tt>resource_deadlock_would_occur</tt></h3>
! <p><b>Section:</b> 30.4.2.2.2 [thread.lock.unique.locking] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.lock.unique.locking">issues</a> in [thread.lock.unique.locking].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1219">1219</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 327, UK 328</b></p>
*************** required to use a monotonic clock becaus
*** 65428,65434 ****
      is the correct one.</p>
  
  <p><i>[
! 2009-11-11 Alisdair notes that this issue is very closely related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1219">1219</a>,
  if not a dup.
  ]</i></p>
  
--- 71861,71867 ----
      is the correct one.</p>
  
  <p><i>[
! 2009-11-11 Alisdair notes that this issue is very closely related to <a href="lwg-closed.html#1219">1219</a>,
  if not a dup.
  ]</i></p>
  
*************** if not a dup.
*** 65443,65451 ****
  ]</i></p>
  
  
! <blockquote>
  Wording updated and moved to Ready for Pittsburgh.
! </blockquote>
  
  
  
--- 71876,71884 ----
  ]</i></p>
  
  
! <blockquote><p>
  Wording updated and moved to Ready for Pittsburgh.
! </p></blockquote>
  
  
  
*************** Remove 30.4.2.2.2 [thread.lock.unique.lo
*** 65558,65567 ****
  
  
  <hr>
  <h3><a name="1170"></a>1170. String <i>char-like types</i> no longer PODs</h3>
! <p><b>Section:</b> 21.1 [strings.general] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-06-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 218</b></p>
--- 71991,72349 ----
  
  
  <hr>
+ <h3><a name="1160"></a>1160. <tt>future_error</tt> public constructor is 'exposition only'</h3>
+ <p><b>Section:</b> 30.6.3 [futures.future_error] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 331</b></p>
+ 
+ <p><b>Description</b></p>
+         <p>Not clear what
+         it means for a public constructor to be 'exposition only'.
+         If the intent is purely to support the library calling this
+         constructor then it can be made private and accessed
+         through friendship. Otherwise it should be documented for
+         public consumption.</p>
+ <p><b>Suggestion</b></p>
+         <p>Declare the constructor as private with a
+         note about intended friendship, or remove the
+         exposition-only comment and document the semantics.</p>
+ <p><b>Notes</b></p>
+ <p>Create an issue. Assigned to Detlef. Suggested resolution probably makes 
+     sense.</p>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Pending a paper from Anthony Williams &#47; Detlef Vollmann.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10-14 Pending paper:
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2967.html">N2967</a>.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1161"></a>1161. Unnecessary <tt>unique_future</tt> limitations</h3>
+ <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 336</b></p>
+ 
+ <p><b>Description</b></p>
+ 
+         <p>It is possible
+         to transfer ownership of the asynchronous result from one
+         unique_future instance to another via the move-constructor.
+         However, it is not possible to transfer it back, and nor is
+         it possible to create a default-constructed unique_future
+         instance to use as a later move target. This unduly limits
+         the use of <tt>unique_future</tt> in code. Also, the lack of a
+         move-assignment operator restricts the use of <tt>unique_future</tt>
+         in containers such as <tt>std::vector</tt> - <tt>vector::insert</tt> requires
+         move-assignable for example.</p>
+ <p><b>Suggestion</b></p>
+         <p>Add a default constructor with the
+         semantics that it creates a <tt>unique_future</tt> with no
+         associated asynchronous result. Add a move-assignment
+         operator which transfers ownership.</p>
+ <p><b>Notes</b></p>
+ <p>Create an issue. Detlef will look into it.</p>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Pending a paper from Anthony Williams &#47; Detlef Vollmann.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10-14 Pending paper:
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2967.html">N2967</a>.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1162"></a>1162. <tt>shared_future</tt> should support an efficient move constructor</h3>
+ <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 337</b></p>
+ 
+ <p><b>Description</b></p>
+         <p><tt>shared_future</tt>
+         should support an efficient move constructor that can avoid
+         unnecessary manipulation of a reference count, much like
+         <tt>shared_ptr</tt></p>
+ <p><b>Suggestion</b></p>
+         <p>Add a move constructor</p>
+ <p><b>Notes</b></p>
+ <p>Create an issue. Detlef will look into it.</p>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Pending a paper from Anthony Williams &#47; Detlef Vollmann.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10-14 Pending paper:
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2967.html">N2967</a>.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1163"></a>1163. <tt>shared_future</tt> is inconsistent with <tt>shared_ptr</tt></h3>
+ <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 338</b></p>
+ 
+ <p><b>Description</b></p>
+ 
+         <p><tt>shared_future</tt> is currently
+         <tt>CopyConstructible</tt>, but not <tt>CopyAssignable</tt>. This is
+         inconsistent with <tt>shared_ptr</tt>, and will surprise users.
+         Users will then write work-arounds to provide this
+         behaviour. We should provide it simply and efficiently as
+         part of shared_future. Note that since the shared_future
+         member functions for accessing the state are all declared
+         const, the original usage of an immutable shared_future
+         value that can be freely copied by multiple threads can be
+         retained by declaring such an instance as "<tt>const
+         shared_future</tt>".</p>
+ <p><b>Suggestion</b></p>
+         <p>Remove "=delete"
+         from the copy-assignment operator of shared_future. Add a
+         move-constructor <tt>shared_future(shared_future&amp;&amp;
+         rhs)</tt>, and a move-assignment operator <tt>shared_future&amp;
+         operator=(shared_future&amp;&amp; rhs)</tt>. The postcondition
+         for the copy-assignment operator is that <tt>*this</tt> has the same
+         associated state as <tt>rhs</tt>. The postcondition for the
+         move-constructor and move assignment is that <tt>*this</tt> has the
+         same associated as <tt>rhs</tt> had before the
+         constructor&#47;assignment call and that <tt>rhs</tt> has no associated
+         state.</p>
+ <p><b>Notes</b></p>
+ <p>Create an issue. Detlef will look into it.</p>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Pending a paper from Anthony Williams &#47; Detlef Vollmann.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10-14 Pending paper:
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2967.html">N2967</a>.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Adressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1165"></a>1165. Unneeded <tt>promise</tt> move constructor</h3>
+ <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses UK 343</b></p>
+ 
+ <p><b>Description</b></p>
+         <p>The move constructor of a <tt>std::promise</tt>
+         object does not need to allocate any memory, so the
+         move-construct-with-allocator overload of the constructor
+         is superfluous.</p>
+ <p><b>Suggestion</b></p>
+         <p>Remove the constructor with the signature <tt>template &lt;class
+         Allocator&gt; promise(allocator_arg_t, const Allocator&amp;
+         a, promise&amp; rhs);</tt></p>
+ <p><b>Notes</b></p>
+ <p>Create an issue. Detlef will look into it. Will solicit feedback from Pablo. 
+     Note that &quot;rhs&quot; argument should also be an rvalue reference in any case.</p>
+ 
+ <p><i>[
+ 2009-07 Frankfurt
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Pending a paper from Anthony Williams &#47; Detlef Vollmann.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Adressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">N2997</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1166"></a>1166. Allocator-specific move&#47;copy break model of move-constructor and
+         move-assignment</h3>
+ <p><b>Section:</b> X [allocator.propagation], X [allocator.propagation.map], 23 [containers] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> LWG <b>Opened:</b> 2009-06-28 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p><b>Addresses US 77</b></p>
+ 
+ <p><b>Description</b></p>
+         <p>Allocator-specific move and copy behavior for containers
+         (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2525.pdf">N2525</a>) complicates a little-used and already-complicated
+         portion of the standard library (allocators), and breaks
+         the conceptual model of move-constructor and
+         move-assignment operations on standard containers being
+         efficient operations. The extensions for allocator-specific
+         move and copy behavior should be removed from the working
+         paper.</p>
+         <p>With the introduction of rvalue references, we are teaching
+         programmers that moving from a standard container (e.g., a
+         <tt>vector&lt;string&gt;</tt>) is an efficient, constant-time
+         operation. The introduction of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2525.pdf">N2525</a> removed that
+         guarantee; depending on the behavior of four different
+         traits (20.8.4), the complexity of copy and move operations
+         can be constant or linear time. This level of customization
+         greatly increases the complexity of standard containers,
+         and benefits only a tiny fraction of the C++ community.</p>
+ <p><b>Suggestion</b></p>
+ 
+         <p>Remove 20.8.4.</p>
+         
+         <p>Remove 20.8.5.</p>
+         
+         <p>Remove all references to the facilities in
+         20.8.4 and 20.8.5 from clause 23.</p>
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1170"></a>1170. String <i>char-like types</i> no longer PODs</h3>
! <p><b>Section:</b> 21.1 [strings.general] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-06-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses UK 218</b></p>
*************** language and its library.</p>
*** 65574,65594 ****
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2349.pdf">N2349</a>,
  Constant Expressions in the Standard Library Revision 2, changed the 
! requirement in 21/1 from "POD type" to "literal type". That change had the 
  effect of removing the trivially copyable and standard-layout requirements from 
  <tt>basic_string</tt> elements.</p>
  <p>This means that <tt>basic_string</tt> elements no longer are guaranteed to be 
  memcpy'able, and are no longer guaranteed to be standard-layout types:</p>
  <blockquote>
!   <p>3.9/p2 and 3.9/p3 both make it clear that a "trivially copyable type" is 
    required for memcpy to be guaranteed to work.</p>
    <p>Literal types (3.9p12) may have a non-trivial copy assignment operator, and 
    that violates the trivially copyable requirements given in 9/p 6, bullet item 
    2. </p>
    <p>Literal types (3.9p12) have no standard-layout requirement, either.</p>
  </blockquote>
! <p>This situation probably arose because the wording for "Constant Expressions 
! in the Standard Library" was in process at the same time the C++ POD 
  deconstruction wording was in process. </p>
  <p>Since trivially copyable types meet the C++0x requirements for literal types, 
  and thus work with constant expressions, it seems an easy fix to revert the 
--- 72356,72376 ----
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2349.pdf">N2349</a>,
  Constant Expressions in the Standard Library Revision 2, changed the 
! requirement in 21/1 from &quot;POD type&quot; to &quot;literal type&quot;. That change had the 
  effect of removing the trivially copyable and standard-layout requirements from 
  <tt>basic_string</tt> elements.</p>
  <p>This means that <tt>basic_string</tt> elements no longer are guaranteed to be 
  memcpy'able, and are no longer guaranteed to be standard-layout types:</p>
  <blockquote>
!   <p>3.9/p2 and 3.9/p3 both make it clear that a &quot;trivially copyable type&quot; is 
    required for memcpy to be guaranteed to work.</p>
    <p>Literal types (3.9p12) may have a non-trivial copy assignment operator, and 
    that violates the trivially copyable requirements given in 9/p 6, bullet item 
    2. </p>
    <p>Literal types (3.9p12) have no standard-layout requirement, either.</p>
  </blockquote>
! <p>This situation probably arose because the wording for &quot;Constant Expressions 
! in the Standard Library&quot; was in process at the same time the C++ POD 
  deconstruction wording was in process. </p>
  <p>Since trivially copyable types meet the C++0x requirements for literal types, 
  and thus work with constant expressions, it seems an easy fix to revert the 
*************** and thus work with constant expressions,
*** 65599,65607 ****
   ]</i></p>
  
   
! <blockquote>
  When looking for any resolution for this issue, consider the definition of
! "character container type" in 17.3.5 [defns.character.container].  This
  does require the character type to be a POD, and this term is used in a
  number of places through clause 21 and 28. This suggests the PODness
  constraint remains, but is much more subtle than before.  Meanwhile, I
--- 72381,72389 ----
   ]</i></p>
  
   
! <blockquote><p>
  When looking for any resolution for this issue, consider the definition of
! "character container type" in 17.3 [defns.character.container].  This
  does require the character type to be a POD, and this term is used in a
  number of places through clause 21 and 28. This suggests the PODness
  constraint remains, but is much more subtle than before.  Meanwhile, I
*************** the assumption that trivially copyable t
*** 65610,65616 ****
  non-trivial-but-constexpr constructors should serve as well.  I don't
  believe the current wording offers the right guarantees for either of
  the above designs.
! </blockquote>
  
  <p><i>[
  2009-11-04 Howard modifies proposed wording to disallow array types as
--- 72392,72398 ----
  non-trivial-but-constexpr constructors should serve as well.  I don't
  believe the current wording offers the right guarantees for either of
  the above designs.
! </p></blockquote>
  
  <p><i>[
  2009-11-04 Howard modifies proposed wording to disallow array types as
*************** types are called <i>char-like objects</i
*** 65643,65655 ****
  
  <hr>
  <h3><a name="1171"></a>1171. duration types should be literal</h3>
! <p><b>Section:</b> 20.11.3 [time.duration] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-06 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.duration">issues</a> in [time.duration].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The <tt>duration</tt> types in 20.11.3 [time.duration] are exactly the sort of type
  that should be "literal types" in the new standard.  Likewise,
  arithmetic operations on <tt>duration</tt>s should be declared <tt>constexpr</tt>.
  </p>
--- 72425,72437 ----
  
  <hr>
  <h3><a name="1171"></a>1171. duration types should be literal</h3>
! <p><b>Section:</b> 20.12.5 [time.duration] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration">issues</a> in [time.duration].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The <tt>duration</tt> types in 20.12.5 [time.duration] are exactly the sort of type
  that should be "literal types" in the new standard.  Likewise,
  arithmetic operations on <tt>duration</tt>s should be declared <tt>constexpr</tt>.
  </p>
*************** arithmetic operations on <tt>duration</t
*** 65659,65670 ****
  ]</i></p>
  
  
! <blockquote>
  An alternative (and possibly preferable solution for potentially
! heap-allocating big_int representation types) would be to ask the core
  language to allow references to <tt>const</tt> literal types as feasible
  arguments for <tt>constexpr</tt> functions.
! </blockquote>
  
  <p><i>[
  2009-10-30 Alisdair adds:
--- 72441,72452 ----
  ]</i></p>
  
  
! <blockquote><p>
  An alternative (and possibly preferable solution for potentially
! heap-allocating <tt>big_int</tt> representation types) would be to ask the core
  language to allow references to <tt>const</tt> literal types as feasible
  arguments for <tt>constexpr</tt> functions.
! </p></blockquote>
  
  <p><i>[
  2009-10-30 Alisdair adds:
*************** I suggest this issue moves from New to O
*** 65678,65684 ****
  
  <p>
  Half of this issue was dealt with in paper
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.html">n2994</a>
  on constexpr constructors.
  </p>
  
--- 72460,72466 ----
  
  <p>
  Half of this issue was dealt with in paper
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2994.htm">n2994</a>
  on constexpr constructors.
  </p>
  
*************** The other half (duration arithmetic) is
*** 65701,65711 ****
  ]</i></p>
  
  
! <blockquote>
! This issue was the motivation for Core adding the facility for <tt>constexpr</tt> functions to take parameters by <tt>const &amp;</tt>.
  
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia.
--- 72483,72494 ----
  ]</i></p>
  
  
! <blockquote><p>
! This issue was the motivation for Core adding the facility for <tt>constexpr</tt> 
! functions to take parameters by <tt>const &amp;</tt>.
  
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia.
*************** Adopted at 2010-11 Batavia.
*** 65719,65726 ****
  Add <tt>constexpr</tt> to declaration of following functions and constructors:
  </p>
  <p>
! Modify p1 20.11 [time], and the prototype definitions in 20.11.3.5 [time.duration.nonmember], 20.11.3.6 [time.duration.comparisons],
! and 20.11.3.7 [time.duration.cast]:
  </p>
  
  <blockquote>
--- 72502,72509 ----
  Add <tt>constexpr</tt> to declaration of following functions and constructors:
  </p>
  <p>
! Modify p1 20.12 [time], and the prototype definitions in 20.12.5.5 [time.duration.nonmember], 20.12.5.6 [time.duration.comparisons],
! and 20.12.5.7 [time.duration.cast]:
  </p>
  
  <blockquote>
*************** and 20.11.3.7 [time.duration.cast]:
*** 65728,65734 ****
  <b>Header <tt>&lt;chrono&gt;</tt> synopsis</b>
  </p>
  
! <pre><i>// duration arithmetic</i>
  template &lt;class Rep1, class Period1, class Rep2, class Period2&gt;
     typename common_type&lt;duration&lt;Rep1, Period1&gt;, duration&lt;Rep2, Period2&gt;&gt;::type
     <ins>constexpr</ins> operator+(const duration&lt;Rep1, Period1&gt;&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
--- 72511,72518 ----
  <b>Header <tt>&lt;chrono&gt;</tt> synopsis</b>
  </p>
  
! <pre>
! <i>// duration arithmetic</i>
  template &lt;class Rep1, class Period1, class Rep2, class Period2&gt;
     typename common_type&lt;duration&lt;Rep1, Period1&gt;, duration&lt;Rep2, Period2&gt;&gt;::type
     <ins>constexpr</ins> operator+(const duration&lt;Rep1, Period1&gt;&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
*************** template &lt;class ToDuration, class Rep
*** 65770,65781 ****
  </blockquote>
  
  <p>
! Change 20.11.3 [time.duration]:
  </p>
  
  <blockquote>
  
! <pre>template &lt;class Rep, class Period = ratio&lt;1&gt;&gt;
  class duration {
    ...
  public:
--- 72554,72566 ----
  </blockquote>
  
  <p>
! Change 20.12.5 [time.duration]:
  </p>
  
  <blockquote>
  
! <pre>
! template &lt;class Rep, class Period = ratio&lt;1&gt;&gt;
  class duration {
    ...
  public:
*************** public:
*** 65787,65794 ****
  </pre>
  </blockquote>
  <p><i>[
! Note - this edit already seems assumed by definition of the duration static members <tt>zero/min/max</tt>.
! They cannot meaningfully be <tt>constexpr</tt> without this change.
  ]</i></p>
  
  
--- 72572,72580 ----
  </pre>
  </blockquote>
  <p><i>[
! Note - this edit already seems assumed by definition of the duration static members 
! <tt>zero&#47;min&#47;max</tt>. They cannot meaningfully be <tt>constexpr</tt> without 
! this change.
  ]</i></p>
  
  
*************** They cannot meaningfully be <tt>constexp
*** 65797,65811 ****
  
  
  <hr>
! <h3><a name="1174"></a>1174. type property predicates</h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Jason Merrill <b>Opened:</b> 2009-07-16 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I've been implementing compiler support for <tt>is_standard_layout</tt>, and
! noticed a few nits about 20.7.4.3 [meta.unary.prop]:
  </p>
  
  <ol>
--- 72583,72683 ----
  
  
  <hr>
! <h3><a name="1172"></a>1172. <tt>select_on_container_(copy|move)_construction</tt> over-constrained</h3>
! <p><b>Section:</b> X [allocator.concepts.members] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2009-07-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I believe the two functions
! <tt>select_on_container_(copy|move)_construction()</tt> are over-constrained. For
! example, the return value of the "copy" version is (see
! X [allocator.concepts.members]/21):
! </p>
! <blockquote><p>
! <i>Returns:</i> <tt>x</tt> if the allocator should propagate from the existing
! container to the new container on copy construction, otherwise <tt>X()</tt>.
! </p></blockquote>
! <p>
! Consider the case where a user decides to provide an explicit concept
! map for Allocator to adapt some legacy allocator class, as he wishes to
! provide customizations that the <tt>LegacyAllocator</tt> concept map template
! does not provide.  Now, although it's true that the legacy class is
! required to have a default constructor, the user might have reasons to
! prefer a different constructor to implement
! <tt>select_on_container_copy_construction()</tt>. However, the current wording
! requires the use of the default constructor.
! </p>
! <p>
! Moreover, it's not said explicitly that <tt>x</tt> is supposed to be the
! allocator of the existing container. A clarification would do no harm.
! </p>
! 
! <p><i>[
! 2009-10 Santa Cruz:
! ]</i></p>
! 
! 
! <blockquote><p>
! <del>NAD Editorial</del><ins>Resolved</ins>.  Addressed by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2982.pdf">N2982</a>.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Replace X [allocator.concepts.members]/21 with:
! </p>
! 
! <blockquote><pre>
! X select_on_container_copy_construction(const X&amp; x);
! </pre>
! <p>
! -21- <i>Returns:</i> <del><tt>x</tt> if the allocator should propagate from the existing
! container to the new container on copy construction, otherwise <tt>X()</tt>.</del>
! <ins>an allocator object to be used by the new container on copy
! construction. [<i>Note:</i> <tt>x</tt> is the allocator of the existing container that
! is being copied. The most obvious choices for the return value are <tt>x</tt>, if
! the allocator should propagate from the existing container, and <tt>X()</tt>.
! <i>&mdash; end note</i>]</ins>
! </p>
! </blockquote>
! 
! <p>
! Replace X [allocator.concepts.members]/25 with:
! </p>
! 
! <blockquote><pre>
! X select_on_container_move_construction(X&amp;&amp; x);
! </pre>
! <p>
! -25- <i>Returns:</i> <del><tt>move(x)</tt> if the allocator should propagate from the existing
! container to the new container on move construction, otherwise <tt>X()</tt>.</del>
! <ins>an allocator object to be used by the new container on move
! construction. [<i>Note:</i> <tt>x</tt> is the allocator of the existing container that
! is being moved. The most obvious choices for the return value are <tt>move(x)</tt>, if
! the allocator should propagate from the existing container, and <tt>X()</tt>.
! <i>&mdash; end note</i>]</ins>
! </p>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1174"></a>1174. Type property predicates</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Jason Merrill <b>Opened:</b> 2009-07-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I've been implementing compiler support for <tt>is_standard_layout</tt>, and
! noticed a few nits about 20.10.4.3 [meta.unary.prop]:
  </p>
  
  <ol>
*************** Addressed in <a href="http://www.open-st
*** 65840,65849 ****
  ]</i></p>
  
  
! <blockquote>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2984.html">N2984</a>.
! </blockquote>
  
  
  
--- 72712,72721 ----
  ]</i></p>
  
  
! <blockquote><p>
  <del>NAD Editorial</del><ins>Resolved</ins>.  Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2984.htm">N2984</a>.
! </p></blockquote>
  
  
  
*************** Addressed in <a href="http://www.open-st
*** 65857,65866 ****
  
  <hr>
  <h3><a name="1177"></a>1177. Improve "diagnostic required" wording</h3>
! <p><b>Section:</b> 20.11.3 [time.duration] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-07-18 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.duration">issues</a> in [time.duration].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  "diagnostic required" has been used (by me) for code words meaning "use
--- 72729,72738 ----
  
  <hr>
  <h3><a name="1177"></a>1177. Improve "diagnostic required" wording</h3>
! <p><b>Section:</b> 20.12.5 [time.duration] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-07-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration">issues</a> in [time.duration].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  "diagnostic required" has been used (by me) for code words meaning "use
*************** the overload set, and moving this wordin
*** 65874,65882 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  <p><i>[
  2009-11-19 Pete opens:
--- 72746,72754 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  <p><i>[
  2009-11-19 Pete opens:
*************** Oh, and speaking of 1177, most of the ch
*** 65889,65923 ****
  Instead of saying
  </p>
  
! <blockquote>
  A shall be B, else C
! </blockquote>
  
  <p>
  it should be
  </p>
  
! <blockquote>
  C if A is not B
! </blockquote>
  
  <p>
  That is:
  </p>
  
! <blockquote>
  <tt>Rep2</tt> shall be implicitly convertible to <tt>CR(Rep1, Rep2)</tt>, else
  this signature shall not participate in overload resolution.
! </blockquote>
  
  <p>
  should be
  </p>
  
! <blockquote>
  This signature shall not participate in overload resolution if <tt>Rep2</tt> is
  not implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.
! </blockquote>
  
  <p>
  That is clearer, and eliminates the false requirement that <tt>Rep2</tt> "shall
--- 72761,72795 ----
  Instead of saying
  </p>
  
! <blockquote><p>
  A shall be B, else C
! </p></blockquote>
  
  <p>
  it should be
  </p>
  
! <blockquote><p>
  C if A is not B
! </p></blockquote>
  
  <p>
  That is:
  </p>
  
! <blockquote><p>
  <tt>Rep2</tt> shall be implicitly convertible to <tt>CR(Rep1, Rep2)</tt>, else
  this signature shall not participate in overload resolution.
! </p></blockquote>
  
  <p>
  should be
  </p>
  
! <blockquote><p>
  This signature shall not participate in overload resolution if <tt>Rep2</tt> is
  not implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.
! </p></blockquote>
  
  <p>
  That is clearer, and eliminates the false requirement that <tt>Rep2</tt> "shall
*************** be" convertible.
*** 65931,65940 ****
  ]</i></p>
  
  
! <blockquote>
  I've updated the wording to match Pete's suggestion and included bullet 16
! from <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1195">1195</a>.
! </blockquote>
  
  <p><i>[
  2009-11-19 Jens adds:
--- 72803,72812 ----
  ]</i></p>
  
  
! <blockquote><p>
  I've updated the wording to match Pete's suggestion and included bullet 16
! from <a href="lwg-defects.html#1195">1195</a>.
! </p></blockquote>
  
  <p><i>[
  2009-11-19 Jens adds:
*************** from <a href="http://www.open-std.org/jt
*** 65946,65955 ****
  Further wording suggestion using "unless":
  </p>
  
! <blockquote>
  This signature shall not participate in overload resolution unless <tt>Rep2</tt>
  is implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 72818,72827 ----
  Further wording suggestion using "unless":
  </p>
  
! <blockquote><p>
  This signature shall not participate in overload resolution unless <tt>Rep2</tt>
  is implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** is implicitly convertible to <tt>CR(Rep1
*** 65957,65965 ****
  ]</i></p>
  
  
! <blockquote>
  I've updated the wording to match Jens' suggestion.
! </blockquote>
  
  <p><i>[
  2009-11-22 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
--- 72829,72837 ----
  ]</i></p>
  
  
! <blockquote><p>
  I've updated the wording to match Jens' suggestion.
! </p></blockquote>
  
  <p><i>[
  2009-11-22 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
*************** I've updated the wording to match Jens'
*** 65970,65988 ****
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[
! This proposed resolution addresses <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#947">947</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#974">974</a>. 
  ]</i></p>
  
  
  <ol>
  <li>
  <p>
! Change 20.11.3.1 [time.duration.cons] (and reorder the <i>Remarks</i>
  paragraphs per 17.5.1.4 [structure.specifications]):
  </p>
  
  <blockquote>
! <pre>template &lt;class Rep2&gt; 
    explicit duration(const Rep2&amp; r);
  </pre>
  <blockquote>
--- 72842,72861 ----
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[
! This proposed resolution addresses <a href="lwg-defects.html#947">947</a> and <a href="lwg-defects.html#974">974</a>. 
  ]</i></p>
  
  
  <ol>
  <li>
  <p>
! Change 20.12.5.1 [time.duration.cons] (and reorder the <i>Remarks</i>
  paragraphs per 17.5.1.4 [structure.specifications]):
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Rep2&gt; 
    explicit duration(const Rep2&amp; r);
  </pre>
  <blockquote>
*************** participate in overload resolution unles
*** 66004,66015 ****
  <p>
  <del>Diagnostic required</del> [<i>Example:</i>
  </p>
! <blockquote><pre>duration&lt;int, milli&gt; d(3); // OK 
  duration&lt;int, milli&gt; d(3.5); // error 
  </pre></blockquote>
  
  <p>
! — <i>end example</i>]
  </p>
  
  <p>
--- 72877,72889 ----
  <p>
  <del>Diagnostic required</del> [<i>Example:</i>
  </p>
! <blockquote><pre>
! duration&lt;int, milli&gt; d(3); // OK 
  duration&lt;int, milli&gt; d(3.5); // error 
  </pre></blockquote>
  
  <p>
! &mdash; <i>end example</i>]
  </p>
  
  <p>
*************** duration&lt;int, milli&gt; d(3.5); // er
*** 66022,66028 ****
  
  </blockquote>
  
! <pre>template &lt;class Rep2, class Period2&gt;
    duration(const duration&lt;Rep2, Period2&gt;&amp; d);
  </pre>
  <blockquote>
--- 72896,72903 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Rep2, class Period2&gt;
    duration(const duration&lt;Rep2, Period2&gt;&amp; d);
  </pre>
  <blockquote>
*************** participate in overload resolution unles
*** 66034,66050 ****
  period&gt;::type::den</tt> <del>shall be</del> <ins>is</ins> 1. <del>Diagnostic
  required.</del> [<i>Note:</i> This requirement prevents implicit truncation
  error when converting between integral-based duration types. Such a construction
! could easily lead to confusion about the value of the duration. — <i>end
  note</i>] [<i>Example:</i>
  </p>
  
! <blockquote><pre>duration&lt;int, milli&gt; ms(3); 
  duration&lt;int, micro&gt; us = ms; // OK 
  duration&lt;int, milli&gt; ms2 = us; // error 
  </pre></blockquote>
  
  <p>
! — <i>end example</i>]
  </p>
  
  <p>
--- 72909,72926 ----
  period&gt;::type::den</tt> <del>shall be</del> <ins>is</ins> 1. <del>Diagnostic
  required.</del> [<i>Note:</i> This requirement prevents implicit truncation
  error when converting between integral-based duration types. Such a construction
! could easily lead to confusion about the value of the duration. &mdash; <i>end
  note</i>] [<i>Example:</i>
  </p>
  
! <blockquote><pre>
! duration&lt;int, milli&gt; ms(3); 
  duration&lt;int, micro&gt; us = ms; // OK 
  duration&lt;int, milli&gt; ms2 = us; // error 
  </pre></blockquote>
  
  <p>
! &mdash; <i>end example</i>]
  </p>
  
  <p>
*************** duration&lt;int, milli&gt; ms2 = us; //
*** 66061,66140 ****
  
  <li>
  <p>
! Change the following paragraphs in 20.11.3.5 [time.duration.nonmember]:
  </p>
  
  <blockquote>
! <pre>template &lt;class Rep1, class Period, class Rep2&gt; 
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt; 
    operator*(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This operator shall not
  participate in overload resolution unless</ins> <tt>Rep2</tt> <del>shall
  be</del> <ins>is</ins> implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.
  <del>Diagnostic required.</del>
! </blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt; 
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt; 
    operator*(const Rep1&amp; s, const duration&lt;Rep2, Period&gt;&amp; d);
  </pre>
! <blockquote>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This operator shall not
  participate in overload resolution unless</ins> <tt>Rep1</tt> <del>shall
  be</del> <ins>is</ins> implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.
  <del>Diagnostic required.</del>
! </blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt; 
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt; 
    operator/(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This operator shall not
  participate in overload resolution unless</ins> <tt>Rep2</tt> <del>shall
  be</del> <ins>is</ins> implicitly convertible to <tt>CR(Rep1, Rep2)</tt> and
  <tt>Rep2</tt> <del>shall not be</del> <ins>is not</ins> an instantiation of
  <tt>duration</tt>. <del>Diagnostic required.</del>
! </blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt; 
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt; 
    operator%(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This operator shall not
  participate in overload resolution unless</ins> <tt>Rep2</tt> <del>shall
  be</del> <ins>is</ins> implicitly convertible to <tt>CR(Rep1, Rep2)</tt> and
  <tt>Rep2</tt> <del>shall not be</del> <ins>is not</ins> an instantiation of
  <tt>duration</tt>. <del>Diagnostic required.</del>
! </blockquote>
  
  </blockquote>
  </li>
  
  <li>
  <p>
! Change the following paragraphs in 20.11.3.7 [time.duration.cast]:
  </p>
  
! <blockquote><pre>template &lt;class ToDuration, class Rep, class Period&gt; 
    ToDuration duration_cast(const duration&lt;Rep, Period&gt;&amp; d);
  </pre>
  
! <blockquote>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This function shall not
  participate in overload resolution unless</ins> <tt>ToDuration</tt> <del>shall
  be</del> <ins>is</ins> an instantiation of <tt>duration</tt>. <del>Diagnostic
  required.</del>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.11.4.1 [time.point.cons]/3 as indicated:
  </p>
  
  <blockquote>
--- 72937,73021 ----
  
  <li>
  <p>
! Change the following paragraphs in 20.12.5.5 [time.duration.nonmember]:
  </p>
  
  <blockquote>
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt; 
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt; 
    operator*(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote><p>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This operator shall not
  participate in overload resolution unless</ins> <tt>Rep2</tt> <del>shall
  be</del> <ins>is</ins> implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.
  <del>Diagnostic required.</del>
! </p></blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt; 
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt; 
    operator*(const Rep1&amp; s, const duration&lt;Rep2, Period&gt;&amp; d);
  </pre>
! <blockquote><p>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This operator shall not
  participate in overload resolution unless</ins> <tt>Rep1</tt> <del>shall
  be</del> <ins>is</ins> implicitly convertible to <tt>CR(Rep1, Rep2)</tt>.
  <del>Diagnostic required.</del>
! </p></blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt; 
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt; 
    operator/(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote><p>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This operator shall not
  participate in overload resolution unless</ins> <tt>Rep2</tt> <del>shall
  be</del> <ins>is</ins> implicitly convertible to <tt>CR(Rep1, Rep2)</tt> and
  <tt>Rep2</tt> <del>shall not be</del> <ins>is not</ins> an instantiation of
  <tt>duration</tt>. <del>Diagnostic required.</del>
! </p></blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt; 
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt; 
    operator%(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote><p>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This operator shall not
  participate in overload resolution unless</ins> <tt>Rep2</tt> <del>shall
  be</del> <ins>is</ins> implicitly convertible to <tt>CR(Rep1, Rep2)</tt> and
  <tt>Rep2</tt> <del>shall not be</del> <ins>is not</ins> an instantiation of
  <tt>duration</tt>. <del>Diagnostic required.</del>
! </p></blockquote>
  
  </blockquote>
  </li>
  
  <li>
  <p>
! Change the following paragraphs in 20.12.5.7 [time.duration.cast]:
  </p>
  
! <blockquote><pre>
! template &lt;class ToDuration, class Rep, class Period&gt; 
    ToDuration duration_cast(const duration&lt;Rep, Period&gt;&amp; d);
  </pre>
  
! <blockquote><p>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This function shall not
  participate in overload resolution unless</ins> <tt>ToDuration</tt> <del>shall
  be</del> <ins>is</ins> an instantiation of <tt>duration</tt>. <del>Diagnostic
  required.</del>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.12.6.1 [time.point.cons]/3 as indicated:
  </p>
  
  <blockquote>
*************** resolution unless <tt>Duration2</tt> is
*** 66154,66172 ****
  
  <li>
  <p>
! Change the following paragraphs in 20.11.4.7 [time.point.cast]:
  </p>
  
! <blockquote><pre>template &lt;class ToDuration, class Clock, class Duration&gt; 
    time_point&lt;Clock, ToDuration&gt; time_point_cast(const time_point&lt;Clock, Duration&gt;&amp; t);
  </pre>
  
! <blockquote>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This function shall not
  participate in overload resolution unless</ins> <tt>ToDuration</tt> <del>shall
  be</del> <ins>is</ins> an instantiation of <tt>duration</tt>. <del>Diagnostic
  required.</del>
! </blockquote>
  </blockquote>
  </li>
  </ol>
--- 73035,73054 ----
  
  <li>
  <p>
! Change the following paragraphs in 20.12.6.7 [time.point.cast]:
  </p>
  
! <blockquote><pre>
! template &lt;class ToDuration, class Clock, class Duration&gt; 
    time_point&lt;Clock, ToDuration&gt; time_point_cast(const time_point&lt;Clock, Duration&gt;&amp; t);
  </pre>
  
! <blockquote><p>
  <i><del>Requires</del> <ins>Remarks</ins>:</i> <ins>This function shall not
  participate in overload resolution unless</ins> <tt>ToDuration</tt> <del>shall
  be</del> <ins>is</ins> an instantiation of <tt>duration</tt>. <del>Diagnostic
  required.</del>
! </p></blockquote>
  </blockquote>
  </li>
  </ol>
*************** required.</del>
*** 66178,66194 ****
  
  <hr>
  <h3><a name="1178"></a>1178. Header dependencies</h3>
! <p><b>Section:</b> 17.6.4.2 [res.on.headers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-07-18 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! See Frankfurt notes of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1001">1001</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p><i>Change 17.6.4.2 [res.on.headers], Headers, paragraph 1, as indicated:</i></p>
  
  <blockquote>
  
--- 73060,73076 ----
  
  <hr>
  <h3><a name="1178"></a>1178. Header dependencies</h3>
! <p><b>Section:</b> 17.6.5.2 [res.on.headers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-07-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! See Frankfurt notes of <a href="lwg-closed.html#1001">1001</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
! <p><i>Change 17.6.5.2 [res.on.headers], Headers, paragraph 1, as indicated:</i></p>
  
  <blockquote>
  
*************** the synopses of those other headers.</in
*** 66211,66220 ****
  
  
  <hr>
! <h3><a name="1180"></a>1180. Missing string_type member typedef in class <tt>sub_match</tt></h3>
! <p><b>Section:</b> 28.9.1 [re.submatch.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-07-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The definition of class template <tt>sub_match</tt> is strongly dependent
--- 73093,73102 ----
  
  
  <hr>
! <h3><a name="1180"></a>1180. Missing <tt>string_type</tt> member typedef in class <tt>sub_match</tt></h3>
! <p><b>Section:</b> 28.9.1 [re.submatch.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-07-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The definition of class template <tt>sub_match</tt> is strongly dependent
*************** In the class template <tt>sub_match</tt>
*** 66239,66245 ****
  change as indicated:
  </p>
  
! <blockquote><pre>template &lt;class BidirectionalIterator&gt;
  class sub_match : public std::pair&lt;BidirectionalIterator, BidirectionalIterator&gt; {
  public:
    typedef typename iterator_traits&lt;BidirectionalIterator&gt;::value_type value_type;
--- 73121,73128 ----
  change as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class BidirectionalIterator&gt;
  class sub_match : public std::pair&lt;BidirectionalIterator, BidirectionalIterator&gt; {
  public:
    typedef typename iterator_traits&lt;BidirectionalIterator&gt;::value_type value_type;
*************** public:
*** 66264,66277 ****
  In 28.9.1 [re.submatch.members]/2 change as indicated:
  </p>
  
! <blockquote><pre>operator <del>basic_string&lt;value_type&gt;</del><ins>string_type</ins>() const;
  </pre>
  
! <blockquote>
  <i>Returns:</i> <tt>matched ? <del>basic_string&lt;value_type&gt;</del>
  <ins>string_type</ins>(first, second) : <del>basic_string&lt;value_type&gt;</del>
  <ins>string_type</ins>()</tt>.
! </blockquote>
  </blockquote>
  </li>
  
--- 73147,73161 ----
  In 28.9.1 [re.submatch.members]/2 change as indicated:
  </p>
  
! <blockquote><pre>
! operator <del>basic_string&lt;value_type&gt;</del><ins>string_type</ins>() const;
  </pre>
  
! <blockquote><p>
  <i>Returns:</i> <tt>matched ? <del>basic_string&lt;value_type&gt;</del>
  <ins>string_type</ins>(first, second) : <del>basic_string&lt;value_type&gt;</del>
  <ins>string_type</ins>()</tt>.
! </p></blockquote>
  </blockquote>
  </li>
  
*************** In 28.9.1 [re.submatch.members]/2 change
*** 66280,66293 ****
  In 28.9.1 [re.submatch.members]/3 change as indicated:
  </p>
  
! <blockquote><pre><del>basic_string&lt;value_type&gt;</del><ins>string_type</ins> str() const;
  </pre>
  
! <blockquote>
  <i>Returns:</i> <tt>matched ? <del>basic_string&lt;value_type&gt;</del>
  <ins>string_type</ins>(first, second) : <del>basic_string&lt;value_type&gt;</del>
  <ins>string_type</ins>()</tt>.
! </blockquote>
  </blockquote>
  </li>
  
--- 73164,73178 ----
  In 28.9.1 [re.submatch.members]/3 change as indicated:
  </p>
  
! <blockquote><pre>
! <del>basic_string&lt;value_type&gt;</del><ins>string_type</ins> str() const;
  </pre>
  
! <blockquote><p>
  <i>Returns:</i> <tt>matched ? <del>basic_string&lt;value_type&gt;</del>
  <ins>string_type</ins>(first, second) : <del>basic_string&lt;value_type&gt;</del>
  <ins>string_type</ins>()</tt>.
! </p></blockquote>
  </blockquote>
  </li>
  
*************** In 28.9.1 [re.submatch.members]/3 change
*** 66296,66302 ****
  In 28.9.1 [re.submatch.members]/5 change as indicated:
  </p>
  
! <blockquote><pre>int compare(const <del>basic_string&lt;value_type&gt;</del><ins>string_type</ins>&amp; s) const;
  </pre></blockquote>
  </li>
  </ol>
--- 73181,73188 ----
  In 28.9.1 [re.submatch.members]/5 change as indicated:
  </p>
  
! <blockquote><pre>
! int compare(const <del>basic_string&lt;value_type&gt;</del><ins>string_type</ins>&amp; s) const;
  </pre></blockquote>
  </li>
  </ol>
*************** In 28.9.1 [re.submatch.members]/5 change
*** 66308,66317 ****
  
  <hr>
  <h3><a name="1181"></a>1181. Invalid <tt>sub_match</tt> comparison operators</h3>
! <p><b>Section:</b> 28.9.2 [re.submatch.op] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-07-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.submatch.op">issues</a> in [re.submatch.op].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Several heterogeneous comparison operators of class template
--- 73194,73203 ----
  
  <hr>
  <h3><a name="1181"></a>1181. Invalid <tt>sub_match</tt> comparison operators</h3>
! <p><b>Section:</b> 28.9.2 [re.submatch.op] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-07-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.submatch.op">issues</a> in [re.submatch.op].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Several heterogeneous comparison operators of class template
*************** Several heterogeneous comparison operato
*** 66319,66333 ****
  in general. E.g. 28.9.2 [re.submatch.op]/7:
  </p>
  
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
  bool operator==(
    const basic_string&lt;
      typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
    const sub_match&lt;BiIter&gt;&amp; rhs);
  </pre>
! <blockquote>
  <i>Returns:</i> <tt>lhs == rhs.str()</tt>.
! </blockquote>
  </blockquote>
  
  <p>
--- 73205,73220 ----
  in general. E.g. 28.9.2 [re.submatch.op]/7:
  </p>
  
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
  bool operator==(
    const basic_string&lt;
      typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
    const sub_match&lt;BiIter&gt;&amp; rhs);
  </pre>
! <blockquote><p>
  <i>Returns:</i> <tt>lhs == rhs.str()</tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** traits class), the second one would defi
*** 66345,66358 ****
  comparison using the traits class
  </p>
  
! <blockquote><pre>std::char_traits&lt;iterator_traits&lt;BiIter&gt;::value_type&gt;
  </pre></blockquote>
  
  <p>
  which is essentially identical to
  </p>
  
! <blockquote><pre>std::char_traits&lt;sub_match&lt;BiIter&gt;::value_type&gt;
  </pre></blockquote>
  
  <p>
--- 73232,73247 ----
  comparison using the traits class
  </p>
  
! <blockquote><pre>
! std::char_traits&lt;iterator_traits&lt;BiIter&gt;::value_type&gt;
  </pre></blockquote>
  
  <p>
  which is essentially identical to
  </p>
  
! <blockquote><pre>
! std::char_traits&lt;sub_match&lt;BiIter&gt;::value_type&gt;
  </pre></blockquote>
  
  <p>
*************** where defined by referring to <tt>sub_ma
*** 66381,66389 ****
  definitions in terms of these two.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 73270,73278 ----
  definitions in terms of these two.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 66399,66713 ****
  
  <ol>
  <li>Change 28.9.2 [re.submatch.op]/7 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator==(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  7 <em>Returns</em>: <tt><del>lhs == rhs.str()</del><ins>rhs.compare(lhs.c_str()) == 0</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/8 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator!=(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  8 <em>Returns</em>: <tt><del>lhs != rhs.str()</del><ins>!(lhs == rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/9 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator&lt;(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  9 <em>Returns</em>: <tt><del>lhs &lt; rhs.str()</del><ins>rhs.compare(lhs.c_str()) &gt; 0</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/10 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator&gt;(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  10 <em>Returns</em>: <tt><del>lhs &gt; rhs.str()</del><ins>rhs &lt; lhs</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/11 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator&gt;=(
     const basic_string&lt;
     typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
   const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  11 <em>Returns</em>: <tt><del>lhs &gt;= rhs.str()</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/12 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator&lt;=(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  12 <em>Returns</em>: <tt><del>lhs &lt;= rhs.str()</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/13 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator==(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre>
  13 <em>Returns</em>: <tt><del>lhs.str() == rhs</del><ins>lhs.compare(rhs.c_str()) == 0</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/14 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator!=(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre>
  14 <em>Returns</em>: <tt><del>lhs.str() != rhs</del><ins>!(lhs == rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/15 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator&lt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre>
  15 <em>Returns</em>: <tt><del>lhs.str() &lt; rhs</del><ins>lhs.compare(rhs.c_str()) &lt; 0</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/16 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
!  bool operator&gt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre>
  16 <em>Returns</em>: <tt><del>lhs.str() &gt; rhs</del><ins>rhs &lt; lhs</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/17 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator&gt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre>
  17 <em>Returns</em>: <tt><del>lhs.str() &gt;= rhs</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/18 as indicated:
! <blockquote><pre>template &lt;class BiIter, class ST, class SA&gt;
   bool operator&lt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre>
  18 <em>Returns</em>: <tt><del>lhs.str() &lt;= rhs</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/19 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator==(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  19 <em>Returns</em>: <tt><del>lhs == rhs.str()</del><ins>rhs.compare(lhs) == 0</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/20 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator!=(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  20 <em>Returns</em>: <tt><del>lhs != rhs.str()</del><ins>!(lhs == rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/21 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&lt;(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  21 <em>Returns</em>: <tt><del>lhs &lt; rhs.str()</del><ins>rhs.compare(lhs) &gt; 0</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/22 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&gt;(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  22 <em>Returns</em>: <tt><del>lhs &gt; rhs.str()</del><ins>rhs &lt; lhs</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/23 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&gt;=(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  23 <em>Returns</em>: <tt><del>lhs &gt;= rhs.str()</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/24 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&lt;=(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  24 <em>Returns</em>: <tt><del>lhs &lt;= rhs.str()</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/25 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator==(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre>
  25 <em>Returns</em>: <tt><del>lhs.str() == rhs</del><ins>lhs.compare(rhs) == 0</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/26 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator!=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre>
  26 <em>Returns</em>: <tt><del>lhs.str() != rhs</del><ins>!(lhs == rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/27 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&lt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre>
  27 <em>Returns</em>: <tt><del>lhs.str() &lt; rhs</del><ins>lhs.compare(rhs) &lt; 0</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/28 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&gt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre>
  28 <em>Returns</em>: <tt><del>lhs.str() &gt; rhs</del><ins>rhs &lt; lhs</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/29 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&gt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre>
  29 <em>Returns</em>: <tt><del>lhs.str() &gt;= rhs</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/30 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&lt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre>
  30 <em>Returns</em>: <tt><del>lhs.str() &lt;= rhs</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/31 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator==(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
! <del>31 <em>Returns</em>: <tt>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1,	lhs) == rhs.str()</tt>.</del><br>
  <ins>31 <em>Returns</em>: <tt>rhs.compare(typename sub_match&lt;BiIter&gt;::string_type(1, lhs)) == 0</tt>.</ins>
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/32 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator!=(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  32 <em>Returns</em>: <tt><del>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, lhs) !=
  rhs.str()</del><ins>!(lhs == rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/33 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&lt;(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
! <del>33 <em>Returns</em>: <tt>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, lhs) &lt; rhs.str()</tt>.</del><br>
  <ins>33 <em>Returns</em>: <tt>rhs.compare(typename sub_match&lt;BiIter&gt;::string_type(1, lhs)) &gt; 0</tt>.</ins>
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/34 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&gt;(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  34 <em>Returns</em>: <tt><del>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, lhs) &gt; rhs.str()</del><ins>rhs &lt; lhs</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/35 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&gt;=(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
! 35 <em>Returns</em>: <tt><del>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, lhs) &gt;= rhs.str()</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/36 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&lt;=(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre>
  36 <em>Returns</em>: <tt><del>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, lhs) &lt;= rhs.str()</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/37 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator==(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre>
! <del>37 <em>Returns</em>: <tt>lhs.str() == basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</tt>.</del><br>
  <ins>37 <em>Returns</em>: <tt>lhs.compare(typename sub_match&lt;BiIter&gt;::string_type(1, rhs)) == 0</tt>.</ins>
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/38 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator!=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre>
  38 <em>Returns</em>: <tt><del>lhs.str() != basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</del><ins>!(lhs == rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/39 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&lt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre>
! <del>39 <em>Returns</em>: <tt>lhs.str() &lt; basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</tt>.</del><br>
  <ins>39 <em>Returns</em>: <tt>lhs.compare(typename sub_match&lt;BiIter&gt;::string_type(1, rhs)) &lt; 0</tt>.</ins>
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/40 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&gt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre>
  40 <em>Returns</em>: <tt><del>lhs.str() &gt; basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</del><ins>rhs &lt; lhs</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/41 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&gt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre>
  41 <em>Returns</em>: <tt><del>lhs.str() &gt;= basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/42 as indicated:
! <blockquote><pre>template &lt;class BiIter&gt;
   bool operator&lt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre>
  42 <em>Returns</em>: <tt><del>lhs.str() &lt;= basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </blockquote>
  </li>
  </ol>
  
--- 73288,73638 ----
  
  <ol>
  <li>Change 28.9.2 [re.submatch.op]/7 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator==(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  7 <em>Returns</em>: <tt><del>lhs == rhs.str()</del><ins>rhs.compare(lhs.c_str()) == 0</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/8 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator!=(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  8 <em>Returns</em>: <tt><del>lhs != rhs.str()</del><ins>!(lhs == rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/9 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator&lt;(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  9 <em>Returns</em>: <tt><del>lhs &lt; rhs.str()</del><ins>rhs.compare(lhs.c_str()) &gt; 0</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/10 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator&gt;(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  10 <em>Returns</em>: <tt><del>lhs &gt; rhs.str()</del><ins>rhs &lt; lhs</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/11 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator&gt;=(
     const basic_string&lt;
     typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
   const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  11 <em>Returns</em>: <tt><del>lhs &gt;= rhs.str()</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/12 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator&lt;=(
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  12 <em>Returns</em>: <tt><del>lhs &lt;= rhs.str()</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/13 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator==(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre><p>
  13 <em>Returns</em>: <tt><del>lhs.str() == rhs</del><ins>lhs.compare(rhs.c_str()) == 0</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/14 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator!=(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre><p>
  14 <em>Returns</em>: <tt><del>lhs.str() != rhs</del><ins>!(lhs == rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/15 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator&lt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre><p>
  15 <em>Returns</em>: <tt><del>lhs.str() &lt; rhs</del><ins>lhs.compare(rhs.c_str()) &lt; 0</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/16 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
!  bool operator>(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre><p>
  16 <em>Returns</em>: <tt><del>lhs.str() &gt; rhs</del><ins>rhs &lt; lhs</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/17 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator&gt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre><p>
  17 <em>Returns</em>: <tt><del>lhs.str() &gt;= rhs</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/18 as indicated:
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
   bool operator&lt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     const basic_string&lt;
       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; rhs);
! </pre><p>
  18 <em>Returns</em>: <tt><del>lhs.str() &lt;= rhs</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/19 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator==(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  19 <em>Returns</em>: <tt><del>lhs == rhs.str()</del><ins>rhs.compare(lhs) == 0</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/20 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator!=(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  20 <em>Returns</em>: <tt><del>lhs != rhs.str()</del><ins>!(lhs == rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/21 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&lt;(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  21 <em>Returns</em>: <tt><del>lhs &lt; rhs.str()</del><ins>rhs.compare(lhs) &gt; 0</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/22 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&gt;(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  22 <em>Returns</em>: <tt><del>lhs &gt; rhs.str()</del><ins>rhs &lt; lhs</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/23 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&gt;=(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  23 <em>Returns</em>: <tt><del>lhs &gt;= rhs.str()</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/24 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&lt;=(typename iterator_traits&lt;BiIter&gt;::value_type const* lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  24 <em>Returns</em>: <tt><del>lhs &lt;= rhs.str()</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/25 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator==(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre><p>
  25 <em>Returns</em>: <tt><del>lhs.str() == rhs</del><ins>lhs.compare(rhs) == 0</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/26 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator!=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre><p>
  26 <em>Returns</em>: <tt><del>lhs.str() != rhs</del><ins>!(lhs == rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/27 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&lt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre><p>
  27 <em>Returns</em>: <tt><del>lhs.str() &lt; rhs</del><ins>lhs.compare(rhs) &lt; 0</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/28 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&gt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre><p>
  28 <em>Returns</em>: <tt><del>lhs.str() &gt; rhs</del><ins>rhs &lt; lhs</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/29 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&gt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre><p>
  29 <em>Returns</em>: <tt><del>lhs.str() &gt;= rhs</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/30 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&lt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const* rhs);
! </pre><p>
  30 <em>Returns</em>: <tt><del>lhs.str() &lt;= rhs</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/31 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator==(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
! <del>31 <em>Returns</em>: <tt>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1,	lhs) == rhs.str()</tt>.</del><br/>
  <ins>31 <em>Returns</em>: <tt>rhs.compare(typename sub_match&lt;BiIter&gt;::string_type(1, lhs)) == 0</tt>.</ins>
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/32 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator!=(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  32 <em>Returns</em>: <tt><del>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, lhs) !=
  rhs.str()</del><ins>!(lhs == rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/33 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&lt;(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
! <del>33 <em>Returns</em>: <tt>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type>(1, lhs) &lt; rhs.str()</tt>.</del><br/>
  <ins>33 <em>Returns</em>: <tt>rhs.compare(typename sub_match&lt;BiIter&gt;::string_type(1, lhs)) &gt; 0</tt>.</ins>
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/34 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&gt;(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  34 <em>Returns</em>: <tt><del>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, lhs) &gt; rhs.str()</del><ins>rhs &lt; lhs</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/35 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&gt;=(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
! 35 <em>Returns</em>: <tt><del>basic_string&lt;typename iterator_traits&lt;BiIter>::value_type>(1, lhs) &gt;= rhs.str()</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/36 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&lt;=(typename iterator_traits&lt;BiIter&gt;::value_type const&amp; lhs,
     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><p>
  36 <em>Returns</em>: <tt><del>basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, lhs) &lt;= rhs.str()</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/37 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator==(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre><p>
! <del>37 <em>Returns</em>: <tt>lhs.str() == basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</tt>.</del><br/>
  <ins>37 <em>Returns</em>: <tt>lhs.compare(typename sub_match&lt;BiIter&gt;::string_type(1, rhs)) == 0</tt>.</ins>
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/38 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator!=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre><p>
  38 <em>Returns</em>: <tt><del>lhs.str() != basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</del><ins>!(lhs == rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/39 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&lt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre><p>
! <del>39 <em>Returns</em>: <tt>lhs.str() &lt; basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</tt>.</del><br/>
  <ins>39 <em>Returns</em>: <tt>lhs.compare(typename sub_match&lt;BiIter&gt;::string_type(1, rhs)) &lt; 0</tt>.</ins>
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/40 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&gt;(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre><p>
  40 <em>Returns</em>: <tt><del>lhs.str() &gt; basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</del><ins>rhs &lt; lhs</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/41 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&gt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre><p>
  41 <em>Returns</em>: <tt><del>lhs.str() &gt;= basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</del><ins>!(lhs &lt; rhs)</ins></tt>.
! </p></blockquote>
  </li>
  <li>Change 28.9.2 [re.submatch.op]/42 as indicated:
! <blockquote><pre>
! template &lt;class BiIter&gt;
   bool operator&lt;=(const sub_match&lt;BiIter&gt;&amp; lhs,
     typename iterator_traits&lt;BiIter&gt;::value_type const&amp; rhs);
! </pre><p>
  42 <em>Returns</em>: <tt><del>lhs.str() &lt;= basic_string&lt;typename iterator_traits&lt;BiIter&gt;::value_type&gt;(1, rhs)</del><ins>!(rhs &lt; lhs)</ins></tt>.
! </p></blockquote>
  </li>
  </ol>
  
*************** rhs.str()</del><ins>!(lhs == rhs)</ins><
*** 66718,66727 ****
  
  <hr>
  <h3><a name="1182"></a>1182. Unfortunate hash dependencies</h3>
! <p><b>Section:</b> 20.8.15 [unord.hash] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-28 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 324</b></p>
  
--- 73643,73653 ----
  
  <hr>
  <h3><a name="1182"></a>1182. Unfortunate hash dependencies</h3>
! <p><b>Section:</b> 20.9.13 [unord.hash] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.hash">active issues</a> in [unord.hash].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 324</b></p>
  
*************** template in order to access the necessar
*** 66739,66745 ****
  <p>
  Note that the proposed resolution purely involves moving the
  declarations of a few specializations, it specifically does not make any
! changes to 20.8.15 [unord.hash].
  </p>
  
  <p><i>[
--- 73665,73671 ----
  <p>
  Note that the proposed resolution purely involves moving the
  declarations of a few specializations, it specifically does not make any
! changes to 20.9.13 [unord.hash].
  </p>
  
  <p><i>[
*************** changes to 20.8.15 [unord.hash].
*** 66747,66754 ****
  ]</i></p>
  
  
- <blockquote>
- </blockquote>
  <p>
  I suggest to add to the current existing
  proposed resolution the following items.
--- 73673,73678 ----
*************** Add to the very first strike-list of the
*** 66761,66767 ****
  the following lines:
  </p>
  
! <blockquote><pre><del>template &lt;&gt; struct hash&lt;std::error_code&gt;;</del>
  <del>template &lt;&gt; struct hash&lt;std::thread::id&gt;;</del>
  </pre></blockquote>
  </li>
--- 73685,73692 ----
  the following lines:
  </p>
  
! <blockquote><pre>
! <del>template &lt;&gt; struct hash&lt;std::error_code&gt;;</del>
  <del>template &lt;&gt; struct hash&lt;std::thread::id&gt;;</del>
  </pre></blockquote>
  </li>
*************** Add the following declarations to 19.5 [
*** 66772,66778 ****
  <tt>&lt;system_error&gt;</tt> synopsis after // 19.5.4:
  </p>
  
! <blockquote><pre><ins>
  // 19.5.x hash support
  template &lt;class T&gt; struct hash;
  template &lt;&gt; struct hash&lt;error_code&gt;;
--- 73697,73704 ----
  <tt>&lt;system_error&gt;</tt> synopsis after // 19.5.4:
  </p>
  
! <blockquote><pre>
! <ins>
  // 19.5.x hash support
  template &lt;class T&gt; struct hash;
  template &lt;&gt; struct hash&lt;error_code&gt;;
*************** Add a new clause 19.5.X (probably after
*** 66794,66806 ****
  template &lt;&gt; struct hash&lt;error_code&gt;;
  </ins></pre>
  
! <blockquote><ins>
! An explicit specialization of the class template hash (20.8.15 [unord.hash])
  shall be provided
  for the type <tt>error_code</tt> suitable for using this type as key in
  unordered associative
! containers (23.7 [unord]).
! </ins></blockquote>
  </blockquote>
  </li>
  
--- 73720,73732 ----
  template &lt;&gt; struct hash&lt;error_code&gt;;
  </ins></pre>
  
! <blockquote><p><ins>
! An explicit specialization of the class template hash (20.9.13 [unord.hash])
  shall be provided
  for the type <tt>error_code</tt> suitable for using this type as key in
  unordered associative
! containers (23.5 [unord]).
! </ins></p></blockquote>
  </blockquote>
  </li>
  
*************** declaration of
*** 66811,66817 ****
  the comparison operators:
  </p>
  
! <blockquote><pre><ins>
  template &lt;class T&gt; struct hash;
  template &lt;&gt; struct hash&lt;thread::id&gt;;
  </ins></pre></blockquote>
--- 73737,73744 ----
  the comparison operators:
  </p>
  
! <blockquote><pre>
! <ins>
  template &lt;class T&gt; struct hash;
  template &lt;&gt; struct hash&lt;thread::id&gt;;
  </ins></pre></blockquote>
*************** Add a new paragraph at the end of 30.3.1
*** 66827,66856 ****
  template &lt;&gt; struct hash&lt;thread::id&gt;;
  </ins></pre>
  
! <blockquote><ins>
! An explicit specialization of the class template hash (20.8.15 [unord.hash])
  shall be provided
  for the type <tt>thread::id</tt> suitable for using this type as key in
  unordered associative
! containers (23.7 [unord]).
! </ins></blockquote>
  </blockquote>
  </li>
  
  <li>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a> independently suggests moving the specialization
  <tt>std::hash&lt;std::thread::id&gt;</tt> to header <tt>&lt;thread&gt;</tt>.
  </li>
  </ul>
  
  <p><i>[
  2009-11-13 Alisdair adopts Daniel's suggestion and the extended note from
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#889">889</a>.
  ]</i></p>
  
  
  <p><i>[
! 2010-01-31 Alisdair: related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1245">1245</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a>.
  ]</i></p>
  
  
--- 73754,73783 ----
  template &lt;&gt; struct hash&lt;thread::id&gt;;
  </ins></pre>
  
! <blockquote><p><ins>
! An explicit specialization of the class template hash (20.9.13 [unord.hash])
  shall be provided
  for the type <tt>thread::id</tt> suitable for using this type as key in
  unordered associative
! containers (23.5 [unord]).
! </ins></p></blockquote>
  </blockquote>
  </li>
  
  <li>
! Issue <a href="lwg-defects.html#889">889</a> independently suggests moving the specialization
  <tt>std::hash&lt;std::thread::id&gt;</tt> to header <tt>&lt;thread&gt;</tt>.
  </li>
  </ul>
  
  <p><i>[
  2009-11-13 Alisdair adopts Daniel's suggestion and the extended note from
! <a href="lwg-defects.html#889">889</a>.
  ]</i></p>
  
  
  <p><i>[
! 2010-01-31 Alisdair: related to <a href="lwg-defects.html#1245">1245</a> and <a href="lwg-defects.html#978">978</a>.
  ]</i></p>
  
  
*************** Issue <a href="http://www.open-std.org/j
*** 66868,66876 ****
  
  <p><b>Proposed resolution:</b></p>
  <p><i>Strike the following specializations declared in the <tt>&lt;functional&gt;</tt> 
! synopsis p2 20.8 [function.objects] </i> </p>
! <blockquote>
!   <pre><del>template &lt;&gt; struct hash&lt;std::string&gt;;</del>
  <del>template &lt;&gt; struct hash&lt;std::u16string&gt;;</del>
  <del>template &lt;&gt; struct hash&lt;std::u32string&gt;;</del>
  <del>template &lt;&gt; struct hash&lt;std::wstring&gt;;</del>
--- 73795,73803 ----
  
  <p><b>Proposed resolution:</b></p>
  <p><i>Strike the following specializations declared in the <tt>&lt;functional&gt;</tt> 
! synopsis p2 20.9 [function.objects] </i> </p>
! <blockquote><pre>
! <del>template &lt;&gt; struct hash&lt;std::string&gt;;</del>
  <del>template &lt;&gt; struct hash&lt;std::u16string&gt;;</del>
  <del>template &lt;&gt; struct hash&lt;std::u32string&gt;;</del>
  <del>template &lt;&gt; struct hash&lt;std::wstring&gt;;</del>
*************** synopsis p2 20.8 [function.objects] </i>
*** 66880,66888 ****
  <del>template &lt;class Allocator&gt; struct hash&lt;std::vector&lt;bool, Allocator&gt; &gt;;</del>
  <del>template &lt;std::size_t N&gt; struct hash&lt;std::bitset&lt;N&gt; &gt;;</del></pre>
  </blockquote>
! <p><i>Add the following at the end of 20.8.15 [unord.hash]:</i></p>
! <blockquote>
!   <pre><ins>template &lt;&gt; struct hash&lt;bool&gt;;
  template &lt;&gt; struct hash&lt;char&gt;;
  template &lt;&gt; struct hash&lt;signed char&gt;;
  template &lt;&gt; struct hash&lt;unsigned char&gt;;
--- 73807,73815 ----
  <del>template &lt;class Allocator&gt; struct hash&lt;std::vector&lt;bool, Allocator&gt; &gt;;</del>
  <del>template &lt;std::size_t N&gt; struct hash&lt;std::bitset&lt;N&gt; &gt;;</del></pre>
  </blockquote>
! <p><i>Add the following at the end of 20.9.13 [unord.hash]:</i></p>
! <blockquote><pre>
! <ins>template &lt;&gt; struct hash&lt;bool&gt;;
  template &lt;&gt; struct hash&lt;char&gt;;
  template &lt;&gt; struct hash&lt;signed char&gt;;
  template &lt;&gt; struct hash&lt;unsigned char&gt;;
*************** template &lt;&gt; struct hash&lt;double&
*** 66902,66908 ****
  template &lt;&gt; struct hash&lt;long double&gt;;
  template&lt;class T&gt; struct hash&lt;T*&gt;;</ins></pre>
    <p><ins>
!   Specializations meeting the requirements of class template <tt>hash</tt> 20.8.15 [unord.hash].</ins></p>
  </blockquote>
  <p><i>Add the following declarations to 19.5 [syserr], header <tt>&lt;system_error&gt;</tt> 
  synopsis after // 19.5.4: </i> </p>
--- 73829,73835 ----
  template &lt;&gt; struct hash&lt;long double&gt;;
  template&lt;class T&gt; struct hash&lt;T*&gt;;</ins></pre>
    <p><ins>
!   Specializations meeting the requirements of class template <tt>hash</tt> 20.9.13 [unord.hash].</ins></p>
  </blockquote>
  <p><i>Add the following declarations to 19.5 [syserr], header <tt>&lt;system_error&gt;</tt> 
  synopsis after // 19.5.4: </i> </p>
*************** template &lt;&gt; struct hash&lt;error_c
*** 66915,66927 ****
  <blockquote>
    <p><ins>19.5.X Hash support [syserr.hash] </ins></p>
    <pre><ins>template &lt;&gt; struct hash&lt;error_code&gt;;</ins></pre>
!     <p><ins>Specialization meeting the requirements of class template <tt>hash</tt> 20.8.15 [unord.hash].</ins></p>
  </blockquote>
  <p><i>Add the following declarations to the synopsis of <tt>&lt;string&gt;</tt> in 21.3 [string.classes]
  </i>
  </p>
! <blockquote>
!   <pre><ins>// [basic.string.hash] hash support
  template &lt;class T&gt; struct hash;
  template &lt;&gt; struct hash&lt;string&gt;;
  template &lt;&gt; struct hash&lt;u16string&gt;;
--- 73842,73854 ----
  <blockquote>
    <p><ins>19.5.X Hash support [syserr.hash] </ins></p>
    <pre><ins>template &lt;&gt; struct hash&lt;error_code&gt;;</ins></pre>
!     <p><ins>Specialization meeting the requirements of class template <tt>hash</tt> 20.9.13 [unord.hash].</ins></p>
  </blockquote>
  <p><i>Add the following declarations to the synopsis of <tt>&lt;string&gt;</tt> in 21.3 [string.classes]
  </i>
  </p>
! <blockquote><pre>
! <ins>// [basic.string.hash] hash support
  template &lt;class T&gt; struct hash;
  template &lt;&gt; struct hash&lt;string&gt;;
  template &lt;&gt; struct hash&lt;u16string&gt;;
*************** template &lt;&gt; struct hash&lt;wstring
*** 66930,66955 ****
  </blockquote>
  <p><i>Add a new clause 21.4.X </i> </p>
  <blockquote>
!   <p><ins>21.4.X Hash support [basic.string.hash]&gt;</ins></p>
    <pre><ins>template &lt;&gt; struct hash&lt;string&gt;;
  template &lt;&gt; struct hash&lt;u16string&gt;;
  template &lt;&gt; struct hash&lt;u32string&gt;;
  template &lt;&gt; struct hash&lt;wstring&gt;;</ins></pre>
!     <p><ins>Specializations meeting the requirements of class template <tt>hash</tt> 20.8.15 [unord.hash].</ins></p>
  </blockquote>
  <p><i>Add the following declarations to the synopsis of <tt>&lt;vector&gt;</tt> in
  23.3 [sequences]</i> </p>
! <blockquote>
!   <pre><ins>// 21.4.x hash support
  template &lt;class T&gt; struct hash;
  template &lt;class Allocator&gt; struct hash&lt;vector&lt;bool, Allocator&gt;&gt;;</ins></pre>
  </blockquote>
! <p><i>Add a new paragraph to the end of 23.4.2 [vector.bool] </i> </p>
  <blockquote>
    <pre><ins>template &lt;class Allocator&gt; struct hash&lt;vector&lt;bool, Allocator&gt;&gt;;</ins></pre>
!     <p><ins>Specialization meeting the requirements of class template <tt>hash</tt> 20.8.15 [unord.hash].</ins></p>
  </blockquote>
! <p><i>Add the following declarations to the synopsis of <tt>&lt;bitset&gt;</tt> in 20.5 [template.bitset] </i> </p>
  <blockquote>
    <pre><ins>// [bitset.hash] hash support
  template &lt;class T&gt; struct hash;
--- 73857,73882 ----
  </blockquote>
  <p><i>Add a new clause 21.4.X </i> </p>
  <blockquote>
!   <p><ins>21.4.X Hash support [basic.string.hash]></ins></p>
    <pre><ins>template &lt;&gt; struct hash&lt;string&gt;;
  template &lt;&gt; struct hash&lt;u16string&gt;;
  template &lt;&gt; struct hash&lt;u32string&gt;;
  template &lt;&gt; struct hash&lt;wstring&gt;;</ins></pre>
!     <p><ins>Specializations meeting the requirements of class template <tt>hash</tt> 20.9.13 [unord.hash].</ins></p>
  </blockquote>
  <p><i>Add the following declarations to the synopsis of <tt>&lt;vector&gt;</tt> in
  23.3 [sequences]</i> </p>
! <blockquote><pre>
! <ins>// 21.4.x hash support
  template &lt;class T&gt; struct hash;
  template &lt;class Allocator&gt; struct hash&lt;vector&lt;bool, Allocator&gt;&gt;;</ins></pre>
  </blockquote>
! <p><i>Add a new paragraph to the end of 23.3.7 [vector.bool] </i> </p>
  <blockquote>
    <pre><ins>template &lt;class Allocator&gt; struct hash&lt;vector&lt;bool, Allocator&gt;&gt;;</ins></pre>
!     <p><ins>Specialization meeting the requirements of class template <tt>hash</tt> 20.9.13 [unord.hash].</ins></p>
  </blockquote>
! <p><i>Add the following declarations to the synopsis of <tt>&lt;bitset&gt;</tt> in 20.6 [template.bitset] </i> </p>
  <blockquote>
    <pre><ins>// [bitset.hash] hash support
  template &lt;class T&gt; struct hash;
*************** template &lt;size_t N&gt; struct hash&lt
*** 66959,66965 ****
  <blockquote>
    <p><ins>20.3.7.X bitset hash support [bitset.hash]</ins></p>
    <pre><ins>template &lt;size_t N&gt; struct hash&lt;bitset&lt;N&gt; &gt;;</ins></pre>
!     <p><ins>Specialization meeting the requirements of class template <tt>hash</tt> 20.8.15 [unord.hash].</ins></p>
  </blockquote>
  <p><i>Add the following declarations to 30.3.1.1 [thread.thread.id] synopsis just after the 
  declaration of the comparison operators: </i> </p>
--- 73886,73892 ----
  <blockquote>
    <p><ins>20.3.7.X bitset hash support [bitset.hash]</ins></p>
    <pre><ins>template &lt;size_t N&gt; struct hash&lt;bitset&lt;N&gt; &gt;;</ins></pre>
!     <p><ins>Specialization meeting the requirements of class template <tt>hash</tt> 20.9.13 [unord.hash].</ins></p>
  </blockquote>
  <p><i>Add the following declarations to 30.3.1.1 [thread.thread.id] synopsis just after the 
  declaration of the comparison operators: </i> </p>
*************** template &lt;&gt; struct hash&lt;thread:
*** 66970,66979 ****
  <p><i>Add a new paragraph at the end of 30.3.1.1 [thread.thread.id]: </i> </p>
  <blockquote>
    <pre><ins>template &lt;&gt; struct hash&lt;thread::id&gt;;</ins></pre>
!   <p><ins>Specialization meeting the requirements of class template <tt>hash</tt> 20.8.15 [unord.hash].</ins></p>
  </blockquote>
  
! <p><i>Change Header &lt;typeindex&gt; synopsis 20.13.1 [type.index.synopsis] as 
  indicated:</i></p>
  <blockquote>
  <pre>namespace std {
--- 73897,73906 ----
  <p><i>Add a new paragraph at the end of 30.3.1.1 [thread.thread.id]: </i> </p>
  <blockquote>
    <pre><ins>template &lt;&gt; struct hash&lt;thread::id&gt;;</ins></pre>
!   <p><ins>Specialization meeting the requirements of class template <tt>hash</tt> 20.9.13 [unord.hash].</ins></p>
  </blockquote>
  
! <p><i>Change Header &lt;typeindex&gt; synopsis 20.14.1 [type.index.synopsis] as 
  indicated:</i></p>
  <blockquote>
  <pre>namespace std {
*************** class type_index;
*** 67013,67034 ****
  
  <hr>
  <h3><a name="1183"></a>1183. <tt>basic_ios::set_rdbuf</tt> may break class invariants</h3>
! <p><b>Section:</b> 27.5.4.2 [basic.ios.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-07-28 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The protected member function <tt>set_rdbuf</tt> had been added during the
  process of adding move and swap semantics to IO classes. A relevant
  property of this function is described by it's effects in
! 27.5.4.2 [basic.ios.members]/19:
  </p>
  
! <blockquote>
  <i>Effects:</i> Associates the <tt>basic_streambuf</tt> object pointed to by sb with
  this stream without calling <tt>clear()</tt>.
! </blockquote>
  
  <p>
  This means that implementors of or those who derive from existing IO classes
--- 73940,73961 ----
  
  <hr>
  <h3><a name="1183"></a>1183. <tt>basic_ios::set_rdbuf</tt> may break class invariants</h3>
! <p><b>Section:</b> 27.5.5.3 [basic.ios.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-07-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.members">issues</a> in [basic.ios.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The protected member function <tt>set_rdbuf</tt> had been added during the
  process of adding move and swap semantics to IO classes. A relevant
  property of this function is described by it's effects in
! 27.5.5.3 [basic.ios.members]/19:
  </p>
  
! <blockquote><p>
  <i>Effects:</i> Associates the <tt>basic_streambuf</tt> object pointed to by sb with
  this stream without calling <tt>clear()</tt>.
! </p></blockquote>
  
  <p>
  This means that implementors of or those who derive from existing IO classes
*************** implementations which rely on the fact t
*** 67038,67051 ****
  currently only ways, i.e. either by calling
  </p>
  
! <blockquote><pre>void init(basic_streambuf&lt;charT,traits&gt;* sb);
  </pre></blockquote>
  
  <p>
  or by calling
  </p>
  
! <blockquote><pre>basic_streambuf&lt;charT,traits&gt;* rdbuf(basic_streambuf&lt;charT,traits&gt;* sb);
  </pre></blockquote>
  
  <p>
--- 73965,73980 ----
  currently only ways, i.e. either by calling
  </p>
  
! <blockquote><pre>
! void init(basic_streambuf&lt;charT,traits&gt;* sb);
  </pre></blockquote>
  
  <p>
  or by calling
  </p>
  
! <blockquote><pre>
! basic_streambuf&lt;charT,traits&gt;* rdbuf(basic_streambuf&lt;charT,traits&gt;* sb);
  </pre></blockquote>
  
  <p>
*************** set a non-0 value.
*** 67063,67073 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Open.  Martin volunteers to provide new wording, where
  <tt>set_rdbuf()</tt> sets the <tt>badbit</tt> but does not cause an
  exception to be thrown like a call to <tt>clear()</tt> would.
! </blockquote>
  
  <p><i>[
  2009-10-20 Martin provides wording:
--- 73992,74002 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Open.  Martin volunteers to provide new wording, where
  <tt>set_rdbuf()</tt> sets the <tt>badbit</tt> but does not cause an
  exception to be thrown like a call to <tt>clear()</tt> would.
! </p></blockquote>
  
  <p><i>[
  2009-10-20 Martin provides wording:
*************** exception to be thrown like a call to <t
*** 67075,67084 ****
  
  
  <p>
! Change 27.5.4.2 [basic.ios.members] around p. 19 as indicated:
  </p>
  
! <blockquote><pre>void set_rdbuf(basic_streambuf&lt;charT, traits&gt;* sb);
  </pre>
  
  <blockquote>
--- 74004,74014 ----
  
  
  <p>
! Change 27.5.5.3 [basic.ios.members] around p. 19 as indicated:
  </p>
  
! <blockquote><pre>
! void set_rdbuf(basic_streambuf&lt;charT, traits&gt;* sb);
  </pre>
  
  <blockquote>
*************** catch(ios_base::failure) {
*** 67108,67121 ****
  </blockquote>
  </blockquote>
  
! <p><b>Rationale:</b></p>
  We need to be able to call <tt>set_rdbuf()</tt> on stream objects
  for which (<tt>rdbuf() == 0</tt>) holds without causing <tt>ios_base::failure</tt> to
  be thrown. We also don't want <tt>badbit</tt> to be set as a result of
  setting <tt>rdbuf()</tt> to 0 if it wasn't set before the call. This changed
  Effects clause maintains the current behavior (as of N2914) without
  requiring that <tt>sb</tt> be non-null.
! 
  
  <p><i>[
  Post-Rapperswil
--- 74038,74051 ----
  </blockquote>
  </blockquote>
  
! <p><b>Rationale:</b></p><p>
  We need to be able to call <tt>set_rdbuf()</tt> on stream objects
  for which (<tt>rdbuf() == 0</tt>) holds without causing <tt>ios_base::failure</tt> to
  be thrown. We also don't want <tt>badbit</tt> to be set as a result of
  setting <tt>rdbuf()</tt> to 0 if it wasn't set before the call. This changed
  Effects clause maintains the current behavior (as of N2914) without
  requiring that <tt>sb</tt> be non-null.
! </p>
  
  <p><i>[
  Post-Rapperswil
*************** Several reviewers and the submitter beli
*** 67127,67135 ****
  buffer shall not be a null pointer value.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready with revised wording provided by Daniel after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 74057,74065 ----
  buffer shall not be a null pointer value.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready with revised wording provided by Daniel after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 67141,67151 ****
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>Add a new pre-condition just before 27.5.4.2 [basic.ios.members]/23 as indicated:
! <blockquote><pre>void set_rdbuf(basic_streambuf&lt;charT, traits&gt;* sb);
  </pre>
! <blockquote>
  <ins>?? <em>Requires</em>: <tt>sb != nullptr</tt>.</ins>
! <p>
  23 <em>Effects</em>: Associates the <tt>basic_streambuf</tt> object pointed to by <tt>sb</tt> with this stream without calling <tt>clear()</tt>.
  </p>
  <p>
--- 74071,74082 ----
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>Add a new pre-condition just before 27.5.4.2 [basic.ios.members]/23 as indicated:
! <blockquote><pre>
! void set_rdbuf(basic_streambuf&lt;charT, traits&gt;* sb);
  </pre>
! <blockquote><p>
  <ins>?? <em>Requires</em>: <tt>sb != nullptr</tt>.</ins>
! <p/>
  23 <em>Effects</em>: Associates the <tt>basic_streambuf</tt> object pointed to by <tt>sb</tt> with this stream without calling <tt>clear()</tt>.
  </p>
  <p>
*************** Adopted at 2010-11 Batavia
*** 67159,67177 ****
  </ol>
  
  
! <p><b>Rationale:</b></p>
  We believe that setting a <tt>nullptr</tt> stream buffer can be prevented.
  
  
  
  
  
  <hr>
! <h3><a name="1187"></a>1187. std::decay</h3>
! <p><b>Section:</b> 20.7.7.6 [meta.trans.other] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jason Merrill <b>Opened:</b> 2009-08-07 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I notice that <tt>std::decay</tt> is specified to strip the cv-quals from
--- 74090,74181 ----
  </ol>
  
  
! <p><b>Rationale:</b></p><p>
  We believe that setting a <tt>nullptr</tt> stream buffer can be prevented.
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1185"></a>1185. Iterator categories and output iterators</h3>
+ <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-07-31 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ (wording relative to
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
+ pending new working paper)
+ </p>
+ 
+ <p>
+ According to p3 24.2 [iterator.requirements], Forward iterators,
+ Bidirectional iterators and Random Access iterators all satisfy the
+ requirements for an Output iterator:
+ </p>
+ 
+ <blockquote><p>
+ XXX iterators satisfy all the requirements of the input and output iterators
+ and can be used whenever either kind is specified ...
+ </p></blockquote>
+ 
+ <p>
+ Meanwhile, p4 goes on to contradict this:
+ </p>
+ 
+ <blockquote><p>
+ Besides its category, a forward, bidirectional, or random access
+ iterator can also be mutable or constant...
+ </p></blockquote>
+ 
+ <blockquote><p>
+ ... Constant iterators do not satisfy the requirements for output iterators
+ </p></blockquote>
+ 
+ <p>
+ The latter seems to be the overriding concern, as the iterator tag
+ hierarchy does not define <tt>forward_iterator_tag</tt> as multiply derived from
+ both <tt>input_iterator_tag</tt> and <tt>output_iterator_tag</tt>.
+ </p>
+ 
+ <p>
+ The work on concepts for iterators showed us that output iterator really
+ is fundamentally a second dimension to the iterator categories, rather
+ than part of the linear input -&gt; forward -&gt; bidirectional -&gt;
+ random-access sequence.  It would be good to clear up these words to
+ reflect that, and separately list output iterator requirements in the
+ requires clauses for the appropriate algorithms and operations.
+ </p>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
  
  
  
  
  
  <hr>
! <h3><a name="1187"></a>1187. <tt>std::decay</tt></h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jason Merrill <b>Opened:</b> 2009-08-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I notice that <tt>std::decay</tt> is specified to strip the cv-quals from
*************** class type, since class rvalues can have
*** 67184,67195 ****
  ]</i></p>
  
  
! <blockquote>
  See the thread starting with c++std-lib-24568 for further discussion.  And
  here is a convenience link to the
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2069.html">original proposal</a>.
! Also see the closely related issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#705">705</a>.
! </blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to Ready.
--- 74188,74199 ----
  ]</i></p>
  
  
! <blockquote><p>
  See the thread starting with c++std-lib-24568 for further discussion.  And
  here is a convenience link to the
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2069.html">original proposal</a>.
! Also see the closely related issue <a href="lwg-defects.html#705">705</a>.
! </p></blockquote>
  
  <p><i>[
  2010 Pittsburgh:  Moved to Ready.
*************** Also see the closely related issue <a hr
*** 67201,67216 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Add a note to <tt>decay</tt> in 20.7.7.6 [meta.trans.other]:
  </p>
  
! <blockquote>
  [<i>Note:</i> This behavior is similar to the lvalue-to-rvalue (4.1),
  array-to-pointer (4.2), and function-to-pointer (4.3) conversions
  applied when an lvalue expression is used as an rvalue, but also strips
  cv-qualifiers from class types in order to more closely model by-value
! argument passing. — <i>end note</i>]
! </blockquote>
  
  
  
--- 74205,74220 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Add a note to <tt>decay</tt> in 20.10.7.6 [meta.trans.other]:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> This behavior is similar to the lvalue-to-rvalue (4.1),
  array-to-pointer (4.2), and function-to-pointer (4.3) conversions
  applied when an lvalue expression is used as an rvalue, but also strips
  cv-qualifiers from class types in order to more closely model by-value
! argument passing. &mdash; <i>end note</i>]
! </p></blockquote>
  
  
  
*************** argument passing. — <i>end note</i>]
*** 67221,67231 ****
  
  <hr>
  <h3><a name="1189"></a>1189. Awkward interface for changing the number of buckets in an unordered associative container</h3>
! <p><b>Section:</b> 23.2.5 [unord.req], 23.7 [unord] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2009-08-10 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider a typical use case: I create an <tt>unordered_map</tt> and then start
--- 74225,74235 ----
  
  <hr>
  <h3><a name="1189"></a>1189. Awkward interface for changing the number of buckets in an unordered associative container</h3>
! <p><b>Section:</b> 23.2.5 [unord.req], 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2009-08-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Consider a typical use case: I create an <tt>unordered_map</tt> and then start
*************** Unfortunately, the existing interface ma
*** 67240,67246 ****
  naturally sees the problem in terms of the number of elements, but the
  interface presents it as buckets. If <tt>m</tt> is the map and <tt>n</tt> is the expected
  number of elements, this operation is written <tt>m.rehash(n /
! m.max_load_factor())</tt> — not very novice friendly.
  </p>
  
  <p><i>[
--- 74244,74250 ----
  naturally sees the problem in terms of the number of elements, but the
  interface presents it as buckets. If <tt>m</tt> is the map and <tt>n</tt> is the expected
  number of elements, this operation is written <tt>m.rehash(n /
! m.max_load_factor())</tt> &mdash; not very novice friendly.
  </p>
  
  <p><i>[
*************** m.max_load_factor())</tt> — not very nov
*** 67248,67261 ****
  ]</i></p>
  
  
! <blockquote>
  I recommend to replace "<tt>resize</tt>" by a different name like
  "<tt>reserve</tt>", because that would better match the intended
  use-case. Rational: Any existing resize function has the on-success
  post-condition that the provided size is equal to <tt>size()</tt>, which
  is not satisfied for the proposal. Reserve seems to fit the purpose of
  the actual renaming suggestion.
! </blockquote>
  
  <p><i>[
  2009-10-28 Ganesh summarizes alternative resolutions and expresses a
--- 74252,74265 ----
  ]</i></p>
  
  
! <blockquote><p>
  I recommend to replace "<tt>resize</tt>" by a different name like
  "<tt>reserve</tt>", because that would better match the intended
  use-case. Rational: Any existing resize function has the on-success
  post-condition that the provided size is equal to <tt>size()</tt>, which
  is not satisfied for the proposal. Reserve seems to fit the purpose of
  the actual renaming suggestion.
! </p></blockquote>
  
  <p><i>[
  2009-10-28 Ganesh summarizes alternative resolutions and expresses a
*************** rehash and replace it with:
*** 67274,67283 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 87 — Unordered associative container requirements
  (in addition to container)</caption>
  
! <tbody><tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
--- 74278,74287 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 87 &mdash; Unordered associative container requirements
  (in addition to container)</caption>
  
! <tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
*************** Post: <tt>a.bucket_count &gt; <ins>max(<
*** 67293,67303 ****
  Average case linear in <tt>a.size()</tt>, worst case quadratic.
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
! Make the corresponding change in the class synopses in 23.7.1 [unord.map], 23.7.2 [unord.multimap],  23.7.3 [unord.set], and 23.7.4 [unord.multiset].
  </p>
  </li>
  <li>
--- 74297,74307 ----
  Average case linear in <tt>a.size()</tt>, worst case quadratic.
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
! Make the corresponding change in the class synopses in 23.5.4 [unord.map], 23.5.5 [unord.multimap],  23.5.6 [unord.set], and 23.5.7 [unord.multiset].
  </p>
  </li>
  <li>
*************** In 23.2.5 [unord.req]/9, table 98, appen
*** 67308,67317 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 87 — Unordered associative container requirements
  (in addition to container)</caption>
  
! <tbody><tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
--- 74312,74321 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 87 &mdash; Unordered associative container requirements
  (in addition to container)</caption>
  
! <tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
*************** Same as <tt>a.rehash(ceil(n / a.max_load
*** 67341,67358 ****
  Average case linear in <tt>a.size()</tt>, worst case quadratic.
  </ins></td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
! In 23.7.1 [unord.map]/3 in the definition of class template <tt>unordered_map</tt>, in
! 23.7.2 [unord.multimap]/3 in the definition of class template <tt>unordered_multimap</tt>, in
! 23.7.3 [unord.set]/3 in the definition of class template <tt>unordered_set</tt> and in
! 23.7.4 [unord.multiset]/3 in the definition of class template <tt>unordered_multiset</tt>, add the
  following line after member function <tt>rehash()</tt>:
  </p>
  
! <blockquote><pre>void reserve(size_type n);
  </pre></blockquote>
  
  </li>
--- 74345,74363 ----
  Average case linear in <tt>a.size()</tt>, worst case quadratic.
  </ins></td>
  </tr>
! </table>
  </blockquote>
  
  <p>
! In 23.5.4 [unord.map]/3 in the definition of class template <tt>unordered_map</tt>, in
! 23.5.5 [unord.multimap]/3 in the definition of class template <tt>unordered_multimap</tt>, in
! 23.5.6 [unord.set]/3 in the definition of class template <tt>unordered_set</tt> and in
! 23.5.7 [unord.multiset]/3 in the definition of class template <tt>unordered_multiset</tt>, add the
  following line after member function <tt>rehash()</tt>:
  </p>
  
! <blockquote><pre>
! void reserve(size_type n);
  </pre></blockquote>
  
  </li>
*************** rehash and replace it with:
*** 67384,67393 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 87 — Unordered associative container requirements
  (in addition to container)</caption>
  
! <tbody><tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
--- 74389,74398 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 87 &mdash; Unordered associative container requirements
  (in addition to container)</caption>
  
! <tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
*************** Post: <tt>a.bucket_count &gt; <ins>max(<
*** 67403,67413 ****
  Average case linear in <tt>a.size()</tt>, worst case quadratic.
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
! Make the corresponding change in the class synopses in 23.7.1 [unord.map], 23.7.2 [unord.multimap],  23.7.3 [unord.set], and 23.7.4 [unord.multiset].
  </p>
  
  </blockquote>
--- 74408,74418 ----
  Average case linear in <tt>a.size()</tt>, worst case quadratic.
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
! Make the corresponding change in the class synopses in 23.5.4 [unord.map], 23.5.5 [unord.multimap],  23.5.6 [unord.set], and 23.5.7 [unord.multiset].
  </p>
  
  </blockquote>
*************** In 23.2.5 [unord.req]/9, table 98, appen
*** 67421,67430 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 87 — Unordered associative container requirements
  (in addition to container)</caption>
  
! <tbody><tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
--- 74426,74435 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 87 &mdash; Unordered associative container requirements
  (in addition to container)</caption>
  
! <tr>
  <th>Expression</th><th>Return type</th><th>Assertion/note pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
*************** Same as <tt>a.rehash(ceil(n / a.max_load
*** 67454,67471 ****
  Average case linear in <tt>a.size()</tt>, worst case quadratic.
  </ins></td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
! In 23.7.1 [unord.map]/3 in the definition of class template <tt>unordered_map</tt>, in
! 23.7.2 [unord.multimap]/3 in the definition of class template <tt>unordered_multimap</tt>, in
! 23.7.3 [unord.set]/3 in the definition of class template <tt>unordered_set</tt> and in
! 23.7.4 [unord.multiset]/3 in the definition of class template <tt>unordered_multiset</tt>, add the
  following line after member function <tt>rehash()</tt>:
  </p>
  
! <blockquote><pre>void reserve(size_type n);
  </pre></blockquote>
  
  
--- 74459,74477 ----
  Average case linear in <tt>a.size()</tt>, worst case quadratic.
  </ins></td>
  </tr>
! </table>
  </blockquote>
  
  <p>
! In 23.5.4 [unord.map]/3 in the definition of class template <tt>unordered_map</tt>, in
! 23.5.5 [unord.multimap]/3 in the definition of class template <tt>unordered_multimap</tt>, in
! 23.5.6 [unord.set]/3 in the definition of class template <tt>unordered_set</tt> and in
! 23.5.7 [unord.multiset]/3 in the definition of class template <tt>unordered_multiset</tt>, add the
  following line after member function <tt>rehash()</tt>:
  </p>
  
! <blockquote><pre>
! void reserve(size_type n);
  </pre></blockquote>
  
  
*************** following line after member function <tt
*** 67474,67482 ****
  
  <hr>
  <h3><a name="1191"></a>1191. <tt>tuple get</tt> API should respect rvalues</h3>
! <p><b>Section:</b> 20.4.2.6 [tuple.elem] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-08-18 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>tuple get</tt> API should respect rvalues.  This would allow for moving a
--- 74480,74489 ----
  
  <hr>
  <h3><a name="1191"></a>1191. <tt>tuple get</tt> API should respect rvalues</h3>
! <p><b>Section:</b> 20.4.2.6 [tuple.elem] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-08-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.elem">issues</a> in [tuple.elem].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>tuple get</tt> API should respect rvalues.  This would allow for moving a
*************** feedback given, and it has not (yet) bee
*** 67511,67521 ****
  ]</i></p>
  
  
! <blockquote>
! Note that wording has been provided, and this issue becomes more important now that we have added a function to support forwarding argument lists as <tt>tuple</tt>s.
  
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 74518,74530 ----
  ]</i></p>
  
  
! <blockquote><p>
! Note that wording has been provided, and this issue becomes more important 
! now that we have added a function to support forwarding argument lists as 
! <tt>tuple</tt>s.
  
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** typename tuple_element&lt;I, tuple&lt;Ty
*** 67553,67566 ****
  [<i>Note:</i> If a <tt>T</tt> in <tt>Types</tt> is some reference type <tt>X&amp;</tt>,
  the return type is <tt>X&amp;</tt>, not <tt>X&amp;&amp;</tt>.
  However, if the element type is non-reference type <tt>T</tt>,
! the return type is <tt>T&amp;&amp;</tt>. — <i>end note</i>]
  </ins></p>
  
  </blockquote>
  </blockquote>
  
  <p>
! Add the following signature to p1 20.3 [utility]
  </p>
  
  <blockquote><pre><ins>
--- 74562,74575 ----
  [<i>Note:</i> If a <tt>T</tt> in <tt>Types</tt> is some reference type <tt>X&amp;</tt>,
  the return type is <tt>X&amp;</tt>, not <tt>X&amp;&amp;</tt>.
  However, if the element type is non-reference type <tt>T</tt>,
! the return type is <tt>T&amp;&amp;</tt>. &mdash; <i>end note</i>]
  </ins></p>
  
  </blockquote>
  </blockquote>
  
  <p>
! Add the following signature to p1 20.2 [utility]
  </p>
  
  <blockquote><pre><ins>
*************** typename tuple_element&lt;I, pair&lt;T1,
*** 67569,67575 ****
  </ins></pre></blockquote>
  
  <p>
! And to p5 20.3.5.4 [pair.astuple]
  </p>
  
  <blockquote><pre><ins>
--- 74578,74584 ----
  </ins></pre></blockquote>
  
  <p>
! And to p5 20.3.4 [pair.astuple]
  </p>
  
  <blockquote><pre><ins>
*************** T&amp;&amp; get(array&lt;T,N&gt; &amp;&a
*** 67601,67616 ****
  </ins></pre></blockquote>
  
  <p>
! And after p8 23.3.1.8 [array.tuple]
  </p>
  
! <blockquote><pre><ins>template &lt;size_t I, class T, size_t N&gt;
  T&amp;&amp; get(array&lt;T,N&gt; &amp;&amp; a);
  </ins></pre>
  
! <blockquote><ins>
  <i>Effects:</i> Equivalent to <tt>return std::move(get&lt;I&gt;(a));</tt>
! </ins></blockquote>
  </blockquote>
  
  
--- 74610,74626 ----
  </ins></pre></blockquote>
  
  <p>
! And after p8 23.3.2.9 [array.tuple]
  </p>
  
! <blockquote><pre>
! <ins>template &lt;size_t I, class T, size_t N&gt;
  T&amp;&amp; get(array&lt;T,N&gt; &amp;&amp; a);
  </ins></pre>
  
! <blockquote><p><ins>
  <i>Effects:</i> Equivalent to <tt>return std::move(get&lt;I&gt;(a));</tt>
! </ins></p></blockquote>
  </blockquote>
  
  
*************** T&amp;&amp; get(array&lt;T,N&gt; &amp;&a
*** 67619,67628 ****
  
  
  <hr>
! <h3><a name="1192"></a>1192. <tt>basic_string</tt> missing definitions for <tt>cbegin</tt> / <tt>cend</tt> / <tt>crbegin</tt> / <tt>crend</tt></h3>
! <p><b>Section:</b> 21.4.3 [string.iterators] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-08-14 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Unlike the containers in clause 23, <tt>basic_string</tt> has definitions for
--- 74629,74638 ----
  
  
  <hr>
! <h3><a name="1192"></a>1192. <tt>basic_string</tt> missing definitions for <tt>cbegin</tt> &#47; <tt>cend</tt> &#47; <tt>crbegin</tt> &#47; <tt>crend</tt></h3>
! <p><b>Section:</b> 21.4.3 [string.iterators] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-08-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Unlike the containers in clause 23, <tt>basic_string</tt> has definitions for
*************** Unlike the containers in clause 23, <tt>
*** 67635,67644 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively NAD after 5 positive votes on c++std-lib.  Added
  rationale.
! </blockquote>
  
  <p><i>[
  2009-10-28 Alisdair disagrees:
--- 74645,74654 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively NAD after 5 positive votes on c++std-lib.  Added
  rationale.
! </p></blockquote>
  
  <p><i>[
  2009-10-28 Alisdair disagrees:
*************** I'm going to have to speak up as the dis
*** 67654,67669 ****
  I agree the issue could be handled editorially, and that would be my
  preference if Pete feels this is appropriate. Failing that, I really
  think this issue should be accepted and moved to ready.  The other
! begin/end functions all have a semantic definition for this template,
  and it is confusing if a small few are missing.
  </p>
  
  <p>
  I agree that an alternative would be to strike <em>all</em> the definitions for
! <tt>begin/end/rbegin/rend</tt> and defer completely to the requirements tables in
  clause 23.  I think that might be confusing without a forward reference
! though, as those tables are defined in a *later* clause than the
! basic_string template itself.  If someone wants to pursue this I would
  support it, but recommend it as a separate issue.
  </p>
  
--- 74664,74679 ----
  I agree the issue could be handled editorially, and that would be my
  preference if Pete feels this is appropriate. Failing that, I really
  think this issue should be accepted and moved to ready.  The other
! begin&#47;end functions all have a semantic definition for this template,
  and it is confusing if a small few are missing.
  </p>
  
  <p>
  I agree that an alternative would be to strike <em>all</em> the definitions for
! <tt>begin&#47;end&#47;rbegin&#47;rend</tt> and defer completely to the requirements tables in
  clause 23.  I think that might be confusing without a forward reference
! though, as those tables are defined in a <em>later</em> clause than the
! <tt>basic_string</tt> template itself.  If someone wants to pursue this I would
  support it, but recommend it as a separate issue.
  </p>
  
*************** preference for NAD Editorial if Pete is
*** 67679,67688 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.  Removed
  rationale to mark it NAD.  :-)
! </blockquote>
  
  
  
--- 74689,74698 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.  Removed
  rationale to mark it NAD.  :-)
! </p></blockquote>
  
  
  
*************** rationale to mark it NAD.  :-)
*** 67691,67718 ****
  Add to 21.4.3 [string.iterators]
  </p>
  
! <blockquote><pre>iterator       begin();
  const_iterator begin() const;
  <ins>const_iterator cbegin() const;</ins>
  </pre>
  
  <p>...</p>
  
! <pre>iterator       end();
  const_iterator end() const;
  <ins>const_iterator cend() const;</ins>
  </pre>
  
  <p>...</p>
  
! <pre>reverse_iterator       rbegin();
  const_reverse_iterator rbegin() const;
  <ins>const_reverse_iterator crbegin() const;</ins>
  </pre>
  
  <p>...</p>
  
! <pre>reverse_iterator       rend();
  const_reverse_iterator rend() const;
  <ins>const_reverse_iterator crend() const;</ins>
  </pre>
--- 74701,74732 ----
  Add to 21.4.3 [string.iterators]
  </p>
  
! <blockquote><pre>
! iterator       begin();
  const_iterator begin() const;
  <ins>const_iterator cbegin() const;</ins>
  </pre>
  
  <p>...</p>
  
! <pre>
! iterator       end();
  const_iterator end() const;
  <ins>const_iterator cend() const;</ins>
  </pre>
  
  <p>...</p>
  
! <pre>
! reverse_iterator       rbegin();
  const_reverse_iterator rbegin() const;
  <ins>const_reverse_iterator crbegin() const;</ins>
  </pre>
  
  <p>...</p>
  
! <pre>
! reverse_iterator       rend();
  const_reverse_iterator rend() const;
  <ins>const_reverse_iterator crend() const;</ins>
  </pre>
*************** const_reverse_iterator rend() const;
*** 67724,67742 ****
  
  
  <hr>
! <h3><a name="1193"></a>1193. <tt>default_delete</tt> cannot be instantiated with  incomplete types</h3>
! <p><b>Section:</b> 20.9.9.1 [unique.ptr.dltr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-08-18 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! According to the general rules of 17.6.3.8 [res.on.functions]/2 b 5 the effects
  are undefined, if an incomplete type is used to instantiate a library template. But neither in
! 20.9.9.1 [unique.ptr.dltr] nor
  in any other place of the standard such explicit allowance is given.
  Since this template is intended to be instantiated with incomplete
! types, this must
! be fixed.
  </p>
  
  <p><i>[
--- 74738,74755 ----
  
  
  <hr>
! <h3><a name="1193"></a>1193. <tt>default_delete</tt> cannot be instantiated with incomplete types</h3>
! <p><b>Section:</b> 20.8.1.1 [unique.ptr.dltr] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-08-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! According to the general rules of 17.6.4.8 [res.on.functions] p 2 b 5 the effects
  are undefined, if an incomplete type is used to instantiate a library template. But neither in
! 20.8.1.1 [unique.ptr.dltr] nor
  in any other place of the standard such explicit allowance is given.
  Since this template is intended to be instantiated with incomplete
! types, this must be fixed.
  </p>
  
  <p><i>[
*************** be fixed.
*** 67751,67773 ****
  
  <blockquote>
  <p>
! LWG 1193 tries to support unique_ptr for incomplete types.  I believe the
  proposed wording goes too far:
  </p>
  
! <blockquote>
  The template parameter <tt>T</tt> of <tt>default_delete</tt> may be an
  incomplete type.
! </blockquote>
  
  <p>
  Do we really want to support <tt>cv-void</tt>?  Suggested ammendment:
  </p>
  
! <blockquote>
  The template parameter <tt>T</tt> of <tt>default_delete</tt> may be an
  incomplete type <ins>other than <tt>cv-void</tt></ins>.
! </blockquote>
  
  <p>
  We might also consider saying something about arrays of incomplete types.
--- 74764,74786 ----
  
  <blockquote>
  <p>
! LWG 1193 tries to support <tt>unique_ptr</tt> for incomplete types.  I believe the
  proposed wording goes too far:
  </p>
  
! <blockquote><p>
  The template parameter <tt>T</tt> of <tt>default_delete</tt> may be an
  incomplete type.
! </p></blockquote>
  
  <p>
  Do we really want to support <tt>cv-void</tt>?  Suggested ammendment:
  </p>
  
! <blockquote><p>
  The template parameter <tt>T</tt> of <tt>default_delete</tt> may be an
  incomplete type <ins>other than <tt>cv-void</tt></ins>.
! </p></blockquote>
  
  <p>
  We might also consider saying something about arrays of incomplete types.
*************** too.
*** 67801,67808 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add two new paragraphs directly to 20.9.9.1 [unique.ptr.dltr] (before
! 20.9.9.1.2 [unique.ptr.dltr.dflt]) with the following
  content:
  </p>
  
--- 74814,74821 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add two new paragraphs directly to 20.8.1.1 [unique.ptr.dltr] (before
! 20.8.1.1.2 [unique.ptr.dltr.dflt]) with the following
  content:
  </p>
  
*************** The template parameter <tt>T</tt> of <tt
*** 67823,67845 ****
  
  <hr>
  <h3><a name="1194"></a>1194. Unintended <tt>queue</tt> constructor</h3>
! <p><b>Section:</b> 23.5 [container.adaptors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-08-20 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 23.5.1.1 [queue.defn] has the following <tt>queue</tt> constructor:
  </p>
  
! <blockquote><pre>template &lt;class Alloc&gt; explicit queue(const Alloc&amp;);
  </pre></blockquote>
  
  <p>
  This will be implemented like so:
  </p>
  
! <blockquote><pre>template &lt;class Alloc&gt; explicit queue(const Alloc&amp; a) : c(a) {}
  </pre></blockquote>
  
  <p>
--- 74836,74860 ----
  
  <hr>
  <h3><a name="1194"></a>1194. Unintended <tt>queue</tt> constructor</h3>
! <p><b>Section:</b> 23.6 [container.adaptors] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-08-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 23.6.3.1 [queue.defn] has the following <tt>queue</tt> constructor:
  </p>
  
! <blockquote><pre>
! template &lt;class Alloc&gt; explicit queue(const Alloc&amp;);
  </pre></blockquote>
  
  <p>
  This will be implemented like so:
  </p>
  
! <blockquote><pre>
! template &lt;class Alloc&gt; explicit queue(const Alloc&amp; a) : c(a) {}
  </pre></blockquote>
  
  <p>
*************** The issue is that <tt>Alloc</tt> can be
*** 67847,67853 ****
  from, for example an <tt>int</tt>.  Is this intended to compile?
  </p>
  
! <blockquote><pre>queue&lt;int&gt; q(5);
  </pre></blockquote>
  
  <p>
--- 74862,74869 ----
  from, for example an <tt>int</tt>.  Is this intended to compile?
  </p>
  
! <blockquote><pre>
! queue&lt;int&gt; q(5);
  </pre></blockquote>
  
  <p>
*************** Daniel, Howard and Pablo collaborated on
*** 67873,67881 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 74889,74897 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Move to Ready.
*** 67884,67891 ****
  <p><i>[
  This resolution includes a semi-editorial clean up, giving definitions to members
  which in some cases weren't defined since C++98.
! This resolution also offers editorially different wording for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#976">976</a>,
! and it also provides wording for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1196">1196</a>.
  ]</i></p>
  
  
--- 74900,74907 ----
  <p><i>[
  This resolution includes a semi-editorial clean up, giving definitions to members
  which in some cases weren't defined since C++98.
! This resolution also offers editorially different wording for <a href="lwg-defects.html#976">976</a>,
! and it also provides wording for <a href="lwg-defects.html#1196">1196</a>.
  ]</i></p>
  
  
*************** and it also provides wording for <a href
*** 67893,67899 ****
  Change  container.adaptors, p1:
  </p>
  
! <blockquote>
  The container adaptors each take a <tt>Container</tt> template parameter, and
  each constructor takes a <tt>Container</tt> reference argument. This container is
  copied into the <tt>Container</tt> member of each adaptor. If the container takes
--- 74909,74915 ----
  Change  container.adaptors, p1:
  </p>
  
! <blockquote><p>
  The container adaptors each take a <tt>Container</tt> template parameter, and
  each constructor takes a <tt>Container</tt> reference argument. This container is
  copied into the <tt>Container</tt> member of each adaptor. If the container takes
*************** used for the container argument. <del>[<
*** 67903,67916 ****
  implementation to distinguish between the one-argument constructor that
  takes a <tt>Container</tt> and the one- argument constructor that takes an
  allocator_type. Both forms use their argument to construct an instance
! of the container. — <i>end note</i>]</del>
! </blockquote>
  
  <p>
  Change  queue.defn, p1:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container = deque&lt;T&gt; &gt;
  class queue {
  public:
    typedef typename Container::value_type      value_type;
--- 74919,74933 ----
  implementation to distinguish between the one-argument constructor that
  takes a <tt>Container</tt> and the one- argument constructor that takes an
  allocator_type. Both forms use their argument to construct an instance
! of the container. &mdash; <i>end note</i>]</del>
! </p></blockquote>
  
  <p>
  Change  queue.defn, p1:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container = deque&lt;T&gt; &gt;
  class queue {
  public:
    typedef typename Container::value_type      value_type;
*************** public:
*** 67937,67949 ****
  </pre></blockquote>
  
  <p>
! Add a new section after 23.5.1.1 [queue.defn], [queue.cons]:
  </p>
  
  <blockquote>
  <p><b><tt>queue</tt> constructors [queue.cons]</b></p>
  
! <pre>explicit queue(const Container&amp; cont);
  </pre>
  
  <blockquote>
--- 74954,74967 ----
  </pre></blockquote>
  
  <p>
! Add a new section after 23.6.3.1 [queue.defn], [queue.cons]:
  </p>
  
  <blockquote>
  <p><b><tt>queue</tt> constructors [queue.cons]</b></p>
  
! <pre>
! explicit queue(const Container&amp; cont);
  </pre>
  
  <blockquote>
*************** Add a new section after 23.5.1.1 [queue.
*** 67954,67960 ****
  
  </blockquote>
  
! <pre>explicit queue(Container&amp;&amp; cont = Container());
  </pre>
  
  <blockquote>
--- 74972,74979 ----
  
  </blockquote>
  
! <pre>
! explicit queue(Container&amp;&amp; cont = Container());
  </pre>
  
  <blockquote>
*************** Add a new section after 23.5.1.1 [queue.
*** 67965,67971 ****
  
  </blockquote>
  
! <pre>queue(queue&amp;&amp; q)
  </pre>
  
  <blockquote>
--- 74984,74991 ----
  
  </blockquote>
  
! <pre>
! queue(queue&amp;&amp; q)
  </pre>
  
  <blockquote>
*************** if <tt>uses_allocator&lt;container_type,
*** 67982,67988 ****
  then the constructor shall not participate in overload resolution.
  </p>
  
! <pre>template &lt;class Alloc&gt; 
    explicit queue(const Alloc&amp; a);
  </pre>
  
--- 75002,75009 ----
  then the constructor shall not participate in overload resolution.
  </p>
  
! <pre>
! template &lt;class Alloc&gt; 
    explicit queue(const Alloc&amp; a);
  </pre>
  
*************** then the constructor shall not participa
*** 67994,68000 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt; 
    queue(const container_type&amp; cont, const Alloc&amp; a);
  </pre>
  
--- 75015,75022 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt; 
    queue(const container_type&amp; cont, const Alloc&amp; a);
  </pre>
  
*************** argument and <tt>a</tt> as the second ar
*** 68007,68013 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt; 
    queue(container_type&amp;&amp; cont, const Alloc&amp; a);
  </pre>
  
--- 75029,75036 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt; 
    queue(container_type&amp;&amp; cont, const Alloc&amp; a);
  </pre>
  
*************** first argument and <tt>a</tt> as the sec
*** 68020,68026 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt; 
    queue(queue&amp;&amp; q, const Alloc&amp; a);
  </pre>
  
--- 75043,75050 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt; 
    queue(queue&amp;&amp; q, const Alloc&amp; a);
  </pre>
  
*************** first argument and <tt>a</tt> as the sec
*** 68033,68039 ****
  
  </blockquote>
  
! <pre>queue&amp; operator=(queue&amp;&amp; q);
  </pre>
  
  <blockquote>
--- 75057,75064 ----
  
  </blockquote>
  
! <pre>
! queue&amp; operator=(queue&amp;&amp; q);
  </pre>
  
  <blockquote>
*************** first argument and <tt>a</tt> as the sec
*** 68053,68064 ****
  </blockquote>
  
  <p>
! Add to 23.5.2.1 [priqueue.cons]:
  </p>
  
  <blockquote>
  
! <pre>priority_queue(priority_queue&amp;&amp; q);
  </pre>
  
  <blockquote>
--- 75078,75090 ----
  </blockquote>
  
  <p>
! Add to 23.6.4.1 [priqueue.cons]:
  </p>
  
  <blockquote>
  
! <pre>
! priority_queue(priority_queue&amp;&amp; q);
  </pre>
  
  <blockquote>
*************** if <tt>uses_allocator&lt;container_type,
*** 68076,68082 ****
  then the constructor shall not participate in overload resolution.
  </p>
  
! <pre>template &lt;class Alloc&gt;
    explicit priority_queue(const Alloc&amp; a);
  </pre>
  
--- 75102,75109 ----
  then the constructor shall not participate in overload resolution.
  </p>
  
! <pre>
! template &lt;class Alloc&gt;
    explicit priority_queue(const Alloc&amp; a);
  </pre>
  
*************** then the constructor shall not participa
*** 68088,68094 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt;
    priority_queue(const Compare&amp; compare, const Alloc&amp; a);
  </pre>
  
--- 75115,75122 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt;
    priority_queue(const Compare&amp; compare, const Alloc&amp; a);
  </pre>
  
*************** with <tt>compare</tt>.
*** 68101,68107 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt;
    priority_queue(const Compare&amp; compare, const Container&amp; cont, const Alloc&amp; a);
  </pre>
  
--- 75129,75136 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt;
    priority_queue(const Compare&amp; compare, const Container&amp; cont, const Alloc&amp; a);
  </pre>
  
*************** and initializes <tt>comp</tt> with <tt>c
*** 68115,68121 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt;
    priority_queue(const Compare&amp; compare, Container&amp;&amp; cont, const Alloc&amp; a);
  </pre>
  
--- 75144,75151 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt;
    priority_queue(const Compare&amp; compare, Container&amp;&amp; cont, const Alloc&amp; a);
  </pre>
  
*************** and initializes <tt>comp</tt> with <tt>c
*** 68129,68135 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt;
    priority_queue(priority_queue&amp;&amp; q, const Alloc&amp; a);
  </pre>
  
--- 75159,75166 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt;
    priority_queue(priority_queue&amp;&amp; q, const Alloc&amp; a);
  </pre>
  
*************** and initializes <tt>comp</tt> with <tt>s
*** 68143,68149 ****
  
  </blockquote>
  
! <pre>priority_queue&amp; operator=(priority_queue&amp;&amp; q);
  </pre>
  
  <blockquote>
--- 75174,75181 ----
  
  </blockquote>
  
! <pre>
! priority_queue&amp; operator=(priority_queue&amp;&amp; q);
  </pre>
  
  <blockquote>
*************** assigns <tt>comp</tt> with <tt>std::move
*** 68165,68174 ****
  
  
  <p>
! Change 23.5.3.1 [stack.defn]:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container = deque&lt;T&gt; &gt;
  class stack {
  public:
    typedef typename Container::value_type      value_type;
--- 75197,75207 ----
  
  
  <p>
! Change 23.6.5.2 [stack.defn]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container = deque&lt;T&gt; &gt;
  class stack {
  public:
    typedef typename Container::value_type      value_type;
*************** public:
*** 68195,68207 ****
  </pre></blockquote>
  
  <p>
! Add a new section after 23.5.3.1 [stack.defn], [stack.cons]:
  </p>
  
  <blockquote>
  <p><b><tt>stack</tt> constructors [stack.cons]</b></p>
  
! <pre>stack(stack&amp;&amp; s);
  </pre>
  
  <blockquote>
--- 75228,75241 ----
  </pre></blockquote>
  
  <p>
! Add a new section after 23.6.5.2 [stack.defn], [stack.cons]:
  </p>
  
  <blockquote>
  <p><b><tt>stack</tt> constructors [stack.cons]</b></p>
  
! <pre>
! stack(stack&amp;&amp; s);
  </pre>
  
  <blockquote>
*************** if <tt>uses_allocator&lt;container_type,
*** 68218,68224 ****
  then the constructor shall not participate in overload resolution.
  </p>
  
! <pre>template &lt;class Alloc&gt; 
    explicit stack(const Alloc&amp; a);
  </pre>
  
--- 75252,75259 ----
  then the constructor shall not participate in overload resolution.
  </p>
  
! <pre>
! template &lt;class Alloc&gt; 
    explicit stack(const Alloc&amp; a);
  </pre>
  
*************** then the constructor shall not participa
*** 68230,68236 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt; 
    stack(const container_type&amp; cont, const Alloc&amp; a);
  </pre>
  
--- 75265,75272 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt; 
    stack(const container_type&amp; cont, const Alloc&amp; a);
  </pre>
  
*************** first argument and <tt>a</tt> as the sec
*** 68243,68249 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt; 
    stack(container_type&amp;&amp; cont, const Alloc&amp; a);
  </pre>
  
--- 75279,75286 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt; 
    stack(container_type&amp;&amp; cont, const Alloc&amp; a);
  </pre>
  
*************** first argument and <tt>a</tt> as the sec
*** 68256,68262 ****
  
  </blockquote>
  
! <pre>template &lt;class Alloc&gt; 
    stack(stack&amp;&amp; s, const Alloc&amp; a);
  </pre>
  
--- 75293,75300 ----
  
  </blockquote>
  
! <pre>
! template &lt;class Alloc&gt; 
    stack(stack&amp;&amp; s, const Alloc&amp; a);
  </pre>
  
*************** first argument and <tt>a</tt> as the sec
*** 68269,68275 ****
  
  </blockquote>
  
! <pre>stack&amp; operator=(stack&amp;&amp; s);
  </pre>
  
  <blockquote>
--- 75307,75314 ----
  
  </blockquote>
  
! <pre>
! stack&amp; operator=(stack&amp;&amp; s);
  </pre>
  
  <blockquote>
*************** first argument and <tt>a</tt> as the sec
*** 68293,68342 ****
  
  <hr>
  <h3><a name="1195"></a>1195. "Diagnostic required" wording is insufficient to  prevent UB</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-08-18 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Several parts of the library use the notion of "Diagnostic required"
  to indicate that
  in the corresponding situation an error diagnostic should occur, e.g.
! 20.9.9.1.2 [unique.ptr.dltr.dflt]/2
  </p>
! <blockquote><pre>void operator()(T *ptr) const;
  </pre>
  
! <blockquote>
  <i>Effects:</i> calls <tt>delete</tt> on <tt>ptr</tt>. A diagnostic is required if <tt>T</tt> is an
  incomplete type.
! </blockquote>
  </blockquote>
  
  <p>
  The problem with this approach is that such a requirement is
! insufficient to prevent
! undefined behavior, if this situation occurs. According to 1.3.6 [defns.diagnostic]
  a <i>diagnostic message</i> is defined as
  </p>
  
! <blockquote>
  a message belonging to an implementation-defined subset of the
  implementation's output messages.
! </blockquote>
  
  <p>
  which doesn't indicate any relation to an ill-formed program. In fact,
! "compiler warnings"
! are a typical expression of such diagnostics. This means that above
! wording can be interpreted
! by compiler writers that they satisfy the requirements of the standard
! if they just produce
! such a "warning", if the compiler happens to compile code like this:
  </p>
  
! <blockquote><pre>#include &lt;memory&gt;
  
  struct Ukn; // defined somewhere else
  Ukn* create_ukn(); // defined somewhere else
--- 75332,75381 ----
  
  <hr>
  <h3><a name="1195"></a>1195. "Diagnostic required" wording is insufficient to  prevent UB</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-08-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Several parts of the library use the notion of "Diagnostic required"
  to indicate that
  in the corresponding situation an error diagnostic should occur, e.g.
! 20.8.1.1.2 [unique.ptr.dltr.dflt]/2
  </p>
! <blockquote><pre>
! void operator()(T *ptr) const;
  </pre>
  
! <blockquote><p>
  <i>Effects:</i> calls <tt>delete</tt> on <tt>ptr</tt>. A diagnostic is required if <tt>T</tt> is an
  incomplete type.
! </p></blockquote>
  </blockquote>
  
  <p>
  The problem with this approach is that such a requirement is
! insufficient to prevent undefined behavior, if this situation occurs. 
! According to 1.3 [defns.diagnostic]
  a <i>diagnostic message</i> is defined as
  </p>
  
! <blockquote><p>
  a message belonging to an implementation-defined subset of the
  implementation's output messages.
! </p></blockquote>
  
  <p>
  which doesn't indicate any relation to an ill-formed program. In fact,
! "compiler warnings" are a typical expression of such diagnostics. This means 
! that above wording can be interpreted by compiler writers that they satisfy 
! the requirements of the standard if they just produce such a "warning", if 
! the compiler happens to compile code like this:
  </p>
  
! <blockquote><pre>
! #include &lt;memory&gt;
  
  struct Ukn; // defined somewhere else
  Ukn* create_ukn(); // defined somewhere else
*************** Move to NAD.
*** 68373,68382 ****
  </p>
  <p>
  It's not clear that there's any important difference between
! "ill-formed" and "diagnostic required". From 1.4 [intro.compliance], 1.3.9 [defns.ill.formed], and 1.3.26 [defns.well.formed] it appears that an ill-formed program is one
! that is not correctly constructed according to the syntax rules and
! diagnosable semantic rules, which means that... "a conforming
! implementation shall issue at least one diagnostic message." The
  author's intent seems to be that we should be requiring a fatal error
  instead of a mere warning, but the standard just doesn't have language
  to express that distinction. The strongest thing we can ever require is
--- 75412,75422 ----
  </p>
  <p>
  It's not clear that there's any important difference between
! "ill-formed" and "diagnostic required". From 1.4 [intro.compliance], 
! 1.3 [defns.ill.formed], and 1.3 [defns.well.formed] 
! it appears that an ill-formed program is one that is not correctly constructed 
! according to the syntax rules and diagnosable semantic rules, which means 
! that... "a conforming implementation shall issue at least one diagnostic message." The
  author's intent seems to be that we should be requiring a fatal error
  instead of a mere warning, but the standard just doesn't have language
  to express that distinction. The strongest thing we can ever require is
*************** that the WP already says, but such a rew
*** 68393,68402 ****
  ]</i></p>
  
  
! <blockquote>
  Considered again.  Group disagrees that the change is technical, but likes
  it editorially.  Moved to NAD Editorial.
! </blockquote>
  
  <p><i>[
  2009-11-19: Moved from NAD Editorial to Open.  Please see the thread starting
--- 75433,75442 ----
  ]</i></p>
  
  
! <blockquote><p>
  Considered again.  Group disagrees that the change is technical, but likes
  it editorially.  Moved to NAD Editorial.
! </p></blockquote>
  
  <p><i>[
  2009-11-19: Moved from NAD Editorial to Open.  Please see the thread starting
*************** any violation would make the program ill
*** 68423,68440 ****
  existing phrase 20.4.2.5 [tuple.helper]/1
  </p>
  
! <blockquote>
  <i>Requires:</i> <tt>I &lt; sizeof...(Types)</tt>. The program is ill-formed if
  <tt>I</tt> is out of bounds.
! </blockquote>
  
  <p>
  could then be written as
  </p>
  
! <blockquote>
  <i>Static constraints:</i> <tt>I &lt; sizeof...(Types)</tt>.
! </blockquote>
  
  </blockquote>
  
--- 75463,75480 ----
  existing phrase 20.4.2.5 [tuple.helper]/1
  </p>
  
! <blockquote><p>
  <i>Requires:</i> <tt>I &lt; sizeof...(Types)</tt>. The program is ill-formed if
  <tt>I</tt> is out of bounds.
! </p></blockquote>
  
  <p>
  could then be written as
  </p>
  
! <blockquote><p>
  <i>Static constraints:</i> <tt>I &lt; sizeof...(Types)</tt>.
! </p></blockquote>
  
  </blockquote>
  
*************** could then be written as
*** 68454,68473 ****
  <ol>
  <li>
  <p>
! Change 20.6 [ratio]/2 as indicated:
  </p>
  
! <blockquote>
  Throughout this subclause, <ins>if</ins> the template argument types <tt>R1</tt>
  and <tt>R2</tt> <del>shall be</del> <ins>are not</ins> specializations of the
  <tt>ratio</tt> template<ins>, the program is ill-formed</ins>. <del>Diagnostic
  required.</del>
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.6.1 [ratio.ratio]/1 as indicated:
  </p>
  
  <p>
--- 75494,75513 ----
  <ol>
  <li>
  <p>
! Change 20.11 [ratio]/2 as indicated:
  </p>
  
! <blockquote><p>
  Throughout this subclause, <ins>if</ins> the template argument types <tt>R1</tt>
  and <tt>R2</tt> <del>shall be</del> <ins>are not</ins> specializations of the
  <tt>ratio</tt> template<ins>, the program is ill-formed</ins>. <del>Diagnostic
  required.</del>
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.11.3 [ratio.ratio]/1 as indicated:
  </p>
  
  <p>
*************** ill-formed</ins>. <del>Diagnostic requir
*** 68482,68514 ****
  
  <li>
  <p>
! Change 20.6.2 [ratio.arithmetic]/1 as indicated:
  </p>
  
! <blockquote>
  Implementations may use other algorithms to compute these values. If overflow
  occurs, <ins>the program is ill-formed</ins> <del>a diagnostic shall be
  issued</del>.
! </blockquote>
  
  </li>
  
  <li>
  <p>
! Change 20.6.3 [ratio.comparison]/2 as indicated:
  </p>
  
! <blockquote>
  [...] Implementations may use other algorithms to compute this relationship to
  avoid overflow. If overflow occurs, <ins>the program is ill-formed</ins> <del>a
  diagnostic is required</del>.
! </blockquote>
  
  </li>
  
  <li>
  <p>
! Change 20.9.9.1.2 [unique.ptr.dltr.dflt]/2 as indicated:
  </p>
  
  <blockquote>
--- 75522,75554 ----
  
  <li>
  <p>
! Change 20.11.4 [ratio.arithmetic]/1 as indicated:
  </p>
  
! <blockquote><p>
  Implementations may use other algorithms to compute these values. If overflow
  occurs, <ins>the program is ill-formed</ins> <del>a diagnostic shall be
  issued</del>.
! </p></blockquote>
  
  </li>
  
  <li>
  <p>
! Change 20.11.5 [ratio.comparison]/2 as indicated:
  </p>
  
! <blockquote><p>
  [...] Implementations may use other algorithms to compute this relationship to
  avoid overflow. If overflow occurs, <ins>the program is ill-formed</ins> <del>a
  diagnostic is required</del>.
! </p></blockquote>
  
  </li>
  
  <li>
  <p>
! Change 20.8.1.1.2 [unique.ptr.dltr.dflt]/2 as indicated:
  </p>
  
  <blockquote>
*************** ill-formed.</ins>
*** 68527,68536 ****
  
  <li>
  <p>
! Change 20.9.9.1.3 [unique.ptr.dltr.dflt1]/1 as indicated:
  </p>
  
! <blockquote><pre>void operator()(T* ptr) const;
  </pre>
  <blockquote>
  <p>
--- 75567,75577 ----
  
  <li>
  <p>
! Change 20.8.1.1.3 [unique.ptr.dltr.dflt1]/1 as indicated:
  </p>
  
! <blockquote><pre>
! void operator()(T* ptr) const;
  </pre>
  <blockquote>
  <p>
*************** ill-formed.</ins>
*** 68549,68565 ****
  
  <li>
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor] as indicated: <i>[Note: This
! editorially improves the currently suggested wording of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a> by
  replacing</i>
  </p>
! <blockquote>
  <i>"shall be ill-formed" by "is ill-formed"]</i>
! </blockquote>
  
  <p>
  <i>[If
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3025.html">N3025</a>
  is accepted this bullet is applied identically in that paper as well.]</i>
  </p>
  
--- 75590,75606 ----
  
  <li>
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor] as indicated: <i>[Note: This
! editorially improves the currently suggested wording of <a href="lwg-defects.html#932">932</a> by
  replacing</i>
  </p>
! <blockquote><p>
  <i>"shall be ill-formed" by "is ill-formed"]</i>
! </p></blockquote>
  
  <p>
  <i>[If
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3025.html">N3025</a>
  is accepted this bullet is applied identically in that paper as well.]</i>
  </p>
  
*************** ill-formed.
*** 68583,68603 ****
  
  <li>
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor]/8 as indicated: <i>[Note: This
! editorially improves the currently suggested wording of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#932">932</a> by
  replacing</i>
  </p>
! <blockquote>
  <i>"shall be ill-formed" by "is ill-formed"]</i>
! </blockquote>
  
  <p>
  <i>[If
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3025.html">N3025</a>
  is accepted this bullet is applied identically in that paper as well.]</i>
  </p>
  
! <blockquote><pre>unique_ptr(pointer p);
  </pre>
  <blockquote>
  <p>...</p>
--- 75624,75645 ----
  
  <li>
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor]/8 as indicated: <i>[Note: This
! editorially improves the currently suggested wording of <a href="lwg-defects.html#932">932</a> by
  replacing</i>
  </p>
! <blockquote><p>
  <i>"shall be ill-formed" by "is ill-formed"]</i>
! </p></blockquote>
  
  <p>
  <i>[If
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3025.html">N3025</a>
  is accepted this bullet is applied identically in that paper as well.]</i>
  </p>
  
! <blockquote><pre>
! unique_ptr(pointer p);
  </pre>
  <blockquote>
  <p>...</p>
*************** ill-formed.
*** 68613,68639 ****
  
  <li>
  <p>
! Change 20.9.9.2.1 [unique.ptr.single.ctor]/13 as indicated:
  </p>
  
! <blockquote>
  [..] If <tt>d</tt> is an rvalue, it will bind to the second constructor of this
  pair <ins>and the program is ill-formed</ins>. <del>That constructor shall emit
  a diagnostic.</del> [<i>Note:</i> The diagnostic could be implemented using a
  <tt>static_assert</tt> which assures that <tt>D</tt> is not a reference type.
! — <i>end note</i>] Else <tt>d</tt> is an lvalue and will bind to the first
  constructor of this pair. [..]
! </blockquote>
  
  </li>
  
  <li>
! 20.9.9.2.1 [unique.ptr.single.ctor]/20: Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#950">950</a>.
  </li>
  
  <li>
  <p>
! Change 20.9.9.3 [unique.ptr.runtime]/1 as indicated:
  </p>
  
  <blockquote>
--- 75655,75681 ----
  
  <li>
  <p>
! Change 20.8.1.2.1 [unique.ptr.single.ctor]/13 as indicated:
  </p>
  
! <blockquote><p>
  [..] If <tt>d</tt> is an rvalue, it will bind to the second constructor of this
  pair <ins>and the program is ill-formed</ins>. <del>That constructor shall emit
  a diagnostic.</del> [<i>Note:</i> The diagnostic could be implemented using a
  <tt>static_assert</tt> which assures that <tt>D</tt> is not a reference type.
! &mdash; <i>end note</i>] Else <tt>d</tt> is an lvalue and will bind to the first
  constructor of this pair. [..]
! </p></blockquote>
  
  </li>
  
  <li>
! 20.8.1.2.1 [unique.ptr.single.ctor]/20: Solved by <a href="lwg-defects.html#950">950</a>.
  </li>
  
  <li>
  <p>
! Change 20.8.1.3 [unique.ptr.runtime]/1 as indicated:
  </p>
  
  <blockquote>
*************** required)</del> <ins>produce an ill-form
*** 68654,68660 ****
  
  <li>
  <p>
! Change 20.11.3 [time.duration]/2-4 as indicated:
  </p>
  
  <blockquote>
--- 75696,75702 ----
  
  <li>
  <p>
! Change 20.12.5 [time.duration]/2-4 as indicated:
  </p>
  
  <blockquote>
*************** positive, <del>diagnostic required</del>
*** 68687,68720 ****
  </li>
  
  <li>
! 20.11.3.1 [time.duration.cons]/1+4: Apply <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>
  </li>
  
  <li>
! 20.11.3.5 [time.duration.nonmember]/4+6+8+11: Apply <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>
  </li>
  
  <li>
! 20.11.3.7 [time.duration.cast]/1: Apply <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>
  </li>
  
  <li>
  <p>
! Change 20.11.4 [time.point]/2 as indicated:
  </p>
! <blockquote>
  <ins>If</ins> <tt>Duration</tt> <del>shall be</del> <ins>is not</ins> an
  instance of <tt>duration</tt><ins>, the program is ill-formed</ins>.
  <del>Diagnostic required.</del>
! </blockquote>
  </li>
  
  <li>
! 20.11.4.1 [time.point.cons]/3: Apply <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>
  </li>
  
  <li>
! 20.11.4.7 [time.point.cast]/1: Apply <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1177">1177</a>
  </li>
  
  </ol>
--- 75729,75762 ----
  </li>
  
  <li>
! 20.12.5.1 [time.duration.cons]/1+4: Apply <a href="lwg-defects.html#1177">1177</a>
  </li>
  
  <li>
! 20.12.5.5 [time.duration.nonmember]/4+6+8+11: Apply <a href="lwg-defects.html#1177">1177</a>
  </li>
  
  <li>
! 20.12.5.7 [time.duration.cast]/1: Apply <a href="lwg-defects.html#1177">1177</a>
  </li>
  
  <li>
  <p>
! Change 20.12.6 [time.point]/2 as indicated:
  </p>
! <blockquote><p>
  <ins>If</ins> <tt>Duration</tt> <del>shall be</del> <ins>is not</ins> an
  instance of <tt>duration</tt><ins>, the program is ill-formed</ins>.
  <del>Diagnostic required.</del>
! </p></blockquote>
  </li>
  
  <li>
! 20.12.6.1 [time.point.cons]/3: Apply <a href="lwg-defects.html#1177">1177</a>
  </li>
  
  <li>
! 20.12.6.7 [time.point.cast]/1: Apply <a href="lwg-defects.html#1177">1177</a>
  </li>
  
  </ol>
*************** instance of <tt>duration</tt><ins>, the
*** 68725,68736 ****
  
  
  <hr>
  <h3><a name="1197"></a>1197. Can unordered containers have <tt>bucket_count() == 0</tt>?</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-08-24 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 97 "Unordered associative container requirements" in
--- 75767,75818 ----
  
  
  <hr>
+ <h3><a name="1196"></a>1196. move semantics undefined for priority_queue</h3>
+ <p><b>Section:</b> 23.6.4.1 [priqueue.cons] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-08-19 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The class template <tt>priority_queue</tt> declares signatures for a move
+ constructor and move assignment operator in its class definition.
+ However, it does not provide a definition (unlike <tt>std::queue</tt>, and
+ proposed resolution for <tt>std::stack</tt>.) Nor does it provide a text clause
+ specifying their behaviour.
+ </p>
+ 
+ <p><i>[
+ 2009-08-23 Daniel adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <a href="lwg-defects.html#1194">1194</a> provides wording that solves this issue.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Mark <del>NAD Editorial</del><ins>Resolved</ins>, solved by issue <a href="lwg-defects.html#1194">1194</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1197"></a>1197. Can unordered containers have <tt>bucket_count() == 0</tt>?</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-08-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Table 97 "Unordered associative container requirements" in
*************** Table 97 "Unordered associative containe
*** 68739,68748 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 97 — Unordered associative container requirements
  (in addition to container)</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Assertion/note pre-/post-condition</th>
--- 75821,75830 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 97 &mdash; Unordered associative container requirements
  (in addition to container)</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Assertion/note pre-/post-condition</th>
*************** b.bucket_count())</tt>.</td>
*** 68761,68767 ****
  <td>Constant</td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  <p>
--- 75843,75849 ----
  <td>Constant</td>
  </tr>
  
! </table>
  </blockquote>
  
  <p>
*************** and consistent, it has exactly the same
*** 68828,68834 ****
  iterator value. A typical use-case is:
  </p>
  
! <blockquote><pre>size_type pos = m.bucket(key);
  if (pos != m.bucket_count()) {
   ...
  } else {
--- 75910,75917 ----
  iterator value. A typical use-case is:
  </p>
  
! <blockquote><pre>
! size_type pos = m.bucket(key);
  if (pos != m.bucket_count()) {
   ...
  } else {
*************** if (pos != m.bucket_count()) {
*** 68836,68842 ****
  }
  </pre></blockquote>
  
! <p>— end Rationale]</p>
  
  <p>
  - Change Table 97 in 23.2.5 [unord.req] as follows (Row b.bucket(k), Column "Assertion/..."):
--- 75919,75925 ----
  }
  </pre></blockquote>
  
! <p>&mdash; end Rationale]</p>
  
  <p>
  - Change Table 97 in 23.2.5 [unord.req] as follows (Row b.bucket(k), Column "Assertion/..."):
*************** if (pos != m.bucket_count()) {
*** 68844,68853 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 97 — Unordered associative container requirements
  (in addition to container)</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Assertion/note pre-/post-condition</th>
--- 75927,75936 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 97 &mdash; Unordered associative container requirements
  (in addition to container)</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Assertion/note pre-/post-condition</th>
*************** b.bucket_count())</tt><ins>, otherwise 0
*** 68866,68872 ****
  <td>Constant</td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  </blockquote>
--- 75949,75955 ----
  <td>Constant</td>
  </tr>
  
! </table>
  </blockquote>
  
  </blockquote>
*************** Change Table 97 in 23.2.5 [unord.req] as
*** 68890,68899 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 97 — Unordered associative container requirements
  (in addition to container)</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Assertion/note pre-/post-condition</th>
--- 75973,75982 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 97 &mdash; Unordered associative container requirements
  (in addition to container)</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Assertion/note pre-/post-condition</th>
*************** b.bucket_count())</tt>.</td>
*** 68910,68916 ****
  <td>Constant</td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  
--- 75993,75999 ----
  <td>Constant</td>
  </tr>
  
! </table>
  </blockquote>
  
  
*************** b.bucket_count())</tt>.</td>
*** 68920,68946 ****
  
  <hr>
  <h3><a name="1198"></a>1198. Container adaptor swap: member or non-member?</h3>
! <p><b>Section:</b> 23.5 [container.adaptors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-08-26 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Under 23.5 [container.adaptors] of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>
  the member function of <tt>swap</tt> of <tt>queue</tt> and <tt>stack</tt> call:
  </p>
  
! <blockquote><pre>swap(c, q.c);
  </pre></blockquote>
  
  <p>
! But under 23.5 [container.adaptors] of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
  these members are specified to call:
  </p>
  
! <blockquote><pre>c.swap(q.c);
  </pre></blockquote>
  
  <p>
--- 76003,76031 ----
  
  <hr>
  <h3><a name="1198"></a>1198. Container adaptor swap: member or non-member?</h3>
! <p><b>Section:</b> 23.6 [container.adaptors] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-08-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Under 23.6 [container.adaptors] of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>
  the member function of <tt>swap</tt> of <tt>queue</tt> and <tt>stack</tt> call:
  </p>
  
! <blockquote><pre>
! swap(c, q.c);
  </pre></blockquote>
  
  <p>
! But under 23.6 [container.adaptors] of
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2723.pdf">N2723</a>
  these members are specified to call:
  </p>
  
! <blockquote><pre>
! c.swap(q.c);
  </pre></blockquote>
  
  <p>
*************** should use the container's namespace sco
*** 68965,68976 ****
  ]</i></p>
  
  
! <blockquote>
! The outcome of this issue should be considered with the outcome of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a> both in style and in content (e.g. <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#774">774</a> bullet 9
  suggests to define the semantic of <tt>void
  priority_queue::swap(priority_queue&amp;)</tt> in terms of the member
  <tt>swap</tt> of the container).
! </blockquote>
  
  <p><i>[
  2010-03-28 Daniel update to diff against N3092.
--- 76050,76061 ----
  ]</i></p>
  
  
! <blockquote><p>
! The outcome of this issue should be considered with the outcome of <a href="lwg-defects.html#774">774</a> both in style and in content (e.g. <a href="lwg-defects.html#774">774</a> bullet 9
  suggests to define the semantic of <tt>void
  priority_queue::swap(priority_queue&amp;)</tt> in terms of the member
  <tt>swap</tt> of the container).
! </p></blockquote>
  
  <p><i>[
  2010-03-28 Daniel update to diff against N3092.
*************** priority_queue::swap(priority_queue&amp;
*** 68983,68993 ****
  ]</i></p>
  
  
! <blockquote>
  Preference to move the wording into normative text, rather than inline function definitions in the class synopsis.
  
  Move to Tenatively Ready.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 76068,76078 ----
  ]</i></p>
  
  
! <blockquote><p>
  Preference to move the wording into normative text, rather than inline function definitions in the class synopsis.
  
  Move to Tenatively Ready.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 68999,69008 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 23.5.1.1 [queue.defn]:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container = deque&lt;T&gt; &gt; 
  class queue {
     ...
     void swap(queue&amp; q) { <ins>using std::swap;</ins>
--- 76084,76094 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Change 23.6.3.1 [queue.defn]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container = deque&lt;T&gt; &gt; 
  class queue {
     ...
     void swap(queue&amp; q) { <ins>using std::swap;</ins>
*************** class queue {
*** 69012,69021 ****
  </pre></blockquote>
  
  <p>
! Change 23.5.2 [priority.queue]:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container = vector&lt;T&gt;, 
            class Compare = less&lt;typename Container::value_type&gt; &gt; 
  class priority_queue { 
      ...
--- 76098,76108 ----
  </pre></blockquote>
  
  <p>
! Change 23.6.4 [priority.queue]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container = vector&lt;T&gt;, 
            class Compare = less&lt;typename Container::value_type&gt; &gt; 
  class priority_queue { 
      ...
*************** class priority_queue {
*** 69027,69036 ****
  </pre></blockquote>
  
  <p>
! Change 23.5.3.1 [stack.defn]:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container = deque&lt;T&gt; &gt; 
  class stack {
     ...
     void swap(stack&amp; s) { <ins>using std::swap;</ins>
--- 76114,76124 ----
  </pre></blockquote>
  
  <p>
! Change 23.6.5.2 [stack.defn]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container = deque&lt;T&gt; &gt; 
  class stack {
     ...
     void swap(stack&amp; s) { <ins>using std::swap;</ins>
*************** class stack {
*** 69046,69061 ****
  
  <hr>
  <h3><a name="1199"></a>1199. Missing extended copy constructor in container adaptors</h3>
! <p><b>Section:</b> 23.5 [container.adaptors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-08-26 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>queue</tt> has a constructor:
  </p>
  
! <blockquote><pre>template &lt;class Alloc&gt;
    queue(queue&amp;&amp;, const Alloc&amp;);
  </pre></blockquote>
  
--- 76134,76150 ----
  
  <hr>
  <h3><a name="1199"></a>1199. Missing extended copy constructor in container adaptors</h3>
! <p><b>Section:</b> 23.6 [container.adaptors] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-08-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>queue</tt> has a constructor:
  </p>
  
! <blockquote><pre>
! template &lt;class Alloc&gt;
    queue(queue&amp;&amp;, const Alloc&amp;);
  </pre></blockquote>
  
*************** class stack {
*** 69063,69069 ****
  but it is missing a corresponding constructor:
  </p>
  
! <blockquote><pre>template &lt;class Alloc&gt;
    queue(const queue&amp;, const Alloc&amp;);
  </pre></blockquote>
  
--- 76152,76159 ----
  but it is missing a corresponding constructor:
  </p>
  
! <blockquote><pre>
! template &lt;class Alloc&gt;
    queue(const queue&amp;, const Alloc&amp;);
  </pre></blockquote>
  
*************** user of a container adaptor can always s
*** 69083,69095 ****
  <p><b>Proposed resolution:</b></p>
  <p><i>[
  This resolution has been harmonized with the proposed resolution to issue
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>
  ]</i></p>
  
  
! <p>Change 23.5.1.1 [queue.defn], p1:</p>
  
! <blockquote><pre>template &lt;class T, class Container = deque&lt;T&gt; &gt;
  class queue {
  public:
    typedef typename Container::value_type      value_type;
--- 76173,76186 ----
  <p><b>Proposed resolution:</b></p>
  <p><i>[
  This resolution has been harmonized with the proposed resolution to issue
! <a href="lwg-defects.html#1194">1194</a>
  ]</i></p>
  
  
! <p>Change 23.6.3.1 [queue.defn], p1:</p>
  
! <blockquote><pre>
! template &lt;class T, class Container = deque&lt;T&gt; &gt;
  class queue {
  public:
    typedef typename Container::value_type      value_type;
*************** public:
*** 69118,69130 ****
  </pre></blockquote>
  
  <p>
! To the new section 23.5.1.2 [queue.cons], introduced
! in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, add:
  </p>
  
  <blockquote>
  
! <pre>template &lt;class Alloc&gt; 
    queue(const queue&amp; q, const Alloc&amp; a);
  </pre>
  
--- 76209,76222 ----
  </pre></blockquote>
  
  <p>
! To the new section 23.6.3.2 [queue.cons], introduced
! in <a href="lwg-defects.html#1194">1194</a>, add:
  </p>
  
  <blockquote>
  
! <pre>
! template &lt;class Alloc&gt; 
    queue(const queue&amp; q, const Alloc&amp; a);
  </pre>
  
*************** first argument and <tt>a</tt> as the sec
*** 69135,69144 ****
  
  </blockquote>
  
! <p>Change 23.5.2 [priority.queue] as follows (I've an included an editorial change to
    move the poorly-placed move-assignment operator):</p>
  
! <blockquote><pre>template &lt;class T, class Container = vector&lt;T&gt;,
            class Compare = less&lt;typename Container::value_type&gt; &gt;
  class priority_queue {
  public:
--- 76227,76237 ----
  
  </blockquote>
  
! <p>Change 23.6.4 [priority.queue] as follows (I've an included an editorial change to
    move the poorly-placed move-assignment operator):</p>
  
! <blockquote><pre>
! template &lt;class T, class Container = vector&lt;T&gt;,
            class Compare = less&lt;typename Container::value_type&gt; &gt;
  class priority_queue {
  public:
*************** public:
*** 69177,69188 ****
  </pre></blockquote>
  
  <p>
! Add to 23.5.2.1 [priqueue.cons]:
  </p>
  
  <blockquote>
  
! <pre>template &lt;class Alloc&gt;
    priority_queue(const priority_queue&amp; q, const Alloc&amp; a);
  </pre>
  
--- 76270,76282 ----
  </pre></blockquote>
  
  <p>
! Add to 23.6.4.1 [priqueue.cons]:
  </p>
  
  <blockquote>
  
! <pre>
! template &lt;class Alloc&gt;
    priority_queue(const priority_queue&amp; q, const Alloc&amp; a);
  </pre>
  
*************** and initializes <tt>comp</tt> with <tt>q
*** 69195,69204 ****
  </blockquote>
  
  <p>
! Change 23.5.3.1 [stack.defn]:
  </p>
  
! <blockquote><pre>template &lt;class T, class Container = deque&lt;T&gt; &gt;
  class stack {
  public:
    typedef typename Container::value_type      value_type;
--- 76289,76299 ----
  </blockquote>
  
  <p>
! Change 23.6.5.2 [stack.defn]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class Container = deque&lt;T&gt; &gt;
  class stack {
  public:
    typedef typename Container::value_type      value_type;
*************** public:
*** 69227,69239 ****
  </pre></blockquote>
  
  <p>
! To the new section 23.5.3.2 [stack.cons], introduced
! in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a>, add:
  </p>
  
  <blockquote>
  
! <pre>template &lt;class Alloc&gt; 
    stack(const stack&amp; s, const Alloc&amp; a);
  </pre>
  
--- 76322,76335 ----
  </pre></blockquote>
  
  <p>
! To the new section 23.6.5.3 [stack.cons], introduced
! in <a href="lwg-defects.html#1194">1194</a>, add:
  </p>
  
  <blockquote>
  
! <pre>
! template &lt;class Alloc&gt; 
    stack(const stack&amp; s, const Alloc&amp; a);
  </pre>
  
*************** first argument and <tt>a</tt> as the sec
*** 69250,69259 ****
  
  <hr>
  <h3><a name="1204"></a>1204. Global permission to move</h3>
! <p><b>Section:</b> 17.6.3.9 [res.on.arguments] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-09-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#res.on.arguments">issues</a> in [res.on.arguments].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  When a library function binds an rvalue reference parameter to an argument, the
--- 76346,76355 ----
  
  <hr>
  <h3><a name="1204"></a>1204. Global permission to move</h3>
! <p><b>Section:</b> 17.6.4.9 [res.on.arguments] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-09-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#res.on.arguments">issues</a> in [res.on.arguments].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  When a library function binds an rvalue reference parameter to an argument, the
*************** able to modify that argument without con
*** 69263,69274 ****
  the logic of the calling code.  For example:
  </p>
  
! <blockquote><pre>template &lt;class T, class A&gt;
  void
  vector&lt;T, A&gt;::push_back(value_type&amp;&amp; v)
  {
!     <font color="#C80000">// This function should move from v, potentially modifying</font>
!     <font color="#C80000">//   the object v is bound to.</font>
  }
  </pre></blockquote>
  
--- 76359,76371 ----
  the logic of the calling code.  For example:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class A&gt;
  void
  vector&lt;T, A&gt;::push_back(value_type&amp;&amp; v)
  {
!     <span style="color:#C80000">// This function should move from v, potentially modifying</span>
!     <span style="color:#C80000">// the object v is bound to.</span>
  }
  </pre></blockquote>
  
*************** the logic of his program after this stat
*** 69285,69297 ****
  that <tt>push_back</tt> may treat <tt>x</tt> as a temporary.
  </p>
  
! <blockquote><em>
  The above statement is the very foundation upon which move semantics is based.
! </em></blockquote>
  
  <p>
  The standard is currently lacking a global statement to this effect.  I propose
! the following addition to 17.6.3.9 [res.on.arguments]:
  </p>
  
  <blockquote>
--- 76382,76394 ----
  that <tt>push_back</tt> may treat <tt>x</tt> as a temporary.
  </p>
  
! <blockquote><p><em>
  The above statement is the very foundation upon which move semantics is based.
! </em></p></blockquote>
  
  <p>
  The standard is currently lacking a global statement to this effect.  I propose
! the following addition to 17.6.4.9 [res.on.arguments]:
  </p>
  
  <blockquote>
*************** a library function (e.g. <tt>move(x)</tt
*** 69324,69330 ****
  asking the library to treat that lvalue as a temporary.  The library is at
  liberty to optimize away aliasing checks which might be needed if the argument
  were an lvalue.
! — <i>end note</i>]
  </ins></li>
  </ul>
  
--- 76421,76427 ----
  asking the library to treat that lvalue as a temporary.  The library is at
  liberty to optimize away aliasing checks which might be needed if the argument
  were an lvalue.
! &mdash; <i>end note</i>]
  </ins></li>
  </ul>
  
*************** were an lvalue.
*** 69332,69345 ****
  
  <p>
  Such a global statement will eliminate the need for piecemeal statements such as
! 23.2.1 [container.requirements.general]/13:
  </p>
  
! <blockquote>
  An object bound to an rvalue reference parameter of a member function of
  a container shall not be an element of that container; no diagnostic
  required.
! </blockquote>
  
  <p>
  Additionally this clarifies that move assignment operators need not perform the
--- 76429,76442 ----
  
  <p>
  Such a global statement will eliminate the need for piecemeal statements such as
! 23.2.1 [container.requirements.general]&#47;13:
  </p>
  
! <blockquote><p>
  An object bound to an rvalue reference parameter of a member function of
  a container shall not be an element of that container; no diagnostic
  required.
! </p></blockquote>
  
  <p>
  Additionally this clarifies that move assignment operators need not perform the
*************** copy assignment operators.
*** 69352,69376 ****
  ]</i></p>
  
  
! <blockquote>
! Note: This resolution supports the change of 27.9.1.3 [filebuf.assign]/1,
! proposed by LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#900">900</a>.
! </blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a bullet to 17.6.3.9 [res.on.arguments]:
  </p>
  
  <blockquote>
--- 76449,76473 ----
  ]</i></p>
  
  
! <blockquote><p>
! Note: This resolution supports the change of 27.9.1.3 [filebuf.assign]&#47;1,
! proposed by LWG <a href="lwg-defects.html#900">900</a>.
! </p></blockquote>
  
  <p><i>[
  2009 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a bullet to 17.6.4.9 [res.on.arguments]:
  </p>
  
  <blockquote>
*************** a library function (e.g. <tt>move(x)</tt
*** 69403,69422 ****
  asking the library to treat that lvalue as a temporary.  The library is at
  liberty to optimize away aliasing checks which might be needed if the argument
  were an lvalue.
! — <i>end note</i>]
  </ins></li>
  </ul>
  </blockquote>
  
  <p>
! Delete 23.2.1 [container.requirements.general]/13:
  </p>
  
! <blockquote><del>
  An object bound to an rvalue reference parameter of a member function of
  a container shall not be an element of that container; no diagnostic
  required.
! </del></blockquote>
  
  
  
--- 76500,76519 ----
  asking the library to treat that lvalue as a temporary.  The library is at
  liberty to optimize away aliasing checks which might be needed if the argument
  were an lvalue.
! &mdash; <i>end note</i>]
  </ins></li>
  </ul>
  </blockquote>
  
  <p>
! Delete 23.2.1 [container.requirements.general]&#47;13:
  </p>
  
! <blockquote><p><del>
  An object bound to an rvalue reference parameter of a member function of
  a container shall not be an element of that container; no diagnostic
  required.
! </del></p></blockquote>
  
  
  
*************** required.
*** 69425,69434 ****
  
  <hr>
  <h3><a name="1205"></a>1205. Some algorithms could more clearly document their handling of empty ranges</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are a number of algorithms whose result might depend on the
--- 76522,76532 ----
  
  <hr>
  <h3><a name="1205"></a>1205. Some algorithms could more clearly document their handling of empty ranges</h3>
! <p><b>Section:</b> 25 [algorithms] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#algorithms">active issues</a> in [algorithms].</p>
! <p><b>View all other</b> <a href="lwg-index.html#algorithms">issues</a> in [algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are a number of algorithms whose result might depend on the
*************** rather than require some subtle intuitio
*** 69441,69450 ****
  25.2.1 [alg.all_of]
  </p>
  
! <blockquote>
  <i>Returns:</i> <tt>true</tt> if <tt>pred(*i)</tt> is <tt>true</tt> for every
  iterator <tt>i</tt> in the range <tt>[first,last)</tt>, ...
! </blockquote>
  
  <p>
  What does this mean if the range is empty?
--- 76539,76548 ----
  25.2.1 [alg.all_of]
  </p>
  
! <blockquote><p>
  <i>Returns:</i> <tt>true</tt> if <tt>pred(*i)</tt> is <tt>true</tt> for every
  iterator <tt>i</tt> in the range <tt>[first,last)</tt>, ...
! </p></blockquote>
  
  <p>
  What does this mean if the range is empty?
*************** non-normative note to clarify:
*** 69459,69477 ****
  Add to p1 25.2.1 [alg.all_of]:
  </p>
  
! <blockquote>
  [<i>Note:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! — <i>end note</i>]
! </blockquote>
  
  <p>
  25.2.3 [alg.none_of]
  </p>
  
! <blockquote>
  <i>Returns:</i> <tt>true</tt> if <tt>pred(*i)</tt> is <tt>false</tt> for every
  iterator <tt>i</tt> in the range <tt>[first,last)</tt>, ...
! </blockquote>
  
  <p>
  What does this mean if the range empty?
--- 76557,76575 ----
  Add to p1 25.2.1 [alg.all_of]:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  25.2.3 [alg.none_of]
  </p>
  
! <blockquote><p>
  <i>Returns:</i> <tt>true</tt> if <tt>pred(*i)</tt> is <tt>false</tt> for every
  iterator <tt>i</tt> in the range <tt>[first,last)</tt>, ...
! </p></blockquote>
  
  <p>
  What does this mean if the range empty?
*************** non-normative note to clarify:
*** 69486,69495 ****
  Add to p1 25.2.3 [alg.none_of]:
  </p>
  
! <blockquote>
  [<i>Note:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! — <i>end note</i>]
! </blockquote>
  
  <p>
  25.2.2 [alg.any_of]
--- 76584,76593 ----
  Add to p1 25.2.3 [alg.none_of]:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  25.2.2 [alg.any_of]
*************** for <tt>all_of</tt>/<tt>none_of</tt> alg
*** 69505,69514 ****
  Add to p1 25.2.2 [alg.any_of]:
  </p>
  
! <blockquote>
  [<i>Note:</i> Returns <tt>false</tt> if <tt>[first,last)</tt> is empty. 
! — <i>end note</i>]
! </blockquote>
  
  <p>
  25.2.6 [alg.find.end]
--- 76603,76612 ----
  Add to p1 25.2.2 [alg.any_of]:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> Returns <tt>false</tt> if <tt>[first,last)</tt> is empty. 
! &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  25.2.6 [alg.find.end]
*************** My proposed wording is a note to clarify
*** 69533,69542 ****
  Add to p2 25.2.6 [alg.find.end]:
  </p>
  
! <blockquote>
  [<i>Note:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
! empty. — <i>end note</i>]
! </blockquote>
  
  <p>
  I would prefer a normative wording treating empty ranges specially, but
--- 76631,76640 ----
  Add to p2 25.2.6 [alg.find.end]:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
! empty. &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  I would prefer a normative wording treating empty ranges specially, but
*************** Alternative wording: (NOT a note)
*** 69550,69558 ****
  <p>
  Add to p2 25.2.6 [alg.find.end]:
  </p>
! <blockquote>
  Returns <tt>first1</tt> if <tt>[first2,last2)</tt> is empty.
! </blockquote>
  
  <p>
  25.2.7 [alg.find.first.of]
--- 76648,76656 ----
  <p>
  Add to p2 25.2.6 [alg.find.end]:
  </p>
! <blockquote><p>
  Returns <tt>first1</tt> if <tt>[first2,last2)</tt> is empty.
! </p></blockquote>
  
  <p>
  25.2.7 [alg.find.first.of]
*************** note to confirm the reader's understandi
*** 69566,69575 ****
  <p>
  Add to p2 25.2.7 [alg.find.first.of]
  </p>
! <blockquote>
  [<i>Note:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
! empty. — <i>end note</i>]
! </blockquote>
  
  <p>
  25.2.13 [alg.search]
--- 76664,76673 ----
  <p>
  Add to p2 25.2.7 [alg.find.first.of]
  </p>
! <blockquote><p>
  [<i>Note:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
! empty. &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  25.2.13 [alg.search]
*************** My proposed wording is a note to clarify
*** 69594,69603 ****
  Add to p2 25.2.13 [alg.search]:
  </p>
  
! <blockquote>
  [<i>Note:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
! empty. — <i>end note</i>]
! </blockquote>
  
  <p>
  Again, I would prefer a normative wording treating empty ranges
--- 76692,76701 ----
  Add to p2 25.2.13 [alg.search]:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
! empty. &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  Again, I would prefer a normative wording treating empty ranges
*************** Alternative wording: (NOT a note)
*** 69612,69620 ****
  Add to p2 25.2.13 [alg.search]:
  </p>
  
! <blockquote>
  Returns <tt>first1</tt> if <tt>[first2,last2)</tt> is empty.
! </blockquote>
  
  <p>
  25.3.13 [alg.partitions]
--- 76710,76718 ----
  Add to p2 25.2.13 [alg.search]:
  </p>
  
! <blockquote><p>
  Returns <tt>first1</tt> if <tt>[first2,last2)</tt> is empty.
! </p></blockquote>
  
  <p>
  25.3.13 [alg.partitions]
*************** Proposed wording:
*** 69632,69651 ****
  Add to p1 25.3.13 [alg.partitions]:
  </p>
  
! <blockquote>
  [<i>Note:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! — <i>end note</i>]
! </blockquote>
  
  <p>
  25.4.5.1 [includes]
  </p>
  
! <blockquote>
  <i>Returns:</i> <tt>true</tt> if every element in the range
  <tt>[first2,last2)</tt> is contained in the range
  <tt>[first1,last1)</tt>. ...
! </blockquote>
  
  <p>
  I really don't know what this means if <tt>[first2,last2)</tt> is empty.
--- 76730,76749 ----
  Add to p1 25.3.13 [alg.partitions]:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  25.4.5.1 [includes]
  </p>
  
! <blockquote><p>
  <i>Returns:</i> <tt>true</tt> if every element in the range
  <tt>[first2,last2)</tt> is contained in the range
  <tt>[first1,last1)</tt>. ...
! </p></blockquote>
  
  <p>
  I really don't know what this means if <tt>[first2,last2)</tt> is empty.
*************** my proposed wording is to clarify exactl
*** 69657,69666 ****
  Add to p1 25.4.5.1 [includes]:
  </p>
  
! <blockquote>
  [<i>Note:</i> Returns <tt>true</tt> if <tt>[first2,last2)</tt> is empty.
! — <i>end note</i>]
! </blockquote>
  
  <p>
  25.4.6.2 [pop.heap]
--- 76755,76764 ----
  Add to p1 25.4.5.1 [includes]:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> Returns <tt>true</tt> if <tt>[first2,last2)</tt> is empty.
! &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p>
  25.4.6.2 [pop.heap]
*************** Proposed wording:
*** 69679,69688 ****
  Revise p2 25.4.6.2 [pop.heap]
  </p>
  
! <blockquote>
  <i>Requires:</i> The range <tt>[first,last)</tt> shall be a valid
  <ins>non-empty</ins> heap.
! </blockquote>
  
  <p>
  [Editorial] Reverse order of 25.4.6.2 [pop.heap] p1 and p2.
--- 76777,76786 ----
  Revise p2 25.4.6.2 [pop.heap]
  </p>
  
! <blockquote><p>
  <i>Requires:</i> The range <tt>[first,last)</tt> shall be a valid
  <ins>non-empty</ins> heap.
! </p></blockquote>
  
  <p>
  [Editorial] Reverse order of 25.4.6.2 [pop.heap] p1 and p2.
*************** range in the same way that <tt>min_eleme
*** 69701,69709 ****
  Add to p31 25.4.7 [alg.min.max]:
  </p>
  
! <blockquote>
  Returns <tt>make_pair(first, first)</tt> if <tt>first == last</tt>.
! </blockquote>
  
  <p>
  25.4.8 [alg.lex.comparison]
--- 76799,76807 ----
  Add to p31 25.4.7 [alg.min.max]:
  </p>
  
! <blockquote><p>
  Returns <tt>make_pair(first, first)</tt> if <tt>first == last</tt>.
! </p></blockquote>
  
  <p>
  25.4.8 [alg.lex.comparison]
*************** rest of these issue resolutions:
*** 69719,69728 ****
  Add to p1 25.4.8 [alg.lex.comparison]:
  </p>
  
! <blockquote>
  [<i>Note:</i> An empty sequence is lexicographically less than any other
! non-empty sequence, but not to another empty sequence. — <i>end note</i>]
! </blockquote>
  
  <p><i>[
  2009-11-11 Howard changes Notes to Remarks and changed <tt>search</tt> to
--- 76817,76826 ----
  Add to p1 25.4.8 [alg.lex.comparison]:
  </p>
  
! <blockquote><p>
  [<i>Note:</i> An empty sequence is lexicographically less than any other
! non-empty sequence, but not to another empty sequence. &mdash; <i>end note</i>]
! </p></blockquote>
  
  <p><i>[
  2009-11-11 Howard changes Notes to Remarks and changed <tt>search</tt> to
*************** return <tt>first1</tt> instead of <tt>la
*** 69740,69840 ****
  <p>
  Add to 25.2.1 [alg.all_of]:
  </p>
! <blockquote><ins>
  <i>Remarks:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! </ins></blockquote>
  
  <p>
  Add to 25.2.2 [alg.any_of]:
  </p>
  
! <blockquote><ins>
  <i>Remarks:</i> Returns <tt>false</tt> if <tt>[first,last)</tt> is empty. 
! </ins></blockquote>
  
  <p>
  Add to 25.2.3 [alg.none_of]:
  </p>
! <blockquote><ins>
  <i>Remarks:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! </ins></blockquote>
  
  <p>
  Add to 25.2.6 [alg.find.end]:
  </p>
! <blockquote><ins>
  <i>Remarks:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
  empty.
! </ins></blockquote>
  
  <p>
  Add to 25.2.7 [alg.find.first.of]
  </p>
! <blockquote><ins>
  <i>Remarks:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
  empty.
! </ins></blockquote>
  
  <p>
  Add to 25.2.13 [alg.search]:
  </p>
! <blockquote><ins>
  <i>Remarks:</i> Returns <tt>first1</tt> if <tt>[first2,last2)</tt> is
  empty.
! </ins></blockquote>
  
  <p>
  Add to 25.3.13 [alg.partitions]:
  </p>
! <blockquote><ins>
  <i>Remarks:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! </ins></blockquote>
  
  <p>
  Add to 25.4.5.1 [includes]:
  </p>
! <blockquote><ins>
  <i>Remarks:</i> Returns <tt>true</tt> if <tt>[first2,last2)</tt> is empty. 
! </ins></blockquote>
  
  <p>
  Revise p2 25.4.6.2 [pop.heap]
  </p>
! <blockquote>
  <i>Requires:</i> The range <tt>[first,last)</tt> shall be a valid
  <ins>non-empty</ins> heap.
! </blockquote>
  
  <p>
  [Editorial] 
  </p>
! <blockquote>
  Reverse order of 25.4.6.2 [pop.heap] p1 and p2.
! </blockquote>
  
  <p>
  Add to p35 25.4.7 [alg.min.max]:
  </p>
! <blockquote><pre>template&lt;class ForwardIterator, class Compare&gt;
    pair&lt;ForwardIterator, ForwardIterator&gt;
      minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
  </pre>
! <blockquote>
  <i>Returns:</i> <tt>make_pair(m, M)</tt>, where <tt>m</tt> is the first iterator in
  <tt>[first,last)</tt> such that no iterator in the range refers to a smaller
  element, and where <tt>M</tt> is the last iterator in <tt>[first,last)</tt> such that no
  iterator in the range refers to a larger element. 
  <ins>Returns <tt>make_pair(first, first)</tt> if <tt>first == last</tt>.</ins>
! </blockquote>
  </blockquote>
  
  <p>
  Add to 25.4.8 [alg.lex.comparison]:
  </p>
! <blockquote><ins>
  <i>Remarks:</i> An empty sequence is lexicographically less than any other
  non-empty sequence, but not less than another empty sequence.
! </ins></blockquote>
  
  
  
--- 76838,76939 ----
  <p>
  Add to 25.2.1 [alg.all_of]:
  </p>
! <blockquote><p><ins>
  <i>Remarks:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! </ins></p></blockquote>
  
  <p>
  Add to 25.2.2 [alg.any_of]:
  </p>
  
! <blockquote><p><ins>
  <i>Remarks:</i> Returns <tt>false</tt> if <tt>[first,last)</tt> is empty. 
! </ins></p></blockquote>
  
  <p>
  Add to 25.2.3 [alg.none_of]:
  </p>
! <blockquote><p><ins>
  <i>Remarks:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! </ins></p></blockquote>
  
  <p>
  Add to 25.2.6 [alg.find.end]:
  </p>
! <blockquote><p><ins>
  <i>Remarks:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
  empty.
! </ins></p></blockquote>
  
  <p>
  Add to 25.2.7 [alg.find.first.of]
  </p>
! <blockquote><p><ins>
  <i>Remarks:</i> Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is
  empty.
! </ins></p></blockquote>
  
  <p>
  Add to 25.2.13 [alg.search]:
  </p>
! <blockquote><p><ins>
  <i>Remarks:</i> Returns <tt>first1</tt> if <tt>[first2,last2)</tt> is
  empty.
! </ins></p></blockquote>
  
  <p>
  Add to 25.3.13 [alg.partitions]:
  </p>
! <blockquote><p><ins>
  <i>Remarks:</i> Returns <tt>true</tt> if <tt>[first,last)</tt> is empty. 
! </ins></p></blockquote>
  
  <p>
  Add to 25.4.5.1 [includes]:
  </p>
! <blockquote><p><ins>
  <i>Remarks:</i> Returns <tt>true</tt> if <tt>[first2,last2)</tt> is empty. 
! </ins></p></blockquote>
  
  <p>
  Revise p2 25.4.6.2 [pop.heap]
  </p>
! <blockquote><p>
  <i>Requires:</i> The range <tt>[first,last)</tt> shall be a valid
  <ins>non-empty</ins> heap.
! </p></blockquote>
  
  <p>
  [Editorial] 
  </p>
! <blockquote><p>
  Reverse order of 25.4.6.2 [pop.heap] p1 and p2.
! </p></blockquote>
  
  <p>
  Add to p35 25.4.7 [alg.min.max]:
  </p>
! <blockquote><pre>
! template&lt;class ForwardIterator, class Compare&gt;
    pair&lt;ForwardIterator, ForwardIterator&gt;
      minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
  </pre>
! <blockquote><p>
  <i>Returns:</i> <tt>make_pair(m, M)</tt>, where <tt>m</tt> is the first iterator in
  <tt>[first,last)</tt> such that no iterator in the range refers to a smaller
  element, and where <tt>M</tt> is the last iterator in <tt>[first,last)</tt> such that no
  iterator in the range refers to a larger element. 
  <ins>Returns <tt>make_pair(first, first)</tt> if <tt>first == last</tt>.</ins>
! </p></blockquote>
  </blockquote>
  
  <p>
  Add to 25.4.8 [alg.lex.comparison]:
  </p>
! <blockquote><p><ins>
  <i>Remarks:</i> An empty sequence is lexicographically less than any other
  non-empty sequence, but not less than another empty sequence.
! </ins></p></blockquote>
  
  
  
*************** non-empty sequence, but not less than an
*** 69843,69858 ****
  
  <hr>
  <h3><a name="1206"></a>1206. Incorrect requires for <tt>move_backward</tt> and <tt>copy_backward</tt></h3>
! <p><b>Section:</b> 25.3.2 [alg.move] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-09-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  25.3.2 [alg.move], p6 says:
  </p>
  
  <blockquote>
! <pre>template&lt;class BidirectionalIterator1, class BidirectionalIterator2&gt;
    BidirectionalIterator2
      move_backward(BidirectionalIterator1 first,
                    BidirectionalIterator1 last,
--- 76942,76958 ----
  
  <hr>
  <h3><a name="1206"></a>1206. Incorrect requires for <tt>move_backward</tt> and <tt>copy_backward</tt></h3>
! <p><b>Section:</b> 25.3.2 [alg.move] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-09-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  25.3.2 [alg.move], p6 says:
  </p>
  
  <blockquote>
! <pre>
! template&lt;class BidirectionalIterator1, class BidirectionalIterator2&gt;
    BidirectionalIterator2
      move_backward(BidirectionalIterator1 first,
                    BidirectionalIterator1 last,
*************** Change 25.3.2 [alg.move], p6:
*** 69907,69913 ****
  </p>
  
  <blockquote>
! <pre>template&lt;class BidirectionalIterator1, class BidirectionalIterator2&gt;
    BidirectionalIterator2
      move_backward(BidirectionalIterator1 first,
                    BidirectionalIterator1 last,
--- 77007,77014 ----
  </p>
  
  <blockquote>
! <pre>
! template&lt;class BidirectionalIterator1, class BidirectionalIterator2&gt;
    BidirectionalIterator2
      move_backward(BidirectionalIterator1 first,
                    BidirectionalIterator1 last,
*************** Change 25.3.1 [alg.copy], p13:
*** 69927,69933 ****
  </p>
  
  <blockquote>
! <pre>template&lt;class BidirectionalIterator1, class BidirectionalIterator2&gt;
    BidirectionalIterator2
      copy_backward(BidirectionalIterator1 first,
                    BidirectionalIterator1 last,
--- 77028,77035 ----
  </p>
  
  <blockquote>
! <pre>
! template&lt;class BidirectionalIterator1, class BidirectionalIterator2&gt;
    BidirectionalIterator2
      copy_backward(BidirectionalIterator1 first,
                    BidirectionalIterator1 last,
*************** Change 25.3.1 [alg.copy], p13:
*** 69947,69957 ****
  
  
  <hr>
! <h3><a name="1207"></a>1207. Underspecified std::list operations?</h3>
! <p><b>Section:</b> 23.3.4.4 [list.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Loïc Joly <b>Opened:</b> 2009-09-13 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It looks to me like some operations of <tt>std::list</tt>
--- 77049,77059 ----
  
  
  <hr>
! <h3><a name="1207"></a>1207. Underspecified <tt>std::list</tt> operations?</h3>
! <p><b>Section:</b> 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Lo&iuml;c Joly <b>Opened:</b> 2009-09-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  It looks to me like some operations of <tt>std::list</tt>
*************** Suggested resolution:
*** 69994,70016 ****
  </p>
  
  <p>
! In 23.3.4.4 [list.ops] change paragraph 19
  </p>
  
! <blockquote><pre>                                 void unique();
  template &lt;class BinaryPredicate&gt; void unique(BinaryPredicate binary_pred);
  </pre>
! <blockquote>
  <i>Effects:</i> <del>Eliminates</del> <ins>Erases</ins> all but the first
  element from every consecutive group ...
! </blockquote>
  </blockquote>
  
  <p>
  Add to the end of paragraph 23
  </p>
  
! <blockquote><pre>void                          merge(list&lt;T,Allocator&gt;&amp;&amp; x);
  template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);
  </pre>
  <blockquote>
--- 77096,77120 ----
  </p>
  
  <p>
! In 23.3.5.5 [list.ops] change paragraph 19
  </p>
  
! <blockquote><pre>
!                                  void unique();
  template &lt;class BinaryPredicate&gt; void unique(BinaryPredicate binary_pred);
  </pre>
! <blockquote><p>
  <i>Effects:</i> <del>Eliminates</del> <ins>Erases</ins> all but the first
  element from every consecutive group ...
! </p></blockquote>
  </blockquote>
  
  <p>
  Add to the end of paragraph 23
  </p>
  
! <blockquote><pre>
! void                          merge(list&lt;T,Allocator&gt;&amp;&amp; x);
  template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);
  </pre>
  <blockquote>
*************** iterators into <tt>*this</tt>, not into
*** 70028,70034 ****
  </blockquote>
  
  <p><i>[
! 2009-12-12 Loïc adds wording.
  ]</i></p>
  
  
--- 77132,77138 ----
  </blockquote>
  
  <p><i>[
! 2009-12-12 Lo&iuml;c adds wording.
  ]</i></p>
  
  
*************** concerns.
*** 70074,70084 ****
  ]</i></p>
  
  
! <blockquote>
  The wording looks good.
  
  Move to Tentatively Ready.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 77178,77188 ----
  ]</i></p>
  
  
! <blockquote><p>
  The wording looks good.
  
  Move to Tentatively Ready.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 70093,70141 ****
  
  <li>
  <p>
! Change 23.3.3.5 [forwardlist.ops]/12 as indicated:
  </p>
  
! <blockquote><pre>void remove(const T&amp; value);
  template &lt;class Predicate&gt; void remove_if(Predicate pred);
  </pre>
  
! <blockquote>
  12 <i>Effects:</i> Erases all the elements in the list referred by a list
  iterator <tt>i</tt> for which the following conditions hold: <tt>*i == value
  (for remove()), pred(*i)</tt> is true (<tt>for remove_if()</tt>). This operation
  shall be stable: the relative order of the elements that are not removed is the
  same as their relative order in the original list. <ins>Invalidates only the
  iterators and references to the erased elements.</ins>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.3.5 [forwardlist.ops]/15 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class BinaryPredicate&gt; void unique(BinaryPredicate pred);
  </pre>
  
! <blockquote>
  15 <i>Effects:</i>: <del>Eliminates</del><ins>Erases</ins> all but the first
  element from every consecutive group of equal elements referred to by the
  iterator <tt>i</tt> in the range <tt>[first + 1,last)</tt> for which <tt>*i ==
  *(i-1)</tt> (for the version with no arguments) or <tt>pred(*i, *(i - 1))</tt>
  (for the version with a predicate argument) holds. <ins>Invalidates only the
  iterators and references to the erased elements.</ins>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.3.5 [forwardlist.ops]/19 as indicated:
  </p>
  
! <blockquote><pre>void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x);
  template &lt;class Compare&gt; void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp)
  </pre>
  
--- 77197,77248 ----
  
  <li>
  <p>
! Change 23.3.4.6 [forwardlist.ops]/12 as indicated:
  </p>
  
! <blockquote><pre>
! void remove(const T&amp; value);
  template &lt;class Predicate&gt; void remove_if(Predicate pred);
  </pre>
  
! <blockquote><p>
  12 <i>Effects:</i> Erases all the elements in the list referred by a list
  iterator <tt>i</tt> for which the following conditions hold: <tt>*i == value
  (for remove()), pred(*i)</tt> is true (<tt>for remove_if()</tt>). This operation
  shall be stable: the relative order of the elements that are not removed is the
  same as their relative order in the original list. <ins>Invalidates only the
  iterators and references to the erased elements.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.4.6 [forwardlist.ops]/15 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class BinaryPredicate&gt; void unique(BinaryPredicate pred);
  </pre>
  
! <blockquote><p>
  15 <i>Effects:</i>: <del>Eliminates</del><ins>Erases</ins> all but the first
  element from every consecutive group of equal elements referred to by the
  iterator <tt>i</tt> in the range <tt>[first + 1,last)</tt> for which <tt>*i ==
  *(i-1)</tt> (for the version with no arguments) or <tt>pred(*i, *(i - 1))</tt>
  (for the version with a predicate argument) holds. <ins>Invalidates only the
  iterators and references to the erased elements.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.4.6 [forwardlist.ops]/19 as indicated:
  </p>
  
! <blockquote><pre>
! void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x);
  template &lt;class Compare&gt; void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp)
  </pre>
  
*************** elements, but they now behave as iterato
*** 70161,70170 ****
  
  <li>
  <p>
! Change 23.3.3.5 [forwardlist.ops]/22 as indicated:
  </p>
  
! <blockquote><pre>void sort();
  template &lt;class Compare&gt; void sort(Compare comp);
  </pre>
  
--- 77268,77278 ----
  
  <li>
  <p>
! Change 23.3.4.6 [forwardlist.ops]/22 as indicated:
  </p>
  
! <blockquote><pre>
! void sort();
  template &lt;class Compare&gt; void sort(Compare comp);
  </pre>
  
*************** validity of iterators and references.</i
*** 70186,70230 ****
  
  <li>
  <p>
! Change 23.3.3.5 [forwardlist.ops]/24 as indicated:
  </p>
  
! <blockquote><pre>void reverse();
  </pre>
  
! <blockquote>
  24 <i>Effects:</i>: Reverses the order of the elements in the list. <ins>Does
  not affect the validity of iterators and references.</ins>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.4.4 [list.ops], p15:
  </p>
  
! <blockquote><pre>                           void remove(const T&amp; value);
  template &lt;class Predicate&gt; void remove_if(Predicate pred);
  </pre>
! <blockquote>
  <i>Effects:</i> Erases all the elements in the list referred by a list iterator
  <tt>i</tt> for which the following conditions hold: <tt>*i == value, pred(*i) !=
  false</tt>.  <ins>Invalidates only the iterators and references to the erased
  elements.</ins>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.4.4 [list.ops], p19:
  </p>
  
! <blockquote><pre>                                 void unique();
  template &lt;class BinaryPredicate&gt; void unique(BinaryPredicate binary_pred);
  </pre>
! <blockquote>
  <i>Effects:</i> <del>Eliminates</del> <ins>Erases</ins> all but the first
  element from every consecutive group of equal elements referred to by the
  iterator <tt>i</tt> in the range <tt>[first + 1,last)</tt> for which <tt>*i ==
--- 77294,77341 ----
  
  <li>
  <p>
! Change 23.3.4.6 [forwardlist.ops]/24 as indicated:
  </p>
  
! <blockquote><pre>
! void reverse();
  </pre>
  
! <blockquote><p>
  24 <i>Effects:</i>: Reverses the order of the elements in the list. <ins>Does
  not affect the validity of iterators and references.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.5.5 [list.ops], p15:
  </p>
  
! <blockquote><pre>
!                            void remove(const T&amp; value);
  template &lt;class Predicate&gt; void remove_if(Predicate pred);
  </pre>
! <blockquote><p>
  <i>Effects:</i> Erases all the elements in the list referred by a list iterator
  <tt>i</tt> for which the following conditions hold: <tt>*i == value, pred(*i) !=
  false</tt>.  <ins>Invalidates only the iterators and references to the erased
  elements.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.5.5 [list.ops], p19:
  </p>
  
! <blockquote><pre>
!                                  void unique();
  template &lt;class BinaryPredicate&gt; void unique(BinaryPredicate binary_pred);
  </pre>
! <blockquote><p>
  <i>Effects:</i> <del>Eliminates</del> <ins>Erases</ins> all but the first
  element from every consecutive group of equal elements referred to by the
  iterator <tt>i</tt> in the range <tt>[first + 1,last)</tt> for which <tt>*i ==
*************** iterator <tt>i</tt> in the range <tt>[fi
*** 70232,70250 ****
  <tt>pred(*i, *(i - 1))</tt> (for the version of <tt>unique</tt> with a predicate
  argument) holds. <ins>Invalidates only the iterators and references to the
  erased elements.</ins>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.4.4 [list.ops], p23:
  </p>
  
! <blockquote><pre>void                          merge(list&lt;T,Allocator&gt;&amp;&amp; x);
  template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);
  </pre>
! <blockquote>
  <i>Effects:</i> If <tt>(&amp;x == this)</tt> does nothing; otherwise, merges the
  two sorted ranges <tt>[begin(), end())</tt> and <tt>[x.begin(), x.end())</tt>.
  The result is a range in which the elements will be sorted in non-decreasing
--- 77343,77362 ----
  <tt>pred(*i, *(i - 1))</tt> (for the version of <tt>unique</tt> with a predicate
  argument) holds. <ins>Invalidates only the iterators and references to the
  erased elements.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.5.5 [list.ops], p23:
  </p>
  
! <blockquote><pre>
! void                          merge(list&lt;T,Allocator&gt;&amp;&amp; x);
  template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);
  </pre>
! <blockquote><p>
  <i>Effects:</i> If <tt>(&amp;x == this)</tt> does nothing; otherwise, merges the
  two sorted ranges <tt>[begin(), end())</tt> and <tt>[x.begin(), x.end())</tt>.
  The result is a range in which the elements will be sorted in non-decreasing
*************** iterator <tt>i</tt>, in the range other
*** 70255,70291 ****
  those same elements but as members of <tt>*this</tt>. Iterators referring to the
  moved elements will continue to refer to their elements, but they now behave as
  iterators into <tt>*this</tt>, not into <tt>x</tt>.</ins>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.4.4 [list.ops], p26:
  </p>
  
! <blockquote><pre>void reverse();
  </pre>
! <blockquote>
  <i>Effects:</i> Reverses the order of the elements in the list.
  <ins>Does not affect the validity of iterators and references.</ins>
! </blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.4.4 [list.ops], p30:
  </p>
  
! <blockquote><pre>                         void sort();
  template &lt;class Compare&gt; void sort(Compare comp);
  </pre>
! <blockquote>
  <i>Effects:</i> Sorts the list according to the <tt>operator&lt;</tt> or a
  <tt>Compare</tt> function object.
  <ins>Does not affect the validity of iterators and references.</ins>
! </blockquote>
  </blockquote>
  </li>
  
--- 77367,77405 ----
  those same elements but as members of <tt>*this</tt>. Iterators referring to the
  moved elements will continue to refer to their elements, but they now behave as
  iterators into <tt>*this</tt>, not into <tt>x</tt>.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.5.5 [list.ops], p26:
  </p>
  
! <blockquote><pre>
! void reverse();
  </pre>
! <blockquote><p>
  <i>Effects:</i> Reverses the order of the elements in the list.
  <ins>Does not affect the validity of iterators and references.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
  <li>
  <p>
! Change 23.3.5.5 [list.ops], p30:
  </p>
  
! <blockquote><pre>
!                          void sort();
  template &lt;class Compare&gt; void sort(Compare comp);
  </pre>
! <blockquote><p>
  <i>Effects:</i> Sorts the list according to the <tt>operator&lt;</tt> or a
  <tt>Compare</tt> function object.
  <ins>Does not affect the validity of iterators and references.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
*************** template &lt;class Compare&gt; void sort
*** 70297,70318 ****
  
  
  <hr>
! <h3><a name="1208"></a>1208. valarray initializer_list constructor has incorrect effects</h3>
! <p><b>Section:</b> 26.6.2.1 [valarray.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-09-23 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 26.6.2.1 [valarray.cons] says:
  </p>
  
  <blockquote>
! <pre>valarray(initializer_list&lt;T&gt; il);
  </pre>
! <blockquote>
  <i>Effects:</i> Same as <tt>valarray(il.begin(), il.end())</tt>.
! </blockquote>
  </blockquote>
  
  <p>
--- 77411,77433 ----
  
  
  <hr>
! <h3><a name="1208"></a>1208. <tt>valarray initializer_list</tt> constructor has incorrect effects</h3>
! <p><b>Section:</b> 26.6.2.2 [valarray.cons] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-09-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.cons">issues</a> in [valarray.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 26.6.2.2 [valarray.cons] says:
  </p>
  
  <blockquote>
! <pre>
! valarray(initializer_list&lt;T&gt; il);
  </pre>
! <blockquote><p>
  <i>Effects:</i> Same as <tt>valarray(il.begin(), il.end())</tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** But there is no <tt>valarray</tt> constr
*** 70324,70345 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 6 positive votes on c++std-lib.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.6.2.1 [valarray.cons]:
  </p>
  
  <blockquote>
! <pre>valarray(initializer_list&lt;T&gt; il);
  </pre>
! <blockquote>
  <i>Effects:</i> Same as <tt>valarray(il.begin(), il.<del>end</del><ins>size</ins>())</tt>.
! </blockquote>
  </blockquote>
  
  
--- 77439,77461 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 6 positive votes on c++std-lib.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.6.2.2 [valarray.cons]:
  </p>
  
  <blockquote>
! <pre>
! valarray(initializer_list&lt;T&gt; il);
  </pre>
! <blockquote><p>
  <i>Effects:</i> Same as <tt>valarray(il.begin(), il.<del>end</del><ins>size</ins>())</tt>.
! </p></blockquote>
  </blockquote>
  
  
*************** Change 26.6.2.1 [valarray.cons]:
*** 70347,70356 ****
  
  
  <hr>
! <h3><a name="1209"></a>1209. match_results should be moveable</h3>
! <p><b>Section:</b> 28.10.1 [re.results.const] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2009-09-15 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In Working Draft
--- 77463,77474 ----
  
  
  <hr>
! <h3><a name="1209"></a>1209. <tt>match_results</tt> should be moveable</h3>
! <p><b>Section:</b> 28.10.1 [re.results.const] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2009-09-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re.results.const">active issues</a> in [re.results.const].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results.const">issues</a> in [re.results.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In Working Draft
*************** should be moveable.
*** 70362,70368 ****
  
  <p>
  As far as I can tell, this isn't tracked by an active issue yet; Library
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#723">723</a> doesn't talk about <tt>match_results</tt>.
  </p>
  
  <p><i>[
--- 77480,77486 ----
  
  <p>
  As far as I can tell, this isn't tracked by an active issue yet; Library
! Issue <a href="lwg-defects.html#723">723</a> doesn't talk about <tt>match_results</tt>.
  </p>
  
  <p><i>[
*************** Issue <a href="http://www.open-std.org/j
*** 70383,70389 ****
  Add the following member declarations to 28.10 [re.results]/3:
  </p>
  
! <blockquote><pre>// 28.10.1, construct/copy/destroy:
  explicit match_results(const Allocator&amp; a = Allocator());
  match_results(const match_results&amp; m);
  <ins>match_results(match_results&amp;&amp; m);</ins>
--- 77501,77508 ----
  Add the following member declarations to 28.10 [re.results]/3:
  </p>
  
! <blockquote><pre>
! // 28.10.1, construct/copy/destroy:
  explicit match_results(const Allocator&amp; a = Allocator());
  match_results(const match_results&amp; m);
  <ins>match_results(match_results&amp;&amp; m);</ins>
*************** using the table numbering of
*** 70402,70416 ****
  </p>
  
  <blockquote>
! <pre>match_results(const match_results&amp; m);
  </pre>
  
! <blockquote>
  4 <i>Effects:</i> Constructs an object of class <tt>match_results</tt>, as a
  copy of <tt>m</tt>.
! </blockquote>
  
! <pre><ins>match_results(match_results&amp;&amp; m);</ins>
  </pre>
  
  <blockquote>
--- 77521,77537 ----
  </p>
  
  <blockquote>
! <pre>
! match_results(const match_results&amp; m);
  </pre>
  
! <blockquote><p>
  4 <i>Effects:</i> Constructs an object of class <tt>match_results</tt>, as a
  copy of <tt>m</tt>.
! </p></blockquote>
  
! <pre>
! <ins>match_results(match_results&amp;&amp; m);</ins>
  </pre>
  
  <blockquote>
*************** state.</ins>
*** 70427,70441 ****
  </p>
  </blockquote>
  
! <pre>match_results&amp; operator=(const match_results&amp; m);
  </pre>
  
! <blockquote>
  7 <i>Effects:</i> Assigns <tt>m</tt> to <tt>*this</tt>. The postconditions of this function are
  indicated in Table 131.
! </blockquote>
  
! <pre><ins>match_results&amp; operator=(match_results&amp;&amp; m);</ins>
  </pre>
  
  <blockquote>
--- 77548,77564 ----
  </p>
  </blockquote>
  
! <pre>
! match_results&amp; operator=(const match_results&amp; m);
  </pre>
  
! <blockquote><p>
  7 <i>Effects:</i> Assigns <tt>m</tt> to <tt>*this</tt>. The postconditions of this function are
  indicated in Table 131.
! </p></blockquote>
  
! <pre>
! <ins>match_results&amp; operator=(match_results&amp;&amp; m);</ins>
  </pre>
  
  <blockquote>
*************** a valid but unspecified state.</ins>
*** 70459,70472 ****
  
  
  <hr>
  <h3><a name="1216"></a>1216. LWG 1066 Incomplete?</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-09-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1066">1066</a> adds <tt>[[noreturn]]</tt> to a bunch of things.
  It doesn't add it to <tt>rethrow_nested()</tt>, which seems like an obvious
  candidate. I've made the changes indicated in the issue, and haven't
  changed <tt>rethrow_nested()</tt>.
--- 77582,78166 ----
  
  
  <hr>
+ <h3><a name="1210"></a>1210. Iterator reachability should not require a container</h3>
+ <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-18 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ p6 Iterator requirements 24.2 [iterator.requirements]
+ </p>
+ 
+ <blockquote><p>
+ An iterator <tt>j</tt> is called reachable from an iterator <tt>i</tt> if and only if
+ there is a finite sequence of applications of the expression <tt>++i</tt> that
+ makes <tt>i == j</tt>. If <tt>j</tt> is reachable from <tt>i</tt>, they refer to the same
+ container.
+ </p></blockquote>
+ 
+ <p>
+ A good example would be stream iterators, which do not refer to a
+ container.  Typically, the end iterator from a range of stream iterators
+ will compare equal for many such ranges.  I suggest striking the second
+ sentence.
+ </p>
+ 
+ <p>
+ An alternative wording might be:
+ </p>
+ 
+ <blockquote><p>
+ If <tt>j</tt> is reachable from <tt>i</tt>, and both <tt>i</tt> and
+ <tt>j</tt> are dereferencable iterators, then they refer to the same
+ range.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change 24.2 [iterator.requirements], p6:
+ </p>
+ 
+ <blockquote><p>
+ An iterator <tt>j</tt> is called <i>reachable</i> from an iterator
+ <tt>i</tt> if and only if there is a finite sequence of applications of
+ the expression <tt>++i</tt> that makes <tt>i == j</tt>. <del>If
+ <tt>j</tt> is reachable from <tt>i</tt>, they refer to the same
+ container.</del>
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1211"></a>1211. Move iterators should be restricted as input iterators</h3>
+ <p><b>Section:</b> 24.5.3.1 [move.iterator] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-18 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#move.iterator">issues</a> in [move.iterator].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ I contend that while we can support both bidirectional and random access
+ traversal, the category of a move iterator should never be better than
+ <tt>input_iterator_tag</tt>.
+ </p>
+ 
+ <p>
+ The contentious point is that you cannot truly have a multipass property
+ when values are moved from a range.  This is contentious if you view a
+ moved-from object as still holding a valid value within the range.  
+ </p>
+ 
+ <p>
+ The second reason comes from the Forward Iterator requirements table:
+ </p>
+ 
+ <blockquote>
+ <p>
+ Forward iterators 24.2.5 [forward.iterators]
+ </p>
+ 
+ <p>
+ Table 102 &mdash; Forward iterator requirements
+ </p>
+ 
+ <blockquote><p>
+ For expression <tt>*a</tt> the return type is:
+ "<tt>T&amp;</tt> if <tt>X</tt> is mutable, otherwise <tt>const T&amp;</tt>"
+ </p></blockquote>
+ </blockquote>
+ 
+ <p>
+ There is a similar constraint on <tt>a-&gt;m</tt>.
+ </p>
+ 
+ <p>
+ There is no support for rvalue references, nor do I believe their should
+ be.  Again, opinions may vary but either this table or the definition of
+ <tt>move_iterator</tt> need updating.
+ </p>
+ 
+ <p>
+ Note: this requirement probably need updating anyway if we wish to
+ support proxy iterators but I am waiting to see a new working paper
+ before filing that issue.
+ </p>
+ 
+ <p><i>[
+ 2009-10 post-Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Move to Open. Howard to put his rationale mentioned above into the issue
+ as a note.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10-26 Howard adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ <tt>vector::insert(pos, iter, iter)</tt> is significantly more effcient when
+ <tt>iter</tt> is a random access iterator, as compared to when it is an
+ input iterator.
+ </p>
+ 
+ <p>
+ When <tt>iter</tt> is an input iterator, the best algorithm
+ is to append the inserted range to the end of the <tt>vector</tt> using
+ <tt>push_back</tt>.  This may involve several reallocations before the input
+ range is exhausted.  After the append, then one can use <tt>std::rotate</tt>
+ to place the inserted range into the correct position in the vector.
+ </p>
+ 
+ <p>
+ But when <tt>iter</tt> is a random access iterator, the best algorithm
+ is to first compute the size of the range to be inserted (<tt>last - first</tt>),
+ do a buffer reallocation if necessary, scoot existing elements in the <tt>vector</tt>
+ down to make the "hole", and then insert the new elements directly to their correct
+ place.
+ </p>
+ 
+ <blockquote><p><b>
+ The insert-with-random-access-iterators algorithm is considerably more efficient
+ than the insert-with-input-iterators algorithm
+ </b></p></blockquote>
+ 
+ <p>
+ Now consider:
+ </p>
+ 
+ <blockquote><pre>
+ vector&lt;A&gt; v;
+ <span style="color:#C80000">//  ... build up a large vector of A ...</span>
+ vector&lt;A&gt; temp;
+ <span style="color:#C80000">//  ... build up a large temporary vector of A to later be inserted ...</span>
+ typedef move_iterator&lt;vector&lt;A&gt;::iterator&gt; MI;
+ <span style="color:#C80000">//  Now insert the temporary elements:</span>
+ v.insert(v.begin() + N, MI(temp.begin()), MI(temp.end()));
+ </pre></blockquote>
+ 
+ <p>
+ A major motivation for using <tt>move_iterator</tt> in the above example is the
+ expectation that <tt>A</tt> is cheap to move but expensive to copy.  I.e. the
+ customer is looking for <em>high performance</em>.  If we allow <tt>vector::insert</tt>
+ to subtract two <tt>MI</tt>'s to get the distance between them, the customer enjoys
+ substantially better performance, compared to if we say that <tt>vector::insert</tt>
+ can not subtract two <tt>MI</tt>'s.
+ </p>
+ 
+ <p>
+ I can find no rationale for not giving this performance boost to our customers.
+ Therefore I am strongly against restricting <tt>move_iterator</tt> to the
+ <tt>input_iterator_tag</tt> category.
+ </p>
+ 
+ <p>
+ I believe that the requirement that forward
+ iterators have a dereference that returns an lvalue reference to cause unacceptable
+ pessimization.  For example <tt>vector&lt;bool&gt;::iterator</tt> also does not return
+ a <tt>bool&amp;</tt> on dereference.  Yet I am not aware of a single vendor that
+ is willing to ship <tt>vector&lt;bool&gt;::iterator</tt> as an input iterator.
+ Everyone classifies it as a random access iterator.  Not only does this not
+ cause any problems, it prevents significant performance problems.
+ </p>
+ 
+ </blockquote>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Class template move_iterator 24.5.3.1 [move.iterator]
+ </p>
+ 
+ <blockquote><pre>
+ namespace std {
+ template &lt;class Iterator&gt;
+ class move_iterator {
+ public:
+  ...
+  typedef <del>typename iterator_traits&lt;Iterator&gt;::iterator_category</del> <ins>input_iterator_tag</ins> iterator_category;
+ </pre></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1212"></a>1212. result of post-increment/decrement operator</h3>
+ <p><b>Section:</b> 24.2 [iterator.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-09-18 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#iterator.requirements">issues</a> in [iterator.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Forward iterator and bidirectional iterator place different requirements on the result of post-increment/decrement operator.  
+ The same form should be used in each case.
+ </p>
+ 
+ <p>
+ Merging row from:
+ </p>
+ 
+ <blockquote><pre>
+ Table 102 -- Forward iterator requirements
+ Table 103 -- Bidirectional iterator requirements
+ 
+     r++ : convertible to const X&amp;
+     r-- : convertible to const X&amp;
+     
+     *r++ : T&amp; if X is mutable, otherwise const T&amp;
+     *r-- : convertible to T
+ </pre></blockquote>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1214"></a>1214. Insufficient/inconsistent key immutability requirements for  associative containers</h3>
+ <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-09-20 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Scott Meyers' mentions on a recent posting on <a
+ href="http://groups.google.de/group/comp.std.c++/msg/6f9160fc428bcbea">c.s.c++</a>
+ some arguments that point to an incomplete resolution
+ of <a href="lwg-defects.html#103">103</a> and to an inconsistency of requirements on keys in ordered and
+ unordered associative
+ containers:
+ </p>
+ 
+ <blockquote>
+ <p>
+ 1) <a href="lwg-defects.html#103">103</a> introduced the term immutable without defining it in a unique manner in
+ 23.2.4 [associative.reqmts]/5:
+ </p>
+ 
+ <blockquote><p>
+ [..] Keys in an associative container are immutable.
+ </p></blockquote>
+ 
+ <p>
+ According to conventional dictionaries immutable is an unconditional way of
+ saying that something cannot be changed. So without any further explicit
+ allowance a user <em>always</em> runs into undefined behavior if (s)he attempts
+ to modify such a key. IMO this was not the intend of the committee to resolve
+ <a href="lwg-defects.html#103">103</a> in that way because the comments suggest an interpretation that
+ should give any user the freedom to modify the key in an <em>explicit</em> way
+ <em>provided</em> it would not affect the sort order in that container.
+ </p>
+ 
+ <p>
+ 2) Another observation was that surprisingly no similar 'safety guards'
+ exists against unintentional key changes for the unordered associative
+ containers, specifically there is no such requirement as in
+ 23.2.4 [associative.reqmts]/6 that "both <tt>iterator</tt> and <tt>const_iterator</tt> are constant
+ iterators". But the need for such protection against unintentional
+ changes as well as the constraints in which manner any explicit
+ changes may be performed are both missing and necessary, because
+ such changes could potentially change the <em>equivalence</em> of keys that
+ is measured by the <tt>hasher</tt> and <tt>key_equal</tt>.
+ </p>
+ 
+ <p>
+ I suggest to fix the unconditional wording involved with "immutable keys"
+ by at least adding a hint for the reader that users <em>may</em> perform such
+ changes in an explicit manner <em>and</em> to perform similar wording changes
+ as <a href="lwg-defects.html#103">103</a> did for the ordered associative containers also for the unordered
+ containers.
+ </p>
+ </blockquote>
+ 
+ <p><i>[
+ 2010-03-27 Daniel provides wording.
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ This update attempts to provide normative wording that harmonizes the key and
+ function object constraints of associative and unordered containers.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Batavia:
+ ]</i></p>
+ 
+ 
+ <p>
+ We're uncomfortable with the first agenda item, and we can live with the second agenda 
+ item being applied before or after Madrid. 
+ </p>
+ 
+ <p><i>[
+ 2011 Bloomington
+ ]</i></p>
+ 
+ 
+ <p>
+ Further discussion persuades us this issue is Ready (and so moved).
+ We may need a further issue clarifying the notion of key <i>value</i>
+ vs. key <i>object</i>, as object identity appears to be important
+ to this wording.
+ </p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li>
+ <p>
+ Change 23.2.4 [associative.reqmts]/2 as indicated: <i>[This ensures that
+ associative containers make better clear what this "arbitrary" type is, as the
+ unordered containers do in 23.2.5 [unord.req]/3]</i>
+ </p>
+ 
+ <blockquote><p>
+ 2 Each associative container is parameterized on <tt>Key</tt> and an ordering
+ relation <tt>Compare</tt> that induces a strict weak ordering (25.4) on elements
+ of <tt>Key</tt>. In addition, <tt>map</tt> and <tt>multimap</tt> associate an
+ arbitrary <ins><em>mapped type</em></ins><del>type</del> <tt>T</tt> with the
+ <tt>Key</tt>. The object of type <tt>Compare</tt> is called the <em>comparison
+ object</em> of a container.
+ </p></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Change 23.2.4 [associative.reqmts]/5 as indicated: <i>[This removes the
+ too strong requirement that keys must not be changed at all and brings this line
+ in sync with 23.2.5 [unord.req]/7. We take care about the real
+ constraints by the remaining suggested changes. The rationale provided by LWG
+ <a href="lwg-defects.html#103">103</a> didn't really argue why that addition is necessary, and I
+ believe the remaining additions make it clear that any user changes have strong
+ restrictions]</i>:
+ </p>
+ 
+ <blockquote><p>
+ 5 For <tt>set</tt> and <tt>multiset</tt> the value type is the same as the key
+ type. For <tt>map</tt> and <tt>multimap</tt> it is equal to <tt>pair&lt;const
+ Key, T&gt;</tt>. <del>Keys in an associative container are immutable.</del>
+ </p></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Change 23.2.5 [unord.req]/3+4 as indicated: <i>[The current sentence of
+ p.4 has doesn't say something really new and this whole subclause misses to
+ define the concepts of the container-specific hasher <i>object</i> and predicate
+ <i>object</i>. We introduce the term <em>key equality predicate</em> which is
+ already used in the requirements table. This change does not really correct part
+ of this issue, but is recommended to better clarify the nomenclature and the
+ difference between the function objects and the function object <em>types</em>,
+ which is important, because both can potentially be stateful.]</i>
+ </p>
+ 
+ <blockquote>
+ <p>
+ 3 Each unordered associative container is parameterized by <tt>Key</tt>, by a
+ function object type <tt>Hash</tt> that meets the <tt>Hash</tt> requirements
+ (20.2.4) and acts as a hash function for argument values of type <tt>Key</tt>,
+ and by a binary predicate <tt>Pred</tt> that induces an equivalence relation on
+ values of type <tt>Key</tt>. Additionally, <tt>unordered_map</tt> and
+ <tt>unordered_multimap</tt> associate an arbitrary <em>mapped type</em>
+ <tt>T</tt> with the <tt>Key</tt>.
+ </p>
+ 
+ <p>
+ 4 <ins>The container's object of type <tt>Hash</tt> - denoted by
+ <tt>hash</tt> - is called the <em>hash function</em> of the container.
+ The container's object of type <tt>Pred</tt> - denoted by
+ <tt>pred</tt> - is called the <em>key equality predicate</em> of the
+ container.</ins><del>A hash function is a function object that takes a single
+ argument of type <tt>Key</tt> and returns a value of type
+ <tt>std::size_t</tt></del>.
+ </p>
+ </blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Change 23.2.5 [unord.req]/5 as indicated: <i>[This adds a similar
+ safe-guard as the last sentence of 23.2.4 [associative.reqmts]/3]</i>
+ </p>
+ 
+ <blockquote><p>
+ 5 Two values <tt>k1</tt> and <tt>k2</tt> of type <tt>Key</tt> are considered
+ equivalent if the container's <ins>key equality
+ predicate</ins><del><tt>key_equal</tt> function object</del> returns
+ <tt>true</tt> when passed those values. If <tt>k1</tt> and <tt>k2</tt> are
+ equivalent, the <ins>container's</ins> hash function shall return the same value
+ for both. [<i>Note:</i> thus, when an unordered associative container is
+ instantiated with a non-default <tt>Pred</tt> parameter it usually needs a
+ non-default <tt>Hash</tt> parameter as well. &mdash; <i>end note</i>] <ins>For
+ any two keys <tt>k1</tt> and <tt>k2</tt> in the same container, calling
+ <tt>pred(k1, k2)</tt> shall always return the same value. For any key <tt>k</tt>
+ in a container, calling <tt>hash(k)</tt> shall always return the same
+ value.</ins>
+ </p></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ After 23.2.5 [unord.req]/7 add the following new paragraph: <i>[This
+ ensures the same level of compile-time protection that we already require for
+ associative containers. It is necessary for similar reasons, because any change
+ in the stored key which would change it's equality relation to others or would
+ change it's hash value such that it would no longer fall in the same bucket,
+ would break the container invariants]</i>
+ </p>
+ 
+ <blockquote>
+ <p>
+ 7 For <tt>unordered_set</tt> and <tt>unordered_multiset</tt> the value type is
+ the same as the key type. For <tt>unordered_map</tt> and
+ <tt>unordered_multimap</tt> it is <tt>std::pair&lt;const Key, T&gt;</tt>.
+ </p>
+ <p>
+ <ins>For unordered containers where the value type is the same as the key type,
+ both <tt>iterator</tt> and <tt>const_iterator</tt> are constant iterators. It is
+ unspecified whether or not <tt>iterator</tt> and <tt>const_iterator</tt> are the
+ same type. [<i>Note:</i> <tt>iterator</tt> and <tt>const_iterator</tt> have
+ identical semantics in this case, and <tt>iterator</tt> is convertible to
+ <tt>const_iterator</tt>. Users can avoid violating the One Definition Rule by
+ always using <tt>const_iterator</tt> in their function parameter lists. &mdash;
+ <i>end note</i>]</ins>
+ </p>
+ </blockquote>
+ </li>
+ 
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1215"></a>1215. <tt>list::merge</tt> with unequal allocators</h3>
+ <p><b>Section:</b> 23.3.5.5 [list.ops] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-09-24 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ In Bellevue (I think), we passed
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2525.pdf">N2525</a>,
+ which, among other things, specifies that the behavior of
+ <tt>list::splice</tt> is undefined if the allocators of the two lists
+ being spliced do not compare equal. The same rationale should apply to
+ <tt>list::merge</tt>. The intent of <tt>list::merge</tt> (AFAIK) is to
+ move nodes from one sorted <tt>list</tt> into another sorted
+ <tt>list</tt> without copying the elements. This is possible only if the
+ allocators compare equal.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Relative to the August 2009 WP,
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2857.pdf">N2857</a>,
+ change 23.3.5.5 [list.ops],
+ paragraphs 22-25 as follows:
+ </p>
+ 
+ <blockquote>
+ <pre>
+ void merge(list&amp;&amp; x);
+ template &lt;class Compare&gt; void merge(list&amp;&amp; x, Compare comp);
+ </pre>
+ <blockquote>
+ <p>
+ <i>Requires</i>: both the list and the argument list shall be sorted
+ according to operator&lt; or comp.
+ </p>
+ <p>
+ <i>Effects</i>: If <tt>(&amp;x == this)</tt> does nothing; otherwise, merges the
+ two sorted ranges <tt>[begin(), end())</tt> and <tt>[x.begin(),
+ x.end())</tt>. The result is a range in which the elements will be
+ sorted in non-decreasing order according to the ordering defined by
+ <tt>comp</tt>; that is, for every iterator <tt>i</tt>, in the range other than the
+ <tt>first</tt>, the condition <tt>comp(*i, *(i - 1)<ins>)</ins></tt> will be
+ <tt>false</tt>.
+ </p>
+ <p>
+ <i>Remarks</i>: Stable. If <tt>(&amp;x != this)</tt> the range <tt>[x.begin(), x.end())</tt> is
+ empty after the merge. <ins>No elements are copied by this operation.
+ The behavior is undefined if <tt>this-&gt;get_allocator() !=
+ x.get_allocator()</tt>.</ins>
+ </p>
+ <p>
+ <i>Complexity</i>: At most <tt>size() + x.size() - 1</tt> applications of <tt>comp</tt>
+ if <tt>(&amp;x != this)</tt>; otherwise, no applications of <tt>comp</tt> are performed. If an
+ exception is thrown other than by a comparison there are no effects.
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1216"></a>1216. LWG 1066 Incomplete?</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2009-09-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#except.nested">active issues</a> in [except.nested].</p>
! <p><b>View all other</b> <a href="lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! LWG <a href="lwg-defects.html#1066">1066</a> adds <tt>[[noreturn]]</tt> to a bunch of things.
  It doesn't add it to <tt>rethrow_nested()</tt>, which seems like an obvious
  candidate. I've made the changes indicated in the issue, and haven't
  changed <tt>rethrow_nested()</tt>.
*************** changed <tt>rethrow_nested()</tt>.
*** 70477,70485 ****
  ]</i></p>
  
  
! <blockquote>
  Move to Ready.
! </blockquote>
  
  
  
--- 78171,78179 ----
  ]</i></p>
  
  
! <blockquote><p>
  Move to Ready.
! </p></blockquote>
  
  
  
*************** Add <tt>[[noreturn]]</tt> to <tt>rethrow
*** 70494,70503 ****
  
  <hr>
  <h3><a name="1218"></a>1218. mutex destructor synchronization</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  If an object <tt>*o</tt> contains a mutex <tt>mu</tt> and a
--- 78188,78198 ----
  
  <hr>
  <h3><a name="1218"></a>1218. mutex destructor synchronization</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  If an object <tt>*o</tt> contains a mutex <tt>mu</tt> and a
*************** correctly-maintained reference count <tt
*** 70505,70511 ****
  safe?
  </p>
  
! <blockquote><pre>o-&gt;mu.lock();
  bool del = (--(o-&gt;c) == 0);
  o-&gt;mu.unlock();
  if (del) { delete o; }
--- 78200,78207 ----
  safe?
  </p>
  
! <blockquote><pre>
! o-&gt;mu.lock();
  bool del = (--(o-&gt;c) == 0);
  o-&gt;mu.unlock();
  if (del) { delete o; }
*************** observe that it is no longer in use, unl
*** 70544,70550 ****
  required to handle such scenarios correctly, as long as thread <tt>A</tt>
  doesn't access the mutex after the unlock call returns. These cases typically
  occur when a reference-counted object contains a mutex that is used to protect
! the reference count. — <i>end note</i>]
  </ins></p>
  </blockquote>
  </li>
--- 78240,78246 ----
  required to handle such scenarios correctly, as long as thread <tt>A</tt>
  doesn't access the mutex after the unlock call returns. These cases typically
  occur when a reference-counted object contains a mutex that is used to protect
! the reference count. &mdash; <i>end note</i>]
  </ins></p>
  </blockquote>
  </li>
*************** the reference count. — <i>end note</i>]
*** 70556,70566 ****
  
  
  <hr>
! <h3><a name="1220"></a>1220. What does condition_variable wait on?</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  "Class <tt>condition_variable</tt> provides a condition variable that can only
--- 78252,78262 ----
  
  
  <hr>
! <h3><a name="1220"></a>1220. What does <tt>condition_variable</tt> wait on?</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  "Class <tt>condition_variable</tt> provides a condition variable that can only
*************** wait on an object of type <tt>unique_loc
*** 70573,70581 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  
  
--- 78269,78277 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  
  
*************** Moved to Tentatively Ready after 5 posit
*** 70584,70590 ****
  Change 30.5 [thread.condition], p1:
  </p>
  
! <blockquote>
  Condition variables provide synchronization primitives used to block a
  thread until notified by some other thread that some condition is met or
  until a system time is reached. Class <tt>condition_variable</tt>
--- 78280,78286 ----
  Change 30.5 [thread.condition], p1:
  </p>
  
! <blockquote><p>
  Condition variables provide synchronization primitives used to block a
  thread until notified by some other thread that some condition is met or
  until a system time is reached. Class <tt>condition_variable</tt>
*************** provides a condition variable that can o
*** 70593,70626 ****
  efficiency on some platforms. Class <tt>condition_variable_any</tt>
  provides a general condition variable that can wait on objects of
  user-supplied lock types.
! </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1221"></a>1221. condition_variable wording</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.1 [thread.condition.condvar] says:
  </p>
  
  <blockquote>
! <pre>~condition_variable();
  </pre>
! <blockquote>
  <i>Precondition:</i> There shall be no thread blocked on <tt>*this</tt>.
  [<i>Note:</i> That is, all threads shall have been notified; they may
  subsequently block on the lock specified in the wait. Beware that
  destroying a <tt>condition_variable</tt> object while the corresponding
  predicate is <tt>false</tt> is likely to lead to undefined behavior.
! — <i>end note</i>]
! </blockquote>
  </blockquote>
  
  <p>
--- 78289,78323 ----
  efficiency on some platforms. Class <tt>condition_variable_any</tt>
  provides a general condition variable that can wait on objects of
  user-supplied lock types.
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1221"></a>1221. <tt>condition_variable</tt> wording</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.1 [thread.condition.condvar] says:
  </p>
  
  <blockquote>
! <pre>
! ~condition_variable();
  </pre>
! <blockquote><p>
  <i>Precondition:</i> There shall be no thread blocked on <tt>*this</tt>.
  [<i>Note:</i> That is, all threads shall have been notified; they may
  subsequently block on the lock specified in the wait. Beware that
  destroying a <tt>condition_variable</tt> object while the corresponding
  predicate is <tt>false</tt> is likely to lead to undefined behavior.
! &mdash; <i>end note</i>]
! </p></blockquote>
  </blockquote>
  
  <p>
*************** Modify 30.5.1 [thread.condition.condvar]
*** 70647,70653 ****
  
  <blockquote>
  <pre>~condition_variable();</pre>
! <blockquote>
  4 <i>Precondition:</i> There shall be no thread blocked on <tt>*this</tt>.
  [<i>Note:</i> That is, all threads shall have been notified; they may
  subsequently block on the lock specified in the wait. <del>Beware that
--- 78344,78350 ----
  
  <blockquote>
  <pre>~condition_variable();</pre>
! <blockquote><p>
  4 <i>Precondition:</i> There shall be no thread blocked on <tt>*this</tt>.
  [<i>Note:</i> That is, all threads shall have been notified; they may
  subsequently block on the lock specified in the wait. <del>Beware that
*************** predicate is false is likely to lead to
*** 70656,70664 ****
  must take care to ensure that no threads wait on <tt>*this</tt> once the
  destructor has been started, especially when the waiting threads are calling the
  wait functions in a loop or using the overloads of <tt>wait</tt>,
! <tt>wait_for</tt> or <tt>wait_until</tt> that take a predicate.</ins> —
  <i>end note</i>]
! </blockquote>
  </blockquote>
  
  
--- 78353,78361 ----
  must take care to ensure that no threads wait on <tt>*this</tt> once the
  destructor has been started, especially when the waiting threads are calling the
  wait functions in a loop or using the overloads of <tt>wait</tt>,
! <tt>wait_for</tt> or <tt>wait_until</tt> that take a predicate.</ins> &mdash;
  <i>end note</i>]
! </p></blockquote>
  </blockquote>
  
  
*************** wait functions in a loop or using the ov
*** 70667,70683 ****
  
  <hr>
  <h3><a name="1222"></a>1222. condition_variable incorrect effects for exception safety</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.1 [thread.condition.condvar] says:
  </p>
  
  <blockquote>
! <pre>void wait(unique_lock&lt;mutex&gt;&amp; lock);
  </pre>
  <blockquote>
  <p>...</p>
--- 78364,78381 ----
  
  <hr>
  <h3><a name="1222"></a>1222. condition_variable incorrect effects for exception safety</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2009-09-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.1 [thread.condition.condvar] says:
  </p>
  
  <blockquote>
! <pre>
! void wait(unique_lock&lt;mutex&gt;&amp; lock);
  </pre>
  <blockquote>
  <p>...</p>
*************** Change 30.5.1 [thread.condition.condvar]
*** 70711,70717 ****
  </p>
  
  <blockquote>
! <pre>void wait(unique_lock&lt;mutex&gt;&amp; lock);
  </pre>
  <blockquote>
  <p>...</p>
--- 78409,78416 ----
  </p>
  
  <blockquote>
! <pre>
! void wait(unique_lock&lt;mutex&gt;&amp; lock);
  </pre>
  <blockquote>
  <p>...</p>
*************** p8 and p13.
*** 70739,70752 ****
  
  
  <hr>
  <h3><a name="1227"></a>1227. <tt>&lt;bitset&gt;</tt> synopsis overspecified</h3>
! <p><b>Section:</b> 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2009-10-05 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The resolutions to some library defect reports, like <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1178">1178</a>
  requires that <tt>#includes</tt> in each synopsis should be taken
  literally. This means that the <tt>&lt;bitset&gt;</tt> header now
  <em>must</em> include <tt>&lt;stdexcept&gt;</tt>, even though none of the
--- 78438,78815 ----
  
  
  <hr>
+ <h3><a name="1225"></a>1225. C++0x <tt>result_of</tt> issue </h3>
+ <p><b>Section:</b> X [func.ret] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Sebastian Gesemann <b>Opened:</b> 2009-10-05 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#func.ret">issues</a> in [func.ret].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ I think the text about <tt>std::result_of</tt> could be a little more precise.
+ Quoting from
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>...
+ </p>
+ 
+ <blockquote>
+ <p>
+ X [func.ret] Function object return types
+ </p>
+ 
+ <pre>
+ template&lt;class&gt; class result_of;
+ 
+ template&lt;class Fn, class... ArgTypes&gt;
+ class result_of&lt;Fn(ArgTypes...)&gt; {
+ public:
+   typedef <i>see below</i> type;
+ };
+ </pre>
+ 
+ <p>
+ Given an rvalue <tt>fn</tt> of type <tt>Fn</tt> and values <tt>t1, t2,
+ ..., tN</tt> of types <tt>T1, T2, ... TN</tt> in <tt>ArgTypes</tt>
+ respectivly, the <tt>type</tt> member is the result type of the
+ expression <tt>fn(t1,t2,...,tN)</tt>. the values <tt>ti</tt> are lvalues
+ when the corresponding type <tt>Ti</tt> is an lvalue-reference type, and
+ rvalues otherwise.
+ </p>
+ </blockquote>
+ 
+ <p>
+ This text doesn't seem to consider lvalue reference types for <tt>Fn</tt>.
+ Also, it's not clear whether this class template can be used for
+ "SFINAE" like <tt>std::enable_if</tt>. Example:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;typename Fn, typename... Args&gt;
+ typename std::result_of&lt;Fn(Args...)&gt;::type
+ apply(Fn &amp;&amp; fn, Args &amp;&amp; ...args)
+ {
+   // Fn may be an lvalue reference, too
+   return std::forward&lt;Fn&gt;(fn)(std::forward&lt;Args&gt;(args)...);
+ }
+ </pre></blockquote>
+ 
+ <p>
+ Either <tt>std::result_of&lt;...&gt;</tt> can be instantiated and simply may not have
+ a typedef "<tt>type</tt>" (--&gt;SFINAE) or instantiating the class template for
+ some type combinations will be a "hard" compile-time error.
+ </p>
+ 
+ <p><i>[
+ 2010-02-14 Daniel adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ This issue should be considered resolved by <a href="lwg-defects.html#1255">1255</a> and <a href="lwg-defects.html#1270">1270</a>.  The wish to change <tt>result_of</tt> into a compiler-support
+ trait was beyond the actual intention of the submitter Sebastian.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>, rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by <a href="lwg-defects.html#1270">1270</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <p><i>[
+ These changes will require compiler support
+ ]</i></p>
+ 
+ 
+ <p>
+ Change X [func.ret]:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;class&gt; class result_of; // <i>undefined</i>
+ 
+ template&lt;class Fn, class... ArgTypes&gt;
+ class result_of&lt;Fn(ArgTypes...)&gt; {
+ public:
+   <del>typedef</del> <i>see below</i> <del>type;</del>
+ };
+ </pre>
+ 
+ <p><del>
+ Given an rvalue <tt>fn</tt> of type <tt>Fn</tt> and values <tt>t1, t2,
+ ..., tN</tt> of types <tt>T1, T2, ... TN</tt> in <tt>ArgTypes</tt>
+ respectivly, the <tt>type</tt> member is the result type of the
+ expression <tt>fn(t1,t2,...,tN)</tt>. the values <tt>ti</tt> are lvalues
+ when the corresponding type <tt>Ti</tt> is an lvalue-reference type, and
+ rvalues otherwise.
+ </del></p>
+ 
+ <p>
+ <ins>The class template <tt>result_of</tt> shall meet the requirements of a
+ <i>TransformationTrait</i>: Given the types <tt>Fn</tt>, <tt>T1</tt>, <tt>T2</tt>, ..., <tt>TN</tt> every
+ template specialization <tt>result_of&lt;Fn(T1,T2,...,TN)&gt;</tt> shall define the
+ member typedef type equivalent to <tt>decltype(<i>RE</i>)</tt> if and only if
+ the expression <tt><i>RE</i></tt>
+ </ins></p>
+ 
+ <blockquote><pre><ins>
+ value&lt;Fn&gt;() ( value&lt;T1&gt;(), value&lt;T2&gt;(), ... value&lt;TN&gt;()  )
+ </ins></pre></blockquote>
+ 
+ <p><ins>
+ would be well-formed. Otherwise, there shall be no member typedef
+ <tt>type</tt> defined.
+ </ins></p>
+ 
+ </blockquote>
+  
+ <p><i>[
+ The <tt>value&lt;&gt;</tt> helper function is a utility Daniel Kr&uuml;gler
+ proposed in
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2958.html">N2958</a>.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1226"></a>1226. Incomplete changes of #890</h3>
+ <p><b>Section:</b> 30.6.2 [futures.errors] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-10-05 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ Defect issue <a href="lwg-defects.html#890">890</a> overlooked to adapt the <tt>future_category</tt> from
+ 30.6.1 [futures.overview] and 30.6.2 [futures.errors]:
+ </p>
+ 
+ <blockquote><pre>
+ extern const error_category* const future_category;
+ </pre></blockquote>
+ 
+ <p>
+ which should be similarly transformed into function form.
+ </p>
+ 
+ <p><i>[
+ 2009-10-27 Howard:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to Tentatively Ready after 5 positive votes on c++std-lib.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-11-11 Daniel adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ I just observe that the proposed resolution of this issue
+ is incomplete and needs to reworded. The problem is that the
+ corresponding declarations
+ </p>
+ 
+ <blockquote><pre>
+ constexpr error_code make_error_code(future_errc e);
+ constexpr error_condition make_error_condition(future_errc e);
+ </pre></blockquote>
+ 
+ <p>
+ as constexpr functions are incompatible to the requirements of constexpr
+ functions given their specified implementation. Note that the incompatibility
+ is <em>not</em> a result of the modifications proposed by the issue resolution,
+ but already existed within the
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>
+ state where we have
+ </p>
+ 
+ <blockquote><pre>
+ extern const error_category* const future_category;
+ </pre></blockquote>
+ 
+ <p>
+ combined with
+ </p>
+ 
+ <blockquote><pre>
+ constexpr error_code make_error_code(future_errc e);
+ </pre>
+ <blockquote><p>
+ 3 <i>Returns:</i> <tt>error_code(static_cast&lt;int&gt;(e), *future_category)</tt>.
+ </p></blockquote>
+ 
+ <pre>
+ constexpr error_code make_error_condition(future_errc e);
+ </pre>
+ <blockquote><p>
+ 4 <i>Returns:</i> <tt>error_condition(static_cast&lt;int&gt;(e), *future_category)</tt>.
+ </p></blockquote>
+ </blockquote>
+ 
+ <p>
+ Neither is any of the constructors of <tt>error_code</tt> and <tt>error_condition</tt>
+ constexpr, nor does the expression <tt>*future_category</tt> satisfy the
+ requirements for a constant expression (5.20 [expr.const]/2 bullet 6 in
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>).
+ </p>
+ 
+ <p>
+ The simple solution is just to remove the constexpr qualifiers for both
+ functions, which makes sense, because none of the remaining <tt>make_error_*</tt>
+ overloads in the library is constexpr. One might consider to realize that
+ those <tt>make_*</tt> functions could satisfy the constexpr requirements, but this
+ looks not like an easy task to me, because it would need to rely on a not
+ yet existing language feature. If such a change is wanted, a new issue
+ should be opened after the language extension approval (if at all) [1].
+ </p>
+ 
+ <p>
+ If no-one complaints I would like to ask Howard to add the following
+ modifications to this issue, alternatively a new issue could be opened but I
+ don't know what the best solution is that would cause as little overhead
+ as possible.
+ </p>
+ <p>
+ What-ever the route is, the following is my proposed resolution for this issue
+ interaction part of the story:
+ </p>
+ 
+ <blockquote>
+ <p>
+ In 30.6.1 [futures.overview]/1, Header <tt>&lt;future&gt;</tt> synopsis <em>and</em>
+ in 30.6.2 [futures.errors]/3+4
+ change as indicated:
+ </p>
+ 
+ <blockquote><pre>
+ <del>constexpr</del> error_code make_error_code(future_errc e);
+ <del>constexpr</del> error_condition make_error_condition(future_errc e);
+ </pre></blockquote>
+ </blockquote>
+ 
+ <p>
+ [1] Let me add that we have a related  NAD issue here: <a href="lwg-closed.html#832">832</a>
+ so the chances for realization are little IMO.
+ </p>
+ 
+ <p><i>[
+ Howard: I've updated the proposed wording as Daniel suggests and set to Review.
+ ]</i></p>
+ 
+ </blockquote>
+ 
+ <p><i>[
+ 2009-11-13 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li>
+ <p>
+ Change in 30.6.1 [futures.overview], header <tt>&lt;future&gt;</tt> synopsis:
+ </p>
+ 
+ <blockquote><pre>
+ <del>extern</del> const error_category<ins>&amp;</ins><del>* const</del> future_category<ins>()</ins>;
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ In 30.6.1 [futures.overview]/1, Header <tt>&lt;future&gt;</tt> synopsis 
+ change as indicated:
+ </p>
+ 
+ <blockquote><pre>
+ <del>constexpr</del> error_code make_error_code(future_errc e);
+ <del>constexpr</del> error_condition make_error_condition(future_errc e);
+ </pre></blockquote>
+ </li>
+ 
+ <li>
+ <p>
+ Change in 30.6.2 [futures.errors]:
+ </p>
+ 
+ <blockquote><pre>
+ <del>extern</del> const error_category<ins>&amp;</ins><del>* const</del> future_category<ins>()</ins>;
+ </pre>
+ 
+ <blockquote>
+ <p>
+ <del>1- <tt>future_category</tt> shall point to a statically initialized object
+ of a type derived from class <tt>error_category</tt>.</del>
+ </p>
+ <p>
+ <ins>1- <i>Returns:</i> A reference to an object of a type
+ derived from class <tt>error_category</tt>.</ins>
+ </p>
+ </blockquote>
+ 
+ <pre>
+ <del>constexpr</del> error_code make_error_code(future_errc e);
+ </pre>
+ 
+ <blockquote><p>
+ 3 <i>Returns:</i> <tt>error_code(static_cast&lt;int&gt;(e),
+ <del>*</del>future_category<ins>()</ins>)</tt>.
+ </p></blockquote>
+ 
+ <pre>
+ <del>constexpr</del> error_<del>code</del><ins>condition</ins> make_error_condition(future_errc e);
+ </pre>
+ 
+ <blockquote><p>
+ 4 <i>Returns:</i> <tt>error_condition(static_cast&lt;int&gt;(e),
+ <del>*</del>future_category<ins>()</ins>)</tt>.
+ </p></blockquote>
+ </blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1227"></a>1227. <tt>&lt;bitset&gt;</tt> synopsis overspecified</h3>
! <p><b>Section:</b> 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2009-10-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The resolutions to some library defect reports, like <a href="lwg-defects.html#1178">1178</a>
  requires that <tt>#includes</tt> in each synopsis should be taken
  literally. This means that the <tt>&lt;bitset&gt;</tt> header now
  <em>must</em> include <tt>&lt;stdexcept&gt;</tt>, even though none of the
*************** I propose that <tt>&lt;stdexcept&gt;</tt
*** 70769,70786 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.5 [template.bitset]:
  </p>
  
! <blockquote><pre>#include &lt;cstddef&gt;        // for size_t
  #include &lt;string&gt;
  <del>#include &lt;stdexcept&gt;      // for invalid_argument,</del>
                            <del>// out_of_range, overflow_error</del>
--- 78832,78850 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.6 [template.bitset]:
  </p>
  
! <blockquote><pre>
! #include &lt;cstddef&gt;        // for size_t
  #include &lt;string&gt;
  <del>#include &lt;stdexcept&gt;      // for invalid_argument,</del>
                            <del>// out_of_range, overflow_error</del>
*************** namespace std {
*** 70794,70816 ****
  
  
  <hr>
  <h3><a name="1231"></a>1231. <tt>weak_ptr</tt> comparisons incompletely resolved</h3>
! <p><b>Section:</b> 20.9.10.3.5 [util.smartptr.weak.obs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-10-10 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2637.pdf">n2637</a>
! paper suggested several updates of the ordering semantics of
! <tt>shared_ptr</tt>
  and <tt>weak_ptr</tt>, among those the explicit comparison operators of <tt>weak_ptr</tt> were
! removed/deleted, instead a corresponding functor <tt>owner_less</tt> was added.
! The problem
! is that
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2637.pdf">n2637</a>
! did not clearly enough specify, how the previous wording
! parts describing
  the comparison semantics of <tt>weak_ptr</tt> should be removed.
  </p>
  
--- 78858,79066 ----
  
  
  <hr>
+ <h3><a name="1229"></a>1229. <tt>error_code operator=</tt> typo</h3>
+ <p><b>Section:</b> 19.5.2.3 [syserr.errcode.modifiers] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2009-10-08 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>
+ 19.5.2.1 [syserr.errcode.overview] and 19.5.2.3 [syserr.errcode.modifiers] say:
+ </p>
+ 
+ <blockquote><pre> 
+ template &lt;class ErrorCodeEnum&gt;
+   typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value&gt;::type&amp;
+     operator=(ErrorCodeEnum e);
+ </pre></blockquote>
+ 
+ <p>
+ They should say:
+ </p>
+ 
+ <blockquote><pre> 
+ template &lt;class ErrorCodeEnum&gt;
+   typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value, error_code&gt;::type&amp;
+     operator=(ErrorCodeEnum e);
+ </pre></blockquote>
+ 
+ <p>
+ Or (I prefer this form):
+ </p>
+  
+ <blockquote><pre> 
+ template &lt;class ErrorCodeEnum&gt;
+   typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value, error_code&amp;&gt;::type
+     operator=(ErrorCodeEnum e);
+ </pre></blockquote>
+ 
+ <p>
+ This is because <tt>enable_if</tt> is declared as (20.10.7.6 [meta.trans.other]):
+ </p>
+  
+ <blockquote><pre> 
+ template &lt;bool B, class T = void&gt; struct enable_if;
+ </pre></blockquote>
+ 
+ <p>
+ So, the current wording makes <tt>operator=</tt> return
+ <tt>void&amp;</tt>, which is not good.
+ </p>
+ 
+ <p> 
+ 19.5.2.3 [syserr.errcode.modifiers]/4 says
+ </p>
+ 
+ <blockquote><p>
+ <i>Returns:</i> <tt>*this</tt>.
+ </p></blockquote>
+ <p>
+ which is correct.
+ </p>
+ 
+ <p>
+ Additionally,
+ </p>
+ 
+ <p>
+ 19.5.3.1 [syserr.errcondition.overview]/1 says:
+ </p>
+  
+ <blockquote><pre> 
+ template&lt;typename ErrorConditionEnum&gt;
+   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;, error_code&gt;::type &amp;
+     operator=( ErrorConditionEnum e );
+ </pre></blockquote>
+ 
+ <p>
+ Which contains several problems (<tt>typename</tt> versus <tt>class</tt>
+ inconsistency, lack of <tt>::value</tt>, <tt>error_code</tt> instead of
+ <tt>error_condition</tt>), while 19.5.3.3 [syserr.errcondition.modifiers] says:
+ </p>
+  
+ <blockquote><pre> 
+ template &lt;class ErrorConditionEnum&gt;
+   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value&gt;::type&amp;
+     operator=(ErrorConditionEnum e);
+ </pre></blockquote>
+ 
+ <p>
+ Which returns <tt>void&amp;</tt>.  They should both say:
+ </p>
+  
+ <blockquote><pre> 
+ template &lt;class ErrorConditionEnum&gt;
+   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value, 
+   error_condition&gt;::type&amp;
+     operator=(ErrorConditionEnum e);
+ </pre></blockquote>
+ 
+ <p>
+ Or (again, I prefer this form):
+ </p>
+ 
+ <blockquote><pre> 
+ template &lt;class ErrorConditionEnum&gt;
+   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value, 
+   error_condition&amp;&gt;::type
+     operator=(ErrorConditionEnum e);
+ </pre></blockquote>
+ 
+ <p>
+ Additionally, 19.5.3.3 [syserr.errcondition.modifiers] lacks a
+ "<i>Returns:</i> <tt>*this</tt>." paragraph, which is presumably
+ necessary.
+ </p>
+ 
+ <p><i>[
+ 2009-10-18 Beman adds:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ The proposed resolution for issue <a href="lwg-defects.html#1237">1237</a> makes this issue
+ moot, so it should become NAD.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2009-10 Santa Cruz:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ <del>NAD</del><ins>Resolved</ins>, solved by <a href="lwg-defects.html#1237">1237</a>.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <p>
+ Change 19.5.2.1 [syserr.errcode.overview] and 19.5.2.3 [syserr.errcode.modifiers]:
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class ErrorCodeEnum&gt;
+   typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value<ins>, 
+   error_code&amp;</ins>&gt;::type<del>&amp;</del>
+     operator=(ErrorCodeEnum e);
+ </pre></blockquote>
+ 
+ <p>
+ Change 19.5.3.1 [syserr.errcondition.overview]:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt;<del>typename</del> <ins>class</ins> ErrorConditionEnum&gt;
+   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;<ins>::value</ins>, 
+   error_co<ins>ndition</ins><del>de</del><ins>&amp;</ins>&gt;::type<del> &amp;</del>
+     operator=( ErrorConditionEnum e );
+ </pre></blockquote>
+ 
+ <p>
+ Change 19.5.3.3 [syserr.errcondition.modifiers]:
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class ErrorConditionEnum&gt;
+   typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value<ins>, 
+   error_condition&amp;</ins>&gt;::type<del>&amp;</del>
+     operator=(ErrorConditionEnum e);
+ </pre>
+ <blockquote>
+ <p>
+ <i>Postcondition:</i> <tt>*this == make_error_condition(e)</tt>.
+ </p>
+ <p><ins>
+ <i>Returns:</i> <tt>*this</tt>.
+ </ins></p>
+ <p>
+ <i>Throws:</i> Nothing.
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1231"></a>1231. <tt>weak_ptr</tt> comparisons incompletely resolved</h3>
! <p><b>Section:</b> 20.8.2.3.5 [util.smartptr.weak.obs] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.weak.obs">issues</a> in [util.smartptr.weak.obs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2637.pdf">n2637</a>
! paper suggested several updates of the ordering semantics of <tt>shared_ptr</tt>
  and <tt>weak_ptr</tt>, among those the explicit comparison operators of <tt>weak_ptr</tt> were
! removed&#47;deleted, instead a corresponding functor <tt>owner_less</tt> was added.
! The problem is that
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2637.pdf">n2637</a>
! did not clearly enough specify, how the previous wording parts describing
  the comparison semantics of <tt>weak_ptr</tt> should be removed.
  </p>
  
*************** the comparison semantics of <tt>weak_ptr
*** 70819,70827 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  
  
--- 79069,79077 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  
  
*************** Moved to Tentatively Ready after 5 posit
*** 70829,70855 ****
  <ol>
  <li>
  <p>
! Change 20.9.10.3 [util.smartptr.weak]/2 as described, the intention is to fix
! the now no longer valid
! requirement that <tt>weak_ptr</tt> is <tt>LessComparable</tt> [Note the deleted comma]:
  </p>
  
! <blockquote>
  Specializations of <tt>weak_ptr</tt> shall be <tt>CopyConstructible</tt><del>,</del>
! <ins>and</ins> <tt>CopyAssignable</tt>,
! <del>and <tt>LessThanComparable</tt>,</del> allowing their use in standard containers.
! </blockquote>
  </li>
  
  <li>
  <p>
! In 20.9.10.3.5 [util.smartptr.weak.obs] remove the paragraphs 9-11 including prototype:
  </p>
  
! <blockquote>
  <del>template&lt;class T, class U&gt; bool operator&lt;(const weak_ptr&lt;T&gt;&amp; a, const weak_ptr&lt;U&gt;&amp; b);</del>
  
! <p>
  <del><i>Returns:</i> an unspecified value such that</del>
  </p>
  <ul>
--- 79079,79105 ----
  <ol>
  <li>
  <p>
! Change 20.8.2.3 [util.smartptr.weak]/2 as described, the intention is to fix
! the now no longer valid requirement that <tt>weak_ptr</tt> is <tt>LessComparable</tt> 
! [Note the deleted comma]:
  </p>
  
! <blockquote><p>
  Specializations of <tt>weak_ptr</tt> shall be <tt>CopyConstructible</tt><del>,</del>
! <ins>and</ins> <tt>CopyAssignable</tt>, <del>and <tt>LessThanComparable</tt>,</del> 
! allowing their use in standard containers.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! In 20.8.2.3.5 [util.smartptr.weak.obs] remove the paragraphs 9-11 including prototype:
  </p>
  
! <blockquote><p>
  <del>template&lt;class T, class U&gt; bool operator&lt;(const weak_ptr&lt;T&gt;&amp; a, const weak_ptr&lt;U&gt;&amp; b);</del>
  
! <p/>
  <del><i>Returns:</i> an unspecified value such that</del>
  </p>
  <ul>
*************** equivalent if and only if they share own
*** 70869,70875 ****
  
  <p>
  <del>[<i>Note:</i> Allows <tt>weak_ptr</tt> objects to be used as keys in associative
! containers. — <i>end note</i>]</del>
  </p>
  </blockquote>
  </li>
--- 79119,79125 ----
  
  <p>
  <del>[<i>Note:</i> Allows <tt>weak_ptr</tt> objects to be used as keys in associative
! containers. &mdash; <i>end note</i>]</del>
  </p>
  </blockquote>
  </li>
*************** containers. — <i>end note</i>]</del>
*** 70880,70898 ****
  
  
  <hr>
! <h3><a name="1234"></a>1234. "Do the right thing" and NULL</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2009-10-09 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! On g++ 4.2.4 (x86_64-linux-gnu), the following file gives a compile
! error:
  </p>
  
! <blockquote><pre>#include &lt;vector&gt;
! void foo() { std::vector&lt;int*&gt; v(500l, NULL); }
  </pre></blockquote>
  
  <p>
--- 79130,79148 ----
  
  
  <hr>
! <h3><a name="1234"></a>1234. "Do the right thing" and <tt>NULL</tt></h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2009-10-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! On g++ 4.2.4 (x86_64-linux-gnu), the following file gives a compile error:
  </p>
  
! <blockquote><pre>
! #include &lt;vector&gt;
! void foo() { std::vector&lt;int*&gt; v(500L, NULL); }
  </pre></blockquote>
  
  <p>
*************** Is this supposed to work?
*** 70900,70914 ****
  </p>
  
  <p>
! The issue: if <tt>NULL</tt> happens to be defined as <tt>0l</tt>, this is an invocation of
  the constructor with two arguments of the same integral type.
  23.2.3 [sequence.reqmts]/14
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3035.pdf">N3035</a>)
! says that this will behave as if the the
! overloaded constructor
  </p>
  
! <blockquote><pre>X(size_type, const value_type&amp; = value_type(),
    const allocator_type&amp; = allocator_type())
  </pre></blockquote>
  
--- 79150,79164 ----
  </p>
  
  <p>
! The issue: if <tt>NULL</tt> happens to be defined as <tt>0L</tt>, this is an invocation of
  the constructor with two arguments of the same integral type.
  23.2.3 [sequence.reqmts]/14
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3035.pdf">N3035</a>)
! says that this will behave as if the overloaded constructor
  </p>
  
! <blockquote><pre>
! X(size_type, const value_type&amp; = value_type(),
    const allocator_type&amp; = allocator_type())
  </pre></blockquote>
  
*************** Adapts the numbering used in the discuss
*** 70950,70962 ****
  <li>
  Proposes a resolution that requires implementations to use sfinae-like means to
  possibly filter away the too generic template c'tor. In fact this resolution is
! equivalent to that used for the <tt>pair-NULL</tt> problem (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>),
  the only difference is, that issue 1234 was already a C++03 problem.
  </li>
  </ul>
  
  <p>
! This issue can be considered as a refinement of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#438">438</a>.
  </p>
  
  </blockquote>
--- 79200,79212 ----
  <li>
  Proposes a resolution that requires implementations to use sfinae-like means to
  possibly filter away the too generic template c'tor. In fact this resolution is
! equivalent to that used for the <tt>pair-NULL</tt> problem (<a href="lwg-defects.html#811">811</a>),
  the only difference is, that issue 1234 was already a C++03 problem.
  </li>
  </ul>
  
  <p>
! This issue can be considered as a refinement of <a href="lwg-defects.html#438">438</a>.
  </p>
  
  </blockquote>
*************** WP has a defect that should be fixed her
*** 70972,70980 ****
  incorrectly referring to <tt>iterator</tt> instead of <tt>const_iterator</tt>.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready with revised wording after 7 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 79222,79230 ----
  incorrectly referring to <tt>iterator</tt> instead of <tt>const_iterator</tt>.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready with revised wording after 7 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Change 23.2.3 [sequence.reqmts]/14+15 as
*** 71001,71017 ****
  If the constructor
  </p>
  
! <blockquote><pre>template &lt;class InputIterator&gt;
  X(InputIterator first, InputIterator last,
    const allocator_type&amp; alloc = allocator_type())
- 
  </pre></blockquote>
  
  <p>
  is called with a type <tt>InputIterator</tt> that does not qualify as an input
  iterator, then the constructor <ins>shall not participate in overload
! resolution.</ins><del>will
! behave as if the overloaded constructor:</del>
  </p>
  
  <blockquote><pre><del>
--- 79251,79266 ----
  If the constructor
  </p>
  
! <blockquote><pre>
! template &lt;class InputIterator&gt;
  X(InputIterator first, InputIterator last,
    const allocator_type&amp; alloc = allocator_type())
  </pre></blockquote>
  
  <p>
  is called with a type <tt>InputIterator</tt> that does not qualify as an input
  iterator, then the constructor <ins>shall not participate in overload
! resolution.</ins><del>will behave as if the overloaded constructor:</del>
  </p>
  
  <blockquote><pre><del>
*************** X(size_type, const value_type&amp; = val
*** 71020,71028 ****
  </del></pre></blockquote>
  
  <p>
! <del>were called instead, with the arguments
! <tt>static_cast&lt;size_type&gt;(first)</tt>, <tt>last</tt> and <tt>alloc</tt>,
! respectively</del>.
  </p>
  </li>
  
--- 79269,79276 ----
  </del></pre></blockquote>
  
  <p>
! <del>were called instead, with the arguments <tt>static_cast&lt;size_type&gt;(first)</tt>, 
! <tt>last</tt> and <tt>alloc</tt>, respectively</del>.
  </p>
  </li>
  
*************** respectively</del>.
*** 71032,71038 ****
  If the member functions of the forms:
  </p>
  
! <blockquote><pre>template &lt;class InputIterator&gt; <i>// such as insert()</i>
  rt fx1(<ins>const_</ins>iterator p, InputIterator first, InputIterator last);
  
  template &lt;class InputIterator&gt; <i>// such as append(), assign()</i>
--- 79280,79287 ----
  If the member functions of the forms:
  </p>
  
! <blockquote><pre>
! template &lt;class InputIterator&gt; <i>// such as insert()</i>
  rt fx1(<ins>const_</ins>iterator p, InputIterator first, InputIterator last);
  
  template &lt;class InputIterator&gt; <i>// such as append(), assign()</i>
*************** iterator, then these functions <ins>shal
*** 71048,71054 ****
  resolution.</ins><del>will behave as if the overloaded member functions:</del>
  </p>
  
! <blockquote><pre><del>rt fx1(iterator, size_type, const value_type&amp;);</del>
  
  <del>rt fx2(size_type, const value_type&amp;);</del>
  
--- 79297,79304 ----
  resolution.</ins><del>will behave as if the overloaded member functions:</del>
  </p>
  
! <blockquote><pre>
! <del>rt fx1(iterator, size_type, const value_type&amp;);</del>
  
  <del>rt fx2(size_type, const value_type&amp;);</del>
  
*************** not implicitly convertible to <tt>X::val
*** 71075,71085 ****
  
  
  <hr>
! <h3><a name="1237"></a>1237. Constrained error_code/error_condition members</h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-10-14 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I'm just reflecting on the now SFINAE-constrained constructors
--- 79325,79335 ----
  
  
  <hr>
! <h3><a name="1237"></a>1237. Constrained <tt>error_code</tt>&#47;<tt>error_condition members</tt></h3>
! <p><b>Section:</b> 19.5 [syserr] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-10-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#syserr">issues</a> in [syserr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I'm just reflecting on the now SFINAE-constrained constructors
*************** which has IMO several disadvantages:
*** 71095,71115 ****
  <li>
  <p>
  With the availability of template default arguments and
! decltype, using <tt>enable_if</tt> in C++0x standard library, seems
  unnecessary restricting implementation freedom. E.g. there
! should be not need for a useless specification of a dummy
  default function argument, which only confuses the reader.
  A more reasonable implementation could e.g. be
  </p>
  
! <blockquote><pre>template &lt;class ErrorCodeEnum
   class = typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value&gt;::type&gt;
  error_code(ErrorCodeEnum e);
  </pre></blockquote>
  
  <p>
  As currently specified, the function signatures are so unreadable,
! that errors quite easily happen, see e.g. <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1229">1229</a>.
  </p>
  </li>
  
--- 79345,79366 ----
  <li>
  <p>
  With the availability of template default arguments and
! decltype, using <tt>enable_if</tt> in the C++0x standard library, seems
  unnecessary restricting implementation freedom. E.g. there
! should be no need for a useless specification of a dummy
  default function argument, which only confuses the reader.
  A more reasonable implementation could e.g. be
  </p>
  
! <blockquote><pre>
! template &lt;class ErrorCodeEnum
   class = typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value&gt;::type&gt;
  error_code(ErrorCodeEnum e);
  </pre></blockquote>
  
  <p>
  As currently specified, the function signatures are so unreadable,
! that errors quite easily happen, see e.g. <a href="lwg-defects.html#1229">1229</a>.
  </p>
  </li>
  
*************** We have a <em>lot</em> of constrained fu
*** 71119,71128 ****
  now have a standard phrase that is easily understandable:
  </p>
  
! <blockquote>
! <i>Remarks:</i> This constructor/function shall participate in overload
  resolution if and only if X.
! </blockquote>
  
  <p>
  where X describes the condition. Why should these components deviate?
--- 79370,79379 ----
  now have a standard phrase that is easily understandable:
  </p>
  
! <blockquote><p>
! <i>Remarks:</i> This constructor&#47;function shall participate in overload
  resolution if and only if X.
! </p></blockquote>
  
  <p>
  where X describes the condition. Why should these components deviate?
*************** corresponding resolution.
*** 71155,71178 ****
  ]</i></p>
  
  
! <blockquote>
  I support this proposed resolution, and thank Daniel for writing it up.
! </blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote>
  Moved to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[
! Should this resolution be accepted, I recommend to resolve <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1229">1229</a> as NAD
  ]</i></p>
  
  
--- 79406,79429 ----
  ]</i></p>
  
  
! <blockquote><p>
  I support this proposed resolution, and thank Daniel for writing it up.
! </p></blockquote>
  
  <p><i>[
  2009-10 Santa Cruz:
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p><i>[
! Should this resolution be accepted, I recommend to resolve <a href="lwg-defects.html#1229">1229</a> as NAD
  ]</i></p>
  
  
*************** In 19.5.2.1 [syserr.errcode.overview]/1,
*** 71183,71189 ****
  change as indicated:
  </p>
  
! <blockquote><pre>// 19.5.2.2 constructors:
  error_code();
  error_code(int val, const error_category&amp; cat);
  template &lt;class ErrorCodeEnum&gt;
--- 79434,79441 ----
  change as indicated:
  </p>
  
! <blockquote><pre>
! // 19.5.2.2 constructors:
  error_code();
  error_code(int val, const error_category&amp; cat);
  template &lt;class ErrorCodeEnum&gt;
*************** void clear();
*** 71204,71210 ****
  Change 19.5.2.2 [syserr.errcode.constructors] around the prototype before p. 7:
  </p>
  
! <blockquote><pre>template &lt;class ErrorCodeEnum&gt;
  error_code(ErrorCodeEnum e<del>,
    typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value&gt;::type * = 0</del>);
  </pre>
--- 79456,79463 ----
  Change 19.5.2.2 [syserr.errcode.constructors] around the prototype before p. 7:
  </p>
  
! <blockquote><pre>
! template &lt;class ErrorCodeEnum&gt;
  error_code(ErrorCodeEnum e<del>,
    typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value&gt;::type * = 0</del>);
  </pre>
*************** resolution, unless
*** 71223,71237 ****
  Change 19.5.2.3 [syserr.errcode.modifiers] around the prototype before p. 3:
  </p>
  
! <blockquote><pre>template &lt;class ErrorCodeEnum&gt;
    <del>typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value&gt;::type</del><ins>error_code</ins>&amp;
      operator=(ErrorCodeEnum e);
  </pre>
  
! <blockquote>
  <ins><i>Remarks:</i> This operator shall not participate in overload resolution, unless
  <tt>is_error_code_enum&lt;ErrorCodeEnum&gt;::value == true</tt>.</ins>
! </blockquote>
  </blockquote>
  </li>
  
--- 79476,79491 ----
  Change 19.5.2.3 [syserr.errcode.modifiers] around the prototype before p. 3:
  </p>
  
! <blockquote><pre>
! template &lt;class ErrorCodeEnum&gt;
    <del>typename enable_if&lt;is_error_code_enum&lt;ErrorCodeEnum&gt;::value&gt;::type</del><ins>error_code</ins>&amp;
      operator=(ErrorCodeEnum e);
  </pre>
  
! <blockquote><p>
  <ins><i>Remarks:</i> This operator shall not participate in overload resolution, unless
  <tt>is_error_code_enum&lt;ErrorCodeEnum&gt;::value == true</tt>.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
*************** In 19.5.3.1 [syserr.errcondition.overvie
*** 71241,71247 ****
  as indicated:
  </p>
  
! <blockquote><pre>// 19.5.3.2 constructors:
  error_condition();
  error_condition(int val, const error_category&amp; cat);
  template &lt;class ErrorConditionEnum&gt;
--- 79495,79502 ----
  as indicated:
  </p>
  
! <blockquote><pre>
! // 19.5.3.2 constructors:
  error_condition();
  error_condition(int val, const error_category&amp; cat);
  template &lt;class ErrorConditionEnum&gt;
*************** Change 19.5.3.2 [syserr.errcondition.con
*** 71263,71277 ****
  prototype before p. 7:
  </p>
  
! <blockquote><pre>template &lt;class ErrorConditionEnum&gt;
    error_condition(ErrorConditionEnum e<del>,
      typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value&gt;::type* = 0</del>);
  </pre>
! <blockquote>
  <ins><i>Remarks:</i> This constructor shall not participate in overload
  resolution, unless
  <tt>is_error_condition_enum&lt;ErrorConditionEnum&gt;::value == true</tt>.</ins>
! </blockquote>
  </blockquote>
  </li>
  
--- 79518,79533 ----
  prototype before p. 7:
  </p>
  
! <blockquote><pre>
! template &lt;class ErrorConditionEnum&gt;
    error_condition(ErrorConditionEnum e<del>,
      typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value&gt;::type* = 0</del>);
  </pre>
! <blockquote><p>
  <ins><i>Remarks:</i> This constructor shall not participate in overload
  resolution, unless
  <tt>is_error_condition_enum&lt;ErrorConditionEnum&gt;::value == true</tt>.</ins>
! </p></blockquote>
  </blockquote>
  </li>
  
*************** Change 19.5.3.3 [syserr.errcondition.mod
*** 71281,71287 ****
  prototype before p. 3:
  </p>
  
! <blockquote><pre>template &lt;class ErrorConditionEnum&gt;
    <del>typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value&gt;::type</del><ins>error_condition</ins>&amp;
      operator=(ErrorConditionEnum e);
  </pre>
--- 79537,79544 ----
  prototype before p. 3:
  </p>
  
! <blockquote><pre>
! template &lt;class ErrorConditionEnum&gt;
    <del>typename enable_if&lt;is_error_condition_enum&lt;ErrorConditionEnum&gt;::value&gt;::type</del><ins>error_condition</ins>&amp;
      operator=(ErrorConditionEnum e);
  </pre>
*************** prototype before p. 3:
*** 71311,71328 ****
  
  
  <hr>
! <h3><a name="1240"></a>1240. Deleted comparison functions of std::function not  needed</h3>
! <p><b>Section:</b> 20.8.14.2 [func.wrap.func] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-10-18 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The class template <tt>std::function</tt> contains the following member
  declarations:
  </p>
  
! <blockquote><pre>// deleted overloads close possible hole in the type system
  template&lt;class R2, class... ArgTypes2&gt;
    bool operator==(const function&lt;R2(ArgTypes2...)&gt;&amp;) = delete;
  template&lt;class R2, class... ArgTypes2&gt;
--- 79568,79587 ----
  
  
  <hr>
! <h3><a name="1240"></a>1240. Deleted comparison functions of <tt>std::function</tt> not needed</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-10-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The class template <tt>std::function</tt> contains the following member
  declarations:
  </p>
  
! <blockquote><pre>
! // deleted overloads close possible hole in the type system
  template&lt;class R2, class... ArgTypes2&gt;
    bool operator==(const function&lt;R2(ArgTypes2...)&gt;&amp;) = delete;
  template&lt;class R2, class... ArgTypes2&gt;
*************** template&lt;class R2, class... ArgTypes2
*** 71331,71344 ****
  
  <p>
  The leading comment here is part of the history of <tt>std::function</tt>, which
! was introduced with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1402.html#undefined_operators">N1402</a>.
  During that time no explicit conversion functions existed, and the
  "safe-bool" idiom (based on pointers-to-member) was a popular
  technique. The only disadvantage of this idiom was that given two
  objects <tt>f1</tt> and <tt>f2</tt> of type <tt>std::function</tt> the expression
  </p>
  
! <blockquote><pre>f1 == f2;
  </pre></blockquote>
  
  <p>
--- 79590,79605 ----
  
  <p>
  The leading comment here is part of the history of <tt>std::function</tt>, which
! was introduced with 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1402.html#undefined_operators">N1402</a>.
  During that time no explicit conversion functions existed, and the
  "safe-bool" idiom (based on pointers-to-member) was a popular
  technique. The only disadvantage of this idiom was that given two
  objects <tt>f1</tt> and <tt>f2</tt> of type <tt>std::function</tt> the expression
  </p>
  
! <blockquote><pre>
! f1 == f2;
  </pre></blockquote>
  
  <p>
*************** Post-Rapperswil
*** 71366,71374 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 79627,79635 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 71379,71388 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.8.14.2 [func.wrap.func]/1, class function change as indicated:
  </p>
  
! <blockquote><pre>// 20.7.15.2.3, function capacity:
  explicit operator bool() const;
  
  <del>// deleted overloads close possible hole in the type system</del>
--- 79640,79650 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9.12.2 [func.wrap.func]/1, class function change as indicated:
  </p>
  
! <blockquote><pre>
! // 20.7.15.2.3, function capacity:
  explicit operator bool() const;
  
  <del>// deleted overloads close possible hole in the type system</del>
*************** explicit operator bool() const;
*** 71397,71418 ****
  
  
  <hr>
! <h3><a name="1241"></a>1241. unique_copy needs to require EquivalenceRelation</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-10-17 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A lot of fixes were silently applied during concept-time and we should
  not lose them again. The Requires clause of 25.3.9 [alg.unique]/5
  doesn't mention that <tt>==</tt> and the predicate need to satisfy an
! <tt>EquivalenceRelation</tt>, as it is correctly said for
! <tt>unique</tt>. This was intentionally fixed during conceptification,
! were we had:
  </p>
  
! <blockquote><pre>template&lt;InputIterator InIter, class OutIter&gt;
    requires OutputIterator&lt;OutIter, RvalueOf&lt;InIter::value_type&gt;::type&gt;
          &amp;&amp; EqualityComparable&lt;InIter::value_type&gt;
          &amp;&amp; HasAssign&lt;InIter::value_type, InIter::reference&gt;
--- 79659,79680 ----
  
  
  <hr>
! <h3><a name="1241"></a>1241. <tt>unique_copy</tt> needs to require <tt>EquivalenceRelation</tt></h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-10-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  A lot of fixes were silently applied during concept-time and we should
  not lose them again. The Requires clause of 25.3.9 [alg.unique]/5
  doesn't mention that <tt>==</tt> and the predicate need to satisfy an
! <tt>EquivalenceRelation</tt>, as it is correctly said for <tt>unique</tt>. 
! This was intentionally fixed during conceptification, were we had:
  </p>
  
! <blockquote><pre>
! template&lt;InputIterator InIter, class OutIter&gt;
    requires OutputIterator&lt;OutIter, RvalueOf&lt;InIter::value_type&gt;::type&gt;
          &amp;&amp; EqualityComparable&lt;InIter::value_type&gt;
          &amp;&amp; HasAssign&lt;InIter::value_type, InIter::reference&gt;
*************** Note that EqualityComparable implied an
*** 71435,71441 ****
  <p><i>[
  N.B. <tt>adjacent_find</tt> was also specified to require
  <tt>EquivalenceRelation</tt>, but that was considered as a defect in
! concepts, see <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1000">1000</a>
  ]</i></p>
  
  
--- 79697,79703 ----
  <p><i>[
  N.B. <tt>adjacent_find</tt> was also specified to require
  <tt>EquivalenceRelation</tt>, but that was considered as a defect in
! concepts, see <a href="lwg-closed.html#1000">1000</a>
  ]</i></p>
  
  
*************** concepts, see <a href="http://www.open-s
*** 71444,71452 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  
  
--- 79706,79714 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  
  
*************** Moved to Tentatively Ready after 5 posit
*** 71455,71461 ****
  Change 25.3.9 [alg.unique]/5 as indicated:
  </p>
  
! <blockquote><pre>template&lt;class InputIterator, class OutputIterator&gt;
    OutputIterator
      unique_copy(InputIterator first, InputIterator last, OutputIterator result);
  
--- 79717,79724 ----
  Change 25.3.9 [alg.unique]/5 as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;class InputIterator, class OutputIterator&gt;
    OutputIterator
      unique_copy(InputIterator first, InputIterator last, OutputIterator result);
  
*************** template&lt;class InputIterator, class O
*** 71464,71470 ****
      unique_copy(InputIterator first, InputIterator last,
                  OutputIterator result, BinaryPredicate pred);
  </pre>
! <blockquote>
  <i>Requires:</i> <ins>The comparison function shall be an equivalence
  relation.</ins> The ranges <tt>[first,last)</tt> and
  <tt>[result,result+(last-first))</tt> shall not overlap. The expression
--- 79727,79733 ----
      unique_copy(InputIterator first, InputIterator last,
                  OutputIterator result, BinaryPredicate pred);
  </pre>
! <blockquote><p>
  <i>Requires:</i> <ins>The comparison function shall be an equivalence
  relation.</ins> The ranges <tt>[first,last)</tt> and
  <tt>[result,result+(last-first))</tt> shall not overlap. The expression
*************** requirements of forward iterator then th
*** 71474,71481 ****
  <tt>InputIterator</tt> shall be <tt>CopyConstructible</tt> (34) and
  <tt>CopyAssignable</tt> (table 36). Otherwise <tt>CopyConstructible</tt>
  is not required.
  </blockquote>
! </blockquote>
  
  
  
--- 79737,79786 ----
  <tt>InputIterator</tt> shall be <tt>CopyConstructible</tt> (34) and
  <tt>CopyAssignable</tt> (table 36). Otherwise <tt>CopyConstructible</tt>
  is not required.
+ </p></blockquote>
  </blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1244"></a>1244. <tt>wait_*()</tt> in <tt>*future</tt> for synchronous functions</h3>
! <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Detlef Vollmann <b>Opened:</b> 2009-10-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures">issues</a> in [futures].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! With the addition of <tt>async()</tt>, a <tt>future</tt> might be
! associated with a function that is not running in a different thread but
! is stored to by run synchronously on the <tt>get()</tt> call. It's not
! clear what the <tt>wait()</tt> functions should do in this case.
! </p>
! 
! <p>
! Suggested resolution:
! </p>
! 
! <p>
! Throw an exception.
! </p>
! 
! <p><i>[
! 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
! ]</i></p>
! 
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
  
  
  
*************** is not required.
*** 71483,71503 ****
  
  <hr>
  <h3><a name="1245"></a>1245. <tt>std::hash&lt;string&gt;</tt> &amp; co</h3>
! <p><b>Section:</b> 20.8.15 [unord.hash] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2009-10-22 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.8.15 [unord.hash], <tt>operator()</tt> is specified as
  taking the argument by value. Moreover, it is said that <tt>operator()</tt> shall
  not throw exceptions.
  </p>
  
  <p>
! However, for the specializations for class types, like <tt>string</tt>, <tt>wstring</tt>,
! etc, the former requirement seems suboptimal from the performance point
! of view (a specific PR has been filed about this in the GCC Bugzilla)
  and, together with the latter requirement, hard if not impossible to
  fulfill. It looks like pass by const reference should be allowed in such
  cases.
--- 79788,79809 ----
  
  <hr>
  <h3><a name="1245"></a>1245. <tt>std::hash&lt;string&gt;</tt> &amp; co</h3>
! <p><b>Section:</b> 20.9.13 [unord.hash] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2009-10-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.hash">active issues</a> in [unord.hash].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.9.13 [unord.hash], <tt>operator()</tt> is specified as
  taking the argument by value. Moreover, it is said that <tt>operator()</tt> shall
  not throw exceptions.
  </p>
  
  <p>
! However, for the specializations for class types, like <tt>string</tt>, 
! <tt>wstring</tt>, etc, the former requirement seems suboptimal from the 
! performance point of view (a specific PR has been filed about this in the GCC Bugzilla)
  and, together with the latter requirement, hard if not impossible to
  fulfill. It looks like pass by const reference should be allowed in such
  cases.
*************** cases.
*** 71508,71518 ****
  ]</i></p>
  
  
! <blockquote>
  I've removed the list of types for which <tt>hash</tt> shall be instantiated
  because it's already explicit in the synopsis of header
! <tt>&lt;functional&gt;</tt> in 20.8 [function.objects]/2.
! </blockquote>
  
  <p><i>[
  2009-11-18: Original wording here:
--- 79814,79824 ----
  ]</i></p>
  
  
! <blockquote><p>
  I've removed the list of types for which <tt>hash</tt> shall be instantiated
  because it's already explicit in the synopsis of header
! <tt>&lt;functional&gt;</tt> in 20.9 [function.objects]/2.
! </p></blockquote>
  
  <p><i>[
  2009-11-18: Original wording here:
*************** because it's already explicit in the syn
*** 71521,71531 ****
  
  <blockquote class="note">
  <p>
! Add to 20.8.15 [unord.hash]/2:
  </p>
  
  <blockquote>
! <pre>namespace std {
    template &lt;class T&gt;
    struct hash : public std::unary_function&lt;T, std::size_t&gt; {
      std::size_t operator()(T val) const;
--- 79827,79838 ----
  
  <blockquote class="note">
  <p>
! Add to 20.9.13 [unord.hash]/2:
  </p>
  
  <blockquote>
! <pre>
! namespace std {
    template &lt;class T&gt;
    struct hash : public std::unary_function&lt;T, std::size_t&gt; {
      std::size_t operator()(T val) const;
*************** types takes its argument by value or con
*** 71553,71565 ****
  ]</i></p>
  
  
! <blockquote>
  I have received community requests to ask for this issue to be reopened.
  Some users feel that mandating the inheritance is overly constraining.
! </blockquote>
  
  <p><i>[
! 2010-01-31 Alisdair: related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#978">978</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1182">1182</a>.
  ]</i></p>
  
  
--- 79860,79872 ----
  ]</i></p>
  
  
! <blockquote><p>
  I have received community requests to ask for this issue to be reopened.
  Some users feel that mandating the inheritance is overly constraining.
! </p></blockquote>
  
  <p><i>[
! 2010-01-31 Alisdair: related to <a href="lwg-defects.html#978">978</a> and <a href="lwg-defects.html#1182">1182</a>.
  ]</i></p>
  
  
*************** Some users feel that mandating the inher
*** 71576,71623 ****
  
  
  <p><b>Proposed resolution:</b></p>
!   <p><i>Insert a new subclause either before or after the current 20.2.5 [allocator.requirements]:</i></p>
  <blockquote>
  
    <h3><tt>Hash</tt> Requirements [hash.requirements]</h3>
  
!   <p align="left">This subclause defines the named requirement <tt>Hash</tt>, 
    used in several clauses of the C++ standard library. A type <tt>H</tt> meets the <tt>Hash</tt> requirement if</p>
  
    <ul>
      <li>
  
!   <p align="left">it is a function object type (20.8 [function.objects]).</p>
  
      </li>
      <li>
  
!   <p align="left">it satisfies the requirements of <tt>CopyConstructible</tt>, and 
!   <tt>Destructible</tt> (20.2.1 [utility.arg.requirements]),</p>
  
      </li>
      <li>
  
!   <p align="left">the expressions shown in the following table are valid and have the 
    indicated semantics, and</p>
  
      </li>
      <li>
  
!   <p align="left">it satisfies all other requirements of this subclause.</p>
  
      </li>
    </ul>
  
!   <p align="left">Given <tt>Key</tt> is an argument type for function objects of 
    type <tt>H</tt>, in the table below <tt>h</tt> is a value of type (possibly <tt>const</tt>)
    <tt>H</tt>, <tt>u</tt> is an lvalue of type <tt>Key</tt>,&nbsp; and <tt>
    k</tt> 
    is a value of a type convertible to (possibly <tt>const</tt>) <tt>Key</tt>:</p>
  
!   <p align="center">Table ? - <tt>Hash</tt> requirements</p>
! <table border="1" cellpadding="5" cellspacing="1" style="border-collapse: collapse" bordercolor="#111111">
!   <tbody><tr>
      <td>Expression</td>
      <td>Return type</td>
      <td>Requirement</td>
--- 79883,79930 ----
  
  
  <p><b>Proposed resolution:</b></p>
!   <p><i>Insert a new subclause either before or after the current 17.6.3.5 [allocator.requirements]:</i></p>
  <blockquote>
  
    <h3><tt>Hash</tt> Requirements [hash.requirements]</h3>
  
!   <p>This subclause defines the named requirement <tt>Hash</tt>, 
    used in several clauses of the C++ standard library. A type <tt>H</tt> meets the <tt>Hash</tt> requirement if</p>
  
    <ul>
      <li>
  
!   <p>it is a function object type (20.9 [function.objects]).</p>
  
      </li>
      <li>
  
!   <p>it satisfies the requirements of <tt>CopyConstructible</tt>, and 
!   <tt>Destructible</tt> (17.6.3.1 [utility.arg.requirements]),</p>
  
      </li>
      <li>
  
!   <p>the expressions shown in the following table are valid and have the 
    indicated semantics, and</p>
  
      </li>
      <li>
  
!   <p>it satisfies all other requirements of this subclause.</p>
  
      </li>
    </ul>
  
!   <p>Given <tt>Key</tt> is an argument type for function objects of 
    type <tt>H</tt>, in the table below <tt>h</tt> is a value of type (possibly <tt>const</tt>)
    <tt>H</tt>, <tt>u</tt> is an lvalue of type <tt>Key</tt>,&nbsp; and <tt>
    k</tt> 
    is a value of a type convertible to (possibly <tt>const</tt>) <tt>Key</tt>:</p>
  
! <table border="1" cellpadding="5" cellspacing="1" style="border-collapse: collapse">
!   <caption>Table ? &mdash; <tt>Hash</tt> requirements</caption>
!   <tr>
      <td>Expression</td>
      <td>Return type</td>
      <td>Requirement</td>
*************** Some users feel that mandating the inher
*** 71628,71638 ****
      <td valign="top">Shall not throw exceptions. The value returned shall depend only on
  the argument <tt>k</tt>. [<i>Note:</i> Thus all evaluations of the expression <tt>
      h(k)</tt> with the 
!     same value for <tt>k</tt> yield the same result. <i>— end note</i>] [<i>Note:
      </i>For <tt>t1</tt> and <tt>t2</tt> of different values, the probability that 
      <tt>h(t1)</tt> 
      and <tt>h(t2)</tt> compare equal should be very small, approaching <tt>(1.0/numeric_limits&lt;size_t&gt;::max())</tt>.
!     <i>— end note</i>] <i><span style="background-color: #C0C0C0">Comment 
      (not to go in WP): The wording for the second note is based on a similar 
      note in 22.4.4.1.2 [locale.collate.virtuals]/3</span></i></td>
    </tr>
--- 79935,79945 ----
      <td valign="top">Shall not throw exceptions. The value returned shall depend only on
  the argument <tt>k</tt>. [<i>Note:</i> Thus all evaluations of the expression <tt>
      h(k)</tt> with the 
!     same value for <tt>k</tt> yield the same result. <i>&mdash; end note</i>] [<i>Note:
      </i>For <tt>t1</tt> and <tt>t2</tt> of different values, the probability that 
      <tt>h(t1)</tt> 
      and <tt>h(t2)</tt> compare equal should be very small, approaching <tt>(1.0/numeric_limits&lt;size_t&gt;::max())</tt>.
!     <i>&mdash; end note</i>] <i><span style="color:#C0C0C0">Comment 
      (not to go in WP): The wording for the second note is based on a similar 
      note in 22.4.4.1.2 [locale.collate.virtuals]/3</span></i></td>
    </tr>
*************** the argument <tt>k</tt>. [<i>Note:</i> T
*** 71641,71654 ****
      <td valign="top"><tt>size_t</tt></td>
      <td valign="top">Shall not modify <tt>u</tt>.</td>
    </tr>
!   </tbody></table>
  
  </blockquote>
  
! <p><i>Change 20.8.15 [unord.hash] as indicated: </i>
  </p>
  <blockquote>
!   <p>1 The unordered associative containers defined in Clause 23.7 [unord] use 
    specializations of <ins>the class template</ins> <tt>hash</tt> as the default 
    hash function. <ins>For all object types <tt>T</tt> for which there exists a 
    specialization <tt>hash&lt;T&gt;</tt>, the instantiation <tt>hash&lt;T&gt;</tt> shall:</ins></p>
--- 79948,79961 ----
      <td valign="top"><tt>size_t</tt></td>
      <td valign="top">Shall not modify <tt>u</tt>.</td>
    </tr>
!   </table>
  
  </blockquote>
  
! <p><i>Change 20.9.13 [unord.hash] as indicated: </i>
  </p>
  <blockquote>
!   <p>1 The unordered associative containers defined in Clause 23.5 [unord] use 
    specializations of <ins>the class template</ins> <tt>hash</tt> as the default 
    hash function. <ins>For all object types <tt>T</tt> for which there exists a 
    specialization <tt>hash&lt;T&gt;</tt>, the instantiation <tt>hash&lt;T&gt;</tt> shall:</ins></p>
*************** equal if the container's equality functi
*** 71701,71707 ****
  values. If <tt>k1</tt> and <tt>k2</tt> are equal, the hash function shall return 
  the same value for both. <ins>[<i>Note:</i> Thus supplying a non-default <tt>Pred</tt> 
  parameter usually implies the need to supply a non-default <tt>Hash</tt> 
! parameter. <i>— end note</i>]</ins></p>
  
  </blockquote>
  
--- 80008,80014 ----
  values. If <tt>k1</tt> and <tt>k2</tt> are equal, the hash function shall return 
  the same value for both. <ins>[<i>Note:</i> Thus supplying a non-default <tt>Pred</tt> 
  parameter usually implies the need to supply a non-default <tt>Hash</tt> 
! parameter. <i>&mdash; end note</i>]</ins></p>
  
  </blockquote>
  
*************** parameter. <i>— end note</i>]</ins></p>
*** 71712,71731 ****
  
  <hr>
  <h3><a name="1247"></a>1247. <tt>auto_ptr</tt> is overspecified</h3>
! <p><b>Section:</b> D.12.1 [auto.ptr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-10-24 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This issue is extracted as the ongoing point-of-interest from earlier
! issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#463">463</a>.
  </p>
  
  <p>
  <tt>auto_ptr</tt> is overspecified as the <tt>auto_ptr_ref</tt>
  implementation detail is formally specified, and the technique is
! observable so workarounds for compiler defects can  cause a working
  implementation of the primary <tt>auto_ptr</tt> template become
  non-conforming.
  </p>
--- 80019,80038 ----
  
  <hr>
  <h3><a name="1247"></a>1247. <tt>auto_ptr</tt> is overspecified</h3>
! <p><b>Section:</b> X [auto.ptr] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-10-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#auto.ptr">issues</a> in [auto.ptr].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  This issue is extracted as the ongoing point-of-interest from earlier
! issue <a href="lwg-closed.html#463">463</a>.
  </p>
  
  <p>
  <tt>auto_ptr</tt> is overspecified as the <tt>auto_ptr_ref</tt>
  implementation detail is formally specified, and the technique is
! observable so workarounds for compiler defects can cause a working
  implementation of the primary <tt>auto_ptr</tt> template become
  non-conforming.
  </p>
*************** I wonder, whether the revised wording sh
*** 71747,71756 ****
  for <tt>istream_buf</tt> by adding one further sentence:
  </p>
  
! <blockquote>
  An implementation is permitted to provide equivalent functionality without
  providing a class with this name.
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 80054,80063 ----
  for <tt>istream_buf</tt> by adding one further sentence:
  </p>
  
! <blockquote><p>
  An implementation is permitted to provide equivalent functionality without
  providing a class with this name.
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** Add the term "exposition only" in the fo
*** 71775,71781 ****
  </p>
  
  <p>
! Ammend D.12.1 [auto.ptr]p2:
  </p>
  
  <blockquote>
--- 80082,80088 ----
  </p>
  
  <p>
! Ammend X [auto.ptr]p2:
  </p>
  
  <blockquote>
*************** passed to and returned from functions.
*** 71788,71794 ****
  without providing a class with this name.</ins>
  </p>
  
! <blockquote><pre>namespace std {
   template &lt;class Y&gt; struct auto_ptr_ref { }; <ins>// exposition only</ins>
  </pre></blockquote>
  </blockquote>
--- 80095,80102 ----
  without providing a class with this name.</ins>
  </p>
  
! <blockquote><pre>
! namespace std {
   template &lt;class Y&gt; struct auto_ptr_ref { }; <ins>// exposition only</ins>
  </pre></blockquote>
  </blockquote>
*************** without providing a class with this name
*** 71798,71813 ****
  
  
  <hr>
! <h3><a name="1249"></a>1249. basic_ios default ctor</h3>
! <p><b>Section:</b> 27.5.4.1 [basic.ios.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2009-10-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#basic.ios.cons">issues</a> in [basic.ios.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The basic_ios default ctor is required to leave the objects members
  uninitialized (see below). The paragraph says the object must be
! initialized by calling basic_ios::init() before it's destroyed by
  I can't find a requirement that it be initialized before calling
  any of the class other member functions. Am I not looking in the
  right place or that an issue?
--- 80106,80167 ----
  
  
  <hr>
! <h3><a name="1248"></a>1248. Equality comparison for unordered containers</h3>
! <p><b>Section:</b> 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Herb Sutter <b>Opened:</b> 2009-10-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! See
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2986.pdf">N2986</a>.
! </p>
! 
! <p><i>[
! 2010-01-22 Alisdair Opens.
! ]</i></p>
! 
! 
! <p><i>[
! 2010-01-24 Alisdair provides wording.
! ]</i></p>
! 
! 
! <p><i>[
! 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
! ]</i></p>
! 
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3068.pdf">N3068</a>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Apply paper
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2986.pdf">N2986</a>.
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1249"></a>1249. <tt>basic_ios</tt> default ctor</h3>
! <p><b>Section:</b> 27.5.5.2 [basic.ios.cons] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2009-10-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.ios.cons">issues</a> in [basic.ios.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The <tt>basic_ios</tt> default ctor is required to leave the objects members
  uninitialized (see below). The paragraph says the object must be
! initialized by calling <tt>basic_ios::init()</tt> before it's destroyed but
  I can't find a requirement that it be initialized before calling
  any of the class other member functions. Am I not looking in the
  right place or that an issue?
*************** right place or that an issue?
*** 71823,71844 ****
  I agree, that your wording makes that clearer, but suggest to write
  </p>
  
! <blockquote>
  ... calling <tt>basic_ios::init<del>()</del></tt> before ...
! </blockquote>
  
  <p>
  Doing so, I recommend to adapt that of <tt>ios_base();</tt> as well, where
  we have:
  </p>
  
! <blockquote>
  <i>Effects:</i> Each <tt>ios_base</tt> member has an indeterminate value
  after construction. These members shall be initialized by calling
  <tt>basic_ios::init</tt>. If an <tt>ios_base</tt> object is destroyed
  before these initializations have taken place, the behavior is
  undefined.
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 80177,80198 ----
  I agree, that your wording makes that clearer, but suggest to write
  </p>
  
! <blockquote><p>
  ... calling <tt>basic_ios::init<del>()</del></tt> before ...
! </p></blockquote>
  
  <p>
  Doing so, I recommend to adapt that of <tt>ios_base();</tt> as well, where
  we have:
  </p>
  
! <blockquote><p>
  <i>Effects:</i> Each <tt>ios_base</tt> member has an indeterminate value
  after construction. These members shall be initialized by calling
  <tt>basic_ios::init</tt>. If an <tt>ios_base</tt> object is destroyed
  before these initializations have taken place, the behavior is
  undefined.
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** Post-Rapperswil:
*** 71846,71854 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 80200,80208 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 71859,71870 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 27.5.2.7 [ios.base.cons] p1:
  </p>
  
! <blockquote><pre>ios_base();
  </pre>
! <blockquote>
  <i>Effects:</i> Each <tt>ios_base</tt> member has an indeterminate value
  after construction. <del>These</del> <ins>The object's</ins> members shall be initialized by calling
  <tt>basic_ios::init</tt> <ins>before the object's first use or before
--- 80213,80225 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 27.5.3.7 [ios.base.cons] p1:
  </p>
  
! <blockquote><pre>
! ios_base();
  </pre>
! <blockquote><p>
  <i>Effects:</i> Each <tt>ios_base</tt> member has an indeterminate value
  after construction. <del>These</del> <ins>The object's</ins> members shall be initialized by calling
  <tt>basic_ios::init</tt> <ins>before the object's first use or before
*************** after construction. <del>These</del> <in
*** 71872,71887 ****
   is undefined.</ins>. <del>If an <tt>ios_base</tt> object is destroyed
  before these initializations have taken place, the behavior is
  undefined.</del>
! </blockquote>
  </blockquote>
  
  <p>
! Change 27.5.4.1 [basic.ios.cons] p2:
  </p>
  
! <blockquote><pre>basic_ios();
  </pre>
! <blockquote>
  <i>Effects:</i> Constructs an object of class <tt>basic_ios</tt>
  (27.5.2.7) leaving its member objects uninitialized. The object shall be
  initialized by calling <del>its</del>
--- 80227,80243 ----
   is undefined.</ins>. <del>If an <tt>ios_base</tt> object is destroyed
  before these initializations have taken place, the behavior is
  undefined.</del>
! </p></blockquote>
  </blockquote>
  
  <p>
! Change 27.5.5.2 [basic.ios.cons] p2:
  </p>
  
! <blockquote><pre>
! basic_ios();
  </pre>
! <blockquote><p>
  <i>Effects:</i> Constructs an object of class <tt>basic_ios</tt>
  (27.5.2.7) leaving its member objects uninitialized. The object shall be
  initialized by calling <del>its</del>
*************** initialized by calling <del>its</del>
*** 71889,71895 ****
  use or before it is destroyed, whichever comes first; otherwise the
  behavior is undefined.</ins> <del>member function. If it is destroyed
  before it has been initialized the behavior is undefined.</del>
! </blockquote>
  </blockquote>
  
  
--- 80245,80251 ----
  use or before it is destroyed, whichever comes first; otherwise the
  behavior is undefined.</ins> <del>member function. If it is destroyed
  before it has been initialized the behavior is undefined.</del>
! </p></blockquote>
  </blockquote>
  
  
*************** before it has been initialized the behav
*** 71898,71910 ****
  
  <hr>
  <h3><a name="1250"></a>1250. <tt>&lt;bitset&gt;</tt> still overspecified</h3>
! <p><b>Section:</b> 20.5 [template.bitset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2009-10-29 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1227">1227</a> — <tt>&lt;bitset&gt;</tt> synopsis overspecified makes the observation
  that <tt>std::bitset</tt>, and in fact the whole library, may be implemented
  without needing to <tt>#include &lt;stdexcept&gt;</tt> in any library header. The
  proposed resolution removes the <tt>#include &lt;stdexcept&gt;</tt> directive from
--- 80254,80267 ----
  
  <hr>
  <h3><a name="1250"></a>1250. <tt>&lt;bitset&gt;</tt> still overspecified</h3>
! <p><b>Section:</b> 20.6 [template.bitset] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Martin Sebor <b>Opened:</b> 2009-10-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#template.bitset">active issues</a> in [template.bitset].</p>
! <p><b>View all other</b> <a href="lwg-index.html#template.bitset">issues</a> in [template.bitset].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Issue <a href="lwg-defects.html#1227">1227</a> &mdash; <tt>&lt;bitset&gt;</tt> synopsis overspecified makes the observation
  that <tt>std::bitset</tt>, and in fact the whole library, may be implemented
  without needing to <tt>#include &lt;stdexcept&gt;</tt> in any library header. The
  proposed resolution removes the <tt>#include &lt;stdexcept&gt;</tt> directive from
*************** removed from the synopsis of <tt>&lt;bit
*** 71936,71945 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.5 [template.bitset]:
  </p>
  
! <blockquote><pre><del>#include &lt;cstddef&gt;        // for size_t</del>
  #include &lt;string&gt;
  #include &lt;iosfwd&gt;         // for istream, ostream
  namespace std {
--- 80293,80303 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.6 [template.bitset]:
  </p>
  
! <blockquote><pre>
! <del>#include &lt;cstddef&gt;        // for size_t</del>
  #include &lt;string&gt;
  #include &lt;iosfwd&gt;         // for istream, ostream
  namespace std {
*************** namespace std {
*** 71951,71970 ****
  
  
  <hr>
  <h3><a name="1254"></a>1254. Misleading sentence in <tt>vector&lt;bool&gt;::flip</tt></h3>
! <p><b>Section:</b> 23.4.2 [vector.bool] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Christopher Jefferson <b>Opened:</b> 2009-11-01 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The effects of <tt>vector&lt;bool&gt;::flip</tt> has the line:
  </p>
  
! <blockquote>
  It is unspecified whether the function has any effect on allocated but
  unused bits.
! </blockquote>
  
  <p>
  While this is technically true, it is misleading, as any member function
--- 80309,80646 ----
  
  
  <hr>
+ <h3><a name="1252"></a>1252. <tt>wbuffer_convert::state_type</tt> inconsistency</h3>
+ <p><b>Section:</b> 22.3.3.2.3 [conversions.buffer] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Bo Persson  <b>Opened:</b> 2009-10-21 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#conversions.buffer">active issues</a> in [conversions.buffer].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#conversions.buffer">issues</a> in [conversions.buffer].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The synopsis for <tt>wbuffer_convert</tt> 22.3.3.2.3 [conversions.buffer]/2 contains
+ </p>
+ 
+ <blockquote><pre>
+ typedef typename Tr::state_type   state_type; 
+ </pre></blockquote>
+ 
+ <p>
+ making <tt>state_type</tt> a synonym for (possibly) some
+ <tt>char_traits&lt;x&gt;::state_type</tt>. 
+ </p>
+ 
+ <p>
+ However, in paragraph 9 of the same section, we have 
+ </p>
+ 
+ <blockquote><pre>
+ typedef typename Codecvt::state_type state_type;
+ </pre>
+ 
+ <blockquote><p>
+ The type shall be a synonym for <tt>Codecvt::state_type</tt>.
+ </p></blockquote>
+ </blockquote>
+ 
+ <p>
+ From what I can see, it might be hard to implement <tt>wbuffer_convert</tt> if 
+ the types were not both <tt>std::mbstate_t</tt>, but I cannot find a requirement 
+ that they must be the same type.
+ </p>
+ 
+ <p><i>[
+ Batavia 2010:
+ ]</i></p>
+ 
+ 
+ <p>
+ Howard to draft wording, move to Review. Run it by Bill. Need to move this in Madrid.
+ </p>
+ 
+ <p><i>[2011-03-06: Howard drafts wording]</i></p>
+ 
+ 
+ <p><i>[2011-03-24 Madrid meeting]</i></p>
+ 
+ 
+ <p>Moved to Immediate</p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>Modify the <tt>state_type</tt> typedef in the synopsis of 22.3.3.2.3 [conversions.buffer] p.2 as shown
+ [This makes the synopsis consistent with 22.3.3.2.3 [conversions.buffer] p.9]:</p>
+ 
+ <blockquote><pre>
+ namespace std {
+ template&lt;class Codecvt,
+   class Elem = wchar_t,
+   class Tr = std::char_traits&lt;Elem&gt; &gt;
+ class wbuffer_convert
+   : public std::basic_streambuf&lt;Elem, Tr&gt; {
+ public:
+   typedef typename <del>Tr</del><ins>Codecvt</ins>::state_type state_type;
+   [&hellip;]
+ };
+ }
+ </pre></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1253"></a>1253. invalidation of iterators and <tt>emplace</tt> vs. <tt>insert</tt> inconsistence in assoc. containers</h3>
+ <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Boris Du&scaron;ek <b>Opened:</b> 2009-10-24 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ In the latest published draft
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2960.pdf">N2960</a>,
+ section 23.2.4 [associative.reqmts], paragraph 8, it is specified
+ that that <tt>insert</tt> does not invalidate any iterators. As per
+ 23.2.1 [container.requirements.general], paragraph 12, this holds
+ true not only for <tt>insert</tt>, but <tt>emplace</tt> as well. This
+ gives the <tt>insert</tt> member a special treatment w.r.t.
+ <tt>emplace</tt> member in 23.2.4 [associative.reqmts], par. 8,
+ since both modify the container. For the sake of consistency, in 23.2.4 [associative.reqmts], par. 8: either reference to <tt>insert</tt> 
+ should be removed (i.e. count on 23.2.1 [container.requirements.general], 
+ par. 12), or reference to <tt>emplace</tt> be added (i.e. mention all 
+ members of assoc. containers that modify it).
+ </p>
+ 
+ <p><i>[
+ 2009-11-18 Chris provided wording.
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ This suggested wording covers both the issue discussed, and a number of other
+ identical issues (namely <tt>insert</tt> being discussed without <tt>emplace</tt>). I'm happy to
+ go back and split and introduce a new issue if appropriate, but I think the
+ changes are fairly mechanical and obvious.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010-01-23 Daniel Kr&uuml;gler and J. Daniel Garc&iacute;a updated wording to
+ make the use of <tt>hint</tt> consistent with <tt>insert</tt>.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2011-02-23 Daniel Kr&uuml;gler adapts wording to numbering changes to match the N3225 draft. During this
+ action it was found that 23.2.5 [unord.req] had been changed considerably
+ due to acceptance of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3068.pdf">N3068</a>
+ during the Pittsburgh meeting, such that the suggested wording change to
+ p. 6 can no longer be applied. The new wording is more general and should
+ now include <tt>insert()</tt> and <tt>emplace()</tt> calls as well ("mutating operations").
+ ]</i></p>
+ 
+ 
+ <p><i>[2011-03-06 Daniel Kr&uuml;gler adapts wording to numbering changes to match the N3242 draft]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li>
+ <p>
+ Modify bullet 1 of 23.2.1 [container.requirements.general], p. 10:
+ </p>
+ 
+ <p>
+ 10 Unless otherwise specified (see [associative.reqmts.except], [unord.req.except], [deque.modifiers], and [vector.modifiers])
+ all container types defined in this Clause meet the following additional
+ requirements:
+ </p>
+ 
+ <ul>
+ <li>
+ if an exception is thrown by an <tt>insert()</tt> <ins>or
+ <tt>emplace()</tt></ins> function while inserting a single element, that
+ function has no effects.
+ </li>
+ <li>...</li>
+ </ul>
+ 
+ </li>
+ 
+ <li>
+ <p>
+ Modify 23.2.4 [associative.reqmts], p. 4:
+ </p>
+ 
+ <blockquote><p>
+ 4 An associative container supports <i>unique keys</i> if it may contain at most
+ one element for each key. Otherwise, it supports <i>equivalent keys</i>. The
+ <tt>set</tt> and <tt>map</tt> classes support unique keys; the <tt>multiset</tt>
+ and <tt>multimap</tt> classes support equivalent keys. For <tt>multiset</tt> and
+ <tt>multimap</tt>, <tt>insert</tt><ins>, <tt>emplace</tt>,</ins> and
+ <tt>erase</tt> preserve the relative ordering of equivalent elements.
+ </p></blockquote>
+ 
+ </li>
+ 
+ <li>
+ <p>
+ Modify Table 102 &mdash; Associative container requirements in 
+ 23.2.4 [associative.reqmts]:
+ </p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 102 &mdash; Associative container requirements (in addition to container)</caption>
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Assertion&#47;note<br />pre-&#47;post-condition</th>
+ <th>Complexity</th>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" style="text-align:center;">[&hellip;]</td>
+ </tr>
+ 
+ <tr>
+ <td><tt>a_eq.emplace(args)</tt></td>
+ <td><tt>iterator</tt></td>
+ <td>[&hellip;] <i>Effects:</i> Inserts a <tt>T</tt> object <tt>t</tt> constructed with
+ <tt>std::forward&lt;Args&gt;(args)...</tt> and returns the iterator pointing to
+ the newly inserted element. <ins>If a range containing elements equivalent to
+ <tt>t</tt> exists in <tt>a_eq</tt>, <tt>t</tt> is inserted at the end of that
+ range.</ins></td>
+ <td>logarithmic</td>
+ </tr>
+ 
+ <tr>
+ <td><tt>a.emplace_hint(p, args)</tt></td>
+ <td><tt>iterator</tt></td>
+ <td>equivalent to <tt>a.emplace(std::forward&lt;Args&gt;(args)...)</tt>. Return
+ value is an iterator pointing to the element with the key equivalent to the
+ newly inserted element. <del>The <tt>const_iterator p</tt> is a hint pointing to
+ where the search should start.</del> <ins>The element is inserted as close as
+ possible to the position just prior to <tt>p</tt>.</ins> <del>Implementations
+ are permitted to ignore the hint.</del></td>
+ <td>logarithmic in general, but amortized constant if the element is inserted
+ right <del>after</del> <ins>before</ins> <tt>p</tt></td>
+ </tr>
+ 
+ <tr>
+ <td colspan="4" style="text-align:center;">[&hellip;]</td>
+ </tr>
+ 
+ </table>
+ </blockquote>
+ 
+ </li>
+ 
+ <li>
+ <p>
+ Modify 23.2.4 [associative.reqmts], p. 9:
+ </p>
+ 
+ <blockquote><p>
+ 9 The <tt>insert</tt> <ins>and <tt>emplace</tt></ins> members shall not affect
+ the validity of iterators and references to the container, and the
+ <tt>erase</tt> members shall invalidate only iterators and references to the
+ erased elements.
+ </p></blockquote>
+ 
+ </li>
+ 
+ <li>
+ <p>
+ Modify 23.2.4.1 [associative.reqmts.except], p. 2:
+ </p>
+ 
+ <blockquote><p>
+ 2 For associative containers, if an exception is thrown by any operation from
+ within an <tt>insert()</tt> <ins> or <tt>emplace()</tt></ins> function inserting
+ a single element, the <del><tt>insert()</tt> function</del> <ins>insertion</ins>
+ has no effect.
+ </p></blockquote>
+ 
+ </li>
+ 
+ <li>
+ <p>
+ Modify 23.2.5 [unord.req], p. 13 and p. 14:
+ </p>
+ 
+ <blockquote>
+ <p>
+ 6 An unordered associative container supports <i>unique keys</i> if it may
+ contain at most one element for each key. Otherwise, it supports <i>equivalent
+ keys</i>. <tt>unordered_set</tt> and <tt>unordered_map</tt> support unique keys.
+ <tt>unordered_multiset</tt> and <tt>unordered_multimap</tt> support equivalent
+ keys. In containers that support equivalent keys, elements with equivalent keys
+ are adjacent to each other in the iteration order of the container. Thus, although 
+ the absolute order of elements in an unordered container is not specified, its 
+ elements are grouped into <i>equivalent-key groups</i> such that all elements of each 
+ group have equivalent keys. Mutating operations on unordered containers shall 
+ preserve the relative order of elements within each equivalent-key group unless 
+ otherwise specified.
+ </p>
+ 
+ <p>[&hellip;]</p>
+ 
+ <p>
+ 13 The <tt>insert</tt> <ins>and <tt>emplace</tt></ins> members shall not affect
+ the validity of references to container elements, but may invalidate all
+ iterators to the container. The erase members shall invalidate only iterators
+ and references to the erased elements.
+ </p>
+ 
+ <p>
+ 14 The <tt>insert</tt> <ins>and <tt>emplace</tt></ins> members shall not affect
+ the validity of iterators if <tt>(N+n) &lt; z * B</tt>, where <tt>N</tt> is the
+ number of elements in the container prior to the insert operation, <tt>n</tt> is
+ the number of elements inserted, <tt>B</tt> is the container's bucket count, and
+ <tt>z</tt> is the container's maximum load factor.
+ </p>
+ </blockquote>
+ 
+ </li>
+ 
+ <li>
+ <p>
+ Modify 23.2.5.1 [unord.req.except], p. 2:
+ </p>
+ 
+ <blockquote><p>
+ 2 For unordered associative containers, if an exception is thrown by any
+ operation other than the container's hash function from within an
+ <tt>insert()</tt> <ins>or <tt>emplace()</tt></ins> function inserting a single
+ element, the <del><tt>insert()</tt></del> <ins>insertion</ins>
+ <del>function</del> has no effect.
+ </p></blockquote>
+ 
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1254"></a>1254. Misleading sentence in <tt>vector&lt;bool&gt;::flip</tt></h3>
! <p><b>Section:</b> 23.3.7 [vector.bool] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Christopher Jefferson <b>Opened:</b> 2009-11-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The effects of <tt>vector&lt;bool&gt;::flip</tt> has the line:
  </p>
  
! <blockquote><p>
  It is unspecified whether the function has any effect on allocated but
  unused bits.
! </p></blockquote>
  
  <p>
  While this is technically true, it is misleading, as any member function
*************** to read such memory.
*** 71982,71995 ****
  <p><b>Proposed resolution:</b></p>
  <p>
  Strike second sentence from the definition of <tt>vector&lt;bool&gt;::flip()</tt>,
! 23.4.2 [vector.bool], paragraph 5.
  </p>
  
! <blockquote>
  <i>Effects:</i> Replaces each element in the container with its complement.
  <del>It is unspecified whether the function has any effect on allocated
  but unused bits.</del>
! </blockquote>
  
  
  
--- 80658,80671 ----
  <p><b>Proposed resolution:</b></p>
  <p>
  Strike second sentence from the definition of <tt>vector&lt;bool&gt;::flip()</tt>,
! 23.3.7 [vector.bool], paragraph 5.
  </p>
  
! <blockquote><p>
  <i>Effects:</i> Replaces each element in the container with its complement.
  <del>It is unspecified whether the function has any effect on allocated
  but unused bits.</del>
! </p></blockquote>
  
  
  
*************** but unused bits.</del>
*** 71997,72012 ****
  
  <hr>
  <h3><a name="1255"></a>1255. <tt>declval</tt> should be added to the library</h3>
! <p><b>Section:</b> 20.3 [utility] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-11-03 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility">issues</a> in [utility].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  During the Santa Cruz meeting it was decided to split off the provision
! of the library utility <tt>value()</tt> proposed in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2979.html">N2979</a>
  from the concrete request of the
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2939.html#uk300">UK 300</a>
  comment.
  The provision of a new library component that allows the production of
  values in unevaluated expressions is considered as important
--- 80673,80690 ----
  
  <hr>
  <h3><a name="1255"></a>1255. <tt>declval</tt> should be added to the library</h3>
! <p><b>Section:</b> 20.2 [utility] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-11-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#utility">active issues</a> in [utility].</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility">issues</a> in [utility].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  During the Santa Cruz meeting it was decided to split off the provision
! of the library utility <tt>value()</tt> proposed in 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2979.html">N2979</a>
  from the concrete request of the
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2939.html#UK300">UK 300</a>
  comment.
  The provision of a new library component that allows the production of
  values in unevaluated expressions is considered as important
*************** The following proposed resolution is an
*** 72020,72033 ****
  because the proposed component can now be defined without loss of
  general usefulness and any <i>use</i> by user-code will make the program ill-formed.
  A possible prototype implementation that satisfies the core language
! requirements
! can be written as:
  </p>
  
! <blockquote><pre>template&lt;class T&gt;
    struct declval_protector {
      static const bool stop = false;
!     static typename std::add_rvalue_reference&lt;T&gt;::type delegate(); <font color="#C80000">// undefined</font>
    };
  
  template&lt;class T&gt;
--- 80698,80711 ----
  because the proposed component can now be defined without loss of
  general usefulness and any <i>use</i> by user-code will make the program ill-formed.
  A possible prototype implementation that satisfies the core language
! requirements can be written as:
  </p>
  
! <blockquote><pre>
! template&lt;class T&gt;
    struct declval_protector {
      static const bool stop = false;
!     static typename std::add_rvalue_reference&lt;T&gt;::type delegate(); <span style="color:#C80000">// undefined</span>
    };
  
  template&lt;class T&gt;
*************** numbering and wording
*** 72066,72076 ****
  <ol>
  <li>
  <p>
! Change 20.3 [utility], header <tt>&lt;utility&gt;</tt> synopsis
  as indicated:
  </p>
  
! <blockquote><pre>// 20.3.3, forward/move:
  template &lt;class T&gt; struct identity;
  template &lt;class T, class U&gt; T&amp;&amp; forward(U&amp;&amp;);
  template &lt;class T&gt; typename remove_reference&lt;T&gt;::type&amp;&amp; move(T&amp;&amp;);
--- 80744,80755 ----
  <ol>
  <li>
  <p>
! Change 20.2 [utility], header <tt>&lt;utility&gt;</tt> synopsis
  as indicated:
  </p>
  
! <blockquote><pre>
! // 20.3.3, forward/move:
  template &lt;class T&gt; struct identity;
  template &lt;class T, class U&gt; T&amp;&amp; forward(U&amp;&amp;);
  template &lt;class T&gt; typename remove_reference&lt;T&gt;::type&amp;&amp; move(T&amp;&amp;);
*************** template &lt;class T&gt; typename remove
*** 72082,72088 ****
  
  <li>
  <p>
! Immediately after the current section 20.3.3 [forward] insert a
  new section:
  </p>
  <p>
--- 80761,80767 ----
  
  <li>
  <p>
! Immediately after the current section 20.2.4 [forward] insert a
  new section:
  </p>
  <p>
*************** template parameter <tt>T</tt> of <tt>dec
*** 72096,72102 ****
  be an incomplete type.</ins>
  </p>
  
! <pre><ins>template &lt;class T&gt; typename add_rvalue_reference&lt;T&gt;::type declval(); // as unevaluated operand</ins>
  </pre>
  
  <blockquote>
--- 80775,80782 ----
  be an incomplete type.</ins>
  </p>
  
! <pre>
! <ins>template &lt;class T&gt; typename add_rvalue_reference&lt;T&gt;::type declval(); // as unevaluated operand</ins>
  </pre>
  
  <blockquote>
*************** decltype(static_cast&lt;To&gt;(declval&l
*** 72119,72126 ****
  declares a function template <tt>convert</tt>, which only participates in
  overloading if the type <tt>From</tt> can be explicitly cast to type <tt>To</tt>.
  For another example see class template <tt>common_type</tt>
! (20.7.7.6 [meta.trans.other]).
! — <i>end example</i>]</ins>
  </p>
  </blockquote>
  
--- 80799,80806 ----
  declares a function template <tt>convert</tt>, which only participates in
  overloading if the type <tt>From</tt> can be explicitly cast to type <tt>To</tt>.
  For another example see class template <tt>common_type</tt>
! (20.10.7.6 [meta.trans.other]).
! &mdash; <i>end example</i>]</ins>
  </p>
  </blockquote>
  
*************** For another example see class template <
*** 72128,72134 ****
  
  <li>
  <p>
! This bullet just makes clear that after applying <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2984.html">N2984</a>, the changes in 20.7.4.3 [meta.unary.prop], before
  table Type property queries should <em>not</em> use <tt>declval</tt>,
  because the well-formedness requirement of the specification of
  <tt>is_constructible</tt> would become more complicated, because we
--- 80808,80816 ----
  
  <li>
  <p>
! This bullet just makes clear that after applying 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2984.htm">N2984</a>, 
! the changes in 20.10.4.3 [meta.unary.prop], before
  table Type property queries should <em>not</em> use <tt>declval</tt>,
  because the well-formedness requirement of the specification of
  <tt>is_constructible</tt> would become more complicated, because we
*************** unevaluated context.
*** 72139,72147 ****
  
  <li>
  <p>
! Also 20.7.6 [meta.rel]/4 is not modified similar to the previous bullet,
! because with
! the stricter requirements of not using <tt>declval()</tt> the well-formedness condition
  would be harder to specify. The following changes are only editorial ones (e.g.
  the removal of the duplicate declaration of <tt>create()</tt>):
  </p>
--- 80821,80828 ----
  
  <li>
  <p>
! Also 20.10.6 [meta.rel]/4 is not modified similar to the previous bullet,
! because with the stricter requirements of not using <tt>declval()</tt> the well-formedness condition
  would be harder to specify. The following changes are only editorial ones (e.g.
  the removal of the duplicate declaration of <tt>create()</tt>):
  </p>
*************** the removal of the duplicate declaration
*** 72151,72157 ****
  Given the following function prototype:
  </p>
  
! <blockquote><pre>template &lt;class T&gt;
    typename add_rvalue_reference&lt;T&gt;::type create();
  </pre></blockquote>
  
--- 80832,80839 ----
  Given the following function prototype:
  </p>
  
! <blockquote><pre>
! template &lt;class T&gt;
    typename add_rvalue_reference&lt;T&gt;::type create();
  </pre></blockquote>
  
*************** including any
*** 72163,72169 ****
  implicit conversions to the return type of the function:
  </p>
  
! <blockquote><pre><del>template &lt;class T&gt;
  typename add_rvalue_reference&lt;T&gt;::type create();</del>
  To test() {
    return create&lt;From&gt;();
--- 80845,80852 ----
  implicit conversions to the return type of the function:
  </p>
  
! <blockquote><pre>
! <del>template &lt;class T&gt;
  typename add_rvalue_reference&lt;T&gt;::type create();</del>
  To test() {
    return create&lt;From&gt;();
*************** To test() {
*** 72174,72181 ****
  
  <li>
  <p>
! Change the entry in column "Comments" for <tt>common_type</tt> in Table 51 —
! Other transformations (20.7.7.6 [meta.trans.other]):
  </p>
  
  <p><i>[
--- 80857,80864 ----
  
  <li>
  <p>
! Change the entry in column "Comments" for <tt>common_type</tt> in Table 51 &mdash;
! Other transformations (20.10.7.6 [meta.trans.other]):
  </p>
  
  <p><i>[
*************** all binary type combinations that are su
*** 72185,72204 ****
  ]</i></p>
  
  
! <blockquote>
  The member typedef <tt>type</tt> shall be defined as set out below. All
  types in the parameter pack <tt>T</tt> shall be complete <ins>or
  (possibly cv-qualified) <tt>void</tt></ins>. A program may specialize
  this trait if at least one template parameter in the specialization is a
  user-defined type. [<i>Note:</i> Such specializations are needed when
  only explicit conversions are desired among the template arguments.
! — <i>end note</i>]
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.7.7.6 [meta.trans.other]/3 as indicated:
  </p>
  
  <p><i>[
--- 80868,80887 ----
  ]</i></p>
  
  
! <blockquote><p>
  The member typedef <tt>type</tt> shall be defined as set out below. All
  types in the parameter pack <tt>T</tt> shall be complete <ins>or
  (possibly cv-qualified) <tt>void</tt></ins>. A program may specialize
  this trait if at least one template parameter in the specialization is a
  user-defined type. [<i>Note:</i> Such specializations are needed when
  only explicit conversions are desired among the template arguments.
! &mdash; <i>end note</i>]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.10.7.6 [meta.trans.other]/3 as indicated:
  </p>
  
  <p><i>[
*************** The nested typedef <tt>common_type::type
*** 72217,72223 ****
  <p>
  [..]
  </p>
! <pre>template &lt;class T, class U&gt;
  struct common_type&lt;T, U&gt; {
  <del>private:
    static T&amp;&amp; __t();
--- 80900,80907 ----
  <p>
  [..]
  </p>
! <pre>
! template &lt;class T, class U&gt;
  struct common_type&lt;T, U&gt; {
  <del>private:
    static T&amp;&amp; __t();
*************** public:</del>
*** 72233,72242 ****
  <li>
  <p>
  Change X [func.ret]/1 as indicated
! [<i>This part solves some main aspects of issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1225">1225</a></i>]:
  </p>
  
! <blockquote><pre>namespace std {
    template &lt;class&gt; class result_of; // undefined
  
    template &lt;class Fn, class... ArgTypes&gt;
--- 80917,80927 ----
  <li>
  <p>
  Change X [func.ret]/1 as indicated
! [<i>This part solves some main aspects of issue <a href="lwg-defects.html#1225">1225</a></i>]:
  </p>
  
! <blockquote><pre>
! namespace std {
    template &lt;class&gt; class result_of; // undefined
  
    template &lt;class Fn, class... ArgTypes&gt;
*************** type, and rvalues otherwise.</del>
*** 72266,72279 ****
  
  <hr>
  <h3><a name="1256"></a>1256. <tt>weak_ptr</tt> comparison functions should be removed</h3>
! <p><b>Section:</b> 20.9.10.3 [util.smartptr.weak] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-11-04 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Additional to the necessary cleanup of the description of the the
! <tt>weak_ptr</tt> component from 20.9.10.3 [util.smartptr.weak]
! described in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1231">1231</a> it turns out that the currently deleted
  comparison functions of <tt>weak_ptr</tt> are not needed at all: There
  is no safe-bool conversion from <tt>weak_ptr</tt>, and it won't silently
  chose a conversion to <tt>shared_ptr</tt>.
--- 80951,80965 ----
  
  <hr>
  <h3><a name="1256"></a>1256. <tt>weak_ptr</tt> comparison functions should be removed</h3>
! <p><b>Section:</b> 20.8.2.3 [util.smartptr.weak] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-11-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.weak">issues</a> in [util.smartptr.weak].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Additional to the necessary cleanup of the description of the the
! <tt>weak_ptr</tt> component from 20.8.2.3 [util.smartptr.weak]
! described in <a href="lwg-defects.html#1231">1231</a> it turns out that the currently deleted
  comparison functions of <tt>weak_ptr</tt> are not needed at all: There
  is no safe-bool conversion from <tt>weak_ptr</tt>, and it won't silently
  chose a conversion to <tt>shared_ptr</tt>.
*************** chose a conversion to <tt>shared_ptr</tt
*** 72287,72296 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.10.3 [util.smartptr.weak]/1 as indicated:
  </p>
  
! <blockquote><pre>namespace std {
  template&lt;class T&gt; class weak_ptr {
  public:
  ...
--- 80973,80983 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.2.3 [util.smartptr.weak]/1 as indicated:
  </p>
  
! <blockquote><pre>
! namespace std {
  template&lt;class T&gt; class weak_ptr {
  public:
  ...
*************** public:
*** 72309,72318 ****
  
  <hr>
  <h3><a name="1257"></a>1257. Header &lt;ios&gt; still contains a <code>concept_map</code></h3>
! <p><b>Section:</b> 27.5 [iostreams.base] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-11-04 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostreams.base">issues</a> in [iostreams.base].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current WP still contains a <tt>concept_map</tt>.
--- 80996,81005 ----
  
  <hr>
  <h3><a name="1257"></a>1257. Header &lt;ios&gt; still contains a <code>concept_map</code></h3>
! <p><b>Section:</b> 27.5 [iostreams.base] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2009-11-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostreams.base">issues</a> in [iostreams.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current WP still contains a <tt>concept_map</tt>.
*************** Change Iostreams base classes 27.5 [iost
*** 72330,72336 ****
  as indicated:
  </p>
  
! <blockquote><pre><del>concept_map ErrorCodeEnum&lt;io_errc&gt; { };</del>
  <ins>template &lt;&gt; struct is_error_code_enum&lt;io_errc&gt; : true_type { }</ins>
  error_code make_error_code(io_errc e);
  error_condition make_error_condition(io_errc e);
--- 81017,81024 ----
  as indicated:
  </p>
  
! <blockquote><pre>
! <del>concept_map ErrorCodeEnum&lt;io_errc&gt; { };</del>
  <ins>template &lt;&gt; struct is_error_code_enum&lt;io_errc&gt; : true_type { }</ins>
  error_code make_error_code(io_errc e);
  error_condition make_error_condition(io_errc e);
*************** const error_category&amp; iostream_categ
*** 72344,72364 ****
  
  <hr>
  <h3><a name="1258"></a>1258. std::function Effects clause impossible to satisfy</h3>
! <p><b>Section:</b> 20.8.14.2.2 [func.wrap.func.mod] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-11-05 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! As of 20.8.14.2.2 [func.wrap.func.mod]/2+ we have the following
  prototype description:
  </p>
  
! <blockquote><pre>template&lt;class F, Allocator Alloc&gt;
    void assign(F, const Alloc&amp;);
  </pre>
! <blockquote>
  <i>Effects:</i> <tt>function(f, a).swap(*this)</tt>
! </blockquote>
  </blockquote>
  
  <p>
--- 81032,81053 ----
  
  <hr>
  <h3><a name="1258"></a>1258. std::function Effects clause impossible to satisfy</h3>
! <p><b>Section:</b> 20.9.12.2.2 [func.wrap.func.mod] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-11-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! As of 20.9.12.2.2 [func.wrap.func.mod]/2+ we have the following
  prototype description:
  </p>
  
! <blockquote><pre>
! template&lt;class F, Allocator Alloc&gt;
    void assign(F, const Alloc&amp;);
  </pre>
! <blockquote><p>
  <i>Effects:</i> <tt>function(f, a).swap(*this)</tt>
! </p></blockquote>
  </blockquote>
  
  <p>
*************** because there is no constructor that wou
*** 72370,72376 ****
  probable candidate is
  </p>
  
! <blockquote><pre>template&lt;class F, class A&gt; function(allocator_arg_t, const A&amp;, F);
  </pre></blockquote>
  
  <p>
--- 81059,81066 ----
  probable candidate is
  </p>
  
! <blockquote><pre>
! template&lt;class F, class A&gt; function(allocator_arg_t, const A&amp;, F);
  </pre></blockquote>
  
  <p>
*************** and the effects clause needs to be adapt
*** 72389,72401 ****
  
  <p><i>[
  2010-02-11 Moved to Tentatively NAD Editorial after 5 positive votes on
! c++std-lib.  It was noted that this issue was in partial conflict with <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1288">1288</a>, and the two issues were merged in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1288">1288</a>.
  ]</i></p>
  
  
  <p><b>Rationale:</b></p>
  <p>
! Addressed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1288">1288</a>.
  </p>
  
  
--- 81079,81091 ----
  
  <p><i>[
  2010-02-11 Moved to Tentatively NAD Editorial after 5 positive votes on
! c++std-lib.  It was noted that this issue was in partial conflict with <a href="lwg-defects.html#1288">1288</a>, and the two issues were merged in <a href="lwg-defects.html#1288">1288</a>.
  ]</i></p>
  
  
  <p><b>Rationale:</b></p>
  <p>
! Addressed by <a href="lwg-defects.html#1288">1288</a>.
  </p>
  
  
*************** Addressed by <a href="http://www.open-st
*** 72403,72409 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change in 20.8.14.2.2 [func.wrap.func.mod] the complete prototype description as
  indicated
  </p>
  <p><i>[
--- 81093,81099 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change in 20.9.12.2.2 [func.wrap.func.mod] the complete prototype description as
  indicated
  </p>
  <p><i>[
*************** the editor: Shouldn't there a paragraph
*** 72412,72424 ****
  ]</i></p>
  
  
! <blockquote><pre>template&lt;class F, <del>Allocator Alloc</del><ins>class A</ins>&gt;
    void assign(F <ins>f</ins>, const A<del>lloc</del>&amp; <ins>a</ins>);
  </pre>
! <blockquote>
  <ins>3</ins> <i>Effects:</i> <tt>function(<del>f, a</del><ins>allocator_arg, a,
  f</ins>).swap(*this)</tt>
! </blockquote>
  </blockquote>
  
  
--- 81102,81115 ----
  ]</i></p>
  
  
! <blockquote><pre>
! template&lt;class F, <del>Allocator Alloc</del><ins>class A</ins>>
    void assign(F <ins>f</ins>, const A<del>lloc</del>&amp; <ins>a</ins>);
  </pre>
! <blockquote><p>
  <ins>3</ins> <i>Effects:</i> <tt>function(<del>f, a</del><ins>allocator_arg, a,
  f</ins>).swap(*this)</tt>
! </p></blockquote>
  </blockquote>
  
  
*************** f</ins>).swap(*this)</tt>
*** 72427,72436 ****
  
  <hr>
  <h3><a name="1260"></a>1260. <tt>is_constructible&lt;int*,void*&gt;</tt> reports true</h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2009-11-07 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The specification of <tt>is_constructible&lt;T,Args...&gt;</tt> in
--- 81118,81128 ----
  
  <hr>
  <h3><a name="1260"></a>1260. <tt>is_constructible&lt;int*,void*&gt;</tt> reports true</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2009-11-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The specification of <tt>is_constructible&lt;T,Args...&gt;</tt> in
*************** The specification of <tt>is_constructibl
*** 72438,72444 ****
  uses
  </p>
  
! <blockquote><pre>static_cast&lt;T&gt;(create&lt;Args&gt;()...)
  </pre></blockquote>
  
  <p>
--- 81130,81137 ----
  uses
  </p>
  
! <blockquote><pre>
! static_cast&lt;T&gt;(create&lt;Args&gt;()...)
  </pre></blockquote>
  
  <p>
*************** Post-Rapperswil:
*** 72452,72467 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to <del>NAD Editorial</del><ins>Resolved</ins>, this issue is addressed by paper 
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3047.html">n3047</a>
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.7.4.3 [meta.unary.prop], p6:
  </p>
  
  <blockquote>
--- 81145,81160 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to <del>NAD Editorial</del><ins>Resolved</ins>, this issue is addressed by paper 
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3047.html">n3047</a>
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.10.4.3 [meta.unary.prop], p6:
  </p>
  
  <blockquote>
*************** definition</ins> would be well-formed:
*** 72477,72483 ****
  <p>
  if <tt>sizeof...(Args) == <ins>0</ins> <del>1</del></tt><del>, the expression</del>:
  </p>
! <blockquote><pre><del>static_cast&lt;T&gt;(create&lt;Args&gt;()...)</del>
  <ins>T t;</ins>
  </pre></blockquote>
  </li>
--- 81170,81177 ----
  <p>
  if <tt>sizeof...(Args) == <ins>0</ins> <del>1</del></tt><del>, the expression</del>:
  </p>
! <blockquote><pre>
! <del>static_cast&lt;T&gt;(create&lt;Args&gt;()...)</del>
  <ins>T t;</ins>
  </pre></blockquote>
  </li>
*************** if <tt>sizeof...(Args) == <ins>0</ins> <
*** 72485,72491 ****
  <p>
  otherwise <del>the expression</del>:
  </p>
! <blockquote><pre>T<ins> t</ins>(create&lt;Args&gt;()...);
  </pre></blockquote>
  </li>
  </ul>
--- 81179,81186 ----
  <p>
  otherwise <del>the expression</del>:
  </p>
! <blockquote><pre>
! T<ins> t</ins>(create&lt;Args&gt;()...);
  </pre></blockquote>
  </li>
  </ul>
*************** otherwise <del>the expression</del>:
*** 72496,72517 ****
  
  
  <hr>
! <h3><a name="1261"></a>1261. Insufficent overloads for <tt>to_string</tt> / <tt>to_wstring</tt></h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Christopher Jefferson <b>Opened:</b> 2009-11-10 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Reported on the gcc mailing list.
  </p>
  
! <blockquote>
  The code "<tt>int i; to_string(i);</tt>" fails to compile, as
  '<tt>int</tt>' is ambiguous between '<tt>long long</tt>' and '<tt>long
  long unsigned</tt>'. It seems unreasonable to expect users to cast
  numbers up to a larger type just to use <tt>to_string</tt>.
! </blockquote>
  
  <p><i>[
  2009-11-14 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
--- 81191,81212 ----
  
  
  <hr>
! <h3><a name="1261"></a>1261. Insufficent overloads for <tt>to_string</tt> &#47; <tt>to_wstring</tt></h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Christopher Jefferson <b>Opened:</b> 2009-11-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Reported on the gcc mailing list.
  </p>
  
! <blockquote><p>
  The code "<tt>int i; to_string(i);</tt>" fails to compile, as
  '<tt>int</tt>' is ambiguous between '<tt>long long</tt>' and '<tt>long
  long unsigned</tt>'. It seems unreasonable to expect users to cast
  numbers up to a larger type just to use <tt>to_string</tt>.
! </p></blockquote>
  
  <p><i>[
  2009-11-14 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
*************** numbers up to a larger type just to use
*** 72525,72531 ****
  <tt>to_wstring</tt> to:
  </p>
  
! <blockquote><pre><ins>string to_string(int val);</ins>
  <ins>string to_string(unsigned val);</ins>
  <ins>string to_string(long val);</ins>
  <ins>string to_string(unsigned long val);</ins>
--- 81220,81227 ----
  <tt>to_wstring</tt> to:
  </p>
  
! <blockquote><pre>
! <ins>string to_string(int val);</ins>
  <ins>string to_string(unsigned val);</ins>
  <ins>string to_string(long val);</ins>
  <ins>string to_string(unsigned long val);</ins>
*************** wstring to_wstring(long double val);
*** 72550,72556 ****
  In 21.5 [string.conversions], paragraph 7, change to:
  </p>
  
! <blockquote><pre><ins>string to_string(int val);</ins>
  <ins>string to_string(unsigned val);</ins>
  <ins>string to_string(long val);</ins>
  <ins>string to_string(unsigned long val);</ins>
--- 81246,81253 ----
  In 21.5 [string.conversions], paragraph 7, change to:
  </p>
  
! <blockquote><pre>
! <ins>string to_string(int val);</ins>
  <ins>string to_string(unsigned val);</ins>
  <ins>string to_string(long val);</ins>
  <ins>string to_string(unsigned long val);</ins>
*************** string to_string(unsigned long long val)
*** 72561,72567 ****
  string to_string(long double val);
  </pre>
  
! <blockquote>
  7 <i>Returns:</i> each function returns a <tt>string</tt> object holding
  the character representation of the value of its argument that would be
  generated by calling <tt>sprintf(buf, fmt, val)</tt> with a format
--- 81258,81264 ----
  string to_string(long double val);
  </pre>
  
! <blockquote><p>
  7 <i>Returns:</i> each function returns a <tt>string</tt> object holding
  the character representation of the value of its argument that would be
  generated by calling <tt>sprintf(buf, fmt, val)</tt> with a format
*************** specifier of <ins> <tt>"%d"</tt>, <tt>"%
*** 72570,72583 ****
  <ins><tt>"%f"</tt>, <tt>"%f"</tt>,</ins> or <tt>"%Lf"</tt>, respectively,
  where <tt>buf</tt> designates an internal character buffer of sufficient
  size.
! </blockquote>
  </blockquote>
  
  <p>
  In 21.5 [string.conversions], paragraph 14, change to:
  </p>
  
! <blockquote><pre><ins>wstring to_wstring(int val);</ins>
  <ins>wstring to_wstring(unsigned val);</ins>
  <ins>wstring to_wstring(long val);</ins>
  <ins>wstring to_wstring(unsigned long val);</ins>
--- 81267,81281 ----
  <ins><tt>"%f"</tt>, <tt>"%f"</tt>,</ins> or <tt>"%Lf"</tt>, respectively,
  where <tt>buf</tt> designates an internal character buffer of sufficient
  size.
! </p></blockquote>
  </blockquote>
  
  <p>
  In 21.5 [string.conversions], paragraph 14, change to:
  </p>
  
! <blockquote><pre>
! <ins>wstring to_wstring(int val);</ins>
  <ins>wstring to_wstring(unsigned val);</ins>
  <ins>wstring to_wstring(long val);</ins>
  <ins>wstring to_wstring(unsigned long val);</ins>
*************** wstring to_wstring(unsigned long long va
*** 72588,72594 ****
  wstring to_wstring(long double val);
  </pre>
  
! <blockquote>
  14	<i>Returns:</i> Each function returns a <tt>wstring</tt> object
  holding the character representation of the value of its argument that
  would be generated by calling <tt>swprintf(buf, buffsz, fmt, val)</tt>
--- 81286,81292 ----
  wstring to_wstring(long double val);
  </pre>
  
! <blockquote><p>
  14	<i>Returns:</i> Each function returns a <tt>wstring</tt> object
  holding the character representation of the value of its argument that
  would be generated by calling <tt>swprintf(buf, buffsz, fmt, val)</tt>
*************** with a format specifier of <ins> <tt>L"%
*** 72597,72603 ****
  <tt>L"%llu"</tt>, <ins><tt>L"%f"</tt>, <tt>L"%f"</tt>,</ins> or
  <tt>L"%Lf"</tt>, respectively, where <tt>buf</tt> designates an internal
  character buffer of sufficient size <tt>buffsz</tt>.
! </blockquote>
  </blockquote>
  
  
--- 81295,81301 ----
  <tt>L"%llu"</tt>, <ins><tt>L"%f"</tt>, <tt>L"%f"</tt>,</ins> or
  <tt>L"%Lf"</tt>, respectively, where <tt>buf</tt> designates an internal
  character buffer of sufficient size <tt>buffsz</tt>.
! </p></blockquote>
  </blockquote>
  
  
*************** character buffer of sufficient size <tt>
*** 72606,72627 ****
  
  <hr>
  <h3><a name="1262"></a>1262. <tt>std::less&lt;std::shared_ptr&lt;T&gt;&gt;</tt> is underspecified</h3>
! <p><b>Section:</b> 20.9.10.2.7 [util.smartptr.shared.cmp] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-10 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.9.10.2.7 [util.smartptr.shared.cmp]/5 says:
  </p>
  
! <blockquote>
  For templates <tt>greater</tt>, <tt>less</tt>, <tt>greater_equal</tt>, and <tt>less_equal</tt>, the
  partial specializations for <tt>shared_ptr</tt> shall yield a total order, even if
! the built-in operators <tt>&lt;</tt>, <tt>&gt;</tt>,
! <tt>&lt;=</tt>, and <tt>&gt;=</tt> do not. Moreover,
! <tt>less&lt;shared_ptr&lt;T&gt; &gt;::operator()(a, b)</tt> shall return
  <tt>std::less&lt;T*&gt;::operator()(a.get(), b.get())</tt>.
! </blockquote>
  
  <p>
  This is necessary in order to use <tt>shared_ptr</tt> as the key in associate
--- 81304,81324 ----
  
  <hr>
  <h3><a name="1262"></a>1262. <tt>std::less&lt;std::shared_ptr&lt;T&gt;&gt;</tt> is underspecified</h3>
! <p><b>Section:</b> 20.8.2.2.7 [util.smartptr.shared.cmp] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.8.2.2.7 [util.smartptr.shared.cmp]/5 says:
  </p>
  
! <blockquote><p>
  For templates <tt>greater</tt>, <tt>less</tt>, <tt>greater_equal</tt>, and <tt>less_equal</tt>, the
  partial specializations for <tt>shared_ptr</tt> shall yield a total order, even if
! the built-in operators <tt>&lt;</tt>, <tt>&gt;</tt>, <tt>&lt;=</tt>, and <tt>&gt;=</tt> do not. 
! Moreover, <tt>less&lt;shared_ptr&lt;T&gt; &gt;::operator()(a, b)</tt> shall return
  <tt>std::less&lt;T*&gt;::operator()(a.get(), b.get())</tt>.
! </p></blockquote>
  
  <p>
  This is necessary in order to use <tt>shared_ptr</tt> as the key in associate
*************** apply to <tt>shared_ptr</tt>.
*** 72638,72654 ****
  Earlier versions of the WP
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">n2798</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2857.pdf">n2857</a>)
! had the following note on
! that paragraph:
  </p>
  
! <blockquote>
! [Editor's
! note: It's not clear to me whether the first sentence is a requirement
! or a note. The second
! sentence seems to be a requirement, but it doesn't really belong here,
! under <tt>operator&lt;</tt>.]
! </blockquote>
  
  <p>
  I agree completely - if partial specializations are needed they should
--- 81335,81348 ----
  Earlier versions of the WP
  (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2798.pdf">n2798</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2857.pdf">n2857</a>)
! had the following note on that paragraph:
  </p>
  
! <blockquote><p>
! [Editor's note: It's not clear to me whether the first sentence is a requirement
! or a note. The second sentence seems to be a requirement, but it doesn't really belong 
! here, under <tt>operator&lt;</tt>.]
! </p></blockquote>
  
  <p>
  I agree completely - if partial specializations are needed they should
*************** be properly specified.
*** 72656,72662 ****
  </p>
  
  <p>
! 20.9.10.2.7 [util.smartptr.shared.cmp]/6 has a note saying the comparison operator
  allows <tt>shared_ptr</tt> objects to be used as keys in associative
  containers, which is misleading because something else like a
  <tt>std::less</tt> partial specialization is needed.  If it is not correct that
--- 81350,81356 ----
  </p>
  
  <p>
! 20.8.2.2.7 [util.smartptr.shared.cmp]/6 has a note saying the comparison operator
  allows <tt>shared_ptr</tt> objects to be used as keys in associative
  containers, which is misleading because something else like a
  <tt>std::less</tt> partial specialization is needed.  If it is not correct that
*************** note should be removed.
*** 72664,72670 ****
  </p>
  
  <p>
! 20.9.10.2.7 [util.smartptr.shared.cmp]/3 refers to '<tt>x</tt>' and
  '<tt>y</tt>' but the prototype has parameters '<tt>a</tt>' and
  '<tt>b</tt>' - that needs to be fixed even if the rest of the issue is
  NAD.
--- 81358,81364 ----
  </p>
  
  <p>
! 20.8.2.2.7 [util.smartptr.shared.cmp]/3 refers to '<tt>x</tt>' and
  '<tt>y</tt>' but the prototype has parameters '<tt>a</tt>' and
  '<tt>b</tt>' - that needs to be fixed even if the rest of the issue is
  NAD.
*************** other comparisons when defined in terms
*** 72679,72689 ****
  <ol>
  <li>
  <p>
! Replace 20.9.10.2.7 [util.smartptr.shared.cmp]/3 with the following and
  remove p5:
  </p>
  
! <blockquote><pre>template&lt;class T, class U&gt; bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b);
  </pre>
  <blockquote>
  <p>
--- 81373,81384 ----
  <ol>
  <li>
  <p>
! Replace 20.8.2.2.7 [util.smartptr.shared.cmp]/3 with the following and
  remove p5:
  </p>
  
! <blockquote><pre>
! template&lt;class T, class U&gt; bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b);
  </pre>
  <blockquote>
  <p>
*************** the built-in operators <tt>&lt;</tt>, <t
*** 72707,72713 ****
  <p>
  6 [<i>Note:</i> Defining a comparison operator allows
  <tt>shared_ptr</tt> objects to be used as keys in associative
! containers. — <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
--- 81402,81408 ----
  <p>
  6 [<i>Note:</i> Defining a comparison operator allows
  <tt>shared_ptr</tt> objects to be used as keys in associative
! containers. &mdash; <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
*************** containers. — <i>end note</i>]
*** 72716,72735 ****
  
  <li>
  <p>
! Add to 20.9.10.2 [util.smartptr.shared]/1 (after the <tt>shared_ptr</tt> comparisons)
  </p>
  
! <blockquote><pre>template&lt;class T&gt; struct greater&lt;shared_ptr&lt;T&gt;&gt;;
  template&lt;class T&gt; struct less&lt;shared_ptr&lt;T&gt;&gt;;
  template&lt;class T&gt; struct greater_equal&lt;shared_ptr&lt;T&gt;&gt;;
  template&lt;class T&gt; struct less_equal&lt;shared_ptr&lt;T&gt;&gt;;
  </pre></blockquote>
  
  <p>
! Remove 20.9.10.2.7 [util.smartptr.shared.cmp]/5 and /6 and replace with:
  </p>
  
! <blockquote><pre>template&lt;class T, class U&gt; bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b);
  </pre>
  <blockquote>
  <p>
--- 81411,81432 ----
  
  <li>
  <p>
! Add to 20.8.2.2 [util.smartptr.shared]/1 (after the <tt>shared_ptr</tt> comparisons)
  </p>
  
! <blockquote><pre>
! template&lt;class T&gt; struct greater&lt;shared_ptr&lt;T&gt;&gt;;
  template&lt;class T&gt; struct less&lt;shared_ptr&lt;T&gt;&gt;;
  template&lt;class T&gt; struct greater_equal&lt;shared_ptr&lt;T&gt;&gt;;
  template&lt;class T&gt; struct less_equal&lt;shared_ptr&lt;T&gt;&gt;;
  </pre></blockquote>
  
  <p>
! Remove 20.8.2.2.7 [util.smartptr.shared.cmp]/5 and /6 and replace with:
  </p>
  
! <blockquote><pre>
! template&lt;class T, class U&gt; bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b);
  </pre>
  <blockquote>
  <p>
*************** the built-in operators <tt>&lt;</tt>, <t
*** 72751,72757 ****
  <p><del>
  6 [<i>Note:</i> Defining a comparison operator allows
  <tt>shared_ptr</tt> objects to be used as keys in associative
! containers. — <i>end note</i>]
  </del></p>
  </blockquote>
  
--- 81448,81454 ----
  <p><del>
  6 [<i>Note:</i> Defining a comparison operator allows
  <tt>shared_ptr</tt> objects to be used as keys in associative
! containers. &mdash; <i>end note</i>]
  </del></p>
  </blockquote>
  
*************** binary_function&lt;shared_ptr&lt;T&gt;,
*** 72762,72770 ****
  };
  </ins></pre>
  
! <blockquote><ins>
  <tt>operator()</tt> returns <tt>greater&lt;T*&gt;()(a.get(), b.get())</tt>.
! </ins></blockquote>
  
  <pre><ins>
  template&lt;class T&gt; struct less&lt;shared_ptr&lt;T&gt;&gt; :
--- 81459,81467 ----
  };
  </ins></pre>
  
! <blockquote><p><ins>
  <tt>operator()</tt> returns <tt>greater&lt;T*&gt;()(a.get(), b.get())</tt>.
! </ins></p></blockquote>
  
  <pre><ins>
  template&lt;class T&gt; struct less&lt;shared_ptr&lt;T&gt;&gt; :
*************** binary_function&lt;shared_ptr&lt;T&gt;,
*** 72773,72781 ****
  };
  </ins></pre>
  
! <blockquote><ins>
  <tt>operator()</tt> returns <tt>less&lt;T*&gt;()(a.get(), b.get())</tt>.
! </ins></blockquote>
  
  <pre><ins>
  template&lt;class T&gt; struct greater_equal&lt;shared_ptr&lt;T&gt;&gt; :
--- 81470,81478 ----
  };
  </ins></pre>
  
! <blockquote><p><ins>
  <tt>operator()</tt> returns <tt>less&lt;T*&gt;()(a.get(), b.get())</tt>.
! </ins></p></blockquote>
  
  <pre><ins>
  template&lt;class T&gt; struct greater_equal&lt;shared_ptr&lt;T&gt;&gt; :
*************** binary_function&lt;shared_ptr&lt;T&gt;,
*** 72784,72792 ****
  };
  </ins></pre>
  
! <blockquote><ins>
  <tt>operator()</tt> returns <tt>greater_equal&lt;T*&gt;()(a.get(), b.get())</tt>.
! </ins></blockquote>
  
  <pre><ins>
  template&lt;class T&gt; struct less_equal&lt;shared_ptr&lt;T&gt;&gt; :
--- 81481,81489 ----
  };
  </ins></pre>
  
! <blockquote><p><ins>
  <tt>operator()</tt> returns <tt>greater_equal&lt;T*&gt;()(a.get(), b.get())</tt>.
! </ins></p></blockquote>
  
  <pre><ins>
  template&lt;class T&gt; struct less_equal&lt;shared_ptr&lt;T&gt;&gt; :
*************** binary_function&lt;shared_ptr&lt;T&gt;,
*** 72795,72803 ****
  };
  </ins></pre>
  
! <blockquote><ins>
  <tt>operator()</tt> returns <tt>less_equal&lt;T*&gt;()(a.get(), b.get())</tt>.
! </ins></blockquote>
  
  </blockquote>
  </li>
--- 81492,81500 ----
  };
  </ins></pre>
  
! <blockquote><p><ins>
  <tt>operator()</tt> returns <tt>less_equal&lt;T*&gt;()(a.get(), b.get())</tt>.
! </ins></p></blockquote>
  
  </blockquote>
  </li>
*************** binary_function&lt;shared_ptr&lt;T&gt;,
*** 72812,72822 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Replace 20.9.10.2.7 [util.smartptr.shared.cmp]/3 with the following and
  remove p5:
  </p>
  
! <blockquote><pre>template&lt;class T, class U&gt; bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b);
  </pre>
  <blockquote>
  <p>
--- 81509,81520 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Replace 20.8.2.2.7 [util.smartptr.shared.cmp]/3 with the following and
  remove p5:
  </p>
  
! <blockquote><pre>
! template&lt;class T, class U&gt; bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b);
  </pre>
  <blockquote>
  <p>
*************** the built-in operators <tt>&lt;</tt>, <t
*** 72840,72846 ****
  <p>
  6 [<i>Note:</i> Defining a comparison operator allows
  <tt>shared_ptr</tt> objects to be used as keys in associative
! containers. — <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
--- 81538,81544 ----
  <p>
  6 [<i>Note:</i> Defining a comparison operator allows
  <tt>shared_ptr</tt> objects to be used as keys in associative
! containers. &mdash; <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
*************** containers. — <i>end note</i>]
*** 72852,72861 ****
  
  <hr>
  <h3><a name="1264"></a>1264. <tt>quick_exit</tt> support for freestanding implementations</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-11-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 172</b></p>
  
--- 81550,81559 ----
  
  <hr>
  <h3><a name="1264"></a>1264. <tt>quick_exit</tt> support for freestanding implementations</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-11-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 172</b></p>
  
*************** supported.
*** 72894,72908 ****
  Ammend p3 Freestanding implementations 17.6.1.3 [compliance]
  </p>
  
! <blockquote>
  3 The supplied version of the header <tt>&lt;cstdlib&gt;</tt> shall
  declare at least the functions <tt>abort<del>()</del></tt>, <tt>atexit<del>()</del></tt>,
  <ins><tt>at_quick_exit</tt>,</ins> <del>and</del> <tt>exit<del>()</del></tt><ins>, and
  <tt>quick_exit</tt></ins>(18.5 [support.start.term]). The other
  headers listed in this table shall meet the same requirements as for a
  hosted implementation.
! </blockquote>
  
  
  
  
--- 81592,81691 ----
  Ammend p3 Freestanding implementations 17.6.1.3 [compliance]
  </p>
  
! <blockquote><p>
  3 The supplied version of the header <tt>&lt;cstdlib&gt;</tt> shall
  declare at least the functions <tt>abort<del>()</del></tt>, <tt>atexit<del>()</del></tt>,
  <ins><tt>at_quick_exit</tt>,</ins> <del>and</del> <tt>exit<del>()</del></tt><ins>, and
  <tt>quick_exit</tt></ins>(18.5 [support.start.term]). The other
  headers listed in this table shall meet the same requirements as for a
  hosted implementation.
! </p></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1266"></a>1266. <tt>shared_future::get</tt> and deferred <tt>async</tt> functions</h3>
! <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! If a <tt>shared_future</tt> is constructed with the result of an <tt>async</tt> call with a
! deferred function, and two or more copies of that <tt>shared_future</tt> are created,
! with multiple threads calling <tt>get()</tt>, it is not clear which thread runs the
! deferred function. 30.6.7 [futures.shared_future]p22 from
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>
! says (minus editor's note):
! </p>
! 
! <blockquote><p>
! <i>Effects:</i> if the associated state contains a deferred function, executes
! the deferred function. Otherwise, blocks until the associated state is ready.
! </p></blockquote>
! 
! <p>
! In the absence of wording to the contrary, this implies that every thread that
! calls <tt>wait()</tt> will execute the deferred function.
! </p>
  
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Replace 30.6.7 [futures.shared_future]p22 with the following:
+ </p>
+ 
+ <blockquote>
+ <p>
+ <i>Effects:</i> If the associated state 
+ <del>contains a deferred function, executes the deferred function. Otherwise,
+ blocks until the associated state is ready.</del>
+ <ins>was created by a <tt>promise</tt> or <tt>packaged_task</tt> object, block
+ until the associated state is ready. If the associated state is associated with
+ a thread created for an <tt>async</tt> call (30.6.8 [futures.async]), as
+ if <tt>associated-thread.join()</tt>.
+ </ins></p>
+ 
+ <p><ins>
+ If the associated state contains a deferred function, calls to <tt>wait()</tt>
+ on all <tt>shared_future</tt> objects that share the same associated state are
+ serialized. The first call to <tt>wait()</tt> that shares a given associated
+ state executes the deferred function and stores the return value or exception in
+ the associated state.
+ </ins></p>
+ 
+ <p><ins>
+ <i>Synchronization:</i> if the associated state was created by a
+ <tt>promise</tt> object, the completion of <tt>set_value()</tt> or
+ <tt>set_exception()</tt> to that <tt>promise</tt> happens before (1.10 [intro.multithread]) <tt>wait()</tt> returns. If the associated state
+ was created by a <tt>packaged_task</tt> object, the completion of the associated
+ task happens before <tt>wait()</tt> returns. If the associated state is
+ associated with a thread created for an <tt>async</tt> call (30.6.8 [futures.async]), the completion of the associated thread happens-before
+ <tt>wait()</tt> returns.
+ </ins></p>
+ 
+ <p><ins>
+ If the associated state contained a deferred function, the invocation of the
+ deferred function happens-before any call to <tt>wait()</tt> on a
+ <tt>future</tt> that shares that state returns.
+ </ins></p>
+ </blockquote>
  
  
  
*************** hosted implementation.
*** 72910,72919 ****
  
  <hr>
  <h3><a name="1267"></a>1267. Incorrect wording for <tt>condition_variable_any::wait_for</tt></h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-17 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.2 [thread.condition.condvarany]p18 and 30.5.2 [thread.condition.condvarany]p27 specify incorrect preconditions for
--- 81693,81702 ----
  
  <hr>
  <h3><a name="1267"></a>1267. Incorrect wording for <tt>condition_variable_any::wait_for</tt></h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  30.5.2 [thread.condition.condvarany]p18 and 30.5.2 [thread.condition.condvarany]p27 specify incorrect preconditions for
*************** such a requirement.
*** 72935,72941 ****
  Remove 30.5.2 [thread.condition.condvarany]p18 and 30.5.2 [thread.condition.condvarany]p27.
  </p>
  <blockquote>
! <pre>template &lt;class Lock, class Rep, class Period&gt;
    cv_status wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
  <blockquote>
--- 81718,81725 ----
  Remove 30.5.2 [thread.condition.condvarany]p18 and 30.5.2 [thread.condition.condvarany]p27.
  </p>
  <blockquote>
! <pre>
! template &lt;class Lock, class Rep, class Period&gt;
    cv_status wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
  <blockquote>
*************** supplied by all concurrently waiting (vi
*** 72956,72962 ****
  
  <p>...</p>
  
! <pre>template &lt;class Lock, class Rep, class Period, class Predicate&gt;
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, Predicate pred);
  </pre>
  
--- 81740,81747 ----
  
  <p>...</p>
  
! <pre>
! template &lt;class Lock, class Rep, class Period, class Predicate&gt;
    bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, Predicate pred);
  </pre>
  
*************** supplied by all concurrently waiting (vi
*** 72987,72996 ****
  
  <hr>
  <h3><a name="1268"></a>1268. The Mutex requirements in 30.4.1 and 30.4.2 are wrong</h3>
! <p><b>Section:</b> 30.4 [thread.mutex] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-17 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex">issues</a> in [thread.mutex].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>Mutex</tt> requirements in 30.4.1 [thread.mutex.requirements] and
--- 81772,81781 ----
  
  <hr>
  <h3><a name="1268"></a>1268. The Mutex requirements in 30.4.1 and 30.4.2 are wrong</h3>
! <p><b>Section:</b> 30.4 [thread.mutex] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex">issues</a> in [thread.mutex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>Mutex</tt> requirements in 30.4.1 [thread.mutex.requirements] and
*************** Move to open status. Suggest Anthony loo
*** 73036,73042 ****
  requirements. Suggest Anthony refine requirements/concepts categories.
  </p>
  <p>
! Related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#964">964</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#966">966</a>
  </p>
  </blockquote>
  
--- 81821,81827 ----
  requirements. Suggest Anthony refine requirements/concepts categories.
  </p>
  <p>
! Related to <a href="lwg-defects.html#964">964</a> and <a href="lwg-defects.html#966">966</a>
  </p>
  </blockquote>
  
*************** Related to <a href="http://www.open-std.
*** 73050,73074 ****
  ]</i></p>
  
  
! <blockquote>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3130.html">n3130</a> would solve this issue.
! </blockquote>
  
  <p><i>[
  2010-11 Batavia:
  ]</i></p>
  
  
! <blockquote>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3197.html">n3197</a>.
! </blockquote>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new section to 30.2 [thread.req] after 30.2.4 [thread.req.timing] as follows:
  </p>
  
  <blockquote>
--- 81835,81861 ----
  ]</i></p>
  
  
! <blockquote><p>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3130.html">n3130</a> 
! would solve this issue.
! </p></blockquote>
  
  <p><i>[
  2010-11 Batavia:
  ]</i></p>
  
  
! <blockquote><p>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3197.htm">n3197</a>.
! </p></blockquote>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new section to 30.2 [thread.req] after 30.2.4 [thread.req.timing] 
! as follows:
  </p>
  
  <blockquote>
*************** specified for either the <tt>Lockable</t
*** 73083,73089 ****
  <tt>TimedLockable</tt> requirements as appropriate to acquire or release
  ownership of a <tt>lock</tt> by a given <tt>thread</tt>. [<i>Note:</i> the
  nature of any lock ownership and any synchronization it may entail are not part
! of these requirements. — <i>end note</i>]
  </p>
  
  <p>
--- 81870,81876 ----
  <tt>TimedLockable</tt> requirements as appropriate to acquire or release
  ownership of a <tt>lock</tt> by a given <tt>thread</tt>. [<i>Note:</i> the
  nature of any lock ownership and any synchronization it may entail are not part
! of these requirements. &mdash; <i>end note</i>]
  </p>
  
  <p>
*************** For a type to qualify as <tt>TimedLockab
*** 73139,73146 ****
  expressions must be well-formed, with the specified semantics,
  where <tt>m</tt> is an instance of a type <tt>TL</tt> that supports
  the <tt>TimedLockable</tt> requirements, <tt>rel_time</tt> denotes
! instantiation of <tt>duration</tt> (20.11.3 [time.duration]) and <tt>abs_time</tt>
! denotes an instantiation of <tt>time_point</tt> (20.11.4 [time.point])
  
  </p>
  
--- 81926,81933 ----
  expressions must be well-formed, with the specified semantics,
  where <tt>m</tt> is an instance of a type <tt>TL</tt> that supports
  the <tt>TimedLockable</tt> requirements, <tt>rel_time</tt> denotes
! instantiation of <tt>duration</tt> (20.12.5 [time.duration]) and <tt>abs_time</tt>
! denotes an instantiation of <tt>time_point</tt> (20.12.6 [time.point])
  
  </p>
  
*************** Replace 30.4.1 [thread.mutex.requirement
*** 73176,73182 ****
  following:
  </p>
  
! <blockquote>
  2 This section describes requirements on <del>template argument types
  used to instantiate templates defined in</del> <ins>the mutex types
  supplied by</ins> the C++ standard library. <del>The template
--- 81963,81969 ----
  following:
  </p>
  
! <blockquote><p>
  2 This section describes requirements on <del>template argument types
  used to instantiate templates defined in</del> <ins>the mutex types
  supplied by</ins> the C++ standard library. <del>The template
*************** of <del>a <tt>Mutex</tt> type</del>
*** 73187,73228 ****
  <ins>one of the standard library mutex types <tt>std::mutex</tt>,
  <tt>std::recursive_mutex</tt>, <tt>std::timed_mutex</tt> or
  <tt>std::recursive_timed_mutex</tt>.</ins>.
! </blockquote>
  
  <p>
  Add the following paragraph after 30.4.1 [thread.mutex.requirements]
  paragraph 2:
  </p>
  
! <blockquote><ins>
  A <tt>Mutex</tt> type shall conform to the <tt>Lockable</tt>
  requirements (30.2.5.1).
! </ins></blockquote>
  
  <p>
  Replace 30.4.1.3 [thread.timedmutex.requirements] paragraph 1 with the
  following:
  </p>
  
! <blockquote>
  <ins>The C++ standard library <tt>TimedMutex</tt> types <tt>std::timed_mutex</tt>
    and <tt>std::recursive_timed_mutex</tt> </ins>
  <del>A <tt>TimedMutex</tt> type</del> shall meet the requirements for
  a <tt>Mutex</tt> type. In addition, <del>it</del><ins>they</ins> shall
  meet the requirements set out <del>in this Clause 30.4.2</del><ins>below</ins>,
  where <tt>rel_time</tt> denotes an instantiation of <tt>duration</tt>
! (20.11.3 [time.duration]) and <tt>abs_time</tt> denotes an instantiation
! of <tt>time_point</tt> (20.11.4 [time.point]).
! </blockquote>
  
  <p>
  Add the following paragraph after 30.4.1.3 [thread.timedmutex.requirements] paragraph 1:
  </p>
  
! <blockquote><ins>
  A <tt>TimedMutex</tt> type shall conform to the <tt>TimedLockable</tt>
  requirements (30.2.5.1).
! </ins></blockquote>
  
  
  <p>
--- 81974,82015 ----
  <ins>one of the standard library mutex types <tt>std::mutex</tt>,
  <tt>std::recursive_mutex</tt>, <tt>std::timed_mutex</tt> or
  <tt>std::recursive_timed_mutex</tt>.</ins>.
! </p></blockquote>
  
  <p>
  Add the following paragraph after 30.4.1 [thread.mutex.requirements]
  paragraph 2:
  </p>
  
! <blockquote><p><ins>
  A <tt>Mutex</tt> type shall conform to the <tt>Lockable</tt>
  requirements (30.2.5.1).
! </ins></p></blockquote>
  
  <p>
  Replace 30.4.1.3 [thread.timedmutex.requirements] paragraph 1 with the
  following:
  </p>
  
! <blockquote><p>
  <ins>The C++ standard library <tt>TimedMutex</tt> types <tt>std::timed_mutex</tt>
    and <tt>std::recursive_timed_mutex</tt> </ins>
  <del>A <tt>TimedMutex</tt> type</del> shall meet the requirements for
  a <tt>Mutex</tt> type. In addition, <del>it</del><ins>they</ins> shall
  meet the requirements set out <del>in this Clause 30.4.2</del><ins>below</ins>,
  where <tt>rel_time</tt> denotes an instantiation of <tt>duration</tt>
! (20.12.5 [time.duration]) and <tt>abs_time</tt> denotes an instantiation
! of <tt>time_point</tt> (20.12.6 [time.point]).
! </p></blockquote>
  
  <p>
  Add the following paragraph after 30.4.1.3 [thread.timedmutex.requirements] paragraph 1:
  </p>
  
! <blockquote><p><ins>
  A <tt>TimedMutex</tt> type shall conform to the <tt>TimedLockable</tt>
  requirements (30.2.5.1).
! </ins></p></blockquote>
  
  
  <p>
*************** Add the following paragraph following 30
*** 73230,73247 ****
  paragraph 1:
  </p>
  
! <blockquote><ins>
  The supplied <tt>Mutex</tt> type shall meet the <tt>Lockable</tt> 
! requirements
! (30.2.5.1).
! </ins></blockquote>
  
  <p>
  Add the following paragraph following 30.4.2.2 [thread.lock.unique]
  paragraph 1:
  </p>
  
! <blockquote><ins>
  The supplied <tt>Mutex</tt> type shall meet the <tt>Lockable</tt> 
  requirements
  (30.2.5.1). <tt>unique_lock&lt;Mutex&gt;</tt> meets the <tt>Lockable</tt>
--- 82017,82033 ----
  paragraph 1:
  </p>
  
! <blockquote><p><ins>
  The supplied <tt>Mutex</tt> type shall meet the <tt>Lockable</tt> 
! requirements (30.2.5.1).
! </ins></p></blockquote>
  
  <p>
  Add the following paragraph following 30.4.2.2 [thread.lock.unique]
  paragraph 1:
  </p>
  
! <blockquote><p><ins>
  The supplied <tt>Mutex</tt> type shall meet the <tt>Lockable</tt> 
  requirements
  (30.2.5.1). <tt>unique_lock&lt;Mutex&gt;</tt> meets the <tt>Lockable</tt>
*************** requirements. If <tt>Mutex</tt> meets th
*** 73249,73262 ****
  requirements
  (30.2.5.2) then <tt>unique_lock&lt;Mutex&gt;</tt> also meets the
  <tt>TimedLockable</tt> requirements.
! </ins></blockquote>
  
  <p>
  Replace the use of "mutex" or "mutex object" with "lockable object"
  throughout clause 30.4.2 [thread.lock] paragraph 1:
  </p>
  
! <blockquote>
  1 A lock is an object that holds a reference to
  a <del>mutex</del><ins>lockable object</ins> and may unlock
  the <del>mutex</del><ins>lockable object</ins> during the lock's
--- 82035,82048 ----
  requirements
  (30.2.5.2) then <tt>unique_lock&lt;Mutex&gt;</tt> also meets the
  <tt>TimedLockable</tt> requirements.
! </ins></p></blockquote>
  
  <p>
  Replace the use of "mutex" or "mutex object" with "lockable object"
  throughout clause 30.4.2 [thread.lock] paragraph 1:
  </p>
  
! <blockquote><p>
  1 A lock is an object that holds a reference to
  a <del>mutex</del><ins>lockable object</ins> and may unlock
  the <del>mutex</del><ins>lockable object</ins> during the lock's
*************** object</ins> for a thread of execution.
*** 73269,73288 ****
  lifetime of the <del>mutex</del><ins>lockable object</ins> it
  references.  [ Note: Locks are intended to ease the burden of
  unlocking the <del>mutex</del><ins>lockable object</ins> under both
! normal and exceptional circumstances. — end note ]
! </blockquote>
  
  <p>30.4.2 [thread.lock] paragaph 2:</p>
  
! <blockquote>
  2 Some lock constructors take tag types which describe what should be
  done with the <del>mutex</del><ins>lockable</ins> object during the
  lock's constuction.
! </blockquote>
  
  <p>30.4.2.1 [thread.lock.guard] paragaph 1:</p>
  
! <blockquote>
  1 An object of type <tt>lock_guard</tt> controls the ownership of a
    <del>mutex</del><ins>lockable</ins> object within a scope. A
  <tt>lock_guard</tt> object maintains ownership of
--- 82055,82074 ----
  lifetime of the <del>mutex</del><ins>lockable object</ins> it
  references.  [ Note: Locks are intended to ease the burden of
  unlocking the <del>mutex</del><ins>lockable object</ins> under both
! normal and exceptional circumstances. &mdash; end note ]
! </p></blockquote>
  
  <p>30.4.2 [thread.lock] paragaph 2:</p>
  
! <blockquote><p>
  2 Some lock constructors take tag types which describe what should be
  done with the <del>mutex</del><ins>lockable</ins> object during the
  lock's constuction.
! </p></blockquote>
  
  <p>30.4.2.1 [thread.lock.guard] paragaph 1:</p>
  
! <blockquote><p>
  1 An object of type <tt>lock_guard</tt> controls the ownership of a
    <del>mutex</del><ins>lockable</ins> object within a scope. A
  <tt>lock_guard</tt> object maintains ownership of
*************** is undefined if the <del>mutex</del><ins
*** 73292,73306 ****
  referenced by <tt>pm</tt> does not exist for the entire lifetime (3.8)
  of the <tt>lock_guard</tt> object. <ins><tt>Mutex</tt> shall meet
    the <tt>Lockable</tt> requirements (30.2.5.1).</ins>
! </blockquote>
  
  <p>30.4.2.2 [thread.lock.unique] paragaph 1:</p>
  
! <blockquote>
  1 An object of type <tt>unique_lock</tt> controls the ownership of
  a <del>mutex</del><ins>lockable object</ins> within a
! scope. <del>Mutex</del> <del>o</del><ins>O</ins>wnership <ins>of the
! lockable object</ins> may be acquired at construction or after
  construction, and may be transferred, after acquisition, to
  another <tt>unique_lock</tt> object. Objects of
  type <tt>unique_lock</tt> are not copyable but are movable. The
--- 82078,82092 ----
  referenced by <tt>pm</tt> does not exist for the entire lifetime (3.8)
  of the <tt>lock_guard</tt> object. <ins><tt>Mutex</tt> shall meet
    the <tt>Lockable</tt> requirements (30.2.5.1).</ins>
! </p></blockquote>
  
  <p>30.4.2.2 [thread.lock.unique] paragaph 1:</p>
  
! <blockquote><p>
  1 An object of type <tt>unique_lock</tt> controls the ownership of
  a <del>mutex</del><ins>lockable object</ins> within a
! scope. <Del>Mutex</Del> <del>o</del><ins>O</ins>wnership <Ins>of the
! lockable object</Ins> may be acquired at construction or after
  construction, and may be transferred, after acquisition, to
  another <tt>unique_lock</tt> object. Objects of
  type <tt>unique_lock</tt> are not copyable but are movable. The
*************** pointer <tt>pm</tt> is not null and the
*** 73309,73321 ****
  by <tt>pm</tt> does not exist for the entire remaining lifetime (3.8)
  of the <tt>unique_lock</tt> object. <ins><tt>Mutex</tt> shall meet
  the <tt>Lockable</tt> requirements (30.2.5.1).</ins>
! </blockquote>
  
  
  <p>
  Add the following to the precondition of <tt>unique_lock(mutex_type&amp;
!  m,
! const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time)</tt> in 
  30.4.2.2.1 [thread.lock.unique.cons] paragraph 18:
  </p>
  
--- 82095,82106 ----
  by <tt>pm</tt> does not exist for the entire remaining lifetime (3.8)
  of the <tt>unique_lock</tt> object. <ins><tt>Mutex</tt> shall meet
  the <tt>Lockable</tt> requirements (30.2.5.1).</ins>
! </p></blockquote>
  
  
  <p>
  Add the following to the precondition of <tt>unique_lock(mutex_type&amp;
! m, const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time)</tt> in 
  30.4.2.2.1 [thread.lock.unique.cons] paragraph 18:
  </p>
  
*************** const chrono::time_point&lt;Clock, Durat
*** 73323,73334 ****
    unique_lock(mutex_type&amp; m, const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
  </pre>
  
! <blockquote>
  18 <i>Requires:</i> If <tt>mutex_type</tt> is not a recursive mutex 
! the
! calling thread does not own the mutex. <ins>The supplied <tt>mutex_type</tt>
  type shall meet the <tt>TimedLockable</tt> requirements (30.2.5.2).</ins>
! </blockquote>
  </blockquote>
  
  <p>
--- 82108,82118 ----
    unique_lock(mutex_type&amp; m, const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
  </pre>
  
! <blockquote><p>
  18 <i>Requires:</i> If <tt>mutex_type</tt> is not a recursive mutex 
! the calling thread does not own the mutex. <ins>The supplied <tt>mutex_type</tt>
  type shall meet the <tt>TimedLockable</tt> requirements (30.2.5.2).</ins>
! </p></blockquote>
  </blockquote>
  
  <p>
*************** const chrono::duration&lt;Rep, Period&gt
*** 73339,73350 ****
  paragraph 22
  </p>
  
! <blockquote>
  22  <i>Requires:</i> If <tt>mutex_type</tt> is not a recursive mutex
   the
  calling thread does not own the mutex. <ins>The supplied <tt>mutex_type</tt>
  type shall meet the <tt>TimedLockable</tt> requirements (30.2.5.2).</ins>
! </blockquote>
  
  <p>
  Add the following as a precondition of <tt>bool try_lock_until(const
--- 82123,82134 ----
  paragraph 22
  </p>
  
! <blockquote><p>
  22  <i>Requires:</i> If <tt>mutex_type</tt> is not a recursive mutex
   the
  calling thread does not own the mutex. <ins>The supplied <tt>mutex_type</tt>
  type shall meet the <tt>TimedLockable</tt> requirements (30.2.5.2).</ins>
! </p></blockquote>
  
  <p>
  Add the following as a precondition of <tt>bool try_lock_until(const
*************** chrono::time_point&lt;Clock, Duration&gt
*** 73355,73364 ****
  <blockquote><pre>template &lt;class Clock, class Duration&gt;
    bool try_lock_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
  </pre>
! <blockquote><ins>
  <i>Requires:</i> The supplied <tt>mutex_type</tt> type shall meet the
  <tt>TimedLockable</tt> requirements (30.2.5.2).
! </ins></blockquote>
  </blockquote>
  
  <p>
--- 82139,82148 ----
  <blockquote><pre>template &lt;class Clock, class Duration&gt;
    bool try_lock_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
  </pre>
! <blockquote><p><ins>
  <i>Requires:</i> The supplied <tt>mutex_type</tt> type shall meet the
  <tt>TimedLockable</tt> requirements (30.2.5.2).
! </ins></p></blockquote>
  </blockquote>
  
  <p>
*************** chrono::duration&lt;Rep, Period&gt;&amp;
*** 73370,73379 ****
  <blockquote><pre>template &lt;class Rep, class Period&gt;
    bool try_lock_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
! <blockquote><ins>
  <i>Requires:</i> The supplied <tt>mutex_type</tt> type shall meet the
  <tt>TimedLockable</tt> requirements (30.2.5.2).
! </ins></blockquote>
  </blockquote>
  
  <p>
--- 82154,82163 ----
  <blockquote><pre>template &lt;class Rep, class Period&gt;
    bool try_lock_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre>
! <blockquote><p><ins>
  <i>Requires:</i> The supplied <tt>mutex_type</tt> type shall meet the
  <tt>TimedLockable</tt> requirements (30.2.5.2).
! </ins></p></blockquote>
  </blockquote>
  
  <p>
*************** Replace 30.4.3 [thread.lock.algorithm] p
*** 73382,73396 ****
  
  <blockquote><pre>template &lt;class L1, class L2, class... L3&gt; int try_lock(L1&amp;, L2&amp;, L3&amp;...);
  </pre>
! <blockquote>
  1 <i>Requires:</i> Each template parameter type shall meet the
  <tt><del>Mutex</del> <ins>Lockable</ins></tt> requirements
  <ins>(30.2.5.1).</ins><del>, except that a call to <tt>try_lock()</tt> 
! may throw
! an exception.</del> [<i>Note:</i> The <tt>unique_lock</tt> class 
! template meets
! these requirements when suitably instantiated. — <i>end note</i>]
! </blockquote>
  </blockquote>
  
  <p>
--- 82166,82178 ----
  
  <blockquote><pre>template &lt;class L1, class L2, class... L3&gt; int try_lock(L1&amp;, L2&amp;, L3&amp;...);
  </pre>
! <blockquote><p>
  1 <i>Requires:</i> Each template parameter type shall meet the
  <tt><del>Mutex</del> <ins>Lockable</ins></tt> requirements
  <ins>(30.2.5.1).</ins><del>, except that a call to <tt>try_lock()</tt> 
! may throw an exception.</del> [<i>Note:</i> The <tt>unique_lock</tt> class 
! template meets these requirements when suitably instantiated. &mdash; <i>end note</i>]
! </p></blockquote>
  </blockquote>
  
  <p>
*************** Replace 30.4.3 [thread.lock.algorithm] p
*** 73399,73427 ****
  
  <blockquote><pre>template &lt;class L1, class L2, class... L3&gt; void lock(L1&amp;, L2&amp;, L3&amp;...);
  </pre>
! <blockquote>
  4 <i>Requires:</i> Each template parameter type shall meet the
  <tt>Mutex<del>Mutex</del> <ins>Lockable</ins></tt>
  requirements <ins>(30.2.5.1).</ins><del>, except that a call to
  <tt>try_lock()</tt> may throw an exception.</del> [<i>Note:</i> The
  <tt>unique_lock</tt> class template meets these requirements when 
! suitably
! instantiated. — <i>end note</i>]
! </blockquote>
  </blockquote>
  
  <p>
  Replace 30.5.2 [thread.condition.condvarany] paragraph 1 with:
  </p>
  
! <blockquote>
  1 A <tt>Lock</tt> type shall meet the <del>requirements for a <tt>Mutex</tt>
  type</del> <ins><tt>Lockable</tt> requirements (30.2.5.1)</ins>, except 
! that
! <tt>try_lock</tt> is not required. [<i>Note:</i> All of the standard 
! mutex types
! meet this requirement. — <i>end note</i>]
! </blockquote>
  
  
  
--- 82181,82206 ----
  
  <blockquote><pre>template &lt;class L1, class L2, class... L3&gt; void lock(L1&amp;, L2&amp;, L3&amp;...);
  </pre>
! <blockquote><p>
  4 <i>Requires:</i> Each template parameter type shall meet the
  <tt>Mutex<del>Mutex</del> <ins>Lockable</ins></tt>
  requirements <ins>(30.2.5.1).</ins><del>, except that a call to
  <tt>try_lock()</tt> may throw an exception.</del> [<i>Note:</i> The
  <tt>unique_lock</tt> class template meets these requirements when 
! suitably instantiated. &mdash; <i>end note</i>]
! </p></blockquote>
  </blockquote>
  
  <p>
  Replace 30.5.2 [thread.condition.condvarany] paragraph 1 with:
  </p>
  
! <blockquote><p>
  1 A <tt>Lock</tt> type shall meet the <del>requirements for a <tt>Mutex</tt>
  type</del> <ins><tt>Lockable</tt> requirements (30.2.5.1)</ins>, except 
! that <tt>try_lock</tt> is not required. [<i>Note:</i> All of the standard 
! mutex types meet this requirement. &mdash; <i>end note</i>]
! </p></blockquote>
  
  
  
*************** meet this requirement. — <i>end note</i>
*** 73429,73439 ****
  
  
  <hr>
  <h3><a name="1270"></a>1270. <tt>result_of</tt> should be moved to <tt>&lt;type_traits&gt;</tt></h3>
! <p><b>Section:</b> X [func.ret] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-11-19 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.ret">issues</a> in [func.ret].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 198</b></p>
  
--- 82208,82286 ----
  
  
  <hr>
+ <h3><a name="1269"></a>1269. Associated state doesn't account for <tt>async</tt></h3>
+ <p><b>Section:</b> 30.6.4 [futures.state] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-18 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.state">issues</a> in [futures.state].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The current description of the associated state in 30.6.4 [futures.state]
+ does not allow for futures created by an <tt>async</tt> call. The description
+ therefore needs to be extended to cover that.
+ </p>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add a new sentence to 30.6.4 [futures.state] p2:
+ </p>
+ 
+ <blockquote><p>
+ 2 This <i>associated state</i> consists of some state information and some
+ (possibly not yet evaluated) <i>result</i>, which can be a (possibly
+ <tt>void</tt>) value or an exception. <ins>If the associated state was created
+ by a call to <tt>async</tt> (30.6.8 [futures.async]) then it may also
+ contain a deferred function or an associated <tt>thread</tt>.</ins>
+ </p></blockquote>
+ 
+ <p>
+ Add an extra bullet to 30.6.4 [futures.state] p3:
+ </p>
+ 
+ <blockquote>
+ <p>
+ The result of an associated state can be set by calling:
+ </p>
+ <ul>
+ <li>
+ <tt>promise::set_value</tt>,
+ </li>
+ <li>
+ <tt>promise::set_exception</tt>, <del>or</del>
+ </li>
+ <li>
+ packaged_task::operator()<del>.</del><ins>, or</ins>
+ </li>
+ <li>
+ <ins>a call to <tt>async</tt> (30.6.8 [futures.async]).</ins>
+ </li>
+ </ul>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1270"></a>1270. <tt>result_of</tt> should be moved to <tt>&lt;type_traits&gt;</tt></h3>
! <p><b>Section:</b> X [func.ret] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-11-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.ret">issues</a> in [func.ret].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 198</b></p>
  
*************** although a more consistent form for type
*** 73467,73473 ****
  </p>
  
  <p>
! Following the acceptance of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>, <tt>result_of</tt> now
  depends on the <tt>declval</tt> function template, tentatively provided
  in <tt>&lt;utility&gt;</tt> which is <em>not</em> (yet) required of a
  free-standing implementation.
--- 82314,82320 ----
  </p>
  
  <p>
! Following the acceptance of <a href="lwg-defects.html#1255">1255</a>, <tt>result_of</tt> now
  depends on the <tt>declval</tt> function template, tentatively provided
  in <tt>&lt;utility&gt;</tt> which is <em>not</em> (yet) required of a
  free-standing implementation.
*************** The original wording is preserved here:
*** 73517,73530 ****
  <blockquote>
  
  <p>
! Move X [func.ret] to a heading below 20.7 [meta].  Note
  that in principle we should not change the tag, although this is a new tag for
  0x.  If it has been stable since TR1 it is clearly immutable though.
  </p>
  
  <p>
  This wording should obviously adopt any other changes currently in (Tentatively)
! Ready status that touch this wording, such as <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1255">1255</a>.
  </p>
  
  </blockquote>
--- 82364,82377 ----
  <blockquote>
  
  <p>
! Move X [func.ret] to a heading below 20.10 [meta].  Note
  that in principle we should not change the tag, although this is a new tag for
  0x.  If it has been stable since TR1 it is clearly immutable though.
  </p>
  
  <p>
  This wording should obviously adopt any other changes currently in (Tentatively)
! Ready status that touch this wording, such as <a href="lwg-defects.html#1255">1255</a>.
  </p>
  
  </blockquote>
*************** Ready status that touch this wording, su
*** 73538,73544 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p><i>From Function objects 20.8 [function.objects], Header &lt;functional&gt; 
  synopsis, remove:</i></p>
  <blockquote>
    <pre>// 20.7.4 result_of:
--- 82385,82391 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p><i>From Function objects 20.9 [function.objects], Header <tt>&lt;functional&gt;</tt> 
  synopsis, remove:</i></p>
  <blockquote>
    <pre>// 20.7.4 result_of:
*************** This sub-section reads:</i></p>
*** 73566,73589 ****
    corresponding type <code>Ti</code> is an lvalue-reference type, and rvalues 
    otherwise.</p>
  </blockquote>
! <p><i>To Header &lt;type_traits&gt; synopsis 20.7.2 [meta.type.synop], add at 
  the indicated location:</i></p>
  <blockquote>
    <pre>template &lt;class T&gt; struct underlying_type;
  <ins>template &lt;class T&gt; struct result_of; <i>// not defined
  </i>template &lt;class Fn, class... ArgTypes&gt; struct result_of&lt;Fn(ArgTypes...)&gt;;</ins></pre>
  </blockquote>
! <p><i>To Other transformations 20.7.7.6 [meta.trans.other], Table 51 — 
  Other transformations, add:</i></p>
  <blockquote>
!   <table style="border-collapse: collapse;" border="1" bordercolor="#111111" cellpadding="3" cellspacing="0">
!     <tbody><tr>
        <td><b>Template</b></td>
        <td><b>Condition</b></td>
        <td><b>Comments</b></td>
      </tr>
      <tr>
!       <td valign="top"><code>template &lt;class T&gt;<br>
        struct underlying_type;</code></td>
        <td valign="top"><code>T</code> shall be an enumeration type 
        (7.2)</td>
--- 82413,82436 ----
    corresponding type <code>Ti</code> is an lvalue-reference type, and rvalues 
    otherwise.</p>
  </blockquote>
! <p><i>To Header &lt;type_traits&gt; synopsis 20.10.2 [meta.type.synop], add at 
  the indicated location:</i></p>
  <blockquote>
    <pre>template &lt;class T&gt; struct underlying_type;
  <ins>template &lt;class T&gt; struct result_of; <i>// not defined
  </i>template &lt;class Fn, class... ArgTypes&gt; struct result_of&lt;Fn(ArgTypes...)&gt;;</ins></pre>
  </blockquote>
! <p><i>To Other transformations 20.10.7.6 [meta.trans.other], Table 51 &mdash; 
  Other transformations, add:</i></p>
  <blockquote>
!   <table style="border-collapse: collapse;" border="1" cellpadding="3" cellspacing="0">
!     <tr>
        <td><b>Template</b></td>
        <td><b>Condition</b></td>
        <td><b>Comments</b></td>
      </tr>
      <tr>
!       <td valign="top"><code>template &lt;class T&gt;<br/>
        struct underlying_type;</code></td>
        <td valign="top"><code>T</code> shall be an enumeration type 
        (7.2)</td>
*************** Other transformations, add:</i></p>
*** 73594,73609 ****
        <td valign="top"><ins><code>template &lt;class Fn, class... ArgTypes&gt;
        struct result_of&lt;Fn(ArgTypes...)&gt;;</code></ins></td>
        <td valign="top"><ins><code>Fn</code> shall be a function object type
!       20.8 [function.objects], reference to function, or reference to
        function object type.
        <tt>decltype(declval&lt;Fn&gt;()(declval&lt;ArgTypes&gt;()...))</tt> shall
        be well formed.</ins></td>
        <td valign="top"><ins>The member typedef <code>type</code> 
        shall name the type <code>decltype(declval&lt;Fn&gt;()(declval&lt;ArgTypes&gt;()...))</code>.</ins></td>
      </tr>
!   </tbody></table>
  </blockquote>
! <p>At the end of Other transformations 20.7.7.6 [meta.trans.other] add:</p>
  
  <blockquote>
  <p>[<i>Example:</i> Given these definitions:</p>
--- 82441,82456 ----
        <td valign="top"><ins><code>template &lt;class Fn, class... ArgTypes&gt;
        struct result_of&lt;Fn(ArgTypes...)&gt;;</code></ins></td>
        <td valign="top"><ins><code>Fn</code> shall be a function object type
!       20.9 [function.objects], reference to function, or reference to
        function object type.
        <tt>decltype(declval&lt;Fn&gt;()(declval&lt;ArgTypes&gt;()...))</tt> shall
        be well formed.</ins></td>
        <td valign="top"><ins>The member typedef <code>type</code> 
        shall name the type <code>decltype(declval&lt;Fn&gt;()(declval&lt;ArgTypes&gt;()...))</code>.</ins></td>
      </tr>
!   </table>
  </blockquote>
! <p>At the end of Other transformations 20.10.7.6 [meta.trans.other] add:</p>
  
  <blockquote>
  <p>[<i>Example:</i> Given these definitions:</p>
*************** struct S {
*** 73616,73625 ****
  &nbsp; double operator()(char, int&amp;);
   };</pre>
  <p>the following assertions will hold:</p>
!   <pre>static_assert(std::is_same&lt;<wbr>std::result_of&lt;S(int)&gt;::type, short&gt;::value, "Error!");
! static_assert(std::is_same&lt;<wbr>std::result_of&lt;S&amp;(unsigned char, int&amp;)&gt;::type, double&gt;::value, "Error!");
! static_assert(std::is_same&lt;<wbr>std::result_of&lt;PF1()&gt;::type, bool&gt;::value, "Error!");</pre>
!   <p><i>&nbsp;— end example</i>]</p>
  </blockquote>
  
  
--- 82463,82472 ----
  &nbsp; double operator()(char, int&amp;);
   };</pre>
  <p>the following assertions will hold:</p>
!   <pre>static_assert(std::is_same&lt;std::result_of&lt;S(int)&gt;::type, short&gt;::value, &quot;Error!&quot;);
! static_assert(std::is_same&lt;std::result_of&lt;S&amp;(unsigned char, int&amp;)&gt;::type, double&gt;::value, &quot;Error!&quot;);
! static_assert(std::is_same&lt;std::result_of&lt;PF1()&gt;::type, bool&gt;::value, &quot;Error!&quot;);</pre>
!   <p><i>&nbsp;&mdash; end example</i>]</p>
  </blockquote>
  
  
*************** static_assert(std::is_same&lt;<wbr>std::
*** 73627,73637 ****
  
  
  <hr>
! <h3><a name="1271"></a>1271. CR undefined in duration operators</h3>
! <p><b>Section:</b> 20.11.3.5 [time.duration.nonmember] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-11-21 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.duration.nonmember">issues</a> in [time.duration.nonmember].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  IMO <tt>CR</tt> alone is not really defined (it should be <tt>CR(Rep1,
--- 82474,82484 ----
  
  
  <hr>
! <h3><a name="1271"></a>1271. <tt>CR</tt> undefined in duration operators</h3>
! <p><b>Section:</b> 20.12.5.5 [time.duration.nonmember] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-11-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration.nonmember">issues</a> in [time.duration.nonmember].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  IMO <tt>CR</tt> alone is not really defined (it should be <tt>CR(Rep1,
*************** Rep2)</tt>).
*** 73646,73669 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.11.3.5 [time.duration.nonmember] paragraphs 9 and 12:
  </p>
  
! <blockquote><pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator/(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote>
  9 <i>Returns:</i> <tt>duration&lt;CR<ins>(Rep1, Rep2)</ins>, Period&gt;(d) /= s</tt>.
! </blockquote>
  
! <pre>template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator%(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote>
  12 <i>Returns:</i> <tt>duration&lt;CR<ins>(Rep1, Rep2)</ins>, Period&gt;(d) %= s</tt>.
! </blockquote>
  
  </blockquote>
  
--- 82493,82518 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.12.5.5 [time.duration.nonmember] paragraphs 9 and 12:
  </p>
  
! <blockquote><pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator/(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote><p>
  9 <i>Returns:</i> <tt>duration&lt;CR<ins>(Rep1, Rep2)</ins>, Period&gt;(d) /= s</tt>.
! </p></blockquote>
  
! <pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
    duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
    operator%(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
  </pre>
! <blockquote><p>
  12 <i>Returns:</i> <tt>duration&lt;CR<ins>(Rep1, Rep2)</ins>, Period&gt;(d) %= s</tt>.
! </p></blockquote>
  
  </blockquote>
  
*************** Change 20.11.3.5 [time.duration.nonmembe
*** 73672,73688 ****
  
  
  <hr>
  <h3><a name="1276"></a>1276. <tt>forwardlist</tt> missing allocator constructors</h3>
! <p><b>Section:</b> 23.3.3 [forwardlist] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-12-12 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist">issues</a> in [forwardlist].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I found that forward_list has only
  </p>
  
! <blockquote><pre>forward_list(const forward_list&lt;T,Allocator&gt;&amp; x);
  forward_list(forward_list&lt;T,Allocator&gt;&amp;&amp; x);
  </pre></blockquote>
  
--- 82521,82817 ----
  
  
  <hr>
+ <h3><a name="1272"></a>1272. confusing declarations of <tt>promise::set_value</tt></h3>
+ <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-22 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The definitions of <tt>promise::set_value</tt> need tidying up, the
+ synopsis says:
+ </p>
+ 
+ <blockquote><pre>
+ // setting the result
+ void set_value(const R&amp; r);
+ void set_value(<i>see below</i>);
+ </pre></blockquote>
+ 
+ <p>
+ Why is the first one there?  It implies it is always present for all
+ specialisations of promise, which is not true.
+ </p>
+ 
+ <p>
+ The definition says:
+ </p>
+ 
+ <blockquote><pre>
+ void set_value(const R&amp; r);
+ void promise::set_value(R&amp;&amp; r);
+ void promise&lt;R&amp;&gt;::set_value(R&amp; r);
+ void promise&lt;void&gt;::set_value();
+ </pre></blockquote>
+ 
+ <p>
+ The lack of qualification on the first one again implies it's present
+ for all specialisations, again not true.
+ </p>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change the synopsis in 30.6.5 [futures.promise]:
+ </p>
+ 
+ <blockquote><pre>
+ // setting the result
+ <del>void set_value(const R&amp; r);</del>
+ void set_value(<i>see below</i>);
+ </pre></blockquote>
+ 
+ <p>
+ And the definition be changed by qualifying the first signature:
+ </p>
+ 
+ <blockquote><pre>
+ void <ins>promise::</ins>set_value(const R&amp; r);
+ void promise::set_value(R&amp;&amp; r);
+ void promise&lt;R&amp;&gt;::set_value(R&amp; r);
+ void promise&lt;void&gt;::set_value();
+ </pre></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1273"></a>1273. <tt>future::valid</tt> should be callable on an invalid future</h3>
+ <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-22 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 30.6.6 [futures.unique_future]/3 says:
+ </p>
+ 
+ <blockquote><p>
+ The effect of calling any member function other than the destructor or
+ the move-assignment operator on a <tt>future</tt> object for which 
+ <tt>valid() == false</tt> is undefined.
+ </p></blockquote>
+ 
+ <p>
+ This means calling <tt>future::valid()</tt> is undefined unless it will
+ return <tt>true</tt>, so you can only use it if you know the answer!
+ </p>
+ 
+ <p><i>[
+ 2009-12-08 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change 30.6.6 [futures.unique_future]/3:
+ </p>
+ 
+ <blockquote><p>
+ The effect of calling any member function other than the
+ destructor<ins>,</ins> or the move-assignment operator<ins>, or
+ <tt>valid</tt>,</ins> on a <tt>future</tt> object for which <tt>valid()
+ == false</tt> is undefined.
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1274"></a>1274. <tt>atomic_future</tt> constructor</h3>
+ <p><b>Section:</b> X [futures.atomic_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-22 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ In X [futures.atomic_future] this constructor:
+ </p>
+ 
+ <blockquote><pre>
+ atomic_future(future&lt;R&gt;&amp;&amp;);
+ </pre></blockquote>
+ 
+ <p>
+ is declared in the synopsis, but not defined. Instead
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2997.htm">n2997</a>
+ defines:
+ </p>
+ 
+ <blockquote><pre>
+ atomic_future(const future&lt;R&gt;&amp;&amp; rhs);
+ </pre></blockquote>
+ 
+ <p>
+ and
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">n3000</a>
+ defines
+ </p>
+ 
+ <blockquote><pre>
+ atomic_future(atomic_future&lt;R&gt;&amp;&amp; rhs);
+ </pre></blockquote>
+ 
+ <p>
+ both of which are wrong. The constructor definition should be changed
+ to match the synopsis.
+ </p>
+ 
+ <p><i>[
+ 2009-12-12 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Adjust the signature above X [futures.atomic_future]/6 like so:
+ </p>
+ 
+ <blockquote><pre>
+ atomic_future(<del>atomic_</del>future<ins>&lt;R&gt;</ins>&amp;&amp; rhs);
+ </pre></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1275"></a>1275. Creating and setting futures</h3>
+ <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-11-22 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures">issues</a> in [futures].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 30.6.6 [futures.unique_future]/1 should be updated to mention
+ <tt>async</tt>.
+ </p>
+ 
+ <p>
+ 30.6.7 [futures.shared_future]/1 should also be updated for
+ <tt>async</tt>. That paragraph also says
+ </p>
+ 
+ <blockquote><p>
+ ... Its value or exception can be set by use of a
+ <tt>shared_future</tt>, <tt>promise</tt> (30.6.5 [futures.promise]), or <tt>packaged_task</tt> (30.6.9 [futures.task]) object that shares the same associated state.
+ </p></blockquote>
+ 
+ <p>
+ How can the value be set by a <tt>shared_future</tt>?
+ </p>
+ 
+ <p>
+ X [futures.atomic_future]/1 says
+ </p>
+ 
+ <blockquote><p>
+ An <tt>atomic_future</tt> object can only be created by use of a
+ <tt>promise</tt> (30.6.5 [futures.promise]) or
+ <tt>packaged_task</tt> (30.6.9 [futures.task]) object.
+ </p></blockquote>
+ 
+ <p>
+ which is wrong, it's created from a <tt>std::future</tt>, which could
+ have been default-constructed. That paragraph should be closer to the
+ text of 30.6.7 [futures.shared_future]/1, and should also mention
+ <tt>async</tt>.
+ </p>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1276"></a>1276. <tt>forwardlist</tt> missing allocator constructors</h3>
! <p><b>Section:</b> 23.3.4 [forwardlist] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-12-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist">issues</a> in [forwardlist].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I found that forward_list has only
  </p>
  
! <blockquote><pre>
! forward_list(const forward_list&lt;T,Allocator&gt;&amp; x);
  forward_list(forward_list&lt;T,Allocator&gt;&amp;&amp; x);
  </pre></blockquote>
  
*************** forward_list(forward_list&lt;T,Allocator
*** 73690,73703 ****
  but misses
  </p>
  
! <blockquote><pre>forward_list(const forward_list&amp; x, const Allocator&amp;);
  forward_list(forward_list&amp;&amp; x, const Allocator&amp;);
  </pre></blockquote>
  
  <p>
  Note to other reviewers: I also checked the container adaptors for similar
  inconsistencies, but as far as I can see these are already handled by the
! current active issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1194">1194</a> and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1199">1199</a>.
  </p>
  
  <p><i>[
--- 82819,82833 ----
  but misses
  </p>
  
! <blockquote><pre>
! forward_list(const forward_list&amp; x, const Allocator&amp;);
  forward_list(forward_list&amp;&amp; x, const Allocator&amp;);
  </pre></blockquote>
  
  <p>
  Note to other reviewers: I also checked the container adaptors for similar
  inconsistencies, but as far as I can see these are already handled by the
! current active issues <a href="lwg-defects.html#1194">1194</a> and <a href="lwg-defects.html#1199">1199</a>.
  </p>
  
  <p><i>[
*************** current active issues <a href="http://ww
*** 73708,73718 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.3.3 [forwardlist]/3, class template forward_list synopsis change as
  indicated:
  </p>
  
! <blockquote><pre>forward_list(const forward_list<del>&lt;T,Allocator&gt;</del>&amp; x);
  forward_list(forward_list<del>&lt;T,Allocator&gt;</del>&amp;&amp; x);
  <ins>forward_list(const forward_list&amp;, const Allocator&amp;);</ins>
  <ins>forward_list(forward_list&amp;&amp;, const Allocator&amp;);</ins>
--- 82838,82849 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 23.3.4 [forwardlist]/3, class template forward_list synopsis change as
  indicated:
  </p>
  
! <blockquote><pre>
! forward_list(const forward_list<del>&lt;T,Allocator&gt;</del>&amp; x);
  forward_list(forward_list<del>&lt;T,Allocator&gt;</del>&amp;&amp; x);
  <ins>forward_list(const forward_list&amp;, const Allocator&amp;);</ins>
  <ins>forward_list(forward_list&amp;&amp;, const Allocator&amp;);</ins>
*************** forward_list(forward_list<del>&lt;T,Allo
*** 73725,73734 ****
  
  <hr>
  <h3><a name="1277"></a>1277. <tt>std::thread::id</tt> should be trivially copyable</h3>
! <p><b>Section:</b> 30.3.1.1 [thread.thread.id] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-24 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.thread.id">issues</a> in [thread.thread.id].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The class definition of <tt>std::thread::id</tt> in
--- 82856,82865 ----
  
  <hr>
  <h3><a name="1277"></a>1277. <tt>std::thread::id</tt> should be trivially copyable</h3>
! <p><b>Section:</b> 30.3.1.1 [thread.thread.id] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2009-11-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.thread.id">issues</a> in [thread.thread.id].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The class definition of <tt>std::thread::id</tt> in
*************** The class definition of <tt>std::thread:
*** 73736,73742 ****
  is:
  </p>
  
! <blockquote><pre>class thread::id {
  public:
    id();
  };
--- 82867,82874 ----
  is:
  </p>
  
! <blockquote><pre>
! class thread::id {
  public:
    id();
  };
*************** copyable.
*** 73765,73771 ****
  Add a new sentence to 30.3.1.1 [thread.thread.id] p1:
  </p>
  
! <blockquote>
  1 An object of type <tt>thread::id</tt> provides a unique identifier for
  each thread of execution and a single distinct value for all
  <tt>thread</tt> objects that do not represent a thread of execution
--- 82897,82903 ----
  Add a new sentence to 30.3.1.1 [thread.thread.id] p1:
  </p>
  
! <blockquote><p>
  1 An object of type <tt>thread::id</tt> provides a unique identifier for
  each thread of execution and a single distinct value for all
  <tt>thread</tt> objects that do not represent a thread of execution
*************** object that does not represent threads o
*** 73777,73783 ****
  reuse the value of a <tt>thread::id</tt> of a terminated thread that can
  no longer be joined. <ins><tt>thread::id</tt> shall be a trivially
  copyable class (9 [class]).</ins>
! </blockquote>
  
  
  
--- 82909,82915 ----
  reuse the value of a <tt>thread::id</tt> of a terminated thread that can
  no longer be joined. <ins><tt>thread::id</tt> shall be a trivially
  copyable class (9 [class]).</ins>
! </p></blockquote>
  
  
  
*************** copyable class (9 [class]).</ins>
*** 73785,73798 ****
  
  
  <hr>
! <h3><a name="1278"></a>1278. inconsistent return values for <tt>forward_list::insert_after</tt></h3>
! <p><b>Section:</b> 23.3.3.4 [forwardlist.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2009-11-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist.modifiers">issues</a> in [forwardlist.modifiers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! After applying LDR<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#149">149</a>, <tt>forward_list</tt> now has 5
  overloads of <tt>insert_after</tt>, all returning an iterator.
  </p>
  
--- 82917,82930 ----
  
  
  <hr>
! <h3><a name="1278"></a>1278. Inconsistent return values for <tt>forward_list::insert_after</tt></h3>
! <p><b>Section:</b> 23.3.4.5 [forwardlist.modifiers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2009-11-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist.modifiers">issues</a> in [forwardlist.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! After applying LDR<a href="lwg-defects.html#149">149</a>, <tt>forward_list</tt> now has 5
  overloads of <tt>insert_after</tt>, all returning an iterator.
  </p>
  
*************** Additionally <tt>emplace_after</tt>'s re
*** 73836,73865 ****
  ]</i></p>
  
  
! <blockquote>
  We prefer to return an iterator to the last inserted element.  Modify the
  proposed wording and then set to Ready.
! </blockquote>
  
  <p><i>[
  2010-03-15 Howard adds:
  ]</i></p>
  
  
! <blockquote>
  Wording updated and set to Ready.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In <tt>forward_list</tt> modifiers 23.3.3.4 [forwardlist.modifiers]
  make the following modifications:
  </p>
  
  <blockquote>
! <pre>iterator insert_after(const_iterator position, size_type n, const T&amp; x);
  </pre>
  <blockquote>
  <p>...</p>
--- 82968,82998 ----
  ]</i></p>
  
  
! <blockquote><p>
  We prefer to return an iterator to the last inserted element.  Modify the
  proposed wording and then set to Ready.
! </p></blockquote>
  
  <p><i>[
  2010-03-15 Howard adds:
  ]</i></p>
  
  
! <blockquote><p>
  Wording updated and set to Ready.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In <tt>forward_list</tt> modifiers 23.3.4.5 [forwardlist.modifiers]
  make the following modifications:
  </p>
  
  <blockquote>
! <pre>
! iterator insert_after(const_iterator position, size_type n, const T&amp; x);
  </pre>
  <blockquote>
  <p>...</p>
*************** inserted copy of <tt>x</tt> or <tt>posit
*** 73869,73875 ****
  </p>
  </blockquote>
  
! <pre>template &lt;class InputIterator&gt;
    iterator insert_after(const_iterator position, InputIterator first, InputIterator last);
  </pre>
  <blockquote>
--- 83002,83009 ----
  </p>
  </blockquote>
  
! <pre>
! template &lt;class InputIterator&gt;
    iterator insert_after(const_iterator position, InputIterator first, InputIterator last);
  </pre>
  <blockquote>
*************** inserted element or <tt>position</tt> if
*** 73881,73887 ****
  </p>
  </blockquote>
  
! <pre>iterator insert_after(const_iterator position, initializer_list&lt;T&gt; il);
  </pre>
  <blockquote>
  <p>...</p>
--- 83015,83022 ----
  </p>
  </blockquote>
  
! <pre>
! iterator insert_after(const_iterator position, initializer_list&lt;T&gt; il);
  </pre>
  <blockquote>
  <p>...</p>
*************** inserted element or <tt>position</tt> if
*** 73892,73898 ****
  </p>
  </blockquote>
  
! <pre>template &lt;class... Args&gt;
    iterator emplace_after(const_iterator position, Args&amp;&amp;... args);
  </pre>
  <blockquote>
--- 83027,83034 ----
  </p>
  </blockquote>
  
! <pre>
! template &lt;class... Args&gt;
    iterator emplace_after(const_iterator position, Args&amp;&amp;... args);
  </pre>
  <blockquote>
*************** args.
*** 73913,73929 ****
  
  
  <hr>
! <h3><a name="1280"></a>1280. initialization of stream iterators</h3>
! <p><b>Section:</b> 24.6.1.1 [istream.iterator.cons], 24.6.2.1 [ostream.iterator.cons.des] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-04 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream.iterator.cons">issues</a> in [istream.iterator.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  24.6.1.1 [istream.iterator.cons] describes the effects in terms of:
  </p>
  
! <blockquote><pre>basic_istream&lt;charT,traits&gt;* in_stream; // exposition only
  </pre>
  
  <p>
--- 83049,83153 ----
  
  
  <hr>
! <h3><a name="1279"></a>1279. forbid <tt>[u|bi]nary_function</tt> specialization</h3>
! <p><b>Section:</b> X [depr.base] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2009-11-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#depr.base">issues</a> in [depr.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! A program should not be allowed to add specialization of class templates
! <tt>unary_function</tt> and <tt>binary_function</tt>, in force of 17.6.4.2.1 [namespace.std]/1.
! If a program were allowed to specialize these templates, the library could no
! longer rely on them to provide the intended typedefs or there might be other
! undesired interactions.
! </p>
! 
! <p><i>[
! 2010-03-27 Daniel adds:
! ]</i></p>
! 
! 
! <blockquote><p>
! Accepting issue <a href="lwg-defects.html#1290">1290</a> would resolve this issue as NAD editorial.
! </p></blockquote>
! 
! <p><i>[
! 2010-10-24 Daniel adds:
! ]</i></p>
! 
! 
! <blockquote><p>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3145.html">n3145</a> would resolve this issue as NAD editorial.
! </p></blockquote>
! 
! <p><i>[
! 2010 Batavia:
! ]</i></p>
! 
! 
! <blockquote><p>
! Pete: Is this issue actually addressed by N3198, or did deprecating unary/binary_function?
! <p/>
! We determined that this issue is NOT resolved and that it must be resolved or else 
! N3198 could break code that does specialize unary&#47;binary function.
! <p/>
! Matt: don't move to NAD
! <p/>
! Howard: I suggest we go further and move 1279 to ready for Madrid.
! <p/>
! Group: Agrees move 1279 to ready for Madrid 
! </p></blockquote>
! 
! <p>
! Previous proposed resolution:
! </p>
! 
! <blockquote><p>
! 1 The following <del>classes</del> <ins>class templates</ins> are provided to
! simplify the typedefs of the argument and result types<del>:</del><ins>. A
! program shall not declare specializations of these templates.</ins>
! </p></blockquote>
! 
! <p><i>[2011-03-06 Daniel comments]</i></p>
! 
! 
! <blockquote><p>
! This meeting outcome was not properly reflected in the proposed resolution. I
! also adapted the suggested wording to the N3242 numbering and content state.
! During this course of action it turned out that the first suggested wording
! change has already been applied.
! </p></blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Change paragraph X [depr.base]/1 as follows:
! </p>
! 
! <blockquote><p>
! 1 The class templates <tt>unary_function</tt> and <tt>binary_function</tt> are deprecated. 
! <ins>A program shall not declare specializations of these templates.</ins>
! </p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1280"></a>1280. Initialization of stream iterators</h3>
! <p><b>Section:</b> 24.6.1.1 [istream.iterator.cons], 24.6.2.1 [ostream.iterator.cons.des] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.iterator.cons">issues</a> in [istream.iterator.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  24.6.1.1 [istream.iterator.cons] describes the effects in terms of:
  </p>
  
! <blockquote><pre>
! basic_istream&lt;charT,traits&gt;* in_stream; // exposition only
  </pre>
  
  <p>
*************** That should be <tt>&amp;s</tt> and simil
*** 73946,73978 ****
  Change 24.6.1.1 [istream.iterator.cons] like so:
  </p>
  
! <blockquote><pre>istream_iterator(istream_type&amp; s);
  </pre>
! <blockquote>
  3 <i>Effects:</i> Initializes <i>in_stream</i> with <tt><ins>&amp;</ins>s</tt>.
  <i>value</i> ...
! </blockquote>
  </blockquote>
  
  <p>
  And 24.6.2.1 [ostream.iterator.cons.des] like so:
  </p>
  
! <blockquote><pre>ostream_iterator(ostream_type&amp; s);
  </pre>
! <blockquote>
  1 <i>Effects:</i> Initializes <i>out_stream</i> with <tt><ins>&amp;</ins>s</tt>
  and <i>delim</i> with null.
! </blockquote>
  
! <pre>ostream_iterator(ostream_type&amp; s, const charT* delimiter);
  </pre>
! <blockquote>
  2 <i>Effects:</i> Initializes <i>out_stream</i> with <tt><ins>&amp;</ins>s</tt>
  and <i>delim</i> with <tt>delimiter</tt>.
  </blockquote>
  </blockquote>
  
  
  
  
--- 83170,83504 ----
  Change 24.6.1.1 [istream.iterator.cons] like so:
  </p>
  
! <blockquote><pre>
! istream_iterator(istream_type&amp; s);
  </pre>
! <blockquote><p>
  3 <i>Effects:</i> Initializes <i>in_stream</i> with <tt><ins>&amp;</ins>s</tt>.
  <i>value</i> ...
! </p></blockquote>
  </blockquote>
  
  <p>
  And 24.6.2.1 [ostream.iterator.cons.des] like so:
  </p>
  
! <blockquote><pre>
! ostream_iterator(ostream_type&amp; s);
  </pre>
! <blockquote><p>
  1 <i>Effects:</i> Initializes <i>out_stream</i> with <tt><ins>&amp;</ins>s</tt>
  and <i>delim</i> with null.
! </p></blockquote>
  
! <pre>
! ostream_iterator(ostream_type&amp; s, const charT* delimiter);
  </pre>
! <blockquote><p>
  2 <i>Effects:</i> Initializes <i>out_stream</i> with <tt><ins>&amp;</ins>s</tt>
  and <i>delim</i> with <tt>delimiter</tt>.
+ </p></blockquote>
  </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1281"></a>1281. CopyConstruction and Assignment between ratios having the same normalized form</h3>
+ <p><b>Section:</b> 20.11.3 [ratio.ratio] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Vicente Juan Botet Escrib&aacute; <b>Opened:</b> 2009-12-07 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#ratio.ratio">issues</a> in [ratio.ratio].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ CopyConstruction and Assignment between <tt>ratio</tt>s having the same
+ normalized form. Current
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>
+ do not allows to copy-construct or assign <tt>ratio</tt> instances of
+ <tt>ratio</tt> classes having the same normalized form.
+ </p>
+ 
+ <p>
+ Two <tt>ratio</tt> classes <tt>ratio&lt;N1,D1&gt;</tt> and
+ <tt>ratio&lt;N2,D2&gt;</tt> have the same normalized form if
+ </p>
+ 
+ <blockquote><pre>
+ ratio&lt;N1, D1&gt;::num == ratio&lt;N2, D2&gt;::num &amp;&amp;
+ ratio&lt;N1, D1&gt;::den == ratio&lt;N2, D2&gt;::den
+ </pre></blockquote>
+ 
+ <p>
+ This simple example
+ </p>
+ 
+ <blockquote><pre>
+ ratio&lt;1,3&gt; r1;
+ ratio&lt;3,9&gt; r2;
+ r1 = r2; // (1)
+ </pre></blockquote>
+ 
+ <p>
+ fails to compile in (1). Other example
+ </p>
+ 
+ <blockquote><pre>
+ ratio&lt;1,3&gt; r1;
+ ratio_subtract&lt;ratio&lt;2,3&gt;, ratio&lt;1,3&gt;&gt;::type r2;
+ r1 = r2;  
+ </pre></blockquote>
+ 
+ <p>
+ The nested type of <tt>ratio_subtract&lt;ratio&lt;2,3&gt;,
+ ratio&lt;1,3&gt;&gt;</tt> could be <tt>ratio&lt;3,9&gt;</tt> so the compilation
+ could fail. It could also be <tt>ratio&lt;1,3&gt;</tt> and the compilation
+ succeeds.
+ </p>
+ 
+ <p>
+ In 20.11.4 [ratio.arithmetic] 3 and similar clauses
+ </p>
+ 
+ <blockquote><p>
+ 3 The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
+ T2&gt;</tt> where <tt>T1</tt> has the value <tt>R1::num * R2::den - R2::num *
+ R1::den</tt> and <tt>T2</tt> has the value <tt>R1::den * R2::den</tt>.
+ </p></blockquote>
+ 
+ <p>
+ the meaning of synonym let think that the result shall be a normalized
+ <tt>ratio</tt> equivalent to <tt>ratio&lt;T1, T2&gt;</tt>, but there is not an
+ explicit definition of what synonym means in this context.
+ </p>
+ 
+ <p>
+ Additionally we should add a typedef for accessing the normalized
+ <tt>ratio</tt>, and  change 20.11.4 [ratio.arithmetic] to return only this
+ <em>normalized</em> result.
+ </p>
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ There is no consensus to add the converting copy constructor or converting copy
+ assignment operator.  However there was consensus to add the typedef.
+ </p>
+ 
+ <p>
+ Proposed wording modified.  Original proposed wording preserved here.  Moved to
+ Review.
+ </p>
+ 
+ <blockquote class="note">
+ <p>
+ Make <tt>ratio</tt> default constructible, copy-constructible and assignable
+ from any <tt>ratio</tt> which has the same reduced form.
+ </p>
+ 
+ <p>
+ Add to 20.11.3 [ratio.ratio] synopsis
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;intmax_t N, intmax_t D = 1&gt;
+ class ratio {
+ public:
+   static constexpr intmax_t num;
+   static constexpr intmax_t den;
+ 
+   <ins>typedef ratio&lt;num, den&gt; type;</ins>
+ 
+   <ins>ratio() = default;
+   template &lt;intmax_t N2, intmax_t D2&gt;
+     ratio(const ratio&lt;N2, D2&gt;&amp;);
+   template &lt;intmax_t N2, intmax_t D2&gt;
+     ratio&amp; operator=(const ratio&lt;N2, D2&gt;&amp;);</ins>
+ };
+ </pre></blockquote>
+ 
+ <p>
+ Add to 20.11.3 [ratio.ratio]:
+ </p>
+ 
+ <blockquote>
+ <p>
+ Two ratio classes <tt>ratio&lt;N1,D1&gt;</tt> and <tt>ratio&lt;N2,D2&gt;</tt>
+ have the same reduced form if <tt>ratio&lt;N1,D1&gt;::type</tt> is the same
+ type as <tt>ratio&lt;N2,D2&gt;::type</tt>
+ </p>
+ 
  </blockquote>
  
+ <p>
+ Add a new section: [ratio.cons]
+ </p>
+ 
+ <blockquote>
+ <p><b>
+ Construction and assignment  [ratio.cons]
+ </b></p>
+ 
+ <pre>
+ template &lt;intmax_t N2, intmax_t D2&gt;
+   ratio(const ratio&lt;N2, D2&gt;&amp; r);
+ </pre>
+ 
+ <blockquote>
+ <p>
+ <i>Effects:</i> Constructs a <tt>ratio</tt> object.
+ </p>
+ <p>
+ <i>Remarks:</i> This constructor shall not participate in overload resolution
+ unless <tt>r</tt> has the same reduced form as <tt>*this</tt>.
+ </p>
+ </blockquote>
+ 
+ <pre>
+ template &lt;intmax_t N2, intmax_t D2&gt;
+   ratio&amp; operator=(const ratio&lt;N2, D2&gt;&amp; r);
+ </pre>
+ 
+ <blockquote>
+ <p>
+ <i>Effects:</i> None.
+ </p>
+ <p>
+ <i>Returns:</i> <tt>*this</tt>.
+ </p>
+ <p>
+ <i>Remarks:</i> This operator shall not participate in overload resolution
+ unless <tt>r</tt> has the same reduced form as <tt>*this</tt>.
+ </p>
+ </blockquote>
+ 
+ </blockquote>
+ 
+ <p>
+ Change 20.11.4 [ratio.arithmetic] 
+ </p>
+ 
+ <blockquote>
+ <p>
+ Implementations may use other algorithms to compute these values. If overflow
+ occurs, a diagnostic shall be issued.
+ </p>
+ 
+ <pre>
+ template &lt;class R1, class R2&gt; struct ratio_add {
+   typedef <i>see below</i> type;
+ };
+ </pre>
+ 
+ <blockquote><p>
+ The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
+ T2&gt;<ins>::type</ins></tt> where <tt>T1</tt> has the value <tt>R1::num *
+ R2::den + R2::num * R1::den</tt> and <tt>T2</tt> has the value <tt>R1::den *
+ R2::den</tt>.
+ </p></blockquote>
+ 
+ <pre>
+ template &lt;class R1, class R2&gt; struct ratio_subtract {
+   typedef <i>see below</i> type;
+ };
+ </pre>
+ 
+ <blockquote><p>
+ The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
+ T2&gt;<ins>::type</ins></tt> where <tt>T1</tt> has the value <tt>R1::num *
+ R2::den - R2::num * R1::den</tt> and <tt>T2</tt> has the value <tt>R1::den *
+ R2::den</tt>.
+ </p></blockquote>
+ 
+ <pre>
+ template &lt;class R1, class R2&gt; struct ratio_multiply {
+   typedef <i>see below</i> type;
+ };
+ </pre>
+ 
+ <blockquote><p>
+ The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
+ T2&gt;<ins>::type</ins></tt> where <tt>T1</tt> has the value <tt>R1::num *
+ R2::num</tt> and <tt>T2</tt> has the value <tt>R1::den * R2::den</tt>.
+ </p></blockquote>
+ 
+ <pre>
+ template &lt;class R1, class R2&gt; struct ratio_divide {
+   typedef <i>see below</i> type;
+ };
+ </pre>
+ 
+ <blockquote><p>
+ The nested typedef <tt>type</tt> shall be a synonym for <tt>ratio&lt;T1,
+ T2&gt;<ins>::type</ins></tt> where <tt>T1</tt> has the value <tt>R1::num *
+ R2::den</tt> and <tt>T2</tt> has the value <tt>R1::den * R2::num</tt>.
+ </p></blockquote>
+ 
+ </blockquote>
+ 
+ </blockquote>
+ 
+ </blockquote>
+ 
+ <p><i>[
+ 2010-03-27 Howard adds:
+ ]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Daniel brought to my attention the recent addition of the typedef <tt>type</tt>
+ to the FCD
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3092.pdf">N3092</a>:
+ </p>
+ 
+ <blockquote><pre>
+ typedef ratio type;
+ </pre></blockquote>
+ 
+ <p>
+ This issue was discussed in Pittsburgh, and the decision there was to accept the
+ typedef as proposed and move to Review.  Unfortunately the issue was accidently
+ applied to the FCD, and incorrectly.  The FCD version of the typedef refers to
+ <tt>ratio&lt;N, D&gt;</tt>, but the typedef is intended to refer to
+ <tt>ratio&lt;num, den&gt;</tt> which in general is not the same type.
+ </p>
+ 
+ <p>
+ I've updated the wording to diff against
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3092.pdf">N3092</a>.
+ </p>
+ 
+ </blockquote>
+ 
+ <p><i>[Batavia: <del>NAD Editorial</del><ins>Resolved</ins> - see rationale below]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p><p>Already fixed in working draft</p>
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add to 20.11.3 [ratio.ratio] synopsis
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;intmax_t N, intmax_t D = 1&gt;
+ class ratio {
+ public:
+   static constexpr intmax_t num;
+   static constexpr intmax_t den;
+ 
+   typedef ratio<ins>&lt;num, den&gt;</ins> type;
+ };
+ </pre></blockquote>
+ 
  
  
  
*************** and <i>delim</i> with <tt>delimiter</tt>
*** 73981,73990 ****
  <hr>
  <h3><a name="1283"></a>1283. <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt> need clarification
  of moved-from state</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-12-12 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 150</b></p>
  
--- 83507,83516 ----
  <hr>
  <h3><a name="1283"></a>1283. <tt>MoveConstructible</tt> and <tt>MoveAssignable</tt> need clarification
  of moved-from state</h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-12-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 150</b></p>
  
*************** of moved-from state</h3>
*** 73992,73998 ****
  There is on going confusion over what one can and can not do with a moved-from
  object (e.g.
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3009.html#UK150">UK 150</a>,
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#910">910</a>).
  This issue attempts to clarify that moved-from objects are valid objects with an
  unknown state.
  </p>
--- 83518,83524 ----
  There is on going confusion over what one can and can not do with a moved-from
  object (e.g.
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3009.html#UK150">UK 150</a>,
! <a href="lwg-closed.html#910">910</a>).
  This issue attempts to clarify that moved-from objects are valid objects with an
  unknown state.
  </p>
*************** and this is an objection that I do want
*** 74055,74061 ****
  </blockquote>
  
  <p><i>[
! 2010-02-10 Reopened.  The wording here has been merged into <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1309">1309</a>.
  ]</i></p>
  
  
--- 83581,83587 ----
  </blockquote>
  
  <p><i>[
! 2010-02-10 Reopened.  The wording here has been merged into <a href="lwg-defects.html#1309">1309</a>.
  ]</i></p>
  
  
*************** c++std-lib.  Rationale added below.
*** 74069,74088 ****
  
  <p><b>Rationale:</b></p>
  <p>
! This issue is now addressed by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1309">1309</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the follwing tables in 20.2.1 [utility.arg.requirements] as shown:
  </p>
  
  <blockquote>
  
  <table border="1">
! <caption>Table 33 — <tt>MoveConstructible</tt> requirements <b>[moveconstructible]</b></caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Post-condition</th>
  </tr>
--- 83595,83614 ----
  
  <p><b>Rationale:</b></p>
  <p>
! This issue is now addressed by <a href="lwg-defects.html#1309">1309</a>.
  </p>
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the follwing tables in 17.6.3.1 [utility.arg.requirements] as shown:
  </p>
  
  <blockquote>
  
  <table border="1">
! <caption>Table 33 &mdash; <tt>MoveConstructible</tt> requirements <b>[moveconstructible]</b></caption>
! <tr>
  <th>Expression</th>
  <th>Post-condition</th>
  </tr>
*************** Change the follwing tables in 20.2.1 [ut
*** 74100,74116 ****
  <del>There is no requirement on the value of <tt>rv</tt> after the
  construction.</del>
  <ins><tt>rv</tt> remains a valid object.  Its state is unspecified.</ins>
! — <i>end note</i>]
  </td>
  </tr>
! </tbody></table>
  
  </blockquote>
  <blockquote>
  
  <table border="1">
! <caption>Table 35 — <tt>MoveAssignable</tt> requirements <b>[moveassignable]</b></caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Return value</th>
--- 83626,83642 ----
  <del>There is no requirement on the value of <tt>rv</tt> after the
  construction.</del>
  <ins><tt>rv</tt> remains a valid object.  Its state is unspecified.</ins>
! &mdash; <i>end note</i>]
  </td>
  </tr>
! </table>
  
  </blockquote>
  <blockquote>
  
  <table border="1">
! <caption>Table 35 &mdash; <tt>MoveAssignable</tt> requirements <b>[moveassignable]</b></caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Return value</th>
*************** construction.</del>
*** 74136,74145 ****
  <del>There is no requirement on the value of <tt>rv</tt> after the
  assignment.</del>
  <ins><tt>rv</tt> remains a valid object.  Its state is unspecified.</ins>
! — <i>end note</i>]
  </td>
  </tr>
! </tbody></table>
  
  </blockquote>
  
--- 83662,83671 ----
  <del>There is no requirement on the value of <tt>rv</tt> after the
  assignment.</del>
  <ins><tt>rv</tt> remains a valid object.  Its state is unspecified.</ins>
! &mdash; <i>end note</i>]
  </td>
  </tr>
! </table>
  
  </blockquote>
  
*************** assignment.</del>
*** 74149,74165 ****
  
  <hr>
  <h3><a name="1284"></a>1284. <tt>vector&lt;bool&gt; initializer_list</tt> constructor missing an allocator argument</h3>
! <p><b>Section:</b> 23.4.2 [vector.bool] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2009-12-09 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The specialization for <tt>vector&lt;bool&gt;</tt> (23.4.2 [vector.bool])
  has a constructor
  </p>
  
! <blockquote><pre>vector(initializer_list&lt;bool&gt;);
  </pre></blockquote>
  
  <p>
--- 83675,83692 ----
  
  <hr>
  <h3><a name="1284"></a>1284. <tt>vector&lt;bool&gt; initializer_list</tt> constructor missing an allocator argument</h3>
! <p><b>Section:</b> 23.3.7 [vector.bool] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2009-12-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The specialization for <tt>vector&lt;bool&gt;</tt> (23.3.7 [vector.bool])
  has a constructor
  </p>
  
! <blockquote><pre>
! vector(initializer_list&lt;bool&gt;);
  </pre></blockquote>
  
  <p>
*************** that it has no <tt>allocator</tt> parame
*** 74175,74184 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the signature in the synopsis of 23.4.2 [vector.bool] to 
  </p>
  
! <blockquote><pre>vector(initializer_list&lt;bool&gt;<ins>, const Allocator&amp; = Allocator()</ins>);
  </pre></blockquote>
  
  
--- 83702,83712 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change the signature in the synopsis of 23.3.7 [vector.bool] to 
  </p>
  
! <blockquote><pre>
! vector(initializer_list&lt;bool&gt;<ins>, const Allocator&amp; = Allocator()</ins>);
  </pre></blockquote>
  
  
*************** Change the signature in the synopsis of
*** 74187,74199 ****
  
  <hr>
  <h3><a name="1285"></a>1285. <tt>allocator_traits</tt> call to <tt>new</tt></h3>
! <p><b>Section:</b> 20.9.4.2 [allocator.traits.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-12-10 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.traits.members">issues</a> in [allocator.traits.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#402">402</a> added "<tt>::</tt>" to the call to <tt>new</tt>
  within <tt>allocator::construct</tt>.  I suspect we want to retain that fix.
  </p>
  
--- 83715,83727 ----
  
  <hr>
  <h3><a name="1285"></a>1285. <tt>allocator_traits</tt> call to <tt>new</tt></h3>
! <p><b>Section:</b> 20.7.8.2 [allocator.traits.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-12-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.traits.members">issues</a> in [allocator.traits.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! LWG issue <a href="lwg-defects.html#402">402</a> added "<tt>::</tt>" to the call to <tt>new</tt>
  within <tt>allocator::construct</tt>.  I suspect we want to retain that fix.
  </p>
  
*************** within <tt>allocator::construct</tt>.  I
*** 74205,74220 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.2.5 [allocator.requirements], table 40 "Allocator requirements":
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 40 — Allocator requirements</caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  <th>Default</th>
  </tr>
  <tr>
--- 83733,83748 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 17.6.3.5 [allocator.requirements], table 40 "Allocator requirements":
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 40 &mdash; Allocator requirements</caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
  <th>Default</th>
  </tr>
  <tr>
*************** Effect: Constructs an object of type <tt
*** 74231,74252 ****
  <tt><ins>::</ins>new ((void*)c) C(forward&lt;Args&gt;(args)...)</tt>
  </td>
  </tr>
! </tbody></table>
  </blockquote>
  
  <p>
! Change 20.9.4.2 [allocator.traits.members], p4:
  </p>
  
! <blockquote><pre>template &lt;class T, class... Args&gt;
    static void construct(Alloc&amp; a, T* p, Args&amp;&amp;... args);
  </pre>
! <blockquote>
  4 <i>Effects:</i> calls <tt>a.construct(p,
  std::forward&lt;Args&gt;(args)...)</tt> if that call is well-formed; otherwise,
  invokes <tt><ins>::</ins>new (static_cast&lt;void*&gt;(p))
  T(std::forward&lt;Args&gt;(args)...)</tt>.
! </blockquote>
  </blockquote>
  
  
--- 83759,83781 ----
  <tt><ins>::</ins>new ((void*)c) C(forward&lt;Args&gt;(args)...)</tt>
  </td>
  </tr>
! </table>
  </blockquote>
  
  <p>
! Change 20.7.8.2 [allocator.traits.members], p4:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class... Args&gt;
    static void construct(Alloc&amp; a, T* p, Args&amp;&amp;... args);
  </pre>
! <blockquote><p>
  4 <i>Effects:</i> calls <tt>a.construct(p,
  std::forward&lt;Args&gt;(args)...)</tt> if that call is well-formed; otherwise,
  invokes <tt><ins>::</ins>new (static_cast&lt;void*&gt;(p))
  T(std::forward&lt;Args&gt;(args)...)</tt>.
! </p></blockquote>
  </blockquote>
  
  
*************** T(std::forward&lt;Args&gt;(args)...)</tt
*** 74255,74277 ****
  
  <hr>
  <h3><a name="1286"></a>1286. <tt>allocator_traits::select_on_container_copy_construction</tt> type-o</h3>
! <p><b>Section:</b> 20.9.4.2 [allocator.traits.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-12-10 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.traits.members">issues</a> in [allocator.traits.members].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>allocator_traits::select_on_container_copy_construction</tt> refers to an
  unknown "<tt>a</tt>":
  </p>
  
! <blockquote><pre>static Alloc select_on_container_copy_construction(const Alloc&amp; rhs);
  </pre>
  
! <blockquote>
  7 <i>Returns:</i> <tt>rhs.select_on_container_copy_construction(a)</tt> if that
  expression is well-formed; otherwise, <tt>rhs</tt>.
! </blockquote>
  </blockquote>
  
  <p><i>[
--- 83784,83807 ----
  
  <hr>
  <h3><a name="1286"></a>1286. <tt>allocator_traits::select_on_container_copy_construction</tt> type-o</h3>
! <p><b>Section:</b> 20.7.8.2 [allocator.traits.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2009-12-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.traits.members">issues</a> in [allocator.traits.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <tt>allocator_traits::select_on_container_copy_construction</tt> refers to an
  unknown "<tt>a</tt>":
  </p>
  
! <blockquote><pre>
! static Alloc select_on_container_copy_construction(const Alloc&amp; rhs);
  </pre>
  
! <blockquote><p>
  7 <i>Returns:</i> <tt>rhs.select_on_container_copy_construction(a)</tt> if that
  expression is well-formed; otherwise, <tt>rhs</tt>.
! </p></blockquote>
  </blockquote>
  
  <p><i>[
*************** expression is well-formed; otherwise, <t
*** 74283,74299 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.4.2 [allocator.traits.members], p7:
  </p>
  
! <blockquote><pre>static Alloc select_on_container_copy_construction(const Alloc&amp; rhs);
  </pre>
  
! <blockquote>
  7 <i>Returns:</i>
  <tt>rhs.select_on_container_copy_construction(<del>a</del>)</tt> if that
  expression is well-formed; otherwise, <tt>rhs</tt>.
! </blockquote>
  </blockquote>
  
  
--- 83813,83830 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.7.8.2 [allocator.traits.members], p7:
  </p>
  
! <blockquote><pre>
! static Alloc select_on_container_copy_construction(const Alloc&amp; rhs);
  </pre>
  
! <blockquote><p>
  7 <i>Returns:</i>
  <tt>rhs.select_on_container_copy_construction(<del>a</del>)</tt> if that
  expression is well-formed; otherwise, <tt>rhs</tt>.
! </p></blockquote>
  </blockquote>
  
  
*************** expression is well-formed; otherwise, <t
*** 74302,74311 ****
  
  <hr>
  <h3><a name="1287"></a>1287. <tt>std::function</tt> requires <tt>CopyConstructible</tt> target object</h3>
! <p><b>Section:</b> 20.8.14.2.1 [func.wrap.func.con] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I think <tt>std::function</tt> should require <tt>CopyConstructible</tt> for the
--- 83833,83842 ----
  
  <hr>
  <h3><a name="1287"></a>1287. <tt>std::function</tt> requires <tt>CopyConstructible</tt> target object</h3>
! <p><b>Section:</b> 20.9.12.2.1 [func.wrap.func.con] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  I think <tt>std::function</tt> should require <tt>CopyConstructible</tt> for the
*************** required.
*** 74336,74354 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 20.8.14.2.1 [func.wrap.func.con] paragraph 9:
  </p>
  
! <blockquote><pre>template&lt;class F&gt; function(F f);
  template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
  </pre>
  
! <blockquote>
  9  <i>Requires:</i> <ins><tt>F</tt> shall be <tt>CopyConstructible</tt>.</ins>
  <tt>f</tt> shall be callable for argument types <tt>ArgTypes</tt> and return
  type <tt>R</tt>. The copy constructor and destructor of <tt>A</tt> shall not
  throw exceptions.
! </blockquote>
  </blockquote>
  
  
--- 83867,83886 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to 20.9.12.2.1 [func.wrap.func.con] paragraph 9:
  </p>
  
! <blockquote><pre>
! template&lt;class F&gt; function(F f);
  template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
  </pre>
  
! <blockquote><p>
  9  <i>Requires:</i> <ins><tt>F</tt> shall be <tt>CopyConstructible</tt>.</ins>
  <tt>f</tt> shall be callable for argument types <tt>ArgTypes</tt> and return
  type <tt>R</tt>. The copy constructor and destructor of <tt>A</tt> shall not
  throw exceptions.
! </p></blockquote>
  </blockquote>
  
  
*************** throw exceptions.
*** 74358,74373 ****
  
  <hr>
  <h3><a name="1288"></a>1288. <tt>std::function</tt> assignment from rvalues</h3>
! <p><b>Section:</b> 20.8.14.2.1 [func.wrap.func.con] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-13 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.8.14.2.1 [func.wrap.func.con]
  </p>
  
! <blockquote><pre>template&lt;class F&gt; function&amp; operator=(F f);
  </pre>
  <blockquote>
  <p>
--- 83890,83906 ----
  
  <hr>
  <h3><a name="1288"></a>1288. <tt>std::function</tt> assignment from rvalues</h3>
! <p><b>Section:</b> 20.9.12.2.1 [func.wrap.func.con] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In 20.9.12.2.1 [func.wrap.func.con]
  </p>
  
! <blockquote><pre>
! template&lt;class F&gt; function&amp; operator=(F f);
  </pre>
  <blockquote>
  <p>
*************** In 20.8.14.2.1 [func.wrap.func.con]
*** 74383,74389 ****
  This assignment operator can be called such that <tt>F</tt> is an rvalue-reference e.g.
  </p>
  
! <blockquote><pre>func.operator=&lt;F&amp;&amp;&gt;(f);
  </pre></blockquote>
  
  <p>
--- 83916,83923 ----
  This assignment operator can be called such that <tt>F</tt> is an rvalue-reference e.g.
  </p>
  
! <blockquote><pre>
! func.operator=&lt;F&amp;&amp;&gt;(f);
  </pre></blockquote>
  
  <p>
*************** The same issues apply to <tt>function::a
*** 74407,74414 ****
  </p>
  
  <p>
! N.B. this issue is not related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1287">1287</a> and applies whether that
! issue is resolved or not. The wording below assumes the resolution of LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a> has been applied.
  </p>
  
  <p><i>[
--- 83941,83948 ----
  </p>
  
  <p>
! N.B. this issue is not related to <a href="lwg-defects.html#1287">1287</a> and applies whether that
! issue is resolved or not. The wording below assumes the resolution of LWG <a href="lwg-defects.html#1258">1258</a> has been applied.
  </p>
  
  <p><i>[
*************** issue is resolved or not. The wording be
*** 74417,74423 ****
  
  
  <p><i>[
! 201002-11 Opened by Alisdair for the purpose of merging <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1258">1258</a> into
  this issue as there is a minor conflict.
  ]</i></p>
  
--- 83951,83957 ----
  
  
  <p><i>[
! 201002-11 Opened by Alisdair for the purpose of merging <a href="lwg-defects.html#1258">1258</a> into
  this issue as there is a minor conflict.
  ]</i></p>
  
*************** this issue as there is a minor conflict.
*** 74431,74440 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.8.14.2.1 [func.wrap.func.con]
  </p>
  
! <blockquote><pre>template&lt;class F&gt; function&amp; operator=(F<ins>&amp;&amp;</ins> f);
  </pre>
  <blockquote>
  <p>
--- 83965,83975 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9.12.2.1 [func.wrap.func.con]
  </p>
  
! <blockquote><pre>
! template&lt;class F&gt; function&amp; operator=(F<ins>&amp;&amp;</ins> f);
  </pre>
  <blockquote>
  <p>
*************** In 20.8.14.2.1 [func.wrap.func.con]
*** 74448,74457 ****
  </blockquote>
  
  <p>
! In 20.8.14.2.2 [func.wrap.func.mod]
  </p>
  
! <blockquote><pre>template&lt;class F, <del>Allocator Alloc</del><ins>class A</ins>&gt;
    void assign(F<ins>&amp;&amp; f</ins>, const A<del>lloc</del>&amp; a);
  </pre>
  <blockquote>
--- 83983,83993 ----
  </blockquote>
  
  <p>
! In 20.9.12.2.2 [func.wrap.func.mod]
  </p>
  
! <blockquote><pre>
! template&lt;class F, <del>Allocator Alloc</del><ins>class A</ins>&gt;
    void assign(F<ins>&amp;&amp; f</ins>, const A<del>lloc</del>&amp; a);
  </pre>
  <blockquote>
*************** std::forward&lt;F&gt;(f)</ins>).swap(*th
*** 74463,74472 ****
  </blockquote>
  
  <p>
! Update member function signature for class template in 20.8.14.2 [func.wrap.func]
  </p>
  
! <blockquote><pre>template&lt;class F&gt; function&amp; operator=(F<ins>&amp;&amp;</ins>);
  
  template&lt;class F, class A&gt; void assign(F<ins>&amp;&amp;</ins>, const A&amp;);
  </pre></blockquote>
--- 83999,84009 ----
  </blockquote>
  
  <p>
! Update member function signature for class template in 20.9.12.2 [func.wrap.func]
  </p>
  
! <blockquote><pre>
! template&lt;class F&gt; function&amp; operator=(F<ins>&amp;&amp;</ins>);
  
  template&lt;class F, class A&gt; void assign(F<ins>&amp;&amp;</ins>, const A&amp;);
  </pre></blockquote>
*************** template&lt;class F, class A&gt; void as
*** 74479,74491 ****
  
  <hr>
  <h3><a name="1290"></a>1290. Don't require <tt>[u|bi]nary_function</tt> inheritance</h3>
! <p><b>Section:</b> 20.8 [function.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-12-14 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! This issue is a follow-up of the discussion on issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a> during
  the 2009 Santa Cruz meeting.
  </p>
  
--- 84016,84028 ----
  
  <hr>
  <h3><a name="1290"></a>1290. Don't require <tt>[u|bi]nary_function</tt> inheritance</h3>
! <p><b>Section:</b> 20.9 [function.objects] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-12-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! This issue is a follow-up of the discussion on issue <a href="lwg-defects.html#870">870</a> during
  the 2009 Santa Cruz meeting.
  </p>
  
*************** The class templates <tt>unary_function</
*** 74494,74500 ****
  actually very simple typedef providers,
  </p>
  
! <blockquote><pre>namespace std {
  
  template &lt;class Arg, class Result&gt;
  struct unary_function {
--- 84031,84038 ----
  actually very simple typedef providers,
  </p>
  
! <blockquote><pre>
! namespace std {
  
  template &lt;class Arg, class Result&gt;
  struct unary_function {
*************** struct binary_function {
*** 74515,74525 ****
  <p>
  which <i>may</i> be used as base classes (similarly to the iterator template),
  but were originally <i>not</i> intended as a customization point. The SGI
! documentation introduced the concept <a href="http://www.sgi.com/tech/stl/AdaptableUnaryFunction.html">Adaptable Unary
  Function</a> as function objects "with nested typedefs that define its argument
! type and result type" and a similar definition for <a href="http://www.sgi.com/tech/stl/AdaptableBinaryFunction.html">Adaptable Binary
  Function</a> related to <tt>binary_function</tt>. But as of TR1 a protocol was
! introduced that relies on inheritance relations based on these types. 20.8.4 [refwrap]/3 b. 3 requires that a specialization of
  <tt>reference_wrapper&lt;T&gt;</tt> shall derive from <tt>unary_function</tt>,
  if type <tt>T</tt> is "a class type that is derived from
  <tt>std::unary_function&lt;T1, R&gt;</tt>" and a similar inheritance-based rule
--- 84053,84065 ----
  <p>
  which <i>may</i> be used as base classes (similarly to the iterator template),
  but were originally <i>not</i> intended as a customization point. The SGI
! documentation introduced the concept 
! <a href="http://www.sgi.com/tech/stl/AdaptableUnaryFunction.html">Adaptable Unary
  Function</a> as function objects "with nested typedefs that define its argument
! type and result type" and a similar definition for 
! <a href="http://www.sgi.com/tech/stl/AdaptableBinaryFunction.html">Adaptable Binary
  Function</a> related to <tt>binary_function</tt>. But as of TR1 a protocol was
! introduced that relies on inheritance relations based on these types. 20.9.4 [refwrap]/3 b. 3 requires that a specialization of
  <tt>reference_wrapper&lt;T&gt;</tt> shall derive from <tt>unary_function</tt>,
  if type <tt>T</tt> is "a class type that is derived from
  <tt>std::unary_function&lt;T1, R&gt;</tt>" and a similar inheritance-based rule
*************** for <tt>binary_function</tt> exists as w
*** 74527,74549 ****
  </p>
  
  <p>
! As another disadvantage it has been pointed out in the TR1 issue list, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1837.pdf">N1837</a>
! (see section 10.39), that the requirements of <tt>mem_fn</tt> 20.8.13 [func.memfn]/2+3 to <em>derive</em> from
  <tt>std::unary_function/std::binary_function</tt> under circumstances, where the
  provision of corresponding typedefs would be sufficient, unnecessarily prevent
! implementations that take advantage of empty-base-class- optimizations.
  </p>
  
  <p>
  Both requirements should be relaxed in the sense that the
  <tt>reference_wrapper</tt> should provide typedef's <tt>argument_type</tt>,
  <tt>first_argument_type</tt>, and <tt>second_argument_type</tt> based on similar
! rules as the <i>weak result type</i> rule (20.8.2 [func.require]/3) does
  specify the presence of <tt>result_type</tt> member types.
  </p>
  
  <p>
! For a related issue see also <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1279">1279</a>.
  </p>
  
  <p><i>[
--- 84067,84090 ----
  </p>
  
  <p>
! As another disadvantage it has been pointed out in the TR1 issue list, <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1837.pdf">N1837</a>
! (see section 10.39), that the requirements of <tt>mem_fn</tt> 20.9.11 [func.memfn]/2+3 to <em>derive</em> from
  <tt>std::unary_function/std::binary_function</tt> under circumstances, where the
  provision of corresponding typedefs would be sufficient, unnecessarily prevent
! implementations that take advantage of empty-base-class optimizations.
  </p>
  
  <p>
  Both requirements should be relaxed in the sense that the
  <tt>reference_wrapper</tt> should provide typedef's <tt>argument_type</tt>,
  <tt>first_argument_type</tt>, and <tt>second_argument_type</tt> based on similar
! rules as the <i>weak result type</i> rule (20.9.2 [func.require]/3) does
  specify the presence of <tt>result_type</tt> member types.
  </p>
  
  <p>
! For a related issue see also <a href="lwg-defects.html#1279">1279</a>.
  </p>
  
  <p><i>[
*************** For a related issue see also <a href="ht
*** 74551,74559 ****
  ]</i></p>
  
  
! <blockquote>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3145.html">n3145</a> would resolve this issue as NAD editorial.
! </blockquote>
  
  
  
--- 84092,84101 ----
  ]</i></p>
  
  
! <blockquote><p>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3145.html">n3145</a> 
! would resolve this issue as NAD editorial.
! </p></blockquote>
  
  
  
*************** Accepting <a href="http://www.open-std.o
*** 74562,74584 ****
  ]</i></p>
  
  <p>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3198.html">n3198</a>.
  </p>
  
  <p>
  Previous proposed resolution:
! 
! </p><p><i>[
  The here proposed resolution is an attempt to realize the common denominator of
  the reflector threads c++std-lib-26011, c++std-lib-26095, and c++std-lib-26124.
  ]</i></p>
  
! 
  <ol>
  <li>
  <p>
! Change X [base]/1 as indicated: <i>[The intend is to provide an
! alternative fix for issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#1279">1279</a> and some editorial harmonization
  with existing wording in the library, like 24.4.2 [iterator.basic]/1]</i>
  </p>
  
--- 84104,84126 ----
  ]</i></p>
  
  <p>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3198.htm">n3198</a>.
  </p>
  
  <p>
  Previous proposed resolution:
! </p>
! <p><i>[
  The here proposed resolution is an attempt to realize the common denominator of
  the reflector threads c++std-lib-26011, c++std-lib-26095, and c++std-lib-26124.
  ]</i></p>
  
! <blockquote class="note">
  <ol>
  <li>
  <p>
! Change  [base]/1 as indicated: <i>[The intend is to provide an
! alternative fix for issue <a href="lwg-defects.html#1279">1279</a> and some editorial harmonization
  with existing wording in the library, like 24.4.2 [iterator.basic]/1]</i>
  </p>
  
*************** function objects. The behavior of a prog
*** 74590,74596 ****
  these templates is undefined.</ins><del>:</del>
  </p>
  
! <blockquote><pre>namespace std {
   template &lt;class Arg, class Result&gt;
   struct unary_function {
     typedef Arg argument_type;
--- 84132,84139 ----
  these templates is undefined.</ins><del>:</del>
  </p>
  
! <blockquote><pre>
! namespace std {
   template &lt;class Arg, class Result&gt;
   struct unary_function {
     typedef Arg argument_type;
*************** namespace std {
*** 74612,74618 ****
  
  <li>
  <p>
! Change 20.8.4 [refwrap], class template <tt>reference_wrapper</tt>
  synopsis as indicated: <i>[The intent is to remove the requirement that
  <tt>reference_wrapper</tt> derives from <tt>unary_function</tt> or
  <tt>binary_function</tt> if the situation requires the definition of the
--- 84155,84161 ----
  
  <li>
  <p>
! Change 20.9.4 [refwrap], class template <tt>reference_wrapper</tt>
  synopsis as indicated: <i>[The intent is to remove the requirement that
  <tt>reference_wrapper</tt> derives from <tt>unary_function</tt> or
  <tt>binary_function</tt> if the situation requires the definition of the
*************** in a function object and it ensures that
*** 74625,74631 ****
  provide typedefs but no such bases are handled as first class citizens.]</i>
  </p>
  
! <blockquote><pre>namespace std {
   template &lt;class T&gt; class reference_wrapper
     <del>: public unary_function&lt;T1, R&gt; // <i>see below</i></del>
     <del>: public binary_function&lt;T1, T2, R&gt; // <i>see below</i></del>
--- 84168,84175 ----
  provide typedefs but no such bases are handled as first class citizens.]</i>
  </p>
  
! <blockquote><pre>
! namespace std {
   template &lt;class T&gt; class reference_wrapper
     <del>: public unary_function&lt;T1, R&gt; // <i>see below</i></del>
     <del>: public binary_function&lt;T1, T2, R&gt; // <i>see below</i></del>
*************** provide typedefs but no such bases are h
*** 74646,74652 ****
  
  <li>
  <p>
! Change 20.8.4 [refwrap]/3 as indicated: <i>[The intent is to remove the
  requirement that <tt>reference_wrapper</tt> derives from <tt>unary_function</tt>
  if the situation requires the definition of the typedef <tt>argument_type</tt>
  and <tt>result_type</tt>. Note that this clause does concentrate on
--- 84190,84196 ----
  
  <li>
  <p>
! Change 20.9.4 [refwrap]/3 as indicated: <i>[The intent is to remove the
  requirement that <tt>reference_wrapper</tt> derives from <tt>unary_function</tt>
  if the situation requires the definition of the typedef <tt>argument_type</tt>
  and <tt>result_type</tt>. Note that this clause does concentrate on
*************** the type <tt>T1</tt> is <em>cv</em> <tt>
*** 74682,74688 ****
  
  <li>
  <p>
! Change 20.8.4 [refwrap]/4 as indicated: <i>[The intent is to remove the
  requirement that <tt>reference_wrapper</tt> derives from
  <tt>binary_function</tt> if the situation requires the definition of the typedef
  <tt>first_argument_type</tt>, <tt>second_argument_type</tt>, and
--- 84226,84232 ----
  
  <li>
  <p>
! Change 20.9.4 [refwrap]/4 as indicated: <i>[The intent is to remove the
  requirement that <tt>reference_wrapper</tt> derives from
  <tt>binary_function</tt> if the situation requires the definition of the typedef
  <tt>first_argument_type</tt>, <tt>second_argument_type</tt>, and
*************** types <tt>first_argument_type</tt>
*** 74724,74734 ****
  
  <li>
  <p>
! Change 20.8.13 [func.memfn]/2+3 as indicated: <i>[The intent is to remove
  the requirement that mem_fn's return type has to derive
  from <tt>[u|bi]nary_function</tt>. The reason for suggesting the
  change here is to better support empty-base-class optimization
! choices as has been pointed out in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1837.pdf">N1837</a>]</i>
  </p>
  
  <blockquote>
--- 84268,84279 ----
  
  <li>
  <p>
! Change 20.9.11 [func.memfn]/2+3 as indicated: <i>[The intent is to remove
  the requirement that mem_fn's return type has to derive
  from <tt>[u|bi]nary_function</tt>. The reason for suggesting the
  change here is to better support empty-base-class optimization
! choices as has been pointed out in 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1837.pdf">N1837</a>]</i>
  </p>
  
  <blockquote>
*************** function with cv-qualifier <em>cv</em> a
*** 74754,74783 ****
  </li>
  
  </ol>
! <p></p>
  
  <p><b>Proposed resolution:</b></p>
! Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3198.html">n3198</a>.
  
  
  
  
  <hr>
  <h3><a name="1292"></a>1292. <tt>std::function</tt> should support all callable types</h3>
! <p><b>Section:</b> 20.8.14.2.1 [func.wrap.func.con] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-12-19 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Some parts of the specification of <tt>std::function</tt> is unnecessarily
! restricted to a subset of all callable types (as defined in 20.8.1 [func.def]/3), even though the intent clearly is to be usable for
! <em>all</em> of them as described in 20.8.14.2 [func.wrap.func]/1. This
  argument becomes strengthened by the fact that current C++0x-compatible
  compilers work fine with them:
  </p>
  
! <blockquote><pre>#include &lt;functional&gt;
  #include &lt;iostream&gt;
  
  struct A
--- 84299,84389 ----
  </li>
  
  </ol>
! </blockquote>
! 
! <p><b>Proposed resolution:</b></p><p>
! Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3198.htm">n3198</a>.
! </p>
! 
! 
! 
! <hr>
! <h3><a name="1291"></a>1291. Exceptions thrown during <tt>promise::set_value</tt></h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 30.6.5 [futures.promise]
! </p>
! 
! <p>
! Does <tt>promise&lt;R&gt;::set_value</tt> return normally if the copy&#47;move
! constructor of <tt>R</tt> throws?
! </p>
! 
! <p>
! The exception could be caught and set using
! <tt>promise&lt;R&gt;::set_exception</tt>, or it could be allowed to leave the
! <tt>set_value</tt> call, but it's not clear which is intended. I suggest the
! exception should not be caught.
! </p>
! 
! <p>
! N.B. This doesn't apply to <tt>promise&lt;R&amp;&gt;::set_value</tt> or
! <tt>promise&lt;void&gt;::set_value</tt> because they don't construct a new
! object.
! </p>
! 
! <p><i>[
! 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
! ]</i></p>
! 
! 
! 
! 
! <p><b>Rationale:</b></p>
! <p>
! Solved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
! </p>
! 
  
  <p><b>Proposed resolution:</b></p>
! <p>
! Change 30.6.5 [futures.promise]/18:
! </p>
! 
! <blockquote><p>
! 18 <i>Throws:</i> <tt>future_error</tt> if its associated state is already
! ready<ins> or, for the first version an exception thrown by the copy constructor
! of <tt>R</tt>, or for the second version an exception thrown by the move
! constructor of <tt>R</tt></ins>.
! </p></blockquote>
! 
  
  
  
  
  <hr>
  <h3><a name="1292"></a>1292. <tt>std::function</tt> should support all callable types</h3>
! <p><b>Section:</b> 20.9.12.2.1 [func.wrap.func.con] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-12-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Some parts of the specification of <tt>std::function</tt> is unnecessarily
! restricted to a subset of all callable types (as defined in 20.9.1 [func.def]/3), even though the intent clearly is to be usable for
! <em>all</em> of them as described in 20.9.12.2 [func.wrap.func]/1. This
  argument becomes strengthened by the fact that current C++0x-compatible
  compilers work fine with them:
  </p>
  
! <blockquote><pre>
! #include &lt;functional&gt;
  #include &lt;iostream&gt;
  
  struct A
*************** int main()
*** 74810,74819 ****
  </pre></blockquote>
  
  <p>
! The problematics passages are 20.8.14.2.1 [func.wrap.func.con]/10:
  </p>
  
! <blockquote><pre>template&lt;class F&gt; function(F f);
  template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
  </pre>
  <blockquote>
--- 84416,84426 ----
  </pre></blockquote>
  
  <p>
! The problematic passages are 20.9.12.2.1 [func.wrap.func.con]/10:
  </p>
  
! <blockquote><pre>
! template&lt;class F&gt; function(F f);
  template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
  </pre>
  <blockquote>
*************** template &lt;class F, class A&gt; functi
*** 74823,74832 ****
  </p>
  <ul>
  <li>
! <tt>f</tt> is a NULL function pointer.
  </li>
  <li>
! <tt>f</tt> is a NULL member function pointer.
  </li>
  <li>
  <tt>F</tt> is an instance of the function class template, and <tt>!f</tt>
--- 84430,84439 ----
  </p>
  <ul>
  <li>
! <tt>f</tt> is a <tt>NULL</tt> function pointer.
  </li>
  <li>
! <tt>f</tt> is a <tt>NULL</tt> member function pointer.
  </li>
  <li>
  <tt>F</tt> is an instance of the function class template, and <tt>!f</tt>
*************** template &lt;class F, class A&gt; functi
*** 74837,74844 ****
  
  <p>
  because it does not consider pointer to data member and all constraints based on
! <em>function objects</em> which like 20.8.14.2 [func.wrap.func]/2 or 20.8.14.2.5 [func.wrap.func.targ]/3. The latter two will be resolved by the proposed
! resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#870">870</a> and are therefore not handled here.
  </p>
  
  <p><i>[
--- 84444,84451 ----
  
  <p>
  because it does not consider pointer to data member and all constraints based on
! <em>function objects</em> which like 20.9.12.2 [func.wrap.func]/2 or 20.9.12.2.5 [func.wrap.func.targ]/3. The latter two will be resolved by the proposed
! resolution of <a href="lwg-defects.html#870">870</a> and are therefore not handled here.
  </p>
  
  <p><i>[
*************** Post-Rapperswil:
*** 74846,74854 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 84453,84461 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 74859,74868 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.14.2.1 [func.wrap.func.con]/10+11 as indicated:
  </p>
  
! <blockquote><pre>template&lt;class F&gt; function(F f);
  template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
  </pre>
  <blockquote>
--- 84466,84476 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.12.2.1 [func.wrap.func.con]/10+11 as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;class F&gt; function(F f);
  template &lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
  </pre>
  <blockquote>
*************** template &lt;class F, class A&gt; functi
*** 74872,74881 ****
  </p>
  <ul>
  <li>
! <tt>f</tt> is a NULL function pointer.
  </li>
  <li>
! <tt>f</tt> is a NULL <ins>pointer to</ins> member <del>function pointer</del>.
  </li>
  <li>
  <tt>F</tt> is an instance of the function class template, and <tt>!f</tt>
--- 84480,84489 ----
  </p>
  <ul>
  <li>
! <tt>f</tt> is a <tt>NULL</tt> function pointer.
  </li>
  <li>
! <tt>f</tt> is a <tt>NULL</tt> <ins>pointer to</ins> member <del>function pointer</del>.
  </li>
  <li>
  <tt>F</tt> is an instance of the function class template, and <tt>!f</tt>
*************** to member function, and targets a copy o
*** 74889,74895 ****
  pointer to member function</del>. [<i>Note:</i> implementations are encouraged
  to avoid the use of dynamically allocated memory for small function objects, for
  example, where <tt>f</tt>'s target is an object holding only a pointer or
! reference to an object and a member function pointer. — <i>end note</i>]
  </p>
  
  </blockquote>
--- 84497,84503 ----
  pointer to member function</del>. [<i>Note:</i> implementations are encouraged
  to avoid the use of dynamically allocated memory for small function objects, for
  example, where <tt>f</tt>'s target is an object holding only a pointer or
! reference to an object and a member function pointer. &mdash; <i>end note</i>]
  </p>
  
  </blockquote>
*************** reference to an object and a member func
*** 74901,74914 ****
  
  <hr>
  <h3><a name="1293"></a>1293. <tt>unique_ptr&lt;T[], D&gt;</tt> needs to get rid of <i>unspecified-pointer-type</i></h3>
! <p><b>Section:</b> 20.9.9.3 [unique.ptr.runtime] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-12-20 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 211</b></p>
  
  <p>
! As a response to UK 211 LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1021">1021</a> has replaced the
  <i>unspecified-pointer-type</i> by <tt>nullptr_t</tt> to allow assignment of
  type-safe null-pointer literals in the non-array form of
  <tt>unique_ptr::operator=</tt>, but did not the same for the specialization for
--- 84509,84523 ----
  
  <hr>
  <h3><a name="1293"></a>1293. <tt>unique_ptr&lt;T[], D&gt;</tt> needs to get rid of <i>unspecified-pointer-type</i></h3>
! <p><b>Section:</b> 20.8.1.3 [unique.ptr.runtime] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-12-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.runtime">issues</a> in [unique.ptr.runtime].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses UK 211</b></p>
  
  <p>
! As a response to UK 211 LWG issue <a href="lwg-defects.html#1021">1021</a> has replaced the
  <i>unspecified-pointer-type</i> by <tt>nullptr_t</tt> to allow assignment of
  type-safe null-pointer literals in the non-array form of
  <tt>unique_ptr::operator=</tt>, but did not the same for the specialization for
*************** function which is completely unspecified
*** 74927,74938 ****
  ]</i></p>
  
  
! <blockquote>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </blockquote>
  
  
  
--- 84536,84547 ----
  ]</i></p>
  
  
! <blockquote><p>
  We moved
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">N3073</a>
  to the formal motions page in Pittsburgh which should obsolete this issue.  I've
  moved this issue to NAD Editorial, solved by N3073.
! </p></blockquote>
  
  
  
*************** Solved by <a href="http://www.open-std.o
*** 74944,74954 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.9.9.3 [unique.ptr.runtime], class template <tt>unique_ptr&lt;T[],
  D&gt;</tt> synopsis, change as indicated:
  </p>
  
! <blockquote><pre>// assignment
  unique_ptr&amp; operator=(unique_ptr&amp;&amp; u);
  unique_ptr&amp; operator=(<del><i>unspecified-pointer-type</i></del><ins>nullptr_t</ins>);
  </pre></blockquote>
--- 84553,84564 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.8.1.3 [unique.ptr.runtime], class template <tt>unique_ptr&lt;T[],
  D&gt;</tt> synopsis, change as indicated:
  </p>
  
! <blockquote><pre>
! // assignment
  unique_ptr&amp; operator=(unique_ptr&amp;&amp; u);
  unique_ptr&amp; operator=(<del><i>unspecified-pointer-type</i></del><ins>nullptr_t</ins>);
  </pre></blockquote>
*************** unique_ptr&amp; operator=(<del><i>unspec
*** 74960,74973 ****
  
  <hr>
  <h3><a name="1294"></a>1294. Difference between callable wrapper and forwarding  call wrapper unclear</h3>
! <p><b>Section:</b> 20.8.2 [func.require] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2009-12-21 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.require">issues</a> in [func.require].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current wording in the standard makes it hard to discriminate the difference
! between a "call wrapper" as defined in 20.8.1 [func.def]/5+6:
  </p>
  
  <blockquote>
--- 84570,84584 ----
  
  <hr>
  <h3><a name="1294"></a>1294. Difference between callable wrapper and forwarding  call wrapper unclear</h3>
! <p><b>Section:</b> 20.9.2 [func.require] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2009-12-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.require">active issues</a> in [func.require].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.require">issues</a> in [func.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current wording in the standard makes it hard to discriminate the difference
! between a "call wrapper" as defined in 20.9.1 [func.def]/5+6:
  </p>
  
  <blockquote>
*************** a call operation that forwards to that o
*** 74981,74987 ****
  </blockquote>
  
  <p>
! and a "forwarding call wrapper" as defined in 20.8.2 [func.require]/4:
  </p>
  
  <blockquote>
--- 84592,84598 ----
  </blockquote>
  
  <p>
! and a "forwarding call wrapper" as defined in 20.9.2 [func.require]/4:
  </p>
  
  <blockquote>
*************** with an argument list. [<i>Note:</i> in
*** 74991,75008 ****
  wrappers have an overloaded function call operator of the form
  </p>
  
! <blockquote><pre>template&lt;class... ArgTypes&gt;
  R operator()(ArgTypes&amp;&amp;... args) <i>cv-qual</i>;
  </pre></blockquote>
  
  <p>
! — <i>end note</i>]
  </p>
  </blockquote>
  
  <p>
  Reason for this lack of clear difference seems to be that the wording adaption
! to variadics and rvalues that were applied after it's original proposal in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1673.html#call%20wrapper">N1673</a>:
  </p>
  
  <blockquote>
--- 84602,84621 ----
  wrappers have an overloaded function call operator of the form
  </p>
  
! <blockquote><pre>
! template&lt;class... ArgTypes&gt;
  R operator()(ArgTypes&amp;&amp;... args) <i>cv-qual</i>;
  </pre></blockquote>
  
  <p>
! &mdash; <i>end note</i>]
  </p>
  </blockquote>
  
  <p>
  Reason for this lack of clear difference seems to be that the wording adaption
! to variadics and rvalues that were applied after it's original proposal in <a
! href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1673.html#call%20wrapper">N1673</a>:
  </p>
  
  <blockquote>
*************** a typical implementation forwarding call
*** 75015,75026 ****
  function call operators of the form
  </p>
  
! <blockquote><pre>template&lt;class T1, class T2, ..., class TN&gt;
  R operator()(T1&amp; t1, T2&amp; t2, ..., TN&amp; tN) <i>cv-qual</i>;
  </pre></blockquote>
  
  <p>
! — <i>end note</i>]
  </p>
  </blockquote>
  
--- 84628,84640 ----
  function call operators of the form
  </p>
  
! <blockquote><pre>
! template&lt;class T1, class T2, ..., class TN&gt;
  R operator()(T1&amp; t1, T2&amp; t2, ..., TN&amp; tN) <i>cv-qual</i>;
  </pre></blockquote>
  
  <p>
! &mdash; <i>end note</i>]
  </p>
  </blockquote>
  
*************** typical implementation forwarding call w
*** 75043,75054 ****
  operator of the form
  </p>
  
! <blockquote><pre>template&lt;class... ArgTypes&gt;
  R operator()(ArgTypes&amp;&amp;... args) <i>cv-qual</i>;
  </pre></blockquote>
  
  <p>
! — <i>end note</i>]
  </p>
  </blockquote>
  
--- 84657,84669 ----
  operator of the form
  </p>
  
! <blockquote><pre>
! template&lt;class... ArgTypes&gt;
  R operator()(ArgTypes&amp;&amp;... args) <i>cv-qual</i>;
  </pre></blockquote>
  
  <p>
! &mdash; <i>end note</i>]
  </p>
  </blockquote>
  
*************** Adopted at 2010-11 Batavia
*** 75061,75067 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.2 [func.require]/4 as indicated:
  </p>
  
  <blockquote><p>
--- 84676,84682 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.2 [func.require]/4 as indicated:
  </p>
  
  <blockquote><p>
*************** that rvalue arguments are delivered as r
*** 75072,75082 ****
  form
  </p>
  
! <blockquote><pre>template&lt;class... UnBoundArgs&gt;
  R operator()(UnBoundArgs&amp;&amp;... unbound_args) <em>cv-qual</em>;
  </pre></blockquote>
  <p>
! — <em>end note</em> ]
  </p>
  </blockquote>
  
--- 84687,84698 ----
  form
  </p>
  
! <blockquote><pre>
! template&lt;class... UnBoundArgs&gt;
  R operator()(UnBoundArgs&amp;&amp;... unbound_args) <em>cv-qual</em>;
  </pre></blockquote>
  <p>
! &mdash; <em>end note</em> ]
  </p>
  </blockquote>
  
*************** R operator()(UnBoundArgs&amp;&amp;... un
*** 75087,75106 ****
  
  <hr>
  <h3><a name="1295"></a>1295. Contradictory call wrapper requirements</h3>
! <p><b>Section:</b> 20.8.2 [func.require] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2009-12-22 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.require">issues</a> in [func.require].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.8.2 [func.require]/3 b 1 says
  </p>
  
  <blockquote>
  <p>
! 3 If a call wrapper (20.8.1 [func.def]) has a <i>weak result type</i> the
  type of its member type <tt>result_type</tt> is based on the type <tt>T</tt> of
! the wrapper's target object (20.8.1 [func.def]):
  </p>
  
  <ul>
--- 84703,84723 ----
  
  <hr>
  <h3><a name="1295"></a>1295. Contradictory call wrapper requirements</h3>
! <p><b>Section:</b> 20.9.2 [func.require] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-12-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.require">active issues</a> in [func.require].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.require">issues</a> in [func.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.9.2 [func.require]/3 b 1 says
  </p>
  
  <blockquote>
  <p>
! 3 If a call wrapper (20.9.1 [func.def]) has a <i>weak result type</i> the
  type of its member type <tt>result_type</tt> is based on the type <tt>T</tt> of
! the wrapper's target object (20.9.1 [func.def]):
  </p>
  
  <ul>
*************** can never be valid types for <tt>T</tt>,
*** 75120,75141 ****
  </p>
  
  <p>
! 20.8.1 [func.def]/7
  </p>
  
! <blockquote>
  7 A <i>target object</i> is the callable object held by a call wrapper.
! </blockquote>
  
  <p>
! and 20.8.1 [func.def]/3
  </p>
  
! <blockquote>
  3 A <i>callable type</i> is a pointer to function, a pointer to member function,
  a pointer to member data, or a class type whose objects can appear immediately
  to the left of a function call operator.
! </blockquote>
  
  <p>
  exclude functions and references to function as "target objects".
--- 84737,84758 ----
  </p>
  
  <p>
! 20.9.1 [func.def]/7
  </p>
  
! <blockquote><p>
  7 A <i>target object</i> is the callable object held by a call wrapper.
! </p></blockquote>
  
  <p>
! and 20.9.1 [func.def]/3
  </p>
  
! <blockquote><p>
  3 A <i>callable type</i> is a pointer to function, a pointer to member function,
  a pointer to member data, or a class type whose objects can appear immediately
  to the left of a function call operator.
! </p></blockquote>
  
  <p>
  exclude functions and references to function as "target objects".
*************** Post-Rapperswil:
*** 75146,75154 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 84763,84771 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 75159,75172 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.2 [func.require]/3 b 1 as indicated:
  </p>
  
  <blockquote>
  <p>
! 3 If a call wrapper (20.8.1 [func.def]) has a <i>weak result type</i> the
  type of its member type <tt>result_type</tt> is based on the type <tt>T</tt> of
! the wrapper's target object (20.8.1 [func.def]):
  </p>
  
  <ul>
--- 84776,84789 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.2 [func.require]/3 b 1 as indicated:
  </p>
  
  <blockquote>
  <p>
! 3 If a call wrapper (20.9.1 [func.def]) has a <i>weak result type</i> the
  type of its member type <tt>result_type</tt> is based on the type <tt>T</tt> of
! the wrapper's target object (20.9.1 [func.def]):
  </p>
  
  <ul>
*************** function type, <tt>result_type</tt> shal
*** 75187,75203 ****
  
  
  <hr>
  <h3><a name="1298"></a>1298. Missing specialization of <tt>ctype_byname&lt;char&gt;</tt></h3>
! <p><b>Section:</b> 22.2 [locale.syn] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-12-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>&lt;locale&gt;</tt> synopsis in 22.2 [locale.syn] calls out an
  explicit specialization for <tt>ctype_byname&lt;char&gt;</tt>, however no such
  specialization is defined in the standard.  The only reference I can find to
  <tt>ctype_byname&lt;char&gt;</tt> is 22.3.1.1.2 [locale.facet]:Table 77
! — Required specializations (for facets) which also refers to
  <tt>ctype_byname&lt;wchar_t&gt;</tt> which has no special consideration.
  </p>
  
--- 84804,84945 ----
  
  
  <hr>
+ <h3><a name="1297"></a>1297. <tt>unique_ptr</tt>'s relational operator functions should induce a total order</h3>
+ <p><b>Section:</b> 20.8.1.5 [unique.ptr.special] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2009-12-23 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The comparison functions of <tt>unique_ptr</tt> currently directly delegate to
+ the underlying comparison functions of <tt>unique_ptr&lt;T, D&gt;::pointer</tt>.
+ This is disadvantageous, because this would not guarantee to induce a total
+ ordering for native pointers and it is hard to define a total order for mixed
+ types anyway.
+ </p>
+ <p>
+ The currently suggested resolution for <tt>shared_ptr</tt> comparison as of
+ <a href="lwg-defects.html#1262">1262</a> uses a normalization strategy: They perform the comparison on
+ the <em>composite pointer type</em> (5.9 [expr.rel]). This is not
+ exactly possible for <tt>unique_ptr</tt> in the presence of user-defined
+ pointer-like types but the existing definition of <tt>std::duration</tt>
+ comparison as of 20.12.5.6 [time.duration.comparisons] via
+ <tt>common_type</tt> of both argument types demonstrates a solution of this
+ problem. The approach can be seen as the general way to define a <em>composite
+ pointer type</em> and this is the approach which is used for here suggested
+ wording change.
+ </p>
+ <p>
+ For consistency reasons I would have preferred the same normalization strategy
+ for <tt>==</tt> and <tt>!=</tt>, but Howard convinced me not to do so (now).
+ </p>
+ 
+ <p><i>[
+ 2010-11-03 Daniel comments and adjustes the currently proposed wording changes:
+ ]</i></p>
+ 
+ 
+ <p>
+ Issue <a href="lwg-defects.html#1401">1401</a> is remotely related. <a href="#1401_extra_bullet">Bullet A</a> of its proposed resolution 
+ provides an alternative solution for issue discussed here and addresses NB comment GB-99.
+ Additionally I updated the below suggested wording in regard to the following:
+ It is an unncessary requirement that the below defined effective composite pointer-like
+ type <tt>CT</tt> satisfies the <tt>LessThanComparable</tt> requirements. All what is 
+ needed is, that the function object type <tt>less&lt;CT&gt;</tt> induces a strict
+ weak ordering on the pointer values.
+ </p>
+ 
+ <p><i>[2011-03-24 Madrid meeting]</i></p>
+ 
+ 
+ <p>Resolved by <a href="lwg-defects.html#1401">1401</a></p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <p>
+ Change 20.8.1.5 [unique.ptr.special]/4-7 as indicated: <i>[The implicit
+ requirements and remarks imposed on the last three operators are the same as for
+ the first one due to the normative "equivalent to" usage within a Requires
+ element, see 17.5.1.4 [structure.specifications]/4. The effects of this
+ change are that all real pointers wrapped in a <tt>unique_ptr</tt> will order
+ like <tt>shared_ptr</tt> does.]</i>
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ </pre>
+ 
+ <blockquote>
+ <p>
+ <ins>? <i>Requires:</i> Let <tt>CT</tt> be <tt>common_type&lt;unique_ptr&lt;T1,
+ D1&gt;::pointer, unique_ptr&lt;T2, D2&gt;::pointer&gt;::type</tt>. Then
+ the specialization <tt>less&lt;CT&gt;</tt> shall be a function object type ([function.objects]) 
+ that induces a strict weak ordering ([alg.sorting]) on the pointer values.</ins>
+ </p>
+ 
+ <p>
+ 4 <i>Returns:</i> <tt><ins>less&lt;CT&gt;()(x.get(), y.get())</ins><del>x.get()
+ &lt; y.get()</del></tt>.
+ </p>
+ 
+ <p>
+ <ins>? <i>Remarks:</i> If <tt>unique_ptr&lt;T1, D1&gt;::pointer</tt> is not
+ implicitly convertible to <tt>CT</tt> or <tt>unique_ptr&lt;T2,
+ D2&gt;::pointer</tt> is not implicitly convertible to <tt>CT</tt>, the program
+ is ill-formed.</ins>
+ </p>
+ </blockquote>
+ 
+ <pre>
+ template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ </pre>
+ 
+ <blockquote><p>
+ 5 <ins><i>Effects:</i> Equivalent to <tt>return !(y &lt; x)</tt></ins>
+ <del><i>Returns:</i> <tt>x.get() &lt;= y.get()</tt></del>.
+ </p></blockquote>
+ 
+ <pre>
+ template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ </pre>
+ 
+ <blockquote><p>
+ 6 <ins><i>Effects:</i> Equivalent to <tt>return (y &lt; x)</tt></ins>
+ <del><i>Returns:</i> <tt>x.get() &gt; y.get()</tt></del>.
+ </p></blockquote>
+ 
+ <pre>
+ template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ </pre>
+ 
+ <blockquote><p>
+ 7 <ins><i>Effects:</i> Equivalent to <tt>return !(x &lt; y)</tt></ins>
+ <del><i>Returns:</i> <tt>x.get() &gt;= y.get()</tt></del>.
+ </p></blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1298"></a>1298. Missing specialization of <tt>ctype_byname&lt;char&gt;</tt></h3>
! <p><b>Section:</b> 22.2 [locale.syn] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-12-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <tt>&lt;locale&gt;</tt> synopsis in 22.2 [locale.syn] calls out an
  explicit specialization for <tt>ctype_byname&lt;char&gt;</tt>, however no such
  specialization is defined in the standard.  The only reference I can find to
  <tt>ctype_byname&lt;char&gt;</tt> is 22.3.1.1.2 [locale.facet]:Table 77
! &mdash; Required specializations (for facets) which also refers to
  <tt>ctype_byname&lt;wchar_t&gt;</tt> which has no special consideration.
  </p>
  
*************** different syntax? Should the explicit sp
*** 75223,75229 ****
  Strike the explicit specialization for <tt>ctype_byname&lt;char&gt;</tt> from
  the <tt>&lt;locale&gt;</tt> synopsis
  </p>
! <blockquote><pre>...
  template &lt;class charT&gt; class ctype_byname;
  <del>template &lt;&gt;            class ctype_byname&lt;char&gt;;  // <i>specialization</i></del>
  ...
--- 84965,84972 ----
  Strike the explicit specialization for <tt>ctype_byname&lt;char&gt;</tt> from
  the <tt>&lt;locale&gt;</tt> synopsis
  </p>
! <blockquote><pre>
! ...
  template &lt;class charT&gt; class ctype_byname;
  <del>template &lt;&gt;            class ctype_byname&lt;char&gt;;  // <i>specialization</i></del>
  ...
*************** template &lt;class charT&gt; class ctype
*** 75236,75252 ****
  
  <hr>
  <h3><a name="1299"></a>1299. Confusing typo in specification for <tt>get_time</tt></h3>
! <p><b>Section:</b> 27.7.4 [ext.manip] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-12-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ext.manip">issues</a> in [ext.manip].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Extended Manipulators 27.7.4 [ext.manip] p8 defines the semantics of
  <tt>get_time</tt> in terms of a function <tt>f</tt>.
  </p>
  
! <blockquote><pre>template &lt;class charT, class traits&gt;
  void f(basic_ios&lt;charT, traits&gt;&amp; str, struct tm* tmb, const charT* fmt) {
     typedef istreambuf_iterator&lt;charT, traits&gt; Iter;
     typedef time_get&lt;charT, Iter&gt; TimeGet;
--- 84979,84996 ----
  
  <hr>
  <h3><a name="1299"></a>1299. Confusing typo in specification for <tt>get_time</tt></h3>
! <p><b>Section:</b> 27.7.5 [ext.manip] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2009-12-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ext.manip">issues</a> in [ext.manip].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Extended Manipulators 27.7.5 [ext.manip] p8 defines the semantics of
  <tt>get_time</tt> in terms of a function <tt>f</tt>.
  </p>
  
! <blockquote><pre>
! template &lt;class charT, class traits&gt;
  void f(basic_ios&lt;charT, traits&gt;&amp; str, struct tm* tmb, const charT* fmt) {
     typedef istreambuf_iterator&lt;charT, traits&gt; Iter;
     typedef time_get&lt;charT, Iter&gt; TimeGet;
*************** type and not an object.  I believe this
*** 75275,75284 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 27.7.4 [ext.manip] p8:
  </p>
  
! <blockquote><pre>template &lt;class charT, class traits&gt;
  void f(basic_ios&lt;charT, traits&gt;&amp; str, struct tm* tmb, const charT* fmt) {
     typedef istreambuf_iterator&lt;charT, traits&gt; Iter;
     typedef time_get&lt;charT, Iter&gt; TimeGet;
--- 85019,85029 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 27.7.5 [ext.manip] p8:
  </p>
  
! <blockquote><pre>
! template &lt;class charT, class traits&gt;
  void f(basic_ios&lt;charT, traits&gt;&amp; str, struct tm* tmb, const charT* fmt) {
     typedef istreambuf_iterator&lt;charT, traits&gt; Iter;
     typedef time_get&lt;charT, Iter&gt; TimeGet;
*************** void f(basic_ios&lt;charT, traits&gt;&am
*** 75298,75315 ****
  
  
  <hr>
  <h3><a name="1303"></a>1303. <tt>shared_ptr</tt>, <tt>unique_ptr</tt>, and rvalue references v2</h3>
! <p><b>Section:</b> 20.9.9.2 [unique.ptr.single], 20.9.10.2 [util.smartptr.shared] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2010-01-23 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.single">issues</a> in [unique.ptr.single].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>
! 20.9.10.2 [util.smartptr.shared]/1 still says:
  </p>
  
! <blockquote><pre>template &lt;class Y, class D&gt; explicit shared_ptr(const unique_ptr&lt;Y, D&gt;&amp; r) = delete;
  template &lt;class Y, class D&gt; shared_ptr&amp; operator=(const unique_ptr&lt;Y, D&gt;&amp; r) = delete;
  </pre></blockquote>
  
--- 85043,85151 ----
  
  
  <hr>
+ <h3><a name="1300"></a>1300. Circular definition of <tt>promise::swap</tt></h3>
+ <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2009-12-26 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ 30.6.5 [futures.promise]/12 defines the effects of
+ <tt>promise::swap(promise&amp;)</tt> as
+ </p>
+ 
+ <blockquote><pre>
+ void swap(promise&amp; other);
+ </pre>
+ <blockquote><p>
+ 12 <i>Effects:</i> <tt>swap(*this, other)</tt>
+ </p></blockquote>
+ </blockquote>
+ 
+ <p>
+ and 30.6.5 [futures.promise]/25 defines <tt>swap(promise&lt;R&amp;&gt;,
+ promise&lt;R&gt;&amp;)</tt> as
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class R&gt;
+   void swap(promise&lt;R&gt;&amp; x, promise&lt;R&gt;&amp; y);
+ </pre>
+ <blockquote><p>
+ 25 <i>Effects:</i> <tt>x.swap(y)</tt>.
+ </p></blockquote>
+ </blockquote>
+ 
+ <p><i>[
+ 2010-01-13 Daniel added "Throws: Nothing."
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010-01-14 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change 30.6.5 [futures.promise] paragraph 12
+ </p>
+ 
+ <blockquote><pre>
+ void swap(promise&amp; other);
+ </pre>
+ <blockquote>
+ <p>
+ 12 <i>Effects:</i> <del><tt>swap(*this, other)</tt></del> <ins>Exchanges the
+ associated
+ states of <tt>*this</tt> and <tt>other</tt>.</ins>
+ </p>
+ <p>
+ 13 ...
+ </p>
+ <p><ins>
+ <i>Throws:</i> Nothing.
+ </ins></p>
+ </blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1303"></a>1303. <tt>shared_ptr</tt>, <tt>unique_ptr</tt>, and rvalue references v2</h3>
! <p><b>Section:</b> 20.8.1.2 [unique.ptr.single], 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2010-01-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single">issues</a> in [unique.ptr.single].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">N3000</a>
! 20.8.2.2 [util.smartptr.shared]/1 still says:
  </p>
  
! <blockquote><pre>
! template &lt;class Y, class D&gt; explicit shared_ptr(const unique_ptr&lt;Y, D&gt;&amp; r) = delete;
  template &lt;class Y, class D&gt; shared_ptr&amp; operator=(const unique_ptr&lt;Y, D&gt;&amp; r) = delete;
  </pre></blockquote>
  
*************** see a Library Issue tracking this.
*** 75329,75338 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Strike from 20.9.9.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>template &lt;class T, class D = default_delete&lt;T&gt;&gt; class unique_ptr {
    ...
    unique_ptr(const unique_ptr&amp;) = delete;
    <del>template &lt;class U, class E&gt; unique_ptr(const unique_ptr&lt;U, E&gt;&amp;) = delete;</del>
--- 85165,85175 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>
! Strike from 20.8.1.2 [unique.ptr.single]:
  </p>
  
! <blockquote><pre>
! template &lt;class T, class D = default_delete&lt;T&gt;&gt; class unique_ptr {
    ...
    unique_ptr(const unique_ptr&amp;) = delete;
    <del>template &lt;class U, class E&gt; unique_ptr(const unique_ptr&lt;U, E&gt;&amp;) = delete;</del>
*************** Strike from 20.9.9.2 [unique.ptr.single]
*** 75342,75351 ****
  </pre></blockquote>
  
  <p>
! Strike from 20.9.10.2 [util.smartptr.shared]:
  </p>
  
! <blockquote><pre>template&lt;class T&gt; class shared_ptr {
    ...
    <del>template &lt;class Y, class D&gt; explicit shared_ptr(const unique_ptr&lt;Y, D&gt;&amp; r) = delete;</del>
    ...
--- 85179,85189 ----
  </pre></blockquote>
  
  <p>
! Strike from 20.8.2.2 [util.smartptr.shared]:
  </p>
  
! <blockquote><pre>
! template&lt;class T&gt; class shared_ptr {
    ...
    <del>template &lt;class Y, class D&gt; explicit shared_ptr(const unique_ptr&lt;Y, D&gt;&amp; r) = delete;</del>
    ...
*************** Strike from 20.9.10.2 [util.smartptr.sha
*** 75360,75370 ****
  
  
  <hr>
  <h3><a name="1306"></a>1306. <tt>pointer</tt> and <tt>const_pointer</tt> for <tt>&lt;array&gt;</tt></h3>
! <p><b>Section:</b> 23.3.1 [array] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-01-24 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class <tt>&lt;array&gt;</tt> is the only sequence container class that has no
--- 85198,85522 ----
  
  
  <hr>
+ <h3><a name="1304"></a>1304. Missing preconditions for <tt>shared_future</tt></h3>
+ <p><b>Section:</b> 30.6.7 [futures.shared_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-01-23 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.shared_future">issues</a> in [futures.shared_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ The revised futures package in the current working paper simplified the
+ <tt>is_ready/has_exception/has_value</tt> set of APIs, replacing them with a
+ single 'valid' method.  This method is used in many places to signal pre- and
+ post- conditions, but that edit is not complete.  Each method on a
+ <tt>shared_future</tt> that requires an associated state should have a
+ pre-condition that <tt>valid() == true</tt>.
+ </p>
+ 
+ <p><i>[
+ 2010-01-28 Moved to Tentatively Ready after 5 positive votes on c++std-lib.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010 Pittsburgh:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ </p></blockquote>
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Insert the following extra paragraphs:
+ </p>
+ 
+ <p>
+ In 30.6.7 [futures.shared_future]
+ </p>
+ 
+ <blockquote><pre>
+ shared_future();
+ </pre>
+ <blockquote>
+ <p>
+ 4 <i>Effects:</i> constructs ...
+ </p>
+ 
+ <p><ins>
+ <i>Postcondition:</i> <tt>valid() == false</tt>.
+ </ins></p>
+ 
+ <p><ins>
+ <i>Throws:</i> nothing.
+ </ins></p>
+ </blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ void wait() const;
+ </pre>
+ <blockquote>
+ 
+ <p><ins>
+ <i>Requires:</i> <tt>valid() == true</tt>.
+ </ins></p>
+ 
+ <p>
+ 22 <i>Effects:</i> if the associated ...
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ template &lt;class Rep, class Period&gt;
+   bool wait_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) const;
+ </pre>
+ <blockquote>
+ 
+ <p><ins>
+ <i>Requires:</i> <tt>valid() == true</tt>.
+ </ins></p>
+ 
+ <p>
+ 23 <i>Effects:</i> if the associated ...
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ template &lt;class Clock, class Duration&gt;
+   bool wait_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) const;
+ </pre>
+ <blockquote>
+ 
+ <p><ins>
+ <i>Requires:</i> <tt>valid() == true</tt>.
+ </ins></p>
+ 
+ <p>
+ 25 <i>Effects:</i> blocks until ...
+ </p>
+ </blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1305"></a>1305. preconditions for <tt>atomic_future</tt></h3>
+ <p><b>Section:</b> X [futures.atomic_future] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-01-23 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.atomic_future">issues</a> in [futures.atomic_future].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ 
+ <p>
+ The revised futures package in the current working paper simplified the
+ <tt>is_ready/has_exception/has_value</tt> set of APIs, replacing them with a
+ single 'valid' method.  This method is used in many places to signal pre- and
+ post- conditions, but that edit is not complete.  
+ </p>
+ 
+ <p>
+ Atomic future retains the extended earlier API, and provides defined,
+ synchronized behaviour for all calls.  However, some preconditions and throws
+ clauses are missing, which can easily be built around the new <tt>valid()</tt>
+ api.  Note that for consistency, I suggest <tt>is_ready/has_exception/has_value
+ throw</tt> an exception if <tt>valid()</tt> is not <tt>true</tt>, rather than
+ return <tt>false</tt>.  I think this is implied by the existing pre-condition on
+ <tt>is_ready</tt>.
+ </p>
+ 
+ <p><i>[
+ 2010-01-23 See discussion starting with Message c++std-lib-26666.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3058.html">N3058</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Insert the following extra paragraphs:
+ </p>
+ 
+ <p>
+ In X [futures.atomic_future]
+ </p>
+ 
+ <blockquote><pre>
+ bool is_ready() const;
+ </pre>
+ <blockquote>
+ <p>
+ 17 <i><del>Precondition</del> <ins>Requires</ins>:</i> <tt>valid() == true</tt>.
+ </p>
+ 
+ <p>
+ 18 <i>Returns:</i> <tt>true</tt> only if the associated state is ready.
+ </p>
+ 
+ <p><ins>
+ <i>Throws:</i> <tt>future_error</tt> with an error condition of
+ <tt>no_state</tt> if the precondition is not met.
+ </ins></p>
+ 
+ </blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ bool has_exception() const;
+ </pre>
+ <blockquote>
+ 
+ <p><ins>
+ <i>Requires:</i> <tt>valid() == true</tt>.
+ </ins></p>
+ 
+ <p>
+ 19 <i>Returns:</i> <tt>true</tt> only if the associated state is ready and
+ contains an exception.
+ </p>
+ 
+ <p><ins>
+ <i>Throws:</i> <tt>future_error</tt> with an error condition of
+ <tt>no_state</tt> if the precondition is not met.
+ </ins></p>
+ 
+ </blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ bool has_value() const;
+ </pre>
+ <blockquote>
+ 
+ <p><ins>
+ <i>Requires:</i> <tt>valid() == true</tt>.
+ </ins></p>
+ 
+ <p>
+ 20 <i>Returns:</i> <tt>true</tt> only if the associated state is ready and
+ contains a value.
+ </p>
+ 
+ <p><ins>
+ <i>Throws:</i> <tt>future_error</tt> with an error condition of
+ <tt>no_state</tt> if the precondition is not met.
+ </ins></p>
+ 
+ </blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ void wait() const;
+ </pre>
+ <blockquote>
+ 
+ <p><ins>
+ <i>Requires:</i> <tt>valid() == true</tt>.
+ </ins></p>
+ 
+ <p>
+ 22 <i>Effects:</i> blocks until ...
+ </p>
+ 
+ <p><ins>
+ <i>Throws:</i> <tt>future_error</tt> with an error condition of
+ <tt>no_state</tt> if the precondition is not met.
+ </ins></p>
+ 
+ </blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ template &lt;class Rep, class Period&gt;
+   bool wait_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) const;
+ </pre>
+ <blockquote>
+ 
+ <p><ins>
+ <i>Requires:</i> <tt>valid() == true</tt>.
+ </ins></p>
+ 
+ <p>
+ 23 <i>Effects:</i> blocks until ...
+ </p>
+ 
+ <p>
+ 24 <i>Returns:</i> <tt>true</tt> only if ...
+ </p>
+ 
+ <p><ins>
+ <i>Throws:</i> <tt>future_error</tt> with an error condition of
+ <tt>no_state</tt> if the precondition is not met.
+ </ins></p>
+ 
+ </blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ template &lt;class Clock, class Duration&gt;
+   bool wait_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) const;
+ </pre>
+ <blockquote>
+ 
+ <p><ins>
+ <i>Requires:</i> <tt>valid() == true</tt>.
+ </ins></p>
+ 
+ <p>
+ 25 <i>Effects:</i> blocks until ...
+ </p>
+ 
+ <p>
+ 26 <i>Returns:</i> <tt>true</tt> only if ...
+ </p>
+ 
+ <p><ins>
+ <i>Throws:</i> <tt>future_error</tt> with an error condition of
+ <tt>no_state</tt> if the precondition is not met.
+ </ins></p>
+ 
+ </blockquote>
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1306"></a>1306. <tt>pointer</tt> and <tt>const_pointer</tt> for <tt>&lt;array&gt;</tt></h3>
! <p><b>Section:</b> 23.3.2 [array] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-01-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#array">active issues</a> in [array].</p>
! <p><b>View all other</b> <a href="lwg-index.html#array">issues</a> in [array].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  Class <tt>&lt;array&gt;</tt> is the only sequence container class that has no
*************** hand, types <tt>reference</tt> and <tt>c
*** 75383,75392 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to Class template array 23.3.1 [array]:
  </p>
  
! <blockquote><pre>namespace std {
    template &lt;class T, size_t N &gt;
    struct array {
      ...
--- 85535,85545 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add to Class template array 23.3.2 [array]:
  </p>
  
! <blockquote><pre>
! namespace std {
    template &lt;class T, size_t N &gt;
    struct array {
      ...
*************** Add to Class template array 23.3.1 [arra
*** 75404,75414 ****
  
  <hr>
  <h3><a name="1307"></a>1307. <tt>exception_ptr</tt> and <tt>allocator</tt> pointers don't understand !=</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-01-26 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#propagation">active issues</a> in [propagation].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current requirements for a conforming implementation of
--- 85557,85566 ----
  
  <hr>
  <h3><a name="1307"></a>1307. <tt>exception_ptr</tt> and <tt>allocator</tt> pointers don't understand !=</h3>
! <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-01-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current requirements for a conforming implementation of
*************** The current requirements for a conformin
*** 75416,75422 ****
  whether the expression
  </p>
  
! <blockquote><pre>e1 != e2
  e1 != nullptr
  </pre></blockquote>
  
--- 85568,85575 ----
  whether the expression
  </p>
  
! <blockquote><pre>
! e1 != e2
  e1 != nullptr
  </pre></blockquote>
  
*************** the concept <tt>EqualityComparable</tt>
*** 75429,75435 ****
  <p>
  For the same reason programmers working against the types <tt>X::pointer</tt>,
  <tt>X::const_pointer</tt>, <tt>X::void_pointer</tt>, and
! <tt>X::const_void_pointer</tt> of any allocator concept <tt>X</tt> (20.2.5 [allocator.requirements]/4 + Table 40) in a generic context can not rely
  on the availability of the != operation, which is rather unnatural and
  error-prone.
  </p>
--- 85582,85588 ----
  <p>
  For the same reason programmers working against the types <tt>X::pointer</tt>,
  <tt>X::const_pointer</tt>, <tt>X::void_pointer</tt>, and
! <tt>X::const_void_pointer</tt> of any allocator concept <tt>X</tt> (17.6.3.5 [allocator.requirements]/4 + Table 40) in a generic context can not rely
  on the availability of the != operation, which is rather unnatural and
  error-prone.
  </p>
*************** Solved by
*** 75456,75491 ****
  
  <hr>
  <h3><a name="1309"></a>1309. Missing expressions for <tt>Move/CopyConstructible</tt></h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-02-03 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Table 33 — MoveConstructible requirements [moveconstructible] and
! Table 34 — CopyConstructible requirements [copyconstructible] support
  solely the following expression:
  </p>
  
! <blockquote><pre>T t(rv)
  </pre></blockquote>
  
  <p>
  where <tt>rv</tt> is defined to be as "non-const rvalue of type <tt>T</tt>"  and
! <tt>t</tt> as a "modifiable lvalue of type <tt>T</tt>" in 20.2.1 [utility.arg.requirements]/1.
  </p>
  
  <p>
  This causes two different defects:
  </p>
  
! <ol type="a">
  <li>
  <p>
  We cannot move/copy-initialize a <em>const</em> lvalue of type <tt>T</tt> as in:
  </p>
  
! <blockquote><pre>int get_i();
  
  const int i1(get_i());
  </pre></blockquote>
--- 85609,85646 ----
  
  <hr>
  <h3><a name="1309"></a>1309. Missing expressions for <tt>Move/CopyConstructible</tt></h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-02-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Table 33 &mdash; MoveConstructible requirements [moveconstructible] and
! Table 34 &mdash; CopyConstructible requirements [copyconstructible] support
  solely the following expression:
  </p>
  
! <blockquote><pre>
! T t(rv)
  </pre></blockquote>
  
  <p>
  where <tt>rv</tt> is defined to be as "non-const rvalue of type <tt>T</tt>"  and
! <tt>t</tt> as a "modifiable lvalue of type <tt>T</tt>" in 17.6.3.1 [utility.arg.requirements]/1.
  </p>
  
  <p>
  This causes two different defects:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
  We cannot move/copy-initialize a <em>const</em> lvalue of type <tt>T</tt> as in:
  </p>
  
! <blockquote><pre>
! int get_i();
  
  const int i1(get_i());
  </pre></blockquote>
*************** both in Table 33 and in Table 34.
*** 75500,75506 ****
  The single support for
  </p>
  
! <blockquote><pre>T t(rv)
  </pre></blockquote>
  
  <p>
--- 85655,85662 ----
  The single support for
  </p>
  
! <blockquote><pre>
! T t(rv)
  </pre></blockquote>
  
  <p>
*************** in case of <tt>CopyConstructible</tt> me
*** 75508,75514 ****
  lvalue as a source of a copy as in
  </p>
  
! <blockquote><pre>const int&amp; get_lri();
  
  int i2(get_lri());
  </pre></blockquote>
--- 85664,85671 ----
  lvalue as a source of a copy as in
  </p>
  
! <blockquote><pre>
! const int&amp; get_lri();
  
  int i2(get_lri());
  </pre></blockquote>
*************** output/forward iterator requirements)..
*** 75537,75543 ****
  
  
  <p><i>[
! 2010-02-10 Reopened. The proposed wording of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1283">1283</a> has been
  merged here.
  ]</i></p>
  
--- 85694,85700 ----
  
  
  <p><i>[
! 2010-02-10 Reopened. The proposed wording of <a href="lwg-defects.html#1283">1283</a> has been
  merged here.
  ]</i></p>
  
*************** merged here.
*** 75555,75567 ****
  
  <li>
  <p>
! Change 20.2.1 [utility.arg.requirements]/1 as indicated: <i>[This change
  suggestion is motivated to make type descriptions clearer: First, <tt>a</tt>,
  <tt>b</tt>, and <tt>c</tt> <em>may</em> also be non-<tt>const T</tt>. Second, <tt>u</tt>
  is described in a manner consistent with the container requirements tables.]</i>
  </p>
  
! <blockquote>
  1 The template definitions in the C++ standard library refer to various named
  requirements whose details are set out in tables 31-38. In these tables,
  <tt>T</tt> is a<ins>n object or reference</ins> type to be supplied by a C++
--- 85712,85724 ----
  
  <li>
  <p>
! Change 17.6.3.1 [utility.arg.requirements]/1 as indicated: <i>[This change
  suggestion is motivated to make type descriptions clearer: First, <tt>a</tt>,
  <tt>b</tt>, and <tt>c</tt> <em>may</em> also be non-<tt>const T</tt>. Second, <tt>u</tt>
  is described in a manner consistent with the container requirements tables.]</i>
  </p>
  
! <blockquote><p>
  1 The template definitions in the C++ standard library refer to various named
  requirements whose details are set out in tables 31-38. In these tables,
  <tt>T</tt> is a<ins>n object or reference</ins> type to be supplied by a C++
*************** identifier;</ins> <del>is a value of typ
*** 75572,75592 ****
  and</del> <tt>rv</tt> is a<ins>n</ins> <del>non-const</del> rvalue of type
  <tt>T</tt><ins>; and <tt>v</tt> is an lvalue of type (possibly <tt>const</tt>)
  <tt>T</tt> or an rvalue of type <tt>const T</tt></ins>.
! </blockquote>
  </li>
  
  <li>
  <p>
! In 20.2.1 [utility.arg.requirements] Table 33 ([moveconstructible])
  change as indicated <i>[Note: The symbol <tt>u</tt> is defined to be either a
  const or a non-const value and is the right one we need here]</i>:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 33 — <tt>MoveConstructible</tt> requirements [moveconstructible]</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Post-condition</th>
  </tr>
--- 85729,85749 ----
  and</del> <tt>rv</tt> is a<ins>n</ins> <del>non-const</del> rvalue of type
  <tt>T</tt><ins>; and <tt>v</tt> is an lvalue of type (possibly <tt>const</tt>)
  <tt>T</tt> or an rvalue of type <tt>const T</tt></ins>.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! In 17.6.3.1 [utility.arg.requirements] Table 33 ([moveconstructible])
  change as indicated <i>[Note: The symbol <tt>u</tt> is defined to be either a
  const or a non-const value and is the right one we need here]</i>:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 33 &mdash; <tt>MoveConstructible</tt> requirements [moveconstructible]</caption>
  
! <tr>
  <th>Expression</th>
  <th>Post-condition</th>
  </tr>
*************** construction</ins></td>
*** 75612,75626 ****
  <del>There is no requirement on the value of <tt>rv</tt> after the
  construction.</del>
  <ins><tt>rv</tt> remains a valid object.  Its state is unspecified.</ins>
! — <i>end note</i>]</td>
  </tr>
! </tbody></table>
  </blockquote>
  </li>
  
  <li>
  <p>
! In 20.2.1 [utility.arg.requirements] Table 34 ([copyconstructible])
  change as indicated <i>[Note: The symbol <tt>u</tt> is defined to be either a
  const or a non-const value and is the right one we need here. The expressions
  using <tt>a</tt> are recommended to ensure that lvalues are supported as sources
--- 85769,85783 ----
  <del>There is no requirement on the value of <tt>rv</tt> after the
  construction.</del>
  <ins><tt>rv</tt> remains a valid object.  Its state is unspecified.</ins>
! &mdash; <i>end note</i>]</td>
  </tr>
! </table>
  </blockquote>
  </li>
  
  <li>
  <p>
! In 17.6.3.1 [utility.arg.requirements] Table 34 ([copyconstructible])
  change as indicated <i>[Note: The symbol <tt>u</tt> is defined to be either a
  const or a non-const value and is the right one we need here. The expressions
  using <tt>a</tt> are recommended to ensure that lvalues are supported as sources
*************** of the copy expression]</i>:
*** 75629,75638 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 34 — <tt>CopyConstructible</tt> requirements [copyconstructible]<br>
  <ins>(in addition to <tt>MoveConstructible</tt>)</ins></caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Post-condition</th>
  </tr>
--- 85786,85795 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 34 &mdash; <tt>CopyConstructible</tt> requirements [copyconstructible]<br/>
  <ins>(in addition to <tt>MoveConstructible</tt>)</ins></caption>
  
! <tr>
  <th>Expression</th>
  <th>Post-condition</th>
  </tr>
*************** is unchanged and is equivalent to <tt><d
*** 75658,75682 ****
  <tr>
  <td colspan="2"><del>[<i>Note:</i> A type that satisfies the
  <tt>CopyConstructible</tt> requirements also satisfies the <tt>MoveConstructible</tt>
! requirements. — <i>end note</i>]</del></td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  </li>
  
  <li>
  <p>
! In Table 35 — MoveAssignable requirements [moveassignable] change as
  indicated:
  </p>
  
  <blockquote>
  
  <table border="1">
! <caption>Table 35 — <tt>MoveAssignable</tt> requirements <b>[moveassignable]</b></caption>
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Return value</th>
--- 85815,85839 ----
  <tr>
  <td colspan="2"><del>[<i>Note:</i> A type that satisfies the
  <tt>CopyConstructible</tt> requirements also satisfies the <tt>MoveConstructible</tt>
! requirements. &mdash; <i>end note</i>]</del></td>
  </tr>
  
! </table>
  </blockquote>
  
  </li>
  
  <li>
  <p>
! In Table 35 &mdash; MoveAssignable requirements [moveassignable] change as
  indicated:
  </p>
  
  <blockquote>
  
  <table border="1">
! <caption>Table 35 &mdash; <tt>MoveAssignable</tt> requirements <b>[moveassignable]</b></caption>
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Return value</th>
*************** indicated:
*** 75702,75726 ****
  <del>There is no requirement on the value of <tt>rv</tt> after the
  assignment.</del>
  <ins><tt>rv</tt> remains a valid object.  Its state is unspecified.</ins>
! — <i>end note</i>]
  </td>
  </tr>
! </tbody></table>
  
  </blockquote>
  </li>
  
  <li>
  <p>
! In 20.2.1 [utility.arg.requirements] change Table 36 as indicated:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 36 — <tt>CopyAssignable</tt> requirements
! [copyassignable]<br><ins>(in addition to <tt>MoveAssignable</tt>)</ins></caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Return value</th>
--- 85859,85883 ----
  <del>There is no requirement on the value of <tt>rv</tt> after the
  assignment.</del>
  <ins><tt>rv</tt> remains a valid object.  Its state is unspecified.</ins>
! &mdash; <i>end note</i>]
  </td>
  </tr>
! </table>
  
  </blockquote>
  </li>
  
  <li>
  <p>
! In 17.6.3.1 [utility.arg.requirements] change Table 36 as indicated:
  </p>
  
  <blockquote>
  <table border="1">
! <caption>Table 36 &mdash; <tt>CopyAssignable</tt> requirements
! [copyassignable]<br/><ins>(in addition to <tt>MoveAssignable</tt>)</ins></caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Return value</th>
*************** In 20.2.1 [utility.arg.requirements] cha
*** 75737,75747 ****
  
  <tr>
  <td colspan="4"><del>[<i>Note:</i> A type that satisfies the <tt>CopyAssignable</tt>
! requirements also satisfies the <tt>MoveAssignable</tt> requirements. —
  <i>end note</i>]</del></td>
  </tr>
  
! </tbody></table>
  </blockquote>
  </li>
  </ol>
--- 85894,85904 ----
  
  <tr>
  <td colspan="4"><del>[<i>Note:</i> A type that satisfies the <tt>CopyAssignable</tt>
! requirements also satisfies the <tt>MoveAssignable</tt> requirements. &mdash;
  <i>end note</i>]</del></td>
  </tr>
  
! </table>
  </blockquote>
  </li>
  </ol>
*************** requirements also satisfies the <tt>Move
*** 75752,75761 ****
  
  
  <hr>
  <h3><a name="1312"></a>1312. <tt>vector::data</tt> no longer returns a raw pointer</h3>
! <p><b>Section:</b> 23.4.1.3 [vector.data] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-02-07 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The original intent of <tt>vector::data</tt> was to match <tt>array::data</tt>
--- 85909,86155 ----
  
  
  <hr>
+ <h3><a name="1310"></a>1310. <tt>forward_list splice_after</tt> from lvalues</h3>
+ <p><b>Section:</b> 23.3.4.6 [forwardlist.ops] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-02-05 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ We've moved <a href="lwg-defects.html#1133">1133</a> to Tentatively Ready and I'm fine with that.
+ </p>
+ 
+ <p>
+ <a href="lwg-defects.html#1133">1133</a> adds lvalue-references to the <tt>splice</tt> signatures for <tt>list</tt>.  So now
+ <tt>list</tt> can <tt>splice</tt> from lvalue and rvalue lists (which was the intent of the
+ original move papers btw).  During the discussion of this issue it was mentioned
+ that if we want to give the same treatment to <tt>forward_list</tt>, that should be a
+ separate issue.
+ </p>
+ 
+ <p>
+ This is that separate issue.
+ </p>
+ 
+ <p>
+ Consider the following case where you want to splice elements from one place in
+ a <tt>forward_list</tt> to another.  Currently this must be coded like so:
+ </p>
+ 
+ <blockquote><pre>
+ fl.splice_after(to_here, std::move(fl), from1, from2);
+ </pre></blockquote>
+ 
+ <p>
+ This looks pretty shocking to me.  I would expect to be able to code instead:
+ </p>
+ 
+ <blockquote><pre>
+ fl.splice_after(to_here, fl, from1, from2);
+ </pre></blockquote>
+ 
+ <p>
+ but we currently don't allow it.
+ </p>
+ 
+ <p>
+ When I say <tt>move(fl)</tt>, I consider that as saying that I don't care about
+ the value of <tt>fl</tt> any more (until I assign it a new value).  But in the
+ above example, this simply isn't true.  I do care about the value of <tt>fl</tt>
+ after the move, and I'm not assigning it a new value.  I'm merely permuting its
+ current value.
+ </p>
+ 
+ <p>
+ I propose adding <tt>forward_list&amp;</tt> overloads to the 3
+ <tt>splice_after</tt> members.  For consistency's sake (principal of least
+ surprise) I'm also proposing to overload <tt>merge</tt> this way as well.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Add to the synopsis of 23.3.4.1 [forwardlist.overview]:
+ </p>
+ 
+ <blockquote><pre>
+ template &lt;class T, class Allocator = allocator&lt;T&gt; &gt;
+ class forward_list {
+ public:
+   ...
+   // <i>[forwardlist.ops], forward_list operations:</i>
+   <ins>void splice_after(const_iterator p, forward_list&amp; x);</ins>
+   void splice_after(const_iterator p, forward_list&amp;&amp; x);
+   <ins>void splice_after(const_iterator p, forward_list&amp; x, const_iterator i);</ins>
+   void splice_after(const_iterator p, forward_list&amp;&amp; x, const_iterator i);
+   <ins>void splice_after(const_iterator p, forward_list&amp; x,
+                     const_iterator first, const_iterator last);</ins>
+   void splice_after(const_iterator p, forward_list&amp;&amp; x,
+                     const_iterator first, const_iterator last);
+   ...
+   <ins>void merge(forward_list&amp; x);</ins>
+   void merge(forward_list&amp;&amp; x);
+   <ins>template &lt;class Compare&gt; void merge(forward_list&amp; x, Compare comp);</ins>
+   template &lt;class Compare&gt; void merge(forward_list&amp;&amp; x, Compare comp);
+   ...
+ };
+ </pre></blockquote>
+ 
+ <p>
+ Add to the signatures of 23.3.4.6 [forwardlist.ops]:
+ </p>
+ 
+ <blockquote>
+ <pre>
+ <ins>void splice_after(const_iterator p, forward_list&amp; x);</ins>
+ void splice_after(const_iterator p, forward_list&amp;&amp; x);
+ </pre>
+ <blockquote>
+ <p>1 ...</p>
+ </blockquote>
+ 
+ <pre>
+ <ins>void splice_after(const_iterator p, forward_list&amp; x, const_iterator i);</ins>
+ void splice_after(const_iterator p, forward_list&amp;&amp; x, const_iterator i);
+ </pre>
+ <blockquote>
+ <p>4 ...</p>
+ </blockquote>
+ 
+ <pre>
+ <ins>void splice_after(const_iterator p, forward_list&amp; x,
+                 const_iterator first, const_iterator last);</ins>
+ void splice_after(const_iterator p, forward_list&amp;&amp; x,
+                 const_iterator first, const_iterator last);
+ </pre>
+ <blockquote>
+ <p>7 ...</p>
+ </blockquote>
+ 
+ <pre>
+ <ins>void merge(forward_list&amp; x);</ins>
+ void merge(forward_list&amp;&amp; x);
+ <ins>template &lt;class Compare&gt; void merge(forward_list&amp; x, Compare comp);</ins>
+ template &lt;class Compare&gt; void merge(forward_list&amp;&amp; x, Compare comp);
+ </pre>
+ <blockquote>
+ <p>16 ...</p>
+ </blockquote>
+ 
+ </blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1311"></a>1311. multi-pass property of Forward Iterator underspecified</h3>
+ <p><b>Section:</b> 24.2.5 [forward.iterators] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-02-07 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#forward.iterators">issues</a> in [forward.iterators].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The following example demonstrates code that would meet the guarantees of a
+ Forward Iterator, but only permits a single traversal of the underlying
+ sequence:
+ </p>
+ 
+ <blockquote><pre>
+ template&lt; typename ForwardIterator&gt;
+ struct bad_iterator {
+   shared_ptr&lt;ForwardIterator&gt; impl;
+ 
+   bad_iterator( ForwardIterator iter ) {
+      : impl{new ForwardIterator{iter} } 
+      {
+   }
+ 
+   auto operator*() const -&gt; decltype(*ForwardIterator{}) {
+      return **impl;
+   }
+ 
+   auto operator-&gt;() const -&gt; ForwardIterator {
+      return *impl;
+   }
+ 
+   auto operator==(bad_iterator const &amp; rhs) const -&gt; bool {
+      return impl == rhs.impl;
+   }
+ 
+   auto operator++() -&gt; bad_iterator&amp; {
+      ++(*impl);
+      return *this;
+   }
+   // other operations as necessary...
+ };
+ </pre></blockquote>
+ 
+ <p>
+ Here, we use <tt>shared_ptr</tt> to wrap a forward iterator, so all iterators
+ constructed from the same original iterator share the same 'value', and
+ incrementing any one copy increments all others.
+ </p>
+ 
+ <p>
+ There is a missing guarantee, expressed by the following code sequence
+ </p>
+ 
+ <blockquote><pre>
+ FwdIter x = seq.begin();  // obtain forward iterator from a sequence
+ FwdIter y = x;            // copy the iterator
+ assert(x == y);           // iterators must be the same
+ ++x;                      // increment *just one* iterator
+ assert(x != y);           // iterators *must now be different*
+ ++y;                      // increment the other iterator
+ assert(x == y);           // now the iterators must be the same again
+ </pre></blockquote>
+ 
+ <p>
+ That inequality in the middle is an essential guarantee.  Note that this list is
+ simplified, as each assertion should also note that they refer to exactly the
+ same element <tt>(&amp;*x == &amp;*y)</tt> but I am not complicating the issue
+ with tests to support proxy iterators, or value types overloading unary
+ <tt>operator+</tt>.
+ </p>
+ 
+ <p>
+ I have not yet found a perverse example that can meet this additional
+ constraint, and not meet the multi-pass expectations of a Forward Iterator
+ without also violating other Forward Iterator requirements.
+ </p>
+ 
+ <p>
+ Note that I do not yet have standard-ready wording to resolve the problem, as
+ saying this neatly and succinctly in 'standardese' is more difficult.
+ </p>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>.  Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
  <h3><a name="1312"></a>1312. <tt>vector::data</tt> no longer returns a raw pointer</h3>
! <p><b>Section:</b> 23.3.6.4 [vector.data] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-02-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The original intent of <tt>vector::data</tt> was to match <tt>array::data</tt>
*************** use the typedef.
*** 75776,75802 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 23.4.1 [vector]
  </p>
  
  <p>
  Update the class definition in p2:
  </p>
  
! <blockquote><pre>// 23.3.6.3 data access
  <del>pointer</del><ins>T *</ins> data();
  <del>const_pointer</del><ins>const T *</ins> data() const;
  </pre></blockquote>
  
  <p>
! 23.4.1.3 [vector.data]
  </p>
  
  <p>
  Adjust signatures:
  </p>
  
! <blockquote><pre><del>pointer</del><ins>T *</ins> data();
  <del>const_pointer</del><ins>const T *</ins> data() const;
  </pre></blockquote>
  
--- 86170,86198 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! 23.3.6 [vector]
  </p>
  
  <p>
  Update the class definition in p2:
  </p>
  
! <blockquote><pre>
! // 23.3.6.3 data access
  <del>pointer</del><ins>T *</ins> data();
  <del>const_pointer</del><ins>const T *</ins> data() const;
  </pre></blockquote>
  
  <p>
! 23.3.6.4 [vector.data]
  </p>
  
  <p>
  Adjust signatures:
  </p>
  
! <blockquote><pre>
! <del>pointer</del><ins>T *</ins> data();
  <del>const_pointer</del><ins>const T *</ins> data() const;
  </pre></blockquote>
  
*************** Adjust signatures:
*** 75806,75815 ****
  
  <hr>
  <h3><a name="1316"></a>1316. <tt>scoped_allocator_adaptor operator==</tt> has no definition</h3>
! <p><b>Section:</b> 20.10 [allocator.adaptor] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-02-11 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.adaptor">issues</a> in [allocator.adaptor].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The WP 
--- 86202,86211 ----
  
  <hr>
  <h3><a name="1316"></a>1316. <tt>scoped_allocator_adaptor operator==</tt> has no definition</h3>
! <p><b>Section:</b> 20.13 [allocator.adaptor] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2009-02-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.adaptor">issues</a> in [allocator.adaptor].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The WP 
*************** Post-Rapperswil:
*** 75835,75843 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 86231,86239 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 75848,75854 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new section after 20.10.3 [allocator.adaptor.members]:
  </p>
  
  <blockquote>
--- 86244,86250 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Add a new section after 20.13.4 [allocator.adaptor.members]:
  </p>
  
  <blockquote>
*************** Add a new section after 20.10.3 [allocat
*** 75858,75877 ****
    bool operator==(const scoped_allocator_adaptor&lt;OuterA1, InnerAllocs...&gt;&amp; a,
                    const scoped_allocator_adaptor&lt;OuterA2, InnerAllocs...&gt;&amp; b);</pre>
  
! <blockquote>
  <i>Returns:</i> <code>a.outer_allocator() == b.outer_allocator()</code>
  if <code>sizeof...(InnerAllocs)</code> is zero; otherwise,
  <code>a.outer_allocator() == b.outer_allocator() &amp;&amp;
  a.inner_allocator() == b.inner_allocator()</code>.
! </blockquote>
  
  <pre>template &lt;class OuterA1, class OuterA2, class... InnerAllocs&gt;
    bool operator!=(const scoped_allocator_adaptor&lt;OuterA1, InnerAllocs...&gt;&amp; a,
                    const scoped_allocator_adaptor&lt;OuterA2, InnerAllocs...&gt;&amp; b);</pre>
  
! <blockquote>
  <i>Returns:</i> <code>!(a == b)</code>.
! </blockquote>
  
  </blockquote>
  
--- 86254,86273 ----
    bool operator==(const scoped_allocator_adaptor&lt;OuterA1, InnerAllocs...&gt;&amp; a,
                    const scoped_allocator_adaptor&lt;OuterA2, InnerAllocs...&gt;&amp; b);</pre>
  
! <blockquote><p>
  <i>Returns:</i> <code>a.outer_allocator() == b.outer_allocator()</code>
  if <code>sizeof...(InnerAllocs)</code> is zero; otherwise,
  <code>a.outer_allocator() == b.outer_allocator() &amp;&amp;
  a.inner_allocator() == b.inner_allocator()</code>.
! </p></blockquote>
  
  <pre>template &lt;class OuterA1, class OuterA2, class... InnerAllocs&gt;
    bool operator!=(const scoped_allocator_adaptor&lt;OuterA1, InnerAllocs...&gt;&amp; a,
                    const scoped_allocator_adaptor&lt;OuterA2, InnerAllocs...&gt;&amp; b);</pre>
  
! <blockquote><p>
  <i>Returns:</i> <code>!(a == b)</code>.
! </p></blockquote>
  
  </blockquote>
  
*************** a.inner_allocator() == b.inner_allocator
*** 75882,75892 ****
  
  <hr>
  <h3><a name="1319"></a>1319. Containers should require an iterator that is at least a Forward Iterator</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-02-16 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirements on container iterators are spelled out in
--- 86278,86288 ----
  
  <hr>
  <h3><a name="1319"></a>1319. Containers should require an iterator that is at least a Forward Iterator</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-02-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirements on container iterators are spelled out in
*************** The requirements on container iterators
*** 75895,75912 ****
  
  <blockquote>
  <table border="1">
! <caption>Table 91 — Container requirements</caption>
  
! <tbody><tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
  <tr>
! <td colspan="5"><center>...</center></td>
  </tr>
  
  <tr>
--- 86291,86308 ----
  
  <blockquote>
  <table border="1">
! <caption>Table 91 &mdash; Container requirements</caption>
  
! <tr>
  <th>Expression</th>
  <th>Return type</th>
  <th>Operational semantics</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
  <tr>
! <td colspan="5" align="center"><tt>...</tt></td>
  </tr>
  
  <tr>
*************** The requirements on container iterators
*** 75927,75936 ****
  </tr>
  
  <tr>
! <td colspan="5"><center>...</center></td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  <p>
--- 86323,86332 ----
  </tr>
  
  <tr>
! <td colspan="5" align="center"><tt>...</tt></td>
  </tr>
  
! </table>
  </blockquote>
  
  <p>
*************** catagories. I recommend to say instead t
*** 75953,75961 ****
  iterator requirements.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready with revised wording after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 86349,86357 ----
  iterator requirements.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready with revised wording after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 75967,75983 ****
  <p><b>Proposed resolution:</b></p>
  
  <ol>
! <li>Change Table 93 — Container requirements in [container.requirements.general] as indicated:
  <blockquote>
  <table border="1">
! <caption>Table 93 — Container requirements</caption>
  
  <tbody>
  <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Operational<br>semantics</th>
! <th>Assertion/note<br>pre-/post-condition</th>
  <th>Complexity</th>
  </tr>
  
--- 86363,86379 ----
  <p><b>Proposed resolution:</b></p>
  
  <ol>
! <li>Change Table 93 &mdash; Container requirements in [container.requirements.general] as indicated:
  <blockquote>
  <table border="1">
! <caption>Table 93 &mdash; Container requirements</caption>
  
  <tbody>
  <tr>
  <th>Expression</th>
  <th>Return type</th>
! <th>Operational<br/>semantics</th>
! <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
  <th>Complexity</th>
  </tr>
  
*************** Adopted at 2010-11 Batavia
*** 75987,76003 ****
  
  <tr>
  <td><tt>X::iterator</tt></td>
! <td>iterator type<br>whose value<br>type is <tt>T</tt></td>
  <td></td>
! <td>any iterator category<br><del>except output iterator</del><ins><br>that meets the forward iterator requirements</ins>. convertible<br>to<br><tt>X::const_iterator</tt></td>
  <td>compile time</td>
  </tr>
  
  <tr>
  <td><tt>X::const_iterator</tt></td>
! <td>constant iterator type<br>whose value<br>type is <tt>T</tt></td>
  <td></td>
! <td>any iterator category<br><del>except output iterator</del><ins><br>that meets the forward iterator requirements</ins>.</td>
  <td>compile time</td>
  </tr>
  
--- 86383,86401 ----
  
  <tr>
  <td><tt>X::iterator</tt></td>
! <td>iterator type<br/>whose value<br/>type is <tt>T</tt></td>
  <td></td>
! <td>any iterator category<br/><del>except output iterator</del><ins><br/>that 
! meets the forward iterator requirements</ins>. convertible<br/>to<br/><tt>X::const_iterator</tt></td>
  <td>compile time</td>
  </tr>
  
  <tr>
  <td><tt>X::const_iterator</tt></td>
! <td>constant iterator type<br/>whose value<br/>type is <tt>T</tt></td>
  <td></td>
! <td>any iterator category<br/><del>except output iterator</del><ins><br/>that 
! meets the forward iterator requirements</ins>.</td>
  <td>compile time</td>
  </tr>
  
*************** Adopted at 2010-11 Batavia
*** 76019,76035 ****
  <hr>
  <h3><a name="1321"></a>1321. <tt>scoped_allocator_adaptor construct</tt> and <tt>destroy</tt> don't
  use <tt>allocator_traits</tt></h3>
! <p><b>Section:</b> 20.10.3 [allocator.adaptor.members] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-02-16 <b>Last modified:</b> 2010-11-20</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.10.3 [allocator.adaptor.members] p8-9 says:
  </p>
  
  <blockquote>
  
! <pre>template &lt;class T, class... Args&gt;
    void construct(T* p, Args&amp;&amp;... args);
  </pre>
  <blockquote>
--- 86417,86435 ----
  <hr>
  <h3><a name="1321"></a>1321. <tt>scoped_allocator_adaptor construct</tt> and <tt>destroy</tt> don't
  use <tt>allocator_traits</tt></h3>
! <p><b>Section:</b> 20.13.4 [allocator.adaptor.members] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-02-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.adaptor.members">issues</a> in [allocator.adaptor.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! 20.13.4 [allocator.adaptor.members] p8-9 says:
  </p>
  
  <blockquote>
  
! <pre>
! template &lt;class T, class... Args&gt;
    void construct(T* p, Args&amp;&amp;... args);
  </pre>
  <blockquote>
*************** inner_allocator())</tt>.
*** 76067,76084 ****
  Otherwise, the program is ill-formed. [<i>Note:</i> an error will result if
  <tt>uses_allocator</tt> evaluates to <tt>true</tt> but the specific constructor
  does not take an allocator. This definition prevents a silent failure to pass an
! inner allocator to a contained element. — <i>end note</i>]
  </li>
  </ul>
  
  </blockquote>
  
! <pre>template &lt;class T&gt;
    void destroy(T* p);
  </pre>
! <blockquote>
  9 <i>Effects:</i> calls <tt>outer_allocator().destroy(p)</tt>.
! </blockquote>
  
  </blockquote>
  
--- 86467,86485 ----
  Otherwise, the program is ill-formed. [<i>Note:</i> an error will result if
  <tt>uses_allocator</tt> evaluates to <tt>true</tt> but the specific constructor
  does not take an allocator. This definition prevents a silent failure to pass an
! inner allocator to a contained element. &mdash; <i>end note</i>]
  </li>
  </ul>
  
  </blockquote>
  
! <pre>
! template &lt;class T&gt;
    void destroy(T* p);
  </pre>
! <blockquote><p>
  9 <i>Effects:</i> calls <tt>outer_allocator().destroy(p)</tt>.
! </p></blockquote>
  
  </blockquote>
  
*************** call members of an allocator directly, b
*** 76089,76100 ****
  </p>
  
  <blockquote>
! <pre>size_type max_size() const;
  </pre>
! <blockquote>
  7 <i>Returns:</i>
  <tt><b>allocator_traits&lt;OuterAlloc&gt;::</b>max_size(outer_allocator())</tt>.
! </blockquote>
  </blockquote>
  
  <p>
--- 86490,86502 ----
  </p>
  
  <blockquote>
! <pre>
! size_type max_size() const;
  </pre>
! <blockquote><p>
  7 <i>Returns:</i>
  <tt><b>allocator_traits&lt;OuterAlloc&gt;::</b>max_size(outer_allocator())</tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** Solved by
*** 76125,76131 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.10.3 [allocator.adaptor.members] move and change p8
  as indicated, and change p9 as indicated:
  </p>
  
--- 86527,86533 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In 20.13.4 [allocator.adaptor.members] move and change p8
  as indicated, and change p9 as indicated:
  </p>
  
*************** does not have an <tt>outer_allocator()</
*** 76141,76151 ****
  <tt><i>OUTERMOST_ALLOC_TRAITS(x)</i></tt> are recursive operations.  It is
  incumbent upon the definition of <tt>outer_allocator()</tt> to ensure that the
  recursion terminates.  It <em>will</em> terminate for all instantiations
! of <tt>scoped_allocator_adaptor</tt>. — <i>end note</i>]
  </ins>
  </p>
  
! <pre>template &lt;class T, class... Args&gt;
    void construct(T* p, Args&amp;&amp;... args);
  </pre>
  <blockquote>
--- 86543,86554 ----
  <tt><i>OUTERMOST_ALLOC_TRAITS(x)</i></tt> are recursive operations.  It is
  incumbent upon the definition of <tt>outer_allocator()</tt> to ensure that the
  recursion terminates.  It <em>will</em> terminate for all instantiations
! of <tt>scoped_allocator_adaptor</tt>. &mdash; <i>end note</i>]
  </ins>
  </p>
  
! <pre>
! template &lt;class T, class... Args&gt;
    void construct(T* p, Args&amp;&amp;... args);
  </pre>
  <blockquote>
*************** std::forward&lt;Args&gt;(args)..., inner
*** 76190,76209 ****
  Otherwise, the program is ill-formed. [<i>Note:</i> an error will result if
  <tt>uses_allocator</tt> evaluates to <tt>true</tt> but the specific constructor
  does not take an allocator. This definition prevents a silent failure to pass an
! inner allocator to a contained element. — <i>end note</i>]
  </li>
  </ul>
  
  </blockquote>
  
! <pre>template &lt;class T&gt;
    void destroy(T* p);
  </pre>
! <blockquote>
  9 <i>Effects:</i> calls <tt><del>outer_allocator().</del>
  <ins><i>OUTERMOST_ALLOC_TRAITS(outer_allocator())</i>::</ins>destroy(
  <ins><i>OUTERMOST(outer_allocator())</i>,</ins> p)</tt>.
! </blockquote>
  
  </blockquote>
  
--- 86593,86613 ----
  Otherwise, the program is ill-formed. [<i>Note:</i> an error will result if
  <tt>uses_allocator</tt> evaluates to <tt>true</tt> but the specific constructor
  does not take an allocator. This definition prevents a silent failure to pass an
! inner allocator to a contained element. &mdash; <i>end note</i>]
  </li>
  </ul>
  
  </blockquote>
  
! <pre>
! template &lt;class T&gt;
    void destroy(T* p);
  </pre>
! <blockquote><p>
  9 <i>Effects:</i> calls <tt><del>outer_allocator().</del>
  <ins><i>OUTERMOST_ALLOC_TRAITS(outer_allocator())</i>::</ins>destroy(
  <ins><i>OUTERMOST(outer_allocator())</i>,</ins> p)</tt>.
! </p></blockquote>
  
  </blockquote>
  
*************** inner allocator to a contained element.
*** 76214,76226 ****
  
  <hr>
  <h3><a name="1322"></a>1322. Explicit <tt>CopyConstructible</tt> requirements are insufficient</h3>
! <p><b>Section:</b> 20.2.1 [utility.arg.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-02-16 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! With the acceptance of library defect <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#822">822</a> only
  direct-initialization is supported, and not copy-initialization in the
  requirement sets <tt>MoveConstructible</tt> and <tt>CopyConstructible</tt>. This
  is usually a good thing, if only the library implementation needs to obey these
--- 86618,86630 ----
  
  <hr>
  <h3><a name="1322"></a>1322. Explicit <tt>CopyConstructible</tt> requirements are insufficient</h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-02-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! With the acceptance of library defect <a href="lwg-closed.html#822">822</a> only
  direct-initialization is supported, and not copy-initialization in the
  requirement sets <tt>MoveConstructible</tt> and <tt>CopyConstructible</tt>. This
  is usually a good thing, if only the library implementation needs to obey these
*************** iterator requirements) and Table 103 (fo
*** 76259,76273 ****
  quite clearly a strong divergence of copy-semantics: The specified semantics of
  </p>
  
! <blockquote><pre>X u(a);
  X u = a;
  </pre></blockquote>
  
  <p>
  are underspecified compared to the most recent clarifications of the
! <tt>CopyConstructible</tt> requirements, c.f. issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1309">1309</a> which is
  very unsatisfactory. This will become worse for each further issue that involves
! the <tt>CopyConstructible</tt> specification (for possible directions see <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1173">1173</a>).
  </p>
  </li>
  </ol>
--- 86663,86678 ----
  quite clearly a strong divergence of copy-semantics: The specified semantics of
  </p>
  
! <blockquote><pre>
! X u(a);
  X u = a;
  </pre></blockquote>
  
  <p>
  are underspecified compared to the most recent clarifications of the
! <tt>CopyConstructible</tt> requirements, c.f. issue <a href="lwg-defects.html#1309">1309</a> which is
  very unsatisfactory. This will become worse for each further issue that involves
! the <tt>CopyConstructible</tt> specification (for possible directions see <a href="lwg-active.html#1173">1173</a>).
  </p>
  </li>
  </ol>
*************** any other reasonable name like <tt>MoveC
*** 76280,76286 ****
  all three problems mentioned above.
  </p>
  
! <p><i>[Batavia: Resolved by accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3215.html">n3215</a>.]</i></p>
  
  
  
--- 86685,86691 ----
  all three problems mentioned above.
  </p>
  
! <p><i>[Batavia: Resolved by accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3215.htm">n3215</a>.]</i></p>
  
  
  
*************** all three problems mentioned above.
*** 76292,76309 ****
  <ol>
  <li>
  <p>
! Add the following new table ?? after Table 34 — <tt>MoveConstructible</tt>
  requirements [moveconstructible]:
  </p>
  
  <blockquote>
  
  <table border="1">
! <caption><ins>Table ?? — <tt>Implicit MoveConstructible</tt> requirements
  [implicit.moveconstructible] (in addition to
  <tt>MoveConstructible</tt>)</ins></caption>
  
! <tbody><tr>
  <th><ins>Expression</ins></th>
  <th><ins>Operational Semantics</ins></th>
  </tr>
--- 86697,86714 ----
  <ol>
  <li>
  <p>
! Add the following new table ?? after Table 34 &mdash; <tt>MoveConstructible</tt>
  requirements [moveconstructible]:
  </p>
  
  <blockquote>
  
  <table border="1">
! <caption><ins>Table ?? &mdash; <tt>Implicit MoveConstructible</tt> requirements
  [implicit.moveconstructible] (in addition to
  <tt>MoveConstructible</tt>)</ins></caption>
  
! <tr>
  <th><ins>Expression</ins></th>
  <th><ins>Operational Semantics</ins></th>
  </tr>
*************** requirements [moveconstructible]:
*** 76313,76337 ****
  <td><ins>Equivalent to: <tt>T u(rv);</tt></ins></td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  </li>
  
  <li>
  <p>
! Add the following new table ?? after Table 35 — <tt>CopyConstructible</tt>
  requirements [copyconstructible]:
  </p>
  
  <blockquote>
  
  <table border="1">
! <caption><ins>Table ?? — <tt>Implicit CopyConstructible</tt> requirements
  [implicit.copyconstructible] (in addition to
  <tt>CopyConstructible</tt>)</ins></caption>
  
! <tbody><tr>
  <th><ins>Expression</ins></th>
  <th><ins>Operational Semantics</ins></th>
  </tr>
--- 86718,86742 ----
  <td><ins>Equivalent to: <tt>T u(rv);</tt></ins></td>
  </tr>
  
! </table>
  </blockquote>
  
  </li>
  
  <li>
  <p>
! Add the following new table ?? after Table 35 &mdash; <tt>CopyConstructible</tt>
  requirements [copyconstructible]:
  </p>
  
  <blockquote>
  
  <table border="1">
! <caption><ins>Table ?? &mdash; <tt>Implicit CopyConstructible</tt> requirements
  [implicit.copyconstructible] (in addition to
  <tt>CopyConstructible</tt>)</ins></caption>
  
! <tr>
  <th><ins>Expression</ins></th>
  <th><ins>Operational Semantics</ins></th>
  </tr>
*************** requirements [copyconstructible]:
*** 76341,76354 ****
  <td><ins>Equivalent to: <tt>T u(v);</tt></ins></td>
  </tr>
  
! </tbody></table>
  </blockquote>
  
  </li>
  
  <li>
  <p>
! Change 20.2.3 [nullablepointer.requirements]/1 as follows:
  </p>
  
  <blockquote>
--- 86746,86759 ----
  <td><ins>Equivalent to: <tt>T u(v);</tt></ins></td>
  </tr>
  
! </table>
  </blockquote>
  
  </li>
  
  <li>
  <p>
! Change 17.6.3.3 [nullablepointer.requirements]/1 as follows:
  </p>
  
  <blockquote>
*************** values. A type <tt>P</tt> meets the requ
*** 76371,76377 ****
  
  <li>
  <p>
! Change 20.2.4 [hash.requirements]/1 as indicated: <i>[explicit
  copy-constructible functors could not be provided as arguments
  to any algorithm that takes these by value. Also a typo is fixed.]</i>
  </p>
--- 86776,86782 ----
  
  <li>
  <p>
! Change 17.6.3.4 [hash.requirements]/1 as indicated: <i>[explicit
  copy-constructible functors could not be provided as arguments
  to any algorithm that takes these by value. Also a typo is fixed.]</i>
  </p>
*************** it satis<ins>fies</ins><del>ifes</del> t
*** 76400,76406 ****
  
  <li>
  <p>
! Change 20.7.1 [meta.rqmts]/1+2 as indicated:
  </p>
  
  <blockquote>
--- 86805,86811 ----
  
  <li>
  <p>
! Change 20.10.1 [meta.rqmts]/1+2 as indicated:
  </p>
  
  <blockquote>
*************** described. It shall be <tt>DefaultConstr
*** 76426,76460 ****
  
  <li>
  <p>
! Change 20.8.2 [func.require]/4 as indicated: <i>[explicit
  copy-constructible functors could not be provided as arguments to any algorithm
  that takes these by value]</i>
  </p>
  
! <blockquote>
  4 Every call wrapper (20.8.1) shall be <tt><ins>implicit</ins>
  MoveConstructible</tt>. A simple call wrapper is a call wrapper that is
  <tt><ins>implicit</ins> CopyConstructible</tt> and <tt>CopyAssignable</tt> and
  whose copy constructor, move constructor, and assignment operator do not throw
  exceptions. [..]
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.4 [refwrap]/1 as indicated:
  </p>
  
! <blockquote>
  1 <tt>reference_wrapper&lt;T&gt;</tt> is a<ins>n <tt>implicit</tt></ins>
  <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt> wrapper around a
  reference to an object or function of type <tt>T</tt>.
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.10.1.2 [func.bind.bind]/5+9 as indicated:
  </p>
  
  <blockquote>
--- 86831,86865 ----
  
  <li>
  <p>
! Change 20.9.2 [func.require]/4 as indicated: <i>[explicit
  copy-constructible functors could not be provided as arguments to any algorithm
  that takes these by value]</i>
  </p>
  
! <blockquote><p>
  4 Every call wrapper (20.8.1) shall be <tt><ins>implicit</ins>
  MoveConstructible</tt>. A simple call wrapper is a call wrapper that is
  <tt><ins>implicit</ins> CopyConstructible</tt> and <tt>CopyAssignable</tt> and
  whose copy constructor, move constructor, and assignment operator do not throw
  exceptions. [..]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.4 [refwrap]/1 as indicated:
  </p>
  
! <blockquote><p>
  1 <tt>reference_wrapper&lt;T&gt;</tt> is a<ins>n <tt>implicit</tt></ins>
  <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt> wrapper around a
  reference to an object or function of type <tt>T</tt>.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.10.3 [func.bind.bind]/5+9 as indicated:
  </p>
  
  <blockquote>
*************** Change 20.8.10.1.2 [func.bind.bind]/5+9
*** 76464,76470 ****
  <tt>TiD</tt> satisfy the requirements of <tt>CopyConstructible</tt>, then the
  return type shall satisfy the requirements of <tt><ins>implicit</ins>
  CopyConstructible</tt>. [<i>Note:</i> this implies that all of <tt>FD</tt> and
! <tt>TiD</tt> are <tt>MoveConstructible</tt>. — <i>end note</i>]
  </p>
  
  <p>
--- 86869,86875 ----
  <tt>TiD</tt> satisfy the requirements of <tt>CopyConstructible</tt>, then the
  return type shall satisfy the requirements of <tt><ins>implicit</ins>
  CopyConstructible</tt>. [<i>Note:</i> this implies that all of <tt>FD</tt> and
! <tt>TiD</tt> are <tt>MoveConstructible</tt>. &mdash; <i>end note</i>]
  </p>
  
  <p>
*************** CopyConstructible</tt>. [<i>Note:</i> th
*** 76477,76483 ****
  <tt>TiD</tt> satisfy the requirements of <tt>CopyConstructible</tt>, then the
  return type shall satisfy the requirements of <tt><ins>implicit</ins>
  CopyConstructible</tt>. [<i>Note:</i> this implies that all of <tt>FD</tt> and
! <tt>TiD</tt> are <tt>MoveConstructible</tt>. — <i>end note</i>]
  </p>
  </blockquote>
  
--- 86882,86888 ----
  <tt>TiD</tt> satisfy the requirements of <tt>CopyConstructible</tt>, then the
  return type shall satisfy the requirements of <tt><ins>implicit</ins>
  CopyConstructible</tt>. [<i>Note:</i> this implies that all of <tt>FD</tt> and
! <tt>TiD</tt> are <tt>MoveConstructible</tt>. &mdash; <i>end note</i>]
  </p>
  </blockquote>
  
*************** CopyConstructible</tt>. [<i>Note:</i> th
*** 76485,76505 ****
  
  <li>
  <p>
! Change 20.8.10.1.3 [func.bind.place] as indicated:
  </p>
  
! <blockquote>
  1 All placeholder types shall be <tt>DefaultConstructible</tt> and
  <tt><ins>implicit</ins> CopyConstructible</tt>, and [..]
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.9 [unique.ptr]/5 as indicated:
  </p>
  
! <blockquote>
  5 Each object of a type <tt>U</tt> instantiated form the <tt>unique_ptr</tt>
  template specified in this subclause has the strict ownership semantics,
  specified above, of a unique pointer. In partial satisfaction of these
--- 86890,86910 ----
  
  <li>
  <p>
! Change 20.9.10.4 [func.bind.place] as indicated:
  </p>
  
! <blockquote><p>
  1 All placeholder types shall be <tt>DefaultConstructible</tt> and
  <tt><ins>implicit</ins> CopyConstructible</tt>, and [..]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.1 [unique.ptr]/5 as indicated:
  </p>
  
! <blockquote><p>
  5 Each object of a type <tt>U</tt> instantiated form the <tt>unique_ptr</tt>
  template specified in this subclause has the strict ownership semantics,
  specified above, of a unique pointer. In partial satisfaction of these
*************** semantics, each such <tt>U</tt> is <tt><
*** 76507,76538 ****
  MoveConstructible</tt> and <tt>MoveAssignable</tt>, but is not
  <tt>CopyConstructible</tt> nor <tt>CopyAssignable</tt>. The template parameter
  <tt>T</tt> of <tt>unique_ptr</tt> may be an incomplete type.
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.10.2 [util.smartptr.shared]/2 as indicated:
  </p>
  
! <blockquote>
  2 Specializations of <tt>shared_ptr</tt> shall be
  <tt><ins>implicit</ins> CopyConstructible</tt>, <tt>CopyAssignable</tt>, and
  <tt>LessThanComparable</tt>, [..]
! </blockquote>
  </li>
  
  <li>
  <p>
! Change 20.9.10.3 [util.smartptr.weak]/2 as indicated:
  </p>
  
! <blockquote>
  2 Specializations of <tt>weak_ptr</tt> shall be <tt><ins>implicit</ins>
  CopyConstructible</tt> and <tt>CopyAssignable</tt>, allowing their use in
  standard containers. The template parameter <tt>T</tt> of <tt>weak_ptr</tt> may
  be an incomplete type.
! </blockquote>
  </li>
  
  <li>
--- 86912,86943 ----
  MoveConstructible</tt> and <tt>MoveAssignable</tt>, but is not
  <tt>CopyConstructible</tt> nor <tt>CopyAssignable</tt>. The template parameter
  <tt>T</tt> of <tt>unique_ptr</tt> may be an incomplete type.
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.2.2 [util.smartptr.shared]/2 as indicated:
  </p>
  
! <blockquote><p>
  2 Specializations of <tt>shared_ptr</tt> shall be
  <tt><ins>implicit</ins> CopyConstructible</tt>, <tt>CopyAssignable</tt>, and
  <tt>LessThanComparable</tt>, [..]
! </p></blockquote>
  </li>
  
  <li>
  <p>
! Change 20.8.2.3 [util.smartptr.weak]/2 as indicated:
  </p>
  
! <blockquote><p>
  2 Specializations of <tt>weak_ptr</tt> shall be <tt><ins>implicit</ins>
  CopyConstructible</tt> and <tt>CopyAssignable</tt>, allowing their use in
  standard containers. The template parameter <tt>T</tt> of <tt>weak_ptr</tt> may
  be an incomplete type.
! </p></blockquote>
  </li>
  
  <li>
*************** and lvalues of type <tt>X</tt> are swapp
*** 76562,76576 ****
  
  <li>
  <p>
! Change D.12.1 [auto.ptr]/3 as indicated:
  </p>
  
! <blockquote>
  3 [..] Instances of <tt>auto_ptr</tt> meet the requirements of
  <tt><ins>implicit</ins> MoveConstructible</tt> and <tt>MoveAssignable</tt>, but
  do not meet the requirements of <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt>. — <i>end note</i>]
! </blockquote>
  </li>
  
  </ol>
--- 86967,86981 ----
  
  <li>
  <p>
! Change X [auto.ptr]/3 as indicated:
  </p>
  
! <blockquote><p>
  3 [..] Instances of <tt>auto_ptr</tt> meet the requirements of
  <tt><ins>implicit</ins> MoveConstructible</tt> and <tt>MoveAssignable</tt>, but
  do not meet the requirements of <tt>CopyConstructible</tt> and
! <tt>CopyAssignable</tt>. &mdash; <i>end note</i>]
! </p></blockquote>
  </li>
  
  </ol>
*************** do not meet the requirements of <tt>Copy
*** 76582,76591 ****
  
  <hr>
  <h3><a name="1323"></a>1323. <tt>basic_string::replace</tt> should use <tt>const_iterator</tt></h3>
! <p><b>Section:</b> 21.4.6.6 [string::replace] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-02-19 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#string::replace">issues</a> in [string::replace].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 86987,86996 ----
  
  <hr>
  <h3><a name="1323"></a>1323. <tt>basic_string::replace</tt> should use <tt>const_iterator</tt></h3>
! <p><b>Section:</b> 21.4.6.6 [string::replace] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-02-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string::replace">issues</a> in [string::replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** Post-Rapperswil:
*** 76607,76615 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 87012,87020 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** In 21.4 [basic.string], class template <
*** 76627,76633 ****
  change as indicated:
  </p>
  
! <blockquote><pre>// 21.4.6 modifiers:
  ...
  basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2,
                        const basic_string&amp; str);
--- 87032,87039 ----
  change as indicated:
  </p>
  
! <blockquote><pre>
! // 21.4.6 modifiers:
  ...
  basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2,
                        const basic_string&amp; str);
*************** In 21.4.6.6 [string::replace] before p.1
*** 76651,76657 ****
  as indicated:
  </p>
  
! <blockquote><pre>basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2, const basic_string&amp; str);
  </pre></blockquote>
  </li>
  
--- 87057,87064 ----
  as indicated:
  </p>
  
! <blockquote><pre>
! basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2, const basic_string&amp; str);
  </pre></blockquote>
  </li>
  
*************** In 21.4.6.6 [string::replace] before p.2
*** 76661,76667 ****
  as indicated:
  </p>
  
! <blockquote><pre>basic_string&amp;
    replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2, const charT* s, size_type n);
  </pre></blockquote>
  </li>
--- 87068,87075 ----
  as indicated:
  </p>
  
! <blockquote><pre>
! basic_string&amp;
    replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2, const charT* s, size_type n);
  </pre></blockquote>
  </li>
*************** In 21.4.6.6 [string::replace] before p.2
*** 76672,76678 ****
  as indicated:
  </p>
  
! <blockquote><pre>basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2, const charT* s);
  </pre></blockquote>
  </li>
  
--- 87080,87087 ----
  as indicated:
  </p>
  
! <blockquote><pre>
! basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2, const charT* s);
  </pre></blockquote>
  </li>
  
*************** In 21.4.6.6 [string::replace] before p.2
*** 76682,76688 ****
  as indicated:
  </p>
  
! <blockquote><pre>basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2, size_type n,
                        charT c);
  </pre></blockquote>
  </li>
--- 87091,87098 ----
  as indicated:
  </p>
  
! <blockquote><pre>
! basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2, size_type n,
                        charT c);
  </pre></blockquote>
  </li>
*************** In 21.4.6.6 [string::replace] before p.3
*** 76693,76699 ****
  as indicated:
  </p>
  
! <blockquote><pre>template&lt;class InputIterator&gt;
    basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2,
                          InputIterator j1, InputIterator j2);
  </pre></blockquote>
--- 87103,87110 ----
  as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;class InputIterator&gt;
    basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2,
                          InputIterator j1, InputIterator j2);
  </pre></blockquote>
*************** In 21.4.6.6 [string::replace] before p.3
*** 76705,76711 ****
  as indicated:
  </p>
  
! <blockquote><pre>basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2,
                        initializer_list&lt;charT&gt; il);
  </pre></blockquote>
  </li>
--- 87116,87123 ----
  as indicated:
  </p>
  
! <blockquote><pre>
! basic_string&amp; replace(<ins>const_</ins>iterator i1, <ins>const_</ins>iterator i2,
                        initializer_list&lt;charT&gt; il);
  </pre></blockquote>
  </li>
*************** as indicated:
*** 76719,76735 ****
  
  <hr>
  <h3><a name="1324"></a>1324. Still too many implicit conversions for <tt>pair</tt> and  <tt>tuple</tt></h3>
! <p><b>Section:</b> 20.3.5.2 [pairs.pair], 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-03-20 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs.pair">issues</a> in [pairs.pair].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In analogy to library defect <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#811">811</a>, <tt>tuple</tt>'s variadic
! constructor
  </p>
  
! <blockquote><pre>template &lt;class... UTypes&gt;
  explicit tuple(UTypes&amp;&amp;... u);
  </pre></blockquote>
  
--- 87131,87147 ----
  
  <hr>
  <h3><a name="1324"></a>1324. Still too many implicit conversions for <tt>pair</tt> and  <tt>tuple</tt></h3>
! <p><b>Section:</b> 20.3.2 [pairs.pair], 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-03-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs.pair">issues</a> in [pairs.pair].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In analogy to library defect <a href="lwg-defects.html#811">811</a>, <tt>tuple</tt>'s variadic constructor
  </p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt;
  explicit tuple(UTypes&amp;&amp;... u);
  </pre></blockquote>
  
*************** explicit tuple(UTypes&amp;&amp;... u);
*** 76737,76743 ****
  creates the same problem as pair:
  </p>
  
! <blockquote><pre>#include &lt;tuple&gt;
  
  int main()
  {
--- 87149,87156 ----
  creates the same problem as pair:
  </p>
  
! <blockquote><pre>
! #include &lt;tuple&gt;
  
  int main()
  {
*************** the corresponding element types are not
*** 76763,76775 ****
  astonishing that in the following example
  </p>
  
! <blockquote><pre>struct A {
    explicit A(int);
  };
  
! A  a = 1; <font color="#C80000">// Error</font>
  
! std::tuple&lt;A&gt; ta = std::make_tuple(1); <font color="#C80000">// # OK?</font>
  </pre></blockquote>
  
  <p>
--- 87176,87189 ----
  astonishing that in the following example
  </p>
  
! <blockquote><pre>
! struct A {
    explicit A(int);
  };
  
! A  a = 1; <span style="color:#C80000">// Error</span>
  
! std::tuple&lt;A&gt; ta = std::make_tuple(1); <span style="color:#C80000">// # OK?</span>
  </pre></blockquote>
  
  <p>
*************** well-formed anyway.
*** 76787,76796 ****
  
  <li>
  <p>
! Following 20.3.5.2 [pairs.pair]/5 add a new Remarks element:
  </p>
  
! <blockquote><pre>template&lt;class U, class V&gt; pair(const pair&lt;U, V&gt;&amp; p);
  </pre>
  
  <blockquote>
--- 87201,87211 ----
  
  <li>
  <p>
! Following 20.3.2 [pairs.pair]/5 add a new Remarks element:
  </p>
  
! <blockquote><pre>
! template&lt;class U, class V&gt; pair(const pair&lt;U, V&gt;&amp; p);
  </pre>
  
  <blockquote>
*************** and <tt>V</tt> is implicitly convertible
*** 76811,76820 ****
  
  <li>
  <p>
! Following 20.3.5.2 [pairs.pair]/6 add a new Remarks element:
  </p>
  
! <blockquote><pre>template&lt;class U, class V&gt; pair(pair&lt;U, V&gt;&amp;&amp; p);
  </pre>
  
  <blockquote>
--- 87226,87236 ----
  
  <li>
  <p>
! Following 20.3.2 [pairs.pair]/6 add a new Remarks element:
  </p>
  
! <blockquote><pre>
! template&lt;class U, class V&gt; pair(pair&lt;U, V&gt;&amp;&amp; p);
  </pre>
  
  <blockquote>
*************** and <tt>V</tt> is implicitly convertible
*** 76837,76843 ****
  Following 20.4.2.1 [tuple.cnstr]/7 add a new Remarks element:
  </p>
  
! <blockquote><pre>template &lt;class... UTypes&gt;
  explicit tuple(UTypes&amp;&amp;... u);
  </pre>
  
--- 87253,87260 ----
  Following 20.4.2.1 [tuple.cnstr]/7 add a new Remarks element:
  </p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt;
  explicit tuple(UTypes&amp;&amp;... u);
  </pre>
  
*************** corresponding type in <tt>Types</tt>.</i
*** 76867,76873 ****
  Following 20.4.2.1 [tuple.cnstr]/13 add a new Remarks element:
  </p>
  
! <blockquote><pre>template &lt;class... UTypes&gt; tuple(const tuple&lt;UTypes...&gt;&amp; u);
  </pre>
  
  <blockquote>
--- 87284,87291 ----
  Following 20.4.2.1 [tuple.cnstr]/13 add a new Remarks element:
  </p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt; tuple(const tuple&lt;UTypes...&gt;&amp; u);
  </pre>
  
  <blockquote>
*************** corresponding type in <tt>Types</tt>.</i
*** 76891,76897 ****
  <p>
  14 [<i>Note:</i> <tt>enable_if</tt> can be used to make the converting
  constructor and assignment operator exist only in the cases where the source and
! target have the same number of elements. — <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
--- 87309,87315 ----
  <p>
  14 [<i>Note:</i> <tt>enable_if</tt> can be used to make the converting
  constructor and assignment operator exist only in the cases where the source and
! target have the same number of elements. &mdash; <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
*************** target have the same number of elements.
*** 76902,76908 ****
  Following 20.4.2.1 [tuple.cnstr]/16 add a new Remarks element:
  </p>
  
! <blockquote><pre>template &lt;class... UTypes&gt; tuple(tuple&lt;UTypes...&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
--- 87320,87327 ----
  Following 20.4.2.1 [tuple.cnstr]/16 add a new Remarks element:
  </p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt; tuple(tuple&lt;UTypes...&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
*************** corresponding type in <tt>Types</tt>.</i
*** 76926,76932 ****
  <p>
  [<i>Note:</i> <tt>enable_if</tt> can be used to make the converting constructor
  and assignment operator exist only in the cases where the source and target have
! the same number of elements. — <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
--- 87345,87351 ----
  <p>
  [<i>Note:</i> <tt>enable_if</tt> can be used to make the converting constructor
  and assignment operator exist only in the cases where the source and target have
! the same number of elements. &mdash; <i>end note</i>]
  </p>
  </blockquote>
  </blockquote>
*************** the same number of elements. — <i>end no
*** 76937,76943 ****
  Following 20.4.2.1 [tuple.cnstr]/18 add a new Remarks element:
  </p>
  
! <blockquote><pre>template &lt;class U1, class U2&gt; tuple(const pair&lt;U1, U2&gt;&amp; u);
  </pre>
  
  <blockquote>
--- 87356,87363 ----
  Following 20.4.2.1 [tuple.cnstr]/18 add a new Remarks element:
  </p>
  
! <blockquote><pre>
! template &lt;class U1, class U2&gt; tuple(const pair&lt;U1, U2&gt;&amp; u);
  </pre>
  
  <blockquote>
*************** resolution unless <tt>U1</tt> is implici
*** 76967,76973 ****
  Following 20.4.2.1 [tuple.cnstr]/20 add a new Remarks element:
  </p>
  
! <blockquote><pre>template &lt;class U1, class U2&gt; tuple(pair&lt;U1, U2&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
--- 87387,87394 ----
  Following 20.4.2.1 [tuple.cnstr]/20 add a new Remarks element:
  </p>
  
! <blockquote><pre>
! template &lt;class U1, class U2&gt; tuple(pair&lt;U1, U2&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
*************** resolution unless <tt>U1</tt> is implici
*** 76999,77023 ****
  ]</i></p>
  
  
! <blockquote>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue.
! </blockquote>
  
  
! <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! 
! 
  
  
  
  
  <hr>
! <h3><a name="1325"></a>1325. bitset</h3>
! <p><b>Section:</b> 20.5.1 [bitset.cons] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Christopher Jefferson <b>Opened:</b> 2010-03-07 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitset.cons">issues</a> in [bitset.cons].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As mentioned on the boost mailing list:
--- 87420,87445 ----
  ]</i></p>
  
  
! <blockquote><p>
! Accepting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> 
! would solve this issue.
! </p></blockquote>
  
  
! <p><b>Proposed resolution:</b></p><p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1325"></a>1325. <tt>bitset</tt></h3>
! <p><b>Section:</b> 20.6.1 [bitset.cons] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Christopher Jefferson <b>Opened:</b> 2010-03-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitset.cons">issues</a> in [bitset.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  As mentioned on the boost mailing list:
*************** between the "<tt>unsigned long long</tt>
*** 77029,77035 ****
  constructors.
  </p>
  
! <blockquote><pre>#include &lt;bitset&gt;
  std::bitset&lt;10&gt; b(0);
  </pre></blockquote>
  
--- 87451,87458 ----
  constructors.
  </p>
  
! <blockquote><pre>
! #include &lt;bitset&gt;
  std::bitset&lt;10&gt; b(0);
  </pre></blockquote>
  
*************** could be easily added and constitutes an
*** 77053,77059 ****
  example, the following code would invoke UB with the current
  P/R:</p>
  <blockquote>
! <pre>char s[4] = { '0', '1', '0', '1' }; // notice: not null-terminated!
  bitset&lt;4&gt; b(s, 0, 4);
  </pre></blockquote>
  because it requires the evaluation (under the as-if rule, to be fair,
--- 87476,87483 ----
  example, the following code would invoke UB with the current
  P/R:</p>
  <blockquote>
! <pre>
! char s[4] = { '0', '1', '0', '1' }; // notice: not null-terminated!
  bitset&lt;4&gt; b(s, 0, 4);
  </pre></blockquote>
  because it requires the evaluation (under the as-if rule, to be fair,
*************** not have a <tt>pos</tt> parameter</p>
*** 77070,77078 ****
  </li>
  </ul>
  
! <blockquote>
! Moved to Tentatively Ready with revised wording provided by Alberto Ganesh Babati after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 87494,87503 ----
  </li>
  </ul>
  
! <blockquote><p>
! Moved to Tentatively Ready with revised wording provided by Alberto 
! Ganesh Babati after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 77086,77094 ****
  
  <ol>
  <li>In the synopsis of header <tt>&lt;bitset&gt;</tt> in
! 20.5 [template.bitset]/1, replace the fourth bitset constructor:
  <blockquote>
! <pre><del>explicit bitset(const char *str);</del>
  <ins>template &lt;class charT&gt;
    explicit bitset(
      const charT *str,
--- 87511,87520 ----
  
  <ol>
  <li>In the synopsis of header <tt>&lt;bitset&gt;</tt> in
! 20.6 [template.bitset]/1, replace the fourth bitset constructor:
  <blockquote>
! <pre>
! <del>explicit bitset(const char *str);</del>
  <ins>template &lt;class charT&gt;
    explicit bitset(
      const charT *str,
*************** Adopted at 2010-11 Batavia
*** 77096,77113 ****
      charT zero = charT('0'), charT one = charT('1'));</ins>
  </pre></blockquote>
  </li>
! <li>In 20.5.1 [bitset.cons]/8:
  <blockquote>
! <pre><del>explicit bitset(const char *str);</del>
  <ins>template &lt;class charT&gt;
  explicit
  bitset(const charT *str,
         typename basic_string&lt;charT&gt;::size_type n = basic_string&lt;charT&gt;::npos,
         charT zero = charT('0'), charT one = charT('1'));</ins>
  </pre></blockquote>
  Effects: Constructs an object of class
  <tt>bitset&lt;N&gt;</tt> as if by
  <del>bitset(string(str)).</del>
  <blockquote><pre><ins>
  bitset(
    n == basic_string&lt;charT&gt;::npos
--- 87522,87542 ----
      charT zero = charT('0'), charT one = charT('1'));</ins>
  </pre></blockquote>
  </li>
! <li>In 20.6.1 [bitset.cons]/8:
  <blockquote>
! <pre>
! <del>explicit bitset(const char *str);</del>
  <ins>template &lt;class charT&gt;
  explicit
  bitset(const charT *str,
         typename basic_string&lt;charT&gt;::size_type n = basic_string&lt;charT&gt;::npos,
         charT zero = charT('0'), charT one = charT('1'));</ins>
  </pre></blockquote>
+ <p>
  Effects: Constructs an object of class
  <tt>bitset&lt;N&gt;</tt> as if by
  <del>bitset(string(str)).</del>
+ </p>
  <blockquote><pre><ins>
  bitset(
    n == basic_string&lt;charT&gt;::npos
*************** bitset(
*** 77124,77134 ****
  
  
  <hr>
! <h3><a name="1326"></a>1326. Missing/wrong preconditions for <tt>pair</tt> and <tt>tuple</tt> functions</h3>
! <p><b>Section:</b> 20.3.5.2 [pairs.pair], 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-03-07 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs.pair">issues</a> in [pairs.pair].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are several constructors and creation functions of std::tuple
--- 87553,87563 ----
  
  
  <hr>
! <h3><a name="1326"></a>1326. Missing&#47;wrong preconditions for <tt>pair</tt> and <tt>tuple</tt> functions</h3>
! <p><b>Section:</b> 20.3.2 [pairs.pair], 20.4.2.1 [tuple.cnstr] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-03-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs.pair">issues</a> in [pairs.pair].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  There are several constructors and creation functions of std::tuple
*************** CopyConstructible requirements are bad d
*** 77140,77164 ****
  references. Some examples:
  </p>
  
! <ol type="a">
  <li>
  <p>
  20.4.2.1 [tuple.cnstr] before p.4 and p.8, resp.:
  </p>
  
! <blockquote><pre>explicit tuple(const Types&amp;...);
  </pre>
! <blockquote>
  4 <i>Requires:</i> Each type in <tt>Types</tt> shall be copy constructible.
! </blockquote>
  
! <pre>tuple(const tuple&amp; u) = default;
  </pre>
! <blockquote>
  8 <i>Requires:</i> Each type in <tt>Types</tt> shall satisfy the requirements of
  <tt>CopyConstructible</tt> (Table 34).
! 
! </blockquote>
  </blockquote>
  
  <p>
--- 87569,87594 ----
  references. Some examples:
  </p>
  
! <ol style="list-style-type:lower-alpha">
  <li>
  <p>
  20.4.2.1 [tuple.cnstr] before p.4 and p.8, resp.:
  </p>
  
! <blockquote><pre>
! explicit tuple(const Types&amp;...);
  </pre>
! <blockquote><p>
  4 <i>Requires:</i> Each type in <tt>Types</tt> shall be copy constructible.
! </p></blockquote>
  
! <pre>
! tuple(const tuple&amp; u) = default;
  </pre>
! <blockquote><p>
  8 <i>Requires:</i> Each type in <tt>Types</tt> shall satisfy the requirements of
  <tt>CopyConstructible</tt> (Table 34).
! </p></blockquote>
  </blockquote>
  
  <p>
*************** non-reference type, this requirement wou
*** 77172,77178 ****
  because there is no reason to disallow a type such as
  </p>
  
! <blockquote><pre>struct NoMoveNoCopy {
    NoMoveNoCopy(NoMoveNoCopy&amp;&amp;) = delete;
    NoMoveNoCopy(const NoMoveNoCopy&amp;) = delete;
    ...
--- 87602,87609 ----
  because there is no reason to disallow a type such as
  </p>
  
! <blockquote><pre>
! struct NoMoveNoCopy {
    NoMoveNoCopy(NoMoveNoCopy&amp;&amp;) = delete;
    NoMoveNoCopy(const NoMoveNoCopy&amp;) = delete;
    ...
*************** produce a <tt>tuple&lt;C&gt;</tt> that d
*** 77206,77228 ****
  20.4.2.1 [tuple.cnstr] before p.6 and p.10, resp.:
  </p>
  
! <blockquote><pre>template &lt;class... UTypes&gt;
  explicit tuple(UTypes&amp;&amp;... u);
  </pre>
  
! <blockquote>
  6 <i>Requires:</i> Each type in <tt>Types</tt> shall satisfy the
  requirements of <tt>MoveConstructible</tt> (Table 33) from the
  corresponding type in <tt>UTypes</tt>. <tt>sizeof...(Types) ==
  sizeof...(UTypes)</tt>.
! </blockquote>
  
! <pre>tuple(tuple&amp;&amp; u);
  </pre>
! <blockquote>
  10 <i>Requires:</i> Each <tt>type</tt> in <tt>Types</tt> shall shall
  satisfy the requirements of <tt>MoveConstructible</tt> (Table 33).
! </blockquote>
  </blockquote>
  
  <p>
--- 87637,87661 ----
  20.4.2.1 [tuple.cnstr] before p.6 and p.10, resp.:
  </p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt;
  explicit tuple(UTypes&amp;&amp;... u);
  </pre>
  
! <blockquote><p>
  6 <i>Requires:</i> Each type in <tt>Types</tt> shall satisfy the
  requirements of <tt>MoveConstructible</tt> (Table 33) from the
  corresponding type in <tt>UTypes</tt>. <tt>sizeof...(Types) ==
  sizeof...(UTypes)</tt>.
! </p></blockquote>
  
! <pre>
! tuple(tuple&amp;&amp; u);
  </pre>
! <blockquote><p>
  10 <i>Requires:</i> Each <tt>type</tt> in <tt>Types</tt> shall shall
  satisfy the requirements of <tt>MoveConstructible</tt> (Table 33).
! </p></blockquote>
  </blockquote>
  
  <p>
*************** the <tt>MoveConstructible</tt> requireme
*** 77232,77251 ****
  requirements would be
  </p>
  
! <blockquote>
  <tt>is_constructible&lt;Ti, Ui&gt;::value</tt> shall evaluate to true
  for all <tt>Ti</tt> in <tt>Types</tt> and for all <tt>Ui</tt> in
  <tt>UTypes</tt>
! </blockquote>
  
  <p>
  and
  </p>
  
! <blockquote>
  <tt>is_constructible&lt;Ti, Ti&gt;::value</tt> shall evaluate to true
  for all <tt>Ti</tt> in <tt>Types</tt>
! </blockquote>
  
  <p>
  respectively.
--- 87665,87684 ----
  requirements would be
  </p>
  
! <blockquote><p>
  <tt>is_constructible&lt;Ti, Ui&gt;::value</tt> shall evaluate to true
  for all <tt>Ti</tt> in <tt>Types</tt> and for all <tt>Ui</tt> in
  <tt>UTypes</tt>
! </p></blockquote>
  
  <p>
  and
  </p>
  
! <blockquote><p>
  <tt>is_constructible&lt;Ti, Ti&gt;::value</tt> shall evaluate to true
  for all <tt>Ti</tt> in <tt>Types</tt>
! </p></blockquote>
  
  <p>
  respectively.
*************** suggested resolution. Further-on the P/R
*** 77264,77275 ****
  ]</i></p>
  
  
! <blockquote>
  The issue became updated to fix some minor inconsistencies and to ensure a
  similarly required fix for <tt>std::pair</tt>, which has the same specification
  problem as <tt>std::tuple</tt>, since <tt>pair</tt> became extended to support
  reference members as well.
! </blockquote>
  
  <p><i>[Original proposed resolution:]</i></p>
  
--- 87697,87708 ----
  ]</i></p>
  
  
! <blockquote><p>
  The issue became updated to fix some minor inconsistencies and to ensure a
  similarly required fix for <tt>std::pair</tt>, which has the same specification
  problem as <tt>std::tuple</tt>, since <tt>pair</tt> became extended to support
  reference members as well.
! </p></blockquote>
  
  <p><i>[Original proposed resolution:]</i></p>
  
*************** reference members as well.
*** 77277,77288 ****
  
  <li>
  <p>
! Change 20.3.5.2 [pairs.pair]/1 as indicated <i>[The changes for the effects
  elements are not normative changes, they just ensure
  harmonization with existing wording style]</i>:
  </p>
  
! <blockquote><pre>constexpr pair();
  </pre>
  
  <blockquote>
--- 87710,87722 ----
  
  <li>
  <p>
! Change 20.3.2 [pairs.pair]/1 as indicated <i>[The changes for the effects
  elements are not normative changes, they just ensure
  harmonization with existing wording style]</i>:
  </p>
  
! <blockquote><pre>
! constexpr pair();
  </pre>
  
  <blockquote>
*************** the <tt>DefaultConstructible</tt> requir
*** 77304,77313 ****
  
  <li>
  <p>
! Change 20.3.5.2 [pairs.pair]/2 as indicated:
  </p>
  
! <blockquote><pre>pair(const T1&amp; x, const T2&amp; y);
  </pre>
  
  <blockquote>
--- 87738,87748 ----
  
  <li>
  <p>
! Change 20.3.2 [pairs.pair]/2 as indicated:
  </p>
  
! <blockquote><pre>
! pair(const T1&amp; x, const T2&amp; y);
  </pre>
  
  <blockquote>
*************** is <tt>true</tt>.</ins>
*** 77329,77338 ****
  
  <li>
  <p>
! Change 20.3.5.2 [pairs.pair]/3 as indicated:
  </p>
  
! <blockquote><pre>template&lt;class U, class V&gt; pair(U&amp;&amp; x, V&amp;&amp; y);
  </pre>
  
  <blockquote>
--- 87764,87774 ----
  
  <li>
  <p>
! Change 20.3.2 [pairs.pair]/3 as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;class U, class V&gt; pair(U&amp;&amp; x, V&amp;&amp; y);
  </pre>
  
  <blockquote>
*************** resolution.
*** 77362,77373 ****
  
  <li>
  <p>
! Change 20.3.5.2 [pairs.pair]/5 as indicated <i>[The change in the effects
  element should be non-normatively and is in compatible to the change suggestion
! of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1324">1324</a>]</i>:
  </p>
  
! <blockquote><pre>template&lt;class U, class V&gt; pair(const pair&lt;U, V&gt;&amp; p);
  </pre>
  
  <blockquote>
--- 87798,87810 ----
  
  <li>
  <p>
! Change 20.3.2 [pairs.pair]/5 as indicated <i>[The change in the effects
  element should be non-normatively and is in compatible to the change suggestion
! of <a href="lwg-defects.html#1324">1324</a>]</i>:
  </p>
  
! <blockquote><pre>
! template&lt;class U, class V&gt; pair(const pair&lt;U, V&gt;&amp; p);
  </pre>
  
  <blockquote>
*************** argument<del>, performing implicit conve
*** 77389,77398 ****
  
  <li>
  <p>
! Change 20.3.5.2 [pairs.pair]/6 as indicated:
  </p>
  
! <blockquote><pre>template&lt;class U, class V&gt; pair(pair&lt;U, V&gt;&amp;&amp; p);
  </pre>
  
  <blockquote>
--- 87826,87836 ----
  
  <li>
  <p>
! Change 20.3.2 [pairs.pair]/6 as indicated:
  </p>
  
! <blockquote><pre>
! template&lt;class U, class V&gt; pair(pair&lt;U, V&gt;&amp;&amp; p);
  </pre>
  
  <blockquote>
*************** Change 20.3.5.2 [pairs.pair]/6 as indica
*** 77414,77424 ****
  
  <li>
  <p>
! Change 20.3.5.2 [pairs.pair]/7+8 as indicated [The deletion in the effects
  element should be non-normatively]:
  </p>
  
! <blockquote><pre>template&lt;class... Args1, class... Args2&gt;
    pair(piecewise_construct_t,
         tuple&lt;Args1...&gt; first_args, tuple&lt;Args2...&gt; second_args);
  </pre>
--- 87852,87863 ----
  
  <li>
  <p>
! Change 20.3.2 [pairs.pair]/7+8 as indicated [The deletion in the effects
  element should be non-normatively]:
  </p>
  
! <blockquote><pre>
! template&lt;class... Args1, class... Args2&gt;
    pair(piecewise_construct_t,
         tuple&lt;Args1...&gt; first_args, tuple&lt;Args2...&gt; second_args);
  </pre>
*************** piecewise construction.
*** 77453,77462 ****
  
  <li>
  <p>
! Change 20.3.5.2 [pairs.pair] before 12 as indicated:
  </p>
  
! <blockquote><pre>pair&amp; operator=(pair&amp;&amp; p);
  </pre>
  
  <blockquote>
--- 87892,87902 ----
  
  <li>
  <p>
! Change 20.3.2 [pairs.pair] before 12 as indicated:
  </p>
  
! <blockquote><pre>
! pair&amp; operator=(pair&amp;&amp; p);
  </pre>
  
  <blockquote>
*************** alternative could be to write "first_typ
*** 77489,77495 ****
  rvalue of U [..]"]
  </p>
  
! <blockquote><pre>template&lt;class U, class V&gt; pair&amp; operator=(pair&lt;U, V&gt;&amp;&amp; p);
  </pre>
  
  <blockquote>
--- 87929,87936 ----
  rvalue of U [..]"]
  </p>
  
! <blockquote><pre>
! template&lt;class U, class V&gt; pair&amp; operator=(pair&lt;U, V&gt;&amp;&amp; p);
  </pre>
  
  <blockquote>
*************** and to <tt>second</tt> with <tt>std::mov
*** 77519,77525 ****
  Change 20.4.2.1 [tuple.cnstr]/4+5 as indicated:
  </p>
  
! <blockquote><pre>explicit tuple(const Types&amp;...);
  </pre>
  
  <blockquote>
--- 87960,87967 ----
  Change 20.4.2.1 [tuple.cnstr]/4+5 as indicated:
  </p>
  
! <blockquote><pre>
! explicit tuple(const Types&amp;...);
  </pre>
  
  <blockquote>
*************** value of the corresponding parameter.
*** 77545,77551 ****
  Change 20.4.2.1 [tuple.cnstr]/6 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class... UTypes&gt;
  explicit tuple(UTypes&amp;&amp;... u);
  </pre>
  
--- 87987,87994 ----
  Change 20.4.2.1 [tuple.cnstr]/6 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt;
  explicit tuple(UTypes&amp;&amp;... u);
  </pre>
  
*************** corresponding value in <tt>std::forward&
*** 77573,77579 ****
  Change 20.4.2.1 [tuple.cnstr]/8+9 as indicated:
  </p>
  
! <blockquote><pre>tuple(const tuple&amp; u) = default;
  </pre>
  
  <blockquote>
--- 88016,88023 ----
  Change 20.4.2.1 [tuple.cnstr]/8+9 as indicated:
  </p>
  
! <blockquote><pre>
! tuple(const tuple&amp; u) = default;
  </pre>
  
  <blockquote>
*************** of <tt>*this</tt> with the corresponding
*** 77598,77604 ****
  Change 20.4.2.1 [tuple.cnstr]/10+11 as indicated:
  </p>
  
! <blockquote><pre>tuple(tuple&amp;&amp; u);
  </pre>
  
  <blockquote>
--- 88042,88049 ----
  Change 20.4.2.1 [tuple.cnstr]/10+11 as indicated:
  </p>
  
! <blockquote><pre>
! tuple(tuple&amp;&amp; u);
  </pre>
  
  <blockquote>
*************** requirements of <tt>MoveConstructible</t
*** 77625,77631 ****
  Change 20.4.2.1 [tuple.cnstr]/15+16 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class... UTypes&gt; tuple(tuple&lt;UTypes...&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
--- 88070,88077 ----
  Change 20.4.2.1 [tuple.cnstr]/15+16 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class... UTypes&gt; tuple(tuple&lt;UTypes...&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
*************** type in <tt>UTypes</tt></del>. <tt>sizeo
*** 77656,77662 ****
  Change 20.4.2.1 [tuple.cnstr]/19+20 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class U1, class U2&gt; tuple(pair&lt;U1, U2&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
--- 88102,88109 ----
  Change 20.4.2.1 [tuple.cnstr]/19+20 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class U1, class U2&gt; tuple(pair&lt;U1, U2&gt;&amp;&amp; u);
  </pre>
  
  <blockquote>
*************** the second element with
*** 77688,77694 ****
  Change 20.4.2.4 [tuple.creation]/9-16 as indicated:
  </p>
  
! <blockquote><pre>template &lt;class... TTypes, class... UTypes&gt;
  tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre>
  
--- 88135,88142 ----
  Change 20.4.2.4 [tuple.creation]/9-16 as indicated:
  </p>
  
! <blockquote><pre>
! template &lt;class... TTypes, class... UTypes&gt;
  tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre>
  
*************** of <tt>u</tt>.
*** 77714,77720 ****
  </p>
  </blockquote>
  
! <pre>template &lt;class... TTypes, class... UTypes&gt;
  tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre>
  
--- 88162,88169 ----
  </p>
  </blockquote>
  
! <pre>
! template &lt;class... TTypes, class... UTypes&gt;
  tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre>
  
*************** corresponding elements of <tt>t</tt> and
*** 77745,77751 ****
  </p>
  </blockquote>
  
! <pre>template &lt;class... TTypes, class... UTypes&gt;
  tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp; t, tuple&lt;UTypes...&gt;&amp;&amp; u);
  </pre>
  
--- 88194,88201 ----
  </p>
  </blockquote>
  
! <pre>
! template &lt;class... TTypes, class... UTypes&gt;
  tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp; t, tuple&lt;UTypes...&gt;&amp;&amp; u);
  </pre>
  
*************** corresponding elements of <tt>t</tt> and
*** 77775,77781 ****
  </p>
  </blockquote>
  
! <pre>template &lt;class... TTypes, class... UTypes&gt;
  tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp; t, tuple&lt;UTypes...&gt;&amp;&amp; u);
  </pre>
  
--- 88225,88232 ----
  </p>
  </blockquote>
  
! <pre>
! template &lt;class... TTypes, class... UTypes&gt;
  tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp; t, tuple&lt;UTypes...&gt;&amp;&amp; u);
  </pre>
  
*************** corresponding elements of <tt>t</tt> and
*** 77814,77827 ****
  ]</i></p>
  
  
! <blockquote>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! 
  
  
  
--- 88265,88280 ----
  ]</i></p>
  
  
! <blockquote><p>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> 
! would solve this issue.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! </p>
  
  
  
*************** See <a href="http://www.open-std.org/jtc
*** 77829,77838 ****
  
  <hr>
  <h3><a name="1327"></a>1327. templates defined in <tt>&lt;cmath&gt;</tt> replacing C macros with the same name</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Michael Wong <b>Opened:</b> 2010-03-07 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 26.8 [c.math]p12
--- 88282,88292 ----
  
  <hr>
  <h3><a name="1327"></a>1327. templates defined in <tt>&lt;cmath&gt;</tt> replacing C macros with the same name</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Michael Wong <b>Opened:</b> 2010-03-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In 26.8 [c.math]p12
*************** The templates defined in <tt>&lt;cmath&g
*** 77840,77846 ****
  with the same names. The templates have the following declarations:
  </p>
  
! <blockquote><pre>namespace std {
  template &lt;class T&gt; bool signbit(T x);
  template &lt;class T&gt; int fpclassify(T x);
  template &lt;class T&gt; bool isfinite(T x);
--- 88294,88301 ----
  with the same names. The templates have the following declarations:
  </p>
  
! <blockquote><pre>
! namespace std {
  template &lt;class T&gt; bool signbit(T x);
  template &lt;class T&gt; int fpclassify(T x);
  template &lt;class T&gt; bool isfinite(T x);
*************** template &lt;class T&gt; bool isunordere
*** 77860,77870 ****
  and p13:
  </p>
  
! <blockquote>
  13 The templates behave the same as the C99 macros with corresponding
  names defined in C99 7.12.3, Classification macros, and C99 7.12.14,
  Comparison macros in the C standard.
! </blockquote>
  
  <p>
  The C Std versions look like this:
--- 88315,88325 ----
  and p13:
  </p>
  
! <blockquote><p>
  13 The templates behave the same as the C99 macros with corresponding
  names defined in C99 7.12.3, Classification macros, and C99 7.12.14,
  Comparison macros in the C standard.
! </p></blockquote>
  
  <p>
  The C Std versions look like this:
*************** Synopsis
*** 77881,77887 ****
  <p>
  1 <tt>#include &lt;math.h&gt;</tt>
  </p>
! <pre>int isgreaterequal(real-floating x, real-floating y);
  </pre>
  </blockquote>
  </blockquote>
--- 88336,88343 ----
  <p>
  1 <tt>#include &lt;math.h&gt;</tt>
  </p>
! <pre>
! int isgreaterequal(real-floating x, real-floating y);
  </pre>
  </blockquote>
  </blockquote>
*************** two-parameter macros is intended.
*** 77903,78011 ****
  ]</i></p>
  
  
! <blockquote>
  I recommend to resolve this issue as NAD Editorial because
  the accepted resolution for NB comment <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3162.html#US136">US-136</a>
  by motion 27 does address this.
! </blockquote>
  
  <p><i>[
  2010-09-14 Bill comments:
  ]</i></p>
  
  
! <blockquote>
  Motion 27 directly addresses LWG 1327 and solves the problem
  presented there. Moreover, the solution has been aired before
  WG14 with no dissent. These functions now behave the same for
  mixed-mode calls in both C and C++
! </blockquote>
! 
  
  
- <p><b>Proposed resolution:</b></p>
- Apply proposed resolution for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3162.html#US136">US-136</a>
  
  
  
  
  
  <hr>
! <h3><a name="1328"></a>1328. istream extractors not setting failbit if eofbit is already set</h3>
! <p><b>Section:</b> 27.7.1.1.3 [istream::sentry] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2010-02-17 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! basing on the recent discussion on the library reflector, see c++std-lib-27728
  and follow ups, I hereby formally ask for LWG 419 to be re-opened, the rationale
  being that according to the current specifications, per
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">n3000</a>,
  it seems actually impossible to seek away from end of file, contrary to the
! rationale which led <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#342">342</a> to its closure as NAD. My request is also
  supported by Martin Sebor, and I'd like also to add, as tentative proposed
  resolution for the re-opened issue, the wording suggested by Sebor, thus, change
! the beginning of 27.7.1.1.3 [istream::sentry]/2, to:
  </p>
  
! <blockquote>
  2 <i>Effects:</i> If <tt><ins>(!noskipws &amp;&amp; !</ins>is.good())</tt> is
  <tt><del>false</del> <ins>true</ins></tt>, calls <tt>is.setstate(failbit)</tt>.
  Otherwise prepares for formatted or unformatted input. ...
! </blockquote>
  
  <p><i>[
! 2010-10 Batavia"
  ]</i></p>
  
  <p>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a>.
  </p>
  
  <p>
  Previous proposed resolution:
! </p><p>
! Change 27.7.1.1.3 [istream::sentry]/2:
  </p>
  
! <blockquote>
  2 <i>Effects:</i> If <tt><ins>(!noskipws &amp;&amp; !</ins>is.good())</tt> is
  <tt><del>false</del> <ins>true</ins></tt>, calls <tt>is.setstate(failbit)</tt>.
  Otherwise prepares for formatted or unformatted input. ...
  </blockquote>
  
  
  
! <p></p>
  
  
  <p><b>Proposed resolution:</b></p>
! Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1333"></a>1333. Missing forwarding during std::function invocation</h3>
! <p><b>Section:</b> 20.8.14.2.4 [func.wrap.func.inv] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-03-26 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func.inv">issues</a> in [func.wrap.func.inv].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The current wording of 20.8.14.2.4 [func.wrap.func.inv]/1:
  </p>
  
! <blockquote><pre>R operator()(ArgTypes... args) const
  </pre>
  
! <blockquote>
  <i>Effects:</i> <tt><i>INVOKE</i>(f, t1, t2, ..., tN, R)</tt> (20.8.2), where
  <tt>f</tt> is the target object (20.8.1) of <tt>*this</tt> and <tt>t1, t2, ...,
  tN</tt> are the values in <tt>args...</tt>.
! </blockquote>
  </blockquote>
  
  <p>
--- 88359,88760 ----
  ]</i></p>
  
  
! <blockquote><p>
  I recommend to resolve this issue as NAD Editorial because
  the accepted resolution for NB comment <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3162.html#US136">US-136</a>
  by motion 27 does address this.
! </p></blockquote>
  
  <p><i>[
  2010-09-14 Bill comments:
  ]</i></p>
  
  
! <blockquote><p>
  Motion 27 directly addresses LWG 1327 and solves the problem
  presented there. Moreover, the solution has been aired before
  WG14 with no dissent. These functions now behave the same for
  mixed-mode calls in both C and C++
! </p></blockquote>
  
  
  
+ <p><b>Proposed resolution:</b></p><p>
+ Apply proposed resolution for 
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3162.html#US136">US-136</a>
+ </p>
  
  
  
  
  <hr>
! <h3><a name="1328"></a>1328. istream extractors not setting <tt>failbit</tt> if <tt>eofbit</tt> is already set</h3>
! <p><b>Section:</b> 27.7.2.1.3 [istream::sentry] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2010-02-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream::sentry">issues</a> in [istream::sentry].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! Basing on the recent discussion on the library reflector, see c++std-lib-27728
  and follow ups, I hereby formally ask for LWG 419 to be re-opened, the rationale
  being that according to the current specifications, per
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n3000.pdf">n3000</a>,
  it seems actually impossible to seek away from end of file, contrary to the
! rationale which led <a href="lwg-closed.html#342">342</a> to its closure as NAD. My request is also
  supported by Martin Sebor, and I'd like also to add, as tentative proposed
  resolution for the re-opened issue, the wording suggested by Sebor, thus, change
! the beginning of 27.7.2.1.3 [istream::sentry]/2, to:
  </p>
  
! <blockquote><p>
  2 <i>Effects:</i> If <tt><ins>(!noskipws &amp;&amp; !</ins>is.good())</tt> is
  <tt><del>false</del> <ins>true</ins></tt>, calls <tt>is.setstate(failbit)</tt>.
  Otherwise prepares for formatted or unformatted input. ...
! </p></blockquote>
  
  <p><i>[
! 2010-10 Batavia
  ]</i></p>
  
+ 
  <p>
! Resolved by adopting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a>.
  </p>
  
  <p>
  Previous proposed resolution:
! <p/>
! Change 27.7.2.1.3 [istream::sentry] p.2:
  </p>
  
! <blockquote><p>
  2 <i>Effects:</i> If <tt><ins>(!noskipws &amp;&amp; !</ins>is.good())</tt> is
  <tt><del>false</del> <ins>true</ins></tt>, calls <tt>is.setstate(failbit)</tt>.
  Otherwise prepares for formatted or unformatted input. ...
+ </p></blockquote>
+ 
+ 
+ <p><b>Proposed resolution:</b></p><p>
+ Addressed by paper 
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a>.
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1329"></a>1329. Data races on <code>vector&lt;bool&gt;</code></h3>
+ <p><b>Section:</b> 23.2.2 [container.requirements.dataraces] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Jeffrey Yaskin <b>Opened:</b> 2010-03-09 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#container.requirements.dataraces">issues</a> in [container.requirements.dataraces].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The common implementation of <tt>vector&lt;bool&gt;</tt> is as an
+ unsynchronized bitfield.  The addition of 23.2.2 [container.requirements.dataraces]/2 would require either a
+ change in representation or a change in access synchronization, both of
+ which are undesireable with respect to compatibility and performance.
+ </p>
+ 
+ <p><i>[
+ 2010 Pittsburgh:  Moved to <del>NAD Editorial</del><ins>Resolved</ins>. Rationale added below.
+ ]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Rationale:</b></p>
+ <p>
+ Solved by
+ <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3069.html">N3069</a>.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Container data races 23.2.2 [container.requirements.dataraces]
+ </p>
+ 
+ <p>
+ Paragraph 1 is unchanged as follows:
+ </p>
+ 
+ <blockquote><p>
+ 1 For purposes of avoiding data races (17.6.4.8), implementations shall
+ consider the following functions to be <code>const</code>:
+ <code>begin</code>, <code>end</code>, <code>rbegin</code>,
+ <code>rend</code>, <code>front</code>, <code>back</code>,
+ <code>data</code>, <code>find</code>, <code>lower_bound</code>,
+ <code>upper_bound</code>, <code>equal_range</code>, and, except in
+ associative containers, <code>operator[]</code>.
+ </p></blockquote>
+ 
+ <p>
+ Edit paragraph 2 as follows:
+ </p>
+ 
+ <blockquote><p>
+ 2 Notwithstanding (17.6.4.8), implementations are required to avoid data
+ races when the contents of the contained object in different elements in
+ the same sequence<ins>, excepting <code>vector&lt;bool&gt;</code>,</ins>
+ are modified concurrently.
+ </p></blockquote>
+ 
+ <p>
+ Edit paragraph 3 as follows:
+ </p>
+ 
+ <blockquote><p>
+ 3 [<i>Note:</i>
+ For a <code>vector&lt;int&gt; x</code> with a size greater than one,
+ <code>x[1] = 5</code> and <code>*x.begin() = 10</code>
+ can be executed concurrently without a data race,
+ but <code>x[0] = 5</code> and <code>*x.begin() = 10</code>
+ executed concurrently may result in a data race.
+ <ins>As an exception to the general rule,
+ for a <code>vector&lt;bool&gt; y</code>,
+ <code>y[i] = true</code> may race with <code>y[j] = true</code>.</ins>
+ &mdash;<i>end note</i>]
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1332"></a>1332. Let Hash objects throw!</h3>
+ <p><b>Section:</b> 17.6.3.4 [hash.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-03-26 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#hash.requirements">issues</a> in [hash.requirements].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ The currently added <tt>Hash</tt> requirements demand in Table 40 &mdash; <tt>Hash</tt>
+ requirements [hash]:
+ </p>
+ 
+ <blockquote>
+ <table border="1">
+ 
+ <caption>Table 40 &mdash; Hash requirements [hash]</caption>
+ 
+ <tr>
+ <th>Expression</th>
+ <th>Return type</th>
+ <th>Requirement</th>
+ </tr>
+ 
+ <tr>
+ <td><tt>h(k)</tt></td>
+ <td><tt>size_t</tt></td>
+ <td>Shall not throw exceptions. [..]</td>
+ </tr>
+ 
+ </table>
  </blockquote>
  
+ <p>
+ While it surely is a generally accepted idea that hash function objects
+ <i>should</i> not throw exceptions, this basic constraint for such a fundamental
+ requirement set does neither match the current library policy nor real world
+ cases:
+ </p>
  
+ <ol>
+ <li>
+ There are little known situations where a swap or move operation may throw an
+ exception and in some popular domains such functions are <em>required</em> not
+ to throw. But the library invested already efforts for good reasons to require
+ "working" container implementations in the presence of throwing move or swap
+ operations, see e.g. 23.2.4.1 [associative.reqmts.except], 23.2.5.1 [unord.req.except].
+ </li>
  
! <li>
! The container library is already specified to cope with potentially throwing
! comparers, predicates, <i>and</i> hash function objects, see above.
! </li>
! 
! <li>
! <p>
! The new definition goes beyond the original hash requirements as specified
! by SGI library in regard to the exception requirement:
! </p>
! <blockquote><p>
! <a href="http://www.sgi.com/tech/stl/HashFunction.html">http://www.sgi.com/tech/stl/HashFunction.html</a>
! </p></blockquote>
! </li>
! 
! <li>
! There are indeed real-world examples of potentially throwing hash functions,
! typically when the proxy pattern is used and when the to-be hashed proxied
! instance is some <i>volatile</i> object, e.g. a file or internet resource, that
! might suddenly be unavailable at the time of hashing.
! </li>
! 
! <li>
! With the new <tt>noexcept</tt> language facility libraries can still take
! advantage of no-throw guarantees of hasher functions with stricter guarantees.
! </li>
! </ol>
! 
! <p>
! Even though the majority of all known move, swap, and hash functions won't throw
! and in some cases <em>must</em> not throw, it seems like unnecessary
! over-constraining the definition of a Hash functor not to propagate exceptions
! in any case and it contradicts the general principle of C++ to impose such a
! requirement for this kind of fundamental requirement.
! </p>
! 
! <p><i>[
! 2010-11-11 Daniel asks the working group whether they would prefer a replacement
! for the second bullet of the proposed resolution (a result of discussing this
! with Alberto) of the form:
! ]</i></p>
! 
! 
! <p>
! Add to 20.9.13 [unord.hash]/1 a new bullet:
! </p>
! 
! <blockquote>
! <p>
! 1 The unordered associative containers defined in Clause 23.5 use
! specializations of the class template <tt>hash</tt>
! as the default hash function. For all object types <tt>Key</tt> for which there
! exists a specialization <tt>hash&lt;Key&gt;</tt>, the
! instantiation <tt>hash&lt;Key&gt;</tt> shall:
! </p>
! <ul>
! <li>
! satisfy the <tt>Hash</tt> requirements (20.2.4), with <tt>Key</tt> as the
! function call argument type, the <tt>DefaultConstructible</tt> requirements
! (33), the <tt>CopyAssignable</tt> requirements (37),
! </li>
! <li>
! be swappable (20.2.2) for lvalues,
! </li>
! <li>
! provide two nested types <tt>result_type</tt> and <tt>argument_type</tt> which
! shall be synonyms for <tt>size_t</tt> and <tt>Key</tt>, respectively,
! </li>
! <li>
! satisfy the requirement that if <tt>k1 == k2</tt> is true, <tt>h(k1) ==
! h(k2)</tt> is also true, where <tt>h</tt> is an object of type
! <tt>hash&lt;Key&gt;</tt> and <tt>k1</tt> and <tt>k2</tt> are objects of type
! <tt>Key</tt><ins>,</ins><del>.</del>
! </li>
! <li>
! <ins>satisfy the requirement <tt>noexcept(h(k)) == true</tt>, where <tt>h</tt> is an object
! of type <tt>hash&lt;Key&gt;</tt> and <tt>k</tt> is an object of type <tt>Key</tt>, unless 
! <tt>hash&lt;Key&gt;</tt> is a user-defined specialization that depends on at least one user-defined type.</ins>
! </li>
! </ul>
! </blockquote>
! 
! 
! 
! <p><i>[Batavia: Closed as NAD Future, then reopened. See the wiki for Tuesday.]</i></p>
  
  
  <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>
! Change Table 26 &mdash; <tt>Hash</tt> requirements [tab:hash] as indicated:
! </p>
! 
! <blockquote>
! <table border="1">
! 
! <caption>Table 26 &mdash; <tt>Hash</tt> requirements [tab:hash]</caption>
! 
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Requirement</th>
! </tr>
! 
! <tr>
! <td><tt>h(k)</tt></td>
! <td><tt>size_t</tt></td>
! <td><del>Shall not throw exceptions.</del> [&hellip;]</td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! 
! <li>
! <p>
! Add to 20.9.13 [unord.hash] p. 1 a new bullet:
! </p>
! 
! <blockquote>
! <p>
! 1 The unordered associative containers defined in Clause 23.5 [unord] use
! specializations of the class template <tt>hash</tt>
! as the default hash function. For all object types <tt>Key</tt> for which there
! exists a specialization <tt>hash&lt;Key&gt;</tt>, the
! instantiation <tt>hash&lt;Key&gt;</tt> shall:
! </p>
! <ul>
! <li>
! satisfy the <tt>Hash</tt> requirements ([hash.requirements]), with <tt>Key</tt> as the
! function call argument type, the <tt>DefaultConstructible</tt> requirements
! (Table [defaultconstructible]), the <tt>CopyAssignable</tt> requirements (Table [copyassignable]),
! </li>
! <li>
! be swappable ([swappable.requirements]) for lvalues,
! </li>
! <li>
! provide two nested types <tt>result_type</tt> and <tt>argument_type</tt> which
! shall be synonyms for <tt>size_t</tt> and <tt>Key</tt>, respectively,
! </li>
! <li>
! satisfy the requirement that if <tt>k1 == k2</tt> is true, <tt>h(k1) ==
! h(k2)</tt> is also true, where <tt>h</tt> is an object of type
! <tt>hash&lt;Key&gt;</tt> and <tt>k1</tt> and <tt>k2</tt> are objects of type
! <tt>Key</tt><ins>,</ins><del>.</del>
! </li>
! <li>
! <ins>satisfy the requirement that the expression <tt>h(k)</tt>, where <tt>h</tt>
! is an object of type <tt>hash&lt;Key&gt;</tt> and <tt>k</tt> is an object of
! type <tt>Key</tt>, shall not throw an exception, unless
! <tt>hash&lt;Key&gt;</tt> is a user-defined specialization that depends on at
! least one user-defined type.</ins>
! </li>
! </ul>
! </blockquote>
! </li>
! </ol>
! 
  
  
  
  
  
  <hr>
! <h3><a name="1333"></a>1333. Missing forwarding during <tt>std::function</tt> invocation</h3>
! <p><b>Section:</b> 20.9.12.2.4 [func.wrap.func.inv] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-03-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func.inv">issues</a> in [func.wrap.func.inv].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! The current wording of 20.9.12.2.4 [func.wrap.func.inv]/1:
  </p>
  
! <blockquote><pre>
! R operator()(ArgTypes... args) const
  </pre>
  
! <blockquote><p>
  <i>Effects:</i> <tt><i>INVOKE</i>(f, t1, t2, ..., tN, R)</tt> (20.8.2), where
  <tt>f</tt> is the target object (20.8.1) of <tt>*this</tt> and <tt>t1, t2, ...,
  tN</tt> are the values in <tt>args...</tt>.
! </p></blockquote>
  </blockquote>
  
  <p>
*************** Post-Rapperswil:
*** 78019,78027 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 88768,88776 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 78032,78041 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.8.14.2.4 [func.wrap.func.inv]/1+2 as indicated:
  </p>
  
! <blockquote><pre>R operator()(ArgTypes... args) const
  </pre>
  
  <blockquote>
--- 88781,88791 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 20.9.12.2.4 [func.wrap.func.inv]/1+2 as indicated:
  </p>
  
! <blockquote><pre>
! R operator()(ArgTypes... args) const
  </pre>
  
  <blockquote>
*************** exception thrown by the wrapped callable
*** 78067,78082 ****
  
  
  <hr>
! <h3><a name="1334"></a>1334. Insert iterators are broken for some proxy  containers compared to C++03</h3>
! <p><b>Section:</b> 24.5.2.2.2 [back.insert.iter.op=], 24.5.2.4.2 [front.insert.iter.op=], X [insert.insert.iter.op=] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-03-28 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In C++03 this was valid code:
  </p>
  
! <blockquote><pre>#include &lt;vector&gt;
  #include &lt;iterator&gt;
  
  int main() {
--- 88817,88833 ----
  
  
  <hr>
! <h3><a name="1334"></a>1334. Insert iterators are broken for some proxy containers compared to C++03</h3>
! <p><b>Section:</b> 24.5.2.2.2 [back.insert.iter.op=], 24.5.2.4.2 [front.insert.iter.op=], X [insert.insert.iter.op=] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-03-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In C++03 this was valid code:
  </p>
  
! <blockquote><pre>
! #include &lt;vector&gt;
  #include &lt;iterator&gt;
  
  int main() {
*************** In C++0x this code does no longer compil
*** 78092,78098 ****
  <tt>operator=</tt> overload pair:
  </p>
  
! <blockquote><pre>back_insert_iterator&lt;Container&gt;&amp;
  operator=(typename Container::const_reference value);
  
  back_insert_iterator&lt;Container&gt;&amp;
--- 88843,88850 ----
  <tt>operator=</tt> overload pair:
  </p>
  
! <blockquote><pre>
! back_insert_iterator&lt;Container&gt;&amp;
  operator=(typename Container::const_reference value);
  
  back_insert_iterator&lt;Container&gt;&amp;
*************** it's identical to <tt>Container::value_t
*** 78106,78112 ****
  overload pair
  </p>
  
! <blockquote><pre>back_insert_iterator&lt;Container&gt;&amp;
  operator=(bool value);
  
  back_insert_iterator&lt;Container&gt;&amp;
--- 88858,88865 ----
  overload pair
  </p>
  
! <blockquote><pre>
! back_insert_iterator&lt;Container&gt;&amp;
  operator=(bool value);
  
  back_insert_iterator&lt;Container&gt;&amp;
*************** container must not be the same as the <t
*** 78124,78130 ****
  earlier valid code. The alternative would be to change the first signature to
  </p>
  
! <blockquote><pre>back_insert_iterator&lt;Container&gt;&amp;
  operator=(const typename Container::const_reference&amp; value);
  </pre></blockquote>
  
--- 88877,88884 ----
  earlier valid code. The alternative would be to change the first signature to
  </p>
  
! <blockquote><pre>
! back_insert_iterator&lt;Container&gt;&amp;
  operator=(const typename Container::const_reference&amp; value);
  </pre></blockquote>
  
*************** Post-Rapperswil
*** 78145,78151 ****
  This problem is not restricted to the unspeakable <tt>vector&lt;bool&gt;</tt>, but is already existing for other proxy 
  containers like gcc's <tt>rope</tt> class. The following code does no longer work ([Bug libstdc++/44963]):
  </p>
! <blockquote><pre>#include &lt;iostream&gt;
  #include &lt;ext/rope&gt;
  
  using namespace std;
--- 88899,88906 ----
  This problem is not restricted to the unspeakable <tt>vector&lt;bool&gt;</tt>, but is already existing for other proxy 
  containers like gcc's <tt>rope</tt> class. The following code does no longer work ([Bug libstdc++/44963]):
  </p>
! <blockquote><pre>
! #include &lt;iostream&gt;
  #include &lt;ext/rope&gt;
  
  using namespace std;
*************** The following P/R is a revision of the o
*** 78170,78178 ****
  Hinnant. Paolo verified that the approach works in gcc.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready with revised wording after 6 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 88925,88933 ----
  Hinnant. Paolo verified that the approach works in gcc.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready with revised wording after 6 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 78186,78192 ****
  
  <ol>
  <li>Change [back.insert.iterator], class <tt>back_insert_iterator</tt> synopsis as indicated:
! <blockquote><pre>template &lt;class Container&gt;
  class back_insert_iterator :
   public iterator&lt;output_iterator_tag,void,void,void,void&gt; {
  protected:
--- 88941,88948 ----
  
  <ol>
  <li>Change [back.insert.iterator], class <tt>back_insert_iterator</tt> synopsis as indicated:
! <blockquote><pre>
! template &lt;class Container&gt;
  class back_insert_iterator :
   public iterator&lt;output_iterator_tag,void,void,void,void&gt; {
  protected:
*************** public:
*** 78202,78217 ****
  </pre></blockquote>
  </li>
  <li>Change [back.insert.iter.op=] before p. 1 as indicated:
! <blockquote><pre>back_insert_iterator&lt;Container&gt;&amp;
     operator=(<ins>const</ins> typename Container::<del>const_reference</del><ins>value_type&amp;</ins> value);
  </pre>
! <blockquote>
! 1 <em>Effects</em>: <tt>container-&gt;push_back(value)</tt>;<br>
  2 <em>Returns</em>: <tt>*this</tt>.
! </blockquote></blockquote>
  </li>
  <li>Change [front.insert.iterator], class <tt>front_insert_iterator</tt> synposis as indicated:
! <blockquote><pre>template &lt;class Container&gt;
  class front_insert_iterator :
   public iterator&lt;output_iterator_tag,void,void,void,void&gt; {
  protected:
--- 88958,88975 ----
  </pre></blockquote>
  </li>
  <li>Change [back.insert.iter.op=] before p. 1 as indicated:
! <blockquote><pre>
! back_insert_iterator&lt;Container&gt;&amp;
     operator=(<ins>const</ins> typename Container::<del>const_reference</del><ins>value_type&amp;</ins> value);
  </pre>
! <blockquote><p>
! 1 <em>Effects</em>: <tt>container-&gt;push_back(value)</tt>;<br/>
  2 <em>Returns</em>: <tt>*this</tt>.
! </p></blockquote></blockquote>
  </li>
  <li>Change [front.insert.iterator], class <tt>front_insert_iterator</tt> synposis as indicated:
! <blockquote><pre>
! template &lt;class Container&gt;
  class front_insert_iterator :
   public iterator&lt;output_iterator_tag,void,void,void,void&gt; {
  protected:
*************** public:
*** 78227,78242 ****
  </pre></blockquote>
  </li>
  <li>Change [front.insert.iter.op=] before p.1 as indicated:
! <blockquote><pre>front_insert_iterator&lt;Container&gt;&amp;
     operator=(<ins>const</ins> typename Container::<del>const_reference</del><ins>value_type&amp;</ins> value);
  </pre>
! <blockquote>
! 1 <em>Effects</em>: <tt>container-&gt;push_front(value)</tt>;<br>
  2 <em>Returns</em>: <tt>*this</tt>.
! </blockquote></blockquote>
  </li>
  <li>Change [insert.iterator], class insert_iterator synopsis as indicated:
! <blockquote><pre>template &lt;class Container&gt;
     class insert_iterator :
       public iterator&lt;output_iterator_tag,void,void,void,void&gt; {
     protected:
--- 88985,89002 ----
  </pre></blockquote>
  </li>
  <li>Change [front.insert.iter.op=] before p.1 as indicated:
! <blockquote><pre>
! front_insert_iterator&lt;Container&gt;&amp;
     operator=(<ins>const</ins> typename Container::<del>const_reference</del><ins>value_type&amp;</ins> value);
  </pre>
! <blockquote><p>
! 1 <em>Effects</em>: <tt>container-&gt;push_front(value)</tt>;<br/>
  2 <em>Returns</em>: <tt>*this</tt>.
! </p></blockquote></blockquote>
  </li>
  <li>Change [insert.iterator], class insert_iterator synopsis as indicated:
! <blockquote><pre>
! template &lt;class Container&gt;
     class insert_iterator :
       public iterator&lt;output_iterator_tag,void,void,void,void&gt; {
     protected:
*************** public:
*** 78253,78268 ****
  </pre></blockquote>
  </li>
  <li>Change [insert.iter.op=] before p. 1 as indicated:
! <blockquote><pre>insert_iterator&lt;Container&gt;&amp;
      operator=(<ins>const</ins> typename Container::<del>const_reference</del><ins>value_type&amp;</ins> value);
  </pre>
! <blockquote>
  1 <em>Effects</em>: 
! <blockquote><pre>  iter = container-&gt;insert(iter, value);
    ++iter;
! </pre></blockquote>
  2 <em>Returns</em>: <tt>*this</tt>.
! </blockquote></blockquote>
  </li>
  </ol>
  
--- 89013,89030 ----
  </pre></blockquote>
  </li>
  <li>Change [insert.iter.op=] before p. 1 as indicated:
! <blockquote><pre>
! insert_iterator&lt;Container&gt;&amp;
      operator=(<ins>const</ins> typename Container::<del>const_reference</del><ins>value_type&amp;</ins> value);
  </pre>
! <blockquote><p>
  1 <em>Effects</em>: 
! </p><blockquote><pre>
!   iter = container-&gt;insert(iter, value);
    ++iter;
! </pre></blockquote><p>
  2 <em>Returns</em>: <tt>*this</tt>.
! </p></blockquote></blockquote>
  </li>
  </ol>
  
*************** public:
*** 78273,78293 ****
  
  <hr>
  <h3><a name="1335"></a>1335. Insufficient requirements for <tt>tuple::operator&lt;()</tt></h3>
! <p><b>Section:</b> 20.4.2.7 [tuple.rel] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2010-05-15 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.rel">issues</a> in [tuple.rel].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirements section for <tt>std::tuple</tt> says the following: 
  </p>
  
! <blockquote>
  <i>Requires:</i> For all <tt>i</tt>, where <tt>0 &lt;= i and i &lt;
  sizeof...(Types)</tt>, <tt>get&lt;i&gt;(t) &lt; get&lt;i&gt;(u)</tt> is a valid
  expression returning a type that is convertible to <tt>bool</tt>.
  <tt>sizeof...(TTypes) == sizeof...(UTypes)</tt>.
! </blockquote>
  
  <p>
  This is necessary but not sufficient, as the algorithm for comparing
--- 89035,89056 ----
  
  <hr>
  <h3><a name="1335"></a>1335. Insufficient requirements for <tt>tuple::operator&lt;()</tt></h3>
! <p><b>Section:</b> 20.4.2.7 [tuple.rel] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2010-05-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#tuple.rel">active issues</a> in [tuple.rel].</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.rel">issues</a> in [tuple.rel].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The requirements section for <tt>std::tuple</tt> says the following: 
  </p>
  
! <blockquote><p>
  <i>Requires:</i> For all <tt>i</tt>, where <tt>0 &lt;= i and i &lt;
  sizeof...(Types)</tt>, <tt>get&lt;i&gt;(t) &lt; get&lt;i&gt;(u)</tt> is a valid
  expression returning a type that is convertible to <tt>bool</tt>.
  <tt>sizeof...(TTypes) == sizeof...(UTypes)</tt>.
! </p></blockquote>
  
  <p>
  This is necessary but not sufficient, as the algorithm for comparing
*************** Post-Rapperswil
*** 78300,78308 ****
  ]</i></p>
  
  
! <blockquote>
! Moved to Tentatively Ready with updated wording correcting change-bars after 6 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 89063,89072 ----
  ]</i></p>
  
  
! <blockquote><p>
! Moved to Tentatively Ready with updated wording correcting change-bars after 6 
! positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 78316,78330 ****
  <ol>
  <li>Change [tuple.rel] before p. 4 as indicated [<strong>Remark to the editor: This paragraph doesn't have a number yet,
  but it seems to me as if it should have one</strong>]:
! <blockquote><pre>template&lt;class... TTypes, class... UTypes&gt;
  bool operator&lt;(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre>
! <blockquote>
  <em>Requires</em>: For all <tt>i</tt>, where <tt>0 &lt;= i</tt> and <tt>i &lt; sizeof...(Types)</tt>, 
  <tt>get&lt;i&gt;(t) &lt; get&lt;i&gt;(u)</tt> <ins>and <tt>get&lt;i&gt;(u) &lt; get&lt;i&gt;(t)</tt></ins><del>is 
  a valid expression returning a type that is</del><ins> are valid expressions returning types that 
  are</ins> convertible to <tt>bool</tt>. <tt>sizeof...(TTypes) == sizeof...(UTypes)</tt>.
! </blockquote></blockquote>
  </li>
  </ol>
  
--- 89080,89095 ----
  <ol>
  <li>Change [tuple.rel] before p. 4 as indicated [<strong>Remark to the editor: This paragraph doesn't have a number yet,
  but it seems to me as if it should have one</strong>]:
! <blockquote><pre>
! template&lt;class... TTypes, class... UTypes&gt;
  bool operator&lt;(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);
  </pre>
! <blockquote><p>
  <em>Requires</em>: For all <tt>i</tt>, where <tt>0 &lt;= i</tt> and <tt>i &lt; sizeof...(Types)</tt>, 
  <tt>get&lt;i&gt;(t) &lt; get&lt;i&gt;(u)</tt> <ins>and <tt>get&lt;i&gt;(u) &lt; get&lt;i&gt;(t)</tt></ins><del>is 
  a valid expression returning a type that is</del><ins> are valid expressions returning types that 
  are</ins> convertible to <tt>bool</tt>. <tt>sizeof...(TTypes) == sizeof...(UTypes)</tt>.
! </p></blockquote></blockquote>
  </li>
  </ol>
  
*************** are</ins> convertible to <tt>bool</tt>.
*** 78335,78344 ****
  
  <hr>
  <h3><a name="1337"></a>1337. Swapped arguments in <tt>regex_traits::isctype</tt></h3>
! <p><b>Section:</b> 28.7 [re.traits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-06-21 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.traits">issues</a> in [re.traits].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  28.7 [re.traits]/12 describes <tt>regex_traits::isctype</tt> in terms
--- 89100,89109 ----
  
  <hr>
  <h3><a name="1337"></a>1337. Swapped arguments in <tt>regex_traits::isctype</tt></h3>
! <p><b>Section:</b> 28.7 [re.traits] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-06-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.traits">issues</a> in [re.traits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  28.7 [re.traits]/12 describes <tt>regex_traits::isctype</tt> in terms
*************** Post-Rapperswil:
*** 78352,78360 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 89117,89125 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 78365,78374 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 28.7 [re.traits]/12:
  </p>
  
! <blockquote><pre>bool isctype(charT c, char_class_type f) const;
  </pre>
  <blockquote>
  <p>
--- 89130,89140 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 28.7 [re.traits] p.12:
  </p>
  
! <blockquote><pre>
! bool isctype(charT c, char_class_type f) const;
  </pre>
  <blockquote>
  <p>
*************** getloc())</tt> returns <tt>true</tt>, ot
*** 78397,78414 ****
  
  <hr>
  <h3><a name="1338"></a>1338. LWG 1205 incorrectly applied</h3>
! <p><b>Section:</b> 25.2.13 [alg.search] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-06-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.search">issues</a> in [alg.search].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a> (currently in WP) clarified the return value of several
  algorithms when dealing with empty ranges.  In particular it recommended for
  25.2.13 [alg.search]:
  </p>
  
! <blockquote><pre>template&lt;class ForwardIterator1, class ForwardIterator2&gt;
    ForwardIterator1
      search(ForwardIterator1 first1, ForwardIterator1 last1,
             ForwardIterator2 first2, ForwardIterator2 last2);
--- 89163,89181 ----
  
  <hr>
  <h3><a name="1338"></a>1338. LWG 1205 incorrectly applied</h3>
! <p><b>Section:</b> 25.2.13 [alg.search] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-06-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.search">issues</a> in [alg.search].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! LWG <a href="lwg-defects.html#1205">1205</a> (currently in WP) clarified the return value of several
  algorithms when dealing with empty ranges.  In particular it recommended for
  25.2.13 [alg.search]:
  </p>
  
! <blockquote><pre>
! template&lt;class ForwardIterator1, class ForwardIterator2&gt;
    ForwardIterator1
      search(ForwardIterator1 first1, ForwardIterator1 last1,
             ForwardIterator2 first2, ForwardIterator2 last2);
*************** Unfortunately this got translated to an
*** 78438,78444 ****
  returned when no such iterator is found (N3092):
  </p>
  
! <blockquote><pre>template&lt;class ForwardIterator1, class ForwardIterator2&gt;
    ForwardIterator1
      search(ForwardIterator1 first1, ForwardIterator1 last1,
             ForwardIterator2 first2, ForwardIterator2 last2);
--- 89205,89212 ----
  returned when no such iterator is found (N3092):
  </p>
  
! <blockquote><pre>
! template&lt;class ForwardIterator1, class ForwardIterator2&gt;
    ForwardIterator1
      search(ForwardIterator1 first1, ForwardIterator1 last1,
             ForwardIterator2 first2, ForwardIterator2 last2);
*************** empty or if no such iterator is found.
*** 78462,78472 ****
  </blockquote>
  
  <p>
! LWG <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a> is correct and N3092 is not equivalent nor correct.
  </p>
  
  <p>
! I have not reviewed the other 10 recommendations of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1205">1205</a>.
  </p>
  
  <p><i>[
--- 89230,89240 ----
  </blockquote>
  
  <p>
! LWG <a href="lwg-defects.html#1205">1205</a> is correct and N3092 is not equivalent nor correct.
  </p>
  
  <p>
! I have not reviewed the other 10 recommendations of <a href="lwg-defects.html#1205">1205</a>.
  </p>
  
  <p><i>[
*************** Post-Rapperswil
*** 78474,78487 ****
  ]</i></p>
  
  
! <blockquote>
! It was verified that none of the remaining possibly affected algorithms does have any similar problems and a concrete P/R was added
! that used a similar style as has been applied to the other cases.
! </blockquote>
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 89242,89256 ----
  ]</i></p>
  
  
! <blockquote><p>
! It was verified that none of the remaining possibly affected algorithms does 
! have any similar problems and a concrete P/R was added that used a similar 
! style as has been applied to the other cases.
! </p></blockquote>
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 78492,78499 ****
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change [alg.search]/2 as indicated:
! <blockquote><pre>template&lt;class ForwardIterator1, class ForwardIterator2&gt;
    ForwardIterator1
      search(ForwardIterator1 first1, ForwardIterator1 last1,
             ForwardIterator2 first2, ForwardIterator2 last2);
--- 89261,89269 ----
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change [alg.search] p.2 as indicated:
! <blockquote><pre>
! template&lt;class ForwardIterator1, class ForwardIterator2&gt;
    ForwardIterator1
      search(ForwardIterator1 first1, ForwardIterator1 last1,
             ForwardIterator2 first2, ForwardIterator2 last2);
*************** template&lt;class ForwardIterator1, clas
*** 78507,78518 ****
  </pre>
  <blockquote><p>
  1 - [...]
! </p>
  2 - <em>Returns</em>: The first iterator <tt>i</tt> in the range <tt>[first1,last1 - (last2-first2))</tt> such that for any nonnegative
  integer <tt>n</tt> less than <tt>last2 - first2</tt> the following corresponding conditions hold: <tt>*(i + n) == *(first2 + n)</tt>, 
  <tt>pred(*(i + n), *(first2 + n)) != false</tt>. Returns <tt>first1</tt> if <tt>[first2,last2)</tt> is empty <del>or</del><ins>, otherwise
  	returns <tt>last1</tt></ins> if no such iterator is found.
! </blockquote></blockquote>
  </li>
  </ol>
  
--- 89277,89288 ----
  </pre>
  <blockquote><p>
  1 - [...]
! <p/>
  2 - <em>Returns</em>: The first iterator <tt>i</tt> in the range <tt>[first1,last1 - (last2-first2))</tt> such that for any nonnegative
  integer <tt>n</tt> less than <tt>last2 - first2</tt> the following corresponding conditions hold: <tt>*(i + n) == *(first2 + n)</tt>, 
  <tt>pred(*(i + n), *(first2 + n)) != false</tt>. Returns <tt>first1</tt> if <tt>[first2,last2)</tt> is empty <del>or</del><ins>, otherwise
  	returns <tt>last1</tt></ins> if no such iterator is found.
! </p></blockquote></blockquote>
  </li>
  </ol>
  
*************** integer <tt>n</tt> less than <tt>last2 -
*** 78522,78530 ****
  
  <hr>
  <h3><a name="1339"></a>1339. <tt>uninitialized_fill_n</tt> should return the end of its range</h3>
! <p><b>Section:</b> 20.9.8.4 [uninitialized.fill.n] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jared Hoberock <b>Opened:</b> 2010-07-14 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3092.pdf">N3092's</a>
--- 89292,89300 ----
  
  <hr>
  <h3><a name="1339"></a>1339. <tt>uninitialized_fill_n</tt> should return the end of its range</h3>
! <p><b>Section:</b> 20.7.12.4 [uninitialized.fill.n] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jared Hoberock <b>Opened:</b> 2010-07-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3092.pdf">N3092's</a>
*************** Post-Rapperswil:
*** 78544,78552 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 89314,89322 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 78557,78582 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In section 20.9 [memory] change:,
  </p>
  
! <blockquote><pre>template &lt;class ForwardIterator, class Size, class T&gt;
    <del>void</del> <ins>ForwardIterator</ins> uninitialized_fill_n(ForwardIterator first, Size n, const T&amp; x);
  </pre></blockquote>
  
  
  <p>
! In section 20.9.8.4 [uninitialized.fill.n] change,
  </p>
  
! <blockquote><pre>template &lt;class ForwardIterator, class Size, class T&gt;
    <del>void</del> <ins>ForwardIterator</ins> uninitialized_fill_n(ForwardIterator first, Size n, const T&amp; x);
  </pre>
  <blockquote>
  <p>
  1 <i>Effects:</i>
  </p>
! <blockquote><pre>for (; n--; ++first)
    ::new (static_cast&lt;void*&gt;(&amp;*first))
      typename iterator_traits&lt;ForwardIterator&gt;::value_type(x);
  <ins>return first;</ins>
--- 89327,89355 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>
! In section 20.7 [memory] change:,
  </p>
  
! <blockquote><pre>
! template &lt;class ForwardIterator, class Size, class T&gt;
    <del>void</del> <ins>ForwardIterator</ins> uninitialized_fill_n(ForwardIterator first, Size n, const T&amp; x);
  </pre></blockquote>
  
  
  <p>
! In section 20.7.12.4 [uninitialized.fill.n] change,
  </p>
  
! <blockquote><pre>
! template &lt;class ForwardIterator, class Size, class T&gt;
    <del>void</del> <ins>ForwardIterator</ins> uninitialized_fill_n(ForwardIterator first, Size n, const T&amp; x);
  </pre>
  <blockquote>
  <p>
  1 <i>Effects:</i>
  </p>
! <blockquote><pre>
! for (; n--; ++first)
    ::new (static_cast&lt;void*&gt;(&amp;*first))
      typename iterator_traits&lt;ForwardIterator&gt;::value_type(x);
  <ins>return first;</ins>
*************** In section 20.9.8.4 [uninitialized.fill.
*** 78591,78610 ****
  
  <hr>
  <h3><a name="1340"></a>1340. Why does <tt>forward_list::resize</tt> take the object to be copied by value?</h3>
! <p><b>Section:</b> 23.3.3.4 [forwardlist.modifiers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> 		
! James McNellis <b>Opened:</b> 2010-07-16 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#forwardlist.modifiers">issues</a> in [forwardlist.modifiers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3092.pdf">N3092</a>
! 23.3.3.4 [forwardlist.modifiers], the <tt>resize()</tt> member function is 
  declared as:
  </p>
  
! <blockquote><pre>void resize(size_type sz, value_type c); 
  </pre></blockquote>
  
  <p>
--- 89364,89383 ----
  
  <hr>
  <h3><a name="1340"></a>1340. Why does <tt>forward_list::resize</tt> take the object to be copied by value?</h3>
! <p><b>Section:</b> 23.3.4.5 [forwardlist.modifiers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> James McNellis <b>Opened:</b> 2010-07-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist.modifiers">issues</a> in [forwardlist.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  In
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3092.pdf">N3092</a>
! 23.3.4.5 [forwardlist.modifiers], the <tt>resize()</tt> member function is 
  declared as:
  </p>
  
! <blockquote><pre>
! void resize(size_type sz, value_type c); 
  </pre></blockquote>
  
  <p>
*************** Is there a reason for this difference?
*** 78617,78633 ****
  be declared as: 
  </p>
  
! <blockquote><pre>void resize(size_type sz, const value_type&amp; c); 
  </pre></blockquote>
  
  <p>
  The declaration would need to be changed both at its declaration in the class
! definition at 23.3.3 [forwardlist]/3 and where its behavior is specified
! at 23.3.3.4 [forwardlist.modifiers]/22.
  </p>
  
  <p>
! This would make <tt>forward_list</tt> consistent with the CD1 issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#679">679</a>.
  </p>
  
  <p><i>[
--- 89390,89407 ----
  be declared as: 
  </p>
  
! <blockquote><pre>
! void resize(size_type sz, const value_type&amp; c); 
  </pre></blockquote>
  
  <p>
  The declaration would need to be changed both at its declaration in the class
! definition at 23.3.4 [forwardlist]/3 and where its behavior is specified
! at 23.3.4.5 [forwardlist.modifiers]/22.
  </p>
  
  <p>
! This would make <tt>forward_list</tt> consistent with the CD1 issue <a href="lwg-defects.html#679">679</a>.
  </p>
  
  <p><i>[
*************** Post-Rapperswil
*** 78636,78650 ****
  
  
  <p>
! Daniel changed the P/R slightly, because one paragraph number has been changed since the issue
  had been submitted. He also added a similar Requires element that exists in all other containers with
  a <tt>resize</tt> member function. He deliberately did not touch the wrong usage of "default-constructed" because that
! will be taken care of by LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#868">868</a>.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready with revised wording after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 89410,89424 ----
  
  
  <p>
! Daniel changed the P&#47;R slightly, because one paragraph number has been changed since the issue
  had been submitted. He also added a similar Requires element that exists in all other containers with
  a <tt>resize</tt> member function. He deliberately did not touch the wrong usage of "default-constructed" because that
! will be taken care of by LWG issue <a href="lwg-defects.html#868">868</a>.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready with revised wording after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 78658,78664 ****
  
  <ol>
  <li>Change [forwardlist]/3, class template <tt>forward_list</tt> synopsis, as indicated:
! <blockquote><pre>...
  void resize(size_type sz);
  void resize(size_type sz, <ins>const</ins> value_type<ins>&amp;</ins> c);
  void clear();
--- 89432,89439 ----
  
  <ol>
  <li>Change [forwardlist]/3, class template <tt>forward_list</tt> synopsis, as indicated:
! <blockquote><pre>
! ...
  void resize(size_type sz);
  void resize(size_type sz, <ins>const</ins> value_type<ins>&amp;</ins> c);
  void clear();
*************** void clear();
*** 78670,78683 ****
  void resize(size_type sz);
  void resize(size_type sz, <ins>const</ins> value_type<ins>&amp;</ins> c);
  </pre>
! <blockquote>
  27 <em>Effects</em>: If <tt>sz &lt; distance(begin(), end())</tt>, erases the last <tt>distance(begin(), end()) - sz</tt> elements
  from the list. Otherwise, inserts <tt>sz - distance(begin(), end())</tt> elements at the end of the list. For the first 
  signature the inserted elements are default constructed, and for the second signature they are copies of <tt>c</tt>.
! <p>
  <ins>28 - <em>Requires</em>: <tt>T</tt> shall be <tt>DefaultConstructible</tt> for the first form and	it shall be <tt>CopyConstructible</tt> 
! 	for the second form.</ins></p>
! </blockquote></blockquote>
  </li>
  </ol>
  
--- 89445,89458 ----
  void resize(size_type sz);
  void resize(size_type sz, <ins>const</ins> value_type<ins>&amp;</ins> c);
  </pre>
! <blockquote><p>
  27 <em>Effects</em>: If <tt>sz &lt; distance(begin(), end())</tt>, erases the last <tt>distance(begin(), end()) - sz</tt> elements
  from the list. Otherwise, inserts <tt>sz - distance(begin(), end())</tt> elements at the end of the list. For the first 
  signature the inserted elements are default constructed, and for the second signature they are copies of <tt>c</tt>.
! <p/>
  <ins>28 - <em>Requires</em>: <tt>T</tt> shall be <tt>DefaultConstructible</tt> for the first form and	it shall be <tt>CopyConstructible</tt> 
! 	for the second form.</ins>
! </p></blockquote></blockquote>
  </li>
  </ol>
  
*************** signature the inserted elements are defa
*** 78687,78699 ****
  
  
  <hr>
! <h3><a name="1344"></a>1344. [FCD] Replace <tt>throw()</tt> with <tt>noexcept</tt></h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1351">1351</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-60, CH-16</b></p>
  <p>
--- 89462,89474 ----
  
  
  <hr>
! <h3><a name="1344"></a>1344. Replace <tt>throw()</tt> with <tt>noexcept</tt></h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1351">1351</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-60, CH-16</b></p>
  <p>
*************** of the form 'throw()' with the 'noexcept
*** 78717,78756 ****
  ]</i></p>
  
  
! <blockquote>
  The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3148.html">n3148</a>
  would satisfy this request.
! </blockquote>
  
  <p><i>[
  2010-Batavia:
  ]</i></p>
  
! <blockquote>
  Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3148.html">n3148</a>.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3148.html">n3148</a>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3150.html">n3150</a>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3195.html">n3195</a>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3155.html">n3155</a>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3156.html">n3156</a>
  
  
  
  
  
  <hr>
! <h3><a name="1346"></a>1346. [FCD] Apply <tt>noexcept</tt> where library specification does not permit exceptions</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1352">1352</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-62, CH-17</b></p>
  <p>
--- 89492,89597 ----
  ]</i></p>
  
  
! <blockquote><p>
  The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3148.html">n3148</a>
  would satisfy this request.
! </p></blockquote>
  
  <p><i>[
  2010-Batavia:
  ]</i></p>
  
! 
! <blockquote><p>
  Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3148.html">n3148</a>.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3148.html">n3148</a>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3150.html">n3150</a>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3195.htm">n3195</a>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3155.html">n3155</a>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3156.html">n3156</a>
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1345"></a>1345. Library classes should have <tt>noexcept</tt> move operations</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-61</b></p>
! <p>
! All library types should have non-throwing move
! constructors and move-assignment operators unless
! wrapping a type with a potentially throwing move operation.
! When such a type is a class-template, these
! operations should have a conditional <tt>noexcept</tt>
! specification.
! </p>
! <p>
! There are many other places where a <tt>noexcept</tt>
! specification may be considered, but the move operations
! are a special case that must be called out, to effectively
! support the <tt>move_if_noexcept</tt> function template.
! </p>
! 
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! 
! <p>
! Review every class and class template in the library. If <tt>noexcept</tt> 
! move constructor/assignment operators can be implicitly declared, then they
! should be implicitly declared, or explicitly defaulted. Otherwise, a move 
! constructor/move assignment operator with a <tt>noexcept</tt> exception
! specification should be provided.
! </p>
! 
! <p><i>[
! 2010-10-31 Daniel comments:
! ]</i></p>
! 
! 
! <blockquote><p>
! The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3157.html">n3157</a>
! would satisfy this request.
! </p></blockquote>
! 
! <p><i>[2011-03-24 Madrid meeting]</i></p>
! 
! 
! <p>Resolved by papers to be listed later</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3157.html">n3157</a>
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1346"></a>1346. Apply <tt>noexcept</tt> where library specification does not permit exceptions</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1352">1352</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-62, CH-17</b></p>
  <p>
*************** to construct programs taking advantage o
*** 78768,78773 ****
--- 89609,89615 ----
  Resolution proposed by ballot comment:
  ]</i></p>
  
+ 
  <p>
  Add a <tt>noexcept</tt> exception specification on each
  libary API that offers an unconditional <i>Throws</i>:
*************** constant expression exists.
*** 78782,78816 ****
  ]</i></p>
  
  
! <blockquote>
  The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3149.html">n3149</a>
  would satisfy this request.
! </blockquote>
  
  <p><i>[
  2010-Batavia:
  ]</i></p>
  
- <blockquote>
- Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3149.html">n3149</a>.
- </blockquote>
  
  
  
- <p><b>Proposed resolution:</b></p>
- This issue is resolved by the adoption of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3195.html">n3195</a>
  
  
  
  
  
  <hr>
! <h3><a name="1347"></a>1347. [FCD] Apply <tt>noexcept</tt> judiciously throughout the library</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-63, US-80</b></p>
  <p>
--- 89624,89659 ----
  ]</i></p>
  
  
! <blockquote><p>
  The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3149.html">n3149</a>
  would satisfy this request.
! </p></blockquote>
  
  <p><i>[
  2010-Batavia:
  ]</i></p>
  
  
+ <blockquote><p>
+ Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3149.html">n3149</a>.
+ </p></blockquote>
  
  
  
+ <p><b>Proposed resolution:</b></p><p>
+ This issue is resolved by the adoption of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3195.htm">n3195</a>
+ </p>
  
  
  
  
  <hr>
! <h3><a name="1347"></a>1347. Apply <tt>noexcept</tt> judiciously throughout the library</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-63, US-80</b></p>
  <p>
*************** efficiency.
*** 78828,78833 ****
--- 89671,89677 ----
  Resolution proposed by ballot comment
  ]</i></p>
  
+ 
  <p>
  Review the whole library, and apply the <tt>noexcept</tt>
  specification where it is appropriate.
*************** specification where it is appropriate.
*** 78838,78851 ****
  ]</i></p>
  
  
! <blockquote>
  The proposed resolution of the combination of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3155.html">n3155</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3156.html">n3156</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3157.html">n3157</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3167.html">n3167</a>
  would satisfy this request. The paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3150.html">n3150</a> is related
  to this as well.
! </blockquote>
  
  <p><i>[
  2010 Batavia:
--- 89682,89695 ----
  ]</i></p>
  
  
! <blockquote><p>
  The proposed resolution of the combination of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3155.html">n3155</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3156.html">n3156</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3157.html">n3157</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3167.html">n3167</a>
  would satisfy this request. The paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3150.html">n3150</a> is related
  to this as well.
! </p></blockquote>
  
  <p><i>[
  2010 Batavia:
*************** While the LWG expects to see further pap
*** 78857,78878 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3155.html">n3155</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3156.html">n3156</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3157.html">n3157</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3167.html">n3167</a> and remotely
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3150.html">n3150</a>
  
  
  
  
  
  <hr>
! <h3><a name="1354"></a>1354. [FCD] The definition of deadlock excludes cases involving a single thread</h3>
! <p><b>Section:</b> 17.3.8 [defns.deadlock] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-52</b></p>
  <p>
--- 89701,89899 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3155.html">n3155</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3156.html">n3156</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3157.html">n3157</a>,
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3167.html">n3167</a> and remotely
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3150.html">n3150</a>
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1349"></a>1349. <tt>swap</tt> should not throw</h3>
+ <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-65</b></p>
+ <p>
+ Nothrowing <tt>swap</tt> operations are key to many C++ idioms,
+ notably the common copy/swap idiom to provide the
+ strong exception safety guarantee.
+ </p>
+ 
+ <p><i>[
+ Resolution proposed by ballot comment
+ ]</i></p>
+ 
+ 
+ <p>
+ Where possible, all library types should provide a
+ <tt>swap</tt> operation with an exception specification
+ guaranteeing no exception shall propagate.
+ Where <tt>noexcept(true)</tt> cannot be guaranteed to
+ not terminate the program, and the <tt>swap</tt> in
+ questions is a template, an exception specification
+ with the appropriate conditional expression could
+ be specified.
+ </p>
+ 
+ <p><i>[2011-03-13: Daniel comments and drafts wording]</i></p>
+ 
+ 
+ <p>During a survey of the library some main categories for
+ potential <tt>noexcept</tt> <tt>swap</tt> function could be isolated:</p>
+ 
+ <ol>
+ <li>Free <tt>swap</tt> functions that are specified in terms of already
+ <tt>noexcept</tt> <tt>swap</tt> member functions, like that of <tt>valarray</tt>.</li>
+ 
+ <li>Free <tt>swap</tt> of <tt>std::function</tt>, and member and free <tt>swap</tt> 
+ functions of stream buffers and streams where considered but rejected as good candidates, 
+ because of the danger to potentially impose requirements of existing implementations. 
+ These functions could be reconsidered as candidates in the future.</li>
+ </ol>
+ 
+ <p>Negative list:</p>
+ 
+ <ol>
+ <li>Algorithms related to swap, like <tt>iter_swap</tt>, have <em>not</em> been touched,
+ because there are no fundamental exceptions constraints on iterator operations in general
+ (only for specific types, like library container iterators)</li>
+ </ol>
+ 
+ <p>While evaluating the current state of <tt>swap</tt> functions 
+ of library components it was observed that several conditional <tt>noexcept</tt>
+ functions have turned into unconditional ones, e.g. in the
+ header <tt>&lt;utility&gt;</tt> synopsis:</p>
+ 
+ <blockquote><pre>
+ template&lt;class T&gt; void swap(T&amp; a, T&amp; b) noexcept;
+ </pre></blockquote>
+ 
+ <p>The suggested resolution shown below also attempts to fix
+ these cases.</p>
+ 
+ <p><i>[2011-03-22 Daniel redrafts to satisfy new criteria for applying <tt>noexcept</tt>.
+ Parts resolved by N3263-v2 and D3267 are not added here.]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li><p>Edit 20.2 [utility] p. 2, header <tt>&lt;utility&gt;</tt> synopsis <em>and</em> 
+ 20.2.2 [utility.swap] before p. 1, as indicated (The intent is to fix an editorial
+ omission):</p>
+ 
+ <blockquote><pre>
+ template&lt;class T&gt; void swap(T&amp; a, T&amp; b) noexcept<ins>(<i>see below</i>)</ins>;
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>Edit the prototype declaration in 20.3.2 [pairs.pair] before p. 34 as indicated (The intent 
+ is to fix an editorial omission):</p>
+ 
+ <blockquote><pre>
+ void swap(pair&amp; p) noexcept<ins>(<i>see below</i>)</ins>;
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>Edit 20.4.1 [tuple.general] p. 2 header <tt>&lt;tuple&gt;</tt> synopsis <em>and</em> 
+ 20.4.2.9 [tuple.special] before p. 1 as indicated (The intent is to fix an editorial omission):</p>
+ 
+ <blockquote><pre>
+ template &lt;class... Types&gt;
+ void swap(tuple&lt;Types...&gt;&amp; x, tuple&lt;Types...&gt;&amp; y) noexcept<ins>(<i>see below</i>)</ins>;
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>Edit 20.4.2 [tuple.tuple], class template <tt>tuple</tt> synopsis <em>and</em>
+ 20.4.2.3 [tuple.swap] before p. 1 as indicated (The intent is to fix an editorial omission):</p>
+ 
+ <blockquote><pre>
+ void swap(tuple&amp;) noexcept<ins>(<i>see below</i>)</ins>;
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>Edit 20.7.2 [memory.syn] p. 1, header <tt>&lt;memory&gt;</tt> synopsis as indicated (The 
+ intent is to fix an editorial omission of the proposing paper N3195).</p>
+ 
+ <blockquote><pre>
+ template&lt;class T&gt; void swap(shared_ptr&lt;T&gt;&amp; a, shared_ptr&lt;T&gt;&amp; b) <ins>noexcept</ins>;
+ </pre></blockquote>
+ </li>
+ 
+ <li><p>Edit header <tt>&lt;valarray&gt;</tt> synopsis, 26.6.1 [valarray.syn] <em>and</em> 
+ 26.6.3.4 [valarray.special] before p. 1 as indicated 
+ <em>[Drafting comment: The corresponding member swap is already noexcept]</em>:</p>
+ 
+ <blockquote><pre>
+ template&lt;class T&gt; void swap(valarray&lt;T&gt;&amp;, valarray&lt;T&gt;&amp;) <ins>noexcept</ins>;
+ </pre></blockquote>
+ </li>
+ 
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="1353"></a>1353. Clarify the state of a <i>moved-from</i> object</h3>
! <p><b>Section:</b> 17 [library] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#library">active issues</a> in [library].</p>
! <p><b>View all other</b> <a href="lwg-index.html#library">issues</a> in [library].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses CH-18</b></p>
! <p>
! The general approach on moving is that a library object
! after moving out is in a "valid but unspecified state". But
! this is stated at the single object specifications, which is
! error prone (especially if the move operations are implicit)
! and unnecessary duplication.
! </p>
! 
! <p><i>[
! Resolution proposed by ballot comment
! ]</i></p>
! 
! <p>
! Consider putting a general statement to the same
! effect into clause 17.
! </p>
! 
! <p><i>[2010-11-05 Beman provides exact wording.
! The wording was inspired by Dave Abrahams'
! message c++std-lib-28958, and refined with help from Alisdair, Daniel, and Howard.
! ]</i></p>
! 
! 
! <p><i>[2011-02-25 P/R wording superseded by N3241.
! ]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3241.html">N3241</a></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1354"></a>1354. The definition of deadlock excludes cases involving a single thread</h3>
! <p><b>Section:</b> 17.3 [defns.deadlock] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-52</b></p>
  <p>
*************** Adopted at 2010-11 Batavia
*** 78901,78910 ****
  
  
  <p><b>Proposed resolution:</b></p>
- Change 17.3.8 [defns.deadlock] as indicated:
- <blockquote>
- <b>deadlock</b>
  <p>
  <del>two</del><ins>one</ins> or more threads are unable to continue execution because each is blocked waiting for one or more of the
  others to satisfy some condition.
  </p></blockquote>
--- 89922,89933 ----
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
+ Change 17.3 [defns.deadlock] as indicated:
+ </p>
+ <blockquote><p>
+ <b>deadlock</b>
+ <p/>
  <del>two</del><ins>one</ins> or more threads are unable to continue execution because each is blocked waiting for one or more of the
  others to satisfy some condition.
  </p></blockquote>
*************** others to satisfy some condition.
*** 78914,78923 ****
  
  
  <hr>
! <h3><a name="1355"></a>1355. [FCD] The definition of move-assignment operator is redundant</h3>
! <p><b>Section:</b> 17.3.16 [defns.move.assign.op] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-50</b></p>
  <p>
--- 89937,89946 ----
  
  
  <hr>
! <h3><a name="1355"></a>1355. The definition of move-assignment operator is redundant</h3>
! <p><b>Section:</b> X [defns.move.assign.op] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-50</b></p>
  <p>
*************** operator is defined by the core language
*** 78932,78964 ****
  ]</i></p>
  
  
! <blockquote>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> provides a superior resolution.
! </blockquote>
  
  <p><i>[
  Resolution proposed by ballot comment
  ]</i></p>
  
  <p>
! Strike subclause 17.3.16 [defns.move.assign.op].
  Add a cross-reference to (12.8) to 17.3.12.
  </p>
  
  
  
! <p><b>Proposed resolution:</b></p>
  Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1356"></a>1356. [FCD] The definition of move-constructor is redundant</h3>
! <p><b>Section:</b> 17.3.17 [defns.move.ctor] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-51</b></p>
  <p>
--- 89955,89988 ----
  ]</i></p>
  
  
! <blockquote><p>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> 
! provides a superior resolution.
! </p></blockquote>
  
  <p><i>[
  Resolution proposed by ballot comment
  ]</i></p>
  
  <p>
! Strike subclause X [defns.move.assign.op].
  Add a cross-reference to (12.8) to 17.3.12.
  </p>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1356"></a>1356. The definition of move-constructor is redundant</h3>
! <p><b>Section:</b> X [defns.move.ctor] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-51</b></p>
  <p>
*************** core language in subclause 12.8p3.
*** 78972,78980 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> provides a superior resolution.
! </blockquote>
  
  <p><i>[
  2010 Batavia: resolved as NAD Editorial by adopting paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
--- 89996,90004 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> provides a superior resolution.
! </p></blockquote>
  
  <p><i>[
  2010 Batavia: resolved as NAD Editorial by adopting paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
*************** Original proposed resolution preserved f
*** 78988,79014 ****
  Strike subclause 17.3.14, [defns.move.ctor]
  </p>
  
! <blockquote><del>
! <b>17.3.14	[defns.move.ctor]</b><br>
  move constructor a constructor which accepts only an rvalue argument of the type being constructed and might modify the argument as a side effect during construction.
! </del></blockquote>
  </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1357"></a>1357. [FCD] Library bitmask types to not satisfy the bimask type requirements</h3>
! <p><b>Section:</b> 17.5.2.1.3 [bitmask.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#bitmask.types">issues</a> in [bitmask.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-53</b></p>
  <p>
--- 90012,90038 ----
  Strike subclause 17.3.14, [defns.move.ctor]
  </p>
  
! <blockquote><p><del>
! <b>17.3.14	[defns.move.ctor]</b><br/>
  move constructor a constructor which accepts only an rvalue argument of the type being constructed and might modify the argument as a side effect during construction.
! </del></p></blockquote>
  </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1357"></a>1357. Library bitmask types to not satisfy the bimask type requirements</h3>
! <p><b>Section:</b> 17.5.2.1.3 [bitmask.types] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#bitmask.types">issues</a> in [bitmask.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-53</b></p>
  <p>
*************** that this paper will go forward at the n
*** 79038,79056 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3110.html">n3110</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1360"></a>1360. [FCD] Add <tt>&lt;atomic&gt;</tt> to free-standing implementations</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-57</b></p>
  <p>
--- 90062,90080 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3110.html">n3110</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1360"></a>1360. Add <tt>&lt;atomic&gt;</tt> to free-standing implementations</h3>
! <p><b>Section:</b> 17.6.1.3 [compliance] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#compliance">issues</a> in [compliance].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-57</b></p>
  <p>
*************** Resolved in Rapperswil by a motion to di
*** 79070,79093 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
  Add <tt>&lt;atomic&gt;</tt> to table 15, headers required for a
  free-standing implementation.
! 
  
  
  
  
  <hr>
! <h3><a name="1362"></a>1362. [FCD] Description of binding to rvalue-references should use the new 'xvalue' vocabulary</h3>
! <p><b>Section:</b> 17.6.3.9 [res.on.arguments] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#res.on.arguments">issues</a> in [res.on.arguments].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-82</b></p>
  <p>
! 17.6.3.9 [res.on.arguments] p.1. b.3: The second Note can benefit by adopting recent nomenclature.
  </p>
  
  
--- 90094,90117 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Add <tt>&lt;atomic&gt;</tt> to table 15, headers required for a
  free-standing implementation.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1362"></a>1362. Description of binding to rvalue-references should use the new 'xvalue' vocabulary</h3>
! <p><b>Section:</b> 17.6.4.9 [res.on.arguments] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#res.on.arguments">issues</a> in [res.on.arguments].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-82</b></p>
  <p>
! 17.6.4.9 [res.on.arguments] p.1. b.3: The second Note can benefit by adopting recent nomenclature.
  </p>
  
  
*************** Adopted at 2010-11 Batavia
*** 79120,79128 ****
  <p>
  Amend the note in 17.6.3.9 [res.on.arguments] p1 bullet 3.
  </p>
! <blockquote>
! [ <i>Note</i>: If a program casts an lvalue to an <del>rvalue</del><ins>xvalue</ins> while passing that lvalue to a library function (e.g. by calling the function with the argument <tt>move(x)</tt>), the program is effectively asking that function to treat that lvalue as a temporary. The implementation is free to optimize away aliasing checks which might be needed if the argument was anlvalue. <i>â€”endnote</i>]
! </blockquote>
  
  
  
--- 90144,90156 ----
  <p>
  Amend the note in 17.6.3.9 [res.on.arguments] p1 bullet 3.
  </p>
! <blockquote><p>
! [ <i>Note</i>: If a program casts an lvalue to an <del>rvalue</del><ins>xvalue</ins> while 
! passing that lvalue to a library function (e.g. by calling the function with the argument 
! <tt>move(x)</tt>), the program is effectively asking that function to treat that lvalue as 
! a temporary. The implementation is free to optimize away aliasing checks which might be 
! needed if the argument was anlvalue. &mdash; <i>end note</i>]
! </p></blockquote>
  
  
  
*************** Amend the note in 17.6.3.9 [res.on.argum
*** 79130,79142 ****
  
  
  <hr>
! <h3><a name="1363"></a>1363. [FCD] <tt>offsetof</tt> should be marked <tt>noexcept</tt></h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-68</b></p>
  <p>
  There is no reason for the offsetof macro to invoke
  potentially throwing operations, so the result of
--- 90158,90171 ----
  
  
  <hr>
! <h3><a name="1363"></a>1363. <tt>offsetof</tt> should be marked <tt>noexcept</tt></h3>
! <p><b>Section:</b> 18.2 [support.types] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.types">issues</a> in [support.types].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-68</b></p>
+ 
  <p>
  There is no reason for the offsetof macro to invoke
  potentially throwing operations, so the result of
*************** Resolved in Rapperswil by a motion to di
*** 79153,79174 ****
  
  <p><b>Proposed resolution:</b></p>
  <p>Add to the end of 18.2p4:</p>
! <blockquote><ins>
  No operation invoked by the offsetof macro shall
  throw an exception, and
  <tt>noexcept(offsetof(type,member-designator))</tt> shall
  be true.</ins>
  </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1365"></a>1365. [FCD] Thread-safety of handler functions</h3>
! <p><b>Section:</b> 18.6.2 [alloc.errors] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-71</b></p>
  <p>
--- 90182,90249 ----
  
  <p><b>Proposed resolution:</b></p>
  <p>Add to the end of 18.2p4:</p>
! <blockquote><p><ins>
  No operation invoked by the offsetof macro shall
  throw an exception, and
  <tt>noexcept(offsetof(type,member-designator))</tt> shall
  be true.</ins>
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1364"></a>1364. It is not clear how <tt>exception_ptr</tt> is synchronized</h3>
+ <p><b>Section:</b> 18.8.5 [propagation] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#propagation">issues</a> in [propagation].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses CH-19</b></p>
+ <p>
+ It is not clear how <tt>exception_ptr</tt> is synchronized.
+ </p>
+ 
+ <p><i>[
+ Resolution proposed by ballot comment
+ ]</i></p>
+ 
+ <p>
+ Make clear that accessing in different threads
+ multiple <tt>exception_ptr</tt> objects that all refer to the
+ same exception introduce a race.
+ </p>
+ 
+ <p><i>[2011-03-08: Lawrence comments and drafts wording]</i></p>
+ 
+ 
+ <p>I think fundamentally, this issue is NAD, but clarification would not hurt.</p>
+ 
+ <blockquote>
+ <p>Proposed resolution</p>
+ <p>Add a new paragraph to 18.8.5 [propagation] after paragraph 6 as follows:</p>
+ 
+ <p><ins>
+ [<i>Note:</i> Exception objects have no synchronization requirements, and expressions 
+ using them may conflict (1.10 [intro.multithread]). &mdash; <i>end note</i>]
+ </ins></p>
  </blockquote>
  
  
  
+ <p><b>Proposed resolution:</b></p><p>
+ Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
+ </p>
+ 
+ 
  
  
  <hr>
! <h3><a name="1365"></a>1365. Thread-safety of handler functions</h3>
! <p><b>Section:</b> 18.6.2 [alloc.errors] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-71</b></p>
  <p>
*************** safe manner.
*** 79182,79227 ****
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  The thread safety guarantees for the functions
  must be specified and new interfaces should be
  provided to make it possible to query and install
  handlers in a thread safe way.
! </blockquote>
  
  <p><i>[
  2010-10-31 Daniel comments:
  ]</i></p>
  
  
! <blockquote>
  The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3122.html">n3122</a>
! partially addresses this request. This issue is related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1366">1366</a>.
! </blockquote>
  
  
  <p><i>[
  2010-Batavia:
  ]</i></p>
  
! <blockquote>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3189.html">n3189</a>.
! </blockquote>
! 
  
  
- <p><b>Proposed resolution:</b></p>
- Resolved in Batavia by accepting  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3189.html">n3189</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1366"></a>1366. [FCD] New-handler and data races</h3>
! <p><b>Section:</b> 18.6.1.4 [new.delete.dataraces] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-14</b></p>
  <p>
--- 90257,90303 ----
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  The thread safety guarantees for the functions
  must be specified and new interfaces should be
  provided to make it possible to query and install
  handlers in a thread safe way.
! </p></blockquote>
  
  <p><i>[
  2010-10-31 Daniel comments:
  ]</i></p>
  
  
! <blockquote><p>
  The proposed resolution of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3122.html">n3122</a>
! partially addresses this request. This issue is related to <a href="lwg-defects.html#1366">1366</a>.
! </p></blockquote>
  
  
  <p><i>[
  2010-Batavia:
  ]</i></p>
  
! <blockquote><p>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3189.htm">n3189</a>.
! </p></blockquote>
  
  
  
+ <p><b>Proposed resolution:</b></p><p>
+ Resolved in Batavia by accepting  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3189.htm">n3189</a>.
+ </p>
  
  
  
  
  <hr>
! <h3><a name="1366"></a>1366. New-handler and data races</h3>
! <p><b>Section:</b> 18.6.1.4 [new.delete.dataraces] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete.dataraces">issues</a> in [new.delete.dataraces].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-14</b></p>
  <p>
*************** Offer a non-mutating interface to query
*** 79245,79277 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3122.html">n3122</a> would solve this issue.
! This issue is related to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1365">1365</a>.
! </blockquote>
  
  <p><i>[
  2010-Batavia:
  ]</i></p>
  
! <blockquote>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3189.html">n3189</a>.
! </blockquote>
! 
  
  
- <p><b>Proposed resolution:</b></p>
- Resolved in Batavia by accepting  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3189.html">n3189</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1367"></a>1367. [FCD] Deprecate library support for checking dynamic exception specifications</h3>
! <p><b>Section:</b> D.13 [exception.unexpected] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-72</b></p>
  <p>
--- 90321,90353 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3122.html">n3122</a> would solve this issue.
! This issue is related to <a href="lwg-defects.html#1365">1365</a>.
! </p></blockquote>
  
  <p><i>[
  2010-Batavia:
  ]</i></p>
  
! <blockquote><p>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3189.htm">n3189</a>.
! </p></blockquote>
  
  
  
+ <p><b>Proposed resolution:</b></p><p>
+ Resolved in Batavia by accepting  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3189.htm">n3189</a>.
+ </p>
  
  
  
  
  <hr>
! <h3><a name="1367"></a>1367. Deprecate library support for checking dynamic exception specifications</h3>
! <p><b>Section:</b> D.8 [exception.unexpected] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-72</b></p>
  <p>
*************** Resolved in Rapperswil by a motion to di
*** 79290,79310 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
  With the exception of 18.8.2.1 [bad.exception],
! move clause 18.8.2 diectly to Annex D.
  [bad.exception] should simply become the new
  18.8.2.
! 
  
  
  
  
  <hr>
! <h3><a name="1368"></a>1368. [FCD] Thread safety of <tt>std::uncaught_exception()</tt></h3>
! <p><b>Section:</b> 18.8.4 [uncaught] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-73</b></p>
  <p>
--- 90366,90386 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  With the exception of 18.8.2.1 [bad.exception],
! move clause 18.8.2 directly to Annex D.
  [bad.exception] should simply become the new
  18.8.2.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1368"></a>1368. Thread safety of <tt>std::uncaught_exception()</tt></h3>
! <p><b>Section:</b> X [uncaught] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-73</b></p>
  <p>
*************** Adopted at 2010-11 Batavia
*** 79338,79348 ****
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 18.8.4 [uncaught] p. 1 as follows:</p>
  <p>
  <i>Returns</i>: <tt>true</tt> after <ins> the current thread has initialized </ins><del>initializing</del>
   an exception object (15.1) until a handler for the exception (including <tt>unexpected()</tt> or <tt>terminate()</tt>) 
!  is activated (15.3). [ <i>Note</i>: This includes stack unwinding (15.2). — <i>end note</i> ]
  </p>
  
  
--- 90414,90424 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change X [uncaught] p. 1 as follows:</p>
  <p>
  <i>Returns</i>: <tt>true</tt> after <ins> the current thread has initialized </ins><del>initializing</del>
   an exception object (15.1) until a handler for the exception (including <tt>unexpected()</tt> or <tt>terminate()</tt>) 
!  is activated (15.3). [ <i>Note</i>: This includes stack unwinding (15.2). &mdash; <i>end note</i> ]
  </p>
  
  
*************** Adopted at 2010-11 Batavia
*** 79351,79361 ****
  
  
  <hr>
! <h3><a name="1370"></a>1370. [FCD] <tt>throw_with_nested</tt> should not use perfect forwarding</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-84</b></p>
  <p>
--- 90427,90438 ----
  
  
  <hr>
! <h3><a name="1370"></a>1370. <tt>throw_with_nested</tt> should not use perfect forwarding</h3>
! <p><b>Section:</b> 18.8.6 [except.nested] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#except.nested">active issues</a> in [except.nested].</p>
! <p><b>View all other</b> <a href="lwg-index.html#except.nested">issues</a> in [except.nested].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-84</b></p>
  <p>
*************** requirements on <tt>T</tt> and the use o
*** 79381,79389 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3144.html">n3144</a> would solve this issue.
! </blockquote>
  
  <p><i>[2010-11-10 Batavia: LWG accepts Howard's updated wording with
  corrected boo boos reported by Sebastian Gesemann and Pete Becker,
--- 90458,90466 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3144.html">n3144</a> would solve this issue.
! </p></blockquote>
  
  <p><i>[2010-11-10 Batavia: LWG accepts Howard's updated wording with
  corrected boo boos reported by Sebastian Gesemann and Pete Becker,
*************** Adopted at 2010-11 Batavia
*** 79420,79431 ****
  
  
  <hr>
! <h3><a name="1372"></a>1372. [FCD] Adopt recommended practice for standard error categories</h3>
! <p><b>Section:</b> 19.5.1.5 [syserr.errcat.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-76</b></p>
  <p>
  The C++0x FCD recommends, in a note (see 19.5.1.1/1), that users
  create a single <tt>error_category</tt> object for each user defined error
--- 90497,90509 ----
  
  
  <hr>
! <h3><a name="1372"></a>1372. Adopt recommended practice for standard error categories</h3>
! <p><b>Section:</b> 19.5.1.5 [syserr.errcat.objects] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-76</b></p>
+ 
  <p>
  The C++0x FCD recommends, in a note (see 19.5.1.1/1), that users
  create a single <tt>error_category</tt> object for each user defined error
*************** Resolved in Rapperswil by a motion to di
*** 79447,79466 ****
  Append a new sentence to 19.5.1.5 [syserr.errcat.objects]/1, and append
  the same sentence to 19.5.1.5/3.
  </p>
! <blockquote><ins>
  All calls of this function return references to the same object.
! </ins></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1377"></a>1377. [FCD] The revised <tt>forward</tt> is not compatible with access-control</h3>
! <p><b>Section:</b> 20.3 [utility] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#utility">issues</a> in [utility].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-90</b></p>
  <p>
--- 90525,90545 ----
  Append a new sentence to 19.5.1.5 [syserr.errcat.objects]/1, and append
  the same sentence to 19.5.1.5/3.
  </p>
! <blockquote><p><ins>
  All calls of this function return references to the same object.
! </ins></p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1377"></a>1377. The revised <tt>forward</tt> is not compatible with access-control</h3>
! <p><b>Section:</b> 20.2 [utility] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#utility">active issues</a> in [utility].</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility">issues</a> in [utility].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-90</b></p>
  <p>
*************** compile time failure, whereas that was n
*** 79474,79480 ****
  implementation along the lines of n2835 (using <tt>enable_if</tt>s
  instead of concepts for the constraining, of course)
  </p>
! <pre>#include &lt;utility&gt;
  struct Base { Base(Base&amp;&amp;); };
  
  struct Derived
--- 90553,90560 ----
  implementation along the lines of n2835 (using <tt>enable_if</tt>s
  instead of concepts for the constraining, of course)
  </p>
! <pre>
! #include &lt;utility&gt;
  struct Base { Base(Base&amp;&amp;); };
  
  struct Derived
*************** way, the present status is not acceptabl
*** 79494,79525 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3143.html">n3143</a> would solve this issue.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  Resolved as NAD Editorial by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3143.html">n3143</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1378"></a>1378. [FCD] <tt>pair</tt> and <tt>tuple</tt> have too many conversions</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-15</b></p>
  <p>
  Several function templates of <tt>pair</tt> and <tt>tuple</tt> allow for too
  many implicit conversions, for example:
  </p>
! <pre>#include &lt;tuple&gt;
  std::tuple&lt;char*&gt; p(0); // Error?
  
  struct A { explicit A(int){} };
--- 90574,90606 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3143.html">n3143</a> would solve this issue.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Resolved as NAD Editorial by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3143.html">n3143</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1378"></a>1378. <tt>pair</tt> and <tt>tuple</tt> have too many conversions</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-15</b></p>
  <p>
  Several function templates of <tt>pair</tt> and <tt>tuple</tt> allow for too
  many implicit conversions, for example:
  </p>
! <pre>
! #include &lt;tuple&gt;
  std::tuple&lt;char*&gt; p(0); // Error?
  
  struct A { explicit A(int){} };
*************** Consider to add wording to constrain the
*** 79540,79565 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue.
! </blockquote>
  
  
  
  
! <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1379"></a>1379. [FCD] <tt>pair</tt> copy-assignment not consistent for references</h3>
! <p><b>Section:</b> 20.3.5.2 [pairs.pair] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs.pair">issues</a> in [pairs.pair].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-95</b></p>
  <p>
--- 90621,90646 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue.
! </p></blockquote>
  
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1379"></a>1379. <tt>pair</tt> copy-assignment not consistent for references</h3>
! <p><b>Section:</b> 20.3.2 [pairs.pair] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs.pair">issues</a> in [pairs.pair].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-95</b></p>
  <p>
*************** with <tt>tuple</tt>'s assignment operato
*** 79577,79586 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would provide a superior resolution,
  because <tt>pair</tt> does not depend on the semantic requirements of <tt>CopyAssignable</tt>.
! </blockquote>
  
  <p><i>[
  2010-11 Batavia
--- 90658,90667 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would provide a superior resolution,
  because <tt>pair</tt> does not depend on the semantic requirements of <tt>CopyAssignable</tt>.
! </p></blockquote>
  
  <p><i>[
  2010-11 Batavia
*************** Resolved by adopting <a href="http://www
*** 79593,79608 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add to <tt>pair</tt> synopsis:
! <blockquote>
  <tt>pair&amp; operator=(const pair&amp; p);</tt>
! </blockquote>
  <p>
  Add before paragraph 9:
  </p>
! <blockquote>
  <tt>pair&amp; operator=(const pair&amp; p);</tt>
! <blockquote>
  <p>
  <i>Requires</i>: <tt>T1</tt> and <tt>T2</tt> shall satisfy the
  requirements of <tt>CopyAssignable</tt>.
--- 90674,90689 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add to <tt>pair</tt> synopsis:</p>
! <blockquote><p>
  <tt>pair&amp; operator=(const pair&amp; p);</tt>
! </p></blockquote>
  <p>
  Add before paragraph 9:
  </p>
! <blockquote><p>
  <tt>pair&amp; operator=(const pair&amp; p);</tt>
! </p><blockquote>
  <p>
  <i>Requires</i>: <tt>T1</tt> and <tt>T2</tt> shall satisfy the
  requirements of <tt>CopyAssignable</tt>.
*************** requirements of <tt>CopyAssignable</tt>.
*** 79620,79630 ****
  
  
  <hr>
! <h3><a name="1380"></a>1380. [FCD] <tt>pair</tt> and <tt>tuple</tt> of references need to better specify move-semantics</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-16</b></p>
  <p>
--- 90701,90711 ----
  
  
  <hr>
! <h3><a name="1380"></a>1380. <tt>pair</tt> and <tt>tuple</tt> of references need to better specify move-semantics</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-16</b></p>
  <p>
*************** Replace the usage of <tt>std::move</tt>
*** 79652,79684 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue.
! </blockquote>
  
  <p><i>[
  2010-11 Batavia:
  ]</i></p>
  
  
! <blockquote>
  Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1381"></a>1381. [FCD] Ballot Comment GB-85</h3>
! <p><b>Section:</b> X [pair.range] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-85</b></p>
  <p>
--- 90733,90765 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue.
! </p></blockquote>
  
  <p><i>[
  2010-11 Batavia:
  ]</i></p>
  
  
! <blockquote><p>
  Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1381"></a>1381. Replace <tt>pair</tt>'s range support by proper range facility</h3>
! <p><b>Section:</b> X [pair.range] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-85</b></p>
  <p>
*************** existing type with a different semantic.
*** 79691,79698 ****
  </p>
  
  <p>
! If a replacement facility is required for C++0x,
! consider n2995.
  </p>
  
  <p><i>[
--- 90772,90778 ----
  </p>
  
  <p>
! If a replacement facility is required for C++0x, consider n2995.
  </p>
  
  <p><i>[
*************** Resolved in Rapperswil by a motion to di
*** 79702,79721 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
! Strike 20.3.5.4 and the matching declarations in
! 20.3 header synopsis.
! 
  
  
  
  
  <hr>
! <h3><a name="1382"></a>1382. [FCD] <tt>pair</tt> and <tt>tuple</tt> constructors should <tt>forward</tt> arguments</h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-96</b></p>
  <p>
--- 90782,90800 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
! Strike 20.3.5.4 and the matching declarations in 20.3 header synopsis.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1382"></a>1382. <tt>pair</tt> and <tt>tuple</tt> constructors should <tt>forward</tt> arguments</h3>
! <p><b>Section:</b> 20.3 [pairs] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-96</b></p>
  <p>
*************** wrong.
*** 79730,79747 ****
  Resolution proposed by ballot comment
  ]</i></p>
  
! <blockquote>
  See Appendix 1 - Additional Details
! </blockquote>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue.
! </blockquote>
  
  <p><i>[
  2010-11 Batavia
--- 90809,90826 ----
  Resolution proposed by ballot comment
  ]</i></p>
  
! <blockquote><p>
  See Appendix 1 - Additional Details
! </p></blockquote>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue.
! </p></blockquote>
  
  <p><i>[
  2010-11 Batavia
*************** Resolved by adopting <a href="http://www
*** 79753,79871 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1383"></a>1383. [FCD] Inconsistent defaulted move/copy members in <tt>pair</tt> and <tt>tuple</tt></h3>
! <p><b>Section:</b> 20.3.5 [pairs] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-97</b></p>
  <p>
! <tt>pair</tt>'s class definition in N3092 20.3.5.2 [pairs.pair]
  contains "<tt>pair(const pair&amp;) = default;</tt>" and 
  "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>". The latter is described by
! 20.3.5.2 [pairs.pair] p.12-13.
! </p>
  "<tt>pair(const pair&amp;) = default;</tt>" is a user-declared explicitly defaulted
! copy constructor. According to 12.8 [class.copy]/10, this inhibits 
  the implicitly-declared move constructor. <tt>pair</tt> should be move constructible. 
! (12.8 [class.copy]/7 explains that "<tt>pair(pair&lt;U, V&gt;&amp;&amp; p)</tt>" 
! will never be instantiated to move <tt>pair&lt;T1, T2&gt;</tt> to <tt>pair&lt;T1, T2&gt;</tt>.)<br>
  "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>" is a user-provided move
! assignment operator (according to 8.4.2 [dcl.fct.def.default]/4: "A 
  special member function is user-provided if it is user-declared and not explicitly defaulted
! on its first declaration."). According to 12.8 [class.copy]/20, this inhibits
  the implicitly-declared copy assignment operator. <tt>pair</tt>
! should be copy assignable, and was in C++98/03. (Again,
! 12.8 [class.copy]/7 explains that "<tt>operator=(const pair&lt;U, V&gt;&amp; p)</tt>" 
! will never be instantiated to copy <tt>pair&lt;T1, T2&gt;</tt> to <tt>pair&lt;T1, T2&gt;</tt>.)<br>
  Additionally, "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>" is
! unconditionally defined, whereas according to 12.8 [class.copy]/25,
! defaulted copy/move assignment operators are defined as
  deleted in several situations, such as when non-static data
  members of reference type are present.
! <p>
  If "<tt>pair(const pair&amp;) = default;</tt>" and "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>" 
! were removed from <tt>pair</tt>'s class definition in 20.3.5.2 [pairs.pair] and from 
! 20.3.5.2 [pairs.pair]/12-13, <tt>pair</tt> would
! receive implicitly-declared copy/move constructors and
! copy/move assignment operators, and 12.8 [class.copy]/25 would
! apply. The implicitly-declared copy/move constructors
! would be trivial when <tt>T1</tt> and <tt>T2</tt> have trivial copy/move
! constructors, according to 12.8 [class.copy]/13, and similarly for the
! assignment operators, according to12.8 [class.copy]/27. Notes could
  be added as a reminder that these functions would be
  implicitly-declared, but such notes would not be necessary
  (the Standard Library specification already assumes a
  high level of familiarity with the Core Language, and
  casual readers will simply assume that <tt>pair</tt> is copyable
  and movable).
! </p><p>
  Alternatively, <tt>pair</tt> could be given explicitly-defaulted
! copy/move constructors and copy/move assignment
  operators. This is a matter of style.
! </p><p>
  <tt>tuple</tt> is also affected. <tt>tuple</tt>'s class definition in 20.4 [tuple] contains:
! </p><pre>tuple(const tuple&amp;) = default;
  tuple(tuple&amp;&amp;);
  tuple&amp; operator=(const tuple&amp;);
  tuple&amp; operator=(tuple&amp;&amp;);
  </pre>
  They should all be removed or all be explicitly-defaulted,
! to be consistent with <tt>pair</tt>. Additionally, 20.4.2.1 [tuple.cnstr]/8-9 specifies the 
  behavior of an explicitly defaulted function, which is currently inconsistent with
  <tt>pair</tt>.
! 
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  Either remove "<tt>pair(const pair&amp;) = default;</tt>" and
  "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>" from <tt>pair</tt>'s class
! definition in  20.3.5.2 [pairs.pair] and from  20.3.5.2 [pairs.pair] p.12-13, or
! give pair explicitly-defaulted copy/move constructors and copy/move assignment operators.<br>
  Change <tt>tuple</tt> to match.
! </blockquote>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue:
! The move/copy constructor will be defaulted, but the corresponding assignment operators need a non-default implementation
  because they are supposed to work for references as well.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1384"></a>1384. [FCD] Ballot Comment US-98</h3>
! <p><b>Section:</b> 20.4.2.4 [tuple.creation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-98</b></p>
  <p>
! pack_arguments is poorly named. It does not reflect the
  fact that it is a tuple creation function and that it forwards
  arguments.
  </p>
--- 90832,90953 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1383"></a>1383. Inconsistent defaulted move&#47;copy members in <tt>pair</tt> and <tt>tuple</tt></h3>
! <p><b>Section:</b> 20.3 [pairs], 20.4 [tuple] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#pairs">issues</a> in [pairs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-97</b></p>
  <p>
! <tt>pair</tt>'s class definition in N3092 20.3.2 [pairs.pair]
  contains "<tt>pair(const pair&amp;) = default;</tt>" and 
  "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>". The latter is described by
! 20.3.2 [pairs.pair] p.12-13.
! <p/>
  "<tt>pair(const pair&amp;) = default;</tt>" is a user-declared explicitly defaulted
! copy constructor. According to 12.8 [class.copy]&#47;10, this inhibits 
  the implicitly-declared move constructor. <tt>pair</tt> should be move constructible. 
! (12.8 [class.copy]&#47;7 explains that "<tt>pair(pair&lt;U, V&gt;&amp;&amp; p)</tt>" 
! will never be instantiated to move <tt>pair&lt;T1, T2&gt;</tt> to <tt>pair&lt;T1, T2&gt;</tt>.)<br/>
  "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>" is a user-provided move
! assignment operator (according to 8.4.2 [dcl.fct.def.default]&#47;4: "A 
  special member function is user-provided if it is user-declared and not explicitly defaulted
! on its first declaration."). According to 12.8 [class.copy]&#47;20, this inhibits
  the implicitly-declared copy assignment operator. <tt>pair</tt>
! should be copy assignable, and was in C++98&#47;03. (Again,
! 12.8 [class.copy]&#47;7 explains that "<tt>operator=(const pair&lt;U, V&gt;&amp; p)</tt>" 
! will never be instantiated to copy <tt>pair&lt;T1, T2&gt;</tt> to <tt>pair&lt;T1, T2&gt;</tt>.)<br/>
  Additionally, "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>" is
! unconditionally defined, whereas according to 12.8 [class.copy]&#47;25,
! defaulted copy&#47;move assignment operators are defined as
  deleted in several situations, such as when non-static data
  members of reference type are present.
! <p/>
  If "<tt>pair(const pair&amp;) = default;</tt>" and "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>" 
! were removed from <tt>pair</tt>'s class definition in 20.3.2 [pairs.pair] and from 
! 20.3.2 [pairs.pair]&#47;12-13, <tt>pair</tt> would
! receive implicitly-declared copy&#47;move constructors and
! copy&#47;move assignment operators, and 12.8 [class.copy]&#47;25 would
! apply. The implicitly-declared copy&#47;move constructors
! would be trivial when <tt>T1</tt> and <tt>T2</tt> have trivial copy&#47;move
! constructors, according to 12.8 [class.copy]&#47;13, and similarly for the
! assignment operators, according to12.8 [class.copy]&#47;27. Notes could
  be added as a reminder that these functions would be
  implicitly-declared, but such notes would not be necessary
  (the Standard Library specification already assumes a
  high level of familiarity with the Core Language, and
  casual readers will simply assume that <tt>pair</tt> is copyable
  and movable).
! <p/>
  Alternatively, <tt>pair</tt> could be given explicitly-defaulted
! copy&#47;move constructors and copy&#47;move assignment
  operators. This is a matter of style.
! <p/>
  <tt>tuple</tt> is also affected. <tt>tuple</tt>'s class definition in 20.4 [tuple] contains:
! </p>
! <pre>
! tuple(const tuple&amp;) = default;
  tuple(tuple&amp;&amp;);
  tuple&amp; operator=(const tuple&amp;);
  tuple&amp; operator=(tuple&amp;&amp;);
  </pre>
+ <p>
  They should all be removed or all be explicitly-defaulted,
! to be consistent with <tt>pair</tt>. Additionally, 20.4.2.1 [tuple.cnstr]&#47;8-9 specifies the 
  behavior of an explicitly defaulted function, which is currently inconsistent with
  <tt>pair</tt>.
! </p>
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  Either remove "<tt>pair(const pair&amp;) = default;</tt>" and
  "<tt>pair&amp; operator=(pair&amp;&amp; p);</tt>" from <tt>pair</tt>'s class
! definition in  20.3.2 [pairs.pair] and from  20.3.2 [pairs.pair] p.12-13, or
! give pair explicitly-defaulted copy&#47;move constructors and copy&#47;move assignment operators.<BR/>
  Change <tt>tuple</tt> to match.
! </p></blockquote>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a> would solve this issue:
! The move&#47;copy constructor will be defaulted, but the corresponding assignment operators need a non-default implementation
  because they are supposed to work for references as well.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1384"></a>1384. Function <tt>pack_arguments</tt> is poorly named</h3>
! <p><b>Section:</b> 20.4.2.4 [tuple.creation] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-98</b></p>
  <p>
! <tt>pack_arguments</tt> is poorly named. It does not reflect the
  fact that it is a tuple creation function and that it forwards
  arguments.
  </p>
*************** Resolved in Rapperswil by a motion to di
*** 79877,79900 ****
  
  
  
  <p><b>Proposed resolution:</b></p>
! Rename pack_arguments to forward_as_tuple
! throughout the standard.
  
  
  
  
  
  <hr>
! <h3><a name="1386"></a>1386. FCD Ballot Comment US-99</h3>
! <p><b>Section:</b> 20.4.2.4 [tuple.creation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-99</b></p>
  <p>
! pack_arguments is overly complex.
  </p>
  
  <p><i>[
--- 90959,91160 ----
  
  
  
+ <p><b>Proposed resolution:</b></p><p>
+ Rename <tt>pack_arguments</tt> to <tt>forward_as_tuple</tt> throughout the standard.
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1385"></a>1385. <tt>tuple_cat</tt> should be a single variadic signature</h3>
+ <p><b>Section:</b> 20.4.2.4 [tuple.creation] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-88</b></p>
+ <p>
+ The <tt>tuple_cat</tt> template consists of four overloads and that
+ can concatenate only two <tt>tuple</tt>s. A single variadic
+ signature that can concatenate an arbitrary number of
+ <tt>tuple</tt>s would be preferred.
+ </p>
+ 
+ <p><i>[
+ Resolution proposed by ballot comment:
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ Adopt a simplified form of the proposal in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2975.pdf">n2975</a>,
+ restricted to <tt>tuple</tt>s and neither requiring nor outlawing support for other <tt>tuple</tt>-like types.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010 Rapperswil: Alisdair to provide wording.
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2010-11-06: Daniel comments and proposes some alternative wording:
+ ]</i></p>
+ 
+ 
+ <p>
+ There are some problems in the wording: First, even though the result type <tt>tuple&lt;<i>see below</i>&gt;</tt>
+ implies it, the specification of the contained tuple element types is missing. Second, the term &quot;<tt>tuple</tt> 
+ protocol&quot; is not defined anywhere and I see no reason why this normative wording should not be a non-normative
+ note. We could at least give a better approximation, maybe "tuple-like protocol" as indicated from header
+ <tt>&lt;utility&gt;</tt> synopsis. Further, it seems to me that the effects need to contain a combination of <tt>std::forward</tt>
+ with the call of <tt>get</tt>. Finally I suggest to replace the requirements <tt>Move/CopyConstructible</tt>
+ by proper usage of <tt>is_constructible</tt>, as indicated by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3140.html">n3140</a>.
+ </p>
+ 
+ <p><i>[
+ 2010 Batavia
+ ]</i></p>
+ 
+ <p>
+ Moved to Ready with Daniel's improved wording.
+ </p>
+ 
+ 
  <p><b>Proposed resolution:</b></p>
! <p>Note: This alternate proposed resolution works only if <a href="lwg-defects.html#1191">1191</a> has been accepted.</p>
! 
! <ol>
! <li>Change 20.4.1 [tuple.general] p. 2, header <tt>&lt;tuple&gt;</tt> synopsis, as indicated:
! <blockquote><pre>
! namespace std {
! 
! ...
! 
! // <i>20.4.2.4, tuple creation functions:</i>
! const unspecified ignore;
! 
! template &lt;class... Types&gt;
!   tuple&lt;<i>VTypes</i>...&gt; make_tuple(Types&amp;&amp;...);
!   template &lt;class... Types&gt;
!   tuple&lt;<i>ATypes</i>...&gt; forward_as_tuple(Types&amp;&amp;...);
!   
! template&lt;class... Types&gt;
!   tuple&lt;Types&amp;...&gt; tie(Types&amp;...);
!   
! <del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp;, const tuple&lt;UTypes...&gt;&amp;);
! template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp;, const tuple&lt;UTypes...&gt;&amp;);
! template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp;, tuple&lt;UTypes...&gt;&amp;&amp;);
! template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp;, tuple&lt;UTypes...&gt;&amp;&amp;);</del>
! <ins>template &lt;class... Tuples&gt;
!   tuple&lt;<i>CTypes</i>...&gt; tuple_cat(Tuples&amp;&amp;...);</ins>
! 
! ...
! 
! </pre></blockquote>
! </li>
! <li>Change 20.4.2.4 [tuple.creation] as indicated:
! <blockquote>
! <pre><del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);</del></pre>
! <blockquote><p><del>
! 8 <i>Requires</i>: All the types in <tt>TTypes</tt> shall be <tt>CopyConstructible</tt> (Table 35). All the types in 
! <tt>UTypes</tt> shall be <tt>CopyConstructible</tt> (Table 35).
! </del></p></blockquote>
! <blockquote><p><del>
! 9 <i>Returns</i>: A <tt>tuple</tt> object constructed by copy constructing its first <tt>sizeof...(TTypes)</tt> elements 
! from the corresponding elements of <tt>t</tt> and copy constructing its last <tt>sizeof...(UTypes)</tt> elements from the 
! corresponding elements of <tt>u</tt>.
! </del></p></blockquote>
! <pre><del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp; t, const tuple&lt;UTypes...&gt;&amp; u);</del></pre>
! <blockquote><p><del>
! 10 <i>Requires</i>: All the types in <tt>TTypes</tt> shall be <tt>MoveConstructible</tt> (Table 34). All the types in 
! <tt>UTypes</tt> shall be <tt>CopyConstructible</tt> (Table 35).
! </del></p></blockquote>
! <blockquote><p><del>
! 11 <i>Returns</i>: A <tt>tuple</tt> object constructed by move constructing its first <tt>sizeof...(TTypes)</tt> elements 
! from the corresponding elements of <tt>t</tt> and copy constructing its last <tt>sizeof...(UTypes)</tt> elements from the 
! corresponding elements of <tt>u</tt>.
! </del></p></blockquote>
! <pre><del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(const tuple&lt;TTypes...&gt;&amp; t, tuple&lt;UTypes...&gt;&amp;&amp; u);</del></pre>
! <blockquote><p><del>
! 12 <i>Requires</i>: All the types in <tt>TTypes</tt> shall be <tt>CopyConstructible</tt> (Table 35). All the types in 
! <tt>UTypes</tt> shall be <tt>MoveConstructible</tt> (Table 34).
! </del></p></blockquote>
! <blockquote><p><del>
! 13 <i>Returns</i>: A <tt>tuple</tt> object constructed by copy constructing its first <tt>sizeof...(TTypes)</tt> elements 
! from the corresponding elements of <tt>t</tt> and move constructing its last <tt>sizeof...(UTypes)</tt> elements from the 
! corresponding elements of <tt>u</tt>.
! </del></p></blockquote>
! <pre><del>template &lt;class... TTypes, class... UTypes&gt;
!   tuple&lt;TTypes..., UTypes...&gt; tuple_cat(tuple&lt;TTypes...&gt;&amp;&amp; t, tuple&lt;UTypes...&gt;&amp;&amp; u);</del></pre>
! <blockquote><p><del>
! 14 <i>Requires</i>: All the types in <tt>TTypes</tt> shall be <tt>MoveConstructible</tt> (Table 34). All the types in 
! <tt>UTypes</tt> shall be <tt>MoveConstructible</tt> (Table 34).
! </del></p></blockquote>
! <blockquote><p><del>
! 15 <i>Returns</i>: A <tt>tuple</tt> object constructed by move constructing its first <tt>sizeof...(TTypes)</tt> elements 
! from the corresponding elements of <tt>t</tt> and move constructing its last <tt>sizeof...(UTypes)</tt> elements from the 
! corresponding elements of <tt>u</tt>.
! </del></p></blockquote>
! <pre><ins>template &lt;class... Tuples&gt;
!   tuple&lt;<i>CTypes</i>...&gt; tuple_cat(Tuples&amp;&amp;... tpls);
! </ins></pre>
! <blockquote><p><ins>
! 8 Let <tt>Ti</tt> be the <tt><i>i</i></tt><sup>th</sup> type in <tt>Tuples</tt>, <tt>Ui</tt> be <tt>remove_reference&lt;Ti&gt;::type</tt>,
! and <tt>tp<sub><i>i</i></sub></tt> be the <tt><i>i</i></tt><sup>th</sup> parameter in the function parameter pack <tt>tpls</tt>, where all 
! indexing is zero-based in the following paragraphs of this sub-clause [tuple.creation].
! </ins></p></blockquote>
! <blockquote><p><ins>
! 9 <i>Requires</i>: For all <tt><i>i</i></tt>, <tt>Ui</tt> shall be the type <i>cv<sub><tt>i</tt></sub>&nbsp;</i><tt>tuple&lt;Args<sub><i>i</i></sub>...&gt;</tt>, 
! where <i>cv<sub><tt>i</tt></sub></i> is the (possibly empty) <tt><i>i</i></tt><sup>th</sup> <i>cv</i>-qualifier-seq, and 
! <tt>Args<sub><i>i</i></sub></tt> is the parameter pack representing the element types in <tt>Ui</tt>. Let <tt>Aik</tt> be the 
! <tt><i>k<sub>i</sub></i></tt><sup>th</sup> type in <tt>Args<sub><i>i</i></sub></tt>, then for all <tt>Aik</tt> the following 
! requirements shall be satisfied: If <tt>Ti</tt> is deduced as an lvalue reference type, then 
! <tt>is_constructible&lt;Aik, <i>cv<sub>i</sub>&nbsp;</i>Aik&amp;&gt;::value == true</tt>, otherwise 
! <tt>is_constructible&lt;Aik, <i>cv<sub>i</sub>&nbsp;</i>Aik&amp;&amp;&gt;::value == true</tt>.
! </ins></p></blockquote>
! <blockquote><p><ins>
! 10 <i>Remarks</i>: The types in <tt><i>CTypes</i></tt> shall be equal to the ordered sequence of the expanded types
! <tt>Args<sub>0</sub>..., Args<sub>1</sub>..., Args<sub><i>n</i>-1</sub>...</tt>, where <tt><i>n</i></tt> equals 
! <tt>sizeof...(Tuples)</tt>. Let <tt><i>e<sub>i</sub></i>...</tt> be the <tt><i>i</i></tt><sup>th</sup> ordered 
! sequence of tuple elements of the result <tt>tuple</tt> object corresponding to the type sequence 
! <tt>Args<sub><i>i</i></sub></tt>.
! </ins></p></blockquote>
! <blockquote><p><ins>
! 11 <i>Returns</i>: A <tt>tuple</tt> object constructed by initializing
! the <tt><i>k<sub>i</sub></i></tt><sup>th</sup> type element <tt>eik</tt> in <tt><i>e<sub>i</sub></i>...</tt>
! with <tt>get&lt;<i>k<sub>i</sub></i>&gt;(std::forward&lt;Ti&gt;(tp<sub>i</sub>))</tt>
! for each valid <tt><i>k<sub>i</sub></i></tt> and each element group <tt><i>e<sub>i</sub></i></tt> in order. 
! </ins></p></blockquote>
! <blockquote><p><ins>
! 12 [<i>Note</i>: An implementation may support additional types in the parameter pack <tt>Tuples</tt>, such as
! <tt>pair</tt> and <tt>array</tt> that support the <tt>tuple</tt>-like protocol. &mdash; <i>end note</i>]
! </ins></p></blockquote>
! </blockquote>
! </li>
! </ol>
! 
  
  
  
  
  
  <hr>
! <h3><a name="1386"></a>1386. <tt>pack_arguments</tt> overly complex</h3>
! <p><b>Section:</b> 20.4.2.4 [tuple.creation] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-99</b></p>
  <p>
! <tt>pack_arguments</tt> is overly complex.
  </p>
  
  <p><i>[
*************** Resolved in Rapperswil by a motion to di
*** 79904,79938 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
  This issue resulted from a lack of understanding of
  how references are forwarded. The definition of
! pack_arguments should be simply:<br>
! template &lt;class... Types&gt;
  tuple&lt;<del>A</del>Types<ins>&amp;&amp;</ins>&gt;
! pack_arguments(Types&amp;&amp;...t);<br>
! <del>Types:Let Ti be each type in Types....</del><br>
! Effects: ...<br>
! Returns:<br>
! tuple&lt;<del>A</del>Types<ins>&amp;&amp;</ins>...&gt;(std::forward&lt;Types&gt;(t)...)<br>
! The synopsis should also change to reflect this
! simpler signature.
! 
  
  
  
  
  <hr>
! <h3><a name="1387"></a>1387. [FCD] Ballot Comment GB-87</h3>
! <p><b>Section:</b> X [tuple.range] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-87</b></p>
  <p>
  There is no compelling reason to assume a
  heterogeneous tuple of two elements holds a pair of
! iterators forming a valid range. Unlike std::pair, there are
  no functions in the standard library using this as a return
  type with a valid range, so there is even less reason to try
  to adapt this type for the new for-loop syntax.
--- 91164,91197 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  This issue resulted from a lack of understanding of
  how references are forwarded. The definition of
! <tt>pack_arguments</tt> should be simply:<br/>
! <tt>template &lt;class... Types&gt;
  tuple&lt;<del>A</del>Types<ins>&amp;&amp;</ins>&gt;
! pack_arguments(Types&amp;&amp;...t);</tt><br/>
! <del>Types: Let <tt>Ti</tt> be each type in <tt>Types</tt>....</del><br/>
! <i>Effects</i>: ...<br/>
! <i>Returns</i>:<br/>
! <tt>tuple&lt;<del>A</del>Types<ins>&amp;&amp;</ins>...&gt;(std::forward&lt;Types&gt;(t)...)</tt><br/>
! The synopsis should also change to reflect this simpler signature.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1387"></a>1387. Range support by <tt>tuple</tt> should be removed</h3>
! <p><b>Section:</b> X [tuple.range] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-87</b></p>
  <p>
  There is no compelling reason to assume a
  heterogeneous tuple of two elements holds a pair of
! iterators forming a valid range. Unlike <tt>std::pair</tt>, there are
  no functions in the standard library using this as a return
  type with a valid range, so there is even less reason to try
  to adapt this type for the new for-loop syntax.
*************** Resolved in Rapperswil by a motion to di
*** 79945,79964 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
  Strike 20.4.2.10 and the matching declarations in
  the header synopsis in 20.4.
! 
  
  
  
  
  <hr>
! <h3><a name="1388"></a>1388. FCD Ballot Comment US-100</h3>
! <p><b>Section:</b> 20.6.1 [ratio.ratio] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ratio.ratio">issues</a> in [ratio.ratio].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-100</b></p>
  <p>
--- 91204,91223 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Strike 20.4.2.10 and the matching declarations in
  the header synopsis in 20.4.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1388"></a>1388. LWG 1281 incorrectly accepted</h3>
! <p><b>Section:</b> 20.11.3 [ratio.ratio] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ratio.ratio">issues</a> in [ratio.ratio].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-100</b></p>
  <p>
*************** LWG 1281 was discussed in Pittsburgh, an
*** 79966,79973 ****
  there was to accept the typedef as proposed and move to
  Review. Unfortunately the issue was accidentally applied
  to the FCD, and incorrectly. The FCD version of the
! typedef refers to ratio&lt;N, D&gt;, but the typedef is intended
! to refer to ratio&lt;num, den&gt; which in general is not the
  same type.
  </p>
  
--- 91225,91232 ----
  there was to accept the typedef as proposed and move to
  Review. Unfortunately the issue was accidentally applied
  to the FCD, and incorrectly. The FCD version of the
! typedef refers to <tt>ratio&lt;N, D&gt;</tt>, but the typedef is intended
! to refer to <tt>ratio&lt;num, den&gt;</tt> which in general is not the
  same type.
  </p>
  
*************** Resolved in Rapperswil by a motion to di
*** 79978,79998 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
! Accept the current proposed wording of LWG
! 1281 which adds:<br>
! typedef ratio&lt;num, den&gt; type;
! 
  
  
  
  
  <hr>
! <h3><a name="1389"></a>1389. [FCD] Compile-time rational arithmetic and overflow</h3>
! <p><b>Section:</b> 20.6.2 [ratio.arithmetic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#ratio.arithmetic">issues</a> in [ratio.arithmetic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-89</b></p>
  <p>
--- 91237,91256 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
! Accept the current proposed wording of LWG <a href="lwg-defects.html#1281">1281</a> which adds:<br/>
! <tt>typedef ratio&lt;num, den&gt; type;</tt>
! </p>
  
  
  
  
  <hr>
! <h3><a name="1389"></a>1389. Compile-time rational arithmetic and overflow</h3>
! <p><b>Section:</b> 20.11.4 [ratio.arithmetic] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ratio.arithmetic">issues</a> in [ratio.arithmetic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-89</b></p>
  <p>
*************** instantiation. For example
*** 80004,80010 ****
  alias <tt>ratio&lt;2*LLONG_MAX, LLONG_MAX*2&gt;</tt>, which
  overflows, so is ill-formed. However, this is trivially equal
  to <tt>ratio&lt;1, 1&gt;</tt>. It also contradicts the opening statement of
! 20.6.2 [ratio.arithmetic] p. 1 "implementations may use other algorithms to
  compute these values".
  </p>
  
--- 91262,91268 ----
  alias <tt>ratio&lt;2*LLONG_MAX, LLONG_MAX*2&gt;</tt>, which
  overflows, so is ill-formed. However, this is trivially equal
  to <tt>ratio&lt;1, 1&gt;</tt>. It also contradicts the opening statement of
! 20.11.4 [ratio.arithmetic] p. 1 "implementations may use other algorithms to
  compute these values".
  </p>
  
*************** compute these values".
*** 80013,80078 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3131.html">n3131</a> would solve this issue.
! </blockquote>
  
! <p><i>[Batavia: Resoved by accepting
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3210.html">n3210</a>.]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
! Change the wording in 20.6.2 [ratio.arithmetic] p. 2-5 as follows:
! <p>
! </p><blockquote><pre>template &lt;class R1, class R2&gt; using ratio_add = <em>see below</em>;
! </pre><blockquote>
  2 The type <tt>ratio_add&lt;R1, R2&gt;</tt> shall be a synonym for <del><tt>ratio&lt;T1, T2&gt;</tt></del>
  <ins><tt>ratio&lt;U, V&gt;</tt> such that <tt>ratio&lt;U, V&gt;::num</tt> and <tt>ratio&lt;U, V&gt;::den</tt> 
  are the same as the corresponding members of <tt>ratio&lt;T1, T2&gt;</tt> would be in the absence of 
  arithmetic overflow</ins> where <tt>T1</tt> has the value <tt>R1::num * R2::den + R2::num * R1::den</tt> 
  and <tt>T2</tt> has the value <tt>R1::den * R2::den</tt>. <ins>If the required values of <tt>ratio&lt;U, V&gt;::num</tt> 
  and <tt>ratio&lt;U, V&gt;::den</tt> cannot be represented in <tt>intmax_t</tt> then the program is ill-formed.</ins>
! </blockquote></blockquote>
! <blockquote><pre>template &lt;class R1, class R2&gt; using ratio_subtract = <em>see below</em>;
! </pre><blockquote>
  3 The type <tt>ratio_subtract&lt;R1, R2&gt;</tt> shall be a synonym for <del><tt>ratio&lt;T1, T2&gt;</tt></del>
  <ins><tt>ratio&lt;U, V&gt;</tt> such that <tt>ratio&lt;U, V&gt;::num</tt> and <tt>ratio&lt;U, V&gt;::den</tt> 
  are the same as the corresponding members of <tt>ratio&lt;T1, T2&gt;</tt> would be in the absence of 
  arithmetic overflow</ins> where <tt>T1</tt> has the value <tt>R1::num * R2::den - R2::num * R1::den</tt> 
  and <tt>T2</tt> has the value <tt>R1::den * R2::den</tt>. <ins>If the required values of <tt>ratio&lt;U, V&gt;::num</tt> 
  and <tt>ratio&lt;U, V&gt;::den</tt> cannot be represented in <tt>intmax_t</tt> then the program is ill-formed.</ins>
! </blockquote></blockquote>
! <blockquote><pre>template &lt;class R1, class R2&gt; using ratio_multiply = <em>see below</em>;
! </pre><blockquote>
  4 The type <tt>ratio_multiply&lt;R1, R2&gt;</tt> shall be a synonym for <del><tt>ratio&lt;T1, T2&gt;</tt></del>
  <ins><tt>ratio&lt;U, V&gt;</tt> such that <tt>ratio&lt;U, V&gt;::num</tt> and <tt>ratio&lt;U, V&gt;::den</tt> 
  are the same as the corresponding members of <tt>ratio&lt;T1, T2&gt;</tt> would be in the absence of 
  arithmetic overflow</ins> where <tt>T1</tt> has the value <tt>R1::num * R2::num</tt> and <tt>T2</tt> 
  has the value <tt>R1::den * R2::den</tt>. <ins>If the required values of <tt>ratio&lt;U, V&gt;::num</tt> 
  and <tt>ratio&lt;U, V&gt;::den</tt> cannot be represented in <tt>intmax_t</tt> then the program is ill-formed.</ins>
! </blockquote></blockquote>
! <blockquote><pre>template &lt;class R1, class R2&gt; using ratio_divide = <em>see below</em>;
! </pre><blockquote>
  5 The type <tt>ratio_divide&lt;R1, R2&gt;</tt> shall be a synonym for <del><tt>ratio&lt;T1, T2&gt;</tt></del>
  <ins><tt>ratio&lt;U, V&gt;</tt> such that <tt>ratio&lt;U, V&gt;::num</tt> and <tt>ratio&lt;U, V&gt;::den</tt> 
  are the same as the corresponding members of <tt>ratio&lt;T1, T2&gt;</tt> would be in the absence of 
  arithmetic overflow</ins> where <tt>T1</tt> has the value <tt>R1::num * R2::den</tt> and <tt>T2</tt> 
  has the value <tt>R1::den * R2::num</tt>. <ins>If the required values of <tt>ratio&lt;U, V&gt;::num</tt> 
  and <tt>ratio&lt;U, V&gt;::den</tt> cannot be represented in <tt>intmax_t</tt> then the program is ill-formed.</ins>
! </blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1390"></a>1390. [FCD] Limit speculative compilation for constructible/convertible traits</h3>
! <p><b>Section:</b> 20.7 [meta] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-17</b></p>
  <p>
--- 91271,91340 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3131.html">n3131</a> would solve this issue.
! </p></blockquote>
  
! <p><i>[Batavia: Resolved by accepting
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3210.pdf">n3210</a>.]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change the wording in 20.11.4 [ratio.arithmetic] p. 2-5 as follows:</p>
! <blockquote><pre>
! template &lt;class R1, class R2&gt; using ratio_add = <em>see below</em>;
! </pre><blockquote><p>
  2 The type <tt>ratio_add&lt;R1, R2&gt;</tt> shall be a synonym for <del><tt>ratio&lt;T1, T2&gt;</tt></del>
  <ins><tt>ratio&lt;U, V&gt;</tt> such that <tt>ratio&lt;U, V&gt;::num</tt> and <tt>ratio&lt;U, V&gt;::den</tt> 
  are the same as the corresponding members of <tt>ratio&lt;T1, T2&gt;</tt> would be in the absence of 
  arithmetic overflow</ins> where <tt>T1</tt> has the value <tt>R1::num * R2::den + R2::num * R1::den</tt> 
  and <tt>T2</tt> has the value <tt>R1::den * R2::den</tt>. <ins>If the required values of <tt>ratio&lt;U, V&gt;::num</tt> 
  and <tt>ratio&lt;U, V&gt;::den</tt> cannot be represented in <tt>intmax_t</tt> then the program is ill-formed.</ins>
! </p></blockquote></blockquote>
! <blockquote><pre>
! template &lt;class R1, class R2&gt; using ratio_subtract = <em>see below</em>;
! </pre><blockquote><p>
  3 The type <tt>ratio_subtract&lt;R1, R2&gt;</tt> shall be a synonym for <del><tt>ratio&lt;T1, T2&gt;</tt></del>
  <ins><tt>ratio&lt;U, V&gt;</tt> such that <tt>ratio&lt;U, V&gt;::num</tt> and <tt>ratio&lt;U, V&gt;::den</tt> 
  are the same as the corresponding members of <tt>ratio&lt;T1, T2&gt;</tt> would be in the absence of 
  arithmetic overflow</ins> where <tt>T1</tt> has the value <tt>R1::num * R2::den - R2::num * R1::den</tt> 
  and <tt>T2</tt> has the value <tt>R1::den * R2::den</tt>. <ins>If the required values of <tt>ratio&lt;U, V&gt;::num</tt> 
  and <tt>ratio&lt;U, V&gt;::den</tt> cannot be represented in <tt>intmax_t</tt> then the program is ill-formed.</ins>
! </p></blockquote></blockquote>
! <blockquote><pre>
! template &lt;class R1, class R2&gt; using ratio_multiply = <em>see below</em>;
! </pre><blockquote><p>
  4 The type <tt>ratio_multiply&lt;R1, R2&gt;</tt> shall be a synonym for <del><tt>ratio&lt;T1, T2&gt;</tt></del>
  <ins><tt>ratio&lt;U, V&gt;</tt> such that <tt>ratio&lt;U, V&gt;::num</tt> and <tt>ratio&lt;U, V&gt;::den</tt> 
  are the same as the corresponding members of <tt>ratio&lt;T1, T2&gt;</tt> would be in the absence of 
  arithmetic overflow</ins> where <tt>T1</tt> has the value <tt>R1::num * R2::num</tt> and <tt>T2</tt> 
  has the value <tt>R1::den * R2::den</tt>. <ins>If the required values of <tt>ratio&lt;U, V&gt;::num</tt> 
  and <tt>ratio&lt;U, V&gt;::den</tt> cannot be represented in <tt>intmax_t</tt> then the program is ill-formed.</ins>
! </p></blockquote></blockquote>
! <blockquote><pre>
! template &lt;class R1, class R2&gt; using ratio_divide = <em>see below</em>;
! </pre><blockquote><p>
  5 The type <tt>ratio_divide&lt;R1, R2&gt;</tt> shall be a synonym for <del><tt>ratio&lt;T1, T2&gt;</tt></del>
  <ins><tt>ratio&lt;U, V&gt;</tt> such that <tt>ratio&lt;U, V&gt;::num</tt> and <tt>ratio&lt;U, V&gt;::den</tt> 
  are the same as the corresponding members of <tt>ratio&lt;T1, T2&gt;</tt> would be in the absence of 
  arithmetic overflow</ins> where <tt>T1</tt> has the value <tt>R1::num * R2::den</tt> and <tt>T2</tt> 
  has the value <tt>R1::den * R2::num</tt>. <ins>If the required values of <tt>ratio&lt;U, V&gt;::num</tt> 
  and <tt>ratio&lt;U, V&gt;::den</tt> cannot be represented in <tt>intmax_t</tt> then the program is ill-formed.</ins>
! </p></blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1390"></a>1390. Limit speculative compilation for constructible&#47;convertible traits</h3>
! <p><b>Section:</b> 20.10 [meta] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-17</b></p>
  <p>
*************** language (see 14.8.2 paragraph 8).
*** 80086,80110 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> would solve this issue.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1391"></a>1391. [FCD] constructible/convertible traits and access control</h3>
! <p><b>Section:</b> 20.7 [meta] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-18</b></p>
  <p>
--- 91348,91373 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> would solve this issue.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1391"></a>1391. constructible&#47;convertible traits and access control</h3>
! <p><b>Section:</b> 20.10 [meta] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta">active issues</a> in [meta].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta">issues</a> in [meta].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-18</b></p>
  <p>
*************** Several type traits require compiler sup
*** 80113,80119 ****
  Their current specification seems to imply, that the corresponding
  test expressions should be well-formed, even in absense of access:
  </p>
! <pre>class X { X(int){} };
  constexpr bool test = std::is_constructible&lt;X, int&gt;::value;
  </pre>
  <p>
--- 91376,91383 ----
  Their current specification seems to imply, that the corresponding
  test expressions should be well-formed, even in absense of access:
  </p>
! <pre>
! class X { X(int){} };
  constexpr bool test = std::is_constructible&lt;X, int&gt;::value;
  </pre>
  <p>
*************** Resolution proposed by ballot comment
*** 80130,80136 ****
  <p>
  Specify that <tt>std::is_constructible</tt> and
  <tt>std::is_convertible</tt> will return <tt>true</tt> only for
! public constructors/conversion functions.
  </p>
  
  <p><i>[
--- 91394,91400 ----
  <p>
  Specify that <tt>std::is_constructible</tt> and
  <tt>std::is_convertible</tt> will return <tt>true</tt> only for
! public constructors&#47;conversion functions.
  </p>
  
  <p><i>[
*************** public constructors/conversion functions
*** 80138,80162 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> would solve this issue.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1392"></a>1392. [FCD] <tt>result_of</tt> should support pointer-to-data-member</h3>
! <p><b>Section:</b> 20.7.4 [meta.unary] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary">issues</a> in [meta.unary].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-102</b></p>
  <p>
--- 91402,91426 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> would solve this issue.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1392"></a>1392. <tt>result_of</tt> should support pointer-to-data-member</h3>
! <p><b>Section:</b> 20.10.4 [meta.unary] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary">issues</a> in [meta.unary].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-102</b></p>
  <p>
*************** functions and pointers to data members.
*** 80180,80204 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3123.html">n3123</a> would solve this issue.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3123.html">n3123</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1393"></a>1393. [FCD] Trivial traits imply noexcept</h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-92</b></p>
  <p>
--- 91444,91469 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3123.html">n3123</a> would solve this issue.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3123.html">n3123</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1393"></a>1393. Trivial traits imply <tt>noexcept</tt></h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-92</b></p>
  <p>
*************** Resolution proposed by ballot comment
*** 80213,80220 ****
  
  <p>
  For each of the <tt>has_nothrow_<i>something</i></tt> traits,
! remove all references to the matching
! <tt>has_trivial_<i>something</i></tt> traits.
  </p>
  
  <p><i>[
--- 91478,91484 ----
  
  <p>
  For each of the <tt>has_nothrow_<i>something</i></tt> traits,
! remove all references to the matching <tt>has_trivial_<i>something</i></tt> traits.
  </p>
  
  <p><i>[
*************** remove all references to the matching
*** 80222,80257 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> would solve this issue.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1394"></a>1394. [FCD] Ballot Comment DE-19</h3>
! <p><b>Section:</b> 20.7.4.3 [meta.unary.prop] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-19</b></p>
  <p>
! The fundamental trait is_constructible reports false
  positives, e.g.
  </p>
! <pre>is_constructible&lt;char*, void*&gt;::value
  </pre>
! evaluates to true, even though a corresponding variable
! initialization would be ill-formed.
! 
  <p><i>[
  Resolved in Rapperswil by paper N3047.
  ]</i></p>
--- 91486,91523 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a> would solve this issue.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3142.html">n3142</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1394"></a>1394. <tt>is_constructible</tt> reports false positives</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-19</b></p>
  <p>
! The fundamental trait <tt>is_constructible</tt> reports false
  positives, e.g.
  </p>
! <pre>
! is_constructible&lt;char*, void*&gt;::value
  </pre>
! <p>
! evaluates to true, even though a corresponding variable initialization would be ill-formed.
! </p>
  <p><i>[
  Resolved in Rapperswil by paper N3047.
  ]</i></p>
*************** Resolved in Rapperswil by paper N3047.
*** 80259,80283 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
! Remove all false positives from the domain of
! is_constructible.
! 
  
  
  
  
  <hr>
! <h3><a name="1397"></a>1397. [FCD] Deprecate '98 binders</h3>
! <p><b>Section:</b> 20.8 [function.objects] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-95</b></p>
  <p>
  The adaptable function protocol supported by
! <tt>unary_function</tt>/<tt>binary_function</tt> has been superceded by
  lambda expressions and <tt>std::bind</tt>. Despite the name, the
  protocol is not very adaptable as it requires intrusive
  support in the adaptable types, rather than offering an
--- 91525,91548 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
! Remove all false positives from the domain of <tt>is_constructible</tt>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1397"></a>1397. Deprecate '98 binders</h3>
! <p><b>Section:</b> 20.9 [function.objects] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-95</b></p>
  <p>
  The adaptable function protocol supported by
! <tt>unary_function&#47;binary_function</tt> has been superceded by
  lambda expressions and <tt>std::bind</tt>. Despite the name, the
  protocol is not very adaptable as it requires intrusive
  support in the adaptable types, rather than offering an
*************** Resolution proposed by ballot comment
*** 80300,80309 ****
  <p>
  Move clauses 20.8.3, 20.8.9, 20.8.11 and 20.8.12
  to Annex D.
! </p>
! <p>
  Remove the requirements to conditionally derive from
! <tt>unary</tt>/<tt>binary_function</tt> from <tt>function</tt>,
  <tt>reference_wrapper</tt>, and the results of calling <tt>mem_fn</tt>
  and <tt>bind</tt>.
  </p>
--- 91565,91573 ----
  <p>
  Move clauses 20.8.3, 20.8.9, 20.8.11 and 20.8.12
  to Annex D.
! <p/>
  Remove the requirements to conditionally derive from
! <tt>unary&#47;binary_function</tt> from <tt>function</tt>,
  <tt>reference_wrapper</tt>, and the results of calling <tt>mem_fn</tt>
  and <tt>bind</tt>.
  </p>
*************** and <tt>bind</tt>.
*** 80313,80337 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3145.html">n3145</a> would solve this issue.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
! Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3198.html">N3198</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1399"></a>1399. [FCD] <tt>function</tt> does not need an <tt>explicit</tt> default constructor</h3>
! <p><b>Section:</b> 20.8.14.2 [func.wrap.func] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-3</b></p>
  <p>
--- 91577,91602 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3145.html">n3145</a> would solve this issue.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
! Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3198.htm">N3198</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1399"></a>1399. <tt>function</tt> does not need an <tt>explicit</tt> default constructor</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-3</b></p>
  <p>
*************** Resolved in Rapperswil by a motion to di
*** 80349,80356 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Remove <tt>explicit</tt>.
! <pre>namespace std {
  template&lt;class&gt; class function;
  // undefined
  template&lt;class R, class... ArgTypes&gt;
--- 91614,91622 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove <tt>explicit</tt>.</p>
! <pre>
! namespace std {
  template&lt;class&gt; class function;
  // undefined
  template&lt;class R, class... ArgTypes&gt;
*************** public:typedef R result_type;
*** 80371,80380 ****
  
  <hr>
  <h3><a name="1400"></a>1400. FCD <tt>function</tt> does not need an <tt>explicit</tt> default constructor</h3>
! <p><b>Section:</b> 20.8.14.2.1 [func.wrap.func.con] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-4</b></p>
  <p>
--- 91637,91646 ----
  
  <hr>
  <h3><a name="1400"></a>1400. FCD <tt>function</tt> does not need an <tt>explicit</tt> default constructor</h3>
! <p><b>Section:</b> 20.9.12.2.1 [func.wrap.func.con] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-4</b></p>
  <p>
*************** Resolved in Rapperswil by a motion to di
*** 80389,80396 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Remove explicit.
! <pre>function();
  template &lt;class A&gt;
  function(allocator_arg_t, const A&amp; a);
  </pre>
--- 91655,91663 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Remove <tt>explicit</tt>.</p>
! <pre>
! function();
  template &lt;class A&gt;
  function(allocator_arg_t, const A&amp; a);
  </pre>
*************** function(allocator_arg_t, const A&amp; a
*** 80400,80416 ****
  
  
  <hr>
! <h3><a name="1402"></a>1402. [FCD] <tt>nullptr</tt> constructors for smart pointers should be <tt>constexpr</tt></h3>
! <p><b>Section:</b> 20.9 [memory] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#memory">issues</a> in [memory].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-100</b></p>
  
  The <tt>unique_ptr</tt> and <tt>shared_ptr</tt> constructors taking
  <tt>nullptr_t</tt> delegate to a <tt>constexpr</tt> constructor, and could be
  <tt>constexpr</tt> themselves.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 91667,92192 ----
  
  
  <hr>
! <h3><a name="1401"></a>1401. Provide support for <tt>unique_ptr&lt;T&gt; == nullptr</tt></h3>
! <p><b>Section:</b> 20.7 [memory] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#memory">issues</a> in [memory].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
! <p><b>Addresses GB-99</b></p>
! <p>
! One reason that the <tt>unique_ptr</tt> constructor taking a
! <tt>nullptr_t</tt> argument is not <tt>explicit</tt> is to allow conversion
! of <tt>nullptr</tt> to <tt>unique_ptr</tt> in contexts like equality
! comparison. Unfortunately <tt>operator==</tt> for <tt>unique_ptr</tt> is a
! little more clever than that, deducing template parameters for both
! arguments. This means that <tt>nullptr</tt> does not get deduced
! as <tt>unique_ptr</tt> type, and there are no other comparison
! functions to match.
! </p>
! 
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <blockquote><p>
! Add the following signatures to 20.7 [memory] p.1, <tt>&lt;memory&gt;</tt>
! header synopsis:
! </p><blockquote><pre>
! template&lt;typename T, typename D&gt;
! bool operator==(const unique_ptr&lt;T, D&gt; &amp; lhs, nullptr_t);
! template&lt;typename T, typename D&gt;
! bool operator==(nullptr_t, const unique_ptr&lt;T, D&gt; &amp; rhs);
! template&lt;typename T, typename D&gt;
! bool operator!=(const unique_ptr&lt;T, D&gt; &amp; lhs, nullptr_t);
! template&lt;typename T, typename D&gt;
! bool operator!=(nullptr_t, const unique_ptr&lt;T, D&gt; &amp; rhs);
! </pre></blockquote>
! </blockquote>
! 
! <p><i>[
! 2010-11-02 Daniel comments and provides a proposed resolution:
! ]</i></p>
! 
! 
! <blockquote><p>
! The same problem applies to <tt>shared_ptr</tt> as well: In both cases there are no
! conversions considered because the comparison functions are templates. I agree with
! the direction of the proposed resolution, but I believe it would be very surprising
! and inconsistent, if given a smart pointer object <tt>p</tt>, the expression
! <tt>p == nullptr</tt> would be provided, but not <tt>p &lt; nullptr</tt> and the
! other relational operators. According to 5.9 [expr.rel] they are defined
! if null pointer values meet other pointer values, even though the result is unspecified
! for all except some trivial ones. But null pointer values are nothing special here: 
! The Library already defines the relational operators for both <tt>unique_ptr</tt> and 
! <tt>shared_ptr</tt> and the outcome of comparing non-null pointer values will be equally 
! unspecified. If the idea of supporting <tt>nullptr_t</tt> arguments for relational
! operators is not what the committee prefers, I suggest at least to consider to remove 
! the existing relational operators for both <tt>unique_ptr</tt> and <tt>shared_ptr</tt>
! for consistency. But that would not be my preferred resolution of this issue.
! <p/>
! The number of overloads triple the current number, but I think it is much clearer to 
! provide them explicitly instead of adding wording that attempts to say that "sufficient overloads" are
! provided. The following proposal makes the declarations explicit.
! <p/>
! Additionally, the proposal adds the missing declarations for some <tt>shared_ptr</tt>
! comparison functions for consistency.
! </p></blockquote>
! 
! <p><i>[
! 2010-11-03 Daniel adds:
! ]</i></p>
! 
! 
! <p>
! Issue <a href="lwg-defects.html#1297">1297</a> is remotely related. The following proposed resolution splits
! <a href="#1401_extra_bullet">this bullet</a> into sub-bullets A and B. Sub-bullet A would 
! also solve <a href="lwg-defects.html#1297">1297</a>, but sub-bullet B would not.
! <p/>
! A further remark in regard to the proposed semantics of the ordering of <tt>nullptr</tt>
! against other pointer(-like) values: One might think that the following definition might
! be superior because of simplicity:
! </p>
! <blockquote><pre>
! template&lt;class T&gt;
! bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t);
! template&lt;class T&gt;
! bool operator&gt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a);
! </pre><blockquote><p>
! <i>Returns</i>: <tt>false</tt>.
! </p></blockquote></blockquote>
! <p>
! The underlying idea behind this approach is the assumption that nullptr corresponds
! to the least ordinal pointer value. But this assertion does not hold for all supported
! architectures, therefore this approach was not followed because it would lead to
! the inconsistency, that the following assertion could fire: 
! </p>
! <blockquote><pre>
! shared_ptr&lt;int&gt; p(new int);
! shared_ptr&lt;int&gt; null;
! bool v1 = p &lt; nullptr;
! bool v2 = p &lt; null;
! assert(v1 == v2);
! </pre></blockquote>
  
+ <p><i>[2011-03-06: Daniel comments]</i></p>
+ 
+ 
+ <p>The current issue state is not acceptable, because the Batavia meeting
+ did not give advice whether choice A or B of bullet 3 should be applied.
+ Option B will now be removed and if this resolution is accepted, issue
+ <a href="lwg-defects.html#1297">1297</a> should be declared as resolved by <a href="lwg-defects.html#1401">1401</a>.
+ This update also resyncs the wording with N3242.</p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Wording changes are against N3242.
+ </p>
+ <ol>
+ <li>Change 20.7.2 [memory.syn] p. 1, header <tt>&lt;memory&gt;</tt> synopsis as indicated.
+ <tt>noexcept</tt> specifications are only added, where the guarantee exists, that the function
+ shall no throw an exception (as replacement of &quot;<i>Throws</i>: Nothing&quot;. Note that
+ the <tt>noexcept</tt> additions to the <tt>shared_ptr</tt> comparisons are editorial, because
+ they are already part of the accepted paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3195.htm">n3195</a>:
+ <blockquote><pre>
+ namespace std {
+   [&hellip;]
+   // <i>[unique.ptr] Class unique_ptr:</i>
+   template &lt;class T&gt; class default_delete;
+   template &lt;class T&gt; class default_delete&lt;T[]&gt;;
+   template &lt;class T, class D = default_delete&lt;T&gt;&gt; class unique_ptr;
+   template &lt;class T, class D&gt; class unique_ptr&lt;T[], D&gt;;
+ 
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator==(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator!=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ 
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator==(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator==(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator!=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator!=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&lt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&lt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&lt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&lt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&gt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&gt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&gt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&gt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+   
+   // <i>[util.smartptr.weakptr], Class bad_weak_ptr:</i>
+   class bad_weak_ptr;
+ 
+   // <i>[util.smartptr.shared], Class template shared_ptr:</i>
+   template&lt;class T&gt; class shared_ptr;
+ 
+   // <i>[util.smartptr.shared.cmp], shared_ptr comparisons:</i>
+   template&lt;class T, class U&gt;
+   bool operator==(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b) <ins> noexcept</ins>;
+   template&lt;class T, class U&gt;
+   bool operator!=(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b) <ins> noexcept</ins>;
+   template&lt;class T, class U&gt;
+   bool operator&lt;(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b) <ins> noexcept</ins>;
+   template&lt;class T, class U&gt;
+   bool operator&gt;(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b) <ins> noexcept</ins>;
+   template&lt;class T, class U&gt;
+   bool operator&lt;=(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b) <ins> noexcept</ins>;
+   template&lt;class T, class U&gt;
+   bool operator&gt;=(shared_ptr&lt;T&gt; const&amp; a, shared_ptr&lt;U&gt; const&amp; b) <ins> noexcept</ins>;
+ 
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator==(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator==(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator!=(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator!=(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator&lt;(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator&lt;(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
+   <ins>template&gt;class T&gt;</ins>
+   <ins>bool operator&gt;(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&gt;class T&gt;</ins>
+   <ins>bool operator&gt;(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator&lt;=(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator&lt;=(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
+   <ins>template&gt;class T&gt;</ins>
+   <ins>bool operator&gt;=(shared_ptr&lt;T&gt; const&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&gt;class T&gt;</ins>
+   <ins>bool operator&gt;=(nullptr_t, shared_ptr&lt;T&gt; const&amp; a) noexcept;</ins>
+ 
+   [&hellip;]
+ }
+ </pre></blockquote>
+ </li>
+ <li>Change the synopsis just after 20.8.1 [unique.ptr] p. 6 as indicated:
+ <blockquote><pre>
+ namespace std {
+   [&hellip;]
+   
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator==(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator!=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+   template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ 
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator==(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator==(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator!=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator!=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&lt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&lt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&lt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&lt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&gt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&gt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&gt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+   <ins>template &lt;class T, class D&gt;</ins>
+   <ins>bool operator&gt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+ 
+ }
+ </pre></blockquote>
+ </li>
+ <li><a name="1401_extra_bullet">This bullet does now only suggest the first approach:</a>
+ <p>Change 20.8.1.5 [unique.ptr.special] p. 4-7 as indicated and add a series of prototype
+ descriptions:</p>
+ <blockquote><pre>
+ template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&lt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ </pre>
+ 
+ <blockquote>
+ <p>
+ <ins>? <i>Requires:</i> Let <tt>CT</tt> be <tt>common_type&lt;unique_ptr&lt;T1,
+ D1&gt;::pointer, unique_ptr&lt;T2, D2&gt;::pointer&gt;::type</tt>. Then
+ the specialization <tt>less&lt;CT&gt;</tt> shall be a function object type ([function.objects]) 
+ that induces a strict weak ordering ([alg.sorting]) on the pointer values.</ins>
+ </p>
+ 
+ <p>
+ 4 <i>Returns:</i> <tt><ins>less&lt;CT&gt;()(x.get(), y.get())</ins><del>x.get()
+ &lt; y.get()</del></tt>.
+ </p>
+ 
+ <p>
+ <ins>? <i>Remarks:</i> If <tt>unique_ptr&lt;T1, D1&gt;::pointer</tt> is not
+ implicitly convertible to <tt>CT</tt> or <tt>unique_ptr&lt;T2,
+ D2&gt;::pointer</tt> is not implicitly convertible to <tt>CT</tt>, the program
+ is ill-formed.</ins>
+ </p>
+ </blockquote>
+ 
+ <pre>
+ template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&lt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ </pre>
+ 
+ <blockquote><p>
+ 5 <i>Returns:</i> <tt><ins>!(y &lt; x)</ins><del>x.get() &lt;= y.get()</del></tt>.
+ </p></blockquote>
+ 
+ <pre>
+ template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&gt;(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ </pre>
+ 
+ <blockquote><p>
+ 6 <i>Returns:</i> <tt><ins>(y &lt; x)</ins><del>x.get() &gt; y.get()</del></tt>.
+ </p></blockquote>
+ 
+ <pre>
+ template &lt;class T1, class D1, class T2, class D2&gt;
+   bool operator&gt;=(const unique_ptr&lt;T1, D1&gt;&amp; x, const unique_ptr&lt;T2, D2&gt;&amp; y);
+ </pre>
+ 
+ <blockquote><p>
+ 7 <i>Returns:</i> <tt><ins>!(x &lt; y)</ins><del>x.get() &gt;= y.get()</del></tt>.
+ </p></blockquote>
+ </blockquote>
+ 
+ <blockquote><pre>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator==(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator==(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>!x</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator!=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t) noexcept;</ins>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator!=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x) noexcept;</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>(bool) x</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator&lt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator&gt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+ </pre>
+ <blockquote><p>
+ <ins>? <i>Requires:</i> The specialization <tt>less&lt;unique_ptr&lt;T, D&gt;::pointer&gt;</tt> 
+ shall be a function object type ([function.objects]) that induces a strict weak ordering ([alg.sorting])
+ on the pointer values.</ins>
+ </p></blockquote>
+ <blockquote><p>
+ <ins>? <i>Returns</i>: <tt>less&lt;unique_ptr&lt;T, D&gt;::pointer&gt;()(x.get(), nullptr)</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator&lt;(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator&gt;(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+ </pre>
+ <blockquote><p>
+ <ins>? <i>Requires:</i> The specialization <tt>less&lt;unique_ptr&lt;T, D&gt;::pointer&gt;</tt> 
+ shall be a function object type ([function.objects]) that induces a strict weak ordering ([alg.sorting])
+ on the pointer values.</ins>
+ </p></blockquote>
+ <blockquote><p>
+ <ins>? <i>Returns</i>: <tt>less&lt;unique_ptr&lt;T, D&gt;::pointer&gt;()(nullptr, x.get())</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator&lt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator&gt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>!(nullptr &lt; x)</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator&lt;=(nullptr_t, const unique_ptr&lt;T, D&gt;&amp; x);</ins>
+ <ins>template &lt;class T, class D&gt;</ins>
+ <ins>bool operator&gt;=(const unique_ptr&lt;T, D&gt;&amp; x, nullptr_t);</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>!(x &lt; nullptr)</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ 
+ </li>
+ <li><p>Change 20.8.2.2 [util.smartptr.shared] p. 1, class template <tt>shared_ptr</tt>
+ synopsis as indicated. For consistency reasons the remaining normal relation
+ operators are added as well:
+ </p>
+ <blockquote><pre>
+ namespace std {
+ 
+   [&hellip;]
+ 
+   // <i>[util.smartptr.shared.cmp], shared_ptr comparisons:</i>
+   template&lt;class T, class U&gt;
+   bool operator==(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b) noexcept;
+   template&lt;class T, class U&gt;
+   bool operator!=(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b) noexcept;
+   template&lt;class T, class U&gt;
+   bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b) noexcept;
+   <ins>template&lt;class T, class U&gt;</ins>
+   <ins>bool operator&gt;(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b) noexcept;</ins>
+   <ins>template&lt;class T, class U&gt;</ins>
+   <ins>bool operator&lt;=(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b) noexcept;</ins>
+   <ins>template&lt;class T, class U&gt;</ins>
+   <ins>bool operator&gt;=(const shared_ptr&lt;T&gt;&amp; a, const shared_ptr&lt;U&gt;&amp; b) noexcept;</ins>
+ 
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator==(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator==(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator!=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator!=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator&lt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+   <ins>template&gt;class T&gt;</ins>
+   <ins>bool operator&gt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&gt;class T&gt;</ins>
+   <ins>bool operator&gt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator&lt;=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&lt;class T&gt;</ins>
+   <ins>bool operator&lt;=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+   <ins>template&gt;class T&gt;</ins>
+   <ins>bool operator&gt;=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+   <ins>template&gt;class T&gt;</ins>
+   <ins>bool operator&gt;=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+ 
+   [&hellip;]
+ }
+ </pre></blockquote>
+ </li>
+ <li>Add the following series of prototype specifications at the very end of 20.8.2.2.7 [util.smartptr.shared.cmp].
+ For mixed comparison the general &quot;generation&quot; rule of 20.2.1 [operators] p. 10 does not apply, 
+ therefore all of them are defined. Below wording takes advantage of the simplified definition of the
+ <em>composite pointer type</em> if one partner is a null pointer constant:
+ <blockquote><pre>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator==(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator==(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>!a</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator!=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator!=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>(bool) a</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator&lt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator&gt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>less&lt;T*&gt;()(a.get(), nullptr)</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator&lt;(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator&gt;(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>less&lt;T*&gt;()(nullptr, a.get())</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator&lt;=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator&gt;=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>!(nullptr &lt; a)</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ <blockquote><pre>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator&lt;=(nullptr_t, const shared_ptr&lt;T&gt;&amp; a) noexcept;</ins>
+ <ins>template&lt;class T&gt;</ins>
+ <ins>bool operator&gt;=(const shared_ptr&lt;T&gt;&amp; a, nullptr_t) noexcept;</ins>
+ </pre><blockquote><p>
+ <ins>? <i>Returns</i>: <tt>!(a &lt; nullptr)</tt>.</ins>
+ </p></blockquote></blockquote>
+ 
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1402"></a>1402. <tt>nullptr</tt> constructors for smart pointers should be <tt>constexpr</tt></h3>
+ <p><b>Section:</b> 20.7 [memory] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#memory">issues</a> in [memory].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-100</b></p>
+ <p>
  The <tt>unique_ptr</tt> and <tt>shared_ptr</tt> constructors taking
  <tt>nullptr_t</tt> delegate to a <tt>constexpr</tt> constructor, and could be
  <tt>constexpr</tt> themselves.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 80420,80451 ****
  
  
  <p><b>Proposed resolution:</b></p>
! In the 20.9.10.2 [unique.ptr.single] synopsis add
! "constexpr" to unique_ptr(nullptr_t).<br>
! In the 20.9.10.3 [unique.ptr.runtime] synopsis add
! "constexpr" to unique_ptr(nullptr_t).<br>
! In the 20.9.11.2 [util.smartptr.shared] synopsis
! add "constexpr" to shared_ptr(nullptr_t).
  
  
  
  
  
  <hr>
! <h3><a name="1403"></a>1403. [FCD] Inconsistent definitions for <tt>allocator_arg</tt></h3>
! <p><b>Section:</b> 20.9.1 [allocator.tag] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-85</b></p>
  <p>
  There are inconsistent definitions for <tt>allocator_arg</tt>.
! In 20.9 [memory] paragraph 1,
  </p>
! <pre>constexpr allocator_arg_t allocator_arg = allocator_arg_t();
  </pre>
  and in 20.9.1,
! <pre>const allocator_arg_t allocator_arg = allocator_arg_t();
  </pre>
  
  <p><i>[
--- 92196,92233 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! In the 20.8.1.2 [unique.ptr.single] synopsis add
! "constexpr" to <tt>unique_ptr(nullptr_t)</tt>.<br/>
! In the 20.8.1.3 [unique.ptr.runtime] synopsis add
! "constexpr" to <tt>unique_ptr(nullptr_t)</tt>.<br/>
! In the 20.8.2.2 [util.smartptr.shared] synopsis
! add "constexpr" to <tt>shared_ptr(nullptr_t)</tt>.
! </p>
  
  
  
  
  
  <hr>
! <h3><a name="1403"></a>1403. Inconsistent definitions for <tt>allocator_arg</tt></h3>
! <p><b>Section:</b> 20.7.6 [allocator.tag] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-85</b></p>
  <p>
  There are inconsistent definitions for <tt>allocator_arg</tt>.
! In 20.7 [memory] paragraph 1,
  </p>
! <pre>
! constexpr allocator_arg_t allocator_arg = allocator_arg_t();
  </pre>
+ <p>
  and in 20.9.1,
! </p>
! <pre>
! const allocator_arg_t allocator_arg = allocator_arg_t();
  </pre>
  
  <p><i>[
*************** Resolved in Rapperswil by a motion to di
*** 80456,80464 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Change "const" to "constexpr" in 20.9.1 as
! follows.
! <pre>constexpr allocator_arg_t allocator_arg = allocator_arg_t();
  </pre>
  
  
--- 92238,92246 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change "const" to "constexpr" in 20.9.1 as follows.</p>
! <pre>
! constexpr allocator_arg_t allocator_arg = allocator_arg_t();
  </pre>
  
  
*************** follows.
*** 80466,80475 ****
  
  
  <hr>
! <h3><a name="1404"></a>1404. [FCD] <tt>pointer_traits</tt> should have a <tt>size_type</tt> member</h3>
! <p><b>Section:</b> 20.9.3 [pointer.traits] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-106</b></p>
  <p>
--- 92248,92257 ----
  
  
  <hr>
! <h3><a name="1404"></a>1404. <tt>pointer_traits</tt> should have a <tt>size_type</tt> member</h3>
! <p><b>Section:</b> 20.7.3 [pointer.traits] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-106</b></p>
  <p>
*************** follows.
*** 80478,80484 ****
  <p>
  Add <tt>typedef <i>see below</i> size_type;</tt> to the generic
  <tt>pointer_traits</tt> template and <tt>typedef size_t
! size_type;</tt> to <tt>pointer_traits&lt;T*&gt;</tt>. Use
  <tt>pointer_traits::size_type</tt> and
  <tt>pointer_traits::difference_type</tt> as the defaults for
  <tt>allocator_traits::size_type</tt> and
--- 92260,92266 ----
  <p>
  Add <tt>typedef <i>see below</i> size_type;</tt> to the generic
  <tt>pointer_traits</tt> template and <tt>typedef size_t
! size_type;</tt> to <tt>pointer_traits&lt;T*></tt>. Use
  <tt>pointer_traits::size_type</tt> and
  <tt>pointer_traits::difference_type</tt> as the defaults for
  <tt>allocator_traits::size_type</tt> and
*************** there is no obvious meaning for <tt>size
*** 80505,80518 ****
  <p>
  Alisdair suggested, however, that the natural relationship between
  <tt>difference_type</tt> and <tt>size_type</tt> can be expressed simply by the
! <tt>std::make_unsigned&lt;T&gt;</tt> metafunction.  Using this metafunction,
  we can easily define <tt>size_type</tt> for <tt>allocator_traits</tt> without
  artificially adding <tt>size_type</tt> to <tt>pointer_traits</tt>.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready after 6 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 92287,92300 ----
  <p>
  Alisdair suggested, however, that the natural relationship between
  <tt>difference_type</tt> and <tt>size_type</tt> can be expressed simply by the
! <tt>std::make_unsigned&lt;T></tt> metafunction.  Using this metafunction,
  we can easily define <tt>size_type</tt> for <tt>allocator_traits</tt> without
  artificially adding <tt>size_type</tt> to <tt>pointer_traits</tt>.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready after 6 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** In [allocator.requirements], Table 42, c
*** 80528,80534 ****
  </p>
  <blockquote>
  <table border="1">
!   <tbody><tr>
      <td><tt>X::size_type</tt></td>
      <td>unsigned integral type</td>
      <td>a type that can represent the size of the largest object in the
--- 92310,92316 ----
  </p>
  <blockquote>
  <table border="1">
!   <tr>
      <td><tt>X::size_type</tt></td>
      <td>unsigned integral type</td>
      <td>a type that can represent the size of the largest object in the
*************** In [allocator.requirements], Table 42, c
*** 80548,80573 ****
        <ins>pointer_traits&lt;X::pointer&gt;::difference_type</ins>
      </tt></td>
    </tr>
! </tbody></table>
  </blockquote>
  <p>
! In [allocator.traits.types], Change the definition of difference_type and
! size_type as follows:
  </p>
! <blockquote>
    <tt>typedef</tt> <i>see below</i> <tt>difference_type;</tt>
!   <blockquote>
      <i>Type:</i> <tt>Alloc::difference_type</tt> if such a type exists,
      else <tt><del>ptrdiff_t</del>
      <ins>pointer_traits&lt;pointer&gt;::difference_type</ins></tt>.
!   </blockquote>
! 
    <tt>typedef</tt> <i>see below</i> <tt>size_type;</tt>
!   <blockquote>
      <i>Type:</i> <tt>Alloc::size_type</tt> if such a type exists,
      else <tt><del>size_t</del>
      <ins>make_unsigned&lt;difference_type&gt;::type</ins></tt>.
!   </blockquote>
  </blockquote>
  
  
--- 92330,92355 ----
        <ins>pointer_traits&lt;X::pointer&gt;::difference_type</ins>
      </tt></td>
    </tr>
! </table>
  </blockquote>
  <p>
! In [allocator.traits.types], Change the definition of <tt>difference_type</tt> and
! <tt>size_type</tt> as follows:
  </p>
! <blockquote><p>
    <tt>typedef</tt> <i>see below</i> <tt>difference_type;</tt>
!   </p><blockquote><p>
      <i>Type:</i> <tt>Alloc::difference_type</tt> if such a type exists,
      else <tt><del>ptrdiff_t</del>
      <ins>pointer_traits&lt;pointer&gt;::difference_type</ins></tt>.
!   </p></blockquote>
!   <p>
    <tt>typedef</tt> <i>see below</i> <tt>size_type;</tt>
!   </p><blockquote><p>
      <i>Type:</i> <tt>Alloc::size_type</tt> if such a type exists,
      else <tt><del>size_t</del>
      <ins>make_unsigned&lt;difference_type&gt;::type</ins></tt>.
!   </p></blockquote>
  </blockquote>
  
  
*************** size_type as follows:
*** 80575,80589 ****
  
  
  <hr>
! <h3><a name="1405"></a>1405. [FCD] Ballot Comment US-107</h3>
! <p><b>Section:</b> 20.10 [allocator.adaptor] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#allocator.adaptor">issues</a> in [allocator.adaptor].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-107</b></p>
! 
! scoped_allocator_adaptor should have its own header.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 92357,92372 ----
  
  
  <hr>
! <h3><a name="1405"></a>1405. Move <tt>scoped_allocator_adaptor</tt> into separate header</h3>
! <p><b>Section:</b> 20.13 [allocator.adaptor] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.adaptor">issues</a> in [allocator.adaptor].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-107</b></p>
! <p>
! <tt>scoped_allocator_adaptor</tt> should have its own header.
! </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 80592,80615 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
  See Appendix 1 - Additional Details
! 
  
  
  
  
  <hr>
! <h3><a name="1407"></a>1407. [FCD] Synch <tt>shared_ptr</tt> constructors taking movable types</h3>
! <p><b>Section:</b> 20.9.10.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-108</b></p>
  
  <tt>shared_ptr</tt> should have the same policy for constructing
  from <tt>auto_ptr</tt> as <tt>unique_ptr</tt>. Currently it does not.
  
  <p><i>[
  Resolved in Rapperswil by paper N3109.
--- 92375,92400 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  See Appendix 1 - Additional Details
! </p>
  
  
  
  
  <hr>
! <h3><a name="1407"></a>1407. Synch <tt>shared_ptr</tt> constructors taking movable types</h3>
! <p><b>Section:</b> 20.8.2.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-108</b></p>
  
+ <p>
  <tt>shared_ptr</tt> should have the same policy for constructing
  from <tt>auto_ptr</tt> as <tt>unique_ptr</tt>. Currently it does not.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by paper N3109.
*************** Resolved in Rapperswil by paper N3109.
*** 80619,80638 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add “template &lt;class Y&gt; explicit
! shared_ptr(auto_ptr&lt;Y&gt;&amp;); to
! [util.smartptr.shared.const] (and to the synopsis).
  
  
  
  
  
  <hr>
! <h3><a name="1409"></a>1409. [FCD] Specify whether <tt>monotonic_clock</tt> is a distinct type or a typedef</h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-111</b></p>
  <p>
--- 92404,92460 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! Add 
! </p><pre>
! template &lt;class Y&gt; explicit shared_ptr(auto_ptr&lt;Y&gt;&amp;); 
! </pre><p>
! to [util.smartptr.shared.const] (and to the synopsis).
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="1408"></a>1408. Allow recycling of pointers after <tt>undeclare_no_pointers</tt></h3>
! <p><b>Section:</b> 20.7.4 [util.dynamic.safety] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.dynamic.safety">issues</a> in [util.dynamic.safety].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-103</b></p>
! <p>
! The precondition to calling <tt>declare_no_pointers</tt> is that no
! bytes in the range "have been previously registered" with
! this call. As written, this precondition includes bytes in
! ranges, even after they have been explicitly unregistered
! with a later call to <tt>undeclare_no_pointers</tt>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Update 20.7.4 [util.dynamic.safety] p.9:
! </p>
! <blockquote><pre>
! void declare_no_pointers(char *p, size_t n);
! </pre><blockquote><p>
! <tt>9</tt> <em>Requires</em>: No bytes in the specified range <del>have been
! previously registered</del><ins>are currently registered</ins> with <tt>declare_no_pointers()</tt>.
! If the specified range is in an allocated object, then it must be entirely within a single allocated object.
! The object must be live until the corresponding <tt>undeclare_no_pointers()</tt> call. [..]
! </p></blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1409"></a>1409. Specify whether <tt>monotonic_clock</tt> is a distinct type or a typedef</h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-111</b></p>
  <p>
*************** Require that it be a distinct class type
*** 80653,80679 ****
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3128</a> addresses
  this issue by replacing <tt>monotonic_clock</tt> with <tt>steady_clock</tt>, which is not a typedef.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! This is resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.html">n3191</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1410"></a>1410. [FCD] Add a feature-detect macro for <tt>monotonic_clock</tt></h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1411">1411</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-107, DE-20</b></p>
  <p>
--- 92475,92503 ----
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote><p>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3128</a> addresses
  this issue by replacing <tt>monotonic_clock</tt> with <tt>steady_clock</tt>, which is not a typedef.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! This is resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.htm">n3191</a>.
! </p>
  
  
  
  
  
  <hr>
! <h3><a name="1410"></a>1410. Add a feature-detect macro for <tt>monotonic_clock</tt></h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1411">1411</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-107, DE-20</b></p>
  <p>
*************** not present.
*** 80708,80734 ****
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3128</a> addresses
  this issue by replacing <tt>monotonic_clock</tt> with <tt>steady_clock</tt>, which is not conditionally supported,
  so there is no need to detect it.
! </blockquote>
! 
  
  
- <p><b>Proposed resolution:</b></p>
- This is resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.html">n3191</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1412"></a>1412. [FCD] Make monotonic clocks mandatory</h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-21</b></p>
  <p>
--- 92532,92558 ----
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote><p>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3128</a> addresses
  this issue by replacing <tt>monotonic_clock</tt> with <tt>steady_clock</tt>, which is not conditionally supported,
  so there is no need to detect it.
! </p></blockquote>
  
  
  
+ <p><b>Proposed resolution:</b></p><p>
+ This is resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.htm">n3191</a>.
+ </p>
  
  
  
  
  <hr>
! <h3><a name="1412"></a>1412. Make monotonic clocks mandatory</h3>
! <p><b>Section:</b> X [time.clock.monotonic] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.clock.monotonic">issues</a> in [time.clock.monotonic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-21</b></p>
  <p>
*************** facilities anyway.
*** 80741,80805 ****
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3128</a> addresses
  this issue by replacing <tt>monotonic_clock</tt> with <tt>steady_clock</tt>, which is mandatory.
! </blockquote>
  
  <p><i>[
  2010-11-13 Batavia meeting:
  ]</i></p>
  
  <p>
! This is resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.html">n3191</a>.
  The original resolution is preserved for reference:
  </p>
  <blockquote>
  <p>Make monotonic clocks mandatory.</p>
  <p>Strike X [time.clock.monotonic] p.2</p>
! <blockquote>
  <tt>2</tt> <del>The class <tt>monotonic_clock</tt> is conditionally supported.</del>
! </blockquote>
  
  <p>Change 30.2.4 [thread.req.timing] p.2 accordingly</p>
! <blockquote>
  The member functions whose names end in <tt>_for</tt> take an argument that
  specifies a relative time. Implementations should use a monotonic clock to
  measure time for these functions. <del>[ <em>Note</em>: Implementations are not
  required to use a monotonic clock because such a clock may not be available.
! — <em>end note</em> ]</del>
! </blockquote>
  </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
! This is resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.html">n3191</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1414"></a>1414. [FCD] Fixing remaining dead links to <tt>POS_T</tt> and <tt>OFF_T</tt></h3>
! <p><b>Section:</b> 21.2.3.2 [char.traits.specializations.char16_t] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1444">1444</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-109, GB-123</b></p>
  
  <p>
  It is not clear what the specification means for
! u16streampos, u32streampos or wstreampos when they
! refer to the requirements for POS_T in 21.2.2, as there
  are no longer any such requirements. Similarly the annex
! D.7 refers to the requirements of type POS_T in 27.3 that
  no longer exist either.
  </p>
  <p>
  Clarify the meaning of all cross-reference to the
! removed type POS_T.
  </p>
  
  
--- 92565,92629 ----
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote><p>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3128</a> addresses
  this issue by replacing <tt>monotonic_clock</tt> with <tt>steady_clock</tt>, which is mandatory.
! </p></blockquote>
  
  <p><i>[
  2010-11-13 Batavia meeting:
  ]</i></p>
  
  <p>
! This is resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.htm">n3191</a>.
  The original resolution is preserved for reference:
  </p>
  <blockquote>
  <p>Make monotonic clocks mandatory.</p>
  <p>Strike X [time.clock.monotonic] p.2</p>
! <blockquote><p>
  <tt>2</tt> <del>The class <tt>monotonic_clock</tt> is conditionally supported.</del>
! </p></blockquote>
  
  <p>Change 30.2.4 [thread.req.timing] p.2 accordingly</p>
! <blockquote><p>
  The member functions whose names end in <tt>_for</tt> take an argument that
  specifies a relative time. Implementations should use a monotonic clock to
  measure time for these functions. <del>[ <em>Note</em>: Implementations are not
  required to use a monotonic clock because such a clock may not be available.
! &mdash; <em>end note</em> ]</del>
! </p></blockquote>
  </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
! This is resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.htm">n3191</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1414"></a>1414. Fixing remaining dead links to <tt>POS_T</tt> and <tt>OFF_T</tt></h3>
! <p><b>Section:</b> 21.2.3.2 [char.traits.specializations.char16_t] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1444">1444</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-109, GB-123</b></p>
  
  <p>
  It is not clear what the specification means for
! <tt>u16streampos</tt>, <tt>u32streampos</tt> or <tt>wstreampos</tt> when they
! refer to the requirements for <tt>POS_T</tt> in 21.2.2, as there
  are no longer any such requirements. Similarly the annex
! D.7 refers to the requirements of type <tt>POS_T</tt> in 27.3 that
  no longer exist either.
  </p>
  <p>
  Clarify the meaning of all cross-reference to the
! removed type <tt>POS_T</tt>.
  </p>
  
  
*************** Additionally the way of referencing was
*** 80822,80830 ****
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3118.html#GB108">GB 108</a>.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready with proposed wording after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 92646,92654 ----
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3118.html#GB108">GB 108</a>.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready with proposed wording after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 80839,80866 ****
  </p>
  
  <ol>
! <li>Change [char.traits.specializations.char16_t]/1 as indicated:
  <blockquote><p>
  1 - The type <tt>u16streampos</tt> shall be an implementation-defined type that satisfies the requirements 
  for <del><tt>POS_T</tt> in 21.2.2</del><ins><tt>pos_type</tt> in [iostreams.limits.pos]</ins>.
  </p></blockquote>
  </li>
! <li>Change [char.traits.specializations.char32_t]/1 as indicated:
  <blockquote><p>
  1 - The type <tt>u32streampos</tt> shall be an implementation-defined type that satisfies the requirements 
  for <del><tt>POS_T</tt> in 21.2.2</del><ins><tt>pos_type</tt> in [iostreams.limits.pos]</ins>.
  </p></blockquote>
  </li>
! <li>Change [char.traits.specializations.wchar.t]/2 as indicated:
  <blockquote><p>
  2 - The type <tt>wstreampos</tt> shall be an implementation-defined type that satisfies the requirements 
  for <del><tt>POS_T</tt> in 21.2.2</del><ins><tt>pos_type</tt> in [iostreams.limits.pos]</ins>.
  </p></blockquote>
  </li>
! <li>Change [fpos.operations], Table 124 — Position type requirements as indicated:
! <blockquote><p>
! </p><table border="1">
! <caption>Table 124 — Position type requirements</caption>
  
  <tbody>
  <tr>
--- 92663,92690 ----
  </p>
  
  <ol>
! <li><p>Change [char.traits.specializations.char16_t]p.1 as indicated:</p>
  <blockquote><p>
  1 - The type <tt>u16streampos</tt> shall be an implementation-defined type that satisfies the requirements 
  for <del><tt>POS_T</tt> in 21.2.2</del><ins><tt>pos_type</tt> in [iostreams.limits.pos]</ins>.
  </p></blockquote>
  </li>
! <li><p>Change [char.traits.specializations.char32_t]p.1 as indicated:</p>
  <blockquote><p>
  1 - The type <tt>u32streampos</tt> shall be an implementation-defined type that satisfies the requirements 
  for <del><tt>POS_T</tt> in 21.2.2</del><ins><tt>pos_type</tt> in [iostreams.limits.pos]</ins>.
  </p></blockquote>
  </li>
! <li><p>Change [char.traits.specializations.wchar.t]p.2 as indicated:</p>
  <blockquote><p>
  2 - The type <tt>wstreampos</tt> shall be an implementation-defined type that satisfies the requirements 
  for <del><tt>POS_T</tt> in 21.2.2</del><ins><tt>pos_type</tt> in [iostreams.limits.pos]</ins>.
  </p></blockquote>
  </li>
! <li><p>Change [fpos.operations], Table 124 &mdash; Position type requirements as indicated:</p>
! <blockquote>
! <table border="1">
! <caption>Table 124 &mdash; Position type requirements</caption>
  
  <tbody>
  <tr>
*************** for <del><tt>POS_T</tt> in 21.2.2</del><
*** 80890,80906 ****
  <td><tt>...</tt></td>
  </tr>
  <tr>
! <td><tt>streamsize(o)</tt><br><tt>O(sz)</tt></td>
! <td><tt>streamsize</tt><br><del><tt>OFF_T</tt></del><ins><tt>streamoff</tt></ins></td>
  <td><tt>...</tt></td>
  </tr>
  
  </tbody></table>
! <p></p></blockquote>
  </li>
! <li>Change [depr.ios.members]/1 as indicated:
! <p>
! </p><blockquote><pre>namespace std {
   class ios_base {
   public:
     typedef T1 io_state;
--- 92714,92730 ----
  <td><tt>...</tt></td>
  </tr>
  <tr>
! <td><tt>streamsize(o)</tt><br/><tt>O(sz)</tt></td>
! <td><tt>streamsize</tt><br/><del><tt>OFF_T</tt></del><ins><tt>streamoff</tt></ins></td>
  <td><tt>...</tt></td>
  </tr>
  
  </tbody></table>
! </blockquote>
  </li>
! <li><p>Change [depr.ios.members]p.1 as indicated:</p>
! <blockquote><pre>
! namespace std {
   class ios_base {
   public:
     typedef T1 io_state;
*************** for <del><tt>POS_T</tt> in 21.2.2</del><
*** 80912,80920 ****
   };
  }
  </pre></blockquote>
- <p></p>
  </li>
! <li>Change [depr.ios.members]/5+6 as indicated:
  <blockquote><p>
  5 - The type <tt>streamoff</tt> is an implementation-defined type that satisfies the requirements 
  of <del>type <tt>OFF_T</tt> (27.5.1)</del><ins><tt>off_type</tt> in [iostreams.limits.pos]</ins>.
--- 92736,92743 ----
   };
  }
  </pre></blockquote>
  </li>
! <li><p>Change [depr.ios.members]p.5+6 as indicated:</p>
  <blockquote><p>
  5 - The type <tt>streamoff</tt> is an implementation-defined type that satisfies the requirements 
  of <del>type <tt>OFF_T</tt> (27.5.1)</del><ins><tt>off_type</tt> in [iostreams.limits.pos]</ins>.
*************** of <del>type <tt>POS_T</tt> (27.3)</del>
*** 80932,80950 ****
  
  
  <hr>
! <h3><a name="1416"></a>1416. [FCD] <tt>forward_list::erase_after</tt> should not be allowed to throw</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-19</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-21</b></p>
  
! 23.2.1/11 provides a general no-throw guarantee for
  erase() container functions, exceptions from this are
  explicitly mentioned for individual containers. Because of
  its different name, forward_list's erase_after() function is
  not ruled by this but should so.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 92755,92776 ----
  
  
  <hr>
! <h3><a name="1416"></a>1416. <tt>forward_list::erase_after</tt> should not be allowed to throw</h3>
! <p><b>Section:</b> 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements">active issues</a> in [container.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements">issues</a> in [container.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses DE-21</b></p>
  
! <p>
! 23.2.1&#47;11 provides a general no-throw guarantee for
  erase() container functions, exceptions from this are
  explicitly mentioned for individual containers. Because of
  its different name, forward_list's erase_after() function is
  not ruled by this but should so.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Add a "<i>Throws</i>: Nothing" clause to
*** 80964,80978 ****
  
  
  <hr>
! <h3><a name="1417"></a>1417. [FCD] <tt>front</tt>/<tt>back</tt> on a zero-sized
! <tt>array</tt> should be undefined</h3>
! <p><b>Section:</b> 23.3.1.7 [array.zero] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-26</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-112</b></p>
  <p>
! Should the effect of calling <tt>front</tt>/<tt>back</tt> on a zero-sized
  <tt>array</tt> really be implementation defined i.e. require the
  implementor to define behaviour?
  </p>
--- 92790,92805 ----
  
  
  <hr>
! <h3><a name="1417"></a>1417. <tt>front&#47;back</tt> on a zero-sized <tt>array</tt> should be undefined</h3>
! <p><b>Section:</b> 23.3.2.8 [array.zero] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#array.zero">issues</a> in [array.zero].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-112</b></p>
+ 
  <p>
! Should the effect of calling <tt>front&#47;back</tt> on a zero-sized
  <tt>array</tt> really be implementation defined i.e. require the
  implementor to define behaviour?
  </p>
*************** Resolved in Rapperswil by a motion to di
*** 80984,81008 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
  Change "implementation defined" to "undefined"
  
  
  
  
  
  <hr>
! <h3><a name="1423"></a>1423. [FCD] Ballot Comment JP-6</h3>
! <p><b>Section:</b> 23.6.1 [map] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#map">issues</a> in [map].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-6</b></p>
  
! Constructor accepting an allocator as a single parameter
! should be qualified as explicit.
! <pre>namespace std {
  template &lt;class Key, class T, class Compare =
  less&lt;Key&gt;,
  class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
--- 92811,92983 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Change "implementation defined" to "undefined"
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1418"></a>1418. Effects of <tt>resize(size())</tt> on a <tt>deque</tt></h3>
+ <p><b>Section:</b> 23.3.3.3 [deque.capacity] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#deque.capacity">issues</a> in [deque.capacity].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-113</b></p>
+ <p>
+ There is no mention of what happens if <tt>sz==size()</tt>. While
+ it obviously does nothing I feel a standard needs to say
+ this explicitely.
+ </p>
+ 
+ 
+ <p><i>[
+ 2010 Batavia
+ ]</i></p>
+ 
+ <p>
+ Accepted with a simplified resolution turning one of the <tt>&lt;</tt>
+ comparisons into <tt>&lt;=.</tt>
+ </p>
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>Ammend [deque.capacity]</p>
+ <p><tt>void resize(size_type sz);</tt></p>
+ <p>
+ <i>Effects</i>: If <tt>sz &lt;<ins>=</ins> size()</tt>, equivalent to <tt>erase(begin() +
+ sz, end());</tt>. If <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> <del>default 
+ constructed</del><ins>value initialized</ins> elements to the sequence.
+ </p>
  
  
  
  
  
  <hr>
! <h3><a name="1420"></a>1420. Effects of <tt>resize(size())</tt> on a <tt>list</tt></h3>
! <p><b>Section:</b> 23.3.5.3 [list.capacity] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.capacity">issues</a> in [list.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-115</b></p>
! <p>
! There is no mention of what happens if <tt>sz==size()</tt>. While
! it obviously does nothing I feel a standard needs to say
! this explicitely.
! </p>
! 
! <p><i>[
! Resolution proposed in ballot comment
! ]</i></p>
! 
! <p>
! Express the semantics as pseudo-code similarly
! to the way it is done for the copying overload that
! follows (in p3). Include an else clause that does
! nothing and covers the <tt>sz==size()</tt> case.
! </p>
! 
! <p><i>[
! 2010 Batavia
! ]</i></p>
! 
! <p>
! Accepted with a simplified resolution turning one of the <tt>&lt;</tt>
! comparisons into <tt>&lt;=.</tt>
! </p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Ammend [list.capacity] p1:
! </p>
! <blockquote>
! <p><tt>void resize(size_type sz);</tt></p>
! <blockquote><p>
! <i>Effects</i>: If <tt>sz &lt;<ins>=</ins> size()</tt>, equivalent to <tt>list&lt;T&gt;::iterator
! it = begin(); advance(it, sz); erase(it, end());</tt>. If
! <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> <del>default constructed</del>
! <ins>value initialized</ins> elements to the sequence<del></del>.
! </p></blockquote>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1421"></a>1421. Accidental move-only library types due to new core language rules</h3>
! <p><b>Section:</b> 23.6 [container.adaptors] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> DIN <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1350">1350</a></p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses DE-22, CH-15</b></p>
! <p>
! With the final acceptance of move operations as special
! members and introduction of corresponding suppression
! rules of implicitly generated copy operations the some
! library types that were copyable in C++03 are no longer
! copyable (only movable) in C++03, among them <tt>queue</tt>,
! <tt>priority_queue</tt>, and <tt>stack</tt>.
! </p>
! 
! <p><i>[
! 2010-10-26: Daniel comments:
! ]</i></p>
! 
! 
! <p>
! Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3112.pdf">n3112</a> should fix this.
! </p>
! 
! <p><i>[2011-02-17: Lawrence comments:]</i></p>
! 
! 
! <p>
! The only open issue in CH 15 with respect to the concurrency group
! was the treatment of <tt>atomic_future</tt>. Since we removed <tt>atomic_future</tt>
! in Batavia, I think all that remains is to remove the open issue from 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3112.pdf">N3112</a> and adopt it.
! </p>
! 
! <p><i>[2011-03-23 Madrid meeting]</i></p>
! 
! 
! <p>Resolved by N3264</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3112.pdf">n3112</a>
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1423"></a>1423. <tt>map</tt> constructor accepting an allocator as single parameter should be explicit</h3>
! <p><b>Section:</b> 23.4.4 [map] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#map">issues</a> in [map].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-6</b></p>
  
! <p>
! Constructor accepting an allocator as a single parameter should be qualified as explicit.</p>
! <pre>
! namespace std {
  template &lt;class Key, class T, class Compare =
  less&lt;Key&gt;,
  class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
*************** Resolved in Rapperswil by a motion to di
*** 81020,81034 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add explicit.
! <pre>namespace std {
  template &lt;class Key, class T, class Compare =
  less&lt;Key&gt;,
  class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
  class map {
  public:
  ...
! explicit map(const Allocator&amp;);
  </pre>
  
  
--- 92995,93010 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add explicit.</p>
! <pre>
! namespace std {
  template &lt;class Key, class T, class Compare =
  less&lt;Key&gt;,
  class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
  class map {
  public:
  ...
! <ins>explicit</ins> map(const Allocator&amp;);
  </pre>
  
  
*************** explicit map(const Allocator&amp;);
*** 81036,81048 ****
  
  
  <hr>
! <h3><a name="1424"></a>1424. [FCD] Ballot Comment JP-7</h3>
! <p><b>Section:</b> 23.6.2 [multimap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 93012,93028 ----
  
  
  <hr>
! <h3><a name="1424"></a>1424. <tt>multimap</tt> constructor accepting an allocator as a single parameter should be explicit</h3>
! <p><b>Section:</b> 23.4.5 [multimap] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
+ <p><b>Addresses JP-7</b></p>
+ 
+ <p>
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 81052,81066 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add explicit.
! <pre>namespace std {
  template &lt;class Key, class T, class Compare =
  less&lt;Key&gt;,
  class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
  class multimap {
  public:
  ...
! explicit multimap(const Allocator&amp;);
  </pre>
  
  
--- 93032,93047 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add explicit.</p>
! <pre>
! namespace std {
  template &lt;class Key, class T, class Compare =
  less&lt;Key&gt;,
  class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt;
  class multimap {
  public:
  ...
! <ins>explicit</ins> multimap(const Allocator&amp;);
  </pre>
  
  
*************** explicit multimap(const Allocator&amp;);
*** 81068,81082 ****
  
  
  <hr>
! <h3><a name="1425"></a>1425. [FCD] Ballot Comment JP-8</h3>
! <p><b>Section:</b> 23.6.3 [set] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#set">issues</a> in [set].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-8</b></p>
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 93049,93066 ----
  
  
  <hr>
! <h3><a name="1425"></a>1425. <tt>set</tt> constructor accepting an allocator as a single parameter should be explicit</h3>
! <p><b>Section:</b> 23.4.6 [set] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#set">issues</a> in [set].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-8</b></p>
+ 
+ <p>
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 81086,81099 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add explicit.
! <pre>namespace std {
  template &lt;class Key, class Compare = less&lt;Key&gt;,
  class Allocator = allocator&lt;Key&gt; &gt;
  class set {
  public:
  ...
! explicit set(const Allocator&amp;);
  </pre>
  
  
--- 93070,93084 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add explicit.</p>
! <pre>
! namespace std {
  template &lt;class Key, class Compare = less&lt;Key&gt;,
  class Allocator = allocator&lt;Key&gt; &gt;
  class set {
  public:
  ...
! <ins>explicit</ins> set(const Allocator&amp;);
  </pre>
  
  
*************** explicit set(const Allocator&amp;);
*** 81101,81115 ****
  
  
  <hr>
! <h3><a name="1426"></a>1426. [FCD] Ballot Comment JP-9</h3>
! <p><b>Section:</b> 23.6.4 [multiset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-9</b></p>
  
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 93086,93102 ----
  
  
  <hr>
! <h3><a name="1426"></a>1426. <tt>multiset</tt> constructor accepting an allocator as a single parameter should be explicit</h3>
! <p><b>Section:</b> 23.4.7 [multiset] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-9</b></p>
  
+ <p>
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 81119,81132 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add explicit.
! <pre>namespace std {
  template &lt;class Key, class Compare = less&lt;Key&gt;,
  class Allocator = allocator&lt;Key&gt; &gt;
  class multiset {
  public:
  ...
! explicit multiset(const Allocator&amp;);
  </pre>
  
  
--- 93106,93120 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add explicit.</p>
! <pre>
! namespace std {
  template &lt;class Key, class Compare = less&lt;Key&gt;,
  class Allocator = allocator&lt;Key&gt; &gt;
  class multiset {
  public:
  ...
! <ins>explicit</ins> multiset(const Allocator&amp;);
  </pre>
  
  
*************** explicit multiset(const Allocator&amp;);
*** 81134,81149 ****
  
  
  <hr>
! <h3><a name="1427"></a>1427. [FCD] Ballot Comment JP-10</h3>
! <p><b>Section:</b> 23.7.1 [unord.map] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.map">issues</a> in [unord.map].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-10</b></p>
  
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 93122,93139 ----
  
  
  <hr>
! <h3><a name="1427"></a>1427. <tt>unordered_map</tt> constructor accepting an allocator as a single parameter should be explicit</h3>
! <p><b>Section:</b> 23.5.4 [unord.map] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.map">issues</a> in [unord.map].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-10</b></p>
  
+ <p>
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 81153,81160 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add explicit.
! <pre>namespace std {
  template &lt;class Key,
  template &lt;class Key,
  class T,
--- 93143,93151 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add explicit.</p>
! <pre>
! namespace std {
  template &lt;class Key,
  template &lt;class Key,
  class T,
*************** class unordered_map
*** 81166,81172 ****
  {
  public:
  ...
! explicit unordered_map(const Allocator&amp;);
  </pre>
  
  
--- 93157,93163 ----
  {
  public:
  ...
! <ins>explicit</ins> unordered_map(const Allocator&amp;);
  </pre>
  
  
*************** explicit unordered_map(const Allocator&a
*** 81174,81188 ****
  
  
  <hr>
! <h3><a name="1428"></a>1428. [FCD] Ballot Comment JP-11</h3>
! <p><b>Section:</b> 23.7.2 [unord.multimap] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-11</b></p>
  
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 93165,93181 ----
  
  
  <hr>
! <h3><a name="1428"></a>1428. <tt>unordered_multimap</tt> constructor accepting an allocator as a single parameter should be explicit</h3>
! <p><b>Section:</b> 23.5.5 [unord.multimap] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-11</b></p>
  
+ <p>
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 81192,81199 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add explicit.
! <pre>namespace std {
  template &lt;class Key,
  class T,
  class Hash = hash&lt;Key&gt;,
--- 93185,93193 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add explicit.</p>
! <pre>
! namespace std {
  template &lt;class Key,
  class T,
  class Hash = hash&lt;Key&gt;,
*************** class unordered_multimap
*** 81204,81210 ****
  {
  public:
  ...
! explicit unordered_multimap(const Allocator&amp;);
  </pre>
  
  
--- 93198,93204 ----
  {
  public:
  ...
! <ins>explicit</ins> unordered_multimap(const Allocator&amp;);
  </pre>
  
  
*************** explicit unordered_multimap(const Alloca
*** 81212,81226 ****
  
  
  <hr>
! <h3><a name="1429"></a>1429. [FCD] Ballot Comment JP-12</h3>
! <p><b>Section:</b> 23.7.3 [unord.set] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-12</b></p>
  
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 93206,93222 ----
  
  
  <hr>
! <h3><a name="1429"></a>1429. <tt>unordered_set</tt> constructor accepting an allocator as a single parameter should be explicit</h3>
! <p><b>Section:</b> 23.5.6 [unord.set] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-12</b></p>
  
+ <p>
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 81230,81237 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add explicit.
! <pre>namespace std {
  template &lt;class Key,
  class Hash = hash&lt;Key&gt;,
  class Pred = std::equal_to&lt;Key&gt;,
--- 93226,93234 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add explicit.</p>
! <pre>
! namespace std {
  template &lt;class Key,
  class Hash = hash&lt;Key&gt;,
  class Pred = std::equal_to&lt;Key&gt;,
*************** class unordered_set
*** 81240,81246 ****
  {
  public:
  ...
! explicit unordered_set(const Allocator&amp;);
  </pre>
  
  
--- 93237,93243 ----
  {
  public:
  ...
! <ins>explicit</ins> unordered_set(const Allocator&amp;);
  </pre>
  
  
*************** explicit unordered_set(const Allocator&a
*** 81248,81262 ****
  
  
  <hr>
! <h3><a name="1430"></a>1430. [FCD] Ballot Comment JP-13</h3>
! <p><b>Section:</b> 23.7.4 [unord.multiset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-10-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-13</b></p>
  
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 93245,93261 ----
  
  
  <hr>
! <h3><a name="1430"></a>1430. <tt>unordered_multiset</tt> constructor accepting an allocator as a single parameter should be explicit</h3>
! <p><b>Section:</b> 23.5.7 [unord.multiset] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Japan <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses JP-13</b></p>
  
+ <p>
  Constructor accepting an allocator as a single parameter
  should be qualified as explicit.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 81266,81273 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Add explicit.
! <pre>namespace std {
  template &lt;class Key,
  class Hash = hash&lt;Key&gt;,
  class Pred = std::equal_to&lt;Key&gt;,
--- 93265,93273 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Add explicit.</p>
! <pre>
! namespace std {
  template &lt;class Key,
  class Hash = hash&lt;Key&gt;,
  class Pred = std::equal_to&lt;Key&gt;,
*************** explicit unordered_multiset(const Alloca
*** 81284,81299 ****
  
  
  <hr>
! <h3><a name="1431"></a>1431. [FCD] Ballot Comment US-120</h3>
! <p><b>Section:</b> 25.2.12 [alg.is_permutation] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-120</b></p>
  
! is_permutation is underspecified for anything but the
  simple case where both ranges have the same value type
  and the comparison function is an equivalence relation.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 93284,93301 ----
  
  
  <hr>
! <h3><a name="1431"></a>1431. <tt>is_permutation</tt> must be more restrictive</h3>
! <p><b>Section:</b> 25.2.12 [alg.is_permutation] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-120</b></p>
  
! <p>
! <tt>is_permutation</tt> is underspecified for anything but the
  simple case where both ranges have the same value type
  and the comparison function is an equivalence relation.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 81302,81330 ****
  
  
  
! <p><b>Proposed resolution:</b></p>
! Restrict is_permutation to the case where it is well
  specified. See Appendix 1 - Additional Details
! 
  
  
  
  
  <hr>
! <h3><a name="1432"></a>1432. [FCD] random_shuffle signatures</h3>
! <p><b>Section:</b> 25.3.12 [alg.random.shuffle] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#alg.random.shuffle">issues</a> in [alg.random.shuffle].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1433">1433</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-121, GB-119</b></p>
  
  <p>
  <tt>random_shuffle</tt> and <tt>shuffle</tt> should be consistent in how
! they accept their source of randomness: either both by
! rvalue reference or both by lvalue reference.
  </p>
  
  <p><i>[
--- 93304,93332 ----
  
  
  
! <p><b>Proposed resolution:</b></p><p>
! Restrict <tt>is_permutation</tt> to the case where it is well
  specified. See Appendix 1 - Additional Details
! </p>
  
  
  
  
  <hr>
! <h3><a name="1432"></a>1432. <tt>random_shuffle</tt> signatures are inconsistent</h3>
! <p><b>Section:</b> 25.3.12 [alg.random.shuffle] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.random.shuffle">issues</a> in [alg.random.shuffle].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1433">1433</a></p>
  <p><b>Discussion:</b></p>
  
  <p><b>Addresses US-121, GB-119</b></p>
  
  <p>
  <tt>random_shuffle</tt> and <tt>shuffle</tt> should be consistent in how
! they accept their source of randomness: either both by rvalue reference or 
! both by lvalue reference.
  </p>
  
  <p><i>[
*************** The signatures of the <tt>shuffle</tt> a
*** 81337,81357 ****
  in regard to the support of rvalues and lvalues of the provided generator:
  </p>
  
! <p>
! </p><blockquote><pre>template&lt;class RandomAccessIterator, class RandomNumberGenerator&gt;
  void random_shuffle(RandomAccessIterator first,
  RandomAccessIterator last,
  RandomNumberGenerator<b>&amp;&amp;</b> rand);
  </pre></blockquote>
- <p></p>
  
! <p>
! </p><blockquote><pre>template&lt;class RandomAccessIterator, class UniformRandomNumberGenerator&gt;
  void shuffle(RandomAccessIterator first,
  RandomAccessIterator last,
  UniformRandomNumberGenerator<b>&amp;</b> g);
  </pre></blockquote>
- <p></p>
  
  <p>
  The first form uses the perfect forwarding signature and that change compared to
--- 93339,93357 ----
  in regard to the support of rvalues and lvalues of the provided generator:
  </p>
  
! <blockquote><pre>
! template&lt;class RandomAccessIterator, class RandomNumberGenerator&gt;
  void random_shuffle(RandomAccessIterator first,
  RandomAccessIterator last,
  RandomNumberGenerator<b>&amp;&amp;</b> rand);
  </pre></blockquote>
  
! <blockquote><pre>
! template&lt;class RandomAccessIterator, class UniformRandomNumberGenerator&gt;
  void shuffle(RandomAccessIterator first,
  RandomAccessIterator last,
  UniformRandomNumberGenerator<b>&amp;</b> g);
  </pre></blockquote>
  
  <p>
  The first form uses the perfect forwarding signature and that change compared to
*************** While it is true, that random generators
*** 81364,81371 ****
  functors, there still exist good reasons to support rvalues as arguments:
  </p>
  
! <p>
! </p><ol>
  <li>If one of the shuffle algorithms is called with the intention to shuffle items with a reproducible ordering 
  	from a given generator class, it makes sense to create a generator exactly at the call point.
  </li>
--- 93364,93370 ----
  functors, there still exist good reasons to support rvalues as arguments:
  </p>
  
! <ol>
  <li>If one of the shuffle algorithms is called with the intention to shuffle items with a reproducible ordering 
  	from a given generator class, it makes sense to create a generator exactly at the call point.
  </li>
*************** unintentionally. Any lvalue generator wi
*** 81377,81401 ****
  cases, where rvalues are provided, the argument will be accepted instead of being rejected.
  </li>
  </ol>
- <p></p>
  
  <p>
  Arguments have been raised that accepting rvalues is error-prone or even fundamentally wrong. The author of this 
  proposal disagrees with that position for two additional reasons:
  </p>
  
! <p>
! </p><ol>
  <li>Enforcing lvalues as arguments won't prevent user code to enforce what they
  want. So given
! <blockquote><pre>my_generator get_generator(int size);
  </pre></blockquote>
  instead of writing
! <blockquote><pre>std::vector&lt;int&gt; v = ...;
  std::shuffle(v.begin(), v.end(), get_generator(v.size()));
  </pre></blockquote>
  they will just write
! <blockquote><pre>std::vector&lt;int&gt; v = ...;
  auto gen = get_generator(v.size());
  std::shuffle(v.begin(), v.end(), gen);
  </pre></blockquote>
--- 93376,93401 ----
  cases, where rvalues are provided, the argument will be accepted instead of being rejected.
  </li>
  </ol>
  
  <p>
  Arguments have been raised that accepting rvalues is error-prone or even fundamentally wrong. The author of this 
  proposal disagrees with that position for two additional reasons:
  </p>
  
! <ol>
  <li>Enforcing lvalues as arguments won't prevent user code to enforce what they
  want. So given
! <blockquote><pre>
! my_generator get_generator(int size);
  </pre></blockquote>
  instead of writing
! <blockquote><pre>
! std::vector&lt;int&gt; v = ...;
  std::shuffle(v.begin(), v.end(), get_generator(v.size()));
  </pre></blockquote>
  they will just write
! <blockquote><pre>
! std::vector&lt;int&gt; v = ...;
  auto gen = get_generator(v.size());
  std::shuffle(v.begin(), v.end(), gen);
  </pre></blockquote>
*************** Therefore preventing <tt>[random_]shuffl
*** 81409,81423 ****
  user-error, if there would exist one.
  </li>
  </ol>
- <p></p>
  
  <p>
  Thus this proposal recommends to make both <tt>shuffle</tt> functions consistent and perfectly forward-able.
  </p>
  
! <blockquote>
  Moved to Tentatively Ready after 6 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 93409,93422 ----
  user-error, if there would exist one.
  </li>
  </ol>
  
  <p>
  Thus this proposal recommends to make both <tt>shuffle</tt> functions consistent and perfectly forward-able.
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready after 6 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 81430,81442 ****
  
  <ol>
  <li>Change [algorithms.general], header <tt>&lt;algorithm&gt;</tt> synopsis as indicated:
! <blockquote><pre>template&lt;class RandomAccessIterator, class UniformRandomNumberGenerator&gt;
  void shuffle(RandomAccessIterator first, RandomAccessIterator last,
  UniformRandomNumberGenerator&amp;<ins>&amp;</ins> rand);
  </pre></blockquote>
  </li>
  <li>Change the prototype description of [alg.random.shuffle] as indicated:
! <blockquote><pre>template&lt;class RandomAccessIterator, class UniformRandomNumberGenerator&gt;
  void shuffle(RandomAccessIterator first, RandomAccessIterator last,
  UniformRandomNumberGenerator&amp;<ins>&amp;</ins> rand);
  </pre></blockquote>
--- 93429,93443 ----
  
  <ol>
  <li>Change [algorithms.general], header <tt>&lt;algorithm&gt;</tt> synopsis as indicated:
! <blockquote><pre>
! template&lt;class RandomAccessIterator, class UniformRandomNumberGenerator&gt;
  void shuffle(RandomAccessIterator first, RandomAccessIterator last,
  UniformRandomNumberGenerator&amp;<ins>&amp;</ins> rand);
  </pre></blockquote>
  </li>
  <li>Change the prototype description of [alg.random.shuffle] as indicated:
! <blockquote><pre>
! template&lt;class RandomAccessIterator, class UniformRandomNumberGenerator&gt;
  void shuffle(RandomAccessIterator first, RandomAccessIterator last,
  UniformRandomNumberGenerator&amp;<ins>&amp;</ins> rand);
  </pre></blockquote>
*************** UniformRandomNumberGenerator&amp;<ins>&a
*** 81449,81462 ****
  
  
  <hr>
! <h3><a name="1435"></a>1435. [FCD] Unclear returns specifications for C99 complex number functions</h3>
! <p><b>Section:</b> 26.4.7 [complex.value.ops] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#complex.value.ops">issues</a> in [complex.value.ops].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-120</b></p>
  
  The complex number functions added for compatibility
  with the C99 standard library are defined purely as a
  cross-reference, with no hint of what they should return.
--- 93450,93464 ----
  
  
  <hr>
! <h3><a name="1435"></a>1435. Unclear returns specifications for C99 complex number functions</h3>
! <p><b>Section:</b> 26.4.7 [complex.value.ops] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.value.ops">issues</a> in [complex.value.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-120</b></p>
  
+ <p>
  The complex number functions added for compatibility
  with the C99 standard library are defined purely as a
  cross-reference, with no hint of what they should return.
*************** the name, this is not true of the cproj
*** 81468,81473 ****
--- 93470,93476 ----
  apparently returns the projection on the Reimann Sphere.
  A single line description of each function, associated with
  the cross-reference, will greatly improve clarity.
+ </p>
  
  <p><i>[2010-11-06 Beman provides proposed resolution wording.]</i></p>
  
*************** Adopted at 2010-11 Batavia
*** 81567,81580 ****
  
  
  <hr>
! <h3><a name="1436"></a>1436. [FCD] Random number engine constructor concerns</h3>
! <p><b>Section:</b> 26.5.3 [rand.eng] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.eng">issues</a> in [rand.eng].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-121</b></p>
  
  All the random number engine types in this clause have a
  constructor taking an unsigned integer type, and a
  constructor template for seed sequences. This means that
--- 93570,93584 ----
  
  
  <hr>
! <h3><a name="1436"></a>1436. Random number engine constructor concerns</h3>
! <p><b>Section:</b> 26.5.3 [rand.eng] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.eng">issues</a> in [rand.eng].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-121</b></p>
  
+ <p>
  All the random number engine types in this clause have a
  constructor taking an unsigned integer type, and a
  constructor template for seed sequences. This means that
*************** helpful if at least these anticipated ca
*** 81587,81592 ****
--- 93591,93597 ----
  defined behaviour, either an erroneous program with
  diagnostic, or a conversion to unsigned int forwarding to
  the appropriate constructor.
+ </p>
  
  <p><i>[
  2010-11-03 Daniel comments and provides a proposed resolution:
*************** the appropriate constructor.
*** 81594,81600 ****
  
  
  <p>
! I suggest to apply a similar solution as recently suggested for <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1234">1234</a>.
  It is basically a requirement for an implementation to constrain the template.
  </p>
  
--- 93599,93605 ----
  
  
  <p>
! I suggest to apply a similar solution as recently suggested for <a href="lwg-defects.html#1234">1234</a>.
  It is basically a requirement for an implementation to constrain the template.
  </p>
  
*************** Adopted at 2010-11 Batavia
*** 81622,81657 ****
  
  
  <p><b>Proposed resolution:</b></p>
  Add the following paragraph at the end of 26.5.3 [rand.eng]:
  <blockquote>
! <blockquote>
  5 Each template specified in this section [rand.eng] requires one or more relationships, involving the value(s) of
  its non-type template parameter(s), to hold. A program instantiating any of these templates is ill-formed if
  any such required relationship fails to hold.
! </blockquote>
  
! <blockquote>
  <ins>? For every random number engine and for every random number engine adaptor <tt>X</tt> defined in this sub-clause 
! [rand.eng] and in sub-clause [rand.adapt]:</ins>
  <ul>
  <li><ins>If the constructor</ins>
! <blockquote><pre><ins>template&lt;class Sseq&gt; explicit X(Sseq&amp; q);</ins>
! </pre></blockquote>
  <ins>is called with a type <tt>Sseq</tt> that does not qualify as a seed sequence, then this constructor 
  shall not participate in overload resolution.
! </ins>
  </li>
  <li><ins>If the member function</ins>
! <blockquote><pre><ins>template&lt;class Sseq&gt; void seed(Sseq&amp; q);</ins>
! </pre></blockquote>
  <ins>is called with a type <tt>Sseq</tt> that does not qualify as a seed sequence, then this function 
  shall not participate in overload resolution.
! </ins>
  </li>
  </ul>
  <ins>The extent to which an implementation determines that a type cannot be a seed sequence is unspecified,
  except that as a minimum a type shall not qualify as seed sequence, if it is implicitly convertible
  to <tt>X::result_type</tt>.</ins>
  </blockquote>
  
  </blockquote>
--- 93627,93668 ----
  
  
  <p><b>Proposed resolution:</b></p>
+ <p>
  Add the following paragraph at the end of 26.5.3 [rand.eng]:
+ </p>
  <blockquote>
! <blockquote><p>
  5 Each template specified in this section [rand.eng] requires one or more relationships, involving the value(s) of
  its non-type template parameter(s), to hold. A program instantiating any of these templates is ill-formed if
  any such required relationship fails to hold.
! </p></blockquote>
  
! <blockquote><p>
  <ins>? For every random number engine and for every random number engine adaptor <tt>X</tt> defined in this sub-clause 
! [rand.eng] and in sub-clause [rand.adapt]:</ins></p>
  <ul>
  <li><ins>If the constructor</ins>
! <blockquote><pre>
! <ins>template&lt;class Sseq&gt; explicit X(Sseq&amp; q);</ins>
! </pre></blockquote><p>
  <ins>is called with a type <tt>Sseq</tt> that does not qualify as a seed sequence, then this constructor 
  shall not participate in overload resolution.
! </ins></p>
  </li>
  <li><ins>If the member function</ins>
! <blockquote><pre>
! <ins>template&lt;class Sseq&gt; void seed(Sseq&amp; q);</ins>
! </pre></blockquote><p>
  <ins>is called with a type <tt>Sseq</tt> that does not qualify as a seed sequence, then this function 
  shall not participate in overload resolution.
! </ins></p>
  </li>
  </ul>
+ <p>
  <ins>The extent to which an implementation determines that a type cannot be a seed sequence is unspecified,
  except that as a minimum a type shall not qualify as seed sequence, if it is implicitly convertible
  to <tt>X::result_type</tt>.</ins>
+ </p>
  </blockquote>
  
  </blockquote>
*************** to <tt>X::result_type</tt>.</ins>
*** 81661,81685 ****
  
  
  <hr>
! <h3><a name="1437"></a>1437. [FCD] Mersenne twister meaningless for word sizes less than two</h3>
! <p><b>Section:</b> 26.5.3.2 [rand.eng.mers] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.eng.mers">issues</a> in [rand.eng.mers].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-124</b></p>
  
  The Mersenne twister algorithm is meaningless for word
  sizes less than two, as there are then insufficient bits
! available to be “twisted”.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  Insert the following among the relations that are required to hold: <tt>2u &lt; w</tt>.
! </blockquote>
  
  <p><i>[
  2010 Batavia: The working group concurred with the issue's Proposed Resolution
--- 93672,93698 ----
  
  
  <hr>
! <h3><a name="1437"></a>1437. Mersenne twister meaningless for word sizes less than two</h3>
! <p><b>Section:</b> 26.5.3.2 [rand.eng.mers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.eng.mers">issues</a> in [rand.eng.mers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-124</b></p>
  
+ <p>
  The Mersenne twister algorithm is meaningless for word
  sizes less than two, as there are then insufficient bits
! available to be &#8220;twisted&#8221;.
! </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  Insert the following among the relations that are required to hold: <tt>2u &lt; w</tt>.
! </p></blockquote>
  
  <p><i>[
  2010 Batavia: The working group concurred with the issue's Proposed Resolution
*************** Adopted at 2010-11 Batavia
*** 81694,81723 ****
  
  
  <p><b>Proposed resolution:</b></p>
- Change 26.5.3.2 [rand.eng.mers] p. 4 as indicated:
  <p>
! </p><blockquote>
  4 The following relations shall hold: <tt>0 &lt; m</tt>, <tt>m &lt;= n</tt>, <ins><tt>2u &lt; w</tt>,</ins>
  <tt>r &lt;= w</tt>, <tt>u &lt;= w</tt>, <tt>s &lt;= w</tt>, <tt>t &lt;= w</tt>, 
  <tt>l &lt;= w</tt>, <tt>w &lt;= numeric_limits&lt;UIntType&gt;::digits</tt>, 
  <tt>a &lt;= (1u&lt;&lt;w) - 1u</tt>, <tt>b &lt;= (1u&lt;&lt;w) - 1u</tt>, 
  <tt>c &lt;= (1u&lt;&lt;w) - 1u</tt>, <tt>d &lt;= (1u&lt;&lt;w) - 1u</tt>, 
  and <tt>f &lt;= (1u&lt;&lt;w) - 1u</tt>.
  </blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1439"></a>1439. [FCD] Return from <tt>densities()</tt> functions?</h3>
! <p><b>Section:</b> 26.5.8.5.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-134</b></p>
  
  These two distributions have a member function called
  <tt>densities()</tt> which returns a <tt>vector&lt;double&gt;</tt>. The
  distribution is templated on <tt>RealType</tt>. The distribution
--- 93707,93848 ----
  
  
  <p><b>Proposed resolution:</b></p>
  <p>
! Change 26.5.3.2 [rand.eng.mers] p. 4 as indicated:
! </p>
! <blockquote><p>
  4 The following relations shall hold: <tt>0 &lt; m</tt>, <tt>m &lt;= n</tt>, <ins><tt>2u &lt; w</tt>,</ins>
  <tt>r &lt;= w</tt>, <tt>u &lt;= w</tt>, <tt>s &lt;= w</tt>, <tt>t &lt;= w</tt>, 
  <tt>l &lt;= w</tt>, <tt>w &lt;= numeric_limits&lt;UIntType&gt;::digits</tt>, 
  <tt>a &lt;= (1u&lt;&lt;w) - 1u</tt>, <tt>b &lt;= (1u&lt;&lt;w) - 1u</tt>, 
  <tt>c &lt;= (1u&lt;&lt;w) - 1u</tt>, <tt>d &lt;= (1u&lt;&lt;w) - 1u</tt>, 
  and <tt>f &lt;= (1u&lt;&lt;w) - 1u</tt>.
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1438"></a>1438. No definition for <tt>base()</tt></h3>
+ <p><b>Section:</b> 26.5.4.2 [rand.adapt.disc] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#rand.adapt.disc">issues</a> in [rand.adapt.disc].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses US-126</b></p>
+ 
+ <p>Each adaptor has a member function called <tt>base()</tt> which has no definition.</p>
+ 
+ <p><i>[
+ Resolution proposed by ballot comment:
+ ]</i></p>
+ 
+ <blockquote><p>
+ Give it the obvious definition.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010-11-03 Daniel comments and provides a proposed resolution:
+ ]</i></p>
+ 
+ 
+ <p>The following proposal adds <tt>noexcept</tt> specifiers to the declarations of
+ the <tt>base()</tt> functions as replacement for a &quot;<i>Throws</i>: Nothing&quot; element.
+ </p>
+ 
+ <p><i>[
+ 2010 Batavia: The working group reviewed this issue, and recommended to add the following to the Proposed Resolution.
+ ]</i></p>
+ 
+ <ul><li>
+ Append to paragraph 1 of [rand.req.adapt] (or at the Editor's discretion insert as a new paragraph following that paragraph): 
+ The expression <tt>a.base()</tt> shall be valid and shall return a const reference to <tt>a</tt>'s base engine. 
+ </li>
+ </ul>
+ <p>
+ After further review, the working group concurred with the Proposed Resolution.
+ </p>
+ 
+ 
+ <p><i>[Batavia: waiting for WEB to review wording]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <ol>
+ <li>
+ Add the following sentence to the end of 26.5.1.5 [rand.req.adapt]/1:
+ <blockquote><p>
+ A <i>random number engine adaptor</i> (commonly shortened to <i>adaptor</i>) <tt>a</tt> of type <tt>A</tt> is a
+ random number engine that takes values produced by some other random number engine, and applies an algorithm to
+ those values in order to deliver a sequence of values with different randomness properties. An engine <tt>b</tt>
+ of type <tt>B</tt> adapted in this way is termed a <i>base engine</i> in this context.<ins> The expression
+ <tt>a.base()</tt> shall be valid and shall return a const reference to <tt>a</tt>'s base engine.</ins>
+ </p></blockquote>
+ </li>
+ <li>Change in [rand.adapt.disc]/3, class template <tt>discard_block_engine</tt> synopsis, the following declaration:
+ <blockquote><pre>
+ // <em>property functions</em>
+ const Engine&amp; base() const <ins>noexcept</ins>;
+ </pre></blockquote>
+ </li>
+ <li>Add the following new prototype description at the end of sub-clause 26.5.4.2 [rand.adapt.disc]:
+ <blockquote>
+ <pre><ins>const Engine&amp; base() const noexcept;</ins>
+ </pre>
+ <blockquote><p>
+ <ins>? <i>Returns</i>: <tt>e</tt>.</ins>
+ </p></blockquote>
  </blockquote>
+ </li>
+ <li>Change in [rand.adapt.ibits]/4, class template <tt>independent_bits_engine</tt> synopsis, the following declaration:
+ <blockquote><pre>
+ // <em>property functions</em>
+ const Engine&amp; base() const <ins>noexcept</ins>;
+ </pre></blockquote>
+ </li>
+ <li>Add the following new prototype description at the end of sub-clause 26.5.4.3 [rand.adapt.ibits]:
+ <blockquote>
+ <pre><ins>const Engine&amp; base() const noexcept;</ins>
+ </pre>
+ <blockquote><p>
+ <ins>? <i>Returns</i>: <tt>e</tt>.</ins>
+ </p></blockquote>
+ </blockquote>
+ </li>
+ <li>Change in 26.5.4.4 [rand.adapt.shuf]/3, class template <tt>shuffle_order_engine</tt> synopsis, the following declaration:
+ <blockquote><pre>
+ // <em>property functions</em>
+ const Engine&amp; base() const <ins>noexcept</ins>;
+ </pre></blockquote>
+ </li>
+ <li>Add the following new prototype description at the end of sub-clause 26.5.4.4 [rand.adapt.shuf]:
+ <blockquote>
+ <pre><ins>const Engine&amp; base() const noexcept;</ins>
+ </pre>
+ <blockquote><p>
+ <ins>? <i>Returns</i>: <tt>e</tt>.</ins>
+ </p></blockquote>
+ </blockquote>
+ </li>
+ </ol>
  
  
  
  
  
  <hr>
! <h3><a name="1439"></a>1439. Return from <tt>densities()</tt> functions?</h3>
! <p><b>Section:</b> 26.5.8.6.2 [rand.dist.samp.pconst] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.dist.samp.pconst">issues</a> in [rand.dist.samp.pconst].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-134</b></p>
  
+ <p>
  These two distributions have a member function called
  <tt>densities()</tt> which returns a <tt>vector&lt;double&gt;</tt>. The
  distribution is templated on <tt>RealType</tt>. The distribution
*************** a <tt>vector&lt;RealType&gt;</tt>. Why d
*** 81727,81750 ****
  the computed densities property isn't being computed to
  the precision the client desires. If <tt>RealType</tt> is <tt>float</tt>, the
  densities vector is taking up twice as much space as the client desires.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  <blockquote>
  Change the piecewise constant and linear
  distributions to hold / return the densities in a
  <tt>vector&lt;result_type&gt;</tt>.
! <p>
! If this is not done, at least correct 26.5.8.5.2 [rand.dist.samp.pconst] p. 13 which describes
  the return of densities as a <tt>vector&lt;result_type&gt;</tt>.
  </p></blockquote>
  
  <p><i>[
  Batavia 2010: After reviewing this issue, the working group concurred with the first of the 
  suggestions proposed by the NB comment: "Change the piecewise constant and linear distributions 
! to hold / return the densities in a vector. "
  ]</i></p>
  
  
--- 93852,93877 ----
  the computed densities property isn't being computed to
  the precision the client desires. If <tt>RealType</tt> is <tt>float</tt>, the
  densities vector is taking up twice as much space as the client desires.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  <blockquote>
+ <p>
  Change the piecewise constant and linear
  distributions to hold / return the densities in a
  <tt>vector&lt;result_type&gt;</tt>.
! <p/>
! If this is not done, at least correct 26.5.8.6.2 [rand.dist.samp.pconst] p. 13 which describes
  the return of densities as a <tt>vector&lt;result_type&gt;</tt>.
  </p></blockquote>
  
  <p><i>[
  Batavia 2010: After reviewing this issue, the working group concurred with the first of the 
  suggestions proposed by the NB comment: "Change the piecewise constant and linear distributions 
! to hold&#47;return the densities in a vector. "
  ]</i></p>
  
  
*************** Adopted at 2010-11 Batavia
*** 81757,81771 ****
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change 26.5.8.5.2 [rand.dist.samp.pconst] p. 2, class template <tt>piecewise_constant_distribution</tt> synopsis
! and the prototype description 26.5.8.5.2 [rand.dist.samp.pconst] before p. 13 as indicated:
! <blockquote><pre>vector&lt;<del>double</del><ins>result_type</ins>&gt; densities() const;
  </pre></blockquote>
  </li>
  
! <li>Change 26.5.8.5.3 [rand.dist.samp.plinear] p. 2, class template <tt>piecewise_linear_distribution</tt> synopsis
! and the prototype description 26.5.8.5.3 [rand.dist.samp.plinear] before p. 13 as indicated:
! <blockquote><pre>vector&lt;<del>double</del><ins>result_type</ins>&gt; densities() const;
  </pre></blockquote>
  </li>
  </ol>
--- 93884,93900 ----
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change 26.5.8.6.2 [rand.dist.samp.pconst] p. 2, class template <tt>piecewise_constant_distribution</tt> synopsis
! and the prototype description 26.5.8.6.2 [rand.dist.samp.pconst] before p. 13 as indicated:
! <blockquote><pre>
! vector&lt;<del>double</del><ins>result_type</ins>&gt; densities() const;
  </pre></blockquote>
  </li>
  
! <li>Change 26.5.8.6.3 [rand.dist.samp.plinear] p. 2, class template <tt>piecewise_linear_distribution</tt> synopsis
! and the prototype description 26.5.8.6.3 [rand.dist.samp.plinear] before p. 13 as indicated:
! <blockquote><pre>
! vector&lt;<del>double</del><ins>result_type</ins>&gt; densities() const;
  </pre></blockquote>
  </li>
  </ol>
*************** and the prototype description 26.5.8.5.3
*** 81775,81801 ****
  
  
  <hr>
! <h3><a name="1440"></a>1440. [FCD] Incorrect specification for rand.dist.samp.plinear</h3>
! <p><b>Section:</b> 26.5.8.5.3 [rand.dist.samp.plinear] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-135</b></p>
  
! This paragraph says: Let bk = xmin+k·&#948; for k = 0,...,n,
! and wk = fw(bk +&#948;) for k = 0,...,n.
  However I believe that fw(bk) would be far more desirable.
  I strongly suspect that this is nothing but a type-o.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
! Change p. 10 to read:<br>
! Let bk = xmin+k·&#948; for k = 0,...,n, and wk = fw(bk)
  for k = 0,...,n.
! </blockquote>
  
  <p><i>[
  2010-11-02 Daniel translates into a proposed resolution
--- 93904,93932 ----
  
  
  <hr>
! <h3><a name="1440"></a>1440. Incorrect specification for <tt>piecewise_linear_distribution</tt></h3>
! <p><b>Section:</b> 26.5.8.6.3 [rand.dist.samp.plinear] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-135</b></p>
  
! <p>
! This paragraph says: Let bk = xmin+k&middot;&delta; for k = 0,...,n,
! and wk = fw(bk +&delta;) for k = 0,...,n.
  However I believe that fw(bk) would be far more desirable.
  I strongly suspect that this is nothing but a type-o.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
! Change p. 10 to read:<br/>
! Let bk = xmin+k&middot;&delta; for k = 0,...,n, and wk = fw(bk)
  for k = 0,...,n.
! </p></blockquote>
  
  <p><i>[
  2010-11-02 Daniel translates into a proposed resolution
*************** Adopted at 2010-11 Batavia
*** 81815,81841 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Change 26.5.8.5.3 [rand.dist.samp.plinear] p. 10 as indicated:
! <blockquote>
  10 <em>Effects</em>: Constructs a <tt>piecewise_linear_distribution</tt> object with parameters taken or calculated
! from the following values: Let <tt><em>b<sub>k</sub></em> = xmin+<em>k</em>·&#948;</tt> for 
! <tt><em>k</em> = 0, . . . , <em>n</em></tt>, and <tt><em>w<sub>k</sub></em> = fw(<em>b</em><sub><em>k</em></sub><del> +&#948;</del>)</tt> 
! for <tt><em>k</em> = 0, . . . , <em>n</em></tt>.</blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1441"></a>1441. [FCD] Floating-point test functions are incorrectly specified</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-04</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-136</b></p>
  
  Floating-point test functions are incorrectly specified.
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
--- 93946,93976 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 26.5.8.6.3 [rand.dist.samp.plinear] p. 10 as indicated:</p>
! <blockquote><p>
  10 <em>Effects</em>: Constructs a <tt>piecewise_linear_distribution</tt> object with parameters taken or calculated
! from the following values: Let <tt><em>b<sub>k</sub></em> = xmin+<em>k</em>&middot;&delta;</tt> for 
! <tt><em>k</em> = 0, . . . , <em>n</em></tt>, and <tt><em>w<sub>k</sub></em> = fw(<em>b</em><sub><em>k</em></sub><del> +&delta;</del>)</tt> 
! for <tt><em>k</em> = 0, . . . , <em>n</em></tt>.
! </p></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1441"></a>1441. Floating-point test functions are incorrectly specified</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-136</b></p>
  
+ <p>
  Floating-point test functions are incorrectly specified.
+ </p>
  
  <p><i>[
  Resolved in Rapperswil by a motion to directly apply the words from the ballot comment in N3102.
*************** Resolved in Rapperswil by a motion to di
*** 81845,81867 ****
  
  
  <p><b>Proposed resolution:</b></p>
! See Appendix 1 - Additional Details
  
  
  
  
  
  <hr>
! <h3><a name="1445"></a>1445. [FCD] Several iostreams member functions incorrectly specified</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS/PJ Plauger <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-137</b></p>
  
  Several iostreams member functions are incorrectly
  specified.
  
  <p><i>[
  Resolution proposed by ballot comment:
--- 93980,94004 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>See Appendix 1 - Additional Details</p>
  
  
  
  
  
  <hr>
! <h3><a name="1445"></a>1445. Several iostreams member functions incorrectly specified</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS&#47;PJ Plauger <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-137</b></p>
  
+ <p>
  Several iostreams member functions are incorrectly
  specified.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
*************** See Appendix 1 - Additional Details
*** 81876,81928 ****
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a> would solve this issue.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1447"></a>1447. [FCD] Request to resolve issue LWG 1328</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-139</b></p>
  
  Resolve issue LWG 1328 one way or the other, but
  preferably in the direction outlined in the proposed
  resolution, which, however, is not complete as-is: in any
! case, the sentry must not set ok_ = false if is.good() ==
! false, otherwise istream::seekg, being an unformatted
  input function, does not take any action because the
! sentry object returns false when converted to type bool.
  Thus, it remains impossible to seek away from end of file.
  
  
! <p><b>Proposed resolution:</b></p>
  Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1449"></a>1449. [FCD] Incomplete specification of header <tt>&lt;cinttypes&gt;</tt></h3>
! <p><b>Section:</b> 27.8.2 [istringstream] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Canada <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CA-4</b></p>
  
  Subclause 27.9.2 [c.files] specifies that &lt;cinttypes&gt; has
  declarations for abs() and div(); however, the signatures
  are not present in this subclause. The signatures
--- 94013,94269 ----
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a> would solve this issue.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1447"></a>1447. Request to resolve issue LWG 1328</h3>
! <p><b>Section:</b> 27.7 [iostream.format] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostream.format">issues</a> in [iostream.format].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-139</b></p>
  
+ <p>
  Resolve issue LWG 1328 one way or the other, but
  preferably in the direction outlined in the proposed
  resolution, which, however, is not complete as-is: in any
! case, the sentry must not set <tt>ok_ = false</tt> if <tt>is.good() == false</tt>, 
! otherwise <tt>istream::seekg</tt>, being an unformatted
  input function, does not take any action because the
! sentry object returns false when converted to type <tt>bool</tt>.
  Thus, it remains impossible to seek away from end of file.
+ </p>
  
  
! <p><b>Proposed resolution:</b></p><p>
  Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3168.htm">n3168</a>.
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1448"></a>1448. Concerns about <tt>basic_stringbuf::str(basic_string)</tt> postconditions</h3>
+ <p><b>Section:</b> 27.8.2.3 [stringbuf.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-124</b></p>
+ 
+ <p>
+ N3092 27.8.2.3 [stringbuf.members] contains this text specifying the postconditions of
+ <tt>basic_stringbuf::str(basic_string)</tt>:
+ </p>
+ <blockquote><p>
+ Postconditions: If <tt>mode &amp; ios_base::out</tt> is <tt>true</tt>,
+ <tt>pbase()</tt> points to the first underlying character and <tt>epptr() >=
+ pbase() + s.size()</tt> holds; in addition, if <tt>mode &amp; ios_base::in</tt>
+ is <tt>true</tt>, <tt>pptr() == pbase() + s.data()</tt> holds, otherwise
+ <tt>pptr() == pbase()</tt> is <tt>true</tt>. [...]
+ </p></blockquote>
+ <p>
+ Firstly, there's a simple mistake: It should be <tt>pbase() + s.length()</tt>,
+ not <tt>pbase() + s.data()</tt>.
+ </p>
+ <p>
+ Secondly, it doesn't match existing implementations. As far as I can tell,
+ GCC 4.5 does not test for <tt>mode &amp; ios_base::in</tt> in the second part
+ of that sentence, but for <tt>mode &amp; (ios_base::app | ios_base_ate)</tt>,
+ and Visual C++ 9 for <tt>mode &amp; ios_base::app</tt>. Besides, the wording of
+ the C++0x draft doesn't make any sense to me. I suggest changing the second part
+ of the sentence to one of the following:
+ </p>
+ <p>
+ Replace <tt>ios_base::in</tt> with <tt>(ios_base::ate | ios_base::app)</tt>,
+ but this would require Visual C++ to change (replacing only with
+ <tt>ios_base::ate</tt> would require GCC to change, and would make
+ <tt>ios_base::app</tt> completely useless with <tt>stringstreams</tt>):
+ </p>
+ <p>
+ in addition, if <tt>mode &amp; (ios_base::ate | ios_base::app)</tt> is <tt>true</tt>,
+ <tt>pptr() == pbase() + s.length()</tt> holds, otherwise <tt>pptr() == pbase()</tt>
+ is <tt>true</tt>.
+ </p>
+ <p>
+ Leave <tt>pptr()</tt> unspecified if <tt>mode &amp; ios_base::app</tt>, but not
+ <tt>mode &amp; ios_base::ate</tt> (implementations already differ in this case, and it
+ is always possible to use <tt>ios_base::ate</tt> to get the effect of appending, so it
+ is not necessary to require any implementation to change):
+ </p>
+ <p>
+ in addition, if <tt>mode &amp; ios_base::ate</tt> is <tt>true</tt>,
+ <tt>pptr() == pbase() + s.length()</tt> holds, if neither <tt>mode &amp; ios_base::ate</tt>
+ nor <tt>mode &amp; ios_base::app</tt> is <tt>true</tt>, <tt>pptr() == pbase()</tt> holds,
+ otherwise <tt>pptr() >= pbase() &amp;&amp; pptr() &lt;= pbase() + s.length()</tt>
+ (which of the values in this range is unspecified).
+ </p>
+ <p>
+ Slightly stricter:
+ </p>
+ <p>
+ in addition, if <tt>mode &amp; ios_base::ate</tt> is <tt>true</tt>,
+ <tt>pptr() == pbase() + s.length()</tt> holds, if neither
+ <tt>mode &amp; ios_base::ate</tt> nor <tt>mode &amp; ios_base::app</tt> is <tt>true</tt>,
+ <tt>pptr() == pbase()</tt> holds, otherwise <tt>pptr() == pbase() || pptr() == pbase() + s.length()</tt>
+ (which of these two values is unspecified). A small table might help to better explain the three cases.
+ BTW, at the end of the postconditions is this text: &quot;<tt>egptr() == eback() + s.size()</tt> hold&quot;.
+ Is there a perference for <tt>basic_string::length</tt> or <tt>basic_string::size</tt>? It doesn't really
+ matter, but it looks a bit inconsistent.
+ </p>
+ 
+ <p><i>[2011-03-09: Nicolai Josuttis comments and drafts wording]</i></p>
+ 
+ 
+ <p>First, it seems the current wording is just an editorial mistake.
+ When we added issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#432">432</a>
+ to the draft standard (in <a href="http://www.open-std.org/jtc1/sc22/wg21/prot/14882fdis/n1733.pdf">n1733</a>), 
+ the wording in the issue:
+ </p>
+ 
+ <blockquote><p>
+ If <tt>mode &amp; ios_base::out</tt> is true, initializes the output sequence
+ such that <tt>pbase()</tt> points to the first underlying character, <tt>epptr()</tt> 
+ points one past the last underlying character, and if <tt>(mode &amp; ios_base::ate)</tt> is true,
+ <tt>pptr()</tt> is set equal to <tt>epptr()</tt> else <tt>pptr()</tt> is set equal to 
+ <tt>pbase()</tt>.
+ </p></blockquote>
+ 
+ <p>became:</p>
+ 
+ <blockquote><p>
+ If <tt>mode &amp; ios_base::out</tt> is true, initializes the output sequence
+ such that <tt>pbase()</tt> points to the first underlying character, <tt>epptr()</tt> 
+ points one past the last underlying character, and <tt>pptr()</tt> is equal to <tt>epptr()</tt>
+ if <tt>mode &amp; ios_base::in</tt> is true, otherwise <tt>pptr()</tt> is equal to 
+ <tt>pbase()</tt>.
+ </p></blockquote>
+ 
+ <p>
+ which beside some changes of the order of words changed
+ </p>
+ <blockquote><pre>
+ ios_base::ate
+ </pre></blockquote>
+ <p>
+ into
+ </p>
+ <blockquote><pre>
+ ios_base::in
+ </pre></blockquote>
+ <p>
+ So, from this point of view, clearly <tt>mode &amp; ios_base::ate</tt> was meant.
+ </p>
+ 
+ <p>
+ Nevertheless, with this proposed resolution we'd have no wording regarding <tt>ios_base::app</tt>.
+ Currently the only statements about <tt>app</tt> in the Standard are just in two tables:
+ </p>
+ <ul>
+ <li>Table 125 &mdash; &quot;<tt>openmode</tt> effects&quot; says that the effect of 
+ <tt>app</tt> is "seek to end before each write"
+ </li>
+ 
+ <li>Table 132 &mdash; &quot;File open modes&quot; says that the stdio equivalent 
+ for <tt>app</tt> is <tt>"a"</tt>
+ </li>
+ </ul>
+ <p>
+ Indeed we seem to have different behavior currently in respect to <tt>app</tt>: For
+ </p>
+ 
+ <blockquote><pre>
+ stringstream s2(ios_base::out|ios_base::in|ios_base::app);
+ s2.str("s2 hello");
+ s1 &lt;&lt; "more";
+ </pre></blockquote>
+ 
+ <ul>
+ <li>Visual C++ 10 does overwrite (=> <tt>"moreello"</tt>)</li>
+ <li>G++ 4.5 does append (=> <tt>"s2 hellomore"</tt>)</li>
+ </ul>
+ 
+ <p>BTW, for fstreams, both implementations append when <tt>app</tt> is set:
+ If <tt>f2.txt</tt> has contents <tt>"xy"</tt>,</p>
+ 
+ <blockquote><pre>
+ fstream f2("f2.txt",ios_base::out|ios_base::in|ios_base::app);
+ f1 &lt;&lt; "more";
+ </pre></blockquote>
+ 
+ <p>appends <tt>"more"</tt> so that the contents is <tt>"xymore"</tt>.</p>
+ 
+ <p>So IMO <tt>app</tt> should set the write pointer to the end so that each writing 
+ appends.
+ <p/>
+ I don't know whether what the standard says is enough. You can argue the 
+ statement in Table 125 clearly states that such a buffer should always append, 
+ which of course also applies to <tt>str()</tt> of stringbuffer.
+ <p/>
+ Nevertheless, it doesn't hurt IMO if we clarify the behavior of <tt>str()</tt>
+ here in respect to <tt>app</tt>.
+ </p>
+ 
+ <p><i>[2011-03-10: P.J.Plauger comments:]</i></p>
+ 
+ 
+ <p>I think we should say nothing special about <tt>app</tt> at construction
+ time (thus leaving the write pointer at the beginning of the buffer).
+ Leave implementers wiggle room to ensure subsequent append writes as they see 
+ fit, but don't change existing rules for initial seek position.</p>
+ 
+ <p><i>[Madrid meeting: It was observed that a different issue should be opened that
+ clarifies the meaning of <tt>app</tt> for <tt>stringstream</tt>]</i></p>
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ 
+ <p>Change 27.8.2.3 [stringbuf.members] p. 3 as indicated:</p>
+ 
+ <blockquote><pre>
+ void str(const basic_string&lt;charT,traits,Allocator&gt;&amp; s);
+ </pre><blockquote>
+ <p>
+ 2 <i>Effects</i>: Copies the content of <tt>s</tt> into the <tt>basic_stringbuf</tt> 
+ underlying character sequence and initializes the input and output sequences according 
+ to <tt>mode</tt>.
+ <p/>
+ 3 <i>Postconditions</i>: If <tt>mode &amp; ios_base::out</tt> is true, <tt>pbase()</tt> 
+ points to the first underlying character and <tt>epptr() &gt;= pbase() + s.size()</tt> 
+ holds; in addition, if <tt>mode &amp; <del>ios_base::in</del><ins>ios_base::ate</ins></tt> 
+ is true, <tt>pptr() == pbase() + <del>s.data()</del><ins>s.size()</ins></tt> holds, 
+ otherwise <tt>pptr() == pbase()</tt> is true. If <tt>mode &amp; ios_base::in</tt> 
+ is true, <tt>eback()</tt> points to the first underlying character, and both 
+ <tt>gptr() == eback() and egptr() == eback() + s.size()</tt> 
+ hold.
+ </p>
+ </blockquote></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1449"></a>1449. Incomplete specification of header <tt>&lt;cinttypes&gt;</tt></h3>
! <p><b>Section:</b> 27.8.3 [istringstream] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Canada <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CA-4</b></p>
  
+ <p>
  Subclause 27.9.2 [c.files] specifies that &lt;cinttypes&gt; has
  declarations for abs() and div(); however, the signatures
  are not present in this subclause. The signatures
*************** functions, among other things, are not s
*** 81935,81940 ****
--- 94276,94282 ----
  be the functions from Subclause 7.8 of the C Standard.
  Finally, &lt;cinttypes&gt; is not specified in FCD to include
  &lt;cstdint&gt; (whereas &lt;inttypes.h&gt; includes &lt;stdint.h&gt; in C).
+ </p>
  
  <p><i>[
  Post-Rapperswil, Daniel provides wording
*************** FCD to be the functions from subclause 7
*** 81951,81959 ****
  in FCD to include <tt>&lt;cstdint&gt;</tt> (whereas <tt>&lt;inttypes.h&gt;</tt> includes <tt>&lt;stdint.h&gt;</tt> in <tt>C</tt>).
  </p>
  
! <blockquote>
  Moved to Tentatively Ready with proposed wording after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 94293,94301 ----
  in FCD to include <tt>&lt;cstdint&gt;</tt> (whereas <tt>&lt;inttypes.h&gt;</tt> includes <tt>&lt;stdint.h&gt;</tt> in <tt>C</tt>).
  </p>
  
! <blockquote><p>
  Moved to Tentatively Ready with proposed wording after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 81968,81994 ****
  </p>
  <ol>
  <li>Add the following series of new paragraphs following [c.files] p.1:
! <blockquote>
  Table 132 describes header <tt>&lt;cinttypes&gt;</tt>. [<em>Note</em>: The macros defined by <tt>&lt;cinttypes&gt;</tt> are provided unconditionally.
  In particular, the symbol <tt>__STDC_FORMAT_MACROS</tt>, mentioned in footnote 182 of the <tt>C</tt> standard, plays no role in <tt>C++</tt>. 
! — <em>end note</em> ]
! <p>
  <ins>2 - The contents of header <tt>&lt;cinttypes&gt;</tt> are the same as the Standard <tt>C</tt> library header <tt>&lt;inttypes.h&gt;</tt>, 
  with the following changes:</ins>
! </p>
! <p>
  <ins>3 - The header <tt>&lt;cinttypes&gt;</tt> includes the header <tt>&lt;cstdint&gt;</tt> instead of <tt>&lt;stdint.h&gt;</tt>.</ins>
! </p>
! <p>
  <ins>4 - If and only if the type <tt>intmax_t</tt> designates an extended integer type ([basic.fundamental]), the following function 
! signatures are added:
! </ins></p><blockquote><pre><ins>intmax_t abs(intmax_t);</ins>
  <ins>imaxdiv_t div(intmax_t, intmax_t);</ins>
  </pre></blockquote>
  <ins>which shall have the same semantics as the function signatures <tt>intmax_t imaxabs(intmax_t)</tt> and 
  <tt>imaxdiv_t imaxdiv(intmax_t, intmax_t)</tt>, respectively.</ins>
! 
! <p></p>
  </blockquote>
  </li>
  </ol>
--- 94310,94336 ----
  </p>
  <ol>
  <li>Add the following series of new paragraphs following [c.files] p.1:
! <blockquote><p>
  Table 132 describes header <tt>&lt;cinttypes&gt;</tt>. [<em>Note</em>: The macros defined by <tt>&lt;cinttypes&gt;</tt> are provided unconditionally.
  In particular, the symbol <tt>__STDC_FORMAT_MACROS</tt>, mentioned in footnote 182 of the <tt>C</tt> standard, plays no role in <tt>C++</tt>. 
! &mdash; <em>end note</em> ]
! <p/>
  <ins>2 - The contents of header <tt>&lt;cinttypes&gt;</tt> are the same as the Standard <tt>C</tt> library header <tt>&lt;inttypes.h&gt;</tt>, 
  with the following changes:</ins>
! <p/>
  <ins>3 - The header <tt>&lt;cinttypes&gt;</tt> includes the header <tt>&lt;cstdint&gt;</tt> instead of <tt>&lt;stdint.h&gt;</tt>.</ins>
! <p/>
  <ins>4 - If and only if the type <tt>intmax_t</tt> designates an extended integer type ([basic.fundamental]), the following function 
! signatures are added:</ins>
! </p>
! <blockquote><pre>
! <ins>intmax_t abs(intmax_t);</ins>
  <ins>imaxdiv_t div(intmax_t, intmax_t);</ins>
  </pre></blockquote>
+ <p>
  <ins>which shall have the same semantics as the function signatures <tt>intmax_t imaxabs(intmax_t)</tt> and 
  <tt>imaxdiv_t imaxdiv(intmax_t, intmax_t)</tt>, respectively.</ins>
! </p>
  </blockquote>
  </li>
  </ol>
*************** signatures are added:
*** 81998,82057 ****
  
  
  <hr>
! <h3><a name="1453"></a>1453. [FCD] Default constructed match_results behavior for certain operations </h3>
! <p><b>Section:</b> 28.10.4 [re.results.acc] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#re.results.acc">issues</a> in [re.results.acc].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-126</b></p>
  
  It's unclear how match_results should behave if it has
  been default-constructed. The sub_match objects
  returned by operator[], prefix and suffix cannot point to the
  end of the sequence that was searched if no search was
  done. The iterators held by unmatched sub_match objects
  might be singular.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  
! <blockquote>
  Add to match_results::operator[],
! match_results::prefix and match_results::suffix:<br>
  Requires: !empty()
! </blockquote>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3158.html">n3158</a> would solve this issue.
! </blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p>
  Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3158.html">n3158</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1455"></a>1455. [FCD] C language compatibility for atomics</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index-open.html#atomics">active issues</a> in [atomics].</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1454">1454</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-22, GB-128</b></p>
  <p>
  WG14 currently plans to introduce atomic facilities that are
  intended to be compatible with the facilities of clause 29.
--- 94340,94549 ----
  
  
  <hr>
! <h3><a name="1450"></a>1450. Contradiction in <tt>regex_constants</tt></h3>
! <p><b>Section:</b> 28.5.2 [re.matchflag] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-127</b></p>
! 
! <p>
! The Bitmask Type requirements in 17.5.2.1.3 [bitmask.types] p.3 say that
! all elements on a bitmask type have distinct values, but
! 28.5.2 [re.matchflag] defines <tt>regex_constants::match_default</tt> and
! <tt>regex_constants::format_default</tt> as elements of the
! bitmask type <tt>regex_constants::match_flag_type</tt>, both with
! value 0. This is a contradiction.
! </p>
! 
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <blockquote><p>
! One of the bitmask elements should be removed
! from the declaration and should be defined
! separately, in the same manner as
! <tt>ios_base::adjustfield</tt>, <tt>ios_base::basefield</tt> and
! <tt>ios_base::floatfield</tt> are defined by 27.5.3.1.2 [ios::fmtflags] p.2
! and Table 120. These are constants of a bitmask
! type, but are not distinct elements, they have
! more than one value set in the bitmask.
! <tt>regex_constants::format_default</tt> should be
! specified as a constant with the same value as
! <tt>regex_constants::match_default</tt>.
! </p></blockquote>
! 
! <p><i>[
! 2010-10-31 Daniel comments:
! ]</i></p>
! 
! <p>
! Strictly speaking, a bitmask type cannot have any element of value 0 at all, because
! any such value would contradict the requirement expressed in 17.5.2.1.3 [bitmask.types] p. 3:
! </p>
! <blockquote><p>
! for any pair <em>Ci</em> and <em>Cj</em>, <em>Ci</em> &amp; <em>Ci</em> is nonzero
! </p></blockquote>
! <p>
! So, actually <em>both</em> <tt>regex_constants::match_default</tt> and
! <tt>regex_constants::format_default</tt> are only constants of the type
! <tt>regex_constants::match_flag_type</tt>, and no bitmask elements.
! </p>
! 
! <p><i>[
! 2010-11-03 Daniel comments and provides a proposed resolution:
! ]</i></p>
! 
! 
! <p>The proposed resolution is written against N3126 and considered as a further improvement
! of the fixes suggested by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3110.html">n3110</a>.
! </p>
! 
! <blockquote>
! <p>
! Add the following sentence to 28.5.2 [re.matchflag]  paragraph 1:
! </p>
! <blockquote><p>
! 1 The type <tt>regex_constants::match_flag_type</tt> is an implementation-defined bitmask type (17.5.2.1.3).
! Matching a regular expression against a sequence of characters [first,last) proceeds according to the
! rules of the grammar specified for the regular expression object, modified according to the effects listed in
! Table 136 for any bitmask elements set. <ins>Type <tt>regex_constants::match_flag_type</tt> also defines the 
! constants <tt>regex_constants::match_default</tt> and <tt>regex_constants::format_default</tt>.</ins>
! </p></blockquote>
! </blockquote>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! It appears the key problem is the phrasing of the bitmask requirements.  Jeremiah supplies updated wording.
! </p>
! 
! <p>
! Pete Becker has also provided an alternative resolution.
! </p>
! 
! <p>
! Ammend 17.5.2.1.3 [bitmask.types]:
! </p>
! <p>
! Change the list of values for "enum bit mask" in p2 from
! </p>
! <p>
! <tt><i>V0</i> = 1 &lt;&lt; 0, <i>V1</i> = 1 &lt;&lt; 1, <i>V2</i> = 1 &lt;&lt; 2, <i>V3</i> = 1 &lt;&lt; 3, ...</tt>.
! </p>
! <p>
! to
! </p>
! <p>
! <tt><i>V0</i> = 0, <i>V1</i> = 1 &lt;&lt; 0, <i>V2</i> = 1 &lt;&lt; 1, <i>V3</i> = 1 &lt;&lt; 2,  ...</tt>.
! </p>
! <p>
! Here, the names <i>C0</i>, <i>C1</i>, etc. represent <i>bitmask elements</i> for this particular
! bitmask type. All such <ins>non-zero</ins> elements have distinct values such that, for any pair
! <i>Ci</i> and <i>Cj</i> <ins>where <i>i</i> != <i>j</i></ins>, <del><i>Ci &amp; Ci</i> is nonzero
! and</del> <i>Ci &amp; Cj</i> is zero.
! </p>
! <p>
! Change bullet 3 of paragraph 4:
! </p>
! <p>
! <del>The</del><ins>A non-zero</ins> value Y is set in the object X if the expression X &amp; Y is nonzero.
! </p>
! 
! <p><i>[2014-02-13 Issaquah:]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Ammend 17.5.2.1.3 [bitmask.types] p3:
! </p>
! <p>
! Here, the names <i>C0</i>, <i>C1</i>, etc. represent <i>bitmask elements</i> for this particular
! bitmask type. All such elements have distinct<ins>, nonzero</ins> values such that, for any pair
! <i>Ci</i> and <i>Cj</i> <ins>where <i>i</i> != <i>j</i>,</ins> <i>Ci &amp; Ci</i> is nonzero
! and <i>Ci &amp; Cj</i> is zero. <ins>Additionally, the value 0 is used to represent an
! <i>empty bitmask</i>, in which no bitmask elements are set.</ins>
! </p>
! 
! <p>
! Add the following sentence to 28.5.2 [re.matchflag]  paragraph 1:
! </p>
! <blockquote><p>
! 1 The type <tt>regex_constants::match_flag_type</tt> is an implementation-defined bitmask type (17.5.2.1.3).
! <ins>The constants of that type, except for <tt>match_default</tt> and <tt>format_default</tt>, are bitmask
! elements. The <tt>match_default</tt> and <tt>format_default</tt> constants are empty bitmasks.</ins> Matching
! a regular expression against a sequence of characters [first,last) proceeds according to the rules of the
! grammar specified for the regular expression object, modified according to the effects listed in Table 136
! for any bitmask elements set.
! </p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1453"></a>1453. Default constructed <tt>match_results</tt> behavior for certain operations </h3>
! <p><b>Section:</b> 28.10.4 [re.results.acc] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results.acc">issues</a> in [re.results.acc].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-126</b></p>
  
+ <p>
  It's unclear how match_results should behave if it has
  been default-constructed. The sub_match objects
  returned by operator[], prefix and suffix cannot point to the
  end of the sequence that was searched if no search was
  done. The iterators held by unmatched sub_match objects
  might be singular.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  
! <blockquote><p>
  Add to match_results::operator[],
! match_results::prefix and match_results::suffix:<br/>
  Requires: !empty()
! </p></blockquote>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3158.html">n3158</a> would solve this issue.
! </p></blockquote>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
  Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3158.html">n3158</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1455"></a>1455. C language compatibility for atomics</h3>
! <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1454">1454</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-22, GB-128</b></p>
+ 
  <p>
  WG14 currently plans to introduce atomic facilities that are
  intended to be compatible with the facilities of clause 29.
*************** standard.
*** 82073,82125 ****
  ]</i></p>
  
  <p>
! Resolved by adoption of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
  </p>
  
  
! <p><b>Proposed resolution:</b></p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1462"></a>1462. [FCD] Ambiguous value assignment to <tt>atomic_bool</tt></h3>
! <p><b>Section:</b> 29.5.1 [atomics.types.integral] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.integral">issues</a> in [atomics.types.integral].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#1463">1463</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-132, US-157</b></p>
  
  The <tt>atomic_<em>itype</em></tt> types and <tt>atomic_address</tt> have two
  overloads of <tt>operator=</tt>; one is <tt>volatile</tt> qualified, and the
  other is not. <tt>atomic_bool</tt> only has the <tt>volatile</tt> qualified
  version:
! <pre><blockquote>
  bool operator=(bool) volatile;
! </blockquote></pre>
  On a non-<tt>volatile</tt>-qualified object this is ambiguous with
  the deleted copy-assignment operator
! <pre><blockquote>
  atomic_bool&amp; operator=(atomic_bool const&amp;) = delete;
! </blockquote></pre>
  due to the need for a single standard conversion in each
  case when assigning a bool to an <tt>atomic_bool</tt> as in:
! <pre><blockquote>
  atomic_bool b;
  b = true;
! </blockquote></pre>
  The conversions are: 
! <pre><blockquote>
! atomic_bool&amp; &#8594; atomic_bool volatile&amp;
! </blockquote></pre>
   vs 
! <pre><blockquote>
! bool &#8594; atomic_bool
! </blockquote></pre>
  
  <p><i>[
  Proposed resolution as of NB comment:
--- 94565,94968 ----
  ]</i></p>
  
  <p>
! Resolved by adoption of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
  </p>
  
  
! <p><b>Proposed resolution:</b></p><p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
! </p>
  
  
  
  
+ <hr>
+ <h3><a name="1457"></a>1457. Splitting lock-free properties</h3>
+ <p><b>Section:</b> 29.2 [atomics.syn] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#atomics.syn">issues</a> in [atomics.syn].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-130</b></p>
+ 
+ <p>
+ The synopsis for the <tt>&lt;atomic&gt;</tt> header lists the macros
+ <tt>ATOMIC_INTEGRAL_LOCK_FREE</tt> and <tt>ATOMIC_ADDRESS_LOCK_FREE</tt>.
+ </p>
+ <p>
+ The <tt>ATOMIC_INTEGRAL_LOCK_FREE</tt> macro has been replaced with a set of macros 
+ for each integral type, as listed in 29.4 [atomics.lockfree].
+ </p>
+ 
+ <p><i>[Proposed resolution as of comment]</i></p>
+ 
+ 
+ <blockquote>
+ <p>
+ Against FCD, N3092:
+ </p>
+ <p>
+ In [atomics.syn], header <tt>&lt;atomic&gt;</tt> synopsis replace as indicated:
+ </p>
+ <blockquote><pre>
+ // 29.4, lock-free property
+ <del>#define ATOMIC_INTEGRAL_LOCK_FREE <em>unspecified</em></del>
+ <ins>#define ATOMIC_CHAR_LOCK_FREE <em>implementation-defined</em></ins>
+ <ins>#define ATOMIC_CHAR16_T_LOCK_FREE <em>implementation-defined</em></ins>
+ <ins>#define ATOMIC_CHAR32_T_LOCK_FREE <em>implementation-defined</em></ins>
+ <ins>#define ATOMIC_WCHAR_T_LOCK_FREE <em>implementation-defined</em></ins>
+ <ins>#define ATOMIC_SHORT_LOCK_FREE <em>implementation-defined</em></ins>
+ <ins>#define ATOMIC_INT_LOCK_FREE <em>implementation-defined</em></ins>
+ <ins>#define ATOMIC_LONG_LOCK_FREE <em>implementation-defined</em></ins>
+ <ins>#define ATOMIC_LLONG_LOCK_FREE <em>implementation-defined</em></ins>
+ #define ATOMIC_ADDRESS_LOCK_FREE <em>unspecified</em>
+ </pre></blockquote>
+ </blockquote>
+ 
+ <p><i>[
+ 2010-10-26: Daniel adds:
+ ]</i></p>
+ 
+ 
+ <p>
+ The proposed resolution below is against the FCD working draft. After application
+ of the editorial issues <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3162.html#US144">US-144</a>
+ and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3162.html#US146">US-146</a> the remaining difference
+ against the working draft is the usage of <em>implementation-defined</em> instead of <em>unspecified</em>, effectively
+ resulting in this delta:
+ </p>
+ 
+ <blockquote><pre>
+ // 29.4, lock-free property
+ #define ATOMIC_CHAR_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
+ #define ATOMIC_CHAR16_T_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
+ #define ATOMIC_CHAR32_T_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
+ #define ATOMIC_WCHAR_T_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
+ #define ATOMIC_SHORT_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
+ #define ATOMIC_INT_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
+ #define ATOMIC_LONG_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
+ #define ATOMIC_LLONG_LOCK_FREE <del><em>unspecified</em></del><ins><em>implementation-defined</em></ins>
+ #define ATOMIC_ADDRESS_LOCK_FREE <em>unspecified</em>
+ </pre></blockquote>
+ 
+ <p>
+ It is my understanding that the intended wording should be <em>unspecified</em> as for <tt>ATOMIC_ADDRESS_LOCK_FREE</tt>
+ but if this is right, we need to use the same wording in 29.4 [atomics.lockfree], which consequently uses
+ the term <em>implementation-defined</em>. I recommend to keep 29.2 [atomics.syn] as it currently is and to
+ fix 29.4 [atomics.lockfree] instead as indicated:
+ </p>
+ 
+ <p><i>[2011-02-24 Reflector discussion]</i></p>
+ 
+ <p>
+ Moved to Tentatively Ready after 5 votes.
+ </p> 
+ 
+ <p><i>[2011-02-20: Daniel adapts the proposed wording to N3225 and fixes an editorial omission of
+ applying <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">N3193</a>]</i></p>
+ 
+ 
+ <p><i>[2011-03-06: Daniel adapts the wording to N3242]</i></p>
+ 
+ 
+ <p><i>[Proposed Resolution]</i></p>
+ 
+ <blockquote>
+ <p>
+ Change 29.4 [atomics.lockfree] as indicated:
+ </p>
+ <blockquote><pre>
+ #define ATOMIC_CHAR_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
+ #define ATOMIC_CHAR16_T_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
+ #define ATOMIC_CHAR32_T_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
+ #define ATOMIC_WCHAR_T_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
+ #define ATOMIC_SHORT_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
+ #define ATOMIC_INT_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
+ #define ATOMIC_LONG_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
+ #define ATOMIC_LLONG_LOCK_FREE <del><em>implementation-defined</em></del><ins><em>unspecified</em></ins>
+ </pre></blockquote>
+ </blockquote>
+     
+ 
+ 
+     
+ <p><b>Proposed resolution:</b></p><p>
+ Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
+ </p>
+ 
+ 
+ 
  
  <hr>
! <h3><a name="1460"></a>1460. Missing lock-free property for type <tt>bool</tt> should be added</h3>
! <p><b>Section:</b> 29.4 [atomics.lockfree] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.lockfree">issues</a> in [atomics.lockfree].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-154</b></p>
! 
! <p>There is no <tt>ATOMIC_BOOL_LOCK_FREE</tt> macro.</p>
! 
! <p>Proposed resolution suggested by the NB comment:</p>
! 
! <p>
! Add <tt>ATOMIC_BOOL_LOCK_FREE</tt> to 29.4 [atomics.lockfree] and to 29.2 [atomics.syn]:
! </p>
! <blockquote><pre>
! [..]
! <ins>#define ATOMIC_BOOL_LOCK_FREE <em>unspecified</em></ins>
! #define ATOMIC_CHAR_LOCK_FREE <em>unspecified</em>
! #define ATOMIC_CHAR16_T_LOCK_FREE <em>unspecified</em>
! #define ATOMIC_CHAR32_T_LOCK_FREE <em>unspecified</em>
! [..]
! </pre></blockquote>
! 
! 
! <p><i>[2011-03-12: Lawrence comments and drafts wording]</i></p>
! 
! 
! <p>Point: We were missing a macro test for <tt>bool</tt>.</p>
! 
! <p>Comment: The <tt>atomic&lt;bool&gt;</tt> type is the easiest to make lock-free.
! There is no harm in providing a macro.</p>
! 
! <p>Action: Add an <tt>ATOMIC_BOOL_LOCK_FREE</tt>.</p>
! 
! <p>Point: We were missing a macro test for pointers.</p>
! 
! <p>Comment: The national body comment noting the missing macro
! for <tt>bool</tt> did not note the lack of a macro for pointers because
! <tt>ATOMIC_ADDRESS_LOCK_FREE</tt> was present at the time of the comment.
! Its removal appears to be an overzealous consequence of removing
! <tt>atomic_address</tt>.</p>
! 
! <p>Action: Add an <tt>ATOMIC_POINTER_LOCK_FREE</tt>.</p>
! 
! <p>Point: Presumably <tt>atomic_is_lock_free()</tt> will be an inline function
! producing a constant in those cases in which the macros are useful.</p>
! 
! <p>Comment: The point is technically correct, but could use some
! exposition. Systems providing forward binary compatibility, e.g.
! mainstream desktop and server systems, would likely have these
! functions as inline constants only when the answer is true.
! Otherwise, the function should defer to a platform-specific dynamic
! library to take advantage of future systems that do provide lock-free
! support.</p>
! 
! <p>Comment: Such functions are not useful in the preprocessor, and not
! portably useful in <tt>static_assert</tt>.</p>
! 
! <p>Action: Preserve the macros.</p>
! 
! <p>Point: The required explicit instantiations are <tt>atomic&lt;X&gt;</tt> for each
! of the types <tt>X</tt> in Table 145. Table 145 does not list <tt>bool</tt>, so 
! <tt>atomic&lt;bool&gt;</tt> is not a required instantiation.</p>
! 
! <p>Comment: I think specialization was intended in the point instead of
! instantiation. In any event, 29.5 [atomics.types.generic] paragraph 5 does
! indirectly require a specialization for <tt>atomic&lt;bool&gt;</tt>.  Confusion
! arises because the specialization for other integral types have a
! wider interface than the generic <tt>atomic&lt;T&gt;</tt>, but 
! <tt>atomic&lt;bool&gt;</tt> does not.</p>
! 
! <p>Action: Add clarifying text.</p>
! 
! <p>Point: The name of Table 145, "atomic integral typedefs", is perhaps
! misleading, since the types listed do not contain all of the
! "integral" types.</p>
! 
! <p>Comment: Granted, though the table describe those with extra operations.</p>
! 
! <p>Action: Leave the text as is.</p>
! 
! <p>Point: The macros correspond to the types in Table 145, "with the
! signed and unsigned variants grouped together". That's a rather
! inartful way of saying that <tt>ATOMIC_SHORT_LOCK_FREE</tt> applies to
! <tt>signed short</tt> and <tt>unsigned short</tt>. Presumably this also means that
! <tt>ATOMIC_CHAR_LOCK_FREE</tt> applies to all three char types.</p>
! 
! <p>Comment: Yes, it is inartful.</p>
! 
! <p>Comment: Adding additional macros to distinguish signed and unsigned
! would provide no real additional information given the other
! constraints in the language.</p>
! 
! <p>Comment: Yes, it applies to all three <tt>char</tt> types.</p>
! 
! <p>Action: Leave the text as is.</p>
! 
! <p>Point: The standard says that "There are full specializations over the
! integral types (<tt>char</tt>, <tt>signed char</tt>, ...)" <tt>bool</tt> 
! is not in the list. But this text is not normative. It simply tells you 
! that "there are" specializations, not "there shall be" specializations, which would
! impose a requirement. The requirement, to the extent that there is
! one, is in the header synopsis, which, in N3242, sort of pulls in the
! list of types in Table 145.</p>
! 
! <p>Comment: The intent was for the specializations to be normative.
! Otherwise the extra member functions could not be present.</p>
! 
! <p>Action: Clarify the text.</p>
! 
! <p><i>[Proposed Resolution]</i></p>
! 
! <blockquote>
! <ol>
! <li><p>Edit header <tt>&lt;atomic&gt;</tt> synopsis 29.2 [atomics.syn]:</p>
! 
! <blockquote><pre>
! namespace std {
!   <i>// 29.3, order and consistency</i>
!   enum memory_order;
!   template &lt;class T&gt;
!   T kill_dependency(T y);
! 
!   <i>// 29.4, lock-free property</i>
!   <ins>#define ATOMIC_BOOL_LOCK_FREE <i>unspecified</i></ins>
!   #define ATOMIC_CHAR_LOCK_FREE <i>unspecified</i>
!   #define ATOMIC_CHAR16_T_LOCK_FREE <i>unspecified</i>
!   #define ATOMIC_CHAR32_T_LOCK_FREE <i>unspecified</i>
!   #define ATOMIC_WCHAR_T_LOCK_FREE <i>unspecified</i>
!   #define ATOMIC_SHORT_LOCK_FREE <i>unspecified</i>
!   #define ATOMIC_INT_LOCK_FREE <i>unspecified</i>
!   #define ATOMIC_LONG_LOCK_FREE <i>unspecified</i>
!   #define ATOMIC_LLONG_LOCK_FREE <i>unspecified</i>
!   <ins>#define ATOMIC_POINTER_LOCK_FREE <i>unspecified</i></ins>
!   
!   <i>// 29.5, generic types</i>
!   template&lt;class T&gt; struct atomic;
!   template&lt;&gt; struct atomic&lt;<i>integral</i>&gt;;
!   template&lt;class T&gt; struct atomic&lt;T*&gt;;
! 
!   <i>// 29.6.1, general operations on atomic types
!   // In the following declarations, </i>atomic_type<i> is either
!   // </i>atomic&lt;T&gt;<i> or a named base class for </i>T<i> from
!   // Table 145 or inferred from
!   // Table 146 </i><ins><i>or from</i> bool</ins><i>.</i> 
! 
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Edit the synopsis of 29.4 [atomics.lockfree] and paragraph 1 as follows:</p>
! 
! <blockquote><pre>
! <ins>#define ATOMIC_BOOL_LOCK_FREE <i>unspecified</i></ins>
! #define ATOMIC_CHAR_LOCK_FREE <i><del>implementation-defined</del><ins>unspecified</ins></i>
! #define ATOMIC_CHAR16_T_LOCK_FREE <i><del>implementation-defined</del><ins>unspecified</ins></i>
! #define ATOMIC_CHAR32_T_LOCK_FREE <i><del>implementation-defined</del><ins>unspecified</ins></i>
! #define ATOMIC_WCHAR_T_LOCK_FREE <i><del>implementation-defined</del><ins>unspecified</ins></i>
! #define ATOMIC_SHORT_LOCK_FREE <i><del>implementation-defined</del><ins>unspecified</ins></i>
! #define ATOMIC_INT_LOCK_FREE <i><del>implementation-defined</del><ins>unspecified</ins></i>
! #define ATOMIC_LONG_LOCK_FREE <i><del>implementation-defined</del><ins>unspecified</ins></i>
! #define ATOMIC_LLONG_LOCK_FREE <i><del>implementation-defined</del><ins>unspecified</ins></i>
! <ins>#define ATOMIC_POINTER_LOCK_FREE <i>unspecified</i></ins>
! </pre><blockquote>
! <p>
! 1 The <tt>ATOMIC_&hellip;_LOCK_FREE</tt> macros indicate the lock-free property of the corresponding atomic types, with
! the signed and unsigned variants grouped together. The properties also apply to the corresponding <ins>(partial)</ins> 
! specializations of the <tt>atomic</tt> template. A value of 0 indicates that the types are never lock-free. A value of 1
! indicates that the types are sometimes lock-free. A value of 2 indicates that the types are always lock-free.
! </p>
! </blockquote></blockquote>  
! </li>
! 
! <li><p>Edit 29.5 [atomics.types.generic] paragraph 3, 4, and 6-8 as follows:</p>
! 
! <blockquote><p>
! 2 The semantics of the operations on specializations of <tt>atomic</tt> are defined in 29.6 [atomics.types.operations].
! <p/>
! 3 Specializations <ins>and instantiations</ins> of the <tt>atomic</tt> template shall have a deleted copy constructor, 
! a deleted copy assignment operator, and a <tt>constexpr</tt> value constructor.
! <p/>
! 4 There <del>are</del><ins>shall be</ins> full specializations <del>over</del><ins>for</ins> the integral types <del>(</del>
! <tt>char</tt>, <tt>signed char</tt>, <tt>unsigned char</tt>, <tt>short</tt>, <tt>unsigned short</tt>, <tt>int</tt>, 
! <tt>unsigned int</tt>, <tt>long</tt>, <tt>unsigned long</tt>, <tt>long long</tt>, <tt>unsigned long long</tt>, 
! <tt>char16_t</tt>, <tt>char32_t</tt>, <ins>and</ins> <tt>wchar_t</tt>, and any other types needed by the typedefs in the header 
! <tt>&lt;cstdint&gt;</tt><del>)</del> on the <tt>atomic</tt> class
! template. For each integral type integral, the specialization <tt>atomic&lt;<i>integral</i>&gt;</tt> provides additional atomic
! operations appropriate to integral types. <del>[Editor's note: I'm guessing that this is the correct rendering of
! the text in the paper; if this sentence was intended to impose a requirement, rather than a description, it
! will have to be changed.]</del> <ins>There shall be a specialization <tt>atomic&lt;bool&gt;</tt> which provides
! the general atomic operations as specified in 29.6.1 [atomics.types.operations.general].</ins>
! <p/>
! 5 The atomic integral specializations and the specialization <tt>atomic&lt;bool&gt;</tt> shall have standard layout. They
! shall each have a trivial default constructor and a trivial destructor. They shall each support aggregate
! initialization syntax.
! <p/>
! 6 There <del>are</del><ins>shall be</ins> pointer partial specializations <del>on</del><ins>of</ins> the <tt>atomic</tt> 
! class template. These specializations shall have trivial default constructors and trivial destructors.
! <p/>
! 7 There <del>are</del><ins>shall be</ins> named types corresponding to the integral specializations of <tt>atomic</tt>, as 
! specified in Table 145. <ins>In addition, there shall be named type <code>atomic_bool</code> corresponding to the specialization 
! <code>atomic&lt;bool&gt;</code>.</ins> Each named type is <ins>either</ins> a typedef to the corresponding specialization 
! or a base class of the corresponding specialization. If it is a base class, it shall support the same member functions 
! as the corresponding specialization.
! <p/>
! 8 There <del>are</del><ins>shall be</ins> atomic typedefs corresponding to the typedefs in the header <tt>&lt;inttypes.h&gt;</tt> 
! as specified in Table 146.
! </p>
! </blockquote>
! </li>
! </ol>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="1462"></a>1462. Ambiguous value assignment to <tt>atomic_bool</tt></h3>
! <p><b>Section:</b> X [atomics.types.integral] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.integral">issues</a> in [atomics.types.integral].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1463">1463</a></p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-132, US-157</b></p>
  
+ <p>
  The <tt>atomic_<em>itype</em></tt> types and <tt>atomic_address</tt> have two
  overloads of <tt>operator=</tt>; one is <tt>volatile</tt> qualified, and the
  other is not. <tt>atomic_bool</tt> only has the <tt>volatile</tt> qualified
  version:
! </p>
! <blockquote><pre>
  bool operator=(bool) volatile;
! </pre></blockquote>
! <p>
  On a non-<tt>volatile</tt>-qualified object this is ambiguous with
  the deleted copy-assignment operator
! </p>
! <blockquote><pre>
  atomic_bool&amp; operator=(atomic_bool const&amp;) = delete;
! </pre></blockquote>
! <p>
  due to the need for a single standard conversion in each
  case when assigning a bool to an <tt>atomic_bool</tt> as in:
! </p>
! <blockquote><pre>
  atomic_bool b;
  b = true;
! </pre></blockquote>
! <p>
  The conversions are: 
! </p>
! <blockquote><pre>
! atomic_bool&amp; &rarr; atomic_bool volatile&amp;
! </pre></blockquote>
! <p>
   vs 
! </p>
! <blockquote><pre>
! bool &rarr; atomic_bool
! </pre></blockquote>
  
  <p><i>[
  Proposed resolution as of NB comment:
*************** Proposed resolution as of NB comment:
*** 82127,82135 ****
  
  
  <p>
! Change 29.5.1 [atomics.types.integral] as indicated:
! 
! </p><blockquote><pre>namespace std {
    typedef struct atomic_bool {
      [..]
      bool operator=(bool) volatile;
--- 94970,94979 ----
  
  
  <p>
! Change X [atomics.types.integral] as indicated:
! </p>
! <blockquote><pre>
! namespace std {
    typedef struct atomic_bool {
      [..]
      bool operator=(bool) volatile;
*************** Change 29.5.1 [atomics.types.integral] a
*** 82138,82199 ****
    [..]
  }
  </pre></blockquote>
- <p></p>
  
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue
  by replacing <tt>atomic_bool</tt> by <tt>atomic&lt;bool&gt;</tt>.
! </blockquote>
  
  <p><i>[
  2010 Batavia
  ]</i></p>
  
  <p>
! Resolved by adoption of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
  </p>
  
  
! <p><b>Proposed resolution:</b></p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1464"></a>1464. [FCD] Underspecified typedefs for atomic integral types</h3>
! <p><b>Section:</b> 29.5.1 [atomics.types.integral] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.integral">issues</a> in [atomics.types.integral].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-160</b></p>
  
! The last sentence of 29.5.1 [atomics.types.integral] p.1 says:
  <blockquote><p>
  Table 143 shows typedefs to atomic integral classes and the corresponding <tt>&lt;cstdint&gt;</tt> typedefs.
  </p></blockquote>
  That's nice, but nothing says these are supposed to be part of the implementation, and
  they are not listed in the synopsis.
  
  <p><i>[
  Proposed resolution as of NB comment
  ]</i></p>
  
  
! <p>
! </p><ol>
! <li>Remove Table 143 — Atomics for standard typedef types.
  <p>
  </p>
  </li>
! <li>Change 29.5.1 [atomics.types.integral] p.1 as indicated:
  <blockquote><p>
  1 The name <tt>atomic_<em>itype</em></tt> and the functions operating on it in the preceding synopsis are placeholders for a
  set of classes and functions. Throughout the preceding synopsis, <tt>atomic_<em>itype</em></tt> should be replaced by each
--- 94982,95045 ----
    [..]
  }
  </pre></blockquote>
  
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue
  by replacing <tt>atomic_bool</tt> by <tt>atomic&lt;bool&gt;</tt>.
! </p></blockquote>
  
  <p><i>[
  2010 Batavia
  ]</i></p>
  
  <p>
! Resolved by adoption of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
  </p>
  
  
! <p><b>Proposed resolution:</b></p><p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1464"></a>1464. Underspecified typedefs for atomic integral types</h3>
! <p><b>Section:</b> X [atomics.types.integral] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.integral">issues</a> in [atomics.types.integral].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-160</b></p>
  
! <p>
! The last sentence of X [atomics.types.integral] p.1 says:
! </p>
  <blockquote><p>
  Table 143 shows typedefs to atomic integral classes and the corresponding <tt>&lt;cstdint&gt;</tt> typedefs.
  </p></blockquote>
+ <p>
  That's nice, but nothing says these are supposed to be part of the implementation, and
  they are not listed in the synopsis.
+ </p>
  
  <p><i>[
  Proposed resolution as of NB comment
  ]</i></p>
  
  
! <ol>
! <li>Remove Table 143 &mdash; Atomics for standard typedef types.
  <p>
  </p>
  </li>
! <li>Change X [atomics.types.integral] p.1 as indicated:
  <blockquote><p>
  1 The name <tt>atomic_<em>itype</em></tt> and the functions operating on it in the preceding synopsis are placeholders for a
  set of classes and functions. Throughout the preceding synopsis, <tt>atomic_<em>itype</em></tt> should be replaced by each
*************** class name. <del>Table 143 shows typedef
*** 82202,82271 ****
  </p></blockquote>
  </li>
  </ol>
- <p></p>
  
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue.
! </blockquote>
  
  <p><i>[
  2010-11 Batavia
  ]</i></p>
  
  <p>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
  </p>
  
  
  
! <p><b>Proposed resolution:</b></p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1465"></a>1465. [FCD] Missing arithmetic operators for <tt>atomic_address</tt></h3>
! <p><b>Section:</b> 29.5.2 [atomics.types.address] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-161</b></p>
  
  <tt>atomic_address</tt> has <tt>operator+=</tt> and <tt>operator-=</tt>, but no
  <tt>operator++</tt> or <tt>operator--</tt>. The template specialization
  <tt>atomic&lt;Ty*&gt;</tt> has all of them.
  
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue by
  replacing <tt>atomic_address</tt> by <tt>atomic&lt;void*&gt;</tt>.
! </blockquote>
  
  <p><i>[
  Resolved in Batavia by accepting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
  ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change 29.5.2 [atomics.types.address], class <tt>atomic_address</tt> synopsis, as indicated:
! </p><blockquote><pre>namespace std {
    typedef struct atomic_address {
!     [..]
      void* operator=(const void*) volatile;
      void* operator=(const void*);
      <ins>void* operator++(int) volatile;</ins>
--- 95048,95119 ----
  </p></blockquote>
  </li>
  </ol>
  
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue.
! </p></blockquote>
  
  <p><i>[
  2010-11 Batavia
  ]</i></p>
  
  <p>
! Resolved by adopting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
  </p>
  
  
  
! <p><b>Proposed resolution:</b></p><p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1465"></a>1465. Missing arithmetic operators for <tt>atomic_address</tt></h3>
! <p><b>Section:</b> X [atomics.types.address] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-161</b></p>
  
+ <p>
  <tt>atomic_address</tt> has <tt>operator+=</tt> and <tt>operator-=</tt>, but no
  <tt>operator++</tt> or <tt>operator--</tt>. The template specialization
  <tt>atomic&lt;Ty*&gt;</tt> has all of them.
+ </p>
  
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue by
  replacing <tt>atomic_address</tt> by <tt>atomic&lt;void*&gt;</tt>.
! </p></blockquote>
  
  <p><i>[
  Resolved in Batavia by accepting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
  ]</i></p>
  
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Change X [atomics.types.address], class <tt>atomic_address</tt> synopsis, as indicated:</p>
! <blockquote><pre>
! namespace std {
    typedef struct atomic_address {
!     [&hellip;]
      void* operator=(const void*) volatile;
      void* operator=(const void*);
      <ins>void* operator++(int) volatile;</ins>
*************** Resolved in Batavia by accepting
*** 82281,82290 ****
      void* operator-=(ptrdiff_t) volatile;
      void* operator-=(ptrdiff_t);
    } atomic_address;
!   [..]
  }
  </pre></blockquote>
- <p></p>
  
  
  
--- 95129,95137 ----
      void* operator-=(ptrdiff_t) volatile;
      void* operator-=(ptrdiff_t);
    } atomic_address;
!   [&hellip;]
  }
  </pre></blockquote>
  
  
  
*************** Resolved in Batavia by accepting
*** 82292,82308 ****
  
  
  <hr>
! <h3><a name="1466"></a>1466. [FCD] Silent <tt>const</tt> breakage by <tt>compare_exchange_*</tt> member functions</h3>
! <p><b>Section:</b> 29.5.2 [atomics.types.address] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-162</b></p>
  
  The <tt>compare_exchange_weak</tt> and <tt>compare_exchange_strong</tt> member functions that take
  <tt>const void*</tt> arguments lead to a silent removal of <tt>const</tt>, because the <tt>load</tt> 
  member function and other acessors return the stored value as a <tt>void*</tt>.
  
  <p><i>[
  Proposed resolution as of NB comment:
--- 95139,95157 ----
  
  
  <hr>
! <h3><a name="1466"></a>1466. Silent <tt>const</tt> breakage by <tt>compare_exchange_*</tt> member functions</h3>
! <p><b>Section:</b> X [atomics.types.address] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-162</b></p>
  
+ <p>
  The <tt>compare_exchange_weak</tt> and <tt>compare_exchange_strong</tt> member functions that take
  <tt>const void*</tt> arguments lead to a silent removal of <tt>const</tt>, because the <tt>load</tt> 
  member function and other acessors return the stored value as a <tt>void*</tt>.
+ </p>
  
  <p><i>[
  Proposed resolution as of NB comment:
*************** Proposed resolution as of NB comment:
*** 82310,82318 ****
  
  
  <p>
! Change 29.5.2 [atomics.types.address], class <tt>atomic_address</tt> synopsis, as indicated:
! 
! </p><blockquote><pre>namespace std {
    typedef struct atomic_address {
      [..]
      <del>bool compare_exchange_weak(const void*&amp;, const void*,
--- 95159,95168 ----
  
  
  <p>
! Change X [atomics.types.address], class <tt>atomic_address</tt> synopsis, as indicated:
! </p>
! <blockquote><pre>
! namespace std {
    typedef struct atomic_address {
      [..]
      <del>bool compare_exchange_weak(const void*&amp;, const void*,
*************** Change 29.5.2 [atomics.types.address], c
*** 82337,82385 ****
  }
  </pre></blockquote>
  
- <p></p>
- 
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> 
  would solve this issue by replacing <tt>atomic_address</tt> by <tt>atomic&lt;void*&gt;</tt>.
! </blockquote>
  
  <p><i>[
  Resolved in Batavia by accepting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
  ]</i></p>
  
  
  
  
! <p><b>Proposed resolution:</b></p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1467"></a>1467. [FCD] Deriving <tt>atomic&lt;T*&gt;</tt> from <tt>atomic_address</tt> breaks type safety</h3>
! <p><b>Section:</b> 29.5.2 [atomics.types.address] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-163</b></p>
  
  Requiring <tt>atomic&lt;T*&gt;</tt> to be derived from <tt>atomic_address</tt> breaks type safety:
! <blockquote><pre>atomic&lt;double*&gt; ip;
  char ch;
  atomic_store(&amp;ip, &amp;ch);
  *ip.load() = 3.14159;
  </pre></blockquote>
  The last line overwrites <tt>ch</tt> with a value of type <tt>double</tt>.
  
  <p><i>[
  2010-10-27 Daniel adds:
--- 95187,95238 ----
  }
  </pre></blockquote>
  
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> 
  would solve this issue by replacing <tt>atomic_address</tt> by <tt>atomic&lt;void*&gt;</tt>.
! </p></blockquote>
  
  <p><i>[
  Resolved in Batavia by accepting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
  ]</i></p>
  
  
  
  
! <p><b>Proposed resolution:</b></p><p>
! Solved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1467"></a>1467. Deriving <tt>atomic&lt;T*&gt;</tt> from <tt>atomic_address</tt> breaks type safety</h3>
! <p><b>Section:</b> X [atomics.types.address] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-163</b></p>
  
+ <p>
  Requiring <tt>atomic&lt;T*&gt;</tt> to be derived from <tt>atomic_address</tt> breaks type safety:
! </p>
! <blockquote><pre>
! atomic&lt;double*&gt; ip;
  char ch;
  atomic_store(&amp;ip, &amp;ch);
  *ip.load() = 3.14159;
  </pre></blockquote>
+ <p>
  The last line overwrites <tt>ch</tt> with a value of type <tt>double</tt>.
+ </p>
  
  <p><i>[
  2010-10-27 Daniel adds:
*************** The last line overwrites <tt>ch</tt> wit
*** 82388,82401 ****
  
  <blockquote>
  <p>
! Resolving this issue will also solve <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1469">1469</a>
! </p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue by
  removing <tt>atomic_address</tt>.
  </blockquote>
  <p><i>[
  Resolved in Batavia by accepting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
  ]</i></p>
  
  
--- 95241,95256 ----
  
  <blockquote>
  <p>
! Resolving this issue will also solve <a href="lwg-defects.html#1469">1469</a>
! <p/>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue by
  removing <tt>atomic_address</tt>.
+ </p>
  </blockquote>
+ 
  <p><i>[
  Resolved in Batavia by accepting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
  ]</i></p>
  
  
*************** Resolved in Batavia by accepting
*** 82403,82409 ****
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>Change 29.5 [atomics.types.generic], class template specialization <tt>atomic&lt;T*&gt;</tt> synopsis, as indicated:
! <blockquote><pre>namespace std {
    template &lt;class T&gt; struct atomic&lt;T*&gt; <del>: atomic_address</del> {
      [..]
    };
--- 95258,95265 ----
  <p><b>Proposed resolution:</b></p>
  <ol>
  <li>Change 29.5 [atomics.types.generic], class template specialization <tt>atomic&lt;T*&gt;</tt> synopsis, as indicated:
! <blockquote><pre>
! namespace std {
    template &lt;class T&gt; struct atomic&lt;T*&gt; <del>: atomic_address</del> {
      [..]
    };
*************** Resolved in Batavia by accepting
*** 82412,82422 ****
  </pre></blockquote>
  </li>
  <li>Change 29.5 [atomics.types.generic] p. 4 as indicated:
! <p></p><blockquote>
  4 There are pointer partial specializations on the <tt>atomic</tt> class template. <del>These specializations shall be publicly
  derived from <tt>atomic_address</tt>.</del> The unit of addition/subtraction for these specializations shall be the size
  of the referenced type. These specializations shall have trivial default constructors and trivial destructors.
! </blockquote><p></p>
  </li>
  </ol>
  
--- 95268,95278 ----
  </pre></blockquote>
  </li>
  <li>Change 29.5 [atomics.types.generic] p. 4 as indicated:
! <blockquote><p>
  4 There are pointer partial specializations on the <tt>atomic</tt> class template. <del>These specializations shall be publicly
  derived from <tt>atomic_address</tt>.</del> The unit of addition/subtraction for these specializations shall be the size
  of the referenced type. These specializations shall have trivial default constructors and trivial destructors.
! </p></blockquote>
  </li>
  </ol>
  
*************** of the referenced type. These specializa
*** 82426,82464 ****
  
  
  <hr>
! <h3><a name="1468"></a>1468. [FCD] <tt>atomic_address::compare_exchange_*</tt> member functions should match <tt>atomic_compare_exchange_*</tt> free functions</h3>
! <p><b>Section:</b> 29.5.2 [atomics.types.address] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-164</b></p>
  
  <tt>atomic_address</tt> has member functions <tt>compare_exchange_weak</tt> and
  <tt>compare_exchange_strong</tt> that take arguments of type <tt>const void*</tt>, 
  in addition to the <tt>void*</tt> versions. If these member functions survive, 
  there should be corresponding free functions.
  
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue 
  differently by removing the overloads with <tt>const void*</tt> arguments, because they break type-safety.
! </blockquote>
  <p><i>[
  Resolved in Batavia by accepting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
  ]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! Extend the synopsis around <tt>atomic_address</tt> in 29.5.2 [atomics.types.address]
  as indicated:
! <blockquote><pre>namespace std {
    [..]
    bool atomic_compare_exchange_weak(volatile atomic_address*, void**, void*);
    bool atomic_compare_exchange_weak(atomic_address*, void**, void*);
--- 95282,95325 ----
  
  
  <hr>
! <h3><a name="1468"></a>1468. <tt>atomic_address::compare_exchange_*</tt> member functions should match <tt>atomic_compare_exchange_*</tt> free functions</h3>
! <p><b>Section:</b> X [atomics.types.address] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.address">issues</a> in [atomics.types.address].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-164</b></p>
  
+ <p>
  <tt>atomic_address</tt> has member functions <tt>compare_exchange_weak</tt> and
  <tt>compare_exchange_strong</tt> that take arguments of type <tt>const void*</tt>, 
  in addition to the <tt>void*</tt> versions. If these member functions survive, 
  there should be corresponding free functions.
+ </p>
  
  <p><i>[
  2010-10-27 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue 
  differently by removing the overloads with <tt>const void*</tt> arguments, because they break type-safety.
! </p></blockquote>
  <p><i>[
  Resolved in Batavia by accepting 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
  ]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! Extend the synopsis around <tt>atomic_address</tt> in X [atomics.types.address]
  as indicated:
! </p>
! <blockquote><pre>
! namespace std {
    [..]
    bool atomic_compare_exchange_weak(volatile atomic_address*, void**, void*);
    bool atomic_compare_exchange_weak(atomic_address*, void**, void*);
*************** as indicated:
*** 82496,82520 ****
  
  
  <hr>
! <h3><a name="1469"></a>1469. [FCD] <tt>atomic&lt;T*&gt;</tt> inheritance from <tt>atomic_address</tt> breaks type safety</h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-133</b></p>
  
  The free functions that operate on <tt>atomic_address</tt> can be
  used to store a pointer to an unrelated type in an <tt>atomic&lt;T*&gt;</tt> 
  without a cast. e.g.
! <blockquote><pre>int i;
  atomic&lt;int*&gt; ai(&amp;i);
  string s;
  atomic_store(&amp;ai,&amp;s);
  </pre></blockquote>
  Overload the <tt>atomic_store</tt>, <tt>atomic_exchange</tt> and
  <tt>atomic_compare_exchange_[weak/strong]</tt> operations for 
  <tt>atomic&lt;T*&gt;</tt> to allow storing only pointers to <tt>T</tt>.
  
  <p><i>[
  2010-10-27 Daniel adds:
--- 95357,95387 ----
  
  
  <hr>
! <h3><a name="1469"></a>1469. <tt>atomic&lt;T*&gt;</tt> inheritance from <tt>atomic_address</tt> breaks type safety</h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.generic">active issues</a> in [atomics.types.generic].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-133</b></p>
  
+ <p>
  The free functions that operate on <tt>atomic_address</tt> can be
  used to store a pointer to an unrelated type in an <tt>atomic&lt;T*&gt;</tt> 
  without a cast. e.g.
! </p>
! <blockquote><pre>
! int i;
  atomic&lt;int*&gt; ai(&amp;i);
  string s;
  atomic_store(&amp;ai,&amp;s);
  </pre></blockquote>
+ <p>
  Overload the <tt>atomic_store</tt>, <tt>atomic_exchange</tt> and
  <tt>atomic_compare_exchange_[weak/strong]</tt> operations for 
  <tt>atomic&lt;T*&gt;</tt> to allow storing only pointers to <tt>T</tt>.
+ </p>
  
  <p><i>[
  2010-10-27 Daniel adds:
*************** Overload the <tt>atomic_store</tt>, <tt>
*** 82523,82544 ****
  
  <blockquote>
  <p>
! Resolving this issue will also solve <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1467">1467</a>
! </p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue by
  removing <tt>atomic_address</tt>.
  </blockquote>
  
  <p><i>[Resolved in Batavia by accepting
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.html">n3193</a>.
  ]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Add the following overloads to 29.5 [atomics.types.generic], the synopsis around the specialization
! <tt>atomic&lt;T*&gt;</tt>, as indicated:
! </p><blockquote><pre>namespace std {
    [..]
    template &lt;class T&gt; struct atomic&lt;T*&gt; : atomic_address {
      [..]
--- 95390,95413 ----
  
  <blockquote>
  <p>
! Resolving this issue will also solve <a href="lwg-defects.html#1467">1467</a>
! <p/>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3164.html">n3164</a> would solve this issue by
  removing <tt>atomic_address</tt>.
+ </p>
  </blockquote>
  
  <p><i>[Resolved in Batavia by accepting
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">n3193</a>.
  ]</i></p>
  
  
  
  <p><b>Proposed resolution:</b></p>
  <p>Add the following overloads to 29.5 [atomics.types.generic], the synopsis around the specialization
! <tt>atomic&lt;T*&gt;</tt>, as indicated:</p>
! <blockquote><pre>
! namespace std {
    [..]
    template &lt;class T&gt; struct atomic&lt;T*&gt; : atomic_address {
      [..]
*************** removing <tt>atomic_address</tt>.
*** 82579,82675 ****
  
  }
  </pre></blockquote>
- <p></p>
  
  
  
  
  
  <hr>
! <h3><a name="1481"></a>1481. [FCD] Missing Lockable requirements</h3>
! <p><b>Section:</b> 30.2 [thread.req] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-138</b></p>
  
  The FCD combines the requirements for lockable objects
  with those for the standard mutex objects. These should
! be separate. This is LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1268">1268</a>.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  See attached Appendix 1 - Additional Details
! </blockquote>
  
  <p><i>[
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3130.html">n3130</a> addresses
  this issue.
! </blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3197.html">n3197</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1482"></a>1482. [FCD] Timeout operations are under-specified</h3>
! <p><b>Section:</b> 30.2.4 [thread.req.timing] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.req.timing">issues</a> in [thread.req.timing].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-181</b></p>
  
  The timeout operations are under-specified.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  
! <blockquote>
  Define precise semantics for <tt>timeout_until</tt> and <tt>timeout_for</tt>. See 
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3141.pdf">n3141</a> page 193 - Appendix 1 - Additional Details
! </blockquote>
  
  <p><i>[
  2010-11-01 Daniel comments:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3128</a> would solve this issue.
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
! Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3191</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1490"></a>1490. [FCD] Mutex requirements too stringent</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-27</b></p>
  
  The mutex requirements force <tt>try_lock</tt> to be
  <tt>noexcept(true)</tt>. However, where they are used by the
  generic algorithms, those relax this requirement and say
--- 95448,96246 ----
  
  }
  </pre></blockquote>
  
  
  
  
  
  <hr>
! <h3><a name="1474"></a>1474. weak compare-and-exchange confusion</h3>
! <p><b>Section:</b> 29.6.5 [atomics.types.operations.req] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.operations.req">active issues</a> in [atomics.types.operations.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations.req">issues</a> in [atomics.types.operations.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Duplicate of:</b> <a href="lwg-closed.html#1470">1470</a>, <a href="lwg-closed.html#1475">1475</a>, <a href="lwg-closed.html#1476">1476</a>, <a href="lwg-closed.html#1477">1477</a></p>
! <p><b>Discussion:</b></p>
! 
! 
! 
! <p><b>Addresses US-175, US-165, CH-23, GB-135</b></p>
! <p>
! 29.6.5 [atomics.types.operations.req] p. 25: The first sentence is grammatically incorrect.
! </p>
! <p><i>[
! 2010-10-28 Daniel adds:
! ]</i></p>
! 
! <p>
! Duplicate issue <a href="lwg-closed.html#1475">1475</a> also has a proposed resolution, but both issues are resolved with
! below proposed resolution.
! </p>
! 
! <p><i>[
! 2011-02-15 Howard fixes numbering, Hans improves the wording
! ]</i></p>
! 
! 
! <p><i>[2011-02-24 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 6 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>Change 29.6.5 [atomics.types.operations.req] p. 23 as indicated:</p>
! 
! <blockquote><p>
! [ <em>Note</em>: <ins>For example, t</ins><del>T</del>he effect of 
! <del>the compare-and-exchange operations</del><ins><tt>atomic_compare_exchange_strong</tt></ins> is
! </p><blockquote><pre>
! if (memcmp(object, expected, sizeof(*object)) == 0)
!   memcpy(object, &amp;desired, sizeof(*object));
! else
!   memcpy(expected, object, sizeof(*object));
! </pre></blockquote>
! <p> &mdash; <em>end note</em> ] [..]</p>
! </blockquote>
! </li>
! 
! <li>
! <p>Change 29.6.5 [atomics.types.operations.req] p. 25 as indicated:</p>
! <blockquote><p>
! 25 <em>Remark</em>: <del>The weak compare-and-exchange operations may fail spuriously, that is, return false while
! leaving the contents of memory pointed to by <tt>expected</tt> before the operation is the same that same
! as that of the <tt>object</tt> and the same as that of <tt>expected</tt> after the operation</del><ins>A weak 
! compare-and-exchange operation may fail spuriously. That is, even when the contents of memory referred to by 
! <tt>expected</tt> and <tt>object</tt> are equal, it may return false and store back to <tt>expected</tt> the same 
! memory contents that were originally there.</ins>. [ <em>Note</em>: This spurious
! failure enables implementation of compare-and-exchange on a broader class of machines, e.g., loadlocked
! store-conditional machines. A consequence of spurious failure is that nearly all uses of weak
! compare-and-exchange will be in a loop.
! <p/>
! When a compare-and-exchange is in a loop, the weak version will yield better performance on some
! platforms. When a weak compare-and-exchange would require a loop and a strong one would not, the
! strong one is preferable. &mdash; <em>end note</em> ]
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1478"></a>1478. Clarify race conditions in atomics initialization</h3>
! <p><b>Section:</b> 29.6 [atomics.types.operations] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.operations">issues</a> in [atomics.types.operations].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-136</b></p>
! <p>
! GB requests normative clarification in 29.6 [atomics.types.operations] p.4 that
! concurrent access constitutes a race, as already done on p.6 and p.7.
! </p>
! <p><i>[
! Resolution proposed in ballot comment:
! ]</i></p>
! 
! 
! <blockquote><p>
! Initialisation of atomics:
! <p/>
! We believe the intent is that for any atomics there is a distinguished
! initialisation write, but that this need not happens-before all the
! other operations on that atomic - specifically so that the
! initialisation write might be non-atomic and hence give rise to a data
! race, and hence undefined behaviour, in examples such as this (from
! Hans):
! </p>
! <blockquote><pre>
! atomic&lt;atomic&lt;int&gt; *&gt; p
! f()                      |
! { atomic&lt;int&gt;x;          | W_na x
!   p.store(&amp;x,mo_rlx);    | W_rlx p=&amp;x
! }                        |
! </pre></blockquote><p>
! (where na is nonatomic and rlx is relaxed). We suspect also that no
! other mixed atomic/nonatomic access to the same location is intended
! to be permitted. Either way, a note would probably help.
! </p></blockquote>
! 
! <p><i>[2011-02-26: Hans comments and drafts wording]</i></p>
! 
! 
! <p>I think the important point here is to clarify that races on atomics
! are possible, and can be introduced as a result of non-atomic
! initialization operations.  There are other parts of this that remain unclear
! to me, such as whether there are other ways to introduce data races on atomics,
! or whether the races with initialization also introduce undefined behavior
! by the 3.8 lifetime rules.  But I don't think that it is necessary to resolve
! those issues before releasing the standard.  That's particularly true
! since we've introduced <tt>atomic_init</tt>, which allows easier ways to
! construct initialization races.
! </p>
! 
! <p><i>[2011-03 Madrid]</i></p>
! 
! <p>Accepted to be applied immediately to the WP</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>Update 29.6.5 [atomics.types.operations.req] p. 5 as follows:</p>
! 
! <blockquote><pre>
! constexpr A::A(C desired);
! </pre><blockquote><p>
! 5 <i>Effects</i>: Initializes the object with the value <tt>desired</tt>. <del>[ <i>Note</i>: 
! Construction is not atomic. &mdash; <i>end note</i> ]</del><ins> Initialization is not an 
! atomic operation (1.10) [intro.multithread]. [<i>Note</i>: It is possible to have an
! access to an atomic object <tt>A</tt> race with its construction, for example
! by communicating the address of the just-constructed object <tt>A</tt> to another thread 
! via <code>memory_order_relaxed</code> atomic operations on a suitable atomic pointer variable, 
! and then immediately accessing <tt>A</tt> in the receiving thread.  This results in undefined 
! behavior. &mdash; <i>end note</i>]</ins>
! </p></blockquote></blockquote>
! </li>
! 
! <li><p>In response to the editor comment to 29.6.5 [atomics.types.operations.req] p. 8: 
! The first <i>Effects</i> element is the correct and intended one:</p>
! 
! <blockquote><pre>
! void atomic_init(volatile A *object, C desired);
! void atomic_init(A *object, C desired);
! </pre><blockquote><p>
! 8 <i>Effects</i>: Non-atomically initializes <tt>*object</tt> with value <tt>desired</tt>.
! This function shall only be applied to objects that have been default constructed, and then only once.
! [ <i>Note</i>: these semantics ensure compatibility with C. &mdash; <i>end note</i> ] [ <i>Note</i>: 
! Concurrent access from another thread, even via an atomic operation, constitutes a data 
! race. &mdash; <i>end note</i> ] <del>[<i>Editor's note</i>: The preceding text is from the WD as 
! amended by N3196. N3193 makes different changes, marked up in the paper as follows:]
! <i>Effects</i>: Dynamically initializes an atomic variable. Non-atomically That is, non-atomically assigns the
! value desired to <tt>*object</tt>. [ <i>Note</i>: this operation may need to initialize 
! locks. &mdash; <i>end note</i> ] Concurrent access from another thread, even via an atomic 
! operation, constitutes a data race.</del>
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1479"></a>1479. Fence functions should be <tt>extern "C"</tt></h3>
! <p><b>Section:</b> 29.8 [atomics.fences] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.fences">issues</a> in [atomics.fences].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-179</b></p>
! <p>
! The fence functions (29.8 [atomics.fences] p.5 + p.6) should be <tt>extern "C"</tt>, for <tt>C</tt> compatibility.
! </p>
! 
! <p><i>[2011-02-16 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 6 votes.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>Change 29.2 [atomics.syn], header <tt>&lt;atomic&gt;</tt> synopsis as indicated:
! <blockquote><pre>
! namespace std {
!   [..]
!   // <em>29.8, fences</em>
!   <ins>extern "C"</ins> void atomic_thread_fence(memory_order);
!   <ins>extern "C"</ins> void atomic_signal_fence(memory_order);  
! }
! </pre></blockquote>
! </li>
! <li><p>Change 29.8 [atomics.fences], p. 5 and p. 6 as indicated:</p>
! <blockquote><pre>
! <ins>extern "C"</ins> void atomic_thread_fence(memory_order);
! </pre><blockquote><p>
! 5 <em>Effects</em>: depending on the value of <tt>order</tt>, this operation: [..]
! </p></blockquote></blockquote>
! <blockquote><pre>
! <ins>extern "C"</ins> void atomic_signal_fence(memory_order);  
! </pre><blockquote><p>
! 6 <em>Effects</em>: equivalent to <tt>atomic_thread_fence(order)</tt>, except that synchronizes with relationships are
! established only between a thread and a signal handler executed in the same thread.
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1480"></a>1480. Atomic fences don't have <em>synchronizes with</em> relation</h3>
! <p><b>Section:</b> 29.8 [atomics.fences] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.fences">issues</a> in [atomics.fences].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB-137</b></p>
! <p>
! Thread fence not only establish synchronizes with relationships,
! there are semantics of fences that are expressed not in
! terms of <em>synchronizes with</em> relationships (for example see 29.3 [atomics.order] p.5).
! These semantics also need to apply to the use of
! <tt>atomic_signal_fence</tt> in a restricted way.
! </p>
! <p><i>[Batavia: Concurrency group discussed issue, and is OK with the proposed resolution.]</i></p>
! 
! 
! <p><i>[2011-02-26 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>Change 29.8 [atomics.fences] p. 6 as indicated:</p>
! <blockquote><pre>
! void atomic_signal_fence(memory_order);  
! </pre><blockquote><p>
! 6 <em>Effects</em>: equivalent to <tt>atomic_thread_fence(order)</tt>, except that <del>synchronizes 
! with relationships</del><ins>the resulting ordering constraints</ins> are established only between a 
! thread and a signal handler executed in the same thread.
! </p></blockquote></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1481"></a>1481. Missing Lockable requirements</h3>
! <p><b>Section:</b> 30.2 [thread.req] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-138</b></p>
  
+ <p>
  The FCD combines the requirements for lockable objects
  with those for the standard mutex objects. These should
! be separate. This is LWG issue <a href="lwg-defects.html#1268">1268</a>.
! </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  See attached Appendix 1 - Additional Details
! </p></blockquote>
  
  <p><i>[
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote><p>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3130.html">n3130</a> addresses
  this issue.
! </p></blockquote>
  
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3197.htm">n3197</a>.</p>
  
  
  
  
  
  <hr>
! <h3><a name="1482"></a>1482. Timeout operations are under-specified</h3>
! <p><b>Section:</b> 30.2.4 [thread.req.timing] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.req.timing">issues</a> in [thread.req.timing].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-181</b></p>
  
+ <p>
  The timeout operations are under-specified.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  
! <blockquote><p>
  Define precise semantics for <tt>timeout_until</tt> and <tt>timeout_for</tt>. See 
  <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3141.pdf">n3141</a> page 193 - Appendix 1 - Additional Details
! </p></blockquote>
  
  <p><i>[
  2010-11-01 Daniel comments:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3128</a> would solve this issue.
+ </p></blockquote>
+ 
+ 
+ <p><b>Proposed resolution:</b></p><p>
+ Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3128.html">n3191</a>.
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1487"></a>1487. Clock related operations exception specifications conflict</h3>
+ <p><b>Section:</b> 30.3.2 [thread.thread.this] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.thread.this">issues</a> in [thread.thread.this].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses CH-25</b></p>
+ <p>
+ Clock related operations are currently not required not to
+ throw. So "Throws: Nothing." is not always true.
+ </p>
+ <p><i>[
+ Resolution proposed by ballot comment:
+ ]</i></p>
+ 
+ <blockquote><p>
+ Either require clock related operations not to throw
+ (in 20.10) or change the Throws clauses in 30.3.2.
+ Also possibly add a note that <tt>abs_time</tt> in the past
+ or negative <tt>rel_time</tt> is allowed.
+ </p></blockquote>
+ 
+ <p><i>[2011-02-10: Howard Hinnant provides a resolution proposal]</i></p>
+ 
+ 
+ <p><i>[Previous proposed resolution:]</i></p>
+ 
+ <ol>
+ <li>
+ <p>Change the Operational semantics of <tt>C1::now()</tt> in 20.12.3 [time.clock.req], 
+ Table 59 &mdash; <tt>Clock</tt> requirements as follows:
+ </p>
+ 
+ <blockquote>
+ <table border="1">
+ <caption>Table 59 &mdash; <tt>Clock</tt> requirements</caption>
+ <tr>
+ <th>
+ Expression
+ </th>
+ 
+ <th>
+ Return type
+ </th>
+ 
+ <th>
+ Operational semantics
+ </th>
+ 
+ </tr>
+ 
+ <tr>
+ <td><tt>C1::now()</tt></td>
+ 
+ <td><tt>C1::time_point</tt></td>
+ 
+ <td>Returns a <tt>time_point</tt> object<br/>
+ representing the current point in time.<br/>
+ <ins>Shall not throw an exception.</ins></td>
+ </tr>
+ 
+ </table>
  </blockquote>
  
  
+ </li>
+ </ol>
+ 
+ <p><i>[2011-02-19: Daniel comments and suggests an alternative wording]</i></p>
+ 
+ 
+ <p>Imposing the no-throw requirement on <tt>C1::now()</tt> of any clock time
+ is an overly radical step: It has the indirect consequences that representation
+ types for <tt>C1::rep</tt> can never by types with dynamic memory managment,
+ e.g. my <tt>big_int</tt>, which are currently fully supported by the time
+ utilities. Further-on this strong constraint does not even solve the problem
+ described in the issue, because we are still left with the fact that any
+ of the arithmetic operations of <tt>C1::rep</tt>, <tt>C1::duration</tt>,
+ and <tt>C1::time_point</tt> may throw exceptions.
+ </p>
+ <p>The alternative proposal uses the following strategy: The general <tt>Clock</tt>
+ requirements remain untouched, but we require that any functions of the library-provided
+ clocks from sub-clause 20.12.7 [time.clock] and their associated types shall not
+ throw exceptions. Second, we replace existing <tt>noexcept</tt> specifications of
+ functions from Clause 30 that depend on durations, clocks, or time points by wording that
+ clarifies that these functions can only throw, if the operations of user-provided durations,
+ clocks, or time points used as arguments to these functions throw exceptions.
+ </p>
+ 
+ <p><i>[2011-03-23 Daniel and Peter check and simplify the proposed resolution resulting in this paper]</i></p>
+ 
+ 
+ <p>There is an inherent problem with <tt>std::time_point</tt> that it doesn't seem to have an equivalent value 
+ for <tt>((time_t)-1)</tt> that gets returned by C's <tt>time()</tt> function to signal a problem, e.g., because 
+ the underlying hardware is unavailable. After a lot of thinking and checks we came to the resolution that 
+ <tt>timepoint::max()</tt> should be the value to serve as a value signaling errors in cases where we
+ prefer to stick with no-throw conditions. Of-course, user-provided representation types don't need to
+ follow this approach if they prefer exceptions to signal such failures.
+ <p/>
+ the functions <tt>now()</tt> and <tt>from_time_t()</tt> can remain <tt>noexcept</tt> with the solution to 
+ return <tt>timepoint::max()</tt> in case the current time cannot be determined or <tt>(time_t)-1</tt> is passed 
+ in, respectively.
+ <p/>
+ Based on the previous proposed solution to LWG 1487 we decided that the new <tt>TrivialClock</tt> requirements 
+ should define that <tt>now()</tt> mustn't throw and return <tt>timepoint::max()</tt> to signal a problem. That 
+ is in line with the C standard where <tt>(time_t)-1</tt> signals a problem. Together with a fix to a - we assumed - 
+ buggy specifcation in 20.11.3 p2 which uses "happens-before" relationship with something that isn't any action:
+ </p>
+ <blockquote><p>
+ 2 In Table 59 <tt>C1</tt> and <tt>C2</tt> denote clock types. <tt>t1</tt> and <tt>t2</tt> are values returned by 
+ <tt>C1::now()</tt> where the call returning <tt>t1</tt> happens before (1.10) the call returning <tt>t2</tt> and 
+ both of these calls happen before <tt>C1::time_point::max()</tt>. 
+ </p></blockquote>
+ 
+ <p><i>[2011-03-23 Review with Concurrency group suggested further simplifications and Howard pointed out, that
+ we do not need time_point::max() as a special value.]</i></p>
+ 
+ 
+ <p>also the second "happens before" will be changed to "occurs before" in the english meaning. this is
+ to allow a steady clock to wrap.
+ <p/>
+ Peter updates issue accordingly to discussion.
+ </p>
+ 
+ <p><i>[Note to the editor: we recommend removal of the following redundant paragraphs in 
+  30.5.2 [thread.condition.condvarany] p. 18 to p. 21, p. 27, p. 28, p. 30, and p. 31 that are 
+ defining details for the wait functions that are given by the <i>Effects</i> element. 
+ ]</i></p>
+ 
+ 
+ <p><i>[Note to the editor: we recommend removal of the following redundant paragraphs in 
+ 30.5.1 [thread.condition.condvar]: p24-p26, p33-p34, and p36-p37 that are defining details for the 
+ <tt>wait_for</tt> functions. We believe these paragraphs are redundant with respect to the <i>Effects</i> clauses that 
+ define semantics based on <tt>wait_until</tt>. An example of such a specification is the <tt>wait()</tt> with a predicate.
+ ]</i></p>
+ 
+ 
+ 
  <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li><p>Change p2 in 20.11.3 [time.clock.req] as follows</p>
! <blockquote><p>
! 2 In Table 59 <tt>C1</tt> and <tt>C2</tt> denote clock types. <tt>t1</tt> and 
! <tt>t2</tt> are values returned by <tt>C1::now()</tt> where the call returning <tt>t1</tt> 
! happens before (1.10) the call returning <tt>t2</tt> and both of these calls <del>happen</del>
! <ins>occur</ins> before <tt>C1::time_point::max()</tt>. 
! <ins>[ <i>Note</i>: This means <tt>C1</tt> didn't wrap around between <tt>t1</tt> and <tt>t2</tt> &mdash; <i>end note</i> ]</ins>
! </p></blockquote>
! </li>
! 
! <li><p>Add the following new requirement set at the end of sub-clause 20.12.3 [time.clock.req]: [<i>Comment</i>:
! This requirement set is <strong>intentionally</strong> incomplete. The reason for
! this incompleteness is the based on the fact, that if we would make it right for C++0x, we would end up defining
! something like a complete <tt>ArithmeticLike</tt> concept for <tt>TC::rep</tt>, <tt>TC::duration</tt>, and <tt>TC::time_point</tt>. 
! But this looks out-of scope for C++0x to me. The effect is that we essentially do not exactly say, which arithmetic 
! or comparison operations can be used in the time-dependent functions from Clause 30, even though I expect that
! all declared functions of <tt>duration</tt> and <tt>time_point</tt> are well-formed and well-defined. &mdash; <i>end comment</i>]</p>
! <blockquote><p>
! 3 [ <i>Note</i>: the relative difference in durations between those reported by a given clock and the SI definition is
! a measure of the quality of implementation. &mdash; <i>end note</i> ]
! </p></blockquote>
! 
! <blockquote><p>
! <ins>? A type <tt>TC</tt> meets the <tt><i>TrivialClock</i></tt> requirements if:</ins>
! </p>
! <ul>
! <li><p>
! <ins><tt>TC</tt> satisfies the <tt>Clock</tt> requirements (20.12.3 [time.clock.req]),</ins>
! </p></li>
! <li><p>
! <ins>the types <tt>TC::rep</tt>, <tt>TC::duration</tt>, and <tt>TC::time_point</tt> satisfy 
! the requirements of <tt>EqualityComparable</tt> ( [equalitycomparable]), <tt>LessThanComparable</tt> 
! ( [lessthancomparable]), <tt>DefaultConstructible</tt> ( [defaultconstructible]), 
! <tt>CopyConstructible</tt> ( [copyconstructible]), <tt>CopyAssignable</tt> ( [copyassignable]), 
! <tt>Destructible</tt> ( [destructible]), and of numeric types ([numeric.requirements]) [<i>Note</i>: This means in 
! particular, that operations of these types will not throw exceptions &mdash; <i>end note</i> ],</ins>
! </p></li>
! <li><p>
! <ins>lvalues of the types <tt>TC::rep</tt>, <tt>TC::duration</tt>, and <tt>TC::time_point</tt> are swappable 
! (17.6.3.2 [swappable.requirements]),</ins>
! </p></li>
! <li><p>
! <ins>the function <tt>TC::now()</tt> does not throw exceptions, and</ins>
! </p></li>
! <li><p>
! <ins>the type <tt>TC::time_point::clock</tt> meets the <tt>TrivialClock</tt> requirements, recursively.</ins>
! </p></li>
! </ul>
! </blockquote>
! </li>
! 
! <li>
! <p>Modify 20.12.7 [time.clock] p. 1 as follows:</p>
! 
! <blockquote><p>
! 1 - The types defined in this subclause shall satisfy the <tt><ins>Trivial</ins>Clock</tt> requirements (20.11.1). 
! </p></blockquote>
! </li>
! 
! <li>
! <p>Modify 20.12.7.1 [time.clock.system] p. 1, class <tt>system_clock</tt> synopsis, as follows:</p>
! 
! <blockquote><pre>
! class system_clock {
! public:
!   typedef <i>see below</i> rep;
!   typedef ratio&lt;<i>unspecified</i> , <i>unspecified</i> &gt; period;
!   typedef chrono::duration&lt;rep, period&gt; duration;
!   typedef chrono::time_point&lt;system_clock&gt; time_point;
!   static const bool is_monotonic is_steady = <i>unspecified</i>;
!   static time_point now() <ins>noexcept</ins>;
!   // Map to C API
!   static time_t to_time_t (const time_point&amp; t) <ins>noexcept</ins>;
!   static time_point from_time_t(time_t t) <ins>noexcept</ins>;
! };
! </pre></blockquote>
! 
! </li>
! 
! <li>
! <p>Modify the prototype declarations in 20.12.7.1 [time.clock.system] p. 3 + p. 4 as indicated (This 
! edit also fixes the miss of the <tt>static</tt> specifier in these prototype declarations):</p>
! 
! <blockquote><pre>
! <ins>static</ins> time_t to_time_t(const time_point&amp; t) <ins>noexcept</ins>;
! </pre>
! 
! <pre>
! <ins>static</ins> time_point from_time_t(time_t t) <ins>noexcept</ins>;
! </pre>
! </blockquote>
! 
! </li>
! 
! <li>
! <p>Modify 20.12.7.2 [time.clock.steady] p. 1, class <tt>steady_clock</tt> synopsis, as follows:</p>
! 
! <blockquote><pre>
! class steady_clock {
! public:
!   typedef <i>unspecified</i> rep;
!   typedef ratio&lt;<i>unspecified</i> , <i>unspecified</i> &gt; period;
!   typedef chrono::duration&lt;rep, period&gt; duration;
!   typedef chrono::time_point&lt;<i>unspecified</i>, duration&gt; time_point;
!   static const bool is_monotonic is_steady = true;
! 
!   static time_point now() <ins>noexcept</ins>;
! };
! </pre></blockquote>
! 
! </li>
! 
! <li>
! <p> Modify 20.12.7.3 [time.clock.hires] p. 1, class <tt>high_resolution_clock</tt> synopsis, as follows:</p>
! 
! <blockquote><pre>
! class high_resolution_clock {
! public:
!   typedef <i>unspecified</i> rep;
!   typedef ratio&lt;<i>unspecified</i> , <i>unspecified</i> &gt; period;
!   typedef chrono::duration&lt;rep, period&gt; duration;
!   typedef chrono::time_point&lt;<i>unspecified</i>, duration&gt; time_point;
!   static const bool is_monotonic is_steady = <i>unspecified</i>;
! 
!   static time_point now() <ins>noexcept</ins>;
! };
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Add a new paragraph at the end of 30.2.4 [thread.req.timing]:</p>
! 
! <blockquote><p>
! 6 The resolution of timing provided by an implementation depends on both operating system and hardware.
! The finest resolution provided by an implementation is called the <i>native resolution</i>.
! </p></blockquote>
! 
! <blockquote><p>
! <ins>? Implementation-provided clocks that are used for these functions shall meet the <tt>TrivialClock</tt>
! requirements (20.12.3 [time.clock.req]).</ins>
! </p></blockquote>
! </li>
! 
! <li>
! <p>Edit the synopsis of 30.3.2 [thread.thread.this] before p. 1. 
! <i>[Note: this duplicates edits also in D/N3267]</i>:
! </p>
! 
! <blockquote><pre>
! template &lt;class Clock, class Duration&gt;
! void sleep_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) <del>noexcept</del>;
! template &lt;class Rep, class Period&gt;
! void sleep_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) <del>noexcept</del>;
! </pre></blockquote>
! </li>
! 
! <li>
! <p>Modify the prototype specifications in 30.3.2 [thread.thread.this] before p. 4 and p. 6 and
! re-add a <i>Throws</i> element following the <i>Synchronization</i> elements at p. 5 and p. 7:</p>
! 
! <blockquote><pre>
! template &lt;class Clock, class Duration&gt;
! void sleep_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) <del>noexcept</del>;
! </pre><blockquote><p>
! 4 - [...]
! <p/>
! 5 - <i>Synchronization</i>: None.
! <p/>
! <ins>? - <i>Throws</i>: Nothing if <tt>Clock</tt> satisfies the <tt>TrivialClock</tt> requirements (20.12.3 [time.clock.req]) and
! operations of <tt>Duration</tt> do not throw exceptions.
! [<i>Note</i>: Instantiations of time point types and clocks supplied by the implementation as specified in 20.12.7 [time.clock] 
! do not throw exceptions. &mdash; <i>end note</i>]</ins>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep, class Period&gt;
! void sleep_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) <del>noexcept</del>;
! </pre><blockquote><p>
! 6 [...]
! <p/>
! 7 <i>Synchronization</i>: None.
! <p/>
! <ins>? <i>Throws</i>: Nothing if operations of <tt>chrono::duration&lt;Rep, Period&gt;</tt> do not throw exceptions.
! [<i>Note</i>: Instantiations of duration types supplied by the implementation as specified in 20.12.7 [time.clock] 
! do not throw exceptions. &mdash; <i>end note</i>]</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Fix a minor incorrectness in p. 5: Duration types need to compare against <tt>duration&lt;&gt;::zero()</tt>,
! not <tt>0</tt>:</p>
! 
! <blockquote><p>
! 3 The expression <tt>m.try_lock_for(rel_time)</tt> shall be well-formed and have the following semantics:
! <p/>
! [...]
! <p/>
! 5 <i>Effects</i>: The function attempts to obtain ownership of the mutex within the relative timeout (30.2.4)
! specified by <tt>rel_time</tt>. If the time specified by <tt>rel_time</tt> is less than or equal to <del><tt>0</tt></del><ins><tt>rel_time.zero()</tt></ins>, 
! the function attempts to obtain ownership without blocking (as if by calling <tt>try_lock()</tt>). The function shall return
! within the timeout specified by <tt>rel_time</tt> only if it has obtained ownership of the mutex object.
! [ <i>Note</i>: As with <tt>try_lock()</tt>, there is no guarantee that ownership will be obtained if the lock is
! available, but implementations are expected to make a strong effort to do so. &mdash; <i>end note</i> ]
! </p>
! </blockquote>
! </li>
! 
! <li><p>Modify the class <tt>timed_mutex</tt> synopsis in 30.4.1.3.1 [thread.timedmutex.class] as indicated:
! <i>[Note: this duplicates edits also in D/N3267]</i>:
! </p>
! 
! <blockquote><pre>
! class timed_mutex {
! public:
!   [...]
!   template &lt;class Rep, class Period&gt;
!     bool try_lock_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) <del>noexcept</del>;
!   template &lt;class Clock, class Duration&gt;
!     bool try_lock_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) <del>noexcept</del>;
!   [...]
! };
! </pre></blockquote>
! </li>
! 
! <li><p>Modify the class <tt>recursive_timed_mutex</tt> synopsis in 30.4.1.3.2 [thread.timedmutex.recursive] as indicated:
! <i>[Note: this duplicates edits also in D/N3267]</i>:
! </p>
! 
! <blockquote><pre>
! class recursive_timed_mutex {
! public:
!   [...]
!   template &lt;class Rep, class Period&gt;
!     bool try_lock_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) <del>noexcept</del>;
!   template &lt;class Clock, class Duration&gt;
!     bool try_lock_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) <del>noexcept</del>;
!   [...]
! };
! </pre></blockquote>
! </li>
! 
! <li><p>Modify the class template <tt>unique_lock</tt> synopsis in 30.4.2.2 [thread.lock.unique] as indicated.
! <i>[Note: this duplicates edits also in D/N3267]</i>:
! </p>
! 
! <blockquote><pre>
! template &lt;class Mutex&gt;
! class unique_lock {
! public:
!   [...]
!   template &lt;class Clock, class Duration&gt;
!     unique_lock(mutex_type&amp; m, const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) <del>noexcept</del>;
!   template &lt;class Rep, class Period&gt;
!     unique_lock(mutex_type&amp; m, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) <del>noexcept</del>;
!   [...]
! };
! </pre></blockquote>
! </li>
! 
! <li><p>Modify the constructor prototypes in 30.4.2.2.1 [thread.lock.unique.cons] before p. 14 and p. 17 
! <i>[Note: this duplicates edits also in D&#47;N3267]</i>:
! </p>
! 
! <blockquote><pre>
! template &lt;class Clock, class Duration&gt;
!   unique_lock(mutex_type&amp; m, const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) <del>noexcept</del>;
! </pre></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep, class Period&gt;
!   unique_lock(mutex_type&amp; m, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) <del>noexcept</del>;
! </pre></blockquote>
! </li>
! 
! 
! </ol>
! 
  
  
  
  
  
  <hr>
! <h3><a name="1490"></a>1490. Mutex requirements too stringent</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-27</b></p>
  
+ <p>
  The mutex requirements force <tt>try_lock</tt> to be
  <tt>noexcept(true)</tt>. However, where they are used by the
  generic algorithms, those relax this requirement and say
*************** that <tt>try_lock</tt> may throw. This m
*** 82677,82851 ****
  too stringent, also a non-throwing <tt>try_lock</tt> does not allow
  for a diagnostic such as <tt>system_error</tt> that <tt>lock()</tt> 
  will give us.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  delete p18, adjust 30.4.4 p1 and p4 accordingly
! </blockquote>
  
  <p><i>[
  2010-11-01 Daniel comments:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3130.html">n3130</a> would solve this issue.
! </blockquote>
! 
  
- <p><b>Proposed resolution:</b></p>
- Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3197.html">n3197</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1491"></a>1491. [FCD] <tt>try_lock</tt> does not guarantee forward progress</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-186</b></p>
  
  <tt>try_lock</tt> does not provide a guarantee of forward progress
  because it is allowed to spuriously fail.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  The standard mutex types must not fail spuriously
! in <tt>try_lock</tt>. See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3141.pdf">n3141</a> page 205 - Appendix 1 - Additional Details
! </blockquote>
  
  <p><i>[
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3152.html">n3152</a> addresses
  this issue.
! </blockquote>
! 
  
  
- <p><b>Proposed resolution:</b></p>
- Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3209.html">n3209</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1492"></a>1492. [FCD] Mutex requirements should not be bound to threads</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-188</b></p>
  
! Mutex requirements should not be bound to threads
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  See Appendix 1 of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3141.pdf">n3141</a> - Additional Details, p. 208.
! </blockquote>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
! <blockquote>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3130.html">n3130</a> would solve this issue.
  </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
! Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3197.html">n3197</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1498"></a>1498. [FCD] Unclear specification for [thread.condition]</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-29</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-29</b></p>
  
  It is unclear if a spurious wake-up during the loop and reentering
  of the blocked state due to a repeated execution
  of the loop will adjust the timer of the blocking with the
! respect to the previously specified rel_time value.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  
! <blockquote>
  Make it clear (e.g. by a note) that when reexecuting
  the loop the waiting time when blocked
  will be adjusted with respect to the elapsed time of
  the previous loop executions.
! </blockquote>
  
  <p><i>[
  2010-08-13 Peter Sommerlad comments and provides wording:
  ]</i></p>
  
  
! <blockquote>
  Problem: It is unclear if a spurious wake-up during the loop and re-entering of the blocked state due 
  to a repeated execution of the loop will adjust the timer of the blocking with the respect to the 
  previously specified <tt>rel_time</tt> value.
! <p>
  Proposed Resolution from CH29:
! </p><p>
  Make it clear (e.g. by a note) that when re-executing the loop the waiting time when blocked will be 
  adjusted with respect to the elapsed time of the previous loop executions.
! </p><p>
  Discussion in Rapperswil:
! </p><p>
  Assuming the introduction of a mandatory <tt>steady_clock</tt> proposed by US-181 to the FCD the 
  specification of <tt>condition_variable::wait_for</tt> can be defined in terms of <tt>wait_until</tt> 
  using the <tt>steady_clock</tt>. This is also interleaving with US-181, because that touches the 
  same paragraph (30.5.1 p 25, p34 and 30.5.2 p 20, p 28 in n3092.pdf)
! </p><p>
  (The "as if" in the proposed solutions should be confirmed by the standardization terminology experts)
  </p></blockquote>
  
  <p><i>[
! 2010-11 Batavia: Resolved by applying <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.html">n3191</a>
  ]</i></p>
  
  
  <blockquote>
  <ol>
  <li>Change 30.5.1 [thread.condition.condvar] paragraph 25, <tt>wait_for</tt> <i>Effects</i> as indicated:
! <blockquote><pre>template &lt;class Rep, class Period&gt;
  cv_status wait_for(unique_lock&lt;mutex&gt;&amp; lock,
    const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre></blockquote>
! <blockquote>
  [..]
! <p>
  25 <i>Effects</i>: <ins>as if</ins>
! </p><blockquote><pre><ins>return wait_until(lock, chrono::steady_clock::now() + rel_time);</ins>
  </pre></blockquote>
  <ul>
  <li><del>Atomically calls <tt>lock.unlock()</tt> and blocks on <tt>*this</tt>.</del>
--- 96248,96827 ----
  too stringent, also a non-throwing <tt>try_lock</tt> does not allow
  for a diagnostic such as <tt>system_error</tt> that <tt>lock()</tt> 
  will give us.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  delete p18, adjust 30.4.4 p1 and p4 accordingly
! </p></blockquote>
  
  <p><i>[
  2010-11-01 Daniel comments:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3130.html">n3130</a> would solve this issue.
! </p></blockquote>
  
  
+ <p><b>Proposed resolution:</b></p><p>
+ Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3197.htm">n3197</a>.
+ </p>
  
  
  
  
  <hr>
! <h3><a name="1491"></a>1491. <tt>try_lock</tt> does not guarantee forward progress</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-186</b></p>
  
+ <p>
  <tt>try_lock</tt> does not provide a guarantee of forward progress
  because it is allowed to spuriously fail.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  The standard mutex types must not fail spuriously
! in <tt>try_lock</tt>. See <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3141.pdf">n3141</a> 
! page 205 - Appendix 1 - Additional Details
! </p></blockquote>
  
  <p><i>[
  2010-11-01 Daniel comments:
  ]</i></p>
  
! <blockquote><p>
  Paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3152.html">n3152</a> addresses
  this issue.
! </p></blockquote>
  
  
  
+ <p><b>Proposed resolution:</b></p><p>
+ Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3209.htm">n3209</a>.
+ </p>
  
  
  
  
  <hr>
! <h3><a name="1492"></a>1492. Mutex requirements should not be bound to threads</h3>
! <p><b>Section:</b> 30.4.1 [thread.mutex.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#thread.mutex.requirements">active issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.mutex.requirements">issues</a> in [thread.mutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-188</b></p>
  
! <p>
! Mutex requirements should not be bound to threads.
! </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  See Appendix 1 of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3141.pdf">n3141</a> - Additional Details, p. 208.
! </p></blockquote>
  
  <p><i>[
  2010-10-24 Daniel adds:
  ]</i></p>
  
  
! <blockquote><p>
  Accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3130.html">n3130</a> would solve this issue.
+ </p></blockquote>
+ 
+ 
+ <p><b>Proposed resolution:</b></p><p>
+ Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3197.htm">n3197</a>.
+ </p>
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1494"></a>1494. Term "are serialized" not defined</h3>
+ <p><b>Section:</b> 30.4.4.2 [thread.once.callonce] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.once.callonce">issues</a> in [thread.once.callonce].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses US-190</b></p>
+ <p>
+ The term "are serialized" is never defined (30.4.4.2 [thread.once.callonce] p. 2).
+ </p>
+ <p><i>[
+ Resolution proposed by ballot comment:
+ ]</i></p>
+ 
+ <p>
+ Remove the sentence with "are serialized" from
+ paragraph 2. Add "Calls to <tt>call_once</tt> on the same
+ <tt>once_flag</tt> object shall not introduce data races
+ (17.6.4.8)." to paragraph 3.
+ </p>
+ 
+ <p><i>[
+ 2010-11-01 Daniel translates NB comment into wording
+ ]</i></p>
+ 
+ 
+ 
+ <p><i>[
+ 2011-02-17: Hans proposes an alternative resolution
+ ]</i></p>
+ 
+ 
+ <p><i>[
+ 2011-02-25: Hans, Clark, and Lawrence update the suggested wording
+ ]</i></p>
+ 
+ 
+ <p><i>[2011-02-26 Reflector discussion]</i></p>
+ 
+ <p>
+ Moved to Tentatively Ready after 5 votes.
+ </p> 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>Change 30.4.4.2 [thread.once.callonce] p.2+3 as indicated:</p>
+ 
+ <blockquote><pre>
+ template&lt;class Callable, class ...Args&gt;
+ void call_once(once_flag&amp; flag, Callable&amp;&amp; func, Args&amp;&amp;... args);
+ </pre><blockquote><p>
+ [..]
+ <p/>
+ 2 <em>Effects</em>: <del>Calls to <tt>call_once</tt> on the same <tt>once_flag</tt> object are serialized.
+ If there has been a prior effective call to <tt>call_once</tt> on the same <tt>once_flag object</tt>, the call to <tt>call_once</tt> 
+ returns without invoking <tt>func</tt>. If there has been no prior effective call to <tt>call_once</tt> 
+ on the same <tt>once_flag</tt> object, <tt>INVOKE(decay_copy( std::forward&lt;Callable&gt;(func)), 
+ decay_copy(std::forward&lt;Args&gt;(args))...)</tt> is executed. The call to <tt>call_once</tt> is effective 
+ if and only if <tt>INVOKE(decay_copy( std::forward&lt;Callable&gt;(func)), decay_copy(std::forward&lt;Args&gt;(args))...)</tt> 
+ returns without throwing an exception. If an exception is thrown it is propagated to the caller.</del>
+ <ins>An execution of <code>call_once</code> that does not call its <code>func</code> is a passive execution.
+ An execution of <code>call_once</code> that calls its <code>func</code> is an active execution.
+ An active execution shall call <code><var>INVOKE</var>(decay_copy(std::forward&lt;Callable&gt;(func)),
+ decay_copy(std::forward&lt;Args&gt;(args))...)</code>. If such a call to <code>func</code> throws an exception,
+ the execution is exceptional, otherwise it is returning.
+ An exceptional execution shall propagate the exception to the caller of <code>call_once</code>.
+ Among all executions of <code>call_once</code> for any given <code>once_flag</code>: at most one shall be a 
+ returning execution; if there is a returning execution, it shall be the last active execution; and
+ there are passive executions only if there is a returning execution.
+ [<i>Note:</i> Passive executions allow other threads to reliably observe the results produced by the 
+ earlier returning execution. &mdash; <i>end note</i>]</ins>
+ <p/>
+ 3 <em>Synchronization</em>: <del>The completion of an effective call to <tt>call_once</tt> on a <tt>once_flag</tt> 
+ object <em>synchronizes with</em> (1.10 [intro.multithread]) all subsequent calls to <tt>call_once</tt> 
+ on the same <tt>once_flag</tt> object.</del><ins>For any given <code>once_flag</code>: all active executions occur in a total 
+ order; completion of an active execution synchronizes with (1.10 [intro.multithread]) the start of 
+ the next one in this total order; and the returning execution synchronizes with the return from all passive 
+ executions.</ins>
+ </p></blockquote></blockquote>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1497"></a>1497. <tt>lock()</tt> postcondition can not be generally achieved</h3>
+ <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses CH-30</b></p>
+ <p>
+ If <tt>lock.lock()</tt> throws an exception, the postcondition can not be generally achieved.
+ </p>
+ <p><i>[
+ Resolution proposed by ballot comment:
+ ]</i></p>
+ 
+ <blockquote><p>
+ Either state that the postcondition might not be achieved, depending on the error condition, or
+ state that <tt>terminate()</tt> is called in this case.
+ </p></blockquote>
+ 
+ <p><i>[
+ 2010-08-13 Peter Sommerlad comments and provides wording
+ ]</i></p>
+ 
+ 
+ <blockquote><p>
+ 30.5.1 [thread.condition.condvar], 30.5.2 [thread.condition.condvarany]
+ <p/>
+ p. 13, last bullet, and corresponding paragraphs in all wait functions
+ <p/>
+ Problem:<br/>
+ Condition variable wait might fail, because the lock cannot be acquired when notified.
+ CH-30 says: "If lock.lock() throws an exception, the postcondition can not be generally achieved."
+ CH-30 proposes: "Either state that the postcondition might not be achieved, depending on the error 
+ condition, or state that terminate() is called in this case."
+ <p/>
+ The discussion in Rapperswil concluded that calling <tt>terminate()</tt> might be too drastic in 
+ this case and a corresponding exception should be thrown&#47;passed on and one should use a lock type 
+ that allows querying its status, which <tt>unique_lock</tt> allows for <tt>std::condition_variable</tt>
+ <p/>
+ We also had some additional observations while discussing in Rapperswil:
+ </p>
+ <ul>
+ <li>in 30.5.1 [thread.condition.condvar] <tt>wait</tt> with predicate and <tt>wait_until</tt> with 
+ predicate lack the precondition, postcondition and Error conditions sections. the lack of the precondition 
+ would allow to call <tt>pred()</tt> without holding the lock.
+ </li>
+ <li>in 30.5.1 [thread.condition.condvar] <tt>wait_until</tt> and <tt>wait_for</tt> and 
+ 30.5.2 [thread.condition.condvarany] <tt>wait_for</tt> still specify an 
+ error condition for a violated precondition. This should be removed.
+ </li>
+ </ul>
+ <p>
+ and add the following proposed solution:
+ </p>
  </blockquote>
  
+ <p><i>[2011-02-27: Daniel adapts numbering to n3225]</i></p>
+ 
+ 
  
  <p><b>Proposed resolution:</b></p>
! <ol>
! <li>Change 30.5.1 [thread.condition.condvar] as indicated:
! <blockquote><pre>
! void wait(unique_lock&lt;mutex&gt;&amp; lock);
! </pre></blockquote>
! <blockquote><p>
!  9 <i>Requires</i>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread, and either
! </p>
! <ul>
! <li>no other thread is waiting on this <tt>condition_variable</tt> object or
! </li>
! <li><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt> or <tt>timed_wait</tt>) threads.
! </li>
! </ul>
! </blockquote>
! [..]
! <blockquote><p>
! 11 <em>Postcondition</em>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread.
! </p></blockquote>
! [..]
! <blockquote><pre>
! template &lt;class Predicate&gt;
! void wait(unique_lock&lt;mutex&gt;&amp; lock, Predicate pred);
! </pre></blockquote>
! <blockquote><p>
! <ins>?? <i>Requires</i>: <tt>lock.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt> is locked by the calling thread, and either</ins>
! </p>
! <ul>
! <li><ins>no other thread is waiting on this <tt>condition_variable</tt> object or</ins>
! </li>
! <li><ins><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt> or <tt>timed_wait</tt>) threads.</ins>
! </li>
! </ul>
! </blockquote>
! <blockquote><p>
! 14 <i>Effects</i>:
! </p><blockquote><pre>
! while (!pred())
!   wait(lock);
! </pre></blockquote>
! </blockquote>
! 
! <blockquote><p>
! <ins>?? <i>Postcondition</i>: <tt>lock.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt> is locked by the calling thread.</ins>
! </p></blockquote>
! <blockquote><p>
! <ins>?? <i>Throws</i>: <tt>std::system_error</tt> when an exception is required (30.2.2).</ins>
! </p></blockquote>
! <blockquote><p>
! <ins>?? <em>Error conditions</em>:</ins>
! </p>
! <ul>
! <li><ins>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</ins>
! </li>
! </ul>
! </blockquote>
! 
! <blockquote><pre>
! template &lt;class Clock, class Duration&gt;
! cv_status wait_until(unique_lock&lt;mutex&gt;&amp; lock,
!   const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
! </pre></blockquote>
! <blockquote><p>
! 15 <i>Requires</i>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread, and either
! </p>
! <ul>
! <li>no other thread is waiting on this <tt>condition_variable</tt> object or
! </li>
! <li><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt>, <tt>wait_for</tt>, or <tt>wait_until</tt>) threads.
! </li>
! </ul>
! </blockquote><p>
! [..]
! </p><blockquote><p>
! 17 <em>Postcondition</em>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread.
! </p></blockquote>
! [..]
! <blockquote><p>
! 20 <em>Error conditions</em>:
! </p>
! <ul>
! <li><del><tt>operation_not_permitted</tt> &mdash; if the thread does not own the lock.</del>
! </li>
! <li>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
! </li>
! </ul>
! </blockquote>
! <blockquote><pre>
! template &lt;class Rep, class Period&gt;
! cv_status wait_for(unique_lock&lt;mutex&gt;&amp; lock,
!   const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
! </pre></blockquote>
! <blockquote><p>
! 21 <i>Requires</i>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread, and either
! </p>
! <ul>
! <li>no other thread is waiting on this <tt>condition_variable</tt> object or
! </li>
! <li><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt>, <tt>wait_for</tt>, or <tt>wait_until</tt>) threads.
! </li>
! </ul>
! </blockquote><p>
! [..]
! </p><blockquote><p>
! 24 <em>Postcondition</em>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread.
! </p></blockquote>
! [..]
! <blockquote><p>
! 26 <em>Error conditions</em>:
! </p>
! <ul>
! <li><del><tt>operation_not_permitted</tt> &mdash; if the thread does not own the lock.</del>
! </li>
! <li>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
! </li>
! </ul>
! </blockquote>
! <blockquote><pre>
! template &lt;class Clock, class Duration, class Predicate&gt;
! bool wait_until(unique_lock&lt;mutex&gt;&amp; lock,
!   const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time,
!     Predicate pred);
! </pre></blockquote>
! <blockquote><p>
! <ins>?? <i>Requires</i>: <tt>lock.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt> is locked by the calling thread, and either</ins>
! </p>
! <ul>
! <li><ins>no other thread is waiting on this <tt>condition_variable</tt> object or</ins>
! </li>
! <li><ins><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt> or <tt>timed_wait</tt>) threads.</ins>
! </li>
! </ul>
! </blockquote>
! <blockquote><p>
! 27 <i>Effects</i>:
! </p><blockquote><pre>
! while (!pred())
!   if (wait_until(lock, abs_time) == cv_status::timeout)
!     return pred();
! return true;
! </pre></blockquote>
! </blockquote>
! <blockquote><p>
! 28 <i>Returns</i>: <tt>pred()</tt>
! </p></blockquote>
! 
! <blockquote><p>
! <ins>?? <i>Postcondition</i>: <tt>lock.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt> is locked by the calling thread.</ins>
! </p></blockquote>
! 
! <blockquote><p>
! 29 [ <i>Note</i>: The returned value indicates whether the predicate evaluates to true regardless of whether the
! timeout was triggered. &mdash; <i>end note</i> ]
! </p></blockquote>
! 
! <blockquote><p>
! <ins>?? <i>Throws</i>: <tt>std::system_error</tt> when an exception is required (30.2.2).</ins>
! </p></blockquote>
! <blockquote><p>
! <ins>?? <em>Error conditions</em>:</ins>
! </p>
! <ul>
! <li><ins>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</ins>
! </li>
! </ul>
! </blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep, class Period, class Predicate&gt;
! bool wait_for(unique_lock&lt;mutex&gt;&amp; lock,
!   const chrono::duration&lt;Rep, Period&gt;&amp; rel_time,
!     Predicate pred);
! </pre></blockquote>
! <blockquote><p>
! 30 <i>Requires</i>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread, and either
! </p>
! <ul>
! <li>no other thread is waiting on this <tt>condition_variable</tt> object or
! </li>
! <li><tt>lock.mutex()</tt> returns the same value for each of the <tt>lock</tt> arguments supplied by all concurrently
! waiting (via <tt>wait</tt>, <tt>wait_for</tt>, or <tt>wait_until</tt>) threads.
! </li>
! </ul>
! </blockquote><p>
! [..]
! </p><blockquote><p>
! 33 <em>Postcondition</em>: <tt>lock</tt><ins><tt>.owns_lock()</tt> is <tt>true</tt> and <tt>lock.mutex()</tt></ins> is locked by the calling thread.
! </p></blockquote><p>
! [..]
! </p><blockquote><p>
! 37 <em>Error conditions</em>:
! </p>
! <ul>
! <li><del><tt>operation_not_permitted</tt> &mdash; if the thread does not own the lock.</del>
! </li>
! <li>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
! </li>
! </ul>
! </blockquote>
! 
! </li>
! 
! <li>Change 30.5.2 [thread.condition.condvarany] as indicated:
! <p/>
! [..]
! <blockquote><pre>
! template &lt;class Lock, class Predicate&gt;
! void wait(Lock&amp; lock, Predicate pred);
! </pre></blockquote>
! <blockquote><p>
! <ins>[<i>Note</i>: if any of the wait functions exits with an exception it is indeterminate if the <tt>Lock</tt> is held. 
! One can use a <tt>Lock</tt> type that allows to query that, such as the <tt>unique_lock</tt> wrapper. &mdash; <i>end note</i>]</ins>
! </p></blockquote>
! <blockquote><p>
! 11 <i>Effects</i>:
! </p><blockquote><pre>
! while (!pred())
!   wait(lock);
! </pre></blockquote>
! </blockquote><p>
! [..]
! </p><blockquote><p>
! 31 <em>Error conditions</em>:
! </p>
! <ul>
! <li><del><tt>operation_not_permitted</tt> &mdash; if the thread does not own the lock.</del>
! </li>
! <li>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.
! </li>
! </ul>
! </blockquote>
! </li>
! 
! </ol>
  
  
  
  
  
  <hr>
! <h3><a name="1498"></a>1498. Unclear specification for [thread.condition]</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-29</b></p>
  
+ <p>
  It is unclear if a spurious wake-up during the loop and reentering
  of the blocked state due to a repeated execution
  of the loop will adjust the timer of the blocking with the
! respect to the previously specified <tt>rel_time</tt> value.
! </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  
! <blockquote><p>
  Make it clear (e.g. by a note) that when reexecuting
  the loop the waiting time when blocked
  will be adjusted with respect to the elapsed time of
  the previous loop executions.
! </p></blockquote>
  
  <p><i>[
  2010-08-13 Peter Sommerlad comments and provides wording:
  ]</i></p>
  
  
! <blockquote><p>
  Problem: It is unclear if a spurious wake-up during the loop and re-entering of the blocked state due 
  to a repeated execution of the loop will adjust the timer of the blocking with the respect to the 
  previously specified <tt>rel_time</tt> value.
! <p/>
  Proposed Resolution from CH29:
! <p/>
  Make it clear (e.g. by a note) that when re-executing the loop the waiting time when blocked will be 
  adjusted with respect to the elapsed time of the previous loop executions.
! <p/>
  Discussion in Rapperswil:
! <p/>
  Assuming the introduction of a mandatory <tt>steady_clock</tt> proposed by US-181 to the FCD the 
  specification of <tt>condition_variable::wait_for</tt> can be defined in terms of <tt>wait_until</tt> 
  using the <tt>steady_clock</tt>. This is also interleaving with US-181, because that touches the 
  same paragraph (30.5.1 p 25, p34 and 30.5.2 p 20, p 28 in n3092.pdf)
! <p/>
  (The "as if" in the proposed solutions should be confirmed by the standardization terminology experts)
  </p></blockquote>
  
  <p><i>[
! 2010-11 Batavia: Resolved by applying <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.htm">n3191</a>
  ]</i></p>
  
  
  <blockquote>
  <ol>
  <li>Change 30.5.1 [thread.condition.condvar] paragraph 25, <tt>wait_for</tt> <i>Effects</i> as indicated:
! <blockquote><pre>
! template &lt;class Rep, class Period&gt;
  cv_status wait_for(unique_lock&lt;mutex&gt;&amp; lock,
    const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre></blockquote>
! <blockquote><p>
  [..]
! <p/>
  25 <i>Effects</i>: <ins>as if</ins>
! </p>
! <blockquote><pre>
! <ins>return wait_until(lock, chrono::steady_clock::now() + rel_time);</ins>
  </pre></blockquote>
  <ul>
  <li><del>Atomically calls <tt>lock.unlock()</tt> and blocks on <tt>*this</tt>.</del>
*************** by the elapsed time <tt>rel_time</tt> pa
*** 82861,82876 ****
  </blockquote>
  </li>
  <li>Change 30.5.1 [thread.condition.condvar] paragraph 34, <tt>wait_for</tt> with predicate <i>Effects</i> as indicated:
! <blockquote><pre>template &lt;class Rep, class Period, class Predicate&gt;
  bool wait_for(unique_lock&lt;mutex&gt;&amp; lock,
    const chrono::duration&lt;Rep, Period&gt;&amp; rel_time,
    Predicate pred);
  </pre></blockquote>
! <blockquote>
  [..]
! <p>
  34 <i>Effects</i>: <ins>as if</ins>
! </p><blockquote><pre><ins>return wait_until(lock, chrono::steady_clock::now() + rel_time, std::move(pred));</ins>
  </pre></blockquote>
  <ul>
  <li><del>Executes a loop: Within the loop the function first evaluates <tt>pred()</tt> and exits the loop if the
--- 96837,96855 ----
  </blockquote>
  </li>
  <li>Change 30.5.1 [thread.condition.condvar] paragraph 34, <tt>wait_for</tt> with predicate <i>Effects</i> as indicated:
! <blockquote><pre>
! template &lt;class Rep, class Period, class Predicate&gt;
  bool wait_for(unique_lock&lt;mutex&gt;&amp; lock,
    const chrono::duration&lt;Rep, Period&gt;&amp; rel_time,
    Predicate pred);
  </pre></blockquote>
! <blockquote><p>
  [..]
! <p/>
  34 <i>Effects</i>: <ins>as if</ins>
! </p>
! <blockquote><pre>
! <ins>return wait_until(lock, chrono::steady_clock::now() + rel_time, std::move(pred));</ins>
  </pre></blockquote>
  <ul>
  <li><del>Executes a loop: Within the loop the function first evaluates <tt>pred()</tt> and exits the loop if the
*************** has elapsed.
*** 82900,82911 ****
  </li>
  
  <li>Change 30.5.2 [thread.condition.condvarany] paragraph 20, <tt>wait_for</tt> <i>Effects</i> as indicated:
! <blockquote><pre>template &lt;class Lock, class Rep, class Period&gt;
  cv_status wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre></blockquote>
! <blockquote>
  20 <i>Effects</i>: <ins>as if</ins>
! <blockquote><pre><ins>return wait_until(lock, chrono::steady_clock::now() + rel_time);</ins>
  </pre></blockquote>
  <ul>
  <li><del>Atomically calls <tt>lock.unlock()</tt> and blocks on <tt>*this</tt>.
--- 96879,96892 ----
  </li>
  
  <li>Change 30.5.2 [thread.condition.condvarany] paragraph 20, <tt>wait_for</tt> <i>Effects</i> as indicated:
! <blockquote><pre>
! template &lt;class Lock, class Rep, class Period&gt;
  cv_status wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
  </pre></blockquote>
! <blockquote><p>
  20 <i>Effects</i>: <ins>as if</ins>
! </p><blockquote><pre>
! <ins>return wait_until(lock, chrono::steady_clock::now() + rel_time);</ins>
  </pre></blockquote>
  <ul>
  <li><del>Atomically calls <tt>lock.unlock()</tt> and blocks on <tt>*this</tt>.
*************** scope.
*** 82926,82937 ****
  </li>
  
  <li>Change 30.5.2 [thread.condition.condvarany] paragraph 28, <tt>wait_for</tt> with predicate <i>Effects</i> as indicated:
! <blockquote><pre>template &lt;class Lock, class Rep, class Period, class Predicate&gt;
  bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, Predicate pred);
  </pre></blockquote>
! <blockquote>
  28 <i>Effects</i>: <ins>as if</ins>
! <blockquote><pre><ins>return wait_until(lock, chrono::steady_clock::now() + rel_time, std::move(pred));</ins>
  </pre></blockquote>
  <ul>
  <li><del>Executes a loop: Within the loop the function first evaluates <tt>pred()</tt> and exits the loop if the
--- 96907,96920 ----
  </li>
  
  <li>Change 30.5.2 [thread.condition.condvarany] paragraph 28, <tt>wait_for</tt> with predicate <i>Effects</i> as indicated:
! <blockquote><pre>
! template &lt;class Lock, class Rep, class Period, class Predicate&gt;
  bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, Predicate pred);
  </pre></blockquote>
! <blockquote><p>
  28 <i>Effects</i>: <ins>as if</ins>
! </p><blockquote><pre>
! <ins>return wait_until(lock, chrono::steady_clock::now() + rel_time, std::move(pred));</ins>
  </pre></blockquote>
  <ul>
  <li><del>Executes a loop: Within the loop the function first evaluates <tt>pred()</tt> and exits the loop if the
*************** has elapsed.
*** 82964,83017 ****
  </blockquote>
  
  
! <p><b>Proposed resolution:</b></p>
! Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.html">n3191</a>.
! 
  
  
  
  
  <hr>
! <h3><a name="1501"></a>1501. [FCD] spec for managing associated asynchronous
! state has problems</h3>
! <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures">issues</a> in [futures].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-194</b></p>
  
  The specification for managing associated asynchronous
  state is confusing, sometimes omitted, and redundantly
  specified.
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  
! <blockquote>
  Define terms-of-art for releasing, making ready,
  and abandoning an associated asynchronous
  state. Use those terms where appropriate. See
  Appendix 1 - Additional Details
! </blockquote>
  
  
! <p><b>Proposed resolution:</b></p>
  Resolved in Batavia by accepting
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3192.html">n3192</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1508"></a>1508. [FCD] Rename <tt>packaged_task::operator bool()</tt></h3>
! <p><b>Section:</b> 30.6.10 [futures.task] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures.task">issues</a> in [futures.task].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-201</b></p>
  <p>
--- 96947,97553 ----
  </blockquote>
  
  
! <p><b>Proposed resolution:</b></p><p>
! Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3191.htm">n3191</a>.
! </p>
  
  
  
  
  <hr>
! <h3><a name="1501"></a>1501. Specification for managing associated asynchronous state has problems</h3>
! <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures">issues</a> in [futures].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-194</b></p>
  
+ <p>
  The specification for managing associated asynchronous
  state is confusing, sometimes omitted, and redundantly
  specified.
+ </p>
  
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
  
  
! <blockquote><p>
  Define terms-of-art for releasing, making ready,
  and abandoning an associated asynchronous
  state. Use those terms where appropriate. See
  Appendix 1 - Additional Details
! </p></blockquote>
  
  
! <p><b>Proposed resolution:</b></p><p>
  Resolved in Batavia by accepting
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3192.htm">n3192</a>.
! </p>
  
  
  
  
+ <hr>
+ <h3><a name="1502"></a>1502. Specification of [futures.state] unclear</h3>
+ <p><b>Section:</b> 30.6.4 [futures.state] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#futures.state">issues</a> in [futures.state].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses US-195</b></p>
+ 
+ <p>The intent and meaning of 30.6.4 [futures.state] p10 is not apparent.</p>
+ 
+ <blockquote><p>
+ 10 Accesses to the same shared state conflict (1.10).
+ </p></blockquote>
+ 
+ <p><i>[
+ 2011-03-07 Jonathan Wakely adds:
+ ]</i></p>
+ 
+ <blockquote><p>
+ It's not clear which paragraph this refers to, I had to go to the
+ ballot comments where US-195 reveals it's para 8, which in the FCD
+ (N3092) says:
+ </p><blockquote><p>
+  Accesses to the same associated asynchronous state conflict (1.10).
+ </p></blockquote>
+ <p>This is now para 10 in N3242:</p>
+ <blockquote><p>
+  Accesses to the same shared state conflict (1.10).
+ </p></blockquote>
+ </blockquote>
+ 
+ <p><i>[2011-03-07: Lawrence comments and drafts wording]</i></p>
+ 
+ 
+ <p>The intent of this paragraph is to deal with operations,
+ such as <code>shared_future::get()</code>, that return a reference
+ to a value held in the shared state.  User code could potentially
+ conflict when accessing that value.</p>
+ 
+ <p>Lawrence proposed resolution:</p>
+ 
+ <p>Modify 30.6.4 [futures.state] p10 as follows:</p>
+ 
+ <blockquote><p>
+ 10 <del>Accesses to the same shared state conflict (1.10 [intro.multithread]).</del><ins>Some 
+   operations, e.g. <code>shared_future::get()</code>
+  (30.6.7 [futures.shared_future]), may return a reference to a
+  value held in their shared state. Accesses and modifications through
+  those references by concurrent threads to the same 
+  shared state may potentially conflict (1.10 [intro.multithread]).
+  [<i>Note:</i> As a consequence, accesses must either use
+  read-only operations or provide additional synchronization.
+  &mdash; <i>end note</i>]</ins>
+ </p></blockquote>
+ 
+ <p><i>[2011-03-19: Detlef suggests an alternative resolution, shown below.]</i></p>
+ 
+ 
+ <blockquote class="note">
+ <p>Proposed Resolution</p>
+ <p>Modify 30.6.4 [futures.state] p10 as follows:</p>
+ 
+ <blockquote><p>
+ 10 Accesses to the same shared state conflict (1.10 [intro.multithread]). <ins>[<i>Note</i>: 
+ This explicitely specifies that the shared state is visible in the objects that reference this state 
+ in the sense of data race avoidance 17.6.5.9 [res.on.data.races]. &mdash; <i>end note</i>]</ins>
+ </p></blockquote>
+ </blockquote>
+ 
+ 
+ <p><b>Proposed resolution:</b></p><p>
+ Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
+ </p>
+ 
+ 
+ 
  
  <hr>
! <h3><a name="1504"></a>1504. Term "are serialized" is not defined</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-196</b></p>
! <p>
! The term "are serialized" is not defined (30.6.5 [futures.promise] p. 21, 25).
! </p>
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <blockquote><p>
! Replace "are serialized" with "shall not introduce a data race (17.6.4.8)".
! </p></blockquote>
! 
! <p><i>[
! 2010-11-02 Daniel translates proposal into proper wording changes
! ]</i></p>
! 
! 
! <p><i>[2011-03-19: Detlef comments]</i></p>
! 
! 
! <p>The proposed resolution for <a href="lwg-defects.html#1507">1507</a> would cover this issue as well.</p>
! 
! <p><i>[Proposed Resolution]</i></p>
! 
! <blockquote>
! <ol>
! <li>Change 30.6.5 [futures.promise] p. 21 as indicated:
! <blockquote><p>
! 21 <em>Synchronization</em>: calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object <del>are serialized</del><ins>shall not introduce a data race ([res.on.data.races])</ins>.
! [ <em>Note</em>: and they synchronize and serialize with other functions through the referred associated asynchronous
! state. &mdash; <em>end note</em> ]
! </p></blockquote>
! </li>
! <li>Change 30.6.5 [futures.promise] p. 25 as indicated:
! <blockquote><p>
! 25 <em>Synchronization</em>: calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object <del>are serialized</del><ins>shall not introduce a data race ([res.on.data.races])</ins>.
! [ <em>Note</em>: and they synchronize and serialize with other functions through the referred associated asynchronous
! state. &mdash; <em>end note</em> ]
! </p></blockquote>
! </li>
! </ol>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2001-03 Madrid by issue 1507.
! </p>
! 
! 
! 
! <hr>
! <h3><a name="1505"></a>1505. Synchronization between <tt>promise::set_value</tt> and <tt>future::get</tt></h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-197</b></p>
! <p>
! There is no defined synchronization between <tt>promise::set_value</tt> and <tt>future::get</tt> 
! (30.6.5 [futures.promise] p. 21, 25).
! </p>
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <blockquote><p>
! Replace "[<i>Note</i>: and they synchronize and
! serialize with other functions through the referred
! associated asynchronous state. &mdash; <i>end note</i>]" with
! the normative "They synchronize with (1.10) any
! operation on a future object with the same
! associated asynchronous state marked ready."
! </p></blockquote>
! 
! <p><i>[
! 2010-11-02 Daniel translates proposal into proper wording changes
! ]</i></p>
! 
! 
! <p><i>[2011-03-19: Detlef comments]</i></p>
! 
! 
! <p>The proposed resolution for <a href="lwg-defects.html#1507">1507</a> would cover this issue as well.
! Effectively it will reject the request but a clarification is added that the 
! normative wording is already in 30.6.4 [futures.state].</p>
! 
! <blockquote class="note">
! <ol>
! <li>Change 30.6.5 [futures.promise] p. 21 as indicated:
! <blockquote><p>
! 21 <em>Synchronization</em>: calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object are serialized.
! <del>[ <em>Note</em>: and they synchronize and serialize with other functions through the referred associated asynchronous
! state. &mdash; <em>end note</em> ]</del><ins>They <em>synchronize with</em> ([intro.multithread]) any
! operation on a future object with the same associated asynchronous state marked ready.</ins>
! </p></blockquote>
! </li>
! <li>Change 30.6.5 [futures.promise] p. 25 as indicated:
! <blockquote><p>
! 25 <em>Synchronization</em>: calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object are serialized.
! <del>[ <em>Note</em>: and they synchronize and serialize with other functions through the referred associated asynchronous
! state. &mdash; <em>end note</em> ]</del><ins>They <em>synchronize with</em> ([intro.multithread]) any
! operation on a future object with the same associated asynchronous state marked ready.</ins>
! </p></blockquote>
! </li>
! </ol>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2001-03 Madrid by issue 1507.
! </p>
! 
! 
! 
! <hr>
! <h3><a name="1507"></a>1507. <tt>promise::<i>XXX</i>_at_thread_exit</tt> functions have no
! synchronization requirements</h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-199</b></p>
! <p>
! <tt>promise::<i>XXX</i>_at_thread_exit</tt> functions have no
! synchronization requirements. Specifying synchronization
! for these member functions requires coordinating with the
! words in 30.6.5 [futures.promise]/21 and 25, which give synchronization
! requirements for <tt>promise::set_value</tt> and
! <tt>promise::set_exception</tt> (30.6.5 [futures.promise] p. 26 ff., p. 29 ff.).
! </p>
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <blockquote><p>
! Change 30.6.5 [futures.promise]/21 to mention <tt>set_value_at_thread_exit</tt> and
! <tt>set_exception_at_thread_exit;</tt> with this text, replace 30.6.5 [futures.promise]/25 
! and add two new paragraphs, after 30.6.5 [futures.promise]/28 and 30.6.5 [futures.promise]/31.
! </p></blockquote>
! 
! <p><i>[2011-03-8: Lawrence comments and drafts wording]</i></p>
! 
! 
! <p>This comment applies as well to other <tt>*_at_thread_exit</tt>
! functions.  The following resolution adds synchronization paragraphs
! to all of them and edits a couple of related synchronization
! paragraphs.</p>
! 
! <p><i>[2011-03-09: Hans and Anthony add some improvements]</i></p>
! 
! 
! <p><i>[2011-03-19: Detlef comments]</i></p>
! 
! 
! <p>In regard to the suggested part:</p>
! 
! <blockquote><p>
! These operations do not provide any ordering guarantees with
! respect to other operations, except through operations on futures
! that reference the same shared state.
! </p></blockquote>
! 
! <p>I would like this to change to:</p>
! 
! <blockquote><p>
! These operations do not provide any ordering guarantees with
! respect to other operations on the same promise object.
! [<i>Note</i>: They synchronize with calls to operations on
! objects that refer to the same shared state according to
! 30.6.4 [futures.state]. &mdash; <i>end note</i>]
! </p></blockquote>
! 
! <p>The current proposed resolution has exactly the same paragraph at
! for places. I propose to have it only once as new paragraph 2.</p>
! 
! <p>This also covers <a href="lwg-defects.html#1504">1504</a> (US-196) and <a href="lwg-defects.html#1505">1505</a> (US-197).
! US-197 is essentially rejected with this resolution, but a clarification is added 
! that the normative wording is already in 30.6.4 [futures.state].</p>
! 
! <blockquote class="note">
! <p>Proposed Resolution</p>
! <ol>
! <li><p>Edit 30.4.1.2 [thread.mutex.requirements.mutex] paragraph 5 as follows:</p>
! 
! <blockquote><p>
! 5 The implementation shall provide lock and unlock operations, as described below. <del>The implementation 
! shall serialize those operations.</del><ins>For purposes of determining the existence of a data race, these
! behave as atomic operations (1.10 [intro.multithread]).  The lock and unlock operations on
! a single mutex shall appear to occur in a single total order. [<i>Note</i>: this can be viewed as the 
! modification order (1.10 [intro.multithread]) of the mutex. &mdash; <i>end note</i>]</ins> [ <i>Note</i>: 
! Construction and destruction of an object of a mutex type need not be thread-safe; other synchronization 
! should be used to ensure that mutex objects are initialized and visible to other threads. &mdash; <i>end note</i> ]
! </p></blockquote>
! </li>
! 
! <li><p>Edit 30.5 [thread.condition] paragraphs 6-9 as follows:</p>
! 
! <blockquote><pre>
! void notify_all_at_thread_exit(condition_variable&amp; cond, unique_lock&lt;mutex&gt; lk);
! </pre>
! <blockquote>
! <p>
! -6- <i>Requires</i>: <tt>lk</tt> is locked by the calling thread and either
! </p>
! <ul>
! <li>no other thread is waiting on <tt>cond</tt>, or</li>
! <li><tt>lk.mutex()</tt> returns the same value for each of the lock arguments supplied by all concurrently
! waiting (via <tt>wait</tt>, <tt>wait_for</tt>, or <tt>wait_until</tt>) threads.</li>
! </ul>
! <p>
! -7- <i>Effects</i>: transfers ownership of the lock associated with <tt>lk</tt> into internal storage and schedules 
! <tt>cond</tt> to be notified when the current thread exits, after all objects of thread storage duration 
! associated with the current thread have been destroyed. This notification shall be as if
! </p>
! <blockquote><pre>
! lk.unlock();
! cond.notify_all();
! </pre></blockquote>
! <p>
! <ins>-?- <i>Synchronization:</i> The call to <code>notify_all_at_thread_exit</code>
! and the completion of the destructors for all the current thread's variables of 
! thread storage duration synchronize with (1.10 [intro.multithread]) calls 
! to functions waiting on <code>cond</code>.</ins>
! <p/>
! -8- <i>Note</i>: The supplied lock will be held until the thread exits, and care must be taken to ensure that
! this does not cause deadlock due to lock ordering issues. After calling <tt>notify_all_at_thread_exit</tt>
! it is recommended that the thread should be exited as soon as possible, and that no blocking or
! time-consuming tasks are run on that thread.
! <p/>
! -9- <i>Note</i>: It is the user's responsibility to ensure that waiting threads do not erroneously 
! assume that the thread has finished if they experience spurious wakeups. This typically requires 
! that the condition being waited for is satisfied while holding the lock on <tt>lk</tt>, and that 
! this lock is not released and reacquired prior to calling <tt>notify_all_at_thread_exit</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 30.6.5 [futures.promise], paragraphs 14-27 as follows:</p>
! 
! <blockquote><pre>
! void promise::set_value(const R&amp; r);
! void promise::set_value(R&amp;&amp; r);
! void promise&lt;R&amp;&gt;::set_value(R&amp; r);
! void promise&lt;void&gt;::set_value();
! </pre>
! <blockquote>
! <p>
! -14- <i>Effects</i>: atomically stores the value <tt>r</tt> in the shared state and makes that state 
! ready (30.6.4 [futures.state]).
! <p/>
! -15- <i>Throws</i>:
! </p>
! <ul>
! <li><tt>future_error</tt> if its shared state already has a stored value or exception, or</li>
! <li>for the first version, any exception thrown by the copy constructor of <tt>R</tt>, or</li>
! <li>for the second version, any exception thrown by the move constructor of <tt>R</tt>.</li>
! </ul>
! <p>
! -16- <i>Error conditions</i>:
! </p>
! <ul>
! <li><tt>promise_already_satisfied</tt> if its shared state already has a stored value or exception.</li>
! <li><tt>no_state</tt> if <tt>*this</tt> has no shared state.</li>
! </ul>
! <p>
! -17- <i>Synchronization</i>: <del>calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object are serialized. [ <i>Note</i>: And they synchronize and serialize with other functions 
! through the referred shared state. &mdash; <i>end note</i> ]</del><ins>For purposes of determining the 
! existence of a data race, <tt>set_value</tt>, <tt>set_exception</tt>, <tt>set_value_at_thread_exit</tt>,
! and <tt>set_exception_at_thread_exit</tt> behave as atomic operations (1.10 [intro.multithread]) on
! the memory location associated with the <tt>promise</tt>. Calls to these operations on a single promise shall 
! appear to occur in a single total order.  [<i>Note</i>: this can be viewed as the modification order
! (1.10 [intro.multithread]) of the promise. &mdash; <i>end note</i>] These operations do not 
! provide any ordering guarantees with respect to other operations, except through operations on futures
! that reference the same shared state.</ins>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! void set_exception(exception_ptr p);
! </pre>
! <blockquote>
! <p>
! -18- <i>Effects</i>: atomically stores the exception pointer <tt>p</tt> in the shared state and makes that 
! state ready (30.6.4 [futures.state]).
! </p>
! 
! <p>
! -19- <i>Throws</i>: <tt>future_error</tt> if its shared state already has a stored value or exception.
! </p>
! 
! <p>
! -20- <i>Error conditions</i>:
! </p>
! <ul>
! <li><tt>promise_already_satisfied</tt> if its shared state already has a stored value or exception.</li>
! <li><tt>no_state</tt> if <tt>*this</tt> has no shared state.</li>
! </ul>
! 
! <p>
! -21- <i>Synchronization</i>: <del>calls to <tt>set_value</tt> and <tt>set_exception</tt> on a single 
! <tt>promise</tt> object are serialized. [ <i>Note</i>: And they synchronize and serialize with 
! other functions through the referred shared state. &mdash; <i>end note</i> ]</del><ins>For purposes of determining the 
! existence of a data race, <tt>set_value</tt>, <tt>set_exception</tt>, <tt>set_value_at_thread_exit</tt>,
! and <tt>set_exception_at_thread_exit</tt> behave as atomic operations (1.10 [intro.multithread]) on
! the memory location associated with the <tt>promise</tt>. Calls to these operations on a single promise shall 
! appear to occur in a single total order.  [<i>Note</i>: this can be viewed as the modification order
! (1.10 [intro.multithread]) of the promise. &mdash; <i>end note</i>] These operations do not 
! provide any ordering guarantees with respect to other operations, except through operations on futures
! that reference the same shared state.</ins>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! void promise::set_value_at_thread_exit(const R&amp; r);
! void promise::set_value_at_thread_exit(R&amp;&amp; r);
! void promise&lt;R&amp;&gt;::set_value_at_thread_exit(R&amp; r);
! void promise&lt;void&gt;::set_value_at_thread_exit();
! </pre>
! <blockquote>
! <p>
! -22- <i>Effects</i>: Stores the value <tt>r</tt> in the shared state without making that state 
! ready immediately. Schedules that state to be made ready when the current thread exits, after 
! all objects of thread storage duration associated with the current thread have been destroyed.
! <p/>
! -23- <i>Throws</i>: <tt>future_error</tt> if an error condition occurs.
! <p/>
! -24- <i>Error conditions</i>:
! </p>
! <ul>
! <li><tt>promise_already_satisfied</tt> if its shared state already has a stored value or exception.</li>
! <li><tt>no_state</tt> if <tt>*this</tt> has no shared state.</li>
! </ul>
! <p>
! <ins>-??- <i>Synchronization</i>: For purposes of determining the existence of a data race, <tt>set_value</tt>, 
! <tt>set_exception</tt>, <tt>set_value_at_thread_exit</tt>, and <tt>set_exception_at_thread_exit</tt> behave as 
! atomic operations (1.10 [intro.multithread]) on the memory location associated with the <tt>promise</tt>. 
! Calls to these operations on a single promise shall appear to occur in a single total order.  [<i>Note</i>: 
! this can be viewed as the modification order (1.10 [intro.multithread]) of the promise. &mdash; 
! <i>end note</i>] These operations do not provide any ordering guarantees with respect to other operations, 
! except through operations on futures that reference the same shared state.</ins>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! void promise::set_exception_at_thread_exit(exception_ptr p);
! </pre>
! <blockquote>
! <p>
! -25- <i>Effects</i>: Stores the exception pointer <tt>p</tt> in the shared state without 
! making that state ready immediately. Schedules that state to be made ready when the current 
! thread exits, after all objects of thread storage duration associated with the current 
! thread have been destroyed.
! <p/>
! -26- <i>Throws</i>: <tt>future_error</tt> if an error condition occurs.
! <p/>
! -27- <i>Error conditions</i>:
! </p>
! <ul>
! <li><tt>promise_already_satisfied</tt> if its shared state already has a stored value or exception.</li>
! <li><tt>no_state</tt> if <tt>*this</tt> has no shared state.</li>
! </ul>
! <p>
! <ins>-??- <i>Synchronization</i>: For purposes of determining the existence of a data race, <tt>set_value</tt>, 
! <tt>set_exception</tt>, <tt>set_value_at_thread_exit</tt>, and <tt>set_exception_at_thread_exit</tt> behave as 
! atomic operations (1.10 [intro.multithread]) on the memory location associated with the <tt>promise</tt>. 
! Calls to these operations on a single promise shall appear to occur in a single total order.  [<i>Note</i>: 
! this can be viewed as the modification order (1.10 [intro.multithread]) of the promise. &mdash; 
! <i>end note</i>] These operations do not provide any ordering guarantees with respect to other operations, 
! except through operations on futures that reference the same shared state.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 30.6.9.1 [futures.task.members], paragraph 15-21 as follows:</p>
! 
! <blockquote><pre>
! void operator()(ArgTypes... args);
! </pre>
! <blockquote>
! <p>
! -15- <i>Effects</i>: <tt><var>INVOKE</var>(f, t1, t2, ..., tN, R)</tt>, where <tt>f</tt> is the stored task 
! of <tt>*this</tt> and <tt>t1</tt>, <tt>t2</tt>, <tt>...</tt>, <tt>tN</tt> are the values in 
! <tt>args...</tt>. If the task returns normally, the return value is stored as the asynchronous 
! result in the shared state of <tt>*this</tt>, otherwise the exception thrown by the task is 
! stored. The shared state of <tt>*this</tt> is made ready, and any threads blocked in a function 
! waiting for the shared state of <tt>*this</tt> to become ready are unblocked.
! <p/>
! -16- <i>Throws</i>: a <tt>future_error</tt> exception object if there is no shared state or the stored 
! task has already been invoked.
! <p/>
! -17- <i>Error conditions</i>:
! </p>
! <ul>
! <li><tt>promise_already_satisfied</tt> if the shared state is already ready.</li>
! <li><tt>no_state</tt> if <tt>*this</tt> has no shared state.</li>
! </ul>
! <p>
! -18- <i>Synchronization</i>: a successful call to <tt>operator()</tt> synchronizes with (1.10 [intro.multithread]) 
! a call to any member function of a <tt>future</tt> or <tt>shared_future</tt> object that shares the 
! shared state of <tt>*this</tt>. The completion of the invocation of the stored task and the storage 
! of the result (whether normal or exceptional) into the shared state synchronizes with (1.10 [intro.multithread]) 
! the successful return from any member function that detects that the state is set to ready. [ <i>Note</i>: 
! <tt>operator()</tt> synchronizes and serializes with other functions through the shared state. &mdash; <i>end note</i> ]
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! void make_ready_at_thread_exit(ArgTypes... args);
! </pre>
! <blockquote>
! <p>
! -19- <i>Effects</i>: <tt><var>INVOKE</var>(f, t1, t2, ..., tN, R)</tt>, where <tt>f</tt> is the 
! stored task and <tt>t1</tt>, <tt>t2</tt>, <tt>...</tt>, <tt>tN</tt> are the values in <tt>args...</tt>. 
! If the task returns normally, the return value is stored as the asynchronous result in the shared 
! state of <tt>*this</tt>, otherwise the exception thrown by the task is stored. In either case, 
! this shall be done without making that state ready (30.6.4 [futures.state]) immediately. 
! Schedules the shared state to be made ready when the current thread exits, after all objects of 
! thread storage duration associated with the current thread have been destroyed.
! <p/>
! -20- <i>Throws</i>: <tt>future_error</tt> if an error condition occurs.
! <p/>
! -21- <i>Error conditions</i>:
! </p>
! <ul>
! <li><tt>promise_already_satisfied</tt> if the shared state already has a stored value or exception.</li>
! <li><tt>no_state</tt> if <tt>*this</tt> has no shared state.</li>
! </ul>
! <p>
! <ins>-??- <i>Synchronization:</i> a successful call to <code>make_ready_at_thread_exit</code>
! synchronizes with (1.10 [intro.multithread]) a call to any member function of
! a <code>future</code> or <code>shared_future</code> object that shares the shared state of 
! <code>*this</code>. The completion of</ins>
! </p>
! <ul>
! <li><p><ins>the invocation of the stored task and the storage of the result (whether normal or 
! exceptional) into the shared state</ins></p></li>
! <li><p><ins>the destructors for all the current thread's variables of thread storage duration</ins></p></li>
! </ul>
! <p>
! <ins>synchronize with (1.10 [intro.multithread]) the successful return from any member function
! that detects that the state is set to ready. [<i>Note:</i> <code>make_ready_at_thread_exit</code>
! synchronizes and serializes with other functions through the shared state. &mdash; <i>end note</i>]</ins>
! </p>
! </blockquote></blockquote>
! 
! </li>
! </ol>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="1508"></a>1508. Rename <tt>packaged_task::operator bool()</tt></h3>
! <p><b>Section:</b> 30.6.9 [futures.task] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task">issues</a> in [futures.task].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses US-201</b></p>
  <p>
*************** The names of these members should be the
*** 83025,83034 ****
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote>
  Replaced the name <tt>packaged_task::operator bool()</tt> with <tt>packaged_task::valid()</tt> in the synopsis
! (30.6.10 [futures.task]/2) and the member function specification (before 30.6.10.1 [futures.task.members]/15).
! </blockquote>
  
  <p><i>[
  2010-11-02 Daniel translates proposed wording changes into a proper proposed resolution
--- 97561,97570 ----
  Resolution proposed by ballot comment:
  ]</i></p>
  
! <blockquote><p>
  Replaced the name <tt>packaged_task::operator bool()</tt> with <tt>packaged_task::valid()</tt> in the synopsis
! (30.6.9 [futures.task]/2) and the member function specification (before 30.6.9.1 [futures.task.members]/15).
! </p></blockquote>
  
  <p><i>[
  2010-11-02 Daniel translates proposed wording changes into a proper proposed resolution
*************** conversion to bool.
*** 83038,83044 ****
  
  
  <p><i>[Resolved in Batavia by accepting
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3194.html">n3194</a>.
  ]</i></p>
  
  
--- 97574,97580 ----
  
  
  <p><i>[Resolved in Batavia by accepting
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3194.htm">n3194</a>.
  ]</i></p>
  
  
*************** conversion to bool.
*** 83046,83053 ****
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change 30.6.10 [futures.task]/2, class template <tt>packaged_task</tt> synopsis as indicated:
! <blockquote><pre>template&lt;class R, class... ArgTypes&gt;
  class packaged_task&lt;R(ArgTypes...)&gt; {
  public:
    typedef R result_type;
--- 97582,97590 ----
  
  <p><b>Proposed resolution:</b></p>
  <ol>
! <li>Change 30.6.9 [futures.task]/2, class template <tt>packaged_task</tt> synopsis as indicated:
! <blockquote><pre>
! template&lt;class R, class... ArgTypes&gt;
  class packaged_task&lt;R(ArgTypes...)&gt; {
  public:
    typedef R result_type;
*************** public:
*** 83057,83067 ****
  };
  </pre></blockquote>
  </li>
! <li>Change 30.6.10 [futures.task] before p. 15 as indicated:
! <blockquote><pre><del>explicit operator</del> bool <ins>valid</ins>() const;
! </pre><blockquote>
  15 <em>Returns</em>: true only if <tt>*this</tt> has an associated asynchronous state.
! <p>
  16 <em>Throws</em>: nothing.
  </p></blockquote></blockquote>
  </li>
--- 97594,97605 ----
  };
  </pre></blockquote>
  </li>
! <li>Change 30.6.9 [futures.task] before p. 15 as indicated:
! <blockquote><pre>
! <del>explicit operator</del> bool <ins>valid</ins>() const;
! </pre><blockquote><p>
  15 <em>Returns</em>: true only if <tt>*this</tt> has an associated asynchronous state.
! <p/>
  16 <em>Throws</em>: nothing.
  </p></blockquote></blockquote>
  </li>
*************** public:
*** 83072,83085 ****
  
  
  <hr>
! <h3><a name="1513"></a>1513. [FCD] 'launch' enum too restrictive</h3>
! <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures">issues</a> in [futures].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-36</b></p>
! 
  Providing only three different possible values for the enum
  <tt>launch</tt> and saying that <tt>launch::any</tt> means either
  <tt>launch::sync</tt> or <tt>launch::async</tt> is very restricting. This
--- 97610,97623 ----
  
  
  <hr>
! <h3><a name="1513"></a>1513. 'launch' enum too restrictive</h3>
! <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Switzerland <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures">issues</a> in [futures].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses CH-36</b></p>
! <p>
  Providing only three different possible values for the enum
  <tt>launch</tt> and saying that <tt>launch::any</tt> means either
  <tt>launch::sync</tt> or <tt>launch::async</tt> is very restricting. This
*************** in the function called through <tt>async
*** 83097,83103 ****
  path to effortless profit from improved hardware/software
  without complicating the programming model when just
  using <tt>async(launch::any,...)</tt>
! 
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
--- 97635,97641 ----
  path to effortless profit from improved hardware/software
  without complicating the programming model when just
  using <tt>async(launch::any,...)</tt>
! </p>
  <p><i>[
  Resolution proposed by ballot comment:
  ]</i></p>
*************** further implementation defined values an
*** 83108,83120 ****
  the following bit-operators on the launch values
  (<tt>operator|</tt>, <tt>operator&amp;</tt>, <tt>operator~</tt> delivering a
  <tt>launch</tt> value).
! </p><p>
  Note: a possible implementation might use an
  unsigned value to represent the <tt>launch</tt> enums,
  but we shouldn't limit the standard to just 32 or 64
  available bits in that case and also should keep
  the launch enums in their own enum namespace.
! </p><p>
  Change [future.async] p3 according to the
  changes to <tt>enum launch</tt>. change --<tt>launch::any</tt> to
  "the implementation may choose any of the
--- 97646,97658 ----
  the following bit-operators on the launch values
  (<tt>operator|</tt>, <tt>operator&amp;</tt>, <tt>operator~</tt> delivering a
  <tt>launch</tt> value).
! <p/>
  Note: a possible implementation might use an
  unsigned value to represent the <tt>launch</tt> enums,
  but we shouldn't limit the standard to just 32 or 64
  available bits in that case and also should keep
  the launch enums in their own enum namespace.
! <p/>
  Change [future.async] p3 according to the
  changes to <tt>enum launch</tt>. change --<tt>launch::any</tt> to
  "the implementation may choose any of the
*************** either performed like <tt>launch::async<
*** 83133,83155 ****
  ]</i></p>
  
  
! <blockquote>
  The new paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3113.html">n3113</a> provides concrete wording.
! </blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
! Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3188.html">n3188</a>.
  
  
  
  
  
  <hr>
! <h3><a name="1516"></a>1516. [FCD] No specification for which header contains <tt>auto_ptr</tt></h3>
! <p><b>Section:</b> D.12 [depr.auto.ptr] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-142</b></p>
  <p>
--- 97671,97818 ----
  ]</i></p>
  
  
! <blockquote><p>
  The new paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3113.html">n3113</a> provides concrete wording.
! </p></blockquote>
  
  
  <p><b>Proposed resolution:</b></p>
! <p>
! Resolved by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3188.htm">n3188</a>.
! </p>
  
  
  
  
  
  <hr>
! <h3><a name="1514"></a>1514. <tt>packaged_task</tt> constructors need review</h3>
! <p><b>Section:</b> 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-207</b></p>
! <p>
! The constructor that takes <tt>R(*)(ArgTypes...)</tt> is not
! needed; the constructor that takes a callable type works
! for this argument type. More generally, the constructors
! for packaged_task should parallel those for function.
! </p>
! <p><i>[
! US-207 Suggested Resolution:
! ]</i></p>
! 
! 
! <blockquote><p>
! Review the constructors for packaged_task and
! provide the same ones as function, except where
! inappropriate.
! </p></blockquote>
! 
! <p><i>[
! 2010-10-22 Howard provides wording, as requested by the LWG in Rapperswil.
! ]</i></p>
! 
! 
! <p><i>[2011-02-10 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Alter the list of constructors in both 30.6.9 [futures.task] and in 30.6.9.1 [futures.task.members] as indicated:
! </p>
! <blockquote>
! <pre><del>template &lt;class F&gt;
! explicit packaged_task(F f);
! template &lt;class F, class Allocator&gt;
! explicit packaged_task(allocator_arg_t, const Allocator&amp; a, F f);
! explicit packaged_task(R(*f)(ArgTypes...));</del>
! template &lt;class F&gt;
! explicit packaged_task(F&amp;&amp; f);
! template &lt;class F, class Allocator&gt;
! explicit packaged_task(allocator_arg_t, const Allocator&amp; a, F&amp;&amp; f);
! </pre>
! </blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="1515"></a>1515. <tt>packaged_task::make_ready_at_thread_exit</tt> has no synchronization requirements</h3>
! <p><b>Section:</b> 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> INCITS <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US-208</b></p>
! 
! <p>
! <tt>packaged_task::make_ready_at_thread_exit</tt> has no synchronization requirements.
! </p>
! 
! <p><i>[
! Resolution proposed by ballot comment:
! ]</i></p>
! 
! <p>
! Figure out what the synchronization requirements
! should be and write them.
! </p>
! 
! <p><i>[2011-02-09 Anthony provides a proposed resolution]</i></p>
! 
! 
! <p><i>[2011-02-19 Additional edits by Hans, shown in the proposed resolution section]</i></p>
! 
! 
! <p><i>[2011-02-22 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p> 
! 
! <blockquote class="note">
! <p>Proposed Resolution</p>
! 
! <p>Add a new paragraph following 30.6.9.1 [futures.task.members] p. 19:</p>
! 
! <blockquote><pre>
! void make_ready_at_thread_exit(ArgTypes... args);
! </pre></blockquote>
! <blockquote>
! <p>
! 19 - ...
! </p>
! <p>
! <ins>?? - <i>Synchronization</i>: Following a successful call to <tt>make_ready_at_thread_exit</tt>, the
! destruction of all objects with thread storage duration associated with
! the current thread happens before the associated asynchronous state is
! made ready. The marking of the associated asynchronous state as ready
! synchronizes with (1.10 [intro.multithread]) the successful return from any function that
! detects that the state is set to ready.</ins>
! </p>
! </blockquote>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="1516"></a>1516. No specification for which header contains <tt>auto_ptr</tt></h3>
! <p><b>Section:</b> X [depr.auto.ptr] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> BSI <b>Opened:</b> 2010-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p><b>Addresses GB-142</b></p>
  <p>
*************** Post-Rapperswil
*** 83171,83179 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 97834,97842 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 83185,83194 ****
  <p><b>Proposed resolution:</b></p>
  
  <p>Add the following lines to the synopsis of header <tt>&lt;memory&gt;</tt>
! in [memory]/1:<br></p>
  <blockquote>
! <pre><ins>// [depr.auto.ptr], Class auto_ptr (deprecated):
! template &lt;class X&gt; class auto_ptr;<br></ins>
  </pre></blockquote>
  
  
--- 97848,97858 ----
  <p><b>Proposed resolution:</b></p>
  
  <p>Add the following lines to the synopsis of header <tt>&lt;memory&gt;</tt>
! in [memory]&#47;1:<br/></p>
  <blockquote>
! <pre>
! <ins>// [depr.auto.ptr], Class auto_ptr (deprecated):
! template &lt;class X&gt; class auto_ptr;<br/></ins>
  </pre></blockquote>
  
  
*************** template &lt;class X&gt; class auto_ptr;
*** 83197,83206 ****
  
  <hr>
  <h3><a name="1517"></a>1517. default_delete's default constructor should be trivial</h3>
! <p><b>Section:</b> 20.9.9.1.2 [unique.ptr.dltr.dflt] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-09-12 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unique.ptr.dltr.dflt">issues</a> in [unique.ptr.dltr.dflt].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current working draft does specify the default c'tor of <tt>default_delete</tt> in a manner
--- 97861,97870 ----
  
  <hr>
  <h3><a name="1517"></a>1517. default_delete's default constructor should be trivial</h3>
! <p><b>Section:</b> 20.8.1.1.2 [unique.ptr.dltr.dflt] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-09-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.dltr.dflt">issues</a> in [unique.ptr.dltr.dflt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The current working draft does specify the default c'tor of <tt>default_delete</tt> in a manner
*************** calling <tt>delete</tt> or <tt>delete[]<
*** 83212,83219 ****
  </p>
  <p>
  In agreement with the new settled core language rules this easy to realize by just changing the declaration to
! </p><blockquote><pre>constexpr default_delete()<ins> = default</ins>;
! </pre></blockquote><p></p>
  <p>
  This proposal also automatically solves the problem, that the semantics of the default constructor of the 
  partial specialization <tt>default_delete&lt;T[]&gt;</tt> is not specified at all. By defaulting its default constructor 
--- 97876,97885 ----
  </p>
  <p>
  In agreement with the new settled core language rules this easy to realize by just changing the declaration to
! </p>
! <blockquote><pre>
! constexpr default_delete()<ins> = default</ins>;
! </pre></blockquote>
  <p>
  This proposal also automatically solves the problem, that the semantics of the default constructor of the 
  partial specialization <tt>default_delete&lt;T[]&gt;</tt> is not specified at all. By defaulting its default constructor 
*************** Post-Rapperswil
*** 83225,83233 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 97891,97899 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 83241,83247 ****
  
  <ol>
  <li>Change the synopsis of the primary template definition of <tt>default_delete</tt> in [unique.ptr.dltr.dflt] as indicated:
! <blockquote><pre>namespace std {
    template &lt;class T&gt; struct default_delete {
      constexpr default_delete()<ins> = default</ins>;
      template &lt;class U&gt; default_delete(const default_delete&lt;U&gt;&amp;);
--- 97907,97914 ----
  
  <ol>
  <li>Change the synopsis of the primary template definition of <tt>default_delete</tt> in [unique.ptr.dltr.dflt] as indicated:
! <blockquote><pre>
! namespace std {
    template &lt;class T&gt; struct default_delete {
      constexpr default_delete()<ins> = default</ins>;
      template &lt;class U&gt; default_delete(const default_delete&lt;U&gt;&amp;);
*************** Adopted at 2010-11 Batavia
*** 83254,83266 ****
  Remove the prototype specification of the <tt>default_delete</tt> default constructor in [unique.ptr.dltr.dflt]/1. This
  brings it in harmony with the style used in the partial specialization <tt>default_delete&lt;T[]&gt;</tt>. Since there are
  neither implied nor explicit members, there is no possibility to misinterpret what the constructor does:
! <blockquote><pre><del>constexpr default_delete();</del>
! </pre><blockquote>
  <del>1 <em>Effects</em>: Default constructs a <tt>default_delete</tt> object.</del>
! </blockquote></blockquote>
  </li>
  <li>Change the synopsis of the partial specialization of <tt>default_delete</tt> in [unique.ptr.dltr.dflt1] as indicated:
! <blockquote><pre>namespace std {
    template &lt;class T&gt; struct default_delete&lt;T[]&gt; {
      constexpr default_delete()<ins> = default</ins>;
      void operator()(T*) const;
--- 97921,97935 ----
  Remove the prototype specification of the <tt>default_delete</tt> default constructor in [unique.ptr.dltr.dflt]/1. This
  brings it in harmony with the style used in the partial specialization <tt>default_delete&lt;T[]&gt;</tt>. Since there are
  neither implied nor explicit members, there is no possibility to misinterpret what the constructor does:
! <blockquote><pre>
! <del>constexpr default_delete();</del>
! </pre><blockquote><p>
  <del>1 <em>Effects</em>: Default constructs a <tt>default_delete</tt> object.</del>
! </p></blockquote></blockquote>
  </li>
  <li>Change the synopsis of the partial specialization of <tt>default_delete</tt> in [unique.ptr.dltr.dflt1] as indicated:
! <blockquote><pre>
! namespace std {
    template &lt;class T&gt; struct default_delete&lt;T[]&gt; {
      constexpr default_delete()<ins> = default</ins>;
      void operator()(T*) const;
*************** neither implied nor explicit members, th
*** 83276,83285 ****
  
  <hr>
  <h3><a name="1518"></a>1518. Waiting for deferred functions</h3>
! <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2010-09-14 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#futures">issues</a> in [futures].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The current WP N3126 contains ambiguous statements about the
  behaviour of functions <tt>wait_for</tt>/<tt>wait_until</tt> in
--- 97945,97954 ----
  
  <hr>
  <h3><a name="1518"></a>1518. Waiting for deferred functions</h3>
! <p><b>Section:</b> 30.6 [futures] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2010-09-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures">issues</a> in [futures].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>The current WP N3126 contains ambiguous statements about the
  behaviour of functions <tt>wait_for</tt>/<tt>wait_until</tt> in
*************** in the original async proposals, that ma
*** 83289,83295 ****
  inadvertently during the "async cleanup" that occurred recently.
  Consider the following case:</p>
  <blockquote>
! <pre>int f();  
  future&lt;int&gt; x = async(launch::deferred, f);
  future_status s = x.wait_for(chrono::milliseconds(100));
  </pre></blockquote>
--- 97958,97965 ----
  inadvertently during the "async cleanup" that occurred recently.
  Consider the following case:</p>
  <blockquote>
! <pre>
! int f();  
  future&lt;int&gt; x = async(launch::deferred, f);
  future_status s = x.wait_for(chrono::milliseconds(100));
  </pre></blockquote>
*************** is even worse. Consider that the executi
*** 83318,83324 ****
  <tt>f</tt> can take an arbitrarily long time. Having
  <tt>wait_for()</tt> invoke <tt>f</tt> is a potential violation of
  the reasonable expectation that the execution of
! <tt>x.wait_for(chrono::milliseconds(100))</tt> shall take <u>at most</u>
  100 milliseconds plus a delay dependent on the quality of implementation
  and the quality of management (as described in paper N3128).
  In fact, previous versions of the WP
--- 97988,97994 ----
  <tt>f</tt> can take an arbitrarily long time. Having
  <tt>wait_for()</tt> invoke <tt>f</tt> is a potential violation of
  the reasonable expectation that the execution of
! <tt>x.wait_for(chrono::milliseconds(100))</tt> shall take <span style="text-decoration:underline">at most</span>
  100 milliseconds plus a delay dependent on the quality of implementation
  and the quality of management (as described in paper N3128).
  In fact, previous versions of the WP
*************** Post-Rapperswil
*** 83354,83362 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 98024,98032 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** associated asynchronous state is ready o
*** 83381,83387 ****
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.6/23 first bullet:</p>
! <p>— future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
--- 98051,98057 ----
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.6/23 first bullet:</p>
! <p>&mdash; future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
*************** associated asynchronous state is ready o
*** 83393,83399 ****
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.6/26 first bullet:</p>
! <p>— future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
--- 98063,98069 ----
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.6/26 first bullet:</p>
! <p>&mdash; future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
*************** associated asynchronous state is ready o
*** 83405,83411 ****
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.7/28 first bullet:</p>
! <p>— future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
--- 98075,98081 ----
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.7/28 first bullet:</p>
! <p>&mdash; future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
*************** associated asynchronous state is ready o
*** 83417,83423 ****
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.7/31 first bullet:</p>
! <p>— future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
--- 98087,98093 ----
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.7/31 first bullet:</p>
! <p>&mdash; future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
*************** associated asynchronous state is ready o
*** 83429,83435 ****
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.8/24 first bullet:</p>
! <p>— future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
--- 98099,98105 ----
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.8/24 first bullet:</p>
! <p>&mdash; future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
*************** associated asynchronous state is ready o
*** 83441,83447 ****
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.8/28 first bullet:</p>
! <p>— future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
--- 98111,98117 ----
  </li>
  <li>
  <p>In [futures.unique_future] 30.6.8/28 first bullet:</p>
! <p>&mdash; future_status::deferred if the associated asynchronous
  state contains a deferred function <del>that is not
  running</del>.</p>
  </li>
*************** function has completed</del>.</p>
*** 83466,83475 ****
  
  <hr>
  <h3><a name="1519"></a>1519. bucketsize() const only for unordered set</h3>
! <p><b>Section:</b> 23.7.1 [unord.map], 23.7.2 [unord.multimap], 23.7.4 [unord.multiset] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-10-09 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#unord.map">issues</a> in [unord.map].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  While <tt>bucket_size()</tt> is const for <tt>unordered_set</tt>, for all other unordered containers it is not defined as
--- 98136,98145 ----
  
  <hr>
  <h3><a name="1519"></a>1519. bucketsize() const only for unordered set</h3>
! <p><b>Section:</b> 23.5.4 [unord.map], 23.5.5 [unord.multimap], 23.5.7 [unord.multiset] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2010-10-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.map">issues</a> in [unord.map].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  While <tt>bucket_size()</tt> is const for <tt>unordered_set</tt>, for all other unordered containers it is not defined as
*************** Post-Rapperswil
*** 83481,83489 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 98151,98159 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** Adopted at 2010-11 Batavia
*** 83498,83504 ****
  
  <ol>
  <li>Change 23.7.1 Class template unordered_map [unord.map]/3, as indicated:
! <blockquote><pre>  namespace std {
      template &lt;class Key,
        class T,
        class Hash = hash&lt;Key&gt;,
--- 98168,98175 ----
  
  <ol>
  <li>Change 23.7.1 Class template unordered_map [unord.map]/3, as indicated:
! <blockquote><pre>
!   namespace std {
      template &lt;class Key,
        class T,
        class Hash = hash&lt;Key&gt;,
*************** Adopted at 2010-11 Batavia
*** 83516,83522 ****
  </pre></blockquote>
  </li>
  <li>Change 23.7.2 Class template unordered_multimap [unord.multimap]/3, as indicated:
! <blockquote><pre>  namespace std {
      template &lt;class Key,
        class T,
        class Hash = hash&lt;Key&gt;,
--- 98187,98194 ----
  </pre></blockquote>
  </li>
  <li>Change 23.7.2 Class template unordered_multimap [unord.multimap]/3, as indicated:
! <blockquote><pre>
!   namespace std {
      template &lt;class Key,
        class T,
        class Hash = hash&lt;Key&gt;,
*************** Adopted at 2010-11 Batavia
*** 83534,83540 ****
  </pre></blockquote>
  </li>
  <li>Change 23.7.4 Class template unordered_multiset [unord.multiset]/3, as indicated:
! <blockquote><pre>  namespace std {
      template &lt;class Key,
        class Hash = hash&lt;Key&gt;,
        class Pred = std::equal_to&lt;Key&gt;,
--- 98206,98213 ----
  </pre></blockquote>
  </li>
  <li>Change 23.7.4 Class template unordered_multiset [unord.multiset]/3, as indicated:
! <blockquote><pre>
!   namespace std {
      template &lt;class Key,
        class Hash = hash&lt;Key&gt;,
        class Pred = std::equal_to&lt;Key&gt;,
*************** Adopted at 2010-11 Batavia
*** 83559,83568 ****
  
  <hr>
  <h3><a name="1520"></a>1520. <tt>INVOKE</tt> on member data pointer with too many arguments</h3>
! <p><b>Section:</b> 20.8.2 [func.require] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-10-10 <b>Last modified:</b> 2010-11-23</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#func.require">issues</a> in [func.require].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
--- 98232,98242 ----
  
  <hr>
  <h3><a name="1520"></a>1520. <tt>INVOKE</tt> on member data pointer with too many arguments</h3>
! <p><b>Section:</b> 20.9.2 [func.require] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-10-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.require">active issues</a> in [func.require].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.require">issues</a> in [func.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  
  <p>
*************** Does the presence of <tt>t2, ..., tN</tt
*** 83616,83622 ****
  Here is sample code which presents the problem in a concrete example:
  </p>
  
! <blockquote><pre>#include &lt;functional&gt;
  #include &lt;cassert&gt;
  
  struct S {
--- 98290,98297 ----
  Here is sample code which presents the problem in a concrete example:
  </p>
  
! <blockquote><pre>
! #include &lt;functional&gt;
  #include &lt;cassert&gt;
  
  struct S {
*************** int main()
*** 83639,83645 ****
  Without the "<tt>3.0</tt>" the example is well formed.
  </p>
  <p>
! [Note: Daniel provided wording to make it explicit that the above example is ill-formed. — end note ]
  </p>
  
  <p><i>[
--- 98314,98320 ----
  Without the "<tt>3.0</tt>" the example is well formed.
  </p>
  <p>
! [Note: Daniel provided wording to make it explicit that the above example is ill-formed. &mdash; end note ]
  </p>
  
  <p><i>[
*************** Post-Rapperswil
*** 83647,83655 ****
  ]</i></p>
  
  
! <blockquote>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
--- 98322,98330 ----
  ]</i></p>
  
  
! <blockquote><p>
  Moved to Tentatively Ready after 5 positive votes on c++std-lib.
! </p></blockquote>
  
  <p><i>[
  Adopted at 2010-11 Batavia
*************** described in the previous item;
*** 83701,83719 ****
  
  <hr>
  <h3><a name="1522"></a>1522. <tt>conj</tt> specification is now nonsense</h3>
! <p><b>Section:</b> 26.4.9 [cmplx.over] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2010-10-14 <b>Last modified:</b> 2010-11-24</p>
! <p><b>View all other</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-index.html#cmplx.over">issues</a> in [cmplx.over].</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#WP">WP</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Pittsburgh, we accepted the resolution of library issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#1137">1137</a>, to add
  a sentence 3 to [cmplx.over]:
  </p>
! <blockquote>
  All the specified overloads shall have a return type which is the nested
  <tt>value_type</tt> of the effectively cast arguments.
! </blockquote>
  <p>
  This was already true for four of the six functions except <tt>conj</tt> and
  <tt>proj</tt>. It is not completely unreasonable to make <tt>proj</tt> return
--- 98376,98394 ----
  
  <hr>
  <h3><a name="1522"></a>1522. <tt>conj</tt> specification is now nonsense</h3>
! <p><b>Section:</b> 26.4.9 [cmplx.over] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2010-10-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#cmplx.over">issues</a> in [cmplx.over].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
! In Pittsburgh, we accepted the resolution of library issue <a href="lwg-defects.html#1137">1137</a>, to add
  a sentence 3 to [cmplx.over]:
  </p>
! <blockquote><p>
  All the specified overloads shall have a return type which is the nested
  <tt>value_type</tt> of the effectively cast arguments.
! </p></blockquote>
  <p>
  This was already true for four of the six functions except <tt>conj</tt> and
  <tt>proj</tt>. It is not completely unreasonable to make <tt>proj</tt> return
*************** Adopted at 2010-11 Batavia
*** 83744,83771 ****
  <p>
  Remove the recently added paragraph 3 from [cmplx.over]:
  </p>
! <blockquote>
  <del>3 All the specified overloads shall have a return type which is the nested 
  <tt>value_type</tt> of the effectively cast arguments.</del>
  </blockquote>
  
  
  
  
  
  <hr>
  <h3><a name="2002"></a>2002. Class template <tt>match_results</tt> does not specify the semantics of <tt>operator==</tt></h3>
! <p><b>Section:</b> 28.10.8 [re.results.nonmember] <b>Status:</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Krügler <b>Opened:</b> 2010-10-24 <b>Last modified:</b> 2010-11-26</p>
! <p><b>View all issues with</b> <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <em>Returns</em> element of <tt>operator==</tt> says:
  </p>
  
! <blockquote>
  <tt>true</tt> only if the two objects refer to the same match
! </blockquote>
  
  <p>
  It is not really clear what this means: The current specification would allow for an
--- 98419,98861 ----
  <p>
  Remove the recently added paragraph 3 from [cmplx.over]:
  </p>
! <blockquote><p>
  <del>3 All the specified overloads shall have a return type which is the nested 
  <tt>value_type</tt> of the effectively cast arguments.</del>
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1523"></a>1523. <tt>noexcept</tt> for Clause 29</h3>
+ <p><b>Section:</b> 29 [atomics] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2010-11-13 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#atomics">issues</a> in [atomics].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-63 for Clause 29</b></p>
+ 
+ <p>Clause 29 does not specify noexcept for any of the atomic operations.
+ It probably should, though that's not completely clear.
+ In particular, atomics may want to throw in implementations that support transactional memory.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Apply paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3251.html">N3251</a>,
+ noexcept for the Atomics Library.
+ </p>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1524"></a>1524. Allocation functions are missing <i>happens-before</i> requirements and guarantees</h3>
+ <p><b>Section:</b> 18.6.1.4 [new.delete.dataraces] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2011-02-26 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#new.delete.dataraces">issues</a> in [new.delete.dataraces].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses US-34</b></p>
+ 
+ <p>Technical details:
+ <p/>
+ When the same unit of storage is allocated and deallocated repeatedly, operations on it can't be allowed to
+ race between the allocator and the user program. But I don't see any mention of <i>happens-before</i> in the
+ descriptions of allocation and deallocation functions.
+ <p/>
+ Proposed resolution (not wording yet):
+ </p>
+ <ul>
+ <li><p>The call to an allocation function returning a pointer <tt>P</tt> must happen-before the matching
+ deallocation call with <tt>P</tt> as a parameter. Otherwise the behavior is undefined. I don't know whether
+ receiving <tt>P</tt> with <tt>memory_order_consume</tt> fits this requirement. <tt>memory_order_relaxed</tt> does not.</p>
+ </li>
+ <li><p>If some memory is passed to a deallocation function, the implementation must ensure that the
+ deallocation call happens-before any allocation call that returns the same memory address.</p>
+ </li>
+ </ul>
+ 
+ <p><i>[2011-02-26: Hans comments and drafts wording]</i></p>
+ 
+ 
+ <p>The second requirement already exists, almost verbatim, as 18.6.1.4 [new.delete.dataraces] p. 1. 
+ I think this is where the statement belongs.  However, this paragraph requires work to correctly address 
+ the first part of the issue.
+ </p>
+ 
+ <p><i>[Adopted at Madrid, 2011-03]</i></p>
+ 
+ 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>Change 18.6.1.4 [new.delete.dataraces] p. 1 as follows:</p>
+ 
+ <blockquote><p>
+ 1 <del>The library versions of <tt>operator new</tt> and <tt>operator delete</tt>, user replacement versions of global 
+ <tt>operator new</tt> and <tt>operator delete</tt>, and the C standard library functions <tt>calloc</tt>, <tt>malloc</tt>, 
+ <tt>realloc</tt>, and <tt>free</tt> shall not introduce data races (1.10 [intro.multithread]) as a result 
+ of concurrent calls from different threads.</del><ins> For purposes of determining the existence of data races,
+ the library versions of <tt>operator new</tt>, user replacement versions of global <tt>operator new</tt>, and the C 
+ standard library functions <tt>calloc</tt> and <tt>malloc</tt> shall behave as though they accessed and modified only 
+ the storage referenced by the return value. The library versions of <tt>operator delete</tt>, user replacement
+ versions of <tt>operator delete</tt>, and the C standard library function <tt>free</tt> shall behave as though they 
+ accessed and modified only the storage referenced by their first argument. The C standard library <tt>realloc</tt> 
+ function shall behave as though it accessed and modified only the storage referenced by its first argument and by 
+ its return value.</ins> Calls to these functions that allocate or deallocate a particular unit of storage 
+ shall occur in a single total order, and each such deallocation call shall happen before the next allocation 
+ (if any) in this order.
+ </p></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1525"></a>1525. Effects of <tt>resize(size())</tt> on a <tt>vector</tt></h3>
+ <p><b>Section:</b> 23.3.6.3 [vector.capacity] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2011-03-24 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
+ <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-117</b></p>
+ 
+ <p>23.3.6.3 [vector.capacity] p. 9 (Same as for 23.3.3.3 [deque.capacity] p. 1 i.e. 
+ <tt>deque::resize</tt>). There is no mention of what happens if <tt>sz==size()</tt>. While 
+ it obviously does nothing I feel a standard needs to say this explicitely.</p>
+ <p>Suggested resolution:</p>
+ <p>Append "If <tt>sz == size()</tt>, does nothing" to the effects.</p>
+ 
+ <p><i>[2011-03-24 Daniel comments]</i></p>
+ 
+ 
+ <p>During the edit of this issue some non-conflicting overlap with <a href="lwg-defects.html#2033">2033</a> became obvious. 
+ <tt>CopyInsertable</tt> should be <tt>MoveInsertable</tt> and there is missing the <tt>DefaultConstructible</tt> 
+ requirements, but this should be fixed by <a href="lwg-defects.html#2033">2033</a>.</p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>Change 23.3.6.3 [vector.capacity] p. 9 as follows:</p>
+ 
+ <blockquote><pre>
+ void resize(size_type sz);
+ </pre>
+ <blockquote><p>
+ 9 <i>Effects</i>: If <tt>sz &lt;<ins>=</ins> size()</tt>, equivalent to <tt>erase(begin() + sz, end());</tt>. 
+ If <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> value-initialized elements to the sequence.
+ <p/>
+ 10 <i>Requires</i>: <tt>T</tt> shall be <tt>CopyInsertable</tt> into <tt>*this</tt>.
+ </p></blockquote></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="1526"></a>1526. C++ should not impose thread safety requirements on C99 library implementations</h3>
+ <p><b>Section:</b> 17.6.5.9 [res.on.data.races] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
+  <b>Submitter:</b> BSI <b>Opened:</b> 2011-03-24 <b>Last modified:</b> 2015-05-22</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p><b>Addresses GB-111</b></p>
+ 
+ <p>Section 17.6.5.9 [res.on.data.races], Data Race Avoidance, requires the C++ Standard Library to avoid data races 
+ that might otherwise result from two threads making calls to C++ Standard Library functions on 
+ distinct objects. The C standard library is part of the C++ Standard Library and some C++ Standary library 
+ functions (parts of the Localization library, as well as Numeric Conversions in 21.5), are specified 
+ to make use of the C standard library. Therefore, the C++ standard indirectly imposes a requirement 
+ on the thread safety of the C standard library. However, since the C standard does not address the 
+ concept of thread safety conforming C implementations exist that do no provide such guarantees. 
+ This conflict needs to be reconciled.</p>
+ 
+ <p>Suggested resolution by national body comment:</p>
+ 
+ <blockquote><p>
+ remove the requirement to make use of <tt>strtol()</tt> and <tt>sprintf()</tt> since these functions depend on the 
+ global C locale and thus cannot be made thread safe.
+ </p></blockquote>
+ 
+ <p><i>[2011-03-24 Madrid meeting]</i></p>
+ 
+ 
+ <p>Deferred</p>
+ 
+ <p><i>[
+ 2011 Bloomington
+ ]</i></p>
+ 
+ <p>
+ Alisdair: PJ, does this cause a problem in C?
+ </p>
+ <p>
+ PJ: Every implementation know of is thread safe.
+ </p>
+ <p>
+ Pete: There a couple of effects that are specified on strtol() and sprintf() which is a problem.
+ </p>
+ <p>
+ PJ: When C++ talks about C calls it should be "as if" calling the function.
+ </p>
+ <p>
+ Pete: Culprit is to string stuff. My fault.
+ </p>
+ <p>
+ PJ: Not your fault. You did what you were told. Distinct resolution to change wording.
+ </p>
+ <p>
+ Dietmar: What would we break if we change it back?
+ </p>
+ <p>
+ Pete: Nothing. If implemented on top of thread safe C library you are just fine.
+ </p>
+ <p>
+ Alisdair: Anyone want to clean up wording and put it back to what Pete gave us?
+ </p>
+ <p>
+ Alisdair: No volunteers. Do we want to mark as NAD? We could leave it as deferred.
+ </p>
+ <p>
+ Stefanus: Did original submitter care about this?
+ </p>
+ <p>
+ Lawrence: There is some work to make local calls thread safe. The resolution would be to call those thread safe version.
+ </p>
+ <p>
+ Pete: "As if called under single threaded C program"
+ </p>
+ <p>
+ <b>Action Item</b> (Alisdair): Write wording for this issue.
+ </p>
+ 
+ <p><i>[2012, Kona]</i></p>
+ 
+ <p>
+ Re-opened at the request of the concurrency subgroup, who feel there is an issue that needs
+ clarifying for the (planned) 2017 standard.
+ </p>
+ 
+ <p><b>Rationale:</b></p><p>No consensus to make a change at this time</p>
+ 
+ <p><i>[2012, Portland]</i></p>
+ 
+ <p>
+ The concurrency subgroup decided to encourage the LWG to consider a change to 17.2 [library.c] or thereabouts 
+ to clarify that we are requiring C++-like thread-safety for <tt>setlocale</tt>, so that races are not introduced 
+ by C locale accesses, even when the C library allows it. This would require e.g. adding "and data race avoidance" 
+ at the end of 17.2 [library.c] p1:
+ </p>
+ <p>
+ "The C++ standard library also makes available the facilities of the C standard library, suitably adjusted to 
+ ensure static type safety <ins>and data race avoidance</ins>.",
+ </p>
+ <p>
+ with some further clarifications in the sections mentioned in <a href="lwg-defects.html#1526">1526</a>.
+ </p>
+ <p>
+ This seems to be consistent with existing implementations. This would technically not be constraining C implementation, 
+ but it would be further constraining C libraries used for both C and C++.
+ </p>
+ 
+ <p><i>[Lenexa 2015-05-05: Move to Resolved]</i></p>
+ 
+ <p>JW: it's a bit odd that the issue title says sould not impose requirements on C libs, then the P/R does exactly that. Does make sense though, previously we imposed an implicit requirement which would not have been met. Now we say it explicitly and require it is met.</p>
+ <p>STL: I think this is Resolved, it has been fixed in the working paper [support.runtime]/6 is an example where we call out where things can race. That implies that for everything else they don't create races.</p>
+ <p>JW: I'm not sure, I think we still need the "and data race avoidance" to clarify that the features from C avoid races, even though C99 says no such thing.</p>
+ <p>STL: [library.c] says that something like sqrt is part of the C++ Standard LIbrary. [res.on.data.races] then applies to them. Would be OK with a note there, but am uncomfortable with "and data race avoidance" which sounds like it's making a very strong guarantee.</p>
+ <p>ACTION ITEM JW to editorially add note to [library.c] p1: "Unless otherwise specified, the C Standard Library functions shall meet the requirements for data race avoidance (xref [res.on.data.races])"</p>
+ <p>Move to Resolved?</p>
+ <p>10 in favor, 0 opposed, 3 abstentions</p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>This wording is relative to N3376.</p>
+ 
+ <ol>
+ <li><p>Change 17.2 [library.c] p1 as indicated:</p>
+ 
+ <blockquote><p>
+ -1- The C++ standard library also makes available the facilities of the C standard library, suitably adjusted to
+ ensure static type safety <ins>and data race avoidance</ins>.
+ </p></blockquote>
+ </li>
+ </ol>
+ 
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2000"></a>2000. Missing definition of <tt>packaged_task</tt> specialization of <tt>uses_allocator</tt></h3>
+ <p><b>Section:</b> 30.6.9.2 [futures.task.nonmembers] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2010-08-29 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ [futures.task.nonmembers]/3 says:
+ </p>
+ <blockquote><pre>
+    template &lt;class R, class Alloc&gt;
+      struct uses_allocator&lt;packaged_task&lt;R&gt;, Alloc&gt;;
+ </pre></blockquote>
+ <p>
+ This is a declaration, but should be a definition.
+ </p>
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change [futures.task.nonmembers]/3:
+ </p>
+ 
+ <blockquote><pre>
+    template &lt;class R, class Alloc&gt;
+      struct uses_allocator&lt;packaged_task&lt;R&gt;, Alloc&gt;<del>;</del>
+         <ins>: true_type {};</ins>
+ </pre></blockquote>
+ 
+ 
+ 
+ 
+ 
+ <hr>
+ <h3><a name="2001"></a>2001. Class template <tt>basic_regex</tt> uses non existent <tt>string_type</tt></h3>
+ <p><b>Section:</b> 28.8.3 [re.regex.assign] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
+  <b>Submitter:</b> Volker Lukas <b>Opened:</b> 2010-10-21 <b>Last modified:</b> 2015-04-08</p>
+ <p><b>View all other</b> <a href="lwg-index.html#re.regex.assign">issues</a> in [re.regex.assign].</p>
+ <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
+ <p><b>Discussion:</b></p>
+ <p>
+ In working draft N3126, subclause 28.8.3 [re.regex.assign], paragraphs 12, 13 and 19, 
+ the name <tt>string_type</tt> is used. This is presumably a typedef for <tt>basic_string&lt;value_type&gt;</tt>, where 
+ <tt>value_type</tt> is the character type used by <tt>basic_regex</tt>. The <tt>basic_regex</tt> 
+ template however defines no such typedef, and neither does the <tt>&lt;regex&gt;</tt> 
+ header or the <tt>&lt;initializer_list&gt;</tt> header included by <tt>&lt;regex&gt;</tt>.
+ </p>
+ 
+ <p><i>[
+ 2010-11-03 Daniel comments and suggests alternative wording:
+ ]</i></p>
+ 
+ <blockquote><p>
+ The proposed resolution needs to use <tt>basic_string&lt;<strong>charT</strong>&gt;</tt> instead of <tt>basic_string&lt;char&gt;</tt>
+ </p></blockquote>
+ 
+ <p>
+ Previous Proposed Resolution:
+ <p/>
+ Make the following changes to [re.regex.assign]:
+ </p>
+ <blockquote>
+ <pre>
+ basic_regex&amp; assign(const charT* ptr, flag_type f = regex_constants::ECMAScript);
+ </pre>
+ <blockquote><p>
+ 12 <i>Returns</i>: <tt>assign(<del>string_type</del><ins>basic_string&lt;charT&gt;</ins>(ptr), f)</tt>. 
+ </p></blockquote>
+ 
+ <pre>
+ basic_regex&amp; assign(const charT* ptr, size_t len,
+   flag_type f = regex_constants::ECMAScript);
+ </pre>
+ <blockquote><p>
+ 13 <i>Returns</i>: <tt>assign(<del>string_type</del><ins>basic_string&lt;charT&gt;</ins>(ptr, len), f)</tt>.
+ </p></blockquote>
+ 
+ <pre>
+ [..]
+ 
+ template &lt;class InputIterator&gt; 
+   basic_regex&amp; assign(InputIterator first, InputIterator last, 
+                           flag_type f = regex_constants::ECMAScript);
+ </pre>
+ 
+ <blockquote><p>
+ 18 <i>Requires</i>: The type <tt>InputIterator</tt> shall satisfy the requirements for an Input Iterator (24.2.3).
+ </p></blockquote>
+ 
+ <blockquote><p>
+ 19 <i>Returns</i>: <tt>assign(<del>string_type</del><ins>basic_string&lt;charT&gt;</ins>(first, last), f)</tt>.
+ </p></blockquote>
+ 
  </blockquote>
  
+ <p><i>[
+ 2010 Batavia 
+ ]</i></p>
+ 
+ 
+ <p>
+ Unsure if we should just give <tt>basic_regex</tt> a <tt>string_type</tt> typedef. Looking for when <tt>string_type</tt> was 
+ introduced into <tt>regex</tt>. Howard to draft wording for <tt>typedef typename traits::string_type string_type</tt>, then move to Review. 
+ </p>
+ 
+ <p><i>[
+ 2011-02-16: Daniel comments and provides an alternative resolution.
+ ]</i></p>
+ 
+ 
+ <p>
+ I'm strongly in favour with the Batavia idea to provide a separate <tt>string_type</tt> within
+ <tt>basic_regex</tt>, but it seems to me that the issue resultion should add one more
+ important typedef, namely that of the traits type! Currently, <tt>basic_regex</tt> is the
+ <em>only</em> template that does not publish the type of the associated traits type. Instead
+ of opening a new issue, I added this suggestion as part of the proposed wording.
+ </p>
+ 
+ <p><i>[2011-02-24 Reflector discussion]</i></p>
+ 
+ <p>
+ Moved to Tentatively Ready after 6 votes.
+ </p> 
+ 
+ 
+ <p><b>Proposed resolution:</b></p>
+ <p>
+ Change the class template <tt>basic_regex</tt> synopsis, 28.8 [re.regex] p. 3, as indicated:</p>
+ 
+ <blockquote><pre>
+ namespace std {
+   template &lt;class charT,
+             class traits = regex_traits&lt;charT&gt; &gt;
+   class basic_regex {
+   public:
+     // types:
+     typedef charT value_type;
+     <ins>typedef traits traits_type;</ins>
+     <ins>typedef typename traits::string_type string_type;</ins>
+     typedef regex_constants::syntax_option_type flag_type;
+     typedef typename traits::locale_type locale_type;
+ 
+     [..]
+   };
+ }
+ </pre></blockquote>
+ 
+ 
  
  
  
  
  <hr>
  <h3><a name="2002"></a>2002. Class template <tt>match_results</tt> does not specify the semantics of <tt>operator==</tt></h3>
! <p><b>Section:</b> 28.10.8 [re.results.nonmember] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-10-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
  <p><b>Discussion:</b></p>
  <p>
  The <em>Returns</em> element of <tt>operator==</tt> says:
  </p>
  
! <blockquote><p>
  <tt>true</tt> only if the two objects refer to the same match
! </p></blockquote>
  
  <p>
  It is not really clear what this means: The current specification would allow for an
*************** reason to provide this operator at all.
*** 83776,83783 ****
  on iterator values. In this case a user should better know that this will be done, because 
  there is no guarantee at all that inter-container comparison of iterators 
  is a feasible operation. This was a clear outcome of the resolution provided in 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a> 
! for LWG issue <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#446">446</a>.
  It could also mean that a character-based comparison of the individual <tt>sub_match</tt>
  elements should be done - this would be equivalent to applying <tt>operator==</tt> to
  the subexpressions, prefix and suffix.
--- 98866,98873 ----
  on iterator values. In this case a user should better know that this will be done, because 
  there is no guarantee at all that inter-container comparison of iterators 
  is a feasible operation. This was a clear outcome of the resolution provided in 
! <a href= "http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3066.html">N3066</a> 
! for LWG issue <a href= "http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#446">446</a>.
  It could also mean that a character-based comparison of the individual <tt>sub_match</tt>
  elements should be done - this would be equivalent to applying <tt>operator==</tt> to
  the subexpressions, prefix and suffix.
*************** the subexpressions, prefix and suffix.
*** 83786,83797 ****
  
  
  <p><b>Proposed resolution:</b></p>
! Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3158.html">n3158</a>.
  
  
  
  
  
  
  
! </body></html>
\ No newline at end of file
--- 98876,129794 ----
  
  
  <p><b>Proposed resolution:</b></p>
! <p>Addressed by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3158.html">n3158</a>.</p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2003"></a>2003. String exception inconsistency in erase.</h3>
! <p><b>Section:</b> 21.4.1 [string.require] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jos&eacute; Daniel Garc&iacute;a S&aacute;nchez <b>Opened:</b> 2010-10-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.require">issues</a> in [string.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Clause 21.4.1 [string.require]p3 states:
! </p>
! <blockquote><p>
! No <tt>erase()</tt> or <tt>pop_back()</tt> member function shall throw
! any exceptions.
! </p></blockquote>
! <p>
! However in 21.4.6.5 [string::erase] p2 the first version of <tt>erase</tt> has
! </p>
! <blockquote><p>
! <i>Throws</i>: <tt>out_of_range</tt> if <tt>pos > size()</tt>.
! </p></blockquote>
  
+ <p><i>[2011-03-24 Madrid meeting]</i></p>
  
  
+ <p>
+ Beman: Don't want to just change this, can we just say "unless otherwise specified"?
+ <p/>
+ Alisdair: Leave open, but update proposed resolution to say something like "unless otherwise specified".
+ <p/>
+ General agreement that it should be corrected but not a stop-ship.
+ <p/>
+ Action: Update proposed wording for issue 2003 as above, but leave Open. 
+ </p>
  
+ <p><i>[2014-02-12 Issaquah meeting]</i></p>
  
  
+ <p>
+ Jeffrey: Madrid meeting's proposed wording wasn't applied, and it's better than the original proposed wording.
+ However, this sentence is only doing 3 functions' worth of work, unlike the similar paragraphs in 23.2.1 [container.requirements.general].
+ Suggest just putting "<i>Throws:</i> Nothing" on the 3 functions.
+ </p>
  
! <p><i>[2014-02-13 Issaquah meeting]</i></p>
! 
! <p>
! Move as Immmediate
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Remove [string.require]p/3:
! </p>
! <blockquote><p>
! <del>3 No <tt>erase()</tt> or <tt>pop_back()</tt> member function shall throw any exceptions.</del>
! </p></blockquote>
! 
! <p>
! Add to the specifications of <tt>iterator erase(const_iterator p);</tt>, <tt>iterator erase(const_iterator first, const_iterator last);</tt>,
!  and <tt>void pop_back();</tt> in 21.4.6.5 [string::erase]:
! </p>
! <blockquote><p><ins><i>Throws:</i> Nothing</ins></p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2004"></a>2004. <tt>duration::operator*</tt> has template parameters in funny order</h3>
! <p><b>Section:</b> 20.12.5.5 [time.duration.nonmember] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2010-10-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration.nonmember">issues</a> in [time.duration.nonmember].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In [time] and [time.duration.nonmember] we have:
! </p>
! <blockquote><pre>
! template &lt;class Rep1, class Period, class Rep2>
!     duration&lt;typename common_type&lt;Rep1, Rep2>::type, Period>
!         operator*(const Rep1&amp; s, const duration&lt;Rep2, Period>&amp; d);
! </pre></blockquote>
! <p>
! Everywhere else, we always have <tt>&lt;rep, period></tt> in that order for a given
! type. But here, we have <tt>Period</tt> and <tt>Rep2</tt> in reverse order for
! <tt>&lt;Rep2, Period></tt>. This is probably of little importance, since the
! template parameters are seldom spelled out for a function like this. But changing it
! now will eliminate a potential source of future errors and confusion.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Change the signature in [time] and [time.duration.nonmember] to:
! </p>
! <blockquote><pre>
! template &lt;class Rep1, class <del>Period</del><ins>Rep2</ins>, class <del>Rep2</del><ins>Period</ins>>
!     duration&lt;typename common_type&lt;Rep1, Rep2>::type, Period>
!         operator*(const Rep1&amp; s, const duration&lt;Rep2, Period>&amp; d);
! </pre></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2005"></a>2005. <tt>unordered_map::insert(T&amp;&amp;)</tt> protection should apply to <tt>map</tt> too</h3>
! <p><b>Section:</b> 23.4.4.4 [map.modifiers], 23.4.5.3 [multimap.modifiers], 23.5.4.4 [unord.map.modifiers], 23.5.5.3 [unord.multimap.modifiers] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> P.J. Plauger <b>Opened:</b> 2010-10-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#map.modifiers">issues</a> in [map.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In [unord.map.modifiers], the signature:
! </p>
! <blockquote><pre>
! template &lt;class P&gt;
!     pair&lt;iterator, bool&gt; insert(P&amp;&amp; obj);
! </pre></blockquote>
! <p>
! now has an added Remarks paragraph:
! </p>
! <blockquote><p>
! <i>Remarks</i>: This signature shall not participate in overload resolution unless <tt>P</tt>
! is implicitly convertible to <tt>value_type</tt>.
! </p></blockquote>
! <p>
! The same is true for <tt>unordered_multimap</tt>.
! <p/>
! But neither <tt>map</tt> nor <tt>multimap</tt> have this constraint, even though it is a
! Good Thing(TM) in those cases as well.
! </p>
! 
! <p><i>[
! The submitter suggests: Add the same Remarks clause to [map.modifiers] and [multimap.modifiers].
! ]</i></p>
! 
! 
! <p><i>[
! 2010-10-29 Daniel comments:
! ]</i></p>
! 
! 
! <p>
! I believe both paragraphs need more cleanup: First, the current Requires element conflict with the Remark; 
! second, it seems to me that the whole single Requires element is intended to be split into a Requires
! and an Effects element; third, the reference to <tt>tuple</tt> is incorrect (noticed by Paolo Carlini);
! fourth, it refers to some non-existing <tt>InputIterator</tt> parameter relevant for a completely different
! overload; sixth, the return type of the overload with hint is wrong.
! The following proposed resolution tries to solve these issues as well and uses similar wording as for
! the corresponding unordered containers. Unfortunately it has some redundancy over Table&nbsp;99, but I did
! not remove the specification because of the more general template parameter <tt>P</tt> - the Table&nbsp;99 
! requirements apply only for an argument <em>identical</em> to <tt>value_type</tt>.
! <p/>
! Daniel's Proposed resolution (not current):
! </p>
! 
! <blockquote class="note">
! <ol>
! <li>Change 23.4.4.4 [map.modifiers] around p. 1 as indicated:
! <blockquote><pre>
! template &lt;class P&gt; pair&lt;iterator, bool&gt; insert(P&amp;&amp; x);
! template &lt;class P&gt; <del>pair&lt;</del>iterator<del>, bool&gt;</del> insert(const_iterator position, P&amp;&amp; x);
! </pre><blockquote><p>
! 1 <em>Requires</em>: <del><tt>P</tt> shall be convertible to </del><tt>value_type</tt><ins> is constructible 
! from <tt>std::forward&lt;P&gt;(x)</tt>.</ins>.
! <p/>
! <del>If <tt>P</tt> is instantiated as a reference type, then the argument <tt>x</tt> is copied from. Otherwise <tt>x</tt> is considered
! to be an rvalue as it is converted to <tt>value_type</tt> and inserted into the map. Specifically, in
! such cases <tt>CopyConstructible</tt> is not required of <tt>key_type</tt> or <tt>mapped_type</tt> unless the conversion
! from <tt>P</tt> specifically requires it (e.g., if <tt>P</tt> is a <tt>tuple&lt;const key_type, mapped_type&gt;</tt>, then <tt>key_type</tt>
! must be <tt>CopyConstructible</tt>). The signature taking <tt>InputIterator</tt> parameters does not require
! <tt>CopyConstructible</tt> of either <tt>key_type</tt> or <tt>mapped_type</tt> if the dereferenced <tt>InputIterator</tt> returns a
! non-const rvalue <tt>pair&lt;key_type,mapped_type&gt;</tt>. Otherwise <tt>CopyConstructible</tt> is required for both
! <tt>key_type</tt> and <tt>mapped_type</tt>.</del><br/>
! <ins>? <em>Effects</em>: Inserts <tt>x</tt> converted to <tt>value_type</tt> if and only if there is no element in the container with
! key equivalent to the key of <tt>value_type(x)</tt>. For the second form, the iterator <tt>position</tt> is a hint pointing to where the
! search should start.</ins>
! <p/>
! <ins>? <em>Returns</em>: For the first form, the <tt>bool</tt> component of the returned <tt>pair</tt> object indicates whether the 
! insertion took place and the iterator component - or for the second form the returned iterator - points to the element with key equivalent 
! to the key of <tt>value_type(x)</tt>.</ins>
! <p/>
! <ins>? <em>Complexity</em>: Logarithmic in general, but amortized constant if <tt>x</tt> is inserted right before <tt>position</tt>.</ins>
! <p/>
! <ins>? <em>Remarks</em>: These signatures shall not participate in overload resolution unless <tt>P</tt> 
! is implicitly convertible to <tt>value_type</tt>.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! <li>Change 23.4.5.3 [multimap.modifiers] around p. 1 as indicated:
! <blockquote><pre>
! template &lt;class P&gt; iterator insert(P&amp;&amp; x);
! template &lt;class P&gt; iterator insert(const_iterator position, P&amp;&amp; x);
! </pre><blockquote><p>
! 1 <em>Requires</em>: <del><tt>P</tt> shall be convertible to </del><tt>value_type</tt> <ins>is constructible from 
! <tt>std::forward&lt;P&gt;(x)</tt></ins>.
! <p/>
! <del>If <tt>P</tt> is instantiated as a reference type, then the argument <tt>x</tt> is copied from. Otherwise 
! <tt>x</tt> is considered to be an rvalue as it is converted to <tt>value_type</tt> and inserted into the map. 
! Specifically, in such cases <tt>CopyConstructible</tt> is not required of <tt>key_type</tt> or <tt>mapped_type</tt> 
! unless the conversion from <tt>P</tt> specifically requires it (e.g., if <tt>P</tt> is a <tt>tuple&lt;const key_type, mapped_type&gt;</tt>, 
! then <tt>key_type</tt> must be <tt>CopyConstructible</tt>). The signature taking <tt>InputIterator</tt> parameters 
! does not require <tt>CopyConstructible</tt> of either <tt>key_type</tt> or <tt>mapped_type</tt> if the dereferenced 
! <tt>InputIterator</tt> returns a non-const rvalue <tt>pair&lt;key_type, mapped_type&gt;</tt>. Otherwise <tt>CopyConstructible</tt> 
! is required for both <tt>key_type</tt> and <tt>mapped_type</tt>.</del><br/>
! <ins>? <em>Effects</em>: Inserts <tt>x</tt> converted to <tt>value_type</tt>. For the second form, the iterator <tt>position</tt> 
! is a hint pointing to where the search should start.</ins>
! <p/>
! <ins>? <em>Returns</em>: An iterator that points to the element with key equivalent to the key of <tt>value_type(x)</tt>.</ins>
! <p/>
! <ins>? <em>Complexity</em>: Logarithmic in general, but amortized constant if <tt>x</tt> is inserted right before <tt>position</tt>.</ins>
! <p/>
! <ins>? <em>Remarks</em>: These signatures shall not participate in overload resolution unless <tt>P</tt> 
! is implicitly convertible to <tt>value_type</tt>.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! </blockquote>
! 
! <p><i>[
! 2010 Batavia:
! ]</i></p>
! 
! 
! <p>
! We need <tt>is_convertible</tt>, not <tt>is_constructible</tt>, both in ordered and unordered containers. 
! </p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! The effects of these inserts can be concisely stated in terms of emplace().
! Also, the correct term is "EmplaceConstructible", not "constructible".
! </p>
! 
! <p>
! New wording by Pablo, eliminating duplicate requirements already implied by the effects clause.  Move to Review.
! </p>
! 
! <p><i>[
! 2011-10-02 Daniel comments and refines the proposed wording
! ]</i></p>
! 
! 
! <blockquote><p>
! Unfortunately the template constraints expressed as "<tt>P</tt> is implicitly convertible to <tt>value_type</tt>"
! reject the intended effect to support move-only key types, which was the original intention when
! the library became move-enabled through the rvalue-reference proposals by Howard (This can clearly be deduced
! from existing carefully selected wording that emphasizes that <tt>CopyConstructible</tt> is only required
! for special situations involving lvalues or const rvalues as arguments). The root of the problem is based
! on current core rules, where an "implicitly converted" value has copy-initialization semantics. Consider
! a move-only key type <tt>KM</tt>, some mapped type <tt>T</tt>, and a source value <tt>p</tt> of type <tt>P</tt> 
! equal to <tt>std::pair&lt;KM, T&gt;</tt>, this is equivalent to:
! </p>
! <blockquote><pre>
! std::pair&lt;const KM, T&gt; dest = std::move(p);
! </pre></blockquote>
! <p>
! Now 8.5 [dcl.init] p16 b6 sb2 says that the effects of this heterogeneous copy-initialization (<tt>p</tt>
! has a different type than <tt>dest</tt>) are as-if a temporary of the target type <tt>std::pair&lt;const KM, T&gt;</tt>
! is produced from the rvalue <tt>p</tt> of type <tt>P</tt> (which is fine), and this temporary is used to initialize 
! <tt>dest</tt>. This second step cannot succeed, because we cannot move from <tt>const KM</tt> to <tt>const KM</tt>. This 
! means that <tt>std::is_convertible&lt;P, std::pair&lt;const KM, T&gt;&gt;::value</tt> is false.
! <p/>
! But the actual code that is required (with the default allocator) is simply a direct-initialization
! from <tt>P</tt> to <tt>value_type</tt>, so imposing an implicit conversion is more than necessary. Therefore
! I strongly recommend to reduce the "overload participation" constraint to  
! <tt>std::is_constructible&lt;std::pair&lt;const KM, T&gt;, P&gt;::value</tt> instead. This change is the
! only change that has been performed to the previous proposed wording from Pablo shown below. 
! </p></blockquote>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Moved to Tentatively Ready by the post-Kona issues processing subgroup, after much discussion
! on Daniel's analysis of Copy Initialization and move semantics, which we ultimately agreed with.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li>Change 23.4.4.4 [map.modifiers] around p. 1 as indicated:
! <blockquote><pre>
! template &lt;class P&gt; pair&lt;iterator, bool&gt; insert(P&amp;&amp; x);
! template &lt;class P&gt; <del>pair&lt;</del>iterator<del>, bool&gt;</del> insert(const_iterator position, P&amp;&amp; x);
! </pre><blockquote>
! <del>1 <em>Requires</em>: <tt>P</tt> shall be convertible to <tt>value_type</tt>.</del>
! <p/>
! <del>If <tt>P</tt> is instantiated as a reference type, then the argument <tt>x</tt> is copied from. Otherwise <tt>x</tt> is considered
! to be an rvalue as it is converted to <tt>value_type</tt> and inserted into the map. Specifically, in
! such cases <tt>CopyConstructible</tt> is not required of <tt>key_type</tt> or <tt>mapped_type</tt> unless the conversion
! from <tt>P</tt> specifically requires it (e.g., if <tt>P</tt> is a <tt>tuple&lt;const key_type, mapped_type&gt;</tt>, then <tt>key_type</tt>
! must be <tt>CopyConstructible</tt>). The signature taking <tt>InputIterator</tt> parameters does not require
! <tt>CopyConstructible</tt> of either <tt>key_type</tt> or <tt>mapped_type</tt> if the dereferenced <tt>InputIterator</tt> returns a
! non-const rvalue <tt>pair&lt;key_type,mapped_type&gt;</tt>. Otherwise <tt>CopyConstructible</tt> is required for both
! <tt>key_type</tt> and <tt>mapped_type</tt>.</del><br/>
! <ins>? <em>Effects</em>: The first form is equivalent to
! <tt>return emplace(std::forward&lt;P&gt;(x))</tt>.
! The second form is equivalent to
! <tt>return emplace_hint(position, std::forward&lt;P&gt;(x))</tt>.</ins>
! <p/>
! <ins>? <em>Remarks</em>: These signatures shall not participate in overload resolution unless 
! <tt>std::is_constructible&lt;value_type, P&amp;&amp;&gt;::value</tt> is true.</ins>
! <p/>
! </blockquote></blockquote>
! </li>
! <li>Change 23.4.5.3 [multimap.modifiers] around p. 1 as indicated:
! <blockquote><pre>
! template &lt;class P&gt; iterator insert(P&amp;&amp; x);
! template &lt;class P&gt; iterator insert(const_iterator position, P&amp;&amp; x);
! </pre><blockquote>
! <del>1 <em>Requires</em>: <tt>P</tt> shall be convertible to <tt>value_type</tt>.</del>
! <p/>
! <del>If <tt>P</tt> is instantiated as a reference type, then the argument <tt>x</tt> is copied from. Otherwise 
! <tt>x</tt> is considered to be an rvalue as it is converted to <tt>value_type</tt> and inserted into the map. 
! Specifically, in such cases <tt>CopyConstructible</tt> is not required of <tt>key_type</tt> or <tt>mapped_type</tt> 
! unless the conversion from <tt>P</tt> specifically requires it (e.g., if <tt>P</tt> is a <tt>tuple&lt;const key_type, mapped_type&gt;</tt>, 
! then <tt>key_type</tt> must be <tt>CopyConstructible</tt>). The signature taking <tt>InputIterator</tt> parameters 
! does not require <tt>CopyConstructible</tt> of either <tt>key_type</tt> or <tt>mapped_type</tt> if the dereferenced 
! <tt>InputIterator</tt> returns a non-const rvalue <tt>pair&lt;key_type, mapped_type&gt;</tt>. Otherwise <tt>CopyConstructible</tt> 
! is required for both <tt>key_type</tt> and <tt>mapped_type</tt>.</del><br/>
! <ins>? <em>Effects</em>: The first form is equivalent to
! <tt>return emplace(std::forward&lt;P&gt;(x))</tt>.
! The second form is equivalent to
! <tt>return emplace_hint(position, std::forward&lt;P&gt;(x))</tt>.</ins>
! <p/>
! <ins>? <em>Remarks</em>: These signatures shall not participate in overload resolution unless 
! <tt>std::is_constructible&lt;value_type, P&amp;&amp;&gt;::value</tt> is true.</ins>
! <p/>
! </blockquote></blockquote>
! </li>
! <li>Change  [unord.map.modifers] around p. 1 as indicated:
! <blockquote><pre>
! template &lt;class P&gt;
! pair&lt;iterator, bool&gt; insert(P&amp;&amp; obj);
! </pre>
! <blockquote>
! <del>1 <em>Requires</em>: <tt>value_type</tt> is constructible from <tt>std::forward&lt;P&gt;(obj)</tt>.</del>
! <p/>
! 2 <em>Effects</em>:
! <ins>equivalent to <tt>return emplace(std::forward&lt;P&gt;(obj))</tt>.</ins>
! <del>Inserts obj converted to <tt>value_type</tt> if and only if there is no element in the container with
! key equivalent to the key of <tt>value_type(obj)</tt>.</del>
! <p/>
! <del>3 <em>Returns</em>: The bool component of the returned pair object indicates whether the insertion took place
! and the iterator component points to the element with key equivalent to the key of <tt>value_type(obj)</tt>.</del>
! <p/>
! <del>4 <em>Complexity</em>: Average case O(1), worst case O(size()).</del>
! <p/>
! <del>5</del><ins>3</ins> <em>Remarks</em>: This signature shall not participate in overload resolution unless 
! <del><tt>P</tt> is implicitly convertible to <tt>value_type</tt></del><ins><tt>std::is_constructible&lt;value_type, 
! P&amp;&amp;&gt;::value</tt> is true</ins>.
! <p/>
! </blockquote>
! <pre>template &lt;class P&gt;
! iterator insert(const_iterator hint, P&amp;&amp; obj);
! </pre>
! <blockquote>
! <del>6 <em>Requires</em>: <tt>value_type</tt> is constructible from <tt>std::forward&lt;P&gt;(obj)</tt>.</del>
! <p/>
! <del>7</del><em>?</em> <em>Effects</em>:
! <ins>equivalent to <tt>return emplace_hint(hint, std::forward&lt;P&gt;(obj))</tt>.</ins>
! <del>Inserts obj converted to <tt>value_type</tt> if and only if there is no element in the container with
! key equivalent to the key of <tt>value_type(obj)</tt>. The iterator hint is a hint pointing to where the
! search should start.</del>
! <p/>
! <del>8 <em>Returns</em>: An iterator that points to the element with key equivalent to the key of 
! <tt>value_type(obj)</tt>.</del>
! <p/>
! <del>9 <em>Complexity</em>: Average case O(1), worst case O(size()).</del>
! <p/>
! <del>10</del><em>?</em> <em>Remarks</em>: This signature shall not participate in overload resolution unless 
! <del><tt>P</tt> is implicitly convertible to <tt>value_type</tt></del><ins><tt>std::is_constructible&lt;value_type, 
! P&amp;&amp;&gt;::value</tt> is true</ins>.
! </blockquote></blockquote>
! </li>
! <li>Change  [unord.multimap.modifers] around p. 1 as indicated:
! <blockquote><pre>
! template &lt;class P&gt;
! iterator insert(P&amp;&amp; obj);
! </pre>
! <blockquote>
! <del>1 <em>Requires</em>: <tt>value_type</tt> is constructible from <tt>std::forward&lt;P&gt;(obj)</tt>.</del>
! <p/>
! 2 <em>Effects</em>:
! <ins>equivalent to <tt>return emplace(std::forward&lt;P&gt;(obj))</tt>.</ins>
! <del>Inserts obj converted to <tt>value_type</tt>.</del>
! <p/>
! <del>3 <em>Returns</em>: An iterator that points to the element with key equivalent to the key of <tt>value_type(obj)</tt>.</del>
! <p/>
! <del>4 <em>Complexity</em>: Average case O(1), worst case O(size()).</del>
! <p/>
! <del>5</del><ins>3</ins> <em>Remarks</em>: This signature shall not participate in overload resolution 
! unless <del><tt>P</tt> is implicitly convertible to <tt>value_type</tt></del><ins><tt>std::is_constructible&lt;value_type, 
! P&amp;&amp;&gt;::value</tt> is true</ins>.
! </blockquote>
! <pre>
! template &lt;class P&gt;
! iterator insert(const_iterator hint, P&amp;&amp; obj);
! </pre>
! <blockquote>
! <del>6 <em>Requires</em>: <tt>value_type</tt> is constructible from <tt>std::forward&lt;P&gt;(obj)</tt>.</del>
! <p/>
! <del>7</del><em>?</em> <em>Effects</em>:
! <ins>equivalent to <tt>return emplace_hint(hint, std::forward&lt;P&gt;(obj))</tt>.</ins>
! <del>Inserts obj converted to <tt>value_type</tt>. The iterator hint is a hint pointing to where the search
! should start.</del>
! <p/>
! <del>8 <em>Returns</em>: An iterator that points to the element with key equivalent to the key of <tt>value_type</tt>(obj).</del>
! <p/>
! <del>9 <em>Complexity</em>: Average case O(1), worst case O(size()).</del>
! <p/>
! <del>10</del><ins><em>?</em></ins> <em>Remarks</em>: This signature shall not participate in overload resolution 
! unless <del><tt>P</tt> is implicitly convertible to <tt>value_type</tt></del><ins><tt>std::is_constructible&lt;value_type, 
! P&amp;&amp;&gt;::value</tt> is true</ins>.
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2007"></a>2007. Incorrect specification of return value for <tt>map&lt;&gt;::at()</tt></h3>
! <p><b>Section:</b> 23.4.4.3 [map.access] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2010-11-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#map.access">issues</a> in [map.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In [map.access]/9, the <i>Returns</i> clause for <tt>map&lt;Key, T&gt;::at(x)</tt> says 
! that it returns "a reference to the element whose key is equivalent to <tt>x</tt>." That can't be right. 
! The signature for <tt>at()</tt> says that its return type is <tt>T</tt>, but the elements 
! of <tt>map&lt;Key, T&gt;</tt> have type <tt>pair&lt;const K, T&gt;</tt>.  (I checked [unord.map.elem] 
! and found that its specification of <tt>at()</tt> is correct. This is a problem for <tt>map</tt> only.)
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Change the wording in [map.access]/9 so it's identical to what we already say for <tt>operator[]</tt>, 
! which is unambiguous and correct.
! </p>
! <blockquote><p>
! <i>Returns</i>: A reference to the <del>element whose key is equivalent</del><ins><tt>mapped_type</tt> 
! corresponding</ins> to <tt>x</tt><ins> in <tt>*this</tt></ins>.
! </p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2008"></a>2008. Conflicting Error Conditions for <tt>packaged_task::operator()</tt></h3>
! <p><b>Section:</b> 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2010-06-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The Throws clause for <tt>packaged_task::operator()</tt> says that it throws "a
! <tt>future_error</tt> exception object if there is no associated asynchronous
! state or the stored task has already been invoked." However, the Error
! Conditions clause does not define an error condition when the stored task has
! already been invoked, only when the associated state is already ready (i.e. the
! invocation has completed).
! </p>
! 
! <p><i>[2011-02-17 Anthony provides an alternative resolution]</i></p>
! 
! 
! <p><strong>Previous</strong> proposed resolution:</p>
! 
! <p>
! Change the first bullet item in 30.6.9.1 [futures.task.members] /22:
! </p>
! 
! <blockquote><pre>
! void operator()(ArgTypes... args);
! </pre>
! <blockquote>
! <p>
! 20 ...
! </p>
! <p>
! 21 ...
! </p>
! <p>
! 22 <i>Error conditions:</i>
! </p>
! <ul>
! <li>
! <tt>promise_already_satisfied</tt> if <del>the associated asynchronous state is
! already ready</del> <ins><tt>operator()</tt> has already been called</ins>.
! </li>
! <li>
! <tt>no_state</tt> if <tt>*this</tt> has no associated asynchronous state.
! </li>
! </ul>
! </blockquote>
! </blockquote>
! 
! <p><i>[Adopted at Madrid, 2011-03]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>
! Change the first bullet item in 30.6.9.1 [futures.task.members] p. 17:
! </p>
! 
! <blockquote><pre>
! void operator()(ArgTypes... args);
! </pre>
! <blockquote>
! <p>
! 15 ...
! </p>
! <p>
! 16 ...
! </p>
! <p>
! 17 <i>Error conditions:</i>
! </p>
! <ul>
! <li>
! <tt>promise_already_satisfied</tt> if the <del>associated asynchronous state is already 
! ready</del><ins>stored task has already been invoked</ins>.
! </li>
! <li>
! <tt>no_state</tt> if <tt>*this</tt> has no associated asynchronous state.
! </li>
! </ul>
! </blockquote>
! </blockquote>
! </li>
! 
! <li>
! <p>
! Change the first bullet item in 30.6.9.1 [futures.task.members] p. 21:
! </p>
! 
! <blockquote><pre>
! void make_ready_at_thread_exit(ArgTypes... args);
! </pre>
! <blockquote>
! <p>
! 19 ...
! </p>
! <p>
! 20 ...
! </p>
! <p>
! 21 <i>Error conditions:</i>
! </p>
! <ul>
! <li>
! <tt>promise_already_satisfied</tt> if the <del>associated asynchronous state already has a stored value or
! exception</del><ins>stored task has already been invoked</ins>.
! </li>
! <li>
! <tt>no_state</tt> if <tt>*this</tt> has no associated asynchronous state.
! </li>
! </ul>
! </blockquote>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2009"></a>2009. Reporting out-of-bound values on numeric string conversions</h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2010-07-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The functions (<tt>w</tt>)<tt>stoi</tt> and (<tt>w</tt>)<tt>stof</tt>
! are specified in terms of calling C library APIs for potentially wider
! types.  The integer and floating-point versions have subtly different
! behaviour when reading values that are too large to convert.  The
! floating point case will throw <tt>out_of_bound</tt> if the read value
! is too large to convert to the wider type used in the implementation,
! but behaviour is undefined if the converted value cannot narrow to a
! float.  The integer case will throw <tt>out_of_bounds</tt> if the
! converted value cannot be represented in the narrower type, but throws
! <tt>invalid_argument</tt>, rather than <tt>out_of_range</tt>, if the
! conversion to the wider type fails due to overflow.
! </p>
! 
! <p>
! Suggest that the Throws clause for both specifications should be
! consistent, supporting the same set of fail-modes with the matching set
! of exceptions.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! 21.5p3 [string.conversions]
! </p>
! 
! <blockquote><pre>
! int stoi(const string&amp; str, size_t *idx = 0, int base = 10);
! long stol(const string&amp; str, size_t *idx = 0, int base = 10);
! unsigned long stoul(const string&amp; str, size_t *idx = 0, int base = 10);
! long long stoll(const string&amp; str, size_t *idx = 0, int base = 10);
! unsigned long long stoull(const string&amp; str, size_t *idx = 0, int base = 10);
! </pre>
! 
! <blockquote>
! <p>
! ...
! </p>
! <p>
! 3 <i>Throws:</i> <tt>invalid_argument</tt> if <tt>strtol</tt>,
! <tt>strtoul</tt>, <tt>strtoll</tt>, or <tt>strtoull</tt> reports that no
! conversion could be performed. Throws <tt>out_of_range</tt> if
! <ins><tt>strtol</tt>, <tt>strtoul</tt>, <tt>strtoll</tt> or
! <tt>strtoull</tt> sets <tt>errno</tt> to <tt>ERANGE</tt>, or if</ins>
! the converted value is outside the range of representable values for the
! return type.
! </p>
! </blockquote>
! </blockquote>
! 
! <p>
! 21.5p6 [string.conversions]
! </p>
! 
! <blockquote><pre>
! float stof(const string&amp; str, size_t *idx = 0);
! double stod(const string&amp; str, size_t *idx = 0);
! long double stold(const string&amp; str, size_t *idx = 0);
! </pre>
! 
! <blockquote>
! <p>
! ...
! </p>
! <p>
! 6 <i>Throws:</i> <tt>invalid_argument</tt> if <tt>strtod</tt> or
! <tt>strtold</tt> reports that no conversion could be performed. Throws
! <tt>out_of_range</tt> if <tt>strtod</tt> or <tt>strtold</tt> sets
! <tt>errno</tt> to <tt>ERANGE</tt> <ins> or if the converted value is
! outside the range of representable values for the return type</ins>.
! </p>
! </blockquote>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2010"></a>2010. <tt>is_* traits</tt> for binding operations can't be meaningfully specialized</h3>
! <p><b>Section:</b> 20.9.10.1 [func.bind.isbind] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Sean Hunt <b>Opened:</b> 2010-07-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.bind.isbind">issues</a> in [func.bind.isbind].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 20.9.10.1 [func.bind.isbind] says for <tt>is_bind_expression</tt>:
! </p>
! 
! <blockquote><p>
! Users may specialize this template to indicate that a type should be
! treated as a subexpression in a <tt>bind</tt> call.
! </p></blockquote>
! 
! <p>
! But it also says:
! </p>
! 
! <blockquote><p>
! If <tt>T</tt> is a type returned from <tt>bind</tt>,
! <tt>is_bind_expression&lt;T&gt;</tt> shall be publicly derived from
! <tt>integral_constant&lt;bool, true&gt;</tt>, otherwise from
! <tt>integral_constant&lt;bool, false&gt;</tt>.
! </p></blockquote>
! 
! <p>
! This means that while the user is free to specialize, any specialization
! would have to be <tt>false</tt> to avoid violating the second
! requirement. A similar problem exists for <tt>is_placeholder</tt>.
! </p>
! 
! <p><i>[
! 2010 Batavia (post meeting session)
! ]</i></p>
! 
! <p>
! Alisdair recognises this is clearly a bug introduced by some wording he
! wrote, the sole purpose of this metafunction is as a customization point
! for users to write their own <tt>bind</tt>-expression types that participate
! in the standard library <tt>bind</tt> protocol.  The consensus was that this
! should be fixed in Madrid, moved to Open.
! </p>
! 
! <p><i>[2011-05-13 Jonathan Wakely comments and provides proposed wording]</i></p>
! 
! 
! <p>
! The requirements are that <tt>is_bind_expression&lt;T&gt;::value</tt> is true when <tt>T</tt>
! is a type returned from <tt>bind</tt>, false for any other type, except when
! there's a specialization involving a user-defined type (N.B. 17.6.4.2.1 [namespace.std] 
! means we don't need to say e.g. <tt>is_bind_expression&lt;string&gt;</tt> is false.)
! <p/>
! The obvious way to meet the requirements is for the primary template
! to derive from <tt>integral_constant&lt;bool, false&gt;</tt> and for implementations
! to provide specializations for the unspecified types returned from
! <tt>bind</tt>.  User-defined specializations can do whatever they like, as long
! as <tt>is_bind_expression::value</tt> is sane. There's no reason to forbid
! users from defining <tt>is_bind_expression&lt;<i>user_defined_type</i>&gt;::value=false</tt>
! if that's what they want to do.
! <p/>
! Similar reasoning applies to <tt>is_placeholder</tt>, but a further issue is
! that 20.9.10.1 [func.bind.isbind] contains wording for <tt>is_placeholder</tt> but
! contains no definition of it and the sub-clause name only refers to
! <tt>is_bind_expression</tt>. The wording below proposes splitting paragraphs 3
! and 4 of 20.9.10.1 [func.bind.isbind] into a new sub-clause covering
! <tt>is_placeholder</tt>.
! <p/>
! If the template specializations added by the proposed wording are too
! vague then they could be preceded by "for exposition only" comments
! </p>
! 
! <p><i>[2011-05-18 Daniel comments and provides some refinements to the P&#47;R]</i></p>
! 
! 
! <p>
! Both <tt>bind</tt>-related type traits should take advantage of the
! UnaryTypeTrait requirements. Additionally, the updated wording does not
! imply that the implementation provides several specializations. Wording was 
! used similar to the specification of the <tt>uses_allocator</tt> type trait 
! (which unfortunately is not expressed in terms of BinaryTypeTrait requirements).
! </p>
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Change 20.9.10.1 [func.bind.isbind] to:</p>
! 
! <blockquote><pre>
! namespace std {
!   template&lt;class T&gt; struct is_bind_expression<ins>; <i>// see below</i></ins>
!     <del>: integral_constant&lt;bool, <i>see below</i>&gt; { };</del>
! }
! </pre><blockquote><p>
! -1- <tt>is_bind_expression</tt> can be used to detect function objects generated by <tt>bind</tt>. <tt>bind</tt> 
! uses <tt>is_bind_expression</tt> to detect subexpressions. <del>Users may specialize this template to indicate 
! that a type should be treated as a subexpression in a <tt>bind</tt> call.</del>
! <p/>
! -2- <del>If <tt>T</tt> is a type returned from <tt>bind</tt>, <tt>is_bind_expression&lt;T&gt;</tt> shall 
! be publicly derived from <tt>integral_constant&lt;bool, true&gt;</tt>, otherwise from 
! <tt>integral_constant&lt;bool, false&gt;</tt></del><ins>Instantiations of the <tt>is_bind_expression</tt> template
! shall meet the UnaryTypeTrait requirements ([meta.rqmts]). The implementation shall provide a definition
! that has a BaseCharacteristic of <tt>true_type</tt> if <tt>T</tt> is a type returned from <tt>bind</tt>, otherwise 
! it shall have a BaseCharacteristic of <tt>false_type</tt>. A program may specialize this template for a user-defined 
! type <tt>T</tt> to have a BaseCharacteristic of <tt>true_type</tt> to indicate that <tt>T</tt> should be treated 
! as a subexpression in a <tt>bind</tt> call.</ins>.
! <p/>
! <del>-3- <tt>is_placeholder</tt> can be used to detect the standard placeholders <tt>_1</tt>, <tt>_2</tt>, and so on. 
! <tt>bind</tt> uses <tt>is_placeholder</tt> to detect placeholders. Users may specialize this template to indicate 
! a placeholder type.</del>
! <p/>
! <del>-4- If <tt>T</tt> is the type of <tt>std::placeholders::_J</tt>, <tt>is_placeholder&lt;T&gt;</tt> shall be 
! publicly derived from <tt>integral_constant&lt;int, J&gt;</tt>, otherwise from <tt>integral_constant&lt;int, 0&gt;</tt>.</del>
! </p></blockquote></blockquote>
! </li>
! <li><p>Insert a new sub-clause immediately following sub-clause 20.9.10.1 [func.bind.isbind], the suggested
! sub-clause tag is [func.bind.isplace]:
! </p>
! <h3><ins>20.8.9.1.?  Class template <tt>is_placeholder</tt>  [func.bind.isplace]</ins></h3> 
! <blockquote><pre>
! <ins>namespace std {
!   template&lt;class T&gt; struct is_placeholder; <i>// see below</i>
! }</ins>
! </pre><blockquote><p>
! <ins>-?- <tt>is_placeholder</tt> can be used to detect the standard placeholders <tt>_1</tt>, <tt>_2</tt>, and so on. 
! <tt>bind</tt> uses <tt>is_placeholder</tt> to detect placeholders.</ins>
! <p/>
! <ins>-?- Instantiations of the <tt>is_placeholder</tt> template shall meet the UnaryTypeTrait requirements ([meta.rqmts]). 
! The implementation shall provide a definition that has a BaseCharacteristic of <tt>integral_constant&lt;int, J&gt;</tt> 
! if <tt>T</tt> is the type of <tt>std::placeholders::_J</tt>, otherwise it shall have a BaseCharacteristic of 
! <tt>integral_constant&lt;int, 0&gt;</tt>. A program may specialize this template for a user-defined type <tt>T</tt> 
! to have a BaseCharacteristic of <tt>integral_constant&lt;int, <i>N</i>&gt;</tt> with <tt><i>N</i> &gt; 0</tt> 
! to indicate that <tt>T</tt> should be treated as a placeholder type.</ins>
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2011"></a>2011. Unexpected output required of strings</h3>
! <p><b>Section:</b> 21.4.8.9 [string.io] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> James Kanze <b>Opened:</b> 2010-07-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.io">issues</a> in [string.io].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! What should the following code output? 
! </p>
! 
! <blockquote><pre>
! #include &lt;string&gt;
! #include &lt;iostream&gt;
! #include &lt;iomanip&gt;
! 
! int main() 
! { 
!    std::string test("0X1Y2Z"); 
!    std::cout.fill('*'); 
!    std::cout.setf(std::ios::internal, std::ios::adjustfield); 
!    std::cout &lt;&lt; std::setw(8) &lt;&lt; test &lt;&lt; std::endl; 
! } 
! </pre></blockquote>
! 
! <p>
! I would expect "<tt>**0X1Y2Z</tt>", and this is what the compilers I have access
! to (VC++, g++ and Sun CC) do.  But according to the standard, it should be
! "<tt>0X**1Y2Z</tt>":
! </p>
! 
! <p>
! 21.4.8.9 [string.io]&#47;5: 
! </p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
!   basic_ostream&lt;charT, traits&gt;&amp;
!     operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp; os, const basic_string&lt;charT,traits,Allocator&gt;&amp; str);
! </pre><blockquote><p>
! <i>Effects:</i> Behaves as a formatted output function (27.7.3.6.1 [ostream.formatted.reqmts]). After constructing 
! a <tt>sentry</tt> object, if this object returns <tt>true</tt> when converted to a value of type <tt>bool</tt>, 
! determines padding as described in 22.4.2.2.2 [facet.num.put.virtuals], then inserts the resulting sequence of
! characters seq as if by calling <tt>os.rdbuf()-&gt;sputn(seq, n)</tt>, where <tt>n</tt> is the larger of 
! <tt>os.width()</tt> and <tt>str.size()</tt>; then calls <tt>os.width(0)</tt>.
! </p></blockquote>
! </blockquote>
! 
! <p>
! 22.4.2.2.2 [facet.num.put.virtuals]&#47;5: 
! </p>
! 
! <blockquote>
! <p>
! [&hellip;] 
! </p>
! 
! <p>
! <b>Stage 3:</b> A local variable is initialized as
! </p>
! 
! <blockquote><pre>
! fmtflags adjustfield= (flags &amp; (ios_base::adjustfield));
! </pre></blockquote>
! 
! <p>
! The location of any padding is determined according to Table 88. 
! </p>
! 
! <p>
! If <tt>str.width()</tt> is nonzero and the number of <tt>charT</tt>'s in the
! sequence after stage 2 is less than <tt>str.width()</tt>, then enough fill
! characters are added to the sequence at the position indicated for padding to
! bring the length of the sequence to <tt>str.width()</tt>. <tt>str.width(0)</tt>
! is called.
! </p>
! 
! <table border="1">
! <caption>Table 88 &mdash; Fill padding</caption>
! <tr>
! <th>State</th>
! <th>Location</th>
! </tr>
! 
! <tr>
! <td><tt>adjustfield == ios_base::left</tt></td>
! <td>pad after</td>
! </tr>
! 
! <tr>
! <td><tt>adjustfield == ios_base::right</tt></td>
! <td>pad before</td>
! </tr>
! 
! <tr>
! <td><tt>adjustfield == internal</tt> and a sign occurs in the representation</td>
! <td>pad after the sign</td>
! </tr>
! 
! <tr>
! <td><tt>adjustfield == internal</tt> and representation after stage 1 began with 0x or 0X</td>
! <td>pad after x or X</td>
! </tr>
! 
! <tr>
! <td><i>otherwise</i></td>
! <td>pad before</td>
! </tr>
! </table>
! 
! </blockquote>
! 
! <p>
! Although it's not 100% clear what "the sequence after stage 2" should mean here,
! when there is no stage 2, the only reasonable assumption is that it is the
! contents of the string being output.  In the above code, the string being output
! is "<tt>0X1Y2Z</tt>", which starts with "<tt>0X</tt>", so the padding should be
! inserted "after x or X", and not before the string. I believe that this is a
! defect in the standard, and not in the three compilers I tried.
! </p>
! 
! <p><i>[
! 2010 Batavia (post meeting session)
! ]</i></p>
! 
! <p>
! Consensus that all known implementations are consistent, and disagree with the
! standard. Preference is to fix the standard before implementations start trying
! to conform to the current spec, as the current implementations have the preferred
! form. Howard volunteered to drught for Madrid, move to Open.
! </p>
! 
! <p><i>[2011-03-24 Madrid meeting]</i></p>
! 
! 
! <p>
! Daniel Kr&uuml;gler volunteered to provide wording, interacting with Dietmar and
! Bill. 
! </p>
! 
! <p><i>[2011-06-24 Daniel comments and provides wording]</i></p>
! 
! 
! <p>
! The same problem applies to the output provided by <tt>const char*</tt> and similar
! character sequences as of 27.7.3.6.4 [ostream.inserters.character] p. 5. and even for
! single character output (!) as described in 27.7.3.6.4 [ostream.inserters.character] p. 1,
! just consider the character value '-' where '-' is the sign character. In this case
! Table 91 &mdash; "Fill padding" requires to pad after the sign, i.e. the output
! for the program
! </p>
! <blockquote><pre>
! #include &lt;iostream&gt;
! #include &lt;iomanip&gt;
! 
! int main() 
! { 
!    char c = '-'; 
!    std::cout.fill('*'); 
!    std::cout.setf(std::ios::internal, std::ios::adjustfield); 
!    std::cout &lt;&lt; std::setw(2) &lt;&lt; c &lt;&lt; std::endl; 
! } 
! </pre></blockquote>
! 
! <p>
! According to the current wording this program should output "<tt>-*</tt>", but
! all tested implementations output "<tt>*-</tt>" instead.
! 
! <p/>
! I suggest to replace the reference to 22.4.2.2.2 [facet.num.put.virtuals] in all three places. 
! It is not very complicated to describe the padding rules for simple character sequences "inline". 
! A similar approach is used as for the <tt>money_put</tt> functions.
! </p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! Move to Review, the resolution seems correct but it would be nice if some factoring of the
! common words were proposed.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Moved to Tentatively Ready by the post-Kona issues processing subgroup.
! </p>
! <p>
! While better factoring of the common words is desirable, it is also editorial and
! should not hold up the progress of this issue.  As the edits impact two distinct
! clauses, it is not entirely clear what a better factoring should look like.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! The new wording refers to the FDIS numbering.
! </p>
! <ol>
! <li><p>Change 21.4.8.9 [string.io]&#47;5 as indicated:</p>
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
!   basic_ostream&lt;charT, traits&gt;&amp;
!     operator&lt;&lt;(basic_ostream&lt;charT, traits&gt;&amp; os,
!                const basic_string&lt;charT,traits,Allocator&gt;&amp; str);
! </pre><blockquote><p>
! -5- <i>Effects</i>: Behaves as a formatted output function ([ostream.formatted.reqmts]). After constructing a sentry object,
! if this object returns <tt>true</tt> when converted to a value of type <tt>bool</tt>, determines padding as <del>described
! in [facet.num.put.virtuals],</del><ins>follows: A <tt>charT</tt> character sequence is produced, initially consisting of 
! the elements defined by the range <tt>[str.begin(), str.end())</tt>. If <tt>str.size()</tt> is less than <tt>os.width()</tt>, 
! then enough copies of <tt>os.fill()</tt> are added to this sequence as necessary to pad to a width of <tt>os.width()</tt> 
! characters. If <tt>(os.flags() &amp; ios_base::adjustfield) == ios_base::left</tt> is <tt>true</tt>, the fill characters 
! are placed after the character sequence; otherwise, they are placed before the character sequence. T</ins><del>t</del>hen 
! inserts the resulting sequence of characters <tt>seq</tt> as if by calling <tt>os.rdbuf()-&gt;sputn(seq, n)</tt>, where 
! <tt>n</tt> is the larger of <tt>os.width()</tt> and <tt>str.size()</tt>; then calls <tt>os.width(0)</tt>.
! </p></blockquote></blockquote>
! </li>
! 
! <li><p>Change 27.7.3.6.4 [ostream.inserters.character]&#47;1 as indicated (An additional editorial
! fix is suggested for the first prototype declaration):</p>
! <blockquote><pre>
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp; out,
!                                           charT c<del>}</del><ins>)</ins>;
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp; out,
!                                           char c);
! <i>// specialization</i>
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
!                                          char c);
! <i>// signed and unsigned</i>
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
!                                          signed char c);
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
!                                          unsigned char c);
! </pre><blockquote><p>
! -1- <i>Effects</i>: Behaves like a formatted inserter (as described in [ostream.formatted.reqmts]) of <tt>out</tt>. 
! After a sentry object is constructed it inserts characters. In case <tt>c</tt> has type <tt>char</tt> and the 
! character type of the stream is not <tt>char</tt>, then the character to be inserted is <tt>out.widen(c)</tt>; 
! otherwise the character is <tt>c</tt>. Padding is determined as <del>described in [facet.num.put.virtuals]</del><ins>follows: 
! A character sequence is produced, initially consisting of the insertion character. If <tt>out.width()</tt> is greater
! than one, then enough copies of <tt>out.fill()</tt> are added to this sequence as necessary to pad to a width of 
! <tt>out.width()</tt> characters. If <tt>(out.flags() &amp; ios_base::adjustfield) == ios_base::left</tt> is <tt>true</tt>, 
! the fill characters are placed after the insertion character; otherwise, they are placed before the insertion 
! character</ins>. <del><tt>width(0)</tt> is called.</del> The insertion character and any required padding are 
! inserted into <tt>out</tt><ins>; then calls <tt>os.width(0)</tt></ins>.
! </p></blockquote></blockquote>
! </li>
! 
! <li><p>Change 27.7.3.6.4 [ostream.inserters.character]&#47;5 as indicated:</p>
! <blockquote><pre>
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp; out,
!                                           const charT* s);
! template&lt;class charT, class traits&gt;
!   basic_ostream&lt;charT,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;charT,traits&gt;&amp; out,
!                                           const char* s);
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
!                                          const char* s);
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
!                                          const signed char* s);
! template&lt;class traits&gt;
!   basic_ostream&lt;char,traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;char,traits&gt;&amp; out,
!                                          const unsigned char* s);
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -5- Padding is determined as <del>described in [facet.num.put.virtuals]. The <tt>n</tt> characters starting at <tt>s</tt> 
! are widened using <tt>out.widen</tt> ([basic.ios.members])</del><ins>follows: A character sequence is produced, initially 
! consisting of the elements defined by the <tt>n</tt> characters starting at <tt>s</tt> widened using 
! <tt>out.widen</tt> ([basic.ios.members]). If <tt>n</tt> is less than <tt>out.width()</tt>, then enough copies of 
! <tt>out.fill()</tt> are added to this sequence as necessary to pad to a width of <tt>out.width()</tt> characters. 
! If <tt>(out.flags() &amp; ios_base::adjustfield) == ios_base::left</tt> is <tt>true</tt>, the fill characters are 
! placed after the character sequence; otherwise, they are placed before the character sequence</ins>. The 
! widened characters and any required padding are inserted into <tt>out</tt>. Calls <tt>width(0)</tt>.
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2012"></a>2012. Associative maps should insert <tt>pair</tt>, not <tt>tuple</tt></h3>
! <p><b>Section:</b> 23.4 [associative] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2010-10-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative">active issues</a> in [associative].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative">issues</a> in [associative].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I'm seeing something strange in the paragraphs 23.4.4.4 [map.modifiers] and 23.4.5.3 [multimap.modifiers]:
! they both talk about <tt>tuple&lt;const key_type, mapped_type&gt;</tt> but I think they
! should be talking about <tt>pair&lt;const key_type, mapped_type&gt;</tt> because, among
! other reasons, a <tt>tuple</tt> is not convertible to a <tt>pair</tt>. If I replace <tt>tuple</tt>
! with <tt>pair</tt> everything makes sense to me.
! <p/>
! The proposed resolution is obvious. 
! </p>
! 
! <p><i>[
! 2010-11-07 Daniel comments
! ]</i></p>
! 
! 
! <p>
! This is by far not the only necessary fix within both sub-clauses. For details see the 2010-10-29 comment in 
! <a href="lwg-defects.html#2005">2005</a>.
! </p>
! 
! <p><i>[2011-03-24 Madrid meeting]</i></p>
! 
! 
! <p>
! Paolo: Don't think we can do it now.
! <p/>
! Daniel K: Agrees. 
! </p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! Consensus that this issue will be resolved by <a href="lwg-defects.html#2005">2005</a>, but held open until that issue is resolved.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Apply the resolution proposed by the 2010-10-29 comment in <a href="lwg-defects.html#2005">2005</a>.
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2013"></a>2013. Do library implementers have the freedom to add <tt>constexpr</tt>?</h3>
! <p><b>Section:</b> 17.6.5.6 [constexpr.functions] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2010-11-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>Suppose that a particular function is not tagged as constexpr in the standard,
! but that, in some particular implementation, it is possible to write it within
! the constexpr constraints. If an implementer tags such a function as constexpr,
! is that a violation of the standard or is it a conforming extension?</p>
! 
! <p>There are two questions to consider. First, is this allowed under the
! as-if rule? Second, if it does not fall under as-if, is there
! (and should there be) any special license granted to implementers
! to do this anyway, sort of the way we allow elision of copy constructors
! even though it is detectable by users?</p>
! 
! <p>I believe that this does not fall under "as-if", so implementers
! probably don't have that freedom today. I suggest changing the WP
! to grant it. Even if we decide otherwise, however, I suggest that
! we make it explicit.</p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! General surprise this was not already in 'Ready' status, and so moved.
! </p>
! 
! <p><i>[
! 2012 Kona
! ]</i></p>
! 
! 
! <p>
! Some concern expressed when presented to full committee for the vote to WP status
! that this issue had been resolved without sufficient thought of the consequences
! for diverging library implementations, as users may use SFINAE to observe
! different behavior from otherwise identical code.  Issue moved back to Review
! status, and will be discussed again in Portland with a larger group.
! 
! Note for Portland: John Spicer has agreed to represent Core's concerns during
! any such discussion within LWG.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! 
! <p>
! Straw poll: LWG strongly favoured to remove from implementations the freedom to add <tt>constexpr</tt>.
! </p>
! <p>
! Matt provides new wording.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! 
! <p>
! Move to Immediate after reviewing Matt's new wording, apply the new wording to the Working Paper.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p><i>In 17.6.5.6 [constexpr.functions], change paragraph 1 to:</i></p>
! 
! <blockquote><p>
! <ins>This standard explicitly requires that certain standard library functions
! are <tt>constexpr</tt> [dcl.constexpr]. 
! An implementation shall not declare any standard library function signature as <tt>constexpr</tt> 
! except for those where it is explicitly required.</ins>
! Within any header that provides any non-defining declarations of <tt>constexpr</tt>
! functions or constructors an implementation shall provide corresponding definitions. 
! </p></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2014"></a>2014. More restrictions on macro names</h3>
! <p><b>Section:</b> 17.6.4.3.1 [macro.names] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2010-11-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#macro.names">issues</a> in [macro.names].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! A program is currently forbidden to use keywords as macro names. This restriction should be strengthened to include all identifiers 
! that could be used by the library as attribute-tokens (for example <tt>noreturn</tt>, which is used by header <tt>&lt;cstdlib&gt;</tt>) 
! and the special identifiers introduced recently for override control (these are not currently used in the library public interface,
! but could potentially be used by the implementation or in future revisions of the library).
! </p>
! <p><i>[2011-02-10 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>Modify 17.6.4.3.1 [macro.names] paragraph 2 as follows:</p>
! 
! <blockquote><p>
! A translation unit shall not <tt>#define</tt> or <tt>#undef</tt> names
! lexically identical to keywords<ins>, to the identifiers listed in Table
! X [Identifiers with special meaning], or to the <i>attribute-tokens</i>
! described in clause 7.6 [dcl.attr]</ins>.
! </p></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2015"></a>2015. Incorrect pre-conditions for some type traits</h3>
! <p><b>Section:</b> 20.10.4 [meta.unary] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nikolay Ivchenkov <b>Opened:</b> 2010-11-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary">issues</a> in [meta.unary].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>According to N3126&nbsp;&#x2011;&nbsp;3.9/9,</p>
! 
! <p>&quot;Scalar types, trivial class types (Clause 9), arrays of such types
! and <i>cv</i>&#x2011;qualified versions of these types (3.9.3) are collectively
! called <i>trivial types</i>.&quot;</p>
! 
! <p>Thus, an array (possibly of unknown bound) can be trivial type, non&#x2011;trivial type, 
! or an array type whose triviality cannot be determined because its element type is incomplete.</p>
! 
! <p>According to N3126&nbsp;&#x2011;&nbsp;Table 45, preconditions for <tt>std::is_trivial</tt> are
! defined as follows:</p>
! 
! <p>&quot;<tt>T</tt> shall be a complete type, (possibly <i>cv</i>-qualified) <tt>void</tt>, 
! or an array of unknown bound&quot;</p>
! 
! <p>It seems that &quot;an array of unknown bound&quot; should be changed to &quot;an
! array of unknown bound of a complete element type&quot;. Preconditions for
! some other templates (e.g., <tt>std::is_trivially_copyable</tt>,
! <tt>std::is_standard_layout</tt>, <tt>std::is_pod</tt>, and <tt>std::is_literal_type</tt>) should
! be changed similarly.</p>
! 
! <p>On the other hand, some preconditions look too restrictive. For
! example, <tt>std::is_empty</tt> and <tt>std::is_polymorphic</tt> might accept any
! incomplete non&#x2011;class type.</p>
! 
! <p><i>[2011-02-18: Daniel provides wording proposal]</i></p>
! 
! 
! <p>
! While reviewing the individual preconditions I could find three different groups of
! either too weakening or too strengthening constraints:
! </p>
! <ol>
! <li><pre>is_empty/is_polymorphic/is_abstract/has_virtual_destructor:</pre>
! 
! <p>These traits can only apply for <em>non&#x2011;union class types</em>, otherwise the result must
! always be false</p>
! </li>
! 
! <li><pre>is_base_of:</pre>
! 
! <p>Similar to the previous bullet, but the current wording comes already near to that ideal,
! it only misses to add the <em>non&#x2011;union</em> aspect.</p>
! </li>
! 
! <li><pre>is_trivial/is_trivially_copyable/is_standard_layout/is_pod/is_literal_type:</pre>
! 
! <p>These traits always require that <tt>std::remove_all_extents&lt;T&gt;::type</tt> to be <tt><i>cv</i> void</tt> or 
! a complete type.</p>
! </li>
! </ol>
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>
! Modify the pre-conditions of the following type traits in 20.10.4.3 [meta.unary.prop], Table 48 &mdash; Type property predicates:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 48 &mdash; Type property predicates</caption>
! <tr>
! <th>Template</th>
! <th>Condition</th>
! <th>Preconditions</th>
! </tr>
! 
! <tr>
! <td colspan="3" style="text-align:center;">...</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class T&gt;<br/>
! struct is_trivial;</tt></td>
! <td><tt>T</tt> is a trivial type (3.9)</td>
! <td><tt><ins>remove_all_extents&lt;</ins>T<ins>&gt;::type</ins></tt><br/>
! shall be a complete type<del>,</del><ins> or</ins> (possibly<br/>
! cv-qualified) <tt>void</tt><del>, or an array of<br/>
! unknown bound</del>.</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class T&gt;<br/>
! struct is_trivially_copyable;</tt></td>
! <td><tt>T</tt> is a trivially copyable<br/>
! type (3.9)</td>
! <td><tt><ins>remove_all_extents&lt;</ins>T<ins>&gt;::type</ins></tt><br/>
! shall be a complete type<del>,</del><ins> or</ins> (possibly<br/>
! cv-qualified) <tt>void</tt><del>, or an array of<br/>
! unknown bound</del>.</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class T&gt;<br/>
! struct is_standard_layout;</tt></td>
! <td><tt>T</tt> is a standard-layout<br/>
! type (3.9)</td>
! <td><tt><ins>remove_all_extents&lt;</ins>T<ins>&gt;::type</ins></tt><br/>
! shall be a complete type<del>,</del><ins> or</ins> (possibly<br/>
! cv-qualified) <tt>void</tt><del>, or an array of<br/>
! unknown bound</del>.</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class T&gt;<br/>
! struct is_pod;</tt></td>
! <td><tt>T</tt> is a POD type (3.9)</td>
! <td><tt><ins>remove_all_extents&lt;</ins>T<ins>&gt;::type</ins></tt><br/>
! shall be a complete type<del>,</del><ins> or</ins> (possibly<br/>
! cv-qualified) <tt>void</tt><del>, or an array of<br/>
! unknown bound</del>.</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class T&gt;<br/>
! struct is_literal_type;</tt></td>
! <td><tt>T</tt> is a literal type (3.9)</td>
! <td><tt><ins>remove_all_extents&lt;</ins>T<ins>&gt;::type</ins></tt><br/>
! shall be a complete type<del>,</del><ins> or</ins> (possibly<br/>
! cv-qualified) <tt>void</tt><del>, or an array of<br/>
! unknown bound</del>.</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class T&gt;<br/>
! struct is_empty;</tt></td>
! <td><tt>T</tt> is a class type, but not a<br/>
! union type, with no<br/>
! non-static data members<br/>
! other than bit-fields of<br/>
! length 0, no virtual<br/>
! member functions, no<br/>
! virtual base classes, and<br/>
! no base class B for which<br/>
! <tt>is_empty&lt;B&gt;::value</tt> is<br/>
! false.</td>
! <td><del><tt>T</tt> shall be a complete type,<br/>
! (possibly cv-qualified) <tt>void</tt>, or<br/>
! an array of unknown bound</del><ins>If <tt>T</tt><br/>
! is a non&#x2011;union class type, <tt>T</tt><br/>
! shall be a complete type</ins>.</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class T&gt;<br/>
! struct is_polymorphic;</tt></td>
! <td><tt>T</tt> is a polymorphic<br/>
! class (10.3)</td>
! <td><del><tt>T</tt> shall be a complete type,<br/>
! type, (possibly cv-qualified) <tt>void</tt>, or<br/>
! an array of unknown bound</del><ins>If <tt>T</tt><br/>
! is a non&#x2011;union class type, <tt>T</tt><br/>
! shall be a complete type</ins>.</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class T&gt;<br/>
! struct is_abstract;</tt></td>
! <td><tt>T</tt> is an abstract<br/>
! class (10.4)</td>
! <td><del><tt>T</tt> shall be a complete type,<br/>
! type, (possibly cv-qualified) <tt>void</tt>, or<br/>
! an array of unknown bound</del><ins>If <tt>T</tt><br/>
! is a non&#x2011;union class type, <tt>T</tt><br/>
! shall be a complete type</ins>.</td>
! </tr>
! 
! <tr>
! <td colspan="3" style="text-align:center;">...</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class T&gt;<br/>
! struct has_virtual_destructor;</tt></td>
! <td><tt>T</tt> has a virtual<br/>
! destructor (12.4)</td>
! <td><del><tt>T</tt> shall be a complete type,<br/>
! (possibly cv-qualified) <tt>void</tt>, or<br/>
! an array of unknown bound</del><ins>If <tt>T</tt><br/>
! is a non&#x2011;union class type, <tt>T</tt><br/>
! shall be a complete type</ins>.</td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! 
! <li>
! <p>
! Modify the pre-conditions of the following type traits in 20.10.6 [meta.rel], Table 50 &mdash; Type relationship predicates:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 50 &mdash; Type relationship predicates</caption>
! <tr>
! <th>Template</th>
! <th>Condition</th>
! <th>Comments</th>
! </tr>
! 
! <tr>
! <td colspan="3" style="text-align:center;">...</td>
! </tr>
! 
! <tr>
! <td><tt>template &lt;class Base, class<br/>
! Derived&gt;<br/>
! struct is_base_of;</tt></td>
! <td><tt>Base</tt> is a base class of<br/>
! <tt>Derived</tt> (10) without<br/>
! regard to cv-qualifiers<br/>
! or <tt>Base</tt> and <tt>Derived</tt><br/>
! are not unions and<br/>
! name the same class<br/>
! type without regard to<br/>
! cv-qualifiers</td>
! <td>If <tt>Base</tt> and <tt>Derived</tt> are<br/>
! <ins>non&#x2011;union</ins> class types<br/>
! and are different types<br/>
! (ignoring possible cv-qualifiers)<br/>
! then <tt>Derived</tt> shall be a complete<br/>
! type. [ <i>Note</i>: Base classes that<br/>
! are private, protected, or<br/>
! ambigious are, nonetheless, base<br/>
! classes. &mdash; <i>end note</i> ]</td>
! </tr>
! 
! <tr>
! <td colspan="3" style="text-align:center;">...</td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2016"></a>2016. <tt>Allocators</tt> must be no-throw <i>swappable</i></h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-11-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! During the Batavia meeting it turned out that there is a definition
! hole for types satisfying the <tt>Allocators</tt> requirements: The problem
! became obvious when it was discussed whether all <tt>swap</tt> functions 
! of <tt>Containers</tt> with internal data handles can be safely tagged
! with <tt>noexcept</tt> or not. While it is correct that the implicit
! <tt>swap</tt> function of an allocator is required to be a no-throw
! operation (because move/copy-constructors and assignment operators are
! required to be no-throw functions), there are no such requirements
! for specialized <tt>swap</tt> overloads for a particular allocator.
! <p/>
! But this requirement is essential because the <tt>Containers</tt> are
! required to support <i>swappable</i> <tt>Allocators</tt>, when the value
! <tt>allocator_traits&lt;&gt;::propagate_on_container_swap</tt> evaluates
! to <tt>true</tt>.
! </p>
! <p><i>[2011-02-10 Alberto, Daniel, and Pablo collaborated on the proposed wording]</i></p>
! 
! <p>
! The proposed resolution (based on N3225) attempts to solve the following problems:
! </p>
! <ol>
! <li>Table 44 &mdash; Allocator requirements, expression rows 
! <tt>X::propagate_on_container_copy_assignment</tt>, <tt>X::propagate_on_container_move_assignment</tt>, and
! <tt>X::propagate_on_container_swap</tt> only describe operations, but no requirements. In fact, if and only
! if these compile-time predicates evaluate to <tt>true</tt>, the <em>additional</em> requirements
! <tt>CopyAssignable</tt>,  no-throw <tt>MoveAssignable</tt>, and no-throw lvalue <tt>Swappable</tt>, 
! respectively, are imposed on the allocator types.</li>
! <li>23.2.1 [container.requirements.general] p. 9 misses to refer to the correct swap conditions: The current wording does not relate to
! 17.6.3.2 [swappable.requirements] as it should and omits to mention that lvalues shall be swapped. Additional there is one
! situation described twice in p. 8 and p. 9 (undefined behaviour unless <tt>a.get_allocator() == b.get_allocator()</tt>
! or <tt>allocator_traits&lt;allocator_type&gt;::propagate_on_container_swap::value == true</tt>), which should be cleaned up.</li>
! </ol>
! 
! <p><i>[2011-04-08 Pablo comments]</i></p>
! 
! <p>
! I'm implementing a version of list now and I actually do find it impossible to write an exception-safe assignment 
! operator unless I can assume that allocator assignment does not throw.  (The problem is that I use a sentinel node 
! and I need to allocate a new sentinel using the new allocator without destroying the old one -- then swap the 
! allocator and sentinel pointer in atomically, without risk of an exception leaving one inconsistent with the other.
! <p/>
! Please update the proposed resolution to add the nothrow requirement to copy-assignment.
! </p>
! 
! <p><i>[2014-02-14 Issaquah: Move to Ready]</i></p>
! 
! <p>
! Fix a couple of grammar issues related to calling <tt>swap</tt> and move to Ready.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>
! Adapt the following three rows from Table 44 &mdash; Allocator requirements:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 44 &mdash; Allocator requirements</caption>
! <tr>
! <th>
! Expression
! </th>
! 
! <th>
! Return type
! </th>
! 
! <th>
! Assertion/note<br/>pre-/post-condition
! </th>
! 
! <th>
! Default
! </th>
! 
! </tr>
! 
! <tr>
! <td><tt>X::propagate_on_container_copy_assignment</tt></td>
! 
! <td>Identical to or derived from <tt>true_type</tt><br/>
! or <tt>false_type</tt></td>
! 
! <td><tt>true_type</tt> only if an allocator of type <tt>X</tt> should be copied<br/> 
! when the client container is copy-assigned. <ins>See Note B, below.</ins></td>
! 
! <td><tt>false_type</tt></td>
! </tr>
! 
! <tr>
! <td><tt>X::propagate_on_container_move_assignment</tt></td>
! 
! <td>Identical to or derived from <tt>true_type</tt><br/>
! or <tt>false_type</tt></td>
! 
! <td><tt>true_type</tt> only if an allocator of type <tt>X</tt> should be moved<br/>
! when the client container is move-assigned. <ins>See Note B, below.</ins></td>
! 
! <td><tt>false_type</tt></td>
! </tr>
! 
! <tr>
! <td><tt>X::propagate_on_container_swap</tt></td>
! 
! <td>Identical to or derived from <tt>true_type</tt><br/>
! or <tt>false_type</tt></td>
! 
! <td><tt>true_type</tt> only if an allocator of type <tt>X</tt> should be swapped<br/>
! when the client container is swapped. <ins>See Note B, below.</ins></td>
! 
! <td><tt>false_type</tt></td>
! </tr>
! 
! </table>
! </blockquote>
! 
! 
! </li>
! 
! <li>
! <p>Following 17.6.3.5 [allocator.requirements] p. 3 insert a new normative paragraph:</p>
! 
! <blockquote><p>
! <ins>Note B: If <tt>X::propagate_on_container_copy_assignment::value</tt> is true, <tt>X</tt> shall 
! satisfy the <tt>CopyAssignable</tt> requirements (Table 39  [copyassignable]) and the copy 
! operation shall not throw exceptions. If <tt>X::propagate_on_container_move_assignment::value</tt> is 
! true, <tt>X</tt> shall satisfy the <tt>MoveAssignable</tt> requirements (Table 38  [moveassignable]) 
! and the move operation shall not throw exceptions. If <tt>X::propagate_on_container_swap::value</tt> is 
! true, lvalues of <tt>X</tt> shall be swappable (17.6.3.2 [swappable.requirements]) and the <tt>swap</tt> 
! operation shall not throw exceptions.</ins>
! </p></blockquote>
! </li>
! 
! <li>
! <p>Modify 23.2.1 [container.requirements.general] p. 8 and p. 9 as indicated:</p>
! 
! <blockquote><p>
! 8 - [..] The allocator may be replaced only via assignment or <tt>swap()</tt>. Allocator replacement is 
! performed by copy assignment, move assignment, or swapping of the allocator only if 
! <tt>allocator_traits&lt;allocator_type&gt;::propagate_on_container_copy_assignment::value</tt>,
! <tt>allocator_traits&lt;allocator_type&gt;::propagate_on_container_move_assignment::value</tt>, 
! or <tt>allocator_traits&lt;allocator_type&gt;::propagate_on_container_swap::value</tt> is true 
! within the implementation of the corresponding container operation. <del>The behavior of a call to 
! a container's <tt>swap</tt> function is undefined unless the objects being swapped have allocators that compare 
! equal or <tt>allocator_traits&lt;allocator_type&gt;::propagate_on_container_swap::value</tt> is true</del>. In all 
! container types defined in this Clause, the member <tt>get_allocator()</tt> returns a copy of the allocator 
! used to construct the container or, if that allocator has been replaced, a copy of the most recent replacement.
! <p/>
! 9 - The expression <tt>a.swap(b)</tt>, for containers <tt>a</tt> and <tt>b</tt> of a standard container type 
! other than <tt>array</tt>, shall exchange the values of <tt>a</tt> and <tt>b</tt> without invoking any move, 
! copy, or swap operations on the individual container elements. <ins>Lvalues of a</ins><del>A</del>ny <tt>Compare</tt>, 
! <tt>Pred</tt>, or <tt>Hash</tt> <del>objects</del><ins>types</ins> belonging to <tt>a</tt> and <tt>b</tt> shall be swappable 
! and shall be exchanged by <del>unqualified calls to non-member</del> <ins>calling</ins> <tt>swap</tt> 
! <ins>as described in 17.6.3.2 [swappable.requirements]</ins>. If <tt>allocator_traits&lt;allocator_type&gt;::propagate_on_container_swap::value</tt> 
! is <tt>true</tt>, then <ins>lvalues of <tt>allocator_type</tt> shall be swappable and</ins> the allocators of <tt>a</tt> and 
! <tt>b</tt> shall also be exchanged <del>using an unqualified call to non-member</del><ins>by calling</ins>
! <tt>swap</tt> <ins>as described in 17.6.3.2 [swappable.requirements]</ins>. Otherwise, 
! <del>they</del><ins>the allocators</ins> shall not be swapped, and the behavior is undefined unless
! <tt>a.get_allocator() == b.get_allocator()</tt>. Every iterator referring to an element in one container before
! the swap shall refer to the same element in the other container after the swap. It is unspecified whether an
! iterator with value <tt>a.end()</tt> before the swap will have value <tt>b.end()</tt> after the swap.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2017"></a>2017. <tt>std::reference_wrapper</tt> makes incorrect usage of <tt>std::result_of</tt></h3>
! <p><b>Section:</b> 20.9.4 [refwrap] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Nikolay Ivchenkov <b>Opened:</b> 2010-11-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#refwrap">issues</a> in [refwrap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>std::reference_wrapper</tt>'s function call operator uses <em>wrong</em>
! type encoding for rvalue-arguments. An rvalue-argument of type <tt>T</tt> must
! be encoded as <tt>T&amp;&amp;</tt>, not as just <tt>T</tt>.
! </p>
! <blockquote><pre>
! #include &lt;functional&gt;
! #include &lt;iostream&gt;
! #include &lt;string&gt;
! #include &lt;type_traits&gt;
! #include &lt;utility&gt;
! 
! template &lt;class F, class... Types&gt;
!      typename std::result_of&lt;F (Types...)&gt;::type
!          f1(F f, Types&amp;&amp;... params)
! {
!      return f(std::forward&lt;Types...&gt;(params...));
! }
! 
! template &lt;class F, class... Types&gt;
!      typename std::result_of&lt;F (Types<b>&amp;&amp;</b>...)&gt;::type
!          f2(F f, Types&amp;&amp;... params)
! {
!      return f(std::forward&lt;Types...&gt;(params...));
! }
! 
! struct Functor
! {
!      template &lt;class T&gt;
!          T&amp;&amp; operator()(T&amp;&amp; t) const
!      {
!          return static_cast&lt;T&amp;&amp;&gt;(t);
!      }
! };
! 
! int main()
! {
!      typedef std::string const Str;
!      std::cout &lt;&lt; f1(Functor(), Str("1")) &lt;&lt; std::endl; // (1)
!      std::cout &lt;&lt; f2(Functor(), Str("2")) &lt;&lt; std::endl; // (2)
! }
! </pre></blockquote>
! <p>
! Lets consider the function template <tt>f1</tt> (which is similar to
! <tt>std::reference_wrapper</tt>'s function call operator). In the invocation
! (1) <tt>F</tt> is deduced as '<tt>Functor</tt>' and <tt>Types</tt> is deduced as type sequence
! which consists of one type '<tt>std::string const</tt>'. After the substitution
! we have the following equivalent:
! </p>
! <blockquote><pre>
! template &lt;&gt;
!     std::result_of&lt;F (std::string const)&gt;::type
!         f1&lt;Functor, std::string const&gt;(Functor f, std::string const &amp;&amp; params)
! {
!     return f(std::forward&lt;const std::string&gt;(params));
! }
! </pre></blockquote>
! <p>
! The top-level <i>cv</i>-qualifier in the parameter type of '<tt>F (std::string const)</tt>' is removed, so we have
! </p>
! <blockquote><pre>
! template &lt;&gt;
!     std::result_of&lt;F (std::string)&gt;::type
!         f1&lt;Functor, std::string const&gt;(Functor f, std::string const &amp;&amp; params)
! {
!     return f(std::forward&lt;const std::string&gt;(params));
! }
! </pre></blockquote>
! <p>
! Let <tt>r</tt> be an rvalue of type '<tt>std::string</tt>' and <tt>cr</tt> be an rvalue of type
! '<tt>std::string const</tt>'. The expression <tt>Str("1")</tt> is <tt>cr</tt>. The corresponding
! return type for the invocation
! </p>
! <blockquote><pre>
! Functor().operator()(r)
! </pre></blockquote>
! <p>
! is '<tt>std::string &amp;&amp;</tt>'. The corresponding return type for the invocation
! </p>
! <blockquote><pre>
! Functor().operator()(cr)
! </pre></blockquote>
! <p>
! is '<tt>std::string const &amp;&amp;</tt>'.
! <p/>
! <tt>std::result_of&lt;Functor (std::string)&gt;::type</tt> is the same type as the
! corresponding return type for the invocation <tt>Functor().operator()(r)</tt>,
! i.e. it is '<tt>std::string &amp;&amp;</tt>'. As a consequence, we have wrong reference
! binding in the return statement in <tt>f1</tt>.
! <p/>
! Now lets consider the invocation (2) of the function template <tt>f2</tt>. When
! the template arguments are substituted we have the following equivalent:
! </p>
! <blockquote><pre>
! template &lt;&gt;
!     std::result_of&lt;F (std::string const &amp;&amp;)&gt;::type
!         f2&lt;Functor, std::string const&gt;(Functor f, std::string const &amp;&amp; params)
! {
!     return f(std::forward&lt;const std::string&gt;(params));
! }
! </pre></blockquote>
! <p>
! <tt>std::result_of&lt;F (std::string const &amp;&amp;)&gt;::type</tt> is the same type as
! '<tt>std::string const &amp;&amp;</tt>'. This is correct result.
! </p>
! <p><i>[
! 2010-12-07 Jonathan Wakely comments and suggests a proposed resolution
! ]</i></p>
! 
! 
! <p>
! I agree with the analysis and I think this is a defect in the
! standard, it would be a shame if it can't be fixed.
! <p/>
! In the following example one would expect <tt>f(Str("1"))</tt> and
! <tt>std::ref(f)(Str("2"))</tt> to be equivalent but the current wording makes
! the invocation through <tt>reference_wrapper</tt> ill-formed:
! </p>
! <blockquote><pre>
! #include &lt;functional&gt;
! #include &lt;string&gt;
! 
! struct Functor
! {
!    template &lt;class T&gt;
!        T&amp;&amp; operator()(T&amp;&amp; t) const
!        {
!            return static_cast&lt;T&amp;&amp;&gt;(t);
!        }
! };
! 
! int main()
! {
!    typedef std::string const Str;
!    Functor f;
!    f( Str("1") );
!    std::ref(f)( Str("2") );  // error
! }
! </pre></blockquote>
! 
! <p><i>[
! 2010-12-07 Daniel comments and refines the proposed resolution
! ]</i></p>
! 
! 
! <p>
! There is one further defect in the usage of <tt>result_of</tt> within
! <tt>reference_wrapper</tt>'s function call operator: According to 20.9.4.4 [refwrap.invoke] p. 1
! the invokable entity of type <tt>T</tt> is provided as lvalue, but 
! <tt>result_of</tt> is fed as if it were an rvalue. This does not only lead to
! potentially incorrect result types, but it will also have the effect that
! we could never use the function call operator with a function type,
! because the type encoding used in <tt>result_of</tt> would form an invalid
! function type return a function type. The following program demonstrates
! this problem:
! </p>
! <blockquote><pre>
! #include &lt;functional&gt;
! 
! void foo(int) {}
! 
! int main()
! {
!    std::ref(foo)(0);  // error
! }
! </pre></blockquote><p>
! The correct solution is to ensure that <tt>T</tt> becomes <tt>T&amp;</tt>
! within <tt>result_of</tt>, which solves both problems at once.
! </p>
! 
! <p><i>[2011-02-24 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>
! Change the synopsis in 20.9.4 [refwrap] paragraph 1:
! </p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class T&gt; class reference_wrapper
!   {
!   public :
!     [...]
!     // invocation
!     template &lt;class... ArgTypes&gt;
!     typename result_of&lt;T<ins>&amp;</ins>(ArgTypes<ins>&amp;&amp;</ins>...)&gt;::type
!     operator() (ArgTypes&amp;&amp;...) const;
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li>
! <p>
! Change the signature in 20.9.4.4 [refwrap.invoke] before paragraph 1
! </p>
! 
! <blockquote><pre>
! template &lt;class... ArgTypes&gt;
! typename result_of&lt;T<ins>&amp;</ins>(ArgTypes<ins>&amp;&amp;</ins>... )&gt;::type
! operator()(ArgTypes&amp;&amp;... args) const;
! </pre><blockquote><p>
! 1 <i>Returns</i>: <tt>INVOKE(get(), std::forward&lt;ArgTypes&gt;(args)...)</tt>. (20.8.2)
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2018"></a>2018. [CD] <tt>regex_traits::isctype</tt> Returns clause is wrong</h3>
! <p><b>Section:</b> 28.7 [re.traits] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2010-11-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.traits">issues</a> in [re.traits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses GB 10</b></p>
! 
! <p>28.7 [re.traits] p. 12 says:</p>
! 
! <blockquote><p>
! returns true if <tt>f</tt> bitwise or&#39;ed with the result of calling
! <tt>lookup_classname</tt> with an iterator pair that designates the character
! sequence &quot;w&quot; is not equal to <tt>0</tt> and <tt>c == '_'</tt>
! </p></blockquote>
! 
! <p>
! If the bitmask value corresponding to &quot;w&quot; has a non-zero value (which
! it must do) then the bitwise or with any value is also non-zero, and
! so <tt>isctype('_', f)</tt> returns true for any <tt>f</tt>. Obviously this is wrong,
! since <tt>'_'</tt> is not in every <tt>ctype</tt> category.
! </p>
! 
! <p>
! There&#39;s a similar problem with the following phrases discussing the
! &quot;blank&quot; char class.
! </p>
! 
! <p><i>[2011-05-06: Jonathan Wakely comments and provides suggested wording]</i></p>
! 
! 
! <p>
! DR <a href="lwg-defects.html#2019">2019</a> added <tt>isblank</tt> support to <tt>&lt;locale&gt;</tt> which simplifies the
! definition of <tt>regex_traits::isctype</tt> by removing the special case for the "blank" class.
! <p/>
! My suggestion for 2018 is to add a new table replacing the lists of
! recognized names in the Remarks clause of <tt>regex_traits::lookup_classname</tt>. 
! I then refer to that table in the Returns clause of <tt>regex_traits::isctype</tt> 
! to expand on the "in an unspecified manner" wording which is too vague. The conversion 
! can now be described using the "is set" term defined by 17.5.2.1.3 [bitmask.types] and
! the new table to convey the intented relationship between e.g.
! [[:digit:]] and <tt>ctype_base::digit</tt>, which is not actually stated in the
! FDIS.
! <p/>
! The effects of <tt>isctype</tt> can then most easily be described in code,
! given an "exposition only" function prototype to do the not-quite-so-unspecified conversion 
! from <tt>char_class_type</tt> to <tt>ctype_base::mask</tt>.
! <p/>
! The core of LWG 2018 is the "bitwise or'ed" wording which gives the
! wrong result, always evaluating to true for all values of <tt>f</tt>. That is
! replaced by the condition <tt>(f&amp;x) == x</tt> where <tt>x</tt> is the result of calling
! <tt>lookup_classname</tt> with "w".  I believe that's necessary, because the
! "w" class could be implemented by an internal "underscore" class i.e.
! <tt>x = _Alnum|_Underscore</tt> in which case <tt>(f&amp;x) != 0</tt> would give the wrong
! result when <tt>f==_Alnum</tt>.
! <p/>
! The proposed resolution also makes use of <tt>ctype::widen</tt> which addresses
! the problem that the current wording only talks about "w" and '_' which assumes 
! <tt>charT</tt> is char.  There's still room for improvement here:
! the regex grammar in 28.13 [re.grammar] says that the class names in the
! table should always be recognized, implying that e.g. U"digit" should
! be recognized by <tt>regex_traits&lt;char32_t&gt;</tt>, but the specification of
! <tt>regex_traits::lookup_classname</tt> doesn't cover that, only mentioning
! <tt>char</tt> and <tt>wchar_t</tt>.  Maybe the table should not distinguish narrow and
! wide strings, but should just have one column and add wording to say
! that <tt>regex_traits</tt> widens the name as if by using <tt>use_facet&lt;ctype&lt;charT&gt;&gt;::widen()</tt>.
! <p/>
! Another possible improvement would be to allow additional
! implementation-defined extensions in <tt>isctype</tt>. An implementation is
! allowed to support additional class names in <tt>lookup_classname</tt>, e.g.
! [[:octdigit:]] for [0-7] or [[:bindigit:]] for [01], but the current
! definition of isctype provides no way to use them unless <tt>ctype_base::mask</tt> 
! also supports them.
! </p>
! 
! <p><i>[2011-05-10: Alberto and Daniel perform minor fixes in the P&#47;R]</i></p>
! 
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! Consensus that this looks to be a correct solution, and the presentation as a table is a big improvement.
! </p>
! 
! <p>
! Concern that the middle section wording is a little muddled and confusing, Stefanus volunteered to reword.
! </p>
! 
! <p><i>[
! 2013-09 Chicago
! ]</i></p>
! 
! 
! <p>
! Stefanus provides improved wording (replaced below)
! </p>
! 
! <p><i>[
! 2013-09 Chicago
! ]</i></p>
! 
! 
! <p>
! Move as Immediate after reviewing Stefanus's revised wording, apply the new wording to the Working Paper.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Modify 28.7 [re.traits] p. 10 as indicated:</p>
! <blockquote><pre>
! template &lt;class ForwardIterator&gt;
!   char_class_type lookup_classname(
!     ForwardIterator first, ForwardIterator last, bool icase = false) const;
! </pre><blockquote><p>
! -9- <i>Returns</i>: an unspecified value that represents the character classification named by the character
! sequence designated by the iterator range [<tt>first</tt>,<tt>last</tt>). If the parameter <tt>icase</tt> is true then the
! returned mask identifies the character classification without regard to the case of the characters being
! matched, otherwise it does honor the case of the characters being matched.(footnote 335) The value returned shall
! be independent of the case of the characters in the character sequence. If the name is not recognized
! then returns a value that compares equal to <tt>0</tt>.
! <p/>
! -10- <i>Remarks</i>: For <tt>regex_traits&lt;char&gt;</tt>, at least the <del>names "d", "w", "s", "alnum", "alpha", "blank",
! "cntrl", "digit", "graph", "lower", "print", "punct", "space", "upper" and "xdigit"</del><ins>narrow character
! names in Table X</ins> shall be recognized. For <tt>regex_traits&lt;wchar_t&gt;</tt>, at least the <del>names L"d", L"w", 
! L"s", L"alnum", L"alpha", L"blank", L"cntrl", L"digit", L"graph", L"lower", L"print", L"punct", L"space", L"upper" and 
! L"xdigit"</del><ins>wide character names in Table X</ins> shall be recognized.
! </p></blockquote></blockquote>
! </li>
! 
! <li><p>Modify 28.7 [re.traits] p. 12 as indicated:</p>
! <blockquote><pre>
! bool isctype(charT c, char_class_type f) const;
! </pre><blockquote><p>
! -11- <i>Effects</i>: Determines if the character <tt>c</tt> is a member of the character classification represented by <tt>f</tt>.
! <p/>
! -12- <i>Returns</i>: <del>Converts <tt>f</tt> into a value <tt>m</tt> of type <tt>std::ctype_base::mask</tt> in an 
!  unspecified manner, and returns true if <tt>use_facet&lt;ctype&lt;charT&gt; &gt;(getloc()).is(m, c)</tt> is true. Otherwise 
!  returns true if <tt>f</tt> bitwise or'ed with the result of calling <tt>lookup_classname</tt> with an iterator pair that 
!  designates the character sequence "w" is not equal to <tt>0</tt> and <tt>c == '_'</tt>, or if <tt>f</tt> bitwise or'ed 
!  with the result of calling <tt>lookup_classname</tt> with an iterator pair that designates the character sequence "blank" 
!  is not equal to <tt>0</tt> and <tt>c</tt> is one of an implementation-defined subset of the characters for 
!  which <tt>isspace(c, getloc())</tt> returns true, otherwise returns false.</del>
! <ins>Given an exposition-only function prototype</ins></p>
! <blockquote><pre>
! <ins style="text-decoration: none">
!   template&lt;class C&gt;
!    ctype_base::mask convert(typename regex_traits&lt;C&gt;::char_class_type f);
! </ins>
! </pre></blockquote>
! <p>
! <ins>that returns a value in which each <tt>ctype_base::mask</tt> value corresponding to a value in <tt>f</tt> named in Table <i>X</i> is set,
! then the result is determined as if by:</ins>
! </p>
! <blockquote><pre>
! <ins style="text-decoration: none">
! ctype_base::mask m = convert&lt;charT&gt;(f);
! const ctype&lt;charT&gt;&amp; ct = use_facet&lt;ctype&lt;charT&gt;&gt;(getloc());
! if (ct.is(m, c)) {
!   return true;
! } else if (c == ct.widen('_')) {
!   charT w[1] = { ct.widen('w') };
!   char_class_type x = lookup_classname(w, w+1);
!   
!   return (f&amp;x) == x;
! } else {
!   return false;
! } 
! </ins>
! </pre></blockquote>
! <p><ins>[<i>Example</i>:</ins></p>
! 
! <blockquote><pre><ins style="text-decoration: none">
! regex_traits&lt;char&gt; t;
! string d("d");
! string u("upper");
! regex_traits&lt;char&gt;::char_class_type f;
! f = t.lookup_classname(d.begin(), d.end());
! f |= t.lookup_classname(u.begin(), u.end());
! ctype_base::mask m = convert&lt;char&gt;(f); // m == ctype_base::digit|ctype_base::upper
! </ins></pre></blockquote>
! <p><ins>&mdash; <i>end example</i>]</ins></p>
! <p><ins>[<i>Example</i>:</ins></p>
! <blockquote><pre><ins style="text-decoration: none">
! regex_traits&lt;char&gt; t;
! string w("w");
! regex_traits&lt;char&gt;::char_class_type f;
! f = t.lookup_classname(w.begin(), w.end());
! t.isctype('A', f); // returns true
! t.isctype('_', f); // returns true
! t.isctype(' ', f); // returns false
! </ins></pre></blockquote>
! <p><ins>&mdash; <i>end example</i>]</ins></p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>At the end of 28.7 [re.traits] add a new "Table X &mdash; Character class names and corresponding ctype masks":</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table X &mdash; Character class names and corresponding ctype masks</caption>
! 
! <tr>
! <th>Narrow character name</th>
! <th>Wide character name</th>
! <th>Corresponding <tt>ctype_base::mask</tt> value</th>
! </tr>
!  
! <tr>
! <td><tt>"alnum"</tt></td>
! <td><tt>L"alnum"</tt></td>
! <td><tt>ctype_base::alnum</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"alpha"</tt></td>
! <td><tt>L"alpha"</tt></td>
! <td><tt>ctype_base::alpha</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"blank"</tt></td>
! <td><tt>L"blank"</tt></td>
! <td><tt>ctype_base::blank</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"cntrl"</tt></td>
! <td><tt>L"cntrl"</tt></td>
! <td><tt>ctype_base::cntrl</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"digit"</tt></td>
! <td><tt>L"digit"</tt></td>
! <td><tt>ctype_base::digit</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"d"</tt></td>
! <td><tt>L"d"</tt></td>
! <td><tt>ctype_base::digit</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"graph"</tt></td>
! <td><tt>L"graph"</tt></td>
! <td><tt>ctype_base::graph</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"lower"</tt></td>
! <td><tt>L"lower"</tt></td>
! <td><tt>ctype_base::lower</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"print"</tt></td>
! <td><tt>L"print"</tt></td>
! <td><tt>ctype_base::print</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"punct"</tt></td>
! <td><tt>L"punct"</tt></td>
! <td><tt>ctype_base::punct</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"space"</tt></td>
! <td><tt>L"space"</tt></td>
! <td><tt>ctype_base::space</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"s"</tt></td>
! <td><tt>L"s"</tt></td>
! <td><tt>ctype_base::space</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"upper"</tt></td>
! <td><tt>L"upper"</tt></td>
! <td><tt>ctype_base::upper</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"w"</tt></td>
! <td><tt>L"w"</tt></td>
! <td><tt>ctype_base::alnum</tt></td>
! </tr>
! 
! <tr>
! <td><tt>"xdigit"</tt></td>
! <td><tt>L"xdigit"</tt></td>
! <td><tt>ctype_base::xdigit</tt></td>
! </tr>
! 
! </table>
! </blockquote> 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2019"></a>2019. <tt>isblank</tt> not supported by <tt>std::locale</tt></h3>
! <p><b>Section:</b> 22.3.3.1 [classification] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2010-11-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>C99 added <tt>isblank</tt> and <tt>iswblank</tt> to <tt>&lt;locale.h&gt;</tt> but <tt>&lt;locale&gt;</tt> does not
! provide any equivalent.</p>
! 
! <p><i>[2011-02-24 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 6 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>Add to 22.3.3.1 [classification] synopsis:</p>
! <blockquote><pre>
! template &lt;class charT&gt; bool isgraph (charT c, const locale&amp; loc);
! <ins>template &lt;class charT&gt; bool isblank (charT c, const locale&amp; loc);</ins>
! </pre></blockquote>
! 
! <p>Add to 22.4.1 [category.ctype] synopsis:</p>
! 
! <blockquote><pre>
! static const mask xdigit = 1 &lt;&lt; 8;
! <ins>static const mask blank = 1 &lt;&lt; 9;</ins>
! static const mask alnum = alpha | digit;
! static const mask graph = alnum | punct;
! </pre></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2020"></a>2020. Time utility arithmetic <tt>constexpr</tt> functions have invalid effects</h3>
! <p><b>Section:</b> 20.12.5.5 [time.duration.nonmember] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-12-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration.nonmember">issues</a> in [time.duration.nonmember].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! As of issue <a href="lwg-defects.html#1171">1171</a> several time-utility functions have been marked <tt>constexpr</tt>.
! Alas this was done without adapting the corresponding return elements, which has the effect that 
! none of current arithmetic functions of class template <tt>duration</tt> marked as <tt>constexpr</tt> 
! can ever be <tt>constexpr</tt> functions (which makes them ill-formed, no diagnostics required as 
! of recent core rules), because they invoke a non-constant expression, e.g. 20.12.5.5 [time.duration.nonmember]/2:
! </p>
! <blockquote><pre>
! template &lt;class Rep1, class Period1, class Rep2, class Period2>
! constexpr typename common_type&lt;duration&lt;Rep1, Period1&gt;, duration&lt;Rep2, Period2&gt;{&gt;}::type
! operator+(const duration&lt;Rep1, Period1>&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
! 
! 2 Returns: CD(lhs) += rhs.
! </pre></blockquote>
! <p>
! The real problem is, that we cannot defer to as-if rules here: The returns element
! specifies an indirect calling contract of a potentially user-defined function. This <em>cannot</em> be
! the <tt>+=</tt> assignment operator of such a user-defined type, but must be the corresponding
! immutable binary <tt>operator+</tt> (unless we require that <tt>+=</tt> shall be an immutable function
! which does not really makes sense).
! </p>
! <p><i>[2011-02-17 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! The suggested wording changes are against the working draft N3242. Additional to the normative wording
! changes some editorial fixes are suggested.
! </p>
! <ol>
! <li>
! <p>In 20.12.5.5 [time.duration.nonmember], change the following arithmetic function specifications as follows:</p>
! <blockquote><pre>
! template &lt;class Rep1, class Period1, class Rep2, class Period2&gt;
! constexpr typename common_type&lt;duration&lt;Rep1, Period1&gt;, duration&lt;Rep2, Period2&gt;<del>{</del>&gt;<del>}</del>::type
! operator+(const duration&lt;Rep1, Period1&gt;&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
! </pre><blockquote><p>
! 2 <i>Returns</i>: <del><tt>CD(lhs) += rhs</tt></del><ins><tt>CD(CD(lhs).count() + CD(rhs).count())</tt></ins>.
! </p></blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep1, class Period1, class Rep2, class Period2&gt;
! constexpr typename common_type&lt;duration&lt;Rep1, Period1&gt;, duration&lt;Rep2, Period2&gt;<del>{</del>&gt;<del>}</del>::type
! operator-(const duration&lt;Rep1, Period1&gt;&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
! </pre><blockquote><p>
! 3 <i>Returns</i>: <del><tt>CD(lhs) -= rhs</tt></del><ins><tt>CD(CD(lhs).count() - CD(rhs).count())</tt></ins>.
! </p></blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
! constexpr duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
! operator*(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
! </pre><blockquote><p>
! 4 <i>Remarks</i>: This operator shall not participate in overload resolution unless <tt>Rep2</tt> is implicitly convertible
! to <tt>CR(Rep1, Rep2)</tt>.
! <p/>
! 5 <i>Returns</i>: <del><tt>duration&lt;CR(Rep1, Rep2), Period&gt;(d) *= s</tt></del><ins><tt>CD(CD(d).count() * s)</tt></ins>.
! </p></blockquote></blockquote>
! 
! <blockquote><p>
! <tt>[...]</tt>
! </p></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
! constexpr duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
! operator/(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
! </pre><blockquote><p>
! 8 <i>Remarks</i>: This operator shall not participate in overload resolution unless <tt>Rep2</tt> is implicitly convertible
! to <tt>CR(Rep1, Rep2)</tt> and <tt>Rep2</tt> is not an instantiation of <tt>duration</tt>.
! <p/>
! 9 <i>Returns</i>: <del><tt>duration&lt;CR(Rep1, Rep2), Period&gt;(d) &#47;= s</tt></del><ins><tt>CD(CD(d).count() &#47; s)</tt></ins>.
! </p></blockquote></blockquote>
! 
! <blockquote><p>
! <tt>[...]</tt>
! </p></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep1, class Period, class Rep2&gt;
! constexpr duration&lt;typename common_type&lt;Rep1, Rep2&gt;::type, Period&gt;
! operator%(const duration&lt;Rep1, Period&gt;&amp; d, const Rep2&amp; s);
! </pre><blockquote><p>
! 11 <i>Remarks</i>: This operator shall not participate in overload resolution unless <tt>Rep2</tt> is implicitly convertible
! to <tt>CR(Rep1, Rep2)</tt> and <tt>Rep2</tt> is not an instantiation of <tt>duration</tt>.
! <p/>
! 12 <i>Returns</i>: <del><tt>duration&lt;CR(Rep1, Rep2), Period&gt;(d) %= s</tt></del><ins><tt>CD(CD(d).count() % s)</tt></ins>
! </p></blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep1, class Period1, class Rep2, class Period2&gt;
! constexpr typename common_type&lt;duration&lt;Rep1, Period1&gt;, duration&lt;Rep2, Period2&gt;&gt;::type
! operator%(const duration&lt;Rep1, Period1&gt;&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
! </pre><blockquote><p>
! 13 Returns: <del><tt>common_type&lt;duration&lt;Rep1, Period1&gt;, duration&lt;Rep2, Period2&gt; &gt;::type(lhs) 
!  %= rhs</tt></del><ins><tt>CD(CD(lhs).count() % CD(rhs).count())</tt></ins>.
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2021"></a>2021. Further incorrect usages of <tt>result_of</tt></h3>
! <p><b>Section:</b> 20.9.10.3 [func.bind.bind], 30.6.1 [futures.overview], 30.6.8 [futures.async] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-12-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.bind.bind">issues</a> in [func.bind.bind].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Issue <a href="lwg-defects.html#2017">2017</a> points out some incorrect usages of <tt>result_of</tt> in the
! declaration of the function call operator overload of <tt>reference_wrapper</tt>,
! but there are more such specification defects:
! </p>
! <ol>
! <li>According to 20.9.10.3 [func.bind.bind] p. 3: 
! <blockquote><p>
! [..] The effect of <tt>g(u1, u2, ..., uM)</tt> shall be <tt>INVOKE(fd, v1, v2, ..., vN, result_of&lt;FD cv (V1, V2, ..., VN)&gt;::type)</tt> [..]
! </p></blockquote>
! <p>
! but <tt>fd</tt> is defined as &quot;an lvalue of type <tt>FD</tt> constructed from <tt>std::forward&lt;F&gt;(f)</tt>&quot;. This means that
! the above usage must refer to <tt>result_of&lt;FD cv <strong>&amp;</strong> (V1, V2, ..., VN)&gt;</tt> instead.
! </p>
! </li>
! <li><p>
! Similar in 20.9.10.3 [func.bind.bind] p. 10 bullet 2 we have:
! </p>
! <blockquote><p>
! if the value of <tt>is_bind_expression&lt;TiD&gt;::value</tt> is true, the argument is <tt>tid(std::forward&lt;Uj&gt;(uj)...)</tt>
! and its type <tt>Vi</tt> is <tt>result_of&lt;TiD cv (Uj...)&gt;::type</tt>
! </p></blockquote>
! <p>
! Again, <tt>tid</tt> is defined as &quot;lvalue of type <tt>TiD</tt> constructed from <tt>std::forward&lt;Ti&gt;(ti)</tt>&quot;. This means that
! the above usage must refer to <tt>result_of&lt;TiD cv <strong>&amp;</strong> (Uj...)&gt;</tt> instead. We also have similar defect as in
! <a href="lwg-defects.html#2017">2017</a> in regard to the argument types, this leads us to the further corrected form 
! <tt>result_of&lt;TiD cv <strong>&amp;</strong> (Uj<strong>&amp;&amp;</strong>...)&gt;</tt>. This is not the end: Since the <tt>Vi</tt>
! are similar sensitive to the argument problem, the last part must say: 
! <p/>
! &quot;[..] its type <tt>Vi</tt> is <tt>result_of&lt;TiD cv <strong>&amp;</strong> (Uj<strong>&amp;&amp;</strong>...)&gt;::type <strong>&amp;&amp;</strong>&quot;</tt>
! <p/>
! (The bound arguments <tt>Vi</tt> can never be <tt>void</tt> types, therefore we don't need 
! to use the more defensive <tt>std::add_rvalue_reference</tt> type trait)
! </p>
! </li>
! <li><p>The function template <tt>async</tt> is declared as follows (the other overload has the same problem):</p>
! <blockquote><pre>
! template &lt;class F, class... Args&gt;
! future&lt;typename result_of&lt;F(Args...)&gt;::type&gt;
! async(F&amp;&amp; f, Args&amp;&amp;... args);
! </pre></blockquote><p>
! This usage has the some same problems as we have found in <tt>reference_wrapper</tt> (<a href="lwg-defects.html#2017">2017</a>) and more: According to
! the specification in 30.6.8 [futures.async] the effective result type is that of the call of
! </p><blockquote><pre>
! INVOKE(decay_copy(std::forward&lt;F&gt;(f)), decay_copy(std::forward&lt;Args&gt;(args))...)
! </pre></blockquote><p>
! First, <tt>decay_copy</tt> potentially modifies the effective types to <tt>decay&lt;F&gt;::type</tt> and <tt>decay&lt;Args&gt;::type...</tt>.
! Second, the current specification is not really clear, what the value category of callable type or the arguments shall be: According
! to the second bullet of 30.6.8 [futures.async] p. 3:
! </p>
! <blockquote><p>
! Invocation of the deferred function evaluates <tt>INVOKE(g, xyz)</tt> where <tt>g</tt> is the stored value of 
! <tt>decay_copy(std::forward&lt;F&gt;(f))</tt> and <tt>xyz</tt> is the stored copy of 
! <tt>decay_copy(std::forward&lt;Args&gt;(args))...</tt>.
! </p></blockquote><p>
! This seems to imply that lvalues are provided in contrast to the direct call expression of 30.6.8 [futures.async] p. 2
! which implies rvalues instead. The specification needs to be clarified.
! </p>
! </li>
! </ol>
! 
! <p><i>[2011-06-13: Daniel comments and refines the proposed wording changes]</i></p>
! 
! 
! <p>The feedback obtained following message c++std-lib-30745  and follow-ups point to the intention, that 
! the implied provision of lvalues due to named variables in <tt>async</tt> should be provided as rvalues to support
! move-only types, but the functor type should be forwarded as lvalue in <tt>bind</tt>.
! <p/>
! If <tt>bind</tt> were newly invented, the value strategy could be improved, because now we have a preference of
! <i>ref</i> <tt>&amp;</tt> qualified function call operator overloads. But such a change seems to be too late now.
! User-code that needs to bind a callable object with an <i>ref</i> <tt>&amp;&amp;</tt> qualified function call
! operator (or conversion function to function pointer) needs to use a corresponding wrapper similar to <tt>reference_wrapper</tt>
! that forwards the reference as rvalue-reference instead.
! <p/>
! The wording has been adapted to honor these observations and to fit to FDIS numbering as well.
! </p>
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! The suggested wording changes are against the FDIS.
! </p>
! <ol>
! <li>
! <p>Change 20.9.10.3 [func.bind.bind] p. 3 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class F, class... BoundArgs&gt;
!   <i>unspecified</i> bind(F&amp;&amp; f, BoundArgs&amp;&amp;... bound_args);
! </pre><blockquote><p>
! -2- <i>Requires</i>: <tt>is_constructible&lt;FD, F&gt;::value</tt> shall be true. For each <tt>Ti</tt> in <tt>BoundArgs</tt>, 
! <tt>is_constructible&lt;TiD, Ti&gt;::value</tt> shall be true. <tt><i>INVOKE</i>(fd, w1, w2, ..., wN)</tt> (20.8.2) shall 
! be a valid expression for some values <tt>w1</tt>, <tt>w2</tt>, ..., <tt>wN</tt>, where <tt>N == sizeof...(bound_args)</tt>.
! <p/>
! -3- <i>Returns</i>: A forwarding call wrapper <tt>g</tt> with a weak result type (20.8.2). The effect of 
! <tt>g(u1, u2, ..., uM)</tt> shall be <tt>INVOKE(fd, <ins>std::forward&lt;V1&gt;(</ins>v1<ins>)</ins>, 
! <ins>std::forward&lt;V2&gt;(</ins>v2<ins>)</ins>, ..., <ins>std::forward&lt;VN&gt;(</ins>vN<ins>)</ins>, 
! result_of&lt;FD <i>cv</i> <ins>&amp;</ins> (V1, V2, ..., VN)&gt;::type)</tt>, where <i>cv</i> represents 
! the <i>cv</i>-qualifiers of <tt>g</tt> and the values and types of the bound arguments <tt>v1</tt>, 
! <tt>v2</tt>, ..., <tt>vN</tt> are determined as specified below. [&hellip;]
! </p></blockquote></blockquote>
! 
! </li>
! 
! <li>
! <p>Change 20.9.10.3 [func.bind.bind] p. 7 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class R, class F, class... BoundArgs&gt;
!    <i>unspecified</i> bind(F&amp;&amp; f, BoundArgs&amp;&amp;... bound_args);
! </pre><blockquote><p>
! -6- <i>Requires</i>: <tt>is_constructible&lt;FD, F&gt;::value</tt> shall be true. For each <tt>Ti</tt> in <tt>BoundArgs</tt>, 
! <tt>is_constructible&lt;TiD, Ti&gt;::value</tt> shall be true. <tt><i>INVOKE</i>(fd, w1, w2, ..., wN)</tt> shall be a valid 
! expression for some values <tt>w1</tt>, <tt>w2</tt>, ..., <tt>wN</tt>, where <tt>N == sizeof...(bound_args)</tt>.
! <p/>
! -7- <i>Returns</i>: A forwarding call wrapper <tt>g</tt> with a nested type <tt>result_type</tt> defined as a synonym for
! <tt>R</tt>. The effect of <tt>g(u1, u2, ..., uM)</tt> shall be <tt>INVOKE(fd, <ins>std::forward&lt;V1&gt;(</ins>v1<ins>)</ins>, 
! <ins>std::forward&lt;V2&gt;(</ins>v2<ins>)</ins>, ..., <ins>std::forward&lt;VN&gt;(</ins>vN<ins>)</ins>, R)</tt>, where 
! the values and types of the bound arguments <tt>v1</tt>, <tt>v2</tt>, ..., <tt>vN</tt> are determined as specified below. [&hellip;]
! </p></blockquote></blockquote>
! 
! </li>
! 
! <li>
! <p>Change 20.9.10.3 [func.bind.bind] p. 10 as indicated:</p>
! 
! <blockquote><p>
! -10- The values of the <i>bound arguments</i> <tt>v1</tt>, <tt>v2</tt>, ..., <tt>vN</tt> and their corresponding types <tt>V1</tt>, 
! <tt>V2</tt>, ..., <tt>VN</tt> depend on the types <tt>TiD</tt> derived from the call to bind and the <i>cv</i>-qualifiers 
! <i>cv</i> of the call wrapper <tt>g</tt> as follows:</p>
! <ul>
! <li>if <tt>TiD</tt> is <tt>reference_wrapper&lt;T&gt;</tt>, the argument is <tt>tid.get()</tt> and its type <tt>Vi</tt> 
! is <tt>T&amp;</tt>;</li>
! <li>if the value of <tt>is_bind_expression&lt;TiD&gt;::value</tt> is <tt>true</tt>, the argument is 
! <tt>tid(std::forward&lt;Uj&gt;(uj)...)</tt> and its type <tt>Vi</tt> is 
! <tt>result_of&lt;TiD <i>cv</i> <ins>&amp;</ins> (Uj<ins>&amp;&amp;</ins>...)&gt;::type<ins>&amp;&amp;</ins></tt>;</li>
! <li>if the value <tt>j</tt> of <tt>is_placeholder&lt;TiD&gt;::value</tt> is not zero, the argument is 
! <tt>std::forward&lt;Uj&gt;(uj)</tt> and its type <tt>Vi</tt> is <tt>Uj&amp;&amp;</tt>;</li>
! <li>otherwise, the value is <tt>tid</tt> and its type <tt>Vi</tt> is <tt>TiD <i>cv</i> &amp;</tt>.</li>
! </ul>
! </blockquote>
! 
! </li>
! 
! <li>
! <p>
! This resolution assumes that the wording of 30.6.8 [futures.async] is intended to provide rvalues
! as arguments of <tt>INVOKE</tt>.
! </p>
! 
! <p>
! Change the function signatures in header <tt>&lt;future&gt;</tt> synopsis 30.6.1 [futures.overview] p. 1
! and in 30.6.8 [futures.async] p. 1 as indicated:
! </p>
! 
! <blockquote><pre>
! template &lt;class F, class... Args&gt;
! future&lt;typename result_of&lt;<ins>typename decay&lt;</ins>F<ins>&gt;::type</ins>(<ins>typename decay&lt;</ins>Args<ins>&gt;::type</ins>...)&gt;::type&gt;
! async(F&amp;&amp; f, Args&amp;&amp;... args);
! template &lt;class F, class... Args>
! future&lt;typename result_of&lt;<ins>typename decay&lt;</ins>F<ins>&gt;::type</ins>(<ins>typename decay&lt;</ins>Args<ins>&gt;::type</ins>...)&gt;::type&gt;
! async(launch policy, F&amp;&amp; f, Args&amp;&amp;... args);
! </pre></blockquote>
! </li>
! 
! <li>
! <p>Change 30.6.8 [futures.async] as indicated: (Remark: There is also a tiny editorial correction 
! in p. 4 that completes one <tt>::</tt> scope specifier)
! </p>
! 
! <blockquote><p>
! -3- <i>Effects</i>: [&hellip;]
! </p>
! <ul>
! <li>[&hellip;]</li>
! <li>if <tt>policy &amp; launch::deferred</tt> is non-zero &mdash; Stores <tt><i>DECAY_COPY</i>(std::forward&lt;F&gt;(f))</tt> 
! and <tt><i>DECAY_COPY</i>(std::forward&lt;Args&gt;(args))...</tt> in the shared state. These copies of <tt>f</tt> and 
! <tt>args</tt> constitute a <i>deferred function</i>. Invocation of the deferred function evaluates 
! <tt><i>INVOKE</i>(<ins>std::move(</ins>g<ins>)</ins>, <ins>std::move(</ins>xyz<ins>)</ins>)</tt>
! where <tt>g</tt> is the stored value of <tt><i>DECAY_COPY</i>(std::forward&lt;F&gt;(f))</tt> and <tt>xyz</tt> is the 
! stored copy of <tt><i>DECAY_COPY</i>(std::forward&lt;Args&gt;(args))...</tt>. The shared state is not made ready 
! until the function has completed. The first call to a non-timed waiting function (30.6.4) on an asynchronous
! return object referring to this shared state shall invoke the deferred function in the thread that
! called the waiting function. Once evaluation of <tt><i>INVOKE</i>(<ins>std::move(</ins>g<ins>)</ins>, 
! <ins>std::move(</ins>xyz<ins>)</ins>)</tt> begins, the function is no longer considered deferred. [ <i>Note</i>: If 
! this policy is specified together with other policies, such as when using a <tt>policy</tt> value of 
! <tt>launch::async | launch::deferred</tt>, implementations should defer invocation or the selection of 
! the policy when no more concurrency can be effectively exploited. &mdash; <i>end note</i> ]</li>
! </ul>
! </blockquote>
! 
! <blockquote><p>
! -4- <i>Returns</i>: an object of type 
! <tt>future&lt;typename result_of&lt;<ins>typename decay&lt;</ins>F<ins>&gt;::type</ins>(<ins>typename decay&lt;</ins>Args<ins>&gt;::type</ins>...)&gt;:<ins>:</ins>type&gt;</tt> 
! that refers to the associated asynchronous state created by this call to <tt>async</tt>.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2022"></a>2022. <tt>reference_wrapper&lt;T&gt;::result_type</tt> is underspecified</h3>
! <p><b>Section:</b> 20.9.4 [refwrap] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-12-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#refwrap">issues</a> in [refwrap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Issue <a href="lwg-defects.html#1295">1295</a> correctly removed function types and references to function types from the
! bullet 1 of 20.9.2 [func.require] p. 3 because neither function types nor function references
! satisfy the requirements for a target object which is <em>defined</em> to be an object of a callable 
! type. This has the effect that the reference in 20.9.4 [refwrap] p. 2
! </p>
! <blockquote><p>
! <tt>reference_wrapper</tt> has a weak result type (20.8.2).
! </p></blockquote>
! <p>
! is insufficient as a reference to define the member type <tt>result_type</tt> when the template argument 
! <tt>T</tt> is a function type.
! <p/>
! There are basically two approaches to solve the problem:
! </p>
! <ol>
! <li><p>Extend the definition of a <i>weak result type</i> in 20.9.2 [func.require] p. 3 to both
! function types and references thereof. This extension must be specified independend from the concept
! of a call wrapper, though.</p>
! </li>
! <li><p>Add one extra sentence to 20.9.4 [refwrap] p. 2 that simply defines the member type
! <tt>result_type</tt> for <tt>reference_wrapper&lt;T&gt;</tt>, when <tt>T</tt> is a function type.</p>
! </li>
! </ol>
! <p>
! I checked the current usages of <i>weak result type</i> to have a base to argue for one or the other
! approach. It turns out, that there is no further reference to this definition in regard to
! function types or references thereof. The only other reference can be found in 
! 20.9.10.3 [func.bind.bind] p. 3, where <tt>g</tt> is required to be a class type.
! </p>
! 
! <p><i>[2011-02-23 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! The suggested wording changes are against the working draft N3242.
! </p>
! 
! <ol>
! <li>
! <p>Change 20.9.4 [refwrap] p. 2 as indicated:</p>
! 
! <blockquote><p>
! 2 <tt>reference_wrapper<ins>&lt;T&gt;</ins></tt> has a weak result type (20.8.2). <ins>If <tt>T</tt> is a function type, 
! <tt>result_type</tt> shall be a synonym for the return type of <tt>T</tt>.</ins>
! </p></blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2023"></a>2023. Incorrect requirements for <tt>lock_guard</tt> and <tt>unique_lock</tt></h3>
! <p><b>Section:</b> 30.4.2.1 [thread.lock.guard], 30.4.2.2 [thread.lock.unique] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-12-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! There are two different <tt>*Lockable</tt> requirements imposed on template arguments
! of the class template <tt>lock_guard</tt> as of 30.4.2.1 [thread.lock.guard] p. 1+2:
! </p>
! <blockquote><p>
! 1 [..] The supplied <tt>Mutex</tt> type shall meet the <tt>BasicLockable</tt> requirements (30.2.5.2).
! </p></blockquote>
! 
! <blockquote><p>
! 2 The supplied <tt>Mutex</tt> type shall meet the <tt>Lockable</tt> requirements (30.2.5.3).
! </p></blockquote>
! <p>
! The <tt>Lockable</tt> requirements include the availability of a member function <tt>try_lock()</tt>,
! but there is no operational semantics in the specification of <tt>lock_guard</tt> that would rely
! on such a function. It seems to me that paragraph 2 should be removed.
! <p/>
! Similarly, 30.4.2.2 [thread.lock.unique] p. 1+2 refer to exactly the same two requirements.
! In this case it seems as if the intention was that the template arguement <tt>Mutex</tt> should
! always provide the <tt>try_lock()</tt> member function, because several member functions of
! <tt>unique_lock</tt> (<tt>unique_lock(mutex_type&amp; m, try_to_lock_t)</tt> or <tt>bool try_lock()</tt>) 
! take advantage of such a function without adding extra requirements for this.
! It seems that the requirement subset <tt>BasicLockable</tt> should be removed.
! <p/>
! I searched for further possible misusages of the <tt>*Lockable</tt> requirements, but could not
! find any more.
! </p>
! 
! <p><i>[2011-02-23]</i></p>
! 
! 
! <p>Howard suggests an alternative approach in regard to <tt>unique_lock</tt>: The current
! minimum requirements on its template argument should better be reduced to <tt>BasicLockable</tt> 
! instead of the current <tt>Lockable</tt>, including ammending member-wise constraints where required. 
! This suggestions was supported by Anthony, Daniel, and Pablo.
! <p/>
! Daniel drafts wording that follows this separation strategy.
! </p>
! 
! <p><i>[2011-02-24 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p> 
! 
! <blockquote class="note">
! <p>
! The suggested wording changes are against the working draft N3242.
! </p>
! 
! <ol>
! <li>
! <p>Remove 30.4.2.1 [thread.lock.guard] p. 2 completely:</p>
! 
! <blockquote><p>
! <del>2 The supplied <tt>Mutex</tt> type shall meet the <tt>Lockable</tt> requirements (30.2.5.3).</del>
! </p></blockquote>
! 
! </li>
! 
! <li>
! <p>Change 30.4.2.2 [thread.lock.unique] p. 1-3 as indicated. The intend is to make <tt>BasicLockable</tt>
! the fundamental requirement for <tt>unique_lock</tt>. We also update the note to reflect these changes and
! synchronize one remaining reference of 'mutex' by the proper term 'lockable object' in sync
! to the wording changes of <tt>lock_guard</tt>:</p>
! 
! <blockquote><p>
! 1 [..] The behavior of a program is undefined if the contained pointer <tt>pm</tt> is not null
! and the <del>mutex</del><ins>lockable object</ins> pointed to by <tt>pm</tt> does not exist for the entire remaining lifetime (3.8) 
! of the <tt>unique_lock</tt> object. The supplied <tt>Mutex</tt> type shall meet the 
! <tt>BasicLockable</tt> requirements (30.2.5.2). <del>[Editor's note:
! BasicLockable is redundant, since the following additional paragraph requires Lockable.]</del>
! </p></blockquote>
! 
! <blockquote><p>
! <del>2 The supplied <tt>Mutex</tt> type shall meet the <tt>Lockable</tt> requirements (30.2.5.3).</del>
! </p></blockquote>
! 
! <blockquote><p>
! 3 [ <i>Note</i>: <tt>unique_lock&lt;Mutex&gt;</tt> meets the <tt><ins>Basic</ins>Lockable</tt> requirements. If 
! <ins><tt>Mutex</tt> meets the <tt>Lockable</tt> requirements ([thread.req.lockable.req]), <tt>unique_lock&lt;Mutex&gt;</tt> 
! also meets the <tt>Lockable</tt> requirements and if</ins> <tt>Mutex</tt> meets the <tt>TimedLockable</tt> 
! requirements (30.2.5.4), <tt>unique_lock&lt;Mutex&gt;</tt> also meets the <tt>TimedLockable</tt> 
! requirements. &mdash; <i>end note</i> ]
! </p></blockquote>
! 
! </li>
! 
! <li><p>Modify 30.4.2.2.1 [thread.lock.unique.cons] to add the now necessary member-wise
! additional constraints for <tt>Lockable</tt>:</p>
! 
! <blockquote><pre>
! unique_lock(mutex_type&amp; m, try_to_lock_t) noexcept;
! </pre><blockquote><p>
! 8 <i>Requires</i>: <ins>The supplied <tt>Mutex</tt> type shall meet the <tt>Lockable</tt> requirements ([thread.req.lockable.req]).</ins> 
! If <tt>mutex_type</tt> is not a recursive mutex the calling thread does not own the mutex.
! <p/>
! 9 <i>Effects</i>: Constructs an object of type <tt>unique_lock</tt> and calls <tt>m.try_lock()</tt>.
! </p></blockquote></blockquote>
! </li>
! 
! <li><p>Modify 30.4.2.2.2 [thread.lock.unique.locking] to add the now necessary member-wise
! additional constraints for <tt>Lockable</tt>:</p>
! 
! <blockquote><pre>
! bool try_lock();
! </pre><blockquote><p>
! <ins>? <i>Requires</i>: The supplied <tt>Mutex</tt> type shall meet the <tt>Lockable</tt> requirements ([thread.req.lockable.req]).</ins> 
! <p/>
! 4 <i>Effects</i>: <tt>pm-&gt;try_lock()</tt>
! </p></blockquote></blockquote>
! </li>
! </ol>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="2024"></a>2024. Inconsistent implementation requirements for <tt>atomic&lt;<i>integral</i>&gt;</tt> and <tt>atomic&lt;T*&gt;</tt></h3>
! <p><b>Section:</b> 29.5 [atomics.types.generic] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-12-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.types.generic">active issues</a> in [atomics.types.generic].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.types.generic">issues</a> in [atomics.types.generic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Paragraph 5 and 6 of 29.5 [atomics.types.generic] impose different requirements on implementations for
! specializations of the <tt>atomic</tt> class template for integral types and for pointer types:
! </p>
! <blockquote><p>
! 5 The atomic integral specializations and the specialization <tt>atomic&lt;bool&gt;</tt> shall have standard layout. 
! They shall each have a trivial default constructor and a trivial destructor. They shall each support aggregate
! initialization syntax.
! </p></blockquote>
! 
! <blockquote><p>
! 6 There are pointer partial specializations on the <tt>atomic</tt> class template. These specializations shall have 
! trivial default constructors and trivial destructors.
! </p></blockquote>
! 
! <p>
! It looks like an oversight to me, that for pointer specializations the requirements for standard layout and
! support for aggregate initialization syntax are omitted. In fact, this been confirmed by the 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3193.htm">N3193</a> proposal author. I suggest
! to impose the same implementation requirements for pointer types as for integral types, this should not impose 
! unrealistic requirements on implementations.
! </p>
! 
! <p><i>[2011-02-10 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p>
! 
! <blockquote class="note">
! <p>Proposed Resolution</p>
! <p>
! The suggested wording changes are against the working draft N3242.
! </p>
! 
! <ol>
! <li>
! <p>Change 29.5 [atomics.types.generic] p. 6 as indicated:</p>
! 
! <blockquote><p>
! 6 There are pointer partial specializations on the <tt>atomic</tt> class template. These specializations shall have 
! <ins>standard layout,</ins> trivial default constructors<ins>,</ins> and trivial destructors. <ins> They shall each 
! support aggregate initialization syntax.</ins>
! </p></blockquote>
! 
! </li>
! </ol>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="2025"></a>2025. Incorrect semantics of move assignment operator of <tt>packaged_task</tt></h3>
! <p><b>Section:</b> 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2010-12-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! According to 30.6.9.1 [futures.task.members] p. 7 bullet 2:
! </p>
! <blockquote><pre>
! packaged_task&amp; operator=(packaged_task&amp;&amp; other);
! </pre><blockquote><p>
! 7 <i>Effects</i>:<br/>
! </p>
! <ul>
! <li><p>[...]</p></li>
! <li><p><tt>packaged_task&lt;R, ArgTypes...&gt;(other).swap(*this)</tt>.</p></li>
! </ul>
! </blockquote></blockquote>
! <p>
! The argument <tt>other</tt> given to the move constructor is an lvalue and must be converted into 
! an rvalue via appropriate usage of <tt>std::move</tt>.
! </p>
! 
! <blockquote class="note">
! <p>Proposed Resolution</p>
! <p>
! The suggested wording changes are against the working draft N3242.
! </p>
! 
! <ol>
! <li>
! <p>Change  30.6.9.1 [futures.task.members] p. 7 bullet 2 as indicated:</p>
! 
! <blockquote><pre>
! packaged_task&amp; operator=(packaged_task&amp;&amp; other);
! </pre><blockquote><p>
! 7 <i>Effects</i>:<br/>
! </p>
! <ul>
! <li><p>[...]</p></li>
! <li><p><tt>packaged_task(<ins>std::move(</ins>other<ins>)</ins>).swap(*this)</tt>.</p></li>
! </ul>
! </blockquote></blockquote>
! 
! </li>
! </ol>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="2027"></a>2027. Initialization of the stored task of a <tt>packaged_task</tt></h3>
! <p><b>Section:</b> 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2011-02-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Related with LWG issue <a href="lwg-defects.html#1514">1514</a>.
! </p>
! 
! <p>
! The move constructor of <tt>packaged_task</tt> does not specify how the stored task is constructed. 
! The obvious way is to move-construct it using the task stored in the argument. Moreover, the 
! constructor should be provided with a throws clause similar to one used for the other constructors, 
! as the move constructor of the stored task is not required to be nothrow.</p>
! 
! <p>
! As for the other constructors, the terms "stores a copy of <tt>f</tt>" do not reflect the intent, which is 
! to allow <tt>f</tt> to be moved when possible.
! </p>
! 
! <p><i>[2011-02-25: Alberto updates wording]</i></p>
! 
! 
! <p><i>[2011-02-26 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>(wording written assuming LWG <a href="lwg-defects.html#1514">1514</a> is also accepted)</p>
! 
! <ol>
! <li>
! <p>Change 30.6.9.1 [futures.task.members] paragraph 3:</p>
! 
! <blockquote><p>
! 3 <em>Effects</em>: constructs a new <tt>packaged_task</tt> object with an associated asynchronous state and <del>stores a
! copy of <tt>f</tt> as the object's stored task</del><ins>initializes the object's stored task with <tt>std::forward&lt;F&gt;(f)</tt></ins>. 
! The constructors that take an <tt>Allocator</tt> argument use it to allocate memory needed to store the internal data structures.
! </p></blockquote>
! 
! </li>
! 
! <li>
! <p>Change 30.6.9.1 [futures.task.members] paragraph 5:</p>
! 
! <blockquote><p>
! 5 <em>Effects</em>: constructs a new <tt>packaged_task</tt> object and transfers ownership of <tt>other</tt>'s associated asynchronous
! state to <tt>*this</tt>, leaving <tt>other</tt> with no associated asynchronous state. <ins>Moves the stored task from <tt>other</tt> 
! to <tt>*this</tt>.</ins>
! </p></blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2028"></a>2028. <tt>messages_base::catalog</tt> overspecified</h3>
! <p><b>Section:</b> 22.4.7.1 [locale.messages] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2011-02-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 22.4.7.1 [locale.messages], <tt>messages_base::catalog</tt> is specified to be a typedef to <tt>int</tt>.  
! This type is subsequently used to open, access and close catalogs.
! </p>
! 
! <p>
! However, an OS may have catalog/messaging services that are indexed and managed by types other than <tt>int</tt>.  
! For example <tt>POSIX</tt>, publishes the <a href="http://www.unix.org/single_unix_specification/">following messaging API</a>:
! </p>
! 
! <blockquote><pre>
! typedef <em>unspecified</em> nl_catd;
! 
! nl_catd catopen(const char* name , int oflag);
! char*   catgets(nl_catd catd, int set_id, int msg_id, const char* s);
! int     catclose(nl_catd catd);
! </pre></blockquote>
! 
! <p>
! I.e., the catalog is managed with an unspecified type, not necessarily an <tt>int</tt>.  
! Mac OS uses a <tt>void*</tt> for <tt>nl_catd</tt> (which is conforming to the <tt>POSIX</tt> standard).  
! The current <tt>messages_base</tt> spec effectively outlaws using the built-in OS messaging service 
! supplied for this very purpose!
! </p>
! 
! <p><i>[2011-02-24: Chris Jefferson updates the proposed wording, changing <i>unspecified</i> to <i>unspecified signed integral type</i>]</i></p>
! 
! 
! <p><i>[2011-03-02: Daniel updates the proposed wording, changing <i>unspecified signed integral type</i> to
!  <i>unspecified signed integer type</i> (We don't want to allow for <tt>bool</tt> or <tt>char</tt>)]</i></p>
! 
!  
! <p><i>[2011-03-24 Madrid meeting]</i></p>
! 
! 
! <p>
! Consensus that this resolution is the direction we would like to see.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>Modify 22.4.7.1 [locale.messages]:</p>
! 
! <blockquote><pre>
! namespace std {
!   class messages_base {
!   public:
!     typedef <del>int</del><ins><em>unspecified signed integer type</em></ins> catalog;
!   };
!   ...
! }
! </pre></blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2029"></a>2029. Missing '<tt>noexcept</tt>' on <tt>basic_regex</tt> move-assignment operator</h3>
! <p><b>Section:</b> 28.8 [re.regex] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-02-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.regex">issues</a> in [re.regex].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3149.html">N3149</a> replaced 
! the "<tt>Throws: nothing</tt>" clause on <tt>basic_regex::assign(basic_regex&amp;&amp;)</tt> with 
! the <tt>noexcept</tt> keyword. The effects of the move-assignment operator are defined in terms of 
! the <tt>assign()</tt> function, so the "<tt>Throws: nothing</tt>" applied there too, and a
! <tt>noexcept</tt>-specification should be added there too.
! </p>
! 
! <p><i>[2011-02-24 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 7 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li>
! <p>Modify the <tt>basic_regex</tt> synopsis in 28.8 [re.regex] p. 3:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class charT,
!             class traits = regex_traits&lt;charT&gt; &gt;
!   class basic_regex {
!   public:
!     ...
!     basic_regex&amp; operator=(const basic_regex&amp;);
!     basic_regex&amp; operator=(basic_regex&amp;&amp;) <ins>noexcept</ins>;
!     basic_regex&amp; operator=(const charT* ptr);
!     ...
!   };
! }
! </pre></blockquote>
! 
! </li>
! 
! <li>
! <p>Modify 28.8.3 [re.regex.assign] p. 2:</p>
! 
! <blockquote><pre>
! basic_regex&amp; operator=(basic_regex&amp;&amp; e) <ins>noexcept</ins>;
! </pre>
! <blockquote><p>
! 2 <em>Effects</em>: returns <tt>assign(std::move(e))</tt>.
! </p></blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2030"></a>2030. <tt>packaged_task::result_type</tt> should be removed</h3>
! <p><b>Section:</b> 30.6.9 [futures.task] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2010-11-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task">issues</a> in [futures.task].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>packaged_task::operator()</tt> always returns <tt>void</tt>, regardless of the return
! type of the wrapped task. However, <tt>packaged_task::result_type</tt> is a
! typedef to the return type of the wrapped task. This is inconsistent
! with other uses of <tt>result_type</tt> in the standard, where it matches the
! return type of <tt>operator()</tt> (e.g. <tt>function</tt>, <tt>owner_less</tt>). This is confusing.
! </p>
! 
! <p>
! It also violates the TR1 <tt>result_of</tt> protocol, and thus makes
! <tt>packaged_task</tt> harder to use with anything that respects that protocol.
! </p>
! 
! <p>
! Finally, it is of little use anyway.
! </p>
! 
! <p><tt>packaged_task::result_type</tt> should therefore be removed.</p>
! 
! <p><i>[2011-02-24 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>Alter the class definition of <tt>packaged_task</tt> in 30.6.9 [futures.task] p. 2 as follows:</p>
! <blockquote><pre>
! template&lt;class R, class... ArgTypes&gt;
! class packaged_task&lt;R(ArgTypes...)&gt; {
! public:
!   <del>typedef R result_type;</del>
!   [...]
! };
! </pre></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2031"></a>2031. <tt>std::future&lt;&gt;::share()</tt> only applies to rvalues</h3>
! <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2011-02-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! As specified, <tt>future&lt;&gt;::share()</tt> has the signature
! </p>
! 
! <blockquote><pre>
! shared_future&lt;R&gt; share() &amp;&amp;;
! </pre></blockquote>
! 
! <p>
! This means that it can only be applied to rvalues. One of the key benefits of <tt>share()</tt> is 
! that it can be used with the new <tt>auto</tt> facility:
! </p>
! 
! <blockquote><pre>
! std::promise&lt;<em>some_long_winded_type_name</em>&gt; some_promise;
! auto f = some_promise.get_future(); // std::future
! auto sf = std::move(f).share();
! </pre></blockquote>
! 
! <p>
! <tt>share()</tt> is sufficiently explicit that the move should not be required. We should be able to write:
! </p>
! 
! <blockquote><pre>
! auto sf = f.share();
! </pre></blockquote>
! 
! <p><i>[2011-02-22 Reflector discussion]</i></p>
! 
! <p>
! Moved to Tentatively Ready after 5 votes.
! </p> 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>Alter the declaration of <tt>share()</tt> to remove the "&amp;&amp;" rvalue qualifier in 
! 30.6.6 [futures.unique_future] p. 3, and 30.6.6 [futures.unique_future] p. 11:</p>
! 
! <blockquote><pre>
! shared_future&lt;R&gt; share() <del>&amp;&amp;</del>;
! </pre></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2032"></a>2032. Incorrect synchronization clause of <tt>async</tt> function</h3>
! <p><b>Section:</b> 30.6.8 [futures.async] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2011-02-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Clause 30.6.8 [futures.async] has undergone significant rewording
! in Batavia. Due to co-presence of at least three different sources
! of modification there is a part where changes have overlapped
! (marked by an Editor's note), which should be reconciled. Moreover,
! I believe that a few non-overlapping sentences are now incorrect
! and should be fixed, so the problem cannot be handled editorially.
! (See c++std-lib-29667.)
! </p>
! 
! <p><i>[Adopted in Madrid, 2011-03]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p> 
! Edit 30.6.4 [futures.state], paragraph 3 as follows.
! </p>
! 
! <blockquote>
! <p>
! An <dfn>asynchronous return object</dfn>
! is an object that reads results from an associated asynchronous state.
! A <dfn>waiting function</dfn> of an asynchronous return object
! is one that potentially blocks
! to wait for the associated asynchronous state to be made ready.
! <ins>If a waiting function can return
! before the state is made ready because of a timeout (30.2.5),
! then it is a <dfn>timed waiting function</dfn>,
! otherwise it is a <dfn>non-timed waiting function</dfn>.</ins>
! </p>
! </blockquote>
! </li>
! 
! <li>
! <p>
! Edit within 30.6.8 [futures.async] paragraph 3 bullet 2 as follows.
! </p>
! 
! <blockquote>
! <p>
! <i>Effects:</i>
! [...]
! </p>
! <ul><li>if <code>policy &amp; launch::deferred</code> is non-zero &mdash; [...]
! The associated asynchronous state is not made ready
! until the function has completed.
! The first call to a <ins>non-timed waiting</ins> function
! <ins>(30.6.4 [futures.state])</ins>
! <del>requiring a non-timed wait</del>
! on an asynchronous return object
! referring to <del>the</del> <ins>this</ins>
! associated asynchronous state
! <del>created by this <code>async</code> call to become ready</del>
! shall invoke the deferred function
! in the thread that called the waiting function<del>;</del><ins>.</ins>
! <del>once</del> <ins>Once</ins> evaluation of
! <code><var>INVOKE</var>(g, xyz)</code> begins,
! the function is no longer considered deferred.
! [...]
! </li></ul>
! </blockquote>
! </li>
! 
! <li>
! <p>
! Edit 30.6.8 [futures.async] paragraph 5 as follows.
! </p>
! 
! <blockquote>
! <p>
! <i>Synchronization:</i>
! Regardless of the provided <code>policy</code> argument,
! </p>
! <ul>
! <li>
! the invocation of <code>async</code> synchronizes with (1.10)
! the invocation of <code>f</code>.
! [<i>Note:</i>
! this statement applies even when the corresponding future object
! is moved to another thread.
! &mdash;<i>end note</i>];
! and
! </li>
! <li>
! the completion of the function <code>f</code>
! is sequenced before (1.10) the associated asynchronous state is made ready.
! [<i>Note:</i>
! <code>f</code> might not be called at all,
! so its completion might never happen.
! &mdash;<i>end note</i>]
! </li>
! </ul>
! 
! <p>
! <del>If <code>policy &amp; launch::async</code> is non-zero,</del>
! <ins>If the implementation chooses the <code>launch::async</code> policy,</ins>
! </p>
! <ul>
! <li>
! a call to a waiting function on an asynchronous return object
! that shares the associated asynchronous state
! created by this <code>async</code> call
! shall block until the associated thread has completed,
! as if joined (30.3.1.5);
! </li>
! <li>
! <del>the <code>join()</code> on the created thread object</del>
! <ins>the associated thread completion</ins>
! synchronizes with (1.10)
! the return from the first function
! that successfully detects the ready status of the associated asynchronous state
! or with the return from the last function that 
! releases the associated asynchronous state <del>returns</del>,
! whichever happens first.
! <del><b>[Editor's note:
! N3196 changes the following sentence as indicated.
! N3188 removes the sentence.
! Please pick one.]</b>
! If the invocation is deferred,
! the completion of the invocation of the deferred function
! synchronizes with the successful return
! from a call to a waiting function on the associated asynchronous state.</del>
! </li>
! </ul>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2033"></a>2033. Preconditions of <tt>reserve</tt>, <tt>shrink_to_fit</tt>, and <tt>resize</tt> functions</h3>
! <p><b>Section:</b> 23.3.6.3 [vector.capacity], 23.3.3.3 [deque.capacity] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nikolay Ivchenkov <b>Opened:</b> 2011-02-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I have several questions with regard to the working paper N3225 (C++0x working draft):
! </p>
! <ol>
! <li><p>
! Where the working draft specifies preconditions for <tt>shrink_to_fit</tt>
! member function of <tt>std::vector</tt> and <tt>std::deque</tt>?
! </p></li>
! <li><p>
! Where the working draft specifies preconditions for '<tt>void reserve(size_type n)</tt>' 
! member function of <tt>std::vector</tt>?
! </p></li>
! <li><p>
! Does a call to '<tt>void resize(size_type sz)</tt>' of <tt>std::vector</tt> require
! the element type to be <tt>DefaultConstructible</tt>? If yes, why such
! requirement is not listed in the <i>Requires</i> paragraph?
! </p></li>
! <li><p>
! Does a call to '<tt>void resize(size_type sz)</tt>' of <tt>std::vector</tt> require
! the element type to be <tt>MoveAssignable</tt> because the call <tt>erase(begin() + sz, end())</tt> 
! mentioned in the <i>Effects</i> paragraph would require the element type to be <tt>MoveAssignable</tt>?
! </p></li>
! <li><p>
! Why <tt>CopyInsertable</tt> requirement is used for '<tt>void resize(size_type sz)</tt>' of <tt>std::vector</tt> 
! instead of <tt>MoveInsertable</tt> requirement?
! </p></li>
! </ol>
! 
! <p><i>[2011-06-12: Daniel comments and provides wording]</i></p>
! 
! <p>According to my understanding of the mental model of vector (and to some parts for deque) the 
! some requirements are missing in the standard as response to above questions:</p>
! <ol>
! <li>The preconditions of <tt>shrink_to_fit</tt> for both <tt>std::vector</tt> and <tt>std::deque</tt>
! should impose the <tt>MoveInsertable</tt> requirements. The reason for this is, that these containers
! can host move-only types. For a container type <tt>X</tt> the C++03 idiom <tt>X(*this).swap(*this)</tt>
! imposes the <tt>CopyInsertable</tt> requirements which would make the function call ill-formed,
! which looks like an unacceptable restriction to me. Assuming the committee decides to support the
! move-only case, further wording has to be added for the situation where such a move-only type could
! throw an exception, because this can leave the object in an unspecified state. This seems consistent
! with the requirements of <tt>reserve</tt>, which seems like a very similar function to me (for
! <tt>vector</tt>). And this brings us smoothly to the following bullet:
! </li>
! 
! <li><p>I agree that we are currently missing to specify the preconditions of the <tt>reserve</tt> function.
! My interpretation of the mental model of this function is that it should work for move-only types, which
! seems to be supported by the wording used in 23.3.6.3 [vector.capacity] p2:
! </p>
! <blockquote><p>
! [&hellip;] If an exception is thrown other than by the move constructor of a non-CopyInsertable type, 
! there are no effects.
! </p></blockquote>
! <p>
! Given this statement, the appropriate requirement is <tt>MoveInsertable</tt> into the <tt>vector</tt>.
! </p>
! </li>
! 
! <li>I agree that <tt>vector::resize(size_type)</tt> misses to list the <tt>DefaultConstructible</tt>
! requirements.
! </li>
! 
! <li>Unfortunately the current specification in terms of <tt>erase</tt> implies the <tt>MoveAssignable</tt>
! requirements. I don't think that this implication is intended. This function requires "append" and 
! "pop-back" effects, respectively, where the former can be realized in terms of <tt>MoveInsertable</tt> 
! requirements. The same fix in regard to using <tt>pop_back</tt> instead of <tt>erase</tt> is necessary 
! for the two argument overload of <tt>resize</tt> as well (no <tt>MoveAssignable</tt> is required).
! </li>
! 
! <li>The <tt>CopyInsertable</tt> requirement is incorrect and should be <tt>MoveInsertable</tt> instead.</li>
! </ol>
! 
! <p>In addition to above mentioned items, the proposed resolution adds a linear complexity bound for 
! <tt>shrink_to_fit</tt> and attempts to resolve the related issue <a href="lwg-defects.html#2066">2066</a>.</p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! Move to Ready.
! </p>
! 
! <p>
! Note for editor: we do not normally refer to 'linear <i>time</i>' for complexity requirements, but there
! is agreement that any clean-up of such wording is editorial.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Edit 23.3.3.3 [deque.capacity] as indicated [Remark: The suggested change of p4 is
! not redundant, because <tt>CopyInsertable</tt> is not necessarily a refinement of <tt>MoveInsertable</tt>
! in contrast to the fact that <tt>CopyConstructible</tt> is a refinement of <tt>MoveConstructible</tt>]:</p>
! 
! <blockquote><pre>
! void resize(size_type sz);
! </pre><blockquote><p>
! -1- <i>Effects</i>: If <tt>sz &lt;= size()</tt>, equivalent to <del><tt>erase(begin() + sz, 
! end());</tt></del><ins>calling <tt>pop_back()</tt> <tt>size() - sz</tt> times</ins>. If 
! <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> value-initialized elements to the sequence.
! <p/>
! -2- Requires: <tt>T</tt> shall be <ins><tt>MoveInsertable</tt> into <tt>*this</tt> and</ins> <tt>DefaultConstructible</tt>.
! </p></blockquote></blockquote>
! 
! <blockquote><pre>
! void resize(size_type sz, const T&amp; c);
! </pre><blockquote><p>
! -3- <i>Effects</i>: <ins>If <tt>sz &lt;= size()</tt>, equivalent to calling <tt>pop_back()</tt> 
! <tt>size() - sz</tt> times. If <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> copies of <tt>c</tt> 
! to the sequence.</ins>
! </p><blockquote><pre>
! <del>if (sz &gt; size())
!   insert(end(), sz-size(), c);
! else if (sz &lt; size())
!   erase(begin()+sz, end());
! else
!   ; <i>// do nothing</i></del>
! </pre></blockquote>
! <p>
! -4- <i>Requires</i>: <tt>T</tt> shall be <ins><tt>MoveInsertable</tt> into <tt>*this</tt> and</ins> 
! <tt>CopyInsertable</tt> into <tt>*this</tt>.
! </p></blockquote></blockquote>
! 
! <blockquote><pre>
! void shrink_to_fit();
! </pre><blockquote><p>
! <ins>-?- <i>Requires</i>: <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt>.</ins>
! <p/>
! <ins>-?- <i>Complexity</i>: Takes at most linear time in the size of the sequence.</ins>
! <p/>
! -5- <i>Remarks</i>: <tt>shrink_to_fit</tt> is a non-binding request to reduce memory use <ins>but does
! not change the size of the sequence</ins>. [ <i>Note</i>: The request is non-binding to allow latitude 
! for implementation-specific optimizations. &mdash; <i>end note</i> ]
! </p></blockquote></blockquote>
! </li>
! 
! <li><p>Edit 23.3.6.3 [vector.capacity] as indicated including edits that also resolve <a href="lwg-defects.html#2066">2066</a> 
! [Remark: The combined listing of <tt>MoveInsertable</tt> and <tt>CopyInsertable</tt> before p12 is not redundant, 
! because <tt>CopyInsertable</tt> is not necessarily a refinement of <tt>MoveInsertable</tt> in contrast to the 
! fact that <tt>CopyConstructible</tt> is a refinement of <tt>MoveConstructible</tt>]:</p>
! 
! <p>[&hellip;]</p>
! 
! <blockquote><pre>
! void reserve(size_type n);
! </pre><blockquote><p>
! <ins>-?- <i>Requires</i>: <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt>.</ins>
! <p/>
! -2- <i>Effects</i>: A directive that informs a vector of a planned change in size, so that it can manage the storage
! allocation accordingly. After <tt>reserve()</tt>, <tt>capacity()</tt> is greater or equal to the argument of reserve if
! reallocation happens; and equal to the previous value of <tt>capacity()</tt> otherwise. Reallocation happens
! at this point if and only if the current capacity is less than the argument of <tt>reserve()</tt>. If an exception
! is thrown other than by the move constructor of a non-<tt>CopyInsertable</tt> type, there are no effects.
! <p/>
! -3- <i>Complexity</i>: It does not change the size of the sequence and takes at most linear time in the size of
! the sequence.
! <p/>
! -4- <i>Throws</i>: <tt>length_error</tt> if <tt>n &gt; max_size()</tt>.[footnote 266]
! <p/>
! -5- <i>Remarks</i>: Reallocation invalidates all the references, pointers, and iterators referring to the elements
! in the sequence. It is guaranteed that no reallocation takes place during insertions that happen after
! a call to <tt>reserve()</tt> until the time when an insertion would make the size of the vector greater than
! the value of <tt>capacity()</tt>.
! </p></blockquote></blockquote>
! 
! <blockquote><pre>
! void shrink_to_fit();
! </pre><blockquote><p>
! <ins>-?- <i>Requires</i>: <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt>.</ins>
! <p/>
! <ins>-?- <i>Complexity</i>: Takes at most linear time in the size of the sequence.</ins>
! <p/>
! -6- <i>Remarks</i>: <tt>shrink_to_fit</tt> is a non-binding request to reduce <tt>capacity()</tt> to <tt>size()</tt>. 
! [ <i>Note</i>: The request is non-binding to allow latitude for implementation-specific optimizations. &mdash; <i>end note</i> ]
! <ins>If an exception is thrown other than by the move constructor of a non-<tt>CopyInsertable</tt> <tt>T</tt> there 
! are no effects.</ins>
! </p></blockquote></blockquote>
! 
! <p>[&hellip;]</p>
! 
! <blockquote><pre>
! void resize(size_type sz);
! </pre><blockquote><p>
! -9- <i>Effects</i>: If <tt>sz &lt;= size()</tt>, equivalent to <del><tt>erase(begin() + sz, end());</tt></del><ins>calling 
! <tt>pop_back()</tt> <tt>size() - sz</tt> times</ins>. If <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> 
! value-initialized elements to the sequence.
! <p/>
! -10- <i>Requires</i>: <tt>T</tt> shall be <tt><del>Copy</del><ins>Move</ins>Insertable</tt> into <tt>*this</tt> 
! <ins>and <tt>DefaultConstructible</tt></ins>.
! <p/>
! <ins>-??- <i>Remarks</i>: If an exception is thrown other than by the move constructor of a non-<tt>CopyInsertable</tt> 
! <tt>T</tt> there are no effects.</ins>
! </p></blockquote></blockquote>
! 
! <blockquote><pre>
! void resize(size_type sz, const T&amp; c);
! </pre><blockquote><p>
! -11- <i>Effects</i>: <ins>If <tt>sz &lt;= size()</tt>, equivalent to calling <tt>pop_back()</tt> 
! <tt>size() - sz</tt> times. If <tt>size() &lt; sz</tt>, appends <tt>sz - size()</tt> copies of <tt>c</tt> 
! to the sequence.</ins>
! </p><blockquote><pre>
! <del>if (sz &gt; size())
!   insert(end(), sz-size(), c);
! else if (sz &lt; size())
!   erase(begin()+sz, end());
! else
!   ; <i>// do nothing</i></del>
! </pre></blockquote><p>
! <ins>-??- <i>Requires</i>: <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt> and 
! <tt>CopyInsertable</tt> into <tt>*this</tt>.</ins>
! <p/>
! -12- <i><del>Requires</del><ins>Remarks</ins></i>: If an exception is thrown other than by the move constructor of a 
! non-<tt>CopyInsertable</tt> <tt>T</tt> there are no effects.
! </p></blockquote></blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2034"></a>2034. Initialization of atomics is misspecified so that it doesn't preserve sequential consistency</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2011-02-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.order">active issues</a> in [atomics.order].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! This violates the core intent of the memory model, as stated in the note in 1.10 [intro.multithread] p. 21.
! </p>
! 
! <p>
! This was discovered by Mark Batty, and pointed out in their POPL 2011 paper, "Mathematizing C++ Concurrency",
! section 4, "Sequential consistency of SC atomics".  The problem is quite technical, but well-explained in that paper.
! </p>
! 
! <p>
! This particular issue was not understood at the time the FCD comments were generated. But it is closely related 
! to a number of FCD comments. It should have arisen from 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3224.html#US171">US-171</a>, though that's not 
! the actual history.
! </p>
! 
! <p>This issue has been under discussion for several months in a group that included a half dozen or so of the 
! most interested committee members. The P/R represents a well-considered consensus among us:</p>
! 
! <p><i>[2011-03-16: Jens updates wording]</i></p>
! 
! 
! <blockquote class="note">
! <p>Modify 29.3 [atomics.order] p.3, so that the normative part reads:</p>
! 
! <blockquote><p>
! 3 There shall be a single total order <i>S</i> on all <tt>memory_order_seq_cst</tt> operations, consistent 
! with the &quot;happens before&quot; order and modification orders for all affected locations, such that each 
! <tt>memory_order_seq_cst</tt> operation that loads a value observes either the last 
! preceding modification according to this order <i>S</i><ins>, <i>A</i> (if any)</ins>, or the result of an operation 
! <ins><i>X</i></ins> that <del>is not</del><ins>does not happen before <i>A</i> and that is not</ins> <tt>memory_order_seq_cst</tt>. 
! [ <i>Note</i>: Although it is not explicitly required that <i>S</i> include locks, it can always be extended 
! to an order that does include lock and unlock operations, since the ordering between those is already included 
! in the &quot;happens before&quot; ordering. &mdash; <i>end note</i> ]
! </p></blockquote>
! 
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="2037"></a>2037. <tt>atomic</tt> free functions incorrectly specified</h3>
! <p><b>Section:</b> 29.2 [atomics.syn] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2011-03-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.syn">issues</a> in [atomics.syn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>In earlier specifications of atomics the template specialization <tt>atomic&lt;<i>integer</i>&gt;</tt> 
! was derived from <tt>atomic_integer</tt> (e.g. <tt>atomic&lt;int&gt;</tt> was derived from <tt>atomic_int</tt>), 
! and the working draft required free functions such as</p>
! 
! <blockquote><pre>
! int atomic_load(const atomic_int*)
! </pre></blockquote>
! 
! <p>for each of the <tt>atomic_integer</tt> types. This worked fine with normal function overloading.</p>
! 
! <p>For the post-Batavia working draft, N3193 removed the requirement that <tt>atomic&lt;integer&gt;</tt> 
! be derived from <tt>atomic_integer</tt> and replaced the free functions taking pointers to 
! <tt>atomic_integer</tt> with template functions taking <tt>atomic_type*</tt>, such as</p>
! 
! <blockquote><pre>
! template &lt;class T&gt; T atomic_load(const atomic_type*);
! </pre></blockquote>
! 
! <p>and a code comment explaining that <tt>atomic_type</tt> can be either <tt>atomic&lt;T&gt;</tt> or a 
! named base class of <tt>atomic&lt;T&gt;</tt>. The latter possibility is supposed to allow existing 
! implementations based on the previous specification to continue to conform.</p>
! 
! <p>From history, this allowance seems to imply that functions like <tt>atomic_load</tt> can be non-template 
! free functions, as they were before. The explicit requirements do not allow this, and, by requiring that 
! they be templates, make them far more complicated. As the specification is currently written, code that 
! uses an implementation that uses a base class would have to provide an explicit template type:</p>
! 
! <blockquote><pre>
! atomic&lt;int&gt; my_atomic_int;
! atomic_load&lt;int&gt;(&amp;my_atomic_int);
! </pre></blockquote>
! 
! <p>That type argument isn't needed when <tt>atomic_type</tt> is <tt>atomic&lt;T&gt;</tt>, but cautious 
! users would always provide it to make their code portable across different implementations of the 
! standard library.</p>
! 
! <p>One possibility for the implementor would be to do some template meta-programming to infer the type 
! <tt>T</tt> when there are no function parameters of type <tt>T</tt>, but without running afoul of the 
! prohibition on adding parameters with default values (17.6.5.4 [global.functions]/3).</p>
! 
! <p>So the promise that implementations of the previous specification continue to conform has not been 
! met. The specification of these free functions should be rewritten to support library code written to 
! the previous specification or the vacuous promise should be removed.
! </p>
! 
! <p><i>[2011-03-08: Lawrence comments and drafts wording:]</i></p>
! 
! 
! <p>One of the goals is to permit atomics code to compile under both C and C++. Adding explicit 
! template arguments would defeat that goal.
! <p/>
! The intent was to permit the normal function overloads for <tt>atomic_int</tt> when <tt>atomic_int</tt> 
! is distinct from <tt>atomic&lt;int&gt;</tt>. That intent was not reflected in the wording.
! </p>
! 
! <blockquote class="note">
! <p>Proposed Resolution</p>
! <p>Explicitly permit free functions.</p>
! 
! <ol>
! <li>
! <p>Edit within the header <tt>&lt;atomic&gt;</tt> synopsis 29.2 [atomics.syn] as follows:</p>
! 
! <blockquote><pre>
! <i>// 29.6.1, general operations on atomic types</i>
! <del><i>// In the following declarations, <em>atomic_type</em> is either</i>
! <i>// </i><code>atomic&lt;T&gt;</code><i> or a named base class for</i> <code>T</code><i> from</i>
! <i>// Table 145 or inferred from</i>
! <i>// Table 146.</i></del>
! <ins><i>// In the following declarations, <em>atomic-type</em> is either</i> 
! <i>// </i><code>atomic&lt;T&gt;</code><i> or a named base class for</i> <code>T</code><i> from</i>
! <i>// Table 145 or inferred from</i>
! <i>// Table 146.</i>
! <i>// If it is </i><code>atomic&lt;T&gt;</code><i>, then the declaration is a template
! // declaration prefixed with</i> <code>template &lt;class T&gt;</code></ins>
! <del>template &lt;class T&gt;</del>
! bool atomic_is_lock_free(const volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*);
! <del>template &lt;class T&gt;</del>
! bool atomic_is_lock_free(const <em><del>atomic_type</del><ins>atomic-type</ins></em>*);
! <del>template &lt;class T&gt;</del>
! void atomic_init(volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, T);
! <del>template &lt;class T&gt;</del>
! void atomic_init(<em><del>atomic_type</del><ins>atomic-type</ins></em>*, T);
! <del>template &lt;class T&gt;</del>
! void atomic_store(volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, T);
! <del>template &lt;class T&gt;</del>
! void atomic_store(<em><del>atomic_type</del><ins>atomic-type</ins></em>*, T);
! <del>template &lt;class T&gt;</del>
! void atomic_store_explicit(volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, T, memory_order);
! <del>template &lt;class T&gt;</del>
! void atomic_store_explicit(<em><del>atomic_type</del><ins>atomic-type</ins></em>*, T, memory_order);
! <del>template &lt;class T&gt;</del>
! T atomic_load(const volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*);
! <del>template &lt;class T&gt;</del>
! T atomic_load(const <em><del>atomic_type</del><ins>atomic-type</ins></em>*);
! <del>template &lt;class T&gt;</del>
! T atomic_load_explicit(const volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, memory_order);
! <del>template &lt;class T&gt;</del>
! T atomic_load_explicit(const <em><del>atomic_type</del><ins>atomic-type</ins></em>*, memory_order);
! <del>template &lt;class T&gt;</del>
! T atomic_exchange(volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, T);
! <del>template &lt;class T&gt;</del>
! T atomic_exchange(<em><del>atomic_type</del><ins>atomic-type</ins></em>*, T);
! <del>template &lt;class T&gt;</del>
! T atomic_exchange_explicit(volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, T, memory_order);
! <del>template &lt;class T&gt;</del>
! T atomic_exchange_explicit(<em><del>atomic_type</del><ins>atomic-type</ins></em>*, T, memory_order);
! <del>template &lt;class T&gt;</del>
! bool atomic_compare_exchange_weak(volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, T*, T);
! <del>template &lt;class T&gt;</del>
! bool atomic_compare_exchange_weak(<em><del>atomic_type</del><ins>atomic-type</ins></em>*, T*, T);
! <del>template &lt;class T&gt;</del>
! bool atomic_compare_exchange_strong(volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, T*, T);
! <del>template &lt;class T&gt;</del>
! bool atomic_compare_exchange_strong(<em><del>atomic_type</del><ins>atomic-type</ins></em>*, T*, T);
! <del>template &lt;class T&gt;</del>
! bool atomic_compare_exchange_weak_explicit(volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, T*, T,
!   memory_order, memory_order);
! <del>template &lt;class T&gt;</del>
! bool atomic_compare_exchange_weak_explicit(<em><del>atomic_type</del><ins>atomic-type</ins></em>*, T*, T.
!   memory_order, memory_order);
! <del>template &lt;class T&gt;</del>
! bool atomic_compare)exchange_strong_explicit(volatile <em><del>atomic_type</del><ins>atomic-type</ins></em>*, T*, T,
!   memory_order, memory_order);
! <del>template &lt;class T&gt;</del>
! bool atomic_compare_exchange_strong_explicit(<em><del>atomic_type</del><ins>atomic-type</ins></em>*, T*, T,
!   memory_order, memory_order);
!   
! <i>// 29.6.2, templated operations on atomic types</i>
! <del><i>// In the following declarations, <em>atomic_type</em> is either
! // </i><code>atomic&lt;T&gt;</code><i> or a named base class for</i> <code>T</code><i> from
! // Table 145 or inferred from
! // Table 146.</i></del>
! template &lt;class T&gt;
! T atomic_fetch_add(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_add(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_add_explicit(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! template &lt;class T&gt;
! T atomic_fetch_add_explicit(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! template &lt;class T&gt;
! T atomic_fetch_sub(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_sub(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_sub_explicit(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! template &lt;class T&gt;
! T atomic_fetch_sub_explicit(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! template &lt;class T&gt;
! T atomic_fetch_and(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_and(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_and_explicit(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! template &lt;class T&gt;
! T atomic_fetch_and_explicit(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! template &lt;class T&gt;
! T atomic_fetch_or(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_or(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_or_explicit(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! template &lt;class T&gt;
! T atomic_fetch_or_explicit(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! template &lt;class T&gt;
! T atomic_fetch_xor(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_xor(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T);
! template &lt;class T&gt;
! T atomic_fetch_xor_explicit(volatile <del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! template &lt;class T&gt;
! T atomic_fetch_xor_explicit(<del><em>atomic-type</em></del><ins>atomic&lt;T&gt;</ins>*, T, memory_order);
! 
! <i>// 29.6.3, arithmetic operations on atomic types</i>
! <ins><i>// In the following declarations, <em>atomic-integral</em> is either 
! // </i><code>atomic&lt;T&gt;</code> <i>or a named base class for</i> <code>T</code> <i>from 
! // Table 145 or inferred from 
! // Table 146.
! // If it is</i> <code>atomic&lt;T&gt;</code><i>,
! // then the declaration is a template specialization declaration prefixed with
! //</i> <code>template &lt;&gt;</code></ins>
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_add(volatile <em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_add(<em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_add_explicit(volatile <em>atomic-integral</em>*, <em>integral</em>, memory_order);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_add_explicit(<em>atomic-integral</em>*, <em>integral</em>, memory_order);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_sub(volatile <em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_sub(<em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_sub_explicit(volatile <em>atomic-integral</em>*, <em>integral</em>, memory_order);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_sub_explicit(<em>atomic-integral</em>*, <em>integral</em>, memory_order);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_and(volatile <em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_and(<em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_and_explicit(volatile <em>atomic-integral</em>*, <em>integral</em>, memory_order);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_and_explicit(<em>atomic-integral</em>*, <em>integral</em>, memory_order);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_or(volatile <em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_or(<em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_or_explicit(<em>atomic-integral</em>*, <em>integral</em>, memory_order);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_or_explicit(<em>atomic-integral</em>*, <em>integral</em>, memory_order);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_xor(volatile <em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_xor(<em>atomic-integral</em>*, <em>integral</em>);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_xor_explicit(volatile <em>atomic-integral</em>*, <em>integral</em>, memory_order);
! <del>template &lt;&gt;</del>
! <em>integral</em> atomic_fetch_xor_explicit(<em>atomic-integral</em>*, <em>integral</em>, memory_order);
! </pre></blockquote>
! </li>
! 
! <li><p>Edit 29.6.1 [atomics.types.operations.general] paragraph 1+2 as follows:</p>
! 
! <blockquote><p>
! -1- The implementation shall provide the <ins>functions and</ins> function templates identified as 
! &quot;general operations on atomic types&quot; in 29.2 [atomics.syn].
! <p/>
! -2- In the declarations of these <ins>functions and function</ins> templates, the name <em>atomic-type</em> 
! refers to either <tt>atomic&lt;T&gt;</tt> or to a named base class for <tt>T</tt> from Table 145 or 
! inferred from Table 146.
! </p>
! </blockquote>
! </li>
! 
! <li><p>In 29.6.2 [atomics.types.operations.templ] delete paragraph 2:</p>
! 
! <blockquote><p>
! -1- The implementation shall declare but not define the function templates identified as 
! &quot;templated operations on atomic types&quot; in 29.2 [atomics.syn].
! <p/>
! <del>-2- In the declarations of these templates, the name <em>atomic-type</em> refers to either 
! <tt>atomic&lt;T&gt;</tt> or to a named base class for <tt>T</tt> from Table 145 or 
! inferred from Table 146.</del>
! </p>
! </blockquote>
! </li>
! 
! <li><p>Edit 29.6.3 [atomics.types.operations.arith] paragraph 1+2 as follows:</p>
! 
! <blockquote><p>
! -1- The implementation shall provide the <ins>functions and</ins> function template 
! specializations identified as &quot;arithmetic operations on atomic types&quot; in 
! 29.2 [atomics.syn].
! <p/>
! -2- In the declarations of these <ins>functions and function</ins> template specialization<ins>s</ins>, 
! the name <em>integral</em> refers to an integral type and the name <em>atomic-integral</em> 
! refers to either <tt>atomic&lt;</tt><em>integral</em><tt>&gt;</tt> or to a named base class for 
! <em>integral</em> from Table 145 or inferred from Table 146.
! </p>
! </blockquote>
! </li>
! 
! </ol>
! </blockquote>
! 
! 
! <p><b>Proposed resolution:</b></p><p>
! Resolved 2011-03 Madrid meeting by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3278">N3278</a>
! </p>
! 
! 
! 
! 
! <hr>
! <h3><a name="2039"></a>2039. Issues with <tt>std::reverse</tt> and <tt>std::copy_if</tt></h3>
! <p><b>Section:</b> 25.3.1 [alg.copy], 25.3.10 [alg.reverse] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nikolay Ivchenkov <b>Opened:</b> 2011-03-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#alg.copy">active issues</a> in [alg.copy].</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.copy">issues</a> in [alg.copy].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <ol>
! <li><p>In the description of <tt>std::reverse</tt></p>
! <blockquote><p>
! <i>Effects</i>: For each non-negative integer <tt>i &lt;= (last - first)/2</tt>, applies <tt>iter_swap</tt> 
! to all pairs of iterators <tt>first + i</tt>, <tt>(last - i) - 1</tt>.
! </p></blockquote>
! <p>
! should be changed to
! </p><blockquote><p>
! <i>Effects</i>: For each non-negative integer <tt>i <strong>&lt;</strong> (last - first)/2</tt>, applies <tt>iter_swap</tt> 
! to all pairs of iterators <tt>first + i</tt>, <tt>(last - i) - 1</tt>.
! </p></blockquote><p>
! Here <tt>i</tt> shall be strictly less than <tt>(last - first)/2</tt>.
! </p>
! </li>
! <li><p>In the description of <tt>std::copy_if</tt> <i>Returns</i> paragraph is missing.</p></li>
! </ol>
! 
! <p><i>[2011-03-02: Daniel drafts wording]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>Modify 25.3.10 [alg.reverse] p. 1 as indicated:</p>
! 
! <blockquote><p>
! 1 <i>Effects</i>: For each non-negative integer <tt>i &lt;<del>=</del> (last - first)/2</tt>, applies <tt>iter_swap</tt> 
! to all pairs of iterators <tt>first + i</tt>, <tt>(last - i) - 1</tt>.
! </p></blockquote>
! </li>
! 
! <li><p>Add the following <i>Returns</i> element after 25.3.1 [alg.copy] p. 9:</p>
! 
! <blockquote><pre>
! template&lt;class InputIterator, class OutputIterator, class Predicate&gt;
! OutputIterator copy_if(InputIterator first, InputIterator last,
!    OutputIterator result, Predicate pred);
! </pre><blockquote><p>
! 8 <i>Requires</i>: The ranges <tt>[first,last)</tt> and <tt>[result,result + (last - first))</tt> shall not overlap.
! <p/>
! 9 <i>Effects</i>: Copies all of the elements referred to by the iterator <tt>i</tt> in the range <tt>[first,last)</tt> 
! for which <tt>pred(*i)</tt> is true.
! <p/>
! <ins>?? <i>Returns</i>: The end of the resulting range.</ins>
! <p/>
! 10 <i>Complexity</i>: Exactly <tt>last - first</tt> applications of the corresponding predicate.
! <p/>
! 11 <i>Remarks</i>: Stable.
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2041"></a>2041. Stage 2 accumulate incompatibilty</h3>
! <p><b>Section:</b> 22.4.2.1.2 [facet.num.get.virtuals] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2011-03-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#facet.num.get.virtuals">active issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.get.virtuals">issues</a> in [facet.num.get.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><tt>num_get</tt> Stage 2 accumulation changed between C++03 and the current C++0x working draft. The sentences:</p>
! 
! <blockquote><p>
! If it is not discarded, then a check is made to determine if <tt>c</tt> is allowed as the
! next character of an input field of the conversion specifier returned by stage 1.
! If so it is accumulated.
! </p></blockquote>
! 
! <p>have been dropped from 22.4.2.1.2 [facet.num.get.virtuals], Stage 2, paragraph 3 that begins:</p>
! 
! <blockquote><p>
! If <tt>discard</tt> is true, [&hellip;]
! </p></blockquote>
! 
! <p>Consider this code:</p>
! 
! <blockquote><pre>
! #include &lt;sstream&gt;
! #include &lt;iostream&gt;
! 
! int main(void)
! {
!    std::istringstream s("8cz");
!    long i = 0;
!    char c;
!    s &gt;&gt; i;
!    if (!s.fail())
!        std::cout &lt;&lt; "i = " &lt;&lt; i &lt;&lt; '\n';
!    else
!    {
!        std::cout &lt;&lt; "s &gt;&gt; i failed\n";
!        s.clear();
!    }
!    s &gt;&gt; c;
!    if (!s.fail())
!        std::cout &lt;&lt; "c = " &lt;&lt; c &lt;&lt; '\n';
!    else
!        std::cout &lt;&lt; "s &gt;&gt; c failed\n";
! }
! </pre></blockquote>
! 
! <p>C++0x currently prints out:</p>
! 
! <blockquote><pre>
! s &gt;&gt; i failed
! c = z
! </pre></blockquote>
! 
! <p>However C++03 conforming implementations will output:</p>
! 
! <blockquote><pre>
! i = 8
! c = c
! </pre></blockquote>
! 
! <p>I believe we need to restore C++03 compatibility.</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>Add to 22.4.2.1.2 [facet.num.get.virtuals], Stage 2:</p>
! 
! <blockquote><p>
! If <tt>discard</tt> is true, then if <tt>'.'</tt> has not yet been accumulated, then the position of the character
! is remembered, but the character is otherwise ignored. Otherwise, if <tt>'.'</tt> has already been
! accumulated, the character is discarded and Stage 2 terminates. <ins>If it is not discarded, then a 
! check is made to determine if <tt>c</tt> is allowed as the next character of an input field of the 
! conversion specifier returned by stage 1. If so it is accumulated.</ins>
! <p/>
! If the character is either discarded or accumulated then in is advanced by <tt>++in</tt> and processing
! returns to the beginning of stage 2.
! </p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2042"></a>2042. Comparing <tt>forward_list::before_begin()</tt> to <tt>forward_list::end()</tt></h3>
! <p><b>Section:</b> 23.3.4.3 [forwardlist.iter] <b>Status:</b> <a href="lwg-active.html#C++11">C++11</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2011-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++11">C++11</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>For an object <tt>c</tt> of type <tt>forward_list&lt;X, Alloc&gt;</tt>, the iterators
! <tt>c.before_begin()</tt> and <tt>c.end()</tt> are part of the same underlying sequence,
! so the expression <tt>c.before_begin() == c.end()</tt>  must be well-defined.
! But the standard says nothing about what the result of this expression
! should be.  The forward iterator requirements says no dereferenceable
! iterator is equal to a non-dereferenceable iterator and that two
! dereferenceable iterators are equal if and only if they point to the
! same element.  But since <tt>before_begin()</tt> and <tt>end()</tt> are both
! non-dereferenceable, neither of these rules applies.
! </p>
! 
! <p>
! Many <tt>forward_list</tt> methods, such as <tt>insert_after()</tt>, have a
! precondition that the iterator passed to them must not be equal to
! <tt>end()</tt>. Thus, user code might look like the following:
! </p>
! <blockquote><pre>
! void foo(forward_list&lt;int&gt;&amp; c, forward_list&lt;int&gt;::iterator it)
! {
!   assert(it != c.end());
!   c.insert_after(it, 42);
! }
! </pre></blockquote>
! 
! <p>
! Conversely, <tt>before_begin()</tt> was specifically designed to be used with
! methods like <tt>insert_after()</tt>, so if <tt>c.before_begin()</tt> is passed to 
! this function the assertion must not fail.
! </p>
! 
! <p><i>[2011-03-14: Daniel comments and updates the suggested wording]</i></p>
! 
! 
! <p>The suggested wording changes are necessary but not sufficient. Since there
! does not exist an equivalent semantic definition of <tt>cbefore_begin()</tt> as
! we have for <tt>cbegin()</tt>, this still leaves the question open whether
! the normative remark applies to <tt>cbefore_begin()</tt> as well. A simple fix
! is to define the operational semantics of <tt>cbefore_begin()</tt> in terms of
! <tt>before_begin()</tt>.</p>
! 
! <p><i>[2011-03-24 Madrid meeting]</i></p>
! 
! 
! <p>
! General agreement that this is a serious bug.
! <p/>
! Pablo: Any objections to moving 2042 to Immediate?
! <p/>
! No objections. 
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>Add to the definition of <tt>forward_list::before_begin()</tt> 23.3.4.3 [forwardlist.iter] 
! the following:</p>
! 
! <blockquote><pre>
! iterator before_begin();
! const_iterator before_begin() const;
! const_iterator cbefore_begin() const;
! </pre><blockquote><p>
! -1- <i>Returns</i>: A non-dereferenceable iterator that, when incremented, is equal to the iterator returned by <tt>begin()</tt>.
! <p/>
! <ins>-?- <i>Effects</i>: <tt>cbefore_begin()</tt> is equivalent to <tt>const_cast&lt;forward_list const&amp;>(*this).before_begin()</tt>.</ins>
! <p/>
! <ins>-?- <i>Remarks</i>: <tt>before_begin() == end()</tt> shall equal false.</ins>
! </p></blockquote></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2044"></a>2044. No definition of "Stable" for copy algorithms</h3>
! <p><b>Section:</b> 17.6.5.7 [algorithm.stable] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2011-03-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 17.6.5.7 [algorithm.stable] specified the meaning of "stable" when applied to 
! the different types of algorithms. The second bullet says:
! </p>
! <blockquote><p>
! &mdash; For the <i>remove</i> algorithms the relative order of the elements that are not removed is preserved.
! </p></blockquote>
! 
! <p>
! There is no description of what "stable" means for copy algorithms, even though the term is 
! applied to <tt>copy_if</tt> (and perhaps others now or in the future). Thus, <tt>copy_if</tt> 
! is using the term without a precise definition.
! </p>
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>In 17.6.5.7 [algorithm.stable] p. 1 change as indicated:</p>
! 
! <blockquote><p>
! When the requirements for an algorithm state that it is “stable” without further elaboration, it means:
! </p>
! <ul>
! <li>For the <i>sort</i> algorithms the relative order of equivalent elements is preserved.</li>
! <li>For the <i>remove</i> <ins>and <i>copy</i></ins> algorithms the relative order of the elements that are 
! not removed is preserved.</li>
! <li>For the <i>merge</i> algorithms, for equivalent elements in the original two ranges, the elements from the
! first range precede the elements from the second range.</li>
! </ul>
! </blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2045"></a>2045. <tt>forward_list::merge</tt> and <tt>forward_list::splice_after</tt> with unequal allocators</h3>
! <p><b>Section:</b> 23.3.4.6 [forwardlist.ops] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2011-03-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! See also: <a href="lwg-defects.html#1215">1215</a>
! </p>
! 
! <p>
! <tt>list::merge</tt> and <tt>list::splice</tt> have the requirement that the two lists being merged or 
! spliced must use the same allocator. Otherwise, moving list nodes from one container to the other would 
! corrupt the data structure. The same requirement is needed for <tt>forward_list::merge</tt> and 
! <tt>forward_list::splice_after</tt>.
! </p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! Move to Ready.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>In 23.3.4.6 [forwardlist.ops] p. 1 change as indicated:</p>
! 
! <blockquote><pre>
! void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp; x);
! void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp;&amp; x);
! </pre><p>
! 1 - <i>Requires</i>: <tt>position</tt> is <tt>before_begin()</tt> or is a dereferenceable 
! iterator in the range [<tt>begin()</tt>,<tt>end()</tt>). <ins><tt>get_allocator() == x.get_allocator()</tt>.</ins> 
! <tt>&amp;x != this</tt>.
! </p></blockquote>
! 
! </li>
! 
! <li><p>In 23.3.4.6 [forwardlist.ops] p. 5 change as indicated:</p>
! 
! <blockquote><pre>
! void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp; x, const_iterator i);
! void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp;&amp; x, const_iterator i);
! </pre><p>
! 5 - <i>Requires</i>: <tt>position</tt> is <tt>before_begin()</tt> or is a dereferenceable 
! iterator in the range [<tt>begin()</tt>,<tt>end()</tt>). The iterator following <tt>i</tt> is a 
! dereferenceable iterator in <tt>x</tt>. <ins><tt>get_allocator() == x.get_allocator()</tt>.</ins>
! </p></blockquote>
! 
! </li>
! 
! <li><p>In 23.3.4.6 [forwardlist.ops] p. 9 change as indicated:</p>
! 
! <blockquote><pre>
! void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp; x, 
!                   const_iterator first, const_iterator last);
! void splice_after(const_iterator position, forward_list&lt;T,Allocator&gt;&amp;&amp; x, 
!                   const_iterator first, const_iterator last);
! </pre><p>
! 9 - <i>Requires</i>: <tt>position</tt> is <tt>before_begin()</tt> or is a dereferenceable 
! iterator in the range [<tt>begin()</tt>,<tt>end()</tt>). (<tt>first</tt>,<tt>last</tt>) is a valid range 
! in <tt>x</tt>, and all iterators in the range (<tt>first</tt>,<tt>last</tt>) are dereferenceable.
! <tt>position</tt> is not an iterator in the range (<tt>first</tt>,<tt>last</tt>). 
! <ins><tt>get_allocator() == x.get_allocator()</tt>.</ins>
! </p></blockquote>
! 
! </li>
! 
! <li><p>In 23.3.4.6 [forwardlist.ops] p. 18 change as indicated:</p>
! 
! <blockquote><pre>
! void merge(forward_list&lt;T,Allocator&gt;&amp; x);
! void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x);
! template &lt;class Compare&gt; void merge(forward_list&lt;T,Allocator&gt;&amp; x, Compare comp);
! template &lt;class Compare&gt; void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);
! </pre><p>
! 18 - <i>Requires</i>: <tt>comp</tt> defines a strict weak ordering ([alg.sorting]), and <tt>*this</tt> 
! and <tt>x</tt> are both sorted according to this ordering. <ins><tt>get_allocator() == x.get_allocator()</tt>.</ins>
! </p></blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2047"></a>2047. Incorrect "mixed" move-assignment semantics of <tt>unique_ptr</tt></h3>
! <p><b>Section:</b> 20.8.1.2.3 [unique.ptr.single.asgn] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-04-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.asgn">issues</a> in [unique.ptr.single.asgn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>The semantics described in 20.8.1.2.3 [unique.ptr.single.asgn] p. 6</p>
! <blockquote><p>
! <i>Effects</i>: Transfers ownership from <tt>u</tt> to <tt>*this</tt> as if [&hellip;] followed 
! by an assignment from <tt>std::forward&lt;D&gt;(u.get_deleter())</tt>.
! </p></blockquote>
! <p>
! contradicts to the pre-conditions described in p. 4:
! </p>
! <blockquote><p>
! <i>Requires</i>: If E is not a reference type, assignment of the deleter from an rvalue of type <tt>E</tt> shall be
! well-formed and shall not throw an exception. Otherwise, <tt>E</tt> is a reference type and assignment of the
! deleter from an lvalue of type <tt>E</tt> shall be well-formed and shall not throw an exception.
! </p></blockquote>
! <p>
! Either the pre-conditions are incorrect or the semantics should be an assignment from
! <tt>std::forward&lt;<span style="color:red;font-weight:bolder">E</span>&gt;(u.get_deleter())</tt>, instead.
! </p>
! <p>It turns out that this contradiction is due to an incorrect transcription from the proposed
! resolution of <a href="lwg-defects.html#983">983</a> to the finally accepted proposal 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3073.html">n3073</a> (see
! bullet 12) as confirmed by Howard Hinnant, thus the type argument provided to <tt>std::forward</tt>
! must be fixed as indicated.
! </p>
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Edit 20.8.1.2.3 [unique.ptr.single.asgn] p. 6 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u) noexcept;
! </pre><blockquote><p>
! 4 - <i>Requires</i>: If <tt>E</tt> is not a reference type, assignment of the deleter from an rvalue 
! of type <tt>E</tt> shall be well-formed and shall not throw an exception. Otherwise, <tt>E</tt> is a 
! reference type and assignment of the deleter from an lvalue of type <tt>E</tt> shall be well-formed and 
! shall not throw an exception.
! <p/>
! 5 - <i>Remarks</i>: This operator shall not participate in overload resolution unless:</p>
! <ul>
! <li><tt>unique_ptr&lt;U, E&gt;::pointer</tt> is implicitly convertible to <tt>pointer</tt> and</li>
! <li><tt>U</tt> is not an array type.</li>
! </ul>
! <p>
! 6 - <i>Effects</i>: Transfers ownership from <tt>u</tt> to <tt>*this</tt> as if by calling 
! <tt>reset(u.release())</tt> followed by an assignment from <tt>std::forward&lt;<del>D</del><ins>E</ins>&gt;(u.get_deleter())</tt>.
! <p/>
! 7 - <i>Returns</i>: <tt>*this</tt>.
! </p>
! </blockquote>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2048"></a>2048. Unnecessary <tt>mem_fn</tt> overloads</h3>
! <p><b>Section:</b> 20.9 [function.objects], 20.9.11 [func.memfn] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-04-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The <tt>mem_fn</tt> overloads for member functions are redundant and misleading
! and should be removed from the post-C++11 WP.
! <p/>
! I believe the history of the overloads is as follows:
! <p/>
! In TR1 and in C++0x prior to the N2798 draft, <tt>mem_fn</tt> was specified by
! a single signature:
! </p>
! <blockquote><pre>
! template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::* pm);
! </pre></blockquote>
! <p>
! and was accompanied by the remark "Implementations may implement <tt>mem_fn</tt> 
! as a set of overloaded function templates." This remark predates variadic templates 
! and was presumably to allow implementations to provide overloads for a limited 
! number of function parameters, to meet the implementation-defined limit on numbers of
! template parameters.
! <p/>
! N2770 "Concepts for the C++0x Standard Library: Utilities" added
! separate overloads for pointers to member functions, apparently so
! that function parameters would require the <tt>CopyConstructible</tt> concept
! (those overloads first appeared in N2322.) The overloads failed to
! account for varargs member functions (i.e. those declared with an
! ellipsis in the parameter-declaration-clause) e.g.
! </p>
! <blockquote><pre>
! struct S {
!  int f(int, ...);
! };
! </pre></blockquote>
! <p>
! Syntactically such a function would be handled by the original
! <tt>mem_fn(R T::* pm)</tt> signature, the only minor drawback being that there
! would be no <tt>CopyConstructible</tt> requirement on the parameter list. (Core
! DR 547 clarifies that partial specializations can be written to match
! cv-qualified and ref-qualified functions to support the case where <tt>R T::*</tt> 
! matches a pointer to member function type.)
! <p/>
! LWG issue <a href="lwg-defects.html#920">920</a> pointed out that additional overloads were missing for
! member functions with ref-qualifiers. These were not strictly
! necessary, because such functions are covered by the <tt>mem_fn(R T::* pm)</tt> signature.
! <p/>
! Concepts were removed from the draft and N3000 restored the original
! single signature and accompanying remark.
! <p/>
! LWG <a href="lwg-closed.html#1230">1230</a> was opened to strike the remark again and to add an overload
! for member functions (this overload was unnecessary for syntactic reasons and 
! insufficient as it didn't handle member functions with cv-qualifiers and&#47;or 
! ref-qualifiers.)
! <p/>
! <a href="lwg-defects.html#920">920</a> (and <a href="lwg-closed.html#1230">1230</a>) were resolved by restoring a full set of
! (non-concept-enabled) overloads for member functions with cv-qualifiers and ref-qualifiers,
! but as in the concept-enabled draft there were no overloads for member functions with 
! an ellipsis in the parameter-declaration-clause. This is what is present in the FDIS.
! <p/>
! Following the thread beginning with message c++std-lib-30675, it is my
! understanding that all the <tt>mem_fn</tt> overloads for member functions are
! unnecessary and were only ever added to allow concept requirements.
! I'm not aware of any reason implementations cannot implement <tt>mem_fn</tt> as
! a single function template. Without concepts the overloads are
! redundant, and the absence of overloads for varargs functions can be
! interpreted to imply that varargs functions are not intended to work
! with <tt>mem_fn</tt>. Clarifying the intent by adding overloads for varargs
! functions would expand the list of 12 redundant overloads to 24, it
! would be much simpler to remove the 12 redundant overloads entirely.
! </p>
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Move to Review.
! </p>
! 
! <p>
! The issue and resolution appear to be correct, but there is some concern that the wording of INVOKE may be different depending on whether you pass a pointer-to-member-data or pointer-to-member-function.  That might make the current wording necessary after all, and then we might need to add the missing elipsis overloads.
! </p>
! 
! <p>
! There was some concern that the Remark confirming implementors had freedom to implement this as a set of overloaded functions may need to be restored if we delete the specification for these overloads.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Moved to Tentatively Ready by the post-Kona issues processing subgroup.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Change the <tt>&lt;functional&gt;</tt> synopsis 20.9 [function.objects] p. 2 as follows:</p>
! 
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   // <i>[func.memfn], member function adaptors:</i>
!   template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::*);
! <del>  template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...));
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) const);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) volatile);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) const volatile);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) &amp;);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) const &amp;);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) volatile &amp;);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) const volatile &amp;);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) &amp;&amp;);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) const &amp;&amp;);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) volatile &amp;&amp;);
!   template&lt;class R, class T, class... Args&gt;
!   <i>unspecified</i> mem_fn(R (T::*)(Args...) const volatile &amp;&amp;);</del>
! 
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 20.9.11 [func.memfn] as follows:</p>
! 
! <blockquote><pre>
! template&lt;class R, class T&gt; <i>unspecified</i> mem_fn(R T::*);
! <del>template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...));
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) const);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) volatile);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) const volatile);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) &amp;);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) const &amp;);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) volatile &amp;);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) const volatile &amp;);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) &amp;&amp;);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) const &amp;&amp;);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) volatile &amp;&amp;);
! template&lt;class R, class T, class... Args&gt;
! <i>unspecified</i> mem_fn(R (T::*)(Args...) const volatile &amp;&amp;);</del>
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2049"></a>2049. <tt>is_destructible</tt> is underspecified</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-04-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>The conditions for the type trait <tt>is_destructible</tt> to be true
! are described in Table 49 &mdash; Type property predicates:</p>
! <blockquote><p>
! For a complete type <tt>T</tt> and given<br/>
! <tt>template &lt;class U&gt;
! struct test { U u; };</tt>,<br/>
! <tt>test&lt;T&gt;::~test()</tt> is not deleted.
! </p></blockquote>
! 
! <p>This specification does not say what the result would be for function
! types or for abstract types:</p>
! <ol>
! <li>For an abstract type <tt>X</tt> the instantiation <tt>test&lt;X&gt;</tt>
! is already ill-formed, so we cannot say anything about whether the destructor
! would be deleted or not.</li>
! <li>In regard to function types, there exists a special rule in the core language, 14.3.1 [temp.arg.type] p. 3,
! which excludes member functions to be declared via the type of the template parameter:
! <blockquote><p>
! If a declaration acquires a function type through a type dependent on a <i>template-parameter</i>
! and this causes a declaration that does not use the syntactic form of a function declarator 
! to have function type, the program is ill-formed. 
! <p/>
! [ <i>Example</i>:</p>
! <blockquote><pre>
! template&lt;class T&gt; struct A {
!   static T t;
! };
! typedef int function();
! A&lt;function&gt; a; // ill-formed: would declare A&lt;function&gt;::t
!                // as a static member function
! </pre></blockquote>
! <p>
! &mdash; <i>end example</i> ]
! </p></blockquote>
! which has the same consequence as for abstract types, namely that the corresponding
! instantiation of <tt>test</tt> is already ill-formed and we cannot say anything
! about the destructor.
! </li>
! </ol>
! <p>To solve this problem, I suggest to specify function types as trivially and nothrowing
! destructible, because above mentioned rule is very special for templates. For non-templates,
! a typedef can be used to introduce a member as member function as clarified in 8.3.5 [dcl.fct]
! p. 10.</p>
! <p>For abstract types, two different suggestions have been brought to my attention:
! Either declare them as unconditionally non-destructible or check whether the expression
! </p>
! <blockquote><pre>
! std::declval&lt;T&amp;&gt;().~T()
! </pre></blockquote>
! <p>is well-formed in an unevaluated context. The first solution is very easy to specify,
! but the second version has the advantage for providing more information to user-code. This 
! information could be quite useful, if generic code is supposed to invoke the destructor
! of a reference to a base class indirectly via a delete expression, as suggested by
! Howard Hinnant:</p>
! <blockquote><pre>
! template &lt;class T&gt;
! my_pointer&lt;T&gt;::~my_pointer() noexcept(is_nothrow_destructible&lt;T&gt;::value)
! {
!    delete ptr_;
! }
! </pre></blockquote>
! <p>Additional to the <tt>is_destructible</tt> traits, its derived forms <tt>is_trivially_destructible</tt>
! and <tt>is_nothrow_destructible</tt> are similarly affected, because their wording refers to "the indicated
! destructor" and probably need to be adapted as well.</p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! After discussion about to to handle the exceptional cases of reference types, function types (available by defererencing a function pointer)
! and <tt>void</tt> types, Howard supplied proposed wording.
! </p>
! 
! <p><i>[
! 2011-08-20 Daniel comments and provides alternatives wording
! ]</i></p>
! 
! 
! <p>
! The currently proposed wording would have the consequence that 
! <em>every</em> array type is not destructible, because the pseudo-destructor
! requires a scalar type with the effect that the expression
! </p><blockquote><pre>
! std::declval&lt;T&amp;&gt;().~T()
! </pre></blockquote><p>
! is not well-formed for e.g. <tt>T</tt> equal to <tt>int[3]</tt>. The intuitive
! solution to fix this problem would be to adapt the object type case to refer to 
! the expression
! </p><blockquote><pre>
! std::declval&lt;U&amp;&gt;().~U()
! </pre></blockquote><p>
! with <tt>U</tt> equal to <tt>remove_all_extents&lt;T&gt;::type</tt>, but that
! would have the effect that arrays of unknown bounds would be destructible, if 
! the element type is destructible, which was not the case before (This was 
! intentionally covered by the special "For a complete type T" rule in
! the FDIS).
! <p/>
! Suggestion: Use the following definition instead:
! </p>
! <blockquote><p>
! Let <tt>U</tt> be <tt>remove_all_extents&lt;T&gt;::type</tt>.<br/>
! For incomplete types and function types, <tt>is_destructible&lt;T&gt;::value</tt> is <tt>false</tt>.<br/>
! For object types, if the expression <tt>std::declval&lt;U&amp;&gt;().~U()</tt> is well-formed<br/>
! when treated as an unevaluated operand (Clause 5), then <tt>is_destructible&lt;T&gt;::value</tt><br/>
! is <tt>true</tt>, otherwise it is <tt>false</tt>.<br/>
! For reference types, <tt>is_destructible&lt;T&gt;::value</tt> is <tt>true</tt>.
! </p></blockquote>
! <p>
! This wording also harmonizes with the "unevaluated operand" phrase
! used in other places, there does not exist the definition of an
! "unevaluated context"
! <p/>
! <em>Note:</em> In the actually proposed wording this wording has been slightly reordered with the same effects. 
! </p>
! 
! <p><strong>Howard's (old) proposed resolution:</strong></p>
! <blockquote class="note">
! <p>
! Update 20.10.4.3 [meta.unary.prop], table 49:
! </p>
! 
! <table border="1">
! <tr>
! <td><tt>template &lt;class T&gt;
! struct is_destructible;</tt></td>
! <td>
! <del>For a complete type <tt>T</tt> and given <tt>template &lt;class U&gt; struct test { U u; };</tt>, <tt>test&lt;T&gt;::~test()</tt> is not deleted.
! </del>
! <br/>
! <ins>
! For object types, if the expression: <tt>std::declval&lt;T&amp;>().~T()</tt> is well-formed in an unevaluated context then
! <tt>is_destructible&lt;T>::value</tt> is <tt>true</tt>, otherwise it is <tt>false</tt>.
! <br/>
! For <tt>void</tt> types, <tt>is_destructible&lt;T>::value</tt> is <tt>false</tt>.
! <br/>
! For reference types, <tt>is_destructible&lt;T>::value</tt> is <tt>true</tt>.
! <br/>
! For function types, <tt>is_destructible&lt;T>::value</tt> is <tt>false</tt>.
! </ins>
! </td>
! <td><tt>T</tt> shall be a complete type, (possibly cv-qualified) <tt>void</tt>, or an array of unknown bound.</td>
! </tr>
! </table>
! </blockquote>
! <p>
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Moved to Tentatively Ready by the post-Kona issues processing subgroup.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>
! Update 20.10.4.3 [meta.unary.prop], table 49:
! </p>
! 
! <table border="1">
! <tr>
! <td><tt>template &lt;class T&gt;
! struct is_destructible;</tt></td>
! <td>
! <del>For a complete type <tt>T</tt> and given <tt>template &lt;class U&gt; struct test { U u; };</tt>, <tt>test&lt;T&gt;::~test()</tt> is not deleted.
! </del>
! <br/>
! <ins>
! For reference types, <tt>is_destructible&lt;T&gt;::value</tt> is <tt>true</tt>.<br/>
! For incomplete types and function types, <tt>is_destructible&lt;T&gt;::value</tt> is <tt>false</tt>.<br/>
! For object types and given <tt>U</tt> equal to <tt>remove_all_extents&lt;T&gt;::type</tt>,<br/> 
! if the expression <tt>std::declval&lt;U&amp;&gt;().~U()</tt> is well-formed when treated as an<br/>
! unevaluated operand (Clause 5 [expr]), then <tt>is_destructible&lt;T&gt;::value</tt> is <tt>true</tt>,<br/>
! otherwise it is <tt>false</tt>.<br/>
! </ins>
! </td>
! <td><tt>T</tt> shall be a complete type, (possibly cv-qualified) <tt>void</tt>, or an array of unknown bound.</td>
! </tr>
! </table>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2050"></a>2050. Unordered associative containers do not use <tt>allocator_traits</tt> to define member types</h3>
! <p><b>Section:</b> 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Tom Zieberman <b>Opened:</b> 2011-04-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>The unordered associative containers define their member types <tt>reference</tt>, 
! <tt>const_reference</tt>, <tt>pointer</tt>, <tt>const_pointer</tt> in terms of 
! their template parameter <tt>Allocator</tt> (via <tt>allocator_type</tt> typedef). As 
! a consequence, only the allocator types, that provide sufficient typedefs, are usable 
! as allocators for unordered associative containers, while other containers do not have 
! this deficiency. In addition to that, the definitions of said typedefs are different 
! from ones used in the other containers. This is counterintuitive and introduces a certain 
! level of confusion. These issues can be fixed by defining <tt>pointer</tt> and 
! <tt>const_pointer</tt> typedefs in terms of <tt>allocator_traits&lt;Allocator&gt;</tt> 
! and by defining <tt>reference</tt> and <tt>const_reference</tt> in terms of 
! <tt>value_type</tt> as is done in the other containers.
! </p>
! 
! <p><i>[
! 2011 Bloomington.
! ]</i></p>
! 
! 
! <p>
! Move to Ready.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to the FDIS.</p>
! 
! <ul>
! <li><p>Change 23.5.4.1 [unord.map.overview] paragraph 3 as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Key,
!             class T,
!             class Hash = hash&lt;Key&gt;,
!             class Pred = std::equal_to&lt;Key&gt;,
!             class Allocator = std::allocator&lt;std::pair&lt;const Key, T&gt; &gt; &gt;
!   class unordered_map
!   {
!   public:
!     <i>// types</i>
!     typedef Key key_type;
!     typedef std::pair&lt;const Key, T&gt; value_type;
!     typedef T mapped_type;
!     typedef Hash hasher;
!     typedef Pred key_equal;
!     typedef Allocator allocator_type;
!     typedef typename <del>allocator_type</del><ins>allocator_traits&lt;Allocator&gt;</ins>::pointer pointer;
!     typedef typename <del>allocator_type</del><ins>allocator_traits&lt;Allocator&gt;</ins>::const_pointer const_pointer;
!     typedef <del>typename allocator_type::reference</del><ins>value_type&amp;</ins> reference;
!     typedef <del>typename allocator_type::const_reference</del><ins>const value_type&amp;</ins> const_reference;
!     typedef <i>implementation-defined</i> size_type;
!     typedef <i>implementation-defined</i> difference_type;
! 
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.5.1 [unord.multimap.overview] paragraph 3 as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Key,
!             class T,
!             class Hash = hash&lt;Key&gt;,
!             class Pred = std::equal_to&lt;Key&gt;,
!             class Allocator = std::allocator&lt;std::pair&lt;const Key, T&gt; &gt; &gt;
!   class unordered_multimap
!   {
!   public:
!     <i>// types</i>
!     typedef Key key_type;
!     typedef std::pair&lt;const Key, T&gt; value_type;
!     typedef T mapped_type;
!     typedef Hash hasher;
!     typedef Pred key_equal;
!     typedef Allocator allocator_type;
!     typedef typename <del>allocator_type</del><ins>allocator_traits&lt;Allocator&gt;</ins>::pointer pointer;
!     typedef typename <del>allocator_type</del><ins>allocator_traits&lt;Allocator&gt;</ins>::const_pointer const_pointer;
!     typedef <del>typename allocator_type::reference</del><ins>value_type&amp;</ins> reference;
!     typedef <del>typename allocator_type::const_reference</del><ins>const value_type&amp;</ins> const_reference;
!     typedef <i>implementation-defined</i> size_type;
!     typedef <i>implementation-defined</i> difference_type;
! 
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.6.1 [unord.set.overview] paragraph 3 as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Key,
!             class Hash = hash&lt;Key&gt;,
!             class Pred = std::equal_to&lt;Key&gt;,
!             class Allocator = std::allocator&lt;Key&gt; &gt;
!   class unordered_set
!   {
!   public:
!     <i>// types</i>
!     typedef Key key_type;
!     typedef Key value_type;
!     typedef Hash hasher;
!     typedef Pred key_equal;
!     typedef Allocator allocator_type;
!     typedef typename <del>allocator_type</del><ins>allocator_traits&lt;Allocator&gt;</ins>::pointer pointer;
!     typedef typename <del>allocator_type</del><ins>allocator_traits&lt;Allocator&gt;</ins>::const_pointer const_pointer;
!     typedef <del>typename allocator_type::reference</del><ins>value_type&amp;</ins> reference;
!     typedef <del>typename allocator_type::const_reference</del><ins>const value_type&amp;</ins> const_reference;
!     typedef <i>implementation-defined</i> size_type;
!     typedef <i>implementation-defined</i> difference_type;
! 
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.7.1 [unord.multiset.overview] paragraph 3 as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Key,
!             class Hash = hash&lt;Key&gt;,
!             class Pred = std::equal_to&lt;Key&gt;,
!             class Allocator = std::allocator&lt;Key&gt; &gt;
!   class unordered_multiset
!   {
!   public:
!     <i>// types</i>
!     typedef Key key_type;
!     typedef Key value_type;
!     typedef Hash hasher;
!     typedef Pred key_equal;
!     typedef Allocator allocator_type;
!     typedef typename <del>allocator_type</del><ins>allocator_traits&lt;Allocator&gt;</ins>::pointer pointer;
!     typedef typename <del>allocator_type</del><ins>allocator_traits&lt;Allocator&gt;</ins>::const_pointer const_pointer;
!     typedef <del>typename allocator_type::reference</del><ins>value_type&amp;</ins> reference;
!     typedef <del>typename allocator_type::const_reference</del><ins>const value_type&amp;</ins> const_reference;
!     typedef <i>implementation-defined</i> size_type;
!     typedef <i>implementation-defined</i> difference_type;
! 
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! </ul>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2052"></a>2052. Mixup between <tt>mapped_type</tt> and <tt>value_type</tt> for associative containers</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Marc Glisse <b>Opened:</b> 2011-05-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! (this is basically reopening the first part of issue <a href="lwg-closed.html#2006">2006</a>, as discussed in the thread 
! starting at c++std-lib-30698 )
! <p/>
! Section 23.2.4 [associative.reqmts]
! <p/>
! In Table 102, several uses of <tt>T</tt> (which means <tt>mapped_type</tt> here) should
! be <tt>value_type</tt> instead. This is almost editorial. For instance:
! </p>
! <blockquote><pre>
! a_uniq.emplace(args)
! </pre><p>
! <i>Requires</i>: <tt>T</tt> shall be <tt>EmplaceConstructible</tt> into <tt>X</tt> from args.
! <p/>
! <i>Effects</i>: Inserts a <tt>T</tt> object <tt>t</tt> constructed with
! <tt>std::forward&lt;Args&gt;(args)...</tt> if and only if there is no element in the
! container with key equivalent to the key of <tt>t</tt>. The <tt>bool</tt> component of
! the returned pair is true if and only if the insertion takes place, and the iterator component 
! of the pair points to the element with key equivalent to the key of <tt>t</tt>.
! </p></blockquote>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! Not even an exhaustive list of problem locations. No reason to doubt issue.
! </p>
! <p>
! Pablo agrees to provide wording.
! </p>
! 
! <p><i>[
! 2011-09-04 Pablo Halpern provides improved wording
! ]</i></p>
! 
! 
! <p><i>[2014-02-15 post-Issaquah session : move to Resolved]</i></p>
! 
! <p>
! AJM to replace this note with a 'Resolved By...' after tracking down the exact sequence of events, but clearly resolved in C++14 DIS.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! In both section 23.2.4 [associative.reqmts] Table 102 and 23.2.5 [unord.req], Table 103, make the following text replacements:
! </p>
! 
! <table border="1">
! <tr> <td>Original text, in FDIS</td> <td>Replacement text</td> </tr>
! 
! <tr> 
! <td><tt>T</tt> is CopyInsertable into <tt>X</tt> and <tt>CopyAssignable</tt>.</td>
! <td><tt>value_type</tt> is <tt>CopyInsertable</tt> into <tt>X</tt>, <tt>key_type</tt> is <tt>CopyAssignable</tt>, and
! <tt>mapped_type</tt> is <tt>CopyAssignable</tt> (for containers having a <tt>mapped_type</tt>)</td>    
! </tr>
! 
! <tr> 
! <td><tt>T</tt> is <tt>CopyInsertable</tt></td>                                                
! <td><tt>value_type</tt> is CopyInsertable</td> 
! </tr>
! 
! <tr> 
! <td><tt>T</tt> shall be <tt>CopyInsertable</tt></td>                                          
! <td><tt>value_type</tt> shall be CopyInsertable</td> 
! </tr>
! 
! <tr> 
! <td><tt>T</tt> shall be <tt>MoveInsertable</tt></td>                                          
! <td><tt>value_type</tt> shall be MoveInsertable</td> 
! </tr>
! 
! <tr> 
! <td><tt>T</tt> shall be <tt>EmplaceConstructible</tt></td>                                    
! <td><tt>value_type</tt> shall be EmplaceConstructible</td> 
! </tr>
! 
! <tr> 
! <td><tt>T</tt> object</td>                                                                    
! <td><tt>value_type</tt> object</td> 
! </tr>
! </table>
! 
! <p><i>[
! <b>Notes to the editor</b>: The above are carefully selected 
! phrases that can be used for global search-and-replace within 
! the specified sections without accidentally making changes to 
! correct uses <tt>T</tt>.
! ]</i></p>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2053"></a>2053. Errors in <tt>regex</tt> bitmask types</h3>
! <p><b>Section:</b> 28.5 [re.const] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-05-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! When <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3110.html">N3110</a> 
! was applied to the WP some redundant "static" keywords were added and one form of initializer 
! which isn't valid for enumeration types was replaced with another form of invalid initializer.
! </p>
! 
! <p><i>[
! 2011 Bloomington.
! ]</i></p>
! 
! 
! <p>
! Move to Ready.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Change 28.5.1 [re.synopt] as indicated:</p>
! <blockquote><pre>
! namespace std {
!   namespace regex_constants {
!     typedef <i>T1</i> syntax_option_type;
!     <del>static </del>constexpr syntax_option_type icase = <i>unspecified</i> ;
!     <del>static </del>constexpr syntax_option_type nosubs = <i>unspecified</i> ;
!     <del>static </del>constexpr syntax_option_type optimize = <i>unspecified</i> ;
!     <del>static </del>constexpr syntax_option_type collate = <i>unspecified</i> ;
!     <del>static </del>constexpr syntax_option_type ECMAScript = <i>unspecified</i> ;
!     <del>static </del>constexpr syntax_option_type basic = <i>unspecified</i> ;
!     <del>static </del>constexpr syntax_option_type extended = <i>unspecified</i> ;
!     <del>static </del>constexpr syntax_option_type awk = <i>unspecified</i> ;
!     <del>static </del>constexpr syntax_option_type grep = <i>unspecified</i> ;
!     <del>static </del>constexpr syntax_option_type egrep = <i>unspecified</i> ;
!   }
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 28.5.2 [re.matchflag] as indicated:</p>
! <blockquote><pre>
! namespace std {
!   namespace regex_constants {
!     typedef <i>T2</i> match_flag_type;
!     <del>static </del>constexpr match_flag_type match_default<del> = 0</del><ins>{};</ins>
!     <del>static </del>constexpr match_flag_type match_not_bol = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type match_not_eol = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type match_not_bow = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type match_not_eow = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type match_any = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type match_not_null = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type match_continuous = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type match_prev_avail = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type format_default<del> = 0</del><ins>{}</ins>;
!     <del>static </del>constexpr match_flag_type format_sed = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type format_no_copy = <i>unspecified</i> ;
!     <del>static </del>constexpr match_flag_type format_first_only = <i>unspecified</i> ;
!   }
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 28.5.3 [re.err] as indicated:</p>
! <blockquote><pre>
! namespace std {
!   namespace regex_constants {
!     typedef <i>T3</i> error_type;
!     <del>static </del>constexpr error_type error_collate = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_ctype = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_escape = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_backref = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_brack = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_paren = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_brace = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_badbrace = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_range = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_space = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_badrepeat = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_complexity = <i>unspecified</i> ;
!     <del>static </del>constexpr error_type error_stack = <i>unspecified</i> ;
!   }
! }
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2054"></a>2054. <tt>time_point</tt> constructors need to be <tt>constexpr</tt></h3>
! <p><b>Section:</b> 20.12.6 [time.point] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2011-05-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 20.12.6 [time.point], <tt>time_point::min()</tt> and <tt>time_point::max()</tt> 
! are listed as <tt>constexpr</tt>. However, <tt>time_point</tt> has no <tt>constexpr</tt> constructors, 
! so is not a literal type, and so these functions cannot be <tt>constexpr</tt> without adding a 
! <tt>constexpr</tt> constructor for implementation purposes.
! <p/>
! Proposed resolution: Add <tt>constexpr</tt> to the constructors of <tt>time_point</tt>. The effects of
! the constructor template basically imply that the member function <tt>time_since_epoch()</tt> is
! intended to be <tt>constexpr</tt> as well.
! </p>
! 
! <p><i>[2012, Portland]</i></p>
! 
! <p>
! Resolved by adopting paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3469">n3469</a>.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Alter the class template definition in 20.12.6 [time.point] as follows:</p>
! <blockquote><pre>
! template &lt;class Clock, class Duration = typename Clock::duration&gt;
! class time_point {
!   [&hellip;]
! public:
!   <i>// 20.11.6.1, construct:</i>
!   <ins>constexpr</ins> time_point(); <i>// has value epoch</i>
!   <ins>constexpr</ins> explicit time_point(const duration&amp; d); <i>// same as time_point() + d</i>
!   template &lt;class Duration2&gt;
!     <ins>constexpr</ins> time_point(const time_point&lt;clock, Duration2&gt;&amp; t);
! 
!   <i>// 20.11.6.2, observer:</i>
!   <ins>constexpr</ins> duration time_since_epoch() const;
!   [&hellip;]
! };
! </pre></blockquote>
! </li>
! 
! <li><p>Alter the declarations in 20.12.6.1 [time.point.cons]:</p>
! <blockquote><pre>
! <ins>constexpr</ins> time_point();
! </pre><blockquote><p>
! -1- <i>Effects</i>: Constructs an object of type <tt>time_point</tt>, initializing <tt>d_</tt> with <tt>duration::zero()</tt>. Such a
! <tt>time_point</tt> object represents the epoch.
! </p></blockquote></blockquote>
! <blockquote><pre>
! <ins>constexpr explicit</ins> time_point(const duration&amp; d);
! </pre><blockquote><p>
! -2- <i>Effects</i>: Constructs an object of type <tt>time_point</tt>, initializing <tt>d_</tt> with <tt>d</tt>. Such a 
! <tt>time_point</tt> object represents the epoch <tt>+ d</tt>.
! </p></blockquote></blockquote>
! <blockquote><pre>
! template &lt;class Duration2&gt;
!   <ins>constexpr</ins> time_point(const time_point&lt;clock, Duration2&gt;&amp; t);
! </pre><blockquote><p>
! -3- <i>Remarks</i>: This constructor shall not participate in overload resolution unless <tt>Duration2</tt> is implicitly
! convertible to <tt>duration</tt>.
! <p/>
! -4- <i>Effects</i>: Constructs an object of type <tt>time_point</tt>, initializing <tt>d_</tt> with <tt>t.time_since_epoch()</tt>.
! </p></blockquote></blockquote>
! </li>
! 
! <li><p>Alter the declaration in 20.12.6.2 [time.point.observer]:</p>
! <blockquote><pre>
! <ins>constexpr</ins> duration time_since_epoch() const;
! </pre><blockquote><p>
! -1- <i>Returns</i>: d_.
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2056"></a>2056. <tt>future_errc</tt> enums start with value 0 (invalid value for <tt>broken_promise</tt>)</h3>
! <p><b>Section:</b> 30.6.1 [futures.overview] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2011-05-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.overview">issues</a> in [futures.overview].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 30.6.1 [futures.overview] <tt>enum class future_errc</tt> is defined as follows:
! </p><blockquote><pre>
! enum class future_errc {
!   broken_promise,
!   future_already_retrieved,
!   promise_already_satisfied,
!   no_state
! };
! </pre></blockquote><p>
! With this declaration <tt>broken_promise</tt> has value 0, which means that
! for a <tt>future_error f</tt> with this code
! </p><blockquote><pre>
! f.code().operator bool()
! </pre></blockquote><p>
! yields false, which makes no sense. 0 has to be reserved for "no error".
! So, the enums defined here have to start with 1.
! <p/>
! Howard, Anthony, and Jonathan have no objections.
! </p>
! <p>[Discussion in Bloomington 2011-08-16]
! </p>
! <p>
! Previous resolution:
! </p>
! <blockquote class="note">
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>In 30.6.1 [futures.overview], header <tt>&lt;future&gt;</tt> synopsis, fix 
! the declaration of <tt>future_errc</tt> as follows:</p>
! <blockquote><pre>
! namespace std {
!   enum class future_errc {
!     <del>broken_promise,</del>
!     future_already_retrieved<ins> = 1</ins>,
!     promise_already_satisfied,
!     no_state<ins>,
!     broken_promise</ins>
!   };
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! </ol>
! </blockquote>
! <p>
! Is this resolution overspecified? These seem to be all implementation-defined. How do users add new values and not conflict with established error codes?
! </p><p>
! PJP proxy says: over-specified. boo.
! </p><p>
! Other error codes: look for <tt>is_error_code_enum</tt> specializations. Only one exists <tt>io_errc</tt>
! </p><p>
! Peter: I don't see any other parts of the standard that specify error codes where we have to do something similar.
! </p><p>
! Suggest that for every place where we add an error code, the following:
! </p>
! <ol>
!    <li> no zero values
!    </li><li> all implementation defined values, so future_already_retrieved = implementation_defined
!    </li><li> values are distinct
! </li></ol>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Moved to Tentatively Ready by the post-Kona issues processing subgroup.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <p>In 30.6.1 [futures.overview], header <tt>&lt;future&gt;</tt> synopsis, fix 
! the declaration of <tt>future_errc</tt> as follows:</p>
! 
! <blockquote><pre>
! namespace std {
!   enum class future_errc {
!     broken_promise<ins> = <var>implementation defined</var></ins>,
!     future_already_retrieved<ins> = <var>implementation defined</var></ins>,
!     promise_already_satisfied<ins> = <var>implementation defined</var></ins>,
!     no_state<ins> = <var>implementation defined</var></ins>
!   };
!   [&hellip;]
! }
! </pre></blockquote>
! <p>In 30.6.1 [futures.overview], header <tt>&lt;future&gt;</tt> synopsis, add a paragraph after paragraph 2 as follows:</p>
! 
! <ins>The enum values of <tt>future_errc</tt> are distinct and not zero.</ins>
! 
! 
! 
! 
! <hr>
! <h3><a name="2057"></a>2057. <tt>time_point + duration</tt> semantics should be made <tt>constexpr</tt> conforming</h3>
! <p><b>Section:</b> 20.12.6.5 [time.point.nonmember] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-05-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! It has been observed by LWG <a href="lwg-defects.html#2054">2054</a> that the specification of some <tt>time_point</tt> member functions
! already imply that <tt>time_point</tt> needs to be a literal type and suggests to specify the constructors
! and the member function <tt>time_since_epoch()</tt> as <tt>constexpr</tt> functions at the
! minimum necessary. Adding further <tt>constexpr</tt> specifier to other operations should
! clearly be allowed and should probably be done as well. But to allow for further <tt>constexpr</tt> 
! functions in the future requires that their semantics is compatible to operations allowed in <tt>constexpr</tt> 
! functions. This is already fine for all operations, except this binary plus operator:
! </p>
! <blockquote><pre>
! template &lt;class Clock, class Duration1, class Rep2, class Period2&gt;
! time_point&lt;Clock, typename common_type&lt;Duration1, duration&lt;Rep2, Period2&gt;&gt;::type&gt;
! operator+(const time_point&lt;Clock, Duration1&gt;&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
! </pre><blockquote><p>
! -1- <i>Returns</i>: <tt>CT(lhs) += rhs</tt>, where <tt>CT</tt> is the type of the return value.
! </p></blockquote></blockquote>
! <p>
! for similar reasons as those mentioned in <a href="lwg-defects.html#2020">2020</a>. The semantics should be fixed to allow
! for making them <tt>constexpr</tt>. This issue should also be considered as a placeholder for a request
! to make the remaining <tt>time_point</tt> operations similarly <tt>constexpr</tt> as had been done for 
! <tt>duration</tt>.
! </p>
! 
! 
! <p><i>[2012, Portland]</i></p>
! 
! <p>
! Resolved by adopting paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3469">n3469</a>.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>In 20.12.6.5 [time.point.nonmember], p.1 change the <i>Returns</i> element semantics as indicated:</p>
! <blockquote><pre>
! template &lt;class Clock, class Duration1, class Rep2, class Period2&gt;
! time_point&lt;Clock, typename common_type&lt;Duration1, duration&lt;Rep2, Period2&gt;&gt;::type&gt;
! operator+(const time_point&lt;Clock, Duration1&gt;&amp; lhs, const duration&lt;Rep2, Period2&gt;&amp; rhs);
! </pre><blockquote><p>
! -1- <i>Returns</i>: <tt><del>CT(lhs) += rhs</del><ins>CT(lhs.time_since_epoch() + rhs)</ins></tt>, where <tt>CT</tt> 
! is the type of the return value.
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2058"></a>2058. <tt>valarray</tt> and <tt>begin&#47;end</tt></h3>
! <p><b>Section:</b> 26.6 [numarray] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Gabriel Dos Reis <b>Opened:</b> 2011-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#numarray">issues</a> in [numarray].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! It was just brought to my attention that the pair of functions
! <tt>begin&#47;end</tt> were added to <tt>valarray</tt> component.
! Those additions strike me as counter to the long standing agreement
! that <tt>valarray&lt;T&gt;</tt> is not yet another container. Valarray values
! are in general supposed to be treated as a whole, and as such
! has a loose specification allowing expression template techniques.
! <p/>
! The addition of these functions sound to me as making it much harder
! (or close to impossible) to effectively use expression templates
! as implementation techniques, for no clear benefits.
! <p/>
! My recommendation would be to drop <tt>begin&#47;end</tt> - or at least for the
! <tt>const valarray&lt;T&gt;&amp;</tt> version. I strongly believe those 
! are defects.
! </p>
! <p><i>[This issue was discussed on the library reflector starting from c++std-lib-30761.
! Some of the key conclusions of this discussion were:]</i></p>
! 
! <ol>
! <li>The <tt>begin&#47;end</tt> members were added to allow <tt>valarray</tt> to participate
! in the new range-based for-loop by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2930.html">n2930</a>
! and not to make them container-like.</li>
! <li>It is currently underspecified when the iterator values returned from
! <tt>begin&#47;end</tt> become invalidated. To fix this, these invalidation rules need at
! least to reflect the invalidation rules of the references returned by the
! <tt>operator[]</tt> overloads of <tt>valarray</tt> (26.6.2.4 [valarray.access]).
! </li>
! <li>A further problem is that the requirements expressed in 26.6.1 [valarray.syn] p.3-5
! enforce an implementation to provide further overloads of <tt>begin&#47;end</tt>, if the
! replacement type technique is used (which was clearly part of the design of <tt>valarray</tt>).
! Providing such additional overloads would also lead to life-time problems in examples like 
! <tt>begin(x + y)</tt> where <tt>x</tt> and <tt>y</tt> are expressions involving <tt>valarray</tt> 
! objects. To fix this, the <tt>begin&#47;end</tt> overloads could be explicitly excluded from the 
! general statements of 26.6.1 [valarray.syn] p.3-5. This would make it unspecified
! whether the expression <tt>begin(x + y)</tt> would be well-formed, portable code would
! need to write this as <tt>begin(std::valarray&lt;T&gt;(x + y))</tt>.</li>
! </ol>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! The intent of these overloads is entirely to support the new for syntax, and not to create
! new containers.
! </p>
! 
! <p>
! Stefanus provides suggested wording.
! </p>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Moved to Tenatively Ready by post-meeting issues processing group, after confirmation
! from Gaby.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! In 26.6.1 [valarray.syn]&#47;4, make the following <ins>insertion</ins>:
! </p>
! 
! <p>
! 4 Implementations introducing such replacement types shall provide additional functions and operators as
! follows:
! </p>
! <ul>
! <li>for every function taking a <tt>const valarray&lt;T&gt;&amp;</tt> <ins>other than <tt>begin</tt> and <tt>end</tt>
! (26.6.10 [valarray.range])</ins>, identical functions taking the replacement types shall be added;
! </li>
! <li>
! for every function taking two <tt>const valarray&lt;T&gt;&amp;</tt> arguments, identical functions taking every combination
! of <tt>const valarray&lt;T&gt;&amp;</tt> and replacement types shall be added.
! </li>
! </ul>
! 
! <p>
! In 26.6.10 [valarray.range], make the following <ins>insertion</ins>:
! </p>
! <p> 
! 1 In the <tt>begin</tt> and <tt>end</tt> function templates that follow, <i>unspecified</i>1 is a type that meets
! the requirements of a mutable random access iterator (24.2.7) whose <tt>value_type</tt> is the template parameter
! <tt>T</tt> and whose <tt>reference</tt> type is <tt>T&amp;</tt>. <i>unspecified</i>2 is a type that meets the
! requirements of a constant random access iterator (24.2.7) whose <tt>value_type</tt> is the template parameter
! <tt>T</tt> and whose <tt>reference</tt> type is <tt>const T&amp;</tt>.
! </p>
! <p><ins>
! 2 The iterators  returned by <tt>begin</tt> and <tt>end</tt> for an array are guaranteed to be valid until the
! member function <tt>resize(size_t, T)</tt> (26.6.2.8 [valarray.members]) is called for that array or until
! the lifetime of that array ends, whichever happens first.
! </ins></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2059"></a>2059. C++0x ambiguity problem with <tt>map::erase</tt></h3>
! <p><b>Section:</b> 23.4.4 [map] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Christopher Jefferson <b>Opened:</b> 2011-05-18 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#map">issues</a> in [map].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>map::erase</tt> (and several related methods) took an iterator in C++03, but take a <tt>const_iterator</tt> 
! in C++0x. This breaks code where the map's <tt>key_type</tt> has a constructor which accepts an iterator 
! (for example a template constructor), as the compiler cannot choose between <tt>erase(const key_type&amp;)</tt> 
! and <tt>erase(const_iterator)</tt>.</p>
! <blockquote><pre>
! #include &lt;map&gt;
! 
! struct X
! {
!   template&lt;typename T&gt;
!   X(T&amp;) {}
! };
! 
! bool operator&lt;(const X&amp;, const X&amp;) { return false; }
! 
! void erasor(std::map&lt;X,int&gt;&amp; s, X x)
! {
!   std::map&lt;X,int&gt;::iterator it = s.find(x);
!   if (it != s.end())
!     s.erase(it);
! }
! </pre></blockquote>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! This issue affects only associative container <tt>erase</tt> calls, and is not more general, as these are the
! only functions that are also overloaded on another single arguement that might cause confusion - the <tt>erase</tt>
! by key method.  The complete resolution should simply restore the <tt>iterator</tt> overload in addition to the
! <tt>const_iterator</tt> overload for all eight associative containers. 
! </p>
! 
! <p>
! Proposed wording supplied by Alan Talbot, and moved to Review.
! </p>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Moved back to Open by post-meeting issues processing group.
! </p>
! <p>
! Pablo very unhappy about case of breaking code with ambiguous conversion between both iterator types.
! </p>
! <p>
! Alisdair strongly in favor of proposed resolution, this change from C++11 bit Chris in real code,
! and it took a while to track down the cause.
! </p>
! <p>
! Move to open, bring in front of a larger group
! </p>
! <p>
! Proposed wording from Jeremiah:
! 
! <tt>erase(key)</tt> shall not participate in overload resolution if <tt>iterator</tt> is
! convertible to <tt>key</tt>.
! 
! Note that this means making <tt>erase(key)</tt> a template-method
! </p>
! <p>
! Poll Chris to find out if he already fixed his code, or fixed his library
! </p>
! <p>
! Jeremiah - allow both overloads, but <tt>enable_if</tt> the <tt>const_iterator</tt> form as
! a template, requiring <tt>is_same</tt> to match only <tt>const_iterator</tt>.
! </p>
! <p>
! Poll PJ to see if he has already applied this fix?
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! AM: To summarize, we changed a signature and code broke. At what point do we stop and accept breakage in increasingly obscure code? 
! VV: libc++ is still broken, but libstdc++ works, so they've fixed this &mdash; perhaps using this PR? [Checks] Yes, libstdc++ 
! uses this solution, and has a comment pointing to LWG 2059. AM: This issue hasn't been looked at since Kona. In any case, we 
! already have implementation experience now.
! <p/>
! AM: I'd say let's ship it. We already have implementation experience (libstdc++ and MSVS). MC: And "tentatively ready" lets me 
! try to implement this and see how it works. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Editorial note: The following things are different between 23.2.4 [associative.reqmts] p.8 and
! 23.2.5 [unord.req] p.10. These should probably be reconciled.
! </p>
! <blockquote>
! <ol>
! <li>First uses the convention "denotes";  second uses the convention "is".</li>
! <li>First redundantly says: "If no such element exists, returns a.end()." in erase table entry, second does not.</li>
! </ol>
! </blockquote>
! 
! <p>
! 23.2.4 [associative.reqmts] Associative containers
! </p>
! <p>
! 8 In Table 102, <tt>X</tt> denotes an associative container class, <tt>a</tt> denotes a value of <tt>X</tt>, <tt>a_uniq</tt>
! denotes a value of <tt>X</tt> when <tt>X</tt> supports unique keys, <tt>a_eq</tt> denotes a value of <tt>X</tt> when
! <tt>X</tt> supports multiple keys, <tt>u</tt> denotes an identifier, <tt>i</tt> and <tt>j</tt> satisfy input iterator
! requirements and refer to elements implicitly convertible to <tt>value_type</tt>, <tt>[i,j)</tt> denotes a valid range,
! <tt>p</tt> denotes a valid const iterator to <tt>a</tt>, <tt>q</tt> denotes a valid dereferenceable const iterator to <tt>a</tt>,
! <ins><tt>r</tt> denotes a valid dereferenceable iterator to a,</ins> <tt>[q1, q2)</tt> denotes a valid range of const iterators
! in <tt>a</tt>, <tt>il</tt> designates an object of type <tt>initializer_list&lt;value_type></tt>, <tt>t</tt> denotes a value of
! <tt>X::value_type</tt>, <tt>k</tt> denotes a value of <tt>X::key_type</tt> and <tt>c</tt> denotes a value of type
! <tt>X::key_compare</tt>. <tt>A</tt> denotes the storage allocator used by <tt>X</tt>, if any, or
! <tt>std::allocator&lt;X::value_type></tt> otherwise, and <tt>m</tt> denotes an allocator of a type convertible to <tt>A</tt>.
! </p>
! 
! <p>
! 23.2.4 [associative.reqmts] Associative containers Table 102
! </p>
! <p>
! Add row:
! </p>
! <ins>
! <table border="1">
! <tr>
! <td><tt>a.erase(r)</tt></td>
! <td><tt>iterator</tt></td>
! <td>
! erases the element pointed to by <tt>r</tt>. Returns an iterator pointing to the element immediately following <tt>r</tt>
! prior to the element being erased. If no such element exists, returns <tt>a.end()</tt>.
! </td>
! <td>amortized constant</td>
! </tr>
! </table>
! </ins>
! 
! <p>
! 23.2.5 [unord.req] Unordered associative containers</p>
! <p>
! 10 In table 103: <tt>X</tt> is an unordered associative container class, <tt>a</tt> is an object of type <tt>X</tt>,
! <tt>b</tt> is a possibly const object of type <tt>X</tt>, <tt>a_uniq</tt> is an object of type <tt>X</tt> when
! <tt>X</tt> supports unique keys, <tt>a_eq</tt> is an object of type <tt>X</tt> when <tt>X</tt> supports equivalent keys,
! <tt>i</tt> and <tt>j</tt> are input iterators that refer to <tt>value_type</tt>, <tt>[i, j)</tt> is a valid range,
! <tt>p</tt> and <tt>q2</tt> are valid const iterators to <tt>a</tt>, <tt>q</tt> and <tt>q1</tt> are valid dereferenceable
! const iterators to <tt>a</tt>, <ins><tt>r</tt> is a valid dereferenceable iterator to a,</ins> <tt>[q1,q2)</tt> is a
! valid range in <tt>a</tt>, <tt>il</tt> designates an object of type <tt>initializer_list&lt;value_type></tt>,
! <tt>t</tt> is a value of type <tt>X::value_type</tt>, <tt>k</tt> is a value of type <tt>key_type</tt>, <tt>hf</tt> is a
! possibly const value of type <tt>hasher</tt>, <tt>eq</tt> is a possibly const value of type <tt>key_equal</tt>,
! <tt>n</tt> is a value of type <tt>size_type</tt>, and <tt>z</tt> is a value of type <tt>float</tt>.
! </p>
! 
! <p>
! 23.2.5 [unord.req] Unordered associative containers Table 103
! </p>
! <p>
! Add row:
! </p>
! <ins>
! <table border="1">
! <tr>
! <td><tt>a.erase(r)</tt></td>
! <td><tt>iterator</tt></td>
! <td>
! Erases the element pointed to by <tt>r</tt>. Returns the iterator immediately following <tt>r</tt> prior to the erasure.
! </td>
! <td>Average case O(1), worst case O(<tt>a.size()</tt>).</td>
! </tr>
! </table>
! </ins>
! 
! <p>
! 23.4.4.1 [map.overview] Class template map overview p. 2
! </p>
! <pre>
! <ins>iterator erase(iterator position);</ins>
! iterator erase(const_iterator position);
! size_type erase(const key_type&amp; x);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
! 
! <p>
! 23.4.5.1 [multimap.overview] Class template multimap overview p. 2
! </p>
! <pre>
! <ins>iterator erase(iterator position);</ins>
! iterator erase(const_iterator position);
! size_type erase(const key_type&amp; x);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
! 
! <p>
! 23.4.6.1 [set.overview] Class template set overview p. 2
! </p>
! <pre>
! <ins>iterator erase(iterator position);</ins>
! iterator erase(const_iterator position);
! size_type erase(const key_type&amp; x);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
! 
! <p>
! 23.4.7.1 [multiset.overview] Class template multiset overview 
! </p>
! <pre>
! <ins>iterator erase(iterator position);</ins>
! iterator erase(const_iterator position);
! size_type erase(const key_type&amp; x);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
! 
! <p>
! 23.5.4.1 [unord.map.overview] Class template unordered_map overview p. 3
! </p>
! <pre>
! <ins>iterator erase(iterator position);</ins>
! iterator erase(const_iterator position);
! size_type erase(const key_type&amp; x);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
! 
! <p>
! 23.5.5.1 [unord.multimap.overview] Class template unordered_multimap overview p. 3
! </p>
! <pre>
! <ins>iterator erase(iterator position);</ins>
! iterator erase(const_iterator position);
! size_type erase(const key_type&amp; x);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
! 
! <p>
! 23.5.6.1 [unord.set.overview] Class template unordered_set overview p. 3
! </p>
! <pre>
! <ins>iterator erase(iterator position);</ins>
! iterator erase(const_iterator position);
! size_type erase(const key_type&amp; x);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
! 
! 
! <p>
! 23.5.7.1 [unord.multiset.overview] Class template unordered_multiset overview p. 3
! </p>
! <pre>
! <ins>iterator erase(iterator position);</ins>
! iterator erase(const_iterator position);
! size_type erase(const key_type&amp; x);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
! 
! <p>
! C.2.13 [diff.cpp03.containers] C.2.12 Clause 23: containers library 
! </p>
! <p>
! 23.2.3, 23.2.4
! </p>
! <p>
! Change: Signature changes: from iterator to const_iterator parameters
! </p>
! <p>
! Rationale: Overspecification. Effects: The signatures of the following member functions changed from
! taking an iterator to taking a const_iterator:
! </p>
! <ul>
! <li>insert(iter, val) for vector, deque, list, set, multiset, map, multimap</li>
! <li>insert(pos, beg, end) for vector, deque, list, forward_list</li>
! <li><del>erase(iter) for set, multiset, map, multimap</del></li>
! <li>erase(begin, end) for set, multiset, map, multimap</li>
! <li>all forms of list::splice</li>
! <li>all forms of list::merge</li>
! </ul>
! <p>
! Valid C++ 2003 code that uses these functions may fail to compile with this International Standard.
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2061"></a>2061. <tt>make_move_iterator</tt> and arrays</h3>
! <p><b>Section:</b> 24.3 [iterator.synopsis], 24.5.3 [move.iterators] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Marc Glisse <b>Opened:</b> 2011-05-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.synopsis">issues</a> in [iterator.synopsis].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The standard library always passes template iterators by value and never by reference, 
! which has the nice effect that an array decays to a pointer. There is one exception: 
! <tt>make_move_iterator</tt>.
! </p>
! <blockquote><pre>
! #include &lt;iterator&gt;
! int main(){
!   int a[]={1,2,3,4};
!   std::make_move_iterator(a+4);
!   std::make_move_iterator(a); // fails here
! }
! </pre></blockquote>
! 
! <p><i>[
! 2011 Bloomington.
! ]</i></p>
! 
! 
! <p>
! Move to Ready.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Modify the header <tt>&lt;iterator&gt;</tt> synopsis in 24.3 [iterator.synopsis]:</p>
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   template &lt;class Iterator&gt;
!   move_iterator&lt;Iterator&gt; make_move_iterator(<del>const Iterator&amp;</del><ins>Iterator</ins> i);
! 
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Modify the class template <tt>move_iterator</tt> synopsis in 24.5.3.1 [move.iterator]:</p>
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   template &lt;class Iterator&gt;
!   move_iterator&lt;Iterator&gt; make_move_iterator(<del>const Iterator&amp;</del><ins>Iterator</ins> i);
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Modify 24.5.3.3.14 [move.iter.nonmember]:</p>
! <blockquote><pre>
! template &lt;class Iterator&gt;
! move_iterator&lt;Iterator&gt; make_move_iterator(<del>const Iterator&amp;</del><ins>Iterator</ins> i);
! </pre><blockquote><p>
! -3- <i>Returns</i>: <tt>move_iterator&lt;Iterator&gt;(i)</tt>.
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2063"></a>2063. Contradictory requirements for string move assignment</h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2011-05-29 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 21.4.1 [string.require]&#47;p4 says that <tt>basic_string</tt> is an "allocator-aware" 
! container and behaves as described in 23.2.1 [container.requirements.general].
! <p/>
! 23.2.1 [container.requirements.general] describes move assignment in p7 and Table 99.
! <p/>
! If <tt>allocator_traits&lt;allocator_type&gt;::propagate_on_container_move_assignment::value</tt> 
! is false, and if the allocators stored in the lhs and rhs sides are not equal, then move 
! assigning a string has the same semantics as copy assigning a string as far as resources are 
! concerned (resources can not be transferred). And in this event, the lhs may have to acquire 
! resources to gain sufficient capacity to store a copy of the rhs.
! <p/>
! However 21.4.2 [string.cons]&#47;p22 says:
! </p><blockquote><pre>
! basic_string&lt;charT,traits,Allocator&gt;&amp;
! operator=(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; str) noexcept;
! </pre><blockquote><p>
! <i>Effects</i>: If <tt>*this</tt> and <tt>str</tt> are not the same object, modifies <tt>*this</tt> 
! as shown in Table 71. [<i>Note</i>: A valid implementation is <tt>swap(str)</tt>. &mdash; <i>end note</i> ]
! </p></blockquote></blockquote><p>
! These two specifications for <tt>basic_string::operator=(basic_string&amp;&amp;)</tt> are in conflict with 
! each other. It is not possible to implement a <tt>basic_string</tt> which satisfies both requirements.
! <p/>
! Additionally assign from an rvalue <tt>basic_string</tt> is defined as:
! </p><blockquote><pre>
! basic_string&amp; assign(basic_string&amp;&amp; str) noexcept;
! </pre><blockquote><p>
! <i>Effects</i>: The function replaces the string controlled by <tt>*this</tt> with a string of length 
! <tt>str.size()</tt> whose elements are a copy of the string controlled by <tt>str</tt>. [ <i>Note</i>: A valid 
! implementation is <tt>swap(str)</tt>. &mdash; <i>end note</i> ]
! </p></blockquote></blockquote><p>
! It seems contradictory that this member can be sensitive to <tt>propagate_on_container_swap</tt> instead 
! of <tt>propagate_on_container_move_assignment</tt>.  Indeed, there is a very subtle chance for undefined 
! behavior here:  If the implementation implements this in terms of <tt>swap</tt>, and if 
! <tt>propagate_on_container_swap</tt> is false, and if the two allocators are unequal, the behavior 
! is undefined, and will likely lead to memory corruption.  That's a lot to go wrong under a member 
! named "assign".
! </p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! Alisdair: Can this be conditional <tt>noexcept</tt>?
! </p>
! <p>
! Pablo: We said we were not going to put in many conditional <tt>noexcept</tt>s. Problem is not allocator, but non-normative definition. It says swap is a valid operation which it is not.
! </p>
! <p>
! Dave: Move assignment is not a critical method.
! </p>
! <p>
! Alisdair: Was confusing assignment and construction.
! </p>
! <p>
! Dave: Move construction is critical for efficiency.
! </p>
! <p>
! Kyle: Is it possible to test for <tt>noexcept</tt>.
! </p>
! <p>
! Alisdair: Yes, query the <tt>noexcept</tt> operator.
! </p>
! <p>
! Alisdair: Agreed there is a problem that we cannot unconditionally mark these operations as <tt>noexcept</tt>.
! </p>
! <p>
! Pablo: How come swap is not defined in alloc
! </p>
! <p>
! Alisdair: It is in utility.
! </p>
! <p>
! Pablo: Swap has a conditional <tt>noexcept</tt>. Is no throw move constructable, is no throw move assignable.
! </p>
! <p>
! Pablo: Not critical for strings or containers.
! </p>
! <p>
! Kyle: Why?
! </p>
! <p>
! Pablo: They do not use the default swap.
! </p>
! <p>
! Dave: Important for deduction in other types.
! </p>
! <p>
! Alisdair: Would change the policy we adopted during FDIS mode.
! </p>
! <p>
! Pablo: Keep it simple and get some vendor experience.
! </p>
! <p>
! Alisdair: Is this wording correct? Concerned with bullet 2.
! </p>
! <p>
! Pablo: Where does it reference containers section.
! </p>
! <p>
! Alisdair: String is a container.
! </p>
! <p>
! Alisdair: We should not remove redundancy piecemeal.
! </p>
! <p>
! Pablo: I agree. This is a deviation from rest of string. Missing forward reference to containers section.
! </p>
! <p>
! Pablo: To fix section 2. Only the note needs to be removed. The rest needs to be a forward reference to containers.
! </p>
! <p>
! Alisdair: That is a new issue.
! </p>
! <p>
! Pablo: Not really. Talking about adding one sentence, saying that basic string is a container.
! </p>
! <p>
! Dave: That is not just a forward reference, it is a semantic change.
! </p>
! <p>
! PJ: We intended to make it look like a container, but it did not satisfy all the requirements.
! </p>
! <p>
! Pablo: Clause 1 is correct. Clause 2 is removing note and <tt>noexcept</tt> (do not remove the rest). Clause 3 is correct.
! </p>
! <p>
! Alisdair: Not sure data() is correct (in clause 2).
! </p>
! <p>
! Conclusion: Move to open, Alisdair and Pablo volunteered to provide wording
! </p>
! 
! <p><i>[
! originally proposed wording:
! ]</i></p>
! 
! 
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Modify the class template <tt>basic_string</tt> synopsis in 21.4 [basic.string]:</p>
! <blockquote><pre>
! namespace std {
!   template&lt;class charT, class traits = char_traits&lt;charT&gt;,
!     class Allocator = allocator&lt;charT&gt; &gt;
!   class basic_string {
!   public:
!     [&hellip;]
!     basic_string&amp; operator=(basic_string&amp;&amp; str) <del>noexcept</del>;
!     [&hellip;]
!     basic_string&amp; assign(basic_string&amp;&amp; str) <del>noexcept</del>;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Remove the definition of the <tt>basic_string</tt> move assignment operator from 21.4.2 [string.cons] 
! entirely, including Table 71 &mdash; <tt>operator=(const basic_string&lt;charT, traits, Allocator&gt;&amp;&amp;)</tt>.
! This is consistent with how we define move assignment for the containers in Clause 23:</p>
! <blockquote><pre>
! <del>basic_string&lt;charT,traits,Allocator&gt;&amp;
! operator=(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; str) noexcept;</del>
! </pre><blockquote><p>
! <del>-22- <i>Effects</i>: If <tt>*this</tt> and <tt>str</tt> are not the same object, modifies <tt>*this</tt> as shown 
! in Table 71. [ <i>Note</i>: A valid implementation is <tt>swap(str)</tt>. &mdash; <i>end note</i> ]</del>
! <p/>
! <del>-23- If <tt>*this</tt> and <tt>str</tt> are the same object, the member has no effect.</del>
! <p/>
! <del>-24- <i>Returns</i>: <tt>*this</tt></del>
! </p></blockquote></blockquote>
! <blockquote>
! <table border="1">
! <caption><del>Table 71 &mdash; <tt>operator=(const basic_string&lt;charT, traits, Allocator&gt;&amp;&amp;)</tt></del></caption>
! 
! <tr>
! <th><del>Element</del></th>
! <th><del>Value</del></th>
! </tr>
! 
! <tr>
! <td><del><tt>data()</tt></del></td>
! <td><del>points at the array whose first element was pointed
! at by <tt>str.data()</tt></del></td>
! </tr>
! 
! <tr>
! <td><del><tt>size()</tt></del></td>
! <td><del>previous value of <tt>str.size()</tt></del></td>
! </tr>
! 
! <tr>
! <td><del><tt>capacity()</tt></del></td>
! <td><del>a value at least as large as <tt>size()</tt></del></td>
! </tr>
! 
! </table> 
! </blockquote>
! </li>
! 
! <li><p>Modify the paragraphs prior to 21.4.6.3 [string::assign] p.3 as indicated (The
! first insertion recommends a separate paragraph number for the indicated paragraph):</p>
! <blockquote><pre>
! basic_string&amp; assign(basic_string&amp;&amp; str) <del>noexcept</del>;
! </pre><blockquote><p>
! <ins>-?-</ins> <i>Effects</i>: <ins>Equivalent to <tt>*this = std::move(str)</tt>.</ins>
! <del>The function replaces the string controlled by <tt>*this</tt> with a string of length 
! <tt>str.size()</tt> whose elements are a copy of the string controlled by <tt>str</tt>. 
! [ <i>Note</i>: A valid implementation is <tt>swap(str)</tt>. &mdash; <i>end note</i> ]</del>
! <p/>
! -3- <i>Returns</i>: <tt>*this</tt>
! </p></blockquote></blockquote>
! 
! </li>
! </ol>
! 
! <p><i>[
! 2012-08-11 Joe Gottman observes:
! ]</i></p>
! 
! 
! <blockquote>
! <p>
! One of the effects of <tt>basic_string</tt>'s move-assignment operator (21.4.2 [string.cons], Table 71) is
! </p>
! <blockquote>
! 
! <table border="1">
! 
! <tr>
! <th>Element</th>
! <th>Value</th>
! </tr>
! 
! <tr>
! <td><tt>data()</tt></td>
! <td>points at the array whose first element was pointed at by <tt>str.data()</tt></td>
! </tr>
! 
! </table> 
! 
! </blockquote>
! <p>
! If a string implementation uses the small-string optimization and the input string <tt>str</tt> is small enough 
! to make use of it, this effect is impossible to achieve. To use the small string optimization, a string has to 
! be implemented using something like
! </p>
! <blockquote><pre>
! union
! {
!    char buffer[SMALL_STRING_SIZE];
!    char *pdata;
! };
! </pre></blockquote>
! <p>
! When the string is small enough to fit inside <tt>buffer</tt>, the <tt>data()</tt> member function returns 
! <tt>static_cast&lt;const char *&gt;(buffer)</tt>, and since <tt>buffer</tt> is an array variable, there 
! is no way to implement move so that the moved-to string's <tt>buffer</tt> member variable is equal to 
! <tt>this->buffer</tt>.
! <p/>
! Resolution proposal:
! <p/>
! Change Table 71 to read:
! </p>
! <blockquote>
! 
! <table border="1">
! 
! <tr>
! <th>Element</th>
! <th>Value</th>
! </tr>
! 
! <tr>
! <td><tt>data()</tt></td>
! <td>points at the array <del>whose first element was pointed at by <tt>str.data()</tt></del>
! <ins>that contains the same characters in the same order as <tt>str.data()</tt> contained before 
! <tt>operator=()</tt> was called</ins></td>
! </tr>
! 
! </table> 
! 
! </blockquote>
! <blockquote>
! </blockquote>
! </blockquote>
! 
! <p><i>[2015-05-07, Lenexa]</i></p>
! 
! <p>
! Howard suggests improved wording
! <p/>
! Move to Immediate
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4431.</p>
! 
! <ol>
! <li><p>Modify the class template <tt>basic_string</tt> synopsis in 21.4 [basic.string]:</p>
! <blockquote><pre>
! namespace std {
!   template&lt;class charT, class traits = char_traits&lt;charT&gt;,
!     class Allocator = allocator&lt;charT&gt; &gt;
!   class basic_string {
!   public:
!     [&hellip;]
!     basic_string&amp; assign(basic_string&amp;&amp; str) noexcept<ins>(
!          allocator_traits&lt;Allocator&gt;::propagate_on_container_move_assignment::value ||
!            allocator_traits&lt;Allocator&gt;::is_always_equal::value)</ins>;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 21.4.2 [string.cons]/p21-23:</p>
! <blockquote><pre>
! basic_string&amp;
! operator=(basic_string&amp;&amp; str) noexcept(
!          allocator_traits&lt;Allocator&gt;::propagate_on_container_move_assignment::value ||
!            allocator_traits&lt;Allocator&gt;::is_always_equal::value);
! </pre><blockquote><p>
! -21- <i>Effects</i>: <del>If <tt>*this</tt> and <tt>str</tt> are not the same object, modifies <tt>*this</tt> as shown
! in Table 71. [ <i>Note</i>: A valid implementation is <tt>swap(str)</tt>. &mdash; <i>end note</i> ]</del>
! <ins>Move assigns as a sequence container ([container.requirements]), except that iterators, pointers and references may be invalidated.</ins>
! <p/>
! <del>-22- If <tt>*this</tt> and <tt>str</tt> are the same object, the member has no effect.</del>
! <p/>
! -23- <i>Returns</i>: <tt>*this</tt>
! </p></blockquote></blockquote>
! <blockquote>
! <table border="1">
! <caption><del>Table 71 &mdash; <tt>operator=(basic_string&amp;&amp;)</tt> effects</del></caption>
! 
! <tr>
! <th><del>Element</del></th>
! <th><del>Value</del></th>
! </tr>
! 
! <tr>
! <td><del><tt>data()</tt></del></td>
! <td><del>points at the array whose first element was pointed
! at by <tt>str.data()</tt></del></td>
! </tr>
! 
! <tr>
! <td><del><tt>size()</tt></del></td>
! <td><del>previous value of <tt>str.size()</tt></del></td>
! </tr>
! 
! <tr>
! <td><del><tt>capacity()</tt></del></td>
! <td><del>a value at least as large as <tt>size()</tt></del></td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! 
! <li><p>Modify the paragraphs prior to 21.4.6.3 [string::assign] p.3 as indicated</p>
! <blockquote><pre>
! basic_string&amp; assign(basic_string&amp;&amp; str) noexcept<ins>(
!          allocator_traits&lt;Allocator&gt;::propagate_on_container_move_assignment::value ||
!            allocator_traits&lt;Allocator&gt;::is_always_equal::value)</ins>;
! </pre><blockquote><p>
! -3- <i>Effects</i>: <ins>Equivalent to <tt>*this = std::move(str)</tt>.</ins>
! <del>The function replaces the string controlled by <tt>*this</tt> with a string of length
! <tt>str.size()</tt> whose elements are a copy of the string controlled by <tt>str</tt>.
! [ <i>Note</i>: A valid implementation is <tt>swap(str)</tt>. &mdash; <i>end note</i> ]</del>
! <p/>
! -4- <i>Returns</i>: <tt>*this</tt>
! </p></blockquote></blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2064"></a>2064. More <tt>noexcept</tt> issues in <tt>basic_string</tt></h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2011-05-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The following inconsistencies regarding <tt>noexcept</tt> for <tt>basic_string</tt> are noted.
! <p/>
! Member swap is not marked <tt>noexcept</tt>:
! </p><blockquote><pre>
! void swap(basic_string&amp; str);
! </pre></blockquote><p>
! But the global swap is marked <tt>noexcept</tt>:
! </p><blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
! void swap(basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!           basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <span style="color:#C80000;font-weight:bolder">noexcept</span>;
! </pre></blockquote><p>
! But only in the definition, not in the synopsis.
! <p/>
! All comparison operators are marked <tt>noexcept</tt> in their definitions, but not in the synopsis.
! <p/>
! The compare function that takes a pointer:
! </p><blockquote><pre>
! int compare(const charT *s) const;
! </pre></blockquote><p>
! is not marked <tt>noexcept</tt>. But some of the comparison functions which are marked <tt>noexcept</tt> 
! (only in their definition) are specified to call the throwing compare operator:
! </p><blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator==(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                 const charT* rhs) <span style="color:#C80000;font-weight:bolder">noexcept</span>;
! </pre><blockquote><p>
! <i>Returns</i>: <tt>lhs.compare(rhs) == 0</tt>.
! </p></blockquote></blockquote>
! <p>
! All functions with a narrow contract should not be declared as <tt>noexcept</tt> according to
! the guidelines presented in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3279.pdf">n3279</a>.
! Among these narrow contract functions are the <tt>swap</tt> functions (23.2.1 [container.requirements.general] p. 8) 
! and functions with non-<tt>NULL</tt> <tt>const charT*</tt> parameters.
! </p>
! <p><i>[2011-06-08 Daniel provides wording]</i></p>
! 
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS. Both move-assignment operator and the moving <tt>assign</tt>
! function are not touched by this issue, because they are handled separately by issue <a href="lwg-defects.html#2063">2063</a>.</p>
! <ol>
! <li><p>Modify the header <tt>&lt;string&gt;</tt> synopsis in 21.3 [string.classes] as 
! indicated (Rationale: Adding <tt>noexcept</tt> to these specific overloads is in sync with
! applying the same rule to specific overloads of the member functions <tt>find</tt>, <tt>compare</tt>, etc.
! This approach deviates from that taken in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3279.pdf">n3279</a>,
! but seems more consistent given similar application for comparable member functions):</p>
! 
! <blockquote><pre>
! #include &lt;initializer_list&gt;
! 
! namespace std {
! 
!   [&hellip;]
!   template&lt;class charT, class traits, class Allocator&gt;
!     bool operator==(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                     const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <ins>noexcept</ins>;
!   [&hellip;]
!   template&lt;class charT, class traits, class Allocator&gt;
!     bool operator!=(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                     const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <ins>noexcept</ins>;
!   [&hellip;]
! 
!   template&lt;class charT, class traits, class Allocator&gt;
!     bool operator&lt;(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                    const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <ins>noexcept</ins>;
!   [&hellip;]
!   template&lt;class charT, class traits, class Allocator&gt;
!     bool operator&gt;(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                    const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <ins>noexcept</ins>;
!   [&hellip;]
! 
!   template&lt;class charT, class traits, class Allocator&gt;
!     bool operator&lt;=(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                     const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <ins>noexcept</ins>;
!   [&hellip;]
!   template&lt;class charT, class traits, class Allocator&gt;
!     bool operator&gt;=(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                     const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <ins>noexcept</ins>;
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Modify the class template <tt>basic_string</tt> synopsis in 21.4 [basic.string] as 
! indicated (Remark 1: The <tt>noexcept</tt> at the move-constructor is fine, because even for a
! small-object optimization there is no problem here, because <tt>basic_string::value_type</tt>
! is required to be a non-array POD as of 21.1 [strings.general] p1, Remark 2: This
! proposal removes the <tt>noexcept</tt> at single character overloads of <tt>find</tt>, <tt>rfind</tt>,
! etc. because they are defined in terms of potentially allocating functions. It seems like
! an additional issue to me to change the semantics in terms of non-allocating functions and
! adding <tt>noexcept</tt> instead):</p>
! 
! <blockquote><pre>
! namespace std {
!   template&lt;class charT, class traits = char_traits&lt;charT&gt;,
!     class Allocator = allocator&lt;charT&gt; &gt;
!   class basic_string {
!   public:
!     [&hellip;]
!     <i>// [string.ops], string operations:</i>
!     [&hellip;]
!     size_type find (charT c, size_type pos = 0) const <del>noexcept</del>;
!     [&hellip;]
!     size_type rfind(charT c, size_type pos = npos) const <del>noexcept</del>;
!     [&hellip;]
!     size_type find_first_of(charT c, size_type pos = 0) const <del>noexcept</del>;
!     [&hellip;]
!     size_type find_last_of (charT c, size_type pos = npos) const <del>noexcept</del>;
!     [&hellip;]
!     size_type find_first_not_of(charT c, size_type pos = 0) const <del>noexcept</del>;
!     [&hellip;]
!     size_type find_last_not_of (charT c, size_type pos = npos) const <del>noexcept</del>;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.7.2 [string::find] before p5 and before p7 as indicated:</p>
! 
! <blockquote><pre>
! size_type find(const charT* s, size_type pos = 0) const <del>noexcept</del>;
! [&hellip;]
! size_type find(charT c, size_type pos = 0) const <del>noexcept</del>;
! </pre><blockquote><p>
! -7- <i>Returns</i>: <tt>find(basic_string&lt;charT,traits,Allocator&gt;(1,c), pos)</tt>.
! </p></blockquote></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.7.3 [string::rfind] before p7 as indicated:</p>
! 
! <blockquote><pre>
! size_type rfind(charT c, size_type pos = npos) const <del>noexcept</del>;
! </pre><blockquote><p>
! -7- <i>Returns</i>: <tt>rfind(basic_string&lt;charT,traits,Allocator&gt;(1,c),pos)</tt>.
! </p></blockquote></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.7.4 [string::find.first.of] before p7 as indicated:</p>
! 
! <blockquote><pre>
! size_type find_first_of(charT c, size_type pos = 0) const <del>noexcept</del>;
! </pre><blockquote><p>
! -7- <i>Returns</i>: <tt>find_first_of(basic_string&lt;charT,traits,Allocator&gt;(1,c), pos)</tt>.
! </p></blockquote></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.7.5 [string::find.last.of] before p7 as indicated:</p>
! 
! <blockquote><pre>
! size_type find_last_of(charT c, size_type pos = npos) const <del>noexcept</del>;
! </pre><blockquote><p>
! -7- <i>Returns</i>: <tt>find_last_of(basic_string&lt;charT,traits,Allocator&gt;(1,c),pos)</tt>.
! </p></blockquote></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.7.6 [string::find.first.not.of] before p7 as indicated:</p>
! 
! <blockquote><pre>
! size_type find_first_not_of(charT c, size_type pos = 0) const <del>noexcept</del>;
! </pre><blockquote><p>
! -7- <i>Returns</i>: <tt>find_first_not_of(basic_string(1, c), pos)</tt>.
! </p></blockquote></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.7.7 [string::find.last.not.of] before p7 as indicated:</p>
! 
! <blockquote><pre>
! size_type find_last_not_of(charT c, size_type pos = npos) const <del>noexcept</del>;
! </pre><blockquote><p>
! -7- <i>Returns</i>: <tt>find_last_not_of(basic_string(1, c), pos)</tt>.
! </p></blockquote></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.8.2 [string::operator==] before p2+p3 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator==(const charT* lhs,
!                 const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <del>noexcept</del>;
! 
! [&hellip;]
! 				
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator==(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                 const charT* rhs) <del>noexcept</del>;
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.8.3 [string::op!=] before p2+p3 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator!=(const charT* lhs,
!                 const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <del>noexcept</del>;
! 
! [&hellip;]
! 				
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator!=(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                 const charT* rhs) <del>noexcept</del>;
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.8.4 [string::op&lt;] before p2+p3 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator&lt;(const charT* lhs,
!                const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <del>noexcept</del>;
! 
! [&hellip;]
! 				
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator&lt;(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                const charT* rhs) <del>noexcept</del>;
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.8.5 [string::op&gt;] before p2+p3 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator&gt;(const charT* lhs,
!                const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <del>noexcept</del>;
! 
! [&hellip;]
! 				
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator&gt;(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                const charT* rhs) <del>noexcept</del>;
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.8.6 [string::op&lt;=] before p2+p3 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator&lt;=(const charT* lhs,
!                 const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <del>noexcept</del>;
! 
! [&hellip;]
! 				
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator&lt;=(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                 const charT* rhs) <del>noexcept</del>;
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.8.7 [string::op&gt;=] before p2+p3 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator&gt;=(const charT* lhs,
!                 const basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <del>noexcept</del>;
! 
! [&hellip;]
! 				
! template&lt;class charT, class traits, class Allocator&gt;
! bool operator&gt;=(const basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!                 const charT* rhs) <del>noexcept</del>;
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Modify 21.4.8.8 [string.special] as indicated (Remark: The change of
! the semantics guarantees as of 17.5.1.4 [structure.specifications] p4 that 
! the "Throws: Nothing" element of member swap is implied):</p>
! 
! <blockquote><pre>
! template&lt;class charT, class traits, class Allocator&gt;
!   void swap(basic_string&lt;charT,traits,Allocator&gt;&amp; lhs,
!     basic_string&lt;charT,traits,Allocator&gt;&amp; rhs) <del>noexcept</del>;
! </pre><blockquote><p>
! -1- Effects: <ins>Equivalent to</ins> <tt>lhs.swap(rhs);</tt>
! </p></blockquote></blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2065"></a>2065. Minimal allocator interface</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-06-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The example in 17.6.3.5 [allocator.requirements] says <tt>SimpleAllocator</tt> satisfies
! the requirements of Table 28 &mdash; Allocator requirements, but it doesn't support comparison 
! for equality&#47;inequality.
! </p>
! 
! <p><i>[Bloomington, 2011]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Modify the example in 17.6.3.5 [allocator.requirements] p5 as indicated:</p>
! <blockquote><p>
! -5- [&hellip;]
! <p/>
! [ <i>Example</i>: the following is an allocator class template supporting the minimal interface 
! that satisfies the requirements of Table 28:
! </p><blockquote><pre>
! template &lt;class Tp&gt;
! struct SimpleAllocator {
!   typedef Tp value_type;
!   SimpleAllocator(<i>ctor args</i>);
!   template &lt;class T&gt; SimpleAllocator(const SimpleAllocator&lt;T&gt;&amp; other);
!   Tp *allocate(std::size_t n);
!   void deallocate(Tp *p, std::size_t n);
! };
! 
! <ins>template &lt;class T, class U&gt;
! bool operator==(const SimpleAllocator&lt;T&gt;&amp;, const SimpleAllocator&lt;U&gt;&amp;);
! template &lt;class T, class U&gt;
! bool operator!=(const SimpleAllocator&lt;T&gt;&amp;, const SimpleAllocator&lt;U&gt;&amp;);</ins>
! </pre></blockquote><p>
! &mdash; <i>end example</i> ]
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2066"></a>2066. Missing specification of <tt>vector::resize(size_type)</tt></h3>
! <p><b>Section:</b> 23.3.6.3 [vector.capacity] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Rani Sharoni <b>Opened:</b> 2011-03-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In C++1x (N3090) there are two version of <tt>vector::resize</tt> &mdash; 23.3.6.3 [vector.capacity]:
! </p>
! <blockquote><pre>
! void resize(size_type sz);
! void resize(size_type sz, const T&amp; c);
! </pre></blockquote>
! <p>
! The text in 23.3.6.3 [vector.capacity]&#47;12 only mentions "no effects on throw" for the
! two args version of resize:
! </p><blockquote><p>
! <i>Requires</i>: If an exception is thrown other than by the move constructor
! of a non-<tt>CopyConstructible</tt> <tt>T</tt> there are no effects.
! </p></blockquote><p>
! This seems like unintentional oversight since <tt>resize(size)</tt> is
! semantically the same as <tt>resize(size, T())</tt>.
! Additionally, the C++03 standard only specify single version of resize
! with default for the second argument - 23.2.4:
! </p>
! <blockquote><pre>
! void resize(size_type sz, T c = T());
! </pre></blockquote>
! <p>
! Therefore not requiring same guarantees for both version of resize is
! in fact a regression.
! </p>
! 
! <p><i>[2011-06-12: Daniel comments]</i></p>
! 
! 
! <p>The proposed resolution for issue <a href="lwg-defects.html#2033">2033</a> should solve this issue as well.</p>
! 
! <p><i>[
! 2011 Bloomington
! ]</i></p>
! 
! 
! <p>
! This issue will be resolved by issue <a href="lwg-defects.html#2033">2033</a>, and closed when this issue is applied. 
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Resolved by adopting the resolution in issue <a href="lwg-defects.html#2033">2033</a> at this meeting.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>Apply the proposed resolution of issue <a href="lwg-defects.html#2033">2033</a></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2067"></a>2067. <tt>packaged_task</tt> should have deleted copy c'tor with const parameter</h3>
! <p><b>Section:</b> 30.6.9 [futures.task] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-06-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task">issues</a> in [futures.task].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Class template <tt>packaged_task</tt> is a move-only type with the following form of the
! deleted copy operations:
! </p>
! <blockquote><pre>
! packaged_task(packaged_task&amp;) = delete;
! packaged_task&amp; operator=(packaged_task&amp;) = delete;
! </pre></blockquote>
! <p>
! Note that the argument types are non-const. This does not look like a typo to me,
! this form seems to exist from the very first proposing paper on 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2276.html">N2276</a>.
! Using either of form of the copy-constructor did not make much difference before the 
! introduction of defaulted special member functions, but it makes now an observable 
! difference. This was brought to my attention by a question on a German C++ newsgroup 
! where the question was raised why the following code does not compile on a recent
! gcc:
! </p>
! <blockquote><pre>
! #include &lt;utility&gt;
! #include &lt;future&gt;
! #include &lt;iostream&gt;
! #include &lt;thread&gt;
! 
! int main(){
!   std::packaged_task&lt;void()&gt; someTask([]{ std::cout &lt;&lt; std::this_thread::get_id() &lt;&lt; std::endl; });
!   std::thread someThread(std::move(someTask)); // <span style="color:#C80000">Error here</span>
!   // Remainder omitted
! }
! </pre></blockquote>
! <p>
! It turned out that the error was produced by the instantiation of some return type
! of <tt>std::bind</tt> which used a defaulted copy-constructor, which leads to a
! const declaration conflict with [class.copy] p8.
! <p/>
! Some aspects of this problem are possibly core-language related, but I consider it
! more than a service to programmers, if the library would declare the usual form of
! the copy operations (i.e. those with const first parameter type) as deleted for
! <tt>packaged_task</tt> to prevent such problems.
! <p/>
! A similar problem exists for class template <tt>basic_ostream</tt> in 27.7.3.1 [ostream]:
! </p>
! <blockquote><pre>
! namespace std {
!   template &lt;class charT, class traits = char_traits&lt;charT&gt; &gt;
!   class basic_ostream : virtual public basic_ios&lt;charT,traits&gt; {
!     [&hellip;]
! 
!     // 27.7.3.3 Assign/swap
!     basic_ostream&amp; operator=(basic_ostream&amp; rhs) = delete;
!     basic_ostream&amp; operator=(const basic_ostream&amp;&amp; rhs);
!     void swap(basic_ostream&amp; rhs);
! };
! </pre></blockquote>
! <p>
! albeit this could be considered as an editorial swap of copy and move
! assignment operator, I suggest to fix this as part of this issue as well.
! </p>
! 
! <p><i>[
! 2011 Bloomington.
! ]</i></p>
! 
! 
! <p>
! Move to Ready.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! <ol>
! <li><p>Modify the class template <tt>basic_ostream</tt> synopsis in 27.7.3.1 [ostream]
! as indicated (Note: The prototype signature of the move assignment operator in 27.7.3.3 [ostream.assign]
! is fine):</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class charT, class traits = char_traits&lt;charT&gt; &gt;
!   class basic_ostream : virtual public basic_ios&lt;charT,traits&gt; {
!     [&hellip;]
! 
!     // 27.7.3.3 Assign/swap
!     basic_ostream&amp; operator=(<ins>const</ins> basic_ostream&amp; rhs) = delete;
!     basic_ostream&amp; operator=(<del>const</del> basic_ostream&amp;&amp; rhs);
!     void swap(basic_ostream&amp; rhs);
! };
! </pre></blockquote>
! </li>
! 
! <li><p>Modify the class template <tt>packaged_task</tt> synopsis in 30.6.9 [futures.task] p2
! as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template&lt;class&gt; class packaged_task; <i>// undefined</i>
! 
!   template&lt;class R, class... ArgTypes&gt;
!   class packaged_task&lt;R(ArgTypes...)&gt; {
!   public:
!     [&hellip;]
!   
!     <i>// no copy</i>
!     packaged_task(<ins>const</ins> packaged_task&amp;) = delete;
!     packaged_task&amp; operator=(<ins>const</ins> packaged_task&amp;) = delete;
!     
!     [&hellip;]
!   };
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2069"></a>2069. Inconsistent exception spec for <tt>basic_string</tt> move constructor</h3>
! <p><b>Section:</b> 21.4.2 [string.cons] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2011-07-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.cons">issues</a> in [string.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Sub-clause 21.4.2 [string.cons] contains these constructors in paragraphs 2 and 3:
! </p>
! <blockquote><pre>
! basic_string(const basic_string&lt;charT,traits,Allocator&gt;&amp; str);
! basic_string(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; str) noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -3- <i>Throws</i>: The second form throws nothing if the allocator's move constructor throws nothing.
! </p></blockquote></blockquote>
! <p>
! How can it <i>ever</i> throw anything if it is marked <tt>noexcept</tt>?
! </p>
! <p><i>[2011-07-11: Daniel comments and suggests wording changes]</i></p>
! 
! <p>
! Further, according to paragraph 18 of the same sub-clause:
! </p>
! <blockquote><pre>
! basic_string(const basic_string&amp; str, const Allocator&amp; alloc);
! basic_string(basic_string&amp;&amp; str, const Allocator&amp; alloc);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -18- <i>Throws</i>: The second form throws nothing if <tt>alloc == str.get_allocator()</tt> 
! unless the copy constructor for <tt>Allocator</tt> throws.
! </p>
! </blockquote></blockquote>
! <p>
! The constraint &quot;unless the copy constructor for <tt>Allocator</tt> throws&quot;
! is redundant, because according to Table 28 &mdash; Allocator requirements, the expressions
! </p>
! <blockquote><pre>
! X a1(a);
! X a(b);
! </pre></blockquote>
! <p>
! impose the requirement: &quot;Shall not exit via an exception&quot;.
! </p>
! 
! <p><i>[
! 2011 Bloomington.
! ]</i></p>
! 
! 
! <p>
! Move to Ready.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Change 21.4.2 [string.cons] p3 as indicated (This move constructor has a wide
! contract and is therefore safely marked as <tt>noexcept</tt>):</p>
! 
! <blockquote><pre>
! basic_string(const basic_string&lt;charT,traits,Allocator&gt;&amp; str);
! basic_string(basic_string&lt;charT,traits,Allocator&gt;&amp;&amp; str) noexcept;
! </pre><blockquote>
! <p>
! -2- <i>Effects</i>: Constructs an object of class <tt>basic_string</tt> as indicated in Table 64. 
! In the second form, <tt>str</tt> is left in a valid state with an unspecified value.
! <p/>
! <del>-3- <i>Throws</i>: The second form throws nothing if the allocator's move constructor throws nothing.</del>
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 21.4.2 [string.cons] p18 as indicated (This move-like constructor may throw,
! if the allocators don't compare equal, but not because of a potentially throwing allocator
! copy constructor, only because the allocation attempt may fail and throw an exception):</p>
! 
! <blockquote><pre>
! basic_string(const basic_string&amp; str, const Allocator&amp; alloc);
! basic_string(basic_string&amp;&amp; str, const Allocator&amp; alloc);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -18- <i>Throws</i>: The second form throws nothing if <tt>alloc == str.get_allocator()</tt> 
! <del>unless the copy constructor for <tt>Allocator</tt> throws</del>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2071"></a>2071. <tt>std::valarray</tt> move-assignment</h3>
! <p><b>Section:</b> 26.6.2.3 [valarray.assign] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Paolo Carlini <b>Opened:</b> 2011-05-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#valarray.assign">issues</a> in [valarray.assign].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Yesterday I noticed that the language we have in the FDIS about <tt>std::valarray</tt> move assignment 
! is inconsistent with the resolution of LWG 675. Indeed, we guarantee constant complexity (vs linear 
! complexity). We also want it to be noexcept, that is more subtle, but again it's at variance with all 
! the containers.
! <p/>
! Also, even if we suppose that LWG <a href="lwg-defects.html#675">675</a> applies only to the containers proper, I don't think the current 
! "as if by calling resize(v.size())" is internally consistent with the noexcept requirement.
! <p/>
! So, what do we really want for <tt>std::valarray</tt>? Shall we maybe just strike or fix the as-if, consider it 
! some sort of pasto from the copy-assignment text, thus keep the noexcept and constant complexity requirements 
! (essentially the whole operation would boild down to a swap of POD data members). Or LWG <a href="lwg-defects.html#675">675</a> should be 
! explicitly extended to <tt>std::valarray</tt> too? In that case both noexcept and constant complexity 
! would go, I think, and the operation would boil down to the moral equivalent of <tt>clear()</tt> (which 
! doesn't really exist in this case) + <tt>swap</tt>?
! </p>
! 
! <p>
! Howard: I agree the current wording is incorrect.  The complexity should be linear in <tt>size()</tt> (not 
! <tt>v.size()</tt>) because the first thing this operator needs to do is <tt>resize(0)</tt> (or <tt>clear()</tt> 
! as you put it).
! <p/>
! I think we can keep the <tt>noexcept</tt>.
! <p/>
! As for proper wording, here's a first suggestion:
! </p><blockquote><p>
! <i>Effects</i>: <tt>*this</tt> obtains the value of <tt>v</tt>. The value of <tt>v</tt> after the assignment 
! is not specified.
! <p/>
! <i>Complexity</i>: linear.
! </p></blockquote><p>
! </p>
! 
! <p>
! See also reflector discussion starting with c++std-lib-30690.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Ready.
! </p>
! <p>
! Some discussion on the types supported by <tt>valarray</tt> concludes that the wording is
! trying to say something similar to the core wording for trivial types, but significantly
! predates it, and does allow for types with non-trivial destructors.  Howard notes that
! the only reason for linear complexity, rather than constant, is to support types with
! non-trivial destructors.
! </p>
! <p>
! AJM suggests replacing the word 'value' with 'state', but straw poll prefers moving
! forward with the current wording, 5 to 2.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>In 26.6.2.3 [valarray.assign] update as follows:</p>
! 
! <blockquote><pre>
! valarray&lt;T&gt;&amp; operator=(valarray&lt;T&gt;&amp;&amp; v) noexcept;
! </pre><blockquote><p>
! 3 <i>Effects</i>: <tt>*this</tt> obtains the value of <tt>v</tt>. <del>If the length of <tt>v</tt> 
! is not equal to the length of <tt>*this</tt>, resizes <tt>*this</tt> to make the two arrays the 
! same length, as if by calling <tt>resize(v.size())</tt>, before performing the assignment.</del><ins>The 
! value of <tt>v</tt> after the assignment is not specified.</ins>
! <p/>
! 4 <i>Complexity</i>: <del>Constant</del><ins>Linear</ins>.
! </p></blockquote></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2074"></a>2074. Off by one error in <tt>std::reverse_copy</tt></h3>
! <p><b>Section:</b> 25.3.10 [alg.reverse] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Peter Miller <b>Opened:</b> 2011-08-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.reverse">issues</a> in [alg.reverse].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The output of the program below should be:
! </p>
! <blockquote><pre>
! "three two one null \n"
! </pre></blockquote>
! <p>
! But when <tt>std::reverse_copy</tt> is implemented as described in N3291 25.3.10 [alg.reverse] 
! it's:
! </p>
! <blockquote><pre>
! "null three two one \n"
! </pre></blockquote>
! <p>
! because there's an off by one error in 25.3.10 [alg.reverse]&#47;4; the definition should read:
! </p>
! <blockquote><pre>
! *(result + (last - first) <span style="color:#C80000;font-weight:bold">- 1</span> - i) = *(first + i)
! </pre></blockquote>
! <p>
! Test program:
! </p>
! <blockquote><pre>
! #include &lt;algorithm&gt;
! #include &lt;iostream&gt;
! 
! template &lt;typename BiIterator, typename OutIterator&gt;
! auto
! reverse_copy_as_described_in_N3291(
!   BiIterator first, BiIterator last, OutIterator result )
! -&gt; OutIterator
! {
!   // 25.3.10&#47;4 [alg.reverse]:
!   // "...such that for any non-negative integer i &lt; (last - first)..."
!   for ( unsigned i = 0; i &lt; ( last - first ); ++i )
!     // "...the following assignment takes place:"
!     *(result + (last - first) - i) = *(first + i);
! 
!   // 25.3.10&#47;6
!   return result + (last - first);
! }
! 
! int main()
! {
!   using std::begin;
!   using std::end;
!   using std::cout;
! 
!   static const char*const in[3]  { "one", "two", "three" };
!   const char*             out[4] { "null", "null", "null", "null" };
! 
!   reverse_copy_as_described_in_N3291( begin( in ), end( in ), out );
! 
!   for ( auto s : out )
!     cout &lt;&lt; s &lt;&lt; ' ';
! 
!   cout &lt;&lt; std::endl;
! 
!   return 0;
! }
! </pre></blockquote>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Ready.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>
! Change 25.3.10 [alg.reverse] p4 as follows:
! </p> 
! <blockquote><pre>
! template&lt;class BidirectionalIterator, class OutputIterator&gt;
!   OutputIterator
!     reverse_copy(BidirectionalIterator first,
!                  BidirectionalIterator last, OutputIterator result);
! </pre><blockquote><p>
! -4- <i>Effects</i>: Copies the range [<tt>first,last</tt>) to the range [<tt>result,result+(last-first)</tt>) 
! such that for any non-negative integer <tt>i &lt; (last - first)</tt> the following assignment takes place: 
! <tt>*(result + (last - first) <ins>- 1</ins> - i) = *(first + i)</tt>.
! <p/>
! -5- <i>Requires</i>: The ranges [<tt>first,last</tt>) and [<tt>result,result+(last-first)</tt>) shall not overlap.
! <p/>
! -6- <i>Returns</i>: <tt>result + (last - first)</tt>.
! <p/>
! -7- <i>Complexity</i>: Exactly <tt>last - first</tt> assignments.
! </p></blockquote></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2075"></a>2075. Progress guarantees, lock-free property, and scheduling assumptions</h3>
! <p><b>Section:</b> 1.10 [intro.multithread], 29.4 [atomics.lockfree], 29.6.5 [atomics.types.operations.req] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Torvald Riegel <b>Opened:</b> 2011-08-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! According to 1.10 [intro.multithread] p2: 
! </p>
! <blockquote><p>
! "Implementations should ensure that all unblocked threads eventually make progress."
! </p></blockquote>
! <ul>
! <li>If taken literally, this cannot be achieved with lock-free atomics in
!  general because they only guarantee that some thread makes progress
!  (i.e., minimal progress, whereas 1.10 [intro.multithread] p2 seems to 
!  require maximal progress).
! </li>
! <li>What does it mean precisely to "make progress"? Does "unblocked
!  threads" exclude live-locked threads (if so, lock-free atomics would
!  be sufficient I suppose)?
! </li>
! <li><p>Which assumptions can an implementation make about the thread
!  scheduling? This is relevant for how implementations implement
!  compare-exchange with load-linked &#47; store conditional (LL-SC), and
!  atomic read-modifiy-write operations with load...compare-exchange-weak
!  loops.
! </p>
! <ul>
! <li>Do threads run long enough without being descheduled (e.g.,
!    OS timeslices are long enough, interrupt frequency is not too
!    high, etc.)?
! </li>
! <li>Or is this implementation-defined, and the sentence is just about
!    stating that the progress guarantees will not hold on, for example,
!    systems with unfair scheduling or thread priorities?
! </li>
! </ul>
! </li>
! </ul>
! 
! <p>
! 29.4 [atomics.lockfree] p2 declares the lock-free property for a
! particular object. However, "lock-free" is never defined, and in discussions 
! that I had with committee members it seemed as if the standard's lock-free would be
! different from what lock-free means in other communities (eg, research,
! text books on concurrent programming, etc.).
! </p>
! <ul>
! <li>Originally, lock-freedom for an object requires minimal progress (ie,
!  some thread makes progress, but other threads might never do) without
!  any assumptions about the scheduling (threads could be stopped
!  executing (so it is "nonblocking"), and threads are not guaranteed to
!  execute in isolation, even for very small intervals of cycles).
! </li>
! <li>In contrast, obstruction-freedom, another nonblocking progress
!  condition, guarantees progress for all threads that eventually get
!  executed long enough in isolation (ie, without interference by other
!  threads).
! </li>
! <li>Simple load...compare-exchange-weak loops (or LL-SC loops) to
!  implement atomic read-modify-write operations can be just
!  obstruction-free but not lock-free because they can livelock
!  (depending on the hardware's LL-SC implementation, though). However,
!  they effectively guarantee the same as lock-free iff threads will
!  eventually run in isolation for long enough (that can be an assumption
!  about the OS scheduler), or if the implementation adds this (e.g.,
!  probabilistically by employing randomized exponential back-off when
!  contention is detected, in all operations that can create contention).
! </li>
! <li>Does the particular object has to be lock-free, or is it only required
!  that threads make progress irrespective on which object? Again
!  considering compare-exchange-weak or LL-SC here, what happens if the
!  compare-exchange object shares a cacheline with an integer counter
!  object that is constantly updated by other threads? The
!  compare-exchange-weak can always fail, so the object would not be
!  lock-free. However, if we consider progress to be overall progress for
!  threads, it would be lock-free because other threads succeed updating
!  the integer counter. I would have assumed the lock-free property is
!  strictly about the atomic object, but in discussions with committee
!  members it seemed as if progress for any object could be the intended
!  guarantee.
! </li>
! </ul>
! 
! <p>
! Following 29.6.5 [atomics.types.operations.req] p7 <tt>is_lock_free()</tt> 
! returns "true if the object is lock-free". What is returned if the object is only 
! sometimes lock-free?
! </p>
! 
! <p>
! Basically, I would like to see clarifications for the progress
! guarantees so that users know what they can expect from implementations
! (and what they cannot expect!), and to give implementors a clearer
! understanding of which user expectations they have to implement.
! </p>
! <ol>
! <li><p>Elaborate on the intentions of the progress guarantee in 
! 1.10 [intro.multithread] p2. As I don't know about your intentions, 
! it's hard to suggest a resolution.
! </p>
! <ul>
! <li>Is it for straightforward, non-synchronizing code only?</li>
! <li>Is it for blocking code only? (Is "unblocked" more than blocked on
!  external I/O or on deadlocks?)
! </li>
! <li>What does it mean to "make progress"?</li>
! <li>Is this meant to only waive any progress guarantees if there are
!  thread priorities?
! </li>
! <li>Can an implementation make any assumptions about thread scheduling?
! </li>
! </ul>
! </li>
! <li><p>Define the lock-free property. The definition should probably include
! the following points:
! </p>
! <ul>
! <li>Is it just nonblocking, or what is the distinction to just being nonblocking?</li>
! <li>Does it make any assumptions about the scheduler?</li>
! <li>What are the progress guarantees, minimal or maximal (some or all threads finish eventually).</li>
! <li>Is progress guaranteed for all operations on the particular object, or
!  do operations on other objects also count as "making progress"?
! </li>
! </ul>
! </li>
! <li>Add a note explaining that compare-exchange-weak is not necessarily
! lock-free (but is nonblocking)? Or is it indeed intended to be lock-free
! (only allowed to fail spuriously but guaranteed to not fail eventually)?
! Implementing the latter might be a challenge on LL-SC machines or lead
! to space overheads I suppose, see the cacheline sharing example above.
! </li>
! </ol>
! 
! <p><i>[2011-12-01: Hans comments]</i></p>
! 
! 
! <p>
! 1.10 [intro.multithread] p2 was an intentional compromise, and it was understood at the 
! time that it was not a precise statement.  The wording was introduced by 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3209.htm">N3209</a>, which 
! discusses some of the issues. There were additional reflector discussions.
! <p/>
! This is somewhat separable from the question of what lock-free means, which is probably a more 
! promising question to focus on.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! General direction: lock-free means obstruction-free. Leave the current "should" recommendation 
! for progress. It would take a lot of effort to try to do better. 
! </p>
! 
! 
! <p><i>[2012, Portland: move to Open]</i></p>
! 
! <p>
! The current wording of 1.10 [intro.multithread] p2 doesn't really say very much.
! As far as we can tell the term <i>lock-free</i> is nowhere defined in the standard.
! </p>
! <p>
! James: we would prefer a different way to phrase it.
! </p>
! <p>
! Hans: the research literature includes the term <i>abstraction-free</i> which might be a better fit.
! </p>
! <p>
! Detlef: does Posix define a meaning for blocking (or locking) that we could use?
! </p>
! <p>
! Hans: things like compare-exchange-strong can wait indefinitely.
! </p>
! <p>
! Niklas: what about spin-locks -- still making no progress.
! </p>
! <p>
! Hans: suspect we can only give guidance, at best. The lock-free meaning from the theoretical commmunity (forard progress will be made) is probably too strong here.
! </p>
! <p>
! Atrur: what about livelocks?
! </p>
! <p>
! Hans: each atomic <i>modification</i> completes, even if the whole thing is blocked.
! </p>
! <p>
! Moved to open.
! </p>
! 
! <p><i>[2013-11-06: Jason Hearne-McGuiness comments]</i></p>
! 
! 
! <p>
! Related to this issue, the wording in 29.4 [atomics.lockfree] p2,
! </p>
! <blockquote><p>
! In any given program execution, the result of the lock-free query
! shall be consistent for all pointers of the same type.
! </p></blockquote>
! <p>
! should be made clearer, because the object-specific (non-static) nature of the <tt>is_lock_free()</tt> functions 
! from 29.5 [atomics.types.generic] and 29.6 [atomics.types.operations] imply that for different 
! instances of pointers of the same type the returned value could be different.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p><i>[2014-02-16 Issaquah: Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3927.html">n3927</a>]</i></p>
! 
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2076"></a>2076. Bad <tt>CopyConstructible</tt> requirement in set constructors</h3>
! <p><b>Section:</b> 23.4.6.2 [set.cons] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jens Maurer <b>Opened:</b> 2011-08-20 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 23.4.6.2 [set.cons] paragraph 4 says: 
! </p>
! 
! <blockquote><p>
! <i>Requires</i>: If the iterator's dereference operator returns an lvalue or a non-const rvalue, 
! then <tt>Key</tt> shall be <tt>CopyConstructible</tt>.
! </p></blockquote>
! 
! <p>
! I'm confused why a "non-const rvalue" for the return value of the iterator
! would require <tt>CopyConstructible</tt>; isn't that exactly the situation 
! when you'd want to apply the move constructor?
! <p/>
! The corresponding requirement for <tt>multimap</tt> seems better in that regard
! ([multimap.cons] paragraph 3):
! </p>
! <blockquote><p>
! Requires: If the iterator's dereference operator returns an lvalue or a const rvalue 
! <tt>pair&lt;key_type, mapped_type&gt;</tt>, then both <tt>key_type</tt> and mapped_type 
! shall be <tt>CopyConstructible</tt>.
! </p></blockquote>
! <p>
! Obviously, if I have a const rvalue, I can't apply the move constructor (which will 
! likely attempt modify its argument).
! <p/>
! Dave Abrahams:
! <p/>
! I think you are right.
! Proposed resolution: drop "non-" from 23.4.6.2 [set.cons] paragraph 3.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! The wording is in this area will be affected by Pablo's paper being adopted at this meeting.
! Wait for that paper to be applied before visiting this issue - deliberately leave in New
! status until the next meeting.
! </p>
! 
! <p><strong>Proposed resolution from Kona 2012:</strong></p>
! <blockquote class="note">
! <p>This wording is relative to the FDIS.</p>
! 
! <p>
! Change 23.4.6.2 [set.cons] p3 as follows:
! </p> 
! <blockquote><pre>
! template &lt;class InputIterator&gt;
!   set(InputIterator first, InputIterator last,
!     const Compare&amp; comp = Compare(), const Allocator&amp; = Allocator());
! </pre><blockquote><p>
! -3- Effects: Constructs an empty set using the specified comparison object and allocator, and inserts
! elements from the range [<tt>first,last</tt>).
! <p/>
! -4- <i>Requires</i>: If the iterator's dereference operator returns an lvalue or a <del>non-</del>const rvalue, 
! then <tt>Key</tt> shall be <tt>CopyConstructible</tt>.
! <p/>
! -5- <i>Complexity</i>: Linear in <tt>N</tt> if the range [<tt>first,last</tt>) is already sorted using 
! <tt>comp</tt> and otherwise <tt>N logN</tt>, where <tt>N</tt> is <tt>last - first</tt>.
! </p></blockquote></blockquote>
! </blockquote>
! 
! <p><i>[2014-05-18, Daniel comments]</i></p>
! 
! <p>
! According to Pablo, the current P/R correctly incorporates the changes from his paper (which was adopted in Kona)
! </p>
! 
! <p><i>[2014-06-10, STL comments and suggests better wording]</i></p>
! 
! <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1858.html">N1858</a> was voted into WP 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2284.pdf">N2284</a> but was 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2283.html">"(reworded)"</a>, introducing the "non-const" damage.
! <p/>
! N1858 wanted to add this for map:
! </p>
! <blockquote><p>
! <i>Requires</i>: Does not require <tt>CopyConstructible</tt> of either <tt>key_type</tt> or <tt>mapped_type</tt> if the dereferenced 
! <tt>InputIterator</tt> returns a non-const rvalue <tt>pair&lt;key_type, mapped_type&gt;</tt>. Otherwise <tt>CopyConstructible</tt> 
! is required for both <tt>key_type</tt> and <tt>mapped_type</tt>.
! </p></blockquote>
! <p>
! And this for set:
! </p>
! <blockquote><p>
! <i>Requires</i>: <tt>Key</tt> must be <tt>CopyConstructible</tt> only if the dereferenced <tt>InputIterator</tt> returns an lvalue 
! or const rvalue.
! </p></blockquote>
! <p>
! (And similarly for multi.)
! <p/>
! This was reworded to N2284 23.3.1.1 [map.cons]/3 and N2284 23.3.3.1 [set.cons]/4, and it slightly changed over the years into 
! N3936 23.4.4.2 [map.cons]/3 and N3936 23.4.6.2 [set.cons]/4.
! <p/>
! In 2005/2007, this was the best known way to say "hey, we should try to move this stuff", as the fine-grained element requirements 
! were taking shape.
! <p/>
! Then in 2010, <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3173.pdf">N3173</a> was 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3226.html">voted</a> into WP 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3225.pdf">N3225</a>, adding the definition of 
! <tt>EmplaceConstructible</tt> and modifying the container requirements tables to make the range constructors require 
! <tt>EmplaceConstructible</tt>.
! <p/>
! After looking at this history and double-checking our implementation (where <tt>map</tt>/<tt>set</tt> range construction goes through 
! emplacement, with absolutely no special-casing for <tt>map</tt>'s pairs), I am convinced that N3173 superseded N1858 here. 
! (Range-<tt>insert()</tt> and the unordered containers are unaffected.)
! </p>
! 
! <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to the N3936.</p>
! 
! <p>
! Change 23.4.6.2 [set.cons] p4 as follows:
! </p> 
! <blockquote><pre>
! template &lt;class InputIterator&gt;
!   set(InputIterator first, InputIterator last,
!     const Compare&amp; comp = Compare(), const Allocator&amp; = Allocator());
! </pre><blockquote><p>
! -3- Effects: Constructs an empty <tt>set</tt> using the specified comparison object and allocator, and inserts
! elements from the range [<tt>first,last</tt>).
! <p/>
! -4- <i>Requires</i>: If the iterator's indirection operator returns an lvalue or a <del>non-</del>const rvalue, 
! then <tt>Key</tt> shall be <tt>CopyInsertible</tt> into <tt>*this</tt>.
! <p/>
! -5- <i>Complexity</i>: Linear in <tt>N</tt> if the range [<tt>first,last</tt>) is already sorted using 
! <tt>comp</tt> and otherwise <tt>N logN</tt>, where <tt>N</tt> is <tt>last - first</tt>.
! </p></blockquote></blockquote>
! </blockquote>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! GR: Do requirements supersede rather than compose [container requirements and per-function requirements]? AM: Yes, they supersede.
! <p/>
! AM: This looks good. Ready? Agreement. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the N4296.</p>
! 
! <ol>
! <li><p>
! Remove 23.4.4.2 [map.cons] p3:
! </p> 
! <blockquote><pre>
! template &lt;class InputIterator&gt;
!   map(InputIterator first, InputIterator last,
!       const Compare&amp; comp = Compare(), const Allocator&amp; = Allocator());
! </pre><blockquote>
! <p>
! <del>-3- <i>Requires</i>: If the iterator's indirection operator returns an lvalue or a <tt>const</tt> rvalue
! <tt>pair&lt;key_type, mapped_type&gt;</tt>, then both <tt>key_type</tt> and <tt>mapped_type</tt> shall be 
! <tt>CopyInsertible</tt> into <tt>*this</tt>.</del>
! <p/>
! [&hellip;]
! </p></blockquote></blockquote>
! </li>
! 
! <li><p>
! Remove 23.4.5.2 [multimap.cons] p3:
! </p> 
! <blockquote><pre>
! template &lt;class InputIterator&gt;
!   multimap(InputIterator first, InputIterator last,
!            const Compare&amp; comp = Compare(), 
!            const Allocator&amp; = Allocator());
! </pre><blockquote>
! <p>
! <del>-3- <i>Requires</i>: If the iterator's indirection operator returns an lvalue or a <tt>const</tt> rvalue
! <tt>pair&lt;key_type, mapped_type&gt;</tt>, then both <tt>key_type</tt> and <tt>mapped_type</tt> shall be 
! <tt>CopyInsertible</tt> into <tt>*this</tt>.</del>
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>
! Remove 23.4.6.2 [set.cons] p4:
! </p> 
! <blockquote><pre>
! template &lt;class InputIterator&gt;
!   set(InputIterator first, InputIterator last,
!       const Compare&amp; comp = Compare(), const Allocator&amp; = Allocator());
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-4- <i>Requires</i>: If the iterator's indirection operator returns an lvalue or a non-<tt>const</tt> rvalue, then 
! <tt>Key</tt> shall be <tt>CopyInsertible</tt> into <tt>*this</tt>.</del>
! </p></blockquote></blockquote>
! </li>
! 
! <li><p>
! Remove 23.4.7.2 [multiset.cons] p3:
! </p> 
! <blockquote><pre>
! template &lt;class InputIterator&gt;
!   multiset(InputIterator first, InputIterator last,
!            const Compare&amp; comp = Compare(), 
!            const Allocator&amp; = Allocator());
! </pre><blockquote>
! <p>
! <del>-3- <i>Requires</i>: If the iterator's indirection operator returns an lvalue or a <tt>const</tt> rvalue, then 
! <tt>Key</tt> shall be <tt>CopyInsertible</tt> into <tt>*this</tt>.</del>
! <p/>
! [&hellip;]
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2078"></a>2078. Throw specification of <tt>async()</tt> incomplete</h3>
! <p><b>Section:</b> 30.6.8 [futures.async] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2011-08-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The current throw specification of <tt>async()</tt> does state:
! </p>
! <blockquote><p>
! -6- <i>Throws</i>: <tt>system_error</tt> if policy is <tt>launch::async</tt> and 
! the implementation is unable to start a new thread.
! </p></blockquote>
! <p>
! First it seems not clear whether this only applies if policy equals 
! <tt>launch::async</tt> of if the <tt>async</tt> launch mode flag is set 
! (if <tt>policy|launch::async!=0</tt>)
! <p/>
! In the discussion Lawrence Crowl also wrote:
! </p>
! <blockquote><p>
!     More generally, I think what we want to say is that if the
!     implementation cannot successfully execute on one of the policies
!     allowed, then it must choose another. The principle would apply
!     to implementation-defined policies as well.
! </p></blockquote>
! 
! <p>
! Peter Sommerlad:
! </p>
! <blockquote><p>
! Should not throw. That was the intent. "is async" meat exactly.
! </p></blockquote>
! 
! <p><i>[2012, Portland: move to Tentatively NAD Editorial]</i></p>
! 
! <p>
! If no launch policy, it is undefined behavior.
! </p>
! <p>
! Agree with Lawrence, should try all the allowed policies. We will rephrase so that
! the policy argument should be <tt>lauch::async</tt>. Current wording seems good enough.
! </p>
! <p>
! We believe this choice of policy statement is really an editorial issue.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! If all the implementors read it and can't get it right - it is not editorial. Nico to provide wording
! </p>
! <p>
! No objections to revised wording, so moved to Immediate.
! </p>
! <p>
! Accept for Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 30.6.8 [futures.async] p6, p7 as indicated:</p>
! 
! <blockquote>
! <p>
! -6- <i>Throws:</i> <tt>system_error</tt> if <tt>policy</tt> <del>is</del> <ins><tt>==</tt></ins> <tt>launch::async</tt> 
! and the implementation is unable to start a new thread.
! </p>
! <p>
! -7- <i>Error conditions:</i>
! </p>
! <ul>
! <li><p> <tt>resource_unavailable_try_again</tt> &mdash; if <tt>policy</tt> <del>is</del> <ins><tt>==</tt></ins> <tt>launch::async</tt> 
! and the system is unable to start a new thread.</p>
! </li>
! </ul>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2080"></a>2080. Specify when <tt>once_flag</tt> becomes invalid</h3>
! <p><b>Section:</b> 30.4.4 [thread.once] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2011-08-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! In function <tt>call_once</tt> 30.4.4.2 [thread.once.callonce]
! paragraph 4 and 5 specify for <tt>call_once()</tt>:
! </p>
! 
! <blockquote>
! <p>
! <i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2 [thread.req.exception]), 
! or any exception thrown by <tt>func</tt>.
! <p/>
! <i>Error conditions</i>:
! </p>
! <ul>
! <li><tt>invalid_argument</tt> &mdash; if the <tt>once_flag</tt> object is no longer valid.</li>
! </ul>
! </blockquote>
! 
! <p>
! However, nowhere in 30.4.4 [thread.once] is specified, when a once-flag becomes invalid.
! <p/>
! As far as I know this happens if the flag is used for different functions. So we either have to have 
! to insert a sentence&#47;paragraph in
! </p>
! <blockquote><p>
! 30.4.4.2 Function call_once [thread.once.callonce]
! </p></blockquote>
! <p>
! or
! </p>
! <blockquote><p>
! 30.4.4 Call once [thread.once]
! </p></blockquote>
! <p>
! explaining when a <tt>once_flag</tt> becomes invalidated or we should state as error condition something like:
! </p>
! 
! <ul>
! <li><tt>invalid_argument</tt> &mdash; if the <tt>func</tt> used in combination with the <tt>once_flag</tt> is different 
! from a previously passed <tt>func</tt> for the same <tt>once_flag</tt>
! </li>
! </ul>
! 
! <p>
! Anthony Williams:
! </p>
! <blockquote>
! <p>
! A <tt>once_flag</tt> is invalidated if you destroy it (e.g. it is an automatic object, or heap 
! allocated and deleted, etc.)
! <p/>
! If the library can detect that this is the case then it will throw this exception. If it cannot 
! detect such a case then it will never be thrown.
! </p>
! </blockquote>
! 
! <p>
! Jonathan Wakely:
! </p>
! <blockquote>
! <p>
! I have also wondered how that error can happen in C++, where the type
! system will reject a non-callable type being passed to <tt>call_once()</tt> and
! should prevent a <tt>once_flag</tt> being used after its destructor runs.
! <p/>
! If a <tt>once_flag</tt> is used after its destructor runs then it is indeed
! undefined behaviour, so implementations are already free to throw any
! exception (or set fire to a printer) without the standard saying so.
! <p/>
! My assumption was that it's an artefact of basing the API on pthreads,
! which says:
! </p>
! <blockquote>
! <p>
! The <tt>pthread_once()</tt> function may fail if:
! <p/>
! <tt>[EINVAL]</tt>  If either <tt>once_control</tt> or <tt>init_routine</tt> is invalid.
! </p>
! </blockquote>
! </blockquote>
! 
! <p>
! Pete Becker:
! </p>
! <blockquote><p>
! Yes, probably. We had to clean up several UNIXisms that were in the original design.
! </p></blockquote>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Remove error conditions, move to Review.
! </p>
! 
! <p><i>[2012, Portland: move to Tentatively Ready]</i></p>
! 
! <p>
! Concurrency move to Ready, pending LWG review.
! </p>
! 
! <p>
! LWG did not have time to perform the final review in Portland, so moving to
! <i>tentatively</i> ready to reflect the Concurrency belief that the issue is
! ready, but could use a final inspection from library wordsmiths.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3337.</p>
! 
! <ol>
! <li><p>Change 30.4.4.2 [thread.once.callonce] as indicated:</p>
! <blockquote><pre>
! template&lt;class Callable, class ...Args&gt;
! void call_once(once_flag&amp; flag, Callable&amp;&amp; func, Args&amp;&amp;... args);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -4- <i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2), or any exception thrown by <tt>func</tt>.
! <p/>
! <del>-5- Error conditions:</del>
! </p>
! <ul>
! <li><del><tt>invalid_argument</tt> &mdash; if the <tt>once_flag</tt> object is no longer valid.</del></li>
! </ul>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2081"></a>2081. <tt>Allocator</tt> requirements should include <tt>CopyConstructible</tt></h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-08-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! As discussed in c++std-lib-31054 and c++std-lib-31059, the <tt>Allocator</tt>
! requirements implicitly require <tt>CopyConstructible</tt> because
! <tt>a.select_on_container_copy_construction()</tt> and
! <tt>container.get_allocator()</tt> both return a copy by value, but the
! requirement is not stated explicitly anywhere.
! <p/>
! In order to clarify that allocators cannot have 'explicit' copy
! constructors, the requirements should include <tt>CopyConstructible</tt>.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Ready.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Change Table 28 &mdash; Allocator requirements in 17.6.3.5 [allocator.requirements]:</p>
! 
! <table border="1">
! <caption>Table 28 &mdash; Allocator requirements</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Default</th>
! </tr> 
! <tr>
! <td>
! <tt>X a1(a);<br/>
! <ins>X a1 = a;</ins></tt>
! </td>
! <td>
! </td>
! <td>
! Shall not exit via an exception.<br/>
! post: <tt>a1 == a</tt>
! </td>
! <td>
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X a1(move(a));<br/>
! <ins>X a1 = move(a);</ins></tt>
! </td>
! <td>
! </td>
! <td>
! Shall not exit via an exception.<br/>
! post: <tt>a1</tt> equals the prior value<br/>
! of <tt>a</tt>.
! </td>
! <td>
! </td>
! </tr>
! </table>
! 
! </li>
! 
! <li><p>Change 17.6.3.5 [allocator.requirements] paragraph 4:</p>
! 
! <blockquote><p>
! <ins>An allocator type <tt>X</tt> shall satisfy the requirements of <tt>CopyConstructible</tt> 
! (17.6.3.1 [utility.arg.requirements]).</ins> The <tt>X::pointer</tt>, <tt>X::const_pointer</tt>, 
! <tt>X::void_pointer</tt>, and <tt>X::const_void_pointer</tt> types shall satisfy the requirements of 
! <tt>NullablePointer</tt> (17.6.3.3 [nullablepointer.requirements]). No constructor, comparison 
! operator, copy operation, move operation, or swap operation on these types shall exit via an 
! exception. <tt>X::pointer</tt> and <tt>X::const_pointer</tt> shall also satisfy the requirements 
! for a random access iterator (24.2 [iterator.requirements]).
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2083"></a>2083. const-qualification on <tt>weak_ptr::owner_before</tt></h3>
! <p><b>Section:</b> 20.8.2.3 [util.smartptr.weak], 20.8.2.3.5 [util.smartptr.weak.obs] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Ai Azuma <b>Opened:</b> 2011-09-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.weak">issues</a> in [util.smartptr.weak].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Is there any reason why <tt>weak_ptr::owner_before</tt> member function templates are not const-qualified?
! </p>
! 
! <p>
! Daniel Kr&uuml;gler:
! </p>
! <blockquote><p>
! I don't think so. To the contrary, without these to be const member function templates, the
! semantics of the specializations <tt>owner_less&lt;weak_ptr&lt;T&gt;&gt;</tt>  and
! <tt>owner_less&lt;shared_ptr&lt;T&gt;&gt;</tt> described in 20.8.2.4 [util.smartptr.ownerless] 
! is unclear.
! <p/>
! It is amusing to note that this miss has remain undetected from the accepted paper
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2637.pdf">n2637</a> 
! on. For the suggested wording changes see below. 
! </p></blockquote>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Ready.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Change the class template <tt>weak_ptr</tt> synopsis in 20.8.2.3 [util.smartptr.weak]
! as indicated:</p>
! <blockquote><pre>
! namespace std {
!   template&lt;class T&gt; class weak_ptr {
!   public:
!     typedef T element_type;
!     [&hellip;]
!     template&lt;class U&gt; bool owner_before(shared_ptr&lt;U&gt; const&amp; b) <ins>const</ins>;
!     template&lt;class U&gt; bool owner_before(weak_ptr&lt;U&gt; const&amp; b) <ins>const</ins>;
!   };
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! <li><p>Change the prototypes in 20.8.2.3.5 [util.smartptr.weak.obs] before p6 as indicated:</p>
! <blockquote><pre>
! template&lt;class U&gt; bool owner_before(shared_ptr&lt;U&gt; const&amp; b) <ins>const</ins>;
! template&lt;class U&gt; bool owner_before(weak_ptr&lt;U&gt; const&amp; b) <ins>const</ins>;
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2085"></a>2085. Wrong description of effect 1 of <tt>basic_istream::ignore</tt></h3>
! <p><b>Section:</b> 27.7.2.3 [istream.unformatted] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Krzysztof Zelechowski <b>Opened:</b> 2011-09-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#istream.unformatted">active issues</a> in [istream.unformatted].</p>
! <p><b>View all other</b> <a href="lwg-index.html#istream.unformatted">issues</a> in [istream.unformatted].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 27.7.2.3 [istream.unformatted] in N3242 currently has the following to say about the
! semantics of <tt>basic_istream::ignore</tt>:
! </p>
! 
! <blockquote><p>
! [..]. Characters are extracted until any of the following occurs:
! </p>
! <ul>
! <li>if <tt>n != numeric_limits&lt;streamsize&gt;::max()</tt> (18.3.2), <tt>n</tt> characters are extracted
! </li>
! </ul>
! </blockquote>
! 
! <p>
! This statement, apart from being slightly ungrammatical, indicates that if
! (<tt>n == numeric_limits&lt;streamsize&gt;::max()</tt>), the method returns without
! extracting any characters.
! <p/>
! The description intends to describe the observable behaviour of an
! implementation in terms of logical assertions.  Logical assertions are not
! "bullets" that can be "entered" but need not; they are predicates that can
! evaluate to true or false.
! <p/>
! The description contains two predicates, either of them causes extraction to
! terminate.  In the incriminated case, the first predicate is evaluates to
! true because its premise is false, therefore no characters will be
! extracted.
! <p/>
! The intended semantics would be described by the following statement:
! </p>
! 
! <blockquote><p>
! [..]. Characters are extracted until any of the following occurs:
! </p>
! <ul>
! <li><tt>(n != numeric_limits&lt;streamsize&gt;::max())</tt> (18.3.2) and (<tt>n</tt>) characters
! have been extracted so far.
! </li>
! </ul>
! </blockquote>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! 
! <p>
! Resolution: Ready. 
! </p>
! 
! <p><i>[2013-09-29, Chicago]</i></p>
! 
! 
! <p>
! Apply to Working Paper 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change 27.7.2.3 [istream.unformatted] p25 as indicated:</p>
! 
! <blockquote><pre>
! basic_istream&lt;charT,traits&gt;&amp;
!   ignore(streamsize n = 1, int_type delim = traits::eof());
! </pre><blockquote><p>
! -25- <i>Effects</i>: Behaves as an unformatted input function (as described in 27.7.2.3 [istream.unformatted], paragraph 1). After
! constructing a <tt>sentry</tt> object, extracts characters and discards them. Characters are extracted until
! any of the following occurs:
! </p>
! <ul>
! <li><del>if</del> <tt>n != numeric_limits&lt;streamsize&gt;::max()</tt> (18.3.2.1 [limits.numeric])<del>,</del><ins>and</ins> 
! <tt>n</tt> characters <del>are</del><ins>have been</ins> extracted <ins>so far</ins>
! </li>
! <li>end-of-file occurs on the input sequence (in which case the function calls <tt>setstate(eofbit)</tt>,
! which may throw <tt>ios_base::failure</tt> (27.5.5.4 [iostate.flags]));
! </li>
! <li><tt>traits::eq_int_type(traits::to_int_type(c), delim)</tt> for the next available input character <tt>c</tt> 
! (in which case <tt>c</tt> is extracted).
! </li>
! </ul>
! </blockquote></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2086"></a>2086. Overly generic type support for math functions</h3>
! <p><b>Section:</b> 26.8 [c.math] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-09-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.math">active issues</a> in [c.math].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.math">issues</a> in [c.math].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 26.8 [c.math] ends with a description of a rule set for "sufficient overloads"
! in p11:
! </p>
! 
! <blockquote>
! <p>Moreover, there shall be additional overloads sufficient to ensure:</p>
! <ol>
! <li>
! If any argument corresponding to a <tt>double</tt> parameter has type <tt>long double</tt>, then all arguments
! corresponding to <tt>double</tt> parameters are effectively cast to <tt>long double</tt>.
! </li>
! <li>
! Otherwise, if any argument corresponding to a <tt>double</tt> parameter has type <tt>double</tt> or an integer type,
! then all arguments corresponding to <tt>double</tt> parameters are effectively cast to <tt>double</tt>.
! </li>
! <li>
! Otherwise, all arguments corresponding to <tt>double</tt> parameters are effectively cast to <tt>float</tt>.
! </li>
! </ol>
! </blockquote>
! 
! <p>
! My impression is that this rule set is probably more generic as intended, my assumption is that it is written 
! to mimic the C99&#47;C1x rule set in 7.25 p2+3 in the "C++" way:
! </p>
! 
! <blockquote>
! <p>
! -2- Of the <tt>&lt;math.h&gt;</tt> and <tt>&lt;complex.h&gt;</tt> functions without an 
! <tt>f</tt> (<tt>float</tt>) or <tt>l</tt> (<tt>long double</tt>) suffix, several have 
! one or more parameters whose corresponding real type is <tt>double</tt>. For each such 
! function, except <tt>modf</tt>, there is a corresponding type-generic macro. (footnote 313) 
! The parameters whose corresponding real type is <tt>double</tt> in the function
! synopsis are generic parameters. Use of the macro invokes a function whose
! corresponding real type and type domain are determined by the arguments for the generic
! parameters. (footnote 314)
! <p/>
! -3- Use of the macro invokes a function whose generic parameters have the corresponding 
! real type determined as follows:
! </p>
! <ul>
! <li>
! First, if any argument for generic parameters has type <tt>long double</tt>, the type
! determined is <tt>long double</tt>.
! </li>
! <li>
! Otherwise, if any argument for generic parameters has type <tt>double</tt> or is of integer
! type, the type determined is <tt>double</tt>.
! </li>
! <li>
! Otherwise, the type determined is <tt>float</tt>.
! </li>
! </ul>
! </blockquote>
! 
! <p>
! where footnote 314 clarifies the intent:
! </p>
! 
! <blockquote>
! <p>
! If the type of the argument is not compatible with the type of the parameter for the selected function,
! the behavior is undefined.
! </p>
! </blockquote>
! 
! <p>
! The combination of the usage of the unspecific term "cast" with otherwise no further constraints 
! (note that C constraints the valid set to types that C++ describes as arithmetic types, but see below 
! for one important difference) has the effect that it requires the following examples to be well-formed 
! and well-defined:
! </p>
! 
! <blockquote><pre>
! #include &lt;cmath&gt;
! 
! enum class Ec { };
! 
! struct S { explicit operator long double(); };
! 
! void test(Ec e, S s) {
!  std::sqrt(e); // OK, behaves like std::sqrt((float) e);
!  std::sqrt(s); // OK, behaves like std::sqrt((float) s);
! }
! </pre></blockquote>
! <p>
! GCC 4.7 does not accept any of these examples.
! <p/>
! I found another example where the C++ rule differs from the C set, 
! but in this case I'm not so sure, which direction C++ should follow. 
! The difference is located in the fact, that in C enumerated types are 
! <em>integer types</em> as described in 6.2.5 p17 (see e.g. n1569 or n1256):
! <p/>
! "The type char, the signed and unsigned integer types, and
! the enumerated types are collectively called integer types. The
! integer and real floating types are collectively called real types."
! <p/>
! This indicates that in C the following code
! </p>
! <blockquote><pre>
! #include &lt;math.h&gt;
! 
! enum E { e };
! 
! void test(void) {
!   sqrt(e); // OK, behaves like sqrt((double) e);
! }
! </pre></blockquote>
! <p>
! seems to be well-defined and <tt>e</tt> is cast to <tt>double</tt>, but in C++
! referring to
! </p>
! <blockquote><pre>
! #include &lt;cmath&gt;
! 
! enum E { e };
! 
! void test() {
!   std::sqrt(e); // OK, behaves like sqrt((float) e);
! }
! </pre></blockquote>
! 
! <p>
! is also well-defined (because of our lack of constraints) but we
! must skip bullet 2 (because E is not an integer type) and effectively
! cast <tt>e</tt> to <tt>float</tt>. Accepting this, we would introduce 
! a silent, but observable runtime difference for C and C++.
! <p/>
! GCC 4.7 does not accept this example, but causes an ambiguity
! error among the three floating point overloads of sqrt.
! <p/>
! My current suggestion to fix these problems would be to constrain the 
! valid argument types of these functions to arithmetic types.
! </p>
! 
! <blockquote><p>
! Howard provided wording to solve the issue.
! </p></blockquote>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Moved to Ready.  The proposed wording reflects both original intent from
! TR1, and current implementations.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change 26.8 [c.math] p11 as indicated:</p>
! 
! <blockquote>
! <p>Moreover, there shall be additional overloads sufficient to ensure:</p>
! <ol>
! <li>
! If any <ins>arithmetic</ins> argument corresponding to a <tt>double</tt> parameter has 
! type <tt>long double</tt>, then all <ins>arithmetic</ins> arguments corresponding to 
! <tt>double</tt> parameters are effectively cast to <tt>long double</tt>.
! </li>
! <li>
! Otherwise, if any <ins>arithmetic</ins> argument corresponding to a <tt>double</tt> 
! parameter has type <tt>double</tt> or an integer type, then all <ins>arithmetic</ins> 
! arguments corresponding to <tt>double</tt> parameters are effectively cast to <tt>double</tt>.
! </li>
! <li>
! Otherwise, all <ins>arithmetic</ins> arguments corresponding to <tt>double</tt> parameters 
! <del>are effectively cast to</del><ins>have type</ins> <tt>float</tt>.
! </li>
! </ol>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2087"></a>2087. <tt>iostream_category()</tt> and <tt>noexcept</tt></h3>
! <p><b>Section:</b> 27.5 [iostreams.base] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2011-09-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iostreams.base">issues</a> in [iostreams.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! In <tt>&lt;system_error&gt;</tt> we have:
! </p>
! 
! <blockquote><pre>
! const error_category&amp; generic_category() noexcept;
! const error_category&amp; system_category() noexcept;
! </pre></blockquote>
! 
! <p>
! In <tt>&lt;future&gt;</tt> we have:
! </p>
! 
! <blockquote><pre>
! const error_category&amp; future_category() noexcept;
! </pre></blockquote>
! 
! <p>
! But in <tt>&lt;ios&gt;</tt> we have:
! </p>
! 
! <blockquote><pre>
! const error_category&amp; iostream_category();
! </pre></blockquote>
! 
! <p>
! Is there any reason that <tt>iostream_category()</tt> is not declared with 
! <tt>noexcept</tt> or is this an oversight?
! </p>
! 
! <p>
! Daniel:
! <p/>
! This looks like an oversight to me. We made the above
! mentioned changes as part of noexcept-ifying the thread
! library but <tt>iostream_category()</tt> was skipped, so it seems
! to be forgotten. There should be no reason, why it cannot
! be <tt>noexcept</tt>. When doing so, we should also make these functions
! <tt>noexcept</tt> (similar to corresponding overloads):
! </p>
! <blockquote><pre>
! error_code make_error_code(io_errc e);
! error_condition make_error_condition(io_errc e);
! </pre></blockquote>
! 
! <p>
! Suggested wording provided by Daniel.
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! 
! <p>
! Unanimous.
! <p/>
! Resolution: move to tentatively ready. 
! </p>
! 
! <p><i>[2013-09-29, Chicago]</i></p>
! 
! 
! <p>
! Apply to Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol><li>
! <p>Change 27.5.1 [iostreams.base.overview], header <tt>&lt;ios&gt;</tt> synopsis 
! as indicated:
! </p>
! <blockquote><pre>
! #include &lt;iosfwd&gt;
! namespace std {
!   [&hellip;]
!   error_code make_error_code(io_errc e) <ins>noexcept</ins>;
!   error_condition make_error_condition(io_errc e) <ins>noexcept</ins>;
!   const error_category&amp; iostream_category() <ins>noexcept</ins>;
! }
! </pre></blockquote>
! 
! </li>
! <li>
! <p>Change the prototype declarations in 27.5.6.5 [error.reporting] as indicated:
! </p>
! <blockquote><pre>
! error_code make_error_code(io_errc e) <ins>noexcept</ins>;
! </pre></blockquote><blockquote>
! <p>
! -1- <i>Returns</i>: <tt>error_code(static_cast&lt;int&gt;(e), iostream_category())</tt>.
! </p>
! </blockquote><blockquote><pre>
! error_condition make_error_condition(io_errc e) <ins>noexcept</ins>;
! </pre></blockquote><blockquote>
! <p>
! -2- <i>Returns</i>: <tt>error_condition(static_cast&lt;int&gt;(e), iostream_category())</tt>.
! </p>
! </blockquote><blockquote><pre>
! const error_category&amp; iostream_category() <ins>noexcept</ins>;
! </pre></blockquote><blockquote>
! <p>
! -3- <i>Returns</i>: A reference to an object of a type derived from class <tt>error_category</tt>.
! <p/>
! -4- The object’s <tt>default_error_condition</tt> and <tt>equivalent</tt> virtual functions shall behave as specified
! for the class <tt>error_category</tt>. The object’s <tt>name</tt> virtual function shall return a pointer to the string
! <tt>"iostream"</tt>.
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2091"></a>2091. Misplaced effect in <tt>m.try_lock_for()</tt></h3>
! <p><b>Section:</b> 30.4.1.3 [thread.timedmutex.requirements] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2011-10-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.timedmutex.requirements">issues</a> in [thread.timedmutex.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 30.4.1.3 [thread.timedmutex.requirements]&#47;4 says, in part, 
! </p><blockquote><p>
! "<i>Requires</i>: If the tick period of [the argument] is not exactly 
! convertible &hellip; [it] shall be rounded up &hellip;"
! </p></blockquote>
! <p>
! This doesn't belong in the requires clause. It's an effect. It belongs in paragraph 5. 
! Nitpickingly, this would be a technical change: as written it imposes an obligation on 
! the caller, while moving it imposes an obligation on the callee. Although that's certainly 
! not what was intended.
! <p/>
! Peter Dimov comments:
! <p/>
! Not to mention that it should round down, not up. :-)
! <p/>
! Incidentally, I see that the wrong <tt>try_lock</tt> requirement that the caller shall not own 
! the mutex has entered the standard, after all. Oh well. Let's hope that the real world 
! continues to ignore it.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Remove the offending sentence from the requirements clause. Do <em>not</em> add it back 
! anywhere else. The implementation already must have license to wake up late, so the 
! rounding is invisible.
! <p/>
! Move to Review.
! </p>
! 
! <p><i>[2012, Portland]</i></p>
! 
! <p>
! Concurrency move to Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3337.</p>
! 
! <ol>
! <li><p>Change 30.4.1.3 [thread.timedmutex.requirements]&#47;4 as indicated:</p>
! 
! <blockquote><p>
! -3- The expression <tt>m.try_lock_for(rel_time)</tt> shall be well-formed and have the following semantics:
! <p/>
! -4- <i>Requires</i>: <del>If the tick period of <tt>rel_time</tt> is not exactly convertible to the native tick period, the
! duration shall be rounded up to the nearest native tick period.</del> If <tt>m</tt> is of type <tt>std::timed_mutex</tt>,
! the calling thread does not own the mutex.
! </p></blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2092"></a>2092. Vague Wording for <tt>condition_variable_any</tt></h3>
! <p><b>Section:</b> 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2011-10-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvarany">issues</a> in [thread.condition.condvarany].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 30.5.2 [thread.condition.condvarany]&#47;4 says, in part, that 
! <tt>condition_variable_any()</tt> throws an exception 
! "if any native handle type manipulated is not available". 
! <p/>
! I don't know what that means. Is this intended to say something different 
! from the analogous words for <tt>condition_variable()</tt> [30.5.1 [thread.condition.condvar]&#47;4], 
! "if some non-memory resource limitation prevents initialization"? If not, 
! it should be worded the same way.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Copy the corresponding wording from the <tt>condition_variable</tt> constructor in 30.5.1 [thread.condition.condvar] p4.
! <p/>
! Move to Review.
! </p>
! 
! <p><i>[2012, Portland]</i></p>
! 
! <p>
! Concurrency move to Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3337.</p>
! 
! <ol>
! <li><p>Change 30.4.1.3 [thread.timedmutex.requirements]&#47;4 as indicated:</p>
! 
! <blockquote><pre>
! condition_variable_any();
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -4- <i>Error conditions</i>:
! </p>
! <ul>
! <li><tt>resource_unavailable_try_again</tt> &mdash; <del>if any native handle type manipulated is not available</del>
! <ins>if some non-memory resource limitation prevents initialization</ins>.</li>
! <li><tt>operation_not_permitted</tt> &mdash; if the thread does not have the privilege to perform the operation.</li>
! </ul>
! </blockquote></blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2093"></a>2093. Throws clause of <tt>condition_variable::wait</tt> with predicate</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2011-10-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! the Throws: clause of <tt>condition_variable::wait&#47;wait_xxx</tt> functions that 
! take a predicate argument is:
! </p>
! <blockquote><p>
! <i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2 [thread.req.exception]).
! </p></blockquote>
! <p>
! If executing the predicate throws an exception, I would expect such exception to propagate unchanged 
! to the caller, but the throws clause seems to indicate that it gets mutated into a system_error. T
! hat's because of 17.5.1.4 [structure.specifications]&#47;4:
! <p/>
! "If F’s semantics contains a Throws:, Postconditions:, or Complexity: element, then that supersedes 
! any occurrences of that element in the code sequence."
! <p/>
! Is my interpretation correct? Does it match the intent?
! <p/>
! Daniel comments:
! <p/>
! I don't think that this interpretation is entirely correct, the wording does not say that 
! <tt>std::system_error</tt> or a derived class must be thrown, it simply is underspecified 
! in this regard (The extreme interpretation is that the behaviour would be undefined, but 
! that would be too far reaching I think). We have better wording for this in 
! 30.4.4.2 [thread.once.callonce] p4, where it says:
! <p/>
! "<i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2 [thread.req.exception]), 
! or any exception thrown by <tt>func</tt>."
! <p/>
! or in 30.3.2 [thread.thread.this] p6&#47;p9:
! <p/>
! "<i>Throws</i>: Nothing if <tt>Clock</tt> satisfies the <tt>TrivialClock</tt> requirements 
! (20.12.3 [time.clock.req]) and operations of <tt>Duration</tt> do not throw exceptions. 
! [ <i>Note</i>: instantiations of time point types and clocks supplied by the implementation 
! as specified in 20.12.7 [time.clock] do not throw exceptions. &mdash; <i>end note</i> ]"
! <p/>
! So, the here discussed Throws elements should add lines along the lines of
! <p/>
! "Any exception thrown by operations of <tt>pred</tt>."
! <p/>
! and similar wording for time-related operations:
! <p/>
! "Any exception thrown by operations of <tt>Duration</tt>",
! <p/>
! "Any exception thrown by operations of <tt>chrono::duration&lt;Rep, Period&gt;</tt>"
! </p>
! 
! <p><i>[2011-11-28: Ganesh comments and suggests wording]</i></p>
! 
! 
! <p>
! As for the discussion about the exception thrown by the manipulation of time-related objects, 
! I believe the argument applies to all functions declared in 30 [thread]. Therefore, 
! instead of adding wording to each member, I would simply move those requirements from 
! 30.3.2 [thread.thread.this] p6&#47;p9 to a new paragraph in 30.2.4 [thread.req.timing]. 
! <p/>
! As for 30.5.2 [thread.condition.condvarany], the member functions <tt>wait()</tt> and 
! <tt>wait_until()</tt> are described only in terms of the Effects: clause (so strictly speaking, 
! they need no changes), however, <tt>wait_for()</tt> is described with a full set of clauses 
! including Throws: and Error conditions:. Either we should add those clauses to <tt>wait&#47;wait_until</tt> 
! with changes similar to the one above, or remove paragraphs 29 to 34 entirely. By the way, 
! even paragraph 26 could be removed IMHO.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! We like the idea behind the proposed resolution.
! <p/>
! Modify the first addition to read instead: "Functions that specify a timeout, will throw if an operation 
! on a clock, time point, or time duration throws an exception." 
! <p/>
! In the note near the bottom change "even if the timeout has already expired" to "or if the timeout has 
! already expired". (This is independent, but the original doesn't seem to make sense.) 
! <p/>
! Move to Review.
! </p>
! 
! <p><i>[2012, Portland]</i></p>
! 
! <p>
! Concurrency move to Ready with slightly ammended wording.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3337.</p>
! 
! <ol>
! <li><p>Add a new paragraph at the end of 30.2.4 [thread.req.timing]:</p>
! 
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -6- The resolution of timing provided by an implementation depends on both operating system and hardware.
! The finest resolution provided by an implementation is called the <i>native resolution</i>.
! <p/>
! -7- Implementation-provided clocks that are used for these functions shall meet the <tt>TrivialClock</tt> 
! requirements (20.12.3 [time.clock.req]).
! <p/>
! 
! <ins>-?- Functions that specify a timeout, will throw if, during the execution of this function,
! a clock, time point, or time duration throws an exception. [ <i>Note</i>: instantiations of clock,
! time point and duration types supplied by the implementation as specified in 20.12.7 [time.clock]
! do not throw exceptions. &mdash; <i>end note</i>]</ins>
! </p>
! </blockquote>
! </li>
! 
! 
! <li><p>Change 30.3.2 [thread.thread.this] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class Clock, class Duration&gt;
!   void sleep_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);;
! </pre><blockquote>
! <p>
! -4- <i>Effects</i>: Blocks the calling thread for the absolute timeout (30.2.4 [thread.req.timing]) specified by <tt>abs_time</tt>.
! <p/>
! -5- <i>Synchronization</i>: None.
! <p/>
! -6- <i>Throws</i>: <ins>timeout-related exceptions (30.2.4 [thread.req.timing]).</ins><del>Nothing if 
! <tt>Clock</tt> satisfies the <tt>TrivialClock</tt> requirements (20.12.3 [time.clock.req]) and 
! operations of <tt>Duration</tt> do not throw exceptions. [ <i>Note</i>: instantiations of time point types 
! and clocks supplied by the implementation as specified in 20.12.7 [time.clock] do not throw 
! exceptions. &mdash; <i>end note</i>]</del>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep, class Period&gt;
!   void sleep_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);;
! </pre><blockquote>
! <p>
! -7- <i>Effects</i>: Blocks the calling thread for the relative timeout (30.2.4 [thread.req.timing]) specified by <tt>rel_time</tt>.
! <p/>
! -8- <i>Synchronization</i>: None.
! <p/>
! -9- <i>Throws</i>: <ins>timeout-related exceptions (30.2.4 [thread.req.timing]).</ins><del>Nothing 
! if operations of <tt>chrono::duration&lt;Rep, Period&gt;</tt> do not throw exceptions. 
! [ <i>Note</i>: instantiations of time point types and clocks supplied by the implementation
! as specified in 20.12.7 [time.clock] do not throw exceptions. &mdash; <i>end note</i>]</del>
! </p>
! </blockquote></blockquote>
! 
! </li>
! 
! <li><p>Change 30.4.1.3 [thread.timedmutex.requirements] as indicated:</p>
! 
! <p>
! -3- The expression <tt>m.try_lock_for(rel_time)</tt> shall be well-formed and have the following semantics:
! <p/>
! [&hellip;]
! <p/>
! -5- <i>Effects</i>: The function attempts to obtain ownership of the mutex within the relative timeout (30.2.4 [thread.req.timing])
! specified by <tt>rel_time</tt>. If the time specified by <tt>rel_time</tt> is less than or equal to <tt>rel_time.zero()</tt>, the
! function attempts to obtain ownership without blocking (as if by calling <tt>try_lock()</tt>). The function
! shall return within the timeout specified by <tt>rel_time</tt> only if it has obtained ownership of the mutex
! object. [<i>Note</i>: As with <tt>try_lock()</tt>, there is no guarantee that ownership will be obtained if the lock
! is available, but implementations are expected to make a strong effort to do so. &mdash; <i>end note</i>]
! <p/>
! [&hellip;]
! <p/>
! -8- <i>Synchronization</i>: If <tt>try_lock_for()</tt> returns <tt>true</tt>, prior <tt>unlock()</tt> operations on the same object
! <i>synchronize with</i> (1.10 [intro.multithread]) this operation.
! <p/>
! -9- <i>Throws</i>: <ins>timeout-related exceptions (30.2.4 [thread.req.timing]).</ins><del>Nothing</del>.
! <p/>
! -10- The expression <tt>m.try_lock_until(abs_time)</tt> shall be well-formed and have the following semantics:
! <p/>
! [&hellip;]
! <p/>
! -12- <i>Effects</i>: The function attempts to obtain ownership of the mutex. If <tt>abs_time</tt> has already passed, the
! function attempts to obtain ownership without blocking (as if by calling <tt>try_lock()</tt>). The function
! shall return before the absolute timeout (30.2.4 [thread.req.timing]) specified by <tt>abs_time</tt> only 
! if it has obtained ownership of the mutex object. [<i>Note</i>: As with <tt>try_lock()</tt>, there is no guarantee 
! that ownership will be obtained if the lock is available, but implementations are expected to make a strong effort 
! to do so. &mdash; <i>end note</i>]
! <p/>
! [&hellip;]
! <p/>
! -15- <i>Synchronization</i>: If <tt>try_lock_until()</tt> returns true, prior <tt>unlock()</tt> operations on the same object
! <i>synchronize with</i> (1.10 [intro.multithread]) this operation.
! <p/>
! -16- <i>Throws</i>: <ins>timeout-related exceptions (30.2.4 [thread.req.timing]).</ins><del>Nothing</del>.
! </p>
! </li>
! 
! <li><p>Change 30.5.1 [thread.condition.condvar] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class Predicate&gt;
!   void wait(unique_lock&lt;mutex&gt;&amp; lock, Predicate pred);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -15- <i>Effects</i>: <ins>Equivalent to:</ins>
! </p>
! <blockquote><pre>
! while (!pred())
!   wait(lock);
! </pre></blockquote>
! <p>
! [&hellip;]
! <p/>
! -17- <i>Throws</i>: <tt>std::system_error</tt> when an exception is required (30.2.2 [thread.req.exception])<ins>, 
! timeout-related exceptions (30.2.4 [thread.req.timing]), or any exception thrown by <tt>pred</tt></ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Clock, class Duration&gt;
!   cv_status wait_until(unique_lock&lt;mutex&gt;&amp; lock,
!                        const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -23- <i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2 [thread.req.exception])
! <ins>or timeout-related exceptions (30.2.4 [thread.req.timing])</ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep, class Period&gt;
!   cv_status wait_for(unique_lock&lt;mutex&gt;&amp; lock,
!                      const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -26- <i>Effects</i>: <del>as if</del><ins>Equivalent to:</ins>
! </p>
! <blockquote><pre>
! return wait_until(lock, chrono::steady_clock::now() + rel_time);
! </pre></blockquote>
! <p>
! [&hellip;]
! <p/>
! -29- <i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2 [thread.req.exception])
! <ins>or timeout-related exceptions (30.2.4 [thread.req.timing])</ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Clock, class Duration, class Predicate&gt;
!   bool wait_until(unique_lock&lt;mutex&gt;&amp; lock,
!                   const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time,
!                   Predicate pred);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -32- <i>Effects</i>: <ins>Equivalent to:</ins>
! </p>
! <blockquote><pre>
! while (!pred())
!   if (wait_until(lock, abs_time) == cv_status::timeout)
!     return pred();
! return true;
! </pre></blockquote>
! <p>
! <del>-33- <i>Returns</i>: <tt>pred()</tt></del>
! <p/>
! [&hellip;]
! <p/>
! -36- <i>Throws</i>: <tt>std::system_error</tt> when an exception is required (30.2.2 [thread.req.exception])<ins>, 
! timeout-related exceptions (30.2.4 [thread.req.timing]), or any exception thrown by <tt>pred</tt></ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Rep, class Period, class Predicate&gt;
!   bool wait_for(unique_lock&lt;mutex&gt;&amp; lock,
!                 const chrono::duration&lt;Rep, Period&gt;&amp; rel_time,
!                 Predicate pred);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -39- <i>Effects</i>: <del>as if</del><ins>Equivalent to:</ins>
! </p>
! <blockquote><pre>
! return wait_until(lock, chrono::steady_clock::now() + rel_time, std::move(pred));
! </pre></blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-42- <i>Returns</i>: <tt>pred()</tt></del>
! <p/>
! [&hellip;]
! <p/>
! -44- <i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2 [thread.req.exception])<ins>, 
! timeout-related exceptions (30.2.4 [thread.req.timing]), or any exception thrown by <tt>pred</tt></ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
! 
! </li>
! 
! <li><p>Change 30.5.2 [thread.condition.condvarany] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class Lock, class Predicate&gt;
!   void wait(Lock&amp; lock, Predicate pred);
! </pre><blockquote>
! <p>
! -14- <i>Effects</i>: <ins>Equivalent to:</ins>
! </p>
! <blockquote><pre>
! while (!pred())
!   wait(lock);
! </pre></blockquote>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Lock, class Clock, class Duration&gt;
!   cv_status wait_until(Lock&amp; lock, const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -18- <i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2 [thread.req.exception])
! <ins>or any timeout-related exceptions (30.2.4 [thread.req.timing])</ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Lock, class Rep, class Period&gt;
!   cv_status wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -20- <i>Effects</i>: <del>as if</del><ins>Equivalent to:</ins>
! </p>
! <blockquote><pre>
! return wait_until(lock, chrono::steady_clock::now() + rel_time);
! </pre></blockquote>
! <p>
! [&hellip;]
! <p/>
! -23- <i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2 [thread.req.exception])
! <ins>or any timeout-related exceptions (30.2.4 [thread.req.timing])</ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Lock, class Clock, class Duration, class Predicate&gt;
!   bool wait_until(Lock&amp; lock, const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time, Predicate pred);
! </pre><blockquote>
! <p>
! -25- <i>Effects</i>: <ins>Equivalent to:</ins>
! </p>
! <blockquote><pre>
! while (!pred())
!   if (wait_until(lock, abs_time) == cv_status::timeout)
!     return pred();
! return true;
! </pre></blockquote>
! <p>
! -26- <del><i>Returns</i>: <tt>pred()</tt></del><ins>[<i>Note</i>: There is no blocking if <tt>pred()</tt> is initially <tt>true</tt>, 
! or if the timeout has already expired. &mdash; <i>end note</i>]</ins>
! <p/>
! -27- [<i>Note</i>: The returned value indicates whether the predicate evaluates to <tt>true</tt> regardless of whether the
! timeout was triggered. <i>end note</i>]
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class Lock, class Rep, class Period, class Predicate&gt;
!   bool wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time, Predicate pred);
! </pre><blockquote>
! <p>
! -28- <i>Effects</i>: <del>as if</del><ins>Equivalent to:</ins>
! </p>
! <blockquote><pre>
! return wait_until(lock, chrono::steady_clock::now() + rel_time, std::move(pred));
! </pre></blockquote>
! <p>
! <del>-29- [<i>Note</i>: There is no blocking if <tt>pred()</tt> is initially <tt>true</tt>, 
! even if the timeout has already expired. &mdash; <i>end note</i>]</del>
! <del>-30- <i>Postcondition</i>: <tt>lock</tt> is locked by the calling thread.</del>
! <p/>
! <del>-31- <i>Returns</i>: <tt>pred()</tt></del>
! <p/>
! <del>-32- [<i>Note</i>: The returned value indicates whether the predicate evaluates to <tt>true</tt> 
! regardless of whether the timeout was triggered. &mdash; <i>end note</i>]</del>
! <p/>
! <del>-33- <i>Throws</i>: <tt>system_error</tt> when an exception is required (30.2.2 [thread.req.exception]).</del>
! <p/>
! <del>-34- <i>Error conditions</i>:</del>
! </p>
! <ul>
! <li><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></li>
! </ul>
! </blockquote></blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2094"></a>2094. <tt>duration</tt> conversion overflow shouldn't participate in overload resolution</h3>
! <p><b>Section:</b> 20.12.5.1 [time.duration.cons] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Vicente J. Botet Escriba <b>Opened:</b> 2011-10-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#time.duration.cons">issues</a> in [time.duration.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 20.12.5.1 [time.duration.cons] says:
! </p>
! <blockquote><pre>
! template &lt;class Rep2, class Period2&gt;
!   constexpr duration(const duration&lt;Rep2, Period2&gt;&amp; d);
! </pre><blockquote>
! <p>
! <i>Remarks</i>: This constructor shall not participate in overload resolution unless 
! <tt>treat_as_floating_point&lt;rep&gt;::value</tt> is <tt>true</tt> or both 
! <tt>ratio_divide&lt;Period2, period&gt;::den</tt> is <tt>1</tt> and <tt>treat_as_floating_point&lt;Rep2&gt;::value</tt> 
! is <tt>false</tt>.
! </p></blockquote></blockquote>
! <p>
! The evaluation of <tt>ratio_divide&lt;Period2, period&gt;::den</tt> could make 
! <tt>ratio_divide&lt;Period2, period&gt;::num</tt> overflow.
! <p/>
! This occur for example when we try to create a millisecond (<tt>period</tt>=<tt>ratio&lt;1,1000&gt;</tt>) 
! from an exa-second (<tt>Period2</tt>=<tt>ratio&lt;10<sup>18</sup>&gt;</tt>).
! <p/>
! <tt>ratio_divide&lt;ratio&lt;10<sup>18</sup>&gt;, ratio&lt;1,1000&gt;&gt;::num</tt> is 
! <tt>10<sup>21</sup></tt> which overflows which makes the compiler error.
! <p/>
! If the function <tt>f</tt> is overloaded with milliseconds and seconds
! </p>
! <blockquote><pre>
! void f(milliseconds);
! void f(seconds);
! </pre></blockquote>
! <p>
! The following fails to compile.
! </p>
! <blockquote><pre>
! duration&lt;int,exa&gt; r(1);
! f(r);
! </pre></blockquote>
! <p>
! While the conversion to seconds work, the conversion to milliseconds make the program fail at compile time. 
! In my opinion, this program should be well formed and the constructor from <tt>duration&lt;int,exa&gt;</tt> 
! to milliseconds shouldn't participate in overload resolution as the result can not be represented.
! <p/>
! I think the wording of the standard can be improved so no misinterpretations are possible by adding that 
! "no overflow is induced by the conversion".
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Review.
! </p>
! <p>Pete: The wording is not right.</p>
! <p>Howard: Will implement this to be sure it works.</p>
! <p>Jeffrey: If ratio needs a new hook, should it be exposed to users for their own uses?</p>
! <p>Pete: No.</p>
! 
! <p>
! Move to Review,
! Howard to implement in a way that mere mortals can understand.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change the following paragraphs of 20.12.5.1 [time.duration.cons] p4 indicated:</p>
! 
! <blockquote><pre>
! template &lt;class Rep2, class Period2&gt;
!   constexpr duration(const duration&lt;Rep2, Period2&gt;&amp; d);
! </pre><blockquote>
! <p>
! <i>Remarks</i>: This constructor shall not participate in overload resolution unless <ins>no 
! overflow is induced in the conversion and</ins> <tt>treat_as_floating_point&lt;rep&gt;::value</tt> 
! is <tt>true</tt> or both <tt>ratio_divide&lt;Period2, period&gt;::den</tt> is <tt>1</tt> and 
! <tt>treat_as_floating_point&lt;Rep2&gt;::value</tt> is <tt>false</tt>. [ <i>Note</i>: This 
! requirement prevents implicit truncation error when converting between integral-based duration 
! types. Such a construction could easily lead to confusion about the value of the 
! duration. &mdash; <i>end note</i> ]
! </p></blockquote></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2096"></a>2096. Incorrect constraints of <tt>future::get</tt> in regard to <tt>MoveAssignable</tt></h3>
! <p><b>Section:</b> 30.6.6 [futures.unique_future] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 30.6.6 [futures.unique_future] paragraph 15 says the following:
! </p>
! <blockquote><pre>
! R future::get();
! </pre></blockquote>
! <p>
! &hellip;
! <p/>
! -15- <i>Returns</i>:
! </p>
! <ul>
! <li>
! <p><tt>future::get()</tt> returns the value stored in the object’s shared state. If the type of the value is
! <tt>MoveAssignable</tt> the returned value is moved, otherwise it is copied.
! <p/>
! &hellip;
! </p>
! </li>
! </ul>
! <p>
! There are some problems with the description:
! <p/>
! "If the type of the value is <tt>MoveAssignable</tt> the returned value is moved, otherwise it is copied."
! </p>
! <ol>
! <li>It seems to impose unrealistic constraints on implementations, because how could an implementor 
! recognize whether a user-defined type satisfies the semantics of <tt>MoveAssignable</tt>? This should be
! based solely on a pure expression-based requirement, if this is an requirement for implementations.
! </li>
! <li>
! Reducing <tt>MoveAssignable</tt> to the plain expression part <tt>std::is_move_assignable</tt> 
! would solvs (1), but raises another question, namely why a <em>move-assignment</em> should be relevant
! for a function return based on the value stored in the future state? We would better fall back to
! <tt>std::is_move_constructible</tt> instead.
! </li>
! <li><p>The last criticism I have is about the part
! <p/>
! "the returned value is moved, otherwise it is copied"
! <p/>
! because an implementation won't be able to recognize what the user-defined type 
! will do during an expression that is prepared by the implementation. I think the 
! wording is intended to <em>allow</em> a move by seeding with an rvalue expression via
! <tt>std::move</tt> (or equivalent), else the result will be an effective
! copy construction.
! </p>
! </li>
! </ol>
! 
! <p><i>[2011-11-28 Moved to Tentatively Ready after 5 positive votes on c++std-lib.]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change 30.6.6 [futures.unique_future] paragraph 15 as indicated:</p>
! 
! <blockquote><pre>
! R future::get();
! </pre></blockquote>
! <p>
! &hellip;
! <p/>
! -15- <i>Returns</i>:
! </p>
! <ul>
! <li>
! <p><tt>future::get()</tt> returns the value <ins><tt>v</tt></ins> stored in the object’s shared 
! state <ins>as <tt>std::move(v)</tt></ins>. <del>If the type of the value is <tt>MoveAssignable</tt> 
! the returned value is moved, otherwise it is copied.</del>
! <p/>
! &hellip;
! </p>
! </li>
! </ul>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2097"></a>2097. <tt>packaged_task</tt> constructors should be constrained</h3>
! <p><b>Section:</b> 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-11-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! With the proposed resolution of <a href="lwg-defects.html#2067">2067</a>, this no longer selects the
! copy constructor:
! </p>
! <blockquote><pre>
! std::packaged_task&lt;void()&gt; p1;
! std::packaged_task&lt;void()&gt; p2(p1);
! </pre></blockquote>
! <p>
! Instead this constructor is a better match:
! </p>
! <blockquote><pre>
! template &lt;class F&gt;
!  explicit packaged_task(F&amp;&amp; f);
! </pre></blockquote>
! <p>
! This attempts to package a <tt>packaged_task</tt>, which internally tries to
! copy <tt>p2</tt>, which fails because the copy constructor is deleted. For at
! least one implementation the resulting error message is much less
! helpful than the expected "cannot call deleted function" because it
! happens after instantiating several more templates rather than in the
! context where the constructor is called.
! <p/>
! I believe the solution is to constrain to the template constructors so
! the template argument <tt>F</tt> cannot be deduced as (possibly <i>cv</i>)
! <tt>packaged_task&amp;</tt> or <tt>packaged_task</tt>.  It could be argued 
! this constraint is already implied because <tt>packaged_task</tt> is not 
! copyable and the template constructors require that "invoking a copy of <tt>f</tt> 
! shall behave the same as invoking <tt>f</tt>".
! <p/>
! Daniel points out that the variadic constructor of <tt>std::thread</tt>
! described in 30.3.1.2 [thread.thread.constr] has a similar problem and 
! suggests a similar wording change, which has been integrated below.
! <p/>
! An alternative is to declare <tt>thread(thread&amp;)</tt> and
! <tt>packaged_task(packaged_task&amp;)</tt> as deleted.
! </p>
! 
! <p><i>[2012, Portland]</i></p>
! 
! <p>
! This issue appears to be more about library specification than technical
! concurrency issues, so should be handled in LWG.
! </p>
! 
! 
! <p><i>[2013, Chicago]</i></p>
! 
! <p>
! Move to Immediate resolution.
! </p>
! <p>
! Howard volunteered existing implementation experience with the first change, and saw no issue that the second would 
! introduce any new issue.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Insert a new Remarks element to 30.3.1.2 [thread.thread.constr] around p3 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class F, class ...Args&gt; explicit thread(F&amp;&amp; f, Args&amp;&amp;... args);
! </pre></blockquote>
! <p>
! -3- <i>Requires</i>: <tt>F</tt> and each <tt>Ti</tt> in <tt>Args</tt> shall satisfy the <tt>MoveConstructible</tt> 
! requirements. <tt><i>INVOKE</i>(<i>DECAY_COPY</i> ( std::forward&lt;F&gt;(f)), <i>DECAY_COPY</i> (std::forward&lt;Args&gt;(args))...)</tt> 
! (20.8.2) shall be a valid expression.
! <p/>
! <ins>-?- <i>Remarks</i>: This constructor shall not participate in overload resolution if <tt>decay&lt;F&gt;::type</tt> 
! is the same type as <tt>std::thread</tt>.</ins>
! </p>
! </li>
! 
! <li><p>Insert a new Remarks element to 30.6.9.1 [futures.task.members] around p2 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class F&gt;
!   packaged_task(F&amp;&amp; f);
! template &lt;class F, class Allocator&gt;
!   explicit packaged_task(allocator_arg_t, const Allocator&amp; a, F&amp;&amp; f);
! </pre></blockquote>
! <p>
! -2- <i>Requires</i>: <tt><i>INVOKE</i>(f, t1, t2, ..., tN, R)</tt>, where <tt>t1, t2, ..., tN</tt> are values of the corresponding
! types in <tt>ArgTypes...</tt>, shall be a valid expression. Invoking a copy of <tt>f</tt> shall behave the same as invoking <tt>f</tt>.
! <p/>
! <ins>-?- <i>Remarks</i>: These constructors shall not participate in overload resolution if <tt>decay&lt;F&gt;::type</tt> 
! is the same type as <tt>std::packaged_task&lt;R(ArgTypes...)&gt;</tt>.</ins>
! </p>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2098"></a>2098. Minor Inconsistency between <tt>promise::set_value</tt> and <tt>promise::set_value_at_thread_exit</tt></h3>
! <p><b>Section:</b> 30.6.5 [futures.promise] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2011-11-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#futures.promise">active issues</a> in [futures.promise].</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.promise">issues</a> in [futures.promise].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 30.6.5 [futures.promise]&#47;16 says that <tt>promise::set_value(const R&amp;)</tt> throws any exceptions 
! thrown by <tt>R</tt>'s copy constructor, and that <tt>promise_set_value(R&amp;&amp;)</tt> throws any exceptions 
! thrown by <tt>R</tt>'s move constructor.
! <p/>
! 30.6.5 [futures.promise]&#47;22 is the Throws: clause for <tt>promise::set_value_at_thread_exit</tt>. It 
! has no corresponding requirements, only that these functions throw "<tt>future_error</tt> if an error condition 
! occurs."
! <p/>
! Daniel suggests wording to fix this: The approach is a bit more ambitious and also attempts to fix wording glitches
! of 30.6.5 [futures.promise]&#47;16, because it would be beyond acceptable efforts of implementations to 
! determine whether a constructor call of a user-defined type will indeed call a copy constructor or move constructor 
! (in the first case it might be a template constructor, in the second case it might also be a copy-constructor, 
! if the type has no move constructor).
! </p>
! 
! <p><i>[2012, Portland: move to Review]</i></p>
! 
! <p>
! Moved to Review by the concurrency working group, with no further comments.
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! <p>Accepted for the working paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Change 30.6.5 [futures.promise]&#47;16 as indicated:</p>
! <blockquote><pre>
! void promise::set_value(const R&amp; r);
! void promise::set_value(R&amp;&amp; r);
! void promise&lt;R&amp;&gt;::set_value(R&amp; r);
! void promise&lt;void&gt;::set_value();
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -16- <i>Throws</i>:
! </p>
! <ul>
! <li><tt>future_error</tt> if its shared state already has a stored value or exception, or</li>
! <li>for the first version, any exception thrown by the <del>copy constructor 
! of</del><ins>constructor selected to copy an object of</ins> <tt>R</tt>, or</li>
! <li>for the second version, any exception thrown by the <del>move constructor 
! of</del><ins>constructor selected to move an object of</ins> <tt>R</tt>.</li>
! </ul>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 30.6.5 [futures.promise]&#47;22 as indicated:</p>
! <blockquote><pre>
! void promise::set_value_at_thread_exit(const R&amp; r);
! void promise::set_value_at_thread_exit(R&amp;&amp; r);
! void promise&lt;R&amp;&gt;::set_value_at_thread_exit(R&amp; r);
! void promise&lt;void&gt;::set_value_at_thread_exit();
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -16- <i>Throws</i>: <del><tt>future_error</tt> if an error condition occurs.</del>
! </p>
! <ul>
! <li><ins><tt>future_error</tt> if its shared state already has a stored value or exception, or</ins></li>
! <li><ins>for the first version, any exception thrown by the constructor selected to copy an object of <tt>R</tt>, or</ins></li>
! <li><ins>for the second version, any exception thrown by the constructor selected to move an object of <tt>R</tt>.</ins></li>
! </ul>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2099"></a>2099. Unnecessary constraints of <tt>va_start()</tt> usage</h3>
! <p><b>Section:</b> 18.10 [support.runtime] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-11-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#support.runtime">active issues</a> in [support.runtime].</p>
! <p><b>View all other</b> <a href="lwg-index.html#support.runtime">issues</a> in [support.runtime].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! In 18.10 [support.runtime] p3 we find (emphasis mine):
! </p>
! <blockquote><p>
! The restrictions that ISO C places on the second parameter to the <tt>va_start()</tt> macro in header <tt>&lt;stdarg.h&gt;</tt>
! are different in this International Standard. The parameter <tt>parmN</tt> is the identifier of the rightmost parameter
! in the variable parameter list of the function definition (the one just before the ...).227 <em>If the parameter
! <tt>parmN</tt> is <strong>declared</strong> with a <strong>function</strong>, <strong>array</strong></em>, or reference type, 
! or with a type that is not compatible with the type that results when passing an argument for which there is no parameter, 
! the behavior is undefined.
! </p></blockquote>
! 
! <p>
! It seems astonishing that the constraints on function types and array types imposes these 
! on the <strong>declared</strong> parameter <tt>parmN</tt>, not to the adjusted one (which would
! not require this extra wording, because that is implicit). This seems to say that a function 
! definition of the form (Thanks to Johannes Schaub for this example)
! </p>
! <blockquote><pre>
! #include &lt;stdarg.h&gt;
! 
! void f(char const paramN[], ...) {
!   va_list ap;
!   va_start(ap, paramN);
!   va_end(ap);
! }
! </pre></blockquote>
! <p>
! would produce undefined behaviour when used.
! <p/>
! Similar wording exists in C99 and in the most recent C11 draft in 7.16.1.4 p4
! <p/>
! In my opinion the constraints in regard to array types and function types are
! unnecessary and should be relaxed. Are there really implementations out in the 
! wild that would (according to my understanding incorrectly) provide the declared and
! not the adjusted type of <tt>paramN</tt> as deduced type to <tt>va_start()</tt>?
! </p>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Ready.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change 18.10 [support.runtime] p3 as indicated:</p>
! <blockquote><p>
! The restrictions that ISO C places on the second parameter to the <tt>va_start()</tt> macro in header <tt>&lt;stdarg.h&gt;</tt>
! are different in this International Standard. The parameter <tt>parmN</tt> is the identifier of the rightmost parameter
! in the variable parameter list of the function definition (the one just before the ...).227 If the parameter
! <tt>parmN</tt> is <del>declared with</del><ins>of</ins> a <del>function, array, or</del> reference type, or 
! <del>with</del><ins>of</ins> a type that is not compatible with the type that results when passing an argument for 
! which there is no parameter, the behavior is undefined.
! </p></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2100"></a>2100. timed waiting functions cannot timeout if <tt>launch::async</tt> policy used</h3>
! <p><b>Section:</b> 30.6.8 [futures.async] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-11-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 30.6.8 [futures.async] p5 says
! </p>
! 
! <blockquote>
! <p>
! If the implementation chooses the <tt>launch::async</tt> policy,
! </p>
! <ul><li>a call to a waiting function on an asynchronous return object that shares the 
! shared state created by this <tt>async</tt> call shall block until the associated thread has
! completed, as if joined (30.3.1.5 [thread.thread.member]);</li>
! </ul>
! </blockquote>
! 
! <p>
! That should say a non-timed waiting function, otherwise, calling a timed waiting function 
! can block indefinitely waiting for the associated thread to complete, rather than timing 
! out after the specified time.
! <p/>
! Since <tt>std::thread</tt> does not provide a <tt>timed_join()</tt> function (nor does
! Pthreads, making it impossible on many platforms) there is no way for a timed waiting 
! function to try to join but return early due to timeout, therefore timed waiting 
! functions either cannot guarantee to timeout or cannot be used to meet the requirement 
! to block until the thread is joined.  In order to allow timed waiting functions to
! timeout the requirement should only apply to non-timed waiting functions.
! </p>
! 
! <p><i>[2012, Portland: move to Review]</i></p>
! 
! <p>
! Detlef: Do we actually need this fix &mdash; is it detectable?
! </p>
! <p>
! Yes &mdash; you will never get a timeout. Should we strike the whole paragraph?
! </p>
! <p>
! Hans: issue with thread local destruction. 
! </p>
! <p>
! Niklas: I have a strong expectation that a timed wait will respect the timeout
! </p>
! <p>
! <em>agreed</em>
! </p>
! <p>
! Detlef: we want a timed wait that does not time out to return like a non-timed wait; but is this implementable?
! </p>
! <p>
! Pablo: Could we simply append ", or else time out"
! </p>
! <p>
! Detlef: the time out on the shared state needs implementing anyway, even if the underlying O/S does not support a timed join.
! </p>
! <p>
! Hans: the net effect is the timeout does not cover the thread local destruction... ah, I see what you're doing
! </p>
! <p>
! Detlef: happy with Pablo's proposal
! </p>
! <p>
! Wording proposed is to append after the word "joined" add ", or else time out"
! </p>
! <p>
! Moved to review with this wording.
! </p>
! 
! <p><i>[2013, Bristol]</i></p>
! 
! 
! <p>
! "Non-timed" made the new wording redundant and the result overly weak. Remove it.
! <p/>
! Attempted to move to add this to the working paper (Concurrency motion 2) without the addition of "non-timed".  
! Motion was withdrawn after Jonathan Wakely expressed implementability concerns.
! </p>
! 
! <p><i>[2013-09, Chicago]</i></p>
! 
! <p>
! Discussion of interaction with the absence of a Posix timed join.
! <p/>
! Jonathan Wakely withdrew his objection, so moved to Immediate.
! <p/>
! Accept for Working Paper
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p><i>[This wording is relative to the FDIS.]</i></p>
! 
! 
! <p>Change 30.6.8 [futures.async] p5 as indicated:</p>
! 
! <blockquote>
! <p>
! If the implementation chooses the <tt>launch::async</tt> policy,
! </p>
! <ul><li>a call to a waiting function on an asynchronous return object 
! that shares the shared state created by this <tt>async</tt> call shall block until the 
! associated thread has completed, as if joined<ins>, or else time out</ins>
! (30.3.1.5 [thread.thread.member]);</li>
! </ul>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2102"></a>2102. Why is <tt>std::launch</tt> an implementation-defined type?</h3>
! <p><b>Section:</b> 30.6.1 [futures.overview] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-11-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.overview">issues</a> in [futures.overview].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 30.6.1 [futures.overview] says <tt>std::launch</tt> is an
! implementation-defined bitmask type, which would usually mean the
! implementation can choose whether to define an enumeration type, or a
! <tt>bitset</tt>, or an integer type. But in the case of <tt>std::launch</tt> it's
! required to be a scoped enumeration type, 
! </p>
! <blockquote><pre>
! enum class launch : <i>unspecified</i> {
!   async = <i>unspecified</i>,
!   deferred = <i>unspecified</i>,
!   <i>implementation-defined</i>
! };
! </pre></blockquote>
! <p>
! so what is implementation-defined about it, and what is an implementation 
! supposed to document about its choice?
! </p>
! 
! <p><i>[2011-12-02 Moved to Tentatively Ready after 6 positive votes on c++std-lib.]</i></p>
!  
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change 30.6.1 [futures.overview] paragraph 2 as indicated:</p>
! 
! <blockquote><p>
! The enum type <tt>launch</tt> is <del>an implementation-defined</del><ins>a</ins> bitmask type 
! (17.5.2.1.3 [bitmask.types]) with <tt>launch::async</tt> and <tt>launch::deferred</tt> 
! denoting individual bits. [ <i>Note</i>: Implementations can provide bitmasks to specify restrictions
! on task interaction by functions launched by <tt>async()</tt> applicable to a corresponding subset of
! available launch policies. Implementations can extend the behavior of the first overload of <tt>async()</tt> by
! adding their extensions to the launch policy under the “as if” rule. &mdash; <i>end note</i> ]
! </p></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2103"></a>2103. <tt>std::allocator_traits&lt;std::allocator&lt;T&gt;&gt;::propagate_on_container_move_assignment</tt></h3>
! <p><b>Section:</b> 20.7.9 [default.allocator] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Ai Azuma <b>Opened:</b> 2011-11-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#default.allocator">issues</a> in [default.allocator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! &quot;<tt>std::allocator_traits&lt;std::allocator&lt;T&gt;&gt;::propagate_on_container_move_assignment::value</tt>&quot;
! is specified as &quot;false&quot;, according to (20.7.9 [default.allocator]) and (20.7.8.1 [allocator.traits.types]).
! However, according to (23.2.1 [container.requirements.general]), this specification leads to the unneeded requirements
! (<tt>MoveInsertable</tt> and <tt>MoveAssignable</tt> of the value type) on the move assignment operator of containers
! with the default allocator. 
! <p/>
! Proposed resolution:
! <p/>
! Either of the following two changes;  
! </p>
! <ol>
! <li>
! adding the nested typedef like
! &quot;<tt>typedef std::true_type propagate_on_container_move_assignment;</tt>&quot;
! in the definition of <tt>std::allocator</tt> class template,
! </li>
! <li>
! adding the explicit partial specialization of
! &quot;<tt>std::allocator_traits</tt>&quot; class template for &quot;<tt>std::allocator</tt>&quot;
! class template, in which &quot;<tt>propagate_on_container_move_assignment</tt>&quot;
! nested typedef is specified as &quot;<tt>std::true_type</tt>&quot;. 
! </li>
! </ol>
! <p>
! Pablo prefers the first resolution.
! </p>
! 
! <p><i>[2011-12-02: Pablo comments]</i></p>
! 
! 
! <p>
! This issue has potentially some overlap with <a href="lwg-defects.html#2108">2108</a>. Should the trait <tt>always_compare_equal</tt>
! been added, this issue's resolution should be improved based on that.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Ready.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change 20.7.9 [default.allocator], the class template <tt>allocator</tt> synopsis as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class T&gt; class allocator;
! 
!   <i>// specialize for <tt>void</tt>:</i>
!   template &lt;&gt; class allocator&lt;void&gt; {
!   public:
!     typedef void* pointer;
!     typedef const void* const_pointer;
!     <i>// reference-to-<tt>void</tt> members are impossible.</i>
!     typedef void value_type;
!     template &lt;class U&gt; struct rebind { typedef allocator&lt;U&gt; other; };
!   };
! 
!   template &lt;class T&gt; class allocator {
!   public:
!     typedef size_t size_type;
!     typedef ptrdiff_t difference_type;
!     typedef T* pointer;
!     typedef const T* const_pointer;
!     typedef T&amp; reference;
!     typedef const T&amp; const_reference;
!     typedef T value_type;
!     template &lt;class U&gt; struct rebind { typedef allocator&lt;U&gt; other; };
!     <ins>typedef true_type propagate_on_container_move_assignment;</ins>
! 
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2104"></a>2104. <tt>unique_lock</tt> move-assignment should not be <tt>noexcept</tt></h3>
! <p><b>Section:</b> 30.4.2.2 [thread.lock.unique] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Anthony Williams <b>Opened:</b> 2011-11-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! I just noticed that the <tt>unique_lock</tt> move-assignment operator is declared <tt>noexcept</tt>. This 
! function may call <tt>unlock()</tt> on the wrapped mutex, which may throw.
! <p/>
! Suggested change: remove the <tt>noexcept</tt> specification from <tt>unique_lock::operator=(unique_lock&amp;&amp;)</tt> 
! in 30.4.2.2 [thread.lock.unique] and 30.4.2.2.1 [thread.lock.unique.cons]. 
! <p/>
! Daniel:
! <p/>
! I think the situation is actually a bit more complex as it initially looks.
! <p/>
! First, the effects of the move-assignment operator are (emphasize mine):
! </p>
! <blockquote><p>
! <i>Effects</i>: <strong>If</strong> <tt>owns</tt> calls <tt>pm->unlock()</tt>.
! </p></blockquote>
! <p>
! Now according to the <tt>BasicLockable</tt> requirements:
! </p>
! <blockquote><p>
! <tt>m.unlock()</tt>
! <p/>
! 3 <i>Requires</i>: The current execution agent shall hold a lock on <tt>m</tt>.
! <p/>
! 4 <i>Effects</i>: Releases a lock on <tt>m</tt> held by the current execution agent.
! <p/>
! <i>Throws</i>: Nothing.
! </p></blockquote>
! <p>
! This shows that unlock itself is a function with narrow contract and for 
! this reasons no unlock function of a mutex or lock itself does have a noexcept 
! specifier according to our mental model.
! <p/>
! Now the move-assignment operator <strong>attempts</strong> to satisfy these
! requirement of the function and calls it only when it assumes that the conditions 
! are ok, so from the view-point of the caller of the move-assignment operator it 
! looks as if the move-assignment operator would in total a function with a
! wide contract.
! <p/>
! The problem with this analysis so far is, that it depends on the assumed 
! correctness of the state "owns".
! <p/>
! Looking at the construction or state-changing functions, there do exist several 
! ones that depend on caller-code satisfying the requirements and there is one 
! guy, who looks most suspicious:
! </p>
! <blockquote><p>
! <tt>unique_lock(mutex_type&amp; m, adopt_lock_t);</tt>
! <p/>
! 11 <i>Requires</i>: The calling thread own the mutex.<br/>
! [&hellip;]<br/>
! 13 <i>Postconditions</i>: <tt>pm == &amp;m</tt> and <tt>owns == true</tt>.<br/>
! </p></blockquote>
! <p>
! because this function does not even call <tt>lock()</tt> (which may, but is not 
! required to throw an exception if the calling thread does already own the mutex). 
! So we have in fact still a move-assignment operator that might throw an exception, 
! if the mutex was either constructed or used (call of lock) incorrectly.
! <p/>
! The correct fix seems to me to also add a "<i>Throws</i>: Nothing" element to
! the move-assignment operator, because using it correctly shall not throw an
! exception.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate after SG1 review]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li>
! <p>Change 30.4.2.2 [thread.lock.unique], class template <tt>unique_lock</tt> synopsis as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Mutex&gt;
!   class unique_lock {
!   public:
!     typedef Mutex mutex_type;
!     [&hellip;]
!     unique_lock(unique_lock&amp;&amp; u) noexcept;
!     unique_lock&amp; operator=(unique_lock&amp;&amp; u) <del>noexcept</del>;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li>
! <p>Change 30.4.2.2.1 [thread.lock.unique.cons] around p22 as indicated:</p>
! 
! <blockquote><pre>
! unique_lock&amp; operator=(unique_lock&amp;&amp; u) <del>noexcept</del>;
! </pre><blockquote>
! <p>
! -22- <i>Effects</i>: If <tt>owns</tt> calls <tt>pm->unlock()</tt>.
! <p/>
! -23- <i>Postconditions</i>: <tt>pm == u_p.pm</tt> and <tt>owns == u_p.owns</tt> (where <tt>u_p</tt> 
! is the state of <tt>u</tt> just prior to this construction), <tt>u.pm == 0</tt> and <tt>u.owns == false</tt>.
! <p/>
! -24- [<i>Note</i>: With a recursive mutex it is possible for both <tt>*this</tt> and <tt>u</tt> to own 
! the same mutex before the assignment. In this case, <tt>*this</tt> will own the mutex after the assignment 
! and <tt>u</tt> will not. &mdash; <i>end note</i>]
! </p>
! <ins>-??- <i>Throws</i>: Nothing.</ins>
! <p/>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2105"></a>2105. Inconsistent requirements on <tt>const_iterator</tt>'s <tt>value_type</tt></h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2011-11-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! In the FDIS, Table 96 specifies <tt>X::const_iterator</tt> as a "constant iterator type 
! whose value type is <tt>T</tt>". However, Table 97 specifies <tt>X::const_reverse_iterator</tt> 
! as an "iterator type whose value type is <tt>const T</tt>" and which is defined as 
! <tt>reverse_iterator&lt;const_iterator&gt;</tt>. But <tt>reverse_iterator::value_type</tt> is 
! just "<tt>typename iterator_traits&lt;Iterator&gt;::value_type</tt>" 24.5.1.1 [reverse.iterator], 
! so <tt>const_iterator</tt> and <tt>const_reverse_iterator</tt> must have the same <tt>value_type</tt>.
! </p>
! <p>
! The resolution to issue <a href="lwg-defects.html#322">322</a> implies that
! <tt>const_reverse_iterator</tt> should change.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Ready.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change Table 97 &mdash; "Reversible container requirements" as indicated</p>
! 
! <table border="1">
! <caption>Table 97 &mdash; Reversible container requirements</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Complexity</th>
! </tr> 
! 
! <tr>
! <td>
! <tt>X::reverse_-<br/>
! iterator</tt>
! </td>
! <td>
! iterator type whose value type<br/>
! is <tt>T</tt>
! </td>
! <td>
! <tt>reverse_iterator&lt;iterator&gt;</tt>
! </td>
! <td>
! compile time
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X::const_-<br/>
! reverse_-<br/>
! iterator</tt>
! </td>
! <td>
! <ins>constant</ins> iterator type whose value type<br/>
! is <tt><del>const</del> T</tt>
! </td>
! <td>
! <tt>reverse_iterator&lt;const_iterator&gt;</tt>
! </td>
! <td>
! compile time
! </td>
! </tr>
! </table>
! 
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2106"></a>2106. <tt>move_iterator</tt> wrapping iterators returning prvalues</h3>
! <p><b>Section:</b> 24.5.3 [move.iterators] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Dave Abrahams <b>Opened:</b> 2011-11-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#move.iterators">issues</a> in [move.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Shouldn't <tt>move_iterator</tt> be specialized so that if the iterator it wraps
! returns a prvalue when dereferenced, the <tt>move_iterator</tt> also returns by
! value? Otherwise, it creates a dangling reference.
! <p/>
! Howard: I believe just changing <tt>move_iterator&lt;I&gt;::reference</tt> would do.
! A direction might be testing on <tt>is_reference&lt;iterator_traits&lt;I&gt;::reference&gt;</tt>, 
! or <tt>is_reference&lt;decltype(*declval&lt;I&gt;())&gt;</tt>.
! <p/>
! Daniel: I would prefer to use a consistent style among the iterator adaptors, so I
! suggest to keep with the <tt>iterator_traits</tt> typedefs if possible. 
! </p>
! <blockquote><pre>
! using reference = typename conditional&lt;
!   is_reference&lt;typename iterator_traits&lt;Iterator&gt;::reference&gt;::value,
!   value_type&amp;&amp;,
!   value_type
! &gt;::type;
! </pre></blockquote>
! <p>
! We might also want to ensure that if <tt>Iterator</tt>'s <tt>reference</tt> type <em>is</em>
! a reference, the referent is equal to <tt>value_type</tt> (after removal of <i>cv</i>-qualifiers). 
! In <em>general</em> we have no such guarantee.
! <p/>
! Marc: In the default case where we don't return <tt>value_type&amp;&amp;</tt>, should we use 
! <tt>value_type</tt> or should we keep the <tt>reference</tt> type of the wrapped iterator?
! <p/>
! Daniel: This suggestion looks appealing at first, but the problem here is that using this typedef
! can make it impossible for <tt>move_iterator</tt> to satisfy its contract, which means returning
! an rvalue of the value type (Currently it says rvalue-reference, but this must be fixed as of
! this issue anyway). I think that user-code can reasonably expect that when it has constructed
! an object <tt>m</tt> of <tt>move_iterator&lt;It&gt;</tt>, where <tt>It</tt> is a valid 
! mutable iterator type, the expression
! </p>
! <blockquote><pre>
! <span style="color:#C80000;font-weight:bold">It::value_type&amp;&amp; rv = *m;</span>
! </pre></blockquote>
! <p>
! is well-formed.
! <p/>
! Let's set <tt>R</tt> equal to <tt>iterator_traits&lt;Iterator&gt;::reference</tt>
! in the following. We can discuss the following situations:
! </p>
! <ol><li><tt>R</tt> is a reference type: We can only return the corresponding xvalue of <tt>R</tt>,
! if <tt>value_type</tt> is reference-related to the referent type, else this is presumably no
! forward iterator and we cannot say much about it, except that it must be convertible to
! <tt>value_type</tt>, so it better should return a prvalue.</li>
! <li><tt>R</tt> is not a reference type: In this case we can rely on a conversion to
! <tt>value_type</tt> again, but not much more. Assume we would return <tt>R</tt> directly,
! this might turn out to have a conversion to an lvalue-reference type of the value type (for
! example). If that is the case, this would indirectly violate the contract of 
! <tt>move_iterator</tt>.</li>
! </ol>
! <p>
! In regard to the first scenario I suggest that implementations are simply required to
! check that <tt>V2 = remove_cv&lt;remove_reference&lt;R&gt;::type&gt;::type</tt> is equal
! to the value type <tt>V1</tt> as a criterion to return this reference as an xvalue, in all other
! cases it should return the value type directly as prvalue.
! <p/>
! The additional advantage of this strategy is, that we always ensure that <tt>reference</tt> has 
! the correct <i>cv</i>-qualification, if <tt>R</tt> is a real reference.
! <p/>
! It is possible to improve this a bit by indeed supporting reference-related types,
! this would require to test <tt>is_same&lt;V1, V2&gt;::value || is_base_of&lt;V1, V2&gt;::value</tt> 
! instead. I'm unsure whether (a) this additional effort is worth it and (b) a strict reading of
! the forward iterator requirements seems not to allow to return a reference-related type (Whether 
! this is a defect or not is another question).
! </p>
! 
! <p><i>[2011-12-05: Marc Glisse comments and splits into two resolution alternatives]</i></p>
! 
! 
! <p>
! I guess I am looking at the speed of:
! </p>
! <blockquote><pre>
! value_type x;
! x = *m;
! </pre></blockquote>
! <p>
! (copy construction would likely trigger copy elision and thus be neutral)
! 
! instead of the validity of:
! </p>
! <blockquote><pre>
! value_type&amp;&amp; x = *m;
! </pre></blockquote>
! <p>
! In this sense, Daniels earlier proposition that ignored <tt>value_type</tt> and just did 
! <tt>switch_lvalue_ref_to_rvalue_ref&lt;reference&gt;</tt> was easier to understand (and it didn't 
! require thinking about reference related types).
! <p/>
! The currently proposed resolution has been split into two alternatives.
! </p>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Review.
! </p>
! <p>
! Alisdair: This only applies to input iterators, so keep that in mind when thinking about this.
! </p>
! <p>
! STL: I see what B is doing, but not A.
! </p>
! <p>
! Howard: I agree.
! </p>
! <p>
! Alisdair: Should we use <tt>add_rvalue_reference</tt>?
! </p>
! <p>
! STL: No, we do not want reference collapsing.
! </p>
! <p>
! STL: Re A, messing with the CV qualification scares me.
! </p>
! <p>
! Alisdair: Agree. That would break my intent.
! </p>
! <p>
! STL: Actually I don't think it's actually wrong, but I still don't see what it's doing.
! </p>
! <p>
! Alisdair: A is picking the value type, B is picking the proxy type.
! </p>
! <p>
! Howard: I like returning the proxy type.
! </p>
! <p>
! STL: Returning a reference (B) seems right, because the requirements say "reference".
! I suspect that B works correctly if you have a move iterator wrapping a move iterator
! wrapping a thing.  I think that A would mess up the type in the middle.
! </p>
! <p>
! Considerable discussion about which version is correct, checking various examples.
! </p>
! <p>
! STL: Still think B is right. Still don't understand A. In A we are losing the proxyness.
! </p>
! <p>
! Howard: Agree 100%. We don't want to lose the proxy. If it's const, so be it.
! </p>
! <p>
! STL: B is also understandable by mortals.
! </p>
! <p>
! Howard: Remove to review, keep A but move it out of the proposed resolution area
! (but keep it for rational).
! </p>
! <p>
! Alisdair: Adding an explanatory note might be a good idea, if someone wants to write one.
! </p>
! <p>
! Walter: Concerned about losing the word "reference" in p.1.
! </p>
! <p>
! Howard: <tt>move_iterator</tt> will return an xvalue or a prvalue, both of which are rvalues.
! </p>
! 
! <p><i>[Proposed resolution A, rejected in preference to the currently proposed resolution (B)
! 
! <ol>
! <li><p>Change 24.5.3 [move.iterators] p1 as indicated:</p>
! 
! <blockquote><p>
! Class template <tt>move_iterator</tt> is an iterator adaptor with the same behavior as the underlying iterator
! except that its dereference operator implicitly converts the value returned by the underlying iterator's
! dereference operator to an rvalue <del>reference</del><ins>of the value type</ins>. Some generic algorithms 
! can be called with move iterators to replace copying with moving.
! </p></blockquote>
! </li>
! 
! <li><p>Change 24.5.3.1 [move.iterator], class template <tt>move_iterator</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Iterator&gt;
!   class move_iterator {
!   public:
!     typedef Iterator iterator_type;
!     typedef typename iterator_traits&lt;Iterator&gt;::difference_type difference_type;
!     typedef Iterator pointer;
!     typedef typename iterator_traits&lt;Iterator&gt;::value_type value_type;
!     typedef typename iterator_traits&lt;Iterator&gt;::iterator_category iterator_category;
!     typedef <del>value_type&amp;&amp;</del><ins><i>see below</i></ins> reference;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Immediately following the class template <tt>move_iterator</tt> synopsis in 
! 24.5.3.1 [move.iterator] insert a new paragraph as indicated:</p>
! 
! <blockquote><p>
! <ins>-?- Let <tt><i>R</i></tt> be <tt>iterator_traits&lt;Iterator&gt;::reference</tt> and
! let <tt><i>V</i></tt> be <tt>iterator_traits&lt;Iterator&gt;::value_type</tt>. If 
! <tt>is_reference&lt;<i>R</i>&gt;::value</tt> is <tt>true</tt> and if 
! <tt>remove_cv&lt;remove_reference&lt;<i>R</i>&gt;::type&gt;::type</tt> is the same type as <tt><i>V</i></tt>, 
! the template instantiation <tt>move_iterator&lt;Iterator&gt;</tt> shall define the nested type 
! named <tt>reference</tt> as a synonym for <tt>remove_reference&lt;<i>R</i>&gt;::type&amp;&amp;</tt>, 
! otherwise as a synonym for <tt><i>V</i></tt>.</ins>
! </p></blockquote>
! </li>
! </ol>
! 
! ]</i></p>
! 
! 
! <p><i>[2012, Portland: Move to Tentatively Ready]</i></p>
! 
! <p>
! AJM wonders if the implied trait might be useful elsewhere, and worth adding to type traits as a
! transformation type trait.
! </p>
! 
! <p>
! Suspicion that the Range SG might find such a trait useful, but wait until there is clear additional
! use of such a trait before standardizing.
! </p>
! 
! <p>
! Minor wording tweak to use <tt>add_rvalue_reference</tt> rather than manually adding the <tt>&amp;&amp;</tt>,
! then move to Tentatively Ready.
! </p>
! 
! <p><i>[2013-01-09 Howard Hinnant comments]</i></p>
! 
! 
! <p>
! I believe the P/R for LWG 2106 is incorrect (item 3).  The way it currently reads, <tt>move_iterator&lt;I&gt;::reference</tt> 
! is <em>always</em> an lvalue reference.  I.e. if <tt>R</tt> is an lvalue reference type, then reference becomes 
! <tt>add_rvalue_reference&lt;R&gt;::type</tt> which is just <tt>R</tt>. And if <tt>R</tt> is not a reference type, 
! then reference becomes <tt>R</tt> (which is also just <tt>R</tt> ;-)).
! </p>
! 
! <p>
! I believe the correct wording is what was there previously:
! </p>
! 
! <p>
! -?- Let <tt>R</tt> be <tt>iterator_traits&lt;Iterator&gt;::reference</tt>. If <tt>is_reference&lt;R&gt;::value</tt> 
! is true, the template instantiation <tt>move_iterator&lt;Iterator&gt;</tt> shall define the nested type named 
! <tt>reference</tt> as a synonym for <tt>remove_reference&lt;R&gt;::type&amp;&amp;</tt>, otherwise as a synonym for 
! <tt>R</tt>.
! </p>
! 
! <p>
! Additionally Marc Glisse points out that <tt>move_iterator&lt;I&gt;::operator*()</tt> should return 
! <tt>static_cast&lt;reference&gt;(*current)</tt>, not <tt>std::move(*current)</tt>.
! </p>
! 
! <p>
! Previous resolution:
! </p>
! <blockquote class="note">
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Change 24.5.3 [move.iterators] p1 as indicated:</p>
! 
! <blockquote><p>
! Class template <tt>move_iterator</tt> is an iterator adaptor with the same behavior as the underlying iterator
! except that its dereference operator implicitly converts the value returned by the underlying iterator's
! dereference operator to an rvalue <del>reference</del>. Some generic algorithms 
! can be called with move iterators to replace copying with moving.
! </p></blockquote>
! </li>
! 
! <li><p>Change 24.5.3.1 [move.iterator], class template <tt>move_iterator</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Iterator&gt;
!   class move_iterator {
!   public:
!     typedef Iterator iterator_type;
!     typedef typename iterator_traits&lt;Iterator&gt;::difference_type difference_type;
!     typedef Iterator pointer;
!     typedef typename iterator_traits&lt;Iterator&gt;::value_type value_type;
!     typedef typename iterator_traits&lt;Iterator&gt;::iterator_category iterator_category;
!     typedef <del>value_type&amp;&amp;</del><ins><i>see below</i></ins> reference;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Immediately following the class template <tt>move_iterator</tt> synopsis in 
! 24.5.3.1 [move.iterator] insert a new paragraph as indicated:</p>
! 
! <blockquote><p>
! <ins>-?- Let <tt><i>R</i></tt> be <tt>iterator_traits&lt;Iterator&gt;::reference</tt>. If 
! <tt>is_reference&lt;<i>R</i>&gt;::value</tt> is <tt>true</tt>, the template instantiation 
! <tt>move_iterator&lt;Iterator&gt;</tt> shall define the nested type named <tt>reference</tt> 
! as a synonym for <tt>add_rvalue_reference&lt;<i>R</i>&gt;::type</tt>, otherwise as a synonym
! for <tt><i>R</i></tt>.</ins>
! </p></blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2014-05-19, Daniel comments]</i></p>
! 
! <p>
! The term <em>instantiation</em> has been changed to <em>specialization</em> in the newly added paragraph as
! suggested by STL and much preferred by myself.
! </p>
! 
! <p><i>[2014-05-19 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on five votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 24.5.3 [move.iterators] p1 as indicated:</p>
! 
! <blockquote><p>
! Class template <tt>move_iterator</tt> is an iterator adaptor with the same behavior as the underlying iterator
! except that its indirection operator implicitly converts the value returned by the underlying iterator's
! indirection operator to an rvalue <del>reference</del>. Some generic algorithms 
! can be called with move iterators to replace copying with moving.
! </p></blockquote>
! </li>
! 
! <li><p>Change 24.5.3.1 [move.iterator], class template <tt>move_iterator</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Iterator&gt;
!   class move_iterator {
!   public:
!     typedef Iterator iterator_type;
!     typedef typename iterator_traits&lt;Iterator&gt;::difference_type difference_type;
!     typedef Iterator pointer;
!     typedef typename iterator_traits&lt;Iterator&gt;::value_type value_type;
!     typedef typename iterator_traits&lt;Iterator&gt;::iterator_category iterator_category;
!     typedef <del>value_type&amp;&amp;</del><ins><i>see below</i></ins> reference;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Immediately following the class template <tt>move_iterator</tt> synopsis in 
! 24.5.3.1 [move.iterator] insert a new paragraph as indicated:</p>
! 
! <blockquote><p>
! <ins>-?- Let <tt><i>R</i></tt> be <tt>iterator_traits&lt;Iterator&gt;::reference</tt>. If 
! <tt>is_reference&lt;<i>R</i>&gt;::value</tt> is <tt>true</tt>, the template specialization 
! <tt>move_iterator&lt;Iterator&gt;</tt> shall define the nested type named <tt>reference</tt> 
! as a synonym for <tt>remove_reference&lt;<i>R</i>&gt;::type&amp;&amp;</tt>, otherwise as a synonym
! for <tt><i>R</i></tt>.</ins>
! </p></blockquote>
! </li>
! 
! <li><p>Edit 24.5.3.3.4 [move.iter.op.star] p1 as indicated:</p>
! <blockquote><pre>
! reference operator*() const;
! </pre><blockquote>
! <p>
! -1- <i>Returns</i>: <tt><del>std::move</del><ins>static_cast&lt;reference&gt;</ins>(*current)</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2108"></a>2108. No way to identify allocator types that always compare equal</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2011-12-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Whether two allocator objects compare equal affects the complexity of
! container copy and move assignments and also the possibility of an
! exception being thrown by container move assignments. The latter point
! means container move assignment cannot be <tt>noexcept</tt> when
! <tt>propagate_on_container_move_assignment</tt> (POCMA) is false for the
! allocator because there is no way to detect at compile-time if two
! allocators will compare equal. LWG <a href="lwg-defects.html#2013">2013</a> means this affects all
! containers using <tt>std::allocator</tt>, but even if that is resolved, this
! affects all stateless allocators which do not explicitly define POCMA
! to <tt>true_type</tt>.
! <p/>
! One solution would be to add an "always_compare_equal" trait to
! <tt>allocator_traits</tt>, but that would be duplicating information that is
! already defined by the type's equality operator if that operator
! always returns true. Requiring users to write <tt>operator==</tt> that simply
! returns true and also explicitly override a trait to repeat the same
! information would be unfortunate and risk user errors that allow the
! trait and actual <tt>operator==</tt> to disagree.
! <p/>
! Dave Abrahams suggested a better solution in message c++std-lib-31532,
! namely to allow <tt>operator==</tt> to return <tt>true_type</tt>, which is convertible
! to <tt>bool</tt> but also detectable at compile-time. Adopting this as the
! recommended way to identify allocator types that always compare equal
! only requires a slight relaxation of the allocator requirements so
! that <tt>operator==</tt> is not required to return <tt>bool</tt> exactly.
! <p/>
! The allocator requirements do not make it clear that it is well-defined 
! to compare non-const values, that should be corrected too.
! <p/>
! In message c++std-lib-31615 Pablo Halpern suggested an <tt>always_compare_equal</tt> 
! trait that could still be defined, but with a sensible default value rather 
! than requiring users to override it, and using that to set sensible values for 
! other allocator traits:
! </p>
! <blockquote><p>
! Do we still need <tt>always_compare_equal</tt> if we can have an <tt>operator==</tt>
! that returns <tt>true_type</tt>?  What would its default value be? <tt>is_empty&lt;A&gt;
! || is_convertible&lt;decltype(a == a), true_type&gt;::value</tt>, perhaps?  One
! benefit I see to such a definition is that stateless C++03 allocators
! that don't use the <tt>true_type</tt> idiom will still benefit from the new
! trait.
! <p/>
! [&hellip;]
! <p/>
! One point that I want to ensure doesn't get lost is that if we adopt some sort of 
! <tt>always_compare_equal</tt>-like trait, then <tt>propagate_on_container_swap</tt> 
! and <tt>propagate_on_container_move_assignment</tt> should default to 
! <tt>always_compare_equal</tt>. Doing this will eliminate unnecessary requirements 
! on the container element type, as per [LWG <a href="lwg-defects.html#2103">2103</a>].
! </p></blockquote>
! <p>
! Optionally, <tt>operator==</tt> for <tt>std::allocator</tt> could be made to return 
! <tt>true_type</tt>, however if LWG <a href="lwg-defects.html#2103">2103</a> is adopted that is less important.
! <p/>
! Alberto Ganesh Barbati: Suggest either <tt>always_compare_equal</tt>,
! <tt>all_objects_(are_)equivalent</tt>, or <tt>all_objects_compare_equal</tt>.
! </p>
! 
! <p><i>[2014-11-07 Urbana]</i></p>
! 
! <p>
! Resolved by N4258
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li><p>Change Table 27 &mdash; "Descriptive variable definitions" in 17.6.3.5 [allocator.requirements]:</p>
! 
! <table border="1">
! <caption>Table 27 &mdash; Descriptive variable definitions</caption>
! <tr>
! <th>Variable</th>
! <th>Definition</th>
! </tr> 
! 
! <tr>
! <td>
! <tt>a3<ins>, a4</ins></tt>
! </td>
! <td>
! <del>an rvalue of</del><ins>values of (possibly <tt>const</tt>)</ins> type <tt>X</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>b</tt>
! </td>
! <td>
! a value of <ins>(possibly <tt>const</tt>)</ins> type <tt>Y</tt>
! </td>
! </tr>
! 
! </table>
! 
! </li>
! 
! <li><p>Change Table 28 &mdash; "Allocator requirements" in 17.6.3.5 [allocator.requirements]:</p>
! 
! <table border="1">
! <caption>Table 28 &mdash; Allocator requirements</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Default</th>
! </tr> 
! 
! <tr>
! <td>
! <tt><del>a1 == a2</del><ins>a3 == a4</ins></tt>
! </td>
! <td>
! <ins>convertible to</ins> <tt>bool</tt>
! </td>
! <td>
! returns true only if storage<br/>
! allocated from each can be<br/>
! deallocated via the other.<br/>
! <tt>operator==</tt> shall be reflexive,<br/>
! symmetric, and transitive, and<br/>
! shall not exit via an exception.
! </td>
! <td>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt><del>a1 != a2</del><ins>a3 != a4</ins></tt>
! </td>
! <td>
! <ins>convertible to</ins> <tt>bool</tt>
! </td>
! <td>
! same as <tt><del>!(a1 == a2)</del><ins>!(a3 == a4)</ins></tt>
! </td>
! <td>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a<ins>3</ins> == b</tt>
! </td>
! <td>
! <ins>convertible to</ins> <tt>bool</tt>
! </td>
! <td>
! same as <tt>a<ins>3</ins> ==<br/>
! Y::rebind&lt;T&gt;::other(b)</tt>
! </td>
! <td>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a<ins>3</ins> != b</tt>
! </td>
! <td>
! <ins>convertible to</ins> <tt>bool</tt>
! </td>
! <td>
! same as <tt>!(a<ins>3</ins> == b)</tt>
! </td>
! <td>
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>[&hellip;]</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.select_on_-<br/>
! container_copy_-<br/>
! construction()</tt>
! </td>
! <td>
! <tt>X</tt>
! </td>
! <td>
! Typically returns either <tt>a</tt> or<br/>
! <tt>X()</tt>
! </td>
! <td>
! <tt>return a;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>X::always_compares_equal</tt></ins>
! </td>
! <td>
! <ins>Identical to or derived<br/>
! from <tt>true_type</tt> or<br/>
! <tt>false_type</tt></ins>
! </td>
! <td>
! <ins><tt>true_type</tt> if the expression <tt>x1 == x2</tt> is<br/>
! guaranteed to be <tt>true</tt> for any two (possibly<br/>
! <tt>const</tt>) values <tt>x1, x2</tt> of type <tt>X</tt>, when<br/>
! implicitly converted to <tt>bool</tt>. See Note B, below.</ins>
! </td>
! <td>
! <ins><tt>true_type</tt>, if <tt>is_empty&lt;X&gt;::value</tt> is <tt>true</tt> or if<br/>
! <tt>decltype(declval&lt;const X&amp;&gt;() == declval&lt;const X&amp;&gt;())</tt><br/> 
! is convertible to <tt>true_type</tt>, otherwise <tt>false_type</tt>.</ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>[&hellip;]</tt>
! </td>
! </tr>
! 
! </table>
! <p>
! Note A: [&hellip;]
! <p/>
! <ins>Note B: If <tt>X::always_compares_equal::value</tt> or <tt>XX::always_compares_equal::value</tt> evaluate 
! to <tt>true</tt> and an expression equivalent to <tt>x1 == x2</tt> or <tt>x1 != x2</tt> for any two values 
! <tt>x1, x2</tt> of type <tt>X</tt> evaluates to <tt>false</tt> or <tt>true</tt>, respectively, the behaviour 
! is undefined.</ins>
! </p>
! 
! </li>
! 
! <li><p>Change class template <tt>allocator_traits</tt> synopsis, 20.7.8 [allocator.traits] as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class Alloc&gt; struct allocator_traits {
!     typedef Alloc allocator_type;
!     [&hellip;]
!     <ins>typedef <i>see below</i> always_compares_equal;</ins>
!     typedef <i>see below</i> propagate_on_container_copy_assignment;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Insert the following between 20.7.8.1 [allocator.traits.types] p6 and p7 as indicated:</p>
! 
! <blockquote><pre>
! <ins>typedef <i>see below</i> always_compares_equal;</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Type</i>: <tt>Alloc::always_compares_equal</tt> if such a type exists; otherwise, 
! <tt>true_type</tt> if <tt>is_empty&lt;Alloc&gt;::value</tt> is <tt>true</tt> or if 
! <tt>decltype(declval&lt;const Alloc&amp;&gt;() == declval&lt;const Alloc&amp;&gt;())</tt> 
! is convertible to <tt>true_type</tt>; otherwise, <tt>false_type</tt>
! .</ins>
! </p>
! </blockquote></blockquote>
! <blockquote><pre>
! typedef <i>see below</i> propagate_on_container_copy_assignment;
! </pre><blockquote>
! <p>
! -7- <i>Type</i>: <tt>Alloc::propagate_on_container_copy_assignment</tt> if such a type exits, 
! otherwise <tt>false_type</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change class template <tt>allocator</tt> synopsis, 20.7.9 [default.allocator] as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class T&gt; class allocator;
! 
!   <i>// specialize for <tt>void</tt>:</i>
!   template &lt;&gt; class allocator&lt;void&gt; {
!   public:
!     typedef void* pointer;
!     typedef const void* const_pointer;
!     <i>// reference-to-<tt>void</tt> members are impossible.</i>
!     typedef void value_type;
!     template &lt;class U&gt; struct rebind { typedef allocator&lt;U&gt; other; };
!   };
! 
!   template &lt;class T&gt; class allocator {
!   public:
!     typedef size_t size_type;
!     typedef ptrdiff_t difference_type;
!     typedef T* pointer;
!     typedef const T* const_pointer;
!     typedef T&amp; reference;
!     typedef const T&amp; const_reference;
!     typedef T value_type;
!     template &lt;class U&gt; struct rebind { typedef allocator&lt;U&gt; other; };
!     <ins>typedef true_type always_compares_equal;</ins>
! 
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2109"></a>2109. Incorrect requirements for <tt>hash</tt> specializations</h3>
! <p><b>Section:</b> 19.5.5 [syserr.hash], 20.8.2.7 [util.smartptr.hash], 20.9.13 [unord.hash], 20.14.1 [type.index.synopsis], 21.6 [basic.string.hash], 23.3.7 [vector.bool], 30.3.1.1 [thread.thread.id] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-12-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 20.8.2.7 [util.smartptr.hash] p2 is specified as follows:
! </p>
! 
! <blockquote><p>
! <i>Requires</i>: the template specializations shall meet the requirements of class template 
! <tt>hash</tt> (20.8.12).
! </p></blockquote>
! 
! <p>
! The problem here is the usage of a <i>Requires</i> element, which is actually a pre-condition
! that a <em>user</em> of a component has to satisfy. But the intent of this wording is actually
! to be a requirement on implementations. The <i>Requires</i> element should be removed here and
! the wording should be improved to say what it was intended for.
! <p/>
! We have similar situations in basically all other places where the specification of library-provided
! <tt>hash</tt> specializations is defined. Usually, the <i>Requires</i> element is incorrect. In the
! special case of <tt>hash&lt;unique_ptr&lt;T, D&gt;&gt;</tt> the implementation depends on 
! the behaviour of <tt>hash</tt> specializations, that could be user-provided. In this case
! the specification needs to separate the requirements on these specializations and those
! that are imposed on the implementation.
! </p>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Update wording and move to Review.
! </p>
! <p>
! Believe a simpler formulation is to simply string the term <i>Requires:</i> and leave the
! current wording intact, rather than strike the whole clause and replace it.
! </p>
! 
! <p><i>[Originally proposed wording for reference
! <ol>
! <li><p>Change 19.5.5 [syserr.hash] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;error_code&gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: the template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
! <tt>&lt;system_error&gt;</tt> provides a definition for a specialization of the 
! template <tt>hash&lt;error_code&gt;</tt>. The requirements for the members of 
! this specialization are given in sub-clause 20.9.13 [unord.hash]</ins>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 20.6.3 [bitset.hash] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;size_t N&gt; struct hash&lt;bitset&lt;N&gt; &gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: the template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
! <tt>&lt;bitset&gt;</tt> provides a definition for a partial specialization of the 
! <tt>hash</tt> class template for specializations of class template <tt>bitset&lt;N&gt;</tt>. 
! The requirements for the members of instantiations of this specialization are given 
! in sub-clause 20.9.13 [unord.hash]</ins>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 20.8.2.7 [util.smartptr.hash] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class T, class D&gt; struct hash&lt;unique_ptr&lt;T, D&gt; &gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: the template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
! <tt>&lt;memory&gt;</tt> provides a definition for a partial specialization of the 
! <tt>hash</tt> class template for specializations of class template <tt>unique_ptr&lt;T, D&gt;</tt>. 
! The requirements for the members of instantiations of this specialization are given 
! in sub-clause 20.9.13 [unord.hash]</ins>. For an object <tt>p</tt> of type 
! <tt>UP</tt>, where <tt>UP</tt> is <tt>unique_ptr&lt;T, D&gt;</tt>, 
! <tt>hash&lt;UP&gt;()(p)</tt> shall evaluate to the same value as 
! <tt>hash&lt;typename UP::pointer&gt;()(p.get())</tt>. <del>The specialization 
! <tt>hash&lt;typename UP::pointer&gt;</tt> shall be well-formed.</del>
! <p/>
! <ins>-?- <i>Requires</i>: The specialization <tt>hash&lt;typename UP::pointer&gt;</tt> 
! shall be well-formed and well-defined [<i>Note:</i> the general requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash]) are implied &mdash; 
! <i>end note</i>].</ins>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class T&gt; struct hash&lt;shared_ptr&lt;T&gt; &gt;;
! </pre><blockquote>
! <p>
! -2- <del><i>Requires</i>: the template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
! <tt>&lt;memory&gt;</tt> provides a definition for a partial specialization of the 
! <tt>hash</tt> class template for specializations of class template <tt>shared_ptr&lt;T&gt;</tt>. 
! The requirements for the members of instantiations of this specialization are given 
! in sub-clause 20.9.13 [unord.hash]</ins>. For an object <tt>p</tt> of type 
! <tt>shared_ptr&lt;T&gt;</tt>, <tt>hash&lt;shared_ptr&lt;T&gt; &gt;()(p)</tt> 
! shall evaluate to the same value as <tt>hash&lt;T*&gt;()(p.get())</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 20.9.13 [unord.hash] p2 as indicated: [<i>Comment</i>: For unknown
! reasons the extended integer types are not mentioned here, which looks like an oversight to
! me and makes also the wording more complicated. See <a href="lwg-active.html#2119">2119</a> for this part
! of the problem. &mdash; <i>end comment</i>]</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;bool&gt;;
! template &lt;&gt; struct hash&lt;char&gt;;
! [&hellip;]
! template &lt;&gt; struct hash&lt;long double&gt;;
! template &lt;class T&gt; struct hash&lt;T*&gt;;
! </pre><blockquote>
! <p>
! -2- <del><i>Requires</i>: the template specializations shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
! <tt>&lt;functional&gt;</tt> provides definitions for specializations of the 
! <tt>hash</tt> class template for each <i>cv</i>-unqualified arithmetic type except 
! for the extended integer types. This header also provides a definition for a partial 
! specialization of the <tt>hash</tt> class template for any pointer type. The 
! requirements for the members of these specializations are given in sub-clause 
! 20.9.13 [unord.hash]</ins>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 20.14.4 [type.index.hash] p1 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;type_index&gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: the template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
! <tt>&lt;typeindex&gt;</tt> provides a definition for a specialization of the 
! template <tt>hash&lt;type_index&gt;</tt>. The requirements for the members 
! of this specialization are given in sub-clause 20.9.13 [unord.hash]</ins>. For 
! an object <tt>index</tt> of type <tt>type_index</tt>, <tt>hash&lt;type_index&gt;()(index)</tt> 
! shall evaluate to the same result as <tt>index.hash_code()</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 21.6 [basic.string.hash] p1 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;string&gt;;
! template &lt;&gt; struct hash&lt;u16string&gt;;
! template &lt;&gt; struct hash&lt;u32string&gt;;
! template &lt;&gt; struct hash&lt;wstring&gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: the template specializations shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
! <tt>&lt;string&gt;</tt> provides definitions for specializations of the 
! <tt>hash</tt> class template for the types <tt>string</tt>, <tt>u16string</tt>,
! <tt>u32string</tt>, and <tt>wstring</tt>. The requirements for the members 
! of these specializations are given in sub-clause 20.9.13 [unord.hash]</ins>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 23.3.7 [vector.bool] p7 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class Allocator&gt; struct hash&lt;vector&lt;bool, Allocator&gt; &gt;;
! </pre><blockquote>
! <p>
! -7- <del><i>Requires</i>: the template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
! <tt>&lt;vector&gt;</tt> provides a definition for a partial specialization of the 
! <tt>hash</tt> class template for specializations of class template <tt>vector&lt;bool, Allocator&gt;</tt>. 
! The requirements for the members of instantiations of this specialization are given 
! in sub-clause 20.9.13 [unord.hash]</ins>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 30.3.1.1 [thread.thread.id] p14 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;thread::id&gt;;
! </pre><blockquote>
! <p>
! -14- <del><i>Requires</i>: the template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash])</del><ins>The header 
! <tt>&lt;thread&gt;</tt> provides a definition for a specialization of the 
! template <tt>hash&lt;thread::id&gt;</tt>. The requirements for the members of this 
! specialization are given in sub-clause 20.9.13 [unord.hash]</ins>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! ]</i></p>
! 
! 
! <p><i>[2012, Portland: Move to Tentatively Ready]</i></p>
! 
! <p>
! No further wording issues, so move to Tentatively Ready (post meeting issues processing).
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li><p>Change 19.5.5 [syserr.hash] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;error_code&gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: t</del><ins>T</ins>he template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash].
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 20.6.3 [bitset.hash] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;size_t N&gt; struct hash&lt;bitset&lt;N&gt; &gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: t</del><ins>T</ins>he template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash]).
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 20.8.2.7 [util.smartptr.hash] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class T, class D&gt; struct hash&lt;unique_ptr&lt;T, D&gt; &gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: t</del><ins>T</ins>he template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash]). For an object <tt>p</tt> of type 
! <tt>UP</tt>, where <tt>UP</tt> is <tt>unique_ptr&lt;T, D&gt;</tt>, 
! <tt>hash&lt;UP&gt;()(p)</tt> shall evaluate to the same value as 
! <tt>hash&lt;typename UP::pointer&gt;()(p.get())</tt>.  <del>The specialization 
! <tt>hash&lt;typename UP::pointer&gt;</tt> shall be well-formed.</del>
! <p/>
! <ins>-?- <i>Requires</i>: The specialization <tt>hash&lt;typename UP::pointer&gt;</tt> 
! shall be well-formed and well-defined, and shall meet the requirements of class template
! <tt>hash</tt> (20.9.13 [unord.hash]).</ins>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;class T&gt; struct hash&lt;shared_ptr&lt;T&gt; &gt;;
! </pre><blockquote>
! <p>
! -2- <del><i>Requires</i>: t</del><ins>T</ins>he template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash]). For an object <tt>p</tt> of type 
! <tt>shared_ptr&lt;T&gt;</tt>, <tt>hash&lt;shared_ptr&lt;T&gt; &gt;()(p)</tt> 
! shall evaluate to the same value as <tt>hash&lt;T*&gt;()(p.get())</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 20.9.13 [unord.hash] p2 as indicated: [<i>Comment</i>: For unknown
! reasons the extended integer types are not mentioned here, which looks like an oversight to
! me and makes also the wording more complicated. See <a href="lwg-active.html#2119">2119</a> for this part
! of the problem. &mdash; <i>end comment</i>]</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;bool&gt;;
! template &lt;&gt; struct hash&lt;char&gt;;
! [&hellip;]
! template &lt;&gt; struct hash&lt;long double&gt;;
! template &lt;class T&gt; struct hash&lt;T*&gt;;
! </pre><blockquote>
! <p>
! -2- <del><i>Requires</i>: t</del><ins>T</ins>he template specializations shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash]).
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 20.14.4 [type.index.hash] p1 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;type_index&gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: t</del><ins>T</ins>he template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash]). For 
! an object <tt>index</tt> of type <tt>type_index</tt>, <tt>hash&lt;type_index&gt;()(index)</tt> 
! shall evaluate to the same result as <tt>index.hash_code()</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 21.6 [basic.string.hash] p1 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;string&gt;;
! template &lt;&gt; struct hash&lt;u16string&gt;;
! template &lt;&gt; struct hash&lt;u32string&gt;;
! template &lt;&gt; struct hash&lt;wstring&gt;;
! </pre><blockquote>
! <p>
! -1- <del><i>Requires</i>: t</del><ins>T</ins>he template specializations shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash]).
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 23.3.7 [vector.bool] p7 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class Allocator&gt; struct hash&lt;vector&lt;bool, Allocator&gt; &gt;;
! </pre><blockquote>
! <p>
! -7- <del><i>Requires</i>: t</del><ins>T</ins>he template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash]).
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 30.3.1.1 [thread.thread.id] p14 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;&gt; struct hash&lt;thread::id&gt;;
! </pre><blockquote>
! <p>
! -14- <del><i>Requires</i>: t</del><ins>T</ins>he template specialization shall meet the requirements 
! of class template <tt>hash</tt> (20.9.13 [unord.hash]).
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2110"></a>2110. <tt>remove</tt> can't swap but note says it might</h3>
! <p><b>Section:</b> 25.3.8 [alg.remove] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2011-12-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.remove">issues</a> in [alg.remove].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 25.3.8 [alg.remove]&#47;p1 says:
! </p>
! 
! <blockquote><p>
! 1 <i>Requires</i>: The type of <tt>*first</tt> shall satisfy the <tt>MoveAssignable</tt> requirements (Table 22).
! </p></blockquote>
! 
! <p>
! This means that <tt>remove</tt>&#47;<tt>remove_if</tt> can only use move assignment to permute the sequence. But then 
! 25.3.8 [alg.remove]&#47;p6 (non-normatively) contradicts p1:
! </p>
! 
! <blockquote><p>
! 6 <i>Note</i>: each element in the range <tt>[ret,last)</tt>, where <tt>ret</tt> is the returned value, has a valid 
! but unspecified state, because the algorithms can eliminate elements by swapping with or moving from elements that 
! were originally in that range.
! </p></blockquote>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Ready.
! </p>
! <p>
! Alisdair notes we could extend permission to use <tt>swap</tt> if it is available, but there
! is no interest.  Accept the proposed resolution as written.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change 25.3.8 [alg.remove] as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class ForwardIterator, class T&gt;
!   ForwardIterator remove(ForwardIterator first, ForwardIterator last,
!                          const T&amp; value);
! 
! template&lt;class ForwardIterator, class Predicate&gt;
!   ForwardIterator remove_if(ForwardIterator first, ForwardIterator last,
!                             Predicate pred);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -6-<i>Note</i>: each element in the range <tt>[ret,last)</tt>, where <tt>ret</tt> is the 
! returned value, has a valid but unspecified state, because the algorithms can eliminate 
! elements by <del>swapping with or</del> moving from elements that were originally in that range.
! </p>
! </blockquote></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2112"></a>2112. User-defined classes that cannot be derived from</h3>
! <p><b>Section:</b> 17.6.5 [conforming], 20.7.8 [allocator.traits], 20.13.1 [allocator.adaptor.syn] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2011-11-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#conforming">issues</a> in [conforming].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! It is a very established technique for implementations to derive internally from user-defined class types that are
! used to customize some library component, e.g. deleters and allocators are typical candidates. The advantage of this
! approach is to possibly take advantage of the empty-base-class optimization (EBCO).
! <p/>
! Whether or whether not libraries did take advantage of such a detail didn't much matter in C++03. Even though there
! did exist a portable idiom to prevent that a class type could be derived from, this idiom has never reached great
! popularity: The <a href="http://en.wikibooks.org/wiki/More_C%2B%2B_Idioms/Final_Class">technique</a> required
! to introduce a virtual base class and it did not really prevent the derivation, but only any construction of
! such a type. Further, such types are not <em>empty</em> as defined by the <tt>std::is_empty</tt> trait, so
! could easily be detected by implementations from TR1 on.
! <p/>
! With the new C++11 feature of final classes and final member functions it is now very easy to define an empty,
! but not derivable from class type. From the point of the user it is quite natural to use this feature for
! types that he or she did not foresee to be derivable from.
! <p/>
! On the other hand, most library implementations (including third-party libraries) often take advantage of EBCO 
! applied to user-defined types used to instantiate library templates internally. As the time of submitting this 
! issue the following program failed to compile on all tested library implementations:
! </p>
! <blockquote><pre>
! #include &lt;memory&gt;
! 
! struct Noop <span style="color:#C80000;font-weight:bold">final</span> {
!  template&lt;class Ptr&gt;
!  void operator()(Ptr) const {}
! };
! 
! std::unique_ptr&lt;int, Noop&gt; up;
! </pre></blockquote>
! <p>
! In addition, many <tt>std::tuple</tt> implementations with empty, final classes as element types failed as well, 
! due to a popular inheritance-based implementation technique. EBCO has also a long tradition to be 
! used in library containers to efficiently store potentially stateless, empty allocators.
! <p/>
! It seems that both user and library did the best they could: None of the affected types did impose explicit
! requirements on the corresponding user-defined types to be derivable from (This capability was not part of
! the required operations), and libraries did apply EBCO whereever possible to the convenience of the customer.
! <p/>
! Nonetheless given the existence of non-derivable-from class types in C++11, libraries have to cope with
! failing derivations. How should that problem be solved?
! <p/>
! It would certainly be possible to add weazel wording to the allocator requirements similar to what we had
! in C++03, but restricted to derivation-from requirements. I consider this as the bad solution, because it
! would add new requirements that never had existed before in this explicit form onto types like allocators.
! <p/>
! Existing libraries presumably will need internal traits like <tt>__is_final</tt> or <tt>__is_derivable</tt>
! to make EBCO possible in the current form but excluding non-derivable class types. As of this writing this
! seems to happen already. Problem is that without a <tt>std::is_derivable</tt> trait, third-party libraries
! have no portable means to do the same thing as standard library implementations. This should be a good 
! reason to make such a trait public available soon, but seems not essential to have now. Further, this issue
! should also be considered as a chance to recognice that EBCO has always been a very special corner case
! (There exist parallels to the previously existing odd core language rule that did make the interplay 
! between <tt>std::auto_ptr</tt> and <tt>std::auto_ptr_ref</tt> possible) and that it would be better to
! provide explicit means for space-efficient storage, not necessarily restricted to inheritance relations, 
! e.g. by marking data members with a special attribute.
! <p/>
! At least two descriptions in the current standard should be fixed now for better clarification:
! </p>
! <ol>
! <li><p>As mentioned by Ganesh, 20.7.8 [allocator.traits] p1 currently contains a (non-normative) note
! "Thus, it is always possible to create a derived class from an allocator." which should be removed.
! </p>
! </li>
! <li><p>As pointed out by Howard, the specification of <tt>scoped_allocator_adaptor</tt> as of
! 20.13.1 [allocator.adaptor.syn] already requires derivation from <tt>OuterAlloc</tt>, but 
! only implies indirectly the same for the inner allocators due to the <em>exposition-only</em> 
! description of member <tt>inner</tt>. This indirect implication should be normatively required for 
! all participating allocators.
! </p></li>
! </ol>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! What we really need is a type trait to indicate if a type can be derived from.  Howard reports
! Clang and libc++ have had success with this approach.
! </p>
! <p>
! Howard to provide wording, and AJM to alert Core that we may be wanting to add a new trait
! that requires compiler support.
! </p>
! 
! <p><i>[2014-02, Issaquah: Howard and Daniel comment and provide wording]</i></p>
! 
! 
! <p>
! Several existing C++11 compilers do already provide an internal <tt>__is_final</tt> intrinsic (e.g. clang and gcc) and therefore 
! we believe that this is evidence enough that this feature is implementable today.
! <p/>
! We believe that both a simple and clear definition of the <tt>is_final</tt> query should result in a true outcome 
! if and only if the current existing language definition holds that a complete class type (either union or non-union) 
! has been marked with the <i>class-virt-specifier</i> <code>final</code> &mdash; nothing more.
! <p/>
! The following guidelines lead to the design decision and the wording choice given below:
! <p/>
! It has been expressed several times that a high-level trait such as "<tt>is_derivable</tt>" would be preferred and
! would be more useful for non-experts. One problem with that request is that it is astonishingly hard to find a common denominator 
! for what the <em>precise</em> definition of this trait should be, especially regarding corner-cases. Another example of getting very 
! differing points of view is to ask a bunch of C++ experts what the best definition of the <tt>is_empty</tt> trait
! should be (which can be considered as a kind of higher-level trait).
! <p/>
! Once we have a fundamental trait like <tt>is_final</tt> available, we can easily define higher-level traits in the future
! on top of this by a proper logical combination of the low-level traits.
! <p/>
! A critical question is whether providing such a low-level compile-time introspection might be considered as disadvantageous,
! because it could constrain the freedom of existing implementations even further and whether a high-level trait would solve
! this dilemma. We assert that since C++11 the static introspection capabilities are already very large and we believe that
! making the presence or absence of the <tt>final</tt> keyword testable does not make the current situation worse.
! <p/>
! Below code example demonstrates the intention and the implementability of this feature:
! </p>
! <blockquote><pre>
! #include &lt;type_traits&gt;
! 
! namespace std
! {
! 
! template &lt;class T&gt;
! struct is_final
!   : public integral_constant&lt;bool, __is_final(T)&gt;
! {};
! 
! }  // std
! 
! // test it
! 
! union FinalUnion <span style="color:#009900;font-weight:bolder">final</span> { };
! 
! union NonFinalUnion { };
! 
! class FinalClass <span style="color:#009900;font-weight:bolder">final</span> { };
! 
! struct NonFinalClass { };
! 
! class Incomplete;
! 
! int main()
! {
!   using std::is_final;
!   static_assert( is_final&lt;const volatile FinalUnion&gt;{}, "");
!   static_assert(!is_final&lt;FinalUnion[]&gt;{}, "");
!   static_assert(!is_final&lt;FinalUnion[1]&gt;{}, "");
!   static_assert(!is_final&lt;NonFinalUnion>{}, "");
!   static_assert( is_final&lt;FinalClass&gt;{}, "");
!   static_assert(!is_final&lt;FinalClass&amp;&gt;{}, "");
!   static_assert(!is_final&lt;FinalClass*&gt;{}, "");
!   static_assert(!is_final&lt;NonFinalClass&gt;{}, "");
!   static_assert(!is_final&lt;void&gt;{}, "");
!   static_assert(!is_final&lt;int&gt;{}, "");
!   static_assert(!is_final&lt;Incomplete&gt;{}, ""); // <span style="color:#C80000;font-weight:bolder">error incomplete type 'Incomplete' used in type trait expression</span>
! }
! </pre></blockquote>
! 
! <p><i>[2014-02-14, Issaquah: Move to Immediate]</i></p>
! 
! <p>
! This is an important issue, that we really want to solve for C++14.
! </p>
! 
! <p>
! Move to Immediate after polling LEWG, and then the NB heads of delegation.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Change 20.10.2 [meta.type.synop], header <tt>&lt;type_traits&gt;</tt> synopsis, as indicated</p>
! 
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   <i>// 20.10.4.3, type properties:</i>
!   [&hellip;]
!   template &lt;class T&gt; struct is_empty;
!   template &lt;class T&gt; struct is_polymorphic;
!   template &lt;class T&gt; struct is_abstract;
!   <ins>template &lt;class T&gt; struct is_final;</ins>
! 
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 20.10.4.3 [meta.unary.prop], Table 49 &mdash; Type property predicates, as indicated</p>
! 
! <table border="1">
! <caption>Table 49 &mdash; Type property predicates</caption>
! <tr>
! <th>Template</th>
! <th>Condition</th>
! <th>Preconditions</th>
! </tr> 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_abstract;</tt>
! </td>
! <td>
! [&hellip;]
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_final;</tt></ins>
! </td>
! <td>
! <ins><code>T</code> is a class type marked with the <i>class-virt-specifier</i> <code>final</code> (9 [class]).<br/> 
! [<i>Note:</i> A union is a class type that can be marked with <code>final</code>. &mdash; <i>end note</i>]</ins>
! </td>
! <td>
! <ins>If <tt>T</tt> is a class type, <tt>T</tt> shall be a complete type</ins>
! </td>
! </tr>
! 
! </table>
! 
! </li>
! 
! <li><p>After 20.10.4.3 [meta.unary.prop] p5 add one further example as indicated:</p>
! 
! <blockquote><p>
! <ins>[<i>Example</i>:</ins>
! </p>
! <blockquote><pre>
! <ins><i>// Given:</i>
! struct P final { };
! union U1 { };
! union U2 final { };
! 
! <i>// the following assertions hold:</i>
! static_assert(!is_final&lt;int&gt;::value, "Error!");
! static_assert( is_final&lt;P&gt;::value, "Error!");
! static_assert(!is_final&lt;U1&gt;::value, "Error!");
! static_assert( is_final&lt;U2&gt;::value, "Error!");</ins>
! </pre></blockquote>
! <p>
! <ins>&mdash; <i>end example</i>]</ins>
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2118"></a>2118. [CD] <tt>unique_ptr</tt> for array does not support <i>cv</i> qualification conversion of actual argument</h3>
! <p><b>Section:</b> 20.8.1.3 [unique.ptr.runtime] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Alf P. Steinbach <b>Opened:</b> 2011-12-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.runtime">issues</a> in [unique.ptr.runtime].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p><b>Addresses US 16</b></p>
! 
! <p>
! N3290 20.8.1.3.1 [unique.ptr.runtime.ctor] "<tt>unique_ptr</tt> constructors":
! </p>
! <blockquote><p>
! These constructors behave the same as in the primary template except that they do not accept pointer types 
! which are convertible to <tt>pointer</tt>. [<i>Note:</i> One implementation technique is to create private 
! templated overloads of these members. &mdash; <i>end note</i>]
! </p></blockquote>
! <p>
! This language excludes even <tt>pointer</tt> itself as type for the actual argument.
! <p/>
! But of more practical concern is that both Visual C++ 10.0 and MinGW g++ 4.1.1 reject the code below, where 
! only an implicit <i>cv</i> qualification is needed, which <i>cv</i> qualification is supported by the non-array 
! version:
! </p>
! <blockquote><pre>
! #include &lt;memory&gt;
! using namespace std;
! 
! struct T {};
! 
! T* foo() { return new T; }
! T const* bar() { return foo(); }
! 
! int main()
! {
!    unique_ptr&lt; T const &gt;       p1( bar() );        // OK
!    unique_ptr&lt; T const [] &gt;    a1( bar() );        // OK
! 
!    unique_ptr&lt; T const &gt;       p2( foo() );        // OK
!    unique_ptr&lt; T const [] &gt;    a2( foo() );        // <span style="color:#C80000;font-weight:bold">? this is line #15</span>
! }
! </pre></blockquote>
! <p>
! The <em>intent</em> seems to be clearly specified in 20.8.1.3 [unique.ptr.runtime]&#47;1 second bullet:
! </p>
! <blockquote><p>
! &mdash; Pointers to types derived from <tt>T</tt> are rejected by the constructors, and by <tt>reset</tt>.
! </p></blockquote>
! 
! <p>
! But the following language in 20.8.1.3.1 [unique.ptr.runtime.ctor] then rejects far too much...
! <p/>
! Proposed new wording of N3290 20.8.1.3.1 [unique.ptr.runtime.ctor] "<tt>unique_ptr</tt> constructors":
! </p>
! <blockquote><p>
! These constructors behave the same as in the primary template except that actual argument pointers <tt>p</tt> 
! to types derived from <tt>T</tt> are rejected by the constructors. [<i>Note:</i> One implementation technique 
! is to create private templated overloads of these members. &mdash; <i>end note</i>]
! </p></blockquote>
! <p>
! This will possibly capture the intent better, and avoid the inconsistency between the non-array and array 
! versions of <tt>unique_ptr</tt>, by using nearly the exact same phrasing as for the paragraph explaining 
! the intent.
! </p>
! 
! <p><i>[2012-08-25 Geoffrey Romer comments in <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=32978">c++std-lib-32978</a>]</i></p>
! 
! 
! <ol>
! <li><p>
! The current P/R seems to intend to support at least two different implementation techniques &mdash; additional 
! unusable templates that catch forbidden arguments or replacing existing constructors by templates that 
! ensure ill-formed code inside the template body, when the requirements are not met. It seems unclear whether
! the current wording allows the second approach, though. It should be considered to allow both strategies or
! if that is not possible the note should be clearer.
! </p></li>
! 
! <li><p>
! The very same problem exists for the <tt>reset</tt> member function, but even worse, because the current
! specification is more than clear that the deleted <tt>reset</tt> function will catch all cases not equal to 
! <tt>pointer</tt>. It seems confusing at best to have different policies for the constructor and for the <tt>reset</tt> 
! function. In this case, the question in regard to implementation freedom mentioned above is even more important.
! </p></li>
! 
! <li><p>
! It's awkward to refer to "the constructors" twice in the same sentence; I suggest revising the sentence as 
! "...except that they do not accept argument pointers <tt>p</tt> to types derived from <tt>T</tt>"
! </p></li>
! </ol>
! 
! <p><i>[2012-12-20: Geoffrey Romer comments and provides a revised resolution]</i></p>
! 
! 
! <p>
! The array specialization of <tt>unique_ptr</tt> differs from the primary template in several ways,
! including the following:
! </p>
! <ul>
! <li><p>
! <tt>unique_ptr&lt;T[], D&gt;</tt> cannot be constructed from a plain pointer whose type is not
! exactly <tt>unique_ptr&lt;T[], D&gt;::pointer</tt> or <tt>nullptr_t</tt>.
! </p></li>
! <li><p>
! <tt>unique_ptr&lt;T[], D&gt;</tt> cannot be constructed from a <tt>unique_ptr&lt;U[], E&gt;&amp;&amp;</tt> 
! unless <tt>U</tt> is exactly <tt>T</tt> and <tt>E</tt> is exactly <tt>D</tt>.
! </p></li>
! <li><p>
! <tt>unique_ptr&lt;T[], D&gt;</tt> cannot be moveassigned from a <tt>unique_ptr&lt;U[], E&gt;&amp;&amp;</tt> 
! unless <tt>U</tt> is exactly <tt>T</tt> and <tt>E</tt> is exactly <tt>D</tt>.
! </p></li>
! <li><p>
! <tt>unique_ptr&lt;T[], D&gt;::reset</tt> cannot take an argument whose type is not exactly
! <tt>unique_ptr&lt;T[], D&gt;::pointer</tt> or <tt>nullptr_t</tt>.
! </p></li>
! <li><p>
! <tt>default_delete&lt;T[]&gt;</tt> cannot be constructed from a <tt>default_delete&lt;U[]&gt;</tt> unless 
! <tt>U</tt> is exactly <tt>T</tt>.
! </p></li>
! <li><p>
! <tt>default_delete&lt;T[]&gt;::operator()</tt> cannot be called on a pointer whose type is not
! exactly <tt>T*</tt>.
! </p></li>
! </ul>
! <p>
! The common intent of all these restrictions appears to be to disallow implicit conversions from
! pointer-to-derived-class to pointer-to-base-class in contexts where the pointer is known to point
! to an array, because such conversions are inherently unsafe; deleting or subscripting the result
! of such a conversion leads to undefined behavior (see also CWG 1504). However, these restrictions 
! have the effect of disallowing all implicit conversions in those contexts, including most notably 
! cv-qualification, but also user-defined conversions, and possibly others. This PR narrows all those 
! restrictions, to disallow only unsafe pointer-to-derived to pointer-to-base conversions, while 
! allowing all others.
! <p/>
! I removed the nebulous language stating that certain functions "will not accept" certain arguments. 
! Instead I use explicitly deleted template functions, which participate in overload resolution only 
! for pointer-to-derived to pointer-to-base conversions. This is more consistent with the existing 
! text and easier to express correctly than an approach based on declaring certain types of calls to 
! be ill-formed, but may produce inferior compiler diagnostics.
! <p/>
! Wherever possible, this PR defines the semantics of template specializations in terms of their
! differences from the primary template. This improves clarity and minimizes the risk of
! unintended differences (e.g. LWG <a href="lwg-defects.html#2169">2169</a>, which this PR also fixes). This PR also makes it 
! explicit that the specialization inherits the description of all members, not just member functions, 
! from the primary template and, in passing, clarifies the default definition of pointer in the
! specialization.
! <p/>
! This resolution only disallows pointer-to-derived to pointer-to-base conversions between
! ordinary pointer types; if user-defined pointer types provide comparable conversions, it is their
! responsibility to ensure they are safe. This is consistent with C++'s general preference for
! expressive power over safety, and for assuming the user knows what they're doing;
! furthermore, enforcing such a restriction on user-defined types appears to be impractical without
! cooperation from the user.
! <p/>
! The "base class without regard to cv-qualifiers" language is intended to parallel the specification
! of <tt>std::is_base_of</tt>.
! <p/>
! Jonathan Wakely has a working implementation of this PR patched into libstdc++.
! </p>
! 
! <p>
! Previous resolution:
! </p>
! <blockquote class="note">
! <p>This wording is relative to the FDIS.</p>
! 
! <p>Change 20.8.1.3.1 [unique.ptr.runtime.ctor] as indicated:</p>
! 
! <blockquote><pre>
! explicit unique_ptr(pointer p) noexcept;
! unique_ptr(pointer p, <i>see below</i> d) noexcept;
! unique_ptr(pointer p, <i>see below</i> d) noexcept;
! </pre>
! <blockquote><p>
! These constructors behave the same as in the primary template except that <del>they do not accept pointer
! types which are convertible to <tt>pointer</tt></del><ins>argument pointers <tt>p</tt> to types derived 
! from <tt>T</tt> are rejected by the constructors</ins>. [<i>Note:</i> One implementation technique is to 
! create private templated overloads of these members. &mdash; <i>end note</i>]
! </p></blockquote></blockquote>
! </blockquote>
! 
! <p><i>[2014-02, Issaquah]</i></p>
! 
! <p>
! GR: want to prevent unsafe conversions. Standard is inconsistent how it does this. for <tt>reset()</tt> has deleted function 
! template capturing everything except the known-safe cases. Other functions use SFINAE. Main reason this is hard is that 
! <tt>unique_ptr</tt> supports fancy pointers. Have to figure out how to handle them and what requirements to put on them. 
! Requirements are minimal, not even required to work with <tt>pointer_traits</tt>.
! <p/>
! STL surprised <tt>pointer_traits</tt> doesn't work
! <p/>
! GR: ways to get fancy pointers to work is to delegate responsibility for preventing unsafe conversions to the fancy pointers themselves. 
! Howard doesn't like that, he wants even fancy pointers to be prevented from doing unsafe conversions in <tt>unique_ptr</tt> contexts.
! <p/>
! AM: Howard says <tt>unique_ptr</tt> was meant to be very very safe under all conditions, this open a hole in that. Howard wants to 
! eke forward and support more, but not if we open any holes in type safety. 
! <p/>
! GR: do we need to be typesafe even for fancy types with incorrect <tt>pointer_traits</tt>?
! <p/>
! AM: that would mean it's only unsafe for people who lie by providing a broken specialization of <tt>pointer_traits</tt>
! <p/>
! GR: probably can't continue with ambiguity between using SFINAE and ill-formedness. Would appreciate guidance on direction used for that.
! <p/>
! STL: difference is observable in convertibility using type traits. 
! <p/>
! STL: for <tt>reset()</tt> which doesn't affect convertibility ill-formed allows <tt>static_assert</tt>, better diagnostic. 
! For assignment it's detectable and has traits, constraining them is better.
! <p/>
! EN: I strongly prefer constraints than <tt>static_asserts</tt> 
! <p/>
! STL: if we could rely on <tt>pointer_traits</tt> that might be good. Alternatively could we add more machinery to deleter? 
! make deleter say conversions are allowed, otherwise we lock down all conversions. basically want to know if converting <tt>U</tt> to 
! <tt>T</tt> is safe.
! </p>
! 
! <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to N3485.</p>
! <ol>
! <li><p>Revise 20.8.1.1.3 [unique.ptr.dltr.dflt1] as follows</p>
! <blockquote><pre>
! namespace std {
!   template &lt;class T&gt; struct default_delete&lt;T[]&gt; {
!     constexpr default_delete() noexcept = default;
!     <ins>template &lt;class U&gt; default_delete(const default_delete&lt;U&gt;&amp;) noexcept;</ins>
!     void operator()(T*) const;
!     template &lt;class U&gt; void operator()(U*) const = delete;
!   };
! }
! </pre></blockquote>
! <p>
! <ins>-?- Descriptions are provided below only for member functions that have behavior different from the
! primary template.</ins>
! </p>
! <blockquote>
! <pre>
! <ins>template &lt;class U&gt; default_delete(const default_delete&lt;U&gt;&amp;) noexcept;</ins>
! </pre>
! <blockquote><p>
! <ins>-?- This constructor behaves the same as in the primary template except that it shall not participate
! in overload resolution unless:</ins>
! </p>
! <ul>
! <li><p>
! <ins><tt>U</tt> is an array type, and</ins>
! </p></li>
! <li><p>
! <ins><tt>V*</tt> is implicitly convertible to <tt>T*</tt>, and</ins>
! </p></li>
! <li><p>
! <ins><tt>T</tt> is not a base class of <tt>V</tt> (without regard to <i>cv</i>-qualifiers),</ins>
! </p></li>
! </ul>
! <p>
! <ins>where <tt>V</tt> is the array element type of <tt>U</tt>.</ins>
! </p>
! </blockquote>
! 
! <blockquote><pre>
! void operator()(T* ptr) const;
! </pre><blockquote>
! <p>
! -1- <i>Effects</i>: calls <tt>delete[]</tt> on <tt>ptr</tt>.
! <p/>
! -2- <i>Remarks</i>: If <tt>T</tt> is an incomplete type, the program is ill-formed.
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! <ins>template &lt;class U&gt; void operator()(U*) const = delete;</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Remarks</i>: This function shall not participate in overload resolution unless <tt>T</tt> is a base 
! class of <tt>U</tt> (without regard to <i>cv</i>-qualifiers).</ins>
! </p>
! </blockquote></blockquote>
! 
! </blockquote>
! </li>
! 
! <li><p>Revise 20.8.1.2 [unique.ptr.single]/3 as follows:</p>
! <blockquote><p>
! If the type <tt>remove_reference&lt;D&gt;::type::pointer</tt> exists, then <tt>unique_ptr&lt;T, D&gt;::pointer</tt> 
! shall be a synonym for <tt>remove_reference&lt;D&gt;::type::pointer</tt>. Otherwise <tt>unique_ptr&lt;T, D&gt;::pointer</tt> 
! shall be a synonym for <tt><del>T</del><ins>element_type</ins>*</tt>. The type <tt>unique_ptr&lt;T, D&gt;::pointer</tt> 
! shall satisfy the requirements of <tt>NullablePointer</tt> (17.6.3.3 [nullablepointer.requirements]).
! </p></blockquote>
! </li>
! 
! <li><p>Revise 20.8.1.3 [unique.ptr.runtime] as follows:</p>
! <blockquote><pre>
! namespace std {
!   template &lt;class T, class D&gt; class unique_ptr&lt;T[], D&gt; {
!   public:
!     typedef <i>see below</i> pointer;
!     typedef T element_type;
!     typedef D deleter_type;
! 
!     <i>// 20.7.1.3.1, constructors</i>
!     constexpr unique_ptr() noexcept;
!     explicit unique_ptr(pointer p) noexcept;
!     <ins>template &lt;class U&gt; explicit unique_ptr(U* p) = delete;</ins>
!     unique_ptr(pointer p, <i>see below</i> d) noexcept;
!     <ins>template &lt;class U&gt; unique_ptr(U* p, <i>see below</i> d) = delete;</ins>
!     unique_ptr(pointer p, <i>see below</i> d) noexcept;
!     <ins>template &lt;class U&gt; unique_ptr(U* p, <i>see below</i> d) = delete;</ins>
!     unique_ptr(unique_ptr&amp;&amp; u) noexcept;
!     constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { }
!     <ins>template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u) noexcept;</ins>
! 
!     <i>// destructor</i>
!     ~unique_ptr();
! 
!     <i>// assignment</i>
!     unique_ptr&amp; operator=(unique_ptr&amp;&amp; u) noexcept;
!     <ins>template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u) noexcept;</ins>
!     unique_ptr&amp; operator=(nullptr_t) noexcept;
! 
!     <i>// 20.7.1.3.2, observers</i>
!     T&amp; operator[](size_t i) const;
!     pointer get() const noexcept;
!     deleter_type&amp; get_deleter() noexcept;
!     const deleter_type&amp; get_deleter() const noexcept;
!     explicit operator bool() const noexcept;
! 
!     <i>// 20.7.1.3.3 modifiers</i>
!     pointer release() noexcept;
!     void reset(pointer p = pointer()) noexcept;
!     <del>void reset(nullptr_t) noexcept;</del>
!     template &lt;class U&gt; void reset(U<ins>*</ins>) = delete;
!     void swap(unique_ptr&amp; u) noexcept;
! 
!     <i>// disable copy from lvalue</i>
!     unique_ptr(const unique_ptr&amp;) = delete;
!     unique_ptr&amp; operator=(const unique_ptr&amp;) = delete;
!   };
! }
! </pre></blockquote>
! <blockquote><p>
! -1- A specialization for array types is provided with a slightly altered interface.
! </p>
! <ul>
! <li><p>
! Conversions <del>between different types of <tt>unique_ptr&lt;T[], D&gt;</tt></del><ins>from
! <tt>unique_ptr&lt;Derived[]&gt;</tt> to <tt>unique_ptr&lt;Base[]&gt;</tt>, where <tt>Base</tt> is a 
! base class of <tt>Derived</tt>, from <tt>auto_ptr</tt>,</ins> or to or from the non-array forms of
! <tt>unique_ptr</tt> produce an ill-formed program.
! </p></li>
! <li><p>
! Pointers to types derived from <tt>T</tt> are rejected by the constructors, and by <tt>reset</tt>.
! </p></li>
! <li><p>
! The observers <tt>operator*</tt> and <tt>operator-&gt;</tt> are not provided.
! </p></li>
! <li><p>
! The indexing observer <tt>operator[]</tt> is provided.
! </p></li>
! <li><p>
! The default deleter will call <tt>delete[]</tt>.
! </p></li>
! </ul>
! <p>
! -2- Descriptions are provided below only for <del>member functions that have behavior 
! different</del><ins>members that differ</ins> from the primary template.
! <p/>
! -3- The template argument <tt>T</tt> shall be a complete type.
! </p>
! </blockquote>
! </li>
! 
! <li><p>Revise 20.8.1.3.1 [unique.ptr.runtime.ctor] as follows:</p>
! <blockquote>
! <pre>
! <del>explicit unique_ptr(pointer p) noexcept;
! unique_ptr(pointer p, <i>see below</i> d) noexcept;
! unique_ptr(pointer p, <i>see below</i> d) noexcept;</del>
! <ins>template &lt;class U&gt; explicit unique_ptr(U* p) = delete;</ins>
! <ins>template &lt;class U&gt; unique_ptr(U* p, <i>see below</i> d) = delete;</ins>
! <ins>template &lt;class U&gt; unique_ptr(U* p, <i>see below</i> d) = delete;</ins>
! </pre><blockquote><p>
! <del>These constructors behave the same as in the primary template except that they do not accept pointer
! types which are convertible to pointer. [<i>Note</i>: One implementation technique is to create private
! templated overloads of these members. &mdash; <i>end note</i>]</del><ins>These constructors shall not 
! participate in overload resolution unless:</ins></p>
! <ul>
! <li><p><ins><tt>pointer</tt> is a pointer type, and</ins></p></li>
! <li><p><ins><tt>U*</tt> is implicitly convertible to <tt>pointer</tt>, and</ins></p></li>
! <li><p><ins><tt>T</tt> is a base class of <tt>U</tt> (without regard to <i>cv</i>-qualifiers).</ins></p></li>
! </ul>
! <p><ins>The type of <tt>d</tt> is determined as in the corresponding non-deleted constructors.</ins></p>
! </blockquote>
! <pre>
! <ins>template &lt;class U, class E&gt; unique_ptr(unique_ptr&lt;U, E&gt;&amp;&amp; u) noexcept;</ins>
! </pre><blockquote><p>
! <ins>-?- This constructor behaves the same as in the primary template, except that it shall not participate
! in overload resolution unless:</ins>
! </p>
! <ul>
! <li><p><ins><tt>unique_ptr&lt;U, E&gt;::pointer</tt> is implicitly convertible to <tt>pointer</tt>, and</ins></p></li>
! <li><p><ins><tt>U</tt> is an array type, and</ins></p></li>
! <li><p><ins>either <tt>D</tt> is a reference type and <tt>E</tt> is the same type as <tt>D</tt>, or <tt>D</tt> 
! is not a reference type and <tt>E</tt> is implicitly convertible to <tt>D</tt>, and</ins></p></li>
! <li><p><ins>either at least one of <tt>pointer</tt> and <tt>unique_ptr&lt;U, E&gt;::pointer</tt> is not a 
! pointer type, or <tt>T</tt> is not a base class of the array element type of <tt>U</tt> (without regard to 
! <i>cv</i>-qualifiers).</ins></p></li>
! </ul>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Insert a new sub-clause following 20.8.1.3.1 [unique.ptr.runtime.ctor] as follows:</p>
! 
! <p><ins>?? <tt>unique_ptr</tt> assignment [unique.ptr.runtime.asgn]</ins></p>
! 
! <blockquote>
! <pre>
! <ins>template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u) noexcept;</ins>
! </pre><blockquote><p>
! <ins>-?- This operator behaves the same as in the primary template, except that it shall not participate in
! overload resolution unless:</ins></p>
! <ul>
! <li><p><ins><tt>unique_ptr&lt;U, E&gt;::pointer</tt> is implicitly convertible to <tt>pointer</tt>, and</ins></p></li>
! <li><p><ins><tt>U</tt> is an array type, and</ins></p></li>
! <li><p><ins>either <tt>D</tt> is a reference type and <tt>E</tt> is the same type as <tt>D</tt>, or <tt>D</tt> 
! is not a reference type and <tt>E</tt> is implicitly convertible to <tt>D</tt>, and</ins></p></li>
! <li><p><ins>either at least one of <tt>pointer</tt> and <tt>unique_ptr&lt;U, E&gt;::pointer</tt> is not a 
! pointer type, or <tt>T</tt> is not a base class of the array element type of <tt>U</tt> (without regard to 
! <i>cv</i>-qualifiers).</ins></p></li>
! </ul>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Revise 20.8.1.3.4 [unique.ptr.runtime.modifiers] as follows:</p>
! 
! <blockquote>
! <pre>
! <del>void reset(pointer p = pointer()) noexcept;
! void reset(nullptr_t p) noexcept;</del>
! <ins>template &lt;class U&gt; void reset(U*) = delete;</ins>
! </pre><blockquote><p>
! <del>-1- <i>Effects</i>: If <tt>get() == nullptr</tt> there are no effects. Otherwise <tt>get_deleter()(get())</tt>.</del>
! <p/>
! <del>-2- <i>Postcondition</i>: <tt>get() == p</tt>.</del>
! <p/>
! <ins>-?- This function shall not participate in overload resolution unless:</ins>
! </p>
! <ul>
! <li><p><ins><tt>pointer</tt> is a pointer type, and</ins></p></li>
! <li><p><ins><tt>U*</tt> is implicitly convertible to <tt>pointer</tt>, and</ins></p></li>
! <li><p><ins><tt>T</tt> is a base class of <tt>U</tt> (without regard to <i>cv</i>-qualifiers).</ins></p></li>
! </ul>
! 
! </blockquote></blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2014-06 Rapperswil]</i></p>
! 
! <p>
! Discussion of N4042 and general agreement that this paper resolves the substance of this issue and should be adopted with 
! minor edits. Geoffrey Romer will provide an updated paper. 
! </p>
! 
! <p><i>[2014-06 post-Rapperswil]</i></p>
! 
! <p>
! As described in N4089.
! </p>
! 
! <p><i>[2014-11-07 Urbana]</i></p>
! 
! <p>
! Resolved by
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4089.pdf">N4089</a>
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! See proposed wording in N4089.
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2120"></a>2120. What should <tt>async</tt> do if neither '<tt>async</tt>' nor '<tt>deferred</tt>' is set in policy?</h3>
! <p><b>Section:</b> 30.6.8 [futures.async] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-01-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Implementations already disagree, one returns an invalid future with
! no shared state, one chooses <tt>policy == async</tt> and one chooses <tt>policy ==
! deferred</tt>, see c++std-lib-30839, c++std-lib-30840 and c++std-lib-30844.
! It's not clear if returning an invalid future is allowed by the current wording.
! </p>
! <p>
! If the intention is to allow an empty future to be returned, then
! 30.6.8 [futures.async] p3 and p4 should be adjusted to clarify that a
! shared state might not be created and an invalid future might be returned.
! </p>
! <p>
! If the intention is that a valid future is always returned, p3 should
! say something about the case where none of the conditions applies.
! </p>
! 
! <p><i>[2012, Portland: move to Review]</i></p>
! 
! <p>
! We could make it undefined if no launch policy is defined.
! </p>
! <p>
! Hans: If no launch policy is specified the behaviour is undefined
! </p>
! <p>
! Artur: or implementation defined?
! </p>
! <p>
! Hans: no: we don't want people to do this
! </p>
! <p><i>[Proposed wording]</i></p>
! 
! <p>
! This wording is relative to N3376
! </p>
! <p>
! Add a third bullet to the end of the list in 30.6.8p3
! </p>
! <blockquote>
! "if no valid launch policy is provided the behaviour is undefined"
! </blockquote>
! <p>
! Moved to review
! </p>
! 
! <p><i>[2013-04-19, Bristol]</i></p>
!  
! 
! <p>Detlef provides new wording</p>
! 
! <p>Previous wording:</p>
! 
! <blockquote class="note">  
! <p><i>[This wording is relative to N3376]</i></p>
! 
! <p>
! Add a third bullet to the end of the list in 30.6.8 [futures.async]p3
! </p>
! <blockquote>
! <ins>&ndash; if no valid launch policy is provided the behaviour is undefined</ins>
! </blockquote>
! </blockquote>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! If no policy is given, it should be undefined, so moved to Immediate.
! </p>
! <p>
! Accept for Working Paper
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p><i>[This wording is relative to N3485]</i></p>
! 
! <p>
! Add a third bullet to the end of the list in 30.6.8 [futures.async]p3
! </p>
! <blockquote>
! <ins>&ndash; If no value is set in the launch policy, or a value is set that is
! neither specified in this International Standard or by the implementation, the behaviour 
! is undefined.</ins>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2122"></a>2122. <tt>merge()</tt> stability for lists versus forward lists</h3>
! <p><b>Section:</b> 23.3.5.5 [list.ops], 23.3.4.6 [forwardlist.ops] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2012-01-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#list.ops">issues</a> in [list.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! <tt>forward_list::merge()</tt> is specified in  23.3.4.6 [forwardlist.ops], p19 as follows:
! </p>
! <blockquote><p>
! This operation shall be stable: for equivalent elements in the two lists,
! the elements from <tt>*this</tt> shall always precede the elements from <tt>x</tt>.
! </p></blockquote>
! <p>
! But <tt>list::merge()</tt> is only specified in 23.3.5.5 [list.ops], p24 as follows:
! </p>
! <blockquote><p>
! <i>Remarks</i>: Stable.
! </p></blockquote>
! <p>
! Note that in general we define "stable" only for algorithms (see 17.3 [defns.stable] and 
! 17.6.5.7 [algorithm.stable]) so for member function we should explain it everywhere we use it.
! <p/>
! Thus for lists we have to add:
! </p>
! <blockquote><p>
! Stable: for equivalent elements in the two lists, the elements from the list always precede the elements
! from the argument list.
! </p></blockquote>
! <p>
! This, BTW, was the specification we had with C++03.
! <p/>
! In addition, I wonder whether we also have some guarantees regarding stability saying that the order 
! of equivalent elements of each list merged remains stable (which would be my interpretation of just 
! saying "stable", BTW).
! <p/>
! Thus, I'd expect that for equivalent elements we guarantee that
! </p>
! <ul>
!  <li> we first have all element of <tt>*this</tt> (in the same order as on entry)</li>
!  <li> and then all elements of the passed argument (in the same order as on entry).</li>
! </ul>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Open.
! </p>
! <p>
! STL says we need to fix up 17.6.5.7 to be stronger, and then the remarks for merge should
! just say "Remarks: Stable (see 17.6.5.7)"
! </p>
! <p>
! Assigned to STL for word-smithing.
! </p>
! 
! <p><i>[
! 2013-04-14 STL provides rationale and improved wording
! ]</i></p>
! 
! 
! <p>Step 1: Centralize all specifications of stability to 17.6.5.7 [algorithm.stable].</p>
! <p>Step 2: 17.3 [defns.stable] and 17.6.5.7 [algorithm.stable] talk about "algorithms", without mentioning 
! "container member functions". There's almost no potential for confusion here, but there's a simple way to increase clarity 
! without increasing verbosity: make the container member functions explicitly cite 17.6.5.7 [algorithm.stable]. For 
! consistency, we can also update the non-member functions.</p>
! <p>Step 3: Fix the "so obvious, we forgot to say it" bug in 17.6.5.7 [algorithm.stable]: a "stable" merge of equivalent 
! elements A B C D and W X Y Z produces A B C D W X Y Z, never D C B A X W Z Y.</p>
! <p>Step 3.1: Say "(preserving their original order)" to be consistent with "the relative order [...] is preserved" in 
! 17.6.5.7 [algorithm.stable]'s other bullet points.</p>
! <p>Step 4: Copy part of <tt>list::merge()</tt>'s wording to <tt>forward_list::merge()</tt>, in order to properly connect 
! with 17.6.5.7 [algorithm.stable]'s "first range" and "second range".</p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! <p>Original wording saved here:</p>
! <blockquote class="note">
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li>
! <p>Change 23.3.5.5 [list.ops] as indicated:</p>
! 
! <blockquote><pre>
! void                          merge(list&lt;T,Allocator&gt;&amp; x);
! void                          merge(list&lt;T,Allocator&gt;&amp;&amp; x);
! template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp; x, Compare comp);
! template &lt;class Compare&gt; void merge(list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);</pre>
! <blockquote><p>
! [&hellip;]
! <p/>
! -24- <i>Remarks</i>: <del>Stable</del><ins>This operation shall be stable: for equivalent elements 
! in the two lists, the elements from <tt>*this</tt> shall always precede the elements from <tt>x</tt>
! and the order of equivalent elements of <tt>*this</tt> and <tt>x</tt> remains stable</ins>. If 
! <tt>(&amp;x != this)</tt> the range <tt>[x.begin(), x.end())</tt> 
! is empty after the merge. No elements are copied by this operation. The behavior is undefined if 
! <tt>this-&gt;get_allocator() != x.get_allocator()</tt>.
! </p></blockquote></blockquote>
! </li>
! 
! <li>
! <p>Change 23.3.4.6 [forwardlist.ops] as indicated:</p>
! 
! <blockquote><pre>
! void merge(forward_list&lt;T,Allocator&gt;&amp; x);
! void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x);
! template &lt;class Compare&gt; void merge(forward_list&lt;T,Allocator&gt;&amp; x, Compare comp);
! template &lt;class Compare&gt; void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);</pre>
! <blockquote><p>
! [&hellip;]
! <p/>
! -19- <i>Effects</i>: Merges <tt>x</tt> into <tt>*this</tt>. This operation shall be stable: for 
! equivalent elements in the two lists, the elements from <tt>*this</tt> shall always precede the 
! elements from <tt>x</tt> <ins>and the order of equivalent elements of <tt>*this</tt> and <tt>x</tt> 
! remains stable</ins>. <tt>x</tt> is empty after the merge. If an exception is thrown other 
! than by a comparison there are no effects. Pointers and references to the moved elements of <tt>x</tt> 
! now refer to those same elements but as members of <tt>*this</tt>. Iterators referring
! to the moved elements will continue to refer to their elements, but they now behave as iterators into
! <tt>*this</tt>, not into <tt>x</tt>.
! </p></blockquote></blockquote>
! </li>
! </ol>
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the N3485.</p>
! 
! <ol>
! <li><p>Change 17.6.5.7 [algorithm.stable]/1 as indicated:</p>
! <blockquote><p>
! When the requirements for an algorithm state that it is “stable” without further elaboration, it means:
! <p/>
! [&hellip;]
! </p>
! <ul>
! <li>For the <em>merge</em> algorithms, for equivalent elements in the original two ranges, the elements from the
! first range <ins>(preserving their original order)</ins> precede the elements from the second range <ins>(preserving 
! their original order)</ins>.</li>
! </ul>
! </blockquote>
! </li>
! 
! <li><p>Change 23.3.4.6 [forwardlist.ops] as indicated:</p>
! <blockquote>
! <pre>
! void remove(const T&amp; value);
! template &lt;class Predicate&gt; void remove_if(Predicate pred);
! </pre>
! <blockquote>
! <p>
! -12- <i>Effects</i>: Erases all the elements in the list referred by a list iterator <tt>i</tt> for which the following conditions
! hold: <tt>*i == value</tt> (for <tt>remove()</tt>), <tt>pred(*i)</tt> is true (for <tt>remove_if()</tt>). <del>This operation shall be 
! stable: the relative order of the elements that are not removed is the same as their relative order in the original
! list.</del> Invalidates only the iterators and references to the erased elements.
! <p/>
! -13- <i>Throws</i>: Nothing unless an exception is thrown by the equality comparison or the predicate.
! <p/>
! <ins>-??- <i>Remarks</i>: Stable (17.6.5.7 [algorithm.stable]).</ins>
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! 
! <pre>
! void merge(forward_list&amp; x);
! void merge(forward_list&amp;&amp; x);
! template &lt;class Compare&gt; void merge(forward_list&amp; x, Compare comp)
! template &lt;class Compare&gt; void merge(forward_list&amp;&amp; x, Compare comp)
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -19- <i>Effects</i>: Merges <del><tt>x</tt> into <tt>*this</tt></del><ins>the two sorted ranges <tt>[begin(), end())</tt> 
! and <tt>[x.begin(), x.end())</tt></ins>. <del>This operation shall be stable: for equivalent 
! elements in the two lists, the elements from <tt>*this</tt> shall always precede the elements from <tt>x</tt>.</del> 
! <tt>x</tt> is empty after the merge. If an exception is thrown other than by a comparison there are no effects. Pointers and 
! references to the moved elements of <tt>x</tt> now refer to those same elements but as members of <tt>*this</tt>. 
! Iterators referring to the moved elements will continue to refer to their elements, but they now behave as iterators into
! <tt>*this</tt>, not into <tt>x</tt>.
! <p/>
! -20- <i>Remarks</i>: <ins>Stable (17.6.5.7 [algorithm.stable]).</ins> The behavior is undefined if 
! <tt>this-&gt;get_allocator() != x.get_allocator()</tt>.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! void sort();
! template &lt;class Compare&gt; void sort(Compare comp);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -23- <i>Effects</i>: Sorts the list according to the <tt>operator&lt;</tt> or the <tt>comp</tt> function object. <del>This 
! operation shall be stable: the relative order of the equivalent elements is preserved.</del> If an exception is thrown the order
! of the elements in <tt>*this</tt> is unspecified. Does not affect the validity of iterators and references.
! <p/>
! <ins>-??- <i>Remarks</i>: Stable (17.6.5.7 [algorithm.stable]).</ins>
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 23.3.5.5 [list.ops] as indicated:</p>
! <blockquote>
! <pre>
! void remove(const T&amp; value);
! template &lt;class Predicate&gt; void remove_if(Predicate pred);
! </pre>
! <blockquote>
! <p>
! [&hellip;]<p/>
! -17- <i>Remarks</i>: Stable <ins>(17.6.5.7 [algorithm.stable])</ins>.
! <p/>
! [&hellip;]</p>
! </blockquote>
! 
! <pre>
! void merge(list&amp; x);
! void merge(list&amp;&amp; x);
! template &lt;class Compare&gt; void merge(list&amp; x, Compare comp)
! template &lt;class Compare&gt; void merge(list&amp;&amp; x, Compare comp)
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -24- <i>Remarks</i>: Stable <ins>(17.6.5.7 [algorithm.stable])</ins>. [&hellip;]
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! void sort();
! template &lt;class Compare&gt; void sort(Compare comp);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -30- <i>Remarks</i>: Stable <ins>(17.6.5.7 [algorithm.stable])</ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 25.3.1 [alg.copy]/12 as indicated:</p>
! <blockquote>
! <pre>
! template&lt;class InputIterator, class OutputIterator, class Predicate&gt;
! OutputIterator 
! copy_if(InputIterator first, InputIterator last,
!         OutputIterator result, Predicate pred);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -12- <i>Remarks</i>: Stable <ins>(17.6.5.7 [algorithm.stable])</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 25.3.8 [alg.remove] as indicated:</p>
! <blockquote>
! <pre>
! template&lt;class ForwardIterator, class T&gt;
! ForwardIterator 
! remove(ForwardIterator first, ForwardIterator last, const T&amp; value);
! template&lt;class ForwardIterator, class Predicate&gt;
! ForwardIterator 
! remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -4- <i>Remarks</i>: Stable <ins>(17.6.5.7 [algorithm.stable])</ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! 
! <pre>
! template&lt;class InputIterator, class OutputIterator, class T&gt;
! OutputIterator
! remove_copy(InputIterator first, InputIterator last,
!             OutputIterator result, const T&amp; value);
! template&lt;class InputIterator, class OutputIterator, class Predicate&gt;
! OutputIterator
! remove_copy_if(InputIterator first, InputIterator last,
!                OutputIterator result, Predicate pred);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -11- <i>Remarks</i>: Stable <ins>(17.6.5.7 [algorithm.stable])</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 25.4.1.2 [stable.sort]/4 as indicated:</p>
! <blockquote>
! <pre>
! template&lt;class RandomAccessIterator&gt;
! void stable_sort(RandomAccessIterator first, RandomAccessIterator last);
! template&lt;class RandomAccessIterator, class Compare&gt;
! void stable_sort(RandomAccessIterator first, RandomAccessIterator last,
! Compare comp);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -4- <i>Remarks</i>: Stable <ins>(17.6.5.7 [algorithm.stable])</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 25.4.4 [alg.merge] as indicated:</p>
! <blockquote>
! <pre>
! template&lt;class InputIterator1, class InputIterator2,
!          class OutputIterator&gt;
! OutputIterator
! merge(InputIterator1 first1, InputIterator1 last1,
!       InputIterator2 first2, InputIterator2 last2,
!       OutputIterator result);
! template&lt;class InputIterator1, class InputIterator2,
!          class OutputIterator, class Compare&gt;
! OutputIterator
! merge(InputIterator1 first1, InputIterator1 last1,
!       InputIterator2 first2, InputIterator2 last2,
!       OutputIterator result, Compare comp);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -5- <i>Remarks</i>: Stable <ins>(17.6.5.7 [algorithm.stable])</ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! 
! <pre>
! template&lt;class BidirectionalIterator&gt;
! void inplace_merge(BidirectionalIterator first,
!                    BidirectionalIterator middle,
!                    BidirectionalIterator last);
! template&lt;class BidirectionalIterator, class Compare&gt;
! void inplace_merge(BidirectionalIterator first,
!                    BidirectionalIterator middle,
!                    BidirectionalIterator last, Compare comp);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -9- <i>Remarks</i>: Stable <ins>(17.6.5.7 [algorithm.stable])</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2123"></a>2123. <tt>merge()</tt> allocator requirements for lists versus forward lists</h3>
! <p><b>Section:</b> 23.3.4.6 [forwardlist.ops] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2012-01-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Sub-clause 23.3.5.5 [list.ops], p24 states for lists:
! </p>
! <blockquote><p>
! The behavior is undefined if <tt>this-&gt;get_allocator() != x.get_allocator()</tt>.
! </p></blockquote>
! <p>
! But there is nothing like that for forward lists in 23.3.4.6 [forwardlist.ops],
! although I would expect the same undefined behavior there.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! Move to Ready.
! </p>
! 
! <p><i>[2012, Portland: applied to WP]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to the FDIS.</p>
! 
! <ol>
! <li>
! <p>Add a new paragraph after 23.3.4.6 [forwardlist.ops] p19 as indicated:</p>
! 
! <blockquote><pre>
! void merge(forward_list&lt;T,Allocator&gt;&amp; x);
! void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x);
! template &lt;class Compare&gt; void merge(forward_list&lt;T,Allocator&gt;&amp; x, Compare comp);
! template &lt;class Compare&gt; void merge(forward_list&lt;T,Allocator&gt;&amp;&amp; x, Compare comp);</pre>
! <blockquote><p>
! [&hellip;]
! <p/>
! -19- <i>Effects</i>: [&hellip;]
! <p/>
! <ins>-?- <i>Remarks</i>: The behavior is undefined if <tt>this-&gt;get_allocator() != x.get_allocator()</tt>.</ins>
! </p></blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2128"></a>2128. Absence of global functions <tt>cbegin&#47;cend</tt></h3>
! <p><b>Section:</b> 24.3 [iterator.synopsis], 24.7 [iterator.range] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Dmitry Polukhin <b>Opened:</b> 2012-01-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.synopsis">issues</a> in [iterator.synopsis].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! All standard containers support <tt>cbegin&#47;cend</tt> member functions but corresponding global functions are 
! missing. Proposed resolution it to add global <tt>cbegin&#47;cend</tt> functions by analogy with global <tt>begin&#47;end</tt> 
! functions. This addition will unify things for users.
! </p>
! 
! <p><i>[2012, Kona]</i></p>
! 
! 
! <p>STL: Range-based for loops do not use global <tt>begin</tt>/<tt>end</tt> (anymore).</p>
! <p>Alisdair: We will have to make sure these will be available through many headers.</p>
! <p>STL: Do this, including <tt>r</tt> and <tt>cr</tt>. This won't add any additional work.</p>
! <p>Matt: Users will find it strange if these are not all available.</p>
! <p>Alisdair: Should we have these available everywhere begin/end are available?</p>
! <p>Marshall: Yes. Not any extra work.</p>
! <p>Howard: Adding all of these means we need all of <tt>&lt;iterator></tt>.</p>
! <p>STL: We already need it all.</p>
! <p>Matt: We have to be careful what we are requiring if we include the <tt>r</tt> versions.</p>
! <p>Jeffrey: If we include <tt>r</tt>, should they adapt if the container does not define reverse iteration?</p>
! <p>STL: No. No special behavior. Should fail to compile. Up to user to add the reverse code--it's easy.</p>
! <p>Howard: Anyway it will SFINAE out.</p>
! <p>Alisdair: Error messages due to SFINAE are harder to understand than simple failure to compile.</p>
! <p>STL: Agrees that SFINAE makes error messages much worse.</p>
! 
! <p>
! Action: STL to provide additional wording for the <tt>r</tt> variants.
! Move to Review once that wording is availalbe.
! </p>
! 
! <p><i>[
! 2013-04-14 STL provides rationale and improved wording
! ]</i></p>
! 
! 
! <p>Step 1: Implement <tt>std::cbegin/cend()</tt> by calling <tt>std::begin/end()</tt>. This has numerous advantages:</p>
! <ul>
! <li>It automatically works with arrays, which is the whole point of these non-member functions.</li>
! <li>It works with C++98/03-era user containers, written before <tt>cbegin/cend()</tt> members were invented.</li>
! <li>It works with <tt>initializer_list</tt>, which is extremely minimal and lacks <tt>cbegin/cend()</tt> members.</li>
! <li>23.2.1 [container.requirements.general] guarantees that this is equivalent to calling cbegin/cend() members.</li>
! </ul>
! <p>Step 2: Like <tt>std::begin/end()</tt>, implement <tt>std::rbegin/rend()</tt> by calling <tt>c.rbegin/rend()</tt>.  
! Note that C++98/03 had the <tt>Reversible Container Requirements</tt>.</p>
! <p>Step 3: Also like <tt>std::begin/end()</tt>, provide overloads of <tt>std::rbegin/rend()</tt> for arrays.</p>
! <p>Step 4: Provide overloads of <tt>std::rbegin/rend()</tt> for <tt>initializer_list</tt>, because it lacks 
! <tt>rbegin/rend()</tt> members. These overloads follow 18.9.3 [support.initlist.range]'s signatures. Note that 
! because these overloads return <tt>reverse_iterator</tt>, they aren't being specified in <tt>&lt;initializer_list&gt;</tt>.</p>
! <p>Step 5: Like Step 1, implement <tt>std::crbegin/crend()</tt> by calling <tt>std::rbegin/rend()</tt>.</p>
! 
! <p>Original wording saved here:</p>
! <blockquote class="note">
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3337.pdf">N3337</a>.</p>
! 
! <ol>
! <li><p>In 24.3 [iterator.synopsis], header iterator synopsis, add the following declarations:</p>
! 
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   <i>// 24.6.5, range access:</i>
!   template &lt;class C&gt; auto begin(C&amp; c) -> decltype(c.begin());
!   template &lt;class C&gt; auto begin(const C&amp; c) -> decltype(c.begin());
!   template &lt;class C&gt; auto end(C&amp; c) -> decltype(c.end());
!   template &lt;class C&gt; auto end(const C&amp; c) -> decltype(c.end());
!   <ins>template &lt;class C&gt; auto cbegin(const C&amp; c) -> decltype(c.cbegin());</ins>
!   <ins>template &lt;class C&gt; auto cend(const C&amp; c) -> decltype(c.cend());</ins>
!   template &lt;class T, size_t N&gt; T* begin(T (&amp;array)[N]);
!   template &lt;class T, size_t N&gt; T* end(T (&amp;array)[N]);
!   <ins>template &lt;class T, size_t N&gt; const T* cbegin(T (&amp;array)[N]);</ins>
!   <ins>template &lt;class T, size_t N&gt; const T* cend(T (&amp;array)[N]);</ins>
! }
! </pre></blockquote>
! </li>
! 
! <li><p>In 24.7 [iterator.range] after p5 add the following series of paragraphs:</p>
! 
! <blockquote>
! <pre>
! <ins>template &lt;class C&gt; auto cbegin(const C&amp; c) -> decltype(c.cbegin());</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>c.cbegin()</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class C&gt; auto cend(const C&amp; c) -> decltype(c.cend());</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>c.cend()</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class T, size_t N&gt; const T* cbegin(T (&amp;array)[N]);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>array</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class T, size_t N&gt; const T* cend(T (&amp;array)[N]);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>array + N</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! </blockquote>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3485.pdf">N3485</a>.</p>
! 
! <ol>
! <li><p>In 24.3 [iterator.synopsis], header iterator synopsis, add the following declarations:</p>
! 
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   <i>// 24.6.5, range access:</i>
!   template &lt;class C&gt; auto begin(C&amp; c) -> decltype(c.begin());
!   template &lt;class C&gt; auto begin(const C&amp; c) -> decltype(c.begin());
!   template &lt;class C&gt; auto end(C&amp; c) -> decltype(c.end());
!   template &lt;class C&gt; auto end(const C&amp; c) -> decltype(c.end());
!   template &lt;class T, size_t N&gt; T* begin(T (&amp;array)[N]);
!   template &lt;class T, size_t N&gt; T* end(T (&amp;array)[N]);
!   <ins>template &lt;class C&gt; auto cbegin(const C&amp; c) -> decltype(std::begin(c));</ins>
!   <ins>template &lt;class C&gt; auto cend(const C&amp; c) -> decltype(std::end(c));</ins>
!   <ins>template &lt;class C&gt; auto rbegin(C&amp; c) -> decltype(c.rbegin());</ins>
!   <ins>template &lt;class C&gt; auto rbegin(const C&amp; c) -> decltype(c.rbegin());</ins>
!   <ins>template &lt;class C&gt; auto rend(C&amp; c) -> decltype(c.rend());</ins>
!   <ins>template &lt;class C&gt; auto rend(const C&amp; c) -> decltype(c.rend());</ins>
!   <ins>template &lt;class T, size_t N&gt; reverse_iterator&lt;T*&gt; rbegin(T (&amp;array)[N]);</ins>
!   <ins>template &lt;class T, size_t N&gt; reverse_iterator&lt;T*&gt; rend(T (&amp;array)[N]);</ins>
!   <ins>template &lt;class E> reverse_iterator&lt;const E*&gt; rbegin(initializer_list&lt;E&gt; il);</ins>
!   <ins>template &lt;class E> reverse_iterator&lt;const E*&gt; rend(initializer_list&lt;E&gt; il);</ins>
!   <ins>template &lt;class C&gt; auto crbegin(const C&amp; c) -> decltype(std::rbegin(c));</ins>
!   <ins>template &lt;class C&gt; auto crend(const C&amp; c) -> decltype(std::rend(c));</ins>
! }
! </pre></blockquote>
! </li>
! 
! <li><p>At the end of 24.7 [iterator.range], add:</p>
! 
! <blockquote>
! <pre>
! <ins>template &lt;class C&gt; auto cbegin(const C&amp; c) -> decltype(std::begin(c));</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>std::begin(c)</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class C&gt; auto cend(const C&amp; c) -> decltype(std::end(c));</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>std::end(c)</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class C&gt; auto rbegin(C&amp; c) -> decltype(c.rbegin());</ins>
! <ins>template &lt;class C&gt; auto rbegin(const C&amp; c) -> decltype(c.rbegin());</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>c.rbegin()</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class C&gt; auto rend(C&amp; c) -> decltype(c.rend());</ins>
! <ins>template &lt;class C&gt; auto rend(const C&amp; c) -> decltype(c.rend());</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>c.rend()</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class T, size_t N&gt; reverse_iterator&lt;T*&gt; rbegin(T (&amp;array)[N]);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>reverse_iterator&lt;T*&gt;(array + N)</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class T, size_t N&gt; reverse_iterator&lt;T*&gt; rend(T (&amp;array)[N]);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>reverse_iterator&lt;T*&gt;(array)</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class E> reverse_iterator&lt;const E*&gt; rbegin(initializer_list&lt;E&gt; il);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>reverse_iterator&lt;const E*&gt;(il.end())</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class E> reverse_iterator&lt;const E*&gt; rend(initializer_list&lt;E&gt; il);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>reverse_iterator&lt;const E*&gt;(il.begin())</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class C&gt; auto crbegin(const C&amp; c) -> decltype(std::rbegin(c));</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>std::rbegin(c)</tt>.</ins>
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class C&gt; auto crend(const C&amp; c) -> decltype(std::rend(c));</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: <tt>std::rend(c)</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2129"></a>2129. User specializations of <tt>std::initializer_list</tt></h3>
! <p><b>Section:</b> 17.6.4.2.1 [namespace.std], 18.9 [support.initlist] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2012-01-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#namespace.std">issues</a> in [namespace.std].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Since the implementation is intended to magically synthesize instances of <tt>std::initializer_list</tt> 
! (rather than by a constructor call, for instance), user specializations of this type can't generally be 
! made to work. I can't find any wording which makes such specializations ill-formed, though, which leads 
! me to suspect that they're technically legal under the provisions of 17.6.4.2.1 [namespace.std] p1.</p>
! 
! 
! <p><i>[2012, Kona]</i></p>
! 
! <p>
! This sounds correct, but we need wording for a resolution.
! </p>
! <p>
! Marshall Clow volunteers to produce wording.
! </p>
! 
! <p><i>[2014-02-19, Jonathan Wakely provides proposed wording]</i></p>
! 
! 
! <p><i>[2014-03-27, Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Add new new paragraph below 18.9 [support.initlist] p2:</p>
! 
! <blockquote>
! <p>
! -2- An object of type <tt>initializer_list&lt;E&gt;</tt> provides access to an array of objects of type <tt>const E</tt>. [&hellip;]
! <p/>
! <ins>-?- If an explicit specialization or partial specialization of <tt>initializer_list</tt> is declared, the program is ill-formed.</ins>
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2130"></a>2130. Missing ordering constraints</h3>
! <p><b>Section:</b> 29.3 [atomics.order] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Mark Batty <b>Opened:</b> 2012-02-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#atomics.order">active issues</a> in [atomics.order].</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.order">issues</a> in [atomics.order].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>C11 issue 407</b></p>
! 
! <p>
! It seems that both C11 and C++11 are missing the following two derivatives of this 
! rule:
! </p>
! <blockquote><p>
!   For atomic modifications <tt>A</tt> and <tt>B</tt> of an atomic object <tt>M</tt>, if there is
!   a <tt>memory_order_seq_cst</tt> fence <tt>X</tt> such that <tt>A</tt> is sequenced before <tt>X</tt>,
!   and <tt>X</tt> precedes <tt>B</tt> in <tt>S</tt>, then <tt>B</tt> occurs later than <tt>A</tt> in the
!   modification order of <tt>M</tt>.
! </p></blockquote>
! <blockquote><p>
!   For atomic modifications <tt>A</tt> and <tt>B</tt> of an atomic object <tt>M</tt>, if there is
!   a <tt>memory_order_seq_cst</tt> fence <tt>Y</tt> such that <tt>Y</tt> is sequenced before <tt>B</tt>,
!   and <tt>A</tt> precedes <tt>Y</tt> in <tt>S</tt>, then <tt>B</tt> occurs later than <tt>A</tt> in the
!   modification order of <tt>M</tt>.
! </p></blockquote>
! <p>
! Above wording has been suggested for the Technical Corrigendum of C11 via issue 407, details can be found 
! <a href="http://www.open-std.org/jtc1/sc22/wg14/www/docs/n1584.pdf">here</a>.
! </p>
! 
! <p><i>[2012-03-19: Daniel proposes a slightly condensed form to reduce wording duplications]</i></p>
! 
! 
! <p><i>[2012-03-20: Hans comments]</i></p>
! 
! <p>
! The usage of the term <em>atomic operations</em> in 29.3 [atomics.order] p7 is actually
! incorrect and should better be replaced by <em>atomic modifications</em> as used in the C11
! 407 wording.
! <p/>
! There seems to be a similar wording incorrectness used in 1.10 [intro.multithread] p17
! which should be corrected as well.
! </p>
! 
! <p><i>[2012, Portland: move to Review]</i></p>
! 
! <p>
! Olivier: does the fence really participate in the modifications?
! </p>
! <p>
! Hans: S is the total set of <em>all</em> sequentially consistent operations,
!       and sequentially consistent fences are in S.
! </p>
! <p>
! Olivier: this sort of combination of a pair of half-open rules seems to imply the
!          write must make it to main memory
! </p>
! <p>
! But not all implementations treat a fence as a memory operation; cannot observe the half-open rule.
! </p>
! <p>
! Hans: not sure this is actually prevented here. You could defer until the next load.
!       What the wording doesn't quite show is that the third bullet in the new wording
!       is already in the standard.
! </p>
! <p>
! Hans: it is the interaction between fences on one side and other memory modifications
!       on the other that is being defined here.
! </p>
! <p>
! Pablo: S is not directly observable; it is a hypothetic ordering.
! </p>
! <p>
! Moved to review
! </p>
! <p>
! Hans: to alert C liaison
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! <p>Accepted for the working paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p><em>[Drafting note: The project editor is kindly asked to consider to replace in 1.10 [intro.multithread] p17
! the phrase <em>"before an operation <i>B</i> on <i>M</i>"</em> by <em>"before a modification <i>B</i> of <i>M</i>"</em>.]</em></p>
! </li>
! <li><p>Change 29.3 [atomics.order] paragraph 7 as indicated: <em>[Drafting note: Note that the
! wording change intentionally does also replace the term <em>atomic operation</em> by <em>atomic modification</em>]</em>
! </p>
! 
! <p>
! -7- <del>For atomic operations <i>A</i> and <i>B</i> on an atomic object <i>M</i>, if there are 
! <tt>memory_order_seq_cst</tt> fences <i>X</i> and <i>Y</i> such that <i>A</i> is sequenced before <i>X</i>, 
! <i>Y</i> is sequenced before <i>B</i>, and <i>X</i> precedes <i>Y</i> in <i>S</i>, then <i>B</i> 
! occurs later than <i>A</i> in the modification order of <i>M</i>.</del>
! <ins>For atomic modifications <i>A</i> and <i>B</i> of an atomic object <i>M</i>, <i>B</i> occurs
! later than <i>A</i> in the modification order of <i>M</i> if:</ins>
! <ul>
! <li><ins>there is a <tt>memory_order_seq_cst</tt> fence <i>X</i> such that <i>A</i> is sequenced before <i>X</i>, 
! and <i>X</i> precedes <i>B</i> in <i>S</i>, or</ins>
! </li>
! <li><ins>there is a <tt>memory_order_seq_cst</tt> fence <i>Y</i> such that <i>Y</i> is sequenced before <i>B</i>,
! and <i>A</i> precedes <i>Y</i> in <i>S</i>, or</ins>
! </li>
! <li><ins>there are <tt>memory_order_seq_cst</tt> fences <i>X</i> and <i>Y</i> such that <i>A</i> is sequenced 
! before <i>X</i>, <i>Y</i> is sequenced before <i>B</i>, and <i>X</i> precedes <i>Y</i> in <i>S</i>.</ins>
! </li>
! </ul>
! <p/>
! -8- [ <i>Note</i>: <tt>memory_order_seq_cst</tt> ensures sequential consistency only for a program that is free of data races
! and uses exclusively <tt>memory_order_seq_cst</tt> operations. Any use of weaker ordering will invalidate this
! guarantee unless extreme care is used. In particular, <tt>memory_order_seq_cst</tt> fences ensure a total order
! only for the fences themselves. Fences cannot, in general, be used to restore sequential consistency for atomic
! operations with weaker ordering specifications. &mdash; <i>end note</i> ]
! </p>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2132"></a>2132. <tt>std::function</tt> ambiguity</h3>
! <p><b>Section:</b> 20.9.12.2.1 [func.wrap.func.con] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Ville Voutilainen <b>Opened:</b> 2012-02-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func.con">issues</a> in [func.wrap.func.con].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Consider the following:
! </p>
! <blockquote><pre>
! #include &lt;functional&gt;
! 
! void f(std::function&lt;void()&gt;) {}
! void f(std::function&lt;void(int)&gt;) {}
! 
! int main() {
!   f([]{});
!   f([](int){});
! }
! </pre></blockquote>
! <p>
! The calls to <tt>f</tt> in <tt>main</tt> are ambiguous. Apparently because the
! conversion sequences to <tt>std::function</tt> from the lambdas are identical. 
! The standard specifies that the function object given to <tt>std::function</tt>
! "shall be <em>Callable</em> (20.8.11.2) for argument types <tt>ArgTypes</tt> and 
! return type <tt>R</tt>." It doesn't say that if this is not the case, the 
! constructor isn't part of the overload set.
! <p/>
! Daniel: During the preparation of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3123.html">N3123</a>
! it turned out that there are no longer reasons to refer to <em>INVOKE</em> as a
! conceptually entity alone, its real implementation as a function template <tt>invoke</tt>
! is possible but was deferred for a later point in time. Defining a type trait for
! the <em>Callable</em> requirement would also be possible, so there seem to be no technical
! reasons why the template constructor of <tt>std::function</tt> should not be
! constrained. The below suggested wording does this without introducing a special
! trait for this. This corresponds to the way that has been used to specify the
! <tt>result_of</tt> trait. Note that the definition of the <em>Callable</em>
! requirement is perfectly suitable for this, because it is a pure syntactically
! based requirement and can be directly transformed into a constrained template.
! <p/>
! The suggested resolution also applies such wording to the "perfectly forwarding"
! assignment operator
! </p>
! <blockquote><pre>
! template&lt;class F&gt; function&amp; operator=(F&amp;&amp;);
! </pre></blockquote>
! <p>
! The positive side-effect of this is that it automatically implements a solution to
! a problem similar to that mentioned in issue <a href="lwg-defects.html#1234">1234</a>.
! <p/>
! It would be possible to apply similar constraints to the member signatures
! </p>
! <blockquote><pre>
! template&lt;class F&gt; function&amp; operator=(reference_wrapper&lt;F&gt;);
! 
! template&lt;class F, class A&gt; void assign(F&amp;&amp;, const A&amp;);
! </pre></blockquote>
! <p>
! as well. At this point there does not seem to be a pestering reason to do so.
! </p>
! 
! <p><i>[2012-10 Portland: Move to Review]</i></p>
! 
! <p>
! STL: This is a real issue, but does not like a resolution relying on a SFINAEable metafunction
! that is not specified and available to the users.
! </p>
! 
! <p>
! <tt>packaged_task</tt> has the same issue.
! </p>
! 
! <p>
! STL strongly wants to see an <tt>is_callable</tt> type trait to clarify the proposed wording.
! </p>
! 
! <p>
! Jeremiah concerned about holding up what appears to be a correct resolution for a hypothetical
! better one later - the issue is real.
! </p>
! 
! <p>
! Why must <tt>f</tt> by CopyConstructible?  Surely MoveConstructible would be sufficient?
! </p>
! 
! <p>
! Answer: because <tt>function</tt> is CopyConstructible, and the bound functor is type-erased
! so must support all the properties of <tt>function</tt> itself.
! </p>
! 
! <p>
! Replace various applications of <tt>declval</tt> in the proposed resolution with simply using
! the passed functor object, <tt>f</tt>.
! </p>
! 
! <p>
! Alisdair to apply similar changes to <tt>packaged_task</tt>.
! </p>
! 
! <p><i>[2012-11-09, Vicente J. Botet Escriba provides another example]</i></p>
! 
! 
! <p>
! Consider the following:
! </p>
! <blockquote><pre>
! class AThreadWrapper {
! public:
!   explicit operator std::thread();
!   ...
! };
! std::thread th = std::thread(AThreadWrapper); // call to conversion operator intended
! </pre></blockquote>
! <p>
! The call to the conversion operator is overloaded with the thread constructor. But thread constructor requirement 
! makes it fail as <tt>AThreadWrapper</tt> is not a Callable and the compiler tries to instantiate the thread 
! constructor and fails.
! </p>
! 
! <p><i>[2014-02-14 Issaquah meeting: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change the following paragraphs in 20.9.12.2.1 [func.wrap.func.con]:
! [<em>Editorial comment</em>: The removal of the seemingly additional no-throw
! requirements of copy constructor and destructor of <tt>A</tt> is recommended,
! because they are already part of the Allocator requirements. Similar clean-up
! has been suggested by <a href="lwg-active.html#2070">2070</a> &mdash; <em>end comment</em>]</p>
! 
! <blockquote>
! <pre>
! template&lt;class F> function(F f);
! template&lt;class F, class A&gt; function(allocator_arg_t, const A&amp; a, F f);
! </pre>
! <blockquote>
! <p>
! -7- <i>Requires</i>: <tt>F</tt> shall be <tt>CopyConstructible</tt>. <del><tt>f</tt> shall be Callable 
! (20.9.12.2 [func.wrap.func]) for argument types <tt>ArgTypes</tt> and return type <tt>R</tt>. 
! The copy constructor and destructor of <tt>A</tt> shall not throw exceptions.</del>
! <p/>
! <ins>-?- <i>Remarks</i>: These constructors shall not participate in overload resolution unless
! <tt>f</tt> is Callable (20.9.12.2 [func.wrap.func]) for argument types
! <tt>ArgTypes...</tt> and return type <tt>R</tt>.</ins>
! </p>
! </blockquote>
! <p>
! [&hellip;]
! </p>
! <pre>
! template&lt;class F> function&amp; operator=(F&amp;&amp; f);
! </pre>
! <blockquote>
! <p>
! -18- <i>Effects</i>: <tt>function(std::forward&lt;F&gt;(f)).swap(*this);</tt>
! <p/>
! -19- <i>Returns</i>: <tt>*this</tt>
! <p/>
! <ins>-?- <i>Remarks</i>: This assignment operator shall not participate in overload resolution unless
! <tt>declval&lt;typename decay&lt;F&gt;::type&amp;&gt;()</tt> is Callable (20.9.12.2 [func.wrap.func]) 
! for argument types <tt>ArgTypes...</tt> and return type <tt>R</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2135"></a>2135. Unclear requirement for exceptions thrown in <tt>condition_variable::wait()</tt></h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar], 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! <tt>condition_varible::wait()</tt> (and, presumably, <tt>condition_variable_any::wait()</tt>, although 
! I haven't looked at it) says that it calls <tt>lock.unlock()</tt>, and if <tt>condition_variable::wait()</tt> 
! exits by an exception it calls <tt>lock.lock()</tt> on the way out. But if the initial call to 
! <tt>lock.unlock()</tt> threw an exception, does it make sense to call <tt>lock.lock()</tt>? We simply 
! don't know the state of that lock object, and it's probably better not to touch it.
! <p/>
! That aside, once the <tt>wait()</tt> call has been unblocked, it calls <tt>lock.lock()</tt>. If <tt>lock.lock()</tt> 
! throws an exception, what happens? The requirement is:
! </p>
! <blockquote><p>
! If the function exits via an exception, <tt>lock.lock()</tt> shall be called prior to exiting the function scope.
! </p></blockquote>
! <p>
! That can be read in two different ways. One way is as if it said "<tt>lock.lock()</tt> shall have been called …", 
! i.e. the original, failed, call to <tt>lock.lock()</tt> is all that's required. But a more natural reading is 
! that wait has to call <tt>lock.lock()</tt> again, even though it already failed.
! <p/>
! I think this wording suffers from being too general. There are two possible exception sources: the initial call 
! to <tt>lock.unlock()</tt> and the final call to <tt>lock.lock()</tt>. Each one should have its own requirement. 
! Lumping them together muddles things.
! </p>
! 
! <p><i>[2012, Portland: move to Open]</i></p>
! 
! <p>
! Pablo: <tt>unlock</tt> failing is easy -- the call leaves it locked.
!        The second case, trying to <tt>lock</tt> fails -- what can you do?
!        This is an odd state as we <em>had</em> it locked before was called wait.
!        Maybe we should call <tt>terminate</tt> as we cannot meet the post-conditions.
!        We could throw a different exception.
! </p>
! <p>
! Hans: calling <tt>terminate</tt> makes sense as we're likely to call it soon anyway
!       and at least we have some context.
! </p>
! <p>
! Detlef: what kind of locks might be being used?
! </p>
! <p>
! Pablo: condition variables are 'our' locks so this is less of a problem.
!        <tt>condition_variable_any</tt> might be more problematic.
! </p>
! <p>
! The general direction is to call <tt>terminate</tt> if the lock cannot be reacquired.
! </p>
! <p>
! Pablo: Can we change the wording to 'leaves the mutex locked' ?
! </p>
! <p>
! Hans: so if the <tt>unlock</tt> throws we simply propagate the exception.
! </p>
! <p>
! Move the issue to open and add some formal wording at a later time.
! </p>
! 
! <p><i>[2013-09 Chicago: Resolved]</i></p>
! 
! 
! <p>
! Detlef improves wording. Daniel suggests to introduce a <i>Remarks</i> element for the special
! "If the function fails to meet the postcondition..." wording and applies this to the proposed
! wording.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 30.5.1 [thread.condition.condvar] as indicated:</p>
! 
! <blockquote><pre>
! void wait(unique_lock&lt;mutex&gt;&amp; lock);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -10- <i>Effects:</i>
! </p>
! <ul>
! <li><p>Atomically calls <tt>lock.unlock()</tt> and blocks on <tt>*this</tt>.</p></li>
! <li><p>When unblocked, calls <tt>lock.lock()</tt> (possibly blocking on the lock), then returns.</p></li>
! <li><p>The function will unblock when signaled by a call to <tt>notify_one()</tt> or a call to <tt>notify_all()</tt>,
! or spuriously.</p></li>
! <li><p><del>If the function exits via an exception, <tt>lock.lock()</tt> shall be called prior to exiting the function
! scope.</del></p></li>
! </ul>
! <p>
! <ins>-?- <i>Remarks:</i> If the function fails to meet the postcondition, <tt>std::terminate()</tt> shall be called 
! (15.5.1 [except.terminate]). [<i>Note:</i> This can happen if the re-locking of the mutex throws an 
! exception. &mdash; <i>end note</i>]</ins>
! <p/>
! -11- <i>Postcondition:</i> <tt>lock.owns_lock()</tt> is true and <tt>lock.mutex()</tt> is locked by the calling 
! thread. 
! <p/>
! -12- <i>Throws:</i> <ins>Nothing</ins><del><tt>system_error</tt> when an exception is required (30.2.2)</del>.
! <p/>
! <del>-13- <i>Error conditions:</i></del>
! </p>
! <ul>
! <li><p><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></p></li>
! </ul>
! </blockquote>
! 
! <blockquote>
! <pre>
! template &lt;class Predicate&gt;
! void wait(unique_lock&lt;mutex&gt;&amp; lock, Predicate pred);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <ins>-?- <i>Remarks:</i> If the function fails to meet the postcondition, <tt>std::terminate()</tt> shall be called 
! (15.5.1 [except.terminate]). [<i>Note:</i> This can happen if the re-locking of the mutex throws an 
! exception. &mdash; <i>end note</i>]</ins>
! <p/>
! -16- <i>Postcondition:</i> <tt>lock.owns_lock()</tt> is true and <tt>lock.mutex()</tt> is locked by the calling 
! thread.
! <p/>
! -17- <i>Throws:</i> <del><tt>system_error</tt> when an exception is required (30.2.2),</del> timeout-related exceptions 
! (30.2.4)<del>,</del> or any exception thrown by <tt>pred</tt>.
! <p/>
! <del>-18- <i>Error conditions:</i></del>
! </p>
! <ul>
! <li><p><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></p></li>
! </ul>
! </blockquote></blockquote>
! 
! <blockquote>
! <pre>
! template &lt;class Clock, class Duration&gt;
!   cv_status wait_until(unique_lock&lt;mutex&gt;&amp; lock,
!     const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -20- <i>Effects:</i> 
! </p>
! <ul>
! <li><p>[&hellip;]</p></li>
! <li><p>If the function exits via an exception, <tt>lock.lock()</tt> shall be called prior to exiting the function
! <del>scope</del>.</p></li>
! </ul>
! <p>
! <ins>-?- <i>Remarks:</i> If the function fails to meet the postcondition, <tt>std::terminate()</tt> shall be called 
! (15.5.1 [except.terminate]). [<i>Note:</i> This can happen if the re-locking of the mutex throws an 
! exception. &mdash; <i>end note</i>]</ins>
! <p/>
! -21- <i>Postcondition:</i> <tt>lock.owns_lock()</tt> is true and <tt>lock.mutex()</tt> is locked by the calling 
! thread.
! <p/>
! [&hellip;]
! <p/>
! -23- <i>Throws:</i> <del><tt>system_error</tt> when an exception is required (30.2.2) or</del> timeout-related 
! exceptions (30.2.4).
! <p/>
! <del>-24- <i>Error conditions:</i></del>
! </p>
! <ul>
! <li><p><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></p></li>
! </ul>
! </blockquote></blockquote>
! 
! <blockquote>
! <pre>
! template &lt;class Rep, class Period&gt;
!   cv_status wait_for(unique_lock&lt;mutex&gt;&amp; lock,
!     const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <ins>-?- <i>Remarks:</i> If the function fails to meet the postcondition, <tt>std::terminate()</tt> shall be called 
! (15.5.1 [except.terminate]). [<i>Note:</i> This can happen if the re-locking of the mutex throws an 
! exception. &mdash; <i>end note</i>]</ins>
! <p/>
! -28- <i>Postcondition:</i> <tt>lock.owns_lock()</tt> is true and <tt>lock.mutex()</tt> is locked by the calling 
! thread.
! <p/>
! [&hellip;]
! <p/>
! -29- <i>Throws:</i> <del><tt>system_error</tt> when an exception is required (30.2.2) or</del> timeout-related 
! exceptions (30.2.4).
! <p/>
! <del>-30- <i>Error conditions:</i></del>
! </p>
! <ul>
! <li><p><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></p></li>
! </ul>
! </blockquote></blockquote>
! 
! <blockquote>
! <pre>
! template &lt;class Clock, class Duration, class Predicate&gt;
!   bool wait_until(unique_lock&lt;mutex&gt;&amp; lock,
!     const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time,
! 	Predicate pred);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <ins>-?- <i>Remarks:</i> If the function fails to meet the postcondition, <tt>std::terminate()</tt> shall be called 
! (15.5.1 [except.terminate]). [<i>Note:</i> This can happen if the re-locking of the mutex throws an 
! exception. &mdash; <i>end note</i>]</ins>
! <p/>
! -33- <i>Postcondition:</i> <tt>lock.owns_lock()</tt> is true and <tt>lock.mutex()</tt> is locked by the calling 
! thread.
! <p/>
! [&hellip;]
! <p/>
! -35- <i>Throws:</i> <del><tt>system_error</tt> when an exception is required (30.2.2),</del> timeout-related exceptions 
! (30.2.4)<del>,</del> or any exception thrown by <tt>pred</tt>.
! <p/>
! <del>-36- <i>Error conditions:</i></del>
! </p>
! <ul>
! <li><p><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></p></li>
! </ul>
! </blockquote></blockquote>
! 
! <blockquote>
! <pre>
! template &lt;class Rep, class Period, class Predicate&gt;
!   bool wait_for(unique_lock&lt;mutex&gt;&amp; lock,
!     const chrono::duration&lt;Rep, Period&gt;&amp; rel_time,
! 	Predicate pred);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <ins>-?- <i>Remarks:</i> If the function fails to meet the postcondition, <tt>std::terminate()</tt> shall be called 
! (15.5.1 [except.terminate]). [<i>Note:</i> This can happen if the re-locking of the mutex throws an 
! exception. &mdash; <i>end note</i>]</ins>
! <p/>
! -40- <i>Postcondition:</i> <tt>lock.owns_lock()</tt> is true and <tt>lock.mutex()</tt> is locked by the calling 
! thread.
! <p/>
! [&hellip;]
! <p/>
! -42- <i>Throws:</i> <del><tt>system_error</tt> when an exception is required (30.2.2),</del> timeout-related exceptions 
! (30.2.4)<del>,</del> or any exception thrown by <tt>pred</tt>.
! <p/>
! <del>-43- <i>Error conditions:</i></del>
! </p>
! <ul>
! <li><p><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></p></li>
! </ul>
! </blockquote></blockquote>
! 
! </blockquote>
! 
! </li>
! 
! <li><p>Edit 30.5.2 [thread.condition.condvarany] as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class Lock&gt;
! void wait(Lock&amp; lock);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -10- <i>Effects:</i>
! </p>
! <ul>
! <li><p>Atomically calls <tt>lock.unlock()</tt> and blocks on <tt>*this</tt>.</p></li>
! <li><p>When unblocked, calls <tt>lock.lock()</tt> (possibly blocking on the lock) and returns.</p></li>
! <li><p>The function will unblock when signaled by a call to <tt>notify_one()</tt>, a call to <tt>notify_all()</tt>,
! or spuriously.</p></li>
! <li><p><del>If the function exits via an exception, <tt>lock.lock()</tt> shall be called prior to exiting the function
! scope.</del></p></li>
! </ul>
! <p>
! <ins>-?- <i>Remarks:</i> If the function fails to meet the postcondition, <tt>std::terminate()</tt> shall be called 
! (15.5.1 [except.terminate]). [<i>Note:</i> This can happen if the re-locking of the mutex throws an 
! exception. &mdash; <i>end note</i>]</ins>
! <p/>
! -11- <i>Postcondition:</i> <tt>lock</tt> is locked by the calling thread. 
! <p/>
! -12- <i>Throws:</i> <ins>Nothing</ins><del><tt>system_error</tt> when an exception is required (30.2.2)</del>.
! <p/>
! <del>-13- <i>Error conditions:</i></del>
! </p>
! <ul>
! <li><p><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></p></li>
! </ul>
! 
! </blockquote>
! 
! <blockquote>
! <pre>
! template &lt;class Lock, class Clock, class Duration&gt;
!   cv_status wait_until(Lock&amp; lock, const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -15- <i>Effects:</i> 
! </p>
! <ul>
! <li><p>[&hellip;]</p></li>
! <li><p>If the function exits via an exception, <tt>lock.lock()</tt> shall be called prior to exiting the function
! <del>scope</del>.</p></li>
! </ul>
! <p>
! <ins>-?- <i>Remarks:</i> If the function fails to meet the postcondition, <tt>std::terminate()</tt> shall be called 
! (15.5.1 [except.terminate]). [<i>Note:</i> This can happen if the re-locking of the mutex throws an 
! exception. &mdash; <i>end note</i>]</ins>
! <p/>
! -16- <i>Postcondition:</i> <tt>lock</tt> is locked by the calling thread.
! <p/>
! [&hellip;]
! <p/>
! -18- <i>Throws:</i> <del><tt>system_error</tt> when an exception is required (30.2.2) or</del> timeout-related 
! exceptions (30.2.4).
! <p/>
! <del>-19- <i>Error conditions:</i></del>
! </p>
! <ul>
! <li><p><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></p></li>
! </ul>
! </blockquote></blockquote>
! 
! <blockquote>
! <pre>
! template &lt;class Lock, class Rep, class Period&gt;
!   cv_status wait_for(Lock&amp; lock, const chrono::duration&lt;Rep, Period&gt;&amp; rel_time);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <ins>-?- <i>Remarks:</i> If the function fails to meet the postcondition, <tt>std::terminate()</tt> shall be called 
! (15.5.1 [except.terminate]). [<i>Note:</i> This can happen if the re-locking of the mutex throws an 
! exception. &mdash; <i>end note</i>]</ins>
! <p/>
! -22- <i>Postcondition:</i> <tt>lock</tt> is locked by the calling thread.
! <p/>
! [&hellip;]
! <p/>
! -23- <i>Throws:</i> <del><tt>system_error</tt> when an exception is required (30.2.2) or</del> timeout-related 
! exceptions (30.2.4).
! <p/>
! <del>-24- <i>Error conditions:</i></del>
! </p>
! <ul>
! <li><p><del>equivalent error condition from <tt>lock.lock()</tt> or <tt>lock.unlock()</tt>.</del></p></li>
! </ul>
! </blockquote></blockquote>
! 
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2138"></a>2138. <tt>atomic_flag::clear</tt> should not accept <tt>memory_order_consume</tt></h3>
! <p><b>Section:</b> 29.7 [atomics.flag] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Ben Viglietta <b>Opened:</b> 2012-03-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.flag">issues</a> in [atomics.flag].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3376.pdf">N3376</a> 29.7 [atomics.flag]&#47;7 says
! this about <tt>atomic_flag::clear</tt>:
! </p>
! <blockquote><p>
! <i>Requires</i>: The <tt>order</tt> argument shall not be <tt>memory_order_acquire</tt> or <tt>memory_order_acq_rel</tt>.
! </p></blockquote>
! <p>
! In addition, <tt>memory_order_consume</tt> should be disallowed, since it doesn't meaningfully apply to store operations.  
! It's already disallowed on the analogous <tt>atomic&lt;T&gt;::store</tt>. The proposed updated text would be:
! </p>
! <blockquote><p>
! <i>Requires</i>: The <tt>order</tt> argument shall not be <ins><tt>memory_order_consume</tt>,</ins> 
! <tt>memory_order_acquire</tt><ins>,</ins> or <tt>memory_order_acq_rel</tt>.
! </p></blockquote>
! 
! <p><i>[2012, Portland: move to Review]</i></p>
! 
! <p>
! Hans: this is a clear oversight.
! </p>
! <p>
! Moved to review
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! <p>Accepted for the working paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p><i>[This wording is relative to N3376.]</i></p>
! 
! 
! <blockquote><pre>
! void atomic_flag_clear(volatile atomic_flag *object) noexcept;
! void atomic_flag_clear(atomic_flag *object) noexcept;
! void atomic_flag_clear_explicit(volatile atomic_flag *object, memory_order order) noexcept;
! void atomic_flag_clear_explicit(atomic_flag *object, memory_order order) noexcept;
! void atomic_flag::clear(memory_order order = memory_order_seq_cst) volatile noexcept;
! void atomic_flag::clear(memory_order order = memory_order_seq_cst) noexcept;
! </pre><blockquote>
! <p>
! -7- <i>Requires</i>: The <tt>order</tt> argument shall not be <ins><tt>memory_order_consume</tt>,</ins> 
! <tt>memory_order_acquire</tt><ins>,</ins> or <tt>memory_order_acq_rel</tt>.
! <p/>
! -8- <i>Effects</i>: Atomically sets the value pointed to by <tt>object</tt> or by <tt>this</tt> to false. Memory is affected
! according to the value of <tt>order</tt>.
! </p>
! </blockquote>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2140"></a>2140. Meaning of <tt>notify_all_at_thread_exit</tt> synchronization requirement?</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-03-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! <tt>notify_all_at_thread_exit</tt> has the following synchronization requirement:
! </p>
! <blockquote><p>
! <i>Synchronization</i>: The call to <tt>notify_all_at_thread_exit</tt> and the completion of the destructors 
! for all the current thread's variables of thread storage duration <em>synchronize with</em> (1.10 [intro.multithread]) 
! calls to functions waiting on <tt>cond</tt>.
! </p></blockquote>
! <p>
! The functions waiting on <tt>cond</tt> have already been called, otherwise they wouldn't be waiting. So how can a subsequent 
! call to <tt>notify_all_at_thread_exit</tt> synchronize with them?
! <p/>
! Also, "synchronizes with" is a relationship between library calls (1.10 [intro.multithread]&#47;8), so it's not 
! meaningful for completion of destructors for non-library objects. Presumably the intention wasn't so make library 
! destructors special here.
! </p>
! 
! <p><i>[2012-03-09 Jeffrey Yasskin comments:]</i></p>
! 
! 
! <p>
! I think the text should say that "<tt>notify_all_at_thread_exit</tt> and destructor calls are sequenced before
! the <tt>lk.unlock()</tt>", and leave it at that, unless there's a funny implementation I haven't thought of.
! </p>
! 
! <p><i>[2012-03-19 Hans Boehm comments:]</i></p>
! 
! 
! <p>
! I think the synchronization clause should just be replaced with (modulo wording tweaks):
! <p/>
! "The implied <tt>lk.unlock()</tt> call is sequenced after the destruction of all objects with thread storage duration 
! associated with the current thread."
! <p/>
! as Jeffrey suggested.
! <p/>
! To use this correctly, the notifying thread has to essentially acquire the lock, set a variable indicating it's done, 
! call <tt>notify_all_at_thread_exit()</tt>, while the waiting thread acquires the lock, and repeatedly waits on the 
! cv until the variable is set, and then releases the lock.  That ensures that we have the proper synchronizes with 
! relationship as a result of the lock.
! </p>
! 
! <p><i>[2012, Portland: move to Review]</i></p>
! 
! <p>
! The <tt>lk.unlock()</tt> refers back to the wording the previous paragraph.
! </p>
! <p>
! Moved to review
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! <p>Accepted for the working paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol><li><p>Modify 30.5 [thread.condition] p8 as indicated:</p>
! 
! <blockquote>
! <pre>
! void notify_all_at_thread_exit(condition_variable&amp; cond, unique_lock&lt;mutex&gt; lk);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -8- <i>Synchronization</i>: <del>The call to <tt>notify_all_at_thread_exit</tt> and the completion of the destructors for
! all the current thread's variables of thread storage duration synchronize with (1.10 [intro.multithread]) 
! calls to functions waiting on <tt>cond</tt></del> <ins>The implied <tt>lk.unlock()</tt> call is sequenced after the 
! destruction of all objects with thread storage duration associated with the current thread</ins>.
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2141"></a>2141. <tt>common_type</tt> trait produces reference types</h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Doug Gregor <b>Opened:</b> 2012-03-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The type computation of the <tt>common_type</tt> type trait is defined as
! </p>
! <blockquote><pre>
! template &lt;class T, class U&gt;
!  struct common_type&lt;T, U&gt; {
!    typedef decltype(true ? declval&lt;T&gt;() : declval&lt;U&gt;()) type;
!  };
! </pre></blockquote>
! <p>
! This means that <tt>common_type&lt;int, int&gt;::type</tt> is <tt>int&amp;&amp;</tt>, because
! </p>
! <ul>
! <li><tt>declval&lt;int&gt;()</tt> returns <tt>int&amp;&amp;</tt></li>
! <li>The conditional operator returns an xvalue when its second and third operands have the same type 
! and are both xvalues (5.16 [expr.cond] p4)</li>
! <li><tt>decltype</tt> returns <tt>T&amp;&amp;</tt> when its expression is an xvalue (7.1.6.2 [dcl.type.simple] p4)</li>
! </ul>
! <p>
! Users of <tt>common_type</tt> do not expect to get a reference type as the result; the expectation is that 
! <tt>common_type</tt> will return a non-reference type to which all of the types can be converted.
! <p/>
! Daniel: In addition to that it should be noted that without such a fix the definition of <tt>std::unique_ptr</tt>'s
! <tt>operator&lt;</tt> in 20.8.1.5 [unique.ptr.special] (around p4) is also broken: In the most typical case 
! (with default deleter), the determination of the common pointer type <em>CT</em> will instantiate 
! <tt>std::less&lt;<em>CT</em>&gt;</tt> which can now be <tt>std::less&lt;T*&amp;&amp;&gt;</tt>, which will
! <em>not</em> be the specialization of pointer types that guarantess a total order.
! <p/>
! Given the historic constext of <tt>common_type</tt> original specification, the proper resolution to me
! seems to be using <tt>std::decay</tt> instead of <tt>std::remove_reference</tt>: 
! </p>
! <blockquote><pre>
! template &lt;class T, class U&gt;
! struct common_type&lt;T, U&gt; {
!   typedef <ins>typename decay&lt;</ins>decltype(true ? declval&lt;T&gt;() : declval&lt;U&gt;())<ins>&gt;::type</ins> type;
! };
! </pre></blockquote>
! <p>
! At that time rvalues had no identity in this construct and rvalues of non-class types have no cv-qualification.
! With this change we would ensure that
! </p>
! <blockquote><pre>
! common_type&lt;int, int&gt;::type == common_type&lt;const int, const int&gt;::type == int
! </pre></blockquote>
! <p>
! Note that this harmonizes with the corresponding heterogenous case, which has already the exact same effect:
! </p>
! <blockquote><pre>
! common_type&lt;int, long&gt;::type == common_type&lt;const int, const long&gt;::type == long
! </pre></blockquote>
! 
! <p><i>[2012-10-11 Daniel comments]</i></p>
! 
! <p>
! While testing the effects of applying the proposed resolution I noticed that this will have the effect that the unary 
! form of <tt>common_type</tt>, like
! </p>
! <blockquote><pre>
! common_type&lt;int&gt;
! </pre></blockquote>
! <p>
! is not symmetric to the n-ary form (n &gt; 1). This is unfortunate, because this difference comes especially to effect when 
! <tt>common_type</tt> is used with variadic templates. As an example consider the following <tt>make_array</tt> template:
! </p>
! <blockquote><pre>
! #include &lt;array>
! #include &lt;type_traits>
! #include &lt;utility>
! 
! template&lt;class... Args&gt;
! std::array&lt;typename std::common_type&lt;Args...&gt;::type, sizeof...(Args)&gt;
! make_array(Args&amp;&amp;... args)
! {
!   typedef typename std::common_type&lt;Args...&gt;::type CT;
!   return std::array&lt;CT, sizeof...(Args)&gt;{static_cast&lt;CT&gt;(std::forward&lt;Args&gt;(args))...};
! }
! 
! int main()
! {
!   auto a1 = make_array(0); // OK: std::array&lt;int, 1&gt;
!   auto a2 = make_array(0, 1.2); // OK: std::array&lt;double, 2&gt;
!   auto a3 = make_array(5, true, 3.1415f, 'c'); // OK: std::array&lt;float, 4&gt;
! 
!   int i = 0;
!   auto a1b = make_array(i); // <span style="color:#C80000;font-weight:bold">Error, attempt to form std::array&lt;int&amp;, 1&gt;</span>
! 
!   auto a2b = make_array(i, 1.2); // OK: std::array&lt;double, 2&gt;
!   auto a2c = make_array(i, 0); // OK: std::array&lt;int, 2&gt;
! }
! </pre></blockquote>
! <p>
! The error for <tt>a1b</tt> <em>only</em> happens in the unary case and it is easy that it remains unnoticed
! during tests. You cannot explain that reasonably to the user here.
! <p/>
! Of-course it is possible to fix that in this example by applying <tt>std::decay</tt> to the result of the 
! <tt>std::common_type</tt> deduction. But if this is necessary here, I wonder why it should also be applied to 
! the binary case, where it gives the wrong illusion of a complete type decay? The other way around: Why is 
! <tt>std::decay</tt> not also applied to the unary case as well?
! <p/>
! This problem is not completely new and was already observed for the original <tt>std::common_type</tt> specification. 
! At this time the <tt>decltype</tt> rules had a similar asymmetric effect when comparing
! </p>
! <blockquote><p>
! <tt>std::common_type&lt;const int, const int&gt;::type</tt> (equal to '<tt>int</tt>' at this time)
! </p></blockquote>
! <p>
! with:
! </p>
! <blockquote><p>
! <tt>std::common_type&lt;const int&gt;::type</tt> (equal to '<tt>const int</tt>')
! </p></blockquote>
! <p>
! and I wondered whether the unary form shouldn't also perform the same "decay" as the n-ary form.
! <p/>
! This problem makes me think that the current resolution proposal might not be ideal and I expect
! differences in implementations (for those who consider to apply this proposed resolution already). I
! see at least three reasonable options:
! </p>
! <ol>
! <li><p>Accept the current wording suggestion for LWG 2141 as it is and explain that to users.</p></li>
! <li><p>Keep <tt>std::common_type</tt> as currently specified in the Standard and tell users to use
! <tt>std::decay</tt> where needed. Also fix other places in the library, e.g. the comparison
! functions of <tt>std::unique_ptr</tt> or a most of the time library functions.</p></li>
! <li><p>Apply <tt>std::decay</tt> also in the unary specialization of <tt>std::common_type</tt> with
! the effect that <tt>std::common_type&lt;const int&amp;&gt;::type</tt> returns <tt>int</tt>.</p></li>
! </ol>
! 
! <p><i>[2012-10-11 Marc Glisse comments]</i></p>
! 
! <p>
! If we are going with decay everywhere, I wonder whether we should also decay in the 2-argument version <em>before</em> 
! and not only <em>after</em>. So if I specialize <tt>common_type&lt;mytype, double&gt;</tt>, 
! <tt>common_type&lt;const mytype, volatile double&amp;&gt;</tt> would automatically work.
! </p>
! 
! <p><i>[2012-10-11 Daniel provides wording for bullet 3 of his list:]</i></p>
! 
! 
! <ol style="list-style-type:upper-alpha">
! <li><p>Change 20.10.7.6 [meta.trans.other] p3 as indicated:</p>
! <blockquote><pre>
! template &lt;class T&gt;
! struct common_type&lt;T&gt; {
!   typedef <ins>typename decay&lt;</ins>T<ins>&gt;::type</ins> type;
! };
! 
! template &lt;class T, class U&gt;
! struct common_type&lt;T, U&gt; {
!   typedef <ins>typename decay&lt;</ins>decltype(true ? declval&lt;T&gt;() : declval&lt;U&gt;())<ins>&gt;::type</ins> type;
! };
! </pre></blockquote>
! </li>
! </ol>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! <p>
! Want to carefully consider the effect of <tt>decay</tt> vs. <tt>remove_reference</tt> with respect
! to constness before adopting, although this proposed resolution stands for review in Bristol.
! </p>
! 
! <p><i>[2013-04-18, Bristol meeting]</i></p>
! 
! 
! <p>Previous wording:</p>
! 
! <blockquote class="note"> 
! <p>This wording is relative to N3376.</p>
! 
! <ol><li><p>In 20.10.7.6 [meta.trans.other] p3, change the <tt>common_type</tt> definition to</p>
! <blockquote><pre>
! template &lt;class T, class U&gt;
! struct common_type&lt;T, U&gt; {
!   typedef <ins>typename decay&lt;</ins>decltype(true ? declval&lt;T&gt;() : declval&lt;U&gt;())<ins>&gt;::type</ins> type;
! };
! </pre></blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! <p>Move to Ready</p>
! 
! <p><i>[2013-09-29, Chicago]</i></p>
! 
! 
! <p>Accepted for the working paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Change 20.10.7.6 [meta.trans.other] p3 as indicated:</p>
! <blockquote><pre>
! template &lt;class T&gt;
! struct common_type&lt;T&gt; {
!   typedef <ins>typename decay&lt;</ins>T<ins>&gt;::type</ins> type;
! };
! 
! template &lt;class T, class U&gt;
! struct common_type&lt;T, U&gt; {
!   typedef <ins>typename decay&lt;</ins>decltype(true ? declval&lt;T&gt;() : declval&lt;U&gt;())<ins>&gt;::type</ins> type;
! };
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2142"></a>2142. <tt>packaged_task::operator()</tt> synchronization too broad?</h3>
! <p><b>Section:</b> 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-03-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! According to 30.6.9.1 [futures.task.members] p.18:
! </p>
! <blockquote><p>
! [A] successful call to [<tt>packaged_task::</tt>]<tt>operator()</tt> <em>synchronizes with</em> 
! a call to any member function of a <tt>future</tt> or <tt>shared_future</tt> object that shares 
! the shared state of <tt>*this</tt>.
! </p></blockquote>
! <p>
! This requires that the call to <tt>operator()</tt> synchronizes with calls to <tt>future::wait_for</tt>, 
! <tt>future::wait_until</tt>, <tt>shared_future::wait_for</tt>, and <tt>shared_future::wait_until</tt>, 
! even when these functions return because of a timeout.
! </p>
! 
! <p><i>[2012, Portland: move to Open]</i></p>
! 
! <p>
! If it said "a successful return from" (or "a return from" to cover exceptions) the problem would be more obvious.
! </p>
! <p>
! Detlef: will ask Anthony Williams to draft some wording.
! </p>
! <p>
! Moved to open (Anthony drafted to draft)
! </p>
! 
! <p><i>[2013-09, Chicago: move to Ready]</i></p>
! 
! 
! <p>
! Anthony's conclusion is that the offending paragraph is not needed. Already included in the statement 
! that the state is made ready.
! <p/>
! Recommendation: Remove 30.6.9.1 [futures.task.members] p18 (the synchronization clause). Redundant because of 
! 30.6.4 [futures.state] p9.
! </p>
! <p>
! Moved to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Remove 30.6.9.1 [futures.task.members] p18 as indicated:</p>
! 
! <blockquote><pre>
! void operator()(ArgTypes... args);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-18- <i>Synchronization:</i> a successful call to <tt>operator()</tt> synchronizes with (1.10) a call to any member function
! of a <tt>future</tt> or <tt>shared_future</tt> object that shares the shared state of <tt>*this</tt>. The completion of
! the invocation of the stored task and the storage of the result (whether normal or exceptional) into
! the shared state synchronizes with (1.10) the successful return from any member function that detects
! that the state is set to ready. [<i>Note:</i> <tt>operator()</tt> synchronizes and serializes with other functions
! through the shared state. &mdash; <i>end note</i>]</del>
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2143"></a>2143. <tt>ios_base::xalloc</tt> should be thread-safe</h3>
! <p><b>Section:</b> 27.5.3 [ios.base] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2012-03-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ios.base">issues</a> in [ios.base].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The static function <tt>ios_base::xalloc()</tt> could be called from multiple threads and is not covered by 
! 17.6.4.10 [res.on.objects] and 17.6.5.9 [res.on.data.races]. Adding a thread-safety requirement 
! should not impose a significant burden on implementations, as the function can be easily implemented with 
! hopefully lock-free atomics.
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! 
! <p>
! Unanimous.
! <p/>
! Resolution: move tentatively ready. (Inform Bill about this issue.)  
! </p>
! 
! <p><i>[2013-09-29, Chicago]</i></p>
! 
! 
! <p>
! Apply to Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>In 27.5.3.5 [ios.base.storage] add a new paragraph after paragraph 1:</p>
! 
! <blockquote><pre>
! static int xalloc();
! </pre><blockquote>
! <p>
! -1- <i>Returns</i>: <tt>index ++</tt>.
! <p/>
! <ins>-?- <i>Remarks</i>: Concurrent access to this function by multiple threads shall not result in a data 
! race (1.10 [intro.multithread]).</ins>
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2144"></a>2144. Missing <tt>noexcept</tt> specification in <tt>type_index</tt></h3>
! <p><b>Section:</b> 20.14 [type.index] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-03-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#type.index">issues</a> in [type.index].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The class type <tt>type_index</tt> is a thin wrapper of <tt>type_info</tt> to
! adapt it as a valid associative container element. Similar to <tt>type_info</tt>, 
! all member functions have an effective <tt>noexcept(true)</tt> specification, with the 
! exception of <tt>hash_code()</tt> and <tt>name()</tt>. The actual effects of these
! functions is a direct call to <tt>type_info</tt>'s <tt>hash_code()</tt> and <tt>name</tt> 
! function, but according to 18.7 [support.rtti] these are both <tt>noexcept</tt>
! functions, so there is no reason for not declaring them as <tt>noexcept</tt>, too. In fact,
! one of the suggested changes of the original proposing paper 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2530.html">N2530</a>
! specifically was to ensure that <tt>type_info</tt> would get a <tt>hash_code()</tt>
! function that guarantees not to throw exceptions (during that time the <tt>hash</tt>
! requirements did not allow to exit with an exception). From this we can conclude that
! <tt>type_index::hash_code()</tt> was intended to be nothrow.
! <p/>
! It seems both consistent and technically simply to require these functions to be <tt>noexcept</tt>.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Modify the class <tt>type_index</tt> synopsis, 20.14.2 [type.index.overview] as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   class type_index {
!   public:
!     type_index(const type_info&amp; rhs) noexcept;
!     bool operator==(const type_index&amp; rhs) const noexcept;
!     bool operator!=(const type_index&amp; rhs) const noexcept;
!     bool operator&lt; (const type_index&amp; rhs) const noexcept;
!     bool operator&lt;= (const type_index&amp; rhs) const noexcept;
!     bool operator&gt; (const type_index&amp; rhs) const noexcept;
!     bool operator&gt;= (const type_index&amp; rhs) const noexcept;
!     size_t hash_code() const <ins>noexcept</ins>;
!     const char* name() const <ins>noexcept</ins>;
!   private:
!     const type_info* target; <i>// exposition only</i>
!     <i>// Note that the use of a pointer here, rather than a reference,</i>
!     <i>// means that the default copy&#47;move constructor and assignment</i>
!     <i>// operators will be provided and work as expected.</i>
!   };
! }
! </pre></blockquote>
! </li>
! </ol>
! 
! <ol>
! <li><p>Modify the prototype definitions in 20.14.3 [type.index.members] as indicated:</p>
! 
! <blockquote><pre>
! size_t hash_code() const <ins>noexcept</ins>;
! </pre><blockquote>
! <p>
! -8- <i>Returns</i>: <tt>target->hash_code()</tt>
! </p>
! </blockquote>
! <pre>
! const char* name() const <ins>noexcept</ins>;
! </pre><blockquote>
! <p>
! -9- <i>Returns</i>: <tt>target->name()</tt>
! </p>
! </blockquote>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2145"></a>2145. <tt>error_category</tt> default constructor</h3>
! <p><b>Section:</b> 19.5.1 [syserr.errcat] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2012-03-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#syserr.errcat">issues</a> in [syserr.errcat].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Should <tt>error_category</tt> have a default constructor?
! <p/>
! If you look at the synopsis in 19.5.1.1 [syserr.errcat.overview], it appears the answer is no. There 
! is no default constructor declared and there is another constructor declared (which should inhibit a default 
! constructor).
! <p/>
! However in paragraph 1 of the same section, descriptive text says:
! </p>
! <blockquote><p>
! Classes may be derived from <tt>error_category</tt> to support categories of errors in addition to those 
! defined in this International Standard.
! </p></blockquote>
! <p>
! How shall classes derived from <tt>error_category</tt> construct their base?
! <p/>
! Jonathan Wakely: In <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2066.html">N2066</a> 
! <tt>error_category</tt> was default-constructible. That is still the case in 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2241.html">N2241</a>, because no other 
! constructor is declared. Then later <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2422.htm">N2422</a> 
! (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2422.htm#Issue6">issue 6</a>) declares 
! the copy constructor as deleted, but doesn't add a default constructor, causing it to be no longer
! default-constructible. That looks like an oversight to me, and I think there should be a public default 
! constructor.
! <p/>
! Daniel: A default-constructor indeed should be provided to allow user-derived classes as described by the
! standard. I suggest this one to be both <tt>noexcept</tt> and <tt>constexpr</tt>. The latter allows
! user-derived non-abstract classes to take advantage of the special <em>constant initialization</em> rule
! of 3.6.2 [basic.start.init] p2 b2 for objects with static (or thread) storage duration in namespace 
! scope. Note that a <tt>constexpr</tt> constructor is feasible here, even though there exists a non-trivial
! destructor and even though <tt>error_category</tt> is not a literal type (see <tt>std::mutex</tt> for a similar
! design choice).
! <p/>
! In addition to that the proposed resolution fixes another minor glitch: According to 17.5.2.2 [functions.within.classes]
! virtual destructors require a semantics description. 
! <p/>
! Alberto Ganesh Barbati: I would suggest to remove <tt>=default</tt> from the constructor instead. 
! Please consider that defaulting a constructor or destructor may actually define them as deleted under certain 
! conditions (see 12.1 [class.ctor]&#47;5 and 12.4 [class.dtor]&#47;5). Removing <tt>=default</tt> 
! is easier than providing wording to ensures that such conditions do not occur.
! </p>
! 
! <p><i>[2012-10 Portland: move to Ready]</i></p>
! 
! <p>
! The issue is real and the resolution looks good.
! </p>
! 
! <p>
! Are there similar issues elsewhere in this clause?
! </p>
! 
! <p>
! Potential to add <tt>constexpr</tt> to more constructors, but clearly a separable issue.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Modify the class <tt>error_category</tt> synopsis, 19.5.1.1 [syserr.errcat.overview] as indicated:
! <em>[Drafting note: According to the general 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3279.pdf"><tt>noexcept</tt> library guidelines</a> 
! destructors should not have any explicit exception specification. This destructor was overlooked during the paper
! analysis &mdash; end note]</em>
! </p>
! 
! <blockquote><pre>
! namespace std {
!   class error_category {
!   public:
!     <ins>constexpr error_category() noexcept;</ins>
!     virtual ~error_category() <del>noexcept</del>;
!     error_category(const error_category&amp;) = delete;
!     error_category&amp; operator=(const error_category&amp;) = delete;
!     virtual const char* name() const noexcept = 0;
!     virtual error_condition default_error_condition(int ev) const noexcept;
!     virtual bool equivalent(int code, const error_condition&amp; condition) const noexcept;
!     virtual bool equivalent(const error_code&amp; code, int condition) const noexcept;
!     virtual string message(int ev) const = 0;
!     bool operator==(const error_category&amp; rhs) const noexcept;
!     bool operator!=(const error_category&amp; rhs) const noexcept;
!     bool operator&lt;(const error_category&amp; rhs) const noexcept;
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Before 19.5.1.2 [syserr.errcat.virtuals] p1 insert a new prototype description as indicated:</p>
! 
! <blockquote><pre>
! <ins>virtual ~error_category();</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Effects</i>: Destroys an object of class <tt>error_category</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! 
! </li>
! 
! <li><p>Before 19.5.1.3 [syserr.errcat.nonvirtuals] p1 insert a new prototype description as indicated:</p>
! 
! <blockquote><pre>
! <ins>constexpr error_category() noexcept;</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Effects</i>: Constructs an object of class <tt>error_category</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2147"></a>2147. Unclear hint type in <tt>Allocator</tt>'s <tt>allocate</tt> function</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-03-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! According to Table 28 &mdash; "Allocator requirements", the expression
! </p>
! <blockquote><pre>
! a.allocate(n, u)
! </pre></blockquote>
! <p>
! expects as second argument a value <tt>u</tt> that is described in Table 27 as:
! </p>
! <blockquote><p>
! a value of type <tt>YY::const_pointer</tt> obtained by calling <tt>YY::allocate</tt>, or else <tt>nullptr</tt>.
! </p></blockquote>
! <p>
! This description leaves it open, whether or whether not a value of type <tt>YY::const_void_pointer</tt> is
! valid or not. The corresponding wording in C++03 is nearly the same, but in C++03 there did not exist the concept of
! a general <tt>void_pointer</tt> for allocators. There is some evidence for support of void pointers because
! the general <tt>allocator_traits</tt> template declares
! </p>
! <blockquote><pre>
! static pointer allocate(Alloc&amp; a, size_type n, const_void_pointer hint);
! </pre></blockquote>
! <p>
! and the corresponding function for <tt>std::allocator&lt;T&gt;</tt> is declared as: 
! </p>
! <blockquote><pre>
! pointer allocate(size_type, allocator&lt;void&gt;::const_pointer hint = 0);
! </pre></blockquote>
! <p>
! As an additional minor wording glitch (especially when comparing with the <tt>NullablePointer</tt> requirements imposed on
! <tt>const_pointer</tt> and <tt>const_void_pointer</tt>), the wording seems to exclude lvalues of type
! <tt>std::nullptr_t</tt>, which looks like an unwanted artifact to me.
! </p>
! 
! <p><i>[
! 2012-10 Portland: Move to Ready 
! ]</i></p>
! 
! 
! <p>
! No strong feeling that this is a big issue, but consensus that the proposed resolution is strictly
! better than the current wording, so move to Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change Table 27 &mdash; "Descriptive variable definitions" in 17.6.3.5 [allocator.requirements]:</p>
! 
! <table border="1">
! <caption>Table 27 &mdash; Descriptive variable definitions</caption>
! <tr>
! <th>Variable</th>
! <th>Definition</th>
! </tr> 
! 
! <tr>
! <td>
! <tt>u</tt>
! </td>
! <td>
! a value of type <del><tt>YY::const_pointer</tt> obtained by calling <tt>YY::allocate</tt>, or else 
! <tt>nullptr</tt></del><ins><tt>XX::const_void_pointer</tt> obtained by conversion from a result 
! value of <tt>YY::allocate</tt>, or else a value of type (possibly const) <tt>std::nullptr_t</tt></ins>.
! </td>
! </tr>
! 
! </table>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2148"></a>2148. Hashing enums should be supported directly by <tt>std::hash</tt></h3>
! <p><b>Section:</b> 20.9.13 [unord.hash] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Ville Voutilainen <b>Opened:</b> 2012-04-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.hash">active issues</a> in [unord.hash].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.hash">issues</a> in [unord.hash].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3333.html">paper</a> 
! proposes various hashing improvements. What it doesn't mention is hashing of
! enums; enums are integral types, and users expect them to have built-in hashing
! support, rather than having to convert enums to ints for uses with
! unordered containers and other uses of hashes. Daniel Kr&uuml;gler explains in c++std-lib-32412
! that this is not achievable with a SFINAEd hash specialization because it would require
! a partial specialization with a type parameter and a non-type parameter with a
! default argument, which is currently not allowed, and hence the fixes in N3333 should be
! adopted instead.
! </p>
! 
! <p><i>[2012-10 Portland: Move to Open]</i></p>
! 
! <p>
! We agree this is a real issue that should be resolved, by specifying such a hash.
! </p>
! 
! <p>
! It is not clear that we should specify this as calling hash on the <tt>underlying_type</tt>,
! or whether that is overspecification and we merely require that the hash be supplied.
! </p>
! 
! <p>
! STL already has shipped an implementation, and is keen to provide wording.
! </p>
! 
! <p><i>[
! 2013-04-14 STL provides rationale and improved wording
! ]</i></p>
! 
! 
! <p>Rationale:</p>
! <p>This can be achieved by inserting a very small tweak to the Standardese. We merely have to require that <tt>hash&lt;Key&gt;</tt> 
! be valid when <tt>Key</tt> is an "enumeration type" (which includes both scoped and unscoped enums). This permits, but does 
! not require, <tt>hash&lt;Enum&gt;</tt> to behave identically to <tt>hash&lt;underlying_type&lt;Enum&gt;::type&gt;</tt>, following 
! existing precedent &mdash; note that when <tt>unsigned int</tt> and <tt>unsigned long</tt> are the same size, 
! <tt>hash&lt;unsigned int&gt;</tt> is permitted-but-not-required to behave identically to <tt>hash&lt;unsigned long&gt;</tt>.
! <p/>
! This proposed resolution doesn't specify anything else about the primary template, allowing implementations to do 
! whatever they want for non-enums: <tt>static_assert</tt> nicely, explode horribly at compiletime or runtime, etc.
! <p/>
! While we're in the neighborhood, this proposed resolution contains an editorial fix. The 20.9 [function.objects]
! synopsis says "base template", which doesn't appear anywhere else in the Standard, and could confuse users into 
! thinking that they need to derive from it. The proper phrase is "primary template".
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3485.pdf">N3485</a>.</p>
! 
! <ol>
! <li><p>In 20.9 [function.objects], header functional synopsis, edit as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   <i>// 20.8.12, hash function <del>base</del><ins>primary</ins> template:</i>
!   template &lt;class T&gt; struct hash;
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li><p>In 20.9.13 [unord.hash]/1 edit as indicated:</p>
! 
! <blockquote><p>
! -1- The unordered associative containers defined in 23.5 [unord] use specializations of the class template 
! <tt>hash</tt> as the default <tt>hash</tt> function. For all object types <tt>Key</tt> for which there exists a 
! specialization <tt>hash&lt;Key&gt;</tt><ins>, and for all enumeration types (7.2 [dcl.enum]) Key</ins>, 
! the instantiation <tt>hash&lt;Key&gt;</tt> shall: [&hellip;]
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2149"></a>2149. Concerns about 20.8/5</h3>
! <p><b>Section:</b> 20.9 [function.objects] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Scott Meyers <b>Opened:</b> 2012-02-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#function.objects">issues</a> in [function.objects].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 20.9 [function.objects] p5 says:
! </p>
! <blockquote><p>
! To enable adaptors and other components to manipulate function objects that take one or two arguments
! it is required that the function objects correspondingly provide typedefs <tt>argument_type</tt> and 
! <tt>result_type</tt> for function objects that take one argument and <tt>first_argument_type</tt>, 
! <tt>second_argument_type</tt>, and <tt>result_type</tt> for function objects that take two arguments.
! </p></blockquote>
! <p>
! I have two concerns about this paragraph.  First, the wording appears to prescribe a requirement for all 
! function objects in valid C++ programs, but it seems unlikely that that is the intent.  As such, the scope 
! of the requirement is unclear.  For example, there is no mention of these typedefs in the specification for 
! closures (5.1.2), and Daniel Kr&uuml;gler has explained in the thread at 
! <a href="http://tinyurl.com/856plkn">http://tinyurl.com/856plkn</a> that conforming implementations can 
! detect the difference between closures with and without these typedefs.  (Neither gcc 4.6 nor VC10 appear 
! to define typedefs such as <tt>result_type</tt> for closure types. I have not tested other compilers.)
! <p/>
! Second, the requirement appears to be unimplementable in some cases, notably for function objects returned 
! from <tt>std::bind</tt>, as Howard Hinnant explains in the thread at <a href="http://tinyurl.com/6q5bos4">http://tinyurl.com/6q5bos4</a>.
! <p/>
! From what I can tell, the standard already defines which adaptability typedefs must be provided by various 
! kinds of function objects in the specifications for those objects.  Examples include the function objects 
! specified in 20.9.4 [refwrap]-20.9.9 [negators]. I therefore suggest that 
! 20.9 [function.objects]&#47;5 simply be removed from the standard. I don't think it adds anything 
! except opportunities for confusion.
! </p>
! 
! <p><i>[2012-10 Portland: Move to Open]</i></p>
! 
! <p>
! This wording caused confusion earlier in the week when reviewing Stefan's paper on <tt>greater&lt;></tt>.
! </p>
! 
! <p>
! This phrasing sounds normative, but is actually descriptive but uses unfortunate wording.
! </p>
! 
! <p>
! The main reason this wording exists is to document the protocol required to support the legacy binders
! in Annex D.
! </p>
! 
! <p>
! Stefan points out that <tt>unary_negate</tt> and <tt>binary_negate</tt> have not been deprecated and rely
! on this.  He plans a paper to remove this dependency.
! </p>
! 
! <p>
! Consensus that this wording is inadequate, confusing, and probably should be removed.  However, that
! leaves a big hole in the specification for the legacy binders, that needs filling.
! </p>
! 
! <p>
! While not opposed to striking this paragraph, we will need the additional wording to fix the openning
! hole before this issue can move forward.
! </p>
! 
! <p><i>[
! 2013-04-14 STL provides rationale
! ]</i></p>
! 
! 
! <p>Rationale:</p>
! 
! <p>I've concluded that Scott's original proposed resolution was correct and complete. There are two sides to this 
! story: the producers and the consumers of these typedefs.</p>
! 
! <p><em>Producers</em>: As Scott noted, the Standard clearly documents which function objects must provide these 
! typedefs. Some function objects must provide them unconditionally (e.g. <tt>plus&lt;T&gt;</tt> (for <tt>T != void</tt>), 
! 20.9.5 [arithmetic.operations]/1), some conditionally (e.g. <tt>reference_wrapper&lt;T&gt;</tt>, 
! 20.9.4 [refwrap]/2-4), and some don't have to provide them at all (e.g. lambdas, 5.1.2 [expr.prim.lambda]). 
! These requirements are clear, so we shouldn't change them or even add informative notes. Furthermore, because these 
! typedefs aren't needed in the C++11 world with <tt>decltype</tt>/perfect forwarding/etc., we shouldn't add more 
! requirements to provide them.</p>
! 
! <p><em>Consumers</em>: This is what we were concerned about at Portland. However, the consumers also clearly document 
! their requirements in the existing text. For example, <tt>reference_wrapper&lt;T&gt;</tt> is also a conditional consumer, 
! and 20.9.4 [refwrap] explains what typedefs it's looking for. We were especially concerned about the old negators 
! and the deprecated binders, but they're okay too. 20.9.9 [negators] clearly says that 
! <tt>unary_negate&lt;Predicate&gt;</tt> requires <tt>Predicate::argument_type</tt> to be a type, and 
! <tt>binary_negate&lt;Predicate&gt;</tt> requires <tt>Predicate::first_argument_type</tt> and <tt>Predicate::second_argument_type</tt> 
! to be types. (<tt>unary_negate</tt>/<tt>binary_negate</tt> provide <tt>result_type</tt> but they don't consume it.) 
! X [depr.lib.binders] behaves the same way with <tt>Fn::first_argument_type</tt>, <tt>Fn::second_argument_type</tt>, 
! and <tt>Fn::result_type</tt>. No additional wording is necessary.</p>
! 
! <p>A careful reading of 20.9 [function.objects]/5 reveals that it wasn't talking about anything beyond the mere 
! existence of the mentioned typedefs &mdash; for example, it didn't mention that the function object's return type should be 
! <tt>result_type</tt>, or even convertible to <tt>result_type</tt>. As the producers and consumers are certainly talking about 
! the existence of the typedefs (in addition to clearly implying semantic requirements), we lose nothing by deleting the 
! unnecessary paragraph.</p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! <p>Previous wording:</p>
! 
! <blockquote class="note"> 
! <p>Remove 20.9 [function.objects] p5:</p>
! 
! <blockquote><p><del>
! To enable adaptors and other components to manipulate function objects that take one or two arguments
! it is required that the function objects correspondingly provide typedefs <tt>argument_type</tt> and 
! <tt>result_type</tt> for function objects that take one argument and <tt>first_argument_type</tt>, 
! <tt>second_argument_type</tt>, and <tt>result_type</tt> for function objects that take two arguments.
! </del></p></blockquote>
! </blockquote>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3485.pdf">N3485</a>.</p>
! 
! <p>Edit 20.9 [function.objects] p5:</p>
! 
! <blockquote><p>
! <ins>[<i>Note:</i></ins>To enable adaptors and other components to manipulate function objects that take one or two arguments
! <del>it is required that the function objects</del><ins>many of the function objects in this clause</ins> correspondingly provide 
! typedefs <tt>argument_type</tt> and <tt>result_type</tt> for function objects that take one argument and <tt>first_argument_type</tt>, 
! <tt>second_argument_type</tt>, and <tt>result_type</tt> for function objects that take two arguments.<ins>&mdash; <i>end note</i>]</ins>
! </p></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2150"></a>2150. Unclear specification of <tt>find_end</tt></h3>
! <p><b>Section:</b> 25.2.6 [alg.find.end] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Andrew Koenig <b>Opened:</b> 2012-03-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 25.2.6 [alg.find.end] describes the behavior of find_end as returning:
! </p>
! <blockquote><p>
! The last iterator <tt>i</tt> in the range <tt>[first1,last1 - (last2 - first2))</tt> such that for any 
! nonnegative integer <tt>n &lt; (last2 - first2)</tt>, the following corresponding conditions hold: 
! <tt>*(i + n) == *(first2 + n), pred(*(i + n), *(first2 + n)) != false</tt>.
! </p></blockquote>
! <p>
! Does "for any" here mean "for every" or "there exists a"?  I think it means the former, but it could be 
! interpreted either way.
! <p/>
! Daniel: The same problem exists for the following specifications from Clause 25 [algorithms]:
! </p>
! <ol>
! <li>25.2.13 [alg.search] p2 and p6</li>
! <li>25.3.10 [alg.reverse] p4</li>
! <li>25.3.13 [alg.partitions] p5 and p9</li>
! <li>25.4 [alg.sorting] p5</li>
! <li>25.4.2 [alg.nth.element] p1</li>
! <li>25.4.3.1 [lower.bound] p2</li>
! <li>25.4.3.2 [upper.bound] p2</li>
! <li>25.4.7 [alg.min.max] p21 and p23</li>
! </ol>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! 
! <p>
! Unanimous agreement on the wording.
! <p/>
! Resolution: move to tentatively ready 
! </p>
! 
! <p><i>[2013-09-29, Chicago]</i></p>
! 
! 
! <p>
! Apply to Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li>
! <p>Change 25.2.6 [alg.find.end] p2 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class ForwardIterator1, class ForwardIterator2&gt;
! ForwardIterator1 
! find_end(ForwardIterator1 first1, ForwardIterator1 last1,
!          ForwardIterator2 first2, ForwardIterator2 last2);
! template&lt;class ForwardIterator1, class ForwardIterator2,
!          class BinaryPredicate&gt;
! ForwardIterator1
! find_end(ForwardIterator1 first1, ForwardIterator1 last1,
!          ForwardIterator2 first2, ForwardIterator2 last2,
!          BinaryPredicate pred);
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -2- <i>Returns</i>: The last iterator <tt>i</tt> in the range <tt>[first1,last1 - (last2 - first2))</tt> such 
! that for <del>any</del><ins>every</ins> nonnegative integer <tt>n &lt; (last2 - first2)</tt>, the following 
! corresponding conditions hold: <tt>*(i + n) == *(first2 + n), pred(*(i + n), *(first2 + n)) != false</tt>.
! Returns <tt>last1</tt> if <tt>[first2,last2)</tt> is empty or if no such iterator is found.
! </p></blockquote></blockquote>
! </li>
! 
! <li>
! <p>Change 25.2.13 [alg.search] p2 and p6 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class ForwardIterator1, class ForwardIterator2&gt;
! ForwardIterator1
! search(ForwardIterator1 first1, ForwardIterator1 last1,
!        ForwardIterator2 first2, ForwardIterator2 last2);
! template&lt;class ForwardIterator1, class ForwardIterator2,
!          class BinaryPredicate&gt;
! ForwardIterator1
! search(ForwardIterator1 first1, ForwardIterator1 last1,
!        ForwardIterator2 first2, ForwardIterator2 last2,
!        BinaryPredicate pred);
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -2- <i>Returns</i>: The first iterator <tt>i</tt> in the range <tt>[first1,last1 - (last2-first2))</tt> 
! such that for <del>any</del><ins>every</ins> nonnegative integer <tt>n</tt> less than <tt>last2 - first2</tt> 
! the following corresponding conditions hold: <tt>*(i + n) == *(first2 + n), pred(*(i + n), *(first2 + n)) != false</tt>. 
! Returns <tt>first1</tt> if <tt>[first2,last2)</tt> is empty, otherwise returns <tt>last1</tt> if no such iterator 
! is found.
! </p></blockquote></blockquote>
! <p>
! [&hellip;]
! </p>
! <blockquote><pre>
! template&lt;class ForwardIterator, class Size, class T&gt;
! ForwardIterator
! search_n(ForwardIterator first, ForwardIterator last, Size count,
!          const T&amp; value);
! template&lt;class ForwardIterator, class Size, class T,
!          class BinaryPredicate&gt;
! ForwardIterator
! search_n(ForwardIterator first, ForwardIterator last, Size count,
!          const T&amp; value, BinaryPredicate pred);
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -6- <i>Returns</i>: The first iterator <tt>i</tt> in the range <tt>[first,last-count)</tt> such that 
! for <del>any</del><ins>every</ins> non-negative integer <tt>n</tt> less than <tt>count</tt> the following 
! corresponding conditions hold: <tt>*(i + n) == value, pred(*(i + n),value) != false</tt>. Returns <tt>last</tt> 
! if no such iterator is found.
! </p></blockquote></blockquote>
! </li>
! 
! <li>
! <p>Change 25.3.10 [alg.reverse] p4 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class BidirectionalIterator, class OutputIterator&gt;
! OutputIterator
! reverse_copy(BidirectionalIterator first,
!              BidirectionalIterator last, OutputIterator result);
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -4- <i>Effects</i>: Copies the range <tt>[first,last)</tt> to the range <tt>[result,result+(last-first))</tt> 
! such that for <del>any</del><ins>every</ins> non-negative integer <tt>i &lt; (last - first)</tt> the following 
! assignment takes place: <tt>*(result + (last - first) - i) = *(first + i)</tt>.
! </p></blockquote></blockquote>
! </li>
! 
! <li>
! <p>Change 25.3.13 [alg.partitions] p5 and p9 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class ForwardIterator, class Predicate&gt;
! ForwardIterator
! partition(ForwardIterator first,
!           ForwardIterator last, Predicate pred);
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -5- <i>Returns</i>: An iterator <tt>i</tt> such that for <del>any</del><ins>every</ins> iterator <tt>j</tt> 
! in the range <tt>[first,i) pred(*j) != false</tt>, and for <del>any</del><ins>every</ins> iterator <tt>k</tt> 
! in the range <tt>[i,last), pred(*k) == false</tt>.
! </p></blockquote></blockquote>
! <p>
! [&hellip;]
! </p>
! <blockquote><pre>
! template&lt;class BidirectionalIterator, class Predicate&gt;
! BidirectionalIterator
! stable_partition(BidirectionalIterator first,
!                  BidirectionalIterator last, Predicate pred);
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -9- <i>Returns</i>: An iterator <tt>i</tt> such that for <del>any</del><ins>every</ins> iterator <tt>j</tt> 
! in the range <tt>[first,i), pred(*j) != false</tt>, and for <del>any</del><ins>every</ins> iterator <tt>k</tt> 
! in the range <tt>[i,last), pred(*k) == false</tt>. The relative order of the elements in both groups is preserved.
! </p></blockquote></blockquote>
! </li>
! 
! <li>
! <p>Change 25.4 [alg.sorting] p5 as indicated:</p>
! 
! <blockquote><p>
! -5- A sequence is sorted with respect to a comparator <tt>comp</tt> if for <del>any</del><ins>every</ins> iterator 
! <tt>i</tt> pointing to the sequence and <del>any</del><ins>every</ins> non-negative integer <tt>n</tt> such that 
! <tt>i + n</tt> is a valid iterator pointing to an element of the sequence, <tt>comp(*(i + n), *i) == false</tt>.
! </p></blockquote>
! </li>
! 
! <li>
! <p>Change 25.4.2 [alg.nth.element] p1 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class RandomAccessIterator&gt;
! void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
!                  RandomAccessIterator last);
! template&lt;class RandomAccessIterator, class Compare&gt;
! void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
!                  RandomAccessIterator last, Compare comp);
! </pre><blockquote><p>
! -1- After <tt>nth_element</tt> the element in the position pointed to by <tt>nth</tt> is the element that would 
! be in that position if the whole range were sorted. Also for <del>any</del><ins>every</ins> iterator <tt>i</tt> 
! in the range <tt>[first,nth)</tt> and <del>any</del><ins>every</ins> iterator <tt>j</tt> in the range 
! <tt>[nth,last)</tt> it holds that: <tt>!(*i &gt; *j)</tt> or <tt>comp(*j, *i) == false</tt>. 
! </p></blockquote></blockquote>
! </li>
! 
! <li>
! <p>Change 25.4.3.1 [lower.bound] p2 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;lass ForwardIterator, class T&gt;
! ForwardIterator
! lower_bound(ForwardIterator first, ForwardIterator last,
!             const T&amp; value);
! template&lt;class ForwardIterator, class T, class Compare&gt;
! ForwardIterator
! lower_bound(ForwardIterator first, ForwardIterator last,
!             const T&amp; value, Compare comp);
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -2- <i>Returns</i>: The furthermost iterator <tt>i</tt> in the range <tt>[first,last]</tt> such that for 
! <del>any</del><ins>every</ins> iterator <tt>j</tt> in the range <tt>[first,i)</tt> the following corresponding 
! conditions hold: <tt>*j &lt; value</tt> or <tt>comp(*j, value) != false</tt>.
! </p></blockquote></blockquote>
! </li>
! 
! <li>
! <p>Change 25.4.3.2 [upper.bound] p2 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;lass ForwardIterator, class T&gt;
! ForwardIterator
! upper_bound(ForwardIterator first, ForwardIterator last,
!             const T&amp; value);
! template&lt;class ForwardIterator, class T, class Compare&gt;
! ForwardIterator
! upper_bound(ForwardIterator first, ForwardIterator last,
!             const T&amp; value, Compare comp);
! </pre><blockquote><p>
! [&hellip;]
! <p/>
! -2- <i>Returns</i>: The furthermost iterator <tt>i</tt> in the range <tt>[first,last]</tt> such that for 
! <del>any</del><ins>every</ins> iterator <tt>j</tt> in the range <tt>[first,i)</tt> the following corresponding 
! conditions hold: <tt>!(value &lt; *j)</tt> or <tt>comp(value, *j) == false</tt>.
! </p></blockquote></blockquote>
! </li>
! 
! <li>
! <p>Change 25.4.7 [alg.min.max] p21 and p23 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class ForwardIterator&gt;
! ForwardIterator min_element(ForwardIterator first, ForwardIterator last);
! template&lt;class ForwardIterator, class Compare&gt;
! ForwardIterator min_element(ForwardIterator first, ForwardIterator last,
!                             Compare comp);
! </pre><blockquote><p>
! -21- <i>Returns</i>: The first iterator <tt>i</tt> in the range <tt>[first,last)</tt> such that for 
! <del>any</del><ins>every</ins> iterator <tt>j</tt> in the range <tt>[first,last)</tt> the following 
! corresponding conditions hold: <tt>!(*j &lt; *i)</tt> or <tt>comp(*j, *i) == false</tt>. Returns 
! <tt>last</tt> if <tt>first == last</tt>.
! </p></blockquote></blockquote>
! <p>
! [&hellip;]
! </p>
! <blockquote><pre>
! template&lt;class ForwardIterator&gt;
! ForwardIterator max_element(ForwardIterator first, ForwardIterator last);
! template&lt;class ForwardIterator, class Compare&gt;
! ForwardIterator max_element(ForwardIterator first, ForwardIterator last,
!                             Compare comp);
! </pre><blockquote><p>
! -23- <i>Returns</i>: The first iterator <tt>i</tt> in the range <tt>[first,last)</tt> such that for 
! <del>any</del><ins>every</ins> iterator <tt>j</tt> in the range <tt>[first,last)</tt> the following 
! corresponding conditions hold: <tt>!(*i &lt; *j)</tt> or <tt>comp(*i, *j) == false</tt>. Returns 
! <tt>last</tt> if <tt>first == last</tt>.
! </p></blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2159"></a>2159. <tt>atomic_flag</tt> initialization</h3>
! <p><b>Section:</b> 29.7 [atomics.flag] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Alberto Ganesh Barbati <b>Opened:</b> 2012-05-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#atomics.flag">issues</a> in [atomics.flag].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 29.7 [atomics.flag]&#47;4 describes the <tt>ATOMIC_FLAG_INIT</tt>, but it's not quite clear about a 
! couple of points:
! </p>
! <ol>
! <li><p>
! it's said that <tt>ATOMIC_FLAG_INIT</tt> "can be used to initialize an object of type <tt>atomic_flag</tt>" 
! and the following example:
! </p>
! <blockquote><pre>
! std::atomic_flag guard = ATOMIC_FLAG_INIT;
! </pre></blockquote>
! <p>
! is presented. It's not clear whether the macro can also be used in the other initialization contexts:
! </p>
! <blockquote><pre>
! std::atomic_flag guard ATOMIC_FLAG_INIT; 
! std::atomic_flag guard {ATOMIC_FLAG_INIT};
! 
! struct A { std::atomic_flag flag; A(); };
! A::A() : flag (ATOMIC_FLAG_INIT); 
! A::A() : flag {ATOMIC_FLAG_INIT};
! </pre></blockquote>
! <p>
! Please also note that examples are non-normative, according to the ISO directives, meaning that the wording 
! presents no normative way to use the macro.
! </p>
! </li>
! 
! <li><p>
! it's said that "It is unspecified whether an uninitialized <tt>atomic_flag</tt> object has an initial state 
! of set or clear.". I believe the use of "uninitialized" is inappropriate. First of all, if an object is 
! uninitialized it is obvious that we cannot assert anything about its state. Secondly, it doesn't address the 
! following cases:
! </p>
! <blockquote><pre>
! std::atomic_flag a; <i>// object is "initialized" by trivial default constructor</i>
! std::atomic_flag a {}; <i>// object is value-initialized</i>
! static std::atomic_flag a; <i>// object is zero-initialized</i>
! </pre></blockquote>
! <p>
! strictly speaking a trivial constructor "initializes" the object, although it doesn't actually initialize the 
! sub-objects.
! </p></li>
! 
! <li><p>it's said that "For a static-duration object, that initialization shall be static.". Considering 
! the following example:</p>
! <blockquote><pre>
! struct A
! {
!   A(); <i>// user-provided, not constexpr</i>
! 
!   std::atomic_flag flag = ATOMIC_FLAG_INIT;
!   <i>// possibly other non-static data members</i>
! };
! 
! static A a;
! </pre></blockquote>
! <p>
! The object <tt>a.flag</tt> (as a sub-object of the object <tt>a</tt>) has static-duration, yet the initialization 
! has to be dynamic because <tt>A::A</tt> is not <tt>constexpr</tt>.
! </p>
! 
! </li>
! </ol>
! 
! <p><i>[2012, Portland]</i></p>
! 
! <p>
! We would like to be able to allow more initialisation contexts for example:
! </p>
! <ol>
! <li>C struct</li>
! <li>C++ constructor initializer-list</li>
! </ol>
! <p>
! However we need further input from experts with implementation specific knowledge
! to identify which additional contexts (if any) would be universally valid.
! </p>
! <p>
! Moved to open
! </p>
! 
! <p><i>[2013, Chicago]</i></p>
! 
! <p>
! Move to Immediate, following review.
! </p>
! <p>
! Some discussion over the explicit use of only copy initialization, and not direct initialization.  This is necessary to
! allow the implementation of <tt>atomic_flag</tt> as an aggregate, and may be further reviewed in the future.
! </p>
! <p>
! Accept for Working Paper
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p><i>[This wording is relative to N3376.]</i></p>
! 
! 
! <p>Change 29.7 [atomics.flag]&#47;4 as follows:</p>
! 
! <blockquote><p>
! The macro <tt>ATOMIC_FLAG_INIT</tt> shall be defined in such a way that it can be used to initialize an object of
! type <tt>atomic_flag</tt> to the clear state.  <ins>The macro can be used in the form:</ins>
! </p>
! <blockquote><pre>
! <ins>atomic_flag guard = ATOMIC_FLAG_INIT;</ins>
! </pre></blockquote>
! <p>
! <ins>It is unspecified whether the macro can be used in other initialization contexts.</ins> For a <ins>complete</ins>
! static-duration object, that initialization shall be static. <del>It is unspecified whether an uninitialized</del> 
! <ins>Unless initialized with <tt>ATOMIC_FLAG_INIT</tt>, it is unspecified whether an</ins> <tt>atomic_flag</tt> 
! object has an initial state of set or clear. <del><i>[ Example:</i></del>
! </p>
! <blockquote><pre>
! <del>atomic_flag guard = ATOMIC_FLAG_INIT;</del>
! </pre></blockquote>
! <p>
! <del>&mdash; <i>end example ]</i></del>
! </p>
! </blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2160"></a>2160. Unintended destruction ordering-specification of <tt>resize</tt></h3>
! <p><b>Section:</b> 23.3.6.3 [vector.capacity] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-06-07 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! As part of resolving LWG issue <a href="lwg-defects.html#2033">2033</a> a wording change was done for <tt>resize()</tt> to 
! respect the problem mentioned in the question:
! </p>
! <blockquote><p>
! Does a call to 'void resize(size_type sz)' of <tt>std::vector</tt> require the element type to be 
! <tt>MoveAssignable</tt> because the call <tt>erase(begin() + sz, end())</tt> mentioned in the Effects 
! paragraph would require the element type to be <tt>MoveAssignable</tt>?
! </p></blockquote>
! <p>
! The wording change was to replace in 23.3.3.3 [deque.capacity] and 23.3.6.3 [vector.capacity]:
! </p>
! <blockquote><p>
! -1- <i>Effects</i>: If <tt>sz &lt;= size()</tt>, equivalent to <tt>erase(begin() + sz, end())</tt>; [&hellip;]
! </p></blockquote>
! <p>
! by:
! </p>
! <blockquote><p>
! -1- <i>Effects</i>: If <tt>sz &lt;= size()</tt>, equivalent to calling <tt>pop_back() size() - sz</tt> times. [&hellip;]
! </p></blockquote>
! <p>
! The overlooked side-effect of this wording change is that this implies a destruction order
! of the removed elements to be in reverse order of construction, but the previous version
! did not impose any specific destruction order due to the way how the semantics of <tt>erase</tt>
! is specified in Table 100.
! <p/>
! Given the program:
! </p>
! <blockquote><pre>
! #include &lt;vector&gt;
! #include &lt;iostream&gt;
! 
! struct Probe {
!   int value;
!   Probe() : value(0) {}
!   Probe(int value) : value(value) {}
!   ~Probe() { std::cout &lt;&lt; "~Probe() of " &lt;&lt; value &lt;&lt; std::endl; }
! };
! 
! int main() {
!   std::vector&lt;Probe&gt; v;
!   v.push_back(Probe(1));
!   v.push_back(Probe(2));
!   v.push_back(Probe(3));
!   std::cout &lt;&lt; "---" &lt;&lt; std::endl;
!   <span style="color:#C80000;font-weight:bold">v.resize(0)</span>;
! }
! </pre></blockquote>
! <p>
! the last three lines of the output for every compiler I tested was:
! </p>
! <blockquote><pre>
! ~Probe() of 1
! ~Probe() of 2
! ~Probe() of 3
! </pre></blockquote>
! <p>
! but a conforming implementation would now need to change this order to
! </p>
! <blockquote><pre>
! ~Probe() of 3
! ~Probe() of 2
! ~Probe() of 1
! </pre></blockquote>
! <p>
! This possible stringent interpretation makes sense, because one can argue that sequence containers 
! (or at least <tt>std::vector</tt>) should have the same required destruction order of it's elements,
! as elements of a C array or controlled by memory deallocated with an array <tt>delete</tt> have.
! I also learned that libc++ does indeed implement <tt>std::vector::resize</tt> in a way that the
! second output form is observed.
! <p/>
! While I agree that required reverse-destruction would better mimic the natural behaviour of
! <tt>std::vector</tt> this was not required in C++03 and this request may be too strong. My current 
! suggestion would be to restore the effects of the previous wording <em>in regard to the destruction order</em>, 
! because otherwise several currently existing implementations would be broken just because of this
! additional requirement.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
! </p>
! <p>
! Jonathan says that he believes this is a valid issue.
! </p>
! <p>
! Walter wonders if this was intended when we made the previous change - if so, this would be NAD.
! </p>
! <p>
! Jonathan said that Issue <a href="lwg-defects.html#2033">2033</a> doesn't mention ordering.
! </p>
! <p>
! Walter then asked if anyone is really unhappy that we're destroying items in reverse order of construction.
! </p>
! <p>
! Jonathan points out that this conflicts with existing practice (libstc++, but not libc++).
! </p>
! <p>
! Jonathan asked for clarification as to whether this change was intended by <a href="lwg-defects.html#2033">2033</a>.
! </p>
! 
! <p><i>[2014-06 Rapperswil]</i></p>
! 
! <p>
! Daniel points out that the ordering change was not intended.
! <p/>
! General agreement that implementations should not be required to change.
! </p>
! 
! <p><i>[2014-06-28 Daniel provides alternative wording]</i></p>
! 
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p> 
! 
! <ol>
! <li><p>Change 23.3.3.3 [deque.capacity] as indicated: [<i>Drafting note</i>: The chosen wording form is similar to that for
! <tt>forward_list</tt>. Note that the existing <i>Requires</i> element already specifies the necessary operational requirements 
! on the value type. &mdash; <i>end drafting note</i>]</p>
! 
! <blockquote>
! <pre>
! void resize(size_type sz);
! </pre>
! <blockquote>
! <p>
! -1- <i>Effects</i>: If <tt>sz &lt;<del>=</del> size()</tt>, <ins>erases the last <tt>size() - sz</tt> elements from the 
! sequence</ins><del>equivalent to calling <tt>pop_back() size() - sz</tt> times</del>. <ins>Otherwise</ins><del>If <tt>size() 
! &lt;= sz</tt></del>, appends <tt>sz - size()</tt> default-inserted elements to the sequence.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! void resize(size_type sz, const T&amp; c);
! </pre>
! <blockquote>
! <p>
! -3- <i>Effects</i>: If <tt>sz &lt;<del>=</del> size()</tt>, <ins>erases the last <tt>size() - sz</tt> elements from the 
! sequence</ins><del>equivalent to calling <tt>pop_back() size() - sz</tt> times</del>. <ins>Otherwise</ins><del>If <tt>size() 
! &lt; sz</tt></del>, appends <tt>sz - size()</tt> copies of <tt>c</tt> to the sequence.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 23.3.6.3 [vector.capacity] as indicated: [<i>Drafting note</i>: See <tt>deque</tt> for the rationale of the
! used wording. &mdash; <i>end drafting note</i>]</p>
! 
! <blockquote>
! <pre>
! void resize(size_type sz);
! </pre>
! <blockquote>
! <p>
! -12- <i>Effects</i>: If <tt>sz &lt;<del>=</del> size()</tt>, <ins>erases the last <tt>size() - sz</tt> elements from the 
! sequence</ins><del>equivalent to calling <tt>pop_back() size() - sz</tt> times</del>. <ins>Otherwise</ins><del>If <tt>size() 
! &lt; sz</tt></del>, appends <tt>sz - size()</tt> default-inserted elements to the sequence.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! void resize(size_type sz, const T&amp; c);
! </pre>
! <blockquote>
! <p>
! -15- <i>Effects</i>: If <tt>sz &lt;<del>=</del> size()</tt>, <ins>erases the last <tt>size() - sz</tt> elements from the 
! sequence</ins><del>equivalent to calling <tt>pop_back() size() - sz</tt> times</del>. <ins>Otherwise</ins><del>If <tt>size() 
! &lt; sz</tt></del>, appends <tt>sz - size()</tt> copies of <tt>c</tt> to the sequence.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2162"></a>2162. <tt>allocator_traits::max_size</tt> missing <tt>noexcept</tt></h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements], 20.7.8.2 [allocator.traits.members], 20.7.8 [allocator.traits] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Bo Persson <b>Opened:</b> 2012-07-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! N3376 describes in 20.7.8.2 [allocator.traits.members]/7
! </p>
! <blockquote><pre>
! static size_type max_size(Alloc&amp; a);
! </pre>
! <p>
! <i>Returns</i>: <tt>a.max_size()</tt> if that expression is well-formed; otherwise, <tt>numeric_limits&lt;size_type&gt;::max()</tt>.
! </p>
! </blockquote>
! <p>
! The <tt>max_size</tt> function is supposed to call one of two functions that are both <tt>noexcept</tt>. 
! To make this intermediate function useful for containers, it should preserve the <tt>noexcept</tt> attribute.
! <p/>
! Proposed changes:
! <p/>
! In 20.7.8 [allocator.traits] and 20.7.8.2 [allocator.traits.members]/7, change the function signature to
! </p>
! <blockquote><pre>
! static size_type max_size(Alloc&amp; a) noexcept;
! </pre></blockquote>
! 
! <p><i>[2012-08-05 Daniel comments]</i></p>
! 
! <p>
! On the first sight this does not seem like a defect of the specification, because the Allocator requirements in 
! 17.6.3.5 [allocator.requirements] (Table 28) do not impose a no-throw requirement onto <tt>max_size()</tt>; 
! the table just describes the fall-back implementation for <tt>max_size()</tt> if a given allocator does 
! not provide such a function.
! <p/>
! <tt>std::allocator</tt> as a special model of this concept and is allowed to increase the exception-guarantees 
! for <tt>max_size()</tt>, but this does not imply a corresponding rules for other allocators.
! <p/>
! Furthermore, <tt>max_size()</tt> of Containers is <em>not</em> specified in terms of 
! <tt>Allocator::max_size()</tt>, so again this is not a real contradiction.
! <p/>
! Nonetheless I think that the following stronger decision should be considered:
! </p>
! <ol>
! <li><p>
! Require that for all Allocators (as specified in 17.6.3.5 [allocator.requirements]) <tt>max_size()</tt> 
! never throws an exception. This would it make much more useful to call this function in situations where no 
! exception should leave the context.
! </p></li>
! <li><p>
! Require that for all Allocators (as specified in 17.6.3.5 [allocator.requirements]) <tt>max_size()</tt>
! can be called on const allocator object. Together with the previous item this would allow an implementation 
! of a container's <tt>max_size()</tt> function to delegate to the allocator's <tt>max_size()</tt> function.
! </p></li>
! </ol>
! <p>
! In regard to the second statement it should be mentioned that there are two current specification
! deviations from that in the draft:
! </p>
! <ol>
! <li><p>
! The synopsis of 20.7.8 [allocator.traits] uses a const allocator argument as part of the signature
! of the <tt>max_size</tt> function.
! </p></li>
! 
! <li><p>
! Both the synopsis of 20.13.1 [allocator.adaptor.syn] and the member specification in
! 20.13.4 [allocator.adaptor.members] p8 declare <tt>scoped_allocator_adaptor::max_size</tt>
! as const member function, but this function delegates to 
! </p>
! <blockquote><pre>
! allocator_traits&lt;OuterAlloc&gt;::max_size(outer_allocator())
! </pre></blockquote>
! <p>
! where <tt>outer_allocator()</tt> resolves to the member function overload returning a
! <tt>const outer_allocator_type&amp;</tt>.
! </p>
! </li>
! </ol>
! 
! <p>
! The question arises whether these current defects actually point to a defect in the Allocator
! requirements and should be fixed there.
! </p>
! 
! <p><i>[
! 2012-10 Portland: Move to Review 
! ]</i></p>
! 
! 
! <p>
! Consensus that the change seems reasonable, and that for any given type the template is intantiated
! with the contract should be 'wide' so this meets the guidelines we agreed in Madrid for C++11.
! </p>
! 
! <p>
! Some mild concern that while we don't imagine many allocator implementations throwing on this method,
! it is technically permited by current code that we would not be breaking, by turning <tt>throw</tt>
! expressions into disguised <tt>terminate</tt> calls.  In this case, an example might be an
! instrumented 'logging' allocator that writes every function call to a log file or database, and might
! throw if that connection/file were no longer available.
! </p>
! 
! <p>
! Another option would be to make exception spefication a conditional no-except, much like we do for
! some <tt>swap</tt> functions and assignment operators.  However, this goes against the intent of the
! Madrid adoption of <tt>noexcept</tt> which is that vendors are free to add such extensions, but we
! look for a clear line in the library specification, and do not want to introduce conditional-noexcept
! piecemeal.  A change in our conventions here would require a paper addressing the library specification
! as a whole.
! </p>
! 
! <p>
! Consensus was to move forward, but move the issue only to Review rather than Ready to allow time
! for further comments.  This issue should be considered 'Ready' next time it is reviewed unless
! we get such comments in the meantime.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! In 20.7.8 [allocator.traits] and 20.7.8.2 [allocator.traits.members]/7, change the function signature to
! </p>
! <blockquote><pre>
! static size_type max_size(Alloc&amp; a) <ins>noexcept</ins>;
! </pre></blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2163"></a>2163. <tt>nth_element</tt> requires inconsistent post-conditions</h3>
! <p><b>Section:</b> 25.4.2 [alg.nth.element] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Peter Sommerlad <b>Opened:</b> 2012-07-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.nth.element">issues</a> in [alg.nth.element].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The specification of nth_element refers to <tt>operator&lt;</tt> whereas all sorting without a compare function is based on 
! <tt>operator&lt;</tt>. While it is true that for all regular types both operators should be defined accordingly, all other 
! sorting algorithms only rely on existence of <tt>operator&lt;</tt>. So I guess the paragraph p1
! </p>
! <blockquote><p>
! After <tt>nth_element</tt> the element in the position pointed to by <tt>nth</tt> is the element that would be in that
! position if the whole range were sorted. Also for any iterator <tt>i</tt> in the range <tt>[first,nth)</tt> and any
! iterator <tt>j</tt> in the range <tt>[nth,last)</tt> it holds that: <tt>!(*i &gt; *j)</tt> or <tt>comp(*j, *i) == false</tt>.
! </p></blockquote>
! <p>
! should read
! </p>
! <blockquote><p>
! After <tt>nth_element</tt> the element in the position pointed to by <tt>nth</tt> is the element that would be in that
! position if the whole range were sorted. Also for any iterator <tt>i</tt> in the range <tt>[first,nth)</tt> and any
! iterator <tt>j</tt> in the range <tt>[nth,last)</tt> it holds that: <tt>!(*j &lt; *i)</tt> or <tt>comp(*j, *i) == false</tt>.
! </p></blockquote>
! <p>
! Note only "<tt>!(*i &gt; *j)</tt>" was changed to "<tt>!(*j &lt; *i)</tt>" and it would be more symmetric with 
! <tt>comp(*j, *i)</tt> as well.
! <p/>
! In theory this might be a semantic change to the spec, but I believe the mistake is unintended.
! </p>
! 
! <p><i>[
! 2012-10 Portland: Move to Ready 
! ]</i></p>
! 
! 
! <p>
! This is clearly correct by inspection, moved to Ready by unanimous consent.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change 25.4.2 [alg.nth.element] p1 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class RandomAccessIterator&gt;
! void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
!                  RandomAccessIterator last);
! template&lt;class RandomAccessIterator, class Compare&gt;
! void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
!                  RandomAccessIterator last, Compare comp);
! </pre><blockquote>
! <p>
! -1- After <tt>nth_element</tt> the element in the position pointed to by <tt>nth</tt> is the element that would be in that
! position if the whole range were sorted. Also for any iterator <tt>i</tt> in the range <tt>[first,nth)</tt> and any
! iterator <tt>j</tt> in the range <tt>[nth,last)</tt> it holds that: <tt><del>!(*i &gt; *j)</del><ins>!(*j &lt; *i)</ins></tt> 
! or <tt>comp(*j, *i) == false</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2168"></a>2168. Inconsistent specification of <tt>uniform_real_distribution</tt> constructor</h3>
! <p><b>Section:</b> 26.5.8.2.2 [rand.dist.uni.real] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Marshall Clow <b>Opened:</b> 2012-07-14 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! uniform_real says in 26.5.8.2.2 [rand.dist.uni.real] p1:
! </p>
! <blockquote><p>
! A <tt>uniform_real_distribution</tt> random number distribution produces random numbers <tt>x</tt>, <tt>a &le; x &lt; b</tt>,
! </p></blockquote>
! <p>
! but also that (26.5.8.2.2 [rand.dist.uni.real] p2):
! </p>
! <blockquote><pre>
! explicit uniform_real_distribution(RealType a = 0.0, RealType b = 1.0);
! </pre><blockquote><p>
! -2- <i>Requires</i>: <tt>a &le; b</tt> and <tt>b - a &le; numeric_limits&lt;RealType&gt;::max()</tt>.
! </p>
! </blockquote></blockquote>
! <p>
! If you construct a <tt>uniform_real_distribution&lt;RealType&gt;(a, b)</tt> where there are no representable 
! numbers between 'a' and 'b' (using <tt>RealType</tt>'s representation) then you cannot satisfy 
! 26.5.8.2.2 [rand.dist.uni.real].
! <p/>
! An obvious example is when <tt>a == b</tt>.
! </p>
! 
! <p><i>[2014-11-04 Urbana]</i></p>
! 
! <p>
! Jonathan provides wording.
! </p>
! 
! <p><i>[2014-11-08 Urbana]</i></p>
! 
! <p>
! Moved to Ready with the note.
! </p>
! <p>
! There remains concern that the constructors are permitting
! values that may (or may not) be strictly outside the domain
! of the function, but that is a concern that affects the
! design of the random number facility as a whole, and should
! be addressed by a paper reviewing and addressing the whole
! clause, not picked up in the issues list one distribution
! at a time.  It is still not clear that such a paper would be
! uncontroversial.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N4140.
! </p>
! 
! <ol>
! <li><p>Add a note after paragraph 1 before the synopsis in 26.5.8.2.2 [rand.dist.uni.real]:</p>
! 
! <blockquote><p>
! -1- A <tt>uniform_real_distribution</tt> random number distribution produces random numbers 
! <math xmlns="http://www.w3.org/1998/Math/MathML">
! <mi>x</mi>
! </math>,
! <math xmlns="http://www.w3.org/1998/Math/MathML">
! <mi>a</mi><mo>&le;</mo><mi>x</mi><mo>&lt;</mo><mi>b</mi>
! </math>,
! distributed according to the constant probability density function
! </p>
! <blockquote>
! <p>
! <math xmlns="http://www.w3.org/1998/Math/MathML">
! <mi>p</mi><mrow><mo>(</mo><mi>x</mi><mo>|</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>)</mo></mrow>
! <mo>=</mo>
! <mrow>
! <mn>1</mn><mo>&#x2215;</mo><mo>(</mo><mi>b</mi><mo>-</mo><mi>a</mi><mo>)</mo>
! </mrow>
! </math>
! .
! </p>
! </blockquote>
! <p>
! <ins>[<i>Note</i>: This implies that <math xmlns="http://www.w3.org/1998/Math/MathML">
! <mi>p</mi><mrow><mo>(</mo><mi>x</mi><mo>|</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>)</mo></mrow> 
! </math> is undefined when <tt>a == b</tt>. &mdash; <i>end note</i>]</ins>
! </p></blockquote>
! <blockquote class="note">
! <p>
! <i>Drafting note</i>: <math xmlns="http://www.w3.org/1998/Math/MathML">
! <mi>p</mi><mrow><mo>(</mo><mi>x</mi><mo>|</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>)</mo></mrow> 
! </math> should be in math font, and <tt>a == b</tt> should be in code font.
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2169"></a>2169. Missing <tt>reset()</tt> requirements in <tt>unique_ptr</tt> specialization</h3>
! <p><b>Section:</b> 20.8.1.3.4 [unique.ptr.runtime.modifiers] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Geoffrey Romer <b>Opened:</b> 2012-07-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.runtime.modifiers">issues</a> in [unique.ptr.runtime.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! In 20.8.1.3.4 [unique.ptr.runtime.modifiers]/p1-2 of N3376, the description of <tt>reset()</tt> in the 
! array specialization of <tt>unique_ptr</tt> partially duplicates the description of the base template method 
! (as specified in 20.8.1.2.5 [unique.ptr.single.modifiers]/p3-5), but lacks some significant requirements. 
! Specifically, the text introduced in LWG <a href="lwg-defects.html#998">998</a>, and item 13 of LWG <a href="lwg-defects.html#762">762</a>, is present 
! only in the base template, not the specialization.
! <p/>
! This gives the appearance that these requirements specifically do not apply to the specialization, which I 
! don't believe is correct or intended: the issue of <tt>reset()</tt> operation order addressed by LWG <a href="lwg-defects.html#998">998</a> 
! applies just as much to the derived template as to the base template, and the derived template has just as 
! much need to rely on <tt>get_deleter()(get())</tt> being well-defined, well-formed, and not throwing exceptions 
! (arguably some of those properties follow from the fact that <tt>T</tt> is required to be a complete type, but 
! not all).
! <p/>
! Assuming the derived template's <tt>reset()</tt> semantics are intended to be identical to the base template's, 
! there is no need to explicitly specify the semantics of <tt>reset(pointer p)</tt> at all (since 
! 20.8.1.3 [unique.ptr.runtime]/3 specifies "Descriptions are provided below only for member functions that 
! have behavior different from the primary template."), and <tt>reset(nullptr_t p)</tt> can be specified by 
! reference to the 'pointer' overload. This is more concise, and eliminates any ambiguity about intentional vs. 
! accidental discrepancies.
! </p>
! 
! <p><i>[2012-10 Portland: Move to Ready]</i></p>
! 
! <p>
! <del>This resolution looks blatantly wrong, as it seems to do nothing but defer to primary template
! where we should describe the contract here.</del>
! </p>
! 
! <p>
! Ongoing discussion points out that the primary template has a far more carefully worded semantic
! for <tt>reset(p)</tt> that we would want to copy here.
! </p>
! 
! <p>
! STL points out that we need the <tt>nullptr</tt> overload for this dynamic-array form, as there is
! a deleted member function template that exists to steal overloads of pointer-to-derived, avoiding
! undifined behavior, so we need the extra overload.
! </p>
! 
! <p>
! Finally notice that there is blanket wording further up the clause saying we describe only changes
! from the primary template, so the proposed wording is in fact exactly correct.  Move to Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <p>Change 20.8.1.3.4 [unique.ptr.runtime.modifiers] as indicated:</p>
! 
! <blockquote><pre>
! <del>void reset(pointer p = pointer()) noexcept;</del>
! void reset(nullptr_t p) noexcept;
! </pre><blockquote>
! <p>
! -1- <i>Effects</i>: <del>If <tt>get() == nullptr</tt> there are no effects. Otherwise <tt>get_deleter()(get())</tt></del>
! <ins>Equivalent to <tt>reset(pointer())</tt></ins>.
! <p/>
! <del>-2- <i>Postcondition</i>: <tt>get() == p</tt>.</del>
! </p>
! </blockquote></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2170"></a>2170. Aggregates cannot be <tt>DefaultConstructible</tt></h3>
! <p><b>Section:</b> 17.6.3.1 [utility.arg.requirements] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-07-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility.arg.requirements">issues</a> in [utility.arg.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The lack of the definition of the <tt>DefaultConstructible</tt> requirements in C++03 was fixed 
! by LWG <a href="lwg-defects.html#724">724</a> at a time where the core rules of list-initialization were slightly
! different than today, at that time value-initialization (shortly) was the primary rule for
! class types, i.e. just before applying <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#1301">CWG 1301</a>, 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#1324">CWG 1324</a>, and 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#1368">CWG 1368</a>.
! <p/>
! The order in 8.5.4 [dcl.init.list] p3 was changed to respect aggregate initialization, but that
! had the side-effect that formally aggregate types cannot satisfy the <tt>DefaultConstructible</tt>
! requirements anymore, because we require that
! </p>
! <blockquote><pre>
! T u{};
! </pre></blockquote>
! <p>
! <em>value-initializes</em> the object <tt>u</tt>.
! <p/>
! Of-course exclusion of aggregates was not intended, therefore I suggest to extend the requirements
! in Table 19 (17.6.3.1 [utility.arg.requirements]) for empty aggregate-initialization as well.
! </p>
! 
! <p><i>[
! 2012-10 Portland: Move to Core 
! ]</i></p>
! 
! 
! <p>
! We are not qualified to pick apart the Core rules quickly at this point, but the consensus is
! that if the core language has changed in this manner, then the fix should similarly be applied
! in Core - this is not something that we want users of the language to have to say every time
! they want to Value initialize (or aggregate initialize) an object.
! </p>
! 
! <p>
! More to Open until we get a clear response from Core, Alisdair to file an issue with Mike.
! </p>
! 
! <p><i>[2013-04 Bristol: Back to Library]</i></p>
! 
! 
! <p>
! The Core Working group opened, discussed, and resolved <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_closed.html#1578">CWG 1578</a>
! as NAD for this library-related problem: Empty aggregate initialization and value-initialization are different core language concepts,
! and this difference can be observed (e.g. for a type with a deleted default-constructor).
! </p>
! 
! <p><i>[2014-02-15 Issaquah: Move to Ready]</i></p>
! 
! <p>
! AM: core says still LWG issue, wording has been non-controversial, move to ready?
! </p>
! <p>
! NJ: what about durations? think they are ok
! </p>
! <p>
! Ville: <tt>pair</tt> and a few other have value initialize
! </p>
! <p>
! AM: look at core 1578
! </p>
! <p>
! AM: value initialize would require <tt>()</tt>, remove braces from third row?
! </p>
! <p>
! STL: no
! </p>
! <p>
! PH: core has new issue on aggregates and non-aggregates.
! </p>
! <p>
! AM: right, they said does not affect this issue
! </p>
! <p>
! NJ: why ok with <tt>pair</tt> and <tt>tuple</tt>?
! </p>
! <p>
! STL: will use <tt>()</tt>, <tt>tuple</tt> of aggregates with deleted constructor is ill-formed
! </p>
! <p>
! Ville: aggregate with reference can't have <tt>()</tt>
! </p>
! <p>
! STL: <tt>{}</tt> would be an issue too
! </p>
! <p>
! Ville: aggregate with reference will have <tt>()</tt> deleted implicitly
! </p>
! <p>
! Move to Ready.
! </p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <p>Change Table 19 in 17.6.3.1 [utility.arg.requirements] as indicated:</p>
! 
! <table border="1">
! <caption>Table 19 &mdash; <tt>DefaultConstructible</tt> requirements [defaultconstructible]</caption>
! 
! <tr>
! <th>Expression</th>
! <th>Post-condition</th>
! </tr> 
! 
! <tr>
! <td>
! <tt>T t;</tt>
! </td>
! <td>
! object <tt>t</tt> is default-initialized
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>T u{};</tt>
! </td>
! <td>
! object <tt>u</tt> is value-initialized <ins>or aggregate-initialized</ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>T()</tt><br/>
! <tt>T{}</tt>
! </td>
! <td>
! a temporary object of type <tt>T</tt> is value-initialized <ins>or aggregate-initialized</ins>
! </td>
! </tr>
! 
! </table>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2172"></a>2172. Does <tt>atomic_compare_exchange_*</tt> accept <tt>v == nullptr</tt> arguments?</h3>
! <p><b>Section:</b> 20.8.2.6 [util.smartptr.shared.atomic] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2012-07-28 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.atomic">issues</a> in [util.smartptr.shared.atomic].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Looking at 20.8.2.6 [util.smartptr.shared.atomic]/p31
! </p>
! <blockquote><pre>
! template&lt;class T&gt;
!   bool
!   atomic_compare_exchange_strong_explicit(shared_ptr&lt;T&gt;* p,
!                                           shared_ptr&lt;T&gt;* v,
!                                           shared_ptr&lt;T&gt; w,
!                                           memory_order success, memory_order failure);
! </pre><blockquote><p>
! -31- <i>Requires</i>: <tt>p</tt> shall not be null.
! </p></blockquote></blockquote>
! <p>
! What about <tt>v</tt>?  Can it be null?  And if so, what happens?
! <p/>
! This looks closely related to C++11 issue LWG <a href="lwg-defects.html#1030">1030</a>, where we gave every signature in this section a:
! </p>
! <blockquote><p>
! <i>Requires</i>: <tt>p</tt> shall not be null.
! </p></blockquote>
! <p>
! It looks like a simple oversight to me that we did not add for the <tt>atomic_compare_exchange_*</tt>:
! </p>
! <blockquote><p>
! <i>Requires</i>: <tt>p</tt> shall not be null <ins>and <tt>v</tt> shall not be null</ins>.
! </p></blockquote>
! 
! <p><i>[2012-10 Portland: Move to Ready]</i></p>
! 
! <p>
! This is clearly the right thing to do, and Lawrence concurs. 
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <p>Change 20.8.2.6 [util.smartptr.shared.atomic] as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class T&gt;
!   bool atomic_compare_exchange_weak(
!     shared_ptr&lt;T&gt;* p, shared_ptr&lt;T&gt;* v, shared_ptr&lt;T&gt; w);
! </pre><blockquote><p>
! -27- <i>Requires</i>: <tt>p</tt> shall not be null <ins>and <tt>v</tt> shall not be null</ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! template&lt;class T&gt;
!   bool atomic_compare_exchange_weak_explicit(
!     shared_ptr&lt;T&gt;* p, shared_ptr&lt;T&gt;* v, shared_ptr&lt;T&gt; w,
!     memory_order success, memory_order failure);
! template&lt;class T&gt;
!   bool atomic_compare_exchange_strong_explicit(
!     shared_ptr&lt;T&gt;* p, shared_ptr&lt;T&gt;* v, shared_ptr&lt;T&gt; w,
!     memory_order success, memory_order failure);
! </pre><blockquote><p>
! -31- <i>Requires</i>: <tt>p</tt> shall not be null <ins>and <tt>v</tt> shall not be null</ins>.
! <p/>
! [&hellip;]
! </p>
! </blockquote></blockquote>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2174"></a>2174. <tt>wstring_convert::converted()</tt> should be <tt>noexcept</tt></h3>
! <p><b>Section:</b> 22.3.3.2.2 [conversions.string] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-08-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#conversions.string">active issues</a> in [conversions.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! There is no reason <tt>wstring_convert::converted()</tt> shouldn't be <tt>noexcept</tt>.
! <p/>
! It might be possible for <tt>wstring_convert::state()</tt> and <tt>wbuffer_convert::state()</tt> 
! to be <tt>noexcept</tt> too, depending on the requirements on <tt>mbstate_t</tt>.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! <p>
! Defer the separate discsussion of <tt>state()</tt> to another issue, if anyone is ever motivated
! to file one.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Edit in the class template <tt>wstring_convert</tt> synopsis 22.3.3.2.2 [conversions.string] p2:</p>
! 
! <blockquote><pre>
! size_t converted() const <ins>noexcept</ins>;
! </pre></blockquote>
! </li>
! 
! <li><p>Edit the signature before 22.3.3.2.2 [conversions.string] p6:</p>
! 
! <blockquote><pre>
! size_t converted() const <ins>noexcept</ins>;
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2175"></a>2175. <tt>wstring_convert</tt> and <tt>wbuffer_convert</tt> validity</h3>
! <p><b>Section:</b> 22.3.3.2.2 [conversions.string], 22.3.3.2.3 [conversions.buffer] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-08-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#conversions.string">active issues</a> in [conversions.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! See discussion following <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=32710">c++std-lib-32710</a>.
! <p/>
! It's not specified what happens if <tt>wstring_convert</tt> and <tt>wbuffer_convert</tt> objects are constructed 
! with null <tt>Codecvt</tt> pointers.
! <p/>
! Should the constructors have preconditions that the pointers are not null?  If not, are conversions expected to 
! fail, or is it undefined to attempt conversions if the pointers are null?
! <p/>
! There are no observer functions to check whether objects were constructed with valid <tt>Codecvt</tt> pointers. 
! If the types are made movable such observers would be necessary even if the constructors require non-null 
! pointers (see also LWG <a href="lwg-defects.html#2176">2176</a>).
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Insert a new paragraph before 22.3.3.2.2 [conversions.string] paragraph 16:</p>
! 
! <blockquote><pre>
! wstring_convert(Codecvt *pcvt = new Codecvt);
! wstring_convert(Codecvt *pcvt, state_type state);
! wstring_convert(const byte_string&amp; byte_err,
!   const wide_string&amp; wide_err = wide_string());
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: For the first and second constructors <tt>pcvt != nullptr</tt>.</ins>
! <p/>
! -16- <i>Effects</i>: The first constructor shall store <tt>pcvt</tt> in <tt>cvtptr</tt> and default values in 
! <tt>cvtstate</tt>, <tt>byte_err_string</tt>, and <tt>wide_err_string</tt>. The second constructor shall 
! store <tt>pcvt</tt> in <tt>cvtptr</tt>, <tt>state</tt> in <tt>cvtstate</tt>, and default values in 
! <tt>byte_err_string</tt> and <tt>wide_err_string</tt>; moreover the stored state shall be retained between 
! calls to <tt>from_bytes</tt> and <tt>to_bytes</tt>. The third constructor shall store <tt>new Codecvt</tt> 
! in <tt>cvtptr</tt>, <tt>state_type()</tt> in cvtstate, <tt>byte_err</tt> in <tt>byte_err_string</tt>, 
! and <tt>wide_err</tt> in <tt>wide_err_string</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Insert a new paragraph before 22.3.3.2.3 [conversions.buffer] paragraph 10:</p>
! 
! <blockquote><pre>
! wbuffer_convert(std::streambuf *bytebuf = 0,
!   Codecvt *pcvt = new Codecvt, state_type state = state_type());
! </pre><blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>pcvt != nullptr</tt>.</ins>
! <p/>
! -10- <i>Effects</i>: The constructor constructs a stream buffer object, initializes <tt>bufptr</tt> to <tt>bytebuf</tt>, 
! initializes <tt>cvtptr</tt> to <tt>pcvt</tt>, and initializes <tt>cvtstate</tt> to <tt>state</tt>.
! </p>
! </blockquote></blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2176"></a>2176. Special members for <tt>wstring_convert</tt> and <tt>wbuffer_convert</tt></h3>
! <p><b>Section:</b> 22.3.3.2.2 [conversions.string], 22.3.3.2.3 [conversions.buffer] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-08-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#conversions.string">active issues</a> in [conversions.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#conversions.string">issues</a> in [conversions.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! See discussion following <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=32699">c++std-lib-32699</a>.
! <p/>
! The constructors for <tt>wstring_convert</tt> and <tt>wbuffer_convert</tt> should be explicit, to avoid 
! implicit conversions which take ownership of a <tt>Codecvt</tt> pointer and delete it unexpectedly.
! <p/>
! Secondly, 22.3.3.2.3 [conversions.buffer] p11 describes a destructor which is not declared in the class 
! synopsis in p2.
! <p/>
! Finally, and most importantly, the definitions in 22.3.3.2.2 [conversions.string] and 
! 22.3.3.2.3 [conversions.buffer] imply implicitly-defined copy constructors and assignment operators, which 
! would do shallow copies of the owned <tt>Codecvt</tt> objects and result in undefined behaviour in the 
! destructors.
! <p/>
! <tt>Codecvt</tt> is not required to be <tt>CopyConstructible</tt>, so deep copies are not possible.  
! The <tt>wstring_convert</tt> and <tt>wstring_buffer</tt> types could be made move-only, but the proposed 
! resolution below doesn't do so because of the lack of preconditions regarding null <tt>Codecvt</tt> pointers
! and the absence of observer functions that would allow users to check preconditions (see also LWG <a href="lwg-defects.html#2175">2175</a>).
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! <p>
! Jonathan pointed out that you can have an implicit constructor that takes ownership of a heap reference,
! which would result an unexpected deletion.
! </p>
! <p>
! No-one really likes the 'naked new' in the interface here, either.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Edit the class template <tt>wstring_convert</tt> synopsis in 22.3.3.2.2 [conversions.string] p2:</p>
! 
! <blockquote><pre>
! <ins>explicit</ins> wstring_convert(Codecvt *pcvt = new Codecvt);
! wstring_convert(Codecvt *pcvt, state_type state);
! <ins>explicit</ins> wstring_convert(const byte_string&amp; byte_err,
!                          const wide_string&amp; wide_err = wide_string());
! ~wstring_convert();
! <ins>
! wstring_convert(const wstring_convert&amp;) = delete;
! wstring_convert&amp; operator=(const wstring_convert&amp;) = delete;
! </ins>				 
! </pre></blockquote>
! </li>
! 
! <li><p>Edit the signatures before 22.3.3.2.2 [conversions.string] p16:</p>
! 
! <blockquote><pre>
! <ins>explicit</ins> wstring_convert(Codecvt *pcvt = new Codecvt);
! wstring_convert(Codecvt *pcvt, state_type state);
! <ins>explicit</ins> wstring_convert(const byte_string&amp; byte_err,
!     const wide_string&amp; wide_err = wide_string());
! </pre></blockquote>
! </li>
! 
! <li><p>Edit the class template <tt>wbuffer_convert</tt> synopsis in 22.3.3.2.3 [conversions.buffer] p2:</p>
! 
! <blockquote><pre>
! <ins>explicit</ins> wbuffer_convert(std::streambuf *bytebuf = 0,
!                          Codecvt *pcvt = new Codecvt,
!                          state_type state = state_type());
! <ins>
! ~wbuffer_convert();
! 
! wbuffer_convert(const wbuffer_convert&amp;) = delete;
! wbuffer_convert&amp; operator=(const wbuffer_convert&amp;) = delete;
! </ins>						 
! </pre></blockquote>
! </li>
! 
! <li><p>Edit the signature before 22.3.3.2.3 [conversions.buffer] p10:</p>
! 
! <blockquote><pre>
! <ins>explicit</ins> wbuffer_convert(std::streambuf *bytebuf = 0,
!     Codecvt *pcvt = new Codecvt, state_type state = state_type());
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2177"></a>2177. Requirements on <tt>Copy&#47;MoveInsertable</tt></h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Lo&iuml;c Joly <b>Opened:</b> 2012-08-10 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! See also discussion following <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=32883">c++std-lib-32883</a>
! and <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=32897">c++std-lib-32897</a>.
! <p/>
! The requirements on <tt>CopyInsertable</tt> and <tt>MoveInsertable</tt> are either incomplete, or complete but hard to 
! figure out.
! <p/>
! From e-mail <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=32897">c++std-lib-32897</a>:
! <p/>
! Pablo Halpern:
! <p/>
! I agree that we need semantic requirements for all of the <tt>*Insertable</tt> concepts analogous to the requirements 
! we have on similar concepts.
! <p/>
! Howard Hinnant:
! <p/>
! I've come to believe that the standard is actually correct as written in this area. But it is <em>really</em> hard 
! to read. I would have no objection whatsoever to clarifications to <tt>CopyInsertable</tt> as you suggest (such as the 
! post-conditions on <tt>v</tt>). And I do agree with you that the correct approach to the clarifications is to 
! confirm that <tt>CopyInsertable</tt> implies <tt>MoveInsertable</tt>.
! </p>
! 
! <p><i>[2012, Portland: Move to Tentatively Ready]</i></p>
! 
! <p>
! Move to Tentatively Ready by unanimous consent.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Edit 23.2.1 [container.requirements.general] p13 as indicated:</p>
! 
! <blockquote><p>
! -13- [&hellip;] Given a container type <tt>X</tt> having an <tt>allocator_type</tt> identical to <tt>A</tt> and 
! a <tt>value_type</tt> identical to <tt>T</tt> and given an lvalue <tt>m</tt> of type <tt>A</tt>, a pointer <tt>p</tt> 
! of type <tt>T*</tt>, an expression <tt>v</tt> of type (possibly <tt>const</tt>) <tt>T</tt>, and an rvalue <tt>rv</tt> 
! of type <tt>T</tt>, the following terms are defined. If <tt>X</tt> is not allocator-aware, the terms below are
! defined as if <tt>A</tt> were <tt>std::allocator&lt;T&gt;</tt> &mdash; no allocator object needs to be created and 
! user specializations of <tt>std::allocator&lt;T&gt;</tt> are not instantiated:
! </p>
! <ul>
! <li><p><tt>T</tt> is <em><tt>DefaultInsertable</tt> into <tt>X</tt></em> means that the following expression is 
! well-formed:</p>
! <blockquote><pre>
! allocator_traits&lt;A&gt;::construct(m, p)<del>;</del>
! </pre></blockquote>
! </li>
! 
! <li><p>An element of <tt>X</tt> is <em>default-inserted</em> if it is initialized by evaluation of the expression</p>
! <blockquote><pre>
! allocator_traits&lt;A&gt;::construct(m, p)<del>;</del>
! </pre></blockquote>
! <p>
! where <tt>p</tt> is the address of the uninitialized storage for the element allocated within <tt>X</tt>.
! </p>
! </li>
! 
! <li><p><tt>T</tt> is <em><tt><del>Copy</del><ins>Move</ins>Insertable</tt> into <tt>X</tt></em> means that 
! the following expression is well-formed:</p>
! <blockquote><pre>
! allocator_traits&lt;A&gt;::construct(m, p, <ins>r</ins>v)<del>;</del>
! </pre></blockquote>
! <p>
! <ins>and when evaluated the following postconditions hold: The value of <tt>*p</tt> is equivalent to the value of 
! <tt>rv</tt> before the evaluation. [<i>Note</i>: <tt>rv</tt> remains a valid object. Its state is unspecified &mdash; 
! <i>end note</i>]</ins>
! </p>
! </li>
! 
! <li><p><tt>T</tt> is <em><tt><del>Move</del><ins>Copy</ins>Insertable</tt> into <tt>X</tt></em> means 
! that<ins>, in addition to satisfying the <tt>MoveInsertable</tt> requirements,</ins> the following expression is 
! well-formed:</p>
! <blockquote><pre>
! allocator_traits&lt;A&gt;::construct(m, p, <del>r</del>v)<del>;</del>
! </pre></blockquote>
! <p>
! <ins>and when evaluated the following postconditions hold: The value of <tt>v</tt> is unchanged and is equivalent 
! to <tt>*p</tt>.</ins>
! </p>
! </li>
! 
! <li><p><tt>T</tt> is <em><tt>EmplaceConstructible</tt> into <tt>X</tt> from <tt>args</tt></em>, for zero or more arguments 
! <tt>args</tt>, means that the following expression is well-formed:</p>
! <blockquote><pre>
! allocator_traits&lt;A&gt;::construct(m, p, args)<del>;</del>
! </pre></blockquote>
! </li>
! 
! <li><p><tt>T</tt> is <em><tt>Erasable</tt> from <tt>X</tt></em> means that the following expression is well-formed:</p>
! <blockquote><pre>
! allocator_traits&lt;A&gt;::destroy(m, p)<del>;</del>
! </pre></blockquote>
! </li>
! 
! </ul>
! <p>
! [<i>Note</i>: A container calls <tt>allocator_traits&lt;A&gt;::construct(m, p, args)</tt> to construct an element 
! at <tt>p</tt> using <tt>args</tt>. The default construct in <tt>std::allocator</tt> will call 
! <tt>::new((void*)p) T(args)</tt>, but specialized allocators may choose a different definition. &mdash; <i>end note</i>]
! </p>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2180"></a>2180. Exceptions from <tt>std::seed_seq</tt> operations</h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-08-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 26.5.7.1 [rand.util.seedseq] p1 says upfront:
! </p>
! <blockquote><p>
! No function described in this section 26.5.7.1 [rand.util.seedseq] throws an exception.
! </p></blockquote>
! <p>
! This constraint seems non-implementable to me when looking especially at the members
! </p>
! <blockquote><pre>
! template&lt;class T&gt;
! seed_seq(initializer_list&lt;T&gt; il);
! 
! template&lt;class InputIterator&gt;
! seed_seq(InputIterator begin, InputIterator end);
! </pre></blockquote>
! <p>
! which have the effect of invoking <tt>v.push_back()</tt> for the exposition-only member of
! type <tt>std::vector</tt> (or its equivalent) over all elements of the provided range, so
! out-of-memory exceptions are always possible and the <tt>seed_seq</tt> object doesn't seem
! to be constructible this way.
! <p/>
! In addition to the potential lack-of-resources problem, the operations of <tt>InputIterator</tt>
! might also throw exceptions.
! <p/>
! Aside to that it should me mentioned, that a default constructor of <tt>vector&lt;uint_least32_t&gt;</tt> 
! in theory can also throw exceptions, even though this seems less of a problem to me in this context, because 
! such an implementation could easily use a different internal container in <tt>seed_seq</tt> that can hold 
! this no-throw exception guarantee.
! <p/>
! Secondly, a slightly different problem category related to exceptions occurs for the member templates
! </p>
! <blockquote><pre>
! template&lt;class RandomAccessIterator&gt;
! void generate(RandomAccessIterator begin, RandomAccessIterator end);
! 
! template&lt;class OutputIterator&gt;
! void param(OutputIterator dest) const;
! </pre></blockquote>
! <p>
! where the actual operations performed by the implementation would never need to throw, but since they invoke
! operations of a user-provided customization point, the overall operation, like for example
! </p>
! <blockquote><pre>
! copy(v.begin(), v.end(), dest);
! </pre></blockquote>
! <p>
! could also throw exceptions. In this particular example we can just think of a <tt>std::back_insert_iterator</tt>
! applied to a container that needs to allocate its elements used as the type for <tt>OutputIterator</tt>.
! <p/>
! Even though Clause 26 [numerics] has mostly stronger exception constraints than other parts of the
! library the here discussed are overrestrictive, especially since no operation of <tt>std::seed_seq</tt> 
! except the template <tt>generate</tt> is actually needed within the library implementation, as mentioned in the 
! discussion of LWG <a href="lwg-closed.html#2124">2124</a>.
! <p/>
! I suggest to remove the general no-exception constraints for operations of <tt>std::seed_seq</tt> except for
! member <tt>size()</tt> and the default constructor and to provide specific wording for <tt>generate()</tt> and
! <tt>param()</tt> to ensure that the algorithm itself is a nothrow operation, which is especially for
! <tt>generate()</tt> important, because the templates specified in 26.5.3 [rand.eng] and 
! 26.5.4 [rand.adapt] also depend on this property indirectly, which is further discussed in LWG 
! <a href="lwg-active.html#2181">2181</a>.
! <p/>
! <u>Howard</u>:
! <p/>
! I suggest to use a different form for the exception specification, something similar to 
! 20.9.10.3 [func.bind.bind] p4:
! </p>
! <blockquote><p>
! <i>Throws</i>: Nothing unless an operation on <tt>RandomAccessIterator</tt> throws an exception.
! </p></blockquote>
! <p>
! <u>Daniel</u>:
! <p/>
! The currently suggested "what and when" form seems a bit more specific and harmonizes with the form used for
! function template <tt>generate_canonical</tt> from 26.5.7.2 [rand.util.canonical].
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! 
! <p>
! Open an editorial issue on the exception wording ("Throws: What and when"). 
! <p/>
! Solution: move to tentatively ready. 
! </p>
! 
! <p><i>[2013-09-29, Chicago]</i></p>
! 
! 
! <p>
! Apply to Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Edit 26.5.7.1 [rand.util.seedseq] p1 as indicated:</p>
! 
! <blockquote>
! <p>
! <del>-1- No function described in this section 26.5.7.1 [rand.util.seedseq] throws an exception.</del>
! </p>
! </blockquote>
! </li>
! 
! <li><p>Edit 26.5.7.1 [rand.util.seedseq] around p2 as indicated:</p>
! 
! <blockquote><pre>
! seed_seq();
! </pre><blockquote>
! <p>
! -2- <i>Effects</i>: Constructs a <tt>seed_seq</tt> object as if by default-constructing its member <tt>v</tt>.
! <p/>
! <ins>-?- <i>Throws</i>: Nothing.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 26.5.7.1 [rand.util.seedseq] around p7 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class RandomAccessIterator&gt;
!   void generate(RandomAccessIterator begin, RandomAccessIterator end);
! </pre><blockquote>
! <p>
! -7- <i>Requires</i>: <tt>RandomAccessIterator</tt> shall meet the requirements of a mutable random access iterator
! (Table 111) type. Moreover, <tt>iterator_traits&lt;class RandomAccessIterator&gt;::value_type</tt> shall denote
! an unsigned integer type capable of accommodating 32-bit quantities.
! <p/>
! -8- <i>Effects</i>: Does nothing if <tt>begin == end</tt>. Otherwise, with <tt>s = v.size()</tt> and 
! <tt>n = end - begin</tt>, fills the supplied range <tt>[begin, end)</tt> according to the following algorithm [&hellip;]
! <p/>
! <ins>-?- <i>Throws</i>: What and when <tt>RandomAccessIterator</tt> operations of <tt>begin</tt> and <tt>end</tt> throw.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 26.5.7.1 [rand.util.seedseq] around p9 as indicated:</p>
! 
! <blockquote><pre>
! size_t size() const;
! </pre><blockquote>
! <p>
! -9- <i>Returns</i>: The number of 32-bit units that would be returned by a call to <tt>param()</tt>.
! <p/>
! <ins>-??- <i>Throws</i>: Nothing.</ins>
! <p/>
! -10- <i>Complexity</i>: constant time.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 26.5.7.1 [rand.util.seedseq] around p11 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class OutputIterator&gt;
!   void param(OutputIterator dest) const;
! </pre><blockquote>
! <p>
! -11- <i>Requires</i>: <tt>OutputIterator</tt> shall satisfy the requirements of an output iterator (Table 108) type. 
! Moreover, the expression <tt>*dest = rt</tt> shall be valid for a value <tt>rt</tt> of type <tt>result_type</tt>.
! <p/>
! -12- <i>Effects</i>: Copies the sequence of prepared 32-bit units to the given destination, as if by executing the
! following statement:
! </p>
! <blockquote><pre>
! copy(v.begin(), v.end(), dest);
! </pre></blockquote>
! <p>
! <ins>-??- <i>Throws</i>: What and when <tt>OutputIterator</tt> operations of <tt>dest</tt> throw.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2182"></a>2182. <tt>Container::[const_]reference</tt> types are misleadingly specified</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-08-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! According to Table 96 (Container requirements) the return type of <tt>X::reference</tt> and
! <tt>X::const_reference</tt> is "lvalue of <tt>T</tt>" and "<tt>const</tt> lvalue of <tt>T</tt>",
! respectively. This does not make much sense, because an lvalue is an expression category, not a type.
! It could also refer to an expression that has a type, but this doesn't make sense either in this
! context, because obviously <tt>X::[const_]reference</tt> are intended to refer to types. 
! <p/>
! Given the fact that <tt>vector&lt;bool&gt;</tt> has no real reference type for <tt>X::[const_]reference</tt> 
! and this definition presumably is intended to cover such situations as well, one might think that the wording is
! just a sloppy form of "type that represents a [const] lvalue of <tt>T</tt>". But this is also problematic,
! because basically all proxy reference expressions are rvalues.
! <p/>
! It is unclear what the intention is. A straightward way of fixing this wording could make
! <tt>X::[const_]reference</tt> identical to <tt>[const] T&amp;</tt>. This holds for all Library containers
! except for <tt>vector&lt;bool&gt;</tt>.
! <p/>
! Another way of solving this definition problem would be to impose a requirement that holds for both
! references and reference-like proxies. Both <tt>X::reference</tt> and <tt>X::const_reference</tt>
! would need to be convertible to <tt>const T&amp;</tt>. Additionally <tt>X::reference</tt> would need to
! support for a mutable container an assignment expression of the form 
! <tt>declval&lt;X::reference&gt;() = declval&lt;T&gt;()</tt> (this presentation intentionally does not require 
! <tt>declval&lt;X::reference<span style="color:#C80000;font-weight:bold">&amp;</span>&gt;() = declval&lt;T&gt;()</tt>).
! <p/>
! Further, the Table 96 does not impose any relations between <tt>X::reference</tt> and <tt>X::const_reference</tt>.
! It seems that at least <tt>X::reference</tt> needs to be convertible to <tt>X::const_reference</tt>.
! <p/>
! A related question is whether <tt>X::reference</tt> is supposed to be a mutable reference-like type,
! irrespective of whether the container is an immutable container or not. The way, type <tt>match_results</tt>
! defines <tt>reference</tt> identical to <tt>const_reference</tt> indicates one specific interpretation (similarly,
! the <tt>initializer_list</tt> template also defines member type <tt>reference</tt> equal to <tt>const value_type&amp;</tt>).
! Note that this can be a different decision as that for <tt>iterator</tt> and <tt>const_iterator</tt>,
! e.g. for sets the type <tt>X::reference</tt> still is a mutable reference, even though <tt>iterator</tt>
! is described as constant iterator.
! <p/>
! The proposed resolution is incomplete in regard to the last question.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! <p>
! Alisdair notes that this looks like wording in the right direction.  Wonders about congruence of these
! typedefs and the similar ones for iterators.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Moved to Ready.
! </p>
! <p>
! Consensus that the requirements should require real references, just like iterators, as containers are
! required to support at least ForwardIterators, which have the same restriction on references.
! </p>
! 
! <p>
! Matt will file a new issue for some additional concerns with regex <tt>match_results</tt>.
! </p>
! 
! <p><i>[2014-02-10, Daniel comments]</i></p>
! 
! 
! <p>
! The new issue opened by Matt is LWG <a href="lwg-defects.html#2306">2306</a>.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! <p>
! Issue should have been Ready in pre-meeting mailing.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change Table 96 &mdash; "Container requirements" as indicated:</p>
! 
! <table border="1">
! <caption>Table p6 &mdash; Container requirements</caption>
! 
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational<br/>Semantics</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
! <th>Complexity</th>
! </tr> 
! 
! <tr>
! <td>
! <tt>X::reference</tt>
! </td>
! <td>
! <del>lvalue of </del><tt>T<ins>&amp;</ins></tt>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! </td>
! <td>
! compile time
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X::const_reference</tt>
! </td>
! <td>
! <del>const lvalue of</del><ins><tt>const</tt></ins> <tt>T<ins>&amp;</ins></tt>
! </td>
! <td>
! &nbsp;
! </td>
! <td>
! </td>
! <td>
! compile time
! </td>
! </tr>
! 
! </table>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2185"></a>2185. Missing throws clause for <tt>future/shared_future::wait_for/wait_until</tt></h3>
! <p><b>Section:</b> 30.6.6 [futures.unique_future], 30.6.7 [futures.shared_future] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Vicente J. Botet Escriba <b>Opened:</b> 2012-09-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.unique_future">issues</a> in [futures.unique_future].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The functions <tt>future::wait_for</tt>, <tt>future::wait_until</tt>, <tt>shared_future::wait_for</tt>, and 
! <tt>shared_future::wait_for</tt> can throw any timeout-related exceptions. It would be better if the wording 
! could be more explicit. This is in line with the changes proposed in LWG <a href="lwg-defects.html#2093">2093</a>'s <em>Throws</em> element 
! of <tt>condition_variable::wait</tt> with predicate.
! </p>
! 
! <p><i>[2012, Portland: move to Review]</i></p>
! 
! <p>
! The phrase timeout-related exception does not exist.
! </p>
! <p><a href="lwg-defects.html#2093">2093</a> was put in review, and there is some dependency here with this issue.
! </p>
! <p>If you provide a user-defined clock that throws, we need to put back an exception to allow that to be done.
! </p>
! <p>
! We will put this in review and say that this cannot go in before <a href="lwg-defects.html#2093">2093</a>.
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! <p>Accepted for the working paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p><i>[This resolution should not be adopted before resolving <a href="lwg-defects.html#2093">2093</a>]</i></p>
! 
! 
! <p><i>[This wording is relative to N3376.]</i></p>
! 
! 
! <ol>
! <li><p>Change 30.6.6 [futures.unique_future] as indicated:</p>
! <blockquote><pre>
! template &lt;class Rep, class Period&gt;
! future_status wait_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) const;
! </pre><blockquote><p>
! -21- <i>Effects</i>: none if the shared state contains a deferred function (30.6.8 [futures.async]), otherwise 
! blocks until the shared state is ready or until the relative timeout (30.2.4 [thread.req.timing]) specified by 
! <tt>rel_time</tt> has expired.
! <p/>
! -22- <i>Returns</i>: [&hellip;]
! <p/>
! <ins>-??- <i>Throws</i>: timeout-related exceptions (30.2.4 [thread.req.timing]).</ins>
! </p>
! </blockquote><pre>
! template &lt;class Clock, class Duration&gt;
! future_status wait_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) const;
! </pre><blockquote><p>
! -23- <i>Effects</i>: none if the shared state contains a deferred function (30.6.8 [futures.async]), otherwise 
! blocks until the shared state is ready or until the absolute timeout (30.2.4 [thread.req.timing]) specified by 
! <tt>abs_time</tt> has expired.
! <p/>
! -24- <i>Returns</i>: [&hellip;]
! <p/>
! <ins>-??- <i>Throws</i>: timeout-related exceptions (30.2.4 [thread.req.timing]).</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Change 30.6.7 [futures.shared_future] as indicated:</p>
! <blockquote><pre>
! template &lt;class Rep, class Period&gt;
! future_status wait_for(const chrono::duration&lt;Rep, Period&gt;&amp; rel_time) const;
! </pre><blockquote><p>
! -23- <i>Effects</i>: none if the shared state contains a deferred function (30.6.8 [futures.async]), otherwise 
! blocks until the shared state is ready or until the relative timeout (30.2.4 [thread.req.timing]) specified by 
! <tt>rel_time</tt> has expired.
! <p/>
! -24- <i>Returns</i>: [&hellip;]
! <p/>
! <ins>-??- <i>Throws</i>: timeout-related exceptions (30.2.4 [thread.req.timing]).</ins>
! </p>
! </blockquote><pre>
! template &lt;class Clock, class Duration&gt;
! future_status wait_until(const chrono::time_point&lt;Clock, Duration&gt;&amp; abs_time) const;
! </pre><blockquote><p>
! -25- <i>Effects</i>: none if the shared state contains a deferred function (30.6.8 [futures.async]), otherwise 
! blocks until the shared state is ready or until the absolute timeout (30.2.4 [thread.req.timing]) specified by 
! <tt>abs_time</tt> has expired.
! <p/>
! -26- <i>Returns</i>: [&hellip;]
! <p/>
! <ins>-??- <i>Throws</i>: timeout-related exceptions (30.2.4 [thread.req.timing]).</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2186"></a>2186. Incomplete action on <tt>async/launch::deferred</tt></h3>
! <p><b>Section:</b> 30.6.8 [futures.async] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Vicente J. Botet Escriba <b>Opened:</b> 2012-09-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.async">issues</a> in [futures.async].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The description of the effects of <tt>async</tt> when the launch policy is <tt>launch::deferred</tt> doesn't 
! state what is done with the result of the deferred function invocation and the possible exceptions as it is done 
! for the asynchronous function when the policy is <tt>launch::async</tt>.
! </p>
! 
! <p><i>[2012, Portland: move to Open]</i></p>
! 
! <p>
! Detlef: agree with the problem but not with the resolution. The wording should be applied to all launch policies
!         rather than having to be separately specified for each one.
! </p>
! <p>
! Hans: we should redraft to factor out the proposed text outside the two bullets. Needs to be carefully worded to
!       be compatible with the resolution of <a href="lwg-defects.html#2120">2120</a> (see above).
! </p>
! <p>
! Moved to open
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate after SG1 review]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p><i>[This wording is relative to N3376.]</i></p>
! 
! 
! <ol>
! <li><p>Change 30.6.8 [futures.async] p3 bullet 2 as indicated:</p>
! <blockquote><pre>
! template &lt;class F, class... Args&gt;
! future&lt;typename result_of&lt;typename decay&lt;F&gt;::type(typename decay&lt;Args>::type...)&gt;::type&gt;
! async(F&amp;&amp; f, Args&amp;&amp;... args);
! template &lt;class F, class... Args&gt;
! future&lt;typename result_of&lt;typename decay&lt;F&gt;::type(typename decay&lt;Args&gt;::type...)&gt;::type&gt;
! async(launch policy, F&amp;&amp; f, Args&amp;&amp;... args);
! </pre><blockquote><p>
! -2- <i>Requires</i>: [&hellip;]
! <p/>
! -3- <i>Effects:</i>: The first function behaves the same as a call to the second function with a <tt>policy</tt> argument of
! <tt>launch::async | launch::deferred</tt> and the same arguments for <tt>F</tt> and <tt>Args</tt>. [&hellip;] The further 
! behavior of the second function depends on the <tt>policy</tt> argument as follows (if more than one of these conditions
! applies, the implementation may choose any of the corresponding policies):
! </p>
! <ul>
! <li><p>if <tt>policy &amp; launch::async</tt> is non-zero [&hellip;]</p></li>
! <li><p>if <tt>policy &amp; launch::deferred</tt> is non-zero &mdash; Stores <tt><i>DECAY_COPY</i>(std::forward&lt;F&gt;(f))</tt> 
! and <tt><i>DECAY_COPY</i>(std::forward&lt;Args>(args))...</tt> in the shared state. These copies of <tt>f</tt> and <tt>args</tt>
! constitute a <em>deferred function</em>. Invocation of the deferred function evaluates <tt><i>INVOKE</i>(std::move(g), std::move(xyz))</tt> 
! where <tt>g</tt> is the stored value of <tt><i>DECAY_COPY</i>(std::forward&lt;F>(f))</tt> and <tt>xyz</tt> is
! the stored copy of <tt><i>DECAY_COPY</i>(std::forward&lt;Args>(args))...</tt>. <ins>Any return value is stored as the 
! result in the shared state. Any exception propagated from the execution of the deferred function is stored as the 
! exceptional result in the shared state.</ins> The shared state is not made ready until the function has completed. 
! The first call to a non-timed waiting function (30.6.4 [futures.state]) on an asynchronous return object referring 
! to this shared state shall invoke the deferred function in the thread that called the waiting function. Once evaluation 
! of <tt><i>INVOKE</i>(std::move(g), std::move(xyz))</tt> begins, the function is no longer considered deferred. 
! [<i>Note</i>: If this policy is specified together with other policies, such as when using a policy value of 
! <tt>launch::async | launch::deferred</tt>, implementations should defer invocation or the selection of the <tt>policy</tt> 
! when no more concurrency can be effectively exploited. &mdash; <i>end note</i>]
! </p></li>
! </ul>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2187"></a>2187. <tt>vector&lt;bool&gt;</tt> is missing <tt>emplace</tt> and <tt>emplace_back</tt> member functions</h3>
! <p><b>Section:</b> 23.3.7 [vector.bool] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nevin Liber <b>Opened:</b> 2012-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.bool">issues</a> in [vector.bool].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! It should have them so that it more closely matches the <tt>vector&lt;T&gt;</tt> interface, as this helps when 
! writing generic code.
! </p>
! 
! <p><i>[2012, Portland: Move to Tentatively Ready]</i></p>
! 
! <p>
! Question on whether the variadic template is really needed, but it turns out to be needed to support
! <tt>emplace</tt> of no arguments.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change the class template <tt>vector&lt;bool&gt;</tt> synopsis, 23.3.7 [vector.bool] p1, as indicated:</p>
! <blockquote><pre>
! namespace std {
!   template &lt;class Allocator&gt; class vector&lt;bool, Allocator&gt; {
!   public:
!     [&hellip;]
!     <i>// modifiers:</i>
!     <ins>template &lt;class... Args&gt; void emplace_back(Args&amp;&amp;... args);</ins>
!     void push_back(const bool&amp; x);
!     void pop_back();
!     <ins>template &lt;class... Args&gt; iterator emplace(const_iterator position, Args&amp;&amp;... args);</ins>
!     iterator insert(const_iterator position, const bool&amp; x);
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2188"></a>2188. Reverse iterator does not fully support targets that overload <tt>operator&amp;</tt></h3>
! <p><b>Section:</b> 24.5.1.3.5 [reverse.iter.opref] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2012-09-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reverse.iter.opref">issues</a> in [reverse.iter.opref].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The specification for <tt>reverse_iterator::operator-></tt>
! returns the address of the object yielded by dereferencing
! with <tt>operator*</tt>, but does not have the usual
! wording about returning the true address of the object.  As
! <tt>reverse_iterator</tt> requires the adapted iterator have
! at least the bidirectional iterator category, we know that
! the returned reference is a true reference, and not a proxy,
! hence we can use <tt>std::addressof</tt> on the reference
! to get the right answer.
! </p>
! <p>
! This will most likely show itself as an issue with a <tt>list</tt>
! or <tt>vector</tt> of a type with such an overloaded operator,
! where algorithms are likely to work with a forward iteration, but
! not with reverse iteration.
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! 
! <p>
! Resolution: Goes to open now and move to review as soon as Daniel proposes a new wording.
! </p>
! 
! <p><i>[2014-02-12 Issaquah meeting]</i></p>
! 
! <p>
! Use <tt>std::addressof</tt> as the library uses elsewhere, then move as Immediate.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Revise 24.5.1.3.5 [reverse.iter.opref] p1, as indicated:
! </p>
! <p>
! <i>Returns:</i> <tt><ins>addressof</ins><del>&amp;(</del>operator*()<del>)</del></tt>.
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2190"></a>2190. Condition variable specification</h3>
! <p><b>Section:</b> 30.5 [thread.condition] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Hans Boehm <b>Opened:</b> 2012-09-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition">issues</a> in [thread.condition].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The condition variable specification possibly leaves it unclear whether the effect of a <tt>notify_one()</tt> 
! call can effectively be delayed, so that a call unblocks a <tt>wait()</tt> call that happens after the 
! <tt>notify_one</tt> call. (For <tt>notify_all()</tt> this is not detectable, since it only results in spurious 
! wake-ups.)  Although this may at first glance seem like a contrived interpretation, it gains relevance since 
! glibc in fact allows the analogous behavior (see <a href="http://sourceware.org/bugzilla/show_bug.cgi?id=13165">here</a>) 
! and it is currently controversial whether this is correct and the Posix specification allows it (see 
! <a href="http://austingroupbugs.net/view.php?id=609">here</a>).
! </p>
! <p>
! The following proposed resolution disallows the glibc implementation, remaining consistent with the believed intent of C++11.  
! To make that clear, we require that the "unspecified total order" O from 30.5 [thread.condition] p4 be 
! consistent with <em>happens-before</em>.  We also intend that the 3 components of a wait occur in order in O, 
! but stating that explicitly seems too pedantic.  Since they are numbered, it appears clear enough that they are 
! sequenced one after the other.
! </p>
! <p>
! Another uncertainty with the current phrasing is whether there is a single total order that includes all c.v. 
! accesses, or one total order per c.v.  We believe it actually doesn't matter, because there is no way to tell the 
! difference, but this requires a bit more thought.  We resolved it one way, just to remove the potential ambiguity.
! </p>
! 
! <p><i>[2012, Portland: Move to Review]</i></p>
! 
! <p>
! This is linked to a <a href="http://sourceware.org/bugzilla/show_bug.cgi?id=13165">glibc issue</a>, and
! a <a href="http://austingroupbugs.net/view.php?id=609">POSIX specification issue</a>.
! </p>
! 
! <p>
! We believe the proposed wording fixes the ambiguity in C++ and is compatible with the proposed resolution
! for Posix (which confirms the glibc behaviour as illegal).
! </p>
! 
! <p>
! Moved to review (Detlef hopes to send some improved wording to the reflector).
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! <p>Accepted for the working paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change 30.5 [thread.condition] p4 as indicated:</p>
! <blockquote><p>
! -4- The implementation shall behave as if <ins>all executions of</ins> <tt>notify_one</tt>, <tt>notify_all</tt>, 
! and each part of the <tt>wait</tt>, <tt>wait_for</tt>, and <tt>wait_until</tt> executions are executed in 
! <del>some</del><ins>a single</ins> unspecified total order <ins>consistent with the "happens before" order</ins>.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2193"></a>2193. Default constructors for standard library containers are explicit</h3>
! <p><b>Section:</b> 23 [containers] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2012-10-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#containers">active issues</a> in [containers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#containers">issues</a> in [containers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Most (all?) of the standard library containers have explicit default constructors. Consequently:
! </p>
! <blockquote><pre>
! std::set&lt;int&gt; s1 = { 1, 2 }; // ok
! std::set&lt;int&gt; s2 = { 1 }; // ok
! std::set&lt;int&gt; s3 = {}; // ill-formed, copy-list-initialization selected an explicit constructor
! </pre></blockquote>
! <p>
! Note that Clang + libc++ rejects the declaration of <tt>s3</tt> for this reason. This cannot possibly match the intent.
! </p>
! <p>
! Suggested fix: apply this transformation throughout the standard library:
! </p>
! <blockquote><pre>
! <ins>set() : set(Compare()) {}</ins>
! explicit set(const Compare&amp; comp<del> = Compare()</del>,
!              const Allocator&amp; = Allocator());
! </pre></blockquote>
! 
! <p><i>[
! 2012-10-06: Daniel adds concrete wording.
! ]</i></p>
! 
! 
! <p><i>[2012, Portland: Move to Open]</i></p>
! 
! <p>
! This may be an issue better solved by a core language tweak.  Throw the issue over to EWG and see whether they
! believe the issue is better resolved in Core or Library.
! </p>
! 
! <p>
! AJM suggest we spawn a new status of 'EWG' to handle such issues - and will move this issue appropriately when
! the software can record such resolutions.
! </p>
! 
! <p><i>[2013-08-27, Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz comments:]</i></p>
! 
! 
! <p>
! For the record, I'd like to point out that the resolution proposed by the submitter, namely replacing
! </p>
! 
! <blockquote><pre>
! explicit basic_string(const Allocator&amp; a = Allocator());
! </pre></blockquote>
! 
! <p>
! by
! </p>
! 
! <blockquote><pre>
! basic_string() : basic_string(Allocator()) {}
! explicit basic_string(const Allocator&amp; a);
! </pre></blockquote>
! 
! <p>
! (and similarly for other container and container-like classes) might introduce a potential
! backwards-compatibility problem related with explicit instantiation. Consider for instance
! </p>
! 
! <blockquote><pre>
! struct my_allocator
! {
!   my_allocator(...); // no default ctor
!   ...
! };
! 
! template class std::basic_string&lt;char, std::char_traits&lt;char&gt;, my_allocator&lt;char&gt;&gt;;
! </pre></blockquote>
! 
! <p>
! This (which I understand is currently a valid explicit instantiation of <tt>std::basic_string</tt>) will break if
! <tt>std::basic_string</tt> ctors are modified as proposed by this issue, since <tt>my_allocator</tt> doesn't have
! a default ctor.
! </p>
! 
! <p><i>[2013-10-06, Daniel comments:]</i></p>
! 
! 
! <p>
! Issue <a href="lwg-active.html#2303">2303</a> describes the more general problem related to explicit instantiation requests in the current
! library and may help to solve this problem here as well.
! </p>
! 
! <p><i>[2014-02-13, Issaquah, Jonathan revises wording]</i></p>
! 
! 
! <p><strong>Previous resolution from Daniel [SUPERSEDED]:</strong></p>
! 
! <blockquote class="note">
! 
! <p>This wording is relative to N3376.</p>
! 
! <p>The more general criterion for performing the suggested transformation was: Any type with an initializer-list 
! constructor that also has an explicit default constructor.</p>
! 
! <ol>
! <li><p>Change class template <tt>basic_string</tt> synopsis, 21.4 [basic.string] p5 as indicated:</p>
! <blockquote><pre>
! <ins>basic_string() : basic_string(Allocator()) {}</ins>
! explicit basic_string(const Allocator&amp; a<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 21.4.2 [string.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit basic_string(const Allocator&amp; a<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>deque</tt> synopsis, 23.3.3.1 [deque.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>deque() : deque(Allocator()) {}</ins>
! explicit deque(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.3.3.2 [deque.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit deque(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>forward_list</tt> synopsis, 23.3.4.1 [forwardlist.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>forward_list() : forward_list(Allocator()) {}</ins>
! explicit forward_list(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.3.4.2 [forwardlist.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit forward_list(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>list</tt> synopsis, 23.3.5.1 [list.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>list() : list(Allocator()) {}</ins>
! explicit list(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.3.5.2 [list.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit list(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>vector</tt> synopsis, 23.3.6.1 [vector.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>vector() : vector(Allocator()) {}</ins>
! explicit vector(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.3.6.2 [vector.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit vector(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template specialization <tt>vector&lt;bool&gt;</tt> synopsis, 23.3.7 [vector.bool] p1 as indicated:</p>
! <blockquote><pre>
! <ins>vector() : vector(Allocator()) {}</ins>
! explicit vector(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>map</tt> synopsis, 23.4.4.1 [map.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>map() : map(Compare()) {}</ins>
! explicit map(const Compare&amp; comp<del> = Compare()</del>,
!              const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.4.4.2 [map.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit map(const Compare&amp; comp<del> = Compare()</del>,
!              const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>multimap</tt> synopsis, 23.4.5.1 [multimap.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>multimap() : multimap(Compare()) {}</ins>
! explicit multimap(const Compare&amp; comp<del> = Compare()</del>,
!                   const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.4.5.2 [multimap.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit multimap(const Compare&amp; comp<del> = Compare()</del>,
!                   const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>set</tt> synopsis, 23.4.6.1 [set.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>set() : set(Compare()) {}</ins>
! explicit set(const Compare&amp; comp<del> = Compare()</del>,
!              const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.4.6.2 [set.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit set(const Compare&amp; comp<del> = Compare()</del>,
!              const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>multiset</tt> synopsis, 23.4.7.1 [multiset.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>multiset() : multiset(Compare()) {}</ins>
! explicit multiset(const Compare&amp; comp<del> = Compare()</del>,
!                   const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.4.7.2 [multiset.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit multiset(const Compare&amp; comp<del> = Compare()</del>,
!                   const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>unordered_map</tt> synopsis, 23.5.4.1 [unord.map.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_map() : unordered_map(<i>see below</i>) {}</ins>
! explicit unordered_map(size_type n<del> = <i>see below</i></del>,
!                        const hasher&amp; hf = hasher(),
!                        const key_equal&amp; eql = key_equal(),
!                        const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.4.2 [unord.map.cnstr] before p1 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_map() : unordered_map(<i>see below</i>) {}</ins>
! explicit unordered_map(size_type n<del> = <i>see below</i></del>,
!                        const hasher&amp; hf = hasher(),
!                        const key_equal&amp; eql = key_equal(),
!                        const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>unordered_multimap</tt> synopsis, 23.5.5.1 [unord.multimap.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_multimap() : unordered_multimap(<i>see below</i>) {}</ins>
! explicit unordered_multimap(size_type n<del> = <i>see below</i></del>,
!                             const hasher&amp; hf = hasher(),
!                             const key_equal&amp; eql = key_equal(),
!                             const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.5.2 [unord.multimap.cnstr] before p1 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_multimap() : unordered_multimap(<i>see below</i>) {}</ins>
! explicit unordered_multimap(size_type n<del> = <i>see below</i></del>,
!                             const hasher&amp; hf = hasher(),
!                             const key_equal&amp; eql = key_equal(),
!                             const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>unordered_set</tt> synopsis, 23.5.6.1 [unord.set.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_set() : unordered_set(<i>see below</i>) {}</ins>
! explicit unordered_set(size_type n<del> = <i>see below</i></del>,
!                        const hasher&amp; hf = hasher(),
!                        const key_equal&amp; eql = key_equal(),
!                        const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.6.2 [unord.set.cnstr] before p1 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_set() : unordered_set(<i>see below</i>) {}</ins>
! explicit unordered_set(size_type n<del> = <i>see below</i></del>,
!                        const hasher&amp; hf = hasher(),
!                        const key_equal&amp; eql = key_equal(),
!                        const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>unordered_multiset</tt> synopsis, 23.5.7.1 [unord.multiset.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_multiset() : unordered_multiset(<i>see below</i>) {}</ins>
! explicit unordered_multiset(size_type n<del> = <i>see below</i></del>,
!                             const hasher&amp; hf = hasher(),
!                             const key_equal&amp; eql = key_equal(),
!                             const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.7.2 [unord.multiset.cnstr] before p1 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_multiset() : unordered_multiset(<i>see below</i>) {}</ins>
! explicit unordered_multiset(size_type n<del> = <i>see below</i></del>,
!                             const hasher&amp; hf = hasher(),
!                             const key_equal&amp; eql = key_equal(),
!                             const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! </ol>
! 
! </blockquote>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate after final review]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <p>The more general criterion for performing the suggested transformation was: Any type with an initializer-list 
! constructor that also has an explicit default constructor.</p>
! 
! <ol>
! <li><p>Change class template <tt>basic_string</tt> synopsis, 21.4 [basic.string] p5 as indicated:</p>
! <blockquote><pre>
! <ins>basic_string() : basic_string(Allocator()) { }</ins>
! explicit basic_string(const Allocator&amp; a<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 21.4.2 [string.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit basic_string(const Allocator&amp; a<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>deque</tt> synopsis, 23.3.3.1 [deque.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>deque() : deque(Allocator()) { }</ins>
! explicit deque(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.3.3.2 [deque.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit deque(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>forward_list</tt> synopsis, 23.3.4.1 [forwardlist.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>forward_list() : forward_list(Allocator()) { }</ins>
! explicit forward_list(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.3.4.2 [forwardlist.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit forward_list(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>list</tt> synopsis, 23.3.5.1 [list.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>list() : list(Allocator()) { }</ins>
! explicit list(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.3.5.2 [list.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit list(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>vector</tt> synopsis, 23.3.6.1 [vector.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>vector() : vector(Allocator()) { }</ins>
! explicit vector(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.3.6.2 [vector.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit vector(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template specialization <tt>vector&lt;bool&gt;</tt> synopsis, 23.3.7 [vector.bool] p1 as indicated:</p>
! <blockquote><pre>
! <ins>vector() : vector(Allocator()) { }</ins>
! explicit vector(const Allocator&amp;<del> = Allocator()</del>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>map</tt> synopsis, 23.4.4.1 [map.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>map() : map(Compare()) { }</ins>
! explicit map(const Compare&amp; comp<del> = Compare()</del>,
!              const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.4.4.2 [map.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit map(const Compare&amp; comp<del> = Compare()</del>,
!              const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>multimap</tt> synopsis, 23.4.5.1 [multimap.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>multimap() : multimap(Compare()) { }</ins>
! explicit multimap(const Compare&amp; comp<del> = Compare()</del>,
!                   const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.4.5.2 [multimap.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit multimap(const Compare&amp; comp<del> = Compare()</del>,
!                   const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>set</tt> synopsis, 23.4.6.1 [set.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>set() : set(Compare()) { }</ins>
! explicit set(const Compare&amp; comp<del> = Compare()</del>,
!              const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.4.6.2 [set.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit set(const Compare&amp; comp<del> = Compare()</del>,
!              const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>multiset</tt> synopsis, 23.4.7.1 [multiset.overview] p2 as indicated:</p>
! <blockquote><pre>
! <ins>multiset() : multiset(Compare()) { }</ins>
! explicit multiset(const Compare&amp; comp<del> = Compare()</del>,
!                   const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.4.7.2 [multiset.cons] before p1 as indicated:</p>
! <blockquote><pre>
! explicit multiset(const Compare&amp; comp<del> = Compare()</del>,
!                   const Allocator&amp; = Allocator());
! </pre></blockquote>
! </li>
! 
! <li><p>Change class template <tt>unordered_map</tt> synopsis, 23.5.4.1 [unord.map.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_map();</ins>
! explicit unordered_map(size_type n<del> = <i>see below</i></del>,
!                        const hasher&amp; hf = hasher(),
!                        const key_equal&amp; eql = key_equal(),
!                        const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.4.2 [unord.map.cnstr] before p1 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_map() : unordered_map(size_type(<i>see below</i>)) { }</ins>
! explicit unordered_map(size_type n<del> = <i>see below</i></del>,
!                        const hasher&amp; hf = hasher(),
!                        const key_equal&amp; eql = key_equal(),
!                        const allocator_type&amp; a = allocator_type());
! </pre>
! 
! -1- <i>Effects:</i> Constructs an empty <code>unordered_map</code> using the specified hash function, key equality func-<br />
! tion, and allocator, and using at least <i>n</i> buckets. <del>If <i>n</i> is not provided,</del> <ins>For the default constructor</ins><br />
! the number of buckets is implementation-defined. <code>max_load_factor()</code> returns 1.0.
! </blockquote>
! 
! </li>
! 
! <li><p>Change class template <tt>unordered_multimap</tt> synopsis, 23.5.5.1 [unord.multimap.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_multimap();</ins>
! explicit unordered_multimap(size_type n<del> = <i>see below</i></del>,
!                             const hasher&amp; hf = hasher(),
!                             const key_equal&amp; eql = key_equal(),
!                             const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.5.2 [unord.multimap.cnstr] before p1 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_multimap() : unordered_multimap(size_type(<i>see below</i>)) { }</ins>
! explicit unordered_multimap(size_type n<del> = <i>see below</i></del>,
!                             const hasher&amp; hf = hasher(),
!                             const key_equal&amp; eql = key_equal(),
!                             const allocator_type&amp; a = allocator_type());
! </pre>
! 
! -1- <i>Effects:</i> Constructs an empty <code>unordered_multimap</code> using the specified hash function, key equality<br />
! function, and allocator, and using at least <i>n</i> buckets. <del>If <i>n</i> is not provided,</del> <ins>For the default constructor</ins><br />
! the number of buckets is implementation-defined. <code>max_load_factor()</code> returns 1.0.
! 
! </blockquote>
! </li>
! 
! <li><p>Change class template <tt>unordered_set</tt> synopsis, 23.5.6.1 [unord.set.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_set();</ins>
! explicit unordered_set(size_type n<del> = <i>see below</i></del>,
!                        const hasher&amp; hf = hasher(),
!                        const key_equal&amp; eql = key_equal(),
!                        const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.6.2 [unord.set.cnstr] before p1 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_set() : unordered_set(size_type(<i>see below</i>)) { }</ins>
! explicit unordered_set(size_type n<del> = <i>see below</i></del>,
!                        const hasher&amp; hf = hasher(),
!                        const key_equal&amp; eql = key_equal(),
!                        const allocator_type&amp; a = allocator_type());
! </pre>
! 
! -1- <i>Effects:</i> Constructs an empty <code>unordered_set</code> using the specified hash function, key equality func-<br />
! tion, and allocator, and using at least <i>n</i> buckets. <del>If <i>n</i> is not provided,</del> <ins>For the default constructor</ins><br />
! the number of buckets is implementation-defined. <code>max_load_factor()</code> returns 1.0.
! 
! </blockquote>
! </li>
! 
! <li><p>Change class template <tt>unordered_multiset</tt> synopsis, 23.5.7.1 [unord.multiset.overview] p3 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_multiset();</ins>
! explicit unordered_multiset(size_type n<del> = <i>see below</i></del>,
!                             const hasher&amp; hf = hasher(),
!                             const key_equal&amp; eql = key_equal(),
!                             const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.7.2 [unord.multiset.cnstr] before p1 as indicated:</p>
! <blockquote><pre>
! <ins>unordered_multiset() : unordered_multiset(size_type(<i>see below</i>)) { }</ins>
! explicit unordered_multiset(size_type n<del> = <i>see below</i></del>,
!                             const hasher&amp; hf = hasher(),
!                             const key_equal&amp; eql = key_equal(),
!                             const allocator_type&amp; a = allocator_type());
! </pre>
! 
! -1- <i>Effects:</i> Constructs an empty <code>unordered_multiset</code> using the specified hash function, key equality<br />
! function, and allocator, and using at least <i>n</i> buckets. <del>If <i>n</i> is not provided,</del> <ins>For the default constructor</ins><br />
! the number of buckets is implementation-defined. <code>max_load_factor()</code> returns 1.0.
! 
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2194"></a>2194. Impossible container requirements for adaptor types</h3>
! <p><b>Section:</b> 23.6 [container.adaptors] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Sebastian Mach <b>Opened:</b> 2012-10-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.adaptors">issues</a> in [container.adaptors].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The <tt>stack</tt> class template does not have an member type <tt>iterator</tt>, and therefore instantiations do not 
! meet the general container requirements as described in 23.2.1 [container.requirements.general]. But 
! 23.6.1 [container.adaptors.general] p1 says:
! </p>
! <blockquote><p>
! The headers <tt>&lt;queue&gt;</tt> and <tt>&lt;stack&gt;</tt> define the container adaptors <tt>queue</tt>, 
! <tt>priority_queue</tt>, and <tt>stack</tt>. These container adaptors meet the requirements for sequence containers.
! </p></blockquote>
! <p>
! Since sequence containers is a subset of general containers, this imposes requirements on the container adaptors that
! are not satisfied.
! </p>
! <p>
! <u>Daniel Kr&uuml;gler</u>: The wording change was performed as an editorial reorganization as requested
! by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3296.html#GB116">GB 116</a> occuring first in
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3242.pdf">N3242</a>, as a side-effect it 
! does now make the previous implicit C++03 classification to [lib.sequences]/1 more obvious. As the NB comment
! noticed, the adaptors really are not sequences nor containers, so this wording needs to be fixed.
! The most simple way to realize that is to strike the offending sentence.
! </p>
! 
! <p><i>[
! Daniel adds concrete wording.
! ]</i></p>
! 
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! 
! <p>
! Unanimous consensus that <tt>queue</tt> and <tt>stack</tt> are not meant to be sequences.
! <p/>
! Decision: move to tentatively ready 
! </p>
! 
! <p><i>[2013-09-29, Chicago]</i></p>
! 
! 
! <p>
! Apply to Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change 23.6.1 [container.adaptors.general] p1 as indicated:</p>
! <blockquote><p>
! -1- The headers <tt>&lt;queue&gt;</tt> and <tt>&lt;stack&gt;</tt> define the container adaptors <tt>queue</tt>, 
! <tt>priority_queue</tt>, and <tt>stack</tt>. <del>These container adaptors meet the requirements for sequence containers.</del>
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2196"></a>2196. Specification of <tt>is_*[copy/move]_[constructible/assignable]</tt> unclear for non-referencable types</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-10-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The pre-conditions for the type <tt>is_copy_constructible</tt> allow for template argument types were the language forbids 
! forming a reference, namely <tt>void</tt> types and function types that have <em>cv</em>-qualifiers or a <em>ref</em>-qualifier.
! <p/>
! But the current wording in Table 49 defining the predicate condition,
! </p>
! <blockquote><p>
! <tt>is_constructible&lt;T, const T&amp;&gt;::value</tt> is <tt>true</tt>.
! </p></blockquote>
! <p>
! leaves it open whether such argument types would (a) create a well-formed instantiation of the trait template or if so (b) what
! the outcome of the trait evaluation would be, as an example consider <tt>std::is_copy_constructible&lt;void&gt;</tt>.
! <p/>
! Current implementations differ, e.g. gcc accepts the instantiation and returns a false result, VS 2012
! also accepts the instantiation but returns true.
! <p/>
! I would suggest that the wording clarifies that the instantiation would be valid for these types and I also would strongly 
! prefer the outcome that the trait would always return false for these types. The latter seems rather natural
! to me, because there is no way to define a variable of <tt>void</tt> type or of function type at all, so it would be surprising
! to return a positive result for copy or move construction if no other construction could succeed. It is also not 
! possible to assign to a any of these values (because there is no way to form lvalues of them), so the same argumentation 
! can be applied to the <tt>is_copy/move_assignable</tt> traits as well.
! <p/>
! To reduce the amount of wording changes and repetitions, I suggest to define the term <em>referenceable type</em> in 
! sub-clause 17.3 [definitions] or alternatively in the core language to describe types to which references
! can be created via a typedef name. This definition corresponds to what the support concept <tt>ReferentType</tt> intended 
! to describe during concept time.
! <p/>
! In addition, LWG issue <a href="lwg-active.html#2101">2101</a> can also take advantage of the definition of a <em>referenceable type</em>.
! <p/>
! If the proposed resolution for LWG issue <a href="lwg-active.html#2101">2101</a> would be accepted, there is an alternative solution possible
! with the same effects. Now we would be able to use the now always well-formed instantiation of 
! <tt>std::add_lvalue_reference</tt> to modify the current definition of <tt>is_copy_constructible</tt> to
! </p>
! <blockquote><p>
! <tt>is_constructible&lt;T,<br/> 
!     typename add_lvalue_reference&lt;<br/> 
! 	typename add_const&lt;T&gt;::type&gt;::type&gt;::value</tt> is true.
! </p></blockquote>
! <p>
! and similar changes for the other affected traits.
! </p>
! 
! <p><i>[2012-10 Portland: Move to Open]</i></p>
! 
! <p>
! Referencable-type should be defined as "something that can be bound into a reference" or similar,
! rather than a list of types where that is true today.  We can then provide the list of known types
! that cannot be bound as examples that do not qualify in a note.
! </p>
! 
! <p>
! Otherwise we are happy with the wording.  AJM to redraft the definition and move to Review.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Add the following new definition to 17.3 [definitions] as indicated:</p>
! <p><b>referenceable type</b> [defns.referenceable]</p>
! <blockquote><p>
! An object type, a function type that does not have <em>cv</em>-qualifiers or a <em>ref</em>-qualifier, or a reference type.
! [<i>Note</i>: The term describes a type to which a reference can be created, including reference types. &mdash; <i>end note</i>]
! </p></blockquote>
! </li>
! 
! <li><p>Change Table 49 as indicated:</p>
! 
! <table border="1">
! <caption>Table 49 &mdash; Type property predicates</caption>
! <tr>
! <th>Template</th>
! <th>Condition</th>
! <th>Preconditions</th>
! </tr> 
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_copy_constructible;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_constructible&lt;T,</tt><br/>
! <tt>const T&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_move_constructible;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_constructible&lt;T,</tt><br/>
! <tt>T&amp;&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_copy_assignable;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_assignable&lt;T&amp;,</tt><br/>
! <tt>const T&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_move_assignable;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_assignable&lt;T&amp;,</tt><br/>
! <tt>T&amp;&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_trivially_copy_constructible;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_trivially_constructible&lt;T,</tt><br/>
! <tt>const T&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_trivially_move_constructible;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_trivially_constructible&lt;T,</tt><br/>
! <tt>T&amp;&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_trivially_copy_assignable;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_trivially_assignable&lt;T&amp;,</tt><br/>
! <tt>const T&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_trivially_move_assignable;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_trivially_assignable&lt;T&amp;,</tt><br/>
! <tt>T&amp;&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_nothrow_copy_constructible;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_nothrow_constructible&lt;T,</tt><br/>
! <tt>const T&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_nothrow_move_constructible;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_nothrow_constructible&lt;T,</tt><br/>
! <tt>T&amp;&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_nothrow_copy_assignable;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_nothrow_assignable&lt;T&amp;,</tt><br/>
! <tt>const T&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_nothrow_move_assignable;</tt>
! </td>
! <td>
! <ins>For a referenceable type <tt>T</tt>, the same result as</ins><br/>
! <tt>is_nothrow_assignable&lt;T&amp;,</tt><br/>
! <tt>T&amp;&amp;&gt;::value</tt><del> is true</del><ins>, otherwise false</ins>.
! </td>
! <td>
! <tt>T</tt> shall be a complete type,<br/>
! (possibly <em>cv</em>-qualified) <tt>void</tt>, or an<br/> 
! array of unknown bound.
! </td>
! </tr>
! 
! </table>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2197"></a>2197. Specification of <tt>is_[un]signed</tt> unclear for non-arithmetic types</h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2012-10-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The pre-conditions for the trait <tt>is_signed</tt> allow for any types as template arguments, 
! including non-arithmetic ones.
! <p/>
! But the current wording in Table 49 defining the predicate condition,
! </p>
! <blockquote><pre>
! is_arithmetic&lt;T&gt;::value &amp;&amp; T(-1) &lt; T(0)
! </pre></blockquote>
! <p>
! looks like real code and so leaves it open whether such argument types would create a well-formed 
! instantiation of the trait template or not. As written this definition would lead to a hard
! instantiation error for a non-arithmetic type like e.g.
! </p>
! <blockquote><pre>
! struct S {};
! </pre></blockquote>
! <p>
! I would suggest that the wording clarifies that the instantiation would be valid for such types as well,
! by means of a specification that is not an exact code pattern. This also reflects how existing 
! implementations behave.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change Table 49 as indicated:</p>
! 
! <table border="1">
! <caption>Table 49 &mdash; Type property predicates</caption>
! <tr>
! <th>Template</th>
! <th>Condition</th>
! <th>Preconditions</th>
! </tr> 
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_signed;</tt>
! </td>
! <td>
! <ins>If </ins><tt>is_arithmetic&lt;T&gt;::value<del> &amp;&amp;</del></tt><ins> is true, the same result as</ins><br/>
! <tt><ins>integral_constant&lt;bool,</ins> T(-1) &lt; T(0)<ins>&gt;::value</ins></tt><ins>;<br/>
! otherwise, false.</ins>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;</tt><br/>
! <tt>struct is_unsigned;</tt>
! </td>
! <td>
! <ins>If </ins><tt>is_arithmetic&lt;T&gt;::value<del> &amp;&amp;</del></tt><ins> is true, the same result as</ins><br/>
! <tt><ins>integral_constant&lt;bool,</ins> T(0) &lt; T(-1)<ins>&gt;::value</ins></tt><ins>;<br/>
! otherwise, false.</ins>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! </table>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2200"></a>2200. Data race avoidance for all containers, not only for sequences</h3>
! <p><b>Section:</b> 23.2.2 [container.requirements.dataraces] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-10-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.dataraces">issues</a> in [container.requirements.dataraces].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 23.2.2 [container.requirements.dataraces]/2 says "[&hellip;] implementations are
! required to avoid data races when the contents of the contained object in different 
! elements in the same sequence, excepting <tt>vector&lt;bool&gt;</tt>, are modified 
! concurrently."
! </p>
! <p>
! This should say "same container" instead of "same sequence", to avoid
! the interpretation that it only applies to sequence containers.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change 23.2.2 [container.requirements.dataraces]/2 as indicated:</p>
! <blockquote><p>
! -2- Notwithstanding (17.6.5.9 [res.on.data.races]), implementations are required to avoid data races when 
! the contents of the contained object in different elements in the same <del>sequence</del><ins>container</ins>, 
! excepting <tt>vector&lt;bool&gt;</tt>, are modified concurrently.
! <p/>
! -3- [<i>Note</i>: For a <tt>vector&lt;int&gt; x</tt> with a size greater than one, <tt>x[1] = 5</tt> and 
! <tt>*x.begin() = 10</tt> can be executed concurrently without a data race, but <tt>x[0] = 5</tt> and 
! <tt>*x.begin() = 10</tt> executed concurrently may result in a data race. As an exception to the general 
! rule, for a <tt>vector&lt;bool&gt; y, y[0] = true</tt> may race with <tt>y[1] = true</tt>. &mdash; <i>end note</i> ]
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2203"></a>2203. <tt>scoped_allocator_adaptor</tt> uses wrong argument types for piecewise construction</h3>
! <p><b>Section:</b> 20.13.4 [allocator.adaptor.members] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-10-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.adaptor.members">issues</a> in [allocator.adaptor.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! In 20.13.4 [allocator.adaptor.members] paragraph 11 the effects
! clause says a tuple should be constructed with <tt>inner_allocator_type()</tt>,
! but that creates an rvalue which cannot bind to <tt>inner_allocator_type&amp;</tt>,
! and would also be wrong if <tt>this->inner_allocator() != inner_allocator_type()</tt>.  
! This could be considered editorial, since the current wording doesn't even compile.
! </p>
! <p>
! Secondly, in the same paragraph, the tuple objects <tt>xprime</tt> and <tt>yprime</tt>
! seem to be lvalues and might be constructed by copying <tt>x</tt> and <tt>y</tt>. This
! prevents using <tt>scoped_allocator</tt> to construct pairs from arguments of
! move-only types.  I believe the <tt>tuple_cast()</tt> expressions should use
! <tt>std::move(x)</tt> and <tt>std::move(y)</tt> to move from the incoming arguments
! (which are passed by value to candidates for moving) and the final sentence of the paragraph 
! should be:
! </p>
! <p>
! then calls <tt>OUTERMOST_ALLOC_TRAITS(*this)::construct(OUTERMOST (*this), p, piecewise_construct, 
! std::move(xprime), std::move(yprime))</tt>.
! </p>
! <p>
! so that the objects are passed to <tt>std::pair</tt>'s piecewise constructor as rvalues and 
! are eligible for moving into the constructor arguments. This could also be considered editorial, 
! as the current wording prevents certain uses which were intended to be supported.
! <p/>
! I've implemented these changes and can confirm they allow code to work that can't be compiled 
! according to the current wording.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! <p>
! The resolution looks good, with wording provided by a recent implementer.  However, it will take more
! time than the telecon allows to review with confidence, and we would like Pablo to at least take a
! look over the resolution and confirm that it matches the design intent.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change 20.13.4 [allocator.adaptor.members] paragraph 11 as indicated:</p>
! 
! <blockquote>
! <p>
! -11- <i>Effects</i>: Constructs a <tt>tuple</tt> object <tt>xprime</tt> from <tt>x</tt> by the following rules:
! </p>
! <ul>
! <li><p>
! If <tt>uses_allocator&lt;T1, inner_allocator_type&gt;::value</tt> is <tt>false</tt> and 
! <tt>is_constructible&lt;T1, Args1...&gt;::value</tt> is <tt>true</tt>, then <tt>xprime</tt> is <tt>x</tt>.
! </p></li>
! 
! <li><p>
! Otherwise, if <tt>uses_allocator&lt;T1, inner_allocator_type&gt;::value</tt> is <tt>true</tt> and 
! <tt>is_constructible&lt;T1, allocator_arg_t, inner_allocator_type, Args1...&gt;::value</tt> is <tt>true</tt>, 
! then <tt>xprime</tt> is <tt>tuple_cat(tuple&lt;allocator_arg_t, inner_allocator_type&amp;&gt;( allocator_arg, 
! inner_allocator<del>_type</del>()), <ins>std::move(</ins>x<ins>)</ins>)</tt>.
! </p></li>
! 
! <li><p>
! Otherwise, if <tt>uses_allocator&lt;T1, inner_allocator_type&gt;::value</tt> is <tt>true</tt> and 
! <tt>is_constructible&lt;T1, Args1..., inner_allocator_type&gt;::value</tt> is <tt>true</tt>, then <tt>xprime</tt> 
! is <tt>tuple_cat(<ins>std::move(</ins>x<ins>)</ins>, 
! tuple&lt;inner_allocator_type&amp;&gt;(inner_allocator<del>_type</del>()))</tt>.
! </p></li>
! 
! <li><p>
! Otherwise, the program is ill-formed.
! </p></li>
! </ul>
! <p>
! and constructs a <tt>tuple</tt> object <tt>yprime</tt> from <tt>y</tt> by the following rules:
! </p>
! <ul>
! <li><p>
! If <tt>uses_allocator&lt;T2, inner_allocator_type&gt;::value</tt> is <tt>false</tt> and 
! <tt>is_constructible&lt;T2, Args2...&gt;::value</tt> is <tt>true</tt>, then <tt>yprime</tt> is <tt>y</tt>.
! </p></li>
! 
! <li><p>
! Otherwise, if <tt>uses_allocator&lt;T2, inner_allocator_type&gt;::value</tt> is <tt>true</tt> and 
! <tt>is_constructible&lt;T2, allocator_arg_t, inner_allocator_type, Args2...&gt;::value</tt> is <tt>true</tt>, 
! then <tt>yprime</tt> is <tt>tuple_cat(tuple&lt;allocator_arg_t, inner_allocator_type&amp;&gt;( allocator_arg, 
! inner_allocator<del>_type</del>()), <ins>std::move(</ins>y<ins>)</ins>)</tt>.
! </p></li>
! 
! <li><p>
! Otherwise, if <tt>uses_allocator&lt;T2, inner_allocator_type&gt;::value</tt> is <tt>true</tt> and 
! <tt>is_constructible&lt;T2, Args2..., inner_allocator_type&gt;::value</tt> is <tt>true</tt>, then <tt>yprime</tt> 
! is <tt>tuple_cat(<ins>std::move(</ins>y<ins>)</ins>, 
! tuple&lt;inner_allocator_type&amp;&gt;(inner_allocator<del>_type</del>()))</tt>.
! </p></li>
! 
! <li><p>
! Otherwise, the program is ill-formed.
! </p></li>
! </ul>
! <p>
! then calls <tt><i>OUTERMOST_ALLOC_TRAITS</i>(*this)::construct(<i>OUTERMOST</i>(*this), p,
! piecewise_construct, <ins>std::move(</ins>xprime<ins>)</ins>, <ins>std::move(</ins>yprime<ins>)</ins>)</tt>.
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2205"></a>2205. Problematic postconditions of <tt>regex_match</tt> and <tt>regex_search</tt></h3>
! <p><b>Section:</b> 28.11.2 [re.alg.match], 28.11.3 [re.alg.search] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-10-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.alg.match">issues</a> in [re.alg.match].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! Table 142 lists post-conditions on the <tt>match_results</tt> object when a call to <tt>regex_match</tt> succeeds. 
! <tt>regex_match</tt> is required to match the entire target sequence. The post-condition for <tt>m[0].matched</tt> 
! is "true if a full match was found." Since these are conditions for a successful search which is, by definition, 
! a full match, the post-condition should be simply "true".
! </p>
! <p>
! There's an analogous probem in Table 143: the condition for <tt>m[0].matched</tt> is "true if a match was found, 
! false otherwise." But Table 143 gives post-conditions for a successful match, so the condition should be simply 
! "true".
! </p>
! <p>
! Furthermore, they have explicit requirements for <tt>m[0].first</tt>, <tt>m[0].second</tt>, and <tt>m[0].matched</tt>. 
! They also have requirements for the other elements of <tt>m</tt>, described as <tt>m[n].first</tt>, <tt>m[n].second</tt>, 
! and <tt>m[n].matched</tt>, in each case qualifying the value of <tt>n</tt> as "for <tt>n &lt; m.size()</tt>". Since 
! there is an explicit description for <tt>n == 0</tt>, this qualification should be "for <tt>0 &lt; n &lt; m.size()</tt>" 
! in all 6 places.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Change Table 142 as indicated:</p>
! 
! <table border="1">
! <caption>Table 142 &mdash; Effects of <tt>regex_match</tt> algorithm</caption>
! <tr>
! <th>Element</th>
! <th>Value</th>
! </tr> 
! 
! <tr>
! <td colspan="2" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[0].first</tt>
! </td>
! <td>
! <tt>first</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[0].second</tt>
! </td>
! <td>
! <tt>last</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[0].matched</tt>
! </td>
! <td>
! <tt>true</tt> <del>if a full match was found.</del>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[n].first</tt>
! </td>
! <td>
! For all integers <tt><ins>0 &lt;</ins> n &lt; m.size()</tt>, the start of the sequence
! that matched sub-expression <tt>n</tt>.<br/> 
! Alternatively, if subexpression <tt>n</tt> did not participate in the match, then <tt>last</tt>.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[n].second</tt>
! </td>
! <td>
! For all integers <tt><ins>0 &lt;</ins> n &lt; m.size()</tt>, the end of the sequence that
! matched sub-expression <tt>n</tt>.<br/> 
! Alternatively, if sub-expression <tt>n</tt> did not participate in the match, then <tt>last</tt>.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[n].matched</tt>
! </td>
! <td>
! For all integers <tt><ins>0 &lt;</ins> n &lt; m.size()</tt>, <tt>true</tt> if sub-expression 
! <tt>n</tt> participated in the match, <tt>false</tt> otherwise.
! </td>
! </tr>
! 
! </table>
! </li>
! 
! <li><p>Change Table 143 as indicated:</p>
! 
! <table border="1">
! <caption>Table 143 &mdash; Effects of <tt>regex_search</tt> algorithm</caption>
! <tr>
! <th>Element</th>
! <th>Value</th>
! </tr> 
! 
! <tr>
! <td colspan="2" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[0].first</tt>
! </td>
! <td>
! The start of the sequence of characters that matched the regular expression
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[0].second</tt>
! </td>
! <td>
! The end of the sequence of characters that matched the regular expression
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[0].matched</tt>
! </td>
! <td>
! <tt>true</tt> <del>if a match was found, and false otherwise.</del>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[n].first</tt>
! </td>
! <td>
! For all integers <tt><ins>0 &lt;</ins> n &lt; m.size()</tt>, the start of the sequence
! that matched sub-expression <tt>n</tt>.<br/> 
! Alternatively, if subexpression <tt>n</tt> did not participate in the match, then <tt>last</tt>.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[n].second</tt>
! </td>
! <td>
! For all integers <tt><ins>0 &lt;</ins> n &lt; m.size()</tt>, the end of the sequence that
! matched sub-expression <tt>n</tt>.<br/> 
! Alternatively, if sub-expression <tt>n</tt> did not participate in the match, then <tt>last</tt>.
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>m[n].matched</tt>
! </td>
! <td>
! For all integers <tt><ins>0 &lt;</ins> n &lt; m.size()</tt>, <tt>true</tt> if sub-expression 
! <tt>n</tt> participated in the match, <tt>false</tt> otherwise.
! </td>
! </tr>
! 
! </table>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2207"></a>2207. <tt>basic_string::at</tt> should not have a Requires clause</h3>
! <p><b>Section:</b> 21.4.5 [string.access] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nevin Liber <b>Opened:</b> 2012-10-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.access">issues</a> in [string.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! <tt>basic_string::at()</tt> has a wide contract and should not have a "Requires" clause on it.
! </p>
! 
! <p><i>[2013-01-17, Juan Soulie comments]</i></p>
! 
! 
! <p>This issue would also apply to every member function of <tt>basic_string</tt> that throws 
! <tt>out_of_range</tt>, and to some cases where a <tt>length_error</tt> can be thrown.</p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! <p>
! While this could simply move to Ready on inspection, there is concern that this will not be the
! only such case.  Alisdair volunteers to review clause 21/23 for more of such issues for Bristol,
! and update the proposed resolution as necessary.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Remove 21.4.5 [string.access] p5:</p>
! 
! <blockquote><pre>
! const_reference at(size_type pos) const;
! reference at(size_type pos);
! </pre><blockquote>
! <p>
! <del>-5- <i>Requires</i>: <tt>pos &lt; size()</tt></del>
! <p/>
! -6- <i>Throws</i>: <tt>out_of_range</tt> if <tt>pos &gt;= size()</tt>.
! <p/>
! -7- <i>Returns</i>: <tt>operator[](pos)</tt>.
! </p>
! </blockquote></blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2209"></a>2209. <tt>assign()</tt> overspecified for sequence containers</h3>
! <p><b>Section:</b> 23.3 [sequences] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-10-31 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequences">issues</a> in [sequences].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! DR <a href="lwg-defects.html#704">704</a> ensures allocator-aware containers can reuse existing
! elements during copy/move assignment, and sequence containers can do
! the same for <tt>assign()</tt>.
! <p/>
! But apart from <tt>std::list</tt> (which was changed by DR <a href="lwg-defects.html#320">320</a>) the sequence
! containers define the Effects of <tt>assign()</tt> in terms of <tt>clear()</tt> followed
! by <tt>insert</tt>.  A user-defined allocator can easily tell whether all old
! elements are cleared and then new elements inserted or whether existing elements are assigned 
! to, so those Effects clauses cannot be ignored via the as-if rule.
! <p/>
! The descriptions of the <tt>assign()</tt> members for <tt>deque</tt>, <tt>forward_list</tt> and
! <tt>vector</tt> should be removed.  Their intended effects are entirely described by the 
! sequence container requirements table, and the specific definitions of them are worse than 
! redundant, they're contradictory (if the operations are defined in terms of <tt>erase</tt> and
! <tt>insert</tt> then there's no need for elements to be assignable.)  The descriptions of 
! <tt>assign()</tt> for <tt>list</tt> are correct but redundant, so should be removed too.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3376.</p>
! 
! <ol>
! <li><p>Edit 23.3.3.2 [deque.cons] to remove everything after paragraph 10:</p>
! 
! <blockquote>
! <pre>
! <del>template &lt;class InputIterator&gt;
! void assign(InputIterator first, InputIterator last);</del>
! </pre>
! <blockquote>
! <p>
! <del>-11- <i>Effects</i>:</del>
! </p>
! <blockquote><pre>
! <del>erase(begin(), end());
! insert(begin(), first, last);</del>
! </pre></blockquote>
! </blockquote>
! 
! <pre>
! <del>void assign(size_type n, const T&amp; t);</del>
! </pre>
! <blockquote>
! <p>
! <del>-12- <i>Effects</i>:</del>
! </p>
! <blockquote><pre>
! <del>erase(begin(), end());
! insert(begin(), n, t);</del>
! </pre></blockquote>
! </blockquote>
! </blockquote>
! 
! </li>
! 
! <li><p>Edit 23.3.4.2 [forwardlist.cons] to remove everything after paragraph 10:</p>
! 
! <blockquote>
! <pre>
! <del>template &lt;class InputIterator&gt;
! void assign(InputIterator first, InputIterator last);</del>
! </pre>
! <blockquote>
! <p>
! <del>-11- <i>Effects</i>: <tt>clear(); insert_after(before_begin(), first, last);</tt></del>
! </p>
! </blockquote>
! 
! <pre>
! <del>void assign(size_type n, const T&amp; t);</del>
! </pre>
! <blockquote>
! <p>
! <del>-12- <i>Effects</i>: <tt>clear(); insert_after(before_begin(), n, t);</tt></del>
! </p>
! </blockquote>
! </blockquote>
! 
! </li>
! 
! <li><p>Edit 23.3.5.2 [list.cons] to remove everything after paragraph 10:</p>
! 
! <blockquote>
! <pre>
! <del>template &lt;class InputIterator&gt;
! void assign(InputIterator first, InputIterator last);</del>
! </pre>
! <blockquote>
! <p>
! <del>-11- <i>Effects</i>: Replaces the contents of the list with the range <tt>[first, last)</tt>.</del>
! </p>
! </blockquote>
! 
! <pre>
! <del>void assign(size_type n, const T&amp; t);</del>
! </pre>
! <blockquote>
! <p>
! <del>-12- <i>Effects</i>: Replaces the contents of the list with <tt>n</tt> copies of <tt>t</tt>.</del>
! </p>
! </blockquote>
! </blockquote>
! 
! </li>
! 
! <li><p>Edit 23.3.6.2 [vector.cons] to remove everything after paragraph 10:</p>
! 
! <blockquote>
! <pre>
! <del>template &lt;class InputIterator&gt;
! void assign(InputIterator first, InputIterator last);</del>
! </pre>
! <blockquote>
! <p>
! <del>-11- <i>Effects</i>:</del>
! </p>
! <blockquote><pre>
! <del>erase(begin(), end());
! insert(begin(), first, last);</del>
! </pre></blockquote>
! </blockquote>
! 
! <pre>
! <del>void assign(size_type n, const T&amp; t);</del>
! </pre>
! <blockquote>
! <p>
! <del>-12- <i>Effects</i>:</del>
! </p>
! <blockquote><pre>
! <del>erase(begin(), end());
! insert(begin(), n, t);</del>
! </pre></blockquote>
! </blockquote>
! </blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2210"></a>2210. Missing allocator-extended constructor for allocator-aware containers</h3>
! <p><b>Section:</b> 23.3 [sequences], 23.4 [associative], 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-11-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequences">issues</a> in [sequences].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The <tt>forward_list(size_type)</tt> constructor has no allocator-extended
! equivalent, preventing the following code from compiling:
! </p>
! <blockquote><pre>
! #include &lt;forward_list&gt;
! #include &lt;vector&gt;
! #include &lt;scoped_allocator&gt;
! 
! using namespace std;
! 
! int main()
! {
!   using list = forward_list&lt;int&gt;;
!   vector&lt;list, scoped_allocator_adaptor&lt;list::allocator_type&gt;&gt; v;
!   v.emplace_back(1u);
! }
! </pre></blockquote>
! <p>
! The very same problem exists for all allocator-aware sequence containers.
! <p/>
! In addition it exists for associative containers. For example, it's possible to construct 
! <tt>std::set&lt;int&gt;{0, 1, 2}</tt> but not <tt>std::set&lt;int&gt;{{0, 1, 2}, alloc}</tt>, 
! and possible to construct <tt>std::set&lt;int&gt;{begin, end}</tt> but not 
! <tt>std::set&lt;int&gt;{begin, end, alloc}</tt>.
! <p/>
! This makes the following program fail when <tt>SCOPED</tt> is defined:
! </p>
! <blockquote><pre>
! #include &lt;set&gt;
! #include &lt;vector&gt;
! #include &lt;scoped_allocator&gt;
! 
! #if SCOPED
! using A = std::scoped_allocator_adaptor&lt;std::allocator&lt;int&gt;&gt;;
! #else
! using A = std::allocator&lt;int&gt;;
! #endif
! 
! int main()
! {
!   int values[] = {0, 1, 2};
!   std::vector&lt;std::set&lt;int&gt;, A&gt; v;
!   v.emplace_back(std::begin(values), std::end(values));
! }
! </pre></blockquote>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! <p>
! Jonathan: There are lots of places where this is missing.
! </p>
! <p>
! Howard: We should ping Pablo, this might be a deliberate design decision.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Edit the synopsis in 23.3.3.1 [deque.overview]/2:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class T, class Allocator = allocator&lt;T&gt; &gt;
!   class deque {
!   public:
!     [&hellip;]
!     explicit deque(const Allocator&amp; = Allocator());
!     explicit deque(size_type n<ins>, const Allocator&amp; = Allocator()</ins>);
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Edit 23.3.3.2 [deque.cons]/2:</p>
! 
! <blockquote>
! <pre>
! explicit deque(size_type n<ins>, const Allocator&amp; = Allocator()</ins>);
! </pre>
! <blockquote>
! <p>
! -3- <i>Effects</i>: Constructs a <tt>deque</tt> with <tt>n</tt> default-inserted elements
! <ins>using the specified allocator</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit the synopsis in 23.3.4.1 [forwardlist.overview]/3:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class T, class Allocator = allocator&lt;T&gt; &gt;
!   class forward_list {
!   public:
!     [&hellip;]
!     explicit forward_list(const Allocator&amp; = Allocator());
!     explicit forward_list(size_type n<ins>, const Allocator&amp; = Allocator()</ins>);
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Edit 23.3.4.2 [forwardlist.cons]/3:</p>
! 
! <blockquote>
! <pre>
! explicit forward_list(size_type n<ins>, const Allocator&amp; = Allocator()</ins>);
! </pre>
! <blockquote>
! <p>
! -3- <i>Effects</i>: Constructs a <tt>forward_list</tt> object with <tt>n</tt> default-inserted elements
! <ins>using the specified allocator</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit the synopsis in 23.3.5.1 [list.overview]/2:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class T, class Allocator = allocator&lt;T&gt; &gt;
!   class list {
!   public:
!     [&hellip;]
!     explicit list(const Allocator&amp; = Allocator());
!     explicit list(size_type n<ins>, const Allocator&amp; = Allocator()</ins>);
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Edit 23.3.5.2 [list.cons]/3:</p>
! 
! <blockquote>
! <pre>
! explicit list(size_type n<ins>, const Allocator&amp; = Allocator()</ins>);
! </pre>
! <blockquote>
! <p>
! -3- <i>Effects</i>: Constructs a <tt>list</tt> with <tt>n</tt> default-inserted elements
! <ins>using the specified allocator</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit the synopsis in 23.3.6.1 [vector.overview]/2:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class T, class Allocator = allocator&lt;T&gt; &gt;
!   class vector {
!   public:
!     [&hellip;]
!     explicit vector(const Allocator&amp; = Allocator());
!     explicit vector(size_type n<ins>, const Allocator&amp; = Allocator()</ins>);
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Edit 23.3.6.2 [vector.cons]/3:</p>
! 
! <blockquote>
! <pre>
! explicit vector(size_type n<ins>, const Allocator&amp; = Allocator()</ins>);
! </pre>
! <blockquote>
! <p>
! -3- <i>Effects</i>: Constructs a <tt>vector</tt> with <tt>n</tt> default-inserted elements
! <ins>using the specified allocator</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit the synopsis in 23.3.7 [vector.bool]/1:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class Allocator&gt; class vector&lt;bool, Allocator&gt; {
!   class vector {
!   public:
!     [&hellip;]
!     explicit vector(const Allocator&amp; = Allocator());
!     <ins>explicit vector(size_type n, const Allocator&amp; = Allocator());</ins>
!     <del>explicit</del> vector(size_type n, const bool&amp; value<del> = bool()</del>,
!                     const Allocator&amp; = Allocator());
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Add to the synopsis in 23.4.4.1 [map.overview] p2:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class Key, class T, class Compare = less&lt;Key&gt;,
!     class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt; {
!   class map {
!   public:
!     [&hellip;]
!     map(initializer_list&lt;value_type&gt;,
!       const Compare&amp; = Compare(),
!       const Allocator&amp; = Allocator());
!     <ins>template &lt;class InputIterator&gt;
!     map(InputIterator first, InputIterator last, const Allocator&amp; a)
!       : map(first, last, Compare(), a) { }
!     map(initializer_list&lt;value_type&gt; il, const Allocator&amp; a)
!       : map(il, Compare(), a) { }</ins>
!     ~map();
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Add to the synopsis in 23.4.5.1 [multimap.overview] p2:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class Key, class T, class Compare = less&lt;Key&gt;,
!     class Allocator = allocator&lt;pair&lt;const Key, T&gt; &gt; &gt; {
!   class multimap {
!   public:
!     [&hellip;]
!     multimap(initializer_list&lt;value_type&gt;,
!       const Compare&amp; = Compare(),
!       const Allocator&amp; = Allocator());
!     <ins>template &lt;class InputIterator&gt;
!     multimap(InputIterator first, InputIterator last, const Allocator&amp; a)
!       : multimap(first, last, Compare(), a) { }
!     multimap(initializer_list&lt;value_type&gt; il, const Allocator&amp; a)
!       : multimap(il, Compare(), a) { }</ins>
!     ~multimap();
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Add to the synopsis in 23.4.6.1 [set.overview] p2:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class Key, class Compare = less&lt;Key&gt;,
!     class Allocator = allocator&lt;Key&gt; &gt; {
!   class set {
!   public:
!     [&hellip;]
!     set(initializer_list&lt;value_type&gt;,
!       const Compare&amp; = Compare(),
!       const Allocator&amp; = Allocator());
!     <ins>template &lt;class InputIterator&gt;
!     set(InputIterator first, InputIterator last, const Allocator&amp; a)
!       : set(first, last, Compare(), a) { }
!     set(initializer_list&lt;value_type&gt; il, const Allocator&amp; a)
!       : set(il, Compare(), a) { }</ins>
!     ~set();
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Add to the synopsis in 23.4.7.1 [multiset.overview] p2:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class Key, class Compare = less&lt;Key&gt;,
!     class Allocator = allocator&lt;Key&gt; &gt; {
!   class multiset {
!   public:
!     [&hellip;]
!     multiset(initializer_list&lt;value_type&gt;,
!       const Compare&amp; = Compare(),
!       const Allocator&amp; = Allocator());
!     <ins>template &lt;class InputIterator&gt;
!     multiset(InputIterator first, InputIterator last, const Allocator&amp; a)
!       : multiset(first, last, Compare(), a) { }
!     multiset(initializer_list&lt;value_type&gt; il, const Allocator&amp; a)
!       : multiset(il, Compare(), a) { }</ins>
!     ~multiset();
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Add to the synopsis in 23.5.4.1 [unord.map.overview] p3:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class Key, class T,
!     class Hash = hash&lt;Key&gt;,
!     class Pred = std::equal_to&lt;Key&gt;,
!     class Allocator = std::allocator&lt;std::pair&lt;const Key, T&gt; &gt; &gt; {
!   class unordered_map {
!   public:
!     [&hellip;]
!     unordered_map(initializer_list&lt;value_type&gt;,
!       size_type = <em>see below</em>,
!       const hasher&amp; hf = hasher(),
!       const key_equal&amp; eql = key_equal(),
!       const allocator_type&amp; a = allocator_type());
!     <ins>unordered_map(size_type n, const allocator_type&amp; a)
!       : unordered_map(n, hasher(), key_equal(), a) { }
!     unordered_map(size_type n, const hasher&amp; hf, const allocator_type&amp; a)
!       : unordered_map(n, hf, key_equal(), a) { }
!     template &lt;class InputIterator&gt;
!       unordered_map(InputIterator f, InputIterator l, size_type n, const allocator_type&amp; a)
!       : unordered_map(f, l, n, hasher(), key_equal(), a) { }
!     template &lt;class InputIterator&gt;
!       unordered_map(InputIterator f, InputIterator l, size_type n, const hasher&amp; hf, 
! 	    const allocator_type&amp; a)
!       : unordered_map(f, l, n, hf, key_equal(), a) { }
!     unordered_map(initializer_list&lt;value_type&gt; il, size_type n, const allocator_type&amp; a)
!       : unordered_map(il, n, hasher(), key_equal(), a) { }
!     unordered_map(initializer_list&lt;value_type&gt; il, size_type n, const hasher&amp; hf, 
! 	  const allocator_type&amp; a)
!       : unordered_map(il, n, hf, key_equal(), a) { }</ins>
!     ~unordered_map();
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Add to the synopsis in 23.5.5.1 [unord.multimap.overview] p3:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class Key, class T,
!     class Hash = hash&lt;Key&gt;,
!     class Pred = std::equal_to&lt;Key&gt;,
!     class Allocator = std::allocator&lt;std::pair&lt;const Key, T&gt; &gt; &gt; {
!   class unordered_multimap {
!   public:
!     [&hellip;]
!     unordered_multimap(initializer_list&lt;value_type&gt;,
!       size_type = <em>see below</em>,
!       const hasher&amp; hf = hasher(),
!       const key_equal&amp; eql = key_equal(),
!       const allocator_type&amp; a = allocator_type());
!     <ins>unordered_multimap(size_type n, const allocator_type&amp; a)
!       : unordered_multimap(n, hasher(), key_equal(), a) { }
!     unordered_multimap(size_type n, const hasher&amp; hf, const allocator_type&amp; a)
!       : unordered_multimap(n, hf, key_equal(), a) { }
!     template &lt;class InputIterator&gt;
!       unordered_multimap(InputIterator f, InputIterator l, size_type n, const allocator_type&amp; a)
!       : unordered_multimap(f, l, n, hasher(), key_equal(), a) { }
!     template &lt;class InputIterator&gt;
!       unordered_multimap(InputIterator f, InputIterator l, size_type n, const hasher&amp; hf, 
! 	    const allocator_type&amp; a)
!       : unordered_multimap(f, l, n, hf, key_equal(), a) { }
!     unordered_multimap(initializer_list&lt;value_type&gt; il, size_type n, const allocator_type&amp; a)
!       : unordered_multimap(il, n, hasher(), key_equal(), a) { }
!     unordered_multimap(initializer_list&lt;value_type&gt; il, size_type n, const hasher&amp; hf, 
! 	  const allocator_type&amp; a)
!       : unordered_multimap(il, n, hf, key_equal(), a) { }</ins>
!     ~unordered_multimap();
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Add to the synopsis in 23.5.6.1 [unord.set.overview] p3:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class Key,
!     class Hash = hash&lt;Key&gt;,
!     class Pred = std::equal_to&lt;Key&gt;,
!     class Allocator = std::allocator&lt;Key&gt; &gt; {
!   class unordered_set {
!   public:
!     [&hellip;]
!     unordered_set(initializer_list&lt;value_type&gt;,
!       size_type = <em>see below</em>,
!       const hasher&amp; hf = hasher(),
!       const key_equal&amp; eql = key_equal(),
!       const allocator_type&amp; a = allocator_type());
!     <ins>unordered_set(size_type n, const allocator_type&amp; a)
!       : unordered_set(n, hasher(), key_equal(), a) { }
!     unordered_set(size_type n, const hasher&amp; hf, const allocator_type&amp; a)
!       : unordered_set(n, hf, key_equal(), a) { }
!     template &lt;class InputIterator&gt;
!       unordered_set(InputIterator f, InputIterator l, size_type n, const allocator_type&amp; a)
!       : unordered_set(f, l, n, hasher(), key_equal(), a) { }
!     template &lt;class InputIterator&gt;
!       unordered_set(InputIterator f, InputIterator l, size_type n, const hasher&amp; hf, 
! 	    const allocator_type&amp; a)
!       : unordered_set(f, l, n, hf, key_equal(), a) { }
!     unordered_set(initializer_list&lt;value_type&gt; il, size_type n, const allocator_type&amp; a)
!       : unordered_set(il, n, hasher(), key_equal(), a) { }
!     unordered_set(initializer_list&lt;value_type&gt; il, size_type n, const hasher&amp; hf, 
! 	  const allocator_type&amp; a)
!       : unordered_set(il, n, hf, key_equal(), a) { }</ins>
!     ~unordered_set();
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Add to the synopsis in 23.5.7.1 [unord.multiset.overview] p3:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   template &lt;class Key,
!     class Hash = hash&lt;Key&gt;,
!     class Pred = std::equal_to&lt;Key&gt;,
!     class Allocator = std::allocator&lt;Key&gt; &gt; {
!   class unordered_multiset {
!   public:
!     [&hellip;]
!     unordered_multiset(initializer_list&lt;value_type&gt;,
!       size_type = <em>see below</em>,
!       const hasher&amp; hf = hasher(),
!       const key_equal&amp; eql = key_equal(),
!       const allocator_type&amp; a = allocator_type());
!     <ins>unordered_multiset(size_type n, const allocator_type&amp; a)
!       : unordered_multiset(n, hasher(), key_equal(), a) { }
!     unordered_multiset(size_type n, const hasher&amp; hf, const allocator_type&amp; a)
!       : unordered_multiset(n, hf, key_equal(), a) { }
!     template &lt;class InputIterator&gt;
!       unordered_multiset(InputIterator f, InputIterator l, size_type n, const allocator_type&amp; a)
!       : unordered_multiset(f, l, n, hasher(), key_equal(), a) { }
!     template &lt;class InputIterator&gt;
!       unordered_multiset(InputIterator f, InputIterator l, size_type n, const hasher&amp; hf, 
! 	    const allocator_type&amp; a)
!       : unordered_multiset(f, l, n, hf, key_equal(), a) { }
!     unordered_multiset(initializer_list&lt;value_type&gt; il, size_type n, const allocator_type&amp; a)
!       : unordered_multiset(il, n, hasher(), key_equal(), a) { }
!     unordered_multiset(initializer_list&lt;value_type&gt; il, size_type n, const hasher&amp; hf, 
! 	  const allocator_type&amp; a)
!       : unordered_multiset(il, n, hf, key_equal(), a) { }</ins>
!     ~unordered_multiset();
!     [&hellip;]
!   };
! }
! </pre>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2211"></a>2211. Replace ambiguous use of "Allocator" in container requirements</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-11-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 23.2.1 [container.requirements.general]/7 says:
! </p>
! <blockquote><p>
! All other constructors for these container types take an <tt>Allocator&amp;</tt> argument 
! (17.6.3.5 [allocator.requirements]), an allocator whose value type is the same as the
! container's value type.
! </p></blockquote>
! <p>
! This is a strange place to state the requirement on the allocator's
! <tt>value_type</tt>, because the allocator is a property (and template
! parameter) of the container type not of some of its constructors.
! It's also unclear whether "<tt>Allocator&amp;</tt>" refers to the concept (as
! implied by the cross-reference to the allocator requirements in Clause 17) 
! or to the container's template parameter (as implied by the fact
! it's shown as an lvalue-reference type.) I believe the latter is
! intended, because those constructors can't take any model of the
! allocator concept, they can only take the container's <tt>allocator_type</tt>.
! <p/>
! I think it would be clearer to remove the value type requirement earlier
! in the paragraph (Table 99 already imposes that requirement) and to make it clear 
! the constructor arguments are the container's <tt>allocator_type</tt>. There is 
! already a cross-reference to the allocator requirements earlier in the paragraph, 
! so it doesn't need to be repeated in another place where it causes confusion.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Edit 23.2.1 [container.requirements.general] paragraph 7:</p>
! 
! <blockquote>
! <p>
! Unless otherwise specified, all containers defined in this clause obtain memory using an allocator 
! (see 17.6.3.5 [allocator.requirements]). Copy constructors for these container types obtain an 
! allocator by calling <tt>allocator_traits&lt;allocator_type&gt;::select_on_container_copy_construction</tt> 
! on their first parameters. Move constructors obtain an allocator by move construction from the allocator 
! belonging to the container being moved. Such move construction of the allocator shall not exit via 
! an exception. All other constructors for these container types take <del>an <tt>Allocator&amp;</tt> argument 
! (17.6.3.5 [allocator.requirements]), an allocator whose value type is the same as the container's value
! type</del><ins>a <tt>const allocator_type&amp;</tt> argument</ins>. [<i>Note</i>: If an invocation of a 
! constructor uses the default value of an optional allocator argument, then the <tt>Allocator</tt> type 
! must support value initialization. &mdash; <i>end note</i>] A copy of this allocator is used for any
! memory allocation performed, by these constructors and by all member functions, during the lifetime of each
! container object or until the allocator is replaced. [&hellip;]
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2212"></a>2212. <tt>tuple_size</tt> for <tt>const pair</tt> request <tt>&lt;tuple&gt;</tt> header</h3>
! <p><b>Section:</b> 20.2 [utility] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Alisdair Meredith <b>Opened:</b> 2012-11-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#utility">active issues</a> in [utility].</p>
! <p><b>View all other</b> <a href="lwg-index.html#utility">issues</a> in [utility].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The <tt>&lt;utility&gt;</tt> header declares sufficient of the tuple API to specialize
! the necessary templates for <tt>pair</tt>, notably <tt>tuple_size</tt> and
! <tt>tuple_element</tt>.  However, it does not make available the partial specializations
! that support cv-qualified template arguments, so while I can write the following after
! including only <tt>&lt;utility&gt;</tt>: 
! </p>
! <blockquote><pre>
! #include &lt;utility&gt;
! 
! using TestType = std::pair&lt;int, int&gt;;
! static_assert(2 == std::tuple_size&lt;TestType&gt;(), "Pairs have two elements");
! std::tuple_element&lt;0, TestType&gt;::type var{1};
! </pre></blockquote>
! <p>
! the following may fail to compile unless I also include <tt>&lt;tuple&gt;</tt>:
! </p>
! <blockquote><pre>
! #include &lt;utility&gt;
! 
! using TestType = const std::pair&lt;int, int&gt;;
! static_assert(2 == std::tuple_size&lt;TestType&gt;(), "Pairs have two elements");
! std::tuple_element&lt;0, TestType&gt;::type var{1};
! </pre></blockquote>
! <p>
! Note, however, that the latter <em>may</em> compile with some standard library implementations
! but not others, leading to subtle portability issues.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
! </p>
! <p>
! Howard notes that we have the same issue with array, so any resolution should apply to that header too.
! </p>
! 
! <p><i>[2013-10-18 Daniel provides wording]</i></p>
! 
! 
! <p>
! The suggested wording uses a similar approach as we already have in 24.7 [iterator.range] to
! ensure that the range access templates are available when at least one of an enumerated list of header files is
! included.
! <p/>
! I also think that the restricted focus on <tt>tuple_size</tt> of this issue is too narrow and should be extended to
! the similar partial template specializations of <tt>tuple_element</tt> as well. Therefore the suggested wording
! ensures this as well.
! </p>
! 
! <p><i>[2014-03-27 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on eight votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.4.2.5 [tuple.helper] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class T&gt; class tuple_size&lt;const T&gt;;
! template &lt;class T&gt; class tuple_size&lt;volatile T&gt;;
! template &lt;class T&gt; class tuple_size&lt;const volatile T&gt;;
! </pre><blockquote>
! <p>
! -3- Let <tt><i>TS</i></tt> denote <tt>tuple_size&lt;T&gt;</tt> of the <i>cv</i>-unqualified type <tt>T</tt>. Then 
! each of the three templates shall meet the <tt>UnaryTypeTrait</tt> requirements (20.10.1) with a <tt>BaseCharacteristic</tt> of
! </p>
! <blockquote><pre>
! integral_constant&lt;size_t, <i>TS</i>::value&gt;
! </pre></blockquote>
! <p>
! <ins>-?- In addition to being available via inclusion of the <tt>&lt;tuple&gt;</tt> header, each of the three templates are
! available when any of the headers <tt>&lt;array&gt;</tt> or <tt>&lt;utility&gt;</tt> are included.</ins>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! template &lt;size_t I, class T&gt; class tuple_element&lt;I, const T&gt;;
! template &lt;size_t I, class T&gt; class tuple_element&lt;I, volatile T&gt;;
! template &lt;size_t I, class T&gt; class tuple_element&lt;I, const volatile T&gt;;
! </pre><blockquote>
! <p>
! <ins>-?-</ins> Let <tt><i>TE</i></tt> denote <tt>tuple_element&lt;I, T&gt;</tt> of the <i>cv</i>-unqualified type <tt>T</tt>. 
! Then each of the three templates shall meet the <tt>TransformationTrait</tt> requirements (20.10.1) with a member typedef 
! <tt>type</tt> that names the following type:
! </p>
! <ul>
! <li><p>
! for the first specialization, <tt>add_const&lt;<i>TE</i>::type&gt;::type</tt>,
! </p></li>
! <li><p>
! for the second specialization, <tt>add_volatile&lt;<i>TE</i>::type&gt;::type</tt>, and
! </p></li>
! <li><p>
! for the third specialization, <tt>add_cv&lt;<i>TE</i>::type&gt;::type</tt>.
! </p></li>
! </ul>
! <p>
! <ins>-?- In addition to being available via inclusion of the <tt>&lt;tuple&gt;</tt> header, each of the three templates are
! available when any of the headers <tt>&lt;array&gt;</tt> or <tt>&lt;utility&gt;</tt> are included.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2213"></a>2213. Return value of <tt>std::regex_replace</tt></h3>
! <p><b>Section:</b> 28.11.4 [re.alg.replace] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Pete Becker <b>Opened:</b> 2012-11-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.alg.replace">issues</a> in [re.alg.replace].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 28.11.4 [re.alg.replace], the first two variants of <tt>std::regex_replace</tt> take an output iterator named 
! "out" as their first argument. Paragraph 2 of that section says that the functions return "out". When I first implemented 
! this, many years ago, I wrote it to return the value of the output iterator after all the insertions (cf. <tt>std::copy</tt>), 
! which seems like the most useful behavior. But looking at the requirement now, it like the functions should return the 
! original value of "out" (i.e. they have to keep a copy of the iterator for no reason except to return it). Is that 
! really what was intended?
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Edit 28.11.4 [re.alg.replace] as indicated:</p>
! <blockquote><pre>
! template &lt;class OutputIterator, class BidirectionalIterator,
!   class traits, class charT, class ST, class SA&gt;
! OutputIterator
! regex_replace(OutputIterator out, BidirectionalIterator first, BidirectionalIterator last,
!   const basic_regex&lt;charT, traits&gt;&amp; e, const basic_string&lt;charT, ST, SA&gt;&amp; fmt,
!   regex_constants::match_flag_type flags = regex_constants::match_default);
! template &lt;class OutputIterator, class BidirectionalIterator,
!   class traits, class charT&gt;
! OutputIterator
! regex_replace(OutputIterator out, BidirectionalIterator first, BidirectionalIterator last,
!   const basic_regex&lt;charT, traits&gt;&amp; e, const charT* fmt,
!   regex_constants::match_flag_type flags = regex_constants::match_default);
! </pre><blockquote>
! <p>
! -1- <i>Effects</i>: Constructs a <tt>regex_iterator</tt> object <tt>i</tt> as if by 
! <tt>regex_iterator&lt;BidirectionalIterator, charT, traits&gt; i(first, last, e, flags)</tt>, 
! and uses <tt>i</tt> to enumerate through all of the matches <tt>m</tt> of type 
! <tt>match_results&lt;BidirectionalIterator&gt;</tt> that occur within the sequence <tt>[first, last)</tt>. 
! If no such matches are found and <tt>!(flags &amp; regex_constants ::format_no_copy)</tt> then calls
! <tt><ins>out = </ins>std::copy(first, last, out)</tt>. If any matches are found then, for each such match, if 
! <tt>!(flags &amp; regex_constants::format_no_copy)</tt>, calls <tt><ins>out = </ins>std::copy(m.prefix().first, 
! m.prefix().second, out)</tt>, and then calls <tt><ins>out = </ins>m.format(out, fmt, flags)</tt> 
! for the first form of the function and <tt><ins>out = </ins>m.format(out, fmt, fmt + 
! char_traits&lt;charT&gt;::length(fmt), flags)</tt> for the second. Finally, if such a match is found 
! and <tt>!(flags &amp; regex_constants ::format_no_copy)</tt>, calls 
! <tt><ins>out = </ins>std::copy(last_m.suffix().first, last_m.suffix().second, out)</tt> where 
! <tt>last_m</tt> is a copy of the last match found. If <tt>flags &amp; regex_constants::format_first_only</tt> 
! is non-zero then only the first match found is replaced.
! <p/>
! -2- <i>Returns</i>: <tt>out</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2217"></a>2217. <tt>operator==(sub_match, string)</tt> slices on embedded <tt>'\0'</tt>s</h3>
! <p><b>Section:</b> 28.9.2 [re.submatch.op] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2012-11-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.submatch.op">issues</a> in [re.submatch.op].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
!   bool operator==(
!     const basic_string&lt;
!       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
!     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre></blockquote>
! <p>
! is specified as:
! </p>
! <blockquote><p>
! <i>Returns</i>: <tt>rhs.compare(lhs.c_str()) == 0</tt>.
! </p></blockquote>
! <p>
! This is odd because <tt>sub_match::compare(basic_string)</tt> is defined to
! honor embedded <tt>'\0'</tt> characters. This could allow a <tt>sub_match</tt> to <tt>==</tt> or
! <tt>!=</tt> a <tt>std::string</tt> unexpectedly.
! </p>
! 
! <p><i>[Daniel:]</i></p>
! 
! <p>
! This wording change was done intentionally as of LWG <a href="lwg-defects.html#1181">1181</a>, but the here mentioned slicing
! effect was not considered at that time. It seems best to use another overload of compare to fix this problem:
! </p>
! <blockquote><p>
! <i>Returns</i>: <tt>rhs.str().compare(0, rhs.length(), lhs.data(), lhs.size()) == 0</tt>.
! </p></blockquote>
! <p>
! or
! </p>
! <blockquote><p>
! <i>Returns</i>: <tt>rhs.compare(sub_match&lt;BiIter&gt;::string_type(lhs.data(), lhs.size())) == 0</tt>.
! </p></blockquote>
! 
! <p><i>[2013-10-17: Daniel provides concrete wording]</i></p>
! 
! 
! <p>
! The original wording was suggested to reduce the need to allocate memory during comparisons. The specification would be
! very much easier, if <tt>sub_match</tt> would provide an additional <tt>compare</tt> overload of the form:
! </p>
! <blockquote><pre>
! int compare(const value_type* s, size_t n) const;
! </pre></blockquote>
! <p>
! But given the fact that currently <em>all</em> of <tt>basic_string</tt>'s <tt>compare</tt> overloads are defined in terms
! of temporary string constructions, the following proposed wording does follow the same string-construction route as 
! <tt>basic_string</tt> does (where needed to fix the embedded zeros issue) and to hope that existing implementations
! ignore to interpret this semantics in the literal sense.
! <p/>
! I decided to use the second replacement form
! </p>
! <blockquote><pre>
! <i>Returns</i>: <tt>rhs.compare(sub_match&lt;BiIter&gt;::string_type(lhs.data(), lhs.size())) == 0</tt>.
! </pre></blockquote>
! <p>
! because it already reflects the existing style used in 28.9.2 [re.submatch.op] p31.
! </p>
! 
! 
! <p><i>[2014-02-15 post-Issaquah session : move to Tentatively Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 28.9.2 [re.submatch.op] as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
!   bool operator==(
!     const basic_string&lt;
!       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
!     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><blockquote>
! <p>
! -7- <i>Returns:</i> <tt>rhs.compare(<del>lhs.c_str()</del><ins>typename sub_match&lt;BiIter&gt;::string_type(lhs.data(), lhs.size())</ins>) == 0</tt>.
! </p>
! </blockquote></blockquote>
! <p>
! [&hellip;]
! </p>
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
!   bool operator&lt;(
!     const basic_string&lt;
!       typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA&gt;&amp; lhs,
!     const sub_match&lt;BiIter&gt;&amp; rhs);
! </pre><blockquote>
! <p>
! -9- <i>Returns:</i> <tt>rhs.compare(<del>lhs.c_str()</del><ins>typename sub_match&lt;BiIter&gt;::string_type(lhs.data(), lhs.size())</ins>) &gt; 0</tt>.
! </p>
! </blockquote></blockquote>
! <p>
! [&hellip;]
! </p>
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
!   bool operator==(const sub_match&lt;BiIter&gt;&amp; lhs,
!                   const basic_string&lt;
!                     typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA>&amp; rhs);
! </pre><blockquote>
! <p>
! -13- <i>Returns:</i> <tt>lhs.compare(<del>rhs.c_str()</del><ins>typename sub_match&lt;BiIter&gt;::string_type(rhs.data(), rhs.size())</ins>) == 0</tt>.
! </p>
! </blockquote></blockquote>
! <p>
! [&hellip;]
! </p>
! <blockquote><pre>
! template &lt;class BiIter, class ST, class SA&gt;
!   bool operator&lt;(const sub_match&lt;BiIter&gt;&amp; lhs,
!                  const basic_string&lt;
!                    typename iterator_traits&lt;BiIter&gt;::value_type, ST, SA>&amp; rhs);
! </pre><blockquote>
! <p>
! -15- <i>Returns:</i> <tt>lhs.compare(<del>rhs.c_str()</del><ins>typename sub_match&lt;BiIter&gt;::string_type(rhs.data(), rhs.size())</ins>) &lt; 0</tt>.
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! </pre><blockquote>
! <p>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! </pre><blockquote>
! <p>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! </pre><blockquote>
! <p>
! </p>
! </blockquote></blockquote>
! 
! <blockquote><pre>
! </pre><blockquote>
! <p>
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2222"></a>2222. Inconsistency in description of <tt>forward_list::splice_after</tt> single-element overload</h3>
! <p><b>Section:</b> 23.3.4.6 [forwardlist.ops] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Edward Catmur <b>Opened:</b> 2012-12-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#forwardlist.ops">issues</a> in [forwardlist.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 23.3.4.6 [forwardlist.ops] p6 has
! </p>
! <blockquote><pre>
! void splice_after(const_iterator position, forward_list&amp; x, const_iterator i);
! void splice_after(const_iterator position, forward_list&amp;&amp; x, const_iterator i);
! </pre><p>
! <i>Effects</i>: Inserts the element following <tt>i</tt> into <tt>*this</tt>, following <tt>position</tt>, 
! and removes it from <tt>x</tt>. The result is unchanged if <tt>position == i</tt> or <tt>position == ++i</tt>. 
! Pointers and references to <tt>*i</tt> continue to refer to the same element but as a member of <tt>*this</tt>. 
! Iterators to <tt>*i</tt> (including <tt>i</tt> itself) continue to refer to the same element, but now behave 
! as iterators into <tt>*this</tt>, not into <tt>x</tt>.
! </p>
! </blockquote>
! <p>
! This overload splices the element <em>following</em> <tt>i</tt> from <tt>x</tt> to <tt>*this</tt>, so the 
! language in the two latter sentences should refer to <tt>++i</tt>:
! </p>
! <blockquote><p>
! Pointers and references to <tt>*++i</tt> continue to refer to the same element but as a member of
! <tt>*this</tt>. Iterators to <tt>*++i</tt> continue to refer to the same element, but now behave as iterators
! into <tt>*this</tt>, not into <tt>x</tt>.
! </p></blockquote>
! <p>
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Edit 23.3.4.6 [forwardlist.ops] p6 as indicated:</p>
! <blockquote><pre>
! void splice_after(const_iterator position, forward_list&amp; x, const_iterator i);
! void splice_after(const_iterator position, forward_list&amp;&amp; x, const_iterator i);
! </pre>
! <p>
! -5- <i>Requires</i>: <tt>position</tt> is <tt>before_begin()</tt> or is a dereferenceable iterator 
! in the range <tt>[begin(),end())</tt>. The iterator following <tt>i</tt> is a dereferenceable iterator 
! in <tt>x</tt>. <tt>get_allocator() == x.get_allocator()</tt>.
! <p/>
! -6- <i>Effects</i>: Inserts the element following <tt>i</tt> into <tt>*this</tt>, following <tt>position</tt>, 
! and removes it from <tt>x</tt>. The result is unchanged if <tt>position == i</tt> or <tt>position == ++i</tt>. 
! Pointers and references to <tt>*<ins>++</ins>i</tt> continue to refer to the same element but as a member of 
! <tt>*this</tt>. Iterators to <tt>*<ins>++</ins>i</tt> <del>(including <tt>i</tt> itself)</del> continue to
! refer to the same element, but now behave as iterators into <tt>*this</tt>, not into <tt>x</tt>.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2225"></a>2225. Unrealistic header inclusion checks required</h3>
! <p><b>Section:</b> 17.6.2.2 [using.headers] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2012-12-18 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#using.headers">issues</a> in [using.headers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 17.6.2.2 [using.headers]/3 says:
! <p/>
! A translation unit shall include a header only outside of any external declaration or definition, and shall 
! include the header lexically before the first reference in that translation unit to any of the entities 
! declared in that header.
! <p/>
! Per 1.4 [intro.compliance]/1, programs which violate this rule are ill-formed, and a conforming 
! implementation is required to produce a diagnostic. This does not seem to match reality. Presumably, this 
! paragraph is missing a "no diagnostic is required".
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Edit 17.6.2.2 [using.headers] p3 as indicated:</p>
! <p>-3- A translation unit shall include a header only outside of any external declaration or definition, and shall
! include the header lexically before the first reference in that translation unit to any of the entities declared
! in that header. <ins>No diagnostic is required.</ins></p>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2228"></a>2228. Missing <em>SFINAE</em> rule in <tt>unique_ptr</tt> templated assignment</h3>
! <p><b>Section:</b> 20.8.1.2.3 [unique.ptr.single.asgn] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Geoffrey Romer <b>Opened:</b> 2012-12-20 <b>Last modified:</b> 2015-05-06</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.asgn">issues</a> in [unique.ptr.single.asgn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! 20.8.1.2.3 [unique.ptr.single.asgn]/5 permits <tt>unique_ptr</tt>'s templated assignment operator to participate 
! in overload resolution even when incompatibilities between <tt>D</tt> and <tt>E</tt> will render the result ill-formed, 
! but the corresponding templated copy constructor is removed from the overload set in those situations (see the third 
! bullet point of 20.8.1.2.1 [unique.ptr.single.ctor]/19). This asymmetry is confusing, and presumably unintended; 
! it may lead to situations where constructing one <tt>unique_ptr</tt> from another is well-formed, but assigning from 
! the same <tt>unique_ptr</tt> would be ill-formed.
! <p/>
! There is a slight coupling between this and LWG <a href="lwg-defects.html#2118">2118</a>, in that my PR for LWG <a href="lwg-defects.html#2118">2118</a> incorporates 
! equivalent wording in the specification of the templated assignment operator for the array specialization; the two PRs 
! are logically independent, but if my PR for <a href="lwg-defects.html#2118">2118</a> is accepted but the above PR is not, the discrepancy 
! between the base template and the specialization could be confusing.
! </p>
! 
! <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to N3485.</p>
! <ol>
! <li><p>Revise 20.8.1.2.3 [unique.ptr.single.asgn] p5 as follows:</p>
! 
! <blockquote><pre>
! template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u) noexcept;
! </pre><blockquote>
! <p>
! -4- <i>Requires</i>: If <tt>E</tt> is not a reference type, assignment of the deleter from an rvalue of type <tt>E</tt> 
! shall be well-formed and shall not throw an exception. Otherwise, <tt>E</tt> is a reference type and assignment of the
! deleter from an lvalue of type <tt>E</tt> shall be well-formed and shall not throw an exception.
! <p/>
! -5- <i>Remarks</i>: This operator shall not participate in overload resolution unless:
! </p>
! <ul>
! <li><p><tt>unique_ptr&lt;U, E&gt;::pointer</tt> is implicitly convertible to <tt>pointer</tt> and</p></li>
! <li><p><tt>U</tt> is not an array type<del>.</del><ins>, and</ins></p></li>
! <li><p><ins>either <tt>D</tt> is a reference type and <tt>E</tt> is the same type as <tt>D</tt>, or <tt>D</tt> is 
! not a reference type and <tt>E</tt> is implicitly convertible to <tt>D</tt>.</ins></p></li>
! </ul>
! <p>
! -6- <i>Effects</i>: Transfers ownership from <tt>u</tt> to <tt>*this</tt> as if by calling <tt>reset(u.release())</tt> 
! followed by an assignment from <tt>std::forward&lt;E&gt;(u.get_deleter())</tt>.
! <p/>
! -7- <i>Returns</i>: <tt>*this</tt>.
! </p>
! </blockquote></blockquote>
! 
! </li>
! </ol>
! 
! </blockquote>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! <p>
! The wording looks good, but we want a little more time than the telecon permits to be truly comfortable.
! We expect this issue to resolve fairly easily in Bristol.
! </p>
! 
! <p><i>[2015-05-18, Howard comments]</i></p>
! 
! <p>
! Updated proposed wording has been provided in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4366.html">N4366</a>.
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! Straw poll: send <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4366.html">N4366</a> to full committee, 
! with both fixes from the sections "What is the correct fix?" and "<tt>unique_ptr&lt;T[]&gt;</tt> needs the correct fix too"
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Resolved by accepting <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4366.html">N4366</a>.
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2229"></a>2229. Standard code conversion facets underspecified</h3>
! <p><b>Section:</b> 22.5 [locale.stdcvt] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Beman Dawes <b>Opened:</b> 2012-12-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>The only specification for the non-inherited members of classes <tt>codecvt_utf8</tt>,
! <tt>codecvt_utf16</tt>, and <tt>codecvt_utf8_utf16</tt> is a comment line in the synopsis
! that says <i><tt>// unspecified</tt></i>. There is no further indication of functionality,
! so a user does not know if one of these classes can be constructed or destroyed.</p>
! 
! <p>The proposed resolution adds a constructor that mimics the class <tt>codecvt</tt>
! constructor, and also adds a destructor. Following the practice of class <tt>codecvt</tt>,
! the semantics are not specified.</p>
! 
! <p>The only existing implementation I could find was libc++, and it does supply the
! proposed constructor and destructor for each of the three classes.</p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! <p>
! There was concern about the unspecified semantics - but that matches what is done in <tt>codecvt</tt>.
! </p>
! <p>
! Jonathan: Should these constructor/destructors be public? Proposed wording is private.
! Base class constructor is public.
! </p>
! <p>
! Howard noted that other facets do not have specified constructors.
! </p>
! <p>
! Alisdair noted that this whole section was new in C++11.
! </p>
! <p>
! Howard suggested looking at section 22.3.1.1.2 [locale.facet]p2/p3 for more info.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
!  
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p><i>In [locale.stdcvt] paragraph 2, Header codecvt synopsis:</i></p>
! <blockquote>
!   <pre>template&lt;class Elem, unsigned long Maxcode = 0x10ffff,
!   codecvt_mode Mode = (codecvt_mode)0&gt;
! class codecvt_utf8
!   : public codecvt&lt;Elem, char, mbstate_t&gt; {
!   <del><i>// unspecified</i></del>
! <ins>public:</ins>
!   <ins>explicit codecvt_utf8(size_t refs = 0);</ins>
!   <ins>~codecvt_utf8();</ins>
!   };
! 
! template&lt;class Elem, unsigned long Maxcode = 0x10ffff,
!   codecvt_mode Mode = (codecvt_mode)0&gt;
! class codecvt_utf16
!   : public codecvt&lt;Elem, char, mbstate_t&gt; {
!   <del><i>// unspecified</i></del>
! <ins>public:</ins>
!   <ins>explicit codecvt_utf16(size_t refs = 0);</ins>
!   <ins>~codecvt_utf16();</ins>
!   };
! 
! template&lt;class Elem, unsigned long Maxcode = 0x10ffff,
!   codecvt_mode Mode = (codecvt_mode)0&gt;
! class codecvt_utf8_utf16
!   : public codecvt&lt;Elem, char, mbstate_t&gt; {
!   <del><i>// unspecified</i></del>
! <ins>public:</ins>
!   <ins>explicit codecvt_utf8_utf16(size_t refs = 0);</ins>
!   <ins>~codecvt_utf8_utf16();</ins>
!   };</pre>
! </blockquote>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2230"></a>2230. &quot;<em>see below</em>&quot; for initializer-list constructors of unordered containers</h3>
! <p><b>Section:</b> 23.5 [unord] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-01-06 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord">issues</a> in [unord].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The <tt>unordered_map</tt> class definition in 23.5.4.1 [unord.map.overview] declares an
! initializer-list constructor that says "see below":
! </p>
! 
! <blockquote><pre>
! unordered_map(initializer_list&lt;value_type&gt;,
!     size_type = <em>see below</em>,
!     const hasher&amp; hf = hasher(),
!     const key_equal&amp; eql = key_equal(),
!     const allocator_type&amp; a = allocator_type());
! </pre></blockquote>
! 
! <p>
! But that constructor isn't defined below. The same problem exists for the other unordered associative containers.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! STL: ordered are also missing declarations, but issue is forthcoming
! <p/>
! Walter: how does adding a signature address issue? &mdash; nevermind 
! <p/>
! Jayson: in his wording, isn't he just dropping the <tt>size_type</tt>?
! <p/> 
! Walter: partial fix is to introduce the name
! <p/>
! Stefanus: explanation of requiring name because of n buckets 
! <p/>
! STL: solution for his issue satisfies both ordered and unordered and is simplier than provided wording 
! <p/>
! STL: patches general table instead 
! <p/>
! STL: proposes adding extra rows instead of extra declarations 
! <p/>
! Stefanus: clarify <tt>n</tt> in the synopsis 
! <p/>
! Walter: general rule, name is optional in declaration 
! <p/>
! Stefanus: how to proceed 
! <p/>
! Walter: significant overlap with forthcoming issue, suggestion to defer
! </p>
! 
! <p><i>[2014-02-20 Re-open Deferred issues as Priority 4]</i></p>
! 
! 
! <p><i>[2014-03-27 Jonathan improves proposed wording]</i></p>
! 
! 
! <p><i>[2014-05-20 STL and Jonathan communicate]</i></p>
! 
! 
! <p>
! STL: With <a href="lwg-defects.html#2322">2322</a> resolved, is there anything left for this issue to fix?
! <p/>
! Jonathan: The synopsis still says "<em>see below</em>" and it's not immediately clear
! that "<em>see below</em>" means "see the definition of a different constructor,
! which defines the behaviour of this one due to a table defined much earlier".
! </p>
! 
! <p><i>[2014-05-23 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on five votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Edit 23.5.4.1 [unord.map.overview], class template <tt>unordered_map</tt> synopsis, as follows:</p>
! 
! <blockquote><pre>
! [&hellip;]
! unordered_map(initializer_list&lt;value_type&gt; <ins>il</ins>,
!   size_type <ins>n</ins> = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());
! [&hellip;]
! </pre></blockquote>
! </li>
! 
! <li><p>Edit 23.5.4.2 [unord.map.cnstr] as follows:</p>
! <blockquote><pre>
! template &lt;class InputIterator&gt;
! unordered_map(InputIterator f, InputIterator l,
!   size_type n = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());
! <ins>unordered_map(initializer_list&lt;value_type&gt; il,
!   size_type n = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());</ins>
! </pre><blockquote>
! <p>
! -3- <i>Effects</i>: Constructs an empty <tt>unordered_map</tt> using the specified hash function, key equality function,
! and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is
! implementation-defined. Then inserts elements from the range <tt>[f, l)</tt> <ins>for the first form, or from the range 
! <tt>[il.begin(), il.end())</tt> for the second form</ins>. <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 23.5.5.1 [unord.multimap.overview], class template <tt>unordered_multimap</tt> synopsis, as follows:</p>
! 
! <blockquote><pre>
! [&hellip;]
! unordered_multimap(initializer_list&lt;value_type&gt; <ins>il</ins>,
!   size_type <ins>n</ins> = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());
! [&hellip;]
! </pre></blockquote>
! </li>
! 
! <li><p>Edit 23.5.5.2 [unord.multimap.cnstr] as follows:</p>
! <blockquote><pre>
! template &lt;class InputIterator&gt;
! unordered_multimap(InputIterator f, InputIterator l,
!   size_type n = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());
! <ins>unordered_multimap(initializer_list&lt;value_type&gt; il,
!   size_type n = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());</ins>
! </pre><blockquote>
! <p>
! -3- <i>Effects</i>: Constructs an empty <tt>unordered_multimap</tt> using the specified hash function, key equality function,
! and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is
! implementation-defined. Then inserts elements from the range <tt>[f, l)</tt> <ins>for the first form, or from the range 
! <tt>[il.begin(), il.end())</tt> for the second form</ins>. <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 23.5.6.1 [unord.set.overview], class template <tt>unordered_set</tt> synopsis, as follows:</p>
! 
! <blockquote><pre>
! [&hellip;]
! unordered_set(initializer_list&lt;value_type&gt; <ins>il</ins>,
!   size_type <ins>n</ins> = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());
! [&hellip;]
! </pre></blockquote>
! </li>
! 
! <li><p>Edit 23.5.6.2 [unord.set.cnstr] as follows:</p>
! <blockquote><pre>
! template &lt;class InputIterator&gt;
! unordered_set(InputIterator f, InputIterator l,
!   size_type n = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());
! <ins>unordered_set(initializer_list&lt;value_type&gt; il,
!   size_type n = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());</ins>
! </pre><blockquote>
! <p>
! -3- <i>Effects</i>: Constructs an empty <tt>unordered_set</tt> using the specified hash function, key equality function,
! and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is
! implementation-defined. Then inserts elements from the range <tt>[f, l)</tt> <ins>for the first form, or from the range 
! <tt>[il.begin(), il.end())</tt> for the second form</ins>. <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 23.5.7.1 [unord.multiset.overview], class template <tt>unordered_multiset</tt> synopsis, as follows:</p>
! 
! <blockquote><pre>
! [&hellip;]
! unordered_multiset(initializer_list&lt;value_type&gt; <ins>il</ins>,
!   size_type <ins>n</ins> = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());
! [&hellip;]
! </pre></blockquote>
! </li>
! 
! <li><p>Edit 23.5.7.2 [unord.multiset.cnstr] as follows:</p>
! <blockquote><pre>
! template &lt;class InputIterator&gt;
! unordered_multiset(InputIterator f, InputIterator l,
!   size_type n = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());
! <ins>unordered_multiset(initializer_list&lt;value_type&gt; il,
!   size_type n = <em>see below</em>,
!   const hasher&amp; hf = hasher(),
!   const key_equal&amp; eql = key_equal(),
!   const allocator_type&amp; a = allocator_type());</ins>
! </pre><blockquote>
! <p>
! -3- <i>Effects</i>: Constructs an empty <tt>unordered_multiset</tt> using the specified hash function, key equality function,
! and allocator, and using at least <tt>n</tt> buckets. If <tt>n</tt> is not provided, the number of buckets is
! implementation-defined. Then inserts elements from the range <tt>[f, l)</tt> <ins>for the first form, or from the range 
! <tt>[il.begin(), il.end())</tt> for the second form</ins>. <tt>max_load_factor()</tt> returns <tt>1.0</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2231"></a>2231. DR 704 removes complexity guarantee for <tt>clear()</tt></h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2012-12-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! From the question at <a href="http://stackoverflow.com/q/14094408/981959">stackoverflow</a>.
! </p>
! 
! <p>
! Were we aware that the resolution to LWG <a href="lwg-defects.html#704">704</a> means there is no complexity guarantee for 
! <tt>clear()</tt> on most sequence containers? Previously it was implied by defining it in terms of 
! <tt>erase(begin(), end())</tt> but we no longer do that.
! </p>
! 
! <p>
! There are explicit complexity requirements for <tt>std::list::clear()</tt>, but not the other sequence containers.
! </p>
! 
! <p>Daniel:</p>
! 
! <p>
! The idea was that the notion of "destroys all elements in <tt>a</tt>" would imply a linear complexity, but the wording 
! needs to be clearer, because this doesn't say that this step is the actual complexity bound.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Tentatively Ready.
! </p>
! 
! <p><i>[2013-04-20 Bristol]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Change Table 100 as indicated:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 100 &mdash; Sequence container requirements (in addition to container) (continued)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.clear()</tt>
! </td>
! <td>
! <tt>void</tt>
! </td>
! <td>
! Destroys all elements in <tt>a</tt>. Invalidates all<br/>
! references, pointers, and iterators referring to<br/>
! the elements of <tt>a</tt> and may invalidate the<br/>
! past-the-end iterator.<br/>
! post: <tt>a.empty()</tt> returns <tt>true</tt><br/>
! <ins>complexity: linear</ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2233"></a>2233. <tt>bad_function_call::what()</tt> unhelpful</h3>
! <p><b>Section:</b> 20.9.12.1 [func.wrap.badcall] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-01-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! A strict reading of the standard implies <tt>std::bad_function_call{}.what()</tt> returns the same string as
! <tt>std::exception{}.what()</tt> which doesn't help to know what happened if you catch an exception by reference 
! to <tt>std::exception</tt>.
! </p>
! 
! <p>
! For consistency with <tt>bad_weak_ptr::what()</tt> it should return <tt>"bad_function_call"</tt>.
! </p>
! 
! <p>
! See <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=33515">c++std-lib-33515</a> for other details.
! </p>
! 
! <p>
! There was a considerable support on the reflector to instead change the specification of both <tt>bad_weak_ptr::what()</tt> 
! and <tt>bad_function_call::what()</tt> to return an implementation-defined string instead.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Open.
! </p>
! <p>
! Consensus that we want consistency in how this is treated.  Less consensus on what the common
! direction should be.
! </p>
! <p>
! Alisdair to provide wording proposing that all string literals held by standard exception objects are
! either unspecified, or implmentation defined.
! </p>
! 
! <p><i>[2014-02-15 Issauqah]</i></p>
! 
! <p>
! STL: I think it should be an implementation-defined NTBS, same on <tt>bad_weak_ptr</tt>. I will write a PR.
! </p>
! 
! <p><i>[2014-03-27, STL provides improved wording]</i></p>
! 
! 
! <p>
! The new wording reflects better the general agreement of the committee, see also issue <a href="lwg-defects.html#2376">2376</a> for similar wording.
! </p>
! 
! <p><i>[2014-03-28 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on five votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Edit 20.9.12.1.1 [func.wrap.badcall.const]:</p>
! <blockquote><pre>
! bad_function_call() noexcept;
! </pre><blockquote>
! <p>
! -1- <i>Effects</i>: constructs a <tt>bad_function_call object</tt>.
! <p/>
! <ins>-?- <i>Postconditions</i>: <tt>what()</tt> returns an implementation-defined NTBS.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2235"></a>2235. Undefined behavior without proper requirements on <tt>basic_string</tt> constructors</h3>
! <p><b>Section:</b> 21.4.2 [string.cons] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Juan Soulie <b>Opened:</b> 2013-01-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.cons">issues</a> in [string.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 21.4.2 [string.cons], I believe tighter requirements should be imposed on <tt>basic_string</tt>'s constructors 
! taking an <tt>s</tt> argument (or, a behavior should be provided for the undefined cases).
! These requirements are properly stated in the other members functions taking <tt>s</tt> arguments (<tt>append</tt>, 
! <tt>assign</tt>, <tt>insert</tt>,...).
! </p>
! 
! <blockquote><pre>
! basic_string(const charT* s, size_type n, const Allocator&amp; a = Allocator());
! </pre></blockquote>
! 
! <p>
! Relative to N3485, 21.4.2 [string.cons]/6 says "Requires: <tt>s</tt> shall not be a null pointer and <tt>n &lt; npos</tt>", 
! where it should say: "Requires: <tt>s</tt> points to an array of at least <tt>n</tt> elements of <tt>charT</tt>"
! </p>
! 
! <blockquote><pre>
! basic_string(const charT* s, const Allocator&amp; a = Allocator());
! </pre></blockquote>
! 
! <p>
! 21.4.2 [string.cons]/8 says "Requires: <tt>s</tt> shall not be a null pointer.", where it should say:
! "Requires: <tt>s</tt> points to an array of at least <tt>traits::length(s) + 1</tt> elements of <tt>charT</tt>"
! </p>
! 
! <p>Daniel:</p>
! <p>
! I think that 17.6.4.9 [res.on.arguments] p1 b2 basically requires this already, but the wording is indeed worth 
! improving it.
! </p>
! 
! <p><i>[2013-03-15 Issues Teleconference]</i></p>
! 
! <p>
! Moved to Review.
! </p>
! <p>
! The resolution could be worded more cleanly, and there is some concern about redundancy between
! <i>Requirements</i> and <i>Effects</i> clauses.  Consensus that we do want to say something like
! this for the <i>Requirements</i> though.
! </p>
! 
! <p><i>[2013-04-18, Bristol]</i></p>
!  
! 
! <p>Move to Ready</p>
! 
! <p><i>[2013-09-29, Bristol]</i></p>
!  
! 
! <p>Apply to the Working Paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li><p>Change 21.4.2 [string.cons]/6 as indicated:</p>
! 
! <blockquote><pre>
! basic_string(const charT* s, size_type n, const Allocator&amp; a = Allocator());
! </pre><blockquote>
! <p>
! -6- <i>Requires</i>: <tt>s</tt> <del>shall not be a null pointer and <tt>n &lt; npos</tt></del><ins>points to an array 
! of at least <tt>n</tt> elements of <tt>charT</tt></ins>.
! </p>
! </blockquote></blockquote>
! 
! </li>
! 
! <li><p>Change 21.4.2 [string.cons]/8 as indicated:</p>
! 
! <blockquote><pre>
! basic_string(const charT* s, const Allocator&amp; a = Allocator());
! </pre><blockquote>
! <p>
! -8- <i>Requires</i>: <tt>s</tt> <del>shall not be a null pointer</del><ins>points to an array 
! of at least <tt>traits::length(s) + 1</tt> elements of <tt>charT</tt></ins>.
! </p>
! </blockquote></blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2239"></a>2239. <tt>min/max/minmax</tt> requirements</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Juan Soulie <b>Opened:</b> 2013-01-26 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 25.4.7 [alg.min.max] requires type <tt>T</tt> in <tt>min</tt>, <tt>max</tt>, and <tt>minmax</tt> to be 
! <tt>LessThanComparable</tt>, but I don't believe this should be required for the versions that take a <tt>Compare</tt> 
! argument.
! <p/>
! Paragraphs 1 to 4 of 25.4 [alg.sorting] should apply anyway, although I'm not sure about <tt>Compare</tt> 
! being required to induce a strict weak ordering here.
! <p/>
! Further, <tt>min</tt> and <tt>max</tt> also lack formal complexity guarantees.
! </p>
! 
! <p><i>[2014-06-07 Daniel comments and provides wording]</i></p>
! 
! 
! <p>
! Certainly, the functions with <tt>Compare</tt> should not impose <tt>LessThanComparable</tt> requirements.
! <p/>
! In regard to the question whether a strict weak ordering should be required as implied by the <tt>Compare</tt>
! requirements, I would like to point out that this is requirement is in fact needed, because the specification of 
! the normative <i>Remarks</i> elements (e.g. "Returns the first argument when the arguments are equivalent.") do depend 
! on the existence of a <em>equivalence relation</em> that can be relied on and this is also consistent with the same
! strict weak ordering requirement that is indirectly imposed by the <tt>LessThanComparable</tt> requirement set for 
! functions referring to <tt>operator&lt;</tt> (Let me note that the very same <tt>StrictWeakOrder</tt> language 
! concept had intentionally been required for similar reasons during "concept-time" in
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2914.pdf">N2914</a>).
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! JY: We have library-wide requirements that <tt>Comp</tt> induce a strict weak ordering.
! <p/>
! JY/MC: The un-marked-up "Complexity" (p16) is wrong. DK: I'll fix that.
! <p/>
! DK will update the wording for Lenexa. 
! </p>
! 
! <p><i>[2015-03-30 Daniel comments]</i></p>
! 
! <p>
! The Complexity element of p16 is correct, but some others involving <tt>initializer_list</tt> arguments are wrong. 
! </p>
! 
! <p><i>[2015-04-02 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Change 25.4.7 [alg.min.max] as indicated:
! </p>
! 
! <blockquote>
! <pre>
! template&lt;class T&gt; constexpr const T&amp; min(const T&amp; a, const T&amp; b);
! template&lt;class T, class Compare&gt;
!   constexpr const T&amp; min(const T&amp; a, const T&amp; b, Compare comp);
! </pre>
! <blockquote>
! <p>
! -1- <i>Requires</i>: <ins>For the first form, type <tt>T</tt> shall be</ins><del>Type <tt>T</tt> is</del> <tt>LessThanComparable</tt> 
! (Table 18).
! <p/>
! -2- <i>Returns</i>: The smaller value.
! <p/>
! -3- <i>Remarks</i>: Returns the first argument when the arguments are equivalent.
! <p/>
! <ins>-?- <i>Complexity</i>: Exactly one comparison.</ins>
! </p>
! </blockquote>
! 
! <pre>
! template&lt;class T&gt;
!   constexpr T min(initializer_list&lt;T&gt; t);
! template&lt;class T, class Compare&gt;
!   constexpr T min(initializer_list&lt;T&gt; t, Compare comp);
! </pre>
! <blockquote>
! <p>
! -4- <i>Requires</i>: <tt>T</tt> <del>is <tt>LessThanComparable</tt> and</del><ins>shall be</ins> <tt>CopyConstructible</tt> and 
! <tt>t.size() &gt; 0</tt>. <ins>For the first form, type <tt>T</tt> shall be <tt>LessThanComparable</tt>.</ins>
! <p/>
! -5- <i>Returns</i>: [&hellip;]
! <p/>
! -6- <i>Remarks</i>: [&hellip;]
! <p/>
! <ins>-?- <i>Complexity</i>: Exactly <tt>t.size() - 1</tt> comparisons.</ins>
! </p>
! </blockquote>
! 
! <pre>
! template&lt;class T&gt; constexpr const T&amp; max(const T&amp; a, const T&amp; b);
! template&lt;class T, class Compare&gt;
!   constexpr const T&amp; max(const T&amp; a, const T&amp; b, Compare comp);
! </pre>
! <blockquote>
! <p>
! -7- <i>Requires</i>: <ins>For the first form, type <tt>T</tt> shall be</ins><del>Type <tt>T</tt> is</del> <tt>LessThanComparable</tt> 
! (Table 18).
! <p/>
! -8- <i>Returns</i>: [&hellip;]
! <p/>
! -9- <i>Remarks</i>: [&hellip;]
! <p/>
! <ins>-?- <i>Complexity</i>: Exactly one comparison.</ins>
! </p>
! </blockquote>
! 
! <pre>
! template&lt;class T&gt;
!   constexpr T max(initializer_list&lt;T&gt; t);
! template&lt;class T, class Compare&gt;
!   constexpr T max(initializer_list&lt;T&gt; t, Compare comp);
! </pre>
! <blockquote>
! <p>
! -10- <i>Requires</i>: <tt>T</tt> <del>is <tt>LessThanComparable</tt> and</del><ins>shall be</ins> <tt>CopyConstructible</tt> and 
! <tt>t.size() &gt; 0</tt>. <ins>For the first form, type <tt>T</tt> shall be <tt>LessThanComparable</tt>.</ins>
! <p/>
! -11- <i>Returns</i>: [&hellip;]
! <p/>
! -12- <i>Remarks</i>: [&hellip;]
! <p/>
! <ins>-?- <i>Complexity</i>: Exactly <tt>t.size() - 1</tt> comparisons.</ins>
! </p>
! </blockquote>
! 
! <pre>
! template&lt;class T&gt; constexpr pair&lt;const T&amp;, const T&amp;&gt; minmax(const T&amp; a, const T&amp; b);
! template&lt;class T, class Compare&gt;
!   constexpr pair&lt;const T&amp;, const T&amp;&gt; minmax(const T&amp; a, const T&amp; b, Compare comp);
! </pre>
! <blockquote>
! <p>
! -13- <i>Requires</i>: <ins>For the first form, t</ins><del>T</del>ype <tt>T</tt> shall be <tt>LessThanComparable</tt> 
! (Table 18).
! <p/>
! -14- <i>Returns</i>: [&hellip;]
! <p/>
! -15- <i>Remarks</i>: [&hellip;]
! <p/>
! -16- <i>Complexity</i>: Exactly one comparison.
! </p>
! </blockquote>
! 
! <pre>
! template&lt;class T&gt;
!   constexpr pair&lt;T, T&gt; minmax(initializer_list&lt;T&gt; t);
! template&lt;class T, class Compare&gt;
!   constexpr pair&lt;T, T&gt; minmax(initializer_list&lt;T&gt; t, Compare comp);
! </pre>
! <blockquote>
! <p>
! -17- <i>Requires</i>: <tt>T</tt> <del>is <tt>LessThanComparable</tt> and</del><ins>shall be</ins> <tt>CopyConstructible</tt> and 
! <tt>t.size() &gt; 0</tt>. <ins>For the first form, type <tt>T</tt> shall be <tt>LessThanComparable</tt>.</ins>
! <p/>
! -18- <i>Returns</i>: [&hellip;]
! <p/>
! -19- <i>Remarks</i>: [&hellip;]
! <p/>
! -20- <i>Complexity</i>: At most <tt>(3/2) * t.size()</tt> applications of the corresponding predicate.
! </p>
! </blockquote>
! 
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2240"></a>2240. Probable misuse of term "function scope" in [thread.condition]</h3>
! <p><b>Section:</b> 30.5.1 [thread.condition.condvar], 30.5.2 [thread.condition.condvarany] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> FrankHB1989 <b>Opened:</b> 2013-02-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.condition.condvar">issues</a> in [thread.condition.condvar].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! All usages of "function scope" in 30.5.1 [thread.condition.condvar] and 30.5.2 [thread.condition.condvarany], 
! such as 30.5.1 [thread.condition.condvar] p10 b4:
! </p>
! 
! <blockquote><p>
! If the function exits via an exception, lock.lock() shall be called prior to exiting the <strong>function scope</strong>.
! </p></blockquote>
! 
! <p>
! seem to be inappropriate compared to the actual core language definition of 3.3.5 [basic.funscope]:
! </p>
! 
! <blockquote><p>
! Labels (6.1) have function scope and may be used anywhere in the function in which they are declared. <strong>Only
! labels have function scope</strong>.
! </p></blockquote>
! 
! <p>
! Probably the intended meaning is "outermost block scope of the function".
! </p>
! 
! <p><i>[2013-09 Chicago: Resolved by proposed resolution of LWG <a href="lwg-defects.html#2135">2135</a>]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>
! Resolved by proposed resolution of LWG <a href="lwg-defects.html#2135">2135</a>.
! </p>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2246"></a>2246. <tt>unique_ptr</tt> assignment effects w.r.t. deleter</h3>
! <p><b>Section:</b> 20.8.1.2.3 [unique.ptr.single.asgn] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-03-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single.asgn">issues</a> in [unique.ptr.single.asgn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! The Effects clauses for <tt>unique_ptr</tt> assignment don't make sense, what
! is the target of "an assignment from <tt>std::forward&lt;D&gt;(u.get_deleter())</tt>"?
! <p/>
! Obviously it's intended to be the deleter, but that isn't stated clearly.
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! <p>Move to Ready</p>
! 
! <p><i>[2013-09-29, Chicago]</i></p>
! 
! <p>Apply to Working Paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li>
! <p>
! Edit 20.8.1.2.3 [unique.ptr.single.asgn] paragraph 2:
! </p>
! <blockquote><pre>
! unique_ptr&amp; operator=(unique_ptr&amp;&amp; u) noexcept;
! </pre>
! <blockquote><p>
! [&hellip;]
! <p/>
! -2- <i>Effects</i>: Transfers ownership from <tt>u</tt> to <tt>*this</tt> as if by calling 
! <tt>reset(u.release())</tt> followed by <del>an assignment from</del><tt><ins>get_deleter() = </ins>std::forward&lt;D&gt;(u.get_deleter())</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li>
! <p>
! Edit 20.8.1.2.3 [unique.ptr.single.asgn] paragraph 6:
! </p>
! <blockquote><pre>
! template &lt;class U, class E&gt; unique_ptr&amp; operator=(unique_ptr&lt;U, E&gt;&amp;&amp; u) noexcept;
! </pre>
! <blockquote><p>
! [&hellip;]
! <p/>
! -6- <i>Effects</i>: Transfers ownership from <tt>u</tt> to <tt>*this</tt> as if by calling 
! <tt>reset(u.release())</tt> followed by <del>an assignment from</del><tt><ins>get_deleter() = </ins>std::forward&lt;E&gt;(u.get_deleter())</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2247"></a>2247. Type traits and <tt>std::nullptr_t</tt></h3>
! <p><b>Section:</b> 20.10.4.1 [meta.unary.cat] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2013-03-15 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! According to 20.10.4.1 [meta.unary.cat], for every type <tt>T</tt>, exactly one of the primary type traits is true.  
! So which is true for the type <tt>std::nullptr_t</tt>?  By 2.13.7 [lex.nullptr] <tt>std::nullptr_t</tt> is not a 
! pointer type or a pointer-to-member type, so <tt>is_pointer</tt>, <tt>is_member_object_pointer</tt> and 
! <tt>is_member_function_pointer</tt> can't be true for <tt>std::nullptr_t</tt>, and none of the other primary type traits 
! seem to apply.
! </p>
! 
! <p><i>[2013-04-20, Bristol]</i></p>
! 
! <p>Rename to <tt>is_null_pointer</tt>, move to Ready</p>
! 
! <p>Previous wording:</p>
! 
! <blockquote class="note">   
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li>
! <p>
! Edit 20.10.2 [meta.type.synop], header <tt>&lt;type_traits&gt;</tt> synopsis:
! </p>
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   // 20.9.4.1, primary type categories:
!   template &lt;class T&gt; struct is_void;
!   <ins>template &lt;class T&gt; struct is_nullptr;</ins>
!   template &lt;class T&gt; struct is_integral;
!   template &lt;class T&gt; struct is_floating_point;
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li>
! <p>
! Edit Table 47 &mdash; "Primary type category predicates" as indicated:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 47 &mdash; Primary type category predicates</caption>
! <tr>
! <th>Template</th>
! <th>Condition</th>
! <th>Comments</th>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>template &lt;class T&gt;<br/>
! struct is_nullptr;</tt></ins>
! </td>
! <td>
! <ins><tt>T</tt> is <tt>std::nullptr_t</tt> ([basic.fundamental])</ins>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! 
! </ol>
! </blockquote>
! 
! <p><i>[2013-09-29, Chicago]</i></p>
! 
! 
! <p>Apply to the Working Paper</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3485.</p>
! 
! <ol>
! <li>
! <p>
! Edit 20.10.2 [meta.type.synop], header <tt>&lt;type_traits&gt;</tt> synopsis:
! </p>
! <blockquote><pre>
! namespace std {
!   [&hellip;]
!   // 20.9.4.1, primary type categories:
!   template &lt;class T&gt; struct is_void;
!   <ins>template &lt;class T&gt; struct is_null_pointer;</ins>
!   template &lt;class T&gt; struct is_integral;
!   template &lt;class T&gt; struct is_floating_point;
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! <li>
! <p>
! Edit Table 47 &mdash; "Primary type category predicates" as indicated:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 47 &mdash; Primary type category predicates</caption>
! <tr>
! <th>Template</th>
! <th>Condition</th>
! <th>Comments</th>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>template &lt;class T&gt;<br/>
! struct is_null_pointer;</tt></ins>
! </td>
! <td>
! <ins><tt>T</tt> is <tt>std::nullptr_t</tt> ([basic.fundamental])</ins>
! </td>
! <td>
! &nbsp;
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2249"></a>2249. [CD] Remove <tt>gets</tt> from <tt>&lt;cstdio&gt;</tt></h3>
! <p><b>Section:</b> 27.9.2 [c.files] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-04-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.files">issues</a> in [c.files].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses GB 9</b></p>
! 
! <p>
! In 27.9.2 [c.files] the current C++ standard claims that <tt>&lt;cstdio&gt;</tt> defines a
! function called "gets" but it has no declaration or semantics, because it was removed from C11, 
! having been deprecated since C99. We should remove it for C++14.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Will resolve with the wording in the NB comment.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>Resolved by resolution as suggested by NB comment <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3733.pdf">GB 9</a></p>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2252"></a>2252. Strong guarantee on <tt>vector::push_back()</tt> still broken with C++11?</h3>
! <p><b>Section:</b> 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Nicolai Josuttis <b>Opened:</b> 2013-04-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.modifiers">active issues</a> in [vector.modifiers].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.modifiers">issues</a> in [vector.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! 
! <p>
! According to my understanding, the strong guarantee of <tt>push_back()</tt> led to the introduction of <tt>noexcept</tt> 
! and to the typical implementation that vectors usually copy their elements on reallocation unless the move operations of 
! their element type guarantees not to throw.
! <p/>
! However, if I read the standard correctly, we still don't give the strong guarantee any more:
! Yes, 23.2.1 [container.requirements.general]/10 specifies:
! </p>
! <blockquote>
! <p>
! Unless otherwise specified (see 23.2.4.1, 23.2.5.1, 23.3.3.4, and 23.3.6.5) all container types defined in this
! Clause meet the following additional requirements:
! </p>
! <ul>
! <li>[&hellip;]</li>
! <li>if an exception is thrown by a <tt>push_back()</tt> or <tt>push_front()</tt> function, that function has no effects.</li>
! </ul>
! </blockquote>
! <p>
! However, 23.3.6.5 [vector.modifiers] specifies for vector modifiers, <em>including</em> <tt>push_back()</tt>:
! </p>
! <blockquote>
! <p>
! If an exception is thrown other than by the copy constructor, move constructor, assignment operator, or move 
! assignment operator of <tt>T</tt> or by any <tt>InputIterator</tt> operation there are no effects. If an exception 
! is thrown by the move constructor of a non-<tt>CopyInsertable</tt> <tt>T</tt>, the effects are unspecified.
! </p>
! </blockquote>
! <p>
! I would interpret this as an "otherwise specified" behavior for <tt>push_back()</tt>, saying that the strong guarantee 
! is only given if constructors and assignments do not throw. 
! <p/>
! That means, the strong guarantee of C++03 is broken with C++11.
! <p/>
! In addition to all that 23.2.1 [container.requirements.general] p10 b2 doesn't mention the corresponding functions
! <tt>emplace_back()</tt> and <tt>emplace_front()</tt>. These are similar single-element additions and should provide the same
! strong guarantee.
! <p/>
! Daniel adds:
! <p/>
! It seems the error came in when <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2350.pdf">N2350</a>
! and <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2345.pdf">N2345</a> became accepted and where 
! integrated into the working draft <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2369.pdf">N2369</a>.
! The merge resulted in a form that changed the previous meaning and as far as I understand it, this effect was not intended.
! </p>
! 
! <p><i>[2013-09-16, Nico provides concrete wording]</i></p>
! 
! 
! <p><i>[2013-09-26, Nico improves wording]</i></p>
! 
! 
! <p>
! The new proposed resolution is driven as follows:
! </p>
! <ul>
!  <li> <p>In the container requirements section, there shall be general statements that single element insertions
!       and <tt>push_back()</tt>, <tt>pop_back</tt>, <tt>emplace_front()</tt>, and <tt>emplace_back()</tt> have no effect
!       on any exception.
!       <p/>
!       That is: we extend the first two statements by adding <tt>emplace_front()</tt> and <tt>emplace_back()</tt>, which
!       are missing.
! 	  </p>
! </li>
!  <li> <p>Formulate only the exceptions from that (or where other general statements might
!       lead to the impression, that the blanket statement no longer applies):</p>
!       <ul>
!        <li> <p>remove the statement in <tt>list::push_back()</tt> saying again that exceptions have to effect.</p></li>
!        <li> <p>Clarify that all single-element insertions at either end of a <tt>deque</tt> have the strong guarantee.</p> </li>
!        <li> <p>Clarify that all single-element insertions at the end of a <tt>vector</tt> have the strong guarantee.</p></li>
!       </ul> 
! </li>
! </ul>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 23.2.1 [container.requirements.general] p10 b2 as indicated:</p>
! 
! <ul>
! <li><p>
! if an exception is thrown by an <tt>insert()</tt> or <tt>emplace()</tt> function while inserting a single element, that
! function has no effects.
! </p></li>
! <li><p>
! if an exception is thrown by a <tt>push_back()</tt> <del>or</del><ins>,</ins> <tt>push_front()</tt><ins>, <tt>emplace_back()</tt>, or 
! <tt>emplace_front()</tt></ins> function, that function has no effects.
! </p></li>
! </ul>
! 
! </li>
! 
! <li><p>Edit 23.3.3.4 [deque.modifiers] as indicated:</p>
! 
! <blockquote>
! <pre>iterator insert(const_iterator position, const T&amp; x);
! iterator insert(const_iterator position, T&amp;&amp; x);
! iterator insert(const_iterator position, size_type n, const T&amp; x);
! template &lt;class InputIterator&gt;
!   iterator insert(const_iterator position,
!                   InputIterator first, InputIterator last);
! iterator insert(const_iterator position, initializer_list&lt;T&gt;);
! template &lt;class... Args&gt; void emplace_front(Args&amp;&amp;... args);
! template &lt;class... Args&gt; void emplace_back(Args&amp;&amp;... args);
! template &lt;class... Args&gt; iterator emplace(const_iterator position, Args&amp;&amp;... args);
! void push_front(const T&amp; x);
! void push_front(T&amp;&amp; x);
! void push_back(const T&amp; x);
! void push_back(T&amp;&amp; x);
! </pre>
! <blockquote>
! <p>
! -1- <i>Effects:</i> An insertion in the middle of the deque invalidates all the iterators and references to elements
! of the deque. An insertion at either end of the deque invalidates all the iterators to the deque, but has
! no effect on the validity of references to elements of the deque.
! </p><p>
! -2- <i>Remarks:</i> 
! If an exception is thrown other than by the copy constructor, move constructor, assignment
! operator, or move assignment operator of <tt>T</tt> there are no effects.
! <ins>
! If an exception is thrown while inserting a single element at either end, there are no effects.
! </ins>
! <del>If</del><ins>Otherwise, if</ins> an exception is thrown by the move
! constructor of a non-<tt>CopyInsertable</tt> <tt>T</tt>, the effects are unspecified.
! </p><p>
! -3- <i>Complexity:</i> The complexity is linear in the number of elements inserted plus the lesser of the distances
! to the beginning and end of the deque. Inserting a single element either at the beginning or end of a
! deque always takes constant time and causes a single call to a constructor of <tt>T</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 23.3.6.5 [vector.modifiers] as indicated:</p>
! 
! <blockquote>
! <pre>iterator insert(const_iterator position, const T&amp; x);
! iterator insert(const_iterator position, T&amp;&amp; x);
! iterator insert(const_iterator position, size_type n, const T&amp; x);
! template &lt;class InputIterator&gt;
!   iterator insert(const_iterator position, InputIterator first, InputIterator last);
! iterator insert(const_iterator position, initializer_list&lt;T&gt;);
! template &lt;class... Args&gt; void emplace_back(Args&amp;&amp;... args);
! template &lt;class... Args&gt; iterator emplace(const_iterator position, Args&amp;&amp;... args);
! void push_back(const T&amp; x);
! void push_back(T&amp;&amp; x);
! </pre>
! <blockquote>
! <p>
! -1- <i>Remarks:</i> Causes reallocation if the new size is greater than the old capacity. If no reallocation happens,
! all the iterators and references before the insertion point remain valid.
! If an exception is thrown other
! than by the copy constructor, move constructor, assignment operator, or move assignment operator
! of <tt>T</tt> or by any <tt>InputIterator</tt> operation there are no effects.
! <ins>
! If an exception is thrown while inserting a single element at the end and <tt>T</tt> is <tt>CopyInsertable</tt>
! or <tt>is_nothrow_move_constructible&lt;T&gt;::value</tt> is <tt>true</tt>, there are no effects.
! </ins>
! <del>If</del><ins>Otherwise, if</ins> an exception is thrown by the move
! constructor of a non-<tt>CopyInsertable</tt> <tt>T</tt>, the effects are unspecified.
! </p><p>
! -2- <i>Complexity:</i> The complexity is linear in the number of elements inserted plus the distance to the end
! of the vector.
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2257"></a>2257. Simplify container requirements with the new algorithms</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Marshall Clow <b>Opened:</b> 2013-05-29 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Currently (n3690) Table 96 says, in the row for &quot;<tt>a == b</tt>&quot;, that the
! Operational semantics are:
! </p>
! <blockquote>
! 	<tt>==</tt> is an equivalence relation.<br/> 
! 	<tt>distance(a.begin(), a.end()) == distance(b.begin(), b.end()) &amp;&amp; equal(a.begin(), a.end(),b.begin())</tt>
! </blockquote>
! <p>
! Given the extension of equal for C++14, this can be simplified to:
! </p>
! <blockquote>
! 	<tt>==</tt> is an equivalence relation.<br/>
! 	<tt>equal(a.begin(), a.end(), b.begin(), b.end())</tt>
! </blockquote>
! 
! <p><i>[
! Alisdair notes that a similar edit would apply to the unordered containers requirements.
! ]</i></p>
! 
! 
! <p>
! Previous resolution from Marshall Clow:
! </p>
! <blockquote class="note">
! <p>
! Ammend the Operational Semantics for 23.2.1 [container.requirements.general], Table 96, row &quot;<tt>a == b</tt>&quot;
! </p>
! <blockquote>
! 	<tt>==</tt> is an equivalence relation.<br/>
! 	<tt><del>distance(a.begin(), a.end()) == distance(b.begin(), b.end()) &amp;&amp;</del> equal(a.begin(), a.end(), b.begin()<ins>, b.end()</ins>)</tt>
! </blockquote>
! 
! <p>
! Ammend 23.2.5 [unord.req] p12:
! </p>
! <blockquote>
! Two unordered containers <tt>a</tt> and <tt>b</tt> compare equal if <tt>a.size() == b.size()</tt>
! and, for every equivalent-key group <tt>[Ea1,Ea2)</tt> obtained from <tt>a.equal_range(Ea1)</tt>,
! there exists an equivalent-key group <tt>[Eb1,Eb2)</tt> obtained from <tt>b.equal_range(Ea1)</tt>,
! such that <del><tt>distance(Ea1, Ea2) == distance(Eb1, Eb2)</tt> and</del>
! <tt>is_permutation(Ea1, Ea2, Eb1<ins>, Eb2</ins>)</tt>
! returns <tt>true</tt>.  For ...
! </blockquote>
! </blockquote>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! 
! <p>
! Marshall improves wording
! </p>
! 
! <p><i>[2013-09 Chicago (evening issues)]</i></p>
! 
! <p>
! Moved to ready, after confirming latest wording reflects the discussion earlier in the day.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li>
! <p>
! Ammend 23.2.1 [container.requirements.general], Table 96 as indicated:
! </p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 96 &mdash; Container requirements (continued)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational<br/>semantics</th>
! <th>Assertion/note<br/>pre-/post-condition</th>
! <th>Complexity</th>
! </tr>
! 
! <tr>
! <td colspan="5" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a == b</tt>
! </td>
! <td>
! convertible to <tt>bool</tt>
! </td>
! <td>
! <tt>==</tt> is an equivalence relation.<br/>
! <tt><del>distance(a.begin(),<br/>
! a.end()) == <br/>
! distance(b.begin(),<br/>
! b.end()) &amp;&amp;</del><br/>
! equal(a.begin(),<br/>
! a.end(),<br/>
! b.begin()<ins>, b.end()</ins>)</tt>
! </td>
! <td>
! <i>Requires:</i> <tt>T</tt> is<br/>
! <tt>EqualityComparable</tt>
! </td>
! <td>
! <ins>Constant if <tt>a.size() != b.size()</tt>,</ins> linear <ins>otherwise</ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="5" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! 
! <li>
! <p>
! Ammend 23.2.5 [unord.req] p12:
! </p>
! <blockquote>
! Two unordered containers <tt>a</tt> and <tt>b</tt> compare equal if <tt>a.size() == b.size()</tt>
! and, for every equivalent-key group <tt>[Ea1,Ea2)</tt> obtained from <tt>a.equal_range(Ea1)</tt>,
! there exists an equivalent-key group <tt>[Eb1,Eb2)</tt> obtained from <tt>b.equal_range(Ea1)</tt>,
! such that <del><tt>distance(Ea1, Ea2) == distance(Eb1, Eb2)</tt> and</del>
! <tt>is_permutation(Ea1, Ea2, Eb1<ins>, Eb2</ins>)</tt>
! returns <tt>true</tt>.  For [&hellip;]
! </blockquote>
! </li>
! 
! <li><p>Amend 23.3.4.1 [forwardlist.overview] p2:</p>
! <blockquote><p>
! -2- A <tt>forward_list</tt> satisfies all of the requirements of a container (Table 96), except that the <tt>size()</tt> member
! function is not provided <ins>and <tt>operator==</tt> has linear complexity</ins>. [&hellip;]
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2258"></a>2258. <tt>a.erase(q1, q2)</tt> unable to directly return <tt>q2</tt></h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Geoff Alexander <b>Opened:</b> 2013-05-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Section 23.2.4 [associative.reqmts], Table 102, page 743 of the C++ 2011 Standard states that <tt>a.erase(q1, q2)</tt> 
! returns <tt>q2</tt>. The problem is that <tt>a.erase(q1, q2)</tt> cannot directly return <tt>q2</tt> as the return type, 
! <tt>iterator</tt>, differs from that of <tt>q2</tt>, <tt>const_iterator</tt>. 
! </p>
! 
! <p><i>[2013-09 Chicago (evening issues group)]</i></p>
! 
! <p>
! The wording looks good, but is worded slightly differently to how we say the same for sequence containers, and for unordered
! associative containers.  We should apply consistent wording in all three cases.
! </p>
! <p>
! Alisdair to provide the wording.
! </p>
! 
! <p><i>[2014-02-12 Issaquah meeting]</i></p>
! 
! <p>
! Move a Immediate.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>In the specification of <tt>a.erase(q1, q2)</tt> in sub-clause 23.2.4 [associative.reqmts], Table 102 change as indicated:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 102 &mdash; Associative container requirements (in addition to container) (continued)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Complexity</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.erase(q1, q2)</tt>
! </td>
! <td>
! <tt>iterator</tt>
! </td>
! <td>
! erases all the elements in the range <tt>[q1,q2)</tt>. Returns <del><tt>q2</tt></del><ins>
! an iterator pointing to the element pointed to by <tt>q2</tt> prior to any elements
! being erased. If no such element exists, <tt>a.end()</tt> is returned</ins>.
! </td>
! <td>
! <tt>log(a.size()) + N</tt> where <tt>N</tt> has the value <tt>distance(q1, q2)</tt>.
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2263"></a>2263. Comparing iterators and allocator pointers with different const-character</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements], 23.2 [container.requirements] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2013-06-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! This ancient issue <a href="lwg-defects.html#179">179</a> says one ought to be able to compare iterators with <tt>const_iterators</tt> 
! from any given container.  I'm having trouble finding words that guarantee this in C++11.  This impacts not only a 
! container's iterators, but also the allocator requirements in  allocator.requirements] surrounding 
! <tt>pointer</tt>, <tt>const_pointer</tt>, <tt>void_pointer</tt> and <tt>const_void_pointer</tt>.  E.g. can one 
! compare a <tt>pointer</tt> with a <tt>const_pointer</tt>? 
! <p/>
! Since <tt>allocator::pointer</tt> and <tt>const_pointer</tt> are required to be random access iterators, one could 
! expect that the <a href="lwg-defects.html#179">179</a> guarantees apply for them as well.
! </p>
! 
! <p><i>[
! Daniel comments:
! ]</i></p>
! 
! 
! <p>
! The wording for <a href="lwg-defects.html#179">179</a> was part of several working drafts (e.g. also in 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3092.pdf">N3092</a>) over some time and suddenly got lost
! in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3242.pdf">N3242</a>, presumably by accident. Whatever we
! decide for allocator pointers, I expect that we need to restore the  <a href="lwg-defects.html#179">179</a> wording as part of the overall resolution:
! </p>
! 
! <p>Reinsert after 23.2 [container.requirements] p6:</p>
! 
! <blockquote>
! <p>
! -6- <tt>begin()</tt> returns an iterator referring to the first element in the container. <tt>end()</tt> returns an iterator which
! is the past-the-end value for the container. If the container is empty, then <tt>begin() == end()</tt>;
! <p/>
! <ins>-?- In the expressions</ins>
! </p>
! <blockquote><pre>
! <ins>i == j
! i != j
! i &lt; j
! i &lt;= j
! i &gt;= j
! i &gt; j
! i - j</ins>
! </pre></blockquote>
! <p>
! <ins>where <tt>i</tt> and <tt>j</tt> denote objects of a container's <tt>iterator</tt> type, either or both may be replaced by an object 
! of the container's <tt>const_iterator</tt> type referring to the same element with no change in semantics.</ins>
! </p>
! </blockquote>
! 
! <p><i>[2014-02-13 Issaquah, Daniel comments and suggests wording]</i></p>
! 
! 
! <p>
! First, I didn't originally move the seemingly lost wording to the resolution section because I wanted to ensure that the 
! committee double-checks the reason of this loss. 
! <p/>
! Second, albeit restoring this wording will restore the comparability of <tt>const_iterator</tt> and <tt>iterator</tt> of
! containers specified in Clause 23, but this alone would <em>not</em> imply that this guarantee automatically extends to
! <em>all other</em> iterators, simply because there is no fundamental relation between a mutable iterator and a constant
! iterator by itself. This relation only exists under specific conditions, for example for containers which provide two such
! <tt>typedefs</tt> of that kind. Thus the wording restoration would <em>not</em> ensure that allocator <tt>pointer</tt> and 
! <tt>const_pointer</tt> would be comparable with each other. To realize that, we would need additional guarantees added
! to the allocator requirements. In fact, it is crucial to separate these things, because allocators are <em>not</em> 
! restricted to be used within containers, they have their own legitimate use for other places as well (albeit containers
! presumably belong to the most important use-cases), and this is also stated in the introduction of 17.6.3.5 [allocator.requirements],
! where it says:
! </p>
! <blockquote><p>
! All of the string types (Clause 21), containers (Clause 23) (except array), string buffers and string streams (Clause 27), 
! and <tt>match_results</tt> (Clause 28) are parameterized in terms of allocators.
! </p></blockquote>
! 
! <p><i>[2014-02-12 Issaquah meeting]</i></p>
! 
! <p>
! Move a Immediate.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>Insert after 17.6.3.5 [allocator.requirements] p4 as indicated:</p>
! 
! <blockquote><p>
! -4- An allocator type <tt>X</tt> shall satisfy the requirements of <tt>CopyConstructible</tt> (17.6.3.1). The <tt>X::pointer</tt>,
! <tt>X::const_pointer</tt>, <tt>X::void_pointer</tt>, and <tt>X::const_void_pointer</tt> types shall satisfy the requirements
! of <tt>NullablePointer</tt> (17.6.3.3). No constructor, comparison operator, copy operation, move operation, or
! swap operation on these types shall exit via an exception. <tt>X::pointer</tt> and <tt>X::const_pointer</tt> shall also
! satisfy the requirements for a random access iterator (24.2).
! <p/>
! <ins>-?- Let <tt>x1</tt> and <tt>x2</tt> denote objects of (possibly different) types <tt>X::void_pointer</tt>, 
! <tt>X::const_void_pointer</tt>, <tt>X::pointer</tt>, or <tt>X::const_pointer</tt>. Then, <tt>x1</tt> and <tt>x2</tt>
! are <em>equivalently-valued</em> pointer values, if and only if both <tt>x1</tt> and <tt>x2</tt> can be explicitly converted 
! to the two corresponding objects <tt>px1</tt> and <tt>px2</tt> of type <tt>X::const_pointer</tt>, using a sequence of
! <tt>static_cast</tt>s using only these four types, and the expression <tt>px1 == px2</tt> evaluates to <tt>true</tt>.</ins>
! </p>
! <blockquote class="note"><p>
! <em>Drafting note:</em> This wording uses the seemingly complicated route via <tt>X::const_pointer</tt>, because these are (contrary to
! <tt>X::const_void_pointer</tt>) random access iterators and we can rely here for dereferenceable values on the fundamental pointee
! equivalence of 24.2.5 [forward.iterators] p6:
! </p>
! <blockquote><p>
! If <tt>a</tt> and <tt>b</tt> are both dereferenceable, then <tt>a == b</tt> if and only if <tt>*a</tt> and <tt>*b</tt> are 
! bound to the same object.
! </p></blockquote>
! <p>
! while for null pointer values we can rely on the special equality relation induced by 17.6.3.3 [nullablepointer.requirements].
! </p>
! </blockquote>
! <p>
! <ins>-?- Let <tt>w1</tt> and <tt>w2</tt> denote objects of type <tt>X::void_pointer</tt>. Then for the expressions</ins>
! </p>
! <blockquote><pre>
! <ins>w1 == w2
! w1 != w2</ins>
! </pre></blockquote>
! <p>
! <ins>either or both objects may be replaced by an equivalently-valued object of type <tt>X::const_void_pointer</tt> with no 
! change in semantics.</ins>
! <p/>
! <ins>-?- Let <tt>p1</tt> and <tt>p2</tt> denote objects of type <tt>X::pointer</tt>. Then for the expressions</ins>
! </p>
! <blockquote><pre>
! <ins>p1 == p2
! p1 != p2
! p1 &lt; p2
! p1 &lt;= p2
! p1 &gt;= p2
! p1 &gt; p2
! p1 - p2</ins>
! </pre></blockquote>
! <p>
! <ins>either or both objects may be replaced by an equivalently-valued object of type <tt>X::const_pointer</tt> with no 
! change in semantics.</ins>
! </p>
! </blockquote>
! </li>
! <li><p>Reinsert after 23.2 [container.requirements] p6:</p>
! 
! <blockquote><p>
! -6- <tt>begin()</tt> returns an iterator referring to the first element in the container. <tt>end()</tt> returns an iterator which
! is the past-the-end value for the container. If the container is empty, then <tt>begin() == end()</tt>;
! <p/>
! <ins>-?- In the expressions</ins>
! </p>
! <blockquote><pre>
! <ins>i == j
! i != j
! i &lt; j
! i &lt;= j
! i &gt;= j
! i &gt; j
! i - j</ins>
! </pre></blockquote>
! <p>
! <ins>where <tt>i</tt> and <tt>j</tt> denote objects of a container's <tt>iterator</tt> type, either or both may be replaced by an object 
! of the container's <tt>const_iterator</tt> type referring to the same element with no change in semantics.</ins>
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2266"></a>2266. <tt>vector</tt> and <tt>deque</tt> have incorrect <tt>insert</tt> requirements</h3>
! <p><b>Section:</b> 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Ahmed Charles <b>Opened:</b> 2013-05-17 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#sequence.reqmts">issues</a> in [sequence.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! According to Table 100 in n3485 23.2.3 [sequence.reqmts]/4 the notes for the expression <tt>a.insert(p,i,j)</tt>
! say:
! </p>
! 
! <blockquote><p>
! <i>Requires:</i> <tt>T</tt> shall be <tt>EmplaceConstructible</tt>
! into <tt>X</tt> from <tt>*i</tt>. For <tt>vector</tt>, if the iterator
! does not meet the forward iterator requirements (24.2.5), <tt>T</tt> shall also be
! <tt>MoveInsertable</tt> into <tt>X</tt> and <tt>MoveAssignable</tt>.
! <p/>
! Each iterator in the range <tt>[i,j)</tt> shall be dereferenced exactly once.
! <p/>
! <i>pre:</i> <tt>i</tt> and <tt>j</tt> are not iterators into <tt>a</tt>.
! <p/>
! Inserts copies of elements in <tt>[i, j)</tt> before <tt>p</tt>
! </p></blockquote>
! 
! <p>
! There are two problems with that wording: First, the special constraints for <tt>vector</tt>, that are expressed to be valid for
! forward iterators only, are necessary for all iterator categories. Second, the same special constraints are needed for <tt>deque</tt>, too. 
! </p>
! 
! <p><i>[2013-10-05, Stephan T. Lavavej comments and provides alternative wording]</i></p>
! 
! <p>
! In Chicago, we determined that the original proposed resolution was correct, except that it needed additional requirements.  
! When <tt>vector</tt> <tt>insert(p, i, j)</tt> is called with input-only iterators, it can't know how many elements will be inserted, 
! which is obviously problematic for insertion anywhere other than at the end. Therefore, implementations typically append elements 
! (geometrically reallocating), followed by <tt>rotate()</tt>. Given forward+ iterators, some implementations append and 
! <tt>rotate()</tt> when they determine that there is sufficient capacity. Additionally, <tt>deque</tt> <tt>insert(p, i, j)</tt> is 
! typically implemented with prepending/appending, with a possible call to <tt>reverse()</tt>, followed by a call to <tt>rotate()</tt>.  
! Note that <tt>rotate()</tt>'s requirements are strictly stronger than <tt>reverse()</tt>'s.
! <p/>
! Therefore, when patching Table 100, we need to add <tt>rotate()</tt>'s requirements. Note that this does not physically affect code 
! (implementations were already calling <tt>rotate()</tt> here), and even in Standardese terms it is barely noticeable &mdash; if an 
! element is <tt>MoveInsertable</tt> and <tt>MoveAssignable</tt> then it is almost certainly <tt>MoveConstructible</tt> and swappable.  
! However, this patch is necessary to be strictly correct.
! </p>
! 
! <p>
! Previous resolution from Ahmed Charles:
! </p>
! <blockquote class="note">
! <ol>
! <li><p>Change Table 100 as indicated:</p>
! <blockquote>
! <table border="1">
! <caption>Table 100 &mdash; Sequence container requirements (in addition to container) (continued)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.insert(p,i,j)</tt>
! </td>
! <td>
! <tt>iterator</tt>
! </td>
! <td>
! <i>Requires:</i> <tt>T</tt> shall be <tt>EmplaceConstructible</tt>
! into <tt>X</tt> from <tt>*i</tt>. For <tt>vector</tt> <ins>and <tt>deque</tt></ins>, <del>if the iterator
! does not meet the forward iterator requirements (24.2.5),</del> <tt>T</tt> shall also be
! <tt>MoveInsertable</tt> into <tt>X</tt> and <tt>MoveAssignable</tt>.<br/>
! Each iterator in the range <tt>[i,j)</tt> shall be dereferenced exactly once.<br/>
! <i>pre:</i> <tt>i</tt> and <tt>j</tt> are not iterators into <tt>a</tt>.<br/>
! Inserts copies of elements in <tt>[i, j)</tt> before <tt>p</tt>
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2014-02-15 post-Issaquah session : move to Tentatively Ready]</i></p>
! 
! <p>
! Pablo: We might have gone too far with the fine-grained requirements. Typically these things come in groups.
! </p>
! <p>
! Alisdair: I think the concepts folks assumed we would take their guidance.
! </p>
! <p>
! Move to Tentatively Ready.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li><p>Change Table 100 as indicated:</p>
! <blockquote>
! <table border="1">
! <caption>Table 100 &mdash; Sequence container requirements (in addition to container) (continued)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>a.insert(p,i,j)</tt>
! </td>
! <td>
! <tt>iterator</tt>
! </td>
! <td>
! <i>Requires:</i> <tt>T</tt> shall be <tt>EmplaceConstructible</tt> into <tt>X</tt><br/> 
! from <tt>*i</tt>. For <tt>vector</tt> <ins>and <tt>deque</tt></ins>, <del>if the iterator</del><br/>
! <del>does not meet the forward iterator requirements (24.2.5),</del> <tt>T</tt> shall also be<br/>
! <tt>MoveInsertable</tt> into <tt>X</tt><ins>, <tt>MoveConstructible</tt>,</ins><br/> 
! <del>and</del> <tt>MoveAssignable</tt><ins>, and swappable (17.6.3.2 [swappable.requirements])</ins>.<br/>
! Each iterator in the range <tt>[i,j)</tt> shall be dereferenced exactly once.<br/>
! <i>pre:</i> <tt>i</tt> and <tt>j</tt> are not iterators into <tt>a</tt>.<br/>
! Inserts copies of elements in <tt>[i, j)</tt> before <tt>p</tt>
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2268"></a>2268. Setting a default argument in the declaration of a member function <tt>assign</tt> of <tt>std::basic_string</tt></h3>
! <p><b>Section:</b> 21.4 [basic.string] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Vladimir Grigoriev <b>Opened:</b> 2013-06-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#basic.string">active issues</a> in [basic.string].</p>
! <p><b>View all other</b> <a href="lwg-index.html#basic.string">issues</a> in [basic.string].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Constructors and member functions <tt>assign</tt> of class <tt>std::basic_string</tt> have one to one relation (except the 
! explicit constructor that creates an empty string). The following list shows this relation:
! </p>
! 
! <blockquote><pre>
! explicit basic_string(const Allocator&amp; a = Allocator());
! 
! basic_string(const basic_string&amp; str);
! basic_string&amp; assign(const basic_string&amp; str);
! 
! basic_string(basic_string&amp;&amp; str) noexcept;
! basic_string&amp; assign(basic_string&amp;&amp; str) noexcept;
! 
! basic_string(const basic_string&amp; str, size_type pos, size_type n = npos,
!   const Allocator&amp; a = Allocator());
! basic_string&amp; assign(const basic_string&amp; str, size_type pos,
!   size_type n);
! 
! basic_string(const charT* s,
!   size_type n, const Allocator&amp; a = Allocator());
! basic_string&amp; assign(const charT* s, size_type n);
! 
! basic_string(const charT* s, const Allocator&amp; a = Allocator());
! basic_string&amp; assign(const charT* s);
! 
! basic_string(size_type n, charT c, const Allocator&amp; a = Allocator());
! basic_string&amp; assign(size_type n, charT c);
! 
! template&lt;class InputIterator&gt;
! basic_string(InputIterator begin, InputIterator end,
!   const Allocator&amp; a = Allocator());
! template&lt;class InputIterator&gt;
! basic_string&amp; assign(InputIterator first, InputIterator last);
! 
! basic_string(initializer_list&lt;charT&gt;, const Allocator&amp; = Allocator());
! basic_string&amp; assign(initializer_list&lt;charT&gt;);
! </pre></blockquote>
! 
! <p>
! So in fact any creating of an object of type <tt>std::basic_string</tt> using any of the above constructors 
! except the explicit constructor can be substituted for creating a (possibly non-empty) string and 
! then applying to it the corresponding method assign.
! <p/>
! For example these two code snippets give the same result:
! </p>
! 
! <blockquote><pre>
! std::string s("Hello World");
! </pre></blockquote>
! 
! <p>
! and
! </p>
! 
! <blockquote><pre>
! std::string s;
! s.assign("Hello World");
! </pre></blockquote>
! 
! <p>
! However there is one exception that has no a logical support. It is the pair of the following constructor and member function 
! <tt>assign</tt>
! </p>
! 
! <blockquote><pre>
! basic_string(const basic_string&amp; str, size_type pos, size_type n = npos,
!              const Allocator&amp; a = Allocator());
! 
! basic_string&amp; assign(const basic_string&amp; str, size_type pos, size_type n);
! </pre></blockquote>
! 
! <p>
! The third parameter of the constructor has a default argument while in the <tt>assign</tt> function it is absent. So it is impossible 
! one to one to substitute the following code snippet
! </p>
! 
! <blockquote><pre>
! std::string s("Hello World");
! std::string t(s, 6);
! </pre></blockquote>
! 
! <p>
! by
! </p>
! 
! <blockquote><pre>
! std::string s("Hello World");
! std::string t;
! t.assign(s, 6); // error: no such function
! </pre></blockquote>
! 
! <p>
! To get an equivalent result using the <tt>assign</tt> function the programmer has to complicate the code that is error-prone
! </p>
! 
! <blockquote><pre>
! std::string s("Hello World");
! std::string t;
! t.assign(s, 6, s.size() - 6); 
! </pre></blockquote>
! 
! <p>
! To fix that, the declaration of the member function <tt>assign</tt> should be changed in such a way that its declaration 
! would be fully compatible with the declaration of the corresponding constructor, that is to specify the same default argument 
! for the third parameter of the <tt>assign</tt>.
! </p>
! 
! <p>
! The <tt>assign</tt> function is not the only function that requires to be revised. 
! <p/>
! Now let include in the list of pairs constructor-assign with the modified method <tt>assign</tt> one more member function 
! <tt>append</tt>. We will get:
! </p>
! 
! <blockquote><pre>
! explicit basic_string(const Allocator&amp; a = Allocator());
! 
! basic_string(const basic_string&amp; str);
! basic_string&amp; assign(const basic_string&amp; str);
! <span style="color:#009900;font-weight:bold">basic_string&amp; append(const basic_string&amp; str);</span>
! 
! basic_string(basic_string&amp;&amp; str) noexcept;
! basic_string&amp; assign(basic_string&amp;&amp; str) noexcept;
! 
! basic_string(const basic_string&amp; str, size_type pos, size_type n = npos,
!   const Allocator&amp; a = Allocator());
! basic_string&amp; assign(const basic_string&amp; str, size_type pos,
!   size_type n);
! <span style="color:#009900;font-weight:bold">basic_string&amp; append(const basic_string&amp; str, size_type pos,
!   size_type n);</span>
! 
! basic_string(const charT* s,
!   size_type n, const Allocator&amp; a = Allocator());
! basic_string&amp; assign(const charT* s, size_type n);
! <span style="color:#009900;font-weight:bold">basic_string&amp; append(const charT* s, size_type n);</span>
! 
! basic_string(const charT* s, const Allocator&amp; a = Allocator());
! basic_string&amp; assign(const charT* s);
! <span style="color:#009900;font-weight:bold">basic_string&amp; append(const charT* s);</span>
! 
! basic_string(size_type n, charT c, const Allocator&amp; a = Allocator());
! basic_string&amp; assign(size_type n, charT c);
! <span style="color:#009900;font-weight:bold">basic_string&amp; append(size_type n, charT c);</span>
! 
! template&lt;class InputIterator&gt;
! basic_string(InputIterator begin, InputIterator end,
!   const Allocator&amp; a = Allocator());
! template&lt;class InputIterator&gt;
! basic_string&amp; assign(InputIterator first, InputIterator last);
! <span style="color:#009900;font-weight:bold">template&lt;class InputIterator&gt;
! basic_string&amp; append(InputIterator first, InputIterator last);</span>
! 
! basic_string(initializer_list&lt;charT&gt;, const Allocator&amp; = Allocator());
! basic_string&amp; assign(initializer_list&lt;charT&gt;);
! <span style="color:#009900;font-weight:bold">basic_string&amp; append(initializer_list&lt;charT&gt;);</span>
! </pre></blockquote>
! 
! <p>As it seen from this record:</p>
! 
! <blockquote><pre>
! basic_string(const basic_string&amp; str, size_type pos, size_type n = npos,
!   const Allocator&amp; a = Allocator());
! basic_string&amp; assign(const basic_string&amp; str, size_type pos,
!   size_type n);
! <span style="color:#009900;font-weight:bold">basic_string&amp; append(const basic_string&amp; str, size_type pos,
!   size_type n);</span>
! </pre></blockquote>
! 
! <p>
! it is obvious that the function <tt>append</tt> also should have the default argument that is that it should be declared as:
! </p>
! 
! <blockquote><pre>
! basic_string&amp; append(const basic_string&amp; str, size_type pos,
!   size_type n <ins>= npos</ins>);
! </pre></blockquote>
! 
! <p>
! In fact there is no a great difference in using <tt>assign</tt> or <tt>append</tt> especially when the string is empty:
! </p>
! 
! <blockquote><pre>
! std::string s("Hello World");
! std::string t;
! t.assign(s, 6);
!  
! std::string s("Hello World");
! std::string t;
! t.append(s, 6);
! </pre></blockquote>
! 
! <p>
! In both cases the result will be the same. So the <tt>assign</tt> and <tt>append</tt> will be interchangeable from the point 
! of view of used arguments.
! <p/>
! There are another three member functions in class <tt>std::basic_string</tt> that could be brought in conformity with considered above functions.  
! They are member functions <tt>insert</tt>, <tt>replace</tt>, and <tt>compare</tt>.
! <p/>
! So it is suggested to substitute the following declarations of <tt>insert</tt>, <tt>replace</tt>, and <tt>compare</tt>:
! </p>
! 
! <blockquote><pre>
! basic_string&amp; insert(size_type pos1, const basic_string&amp; str,
!   size_type pos2, size_type n);
! 
! basic_string&amp; replace(size_type pos1, size_type n1,
!   const basic_string&amp; str, size_type pos2, size_type n2);
! 
! int compare(size_type pos1, size_type n1,
!   const basic_string&amp; str, size_type pos2, size_type n2) const;
! </pre></blockquote>
! 
! <p>
! by the declarations:
! </p>
! 
! <blockquote><pre>
! basic_string&amp; insert(size_type pos1, const basic_string&amp; str,
!   size_type pos2, size_type n <ins>= npos</ins>);
! 
! basic_string&amp; replace(size_type pos1, size_type n1,
!   const basic_string&amp; str, size_type pos2, size_type n2 <ins>= npos</ins>);
! 
! int compare(size_type pos1, size_type n1,
!   const basic_string&amp; str, size_type pos2, size_type n2 <ins>= npos</ins>) const;
! </pre></blockquote>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Howard: Are we positive this won't conflict with any other overloads? 
! <p/>
! They all appear to be unambiguous. 
! <p/>
! Alisdair: Ok, move to Ready. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li><p>Change class template <tt>basic_string</tt> synopsis, 21.4 [basic.string] p5, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template&lt;class charT, class traits = char_traits&lt;charT&gt;,
!     class Allocator = allocator&lt;charT&gt; &gt;
!   class basic_string {
!   public:
!     [&hellip;]
!     basic_string&amp; append(const basic_string&amp; str, size_type pos, size_type n <ins>= npos</ins>);
!     [&hellip;]
!     basic_string&amp; assign(const basic_string&amp; str, size_type pos, size_type n <ins>= npos</ins>);
!     [&hellip;]
!     basic_string&amp; insert(size_type pos1, const basic_string&amp; str, size_type pos2, size_type n <ins>= npos</ins>);
!     [&hellip;]
!     basic_string&amp; replace(size_type pos1, size_type n1, const basic_string&amp; str, size_type pos2, size_type n2 <ins>= npos</ins>);
!     [&hellip;]
!     int compare(size_type pos1, size_type n1, const basic_string&amp; str, size_type pos2, size_type n2 <ins>= npos</ins>) const;
!     [&hellip;]
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Change 21.4.6.2 [string::append] before p3 as indicated:</p>
! 
! <blockquote><pre>
! basic_string&amp; append(const basic_string&amp; str, size_type pos, size_type n <ins>= npos</ins>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 21.4.6.3 [string::assign] before p4 as indicated:</p>
! 
! <blockquote><pre>
! basic_string&amp; assign(const basic_string&amp; str, size_type pos, size_type n <ins>= npos</ins>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 21.4.6.4 [string::insert] before p5 as indicated:</p>
! 
! <blockquote><pre>
! basic_string&amp; insert(size_type pos1, const basic_string&amp; str, size_type pos2, size_type n <ins>= npos</ins>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 21.4.6.6 [string::replace] before p5 as indicated:</p>
! 
! <blockquote><pre>
! basic_string&amp; replace(size_type pos1, size_type n1, const basic_string&amp; str, size_type pos2, size_type n2 <ins>= npos</ins>);
! </pre></blockquote>
! </li>
! 
! <li><p>Change 21.4.7.9 [string::compare] before p4 as indicated:</p>
! 
! <blockquote><pre>
! int compare(size_type pos1, size_type n1, const basic_string&amp; str, size_type pos2, size_type n2 <ins>= npos</ins>) const;
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2271"></a>2271. <tt>regex_traits::lookup_classname</tt> specification unclear</h3>
! <p><b>Section:</b> 28.7 [re.traits] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-07-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.traits">issues</a> in [re.traits].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 28.7 [re.traits] p9 says that <tt>regex_traits::lookup_classname</tt> should
! return a value that compares equal to 0, but there is no requirement
! that a bitmask type is equality comparable with 0, e.g. 17.5.2.1.3 [bitmask.types] says bitmask types 
! can be implemented using <tt>std::bitset</tt>.
! <p/>
! Either there should be an additional requirement on the type or the function definition should be fixed.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Stefanus: Resolution looks good, doesn't seem to need fixing anywhere else from a quick look through the draft.
! <p/>
! Any objection to Ready?
! <p/>
! No objection.
! <p/>
! Action: Move to Ready. </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 28.7 [re.traits] p9:</p>
! 
! <blockquote>
! <pre>
! template &lt;class ForwardIterator&gt;
!   char_class_type lookup_classname(
!     ForwardIterator first, ForwardIterator last, bool icase = false) const;
! </pre>
! <blockquote>
! <p>
! -9- <i>Returns:</i> an unspecified value that represents the character classification named by the character
! sequence designated by the iterator range <tt>[first,last)</tt>. If the parameter <tt>icase</tt> is true then the
! returned mask identifies the character classification without regard to the case of the characters being
! matched, otherwise it does honor the case of the characters being matched. The value returned shall
! be independent of the case of the characters in the character sequence. If the name is not recognized
! then returns <del>a value that compares equal to 0</del><ins><tt>char_class_type()</tt></ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2272"></a>2272. <tt>quoted</tt> should use <tt>char_traits::eq</tt> for character comparison</h3>
! <p><b>Section:</b> 27.7.6 [quoted.manip] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Marshall Clow <b>Opened:</b> 2013-07-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#quoted.manip">issues</a> in [quoted.manip].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 27.7.6 [quoted.manip] p2 b2:
! </p>
! <blockquote>
! <p>
! &mdash; Each character in <tt>s</tt>. If the character to be output is equal to <tt>escape</tt> or <tt>delim</tt>, 
! as determined by <tt>operator==</tt>, first output <tt>escape</tt>.
! </p>
! </blockquote>
! <p>
! In 27.7.6 [quoted.manip] p3 b1 sb1:
! </p>
! <blockquote>
! <p>
! &mdash; If the first character extracted is equal to <tt>delim</tt>, as determined by <tt>operator==</tt>, [&hellip;]
! </p>
! </blockquote>
! 
! <p>
! these should both use <tt>traits::eq</tt>.
! </p>
! 
! <p>
! Also, I believe that 27.7.6 [quoted.manip] p3 implies that:
! </p>
! <blockquote>
! <pre>
! std::ostream _stream;
! std::string _string;
! _stream &lt;&lt; _string;
! _stream &lt;&lt; quoted(_string);
! </pre>
! </blockquote>
! <p>
! should both compile, or both fail to compile, based on whether or not their <tt>char_traits</tt> match.
! But I believe that the standard should say that explicitly.
! </p>
! 
! <p><i>[
! 2013-09 Chicago
! ]</i></p>
! 
! 
! <p>
! Marshall Clow improved the wording with support from Stefanus.
! </p>
! 
! <p><i>[
! 2013-09 Chicago (late night issues)
! ]</i></p>
! 
! 
! <p>
! Moved to Ready, after confirming wording correctly reflects discussion earlier in the day.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 27.7.6 [quoted.manip] p2+3 as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class charT&gt;
!   <i>unspecified</i> quoted(const charT* s, charT delim=charT('"'), charT escape=charT('\\'));
! template &lt;class charT, class traits, class Allocator&gt;
!   <i>unspecified</i> quoted(const basic_string&lt;charT, traits, Allocator>&amp; s,
!                      charT delim=charT('"'), charT escape=charT('\\'));
! </pre>
! <blockquote>
! <p>
! -2- <i>Returns:</i> An object of unspecified type such that if <tt>out</tt> is an instance of <tt>basic_ostream</tt> with member
! type <tt>char_type</tt> the same as <tt>charT</tt> <ins>and with member type <tt>traits_type</tt>, which in the second form is 
! the same as <tt>traits</tt></ins>, then the expression 
! <tt>out &lt;&lt; quoted(s, delim, escape)</tt> behaves
! as if it inserts the following characters into <tt>out</tt> using character inserter function templates (27.7.3.6.4),
! which may throw <tt>ios_base::failure</tt> (27.5.3.1.1):
! </p>
! <ul>
! <li><p><tt>delim</tt></p></li>
! <li><p>Each character in <tt>s</tt>. If the character to be output is equal to <tt>escape</tt> or <tt>delim</tt>, 
! as determined by <del><tt>operator==</tt></del><ins><tt>traits_type::eq</tt></ins>, first output <tt>escape</tt>.</p></li>
! <li><p><tt>delim</tt></p></li>
! </ul>
! </blockquote>
! 
! <pre>
! template &lt;class charT, class traits, class Allocator&gt;
!   <i>unspecified</i> quoted(basic_string&lt;charT, traits, Allocator>&amp; s,
!                      charT delim=charT('"'), charT escape=charT('\\'));
! </pre>
! <blockquote>
! <p>
! -3- <i>Returns:</i> An object of unspecified type such that:
! </p>
! <ul>
! <li><p>If <tt>in</tt> is an instance of <tt>basic_istream</tt> with member type<ins>s</ins> <tt>char_type</tt>
! <ins>and <tt>traits_type</tt></ins> the same as <tt>charT</tt> <ins>and <tt>traits</tt>, respectively</ins>, then the 
! expression <tt>in &gt;&gt; quoted(s, delim, escape)</tt> behaves as if it extracts 
! the following characters from in using <tt>basic_istream::operator&gt;&gt;</tt> (27.7.2.2.3) which may throw 
! <tt>ios_base::failure</tt> (27.5.3.1.1):
! </p>
! <ul>
! <li><p>If the first character extracted is equal to <tt>delim</tt>, as determined by 
! <del><tt>operator==</tt></del><ins><tt>traits_type::eq</tt></ins>, then: [&hellip;]</p></li>
! </ul>
! </li>
! <li><p>
! If <tt>out</tt> is an instance of <tt>basic_ostream</tt> with member type<ins>s</ins> <tt>char_type</tt>
! <ins>and <tt>traits_type</tt></ins> the same as <tt>charT</tt> <ins>and <tt>traits</tt>, respectively</ins>, 
! then the expression <tt>out &lt;&lt; quoted(s, delim, escape)</tt> behaves as specified for the <tt>const 
! basic_string&lt;charT, traits, Allocator&gt;&amp;</tt> overload of the quoted function.
! </p></li>
! </ul>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2274"></a>2274. Does <tt>map::operator[]</tt> value-initialize or default-insert a missing element?</h3>
! <p><b>Section:</b> 23.4.4.3 [map.access], 23.5.4.3 [unord.map.elem] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Andrzej Krzemie&#324;ski <b>Opened:</b> 2013-07-16 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#map.access">issues</a> in [map.access].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Suppose that I provide a custom allocator for type <tt>int</tt>, that renders value 1 rather than 0 in default-insertion:
! </p>
! <blockquote>
! <pre>
! struct Allocator1 : std::allocator&lt;int&gt;
! {
!   using super = std::allocator&lt;int&gt;;
! 
!   template&lt;typename Up, typename... Args&gt;
!   void construct(Up* p, Args&amp;&amp;... args)
!   { super::construct(p, std::forward&lt;Args&gt;(args)...); }
! 
!   template&lt;typename Up&gt;
!   void construct(Up* p)
!   { ::new((void*)p) Up(1); }
! };
! </pre>
! </blockquote>
! 
! <p>
! Now, if I use this allocator with <tt>std::map</tt>, and I use <tt>operator[]</tt> to access a not-yet-existent value, 
! what value of the <tt>mapped_type</tt> should be created? 0 (value-initialization) or 1 (default-insertion):
! </p>
! 
! <blockquote>
! <pre>
! map&lt;string, int, less&lt;string&gt;, Allocator1&gt; map;
! cout &lt;&lt; map["cat"];
! </pre>
! </blockquote>
! 
! <p>
! N3960 is not very clear. 23.4.4.3 [map.access] in para 1 says:
! </p>
! <blockquote>
! <p>
! "If there is no key equivalent to <tt>x</tt> in the map, inserts <tt>value_type(x, T())</tt> into the map."
! </p>
! </blockquote>
! <p>
! So, it requires value-initialization.
! <p/>
! But para 2 says:
! </p>
! <blockquote>
! <p>
! "<tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> into <tt>*this</tt>."
! </p>
! </blockquote>
! <p>
! This implies default-insertion, because if not, why the requirement. Also similar functions like 
! <tt>vector::resize</tt> already require default-insertion wherever they put <tt>DefaultInsertable</tt> requirements.
! <p/>
! Not to mention that default-insertion is more useful, because it allows custom allocators to "override" the 
! default value of <tt>mapped_type</tt>.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Alisdair: Matters only for POD or trivial types 
! <p/>
! Marshall: issue might show up elsewhere other than <tt>map&lt;&gt;</tt> 
! <p/>
! Alisdair: initialize elements in any containers &mdash; by calling construct on allocator traits 
! <p/>
! Marshall: existing wording is clear 
! <p/>
! Alisdair: main concern is difference in wording, discusses default initialization 
! <p/>
! Nico: different requirement needed 
! <p/>
! Alisdair: gut is issue is NAD, brings up <tt>DefaultInsertable</tt> definition &mdash; discusses definition 
! <p/>
! Nico: why do we have the requirement? 
! <p/>
! Alisdair: other containers have this requirement 
! <p/>
! Marshall: this applies to many other containers 
! <p/>
! Nico: <tt>deque&lt;&gt;</tt> in particular 
! <p/>
! Alisdair: discusses allocator construct 
! <p/>
! Alisdair: wording raises concerns that aren't said in existing standard 
! <p/>
! Nico: sees no benefit to change 
! <p/>
! Marshall: leery of change 
! <p/>
! Alisdair: can be made clearer; might need to add note to <tt>DefaultInsertable</tt>; borderline editorial, 
! comfortable without note, willing to wait until other issues arise. close issue as NAD
! </p>
! 
! <p><i>[2015-01-20: Tomasz Kami&nacute;ski comments]</i></p>
! 
! <p>
! With the addition of the <tt>try_emplace</tt> method the behavior of the <tt>operator[]</tt> for the maps, 
! may be defined as follows:
! </p>
! <blockquote>
! <pre>
! T&amp; operator[](const key_type&amp; x);
! </pre>
! <blockquote>
! <p>
! <i>Effects</i>: Equivalent to: <tt>try_emplace(x).first-&gt;second</tt>;
! </p>
! </blockquote>
! <pre>
! T&amp; operator[](key_type&amp;&amp; x);
! </pre>
! <blockquote>
! <p>
! <i>Effects</i>: Equivalent to <tt>try_emplace(std::move(x)).first-&gt;second</tt>;
! </p>
! </blockquote>
! </blockquote>
! <p>
! This would simplify the wording and also after resolution of the issue <a href="lwg-defects.html#2464">2464</a>, this wording would 
! also address this issue.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Wait until <a href="lwg-defects.html#2464">2464</a> and <a href="lwg-active.html#2469">2469</a> are in, which solve this.
! </p>
! 
! <p><i>[2015-05-06 Lenexa: This is resolved by <a href="lwg-active.html#2469">2469</a>.]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 23.4.4.3 [map.access] p1+p5 as indicated:</p>
! 
! <blockquote>
! <pre>
! T&amp; operator[](const key_type&amp; x);
! </pre>
! <blockquote>
! <p>
! -1- <i>Effects:</i> If there is no key equivalent to <tt>x</tt> in the map, inserts <del><tt>value_type(x, T())</tt> 
! into the map</del><ins>into the map a value with <tt>key_type</tt> initialized using expression <tt>x</tt> and <tt>mapped_type</tt> 
! initialized by default-insertion</ins>.
! <p/>
! -2- <i>Requires:</i> <tt>key_type</tt> shall be <tt>CopyInsertable</tt> and <tt>mapped_type</tt> shall be 
! <tt>DefaultInsertable</tt> into <tt>*this</tt>.
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! T&amp; operator[](key_type&amp;&amp; x);
! </pre>
! <blockquote>
! <p>
! -5- <i>Effects:</i> If there is no key equivalent to <tt>x</tt> in the map, inserts 
! <del><tt>value_type(std::move(x), T())</tt> into the map</del><ins>into the map a value with <tt>key_type</tt> 
! initialized using expression <tt>std::move(x)</tt> and <tt>mapped_type</tt> initialized by default-insertion</ins>.
! <p/>
! -6- <i>Requires:</i> <tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> into <tt>*this</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 23.5.4.3 [unord.map.elem] p2 as indicated:</p>
! 
! <blockquote>
! <pre>
! mapped_type&amp; operator[](const key_type&amp; k);
! mapped_type&amp; operator[](key_type&amp;&amp; k);
! </pre>
! <blockquote>
! <p>
! -1- <i>Requires:</i> <tt>mapped_type</tt> shall be <tt>DefaultInsertable</tt> into <tt>*this</tt>. 
! For the first operator, <tt>key_type</tt> shall be <tt>CopyInsertable</tt> into <tt>*this</tt>. For the second 
! operator, <tt>key_type</tt> shall be <tt>MoveConstructible</tt>.
! <p/>
! -2- <i>Effects:</i> If the <tt>unordered_map</tt> does not already contain an element whose key is equivalent to 
! <tt>k</tt>, the first operator inserts <del>the value <tt>value_type(k, mapped_type())</tt></del><ins>a value with 
! <tt>key_type</tt> initialized using expression <tt>x</tt> and <tt>mapped_type</tt> initialized by default-insertion</ins> 
! and the second operator inserts <del>the value <tt>value_type(std::move(k), mapped_type())</tt></del><ins>a value 
! with <tt>key_type</tt> initialized using expression <tt>std::move(x)</tt> and <tt>mapped_type</tt> initialized by 
! default-insertion</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2275"></a>2275. [CD] Why is <tt>forward_as_tuple</tt> not <tt>constexpr</tt>?</h3>
! <p><b>Section:</b> 20.4.2.4 [tuple.creation] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Marshall Clow <b>Opened:</b> 2013-07-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses ES 11</b></p>
! 
! <p>
! In <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3471.html">n3471</a>, a bunch of routines 
! from header <tt>&lt;tuple&gt;</tt> were made <tt>constexpr</tt>.
! <p/>
! <tt>make_tuple/tuple_cat/get&lt;&gt;(tuple)/</tt>relational operators &mdash; all these were "constexpr-ified".
! <p/>
! But not <tt>forward_as_tuple</tt>.
! <p/>
! Why not?
! <p/>
! This was discussed in Portland, and STL opined that this was "an omission" (along with <tt>tuple_cat</tt>, which was added)
! <p/>
! In discussion on c++std-lib@accu.org list, Pablo agreed that <tt>forward_as_tuple</tt> should be <tt>constexpr</tt>.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Moved to Immediate, this directly addresses an NB comment and the wording is non-controversial.
! </p>
! <p>
! Accept for Working Paper
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change header <tt>&lt;tuple&gt;</tt> synopsis, 20.4.1 [tuple.general] as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class... Types&gt;
!   <ins>constexpr</ins> tuple&lt;Types&amp;&amp;...&gt; forward_as_tuple(Types&amp;&amp;...) noexcept;
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Change 20.4.2.4 [tuple.creation] before p5 as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class... Types&gt;
!   <ins>constexpr</ins> tuple&lt;Types&amp;&amp;...&gt; forward_as_tuple(Types&amp;&amp;... t) noexcept;
! </pre>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2278"></a>2278. User-defined literals for Standard Library types</h3>
! <p><b>Section:</b> 20.12.2 [time.syn], 21.3 [string.classes] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2013-07-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3642.pdf">This paper</a> adds user-defined literals 
! for <tt>string</tt>, <tt>complex</tt> and <tt>chrono</tt> types. It puts each new literal signature in an inline namespace 
! inside of std. Section 3.1 of the paper gives the rationale for doing this:
! </p>
! 
! <blockquote><p>
! As a common schema this paper proposes to put all suffixes for user defined literals in separate inline namespaces 
! that are below the inline namespace <tt>std::literals</tt>. [<i>Note:</i> This allows a user either to do a 
! <tt>using namespace std::literals;</tt> to import all literal operators from the standard available through header 
! file inclusion, or to use <tt>using namespace std::string_literals;</tt> to just obtain the literals operators 
! for a specific type. &mdash; <i>end note</i>]
! </p></blockquote>
! 
! <p>This isn't how inline namespaces work.</p>
! 
! <p>
! 7.3.1 [namespace.def]/p8 says in part:
! </p>
! 
! <blockquote><p>
! Members of an inline namespace can be used in most respects as though they were members of the enclosing namespace. 
! Specifically, the inline namespace and its enclosing namespace are both added to the set of associated namespaces 
! used in argument-dependent lookup (3.4.2) whenever one of them is, and a using- directive (7.3.4) that names the 
! inline namespace is implicitly inserted into the enclosing namespace as for an unnamed namespace (7.3.1.1). [&hellip;]
! </p></blockquote>
! 
! <p>
! I.e. these literals will appear to the client to already be imported into namespace <tt>std</tt>. The rationale in 
! the paper appears to indicate that this is not the intended behavior, and that instead the intended behavior is 
! to require the user to say:
! </p>
! <blockquote><pre>
! using namespace std::literals;
! </pre></blockquote>
! <p>
! or:
! </p>
! <blockquote><pre>
! using namespace std::literals::string_literals;
! </pre></blockquote>
! <p>
! prior to use. To get this behavior non-inlined (normal) namespaces must be used.
! </p>
! 
! <p>
! Originally proposed resolution:
! <p/>
! Strike the use of "inline" from each use associated with <tt>literals</tt>,  <tt>string_literals</tt>, 
! <tt>chrono_literals</tt>.
! <p/>
! My opinion is that this must be done prior to publishing C++14, otherwise we are stuck with this 
! (apparently unwanted) decision forever.
! <p/>
! Marshall Clow:
! </p>
! <blockquote class="note">
! <p>
! The rationale that I recall was that:
! </p>
! <ol>
! <li><p>Users could write "<tt>using namespace std::literals;</tt>" to get all the literal suffixes, or</p></li>
! <li><p>Users could write "<tt>using namespace std::literals::string_literals;</tt>" or 
! "<tt>using namespace std::literals::chrono_literals;</tt>" to get a subset of the suffixes.</p></li>
! </ol>
! <p>
! To accomplish that, I believe that:
! </p>
! <ol style="list-style-type:lower-alpha">
! <li><p>Namespace "<tt>std::literals</tt>" <em>should not</em> be <tt>inline</tt></p></li>
! <li><p>Namespaces "<tt>std::literals::string_literals</tt>" and "<tt>std::literals::chrono_literals</tt>" <em>should</em> 
! be <tt>inline</tt></p></li>
! </ol>
! </blockquote>
! <p>
! Further details see also reflector message <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=34256">c++std-lib-34256</a>.
! </p>
! 
! <p>
! Previous resolution from Marshall Clow:
! </p>
! <blockquote class="note">
! <ol>
! <li><p>Modify header <tt>&lt;chrono&gt;</tt> synopsis, 20.12.2 [time.syn], as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
! namespace chrono {
! [&hellip;]
! } // namespace chrono
! <del>inline</del> namespace literals {
! inline namespace chrono_literals {
! [&hellip;]
! } // namespace chrono_literals
! } // namespace literals
! } // namespace std
! </pre></blockquote>
! </li>
! 
! <li><p>Modify header <tt>&lt;string&gt;</tt> synopsis, 21.3 [string.classes] p1, as indicated:</p>
! 
! <blockquote><pre>
! #include &lt;initializer_list&gt;
! 
! namespace std {
! [&hellip;]
! <del>inline</del> namespace literals {
! inline namespace string_literals {
! [&hellip;]
! }
! }
! }
! </pre></blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! 
! <p>
! After a discussion about intent, the conclusion was that if you hoist a type with a "using" directive, then you should also 
! get the associated literal suffixes with the type.
! <p/>
! This is accomplished by marking namespace <tt>std::literals</tt> as <tt>inline</tt>, but for types in their own namespace inside 
! <tt>std</tt>, then they will need to do this as well. The only case in the current library is <tt>chrono</tt>.
! </p>
! 
! <p>Marshall Clow provides alternative wording.</p>
! 
! <p><i>[2013-09 Chicago (late night issues)]</i></p>
! 
! <p>
! Moved to Ready, after confirming wording reflects the intent of the earlier discussion.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Modify header <tt>&lt;chrono&gt;</tt> synopsis, 20.12.2 [time.syn], as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
! [&hellip;]
! inline namespace literals {
! inline namespace chrono_literals {
! [&hellip;]
! constexpr chrono::duration&lt;<i>unspecified</i> , nano&gt; operator "" ns(long double);
! 
! } // namespace chrono_literals
! } // namespace literals
! 
! <ins>
! namespace chrono {
!     using namespace literals::chrono_literals;
! } // namespace chrono
! </ins>
! } // namespace std
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2280"></a>2280. <tt>begin/end</tt> for arrays should be <tt>constexpr</tt> and <tt>noexcept</tt></h3>
! <p><b>Section:</b> 24.7 [iterator.range] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2013-08-22 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#iterator.range">active issues</a> in [iterator.range].</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.range">issues</a> in [iterator.range].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The array forms of <tt>std::begin</tt> and <tt>std::end</tt> should be <tt>constexpr</tt> and <tt>noexcept</tt>.
! </p>
! 
! <p>
! <strong>Previous resolution from Andy Sawyer:</strong>
! </p>
! <blockquote class="note">
! <ol>
! <li><p>Edit header <tt>&lt;iterator&gt;</tt> synopsis, 24.3 [iterator.synopsis] as indicated:</p>
! 
! <blockquote>
! <pre>
! [&hellip;]
! template &lt;class T, size_t N&gt; <ins>constexpr</ins> T* begin(T (&amp;array)[N]) <ins>noexcept</ins>;
! template &lt;class T, size_t N&gt; <ins>constexpr</ins> T* end(T (&amp;array)[N]) <ins>noexcept</ins>;
! template &lt;class C&gt; <ins>constexpr</ins> auto cbegin(const C&amp; c) -&gt; decltype(std::begin(c));
! template &lt;class C&gt; <ins>constexpr</ins> auto cend(const C&amp; c) -&gt; decltype(std::end(c));
! [&hellip;]
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Edit 24.7 [iterator.range] before p4+5 as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class T, size_t N&gt; <ins>constexpr</ins> T* begin(T (&amp;array)[N]) <ins>noexcept</ins>;
! </pre>
! <blockquote>
! <p>
! -4- <i>Returns</i>: <tt>array</tt>.
! </p>
! </blockquote>
! <pre>
! template &lt;class T, size_t N&gt; <ins>constexpr</ins> T* end(T (&amp;array)[N]) <ins>noexcept</ins>;
! </pre>
! <blockquote>
! <p>
! -5- <i>Returns</i>: <tt>array + N</tt>.
! </p>
! </blockquote>
! <pre>
! template &lt;class C&gt; <ins>constexpr</ins> auto cbegin(const C&amp; c) -&gt; decltype(std::begin(c));
! </pre>
! <blockquote>
! <p>
! -6- <i>Returns</i>: <tt>std::begin(c)</tt>.
! </p>
! </blockquote>
! <pre>
! template &lt;class C&gt; <ins>constexpr</ins> auto cend(const C&amp; c) -&gt; decltype(std::end(c));
! </pre>
! <blockquote>
! <p>
! -7- <i>Returns</i>: <tt>std::end(c)</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! </blockquote>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Add <tt>noexcept(noexcept(std::begin/end(c)))</tt> to <tt>cbegin</tt> and <tt>cend</tt>, move to ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Edit header <tt>&lt;iterator&gt;</tt> synopsis, 24.3 [iterator.synopsis] as indicated:</p>
! 
! <blockquote>
! <pre>
! [&hellip;]
! template &lt;class T, size_t N&gt; <ins>constexpr</ins> T* begin(T (&amp;array)[N]) <ins>noexcept</ins>;
! template &lt;class T, size_t N&gt; <ins>constexpr</ins> T* end(T (&amp;array)[N]) <ins>noexcept</ins>;
! template &lt;class C&gt; <ins>constexpr</ins> auto cbegin(const C&amp; c) <ins>noexcept(noexcept(std::begin(c)))</ins> -&gt; decltype(std::begin(c));
! template &lt;class C&gt; <ins>constexpr</ins> auto cend(const C&amp; c) <ins>noexcept(noexcept(std::end(c)))</ins> -&gt; decltype(std::end(c));
! [&hellip;]
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Edit 24.7 [iterator.range] before p4+5 as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class T, size_t N&gt; <ins>constexpr</ins> T* begin(T (&amp;array)[N]) <ins>noexcept</ins>;
! </pre>
! <blockquote>
! <p>
! -4- <i>Returns</i>: <tt>array</tt>.
! </p>
! </blockquote>
! <pre>
! template &lt;class T, size_t N&gt; <ins>constexpr</ins> T* end(T (&amp;array)[N]) <ins>noexcept</ins>;
! </pre>
! <blockquote>
! <p>
! -5- <i>Returns</i>: <tt>array + N</tt>.
! </p>
! </blockquote>
! <pre>
! template &lt;class C&gt; <ins>constexpr</ins> auto cbegin(const C&amp; c) <ins>noexcept(noexcept(std::begin(c)))</ins> -&gt; decltype(std::begin(c));
! </pre>
! <blockquote>
! <p>
! -6- <i>Returns</i>: <tt>std::begin(c)</tt>.
! </p>
! </blockquote>
! <pre>
! template &lt;class C&gt; <ins>constexpr</ins> auto cend(const C&amp; c) <ins>noexcept(noexcept(std::end(c)))</ins> -&gt; decltype(std::end(c));
! </pre>
! <blockquote>
! <p>
! -7- <i>Returns</i>: <tt>std::end(c)</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2282"></a>2282. [fund.ts] Incorrect <tt>is_assignable</tt> constraint in <tt>optional::op=(U&amp;&amp;)</tt></h3>
! <p><b>Section:</b> X [optional.object.assign] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2013-08-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#optional.object.assign">issues</a> in [optional.object.assign].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! Minor wording nit in X [optional.object.assign]/p15:
! </p>
! <blockquote><pre>
! template &lt;class U&gt; optional&lt;T&gt;&amp; operator=(U&amp;&amp; v);
! </pre>
! <blockquote>
! <p>
! -15- <i>Requires:</i> <tt>is_constructible&lt;T, U&gt;::value</tt> is true and <tt>is_assignable&lt;<span  style="color:#C80000;font-weight:bold">U, T</span>&gt;::value</tt> is true.
! </p>
! </blockquote></blockquote>
! <p>
! Should be:
! </p>
! <blockquote><pre>
! template &lt;class U&gt; optional&lt;T&gt;&amp; operator=(U&amp;&amp; v);
! </pre>
! <blockquote>
! <p>
! -15- <i>Requires:</i> <tt>is_constructible&lt;T, U&gt;::value</tt> is true and <tt>is_assignable&lt;<span  style="color:#C80000;font-weight:bold">T&amp;, U</span>&gt;::value</tt> is true.
! </p>
! </blockquote></blockquote>
! 
! <p><i>[2013-09 Chicago:]</i></p>
! 
! <p>
! Move to Deferred.  This feature will ship after C++14 and should be revisited then.
! </p>
! 
! <p><i>[2014-06-06 pre-Rapperswill]</i></p>
! 
! <p>
! This issue has been reopened as fundamentals-ts.
! </p>
! 
! <p><i>[2014-06-07 Daniel comments]</i></p>
! 
! <p>
! This issue should be set to <b>Resolved</b>, because the wording fix is already applied in the 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4023.html#optional.object.assign">last fundamentals working draft</a>.
! </p>
! 
! <p><i>[2014-06-16 Rapperswill]</i></p>
! 
! <p>
! Confirmed that this issue is resolved in the current Library Fundamentals working paper.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit X [optional.object.assign] p15 as indicated:</p>
! 
! <blockquote><pre>
! template &lt;class U&gt; optional&lt;T&gt;&amp; operator=(U&amp;&amp; v);
! </pre>
! <blockquote>
! <p>
! -15- <i>Requires:</i> <tt>is_constructible&lt;T, U&gt;::value</tt> is true and 
! <tt>is_assignable&lt;<del>U, T</del><ins>T&amp;, U</ins>&gt;::value</tt> is true.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2283"></a>2283. [fund.ts] <tt>optional</tt> declares and then does not define an <tt>operator&lt;()</tt></h3>
! <p><b>Section:</b> X [optional.comp_with_t] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2013-08-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! In  [optional.syn] there is:
! </p>
! <blockquote><pre>
! template &lt;class T&gt; constexpr bool operator&lt;(const T&amp;, const optional&lt;T&gt;&amp;);
! </pre></blockquote>
! <p>
! But I can find no definition for this signature.
! </p>
! 
! <p><i>[2013-09 Chicago:]</i></p>
! 
! <p>
! Move to Deferred.  This feature will ship after C++14 and should be revisited then.
! </p>
! 
! <p><i>[2014-06-06 pre-Rapperswill]</i></p>
! 
! <p>
! This issue has been reopened as fundamentals-ts.
! </p>
! 
! <p><i>[2014-06-07 Daniel comments]</i></p>
! 
! <p>
! This issue should be set to <b>Resolved</b>, because the wording fix is already applied in the 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4023.html#optional.comp_with_t">last fundamentals working draft</a>.
! </p>
! 
! <p><i>[2014-06-16 Rapperswill]</i></p>
! 
! <p>
! Confirmed that this issue is resolved in the current Library Fundamentals working paper.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Add to X [optional.comp_with_t]:</p>
! 
! <blockquote><pre>
! <ins>template &lt;class T&gt; constexpr bool operator&lt;(const T&amp; v, const optional&lt;T&gt;&amp; x);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns:</i> <tt>bool(x) ? less&lt;T&gt;{}(v, *x) : false</tt>.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2284"></a>2284. Inconsistency in <tt>allocator_traits::max_size</tt></h3>
! <p><b>Section:</b> 20.7.8 [allocator.traits] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Marshall Clow <b>Opened:</b> 2013-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Section 20.7.8 [allocator.traits] says:
! </p>
! <blockquote><pre>
! static size_type max_size(const Alloc&amp; a) noexcept;
! </pre></blockquote>
! <p>
! Section 20.7.8.2 [allocator.traits.members] says:
! </p>
! <blockquote><pre>
! static size_type max_size(Alloc&amp; a) noexcept;
! </pre></blockquote>
! 
! <p>
! These should be the same.
! </p>
! 
! <p>
! Discussion:
! </p>
! 
! <p>
! Pablo (who I believe wrote the <tt>allocator_traits</tt> proposal) says "The function should take a <tt>const</tt> reference."
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! No objections, so moved to Immediate.
! </p>
! <p>
! Accept for Working Paper
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 20.7.8.2 [allocator.traits.members] as follows:</p>
! 
! <blockquote><pre>
! static size_type max_size(<ins>const</ins> Alloc&amp; a) noexcept;
! </pre>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2285"></a>2285. <tt>make_reverse_iterator</tt></h3>
! <p><b>Section:</b> 24.5.1 [reverse.iterators] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Zhihao Yuan <b>Opened:</b> 2013-08-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reverse.iterators">issues</a> in [reverse.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! We have <tt>make_move_iterator</tt>, but not <tt>make_reverse_iterator</tt>, which
! is also useful when dealing with some types without an <tt>rbegin</tt>/<tt>rend</tt> support (like, C strings).
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Billy: reviewed it last night STL: has suggested prior, but denied for complexity 
! <p/>
! Billy: Alisdair wanted to review for <tt>reverse(reverse())</tt>; 
! <p/>
! STL: likes the issue, was like him 
! <p/>
! Stefanus: likes definitions, places where things should be 
! <p/>
! STL: for consistency with <tt>make_move_iterator</tt> 
! <p/>
! Stefanus: minor editorial issue - subdivision in these 2 sections is different from  [move.iter]. 
! See 24.5.3.3.14 [move.iter.nonmember]
! <p/>
! STL: motion to move to Ready
! <p/>
! Move to Ready 
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change header <tt>&lt;iterator&gt;</tt> synopsis, 24.3 [iterator.synopsis] as indicated:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   [&hellip;]
!   template &lt;class Iterator&gt;
!     reverse_iterator&lt;Iterator&gt; operator+(
!       typename reverse_iterator&lt;Iterator&gt;::difference_type n,
!       const reverse_iterator&lt;Iterator>&amp; x);
! <ins>
!   template &lt;class Iterator&gt;
!     reverse_iterator&lt;Iterator&gt; make_reverse_iterator(Iterator i);
! </ins>
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Change class template <tt>reverse_iterator</tt> synopsis, 24.5.1.1 [reverse.iterator] as indicated:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   [&hellip;]
!   template &lt;class Iterator&gt;
!     reverse_iterator&lt;Iterator&gt; operator+(
!       typename reverse_iterator&lt;Iterator&gt;::difference_type n,
!       const reverse_iterator&lt;Iterator>&amp; x);
! <ins>
!   template &lt;class Iterator&gt;
!     reverse_iterator&lt;Iterator&gt; make_reverse_iterator(Iterator i);
! </ins>
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>After 24.5.1.3.20 [reverse.iter.opsum] add the following new sub-clause to 24.5.1.3 [reverse.iter.ops]:</p>
! 
! <blockquote>
! <pre>
! <ins>
! template &lt;class Iterator&gt;
!   reverse_iterator&lt;Iterator&gt; make_reverse_iterator(Iterator i);
! </ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Returns:</i> <tt>reverse_iterator&lt;Iterator&gt;(i)</tt>.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2287"></a>2287. [fund.ts] Incorrect exception safety for <tt>optional</tt> copy assignment operator</h3>
! <p><b>Section:</b> X [optional.object.assign] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2013-08-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#optional.object.assign">issues</a> in [optional.object.assign].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! The <i>Exception safety</i> paragraph of X [optional.object.assign] calls out <tt>T</tt>'s copy constructor when 
! it should refer to <tt>T</tt>'s copy assignment operator.
! </p>
! 
! <p><i>[2013-09 Chicago:]</i></p>
! 
! <p>
! Move to Deferred.  This feature will ship after C++14 and should be revisited then.
! </p>
! 
! <p><i>[2014-06-06 pre-Rapperswill]</i></p>
! 
! <p>
! This issue has been reopened as fundamentals-ts.
! </p>
! 
! <p><i>[2014-06-07 Daniel comments]</i></p>
! 
! <p>
! This issue should be set to <b>Resolved</b>, because the wording fix is already applied in the 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4023.html#optional.object.assign">last fundamentals working draft</a>.
! </p>
! 
! <p><i>[2014-06-16 Rapperswill]</i></p>
! 
! <p>
! Confirmed that this issue is resolved in the current Library Fundamentals working paper.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change X [optional.object.assign] as indicated:</p>
! 
! <blockquote><pre>
! optional&lt;T&gt;&amp; operator=(const optional&lt;T&gt;&amp; rhs);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -8- <i>Exception safety:</i> If any exception is thrown, the values of <tt>init</tt> and <tt>rhs.init</tt> remain unchanged. If
! an exception is thrown during the call to <tt>T</tt>'s copy constructor, no effect. If an exception is thrown
! during the call to <tt>T</tt>'s copy assignment, the state of its contained value is as defined by the exception
! safety guarantee of <tt>T</tt>'s copy <del>constructor</del><ins>assignment</ins>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2288"></a>2288. Inconsistent requirements for shared mutexes</h3>
! <p><b>Section:</b> 30.4.1.4 [thread.sharedmutex.requirements] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-08-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Albeit shared mutex types refine timed mutex types, the requirements imposed on the corresponding required member function
! expressions are inconsistent in several aspects, most probably because failing synchronisation with wording changes for
! timed mutexes applied by some issues:
! </p>
! 
! <ol>
! <li>
! <p>
! Due to acceptance of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3568.html">N3568</a> a wording phrase
! came in 30.4.1.4 [thread.sharedmutex.requirements] p26,
! </p>
! <blockquote><p>
! <i>Effects:</i> If the tick period of <tt>rel_time</tt> is not exactly convertible to the native tick period, the
! duration shall be rounded up to the nearest native tick period. [&hellip;]
! </p></blockquote>
! <p> 
! while a very similar one had been removed for 30.4.1.3 [thread.timedmutex.requirements] by LWG <a href="lwg-defects.html#2091">2091</a>. 
! <p/>
! Having this guaranteed effect for <tt>try_lock_shared_for</tt> but not for <tt>try_lock_for</tt> seems inconsistent
! and astonishing.
! <p/>
! If the actual intended restriction imposed onto the implementation is to forbid early wakeups here, we should ensure that
! to hold for timed mutex's <tt>try_lock_for</tt> as well. Note that the rationale provided for LWG <a href="lwg-defects.html#2091">2091</a> was
! a potential late wakeup situation, but it seems that there is no implementation restriction that prevents early wakeups.
! </p>
! </li>
! 
! <li>
! <p>
! The shared-lock requirements for any <tt>*lock*()</tt> functions don't provide the guarantee that "If an exception is thrown then 
! a lock shall not have been acquired for the current execution agent.". For other mutex types this guarantee can be derived from
! the corresponding <tt>TimedLockable</tt> requirements, but there are no <tt>SharedLockable</tt> requirements.
! </p>
! </li>
! 
! <li>
! <p>
! The shared-lock requirements for <tt>*lock_for/_until()</tt> functions require "<i>Throws:</i> Nothing."
! instead of "<i>Throws:</i> Timeout-related exceptions (30.2.4)." which had been added by LWG <a href="lwg-defects.html#2093">2093</a>, because user-provided
! clocks, durations, or time points may throw exceptions. 
! </p>
! </li>
! 
! <li>
! <p>
! With the addition of <tt>std::shared_mutex</tt>, the explicit lists of 30.4.1.2 [thread.mutex.requirements.mutex] p7+15,
! </p>
! <blockquote><p>
! <i>Requires:</i> If <tt>m</tt> is of type <tt>std::mutex</tt> or <tt>std::timed_mutex</tt>, the calling thread does not own the mutex.
! </p></blockquote>
! <p>
! and of 30.4.1.3 [thread.timedmutex.requirements] p4+11,
! </p>
! <blockquote><p>
! <i>Requires:</i> If <tt>m</tt> is of type <tt>std::timed_mutex</tt>, the calling thread does not own the mutex.
! </p></blockquote>
! <p>
! are incomplete and should add the non-recursive <tt>std::shared_mutex</tt> as well.
! </p>
! </li>
! </ol>
! 
! <p><i>[2014-02-16: Moved as Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 30.4.1.2 [thread.mutex.requirements.mutex] p7+15 as indicated:</p>
! 
! <blockquote>
! <p>
! -6- The expression <tt>m.lock()</tt> shall be well-formed and have the following semantics:
! </p>
! <blockquote>
! <p>
! -7- <i>Requires:</i> If <tt>m</tt> is of type <tt>std::mutex</tt><del> or</del><ins>,</ins> <tt>std::timed_mutex</tt><ins>, or 
! <tt>std::shared_mutex</tt></ins>, the calling thread does not own the mutex.
! </p>
! </blockquote>
! <p>
! [&hellip;]
! </p>
! <p>
! -14- The expression <tt>m.try_lock()</tt> shall be well-formed and have the following semantics:
! </p>
! <blockquote>
! <p>
! -15- <i>Requires:</i> If <tt>m</tt> is of type <tt>std::mutex</tt><del> or</del><ins>,</ins> <tt>std::timed_mutex</tt><ins>, or 
! <tt>std::shared_mutex</tt></ins>, the calling thread does not own the mutex.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 30.4.1.3 [thread.timedmutex.requirements] p4+11 as indicated:</p>
! 
! <blockquote>
! <p>
! -3- The expression <tt>m.try_lock_for(rel_time)</tt> shall be well-formed and have the following semantics:
! </p>
! <blockquote>
! <p>
! -4- <i>Requires:</i> If <tt>m</tt> is of type <tt>std::timed_mutex</tt><ins> or <tt>std::shared_mutex</tt></ins>, 
! the calling thread does not own the mutex.
! </p>
! </blockquote>
! <p>
! [&hellip;]
! </p>
! <p>
! -10- The expression <tt>m.try_lock_until(abs_time)</tt> shall be well-formed and have the following semantics:
! </p>
! <blockquote>
! <p>
! -11- <i>Requires:</i> If <tt>m</tt> is of type <tt>std::timed_mutex</tt><ins> or <tt>std::shared_mutex</tt></ins>, 
! the calling thread does not own the mutex.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 30.4.1.4 [thread.sharedmutex.requirements] as indicated:</p>
! 
! <blockquote>
! <p>
! -3- The expression <tt>m.lock_shared()</tt> shall be well-formed and have the following semantics:
! </p>
! <blockquote>
! <p>
! -4- <i>Requires:</i> The calling thread has no ownership of the mutex.
! <p/>
! -5- <i>Effects:</i> Blocks the calling thread until shared ownership of the mutex can be obtained for the calling
! thread. <ins>If an exception is thrown then a shared lock shall not have been acquired for the current thread.</ins>
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <p>
! -24- The expression <tt>m.try_lock_shared_for(rel_time)</tt> shall be well-formed and have the following semantics:
! </p>
! <blockquote>
! <p>
! -25- <i>Requires:</i> The calling thread has no ownership of the mutex.
! <p/>
! -26- <i>Effects:</i> <del>If the tick period of <tt>rel_time</tt> is not exactly convertible to the native tick period, the
! duration shall be rounded up to the nearest native tick period.</del> Attempts to obtain shared lock
! ownership for the calling thread within the relative timeout (30.2.4) specified by <tt>rel_time</tt>. If the
! time specified by <tt>rel_time</tt> is less than or equal to <tt>rel_time.zero()</tt>, the function attempts to obtain
! ownership without blocking (as if by calling <tt>try_lock_shared()</tt>). The function shall return within
! the timeout specified by <tt>rel_time</tt> only if it has obtained shared ownership of the mutex object. [<i>Note:</i>
! As with <tt>try_lock()</tt>, there is no guarantee that ownership will be obtained if the lock is available, but
! implementations are expected to make a strong effort to do so. &mdash; <i>end note</i>] <ins>If an exception is thrown then 
! a shared lock shall not have been acquired for the current thread.</ins>
! <p/>
! [&hellip;]
! <p/>
! -30- <i>Throws:</i> <del>Nothing</del><ins>Timeout-related exceptions (30.2.4 [thread.req.timing])</ins>.
! </p>
! </blockquote>
! <p>
! -31- The expression <tt>m.try_lock_shared_until(abs_time)</tt> shall be well-formed and have the following semantics:
! </p>
! <blockquote>
! <p>
! -32- <i>Requires:</i> The calling thread has no ownership of the mutex.
! <p/>
! -33- <i>Effects:</i> The function attempts to obtain shared ownership of the mutex. If <tt>abs_time</tt> has already
! passed, the function attempts to obtain shared ownership without blocking (as if by calling <tt>try_lock_shared()</tt>). 
! The function shall return before the absolute timeout (30.2.4) specified by <tt>abs_time</tt>
! only if it has obtained shared ownership of the mutex object. [<i>Note:</i> As with <tt>try_lock()</tt>, there is no
! guarantee that ownership will be obtained if the lock is available, but implementations are expected
! to make a strong effort to do so. &mdash; <i>end note</i>] <ins>If an exception is thrown then 
! a shared lock shall not have been acquired for the current thread.</ins>
! <p/>
! [&hellip;]
! <p/>
! -37- <i>Throws:</i> <del>Nothing</del><ins>Timeout-related exceptions (30.2.4 [thread.req.timing])</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2291"></a>2291. <tt>std::hash</tt> is vulnerable to collision DoS attack</h3>
! <p><b>Section:</b> 17.6.3.4 [hash.requirements] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Zhihao Yuan <b>Opened:</b> 2013-09-02 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#hash.requirements">issues</a> in [hash.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! For a non-cryptographic hash function, it's possible to pre-calculate massive inputs with 
! the same hashed value to algorithmically slow down the unordered containers, and results 
! in a denial-of-service attack. Many languages with built-in hash table support have fixed
! this issue. For example, Perl has universal hashing, Python 3 uses salted hashes.
! <p/>
! However, for C++, in 17.6.3.4 [hash.requirements] p2, Table 26:
! </p>
! 
! <blockquote><p>
! The value returned shall depend only on the argument <tt>k</tt>.
! [<i>Note:</i> Thus all evaluations of the expression <tt>h(k)</tt> with the
! same value for <tt>k</tt> yield the same result. &mdash; <i>end note</i>]
! </p></blockquote>
! 
! <p>
! The wording is not clear here: does that mean all the standard
! library implementations must use the same hash function for a same
! type?  Or it is not allowed for an implementation to change its hash
! function?
! <p/>
! I suggest to explicitly allow the salted hash functions.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! Moved to Ready.
! </p>
! 
! <p>
! There is some concern that the issue of better hashing, especially standardizing any kind of
! secure hashing, is a feature that deserves attention in LEWG
! </p>
! 
! <p>
! The proposed resolution is much simpler than the larger issue though, merely clarifying a
! permission that many implementers believe they already have, without mandating a change to
! more straight forward implementations.
! </p>
! 
! <p>
! Move to Ready, rather than Immediate, as even the permission has been contentious in reflector
! discussion, although the consensus in Chicago is to accept as written unless we hear a further
! strong objection.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 17.6.3.4 [hash.requirements] p2, Table 26, as indicated: <em>[Editorial note:
! We can consider adding some additional guideline here. Unlike 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3333.html">N3333</a>, this 
! proposed change makes the hashing per-execution instead of per-process. The standard does not 
! discuss OS processes. And, practically, a per-process hashing makes a program unable to
! share an unordered container to a child process. &mdash; end note ]</em></p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 26 &mdash; Hash requirements [hash]</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Requirement</th>
! </tr>
! 
! <tr>
! <td>
! <tt>h(k)</tt>
! </td>
! <td>
! <tt>size_t</tt>
! </td>
! <td>
! The value returned shall depend only on the argument <tt>k</tt><br/>
! <ins>for the duration of the program</ins>.<br/>
! [<i>Note:</i> Thus all evaluations of the expression <tt>h(k)</tt> with the<br/>
! same value for <tt>k</tt> yield the same result <ins>for a given<br/>
! execution of the program</ins>. &mdash; <i>end note</i>]<br/>
! </td>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2293"></a>2293. Wrong facet used by <tt>num_put::do_put</tt></h3>
! <p><b>Section:</b> 22.4.2.2.2 [facet.num.put.virtuals] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Juan Soulie <b>Opened:</b> 2013-09-04 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#facet.num.put.virtuals">issues</a> in [facet.num.put.virtuals].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! At the end of 22.4.2.2.2 [facet.num.put.virtuals] (in p6), the return value is said to be obtained by calling 
! <tt>truename</tt> or <tt>falsename</tt> on the wrong facet: <tt>ctype</tt> should be replaced by <tt>numpunct</tt>.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 22.4.2.2.2 [facet.num.put.virtuals] p6 as indicated:</p>
! 
! <blockquote><p>
! -6- <i>Returns:</i> If <tt>(str.flags() &amp; ios_base::boolalpha) == 0</tt> returns <tt>do_put(out, str, fill, (int)val)</tt>, 
! otherwise obtains a string <tt>s</tt> as if by
! </p>
! <blockquote><pre>
! string_type s =
!   val ? use_facet&lt;<del>ctype</del><ins>numpunct</ins>&lt;charT&gt; &gt;(loc).truename()
!       : use_facet&lt;<del>ctype</del><ins>numpunct</ins>&lt;charT&gt; &gt;(loc).falsename();
! </pre></blockquote>
! <p>
! and then inserts each character c of s into out via *out++ = c and returns out.
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2298"></a>2298. [CD] <tt>is_nothrow_constructible</tt> is always false because of <tt>create&lt;&gt;</tt></h3>
! <p><b>Section:</b> 20.10.4.3 [meta.unary.prop] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-09-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.unary.prop">active issues</a> in [meta.unary.prop].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.unary.prop">issues</a> in [meta.unary.prop].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses US 18</b></p>
! 
! <p>
! The trait <tt>is_constructible&lt;T, Args...&gt;</tt> is defined in terms of a helper template, <tt>create&lt;&gt;</tt>, 
! that is identical to <tt>std::declval&lt;&gt;</tt> except for the latter's <tt>noexcept</tt> clause.   
! <p/>
! If the absence of <tt>noexcept</tt> is critical to this definition, insert a Note of explanation; otherwise, excise 
! <tt>create&lt;&gt;</tt> and reformulate in terms of <tt>declval&lt;&gt;</tt> the definition of <tt>is_constructible</tt>. 
! </p>
! 
! <p><i>[2013-09-24 Daniel comments and provides resolution suggestion]</i></p>
! 
! 
! <p>
! Replacing <tt>create&lt;&gt;</tt> by <tt>std::declval&lt;&gt;</tt> would make the situation worse, because the definition of
! <tt>is_constructible</tt> is based on a well-formed variable definition and there is no way to specify a variable definition
! without odr-using its initializer arguments. It should also be added, that there is another problem with the specification of
! all existing <tt>is_trivially_*</tt> traits, because neither <tt>create&lt;&gt;</tt> nor <tt>std::declval&lt;&gt;</tt>
! are considered as trivial functions, but this should be solved by a different issue.
! </p>
! 
! <p><i>[2013-09-26 Nico improves wording]</i></p>
! 
! 
! <p>
! The additional change is just to keep both places were <tt>create()</tt> is defined consistent.
! </p>
! 
! <p><i>[2013-09 Chicago]</i></p>
! 
! <p>
! No objections, so moved to Immediate.
! </p>
! <p>
! Accept for Working Paper
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 20.10.4.3 [meta.unary.prop] around p6 as indicated:</p>
! 
! <blockquote><p>
! -6- Given the following function prototype:
! </p>
! <blockquote><pre>
! template &lt;class T&gt;
!   typename add_rvalue_reference&lt;T&gt;::type create() <ins>noexcept</ins>;
! </pre></blockquote>
! <p>
! the predicate condition for a template specialization <tt>is_constructible&lt;T, Args...&gt;</tt> shall be satisfied
! if and only if the following variable definition would be well-formed for some invented variable <tt>t</tt>:
! </p>
! <blockquote><pre>
! T t(create&lt;Args&gt;()...);
! </pre></blockquote>
! <p>
! [&hellip;]
! </p>
! </blockquote>
! </li>
! 
! <li><p>Change 20.10.4.3 [meta.unary.prop] around p4 as indicated:</p>
! 
! <blockquote><p>
! -4- Given the following function prototype:
! </p>
! <blockquote><pre>template &lt;class T&gt;
!   typename add_rvalue_reference&lt;T&gt;::type create() <ins>noexcept</ins>;
! </pre></blockquote>
! <p>
! the predicate condition for a template specialization <tt>is_convertible&lt;From, To&gt;</tt> shall be satisfied if and
! only if the return expression in the following code would be well-formed, including any implicit conversions
! to the return type of the function:
! </p>
! <blockquote><pre>
! To test() {
!   return create&lt;From&gt;();
! }
! </pre></blockquote>
! <p>
! [&hellip;]
! </p>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2299"></a>2299. [CD] Effects of inaccessible <tt>key_compare::is_transparent</tt> type are not clear</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-09-24 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses ES 16</b></p>
! 
! <p>
! The condition "<tt>X::key_compare::is_transparent</tt> exists" does not specify that the type be publicly accessible.     
! <p/>
! Consider the public accessibility of <tt>X::key_compare::is_transparent</tt> and whether its potential inaccessibility 
! should be banned for a compliant <tt>key_compare</tt> type. 
! </p>
! 
! <p><i>[2013-09-24 Daniel provides resolution suggestion]</i></p>
! 
! 
! <p><i>[2013-09-25 Chicago]</i></p>
! 
! <p>
! Daniel's wording is good, advance to Immediate to respond to NB comment.
! </p>
! 
! <p><i>[2013-09-26 Chicago]</i></p>
! 
! <p>
! Moved back to Review as Daniel would like another look at the words, and to confirm implementability.
! </p>
! 
! <p>
! <strong>Previous resolution from Daniel [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <ol>
! 
! <li><p>Change 23.2.4 [associative.reqmts] p8 as indicated:</p>
! 
! <blockquote><p>
! -8- In Table 102, <tt>X</tt> denotes an associative container class, <tt>a</tt> denotes a value of <tt>X</tt>, <tt>a_uniq</tt> 
! denotes a value of <tt>X</tt> when <tt>X</tt> supports unique keys, <tt>a_eq</tt> denotes a value of <tt>X</tt> when <tt>X</tt> 
! supports multiple keys, <tt>a_tran</tt> denotes a value of <tt>X</tt> when <del>the</del><ins>a publicly accessible</ins> type 
! <tt>X::key_compare::is_transparent</tt> exists <ins>whose name is unambiguous and not hidden</ins>, 
! [&hellip;]
! </p>
! </blockquote>
! </li>
! 
! <li><p>Change 23.2.4 [associative.reqmts] p13 as indicated:</p>
! 
! <blockquote><p>
! The member function templates <tt>find</tt>, <tt>count</tt>, <tt>lower_bound</tt>, <tt>upper_bound</tt>, and <tt>equal_range</tt> shall not
! participate in overload resolution unless <del>the</del><ins>a publicly accessible</ins> type 
! <tt>Compare::is_transparent</tt> exists <ins>whose name is unambiguous and not hidden</ins>.
! </p></blockquote>
! </li>
! </ol>
! 
! </blockquote>
! 
! <p><i>[2014-02-10 Daniel comments provides alternative wording]</i></p>
! 
! 
! <p>
! I could confirm that my previous concerns were unwarranted, because they turned out to be due to a compiler-bug.
! Nonetheless I would suggest to replace the previously suggested replication of core-wording situations (access, ambiguity, hidden) 
! by a single more robust phrase based on "valid type".
! </p>
! 
! 
! <p><i>[2014-02-12 Issaquah: Move to Immediate]</i></p>
! 
! <p>
! STL: This uses &quot;valid type&quot;, which is a Phrase Of Power in Core, and Daniel has a citation for the term.
! </p>
! <p>
! Jonathan: It's nice to rely on Core.
! </p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! 
! <li><p>Change 23.2.4 [associative.reqmts] p8 as indicated:</p>
! 
! <blockquote><p>
! -8- In Table 102, <tt>X</tt> denotes an associative container class, <tt>a</tt> denotes a value of <tt>X</tt>, <tt>a_uniq</tt> 
! denotes a value of <tt>X</tt> when <tt>X</tt> supports unique keys, <tt>a_eq</tt> denotes a value of <tt>X</tt> when <tt>X</tt> 
! supports multiple keys, <tt>a_tran</tt> denotes a value of <tt>X</tt> when the <del>type</del><ins>qualified-id</ins> 
! <tt>X::key_compare::is_transparent</tt> <del>exists</del><ins>is valid and denotes a type (14.8.2 [temp.deduct])</ins>, 
! [&hellip;]
! </p>
! </blockquote>
! </li>
! 
! <li><p>Change 23.2.4 [associative.reqmts] p13 as indicated:</p>
! 
! <blockquote><p>
! The member function templates <tt>find</tt>, <tt>count</tt>, <tt>lower_bound</tt>, <tt>upper_bound</tt>, and <tt>equal_range</tt> shall not
! participate in overload resolution unless the <del>type</del><ins>qualified-id</ins> 
! <tt>Compare::is_transparent</tt> <del>exists</del><ins>is valid and denotes a type (14.8.2 [temp.deduct])</ins>.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2300"></a>2300. [CD] Redundant sections for <tt>map</tt> and <tt>multimap</tt> members should be removed</h3>
! <p><b>Section:</b> X [map.ops], X [multimap.ops] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2013-09-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses ES 17</b></p>
! 
! <p>
! Sections are redundant with general associative container requirements at 23.2.4 [associative.reqmts], Table 102. 
! <p/>
! Suggested action:     
! <p/>
! Delete sections.
! </p>
! 
! <p><i>[2013-09-25 Daniel provides resolution suggestion]</i></p>
! 
! 
! <p><i>[2013-09-25 Chicago]</i></p>
! 
! <p>
! Daniel's wording is good, move to Immediate to resolve NB comment.
! </p>
! 
! <p><i>[2013-09-29 Chicago]</i></p>
! 
! <p>
! Accept for Working Paper
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change the header <tt>&lt;map&gt;</tt> synopsis, 23.4.4.1 [map.overview] p2 as indicated:</p>
! 
! <blockquote><pre>
! // <del>23.4.4.5,</del> map operations:
! iterator find(const key_type&amp; x);
! const_iterator find(const key_type&amp; x) const;
! template &lt;class K&gt; iterator find(const K&amp; x);
! template &lt;class K&gt; const_iterator find(const K&amp; x) const;
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Delete the complete sub-clause X [map.ops]:</p>
! 
! <p>
! <del>23.4.4.5 map operations [map.ops]</del>
! </p>
! <blockquote><pre>
! <del>iterator find(const key_type&amp; x);
! const_iterator find(const key_type&amp; x) const;
! iterator lower_bound(const key_type&amp; x);
! const_iterator lower_bound(const key_type&amp; x) const;
! iterator upper_bound(const key_type&amp; x);
! const_iterator upper_bound(const key_type &amp;x) const;
! pair&lt;iterator, iterator&gt;
!   equal_range(const key_type &amp;x);
! pair&lt;const_iterator, const_iterator&gt;
!   equal_range(const key_type&amp; x) const;</del>
! </pre><blockquote>
! <p>
! <del>-1- The <tt>find</tt>, <tt>lower_bound</tt>, <tt>upper_bound</tt> and <tt>equal_range</tt> member functions each have two versions,
! one const and the other non-const. In each case the behavior of the two functions is identical except
! that the const version returns a <tt>const_iterator</tt> and the non-const version an <tt>iterator</tt> (23.2.4).</del>
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Delete the complete sub-clause X [multimap.ops]:</p>
! 
! <p>
! <del>23.4.5.4 multimap operations [multimap.ops]</del>
! </p>
! <blockquote><pre>
! <del>iterator find(const key_type &amp;x);
! const_iterator find(const key_type&amp; x) const;
! 
! iterator lower_bound(const key_type&amp; x);
! const_iterator lower_bound(const key_type&amp; x) const;
! 
! pair&lt;iterator, iterator&gt;
!   equal_range(const key_type &amp;x);
! pair&lt;const_iterator, const_iterator&gt;
!   equal_range(const key_type&amp; x) const;</del>
! </pre><blockquote>
! <p>
! <del>-1- The <tt>find</tt>, <tt>lower_bound</tt>, <tt>upper_bound</tt> and <tt>equal_range</tt> member functions each have two versions,
! one const and one non-const. In each case the behavior of the two versions is identical except
! that the const version returns a <tt>const_iterator</tt> and the non-const version an <tt>iterator</tt> (23.2.4).</del>
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2301"></a>2301. Why is <tt>std::tie</tt> not <tt>constexpr</tt>?</h3>
! <p><b>Section:</b> 20.4.2.4 [tuple.creation] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Rein Halbersma <b>Opened:</b> 2013-09-11 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.creation">issues</a> in [tuple.creation].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3471.html">N3471</a>, a bunch of routines from header 
! <tt>&lt;tuple&gt;</tt> were made <tt>constexpr</tt>.
! <p/>
! <tt>make_tuple/tuple_cat/get&lt;&gt;(tuple)/</tt>relational operators &mdash; all these were "<tt>constexpr</tt>-ified".     
! <p/>
! But not <tt>tie</tt>. This is similar to Issue <a href="lwg-defects.html#2275">2275</a>, where the same observation was made about <tt>forward_as_tuple</tt>.
! </p>
! 
! <p><i>[2014-02-13 Issaquah: Move as Immediate]</i></p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change the header <tt>&lt;tuple&gt;</tt> synopsis, 20.4.1 [tuple.general] p2 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class... Types&gt;
!   <ins>constexpr</ins> tuple&lt;Types&amp;...&gt; tie(Types&amp;...) noexcept;
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Change 20.4.2.4 [tuple.creation] around p7 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class... Types&gt;
!   <ins>constexpr</ins> tuple&lt;Types&amp;...&gt; tie(Types&amp;... t) noexcept;
! </pre>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2304"></a>2304. Complexity of <tt>count</tt> in unordered associative containers</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz <b>Opened:</b> 2013-09-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Table 103 in 23.2.5 [unord.req] states that the complexity of <tt>b.count(k)</tt> is average case &#x1d4aa;(<tt>1</tt>) rather 
! than linear with the number of equivalent elements, which seems to be a typo as this requires holding an internal 
! count of elements in each group of equivalent keys, something which hardly looks the intent of the standard and no 
! (known by the submitter) stdlib implementation is currently doing.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change Table 103 as indicated:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 103 &mdash; Unordered associative container requirements (in addition to container)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Complexity</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>b.count(k)</tt>
! </td>
! <td>
! <tt>size_type</tt>
! </td>
! <td>
! Returns the number of elements with key equivalent to <tt>k</tt>.
! </td>
! <td>
! Average case &#x1d4aa;(<tt><del>1</del><ins>b.count(k)</ins></tt>), worst case &#x1d4aa;(<tt>b.size()</tt>).
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2306"></a>2306. <tt>match_results::reference</tt> should be <tt>value_type&amp;</tt>, not <tt>const value_type&amp;</tt></h3>
! <p><b>Section:</b> 28.10 [re.results] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Matt Austern <b>Opened:</b> 2013-09-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.results">issues</a> in [re.results].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The match_results class synopsis has
! </p>
! <blockquote><pre>
! typedef const value_type&amp; const_reference;
! typedef const_reference reference;
! </pre></blockquote>
! <p>
! We're getting too enthusiastic about types here by insisting that <tt>reference</tt> is a const reference, even 
! though <tt>match_results</tt> is a read-only container. In the container requirements table (Table 96, in section 
! 23.2.1 [container.requirements.general] we say that <tt>Container::reference</tt> is "lvalue of <tt>T</tt>" and 
! <tt>Container::const_reference</tt> is "const lvalue of <tt>T</tt>".
! </p>
! <p>
! That phrasing in the container requirements table is admittedly a little fuzzy and ought to be clarified (as discussed in 
! lwg issue <a href="lwg-defects.html#2182">2182</a>), but in context it's clear that <tt>Container::reference</tt> ought to be a <tt>T&amp;</tt> 
! even for constant containers. In the rest of Clause 23 we see that <tt>Container::reference</tt> is <tt>T&amp;</tt>, not 
! <tt>const T&amp;</tt>, even for const-qualified containers and that it's <tt>T&amp;</tt>, not <tt>const T&amp;</tt>, even 
! for containers like <tt>set</tt> and <tt>unordered_set</tt> that provide const iterators only.
! <p/>
! The way we handle const containers is just that in the case of a const-qualified container (including <tt>match_results</tt>) 
! there are no operations that return <tt>Container::reference</tt>. That's already the case, so this issue is complaining 
! about an unused typedef.
! </p>
! 
! <p><i>[2013-10-17: Daniel comments]</i></p>
! 
! <p>
! The <tt>std::initializer_list</tt> synopsis, 18.9 [support.initlist] shows a similar problem:
! </p>
! <blockquote><pre>
! template&lt;class E&gt; class initializer_list {
! public:
!   typedef E value_type;
!   typedef const E&amp; reference;
!   typedef const E&amp; const_reference;
!   [&hellip;]
! }
! </pre></blockquote>
! <p>
! Given the fact that <tt>std::initializer_list</tt> doesn't meet the container requirements anyway (and is such a core-language related
! type) I recommend to stick with the current state.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change the class template <tt>match_results</tt> header synopsis, 28.10 [re.results] p4 as indicated:</p>
! 
! <blockquote><pre>
! typedef const value_type&amp; const_reference;
! typedef <del>const_reference</del><ins>value_type&amp;</ins> reference;
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2308"></a>2308. Clarify container destructor requirements w.r.t. <tt>std::array</tt></h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-09-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! It has been suggested that Table 96 &mdash; "Container requirements" makes
! confusing requirements for the destructor of <tt>std::array</tt>:
! <p/>
! "note: the destructor is applied to every element of <tt>a</tt>; all the memory is deallocated."
! <p/>
! Since <tt>std::array</tt> obtains no memory, there is none to deallocate,
! arguably  making it unclear what the requirement means for <tt>std::array::~array()</tt>.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change in 23.2.1 [container.requirements.general], Table 96 &mdash; "Container requirements", 
! the "Assertion/note/pre-/post-condition" for the expression "<tt>(&amp;a)-&gt;~X()</tt>" as indicated:</p>
! 
! <blockquote><p>
! note: the destructor is applied to every element of <tt>a</tt>; <del>all the</del><ins>any</ins> memory 
! <ins>obtained</ins> is deallocated.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2313"></a>2313. <tt>tuple_size</tt> should always derive from <tt>integral_constant&lt;size_t, N&gt;</tt></h3>
! <p><b>Section:</b> 20.4.2.5 [tuple.helper] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#tuple.helper">issues</a> in [tuple.helper].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 20.4.2.5 [tuple.helper], the "primary template" is depicted as:
! </p>
! <blockquote><pre>
! template &lt;class... Types&gt;
! class tuple_size&lt;tuple&lt;Types...&gt; &gt;
!   : public integral_constant&lt;size_t, sizeof...(Types)&gt; { };
! </pre></blockquote>
! <p>
! However, 20.3.4 [pair.astuple]/1-2 and 23.3.2.9 [array.tuple]/1-2 are underspecified, saying:
! </p>
! <blockquote><pre>
! tuple_size&lt;pair&lt;T1, T2&gt; &gt;::value
! </pre><blockquote>
! <p>
! <i>Returns:</i> Integral constant expression.
! <p/>
! <i>Value:</i> <tt>2</tt>.
! </p></blockquote>
! </blockquote>
! <blockquote><pre>
! tuple_size&lt;array&lt;T, N&gt; &gt;::value
! </pre><blockquote>
! <p>
! <i>Return type:</i> integral constant expression.
! <p/>
! <i>Value:</i> <tt>N</tt>
! </p></blockquote>
! </blockquote>
! <p>
! They should be required to behave like the "primary template". This is more than a stylistic decision &mdash; it allows 
! <tt>tuple_size</tt> to be passed to a function taking <tt>integral_constant</tt>.
! <p/>
! LWG <a href="lwg-defects.html#1118">1118</a> noticed this underspecification, but instead of correcting it, the resolution changed 
! 20.4.2.5 [tuple.helper]/3 to require <tt>tuple_size&lt;<i>cv</i> T&gt;</tt> to derive from 
! <tt>integral_constant&lt;remove_cv&lt;decltype(TS::value)&gt;::type, TS::value&gt;</tt>. This is unnecessarily overgeneralized.  
! <tt>tuple_size</tt> is primarily for tuples, where it is required to be <tt>size_t</tt>, and it has been extended to handle 
! pairs and arrays, which (as explained above) should also be guaranteed to be <tt>size_t</tt>. <tt>tuple_size&lt;<i>cv</i> T&gt;</tt> 
! works with <i>cv</i>-qualified tuples, pairs, arrays, and user-defined types that also want to participate in the <tt>tuple_size</tt> 
! system. It would be far simpler and perfectly reasonable to expect that user-defined types supporting the "tuple-like protocol" 
! should have <tt>tuple_sizes</tt> of <tt>size_t</tt>.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 20.3.4 [pair.astuple]/1-2 as indicated:</p>
! 
! <blockquote><pre>
! <del>tuple_size&lt;pair&lt;T1, T2&gt; &gt;::value</del>
! <ins>template &lt;class T1, class T2&gt;
! struct tuple_size&lt;pair&lt;T1, T2&gt;&gt;
!   : integral_constant&lt;size_t, 2&gt; { };</ins>
! </pre><blockquote>
! <p>
! <del>-1- <i>Returns:</i> Integral constant expression.</del>
! <p/>
! <del>-2- <i>Value:</i> <tt>2</tt>.</del>
! </p></blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 23.3.2.9 [array.tuple]/1-2 as indicated:</p>
! 
! <blockquote><pre>
! <del>tuple_size&lt;array&lt;T, N&gt; &gt;::value</del>
! <ins>template &lt;class T, size_t N&gt;
! struct tuple_size&lt;array&lt;T, N&gt;&gt;
!   : integral_constant&lt;size_t, N&gt; { };</ins>
! </pre><blockquote>
! <p>
! <del>-1- <i>Returns:</i> Integral constant expression.</del>
! <p/>
! <del>-2- <i>Value:</i> <tt>N</tt>.</del>
! </p></blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 20.4.2.5 [tuple.helper]/p1-p3 as indicated:</p>
! 
! <blockquote><pre>
! <ins>template &lt;class T&gt; struct tuple_size;</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Remarks:</i> All specializations of <tt>tuple_size&lt;T&gt;</tt> shall meet the <tt>UnaryTypeTrait</tt> 
! requirements (20.10.1 [meta.rqmts]) with a <tt>BaseCharacteristic</tt> of <tt>integral_constant&lt;size_t, N&gt;</tt> 
! for some <tt>N</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! <blockquote><pre>
! template &lt;class... Types&gt;
! struct tuple_size&lt;tuple&lt;Types...&gt; &gt;
!   : integral_constant&lt;size_t, sizeof...(Types)&gt; { };
!   
! template &lt;size_t I, class... Types&gt;
! class tuple_element&lt;I, tuple&lt;Types...&gt; &gt; {
! public:
!   typedef TI type;
! };
! </pre><blockquote>
! <p>
! -1- <i>Requires:</i> <tt>I &lt; sizeof...(Types)</tt>. The program is ill-formed if <tt>I</tt> is out of bounds.
! <p/>
! [&hellip;]
! </p></blockquote>
! </blockquote>
! <blockquote><pre>
! template &lt;class T&gt; class tuple_size&lt;const T&gt;;
! template &lt;class T&gt; class tuple_size&lt;volatile T&gt;;
! template &lt;class T&gt; class tuple_size&lt;const volatile T&gt;;
! </pre><blockquote>
! <p>
! -3- Let <i>TS</i> denote <tt>tuple_size&lt;T&gt;</tt> of the <i>cv</i>-unqualified type <tt>T</tt>. Then each of the 
! three templates shall meet the <tt>UnaryTypeTrait</tt> requirements (20.10.1 [meta.rqmts]) with a <tt>BaseCharacteristic</tt> of
! </p>
! <blockquote><pre>
! integral_constant&lt;<del>remove_cv&lt;decltype(TS::value)&gt;::type</del><ins>size_t</ins>, TS::value&gt;
! </pre></blockquote>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2314"></a>2314. <tt>apply()</tt> should return <tt>decltype(auto)</tt> and use <tt>decay_t</tt> before <tt>tuple_size</tt></h3>
! <p><b>Section:</b> 20.5.1 [intseq.general] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The example in 20.5.1 [intseq.general]/2 depicts <tt>apply_impl()</tt> and <tt>apply()</tt> as returning <tt>auto</tt>.  
! This is incorrect because it will trigger decay and will not preserve <tt>F</tt>'s return type. For example, if invoking the 
! functor returns <tt>const int&amp;</tt>, <tt>apply_impl()</tt> and <tt>apply()</tt> will return <tt>int</tt>. <tt>decltype(auto)</tt> 
! should be used for "perfect returning".
! </p>
! <p>
! Additionally, this depicts <tt>apply()</tt> as taking <tt>Tuple&amp;&amp;</tt>, then saying "<tt>std::tuple_size&lt;Tuple&gt;::value</tt>". 
! This is incorrect because when <tt>apply()</tt> is called with lvalue tuples, perfect forwarding will deduce <tt>Tuple</tt> to be <i>cv</i> 
! <tt>tuple&amp;</tt>, but 20.4.2.5 [tuple.helper] says that <tt>tuple_size</tt> handles only <i>cv</i> <tt>tuple</tt>, not 
! references to tuples.  Using <tt>remove_reference_t</tt> would avoid this problem, but so would <tt>decay_t</tt>, which has a 
! significantly shorter name. (The additional transformations that <tt>decay_t</tt> does are neither beneficial nor harmful here.)
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit the example code in 20.5.1 [intseq.general]/2 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class F, class Tuple, std::size_t... I&gt;
!   <del>auto</del><ins>decltype(auto)</ins> apply_impl(F&amp;&amp; f, Tuple&amp;&amp; t, index_sequence&lt;I...&gt;) {
!     return std::forward&lt;F&gt;(f)(std::get&lt;I&gt;(std::forward&lt;Tuple&gt;(t))...);
!   }
! template&lt;class F, class Tuple&gt;
!   <del>auto</del><ins>decltype(auto)</ins> apply(F&amp;&amp; f, Tuple&amp;&amp; t) {
!     using Indices = make_index_sequence&lt;std::tuple_size&lt;<ins>std::decay_t&lt;</ins>Tuple<ins>&gt;</ins>&gt;::value&gt;;
!     return apply_impl(std::forward&lt;F&gt;(f), std::forward&lt;Tuple&gt;(t), Indices());
!   }
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2315"></a>2315. <tt>weak_ptr</tt> should be movable</h3>
! <p><b>Section:</b> 20.8.2.3 [util.smartptr.weak] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.weak">issues</a> in [util.smartptr.weak].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Like <tt>shared_ptr</tt>, <tt>weak_ptr</tt> should be movable to avoid unnecessary atomic increments/decrements of the weak refcount.
! </p>
! 
! <p><i>[2014-02-13 Issaquah: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 20.8.2.3 [util.smartptr.weak]/1, class template <tt>weak_ptr</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template&lt;class T&gt; class weak_ptr {
!   public:
!     typedef T element_type;
! 
!     <i>// 20.9.2.3.1, constructors</i>
!     constexpr weak_ptr() noexcept;
!     template&lt;class Y&gt; weak_ptr(shared_ptr&lt;Y&gt; const&amp; r) noexcept;
!     weak_ptr(weak_ptr const&amp; r) noexcept;
!     template&lt;class Y&gt; weak_ptr(weak_ptr&lt;Y&gt; const&amp; r) noexcept;
!     <ins>weak_ptr(weak_ptr&amp;&amp; r) noexcept;
!     template&lt;class Y&gt; weak_ptr(weak_ptr&lt;Y&gt;&amp;&amp; r) noexcept;</ins>
! 
!     [&hellip;]
! 
!     <i>// 20.9.2.3.3, assignment</i>
!     weak_ptr&amp; operator=(weak_ptr const&amp; r) noexcept;
!     template&lt;class Y&gt; weak_ptr&amp; operator=(weak_ptr&lt;Y&gt; const&amp; r) noexcept;
!     template&lt;class Y&gt; weak_ptr&amp; operator=(shared_ptr&lt;Y&gt; const&amp; r) noexcept;
!     <ins>weak_ptr&amp; operator=(weak_ptr&amp;&amp; r) noexcept;
!     template&lt;class Y&gt; weak_ptr&amp; operator=(weak_ptr&lt;Y&gt;&amp;&amp; r) noexcept;</ins>
!   };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Add the following new paragraphs at the end of sub-clause 20.8.2.3.1 [util.smartptr.weak.const]:</p>
! 
! <blockquote><pre>
! <ins>weak_ptr(weak_ptr&amp;&amp; r) noexcept;
! template&lt;class Y&gt; weak_ptr(weak_ptr&lt;Y&gt;&amp;&amp; r) noexcept;</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Remark:</i> The second constructor shall not participate in overload resolution unless <tt>Y*</tt> is implicitly 
! convertible to <tt>T*</tt>.</ins>
! <p/>
! <ins>-?- <i>Effects:</i> Move-constructs a <tt>weak_ptr</tt> instance from <tt>r</tt>.</ins>
! <p/>
! <ins>-?- <i>Postconditions:</i> <tt>*this</tt> shall contain the old value of <tt>r</tt>. <tt>r</tt> shall be <em>empty</em>. 
! <tt>r.use_count() == 0</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 20.8.2.3.3 [util.smartptr.weak.assign] as indicated:</p>
! 
! <blockquote><pre>
! weak_ptr&amp; operator=(const weak_ptr&amp; r) noexcept;
! template&lt;class Y&gt; weak_ptr&amp; operator=(const weak_ptr&lt;Y&gt;&amp; r) noexcept;
! template&lt;class Y&gt; weak_ptr&amp; operator=(const shared_ptr&lt;Y&gt;&amp; r) noexcept;
! </pre><blockquote>
! <p>
! -1- <i>Effects:</i> [&hellip;]
! <p/>
! -2- <i>Remarks:</i> [&hellip;]
! <p/>
! <ins>-?- <i>Returns:</i> <tt>*this</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! 
! <blockquote><pre>
! <ins>weak_ptr&amp; operator=(weak_ptr&amp;&amp; r) noexcept;
! template&lt;class Y&gt; weak_ptr&amp; operator=(weak_ptr&lt;Y&gt;&amp;&amp; r) noexcept;</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Effects:</i> Equivalent to <tt>weak_ptr(std::move(r)).swap(*this)</tt>.</ins>
! <p/>
! <ins>-?- <i>Returns:</i> <tt>*this</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2316"></a>2316. <tt>weak_ptr::lock()</tt> should be atomic</h3>
! <p><b>Section:</b> 20.8.2.3.5 [util.smartptr.weak.obs] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.weak.obs">issues</a> in [util.smartptr.weak.obs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 20.8.2.2 [util.smartptr.shared]/4 says: "For purposes of determining the presence of a data race, member functions shall 
! access and modify only the <tt>shared_ptr</tt> and <tt>weak_ptr</tt> objects themselves and not objects they refer to. Changes 
! in <tt>use_count()</tt> do not reflect modifications that can introduce data races."  This requires <tt>shared_ptr/weak_ptr</tt> 
! implementations to protect their strong and weak refcounts with atomic operations, without the Standardese having to say this 
! elsewhere. However, 20.8.2.3.5 [util.smartptr.weak.obs]/5 describes <tt>weak_ptr::lock()</tt> with 
! "<i>Returns:</i> <tt>expired() ? shared_ptr&lt;T&gt;() : shared_ptr&lt;T&gt;(*this)</tt>."  
! Even after considering the blanket wording about 
! data races, this specification is insufficient. If this conditional expression were literally implemented, the <tt>use_count()</tt> 
! could change from nonzero to zero after testing <tt>expired()</tt>, causing <tt>shared_ptr&lt;T&gt;(*this)</tt> to throw 
! <tt>bad_weak_ptr</tt> when the intention is for <tt>weak_ptr::lock()</tt> to return empty or nonempty without throwing &mdash; indeed, 
! <tt>weak_ptr::lock()</tt> is marked as <tt>noexcept</tt>.</p>
! <p>
! We all know what <tt>weak_ptr::lock()</tt> should do, the Standardese just doesn't say it. 
! <tt>shared_ptr(const weak_ptr&lt;Y&gt;&amp;)</tt>'s specification is not really affected because 
! 20.8.2.2.1 [util.smartptr.shared.const]/23-27 describes the behavior with English instead of code.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 20.8.2.3.5 [util.smartptr.weak.obs]/5 as indicated:</p>
! 
! <blockquote><pre>
! shared_ptr&lt;T&gt; lock() const noexcept;
! </pre>
! <blockquote>
! <p>
! -5- <i>Returns:</i> <tt>expired() ? shared_ptr&lt;T&gt;() : shared_ptr&lt;T&gt;(*this)</tt><ins>, executed atomically</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2317"></a>2317. The type property queries should be <tt>UnaryTypeTraits</tt> returning <tt>size_t</tt></h3>
! <p><b>Section:</b> 20.10.5 [meta.unary.prop.query] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The sibling sections 20.10.4 [meta.unary], 20.10.6 [meta.rel], and 20.10.7 [meta.trans] respectively specify 
! <tt>UnaryTypeTraits</tt>, <tt>BinaryTypeTraits</tt>, and <tt>TransformationTraits</tt>, as stated by each /2 paragraph.  However, 
! 20.10.5 [meta.unary.prop.query] is underspecified. <tt>alignment_of</tt>, <tt>rank</tt>, and <tt>extent</tt> are said to produce 
! "Values", but the type of that Value is not specified, and the struct templates are not required to derive from <tt>integral_constant</tt>.  
! Such derivation is more than stylistic &mdash; it allows the structs to be passed to functions taking <tt>integral_constant</tt>.
! <p/>
! <tt>alignment_of</tt> returns <tt>alignof(T)</tt> which is <tt>size_t</tt> (5.3.6 [expr.alignof]/2). <tt>extent</tt> returns 
! an array bound, which is clearly <tt>size_t</tt>. <tt>rank</tt> returns "the number of dimensions" of an array, so any type could 
! be chosen, with <tt>size_t</tt> being a reasonable choice. (Another choice would be <tt>unsigned int</tt>, to match <tt>extent</tt>'s 
! template parameter <tt>I</tt>.)
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Following 20.10.5 [meta.unary.prop.query]/1 add a new paragraph as indicated:</p>
! 
! <blockquote><p>
! <ins>Each of these templates shall be a <tt>UnaryTypeTrait</tt> (20.10.1 [meta.rqmts]) with a <tt>BaseCharacteristic</tt> of 
! <tt>integral_constant&lt;size_t, Value&gt;</tt>.</ins>
! </p>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2319"></a>2319. <tt>basic_string</tt>'s move constructor should not be <tt>noexcept</tt></h3>
! <p><b>Section:</b> 21.4.2 [string.cons] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.cons">issues</a> in [string.cons].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In debugging implementations, containers (including <tt>basic_string</tt>) may need to own dynamically allocated helper objects at 
! all times, including in their default-constructed and moved-from states. This means that their default constructors and move 
! constructors may throw exceptions. Therefore, the Standard should not mark them as <tt>noexcept</tt>. (Other implementations will 
! still be permitted to add <tt>noexcept</tt>.)
! </p>
! 
! <p><i>[2014-02, Issaquah : move to Ready]</i></p>
! 
! <p>
! The issue discussion was highly controversial: The arguments in favour was that implementations exist that always need to allocate
! memory even for the move operations (similar as for some other containers) and that this cleans up an inconsistency between <tt>std::string</tt>
! and other container types. Counter arguments were that potentially throwing move operations reduce much of the advantages of move-support,
! e.g. in <tt>vector&lt;string&gt;</tt>.
! </p>
! <p>
! straw poll: accept wording in the issue<br/>
! SF 4 WF 4 N 0 WA 1 SA 1 
! </p>
! <p>
! straw poll: 14 or 17?<br/>
! C++14: 4 C++17: 4 
! </p>
! <p>
! Move to Ready for C++17, as too close to 14 DIS without strong consensus.
! </p>
! <p>
! It was suggested to introduce a special library vocabulary that specifies a "normative encouragement to not throw exceptions" for 
! functions like these. 
! </p>
! <p>
! NJ: I offer to write a proposal to add encouragement for not throwing ... "<tt>noexcept</tt> in italics means should not throw" 
! </p>
! 
! 
! <p><i>[2014/11 Urbana]</i></p>
! 
! <p>
! Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4258">N4258</a>
! </p>
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>In 21.4 [basic.string]/5, class template <tt>basic_string</tt> synopsis, and 21.4.2 [string.cons]/2 
! change as indicated:</p>
! 
! <blockquote><pre>
! basic_string(basic_string&amp;&amp; str) <del>noexcept</del>;
! </pre></blockquote>
! </li>
! 
! <li><p>Edit 21.4.2 [string.cons]/17 as indicated:</p>
! 
! <blockquote><pre>
! basic_string(const basic_string&amp; str, const Allocator&amp; alloc);
! basic_string(basic_string&amp;&amp; str, const Allocator&amp; alloc);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-17- <i>Throws:</i> The second form throws nothing if <tt>alloc == str.get_allocator()</tt>.</del>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2320"></a>2320. <tt>select_on_container_copy_construction()</tt> takes allocators, not containers</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 23.2.1 [container.requirements.general]/7 says "Copy constructors for these container types obtain an allocator by calling 
! <tt>allocator_traits&lt;allocator_type&gt;::select_on_container_copy_construction</tt> on their first parameters."  However, 
! 20.7.8.2 [allocator.traits.members]/8 says that this takes <tt>const Alloc&amp;</tt>, not a container.  
! 23.2.1 [container.requirements.general]/7 goes on to say "Move constructors obtain an allocator by move construction from 
! the allocator belonging to the container being moved." so we can follow that wording.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>In 23.2.1 [container.requirements.general]/7 change as indicated:</p>
! 
! <blockquote><p>
! -7- Unless otherwise specified, all containers defined in this clause obtain memory using an allocator (see 17.6.3.5).
! Copy constructors for these container types obtain an allocator by calling 
! <tt>allocator_traits&lt;allocator_type&gt;::select_on_container_copy_construction</tt> on <del>their first 
! parameters</del><ins>the allocator belonging to the container being copied</ins>. 
! Move constructors obtain an allocator by move construction from the allocator belonging to the container being moved. [&hellip;]
! </p></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2322"></a>2322. Associative(<tt>initializer_list</tt>, stuff) constructors are underspecified</h3>
! <p><b>Section:</b> 23.2.4 [associative.reqmts], 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#associative.reqmts">active issues</a> in [associative.reqmts].</p>
! <p><b>View all other</b> <a href="lwg-index.html#associative.reqmts">issues</a> in [associative.reqmts].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 23.2.4 [associative.reqmts] specifies both <tt>X(i,j)</tt> and <tt>X(i,j,c)</tt>, but only <tt>X(il)</tt>.  
! 23.4.4.1 [map.overview] declares "<tt>map(initializer_list&lt;value_type&gt;, const Compare&amp; = Compare(), 
! const Allocator&amp; = Allocator());</tt>" but 23.4.4.2 [map.cons] intentionally doesn't explain it, relying 
! on the big table's requirements. As a result, <tt>map(il, c)</tt>'s behavior is not actually specified by the Standard.  
! (All of the other ordered associative containers also provide such constructors.)
! <p/>
! The unordered associative containers are similarly affected, although they have more arguments. (Again, the actual 
! containers are correctly depicted with the desired constructors, their behavior just isn't specified.)
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 23.2.4 [associative.reqmts], Table 102 &mdash; "Associative container requirements", as indicated:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 102 &mdash; Associative container requirements (in addition to container) (continued)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Complexity</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X(il);</tt>
! </td>
! <td>
! <tt></tt>
! </td>
! <td>
! Same as <tt>X(il.begin(), il.end())</tt>.
! </td>
! <td>
! <del>s</del><ins>S</ins>ame as <tt>X(il.begin(), il.end())</tt>.
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>X(il, c);</tt></ins>
! </td>
! <td>
! <tt>&nbsp;</tt>
! </td>
! <td>
! <ins>Same as <tt>X(il.begin(), il.end(), c)</tt>.</ins>
! </td>
! <td>
! <ins>Same as <tt>X(il.begin(), il.end(), c)</tt>.</ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! 
! <li><p>Edit 23.2.5 [unord.req], Table 103 "Unordered associative container requirements", as indicated:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 103 &mdash; Unordered associative container requirements (in addition to container)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! <th>Complexity</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X(il)</tt>
! </td>
! <td>
! <tt>X</tt>
! </td>
! <td>
! Same as <tt>X(il.begin(), il.end())</tt>.
! </td>
! <td>
! Same as <tt>X(il.begin(), il.end())</tt>.
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>X(il, n)</tt></ins>
! </td>
! <td>
! <ins><tt>X</tt></ins>
! </td>
! <td>
! <ins>Same as <tt>X(il.begin(), il.end(), n)</tt>.</ins>
! </td>
! <td>
! <ins>Same as <tt>X(il.begin(), il.end(), n)</tt>.</ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>X(il, n, hf)</tt></ins>
! </td>
! <td>
! <ins><tt>X</tt></ins>
! </td>
! <td>
! <ins>Same as <tt>X(il.begin(), il.end(), n, hf)</tt>.</ins>
! </td>
! <td>
! <ins>Same as <tt>X(il.begin(), il.end(), n, hf)</tt>.</ins>
! </td>
! </tr>
! 
! <tr>
! <td>
! <ins><tt>X(il, n, hf, eq)</tt></ins>
! </td>
! <td>
! <ins><tt>X</tt></ins>
! </td>
! <td>
! <ins>Same as <tt>X(il.begin(), il.end(), n, hf, eq)</tt>.</ins>
! </td>
! <td>
! <ins>Same as <tt>X(il.begin(), il.end(), n, hf, eq)</tt>.</ins>
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2323"></a>2323. <tt>vector::resize(n, t)</tt>'s specification should be simplified</h3>
! <p><b>Section:</b> 23.3.6.3 [vector.capacity], 23.3.3.3 [deque.capacity] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#vector.capacity">active issues</a> in [vector.capacity].</p>
! <p><b>View all other</b> <a href="lwg-index.html#vector.capacity">issues</a> in [vector.capacity].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! First, 23.3.3.3 [deque.capacity]/4 and 23.3.6.3 [vector.capacity]/16 say that <tt>resize(size_type sz, const T&amp; c)</tt> 
! "<i>Requires:</i> <tt>T</tt> shall be <tt>MoveInsertable</tt> into <tt>*this</tt> and <tt>CopyInsertable</tt> into <tt>*this</tt>."  
! The <tt>CopyInsertable</tt> requirement is correct (because <tt>sz</tt> might be <tt>size() + 2</tt> or more), but the 
! <tt>MoveInsertable</tt> requirement is redundant due to 23.2.1 [container.requirements.general]/13: "<tt>T</tt> is 
! <tt>CopyInsertable</tt> into <tt>X</tt> means that, in addition to <tt>T</tt> being <tt>MoveInsertable</tt> into <tt>X</tt>, the [...]".  
! (LWG <a href="lwg-defects.html#2033">2033</a>'s resolution said that this was "not redundant, because <tt>CopyInsertable</tt> is not necessarily a refinement 
! of <tt>MoveInsertable</tt>" which was true at the time, but then LWG <a href="lwg-defects.html#2177">2177</a>'s resolution made it a refinement.)
! <p/>
! Second, 23.3.6.3 [vector.capacity]/17 says "<i>Remarks:</i> If an exception is thrown other than by the move constructor of a 
! non-<tt>CopyInsertable</tt> <tt>T</tt> there are no effects." This is confusing because <tt>T</tt> is required to be 
! <tt>CopyInsertable</tt>. (/14 says the same thing for <tt>resize(size_type sz)</tt>, where it is correct because that overload 
! requires only <tt>MoveInsertable</tt> and <tt>DefaultInsertable</tt>.)
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 23.3.3.3 [deque.capacity]/4 as indicated:</p>
! 
! <blockquote><pre>
! void resize(size_type sz, const T&amp; c);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -4- <i>Requires:</i> <tt>T</tt> shall be <del><tt>MoveInsertable</tt> into <tt>*this</tt> and</del> <tt>CopyInsertable</tt> into 
! <tt>*this</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 23.3.6.3 [vector.capacity]/16+17 as indicated:</p>
! 
! <blockquote><pre>
! void resize(size_type sz, const T&amp; c);
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -16- <i>Requires:</i> <tt>T</tt> shall be <del><tt>MoveInsertable</tt> into <tt>*this</tt> and</del> <tt>CopyInsertable</tt> into 
! <tt>*this</tt>.
! <p/>
! -17- <i>Remarks:</i> If an exception is thrown <del>other than by the move constructor of a non-<tt>CopyInsertable</tt> <tt>T</tt></del> 
! there are no effects.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2324"></a>2324. Insert iterator constructors should use <tt>addressof()</tt></h3>
! <p><b>Section:</b> 24.5.2.2.1 [back.insert.iter.cons], 24.5.2.4.1 [front.insert.iter.cons], 24.5.2.6.1 [insert.iter.cons] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 24.5.2.2.1 [back.insert.iter.cons]/1, 24.5.2.4.1 [front.insert.iter.cons]/1, and 24.5.2.6.1 [insert.iter.cons]/1 
! say "Initializes container with <tt>&amp;x</tt>", which doesn't defend against containers overloading <tt>operator&amp;()</tt>.  
! Containers are now required to have such defenses for their elements, so we may as well be consistent here.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 24.5.2.2.1 [back.insert.iter.cons]/1 as indicated:</p>
! 
! <blockquote><pre>
! explicit back_insert_iterator(Container&amp; x);
! </pre><blockquote>
! <p>
! -1- <i>Effects:</i> Initializes <tt>container</tt> with <tt><del>&amp;x</del><ins>std::addressof(x)</ins></tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 24.5.2.4.1 [front.insert.iter.cons]/1 as indicated:</p>
! 
! <blockquote><pre>
! explicit front_insert_iterator(Container&amp; x);
! </pre><blockquote>
! <p>
! -1- <i>Effects:</i> Initializes <tt>container</tt> with <tt><del>&amp;x</del><ins>std::addressof(x)</ins></tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! <li><p>Edit 24.5.2.6.1 [insert.iter.cons]/1 as indicated:</p>
! 
! <blockquote><pre>
! insert_iterator(Container&amp; x, typename Container::iterator i);
! </pre><blockquote>
! <p>
! -1- <i>Effects:</i> Initializes <tt>container</tt> with <tt><del>&amp;x</del><ins>std::addressof(x)</ins></tt> and <tt>iter</tt> with <tt>i</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2325"></a>2325. <tt>minmax_element()</tt>'s behavior differing from <tt>max_element()</tt>'s should be noted</h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 25.4.7 [alg.min.max]/23 says that <tt>max_element()</tt> finds the <em>first</em> biggest element, while /25 says that 
! <tt>minmax_element()</tt> finds the <em>last</em> biggest element. This significant difference is unusual &mdash; it means that 
! <tt>minmax_element(args)</tt> is not equivalent to <tt>make_pair(min_element(args), max_element(args))</tt>, whereas the other 
! major "two for one" algorithm <tt>equal_range(args)</tt> is equivalent to <tt>make_pair(lower_bound(args), upper_bound(args))</tt>.  
! <tt>minmax_element()</tt>'s behavior is intentional &mdash; it is a fundamental consequence of the <tt>3N/2</tt> algorithm &mdash; 
! but the Standardese does not draw attention to this in any way. This wording came from LWG <a href="lwg-defects.html#715">715</a>'s resolution (which 
! changed the semantics but didn't mention it), citing CLRS for the algorithm &mdash; but CLRS doesn't mention the behavior for 
! equivalent elements! The wording here deeply confused me (as an STL maintainer fixing an incorrect implementation) until I walked 
! through the algorithm by hand and figured out the fundamental reason. It would be really nice for the Standard to provide a hint 
! that something magical is happening here.
! </p>
! 
! <p><i>[2014-06-06 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Add a footnote to 25.4.7 [alg.min.max]/25 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class ForwardIterator&gt;
!   pair&lt;ForwardIterator, ForwardIterator&gt;
!     minmax_element(ForwardIterator first, ForwardIterator last);
! template&lt;class ForwardIterator, class Compare&gt;
!   pair&lt;ForwardIterator, ForwardIterator&gt;
!     minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
! </pre><blockquote>
! <p>
! -25- <i>Returns:</i> <tt>make_pair(first, first)</tt> if <tt>[first,last)</tt> is empty, otherwise <tt>make_pair(m, M)</tt>, where
! <tt>m</tt> is the first iterator in <tt>[first,last)</tt> such that no iterator in the range refers to a smaller element,
! and where <tt>M</tt> is the last iterator <ins>[Footnote: This behavior intentionally differs from <tt>max_element()</tt>.]</ins> 
! in <tt>[first,last)</tt> such that no iterator in the range refers to a larger element.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2329"></a>2329. <tt>regex_match()/regex_search()</tt> with <tt>match_results</tt> should forbid temporary strings</h3>
! <p><b>Section:</b> 28.4 [re.syn] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.syn">issues</a> in [re.syn].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Consider the following code:
! </p>
! <blockquote><pre>
! const regex r(R"(meow(\d+)\.txt)");
! smatch m;
! if (regex_match(dir_iter-&gt;path().filename().string(), m, r)) {
!   DoSomethingWith(m[1]);
! }
! </pre></blockquote>
! <p>
! This occasionally crashes. The problem is that <tt>dir_iter-&gt;path().filename().string()</tt> returns a temporary string, 
! so the <tt>match_results</tt> contains invalidated iterators into a destroyed temporary string.
! <p/>
! It's fine for <tt>regex_match/regex_search(str, reg)</tt> to accept temporary strings, because they just return <tt>bool</tt>. 
! However, the overloads taking <tt>match_results</tt> should forbid temporary strings.
! </p>
! 
! <p><i>[2014-02-13 Issaquah: Move as Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 28.4 [re.syn], header <tt>&lt;regex&gt;</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! #include &lt;initializer_list&gt;
! 
! namespace std {
! 
!   [&hellip;]
!   
!   <i>// 28.11.2, function template regex_match:</i>
!   [&hellip;]
!   <ins>template &lt;class ST, class SA, class Allocator, class charT, class traits&gt; 
!   bool regex_match(const basic_string&lt;charT, ST, SA&gt;&amp;&amp;, 
!                    match_results&lt;
!                      typename basic_string&lt;charT, ST, SA&gt;::const_iterator, 
!                      Allocator&gt;&amp;, 
!                    const basic_regex&lt;charT, traits&gt;&amp;, 
!                    regex_constants::match_flag_type = 
!                      regex_constants::match_default) = delete;</ins>
! 
!   <i>// 28.11.3, function template regex_search:</i>
!   [&hellip;]
!   <ins>template &lt;class ST, class SA, class Allocator, class charT, class traits&gt; 
!   bool regex_search(const basic_string&lt;charT, ST, SA&gt;&amp;&amp;, 
!                     match_results&lt;
!                       typename basic_string&lt;charT, ST, SA&gt;::const_iterator, 
!                       Allocator&gt;&amp;, 
!                     const basic_regex&lt;charT, traits&gt;&amp;, 
!                     regex_constants::match_flag_type = 
!                       regex_constants::match_default) = delete;</ins>
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2330"></a>2330. <tt>regex("meow", regex::icase)</tt> is technically forbidden but should be permitted</h3>
! <p><b>Section:</b> 28.5.1 [re.synopt] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re.synopt">active issues</a> in [re.synopt].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.synopt">issues</a> in [re.synopt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 28.5.1 [re.synopt]/1 says "A valid value of type <tt>syntax_option_type</tt> shall have exactly one of the elements 
! <tt>ECMAScript</tt>, <tt>basic</tt>, <tt>extended</tt>, <tt>awk</tt>, <tt>grep</tt>, <tt>egrep</tt>, set." 
! <p/>
! This "exactly one" wording technically forbids passing <tt>icase</tt> by itself! Users should not be required to pass 
! <tt>regex::ECMAScript | regex::icase</tt>. (Note that the cost of an additional check for no grammar being explicitly requested 
! is completely irrelevant, as regex construction is so much more expensive.)
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Edit 28.5.1 [re.synopt] as indicated:</p>
! 
! <blockquote><p>
! -1- The type <tt>syntax_option_type</tt> is an implementation-defined bitmask type (17.5.2.1.3). Setting its elements
! has the effects listed in table 138. A valid value of type <tt>syntax_option_type</tt> shall have <del>exactly</del><ins>at most</ins> 
! one of the <ins>grammar</ins> elements <tt>ECMAScript</tt>, <tt>basic</tt>, <tt>extended</tt>, <tt>awk</tt>, <tt>grep</tt>, 
! <tt>egrep</tt>, set. <ins> If no grammar element is set, the default grammar is <tt>ECMAScript</tt>.</ins>
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2332"></a>2332. <tt>regex_iterator/regex_token_iterator</tt> should forbid temporary regexes</h3>
! <p><b>Section:</b> 28.12 [re.iter] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-09-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Users can write "<tt>for(sregex_iterator i(s.begin(), s.end(), regex("meow")), end; i != end; ++i)</tt>", binding a temporary 
! <tt>regex</tt> to <tt>const regex&amp;</tt> and storing a pointer to it. This will compile silently, triggering undefined behavior 
! at runtime. We now have the technology to prevent this from compiling, like how <tt>reference_wrapper</tt> refuses to bind to 
! temporaries.
! </p>
! 
! <p><i>[2014-02-14 Issaquah meeting: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Change 28.12.1 [re.regiter]/1, class template <tt>regex_iterator</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! regex_iterator();
! regex_iterator(BidirectionalIterator a, BidirectionalIterator b,
!   const regex_type&amp; re,
!   regex_constants::match_flag_type m =
!     regex_constants::match_default);
! <ins>regex_iterator(BidirectionalIterator a, BidirectionalIterator b,
!   const regex_type&amp;&amp; re,
!   regex_constants::match_flag_type m =
!     regex_constants::match_default) = delete;</ins>
! </pre></blockquote>
! </li>
! 
! <li><p>Change 28.12.2 [re.tokiter]/6, class template <tt>regex_token_iterator</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! regex_token_iterator();
! regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
!                      const regex_type&amp; re,
!                      int submatch = 0,
!                      regex_constants::match_flag_type m =
!                        regex_constants::match_default);
! regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
!                      const regex_type&amp; re,
!                      const std::vector&lt;int&gt;&amp; submatches,
!                      regex_constants::match_flag_type m =
!                        regex_constants::match_default);
! regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
!                      const regex_type&amp; re,
!                      initializer_list&lt;int&gt; submatches,
!                      regex_constants::match_flag_type m =
!                        regex_constants::match_default);
! template &lt;std::size_t N&gt;
! regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
!                      const regex_type&amp; re,
!                      const int (&amp;submatches)[N],
!                      regex_constants::match_flag_type m =
!                        regex_constants::match_default);
! <ins>regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
!                      const regex_type&amp;&amp; re,
!                      int submatch = 0,
!                      regex_constants::match_flag_type m =
!                        regex_constants::match_default) = delete;
! regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
!                      const regex_type&amp;&amp; re,
!                      const std::vector&lt;int&gt;&amp; submatches,
!                      regex_constants::match_flag_type m =
!                        regex_constants::match_default) = delete;
! regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
!                      const regex_type&amp;&amp; re,
!                      initializer_list&lt;int&gt; submatches,
!                      regex_constants::match_flag_type m =
!                        regex_constants::match_default) = delete;
! template &lt;std::size_t N&gt;
! regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
!                      const regex_type&amp;&amp; re,
!                      const int (&amp;submatches)[N],
!                      regex_constants::match_flag_type m =
!                        regex_constants::match_default) = delete;</ins>
! </pre></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2333"></a>2333. [fund.ts] Hashing disengaged <tt>optional&lt;T&gt;</tt> objects</h3>
! <p><b>Section:</b> X [optional.hash] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2013-10-03 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! The spec for <tt>hash&lt;optional&lt;T&gt;&gt;</tt> doesn't say anything about disengaged
! objects, so 1.3 [defns.undefined] would imply it's undefined behaviour,
! but that's very unhelpful to users.
! <p/>
! If hashing disengaged optional objects is undefined there should be a <i>Requires</i>, otherwise 
! there should be some statement saying it's OK.
! <p/>
! It would be possible to specify the value, e.g. saying it returns the
! same value as something like <tt>std::hash&lt;void*&gt;()(nullptr)</tt>, but leaving
! it unspecified would permit users to specialize <tt>hash&lt;optional&lt;UserDefinedType&gt;&gt;</tt> so 
! that the hash value for a disengaged object is distinct from any value returned by
! <tt>hash&lt;UserDefinedType&gt;</tt>.
! </p>
! 
! <p><i>[2014-06-06 pre-Rapperswill]</i></p>
! 
! <p>
! This issue has been reopened as fundamentals-ts.
! </p>
! 
! <p><i>[2014-06-07 Daniel comments]</i></p>
! 
! <p>
! This issue should be set to <b>Resolved</b>, because the wording fix is already applied in the 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4023.html#optional.hash">last fundamentals working draft</a>.
! </p>
! 
! <p><i>[2014-06-16 Rapperswill]</i></p>
! 
! <p>
! Confirmed that this issue is resolved in the current Library Fundamentals working paper.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3691.</p>
! 
! <ol>
! <li><p>Add to X [optional.hash]/3</p>
! 
! <blockquote><pre>
! template &lt;class T&gt; struct hash&lt;optional&lt;T&gt;&gt;;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -3- For an object <tt>o</tt> of type <tt>optional&lt;T&gt;</tt>, if <tt>bool(o) == true</tt>, 
! <tt>hash&lt;optional&lt;T&gt;&gt;()(o)</tt> shall evaluate to the same value as 
! <tt>hash&lt;T&gt;()(*o)</tt> <ins>otherwise it evaluates to an unspecified value</ins>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2339"></a>2339. Wording issue in <tt>nth_element</tt></h3>
! <p><b>Section:</b> 25.4.2 [alg.nth.element] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Christopher Jefferson <b>Opened:</b> 2013-10-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.nth.element">issues</a> in [alg.nth.element].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The wording of <tt>nth_element</tt> says:
! </p>
! <blockquote><pre>
! template&lt;class RandomAccessIterator&gt;
!   void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
!                    RandomAccessIterator last);
! </pre><blockquote>
! <p>
! After <tt>nth_element</tt> the element in the position pointed to by <tt>nth</tt> is the element that would be in that
! position if the whole range were sorted. Also for every iterator <tt>i</tt> in the range <tt>[first,nth)</tt> and every
! iterator <tt>j</tt> in the range <tt>[nth,last)</tt> it holds that: <tt>!(*j &lt; *i)</tt> or <tt>comp(*j, *i) == false</tt>.
! </p>
! </blockquote></blockquote>
! <p>
! That wording, to me, implies that there must be an element at '<tt>nth</tt>'.
! However, gcc at least accepts <tt>nth == last</tt>, and returns without effect
! (which seems like the sensible option).
! <p/>
! Is it intended to accept <tt>nth == last</tt>? If so, then I would suggest adding
! this to the wording explicitly, say:
! </p>
! <blockquote>
! <p>
! After <tt>nth_element</tt> the element in the position pointed to by <tt>nth</tt><ins>, if any,</ins> is the element that
! would be in that position if the whole range were sorted. Also for every iterator <tt>i</tt> in the range <tt>[first,nth)</tt>
! and every iterator <tt>j</tt> in the range <tt>[nth,last)</tt> it holds that: <tt>!(*j &lt; *i)</tt> or <tt>comp(*j, *i) == false</tt>.
! </p>
! </blockquote>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Modify 25.4.2 [alg.nth.element]/1 as indicated:</p>
! 
! <blockquote><pre>
! template&lt;class RandomAccessIterator&gt;
!   void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
!                    RandomAccessIterator last);
! template&lt;class RandomAccessIterator, class Compare&gt;
!   void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
!                    RandomAccessIterator last, Compare comp);
! </pre><blockquote>
! <p>
! -1- After <tt>nth_element</tt> the element in the position pointed to by <tt>nth</tt> is the element that would be in that
! position if the whole range were sorted<ins>, unless <tt>nth == last</tt></ins>. Also for every iterator <tt>i</tt> in the 
! range <tt>[first,nth)</tt> and every iterator <tt>j</tt> in the range <tt>[nth,last)</tt> it holds that: <tt>!(*j &lt; *i)</tt> 
! or <tt>comp(*j, *i) == false</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2340"></a>2340. Replacement allocation functions declared as inline</h3>
! <p><b>Section:</b> 17.6.4.6 [replacement.functions] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> David Majnemer <b>Opened:</b> 2013-10-20 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#replacement.functions">issues</a> in [replacement.functions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! N3290 17.6.4.6 [replacement.functions]/p3 says:
! </p>
! <blockquote><p>
! The program's definitions shall not be specified as <tt>inline</tt>.
! </p></blockquote>
! <p>
! This seems to permit declarations of replacement allocation functions that are specified as <tt>inline</tt> so long 
! as they aren't used. This behavior seems more like a bug than a feature, I propose that we do the following:
! </p>
! <blockquote><p>
! The program's <del>definitions</del><ins>declarations</ins> shall not be specified as <tt>inline</tt>.
! </p></blockquote>
! 
! <p><i>[2014-02-15 Issaquah : Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Modify 17.6.4.6 [replacement.functions]/3 as indicated:</p>
! 
! <blockquote><p>
! -3- The program's definitions are used instead of the default versions supplied by the implementation (18.6).
! Such replacement occurs prior to program startup (3.2, 3.6). The program's <del>definitions</del><ins>declarations</ins> 
! shall not be specified as <tt>inline</tt>. No diagnostic is required.</p>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2341"></a>2341. Inconsistency between <tt>basic_ostream::seekp(pos)</tt> and <tt>basic_ostream::seekp(off, dir)</tt></h3>
! <p><b>Section:</b> 27.7.3.5 [ostream.seeks] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Marshall Clow  <b>Opened:</b> 2013-10-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! In 27.7.3.5 [ostream.seeks], we have:
! </p>
! <blockquote><pre>
! basic_ostream&lt;charT,traits&gt;&amp; seekp(pos_type pos);
! </pre><blockquote>
! <p>
! -3- <i>Effects:</i> If <tt>fail() != true</tt>, executes <tt>rdbuf()-&gt;pubseekpos(pos, ios_base::out)</tt>. In case of failure, 
! the function calls <tt>setstate(failbit)</tt> (which may throw <tt>ios_base::failure</tt>).
! <p/>
! -4- <i>Returns:</i> <tt>*this</tt>.
! </p>
! </blockquote></blockquote>
! <blockquote><pre>
! basic_ostream&lt;charT,traits&gt;&amp; seekp(off_type off, ios_base::seekdir dir);
! </pre><blockquote>
! <p>
! -5- <i>Effects:</i> If <tt>fail() != true</tt>, executes <tt>rdbuf()-&gt;pubseekoff(off, dir, ios_base::out)</tt>.
! <p/>
! -6- <i>Returns:</i> <tt>*this</tt>.
! </p>
! </blockquote></blockquote>
! <p>
! The first call is required to set the <tt>failbit</tt> on failure, but the second is not
! <p/>
! So (given two ostreams, <tt>os1</tt> and <tt>os2</tt>) the following code (confusingly) works:
! </p>
! <blockquote><pre>
! os1.seekp(-1);
! assert(os1.fail());
! 
! os2.seekp(-1, std::ios_base::beg);
! assert(os2.good());
! </pre></blockquote>
! <p>
! Note that the description of <tt>basic_istream&lt;charT,traits&gt;&amp; seekg(off_type off, ios_base::seekdir dir)</tt> in 
! 27.7.2.3 [istream.unformatted] p43 <em>does</em> require setting <tt>failbit</tt>.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Modify 27.7.3.5 [ostream.seeks]p5 as indicated:</p>
! 
! <blockquote><pre>
! basic_ostream&lt;charT,traits&gt;&amp; seekp(off_type off, ios_base::seekdir dir);
! </pre><blockquote>
! <p>
! -5- <i>Effects:</i> If <tt>fail() != true</tt>, executes <tt>rdbuf()-&gt;pubseekoff(off, dir, ios_base::out)</tt>.
! <ins>In case of failure, the function calls <tt>setstate(failbit)</tt> (which may throw <tt>ios_base::failure</tt>).</ins>
! <p/>
! -6- <i>Returns:</i> <tt>*this</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2344"></a>2344. <tt>quoted()</tt>'s interaction with padding is unclear</h3>
! <p><b>Section:</b> 27.7.6 [quoted.manip] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-11-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#quoted.manip">issues</a> in [quoted.manip].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Given this code:
! </p>
! <blockquote><pre>
! cout &lt;&lt; "[" &lt;&lt; left &lt;&lt; setfill('x') &lt;&lt; setw(20) &lt;&lt; R"("AB \"CD\" EF")" &lt;&lt; "]" &lt;&lt; endl;
! cout &lt;&lt; "[" &lt;&lt; left &lt;&lt; setfill('y') &lt;&lt; setw(20) &lt;&lt; quoted(R"(GH "IJ" KL)") &lt;&lt; "]" &lt;&lt; endl;
! </pre></blockquote>
! <p>
! The first line prints <tt>["AB \"CD\" EF"xxxxxx]</tt>. The second line should probably print <tt>["GH \"IJ\" KL"yyyyyy]</tt>, but 
! 27.7.6 [quoted.manip]/2 doesn't say whether or how <tt>quoted()</tt> should interact with padding. All it says is that 
! </p>
! <blockquote><p>
! "<tt>out &lt;&lt; quoted(s, delim, escape)</tt> behaves as if it inserts the following characters into out using character 
! inserter function templates (27.7.3.6.4)". 
! </p></blockquote>
! <p>
! 27.7.3.6.4 [ostream.inserters.character] specifies both single-character and null-terminated inserters, both referring to 
! 27.7.3.6.1 [ostream.formatted.reqmts]/3 for padding. Literally implementing <tt>quoted()</tt> with single-character inserters 
! would result in padding being emitted after the first character, with undesirable effects for <tt>ios_base::left</tt>.
! <p/>
! It appears that 21.4.8.9 [string.io]/5 has the appropriate incantations to follow here. It says that <tt>os &lt;&lt; str</tt> 
! </p>
! <blockquote><p>
! "Behaves as a formatted output function (27.7.3.6.1) of <tt>os</tt>. Forms a character sequence <tt>seq</tt>, initially consisting of the 
! elements defined by the range <tt>[str.begin(), str.end())</tt>. Determines padding for <tt>seq</tt> as described in 27.7.3.6.1. 
! Then inserts <tt>seq</tt> as if by calling <tt>os.rdbuf()-&gt;sputn(seq, n)</tt>, where <tt>n</tt> is the larger of <tt>os.width()</tt> 
! and <tt>str.size();</tt> then calls <tt>os.width(0)</tt>." 
! </p></blockquote>
! <p>
! Additionally, saying that it's a "formatted output function" activates 27.7.3.6.1 [ostream.formatted.reqmts]/1's wording for 
! sentry objects.
! </p>
! 
! <p><i>[2014-02-14 Issaquah meeting: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Edit 27.7.6 [quoted.manip] as follows:</p>
! 
! <blockquote><pre>
! template &lt;class charT&gt;
!   unspecified quoted(const charT* s, charT delim=charT('"'), charT escape=charT('\\'));
! template &lt;class charT, class traits, class Allocator&gt;
!   unspecified quoted(const basic_string&lt;charT, traits, Allocator>&amp; s,
!                      charT delim=charT('"'), charT escape=charT('\\'));
! </pre><blockquote>
! <p>
! -2- <i>Returns:</i> An object of unspecified type such that if <tt>out</tt> is an instance of <tt>basic_ostream</tt> with member
! type <tt>char_type</tt> the same as <tt>charT</tt>, then the expression <tt>out &lt;&lt; quoted(s, delim, escape)</tt> behaves
! as <del>if it inserts the following characters into <tt>out</tt> using character inserter function templates (27.7.3.6.4),
! which may throw <tt>ios_base::failure</tt> (27.5.3.1.1)</del><ins>a formatted output function (27.7.3.6.1 [ostream.formatted.reqmts]) 
! of <tt>out</tt>. This forms a character sequence <tt>seq</tt>, initially consisting of the following elements</ins>:
! </p>
! <ul>
! <li><p>
! <tt>delim</tt>.
! </p></li>
! <li><p>
! Each character in <tt>s</tt>. If the character to be output is equal to escape or <tt>delim</tt>, as determined by
! <tt>operator==</tt>, first output <tt>escape</tt>.
! </p></li>
! <li><p>
! <tt>delim</tt>.
! </p></li>
! </ul>
! <p>
! <ins>Let <tt>x</tt> be the number of elements initially in <tt>seq</tt>. Then padding is determined for <tt>seq</tt> as described 
! in 27.7.3.6.1 [ostream.formatted.reqmts], <tt>seq</tt> is inserted as if by calling <tt>out.rdbuf()-&gt;sputn(seq, n)</tt>, where 
! <tt>n</tt> is the larger of <tt>out.width()</tt> and <tt>x</tt>, and <tt>out.width(0)</tt> is called.</ins>
! The expression <tt>out &lt;&lt; quoted(s, delim, escape)</tt> shall have type <tt>basic_ostream&lt;charT, traits&gt;&amp;</tt>
! and value <tt>out</tt>.
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2346"></a>2346. <tt>integral_constant</tt>'s member functions should be marked <tt>noexcept</tt></h3>
! <p><b>Section:</b> 20.10.3 [meta.help] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2013-11-05 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.help">issues</a> in [meta.help].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Obvious.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Edit 20.10.3 [meta.help] as indicated:</p>
! 
! <blockquote><pre>
! namespace std {
!   template&lt;class T, T v&gt;
!   struct integral_constant {
!     static constexpr T value = v;
!     typedef T value_type;
!     typedef integral_constant&lt;T,v&gt; type;
!     constexpr operator value_type() const <ins>noexcept</ins> { return value; }
!     constexpr value_type operator()() const <ins>noexcept</ins> { return value; }
!   };
!   [&hellip;]
! }
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2350"></a>2350. <tt>min</tt>, <tt>max</tt>, and <tt>minmax</tt> should be <tt>constexpr</tt></h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Ville Voutilainen <b>Opened:</b> 2013-12-15 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Having <tt>min</tt>, <tt>max</tt>, and <tt>minmax</tt> <tt>constexpr</tt> 
! was a large part of the motivation to allow reference-to-const arguments for 
! <tt>constexpr</tt> functions as per 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3039.pdf">N3039</a>.
! Furthermore, <tt>initializer_lists</tt> are immutable and not-movable-from
! for large part in order to allow using them in <tt>constexpr</tt> contexts
! and other hoisting-optimizations. In <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3797.pdf">N3797</a> 
! version of the draft none of these functions are <tt>constexpr</tt>, and they should be made
! <tt>constexpr</tt>.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>In 25.1 [algorithms.general], header <tt>&lt;algorithm&gt;</tt> synopsis, and 25.4.7 [alg.min.max], 
! change as indicated (add <tt>constexpr</tt> to every signature before <tt>min_element</tt>):</p>
! 
! <blockquote><pre>
! template&lt;class T&gt; <ins>constexpr</ins> const T&amp; min(const T&amp; a, const T&amp; b);
! template&lt;class T, class Compare&gt;
! <ins>constexpr</ins> const T&amp; min(const T&amp; a, const T&amp; b, Compare comp);
! [&hellip;]
! template&lt;class T&gt;
! <ins>constexpr</ins> T min(initializer_list&lt;T&gt; t);
! template&lt;class T, class Compare>
! <ins>constexpr</ins> T min(initializer_list&lt;T&gt; t, Compare comp);
! [&hellip;]
! template&lt;class T&gt; <ins>constexpr</ins> const T&amp; max(const T&amp; a, const T&amp; b);
! template&lt;class T, class Compare&gt;
! <ins>constexpr</ins> const T&amp; max(const T&amp; a, const T&amp; b, Compare comp);
! [&hellip;]
! template&lt;class T&gt;
! <ins>constexpr</ins> T max(initializer_list&lt;T&gt; t);
! template&lt;class T, class Compare>
! <ins>constexpr</ins> T max(initializer_list&lt;T&gt; t, Compare comp);
! [&hellip;]
! template&lt;class T&gt; <ins>constexpr</ins> pair&lt;const T&amp;, const T&amp;&gt; minmax(const T&amp; a, const T&amp; b);
! template&lt;class T, class Compare&gt;
! <ins>constexpr</ins> pair&lt;const T&amp;, const T&amp;&gt; minmax(const T&amp; a, const T&amp; b, Compare comp);
! [&hellip;]
! template&lt;class T&gt;
! <ins>constexpr</ins> pair&lt;T, T&gt; minmax(initializer_list&lt;T&gt; t);
! template&lt;class T, class Compare>
! <ins>constexpr</ins> pair&lt;T, T&gt; minmax(initializer_list&lt;T&gt; t, Compare comp);
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2354"></a>2354. Unnecessary copying when inserting into maps with braced-init syntax</h3>
! <p><b>Section:</b> 23.4.4.1 [map.overview], 23.4.5.1 [multimap.overview], 23.5.4.1 [unord.map.overview], 23.5.5.1 [unord.multimap.overview] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Geoffrey Romer <b>Opened:</b> 2014-01-08 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The rvalue-reference <tt>insert()</tt> members of <tt>map</tt>, <tt>multimap</tt>, <tt>unordered_map</tt>, and 
! <tt>unordered_multimap</tt> are specified as function templates, where the rvalue-reference parameter type 
! depends on the template parameter. 
! As a consequence, these overloads cannot be invoked via braced-initializer syntax (e.g. <tt>my_map.insert({key, value})</tt>), 
! because the template argument cannot be deduced from a braced-init-list. Such calls instead resolve to the 
! const lvalue reference overload, which forces a non-elidable copy of the argument, despite the fact that the 
! argument is an rvalue, and so should be eligible for moving and copy elision.
! <p/>
! This leads to sub-optimal performance for copyable values, and makes this syntax unusable with noncopyable 
! values. This is particularly problematic because sources such as Josuttis's "C++ Standard Library" recommend 
! this syntax as the preferred way to insert into a map in C++11.
! <p/>
! I think this can be fixed by adding an equivalent non-template <tt>value_type&amp;&amp;</tt> overload for each affected 
! member template. Simply declaring these members in the class synopses should be sufficient; their semantics are 
! already dictated by the container concepts (c.f. the corresponding lvalue-reference overloads, which have no 
! additional discussion beyond being listed in the synopsis).
! </p>
! 
! <p><i>[2012-02-13 Issaquah]</i></p>
! 
! <p>
! AJM: Is this not better solved by <tt>emplace</tt>?
! </p>
! 
! <p>
! Nico: <tt>emplace</tt> was a mistake, it breaks a uniform pattern designed into the STL.
! Hence, this fix is important, it should be the preferred way to do this.
! </p>
! 
! <p>
! JonW: <tt>emplace</tt> is still more efficient, as this form must make a non-elidable copy.
! </p>
! 
! <p>
! GeoffR: Also, cannot move from a <tt>const</tt> key, must always make a copy.
! </p>
! 
! <p>
! Poll for adopting the proposed wording:  
! <p/>
! SF: 1 WF: 4 N: 4 WA: 1 SA: 0 
! </p>
! 
! <p>
! Move to Ready, pending implementation experience.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Change 23.4.4.1 [map.overview], class template <tt>map</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! [&hellip;]
! pair&lt;iterator, bool&gt; insert(const value_type&amp; x);
! <ins>pair&lt;iterator, bool&gt; insert(value_type&amp;&amp; x);</ins>
! template &lt;class P&gt; pair&lt;iterator, bool&gt; insert(P&amp;&amp; x);
! iterator insert(const_iterator position, const value_type&amp; x);
! <ins>iterator insert(const_iterator position, value_type&amp;&amp; x);</ins>
! template &lt;class P&gt;
!   iterator insert(const_iterator position, P&amp;&amp;);
! [&hellip;]
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.4.5.1 [multimap.overview], class template <tt>multimap</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! [&hellip;]
! iterator insert(const value_type&amp; x);
! <ins>iterator insert(value_type&amp;&amp; x);</ins>
! template &lt;class P&gt; iterator insert(P&amp;&amp; x);
! iterator insert(const_iterator position, const value_type&amp; x);
! <ins>iterator insert(const_iterator position, value_type&amp;&amp; x);</ins>
! template &lt;class P&gt; iterator insert(const_iterator position, P&amp;&amp; x);
! [&hellip;]
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.4.1 [unord.map.overview], class template <tt>unordered_map</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! [&hellip;]
! pair&lt;iterator, bool&gt; insert(const value_type&amp; obj);
! <ins>pair&lt;iterator, bool&gt; insert(value_type&amp;&amp; obj);</ins>
! template &lt;class P&gt; pair&lt;iterator, bool&gt; insert(P&amp;&amp; obj);
! iterator insert(const_iterator hint, const value_type&amp; obj);
! <ins>iterator insert(const_iterator hint, value_type&amp;&amp; obj);</ins>
! template &lt;class P&gt; iterator insert(const_iterator hint, P&amp;&amp; obj);
! [&hellip;]
! </pre></blockquote>
! </li>
! 
! <li><p>Change 23.5.5.1 [unord.multimap.overview], class template <tt>unordered_multimap</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! [&hellip;]
! iterator insert(const value_type&amp; obj);
! <ins>iterator insert(value_type&amp;&amp; obj);</ins>
! template &lt;class P&gt; iterator insert(P&amp;&amp; obj);
! iterator insert(const_iterator hint, const value_type&amp; obj);
! <ins>iterator insert(const_iterator hint, value_type&amp;&amp; obj);</ins>
! template &lt;class P&gt; iterator insert(const_iterator hint, P&amp;&amp; obj);
! [&hellip;]
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2356"></a>2356. Stability of erasure in unordered associative containers</h3>
! <p><b>Section:</b> 23.2.5 [unord.req] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz <b>Opened:</b> 2014-01-21 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#unord.req">active issues</a> in [unord.req].</p>
! <p><b>View all other</b> <a href="lwg-index.html#unord.req">issues</a> in [unord.req].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Issue <a href="lwg-defects.html#518">518</a> resolution for unordered associative containers, modelled after that of issue <a href="lwg-defects.html#371">371</a>, 
! which is related to associative containers, states that insertion, erasure and rehashing preserve the relative ordering 
! of equivalent elements. Unfortunately, this is not sufficient to guarantee the validity of code such as this:
! </p>
! <blockquote><pre>
! std::unordered_multimap&lt;int, int&gt; m;
! auto i = m.begin();
! while (i != m.end()) {
!   if (pred(i))
!     m.erase(i++);
!   else
!     ++i;
! }
! </pre></blockquote>
! <p>
! (which is a direct translation from <tt>multimap</tt> to <tt>unordered_multimap</tt> of the motivating example in <a href="lwg-defects.html#371">371</a>), 
! or even this:
! </p>
! <blockquote><pre>
! std::unordered_multimap&lt;int, int&gt; m;
! auto p = m.equal_range(k);
! while (p.first != p.second) {
!   if (pred(p.first))
!     m.erase((p.first)++);
!   else
!     ++(p.first);
! }
! </pre></blockquote>
! <p>
! because the relative ordering of <em>non-equivalent</em> elements elements could potentially change after erasure (not that any actual 
! implementation does that, anyway). Such an underspecification does not happen for regular associative containers, where the 
! relative ordering of non-equivalent elements is kept by design.
! </p>
! 
! <p><i>[2014-02-13 Issaquah: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Modify 23.2.5 [unord.req], p14 as indicated:</p>
! 
! <blockquote><p>
! -14- The <tt>insert</tt> and <tt>emplace</tt> members shall not affect the validity of references to container elements, but may
! invalidate all iterators to the container. The <tt>erase</tt> members shall invalidate only iterators and references
! to the erased elements<ins>, and preserve the relative order of the elements that are not erased</ins>.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2357"></a>2357. Remaining "<tt>Assignable</tt>" requirement</h3>
! <p><b>Section:</b> 25.3.13 [alg.partitions] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2014-02-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.partitions">issues</a> in [alg.partitions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The <i>Requires</i> element of <tt>partition_copy</tt> says (emphasis mine):
! </p>
! <blockquote><p>
! <i>Requires</i>: <tt>InputIterator</tt>'s value type shall be <b><tt>Assignable</tt></b>, and &hellip;
! </p></blockquote>
! <p>
! The C++03 term <tt>Assignable</tt> was replaced by <tt>CopyAssignable</tt>, remaining cleanups happened via LWG issue
! <a href="lwg-closed.html#972">972</a>, but algorithm <tt>partition_copy</tt> was not affected at that time (during that time the requirements
! of <tt>partition_copy</tt> didn't mention writable nor assignable, but I cannot track down at the moment where these requirements
! had been added). Presumably this requirement should be corrected similarly to the approach used in <a href="lwg-closed.html#972">972</a>.
! <p/>
! Another question is whether a <tt>CopyAssignable</tt> is needed here, given the fact that we already require "writable to" an 
! <tt>OutputIterator</tt> which is defined in 24.2.1 [iterator.requirements.general] and does already impose the necessary
! statement
! </p>
! <blockquote><pre>
! *out = *in;
! </pre></blockquote>
! <p>
! Given the fact that <tt>partition_copy</tt> never touches any input value twice, there is no reason why anything more than
! <i>writable to</i> should be necessary.
! <p/>
! The below suggested primary resolution does not respond to the second part of this question.
! </p>
! 
! <p><i>[Issaquah 20014-10-11: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Modify 25.3.13 [alg.partitions], p12 as indicated:</p>
! 
! <blockquote><p>
! -12- <i>Requires</i>: <tt>InputIterator</tt>'s value type shall be <tt><ins>Copy</ins>Assignable</tt>, and shall be writable 
! to the <tt>out_true</tt> and <tt>out_false</tt> <tt>OutputIterator</tt>s, and shall be convertible to <tt>Predicate</tt>'s 
! argument type. The input range shall not overlap with either of the output ranges.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2359"></a>2359. How does <tt>regex_constants::nosubs</tt> affect <tt>basic_regex::mark_count()</tt>?</h3>
! <p><b>Section:</b> 28.5.1 [re.synopt] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-02-01 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#re.synopt">active issues</a> in [re.synopt].</p>
! <p><b>View all other</b> <a href="lwg-index.html#re.synopt">issues</a> in [re.synopt].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! As discussed in <a href="http://accu.org/cgi-bin/wg21/message?wg=lib&amp;msg=35399">c++std-lib-35399</a> and its replies, 
! I can see two possible interpretations of the effects of <tt>regex_constants::nosubs</tt>:
! </p>
! <ol style="list-style-type:decimal">
! <li><p>
! The effect of <tt>nosubs</tt> only applies during matching. Parentheses are
! still recognized as marking a sub-expression by the <tt>basic_regex</tt>
! compiler, and <tt>basic_regex::mark_count()</tt> still returns the number of
! marked sub-expressions, but anything they match is not stored in the
! results. This means it is not always true that <tt>results.size() == r.mark_count() + 1</tt> 
! for a successful match.
! </p></li>
! <li><p>
! <tt>nosubs</tt> affects how a regular expression is compiled, altering the
! state of the <tt>std::basic_regex</tt> object so that <tt>mark_count()</tt> returns
! zero. This also affects any subsequent matching.
! </p></li>
! </ol>
! <p>
! The definition of <tt>nosubs</tt> should make this clear.
! <p/>
! The wording in 28.5.1 [re.synopt]/1 seems to imply that <tt>nosubs</tt> only has
! effects during matching, which is (1), but all known implementations
! do (2). John Maddock confirmed that (2) was intended.
! </p>
! 
! <p><i>[Issaquah 2014-02-12: Move to Immediate]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Apply the following edit to the table in 28.5.1 [re.synopt]/1</p>
! 
! <blockquote><p>
! Specifies that <ins>no sub-expressions shall be considered to be
! marked, so that</ins> when a regular expression is matched against a character container
! sequence, no sub-expression matches shall be stored in the supplied
! <tt>match_results</tt> structure.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2360"></a>2360. <tt>reverse_iterator::operator*()</tt> is unimplementable</h3>
! <p><b>Section:</b> 24.5.1.1 [reverse.iterator] <b>Status:</b> <a href="lwg-active.html#C++14">C++14</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-02-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#reverse.iterator">issues</a> in [reverse.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#C++14">C++14</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Previously, C++03 24.4.1.3.3 [lib.reverse.iter.op.star] required:
! </p>
! <blockquote>
! <pre>
! reference operator*() const;
! </pre>
! <blockquote>
! <p>
! <i>Effects</i>: 
! </p>
! <blockquote><pre>
! Iterator tmp = current;
! return *--tmp;
! </pre></blockquote>
! </blockquote></blockquote>
! <p>
! Now, N3797 24.5.1.1 [reverse.iterator] depicts:
! </p>
! <blockquote><pre>
! private:
!   Iterator deref_tmp; // exposition only
! };
! </pre></blockquote>
! <p>
! And 24.5.1.3.4 [reverse.iter.op.star] requires:
! </p>
! <blockquote>
! <pre>
! reference operator*() const;
! </pre>
! <blockquote>
! <p>
! <i>Effects</i>: 
! </p>
! <blockquote><pre>
! deref_tmp = current;
! --deref_tmp;
! return *deref_tmp;
! </pre></blockquote>
! <p>
! [<i>Note</i>: This operation must use an auxiliary member variable rather than a temporary variable to avoid 
! returning a reference that persists beyond the lifetime of its associated iterator. (See 24.2.) &mdash; <i>end note</i>]
! </p>
! </blockquote></blockquote>
! 
! <p>
! As written, this won't compile, because <tt>operator*()</tt> is <tt>const</tt> yet it's modifying (via assignment and decrement) 
! the <tt>deref_tmp</tt> data member. So what happens if you say "<tt>mutable Iterator deref_tmp;</tt>"?
! <p/>
! DANGER: WARP CORE BREACH IMMINENT.
! <p/>
! The Standard requires <tt>const</tt> member functions to be callable from multiple threads simultaneously. This is 
! 17.6.5.9 [res.on.data.races]/3: "A C++ standard library function shall not directly or indirectly modify objects (1.10) 
! accessible by threads other than the current thread unless the objects are accessed directly or indirectly via the function's 
! non-const arguments, including <tt>this</tt>."
! <p/>
! Multiple threads simultaneously modifying <tt>deref_tmp</tt> will trigger data races, so both <tt>mutable</tt> and some form of 
! synchronization (e.g. <tt>mutex</tt> or <tt>atomic</tt>) are actually necessary!
! <p/>
! Here's what implementations currently do: Dinkumware/VC follows C++03 and doesn't use <tt>deref_tmp</tt> (attempting to 
! implement it is what led me to file this issue). According to Jonathan Wakely, libstdc++ also follows C++03 (see 
! <a href="http://gcc.gnu.org/PR51823">PR51823</a> which is suspended until LWG <a href="lwg-closed.html#2204">2204</a> is resolved). According to 
! Marshall Clow, libc++ uses <tt>deref_tmp</tt> with <tt>mutable</tt> but without synchronization, so it can trigger data races.
! <p/>
! This <tt>deref_tmp</tt> Standardese was added by LWG <a href="lwg-defects.html#198">198</a> "Validity of pointers and references unspecified after 
! iterator destruction" and is present in Working Papers going back to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1638.pdf">N1638</a> 
! on April 11, 2004, long before C++ recognized the existence of multithreading and developed the "<tt>const</tt> means simultaneously 
! readable" convention.
! <p/>
! A related issue is LWG <a href="lwg-active.html#1052">1052</a> "<tt>reverse_iterator::operator-&gt;</tt> should also support smart pointers" which 
! mentioned the need to depict <tt>mutable</tt> in the Standardese, but it was resolved NAD Future and no change was made.
! <p/>
! Finally, LWG <a href="lwg-closed.html#2204">2204</a> "<tt>reverse_iterator</tt> should not require a second copy of the base iterator" talked about 
! removing <tt>deref_tmp</tt>, but without considering multithreading.
! <p/>
! I argue that <tt>deref_tmp</tt> must be removed. Its existence has highly undesirable consequences: either no synchronization 
! is used, violating the Standard's usual multithreading guarantees, or synchronization is used, adding further costs for all 
! users that benefit almost no iterators.
! <p/>
! <tt>deref_tmp</tt> is attempting to handle iterators that return references to things "inside themselves", which I usually call 
! "stashing iterators" (as they have a secret stash). Note that these are very unusual, and are different from proxy iterators like 
! <tt>vector&lt;bool&gt;::iterator</tt>.  While <tt>vector&lt;bool&gt;::iterator</tt>'s <tt>operator*()</tt> does not return a true 
! reference, it refers to a bit that is unrelated to the iterator's lifetime.
! </p>
! 
! <p><i>[2014-02-14 Issaquah meeting: Move to Immediate]</i></p>
! 
! <p>
! Strike superfluous note to avoid potential confusion, and move to Immediate.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3797.</p>
! 
! <ol>
! <li><p>Change class template <tt>reverse_iterator</tt> synopsis, 24.5.1.1 [reverse.iterator], as indicated:</p>
! 
! <blockquote><pre>
! [&hellip;]
! protected:
!   Iterator current;
! <del>private:
!   Iterator deref_tmp; // exposition only</del>
! };
! </pre></blockquote>
! </li>
! 
! <li><p>Change 24.5.1.3.4 [reverse.iter.op.star] as indicated:</p>
! 
! <blockquote><pre>
! reference operator*() const;
! </pre>
! <blockquote>
! <p>
! -1- <i>Effects</i>:
! </p>
! <blockquote><pre>
! <del>deref_tmp = current;
! --deref_tmp;
! return *deref_tmp;</del>
! <ins>Iterator tmp = current;
! return *--tmp;</ins>
! </pre></blockquote>
! <p>
! <del>-2- [<i>Note</i>: This operation must use an auxiliary member variable rather than a temporary variable to
! avoid returning a reference that persists beyond the lifetime of its associated iterator. (See 24.2.) &mdash; <i>end note</i>]</del>
! </p>
! </blockquote></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2361"></a>2361. Apply 2299 resolution throughout library</h3>
! <p><b>Section:</b> 20.8.1.2 [unique.ptr.single], 20.7.3.1 [pointer.traits.types], 20.7.7.1 [allocator.uses.trait], 20.7.8.1 [allocator.traits.types], 23.2.3 [sequence.reqmts] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-02-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#unique.ptr.single">issues</a> in [unique.ptr.single].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! LWG <a href="lwg-defects.html#2299">2299</a> addressed a N.B. comment pointing out that recently added
! wording about a type existing was not clear what happens if the type
! exists but is inaccessible. There are 16 pre-existing uses of the same
! language in the library that should use the same wording used to
! resolve 2299.
! </p>
! 
! <p>
! The relevant paragraphs are:
! </p>
! 
! <p>
! 20.8.1.2 [unique.ptr.single]
! <p/>
! 20.7.3.1 [pointer.traits.types]
! <p/>
! 20.7.7.1 [allocator.uses.trait]
! <p/>
! 20.7.8.1 [allocator.traits.types]
! <p/>
! 23.2.3 [sequence.reqmts]
! </p>
! 
! <p><i>[2014-05-16, Daniel provides wording]</i></p>
! 
! 
! <p><i>[2014-05-18 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.7.3.1 [pointer.traits.types] as indicated:</p>
! 
! <blockquote>
! <pre>
! typedef <i>see below</i> element_type;
! </pre>
! <blockquote>
! <p>
! -1- <i>Type</i>: <tt>Ptr::element_type</tt> if <del>such a type exists</del><ins>the qualified-id <tt>Ptr::element_type</tt> is
! valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, <tt>T</tt> if <tt>Ptr</tt> is a class template instantiation
! of the form <tt>SomePointer&lt;T, Args&gt;</tt>, where <tt>Args</tt> is zero or more type arguments; otherwise, the
! specialization is ill-formed.
! </p>
! </blockquote>
! 
! <pre>
! typedef <i>see below</i> difference_type;
! </pre>
! <blockquote>
! <p>
! -2- <i>Type</i>: <tt>Ptr::difference_type</tt> if <del>such a type exists</del><ins>the qualified-id <tt>Ptr::difference_type</tt> is
! valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, <tt>std::ptrdiff_t</tt>.
! </p>
! </blockquote>
! 
! <pre>
! template &lt;class U&gt; using rebind = <i>see below</i>;
! </pre>
! <blockquote>
! <p>
! -3- <i>Alias template</i>: <tt>Ptr::rebind&lt;U&gt;</tt> if <del>such a type exists</del><ins>the qualified-id 
! <tt>Ptr::rebind&lt;U&gt;</tt> is valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>SomePointer&lt;U, Args&gt;</tt> if <tt>Ptr</tt> is a class template instantiation of the form <tt>SomePointer&lt;T, Args&gt;</tt>, 
! where <tt>Args</tt> is zero or more type arguments; otherwise, the instantiation of <tt>rebind</tt> is ill-formed.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 20.7.7.1 [allocator.uses.trait] p1 as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class T, class Alloc&gt; struct uses_allocator;
! </pre>
! <blockquote>
! <p>
! -1- <i>Remark<ins>s</ins></i>: automatically detects whether <tt>T</tt> has a nested <tt>allocator_type</tt> that is 
! convertible from <tt>Alloc</tt>. Meets the <tt>BinaryTypeTrait</tt> requirements (20.10.1). The implementation shall provide a definition
! that is derived from <tt>true_type</tt> if <del>a type</del><ins>the qualified-id</ins> <tt>T::allocator_type</tt> <del>exists</del><ins>is
! valid and denotes a type (14.8.2 [temp.deduct])</ins> and <tt>is_convertible&lt;Alloc, T::allocator_type&gt;::value != false</tt>, 
! otherwise it shall be derived from <tt>false_type</tt>. [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 20.7.8.1 [allocator.traits.types] as indicated:</p>
! 
! <blockquote>
! <pre>
! typedef <i>see below</i> pointer;
! </pre>
! <blockquote>
! <p>
! -1- <i>Type</i>: <tt>Alloc::pointer</tt> if <del>such a type exists</del><ins>the qualified-id <tt>Alloc::pointer</tt> is
! valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, <tt>value_type*</tt>.
! </p>
! </blockquote>
! 
! <pre>
! typedef <i>see below</i> const_pointer;
! </pre>
! <blockquote>
! <p>
! -2- <i>Type</i>: <tt>Alloc::const_pointer</tt> if <del>such a type exists</del><ins>the qualified-id <tt>Alloc::const_pointer</tt> is
! valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>pointer_traits&lt;pointer&gt;::rebind&lt;const value_type&gt;</tt>.
! </p>
! </blockquote>
! 
! <pre>
! typedef <i>see below</i> void_pointer;
! </pre>
! <blockquote>
! <p>
! -3- <i>Type</i>: <tt>Alloc::void_pointer</tt> if <del>such a type exists</del><ins>the qualified-id <tt>Alloc::void_pointer</tt> is
! valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>pointer_traits&lt;pointer&gt;::rebind&lt;void&gt;</tt>.
! </p>
! </blockquote>
! 
! <pre>
! typedef <i>see below</i> const_void_pointer;
! </pre>
! <blockquote>
! <p>
! -4- <i>Type</i>: <tt>Alloc::const_void_pointer</tt> if <del>such a type exists</del><ins>the qualified-id 
! <tt>Alloc::const_void_pointer</tt> is valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>pointer_traits&lt;pointer&gt;::rebind&lt;const void&gt;</tt>.
! </p>
! </blockquote>
! 
! <pre>
! typedef <i>see below</i> difference_type;
! </pre>
! <blockquote>
! <p>
! -5- <i>Type</i>: <tt>Alloc::difference_type</tt> if <del>such a type exists</del><ins>the qualified-id 
! <tt>Alloc::difference_type</tt> is valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>pointer_traits&lt;pointer&gt;::difference_type</tt>.
! </p>
! </blockquote>
! 
! <pre>
! typedef <i>see below</i> size_type;
! </pre>
! <blockquote>
! <p>
! -6- <i>Type</i>: <tt>Alloc::size_type</tt> if <del>such a type exists</del><ins>the qualified-id 
! <tt>Alloc::size_type</tt> is valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>make_unsigned_t&lt;difference_type&gt;</tt>.
! </p>
! </blockquote>
! 
! <pre>
! typedef <i>see below</i> propagate_on_container_copy_assignment;
! </pre>
! <blockquote>
! <p>
! -7- <i>Type</i>: <tt>Alloc::propagate_on_container_copy_assignment</tt> if <del>such a type exists</del><ins>the qualified-id 
! <tt>Alloc::propagate_on_container_copy_assignment</tt> is valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>false_type</tt>.
! </p>
! </blockquote>
! 
! <pre>
! typedef <i>see below</i> propagate_on_container_move_assignment;
! </pre>
! <blockquote>
! <p>
! -8- <i>Type</i>: <tt>Alloc::propagate_on_container_move_assignment</tt> if <del>such a type exists</del><ins>the qualified-id 
! <tt>Alloc::propagate_on_container_move_assignment</tt> is valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>false_type</tt>.
! </p>
! </blockquote>
! 
! <pre>
! typedef <i>see below</i> propagate_on_container_swap;
! </pre>
! <blockquote>
! <p>
! -9- <i>Type</i>: <tt>Alloc::propagate_on_container_swap</tt> if <del>such a type exists</del><ins>the qualified-id 
! <tt>Alloc::propagate_on_container_swap</tt> is valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>false_type</tt>.
! </p>
! </blockquote>
! 
! <pre>
! template &lt;class T&gt; using rebind_alloc = <i>see below</i>;
! </pre>
! <blockquote>
! <p>
! -10- <i>Alias template</i>: <tt>Alloc::rebind&lt;T&gt;::other</tt> if <del>such a type exists</del><ins>the qualified-id 
! <tt>Alloc::rebind&lt;T&gt;::other</tt> is valid and denotes a type (14.8.2 [temp.deduct])</ins>; otherwise, 
! <tt>Alloc&lt;T, Args&gt;</tt> if <tt>Alloc</tt> is a class template instantiation of the form <tt>Alloc&lt;U, Args&gt;</tt>, 
! where <tt>Args</tt> is zero or more type arguments; otherwise, the instantiation of <tt>rebind_alloc</tt> is ill-formed.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 20.8.1.2 [unique.ptr.single] p3 as indicated:</p>
! 
! <blockquote><p>
! -3- If the <del>type</del><ins>qualified-id</ins> <tt>remove_reference_t&lt;D&gt;::pointer</tt> <del>exists</del><ins>is 
! valid and denotes a type (14.8.2 [temp.deduct])</ins>, then <tt>unique_ptr&lt;T, D&gt;::pointer</tt> shall be a synonym
! for <tt>remove_reference_t&lt;D&gt;::pointer</tt>. [&hellip;]
! </p></blockquote>
! </li>
! 
! <li><p>Change 23.2.3 [sequence.reqmts] p3 as indicated:</p>
! 
! <blockquote><p>
! -3- In Tables 100 and 101, <tt>X</tt> denotes a sequence container class, <tt>a</tt> denotes a value of <tt>X</tt> containing elements
! of type <tt>T</tt>, <tt>A</tt> denotes <tt>X::allocator_type</tt> if <del>it exists</del><ins>the qualified-id 
! <tt>X::allocator_type</tt> is valid and denotes a type (14.8.2 [temp.deduct])</ins> and <tt>std::allocator&lt;T&gt;</tt> 
! if it doesn't, [&hellip;]
! </p></blockquote>
! </li>
! 
! 
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2364"></a>2364. <tt>deque</tt> and <tt>vector</tt> <tt>pop_back</tt> don't specify iterator invalidation requirements</h3>
! <p><b>Section:</b> 23.3.3.4 [deque.modifiers], 23.3.6.5 [vector.modifiers] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Deskin Miller <b>Opened:</b> 2014-02-17 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#deque.modifiers">issues</a> in [deque.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I think it's obvious that <tt>vector::pop_back</tt> invalidates the path-the-end iterator, but I cannot find language that says so to 
! my satisfaction in the Standard. N3797 23.2.3 [sequence.reqmts] Table 101 lists <tt>a.pop_back()</tt> semantics as "Destroys the 
! last element", but nowhere do I see this required to invalidate the end iterator (or iterators previously referring to the last element). 
!  [container.reqmts.general]/11 states "Unless otherwise specified (either explicitly or by defining a function in terms of 
! other functions), invoking a container member function or passing a container as an argument to a library function shall not 
! invalidate iterators to, or change the values of, objects within that container." 23.3.6.5 [vector.modifiers]/3 says that each 
! flavor of <tt>vector::erase</tt> "Invalidates iterators and references at or after the point of the erase", but <tt>pop_back</tt> isn't 
! discussed, and it wasn't specified in terms of <tt>erase</tt>.
! </p>
! <p>
! Similarly for <tt>std::deque</tt>, 23.2.3 [sequence.reqmts] Table 101 and  [container.reqmts.general]/11 both apply. 
! Yet 23.3.3.4 [deque.modifiers] likewise doesn't discuss <tt>pop_back</tt> nor <tt>pop_front</tt>. Furthermore paragraph 4 fails to 
! specify the iterator-invalidation guarantees when erasing the first element but not the last.
! <p/>
! Both <tt>std::vector</tt> and <tt>std::deque</tt> are in contrast to <tt>std::list</tt>, which says in 23.3.5.4 [list.modifiers]/3 
! regarding <tt>pop_back</tt> (as well as all forms of <tt>erase</tt>, <tt>pop_front</tt>, and <tt>clear</tt>) "Effects: Invalidates only 
! the iterators and references to the erased elements."
! </p>
! 
! <p><i>[2014-06-16 Jonathan comments and improves wording]</i></p>
! 
! 
! <p>
! I believe this reflects our preferred form discussed earlier,
! specifically putting the signatures with the <tt>erase</tt> signatures, so that
! the full specification of <tt>erase()</tt> applies to the <tt>pop_xxx()</tt> functions.
! This covers the case for <tt>deque</tt> where <tt>pop_front()</tt> erases the only
! element (which is both the first and last element).
! <p/>
! Open question: the "erase" wording talks about "An erase operation" &mdash;
! are <tt>pop_front</tt> and <tt>pop_back</tt> clearly covered by "erase operations"? I
! believe so, as 23.3.3.1 [deque.overview]/1 and other places talk about "insert
! and erase operations" which covers <tt>push</tt>/<tt>pop</tt> functions too. I've added
! a note which could be used to clarify that if desired.
! </p>
! 
! <strong>Previous resolution [SUPERSEDED]:</strong>
! <p/>
! <blockquote class="note">
! <p>This wording is relative to N3936.</p> 
! 
! <ol>
! <li><p>Change 23.3.3.4 [deque.modifiers] as indicated:</p>
! 
! <blockquote>
! <pre>
! iterator erase(const_iterator position);
! iterator erase(const_iterator first, const_iterator last);
! </pre>
! <blockquote><p>
! -4- <i>Effects</i>: An erase operation that erases the last element of a deque invalidates only the past-the-end
! iterator and all iterators and references to the erased elements. An erase operation that erases the first
! element of a deque but not the last element invalidates only <ins>iterators and references to</ins> the erased elements. 
! An erase operation that erases neither the first element nor the last element of a deque invalidates the past-the-end iterator
! and all iterators and references to all the elements of the deque.
! <p/>
! -5- [&hellip;]
! <p/>
! -6- [&hellip;]
! </p>
! </blockquote>
! 
! <pre>
! <ins>void pop_front();
! void pop_back();</ins>
! </pre>
! <blockquote><p>
! <ins>-?- <i>Effects</i>: <tt>pop_front</tt> invalidates iterators and references to the first element of the <tt>deque</tt>. 
! <tt>pop_back</tt> invalidates the past-the-end iterator, and all iterators and references to the last element of the <tt>deque</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 23.3.6.5 [vector.modifiers] as indicated:</p>
! <blockquote>
! <blockquote>
! <p>
! -5- [&hellip;]
! </p>
! </blockquote>
! 
! <pre>
! <ins>void pop_back();</ins>
! </pre>
! <blockquote><p>
! <ins>-?- <i>Effects</i>: Invalidates the past-the-end iterator, and iterators and references to the last element of the vector.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2014-06-21 Rapperswil]</i></p>
! 
! <p>
! Tony van Eerd: Would be good to define "an erase operation is ..." somewhere.
! <p/>
! AM: The containers clause is known to be suboptimal in many ways.
! <p/>
! Looks good 
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 23.3.3.4 [deque.modifiers] as indicated:</p>
! 
! <blockquote>
! <pre>
! iterator erase(const_iterator position);
! iterator erase(const_iterator first, const_iterator last);
! <ins>void pop_front();
! void pop_back();</ins>
! </pre>
! <blockquote><p>
! -4- <i>Effects</i>: An erase operation that erases the last element of a deque invalidates only the past-the-end
! iterator and all iterators and references to the erased elements. An erase operation that erases the first
! element of a deque but not the last element invalidates only <ins>iterators and references to</ins> the erased elements. 
! An erase operation that erases neither the first element nor the last element of a deque invalidates the past-the-end iterator
! and all iterators and references to all the elements of the deque. <ins>[<i>Note</i>: <tt>pop_front</tt> and <tt>pop_back</tt> 
! are erase operations &mdash; <i>end note</i>]</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 23.3.6.5 [vector.modifiers] as indicated:</p>
! <blockquote>
! <pre>
! iterator erase(const_iterator position);
! iterator erase(const_iterator first, const_iterator last);
! <ins>void pop_back();</ins>
! </pre>
! <blockquote><p>
! -3- <i>Effects</i>: Invalidates iterators and references at or after the point of the erase.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2365"></a>2365. Missing <tt>noexcept</tt> in <tt>shared_ptr::shared_ptr(nullptr_t)</tt></h3>
! <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Cassio Neri <b>Opened:</b> 2014-02-13 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The declaration and definition of <tt>shared_ptr::shared_ptr(nullptr_t)</tt>, given in 20.8.2.2 [util.smartptr.shared], is 
! </p>
! <blockquote><pre>
! constexpr shared_ptr(nullptr_t) : shared_ptr() { }
! </pre></blockquote>
! <p>
! The intention seems clear: this constructor should have the same semantics of the default constructor. However, contrarily to the 
! default constructor, this one is not <tt>noexcept</tt>. In contrast, <tt>unique_ptr::unique_ptr(nullptr_t)</tt> is <tt>noexcept</tt>, 
! as per 20.8.1.2 [unique.ptr.single]: 
! </p>
! <blockquote><pre>
! constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { }
! </pre></blockquote>
! <p>
! Both libstdc++ and libc++ have added <tt>noexcept</tt> to <tt>shared_ptr::shared_ptr(nullptr_t)</tt>. Microsoft's STL has not.
! </p>
! 
! <p><i>[2014-03-26 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change class template <tt>shared_ptr</tt> synopsis, 20.8.2.2 [util.smartptr.shared], as indicated:</p>
! 
! <blockquote>
! <pre>
! constexpr shared_ptr(nullptr_t) <ins>noexcept</ins> : shared_ptr() { }
! </pre>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2369"></a>2369. <tt>constexpr max(initializer_list)</tt> vs <tt>max_element</tt></h3>
! <p><b>Section:</b> 25.4.7 [alg.min.max] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Marc Glisse <b>Opened:</b> 2014-02-21 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.min.max">issues</a> in [alg.min.max].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! As part of the resolution for LWG issue <a href="lwg-defects.html#2350">2350</a>, <tt>max(initializer_list)</tt> was marked as <tt>constexpr</tt>. Looking 
! at two implementations of this function (libstdc++ and libc++), both implement it in terms of <tt>max_element</tt>, which is <em>not</em> 
! marked as <tt>constexpr</tt>. This is inconsistent and forces some small amount of code duplication in the implementation. Unless we 
! remove <tt>constexpr</tt> from this overload of <tt>max</tt>, I believe we should add <tt>constexpr</tt> to <tt>max_element</tt>.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! AM: Can we implement this with the C++14 <tt>constexpr</tt> rules? JM: Yes. AM: Ready? [Yes]
! <p/>
! Accepted.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>In 25.1 [algorithms.general], header <tt>&lt;algorithm&gt;</tt> synopsis, and 25.4.7 [alg.min.max], change as 
! indicated (add <tt>constexpr</tt> to every signature from the first <tt>min_element</tt> to the second <tt>minmax_element</tt>)::</p>
! 
! <blockquote>
! <pre>
! template&lt;class ForwardIterator&gt;
! <ins>constexpr</ins> ForwardIterator min_element(ForwardIterator first, ForwardIterator last);
! template&lt;class ForwardIterator, class Compare&gt;
! <ins>constexpr</ins> ForwardIterator min_element(ForwardIterator first, ForwardIterator last,
!                                       Compare comp);
! [&hellip;]
! template&lt;class ForwardIterator&gt;
! <ins>constexpr</ins> ForwardIterator max_element(ForwardIterator first, ForwardIterator last);
! template&lt;class ForwardIterator, class Compare&gt;
! <ins>constexpr</ins> ForwardIterator max_element(ForwardIterator first, ForwardIterator last,
!                                       Compare comp);
! [&hellip;]
! template&lt;class ForwardIterator&gt;
! <ins>constexpr</ins> pair&lt;ForwardIterator, ForwardIterator&gt;
! minmax_element(ForwardIterator first, ForwardIterator last);
! template&lt;class ForwardIterator, class Compare&gt;
! <ins>constexpr</ins> pair&lt;ForwardIterator, ForwardIterator&gt;
! minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
! </pre>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2371"></a>2371. [fund.ts] No template aliases defined for new type traits</h3>
! <p><b>Section:</b> 20.10.2 [meta.type.synop] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2014-03-07 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! The library fundamentals specification defines two new type trait template classes: <tt>invocation_type</tt> and <tt>raw_invocation_type</tt>.  
! But it does not define the corresponding template aliases. Note that both of these classes define a member typedef <tt>type</tt> and no 
! other public members, so according to the argument in <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3887.pdf">N3887</a> 
! the template aliases should be defined.
! </p>
! 
! <p><i>[2013-06-21 Rapperswil]</i></p>
! 
! <p>
! Accept for Library Fundamentals TS Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html">N3908</a>.</p>
! 
! <ol>
! <li><p>Add the following to section 3.3.1[meta.type.synop] of the 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html#meta">Library Fundamentals specification</a>
! as indicated:
! </p>
! 
! <blockquote><pre>
! namespace std {
! namespace experimental {
! inline namespace fundamentals_v1 {
!   [&hellip;]
!   <i>// 3.3.2, Other type transformations</i>
!   template &lt;class&gt; class invocation_type; <i>// not defined</i>
!   template &lt;class F, class... ArgTypes&gt; class invocation_type&lt;F(ArgTypes...)&gt;;
!   template &lt;class&gt; class raw_invocation_type; <i>// not defined</i>
!   template &lt;class F, class... ArgTypes&gt; class raw_invocation_type&lt;F(ArgTypes...)&gt;;
!   
!   <ins>template &lt;class T&gt; 
!     using invocation_type_t = typename invocation_type&lt;T&gt;::type;
!   template &lt;class T&gt; 
!     using raw_invocation_type_t = typename raw_invocation_type&lt;T&gt;::type;</ins>
!   
! } <i>// namespace fundamentals_v1</i>
! } <i>// namespace experimental</i>
! } <i>// namespace std</i>
! </pre></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2374"></a>2374. [fund.ts] Remarks for <tt>optional::to_value</tt> are too restrictive</h3>
! <p><b>Section:</b> X [optional.object.observe] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-03-25 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! In Bristol I think I claimed that the remarks for <tt>optional::to_value()</tt>
! were unimplementable and the function could only be <tt>constexpr</tt> if both
! constructors that could be called were <tt>constexpr</tt>, but I was wrong.
! The remarks should be reverted to the original pre-n3793 form.
! </p>
! 
! <p><i>[2013-06-21 Rapperswil]</i></p>
! 
! <p>
! Accept for Library Fundamentals TS Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html">N3908</a>.</p>
! 
! <ol>
! <li><p>Change [optional.object.observe] p23 of the 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html#optional.object.observe">Library Fundamentals specification</a>
! as indicated:
! </p>
! 
! <blockquote><pre>
! template &lt;class U&gt; constexpr T value_or(U&amp;&amp; v) const &amp;;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -23- <i>Remarks</i>: If <del>both constructors of <tt>T</tt> which could be selected are <tt>constexpr</tt> constructors</del><ins>the 
! selected constructor of <tt>T</tt> is a <tt>constexpr</tt> constructor</ins>, this function 
! shall be a <tt>constexpr</tt> function. 
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2376"></a>2376. <tt>bad_weak_ptr::what()</tt> overspecified</h3>
! <p><b>Section:</b> 20.8.2.1 [util.smartptr.weakptr] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-03-27 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 20.8.2.1 [util.smartptr.weakptr] p2 requires <tt>bad_weak_ptr</tt> to return precisely
! the string <tt>"bad_weak_ptr"</tt>.
! <p/>
! There was general agreement on the reflector and at the Issaquah
! meeting that this is over-constrained and implementation should be
! free to return something more descriptive if desired.
! <p/>
! The proposed resolution makes <tt>bad_weak_ptr</tt> consistent with other
! exception types such as <tt>bad_alloc</tt> and <tt>bad_cast</tt>.
! <p/>
! If accepted, the P/R for issue <a href="lwg-defects.html#2233">2233</a>, which currently uses similar
! wording to <tt>bad_weak_ptr</tt>, could be updated appropriately.
! </p>
! 
! <p><i>[2014-03-27 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Edit 20.8.2.1 [util.smartptr.weakptr]:</p>
! 
! <blockquote>
! <pre>
! bad_weak_ptr() noexcept;
! </pre><blockquote>
! <p>
! -2- <i>Postconditions</i>: <tt>what()</tt> returns <del><tt>"bad_weak_ptr"</tt></del><ins>an implementation-defined NTBS</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2377"></a>2377. <tt>std::align</tt> requirements overly strict</h3>
! <p><b>Section:</b> 20.7.5 [ptr.align] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2014-03-30 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#ptr.align">issues</a> in [ptr.align].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>std::align</tt> requires that its <tt>alignment</tt> argument shall be "a fundamental alignment value or an 
! extended alignment value supported by the implementation in this context".
! <p/>
! This requirement is overly strict. There are use cases that require a buffer aligned at values that are not tied 
! to the C++ implementation, such as page size, cache line size, sector size. These come from the hardware or the 
! OS and are generally not known until run time. The implementation of <tt>std::align</tt> does not depend on the 
! requirement that <tt>alignment</tt> be a fundamental or an extended alignment value; any power of two would be handled 
! the same way.
! <p/>
! In addition, it is not possible for the user to even determine whether a value is "a fundamental alignment value 
! or an extended alignment value supported by the implementation in this context". One would expect values coming 
! from <tt>alignof</tt> to be fine, but I'm not sure whether even that is guaranteed in the presence of <tt>alignas</tt>.
! <p/>
! Therefore, I propose that
! </p>
! <blockquote><p>
! <i>Requires</i>:
! </p>
! <ul>
! <li><p><tt>alignment</tt> shall be a fundamental alignment value or an extended alignment value supported by
! the implementation in this context</p></li>
! </ul>
! </blockquote>
! <p>
! be changed to
! </p>
! <blockquote><p>
! <i>Requires</i>:
! </p>
! <ul>
! <li><p><tt>alignment</tt> shall be a power of two</p></li>
! </ul>
! </blockquote>
! 
! <p><i>[2014-06-16 Rapperswil]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Edit 20.7.5 [ptr.align] p2 as indicated:</p>
! 
! <blockquote>
! <pre>
! void* align(std::size_t alignment, std::size_t size,
!   void*&amp; ptr, std::size_t&amp; space);
! </pre><blockquote>
! <p>
! -1- [&hellip;]
! <p/>
! -2- <i>Requires</i>:
! </p>
! <ul>
! <li><p>
! <tt>alignment</tt> shall be a <del>fundamental alignment value or an extended alignment value supported by
! the implementation in this context</del><ins>power of two</ins>
! </p></li>
! </ul>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2378"></a>2378. Behaviour of standard exception types</h3>
! <p><b>Section:</b> 18.6.2.1 [bad.alloc], 18.6.2.2 [new.badlength], 18.7.2 [bad.cast], 18.7.3 [bad.typeid], 18.8.2 [bad.exception] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Andy Sawyer <b>Opened:</b> 2014-03-31 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! I think we have an issue with the specification of some of the standard exception types. 
! In particular, several of them have default constructors with remarks to the effect that 
! "The result of calling <tt>what()</tt> on the newly constructed object is implementation-defined". 
! (In some cases this is contradictory to a further specification of <tt>what()</tt>, which 
! is specified to return an implementation-defined NTBS.)
! </p>
! 
! <p>
! <strong>Previous resolution from Andy [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Edit 18.6.2.1 [bad.alloc] p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! bad_alloc() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -3- <i>Remarks</i>: <del>The result of calling <tt>what()</tt> on the newly constructed object is 
!   implementation-defined</del><ins><tt>what()</tt> returns an implementation-defined NTBS</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 18.6.2.2 [new.badlength] p3 as indicated: [<i>Drafting note</i>: Added the Postcondition, since we don't 
! say anything else about <tt>bad_array_new_length::what()</tt> &mdash; <i>end of note</i>]</p>
! 
! <blockquote>
! <pre>
! bad_array_new_length() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! -3- <i><del>Remarks</del><ins>Postcondition</ins></i>: <del>The result of calling <tt>what()</tt> on the newly constructed object is 
!   implementation-defined</del><ins><tt>what()</tt> returns an implementation-defined NTBS</ins>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 18.7.2 [bad.cast] p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! bad_cast() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-3- <i>Remarks</i>: The result of calling <tt>what()</tt> on the newly constructed object is implementation-defined.</del>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 18.7.3 [bad.typeid] p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! bad_typeid() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-3- <i>Remarks</i>: The result of calling <tt>what()</tt> on the newly constructed object is implementation-defined.</del>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 18.8.2 [bad.exception] p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! bad_exception() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-3- <i>Remarks</i>: The result of calling <tt>what()</tt> on the newly constructed object is implementation-defined.</del>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2014-06-17, Rapperswil]</i></p>
! 
! <p>
! Jonathan provides alternative wording.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! NJ: I don't know why we need the explict statement about <tt>what()</tt> here, since <tt>bad_array_new_length</tt> 
! already derives.<br/> 
! AM: yes.<br/> 
! NJ: Then "what()" is missing from the synopsis.<br/> 
! AM: Yes, that's an error and it needs to be added.
! <p/>
! Conclusion: Update the wording to add the missing entry in the synopsis. 
! <p/>
! AM: The issue needs another update; we need to add missing "Remarks". DK updates the paper.<br/> 
! AM: Any objections to "tentatively ready"? No objections. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Edit 18.6.2.1 [bad.alloc] p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! bad_alloc() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-3- <i>Remarks</i>: The result of calling <tt>what()</tt> on the newly constructed object is 
!   implementation-defined.</del>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 18.6.2.1 [bad.alloc] p5 as indicated:</p>
! 
! <blockquote>
! <pre>
! virtual const char* what() const noexcept;
! </pre>
! <blockquote>
! <p>
! -5- <i>Returns</i>: An implementation-defined NTBS.
! <p/>
! <ins>-?- <i>Remarks</i>: The message may be a null-terminated multibyte string (17.5.2.1.4.2), suitable for conversion
! and display as a <tt>wstring</tt> (21.3, 22.4.1.4).</ins>
! </p>
! </blockquote>
! </blockquote>
! 
! </li>
! 
! <li><p>Edit class <tt>bad_array_new_length</tt> synopsis 18.6.2.2 [new.badlength] as indicated:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   class bad_array_new_length : public bad_alloc {
!   public:
!     bad_array_new_length() noexcept;
!     <ins>virtual const char* what() const noexcept;</ins>
!   };
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Edit 18.6.2.2 [new.badlength] as indicated:</p>
! 
! <blockquote>
! <pre>
! bad_array_new_length() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-3- <i>Remarks</i>: The result of calling <tt>what()</tt> on the newly constructed object is 
!   implementation-defined.</del>
! </p>
! </blockquote>
! <pre>
! <ins>virtual const char* what() const noexcept;</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Returns</i>: An implementation-defined NTBS.</ins>
! <p/>
! <ins>-?- <i>Remarks</i>: The message may be a null-terminated multibyte string (17.5.2.1.4.2), suitable for conversion
! and display as a <tt>wstring</tt> (21.3, 22.4.1.4).</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 18.7.2 [bad.cast] p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! bad_cast() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-3- <i>Remarks</i>: The result of calling <tt>what()</tt> on the newly constructed object is implementation-defined.</del>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 18.7.3 [bad.typeid] p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! bad_typeid() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-3- <i>Remarks</i>: The result of calling <tt>what()</tt> on the newly constructed object is implementation-defined.</del>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Edit 18.8.2 [bad.exception] p3 as indicated:</p>
! 
! <blockquote>
! <pre>
! bad_exception() noexcept;
! </pre><blockquote>
! <p>
! [&hellip;]
! <p/>
! <del>-3- <i>Remarks</i>: The result of calling <tt>what()</tt> on the newly constructed object is implementation-defined.</del>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2387"></a>2387. More nested types that must be accessible and unambiguous</h3>
! <p><b>Section:</b> 20.9.2 [func.require], 20.9.4 [refwrap] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-05-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.require">active issues</a> in [func.require].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.require">issues</a> in [func.require].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Further to <a href="lwg-defects.html#2299">2299</a> and <a href="lwg-defects.html#2361">2361</a>, 20.9.2 [func.require] p3 and 20.9.4 [refwrap] p3 and p4
! talk about member types without any mention of being accessible and unambiguous.
! </p>
! 
! <p><i>[2014-06-05 Daniel provides wording]</i></p>
! 
! 
! <p><i>[2014-06-06 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.9.2 [func.require] p3 as indicated:</p>
! 
! <blockquote><p>
! -3- If a call wrapper (20.9.1) has a <i>weak result type</i> the type of its member type <tt>result_type</tt> is based on the
! type <tt>T</tt> of the wrapper's target object (20.9.1):
! </p>
! <ul>
! <li><p>if <tt>T</tt> is a pointer to function type, <tt>result_type</tt> shall be a synonym for the return type of <tt>T</tt>;</p></li>
! <li><p>if <tt>T</tt> is a pointer to member function, <tt>result_type</tt> shall be a synonym for the return type of <tt>T</tt>;</p></li>
! <li><p>if <tt>T</tt> is a class type <ins>and the qualified-id <tt>T::result_type</tt> is valid and denotes a type 
! (14.8.2 [temp.deduct])</ins><del>with a member type <tt>result_type</tt></del>, then <tt>result_type</tt> shall be a synonym for
! <tt>T::result_type</tt>;</p></li> 
! <li><p>otherwise <tt>result_type</tt> shall not be defined.</p></li>
! </ul>
! </blockquote>
! </li>
! 
! <li><p>Change 20.9.4 [refwrap] p3+p4 as indicated:</p>
! 
! <blockquote>
! <p>
! -3- The template instantiation <tt>reference_wrapper&lt;T&gt;</tt> shall define a nested type named <tt>argument_type</tt> as a
! synonym for <tt>T1</tt> only if the type <tt>T</tt> is any of the following:
! </p>
! <ul>
! <li><p>a function type or a pointer to function type taking one argument of type <tt>T1</tt></p></li>
! <li><p>a pointer to member function <tt>R T0::f</tt> <i>cv</i> (where  <i>cv</i> represents the member function_s cv-qualifiers);
! the type <tt>T1</tt> is <i>cv</i> <tt>T0*</tt></p></li> 
! <li><p>a class type <ins>where the qualified-id <tt>T::argument_type</tt> is valid and denotes a type 
! (14.8.2 [temp.deduct])</ins><del>with a member type <tt>argument_type</tt></del>; the type <tt>T1</tt> is 
! <tt>T::argument_type</tt>.</p></li>
! </ul>
! <p>
! -4- The template instantiation <tt>reference_wrapper&lt;T&gt;</tt> shall define two nested types named <tt>first_argument_type</tt> 
! and <tt>second_argument_type</tt> as synonyms for <tt>T1</tt> and <tt>T2</tt>, respectively, only if the type <tt>T</tt> is any of the
! following:
! </p>
! <ul>
! <li><p>a function type or a pointer to function type taking two arguments of types <tt>T1</tt> and <tt>T2</tt></p></li>
! <li><p>a pointer to member function <tt>R T0::f(T2)</tt> <i>cv</i> (where <i>cv</i> represents the member function's cv-qualifiers);
! the type <tt>T1</tt> is <i>cv</i> <tt>T0*</tt></p></li> 
! <li><p>a class type <ins>where the qualified-ids <tt>T::first_argument_type</tt> and <tt>T::second_argument_type</tt> are both valid 
! and both denote types (14.8.2 [temp.deduct])</ins><del>with member types <tt>first_argument_type</tt> and 
! <tt>second_argument_type</tt></del>; the type <tt>T1</tt> is <tt>T::first_argument_type</tt><del>.</del> and the type <tt>T2</tt> is 
! <tt>T::second_argument_type</tt>.</p></li>
! </ul>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2389"></a>2389. [fund.ts] <tt>function::operator=</tt> is over-specified and handles allocators incorrectly</h3>
! <p><b>Section:</b> X [mods.func.wrap] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2014-05-23 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#mods.func.wrap">issues</a> in [mods.func.wrap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! This issue against the TS is similar to LWG <a href="lwg-closed.html#2386">2386</a>, which is against the standard. The Effects clauses for the assignment 
! operator for class template <tt>function</tt> are written as code that constructs a temporary <tt>function</tt> and then swaps it 
! with <tt>*this</tt>. 
! The intention appears to be that assignment should have the strong exception guarantee, i.e., <tt>*this</tt> is not modified if 
! an exception is thrown. The description in the standard is incorrect when <tt>*this</tt> was originally constructed using an 
! allocator. The TS attempts to correct the problem, but the correction is incomplete.
! <p/>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html#mods.func.wrap">The wording in the TS</a> uses 
! <tt>get_memory_resource()</tt> to construct a temporary <tt>function</tt> object with the same allocator as the left-hand size 
! (lhs) of the assignment. The intended result of using this pattern was that the allocator for <tt>*this</tt> would be unchanged, 
! but it doesn't quite work. The problem is that the allocator returned by <tt>get_memory_resource()</tt> is not the same type as 
! the type-erased allocator used to construct the <tt>function</tt> object, but rather a type-erased distillation of that type that 
! is insufficient for making a true copy of the allocator. The rules for type-erased allocators in the TS 
! (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html#memory.type.erased.allocator">[memory.type.erased.allocator]</a>) 
! specify that the lifetime of the object returned by <tt>get_memory_resource()</tt> is sometimes tied to the lifetime of <tt>*this</tt>, 
! which might cause the (single copy of) the allocator to be destroyed if the <tt>swap</tt> operation destroys and reconstructs <tt>*this</tt>, 
! as some implementations do (and are allowed to do).
! <p/>
! The desired behavior is that assignment would leave the allocator of the lhs unchanged. The way to achieve this behavior is to 
! construct the temporary <tt>function</tt> using the original allocator. Unfortunately, we cannot describe the desired behavior in 
! pure code, because <tt>get_memory_resource()</tt> does not really name the type-erased allocator, as mentioned above. The PR below, 
! therefore, uses pseudo-code, inventing a fictitious <tt><i>ALLOCATOR_OF</i>(f)</tt> expression that evaluates to the actual allocator 
! type, even if that allocator was type erased. I have implemented this PR successfully.
! </p>
! 
! <p><i>[2014-06-21, Rapperswil]</i></p>
! 
! <p>
! Apply to Library Fundamentals TS (after removing the previous "Throws: Nothing" element to prevent an editorial conflict with
! <a href="lwg-defects.html#2401">2401</a>).
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html">N3908</a>.</p>
! 
! <ol>
! <li><p>Change in [mods.func.wrap] in the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html#mods.func.wrap">Library TS</a> 
! as indicated:
! </p>
! <blockquote>
! <p>
! <ins>In the following descriptions, let <tt><i>ALLOCATOR_OF</i>(f)</tt> be the allocator specified in the construction of <tt>function</tt> 
! <tt>f</tt>, or <tt>allocator&lt;char&gt;()</tt> if no allocator was specified.</ins>
! </p>
! <pre>
! function&amp; operator=(const function&amp; f);
! </pre>
! <blockquote>
! <p>
! -5- <i>Effects</i>: <tt>function(allocator_arg, <del>get_memory_resource()</del><ins><i>ALLOCATOR_OF</i>(*this)</ins>, f).swap(*this);</tt>
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! function&amp; operator=(function&amp;&amp; f);
! </pre>
! <blockquote>
! <p>
! -8- <i>Effects</i>: <tt>function(allocator_arg, <del>get_memory_resource()</del><ins><i>ALLOCATOR_OF</i>(*this)</ins>, std::move(f)).swap(*this);</tt>
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! function&amp; operator=(nullptr_t);
! </pre>
! <blockquote>
! <p>
! -11- <i>Effects</i>: If <tt>*this != NULL</tt>, destroys the target of <tt>this</tt>.
! <p/>
! -12- <i>Postconditions</i>: <tt>!(*this)</tt>. <ins>The memory resource returned by <tt>get_memory_resource()</tt> after the assignment 
! is equivalent to the memory resource before the assignment. [<i>Note</i>: the address returned by <tt>get_memory_resource()</tt> 
! might change &mdash; <i>end note</i>]</ins>
! <p/>
! -13- <i>Returns</i>: <tt>*this</tt>  
! </p>
! </blockquote>
! <pre>
! template&lt;class F&gt; function&amp; operator=(F&amp;&amp; f);
! </pre>
! <blockquote>
! <p>
! -15- <i>Effects</i>: <tt>function(allocator_arg, <del>get_memory_resource()</del><ins><i>ALLOCATOR_OF</i>(*this)</ins>, 
! std::forward&lt;F&gt;(f)).swap(*this);</tt>
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! <pre>
! template&lt;class F&gt; function&amp; operator=(reference_wrapper&lt;F&gt; f);
! </pre>
! <blockquote>
! <p>
! -18- <i>Effects</i>: <tt>function(allocator_arg, <del>get_memory_resource()</del><ins><i>ALLOCATOR_OF</i>(*this)</ins>, f).swap(*this);</tt>
! <p/>
! [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2390"></a>2390. [fund.ts] Invocation types and rvalues</h3>
! <p><b>Section:</b> X [mods.func.wrap] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Michael Spertus <b>Opened:</b> 2014-05-26 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#mods.func.wrap">issues</a> in [mods.func.wrap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! <tt>invocation_type</tt> falls short of its stated goals in the following case. Using the notation of 
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3866.html">Invocation type traits</a>, 
! consider
! </p>
! <blockquote>
! <pre>
! void f(int const&amp; i);
! more_perfect_forwarding_async(f, int(7)); // Oops. Dangling reference because rvalue gone when async runs
! </pre>
! </blockquote>
! <p>
! This was always the advertised intent of the proposal, but while the language reflects this for the first parameter in the 
! case of a member pointer, it failed to include corresponding language for other parameters.
! </p>
! 
! <p><i>[2014-06-18, Rapperswil]</i></p>
! 
! <p>
! Mike Spertus, Richard Smith, Jonathan Wakely, and Jeffrey Yasskin suggest improved wording.
! </p>
! 
! <strong>Previous resolution [SUPERSEDED]:</strong>
! <p/>
! <blockquote class="note">
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html">N3908</a>.</p>
! 
! <ol>
! <li><p>Change Table 3, [meta.trans.other] in the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3908.html#meta.trans.other">Library TS</a> 
! as indicated:
! </p>
! <blockquote>
! <table border="1">
! <caption>Table 3 &mdash; Other type transformations</caption>
! <tr>
! <th align="center">Template</th>
! <th align="center">Condition</th>
! <th align="center">Comments</th>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class Fn, class... ArgTypes&gt;<br/>
! struct invocation_type&lt;Fn(ArgTypes...)&gt;;</tt>
! </td>
! <td>
! <tt>Fn</tt> and all types in the parameter pack <tt>ArgTypes</tt><br/>
! shall be complete types, (possibly <i>cv</i>-qualified) <tt>void</tt>,<br/> 
! or arrays of unknown bound. 
! </td>
! <td>
! If <ins><tt>A1, A2,...</tt> denotes <tt>ArgTypes...</tt> and</ins><br/> 
! <tt>raw_invocation_type&lt;Fn(ArgTypes...)&gt;::type</tt><br/> 
! is the function type <tt>R(T1, T2, ...)</tt> <ins>then let <tt>Ui</tt> be<br/> 
! <tt>decay&lt;Ai&gt;::type</tt> if <tt>Ai</tt> is an rvalue otherwise <tt>Ti</tt>.<br/> 
! If</ins> <del>and</del> <tt>Fn</tt> is a pointer to member type and <tt>T1</tt> is<br/>
! an rvalue reference, then <ins>let <tt>U1</tt> be</ins> <tt><del>R(</del>decay&lt;T1&gt;::type<del>,<br/> 
! T2, ...)</del></tt>.<br/> 
! <del>Otherwise, <tt>raw_invocation_type&lt;Fn(ArgTypes...)&gt;::type</tt></del><br/>
! <ins>The member typedef <tt>type</tt> shall equal <tt>R(U1, U2, ...)</tt></ins>.
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2013-06-21 Rapperswil]</i></p>
! 
! <p>
! Accept for Fundamentals TS Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4023.html">N4023</a>.</p>
! 
! <ol>
! <li><p>Change Table 3, [meta.trans.other] in the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4023.html#meta.trans.other">Library TS</a> 
! as indicated:
! </p>
! <blockquote>
! <table border="1">
! <caption>Table 3 &mdash; Other type transformations</caption>
! <tr>
! <th align="center">Template</th>
! <th align="center">Condition</th>
! <th align="center">Comments</th>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class Fn, class... ArgTypes&gt;<br/>
! struct invocation_type&lt;Fn(ArgTypes...)&gt;;</tt>
! </td>
! <td>
! <tt>Fn</tt> and all types in the parameter pack <tt>ArgTypes</tt><br/>
! shall be complete types, (possibly <i>cv</i>-qualified) <tt>void</tt>,<br/> 
! or arrays of unknown bound. 
! </td>
! <td>
! <ins>
! The nested typedef <tt>invocation_type&lt;Fn(ArgTypes...)&gt;::type</tt><br/> 
! shall be defined as follows. If<br/>
! <tt>raw_invocation_type&lt;Fn(ArgTypes...)&gt;::type</tt><br/> 
! does not exist, there shall be no member typedef <tt>type</tt>. Otherwise:<br/>
! <ul>
! <li><p><ins>Let <tt>A1, A2,</tt> &hellip; denote <tt>ArgTypes...</tt></ins></p></li>
! <li><p><ins>Let <tt>R(T1, T2, &hellip;)</tt> denote<br/>
! <tt>raw_invocation_type_t&lt;Fn(ArgTypes...)&gt;</tt></ins></p></li>
! <li><p><ins>Then the member typedef <tt>type</tt> shall name the function<br/>
! type <tt>R(U1, U2, &hellip;)</tt> where <tt>Ui</tt> is <tt>decay_t&lt;Ai&gt;</tt><br/> 
! if <tt>declval&lt;Ai&gt;()</tt> is an rvalue otherwise <tt>Ti</tt>.</ins></p></li>
! </ul>
! </ins>
! <del>If <tt>raw_invocation_type&lt;Fn(ArgTypes...)&gt;::type</tt><br/> 
! is the function type <tt>R(T1, T2, &hellip;)</tt> <br/> 
! and <tt>Fn</tt> is a pointer to member type and <tt>T1</tt> is<br/>
! an rvalue reference, then <tt>R(decay&lt;T1&gt;::type,<br/> 
! T2, &hellip;)</tt>.<br/> 
! Otherwise, <tt>raw_invocation_type&lt;Fn(ArgTypes...)&gt;::type</tt>.<br/></del>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2395"></a>2395. [fund.ts] <i>Preconditions:</i> is defined nowhere</h3>
! <p><b>Section:</b> X [mods.func.wrap], X [memory.resource.priv], X [memory.polymorphic.allocator.ctor], X [memory.polymorphic.allocator.mem], X [memory.resource.pool.ctor], X [memory.resource.monotonic.buffer.ctor] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Zhihao Yuan <b>Opened:</b> 2014-06-09 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#mods.func.wrap">issues</a> in [mods.func.wrap].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! 
! <p>
! This element has been introduced by <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3916.pdf">N3916</a>, 
! but the standard does not define it. The standard defines <i>Requires:</i> to indicate a precondition 
! (17.5.1.4 [structure.specifications] p3).
! <p/>
! <em>Proposed wording</em>:
! <p/>
! Substitute all <i>Preconditions:</i> with <i>Requires:</i>.
! </p>
! 
! <p><i>[2013-06-21 Rapperswil]</i></p>
! 
! <p>
! Accept for Fundamentals TS Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4023.html">N4023</a>.</p>
! 
! <ol>
! <li><p>Substitute all <i>Preconditions:</i> with <i>Requires:</i>.</p></li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2396"></a>2396. <tt>underlying_type</tt> doesn't say what to do for an incomplete enumeration type</h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-06-12 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Consider:
! </p>
! <blockquote><pre>
! enum E {
!   e = std::underlying_type&lt;E&gt;::type(1)
! };
! </pre></blockquote>
! <p>
! Clearly this should be ill-formed, but the library section doesn't appear to ban it. Suggestion:
! <p/>
! Change in 20.10.7.6 [meta.trans.other] Table 57:
! </p>
! <blockquote>
! <p>
! Template: <tt>template&lt;class T&gt; struct underlying_type;</tt>
! <p/>
! Condition: <tt>T</tt> shall be <ins>a complete</ins> <del>an</del> enumeration type (7.2)
! <p/>
! Comments: [&hellip;]
! </p>
! </blockquote>
! 
! <p><i>[2014-06-16 Rapperswil]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change Table 57 &mdash; "Other transformations" as indicated:</p></li>
! 
! <blockquote>
! <table border="1">
! <caption>Table 3 &mdash; Other type transformations</caption>
! <tr>
! <th align="center">Template</th>
! <th align="center">Condition</th>
! <th align="center">Comments</th>
! </tr>
! 
! <tr>
! <td colspan="3" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>template &lt;class T&gt;<br/>
! struct underlying_type;</tt>
! </td>
! <td>
! T shall be <ins>a complete</ins> <del>an</del> enumeration type (7.2)
! </td>
! <td align="center">
! [&hellip;]
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2397"></a>2397. <tt>map&lt;K, V&gt;::emplace</tt> and explicit <tt>V</tt> constructors</h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Peter Dimov <b>Opened:</b> 2014-06-12 <b>Last modified:</b> 2015-05-05</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Please consider the following example:
! </p>
! <blockquote><pre>
! #include &lt;map&gt;
! #include &lt;atomic&gt;
! 
! int main()
! {
!    std::map&lt;int, std::atomic&lt;int&gt;&gt; map_;
! 
!    map_.emplace(1, 0);  // <span style="color:#C80000;font-weight:bold">fail</span>
!    map_.emplace(1);     // <span style="color:#C80000;font-weight:bold">fail</span>
!    map_.emplace(1, {}); // <span style="color:#C80000;font-weight:bold">fail</span>
! 
!    map_.emplace(std::piecewise_construct,
!        std::tuple&lt;int&gt;(1), std::tuple&lt;>()); // <span style="color:#006600;font-weight:bold">OK</span>
! }
! </pre></blockquote>
! <p>
! The first three calls represent attempts by an ordinary programmer (in which role I appear today) to construct 
! a map element. Since <tt>std::atomic&lt;int&gt;</tt> is non-copyable and immovable, I was naturally drawn to 
! <tt>emplace()</tt> because it constructs in-place and hence doesn't need to copy or move. The logic behind the 
! attempts was that <tt>K=int</tt> would be constructed from '<tt>1</tt>', and <tt>V=std::atomic&lt;int&gt;</tt> would be 
! (directly) constructed by '<tt>0</tt>', default constructed, or constructed by '<tt>{}</tt>'.
! <p/>
! Yet none of the obvious attempts worked.
! <p/>
! I submit that at least two of the three ought to have worked, and that we have therefore a defect in either 
! <tt>map::emplace</tt> or <tt>pair</tt>.
! <p/>
! Ville:
! <p/>
! There exists a related <a href="http://cplusplus.github.io/EWG/ewg-toc.html#114">EWG issue</a> for this.
! <p/>
! Daniel:
! <p/>
! If the proposal N4387 would be accepted, it would solve the first problem mentioned above.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! AM: I think Peter's expectation is misguided that the second and third "//fail" cases should work.<br/> 
! DK: Howard's paper [note: which hasn't been written yet] will make the second case work... AM: ...but 
! the third one will never work without core changes.
! <p/>
! Case 1 is solved by DK's paper, cases 2 and 3 are not defects; at best they are extensions. 
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! STL: think this is covered with N4387<br/>
! MC: this was accepted in Cologne<br/>
! STL: only want to fix the first emplace<br/>
! MC: leave alone and mark as closed by N4387<br/>
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! Resolved by acceptance of <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4387.html">N4387</a>.
! </p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2399"></a>2399. <tt>shared_ptr</tt>'s constructor from <tt>unique_ptr</tt> should be constrained</h3>
! <p><b>Section:</b> 20.8.2.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Consider the following code:
! </p>
! <blockquote><pre>
! #include &lt;iostream&gt;
! #include &lt;memory&gt;
! #include &lt;string&gt;
! 
! using namespace std;
! 
! void meow(const shared_ptr&lt;int&gt;&amp; sp) {
!   cout &lt;&lt; "int: " &lt;&lt; *sp &lt;&lt; endl;
! }
! 
! void meow(const shared_ptr&lt;string&gt;&amp; sp) {
!   cout &lt;&lt; "string: " &lt;&lt; *sp &lt;&lt; endl;
! }
! 
! int main() {
!   meow(make_unique&lt;int&gt;(1729));
!   meow(make_unique&lt;string&gt;("kitty"));
! }
! </pre></blockquote>
! <p>
! This fails to compile due to ambiguous overload resolution, but we can easily make this work. (Note: <tt>shared_ptr</tt>'s 
! constructor from <tt>auto_ptr</tt> is also affected, but I believe that it's time to remove <tt>auto_ptr</tt> completely.)
! </p>
! 
! <p><i>[2014-06-16 Rapperswil]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.8.2.2.1 [util.smartptr.shared.const] around p33 as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class Y, class D&gt; shared_ptr(unique_ptr&lt;Y, D&gt;&amp;&amp; r);
! </pre>
! <p>
! <ins>-?- <i>Remark</i>: This constructor shall not participate in overload resolution unless <tt>unique_ptr&lt;Y, D&gt;::pointer</tt> 
! is convertible to <tt>T*</tt>.</ins>
! <p/>
! -33- <i>Effects</i>: Equivalent to <tt>shared_ptr(r.release(), r.get_deleter())</tt> when <tt>D</tt> is not a reference type,
! otherwise <tt>shared_ptr(r.release(), ref(r.get_deleter()))</tt>.
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2400"></a>2400. <tt>shared_ptr</tt>'s <tt>get_deleter()</tt> should use <tt>addressof()</tt></h3>
! <p><b>Section:</b> 20.8.2.2.10 [util.smartptr.getdeleter] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.getdeleter">issues</a> in [util.smartptr.getdeleter].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The Standard Library should consistently use <tt>addressof()</tt> to defend itself against overloaded <tt>operator&amp;()</tt>.
! <p/>
! While we're in the neighbourhood, we should editorially change <tt>0</tt> to <tt>nullptr</tt>.
! </p>
! 
! <p><i>[2014-06-16 Rapperswil]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.8.2.2.10 [util.smartptr.getdeleter] as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class D, class T&gt; get_deleter(const shared_ptr&lt;T&gt;&amp; p) noexcept;
! </pre>
! <p>
! -1- <i>Returns</i>: If <tt>p</tt> owns a deleter <tt>d</tt> of type cv-unqualified <tt>D</tt>, returns 
! <tt><del>&amp;</del><ins>std::addressof(</ins>d<ins>)</ins></tt>; 
! otherwise returns <tt><del>0</del><ins>nullptr</ins></tt>. [&hellip;]
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2401"></a>2401. <tt>std::function</tt> needs more <tt>noexcept</tt></h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! There are two issues here:
! </p>
! <ol>
! <li><p><tt>std::function</tt>'s constructor from <tt>nullptr_t</tt> is marked as <tt>noexcept</tt>, but its assignment operator 
! from <tt>nullptr_t</tt> isn't. This assignment can and should be marked as <tt>noexcept</tt>.</p></li>
! <li><p><tt>std::function</tt>'s comparisons with <tt>nullptr_t</tt> are marked as <tt>noexcept</tt> in two out of three places.</p></li>
! </ol>
! 
! <p><i>[2014-06-16 Rapperswil]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.9 [function.objects] p2, header <tt>&lt;functional&gt;</tt> synopsis, as indicated:</p>
! 
! <blockquote>
! <pre>
! namespace std {
!   [&hellip;]
!   <i>// 20.9.11 polymorphic function wrappers:</i>
!   [&hellip;]
!   template&lt;class R, class... ArgTypes&gt;
!   bool operator==(const function&lt;R(ArgTypes...)&gt;&amp;, nullptr_t) <ins>noexcept</ins>;
!   template&lt;class R, class... ArgTypes&gt;
!   bool operator==(nullptr_t, const function&lt;R(ArgTypes...)&gt;&amp;) <ins>noexcept</ins>;
!   template&lt;class R, class... ArgTypes&gt;
!   bool operator!=(const function&lt;R(ArgTypes...)&gt;&amp;, nullptr_t) <ins>noexcept</ins>;
!   template&lt;class R, class... ArgTypes&gt;
!   bool operator!=(nullptr_t, const function&lt;R(ArgTypes...)&gt;&amp;) <ins>noexcept</ins>;
!   [&hellip;]
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Change 20.9.12.2 [func.wrap.func], class template <tt>function</tt> synopsis, as indicated:</p>
! 
! <blockquote>
! <pre>
! [&hellip;]
! <i>// 20.9.11.2.1, construct/copy/destroy:</i>
! [&hellip;]
! function&amp; operator=(nullptr_t) <ins>noexcept</ins>;
! [&hellip;]
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Change 20.9.12.2.1 [func.wrap.func.con] before p16 as indicated:</p>
! 
! <blockquote>
! <pre>
! function&amp; operator=(nullptr_t) <ins>noexcept</ins>;
! </pre>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2403"></a>2403. <tt>stof()</tt> should call <tt>strtof()</tt> and <tt>wcstof()</tt></h3>
! <p><b>Section:</b> 21.5 [string.conversions] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#string.conversions">issues</a> in [string.conversions].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>stof()</tt> is currently specified to call <tt>strtod()</tt>/<tt>wcstod()</tt> (which converts the given string to 
! <tt>double</tt>) and then it's specified to convert that <tt>double</tt> to <tt>float</tt>. This performs rounding twice, 
! which introduces error. Here's an example written up by James McNellis:
! <p/>
! Consider the following number <tt>X</tt>:
! </p>
! <blockquote>
! <pre>
! 1.999999821186065729339276231257827021181583404541015625 (X)
! </pre>
! </blockquote>
! <p>
! This number is exactly representable in binary as:
! </p>
! <blockquote>
! <pre>
! 1.111111111111111111111101000000000000000000000000000001
! * ^1st                  ^23rd                        ^52nd
! </pre>
! </blockquote>
! <p>
! I've marked the 23rd and 52nd fractional bits. These are the least significant bits for <tt>float</tt> and <tt>double</tt>, 
! respectively.
! <p/>
! If we convert this number directly to <tt>float</tt>, we take the 23 most significant bits:
! </p>
! <blockquote>
! <pre>
! 1.11111111111111111111110
! </pre>
! </blockquote>
! <p>
! The next bit is a one and the tail is nonzero (the 54th fractional bit is a one), so we round up. This gives us the correctly 
! rounded result:
! </p>
! <blockquote>
! <pre>
! 1.11111111111111111111111
! </pre>
! </blockquote>
! <p>
! So far so good. But... If we convert <tt>X</tt> to <tt>double</tt>, we take the 52 most significant bits:
! </p>
! <blockquote>
! <pre>
! 1.1111111111111111111111010000000000000000000000000000 (Y)
! </pre>
! </blockquote>
! <p>
! The next bit is a zero, so we round down (truncating the value). If we then convert <tt>Y</tt> to <tt>float</tt>, we take 
! its 23 most significant bits:
! </p>
! <blockquote>
! <pre>
! 1.11111111111111111111110
! </pre>
! </blockquote>
! <p>
! The next bit is a one and the tail is zero, so we round to even (leaving the value unchanged). This is off by 1ulp from the 
! correctly rounded result.
! </p>
! 
! <p><i>[2014-06 Rapperswil]</i></p>
! 
! <p>
! Marshall Clow will look at this.
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 21.5 [string.conversions] p4+p6 as indicated:</p>
! 
! <blockquote>
! <pre>
! float stof(const string&amp; str, size_t* idx = 0);
! double stod(const string&amp; str, size_t* idx = 0);
! long double stold(const string&amp; str, size_t* idx = 0);
! </pre>
! <blockquote>
! <p>
! -4- <i>Effects</i>: <del>the first two</del><ins>These</ins> functions call <ins><tt>strtof(str.c_str(), ptr)</tt>,</ins> 
! <tt>strtod(str.c_str(), ptr)</tt><ins>,</ins> and <del>the third function calls</del> <tt>strtold(str.c_str(), ptr)</tt><ins>, 
! respectively</ins>. Each function returns the converted result, if any. [&hellip;]
! <p/>
! [&hellip;]
! <p/>
! -6- <i>Throws</i>: <tt>invalid_argument</tt> if <ins><tt>strtof</tt>,</ins> <tt>strtod</tt><ins>,</ins> or <tt>strtold</tt> reports 
! that no conversion could be performed. Throws <tt>out_of_range</tt> if <ins><tt>strtof</tt>,</ins> <tt>strtod</tt><ins>,</ins> or 
! <tt>strtold</tt> sets <tt>errno</tt> to <tt>ERANGE</tt> or if the converted value is outside the range of representable 
! values for the return type.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 21.5 [string.conversions] p11+p13 as indicated:</p>
! 
! <blockquote>
! <pre>
! float stof(const wstring&amp; str, size_t* idx = 0);
! double stod(const wstring&amp; str, size_t* idx = 0);
! long double stold(const wstring&amp; str, size_t* idx = 0);
! </pre>
! <blockquote>
! <p>
! -11- <i>Effects</i>: <del>the first two</del><ins>These</ins> functions call <ins><tt>wcstof(str.c_str(), ptr)</tt>,</ins> 
! <tt>wcstod(str.c_str(), ptr)</tt><ins>,</ins> and <del>the third function calls</del> <tt>wcstold(str.c_str(), ptr)</tt><ins>, 
! respectively</ins>. Each function returns the converted result, if any. [&hellip;]
! <p/>
! [&hellip;]
! <p/>
! -13- <i>Throws</i>: <tt>invalid_argument</tt> if <ins><tt>wcstof</tt>,</ins> <tt>wcstod</tt><ins>,</ins> or <tt>wcstold</tt> 
! reports that no conversion could be performed. Throws <tt>out_of_range</tt> if <ins><tt>wcstof</tt>,</ins> <tt>wcstod</tt><ins>,</ins> 
! or <tt>wcstold</tt> sets <tt>errno</tt> to <tt>ERANGE</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2404"></a>2404. <tt>mismatch()</tt>'s complexity needs to be updated</h3>
! <p><b>Section:</b> 25.2.10 [mismatch] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3671.html">N3671</a> updated the complexities of 
! <tt>equal()</tt> and <tt>is_permutation()</tt>, but not <tt>mismatch()</tt>.
! </p>
! 
! <p><i>[2014-06-16 Rapperswil]</i></p>
! 
! <p>
! Move to Ready
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 25.2.10 [mismatch] p3 as indicated:</p>
! 
! <blockquote>
! <p>
! -3- <i>Complexity</i>: At most <tt><ins>min(</ins>last1 - first1<ins>, last2 - first2)</ins></tt> applications of the 
! corresponding predicate.
! </p>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2406"></a>2406. <tt>negative_binomial_distribution</tt> should reject <tt>p == 1</tt></h3>
! <p><b>Section:</b> 26.5.8.3.4 [rand.dist.bern.negbin] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 26.5.8.3.4 [rand.dist.bern.negbin] p2 requires "<tt>0 &lt; p &lt;= 1</tt>". Consider what happens when <tt>p == 1</tt>.  
! The discrete probability function specified by p1 involves "<tt>* p^k * (1 - p)^i</tt>". For <tt>p == 1</tt>, this is 
! "<tt>* 1^k * 0^i</tt>", so every integer <tt>i &gt;= 0</tt> is produced with zero probability. (Let's avoid thinking about 
! <tt>0^0</tt>.)
! <p/>
! <a href="http://en.wikipedia.org/wiki/Negative_binomial_distribution">Wikipedia</a> states that <tt>p</tt> must be within 
! <tt>(0, 1)</tt>, exclusive on both sides.
! </p>
! 
! <strong>Previous resolution [SUPERSEDED]:</strong>
! <blockquote class="note">
! <ol>
! <li><p>Change 26.5.8.3.4 [rand.dist.bern.negbin] p2 as indicated: [<i>Drafting note</i>: This should be read as: Replace the 
! symbol "<tt>&le;</tt>" by "<tt>&lt;</tt>" &mdash; <i>end drafting note</i>]</p>
! 
! <blockquote>
! <pre>
! explicit negative_binomial_distribution(IntType k = 1, double p = 0.5);
! </pre>
! <blockquote>
! <p>
! -2- <i>Requires</i>: <tt>0 &lt; p <del>&le;</del><ins>&lt;</ins> 1</tt> and <tt>0 &lt; k</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2014-11 Urbana]</i></p>
! 
! <p>
! SG6 suggests better wording.
! </p>
! 
! <p><i>[2014-11-08 Urbana]</i></p>
! 
! <p>
! Moved to Ready with the node.
! </p>
! <p>
! There remains concern that the constructors are permitting
! values that may (or may not) be strictly outside the domain
! of the function, but that is a concern that affects the
! design of the random number facility as a whole, and should
! be addressed by a paper reviewing and addressing the whole
! clause, not picked up in the issues list one distribution
! at a time.  It is still not clear that such a paper would be
! uncontroversial.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4140.</p>
! 
! <ol>
! <li><p>Add a note after paragraph 1 before the synopsis in 26.5.8.3.4 [rand.dist.bern.negbin]:</p>
! 
! <blockquote>
! <p>
! A <tt>negative_binomial_distribution</tt> random number distribution produces random integers 
! <math xmlns="http://www.w3.org/1998/Math/MathML">
! <mi>i</mi><mo>&ge;</mo><mn>0</mn>
! </math>
! distributed according to the discrete probability function
! </p>
! <blockquote>
! <p>
! <math xmlns="http://www.w3.org/1998/Math/MathML">
! <mi>P</mi><mrow><mo>(</mo><mi>i</mi><mo>|</mo><mi>k</mi><mo>,</mo><mi>p</mi><mo>)</mo></mrow>
! <mo>=</mo>
! <mrow>
! <mfenced>
! <mfrac linethickness="0">
! <mrow><mi>k</mi> <mo>+</mo> <mi>i</mi> <mo>-</mo> <mn>1</mn></mrow>
! <mi>i</mi>
! </mfrac>
! </mfenced>
! <mo>&middot;</mo>
! <msup>
! <mi>p</mi>
! <mi>k</mi>
! </msup>
! <mo>&middot;</mo>
! <msup>
! <mrow><mo>(</mo><mn>1</mn><mo>-</mo><mi>p</mi><mo>)</mo></mrow>
! <mi>i</mi>
! </msup>
! </mrow>
! </math>
! .
! </p>
! </blockquote>
! <p>
! <ins>[<i>Note</i>: This implies that <math xmlns="http://www.w3.org/1998/Math/MathML">
! <mi>P</mi><mrow><mo>(</mo><mi>i</mi><mo>|</mo><mi>k</mi><mo>,</mo><mi>p</mi><mo>)</mo></mrow> 
! </math> is undefined when <tt>p == 1</tt>. &mdash; <i>end note</i>]</ins>
! </p>
! </blockquote>
! <blockquote class="note">
! <p>
! <i>Drafting note</i>: <math xmlns="http://www.w3.org/1998/Math/MathML">
! <mi>P</mi><mrow><mo>(</mo><mi>i</mi><mo>|</mo><mi>k</mi><mo>,</mo><mi>p</mi><mo>)</mo></mrow> 
! </math> should be in math font, and <tt>p == 1</tt> should be in code font.
! </p>
! </blockquote>
! 
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2407"></a>2407. <tt>packaged_task(allocator_arg_t, const Allocator&amp;, F&amp;&amp;)</tt> should neither be constrained nor 
! <tt>explicit</tt></h3>
! <p><b>Section:</b> 30.6.9.1 [futures.task.members] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-06-14 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#futures.task.members">issues</a> in [futures.task.members].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! LWG <a href="lwg-defects.html#2097">2097</a>'s resolution was slightly too aggressive. It constrained 
! <tt>packaged_task(allocator_arg_t, const Allocator&amp;, F&amp;&amp;)</tt>, but that's unnecessary because 
! <tt>packaged_task</tt> doesn't have any other three-argument constructors. Additionally, it's marked as 
! <tt>explicit</tt> (going back to WP N2798 when <tt>packaged_task</tt> first appeared) which is unnecessary.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! Back to LWG; not an SG1 issue.
! </p>
! 
! <p><i>[2015-05 Lenexa]</i></p>
! 
! <p>
! STL improves proposed wording by restoring the constraint again.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 30.6.9 [futures.task] p2, class template <tt>packaged_task</tt> as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class F&gt;
! explicit packaged_task(F&amp;&amp; f);
! template &lt;class F, class Allocator&gt;
! <del>explicit</del> packaged_task(allocator_arg_t, const Allocator&amp; a, F&amp;&amp; f);
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Change 30.6.9.1 [futures.task.members] as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class F&gt;
! packaged_task(F&amp;&amp; f);
! template &lt;class F, class Allocator&gt;
! <del>explicit</del> packaged_task(allocator_arg_t, const Allocator&amp; a, F&amp;&amp; f);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -3- <i>Remarks</i>: These constructors shall not participate in overload resolution if <tt>decay_t&lt;F&gt;</tt> 
! is the same type as <tt>std::packaged_task&lt;R(ArgTypes...)&gt;</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2408"></a>2408. SFINAE-friendly <tt>common_type/iterator_traits</tt> is missing in C++14</h3>
! <p><b>Section:</b> 20.10.7.6 [meta.trans.other], 24.4.1 [iterator.traits] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2014-06-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View other</b> <a href="lwg-index-open.html#meta.trans.other">active issues</a> in [meta.trans.other].</p>
! <p><b>View all other</b> <a href="lwg-index.html#meta.trans.other">issues</a> in [meta.trans.other].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! During the Rapperswil meeting the proposal <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4041.html">N4041</a>
! had been discussed and there seemed to be strong consensus to apply the SFINAE-friendly definitions
! that currently exist within the fundamentals-ts to the C++ Standard working draft. This issue requests this change to happen.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.10.7.6 [meta.trans.other] p3 as indicated:</p>
! 
! <blockquote>
! <p>
! -3- <ins>For the <tt>common_type</tt> trait applied to a parameter pack <tt>T</tt> of types, 
! the member <tt>type</tt> shall be either defined or not present as follows:</ins>
! <ul>
! <li><p><ins>If <tt>sizeof...(T)</tt> is zero, there shall be no member <tt>type</tt>.</ins></p></li>
! <li><p><ins>If <tt>sizeof...(T)</tt> is one, let <tt>T0</tt> denote the sole type comprising <tt>T</tt>. 
! The member typedef <tt>type</tt> shall denote the same type as <tt>decay_t&lt;T0&gt;</tt>.</ins></p></li>
! <li><p><ins>If <tt>sizeof...(T)</tt> is greater than one, let <tt>T1</tt>, <tt>T2</tt>, and <tt>R</tt>, 
! respectively, denote the first, second, and (pack of) remaining types comprising <tt>T</tt>. 
! [<i>Note</i>: <tt>sizeof...(R)</tt> may be zero. &mdash; <i>end note</i>] Finally, let <tt>C</tt> denote 
! the type, if any, of an unevaluated conditional expression (5.16 [expr.cond]) whose first operand is an arbitrary value 
! of type <tt>bool</tt>, whose second operand is an xvalue of type <tt>T1</tt>, and whose third operand is 
! an xvalue of type <tt>T2</tt>. If there is such a type <tt>C</tt>, the member typedef <tt>type</tt> shall 
! denote the same type, if any, as <tt>common_type_t&lt;C,R...&gt;</tt>. Otherwise, there shall be no member 
! <tt>type</tt>.</ins></p></li>
! </ul>
! <del>The nested typedef <tt>common_type::type</tt> shall be defined as follows:</del>
! </p>
! <blockquote>
! <pre>
! <del>template &lt;class ...T&gt; struct common_type;
! 
! template &lt;class T&gt;
! struct common_type&lt;T&gt; {
!   typedef decay_t&lt;T&gt; type;
! };
! 
! template &lt;class T, class U&gt;
! struct common_type&lt;T, U&gt; {
!   typedef decay_t&lt;decltype(true ? declval&lt;T&gt;() : declval&lt;U&gt;())&gt; type;
! };
! 
! template &lt;class T, class U, class... V&gt;
! struct common_type&lt;T, U, V...&gt; {
!   typedef common_type_t&lt;common_type_t&lt;T, U&gt;, V...&gt; type;
! };</del>
! </pre>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 24.4.1 [iterator.traits] p2 as indicated:</p>
! 
! <blockquote>
! <p>
! -2- The template <tt>iterator_traits&lt;Iterator&gt;</tt> <del>is defined as</del><ins>shall have 
! the following as publicly accessible members, and have no other members, if and only if 
! <tt>Iterator</tt> has valid (14.8.2 [temp.deduct]) member types <tt>difference_type</tt>, 
! <tt>value_type</tt>, <tt>pointer</tt>, <tt>reference</tt>, and <tt>iterator_category</tt>; otherwise, 
! the template shall have no members:</ins>
! </p>
! <blockquote>
! <pre>
! <del>namespace std {
!   template&lt;class Iterator&gt; struct iterator_traits {</del>
!     typedef typename Iterator::difference_type difference_type;
!     typedef typename Iterator::value_type value_type;
!     typedef typename Iterator::pointer pointer;
!     typedef typename Iterator::reference reference;
!     typedef typename Iterator::iterator_category iterator_category;
!   <del>};
! }</del>
! </pre>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2409"></a>2409. [fund.ts] SFINAE-friendly <tt>common_type/iterator_traits</tt> should be removed from the fundamental-ts</h3>
! <p><b>Section:</b> X [mods.meta.trans.other], X [mods.iterator.traits] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2014-06-19 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! <p>
! During the Rapperswil meeting the proposal <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4041.html">N4041</a>
! had been discussed and there seemed to be strong consensus to apply the SFINAE-friendly definitions
! that currently exist within the fundamentals-ts to the C++17 working draft. If this happens, the fundamentals-ts 
! needs to remove its own specification regarding these templates. This issue requests this change to happen.
! </p>
! 
! <p><i>[2013-06-21 Rapperswil]</i></p>
! 
! <p>
! Accept for Fundamentals TS Working Paper
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4023 in regard to fundamental-ts changes.</p>
! 
! <ol>
! <li><p>In fundamental-ts, change Table 2 &mdash; "Significant features in this technical specification" as
! indicated:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 2 &mdash; Significant features in this technical specification</caption>
! <tr>
! <th align="center">Doc.<br/>No.</th>
! <th align="center">Title</th>
! <th align="center">Primary<br/>Section</th>
! <th align="center">Macro Name Suffix</th>
! <th align="center">Value</th>
! <th align="center">Header</th>
! </tr>
! 
! <tr>
! <td colspan="6" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <del>N3843</del><br/>
! </td>
! <td>
! <del>A SFINAE-<br/>Friendly<br/><tt>common_type</tt></del>
! </td>
! <td>
! <del>2.4 [mods.meta.trans.other]</del><br/>
! </td>
! <td>
! <del><tt>common_type_sfinae</tt></del>
! </td>
! <td>
! <del><tt>201402</tt></del>
! </td>
! <td>
! <del><tt>&lt;type_traits&gt;</tt></del><br/>
! </td>
! </tr>
! 
! <tr>
! <td>
! <del>N3843</del><br/>
! </td>
! <td>
! <del>A SFINAE-<br/>Friendly<br/><tt>iterator_traits</tt></del>
! </td>
! <td>
! <del>2.5 [mods.iterator.traits]</del><br/>
! </td>
! <td>
! <del><tt>iterator_traits_sfinae</tt></del>
! </td>
! <td>
! <del><tt>201402</tt></del>
! </td>
! <td>
! <del><tt>&lt;iterator&gt;</tt></del><br/>
! </td>
! </tr>
! 
! <tr>
! <td colspan="6" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! 
! <li><p>In fundamental-ts, remove the existing sub-clause 2.4 [mods.meta.trans.other] in its entirety:</p>
! 
! <p>
! <del><b>2.4 Changes to <tt>std::common_type</tt> [mods.meta.trans.other]</b></del>
! </p>
! <blockquote>
! <p>
! <del>-1- [&hellip;]</del>
! </p>
! </blockquote>
! 
! </li>
! 
! <li><p>In fundamental-ts, remove the existing sub-clause 2.5 [mods.iterator.traits] in its entirety:</p>
! 
! <p>
! <del><b>2.5 Changes to <tt>std::iterator_traits</tt> [mods.iterator.traits]</b></del>
! </p>
! <blockquote>
! <p>
! <del>-1- [&hellip;]</del>
! </p>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2410"></a>2410. [fund.ts] <tt>shared_ptr&lt;array&gt;</tt>'s constructor from <tt>unique_ptr</tt> should be constrained</h3>
! <p><b>Section:</b> X [mods.util.smartptr.shared.const] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jeffrey Yasskin <b>Opened:</b> 2014-06-16 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! <p>
! The proposed resolution for LWG <a href="lwg-defects.html#2399">2399</a> doesn't apply cleanly to the Fundamentals TS, but the issue is still present.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! Unanimous consent. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4023 in regard to fundamental-ts changes.</p>
! 
! <ol>
! <li><p>In fundamental-ts, change [mods.util.smartptr.shared.const] p34 as indicated:</p>
! 
! <blockquote>
! <pre>
! template &lt;class Y, class D&gt; shared_ptr(unique_ptr&lt;Y, D&gt;&amp;&amp; r);
! </pre>
! <blockquote>
! <p>
! -34- <i><del>Requires</del><ins>Remarks</ins></i>: <ins>This constructor shall not participate in overload resolution
! unless</ins> <tt>Y*</tt> <del>shall be</del><ins>is</ins> <i>compatible with</i> <tt>T*</tt>. 
! <p/>
! -35- <i>Effects</i>: Equivalent to <tt>shared_ptr(r.release(), r.get_deleter())</tt> when <tt>D</tt> is not a reference type, 
! otherwise <tt>shared_ptr(r.release(), ref(r.get_deleter()))</tt>.
! <p/>
! -36- <i>Exception safety</i>: If an exception is thrown, the constructor has no effect. 
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2411"></a>2411. <tt>shared_ptr</tt> is only contextually convertible to <tt>bool</tt></h3>
! <p><b>Section:</b> 20.8.2.2 [util.smartptr.shared] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-06-21 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#util.smartptr.shared">active issues</a> in [util.smartptr.shared].</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared">issues</a> in [util.smartptr.shared].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! N3920 made this edit, which is correct but unrelated to the support for arrays:
! </p>
! <blockquote>
! <p>Change 20.7.2.2 [util.smartptr.shared] p2 as follows:</p>
! <blockquote>
! <p>
! Specializations of <tt>shared_ptr</tt> shall be <tt>CopyConstructible</tt>, <tt>CopyAssignable</tt>, and <tt>LessThanComparable</tt>, 
! allowing their use in standard containers. Specializations of <tt>shared_ptr</tt> shall be <ins>contextually</ins> convertible to 
! <tt>bool</tt>, allowing their use in boolean expressions and declarations in conditions. [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! <p>
! That change is actually fixing a defect in the current wording and should be applied directly to the working paper, not just to the
! Library Fundamentals TS. The declarations of the conversion operator in 20.8.2.2 [util.smartptr.shared] and 
! 20.8.2.2.5 [util.smartptr.shared.obs] are <tt>explicit</tt> which contradicts the "convertible to <tt>bool</tt>" statement. The
! intention is definitely for <tt>shared_ptr</tt> to only be contextually convertible to <tt>bool</tt>.
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N3936.</p>
! 
! <ol>
! <li><p>Change 20.8.2.2 [util.smartptr.shared] p2 as indicated:</p>
! 
! <blockquote>
! <p>
! -2- Specializations of <tt>shared_ptr</tt> shall be <tt>CopyConstructible</tt>, <tt>CopyAssignable</tt>, and <tt>LessThanComparable</tt>,
! allowing their use in standard containers. Specializations of <tt>shared_ptr</tt> shall be <ins>contextually</ins> convertible to 
! <tt>bool</tt>, allowing their use in boolean expressions and declarations in conditions. The template parameter <tt>T</tt> of
! <tt>shared_ptr</tt> may be an incomplete type.
! </p>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2415"></a>2415. Inconsistency between <tt>unique_ptr</tt> and <tt>shared_ptr</tt></h3>
! <p><b>Section:</b> 20.8.2.2.1 [util.smartptr.shared.const] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-07-03 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.const">issues</a> in [util.smartptr.shared.const].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>unique_ptr</tt> guarantees that it will not invoke its deleter if it stores
! a null pointer, which is useful for deleters that must not be called
! with a null pointer e.g.
! </p>
! <blockquote><pre>
! unique_ptr&lt;FILE, int(*)(FILE*)&gt; fptr(file, &amp;::fclose);
! </pre></blockquote>
! <p>
! However, <tt>shared_ptr</tt> does invoke the deleter if it owns a null pointer,
! which is a silent change in behaviour when transferring
! ownership from <tt>unique_ptr</tt> to <tt>shared_ptr</tt>. That means the following
! leads to undefined behaviour:
! </p>
! <blockquote><pre>
! std:shared_ptr&lt;FILE&gt; fp = std::move(fptr);
! </pre></blockquote>
! <p>
! Peter Dimov's suggested fix is to construct an empty <tt>shared_ptr</tt> from a
! <tt>unique_ptr</tt> that contains a null pointer.
! </p>
! 
! <p><i>[2015-01-18 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on eight votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Change 20.8.2.2.1 [util.smartptr.shared.const] p29 as indicated:</p>
! <blockquote>
! <pre>
! template &lt;class Y, class D&gt; shared_ptr(unique_ptr&lt;Y, D&gt;&amp;&amp; r);
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -29- <i>Effects</i>: <ins>If <tt>r.get() == nullptr</tt>, equivalent to <tt>shared_ptr()</tt>. Otherwise, if <tt>D</tt> is
! not a reference type, equivalent to <tt>shared_ptr(r.release(), r.get_deleter())</tt>. Otherwise, equivalent to 
! <tt>shared_ptr(r.release(), ref(r.get_deleter()))</tt></ins><del>Equivalent to <tt>shared_ptr(r.release(), 
! r.get_deleter())</tt> when <tt>D</tt> is not a reference type, otherwise <tt>shared_ptr(r.release(), 
! ref(r.get_deleter()))</tt></del>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2416"></a>2416. [fund.ts] <tt>std::experimental::any allocator</tt> support is unimplementable</h3>
! <p><b>Section:</b> X [any.class] <b>Status:</b> <a href="lwg-active.html#Resolved">Resolved</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-06-16 <b>Last modified:</b> 2015-04-08</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#Resolved">Resolved</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! <p>
! The allocator-extended copy constructor for <tt>any</tt> requires an
! arbitrary template parameter to be available in a type-erased context
! where the dynamic type of the contained object is known. This is not
! believed to be possible in C++.
! <p/>
! If the allocator-extended copy constructor cannot be defined it
! questions the usefulness of the other allocator-extended constructors.
! </p>
! 
! <p><i>[Urbana, 2014-11]</i></p>
! 
! <p>
! Resolved by paper <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4270">N4270</a>.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2418"></a>2418. [fund.ts] <tt>apply</tt> does not work with member pointers</h3>
! <p><b>Section:</b> X [tuple.apply] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Zhihao Yuan <b>Opened:</b> 2014-07-08 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! <p>
! The definition of <tt>apply</tt> present in &sect;3.2.2 [tuple.apply] prevents this
! function template to be used with pointer to members type passed as the first argument.
! </p>
! <blockquote>
! <i>Effects:</i> 
! <p/>
! [&hellip;]
! <p/>
! <tt>return std::forward&lt;F&gt;(f)(std::get&lt;I&gt;(std::forward&lt;Tuple&gt;(t))...);</tt>
! </blockquote>
! <p>
! This makes this utility inconsistent with other standard library components and limits its usability.
! <p/>
! We propose to define its functionally in terms of <tt><i>INVOKE</i></tt>.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! DK: We should use the new <tt>std::invoke</tt>.<br/> 
! TK: Is this a defect?<br/> 
! AM: <tt>std::invoke</tt> goes into C++17, and this is a defect against a TS based on C++14. We can change this later, 
! but now leave it as INVOKE.<br/> 
! GR: The TS lets you have Editor's Notes, so leave a note to make that change for C++17.
! <p/>
! [&hellip;]
! <p/>
! GR: I can't see how we can assume this is part of the design. I cannot believe it was ever intended for this 
! design to exclude function pointers.<br/>  
! AM: I can give you the exact evolution: We had "apply" as an example explaining the usefulness of <tt>index_sequence</tt>. 
! Then someone looked at it and said, "why isn't this in the Standard". NJ to VV: Why are you against useful steps? 
! We are trying to converge on a consistent standard across multiple documents. The alternative is to reopen this 
! in a later discussion.<br/>  
! VV: All I said is that this is not defect, whether or not people like it.<br/>  
! AM: So you'd be fine with the issue, but not as a DR?<br/> 
! Straw poll: Who's happy to make this tentatively ready as a DR against the Fundamentals TS? 
! Lots of agreement, no opposition, 3 neutrals
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4081.html">N4081</a> 
! in regard to fundamental-ts changes.</p>
! 
! <ol>
! <li><p>Edit &sect;3.2.2 [tuple.apply] paragraph 2:</p>
! 
! <blockquote>
! <pre>
! template &lt;class F, class Tuple&gt;
! constexpr decltype(auto) apply(F&amp;&amp; f, Tuple&amp;&amp; t);
! </pre>
! <blockquote>
! <p>
! -2- <i>Effects</i>: Given the exposition only function
! </p>
! <blockquote>
! <pre>
! template &lt;class F, class Tuple, size_t... I&gt;
! constexpr decltype(auto) apply_impl(  // <i>exposition only</i>
!     F&amp;&amp; f, Tuple&amp;&amp; t, index_sequence&lt;I...&gt;) {
!   return <ins><i>INVOKE</i>(</ins>std::forward&lt;F&gt;(f)<del>(</del><ins>, </ins>std::get&lt;I&gt;(std::forward&lt;Tuple&gt;(t))...);
! }
! </pre>
! <p>
! [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2420"></a>2420. <tt>function&lt;void(ArgTypes...)&gt;</tt> does not discard the return value of the target object</h3>
! <p><b>Section:</b> 20.9.12.2 [func.wrap.func] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Agust&iacute;n Berg&eacute; <b>Opened:</b> 2014-07-12 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#func.wrap.func">active issues</a> in [func.wrap.func].</p>
! <p><b>View all other</b> <a href="lwg-index.html#func.wrap.func">issues</a> in [func.wrap.func].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>function&lt;void(ArgTypes...)&gt;</tt> should discard the return value of the target object. This behavior was 
! in the original proposal, and it was removed (accidentally?) by the resolution of LWG <a href="lwg-defects.html#870">870</a>.
! </p>
! 
! <p>
! <strong>Previous resolution [SUPERSEDED]:</strong>
! </p>
! <blockquote class="note">
! <ol>
! <li><p>Edit 20.9.12.2 [func.wrap.func] paragraph 2:</p>
! 
! <blockquote>
! <p>
! A callable object <tt>f</tt> of type <tt>F</tt> is <i>Callable</i> for argument types <tt>ArgTypes</tt> and return type 
! <tt>R</tt> if the expression <tt><i>INVOKE</i>(f, declval&lt;ArgTypes&gt;()...<del>, R</del>)</tt>, considered as an unevaluated 
! operand (Clause 5), is well formed (20.9.2 [func.require])<ins> and, if <tt>R</tt> is not <tt>void</tt>, implicitly 
! convertible to <tt>R</tt></ins>.
! </p>
! </blockquote>
! </li>
! </ol>
! </blockquote>
! 
! <p><i>[2014-10-05 Daniel comments]</i></p>
! 
! <p>
! This side-effect was indeed not intended by <a href="lwg-defects.html#870">870</a>.
! </p>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! STL provides improved wording. It replaces the current PR, and intentionally leaves 20.9.12.2 [func.wrap.func] 
! unchanged.
! <p/>
! Due to 5 [expr]/6, <tt>static_cast&lt;void&gt;</tt> is correct even when <tt>R</tt> is <tt>const void</tt>.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4431.</p>
! 
! <ol>
! <li><p>Edit 20.9.2 [func.require] as depicted:</p>
! 
! <blockquote>
! <p>
! -2- Define <tt><i>INVOKE</i>(f, t1, t2, ..., tN, R)</tt> as <ins><tt>static_cast&lt;void&gt;(<i>INVOKE</i>(f, t1, t2, ..., tN))</tt> 
! if <tt>R</tt> is <i>cv</i> <tt>void</tt>, otherwise</ins> <tt><i>INVOKE</i>(f, t1, t2, ..., tN)</tt> implicitly converted 
! to <tt>R</tt>.
! </p>
! </blockquote>
! </li>
! 
! <li><p>Change 20.9.12.2.4 [func.wrap.func.inv] as depicted:</p>
! 
! <blockquote>
! <pre>
! R operator()(ArgTypes... args) const;
! </pre>
! <blockquote>
! <p>
! -1- <i><del>Effects</del><ins>Returns</ins></i>: <tt><i>INVOKE</i>(f, std::forward&lt;ArgTypes&gt;(args)..., R)</tt> (20.9.2), 
! where <tt>f</tt> is the target object (20.9.1) of <tt>*this</tt>.
! <p/>
! <del>-2- <i>Returns</i>: Nothing if <tt>R</tt> is <tt>void</tt>, otherwise the return value of <tt><i>INVOKE</i>(f, 
! std::forward&lt;ArgTypes&gt;(args)..., R)</tt>.</del>
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2425"></a>2425. <tt>operator delete(void*, size_t)</tt> doesn't invalidate pointers sufficiently</h3>
! <p><b>Section:</b> 18.6.1 [new.delete] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-08-29 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#new.delete">issues</a> in [new.delete].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 18.6.1.1 [new.delete.single]/12 says:
! </p>
! <blockquote><p>
! <i>Requires</i>: <tt>ptr</tt> shall be a null pointer or its value shall be a value returned by an earlier call to the 
! (possibly replaced) <tt>operator new(std::size_t)</tt> or <tt>operator new(std::size_t,const std::nothrow_t&amp;)</tt> 
! which has not been invalidated by an intervening call to <tt>operator delete(void*)</tt>.
! </p></blockquote>
! <p>
! This should say:
! </p>
! <blockquote><p>
! [&hellip;] by an intervening call to <tt>operator delete(void*)</tt> <ins>or <tt>operator delete(void*, std::size_t)</tt></ins>.
! </p></blockquote>
! <p>
! Likewise at the end of 18.6.1.2 [new.delete.array]/11, <ins><tt>operator delete[](void*, std::size_t)</tt></ins>.
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>Change 18.6.1.1 [new.delete.single]p12 as indicated:</p>
! 
! <blockquote>
! <p>
! -12- <i>Requires</i>: <tt>ptr</tt> shall be a null pointer or its value shall be a value returned by an earlier call to the 
! (possibly replaced) <tt>operator new(std::size_t)</tt> or <tt>operator new(std::size_t,const std::nothrow_t&amp;)</tt> which 
! has not been invalidated by an intervening call to <tt>operator delete(void*)</tt> <ins>or 
! <tt>operator delete(void*, std::size_t)</tt></ins>.
! </p>
! </blockquote>
! </li>
! 
! <li><p>Change 18.6.1.2 [new.delete.array]p11 as indicated:</p>
! 
! <blockquote>
! <p>
! -11- <i>Requires</i>: <tt>ptr</tt> shall be a null pointer or its value shall be the value returned by an earlier call to 
! <tt>operator new[](std::size_t)</tt> or <tt>operator new[](std::size_t,const std::nothrow_t&amp;)</tt> which 
! has not been invalidated by an intervening call to <tt>operator delete[](void*)</tt> <ins>or 
! <tt>operator delete[](void*, std::size_t)</tt></ins>.
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2427"></a>2427. Container adaptors as sequence containers, redux</h3>
! <p><b>Section:</b> 23.3.1 [sequences.general] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Tim Song <b>Opened:</b> 2014-08-29 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! LWG <a href="lwg-defects.html#2194">2194</a> removed "These container adaptors meet the requirements for sequence containers." from 
! 23.6.1 [container.adaptors.general].
! <p/>
! However, N3936 23.3.1 [sequences.general]/p2 still says "The headers <tt>&lt;queue&gt;</tt> and <tt>&lt;stack&gt;</tt> 
! define container adaptors (23.6) that also meet the requirements for sequence containers." I assume this is just an oversight.
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <ol>
! <li><p>Delete paragraph 2 of 23.3.1 [sequences.general] as indicated:</p>
! 
! <blockquote>
! <p>
! <del>-2- The headers <tt>&lt;queue&gt;</tt> and <tt>&lt;stack&gt;</tt> define container adaptors (23.6) that 
! also meet the requirements for sequence containers.</del>
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2428"></a>2428. "External declaration" used without being defined</h3>
! <p><b>Section:</b> 17.6.2.2 [using.headers] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Tim Song <b>Opened:</b> 2014-09-03 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#using.headers">issues</a> in [using.headers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 17.6.2.2 [using.headers]/3 says
! </p>
! <blockquote><p>
! A translation unit shall include a header only outside of any external declaration or definition [&hellip;]
! </p></blockquote>
! <p>
! This wording appears to be borrowed from the C standard. However, the term "external declaration" is not defined 
! in the C++ standard, and in fact is only used here as far as I can tell, so it is unclear what it means. The C 
! standard does define external declarations as (WG14 N1570 6.9 External definitions/4-5):
! </p>
! <blockquote><p>
! As discussed in 5.1.1.1, the unit of program text after preprocessing is a translation unit, which consists of a 
! sequence of external declarations. These are described as "external" because they appear outside any function 
! (and hence have file scope). [...] An external definition is an external declaration that is also a definition of 
! a function (other than an inline definition) or an object.
! </p></blockquote>
! <p>
! The corresponding description of a translation unit in C++ is "A translation unit consists of a sequence of declarations." 
! (3.5 [basic.link]/3).
! <p/>
! So it appears that the C++ counterpart of "external declaration" in C is simply a "declaration" at file scope. There 
! is no need to specifically limit the statement in 17.6.2.2 [using.headers]/3 to file-scope declarations, however, 
! since every non-file-scope declaration is necessarily inside a file-scope declaration, so banning including a header 
! inside file-scope declarations necessarily bans including one inside non-file-scope declarations as well.
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! <ol>
! <li><p>Edit 17.6.2.2 [using.headers] as indicated:</p>
! 
! <blockquote>
! <p>
! A translation unit shall include a header only outside of any <del>external</del> declaration or definition, and shall
! include the header lexically before the first reference in that translation unit to any of the entities declared
! in that header. No diagnostic is required.
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2433"></a>2433. <tt>uninitialized_copy()</tt>/etc. should tolerate overloaded <tt>operator&amp;</tt></h3>
! <p><b>Section:</b> 20.7.12 [specialized.algorithms] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#specialized.algorithms">issues</a> in [specialized.algorithms].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! This restriction isn't necessary anymore. In fact, this is the section that defines <tt>addressof()</tt>.
! </p>
! <p>
! (Editorial note: We can depict these algorithms as calling <tt>addressof()</tt> instead of <tt>std::addressof()</tt> 
! thanks to 17.6.1.1 [contents]/3 "Whenever a name <tt>x</tt> defined in the standard library is mentioned, the name 
! <tt>x</tt> is assumed to be fully qualified as <tt>::std::x</tt>, unless explicitly described otherwise.")
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! 
! <ol>
! <li><p>Change 20.7.12 [specialized.algorithms] p1 as depicted:</p>
! 
! <blockquote>
! <p>
! -1- <del>All the iterators that are used as formal template parameters in the following algorithms are required to
! have their <tt>operator*</tt> return an object for which <tt>operator&amp;</tt> is defined and returns a pointer to 
! <tt>T</tt>.</del> In the algorithm <tt>uninitialized_copy</tt>, the formal template parameter <tt>InputIterator</tt> 
! is required to satisfy the requirements of an input iterator (24.2.3). In all of the following algorithms, the formal 
! template parameter <tt>ForwardIterator</tt> is required to satisfy the requirements of a forward iterator (24.2.5), 
! and is required to have the property that no exceptions are thrown from increment, assignment, comparison, or indirection
! through valid iterators. In the following algorithms, if an exception is thrown there are no effects.
! </p>
! </blockquote>
! </li>
! 
! <li><p>Change 20.7.12.2 [uninitialized.copy] p1 as depicted:</p>
! <blockquote>
! <p>
! -1- <i>Effects</i>:
! </p>
! <blockquote>
! <pre>
! for (; first != last; ++result, ++first)
!   ::new (static_cast&lt;void*&gt;(<ins>addressof(</ins><del>&amp;</del>*result<ins>)</ins>))
!     typename iterator_traits&lt;ForwardIterator&gt;::value_type(*first);
! </pre>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 20.7.12.2 [uninitialized.copy] p3 as depicted:</p>
! <blockquote>
! <p>
! -3- <i>Effects</i>:
! </p>
! <blockquote>
! <pre>
! for (; n &gt; 0; ++result, ++first, --n) {
!   ::new (static_cast&lt;void*&gt;(<ins>addressof(</ins><del>&amp;</del>*result<ins>)</ins>))
!     typename iterator_traits&lt;ForwardIterator&gt;::value_type(*first);
! }
! </pre>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 20.7.12.3 [uninitialized.fill] p1 as depicted:</p>
! <blockquote>
! <p>
! -1- <i>Effects</i>:
! </p>
! <blockquote>
! <pre>
! for (; first != last; ++first)
!   ::new (static_cast&lt;void*&gt;(<ins>addressof(</ins><del>&amp;</del>*first<ins>)</ins>))
!     typename iterator_traits&lt;ForwardIterator&gt;::value_type(x);
! </pre>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 20.7.12.4 [uninitialized.fill.n] p1 as depicted:</p>
! <blockquote>
! <p>
! -1- <i>Effects</i>:
! </p>
! <blockquote>
! <pre>
! for (; n--; ++first)
!   ::new (static_cast&lt;void*&gt;(<ins>addressof(</ins><del>&amp;</del>*first<ins>)</ins>))
!     typename iterator_traits&lt;ForwardIterator&gt;::value_type(x);
! return first;
! </pre>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2434"></a>2434. <tt>shared_ptr::use_count()</tt> is efficient</h3>
! <p><b>Section:</b> 20.8.2.2.5 [util.smartptr.shared.obs] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#util.smartptr.shared.obs">issues</a> in [util.smartptr.shared.obs].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>shared_ptr</tt> and <tt>weak_ptr</tt> have Notes that their <tt>use_count()</tt> might be inefficient. 
! This is an attempt to acknowledge reflinked implementations (which can be used by Loki smart pointers, for 
! example). However, there aren't any <tt>shared_ptr</tt> implementations that use reflinking, especially 
! after C++11 recognized the existence of multithreading. Everyone uses atomic refcounts, so <tt>use_count()</tt> 
! is just an atomic load.
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! 
! <ol>
! <li><p>Change 20.8.2.2.5 [util.smartptr.shared.obs] p7-p10 as depicted:</p>
! 
! <blockquote>
! <pre>
! long use_count() const noexcept;
! </pre>
! <blockquote>
! <p>
! -7- <i>Returns</i>: the number of <tt>shared_ptr</tt> objects, <tt>*this</tt> included, that <em>share ownership</em> with 
! <tt>*this</tt>, or 0 when <tt>*this</tt> is <em>empty</em>.
! <p/>
! <del>-8- [<i>Note</i>: <tt>use_count()</tt> is not necessarily efficient. &mdash; <i>end note</i>]</del>
! </p>
! </blockquote>
! <pre>
! bool unique() const noexcept;
! </pre>
! <blockquote>
! <p>
! -9- <i>Returns</i>: <tt>use_count() == 1</tt>.
! <p/>
! -10- [<i>Note</i>: <del><tt>unique()</tt> may be faster than <tt>use_count()</tt>.</del> If you are using <tt>unique()</tt> 
! to implement copy on write, do not rely on a specific value when <tt>get() == 0</tt>. &mdash; <i>end note</i>]
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 20.8.2.3.5 [util.smartptr.weak.obs] p1-p4 as depicted:</p>
! 
! <blockquote>
! <pre>
! long use_count() const noexcept;
! </pre>
! <blockquote>
! <p>
! -1- <i>Returns</i>: 0 if <tt>*this</tt> is <em>empty</em>; otherwise, the number of <tt>shared_ptr</tt> instances 
! that <em>share ownership</em> with <tt>*this</tt>.
! <p/>
! <del>-2- [<i>Note</i>: <tt>use_count()</tt> is not necessarily efficient. &mdash; <i>end note</i>]</del>
! </p>
! </blockquote>
! <pre>
! bool expired() const noexcept;
! </pre>
! <blockquote>
! <p>
! -3- <i>Returns</i>: <tt>use_count() == 0</tt>.
! <p/>
! <del>-4- [<i>Note</i>: <tt>expired()</tt> may be faster than <tt>use_count()</tt>. &mdash; <i>end note</i>]</del>
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2437"></a>2437. <tt>iterator_traits&lt;OutIt&gt;::reference</tt> can and can't be <tt>void</tt></h3>
! <p><b>Section:</b> 24.2.2 [iterator.iterators] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#iterator.iterators">issues</a> in [iterator.iterators].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 24.2.2 [iterator.iterators]/2 requires an <tt>Iterator</tt>'s <tt>*r</tt> to return <tt>reference</tt>, 
! i.e. <tt>iterator_traits&lt;X&gt;::reference</tt> according to 24.2.1 [iterator.requirements.general]/11.
! <p/>
! 24.2.4 [output.iterators]/1 requires an <tt>OutputIterator</tt>'s <tt>*r = o</tt> to do its job, 
! so <tt>*r</tt> clearly can't return <tt>void</tt>.
! <p/>
! 24.4.1 [iterator.traits]/1 says: "In the case of an output iterator, the types
! </p>
! <blockquote><pre>
! iterator_traits&lt;Iterator&gt;::difference_type
! iterator_traits&lt;Iterator&gt;::value_type
! iterator_traits&lt;Iterator&gt;::reference
! iterator_traits&lt;Iterator&gt;::pointer
! </pre></blockquote>
! <p>
! may be defined as <tt>void</tt>."
! <p/>
! This is contradictory. I suggest fixing this by moving the offending requirement down from <tt>Iterator</tt> to 
! <tt>InputIterator</tt>, and making <tt>Iterator</tt> say that <tt>*r</tt> returns an unspecified type. This will 
! have the following effects:
! </p>
! <ul>
! <li><p>Output-only iterators will inherit Iterator's "<tt>*r</tt> returns unspecified" requirement, while 
! 24.4.1 [iterator.traits]/1 clearly permits reference/etc. to be <tt>void</tt>.</p></li>
! <li><p>Input-or-stronger iterators (whether constant or mutable) are unaffected &mdash; they still have to satisfy 
! "<tt>*r</tt> returns reference", they're just getting that requirement from <tt>InputIterator</tt> instead of 
! <tt>Iterator</tt>.</p></li>
! </ul>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! EF: This is related to <a href="lwg-defects.html#2438">2438</a>. MC: I'd like to take up 2438 right after this.
! <p/>
! AM: Does anyone think this is wrong?
! <p/>
! GR: Why do we give output iterators to have reference type void? AM: we've mandated that certain output iterators 
! define it as void since 1998. GR: Oh OK, I'm satisfied.
! <p/>
! Accepted. And <a href="lwg-defects.html#2438">2438</a> is already Ready. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! 
! <ol>
! <li><p>In 24.2.2 [iterator.iterators] Table 106 "Iterator requirements" change as indicated:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 106 &mdash; Iterator requirements</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational<br/>semantics</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! </tr>
! 
! <tr>
! <td>
! <tt>*r</tt>
! </td>
! <td>
! <del><tt>reference</tt></del><ins>unspecified</ins>
! </td>
! <td>
! <tt></tt>
! </td>
! <td>
! <i>pre</i>: <tt>r</tt> is dereferenceable.
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! </table>
! </blockquote></li>
! 
! <li><p>In 24.2.3 [input.iterators] Table 107 "Input iterator requirements" change as indicated:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 107 &mdash; Input iterator requirements (in addition to Iterator)</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational<br/>semantics</th>
! <th>Assertion&#47;note pre-&#47;post-condition</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>*a</tt>
! </td>
! <td>
! <ins><tt>reference</tt>,</ins> convertible to <tt>T</tt>
! </td>
! <td>
! <tt></tt>
! </td>
! <td>
! [&hellip;]
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! </table>
! </blockquote></li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2438"></a>2438. <tt>std::iterator</tt> inheritance shouldn't be mandated</h3>
! <p><b>Section:</b> 24.4.2 [iterator.basic] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! For LWG convenience, nine STL iterators are depicted as deriving from <tt>std::iterator</tt> to get their 
! <tt>iterator_category</tt>/etc. typedefs. Unfortunately (and unintentionally), this also mandates the 
! inheritance, which is observable (not just through <tt>is_base_of</tt>, but also overload resolution). 
! This is unfortunate because it confuses users, who can be misled into thinking that their own iterators 
! must derive from <tt>std::iterator</tt>, or that overloading functions to take <tt>std::iterator</tt> is 
! somehow meaningful. This is also unintentional because the STL's most important iterators, the container 
! iterators, aren't required to derive from <tt>std::iterator</tt>. (Some are even allowed to be raw pointers.)  
! Finally, this unnecessarily constrains implementers, who may not want to derive from <tt>std::iterator</tt>.  
! (For example, to simplify debugger views.)
! <p/>
! We could add wording to 24.4.2 [iterator.basic] saying that any depicted inheritance is for exposition 
! only, but that wouldn't really solve reader confusion. Replacing the depicted inheritance with direct typedefs 
! will prevent confusion. Note that implementers won't be required to change their code &mdash; they are free to 
! continue deriving from <tt>std::iterator</tt> if they want.
! <p/>
! (Editorial note: The order of the typedefs follows the order of <tt>std::iterator</tt>'s template parameters.)
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! 
! <ol>
! <li><p>Change 20.7.10 [storage.iterator], class template <tt>raw_storage_iterator</tt> synopsis, as depicted:</p>
! 
! <blockquote>
! <pre>
! template &lt;class OutputIterator, class T&gt;
! class raw_storage_iterator
!   <del>: public iterator&lt;output_iterator_tag,void,void,void,void&gt;</del> {
! public:
!   <ins>typedef output_iterator_tag iterator_category;
!   typedef void value_type;
!   typedef void difference_type;
!   typedef void pointer;
!   typedef void reference;</ins>
! 
!   explicit raw_storage_iterator(OutputIterator x);
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! 
! <li><p>Change 24.5.1.1 [reverse.iterator], class template <tt>reverse_iterator</tt> synopsis, as depicted
! (editorial note: this reorders "<tt>reference</tt>, <tt>pointer</tt>" to "<tt>pointer</tt>, <tt>reference</tt>" 
! and aligns whitespace):</p>
! 
! <blockquote>
! <pre>
! template &lt;class Iterator&gt;
! class reverse_iterator <del>: public 
!   iterator&lt;typename iterator_traits&lt;Iterator&gt;::iterator_category,
!   typename iterator_traits&lt;Iterator&gt;::value_type,
!   typename iterator_traits&lt;Iterator&gt;::difference_type,
!   typename iterator_traits&lt;Iterator&gt;::pointer,
!   typename iterator_traits&lt;Iterator&gt;::reference&gt;</del> {
! public:
!   <del>typedef Iterator iterator_type;
!   typedef typename iterator_traits&lt;Iterator&gt;::difference_type difference_type;
!   typedef typename iterator_traits&lt;Iterator&gt;::reference reference;
!   typedef typename iterator_traits&lt;Iterator&gt;::pointer pointer;</del>
!   <ins>typedef Iterator                                              iterator_type;
!   typedef typename iterator_traits&lt;Iterator&gt;::iterator_category iterator_category;
!   typedef typename iterator_traits&lt;Iterator&gt;::value_type        value_type;
!   typedef typename iterator_traits&lt;Iterator&gt;::difference_type   difference_type;
!   typedef typename iterator_traits&lt;Iterator&gt;::pointer           pointer;
!   typedef typename iterator_traits&lt;Iterator&gt;::reference         reference;</ins>
! 
!   reverse_iterator();
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! 
! <li><p>Change 24.5.2.1 [back.insert.iterator], class template <tt>back_insert_iterator</tt> synopsis, as depicted:</p>
! 
! <blockquote>
! <pre>
! template &lt;class Container&gt;
! class back_insert_iterator <del>: 
!   public iterator&lt;output_iterator_tag,void,void,void,void&gt;</del> {
! protected:
!   Container* container;
! 
! public:
!   <ins>typedef output_iterator_tag iterator_category;
!   typedef void value_type;
!   typedef void difference_type;
!   typedef void pointer;
!   typedef void reference;</ins>
!   typedef Container container_type;
!   explicit back_insert_iterator(Container&amp; x);
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! 
! <li><p>Change 24.5.2.3 [front.insert.iterator], class template <tt>front_insert_iterator</tt> synopsis, as depicted:</p>
! 
! <blockquote>
! <pre>
! template &lt;class Container&gt;
! class front_insert_iterator <del>: 
!   public iterator&lt;output_iterator_tag,void,void,void,void&gt;</del> {
! protected:
!   Container* container;
! 
! public:
!   <ins>typedef output_iterator_tag iterator_category;
!   typedef void value_type;
!   typedef void difference_type;
!   typedef void pointer;
!   typedef void reference;</ins>
!   typedef Container container_type;
!   explicit front_insert_iterator(Container&amp; x);
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! 
! <li><p>Change 24.5.2.5 [insert.iterator], class template <tt>insert_iterator</tt> synopsis, as depicted:</p>
! 
! <blockquote>
! <pre>
! template &lt;class Container&gt;
! class insert_iterator <del>: 
!   public iterator&lt;output_iterator_tag,void,void,void,void&gt;</del> {
! protected:
!   Container* container;
!   typename Container::iterator iter;
! 
! public:
!   <ins>typedef output_iterator_tag iterator_category;
!   typedef void value_type;
!   typedef void difference_type;
!   typedef void pointer;
!   typedef void reference;</ins>
!   typedef Container container_type;
!   insert_iterator(Container&amp; x, typename Container::iterator i);
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! 
! <li><p>Change 24.6.1 [istream.iterator], class template <tt>istream_iterator</tt> synopsis, as depicted:</p>
! 
! <blockquote>
! <pre>
! template &lt;class T, class charT = char, class traits = char_traits&lt;charT&gt;,
!   class Distance = ptrdiff_t&gt;
! class istream_iterator <del>: 
!   public iterator&lt;input_iterator_tag, T, Distance, const T*, const T&amp;&gt;</del> {
! public:
!   <ins>typedef input_iterator_tag iterator_category;
!   typedef T value_type;
!   typedef Distance difference_type;
!   typedef const T* pointer;
!   typedef const T&amp; reference;</ins>
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! 
! <li><p>Change 24.6.2 [ostream.iterator], class template <tt>ostream_iterator</tt> synopsis, as depicted:</p>
! 
! <blockquote>
! <pre>
! template &lt;class T, class charT = char, class traits = char_traits&lt;charT&gt;&gt;
! class ostream_iterator <del>: 
!   public iterator&lt;output_iterator_tag, void, void, void, void&gt;</del> {
! public:
!   <ins>typedef output_iterator_tag iterator_category;
!   typedef void value_type;
!   typedef void difference_type;
!   typedef void pointer;
!   typedef void reference;</ins>
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! 
! <li><p>Change 24.6.3 [istreambuf.iterator], class template <tt>istreambuf_iterator</tt> synopsis, as depicted:</p>
! 
! <blockquote>
! <pre>
! template &lt;class charT = char, class traits = char_traits&lt;charT&gt; &gt;
! class istreambuf_iterator <del>: 
!   public iterator&lt;input_iterator_tag, charT,
!                   typename traits::off_type, <em>unspecified</em>, charT&gt;</del> {
! public:
!   <ins>typedef input_iterator_tag iterator_category;
!   typedef charT value_type;
!   typedef typename traits::off_type difference_type;
!   typedef <em>unspecified</em> pointer;
!   typedef charT reference;</ins>
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! 
! <li><p>Change 24.6.4 [ostreambuf.iterator], class template <tt>ostreambuf_iterator</tt> synopsis, as depicted 
! (editorial note: this removes a redundant "public:"):</p>
! 
! <blockquote>
! <pre>
! template &lt;class charT = char, class traits = char_traits&lt;charT&gt;&gt;
! class ostreambuf_iterator <del>: 
!   public iterator&lt;output_iterator_tag, void, void, void, void&gt;</del> {
! public:
!   <ins>typedef output_iterator_tag iterator_category;
!   typedef void value_type;
!   typedef void difference_type;
!   typedef void pointer;
!   typedef void reference;</ins>
!   [&hellip;]
! <del>public:</del>
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2439"></a>2439. <tt>unique_copy()</tt> sometimes can't fall back to reading its output</h3>
! <p><b>Section:</b> 25.3.9 [alg.unique] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#alg.unique">issues</a> in [alg.unique].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>unique_copy()</tt>'s wording says that if it's given input-only and output-only iterators, it needs 
! the input's value type to be copyable. This is correct, because in this case the algorithm must have a 
! local element copy in order to detect duplicates.
! <p/>
! The wording also says that if it's given an <tt>InputIterator</tt> that's forward or stronger, the input's 
! value type doesn't have to be copyable. This is also correct, because in this case the algorithm can reread 
! the input in order to detect duplicates.
! <p/>
! Finally, the wording says that if it's given an input-only iterator with an <tt>OutputIterator</tt> that's 
! forward or stronger, the input's value type doesn't have to be copyable. This is telling the algorithm to 
! compare its input to its output in order to detect duplicates, but that isn't always possible! If the input 
! and output have the same value type, then they can be compared (as long as <tt>*result = *first</tt> behaves 
! sanely; see below). If they have different value types, then we can't compare them.
! <p/>
! This could be resolved by requiring heterogeneous value types to be comparable in this situation, but that 
! would be extremely tricky to wordsmith (as it would challenge the concept of "group of equal elements" used 
! by the Effects). It will be vastly simpler and more effective to extend the "local element copy" requirement 
! to this scenario.
! <p/>
! Note that the input-only, output forward-or-stronger, identical value types scenario needs a bit of work too.  
! We always require *result = *first to be "valid", but in this case we need to additionally require that the 
! assignment actually transfers the value. (Otherwise, we'd be allowing an <tt>op=()</tt> that ignores <tt>*first</tt> 
! and always sets <tt>*result</tt> to zero, or other unacceptable behavior.) This is just <tt>CopyAssignable</tt>.
! <p/>
! (What happens when <tt>unique_copy()</tt> is given a <tt>move_iterator</tt> is a separate issue.)
! <p/>
! To summarize:
! </p>
! <blockquote><p>
! input forward+: no additional requirements
! <p/>
! input-only, output forward+, same value types: needs <tt>CopyAssignable</tt>
! <p/>
! input-only, output forward+, different value types: needs <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt>
! <p/>
! input-only, output-only: needs <tt>CopyConstructible</tt> and <tt>CopyAssignable</tt>
! </p></blockquote>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! 
! <ol>
! <li><p>Change 25.3.9 [alg.unique] p5, as depicted:</p>
! 
! <blockquote>
! <pre>
! template&lt;class InputIterator, class OutputIterator>
! OutputIterator
! unique_copy(InputIterator first, InputIterator last,
!             OutputIterator result);
! template&lt;class InputIterator, class OutputIterator,
!          class BinaryPredicate>
! OutputIterator
! unique_copy(InputIterator first, InputIterator last,
!             OutputIterator result, BinaryPredicate pred);
! </pre>
! <blockquote>
! <p>
! -5- <i>Requires</i>: The comparison function shall be an equivalence relation. The ranges [<tt>first,last</tt>) and
! [<tt>result,result+(last-first)</tt>) shall not overlap. The expression <tt>*result = *first</tt> shall be valid.
! <del>If neither <tt>InputIterator</tt> nor <tt>OutputIterator</tt> meets the requirements of forward iterator then the
! value type of <tt>InputIterator</tt> shall be <tt>CopyConstructible</tt> (Table 21) and <tt>CopyAssignable</tt> (Table 23).
! Otherwise <tt>CopyConstructible</tt> is not required.</del><ins>Let <tt>T</tt> be the value type of <tt>InputIterator</tt>. 
! If <tt>InputIterator</tt> meets the forward iterator requirements, then there are no additional requirements for <tt>T</tt>. 
! Otherwise, if <tt>OutputIterator</tt> meets the forward iterator requirements and its value type is the same as <tt>T</tt>, 
! then <tt>T</tt> shall be <tt>CopyAssignable</tt> (Table 23). Otherwise, <tt>T</tt> shall be both <tt>CopyConstructible</tt> 
! (Table 21) and <tt>CopyAssignable</tt>.</ins>
! </p>
! </blockquote></blockquote></li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2440"></a>2440. <tt>seed_seq::size()</tt> should be <tt>noexcept</tt></h3>
! <p><b>Section:</b> 26.5.7.1 [rand.util.seedseq] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#rand.util.seedseq">issues</a> in [rand.util.seedseq].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Obvious.
! </p>
! 
! <p><i>[Urbana 2014-11-07: Move to Ready]</i></p>
! 
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! 
! <ol>
! <li><p>Change 26.5.7.1 [rand.util.seedseq], class <tt>seed_seq</tt> synopsis, as depicted:</p>
! 
! <blockquote>
! <pre>
! class seed_seq
! {
! public:
!   [&hellip;]
!   size_t size() const <ins>noexcept</ins>;
!   [&hellip;]
! };
! </pre>
! </blockquote></li>
! 
! <li><p>Change 26.5.7.1 [rand.util.seedseq] around p10, as depicted:</p>
! 
! <blockquote>
! <pre>
! size_t size() const <ins>noexcept</ins>;
! </pre>
! <blockquote>
! <p>
! -10- <i>Returns</i>: The number of 32-bit units that would be returned by a call to <tt>param()</tt>.
! <p/>
! <del>-11- <i>Throws</i>: Nothing.</del>
! <p/>
! -12- <i>Complexity</i>: Constant time.
! </p>
! </blockquote>
! </blockquote></li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2442"></a>2442. <tt>call_once()</tt> shouldn't <tt>DECAY_COPY()</tt></h3>
! <p><b>Section:</b> 30.4.4.2 [thread.once.callonce] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2014-10-01 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#thread.once.callonce">issues</a> in [thread.once.callonce].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! When LWG <a href="lwg-defects.html#891">891</a> overhauled <tt>call_once()</tt>'s specification, it used <tt>decay_copy()</tt>, following 
! LWG <a href="lwg-defects.html#929">929</a>'s overhaul of <tt>thread</tt>'s constructor.
! <p/>
! In <tt>thread</tt>'s constructor, this is necessary and critically important. 30.3.1.2 [thread.thread.constr]/5 
! "The new thread of execution executes <tt><i>INVOKE</i>(<i>DECAY_COPY</i>(std::forward&lt;F&gt;(f)), 
! <i>DECAY_COPY</i>(std::forward&lt;Args&gt;(args))...)</tt> 
! with the calls to <tt><i>DECAY_COPY</i></tt> being evaluated in the constructing thread." requires the parent thread 
! to copy arguments for the child thread to access.
! <p/>
! In <tt>call_once()</tt>, this is unnecessary and harmful. It's unnecessary because <tt>call_once()</tt> doesn't transfer 
! arguments between threads. It's harmful because:
! </p>
! <ul>
! <li><p><tt>decay_copy()</tt> returns a prvalue. Given <tt>meow(int&amp;)</tt>, <tt>meow(i)</tt> can be called directly, 
! but <tt>call_once(flag, meow, i)</tt> won't compile.</p></li>
! <li><p><tt>decay_copy()</tt> moves from modifiable rvalues. Given <tt>purr(const unique_ptr&lt;int&gt;&amp;)</tt>, 
! <tt>purr(move(up))</tt> won't modify <tt>up</tt>. (This is observable, because moved-from <tt>unique_ptr</tt>s are 
! guaranteed empty.) However, <tt>call_once(flag, purr, move(up))</tt> will leave <tt>up</tt> empty after the first active 
! execution. Observe the behavioral difference &mdash; if <tt>purr()</tt> is directly called like this repeatedly until it 
! doesn't throw an exception, each call will observe <tt>up</tt> unchanged. With <tt>call_once()</tt>, the second active 
! execution will observe <tt>up</tt> to be empty.</p></li>
! </ul>
! <p>
! <tt>call_once()</tt> should use perfect forwarding without <tt>decay_copy()</tt>, in order to avoid interfering with the call like this.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Handed over to SG1.
! </p>
! 
! <p><i>[2015-05 Lenexa, SG1 response]</i></p>
! 
! <p>
! Looks good to us, but this is really an LWG issue.
! </p>
! 
! <p><i>[2015-05-07 Lenexa: Move Immediate]</i></p>
! 
! <p>LWG 2442 call_once shouldn't decay_copy</p>
! <p>STL summarizes the SG1 minutes.</p>
! <p>Marshall: Jonathan updated all the issues with SG1 status last night. Except this one.</p>
! <p>STL summarizes the issue.</p>
! <p>Dietmar: Of course, call_once has become useless.</p>
! <p>STL: With magic statics.</p>
! <p>Jonathan: Magic statics can't be per object, which I use in future.</p>
! <p>Marshall: I see why you are removing the MoveConstructible on the arguments, but what about Callable?</p>
! <p>STL: That's a type named Callable, which we will no longer decay_copy. We're still requiring the INVOKE expression to be valid.</p>
! <p>Marshall: Okay. Basically, ripping the decay_copy out of here.</p>
! <p>STL: I recall searching the Standard for other occurrences and I believe this is the only inappropriate use of decay_copy.</p>
! <p>Marshall: We do the decay_copy.</p>
! <p>Jonathan: Us too.</p>
! <p>Marshall: What do people think?</p>
! <p>Jonathan: I think STL's right. In the use I was mentioning inside futures, I actually pass them by reference_wrapper and pointers, to avoid the decay causing problems. Inside the call_once, I then extract the args. So I've had to work around this and didn't realize it was a defect.</p>
! <p>Marshall: What do people think is the right resolution?</p>
! <p>STL: I would like to see Immediate.</p>
! <p>Hwrd: No objections to Immediate.</p>
! <p>Marshall: Bill is nodding.</p>
! <p>PJP: He said it. Everything STL says applies to our other customers.</p>
! <p>Marshall: Any objections to Immediate?</p>
! <p>Jonathan: I can't see any funky implementations where a decay_copy would be necessary?</p>
! <p>Marshall: 6 votes for Immediate, 0 opposed, 0 abstaining.</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N3936.
! </p>
! 
! <ol>
! <li><p>Change 30.4.4.2 [thread.once.callonce] p1+p2 as depicted:</p>
! 
! <blockquote>
! <pre>
! template&lt;class Callable, class ...Args&gt;
!   void call_once(once_flag&amp; flag, Callable&amp;&amp; func, Args&amp;&amp;... args);
! </pre>
! <blockquote>
! <p>
! -1- <i>Requires</i>: <del><tt>Callable</tt> and each <tt>Ti</tt> in <tt>Args</tt> shall satisfy the <tt>MoveConstructible</tt> 
! requirements.</del> <tt><i>INVOKE</i>(<del><i>DECAY_COPY</i>(</del>std::forward&lt;Callable&gt;(func)<del>)</del>, 
! <del><i>DECAY_COPY</i>(</del>std::forward&lt;Args&gt;(args)<del>)</del>...)</tt>
! (20.9.2) shall be a valid expression.
! <p/>
! -2- <i>Effects</i>; [&hellip;] An active execution shall call 
! <tt><i>INVOKE</i>(<del><i>DECAY_COPY</i>(</del>std::forward&lt;Callable&gt;(func)<del>)</del>, 
! <del><i>DECAY_COPY</i>(</del>std::forward&lt;Args&gt;(args)<del>)</del>...)</tt>. [&hellip;]
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2448"></a>2448. Non-normative Container destructor specification</h3>
! <p><b>Section:</b> 23.2.1 [container.requirements.general] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2014-10-18 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#container.requirements.general">active issues</a> in [container.requirements.general].</p>
! <p><b>View all other</b> <a href="lwg-index.html#container.requirements.general">issues</a> in [container.requirements.general].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! According to Table 96 &mdash; "Container requirements" the specification:
! </p>
! <blockquote><p>
! note: the destructor is applied to every element of <tt>a</tt>; any
! memory obtained is deallocated.
! </p></blockquote>
! <p>
! The initial "note:" can be read as if that part of the specification would not be normative (This note form
! differs from footnotes in tables, which have normative meaning).
! <p/>
! It seems that this initial part of the specification exists since C++98. But comparing with
! the similar <a href="https://www.sgi.com/tech/stl/Container.html">SGI Container specification</a> there is no evidence
! for that being intended to be non-normative.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! NJ: If we fix this, we should also fix it elsewhere. Oh, this is the only place?<br/> 
! GR: If this is intended to be different from elsewhere, we should make sure.<br/> 
! AM: <tt>valarray</tt> specifies this without the "note:".<br/> 
! DK: <tt>valarray</tt> requires trivially destructible types!<br/> 
! GR: That's good enough for me.<br/> 
! NJ: First time <tt>valarray</tt> has been useful for something!
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N4140.
! </p>
! 
! <ol>
! <li><p>Change 23.2.1 [container.requirements.general], Table 96 &mdash; "Container requirements", as indicated:</p>
! <blockquote>
! <table border="1">
! <caption>Table 96 &mdash; Container requirements</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Operational<br/>semantics</th>
! <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
! <th>Complexity</th>
! </tr>
! 
! <tr>
! <td colspan="5" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>(&amp;a)-&gt;~X()</tt>
! </td>
! <td>
! <tt>void</tt>
! </td>
! <td>
! </td>
! <td>
! <del>note:</del> the destructor<br/>
! is applied to every<br/>
! element of <tt>a</tt>; any<br/>
! memory obtained is
! deallocated.
! </td>
! <td>
! linear
! </td>
! </tr>
! 
! <tr>
! <td colspan="5" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2454"></a>2454. Add <tt>raw_storage_iterator::base()</tt> member</h3>
! <p><b>Section:</b> 20.7.10 [storage.iterator] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Jonathan Wakely <b>Opened:</b> 2014-11-11 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#storage.iterator">issues</a> in [storage.iterator].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Eric Niebler pointed out that <tt>raw_storage_iterator</tt> should give access
! to the <tt>OutputIterator</tt> it wraps.
! <p/>
! This helps alleviate the exception-safety issue pointed out in the
! discussion of LWG <a href="lwg-active.html#2127">2127</a>, as an exception can be caught and then
! destructors can be run for the constructed elements in the range
! <tt>[begin, raw.base())</tt>
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! NJ: Is this "const" correct [in "base()"]? DK: Yes, we always do that. NJ: And the output iterator is not qualifying in any way? 
! AM/DK: That wouldn't make sense. NJ: OK.
! <p/>
! VV: What did LEWG say about this feature request? In other words, why is this a library issue? AM: LEWG/JY thought this wouldn't 
! be a contentious issue.
! <p/>
! NJ: I really hope the split of LEWG and LWG will be fixed soon, since it's only wasting time. VV: So you want to spend even 
! more of your time on discussions that LEWG has?
! <p/>
! AM: I think this specified correctly. I'm not wild about it. But no longer bothered to stand in its way.
! <p/>
! GR: Why do we need to repeat the type in "Returns" even though it's part of the synopsis? AM: Good point, but not worth fixing.
! <p/>
! NJ: Why is "<tt>base()</tt>" for <tt>reverse_iterator</tt> commented with "// explicit"? AM: I guess in 1998 that was the 
! only way to say this.
! <p/>
! AM: So, it's tentatively ready. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to <a href="http://www.open-std.org/jtc1/sc22/wg21/prot/14882fdis/n4140.pdf">N4140</a>.</p>
! 
! <ol>
! <li><p>Add a new function to the synopsis in 20.7.10 [storage.iterator] p1:</p>
! 
! <blockquote><pre>
! namespace std {
!   template &lt;class OutputIterator, class T&gt;
!   class raw_storage_iterator
!     : public iterator&lt;output_iterator_tag,void,void,void,void&gt; {
!   public:
!     explicit raw_storage_iterator(OutputIterator x);
! 
!     raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator*();
!     raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator=(const T&amp; element);
!     raw_storage_iterator&lt;OutputIterator,T&gt;&amp; operator++();
!     raw_storage_iterator&lt;OutputIterator,T&gt; operator++(int);
!     <ins>OutputIterator base() const;</ins>
! };
! }
! </pre></blockquote>
! </li>
! 
! <li><p>Insert the new function and a new paragraph series after p7:</p>
! 
! <blockquote><pre>
! <ins>OutputIterator base() const;</ins>
! </pre><blockquote>
! <p>
! <ins>-?- <i>Returns</i>: An iterator of type <tt>OutputIterator</tt> that points to the
! same value as <tt>*this</tt> points to.</ins>
! </p>
! </blockquote></blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2455"></a>2455. Allocator default construction should be allowed to throw</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Pablo Halpern <b>Opened:</b> 2014-11-11 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! 17.6.3.5 [allocator.requirements]/4 in the 2014-10 WP (N4140), says:
! </p>
! <blockquote><p>
! An allocator type <tt>X</tt> shall satisfy the requirements of <tt>CopyConstructible</tt> (17.6.3.1). The 
! <tt>X::pointer</tt>, <tt>X::const_pointer</tt>, <tt>X::void_pointer</tt>, and <tt>X::const_void_pointer</tt> 
! types shall satisfy the requirements of <tt>NullablePointer</tt> (17.6.3.3). No constructor, comparison operator, 
! copy operation, move operation, or swap operation on these types shall exit via an exception. <tt>X::pointer</tt> 
! and <tt>X::const_pointer</tt> shall also satisfy the requirements for a random access iterator (24.2).
! </p></blockquote>
! <p>
! The words "these types" would normally apply only to the previous sentence only, i.e., only to the pointer types.  
! However, an alternative reading would be that the allocator constructors themselves cannot throw. The change to 
! the <tt>vector</tt> and <tt>string</tt> default constructors, making them unconditionally <tt>noexcept</tt> depends 
! on this alternative reading.
! <p/>
! I believe that the wording in the standard is not intended to forbid throwing default constructors for allocators.  
! Indeed, I believe that allocators do not require default constructors and that if they provide a default constructor 
! they should be allowed to throw.
! <p/>
! In addition, the <tt>noexcept</tt> specifications for the <tt>string</tt> and <tt>vector</tt> default constructors 
! should be changed to make them conditional.
! </p>
! 
! <p><i>[2015-01-18 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <ol>
! <li><p>Change 17.6.3.5 [allocator.requirements] p4 as indicated:</p>
! 
! <blockquote><p>
! An allocator type <tt>X</tt> shall satisfy the requirements of <tt>CopyConstructible</tt> (17.6.3.1). The 
! <tt>X::pointer</tt>, <tt>X::const_pointer</tt>, <tt>X::void_pointer</tt>, and <tt>X::const_void_pointer</tt> 
! types shall satisfy the requirements of <tt>NullablePointer</tt> (17.6.3.3). No constructor, comparison operator, 
! copy operation, move operation, or swap operation on these <ins>pointer</ins> types shall exit via an exception. 
! <tt>X::pointer</tt> and <tt>X::const_pointer</tt> shall also satisfy the requirements for a random access iterator (24.2).
! </p></blockquote>
! </li>
! 
! <li><p>Change 21.4 [basic.string] following p5, class template <tt>basic_string</tt> synopsis, as indicated: 
! (This change assumes that N4258 has been applied, as voted on in Urbana on 2014-11-08)</p>
! 
! <blockquote>
! <pre>
! <i>// 21.4.2, construct/copy/destroy:</i>
! basic_string() noexcept<ins>(noexcept(Allocator()))</ins> : basic_string(Allocator()) { }
! </pre>
! </blockquote>
! 
! <blockquote class="note">
! <p>
! An alternative formulation of the above would be:
! </p>
! <pre>
! <i>// 21.4.2, construct/copy/destroy:</i>
! basic_string() noexcept<ins>(is_nothrow_default_constructible&lt;Allocator&gt;{})</ins> : basic_string(Allocator()) { }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Change 23.3.6.1 [vector.overview] following p2, class template <tt>vector</tt> synopsis, as indicated: 
! (This change assumes that N4258 has been applied, as voted on in Urbana on 2014-11-08)</p>
! 
! <blockquote>
! <pre>
! <i>// 23.3.6.2, construct/copy/destroy:</i>
! vector() noexcept<ins>(noexcept(Allocator()))</ins> : vector(Allocator()) { }
! </pre>
! </blockquote>
! 
! <blockquote class="note">
! <p>
! An alternative formulation of the above would be:
! </p>
! <pre>
! <i>// 23.3.6.2, construct/copy/destroy:</i>
! vector() noexcept<ins>(is_nothrow_default_constructible&lt;Allocator&gt;{})</ins> : vector(Allocator()) { }
! </pre>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2458"></a>2458. N3778 and new library deallocation signatures</h3>
! <p><b>Section:</b> 18.6 [support.dynamic], 18.6.1.1 [new.delete.single], 18.6.1.2 [new.delete.array] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Richard Smith <b>Opened:</b> 2014-11-23 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3778.html">N3778</a> 
! added the following sized deallocation signatures to the library:
! </p>
! <blockquote><pre>
! void operator delete(void* ptr, std::size_t size) noexcept;
! void operator delete[](void* ptr, std::size_t size) noexcept;
! 
! void operator delete(void* ptr, std::size_t size, const std::nothrow_t&amp;) noexcept;
! void operator delete[](void* ptr, std::size_t size, const std::nothrow_t&amp;) noexcept;
! </pre></blockquote>
! <p>
! The former two are an essential part of the proposal. The latter two seem
! spurious &mdash; they are not called when <tt>new (std::nothrow) X</tt> fails due to
! <tt>X::X()</tt> throwing, because the core language rules for selecting a placement
! deallocation function do not consider passing a <tt>size</tt> argument. Instead, the
! above would be the matching deallocation functions for:
! </p>
! <blockquote><pre>
! void *operator new(std::size_t size, std::size_t size_again, const std::nothrow_t&amp;) noexcept;
! void *operator new[](std::size_t size, std::size_t size_again, const std::nothrow_t&amp;) noexcept;
! </pre></blockquote>
! <p>
! ... which don't exist.
! <p/>
! Since they're not implicitly called, the only other possible use for those
! functions would be to perform an explicitly non-throwing deallocation.
! But... the first two overloads are already explicitly non-throwing and are
! required to be semantically identical to the second two. So there's no
! point in making an explicit call to the second pair of functions either.
! <p/>
! It seems to me that we should remove the <tt>(void*, size_t, nothrow_t)</tt> overloads, because
! the core working group decided during the Urbana 2014 meeting, that no change to the core 
! language was warranted.
! </p>
! 
! <p><i>[2014-11-23, Daniel suggests concrete wording changes]</i></p>
! 
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! Nobody can call those overloads, since the nothrow allocation functions cannot throw. JY: Ship it. GR: Should we do due 
! diligence and make sure we're deleting what we mean to be deleting? [Some checking, everything looks good.]
! <p/>
! Accepted.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4140.</p>
! 
! <ol>
! <li><p>Change 18.6 [support.dynamic], header <tt>&lt;new&gt;</tt> synopsis, as indicated:</p>
! 
! <blockquote><pre>
! [&hellip;]
! void operator delete(void* ptr, std::size_t size) noexcept;
! <del>void operator delete(void* ptr, std::size_t size, const std::nothrow_t&amp;) noexcept;</del>
! [&hellip;]
! void operator delete[](void* ptr, std::size_t size) noexcept;
! <del>void operator delete[](void* ptr, std::size_t size, const std::nothrow_t&amp;) noexcept;</del>
! [&hellip;]
! </pre></blockquote>
! 
! </li>
! 
! <li><p>Change 18.6.1.1 [new.delete.single], starting before p19, as indicated:</p>
! <blockquote><pre>
! void operator delete(void* ptr, const std::nothrow_t&amp;) noexcept;
! <del>void operator delete(void* ptr, std::size_t size, const std::nothrow_t&amp;) noexcept;</del>
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -20- <i>Replaceable</i>: a C++ program may define a function with signature <tt>void operator delete(void*
! ptr, const std::nothrow_t&amp;) noexcept</tt> that displaces the default version defined by the C++ standard
! library. <del>If this function (without <tt>size</tt> parameter) is defined, the program should also define
! <tt>void operator delete(void* ptr, std::size_t size, const std::nothrow_t&amp;) noexcept</tt>. If
! this function with <tt>size</tt> parameter is defined, the program shall also define the version without the
! <tt>size</tt> parameter. [<i>Note</i>: The default behavior below may change in the future, which will require
! replacing both deallocation functions when replacing the allocation function. &mdash; <i>end note</i>]</del>
! <p/>
! [&hellip;]
! <p/>
! <del>-22- <i>Requires</i>: If present, the <tt>std::size_t size</tt> argument must equal the <tt>size</tt> 
! argument passed to the allocation function that returned <tt>ptr</tt>.</del>
! <p/>
! <del>-23- <i>Required behavior</i>: Calls to <tt>operator delete(void* ptr, std::size_t size, const std::nothrow_t&amp;)</tt> 
! may be changed to calls to <tt>operator delete(void* ptr, const std::nothrow_t&amp;)</tt> without affecting
! memory allocation. [<i>Note</i>: A conforming implementation is for <tt>operator delete(void* ptr, std::size_t size, 
! const std::nothrow_t&amp;)</tt> to simply call <tt>operator delete(void* ptr, const std::nothrow_t&amp;)</tt>. &mdash; 
! <i>end note</i>]</del>
! <p/>
! -24- <i>Default behavior</i>: <del><tt>operator delete(void* ptr, std::size_t size, const std::nothrow_t&amp;)</tt> 
! calls <tt>operator delete(ptr, std::nothrow)</tt>, and</del> <tt>operator delete(void* ptr, const std::nothrow_t&amp;)</tt> 
! calls <tt>operator delete(ptr)</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Change 18.6.1.2 [new.delete.array], starting before p16, as indicated:</p>
! <blockquote><pre>
! void operator delete[](void* ptr, const std::nothrow_t&amp;) noexcept;
! <del>void operator delete[](void* ptr, std::size_t size, const std::nothrow_t&amp;) noexcept;</del>
! </pre>
! <blockquote>
! <p>
! [&hellip;]
! <p/>
! -17- <i>Replaceable</i>: a C++ program may define a function with signature <tt>void operator delete[](void*
! ptr, const std::nothrow_t&amp;) noexcept</tt> that displaces the default version defined by the C++ standard
! library. <del>If this function (without <tt>size</tt> parameter) is defined, the program should also define <tt>void
! operator delete[](void* ptr, std::size_t size, const std::nothrow_t&amp;) noexcept</tt>. If this
! function with <tt>size</tt> parameter is defined, the program shall also define the version without the <tt>size</tt>
! parameter. [<i>Note</i>: The default behavior below may change in the future, which will require replacing
! both deallocation functions when replacing the allocation function. &mdash; <i>end note</i>]</del>
! <p/>
! [&hellip;]
! <p/>
! <del>-19- <i>Requires</i>: If present, the <tt>std::size_t size</tt> argument must equal the <tt>size</tt> argument 
! passed to the allocation function that returned <tt>ptr</tt>.</del> 
! <p/>
! <del>-20- <i>Required behavior</i>: Calls to <tt>operator delete[](void* ptr, std::size_t size, const std::nothrow_t&amp;)</tt> 
! may be changed to calls to <tt>operator delete[](void* ptr, const std::nothrow_t&amp;)</tt> without affecting memory allocation. 
! [<i>Note</i>: A conforming implementation is for <tt>operator delete[](void* ptr, std::size_t size, const std::nothrow_t&amp;)</tt> 
! to simply call <tt>operator delete[](void* ptr, const std::nothrow_t&amp;)</tt>. &mdash; <i>end note</i>]</del>
! <p/>
! -21- <i>Default behavior</i>: <del><tt>operator delete[](void* ptr, std::size_t size, const std::nothrow_t&amp;)</tt>
! calls <tt>operator delete[](ptr, std::nothrow)</tt>, and</del> <tt>operator delete[](void* ptr, const std::nothrow_t&amp;)</tt> 
! calls <tt>operator delete[](ptr)</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2459"></a>2459. <tt>std::polar</tt> should require a non-negative rho</h3>
! <p><b>Section:</b> 26.4.7 [complex.value.ops] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Marshall Clow <b>Opened:</b> 2014-10-22 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#complex.value.ops">issues</a> in [complex.value.ops].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Different implementations give different answers for the following code:
! </p>
! <blockquote><pre>
! #include &lt;iostream&gt;
! #include &lt;complex&gt;
! 
! int main ()
! {
!   std::cout &lt;&lt; std::polar(-1.0, -1.0) &lt;&lt; '\n';
!   return 0;
! }
! </pre></blockquote>
! <p>
! One implementation prints:
! </p>
! <blockquote><pre>
! (nan, nan)
! </pre></blockquote>
! <p>
! Another:
! </p>
! <blockquote><pre>
! (-0.243068, 0.243068)
! </pre></blockquote>
! <p>
! Which is correct? Or neither?
! <p/>
! In <a href="http://lists.cs.uiuc.edu/pipermail/cfe-dev/2013-November/033591.html">this list</a>, 
! Howard Hinnant wrote:
! </p>
! <blockquote class="note">
! <p>
! I've read this over several times.  I've consulted C++11, C11, and IEC 10967-3.  [snip]
! <p/>
! I'm finding:
! </p>
! <ol>
! <li><p>The magnitude of a complex number <tt>== abs(c) == hypot(c.real(), c.imag())</tt> and is always non-negative 
! (by all three of the above standards).</p></li>
! <li><p>Therefore no complex number exists for which <tt>abs(c) &lt; 0</tt>.</p></li>
! <li><p>Therefore when the first argument to <tt>std::polar</tt> (which is called <tt>rho</tt>) is negative, no complex number 
! can be formed which meets the post-conidtion that <tt>abs(c) == rho</tt>.</p>
! </li>
! </ol>
! <p>
! One could argue that this is already covered in 26.4 [complex.numbers]/3, but I think it's worth making explicit.
! </p>
! </blockquote>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! Discussion on whether theta should also be constrained.<br/> 
! TK: infinite theta doesn't make sense, whereas infinite rho does (theta is on a compact domain, rho is on a non-compact domain).<br/>
! AM: We already have a narrow contract, so I don't mind adding further requirements. Any objections to requiring that theta be finite?<br/>
! Some more discussion, but general consensus. Agreement that if someone finds the restrictions problematic, they should write 
! a proper paper to address how <tt>std::polar</tt> should behave. For now, we allow infinite rho (but not NaN and not negative), 
! and require finite theta. 
! <p/>
! No objections to tentatively ready.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Change 26.4.7 [complex.value.ops] around p9 as indicated</p>
! 
! <blockquote><pre>
! template&lt;class T&gt; complex&lt;T&gt; polar(const T&amp; rho, const T&amp; theta = 0);
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>rho</tt> shall be non-negative and non-NaN. <tt>theta</tt> shall be finite.</ins>
! <p/>
! -9- <i>Returns</i>: The complex value corresponding to a complex number whose magnitude is <tt>rho</tt> and whose
! phase angle is <tt>theta</tt>.
! </p>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2463"></a>2463. [fund.ts] Incorrect complexity for <tt>sample()</tt> algorithm</h3>
! <p><b>Section:</b> X [alg.random.sample] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Joe Gottman <b>Opened:</b> 2014-12-17 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p><b>Addresses: fund.ts</b></p>
! <p>
! According to paragraph 10.1 of the Library Fundamentals 1 draft, the complexity of the new 
! <tt>std::experimental::sample</tt> template function is O(<tt>n</tt>). Note that <tt>n</tt> is actually 
! a parameter of this function, corresponding to the sample size. But both common algorithms for 
! sampling, the selection algorithm and the reservoir algorithm, are linear with respect to the 
! population size, which is often many orders of magnitude bigger than the sample size.
! </p>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! AM: I suggest we make this a DR against the Fundamentals TS.<br/> 
! GR: Agreed, this is a no-brainer. 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4335 in regard to fundamental-ts changes.</p>
! 
! <ol>
! <li><p>Change X [alg.random.sample] p5 to read:</p>
! 
! <blockquote>
! <p>
! -5- <i>Complexity</i>: O(<tt><del>n</del><ins>last - first</ins></tt>). 
! </p>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2464"></a>2464. <tt>try_emplace</tt> and <tt>insert_or_assign</tt> misspecified</h3>
! <p><b>Section:</b> 23.4.4.4 [map.modifiers], 23.5.4.4 [unord.map.modifiers] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Thomas Koeppe <b>Opened:</b> 2014-12-17 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all other</b> <a href="lwg-index.html#map.modifiers">issues</a> in [map.modifiers].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! The specification of the <tt>try_emplace</tt> and <tt>insert_or_assign</tt> member functions in N4279 
! contains the following errors and omissions:
! </p>
! <ol>
! <li><p>In <tt>insert_or_assign</tt>, each occurrence of <tt>std::forward&lt;Args&gt;(args)...</tt> 
! should be <tt>std::forward&lt;M&gt;(obj)</tt>; this is was a mistake introduced in editing.</p></li>
! 
! <li><p>In <tt>try_emplace</tt>, the construction of the <tt>value_type</tt> is misspecified, which 
! is a mistake that was introduced during the evolution from a one-parameter to a variadic form. 
! As written, <tt>value_type(k, std::forward&lt;Args&gt;(args)...)</tt> does not do the right thing; 
! it can only be used with a single argument, which moreover must be convertible to a <tt>mapped_type</tt>. 
! The intention is to allow direct-initialization from an argument pack, and the correct constructor 
! should be <tt>value_type(piecewise_construct, forward_as_tuple(k), 
! forward_as_tuple(std::forward&lt;Args&gt;(args)...)</tt>.</p></li>
! 
! <li><p> Both <tt>try_emplace</tt> and <tt>insert_or_assign</tt> are missing requirements on the 
! argument types. Since the semantics of these functions are specified independent of other functions, 
! they need to include their requirements.</p></li>
! </ol>
! 
! <p><i>[2015-02, Cologne]</i></p>
! 
! <p>
! This issue is related to <a href="lwg-active.html#2469">2469</a>.
! <p/>
! AM: The repeated references to "first and third forms" and "second and fourth forms" is a bit cumbersome. 
! Maybe split the four functions?<br/>
! GR: We don't have precendent for "EmplaceConstructible from a, b, c". I don't like the ambiguity between code commas and 
! text commas.<br/> 
! TK: What's the danger?<br/> 
! GR: It's difficult to follow standardese.<br/>
! AM: It seems fine with code commas. What's the problem?<br/> 
! GR: It will lead to difficulties when we use a similar construction that's not at the end of a sentence.<br/> 
! AM: That's premature generalization. DK: When that happens, let's look at this again.<br/>
! AM: Clean up "if the map does contain"<br/>
! TK: Can we call both containers "map"? DK/GR: yes.<br/>
! TK will send updated wording to DK.
! <p/>
! Conclusion: Update wording, then poll for tentatively ready
! </p> 
! 
! <p><i>[2015-03-26, Thomas provides improved wording]</i></p>
! 
! <p>
! The approach is to split the descriptions of the various blocks of four functions into two blocks each so as to make 
! the wording easier to follow.
! </p>
! 
! <strong>Previous resolution [SUPERSEDED]:</strong>
! <blockquote class="note">
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Apply the following changes to section 23.4.4.4 [map.modifiers] p3:</p>
! 
! <blockquote>
! <pre>
! template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(const key_type&amp; k, Args&amp;&amp;... args);
! template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(key_type&amp;&amp; k, Args&amp;&amp;... args);
! template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, const key_type&amp; k, Args&amp;&amp;... args);
! template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, key_type&amp;&amp; k, Args&amp;&amp;... args);
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: For the first and third forms, <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into map
! from <tt>piecewise_construct</tt>, <tt>forward_as_tuple(k)</tt>, <tt>forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.
! For the second and fourth forms, <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into map
! from <tt>piecewise_construct</tt>, <tt>forward_as_tuple(move(k))</tt>, <tt>forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.</ins> 
! <p/>
! -3- <i>Effects</i>: <del>If the key <tt>k</tt> already exists in the map, there is no effect. Otherwise, inserts an element 
! into the map. In the first and third forms, the element is constructed from the arguments as <tt>value_type(k,
! std::forward&lt;Args&gt;(args)...)</tt>. In the second and fourth forms, the element is 
! constructed from the arguments as <tt>value_type(std::move(k), std::forward&lt;Args&gt;(args)...)</tt>. 
! In the first two overloads, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and only if the 
! insertion took place. The returned iterator points to the element of the map whose key is equivalent to <tt>k</tt></del>
! <ins>If the map does already contain an element whose key is equivalent to <tt>k</tt>, there is no effect.
! Otherwise for the first and third forms inserts a <tt>value_type</tt> object <tt>t</tt> constructed with
! <tt>piecewise_construct</tt>, <tt>forward_as_tuple(k)</tt>, <tt>forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>,
! for the second and fourth forms inserts a <tt>value_type</tt> object <tt>t</tt> constructed with
! <tt>piecewise_construct</tt>, <tt>forward_as_tuple(move(k))</tt>, <tt>forward_as_tuple(forward&lt;Args&gt;(args)...)</tt></ins>.
! <p/>
! <ins>-?- <i>Returns</i>: In the first two overloads, the <tt>bool</tt> component of the returned pair is <tt>true</tt> 
! if and only if the insertion took place. The returned iterator points to the map element whose key is equivalent to 
! <tt>k</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Apply the following changes to section 23.4.4.4 [map.modifiers] p5:</p>
! 
! <blockquote>
! <pre>
! template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(const key_type&amp; k, M&amp;&amp; obj);
! template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(key_type&amp;&amp; k, M&amp;&amp; obj);
! template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, const key_type&amp; k, M&amp;&amp; obj);
! template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, key_type&amp;&amp; k, M&amp;&amp; obj);
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>is_assignable&lt;mapped_type&amp;, M&amp;&amp;>::value</tt> shall be true.
! For the first and third forms, <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into map from <tt>k</tt>, 
! <tt>forward&lt;M&gt;(obj)</tt>. For the second and fourth forms, <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> 
! into map from <tt>move(k), forward&lt;M&gt;(obj)</tt>.</ins> 
! <p/>
! -5- <i>Effects</i>: <del>If the key <tt>k</tt> does not exist in the map, inserts an element into the map. In the first 
! and third forms, the element is constructed from the arguments as <tt>value_type(k, std::forward&lt;Args&gt;(args)...)</tt>. 
! In the second and fourth forms, the element is constructed from the arguments as <tt>value_type(std::move(k), 
! std::forward&lt;Args&gt;(args)...)</tt>. If the key already exists, <tt>std::forward&lt;M&gt;(obj)</tt> is assigned to the
! <tt>mapped_type</tt> corresponding to the key. In the first two overloads, the <tt>bool</tt> component of the returned
! value is true if and only if the insertion took place. The returned iterator points to the element that
! was inserted or updated</del>
! <ins>If the map does already contain an element whose key is equivalent to <tt>k</tt>,
! <tt>forward&lt;M&gt;(obj)</tt> is assigned to the <tt>mapped_type</tt> corresponding to the key.
! Otherwise the first and third forms inserts a <tt>value_type</tt> object <tt>t</tt> constructed with <tt>k</tt>, 
! <tt>forward&lt;M&gt;(obj)</tt>, the second and fourth forms inserts a <tt>value_type</tt> object <tt>t</tt> 
! constructed with <tt>move(k), forward&lt;M&gt;(obj)</tt></ins>.
! <p/>
! <ins>-?- <i>Returns</i>: In the first two overloads, the <tt>bool</tt> component of the returned pair is <tt>true</tt> 
! if and only if the insertion took place. The returned iterator points to the element of the map whose key is equivalent to 
! <tt>k</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Apply the following changes to section 23.5.4.4 [unord.map.modifiers] p5:</p>
! 
! <blockquote>
! <pre>
! template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(const key_type&amp; k, Args&amp;&amp;... args);
! template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(key_type&amp;&amp; k, Args&amp;&amp;... args);
! template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, const key_type&amp; k, Args&amp;&amp;... args);
! template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, key_type&amp;&amp; k, Args&amp;&amp;... args);
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: For the first and third forms, <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into unordered_map
! from <tt>piecewise_construct</tt>, <tt>forward_as_tuple(k)</tt>, <tt>forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.
! For the second and fourth forms, <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into unordered_map
! from <tt>piecewise_construct</tt>, <tt>forward_as_tuple(move(k))</tt>, <tt>forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.</ins> 
! <p/>
! -5- <i>Effects</i>: <del>If the key <tt>k</tt> already exists in the map, there is no effect. Otherwise, inserts an element 
! into the map. In the first and third forms, the element is constructed from the arguments as <tt>value_type(k,
! std::forward&lt;Args&gt;(args)...)</tt>. In the second and fourth forms, the element is 
! constructed from the arguments as <tt>value_type(std::move(k), std::forward&lt;Args&gt;(args)...)</tt>. 
! In the first two overloads, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and only if the 
! insertion took place. The returned iterator points to the element of the map whose key is equivalent to <tt>k</tt></del>
! <ins>If the unordered_map does already contain an element whose key is equivalent to <tt>k</tt>, there is no effect.
! Otherwise for the first and third forms inserts a <tt>value_type</tt> object <tt>t</tt> constructed with
! <tt>piecewise_construct</tt>, <tt>forward_as_tuple(k)</tt>, <tt>forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>,
! for the second and fourth forms inserts a <tt>value_type</tt> object <tt>t</tt> constructed with
! <tt>piecewise_construct</tt>, <tt>forward_as_tuple(move(k))</tt>, <tt>forward_as_tuple(forward&lt;Args&gt;(args)...)</tt></ins>.
! <p/>
! <ins>-?- <i>Returns</i>: In the first two overloads, the <tt>bool</tt> component of the returned pair is <tt>true</tt> 
! if and only if the insertion took place. The returned iterator points to the element of the unordered_map whose key is equivalent to 
! <tt>k</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Apply the following changes to section 23.5.4.4 [unord.map.modifiers] p7:</p>
! 
! <blockquote>
! <pre>
! template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(const key_type&amp; k, M&amp;&amp; obj);
! template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(key_type&amp;&amp; k, M&amp;&amp; obj);
! template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, const key_type&amp; k, M&amp;&amp; obj);
! template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, key_type&amp;&amp; k, M&amp;&amp; obj);
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>is_assignable&lt;mapped_type&amp;, M&amp;&amp;>::value</tt> shall be true.
! For the first and third forms, <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into unordered_map from <tt>k</tt>, 
! <tt>forward&lt;M&gt;(obj)</tt>. For the second and fourth forms, <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> 
! into unordered_map from <tt>move(k), forward&lt;M&gt;(obj)</tt>.</ins> 
! <p/>
! -7- <i>Effects</i>: <del>If the key <tt>k</tt> does not exist in the map, inserts an element into the map. 
! In the first and third forms, the element is constructed from the arguments as <tt>value_type(k, std::forward&lt;Args&gt;(args)...)</tt>. 
! In the second and fourth forms, the element is constructed from the arguments as <tt>value_type(std::move(k), 
! std::forward&lt;Args&gt;(args)...)</tt>. If the key already exists, <tt>std::forward&lt;M&gt;(obj)</tt> is assigned to the
! <tt>mapped_type</tt> corresponding to the key. In the first two overloads, the <tt>bool</tt> component of the returned
! value is true if and only if the insertion took place. The returned iterator points to the element that
! was inserted or updated</del>
! <ins>If the unordered_map does already contain an element whose key is equivalent to <tt>k</tt>,
! <tt>forward&lt;M&gt;(obj)</tt> is assigned to the <tt>mapped_type</tt> corresponding to the key.
! Otherwise the first and third forms inserts a <tt>value_type</tt> object <tt>t</tt> constructed with <tt>k</tt>, 
! <tt>forward&lt;M&gt;(obj)</tt>, the second and fourth forms inserts a <tt>value_type</tt> object <tt>t</tt> 
! constructed with <tt>move(k), forward&lt;M&gt;(obj)</tt></ins>.
! <p/>
! <ins>-?- <i>Returns</i>: In the first two overloads, the <tt>bool</tt> component of the returned pair is <tt>true</tt> 
! if and only if the insertion took place. The returned iterator points to the element of the unordered_map whose key is 
! equivalent to <tt>k</tt>.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! </blockquote>
! 
! <p><i>[2015-05, Lenexa]</i></p>
! 
! <p>
! STL: existing wording is horrible, this is Thomas' wording and his issue<br/>
! STL: already implemented the piecewise part<br/>
! MC: ok with changes<br/>
! STL: changes are mechanical<br/>
! STL: believe this is P1, it must be fixed, we have wording<br/>
! PJP: functions are sensible<br/>
! STL: has been implemented<br/>
! MC: consensus is to move to ready 
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Apply the following changes to 23.4.4.4 [map.modifiers] p3+p4:</p>
! 
! <blockquote>
! <pre>
! template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(const key_type&amp; k, Args&amp;&amp;... args);
! <del>template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(key_type&amp;&amp; k, Args&amp;&amp;... args);</del>
! template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, const key_type&amp; k, Args&amp;&amp;... args);
! <del>template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, key_type&amp;&amp; k, Args&amp;&amp;... args);</del>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>map</tt> from 
! <tt>piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.</ins> 
! <p/>
! -3- <i>Effects</i>: <del>If the key <tt>k</tt> already exists in the map, there is no effect. Otherwise, inserts an element 
! into the map. In the first and third forms, the element is constructed from the arguments as <tt>value_type(k,
! std::forward&lt;Args&gt;(args)...)</tt>. In the second and fourth forms, the element is 
! constructed from the arguments as <tt>value_type(std::move(k), std::forward&lt;Args&gt;(args)...)</tt>. 
! In the first two overloads, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and only if the 
! insertion took place. The returned iterator points to the element of the map whose key is equivalent to <tt>k</tt></del>
! <ins>If the map already contains an element whose key is equivalent to <tt>k</tt>, there is no effect. Otherwise inserts an 
! object of type <tt>value_type</tt> constructed with <tt>piecewise_construct, forward_as_tuple(k), 
! forward_as_tuple(forward&lt;Args&gt;(args)...)</tt></ins>.
! <p/>
! <ins>-?- <i>Returns</i>: In the first overload, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and only 
! if the insertion took place. The returned iterator points to the map element whose key is equivalent to <tt>k</tt>.</ins>
! <p/>
! -4- <i>Complexity</i>: The same as <tt>emplace</tt> and <tt>emplace_hint</tt>, respectively.
! </p>
! </blockquote>
! 
! <pre>
! <ins>template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(key_type&amp;&amp; k, Args&amp;&amp;... args);
! template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, key_type&amp;&amp; k, Args&amp;&amp;... args);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>map</tt> from 
! <tt>piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.</ins>
! <p/>
! <ins>-?- <i>Effects</i>: If the map already contains an element whose key is equivalent to <tt>k</tt>, there is no effect. 
! Otherwise inserts an object of type <tt>value_type</tt> constructed with <tt>piecewise_construct, forward_as_tuple(move(k)), 
! forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.</ins>
! <p/>
! <ins>-?- <i>Returns</i>: In the first overload, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and only 
! if the insertion took place. The returned iterator points to the map element whose key is equivalent to <tt>k</tt>.</ins>
! <p/>
! <ins>-?- <i>Complexity</i>: The same as <tt>emplace</tt> and <tt>emplace_hint</tt>, respectively.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Apply the following changes to 23.4.4.4 [map.modifiers] p5+p6:</p>
! 
! <blockquote>
! <pre>
! template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(const key_type&amp; k, M&amp;&amp; obj);
! <del>template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(key_type&amp;&amp; k, M&amp;&amp; obj);</del>
! template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, const key_type&amp; k, M&amp;&amp; obj);
! <del>template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, key_type&amp;&amp; k, M&amp;&amp; obj);</del>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>is_assignable&lt;mapped_type&amp;, M&amp;&amp;&gt;::value</tt> shall be <tt>true</tt>. 
! <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>map</tt> from <tt>k, forward&lt;M&gt;(obj)</tt>.</ins> 
! <p/>
! -5- <i>Effects</i>: <del>If the key <tt>k</tt> does not exist in the map, inserts an element into the map. In the first 
! and third forms, the element is constructed from the arguments as <tt>value_type(k, std::forward&lt;Args&gt;(args)...)</tt>. 
! In the second and fourth forms, the element is constructed from the arguments as <tt>value_type(std::move(k), 
! std::forward&lt;Args&gt;(args)...)</tt>. If the key already exists, <tt>std::forward&lt;M&gt;(obj)</tt> is assigned to the
! <tt>mapped_type</tt> corresponding to the key. In the first two overloads, the <tt>bool</tt> component of the returned
! value is true if and only if the insertion took place. The returned iterator points to the element that
! was inserted or updated</del>
! <ins>If the map already contains an element <tt>e</tt> whose key is equivalent to <tt>k</tt>, assigns <tt>forward&lt;M&gt;(obj)</tt> 
! to <tt>e.second</tt>. Otherwise inserts an object of type <tt>value_type</tt> constructed with <tt>k, forward&lt;M&gt;(obj)</tt></ins>.
! <p/>
! <ins>-?- <i>Returns</i>: In the first overload, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and 
! only if the insertion took place. The returned iterator points to the map element whose key is equivalent to <tt>k</tt>.</ins>
! <p/>
! -6- <i>Complexity</i>: The same as <tt>emplace</tt> and <tt>emplace_hint</tt>, respectively.
! </p>
! </blockquote>
! <pre>
! <ins>template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(key_type&amp;&amp; k, M&amp;&amp; obj);
! template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, key_type&amp;&amp; k, M&amp;&amp; obj);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>is_assignable&lt;mapped_type&amp;, M&amp;&amp;&gt;::value</tt> shall be <tt>true</tt>. 
! <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>map</tt> from <tt>move(k), forward&lt;M&gt;(obj)</tt>.</ins>
! <p/>
! <ins>-?- <i>Effects</i>: If the map already contains an element <tt>e</tt> whose key is equivalent to <tt>k</tt>, 
! assigns <tt>forward&lt;M&gt;(obj)</tt> to <tt>e.second</tt>. Otherwise inserts an object of type <tt>value_type</tt> 
! constructed with <tt>move(k), forward&lt;M&gt;(obj)</tt>.</ins>
! <p/>
! <ins>-?- <i>Returns</i>: In the first overload, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and only 
! if the insertion took place. The returned iterator points to the map element whose key is equivalent to <tt>k</tt>.</ins>
! <p/>
! <ins>-?- <i>Complexity</i>: The same as <tt>emplace</tt> and <tt>emplace_hint</tt>, respectively.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Apply the following changes to 23.5.4.4 [unord.map.modifiers] p5+p6:</p>
! 
! <blockquote>
! <pre>
! template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(const key_type&amp; k, Args&amp;&amp;... args);
! <del>template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(key_type&amp;&amp; k, Args&amp;&amp;... args);</del>
! template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, const key_type&amp; k, Args&amp;&amp;... args);
! <del>template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, key_type&amp;&amp; k, Args&amp;&amp;... args);</del>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>unordered_map</tt> from 
! <tt>piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.</ins> 
! <p/>
! -5- <i>Effects</i>: <del>If the key <tt>k</tt> already exists in the map, there is no effect. Otherwise, inserts an element 
! into the map. In the first and third forms, the element is constructed from the arguments as <tt>value_type(k,
! std::forward&lt;Args&gt;(args)...)</tt>. In the second and fourth forms, the element is 
! constructed from the arguments as <tt>value_type(std::move(k), std::forward&lt;Args&gt;(args)...)</tt>. 
! In the first two overloads, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and only if the 
! insertion took place. The returned iterator points to the element of the map whose key is equivalent to <tt>k</tt></del>
! <ins>If the map already contains an element whose key is equivalent to <tt>k</tt>, there is no effect. Otherwise inserts 
! an object of type <tt>value_type</tt> constructed with <tt>piecewise_construct, forward_as_tuple(k), 
! forward_as_tuple(forward&lt;Args&gt;(args)...)</tt></ins>.
! <p/>
! <ins>-?- <i>Returns</i>: In the first overload, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and only 
! if the insertion took place. The returned iterator points to the map element whose key is equivalent to <tt>k</tt>.</ins>
! <p/>
! -6- <i>Complexity</i>: The same as <tt>emplace</tt> and <tt>emplace_hint</tt>, respectively.
! </p>
! </blockquote>
! <pre>
! <ins>template &lt;class... Args&gt; pair&lt;iterator, bool&gt; try_emplace(key_type&amp;&amp; k, Args&amp;&amp;... args);
! template &lt;class... Args&gt; iterator try_emplace(const_iterator hint, key_type&amp;&amp; k, Args&amp;&amp;... args);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>unordered_map</tt> from 
! <tt>piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.</ins>
! <p/>
! <ins>-?- <i>Effects</i>: If the map already contains an element whose key is equivalent to <tt>k</tt>, there is no effect. 
! Otherwise inserts an object of type <tt>value_type</tt> constructed with <tt>piecewise_construct, forward_as_tuple(move(k)), 
! forward_as_tuple(forward&lt;Args&gt;(args)...)</tt>.</ins>
! <p/>
! <ins>-?- <i>Returns</i>: In the first overload, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if and only 
! if the insertion took place. The returned iterator points to the map element whose key is equivalent to <tt>k</tt>.</ins>
! <p/>
! <ins>-?- <i>Complexity</i>: The same as <tt>emplace</tt> and <tt>emplace_hint</tt>, respectively.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! <li><p>Apply the following changes to 23.5.4.4 [unord.map.modifiers] p7+p8:</p>
! 
! <blockquote>
! <pre>
! template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(const key_type&amp; k, M&amp;&amp; obj);
! <del>template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(key_type&amp;&amp; k, M&amp;&amp; obj);</del>
! template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, const key_type&amp; k, M&amp;&amp; obj);
! <del>template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, key_type&amp;&amp; k, M&amp;&amp; obj);</del>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>is_assignable&lt;mapped_type&amp;, M&amp;&amp;&gt;::value</tt> shall be <tt>true</tt>. 
! <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>unordered_map</tt> from <tt>k, 
! forward&lt;M&gt;(obj)</tt>.</ins> 
! <p/>
! -7- <i>Effects</i>: <del>If the key <tt>k</tt> does not exist in the map, inserts an element into the map. 
! In the first and third forms, the element is constructed from the arguments as <tt>value_type(k, std::forward&lt;Args&gt;(args)...)</tt>. 
! In the second and fourth forms, the element is constructed from the arguments as <tt>value_type(std::move(k), 
! std::forward&lt;Args&gt;(args)...)</tt>. If the key already exists, <tt>std::forward&lt;M&gt;(obj)</tt> is assigned to the
! <tt>mapped_type</tt> corresponding to the key. In the first two overloads, the <tt>bool</tt> component of the returned
! value is true if and only if the insertion took place. The returned iterator points to the element that
! was inserted or updated</del>
! <ins>If the map already contains an element <tt>e</tt> whose key is equivalent to <tt>k</tt>, assigns <tt>forward&lt;M&gt;(obj)</tt> 
! to <tt>e.second</tt>. Otherwise inserts an object of type <tt>value_type</tt> constructed with <tt>k, forward&lt;M&gt;(obj)</tt></ins>.
! <p/>
! <ins>-?- <i>Returns</i>: In the first overload, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if 
! and only if the insertion took place. The returned iterator points to the map element whose key is equivalent to <tt>k</tt>.</ins>
! <p/>
! -8- <i>Complexity</i>: The same as <tt>emplace</tt> and <tt>emplace_hint</tt>, respectively.
! </p>
! </blockquote>
! <pre>
! <ins>template &lt;class M&gt; pair&lt;iterator, bool&gt; insert_or_assign(key_type&amp;&amp; k, M&amp;&amp; obj);
! template &lt;class M&gt; iterator insert_or_assign(const_iterator hint, key_type&amp;&amp; k, M&amp;&amp; obj);</ins>
! </pre>
! <blockquote>
! <p>
! <ins>-?- <i>Requires</i>: <tt>is_assignable&lt;mapped_type&amp;, M&amp;&amp;&gt;::value</tt> shall be <tt>true</tt>. 
! <tt>value_type</tt> shall be <tt>EmplaceConstructible</tt> into <tt>unordered_map</tt> from <tt>move(k), 
! forward&lt;M&gt;(obj)</tt>.</ins>
! <p/>
! <ins>-?- <i>Effects</i>: If the map already contains an element <tt>e</tt> whose key is equivalent to <tt>k</tt>, 
! assigns <tt>forward&lt;M&gt;(obj)</tt> to <tt>e.second</tt>. Otherwise inserts an object of type <tt>value_type</tt> 
! constructed with <tt>move(k), forward&lt;M&gt;(obj)</tt>.</ins>
! <p/>
! <ins>-?- <i>Returns</i>:  In the first overload, the <tt>bool</tt> component of the returned pair is <tt>true</tt> if 
! and only if the insertion took place. The returned iterator points to the map element whose key is equivalent to 
! <tt>k</tt>.</ins>
! <p/>
! <ins>-?- <i>Complexity</i>: The same as <tt>emplace</tt> and <tt>emplace_hint</tt>, respectively.</ins>
! </p>
! </blockquote>
! </blockquote>
! </li>
! 
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2467"></a>2467. <tt>is_always_equal</tt> has slightly inconsistent default</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements], 20.7.8.1 [allocator.traits.types] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Howard Hinnant <b>Opened:</b> 2015-01-18 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! Table 28 &mdash; "Allocator requirements" says that <tt>X::is_always_equal</tt> has a default value 
! of <tt>is_empty&lt;X&gt;</tt>, and this is consistent with the return type description:
! </p>
! <blockquote>
! <p>
! Identical to or derived from <tt>true_type</tt> or <tt>false_type</tt>
! </p>
! </blockquote>
! <p>
! <tt>is_empty&lt;X&gt;</tt> is guaranteed to be derived from either <tt>true_type</tt> or <tt>false_type</tt>.  
! So far so good.
! <p/>
! 20.7.8.1 [allocator.traits.types]/p10 says:
! </p>
! <blockquote>
! <pre>
! typedef <i>see below</i> is_always_equal;
! </pre>
! <blockquote>
! <p>
! <i>Type</i>: <tt>Alloc::is_always_equal</tt> if the qualified-id <tt>Alloc::is_always_equal</tt> is valid and denotes a
! type (14.8.2); otherwise <tt>is_empty&lt;Alloc&gt;::type</tt>.
! </p>
! </blockquote>
! </blockquote>
! <p>
! This is subtly different than what Table 28 says is the default: <tt>is_empty&lt;Alloc&gt;::type</tt> is 
! not <tt>is_empty&lt;Alloc&gt;</tt>, but is rather one of <tt>true_type</tt> or <tt>false_type</tt>.
! <p/>
! There are two ways to fix this:
! </p>
! <ol>
! <li>
! <p>
! Change Table 28 to say: <tt>is_empty&lt;X&gt;<ins>::type</ins></tt>.
! <p/>
! or
! </p></li>
! 
! <li><p>Change 20.7.8.1 [allocator.traits.types]/p10:</p></li>
! <blockquote>
! <p>
! <i>Type</i>: <tt>Alloc::is_always_equal</tt> if the qualified-id <tt>Alloc::is_always_equal</tt> is valid and denotes a
! type (14.8.2); otherwise <tt>is_empty&lt;Alloc&gt;<del>::type</del></tt>.
! </p>
! </blockquote>
! </ol>
! <p>
! Both options are correct, and I see no reason to prefer one fix over the other. But Table 28 and 
! 20.7.8.1 [allocator.traits.types]/p10 should be consistent with one another.
! </p>
! 
! <p><i>[2015-02 Cologne]</i></p>
! 
! <p>
! DK: We should accept the first bullet. GR: Why does <tt>is_empty</tt> even have a type member? AM: All type traits 
! have a type member. I agree with DK's preference for the first type.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>
! This wording is relative to N4296.
! </p>
! 
! <ol>
! <li><p>Change 17.6.3.5 [allocator.requirements], Table 28 &mdash; "Allocator requirements" as presented:</p>
! 
! <blockquote>
! <table border="1">
! <caption>Table 28 &mdash; Allocator requirements</caption>
! <tr>
! <th>Expression</th>
! <th>Return type</th>
! <th>Assertion&#47;note<br/>pre-&#47;post-condition</th>
! <th>Default</th>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>X::is_always_equal</tt>
! </td>
! <td>
! Identical to or derived<br/>
! from <tt>true_type</tt> or<br/>
! <tt>false_type</tt>
! </td>
! <td>
! [&hellip;]
! </td>
! <td>
! <tt>is_empty&lt;X&gt;<ins>::type</ins></tt>
! </td>
! </tr>
! 
! <tr>
! <td colspan="4" align="center">
! <tt>&hellip;</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! 
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2470"></a>2470. Allocator's <tt>destroy</tt> function should be allowed to fail to instantiate</h3>
! <p><b>Section:</b> 17.6.3.5 [allocator.requirements] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Daniel Kr&uuml;gler <b>Opened:</b> 2015-03-22 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#allocator.requirements">active issues</a> in [allocator.requirements].</p>
! <p><b>View all other</b> <a href="lwg-index.html#allocator.requirements">issues</a> in [allocator.requirements].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! This issue is a spin-off of issue LWG <a href="lwg-active.html#2447">2447</a>: It focuses on the observation that
! 17.6.3.5 [allocator.requirements] p9 (based on the numbering of working draft N4296) gives 
! the template member <tt>construct</tt> more relaxations than the template member <tt>destroy</tt>:
! </p>
! <blockquote>
! <p>
! An allocator may constrain the types on which it can be instantiated and the arguments for which its
! <tt>construct</tt> member may be called. If a type cannot be used with a particular allocator, the allocator class
! or the call to <tt>construct</tt> may fail to instantiate.
! </p>
! </blockquote>
! <p>
! Construction and destruction of a type <tt>T</tt> are usually intimately related to each other, so it
! seems similarly useful to allow the <tt>destroy</tt> member to fail to instantiate for a possible sub-set
! of instantiation types.
! </p>
! 
! <p><i>[2015-04-01 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Change 17.6.3.5 [allocator.requirements] p9 as indicated:</p>
! 
! <blockquote><p>
! -8- An allocator may constrain the types on which it can be instantiated and the arguments for which its
! <tt>construct</tt> <ins>or <tt>destroy</tt></ins> member<ins>s</ins> may be called. If a type cannot be 
! used with a particular allocator, the allocator class or the call to <tt>construct</tt> <ins>or <tt>destroy</tt></ins> 
! may fail to instantiate.
! </p></blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2482"></a>2482. [c.strings] Table 73 mentions nonexistent functions</h3>
! <p><b>Section:</b> 21.8 [c.strings] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> S. B.Tam <b>Opened:</b> 2015-01-18 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View other</b> <a href="lwg-index-open.html#c.strings">active issues</a> in [c.strings].</p>
! <p><b>View all other</b> <a href="lwg-index.html#c.strings">issues</a> in [c.strings].</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! N4296 Table 73 mentions the functions <tt>mbsrtowc</tt> and <tt>wcsrtomb</tt>, which are not defined in ISO C 
! or ISO C++. Presumably they should be <tt>mbsrtowcs</tt> and <tt>wcsrtombs</tt> instead. 
! </p>
! 
! <p><i>[2015-04-02 Library reflector vote]</i></p>
! 
! <p>
! The issue has been identified as Tentatively Ready based on six votes in favour.
! </p>
! 
! 
! <p><b>Proposed resolution:</b></p>
! 
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li>
! <blockquote>
! <table border="1" cellpadding="4" rules="groups" style="table-layout:fixed">
! <caption>Table 33 &mdash; Potential <tt>mbstate_t</tt> data races</caption>
! <tr>
! <td>
! <tt>mbrlen</tt>
! </td>
! <td>
! <tt>mbrtowc</tt>
! </td>
! <td>
! <tt>mbsrtowc<ins>s</ins></tt>
! </td>
! <td>
! <tt>mbtowc</tt>
! </td>
! <td>
! <tt>wcrtomb</tt>
! </td>
! </tr>
! 
! <tr>
! <td>
! <tt>wcsrtomb<ins>s</ins></tt>
! </td>
! <td>
! <tt>wctomb</tt>
! </td>
! </tr>
! 
! </table>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! <hr>
! <h3><a name="2488"></a>2488. Placeholders should be allowed and encouraged to be <tt>constexpr</tt></h3>
! <p><b>Section:</b> 20.9.10.4 [func.bind.place] <b>Status:</b> <a href="lwg-active.html#WP">WP</a>
!  <b>Submitter:</b> Stephan T. Lavavej <b>Opened:</b> 2015-03-27 <b>Last modified:</b> 2015-05-22</p>
! <p><b>View all issues with</b> <a href="lwg-status.html#WP">WP</a> status.</p>
! <p><b>Discussion:</b></p>
! <p>
! <tt>piecewise_construct</tt> (20.3.5 [pair.piecewise]), <tt>allocator_arg</tt> (20.7.6 [allocator.tag]), 
! and <tt>adopt_lock</tt>/<tt>defer_lock</tt>/<tt>try_to_lock</tt> (30.4.2 [thread.lock]) are all required to be 
! <tt>constexpr</tt> with internal linkage. <tt>bind()</tt>'s placeholders should be allowed to follow this modern practice, 
! for increased consistency and reduced implementer headaches (header-only is easier than separately-compiled).
! </p>
! 
! <p><i>[2015-05-07 Lenexa: Move to Immediate]</i></p>
! 
! <p>STL: I'd like this one immediate.</p>
! <p>Jonathan: I want to think about forcing constexpr, but the current issue, I have no objections. I'd say ready, but I won't object to immediate if STL wants it.</p>
! <p>Marshall: You should report in Kona how it worked out.</p>
! <p>STL: We went around a bit on the reflector about how to phrase the encouragement.</p>
! <p>Jonathan: I think the shall may be not quite right.</p>
! <p>Marshall: I see, you can change your implementation, but you don't.</p>
! <p>Jonathan: There's precedent for the shall, but it's wrong, see editorial issue 493.</p>
! <p>STL: I would prefer not to ask Daniel to reword, and 493 can fix it later.</p>
! <p>Marshall: I remove my objection to immediate because it doesn't force implementations to change.</p>
! <p>Marshall: Any other discussion?</p>
! <p>Marshall: Immediate vote: 6. Opposed, 0. Abstain, 1.</p>
! 
! 
! 
! <p><b>Proposed resolution:</b></p>
! <p>This wording is relative to N4296.</p>
! 
! <ol>
! <li><p>Change 20.9 [function.objects] p2 "Header <tt>&lt;functional&gt;</tt> synopsis" as depicted:</p>
! 
! <blockquote>
! <pre>
! namespace placeholders {
!   <i>// M is the implementation-defined number of placeholders</i>
!   <ins><i>see below</i></ins><del>extern <i>unspecified</i></del> _1;
!   <ins><i>see below</i></ins><del>extern <i>unspecified</i></del> _2;
!   ...
!   <ins><i>see below</i></ins><del>extern <i>unspecified</i></del> _M;
! }
! </pre>
! </blockquote>
! </li>
! 
! <li><p>Change 20.9.10.4 [func.bind.place] p2 as depicted:</p>
! 
! <blockquote>
! <pre>
! namespace std::placeholders {
!   <i>// M is the implementation-defined number of placeholders</i>
!   <ins><i>see below</i></ins><del>extern <i>unspecified</i></del> _1;
!   <ins><i>see below</i></ins><del>extern <i>unspecified</i></del> _2;
!              .
!              .
!              .
!   <ins><i>see below</i></ins><del>extern <i>unspecified</i></del> _M;
! }
! </pre>
! <p>
! -1- All placeholder types shall be <tt>DefaultConstructible</tt> and <tt>CopyConstructible</tt>, and 
! their default constructors and copy/move constructors shall not throw exceptions. It is 
! implementation-defined whether placeholder types are <tt>CopyAssignable</tt>. <tt>CopyAssignable</tt> 
! placeholders' copy assignment operators shall not throw exceptions.
! <p/>
! <ins>-?- Placeholders should be defined as:</ins>
! </p>
! <blockquote>
! <pre>
! <ins>constexpr <i>unspecified</i> _1{};</ins>
! </pre>
! </blockquote>
! <p>
! <ins>If they are not, they shall be declared as:</ins>
! </p>
! <blockquote>
! <pre>
! <ins>extern <i>unspecified</i> _1;</ins>
! </pre>
! </blockquote>
! </blockquote>
! </li>
! </ol>
! 
! 
! 
! 
! 
! 
! </body>
! </html>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/faq.html gcc-5.5.0/libstdc++-v3/doc/html/faq.html
*** gcc-5.4.0/libstdc++-v3/doc/html/faq.html	Mon Jun  9 14:47:17 2014
--- gcc-5.5.0/libstdc++-v3/doc/html/faq.html	Fri Jun 16 12:55:17 2017
***************
*** 862,868 ****
      details than for C, and most CPU designers (for good reasons elaborated
      below) have not stepped up to publish C++ ABIs.  Such an ABI has been
      defined for the Itanium architecture (see
!     <a class="link" href="http://www.codesourcery.com/cxx-abi/" target="_top">C++
      ABI for Itanium</a>) and that is used by G++ and other compilers
      as the de facto standard ABI on many common architectures (including x86).
      G++ can also use the ARM architecture's EABI, for embedded
--- 862,868 ----
      details than for C, and most CPU designers (for good reasons elaborated
      below) have not stepped up to publish C++ ABIs.  Such an ABI has been
      defined for the Itanium architecture (see
!     <a class="link" href="http://mentorembedded.github.io/cxx-abi/" target="_top">C++
      ABI for Itanium</a>) and that is used by G++ and other compilers
      as the de facto standard ABI on many common architectures (including x86).
      G++ can also use the ARM architecture's EABI, for embedded
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/manual/abi.html gcc-5.5.0/libstdc++-v3/doc/html/manual/abi.html
*** gcc-5.4.0/libstdc++-v3/doc/html/manual/abi.html	Tue Dec  8 14:00:31 2015
--- gcc-5.5.0/libstdc++-v3/doc/html/manual/abi.html	Thu May 18 15:31:02 2017
***************
*** 20,26 ****
    virtual functions, etc. These details are defined as the compiler
    Application Binary Interface, or ABI. The GNU C++ compiler uses an
    industry-standard C++ ABI starting with version 3. Details can be
!   found in the <a class="link" href="http://mentorembedded.github.com/cxx-abi/abi.html" target="_top">ABI
    specification</a>.
  </p><p>
   The GNU C++ compiler, g++, has a compiler command line option to
--- 20,26 ----
    virtual functions, etc. These details are defined as the compiler
    Application Binary Interface, or ABI. The GNU C++ compiler uses an
    industry-standard C++ ABI starting with version 3. Details can be
!   found in the <a class="link" href="http://mentorembedded.github.io/cxx-abi/abi.html" target="_top">ABI
    specification</a>.
  </p><p>
   The GNU C++ compiler, g++, has a compiler command line option to
*************** compatible.
*** 153,164 ****
      was released, in compressed ISO date format, as an unsigned long.
      </p><p>
      This macro is defined in the file "c++config" in the
!     "libstdc++-v3/include/bits" directory. (Up to GCC 4.1.0, it was
!     changed every night by an automated script. Since GCC 4.1.0, it is
!     the same value as gcc/DATESTAMP.)
      </p><p>
      It is versioned as follows:
!     </p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>GCC 3.0.0: 20010615</p></li><li class="listitem"><p>GCC 3.0.1: 20010819</p></li><li class="listitem"><p>GCC 3.0.2: 20011023</p></li><li class="listitem"><p>GCC 3.0.3: 20011220</p></li><li class="listitem"><p>GCC 3.0.4: 20020220</p></li><li class="listitem"><p>GCC 3.1.0: 20020514</p></li><li class="listitem"><p>GCC 3.1.1: 20020725</p></li><li class="listitem"><p>GCC 3.2.0: 20020814</p></li><li class="listitem"><p>GCC 3.2.1: 20021119</p></li><li class="listitem"><p>GCC 3.2.2: 20030205</p></li><li class="listitem"><p>GCC 3.2.3: 20030422</p></li><li class="listitem"><p>GCC 3.3.0: 20030513</p></li><li class="listitem"><p>GCC 3.3.1: 20030804</p></li><li class="listitem"><p>GCC 3.3.2: 20031016</p></li><li class="listitem"><p>GCC 3.3.3: 20040214</p></li><li class="listitem"><p>GCC 3.4.0: 20040419</p></li><li class="listitem"><p>GCC 3.4.1: 20040701</p></li><li class="listitem"><p>GCC 3.4.2: 20040906</p></li><li class="listitem"><p>GCC 3.4.3: 20041105</p></li><li class="listitem"><p>GCC 3.4.4: 20050519</p></li><li class="listitem"><p>GCC 3.4.5: 20051201</p></li><li class="listitem"><p>GCC 3.4.6: 20060306</p></li><li class="listitem"><p>GCC 4.0.0: 20050421</p></li><li class="listitem"><p>GCC 4.0.1: 20050707</p></li><li class="listitem"><p>GCC 4.0.2: 20050921</p></li><li class="listitem"><p>GCC 4.0.3: 20060309</p></li><li class="listitem"><p>GCC 4.1.0: 20060228</p></li><li class="listitem"><p>GCC 4.1.1: 20060524</p></li><li class="listitem"><p>GCC 4.1.2: 20070214</p></li><li class="listitem"><p>GCC 4.2.0: 20070514</p></li><li class="listitem"><p>GCC 4.2.1: 20070719</p></li><li class="listitem"><p>GCC 4.2.2: 20071007</p></li><li class="listitem"><p>GCC 4.2.3: 20080201</p></li><li class="listitem"><p>GCC 4.2.4: 20080519</p></li><li class="listitem"><p>GCC 4.3.0: 20080306</p></li><li class="listitem"><p>GCC 4.3.1: 20080606</p></li><li class="listitem"><p>GCC 4.3.2: 20080827</p></li><li class="listitem"><p>GCC 4.3.3: 20090124</p></li><li class="listitem"><p>GCC 4.3.4: 20090804</p></li><li class="listitem"><p>GCC 4.3.5: 20100522</p></li><li class="listitem"><p>GCC 4.3.6: 20110627</p></li><li class="listitem"><p>GCC 4.4.0: 20090421</p></li><li class="listitem"><p>GCC 4.4.1: 20090722</p></li><li class="listitem"><p>GCC 4.4.2: 20091015</p></li><li class="listitem"><p>GCC 4.4.3: 20100121</p></li><li class="listitem"><p>GCC 4.4.4: 20100429</p></li><li class="listitem"><p>GCC 4.4.5: 20101001</p></li><li class="listitem"><p>GCC 4.4.6: 20110416</p></li><li class="listitem"><p>GCC 4.4.7: 20120313</p></li><li class="listitem"><p>GCC 4.5.0: 20100414</p></li><li class="listitem"><p>GCC 4.5.1: 20100731</p></li><li class="listitem"><p>GCC 4.5.2: 20101216</p></li><li class="listitem"><p>GCC 4.5.3: 20110428</p></li><li class="listitem"><p>GCC 4.5.4: 20120702</p></li><li class="listitem"><p>GCC 4.6.0: 20110325</p></li><li class="listitem"><p>GCC 4.6.1: 20110627</p></li><li class="listitem"><p>GCC 4.6.2: 20111026</p></li><li class="listitem"><p>GCC 4.6.3: 20120301</p></li><li class="listitem"><p>GCC 4.7.0: 20120322</p></li><li class="listitem"><p>GCC 4.7.1: 20120614</p></li><li class="listitem"><p>GCC 4.7.2: 20120920</p></li></ul></div><p></p></li><li class="listitem"><p>
      Incremental bumping of a library pre-defined macro,
      _GLIBCPP_VERSION. This macro is defined as the released version of
      the library, as a string literal. This is only implemented in
--- 153,185 ----
      was released, in compressed ISO date format, as an unsigned long.
      </p><p>
      This macro is defined in the file "c++config" in the
!     "libstdc++-v3/include/bits" directory. Up to GCC 4.1.0, it was
!     changed every night by an automated script. Since GCC 4.1.0 it is set
!     during configuration to the same value as
!     <code class="filename">gcc/DATESTAMP</code>, so for an official release its value
!     is the same as the date of the release, which is given in the <a class="link" href="https://gcc.gnu.org/develop.html#timeline" target="_top">GCC Release
!     Timeline</a>.
!     </p><p>
!     This macro is not useful for determining whether a particular feature is
!     supported by the version of libstdc++ you are using. The date of a release
!     might be after a feature was added to the development trunk, but the
!     release could be from an older branch. For example, in the 5.4.0 release
!     the macro has the value 20160603 which is greater than the 20160427 value
!     of the macro in the 6.1.0 release, but there are features supported in the
!     6.1.0 release that are not supported in 5.4.0 release.
!     You also can't test for the exact values listed below to try and
!     identify a release, because a snapshot taken from the gcc-5-branch on
!     2016-04-27 would have the same value for the macro as the 6.1.0 release
!     despite being a different version.
!     Many GNU/Linux distributions build their GCC packages from snapshots, so
!     the macro can have dates that doesn't correspond to official releases.
      </p><p>
      It is versioned as follows:
!     </p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>GCC 3.0.0: 20010615</p></li><li class="listitem"><p>GCC 3.0.1: 20010819</p></li><li class="listitem"><p>GCC 3.0.2: 20011023</p></li><li class="listitem"><p>GCC 3.0.3: 20011220</p></li><li class="listitem"><p>GCC 3.0.4: 20020220</p></li><li class="listitem"><p>GCC 3.1.0: 20020514</p></li><li class="listitem"><p>GCC 3.1.1: 20020725</p></li><li class="listitem"><p>GCC 3.2.0: 20020814</p></li><li class="listitem"><p>GCC 3.2.1: 20021119</p></li><li class="listitem"><p>GCC 3.2.2: 20030205</p></li><li class="listitem"><p>GCC 3.2.3: 20030422</p></li><li class="listitem"><p>GCC 3.3.0: 20030513</p></li><li class="listitem"><p>GCC 3.3.1: 20030804</p></li><li class="listitem"><p>GCC 3.3.2: 20031016</p></li><li class="listitem"><p>GCC 3.3.3: 20040214</p></li><li class="listitem"><p>GCC 3.4.0: 20040419</p></li><li class="listitem"><p>GCC 3.4.1: 20040701</p></li><li class="listitem"><p>GCC 3.4.2: 20040906</p></li><li class="listitem"><p>GCC 3.4.3: 20041105</p></li><li class="listitem"><p>GCC 3.4.4: 20050519</p></li><li class="listitem"><p>GCC 3.4.5: 20051201</p></li><li class="listitem"><p>GCC 3.4.6: 20060306</p></li><li class="listitem"><p>GCC 4.0.0: 20050421</p></li><li class="listitem"><p>GCC 4.0.1: 20050707</p></li><li class="listitem"><p>GCC 4.0.2: 20050921</p></li><li class="listitem"><p>GCC 4.0.3: 20060309</p></li><li class="listitem"><p>
!       GCC 4.1.0 and later: the GCC release date, as shown in the
!       <a class="link" href="https://gcc.gnu.org/develop.html#timeline" target="_top">GCC
!       Release Timeline</a>
!     </p></li></ul></div><p></p></li><li class="listitem"><p>
      Incremental bumping of a library pre-defined macro,
      _GLIBCPP_VERSION. This macro is defined as the released version of
      the library, as a string literal. This is only implemented in
*************** compatible.
*** 226,238 ****
      </p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="abi.versioning.active"></a>Checking Active</h4></div></div></div><p>
        When the GNU C++ library is being built with symbol versioning
        on, you should see the following at configure time for
!       libstdc++:
      </p><pre class="screen">
  <code class="computeroutput">
    checking versioning on shared library symbols... gnu
  </code>
  </pre><p>
-   or another of the supported styles.
    If you don't see this line in the configure output, or if this line
    appears but the last word is 'no', then you are out of luck.
  </p><p>
--- 247,258 ----
      </p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="abi.versioning.active"></a>Checking Active</h4></div></div></div><p>
        When the GNU C++ library is being built with symbol versioning
        on, you should see the following at configure time for
!       libstdc++ (showing either 'gnu' or another of the supported styles):
      </p><pre class="screen">
  <code class="computeroutput">
    checking versioning on shared library symbols... gnu
  </code>
  </pre><p>
    If you don't see this line in the configure output, or if this line
    appears but the last word is 'no', then you are out of luck.
  </p><p>
*************** class that would otherwise have implicit
*** 292,298 ****
  the way the compiler deals with this class in by-value return
  statements or parameters: instead of passing instances of this
  class in registers, the compiler will be forced to use memory. See the
! section on <a class="link" href="http://mentorembedded.github.com/cxx-abi/abi.html#calls" target="_top">Function
  Calling Conventions and APIs</a>
   of the C++ ABI documentation for further details.
  </p></li></ol></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="abi.impl"></a>Implementation</h3></div></div></div><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>
--- 312,318 ----
  the way the compiler deals with this class in by-value return
  statements or parameters: instead of passing instances of this
  class in registers, the compiler will be forced to use memory. See the
! section on <a class="link" href="http://mentorembedded.github.io/cxx-abi/abi.html#calls" target="_top">Function
  Calling Conventions and APIs</a>
   of the C++ ABI documentation for further details.
  </p></li></ol></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="abi.impl"></a>Implementation</h3></div></div></div><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>
*************** gcc test.c -g -O2 -L. -lone -ltwo /usr/l
*** 490,496 ****
  	  ABIcheck
  	</a>
        </em>. </span></p></div><div class="biblioentry"><a id="biblio.cxxabi"></a><p>[biblio.cxxabi] <span class="title"><em>
! 	<a class="link" href="http://www.codesourcery.com/cxx-abi/" target="_top">
  	  C++ ABI Summary
  	</a>
        </em>. </span></p></div><div class="biblioentry"><a id="id-1.3.6.3.6.10.4"></a><p><span class="title"><em>
--- 510,516 ----
  	  ABIcheck
  	</a>
        </em>. </span></p></div><div class="biblioentry"><a id="biblio.cxxabi"></a><p>[biblio.cxxabi] <span class="title"><em>
! 	<a class="link" href="http://mentorembedded.github.io/cxx-abi/" target="_top">
  	  C++ ABI Summary
  	</a>
        </em>. </span></p></div><div class="biblioentry"><a id="id-1.3.6.3.6.10.4"></a><p><span class="title"><em>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/manual/bugs.html gcc-5.5.0/libstdc++-v3/doc/html/manual/bugs.html
*** gcc-5.4.0/libstdc++-v3/doc/html/manual/bugs.html	Tue Oct 14 17:24:38 2014
--- gcc-5.5.0/libstdc++-v3/doc/html/manual/bugs.html	Mon Oct 17 17:03:50 2016
***************
*** 259,264 ****
--- 259,267 ----
      </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#438" target="_top">438</a>:
  	<span class="emphasis"><em>Ambiguity in the "do the right thing" clause</em></span>
      </span></dt><dd><p>Implement the resolution, basically cast less.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#445" target="_top">445</a>:
+ 	<span class="emphasis"><em>iterator_traits::reference unspecified for some iterator categories</em></span>
+     </span></dt><dd><p>Change <code class="code">istreambuf_iterator::reference</code> in C++11 mode.
      </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#453" target="_top">453</a>:
  	<span class="emphasis"><em>basic_stringbuf::seekoff need not always fail for an empty stream</em></span>
      </span></dt><dd><p>Don't fail if the next pointer is null and newoff is zero.
***************
*** 269,274 ****
--- 272,280 ----
  	<span class="emphasis"><em>Suggestion for new member functions in standard containers</em></span>
      </span></dt><dd><p>Add <code class="code">data()</code> to <code class="code">std::vector</code> and
  	<code class="code">at(const key_type&amp;)</code> to <code class="code">std::map</code>.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#467" target="_top">467</a>:
+ 	<span class="emphasis"><em>char_traits::lt(), compare(), and memcmp()</em></span>
+     </span></dt><dd><p>Change <code class="code">lt</code>.
      </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#508" target="_top">508</a>:
  	<span class="emphasis"><em>Bad parameters for ranlux64_base_01</em></span>
      </span></dt><dd><p>Fix the parameters.
***************
*** 348,351 ****
--- 354,427 ----
      </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#1339" target="_top">1339</a>:
         <span class="emphasis"><em>uninitialized_fill_n should return the end of its range</em></span>
      </span></dt><dd><p>Return the end of the filled range.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2049" target="_top">2049</a>:
+ 	<span class="emphasis"><em><code class="code">is_destructible</code> underspecified</em></span>
+     </span></dt><dd><p>Handle non-object types.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2056" target="_top">2056</a>:
+ 	<span class="emphasis"><em>future_errc enums start with value 0 (invalid value for broken_promise)</em></span>
+     </span></dt><dd><p>Reorder enumerators.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2059" target="_top">2059</a>:
+ 	<span class="emphasis"><em>C++0x ambiguity problem with map::erase</em></span>
+     </span></dt><dd><p>Add additional overloads.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2062" target="_top">2062</a>:
+ 	<span class="emphasis"><em>2062. Effect contradictions w/o no-throw guarantee of <code class="code">std::function</code> swaps</em></span>
+     </span></dt><dd><p>Add <code class="code">noexcept</code> to swap functions.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2063" target="_top">2063</a>:
+ 	<span class="emphasis"><em>Contradictory requirements for string move assignment</em></span>
+     </span></dt><dd><p>Respect propagation trait for move assignment.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2064" target="_top">2064</a>:
+ 	<span class="emphasis"><em>More noexcept issues in basic_string</em></span>
+     </span></dt><dd><p>Add noexcept to the comparison operators.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2067" target="_top">2067</a>:
+ 	<span class="emphasis"><em>packaged_task should have deleted copy c'tor with const parameter</em></span>
+     </span></dt><dd><p>Fix signatures.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2101" target="_top">2101</a>:
+ 	<span class="emphasis"><em>Some transformation types can produce impossible types</em></span>
+     </span></dt><dd><p>Use the referenceable type concept.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2106" target="_top">2106</a>:
+ 	<span class="emphasis"><em>move_iterator wrapping iterators returning prvalues</em></span>
+     </span></dt><dd><p>Change the <code class="code">reference</code> type.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2132" target="_top">2132</a>:
+ 	<span class="emphasis"><em><code class="code">std::function</code> ambiguity</em></span>
+     </span></dt><dd><p>Constrain the constructor to only accept callable types.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2141" target="_top">2141</a>:
+ 	<span class="emphasis"><em><code class="code">common_type</code> trait produces reference types</em></span>
+     </span></dt><dd><p>Use <code class="code">decay</code> for the result type.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2144" target="_top">2144</a>:
+ 	<span class="emphasis"><em>Missing <code class="code">noexcept</code> specification in <code class="code">type_index</code></em></span>
+     </span></dt><dd><p>Add <code class="code">noexcept</code>
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2145" target="_top">2145</a>:
+ 	<span class="emphasis"><em><code class="code">error_category</code> default constructor</em></span>
+     </span></dt><dd><p>Declare a public constexpr constructor.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2162" target="_top">2162</a>:
+ 	<span class="emphasis"><em><code class="code">allocator_traits::max_size</code> missing <code class="code">noexcept</code></em></span>
+     </span></dt><dd><p>Add <code class="code">noexcept</code>.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2187" target="_top">2187</a>:
+ 	<span class="emphasis"><em><code class="code">vector&lt;bool&gt;</code> is missing <code class="code">emplace</code> and <code class="code">emplace_back</code> member functions</em></span>
+     </span></dt><dd><p>Add <code class="code">emplace</code> and <code class="code">emplace_back</code> member functions.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2196" target="_top">2196</a>:
+ 	<span class="emphasis"><em>Specification of <code class="code">is_*[copy/move]_[constructible/assignable]</code> unclear for non-referencable types</em></span>
+     </span></dt><dd><p>Use the referenceable type concept.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2313" target="_top">2313</a>:
+ 	<span class="emphasis"><em><code class="code">tuple_size</code> should always derive from <code class="code">integral_constant&lt;size_t, N&gt;</code></em></span>
+     </span></dt><dd><p>Update definitions of the partial specializations for const and volatile types.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2329" target="_top">2329</a>:
+        <span class="emphasis"><em><code class="code">regex_match()/regex_search()</code> with <code class="code">match_results</code> should forbid temporary strings</em></span>
+     </span></dt><dd><p>Add deleted overloads for rvalue strings.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2332" target="_top">2332</a>:
+        <span class="emphasis"><em><code class="code">regex_iterator/regex_token_iterator</code> should forbid temporary regexes</em></span>
+     </span></dt><dd><p>Add deleted constructors.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2399" target="_top">2399</a>:
+ 	<span class="emphasis"><em><code class="code">shared_ptr</code>'s constructor from <code class="code">unique_ptr</code> should be constrained</em></span>
+     </span></dt><dd><p>Constrain the constructor to require convertibility.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2400" target="_top">2400</a>:
+ 	<span class="emphasis"><em><code class="code">shared_ptr</code>'s <code class="code">get_deleter()</code> should use <code class="code">addressof()</code></em></span>
+     </span></dt><dd><p>Use <code class="code">addressof</code>.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2401" target="_top">2401</a>:
+ 	<span class="emphasis"><em><code class="code">std::function</code> needs more <code class="code">noexcept</code></em></span>
+     </span></dt><dd><p>Add <code class="code">noexcept</code> to the assignment and comparisons.
+     </p></dd><dt><span class="term"><a class="link" href="../ext/lwg-defects.html#2455" target="_top">2455</a>:
+        <span class="emphasis"><em>Allocator default construction should be allowed to throw
+        </em></span>
+     </span></dt><dd><p>Make <code class="code">noexcept</code> specifications conditional.
      </p></dd></dl></div></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="license.html">Prev</a>Â </td><td width="20%" align="center"><a accesskey="u" href="status.html">Up</a></td><td width="40%" align="right">Â <a accesskey="n" href="setup.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">LicenseÂ </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top">Â ChapterÂ 2.Â Setup</td></tr></table></div></body></html>
\ No newline at end of file
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/manual/ext_demangling.html gcc-5.5.0/libstdc++-v3/doc/html/manual/ext_demangling.html
*** gcc-5.4.0/libstdc++-v3/doc/html/manual/ext_demangling.html	Tue Apr  2 00:09:44 2013
--- gcc-5.5.0/libstdc++-v3/doc/html/manual/ext_demangling.html	Wed Sep 13 10:10:44 2017
***************
*** 7,13 ****
      original C++ source identifiers is called
      <span class="quote">â€œ<span class="quote">demangling.</span>â€�</span>
    </p><p>
!     If you have read the <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a01115.html" target="_top">source
      documentation for <code class="code">namespace abi</code></a> then you are
      aware of the cross-vendor C++ ABI in use by GCC.  One of the
      exposed functions is used for demangling,
--- 7,13 ----
      original C++ source identifiers is called
      <span class="quote">â€œ<span class="quote">demangling.</span>â€�</span>
    </p><p>
!     If you have read the <a class="link" href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/namespaces.html" target="_top">source
      documentation for <code class="code">namespace abi</code></a> then you are
      aware of the cross-vendor C++ ABI in use by GCC.  One of the
      exposed functions is used for demangling,
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/manual/memory.html gcc-5.5.0/libstdc++-v3/doc/html/manual/memory.html
*** gcc-5.4.0/libstdc++-v3/doc/html/manual/memory.html	Mon Jun  9 14:47:17 2014
--- gcc-5.5.0/libstdc++-v3/doc/html/manual/memory.html	Fri Jun 16 12:55:17 2017
***************
*** 119,126 ****
         Over multiple iterations, various STL container
       objects have elements inserted to some maximum amount. A variety
       of allocators are tested.
!      Test source for <a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/sequence.cc?view=markup" target="_top">sequence</a>
!      and <a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/associative.cc?view=markup" target="_top">associative</a>
       containers.
         </p></li><li class="listitem"><p>
         Insertion and erasure in a multi-threaded environment.
--- 119,126 ----
         Over multiple iterations, various STL container
       objects have elements inserted to some maximum amount. A variety
       of allocators are tested.
!      Test source for <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/sequence.cc?view=markup" target="_top">sequence</a>
!      and <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/associative.cc?view=markup" target="_top">associative</a>
       containers.
         </p></li><li class="listitem"><p>
         Insertion and erasure in a multi-threaded environment.
***************
*** 129,142 ****
       on a per-thread basis, as well as measuring thread contention
       for memory resources.
       Test source
!     <a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert_erase/associative.cc?view=markup" target="_top">here</a>.
         </p></li><li class="listitem"><p>
  	 A threaded producer/consumer model.
         </p><p>
         Test source for
!      <a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/sequence.cc?view=markup" target="_top">sequence</a>
       and
!      <a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/associative.cc?view=markup" target="_top">associative</a>
       containers.
       </p></li></ol></div><p>
       The current default choice for
--- 129,142 ----
       on a per-thread basis, as well as measuring thread contention
       for memory resources.
       Test source
!     <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert_erase/associative.cc?view=markup" target="_top">here</a>.
         </p></li><li class="listitem"><p>
  	 A threaded producer/consumer model.
         </p><p>
         Test source for
!      <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/sequence.cc?view=markup" target="_top">sequence</a>
       and
!      <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/associative.cc?view=markup" target="_top">associative</a>
       containers.
       </p></li></ol></div><p>
       The current default choice for
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/manual/mt_allocator_impl.html gcc-5.5.0/libstdc++-v3/doc/html/manual/mt_allocator_impl.html
*** gcc-5.4.0/libstdc++-v3/doc/html/manual/mt_allocator_impl.html	Tue Apr  2 00:09:44 2013
--- gcc-5.5.0/libstdc++-v3/doc/html/manual/mt_allocator_impl.html	Fri Jun 16 12:55:17 2017
*************** containers, this works, as an instance o
*** 155,160 ****
  as part of a container's constructor. However, this assumption is
  implementation-specific, and subject to change. For an example of a
  pool that frees memory, see the following
!     <a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/ext/mt_allocator/deallocate_local-6.cc?view=markup" target="_top">
      example.</a>
  </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="mt_allocator_design.html">Prev</a>Â </td><td width="20%" align="center"><a accesskey="u" href="mt_allocator.html">Up</a></td><td width="40%" align="right">Â <a accesskey="n" href="mt_allocator_ex_single.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Design IssuesÂ </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top">Â Single Thread Example</td></tr></table></div></body></html>
\ No newline at end of file
--- 155,160 ----
  as part of a container's constructor. However, this assumption is
  implementation-specific, and subject to change. For an example of a
  pool that frees memory, see the following
!     <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/ext/mt_allocator/deallocate_local-6.cc?view=markup" target="_top">
      example.</a>
  </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="mt_allocator_design.html">Prev</a>Â </td><td width="20%" align="center"><a accesskey="u" href="mt_allocator.html">Up</a></td><td width="40%" align="right">Â <a accesskey="n" href="mt_allocator_ex_single.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Design IssuesÂ </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top">Â Single Thread Example</td></tr></table></div></body></html>
\ No newline at end of file
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/manual/source_code_style.html gcc-5.5.0/libstdc++-v3/doc/html/manual/source_code_style.html
*** gcc-5.4.0/libstdc++-v3/doc/html/manual/source_code_style.html	Tue Apr  2 00:09:44 2013
--- gcc-5.5.0/libstdc++-v3/doc/html/manual/source_code_style.html	Fri Jun 16 12:55:17 2017
***************
*** 478,484 ****
  Â Â Â Â Â Â Examples:Â <code class="code">_S_max_elementsÂ Â _S_default_value</code><br />
  <br />
  Â Â Â Â Â Â Don'tÂ useÂ namesÂ inÂ theÂ sameÂ scopeÂ thatÂ differÂ onlyÂ inÂ theÂ prefix,<br />
! Â Â Â Â Â Â e.g.Â _S_topÂ andÂ _M_top.Â SeeÂ BADNAMESÂ forÂ aÂ listÂ ofÂ forbiddenÂ names.<br />
  Â Â Â Â Â Â (TheÂ mostÂ temptingÂ ofÂ theseÂ seemÂ toÂ beÂ andÂ "_T"Â andÂ "__sz".)<br />
  <br />
  Â Â Â Â Â Â NamesÂ mustÂ neverÂ haveÂ "__"Â internally;Â itÂ wouldÂ confuseÂ name<br />
--- 478,484 ----
  Â Â Â Â Â Â Examples:Â <code class="code">_S_max_elementsÂ Â _S_default_value</code><br />
  <br />
  Â Â Â Â Â Â Don'tÂ useÂ namesÂ inÂ theÂ sameÂ scopeÂ thatÂ differÂ onlyÂ inÂ theÂ prefix,<br />
! Â Â Â Â Â Â e.g.Â _S_topÂ andÂ _M_top.Â SeeÂ <a class="link" href="source_code_style.html#coding_style.bad_identifiers" title="Bad Identifiers">BADNAMES</a>Â forÂ aÂ listÂ ofÂ forbiddenÂ names.<br />
  Â Â Â Â Â Â (TheÂ mostÂ temptingÂ ofÂ theseÂ seemÂ toÂ beÂ andÂ "_T"Â andÂ "__sz".)<br />
  <br />
  Â Â Â Â Â Â NamesÂ mustÂ neverÂ haveÂ "__"Â internally;Â itÂ wouldÂ confuseÂ name<br />
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/manual/source_organization.html gcc-5.5.0/libstdc++-v3/doc/html/manual/source_organization.html
*** gcc-5.4.0/libstdc++-v3/doc/html/manual/source_organization.html	Tue Apr  2 00:09:44 2013
--- gcc-5.5.0/libstdc++-v3/doc/html/manual/source_organization.html	Fri Jun 16 12:55:17 2017
***************
*** 3,96 ****
    Contributing
    
  </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>
!     The unpacked source directory of libstdc++ contains the files
!     needed to create the GNU C++ Library.
!   </p><div class="literallayout"><p><br />
! ItÂ hasÂ subdirectories:<br />
! <br />
! Â Â doc<br />
! Â Â Â Â FilesÂ inÂ HTMLÂ andÂ textÂ formatÂ thatÂ documentÂ usage,Â quirksÂ ofÂ the<br />
! Â Â Â Â implementation,Â andÂ contributorÂ checklists.<br />
! <br />
! Â Â include<br />
! Â Â Â Â AllÂ headerÂ filesÂ forÂ theÂ C++Â libraryÂ areÂ withinÂ thisÂ directory,<br />
! Â Â Â Â moduloÂ specificÂ runtime-relatedÂ filesÂ thatÂ areÂ inÂ theÂ libsupc++<br />
! Â Â Â Â directory.<br />
! <br />
! Â Â Â Â include/std<br />
! Â Â Â Â Â Â FilesÂ meantÂ toÂ beÂ foundÂ byÂ #includeÂ &lt;name&gt;Â directivesÂ in<br />
! Â Â Â Â Â Â standard-conformingÂ userÂ programs.<br />
! <br />
! Â Â Â Â include/c<br />
! Â Â Â Â Â Â HeadersÂ intendedÂ toÂ directlyÂ includeÂ standardÂ CÂ headers.<br />
! Â Â Â Â Â Â [NB:Â thisÂ canÂ beÂ enabledÂ viaÂ --enable-cheaders=c]<br />
! <br />
! Â Â Â Â include/c_global<br />
! Â Â Â Â Â Â HeadersÂ intendedÂ toÂ includeÂ standardÂ CÂ headersÂ in<br />
! Â Â Â Â Â Â theÂ globalÂ namespace,Â andÂ putÂ selectÂ namesÂ intoÂ theÂ std::<br />
! Â Â Â Â Â Â namespace.Â Â [NB:Â thisÂ isÂ theÂ default,Â andÂ isÂ theÂ sameÂ as<br />
! Â Â Â Â Â Â --enable-cheaders=c_global]<br />
! <br />
! Â Â Â Â include/c_std<br />
! Â Â Â Â Â Â HeadersÂ intendedÂ toÂ includeÂ standardÂ CÂ headers<br />
! Â Â Â Â Â Â alreadyÂ inÂ namespaceÂ std,Â andÂ putÂ selectÂ namesÂ intoÂ theÂ std::<br />
! Â Â Â Â Â Â namespace.Â Â [NB:Â thisÂ isÂ theÂ sameÂ asÂ --enable-cheaders=c_std]<br />
! <br />
! Â Â Â Â include/bits<br />
! Â Â Â Â Â Â FilesÂ includedÂ byÂ standardÂ headersÂ andÂ byÂ otherÂ filesÂ in<br />
! Â Â Â Â Â Â theÂ bitsÂ directory.<br />
! <br />
! Â Â Â Â include/backward<br />
! Â Â Â Â Â Â HeadersÂ providedÂ forÂ backwardÂ compatibility,Â suchÂ asÂ &lt;iostream.h&gt;.<br />
! Â Â Â Â Â Â TheyÂ areÂ notÂ usedÂ inÂ thisÂ library.<br />
! <br />
! Â Â Â Â include/ext<br />
! Â Â Â Â Â Â HeadersÂ thatÂ defineÂ extensionsÂ toÂ theÂ standardÂ library.Â Â No<br />
! Â Â Â Â Â Â standardÂ headerÂ refersÂ toÂ anyÂ ofÂ them.<br />
! <br />
! Â Â scripts<br />
! Â Â Â Â ScriptsÂ thatÂ areÂ usedÂ duringÂ theÂ configure,Â build,Â make,Â orÂ test<br />
! Â Â Â Â process.<br />
! <br />
! Â Â src<br />
! Â Â Â Â FilesÂ thatÂ areÂ usedÂ inÂ constructingÂ theÂ library,Â butÂ areÂ not<br />
! Â Â Â Â installed.<br />
! <br />
! Â Â testsuites/[backward,Â demangle,Â ext,Â performance,Â thread,Â 17_*Â toÂ 30_*]<br />
! Â Â Â Â TestÂ programsÂ areÂ here,Â andÂ mayÂ beÂ usedÂ toÂ beginÂ toÂ exerciseÂ the<br />
! Â Â Â Â library.Â Â SupportÂ forÂ "makeÂ check"Â andÂ "makeÂ check-install"Â is<br />
! Â Â Â Â complete,Â andÂ runsÂ throughÂ allÂ theÂ subdirectoriesÂ hereÂ whenÂ this<br />
! Â Â Â Â commandÂ isÂ issuedÂ fromÂ theÂ buildÂ directory.Â Â PleaseÂ noteÂ that<br />
! Â Â Â Â "makeÂ check"Â requiresÂ DejaGNUÂ 1.4Â orÂ laterÂ toÂ beÂ installed.Â Â Please<br />
! Â Â Â Â noteÂ thatÂ "makeÂ check-script"Â callsÂ theÂ scriptÂ mkcheck,Â which<br />
! Â Â Â Â requiresÂ bash,Â andÂ whichÂ mayÂ needÂ theÂ pathsÂ toÂ bashÂ adjustedÂ to<br />
! Â Â Â Â workÂ properly,Â asÂ /bin/bashÂ isÂ assumed.<br />
! <br />
! OtherÂ subdirectoriesÂ containÂ variantÂ versionsÂ ofÂ certainÂ files<br />
! thatÂ areÂ meantÂ toÂ beÂ copiedÂ orÂ linkedÂ byÂ theÂ configureÂ script.<br />
! CurrentlyÂ theseÂ are:<br />
! <br />
! Â Â config/abi<br />
! Â Â config/cpu<br />
! Â Â config/io<br />
! Â Â config/locale<br />
! Â Â config/os<br />
! <br />
! InÂ addition,Â aÂ subdirectoryÂ holdsÂ theÂ convenienceÂ libraryÂ libsupc++.<br />
! <br />
! Â Â libsupc++<br />
! Â Â Â Â ContainsÂ theÂ runtimeÂ libraryÂ forÂ C++,Â includingÂ exception<br />
! Â Â Â Â handlingÂ andÂ memoryÂ allocationÂ andÂ deallocation,Â RTTI,Â terminate<br />
! Â Â Â Â handlers,Â etc.<br />
! <br />
! NoteÂ thatÂ glibcÂ alsoÂ hasÂ aÂ bits/Â subdirectory.Â Â WeÂ willÂ either<br />
! needÂ toÂ beÂ carefulÂ notÂ toÂ collideÂ withÂ namesÂ inÂ itsÂ bits/<br />
! directory;Â orÂ renameÂ bitsÂ toÂ (e.g.)Â cppbits/.<br />
! <br />
! InÂ filesÂ throughoutÂ theÂ system,Â linesÂ markedÂ withÂ anÂ "XXX"Â indicate<br />
! aÂ bugÂ orÂ incompletely-implementedÂ feature.Â Â LinesÂ markedÂ "XXXÂ MT"<br />
! indicateÂ aÂ placeÂ thatÂ mayÂ requireÂ attentionÂ forÂ multi-threadÂ safety.<br />
! Â Â </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="appendix_contributing.html">Prev</a>Â </td><td width="20%" align="center"><a accesskey="u" href="appendix_contributing.html">Up</a></td><td width="40%" align="right">Â <a accesskey="n" href="source_code_style.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">AppendixÂ A.Â 
    Contributing
    
  Â </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top">Â Coding Style</td></tr></table></div></body></html>
\ No newline at end of file
--- 3,99 ----
    Contributing
    
  </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>
!     The <code class="filename">libstdc++-v3</code> directory in the
!     GCC sources contains the files needed to create the GNU C++ Library.
!   </p><p>
! It has subdirectories:
! </p><div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="filename">doc</code></span></dt><dd>
!     Files in HTML and text format that document usage, quirks of the
!     implementation, and contributor checklists.
!     </dd><dt><span class="term"><code class="filename">include</code></span></dt><dd>
!     All header files for the C++ library are within this directory,
!     modulo specific runtime-related files that are in the libsupc++
!     directory.
! 
!     <div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="filename">include/std</code></span></dt><dd>
!       Files meant to be found by <code class="code">#include &lt;name&gt;</code> directives
!       in standard-conforming user programs.
!       </dd><dt><span class="term"><code class="filename">include/c</code></span></dt><dd>
!       Headers intended to directly include standard C headers.
!       [NB: this can be enabled via <code class="option">--enable-cheaders=c</code>]
!       </dd><dt><span class="term"><code class="filename">include/c_global</code></span></dt><dd>
!       Headers intended to include standard C headers in
!       the global namespace, and put select names into the <code class="code">std::</code>
!       namespace.  [NB: this is the default, and is the same as
!       <code class="option">--enable-cheaders=c_global</code>]
!       </dd><dt><span class="term"><code class="filename">include/c_std</code></span></dt><dd>
!       Headers intended to include standard C headers
!       already in namespace std, and put select names into the <code class="code">std::</code>
!       namespace.  [NB: this is the same as
!       <code class="option">--enable-cheaders=c_std</code>]
!       </dd><dt><span class="term"><code class="filename">include/bits</code></span></dt><dd>
!       Files included by standard headers and by other files in
!       the bits directory.
!       </dd><dt><span class="term"><code class="filename">include/backward</code></span></dt><dd>
!       Headers provided for backward compatibility, such as
!       <code class="filename">&lt;backward/hash_map&gt;</code>.
!       They are not used in this library.
!     </dd><dt><span class="term"><code class="filename">include/ext</code></span></dt><dd>
!       Headers that define extensions to the standard library.  No
!       standard header refers to any of them, in theory (there are some
!       exceptions).
!       </dd></dl></div></dd><dt><span class="term"><code class="filename">scripts</code></span></dt><dd>
!     Scripts that are used during the configure, build, make, or test
!     process.
!     </dd><dt><span class="term"><code class="filename">src</code></span></dt><dd>
!     Files that are used in constructing the library, but are not
!     installed.
! 
!     <div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="filename">src/c++98</code></span></dt><dd>
!     Source files compiled using <code class="option">-std=gnu++98</code>.
!       </dd><dt><span class="term"><code class="filename">src/c++11</code></span></dt><dd>
!     Source files compiled using <code class="option">-std=gnu++11</code>.
!       </dd><dt><span class="term"><code class="filename">src/filesystem</code></span></dt><dd>
!     Source files for the Filesystem TS.
!       </dd><dt><span class="term"><code class="filename">src/shared</code></span></dt><dd>
!     Source code included by other files under both
!     <code class="filename">src/c++98</code> and
!     <code class="filename">src/c++11</code></dd></dl></div></dd><dt><span class="term"><code class="filename">testsuites/[backward, demangle, ext, performance, thread, 17_* to 30_*]</code></span></dt><dd>
!     Test programs are here, and may be used to begin to exercise the
!     library.  Support for "make check" and "make check-install" is
!     complete, and runs through all the subdirectories here when this
!     command is issued from the build directory.  Please note that
!     "make check" requires DejaGnu 1.4 or later to be installed,
!     or for extra <a class="link" href="test.html#test.run.permutations" title="Permutations">permutations</a>
!     DejaGnu 1.5.3 or later.
!     </dd></dl></div><p>
! Other subdirectories contain variant versions of certain files
! that are meant to be copied or linked by the configure script.
! Currently these are:
! </p><div class="literallayout"><p><code class="filename">config/abi</code><br />
! <code class="filename">config/allocator</code><br />
! <code class="filename">config/cpu</code><br />
! <code class="filename">config/io</code><br />
! <code class="filename">config/locale</code><br />
! <code class="filename">config/os</code><br />
! </p></div><p>
! </p><p>
! In addition, a subdirectory holds the convenience library libsupc++.
! </p><div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="filename">libsupc++</code></span></dt><dd>
!     Contains the runtime library for C++, including exception
!     handling and memory allocation and deallocation, RTTI, terminate
!     handlers, etc.
!   </dd></dl></div><p>
! Note that glibc also has a <code class="filename">bits/</code>
! subdirectory.  We need to be careful not to collide with names in its
! <code class="filename">bits/</code> directory.
! Another solution would be to rename <code class="filename">bits</code>
! to (e.g.) <code class="filename">cppbits</code>.
! </p><p>
! In files throughout the system, lines marked with an "XXX" indicate
! a bug or incompletely-implemented feature.  Lines marked "XXX MT"
! indicate a place that may require attention for multi-thread safety.
! </p></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="appendix_contributing.html">Prev</a>Â </td><td width="20%" align="center"><a accesskey="u" href="appendix_contributing.html">Up</a></td><td width="40%" align="right">Â <a accesskey="n" href="source_code_style.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">AppendixÂ A.Â 
    Contributing
    
  Â </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top">Â Coding Style</td></tr></table></div></body></html>
\ No newline at end of file
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/html/manual/status.html gcc-5.5.0/libstdc++-v3/doc/html/manual/status.html
*** gcc-5.4.0/libstdc++-v3/doc/html/manual/status.html	Tue Dec  8 14:00:31 2015
--- gcc-5.5.0/libstdc++-v3/doc/html/manual/status.html	Fri Sep  1 12:15:44 2017
*************** options. The pre-defined symbol
*** 156,163 ****
  <code class="constant">__cplusplus</code> is used to check for the
  presence of the required flag.
  </p><p>
! This page describes the C++11 support in mainline GCC SVN, not in any
! particular release.
  </p><div class="table"><a id="table.cxx11_status"></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">
  	<span class="emphasis"><em>18</em></span>
        </td><td colspan="3" align="left">
--- 156,162 ----
  <code class="constant">__cplusplus</code> is used to check for the
  presence of the required flag.
  </p><p>
! This page describes the C++11 support in the GCC 5 series.
  </p><div class="table"><a id="table.cxx11_status"></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">
  	<span class="emphasis"><em>18</em></span>
        </td><td colspan="3" align="left">
*************** particular release.
*** 173,179 ****
        </td></tr><tr><td align="left">20.1</td><td align="left">General</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.2</td><td align="left">Utility components</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.2.1</td><td align="left">Operators</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.2.2</td><td align="left">Swap</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.2.3</td><td align="left"><code class="code">forward</code> and <code class="code">move</code> helpers</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.2.4</td><td align="left">Function template <code class="code">declval</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.3</td><td align="left">Pairs</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.3.1</td><td align="left">In general</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.3.2</td><td align="left">Class template <code class="code">pair</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.3.3</td><td align="left">Specialized algorithms</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.3.4</td><td align="left">Tuple-like access to <code class="code">pair</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.3.5</td><td align="left">Piecewise construction</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4</td><td align="left">Tuples</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.4.1</td><td align="left">In general</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.4.2</td><td align="left">Class template <code class="code">tuple</code></td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.4.2.1</td><td align="left">Construction</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.2</td><td align="left">Assignment</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.3</td><td align="left">Swap</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.4</td><td align="left">Tuple creation functions</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.5</td><td align="left">Tuple helper classes</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.6</td><td align="left">Element access</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.7</td><td align="left">Relational operators</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.8</td><td align="left">Tuple traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.9</td><td align="left">Tuple specialized algorithms</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5</td><td align="left">Class template <code class="code">bitset</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5.1</td><td align="left"><code class="code">bitset</code> constructors</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5.2</td><td align="left"><code class="code">bitset</code> members</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5.3</td><td align="left"><code class="code">bitset</code> hash support</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5.4</td><td align="left"><code class="code">bitset</code> operators</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6</td><td align="left">Memory</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.6.1</td><td align="left">In general</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.6.2</td><td align="left">Header <code class="code">&lt;memory&gt;</code> synopsis</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.6.3</td><td align="left">Pointer traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.6.4</td><td align="left">Pointer safety</td><td align="left">Partial</td><td align="left">Â </td></tr><tr><td align="left">20.6.5</td><td align="left">Align</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.6</td><td align="left">Allocator argument tag</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.7</td><td align="left"><code class="code">uses_allocator</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.8</td><td align="left">Allocator traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.9</td><td align="left">The default allocator</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.10</td><td align="left">Raw storage iterator</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.11</td><td align="left">Temporary buffers</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.12</td><td align="left">Specialized algorithms</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.6.12.1</td><td align="left"><code class="code">addressof</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.12.2</td><td align="left"><code class="code">uninitialized_copy</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.12.3</td><td align="left"><code class="code">uninitialized_fill</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.12.4</td><td align="left"><code class="code">uninitialized_fill_n</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.13</td><td align="left">C library</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7</td><td align="left">Smart pointers</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.7.1</td><td align="left">Class template <code class="code">unique_ptr</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2</td><td align="left">Shared-ownership pointers</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2.1</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">20.7.2.2</td><td align="left">Class template <code class="code">shared_ptr</code></td><td align="left">Y</td><td align="left">
  	  Uses code from
  	  <a class="link" href="http://www.boost.org/libs/smart_ptr/shared_ptr.htm" target="_top">boost::shared_ptr</a>.
!       </td></tr><tr><td align="left">20.7.2.3</td><td align="left">Class template <code class="code">weak_ptr</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2.4</td><td align="left">Class template <code class="code">emable_shared_from_this</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2.5</td><td align="left"><code class="code">shared_ptr</code> atomic access</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2.6</td><td align="left">Smart pointer hash support</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8</td><td align="left">Function objects</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.8.1</td><td align="left">Definitions</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.8.2</td><td align="left">Requirements</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.8.3</td><td align="left">Class template <code class="code">reference_wrapper</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.4</td><td align="left">Arithmetic operation</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.5</td><td align="left">Comparisons</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.6</td><td align="left">Logical operations</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.7</td><td align="left">Bitwise operations</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.8</td><td align="left">Negators</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.9</td><td align="left">Function template <code class="code">bind</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.10</td><td align="left">Function template <code class="code">mem_fn</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.11</td><td align="left">Polymorphic function wrappers</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.8.11.1</td><td align="left">Class <code class="code">bad_function_call</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.8.11.2</td><td align="left">Class template <code class="code">function</code></td><td align="left">Partial</td><td align="left">Missing allocator support</td></tr><tr><td align="left">20.8.12</td><td align="left">Class template <code class="code">hash</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9</td><td align="left">Metaprogramming and type traits</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.9.1</td><td align="left">Requirements</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.2</td><td align="left">Header <code class="code">&lt;type_traits&gt;</code> synopsis</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.9.3</td><td align="left">Helper classes</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.4</td><td align="left">Unary Type Traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.4.1</td><td align="left">Primary type categories</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.4.2</td><td align="left">Composite type traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.4.3</td><td align="left">Type properties</td><td align="left">Y</td><td align="left">Â </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">&lt;ratio&gt;</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><td align="left">20.11.5</td><td align="left">Class template <code class="code">duration</code></td><td align="left">Y</td><td align="left">Â </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><td align="left">20.12</td><td align="left">Scoped allocator adaptor</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.12.1</td><td align="left">Header <code class="code">&lt;scoped_allocator&gt;</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">
  	<span class="emphasis"><em>21</em></span>
        </td><td colspan="3" align="left">
  	<span class="emphasis"><em>Strings</em></span>
--- 172,178 ----
        </td></tr><tr><td align="left">20.1</td><td align="left">General</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.2</td><td align="left">Utility components</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.2.1</td><td align="left">Operators</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.2.2</td><td align="left">Swap</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.2.3</td><td align="left"><code class="code">forward</code> and <code class="code">move</code> helpers</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.2.4</td><td align="left">Function template <code class="code">declval</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.3</td><td align="left">Pairs</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.3.1</td><td align="left">In general</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.3.2</td><td align="left">Class template <code class="code">pair</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.3.3</td><td align="left">Specialized algorithms</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.3.4</td><td align="left">Tuple-like access to <code class="code">pair</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.3.5</td><td align="left">Piecewise construction</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4</td><td align="left">Tuples</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.4.1</td><td align="left">In general</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.4.2</td><td align="left">Class template <code class="code">tuple</code></td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.4.2.1</td><td align="left">Construction</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.2</td><td align="left">Assignment</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.3</td><td align="left">Swap</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.4</td><td align="left">Tuple creation functions</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.5</td><td align="left">Tuple helper classes</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.6</td><td align="left">Element access</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.7</td><td align="left">Relational operators</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.8</td><td align="left">Tuple traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.4.2.9</td><td align="left">Tuple specialized algorithms</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5</td><td align="left">Class template <code class="code">bitset</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5.1</td><td align="left"><code class="code">bitset</code> constructors</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5.2</td><td align="left"><code class="code">bitset</code> members</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5.3</td><td align="left"><code class="code">bitset</code> hash support</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.5.4</td><td align="left"><code class="code">bitset</code> operators</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6</td><td align="left">Memory</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.6.1</td><td align="left">In general</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.6.2</td><td align="left">Header <code class="code">&lt;memory&gt;</code> synopsis</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.6.3</td><td align="left">Pointer traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.6.4</td><td align="left">Pointer safety</td><td align="left">Partial</td><td align="left">Â </td></tr><tr><td align="left">20.6.5</td><td align="left">Align</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.6</td><td align="left">Allocator argument tag</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.7</td><td align="left"><code class="code">uses_allocator</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.8</td><td align="left">Allocator traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.9</td><td align="left">The default allocator</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.10</td><td align="left">Raw storage iterator</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.11</td><td align="left">Temporary buffers</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.12</td><td align="left">Specialized algorithms</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.6.12.1</td><td align="left"><code class="code">addressof</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.12.2</td><td align="left"><code class="code">uninitialized_copy</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.12.3</td><td align="left"><code class="code">uninitialized_fill</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.12.4</td><td align="left"><code class="code">uninitialized_fill_n</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.6.13</td><td align="left">C library</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7</td><td align="left">Smart pointers</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.7.1</td><td align="left">Class template <code class="code">unique_ptr</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2</td><td align="left">Shared-ownership pointers</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2.1</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">20.7.2.2</td><td align="left">Class template <code class="code">shared_ptr</code></td><td align="left">Y</td><td align="left">
  	  Uses code from
  	  <a class="link" href="http://www.boost.org/libs/smart_ptr/shared_ptr.htm" target="_top">boost::shared_ptr</a>.
!       </td></tr><tr><td align="left">20.7.2.3</td><td align="left">Class template <code class="code">weak_ptr</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2.4</td><td align="left">Class template <code class="code">emable_shared_from_this</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2.5</td><td align="left"><code class="code">shared_ptr</code> atomic access</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.7.2.6</td><td align="left">Smart pointer hash support</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8</td><td align="left">Function objects</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.8.1</td><td align="left">Definitions</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.8.2</td><td align="left">Requirements</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.8.3</td><td align="left">Class template <code class="code">reference_wrapper</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.4</td><td align="left">Arithmetic operation</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.5</td><td align="left">Comparisons</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.6</td><td align="left">Logical operations</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.7</td><td align="left">Bitwise operations</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.8</td><td align="left">Negators</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.9</td><td align="left">Function template <code class="code">bind</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.10</td><td align="left">Function template <code class="code">mem_fn</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.8.11</td><td align="left">Polymorphic function wrappers</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.8.11.1</td><td align="left">Class <code class="code">bad_function_call</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.8.11.2</td><td align="left">Class template <code class="code">function</code></td><td align="left">Partial</td><td align="left">Missing allocator support</td></tr><tr><td align="left">20.8.12</td><td align="left">Class template <code class="code">hash</code></td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9</td><td align="left">Metaprogramming and type traits</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.9.1</td><td align="left">Requirements</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.2</td><td align="left">Header <code class="code">&lt;type_traits&gt;</code> synopsis</td><td align="left">Â </td><td align="left">Â </td></tr><tr><td align="left">20.9.3</td><td align="left">Helper classes</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.4</td><td align="left">Unary Type Traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.4.1</td><td align="left">Primary type categories</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.4.2</td><td align="left">Composite type traits</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.9.4.3</td><td align="left">Type properties</td><td align="left">Y</td><td align="left">Â </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">&lt;ratio&gt;</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><td align="left">20.11.5</td><td align="left">Class template <code class="code">duration</code></td><td align="left">Y</td><td align="left">Â </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><td align="left">20.12</td><td align="left">Scoped allocator adaptor</td><td align="left">Y</td><td align="left">Â </td></tr><tr><td align="left">20.12.1</td><td align="left">Header <code class="code">&lt;scoped_allocator&gt;</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><td align="left">20.12.4</td><td align="left">Scoped allocator adaptor members</td><td align="left">Y</td><td align="left"></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">
  	<span class="emphasis"><em>21</em></span>
        </td><td colspan="3" align="left">
  	<span class="emphasis"><em>Strings</em></span>
*************** options. The pre-defined symbol
*** 335,342 ****
  <code class="constant">__cplusplus</code> is used to check for the
  presence of the required flag.
  </p><p>
! This page describes the C++14 and library TS support in mainline GCC SVN,
! not in any particular release.
  </p><div class="table"><a id="table.cxx14_status"></a><p class="title"><strong>TableÂ 1.3.Â C++ 2014 Implementation Status</strong></p><div class="table-contents"><table summary="C++ 2014 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">Paper</th><th align="left">Title</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left">
  	<a class="link" href="http://www.open-std.org/JTC1/sc22/WG21/docs/papers/2013/n3669.pdf" target="_top">
  	  N3669
--- 334,340 ----
  <code class="constant">__cplusplus</code> is used to check for the
  presence of the required flag.
  </p><p>
! This page describes the C++14 and library TS support in the GCC 5 series.
  </p><div class="table"><a id="table.cxx14_status"></a><p class="title"><strong>TableÂ 1.3.Â C++ 2014 Implementation Status</strong></p><div class="table-contents"><table summary="C++ 2014 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">Paper</th><th align="left">Title</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left">
  	<a class="link" href="http://www.open-std.org/JTC1/sc22/WG21/docs/papers/2013/n3669.pdf" target="_top">
  	  N3669
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/api.xml gcc-5.5.0/libstdc++-v3/doc/xml/api.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/api.xml	Sat Jun 14 20:22:10 2014
--- gcc-5.5.0/libstdc++-v3/doc/xml/api.xml	Tue Aug 23 12:23:16 2016
***************
*** 40,118 ****
  </para>
  
  <para>
!   The API documentation, rendered into HTML, can be viewed online:
  </para>
  
- <itemizedlist>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-3.4/index.html">for the 3.4 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-4.1/index.html">for the 4.1 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-4.2/index.html">for the 4.2 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-4.3/index.html">for the 4.3 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-html-USERS-4.4/index.html">for the 4.4 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-api-4.5/index.html">for the 4.5 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/libstdc++-api-4.6/index.html">for the 4.6 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/gcc-4.7.4/libstdc++/api/">for the 4.7.4 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/gcc-4.8.3/libstdc++/api/">for the 4.8.3 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/gcc-4.9.0/libstdc++/api/">for the 4.9.0 release
-       </link>
-     </para>
-   </listitem>
-   <listitem>
-     <para>
-       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/index.html">"the latest collection"
-       </link>
-       (For the main development tree; see the date on the first page.)
-     </para>
-   </listitem>
- </itemizedlist>
- 
  <para>
    The rendered HTML, as above, is also available for download on the
    gcc.gnu.org site in a directory located at
--- 40,54 ----
  </para>
  
  <para>
!   The API documentation, rendered into HTML, can be viewed online
!   <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/">for each GCC release</link>
!   and
!   <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/index.html">
!   for the main development tree
!   </link>
!   (see the date on the first page).
  </para>
  
  <para>
    The rendered HTML, as above, is also available for download on the
    gcc.gnu.org site in a directory located at
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/faq.xml gcc-5.5.0/libstdc++-v3/doc/xml/faq.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/faq.xml	Mon Jun  9 14:47:17 2014
--- gcc-5.5.0/libstdc++-v3/doc/xml/faq.xml	Sun Jan 22 16:05:45 2017
***************
*** 1230,1236 ****
      details than for C, and most CPU designers (for good reasons elaborated
      below) have not stepped up to publish C++ ABIs.  Such an ABI has been
      defined for the Itanium architecture (see
!     <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.codesourcery.com/cxx-abi/">C++
      ABI for Itanium</link>) and that is used by G++ and other compilers
      as the de facto standard ABI on many common architectures (including x86).
      G++ can also use the ARM architecture's EABI, for embedded
--- 1230,1236 ----
      details than for C, and most CPU designers (for good reasons elaborated
      below) have not stepped up to publish C++ ABIs.  Such an ABI has been
      defined for the Itanium architecture (see
!     <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://mentorembedded.github.io/cxx-abi/">C++
      ABI for Itanium</link>) and that is used by G++ and other compilers
      as the de facto standard ABI on many common architectures (including x86).
      G++ can also use the ARM architecture's EABI, for embedded
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/manual/abi.xml gcc-5.5.0/libstdc++-v3/doc/xml/manual/abi.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/manual/abi.xml	Tue Dec  8 14:00:31 2015
--- gcc-5.5.0/libstdc++-v3/doc/xml/manual/abi.xml	Thu May 18 15:31:02 2017
***************
*** 42,48 ****
    virtual functions, etc. These details are defined as the compiler
    Application Binary Interface, or ABI. The GNU C++ compiler uses an
    industry-standard C++ ABI starting with version 3. Details can be
!   found in the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://mentorembedded.github.com/cxx-abi/abi.html">ABI
    specification</link>.
  </para>
  
--- 42,48 ----
    virtual functions, etc. These details are defined as the compiler
    Application Binary Interface, or ABI. The GNU C++ compiler uses an
    industry-standard C++ ABI starting with version 3. Details can be
!   found in the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://mentorembedded.github.io/cxx-abi/abi.html">ABI
    specification</link>.
  </para>
  
*************** compatible.
*** 392,401 ****
  
      <para>
      This macro is defined in the file "c++config" in the
!     "libstdc++-v3/include/bits" directory. (Up to GCC 4.1.0, it was
!     changed every night by an automated script. Since GCC 4.1.0, it is
!     the same value as gcc/DATESTAMP.)
      </para>
      <para>
      It is versioned as follows:
      </para>
--- 392,423 ----
  
      <para>
      This macro is defined in the file "c++config" in the
!     "libstdc++-v3/include/bits" directory. Up to GCC 4.1.0, it was
!     changed every night by an automated script. Since GCC 4.1.0 it is set
!     during configuration to the same value as
!     <filename>gcc/DATESTAMP</filename>, so for an official release its value
!     is the same as the date of the release, which is given in the <link
!       xmlns:xlink="http://www.w3.org/1999/xlink"
!       xlink:href="https://gcc.gnu.org/develop.html#timeline">GCC Release
!     Timeline</link>.
      </para>
+ 
+     <para>
+     This macro is not useful for determining whether a particular feature is
+     supported by the version of libstdc++ you are using. The date of a release
+     might be after a feature was added to the development trunk, but the
+     release could be from an older branch. For example, in the 5.4.0 release
+     the macro has the value 20160603 which is greater than the 20160427 value
+     of the macro in the 6.1.0 release, but there are features supported in the
+     6.1.0 release that are not supported in 5.4.0 release.
+     You also can't test for the exact values listed below to try and
+     identify a release, because a snapshot taken from the gcc-5-branch on
+     2016-04-27 would have the same value for the macro as the 6.1.0 release
+     despite being a different version.
+     Many GNU/Linux distributions build their GCC packages from snapshots, so
+     the macro can have dates that doesn't correspond to official releases.
+     </para>
+ 
      <para>
      It is versioned as follows:
      </para>
*************** compatible.
*** 426,466 ****
      <listitem><para>GCC 4.0.1: 20050707</para></listitem>
      <listitem><para>GCC 4.0.2: 20050921</para></listitem>
      <listitem><para>GCC 4.0.3: 20060309</para></listitem>
!     <listitem><para>GCC 4.1.0: 20060228</para></listitem>
!     <listitem><para>GCC 4.1.1: 20060524</para></listitem>
!     <listitem><para>GCC 4.1.2: 20070214</para></listitem>
!     <listitem><para>GCC 4.2.0: 20070514</para></listitem>
!     <listitem><para>GCC 4.2.1: 20070719</para></listitem>
!     <listitem><para>GCC 4.2.2: 20071007</para></listitem>
!     <listitem><para>GCC 4.2.3: 20080201</para></listitem>
!     <listitem><para>GCC 4.2.4: 20080519</para></listitem>
!     <listitem><para>GCC 4.3.0: 20080306</para></listitem>
!     <listitem><para>GCC 4.3.1: 20080606</para></listitem>
!     <listitem><para>GCC 4.3.2: 20080827</para></listitem>
!     <listitem><para>GCC 4.3.3: 20090124</para></listitem>
!     <listitem><para>GCC 4.3.4: 20090804</para></listitem>
!     <listitem><para>GCC 4.3.5: 20100522</para></listitem>
!     <listitem><para>GCC 4.3.6: 20110627</para></listitem>
!     <listitem><para>GCC 4.4.0: 20090421</para></listitem>
!     <listitem><para>GCC 4.4.1: 20090722</para></listitem>
!     <listitem><para>GCC 4.4.2: 20091015</para></listitem>
!     <listitem><para>GCC 4.4.3: 20100121</para></listitem>
!     <listitem><para>GCC 4.4.4: 20100429</para></listitem>
!     <listitem><para>GCC 4.4.5: 20101001</para></listitem>
!     <listitem><para>GCC 4.4.6: 20110416</para></listitem>
!     <listitem><para>GCC 4.4.7: 20120313</para></listitem>
!     <listitem><para>GCC 4.5.0: 20100414</para></listitem>
!     <listitem><para>GCC 4.5.1: 20100731</para></listitem>
!     <listitem><para>GCC 4.5.2: 20101216</para></listitem>
!     <listitem><para>GCC 4.5.3: 20110428</para></listitem>
!     <listitem><para>GCC 4.5.4: 20120702</para></listitem>
!     <listitem><para>GCC 4.6.0: 20110325</para></listitem>
!     <listitem><para>GCC 4.6.1: 20110627</para></listitem>
!     <listitem><para>GCC 4.6.2: 20111026</para></listitem>
!     <listitem><para>GCC 4.6.3: 20120301</para></listitem>
!     <listitem><para>GCC 4.7.0: 20120322</para></listitem>
!     <listitem><para>GCC 4.7.1: 20120614</para></listitem>
!     <listitem><para>GCC 4.7.2: 20120920</para></listitem>
      </itemizedlist>
      <para/>
      </listitem>
--- 448,459 ----
      <listitem><para>GCC 4.0.1: 20050707</para></listitem>
      <listitem><para>GCC 4.0.2: 20050921</para></listitem>
      <listitem><para>GCC 4.0.3: 20060309</para></listitem>
!     <listitem><para>
!       GCC 4.1.0 and later: the GCC release date, as shown in the
!       <link xmlns:xlink="http://www.w3.org/1999/xlink"
!         xlink:href="https://gcc.gnu.org/develop.html#timeline">GCC
!       Release Timeline</link>
!     </para></listitem>
      </itemizedlist>
      <para/>
      </listitem>
*************** compatible.
*** 618,624 ****
      <para>
        When the GNU C++ library is being built with symbol versioning
        on, you should see the following at configure time for
!       libstdc++:
      </para>
  
  <screen>
--- 611,617 ----
      <para>
        When the GNU C++ library is being built with symbol versioning
        on, you should see the following at configure time for
!       libstdc++ (showing either 'gnu' or another of the supported styles):
      </para>
  
  <screen>
*************** compatible.
*** 628,634 ****
  </screen>
  
  <para>
-   or another of the supported styles.
    If you don't see this line in the configure output, or if this line
    appears but the last word is 'no', then you are out of luck.
  </para>
--- 621,626 ----
*************** class that would otherwise have implicit
*** 735,741 ****
  the way the compiler deals with this class in by-value return
  statements or parameters: instead of passing instances of this
  class in registers, the compiler will be forced to use memory. See the
! section on <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://mentorembedded.github.com/cxx-abi/abi.html#calls">Function
  Calling Conventions and APIs</link>
   of the C++ ABI documentation for further details.
  </para></listitem>
--- 727,733 ----
  the way the compiler deals with this class in by-value return
  statements or parameters: instead of passing instances of this
  class in registers, the compiler will be forced to use memory. See the
! section on <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://mentorembedded.github.io/cxx-abi/abi.html#calls">Function
  Calling Conventions and APIs</link>
   of the C++ ABI documentation for further details.
  </para></listitem>
*************** gcc test.c -g -O2 -L. -lone -ltwo /usr/l
*** 1093,1099 ****
      <biblioentry xml:id="biblio.cxxabi">
        <title>
  	<link xmlns:xlink="http://www.w3.org/1999/xlink"
! 	      xlink:href="http://www.codesourcery.com/cxx-abi/">
  	  C++ ABI Summary
  	</link>
        </title>
--- 1085,1091 ----
      <biblioentry xml:id="biblio.cxxabi">
        <title>
  	<link xmlns:xlink="http://www.w3.org/1999/xlink"
! 	      xlink:href="http://mentorembedded.github.io/cxx-abi/">
  	  C++ ABI Summary
  	</link>
        </title>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/manual/allocator.xml gcc-5.5.0/libstdc++-v3/doc/xml/manual/allocator.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/manual/allocator.xml	Mon Jun  9 14:47:17 2014
--- gcc-5.5.0/libstdc++-v3/doc/xml/manual/allocator.xml	Fri Jun 16 12:55:17 2017
***************
*** 185,192 ****
         Over multiple iterations, various STL container
       objects have elements inserted to some maximum amount. A variety
       of allocators are tested.
!      Test source for <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/sequence.cc?view=markup">sequence</link>
!      and <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/associative.cc?view=markup">associative</link>
       containers.
         </para>
  
--- 185,192 ----
         Over multiple iterations, various STL container
       objects have elements inserted to some maximum amount. A variety
       of allocators are tested.
!      Test source for <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/sequence.cc?view=markup">sequence</link>
!      and <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/associative.cc?view=markup">associative</link>
       containers.
         </para>
  
***************
*** 201,207 ****
       on a per-thread basis, as well as measuring thread contention
       for memory resources.
       Test source
!     <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert_erase/associative.cc?view=markup">here</link>.
         </para>
       </listitem>
  
--- 201,207 ----
       on a per-thread basis, as well as measuring thread contention
       for memory resources.
       Test source
!     <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert_erase/associative.cc?view=markup">here</link>.
         </para>
       </listitem>
  
***************
*** 211,219 ****
         </para>
         <para>
         Test source for
!      <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/sequence.cc?view=markup">sequence</link>
       and
!      <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/associative.cc?view=markup">associative</link>
       containers.
       </para>
       </listitem>
--- 211,219 ----
         </para>
         <para>
         Test source for
!      <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/sequence.cc?view=markup">sequence</link>
       and
!      <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/associative.cc?view=markup">associative</link>
       containers.
       </para>
       </listitem>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/manual/appendix_contributing.xml gcc-5.5.0/libstdc++-v3/doc/xml/manual/appendix_contributing.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/manual/appendix_contributing.xml	Fri May 30 19:26:15 2014
--- gcc-5.5.0/libstdc++-v3/doc/xml/manual/appendix_contributing.xml	Fri Jun 16 12:55:17 2017
***************
*** 198,293 ****
    
  
    <para>
!     The unpacked source directory of libstdc++ contains the files
!     needed to create the GNU C++ Library.
    </para>
  
!   <literallayout class="normal">
  It has subdirectories:
  
!   doc
      Files in HTML and text format that document usage, quirks of the
      implementation, and contributor checklists.
  
!   include
      All header files for the C++ library are within this directory,
      modulo specific runtime-related files that are in the libsupc++
      directory.
  
!     include/std
!       Files meant to be found by #include &lt;name&gt; directives in
!       standard-conforming user programs.
  
!     include/c
        Headers intended to directly include standard C headers.
!       [NB: this can be enabled via --enable-cheaders=c]
  
!     include/c_global
        Headers intended to include standard C headers in
!       the global namespace, and put select names into the std::
        namespace.  [NB: this is the default, and is the same as
!       --enable-cheaders=c_global]
  
!     include/c_std
        Headers intended to include standard C headers
!       already in namespace std, and put select names into the std::
!       namespace.  [NB: this is the same as --enable-cheaders=c_std]
  
!     include/bits
        Files included by standard headers and by other files in
        the bits directory.
  
!     include/backward
!       Headers provided for backward compatibility, such as &lt;iostream.h&gt;.
        They are not used in this library.
  
!     include/ext
        Headers that define extensions to the standard library.  No
!       standard header refers to any of them.
  
!   scripts
      Scripts that are used during the configure, build, make, or test
      process.
  
!   src
      Files that are used in constructing the library, but are not
      installed.
  
!   testsuites/[backward, demangle, ext, performance, thread, 17_* to 30_*]
      Test programs are here, and may be used to begin to exercise the
      library.  Support for "make check" and "make check-install" is
      complete, and runs through all the subdirectories here when this
      command is issued from the build directory.  Please note that
!     "make check" requires DejaGNU 1.4 or later to be installed.  Please
!     note that "make check-script" calls the script mkcheck, which
!     requires bash, and which may need the paths to bash adjusted to
!     work properly, as /bin/bash is assumed.
  
  Other subdirectories contain variant versions of certain files
  that are meant to be copied or linked by the configure script.
  Currently these are:
  
!   config/abi
!   config/cpu
!   config/io
!   config/locale
!   config/os
! 
  In addition, a subdirectory holds the convenience library libsupc++.
  
!   libsupc++
      Contains the runtime library for C++, including exception
      handling and memory allocation and deallocation, RTTI, terminate
      handlers, etc.
  
! Note that glibc also has a bits/ subdirectory.  We will either
! need to be careful not to collide with names in its bits/
! directory; or rename bits to (e.g.) cppbits/.
  
  In files throughout the system, lines marked with an "XXX" indicate
  a bug or incompletely-implemented feature.  Lines marked "XXX MT"
  indicate a place that may require attention for multi-thread safety.
!   </literallayout>
  
  </section>
  
--- 198,396 ----
    
  
    <para>
!     The <filename class="directory">libstdc++-v3</filename> directory in the
!     GCC sources contains the files needed to create the GNU C++ Library.
    </para>
  
! <para>
  It has subdirectories:
+ </para>
  
! <variablelist>
!   <varlistentry>
!   <term><filename class="directory">doc</filename></term>
!   <listitem>
      Files in HTML and text format that document usage, quirks of the
      implementation, and contributor checklists.
+     </listitem>
+   </varlistentry>
  
!   <varlistentry>
!   <term><filename class="directory">include</filename></term>
!   <listitem>
      All header files for the C++ library are within this directory,
      modulo specific runtime-related files that are in the libsupc++
      directory.
  
!     <variablelist>
!     <varlistentry>
!     <term><filename class="directory">include/std</filename></term>
!     <listitem>
!       Files meant to be found by <code>#include &lt;name&gt;</code> directives
!       in standard-conforming user programs.
!       </listitem>
!     </varlistentry>
  
!     <varlistentry>
!     <term><filename class="directory">include/c</filename></term>
!     <listitem>
        Headers intended to directly include standard C headers.
!       [NB: this can be enabled via <option>--enable-cheaders=c</option>]
!       </listitem>
!     </varlistentry>
  
!     <varlistentry>
!     <term><filename class="directory">include/c_global</filename></term>
!     <listitem>
        Headers intended to include standard C headers in
!       the global namespace, and put select names into the <code>std::</code>
        namespace.  [NB: this is the default, and is the same as
!       <option>--enable-cheaders=c_global</option>]
!       </listitem>
!     </varlistentry>
  
!     <varlistentry>
!     <term><filename class="directory">include/c_std</filename></term>
!     <listitem>
        Headers intended to include standard C headers
!       already in namespace std, and put select names into the <code>std::</code>
!       namespace.  [NB: this is the same as
!       <option>--enable-cheaders=c_std</option>]
!       </listitem>
!     </varlistentry>
  
!     <varlistentry>
!     <term><filename class="directory">include/bits</filename></term>
!     <listitem>
        Files included by standard headers and by other files in
        the bits directory.
+       </listitem>
+     </varlistentry>
  
!     <varlistentry>
!     <term><filename class="directory">include/backward</filename></term>
!     <listitem>
!       Headers provided for backward compatibility, such as
!       <filename class="headerfile">&lt;backward/hash_map&gt;</filename>.
        They are not used in this library.
+     </listitem>
+     </varlistentry>
  
!     <varlistentry>
!     <term><filename class="directory">include/ext</filename></term>
!     <listitem>
        Headers that define extensions to the standard library.  No
!       standard header refers to any of them, in theory (there are some
!       exceptions).
!       </listitem>
!     </varlistentry>
!     </variablelist>
!   </listitem>
!   </varlistentry>
  
!   <varlistentry>
!   <term><filename class="directory">scripts</filename></term>
!   <listitem>
      Scripts that are used during the configure, build, make, or test
      process.
+     </listitem>
+   </varlistentry>
  
!   <varlistentry>
!   <term><filename class="directory">src</filename></term>
!   <listitem>
      Files that are used in constructing the library, but are not
      installed.
  
!     <variablelist>
!     <varlistentry>
!     <term><filename class="directory">src/c++98</filename></term>
!     <listitem>
!     Source files compiled using <option>-std=gnu++98</option>.
!       </listitem>
!     </varlistentry>
! 
!     <varlistentry>
!     <term><filename class="directory">src/c++11</filename></term>
!     <listitem>
!     Source files compiled using <option>-std=gnu++11</option>.
!       </listitem>
!     </varlistentry>
! 
!     <varlistentry>
!     <term><filename class="directory">src/filesystem</filename></term>
!     <listitem>
!     Source files for the Filesystem TS.
!       </listitem>
!     </varlistentry>
! 
!     <varlistentry>
!     <term><filename class="directory">src/shared</filename></term>
!     <listitem>
!     Source code included by other files under both
!     <filename class="directory">src/c++98</filename> and
!     <filename class="directory">src/c++11</filename>
!       </listitem>
!     </varlistentry>
!     </variablelist>
!   </listitem>
!   </varlistentry>
! 
!   <varlistentry>
!   <term><filename class="directory">testsuites/[backward, demangle, ext, performance, thread, 17_* to 30_*]</filename></term>
!   <listitem>
      Test programs are here, and may be used to begin to exercise the
      library.  Support for "make check" and "make check-install" is
      complete, and runs through all the subdirectories here when this
      command is issued from the build directory.  Please note that
!     "make check" requires DejaGnu 1.4 or later to be installed,
!     or for extra <link linkend="test.run.permutations">permutations</link>
!     DejaGnu 1.5.3 or later.
!     </listitem>
!   </varlistentry>
! </variablelist>
  
+ <para>
  Other subdirectories contain variant versions of certain files
  that are meant to be copied or linked by the configure script.
  Currently these are:
+ <literallayout><filename class="directory">config/abi</filename>
+ <filename class="directory">config/allocator</filename>
+ <filename class="directory">config/cpu</filename>
+ <filename class="directory">config/io</filename>
+ <filename class="directory">config/locale</filename>
+ <filename class="directory">config/os</filename>
+ </literallayout>
+ </para>
  
! <para>
  In addition, a subdirectory holds the convenience library libsupc++.
+ </para>
  
! <variablelist>
! <varlistentry>
!   <term><filename class="directory">libsupc++</filename></term>
!   <listitem>
      Contains the runtime library for C++, including exception
      handling and memory allocation and deallocation, RTTI, terminate
      handlers, etc.
+   </listitem>
+ </varlistentry>
+ </variablelist>
  
! <para>
! Note that glibc also has a <filename class="directory">bits/</filename>
! subdirectory.  We need to be careful not to collide with names in its
! <filename class="directory">bits/</filename> directory.
! Another solution would be to rename <filename class="directory">bits</filename>
! to (e.g.) <filename class="directory">cppbits</filename>.
! </para>
  
+ <para>
  In files throughout the system, lines marked with an "XXX" indicate
  a bug or incompletely-implemented feature.  Lines marked "XXX MT"
  indicate a place that may require attention for multi-thread safety.
! </para>
  
  </section>
  
*************** indicate a place that may require attent
*** 780,786 ****
        Examples: <code>_S_max_elements  _S_default_value</code>
  
        Don't use names in the same scope that differ only in the prefix,
!       e.g. _S_top and _M_top. See BADNAMES for a list of forbidden names.
        (The most tempting of these seem to be and "_T" and "__sz".)
  
        Names must never have "__" internally; it would confuse name
--- 883,889 ----
        Examples: <code>_S_max_elements  _S_default_value</code>
  
        Don't use names in the same scope that differ only in the prefix,
!       e.g. _S_top and _M_top. See <link linkend="coding_style.bad_identifiers">BADNAMES</link> for a list of forbidden names.
        (The most tempting of these seem to be and "_T" and "__sz".)
  
        Names must never have "__" internally; it would confuse name
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/manual/extensions.xml gcc-5.5.0/libstdc++-v3/doc/xml/manual/extensions.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/manual/extensions.xml	Tue Dec  8 14:00:31 2015
--- gcc-5.5.0/libstdc++-v3/doc/xml/manual/extensions.xml	Wed Sep 13 10:10:44 2017
*************** get_temporary_buffer(5, (int*)0);
*** 502,508 ****
      <quote>demangling.</quote>
    </para>
    <para>
!     If you have read the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a01115.html">source
      documentation for <code>namespace abi</code></link> then you are
      aware of the cross-vendor C++ ABI in use by GCC.  One of the
      exposed functions is used for demangling,
--- 502,508 ----
      <quote>demangling.</quote>
    </para>
    <para>
!     If you have read the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/namespaces.html">source
      documentation for <code>namespace abi</code></link> then you are
      aware of the cross-vendor C++ ABI in use by GCC.  One of the
      exposed functions is used for demangling,
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/manual/intro.xml gcc-5.5.0/libstdc++-v3/doc/xml/manual/intro.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/manual/intro.xml	Tue Oct 14 17:24:38 2014
--- gcc-5.5.0/libstdc++-v3/doc/xml/manual/intro.xml	Mon Oct 17 17:03:31 2016
*************** requirements of the license of GCC.
*** 640,645 ****
--- 640,651 ----
      <listitem><para>Implement the resolution, basically cast less.
      </para></listitem></varlistentry>
  
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#445">445</link>:
+ 	<emphasis>iterator_traits::reference unspecified for some iterator categories</emphasis>
+     </term>
+     <listitem><para>Change <code>istreambuf_iterator::reference</code> in C++11 mode.
+     </para></listitem></varlistentry>
+ 
      <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#453">453</link>:
  	<emphasis>basic_stringbuf::seekoff need not always fail for an empty stream</emphasis>
      </term>
*************** requirements of the license of GCC.
*** 659,664 ****
--- 665,676 ----
  	<code>at(const key_type&amp;)</code> to <code>std::map</code>.
      </para></listitem></varlistentry>
  
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#467">467</link>:
+ 	<emphasis>char_traits::lt(), compare(), and memcmp()</emphasis>
+     </term>
+     <listitem><para>Change <code>lt</code>.
+     </para></listitem></varlistentry>
+ 
      <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#508">508</link>:
  	<emphasis>Bad parameters for ranlux64_base_01</emphasis>
      </term>
*************** requirements of the license of GCC.
*** 810,815 ****
--- 822,967 ----
      <listitem><para>Return the end of the filled range.
      </para></listitem></varlistentry>
  
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2049">2049</link>:
+ 	<emphasis><code>is_destructible</code> underspecified</emphasis>
+     </term>
+     <listitem><para>Handle non-object types.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2056">2056</link>:
+ 	<emphasis>future_errc enums start with value 0 (invalid value for broken_promise)</emphasis>
+     </term>
+     <listitem><para>Reorder enumerators.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2059">2059</link>:
+ 	<emphasis>C++0x ambiguity problem with map::erase</emphasis>
+     </term>
+     <listitem><para>Add additional overloads.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2062">2062</link>:
+ 	<emphasis>2062. Effect contradictions w/o no-throw guarantee of <code>std::function</code> swaps</emphasis>
+     </term>
+     <listitem><para>Add <code>noexcept</code> to swap functions.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2063">2063</link>:
+ 	<emphasis>Contradictory requirements for string move assignment</emphasis>
+     </term>
+     <listitem><para>Respect propagation trait for move assignment.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2064">2064</link>:
+ 	<emphasis>More noexcept issues in basic_string</emphasis>
+     </term>
+     <listitem><para>Add noexcept to the comparison operators.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2067">2067</link>:
+ 	<emphasis>packaged_task should have deleted copy c'tor with const parameter</emphasis>
+     </term>
+     <listitem><para>Fix signatures.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2101">2101</link>:
+ 	<emphasis>Some transformation types can produce impossible types</emphasis>
+     </term>
+     <listitem><para>Use the referenceable type concept.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2106">2106</link>:
+ 	<emphasis>move_iterator wrapping iterators returning prvalues</emphasis>
+     </term>
+     <listitem><para>Change the <code>reference</code> type.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2132">2132</link>:
+ 	<emphasis><code>std::function</code> ambiguity</emphasis>
+     </term>
+     <listitem><para>Constrain the constructor to only accept callable types.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2141">2141</link>:
+ 	<emphasis><code>common_type</code> trait produces reference types</emphasis>
+     </term>
+     <listitem><para>Use <code>decay</code> for the result type.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2144">2144</link>:
+ 	<emphasis>Missing <code>noexcept</code> specification in <code>type_index</code></emphasis>
+     </term>
+     <listitem><para>Add <code>noexcept</code>
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2145">2145</link>:
+ 	<emphasis><code>error_category</code> default constructor</emphasis>
+     </term>
+     <listitem><para>Declare a public constexpr constructor.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2162">2162</link>:
+ 	<emphasis><code>allocator_traits::max_size</code> missing <code>noexcept</code></emphasis>
+     </term>
+     <listitem><para>Add <code>noexcept</code>.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2187">2187</link>:
+ 	<emphasis><code>vector&lt;bool&gt;</code> is missing <code>emplace</code> and <code>emplace_back</code> member functions</emphasis>
+     </term>
+     <listitem><para>Add <code>emplace</code> and <code>emplace_back</code> member functions.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2196">2196</link>:
+ 	<emphasis>Specification of <code>is_*[copy/move]_[constructible/assignable]</code> unclear for non-referencable types</emphasis>
+     </term>
+     <listitem><para>Use the referenceable type concept.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2313">2313</link>:
+ 	<emphasis><code>tuple_size</code> should always derive from <code>integral_constant&lt;size_t, N&gt;</code></emphasis>
+     </term>
+     <listitem><para>Update definitions of the partial specializations for const and volatile types.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2329">2329</link>:
+        <emphasis><code>regex_match()/regex_search()</code> with <code>match_results</code> should forbid temporary strings</emphasis>
+     </term>
+     <listitem><para>Add deleted overloads for rvalue strings.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2332">2332</link>:
+        <emphasis><code>regex_iterator/regex_token_iterator</code> should forbid temporary regexes</emphasis>
+     </term>
+     <listitem><para>Add deleted constructors.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2399">2399</link>:
+ 	<emphasis><code>shared_ptr</code>'s constructor from <code>unique_ptr</code> should be constrained</emphasis>
+     </term>
+     <listitem><para>Constrain the constructor to require convertibility.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2400">2400</link>:
+ 	<emphasis><code>shared_ptr</code>'s <code>get_deleter()</code> should use <code>addressof()</code></emphasis>
+     </term>
+     <listitem><para>Use <code>addressof</code>.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2401">2401</link>:
+ 	<emphasis><code>std::function</code> needs more <code>noexcept</code></emphasis>
+     </term>
+     <listitem><para>Add <code>noexcept</code> to the assignment and comparisons.
+     </para></listitem></varlistentry>
+ 
+     <varlistentry><term><link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../ext/lwg-defects.html#2455">2455</link>:
+        <emphasis>Allocator default construction should be allowed to throw
+        </emphasis>
+     </term>
+     <listitem><para>Make <code>noexcept</code> specifications conditional.
+     </para></listitem></varlistentry>
+ 
+ 
    </variablelist>
  
   </section>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/manual/mt_allocator.xml gcc-5.5.0/libstdc++-v3/doc/xml/manual/mt_allocator.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/manual/mt_allocator.xml	Tue Dec 18 11:08:33 2012
--- gcc-5.5.0/libstdc++-v3/doc/xml/manual/mt_allocator.xml	Fri Jun 16 12:55:17 2017
*************** containers, this works, as an instance o
*** 307,313 ****
  as part of a container's constructor. However, this assumption is
  implementation-specific, and subject to change. For an example of a
  pool that frees memory, see the following
!     <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/ext/mt_allocator/deallocate_local-6.cc?view=markup">
      example.</link>
  </para>
  
--- 307,313 ----
  as part of a container's constructor. However, this assumption is
  implementation-specific, and subject to change. For an example of a
  pool that frees memory, see the following
!     <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/ext/mt_allocator/deallocate_local-6.cc?view=markup">
      example.</link>
  </para>
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/manual/status_cxx2011.xml gcc-5.5.0/libstdc++-v3/doc/xml/manual/status_cxx2011.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/manual/status_cxx2011.xml	Tue Dec  8 14:00:31 2015
--- gcc-5.5.0/libstdc++-v3/doc/xml/manual/status_cxx2011.xml	Fri Sep  1 12:15:44 2017
*************** presence of the required flag.
*** 27,34 ****
  </para>
  
  <para>
! This page describes the C++11 support in mainline GCC SVN, not in any
! particular release.
  </para>
  
  <!-- Status is Yes or No, Broken/Partial-->
--- 27,33 ----
  </para>
  
  <para>
! This page describes the C++11 support in the GCC 5 series.
  </para>
  
  <!-- Status is Yes or No, Broken/Partial-->
*************** particular release.
*** 1008,1018 ****
        <entry/>
      </row>
      <row>
-       <?dbhtml bgcolor="#B0B0B0" ?>
        <entry>20.12.4</entry>
        <entry>Scoped allocator adaptor members</entry>
!       <entry>Partial</entry>
!       <entry>OUTERMOST is not recursive.</entry>
      </row>
      <row>
        <entry>20.12.5</entry>
--- 1007,1016 ----
        <entry/>
      </row>
      <row>
        <entry>20.12.4</entry>
        <entry>Scoped allocator adaptor members</entry>
!       <entry>Y</entry>
!       <entry/>
      </row>
      <row>
        <entry>20.12.5</entry>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/doc/xml/manual/status_cxx2014.xml gcc-5.5.0/libstdc++-v3/doc/xml/manual/status_cxx2014.xml
*** gcc-5.4.0/libstdc++-v3/doc/xml/manual/status_cxx2014.xml	Tue Dec  8 14:00:31 2015
--- gcc-5.5.0/libstdc++-v3/doc/xml/manual/status_cxx2014.xml	Sat Aug  6 12:21:38 2016
*************** presence of the required flag.
*** 20,27 ****
  </para>
  
  <para>
! This page describes the C++14 and library TS support in mainline GCC SVN,
! not in any particular release.
  </para>
  
  <table frame="all" xml:id="table.cxx14_status">
--- 20,26 ----
  </para>
  
  <para>
! This page describes the C++14 and library TS support in the GCC 5 series.
  </para>
  
  <table frame="all" xml:id="table.cxx14_status">
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/Makefile.am gcc-5.5.0/libstdc++-v3/include/Makefile.am
*** gcc-5.4.0/libstdc++-v3/include/Makefile.am	Wed Apr 20 13:00:24 2016
--- gcc-5.5.0/libstdc++-v3/include/Makefile.am	Mon Oct  3 14:42:06 2016
*************** experimental_headers = \
*** 649,654 ****
--- 649,655 ----
  	${experimental_srcdir}/any \
  	${experimental_srcdir}/chrono \
  	${experimental_srcdir}/functional \
+ 	${experimental_srcdir}/lfts_config.h \
  	${experimental_srcdir}/optional \
  	${experimental_srcdir}/ratio \
  	${experimental_srcdir}/string_view \
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/Makefile.in gcc-5.5.0/libstdc++-v3/include/Makefile.in
*** gcc-5.4.0/libstdc++-v3/include/Makefile.in	Wed Apr 20 13:00:24 2016
--- gcc-5.5.0/libstdc++-v3/include/Makefile.in	Mon Oct  3 14:42:06 2016
*************** experimental_headers = \
*** 938,943 ****
--- 938,944 ----
  	${experimental_srcdir}/any \
  	${experimental_srcdir}/chrono \
  	${experimental_srcdir}/functional \
+ 	${experimental_srcdir}/lfts_config.h \
  	${experimental_srcdir}/optional \
  	${experimental_srcdir}/ratio \
  	${experimental_srcdir}/string_view \
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/allocator.h gcc-5.5.0/libstdc++-v3/include/bits/allocator.h
*** gcc-5.4.0/libstdc++-v3/include/bits/allocator.h	Wed Nov 25 16:11:33 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/allocator.h	Thu Oct 20 11:17:55 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 77,82 ****
--- 77,91 ----
        // _GLIBCXX_RESOLVE_LIB_DEFECTS
        // 2103. std::allocator propagate_on_container_move_assignment
        typedef true_type propagate_on_container_move_assignment;
+ 
+       template<typename _Up, typename... _Args>
+ 	void
+ 	construct(_Up* __p, _Args&&... __args)
+ 	{ ::new((void *)__p) _Up(std::forward<_Args>(__args)...); }
+ 
+       template<typename _Up>
+ 	void
+ 	destroy(_Up* __p) { __p->~_Up(); }
  #endif
      };
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/basic_ios.h gcc-5.5.0/libstdc++-v3/include/bits/basic_ios.h
*** gcc-5.4.0/libstdc++-v3/include/bits/basic_ios.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/basic_ios.h	Mon Sep  4 17:09:01 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 157,164 ****
        setstate(iostate __state)
        { this->clear(this->rdstate() | __state); }
  
!       // Flip the internal state on for the proper state bits, then re
!       // throws the propagated exception if bit also set in
        // exceptions().
        void
        _M_setstate(iostate __state)
--- 157,164 ----
        setstate(iostate __state)
        { this->clear(this->rdstate() | __state); }
  
!       // Flip the internal state on for the proper state bits, then
!       // rethrows the propagated exception if bit also set in
        // exceptions().
        void
        _M_setstate(iostate __state)
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/basic_string.h gcc-5.5.0/libstdc++-v3/include/bits/basic_string.h
*** gcc-5.4.0/libstdc++-v3/include/bits/basic_string.h	Tue Jan 12 17:02:15 2016
--- gcc-5.5.0/libstdc++-v3/include/bits/basic_string.h	Mon Sep  4 16:41:25 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 387,393 ****
         *  @brief  Construct an empty string using allocator @a a.
         */
        explicit
!       basic_string(const _Alloc& __a)
        : _M_dataplus(_M_local_data(), __a)
        { _M_set_length(0); }
  
--- 387,393 ----
         *  @brief  Construct an empty string using allocator @a a.
         */
        explicit
!       basic_string(const _Alloc& __a) _GLIBCXX_NOEXCEPT
        : _M_dataplus(_M_local_data(), __a)
        { _M_set_length(0); }
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 396,402 ****
         *  @param  __str  Source string.
         */
        basic_string(const basic_string& __str)
!       : _M_dataplus(_M_local_data(), __str._M_get_allocator()) // TODO A traits
        { _M_construct(__str._M_data(), __str._M_data() + __str.length()); }
  
        /**
--- 396,403 ----
         *  @param  __str  Source string.
         */
        basic_string(const basic_string& __str)
!       : _M_dataplus(_M_local_data(),
! 		    _Alloc_traits::_S_select_on_copy(__str._M_get_allocator()))
        { _M_construct(__str._M_data(), __str._M_data() + __str.length()); }
  
        /**
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 509,518 ****
        { _M_construct(__str.begin(), __str.end()); }
  
        basic_string(basic_string&& __str, const _Alloc& __a)
        : _M_dataplus(_M_local_data(), __a)
        {
! 	if (__str.get_allocator() == __a)
! 	  *this = std::move(__str);
  	else
  	  _M_construct(__str.begin(), __str.end());
        }
--- 510,534 ----
        { _M_construct(__str.begin(), __str.end()); }
  
        basic_string(basic_string&& __str, const _Alloc& __a)
+       noexcept(_Alloc_traits::_S_always_equal())
        : _M_dataplus(_M_local_data(), __a)
        {
! 	if (__str._M_is_local())
! 	  {
! 	    traits_type::copy(_M_local_buf, __str._M_local_buf,
! 			      _S_local_capacity + 1);
! 	    _M_length(__str.length());
! 	    __str._M_set_length(0);
! 	  }
! 	else if (_Alloc_traits::_S_always_equal()
! 	    || __str.get_allocator() == __a)
! 	  {
! 	    _M_data(__str._M_data());
! 	    _M_length(__str.length());
! 	    _M_capacity(__str._M_allocated_capacity);
! 	    __str._M_data(__str._M_local_buf);
! 	    __str._M_set_length(0);
! 	  }
  	else
  	  _M_construct(__str.begin(), __str.end());
        }
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 548,554 ****
         */
        basic_string&
        operator=(const basic_string& __str)
!       { return this->assign(__str); }
  
        /**
         *  @brief  Copy contents of @a s into this string.
--- 564,601 ----
         */
        basic_string&
        operator=(const basic_string& __str)
!       {
! #if __cplusplus >= 201103L
! 	if (_Alloc_traits::_S_propagate_on_copy_assign())
! 	  {
! 	    if (!_Alloc_traits::_S_always_equal() && !_M_is_local()
! 		&& _M_get_allocator() != __str._M_get_allocator())
! 	      {
! 		// Propagating allocator cannot free existing storage so must
! 		// deallocate it before replacing current allocator.
! 		if (__str.size() <= _S_local_capacity)
! 		  {
! 		    _M_destroy(_M_allocated_capacity);
! 		    _M_data(_M_local_data());
! 		    _M_set_length(0);
! 		  }
! 		else
! 		  {
! 		    const auto __len = __str.size();
! 		    auto __alloc = __str._M_get_allocator();
! 		    // If this allocation throws there are no effects:
! 		    auto __ptr = _Alloc_traits::allocate(__alloc, __len + 1);
! 		    _M_destroy(_M_allocated_capacity);
! 		    _M_data(__ptr);
! 		    _M_capacity(__len);
! 		    _M_set_length(__len);
! 		  }
! 	      }
! 	    std::__alloc_on_copy(_M_get_allocator(), __str._M_get_allocator());
! 	  }
! #endif
! 	return this->assign(__str);
!       }
  
        /**
         *  @brief  Copy contents of @a s into this string.
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 585,592 ****
        // 2063. Contradictory requirements for string move assignment
        basic_string&
        operator=(basic_string&& __str)
        {
! 	this->swap(__str);
  	return *this;
        }
  
--- 632,682 ----
        // 2063. Contradictory requirements for string move assignment
        basic_string&
        operator=(basic_string&& __str)
+       noexcept(_Alloc_traits::_S_nothrow_move())
        {
! 	if (!_M_is_local() && _Alloc_traits::_S_propagate_on_move_assign()
! 	    && !_Alloc_traits::_S_always_equal()
! 	    && _M_get_allocator() != __str._M_get_allocator())
! 	  {
! 	    // Destroy existing storage before replacing allocator.
! 	    _M_destroy(_M_allocated_capacity);
! 	    _M_data(_M_local_data());
! 	    _M_set_length(0);
! 	  }
! 	// Replace allocator if POCMA is true.
! 	std::__alloc_on_move(_M_get_allocator(), __str._M_get_allocator());
! 
! 	if (!__str._M_is_local()
! 	    && (_Alloc_traits::_S_propagate_on_move_assign()
! 	      || _Alloc_traits::_S_always_equal()))
! 	  {
! 	    pointer __data = nullptr;
! 	    size_type __capacity;
! 	    if (!_M_is_local())
! 	      {
! 		if (_Alloc_traits::_S_always_equal())
! 		  {
! 		    __data = _M_data();
! 		    __capacity = _M_allocated_capacity;
! 		  }
! 		else
! 		  _M_destroy(_M_allocated_capacity);
! 	      }
! 
! 	    _M_data(__str._M_data());
! 	    _M_length(__str.length());
! 	    _M_capacity(__str._M_allocated_capacity);
! 	    if (__data)
! 	      {
! 		__str._M_data(__data);
! 		__str._M_capacity(__capacity);
! 	      }
! 	    else
! 	      __str._M_data(__str._M_local_buf);
! 	  }
! 	else
! 	    assign(__str);
! 	__str.clear();
  	return *this;
        }
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 1107,1112 ****
--- 1197,1203 ----
         */
        basic_string&
        assign(basic_string&& __str)
+       noexcept(_Alloc_traits::_S_nothrow_move())
        {
  	// _GLIBCXX_RESOLVE_LIB_DEFECTS
  	// 2063. Contradictory requirements for string move assignment
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 2438,2444 ****
        int
        compare(size_type __pos, size_type __n1, const _CharT* __s,
  	      size_type __n2) const;
!   };
  _GLIBCXX_END_NAMESPACE_CXX11
  #else  // !_GLIBCXX_USE_CXX11_ABI
    // Reference-counted COW string implentation
--- 2529,2538 ----
        int
        compare(size_type __pos, size_type __n1, const _CharT* __s,
  	      size_type __n2) const;
! 
!       // Allow basic_stringbuf::__xfer_bufptrs to call _M_length:
!       template<typename, typename, typename> friend class basic_stringbuf;
!     };
  _GLIBCXX_END_NAMESPACE_CXX11
  #else  // !_GLIBCXX_USE_CXX11_ABI
    // Reference-counted COW string implentation
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 4903,4915 ****
      inline bool
      operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
  	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
      { return __lhs.compare(__rhs) == 0; }
  
    template<typename _CharT>
      inline
      typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type
      operator==(const basic_string<_CharT>& __lhs,
! 	       const basic_string<_CharT>& __rhs)
      { return (__lhs.size() == __rhs.size()
  	      && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(),
  						    __lhs.size())); }
--- 4997,5010 ----
      inline bool
      operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
  	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+     _GLIBCXX_NOEXCEPT
      { return __lhs.compare(__rhs) == 0; }
  
    template<typename _CharT>
      inline
      typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type
      operator==(const basic_string<_CharT>& __lhs,
! 	       const basic_string<_CharT>& __rhs) _GLIBCXX_NOEXCEPT
      { return (__lhs.size() == __rhs.size()
  	      && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(),
  						    __lhs.size())); }
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 4949,4954 ****
--- 5044,5050 ----
      inline bool
      operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
  	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+     _GLIBCXX_NOEXCEPT
      { return !(__lhs == __rhs); }
  
    /**
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 4986,4991 ****
--- 5082,5088 ----
      inline bool
      operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
  	      const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+     _GLIBCXX_NOEXCEPT
      { return __lhs.compare(__rhs) < 0; }
  
    /**
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 5023,5028 ****
--- 5120,5126 ----
      inline bool
      operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
  	      const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+     _GLIBCXX_NOEXCEPT
      { return __lhs.compare(__rhs) > 0; }
  
    /**
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 5060,5065 ****
--- 5158,5164 ----
      inline bool
      operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
  	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+     _GLIBCXX_NOEXCEPT
      { return __lhs.compare(__rhs) <= 0; }
  
    /**
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 5097,5102 ****
--- 5196,5202 ----
      inline bool
      operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
  	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+     _GLIBCXX_NOEXCEPT
      { return __lhs.compare(__rhs) >= 0; }
  
    /**
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 5134,5139 ****
--- 5234,5242 ----
      inline void
      swap(basic_string<_CharT, _Traits, _Alloc>& __lhs,
  	 basic_string<_CharT, _Traits, _Alloc>& __rhs)
+ #if __cplusplus >= 201103L
+     noexcept(noexcept(__lhs.swap(__rhs)))
+ #endif
      { __lhs.swap(__rhs); }
  
  
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 5541,5546 ****
--- 5644,5651 ----
      { };
  #endif
  
+ _GLIBCXX_END_NAMESPACE_VERSION
+ 
  #if __cplusplus > 201103L
  
  #define __cpp_lib_string_udls 201304
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 5549,5554 ****
--- 5654,5660 ----
    {
    inline namespace string_literals
    {
+ _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
      _GLIBCXX_DEFAULT_ABI_TAG
      inline basic_string<char>
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 5574,5585 ****
      { return basic_string<char32_t>{__str, __len}; }
  #endif
  
    } // inline namespace string_literals
    } // inline namespace literals
  
  #endif // __cplusplus > 201103L
  
- _GLIBCXX_END_NAMESPACE_VERSION
  } // namespace std
  
  #endif // C++11
--- 5680,5691 ----
      { return basic_string<char32_t>{__str, __len}; }
  #endif
  
+ _GLIBCXX_END_NAMESPACE_VERSION
    } // inline namespace string_literals
    } // inline namespace literals
  
  #endif // __cplusplus > 201103L
  
  } // namespace std
  
  #endif // C++11
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/basic_string.tcc gcc-5.5.0/libstdc++-v3/include/bits/basic_string.tcc
*** gcc-5.4.0/libstdc++-v3/include/bits/basic_string.tcc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/basic_string.tcc	Tue Jul 12 10:56:11 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 61,71 ****
        if (this == &__s)
  	return;
  
!       // _GLIBCXX_RESOLVE_LIB_DEFECTS
!       // 431. Swapping containers with unequal allocators.
!       // TODO propagation traits
!       std::__alloc_swap<allocator_type>::_S_do_it(_M_get_allocator(),
! 						  __s._M_get_allocator());
  
        if (_M_is_local())
  	if (__s._M_is_local())
--- 61,67 ----
        if (this == &__s)
  	return;
  
!       _Alloc_traits::_S_on_swap(_M_get_allocator(), __s._M_get_allocator());
  
        if (_M_is_local())
  	if (__s._M_is_local())
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 404,410 ****
  
        if (__new_size <= this->capacity())
  	{
! 	  _CharT* __p = this->_M_data() + __pos1;
  
  	  const size_type __how_much = __old_size - __pos1 - __n1;
  	  if (__how_much && __n1 != __n2)
--- 400,406 ----
  
        if (__new_size <= this->capacity())
  	{
! 	  pointer __p = this->_M_data() + __pos1;
  
  	  const size_type __how_much = __old_size - __pos1 - __n1;
  	  if (__how_much && __n1 != __n2)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 433,439 ****
  
        if (__new_size <= this->capacity())
  	{
! 	  _CharT* __p = this->_M_data() + __pos;
  
  	  const size_type __how_much = __old_size - __pos - __len1;
  	  if (_M_disjunct(__s))
--- 429,435 ----
  
        if (__new_size <= this->capacity())
  	{
! 	  pointer __p = this->_M_data() + __pos;
  
  	  const size_type __how_much = __old_size - __pos - __len1;
  	  if (_M_disjunct(__s))
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/c++config gcc-5.5.0/libstdc++-v3/include/bits/c++config
*** gcc-5.4.0/libstdc++-v3/include/bits/c++config	Fri Dec  4 17:07:57 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/c++config	Mon Oct  3 14:42:06 2016
***************
*** 177,184 ****
      namespace placeholders { }
      namespace regex_constants { }
      namespace this_thread { }
! 
!     namespace experimental { }
    }
  
    namespace abi { }
--- 177,187 ----
      namespace placeholders { }
      namespace regex_constants { }
      namespace this_thread { }
!     inline namespace literals {
!       inline namespace chrono_literals { }
!       inline namespace complex_literals { }
!       inline namespace string_literals { }
!     }
    }
  
    namespace abi { }
*************** namespace std
*** 263,269 ****
    namespace regex_constants { inline namespace __7 { } }
    namespace this_thread { inline namespace __7 { } }
  
!   namespace experimental { inline namespace __7 { } }
  
    namespace __detail { inline namespace __7 { } }
  }
--- 266,276 ----
    namespace regex_constants { inline namespace __7 { } }
    namespace this_thread { inline namespace __7 { } }
  
!   inline namespace literals {
!     inline namespace chrono_literals { inline namespace __7 { } }
!     inline namespace complex_literals { inline namespace __7 { } }
!     inline namespace string_literals { inline namespace __7 { } }
!   }
  
    namespace __detail { inline namespace __7 { } }
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/hashtable.h gcc-5.5.0/libstdc++-v3/include/bits/hashtable.h
*** gcc-5.4.0/libstdc++-v3/include/bits/hashtable.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/hashtable.h	Mon Sep  4 16:41:34 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 834,850 ****
  	    _M_bucket_count = __bkt_count;
  	  }
  
! 	__try
! 	  {
! 	    for (; __f != __l; ++__f)
! 	      this->insert(*__f);
! 	  }
! 	__catch(...)
! 	  {
! 	    clear();
! 	    _M_deallocate_buckets();
! 	    __throw_exception_again;
! 	  }
        }
  
    template<typename _Key, typename _Value,
--- 834,841 ----
  	    _M_bucket_count = __bkt_count;
  	  }
  
! 	for (; __f != __l; ++__f)
! 	  this->insert(*__f);
        }
  
    template<typename _Key, typename _Value,
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/ios_base.h gcc-5.5.0/libstdc++-v3/include/bits/ios_base.h
*** gcc-5.4.0/libstdc++-v3/include/bits/ios_base.h	Wed Nov 25 16:11:40 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/ios_base.h	Thu May 18 15:31:13 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 52,59 ****
  
    // The following definitions of bitmask types are enums, not ints,
    // as permitted (but not required) in the standard, in order to provide
!   // better type safety in iostream calls.  A side effect is that
!   // expressions involving them are no longer compile-time constants.
    enum _Ios_Fmtflags 
      { 
        _S_boolalpha 	= 1L << 0,
--- 52,59 ----
  
    // The following definitions of bitmask types are enums, not ints,
    // as permitted (but not required) in the standard, in order to provide
!   // better type safety in iostream calls.  A side effect is that in C++98
!   // expressions involving them are not compile-time constants.
    enum _Ios_Fmtflags 
      { 
        _S_boolalpha 	= 1L << 0,
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 207,218 ****
    const error_category& iostream_category() noexcept;
  
    inline error_code
!   make_error_code(io_errc e) noexcept
!   { return error_code(static_cast<int>(e), iostream_category()); }
  
    inline error_condition
!   make_error_condition(io_errc e) noexcept
!   { return error_condition(static_cast<int>(e), iostream_category()); }
  #endif
  
    // 27.4.2  Class ios_base
--- 207,218 ----
    const error_category& iostream_category() noexcept;
  
    inline error_code
!   make_error_code(io_errc __e) noexcept
!   { return error_code(static_cast<int>(__e), iostream_category()); }
  
    inline error_condition
!   make_error_condition(io_errc __e) noexcept
!   { return error_condition(static_cast<int>(__e), iostream_category()); }
  #endif
  
    // 27.4.2  Class ios_base
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/istream.tcc gcc-5.5.0/libstdc++-v3/include/bits/istream.tcc
*** gcc-5.4.0/libstdc++-v3/include/bits/istream.tcc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/istream.tcc	Mon Sep  4 17:09:01 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 48,75 ****
      {
        ios_base::iostate __err = ios_base::goodbit;
        if (__in.good())
! 	{
! 	  if (__in.tie())
! 	    __in.tie()->flush();
! 	  if (!__noskip && bool(__in.flags() & ios_base::skipws))
! 	    {
! 	      const __int_type __eof = traits_type::eof();
! 	      __streambuf_type* __sb = __in.rdbuf();
! 	      __int_type __c = __sb->sgetc();
  
! 	      const __ctype_type& __ct = __check_facet(__in._M_ctype);
! 	      while (!traits_type::eq_int_type(__c, __eof)
! 		     && __ct.is(ctype_base::space, 
! 				traits_type::to_char_type(__c)))
! 		__c = __sb->snextc();
  
! 	      // _GLIBCXX_RESOLVE_LIB_DEFECTS
! 	      // 195. Should basic_istream::sentry's constructor ever
! 	      // set eofbit?
! 	      if (traits_type::eq_int_type(__c, __eof))
! 		__err |= ios_base::eofbit;
! 	    }
! 	}
  
        if (__in.good() && __err == ios_base::goodbit)
  	_M_ok = true;
--- 48,83 ----
      {
        ios_base::iostate __err = ios_base::goodbit;
        if (__in.good())
! 	__try
! 	  {
! 	    if (__in.tie())
! 	      __in.tie()->flush();
! 	    if (!__noskip && bool(__in.flags() & ios_base::skipws))
! 	      {
! 		const __int_type __eof = traits_type::eof();
! 		__streambuf_type* __sb = __in.rdbuf();
! 		__int_type __c = __sb->sgetc();
  
! 		const __ctype_type& __ct = __check_facet(__in._M_ctype);
! 		while (!traits_type::eq_int_type(__c, __eof)
! 		       && __ct.is(ctype_base::space,
! 				  traits_type::to_char_type(__c)))
! 		  __c = __sb->snextc();
  
! 		// _GLIBCXX_RESOLVE_LIB_DEFECTS
! 		// 195. Should basic_istream::sentry's constructor ever
! 		// set eofbit?
! 		if (traits_type::eq_int_type(__c, __eof))
! 		  __err |= ios_base::eofbit;
! 	      }
! 	  }
! 	__catch(__cxxabiv1::__forced_unwind&)
! 	  {
! 	    __in._M_setstate(ios_base::badbit);
! 	    __throw_exception_again;
! 	  }
! 	__catch(...)
! 	  { __in._M_setstate(ios_base::badbit); }
  
        if (__in.good() && __err == ios_base::goodbit)
  	_M_ok = true;
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/list.tcc gcc-5.5.0/libstdc++-v3/include/bits/list.tcc
*** gcc-5.4.0/libstdc++-v3/include/bits/list.tcc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/list.tcc	Mon Mar 13 19:44:42 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 338,363 ****
        // 300. list::merge() specification incomplete
        if (this != &__x)
  	{
! 	  _M_check_equal_allocators(__x); 
  
  	  iterator __first1 = begin();
  	  iterator __last1 = end();
  	  iterator __first2 = __x.begin();
  	  iterator __last2 = __x.end();
! 	  while (__first1 != __last1 && __first2 != __last2)
! 	    if (*__first2 < *__first1)
! 	      {
! 		iterator __next = __first2;
! 		_M_transfer(__first1, __first2, ++__next);
! 		__first2 = __next;
! 	      }
! 	    else
! 	      ++__first1;
! 	  if (__first2 != __last2)
! 	    _M_transfer(__last1, __first2, __last2);
  
! 	  this->_M_inc_size(__x._M_get_size());
! 	  __x._M_set_size(0);
  	}
      }
  
--- 338,373 ----
        // 300. list::merge() specification incomplete
        if (this != &__x)
  	{
! 	  _M_check_equal_allocators(__x);
  
  	  iterator __first1 = begin();
  	  iterator __last1 = end();
  	  iterator __first2 = __x.begin();
  	  iterator __last2 = __x.end();
! 	  const size_t __orig_size = __x.size();
! 	  __try {
! 	    while (__first1 != __last1 && __first2 != __last2)
! 	      if (*__first2 < *__first1)
! 		{
! 		  iterator __next = __first2;
! 		  _M_transfer(__first1, __first2, ++__next);
! 		  __first2 = __next;
! 		}
! 	      else
! 		++__first1;
! 	    if (__first2 != __last2)
! 	      _M_transfer(__last1, __first2, __last2);
  
! 	    this->_M_inc_size(__x._M_get_size());
! 	    __x._M_set_size(0);
! 	  }
! 	  __catch(...)
! 	    {
! 	      const size_t __dist = std::distance(__first2, __last2);
! 	      this->_M_inc_size(__orig_size - __dist);
! 	      __x._M_set_size(__dist);
! 	      __throw_exception_again;
! 	    }
  	}
      }
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 381,400 ****
  	    iterator __last1 = end();
  	    iterator __first2 = __x.begin();
  	    iterator __last2 = __x.end();
! 	    while (__first1 != __last1 && __first2 != __last2)
! 	      if (__comp(*__first2, *__first1))
! 		{
! 		  iterator __next = __first2;
! 		  _M_transfer(__first1, __first2, ++__next);
! 		  __first2 = __next;
! 		}
! 	      else
! 		++__first1;
! 	    if (__first2 != __last2)
! 	      _M_transfer(__last1, __first2, __last2);
  
! 	    this->_M_inc_size(__x._M_get_size());
! 	    __x._M_set_size(0);
  	  }
        }
  
--- 391,421 ----
  	    iterator __last1 = end();
  	    iterator __first2 = __x.begin();
  	    iterator __last2 = __x.end();
! 	    const size_t __orig_size = __x.size();
! 	    __try
! 	      {
! 		while (__first1 != __last1 && __first2 != __last2)
! 		  if (__comp(*__first2, *__first1))
! 		    {
! 		      iterator __next = __first2;
! 		      _M_transfer(__first1, __first2, ++__next);
! 		      __first2 = __next;
! 		    }
! 		  else
! 		    ++__first1;
! 		if (__first2 != __last2)
! 		  _M_transfer(__last1, __first2, __last2);
  
! 		this->_M_inc_size(__x._M_get_size());
! 		__x._M_set_size(0);
! 	      }
! 	    __catch(...)
! 	      {
! 		const size_t __dist = std::distance(__first2, __last2);
! 		this->_M_inc_size(__orig_size - __dist);
! 		__x._M_set_size(__dist);
! 		__throw_exception_again;
! 	      }
  	  }
        }
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/locale_classes.h gcc-5.5.0/libstdc++-v3/include/bits/locale_classes.h
*** gcc-5.4.0/libstdc++-v3/include/bits/locale_classes.h	Tue Jan 20 11:50:51 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/locale_classes.h	Tue Feb 14 21:17:23 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 453,462 ****
      facet&
      operator=(const facet&);  // Not defined.
  
-     class __shim;
- 
      const facet* _M_sso_shim(const id*) const;
      const facet* _M_cow_shim(const id*) const;
    };
  
  
--- 453,463 ----
      facet&
      operator=(const facet&);  // Not defined.
  
      const facet* _M_sso_shim(const id*) const;
      const facet* _M_cow_shim(const id*) const;
+ 
+   protected:
+     class __shim; // For internal use only.
    };
  
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/locale_conv.h gcc-5.5.0/libstdc++-v3/include/bits/locale_conv.h
*** gcc-5.4.0/libstdc++-v3/include/bits/locale_conv.h	Wed Oct  7 21:00:50 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/locale_conv.h	Fri Jun 16 14:22:30 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 81,87 ****
  	     && (__outstr.size() - __outchars) < __maxlen);
  
        if (__result == codecvt_base::error)
! 	return false;
  
        if (__result == codecvt_base::noconv)
  	{
--- 81,90 ----
  	     && (__outstr.size() - __outchars) < __maxlen);
  
        if (__result == codecvt_base::error)
! 	{
! 	  __count = __next - __first;
! 	  return false;
! 	}
  
        if (__result == codecvt_base::noconv)
  	{
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 372,378 ****
      protected:
        int
        sync()
!       { return _M_buf && _M_conv_put() && _M_buf->pubsync() ? 0 : -1; }
  
        typename _Wide_streambuf::int_type
        overflow(typename _Wide_streambuf::int_type __out)
--- 375,381 ----
      protected:
        int
        sync()
!       { return _M_buf && _M_conv_put() && !_M_buf->pubsync() ? 0 : -1; }
  
        typename _Wide_streambuf::int_type
        overflow(typename _Wide_streambuf::int_type __out)
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 479,484 ****
--- 482,488 ----
        {
  	if (_M_buf->sputn(__p, __n) < __n)
  	  return false;
+ 	return true;
        }
  
        // convert the put area and write to the byte stream buffer
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/mask_array.h gcc-5.5.0/libstdc++-v3/include/bits/mask_array.h
*** gcc-5.4.0/libstdc++-v3/include/bits/mask_array.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/mask_array.h	Thu Mar  2 18:59:06 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 136,143 ****
      };
  
    template<typename _Tp>
!     inline mask_array<_Tp>::mask_array(const mask_array<_Tp>& a)
!     : _M_sz(a._M_sz), _M_mask(a._M_mask), _M_array(a._M_array) {}
  
    template<typename _Tp>
      inline
--- 136,143 ----
      };
  
    template<typename _Tp>
!     inline mask_array<_Tp>::mask_array(const mask_array<_Tp>& __a)
!     : _M_sz(__a._M_sz), _M_mask(__a._M_mask), _M_array(__a._M_array) {}
  
    template<typename _Tp>
      inline
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/predefined_ops.h gcc-5.5.0/libstdc++-v3/include/bits/predefined_ops.h
*** gcc-5.4.0/libstdc++-v3/include/bits/predefined_ops.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/predefined_ops.h	Wed Feb  1 12:57:58 2017
***************
*** 24,30 ****
  
  /** @file predefined_ops.h
   *  This is an internal header file, included by other library headers.
!  *  You should not attempt to use it directly.
   */
  
  #ifndef _GLIBCXX_PREDEFINED_OPS_H
--- 24,30 ----
  
  /** @file predefined_ops.h
   *  This is an internal header file, included by other library headers.
!  *  You should not attempt to use it directly. @headername{algorithm}
   */
  
  #ifndef _GLIBCXX_PREDEFINED_OPS_H
*************** namespace __ops
*** 42,47 ****
--- 42,48 ----
        operator()(_Iterator1 __it1, _Iterator2 __it2) const
        { return *__it1 < *__it2; }
    };
+ 
    _GLIBCXX14_CONSTEXPR
    inline _Iter_less_iter
    __iter_less_iter()
*************** namespace __ops
*** 53,59 ****
        bool
        operator()(_Iterator __it, _Value& __val) const
        { return *__it < __val; }
!     };
  
    inline _Iter_less_val
    __iter_less_val()
--- 54,60 ----
        bool
        operator()(_Iterator __it, _Value& __val) const
        { return *__it < __val; }
!   };
  
    inline _Iter_less_val
    __iter_less_val()
*************** namespace __ops
*** 69,75 ****
        bool
        operator()(_Value& __val, _Iterator __it) const
        { return __val < *__it; }
!     };
  
    inline _Val_less_iter
    __val_less_iter()
--- 70,76 ----
        bool
        operator()(_Value& __val, _Iterator __it) const
        { return __val < *__it; }
!   };
  
    inline _Val_less_iter
    __val_less_iter()
*************** namespace __ops
*** 85,91 ****
        bool
        operator()(_Iterator1 __it1, _Iterator2 __it2) const
        { return *__it1 == *__it2; }
!     };
  
    inline _Iter_equal_to_iter
    __iter_equal_to_iter()
--- 86,92 ----
        bool
        operator()(_Iterator1 __it1, _Iterator2 __it2) const
        { return *__it1 == *__it2; }
!   };
  
    inline _Iter_equal_to_iter
    __iter_equal_to_iter()
*************** namespace __ops
*** 97,103 ****
        bool
        operator()(_Iterator __it, _Value& __val) const
        { return *__it == __val; }
!     };
  
    inline _Iter_equal_to_val
    __iter_equal_to_val()
--- 98,104 ----
        bool
        operator()(_Iterator __it, _Value& __val) const
        { return *__it == __val; }
!   };
  
    inline _Iter_equal_to_val
    __iter_equal_to_val()
*************** namespace __ops
*** 111,117 ****
      struct _Iter_comp_iter
      {
        _Compare _M_comp;
!       _GLIBCXX14_CONSTEXPR
        _Iter_comp_iter(_Compare __comp)
  	: _M_comp(__comp)
        { }
--- 112,119 ----
      struct _Iter_comp_iter
      {
        _Compare _M_comp;
! 
!       explicit _GLIBCXX14_CONSTEXPR
        _Iter_comp_iter(_Compare __comp)
  	: _M_comp(__comp)
        { }
*************** namespace __ops
*** 134,139 ****
--- 136,142 ----
      {
        _Compare _M_comp;
  
+       explicit
        _Iter_comp_val(_Compare __comp)
  	: _M_comp(__comp)
        { }
*************** namespace __ops
*** 159,164 ****
--- 162,168 ----
      {
        _Compare _M_comp;
  
+       explicit
        _Val_comp_iter(_Compare __comp)
  	: _M_comp(__comp)
        { }
*************** namespace __ops
*** 184,189 ****
--- 188,194 ----
      {
        _Value& _M_value;
  
+       explicit
        _Iter_equals_val(_Value& __value)
  	: _M_value(__value)
        { }
*************** namespace __ops
*** 202,217 ****
    template<typename _Iterator1>
      struct _Iter_equals_iter
      {
!       typename std::iterator_traits<_Iterator1>::reference _M_ref;
  
        _Iter_equals_iter(_Iterator1 __it1)
! 	: _M_ref(*__it1)
        { }
  
        template<typename _Iterator2>
  	bool
  	operator()(_Iterator2 __it2)
! 	{ return *__it2 == _M_ref; }
      };
  
    template<typename _Iterator>
--- 207,223 ----
    template<typename _Iterator1>
      struct _Iter_equals_iter
      {
!       _Iterator1 _M_it1;
  
+       explicit
        _Iter_equals_iter(_Iterator1 __it1)
! 	: _M_it1(__it1)
        { }
  
        template<typename _Iterator2>
  	bool
  	operator()(_Iterator2 __it2)
! 	{ return *__it2 == *_M_it1; }
      };
  
    template<typename _Iterator>
*************** namespace __ops
*** 224,229 ****
--- 230,236 ----
      {
        _Predicate _M_pred;
  
+       explicit
        _Iter_pred(_Predicate __pred)
  	: _M_pred(__pred)
        { }
*************** namespace __ops
*** 264,279 ****
      struct _Iter_comp_to_iter
      {
        _Compare _M_comp;
!       typename std::iterator_traits<_Iterator1>::reference _M_ref;
  
        _Iter_comp_to_iter(_Compare __comp, _Iterator1 __it1)
! 	: _M_comp(__comp), _M_ref(*__it1)
        { }
  
        template<typename _Iterator2>
  	bool
  	operator()(_Iterator2 __it2)
! 	{ return bool(_M_comp(*__it2, _M_ref)); }
      };
  
    template<typename _Compare, typename _Iterator>
--- 271,286 ----
      struct _Iter_comp_to_iter
      {
        _Compare _M_comp;
!       _Iterator1 _M_it1;
  
        _Iter_comp_to_iter(_Compare __comp, _Iterator1 __it1)
! 	: _M_comp(__comp), _M_it1(__it1)
        { }
  
        template<typename _Iterator2>
  	bool
  	operator()(_Iterator2 __it2)
! 	{ return bool(_M_comp(*__it2, *_M_it1)); }
      };
  
    template<typename _Compare, typename _Iterator>
*************** namespace __ops
*** 286,291 ****
--- 293,299 ----
      {
        _Predicate _M_pred;
  
+       explicit
        _Iter_negate(_Predicate __pred)
  	: _M_pred(__pred)
        { }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/regex.h gcc-5.5.0/libstdc++-v3/include/bits/regex.h
*** gcc-5.4.0/libstdc++-v3/include/bits/regex.h	Tue Mar 10 18:41:46 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/regex.h	Thu May 18 15:30:42 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 769,778 ****
  
        template<typename _Bp, typename _Ap, typename _Cp, typename _Rp,
  	__detail::_RegexExecutorPolicy, bool>
! 	friend bool
! 	__detail::__regex_algo_impl(_Bp, _Bp, match_results<_Bp, _Ap>&,
! 				    const basic_regex<_Cp, _Rp>&,
! 				    regex_constants::match_flag_type);
  
        template<typename, typename, typename, bool>
  	friend class __detail::_Executor;
--- 769,781 ----
  
        template<typename _Bp, typename _Ap, typename _Cp, typename _Rp,
  	__detail::_RegexExecutorPolicy, bool>
! 	friend bool __detail::
! #if _GLIBCXX_INLINE_VERSION
!         __7:: // Required due to PR c++/59256
! #endif
! 	__regex_algo_impl(_Bp, _Bp, match_results<_Bp, _Ap>&,
!                           const basic_regex<_Cp, _Rp>&,
!                           regex_constants::match_flag_type);
  
        template<typename, typename, typename, bool>
  	friend class __detail::_Executor;
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 1860,1869 ****
  
        template<typename _Bp, typename _Ap, typename _Cp, typename _Rp,
  	__detail::_RegexExecutorPolicy, bool>
! 	friend bool
! 	__detail::__regex_algo_impl(_Bp, _Bp, match_results<_Bp, _Ap>&,
! 				    const basic_regex<_Cp, _Rp>&,
! 				    regex_constants::match_flag_type);
  
        void
        _M_resize(unsigned int __size)
--- 1863,1875 ----
  
        template<typename _Bp, typename _Ap, typename _Cp, typename _Rp,
  	__detail::_RegexExecutorPolicy, bool>
! 	friend bool __detail::
! #if _GLIBCXX_INLINE_VERSION
!         __7:: // Required due to PR c++/59256
! #endif
! 	__regex_algo_impl(_Bp, _Bp, match_results<_Bp, _Ap>&,
!                           const basic_regex<_Cp, _Rp>&,
!                           regex_constants::match_flag_type);
  
        void
        _M_resize(unsigned int __size)
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 2448,2454 ****
         * one-past-the-end of a range.
         */
        regex_iterator()
!       : _M_match()
        { }
  
        /**
--- 2454,2460 ----
         * one-past-the-end of a range.
         */
        regex_iterator()
!       : _M_pregex()
        { }
  
        /**
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 2666,2674 ****
  			   initializer_list<int>,
  			   regex_constants::match_flag_type =
  			   regex_constants::match_default) = delete;
!       template <std::size_t N>
  	regex_token_iterator(_Bi_iter, _Bi_iter, const regex_type&&,
! 			     const int (&)[N],
  			     regex_constants::match_flag_type =
  			     regex_constants::match_default) = delete;
  
--- 2672,2680 ----
  			   initializer_list<int>,
  			   regex_constants::match_flag_type =
  			   regex_constants::match_default) = delete;
!       template <std::size_t _Nm>
  	regex_token_iterator(_Bi_iter, _Bi_iter, const regex_type&&,
! 			     const int (&)[_Nm],
  			     regex_constants::match_flag_type =
  			     regex_constants::match_default) = delete;
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/regex.tcc gcc-5.5.0/libstdc++-v3/include/bits/regex.tcc
*** gcc-5.4.0/libstdc++-v3/include/bits/regex.tcc	Tue Mar 10 18:41:46 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/regex.tcc	Thu May 18 15:30:42 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 509,520 ****
      regex_iterator<_Bi_iter, _Ch_type, _Rx_traits>::
      operator==(const regex_iterator& __rhs) const
      {
!       return (_M_match.empty() && __rhs._M_match.empty())
! 	|| (_M_begin == __rhs._M_begin
! 	    && _M_end == __rhs._M_end
! 	    && _M_pregex == __rhs._M_pregex
! 	    && _M_flags == __rhs._M_flags
! 	    && _M_match[0] == __rhs._M_match[0]);
      }
  
    template<typename _Bi_iter,
--- 509,521 ----
      regex_iterator<_Bi_iter, _Ch_type, _Rx_traits>::
      operator==(const regex_iterator& __rhs) const
      {
!       if (_M_pregex == nullptr && __rhs._M_pregex == nullptr)
! 	return true;
!       return _M_pregex == __rhs._M_pregex
! 	  && _M_begin == __rhs._M_begin
! 	  && _M_end == __rhs._M_end
! 	  && _M_flags == __rhs._M_flags
! 	  && _M_match[0] == __rhs._M_match[0];
      }
  
    template<typename _Bi_iter,
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 538,544 ****
  	    {
  	      if (__start == _M_end)
  		{
! 		  _M_match = value_type();
  		  return *this;
  		}
  	      else
--- 539,545 ----
  	    {
  	      if (__start == _M_end)
  		{
! 		  _M_pregex = nullptr;
  		  return *this;
  		}
  	      else
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 571,577 ****
  	      _M_match._M_begin = _M_begin;
  	    }
  	  else
! 	    _M_match = value_type();
  	}
        return *this;
      }
--- 572,578 ----
  	      _M_match._M_begin = _M_begin;
  	    }
  	  else
! 	    _M_pregex = nullptr;
  	}
        return *this;
      }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/regex_compiler.h gcc-5.5.0/libstdc++-v3/include/bits/regex_compiler.h
*** gcc-5.4.0/libstdc++-v3/include/bits/regex_compiler.h	Wed Jul 29 04:30:25 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/regex_compiler.h	Wed Jun  7 17:00:56 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 200,208 ****
  		  const typename _TraitsT::locale_type& __loc,
  		  regex_constants::syntax_option_type __flags)
      {
!       basic_string<typename _TraitsT::char_type> __str(__first, __last);
!       return __compile_nfa(__str.data(), __str.data() + __str.size(), __loc,
!           __flags);
      }
  
    // [28.13.14]
--- 200,209 ----
  		  const typename _TraitsT::locale_type& __loc,
  		  regex_constants::syntax_option_type __flags)
      {
!       using char_type = typename _TraitsT::char_type;
!       const basic_string<char_type> __str(__first, __last);
!       return __compile_nfa<const char_type*, _TraitsT>(__str.data(),
! 	  __str.data() + __str.size(), __loc, __flags);
      }
  
    // [28.13.14]
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/shared_ptr_base.h gcc-5.5.0/libstdc++-v3/include/bits/shared_ptr_base.h
*** gcc-5.4.0/libstdc++-v3/include/bits/shared_ptr_base.h	Fri Dec  4 20:44:22 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/shared_ptr_base.h	Mon Sep  4 17:08:51 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1079,1090 ****
  
        template<typename _Tp1>
  	bool
! 	owner_before(__shared_ptr<_Tp1, _Lp> const& __rhs) const
  	{ return _M_refcount._M_less(__rhs._M_refcount); }
  
        template<typename _Tp1>
  	bool
! 	owner_before(__weak_ptr<_Tp1, _Lp> const& __rhs) const
  	{ return _M_refcount._M_less(__rhs._M_refcount); }
  
  #if __cpp_rtti
--- 1079,1090 ----
  
        template<typename _Tp1>
  	bool
! 	owner_before(__shared_ptr<_Tp1, _Lp> const& __rhs) const noexcept
  	{ return _M_refcount._M_less(__rhs._M_refcount); }
  
        template<typename _Tp1>
  	bool
! 	owner_before(__weak_ptr<_Tp1, _Lp> const& __rhs) const noexcept
  	{ return _M_refcount._M_less(__rhs._M_refcount); }
  
  #if __cpp_rtti
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1441,1452 ****
  
        template<typename _Tp1>
  	bool
! 	owner_before(const __shared_ptr<_Tp1, _Lp>& __rhs) const
  	{ return _M_refcount._M_less(__rhs._M_refcount); }
  
        template<typename _Tp1>
  	bool
! 	owner_before(const __weak_ptr<_Tp1, _Lp>& __rhs) const
  	{ return _M_refcount._M_less(__rhs._M_refcount); }
  
        void
--- 1441,1452 ----
  
        template<typename _Tp1>
  	bool
! 	owner_before(const __shared_ptr<_Tp1, _Lp>& __rhs) const noexcept
  	{ return _M_refcount._M_less(__rhs._M_refcount); }
  
        template<typename _Tp1>
  	bool
! 	owner_before(const __weak_ptr<_Tp1, _Lp>& __rhs) const noexcept
  	{ return _M_refcount._M_less(__rhs._M_refcount); }
  
        void
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1488,1502 ****
      struct _Sp_owner_less : public binary_function<_Tp, _Tp, bool>
      {
        bool
!       operator()(const _Tp& __lhs, const _Tp& __rhs) const
        { return __lhs.owner_before(__rhs); }
  
        bool
!       operator()(const _Tp& __lhs, const _Tp1& __rhs) const
        { return __lhs.owner_before(__rhs); }
  
        bool
!       operator()(const _Tp1& __lhs, const _Tp& __rhs) const
        { return __lhs.owner_before(__rhs); }
      };
  
--- 1488,1502 ----
      struct _Sp_owner_less : public binary_function<_Tp, _Tp, bool>
      {
        bool
!       operator()(const _Tp& __lhs, const _Tp& __rhs) const noexcept
        { return __lhs.owner_before(__rhs); }
  
        bool
!       operator()(const _Tp& __lhs, const _Tp1& __rhs) const noexcept
        { return __lhs.owner_before(__rhs); }
  
        bool
!       operator()(const _Tp1& __lhs, const _Tp& __rhs) const noexcept
        { return __lhs.owner_before(__rhs); }
      };
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/slice_array.h gcc-5.5.0/libstdc++-v3/include/bits/slice_array.h
*** gcc-5.4.0/libstdc++-v3/include/bits/slice_array.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/slice_array.h	Thu Mar  2 18:59:06 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 204,211 ****
  
    template<typename _Tp>
      inline
!     slice_array<_Tp>::slice_array(const slice_array<_Tp>& a)
!     : _M_sz(a._M_sz), _M_stride(a._M_stride), _M_array(a._M_array) {}
  
    //    template<typename _Tp>
    //    inline slice_array<_Tp>::~slice_array () {}
--- 204,211 ----
  
    template<typename _Tp>
      inline
!     slice_array<_Tp>::slice_array(const slice_array<_Tp>& __a)
!     : _M_sz(__a._M_sz), _M_stride(__a._M_stride), _M_array(__a._M_array) {}
  
    //    template<typename _Tp>
    //    inline slice_array<_Tp>::~slice_array () {}
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/sstream.tcc gcc-5.5.0/libstdc++-v3/include/bits/sstream.tcc
*** gcc-5.4.0/libstdc++-v3/include/bits/sstream.tcc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/sstream.tcc	Mon Sep  4 16:41:25 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 88,93 ****
--- 88,112 ----
  	return traits_type::not_eof(__c);
  
        const __size_type __capacity = _M_string.capacity();
+ 
+ #if _GLIBCXX_USE_CXX11_ABI
+       if ((this->epptr() - this->pbase()) < __capacity)
+ 	{
+ 	  // There is additional capacity in _M_string that can be used.
+ 	  char_type* __base = const_cast<char_type*>(_M_string.data());
+ 	  _M_pbump(__base, __base + __capacity, this->pptr() - this->pbase());
+ 	  if (_M_mode & ios_base::in)
+ 	    {
+ 	      const __size_type __nget = this->gptr() - this->eback();
+ 	      const __size_type __eget = this->egptr() - this->eback();
+ 	      this->setg(__base, __base + __nget, __base + __eget + 1);
+ 	    }
+ 	  *this->pptr() = traits_type::to_char_type(__c);
+ 	  this->pbump(1);
+ 	  return __c;
+ 	}
+ #endif
+ 
        const __size_type __max_size = _M_string.max_size();
        const bool __testput = this->pptr() < this->epptr();
        if (__builtin_expect(!__testput && __capacity == __max_size, false))
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/stl_iterator.h gcc-5.5.0/libstdc++-v3/include/bits/stl_iterator.h
*** gcc-5.4.0/libstdc++-v3/include/bits/stl_iterator.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/stl_iterator.h	Tue Aug 23 12:23:11 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 324,332 ****
--- 324,339 ----
      { return !(__x < __y); }
  
    template<typename _Iterator>
+ #if __cplusplus < 201103L
      inline typename reverse_iterator<_Iterator>::difference_type
      operator-(const reverse_iterator<_Iterator>& __x,
  	      const reverse_iterator<_Iterator>& __y)
+ #else
+     inline auto
+     operator-(const reverse_iterator<_Iterator>& __x,
+ 	      const reverse_iterator<_Iterator>& __y)
+     -> decltype(__x.base() - __y.base())
+ #endif
      { return __y.base() - __x.base(); }
  
    template<typename _Iterator>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/stl_map.h gcc-5.5.0/libstdc++-v3/include/bits/stl_map.h
*** gcc-5.4.0/libstdc++-v3/include/bits/stl_map.h	Fri Jun 26 17:36:54 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/stl_map.h	Tue Feb 14 21:17:18 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 161,167 ****
         */
        map()
  #if __cplusplus >= 201103L
!       noexcept(is_nothrow_default_constructible<allocator_type>::value)
  #endif
        : _M_t() { }
  
--- 161,168 ----
         */
        map()
  #if __cplusplus >= 201103L
!       noexcept(is_nothrow_default_constructible<allocator_type>::value
!                && is_nothrow_default_constructible<key_compare>::value)
  #endif
        : _M_t() { }
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 895,901 ****
        template<typename _Kt>
  	auto
  	count(const _Kt& __x) const -> decltype(_M_t._M_count_tr(__x))
! 	{ return _M_t._M_find_tr(__x) == _M_t.end() ? 0 : 1; }
  #endif
        //@}
  
--- 896,902 ----
        template<typename _Kt>
  	auto
  	count(const _Kt& __x) const -> decltype(_M_t._M_count_tr(__x))
! 	{ return _M_t._M_count_tr(__x); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 919,926 ****
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x)
! 	-> decltype(_M_t._M_lower_bound_tr(__x))
! 	{ return _M_t._M_lower_bound_tr(__x); }
  #endif
        //@}
  
--- 920,927 ----
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x)
! 	-> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
! 	{ return iterator(_M_t._M_lower_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 944,951 ****
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x) const
! 	-> decltype(_M_t._M_lower_bound_tr(__x))
! 	{ return _M_t._M_lower_bound_tr(__x); }
  #endif
        //@}
  
--- 945,952 ----
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x) const
! 	-> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
! 	{ return const_iterator(_M_t._M_lower_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 964,971 ****
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x)
! 	-> decltype(_M_t._M_upper_bound_tr(__x))
! 	{ return _M_t._M_upper_bound_tr(__x); }
  #endif
        //@}
  
--- 965,972 ----
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x)
! 	-> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
! 	{ return iterator(_M_t._M_upper_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 984,991 ****
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x) const
! 	-> decltype(_M_t._M_upper_bound_tr(__x))
! 	{ return _M_t._M_upper_bound_tr(__x); }
  #endif
        //@}
  
--- 985,992 ----
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x) const
! 	-> decltype(const_iterator(_M_t._M_upper_bound_tr(__x)))
! 	{ return const_iterator(_M_t._M_upper_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 1013,1020 ****
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x)
! 	-> decltype(_M_t._M_equal_range_tr(__x))
! 	{ return _M_t._M_equal_range_tr(__x); }
  #endif
        //@}
  
--- 1014,1021 ----
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x)
! 	-> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
! 	{ return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 1042,1049 ****
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x) const
! 	-> decltype(_M_t._M_equal_range_tr(__x))
! 	{ return _M_t._M_equal_range_tr(__x); }
  #endif
        //@}
  
--- 1043,1054 ----
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x) const
! 	-> decltype(pair<const_iterator, const_iterator>(
! 	      _M_t._M_equal_range_tr(__x)))
! 	{
! 	  return pair<const_iterator, const_iterator>(
! 	      _M_t._M_equal_range_tr(__x));
! 	}
  #endif
        //@}
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/stl_multimap.h gcc-5.5.0/libstdc++-v3/include/bits/stl_multimap.h
*** gcc-5.4.0/libstdc++-v3/include/bits/stl_multimap.h	Fri Jun 26 17:36:54 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/stl_multimap.h	Tue Feb 14 21:17:18 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 159,165 ****
         */
        multimap()
  #if __cplusplus >= 201103L
!       noexcept(is_nothrow_default_constructible<allocator_type>::value)
  #endif
        : _M_t() { }
  
--- 159,166 ----
         */
        multimap()
  #if __cplusplus >= 201103L
!       noexcept(is_nothrow_default_constructible<allocator_type>::value
!                && is_nothrow_default_constructible<key_compare>::value)
  #endif
        : _M_t() { }
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 824,831 ****
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x)
! 	-> decltype(_M_t._M_lower_bound_tr(__x))
! 	{ return _M_t._M_lower_bound_tr(__x); }
  #endif
        //@}
  
--- 825,832 ----
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x)
! 	-> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
! 	{ return iterator(_M_t._M_lower_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 849,856 ****
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x) const
! 	-> decltype(_M_t._M_lower_bound_tr(__x))
! 	{ return _M_t._M_lower_bound_tr(__x); }
  #endif
        //@}
  
--- 850,857 ----
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x) const
! 	-> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
! 	{ return const_iterator(_M_t._M_lower_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 869,876 ****
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x)
! 	-> decltype(_M_t._M_upper_bound_tr(__x))
! 	{ return _M_t._M_upper_bound_tr(__x); }
  #endif
        //@}
  
--- 870,877 ----
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x)
! 	-> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
! 	{ return iterator(_M_t._M_upper_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 889,896 ****
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x) const
! 	-> decltype(_M_t._M_upper_bound_tr(__x))
! 	{ return _M_t._M_upper_bound_tr(__x); }
  #endif
        //@}
  
--- 890,897 ----
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x) const
! 	-> decltype(const_iterator(_M_t._M_upper_bound_tr(__x)))
! 	{ return const_iterator(_M_t._M_upper_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 916,923 ****
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x)
! 	-> decltype(_M_t._M_equal_range_tr(__x))
! 	{ return _M_t._M_equal_range_tr(__x); }
  #endif
        //@}
  
--- 917,924 ----
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x)
! 	-> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
! 	{ return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 943,950 ****
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x) const
! 	-> decltype(_M_t._M_equal_range_tr(__x))
! 	{ return _M_t._M_equal_range_tr(__x); }
  #endif
        //@}
  
--- 944,955 ----
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x) const
! 	-> decltype(pair<const_iterator, const_iterator>(
! 	      _M_t._M_equal_range_tr(__x)))
! 	{
! 	  return pair<const_iterator, const_iterator>(
! 	      _M_t._M_equal_range_tr(__x));
! 	}
  #endif
        //@}
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/stl_multiset.h gcc-5.5.0/libstdc++-v3/include/bits/stl_multiset.h
*** gcc-5.4.0/libstdc++-v3/include/bits/stl_multiset.h	Tue Nov 10 18:08:50 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/stl_multiset.h	Tue Feb 14 21:17:18 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 139,145 ****
         */
        multiset()
  #if __cplusplus >= 201103L
!       noexcept(is_nothrow_default_constructible<allocator_type>::value)
  #endif
        : _M_t() { }
  
--- 139,146 ----
         */
        multiset()
  #if __cplusplus >= 201103L
!       noexcept(is_nothrow_default_constructible<allocator_type>::value
!                && is_nothrow_default_constructible<key_compare>::value)
  #endif
        : _M_t() { }
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 718,731 ****
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x)
! 	-> decltype(_M_t._M_lower_bound_tr(__x))
! 	{ return _M_t._M_lower_bound_tr(__x); }
  
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x) const
! 	-> decltype(_M_t._M_lower_bound_tr(__x))
! 	{ return _M_t._M_lower_bound_tr(__x); }
  #endif
        //@}
  
--- 719,732 ----
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x)
! 	-> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
! 	{ return iterator(_M_t._M_lower_bound_tr(__x)); }
  
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x) const
! 	-> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
! 	{ return iterator(_M_t._M_lower_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 748,761 ****
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x)
! 	-> decltype(_M_t._M_upper_bound_tr(__x))
! 	{ return _M_t._M_upper_bound_tr(__x); }
  
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x) const
! 	-> decltype(_M_t._M_upper_bound_tr(__x))
! 	{ return _M_t._M_upper_bound_tr(__x); }
  #endif
        //@}
  
--- 749,762 ----
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x)
! 	-> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
! 	{ return iterator(_M_t._M_upper_bound_tr(__x)); }
  
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x) const
! 	-> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
! 	{ return iterator(_M_t._M_upper_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 787,800 ****
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x)
! 	-> decltype(_M_t._M_equal_range_tr(__x))
! 	{ return _M_t._M_equal_range_tr(__x); }
  
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x) const
! 	-> decltype(_M_t._M_equal_range_tr(__x))
! 	{ return _M_t._M_equal_range_tr(__x); }
  #endif
        //@}
  
--- 788,801 ----
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x)
! 	-> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
! 	{ return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); }
  
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x) const
! 	-> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
! 	{ return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); }
  #endif
        //@}
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/stl_set.h gcc-5.5.0/libstdc++-v3/include/bits/stl_set.h
*** gcc-5.4.0/libstdc++-v3/include/bits/stl_set.h	Tue Nov 10 18:08:50 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/stl_set.h	Tue Feb 14 21:17:18 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 141,147 ****
         */
        set()
  #if __cplusplus >= 201103L
!       noexcept(is_nothrow_default_constructible<allocator_type>::value)
  #endif
        : _M_t() { }
  
--- 141,148 ----
         */
        set()
  #if __cplusplus >= 201103L
!       noexcept(is_nothrow_default_constructible<allocator_type>::value
!                && is_nothrow_default_constructible<key_compare>::value)
  #endif
        : _M_t() { }
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 672,678 ****
  	auto
  	count(const _Kt& __x) const
  	-> decltype(_M_t._M_count_tr(__x))
! 	{ return _M_t._M_find_tr(__x) == _M_t.end() ? 0 : 1; }
  #endif
        //@}
  
--- 673,679 ----
  	auto
  	count(const _Kt& __x) const
  	-> decltype(_M_t._M_count_tr(__x))
! 	{ return _M_t._M_count_tr(__x); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 737,750 ****
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x)
! 	-> decltype(_M_t._M_lower_bound_tr(__x))
! 	{ return _M_t._M_lower_bound_tr(__x); }
  
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x) const
! 	-> decltype(_M_t._M_lower_bound_tr(__x))
! 	{ return _M_t._M_lower_bound_tr(__x); }
  #endif
        //@}
  
--- 738,751 ----
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x)
! 	-> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
! 	{ return iterator(_M_t._M_lower_bound_tr(__x)); }
  
        template<typename _Kt>
  	auto
  	lower_bound(const _Kt& __x) const
! 	-> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
! 	{ return const_iterator(_M_t._M_lower_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 767,780 ****
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x)
! 	-> decltype(_M_t._M_upper_bound_tr(__x))
! 	{ return _M_t._M_upper_bound_tr(__x); }
  
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x) const
! 	-> decltype(_M_t._M_upper_bound_tr(__x))
! 	{ return _M_t._M_upper_bound_tr(__x); }
  #endif
        //@}
  
--- 768,781 ----
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x)
! 	-> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
! 	{ return iterator(_M_t._M_upper_bound_tr(__x)); }
  
        template<typename _Kt>
  	auto
  	upper_bound(const _Kt& __x) const
! 	-> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
! 	{ return const_iterator(_M_t._M_upper_bound_tr(__x)); }
  #endif
        //@}
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*** 806,819 ****
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x)
! 	-> decltype(_M_t._M_equal_range_tr(__x))
! 	{ return _M_t._M_equal_range_tr(__x); }
  
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x) const
! 	-> decltype(_M_t._M_equal_range_tr(__x))
! 	{ return _M_t._M_equal_range_tr(__x); }
  #endif
        //@}
  
--- 807,820 ----
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x)
! 	-> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
! 	{ return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); }
  
        template<typename _Kt>
  	auto
  	equal_range(const _Kt& __x) const
! 	-> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
! 	{ return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); }
  #endif
        //@}
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/stl_stack.h gcc-5.5.0/libstdc++-v3/include/bits/stl_stack.h
*** gcc-5.4.0/libstdc++-v3/include/bits/stl_stack.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/stl_stack.h	Mon Sep  4 16:41:29 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 86,92 ****
     *
     *  The second template parameter defines the type of the underlying
     *  sequence/container.  It defaults to std::deque, but it can be
!    *  any type that supports @c back, @c push_back, and @c pop_front,
     *  such as std::list, std::vector, or an appropriate user-defined
     *  type.
     *
--- 86,92 ----
     *
     *  The second template parameter defines the type of the underlying
     *  sequence/container.  It defaults to std::deque, but it can be
!    *  any type that supports @c back, @c push_back, and @c pop_back,
     *  such as std::list, std::vector, or an appropriate user-defined
     *  type.
     *
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/stl_tree.h gcc-5.5.0/libstdc++-v3/include/bits/stl_tree.h
*** gcc-5.4.0/libstdc++-v3/include/bits/stl_tree.h	Thu May 28 12:33:36 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/stl_tree.h	Tue Aug 23 14:20:50 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 841,847 ****
        }
  
        _Rb_tree(_Rb_tree&& __x)
!       : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator())
        {
  	if (__x._M_root() != 0)
  	  _M_move_data(__x, std::true_type());
--- 841,848 ----
        }
  
        _Rb_tree(_Rb_tree&& __x)
!       : _M_impl(__x._M_impl._M_key_compare,
! 		std::move(__x._M_get_Node_allocator()))
        {
  	if (__x._M_root() != 0)
  	  _M_move_data(__x, std::true_type());
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1245,1251 ****
  
  #if __cplusplus >= 201103L
        _Rb_tree&
!       operator=(_Rb_tree&&) noexcept(_Alloc_traits::_S_nothrow_move());
  
        template<typename _Iterator>
  	void
--- 1246,1254 ----
  
  #if __cplusplus >= 201103L
        _Rb_tree&
!       operator=(_Rb_tree&&)
!       noexcept(_Alloc_traits::_S_nothrow_move()
! 	       && is_nothrow_move_assignable<_Compare>::value);
  
        template<typename _Iterator>
  	void
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1264,1269 ****
--- 1267,1281 ----
        // which might result in a copy not a move.
        void
        _M_move_data(_Rb_tree&, std::false_type);
+ 
+       // Move assignment from container with equal allocator.
+       void
+       _M_move_assign(_Rb_tree&, std::true_type);
+ 
+       // Move assignment from container with possibly non-equal allocator,
+       // which might result in a copy not a move.
+       void
+       _M_move_assign(_Rb_tree&, std::false_type);
  #endif
      };
  
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1379,1401 ****
  
    template<typename _Key, typename _Val, typename _KeyOfValue,
             typename _Compare, typename _Alloc>
!     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
      _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
!     operator=(_Rb_tree&& __x)
!     noexcept(_Alloc_traits::_S_nothrow_move())
      {
!       _M_impl._M_key_compare = __x._M_impl._M_key_compare;
!       if (_Alloc_traits::_S_propagate_on_move_assign()
! 	  || _Alloc_traits::_S_always_equal()
! 	  || _M_get_Node_allocator() == __x._M_get_Node_allocator())
! 	{
! 	  clear();
! 	  if (__x._M_root() != nullptr)
! 	    _M_move_data(__x, std::true_type());
! 	  std::__alloc_on_move(_M_get_Node_allocator(),
! 			       __x._M_get_Node_allocator());
! 	  return *this;
! 	}
  
        // Try to move each node reusing existing nodes and copying __x nodes
        // structure.
--- 1391,1415 ----
  
    template<typename _Key, typename _Val, typename _KeyOfValue,
             typename _Compare, typename _Alloc>
!     inline void
      _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
!     _M_move_assign(_Rb_tree& __x, true_type)
      {
!       clear();
!       if (__x._M_root() != nullptr)
! 	_M_move_data(__x, std::true_type());
!       std::__alloc_on_move(_M_get_Node_allocator(),
! 			   __x._M_get_Node_allocator());
!     }
! 
!   template<typename _Key, typename _Val, typename _KeyOfValue,
!            typename _Compare, typename _Alloc>
!     void
!     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
!     _M_move_assign(_Rb_tree& __x, false_type)
!     {
!       if (_M_get_Node_allocator() == __x._M_get_Node_allocator())
! 	return _M_move_assign(__x, true_type{});
  
        // Try to move each node reusing existing nodes and copying __x nodes
        // structure.
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1415,1420 ****
--- 1429,1449 ----
  	  _M_impl._M_node_count = __x._M_impl._M_node_count;
  	  __x.clear();
  	}
+     }
+ 
+   template<typename _Key, typename _Val, typename _KeyOfValue,
+            typename _Compare, typename _Alloc>
+     inline _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
+     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
+     operator=(_Rb_tree&& __x)
+     noexcept(_Alloc_traits::_S_nothrow_move()
+ 	     && is_nothrow_move_assignable<_Compare>::value)
+     {
+       _M_impl._M_key_compare = __x._M_impl._M_key_compare;
+       constexpr bool __move_storage =
+ 	  _Alloc_traits::_S_propagate_on_move_assign()
+ 	  || _Alloc_traits::_S_always_equal();
+       _M_move_assign(__x, __bool_constant<__move_storage>());
        return *this;
      }
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/uniform_int_dist.h gcc-5.5.0/libstdc++-v3/include/bits/uniform_int_dist.h
*** gcc-5.4.0/libstdc++-v3/include/bits/uniform_int_dist.h	Wed Apr 20 13:00:24 2016
--- gcc-5.5.0/libstdc++-v3/include/bits/uniform_int_dist.h	Mon Oct  3 14:42:06 2016
***************
*** 36,45 ****
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
- _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
    namespace __detail
    {
      /* Determine whether number is a power of 2.  */
      template<typename _Tp>
        inline bool
--- 36,45 ----
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
  
    namespace __detail
    {
+ _GLIBCXX_BEGIN_NAMESPACE_VERSION
      /* Determine whether number is a power of 2.  */
      template<typename _Tp>
        inline bool
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 47,54 ****
--- 47,57 ----
        {
  	return ((__x - 1) & __x) == 0;
        };
+ _GLIBCXX_END_NAMESPACE_VERSION
    }
  
+ _GLIBCXX_BEGIN_NAMESPACE_VERSION
+ 
    /**
     * @brief Uniform discrete distribution for random numbers.
     *
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/bits/unique_ptr.h gcc-5.5.0/libstdc++-v3/include/bits/unique_ptr.h
*** gcc-5.4.0/libstdc++-v3/include/bits/unique_ptr.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/bits/unique_ptr.h	Wed Oct 19 10:36:24 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 167,175 ****
         */
        explicit
        unique_ptr(pointer __p) noexcept
!       : _M_t(__p, deleter_type())
!       { static_assert(!is_pointer<deleter_type>::value,
! 		     "constructed with null function pointer deleter"); }
  
        /** Takes ownership of a pointer.
         *
--- 167,178 ----
         */
        explicit
        unique_ptr(pointer __p) noexcept
!       : _M_t()
!       {
! 	std::get<0>(_M_t) = __p;
! 	static_assert(!is_pointer<deleter_type>::value,
! 		     "constructed with null function pointer deleter");
!       }
  
        /** Takes ownership of a pointer.
         *
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/c_global/cmath gcc-5.5.0/libstdc++-v3/include/c_global/cmath
*** gcc-5.4.0/libstdc++-v3/include/c_global/cmath	Mon Jan 18 16:28:48 2016
--- gcc-5.5.0/libstdc++-v3/include/c_global/cmath	Thu Dec  1 15:15:40 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 558,564 ****
  
  #if __cplusplus >= 201103L
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr int
    fpclassify(float __x)
    { return __builtin_fpclassify(FP_NAN, FP_INFINITE, FP_NORMAL,
--- 558,564 ----
  
  #if __cplusplus >= 201103L
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr int
    fpclassify(float __x)
    { return __builtin_fpclassify(FP_NAN, FP_INFINITE, FP_NORMAL,
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 575,587 ****
  				FP_SUBNORMAL, FP_ZERO, __x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                int>::__type
      fpclassify(_Tp __x)
      { return __x != 0 ? FP_NORMAL : FP_ZERO; }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    isfinite(float __x)
    { return __builtin_isfinite(__x); }
--- 575,589 ----
  				FP_SUBNORMAL, FP_ZERO, __x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                int>::__type
      fpclassify(_Tp __x)
      { return __x != 0 ? FP_NORMAL : FP_ZERO; }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    isfinite(float __x)
    { return __builtin_isfinite(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 595,607 ****
    { return __builtin_isfinite(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      isfinite(_Tp __x)
      { return true; }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    isinf(float __x)
    { return __builtin_isinf(__x); }
--- 597,611 ----
    { return __builtin_isfinite(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      isfinite(_Tp __x)
      { return true; }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    isinf(float __x)
    { return __builtin_isinf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 615,627 ****
    { return __builtin_isinf(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      isinf(_Tp __x)
      { return false; }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    isnan(float __x)
    { return __builtin_isnan(__x); }
--- 619,633 ----
    { return __builtin_isinf(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      isinf(_Tp __x)
      { return false; }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    isnan(float __x)
    { return __builtin_isnan(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 635,647 ****
    { return __builtin_isnan(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      isnan(_Tp __x)
      { return false; }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    isnormal(float __x)
    { return __builtin_isnormal(__x); }
--- 641,655 ----
    { return __builtin_isnan(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      isnan(_Tp __x)
      { return false; }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    isnormal(float __x)
    { return __builtin_isnormal(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 655,667 ****
    { return __builtin_isnormal(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      isnormal(_Tp __x)
      { return __x != 0 ? true : false; }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    // The front-end doesn't provide a type generic builtin (libstdc++/58625).
    constexpr bool
    signbit(float __x)
--- 663,677 ----
    { return __builtin_isnormal(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      isnormal(_Tp __x)
      { return __x != 0 ? true : false; }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    // The front-end doesn't provide a type generic builtin (libstdc++/58625).
    constexpr bool
    signbit(float __x)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 676,688 ****
    { return __builtin_signbitl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      signbit(_Tp __x)
      { return __x < 0 ? true : false; }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    isgreater(float __x, float __y)
    { return __builtin_isgreater(__x, __y); }
--- 686,700 ----
    { return __builtin_signbitl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value,
                                                bool>::__type
      signbit(_Tp __x)
      { return __x < 0 ? true : false; }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    isgreater(float __x, float __y)
    { return __builtin_isgreater(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 696,701 ****
--- 708,714 ----
    { return __builtin_isgreater(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename
      __gnu_cxx::__enable_if<(__is_arithmetic<_Tp>::__value
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 705,712 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_isgreater(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    isgreaterequal(float __x, float __y)
    { return __builtin_isgreaterequal(__x, __y); }
--- 718,726 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_isgreater(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    isgreaterequal(float __x, float __y)
    { return __builtin_isgreaterequal(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 720,725 ****
--- 734,740 ----
    { return __builtin_isgreaterequal(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename
      __gnu_cxx::__enable_if<(__is_arithmetic<_Tp>::__value
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 729,736 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_isgreaterequal(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    isless(float __x, float __y)
    { return __builtin_isless(__x, __y); }
--- 744,752 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_isgreaterequal(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    isless(float __x, float __y)
    { return __builtin_isless(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 744,749 ****
--- 760,766 ----
    { return __builtin_isless(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename
      __gnu_cxx::__enable_if<(__is_arithmetic<_Tp>::__value
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 753,760 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_isless(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    islessequal(float __x, float __y)
    { return __builtin_islessequal(__x, __y); }
--- 770,778 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_isless(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    islessequal(float __x, float __y)
    { return __builtin_islessequal(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 768,773 ****
--- 786,792 ----
    { return __builtin_islessequal(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename
      __gnu_cxx::__enable_if<(__is_arithmetic<_Tp>::__value
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 777,784 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_islessequal(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    islessgreater(float __x, float __y)
    { return __builtin_islessgreater(__x, __y); }
--- 796,804 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_islessequal(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    islessgreater(float __x, float __y)
    { return __builtin_islessgreater(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 792,797 ****
--- 812,818 ----
    { return __builtin_islessgreater(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename
      __gnu_cxx::__enable_if<(__is_arithmetic<_Tp>::__value
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 801,808 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_islessgreater(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr bool
    isunordered(float __x, float __y)
    { return __builtin_isunordered(__x, __y); }
--- 822,830 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_islessgreater(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr bool
    isunordered(float __x, float __y)
    { return __builtin_isunordered(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 816,821 ****
--- 838,844 ----
    { return __builtin_isunordered(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename
      __gnu_cxx::__enable_if<(__is_arithmetic<_Tp>::__value
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 825,830 ****
--- 848,854 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return __builtin_isunordered(__type(__x), __type(__y));
      }
+ #endif
  
  #else
  
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1209,1215 ****
    using ::truncl;
  
    /// Additional overloads.
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    acosh(float __x)
    { return __builtin_acoshf(__x); }
--- 1233,1239 ----
    using ::truncl;
  
    /// Additional overloads.
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    acosh(float __x)
    { return __builtin_acoshf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1219,1231 ****
    { return __builtin_acoshl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      acosh(_Tp __x)
      { return __builtin_acosh(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    asinh(float __x)
    { return __builtin_asinhf(__x); }
--- 1243,1257 ----
    { return __builtin_acoshl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      acosh(_Tp __x)
      { return __builtin_acosh(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    asinh(float __x)
    { return __builtin_asinhf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1235,1247 ****
    { return __builtin_asinhl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      asinh(_Tp __x)
      { return __builtin_asinh(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    atanh(float __x)
    { return __builtin_atanhf(__x); }
--- 1261,1275 ----
    { return __builtin_asinhl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      asinh(_Tp __x)
      { return __builtin_asinh(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    atanh(float __x)
    { return __builtin_atanhf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1251,1263 ****
    { return __builtin_atanhl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      atanh(_Tp __x)
      { return __builtin_atanh(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    cbrt(float __x)
    { return __builtin_cbrtf(__x); }
--- 1279,1293 ----
    { return __builtin_atanhl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      atanh(_Tp __x)
      { return __builtin_atanh(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    cbrt(float __x)
    { return __builtin_cbrtf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1267,1279 ****
    { return __builtin_cbrtl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      cbrt(_Tp __x)
      { return __builtin_cbrt(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    copysign(float __x, float __y)
    { return __builtin_copysignf(__x, __y); }
--- 1297,1311 ----
    { return __builtin_cbrtl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      cbrt(_Tp __x)
      { return __builtin_cbrt(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    copysign(float __x, float __y)
    { return __builtin_copysignf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1283,1288 ****
--- 1315,1321 ----
    { return __builtin_copysignl(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename __gnu_cxx::__promote_2<_Tp, _Up>::__type
      copysign(_Tp __x, _Up __y)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1290,1297 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return copysign(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    erf(float __x)
    { return __builtin_erff(__x); }
--- 1323,1331 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return copysign(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    erf(float __x)
    { return __builtin_erff(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1301,1313 ****
    { return __builtin_erfl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      erf(_Tp __x)
      { return __builtin_erf(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    erfc(float __x)
    { return __builtin_erfcf(__x); }
--- 1335,1349 ----
    { return __builtin_erfl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      erf(_Tp __x)
      { return __builtin_erf(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    erfc(float __x)
    { return __builtin_erfcf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1317,1329 ****
    { return __builtin_erfcl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      erfc(_Tp __x)
      { return __builtin_erfc(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    exp2(float __x)
    { return __builtin_exp2f(__x); }
--- 1353,1367 ----
    { return __builtin_erfcl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      erfc(_Tp __x)
      { return __builtin_erfc(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    exp2(float __x)
    { return __builtin_exp2f(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1333,1345 ****
    { return __builtin_exp2l(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      exp2(_Tp __x)
      { return __builtin_exp2(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    expm1(float __x)
    { return __builtin_expm1f(__x); }
--- 1371,1385 ----
    { return __builtin_exp2l(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      exp2(_Tp __x)
      { return __builtin_exp2(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    expm1(float __x)
    { return __builtin_expm1f(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1349,1361 ****
    { return __builtin_expm1l(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      expm1(_Tp __x)
      { return __builtin_expm1(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    fdim(float __x, float __y)
    { return __builtin_fdimf(__x, __y); }
--- 1389,1403 ----
    { return __builtin_expm1l(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      expm1(_Tp __x)
      { return __builtin_expm1(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    fdim(float __x, float __y)
    { return __builtin_fdimf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1365,1370 ****
--- 1407,1413 ----
    { return __builtin_fdiml(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename __gnu_cxx::__promote_2<_Tp, _Up>::__type
      fdim(_Tp __x, _Up __y)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1372,1379 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return fdim(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    fma(float __x, float __y, float __z)
    { return __builtin_fmaf(__x, __y, __z); }
--- 1415,1423 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return fdim(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    fma(float __x, float __y, float __z)
    { return __builtin_fmaf(__x, __y, __z); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1383,1388 ****
--- 1427,1433 ----
    { return __builtin_fmal(__x, __y, __z); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up, typename _Vp>
      constexpr typename __gnu_cxx::__promote_3<_Tp, _Up, _Vp>::__type
      fma(_Tp __x, _Up __y, _Vp __z)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1390,1397 ****
        typedef typename __gnu_cxx::__promote_3<_Tp, _Up, _Vp>::__type __type;
        return fma(__type(__x), __type(__y), __type(__z));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    fmax(float __x, float __y)
    { return __builtin_fmaxf(__x, __y); }
--- 1435,1443 ----
        typedef typename __gnu_cxx::__promote_3<_Tp, _Up, _Vp>::__type __type;
        return fma(__type(__x), __type(__y), __type(__z));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    fmax(float __x, float __y)
    { return __builtin_fmaxf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1401,1406 ****
--- 1447,1453 ----
    { return __builtin_fmaxl(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename __gnu_cxx::__promote_2<_Tp, _Up>::__type
      fmax(_Tp __x, _Up __y)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1408,1415 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return fmax(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    fmin(float __x, float __y)
    { return __builtin_fminf(__x, __y); }
--- 1455,1463 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return fmax(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    fmin(float __x, float __y)
    { return __builtin_fminf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1419,1424 ****
--- 1467,1473 ----
    { return __builtin_fminl(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename __gnu_cxx::__promote_2<_Tp, _Up>::__type
      fmin(_Tp __x, _Up __y)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1426,1433 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return fmin(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    hypot(float __x, float __y)
    { return __builtin_hypotf(__x, __y); }
--- 1475,1483 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return fmin(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    hypot(float __x, float __y)
    { return __builtin_hypotf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1437,1442 ****
--- 1487,1493 ----
    { return __builtin_hypotl(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename __gnu_cxx::__promote_2<_Tp, _Up>::__type
      hypot(_Tp __x, _Up __y)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1444,1451 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return hypot(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr int
    ilogb(float __x)
    { return __builtin_ilogbf(__x); }
--- 1495,1503 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return hypot(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr int
    ilogb(float __x)
    { return __builtin_ilogbf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1455,1468 ****
    { return __builtin_ilogbl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr
      typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                      int>::__type
      ilogb(_Tp __x)
      { return __builtin_ilogb(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    lgamma(float __x)
    { return __builtin_lgammaf(__x); }
--- 1507,1522 ----
    { return __builtin_ilogbl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr
      typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                      int>::__type
      ilogb(_Tp __x)
      { return __builtin_ilogb(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    lgamma(float __x)
    { return __builtin_lgammaf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1472,1484 ****
    { return __builtin_lgammal(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      lgamma(_Tp __x)
      { return __builtin_lgamma(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr long long
    llrint(float __x)
    { return __builtin_llrintf(__x); }
--- 1526,1540 ----
    { return __builtin_lgammal(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      lgamma(_Tp __x)
      { return __builtin_lgamma(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr long long
    llrint(float __x)
    { return __builtin_llrintf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1488,1500 ****
    { return __builtin_llrintl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                long long>::__type
      llrint(_Tp __x)
      { return __builtin_llrint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr long long
    llround(float __x)
    { return __builtin_llroundf(__x); }
--- 1544,1558 ----
    { return __builtin_llrintl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                long long>::__type
      llrint(_Tp __x)
      { return __builtin_llrint(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr long long
    llround(float __x)
    { return __builtin_llroundf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1504,1516 ****
    { return __builtin_llroundl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                long long>::__type
      llround(_Tp __x)
      { return __builtin_llround(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    log1p(float __x)
    { return __builtin_log1pf(__x); }
--- 1562,1576 ----
    { return __builtin_llroundl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                long long>::__type
      llround(_Tp __x)
      { return __builtin_llround(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    log1p(float __x)
    { return __builtin_log1pf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1520,1532 ****
    { return __builtin_log1pl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      log1p(_Tp __x)
      { return __builtin_log1p(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    // DR 568.
    constexpr float
    log2(float __x)
--- 1580,1594 ----
    { return __builtin_log1pl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      log1p(_Tp __x)
      { return __builtin_log1p(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    // DR 568.
    constexpr float
    log2(float __x)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1537,1549 ****
    { return __builtin_log2l(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      log2(_Tp __x)
      { return __builtin_log2(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    logb(float __x)
    { return __builtin_logbf(__x); }
--- 1599,1613 ----
    { return __builtin_log2l(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      log2(_Tp __x)
      { return __builtin_log2(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    logb(float __x)
    { return __builtin_logbf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1553,1565 ****
    { return __builtin_logbl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      logb(_Tp __x)
      { return __builtin_logb(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr long
    lrint(float __x)
    { return __builtin_lrintf(__x); }
--- 1617,1631 ----
    { return __builtin_logbl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      logb(_Tp __x)
      { return __builtin_logb(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr long
    lrint(float __x)
    { return __builtin_lrintf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1569,1581 ****
    { return __builtin_lrintl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                long>::__type
      lrint(_Tp __x)
      { return __builtin_lrint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr long
    lround(float __x)
    { return __builtin_lroundf(__x); }
--- 1635,1649 ----
    { return __builtin_lrintl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                long>::__type
      lrint(_Tp __x)
      { return __builtin_lrint(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr long
    lround(float __x)
    { return __builtin_lroundf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1585,1597 ****
    { return __builtin_lroundl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                long>::__type
      lround(_Tp __x)
      { return __builtin_lround(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    nearbyint(float __x)
    { return __builtin_nearbyintf(__x); }
--- 1653,1667 ----
    { return __builtin_lroundl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                long>::__type
      lround(_Tp __x)
      { return __builtin_lround(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    nearbyint(float __x)
    { return __builtin_nearbyintf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1601,1613 ****
    { return __builtin_nearbyintl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      nearbyint(_Tp __x)
      { return __builtin_nearbyint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    nextafter(float __x, float __y)
    { return __builtin_nextafterf(__x, __y); }
--- 1671,1685 ----
    { return __builtin_nearbyintl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      nearbyint(_Tp __x)
      { return __builtin_nearbyint(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    nextafter(float __x, float __y)
    { return __builtin_nextafterf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1617,1622 ****
--- 1689,1695 ----
    { return __builtin_nextafterl(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename __gnu_cxx::__promote_2<_Tp, _Up>::__type
      nextafter(_Tp __x, _Up __y)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1624,1631 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return nextafter(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    nexttoward(float __x, long double __y)
    { return __builtin_nexttowardf(__x, __y); }
--- 1697,1705 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return nextafter(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    nexttoward(float __x, long double __y)
    { return __builtin_nexttowardf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1635,1647 ****
    { return __builtin_nexttowardl(__x, __y); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      nexttoward(_Tp __x, long double __y)
      { return __builtin_nexttoward(__x, __y); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    remainder(float __x, float __y)
    { return __builtin_remainderf(__x, __y); }
--- 1709,1723 ----
    { return __builtin_nexttowardl(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      nexttoward(_Tp __x, long double __y)
      { return __builtin_nexttoward(__x, __y); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    remainder(float __x, float __y)
    { return __builtin_remainderf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1651,1656 ****
--- 1727,1733 ----
    { return __builtin_remainderl(__x, __y); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      constexpr typename __gnu_cxx::__promote_2<_Tp, _Up>::__type
      remainder(_Tp __x, _Up __y)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1658,1665 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return remainder(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    remquo(float __x, float __y, int* __pquo)
    { return __builtin_remquof(__x, __y, __pquo); }
--- 1735,1743 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return remainder(__type(__x), __type(__y));
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    remquo(float __x, float __y, int* __pquo)
    { return __builtin_remquof(__x, __y, __pquo); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1669,1674 ****
--- 1747,1753 ----
    { return __builtin_remquol(__x, __y, __pquo); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp, typename _Up>
      inline typename __gnu_cxx::__promote_2<_Tp, _Up>::__type
      remquo(_Tp __x, _Up __y, int* __pquo)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1676,1683 ****
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return remquo(__type(__x), __type(__y), __pquo);
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    rint(float __x)
    { return __builtin_rintf(__x); }
--- 1755,1763 ----
        typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type;
        return remquo(__type(__x), __type(__y), __pquo);
      }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    rint(float __x)
    { return __builtin_rintf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1687,1699 ****
    { return __builtin_rintl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      rint(_Tp __x)
      { return __builtin_rint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    round(float __x)
    { return __builtin_roundf(__x); }
--- 1767,1781 ----
    { return __builtin_rintl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      rint(_Tp __x)
      { return __builtin_rint(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    round(float __x)
    { return __builtin_roundf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1703,1715 ****
    { return __builtin_roundl(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      round(_Tp __x)
      { return __builtin_round(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    scalbln(float __x, long __ex)
    { return __builtin_scalblnf(__x, __ex); }
--- 1785,1799 ----
    { return __builtin_roundl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      round(_Tp __x)
      { return __builtin_round(__x); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    scalbln(float __x, long __ex)
    { return __builtin_scalblnf(__x, __ex); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1719,1731 ****
    { return __builtin_scalblnl(__x, __ex); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      scalbln(_Tp __x, long __ex)
      { return __builtin_scalbln(__x, __ex); }
   
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    scalbn(float __x, int __ex)
    { return __builtin_scalbnf(__x, __ex); }
--- 1803,1817 ----
    { return __builtin_scalblnl(__x, __ex); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      scalbln(_Tp __x, long __ex)
      { return __builtin_scalbln(__x, __ex); }
+ #endif
   
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    scalbn(float __x, int __ex)
    { return __builtin_scalbnf(__x, __ex); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1735,1747 ****
    { return __builtin_scalbnl(__x, __ex); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      scalbn(_Tp __x, int __ex)
      { return __builtin_scalbn(__x, __ex); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    tgamma(float __x)
    { return __builtin_tgammaf(__x); }
--- 1821,1835 ----
    { return __builtin_scalbnl(__x, __ex); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      scalbn(_Tp __x, int __ex)
      { return __builtin_scalbn(__x, __ex); }
+ #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    tgamma(float __x)
    { return __builtin_tgammaf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1751,1763 ****
    { return __builtin_tgammal(__x); }
  #endif
  
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      tgamma(_Tp __x)
      { return __builtin_tgamma(__x); }
   
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    constexpr float
    trunc(float __x)
    { return __builtin_truncf(__x); }
--- 1839,1853 ----
    { return __builtin_tgammal(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      tgamma(_Tp __x)
      { return __builtin_tgamma(__x); }
+ #endif
   
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    constexpr float
    trunc(float __x)
    { return __builtin_truncf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1767,1777 ****
--- 1857,1869 ----
    { return __builtin_truncl(__x); }
  #endif
  
+ #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_INT
    template<typename _Tp>
      constexpr typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, 
                                                double>::__type
      trunc(_Tp __x)
      { return __builtin_trunc(__x); }
+ #endif
  
  _GLIBCXX_END_NAMESPACE_VERSION
  } // namespace
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/debug/safe_iterator.h gcc-5.5.0/libstdc++-v3/include/debug/safe_iterator.h
*** gcc-5.4.0/libstdc++-v3/include/debug/safe_iterator.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/debug/safe_iterator.h	Tue Sep 27 15:37:44 2016
*************** namespace __gnu_debug
*** 329,335 ****
  	_GLIBCXX_DEBUG_VERIFY(this->_M_incrementable(),
  			      _M_message(__msg_bad_inc)
  			      ._M_iterator(*this, "this"));
! 	__gnu_cxx::__scoped_lock(this->_M_get_mutex());
  	++base();
  	return *this;
        }
--- 329,335 ----
  	_GLIBCXX_DEBUG_VERIFY(this->_M_incrementable(),
  			      _M_message(__msg_bad_inc)
  			      ._M_iterator(*this, "this"));
! 	__gnu_cxx::__scoped_lock __l(this->_M_get_mutex());
  	++base();
  	return *this;
        }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/debug/string gcc-5.5.0/libstdc++-v3/include/debug/string
*** gcc-5.4.0/libstdc++-v3/include/debug/string	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/debug/string	Tue Jul 12 10:56:11 2016
***************
*** 36,53 ****
  
  namespace __gnu_debug
  {
!   /// Class std::basic_string with safety/checking/debug instrumentation.
!   template<typename _CharT, typename _Traits = std::char_traits<_CharT>,
! 	   typename _Allocator = std::allocator<_CharT> >
!     class basic_string
!     : public __gnu_debug::_Safe_container<
! 	basic_string<_CharT, _Traits, _Allocator>,
! 	_Allocator, _Safe_sequence, false>,
!       public std::basic_string<_CharT, _Traits, _Allocator>
!     {
!       typedef std::basic_string<_CharT, _Traits, _Allocator>	_Base;
!       typedef __gnu_debug::_Safe_container<
! 	basic_string, _Allocator, _Safe_sequence, false>	_Safe;
  
    public:
      // types:
--- 36,54 ----
  
  namespace __gnu_debug
  {
! /// Class std::basic_string with safety/checking/debug instrumentation.
! template<typename _CharT, typename _Traits = std::char_traits<_CharT>,
! 	 typename _Allocator = std::allocator<_CharT> >
!   class basic_string
!   : public __gnu_debug::_Safe_container<
!       basic_string<_CharT, _Traits, _Allocator>,
!       _Allocator, _Safe_sequence, bool(_GLIBCXX_USE_CXX11_ABI)>,
!     public std::basic_string<_CharT, _Traits, _Allocator>
!   {
!     typedef std::basic_string<_CharT, _Traits, _Allocator>	_Base;
!     typedef __gnu_debug::_Safe_container<
!       basic_string, _Allocator, _Safe_sequence, bool(_GLIBCXX_USE_CXX11_ABI)>
!       _Safe;
  
    public:
      // types:
*************** namespace __gnu_debug
*** 71,79 ****
  
      using _Base::npos;
  
      // 21.3.1 construct/copy/destroy:
!     explicit basic_string(const _Allocator& __a = _Allocator())
!     // _GLIBCXX_NOEXCEPT
      : _Base(__a) { }
  
  #if __cplusplus < 201103L
--- 72,86 ----
  
      using _Base::npos;
  
+     basic_string()
+ #if __cplusplus >= 201103L
+     noexcept(std::is_nothrow_default_constructible<_Base>::value)
+ #endif
+     : _Base() { }
+ 
      // 21.3.1 construct/copy/destroy:
!     explicit
!     basic_string(const _Allocator& __a) _GLIBCXX_NOEXCEPT
      : _Base(__a) { }
  
  #if __cplusplus < 201103L
*************** namespace __gnu_debug
*** 90,96 ****
--- 97,115 ----
      : _Base(__l, __a)
      { }
  
+ #if _GLIBCXX_USE_CXX11_ABI
+     basic_string(const basic_string& __s, const _Allocator& __a)
+     : _Base(__s, __a) { }
+ 
+     basic_string(basic_string&& __s, const _Allocator& __a)
+     : _Base(std::move(__s), __a) { }
+ #endif
+ 
      ~basic_string() = default;
+ 
+     // Provides conversion from a normal-mode string to a debug-mode string
+     basic_string(_Base&& __base) noexcept
+     : _Base(std::move(__base)) { }
  #endif // C++11
  
      // Provides conversion from a normal-mode string to a debug-mode string
*************** namespace __gnu_debug
*** 277,283 ****
      reference
      operator[](size_type __pos) // _GLIBCXX_NOEXCEPT
      {
! #ifdef _GLIBCXX_DEBUG_PEDANTIC
        __glibcxx_check_subscript(__pos);
  #else
        // as an extension v3 allows s[s.size()] when s is non-const.
--- 296,302 ----
      reference
      operator[](size_type __pos) // _GLIBCXX_NOEXCEPT
      {
! #if __cplusplus < 201103L && defined(_GLIBCXX_DEBUG_PEDANTIC)
        __glibcxx_check_subscript(__pos);
  #else
        // as an extension v3 allows s[s.size()] when s is non-const.
*************** namespace __gnu_debug
*** 406,411 ****
--- 425,431 ----
  #if __cplusplus >= 201103L
      basic_string&
      assign(basic_string&& __x)
+     noexcept(noexcept(std::declval<_Base&>().assign(std::move(__x))))
      {
        _Base::assign(std::move(__x));
        this->_M_invalidate_all();
*************** namespace __gnu_debug
*** 701,706 ****
--- 721,729 ----
  
      void
      swap(basic_string& __x)
+ #if _GLIBCXX_USE_CXX11_ABI
+     _GLIBCXX_NOEXCEPT
+ #endif
      {
        _Safe::_M_swap(__x);
        _Base::swap(__x);
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/algorithm gcc-5.5.0/libstdc++-v3/include/experimental/algorithm
*** gcc-5.4.0/libstdc++-v3/include/experimental/algorithm	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/algorithm	Mon Oct 17 17:03:09 2016
***************
*** 37,42 ****
--- 37,43 ----
  
  #include <algorithm>
  #include <random>
+ #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 67,75 ****
        __distrib_type __d{};
        _Size __sample_sz = 0;
        while (__first != __last && __sample_sz != __n)
! 	__out[__sample_sz++] = *__first++;
        for (auto __pop_sz = __sample_sz; __first != __last;
! 	  ++__first, ++__pop_sz)
  	{
  	  const auto __k = __d(__g, __param_type{0, __pop_sz});
  	  if (__k < __n)
--- 68,79 ----
        __distrib_type __d{};
        _Size __sample_sz = 0;
        while (__first != __last && __sample_sz != __n)
! 	{
! 	  __out[__sample_sz++] = *__first;
! 	  ++__first;
! 	}
        for (auto __pop_sz = __sample_sz; __first != __last;
! 	  ++__first, (void)++__pop_sz)
  	{
  	  const auto __k = __d(__g, __param_type{0, __pop_sz});
  	  if (__k < __n)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 122,130 ****
        static_assert(is_integral<_Distance>::value,
  		    "sample size must be an integer type");
  
        return std::experimental::__sample(
  	  __first, __last, __pop_cat{}, __out, __samp_cat{},
! 	  __n, std::forward<_UniformRandomNumberGenerator>(__g));
      }
  
  _GLIBCXX_END_NAMESPACE_VERSION
--- 126,135 ----
        static_assert(is_integral<_Distance>::value,
  		    "sample size must be an integer type");
  
+       typename iterator_traits<_PopulationIterator>::difference_type __d = __n;
        return std::experimental::__sample(
  	  __first, __last, __pop_cat{}, __out, __samp_cat{},
! 	  __d, std::forward<_UniformRandomNumberGenerator>(__g));
      }
  
  _GLIBCXX_END_NAMESPACE_VERSION
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/any gcc-5.5.0/libstdc++-v3/include/experimental/any
*** gcc-5.4.0/libstdc++-v3/include/experimental/any	Sat May  2 13:02:18 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/any	Tue Feb 14 21:17:34 2017
***************
*** 39,44 ****
--- 39,45 ----
  #include <new>
  #include <utility>
  #include <type_traits>
+ #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 235,248 ****
      _Storage _M_storage;
  
      template<typename _Tp>
!       friend void* __any_caster(const any* __any)
!       {
! 	if (__any->_M_manager != &_Manager<decay_t<_Tp>>::_S_manage)
! 	  return nullptr;
! 	_Arg __arg;
! 	__any->_M_manager(_Op_access, __any, &__arg);
! 	return __arg._M_obj;
!       }
  
      // Manage in-place contained object.
      template<typename _Tp>
--- 236,242 ----
      _Storage _M_storage;
  
      template<typename _Tp>
!       friend void* __any_caster(const any* __any);
  
      // Manage in-place contained object.
      template<typename _Tp>
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 346,351 ****
--- 340,358 ----
      }
    // @}
  
+   template<typename _Tp>
+     void* __any_caster(const any* __any)
+     {
+       struct _None { };
+       using _Up = decay_t<_Tp>;
+       using _Vp = conditional_t<is_copy_constructible<_Up>::value, _Up, _None>;
+       if (__any->_M_manager != &any::_Manager<_Vp>::_S_manage)
+ 	return nullptr;
+       any::_Arg __arg;
+       __any->_M_manager(any::_Op_access, __any, &__arg);
+       return __arg._M_obj;
+     }
+ 
    /**
     * @brief Access the contained object.
     *
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/chrono gcc-5.5.0/libstdc++-v3/include/experimental/chrono
*** gcc-5.4.0/libstdc++-v3/include/experimental/chrono	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/chrono	Mon Oct  3 14:42:06 2016
***************
*** 40,46 ****
  #else
  
  #include <chrono>
! 
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
--- 40,46 ----
  #else
  
  #include <chrono>
! #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/fs_dir.h gcc-5.5.0/libstdc++-v3/include/experimental/fs_dir.h
*** gcc-5.4.0/libstdc++-v3/include/experimental/fs_dir.h	Wed May 25 15:43:17 2016
--- gcc-5.5.0/libstdc++-v3/include/experimental/fs_dir.h	Thu May 18 15:31:22 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 181,187 ****
      typedef const directory_entry& reference;
      typedef input_iterator_tag     iterator_category;
  
!     directory_iterator() noexcept = default;
  
      explicit
      directory_iterator(const path& __p)
--- 181,187 ----
      typedef const directory_entry& reference;
      typedef input_iterator_tag     iterator_category;
  
!     directory_iterator() = default;
  
      explicit
      directory_iterator(const path& __p)
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 262,268 ****
      typedef const directory_entry& reference;
      typedef input_iterator_tag     iterator_category;
  
!     recursive_directory_iterator() noexcept = default;
  
      explicit
      recursive_directory_iterator(const path& __p)
--- 262,268 ----
      typedef const directory_entry& reference;
      typedef input_iterator_tag     iterator_category;
  
!     recursive_directory_iterator() = default;
  
      explicit
      recursive_directory_iterator(const path& __p)
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 282,289 ****
      recursive_directory_iterator(
          const recursive_directory_iterator&) = default;
  
!     recursive_directory_iterator(
!         recursive_directory_iterator&&) noexcept = default;
  
      ~recursive_directory_iterator();
  
--- 282,288 ----
      recursive_directory_iterator(
          const recursive_directory_iterator&) = default;
  
!     recursive_directory_iterator(recursive_directory_iterator&&) = default;
  
      ~recursive_directory_iterator();
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 312,317 ****
--- 311,317 ----
      }
  
      void pop();
+     void pop(error_code&);
  
      void disable_recursion_pending() { _M_pending = false; }
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/fs_fwd.h gcc-5.5.0/libstdc++-v3/include/experimental/fs_fwd.h
*** gcc-5.4.0/libstdc++-v3/include/experimental/fs_fwd.h	Wed May 25 15:42:35 2016
--- gcc-5.5.0/libstdc++-v3/include/experimental/fs_fwd.h	Mon Dec 12 15:00:43 2016
*************** namespace filesystem
*** 46,55 ****
  {
  inline namespace v1
  {
  _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
  #if _GLIBCXX_USE_CXX11_ABI
!   inline namespace __cxx11 __attribute__((__abi_tag__ ("cxx11"))) { }
  #endif
  
    /**
--- 46,58 ----
  {
  inline namespace v1
  {
+ #if _GLIBCXX_INLINE_VERSION
+ inline namespace __7 { }
+ #endif
  _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
  #if _GLIBCXX_USE_CXX11_ABI
! inline namespace __cxx11 __attribute__((__abi_tag__ ("cxx11"))) { }
  #endif
  
    /**
*************** _GLIBCXX_END_NAMESPACE_CXX11
*** 159,165 ****
        unknown		=  0xFFFF,
        add_perms		= 0x10000,
        remove_perms	= 0x20000,
!       resolve_symlinks	= 0x40000
    };
  
    constexpr perms
--- 162,168 ----
        unknown		=  0xFFFF,
        add_perms		= 0x10000,
        remove_perms	= 0x20000,
!       symlink_nofollow	= 0x40000
    };
  
    constexpr perms
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/fs_ops.h gcc-5.5.0/libstdc++-v3/include/experimental/fs_ops.h
*** gcc-5.4.0/libstdc++-v3/include/experimental/fs_ops.h	Fri Dec 11 12:46:50 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/fs_ops.h	Mon Dec 12 15:00:43 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 112,117 ****
--- 112,123 ----
    void current_path(const path& __p);
    void current_path(const path& __p, error_code& __ec) noexcept;
  
+   bool
+   equivalent(const path& __p1, const path& __p2);
+ 
+   bool
+   equivalent(const path& __p1, const path& __p2, error_code& __ec) noexcept;
+ 
    inline bool
    exists(file_status __s) noexcept
    { return status_known(__s) && __s.type() != file_type::not_found; }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 122,134 ****
  
    inline bool
    exists(const path& __p, error_code& __ec) noexcept
!   { return exists(status(__p, __ec)); }
! 
!   bool
!   equivalent(const path& __p1, const path& __p2);
! 
!   bool
!   equivalent(const path& __p1, const path& __p2, error_code& __ec) noexcept;
  
    uintmax_t file_size(const path& __p);
    uintmax_t file_size(const path& __p, error_code& __ec) noexcept;
--- 128,139 ----
  
    inline bool
    exists(const path& __p, error_code& __ec) noexcept
!   {
!     auto __s = status(__p, __ec);
!     if (status_known(__s))
!       __ec.clear();
!     return exists(__s);
!   }
  
    uintmax_t file_size(const path& __p);
    uintmax_t file_size(const path& __p, error_code& __ec) noexcept;
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/fs_path.h gcc-5.5.0/libstdc++-v3/include/experimental/fs_path.h
*** gcc-5.4.0/libstdc++-v3/include/experimental/fs_path.h	Fri Dec  4 20:44:13 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/fs_path.h	Mon Dec 12 15:00:43 2016
***************
*** 44,49 ****
--- 44,52 ----
  #include <bits/stl_algobase.h>
  #include <bits/quoted_string.h>
  #include <bits/locale_conv.h>
+ #if __cplusplus >= 201402L
+ # include <experimental/string_view>
+ #endif
  
  #if defined(_WIN32) && !defined(__CYGWIN__)
  # define _GLIBCXX_FILESYSTEM_IS_WINDOWS 1
*************** inline namespace v1
*** 61,66 ****
--- 64,75 ----
  _GLIBCXX_BEGIN_NAMESPACE_VERSION
  _GLIBCXX_BEGIN_NAMESPACE_CXX11
  
+ #if __cplusplus >= 201402L
+   template<typename _CharT, typename _Traits = std::char_traits<_CharT>>
+     using __basic_string_view
+       = std::experimental::basic_string_view<_CharT, _Traits>;
+ #endif
+ 
    /**
     * @ingroup filesystem
     * @{
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 87,92 ****
--- 96,107 ----
        static __is_encoded_char<_CharT>
        __is_path_src(const basic_string<_CharT, _Traits, _Alloc>&, int);
  
+ #if __cplusplus >= 201402L
+     template<typename _CharT, typename _Traits>
+       static __is_encoded_char<_CharT>
+       __is_path_src(const __basic_string_view<_CharT, _Traits>&, int);
+ #endif
+ 
      template<typename _Unknown>
        static std::false_type
        __is_path_src(const _Unknown&, ...);
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 130,135 ****
--- 145,162 ----
        _S_range_end(const basic_string<_CharT, _Traits, _Alloc>& __str)
        { return __str.data() + __str.size(); }
  
+ #if __cplusplus >= 201402L
+     template<typename _CharT, typename _Traits>
+       static const _CharT*
+       _S_range_begin(const __basic_string_view<_CharT, _Traits>& __str)
+       { return __str.data(); }
+ 
+     template<typename _CharT, typename _Traits>
+       static const _CharT*
+       _S_range_end(const __basic_string_view<_CharT, _Traits>& __str)
+       { return __str.data() + __str.size(); }
+ #endif
+ 
      template<typename _Tp,
  	     typename _Iter = decltype(_S_range_begin(std::declval<_Tp>())),
  	     typename _Val = typename std::iterator_traits<_Iter>::value_type>
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 159,164 ****
--- 186,195 ----
        __p.clear();
      }
  
+     path(string_type&& __source)
+     : _M_pathname(std::move(__source))
+     { _M_split_cmpts(); }
+ 
      template<typename _Source,
  	     typename _Require = _Path<_Source>>
        path(_Source const& __source)
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 193,198 ****
--- 224,231 ----
  
      path& operator=(const path& __p) = default;
      path& operator=(path&& __p) noexcept;
+     path& operator=(string_type&& __source);
+     path& assign(string_type&& __source);
  
      template<typename _Source>
        _Path<_Source>&
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 237,242 ****
--- 270,278 ----
      path& operator+=(const string_type& __x);
      path& operator+=(const value_type* __x);
      path& operator+=(value_type __x);
+ #if __cplusplus >= 201402L
+     path& operator+=(__basic_string_view<value_type> __x);
+ #endif
  
      template<typename _Source>
        _Path<_Source>&
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 305,310 ****
--- 341,349 ----
      int compare(const path& __p) const noexcept;
      int compare(const string_type& __s) const;
      int compare(const value_type* __s) const;
+ #if __cplusplus >= 201402L
+     int compare(const __basic_string_view<value_type> __s) const;
+ #endif
  
      // decomposition
  
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 379,385 ****
        _S_convert(_Iter __first, _Iter __last)
        {
  	using __value_type = typename std::iterator_traits<_Iter>::value_type;
! 	return _Cvt<__value_type>::_S_convert(__first, __last);
        }
  
      template<typename _InputIterator>
--- 418,425 ----
        _S_convert(_Iter __first, _Iter __last)
        {
  	using __value_type = typename std::iterator_traits<_Iter>::value_type;
! 	return _Cvt<typename remove_cv<__value_type>::type>::
! 	  _S_convert(__first, __last);
        }
  
      template<typename _InputIterator>
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 387,396 ****
        _S_convert(_InputIterator __src, __null_terminated)
        {
  	using _Tp = typename std::iterator_traits<_InputIterator>::value_type;
! 	std::basic_string<_Tp> __tmp;
! 	while (*__src != _Tp{})
! 	  __tmp.push_back(*__src++);
! 	return _S_convert(__tmp.data(), __tmp.data() + __tmp.size());
        }
  
      static string_type
--- 427,436 ----
        _S_convert(_InputIterator __src, __null_terminated)
        {
  	using _Tp = typename std::iterator_traits<_InputIterator>::value_type;
! 	std::basic_string<typename remove_cv<_Tp>::type> __tmp;
! 	for (; *__src != _Tp{}; ++__src)
! 	  __tmp.push_back(*__src);
! 	return _S_convert(__tmp.c_str(), __tmp.c_str() + __tmp.size());
        }
  
      static string_type
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 565,570 ****
--- 605,613 ----
      struct path::__is_encoded_char<char32_t> : std::true_type
      { using value_type = char32_t; };
  
+   template<typename _Tp>
+     struct path::__is_encoded_char<const _Tp> : __is_encoded_char<_Tp> { };
+ 
    struct path::_Cmpt : path
    {
      _Cmpt(string_type __s, _Type __t, size_t __pos)
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 722,727 ****
--- 765,778 ----
    }
  
    inline path&
+   path::operator=(string_type&& __source)
+   { return *this = path(std::move(__source)); }
+ 
+   inline path&
+   path::assign(string_type&& __source)
+   { return *this = path(std::move(__source)); }
+ 
+   inline path&
    path::operator+=(const path& __p)
    {
      return operator+=(__p.native());
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 751,756 ****
--- 802,817 ----
      return *this;
    }
  
+ #if __cplusplus >= 201402L
+   inline path&
+   path::operator+=(__basic_string_view<value_type> __x)
+   {
+     _M_pathname.append(__x.data(), __x.size());
+     _M_split_cmpts();
+     return *this;
+   }
+ #endif
+ 
    template<typename _CharT>
      inline path::_Path<_CharT*, _CharT*>&
      path::operator+=(_CharT __x)
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 892,897 ****
--- 953,964 ----
    inline int
    path::compare(const value_type* __s) const { return compare(path(__s)); }
  
+ #if __cplusplus >= 201402L
+   inline int
+   path::compare(__basic_string_view<value_type> __s) const
+   { return compare(path(__s)); }
+ #endif
+ 
    inline path
    path::filename() const { return empty() ? path() : *--end(); }
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/functional gcc-5.5.0/libstdc++-v3/include/experimental/functional
*** gcc-5.4.0/libstdc++-v3/include/experimental/functional	Thu Sep  3 15:10:52 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/functional	Mon Oct 17 17:03:35 2016
***************
*** 42,47 ****
--- 42,48 ----
  #include <vector>
  #include <array>
  #include <bits/stl_algo.h>
+ #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 115,121 ****
        _Pred
        _M_pred() const { return _M_bad_char.key_eq(); }
  
!       std::unordered_map<_Key, _Tp, _Hash, _Pred> _M_bad_char;
      };
  
    template<typename _Tp, size_t _Len, typename _Pred>
--- 116,122 ----
        _Pred
        _M_pred() const { return _M_bad_char.key_eq(); }
  
!       _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _Pred> _M_bad_char;
      };
  
    template<typename _Tp, size_t _Len, typename _Pred>
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 124,130 ****
        template<typename _RAIter, typename _Unused>
  	__boyer_moore_array_base(_RAIter __pat, size_t __patlen,
  				 _Unused&&, _Pred&& __pred)
! 	: _M_bad_char{ {}, std::move(__pred) }
  	{
  	  std::get<0>(_M_bad_char).fill(__patlen);
  	  if (__patlen > 0)
--- 125,131 ----
        template<typename _RAIter, typename _Unused>
  	__boyer_moore_array_base(_RAIter __pat, size_t __patlen,
  				 _Unused&&, _Pred&& __pred)
! 	: _M_bad_char{ _GLIBCXX_STD_C::array<_Tp, _Len>{}, std::move(__pred) }
  	{
  	  std::get<0>(_M_bad_char).fill(__patlen);
  	  if (__patlen > 0)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 152,158 ****
        const _Pred&
        _M_pred() const { return std::get<1>(_M_bad_char); }
  
!       std::tuple<std::array<_Tp, _Len>, _Pred> _M_bad_char;
      };
  
    template<typename _Pred>
--- 153,159 ----
        const _Pred&
        _M_pred() const { return std::get<1>(_M_bad_char); }
  
!       std::tuple<_GLIBCXX_STD_C::array<_Tp, _Len>, _Pred> _M_bad_char;
      };
  
    template<typename _Pred>
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 225,231 ****
  
        _RAIter _M_pat;
        _RAIter _M_pat_end;
!       std::vector<__diff_type> _M_good_suffix;
      };
  
    template<typename _RAIter, typename _Hash
--- 226,232 ----
  
        _RAIter _M_pat;
        _RAIter _M_pat_end;
!       _GLIBCXX_STD_C::vector<__diff_type> _M_good_suffix;
      };
  
    template<typename _RAIter, typename _Hash
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 383,389 ****
      public:
        template<typename _Fn2>
  	explicit
! 	_Not_fn(_Fn2&& __fn) : _M_fn(std::forward<_Fn2>(__fn)) { }
  
        _Not_fn(const _Not_fn& __fn) = default;
        _Not_fn(_Not_fn&& __fn) = default;
--- 384,390 ----
      public:
        template<typename _Fn2>
  	explicit
! 	_Not_fn(_Fn2&& __fn, int) : _M_fn(std::forward<_Fn2>(__fn)) { }
  
        _Not_fn(const _Not_fn& __fn) = default;
        _Not_fn(_Not_fn&& __fn) = default;
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 427,433 ****
      noexcept(std::is_nothrow_constructible<std::decay_t<_Fn>, _Fn&&>::value)
      {
        using __maybe_type = _Maybe_wrap_member_pointer<std::decay_t<_Fn>>;
!       return _Not_fn<typename __maybe_type::type>{std::forward<_Fn>(__fn)};
      }
  
  _GLIBCXX_END_NAMESPACE_VERSION
--- 428,434 ----
      noexcept(std::is_nothrow_constructible<std::decay_t<_Fn>, _Fn&&>::value)
      {
        using __maybe_type = _Maybe_wrap_member_pointer<std::decay_t<_Fn>>;
!       return _Not_fn<typename __maybe_type::type>{std::forward<_Fn>(__fn), 0};
      }
  
  _GLIBCXX_END_NAMESPACE_VERSION
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/lfts_config.h gcc-5.5.0/libstdc++-v3/include/experimental/lfts_config.h
*** gcc-5.4.0/libstdc++-v3/include/experimental/lfts_config.h	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/include/experimental/lfts_config.h	Mon Oct  3 14:42:06 2016
***************
*** 0 ****
--- 1,57 ----
+ // Namespace declarations for Library Fundamentals TS -*- C++ -*-
+ 
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // Under Section 7 of GPL version 3, you are granted additional
+ // permissions described in the GCC Runtime Library Exception, version
+ // 3.1, as published by the Free Software Foundation.
+ 
+ // You should have received a copy of the GNU General Public License and
+ // a copy of the GCC Runtime Library Exception along with this program;
+ // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
+ // <http://www.gnu.org/licenses/>.
+ 
+ /** @file experimental/lfts_config.h
+  *  This is an internal header file, included by other library headers.
+  *  Do not attempt to use it directly.
+  */
+ 
+ #if __cplusplus <= 201103L
+ # include <bits/c++14_warning.h>
+ #else
+ #include <bits/c++config.h>
+ 
+ #if _GLIBCXX_INLINE_VERSION
+ namespace std _GLIBCXX_VISIBILITY(default)
+ {
+ namespace chrono
+ {
+ namespace experimental
+ {
+ inline namespace fundamentals_v1 { inline namespace __7 { } }
+ inline namespace fundamentals_v2 { inline namespace __7 { } }
+ } // namespace experimental
+ } // namespace chrono
+ 
+ namespace experimental
+ {
+ inline namespace fundamentals_v1 { inline namespace __7 { } }
+ inline namespace fundamentals_v2 { inline namespace __7 { } }
+ inline namespace literals { inline namespace string_view_literals {
+   inline namespace __7 { }
+ } } // namespace literals::string_view_literals
+ } // namespace experimental
+ } // namespace std
+ #endif
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/optional gcc-5.5.0/libstdc++-v3/include/experimental/optional
*** gcc-5.4.0/libstdc++-v3/include/experimental/optional	Fri Dec 11 12:46:50 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/optional	Wed Dec  7 15:22:34 2016
***************
*** 53,58 ****
--- 53,59 ----
  #include <bits/functexcept.h>
  #include <bits/functional_hash.h>
  #include <bits/enable_special_members.h>
+ #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 133,138 ****
--- 134,140 ----
    __throw_bad_optional_access(const char* __s)
    { _GLIBCXX_THROW_OR_ABORT(bad_optional_access(__s)); }
  
+ #ifndef __cpp_lib_addressof_constexpr
    template<typename _Tp, typename = void>
      struct _Has_addressof_mem : std::false_type { };
  
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 169,184 ****
      * overloaded addressof operator (unary operator&), in which case the call
      * will not be a constant expression.
      */
!   template<typename _Tp, enable_if_t<!_Has_addressof<_Tp>::value, int>...>
!     constexpr _Tp* __constexpr_addressof(_Tp& __t)
      { return &__t; }
  
    /**
      * @brief Fallback overload that defers to __addressof.
      */
!   template<typename _Tp, enable_if_t<_Has_addressof<_Tp>::value, int>...>
!     inline _Tp* __constexpr_addressof(_Tp& __t)
      { return std::__addressof(__t); }
  
    /**
      * @brief Class template that holds the necessary state for @ref optional
--- 171,191 ----
      * overloaded addressof operator (unary operator&), in which case the call
      * will not be a constant expression.
      */
!   template<typename _Tp>
!     constexpr
!     enable_if_t<!_Has_addressof<_Tp>::value, _Tp*>
!     __constexpr_addressof(_Tp& __t)
      { return &__t; }
  
    /**
      * @brief Fallback overload that defers to __addressof.
      */
!   template<typename _Tp>
!     inline
!     enable_if_t<_Has_addressof<_Tp>::value, _Tp*>
!     __constexpr_addressof(_Tp& __t)
      { return std::__addressof(__t); }
+ #endif // __cpp_lib_addressof_constexpr
  
    /**
      * @brief Class template that holds the necessary state for @ref optional
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 573,579 ****
        // [X.Y.4.5] Observers.
        constexpr const _Tp*
        operator->() const
!       { return __constexpr_addressof(this->_M_get()); }
  
        _Tp*
        operator->()
--- 580,592 ----
        // [X.Y.4.5] Observers.
        constexpr const _Tp*
        operator->() const
!       {
! #ifndef __cpp_lib_addressof_constexpr
! 	return __constexpr_addressof(this->_M_get());
! #else
! 	return std::__addressof(this->_M_get());
! #endif
!       }
  
        _Tp*
        operator->()
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/ratio gcc-5.5.0/libstdc++-v3/include/experimental/ratio
*** gcc-5.4.0/libstdc++-v3/include/experimental/ratio	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/ratio	Mon Oct  3 14:42:06 2016
***************
*** 40,46 ****
  #else
  
  #include <ratio>
! 
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
--- 40,46 ----
  #else
  
  #include <ratio>
! #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
*************** namespace experimental
*** 49,54 ****
--- 49,55 ----
  inline namespace fundamentals_v1
  {
  _GLIBCXX_BEGIN_NAMESPACE_VERSION
+ 
  // See C++14 Â§20.11.5, ratio comparison
  template <typename _R1, typename _R2>
    constexpr bool ratio_equal_v = ratio_equal<_R1, _R2>::value;
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/string_view gcc-5.5.0/libstdc++-v3/include/experimental/string_view
*** gcc-5.4.0/libstdc++-v3/include/experimental/string_view	Fri Dec 11 12:46:50 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/string_view	Mon Oct 17 17:03:40 2016
***************
*** 41,46 ****
--- 41,47 ----
  
  #include <string>
  #include <limits>
+ #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 419,425 ****
  
      private:
  
!       static constexpr const int
        _S_compare(size_type __n1, size_type __n2) noexcept
        {
  	return difference_type{__n1 - __n2} > std::numeric_limits<int>::max()
--- 420,426 ----
  
      private:
  
!       static constexpr int
        _S_compare(size_type __n1, size_type __n2) noexcept
        {
  	return difference_type{__n1 - __n2} > std::numeric_limits<int>::max()
*************** _GLIBCXX_END_NAMESPACE_VERSION
*** 651,663 ****
  
  namespace experimental
  {
- _GLIBCXX_BEGIN_NAMESPACE_VERSION
- 
    // I added these EMSR.
    inline namespace literals
    {
    inline namespace string_view_literals
    {
  
      inline constexpr basic_string_view<char>
      operator""sv(const char* __str, size_t __len)
--- 652,663 ----
  
  namespace experimental
  {
    // I added these EMSR.
    inline namespace literals
    {
    inline namespace string_view_literals
    {
+   _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
      inline constexpr basic_string_view<char>
      operator""sv(const char* __str, size_t __len)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 679,688 ****
      { return basic_string_view<char32_t>{__str, __len}; }
  #endif
  
!   }
!   }
! 
! _GLIBCXX_END_NAMESPACE_VERSION
  } // namespace experimental
  } // namespace std
  
--- 679,687 ----
      { return basic_string_view<char32_t>{__str, __len}; }
  #endif
  
!   _GLIBCXX_END_NAMESPACE_VERSION
!   } // namespace string_literals
!   } // namespace literals
  } // namespace experimental
  } // namespace std
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/string_view.tcc gcc-5.5.0/libstdc++-v3/include/experimental/string_view.tcc
*** gcc-5.4.0/libstdc++-v3/include/experimental/string_view.tcc	Fri Dec 11 12:46:50 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/string_view.tcc	Mon Oct  3 14:42:06 2016
*************** namespace std _GLIBCXX_VISIBILITY(defaul
*** 44,49 ****
--- 44,51 ----
  {
  namespace experimental
  {
+ inline namespace fundamentals_v1
+ {
  _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
    template<typename _CharT, typename _Traits>
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 222,227 ****
--- 224,230 ----
      }
  
  _GLIBCXX_END_NAMESPACE_VERSION
+ } // namespace fundamentals_v1
  } // namespace experimental
  } // namespace std
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/system_error gcc-5.5.0/libstdc++-v3/include/experimental/system_error
*** gcc-5.4.0/libstdc++-v3/include/experimental/system_error	Fri Mar 13 12:47:21 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/system_error	Mon Oct  3 14:42:06 2016
***************
*** 40,46 ****
  #else
  
  #include <system_error>
! 
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
--- 40,46 ----
  #else
  
  #include <system_error>
! #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
*************** namespace experimental
*** 49,60 ****
--- 49,62 ----
  inline namespace fundamentals_v1
  {
  _GLIBCXX_BEGIN_NAMESPACE_VERSION
+ 
  // See C++14 Â§19.5, System error support
  template <typename _Tp>
    constexpr bool is_error_code_enum_v = is_error_code_enum<_Tp>::value;
  template <typename _Tp>
    constexpr bool is_error_condition_enum_v =
      is_error_condition_enum<_Tp>::value;
+ 
  _GLIBCXX_END_NAMESPACE_VERSION
  } // namespace fundamentals_v1
  } // namespace experimental
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/tuple gcc-5.5.0/libstdc++-v3/include/experimental/tuple
*** gcc-5.4.0/libstdc++-v3/include/experimental/tuple	Wed Feb 24 13:58:07 2016
--- gcc-5.5.0/libstdc++-v3/include/experimental/tuple	Mon Oct  3 14:42:06 2016
***************
*** 36,41 ****
--- 36,42 ----
  #else
  
  #include <tuple>
+ #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/experimental/type_traits gcc-5.5.0/libstdc++-v3/include/experimental/type_traits
*** gcc-5.4.0/libstdc++-v3/include/experimental/type_traits	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/experimental/type_traits	Mon Oct  3 14:42:06 2016
***************
*** 40,46 ****
  #else
  
  #include <type_traits>
! 
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
--- 40,46 ----
  #else
  
  #include <type_traits>
! #include <experimental/lfts_config.h>
  
  namespace std _GLIBCXX_VISIBILITY(default)
  {
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/ext/new_allocator.h gcc-5.5.0/libstdc++-v3/include/ext/new_allocator.h
*** gcc-5.4.0/libstdc++-v3/include/ext/new_allocator.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/ext/new_allocator.h	Mon Sep  4 16:41:38 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 96,103 ****
        // NB: __n is permitted to be 0.  The C++ standard says nothing
        // about what the return value is when __n == 0.
        pointer
!       allocate(size_type __n, const void* = 0)
!       { 
  	if (__n > this->max_size())
  	  std::__throw_bad_alloc();
  
--- 96,103 ----
        // NB: __n is permitted to be 0.  The C++ standard says nothing
        // about what the return value is when __n == 0.
        pointer
!       allocate(size_type __n, const void* = static_cast<const void*>(0))
!       {
  	if (__n > this->max_size())
  	  std::__throw_bad_alloc();
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp gcc-5.5.0/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp
*** gcc-5.4.0/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp	Wed May 17 17:18:14 2017
*************** namespace __gnu_pbds
*** 266,285 ****
  	const entry_cmp& m_cmp = static_cast<entry_cmp&>(*this);
  	entry_pointer end = m_a_entries + m_size;
  	std::make_heap(m_a_entries, end, m_cmp);
- 	_GLIBCXX_DEBUG_ASSERT(is_heap());
        }
  
        void
        push_heap()
        {
! 	if (!is_heap())
! 	  make_heap();
! 	else
! 	  {
! 	    const entry_cmp& m_cmp = static_cast<entry_cmp&>(*this);
! 	    entry_pointer end = m_a_entries + m_size;
! 	    std::push_heap(m_a_entries, end, m_cmp);
! 	  }
        }
  
        void
--- 266,279 ----
  	const entry_cmp& m_cmp = static_cast<entry_cmp&>(*this);
  	entry_pointer end = m_a_entries + m_size;
  	std::make_heap(m_a_entries, end, m_cmp);
        }
  
        void
        push_heap()
        {
! 	const entry_cmp& m_cmp = static_cast<entry_cmp&>(*this);
! 	entry_pointer end = m_a_entries + m_size;
! 	std::push_heap(m_a_entries, end, m_cmp);
        }
  
        void
*************** namespace __gnu_pbds
*** 290,304 ****
  	std::pop_heap(m_a_entries, end, m_cmp);
        }
  
-       bool
-       is_heap()
-       {
- 	const entry_cmp& m_cmp = static_cast<entry_cmp&>(*this);
- 	entry_pointer end = m_a_entries + m_size;
- 	bool p = std::__is_heap(m_a_entries, end, m_cmp);
- 	return p;
-       }
- 
  #ifdef _GLIBCXX_DEBUG
        void
        assert_valid(const char*, int) const;
--- 284,289 ----
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp gcc-5.5.0/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp
*** gcc-5.4.0/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp	Wed May 17 17:18:14 2017
*************** modify(point_iterator it, const_referenc
*** 103,109 ****
    swap_value_imp(it.m_p_e, r_new_val, s_no_throw_copies_ind);
    fix(it.m_p_e);
    PB_DS_ASSERT_VALID((*this))
-   _GLIBCXX_DEBUG_ASSERT(is_heap());
  }
  
  PB_DS_CLASS_T_DEC
--- 103,108 ----
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/ext/pointer.h gcc-5.5.0/libstdc++-v3/include/ext/pointer.h
*** gcc-5.4.0/libstdc++-v3/include/ext/pointer.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/ext/pointer.h	Tue Feb 14 21:17:29 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 449,457 ****
        inline _Pointer_adapter 
        operator++(int)
        {
!         _Pointer_adapter tmp(*this);
          _Storage_policy::set(_Storage_policy::get() + 1);
!         return tmp;
        }
    
        inline _Pointer_adapter& 
--- 449,457 ----
        inline _Pointer_adapter 
        operator++(int)
        {
!         _Pointer_adapter __tmp(*this);
          _Storage_policy::set(_Storage_policy::get() + 1);
!         return __tmp;
        }
    
        inline _Pointer_adapter& 
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 464,472 ****
        inline _Pointer_adapter
        operator--(int) 
        {
!         _Pointer_adapter tmp(*this);
          _Storage_policy::set(_Storage_policy::get() - 1);
!         return tmp;
        }
    
      }; // class _Pointer_adapter
--- 464,472 ----
        inline _Pointer_adapter
        operator--(int) 
        {
!         _Pointer_adapter __tmp(*this);
          _Storage_policy::set(_Storage_policy::get() - 1);
!         return __tmp;
        }
    
      }; // class _Pointer_adapter
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/atomic gcc-5.5.0/libstdc++-v3/include/std/atomic
*** gcc-5.4.0/libstdc++-v3/include/std/atomic	Thu Oct  8 16:54:23 2015
--- gcc-5.5.0/libstdc++-v3/include/std/atomic	Tue Feb 14 21:17:29 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 230,264 ****
  
        _Tp
        load(memory_order __m = memory_order_seq_cst) const noexcept
!       { 
!         _Tp tmp;
! 	__atomic_load(&_M_i, &tmp, __m);
! 	return tmp;
        }
  
        _Tp
        load(memory_order __m = memory_order_seq_cst) const volatile noexcept
!       { 
!         _Tp tmp;
! 	__atomic_load(&_M_i, &tmp, __m);
! 	return tmp;
        }
  
        _Tp
        exchange(_Tp __i, memory_order __m = memory_order_seq_cst) noexcept
!       { 
!         _Tp tmp;
! 	__atomic_exchange(&_M_i, &__i, &tmp, __m);
! 	return tmp;
        }
  
        _Tp
        exchange(_Tp __i, 
  	       memory_order __m = memory_order_seq_cst) volatile noexcept
!       { 
!         _Tp tmp;
! 	__atomic_exchange(&_M_i, &__i, &tmp, __m);
! 	return tmp;
        }
  
        bool
--- 230,268 ----
  
        _Tp
        load(memory_order __m = memory_order_seq_cst) const noexcept
!       {
! 	alignas(_Tp) unsigned char __buf[sizeof(_Tp)];
! 	_Tp* __ptr = reinterpret_cast<_Tp*>(__buf);
! 	__atomic_load(&_M_i, __ptr, __m);
! 	return *__ptr;
        }
  
        _Tp
        load(memory_order __m = memory_order_seq_cst) const volatile noexcept
!       {
!         alignas(_Tp) unsigned char __buf[sizeof(_Tp)];
! 	_Tp* __ptr = reinterpret_cast<_Tp*>(__buf);
! 	__atomic_load(&_M_i, __ptr, __m);
! 	return *__ptr;
        }
  
        _Tp
        exchange(_Tp __i, memory_order __m = memory_order_seq_cst) noexcept
!       {
!         alignas(_Tp) unsigned char __buf[sizeof(_Tp)];
! 	_Tp* __ptr = reinterpret_cast<_Tp*>(__buf);
! 	__atomic_exchange(&_M_i, &__i, __ptr, __m);
! 	return *__ptr;
        }
  
        _Tp
        exchange(_Tp __i, 
  	       memory_order __m = memory_order_seq_cst) volatile noexcept
!       {
!         alignas(_Tp) unsigned char __buf[sizeof(_Tp)];
! 	_Tp* __ptr = reinterpret_cast<_Tp*>(__buf);
! 	__atomic_exchange(&_M_i, &__i, __ptr, __m);
! 	return *__ptr;
        }
  
        bool
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/chrono gcc-5.5.0/libstdc++-v3/include/std/chrono
*** gcc-5.4.0/libstdc++-v3/include/std/chrono	Fri Mar 27 12:45:10 2015
--- gcc-5.5.0/libstdc++-v3/include/std/chrono	Wed Sep 13 15:28:12 2017
*************** _GLIBCXX_END_NAMESPACE_VERSION
*** 558,564 ****
  	{ }
  
  	// conversions
! 	template<typename _Dur2>
  	  constexpr time_point(const time_point<clock, _Dur2>& __t)
  	  : __d(__t.time_since_epoch())
  	  { }
--- 558,565 ----
  	{ }
  
  	// conversions
! 	template<typename _Dur2,
! 		 typename = _Require<is_convertible<_Dur2, _Dur>>>
  	  constexpr time_point(const time_point<clock, _Dur2>& __t)
  	  : __d(__t.time_since_epoch())
  	  { }
*************** _GLIBCXX_END_NAMESPACE_VERSION
*** 788,793 ****
--- 789,795 ----
    {
    inline namespace chrono_literals
    {
+   _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
      template<typename _Rep, unsigned long long _Val>
        struct _Checked_integral_constant
*************** _GLIBCXX_END_NAMESPACE_VERSION
*** 863,868 ****
--- 865,871 ----
        operator""ns()
        { return __check_overflow<chrono::nanoseconds, _Digits...>(); }
  
+   _GLIBCXX_END_NAMESPACE_VERSION
    } // inline namespace chrono_literals
    } // inline namespace literals
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/complex gcc-5.5.0/libstdc++-v3/include/std/complex
*** gcc-5.4.0/libstdc++-v3/include/std/complex	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/std/complex	Mon Oct  3 14:42:06 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1929,1938 ****
--- 1929,1941 ----
      conj(_Tp __x)
      { return __x; }
  
+ _GLIBCXX_END_NAMESPACE_VERSION
+ 
  #if __cplusplus > 201103L
  
  inline namespace literals {
  inline namespace complex_literals {
+ _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
  #define __cpp_lib_complex_udls 201309
  
*************** inline namespace complex_literals {
*** 1960,1971 ****
    operator""il(unsigned long long __num)
    { return std::complex<long double>{0.0L, static_cast<long double>(__num)}; }
  
  } // inline namespace complex_literals
  } // inline namespace literals
  
  #endif // C++14
  
- _GLIBCXX_END_NAMESPACE_VERSION
  } // namespace
  
  #endif  // C++11
--- 1963,1974 ----
    operator""il(unsigned long long __num)
    { return std::complex<long double>{0.0L, static_cast<long double>(__num)}; }
  
+ _GLIBCXX_END_NAMESPACE_VERSION
  } // inline namespace complex_literals
  } // inline namespace literals
  
  #endif // C++14
  
  } // namespace
  
  #endif  // C++11
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/functional gcc-5.5.0/libstdc++-v3/include/std/functional
*** gcc-5.4.0/libstdc++-v3/include/std/functional	Tue Jan 12 16:54:10 2016
--- gcc-5.5.0/libstdc++-v3/include/std/functional	Mon Sep  4 17:08:56 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 448,464 ****
    template<typename _Tp>
      void cref(const _Tp&&) = delete;
  
!   /// Partial specialization.
    template<typename _Tp>
      inline reference_wrapper<_Tp>
      ref(reference_wrapper<_Tp> __t) noexcept
!     { return ref(__t.get()); }
  
!   /// Partial specialization.
    template<typename _Tp>
      inline reference_wrapper<const _Tp>
      cref(reference_wrapper<_Tp> __t) noexcept
!     { return cref(__t.get()); }
  
    // @} group functors
  
--- 448,464 ----
    template<typename _Tp>
      void cref(const _Tp&&) = delete;
  
!   /// std::ref overload to prevent wrapping a reference_wrapper
    template<typename _Tp>
      inline reference_wrapper<_Tp>
      ref(reference_wrapper<_Tp> __t) noexcept
!     { return std::ref(__t.get()); }
  
!   /// std::cref overload to prevent wrapping a reference_wrapper
    template<typename _Tp>
      inline reference_wrapper<const _Tp>
      cref(reference_wrapper<_Tp> __t) noexcept
!     { return std::cref(__t.get()); }
  
    // @} group functors
  
*************** _GLIBCXX_MEM_FN_TRAITS(&&, false_type, t
*** 1593,1599 ****
      void (_Undefined_class::*_M_member_pointer)();
    };
  
!   union _Any_data
    {
      void*       _M_access()       { return &_M_pod_data[0]; }
      const void* _M_access() const { return &_M_pod_data[0]; }
--- 1593,1599 ----
      void (_Undefined_class::*_M_member_pointer)();
    };
  
!   union [[gnu::may_alias]] _Any_data
    {
      void*       _M_access()       { return &_M_pod_data[0]; }
      const void* _M_access() const { return &_M_pod_data[0]; }
*************** _GLIBCXX_MEM_FN_TRAITS(&&, false_type, t
*** 1699,1705 ****
  	static void
  	_M_clone(_Any_data& __dest, const _Any_data& __source, true_type)
  	{
! 	  new (__dest._M_access()) _Functor(__source._M_access<_Functor>());
  	}
  
  	// Clone a function object that is not location-invariant or
--- 1699,1705 ----
  	static void
  	_M_clone(_Any_data& __dest, const _Any_data& __source, true_type)
  	{
! 	  ::new (__dest._M_access()) _Functor(__source._M_access<_Functor>());
  	}
  
  	// Clone a function object that is not location-invariant or
*************** _GLIBCXX_MEM_FN_TRAITS(&&, false_type, t
*** 1764,1776 ****
  
  	template<typename _Tp>
  	  static bool
! 	  _M_not_empty_function(_Tp* const& __fp)
! 	  { return __fp; }
  
  	template<typename _Class, typename _Tp>
  	  static bool
! 	  _M_not_empty_function(_Tp _Class::* const& __mp)
! 	  { return __mp; }
  
  	template<typename _Tp>
  	  static bool
--- 1764,1776 ----
  
  	template<typename _Tp>
  	  static bool
! 	  _M_not_empty_function(_Tp* __fp)
! 	  { return __fp != nullptr; }
  
  	template<typename _Class, typename _Tp>
  	  static bool
! 	  _M_not_empty_function(_Tp _Class::* __mp)
! 	  { return __mp != nullptr; }
  
  	template<typename _Tp>
  	  static bool
*************** _GLIBCXX_MEM_FN_TRAITS(&&, false_type, t
*** 1780,1786 ****
        private:
  	static void
  	_M_init_functor(_Any_data& __functor, _Functor&& __f, true_type)
! 	{ new (__functor._M_access()) _Functor(std::move(__f)); }
  
  	static void
  	_M_init_functor(_Any_data& __functor, _Functor&& __f, false_type)
--- 1780,1786 ----
        private:
  	static void
  	_M_init_functor(_Any_data& __functor, _Functor&& __f, true_type)
! 	{ ::new (__functor._M_access()) _Functor(std::move(__f)); }
  
  	static void
  	_M_init_functor(_Any_data& __functor, _Functor&& __f, false_type)
*************** _GLIBCXX_MEM_FN_TRAITS(&&, false_type, t
*** 1978,1984 ****
        typedef _Res _Signature_type(_ArgTypes...);
  
        template<typename _Func,
! 	       typename _Res2 = typename result_of<_Func(_ArgTypes...)>::type>
  	struct _Callable : __check_func_return_type<_Res2, _Res> { };
  
        // Used so the return type convertibility checks aren't done when
--- 1978,1984 ----
        typedef _Res _Signature_type(_ArgTypes...);
  
        template<typename _Func,
! 	       typename _Res2 = typename result_of<_Func&(_ArgTypes...)>::type>
  	struct _Callable : __check_func_return_type<_Res2, _Res> { };
  
        // Used so the return type convertibility checks aren't done when
*************** _GLIBCXX_MEM_FN_TRAITS(&&, false_type, t
*** 2025,2031 ****
         *  The newly-created %function contains the target of @a __x
         *  (if it has one).
         */
!       function(function&& __x) : _Function_base()
        {
  	__x.swap(*this);
        }
--- 2025,2031 ----
         *  The newly-created %function contains the target of @a __x
         *  (if it has one).
         */
!       function(function&& __x) noexcept : _Function_base()
        {
  	__x.swap(*this);
        }
*************** _GLIBCXX_MEM_FN_TRAITS(&&, false_type, t
*** 2084,2090 ****
         *  object, then this operation will not throw an %exception.
         */
        function&
!       operator=(function&& __x)
        {
  	function(std::move(__x)).swap(*this);
  	return *this;
--- 2084,2090 ----
         *  object, then this operation will not throw an %exception.
         */
        function&
!       operator=(function&& __x) noexcept
        {
  	function(std::move(__x)).swap(*this);
  	return *this;
*************** _GLIBCXX_MEM_FN_TRAITS(&&, false_type, t
*** 2151,2157 ****
         *  Swap the targets of @c this function object and @a __f. This
         *  function will not throw an %exception.
         */
!       void swap(function& __x)
        {
  	std::swap(_M_functor, __x._M_functor);
  	std::swap(_M_manager, __x._M_manager);
--- 2151,2157 ----
         *  Swap the targets of @c this function object and @a __f. This
         *  function will not throw an %exception.
         */
!       void swap(function& __x) noexcept
        {
  	std::swap(_M_functor, __x._M_functor);
  	std::swap(_M_manager, __x._M_manager);
*************** _GLIBCXX_MEM_FN_TRAITS(&&, false_type, t
*** 2364,2372 ****
     *
     *  This function will not throw an %exception.
     */
    template<typename _Res, typename... _Args>
      inline void
!     swap(function<_Res(_Args...)>& __x, function<_Res(_Args...)>& __y)
      { __x.swap(__y); }
  
  _GLIBCXX_END_NAMESPACE_VERSION
--- 2364,2374 ----
     *
     *  This function will not throw an %exception.
     */
+   // _GLIBCXX_RESOLVE_LIB_DEFECTS
+   // 2062. Effect contradictions w/o no-throw guarantee of std::function swaps
    template<typename _Res, typename... _Args>
      inline void
!     swap(function<_Res(_Args...)>& __x, function<_Res(_Args...)>& __y) noexcept
      { __x.swap(__y); }
  
  _GLIBCXX_END_NAMESPACE_VERSION
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/istream gcc-5.5.0/libstdc++-v3/include/std/istream
*** gcc-5.4.0/libstdc++-v3/include/std/istream	Wed Mar 25 09:57:06 2015
--- gcc-5.5.0/libstdc++-v3/include/std/istream	Mon Sep  4 17:09:01 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 150,158 ****
         *  whatever data is appropriate for the type of the argument.
         *
         *  If an exception is thrown during extraction, ios_base::badbit
!        *  will be turned on in the stream's error state without causing an
!        *  ios_base::failure to be thrown.  The original exception will then
!        *  be rethrown.
        */
  
        //@{
--- 150,158 ----
         *  whatever data is appropriate for the type of the argument.
         *
         *  If an exception is thrown during extraction, ios_base::badbit
!        *  will be turned on in the stream's error state (without causing an
!        *  ios_base::failure to be thrown) and the original exception will
!        *  be rethrown if badbit is set in the exceptions mask.
        */
  
        //@{
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 286,294 ****
         *  by gcount().
         *
         *  If an exception is thrown during extraction, ios_base::badbit
!        *  will be turned on in the stream's error state without causing an
!        *  ios_base::failure to be thrown.  The original exception will then
!        *  be rethrown.
        */
  
        /**
--- 286,294 ----
         *  by gcount().
         *
         *  If an exception is thrown during extraction, ios_base::badbit
!        *  will be turned on in the stream's error state (without causing an
!        *  ios_base::failure to be thrown) and the original exception will
!        *  be rethrown if badbit is set in the exceptions mask.
        */
  
        /**
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/scoped_allocator gcc-5.5.0/libstdc++-v3/include/std/scoped_allocator
*** gcc-5.4.0/libstdc++-v3/include/std/scoped_allocator	Mon Mar  2 17:50:55 2015
--- gcc-5.5.0/libstdc++-v3/include/std/scoped_allocator	Fri Sep  1 12:15:44 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 74,95 ****
      : allocator_traits<_Alloc>::propagate_on_container_swap
      { };
  
- 
    template<typename _Alloc>
!     inline auto
!     __do_outermost(_Alloc& __a, _Alloc*) -> decltype(__a.outer_allocator())
!     { return __a.outer_allocator(); }
  
    template<typename _Alloc>
!     inline _Alloc&
!     __do_outermost(_Alloc& __a, ...)
!     { return __a; }
  
-   // TODO: make recursive (see note in 20.12.4/1)
    template<typename _Alloc>
!     inline auto
!     __outermost(_Alloc& __a) -> decltype(__do_outermost(__a, &__a))
!     { return __do_outermost(__a, &__a); }
  
    template<typename _OuterAlloc, typename... _InnerAllocs>
      class scoped_allocator_adaptor;
--- 74,109 ----
      : allocator_traits<_Alloc>::propagate_on_container_swap
      { };
  
    template<typename _Alloc>
!     using __outer_allocator_t
!       = decltype(std::declval<_Alloc>().outer_allocator());
! 
!   template<typename _Alloc, typename = void>
!     struct __outermost_type
!     {
!       using type = _Alloc;
!       static type& _S_outermost(_Alloc& __a) { return __a; }
!     };
  
    template<typename _Alloc>
!     struct __outermost_type<_Alloc, __void_t<__outer_allocator_t<_Alloc>>>
!     : __outermost_type<
!       typename remove_reference<__outer_allocator_t<_Alloc>>::type
!     >
!     {
!       using __base = __outermost_type<
!         typename remove_reference<__outer_allocator_t<_Alloc>>::type
!       >;
! 
!       static typename __base::type&
!       _S_outermost(_Alloc& __a)
!       { return __base::_S_outermost(__a.outer_allocator()); }
!     };
  
    template<typename _Alloc>
!     inline typename __outermost_type<_Alloc>::type&
!     __outermost(_Alloc& __a)
!     { return __outermost_type<_Alloc>::_S_outermost(__a); }
  
    template<typename _OuterAlloc, typename... _InnerAllocs>
      class scoped_allocator_adaptor;
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 196,208 ****
        { return std::tuple_cat(std::tie(outer_allocator()), _M_inner._M_tie()); }
  
        template<typename _Alloc>
- 	using __outermost_type = typename
- 	  std::decay<decltype(__outermost(std::declval<_Alloc&>()))>::type;
- 
-       template<typename _Alloc>
  	using __outermost_alloc_traits
! 	  = allocator_traits<__outermost_type<_Alloc>>;
!       
        template<typename _Tp, typename... _Args>
          void 
          _M_construct(__uses_alloc0, _Tp* __p, _Args&&... __args)
--- 210,218 ----
        { return std::tuple_cat(std::tie(outer_allocator()), _M_inner._M_tie()); }
  
        template<typename _Alloc>
  	using __outermost_alloc_traits
! 	  = allocator_traits<typename __outermost_type<_Alloc>::type>;
! 
        template<typename _Tp, typename... _Args>
          void 
          _M_construct(__uses_alloc0, _Tp* __p, _Args&&... __args)
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 251,256 ****
--- 261,272 ----
            _M_inner(_S_select_on_copy(std::get<_Indices+1>(__refs))...)
          { }
  
+       // Used to constrain constructors to disallow invalid conversions.
+       template<typename _Alloc>
+         using _Constructible = typename enable_if<
+             is_constructible<_OuterAlloc, _Alloc>::value
+           >::type;
+ 
      public:
        typedef _OuterAlloc                       outer_allocator_type;
        typedef typename __inner_type::__type     inner_allocator_type;
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 283,289 ****
  
        scoped_allocator_adaptor() : _OuterAlloc(), _M_inner() { }
  
!       template<typename _Outer2>
          scoped_allocator_adaptor(_Outer2&& __outer,
                                   const _InnerAllocs&... __inner)
          : _OuterAlloc(std::forward<_Outer2>(__outer)),
--- 299,305 ----
  
        scoped_allocator_adaptor() : _OuterAlloc(), _M_inner() { }
  
!       template<typename _Outer2, typename = _Constructible<_Outer2>>
          scoped_allocator_adaptor(_Outer2&& __outer,
                                   const _InnerAllocs&... __inner)
          : _OuterAlloc(std::forward<_Outer2>(__outer)),
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 300,313 ****
  	_M_inner(std::move(__other._M_inner))
        { }
  
!       template<typename _Outer2>
          scoped_allocator_adaptor(
              const scoped_allocator_adaptor<_Outer2, _InnerAllocs...>& __other)
          : _OuterAlloc(__other.outer_allocator()),
            _M_inner(__other._M_inner)
          { }
  
!       template<typename _Outer2>
          scoped_allocator_adaptor(
              scoped_allocator_adaptor<_Outer2, _InnerAllocs...>&& __other)
          : _OuterAlloc(std::move(__other.outer_allocator())),
--- 316,329 ----
  	_M_inner(std::move(__other._M_inner))
        { }
  
!       template<typename _Outer2, typename = _Constructible<const _Outer2&>>
          scoped_allocator_adaptor(
              const scoped_allocator_adaptor<_Outer2, _InnerAllocs...>& __other)
          : _OuterAlloc(__other.outer_allocator()),
            _M_inner(__other._M_inner)
          { }
  
!       template<typename _Outer2, typename = _Constructible<_Outer2>>
          scoped_allocator_adaptor(
              scoped_allocator_adaptor<_Outer2, _InnerAllocs...>&& __other)
          : _OuterAlloc(std::move(__other.outer_allocator())),
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/sstream gcc-5.5.0/libstdc++-v3/include/std/sstream
*** gcc-5.4.0/libstdc++-v3/include/std/sstream	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/std/sstream	Mon Sep  4 16:41:25 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_CXX11
*** 302,319 ****
  	__xfer_bufptrs(const basic_stringbuf& __from, basic_stringbuf* __to)
  	: _M_to{__to}, _M_goff{-1, -1, -1}, _M_poff{-1, -1, -1}
  	{
! 	  const _CharT* __str = __from._M_string.data();
  	  if (__from.eback())
  	    {
! 	    _M_goff[0] = __from.eback() - __str;
! 	    _M_goff[1] = __from.gptr() - __str;
! 	    _M_goff[2] = __from.egptr() - __str;
  	    }
  	  if (__from.pbase())
  	    {
  	      _M_poff[0] = __from.pbase() - __str;
  	      _M_poff[1] = __from.pptr() - __from.pbase();
  	      _M_poff[2] = __from.epptr() - __str;
  	    }
  	}
  
--- 302,332 ----
  	__xfer_bufptrs(const basic_stringbuf& __from, basic_stringbuf* __to)
  	: _M_to{__to}, _M_goff{-1, -1, -1}, _M_poff{-1, -1, -1}
  	{
! 	  const _CharT* const __str = __from._M_string.data();
! 	  const _CharT* __end = nullptr;
  	  if (__from.eback())
  	    {
! 	      _M_goff[0] = __from.eback() - __str;
! 	      _M_goff[1] = __from.gptr() - __str;
! 	      _M_goff[2] = __from.egptr() - __str;
! 	      __end = __from.egptr();
  	    }
  	  if (__from.pbase())
  	    {
  	      _M_poff[0] = __from.pbase() - __str;
  	      _M_poff[1] = __from.pptr() - __from.pbase();
  	      _M_poff[2] = __from.epptr() - __str;
+ 	      if (__from.pptr() > __end)
+ 		__end = __from.pptr();
+ 	    }
+ 
+ 	  // Set _M_string length to the greater of the get and put areas.
+ 	  if (__end)
+ 	    {
+ 	      // The const_cast avoids changing this constructor's signature,
+ 	      // because it is exported from the dynamic library.
+ 	      auto& __mut_from = const_cast<basic_stringbuf&>(__from);
+ 	      __mut_from._M_string._M_length(__end - __str);
  	    }
  	}
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/thread gcc-5.5.0/libstdc++-v3/include/std/thread
*** gcc-5.4.0/libstdc++-v3/include/std/thread	Thu Mar 26 19:59:08 2015
--- gcc-5.5.0/libstdc++-v3/include/std/thread	Fri Jan  6 14:04:33 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 124,129 ****
--- 124,130 ----
      // 2097.  packaged_task constructors should be constrained
      thread(thread&) = delete;
      thread(const thread&) = delete;
+     thread(const thread&&) = delete;
  
      thread(thread&& __t) noexcept
      { swap(__t); }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/tuple gcc-5.5.0/libstdc++-v3/include/std/tuple
*** gcc-5.4.0/libstdc++-v3/include/std/tuple	Sat Jan 17 00:21:41 2015
--- gcc-5.5.0/libstdc++-v3/include/std/tuple	Mon Dec 19 15:22:05 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 607,613 ****
  
        template<typename _U1, typename _U2, typename = typename
  	       enable_if<__and_<is_convertible<_U1, _T1>,
! 				is_convertible<_U2, _T2>>::value>::type>
          explicit
          constexpr tuple(_U1&& __a1, _U2&& __a2)
  	: _Inherited(std::forward<_U1>(__a1), std::forward<_U2>(__a2)) { }
--- 607,616 ----
  
        template<typename _U1, typename _U2, typename = typename
  	       enable_if<__and_<is_convertible<_U1, _T1>,
! 				is_convertible<_U2, _T2>,
! 				__not_<is_same<typename decay<_U1>::type,
! 					       allocator_arg_t>>>
! 			 ::value>::type>
          explicit
          constexpr tuple(_U1&& __a1, _U2&& __a2)
  	: _Inherited(std::forward<_U1>(__a1), std::forward<_U2>(__a2)) { }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/std/utility gcc-5.5.0/libstdc++-v3/include/std/utility
*** gcc-5.4.0/libstdc++-v3/include/std/utility	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/include/std/utility	Wed May 17 17:18:07 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 202,218 ****
  
    // Stores a tuple of indices.  Used by tuple and pair, and by bind() to
    // extract the elements in a tuple.
!   template<size_t... _Indexes>
!     struct _Index_tuple
      {
!       typedef _Index_tuple<_Indexes..., sizeof...(_Indexes)> __next;
      };
  
    // Builds an _Index_tuple<0, 1, 2, ..., _Num-1>.
    template<size_t _Num>
      struct _Build_index_tuple
      {
!       typedef typename _Build_index_tuple<_Num - 1>::__type::__next __type;
      };
  
    template<>
--- 202,229 ----
  
    // Stores a tuple of indices.  Used by tuple and pair, and by bind() to
    // extract the elements in a tuple.
!   template<size_t... _Indexes> struct _Index_tuple { };
! 
!   // Concatenates two _Index_tuples.
!   template<typename _Itup1, typename _Itup2> struct _Itup_cat;
! 
!   template<size_t... _Ind1, size_t... _Ind2>
!     struct _Itup_cat<_Index_tuple<_Ind1...>, _Index_tuple<_Ind2...>>
      {
!       using __type = _Index_tuple<_Ind1..., (_Ind2 + sizeof...(_Ind1))...>;
      };
  
    // Builds an _Index_tuple<0, 1, 2, ..., _Num-1>.
    template<size_t _Num>
      struct _Build_index_tuple
+     : _Itup_cat<typename _Build_index_tuple<_Num / 2>::__type,
+ 		typename _Build_index_tuple<_Num - _Num / 2>::__type>
+     { };
+ 
+   template<>
+     struct _Build_index_tuple<1>
      {
!       typedef _Index_tuple<0> __type;
      };
  
    template<>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/include/tr1/cmath gcc-5.5.0/libstdc++-v3/include/tr1/cmath
*** gcc-5.4.0/libstdc++-v3/include/tr1/cmath	Tue Nov 24 13:25:07 2015
--- gcc-5.5.0/libstdc++-v3/include/tr1/cmath	Thu Dec  1 15:15:40 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 490,496 ****
  
    using std::ceil;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    copysign(float __x, float __y)
    { return __builtin_copysignf(__x, __y); }
--- 490,496 ----
  
    using std::ceil;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    copysign(float __x, float __y)
    { return __builtin_copysignf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 511,517 ****
    using std::cos;
    using std::cosh;  
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    erf(float __x)
    { return __builtin_erff(__x); }
--- 511,517 ----
    using std::cos;
    using std::cosh;  
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    erf(float __x)
    { return __builtin_erff(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 527,533 ****
      erf(_Tp __x)
      { return __builtin_erf(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    erfc(float __x)
    { return __builtin_erfcf(__x); }
--- 527,533 ----
      erf(_Tp __x)
      { return __builtin_erf(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    erfc(float __x)
    { return __builtin_erfcf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 545,551 ****
  
    using std::exp;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    exp2(float __x)
    { return __builtin_exp2f(__x); }
--- 545,551 ----
  
    using std::exp;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    exp2(float __x)
    { return __builtin_exp2f(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 561,567 ****
      exp2(_Tp __x)
      { return __builtin_exp2(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    expm1(float __x)
    { return __builtin_expm1f(__x); }
--- 561,567 ----
      exp2(_Tp __x)
      { return __builtin_exp2(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    expm1(float __x)
    { return __builtin_expm1f(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 603,609 ****
      { return __builtin_fabs(__x); }
  #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    fdim(float __x, float __y)
    { return __builtin_fdimf(__x, __y); }
--- 603,609 ----
      { return __builtin_fabs(__x); }
  #endif
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    fdim(float __x, float __y)
    { return __builtin_fdimf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 623,629 ****
  
    using std::floor;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    fma(float __x, float __y, float __z)
    { return __builtin_fmaf(__x, __y, __z); }
--- 623,629 ----
  
    using std::floor;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    fma(float __x, float __y, float __z)
    { return __builtin_fmaf(__x, __y, __z); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 641,647 ****
        return fma(__type(__x), __type(__y), __type(__z));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    fmax(float __x, float __y)
    { return __builtin_fmaxf(__x, __y); }
--- 641,647 ----
        return fma(__type(__x), __type(__y), __type(__z));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    fmax(float __x, float __y)
    { return __builtin_fmaxf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 659,665 ****
        return fmax(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    fmin(float __x, float __y)
    { return __builtin_fminf(__x, __y); }
--- 659,665 ----
        return fmax(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    fmin(float __x, float __y)
    { return __builtin_fminf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 680,686 ****
    using std::fmod;
    using std::frexp;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    hypot(float __x, float __y)
    { return __builtin_hypotf(__x, __y); }
--- 680,686 ----
    using std::fmod;
    using std::frexp;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    hypot(float __x, float __y)
    { return __builtin_hypotf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 716,722 ****
  
    using std::ldexp;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    lgamma(float __x)
    { return __builtin_lgammaf(__x); }
--- 716,722 ----
  
    using std::ldexp;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    lgamma(float __x)
    { return __builtin_lgammaf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 732,738 ****
      lgamma(_Tp __x)
      { return __builtin_lgamma(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline long long
    llrint(float __x)
    { return __builtin_llrintf(__x); }
--- 732,738 ----
      lgamma(_Tp __x)
      { return __builtin_lgamma(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline long long
    llrint(float __x)
    { return __builtin_llrintf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 748,754 ****
      llrint(_Tp __x)
      { return __builtin_llrint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline long long
    llround(float __x)
    { return __builtin_llroundf(__x); }
--- 748,754 ----
      llrint(_Tp __x)
      { return __builtin_llrint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline long long
    llround(float __x)
    { return __builtin_llroundf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 767,773 ****
    using std::log;
    using std::log10;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    log1p(float __x)
    { return __builtin_log1pf(__x); }
--- 767,773 ----
    using std::log;
    using std::log10;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    log1p(float __x)
    { return __builtin_log1pf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 784,790 ****
      { return __builtin_log1p(__x); }
  
    // DR 568.
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    log2(float __x)
    { return __builtin_log2f(__x); }
--- 784,790 ----
      { return __builtin_log1p(__x); }
  
    // DR 568.
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    log2(float __x)
    { return __builtin_log2f(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 800,806 ****
      log2(_Tp __x)
      { return __builtin_log2(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    logb(float __x)
    { return __builtin_logbf(__x); }
--- 800,806 ----
      log2(_Tp __x)
      { return __builtin_log2(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    logb(float __x)
    { return __builtin_logbf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 818,824 ****
        return __builtin_logb(__x);
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline long
    lrint(float __x)
    { return __builtin_lrintf(__x); }
--- 818,824 ----
        return __builtin_logb(__x);
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline long
    lrint(float __x)
    { return __builtin_lrintf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 834,840 ****
      lrint(_Tp __x)
      { return __builtin_lrint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline long
    lround(float __x)
    { return __builtin_lroundf(__x); }
--- 834,840 ----
      lrint(_Tp __x)
      { return __builtin_lrint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline long
    lround(float __x)
    { return __builtin_lroundf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 850,856 ****
      lround(_Tp __x)
      { return __builtin_lround(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    nearbyint(float __x)
    { return __builtin_nearbyintf(__x); }
--- 850,856 ----
      lround(_Tp __x)
      { return __builtin_lround(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP_FP
    inline float
    nearbyint(float __x)
    { return __builtin_nearbyintf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 866,872 ****
      nearbyint(_Tp __x)
      { return __builtin_nearbyint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    nextafter(float __x, float __y)
    { return __builtin_nextafterf(__x, __y); }
--- 866,872 ----
      nearbyint(_Tp __x)
      { return __builtin_nearbyint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    nextafter(float __x, float __y)
    { return __builtin_nextafterf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 884,890 ****
        return nextafter(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    nexttoward(float __x, long double __y)
    { return __builtin_nexttowardf(__x, __y); }
--- 884,890 ----
        return nextafter(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP_FP
    inline float
    nexttoward(float __x, long double __y)
    { return __builtin_nexttowardf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 900,906 ****
      nexttoward(_Tp __x, long double __y)
      { return __builtin_nexttoward(__x, __y); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    remainder(float __x, float __y)
    { return __builtin_remainderf(__x, __y); }
--- 900,906 ----
      nexttoward(_Tp __x, long double __y)
      { return __builtin_nexttoward(__x, __y); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    remainder(float __x, float __y)
    { return __builtin_remainderf(__x, __y); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 918,924 ****
        return remainder(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    remquo(float __x, float __y, int* __pquo)
    { return __builtin_remquof(__x, __y, __pquo); }
--- 918,924 ----
        return remainder(__type(__x), __type(__y));
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    remquo(float __x, float __y, int* __pquo)
    { return __builtin_remquof(__x, __y, __pquo); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 936,942 ****
        return remquo(__type(__x), __type(__y), __pquo);
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    rint(float __x)
    { return __builtin_rintf(__x); }
--- 936,942 ----
        return remquo(__type(__x), __type(__y), __pquo);
      }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    rint(float __x)
    { return __builtin_rintf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 952,958 ****
      rint(_Tp __x)
      { return __builtin_rint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    round(float __x)
    { return __builtin_roundf(__x); }
--- 952,958 ----
      rint(_Tp __x)
      { return __builtin_rint(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    round(float __x)
    { return __builtin_roundf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 968,974 ****
      round(_Tp __x)
      { return __builtin_round(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    scalbln(float __x, long __ex)
    { return __builtin_scalblnf(__x, __ex); }
--- 968,974 ----
      round(_Tp __x)
      { return __builtin_round(__x); }
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    scalbln(float __x, long __ex)
    { return __builtin_scalblnf(__x, __ex); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 984,990 ****
      scalbln(_Tp __x, long __ex)
      { return __builtin_scalbln(__x, __ex); }
   
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    scalbn(float __x, int __ex)
    { return __builtin_scalbnf(__x, __ex); }
--- 984,990 ----
      scalbln(_Tp __x, long __ex)
      { return __builtin_scalbln(__x, __ex); }
   
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    scalbn(float __x, int __ex)
    { return __builtin_scalbnf(__x, __ex); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1006,1012 ****
    using std::tan;
    using std::tanh;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    tgamma(float __x)
    { return __builtin_tgammaf(__x); }
--- 1006,1012 ----
    using std::tan;
    using std::tanh;
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    tgamma(float __x)
    { return __builtin_tgammaf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1022,1028 ****
      tgamma(_Tp __x)
      { return __builtin_tgamma(__x); }
   
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    trunc(float __x)
    { return __builtin_truncf(__x); }
--- 1022,1028 ----
      tgamma(_Tp __x)
      { return __builtin_tgamma(__x); }
   
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    trunc(float __x)
    { return __builtin_truncf(__x); }
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 1064,1070 ****
    // the discussion about this issue here:
    // http://gcc.gnu.org/ml/gcc-patches/2012-09/msg01278.html
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO
    inline float
    pow(float __x, float __y)
    { return std::pow(__x, __y); }
--- 1064,1070 ----
    // the discussion about this issue here:
    // http://gcc.gnu.org/ml/gcc-patches/2012-09/msg01278.html
  
! #ifndef __CORRECT_ISO_CPP11_MATH_H_PROTO_FP
    inline float
    pow(float __x, float __y)
    { return std::pow(__x, __y); }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/libsupc++/cxxabi.h gcc-5.5.0/libstdc++-v3/libsupc++/cxxabi.h
*** gcc-5.4.0/libstdc++-v3/libsupc++/cxxabi.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/libsupc++/cxxabi.h	Wed Sep 13 10:10:44 2017
*************** namespace __cxxabiv1
*** 185,191 ****
     *  with GNU extensions. For example, this function is used in
     *  __gnu_cxx::__verbose_terminate_handler.
     *
!    *  See http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt12ch39.html
     *  for other examples of use.
     *
     *  @note The same demangling functionality is available via
--- 185,191 ----
     *  with GNU extensions. For example, this function is used in
     *  __gnu_cxx::__verbose_terminate_handler.
     *
!    *  See https://gcc.gnu.org/onlinedocs/libstdc++/manual/ext_demangling.html
     *  for other examples of use.
     *
     *  @note The same demangling functionality is available via
diff -Nrcpad gcc-5.4.0/libstdc++-v3/python/libstdcxx/v6/printers.py gcc-5.5.0/libstdc++-v3/python/libstdcxx/v6/printers.py
*** gcc-5.4.0/libstdc++-v3/python/libstdcxx/v6/printers.py	Mon Nov 16 23:46:56 2015
--- gcc-5.5.0/libstdc++-v3/python/libstdcxx/v6/printers.py	Thu May 18 15:31:07 2017
*************** except ImportError:
*** 85,93 ****
  def find_type(orig, name):
      typ = orig.strip_typedefs()
      while True:
!         # Use typ.name here instead of str(typ) to discard any const,etc.
!         # qualifiers.  PR 67440.
!         search = typ.name + '::' + name
          try:
              return gdb.lookup_type(search)
          except RuntimeError:
--- 85,92 ----
  def find_type(orig, name):
      typ = orig.strip_typedefs()
      while True:
!         # Strip cv-qualifiers.  PR 67440.
!         search = '%s::%s' % (typ.unqualified(), name)
          try:
              return gdb.lookup_type(search)
          except RuntimeError:
*************** class StdListIteratorPrinter:
*** 174,182 ****
          self.typename = typename
  
      def to_string(self):
          nodetype = find_type(self.val.type, '_Node')
          nodetype = nodetype.strip_typedefs().pointer()
!         return self.val['_M_node'].cast(nodetype).dereference()['_M_data']
  
  class StdSlistPrinter:
      "Print a __gnu_cxx::slist"
--- 173,183 ----
          self.typename = typename
  
      def to_string(self):
+         if not self.val['_M_node']:
+             return 'non-dereferenceable iterator for std::list'
          nodetype = find_type(self.val.type, '_Node')
          nodetype = nodetype.strip_typedefs().pointer()
!         return str(self.val['_M_node'].cast(nodetype).dereference()['_M_data'])
  
  class StdSlistPrinter:
      "Print a __gnu_cxx::slist"
*************** class StdSlistIteratorPrinter:
*** 219,227 ****
          self.val = val
  
      def to_string(self):
          nodetype = find_type(self.val.type, '_Node')
          nodetype = nodetype.strip_typedefs().pointer()
!         return self.val['_M_node'].cast(nodetype).dereference()['_M_data']
  
  class StdVectorPrinter:
      "Print a std::vector"
--- 220,230 ----
          self.val = val
  
      def to_string(self):
+         if not self.val['_M_node']:
+             return 'non-dereferenceable iterator for __gnu_cxx::slist'
          nodetype = find_type(self.val.type, '_Node')
          nodetype = nodetype.strip_typedefs().pointer()
!         return str(self.val['_M_node'].cast(nodetype).dereference()['_M_data'])
  
  class StdVectorPrinter:
      "Print a std::vector"
*************** class StdVectorIteratorPrinter:
*** 306,312 ****
          self.val = val
  
      def to_string(self):
!         return self.val['_M_current'].dereference()
  
  class StdTuplePrinter:
      "Print a std::tuple"
--- 309,317 ----
          self.val = val
  
      def to_string(self):
!         if not self.val['_M_current']:
!             return 'non-dereferenceable iterator for std::vector'
!         return str(self.val['_M_current'].dereference())
  
  class StdTuplePrinter:
      "Print a std::tuple"
*************** class StdRbtreeIteratorPrinter:
*** 463,470 ****
          self.link_type = nodetype.strip_typedefs().pointer()
  
      def to_string (self):
          node = self.val['_M_node'].cast(self.link_type).dereference()
!         return get_value_from_Rb_tree_node(node)
  
  class StdDebugIteratorPrinter:
      "Print a debug enabled version of an iterator"
--- 468,477 ----
          self.link_type = nodetype.strip_typedefs().pointer()
  
      def to_string (self):
+         if not self.val['_M_node']:
+             return 'non-dereferenceable iterator for associative container'
          node = self.val['_M_node'].cast(self.link_type).dereference()
!         return str(get_value_from_Rb_tree_node(node))
  
  class StdDebugIteratorPrinter:
      "Print a debug enabled version of an iterator"
*************** class StdDebugIteratorPrinter:
*** 476,482 ****
      # and return the wrapped iterator value.
      def to_string (self):
          itype = self.val.type.template_argument(0)
!         return self.val.cast(itype)
  
  class StdMapPrinter:
      "Print a std::map or std::multimap"
--- 483,489 ----
      # and return the wrapped iterator value.
      def to_string (self):
          itype = self.val.type.template_argument(0)
!         return str(self.val.cast(itype))
  
  class StdMapPrinter:
      "Print a std::map or std::multimap"
*************** class StdDequeIteratorPrinter:
*** 669,675 ****
          self.val = val
  
      def to_string(self):
!         return self.val['_M_cur'].dereference()
  
  class StdStringPrinter:
      "Print a std::basic_string of some kind"
--- 676,684 ----
          self.val = val
  
      def to_string(self):
!         if not self.val['_M_cur']:
!             return 'non-dereferenceable iterator for std::deque'
!         return str(self.val['_M_cur'].dereference())
  
  class StdStringPrinter:
      "Print a std::basic_string of some kind"
*************** def build_libstdcxx_dictionary ():
*** 1343,1348 ****
--- 1352,1358 ----
      libstdcxx_printer.add_container('std::', 'bitset', StdBitsetPrinter)
      libstdcxx_printer.add_container('std::', 'deque', StdDequePrinter)
      libstdcxx_printer.add_container('std::', 'list', StdListPrinter)
+     libstdcxx_printer.add_container('std::__cxx11::', 'list', StdListPrinter)
      libstdcxx_printer.add_container('std::', 'map', StdMapPrinter)
      libstdcxx_printer.add_container('std::', 'multimap', StdMapPrinter)
      libstdcxx_printer.add_container('std::', 'multiset', StdSetPrinter)
diff -Nrcpad gcc-5.4.0/libstdc++-v3/python/libstdcxx/v6/xmethods.py gcc-5.5.0/libstdc++-v3/python/libstdcxx/v6/xmethods.py
*** gcc-5.4.0/libstdc++-v3/python/libstdcxx/v6/xmethods.py	Tue May 26 21:28:42 2015
--- gcc-5.5.0/libstdc++-v3/python/libstdcxx/v6/xmethods.py	Thu May 18 09:23:29 2017
*************** class ArrayMethodsMatcher(gdb.xmethod.XM
*** 165,171 ****
  class DequeWorkerBase(gdb.xmethod.XMethodWorker):
      def __init__(self, val_type):
          self._val_type = val_type
!         self._bufsize = (512 / val_type.sizeof) or 1
  
      def size(self, obj):
          first_node = obj['_M_impl']['_M_start']['_M_node']
--- 165,171 ----
  class DequeWorkerBase(gdb.xmethod.XMethodWorker):
      def __init__(self, val_type):
          self._val_type = val_type
!         self._bufsize = 512 // val_type.sizeof or 1
  
      def size(self, obj):
          first_node = obj['_M_impl']['_M_start']['_M_node']
*************** class DequeWorkerBase(gdb.xmethod.XMetho
*** 174,183 ****
          first = obj['_M_impl']['_M_finish']['_M_first']
          return (last_node - first_node) * self._bufsize + (cur - first)
  
!     def index(self, obj, index):
          first_node = obj['_M_impl']['_M_start']['_M_node']
!         index_node = first_node + index / self._bufsize
!         return index_node[0][index % self._bufsize]
  
  class DequeEmptyWorker(DequeWorkerBase):
      def get_arg_types(self):
--- 174,183 ----
          first = obj['_M_impl']['_M_finish']['_M_first']
          return (last_node - first_node) * self._bufsize + (cur - first)
  
!     def index(self, obj, idx):
          first_node = obj['_M_impl']['_M_start']['_M_node']
!         index_node = first_node + int(idx) // self._bufsize
!         return index_node[0][idx % self._bufsize]
  
  class DequeEmptyWorker(DequeWorkerBase):
      def get_arg_types(self):
*************** class ListMethodsMatcher(gdb.xmethod.XMe
*** 381,387 ****
          self.methods = [self._method_dict[m] for m in self._method_dict]
  
      def match(self, class_type, method_name):
!         if not re.match('^std::list<.*>$', class_type.tag):
              return None
          method = self._method_dict.get(method_name)
          if method is None or not method.enabled:
--- 381,387 ----
          self.methods = [self._method_dict[m] for m in self._method_dict]
  
      def match(self, class_type, method_name):
!         if not re.match('^std::(__cxx11::)?list<.*>$', class_type.tag):
              return None
          method = self._method_dict.get(method_name)
          if method is None or not method.enabled:
*************** class VectorWorkerBase(gdb.xmethod.XMeth
*** 410,416 ****
          if self._val_type.code == gdb.TYPE_CODE_BOOL:
              start = obj['_M_impl']['_M_start']['_M_p']
              bit_size = start.dereference().type.sizeof * 8
!             valp = start + index / bit_size
              offset = index % bit_size
              return (valp.dereference() & (1 << offset)) > 0
          else:
--- 410,416 ----
          if self._val_type.code == gdb.TYPE_CODE_BOOL:
              start = obj['_M_impl']['_M_start']['_M_p']
              bit_size = start.dereference().type.sizeof * 8
!             valp = start + index // bit_size
              offset = index % bit_size
              return (valp.dereference() & (1 << offset)) > 0
          else:
diff -Nrcpad gcc-5.4.0/libstdc++-v3/src/c++11/codecvt.cc gcc-5.5.0/libstdc++-v3/src/c++11/codecvt.cc
*** gcc-5.4.0/libstdc++-v3/src/c++11/codecvt.cc	Wed May 25 16:41:42 2016
--- gcc-5.5.0/libstdc++-v3/src/c++11/codecvt.cc	Fri Mar 17 19:28:42 2017
***************
*** 1,6 ****
  // Locale support (codecvt) -*- C++ -*-
  
! // Copyright (C) 2015 Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
  // software; you can redistribute it and/or modify it under the
--- 1,6 ----
  // Locale support (codecvt) -*- C++ -*-
  
! // Copyright (C) 2015-2017 Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
  // software; you can redistribute it and/or modify it under the
***************
*** 24,36 ****
  
  #include <codecvt>
  #include <cstring>		// std::memcpy, std::memcmp
! #include <bits/stl_algobase.h>	// std::max
  
  #ifdef _GLIBCXX_USE_C99_STDINT_TR1
  namespace std _GLIBCXX_VISIBILITY(default)
  {
  _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
  namespace
  {
    // Largest code point that fits in a single UTF-16 code unit.
--- 24,50 ----
  
  #include <codecvt>
  #include <cstring>		// std::memcpy, std::memcmp
! #include <bits/stl_algobase.h>	// std::min
  
  #ifdef _GLIBCXX_USE_C99_STDINT_TR1
  namespace std _GLIBCXX_VISIBILITY(default)
  {
  _GLIBCXX_BEGIN_NAMESPACE_VERSION
  
+   // The standard doesn't define these operators, which is annoying.
+   static underlying_type<codecvt_mode>::type
+   to_integer(codecvt_mode m)
+   { return static_cast<underlying_type<codecvt_mode>::type>(m); }
+ 
+   static codecvt_mode& operator&=(codecvt_mode& m, codecvt_mode n)
+   { return m = codecvt_mode(to_integer(m) & to_integer(n)); }
+ 
+   static codecvt_mode& operator|=(codecvt_mode& m, codecvt_mode n)
+   { return m = codecvt_mode(to_integer(m) | to_integer(n)); }
+ 
+   static codecvt_mode operator~(codecvt_mode m)
+   { return codecvt_mode(~to_integer(m)); }
+ 
  namespace
  {
    // Largest code point that fits in a single UTF-16 code unit.
*************** namespace
*** 43,77 ****
    const char32_t incomplete_mb_character = char32_t(-2);
    const char32_t invalid_mb_sequence = char32_t(-1);
  
!   template<typename Elem>
      struct range
      {
        Elem* next;
        Elem* end;
  
        Elem operator*() const { return *next; }
  
!       range& operator++() { ++next; return *this; }
  
        size_t size() const { return end - next; }
      };
  
    // Multibyte sequences can have "header" consisting of Byte Order Mark
    const unsigned char utf8_bom[3] = { 0xEF, 0xBB, 0xBF };
!   const unsigned char utf16_bom[4] = { 0xFE, 0xFF };
!   const unsigned char utf16le_bom[4] = { 0xFF, 0xFE };
  
!   template<size_t N>
!     inline bool
!     write_bom(range<char>& to, const unsigned char (&bom)[N])
      {
!       if (to.size() < N)
  	return false;
        memcpy(to.next, bom, N);
!       to.next += N;
        return true;
      }
  
    // If generate_header is set in mode write out UTF-8 BOM.
    bool
    write_utf8_bom(range<char>& to, codecvt_mode mode)
--- 57,198 ----
    const char32_t incomplete_mb_character = char32_t(-2);
    const char32_t invalid_mb_sequence = char32_t(-1);
  
!   // Utility type for reading and writing code units of type Elem from
!   // a range defined by a pair of pointers.
!   template<typename Elem, bool Aligned = true>
      struct range
      {
        Elem* next;
        Elem* end;
  
+       // Write a code unit.
+       range& operator=(Elem e)
+       {
+ 	*next++ = e;
+ 	return *this;
+       }
+ 
+       // Read the next code unit.
        Elem operator*() const { return *next; }
  
!       // Read the Nth code unit.
!       Elem operator[](size_t n) const { return next[n]; }
! 
!       // Move to the next code unit.
!       range& operator++()
!       {
! 	++next;
! 	return *this;
!       }
! 
!       // Move to the Nth code unit.
!       range& operator+=(size_t n)
!       {
! 	next += n;
! 	return *this;
!       }
  
+       // The number of code units remaining.
        size_t size() const { return end - next; }
+ 
+       // The number of bytes remaining.
+       size_t nbytes() const { return (const char*)end - (const char*)next; }
+     };
+ 
+   // This specialization is used when accessing char16_t values through
+   // pointers to char, which might not be correctly aligned for char16_t.
+   template<typename Elem>
+     struct range<Elem, false>
+     {
+       using value_type = typename remove_const<Elem>::type;
+ 
+       using char_pointer = typename
+ 	conditional<is_const<Elem>::value, const char*, char*>::type;
+ 
+       char_pointer next;
+       char_pointer end;
+ 
+       // Write a code unit.
+       range& operator=(Elem e)
+       {
+ 	memcpy(next, &e, sizeof(Elem));
+ 	++*this;
+ 	return *this;
+       }
+ 
+       // Read the next code unit.
+       Elem operator*() const
+       {
+ 	value_type e;
+ 	memcpy(&e, next, sizeof(Elem));
+ 	return e;
+       }
+ 
+       // Read the Nth code unit.
+       Elem operator[](size_t n) const
+       {
+ 	value_type e;
+ 	memcpy(&e, next + n * sizeof(Elem), sizeof(Elem));
+ 	return e;
+       }
+ 
+       // Move to the next code unit.
+       range& operator++()
+       {
+ 	next += sizeof(Elem);
+ 	return *this;
+       }
+ 
+       // Move to the Nth code unit.
+       range& operator+=(size_t n)
+       {
+ 	next += n * sizeof(Elem);
+ 	return *this;
+       }
+ 
+       // The number of code units remaining.
+       size_t size() const { return nbytes() / sizeof(Elem); }
+ 
+       // The number of bytes remaining.
+       size_t nbytes() const { return end - next; }
      };
  
    // Multibyte sequences can have "header" consisting of Byte Order Mark
    const unsigned char utf8_bom[3] = { 0xEF, 0xBB, 0xBF };
!   const unsigned char utf16_bom[2] = { 0xFE, 0xFF };
!   const unsigned char utf16le_bom[2] = { 0xFF, 0xFE };
  
!   // Write a BOM (space permitting).
!   template<typename C, bool A, size_t N>
!     bool
!     write_bom(range<C, A>& to, const unsigned char (&bom)[N])
      {
!       static_assert( (N / sizeof(C)) != 0, "" );
!       static_assert( (N % sizeof(C)) == 0, "" );
! 
!       if (to.nbytes() < N)
  	return false;
        memcpy(to.next, bom, N);
!       to += (N / sizeof(C));
        return true;
      }
  
+   // Try to read a BOM.
+   template<typename C, bool A, size_t N>
+     bool
+     read_bom(range<C, A>& from, const unsigned char (&bom)[N])
+     {
+       static_assert( (N / sizeof(C)) != 0, "" );
+       static_assert( (N % sizeof(C)) == 0, "" );
+ 
+       if (from.nbytes() >= N && !memcmp(from.next, bom, N))
+ 	{
+ 	  from += (N / sizeof(C));
+ 	  return true;
+ 	}
+       return false;
+     }
+ 
    // If generate_header is set in mode write out UTF-8 BOM.
    bool
    write_utf8_bom(range<char>& to, codecvt_mode mode)
*************** namespace
*** 83,114 ****
  
    // If generate_header is set in mode write out the UTF-16 BOM indicated
    // by whether little_endian is set in mode.
    bool
!   write_utf16_bom(range<char16_t>& to, codecvt_mode mode)
    {
      if (mode & generate_header)
      {
!       if (!to.size())
! 	return false;
!       auto* bom = (mode & little_endian) ? utf16le_bom : utf16_bom;
!       std::memcpy(to.next, bom, 2);
!       ++to.next;
      }
      return true;
    }
  
-   template<size_t N>
-     inline bool
-     read_bom(range<const char>& from, const unsigned char (&bom)[N])
-     {
-       if (from.size() >= N && !memcmp(from.next, bom, N))
- 	{
- 	  from.next += N;
- 	  return true;
- 	}
-       return false;
-     }
- 
    // If consume_header is set in mode update from.next to after any BOM.
    void
    read_utf8_bom(range<const char>& from, codecvt_mode mode)
--- 204,223 ----
  
    // If generate_header is set in mode write out the UTF-16 BOM indicated
    // by whether little_endian is set in mode.
+   template<bool Aligned>
    bool
!   write_utf16_bom(range<char16_t, Aligned>& to, codecvt_mode mode)
    {
      if (mode & generate_header)
      {
!       if (mode & little_endian)
! 	return write_bom(to, utf16le_bom);
!       else
! 	return write_bom(to, utf16_bom);
      }
      return true;
    }
  
    // If consume_header is set in mode update from.next to after any BOM.
    void
    read_utf8_bom(range<const char>& from, codecvt_mode mode)
*************** namespace
*** 117,138 ****
        read_bom(from, utf8_bom);
    }
  
!   // If consume_header is set in mode update from.next to after any BOM.
!   // Return little_endian iff the UTF-16LE BOM was present.
!   codecvt_mode
!   read_utf16_bom(range<const char16_t>& from, codecvt_mode mode)
    {
!     if (mode & consume_header && from.size())
        {
! 	if (*from.next == 0xFEFF)
! 	  ++from.next;
! 	else if (*from.next == 0xFFFE)
! 	  {
! 	    ++from.next;
! 	    return little_endian;
! 	  }
        }
-     return {};
    }
  
    // Read a codepoint from a UTF-8 multibyte sequence.
--- 226,246 ----
        read_bom(from, utf8_bom);
    }
  
!   // If consume_header is not set in mode, no effects.
!   // Otherwise, if *from.next is a UTF-16 BOM increment from.next and then:
!   // - if the UTF-16BE BOM was found unset little_endian in mode, or
!   // - if the UTF-16LE BOM was found set little_endian in mode.
!   template<bool Aligned>
!   void
!   read_utf16_bom(range<const char16_t, Aligned>& from, codecvt_mode& mode)
    {
!     if (mode & consume_header)
        {
! 	if (read_bom(from, utf16_bom))
! 	  mode &= ~little_endian;
! 	else if (read_bom(from, utf16le_bom))
! 	  mode |= little_endian;
        }
    }
  
    // Read a codepoint from a UTF-8 multibyte sequence.
*************** namespace
*** 144,154 ****
      const size_t avail = from.size();
      if (avail == 0)
        return incomplete_mb_character;
!     unsigned char c1 = from.next[0];
      // https://en.wikipedia.org/wiki/UTF-8#Sample_code
      if (c1 < 0x80)
      {
!       ++from.next;
        return c1;
      }
      else if (c1 < 0xC2) // continuation or overlong 2-byte sequence
--- 252,262 ----
      const size_t avail = from.size();
      if (avail == 0)
        return incomplete_mb_character;
!     unsigned char c1 = from[0];
      // https://en.wikipedia.org/wiki/UTF-8#Sample_code
      if (c1 < 0x80)
      {
!       ++from;
        return c1;
      }
      else if (c1 < 0xC2) // continuation or overlong 2-byte sequence
*************** namespace
*** 157,207 ****
      {
        if (avail < 2)
  	return incomplete_mb_character;
!       unsigned char c2 = from.next[1];
        if ((c2 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        char32_t c = (c1 << 6) + c2 - 0x3080;
        if (c <= maxcode)
! 	from.next += 2;
        return c;
      }
      else if (c1 < 0xF0) // 3-byte sequence
      {
        if (avail < 3)
  	return incomplete_mb_character;
!       unsigned char c2 = from.next[1];
        if ((c2 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        if (c1 == 0xE0 && c2 < 0xA0) // overlong
  	return invalid_mb_sequence;
!       unsigned char c3 = from.next[2];
        if ((c3 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        char32_t c = (c1 << 12) + (c2 << 6) + c3 - 0xE2080;
        if (c <= maxcode)
! 	from.next += 3;
        return c;
      }
      else if (c1 < 0xF5) // 4-byte sequence
      {
        if (avail < 4)
  	return incomplete_mb_character;
!       unsigned char c2 = from.next[1];
        if ((c2 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        if (c1 == 0xF0 && c2 < 0x90) // overlong
  	return invalid_mb_sequence;
        if (c1 == 0xF4 && c2 >= 0x90) // > U+10FFFF
        return invalid_mb_sequence;
!       unsigned char c3 = from.next[2];
        if ((c3 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
!       unsigned char c4 = from.next[3];
        if ((c4 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        char32_t c = (c1 << 18) + (c2 << 12) + (c3 << 6) + c4 - 0x3C82080;
        if (c <= maxcode)
! 	from.next += 4;
        return c;
      }
      else // > U+10FFFF
--- 265,315 ----
      {
        if (avail < 2)
  	return incomplete_mb_character;
!       unsigned char c2 = from[1];
        if ((c2 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        char32_t c = (c1 << 6) + c2 - 0x3080;
        if (c <= maxcode)
! 	from += 2;
        return c;
      }
      else if (c1 < 0xF0) // 3-byte sequence
      {
        if (avail < 3)
  	return incomplete_mb_character;
!       unsigned char c2 = from[1];
        if ((c2 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        if (c1 == 0xE0 && c2 < 0xA0) // overlong
  	return invalid_mb_sequence;
!       unsigned char c3 = from[2];
        if ((c3 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        char32_t c = (c1 << 12) + (c2 << 6) + c3 - 0xE2080;
        if (c <= maxcode)
! 	from += 3;
        return c;
      }
      else if (c1 < 0xF5) // 4-byte sequence
      {
        if (avail < 4)
  	return incomplete_mb_character;
!       unsigned char c2 = from[1];
        if ((c2 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        if (c1 == 0xF0 && c2 < 0x90) // overlong
  	return invalid_mb_sequence;
        if (c1 == 0xF4 && c2 >= 0x90) // > U+10FFFF
        return invalid_mb_sequence;
!       unsigned char c3 = from[2];
        if ((c3 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
!       unsigned char c4 = from[3];
        if ((c4 & 0xC0) != 0x80)
  	return invalid_mb_sequence;
        char32_t c = (c1 << 18) + (c2 << 12) + (c3 << 6) + c4 - 0x3C82080;
        if (c <= maxcode)
! 	from += 4;
        return c;
      }
      else // > U+10FFFF
*************** namespace
*** 215,245 ****
        {
  	if (to.size() < 1)
  	  return false;
! 	*to.next++ = code_point;
        }
      else if (code_point <= 0x7FF)
        {
  	if (to.size() < 2)
  	  return false;
! 	*to.next++ = (code_point >> 6) + 0xC0;
! 	*to.next++ = (code_point & 0x3F) + 0x80;
        }
      else if (code_point <= 0xFFFF)
        {
  	if (to.size() < 3)
  	  return false;
! 	*to.next++ = (code_point >> 12) + 0xE0;
! 	*to.next++ = ((code_point >> 6) & 0x3F) + 0x80;
! 	*to.next++ = (code_point & 0x3F) + 0x80;
        }
      else if (code_point <= 0x10FFFF)
        {
  	if (to.size() < 4)
  	  return false;
! 	*to.next++ = (code_point >> 18) + 0xF0;
! 	*to.next++ = ((code_point >> 12) & 0x3F) + 0x80;
! 	*to.next++ = ((code_point >> 6) & 0x3F) + 0x80;
! 	*to.next++ = (code_point & 0x3F) + 0x80;
        }
      else
        return false;
--- 323,353 ----
        {
  	if (to.size() < 1)
  	  return false;
! 	to = code_point;
        }
      else if (code_point <= 0x7FF)
        {
  	if (to.size() < 2)
  	  return false;
! 	to = (code_point >> 6) + 0xC0;
! 	to = (code_point & 0x3F) + 0x80;
        }
      else if (code_point <= 0xFFFF)
        {
  	if (to.size() < 3)
  	  return false;
! 	to = (code_point >> 12) + 0xE0;
! 	to = ((code_point >> 6) & 0x3F) + 0x80;
! 	to = (code_point & 0x3F) + 0x80;
        }
      else if (code_point <= 0x10FFFF)
        {
  	if (to.size() < 4)
  	  return false;
! 	to = (code_point >> 18) + 0xF0;
! 	to = ((code_point >> 12) & 0x3F) + 0x80;
! 	to = ((code_point >> 6) & 0x3F) + 0x80;
! 	to = (code_point & 0x3F) + 0x80;
        }
      else
        return false;
*************** namespace
*** 280,326 ****
    // The sequence's endianness is indicated by (mode & little_endian).
    // Updates from.next if the codepoint is not greater than maxcode.
    // Returns invalid_mb_sequence, incomplete_mb_character or the code point.
!   char32_t
!   read_utf16_code_point(range<const char16_t>& from, unsigned long maxcode,
! 			codecvt_mode mode)
!   {
!     const size_t avail = from.size();
!     if (avail == 0)
!       return incomplete_mb_character;
!     int inc = 1;
!     char32_t c = adjust_byte_order(from.next[0], mode);
!     if (is_high_surrogate(c))
!       {
! 	if (avail < 2)
! 	  return incomplete_mb_character;
! 	const char16_t c2 = adjust_byte_order(from.next[1], mode);
! 	if (is_low_surrogate(c2))
! 	  {
! 	    c = surrogate_pair_to_code_point(c, c2);
! 	    inc = 2;
! 	  }
! 	else
! 	  return invalid_mb_sequence;
!       }
!     else if (is_low_surrogate(c))
!       return invalid_mb_sequence;
!     if (c <= maxcode)
!       from.next += inc;
!     return c;
!   }
  
!   template<typename C>
    bool
!   write_utf16_code_point(range<C>& to, char32_t codepoint, codecvt_mode mode)
    {
      static_assert(sizeof(C) >= 2, "a code unit must be at least 16-bit");
  
!     if (codepoint < max_single_utf16_unit)
        {
  	if (to.size() > 0)
  	  {
! 	    *to.next = adjust_byte_order(codepoint, mode);
! 	    ++to.next;
  	    return true;
  	  }
        }
--- 388,434 ----
    // The sequence's endianness is indicated by (mode & little_endian).
    // Updates from.next if the codepoint is not greater than maxcode.
    // Returns invalid_mb_sequence, incomplete_mb_character or the code point.
!   template<bool Aligned>
!     char32_t
!     read_utf16_code_point(range<const char16_t, Aligned>& from,
! 			  unsigned long maxcode, codecvt_mode mode)
!     {
!       const size_t avail = from.size();
!       if (avail == 0)
! 	return incomplete_mb_character;
!       int inc = 1;
!       char32_t c = adjust_byte_order(from[0], mode);
!       if (is_high_surrogate(c))
! 	{
! 	  if (avail < 2)
! 	    return incomplete_mb_character;
! 	  const char16_t c2 = adjust_byte_order(from[1], mode);
! 	  if (is_low_surrogate(c2))
! 	    {
! 	      c = surrogate_pair_to_code_point(c, c2);
! 	      inc = 2;
! 	    }
! 	  else
! 	    return invalid_mb_sequence;
! 	}
!       else if (is_low_surrogate(c))
! 	return invalid_mb_sequence;
!       if (c <= maxcode)
! 	from += inc;
!       return c;
!     }
  
!   template<typename C, bool A>
    bool
!   write_utf16_code_point(range<C, A>& to, char32_t codepoint, codecvt_mode mode)
    {
      static_assert(sizeof(C) >= 2, "a code unit must be at least 16-bit");
  
!     if (codepoint <= max_single_utf16_unit)
        {
  	if (to.size() > 0)
  	  {
! 	    to = adjust_byte_order(codepoint, mode);
  	    return true;
  	  }
        }
*************** namespace
*** 330,338 ****
  	const char32_t LEAD_OFFSET = 0xD800 - (0x10000 >> 10);
  	char16_t lead = LEAD_OFFSET + (codepoint >> 10);
  	char16_t trail = 0xDC00 + (codepoint & 0x3FF);
! 	to.next[0] = adjust_byte_order(lead, mode);
! 	to.next[1] = adjust_byte_order(trail, mode);
! 	to.next += 2;
  	return true;
        }
      return false;
--- 438,445 ----
  	const char32_t LEAD_OFFSET = 0xD800 - (0x10000 >> 10);
  	char16_t lead = LEAD_OFFSET + (codepoint >> 10);
  	char16_t trail = 0xDC00 + (codepoint & 0x3FF);
! 	to = adjust_byte_order(lead, mode);
! 	to = adjust_byte_order(trail, mode);
  	return true;
        }
      return false;
*************** namespace
*** 351,357 ****
  	  return codecvt_base::partial;
  	if (codepoint > maxcode)
  	  return codecvt_base::error;
! 	*to.next++ = codepoint;
        }
      return from.size() ? codecvt_base::partial : codecvt_base::ok;
    }
--- 458,464 ----
  	  return codecvt_base::partial;
  	if (codepoint > maxcode)
  	  return codecvt_base::error;
! 	to = codepoint;
        }
      return from.size() ? codecvt_base::partial : codecvt_base::ok;
    }
*************** namespace
*** 365,387 ****
        return codecvt_base::partial;
      while (from.size())
        {
! 	const char32_t c = from.next[0];
  	if (c > maxcode)
  	  return codecvt_base::error;
  	if (!write_utf8_code_point(to, c))
  	  return codecvt_base::partial;
! 	++from.next;
        }
      return codecvt_base::ok;
    }
  
    // utf16 -> ucs4
    codecvt_base::result
!   ucs4_in(range<const char16_t>& from, range<char32_t>& to,
            unsigned long maxcode = max_code_point, codecvt_mode mode = {})
    {
!     if (read_utf16_bom(from, mode) == little_endian)
!       mode = codecvt_mode(mode & little_endian);
      while (from.size() && to.size())
        {
  	const char32_t codepoint = read_utf16_code_point(from, maxcode, mode);
--- 472,493 ----
        return codecvt_base::partial;
      while (from.size())
        {
! 	const char32_t c = from[0];
  	if (c > maxcode)
  	  return codecvt_base::error;
  	if (!write_utf8_code_point(to, c))
  	  return codecvt_base::partial;
! 	++from;
        }
      return codecvt_base::ok;
    }
  
    // utf16 -> ucs4
    codecvt_base::result
!   ucs4_in(range<const char16_t, false>& from, range<char32_t>& to,
            unsigned long maxcode = max_code_point, codecvt_mode mode = {})
    {
!     read_utf16_bom(from, mode);
      while (from.size() && to.size())
        {
  	const char32_t codepoint = read_utf16_code_point(from, maxcode, mode);
*************** namespace
*** 389,460 ****
  	  return codecvt_base::partial;
  	if (codepoint > maxcode)
  	  return codecvt_base::error;
! 	*to.next++ = codepoint;
        }
      return from.size() ? codecvt_base::partial : codecvt_base::ok;
    }
  
    // ucs4 -> utf16
    codecvt_base::result
!   ucs4_out(range<const char32_t>& from, range<char16_t>& to,
             unsigned long maxcode = max_code_point, codecvt_mode mode = {})
    {
      if (!write_utf16_bom(to, mode))
        return codecvt_base::partial;
      while (from.size())
        {
! 	const char32_t c = from.next[0];
  	if (c > maxcode)
  	  return codecvt_base::error;
  	if (!write_utf16_code_point(to, c, mode))
  	  return codecvt_base::partial;
! 	++from.next;
        }
      return codecvt_base::ok;
    }
  
!   // utf8 -> utf16
    template<typename C>
    codecvt_base::result
    utf16_in(range<const char>& from, range<C>& to,
!            unsigned long maxcode = max_code_point, codecvt_mode mode = {})
    {
      read_utf8_bom(from, mode);
      while (from.size() && to.size())
        {
! 	const char* const first = from.next;
  	const char32_t codepoint = read_utf8_code_point(from, maxcode);
  	if (codepoint == incomplete_mb_character)
! 	  return codecvt_base::partial;
  	if (codepoint > maxcode)
  	  return codecvt_base::error;
  	if (!write_utf16_code_point(to, codepoint, mode))
  	  {
! 	    from.next = first;
  	    return codecvt_base::partial;
  	  }
        }
      return codecvt_base::ok;
    }
  
!   // utf16 -> utf8
    template<typename C>
    codecvt_base::result
    utf16_out(range<const C>& from, range<char>& to,
!             unsigned long maxcode = max_code_point, codecvt_mode mode = {})
    {
      if (!write_utf8_bom(to, mode))
        return codecvt_base::partial;
      while (from.size())
        {
! 	char32_t c = from.next[0];
  	int inc = 1;
  	if (is_high_surrogate(c))
  	  {
  	    if (from.size() < 2)
  	      return codecvt_base::ok; // stop converting at this point
  
! 	    const char32_t c2 = from.next[1];
  	    if (is_low_surrogate(c2))
  	      {
  		c = surrogate_pair_to_code_point(c, c2);
--- 495,579 ----
  	  return codecvt_base::partial;
  	if (codepoint > maxcode)
  	  return codecvt_base::error;
! 	to = codepoint;
        }
      return from.size() ? codecvt_base::partial : codecvt_base::ok;
    }
  
    // ucs4 -> utf16
    codecvt_base::result
!   ucs4_out(range<const char32_t>& from, range<char16_t, false>& to,
             unsigned long maxcode = max_code_point, codecvt_mode mode = {})
    {
      if (!write_utf16_bom(to, mode))
        return codecvt_base::partial;
      while (from.size())
        {
! 	const char32_t c = from[0];
  	if (c > maxcode)
  	  return codecvt_base::error;
  	if (!write_utf16_code_point(to, c, mode))
  	  return codecvt_base::partial;
! 	++from;
        }
      return codecvt_base::ok;
    }
  
!   // Flag indicating whether to process UTF-16 or UCS2
!   enum class surrogates { allowed, disallowed };
! 
!   // utf8 -> utf16 (or utf8 -> ucs2 if s == surrogates::disallowed)
    template<typename C>
    codecvt_base::result
    utf16_in(range<const char>& from, range<C>& to,
! 	   unsigned long maxcode = max_code_point, codecvt_mode mode = {},
! 	   surrogates s = surrogates::allowed)
    {
      read_utf8_bom(from, mode);
      while (from.size() && to.size())
        {
! 	auto orig = from;
  	const char32_t codepoint = read_utf8_code_point(from, maxcode);
  	if (codepoint == incomplete_mb_character)
! 	  {
! 	    if (s == surrogates::allowed)
! 	      return codecvt_base::partial;
! 	    else
! 	      return codecvt_base::error; // No surrogates in UCS2
! 	  }
  	if (codepoint > maxcode)
  	  return codecvt_base::error;
  	if (!write_utf16_code_point(to, codepoint, mode))
  	  {
! 	    from = orig; // rewind to previous position
  	    return codecvt_base::partial;
  	  }
        }
      return codecvt_base::ok;
    }
  
!   // utf16 -> utf8 (or ucs2 -> utf8 if s == surrogates::disallowed)
    template<typename C>
    codecvt_base::result
    utf16_out(range<const C>& from, range<char>& to,
! 	    unsigned long maxcode = max_code_point, codecvt_mode mode = {},
! 	    surrogates s = surrogates::allowed)
    {
      if (!write_utf8_bom(to, mode))
        return codecvt_base::partial;
      while (from.size())
        {
! 	char32_t c = from[0];
  	int inc = 1;
  	if (is_high_surrogate(c))
  	  {
+ 	    if (s == surrogates::disallowed)
+ 	      return codecvt_base::error; // No surrogates in UCS-2
+ 
  	    if (from.size() < 2)
  	      return codecvt_base::ok; // stop converting at this point
  
! 	    const char32_t c2 = from[1];
  	    if (is_low_surrogate(c2))
  	      {
  		c = surrogate_pair_to_code_point(c, c2);
*************** namespace
*** 469,475 ****
  	  return codecvt_base::error;
  	if (!write_utf8_code_point(to, c))
  	  return codecvt_base::partial;
! 	from.next += inc;
        }
      return codecvt_base::ok;
    }
--- 588,594 ----
  	  return codecvt_base::error;
  	if (!write_utf8_code_point(to, c))
  	  return codecvt_base::partial;
! 	from += inc;
        }
      return codecvt_base::ok;
    }
*************** namespace
*** 492,498 ****
  	++count;
        }
      if (count+1 == max) // take one more character if it fits in a single unit
!       read_utf8_code_point(from, std::max(max_single_utf16_unit, maxcode));
      return from.next;
    }
  
--- 611,617 ----
  	++count;
        }
      if (count+1 == max) // take one more character if it fits in a single unit
!       read_utf8_code_point(from, std::min(max_single_utf16_unit, maxcode));
      return from.next;
    }
  
*************** namespace
*** 501,507 ****
    ucs2_in(range<const char>& from, range<char16_t>& to,
  	  char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
!     return utf16_in(from, to, std::max(max_single_utf16_unit, maxcode), mode);
    }
  
    // ucs2 -> utf8
--- 620,628 ----
    ucs2_in(range<const char>& from, range<char16_t>& to,
  	  char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
!     // UCS-2 only supports characters in the BMP, i.e. one UTF-16 code unit:
!     maxcode = std::min(max_single_utf16_unit, maxcode);
!     return utf16_in(from, to, maxcode, mode, surrogates::disallowed);
    }
  
    // ucs2 -> utf8
*************** namespace
*** 509,569 ****
    ucs2_out(range<const char16_t>& from, range<char>& to,
  	   char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
!     return utf16_out(from, to, std::max(max_single_utf16_unit, maxcode), mode);
    }
  
    // ucs2 -> utf16
    codecvt_base::result
!   ucs2_out(range<const char16_t>& from, range<char16_t>& to,
  	   char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
      if (!write_utf16_bom(to, mode))
        return codecvt_base::partial;
      while (from.size() && to.size())
        {
! 	char16_t c = from.next[0];
  	if (is_high_surrogate(c))
  	  return codecvt_base::error;
  	if (c > maxcode)
  	  return codecvt_base::error;
! 	*to.next++ = adjust_byte_order(c, mode);
! 	++from.next;
        }
      return from.size() == 0 ? codecvt_base::ok : codecvt_base::partial;
    }
  
    // utf16 -> ucs2
    codecvt_base::result
!   ucs2_in(range<const char16_t>& from, range<char16_t>& to,
  	  char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
!     if (read_utf16_bom(from, mode) == little_endian)
!       mode = codecvt_mode(mode & little_endian);
!     maxcode = std::max(max_single_utf16_unit, maxcode);
      while (from.size() && to.size())
        {
  	const char32_t c = read_utf16_code_point(from, maxcode, mode);
  	if (c == incomplete_mb_character)
! 	  return codecvt_base::partial;
  	if (c > maxcode)
  	  return codecvt_base::error;
! 	*to.next++ = c;
        }
      return from.size() == 0 ? codecvt_base::ok : codecvt_base::partial;
    }
  
    const char16_t*
!   ucs2_span(const char16_t* begin, const char16_t* end, size_t max,
              char32_t maxcode, codecvt_mode mode)
    {
!     range<const char16_t> from{ begin, end };
!     if (read_utf16_bom(from, mode) == little_endian)
!       mode = codecvt_mode(mode & little_endian);
!     maxcode = std::max(max_single_utf16_unit, maxcode);
      char32_t c = 0;
      while (max-- && c <= maxcode)
        c = read_utf16_code_point(from, maxcode, mode);
!     return from.next;
    }
  
    const char*
--- 630,691 ----
    ucs2_out(range<const char16_t>& from, range<char>& to,
  	   char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
!     // UCS-2 only supports characters in the BMP, i.e. one UTF-16 code unit:
!     maxcode = std::min(max_single_utf16_unit, maxcode);
!     return utf16_out(from, to, maxcode, mode, surrogates::disallowed);
    }
  
    // ucs2 -> utf16
    codecvt_base::result
!   ucs2_out(range<const char16_t>& from, range<char16_t, false>& to,
  	   char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
      if (!write_utf16_bom(to, mode))
        return codecvt_base::partial;
      while (from.size() && to.size())
        {
! 	char16_t c = from[0];
  	if (is_high_surrogate(c))
  	  return codecvt_base::error;
  	if (c > maxcode)
  	  return codecvt_base::error;
! 	to = adjust_byte_order(c, mode);
! 	++from;
        }
      return from.size() == 0 ? codecvt_base::ok : codecvt_base::partial;
    }
  
    // utf16 -> ucs2
    codecvt_base::result
!   ucs2_in(range<const char16_t, false>& from, range<char16_t>& to,
  	  char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
!     read_utf16_bom(from, mode);
!     // UCS-2 only supports characters in the BMP, i.e. one UTF-16 code unit:
!     maxcode = std::min(max_single_utf16_unit, maxcode);
      while (from.size() && to.size())
        {
  	const char32_t c = read_utf16_code_point(from, maxcode, mode);
  	if (c == incomplete_mb_character)
! 	  return codecvt_base::error; // UCS-2 only supports single units.
  	if (c > maxcode)
  	  return codecvt_base::error;
! 	to = c;
        }
      return from.size() == 0 ? codecvt_base::ok : codecvt_base::partial;
    }
  
    const char16_t*
!   ucs2_span(range<const char16_t, false>& from, size_t max,
              char32_t maxcode, codecvt_mode mode)
    {
!     read_utf16_bom(from, mode);
!     // UCS-2 only supports characters in the BMP, i.e. one UTF-16 code unit:
!     maxcode = std::min(max_single_utf16_unit, maxcode);
      char32_t c = 0;
      while (max-- && c <= maxcode)
        c = read_utf16_code_point(from, maxcode, mode);
!     return reinterpret_cast<const char16_t*>(from.next);
    }
  
    const char*
*************** namespace
*** 572,578 ****
    {
      range<const char> from{ begin, end };
      read_utf8_bom(from, mode);
!     maxcode = std::max(max_single_utf16_unit, maxcode);
      char32_t c = 0;
      while (max-- && c <= maxcode)
        c = read_utf8_code_point(from, maxcode);
--- 694,701 ----
    {
      range<const char> from{ begin, end };
      read_utf8_bom(from, mode);
!     // UCS-2 only supports characters in the BMP, i.e. one UTF-16 code unit:
!     maxcode = std::min(max_single_utf16_unit, maxcode);
      char32_t c = 0;
      while (max-- && c <= maxcode)
        c = read_utf8_code_point(from, maxcode);
*************** namespace
*** 594,609 ****
  
    // return pos such that [begin,pos) is valid UCS-4 string no longer than max
    const char16_t*
!   ucs4_span(const char16_t* begin, const char16_t* end, size_t max,
              char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
!     range<const char16_t> from{ begin, end };
!     if (read_utf16_bom(from, mode) == little_endian)
!       mode = codecvt_mode(mode & little_endian);
      char32_t c = 0;
      while (max-- && c <= maxcode)
        c = read_utf16_code_point(from, maxcode, mode);
!     return from.next;
    }
  }
  
--- 717,730 ----
  
    // return pos such that [begin,pos) is valid UCS-4 string no longer than max
    const char16_t*
!   ucs4_span(range<const char16_t, false>& from, size_t max,
              char32_t maxcode = max_code_point, codecvt_mode mode = {})
    {
!     read_utf16_bom(from, mode);
      char32_t c = 0;
      while (max-- && c <= maxcode)
        c = read_utf16_code_point(from, maxcode, mode);
!     return reinterpret_cast<const char16_t*>(from.next);
    }
  }
  
*************** do_in(state_type&, const extern_type* __
*** 661,667 ****
  
  int
  codecvt<char16_t, char, mbstate_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  codecvt<char16_t, char, mbstate_t>::do_always_noconv() const throw()
--- 782,788 ----
  
  int
  codecvt<char16_t, char, mbstate_t>::do_encoding() const throw()
! { return 0; } // UTF-8 is not a fixed-width encoding
  
  bool
  codecvt<char16_t, char, mbstate_t>::do_always_noconv() const throw()
*************** do_length(state_type&, const extern_type
*** 679,687 ****
  int
  codecvt<char16_t, char, mbstate_t>::do_max_length() const throw()
  {
!   // Any valid UTF-8 sequence of 3 bytes fits in a single 16-bit code unit,
!   // whereas 4 byte sequences require two 16-bit code units.
!   return 3;
  }
  
  // Define members of codecvt<char32_t, char, mbstate_t> specialization.
--- 800,808 ----
  int
  codecvt<char16_t, char, mbstate_t>::do_max_length() const throw()
  {
!   // A single character (one or two UTF-16 code units) requires
!   // up to four UTF-8 code units.
!   return 4;
  }
  
  // Define members of codecvt<char32_t, char, mbstate_t> specialization.
*************** do_in(state_type&, const extern_type* __
*** 732,738 ****
  
  int
  codecvt<char32_t, char, mbstate_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  codecvt<char32_t, char, mbstate_t>::do_always_noconv() const throw()
--- 853,859 ----
  
  int
  codecvt<char32_t, char, mbstate_t>::do_encoding() const throw()
! { return 0; } // UTF-8 is not a fixed-width encoding
  
  bool
  codecvt<char32_t, char, mbstate_t>::do_always_noconv() const throw()
*************** do_length(state_type&, const extern_type
*** 749,755 ****
  
  int
  codecvt<char32_t, char, mbstate_t>::do_max_length() const throw()
! { return 4; }
  
  // Define members of codecvt_utf8<char16_t> base class implementation.
  // Converts from UTF-8 to UCS-2.
--- 870,880 ----
  
  int
  codecvt<char32_t, char, mbstate_t>::do_max_length() const throw()
! {
!   // A single character (one UTF-32 code unit) requires
!   // up to 4 UTF-8 code units.
!   return 4;
! }
  
  // Define members of codecvt_utf8<char16_t> base class implementation.
  // Converts from UTF-8 to UCS-2.
*************** do_in(state_type&, const extern_type* __
*** 801,807 ****
  
  int
  __codecvt_utf8_base<char16_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  __codecvt_utf8_base<char16_t>::do_always_noconv() const throw()
--- 926,932 ----
  
  int
  __codecvt_utf8_base<char16_t>::do_encoding() const throw()
! { return 0; } // UTF-8 is not a fixed-width encoding
  
  bool
  __codecvt_utf8_base<char16_t>::do_always_noconv() const throw()
*************** do_length(state_type&, const extern_type
*** 818,824 ****
  
  int
  __codecvt_utf8_base<char16_t>::do_max_length() const throw()
! { return 3; }
  
  // Define members of codecvt_utf8<char32_t> base class implementation.
  // Converts from UTF-8 to UTF-32 (aka UCS-4).
--- 943,956 ----
  
  int
  __codecvt_utf8_base<char16_t>::do_max_length() const throw()
! {
!   // A single UCS-2 character requires up to three UTF-8 code units.
!   // (UCS-2 cannot represent characters that use four UTF-8 code units).
!   int max = 3;
!   if (_M_mode & consume_header)
!     max += sizeof(utf8_bom);
!   return max;
! }
  
  // Define members of codecvt_utf8<char32_t> base class implementation.
  // Converts from UTF-8 to UTF-32 (aka UCS-4).
*************** do_in(state_type&, const extern_type* __
*** 866,872 ****
  
  int
  __codecvt_utf8_base<char32_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  __codecvt_utf8_base<char32_t>::do_always_noconv() const throw()
--- 998,1004 ----
  
  int
  __codecvt_utf8_base<char32_t>::do_encoding() const throw()
! { return 0; } // UTF-8 is not a fixed-width encoding
  
  bool
  __codecvt_utf8_base<char32_t>::do_always_noconv() const throw()
*************** do_length(state_type&, const extern_type
*** 883,891 ****
  
  int
  __codecvt_utf8_base<char32_t>::do_max_length() const throw()
! { return 4; }
  
  #ifdef _GLIBCXX_USE_WCHAR_T
  // Define members of codecvt_utf8<wchar_t> base class implementation.
  // Converts from UTF-8 to UCS-2 or UCS-4 depending on sizeof(wchar_t).
  
--- 1015,1036 ----
  
  int
  __codecvt_utf8_base<char32_t>::do_max_length() const throw()
! {
!   // A single UCS-4 character requires up to four UTF-8 code units.
!   int max = 4;
!   if (_M_mode & consume_header)
!     max += sizeof(utf8_bom);
!   return max;
! }
  
  #ifdef _GLIBCXX_USE_WCHAR_T
+ 
+ #if __SIZEOF_WCHAR_T__ == 2
+ static_assert(sizeof(wchar_t) == sizeof(char16_t), "");
+ #elif __SIZEOF_WCHAR_T__ == 4
+ static_assert(sizeof(wchar_t) == sizeof(char32_t), "");
+ #endif
+ 
  // Define members of codecvt_utf8<wchar_t> base class implementation.
  // Converts from UTF-8 to UCS-2 or UCS-4 depending on sizeof(wchar_t).
  
*************** do_in(state_type&, const extern_type* __
*** 958,964 ****
  
  int
  __codecvt_utf8_base<wchar_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  __codecvt_utf8_base<wchar_t>::do_always_noconv() const throw()
--- 1103,1109 ----
  
  int
  __codecvt_utf8_base<wchar_t>::do_encoding() const throw()
! { return 0; } // UTF-8 is not a fixed-width encoding
  
  bool
  __codecvt_utf8_base<wchar_t>::do_always_noconv() const throw()
*************** do_length(state_type&, const extern_type
*** 981,987 ****
  
  int
  __codecvt_utf8_base<wchar_t>::do_max_length() const throw()
! { return 4; }
  #endif
  
  // Define members of codecvt_utf16<char16_t> base class implementation.
--- 1126,1141 ----
  
  int
  __codecvt_utf8_base<wchar_t>::do_max_length() const throw()
! {
! #if __SIZEOF_WCHAR_T__ == 2
!   int max = 3; // See __codecvt_utf8_base<char16_t>::do_max_length()
! #else
!   int max = 4; // See __codecvt_utf8_base<char32_t>::do_max_length()
! #endif
!   if (_M_mode & consume_header)
!     max += sizeof(utf8_bom);
!   return max;
! }
  #endif
  
  // Define members of codecvt_utf16<char16_t> base class implementation.
*************** do_out(state_type&, const intern_type* _
*** 997,1006 ****
         extern_type*& __to_next) const
  {
    range<const char16_t> from{ __from, __from_end };
!   range<char16_t> to{
!     reinterpret_cast<char16_t*>(__to),
!     reinterpret_cast<char16_t*>(__to_end)
!   };
    auto res = ucs2_out(from, to, _M_maxcode, _M_mode);
    __from_next = from.next;
    __to_next = reinterpret_cast<char*>(to.next);
--- 1151,1157 ----
         extern_type*& __to_next) const
  {
    range<const char16_t> from{ __from, __from_end };
!   range<char16_t, false> to{ __to, __to_end };
    auto res = ucs2_out(from, to, _M_maxcode, _M_mode);
    __from_next = from.next;
    __to_next = reinterpret_cast<char*>(to.next);
*************** do_in(state_type&, const extern_type* __
*** 1023,1042 ****
        intern_type* __to, intern_type* __to_end,
        intern_type*& __to_next) const
  {
!   range<const char16_t> from{
!     reinterpret_cast<const char16_t*>(__from),
!     reinterpret_cast<const char16_t*>(__from_end)
!   };
    range<char16_t> to{ __to, __to_end };
    auto res = ucs2_in(from, to, _M_maxcode, _M_mode);
    __from_next = reinterpret_cast<const char*>(from.next);
    __to_next = to.next;
    return res;
  }
  
  int
  __codecvt_utf16_base<char16_t>::do_encoding() const throw()
! { return 1; }
  
  bool
  __codecvt_utf16_base<char16_t>::do_always_noconv() const throw()
--- 1174,1192 ----
        intern_type* __to, intern_type* __to_end,
        intern_type*& __to_next) const
  {
!   range<const char16_t, false> from{ __from, __from_end };
    range<char16_t> to{ __to, __to_end };
    auto res = ucs2_in(from, to, _M_maxcode, _M_mode);
    __from_next = reinterpret_cast<const char*>(from.next);
    __to_next = to.next;
+   if (res == codecvt_base::ok && __from_next != __from_end)
+     res = codecvt_base::error;
    return res;
  }
  
  int
  __codecvt_utf16_base<char16_t>::do_encoding() const throw()
! { return 0; } // UTF-16 is not a fixed-width encoding
  
  bool
  __codecvt_utf16_base<char16_t>::do_always_noconv() const throw()
*************** __codecvt_utf16_base<char16_t>::
*** 1047,1061 ****
  do_length(state_type&, const extern_type* __from,
  	  const extern_type* __end, size_t __max) const
  {
!   auto next = reinterpret_cast<const char16_t*>(__from);
!   next = ucs2_span(next, reinterpret_cast<const char16_t*>(__end), __max,
! 		   _M_maxcode, _M_mode);
    return reinterpret_cast<const char*>(next) - __from;
  }
  
  int
  __codecvt_utf16_base<char16_t>::do_max_length() const throw()
! { return 3; }
  
  // Define members of codecvt_utf16<char32_t> base class implementation.
  // Converts from UTF-16 to UTF-32 (aka UCS-4).
--- 1197,1217 ----
  do_length(state_type&, const extern_type* __from,
  	  const extern_type* __end, size_t __max) const
  {
!   range<const char16_t, false> from{ __from, __end };
!   const char16_t* next = ucs2_span(from, __max, _M_maxcode, _M_mode);
    return reinterpret_cast<const char*>(next) - __from;
  }
  
  int
  __codecvt_utf16_base<char16_t>::do_max_length() const throw()
! {
!   // A single UCS-2 character requires one UTF-16 code unit (so two chars).
!   // (UCS-2 cannot represent characters that use multiple UTF-16 code units).
!   int max = 2;
!   if (_M_mode & consume_header)
!     max += sizeof(utf16_bom);
!   return max;
! }
  
  // Define members of codecvt_utf16<char32_t> base class implementation.
  // Converts from UTF-16 to UTF-32 (aka UCS-4).
*************** do_out(state_type&, const intern_type* _
*** 1070,1079 ****
         extern_type*& __to_next) const
  {
    range<const char32_t> from{ __from, __from_end };
!   range<char16_t> to{
!     reinterpret_cast<char16_t*>(__to),
!     reinterpret_cast<char16_t*>(__to_end)
!   };
    auto res = ucs4_out(from, to, _M_maxcode, _M_mode);
    __from_next = from.next;
    __to_next = reinterpret_cast<char*>(to.next);
--- 1226,1232 ----
         extern_type*& __to_next) const
  {
    range<const char32_t> from{ __from, __from_end };
!   range<char16_t, false> to{ __to, __to_end };
    auto res = ucs4_out(from, to, _M_maxcode, _M_mode);
    __from_next = from.next;
    __to_next = reinterpret_cast<char*>(to.next);
*************** do_in(state_type&, const extern_type* __
*** 1096,1115 ****
        intern_type* __to, intern_type* __to_end,
        intern_type*& __to_next) const
  {
!   range<const char16_t> from{
!     reinterpret_cast<const char16_t*>(__from),
!     reinterpret_cast<const char16_t*>(__from_end)
!   };
    range<char32_t> to{ __to, __to_end };
    auto res = ucs4_in(from, to, _M_maxcode, _M_mode);
    __from_next = reinterpret_cast<const char*>(from.next);
    __to_next = to.next;
    return res;
  }
  
  int
  __codecvt_utf16_base<char32_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  __codecvt_utf16_base<char32_t>::do_always_noconv() const throw()
--- 1249,1267 ----
        intern_type* __to, intern_type* __to_end,
        intern_type*& __to_next) const
  {
!   range<const char16_t, false> from{ __from, __from_end };
    range<char32_t> to{ __to, __to_end };
    auto res = ucs4_in(from, to, _M_maxcode, _M_mode);
    __from_next = reinterpret_cast<const char*>(from.next);
    __to_next = to.next;
+   if (res == codecvt_base::ok && __from_next != __from_end)
+     res = codecvt_base::error;
    return res;
  }
  
  int
  __codecvt_utf16_base<char32_t>::do_encoding() const throw()
! { return 0; } // UTF-16 is not a fixed-width encoding
  
  bool
  __codecvt_utf16_base<char32_t>::do_always_noconv() const throw()
*************** __codecvt_utf16_base<char32_t>::
*** 1120,1134 ****
  do_length(state_type&, const extern_type* __from,
  	  const extern_type* __end, size_t __max) const
  {
!   auto next = reinterpret_cast<const char16_t*>(__from);
!   next = ucs4_span(next, reinterpret_cast<const char16_t*>(__end), __max,
! 		   _M_maxcode, _M_mode);
    return reinterpret_cast<const char*>(next) - __from;
  }
  
  int
  __codecvt_utf16_base<char32_t>::do_max_length() const throw()
! { return 4; }
  
  #ifdef _GLIBCXX_USE_WCHAR_T
  // Define members of codecvt_utf16<wchar_t> base class implementation.
--- 1272,1292 ----
  do_length(state_type&, const extern_type* __from,
  	  const extern_type* __end, size_t __max) const
  {
!   range<const char16_t, false> from{ __from, __end };
!   const char16_t* next = ucs4_span(from, __max, _M_maxcode, _M_mode);
    return reinterpret_cast<const char*>(next) - __from;
  }
  
  int
  __codecvt_utf16_base<char32_t>::do_max_length() const throw()
! {
!   // A single UCS-4 character requires one or two UTF-16 code units
!   // (so up to four chars).
!   int max = 4;
!   if (_M_mode & consume_header)
!     max += sizeof(utf16_bom);
!   return max;
! }
  
  #ifdef _GLIBCXX_USE_WCHAR_T
  // Define members of codecvt_utf16<wchar_t> base class implementation.
*************** do_out(state_type&, const intern_type* _
*** 1143,1166 ****
         extern_type* __to, extern_type* __to_end,
         extern_type*& __to_next) const
  {
!   range<char> to{ __to, __to_end };
  #if __SIZEOF_WCHAR_T__ == 2
    range<const char16_t> from{
      reinterpret_cast<const char16_t*>(__from),
!     reinterpret_cast<const char16_t*>(__from_end)
    };
    auto res = ucs2_out(from, to, _M_maxcode, _M_mode);
  #elif __SIZEOF_WCHAR_T__ == 4
    range<const char32_t> from{
      reinterpret_cast<const char32_t*>(__from),
!     reinterpret_cast<const char32_t*>(__from_end)
    };
    auto res = ucs4_out(from, to, _M_maxcode, _M_mode);
  #else
    return codecvt_base::error;
  #endif
    __from_next = reinterpret_cast<const wchar_t*>(from.next);
!   __to_next = to.next;
    return res;
  }
  
--- 1301,1324 ----
         extern_type* __to, extern_type* __to_end,
         extern_type*& __to_next) const
  {
!   range<char16_t, false> to{ __to, __to_end };
  #if __SIZEOF_WCHAR_T__ == 2
    range<const char16_t> from{
      reinterpret_cast<const char16_t*>(__from),
!     reinterpret_cast<const char16_t*>(__from_end),
    };
    auto res = ucs2_out(from, to, _M_maxcode, _M_mode);
  #elif __SIZEOF_WCHAR_T__ == 4
    range<const char32_t> from{
      reinterpret_cast<const char32_t*>(__from),
!     reinterpret_cast<const char32_t*>(__from_end),
    };
    auto res = ucs4_out(from, to, _M_maxcode, _M_mode);
  #else
    return codecvt_base::error;
  #endif
    __from_next = reinterpret_cast<const wchar_t*>(from.next);
!   __to_next = reinterpret_cast<char*>(to.next);
    return res;
  }
  
*************** do_in(state_type&, const extern_type* __
*** 1180,1209 ****
        intern_type* __to, intern_type* __to_end,
        intern_type*& __to_next) const
  {
!   range<const char> from{ __from, __from_end };
  #if __SIZEOF_WCHAR_T__ == 2
    range<char16_t> to{
      reinterpret_cast<char16_t*>(__to),
!     reinterpret_cast<char16_t*>(__to_end)
    };
    auto res = ucs2_in(from, to, _M_maxcode, _M_mode);
  #elif __SIZEOF_WCHAR_T__ == 4
    range<char32_t> to{
      reinterpret_cast<char32_t*>(__to),
!     reinterpret_cast<char32_t*>(__to_end)
    };
    auto res = ucs4_in(from, to, _M_maxcode, _M_mode);
  #else
    return codecvt_base::error;
  #endif
!   __from_next = from.next;
    __to_next = reinterpret_cast<wchar_t*>(to.next);
    return res;
  }
  
  int
  __codecvt_utf16_base<wchar_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  __codecvt_utf16_base<wchar_t>::do_always_noconv() const throw()
--- 1338,1369 ----
        intern_type* __to, intern_type* __to_end,
        intern_type*& __to_next) const
  {
!   range<const char16_t, false> from{ __from, __from_end };
  #if __SIZEOF_WCHAR_T__ == 2
    range<char16_t> to{
      reinterpret_cast<char16_t*>(__to),
!     reinterpret_cast<char16_t*>(__to_end),
    };
    auto res = ucs2_in(from, to, _M_maxcode, _M_mode);
  #elif __SIZEOF_WCHAR_T__ == 4
    range<char32_t> to{
      reinterpret_cast<char32_t*>(__to),
!     reinterpret_cast<char32_t*>(__to_end),
    };
    auto res = ucs4_in(from, to, _M_maxcode, _M_mode);
  #else
    return codecvt_base::error;
  #endif
!   __from_next = reinterpret_cast<const char*>(from.next);
    __to_next = reinterpret_cast<wchar_t*>(to.next);
+   if (res == codecvt_base::ok && __from_next != __from_end)
+     res = codecvt_base::error;
    return res;
  }
  
  int
  __codecvt_utf16_base<wchar_t>::do_encoding() const throw()
! { return 0; } // UTF-16 is not a fixed-width encoding
  
  bool
  __codecvt_utf16_base<wchar_t>::do_always_noconv() const throw()
*************** __codecvt_utf16_base<wchar_t>::
*** 1214,1233 ****
  do_length(state_type&, const extern_type* __from,
  	  const extern_type* __end, size_t __max) const
  {
!   auto next = reinterpret_cast<const char16_t*>(__from);
  #if __SIZEOF_WCHAR_T__ == 2
!   next = ucs2_span(next, reinterpret_cast<const char16_t*>(__end), __max,
! 		   _M_maxcode, _M_mode);
  #elif __SIZEOF_WCHAR_T__ == 4
!   next = ucs4_span(next, reinterpret_cast<const char16_t*>(__end), __max,
! 		   _M_maxcode, _M_mode);
  #endif
    return reinterpret_cast<const char*>(next) - __from;
  }
  
  int
  __codecvt_utf16_base<wchar_t>::do_max_length() const throw()
! { return 4; }
  #endif
  
  // Define members of codecvt_utf8_utf16<char16_t> base class implementation.
--- 1374,1400 ----
  do_length(state_type&, const extern_type* __from,
  	  const extern_type* __end, size_t __max) const
  {
!   range<const char16_t, false> from{ __from, __end };
  #if __SIZEOF_WCHAR_T__ == 2
!   const char16_t* next = ucs2_span(from, __max, _M_maxcode, _M_mode);
  #elif __SIZEOF_WCHAR_T__ == 4
!   const char16_t* next = ucs4_span(from, __max, _M_maxcode, _M_mode);
  #endif
    return reinterpret_cast<const char*>(next) - __from;
  }
  
  int
  __codecvt_utf16_base<wchar_t>::do_max_length() const throw()
! {
! #if __SIZEOF_WCHAR_T__ == 2
!   int max = 2; // See __codecvt_utf16_base<char16_t>::do_max_length()
! #else
!   int max = 4; // See __codecvt_utf16_base<char32_t>::do_max_length()
! #endif
!   if (_M_mode & consume_header)
!     max += sizeof(utf16_bom);
!   return max;
! }
  #endif
  
  // Define members of codecvt_utf8_utf16<char16_t> base class implementation.
*************** do_in(state_type&, const extern_type* __
*** 1280,1286 ****
  
  int
  __codecvt_utf8_utf16_base<char16_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  __codecvt_utf8_utf16_base<char16_t>::do_always_noconv() const throw()
--- 1447,1453 ----
  
  int
  __codecvt_utf8_utf16_base<char16_t>::do_encoding() const throw()
! { return 0; } // UTF-8 is not a fixed-width encoding
  
  bool
  __codecvt_utf8_utf16_base<char16_t>::do_always_noconv() const throw()
*************** do_length(state_type&, const extern_type
*** 1298,1306 ****
  int
  __codecvt_utf8_utf16_base<char16_t>::do_max_length() const throw()
  {
!   // Any valid UTF-8 sequence of 3 bytes fits in a single 16-bit code unit,
!   // whereas 4 byte sequences require two 16-bit code units.
!   return 3;
  }
  
  // Define members of codecvt_utf8_utf16<char32_t> base class implementation.
--- 1465,1476 ----
  int
  __codecvt_utf8_utf16_base<char16_t>::do_max_length() const throw()
  {
!   // A single character can be 1 or 2 UTF-16 code units,
!   // requiring up to 4 UTF-8 code units.
!   int max = 4;
!   if (_M_mode & consume_header)
!     max += sizeof(utf8_bom);
!   return max;
  }
  
  // Define members of codecvt_utf8_utf16<char32_t> base class implementation.
*************** do_in(state_type&, const extern_type* __
*** 1341,1347 ****
  {
    range<const char> from{ __from, __from_end };
    range<char32_t> to{ __to, __to_end };
!   auto res = utf16_in(from, to, _M_maxcode, _M_mode);
    __from_next = from.next;
    __to_next = to.next;
    return res;
--- 1511,1521 ----
  {
    range<const char> from{ __from, __from_end };
    range<char32_t> to{ __to, __to_end };
!   codecvt_mode mode = codecvt_mode(_M_mode & (consume_header|generate_header));
! #if __BYTE_ORDER__ != __ORDER_BIG_ENDIAN__
!   mode = codecvt_mode(mode | little_endian);
! #endif
!   auto res = utf16_in(from, to, _M_maxcode, mode);
    __from_next = from.next;
    __to_next = to.next;
    return res;
*************** do_in(state_type&, const extern_type* __
*** 1349,1355 ****
  
  int
  __codecvt_utf8_utf16_base<char32_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  __codecvt_utf8_utf16_base<char32_t>::do_always_noconv() const throw()
--- 1523,1529 ----
  
  int
  __codecvt_utf8_utf16_base<char32_t>::do_encoding() const throw()
! { return 0; } // UTF-8 is not a fixed-width encoding
  
  bool
  __codecvt_utf8_utf16_base<char32_t>::do_always_noconv() const throw()
*************** do_length(state_type&, const extern_type
*** 1367,1375 ****
  int
  __codecvt_utf8_utf16_base<char32_t>::do_max_length() const throw()
  {
!   // Any valid UTF-8 sequence of 3 bytes fits in a single 16-bit code unit,
!   // whereas 4 byte sequences require two 16-bit code units.
!   return 3;
  }
  
  #ifdef _GLIBCXX_USE_WCHAR_T
--- 1541,1552 ----
  int
  __codecvt_utf8_utf16_base<char32_t>::do_max_length() const throw()
  {
!   // A single character can be 1 or 2 UTF-16 code units,
!   // requiring up to 4 UTF-8 code units.
!   int max = 4;
!   if (_M_mode & consume_header)
!     max += sizeof(utf8_bom);
!   return max;
  }
  
  #ifdef _GLIBCXX_USE_WCHAR_T
*************** do_in(state_type&, const extern_type* __
*** 1411,1417 ****
  {
    range<const char> from{ __from, __from_end };
    range<wchar_t> to{ __to, __to_end };
!   auto res = utf16_in(from, to, _M_maxcode, _M_mode);
    __from_next = from.next;
    __to_next = to.next;
    return res;
--- 1588,1598 ----
  {
    range<const char> from{ __from, __from_end };
    range<wchar_t> to{ __to, __to_end };
!   codecvt_mode mode = codecvt_mode(_M_mode & (consume_header|generate_header));
! #if __BYTE_ORDER__ != __ORDER_BIG_ENDIAN__
!   mode = codecvt_mode(mode | little_endian);
! #endif
!   auto res = utf16_in(from, to, _M_maxcode, mode);
    __from_next = from.next;
    __to_next = to.next;
    return res;
*************** do_in(state_type&, const extern_type* __
*** 1419,1425 ****
  
  int
  __codecvt_utf8_utf16_base<wchar_t>::do_encoding() const throw()
! { return 0; }
  
  bool
  __codecvt_utf8_utf16_base<wchar_t>::do_always_noconv() const throw()
--- 1600,1606 ----
  
  int
  __codecvt_utf8_utf16_base<wchar_t>::do_encoding() const throw()
! { return 0; } // UTF-8 is not a fixed-width encoding
  
  bool
  __codecvt_utf8_utf16_base<wchar_t>::do_always_noconv() const throw()
*************** do_length(state_type&, const extern_type
*** 1437,1445 ****
  int
  __codecvt_utf8_utf16_base<wchar_t>::do_max_length() const throw()
  {
!   // Any valid UTF-8 sequence of 3 bytes fits in a single 16-bit code unit,
!   // whereas 4 byte sequences require two 16-bit code units.
!   return 3;
  }
  #endif
  
--- 1618,1629 ----
  int
  __codecvt_utf8_utf16_base<wchar_t>::do_max_length() const throw()
  {
!   // A single character can be 1 or 2 UTF-16 code units,
!   // requiring up to 4 UTF-8 code units.
!   int max = 4;
!   if (_M_mode & consume_header)
!     max += sizeof(utf8_bom);
!   return max;
  }
  #endif
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/src/c++11/cxx11-shim_facets.cc gcc-5.5.0/libstdc++-v3/src/c++11/cxx11-shim_facets.cc
*** gcc-5.4.0/libstdc++-v3/src/c++11/cxx11-shim_facets.cc	Thu Mar 19 19:31:48 2015
--- gcc-5.5.0/libstdc++-v3/src/c++11/cxx11-shim_facets.cc	Tue Feb 14 21:17:23 2017
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 226,233 ****
  
    namespace // unnamed
    {
      template<typename _CharT>
!       struct numpunct_shim : std::numpunct<_CharT>, facet::__shim
        {
  	typedef typename numpunct<_CharT>::__cache_type __cache_type;
  
--- 226,239 ----
  
    namespace // unnamed
    {
+     struct __shim_accessor : facet
+     {
+       using facet::__shim;  // Redeclare protected member as public.
+     };
+     using __shim = __shim_accessor::__shim;
+ 
      template<typename _CharT>
!       struct numpunct_shim : std::numpunct<_CharT>, __shim
        {
  	typedef typename numpunct<_CharT>::__cache_type __cache_type;
  
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 251,257 ****
        };
  
      template<typename _CharT>
!       struct collate_shim : std::collate<_CharT>, facet::__shim
        {
  	typedef basic_string<_CharT>	string_type;
  
--- 257,263 ----
        };
  
      template<typename _CharT>
!       struct collate_shim : std::collate<_CharT>, __shim
        {
  	typedef basic_string<_CharT>	string_type;
  
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 276,282 ****
        };
  
      template<typename _CharT>
!       struct time_get_shim : std::time_get<_CharT>, facet::__shim
        {
  	typedef typename std::time_get<_CharT>::iter_type iter_type;
  	typedef typename std::time_get<_CharT>::char_type char_type;
--- 282,288 ----
        };
  
      template<typename _CharT>
!       struct time_get_shim : std::time_get<_CharT>, __shim
        {
  	typedef typename std::time_get<_CharT>::iter_type iter_type;
  	typedef typename std::time_get<_CharT>::char_type char_type;
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 330,336 ****
        };
  
      template<typename _CharT, bool _Intl>
!       struct moneypunct_shim : std::moneypunct<_CharT, _Intl>, facet::__shim
        {
  	typedef typename moneypunct<_CharT, _Intl>::__cache_type __cache_type;
  
--- 336,342 ----
        };
  
      template<typename _CharT, bool _Intl>
!       struct moneypunct_shim : std::moneypunct<_CharT, _Intl>, __shim
        {
  	typedef typename moneypunct<_CharT, _Intl>::__cache_type __cache_type;
  
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 357,363 ****
        };
  
      template<typename _CharT>
!       struct money_get_shim : std::money_get<_CharT>, facet::__shim
        {
  	typedef typename std::money_get<_CharT>::iter_type iter_type;
  	typedef typename std::money_get<_CharT>::char_type char_type;
--- 363,369 ----
        };
  
      template<typename _CharT>
!       struct money_get_shim : std::money_get<_CharT>, __shim
        {
  	typedef typename std::money_get<_CharT>::iter_type iter_type;
  	typedef typename std::money_get<_CharT>::char_type char_type;
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 398,404 ****
        };
  
      template<typename _CharT>
!       struct money_put_shim : std::money_put<_CharT>, facet::__shim
        {
  	typedef typename std::money_put<_CharT>::iter_type iter_type;
  	typedef typename std::money_put<_CharT>::char_type char_type;
--- 404,410 ----
        };
  
      template<typename _CharT>
!       struct money_put_shim : std::money_put<_CharT>, __shim
        {
  	typedef typename std::money_put<_CharT>::iter_type iter_type;
  	typedef typename std::money_put<_CharT>::char_type char_type;
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 427,433 ****
        };
  
      template<typename _CharT>
!       struct messages_shim : std::messages<_CharT>, facet::__shim
        {
  	typedef messages_base::catalog  catalog;
  	typedef basic_string<_CharT>	string_type;
--- 433,439 ----
        };
  
      template<typename _CharT>
!       struct messages_shim : std::messages<_CharT>, __shim
        {
  	typedef messages_base::catalog  catalog;
  	typedef basic_string<_CharT>	string_type;
diff -Nrcpad gcc-5.4.0/libstdc++-v3/src/c++11/shared_ptr.cc gcc-5.5.0/libstdc++-v3/src/c++11/shared_ptr.cc
*** gcc-5.4.0/libstdc++-v3/src/c++11/shared_ptr.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/src/c++11/shared_ptr.cc	Tue Dec  6 11:56:56 2016
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 54,60 ****
      }
    }
  
!   _Sp_locker::_Sp_locker(const void* p)
    {
      if (__gthread_active_p())
        {
--- 54,60 ----
      }
    }
  
!   _Sp_locker::_Sp_locker(const void* p) noexcept
    {
      if (__gthread_active_p())
        {
*************** _GLIBCXX_BEGIN_NAMESPACE_VERSION
*** 65,71 ****
        _M_key1 = _M_key2 = invalid;
    }
  
!   _Sp_locker::_Sp_locker(const void* p1, const void* p2)
    {
      if (__gthread_active_p())
        {
--- 65,71 ----
        _M_key1 = _M_key2 = invalid;
    }
  
!   _Sp_locker::_Sp_locker(const void* p1, const void* p2) noexcept
    {
      if (__gthread_active_p())
        {
diff -Nrcpad gcc-5.4.0/libstdc++-v3/src/filesystem/Makefile.in gcc-5.5.0/libstdc++-v3/src/filesystem/Makefile.in
*** gcc-5.4.0/libstdc++-v3/src/filesystem/Makefile.in	Wed Oct  7 21:00:50 2015
--- gcc-5.5.0/libstdc++-v3/src/filesystem/Makefile.in	Mon Oct  3 14:42:06 2016
*************** WARN_CXXFLAGS = \
*** 352,358 ****
  
  
  # -I/-D flags to pass when compiling.
! AM_CPPFLAGS = $(GLIBCXX_INCLUDES) $(CPPFLAGS)
  toolexeclib_LTLIBRARIES = libstdc++fs.la
  headers = 
  @ENABLE_DUAL_ABI_FALSE@cxx11_abi_sources = 
--- 352,358 ----
  
  
  # -I/-D flags to pass when compiling.
! AM_CPPFLAGS = $(GLIBCXX_INCLUDES)
  toolexeclib_LTLIBRARIES = libstdc++fs.la
  headers = 
  @ENABLE_DUAL_ABI_FALSE@cxx11_abi_sources = 
diff -Nrcpad gcc-5.4.0/libstdc++-v3/src/filesystem/dir.cc gcc-5.5.0/libstdc++-v3/src/filesystem/dir.cc
*** gcc-5.4.0/libstdc++-v3/src/filesystem/dir.cc	Wed Oct  7 21:00:50 2015
--- gcc-5.5.0/libstdc++-v3/src/filesystem/dir.cc	Mon Dec 12 15:00:43 2016
*************** namespace
*** 79,86 ****
        return (obj & bits) != Bitmask::none;
      }
  
!   // Returns {dirp, p} on success, {nullptr, p} on error.
!   // If an ignored EACCES error occurs returns {}.
    inline fs::_Dir
    open_dir(const fs::path& p, fs::directory_options options,
  	   std::error_code* ec)
--- 79,85 ----
        return (obj & bits) != Bitmask::none;
      }
  
!   // Returns {dirp, p} on success, {} on error (whether ignored or not).
    inline fs::_Dir
    open_dir(const fs::path& p, fs::directory_options options,
  	   std::error_code* ec)
*************** namespace
*** 102,108 ****
              std::error_code(err, std::generic_category())));
  
      ec->assign(err, std::generic_category());
!     return {nullptr, p};
    }
  
    inline fs::file_type
--- 101,107 ----
              std::error_code(err, std::generic_category())));
  
      ec->assign(err, std::generic_category());
!     return {};
    }
  
    inline fs::file_type
*************** fs::_Dir::advance(error_code* ec, direct
*** 169,175 ****
  	      "directory iterator cannot advance",
  	      std::error_code(err, std::generic_category())));
        ec->assign(err, std::generic_category());
!       return true;
      }
    else
      {
--- 168,174 ----
  	      "directory iterator cannot advance",
  	      std::error_code(err, std::generic_category())));
        ec->assign(err, std::generic_category());
!       return false;
      }
    else
      {
*************** directory_iterator(const path& p, direct
*** 191,202 ****
        if (sp->advance(ec, options))
  	_M_dir.swap(sp);
      }
-   else if (!dir.path.empty())
-     {
-       // An error occurred, we need a non-empty shared_ptr so that *this will
-       // not compare equal to the end iterator.
-       _M_dir.reset(static_cast<fs::_Dir*>(nullptr));
-     }
  }
  
  const fs::directory_entry&
--- 190,195 ----
*************** recursive_directory_iterator(const path&
*** 270,279 ****
  	      std::error_code(err, std::generic_category())));
  
        ec->assign(err, std::generic_category());
- 
-       // An error occurred, we need a non-empty shared_ptr so that *this will
-       // not compare equal to the end iterator.
-       _M_dirs.reset(static_cast<_Dir_stack*>(nullptr));
      }
  }
  
--- 263,268 ----
*************** fs::recursive_directory_iterator::increm
*** 354,360 ****
      {
        _Dir dir = open_dir(top.entry.path(), _M_options, &ec);
        if (ec)
! 	return *this;
        if (dir.dirp)
  	  _M_dirs->push(std::move(dir));
      }
--- 343,352 ----
      {
        _Dir dir = open_dir(top.entry.path(), _M_options, &ec);
        if (ec)
! 	{
! 	  _M_dirs.reset();
! 	  return *this;
! 	}
        if (dir.dirp)
  	  _M_dirs->push(std::move(dir));
      }
*************** fs::recursive_directory_iterator::increm
*** 372,390 ****
  }
  
  void
! fs::recursive_directory_iterator::pop()
  {
    if (!_M_dirs)
!     _GLIBCXX_THROW_OR_ABORT(filesystem_error(
! 	  "cannot pop non-dereferenceable recursive directory iterator",
! 	  std::make_error_code(errc::invalid_argument)));
  
    do {
      _M_dirs->pop();
      if (_M_dirs->empty())
        {
  	_M_dirs.reset();
  	return;
        }
!   } while (!_M_dirs->top().advance(nullptr, _M_options));
  }
--- 364,396 ----
  }
  
  void
! fs::recursive_directory_iterator::pop(error_code& ec)
  {
    if (!_M_dirs)
!     {
!       ec = std::make_error_code(errc::invalid_argument);
!       return;
!     }
  
    do {
      _M_dirs->pop();
      if (_M_dirs->empty())
        {
  	_M_dirs.reset();
+ 	ec.clear();
  	return;
        }
!   } while (!_M_dirs->top().advance(&ec, _M_options));
! }
! 
! void
! fs::recursive_directory_iterator::pop()
! {
!   error_code ec;
!   pop(ec);
!   if (ec)
!     _GLIBCXX_THROW_OR_ABORT(filesystem_error(_M_dirs
! 	  ? "recursive directory iterator cannot pop"
! 	  : "non-dereferenceable recursive directory iterator cannot pop",
! 	  ec));
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/src/filesystem/ops.cc gcc-5.5.0/libstdc++-v3/src/filesystem/ops.cc
*** gcc-5.4.0/libstdc++-v3/src/filesystem/ops.cc	Wed May 25 15:43:12 2016
--- gcc-5.5.0/libstdc++-v3/src/filesystem/ops.cc	Mon Dec 12 15:00:43 2016
***************
*** 28,34 ****
--- 28,36 ----
  
  #include <experimental/filesystem>
  #include <functional>
+ #include <ostream>
  #include <stack>
+ #include <ext/stdio_filebuf.h>
  #include <stdlib.h>
  #include <stdio.h>
  #include <errno.h>
***************
*** 48,56 ****
  #endif
  #ifdef _GLIBCXX_USE_SENDFILE
  # include <sys/sendfile.h>
- #else
- # include <ext/stdio_filebuf.h>
- # include <ostream>
  #endif
  #if _GLIBCXX_HAVE_UTIME_H
  # include <utime.h>
--- 50,55 ----
*************** fs::canonical(const path& p, const path&
*** 143,149 ****
  #endif
  
    if (!exists(pa, ec))
!     return result;
    // else: we know there are (currently) no unresolvable symlink loops
  
    result = pa.root_path();
--- 142,152 ----
  #endif
  
    if (!exists(pa, ec))
!     {
!       if (!ec)
! 	ec = make_error_code(std::errc::no_such_file_or_directory);
!       return result;
!     }
    // else: we know there are (currently) no unresolvable symlink loops
  
    result = pa.root_path();
*************** namespace
*** 289,315 ****
    }
  
    inline fs::file_time_type
!   file_time(const stat_type& st) noexcept
    {
      using namespace std::chrono;
-     return fs::file_time_type{
  #ifdef _GLIBCXX_USE_ST_MTIM
! 	seconds{st.st_mtim.tv_sec} + nanoseconds{st.st_mtim.tv_nsec}
  #else
! 	seconds{st.st_mtime}
  #endif
-     };
-   }
  
!   // Returns true if the file descriptor was successfully closed,
!   // otherwise returns false and the reason will be in errno.
!   inline bool
!   close_fd(int fd)
!   {
!     while (::close(fd))
!       if (errno != EINTR)
! 	return false;
!     return true;
    }
  
    bool
--- 292,315 ----
    }
  
    inline fs::file_time_type
!   file_time(const stat_type& st, std::error_code& ec) noexcept
    {
      using namespace std::chrono;
  #ifdef _GLIBCXX_USE_ST_MTIM
!     time_t s = st.st_mtim.tv_sec;
!     nanoseconds ns{st.st_mtim.tv_nsec};
  #else
!     time_t s = st.st_mtime;
!     nanoseconds ns{};
  #endif
  
!     if (s >= (nanoseconds::max().count() / 1e9))
!       {
! 	ec = std::make_error_code(std::errc::value_too_large); // EOVERFLOW
! 	return fs::file_time_type::min();
!       }
!     ec.clear();
!     return fs::file_time_type{seconds{s} + ns};
    }
  
    bool
*************** namespace
*** 354,366 ****
  	  from_st = &st2;
        }
      f = make_file_status(*from_st);
  
      using opts = fs::copy_options;
  
      if (exists(t))
        {
! 	if (!is_other(t) && !is_other(f)
! 	    && to_st->st_dev == from_st->st_dev
  	    && to_st->st_ino == from_st->st_ino)
  	  {
  	    ec = std::make_error_code(std::errc::file_exists);
--- 354,378 ----
  	  from_st = &st2;
        }
      f = make_file_status(*from_st);
+     // _GLIBCXX_RESOLVE_LIB_DEFECTS
+     // 2712. copy_file() has a number of unspecified error conditions
+     if (!is_regular_file(f))
+       {
+ 	ec = std::make_error_code(std::errc::not_supported);
+ 	return false;
+       }
  
      using opts = fs::copy_options;
  
      if (exists(t))
        {
! 	if (!is_regular_file(t))
! 	  {
! 	    ec = std::make_error_code(std::errc::not_supported);
! 	    return false;
! 	  }
! 
! 	if (to_st->st_dev == from_st->st_dev
  	    && to_st->st_ino == from_st->st_ino)
  	  {
  	    ec = std::make_error_code(std::errc::file_exists);
*************** namespace
*** 374,395 ****
  	  }
  	else if (is_set(option, opts::update_existing))
  	  {
! 	    if (file_time(*from_st) <= file_time(*to_st))
! 	      {
! 		ec.clear();
! 		return false;
! 	      }
  	  }
  	else if (!is_set(option, opts::overwrite_existing))
  	  {
  	    ec = std::make_error_code(std::errc::file_exists);
  	    return false;
  	  }
        }
  
      struct CloseFD {
!       ~CloseFD() { if (fd != -1) close_fd(fd); }
!       bool close() { return close_fd(std::exchange(fd, -1)); }
        int fd;
      };
  
--- 386,412 ----
  	  }
  	else if (is_set(option, opts::update_existing))
  	  {
! 	    const auto from_mtime = file_time(*from_st, ec);
! 	    if (ec)
! 	      return false;
! 	    if ((from_mtime <= file_time(*to_st, ec)) || ec)
! 	      return false;
  	  }
  	else if (!is_set(option, opts::overwrite_existing))
  	  {
  	    ec = std::make_error_code(std::errc::file_exists);
  	    return false;
  	  }
+ 	else if (!is_regular_file(t))
+ 	  {
+ 	    ec = std::make_error_code(std::errc::not_supported);
+ 	    return false;
+ 	  }
        }
  
      struct CloseFD {
!       ~CloseFD() { if (fd != -1) ::close(fd); }
!       bool close() { return ::close(std::exchange(fd, -1)) == 0; }
        int fd;
      };
  
*************** namespace
*** 416,422 ****
  
  #ifdef _GLIBCXX_USE_FCHMOD
      if (::fchmod(out.fd, from_st->st_mode))
! #elif _GLIBCXX_USE_FCHMODAT
      if (::fchmodat(AT_FDCWD, to.c_str(), from_st->st_mode, 0))
  #else
      if (::chmod(to.c_str(), from_st->st_mode))
--- 433,439 ----
  
  #ifdef _GLIBCXX_USE_FCHMOD
      if (::fchmod(out.fd, from_st->st_mode))
! #elif defined _GLIBCXX_USE_FCHMODAT
      if (::fchmodat(AT_FDCWD, to.c_str(), from_st->st_mode, 0))
  #else
      if (::chmod(to.c_str(), from_st->st_mode))
*************** namespace
*** 427,464 ****
        }
  
  #ifdef _GLIBCXX_USE_SENDFILE
!     const auto n = ::sendfile(out.fd, in.fd, nullptr, from_st->st_size);
!     if (n != from_st->st_size)
        {
! 	ec.assign(errno, std::generic_category());
! 	return false;
        }
!     if (!out.close() || !in.close())
        {
  	ec.assign(errno, std::generic_category());
  	return false;
        }
! #else
!     __gnu_cxx::stdio_filebuf<char> sbin(in.fd, std::ios::in);
!     __gnu_cxx::stdio_filebuf<char> sbout(out.fd, std::ios::out);
!     if (sbin.is_open())
!       in.fd = -1;
!     if (sbout.is_open())
!       out.fd = -1;
!     if (from_st->st_size && !(std::ostream(&sbout) << &sbin))
!       {
! 	ec = std::make_error_code(std::errc::io_error);
! 	return false;
!       }
!     if (!sbout.close() || !sbin.close())
        {
  	ec.assign(errno, std::generic_category());
  	return false;
        }
- #endif
  
      ec.clear();
      return true;
    }
  }
  #endif
--- 444,490 ----
        }
  
  #ifdef _GLIBCXX_USE_SENDFILE
!     off_t offset = 0;
!     const auto n = ::sendfile(out.fd, in.fd, &offset, from_st->st_size);
!     if (n < 0 && (errno == ENOSYS || errno == EINVAL))
        {
! #endif
! 	__gnu_cxx::stdio_filebuf<char> sbin(in.fd, std::ios::in);
! 	__gnu_cxx::stdio_filebuf<char> sbout(out.fd, std::ios::out);
! 	if (sbin.is_open())
! 	  in.fd = -1;
! 	if (sbout.is_open())
! 	  out.fd = -1;
! 	if (from_st->st_size && !(std::ostream(&sbout) << &sbin))
! 	  {
! 	    ec = std::make_error_code(std::errc::io_error);
! 	    return false;
! 	  }
! 	if (!sbout.close() || !sbin.close())
! 	  {
! 	    ec.assign(errno, std::generic_category());
! 	    return false;
! 	  }
! 
! 	ec.clear();
! 	return true;
! 
! #ifdef _GLIBCXX_USE_SENDFILE
        }
!     if (n != from_st->st_size)
        {
  	ec.assign(errno, std::generic_category());
  	return false;
        }
!     if (!out.close() || !in.close())
        {
  	ec.assign(errno, std::generic_category());
  	return false;
        }
  
      ec.clear();
      return true;
+ #endif
    }
  }
  #endif
*************** fs::copy(const path& from, const path& t
*** 474,480 ****
  
    file_status f, t;
    stat_type from_st, to_st;
!   // N4099 doesn't check copy_symlinks here, but I think that's a defect.
    if (use_lstat || copy_symlinks
        ? ::lstat(from.c_str(), &from_st)
        : ::stat(from.c_str(), &from_st))
--- 500,507 ----
  
    file_status f, t;
    stat_type from_st, to_st;
!   // _GLIBCXX_RESOLVE_LIB_DEFECTS
!   // 2681. filesystem::copy() cannot copy symlinks
    if (use_lstat || copy_symlinks
        ? ::lstat(from.c_str(), &from_st)
        : ::stat(from.c_str(), &from_st))
*************** fs::copy(const path& from, const path& t
*** 541,546 ****
--- 568,577 ----
  	  do_copy_file(from, to, options, &from_st, ptr,  ec);
  	}
      }
+   // _GLIBCXX_RESOLVE_LIB_DEFECTS
+   // 2682. filesystem::copy() won't create a symlink to a directory
+   else if (is_directory(f) && create_symlinks)
+     ec = std::make_error_code(errc::is_a_directory);
    else if (is_directory(f) && (is_set(options, copy_options::recursive)
  			       || options == copy_options::none))
      {
*************** fs::copy(const path& from, const path& t
*** 553,559 ****
        for (const directory_entry& x : directory_iterator(from))
  	copy(x.path(), to/x.path().filename(), options, ec);
      }
!   // "Otherwise no effects." (should ec.clear() be called?)
  }
  
  bool
--- 584,593 ----
        for (const directory_entry& x : directory_iterator(from))
  	copy(x.path(), to/x.path().filename(), options, ec);
      }
!   // _GLIBCXX_RESOLVE_LIB_DEFECTS
!   // 2683. filesystem::copy() says "no effects"
!   else
!     ec.clear();
  }
  
  bool
*************** fs::equivalent(const path& p1, const pat
*** 890,896 ****
  {
    error_code ec;
    auto result = equivalent(p1, p2, ec);
!   if (ec.value())
      _GLIBCXX_THROW_OR_ABORT(filesystem_error("cannot check file equivalence",
  	  p1, p2, ec));
    return result;
--- 924,930 ----
  {
    error_code ec;
    auto result = equivalent(p1, p2, ec);
!   if (ec)
      _GLIBCXX_THROW_OR_ABORT(filesystem_error("cannot check file equivalence",
  	  p1, p2, ec));
    return result;
*************** bool
*** 900,924 ****
  fs::equivalent(const path& p1, const path& p2, error_code& ec) noexcept
  {
  #ifdef _GLIBCXX_HAVE_SYS_STAT_H
    stat_type st1, st2;
!   if (::stat(p1.c_str(), &st1) == 0 && ::stat(p2.c_str(), &st2) == 0)
      {
-       file_status s1 = make_file_status(st1);
-       file_status s2 = make_file_status(st2);
        if (is_other(s1) && is_other(s2))
  	{
  	  ec = std::make_error_code(std::errc::not_supported);
  	  return false;
  	}
        ec.clear();
        return st1.st_dev == st2.st_dev && st1.st_ino == st2.st_ino;
      }
!   else if (is_not_found_errno(errno))
!     {
!       ec = std::make_error_code(std::errc::no_such_file_or_directory);
!       return false;
!     }
!   ec.assign(errno, std::generic_category());
  #else
    ec = std::make_error_code(std::errc::not_supported);
  #endif
--- 934,975 ----
  fs::equivalent(const path& p1, const path& p2, error_code& ec) noexcept
  {
  #ifdef _GLIBCXX_HAVE_SYS_STAT_H
+   int err = 0;
+   file_status s1, s2;
    stat_type st1, st2;
!   if (::stat(p1.c_str(), &st1) == 0)
!     s1 = make_file_status(st1);
!   else if (is_not_found_errno(errno))
!     s1.type(file_type::not_found);
!   else
!     err = errno;
! 
!   if (::stat(p2.c_str(), &st2) == 0)
!     s2 = make_file_status(st2);
!   else if (is_not_found_errno(errno))
!     s2.type(file_type::not_found);
!   else
!     err = errno;
! 
!   if (exists(s1) && exists(s2))
      {
        if (is_other(s1) && is_other(s2))
  	{
  	  ec = std::make_error_code(std::errc::not_supported);
  	  return false;
  	}
        ec.clear();
+       if (is_other(s1) || is_other(s2))
+ 	return false;
        return st1.st_dev == st2.st_dev && st1.st_ino == st2.st_ino;
      }
!   else if (!exists(s1) && !exists(s2))
!     ec = std::make_error_code(std::errc::no_such_file_or_directory);
!   else if (err)
!     ec.assign(err, std::generic_category());
!   else
!     ec.clear();
!   return false;
  #else
    ec = std::make_error_code(std::errc::not_supported);
  #endif
*************** fs::hard_link_count(const path& p, error
*** 1000,1019 ****
  bool
  fs::is_empty(const path& p)
  {
!   return fs::is_directory(status(p))
!     ? fs::directory_iterator(p) == fs::directory_iterator()
!     : fs::file_size(p) == 0;
  }
  
  bool
  fs::is_empty(const path& p, error_code& ec) noexcept
  {
    auto s = status(p, ec);
!   if (ec.value())
      return false;
!   return fs::is_directory(s)
      ? fs::directory_iterator(p, ec) == fs::directory_iterator()
      : fs::file_size(p, ec) == 0;
  }
  
  fs::file_time_type
--- 1051,1074 ----
  bool
  fs::is_empty(const path& p)
  {
!   error_code ec;
!   bool e = is_empty(p, ec);
!   if (ec)
!     _GLIBCXX_THROW_OR_ABORT(filesystem_error("cannot check if file is empty",
! 					     p, ec));
!   return e;
  }
  
  bool
  fs::is_empty(const path& p, error_code& ec) noexcept
  {
    auto s = status(p, ec);
!   if (ec)
      return false;
!   bool empty = fs::is_directory(s)
      ? fs::directory_iterator(p, ec) == fs::directory_iterator()
      : fs::file_size(p, ec) == 0;
+   return ec ? false : empty;
  }
  
  fs::file_time_type
*************** fs::last_write_time(const path& p)
*** 1029,1035 ****
  fs::file_time_type
  fs::last_write_time(const path& p, error_code& ec) noexcept
  {
!   return do_stat(p, ec, [](const auto& st) { return file_time(st); },
  		 file_time_type::min());
  }
  
--- 1084,1090 ----
  fs::file_time_type
  fs::last_write_time(const path& p, error_code& ec) noexcept
  {
!   return do_stat(p, ec, [&ec](const auto& st) { return file_time(st, ec); },
  		 file_time_type::min());
  }
  
*************** fs::last_write_time(const path& p __attr
*** 1050,1055 ****
--- 1105,1115 ----
    auto s = chrono::duration_cast<chrono::seconds>(d);
  #if _GLIBCXX_USE_UTIMENSAT
    auto ns = chrono::duration_cast<chrono::nanoseconds>(d - s);
+   if (ns < ns.zero()) // tv_nsec must be non-negative and less than 10e9.
+     {
+       --s;
+       ns += chrono::seconds(1);
+     }
    struct ::timespec ts[2];
    ts[0].tv_sec = 0;
    ts[0].tv_nsec = UTIME_OMIT;
*************** fs::permissions(const path& p, perms prm
*** 1082,1095 ****
      _GLIBCXX_THROW_OR_ABORT(filesystem_error("cannot set permissions", p, ec));
  }
  
! void fs::permissions(const path& p, perms prms, error_code& ec) noexcept
  {
  #if _GLIBCXX_USE_FCHMODAT
!   if (::fchmodat(AT_FDCWD, p.c_str(), static_cast<mode_t>(prms), 0))
  #else
!   if (::chmod(p.c_str(), static_cast<mode_t>(prms)))
  #endif
!     ec.assign(errno, std::generic_category());
    else
      ec.clear();
  }
--- 1142,1188 ----
      _GLIBCXX_THROW_OR_ABORT(filesystem_error("cannot set permissions", p, ec));
  }
  
! void
! fs::permissions(const path& p, perms prms, error_code& ec) noexcept
  {
+   const bool add = is_set(prms, perms::add_perms);
+   const bool remove = is_set(prms, perms::remove_perms);
+   const bool nofollow = is_set(prms, perms::symlink_nofollow);
+   if (add && remove)
+     {
+       ec = std::make_error_code(std::errc::invalid_argument);
+       return;
+     }
+ 
+   prms &= perms::mask;
+ 
+   file_status st;
+   if (add || remove || nofollow)
+     {
+       st = nofollow ? symlink_status(p, ec) : status(p, ec);
+       if (ec)
+ 	return;
+       auto curr = st.permissions();
+       if (add)
+ 	prms |= curr;
+       else if (remove)
+ 	prms = curr & ~prms;
+     }
+ 
+   int err = 0;
  #if _GLIBCXX_USE_FCHMODAT
!   const int flag = (nofollow && is_symlink(st)) ? AT_SYMLINK_NOFOLLOW : 0;
!   if (::fchmodat(AT_FDCWD, p.c_str(), static_cast<mode_t>(prms), flag))
!     err = errno;
  #else
!   if (nofollow && is_symlink(st))
!     ec = std::make_error_code(std::errc::operation_not_supported);
!   else if (::chmod(p.c_str(), static_cast<mode_t>(prms)))
!     err = errno;
  #endif
! 
!   if (err)
!     ec.assign(err, std::generic_category());
    else
      ec.clear();
  }
*************** fs::path fs::read_symlink(const path& p,
*** 1120,1125 ****
--- 1213,1219 ----
        ec.assign(errno, std::generic_category());
        return {};
      }
+   ec.clear();
    return path{buf.data(), buf.data()+len};
  #else
    ec = std::make_error_code(std::errc::not_supported);
*************** fs::remove_all(const path& p, error_code
*** 1172,1178 ****
    uintmax_t count = 0;
    if (ec.value() == 0 && fs.type() == file_type::directory)
      for (directory_iterator d(p, ec), end; ec.value() == 0 && d != end; ++d)
!       count += fs::remove(d->path(), ec);
    if (ec.value())
      return -1;
    return fs::remove(p, ec) ? ++count : -1;  // fs:remove() calls ec.clear()
--- 1266,1272 ----
    uintmax_t count = 0;
    if (ec.value() == 0 && fs.type() == file_type::directory)
      for (directory_iterator d(p, ec), end; ec.value() == 0 && d != end; ++d)
!       count += fs::remove_all(d->path(), ec);
    if (ec.value())
      return -1;
    return fs::remove(p, ec) ? ++count : -1;  // fs:remove() calls ec.clear()
*************** fs::space(const path& p, error_code& ec)
*** 1260,1266 ****
  
  #ifdef _GLIBCXX_HAVE_SYS_STAT_H
  fs::file_status
! fs::status(const fs::path& p, std::error_code& ec) noexcept
  {
    file_status status;
    stat_type st;
--- 1354,1360 ----
  
  #ifdef _GLIBCXX_HAVE_SYS_STAT_H
  fs::file_status
! fs::status(const fs::path& p, error_code& ec) noexcept
  {
    file_status status;
    stat_type st;
*************** fs::status(const fs::path& p, std::error
*** 1270,1275 ****
--- 1364,1373 ----
        ec.assign(err, std::generic_category());
        if (is_not_found_errno(err))
  	status.type(file_type::not_found);
+ #ifdef EOVERFLOW
+       else if (err == EOVERFLOW)
+ 	status.type(file_type::unknown);
+ #endif
      }
    else
      {
*************** fs::path fs::temp_directory_path(error_c
*** 1368,1379 ****
    for (auto e = env; tmpdir == nullptr && *e != nullptr; ++e)
      tmpdir = ::getenv(*e);
    path p = tmpdir ? tmpdir : "/tmp";
!   if (exists(p) && is_directory(p))
      {
!       ec.clear();
!       return p;
      }
-   ec = std::make_error_code(std::errc::not_a_directory);
    return {};
  #endif
  }
--- 1466,1482 ----
    for (auto e = env; tmpdir == nullptr && *e != nullptr; ++e)
      tmpdir = ::getenv(*e);
    path p = tmpdir ? tmpdir : "/tmp";
!   auto st = status(p, ec);
!   if (!ec)
      {
!       if (is_directory(st))
! 	{
! 	  ec.clear();
! 	  return p;
! 	}
!       else
! 	ec = std::make_error_code(std::errc::not_a_directory);
      }
    return {};
  #endif
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/17_intro/names.cc gcc-5.5.0/libstdc++-v3/testsuite/17_intro/names.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/17_intro/names.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/17_intro/names.cc	Tue Mar 14 20:50:16 2017
***************
*** 0 ****
--- 1,110 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-do compile }
+ 
+ // Define macros for some common variables names that we must not use for
+ // naming variables, parameters etc. in the library.
+ #define tmp (
+ #define A (
+ #define B (
+ #define C (
+ #define D (
+ #define E (
+ #define F (
+ #define G (
+ #define H (
+ #define I (
+ #define J (
+ #define K (
+ #define L (
+ #define M (
+ #define N (
+ #define O (
+ #define P (
+ #define Q (
+ #define R (
+ #define S (
+ #define T (
+ #define U (
+ #define V (
+ #define W (
+ #define X (
+ #define Y (
+ #define Z (
+ #if __cplusplus >= 201103L
+ // <random> defines member functions called a() and b()
+ #else
+ #define a (
+ #define b (
+ #endif
+ // <queue> and <stack> defined data members called c
+ #define d (
+ #define e (
+ #define f (
+ #define g (
+ #if __cplusplus >= 201402L
+ // <chrono> defines operator ""h in C++14
+ // <complex> defines operator ""i in C++14
+ #else
+ #define h (
+ #define i (
+ #endif
+ #define j (
+ #if __cplusplus >= 201103L
+ // <random> defines member functions called k()
+ #else
+ #define k (
+ #endif
+ #define l (
+ #if __cplusplus >= 201103L
+ // <random> defines member functions called m() and n()
+ #else
+ #define m (
+ #define n (
+ #endif
+ #define o (
+ #if __cplusplus >= 201103L
+ // <random> defines member functions called p()
+ #else
+ #define p (
+ #endif
+ #define q (
+ #define r (
+ #if __cplusplus >= 201103L
+ // <random> defines member functions called s() and t()
+ // <chrono> and <string> define operator ""s in C++14
+ #else
+ #define s (
+ #define t (
+ #endif
+ #define u (
+ #define v (
+ #define w (
+ #define x (
+ #define y (
+ #define z (
+ 
+ #ifdef _AIX
+ // See https://gcc.gnu.org/ml/libstdc++/2017-03/msg00015.html
+ #undef f
+ #undef r
+ #undef x
+ #undef y
+ #endif
+ 
+ #include <bits/stdc++.h>
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/17_intro/using_namespace_std_exp_neg.cc gcc-5.5.0/libstdc++-v3/testsuite/17_intro/using_namespace_std_exp_neg.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/17_intro/using_namespace_std_exp_neg.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/17_intro/using_namespace_std_exp_neg.cc	Mon Oct  3 14:42:06 2016
***************
*** 0 ****
--- 1,66 ----
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ #include <algorithm>
+ #include <array>
+ #include <bitset>
+ #include <complex>
+ #include <deque>
+ #include <exception>
+ #include <fstream>
+ #include <functional>
+ #include <iomanip>
+ #include <ios>
+ #include <iosfwd>
+ #include <iostream>
+ #include <istream>
+ #include <iterator>
+ #include <limits>
+ #include <list>
+ #include <locale>
+ #include <map>
+ #include <memory>
+ #include <new>
+ #include <numeric>
+ #include <ostream>
+ #include <queue>
+ #include <random>
+ #include <regex>
+ #include <set>
+ #include <sstream>
+ #include <stack>
+ #include <stdexcept>
+ #include <streambuf>
+ #include <string>
+ #include <tuple>
+ #include <typeinfo>
+ #include <type_traits>
+ #include <unordered_map>
+ #include <unordered_set>
+ #include <utility>
+ #include <valarray>
+ #include <vector>
+ 
+ namespace gnu
+ {
+   using namespace std::experimental;  // { dg-error "is not a namespace-name" }
+ }
+ 
+ // { dg-error "expected namespace-name before" "" { target *-*-* } 63 }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/18_support/bad_exception/23591_thread-1.c gcc-5.5.0/libstdc++-v3/testsuite/18_support/bad_exception/23591_thread-1.c
*** gcc-5.4.0/libstdc++-v3/testsuite/18_support/bad_exception/23591_thread-1.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/18_support/bad_exception/23591_thread-1.c	Thu May 18 15:31:41 2017
***************
*** 1,4 ****
--- 1,5 ----
  // { dg-require-sharedlib "" }
+ // { dg-skip-if "invalid options for C" { *-*-* } { "-std=c++??" "-std=gnu++??" } }
  // { dg-options "-g -O2 -pthread -ldl -x c -fvtable-verify=none" { target *-*-linux* *-*-gnu* } }
  
  // Copyright (C) 2005-2015 Free Software Foundation, Inc.
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/18_support/headers/new/synopsis.cc gcc-5.5.0/libstdc++-v3/testsuite/18_support/headers/new/synopsis.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/18_support/headers/new/synopsis.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/18_support/headers/new/synopsis.cc	Mon Dec 12 16:36:30 2016
***************
*** 22,39 ****
  
  namespace std {
    class bad_alloc;
    struct nothrow_t;
    extern const nothrow_t nothrow;
    typedef void (*new_handler)();
-   new_handler set_new_handler(new_handler new_p) throw();
    new_handler get_new_handler() noexcept;
  }
  
! void* operator new(std::size_t size) throw(std::bad_alloc);
! void* operator new(std::size_t size, const std::nothrow_t&) throw();
  void  operator delete(void* ptr) throw();
  void  operator delete(void* ptr, const std::nothrow_t&) throw();
! void* operator new[](std::size_t size) throw(std::bad_alloc);
  void* operator new[](std::size_t size, const std::nothrow_t&) throw();
  void  operator delete[](void* ptr) throw();
  void  operator delete[](void* ptr, const std::nothrow_t&) throw();
--- 22,40 ----
  
  namespace std {
    class bad_alloc;
+   class bad_array_new_length;
    struct nothrow_t;
    extern const nothrow_t nothrow;
    typedef void (*new_handler)();
    new_handler get_new_handler() noexcept;
+   new_handler set_new_handler(new_handler new_p) noexcept;
  }
  
! void* operator new(std::size_t size);
! void* operator new(std::size_t size, const std::nothrow_t&) noexcept;
  void  operator delete(void* ptr) throw();
  void  operator delete(void* ptr, const std::nothrow_t&) throw();
! void* operator new[](std::size_t size);
  void* operator new[](std::size_t size, const std::nothrow_t&) throw();
  void  operator delete[](void* ptr) throw();
  void  operator delete[](void* ptr, const std::nothrow_t&) throw();
*************** void* operator new  (std::size_t size, v
*** 42,44 ****
--- 43,55 ----
  void* operator new[](std::size_t size, void* ptr) throw();
  void  operator delete  (void* ptr, void*) throw();
  void  operator delete[](void* ptr, void*) throw();
+ 
+ #if __cplusplus >= 201402L
+ // C++14 sized deallocation functions
+ void  operator delete(void* ptr, std::size_t size) noexcept;
+ void  operator delete(void* ptr, std::size_t size,
+                       const std::nothrow_t&) noexcept;
+ void  operator delete[](void* ptr, std::size_t size) noexcept;
+ void  operator delete[](void* ptr, std::size_t size,
+                         const std::nothrow_t&) noexcept;
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/18_support/headers/new/synopsis_cxx98.cc gcc-5.5.0/libstdc++-v3/testsuite/18_support/headers/new/synopsis_cxx98.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/18_support/headers/new/synopsis_cxx98.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/18_support/headers/new/synopsis_cxx98.cc	Mon Dec 12 16:36:30 2016
***************
*** 0 ****
--- 1,43 ----
+ // { dg-options "-std=gnu++98" }
+ // { dg-do compile }
+ 
+ // Copyright (C) 2007-2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ #include <new>
+ 
+ namespace std {
+   class bad_alloc;
+   struct nothrow_t;
+   extern const nothrow_t nothrow;
+   typedef void (*new_handler)();
+   new_handler set_new_handler(new_handler new_p) throw();
+ }
+ 
+ void* operator new(std::size_t size) throw(std::bad_alloc);
+ void* operator new(std::size_t size, const std::nothrow_t&) throw();
+ void  operator delete(void* ptr) throw();
+ void  operator delete(void* ptr, const std::nothrow_t&) throw();
+ void* operator new[](std::size_t size) throw(std::bad_alloc);
+ void* operator new[](std::size_t size, const std::nothrow_t&) throw();
+ void  operator delete[](void* ptr) throw();
+ void  operator delete[](void* ptr, const std::nothrow_t&) throw();
+ 
+ void* operator new  (std::size_t size, void* ptr) throw();
+ void* operator new[](std::size_t size, void* ptr) throw();
+ void  operator delete  (void* ptr, void*) throw();
+ void  operator delete[](void* ptr, void*) throw();
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/19_diagnostics/headers/system_error/errc_std_c++0x.cc gcc-5.5.0/libstdc++-v3/testsuite/19_diagnostics/headers/system_error/errc_std_c++0x.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/19_diagnostics/headers/system_error/errc_std_c++0x.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/19_diagnostics/headers/system_error/errc_std_c++0x.cc	Thu May 18 15:30:57 2017
*************** void test01()
*** 83,89 ****
--- 83,91 ----
    TEST_ERRC(no_message_available);
  #endif
  
+ #ifdef _GLIBCXX_HAVE_ENOMSG
    TEST_ERRC(no_message);
+ #endif
    TEST_ERRC(no_protocol_option);
    TEST_ERRC(no_space_on_device);
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/allocator/void.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/allocator/void.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/allocator/void.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/allocator/void.cc	Thu Oct 20 11:17:55 2016
***************
*** 0 ****
--- 1,40 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <memory>
+ #include <testsuite_hooks.h>
+ 
+ template class std::allocator<void>;
+ 
+ void
+ test01()
+ {
+   int i;
+   using alloc_type = std::allocator<void>;
+   alloc_type a;
+   std::allocator_traits<alloc_type>::construct(a, &i, 42);
+   VERIFY( i == 42 );
+   std::allocator_traits<alloc_type>::destroy(a, &i);
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/duration/cons/dr1177.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/duration/cons/dr1177.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/duration/cons/dr1177.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/duration/cons/dr1177.cc	Wed Sep 13 15:28:12 2017
***************
*** 0 ****
--- 1,42 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <chrono>
+ #include <type_traits>
+ 
+ using namespace std;
+ using namespace std::chrono;
+ 
+ // DR 1177
+ static_assert(is_constructible<duration<float>, duration<double>>{},
+     "can convert duration with one floating point rep to another");
+ static_assert(is_constructible<duration<float>, duration<int>>{},
+     "can convert duration with integral rep to one with floating point rep");
+ static_assert(!is_constructible<duration<int>, duration<float>>{},
+     "cannot convert duration with floating point rep to one with integral rep");
+ static_assert(is_constructible<duration<int>, duration<long>>{},
+     "can convert duration with one integral rep to another");
+ 
+ static_assert(!is_constructible<duration<int>, duration<int, ratio<2,3>>>{},
+     "cannot convert duration to one with different period");
+ static_assert(is_constructible<duration<float>, duration<int, ratio<2,3>>>{},
+     "unless it has a floating-point representation");
+ static_assert(is_constructible<duration<float>, duration<int, ratio<1,3>>>{},
+     "or a period that is an integral multiple of the original");
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/duration/literals/range.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/duration/literals/range.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/duration/literals/range.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/duration/literals/range.cc	Wed Sep 13 15:28:12 2017
*************** test01()
*** 27,31 ****
  
    // std::numeric_limits<int64_t>::max() == 9223372036854775807;
    auto h = 9223372036854775808h;
!   // { dg-error "cannot be represented" "" { target *-*-* } 796 }
  }
--- 27,31 ----
  
    // std::numeric_limits<int64_t>::max() == 9223372036854775807;
    auto h = 9223372036854775808h;
!   // { dg-error "cannot be represented" "" { target *-*-* } 798 }
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/77322.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/77322.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/77322.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/77322.cc	Mon Oct 17 17:03:31 2016
***************
*** 0 ****
--- 1,26 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <functional>
+ 
+ // PR libstdc++/77322
+ std::function<void()> f, g;
+ static_assert( noexcept(f.swap(g)), "member swap is noexcept" );
+ static_assert( noexcept(swap(f, g)), "non-member swap is noexcept" );
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/assign/move.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/assign/move.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/assign/move.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/assign/move.cc	Mon Sep  4 17:08:56 2017
*************** void test01()
*** 40,50 ****
    fo2 = (std::move(fo));
    VERIFY( static_cast<bool>(fo2) );
    VERIFY( fo2() == 2 );
  }
  
  int main()
  {
    test01();
- 
-   return 0;
  }
--- 40,51 ----
    fo2 = (std::move(fo));
    VERIFY( static_cast<bool>(fo2) );
    VERIFY( fo2() == 2 );
+ 
+   static_assert(std::is_nothrow_move_assignable<function>::value,
+ 		"PR libstdc++/81017");
  }
  
  int main()
  {
    test01();
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/cons/57465.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/cons/57465.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/cons/57465.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/cons/57465.cc	Sat Aug  6 12:21:42 2016
***************
*** 15,31 ****
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
- // libstdc++/57465
- 
  // { dg-options "-std=gnu++11" }
  
  #include <functional>
  #include <testsuite_hooks.h>
  
! int main()
  {
    using F = void();
    F* f = nullptr;
    std::function<F> x(f);
!   VERIFY( !x );
  }
--- 15,47 ----
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
  // { dg-options "-std=gnu++11" }
  
  #include <functional>
  #include <testsuite_hooks.h>
  
! void test01()
  {
    using F = void();
    F* f = nullptr;
    std::function<F> x(f);
!   VERIFY( !x ); // libstdc++/57465
! }
! 
! void test02()
! {
!   struct X { };
!   int (X::*mf)() = nullptr;
!   std::function<int(X&)> f = mf;
!   VERIFY( !f ); // libstdc++/69243
! 
!   int X::*mp = nullptr;
!   f = mp;
!   VERIFY( !f );
! }
! 
! int main()
! {
!   test01();
!   test02();
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/cons/72820.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/cons/72820.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/cons/72820.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/cons/72820.cc	Mon Oct 17 17:03:19 2016
***************
*** 0 ****
--- 1,28 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <functional>
+ 
+ struct foo {
+   void operator()() { }
+   static void* operator new(std::size_t, void* p);
+ };
+ 
+ std::function<void()> f = foo{};
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/cons/move.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/cons/move.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/cons/move.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/cons/move.cc	Mon Sep  4 17:08:56 2017
*************** void test01()
*** 38,48 ****
    function fo2(std::move(fo));
    VERIFY( static_cast<bool>(fo2) );
    VERIFY( fo2() == 2 );
  }
  
  int main()
  {
    test01();
- 
-   return 0;
  }
--- 38,49 ----
    function fo2(std::move(fo));
    VERIFY( static_cast<bool>(fo2) );
    VERIFY( fo2() == 2 );
+ 
+   static_assert(std::is_nothrow_move_constructible<function>::value,
+ 		"PR libstdc++/81017");
  }
  
  int main()
  {
    test01();
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/cons/refqual.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/cons/refqual.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/function/cons/refqual.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/function/cons/refqual.cc	Sat Aug  6 12:21:55 2016
***************
*** 0 ****
--- 1,31 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <functional>
+ 
+ struct F {
+   void operator()() && { }
+   int operator()() & { return 0; }
+ };
+ 
+ int main() {
+   F f;
+   std::function<int()> ff{f};
+   return ff();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/owner_less/noexcept.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/owner_less/noexcept.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/owner_less/noexcept.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/owner_less/noexcept.cc	Mon Sep  4 17:08:51 2017
***************
*** 0 ****
--- 1,32 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <memory>
+ 
+ const std::shared_ptr<int> si;
+ const std::weak_ptr<int> wi;
+ const std::owner_less<std::shared_ptr<int>> osi;
+ static_assert( noexcept(osi(si, si)), "" );
+ static_assert( noexcept(osi(si, wi)), "" );
+ static_assert( noexcept(osi(wi, si)), "" );
+ const std::owner_less<std::weak_ptr<int>> owi;
+ static_assert( noexcept(owi(wi, wi)), "" );
+ static_assert( noexcept(owi(si, wi)), "" );
+ static_assert( noexcept(owi(wi, si)), "" );
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/reference_wrapper/80504.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/reference_wrapper/80504.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/reference_wrapper/80504.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/reference_wrapper/80504.cc	Wed Sep 13 15:28:18 2017
***************
*** 0 ****
--- 1,35 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <functional>
+ 
+ namespace X {
+   struct Y { };
+   template<typename T> void ref(T) { }
+   template<typename T> void cref(T) { }
+ }
+ 
+ int main()
+ {
+   X::Y i;
+   std::reference_wrapper<X::Y> r(i);
+   ref(r);
+   cref(r);
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/reference_wrapper/invoke-2.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/reference_wrapper/invoke-2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/reference_wrapper/invoke-2.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/reference_wrapper/invoke-2.cc	Mon Oct 17 17:03:25 2016
***************
*** 1,5 ****
  // { dg-options "-std=gnu++11" }
! // { dg-do compile}
  // Copyright (C) 2011-2015 Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,5 ----
  // { dg-options "-std=gnu++11" }
! // { dg-do compile }
  // Copyright (C) 2011-2015 Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/reference_wrapper/invoke.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/reference_wrapper/invoke.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/reference_wrapper/invoke.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/reference_wrapper/invoke.cc	Thu May 18 15:31:17 2017
*************** void test01()
*** 75,82 ****
    int (::X::* p_foo_c)(float) const = &::X::foo_c;
    int (::X::* p_foo_v)(float) volatile = &::X::foo_v;
    int (::X::* p_foo_cv)(float) const volatile = &::X::foo_cv;
!   int (::X::* p_foo_varargs)(float, ...) __attribute__((unused))
!     = &::X::foo_varargs;
    int ::X::* p_bar = &::X::bar;
  
    const float pi = 3.14;
--- 75,81 ----
    int (::X::* p_foo_c)(float) const = &::X::foo_c;
    int (::X::* p_foo_v)(float) volatile = &::X::foo_v;
    int (::X::* p_foo_cv)(float) const volatile = &::X::foo_cv;
!   int (::X::* p_foo_varargs)(float, ...) = &::X::foo_varargs;
    int ::X::* p_bar = &::X::bar;
  
    const float pi = 3.14;
*************** void test01()
*** 98,107 ****
    VERIFY(ref(p_foo_v)(xp, pi) == 3);
    VERIFY(ref(p_foo_cv)(x, pi) == 3);
    VERIFY(ref(p_foo_cv)(xp, pi) == 3);
!   // VERIFY(ref(p_foo_varargs)(x, pi) == 3);
!   // VERIFY(ref(p_foo_varargs)(xp, pi, 1, 1) == 3);
!   // VERIFY(ref(p_foo_varargs)(x, pi, 1, 1) == 3);
!   // VERIFY(ref(p_foo_varargs)(xp, pi) == 3);
  
    // Member data pointers
    VERIFY(ref(p_bar)(x) == 17);
--- 97,106 ----
    VERIFY(ref(p_foo_v)(xp, pi) == 3);
    VERIFY(ref(p_foo_cv)(x, pi) == 3);
    VERIFY(ref(p_foo_cv)(xp, pi) == 3);
!   VERIFY(ref(p_foo_varargs)(x, pi) == 3);
!   VERIFY(ref(p_foo_varargs)(xp, pi, 1, 1) == 3);
!   VERIFY(ref(p_foo_varargs)(x, pi, 1, 1) == 3);
!   VERIFY(ref(p_foo_varargs)(xp, pi) == 3);
  
    // Member data pointers
    VERIFY(ref(p_bar)(x) == 17);
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/scoped_allocator/3.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/scoped_allocator/3.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/scoped_allocator/3.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/scoped_allocator/3.cc	Fri Sep  1 12:15:44 2017
***************
*** 0 ****
--- 1,67 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-do compile }
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <scoped_allocator>
+ #include <testsuite_allocator.h>
+ 
+ template<typename T>
+ struct alloc
+ {
+   using value_type = T;
+   alloc() = default;
+   template<typename U>
+     alloc(alloc<U>) { }
+   T* allocate(std::size_t);
+   void deallocate(T*, std::size_t);
+ };
+ 
+ template<typename T, typename U>
+   bool operator==(alloc<T>, alloc<U>) { return true; }
+ 
+ template<typename T, typename U>
+   bool operator!=(alloc<T>, alloc<U>) { return false; }
+ 
+ using scoped = std::scoped_allocator_adaptor<alloc<int>>;
+ using other_alloc = __gnu_test::SimpleAllocator<int>;
+ using other_scoped = std::scoped_allocator_adaptor<other_alloc>;
+ 
+ using std::is_constructible;
+ 
+ static_assert( is_constructible<scoped, const scoped&>::value,
+     "is_constructible<scoped, const scoped&>");
+ static_assert( is_constructible<scoped, scoped>::value,
+     "is_constructible<scoped, scoped>");
+ static_assert( is_constructible<scoped, const alloc<int>&>::value,
+     "is_constructible<scoped, const outer_allocator_type&>");
+ static_assert( is_constructible<scoped, alloc<int>>::value,
+     "is_constructible<scoped, outer_allocator_type>");
+ static_assert( is_constructible<scoped, const alloc<long>&>::value,
+     "is_constructible<scoped, const outer_allocator_type::rebind<U>::type&>");
+ static_assert( is_constructible<scoped, alloc<long>>::value,
+     "is_constructible<scoped, outer_allocator_type::rebind<U>::type>");
+ 
+ static_assert( !is_constructible<scoped, const other_alloc&>::value,
+     "!is_constructible<scoped, const other_alloc&>");
+ static_assert( !is_constructible<scoped, other_alloc>::value,
+     "!is_constructible<scoped, other_alloc>");
+ static_assert( !is_constructible<scoped, const other_scoped&>::value,
+     "!is_constructible<scoped, const other_scoped&>");
+ static_assert( !is_constructible<scoped, other_scoped>::value,
+     "!is_constructible<scoped, other_scoped>");
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/scoped_allocator/outermost.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/scoped_allocator/outermost.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/scoped_allocator/outermost.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/scoped_allocator/outermost.cc	Fri Sep  1 12:15:44 2017
***************
*** 0 ****
--- 1,92 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-do compile }
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <scoped_allocator>
+ 
+ template<typename T>
+ struct alloc
+ {
+   using value_type = T;
+   alloc() = default;
+   template<typename U>
+     alloc(alloc<U>) { }
+   T* allocate(std::size_t);
+   void deallocate(T*, std::size_t);
+ };
+ 
+ template<typename T, typename U>
+   bool operator==(alloc<T>, alloc<U>) { return true; }
+ 
+ template<typename T, typename U>
+   bool operator!=(alloc<T>, alloc<U>) { return false; }
+ 
+ struct X
+ {
+   using allocator_type = alloc<int>;
+   X(const allocator_type&);
+ };
+ 
+ template<typename A>
+ struct nested_alloc : A
+ {
+   nested_alloc() = default;
+   template<typename U>
+     nested_alloc(nested_alloc<U>) { }
+ 
+   A& outer_allocator() { return *this; }
+ 
+   template<typename U, typename... Args>
+     void construct(U*, Args&&...)
+     {
+       static_assert(!std::is_same<U, X>::value,
+           "OUTERMOST should recurse and use alloc<int> to construct X");
+     }
+ };
+ 
+ template<typename T, typename U>
+   bool operator==(nested_alloc<T> l, nested_alloc<U> r)
+   { return l.outer_allocator() == r.outer_allocator(); }
+ 
+ template<typename T, typename U>
+   bool operator!=(nested_alloc<T> l, nested_alloc<U> r)
+   { return !(l == r); }
+ 
+ template<typename A>
+   using scoped_alloc = std::scoped_allocator_adaptor<A>;
+ 
+ void
+ test01()
+ {
+   scoped_alloc<nested_alloc<alloc<int>>> a;
+   alignas(X) char buf[sizeof(X)];
+   X* p = (X*)buf;
+   // Test that OUTERMOST is recursive and doesn't just unwrap one level:
+   a.construct(p);
+ }
+ 
+ void
+ test02()
+ {
+   scoped_alloc<scoped_alloc<nested_alloc<alloc<int>>>> a;
+   alignas(X) char buf[sizeof(X)];
+   X* p = (X*)buf;
+   // Test that OUTERMOST is recursive and doesn't just unwrap one level:
+   a.construct(p);
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/shared_ptr/observers/owner_before.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/shared_ptr/observers/owner_before.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/shared_ptr/observers/owner_before.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/shared_ptr/observers/owner_before.cc	Mon Sep  4 17:08:51 2017
*************** test02()
*** 71,76 ****
--- 71,82 ----
    VERIFY( !a1.owner_before(w1) && !w1.owner_before(a1) );
    std::weak_ptr<A> w2(a2);
    VERIFY( !b1.owner_before(w2) && !w2.owner_before(b1) );
+ 
+   static_assert( noexcept(a1.owner_before(a0)), "" );
+   static_assert( noexcept(a1.owner_before(b1)), "" );
+   static_assert( noexcept(b1.owner_before(a1)), "" );
+   static_assert( noexcept(a1.owner_before(w1)), "" );
+   static_assert( noexcept(b1.owner_before(w1)), "" );
  }
  
  // Aliasing
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/time_point/cons/81468.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/time_point/cons/81468.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/time_point/cons/81468.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/time_point/cons/81468.cc	Wed Sep 13 15:28:12 2017
***************
*** 0 ****
--- 1,35 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <chrono>
+ #include <type_traits>
+ 
+ using namespace std;
+ using namespace std::chrono;
+ 
+ template <class Duration>
+     using sys_time = time_point<system_clock, Duration>;
+ 
+ static_assert(is_constructible<sys_time<milliseconds>, sys_time<seconds>>{},
+     "Can construct time_point from one with lower precision duration");
+ 
+ // PR libstdc++/81468 - DR 1177
+ static_assert(!is_constructible<sys_time<seconds>, sys_time<milliseconds>>{},
+     "Cannot construct time_point from one with higher precision duration");
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/tuple/cons/allocator_with_any.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/tuple/cons/allocator_with_any.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/tuple/cons/allocator_with_any.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/tuple/cons/allocator_with_any.cc	Mon Dec 19 15:22:05 2016
***************
*** 0 ****
--- 1,42 ----
+ // { dg-do run }
+ // { dg-options "-std=gnu++14" }
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ 
+ // NOTE: This makes use of the fact that we know how moveable
+ // is implemented on tuple.  If the implementation changed
+ // this test may begin to fail.
+ 
+ #include <tuple>
+ #include <experimental/any>
+ #include <testsuite_hooks.h>
+ 
+ using std::experimental::any;
+ 
+ void test01()
+ {
+     std::tuple<any, any> t(std::allocator_arg,
+ 			   std::allocator<any>{});
+     VERIFY(std::get<0>(t).empty());
+     VERIFY(std::get<1>(t).empty());
+ }
+ 
+ int main()
+ {
+     test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/unique_ptr/assign/48635_neg.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/unique_ptr/assign/48635_neg.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/unique_ptr/assign/48635_neg.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/unique_ptr/assign/48635_neg.cc	Wed Oct 19 10:36:24 2016
*************** void f()
*** 41,50 ****
    std::unique_ptr<int, B&> ub(nullptr, b);
    std::unique_ptr<int, D&> ud(nullptr, d);
    ub = std::move(ud);
! // { dg-error "use of deleted function" "" { target *-*-* } 272 }
  
    std::unique_ptr<int[], B&> uba(nullptr, b);
    std::unique_ptr<int[], D&> uda(nullptr, d);
    uba = std::move(uda);
! // { dg-error "use of deleted function" "" { target *-*-* } 517 }
  }
--- 41,50 ----
    std::unique_ptr<int, B&> ub(nullptr, b);
    std::unique_ptr<int, D&> ud(nullptr, d);
    ub = std::move(ud);
! // { dg-error "use of deleted function" "" { target *-*-* } 275 }
  
    std::unique_ptr<int[], B&> uba(nullptr, b);
    std::unique_ptr<int[], D&> uda(nullptr, d);
    uba = std::move(uda);
! // { dg-error "use of deleted function" "" { target *-*-* } 520 }
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/unique_ptr/cons/77990.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/unique_ptr/cons/77990.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/unique_ptr/cons/77990.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/unique_ptr/cons/77990.cc	Wed Oct 19 10:36:24 2016
***************
*** 0 ****
--- 1,28 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <memory>
+ 
+ struct D {
+   D() = default;
+   D(const D&) = delete;
+   void operator()(int*);
+ };
+ std::unique_ptr<int, D> p((int*)nullptr);  // PR libstdc++/77990
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/20_util/weak_ptr/observers/owner_before.cc gcc-5.5.0/libstdc++-v3/testsuite/20_util/weak_ptr/observers/owner_before.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/20_util/weak_ptr/observers/owner_before.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/20_util/weak_ptr/observers/owner_before.cc	Mon Sep  4 17:08:51 2017
*************** struct B { };
*** 27,33 ****
  
  // 20.6.6.3.5 weak_ptr observers [util.smartptr.weak.obs]
  
! int
  test01()
  {
    bool test __attribute__((unused)) = true;
--- 27,33 ----
  
  // 20.6.6.3.5 weak_ptr observers [util.smartptr.weak.obs]
  
! void
  test01()
  {
    bool test __attribute__((unused)) = true;
*************** test01()
*** 40,50 ****
    std::shared_ptr<B> p3;
    VERIFY( !p1.owner_before(p3) && !p3.owner_before(p1) );
  
!   return 0;
  }
  
  
! int
  test02()
  {
    bool test __attribute__((unused)) = true;
--- 40,53 ----
    std::shared_ptr<B> p3;
    VERIFY( !p1.owner_before(p3) && !p3.owner_before(p1) );
  
!   static_assert( noexcept(p1.owner_before(p1)), "" );
!   static_assert( noexcept(p1.owner_before(p2)), "" );
!   static_assert( noexcept(p1.owner_before(p3)), "" );
!   static_assert( noexcept(p2.owner_before(p1)), "" );
  }
  
  
! void
  test02()
  {
    bool test __attribute__((unused)) = true;
*************** test02()
*** 64,71 ****
  
    std::shared_ptr<B> b1(new B);
    VERIFY( w1.owner_before(b1) || b1.owner_before(w1) );
- 
-   return 0;
  }
  
  int 
--- 67,72 ----
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy.cc	Tue Jul 12 10:56:11 2016
***************
*** 0 ****
--- 1,97 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = char;
+ const C c = 'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(0 == v2.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v3(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(0 == v3.get_allocator().get_personality());
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v3(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v3.get_allocator().get_personality());
+ }
+ 
+ void test03()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(v1, alloc_type(2));
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v3(v1, alloc_type(3));
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(3 == v3.get_allocator().get_personality());
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   test03();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy_assign.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy_assign.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy_assign.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/copy_assign.cc	Wed Feb  1 12:18:43 2017
***************
*** 0 ****
--- 1,149 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+ #include <ext/throw_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = char;
+ const C c = 'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(alloc_type(2));
+   v2.assign(1, c);
+   v2 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+ 
+   v1.assign(1, c);
+   test_type v3(alloc_type(3));
+   v3.assign(100, c);
+   v3 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(3 == v3.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v4(alloc_type(4));
+   v4.assign(1, c);
+   v4 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(4 == v4.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   v5 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(5 == v5.get_allocator().get_personality());
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(alloc_type(2));
+   v2.assign(1, c);
+   v2 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ 
+   v1.assign(1, c);
+   test_type v3(alloc_type(3));
+   v3.assign(100, c);
+   v3 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v3.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v4(alloc_type(4));
+   v4.assign(1, c);
+   v4 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v4.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   v5 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v5.get_allocator().get_personality());
+ }
+ 
+ void test03()
+ {
+   // PR libstdc++/79254
+   using throw_alloc = __gnu_cxx::throw_allocator_limit<C>;
+   typedef propagating_allocator<C, true, throw_alloc> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   alloc_type a1(1), a2(2);
+   throw_alloc::set_limit(2); // Throw on third allocation (during assignment).
+   const C* s1 = "a string that is longer than a small string";
+   const C* s2 = "another string that is longer than a small string";
+   test_type v1(s1, a1);
+   test_type v2(s2, a2);
+   bool caught = false;
+   try {
+     v1 = v2;
+   } catch (__gnu_cxx::forced_error&) {
+     caught = true;
+   }
+   VERIFY( caught );
+   VERIFY( v1 == s1 );
+   VERIFY( v1.get_allocator() == a1 );
+ 
+   throw_alloc::set_limit(1); // Allow one more allocation (and no more).
+   test_type v3(s1, a1);
+   // No allocation when allocators are equal and capacity is sufficient:
+   VERIFY( v1.capacity() >= v3.size() );
+   v1 = v3;
+   // No allocation when the contents fit in the small-string buffer:
+   v2 = "sso";
+   v1 = v2;
+   VERIFY( v1.get_allocator() == a2 );
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   test03();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/minimal.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/minimal.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/minimal.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/minimal.cc	Tue Jul 12 10:56:11 2016
***************
*** 0 ****
--- 1,51 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <memory>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = char;
+ const C c = 'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::SimpleAllocator;
+ 
+ template class std::basic_string<C, traits, SimpleAllocator<C>>;
+ 
+ void test01()
+ {
+   typedef SimpleAllocator<C> alloc_type;
+   typedef std::allocator_traits<alloc_type> traits_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v(alloc_type{});
+   v.assign(1, c);
+   v.assign(100, c);
+ }
+ #else
+ void test01() { }
+ #endif
+ 
+ int main()
+ {
+   test01();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move.cc	Tue Jul 12 10:56:11 2016
***************
*** 0 ****
--- 1,66 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+ 
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = char;
+ const C c = 'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::uneq_allocator;
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef uneq_allocator<C> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(std::move(v1));
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef uneq_allocator<C> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(std::move(v1), alloc_type(2));
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move_assign.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move_assign.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move_assign.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/move_assign.cc	Tue Jul 12 10:56:11 2016
***************
*** 0 ****
--- 1,160 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = char;
+ const C c = 'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+ 
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(alloc_type(2));
+   v2.assign(1, c);
+   v2 = std::move(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+ 
+   test_type v3(alloc_type(3));
+   v3.assign(1, c);
+   test_type v4(alloc_type(4));
+   v4.assign(100, c);
+   v4 = std::move(v3);
+   VERIFY(3 == v3.get_allocator().get_personality());
+   VERIFY(4 == v4.get_allocator().get_personality());
+ 
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   test_type v6(alloc_type(6));
+   v6.assign(1, c);
+   v6 = std::move(v5);
+   VERIFY(5 == v5.get_allocator().get_personality());
+   VERIFY(6 == v6.get_allocator().get_personality());
+ 
+   test_type v7(alloc_type(7));
+   v7.assign(100, c);
+   test_type v8(alloc_type(8));
+   v8.assign(100, c);
+   v8 = std::move(v7);
+   VERIFY(7 == v7.get_allocator().get_personality());
+   VERIFY(8 == v8.get_allocator().get_personality());
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+ 
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(alloc_type(2));
+   v2.assign(1, c);
+   v2 = std::move(v1);
+   VERIFY(0 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ 
+   test_type v3(alloc_type(3));
+   v3.assign(1, c);
+   test_type v4(alloc_type(4));
+   v4.assign(100, c);
+   v4 = std::move(v3);
+   VERIFY(0 == v3.get_allocator().get_personality());
+   VERIFY(3 == v4.get_allocator().get_personality());
+ 
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   test_type v6(alloc_type(6));
+   v6.assign(1, c);
+   v6 = std::move(v5);
+   VERIFY(0 == v5.get_allocator().get_personality());
+   VERIFY(5 == v6.get_allocator().get_personality());
+ 
+   test_type v7(alloc_type(7));
+   v7.assign(100, c);
+   test_type v8(alloc_type(8));
+   v8.assign(100, c);
+   v8 = std::move(v7);
+   VERIFY(0 == v7.get_allocator().get_personality());
+   VERIFY(7 == v8.get_allocator().get_personality());
+ }
+ 
+ void test03()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+ 
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(alloc_type(1));
+   v2.assign(1, c);
+   v2 = std::move(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ 
+   test_type v3(alloc_type(3));
+   v3.assign(1, c);
+   test_type v4(alloc_type(3));
+   v4.assign(100, c);
+   v4 = std::move(v3);
+   VERIFY(3 == v3.get_allocator().get_personality());
+   VERIFY(3 == v4.get_allocator().get_personality());
+ 
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   test_type v6(alloc_type(5));
+   v6.assign(1, c);
+   v6 = std::move(v5);
+   VERIFY(5 == v5.get_allocator().get_personality());
+   VERIFY(5 == v6.get_allocator().get_personality());
+ 
+   test_type v7(alloc_type(7));
+   v7.assign(100, c);
+   test_type v8(alloc_type(7));
+   v8.assign(100, c);
+   v8 = std::move(v7);
+   VERIFY(7 == v7.get_allocator().get_personality());
+   VERIFY(7 == v8.get_allocator().get_personality());
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   test03();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/noexcept.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/noexcept.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/noexcept.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/noexcept.cc	Tue Jul 12 10:56:11 2016
***************
*** 0 ****
--- 1,61 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-do compile }
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = char;
+ const C c = 'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ void test01()
+ {
+   typedef std::allocator<C> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1;
+   test_type v2;
+   // this is a GNU extension for std::allocator
+   static_assert( noexcept( v1 = std::move(v2) ), "Move assign cannot throw" );
+   static_assert( noexcept( v1.swap(v2) ), "Swap cannot throw" );
+ }
+ 
+ void test02()
+ {
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   test_type v2(alloc_type(2));
+   static_assert( !noexcept( v1 = std::move(v2) ), "Move assign can throw" );
+   static_assert( noexcept( v1.swap(v2) ), "Swap cannot throw" );
+ }
+ 
+ void test03()
+ {
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   test_type v2(alloc_type(2));
+   static_assert( noexcept( v1 = std::move(v2) ), "Move assign cannot throw" );
+   static_assert( noexcept( v1.swap(v2) ), "Swap cannot throw" );
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/swap.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/swap.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/swap.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/char/swap.cc	Tue Jul 12 10:56:11 2016
***************
*** 0 ****
--- 1,89 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = char;
+ const C c = 'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ // It is undefined behaviour to swap() containers wth unequal allocators
+ // if the allocator doesn't propagate, so ensure the allocators compare
+ // equal, while still being able to test propagation via get_personality().
+ bool
+ operator==(const propagating_allocator<C, false>&,
+            const propagating_allocator<C, false>&)
+ {
+   return true;
+ }
+ 
+ bool
+ operator!=(const propagating_allocator<C, false>&,
+            const propagating_allocator<C, false>&)
+ {
+   return false;
+ }
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   v1.push_back(C());
+   test_type v2(alloc_type(2));
+   v2.push_back(C());
+   std::swap(v1, v2);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+   // swap back so assertions in uneq_allocator::deallocate don't fail
+   std::swap(v1, v2);
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   v1.push_back(C());
+   test_type v2(alloc_type(2));
+   v2.push_back(C());
+   std::swap(v1, v2);
+   VERIFY(2 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy.cc	Sat Aug  6 12:21:46 2016
***************
*** 0 ****
--- 1,97 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = wchar_t;
+ const C c = L'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(0 == v2.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v3(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(0 == v3.get_allocator().get_personality());
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v3(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v3.get_allocator().get_personality());
+ }
+ 
+ void test03()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(v1, alloc_type(2));
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v3(v1, alloc_type(3));
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(3 == v3.get_allocator().get_personality());
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   test03();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy_assign.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy_assign.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy_assign.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/copy_assign.cc	Wed Feb  1 12:18:43 2017
***************
*** 0 ****
--- 1,149 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+ #include <ext/throw_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = wchar_t;
+ const C c = L'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(alloc_type(2));
+   v2.assign(1, c);
+   v2 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+ 
+   v1.assign(1, c);
+   test_type v3(alloc_type(3));
+   v3.assign(100, c);
+   v3 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(3 == v3.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v4(alloc_type(4));
+   v4.assign(1, c);
+   v4 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(4 == v4.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   v5 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(5 == v5.get_allocator().get_personality());
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+ 
+   v1.assign(1, c);
+   test_type v2(alloc_type(2));
+   v2.assign(1, c);
+   v2 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ 
+   v1.assign(1, c);
+   test_type v3(alloc_type(3));
+   v3.assign(100, c);
+   v3 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v3.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v4(alloc_type(4));
+   v4.assign(1, c);
+   v4 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v4.get_allocator().get_personality());
+ 
+   v1.assign(100, c);
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   v5 = v1;
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v5.get_allocator().get_personality());
+ }
+ 
+ void test03()
+ {
+   // PR libstdc++/79254
+   using throw_alloc = __gnu_cxx::throw_allocator_limit<C>;
+   typedef propagating_allocator<C, true, throw_alloc> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   alloc_type a1(1), a2(2);
+   throw_alloc::set_limit(2); // Throw on third allocation (during assignment).
+   const C* s1 = L"a string that is longer than a small string";
+   const C* s2 = L"another string that is longer than a small string";
+   test_type v1(s1, a1);
+   test_type v2(s2, a2);
+   bool caught = false;
+   try {
+     v1 = v2;
+   } catch (__gnu_cxx::forced_error&) {
+     caught = true;
+   }
+   VERIFY( caught );
+   VERIFY( v1 == s1 );
+   VERIFY( v1.get_allocator() == a1 );
+ 
+   throw_alloc::set_limit(1); // Allow one more allocation (and no more).
+   test_type v3(s1, a1);
+   // No allocation when allocators are equal and capacity is sufficient:
+   VERIFY( v1.capacity() >= v3.size() );
+   v1 = v3;
+   // No allocation when the contents fit in the small-string buffer:
+   v2 = L"sso";
+   v1 = v2;
+   VERIFY( v1.get_allocator() == a2 );
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   test03();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/minimal.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/minimal.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/minimal.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/minimal.cc	Sat Aug  6 12:21:46 2016
***************
*** 0 ****
--- 1,51 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <memory>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = wchar_t;
+ const C c = L'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::SimpleAllocator;
+ 
+ template class std::basic_string<C, traits, SimpleAllocator<C>>;
+ 
+ void test01()
+ {
+   typedef SimpleAllocator<C> alloc_type;
+   typedef std::allocator_traits<alloc_type> traits_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v(alloc_type{});
+   v.assign(1, c);
+   v.assign(100, c);
+ }
+ #else
+ void test01() { }
+ #endif
+ 
+ int main()
+ {
+   test01();
+   return 0;
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move.cc	Sat Aug  6 12:21:46 2016
***************
*** 0 ****
--- 1,66 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+ 
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = wchar_t;
+ const C c = L'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::uneq_allocator;
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef uneq_allocator<C> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(std::move(v1));
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef uneq_allocator<C> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(std::move(v1), alloc_type(2));
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move_assign.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move_assign.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move_assign.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/move_assign.cc	Sat Aug  6 12:21:46 2016
***************
*** 0 ****
--- 1,160 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = wchar_t;
+ const C c = L'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+ 
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(alloc_type(2));
+   v2.assign(1, c);
+   v2 = std::move(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+ 
+   test_type v3(alloc_type(3));
+   v3.assign(1, c);
+   test_type v4(alloc_type(4));
+   v4.assign(100, c);
+   v4 = std::move(v3);
+   VERIFY(3 == v3.get_allocator().get_personality());
+   VERIFY(4 == v4.get_allocator().get_personality());
+ 
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   test_type v6(alloc_type(6));
+   v6.assign(1, c);
+   v6 = std::move(v5);
+   VERIFY(5 == v5.get_allocator().get_personality());
+   VERIFY(6 == v6.get_allocator().get_personality());
+ 
+   test_type v7(alloc_type(7));
+   v7.assign(100, c);
+   test_type v8(alloc_type(8));
+   v8.assign(100, c);
+   v8 = std::move(v7);
+   VERIFY(7 == v7.get_allocator().get_personality());
+   VERIFY(8 == v8.get_allocator().get_personality());
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+ 
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(alloc_type(2));
+   v2.assign(1, c);
+   v2 = std::move(v1);
+   VERIFY(0 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ 
+   test_type v3(alloc_type(3));
+   v3.assign(1, c);
+   test_type v4(alloc_type(4));
+   v4.assign(100, c);
+   v4 = std::move(v3);
+   VERIFY(0 == v3.get_allocator().get_personality());
+   VERIFY(3 == v4.get_allocator().get_personality());
+ 
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   test_type v6(alloc_type(6));
+   v6.assign(1, c);
+   v6 = std::move(v5);
+   VERIFY(0 == v5.get_allocator().get_personality());
+   VERIFY(5 == v6.get_allocator().get_personality());
+ 
+   test_type v7(alloc_type(7));
+   v7.assign(100, c);
+   test_type v8(alloc_type(8));
+   v8.assign(100, c);
+   v8 = std::move(v7);
+   VERIFY(0 == v7.get_allocator().get_personality());
+   VERIFY(7 == v8.get_allocator().get_personality());
+ }
+ 
+ void test03()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+ 
+   test_type v1(alloc_type(1));
+   v1.assign(1, c);
+   test_type v2(alloc_type(1));
+   v2.assign(1, c);
+   v2 = std::move(v1);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ 
+   test_type v3(alloc_type(3));
+   v3.assign(1, c);
+   test_type v4(alloc_type(3));
+   v4.assign(100, c);
+   v4 = std::move(v3);
+   VERIFY(3 == v3.get_allocator().get_personality());
+   VERIFY(3 == v4.get_allocator().get_personality());
+ 
+   test_type v5(alloc_type(5));
+   v5.assign(100, c);
+   test_type v6(alloc_type(5));
+   v6.assign(1, c);
+   v6 = std::move(v5);
+   VERIFY(5 == v5.get_allocator().get_personality());
+   VERIFY(5 == v6.get_allocator().get_personality());
+ 
+   test_type v7(alloc_type(7));
+   v7.assign(100, c);
+   test_type v8(alloc_type(7));
+   v8.assign(100, c);
+   v8 = std::move(v7);
+   VERIFY(7 == v7.get_allocator().get_personality());
+   VERIFY(7 == v8.get_allocator().get_personality());
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   test03();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/noexcept.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/noexcept.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/noexcept.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/noexcept.cc	Sat Aug  6 12:21:46 2016
***************
*** 0 ****
--- 1,61 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-do compile }
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = wchar_t;
+ const C c = L'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ void test01()
+ {
+   typedef std::allocator<C> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1;
+   test_type v2;
+   // this is a GNU extension for std::allocator
+   static_assert( noexcept( v1 = std::move(v2) ), "Move assign cannot throw" );
+   static_assert( noexcept( v1.swap(v2) ), "Swap cannot throw" );
+ }
+ 
+ void test02()
+ {
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   test_type v2(alloc_type(2));
+   static_assert( !noexcept( v1 = std::move(v2) ), "Move assign can throw" );
+   static_assert( noexcept( v1.swap(v2) ), "Swap cannot throw" );
+ }
+ 
+ void test03()
+ {
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   test_type v2(alloc_type(2));
+   static_assert( noexcept( v1 = std::move(v2) ), "Move assign cannot throw" );
+   static_assert( noexcept( v1.swap(v2) ), "Swap cannot throw" );
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/swap.cc gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/swap.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/swap.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/21_strings/basic_string/allocator/wchar_t/swap.cc	Sat Aug  6 12:21:46 2016
***************
*** 0 ****
--- 1,89 ----
+ // Copyright (C) 2015 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+  
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+  
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <string>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+  
+ #if _GLIBCXX_USE_CXX11_ABI
+ using C = wchar_t;
+ const C c = L'a';
+ using traits = std::char_traits<C>;
+ 
+ using __gnu_test::propagating_allocator;
+ 
+ // It is undefined behaviour to swap() containers wth unequal allocators
+ // if the allocator doesn't propagate, so ensure the allocators compare
+ // equal, while still being able to test propagation via get_personality().
+ bool
+ operator==(const propagating_allocator<C, false>&,
+            const propagating_allocator<C, false>&)
+ {
+   return true;
+ }
+ 
+ bool
+ operator!=(const propagating_allocator<C, false>&,
+            const propagating_allocator<C, false>&)
+ {
+   return false;
+ }
+ 
+ void test01()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, false> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   v1.push_back(C());
+   test_type v2(alloc_type(2));
+   v2.push_back(C());
+   std::swap(v1, v2);
+   VERIFY(1 == v1.get_allocator().get_personality());
+   VERIFY(2 == v2.get_allocator().get_personality());
+   // swap back so assertions in uneq_allocator::deallocate don't fail
+   std::swap(v1, v2);
+ }
+ 
+ void test02()
+ {
+   bool test __attribute__((unused)) = true;
+   typedef propagating_allocator<C, true> alloc_type;
+   typedef std::basic_string<C, traits, alloc_type> test_type;
+   test_type v1(alloc_type(1));
+   v1.push_back(C());
+   test_type v2(alloc_type(2));
+   v2.push_back(C());
+   std::swap(v1, v2);
+   VERIFY(2 == v1.get_allocator().get_personality());
+   VERIFY(1 == v2.get_allocator().get_personality());
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   return 0;
+ }
+ #else
+ int main()
+ {
+   // COW strings don't support C++11 allocators
+ }
+ #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/char16_t.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/char16_t.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/char16_t.cc	Wed Mar  4 17:19:55 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/char16_t.cc	Fri Mar 17 19:28:42 2017
*************** test01()
*** 34,40 ****
    const codecvt_c16* const cvt = &use_facet<codecvt_c16>(loc_c);
  
    VERIFY(!cvt->always_noconv());
!   VERIFY(cvt->max_length() == 3);
    VERIFY(cvt->encoding() == 0);
  
    const char u8dat[] = u8"H\U000000E4ll\U000000F6 \U0001F63F \U000056FD "
--- 34,40 ----
    const codecvt_c16* const cvt = &use_facet<codecvt_c16>(loc_c);
  
    VERIFY(!cvt->always_noconv());
!   VERIFY(cvt->max_length() == 4);
    VERIFY(cvt->encoding() == 0);
  
    const char u8dat[] = u8"H\U000000E4ll\U000000F6 \U0001F63F \U000056FD "
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/79980.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/79980.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/79980.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/79980.cc	Thu May 18 15:31:47 2017
***************
*** 0 ****
--- 1,142 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <locale>
+ #include <codecvt>
+ #include <testsuite_hooks.h>
+ 
+ // PR libstdc++/79980
+ 
+ constexpr std::codecvt_mode mode(std::codecvt_mode m)
+ { return static_cast<std::codecvt_mode>(m | std::consume_header); }
+ 
+ template<typename WCh, unsigned long Max = 0x10FFFF,
+ 	 std::codecvt_mode Mode = std::consume_header>
+   using Conv
+     = std::wstring_convert<std::codecvt_utf16<WCh, Max, mode(Mode)>, WCh>;
+ 
+ void
+ test01()
+ {
+   const char src[] = "\xFE\xFF\xAB\xCD";
+   Conv<char16_t> conv;
+   auto dst = conv.from_bytes(src, src+4);
+   VERIFY( dst[0] == 0xabcd );
+ }
+ 
+ void
+ test02()
+ {
+   const char src[] = "\xFF\xFE\xAB\xCD";
+   Conv<char16_t> conv;
+   auto dst = conv.from_bytes(src, src+4);
+   VERIFY( dst[0] == 0xcdab );
+ }
+ 
+ void
+ test03()
+ {
+   const char src[] = "\xFE\xFF\xAB\xCD";
+   Conv<char16_t, 0x10FFFF, std::little_endian> conv;
+   auto dst = conv.from_bytes(src, src+4);
+   VERIFY( dst[0] == 0xabcd );
+ }
+ 
+ void
+ test04()
+ {
+   const char src[] = "\xFF\xFE\xAB\xCD";
+   Conv<char16_t, 0x10FFFF, std::little_endian> conv;
+   auto dst = conv.from_bytes(src, src+4);
+   VERIFY( dst[0] == 0xcdab );
+ }
+ 
+ void
+ test05()
+ {
+   const char src[] = "\0\x61\xAB\xCD"; // character greater than 0x00FF
+   Conv<char16_t, 0xFF> conv("to_bytes failed", u"from_bytes failed");
+   std::u16string result = conv.from_bytes(src, src+4);
+   VERIFY( result == u"from_bytes failed" );
+   VERIFY( conv.converted() == 2 );
+ }
+ 
+ void
+ test06()
+ {
+   const char src[] = "\0\x61\xAB\xCD";
+   Conv<char16_t> conv("to_bytes failed", u"from_bytes failed");
+   std::u16string result = conv.from_bytes(src, src+3); // incomplete character
+   VERIFY( result == u"from_bytes failed" );
+   VERIFY( conv.converted() == 2 );
+ }
+ 
+ void
+ test07()
+ {
+   Conv<char16_t> conv("to_bytes failed", u"from_bytes failed");
+   // ucs2 to utf-16 conversion should fail on invalid ucs2 input:
+   std::u16string utf16 = u"1234\U00001111\U0001ffff";
+   auto out = conv.to_bytes(utf16);
+   VERIFY( out == "to_bytes failed" );
+   VERIFY( conv.converted() == 5 );
+ 
+   // And should also fail on incomplete surrogate pair (not return partial):
+   out = conv.to_bytes(utf16.substr(0, utf16.size()-1));
+   VERIFY( out == "to_bytes failed" );
+   VERIFY( conv.converted() == 5 );
+ }
+ 
+ void
+ test08()
+ {
+   // Read/write UTF-16 code units from data not correctly aligned for char16_t
+   Conv<char16_t, 0x10FFFF, std::generate_header> conv;
+   const char src[] = "-\xFE\xFF\0\x61\xAB\xCD";
+   auto out = conv.from_bytes(src + 1, src + 7);
+   VERIFY( out[0] == 0x0061 );
+   VERIFY( out[1] == 0xabcd );
+   auto bytes = conv.to_bytes(out);
+   VERIFY( bytes == std::string(src + 1, 6) );
+ }
+ 
+ void
+ test09()
+ {
+   // Read/write UTF-16 code units from data not correctly aligned for char16_t
+   Conv<char32_t, 0x10FFFF, std::generate_header> conv;
+   const char src[] = "-\xFE\xFF\xD8\x08\xDF\x45";
+   auto out = conv.from_bytes(src + 1, src + 7);
+   VERIFY( out == U"\U00012345" );
+   auto bytes = conv.to_bytes(out);
+   VERIFY( bytes == std::string(src + 1, 6) );
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+   test03();
+   test04();
+   test05();
+   test06();
+   test07();
+   test08();
+   test09();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/80041.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/80041.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/80041.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/80041.cc	Thu May 18 15:31:47 2017
***************
*** 0 ****
--- 1,87 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <codecvt>
+ #include <testsuite_hooks.h>
+ 
+ void
+ test01()
+ {
+ #ifdef _GLIBCXX_USE_WCHAR_T
+   std::codecvt_utf16<wchar_t> conv;
+   const wchar_t wc = 0x6557;
+   char bytes[2] = {0};
+   const wchar_t* wcnext;
+   std::mbstate_t st{};
+   char* next = nullptr;
+   auto res = conv.out(st, &wc, &wc+ 1, wcnext, bytes, std::end(bytes), next);
+   VERIFY( res == std::codecvt_base::ok );
+   VERIFY( wcnext == &wc + 1 );
+   VERIFY( next == std::end(bytes) );
+   VERIFY( bytes[0] == 0x65 );
+   VERIFY( bytes[1] == 0x57 );
+   VERIFY( conv.length(st, bytes, next, 1) == (next - bytes) );
+ 
+   wchar_t w;
+   wchar_t* wnext;
+   const char* cnext;
+   st = {};
+   res = conv.in(st, bytes, next, cnext, &w, &w + 1, wnext);
+   VERIFY( res == std::codecvt_base::ok );
+   VERIFY( wnext == &w + 1 );
+   VERIFY( cnext == next );
+   VERIFY( w == wc );
+ #endif
+ }
+ 
+ void
+ test02()
+ {
+ #ifdef _GLIBCXX_USE_WCHAR_T
+   std::codecvt_utf16<wchar_t, 0x10FFFF, std::little_endian> conv;
+   wchar_t wc = 0x6557;
+   char bytes[2] = {0};
+   const wchar_t* wcnext;
+   std::mbstate_t st{};
+   char* next = nullptr;
+   auto res = conv.out(st, &wc, &wc+ 1, wcnext, bytes, std::end(bytes), next);
+   VERIFY( res == std::codecvt_base::ok );
+   VERIFY( wcnext == &wc + 1 );
+   VERIFY( next == std::end(bytes) );
+   VERIFY( bytes[0] == 0x57 );
+   VERIFY( bytes[1] == 0x65 );
+   VERIFY( conv.length(st, bytes, next, 1) == (next - bytes) );
+ 
+   wchar_t w;
+   wchar_t* wnext;
+   const char* cnext;
+   st = {};
+   res = conv.in(st, bytes, next, cnext, &w, &w + 1, wnext);
+   VERIFY( res == std::codecvt_base::ok );
+   VERIFY( wnext == &w + 1 );
+   VERIFY( cnext == next );
+   VERIFY( w == wc );
+ #endif
+ }
+ 
+ int main()
+ {
+   test01();
+   test02();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/members.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/members.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/members.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/members.cc	Thu May 18 15:31:47 2017
***************
*** 0 ****
--- 1,81 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <codecvt>
+ #include <testsuite_hooks.h>
+ 
+ const int bomlen = 2; // UTF-16 BOM is 16 bits
+ 
+ void
+ test01()
+ {
+   const int maxlen = 2;
+ 
+   std::codecvt_utf16<char16_t> c;
+   VERIFY( c.always_noconv() == false );
+   VERIFY( c.encoding() == 0 );
+   VERIFY( c.max_length() == maxlen );
+ 
+   std::codecvt_utf16<char16_t, 0x10ffff, std::consume_header> c_bom;
+   VERIFY( c_bom.always_noconv() == false );
+   VERIFY( c_bom.encoding() == 0 );
+   VERIFY( c_bom.max_length() == (maxlen + bomlen) );
+ }
+ 
+ void
+ test02()
+ {
+   const int maxlen = 4;
+ 
+   std::codecvt_utf16<char32_t> c;
+   VERIFY( c.always_noconv() == false );
+   VERIFY( c.encoding() == 0 );
+   VERIFY( c.max_length() == maxlen );
+ 
+   std::codecvt_utf16<char32_t, 0x10ffff, std::consume_header> c_bom;
+   VERIFY( c_bom.always_noconv() == false );
+   VERIFY( c_bom.encoding() == 0 );
+   VERIFY( c_bom.max_length() == (maxlen + bomlen) );
+ }
+ 
+ void
+ test03()
+ {
+ #ifdef _GLIBCXX_USE_WCHAR_T
+   const int maxlen = sizeof(wchar_t) == 4 ? 4 : 2;
+ 
+   std::codecvt_utf16<wchar_t> c;
+   VERIFY( c.always_noconv() == false );
+   VERIFY( c.encoding() == 0 );
+   VERIFY( c.max_length() == maxlen );
+ 
+   std::codecvt_utf16<wchar_t, 0x10ffff, std::consume_header> c_bom;
+   VERIFY( c_bom.always_noconv() == false );
+   VERIFY( c_bom.encoding() == 0 );
+   VERIFY( c_bom.max_length() == (maxlen + bomlen) );
+ #endif
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+   test03();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/misaligned.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/misaligned.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/misaligned.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf16/misaligned.cc	Thu May 18 15:31:47 2017
***************
*** 0 ****
--- 1,289 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <locale>
+ #include <codecvt>
+ #include <testsuite_hooks.h>
+ 
+ using std::codecvt_base;
+ using std::codecvt_mode;
+ using std::codecvt_utf16;
+ using std::wstring_convert;
+ using std::mbstate_t;
+ 
+ constexpr codecvt_mode
+ operator|(codecvt_mode m1, codecvt_mode m2)
+ {
+   using underlying = std::underlying_type<codecvt_mode>::type;
+   return static_cast<codecvt_mode>(static_cast<underlying>(m1) | m2);
+ }
+ 
+ // Read/write UTF-16 code units from data not correctly aligned for char16_t
+ 
+ void
+ test01()
+ {
+   mbstate_t st;
+   constexpr codecvt_mode m = std::consume_header|std::generate_header;
+   codecvt_utf16<char16_t, 0x10FFFF, m> conv;
+   const char src[] = "-\xFE\xFF\0\x61\xAB\xCD";
+   const char* const src_end = src + 7;
+ 
+   int len = conv.length(st, src + 1, src_end, 1);
+   VERIFY( len == 4 );
+   len = conv.length(st, src + 1, src_end, 2);
+   VERIFY( len == 6 );
+ 
+   char16_t dst[2];
+   char16_t* const dst_end = dst + 2;
+   char16_t* dst_next;
+   const char* src_cnext;
+   auto res = conv.in(st, src + 1, src_end, src_cnext, dst, dst_end, dst_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( dst[0] == 0x0061 );
+   VERIFY( dst[1] == 0xabcd );
+   VERIFY( src_cnext == src_end );
+   VERIFY( dst_next == dst_end );
+ 
+   char out[sizeof(src)] = { src[0] };
+   char* const out_end = out + 7;
+   char* out_next;
+   const char16_t* dst_cnext;
+   res = conv.out(st, dst, dst_end, dst_cnext, out + 1, out_end, out_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( out_next == out_end );
+   VERIFY( dst_cnext == dst_end );
+   VERIFY( out[1] == src[1] );
+   VERIFY( out[2] == src[2] );
+   VERIFY( out[3] == src[3] );
+   VERIFY( out[4] == src[4] );
+   VERIFY( out[5] == src[5] );
+   VERIFY( out[6] == src[6] );
+ 
+   codecvt_utf16<char16_t, 0x10FFFF, m|std::little_endian> conv_le;
+ 
+   len = conv_le.length(st, src + 1, src_end, 1);
+   VERIFY( len == 4 );
+   len = conv_le.length(st, src + 1, src_end, 2);
+   VERIFY( len == 6 );
+ 
+   res = conv_le.in(st, src + 1, src_end, src_cnext, dst, dst_end, dst_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( dst[0] == 0x0061 );
+   VERIFY( dst[1] == 0xabcd );
+   VERIFY( src_cnext == src_end );
+   VERIFY( dst_next == dst_end );
+ 
+   res = conv_le.out(st, dst, dst_end, dst_cnext, out + 1, out_end, out_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( out_next == out_end );
+   VERIFY( dst_cnext == dst_end );
+   VERIFY( out[1] == src[2] );
+   VERIFY( out[2] == src[1] );
+   VERIFY( out[3] == src[4] );
+   VERIFY( out[4] == src[3] );
+   VERIFY( out[5] == src[6] );
+   VERIFY( out[6] == src[5] );
+ }
+ 
+ void
+ test02()
+ {
+   mbstate_t st;
+   constexpr codecvt_mode m = std::consume_header|std::generate_header;
+   codecvt_utf16<char32_t, 0x10FFFF, m> conv;
+   const char src[] = "-\xFE\xFF\0\x61\xAB\xCD\xD8\x08\xDF\x45";
+   const char* const src_end = src + 11;
+ 
+   int len = conv.length(st, src + 1, src_end, 1);
+   VERIFY( len == 4 );
+   len = conv.length(st, src + 1, src_end, 2);
+   VERIFY( len == 6 );
+   len = conv.length(st, src + 1, src_end, -1ul);
+   VERIFY( len == 10 );
+ 
+   char32_t dst[3];
+   char32_t* const dst_end = dst + 3;
+   char32_t* dst_next;
+   const char* src_cnext;
+   auto res = conv.in(st, src + 1, src_end, src_cnext, dst, dst_end, dst_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( dst[0] == 0x0061 );
+   VERIFY( dst[1] == 0xabcd );
+   VERIFY( dst[2] == 0x012345 );
+   VERIFY( src_cnext == src_end );
+   VERIFY( dst_next == dst_end );
+ 
+   char out[sizeof(src)] = { src[0] };
+   char* const out_end = out + 11;
+   char* out_next;
+   const char32_t* dst_cnext;
+   res = conv.out(st, dst, dst_end, dst_cnext, out + 1, out_end, out_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( out_next == out_end );
+   VERIFY( dst_cnext == dst_end );
+   VERIFY( out[1] == src[1] );
+   VERIFY( out[2] == src[2] );
+   VERIFY( out[3] == src[3] );
+   VERIFY( out[4] == src[4] );
+   VERIFY( out[5] == src[5] );
+   VERIFY( out[6] == src[6] );
+   VERIFY( out[7] == src[7] );
+   VERIFY( out[8] == src[8] );
+   VERIFY( out[9] == src[9] );
+   VERIFY( out[10] == src[10] );
+ 
+   codecvt_utf16<char32_t, 0x10FFFF, m|std::little_endian> conv_le;
+ 
+   len = conv_le.length(st, src + 1, src_end, 1);
+   VERIFY( len == 4 );
+   len = conv_le.length(st, src + 1, src_end, 2);
+   VERIFY( len == 6 );
+   len = conv.length(st, src + 1, src_end, -1ul);
+   VERIFY( len == 10 );
+ 
+   res = conv_le.in(st, src + 1, src_end, src_cnext, dst, dst_end, dst_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( dst[0] == 0x0061 );
+   VERIFY( dst[1] == 0xabcd );
+   VERIFY( dst[2] == 0x012345 );
+   VERIFY( src_cnext == src_end );
+   VERIFY( dst_next == dst_end );
+ 
+   res = conv_le.out(st, dst, dst_end, dst_cnext, out + 1, out_end, out_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( out_next == out_end );
+   VERIFY( dst_cnext == dst_end );
+   VERIFY( out[1] == src[2] );
+   VERIFY( out[2] == src[1] );
+   VERIFY( out[3] == src[4] );
+   VERIFY( out[4] == src[3] );
+   VERIFY( out[5] == src[6] );
+   VERIFY( out[6] == src[5] );
+   VERIFY( out[7] == src[8] );
+   VERIFY( out[8] == src[7] );
+   VERIFY( out[9] == src[10] );
+   VERIFY( out[10] == src[9] );
+ }
+ 
+ void
+ test03()
+ {
+ #ifdef _GLIBCXX_USE_WCHAR_T
+   mbstate_t st;
+   constexpr codecvt_mode m = std::consume_header|std::generate_header;
+   codecvt_utf16<wchar_t, 0x10FFFF, m> conv;
+   const char src[] = "-\xFE\xFF\0\x61\xAB\xCD\xD8\x08\xDF\x45";
+   const size_t in_len = sizeof(wchar_t) == 4 ? 11 : 7;
+   const size_t out_len = sizeof(wchar_t) == 4 ? 3 : 2;
+   const char* const src_end = src + in_len;
+ 
+   int len = conv.length(st, src + 1, src_end, 1);
+   VERIFY( len == 4 );
+   len = conv.length(st, src + 1, src_end, 2);
+   VERIFY( len == 6 );
+   if (sizeof(wchar_t) == 4)
+   {
+     len = conv.length(st, src + 1, src_end, -1ul);
+     VERIFY( len == 10 );
+   }
+ 
+   wchar_t dst[out_len];
+   wchar_t* const dst_end = dst + out_len;
+   wchar_t* dst_next;
+   const char* src_cnext;
+   auto res = conv.in(st, src + 1, src_end, src_cnext, dst, dst_end, dst_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( dst[0] == 0x0061 );
+   VERIFY( dst[1] == 0xabcd );
+   if (sizeof(wchar_t) == 4)
+     VERIFY( dst[2] == 0x012345 );
+   VERIFY( src_cnext == src_end );
+   VERIFY( dst_next == dst_end );
+ 
+   char out[sizeof(src)] = { src[0] };
+   char* const out_end = out + in_len;
+   char* out_next;
+   const wchar_t* dst_cnext;
+   res = conv.out(st, dst, dst_end, dst_cnext, out + 1, out_end, out_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( out_next == out_end );
+   VERIFY( dst_cnext == dst_end );
+   VERIFY( out[1] == src[1] );
+   VERIFY( out[2] == src[2] );
+   VERIFY( out[3] == src[3] );
+   VERIFY( out[4] == src[4] );
+   VERIFY( out[5] == src[5] );
+   VERIFY( out[6] == src[6] );
+   if (sizeof(wchar_t) == 4)
+   {
+     VERIFY( out[7] == src[7] );
+     VERIFY( out[8] == src[8] );
+     VERIFY( out[9] == src[9] );
+     VERIFY( out[10] == src[10] );
+   }
+ 
+   codecvt_utf16<wchar_t, 0x10FFFF, m|std::little_endian> conv_le;
+ 
+   len = conv_le.length(st, src + 1, src_end, 1);
+   VERIFY( len == 4 );
+   len = conv_le.length(st, src + 1, src_end, 2);
+   VERIFY( len == 6 );
+   if (sizeof(wchar_t) == 4)
+   {
+     len = conv.length(st, src + 1, src_end, -1ul);
+     VERIFY( len == 10 );
+   }
+ 
+   res = conv_le.in(st, src + 1, src_end, src_cnext, dst, dst_end, dst_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( dst[0] == 0x0061 );
+   VERIFY( dst[1] == 0xabcd );
+   if (sizeof(wchar_t) == 4)
+     VERIFY( dst[2] == 0x012345 );
+   VERIFY( src_cnext == src_end );
+   VERIFY( dst_next == dst_end );
+ 
+   res = conv_le.out(st, dst, dst_end, dst_cnext, out + 1, out_end, out_next);
+   VERIFY( res == codecvt_base::ok );
+   VERIFY( out_next == out_end );
+   VERIFY( dst_cnext == dst_end );
+   VERIFY( out[1] == src[2] );
+   VERIFY( out[2] == src[1] );
+   VERIFY( out[3] == src[4] );
+   VERIFY( out[4] == src[3] );
+   VERIFY( out[5] == src[6] );
+   VERIFY( out[6] == src[5] );
+   if (sizeof(wchar_t) == 4)
+   {
+     VERIFY( out[7] == src[8] );
+     VERIFY( out[8] == src[7] );
+     VERIFY( out[9] == src[10] );
+     VERIFY( out[10] == src[9] );
+   }
+ #endif
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+   test03();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/79980.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/79980.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/79980.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/79980.cc	Thu May 18 15:31:47 2017
***************
*** 0 ****
--- 1,94 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <codecvt>
+ #include <locale>
+ #include <string>
+ #include <testsuite_hooks.h>
+ 
+ using std::wstring_convert;
+ using std::codecvt_utf8;
+ 
+ void
+ test01()
+ {
+   std::string src = u8"1234\U00001111\U0001ffff";
+   wstring_convert<codecvt_utf8<char16_t>, char16_t> c("bad", u"BAD");
+ 
+   // utf-8 to ucs2 conversion should fail on character outside BMP
+   auto ucs2 = c.from_bytes(src);
+   VERIFY( ucs2 == u"BAD" );
+   VERIFY( c.converted() == 7 );
+ 
+   // ucs2 to utf-8 conversion should fail on invalid ucs2 input:
+   std::u16string utf16 = u"1234\U00001111\U0001ffff";
+   auto out = c.to_bytes(utf16);
+   VERIFY( out == "bad" );
+   VERIFY( c.converted() == 5 );
+ 
+   // And should also fail on incomplete surrogate pair (not return partial):
+   out = c.to_bytes(utf16.substr(0, utf16.size()-1));
+   VERIFY( out == "bad" );
+   VERIFY( c.converted() == 5 );
+ }
+ 
+ void
+ test02()
+ {
+   std::string src = u8"1234\U00001111\U0001ffff";
+   wstring_convert<codecvt_utf8<char16_t, 0x1000>, char16_t> c("bad", u"BAD");
+ 
+   // utf-8 to ucs2 conversion should fail on character above Maxcode=0x1000
+   auto ucs2 = c.from_bytes(src);
+   VERIFY( ucs2 == u"BAD" );
+   VERIFY( c.converted() == 4 );
+ }
+ 
+ void
+ test03()
+ {
+   std::string src = u8"1234\U00001111\U0001ffff";
+   wstring_convert<codecvt_utf8<char32_t, 0x10000>, char32_t> c("bad", U"BAD");
+ 
+   // utf-8 to ucs4 conversion should fail on character above Maxcode=0x10000
+   auto ucs4 = c.from_bytes(src);
+   VERIFY( ucs4 == U"BAD" );
+   VERIFY( c.converted() == 7 );
+ }
+ 
+ void
+ test04()
+ {
+   std::string src = u8"1234\U00001111\U0001ffff";
+   wstring_convert<codecvt_utf8<char32_t, 0x1000>, char32_t> c("bad", U"BAD");
+ 
+   // utf-8 to ucs4 conversion should fail on character above Maxcode=0x1000
+   auto ucs4 = c.from_bytes(src);
+   VERIFY( ucs4 == U"BAD" );
+   VERIFY( c.converted() == 4 );
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+   test03();
+   test04();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/members.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/members.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/members.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8/members.cc	Thu May 18 15:31:47 2017
***************
*** 0 ****
--- 1,81 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <codecvt>
+ #include <testsuite_hooks.h>
+ 
+ const int bomlen = 3; // UTF-8 BOM is 24 bits
+ 
+ void
+ test01()
+ {
+   const int maxlen = 3;
+ 
+   std::codecvt_utf8<char16_t> c;
+   VERIFY( c.always_noconv() == false );
+   VERIFY( c.encoding() == 0 );
+   VERIFY( c.max_length() == maxlen );
+ 
+   std::codecvt_utf8<char16_t, 0x10ffff, std::consume_header> c_bom;
+   VERIFY( c_bom.always_noconv() == false );
+   VERIFY( c_bom.encoding() == 0 );
+   VERIFY( c_bom.max_length() == (maxlen + bomlen) );
+ }
+ 
+ void
+ test02()
+ {
+   const int maxlen = 4;
+ 
+   std::codecvt_utf8<char32_t> c;
+   VERIFY( c.always_noconv() == false );
+   VERIFY( c.encoding() == 0 );
+   VERIFY( c.max_length() == maxlen );
+ 
+   std::codecvt_utf8<char32_t, 0x10ffff, std::consume_header> c_bom;
+   VERIFY( c_bom.always_noconv() == false );
+   VERIFY( c_bom.encoding() == 0 );
+   VERIFY( c_bom.max_length() == (maxlen + bomlen) );
+ }
+ 
+ void
+ test03()
+ {
+ #ifdef _GLIBCXX_USE_WCHAR_T
+   const int maxlen = sizeof(wchar_t) == 4 ? 4 : 3;
+ 
+   std::codecvt_utf8<wchar_t> c;
+   VERIFY( c.always_noconv() == false );
+   VERIFY( c.encoding() == 0 );
+   VERIFY( c.max_length() == maxlen );
+ 
+   std::codecvt_utf8<wchar_t, 0x10ffff, std::consume_header> c_bom;
+   VERIFY( c_bom.always_noconv() == false );
+   VERIFY( c_bom.encoding() == 0 );
+   VERIFY( c_bom.max_length() == (maxlen + bomlen) );
+ #endif
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+   test03();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/79511.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/79511.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/79511.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/79511.cc	Thu May 18 15:31:47 2017
***************
*** 0 ****
--- 1,60 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <locale>
+ #include <codecvt>
+ #include <testsuite_hooks.h>
+ 
+ // PR libstdc++/79511
+ 
+ template<typename ElemT>
+   std::basic_string<ElemT> conv(const char* src)
+   {
+     std::wstring_convert<std::codecvt_utf8_utf16<ElemT>, ElemT> conv;
+     return conv.from_bytes(src);
+   }
+ 
+ void
+ test01()
+ {
+   static char const src[] = "\xEF\xBF\xBF";
+   VERIFY( conv<char16_t>(src) == u"\xffff" );
+   VERIFY( conv<char32_t>(src) == U"\xffff" );
+ #ifdef _GLIBCXX_USE_WCHAR_T
+   VERIFY( conv<wchar_t>(src) == L"\xffff" );
+ #endif
+ }
+ 
+ void
+ test02()
+ {
+   static char const src[] = "\xE2\x82\xAC";
+   VERIFY( conv<char16_t>(src) == u"\x20ac" );
+   VERIFY( conv<char32_t>(src) == U"\x20ac" );
+ #ifdef _GLIBCXX_USE_WCHAR_T
+   VERIFY( conv<wchar_t>(src) == L"\x20ac" );
+ #endif
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/members.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/members.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/members.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_utf8_utf16/members.cc	Thu May 18 15:31:47 2017
***************
*** 0 ****
--- 1,76 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <codecvt>
+ #include <testsuite_hooks.h>
+ 
+ const int bomlen = 3; // UTF-8 BOM is 24 bits
+ const int maxlen = 4;
+ 
+ void
+ test01()
+ {
+   std::codecvt_utf8_utf16<char16_t> c;
+   VERIFY( c.always_noconv() == false );
+   VERIFY( c.encoding() == 0 );
+   VERIFY( c.max_length() == maxlen );
+ 
+   std::codecvt_utf8_utf16<char16_t, 0x10ffff, std::consume_header> c_bom;
+   VERIFY( c_bom.always_noconv() == false );
+   VERIFY( c_bom.encoding() == 0 );
+   VERIFY( c_bom.max_length() == (maxlen + bomlen) );
+ }
+ 
+ void
+ test02()
+ {
+   std::codecvt_utf8_utf16<char32_t> c;
+   VERIFY( c.always_noconv() == false );
+   VERIFY( c.encoding() == 0 );
+   VERIFY( c.max_length() == maxlen );
+ 
+   std::codecvt_utf8_utf16<char32_t, 0x10ffff, std::consume_header> c_bom;
+   VERIFY( c_bom.always_noconv() == false );
+   VERIFY( c_bom.encoding() == 0 );
+   VERIFY( c_bom.max_length() == (maxlen + bomlen) );
+ }
+ 
+ void
+ test03()
+ {
+ #ifdef _GLIBCXX_USE_WCHAR_T
+   std::codecvt_utf8_utf16<wchar_t> c;
+   VERIFY( c.always_noconv() == false );
+   VERIFY( c.encoding() == 0 );
+   VERIFY( c.max_length() == maxlen );
+ 
+   std::codecvt_utf8_utf16<wchar_t, 0x10ffff, std::consume_header> c_bom;
+   VERIFY( c_bom.always_noconv() == false );
+   VERIFY( c_bom.encoding() == 0 );
+   VERIFY( c_bom.max_length() == (maxlen + bomlen) );
+ #endif
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+   test03();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/22_locale/conversions/buffer/2.cc gcc-5.5.0/libstdc++-v3/testsuite/22_locale/conversions/buffer/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/22_locale/conversions/buffer/2.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/22_locale/conversions/buffer/2.cc	Wed Sep 13 15:28:18 2017
***************
*** 0 ****
--- 1,40 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do run }
+ 
+ #include <locale>
+ #include <sstream>
+ #include <testsuite_hooks.h>
+ 
+ void
+ test01()
+ {
+   struct Cvt : std::codecvt<char, char, std::mbstate_t> { };
+   std::stringstream ss;
+   std::wbuffer_convert<Cvt, char> cvt(ss.rdbuf());
+   auto p = ss.std::ios::rdbuf(&cvt);
+   ss << "hello";
+   VERIFY( ss.flush().good() );
+   ss.std::ios::rdbuf(p);
+ }
+ 
+ int main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/list/operations/78389.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/list/operations/78389.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/list/operations/78389.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/list/operations/78389.cc	Mon Jan 16 13:32:39 2017
***************
*** 0 ****
--- 1,74 ----
+ // { dg-options "-std=gnu++11" }
+ 
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // 23.2.2.4 list operations [lib.list.ops]
+ 
+ #include <testsuite_hooks.h>
+ 
+ #include <list>
+ 
+ struct ThrowingComparator
+ {
+     unsigned int throw_after;
+     unsigned int count;
+     bool operator()(int, int) {
+         if (++count >= throw_after) {
+             throw 666;
+         }
+         return true;
+     }
+ };
+ 
+ struct X
+ {
+   X() = default;
+   X(int) {}
+ };
+ 
+ unsigned int throw_after_X = 0;
+ unsigned int count_X = 0;
+ 
+ bool operator<(const X&, const X&) {
+   if (++count_X >= throw_after_X) {
+     throw 666;
+   }
+   return true;
+ }
+ 
+ 
+ int main()
+ {
+     std::list<int> a{1, 2, 3, 4};
+     std::list<int> b{5, 6, 7, 8, 9, 10, 11, 12};
+     try {
+       a.merge(b, ThrowingComparator{4, 0});
+     } catch (...) {
+     }
+     VERIFY(a.size() == std::distance(a.begin(), a.end()) &&
+ 	   b.size() == std::distance(b.begin(), b.end()));
+     std::list<X> ax{1, 2, 3, 4};
+     std::list<X> bx{5, 6, 7, 8, 9, 10, 11, 12};
+     throw_after_X = 4;
+     try {
+         ax.merge(bx);
+     } catch (...) {
+     }
+     VERIFY(ax.size() == std::distance(ax.begin(), ax.end()) &&
+ 	   bx.size() == std::distance(bx.begin(), bx.end()));
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/list/operations/80034.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/list/operations/80034.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/list/operations/80034.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/list/operations/80034.cc	Mon Mar 13 19:44:42 2017
***************
*** 0 ****
--- 1,32 ----
+ // { dg-do compile }
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ #include <list>
+ 
+ namespace X {
+   struct Y { };
+   bool operator<(Y, Y) { return false; }
+   template<typename T>
+     void distance(T, T) { }
+ }
+ 
+ int main()
+ {
+   std::list<X::Y> l;
+   l.sort();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/map/77334.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/map/77334.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/map/77334.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/map/77334.cc	Tue Aug 23 14:23:40 2016
***************
*** 0 ****
--- 1,29 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <map>
+ 
+ struct A { A(A&&) = delete; };
+ 
+ void test01()
+ {
+    std::map<int, A> m1, m2;
+    m2 = std::move(m1);
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/map/cons/noexcept_default_construct.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/map/cons/noexcept_default_construct.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/map/cons/noexcept_default_construct.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/map/cons/noexcept_default_construct.cc	Wed Oct  5 13:43:58 2016
***************
*** 0 ****
--- 1,33 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <map>
+ 
+ using mtype1 = std::map<int, int>;
+ static_assert(std::is_nothrow_default_constructible<mtype1>::value, "Error");
+ 
+ struct cmp
+ {
+   cmp() { }
+   bool operator()(int, int) const;
+ };
+ 
+ using mtype2 = std::map<int, int, cmp>;
+ static_assert( !std::is_nothrow_default_constructible<mtype2>::value, "Error");
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/map/operations/2.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/map/operations/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/map/operations/2.cc	Tue Nov 10 18:08:50 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/map/operations/2.cc	Tue Feb 14 21:17:18 2017
*************** test01()
*** 53,59 ****
    cit = cx.find(2L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0);
  
    static_assert(std::is_same<decltype(it), test_type::iterator>::value,
        "find returns iterator");
--- 53,59 ----
    cit = cx.find(2L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0 );
  
    static_assert(std::is_same<decltype(it), test_type::iterator>::value,
        "find returns iterator");
*************** test02()
*** 76,82 ****
    cn = cx.count(2L);
    VERIFY( cn == 0 );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 76,82 ----
    cn = cx.count(2L);
    VERIFY( cn == 0 );
  
!   VERIFY( Cmp::count == 0 );
  }
  
  void
*************** test03()
*** 94,100 ****
    cit = cx.lower_bound(2L);
    VERIFY( cit != cx.end() && cit->second == '4' );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 94,105 ----
    cit = cx.lower_bound(2L);
    VERIFY( cit != cx.end() && cit->second == '4' );
  
!   VERIFY( Cmp::count == 0 );
! 
!   static_assert(std::is_same<decltype(it), test_type::iterator>::value,
!       "lower_bound returns iterator");
!   static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
!       "const lower_bound returns const_iterator");
  }
  
  void
*************** test04()
*** 112,118 ****
    cit = cx.upper_bound(3L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 117,128 ----
    cit = cx.upper_bound(3L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0 );
! 
!   static_assert(std::is_same<decltype(it), test_type::iterator>::value,
!       "upper_bound returns iterator");
!   static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
!       "const upper_bound returns const_iterator");
  }
  
  void
*************** test05()
*** 130,138 ****
    cit = cx.equal_range(2L);
    VERIFY( cit.first == cit.second && cit.first != cx.end() );
  
!   VERIFY( Cmp::count == 0);
  }
  
  
  int
  main()
--- 140,176 ----
    cit = cx.equal_range(2L);
    VERIFY( cit.first == cit.second && cit.first != cx.end() );
  
!   VERIFY( Cmp::count == 0 );
! 
!   using pair = std::pair<test_type::iterator, test_type::iterator>;
!   static_assert(std::is_same<decltype(it), pair>::value,
!       "equal_range returns pair<iterator, iterator>");
!   using cpair = std::pair<test_type::const_iterator, test_type::const_iterator>;
!   static_assert(std::is_same<decltype(cit), cpair>::value,
!       "const equal_range returns pair<const_iterator, const_iterator>");
  }
  
+ void
+ test06()
+ {
+   // PR libstdc++/78273
+ 
+   struct C {
+     bool operator()(int l, int r) const { return l < r; }
+ 
+     struct Partition { };
+ 
+     bool operator()(int l, Partition) const { return l < 2; }
+     bool operator()(Partition, int r) const { return 4 < r; }
+ 
+     using is_transparent = void;
+   };
+ 
+   std::map<int, int, C> m{ {1,0}, {2,0}, {3,0}, {4, 0}, {5, 0} };
+ 
+   auto n = m.count(C::Partition{});
+   VERIFY( n == 3 );
+ }
  
  int
  main()
*************** main()
*** 142,145 ****
--- 180,184 ----
    test03();
    test04();
    test05();
+   test06();
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/multimap/cons/noexcept_default_construct.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/multimap/cons/noexcept_default_construct.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/multimap/cons/noexcept_default_construct.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/multimap/cons/noexcept_default_construct.cc	Wed Oct  5 13:43:58 2016
***************
*** 0 ****
--- 1,33 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <map>
+ 
+ using mtype1 = std::multimap<int, int>;
+ static_assert(std::is_nothrow_default_constructible<mtype1>::value, "Error");
+ 
+ struct cmp
+ {
+   cmp() { }
+   bool operator()(int, int) const;
+ };
+ 
+ using mtype2 = std::multimap<int, int, cmp>;
+ static_assert( !std::is_nothrow_default_constructible<mtype2>::value, "Error");
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/multimap/operations/2.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/multimap/operations/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/multimap/operations/2.cc	Tue Nov 10 18:08:50 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/multimap/operations/2.cc	Tue Feb 14 21:17:18 2017
*************** test01()
*** 53,59 ****
    cit = cx.find(2L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0);
  
    static_assert(std::is_same<decltype(it), test_type::iterator>::value,
        "find returns iterator");
--- 53,59 ----
    cit = cx.find(2L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0 );
  
    static_assert(std::is_same<decltype(it), test_type::iterator>::value,
        "find returns iterator");
*************** test02()
*** 76,82 ****
    cn = cx.count(2L);
    VERIFY( cn == 0 );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 76,82 ----
    cn = cx.count(2L);
    VERIFY( cn == 0 );
  
!   VERIFY( Cmp::count == 0 );
  }
  
  void
*************** test03()
*** 94,100 ****
    cit = cx.lower_bound(2L);
    VERIFY( cit != cx.end() && cit->second == '4' );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 94,105 ----
    cit = cx.lower_bound(2L);
    VERIFY( cit != cx.end() && cit->second == '4' );
  
!   VERIFY( Cmp::count == 0 );
! 
!   static_assert(std::is_same<decltype(it), test_type::iterator>::value,
!       "lower_bound returns iterator");
!   static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
!       "const lower_bound returns const_iterator");
  }
  
  void
*************** test04()
*** 112,118 ****
    cit = cx.upper_bound(3L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 117,128 ----
    cit = cx.upper_bound(3L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0 );
! 
!   static_assert(std::is_same<decltype(it), test_type::iterator>::value,
!       "upper_bound returns iterator");
!   static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
!       "const upper_bound returns const_iterator");
  }
  
  void
*************** test05()
*** 131,137 ****
    cit = cx.equal_range(2L);
    VERIFY( cit.first == cit.second && cit.first != cx.end() );
  
!   VERIFY( Cmp::count == 0);
  }
  
  
--- 141,154 ----
    cit = cx.equal_range(2L);
    VERIFY( cit.first == cit.second && cit.first != cx.end() );
  
!   VERIFY( Cmp::count == 0 );
! 
!   using pair = std::pair<test_type::iterator, test_type::iterator>;
!   static_assert(std::is_same<decltype(it), pair>::value,
!       "equal_range returns pair<iterator, iterator>");
!   using cpair = std::pair<test_type::const_iterator, test_type::const_iterator>;
!   static_assert(std::is_same<decltype(cit), cpair>::value,
!       "const equal_range returns pair<const_iterator, const_iterator>");
  }
  
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/multiset/cons/noexcept_default_construct.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/multiset/cons/noexcept_default_construct.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/multiset/cons/noexcept_default_construct.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/multiset/cons/noexcept_default_construct.cc	Wed Oct  5 13:43:58 2016
***************
*** 0 ****
--- 1,33 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <set>
+ 
+ using stype1 = std::multiset<int>;
+ static_assert(std::is_nothrow_default_constructible<stype1>::value, "Error");
+ 
+ struct cmp
+ {
+   cmp() { }
+   bool operator()(int, int) const;
+ };
+ 
+ using stype2 = std::multiset<int, cmp>;
+ static_assert( !std::is_nothrow_default_constructible<stype2>::value, "Error");
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/multiset/operations/2.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/multiset/operations/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/multiset/operations/2.cc	Tue Nov 10 18:08:50 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/multiset/operations/2.cc	Tue Feb 14 21:17:18 2017
*************** test01()
*** 53,59 ****
    cit = cx.find(2L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0);
  
    static_assert(std::is_same<decltype(it), test_type::iterator>::value,
        "find returns iterator");
--- 53,59 ----
    cit = cx.find(2L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0 );
  
    static_assert(std::is_same<decltype(it), test_type::iterator>::value,
        "find returns iterator");
*************** test02()
*** 76,82 ****
    cn = cx.count(2L);
    VERIFY( cn == 0 );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 76,82 ----
    cn = cx.count(2L);
    VERIFY( cn == 0 );
  
!   VERIFY( Cmp::count == 0 );
  }
  
  void
*************** test03()
*** 94,100 ****
    cit = cx.lower_bound(2L);
    VERIFY( cit != cx.end() && *cit == 3 );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 94,105 ----
    cit = cx.lower_bound(2L);
    VERIFY( cit != cx.end() && *cit == 3 );
  
!   VERIFY( Cmp::count == 0 );
! 
!   static_assert(std::is_same<decltype(it), test_type::iterator>::value,
!       "lower_bound returns iterator");
!   static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
!       "const lower_bound returns const_iterator");
  }
  
  void
*************** test04()
*** 112,118 ****
    cit = cx.upper_bound(5L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 117,128 ----
    cit = cx.upper_bound(5L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0 );
! 
!   static_assert(std::is_same<decltype(it), test_type::iterator>::value,
!       "upper_bound returns iterator");
!   static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
!       "const upper_bound returns const_iterator");
  }
  
  void
*************** test05()
*** 131,137 ****
    cit = cx.equal_range(2L);
    VERIFY( cit.first == cit.second && cit.first != cx.end() );
  
!   VERIFY( Cmp::count == 0);
  }
  
  
--- 141,154 ----
    cit = cx.equal_range(2L);
    VERIFY( cit.first == cit.second && cit.first != cx.end() );
  
!   VERIFY( Cmp::count == 0 );
! 
!   using pair = std::pair<test_type::iterator, test_type::iterator>;
!   static_assert(std::is_same<decltype(it), pair>::value,
!       "equal_range returns pair<iterator, iterator>");
!   using cpair = std::pair<test_type::const_iterator, test_type::const_iterator>;
!   static_assert(std::is_same<decltype(cit), cpair>::value,
!       "const equal_range returns pair<const_iterator, const_iterator>");
  }
  
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/set/allocator/71964.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/set/allocator/71964.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/set/allocator/71964.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/set/allocator/71964.cc	Sat Aug  6 12:21:51 2016
***************
*** 0 ****
--- 1,71 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <set>
+ #include <testsuite_hooks.h>
+ 
+ template<typename T>
+   struct mv_allocator
+   {
+     using value_type = T;
+     using size_type = unsigned;
+ 
+     mv_allocator()
+     : moved_to(false), moved_from(false) { }
+ 
+     template<typename U>
+       mv_allocator(const mv_allocator<U> & a)
+       : moved_to(a.moved_to), moved_from(a.moved_from) { }
+ 
+     mv_allocator(const mv_allocator &) = default;
+ 
+     mv_allocator(mv_allocator && a) noexcept : moved_to(true)
+     {
+       a.moved_from = true;
+     }
+ 
+     T* allocate(unsigned n) { return std::allocator<T>{}.allcoate(n); }
+     void deallocate(T* p, unsigned n) { std::allocator<T>{}.deallocate(p, n); }
+ 
+     bool moved_to;
+     bool moved_from;
+   };
+ 
+ template<typename T, typename U>
+ bool
+ operator==(const mv_allocator<T>&, const mv_allocator<U>&) { return true; }
+ 
+ template<typename T, typename U>
+ bool
+ operator!=(const mv_allocator<T>&, const mv_allocator<U>&) { return false; }
+ 
+ void
+ test01()
+ {
+   std::set<int, std::less<int>, mv_allocator<int>> s;
+   auto t = std::move(s);
+   VERIFY( s.get_allocator().moved_from );
+   VERIFY( t.get_allocator().moved_to );
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/set/cons/noexcept_default_construct.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/set/cons/noexcept_default_construct.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/set/cons/noexcept_default_construct.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/set/cons/noexcept_default_construct.cc	Wed Oct  5 13:43:58 2016
***************
*** 0 ****
--- 1,33 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <set>
+ 
+ using stype1 = std::set<int>;
+ static_assert(std::is_nothrow_default_constructible<stype1>::value, "Error");
+ 
+ struct cmp
+ {
+   cmp() { }
+   bool operator()(int, int) const;
+ };
+ 
+ using stype2 = std::set<int, cmp>;
+ static_assert( !std::is_nothrow_default_constructible<stype2>::value, "Error");
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/set/operations/2.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/set/operations/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/set/operations/2.cc	Tue Nov 10 18:08:50 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/set/operations/2.cc	Tue Feb 14 21:17:18 2017
*************** test01()
*** 53,59 ****
    cit = cx.find(2L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0);
  
    static_assert(std::is_same<decltype(it), test_type::iterator>::value,
        "find returns iterator");
--- 53,59 ----
    cit = cx.find(2L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0 );
  
    static_assert(std::is_same<decltype(it), test_type::iterator>::value,
        "find returns iterator");
*************** test02()
*** 76,82 ****
    cn = cx.count(2L);
    VERIFY( cn == 0 );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 76,82 ----
    cn = cx.count(2L);
    VERIFY( cn == 0 );
  
!   VERIFY( Cmp::count == 0 );
  }
  
  void
*************** test03()
*** 94,100 ****
    cit = cx.lower_bound(2L);
    VERIFY( cit != cx.end() && *cit == 3 );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 94,105 ----
    cit = cx.lower_bound(2L);
    VERIFY( cit != cx.end() && *cit == 3 );
  
!   VERIFY( Cmp::count == 0 );
! 
!   static_assert(std::is_same<decltype(it), test_type::iterator>::value,
!       "lower_bound returns iterator");
!   static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
!       "const lower_bound returns const_iterator");
  }
  
  void
*************** test04()
*** 112,118 ****
    cit = cx.upper_bound(5L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 117,128 ----
    cit = cx.upper_bound(5L);
    VERIFY( cit == cx.end() );
  
!   VERIFY( Cmp::count == 0 );
! 
!   static_assert(std::is_same<decltype(it), test_type::iterator>::value,
!       "upper_bound returns iterator");
!   static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
!       "const upper_bound returns const_iterator");
  }
  
  void
*************** test05()
*** 130,136 ****
    cit = cx.equal_range(2L);
    VERIFY( cit.first == cit.second && cit.first != cx.end() );
  
!   VERIFY( Cmp::count == 0);
  }
  
  void
--- 140,153 ----
    cit = cx.equal_range(2L);
    VERIFY( cit.first == cit.second && cit.first != cx.end() );
  
!   VERIFY( Cmp::count == 0 );
! 
!   using pair = std::pair<test_type::iterator, test_type::iterator>;
!   static_assert(std::is_same<decltype(it), pair>::value,
!       "equal_range returns pair<iterator, iterator>");
!   using cpair = std::pair<test_type::const_iterator, test_type::const_iterator>;
!   static_assert(std::is_same<decltype(cit), cpair>::value,
!       "const equal_range returns pair<const_iterator, const_iterator>");
  }
  
  void
*************** test06()
*** 150,155 ****
--- 167,194 ----
    s.find(i);
  }
  
+ void
+ test07()
+ {
+   // PR libstdc++/78273
+ 
+   struct C {
+     bool operator()(int l, int r) const { return l < r; }
+ 
+     struct Partition { };
+ 
+     bool operator()(int l, Partition) const { return l < 2; }
+     bool operator()(Partition, int r) const { return 4 < r; }
+ 
+     using is_transparent = void;
+   };
+ 
+   std::set<int, C> s{ 1, 2, 3, 4, 5 };
+ 
+   auto n = s.count(C::Partition{});
+   VERIFY( n == 3 );
+ }
+ 
  int
  main()
  {
*************** main()
*** 159,162 ****
--- 198,202 ----
    test04();
    test05();
    test06();
+   test07();
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/23_containers/unordered_map/cons/81891.cc gcc-5.5.0/libstdc++-v3/testsuite/23_containers/unordered_map/cons/81891.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/23_containers/unordered_map/cons/81891.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/23_containers/unordered_map/cons/81891.cc	Mon Sep  4 16:41:34 2017
***************
*** 0 ****
--- 1,68 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <unordered_map>
+ #include <testsuite_hooks.h>
+ #include <testsuite_allocator.h>
+ 
+ struct fails_on_copy {
+   fails_on_copy() = default;
+   fails_on_copy(const fails_on_copy&) { throw 0; };
+ };
+ 
+ using value_type = std::pair<int, fails_on_copy>;
+ 
+ void
+ test01()
+ {
+   value_type p;
+   try
+   {
+     std::unordered_map<int, fails_on_copy> umap(&p, &p + 1);
+   }
+   catch(...)
+   { }
+ }
+ 
+ void
+ test02()
+ {
+   using Alloc = __gnu_test::tracker_allocator<value_type>;
+   using std::hash;
+   using std::equal_to;
+ 
+   value_type p;
+   try
+   {
+     std::unordered_map<int, fails_on_copy, hash<int>, equal_to<int>, Alloc>
+ 	umap(&p, &p + 1);
+   }
+   catch(...)
+   { }
+ 
+   using counter = __gnu_test::tracker_allocator_counter;
+   VERIFY(counter::get_allocation_count() == counter::get_deallocation_count());
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/24_iterators/reverse_iterator/71771.cc gcc-5.5.0/libstdc++-v3/testsuite/24_iterators/reverse_iterator/71771.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/24_iterators/reverse_iterator/71771.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/24_iterators/reverse_iterator/71771.cc	Wed Nov 23 15:27:12 2016
***************
*** 0 ****
--- 1,46 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <iterator>
+ #include <testsuite_iterators.h>
+ 
+ // PR libstdc++/71771
+ 
+ template<typename Iter>
+ auto
+ diff2(std::reverse_iterator<Iter> it1, std::reverse_iterator<Iter> it2)
+ -> decltype(it1 - it2)
+ { return it1 - it2; }
+ 
+ template<typename Iter>
+ void
+ diff2(Iter, Iter)
+ { }
+ 
+ void
+ test01()
+ {
+   int i[2];
+   __gnu_test::test_container<int, __gnu_test::bidirectional_iterator_wrapper>
+     c(i, i+2);
+   using reverse_iterator
+     = std::reverse_iterator<__gnu_test::bidirectional_iterator_wrapper<int>>;
+   diff2(reverse_iterator(c.end()), reverse_iterator(c.begin()));
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/25_algorithms/search/78346.cc gcc-5.5.0/libstdc++-v3/testsuite/25_algorithms/search/78346.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/25_algorithms/search/78346.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/25_algorithms/search/78346.cc	Wed Feb  1 12:57:58 2017
***************
*** 0 ****
--- 1,118 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <algorithm>
+ #include <testsuite_hooks.h>
+ 
+ bool values[100];
+ 
+ unsigned next_id()
+ {
+   static unsigned counter = 0;
+   VERIFY(counter < 100);
+   return counter++;
+ }
+ 
+ struct value
+ {
+   int val;
+   const unsigned id;
+ 
+   value(int i = 0) : val(i), id(next_id()) { values[id] = true; }
+   value(const value& v) : val(v.val), id(next_id()) { values[id] = true; }
+   value& operator=(const value& v) { val = v.val; return *this; }
+   ~value() { values[id] = false; }
+ };
+ 
+ bool operator<(const value& lhs, const value& rhs)
+ {
+   if (!values[lhs.id])
+     throw lhs.id;
+   if (!values[rhs.id])
+     throw rhs.id;
+   return lhs.val < rhs.val;
+ }
+ 
+ bool operator==(const value& lhs, const value& rhs)
+ {
+   if (!values[lhs.id])
+     throw lhs.id;
+   if (!values[rhs.id])
+     throw rhs.id;
+   return lhs.val == rhs.val;
+ }
+ 
+ // A forward iterator that fails to meet the requirement that for any
+ // two dereferenceable forward iterators, a == b implies &*a == &*b
+ struct stashing_iterator
+ {
+   typedef std::forward_iterator_tag iterator_category;
+   typedef value value_type;
+   typedef value_type const* pointer;
+   typedef value_type const& reference;
+   typedef std::ptrdiff_t difference_type;
+ 
+   stashing_iterator() : ptr(), stashed() { }
+   stashing_iterator(pointer p) : ptr(p), stashed() { stash(); }
+   stashing_iterator(const stashing_iterator&) = default;
+   stashing_iterator& operator=(const stashing_iterator&) = default;
+ 
+   stashing_iterator& operator++()
+   {
+     ++ptr;
+     stash();
+     return *this;
+   }
+ 
+   stashing_iterator operator++(int)
+   {
+     stashing_iterator i = *this;
+     ++*this;
+     return i;
+   }
+ 
+   reference operator*() const { return stashed; }
+   pointer operator->() const { return &**this; }
+ 
+   bool operator==(const stashing_iterator& i) const { return ptr == i.ptr; }
+   bool operator!=(const stashing_iterator& i) const { return !(*this == i); }
+ 
+ private:
+   void stash()
+   {
+     if (ptr)
+       stashed = *ptr;
+   }
+ 
+   pointer ptr;
+   value_type stashed;
+ };
+ 
+ void
+ test01()
+ {
+   value s[] = { 0, 1, 2, 3, 4, 5 };
+   std::search(s, s+6, stashing_iterator(s), stashing_iterator(s+4));
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/25_algorithms/sort/78991.cc gcc-5.5.0/libstdc++-v3/testsuite/25_algorithms/sort/78991.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/25_algorithms/sort/78991.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/25_algorithms/sort/78991.cc	Mon Jan  9 11:05:01 2017
***************
*** 0 ****
--- 1,41 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++14" }
+ // { dg-do compile }
+ 
+ // PR 78991
+ // This failed to compile with Clang because the result_of expression causes
+ // instantiation of _Iter_comp_iter::operator() outside the immediate context.
+ 
+ #include <algorithm>
+ 
+ struct function
+ {
+   function() = default;
+ 
+   template<typename F, typename = std::result_of_t<F&(int, int)>>
+     function(F) { }
+ 
+   bool operator()(int x, int y) const { return x < y; }
+ };
+ 
+ int main()
+ {
+   int a[2]{ 2, 1 };
+   std::sort(a, a+2, function{});
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/26_numerics/random/default_random_engine.cc gcc-5.5.0/libstdc++-v3/testsuite/26_numerics/random/default_random_engine.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/26_numerics/random/default_random_engine.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/26_numerics/random/default_random_engine.cc	Mon Oct 17 17:03:44 2016
***************
*** 20,26 ****
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
! // 26.4.5 Engines and egine adaptors with predefined parameters [rand.predef]
  // 26.4.5 [10]
  
  #include <random>
--- 20,26 ----
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
! // 26.4.5 Engines and engine adaptors with predefined parameters [rand.predef]
  // 26.4.5 [10]
  
  #include <random>
*************** test01()
*** 38,44 ****
    std::minstd_rand0 b;
    b.discard(9999);
  
!   assert( a() == b() );
  }
  
  int main()
--- 38,44 ----
    std::minstd_rand0 b;
    b.discard(9999);
  
!   VERIFY( a() == b() );
  }
  
  int main()
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/27_io/basic_fstream/53984.cc gcc-5.5.0/libstdc++-v3/testsuite/27_io/basic_fstream/53984.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/27_io/basic_fstream/53984.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/27_io/basic_fstream/53984.cc	Mon Sep  4 17:09:01 2017
***************
*** 0 ****
--- 1,64 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-require-fileio "" }
+ 
+ // PR libstdc++/53984
+ 
+ #include <fstream>
+ #include <testsuite_hooks.h>
+ 
+ void
+ test01()
+ {
+   std::ifstream in(".");
+   if (in)
+   {
+     char c;
+     if (in.get(c))
+     {
+       // Reading a directory doesn't produce an error on this target
+       // so the formatted input functions below wouldn't fail anyway
+       // (see PR libstdc++/81808).
+       return;
+     }
+     int x;
+     in.clear();
+     // Formatted input function should set badbit, but not throw:
+     in >> x;
+     VERIFY( in.bad() );
+ 
+     in.clear();
+     in.exceptions(std::ios::badbit);
+     try
+     {
+       // Formatted input function should set badbit, and throw:
+       in >> x;
+       VERIFY( false );
+     }
+     catch (const std::exception&)
+     {
+       VERIFY( in.bad() );
+     }
+   }
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/27_io/basic_istream/sentry/char/53984.cc gcc-5.5.0/libstdc++-v3/testsuite/27_io/basic_istream/sentry/char/53984.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/27_io/basic_istream/sentry/char/53984.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/27_io/basic_istream/sentry/char/53984.cc	Mon Sep  4 17:09:01 2017
***************
*** 0 ****
--- 1,41 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ #include <streambuf>
+ #include <istream>
+ #include <testsuite_hooks.h>
+ 
+ struct SB : std::streambuf
+ {
+   virtual int_type underflow() { throw 1; }
+ };
+ 
+ void
+ test01()
+ {
+   SB sb;
+   std::istream is(&sb);
+   int i;
+   is >> i;
+   VERIFY( is.bad() );
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/27_io/basic_stringstream/assign/81338.cc gcc-5.5.0/libstdc++-v3/testsuite/27_io/basic_stringstream/assign/81338.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/27_io/basic_stringstream/assign/81338.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/27_io/basic_stringstream/assign/81338.cc	Mon Sep  4 16:41:25 2017
***************
*** 0 ****
--- 1,40 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ 
+ #include <sstream>
+ #include <testsuite_hooks.h>
+ 
+ void
+ test01()
+ {
+   std::stringstream ss;
+   for (int i = 0; i < 100; ++i)
+   {
+     ss << 'a';
+     VERIFY( static_cast<bool>(ss) );
+     VERIFY( ss.str() == "a" );
+     ss = std::stringstream();
+   }
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/iter.cc gcc-5.5.0/libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/iter.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/iter.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/28_regex/basic_regex/ctors/basic/iter.cc	Wed Sep 13 15:28:18 2017
***************
*** 0 ****
--- 1,32 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ 
+ #include <regex>
+ #include <testsuite_iterators.h>
+ 
+ void
+ test01()
+ {
+   char s[] = "";
+   __gnu_test::test_container<char, __gnu_test::forward_iterator_wrapper>
+     c(s, s+1);
+   std::regex r1(c.begin(), c.end());
+   std::regex r2(c.begin(), c.end(), std::regex_constants::grep);
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/28_regex/regression.cc gcc-5.5.0/libstdc++-v3/testsuite/28_regex/regression.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/28_regex/regression.cc	Wed Feb 17 04:38:15 2016
--- gcc-5.5.0/libstdc++-v3/testsuite/28_regex/regression.cc	Thu May 18 15:30:42 2017
*************** test02()
*** 48,58 ****
--- 48,80 ----
    VERIFY(std::regex_search("/abcd", rx));
  }
  
+ // PR libstdc++/78236
+ void
+ test06()
+ {
+   char const s[] = "afoo";
+   std::basic_regex<char> r("(f+)");
+   {
+     std::cregex_iterator i(s, s+sizeof(s), r);
+     std::cregex_iterator j(s, s+sizeof(s), r);
+     VERIFY(i == j);
+   }
+   // The iterator manipulation code must be repeated in the same scope
+   // to expose the undefined read during the execution of the ==
+   // operator (stack location reuse)
+   {
+     std::cregex_iterator i(s, s+sizeof(s), r);
+     std::cregex_iterator j;
+     VERIFY(!(i == j));
+   }
+ }
+ 
  int
  main()
  {
    test01();
    test02();
+   test06();
    return 0;
  }
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/29_atomics/atomic/69301.cc gcc-5.5.0/libstdc++-v3/testsuite/29_atomics/atomic/69301.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/29_atomics/atomic/69301.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/29_atomics/atomic/69301.cc	Tue Feb 14 21:17:29 2017
***************
*** 0 ****
--- 1,57 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11" }
+ // { dg-require-atomic-builtins "" }
+ 
+ #include <atomic>
+ #include <testsuite_hooks.h>
+ 
+ struct NonDefaultConstructible
+ {
+   NonDefaultConstructible(int i) : val(i) { }
+   int val;
+ };
+ 
+ template class std::atomic<NonDefaultConstructible>;
+ 
+ void
+ test01()
+ {
+   std::atomic<NonDefaultConstructible> a(1);
+   const auto n1 = a.exchange(2);
+   VERIFY( n1.val == 1 );
+   const auto n2 = a.load();
+   VERIFY( n2.val == 2 );
+ }
+ 
+ void
+ test02()
+ {
+   volatile std::atomic<NonDefaultConstructible> a(1);
+   const auto n1 = a.exchange(2);
+   VERIFY( n1.val == 1 );
+   const auto n2 = a.load();
+   VERIFY( n2.val == 2 );
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/29_atomics/headers/atomic/macros.cc gcc-5.5.0/libstdc++-v3/testsuite/29_atomics/headers/atomic/macros.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/29_atomics/headers/atomic/macros.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/29_atomics/headers/atomic/macros.cc	Mon Dec 12 16:36:25 2016
***************
*** 1,5 ****
  // { dg-options "-std=gnu++11" }
! // { dg-do compile }
  
  // Copyright (C) 2008-2015 Free Software Foundation, Inc.
  //
--- 1,5 ----
  // { dg-options "-std=gnu++11" }
! // { dg-do preprocess }
  
  // Copyright (C) 2008-2015 Free Software Foundation, Inc.
  //
***************
*** 22,63 ****
--- 22,82 ----
  
  #ifndef ATOMIC_BOOL_LOCK_FREE 
  # error "ATOMIC_BOOL_LOCK_FREE must be a macro"
+ #elif ATOMIC_BOOL_LOCK_FREE != 1 && ATOMIC_BOOL_LOCK_FREE != 2
+ # error "ATOMIC_BOOL_LOCK_FREE must be 1 or 2"
  #endif
  
  #ifndef ATOMIC_CHAR_LOCK_FREE 
  # error "ATOMIC_CHAR_LOCK_FREE must be a macro"
+ #elif ATOMIC_CHAR_LOCK_FREE != 1 && ATOMIC_CHAR_LOCK_FREE != 2
+ # error "ATOMIC_CHAR_LOCK_FREE must be 1 or 2"
  #endif
  
  #ifndef ATOMIC_CHAR16_T_LOCK_FREE 
  # error "ATOMIC_CHAR16_T_LOCK_FREE must be a macro"
+ #elif ATOMIC_CHAR16_T_LOCK_FREE != 1 && ATOMIC_CHAR16_T_LOCK_FREE != 2
  #endif
  
  #ifndef ATOMIC_CHAR32_T_LOCK_FREE 
  # error "ATOMIC_CHAR32_T_LOCK_FREE must be a macro"
+ #elif ATOMIC_CHAR32_T_LOCK_FREE != 1 && ATOMIC_CHAR32_T_LOCK_FREE != 2
+ # error "ATOMIC_CHAR32_T_LOCK_FREE must be 1 or 2"
  #endif
  
  #ifndef ATOMIC_WCHAR_T_LOCK_FREE 
  # error "ATOMIC_WCHAR_T_LOCK_FREE must be a macro"
+ #elif ATOMIC_WCHAR_T_LOCK_FREE != 1 && ATOMIC_WCHAR_T_LOCK_FREE != 2
+ # error "ATOMIC_WCHAR_T_LOCK_FREE must be 1 or 2"
  #endif
  
  #ifndef ATOMIC_SHORT_LOCK_FREE 
  # error "ATOMIC_SHORT_LOCK_FREE must be a macro"
+ #elif ATOMIC_SHORT_LOCK_FREE != 1 && ATOMIC_SHORT_LOCK_FREE != 2
+ # error "ATOMIC_SHORT_LOCK_FREE must be 1 or 2"
  #endif
  
  #ifndef ATOMIC_INT_LOCK_FREE 
  # error "ATOMIC_INT_LOCK_FREE must be a macro"
+ #elif ATOMIC_INT_LOCK_FREE != 1 && ATOMIC_INT_LOCK_FREE != 2
+ # error "ATOMIC_INT_LOCK_FREE must be 1 or 2"
  #endif
  
  #ifndef ATOMIC_LONG_LOCK_FREE 
  # error "ATOMIC_LONG_LOCK_FREE must be a macro"
+ #elif ATOMIC_LONG_LOCK_FREE != 1 && ATOMIC_LONG_LOCK_FREE != 2
+ # error "ATOMIC_LONG_LOCK_FREE must be 1 or 2"
  #endif
  
  #ifndef ATOMIC_LLONG_LOCK_FREE 
  # error "ATOMIC_LLONG_LOCK_FREE must be a macro"
+ #elif ATOMIC_LLONG_LOCK_FREE != 1 && ATOMIC_LLONG_LOCK_FREE != 2
+ # error "ATOMIC_LLONG_LOCK_FREE must be 1 or 2"
  #endif
  
  #ifndef ATOMIC_POINTER_LOCK_FREE 
  # error "ATOMIC_POINTER_LOCK_FREE must be a macro"
+ #elif ATOMIC_POINTER_LOCK_FREE != 1 && ATOMIC_POINTER_LOCK_FREE != 2
+ # error "ATOMIC_POINTER_LOCK_FREE must be 1 or 2"
  #endif
  
  #ifndef ATOMIC_FLAG_INIT
***************
*** 67,115 ****
  #ifndef ATOMIC_VAR_INIT
      #error "ATOMIC_VAR_INIT_must_be_a_macro"
  #endif
- 
- 
- extern void abort(void);
- 
- int main ()
- {
- #if (ATOMIC_BOOL_LOCK_FREE != 1 && ATOMIC_BOOL_LOCK_FREE != 2)
-    abort ();
- #endif
- 
- #if (ATOMIC_CHAR_LOCK_FREE != 1 && ATOMIC_CHAR_LOCK_FREE != 2)
-    abort ();
- #endif
- 
- #if (ATOMIC_CHAR16_T_LOCK_FREE != 1 && ATOMIC_CHAR16_T_LOCK_FREE != 2)
-    abort ();
- #endif
- 
- #if (ATOMIC_CHAR32_T_LOCK_FREE != 1 && ATOMIC_CHAR32_T_LOCK_FREE != 2)
-    abort ();
- #endif
- 
- #if (ATOMIC_WCHAR_T_LOCK_FREE != 1 && ATOMIC_WCHAR_T_LOCK_FREE != 2)
-    abort ();
- #endif
- 
- #if (ATOMIC_SHORT_LOCK_FREE != 1 && ATOMIC_SHORT_LOCK_FREE != 2)
-    abort ();
- #endif
- 
- #if (ATOMIC_INT_LOCK_FREE != 1 && ATOMIC_INT_LOCK_FREE != 2)
-    abort ();
- #endif
- 
- #if (ATOMIC_LONG_LOCK_FREE != 1 && ATOMIC_LONG_LOCK_FREE != 2)
-    abort ();
- #endif
- 
- #if (ATOMIC_LLONG_LOCK_FREE != 1 && ATOMIC_LLONG_LOCK_FREE != 2)
-    abort ();
- #endif
- 
- #if (ATOMIC_POINTER_LOCK_FREE != 1 && ATOMIC_POINTER_LOCK_FREE != 2)
-    abort ();
- #endif
- }
--- 86,88 ----
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/30_threads/thread/cons/lwg2097.cc gcc-5.5.0/libstdc++-v3/testsuite/30_threads/thread/cons/lwg2097.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/30_threads/thread/cons/lwg2097.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/30_threads/thread/cons/lwg2097.cc	Mon Jan  9 11:09:09 2017
***************
*** 0 ****
--- 1,30 ----
+ // { dg-options "-std=gnu++11" }
+ // { dg-do compile }
+ // { dg-require-cstdint "" }
+ // { dg-require-gthreads "" }
+ 
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ #include <thread>
+ 
+ using std::thread;
+ using std::is_constructible;
+ 
+ static_assert( !is_constructible<thread, thread&>::value, "" );
+ static_assert( !is_constructible<thread, const thread&>::value, "" );
+ static_assert( !is_constructible<thread, const thread>::value, "" );
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/Makefile.am gcc-5.5.0/libstdc++-v3/testsuite/Makefile.am
*** gcc-5.4.0/libstdc++-v3/testsuite/Makefile.am	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/Makefile.am	Tue Nov 22 18:19:58 2016
*************** $(check_DEJAGNU_normal_targets): check-D
*** 117,123 ****
  check-DEJAGNU $(check_DEJAGNU_normal_targets): check-DEJAGNU%: site.exp
  	$(if $*,@)AR="$(AR)"; export AR; \
  	RANLIB="$(RANLIB)"; export RANLIB; \
! 	if [ -z "$*" ] && [ "$(filter -j, $(MFLAGS))" = "-j" ]; then \
  	  rm -rf normal-parallel || true; \
  	  mkdir normal-parallel; \
  	  $(MAKE) $(AM_MAKEFLAGS) $(check_DEJAGNU_normal_targets); \
--- 117,123 ----
  check-DEJAGNU $(check_DEJAGNU_normal_targets): check-DEJAGNU%: site.exp
  	$(if $*,@)AR="$(AR)"; export AR; \
  	RANLIB="$(RANLIB)"; export RANLIB; \
! 	if [ -z "$*" ] && [ -n "$(filter -j%, $(MFLAGS))" ]; then \
  	  rm -rf normal-parallel || true; \
  	  mkdir normal-parallel; \
  	  $(MAKE) $(AM_MAKEFLAGS) $(check_DEJAGNU_normal_targets); \
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/Makefile.in gcc-5.5.0/libstdc++-v3/testsuite/Makefile.in
*** gcc-5.4.0/libstdc++-v3/testsuite/Makefile.in	Tue Aug 18 17:58:06 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/Makefile.in	Tue Nov 22 18:19:58 2016
*************** $(check_DEJAGNU_normal_targets): check-D
*** 597,603 ****
  check-DEJAGNU $(check_DEJAGNU_normal_targets): check-DEJAGNU%: site.exp
  	$(if $*,@)AR="$(AR)"; export AR; \
  	RANLIB="$(RANLIB)"; export RANLIB; \
! 	if [ -z "$*" ] && [ "$(filter -j, $(MFLAGS))" = "-j" ]; then \
  	  rm -rf normal-parallel || true; \
  	  mkdir normal-parallel; \
  	  $(MAKE) $(AM_MAKEFLAGS) $(check_DEJAGNU_normal_targets); \
--- 597,603 ----
  check-DEJAGNU $(check_DEJAGNU_normal_targets): check-DEJAGNU%: site.exp
  	$(if $*,@)AR="$(AR)"; export AR; \
  	RANLIB="$(RANLIB)"; export RANLIB; \
! 	if [ -z "$*" ] && [ -n "$(filter -j%, $(MFLAGS))" ]; then \
  	  rm -rf normal-parallel || true; \
  	  mkdir normal-parallel; \
  	  $(MAKE) $(AM_MAKEFLAGS) $(check_DEJAGNU_normal_targets); \
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/abi/header_cxxabi.c gcc-5.5.0/libstdc++-v3/testsuite/abi/header_cxxabi.c
*** gcc-5.4.0/libstdc++-v3/testsuite/abi/header_cxxabi.c	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/abi/header_cxxabi.c	Thu May 18 15:31:41 2017
***************
*** 1,4 ****
--- 1,5 ----
  // { dg-do compile }
+ // { dg-skip-if "invalid options for C" { *-*-* } { "-std=c++??" "-std=gnu++??" } }
  // { dg-options "-x c" }
  // Copyright (C) 2006-2015 Free Software Foundation, Inc.
  //
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/algorithm/sample.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/algorithm/sample.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/algorithm/sample.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/algorithm/sample.cc	Mon Oct 17 17:03:09 2016
***************
*** 22,27 ****
--- 22,28 ----
  #include <sstream>
  #include <forward_list>
  #include <vector>
+ #include <random>
  #include <testsuite_hooks.h>
  
  std::mt19937 rng;
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/any/misc/any_cast.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/any/misc/any_cast.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/any/misc/any_cast.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/any/misc/any_cast.cc	Tue Feb 14 21:17:34 2017
*************** void test02()
*** 77,84 ****
--- 77,97 ----
    }
  }
  
+ void test04()
+ {
+   // PR libstdc++/69321
+   struct noncopyable {
+     noncopyable(noncopyable const&) = delete;
+   };
+ 
+   any a;
+   auto p = any_cast<noncopyable>(&a);
+   VERIFY( p == nullptr );
+ }
+ 
  int main()
  {
    test01();
    test02();
+   test04();
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/any/misc/any_cast_neg.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/any/misc/any_cast_neg.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/any/misc/any_cast_neg.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/any/misc/any_cast_neg.cc	Tue Feb 14 21:17:34 2017
*************** void test01()
*** 26,30 ****
    using std::experimental::any_cast;
  
    const any y(1);
!   any_cast<int&>(y); // { dg-error "qualifiers" "" { target { *-*-* } } 310 }
  }
--- 26,30 ----
    using std::experimental::any_cast;
  
    const any y(1);
!   any_cast<int&>(y); // { dg-error "qualifiers" "" { target { *-*-* } } 304 }
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/any/typedefs.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/any/typedefs.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/any/typedefs.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/any/typedefs.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/chrono/value.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/chrono/value.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/chrono/value.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/chrono/value.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/directory_iterator.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/directory_iterator.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/directory_iterator.cc	Wed May 25 15:43:17 2016
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/directory_iterator.cc	Mon Dec 12 15:00:43 2016
*************** test01()
*** 34,47 ****
    const auto p = __gnu_test::nonexistent_path();
    fs::directory_iterator iter(p, ec);
    VERIFY( ec );
!   VERIFY( iter != fs::directory_iterator() );
  
    // Test empty directory.
    create_directory(p, fs::current_path(), ec);
    VERIFY( !ec );
    iter = fs::directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter == fs::directory_iterator() );
  
    // Test non-empty directory.
    create_directory_symlink(p, p / "l", ec);
--- 34,47 ----
    const auto p = __gnu_test::nonexistent_path();
    fs::directory_iterator iter(p, ec);
    VERIFY( ec );
!   VERIFY( iter == end(iter) );
  
    // Test empty directory.
    create_directory(p, fs::current_path(), ec);
    VERIFY( !ec );
    iter = fs::directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter == end(iter) );
  
    // Test non-empty directory.
    create_directory_symlink(p, p / "l", ec);
*************** test01()
*** 51,70 ****
    VERIFY( iter != fs::directory_iterator() );
    VERIFY( iter->path() == p/"l" );
    ++iter;
!   VERIFY( iter == fs::directory_iterator() );
  
    // Test inaccessible directory.
    permissions(p, fs::perms::none, ec);
    VERIFY( !ec );
    iter = fs::directory_iterator(p, ec);
    VERIFY( ec );
!   VERIFY( iter != fs::directory_iterator() );
  
    // Test inaccessible directory, skipping permission denied.
    const auto opts = fs::directory_options::skip_permission_denied;
    iter = fs::directory_iterator(p, opts, ec);
    VERIFY( !ec );
!   VERIFY( iter == fs::directory_iterator() );
  
    permissions(p, fs::perms::owner_all, ec);
    remove_all(p, ec);
--- 51,70 ----
    VERIFY( iter != fs::directory_iterator() );
    VERIFY( iter->path() == p/"l" );
    ++iter;
!   VERIFY( iter == end(iter) );
  
    // Test inaccessible directory.
    permissions(p, fs::perms::none, ec);
    VERIFY( !ec );
    iter = fs::directory_iterator(p, ec);
    VERIFY( ec );
!   VERIFY( iter == end(iter) );
  
    // Test inaccessible directory, skipping permission denied.
    const auto opts = fs::directory_options::skip_permission_denied;
    iter = fs::directory_iterator(p, opts, ec);
    VERIFY( !ec );
!   VERIFY( iter == end(iter) );
  
    permissions(p, fs::perms::owner_all, ec);
    remove_all(p, ec);
*************** test02()
*** 84,95 ****
    // Test post-increment (libstdc++/71005)
    auto iter = fs::directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter != fs::directory_iterator() );
    const auto entry1 = *iter;
    const auto entry2 = *iter++;
    VERIFY( entry1 == entry2 );
    VERIFY( entry1.path() == p/"l" );
!   VERIFY( iter == fs::directory_iterator() );
  
    remove_all(p, ec);
  }
--- 84,95 ----
    // Test post-increment (libstdc++/71005)
    auto iter = fs::directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter != end(iter) );
    const auto entry1 = *iter;
    const auto entry2 = *iter++;
    VERIFY( entry1 == entry2 );
    VERIFY( entry1.path() == p/"l" );
!   VERIFY( iter == end(iter) );
  
    remove_all(p, ec);
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/pop.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/pop.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/pop.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/pop.cc	Mon Dec 12 15:00:43 2016
***************
*** 0 ****
--- 1,107 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-lstdc++fs -std=gnu++11" }
+ // { dg-require-filesystem-ts "" }
+ 
+ #include <experimental/filesystem>
+ #include <testsuite_hooks.h>
+ #include <testsuite_fs.h>
+ 
+ namespace fs = std::experimental::filesystem;
+ 
+ void
+ test01()
+ {
+   std::error_code ec;
+   fs::recursive_directory_iterator dir;
+   dir.pop(ec);  // This is undefined, but our implementation
+   VERIFY( ec ); // checks and returns an error.
+   VERIFY( dir == end(dir) );
+ 
+   std::error_code ec2;
+   try
+   {
+     dir.pop();
+   }
+   catch (const fs::filesystem_error& ex)
+   {
+     ec2 = ex.code();
+   }
+   VERIFY( ec2 == ec );
+ }
+ 
+ void
+ test02()
+ {
+   std::error_code ec = make_error_code(std::errc::interrupted);
+   const auto p = __gnu_test::nonexistent_path();
+   create_directories(p / "d1/d2/d3");
+   for (int i = 0; i < 3; ++i)
+   {
+     fs::recursive_directory_iterator dir(p);
+     std::advance(dir, i);
+     VERIFY( dir.depth() == i );
+     dir.pop(ec);
+     VERIFY( !ec );
+     VERIFY( dir == end(dir) );
+ 
+     dir = fs::recursive_directory_iterator(p);
+     std::advance(dir, i);
+     VERIFY( dir.depth() == i );
+     dir.pop();
+     VERIFY( dir == end(dir) );
+   }
+   remove_all(p, ec);
+ }
+ 
+ void
+ test03()
+ {
+   std::error_code ec = make_error_code(std::errc::interrupted);
+   const auto p = __gnu_test::nonexistent_path();
+   create_directories(p / "d1/d2/d3");
+   create_directories(p / "d1/d2/e3");
+   create_directories(p / "d1/e2/d3");
+   for (int i = 0; i < 3; ++i)
+   {
+     fs::recursive_directory_iterator dir(p);
+     std::advance(dir, i);
+     int expected_depth = i;
+     VERIFY( dir.depth() == expected_depth );
+     dir.pop(ec);
+     VERIFY( !ec );
+     if (dir != end(dir))
+       VERIFY( dir.depth() == (expected_depth - 1) );
+ 
+     dir = fs::recursive_directory_iterator(p);
+     std::advance(dir, i);
+     VERIFY( dir.depth() == i );
+     dir.pop();
+     if (dir != end(dir))
+       VERIFY( dir.depth() == (i -1) );
+   }
+   remove_all(p, ec);
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+   test03();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/recursive_directory_iterator.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/recursive_directory_iterator.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/recursive_directory_iterator.cc	Wed May 25 15:43:17 2016
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/iterators/recursive_directory_iterator.cc	Mon Dec 12 15:00:43 2016
*************** test01()
*** 34,72 ****
    const auto p = __gnu_test::nonexistent_path();
    fs::recursive_directory_iterator iter(p, ec);
    VERIFY( ec );
!   VERIFY( iter != fs::recursive_directory_iterator() );
  
    // Test empty directory.
    create_directory(p, fs::current_path(), ec);
    VERIFY( !ec );
    iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter == fs::recursive_directory_iterator() );
  
    // Test non-empty directory.
    create_directories(p / "d1/d2");
    VERIFY( !ec );
    iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter != fs::recursive_directory_iterator() );
    VERIFY( iter->path() == p/"d1" );
    ++iter;
    VERIFY( iter->path() == p/"d1/d2" );
    ++iter;
!   VERIFY( iter == fs::recursive_directory_iterator() );
  
    // Test inaccessible directory.
    permissions(p, fs::perms::none, ec);
    VERIFY( !ec );
    iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( ec );
!   VERIFY( iter != fs::recursive_directory_iterator() );
  
    // Test inaccessible directory, skipping permission denied.
    const auto opts = fs::directory_options::skip_permission_denied;
    iter = fs::recursive_directory_iterator(p, opts, ec);
    VERIFY( !ec );
!   VERIFY( iter == fs::recursive_directory_iterator() );
  
    // Test inaccessible sub-directory.
    permissions(p, fs::perms::owner_all, ec);
--- 34,72 ----
    const auto p = __gnu_test::nonexistent_path();
    fs::recursive_directory_iterator iter(p, ec);
    VERIFY( ec );
!   VERIFY( iter == end(iter) );
  
    // Test empty directory.
    create_directory(p, fs::current_path(), ec);
    VERIFY( !ec );
    iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter == end(iter) );
  
    // Test non-empty directory.
    create_directories(p / "d1/d2");
    VERIFY( !ec );
    iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter != end(iter) );
    VERIFY( iter->path() == p/"d1" );
    ++iter;
    VERIFY( iter->path() == p/"d1/d2" );
    ++iter;
!   VERIFY( iter == end(iter) );
  
    // Test inaccessible directory.
    permissions(p, fs::perms::none, ec);
    VERIFY( !ec );
    iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( ec );
!   VERIFY( iter == end(iter) );
  
    // Test inaccessible directory, skipping permission denied.
    const auto opts = fs::directory_options::skip_permission_denied;
    iter = fs::recursive_directory_iterator(p, opts, ec);
    VERIFY( !ec );
!   VERIFY( iter == end(iter) );
  
    // Test inaccessible sub-directory.
    permissions(p, fs::perms::owner_all, ec);
*************** test01()
*** 75,97 ****
    VERIFY( !ec );
    iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter != fs::recursive_directory_iterator() );
    VERIFY( iter->path() == p/"d1" );
    ++iter;              // should recurse into d1
    VERIFY( iter->path() == p/"d1/d2" );
    iter.increment(ec);  // should fail to recurse into p/d1/d2
    VERIFY( ec );
  
    // Test inaccessible sub-directory, skipping permission denied.
    iter = fs::recursive_directory_iterator(p, opts, ec);
    VERIFY( !ec );
!   VERIFY( iter != fs::recursive_directory_iterator() );
    VERIFY( iter->path() == p/"d1" );
    ++iter;              // should recurse into d1
    VERIFY( iter->path() == p/"d1/d2" );
    iter.increment(ec);  // should fail to recurse into p/d1/d2, so skip it
    VERIFY( !ec );
!   VERIFY( iter == fs::recursive_directory_iterator() );
  
    permissions(p/"d1/d2", fs::perms::owner_all, ec);
    remove_all(p, ec);
--- 75,98 ----
    VERIFY( !ec );
    iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter != end(iter) );
    VERIFY( iter->path() == p/"d1" );
    ++iter;              // should recurse into d1
    VERIFY( iter->path() == p/"d1/d2" );
    iter.increment(ec);  // should fail to recurse into p/d1/d2
    VERIFY( ec );
+   VERIFY( iter == end(iter) );
  
    // Test inaccessible sub-directory, skipping permission denied.
    iter = fs::recursive_directory_iterator(p, opts, ec);
    VERIFY( !ec );
!   VERIFY( iter != end(iter) );
    VERIFY( iter->path() == p/"d1" );
    ++iter;              // should recurse into d1
    VERIFY( iter->path() == p/"d1/d2" );
    iter.increment(ec);  // should fail to recurse into p/d1/d2, so skip it
    VERIFY( !ec );
!   VERIFY( iter == end(iter) );
  
    permissions(p/"d1/d2", fs::perms::owner_all, ec);
    remove_all(p, ec);
*************** test02()
*** 110,116 ****
    // Test post-increment (libstdc++/71005)
    auto iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter != fs::recursive_directory_iterator() );
    const auto entry1 = *iter;
    const auto entry2 = *iter++;
    VERIFY( entry1 == entry2 );
--- 111,117 ----
    // Test post-increment (libstdc++/71005)
    auto iter = fs::recursive_directory_iterator(p, ec);
    VERIFY( !ec );
!   VERIFY( iter != end(iter) );
    const auto entry1 = *iter;
    const auto entry2 = *iter++;
    VERIFY( entry1 == entry2 );
*************** test02()
*** 119,125 ****
    const auto entry4 = *iter++;
    VERIFY( entry3 == entry4 );
    VERIFY( entry3.path() == p/"d1/d2" );
!   VERIFY( iter == fs::recursive_directory_iterator() );
  
    remove_all(p, ec);
  }
--- 120,126 ----
    const auto entry4 = *iter++;
    VERIFY( entry3 == entry4 );
    VERIFY( entry3.path() == p/"d1/d2" );
!   VERIFY( iter == end(iter) );
  
    remove_all(p, ec);
  }
*************** test04()
*** 150,156 ****
  
    // libstdc++/71004
    const fs::recursive_directory_iterator it;
!   VERIFY( it == fs::recursive_directory_iterator() );
  }
  
  void
--- 151,157 ----
  
    // libstdc++/71004
    const fs::recursive_directory_iterator it;
!   VERIFY( it == end(it) );
  }
  
  void
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/copy.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/copy.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/copy.cc	Wed May 25 15:42:40 2016
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/copy.cc	Mon Dec 12 15:00:43 2016
***************
*** 21,27 ****
  // 15.3 Copy [fs.op.copy]
  
  #include <experimental/filesystem>
- #include <fstream>
  #include <testsuite_fs.h>
  #include <testsuite_hooks.h>
  
--- 21,26 ----
*************** test01()
*** 44,57 ****
    fs::copy(".", ".", fs::copy_options::none, ec);
    VERIFY( ec );
  
!   std::ofstream{p.native()};
    VERIFY( fs::is_directory(".") );
    VERIFY( fs::is_regular_file(p) );
    ec.clear();
    fs::copy(".", p, fs::copy_options::none, ec);
    VERIFY( ec );
  
!   remove(p, ec);
  }
  
  // Test is_symlink(f) case.
--- 43,67 ----
    fs::copy(".", ".", fs::copy_options::none, ec);
    VERIFY( ec );
  
!   __gnu_test::scoped_file f(p);
    VERIFY( fs::is_directory(".") );
    VERIFY( fs::is_regular_file(p) );
    ec.clear();
    fs::copy(".", p, fs::copy_options::none, ec);
    VERIFY( ec );
  
!   auto to = __gnu_test::nonexistent_path();
!   ec.clear();
!   auto opts = fs::copy_options::create_symlinks;
!   fs::copy("/", to, opts, ec);
!   VERIFY( ec == std::make_error_code(std::errc::is_a_directory) );
!   VERIFY( !exists(to) );
! 
!   ec.clear();
!   opts != fs::copy_options::recursive;
!   fs::copy("/", to, opts, ec);
!   VERIFY( ec == std::make_error_code(std::errc::is_a_directory) );
!   VERIFY( !exists(to) );
  }
  
  // Test is_symlink(f) case.
*************** test02()
*** 62,90 ****
  
    auto from = __gnu_test::nonexistent_path();
    auto to = __gnu_test::nonexistent_path();
!   std::error_code ec;
  
    fs::create_symlink(".", from, ec);
    VERIFY( !ec );
    VERIFY( fs::exists(from) );
  
    fs::copy(from, to, fs::copy_options::skip_symlinks, ec);
    VERIFY( !ec );
    VERIFY( !fs::exists(to) );
  
    fs::copy(from, to, fs::copy_options::skip_symlinks, ec);
    VERIFY( !ec );
    VERIFY( !fs::exists(to) );
  
    fs::copy(from, to,
             fs::copy_options::skip_symlinks|fs::copy_options::copy_symlinks,
             ec);
    VERIFY( !ec );
    VERIFY( !fs::exists(to) );
  
    fs::copy(from, to, fs::copy_options::copy_symlinks, ec);
    VERIFY( !ec );
    VERIFY( fs::exists(to) );
  
    fs::copy(from, to, fs::copy_options::copy_symlinks, ec);
    VERIFY( ec );
--- 72,106 ----
  
    auto from = __gnu_test::nonexistent_path();
    auto to = __gnu_test::nonexistent_path();
!   std::error_code ec, bad = std::make_error_code(std::errc::invalid_argument);
  
+   ec = bad;
    fs::create_symlink(".", from, ec);
    VERIFY( !ec );
    VERIFY( fs::exists(from) );
  
+   ec = bad;
    fs::copy(from, to, fs::copy_options::skip_symlinks, ec);
    VERIFY( !ec );
    VERIFY( !fs::exists(to) );
  
+   ec = bad;
    fs::copy(from, to, fs::copy_options::skip_symlinks, ec);
    VERIFY( !ec );
    VERIFY( !fs::exists(to) );
  
+   ec = bad;
    fs::copy(from, to,
             fs::copy_options::skip_symlinks|fs::copy_options::copy_symlinks,
             ec);
    VERIFY( !ec );
    VERIFY( !fs::exists(to) );
  
+   ec = bad;
    fs::copy(from, to, fs::copy_options::copy_symlinks, ec);
    VERIFY( !ec );
    VERIFY( fs::exists(to) );
+   VERIFY( is_symlink(to) );
  
    fs::copy(from, to, fs::copy_options::copy_symlinks, ec);
    VERIFY( ec );
*************** test03()
*** 117,122 ****
--- 133,141 ----
    fs::copy(from, to);
    VERIFY( fs::exists(to) );
    VERIFY( fs::file_size(to) == fs::file_size(from) );
+ 
+   remove(from);
+   remove(to);
  }
  
  // Test is_directory(f) case.
*************** test04()
*** 129,134 ****
--- 148,184 ----
    auto to = __gnu_test::nonexistent_path();
    std::error_code ec;
  
+   create_directories(from/"a/b/c");
+ 
+   {
+     __gnu_test::scoped_file f(to);
+     copy(from, to, ec);
+     VERIFY( ec );
+   }
+ 
+   __gnu_test::scoped_file f1(from/"a/f1");
+   std::ofstream{f1.path} << "file one";
+   __gnu_test::scoped_file f2(from/"a/b/f2");
+   std::ofstream{f2.path} << "file two";
+ 
+   copy(from, to, ec);
+   VERIFY( !ec );
+   VERIFY( exists(to) && is_empty(to) );
+   remove(to);
+ 
+   copy(from, to, fs::copy_options::recursive, ec);
+   VERIFY( !ec );
+   VERIFY( exists(to) && !is_empty(to) );
+   VERIFY( is_regular_file(to/"a/f1") && !is_empty(to/"a/f1") );
+   VERIFY( file_size(from/"a/f1") == file_size(to/"a/f1") );
+   VERIFY( is_regular_file(to/"a/b/f2") && !is_empty(to/"a/b/f2") );
+   VERIFY( file_size(from/"a/b/f2") == file_size(to/"a/b/f2") );
+   VERIFY( is_directory(to/"a/b/c") && is_empty(to/"a/b/c") );
+ 
+   f1.path.clear();
+   f2.path.clear();
+   remove_all(from, ec);
+   remove_all(to, ec);
  }
  
  // Test no-op cases.
*************** test05()
*** 138,147 ****
    bool test __attribute__((unused)) = false;
  
    auto to = __gnu_test::nonexistent_path();
!   std::error_code ec;
  
!   fs::copy("/", to, fs::copy_options::create_symlinks, ec);
!   VERIFY( !ec );
  }
  
  int
--- 188,197 ----
    bool test __attribute__((unused)) = false;
  
    auto to = __gnu_test::nonexistent_path();
!   std::error_code ec = std::make_error_code(std::errc::invalid_argument);
  
!   fs::copy("/", to, fs::copy_options::copy_symlinks, ec);
!   VERIFY( !ec );  // Previous value should be cleared (LWG 2683)
  }
  
  int
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/copy_file.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/copy_file.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/copy_file.cc	Wed May 25 15:43:12 2016
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/copy_file.cc	Mon Dec 12 15:00:43 2016
*************** test01()
*** 73,78 ****
--- 73,81 ----
    VERIFY( !ec );
    VERIFY( exists(to) );
    VERIFY( file_size(to) == file_size(from) );
+ 
+   remove(from);
+   remove(to);
  }
  
  int
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/create_directories.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/create_directories.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/create_directories.cc	Wed Oct  7 21:00:50 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/create_directories.cc	Mon Jul  4 13:52:21 2016
*************** test01()
*** 65,71 ****
    VERIFY( b );
    VERIFY( is_directory(p/"./d4/../d5") );
  
!   remove_all(p, ec);
  }
  
  int
--- 65,72 ----
    VERIFY( b );
    VERIFY( is_directory(p/"./d4/../d5") );
  
!   std::uintmax_t count = remove_all(p, ec);
!   VERIFY( count == 6 );
  }
  
  int
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/create_symlink.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/create_symlink.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/create_symlink.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/create_symlink.cc	Mon Dec 12 15:00:43 2016
***************
*** 0 ****
--- 1,92 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-lstdc++fs -std=gnu++11" }
+ // { dg-require-filesystem-ts "" }
+ 
+ #include <experimental/filesystem>
+ #include <testsuite_hooks.h>
+ #include <testsuite_fs.h>
+ 
+ namespace fs = std::experimental::filesystem;
+ 
+ void
+ test01()
+ {
+   std::error_code ec, ec2;
+   __gnu_test::scoped_file f;
+   auto tgt = f.path;
+ 
+   // Test empty path.
+   fs::path p;
+   create_symlink(tgt, p, ec );
+   VERIFY( ec );
+   try
+   {
+     create_symlink(tgt, p);
+   }
+   catch (const std::experimental::filesystem::filesystem_error& ex)
+   {
+     ec2 = ex.code();
+     VERIFY( ex.path1() == tgt );
+     VERIFY( ex.path2() == p );
+   }
+   VERIFY( ec2 == ec );
+ }
+ 
+ void
+ test02()
+ {
+   std::error_code ec, ec2;
+   __gnu_test::scoped_file f;
+   auto tgt = f.path;
+ 
+   // Test non-existent path
+   auto p = __gnu_test::nonexistent_path();
+   VERIFY( !exists(p) );
+ 
+   create_symlink(tgt, p, ec); // create the symlink once
+   VERIFY( !ec );
+   VERIFY( exists(p) );
+   VERIFY( is_symlink(p) );
+   remove(p);
+   create_symlink(tgt, p); // create the symlink again
+   VERIFY( exists(p) );
+   VERIFY( is_symlink(p) );
+ 
+   create_symlink(tgt, p, ec); // Try to create existing symlink
+   VERIFY( ec );
+   try
+   {
+     create_symlink(tgt, p);
+   }
+   catch (const std::experimental::filesystem::filesystem_error& ex)
+   {
+     ec2 = ex.code();
+     VERIFY( ex.path1() == tgt );
+     VERIFY( ex.path2() == p );
+   }
+   VERIFY( ec2 == ec );
+ 
+   remove(p);
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/equivalent.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/equivalent.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/equivalent.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/equivalent.cc	Mon Dec 12 15:00:43 2016
***************
*** 0 ****
--- 1,73 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-lstdc++fs -std=gnu++11" }
+ // { dg-require-filesystem-ts "" }
+ 
+ #include <experimental/filesystem>
+ #include <testsuite_fs.h>
+ #include <testsuite_hooks.h>
+ 
+ namespace fs = std::experimental::filesystem;
+ 
+ 
+ void
+ test01()
+ {
+   auto p1 = __gnu_test::nonexistent_path();
+   auto p2 = __gnu_test::nonexistent_path();
+   std::error_code ec;
+   bool result;
+ 
+   result = equivalent(p1, p2, ec);
+   VERIFY( ec );
+   VERIFY( !result );
+   const auto bad_ec = ec;
+ 
+   __gnu_test::scoped_file f1(p1);
+   result = equivalent(p1, p2, ec);
+   VERIFY( !ec );
+   VERIFY( !result );
+ 
+   __gnu_test::scoped_file f2(p2);
+   ec = bad_ec;
+   result = equivalent(p1, p2, ec);
+   VERIFY( !ec );
+   VERIFY( !result );
+ 
+   auto p3 = __gnu_test::nonexistent_path();
+   create_hard_link(p1, p3, ec);
+   if (ec)
+     return;  // hard links not supported
+   __gnu_test::scoped_file f3(p3, __gnu_test::scoped_file::adopt_file);
+ 
+   ec = bad_ec;
+   result = equivalent(p1, p3, ec);
+   VERIFY( !ec );
+   VERIFY( result );
+ 
+   ec = bad_ec;
+   result = equivalent(p2, p3, ec);
+   VERIFY( !ec );
+   VERIFY( !result );
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/exists.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/exists.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/exists.cc	Wed Oct  7 21:00:50 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/exists.cc	Mon Dec 12 15:00:43 2016
*************** test01()
*** 34,39 ****
--- 34,51 ----
    VERIFY( exists(path{"."}) );
    VERIFY( exists(path{".."}) );
    VERIFY( exists(std::experimental::filesystem::current_path()) );
+ 
+   std::error_code ec = std::make_error_code(std::errc::invalid_argument);
+   VERIFY( exists(path{"/"}, ec) );
+   VERIFY( !ec );
+   VERIFY( exists(path{"/."}, ec) );
+   VERIFY( !ec );
+   VERIFY( exists(path{"."}, ec) );
+   VERIFY( !ec );
+   VERIFY( exists(path{".."}, ec) );
+   VERIFY( !ec );
+   VERIFY( exists(std::experimental::filesystem::current_path(), ec) );
+   VERIFY( !ec );
  }
  
  void
*************** test02()
*** 43,48 ****
--- 55,64 ----
  
    path rel = __gnu_test::nonexistent_path();
    VERIFY( !exists(rel) );
+ 
+   std::error_code ec = std::make_error_code(std::errc::invalid_argument);
+   VERIFY( !exists(rel, ec) );
+   VERIFY( !ec ); // DR 2725
  }
  
  void
*************** test03()
*** 52,57 ****
--- 68,105 ----
  
    path abs = absolute(__gnu_test::nonexistent_path());
    VERIFY( !exists(abs) );
+ 
+   std::error_code ec = std::make_error_code(std::errc::invalid_argument);
+   VERIFY( !exists(abs, ec) );
+   VERIFY( !ec ); // DR 2725
+ }
+ 
+ void
+ test04()
+ {
+   using perms = std::experimental::filesystem::perms;
+   path p = __gnu_test::nonexistent_path();
+   create_directory(p);
+   permissions(p, perms::all | perms::remove_perms);
+ 
+   auto unr = p / "unreachable";
+   std::error_code ec;
+   VERIFY( !exists(unr, ec) );
+   VERIFY( ec == std::errc::permission_denied );
+   ec.clear();
+   try
+   {
+     exists(unr);
+   }
+   catch(const std::experimental::filesystem::filesystem_error& ex)
+   {
+     ec = ex.code();
+     VERIFY( ex.path1() == unr );
+   }
+   VERIFY( ec == std::errc::permission_denied );
+ 
+   permissions(p, perms::owner_all);
+   remove(p);
  }
  
  int
*************** main()
*** 60,63 ****
--- 108,112 ----
    test01();
    test02();
    test03();
+   test04();
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/is_empty.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/is_empty.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/is_empty.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/is_empty.cc	Mon Dec 12 15:00:43 2016
***************
*** 0 ****
--- 1,108 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-lstdc++fs -std=gnu++11" }
+ // { dg-require-filesystem-ts "" }
+ 
+ #include <experimental/filesystem>
+ #include <testsuite_hooks.h>
+ #include <testsuite_fs.h>
+ 
+ namespace fs = std::experimental::filesystem;
+ 
+ void
+ test01()
+ {
+   auto p = __gnu_test::nonexistent_path();
+   create_directory(p);
+   permissions(p, fs::perms::none);
+   std::error_code ec, ec2;
+ 
+   bool result = fs::is_empty(p, ec);
+   VERIFY( ec == std::make_error_code(std::errc::permission_denied) );
+   VERIFY( !result );
+ 
+   try {
+     fs::is_empty(p);
+   } catch (const fs::filesystem_error& e) {
+     ec2 = e.code();
+   }
+   VERIFY( ec2 == ec );
+ 
+   result = fs::is_empty(p/"f", ec);
+   VERIFY( ec == std::make_error_code(std::errc::permission_denied) );
+   VERIFY( !result );
+ 
+   try {
+     fs::is_empty(p/"f");
+   } catch (const fs::filesystem_error& e) {
+     ec2 = e.code();
+   }
+   VERIFY( ec2 == ec );
+ 
+   permissions(p, fs::perms::owner_all, ec);
+   remove_all(p, ec);
+ }
+ 
+ void
+ test02()
+ {
+   auto p = __gnu_test::nonexistent_path();
+   create_directory(p);
+   std::error_code ec, bad_ec = make_error_code(std::errc::invalid_argument);
+   bool empty;
+ 
+   ec = bad_ec;
+   empty = is_empty(p, ec);
+   VERIFY( !ec );
+   VERIFY( empty );
+   empty = is_empty(p);
+   VERIFY( empty );
+ 
+   __gnu_test::scoped_file f(p/"f");
+   ec = bad_ec;
+   empty = is_empty(f.path, ec);
+   VERIFY( !ec );
+   VERIFY( empty );
+   empty = is_empty(f.path);
+   VERIFY( empty );
+ 
+   std::ofstream{f.path.native()} << "data";
+   ec = bad_ec;
+   empty = is_empty(p, ec);
+   VERIFY( !ec );
+   VERIFY( !empty );
+   empty = is_empty(p);
+   VERIFY( !empty );
+ 
+   ec = bad_ec;
+   empty = is_empty(p, ec);
+   VERIFY( !ec );
+   VERIFY( !empty );
+   empty = is_empty(p);
+   VERIFY( !empty );
+ 
+   f.path.clear();
+   remove_all(p, ec);
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/last_write_time.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/last_write_time.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/last_write_time.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/last_write_time.cc	Mon Dec 12 15:00:43 2016
***************
*** 0 ****
--- 1,155 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-lstdc++fs -std=gnu++11" }
+ // { dg-require-filesystem-ts "" }
+ 
+ // 15.25 Permissions [fs.op.last_write_time]
+ 
+ #include <experimental/filesystem>
+ #include <testsuite_fs.h>
+ #include <testsuite_hooks.h>
+ 
+ #ifdef _GLIBCXX_HAVE_FCNTL_H
+ # include <fcntl.h>
+ #endif
+ #if _GLIBCXX_HAVE_UTIME_H
+ # include <utime.h>
+ #endif
+ 
+ using time_type = std::experimental::filesystem::file_time_type;
+ 
+ void
+ test01()
+ {
+   // read times
+ 
+   auto p = __gnu_test::nonexistent_path();
+   std::error_code ec;
+   time_type mtime = last_write_time(p, ec);
+   VERIFY( ec );
+   VERIFY( ec == std::make_error_code(std::errc::no_such_file_or_directory) );
+ #if __cpp_exceptions
+   bool caught = false;
+   try {
+     mtime = last_write_time(p);
+   } catch (std::system_error const& e) {
+     caught = true;
+     ec = e.code();
+   }
+   VERIFY( caught );
+   VERIFY( ec );
+   VERIFY( ec == std::make_error_code(std::errc::no_such_file_or_directory) );
+ #endif
+ 
+   __gnu_test::scoped_file file(p);
+   VERIFY( exists(p) );
+   mtime = last_write_time(p, ec);
+   VERIFY( !ec );
+   VERIFY( mtime <= time_type::clock::now() );
+   VERIFY( mtime == last_write_time(p) );
+ 
+   auto end_of_time = time_type::duration::max();
+   auto last_second
+     = std::chrono::duration_cast<std::chrono::seconds>(end_of_time).count();
+   if (last_second > std::numeric_limits<std::time_t>::max())
+     return; // can't test overflow
+ 
+ #if _GLIBCXX_USE_UTIMENSAT
+   struct ::timespec ts[2];
+   ts[0].tv_sec = 0;
+   ts[0].tv_nsec = UTIME_NOW;
+   ts[1].tv_sec = std::numeric_limits<std::time_t>::max() - 1;
+   ts[1].tv_nsec = 0;
+   VERIFY( !::utimensat(AT_FDCWD, p.c_str(), ts, 0) );
+ #elif _GLIBCXX_HAVE_UTIME_H
+   ::utimbuf times;
+   times.modtime = std::numeric_limits<std::time_t>::max() - 1;
+   times.actime = std::numeric_limits<std::time_t>::max() - 1;
+   VERIFY( !::utime(p.c_str(), &times) );
+ #else
+   return;
+ #endif
+ 
+   mtime = last_write_time(p, ec);
+   VERIFY( ec );
+   VERIFY( ec == std::make_error_code(std::errc::value_too_large) );
+   VERIFY( mtime == time_type::min() );
+ 
+ #if __cpp_exceptions
+   caught = false;
+   try {
+     mtime = last_write_time(p);
+   } catch (std::system_error const& e) {
+     caught = true;
+     ec = e.code();
+   }
+   VERIFY( caught );
+   VERIFY( ec );
+   VERIFY( ec == std::make_error_code(std::errc::value_too_large) );
+ #endif
+ }
+ 
+ bool approx_equal(time_type file_time, time_type expected)
+ {
+   auto delta = expected - file_time;
+   if (delta < delta.zero())
+     delta = -delta;
+   return delta < std::chrono::seconds(1);
+ }
+ 
+ void
+ test02()
+ {
+   // write times
+ 
+   __gnu_test::scoped_file f;
+   std::error_code ec;
+   time_type time;
+ 
+   time = last_write_time(f.path);
+   last_write_time(f.path, time, ec);
+   VERIFY( !ec );
+   VERIFY( approx_equal(last_write_time(f.path), time) );
+ 
+   time -= std::chrono::milliseconds(1000 * 60 * 10 + 15);
+   last_write_time(f.path, time, ec);
+   VERIFY( !ec );
+   VERIFY( approx_equal(last_write_time(f.path), time) );
+ 
+   time += std::chrono::milliseconds(1000 * 60 * 20 + 15);
+   last_write_time(f.path, time, ec);
+   VERIFY( !ec );
+   VERIFY( approx_equal(last_write_time(f.path), time) );
+ 
+   time = time_type();
+   last_write_time(f.path, time, ec);
+   VERIFY( !ec );
+   VERIFY( approx_equal(last_write_time(f.path), time) );
+ 
+   time -= std::chrono::milliseconds(1000 * 60 * 10 + 15);
+   last_write_time(f.path, time, ec);
+   VERIFY( !ec );
+   VERIFY( approx_equal(last_write_time(f.path), time) );
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/permissions.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/permissions.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/permissions.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/permissions.cc	Mon Dec 12 15:00:43 2016
***************
*** 0 ****
--- 1,152 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-std=gnu++11 -lstdc++fs" }
+ // { dg-require-filesystem-ts "" }
+ 
+ // 15.26 Permissions [fs.op.permissions]
+ 
+ #include <experimental/filesystem>
+ #include <testsuite_fs.h>
+ #include <testsuite_hooks.h>
+ 
+ void
+ test01()
+ {
+   bool test __attribute__((unused)) = true;
+   using perms = std::experimental::filesystem::perms;
+ 
+   auto p = __gnu_test::nonexistent_path();
+ 
+   __gnu_test::scoped_file f(p);
+   VERIFY( exists(p) );
+   permissions(p, perms::owner_all);
+   VERIFY( status(p).permissions() == perms::owner_all );
+   permissions(p, perms::group_read | perms::add_perms);
+   VERIFY( status(p).permissions() == (perms::owner_all | perms::group_read) );
+   permissions(p, perms::group_read | perms::remove_perms);
+   VERIFY( status(p).permissions() == perms::owner_all );
+ }
+ 
+ void
+ test02()
+ {
+   using perms = std::experimental::filesystem::perms;
+ 
+   auto p = __gnu_test::nonexistent_path();
+ 
+   std::error_code ec;
+   permissions(p, perms::owner_all, ec);
+   VERIFY( ec );
+ 
+   __gnu_test::scoped_file f(p);
+   VERIFY( exists(p) );
+ 
+   ec = std::make_error_code(std::errc::invalid_argument);
+   permissions(p, perms::owner_all, ec);
+   VERIFY( !ec );
+   VERIFY( status(p).permissions() == perms::owner_all );
+   permissions(p, perms::group_read | perms::add_perms, ec);
+   VERIFY( !ec );
+   VERIFY( status(p).permissions() == (perms::owner_all | perms::group_read) );
+   permissions(p, perms::group_read | perms::remove_perms, ec);
+   VERIFY( !ec );
+   VERIFY( status(p).permissions() == perms::owner_all );
+ }
+ 
+ void
+ test03()
+ {
+   using perms = std::experimental::filesystem::perms;
+ 
+   __gnu_test::scoped_file f;
+   VERIFY( exists(f.path) );
+ 
+   auto p = __gnu_test::nonexistent_path();
+   create_symlink(f.path, p);
+ 
+   std::error_code ec, ec2;
+   permissions(p, perms::owner_all | perms::symlink_nofollow, ec);
+   try
+   {
+     permissions(p, perms::owner_all | perms::symlink_nofollow);
+   }
+   catch (const std::experimental::filesystem::filesystem_error& ex)
+   {
+     ec2 = ex.code();
+     VERIFY( ex.path1() == p );
+   }
+   // Both calls should succeed, or both should fail with same error:
+   VERIFY( ec == ec2 );
+ 
+   remove(p);
+ }
+ 
+ void
+ test04()
+ {
+   using perms = std::experimental::filesystem::perms;
+ 
+   auto p = __gnu_test::nonexistent_path();
+   create_symlink(__gnu_test::nonexistent_path(), p);
+ 
+   std::error_code ec, ec2;
+   permissions(p, perms::owner_all, ec);
+   VERIFY( ec );
+   try
+   {
+     permissions(p, perms::owner_all);
+   }
+   catch (const std::experimental::filesystem::filesystem_error& ex)
+   {
+     ec2 = ex.code();
+     VERIFY( ex.path1() == p );
+   }
+   VERIFY( ec == ec2 );
+ 
+   remove(p);
+ }
+ 
+ void
+ test05()
+ {
+   using perms = std::experimental::filesystem::perms;
+   std::error_code ec;
+ 
+   __gnu_test::scoped_file f;
+   auto p = perms::owner_write;
+ 
+   // symlink_nofollow should not give an error for non-symlinks
+   permissions(f.path, p|perms::symlink_nofollow, ec);
+   VERIFY( !ec );
+   auto st = status(f.path);
+   VERIFY( st.permissions() == p );
+   p |= perms::owner_read;
+   permissions(f.path, p|perms::symlink_nofollow, ec);
+   st = status(f.path);
+   VERIFY( st.permissions() == p );
+ }
+ 
+ int
+ main()
+ {
+   test01();
+   test02();
+   test03();
+   test04();
+   test05();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/read_symlink.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/read_symlink.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/read_symlink.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/read_symlink.cc	Mon Dec 12 15:00:43 2016
***************
*** 0 ****
--- 1,50 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-lstdc++fs -std=gnu++11" }
+ // { dg-require-filesystem-ts "" }
+ 
+ #include <experimental/filesystem>
+ #include <testsuite_hooks.h>
+ #include <testsuite_fs.h>
+ 
+ namespace fs = std::experimental::filesystem;
+ 
+ void
+ test01()
+ {
+   auto p = __gnu_test::nonexistent_path();
+   std::error_code ec;
+ 
+   read_symlink(p, ec);
+   VERIFY( ec );
+ 
+   fs::path tgt = ".";
+   create_symlink(tgt, p);
+ 
+   auto result = read_symlink(p, ec);
+   VERIFY( !ec );
+   VERIFY( result == tgt );
+ 
+   remove(p);
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/remove_all.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/remove_all.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/remove_all.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/remove_all.cc	Mon Dec 12 15:00:43 2016
***************
*** 0 ****
--- 1,91 ----
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-options "-lstdc++fs -std=gnu++11" }
+ // { dg-require-filesystem-ts "" }
+ 
+ #include <experimental/filesystem>
+ #include <testsuite_hooks.h>
+ #include <testsuite_fs.h>
+ 
+ namespace fs = std::experimental::filesystem;
+ 
+ void
+ test01()
+ {
+   std::error_code ec;
+   std::uintmax_t n;
+ 
+   n = fs::remove_all("", ec);
+   VERIFY( ec );
+   VERIFY( n == std::uintmax_t(-1) );
+ 
+   auto p = __gnu_test::nonexistent_path();
+   ec.clear();
+   n = remove_all(p, ec);
+   VERIFY( ec );
+   VERIFY( n == std::uintmax_t(-1) );
+ 
+   const auto bad_ec = ec;
+   auto link = __gnu_test::nonexistent_path();
+   create_symlink(p, link);  // dangling symlink
+   ec = bad_ec;
+   n = remove_all(link, ec);
+   VERIFY( !ec );
+   VERIFY( n == 1 );
+   VERIFY( !exists(symlink_status(link)) ); // DR 2721
+ 
+   __gnu_test::scoped_file f(p);
+   create_symlink(p, link);
+   ec = bad_ec;
+   n = remove_all(link, ec);
+   VERIFY( !ec );
+   VERIFY( n == 1 );
+   VERIFY( !exists(symlink_status(link)) );  // The symlink is removed, but
+   VERIFY( exists(p) );                      // its target is not.
+ 
+   auto dir = __gnu_test::nonexistent_path();
+   create_directories(dir/"a/b/c");
+   ec = bad_ec;
+   n = remove_all(dir/"a", ec);
+   VERIFY( !ec );
+   VERIFY( n == 3 );
+   VERIFY( exists(dir) );
+   VERIFY( !exists(dir/"a") );
+ 
+   create_directories(dir/"a/b/c");
+   __gnu_test::scoped_file a1(dir/"a/1");
+   __gnu_test::scoped_file a2(dir/"a/2");
+   __gnu_test::scoped_file b1(dir/"a/b/1");
+   __gnu_test::scoped_file b2(dir/"a/b/2");
+   ec = bad_ec;
+   n = remove_all(dir, ec);
+   VERIFY( !ec );
+   VERIFY( n == 8 );
+   VERIFY( !exists(dir) );
+ 
+   a1.path.clear();
+   a2.path.clear();
+   b1.path.clear();
+   b2.path.clear();
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/temp_directory_path.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/temp_directory_path.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/operations/temp_directory_path.cc	Wed Oct  7 21:00:50 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/operations/temp_directory_path.cc	Mon Dec 12 15:00:43 2016
*************** test01()
*** 46,51 ****
--- 46,52 ----
  
    std::error_code ec;
    fs::path p1 = fs::temp_directory_path(ec);
+   VERIFY( !ec );
    VERIFY( exists(p1) );
  
    fs::path p2 = fs::temp_directory_path();
*************** test02()
*** 65,70 ****
--- 66,72 ----
    std::error_code ec;
    fs::path p = fs::temp_directory_path(ec);
    VERIFY( ec );
+   VERIFY( p == fs::path() );
  
    std::error_code ec2;
    try {
*************** test02()
*** 75,84 ****
--- 77,130 ----
    VERIFY( ec2 == ec );
  }
  
+ void
+ test03()
+ {
+   auto p = __gnu_test::nonexistent_path();
+   create_directories(p/"tmp");
+   permissions(p, fs::perms::none);
+   setenv("TMPDIR", (p/"tmp").c_str(), 1);
+   std::error_code ec;
+   auto r = fs::temp_directory_path(ec); // libstdc++/PR71337
+   VERIFY( ec == std::make_error_code(std::errc::permission_denied) );
+   VERIFY( r == fs::path() );
+ 
+   std::error_code ec2;
+   try {
+     fs::temp_directory_path();
+   } catch (const fs::filesystem_error& e) {
+     ec2 = e.code();
+   }
+   VERIFY( ec2 == ec );
+ 
+   permissions(p, fs::perms::owner_all, ec);
+   remove_all(p, ec);
+ }
+ 
+ void
+ test04()
+ {
+   __gnu_test::scoped_file f;
+   setenv("TMPDIR", f.path.c_str(), 1);
+   std::error_code ec;
+   auto r = fs::temp_directory_path(ec);
+   VERIFY( ec == std::make_error_code(std::errc::not_a_directory) );
+   VERIFY( r == fs::path() );
+ 
+   std::error_code ec2;
+   try {
+     fs::temp_directory_path();
+   } catch (const fs::filesystem_error& e) {
+     ec2 = e.code();
+   }
+   VERIFY( ec2 == ec );
+ }
  
  int
  main()
  {
    test01();
    test02();
+   test03();
+   test04();
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/path/construct/range.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/path/construct/range.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/path/construct/range.cc	Wed Oct  7 21:00:50 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/path/construct/range.cc	Mon Dec 12 15:00:43 2016
***************
*** 1,4 ****
! // { dg-options "-std=gnu++11 -lstdc++fs" }
  // { dg-require-filesystem-ts "" }
  
  // Copyright (C) 2014-2015 Free Software Foundation, Inc.
--- 1,4 ----
! // { dg-options "-lstdc++fs -std=gnu++11" }
  // { dg-require-filesystem-ts "" }
  
  // Copyright (C) 2014-2015 Free Software Foundation, Inc.
***************
*** 23,28 ****
--- 23,29 ----
  #include <experimental/filesystem>
  #include <string>
  #include <testsuite_fs.h>
+ #include <testsuite_iterators.h>
  
  using std::experimental::filesystem::path;
  using __gnu_test::compare_paths;
*************** test01()
*** 53,58 ****
--- 54,106 ----
      compare_paths(p1, p7);
      compare_paths(p1, p8);
  #endif
+ 
+     using __gnu_test::test_container;
+     using __gnu_test::input_iterator_wrapper;
+     // Test with input iterators and const value_types
+ 
+     test_container<char, input_iterator_wrapper>
+       r1((char*)s.c_str(), (char*)s.c_str() + s.size());
+     path p9(r1.begin(), r1.end());
+     compare_paths(p1, p9);
+ 
+     test_container<char, input_iterator_wrapper>
+       r2((char*)s.c_str(), (char*)s.c_str() + s.size() + 1); // includes null-terminator
+     path p10(r2.begin());
+     compare_paths(p1, p10);
+ 
+     test_container<const char, input_iterator_wrapper>
+       r3(s.c_str(), s.c_str() + s.size());
+     path p11(r3.begin(), r3.end());
+     compare_paths(p1, p11);
+ 
+     test_container<const char, input_iterator_wrapper>
+       r4(s.c_str(), s.c_str() + s.size() + 1); // includes null-terminator
+     path p12(r4.begin());
+     compare_paths(p1, p12);
+ 
+ #if _GLIBCXX_USE_WCHAR_T
+     // Test with input iterators and const value_types
+     test_container<wchar_t, input_iterator_wrapper>
+       r5((wchar_t*)ws.c_str(), (wchar_t*)ws.c_str() + ws.size());
+     path p13(r5.begin(), r5.end());
+     compare_paths(p1, p13);
+ 
+     test_container<wchar_t, input_iterator_wrapper>
+       r6((wchar_t*)ws.c_str(), (wchar_t*)ws.c_str() + ws.size() + 1); // includes null-terminator
+     path p14(r6.begin());
+     compare_paths(p1, p14);
+ 
+     test_container<const wchar_t, input_iterator_wrapper>
+       r7(ws.c_str(), ws.c_str() + ws.size());
+     path p15(r7.begin(), r7.end());
+     compare_paths(p1, p15);
+ 
+     test_container<const wchar_t, input_iterator_wrapper>
+       r8(ws.c_str(), ws.c_str() + ws.size() + 1); // includes null-terminator
+     path p16(r8.begin());
+     compare_paths(p1, p16);
+ #endif
    }
  }
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/path/construct/string_view.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/path/construct/string_view.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/filesystem/path/construct/string_view.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/filesystem/path/construct/string_view.cc	Mon Dec 12 15:00:43 2016
***************
*** 0 ****
--- 1,55 ----
+ // { dg-options "-lstdc++fs -std=gnu++14" }
+ // { dg-require-filesystem-ts "" }
+ 
+ // Copyright (C) 2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // 8.4.1 path constructors [path.construct]
+ 
+ #include <experimental/filesystem>
+ #include <experimental/string_view>
+ #include <string>
+ #include <testsuite_fs.h>
+ 
+ using std::experimental::filesystem::path;
+ using __gnu_test::compare_paths;
+ 
+ void
+ test01()
+ {
+   for (std::string s : __gnu_test::test_paths)
+   {
+     path p1 = s;
+     std::experimental::string_view sv(s);
+     path p2 = sv;
+     compare_paths(p1, p2);
+ 
+ #if _GLIBCXX_USE_WCHAR_T
+     std::wstring ws(s.begin(), s.end());
+     path p3 = ws;
+     std::experimental::wstring_view wsv(ws);
+     path p4 = wsv;
+     compare_paths(p1, p4);
+ #endif
+   }
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/functional/not_fn.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/functional/not_fn.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/functional/not_fn.cc	Thu Sep  3 15:10:52 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/functional/not_fn.cc	Wed Oct  5 13:51:03 2016
*************** test03()
*** 76,85 ****
--- 76,105 ----
    VERIFY( not_fn(&X::b)(x) );
  }
  
+ void
+ test04()
+ {
+   struct abstract { virtual void f() = 0; };
+   struct derived : abstract { void f() { } };
+   struct F { bool operator()(abstract&) { return false; } };
+   F f;
+   derived d;
+   VERIFY( not_fn(f)(d) );
+ }
+ 
+ void
+ test05()
+ {
+   auto nf = std::experimental::not_fn([] { return false; });
+   auto copy(nf); // PR libstdc++/70564
+ }
+ 
  int
  main()
  {
    test01();
    test02();
    test03();
+   test04();
+   test05();
  }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/1.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/1.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/1.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/1.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/2.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/2.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/2.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/3.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/3.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/3.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/3.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/4.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/4.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/4.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/4.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/5.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/5.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/5.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/5.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/6.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/6.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/assignment/6.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/assignment/6.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/cons/move.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/cons/move.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/cons/move.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/cons/move.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/cons/value.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/cons/value.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/cons/value.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/cons/value.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/cons/value.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/cons/value.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/cons/value.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/cons/value.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/make_optional.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/make_optional.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/make_optional.cc	Tue Jan 13 21:04:43 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/make_optional.cc	Tue Nov 15 14:44:15 2016
***************
*** 13,19 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 13,19 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/1.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/1.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/1.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/1.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/2.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/2.cc	Tue Jan 13 21:04:43 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/2.cc	Tue Nov 15 14:44:15 2016
***************
*** 13,19 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 13,19 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/3.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/3.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/3.cc	Tue Jan 13 21:04:43 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/3.cc	Tue Nov 15 14:44:15 2016
***************
*** 13,19 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 13,19 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/4.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/4.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/4.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/4.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/5.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/5.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/5.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/observers/5.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/1.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/1.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/1.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/1.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/2.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/2.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/2.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/3.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/3.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/3.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/3.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/4.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/4.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/4.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/4.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/5.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/5.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/5.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/5.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/6.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/6.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/6.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/constexpr/relops/6.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/make_optional.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/make_optional.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/make_optional.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/make_optional.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/1.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/1.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/1.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/1.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/2.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/2.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/2.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/3.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/3.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/3.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/3.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/4.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/4.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/4.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/4.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/5.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/5.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/observers/5.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/observers/5.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/1.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/1.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/1.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/1.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/2.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/2.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/2.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/2.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/3.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/3.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/3.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/3.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/4.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/4.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/4.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/4.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/5.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/5.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/5.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/5.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/6.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/6.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/relops/6.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/relops/6.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/requirements.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/requirements.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/requirements.cc	Tue Jan 20 11:51:03 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/requirements.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/swap/1.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/swap/1.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/swap/1.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/swap/1.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/typedefs.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/typedefs.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/optional/typedefs.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/optional/typedefs.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/ratio/value.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/ratio/value.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/ratio/value.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/ratio/value.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/string_view/typedefs.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/string_view/typedefs.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/string_view/typedefs.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/string_view/typedefs.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/system_error/value.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/system_error/value.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/system_error/value.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/system_error/value.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/tuple/tuple_size.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/tuple/tuple_size.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/tuple/tuple_size.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/tuple/tuple_size.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/experimental/type_traits/value.cc gcc-5.5.0/libstdc++-v3/testsuite/experimental/type_traits/value.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/experimental/type_traits/value.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/experimental/type_traits/value.cc	Tue Nov 15 14:44:15 2016
***************
*** 14,20 ****
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a moved_to of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
--- 14,20 ----
  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  // GNU General Public License for more details.
  
! // You should have received a copy of the GNU General Public License along
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_binary_heap-62045.cc gcc-5.5.0/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_binary_heap-62045.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_binary_heap-62045.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_binary_heap-62045.cc	Wed May 17 17:18:14 2017
***************
*** 0 ****
--- 1,51 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-do run }
+ 
+ #include <ext/pb_ds/priority_queue.hpp>
+ #include <testsuite_hooks.h>
+ 
+ int count = 0;
+ 
+ struct less
+ {
+   bool operator()(int i, int j) const
+   {
+     ++count;
+     return i < j;
+   }
+ };
+ 
+ void
+ test01()
+ {
+   __gnu_pbds::priority_queue<int, less, __gnu_pbds::binary_heap_tag> c;
+   c.push(1);
+   c.push(2);
+   c.push(3);
+   c.push(4);
+   count = 0;
+   c.push(5);
+   VERIFY( count < c.size() );
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc gcc-5.5.0/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc	Wed May 17 17:18:14 2017
*************** priority_queue_link_regression_test_0()
*** 108,114 ****
  
    {
      /*
!      *  Perform operations on a binomial-heap queue.
       */
      cout << "Binary heap" << endl;
      __gnu_pbds::priority_queue<int, less<int>, binary_heap_tag> c;
--- 108,114 ----
  
    {
      /*
!      *  Perform operations on a binary-heap queue.
       */
      cout << "Binary heap" << endl;
      __gnu_pbds::priority_queue<int, less<int>, binary_heap_tag> c;
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/ext/profile/mutex_extensions_neg.cc gcc-5.5.0/libstdc++-v3/testsuite/ext/profile/mutex_extensions_neg.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/ext/profile/mutex_extensions_neg.cc	Fri Mar 20 13:26:55 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/ext/profile/mutex_extensions_neg.cc	Mon Oct  3 14:42:06 2016
***************
*** 25,28 ****
  
  #include <vector>
  
! // { dg-error "multiple inlined namespaces" "" { target *-*-* } 322 }
--- 25,28 ----
  
  #include <vector>
  
! // { dg-error "multiple inlined namespaces" "" { target *-*-* } 329 }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/ext/stdio_filebuf/char/79820.cc gcc-5.5.0/libstdc++-v3/testsuite/ext/stdio_filebuf/char/79820.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/ext/stdio_filebuf/char/79820.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/ext/stdio_filebuf/char/79820.cc	Mon Sep  4 17:09:05 2017
***************
*** 0 ****
--- 1,39 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-require-fileio "" }
+ 
+ #include <ext/stdio_filebuf.h>
+ #include <cstdio>
+ #include <cerrno>
+ #include <testsuite_hooks.h>
+ 
+ void
+ test01()
+ {
+   FILE* f = std::fopen("79820.txt", "w");
+   std::fclose(f);
+   errno = 127;
+   __gnu_cxx::stdio_filebuf<char> b(f, std::ios::out, BUFSIZ);
+   VERIFY(errno == 127); // PR libstdc++/79820
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/ext/stdio_filebuf/char/81751.cc gcc-5.5.0/libstdc++-v3/testsuite/ext/stdio_filebuf/char/81751.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/ext/stdio_filebuf/char/81751.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/ext/stdio_filebuf/char/81751.cc	Mon Sep  4 17:09:05 2017
***************
*** 0 ****
--- 1,53 ----
+ // Copyright (C) 2017 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ // { dg-require-fileio "" }
+ 
+ #include <ext/stdio_filebuf.h>
+ #include <cstdio>
+ #include <cerrno>
+ #include <testsuite_hooks.h>
+ 
+ void
+ test01()
+ {
+   FILE* out = std::fopen("81751.txt", "w");
+   std::fwrite("Some words.", 1, 10, out);
+ 
+   FILE* in1 = std::fopen("81751.txt", "r");
+   __gnu_cxx::stdio_filebuf<char> buf1(in1, std::ios::in, BUFSIZ);
+   int c = buf1.sgetc();
+   VERIFY( c == std::char_traits<char>::eof() ); // PR libstdc++/81751
+ 
+   std::fflush(out);
+   FILE* in2 = std::fopen("81751.txt", "r");
+   __gnu_cxx::stdio_filebuf<char> buf2(in2, std::ios::in, BUFSIZ);
+   c = buf2.sgetc();
+   VERIFY( c == 'S' );
+ 
+   buf1.close();
+   buf2.close();
+   std::fclose(in1);
+   std::fclose(in2);
+   std::fclose(out);
+ }
+ 
+ int
+ main()
+ {
+   test01();
+ }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/lib/libstdc++.exp gcc-5.5.0/libstdc++-v3/testsuite/lib/libstdc++.exp
*** gcc-5.4.0/libstdc++-v3/testsuite/lib/libstdc++.exp	Tue Aug 18 17:58:22 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/lib/libstdc++.exp	Sat Aug  6 12:21:33 2016
*************** proc v3-build_support { } {
*** 628,635 ****
  	set object_file [file tail $obj]
  	# Compile with "-w" so that warnings issued by the compiler
  	# do not prevent compilation.
  	if { [v3_target_compile $srcdir/util/$f $object_file "object" \
! 		  [list "incdir=$srcdir" "additional_flags=-w"]]
  	     != "" } {
  	    error "could not compile $f"
  	}
--- 628,636 ----
  	set object_file [file tail $obj]
  	# Compile with "-w" so that warnings issued by the compiler
  	# do not prevent compilation.
+ 	# Disable LTO so that ar/ranlib don't need the LTO plugin.
  	if { [v3_target_compile $srcdir/util/$f $object_file "object" \
! 		  [list "incdir=$srcdir" "additional_flags=-w -fno-lto"]]
  	     != "" } {
  	    error "could not compile $f"
  	}
*************** proc check_v3_target_little_endian { } {
*** 1894,1899 ****
--- 1895,1902 ----
      return $et_little_endian
  }
  
+ # Return 1 if the Filesystem TS is supported, 0 otherwise.
+ # Cache the result.
  proc check_v3_target_filesystem_ts { } {
      global cxxflags
      global DEFAULT_CXXFLAGS
*************** proc check_v3_target_filesystem_ts { } {
*** 1921,1927 ****
  	set et_filesystem_ts 0
  
  	# Set up and preprocess a C++ test program that depends
! 	# on debug mode activated.
  	set src filesystem_ts[pid].cc
  
  	set f [open $src "w"]
--- 1924,1930 ----
  	set et_filesystem_ts 0
  
  	# Set up and preprocess a C++ test program that depends
! 	# on the Filesystem TS feature-test macro being defined.
  	set src filesystem_ts[pid].cc
  
  	set f [open $src "w"]
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/59161.cc gcc-5.5.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/59161.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/59161.cc	Thu Jan  1 00:00:00 1970
--- gcc-5.5.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/59161.cc	Thu May 18 09:23:38 2017
***************
*** 0 ****
--- 1,69 ----
+ // { dg-do run }
+ // { dg-options "-g -O0" }
+ 
+ // Copyright (C) 2011-2016 Free Software Foundation, Inc.
+ //
+ // This file is part of the GNU ISO C++ Library.  This library is free
+ // software; you can redistribute it and/or modify it under the
+ // terms of the GNU General Public License as published by the
+ // Free Software Foundation; either version 3, or (at your option)
+ // any later version.
+ 
+ // This library is distributed in the hope that it will be useful,
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ // GNU General Public License for more details.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING3.  If not see
+ // <http://www.gnu.org/licenses/>.
+ 
+ #include <deque>
+ #include <list>
+ #include <ext/slist>
+ #include <set>
+ #include <vector>
+ #include <debug/vector>
+ #include <iostream>
+ 
+ struct C {
+   C(int& i) : ref(i) { }
+   int& ref;
+   bool operator<(const C& c) const { return ref < c.ref; }
+ };
+ 
+ int main()
+ {
+   int i = 1;
+   C c(i);
+ 
+   std::deque<C> d;
+   d.push_back(c);
+   std::deque<C>::iterator diter = d.begin();
+ // { dg-final { regexp-test diter {ref = @0x.*} } }
+ 
+   std::list<C> l;
+   l.push_back(c);
+   std::list<C>::iterator liter = l.begin();
+   // Need to ensure the list<C>::iterator::_Node typedef is in the debuginfo:
+   int tmp __attribute__((unused)) = (*liter).ref;
+ // { dg-final { regexp-test liter {ref = @0x.*} } }
+ 
+   __gnu_cxx::slist<C> sl;
+   sl.push_front(c);
+   __gnu_cxx::slist<C>::iterator sliter = sl.begin();
+ // { dg-final { regexp-test sliter {ref = @0x.*} } }
+ 
+   std::set<C> s;
+   s.insert(c);
+   std::set<C>::iterator siter = s.begin();
+ // { dg-final { regexp-test siter {ref = @0x.*} } }
+ 
+   std::vector<C> v(1, c);
+   std::vector<C>::iterator viter = v.begin();
+ // { dg-final { regexp-test viter {ref = @0x.*} } }
+ 
+   std::cout << "\n";
+   return 0;			// Mark SPOT
+ }
+ // { dg-final { gdb-test SPOT } }
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/simple.cc gcc-5.5.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/simple.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/simple.cc	Thu Nov 26 16:07:50 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/simple.cc	Thu May 18 09:23:43 2017
***************
*** 30,35 ****
--- 30,36 ----
  #include <list>
  #include <map>
  #include <set>
+ #include <vector>
  #include <ext/slist>
  
  int
*************** main()
*** 50,55 ****
--- 51,59 ----
    deq.push_back("two");
  // { dg-final { note-test deq {std::deque with 2 elements = {"one", "two"}} } }
  
+   std::deque<int>::iterator deqiter0;
+ // { dg-final { note-test deqiter0 {non-dereferenceable iterator for std::deque} } }
+ 
    std::deque<std::string>::iterator deqiter = deq.begin();
  // { dg-final { note-test deqiter {"one"} } }
  
*************** main()
*** 58,63 ****
--- 62,70 ----
    lst.push_back("two");
  // { dg-final { note-test lst {std::list = {[0] = "one", [1] = "two"}} } }
  
+   std::list<int>::iterator lstiter0;
+ // { dg-final { note-test lstiter0 {non-dereferenceable iterator for std::list} } }
+ 
    std::list<std::string>::iterator lstiter = lst.begin();
    tem = *lstiter;
  // { dg-final { note-test lstiter {"one"}} }
*************** main()
*** 73,78 ****
--- 80,88 ----
    std::map<std::string, int>::iterator mpiter = mp.begin();
  // { dg-final { note-test mpiter {{first = "zardoz", second = 23}} } }
  
+   std::map<std::string, int>::iterator mpiter0;
+ // { dg-final { note-test mpiter0 {non-dereferenceable iterator for associative container} } }
+ 
    // PR 67440
    std::set<int> intset;
    intset.insert(2);
*************** main()
*** 88,93 ****
--- 98,117 ----
    std::set<std::string>::const_iterator spciter = sp.begin();
  // { dg-final { note-test spciter {"barrel"} } }
  
+   std::set<int>::iterator spiter0;
+ // { dg-final { note-test spiter0 {non-dereferenceable iterator for associative container} } }
+ 
+   std::vector<int> v;
+   v.push_back(1);
+   v.push_back(2);
+   v.erase(v.begin());
+ // { dg-final { note-test v {std::vector of length 1, capacity 2 = {2}} } }
+   std::vector<int>::iterator viter3 = v.begin();
+ // { dg-final { note-test viter3 {2} } }
+ 
+   std::vector<int>::iterator viter0;
+ // { dg-final { note-test viter0 {non-dereferenceable iterator for std::vector} } }
+ 
    __gnu_cxx::slist<int> sll;
    sll.push_front(23);
    sll.push_front(47);
*************** main()
*** 96,101 ****
--- 120,129 ----
    __gnu_cxx::slist<int>::iterator slliter = sll.begin();
  // { dg-final { note-test slliter {47} } }
  
+   __gnu_cxx::slist<int>::iterator slliter0;
+ // { dg-final { note-test slliter0 {non-dereferenceable iterator for __gnu_cxx::slist} } }
+ 
+   std::cout << "\n";
    return 0;			// Mark SPOT
  }
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/simple11.cc gcc-5.5.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/simple11.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/simple11.cc	Mon Nov 16 23:46:56 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/libstdc++-prettyprinters/simple11.cc	Thu May 18 09:23:43 2017
***************
*** 30,35 ****
--- 30,36 ----
  #include <list>
  #include <map>
  #include <set>
+ #include <vector>
  #include <ext/slist>
  
  int
*************** main()
*** 53,58 ****
--- 54,62 ----
    std::deque<std::string>::iterator deqiter = deq.begin();
  // { dg-final { note-test deqiter {"one"} } }
  
+   std::deque<int>::iterator deqiter0;
+ // { dg-final { note-test deqiter0 {non-dereferenceable iterator for std::deque} } }
+ 
    std::list<std::string> lst;
    lst.push_back("one");
    lst.push_back("two");
*************** main()
*** 66,71 ****
--- 70,78 ----
    tem = *lstciter;
  // { dg-final { note-test lstciter {"one"}} }
  
+   std::list<int>::iterator lstiter0;
+ // { dg-final { note-test lstiter0 {non-dereferenceable iterator for std::list} } }
+ 
    std::map<std::string, int> mp;
    mp["zardoz"] = 23;
  // { dg-final { note-test mp {std::map with 1 elements = {["zardoz"] = 23}} } }
*************** main()
*** 73,78 ****
--- 80,88 ----
    std::map<std::string, int>::iterator mpiter = mp.begin();
  // { dg-final { note-test mpiter {{first = "zardoz", second = 23}} } }
  
+   std::map<std::string, int>::iterator mpiter0;
+ // { dg-final { note-test mpiter0 {non-dereferenceable iterator for associative container} } }
+ 
    // PR 67440
    const std::set<int> const_intset = {2, 3};
  // { dg-final { note-test const_intset {std::set with 2 elements = {[0] = 2, [1] = 3}} } }
*************** main()
*** 85,90 ****
--- 95,114 ----
    std::set<std::string>::const_iterator spciter = sp.begin();
  // { dg-final { note-test spciter {"barrel"} } }
  
+   std::set<int>::iterator spiter0;
+ // { dg-final { note-test spiter0 {non-dereferenceable iterator for associative container} } }
+ 
+   std::vector<int> v;
+   v.push_back(1);
+   v.push_back(2);
+   v.erase(v.begin());
+ // { dg-final { note-test v {std::vector of length 1, capacity 2 = {2}} } }
+   std::vector<int>::iterator viter3 = v.begin();
+ // { dg-final { note-test viter3 {2} } }
+ 
+   std::vector<int>::iterator viter0;
+ // { dg-final { note-test viter0 {non-dereferenceable iterator for std::vector} } }
+ 
    __gnu_cxx::slist<int> sll;
    sll.push_front(23);
    sll.push_front(47);
*************** main()
*** 93,98 ****
--- 117,126 ----
    __gnu_cxx::slist<int>::iterator slliter = sll.begin();
  // { dg-final { note-test slliter {47} } }
  
+   __gnu_cxx::slist<int>::iterator slliter0;
+ // { dg-final { note-test slliter0 {non-dereferenceable iterator for __gnu_cxx::slist} } }
+ 
+   std::cout << "\n";
    return 0;			// Mark SPOT
  }
  
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/libstdc++-xmethods/list.cc gcc-5.5.0/libstdc++-v3/testsuite/libstdc++-xmethods/list.cc
*** gcc-5.4.0/libstdc++-v3/testsuite/libstdc++-xmethods/list.cc	Tue May 26 21:28:42 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/libstdc++-xmethods/list.cc	Thu May 18 09:23:29 2017
***************
*** 18,26 ****
  // with this library; see the file COPYING3.  If not see
  // <http://www.gnu.org/licenses/>.
  
- // List xmethods only recognize the non cxx11 std::list for now.
- #define _GLIBCXX_USE_CXX11_ABI 0
- 
  #include <list>
  
  int
--- 18,23 ----
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/util/testsuite_allocator.h gcc-5.5.0/libstdc++-v3/testsuite/util/testsuite_allocator.h
*** gcc-5.4.0/libstdc++-v3/testsuite/util/testsuite_allocator.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/util/testsuite_allocator.h	Wed Feb  1 12:18:43 2017
*************** namespace __gnu_test
*** 119,124 ****
--- 119,126 ----
        tracker_allocator() = default;
        tracker_allocator(const tracker_allocator&) = default;
        tracker_allocator(tracker_allocator&&) = default;
+       tracker_allocator& operator=(const tracker_allocator&) = default;
+       tracker_allocator& operator=(tracker_allocator&&) = default;
  
        // Perfect forwarding constructor.
        template<typename... _Args>
*************** namespace __gnu_test
*** 285,291 ****
  
        Alloc& base() { return *this; }
        const Alloc& base() const  { return *this; }
!       void swap_base(Alloc& b) { swap(b, this->base()); }
  
      public:
        typedef typename check_consistent_alloc_value_type<Tp, Alloc>::value_type
--- 287,293 ----
  
        Alloc& base() { return *this; }
        const Alloc& base() const  { return *this; }
!       void swap_base(Alloc& b) { using std::swap; swap(b, this->base()); }
  
      public:
        typedef typename check_consistent_alloc_value_type<Tp, Alloc>::value_type
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/util/testsuite_fs.h gcc-5.5.0/libstdc++-v3/testsuite/util/testsuite_fs.h
*** gcc-5.4.0/libstdc++-v3/testsuite/util/testsuite_fs.h	Thu May 26 17:33:17 2016
--- gcc-5.5.0/libstdc++-v3/testsuite/util/testsuite_fs.h	Mon Dec 12 15:00:43 2016
***************
*** 23,29 ****
  #define _TESTSUITE_FS_H 1
  
  #include <experimental/filesystem>
! #include <iostream>
  #include <string>
  #include <cstdio>
  #include <stdlib.h>
--- 23,29 ----
  #define _TESTSUITE_FS_H 1
  
  #include <experimental/filesystem>
! #include <fstream>
  #include <string>
  #include <cstdio>
  #include <stdlib.h>
*************** namespace __gnu_test
*** 40,46 ****
    compare_paths(const std::experimental::filesystem::path& p1,
  		const std::experimental::filesystem::path& p2)
    {
-     // std::cout << "Comparing " << p1 << " and " << p2 << std::endl;
      PATH_CHK( p1, p2, string );
      PATH_CHK( p1, p2, empty );
      PATH_CHK( p1, p2, has_root_path );
--- 40,45 ----
*************** namespace __gnu_test
*** 91,95 ****
--- 90,112 ----
      return p;
    }
  
+   // RAII helper to remove a file on scope exit.
+   struct scoped_file
+   {
+     using path_type = std::experimental::filesystem::path;
+ 
+     enum adopt_file_t { adopt_file };
+ 
+     explicit
+     scoped_file(const path_type& p = nonexistent_path()) : path(p)
+     { std::ofstream{p.native()}; }
+ 
+     scoped_file(path_type p, adopt_file_t) : path(p) { }
+ 
+     ~scoped_file() { if (!path.empty()) remove(path); }
+ 
+     path_type path;
+   };
+ 
  } // namespace __gnu_test
  #endif
diff -Nrcpad gcc-5.4.0/libstdc++-v3/testsuite/util/testsuite_hooks.h gcc-5.5.0/libstdc++-v3/testsuite/util/testsuite_hooks.h
*** gcc-5.4.0/libstdc++-v3/testsuite/util/testsuite_hooks.h	Mon Jan  5 12:33:28 2015
--- gcc-5.5.0/libstdc++-v3/testsuite/util/testsuite_hooks.h	Thu May 18 15:31:13 2017
*************** namespace __gnu_test
*** 226,234 ****
    private:
      static unsigned int _M_count;
    };
!   
!   // An class of objects that can be used for validating various
!   // behaviours and guarantees of containers and algorithms defined in
    // the standard library.
    class copy_tracker
    {
--- 226,234 ----
    private:
      static unsigned int _M_count;
    };
! 
!   // A class of objects that can be used for validating various
!   // behaviors and guarantees of containers and algorithms defined in
    // the standard library.
    class copy_tracker
    {
diff -Nrcpad gcc-5.4.0/libvtv/ChangeLog gcc-5.5.0/libvtv/ChangeLog
*** gcc-5.4.0/libvtv/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/libvtv/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/lto-plugin/ChangeLog gcc-5.5.0/lto-plugin/ChangeLog
*** gcc-5.4.0/lto-plugin/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/lto-plugin/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,16 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
+ 2017-08-22  Georg-Johann Lay  <avr@gjlay.de>
+ 
+ 	Backport from 2017-07-26 gcc-7-branch r250562.
+ 
+ 	PR lto/81487
+ 	* lto-plugin.c (claim_file_handler): Use xasprintf instead of
+ 	asprintf.
+ 	[hi!=0]: Swap hi and lo arguments supplied to xasprintf.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/lto-plugin/lto-plugin.c gcc-5.5.0/lto-plugin/lto-plugin.c
*** gcc-5.4.0/lto-plugin/lto-plugin.c	Fri Feb  6 13:55:42 2015
--- gcc-5.5.0/lto-plugin/lto-plugin.c	Tue Aug 22 10:32:36 2017
*************** claim_file_handler (const struct ld_plug
*** 920,936 ****
  
    if (file->offset != 0)
      {
-       char *objname;
        /* We pass the offset of the actual file, not the archive header.
           Can't use PRIx64, because that's C99, so we have to print the
! 	 64-bit hex int as two 32-bit ones. */
!       int lo, hi, t;
        lo = file->offset & 0xffffffff;
        hi = ((int64_t)file->offset >> 32) & 0xffffffff;
!       t = hi ? asprintf (&objname, "%s@0x%x%08x", file->name, lo, hi)
! 	     : asprintf (&objname, "%s@0x%x", file->name, lo);
!       check (t >= 0, LDPL_FATAL, "asprintf failed");
!       lto_file.name = objname;
      }
    else
      {
--- 920,935 ----
  
    if (file->offset != 0)
      {
        /* We pass the offset of the actual file, not the archive header.
           Can't use PRIx64, because that's C99, so we have to print the
! 	 64-bit hex int as two 32-bit ones.  Use xasprintf instead of
! 	 asprintf because asprintf doesn't work as expected on some older
! 	 mingw32 hosts.  */
!       int lo, hi;
        lo = file->offset & 0xffffffff;
        hi = ((int64_t)file->offset >> 32) & 0xffffffff;
!       lto_file.name = hi ? xasprintf ("%s@0x%x%08x", file->name, hi, lo)
!       			 : xasprintf ("%s@0x%x", file->name, lo);
      }
    else
      {
diff -Nrcpad gcc-5.4.0/maintainer-scripts/ChangeLog gcc-5.5.0/maintainer-scripts/ChangeLog
*** gcc-5.4.0/maintainer-scripts/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/maintainer-scripts/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
diff -Nrcpad gcc-5.4.0/zlib/ChangeLog gcc-5.5.0/zlib/ChangeLog
*** gcc-5.4.0/zlib/ChangeLog	Fri Jun  3 08:41:59 2016
--- gcc-5.5.0/zlib/ChangeLog	Tue Oct 10 08:11:01 2017
***************
*** 1,3 ****
--- 1,7 ----
+ 2017-10-10  Release Manager
+ 
+ 	* GCC 5.5.0 released.
+ 
  2016-06-03  Release Manager
  
  	* GCC 5.4.0 released.
